{"text":"<commit_before>\/*\n * DISTRHO Plugin Framework (DPF)\n * Copyright (C) 2012-2019 Filipe Coelho <falktx@falktx.com>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any purpose with\n * or without fee is hereby granted, provided that the above copyright notice and this\n * permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD\n * TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN\n * NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\n * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER\n * IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN\n * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\/\n\n#ifndef DISTRHO_PLUGIN_UTILS_HPP_INCLUDED\n#define DISTRHO_PLUGIN_UTILS_HPP_INCLUDED\n\n#include \"DistrhoPlugin.hpp\"\n\nSTART_NAMESPACE_DISTRHO\n\n\/\/ -----------------------------------------------------------------------------------------------------------\n\n\/**\n   Handy class to help keep audio buffer in sync with incoming MIDI events.\n   To use it, create a local variable (on the stack) and call nextEvent() until it returns false.\n   @code\n    for (AudioMidiSyncHelper amsh(outputs, frames, midiEvents, midiEventCount); amsh.nextEvent();)\n    {\n        float* const outL = amsh.outputs[0];\n        float* const outR = amsh.outputs[1];\n\n        for (uint32_t i=0; i<amsh.midiEventCount; ++i)\n        {\n            const MidiEvent& ev(amsh.midiEvents[i]);\n            \/\/ ... do something with the midi event\n        }\n\n        renderSynth(outL, outR, amsh.frames);\n    }\n   @endcode\n\n   Some important notes when using this class:\n    1. MidiEvent::frame retains its original value, but it is useless, do not use it.\n    2. The class variable names are the same as the default ones in the run function.\n       Keep that in mind and try to avoid typos. :)\n *\/\nclass AudioMidiSyncHelper {\npublic:\n    \/** Parameters from the run function, adjusted for event sync *\/\n    float* outputs[DISTRHO_PLUGIN_NUM_OUTPUTS];\n    uint32_t frames;\n    const MidiEvent* midiEvents;\n    uint32_t midiEventCount;\n\n    \/**\n       Constructor, using values from the run function.\n    *\/\n    AudioMidiSyncHelper(float** const o, uint32_t f, const MidiEvent* m, uint32_t mc)\n        : outputs(),\n          frames(0),\n          midiEvents(m),\n          midiEventCount(0),\n          remainingFrames(f),\n          remainingMidiEventCount(mc),\n          totalFramesUsed(0)\n    {\n        for (uint i=0; i<DISTRHO_PLUGIN_NUM_OUTPUTS; ++i)\n            outputs[i] = o[i];\n    }\n\n    \/**\n       Process a batch of events untill no more are available.\n       You must not read any more values from this class after this function returns false.\n    *\/\n    bool nextEvent()\n    {\n        \/\/ nothing else to do\n        if (remainingFrames == 0)\n            return false;\n\n        \/\/ initial setup, need to find first MIDI event\n        if (totalFramesUsed == 0)\n        {\n            \/\/ no MIDI events at all in this process cycle\n            if (remainingMidiEventCount == 0)\n            {\n                frames = remainingFrames;\n                remainingFrames = 0;\n                totalFramesUsed += frames;\n                return true;\n            }\n\n            \/\/ render audio until first midi event, if needed\n            if (const uint32_t firstEventFrame = midiEvents[0].frame)\n            {\n                DISTRHO_SAFE_ASSERT_UINT2_RETURN(firstEventFrame < remainingFrames,\n                                                 firstEventFrame, remainingFrames, false);\n                frames = firstEventFrame;\n                remainingFrames -= firstEventFrame;\n                totalFramesUsed += firstEventFrame;\n                return true;\n            }\n        }\n        else\n        {\n            for (uint32_t i=0; i<DISTRHO_PLUGIN_NUM_OUTPUTS; ++i)\n                outputs[i] += frames;\n        }\n\n        \/\/ no more MIDI events available\n        if (remainingMidiEventCount == 0)\n        {\n            frames = remainingFrames;\n            midiEvents = nullptr;\n            midiEventCount = 0;\n            remainingFrames = 0;\n            totalFramesUsed += frames;\n            return true;\n        }\n\n        \/\/ if there were midi events before, increment pointer\n        if (midiEventCount != 0)\n            midiEvents += midiEventCount;\n\n        const uint32_t firstEventFrame = midiEvents[0].frame;\n        DISTRHO_SAFE_ASSERT_UINT2_RETURN(firstEventFrame >= totalFramesUsed,\n                                         firstEventFrame, totalFramesUsed, false);\n\n        midiEventCount = 1;\n        while (midiEventCount < remainingMidiEventCount)\n        {\n            if (midiEvents[midiEventCount].frame == firstEventFrame)\n                ++midiEventCount;\n            else\n                break;\n        }\n\n        frames = firstEventFrame - totalFramesUsed;\n        remainingFrames -= frames;\n        remainingMidiEventCount -= midiEventCount;\n        totalFramesUsed += frames;\n        return true;\n    }\n\nprivate:\n    \/** @internal *\/\n    uint32_t remainingFrames;\n    uint32_t remainingMidiEventCount;\n    uint32_t totalFramesUsed;\n};\n\n\/\/ -----------------------------------------------------------------------------------------------------------\n\nEND_NAMESPACE_DISTRHO\n\n#endif \/\/ DISTRHO_PLUGIN_UTILS_HPP_INCLUDED\n<commit_msg>Change AudioMidiSyncHelper to be a struct<commit_after>\/*\n * DISTRHO Plugin Framework (DPF)\n * Copyright (C) 2012-2019 Filipe Coelho <falktx@falktx.com>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any purpose with\n * or without fee is hereby granted, provided that the above copyright notice and this\n * permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD\n * TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN\n * NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\n * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER\n * IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN\n * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\/\n\n#ifndef DISTRHO_PLUGIN_UTILS_HPP_INCLUDED\n#define DISTRHO_PLUGIN_UTILS_HPP_INCLUDED\n\n#include \"DistrhoPlugin.hpp\"\n\nSTART_NAMESPACE_DISTRHO\n\n\/\/ -----------------------------------------------------------------------------------------------------------\n\n\/**\n   Handy class to help keep audio buffer in sync with incoming MIDI events.\n   To use it, create a local variable (on the stack) and call nextEvent() until it returns false.\n   @code\n    for (AudioMidiSyncHelper amsh(outputs, frames, midiEvents, midiEventCount); amsh.nextEvent();)\n    {\n        float* const outL = amsh.outputs[0];\n        float* const outR = amsh.outputs[1];\n\n        for (uint32_t i=0; i<amsh.midiEventCount; ++i)\n        {\n            const MidiEvent& ev(amsh.midiEvents[i]);\n            \/\/ ... do something with the midi event\n        }\n\n        renderSynth(outL, outR, amsh.frames);\n    }\n   @endcode\n\n   Some important notes when using this class:\n    1. MidiEvent::frame retains its original value, but it is useless, do not use it.\n    2. The class variable names are the same as the default ones in the run function.\n       Keep that in mind and try to avoid typos. :)\n *\/\nstruct AudioMidiSyncHelper\n{\n    \/** Parameters from the run function, adjusted for event sync *\/\n    float* outputs[DISTRHO_PLUGIN_NUM_OUTPUTS];\n    uint32_t frames;\n    const MidiEvent* midiEvents;\n    uint32_t midiEventCount;\n\n    \/**\n       Constructor, using values from the run function.\n    *\/\n    AudioMidiSyncHelper(float** const o, uint32_t f, const MidiEvent* m, uint32_t mc)\n        : outputs(),\n          frames(0),\n          midiEvents(m),\n          midiEventCount(0),\n          remainingFrames(f),\n          remainingMidiEventCount(mc),\n          totalFramesUsed(0)\n    {\n        for (uint i=0; i<DISTRHO_PLUGIN_NUM_OUTPUTS; ++i)\n            outputs[i] = o[i];\n    }\n\n    \/**\n       Process a batch of events untill no more are available.\n       You must not read any more values from this class after this function returns false.\n    *\/\n    bool nextEvent()\n    {\n        \/\/ nothing else to do\n        if (remainingFrames == 0)\n            return false;\n\n        \/\/ initial setup, need to find first MIDI event\n        if (totalFramesUsed == 0)\n        {\n            \/\/ no MIDI events at all in this process cycle\n            if (remainingMidiEventCount == 0)\n            {\n                frames = remainingFrames;\n                remainingFrames = 0;\n                totalFramesUsed += frames;\n                return true;\n            }\n\n            \/\/ render audio until first midi event, if needed\n            if (const uint32_t firstEventFrame = midiEvents[0].frame)\n            {\n                DISTRHO_SAFE_ASSERT_UINT2_RETURN(firstEventFrame < remainingFrames,\n                                                 firstEventFrame, remainingFrames, false);\n                frames = firstEventFrame;\n                remainingFrames -= firstEventFrame;\n                totalFramesUsed += firstEventFrame;\n                return true;\n            }\n        }\n        else\n        {\n            for (uint32_t i=0; i<DISTRHO_PLUGIN_NUM_OUTPUTS; ++i)\n                outputs[i] += frames;\n        }\n\n        \/\/ no more MIDI events available\n        if (remainingMidiEventCount == 0)\n        {\n            frames = remainingFrames;\n            midiEvents = nullptr;\n            midiEventCount = 0;\n            remainingFrames = 0;\n            totalFramesUsed += frames;\n            return true;\n        }\n\n        \/\/ if there were midi events before, increment pointer\n        if (midiEventCount != 0)\n            midiEvents += midiEventCount;\n\n        const uint32_t firstEventFrame = midiEvents[0].frame;\n        DISTRHO_SAFE_ASSERT_UINT2_RETURN(firstEventFrame >= totalFramesUsed,\n                                         firstEventFrame, totalFramesUsed, false);\n\n        midiEventCount = 1;\n        while (midiEventCount < remainingMidiEventCount)\n        {\n            if (midiEvents[midiEventCount].frame == firstEventFrame)\n                ++midiEventCount;\n            else\n                break;\n        }\n\n        frames = firstEventFrame - totalFramesUsed;\n        remainingFrames -= frames;\n        remainingMidiEventCount -= midiEventCount;\n        totalFramesUsed += frames;\n        return true;\n    }\n\nprivate:\n    \/** @internal *\/\n    uint32_t remainingFrames;\n    uint32_t remainingMidiEventCount;\n    uint32_t totalFramesUsed;\n};\n\n\/\/ -----------------------------------------------------------------------------------------------------------\n\nEND_NAMESPACE_DISTRHO\n\n#endif \/\/ DISTRHO_PLUGIN_UTILS_HPP_INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n *  about_dialog.cpp\r\n *  PHD Guiding\r\n *\r\n *  Created by Sylvain Girard.\r\n *  Copyright (c) 2013 Sylvain Girard.\r\n *  All rights reserved.\r\n *\r\n *  This source code is distributed under the following \"BSD\" license\r\n *  Redistribution and use in source and binary forms, with or without\r\n *  modification, are permitted provided that the following conditions are met:\r\n *    Redistributions of source code must retain the above copyright notice,\r\n *     this list of conditions and the following disclaimer.\r\n *    Redistributions in binary form must reproduce the above copyright notice,\r\n *     this list of conditions and the following disclaimer in the\r\n *     documentation and\/or other materials provided with the distribution.\r\n *    Neither the name of Craig Stark, Stark Labs nor the names of its\r\n *     contributors may be used to endorse or promote products derived from\r\n *     this software without specific prior written permission.\r\n *\r\n *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\n *  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\n *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r\n *  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\r\n *  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\r\n *  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\r\n *  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r\n *  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r\n *  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\r\n *  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\r\n *  POSSIBILITY OF SUCH DAMAGE.\r\n *\r\n *\/\r\n\r\n#include \"phd.h\"\r\n#include \"about_dialog.h\"\r\n#include <wx\/fs_mem.h>\r\n#include <wx\/html\/htmlwin.h>\r\n\r\nBEGIN_EVENT_TABLE(AboutDialog, wxDialog)\r\n    EVT_HTML_LINK_CLICKED(ABOUT_LINK,AboutDialog::OnLink)\r\nEND_EVENT_TABLE()\r\n\r\nAboutDialog::AboutDialog(void) :\r\nwxDialog(pFrame, wxID_ANY, _T(\"About \") APPNAME, wxDefaultPosition, wxDefaultSize, wxCAPTION | wxCLOSE_BOX)\r\n{\r\n    SetBackgroundColour(*wxWHITE);\r\n\r\n    wxBoxSizer *pSizer = new wxBoxSizer(wxHORIZONTAL);\r\n\r\n    #include \"icons\/phd2_64.png.h\"\r\n    wxBitmap phd2(wxBITMAP_PNG_FROM_DATA(phd2_64));\r\n    wxStaticBitmap *pImage = new wxStaticBitmap(this, wxID_ANY, phd2);\r\n\r\n    wxFileSystem::AddHandler(new wxMemoryFSHandler);\r\n    wxMemoryFSHandler::AddFile(\"about.html\", wxString::Format(\r\n        \"<html><body>\"\r\n        \"<h3>%s %s<\/h3>\"\r\n        \"<a href=\\\"http:\/\/openphdguiding.org\\\">PHD2 home page - openphdguiding.org<\/a><br>\"\r\n        \"<a href=\\\"https:\/\/github.com\/OpenPHDGuiding\\\">PHD2 open source project page<\/a><br><br>\"\r\n        \"<font size=\\\"2\\\">\"\r\n        \"Credits:<br>\"\r\n        \"<table CELLPADDING=0>\"\r\n        \"<tr>\"\r\n        \"<td>Craig Stark<\/td>\"\r\n        \"<td>Bret McKee<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Andy Galasso<\/td>\"\r\n        \"<td>Bernhard Reutner-Fischer<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Stefan Elste<\/td>\"\r\n        \"<td>Geoffrey Hausheer<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Jared Wellman<\/td>\"\r\n        \"<td>John Wainwright<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Sylvain Girard<\/td>\"\r\n        \"<td>Bruce Waddington<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Max Chen<\/td>\"\r\n        \"<td>Carsten Przygoda<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Hans Lambermont<\/td>\"\r\n        \"<td>David Ault<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Markus Wieczorek<\/td>\"\r\n        \"<td>Linkage<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Robin Glover<\/td>\"\r\n        \"<td>Patrick Chevalley<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Scott Edwards<\/td>\"\r\n        \"<td>Eiji Kaneshige<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Konstantin Menshikoff&nbsp;&nbsp;&nbsp;<\/td>\"\r\n        \"<td>Jakub Bartas<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Javier R<\/td>\"\r\n        \"<td>Oleh Malyi<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Tsung-Chi Wu<\/td>\"\r\n        \"<td>Raffi Enficiaud<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Sabin Fota<\/td>\"\r\n        \"<td>Dylan O'Donnell<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Katsuhiro Kojima<\/td>\"\r\n        \"<td>Simon Taylor<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Hallgeir Holien<\/td>\"\r\n        \"<td>Laurent Schmitz<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Atushi Sakauchi<\/td>\"\r\n        \"<td>Giorgio Mazzacurati<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>G\\u00FCnter Scholz<\/td>\"\r\n        \"<td>Ray Gralak<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Khalefa Algadi<\/td>\"\r\n        \"<td>David C. Partridge<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Matteo Ghellere<\/td>\"\r\n        \"<td>norma<\/td>\"\r\n        \"<tr>\"\r\n        \"<td>Edgar D. Klenske<\/td>\"\r\n        \"<td>Bernhard Sch&ouml;lkopf<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Philipp Hennig<\/td>\"\r\n        \"<td>Stephan Wenninger<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Wagner Trindade<\/td>\"\r\n        \"<td>Cyril Richard<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<\/table><br>\"\r\n        \"<br>\"\r\n        \"<br>\"\r\n        \"Copyright 2006-2013 Craig Stark<br>\"\r\n        \"Copyright 2009 Geoffrey Hausheer<br>\"\r\n        \"Copyright 2012-2013 Bret McKee<br>\"\r\n        \"Copyright 2013 Sylvain Girard<br>\"\r\n        \"Copyright 2013-2017 Andy Galasso<br>\"\r\n        \"Copyright 2013-2017 Bruce Waddington<br>\"\r\n        \"Copyright 2014 Hans Lambermont<br>\"\r\n        \"Copyright 2014 Robin Glover<br>\"\r\n        \"Copyright 2014-2017 Max Planck Society<br>\"\r\n        \"<br>\"\r\n        \"<br>\"\r\n        \"The Predictive PEC guide algorithm is based on<br>\"\r\n        \"<a href=\\\"http:\/\/dx.doi.org\/10.1109\/TCST.2015.2420629\\\">Gaussian Process Based Predictive Control<br>for Periodic Error Correction<\/a>\"\r\n        \"<\/font>\"\r\n        \"<\/body><\/html>\", APPNAME, FULLVER));\r\n    wxHtmlWindow *pHtml;\r\n    pHtml = new wxHtmlWindow(this, ABOUT_LINK, wxDefaultPosition, wxSize(380, 540), wxHW_SCROLLBAR_AUTO);\r\n    pHtml->SetBorders(0);\r\n    pHtml->LoadPage(\"memory:about.html\");\r\n    pHtml->SetSize(pHtml->GetInternalRepresentation()->GetWidth(), pHtml->GetInternalRepresentation()->GetHeight());\r\n\r\n    pSizer->Add(pImage, wxSizerFlags(0).Border(wxALL, 10));\r\n    pSizer->Add(pHtml, wxSizerFlags(0).Border(wxALL, 10));\r\n\r\n    wxBoxSizer *pTopLevelSizer = new wxBoxSizer(wxVERTICAL);\r\n    pTopLevelSizer->Add(pSizer, wxSizerFlags(0).Expand());\r\n    pTopLevelSizer->Add(CreateButtonSizer(wxOK), wxSizerFlags(0).Expand().Border(wxALL, 10));\r\n    SetSizerAndFit(pTopLevelSizer);\r\n}\r\n\r\nAboutDialog::~AboutDialog(void)\r\n{\r\n    wxMemoryFSHandler::RemoveFile(\"about.html\");\r\n}\r\n\r\nvoid AboutDialog::OnLink(wxHtmlLinkEvent & event)\r\n{\r\n    wxLaunchDefaultBrowser(event.GetLinkInfo().GetHref());\r\n}\r\n<commit_msg>add Mattia Verga to About dialog<commit_after>\/*\r\n *  about_dialog.cpp\r\n *  PHD Guiding\r\n *\r\n *  Created by Sylvain Girard.\r\n *  Copyright (c) 2013 Sylvain Girard.\r\n *  All rights reserved.\r\n *\r\n *  This source code is distributed under the following \"BSD\" license\r\n *  Redistribution and use in source and binary forms, with or without\r\n *  modification, are permitted provided that the following conditions are met:\r\n *    Redistributions of source code must retain the above copyright notice,\r\n *     this list of conditions and the following disclaimer.\r\n *    Redistributions in binary form must reproduce the above copyright notice,\r\n *     this list of conditions and the following disclaimer in the\r\n *     documentation and\/or other materials provided with the distribution.\r\n *    Neither the name of Craig Stark, Stark Labs nor the names of its\r\n *     contributors may be used to endorse or promote products derived from\r\n *     this software without specific prior written permission.\r\n *\r\n *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\n *  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\n *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r\n *  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\r\n *  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\r\n *  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\r\n *  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r\n *  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r\n *  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\r\n *  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\r\n *  POSSIBILITY OF SUCH DAMAGE.\r\n *\r\n *\/\r\n\r\n#include \"phd.h\"\r\n#include \"about_dialog.h\"\r\n#include <wx\/fs_mem.h>\r\n#include <wx\/html\/htmlwin.h>\r\n\r\nBEGIN_EVENT_TABLE(AboutDialog, wxDialog)\r\n    EVT_HTML_LINK_CLICKED(ABOUT_LINK,AboutDialog::OnLink)\r\nEND_EVENT_TABLE()\r\n\r\nAboutDialog::AboutDialog(void) :\r\nwxDialog(pFrame, wxID_ANY, _T(\"About \") APPNAME, wxDefaultPosition, wxDefaultSize, wxCAPTION | wxCLOSE_BOX)\r\n{\r\n    SetBackgroundColour(*wxWHITE);\r\n\r\n    wxBoxSizer *pSizer = new wxBoxSizer(wxHORIZONTAL);\r\n\r\n    #include \"icons\/phd2_64.png.h\"\r\n    wxBitmap phd2(wxBITMAP_PNG_FROM_DATA(phd2_64));\r\n    wxStaticBitmap *pImage = new wxStaticBitmap(this, wxID_ANY, phd2);\r\n\r\n    wxFileSystem::AddHandler(new wxMemoryFSHandler);\r\n    wxMemoryFSHandler::AddFile(\"about.html\", wxString::Format(\r\n        \"<html><body>\"\r\n        \"<h3>%s %s<\/h3>\"\r\n        \"<a href=\\\"http:\/\/openphdguiding.org\\\">PHD2 home page - openphdguiding.org<\/a><br>\"\r\n        \"<a href=\\\"https:\/\/github.com\/OpenPHDGuiding\\\">PHD2 open source project page<\/a><br><br>\"\r\n        \"<font size=\\\"2\\\">\"\r\n        \"Credits:<br>\"\r\n        \"<table CELLPADDING=0>\"\r\n        \"<tr>\"\r\n        \"<td>Craig Stark<\/td>\"\r\n        \"<td>Bret McKee<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Andy Galasso<\/td>\"\r\n        \"<td>Bernhard Reutner-Fischer<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Stefan Elste<\/td>\"\r\n        \"<td>Geoffrey Hausheer<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Jared Wellman<\/td>\"\r\n        \"<td>John Wainwright<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Sylvain Girard<\/td>\"\r\n        \"<td>Bruce Waddington<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Max Chen<\/td>\"\r\n        \"<td>Carsten Przygoda<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Hans Lambermont<\/td>\"\r\n        \"<td>David Ault<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Markus Wieczorek<\/td>\"\r\n        \"<td>Linkage<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Robin Glover<\/td>\"\r\n        \"<td>Patrick Chevalley<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Scott Edwards<\/td>\"\r\n        \"<td>Eiji Kaneshige<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Konstantin Menshikoff&nbsp;&nbsp;&nbsp;<\/td>\"\r\n        \"<td>Jakub Bartas<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Javier R<\/td>\"\r\n        \"<td>Oleh Malyi<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Tsung-Chi Wu<\/td>\"\r\n        \"<td>Raffi Enficiaud<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Sabin Fota<\/td>\"\r\n        \"<td>Dylan O'Donnell<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Katsuhiro Kojima<\/td>\"\r\n        \"<td>Simon Taylor<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Hallgeir Holien<\/td>\"\r\n        \"<td>Laurent Schmitz<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Atushi Sakauchi<\/td>\"\r\n        \"<td>Giorgio Mazzacurati<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>G\\u00FCnter Scholz<\/td>\"\r\n        \"<td>Ray Gralak<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Khalefa Algadi<\/td>\"\r\n        \"<td>David C. Partridge<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Matteo Ghellere<\/td>\"\r\n        \"<td>norma<\/td>\"\r\n        \"<tr>\"\r\n        \"<td>Edgar D. Klenske<\/td>\"\r\n        \"<td>Bernhard Sch&ouml;lkopf<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Philipp Hennig<\/td>\"\r\n        \"<td>Stephan Wenninger<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Wagner Trindade<\/td>\"\r\n        \"<td>Cyril Richard<\/td>\"\r\n        \"<\/tr>\"\r\n        \"<tr>\"\r\n        \"<td>Mattia Verga<\/td>\"\r\n        \"<td><\/td>\"\r\n        \"<\/tr>\"\r\n        \"<\/table><br>\"\r\n        \"<br>\"\r\n        \"<br>\"\r\n        \"Copyright 2006-2013 Craig Stark<br>\"\r\n        \"Copyright 2009 Geoffrey Hausheer<br>\"\r\n        \"Copyright 2012-2013 Bret McKee<br>\"\r\n        \"Copyright 2013 Sylvain Girard<br>\"\r\n        \"Copyright 2013-2017 Andy Galasso<br>\"\r\n        \"Copyright 2013-2017 Bruce Waddington<br>\"\r\n        \"Copyright 2014 Hans Lambermont<br>\"\r\n        \"Copyright 2014 Robin Glover<br>\"\r\n        \"Copyright 2014-2017 Max Planck Society<br>\"\r\n        \"<br>\"\r\n        \"<br>\"\r\n        \"The Predictive PEC guide algorithm is based on<br>\"\r\n        \"<a href=\\\"http:\/\/dx.doi.org\/10.1109\/TCST.2015.2420629\\\">Gaussian Process Based Predictive Control<br>for Periodic Error Correction<\/a>\"\r\n        \"<\/font>\"\r\n        \"<\/body><\/html>\", APPNAME, FULLVER));\r\n    wxHtmlWindow *pHtml;\r\n    pHtml = new wxHtmlWindow(this, ABOUT_LINK, wxDefaultPosition, wxSize(380, 540), wxHW_SCROLLBAR_AUTO);\r\n    pHtml->SetBorders(0);\r\n    pHtml->LoadPage(\"memory:about.html\");\r\n    pHtml->SetSize(pHtml->GetInternalRepresentation()->GetWidth(), pHtml->GetInternalRepresentation()->GetHeight());\r\n\r\n    pSizer->Add(pImage, wxSizerFlags(0).Border(wxALL, 10));\r\n    pSizer->Add(pHtml, wxSizerFlags(0).Border(wxALL, 10));\r\n\r\n    wxBoxSizer *pTopLevelSizer = new wxBoxSizer(wxVERTICAL);\r\n    pTopLevelSizer->Add(pSizer, wxSizerFlags(0).Expand());\r\n    pTopLevelSizer->Add(CreateButtonSizer(wxOK), wxSizerFlags(0).Expand().Border(wxALL, 10));\r\n    SetSizerAndFit(pTopLevelSizer);\r\n}\r\n\r\nAboutDialog::~AboutDialog(void)\r\n{\r\n    wxMemoryFSHandler::RemoveFile(\"about.html\");\r\n}\r\n\r\nvoid AboutDialog::OnLink(wxHtmlLinkEvent & event)\r\n{\r\n    wxLaunchDefaultBrowser(event.GetLinkInfo().GetHref());\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-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) 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.6  2002\/02\/01 22:40:44  peiyongz\n * sane_include\n *\n * Revision 1.5  2001\/05\/11 13:24:57  tng\n * Copyright update.\n *\n * Revision 1.4  2001\/05\/03 16:00:03  tng\n * Schema: samples update with schema\n *\n * Revision 1.3  2000\/10\/10 23:55:53  andyh\n * XMLFormatter patch, contributed by Bill Schindler.  Fix problems with\n * output to multi-byte encodings.\n *\n * Revision 1.2  2000\/08\/09 22:20:38  jpolast\n * updates for changes to sax2 core functionality.\n *\n * Revision 1.1  2000\/08\/02 19:16:14  jpolast\n * initial checkin of SAX2Print\n *\n *\n *\/\n\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/XMLUniDefs.hpp>\n#include <xercesc\/sax2\/Attributes.hpp>\n#include \"SAX2Print.hpp\"\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Local const data\n\/\/\n\/\/  Note: This is the 'safe' way to do these strings. If you compiler supports\n\/\/        L\"\" style strings, and portability is not a concern, you can use\n\/\/        those types constants directly.\n\/\/ ---------------------------------------------------------------------------\nstatic const XMLCh  gEndElement[] = { chOpenAngle, chForwardSlash, chNull };\nstatic const XMLCh  gEndPI[] = { chQuestion, chCloseAngle, chNull };\nstatic const XMLCh  gStartPI[] = { chOpenAngle, chQuestion, chNull };\nstatic const XMLCh  gXMLDecl1[] =\n{\n        chOpenAngle, chQuestion, chLatin_x, chLatin_m, chLatin_l\n    ,   chSpace, chLatin_v, chLatin_e, chLatin_r, chLatin_s, chLatin_i\n    ,   chLatin_o, chLatin_n, chEqual, chDoubleQuote, chDigit_1, chPeriod\n    ,   chDigit_0, chDoubleQuote, chSpace, chLatin_e, chLatin_n, chLatin_c\n    ,   chLatin_o, chLatin_d, chLatin_i, chLatin_n, chLatin_g, chEqual\n    ,   chDoubleQuote, chNull\n};\n\nstatic const XMLCh  gXMLDecl2[] =\n{\n        chDoubleQuote, chQuestion, chCloseAngle\n    ,   chLF, chNull\n};\n\n\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nSAX2PrintHandlers::SAX2PrintHandlers( const   char* const              encodingName\n                                    , const XMLFormatter::UnRepFlags unRepFlags\n\t\t\t\t\t\t\t\t\t, const bool\t\t\t\t\t expandNamespaces) :\n\n    fFormatter\n    (\n        encodingName\n        , this\n        , XMLFormatter::NoEscapes\n        , unRepFlags\n    ),\n\tfExpandNS ( expandNamespaces )\n{\n    \/\/\n    \/\/  Go ahead and output an XML Decl with our known encoding. This\n    \/\/  is not the best answer, but its the best we can do until we\n    \/\/  have SAX2 support.\n    \/\/\n    fFormatter << gXMLDecl1 << fFormatter.getEncodingName() << gXMLDecl2;\n}\n\nSAX2PrintHandlers::~SAX2PrintHandlers()\n{\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Overrides of the output formatter target interface\n\/\/ ---------------------------------------------------------------------------\nvoid SAX2PrintHandlers::writeChars(const XMLByte* const toWrite)\n{\n}\n\nvoid SAX2PrintHandlers::writeChars(const XMLByte* const toWrite,\n                                   const unsigned int count,\n                                   XMLFormatter* const formatter)\n{\n    \/\/ For this one, just dump them to the standard output\n    \/\/ Surprisingly, Solaris was the only platform on which\n    \/\/ required the char* cast to print out the string correctly.\n    \/\/ Without the cast, it was printing the pointer value in hex.\n    \/\/ Quite annoying, considering every other platform printed\n    \/\/ the string with the explicit cast to char* below.\n  cout.write((char *) toWrite, (int) count);\n\tcout.flush();\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Overrides of the SAX ErrorHandler interface\n\/\/ ---------------------------------------------------------------------------\nvoid SAX2PrintHandlers::error(const SAXParseException& e)\n{\n    cerr << \"\\nError at file \" << StrX(e.getSystemId())\n\t\t << \", line \" << e.getLineNumber()\n\t\t << \", char \" << e.getColumnNumber()\n         << \"\\n  Message: \" << StrX(e.getMessage()) << endl;\n}\n\nvoid SAX2PrintHandlers::fatalError(const SAXParseException& e)\n{\n    cerr << \"\\nFatal Error at file \" << StrX(e.getSystemId())\n\t\t << \", line \" << e.getLineNumber()\n\t\t << \", char \" << e.getColumnNumber()\n         << \"\\n  Message: \" << StrX(e.getMessage()) << endl;\n}\n\nvoid SAX2PrintHandlers::warning(const SAXParseException& e)\n{\n    cerr << \"\\nWarning at file \" << StrX(e.getSystemId())\n\t\t << \", line \" << e.getLineNumber()\n\t\t << \", char \" << e.getColumnNumber()\n         << \"\\n  Message: \" << StrX(e.getMessage()) << endl;\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Overrides of the SAX DTDHandler interface\n\/\/ ---------------------------------------------------------------------------\nvoid SAX2PrintHandlers::unparsedEntityDecl(const     XMLCh* const name\n                                          , const   XMLCh* const publicId\n                                          , const   XMLCh* const systemId\n                                          , const   XMLCh* const notationName)\n{\n    \/\/ Not used at this time\n}\n\n\nvoid SAX2PrintHandlers::notationDecl(const   XMLCh* const name\n                                    , const XMLCh* const publicId\n                                    , const XMLCh* const systemId)\n{\n    \/\/ Not used at this time\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Overrides of the SAX DocumentHandler interface\n\/\/ ---------------------------------------------------------------------------\nvoid SAX2PrintHandlers::characters(const     XMLCh* const    chars\n                                  , const   unsigned int    length)\n{\n    fFormatter.formatBuf(chars, length, XMLFormatter::CharEscapes);\n}\n\n\nvoid SAX2PrintHandlers::endDocument()\n{\n}\n\n\nvoid SAX2PrintHandlers::endElement(const XMLCh* const uri,\n\t\t\t\t\t\t\t\t const XMLCh* const localname,\n\t\t\t\t\t\t\t\t const XMLCh* const qname)\n{\n    \/\/ No escapes are legal here\n    fFormatter << XMLFormatter::NoEscapes << gEndElement ;\n\tif ( fExpandNS )\n\t{\n\t\tif (XMLString::compareIString(uri,XMLUni::fgEmptyString) != 0)\n\t\t\t\tfFormatter  << uri << chColon;\n\t\tfFormatter << localname << chCloseAngle;\n\t}\n\telse\n\t\tfFormatter << qname << chCloseAngle;\n}\n\n\nvoid SAX2PrintHandlers::ignorableWhitespace( const   XMLCh* const chars\n                                            ,const  unsigned int length)\n{\n    fFormatter.formatBuf(chars, length, XMLFormatter::NoEscapes);\n}\n\n\nvoid SAX2PrintHandlers::processingInstruction(const  XMLCh* const target\n                                            , const XMLCh* const data)\n{\n    fFormatter << XMLFormatter::NoEscapes << gStartPI  << target;\n    if (data)\n        fFormatter << chSpace << data;\n    fFormatter << XMLFormatter::NoEscapes << gEndPI;\n}\n\n\nvoid SAX2PrintHandlers::startDocument()\n{\n}\n\n\nvoid SAX2PrintHandlers::startElement(const   XMLCh* const    uri,\n\t\t\t\t\t\t\t\t\tconst   XMLCh* const    localname,\n\t\t\t\t\t\t\t\t\tconst   XMLCh* const    qname,\n                                    const   Attributes&\t\tattributes)\n{\n    \/\/ The name has to be representable without any escapes\n    fFormatter  << XMLFormatter::NoEscapes << chOpenAngle ;\n\tif ( fExpandNS )\n\t{\n\t\tif (XMLString::compareIString(uri,XMLUni::fgEmptyString) != 0)\n\t\t\t\tfFormatter  << uri << chColon;\n\t\tfFormatter << localname ;\n\t}\n\telse\n\t\tfFormatter << qname ;\n\n    unsigned int len = attributes.getLength();\n    for (unsigned int index = 0; index < len; index++)\n    {\n        \/\/\n        \/\/  Again the name has to be completely representable. But the\n        \/\/  attribute can have refs and requires the attribute style\n        \/\/  escaping.\n        \/\/\n        fFormatter  << XMLFormatter::NoEscapes << chSpace ;\n\t\tif ( fExpandNS )\n\t\t{\n\t\t\tif (XMLString::compareIString(attributes.getURI(index),XMLUni::fgEmptyString) != 0)\n\t\t\t\tfFormatter  << attributes.getURI(index) << chColon;\n\t\t\tfFormatter  << attributes.getLocalName(index) ;\n\t\t}\n\t\telse\n\t\t\tfFormatter  << attributes.getQName(index) ;\n\n\t\tfFormatter  << chEqual << chDoubleQuote\n                    << XMLFormatter::AttrEscapes\n\t\t            << attributes.getValue(index)\n                    << XMLFormatter::NoEscapes\n                    << chDoubleQuote;\n    }\n    fFormatter << chCloseAngle;\n}\n<commit_msg>XMLUni::fgEmptyString which is defined as \"EMPTY\" is incorrectly used as an empty string, should use XMLUni::fgZeroLenString instead<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-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) 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.7  2002\/05\/28 20:24:15  tng\n * XMLUni::fgEmptyString which is defined as \"EMPTY\" is incorrectly used as an empty string, should use XMLUni::fgZeroLenString instead\n *\n * Revision 1.6  2002\/02\/01 22:40:44  peiyongz\n * sane_include\n *\n * Revision 1.5  2001\/05\/11 13:24:57  tng\n * Copyright update.\n *\n * Revision 1.4  2001\/05\/03 16:00:03  tng\n * Schema: samples update with schema\n *\n * Revision 1.3  2000\/10\/10 23:55:53  andyh\n * XMLFormatter patch, contributed by Bill Schindler.  Fix problems with\n * output to multi-byte encodings.\n *\n * Revision 1.2  2000\/08\/09 22:20:38  jpolast\n * updates for changes to sax2 core functionality.\n *\n * Revision 1.1  2000\/08\/02 19:16:14  jpolast\n * initial checkin of SAX2Print\n *\n *\n *\/\n\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/XMLUniDefs.hpp>\n#include <xercesc\/sax2\/Attributes.hpp>\n#include \"SAX2Print.hpp\"\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Local const data\n\/\/\n\/\/  Note: This is the 'safe' way to do these strings. If you compiler supports\n\/\/        L\"\" style strings, and portability is not a concern, you can use\n\/\/        those types constants directly.\n\/\/ ---------------------------------------------------------------------------\nstatic const XMLCh  gEndElement[] = { chOpenAngle, chForwardSlash, chNull };\nstatic const XMLCh  gEndPI[] = { chQuestion, chCloseAngle, chNull };\nstatic const XMLCh  gStartPI[] = { chOpenAngle, chQuestion, chNull };\nstatic const XMLCh  gXMLDecl1[] =\n{\n        chOpenAngle, chQuestion, chLatin_x, chLatin_m, chLatin_l\n    ,   chSpace, chLatin_v, chLatin_e, chLatin_r, chLatin_s, chLatin_i\n    ,   chLatin_o, chLatin_n, chEqual, chDoubleQuote, chDigit_1, chPeriod\n    ,   chDigit_0, chDoubleQuote, chSpace, chLatin_e, chLatin_n, chLatin_c\n    ,   chLatin_o, chLatin_d, chLatin_i, chLatin_n, chLatin_g, chEqual\n    ,   chDoubleQuote, chNull\n};\n\nstatic const XMLCh  gXMLDecl2[] =\n{\n        chDoubleQuote, chQuestion, chCloseAngle\n    ,   chLF, chNull\n};\n\n\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nSAX2PrintHandlers::SAX2PrintHandlers( const   char* const              encodingName\n                                    , const XMLFormatter::UnRepFlags unRepFlags\n\t\t\t\t\t\t\t\t\t, const bool\t\t\t\t\t expandNamespaces) :\n\n    fFormatter\n    (\n        encodingName\n        , this\n        , XMLFormatter::NoEscapes\n        , unRepFlags\n    ),\n\tfExpandNS ( expandNamespaces )\n{\n    \/\/\n    \/\/  Go ahead and output an XML Decl with our known encoding. This\n    \/\/  is not the best answer, but its the best we can do until we\n    \/\/  have SAX2 support.\n    \/\/\n    fFormatter << gXMLDecl1 << fFormatter.getEncodingName() << gXMLDecl2;\n}\n\nSAX2PrintHandlers::~SAX2PrintHandlers()\n{\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Overrides of the output formatter target interface\n\/\/ ---------------------------------------------------------------------------\nvoid SAX2PrintHandlers::writeChars(const XMLByte* const toWrite)\n{\n}\n\nvoid SAX2PrintHandlers::writeChars(const XMLByte* const toWrite,\n                                   const unsigned int count,\n                                   XMLFormatter* const formatter)\n{\n    \/\/ For this one, just dump them to the standard output\n    \/\/ Surprisingly, Solaris was the only platform on which\n    \/\/ required the char* cast to print out the string correctly.\n    \/\/ Without the cast, it was printing the pointer value in hex.\n    \/\/ Quite annoying, considering every other platform printed\n    \/\/ the string with the explicit cast to char* below.\n  cout.write((char *) toWrite, (int) count);\n\tcout.flush();\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Overrides of the SAX ErrorHandler interface\n\/\/ ---------------------------------------------------------------------------\nvoid SAX2PrintHandlers::error(const SAXParseException& e)\n{\n    cerr << \"\\nError at file \" << StrX(e.getSystemId())\n\t\t << \", line \" << e.getLineNumber()\n\t\t << \", char \" << e.getColumnNumber()\n         << \"\\n  Message: \" << StrX(e.getMessage()) << endl;\n}\n\nvoid SAX2PrintHandlers::fatalError(const SAXParseException& e)\n{\n    cerr << \"\\nFatal Error at file \" << StrX(e.getSystemId())\n\t\t << \", line \" << e.getLineNumber()\n\t\t << \", char \" << e.getColumnNumber()\n         << \"\\n  Message: \" << StrX(e.getMessage()) << endl;\n}\n\nvoid SAX2PrintHandlers::warning(const SAXParseException& e)\n{\n    cerr << \"\\nWarning at file \" << StrX(e.getSystemId())\n\t\t << \", line \" << e.getLineNumber()\n\t\t << \", char \" << e.getColumnNumber()\n         << \"\\n  Message: \" << StrX(e.getMessage()) << endl;\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Overrides of the SAX DTDHandler interface\n\/\/ ---------------------------------------------------------------------------\nvoid SAX2PrintHandlers::unparsedEntityDecl(const     XMLCh* const name\n                                          , const   XMLCh* const publicId\n                                          , const   XMLCh* const systemId\n                                          , const   XMLCh* const notationName)\n{\n    \/\/ Not used at this time\n}\n\n\nvoid SAX2PrintHandlers::notationDecl(const   XMLCh* const name\n                                    , const XMLCh* const publicId\n                                    , const XMLCh* const systemId)\n{\n    \/\/ Not used at this time\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  SAX2PrintHandlers: Overrides of the SAX DocumentHandler interface\n\/\/ ---------------------------------------------------------------------------\nvoid SAX2PrintHandlers::characters(const     XMLCh* const    chars\n                                  , const   unsigned int    length)\n{\n    fFormatter.formatBuf(chars, length, XMLFormatter::CharEscapes);\n}\n\n\nvoid SAX2PrintHandlers::endDocument()\n{\n}\n\n\nvoid SAX2PrintHandlers::endElement(const XMLCh* const uri,\n\t\t\t\t\t\t\t\t const XMLCh* const localname,\n\t\t\t\t\t\t\t\t const XMLCh* const qname)\n{\n    \/\/ No escapes are legal here\n    fFormatter << XMLFormatter::NoEscapes << gEndElement ;\n\tif ( fExpandNS )\n\t{\n\t\tif (XMLString::compareIString(uri,XMLUni::fgZeroLenString) != 0)\n\t\t\t\tfFormatter  << uri << chColon;\n\t\tfFormatter << localname << chCloseAngle;\n\t}\n\telse\n\t\tfFormatter << qname << chCloseAngle;\n}\n\n\nvoid SAX2PrintHandlers::ignorableWhitespace( const   XMLCh* const chars\n                                            ,const  unsigned int length)\n{\n    fFormatter.formatBuf(chars, length, XMLFormatter::NoEscapes);\n}\n\n\nvoid SAX2PrintHandlers::processingInstruction(const  XMLCh* const target\n                                            , const XMLCh* const data)\n{\n    fFormatter << XMLFormatter::NoEscapes << gStartPI  << target;\n    if (data)\n        fFormatter << chSpace << data;\n    fFormatter << XMLFormatter::NoEscapes << gEndPI;\n}\n\n\nvoid SAX2PrintHandlers::startDocument()\n{\n}\n\n\nvoid SAX2PrintHandlers::startElement(const   XMLCh* const    uri,\n\t\t\t\t\t\t\t\t\tconst   XMLCh* const    localname,\n\t\t\t\t\t\t\t\t\tconst   XMLCh* const    qname,\n                                    const   Attributes&\t\tattributes)\n{\n    \/\/ The name has to be representable without any escapes\n    fFormatter  << XMLFormatter::NoEscapes << chOpenAngle ;\n\tif ( fExpandNS )\n\t{\n\t\tif (XMLString::compareIString(uri,XMLUni::fgZeroLenString) != 0)\n\t\t\t\tfFormatter  << uri << chColon;\n\t\tfFormatter << localname ;\n\t}\n\telse\n\t\tfFormatter << qname ;\n\n    unsigned int len = attributes.getLength();\n    for (unsigned int index = 0; index < len; index++)\n    {\n        \/\/\n        \/\/  Again the name has to be completely representable. But the\n        \/\/  attribute can have refs and requires the attribute style\n        \/\/  escaping.\n        \/\/\n        fFormatter  << XMLFormatter::NoEscapes << chSpace ;\n\t\tif ( fExpandNS )\n\t\t{\n\t\t\tif (XMLString::compareIString(attributes.getURI(index),XMLUni::fgZeroLenString) != 0)\n\t\t\t\tfFormatter  << attributes.getURI(index) << chColon;\n\t\t\tfFormatter  << attributes.getLocalName(index) ;\n\t\t}\n\t\telse\n\t\t\tfFormatter  << attributes.getQName(index) ;\n\n\t\tfFormatter  << chEqual << chDoubleQuote\n                    << XMLFormatter::AttrEscapes\n\t\t            << attributes.getValue(index)\n                    << XMLFormatter::NoEscapes\n                    << chDoubleQuote;\n    }\n    fFormatter << chCloseAngle;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n#include \"TestRequiringOptions.h\"\n\nint main(int argc, char** argv)\n{\n    ::testing::InitGoogleTest(&argc, argv);\n    assert(TestRequiringOptions::initFilename(\"Wangscape\/example\/example_options.json\"));\n    return RUN_ALL_TESTS();\n}<commit_msg>Get the options file from command line args<commit_after>#include <gtest\/gtest.h>\n#include \"TestRequiringOptions.h\"\n\nint main(int argc, char** argv)\n{\n    ::testing::InitGoogleTest(&argc, argv);\n    std::string filename;\n    if (argc < 2)\n        filename = std::string(\"Wangscape\/example\/example_options.json\");\n    else\n        filename = std::string(argv[1]);\n    std::cout << \"Using options file at \" << filename << \"\\n\";\n    assert(TestRequiringOptions::initFilename(filename));\n    return RUN_ALL_TESTS();\n}<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: LayerDialogContent.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 18:33:30 $\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 \"LayerDialogContent.hxx\"\n\n#ifndef _COM_SUN_STAR_PRESENTATION_ANIMATIONEFFECT_HPP_\n#include <com\/sun\/star\/presentation\/AnimationEffect.hpp>\n#endif\n#ifndef _COM_SUN_STAR_PRESENTATION_ANIMATIONSPEED_HPP_\n#include <com\/sun\/star\/presentation\/AnimationSpeed.hpp>\n#endif\n\n#define ITEMID_COLOR SID_COLOR_TABLE\n\n#include <svx\/gallery.hxx>\n#include <svx\/colritem.hxx>\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n\n#include \"sdattr.hxx\"\n\n#include \"LayerDialog.hrc\"\n#include \"app.hrc\"\n#include \"strings.hrc\"\n#include \"res_bmp.hrc\"\n#include \"sdresid.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#include \"drawdoc.hxx\"\n#include \"PaneManager.hxx\"\n#include \"ViewShellBase.hxx\"\n#include \"DrawViewShell.hxx\"\n\n\nusing namespace ::com::sun::star;\n\nnamespace sd {\n\n\n\nLayerDialogContent::LayerDialogContent (\n    SfxBindings* pInBindings,\n    SfxChildWindow *pCW,\n    Window* pParent,\n    const SdResId& rSdResId,\n    ViewShellBase& rBase)\n    : SfxDockingWindow (pInBindings, pCW, pParent, rSdResId),\n      maLayerTabBar (\n          static_cast<DrawViewShell*>(\n              rBase.GetPaneManager().GetViewShell(PaneManager::PT_CENTER)),\n          this,\n          SdResId(TB_LAYERS))\n{\n    FreeResource();\n\n    maLayerTabBar.Show();\n}\n\n\n\n\nLayerDialogContent::~LayerDialogContent (void)\n{\n}\n\n\n\n\nLayerTabBar& LayerDialogContent::GetLayerTabBar (void)\n{\n    return maLayerTabBar;\n}\n\n\n\n\nBOOL LayerDialogContent::Close (void)\n{\n    return SfxDockingWindow::Close();\n}\n\n\n\n\nvoid LayerDialogContent::Resize (void)\n{\n    maLayerTabBar.SetPosSizePixel (\n        Point(0,0),\n        Size(GetSizePixel().Width(), 17));\n    SfxDockingWindow::Resize();\n}\n\n\n} \/\/ end of namespace sd\n<commit_msg>INTEGRATION: CWS components1 (1.3.234); FILE MERGED 2006\/09\/25 16:56:15 af 1.3.234.2: RESYNC: (1.3-1.4); FILE MERGED 2006\/08\/22 09:37:29 af 1.3.234.1: #i68075# Transition to new drawing framework.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: LayerDialogContent.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-03 15:39: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n#include \"LayerDialogContent.hxx\"\n\n#ifndef _COM_SUN_STAR_PRESENTATION_ANIMATIONEFFECT_HPP_\n#include <com\/sun\/star\/presentation\/AnimationEffect.hpp>\n#endif\n#ifndef _COM_SUN_STAR_PRESENTATION_ANIMATIONSPEED_HPP_\n#include <com\/sun\/star\/presentation\/AnimationSpeed.hpp>\n#endif\n\n#define ITEMID_COLOR SID_COLOR_TABLE\n\n#include <svx\/gallery.hxx>\n#include <svx\/colritem.hxx>\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n\n#include \"sdattr.hxx\"\n\n#include \"LayerDialog.hrc\"\n#include \"app.hrc\"\n#include \"strings.hrc\"\n#include \"res_bmp.hrc\"\n#include \"sdresid.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#include \"drawdoc.hxx\"\n#include \"ViewShellBase.hxx\"\n#include \"DrawViewShell.hxx\"\n#include \"framework\/FrameworkHelper.hxx\"\n\nusing namespace ::com::sun::star;\n\nnamespace sd {\n\n\n\nLayerDialogContent::LayerDialogContent (\n    SfxBindings* pInBindings,\n    SfxChildWindow *pCW,\n    Window* pParent,\n    const SdResId& rSdResId,\n    ViewShellBase& rBase)\n    : SfxDockingWindow (pInBindings, pCW, pParent, rSdResId),\n      maLayerTabBar(\n          dynamic_cast<DrawViewShell*>(\n              framework::FrameworkHelper::Instance(rBase)->GetViewShell(\n                  framework::FrameworkHelper::msCenterPaneURL).get()),\n          this,\n          SdResId(TB_LAYERS))\n{\n    FreeResource();\n\n    maLayerTabBar.Show();\n}\n\n\n\n\nLayerDialogContent::~LayerDialogContent (void)\n{\n}\n\n\n\n\nLayerTabBar& LayerDialogContent::GetLayerTabBar (void)\n{\n    return maLayerTabBar;\n}\n\n\n\n\nBOOL LayerDialogContent::Close (void)\n{\n    return SfxDockingWindow::Close();\n}\n\n\n\n\nvoid LayerDialogContent::Resize (void)\n{\n    maLayerTabBar.SetPosSizePixel (\n        Point(0,0),\n        Size(GetSizePixel().Width(), 17));\n    SfxDockingWindow::Resize();\n}\n\n\n} \/\/ end of namespace sd\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 *  Author: Siddharth Choudhary (itzsid@gmail.com)\n *\n *\/\n\n#ifndef PCL_SEARCH_AUTO_TUNED_SEARCH_IMPL\n#define PCL_SEARCH_AUTO_TUNED_SEARCH_IMPL\n\n#include <pcl\/pcl_base.h>\n#include <vector>\n#include \"pcl\/search\/auto.h\"\n#include \"pcl\/search\/kdtree.h\"\n#include \"pcl\/search\/octree.h\"\n#include \"pcl\/search\/organized_neighbor.h\"\n#include <pcl\/common\/time.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::initSearchDS (int spatial_locator)\n{\n  \/\/ specifies the data-structure to be used using spatial_locator flag\n  if (spatial_locator == KDTREE)\n    \/\/ initialize kdtree\n    search_.reset (new KdTree<PointT> ());\n  else if (spatial_locator == ORGANIZED_INDEX)\n    search_.reset (new OrganizedNeighbor<PointT> ());\n  else if (spatial_locator == OCTREE)\n    search_.reset (new Octree<PointT> (0.1f));\n  else\n    PCL_ERROR (\"[pcl::search::AutotunedSearch::initSearchDS] Spatial locator (%d) unknown!\\n\", spatial_locator);\n   spatial_loc_ = spatial_locator;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::evaluateSearchMethods (const PointCloudConstPtr& cloud, const int search_type)\n{\n  \/\/ Evaluates different search data-structures for the given data and sets it to the ds having minimum time\n\tunsigned int searchIdx;\n  while (1)\n  {\n    searchIdx = rand()%(cloud->width * cloud->height);\n    if (cloud->points[searchIdx].z < 100)\n      break;\n   }\n\n  double time_kdtree, time_octree, time_organized_data;\n  if (search_type == NEAREST_K_SEARCH)\n  {\n    unsigned int no_of_neighbors = 20;\n    std::vector<int> k_indices;\n    k_indices.resize (no_of_neighbors);\n    std::vector<float> k_distances;\n    k_distances.resize (no_of_neighbors);\n    std::cout << \"\\n---------------\\nKDTree\\n---------------\\n\";\n    double time1 = getTime ();\n    search_.reset (new KdTree<PointT> ());\n    search_->setInputCloud (cloud);\n    search_->nearestKSearch (cloud->points[searchIdx], no_of_neighbors, k_indices, k_distances);\n    std::cout << \"Neighbors are:\" << std::endl;    \n    for (int i = 0; i < 20; i++)\n    {\n      std::cout << k_indices[i] << '\\t'; \n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neighbors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n\n    std::cout << \"\\n---------------\\nOrganizedData\\n---------------\\n\";\n    double time2 = getTime ();\n    search_.reset (new OrganizedNeighbor<PointT>());\n    search_->setInputCloud (cloud);\n    search_->nearestKSearch (cloud->points[searchIdx], no_of_neighbors, k_indices, k_distances);\n    std::cout << \"Neighbors are: \" << std::endl;\n    for (int i = 0;i < 20; i++)\n    {\n      std::cout << k_indices[i] << '\\t'; \n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neigbhors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n\n    std::cout << \"\\n---------------\\nOctree\\n---------------\\n\";\n    double time3 = getTime ();\n    search_.reset (new Octree<PointT> (0.1f));\n    search_->setInputCloud (cloud);\n    search_->nearestKSearch (cloud->points[searchIdx], no_of_neighbors, k_indices, k_distances);\n    std::cout << \"Neighbors are: \" << std::endl;\n    for (int i = 0;i < 20; i++)\n    {\n      std::cout << k_indices[i] << '\\t'; \n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neighbors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n    std::cout << std::endl;\n    std::cout << std::endl;\n\n    time_kdtree = time2 - time1;\n    time_organized_data = time3 - time2;\n    time_octree = getTime () - time3;\n    \n    std::cout << \"Time Taken: \" << \"KDTree: \" << time_kdtree << '\\t' <<\"OranizedData: \"  << time_organized_data << '\\t' << \"Octree: \" << time_octree << '\\t' << std::endl;\n  }\n  else if (search_type == NEAREST_RADIUS_SEARCH)\n  {\n    double searchRadius = 1.0 * ((double)rand () \/ (double)RAND_MAX);\n\n    std::vector<int> k_indices;\n    std::vector<float> k_distances;\n    std::cout << \"\\n---------------\\nKDTree\\n---------------\\n\";\n    double time1 = getTime ();\n    search_.reset (new KdTree<PointT> ());\n    search_->setInputCloud (cloud);\n    search_->radiusSearch (cloud->points[searchIdx], searchRadius, k_indices, k_distances);\n    std::cout << \"Neighbors are:\" << std::endl;\n\n    for(int i = 0;i < 20; ++i)\n    {\n      std::cout << k_indices[i] << '\\t';\n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neighbors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n\n    std::cout << \"\\n---------------\\nOrganizedData\\n---------------\\n\";\n    double time2 = getTime ();\n    search_.reset (new OrganizedNeighbor<PointT> ());\n    search_->setInputCloud (cloud);\n    search_->radiusSearch (cloud->points[searchIdx], searchRadius, k_indices, k_distances);\n    std::cout << \"Neighbors are: \" << std::endl;\n    for (int i = 0; i < 20; ++i)\n    {\n    std::cout << k_indices[i] << '\\t';\n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neigbhors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n\n    std::cout << \"\\n---------------\\nOctree\\n---------------\\n\";\n    double time3 = getTime ();\n    search_.reset (new Octree<PointT> (0.1f));\n    search_->setInputCloud (cloud);\n    search_->radiusSearch (cloud->points[searchIdx], searchRadius, k_indices, k_distances);\n    std::cout << \"Neighbors are: \" << std::endl;\n    for (int i = 0; i < 20; ++i) \n    {\n      std::cout << k_indices[i] << '\\t';\n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neighbors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n    std::cout << std::endl;\n    std::cout << std::endl;\n\n    time_kdtree = time2 - time1;\n    time_organized_data = time3 - time2;\n    time_octree = getTime () - time3;\n    \n    std::cout << \"Time Taken: \" << \"KDTree: \" << time_kdtree << '\\t' <<\"OranizedData: \"  << time_organized_data << '\\t' << \"Octree: \" << time_octree << '\\t' << std::endl;\t\n  }\n  else\n  {\n    PCL_ERROR (\"[pcl::search::AutotunedSearch::evaluateSearchMethods] Only NEAREST_K_SEARCH and NEAREST_RADIUS_SEARCH supported\\n\");\n    return (0);\n  }\n  \/\/ Set the datastructure according to which takes the minimum time\n  if (time_kdtree < time_organized_data && time_kdtree < time_octree)\n  {\n    spatial_loc_ = KDTREE;\n    search_.reset (new KdTree<PointT> ());\n  }\n  else if (time_octree < time_kdtree && time_octree < time_organized_data)\n  {\n    spatial_loc_ = OCTREE;\n    search_.reset (new Octree<PointT> (0.1f));\n  }\n  else if (time_organized_data < time_kdtree && time_organized_data < time_octree)\n  {\n    spatial_loc_ = OCTREE;\n    search_.reset (new OrganizedNeighbor<PointT> ());\n  }\n\/\/  search_->setInputCloud (cloud);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::setInputCloud (const PointCloudConstPtr &cloud, \n                                             const IndicesConstPtr &indices)\n{\n  input_ = cloud;\n  search_->setInputCloud (cloud, indices);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::setInputCloud (const PointCloudConstPtr& cloud)\n{\n  input_ = cloud;\n  search_->setInputCloud (cloud);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::nearestKSearch (const PointT &point,\n                                              int k, \n                                              std::vector<int> &k_indices, \n                                              std::vector<float> &k_sqr_distances) \n{\n  return (search_->nearestKSearch (point, k, k_indices, k_sqr_distances));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::nearestKSearch (const PointCloud &cloud, \n                                              int index, \n                                              int k, \n                                              std::vector<int> &k_indices, \n                                              std::vector<float> &k_sqr_distances) \n{\n  return (search_->nearestKSearch (cloud, index, k, k_indices, k_sqr_distances));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::nearestKSearch (int index, \n                                              int k, \n                                              std::vector<int> &k_indices, \n                                              std::vector<float> &k_sqr_distances)\n{\n  return (search_->nearestKSearch (index, k, k_indices, k_sqr_distances));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int\npcl::search::AutotunedSearch<PointT>::radiusSearch (const PointT &point, \n                                            const double radius, \n                                            std::vector<int> &k_indices, \n                                            std::vector<float> &k_distances, \n                                            int max_nn) const\n{\n  return (search_->radiusSearch (point, radius, k_indices, k_distances, max_nn));\n}\n    \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::radiusSearch (const PointCloud &cloud, \n                                            int index, \n                                            double radius,\n                                            std::vector<int> &k_indices, \n                                            std::vector<float> &k_distances,\n                                            int max_nn) \n{\n  return (search_->radiusSearch (cloud, index, radius, k_indices, k_distances, max_nn));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::radiusSearch (int index, \n                                            double radius, \n                                            std::vector<int> &k_indices,\n                                            std::vector<float> &k_distances, \n                                            int max_nn) const\n{\n  return (search_->radiusSearch (index, radius, k_indices, k_distances, max_nn));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::approxNearestSearch (const PointCloudConstPtr &cloud_arg, \n                                                   int query_index_arg, \n                                                   int &result_index_arg,\n                                                   float &sqr_distance_arg)\n{\n  if(spatial_loc_ == OCTREE)\n    search_->approxNearestSearch (cloud_arg, query_index_arg, result_index_arg, sqr_distance_arg);\n  else\n    PCL_ERROR (\"approxNearestSearch() works only for OCTREE structure\\n\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::approxNearestSearch (const PointT &p_q_arg, \n                                                   int &result_index_arg, \n                                                   float &sqr_distance_arg)\n{\n  if (spatial_loc_ == OCTREE)\n    search_->approxNearestSearch (p_q_arg, result_index_arg, sqr_distance_arg);\n  else\n    PCL_ERROR (\"approxNearestSearch() works only for OCTREE structure\\n\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::approxNearestSearch (int query_index_arg, \n                                                   int &result_index_arg, \n                                                   float &sqr_distance_arg)\n{\n  if (spatial_loc_ == OCTREE)\n   search_->approxNearestSearch (query_index_arg, result_index_arg, sqr_distance_arg);\n  else\n    PCL_ERROR (\"approxNearestSearch() works only for OCTREE structure\\n\");\n}\n\n#define PCL_INSTANTIATE_AutotunedSearch(T) template class PCL_EXPORTS pcl::search::AutotunedSearch<T>;\n\n#endif  \/\/#ifndef PCL_SEARCH_AUTO_TUNED_SEARCH_IMPL\n<commit_msg>Fixing  return-statement with a value, in function returning `void'.<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 *  Author: Siddharth Choudhary (itzsid@gmail.com)\n *\n *\/\n\n#ifndef PCL_SEARCH_AUTO_TUNED_SEARCH_IMPL\n#define PCL_SEARCH_AUTO_TUNED_SEARCH_IMPL\n\n#include <pcl\/pcl_base.h>\n#include <vector>\n#include \"pcl\/search\/auto.h\"\n#include \"pcl\/search\/kdtree.h\"\n#include \"pcl\/search\/octree.h\"\n#include \"pcl\/search\/organized_neighbor.h\"\n#include <pcl\/common\/time.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::initSearchDS (int spatial_locator)\n{\n  \/\/ specifies the data-structure to be used using spatial_locator flag\n  if (spatial_locator == KDTREE)\n    \/\/ initialize kdtree\n    search_.reset (new KdTree<PointT> ());\n  else if (spatial_locator == ORGANIZED_INDEX)\n    search_.reset (new OrganizedNeighbor<PointT> ());\n  else if (spatial_locator == OCTREE)\n    search_.reset (new Octree<PointT> (0.1f));\n  else\n    PCL_ERROR (\"[pcl::search::AutotunedSearch::initSearchDS] Spatial locator (%d) unknown!\\n\", spatial_locator);\n   spatial_loc_ = spatial_locator;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::evaluateSearchMethods (const PointCloudConstPtr& cloud, const int search_type)\n{\n  \/\/ Evaluates different search data-structures for the given data and sets it to the ds having minimum time\n\tunsigned int searchIdx;\n  while (1)\n  {\n    searchIdx = rand()%(cloud->width * cloud->height);\n    if (cloud->points[searchIdx].z < 100)\n      break;\n   }\n\n  double time_kdtree, time_octree, time_organized_data;\n  if (search_type == NEAREST_K_SEARCH)\n  {\n    unsigned int no_of_neighbors = 20;\n    std::vector<int> k_indices;\n    k_indices.resize (no_of_neighbors);\n    std::vector<float> k_distances;\n    k_distances.resize (no_of_neighbors);\n    std::cout << \"\\n---------------\\nKDTree\\n---------------\\n\";\n    double time1 = getTime ();\n    search_.reset (new KdTree<PointT> ());\n    search_->setInputCloud (cloud);\n    search_->nearestKSearch (cloud->points[searchIdx], no_of_neighbors, k_indices, k_distances);\n    std::cout << \"Neighbors are:\" << std::endl;    \n    for (int i = 0; i < 20; i++)\n    {\n      std::cout << k_indices[i] << '\\t'; \n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neighbors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n\n    std::cout << \"\\n---------------\\nOrganizedData\\n---------------\\n\";\n    double time2 = getTime ();\n    search_.reset (new OrganizedNeighbor<PointT>());\n    search_->setInputCloud (cloud);\n    search_->nearestKSearch (cloud->points[searchIdx], no_of_neighbors, k_indices, k_distances);\n    std::cout << \"Neighbors are: \" << std::endl;\n    for (int i = 0;i < 20; i++)\n    {\n      std::cout << k_indices[i] << '\\t'; \n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neigbhors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n\n    std::cout << \"\\n---------------\\nOctree\\n---------------\\n\";\n    double time3 = getTime ();\n    search_.reset (new Octree<PointT> (0.1f));\n    search_->setInputCloud (cloud);\n    search_->nearestKSearch (cloud->points[searchIdx], no_of_neighbors, k_indices, k_distances);\n    std::cout << \"Neighbors are: \" << std::endl;\n    for (int i = 0;i < 20; i++)\n    {\n      std::cout << k_indices[i] << '\\t'; \n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neighbors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n    std::cout << std::endl;\n    std::cout << std::endl;\n\n    time_kdtree = time2 - time1;\n    time_organized_data = time3 - time2;\n    time_octree = getTime () - time3;\n    \n    std::cout << \"Time Taken: \" << \"KDTree: \" << time_kdtree << '\\t' <<\"OranizedData: \"  << time_organized_data << '\\t' << \"Octree: \" << time_octree << '\\t' << std::endl;\n  }\n  else if (search_type == NEAREST_RADIUS_SEARCH)\n  {\n    double searchRadius = 1.0 * ((double)rand () \/ (double)RAND_MAX);\n\n    std::vector<int> k_indices;\n    std::vector<float> k_distances;\n    std::cout << \"\\n---------------\\nKDTree\\n---------------\\n\";\n    double time1 = getTime ();\n    search_.reset (new KdTree<PointT> ());\n    search_->setInputCloud (cloud);\n    search_->radiusSearch (cloud->points[searchIdx], searchRadius, k_indices, k_distances);\n    std::cout << \"Neighbors are:\" << std::endl;\n\n    for(int i = 0;i < 20; ++i)\n    {\n      std::cout << k_indices[i] << '\\t';\n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neighbors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n\n    std::cout << \"\\n---------------\\nOrganizedData\\n---------------\\n\";\n    double time2 = getTime ();\n    search_.reset (new OrganizedNeighbor<PointT> ());\n    search_->setInputCloud (cloud);\n    search_->radiusSearch (cloud->points[searchIdx], searchRadius, k_indices, k_distances);\n    std::cout << \"Neighbors are: \" << std::endl;\n    for (int i = 0; i < 20; ++i)\n    {\n    std::cout << k_indices[i] << '\\t';\n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neigbhors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n\n    std::cout << \"\\n---------------\\nOctree\\n---------------\\n\";\n    double time3 = getTime ();\n    search_.reset (new Octree<PointT> (0.1f));\n    search_->setInputCloud (cloud);\n    search_->radiusSearch (cloud->points[searchIdx], searchRadius, k_indices, k_distances);\n    std::cout << \"Neighbors are: \" << std::endl;\n    for (int i = 0; i < 20; ++i) \n    {\n      std::cout << k_indices[i] << '\\t';\n    }\n    std::cout << std::endl;\n    std::cout << \"Number of Neighbors: \" << k_indices.size () << std::endl; \n    k_indices.clear (); k_distances.clear ();\n    std::cout << std::endl;\n    std::cout << std::endl;\n\n    time_kdtree = time2 - time1;\n    time_organized_data = time3 - time2;\n    time_octree = getTime () - time3;\n    \n    std::cout << \"Time Taken: \" << \"KDTree: \" << time_kdtree << '\\t' <<\"OranizedData: \"  << time_organized_data << '\\t' << \"Octree: \" << time_octree << '\\t' << std::endl;\t\n  }\n  else\n  {\n    PCL_ERROR (\"[pcl::search::AutotunedSearch::evaluateSearchMethods] Only NEAREST_K_SEARCH and NEAREST_RADIUS_SEARCH supported\\n\");\n    return;\n  }\n  \/\/ Set the datastructure according to which takes the minimum time\n  if (time_kdtree < time_organized_data && time_kdtree < time_octree)\n  {\n    spatial_loc_ = KDTREE;\n    search_.reset (new KdTree<PointT> ());\n  }\n  else if (time_octree < time_kdtree && time_octree < time_organized_data)\n  {\n    spatial_loc_ = OCTREE;\n    search_.reset (new Octree<PointT> (0.1f));\n  }\n  else if (time_organized_data < time_kdtree && time_organized_data < time_octree)\n  {\n    spatial_loc_ = OCTREE;\n    search_.reset (new OrganizedNeighbor<PointT> ());\n  }\n\/\/  search_->setInputCloud (cloud);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::setInputCloud (const PointCloudConstPtr &cloud, \n                                             const IndicesConstPtr &indices)\n{\n  input_ = cloud;\n  search_->setInputCloud (cloud, indices);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::setInputCloud (const PointCloudConstPtr& cloud)\n{\n  input_ = cloud;\n  search_->setInputCloud (cloud);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::nearestKSearch (const PointT &point,\n                                              int k, \n                                              std::vector<int> &k_indices, \n                                              std::vector<float> &k_sqr_distances) \n{\n  return (search_->nearestKSearch (point, k, k_indices, k_sqr_distances));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::nearestKSearch (const PointCloud &cloud, \n                                              int index, \n                                              int k, \n                                              std::vector<int> &k_indices, \n                                              std::vector<float> &k_sqr_distances) \n{\n  return (search_->nearestKSearch (cloud, index, k, k_indices, k_sqr_distances));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::nearestKSearch (int index, \n                                              int k, \n                                              std::vector<int> &k_indices, \n                                              std::vector<float> &k_sqr_distances)\n{\n  return (search_->nearestKSearch (index, k, k_indices, k_sqr_distances));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int\npcl::search::AutotunedSearch<PointT>::radiusSearch (const PointT &point, \n                                            const double radius, \n                                            std::vector<int> &k_indices, \n                                            std::vector<float> &k_distances, \n                                            int max_nn) const\n{\n  return (search_->radiusSearch (point, radius, k_indices, k_distances, max_nn));\n}\n    \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::radiusSearch (const PointCloud &cloud, \n                                            int index, \n                                            double radius,\n                                            std::vector<int> &k_indices, \n                                            std::vector<float> &k_distances,\n                                            int max_nn) \n{\n  return (search_->radiusSearch (cloud, index, radius, k_indices, k_distances, max_nn));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> int \npcl::search::AutotunedSearch<PointT>::radiusSearch (int index, \n                                            double radius, \n                                            std::vector<int> &k_indices,\n                                            std::vector<float> &k_distances, \n                                            int max_nn) const\n{\n  return (search_->radiusSearch (index, radius, k_indices, k_distances, max_nn));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::approxNearestSearch (const PointCloudConstPtr &cloud_arg, \n                                                   int query_index_arg, \n                                                   int &result_index_arg,\n                                                   float &sqr_distance_arg)\n{\n  if(spatial_loc_ == OCTREE)\n    search_->approxNearestSearch (cloud_arg, query_index_arg, result_index_arg, sqr_distance_arg);\n  else\n    PCL_ERROR (\"approxNearestSearch() works only for OCTREE structure\\n\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::approxNearestSearch (const PointT &p_q_arg, \n                                                   int &result_index_arg, \n                                                   float &sqr_distance_arg)\n{\n  if (spatial_loc_ == OCTREE)\n    search_->approxNearestSearch (p_q_arg, result_index_arg, sqr_distance_arg);\n  else\n    PCL_ERROR (\"approxNearestSearch() works only for OCTREE structure\\n\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void \npcl::search::AutotunedSearch<PointT>::approxNearestSearch (int query_index_arg, \n                                                   int &result_index_arg, \n                                                   float &sqr_distance_arg)\n{\n  if (spatial_loc_ == OCTREE)\n   search_->approxNearestSearch (query_index_arg, result_index_arg, sqr_distance_arg);\n  else\n    PCL_ERROR (\"approxNearestSearch() works only for OCTREE structure\\n\");\n}\n\n#define PCL_INSTANTIATE_AutotunedSearch(T) template class PCL_EXPORTS pcl::search::AutotunedSearch<T>;\n\n#endif  \/\/#ifndef PCL_SEARCH_AUTO_TUNED_SEARCH_IMPL\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: Xinyu Zhu  <xyzhu1120@gmail.com>                             |\n  |         shiguangqi <shiguangqi2008@gmail.com>                        |\n  +----------------------------------------------------------------------+\n *\/\n\n#include \"php_swoole.h\"\n\n#ifdef SW_COROUTINE\n#include \"swoole_coroutine.h\"\n\n#define TASK_SLOT \\\n    ((int)((ZEND_MM_ALIGNED_SIZE(sizeof(coro_task)) + ZEND_MM_ALIGNED_SIZE(sizeof(zval)) - 1) \/ ZEND_MM_ALIGNED_SIZE(sizeof(zval))))\n#define SWCC(x) sw_current_context->x\n\ncoro_global COROG;\n\n#if PHP_VERSION_ID >= 70200\nstatic inline void sw_vm_stack_init(void)\n{\n    uint32_t size = COROG.stack_size;\n    zend_vm_stack page = (zend_vm_stack) emalloc(size);\n\n    page->top = ZEND_VM_STACK_ELEMENTS(page);\n    page->end = (zval*) ((char*) page + size);\n    page->prev = NULL;\n\n    EG(vm_stack) = page;\n    EG(vm_stack)->top++;\n    EG(vm_stack_top) = EG(vm_stack)->top;\n    EG(vm_stack_end) = EG(vm_stack)->end;\n}\n#else\n#define sw_vm_stack_init zend_vm_stack_init\n#endif\n\nstatic sw_inline void php_coro_save_vm_stack(coro_task *task)\n{\n    task->execute_data = EG(current_execute_data);\n    task->vm_stack = EG(vm_stack);\n    task->vm_stack_top = EG(vm_stack_top);\n    task->vm_stack_end = EG(vm_stack_end);\n    SW_SAVE_EG_SCOPE(task->scope);\n}\n\nstatic sw_inline coro_task* php_coro_get_current_task()\n{\n    coro_task *task = (coro_task *) coroutine_get_current_task();\n    if (!task)\n    {\n        task = &COROG.task;\n    }\n    php_coro_save_vm_stack(task);\n    return task;\n}\n\nstatic sw_inline void php_coro_restore_vm_stack(coro_task *task)\n{\n    EG(current_execute_data) = task->execute_data;\n    EG(vm_stack) = task->vm_stack;\n    EG(vm_stack_top) = task->vm_stack_top;\n    EG(vm_stack_end) = task->vm_stack_end;\n    SW_SET_EG_SCOPE(task->scope);\n}\n\n\/**\n * The meaning of the task argument in coro switch functions\n *\n * create: origin_task\n * yield: current_task\n * resume: target_task\n * close: current_task\n *\n *\/\n\nstatic sw_inline void php_coro_save_og(coro_task *task)\n{\n    task->output_ptr = (zend_output_globals *) emalloc(sizeof(zend_output_globals));\n    memcpy(task->output_ptr, SWOG, sizeof(zend_output_globals));\n    php_output_activate();\n}\n\nstatic sw_inline void php_coro_restore_og(coro_task *task)\n{\n    memcpy(SWOG, task->output_ptr, sizeof(zend_output_globals));\n    efree(task->output_ptr);\n    task->output_ptr = NULL;\n}\n\nstatic sw_inline void php_coro_og_create(coro_task *task)\n{\n    if (OG(handlers).elements)\n    {\n        php_coro_save_og(task);\n    }\n    else\n    {\n        task->output_ptr = NULL;\n    }\n}\n\nstatic sw_inline void php_coro_og_yield(coro_task *task)\n{\n    if (OG(handlers).elements)\n    {\n        php_coro_save_og(task);\n    }\n    else\n    {\n        task->output_ptr = NULL;\n    }\n    if (task->origin_task->output_ptr)\n    {\n        php_coro_restore_og(task->origin_task);\n    }\n}\n\nstatic sw_inline void php_coro_og_resume(coro_task *task)\n{\n    if (OG(handlers).elements)\n    {\n        php_coro_save_og(task->origin_task);\n    }\n    else\n    {\n        task->origin_task->output_ptr = NULL;\n    }\n    if (task->output_ptr)\n    {\n        php_coro_restore_og(task);\n    }\n}\n\nstatic sw_inline void php_coro_og_close(coro_task *task)\n{\n    if (OG(handlers).elements)\n    {\n        if (OG(active))\n        {\n            php_output_end_all();\n        }\n        php_output_deactivate();\n        php_output_activate();\n    }\n    if (task->output_ptr)\n    {\n        efree(task->output_ptr);\n        task->output_ptr = nullptr;\n    }\n}\n\nvoid coro_init(void)\n{\n    COROG.max_coro_num = DEFAULT_MAX_CORO_NUM;\n    COROG.stack_size = DEFAULT_STACK_SIZE;\n    coroutine_set_onYield(internal_coro_yield);\n    coroutine_set_onResume(internal_coro_resume);\n    coroutine_set_onClose(sw_coro_close);\n}\n\nstatic void php_coro_create(void *arg)\n{\n    php_args *php_arg = (php_args *) arg;\n    zend_fcall_info_cache *fci_cache = php_arg->fci_cache;\n    zval **argv = php_arg->argv;\n    int argc = php_arg->argc;\n    zval *retval = php_arg->retval;\n    coro_task *origin_task = php_arg->origin_task;\n\n    int cid = coroutine_get_current_cid();\n    int i;\n    zend_function *func;\n    coro_task *task;\n\n    func = fci_cache->function_handler;\n    sw_vm_stack_init();\n    zend_execute_data *call = (zend_execute_data *) (EG(vm_stack_top));\n\n    task = (coro_task *) EG(vm_stack_top);\n    EG(vm_stack_top) = (zval *) ((char *) call + TASK_SLOT * sizeof(zval));\n\n    call = zend_vm_stack_push_call_frame(\n        ZEND_CALL_TOP_FUNCTION | ZEND_CALL_ALLOCATED,\n        func, argc,\n        fci_cache->called_scope, fci_cache->object\n    );\n\n    SW_SET_EG_SCOPE(func->common.scope);\n    SW_SAVE_EG_SCOPE(task->scope);\n\n    for (i = 0; i < argc; ++i)\n    {\n        zval *target;\n        target = ZEND_CALL_ARG(call, i + 1);\n        ZVAL_COPY(target, argv[i]);\n    }\n    call->symbol_table = NULL;\n\n    \/\/ EG(current_execute_data) = NULL; \/\/ for backtrace\n    if (UNEXPECTED(func->op_array.fn_flags & ZEND_ACC_CLOSURE))\n    {\n        uint32_t call_info;\n        GC_ADDREF(ZEND_CLOSURE_OBJECT(func));\n        call_info = ZEND_CALL_CLOSURE;\n        ZEND_ADD_CALL_FLAG(call, call_info);\n    }\n    zend_init_execute_data(call, &func->op_array, retval);\n\n#ifdef SW_LOG_TRACE_OPEN\n    task->cid = cid;\n#endif\n    task->execute_data = call;\n    task->vm_stack = EG(vm_stack);\n    task->vm_stack_top = EG(vm_stack_top);\n    task->vm_stack_end = EG(vm_stack_end);\n    task->origin_task = origin_task;\n    task->output_ptr = nullptr;\n    task->co = coroutine_get_by_id(cid);\n    coroutine_set_task(task->co, (void *) task);\n\n    if (SwooleG.hooks[SW_GLOBAL_HOOK_ON_CORO_START])\n    {\n        swoole_call_hook(SW_GLOBAL_HOOK_ON_CORO_START, task);\n    }\n    swTraceLog(SW_TRACE_COROUTINE, \"Create coro id: %d, origin cid: %d, coro total count: %d, heap size: %zu\", cid, task->origin_task->cid, COROG.coro_num, zend_memory_usage(0));\n\n    php_coro_og_create(origin_task);\n    EG(current_execute_data) = task->execute_data;\n    zend_execute_ex(EG(current_execute_data));\n\n    if (EG(exception))\n    {\n        zend_exception_error(EG(exception), E_ERROR);\n    }\n}\n\nstatic sw_inline void php_coro_yield(coro_task *task)\n{\n    swTraceLog(SW_TRACE_COROUTINE,\"php_coro_yield from cid=%d to cid=%d\", task->cid, task->origin_task->cid);\n    php_coro_save_vm_stack(task);\n    php_coro_restore_vm_stack(task->origin_task);\n    php_coro_og_yield(task);\n}\n\nstatic sw_inline void php_coro_resume(coro_task *task)\n{\n    task->origin_task = php_coro_get_current_task();\n    php_coro_restore_vm_stack(task);\n    php_coro_og_resume(task);\n    swTraceLog(SW_TRACE_COROUTINE,\"php_coro_resume from cid=%d to cid=%d\", task->origin_task->cid, task->cid);\n}\n\nstatic sw_inline void php_coro_close(coro_task *task)\n{\n    php_coro_og_close(task);\n    php_coro_yield(task);\n}\n\nvoid internal_coro_resume(void *arg)\n{\n    coro_task *task = (coro_task *) arg;\n    php_coro_resume(task);\n}\n\nvoid internal_coro_yield(void *arg)\n{\n    coro_task *task = (coro_task *) arg;\n    php_coro_yield(task);\n}\n\nvoid coro_check(void)\n{\n    if (unlikely(!sw_coro_is_in()))\n    {\n        swoole_php_fatal_error(E_ERROR, \"must be called in the coroutine.\");\n    }\n}\n\nvoid coro_destroy(void)\n{\n}\n\nvoid sw_coro_check_bind(const char *name, int bind_cid)\n{\n    if (unlikely(bind_cid > 0))\n    {\n        swString *buffer = SwooleTG.buffer_stack;\n        sw_get_debug_print_backtrace(buffer, DEBUG_BACKTRACE_IGNORE_ARGS, 3);\n        swoole_error_log(\n            SW_LOG_ERROR, SW_ERROR_CO_HAS_BEEN_BOUND,\n            \"%s has already been bound to another coroutine #%d, \"\n            \"reading or writing of the same socket in multiple coroutines at the same time is not allowed.\\n\"\n            \"%.*s\", name, bind_cid, (int) buffer->length, buffer->str\n        );\n        exit(255);\n    }\n}\n\nint sw_coro_create(zend_fcall_info_cache *fci_cache, zval **argv, int argc, zval *retval)\n{\n    if (unlikely(COROG.active == 0))\n    {\n        if (zend_get_module_started(\"xdebug\") == SUCCESS)\n        {\n            swWarn(\"xdebug do not support coroutine, please notice that it lead to coredump.\");\n        }\n        COROG.active = 1;\n    }\n    if (unlikely(COROG.coro_num >= COROG.max_coro_num) )\n    {\n        swWarn(\"exceed max number of coro_num %d, max_coro_num:%d\", COROG.coro_num, COROG.max_coro_num);\n        return CORO_LIMIT;\n    }\n\n    if (++COROG.coro_num > COROG.peak_coro_num)\n    {\n        COROG.peak_coro_num = COROG.coro_num;\n    }\n\n    php_args php_args;\n    php_args.fci_cache = fci_cache;\n    php_args.argv = argv;\n    php_args.argc = argc;\n    php_args.retval = retval;\n    php_args.origin_task = php_coro_get_current_task();\n\n    int cid = coroutine_create(php_coro_create, (void*) &php_args);\n    if (unlikely(cid <= 0))\n    {\n        COROG.coro_num--;\n    }\n    return cid;\n}\n\nvoid sw_coro_save(zval *return_value, php_context *sw_current_context)\n{\n    SWCC(current_coro_return_value_ptr) = return_value;\n    SWCC(current_execute_data) = EG(current_execute_data);\n    SWCC(current_vm_stack) = EG(vm_stack);\n    SWCC(current_vm_stack_top) = EG(vm_stack_top);\n    SWCC(current_vm_stack_end) = EG(vm_stack_end);\n    SWCC(current_task) = (coro_task *) coroutine_get_current_task();\n}\n\nvoid sw_coro_yield()\n{\n    if (unlikely(!sw_coro_is_in()))\n    {\n        swoole_php_fatal_error(E_ERROR, \"must be called in the coroutine.\");\n    }\n    coro_task *task = (coro_task *) coroutine_get_current_task();\n    php_coro_yield(task);\n    coroutine_yield_naked(task->co);\n}\n\nint sw_coro_resume(php_context *sw_current_context, zval *retval, zval *coro_retval)\n{\n    coro_task *task = SWCC(current_task);\n    php_coro_resume(task);\n    if (EG(current_execute_data)->prev_execute_data->opline->result_type != IS_UNUSED && retval)\n    {\n        ZVAL_COPY(SWCC(current_coro_return_value_ptr), retval);\n    }\n\n    coroutine_resume_naked(task->co);\n\n    if (unlikely(EG(exception)))\n    {\n        if (retval)\n        {\n            zval_ptr_dtor(retval);\n        }\n        zend_exception_error(EG(exception), E_ERROR);\n    }\n    return CORO_END;\n}\n\nvoid sw_coro_close()\n{\n    coro_task *task = (coro_task *) coroutine_get_current_task();\n\n    if (SwooleG.hooks[SW_GLOBAL_HOOK_ON_CORO_STOP])\n    {\n        swoole_call_hook(SW_GLOBAL_HOOK_ON_CORO_STOP, task);\n    }\n\n    php_coro_close(task);\n    efree(task->vm_stack);\n    COROG.coro_num--;\n\n    swTraceLog(SW_TRACE_COROUTINE, \"coro close cid=%d and %d remained. usage size: %zu. malloc size: %zu\", task->cid, COROG.coro_num, zend_memory_usage(0), zend_memory_usage(1));\n}\n\nint sw_get_current_cid()\n{\n    if (unlikely(COROG.active == 0))\n    {\n        return -1;\n    }\n    else\n    {\n        return coroutine_get_current_cid();\n    }\n}\n\nvoid sw_coro_set_stack_size(int stack_size)\n{\n    coroutine_set_stack_size(stack_size);\n}\n\n#endif\n<commit_msg>update coro<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: Xinyu Zhu  <xyzhu1120@gmail.com>                             |\n  |         shiguangqi <shiguangqi2008@gmail.com>                        |\n  +----------------------------------------------------------------------+\n *\/\n\n#include \"php_swoole.h\"\n\n#ifdef SW_COROUTINE\n#include \"swoole_coroutine.h\"\n\n#define TASK_SLOT \\\n    ((int)((ZEND_MM_ALIGNED_SIZE(sizeof(coro_task)) + ZEND_MM_ALIGNED_SIZE(sizeof(zval)) - 1) \/ ZEND_MM_ALIGNED_SIZE(sizeof(zval))))\n#define SWCC(x) sw_current_context->x\n\ncoro_global COROG;\n\n#if PHP_VERSION_ID >= 70200\nstatic inline void sw_vm_stack_init(void)\n{\n    uint32_t size = COROG.stack_size;\n    zend_vm_stack page = (zend_vm_stack) emalloc(size);\n\n    page->top = ZEND_VM_STACK_ELEMENTS(page);\n    page->end = (zval*) ((char*) page + size);\n    page->prev = NULL;\n\n    EG(vm_stack) = page;\n    EG(vm_stack)->top++;\n    EG(vm_stack_top) = EG(vm_stack)->top;\n    EG(vm_stack_end) = EG(vm_stack)->end;\n}\n#else\n#define sw_vm_stack_init zend_vm_stack_init\n#endif\n\nstatic void sw_vm_stack_destroy(zend_vm_stack stack)\n{\n    while (stack != NULL) {\n        zend_vm_stack p = stack->prev;\n        efree(stack);\n        stack = p;\n    }\n}\n\n\nstatic sw_inline void php_coro_save_vm_stack(coro_task *task)\n{\n    task->execute_data = EG(current_execute_data);\n    task->vm_stack = EG(vm_stack);\n    task->vm_stack_top = EG(vm_stack_top);\n    task->vm_stack_end = EG(vm_stack_end);\n    SW_SAVE_EG_SCOPE(task->scope);\n}\n\nstatic sw_inline coro_task* php_coro_get_current_task()\n{\n    coro_task *task = (coro_task *) coroutine_get_current_task();\n    if (!task)\n    {\n        task = &COROG.task;\n    }\n    php_coro_save_vm_stack(task);\n    return task;\n}\n\nstatic sw_inline void php_coro_restore_vm_stack(coro_task *task)\n{\n    EG(current_execute_data) = task->execute_data;\n    EG(vm_stack) = task->vm_stack;\n    EG(vm_stack_top) = task->vm_stack_top;\n    EG(vm_stack_end) = task->vm_stack_end;\n    SW_SET_EG_SCOPE(task->scope);\n}\n\n\/**\n * The meaning of the task argument in coro switch functions\n *\n * create: origin_task\n * yield: current_task\n * resume: target_task\n * close: current_task\n *\n *\/\n\nstatic sw_inline void php_coro_save_og(coro_task *task)\n{\n    task->output_ptr = (zend_output_globals *) emalloc(sizeof(zend_output_globals));\n    memcpy(task->output_ptr, SWOG, sizeof(zend_output_globals));\n    php_output_activate();\n}\n\nstatic sw_inline void php_coro_restore_og(coro_task *task)\n{\n    memcpy(SWOG, task->output_ptr, sizeof(zend_output_globals));\n    efree(task->output_ptr);\n    task->output_ptr = NULL;\n}\n\nstatic sw_inline void php_coro_og_create(coro_task *task)\n{\n    if (OG(handlers).elements)\n    {\n        php_coro_save_og(task);\n    }\n    else\n    {\n        task->output_ptr = NULL;\n    }\n}\n\nstatic sw_inline void php_coro_og_yield(coro_task *task)\n{\n    if (OG(handlers).elements)\n    {\n        php_coro_save_og(task);\n    }\n    else\n    {\n        task->output_ptr = NULL;\n    }\n    if (task->origin_task->output_ptr)\n    {\n        php_coro_restore_og(task->origin_task);\n    }\n}\n\nstatic sw_inline void php_coro_og_resume(coro_task *task)\n{\n    if (OG(handlers).elements)\n    {\n        php_coro_save_og(task->origin_task);\n    }\n    else\n    {\n        task->origin_task->output_ptr = NULL;\n    }\n    if (task->output_ptr)\n    {\n        php_coro_restore_og(task);\n    }\n}\n\nstatic sw_inline void php_coro_og_close(coro_task *task)\n{\n    if (OG(handlers).elements)\n    {\n        if (OG(active))\n        {\n            php_output_end_all();\n        }\n        php_output_deactivate();\n        php_output_activate();\n    }\n    if (task->output_ptr)\n    {\n        efree(task->output_ptr);\n        task->output_ptr = nullptr;\n    }\n}\n\nvoid coro_init(void)\n{\n    COROG.max_coro_num = DEFAULT_MAX_CORO_NUM;\n    COROG.stack_size = DEFAULT_STACK_SIZE;\n    coroutine_set_onYield(internal_coro_yield);\n    coroutine_set_onResume(internal_coro_resume);\n    coroutine_set_onClose(sw_coro_close);\n}\n\nstatic void php_coro_create(void *arg)\n{\n    php_args *php_arg = (php_args *) arg;\n    zend_fcall_info_cache *fci_cache = php_arg->fci_cache;\n    zval **argv = php_arg->argv;\n    int argc = php_arg->argc;\n    zval *retval = php_arg->retval;\n    coro_task *origin_task = php_arg->origin_task;\n\n    int cid = coroutine_get_current_cid();\n    int i;\n    zend_function *func;\n    coro_task *task;\n\n    func = fci_cache->function_handler;\n    sw_vm_stack_init();\n    zend_execute_data *call = (zend_execute_data *) (EG(vm_stack_top));\n\n    task = (coro_task *) EG(vm_stack_top);\n    EG(vm_stack_top) = (zval *) ((char *) call + TASK_SLOT * sizeof(zval));\n\n    call = zend_vm_stack_push_call_frame(\n        ZEND_CALL_TOP_FUNCTION | ZEND_CALL_ALLOCATED,\n        func, argc,\n        fci_cache->called_scope, fci_cache->object\n    );\n\n    SW_SET_EG_SCOPE(func->common.scope);\n    SW_SAVE_EG_SCOPE(task->scope);\n\n    for (i = 0; i < argc; ++i)\n    {\n        zval *target;\n        target = ZEND_CALL_ARG(call, i + 1);\n        ZVAL_COPY(target, argv[i]);\n    }\n    call->symbol_table = NULL;\n\n    \/\/ EG(current_execute_data) = NULL; \/\/ for backtrace\n    if (UNEXPECTED(func->op_array.fn_flags & ZEND_ACC_CLOSURE))\n    {\n        uint32_t call_info;\n        GC_ADDREF(ZEND_CLOSURE_OBJECT(func));\n        call_info = ZEND_CALL_CLOSURE;\n        ZEND_ADD_CALL_FLAG(call, call_info);\n    }\n    zend_init_execute_data(call, &func->op_array, retval);\n\n#ifdef SW_LOG_TRACE_OPEN\n    task->cid = cid;\n#endif\n    task->execute_data = call;\n    task->vm_stack = EG(vm_stack);\n    task->vm_stack_top = EG(vm_stack_top);\n    task->vm_stack_end = EG(vm_stack_end);\n    task->origin_task = origin_task;\n    task->output_ptr = nullptr;\n    task->co = coroutine_get_by_id(cid);\n    coroutine_set_task(task->co, (void *) task);\n\n    if (SwooleG.hooks[SW_GLOBAL_HOOK_ON_CORO_START])\n    {\n        swoole_call_hook(SW_GLOBAL_HOOK_ON_CORO_START, task);\n    }\n    swTraceLog(SW_TRACE_COROUTINE, \"Create coro id: %d, origin cid: %d, coro total count: %d, heap size: %zu\", cid, task->origin_task->cid, COROG.coro_num, zend_memory_usage(0));\n\n    php_coro_og_create(origin_task);\n    EG(current_execute_data) = task->execute_data;\n    zend_execute_ex(EG(current_execute_data));\n\n    if (EG(exception))\n    {\n        zend_exception_error(EG(exception), E_ERROR);\n    }\n}\n\nstatic sw_inline void php_coro_yield(coro_task *task)\n{\n    swTraceLog(SW_TRACE_COROUTINE,\"php_coro_yield from cid=%d to cid=%d\", task->cid, task->origin_task->cid);\n    php_coro_save_vm_stack(task);\n    php_coro_restore_vm_stack(task->origin_task);\n    php_coro_og_yield(task);\n}\n\nstatic sw_inline void php_coro_resume(coro_task *task)\n{\n    task->origin_task = php_coro_get_current_task();\n    php_coro_restore_vm_stack(task);\n    php_coro_og_resume(task);\n    swTraceLog(SW_TRACE_COROUTINE,\"php_coro_resume from cid=%d to cid=%d\", task->origin_task->cid, task->cid);\n}\n\nstatic sw_inline void php_coro_close(coro_task *task)\n{\n    php_coro_og_close(task);\n    php_coro_yield(task);\n}\n\nvoid internal_coro_resume(void *arg)\n{\n    coro_task *task = (coro_task *) arg;\n    php_coro_resume(task);\n}\n\nvoid internal_coro_yield(void *arg)\n{\n    coro_task *task = (coro_task *) arg;\n    php_coro_yield(task);\n}\n\nvoid coro_check(void)\n{\n    if (unlikely(!sw_coro_is_in()))\n    {\n        swoole_php_fatal_error(E_ERROR, \"must be called in the coroutine.\");\n    }\n}\n\nvoid coro_destroy(void)\n{\n}\n\nvoid sw_coro_check_bind(const char *name, int bind_cid)\n{\n    if (unlikely(bind_cid > 0))\n    {\n        swString *buffer = SwooleTG.buffer_stack;\n        sw_get_debug_print_backtrace(buffer, DEBUG_BACKTRACE_IGNORE_ARGS, 3);\n        swoole_error_log(\n            SW_LOG_ERROR, SW_ERROR_CO_HAS_BEEN_BOUND,\n            \"%s has already been bound to another coroutine #%d, \"\n            \"reading or writing of the same socket in multiple coroutines at the same time is not allowed.\\n\"\n            \"%.*s\", name, bind_cid, (int) buffer->length, buffer->str\n        );\n        exit(255);\n    }\n}\n\nint sw_coro_create(zend_fcall_info_cache *fci_cache, zval **argv, int argc, zval *retval)\n{\n    if (unlikely(COROG.active == 0))\n    {\n        if (zend_get_module_started(\"xdebug\") == SUCCESS)\n        {\n            swWarn(\"xdebug do not support coroutine, please notice that it lead to coredump.\");\n        }\n        COROG.active = 1;\n    }\n    if (unlikely(COROG.coro_num >= COROG.max_coro_num) )\n    {\n        swWarn(\"exceed max number of coro_num %d, max_coro_num:%d\", COROG.coro_num, COROG.max_coro_num);\n        return CORO_LIMIT;\n    }\n\n    if (++COROG.coro_num > COROG.peak_coro_num)\n    {\n        COROG.peak_coro_num = COROG.coro_num;\n    }\n\n    php_args php_args;\n    php_args.fci_cache = fci_cache;\n    php_args.argv = argv;\n    php_args.argc = argc;\n    php_args.retval = retval;\n    php_args.origin_task = php_coro_get_current_task();\n\n    int cid = coroutine_create(php_coro_create, (void*) &php_args);\n    if (unlikely(cid <= 0))\n    {\n        COROG.coro_num--;\n    }\n    return cid;\n}\n\nvoid sw_coro_save(zval *return_value, php_context *sw_current_context)\n{\n    SWCC(current_coro_return_value_ptr) = return_value;\n    SWCC(current_execute_data) = EG(current_execute_data);\n    SWCC(current_vm_stack) = EG(vm_stack);\n    SWCC(current_vm_stack_top) = EG(vm_stack_top);\n    SWCC(current_vm_stack_end) = EG(vm_stack_end);\n    SWCC(current_task) = (coro_task *) coroutine_get_current_task();\n}\n\nvoid sw_coro_yield()\n{\n    if (unlikely(!sw_coro_is_in()))\n    {\n        swoole_php_fatal_error(E_ERROR, \"must be called in the coroutine.\");\n    }\n    coro_task *task = (coro_task *) coroutine_get_current_task();\n    php_coro_yield(task);\n    coroutine_yield_naked(task->co);\n}\n\nint sw_coro_resume(php_context *sw_current_context, zval *retval, zval *coro_retval)\n{\n    coro_task *task = SWCC(current_task);\n    php_coro_resume(task);\n    if (EG(current_execute_data)->prev_execute_data->opline->result_type != IS_UNUSED && retval)\n    {\n        ZVAL_COPY(SWCC(current_coro_return_value_ptr), retval);\n    }\n\n    coroutine_resume_naked(task->co);\n\n    if (unlikely(EG(exception)))\n    {\n        if (retval)\n        {\n            zval_ptr_dtor(retval);\n        }\n        zend_exception_error(EG(exception), E_ERROR);\n    }\n    return CORO_END;\n}\n\nvoid sw_coro_close()\n{\n    coro_task *task = (coro_task *) coroutine_get_current_task();\n\n    if (SwooleG.hooks[SW_GLOBAL_HOOK_ON_CORO_STOP])\n    {\n        swoole_call_hook(SW_GLOBAL_HOOK_ON_CORO_STOP, task);\n    }\n\n    php_coro_close(task);\n    sw_vm_stack_destroy(task->vm_stack);\n    COROG.coro_num--;\n\n    swTraceLog(SW_TRACE_COROUTINE, \"coro close cid=%d and %d remained. usage size: %zu. malloc size: %zu\", task->cid, COROG.coro_num, zend_memory_usage(0), zend_memory_usage(1));\n}\n\nint sw_get_current_cid()\n{\n    if (unlikely(COROG.active == 0))\n    {\n        return -1;\n    }\n    else\n    {\n        return coroutine_get_current_cid();\n    }\n}\n\nvoid sw_coro_set_stack_size(int stack_size)\n{\n    coroutine_set_stack_size(stack_size);\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <dsa\/requester.h>\n\nint main() {\n  App app;\n\n  client;\n\n  requester = client->session()->requester();\n\n\n  stream = requester.subscribe(\"\/abc\", func);\n  stream.close();\n}\n\n\nvoid callback(ValueUpdate, ResponseStatus)<commit_msg>fix compilation error<commit_after>#include <dsa\/requester.h>\n\nint main() {\n#if 0\n  App app;\n\n  client;\n\n  requester = client->session()->requester();\n\n\n  stream = requester.subscribe(\"\/abc\", func);\n  stream.close();\n#endif\n}\n\n\n\/\/ void callback(ValueUpdate, ResponseStatus);\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\r\n#include <string>\r\n#include <vector>\r\n#include <algorithm>\r\n#include <numeric>\r\n\r\n#include <opencv2\/core\/core.hpp>\r\n#include <opencv2\/core\/opengl_interop.hpp>\r\n#include <opencv2\/gpu\/gpu.hpp>\r\n#include <opencv2\/highgui\/highgui.hpp>\r\n#include <opencv2\/contrib\/contrib.hpp>\r\n\r\nint main(int argc, const char* argv[])\r\n{\r\n    if (argc != 2)\r\n        return -1;\r\n\r\n    const std::string fname(argv[1]);\r\n\r\n    cv::namedWindow(\"CPU\", cv::WINDOW_NORMAL);\r\n    cv::namedWindow(\"GPU\", cv::WINDOW_OPENGL);\r\n    cv::gpu::setGlDevice();\r\n\r\n    cv::Mat frame;\r\n    cv::VideoCapture reader(fname);\r\n\r\n    cv::gpu::GpuMat d_frame;\r\n    cv::gpu::VideoReader_GPU d_reader(fname);\r\n    d_reader.dumpFormat(std::cout);\r\n\r\n    cv::TickMeter tm;\r\n    std::vector<double> cpu_times;\r\n    std::vector<double> gpu_times;\r\n\r\n    for (;;)\r\n    {\r\n        tm.reset(); tm.start();\r\n        if (!reader.read(frame))\r\n            break;\r\n        tm.stop();\r\n        cpu_times.push_back(tm.getTimeMilli());\r\n\r\n        tm.reset(); tm.start();\r\n        if (!d_reader.read(d_frame))\r\n            break;\r\n        tm.stop();\r\n        gpu_times.push_back(tm.getTimeMilli());\r\n\r\n        cv::imshow(\"CPU\", frame);\r\n        cv::imshow(\"GPU\", frame);\r\n\r\n        if (cv::waitKey(3) > 0)\r\n            break;\r\n    }\r\n\r\n    if (!cpu_times.empty() && !gpu_times.empty())\r\n    {\r\n        std::cout << std::endl << \"Results:\" << std::endl;\r\n\r\n        std::sort(cpu_times.begin(), cpu_times.end());\r\n        std::sort(gpu_times.begin(), gpu_times.end());\r\n\r\n        double cpu_avg = std::accumulate(cpu_times.begin(), cpu_times.end(), 0.0) \/ cpu_times.size();\r\n        double gpu_avg = std::accumulate(gpu_times.begin(), gpu_times.end(), 0.0) \/ gpu_times.size();\r\n\r\n        std::cout << \"CPU : Avg : \" << cpu_avg << \" ms FPS : \" << 1000.0 \/ cpu_avg << std::endl;\r\n        std::cout << \"GPU : Avg : \" << gpu_avg << \" ms FPS : \" << 1000.0 \/ gpu_avg << std::endl;\r\n    }\r\n\r\n    return 0;\r\n}\r\n<commit_msg>minor fix in gpu video_writer sample<commit_after>#include <iostream>\r\n#include <string>\r\n#include <vector>\r\n#include <algorithm>\r\n#include <numeric>\r\n\r\n#include <opencv2\/core\/core.hpp>\r\n#include <opencv2\/core\/opengl_interop.hpp>\r\n#include <opencv2\/gpu\/gpu.hpp>\r\n#include <opencv2\/highgui\/highgui.hpp>\r\n#include <opencv2\/contrib\/contrib.hpp>\r\n\r\nint main(int argc, const char* argv[])\r\n{\r\n    if (argc != 2)\r\n        return -1;\r\n\r\n    const std::string fname(argv[1]);\r\n\r\n    cv::namedWindow(\"CPU\", cv::WINDOW_NORMAL);\r\n    cv::namedWindow(\"GPU\", cv::WINDOW_OPENGL);\r\n    cv::gpu::setGlDevice();\r\n\r\n    cv::Mat frame;\r\n    cv::VideoCapture reader(fname);\r\n\r\n    cv::gpu::GpuMat d_frame;\r\n    cv::gpu::VideoReader_GPU d_reader(fname);\r\n    d_reader.dumpFormat(std::cout);\r\n\r\n    cv::TickMeter tm;\r\n    std::vector<double> cpu_times;\r\n    std::vector<double> gpu_times;\r\n\r\n    for (;;)\r\n    {\r\n        tm.reset(); tm.start();\r\n        if (!reader.read(frame))\r\n            break;\r\n        tm.stop();\r\n        cpu_times.push_back(tm.getTimeMilli());\r\n\r\n        tm.reset(); tm.start();\r\n        if (!d_reader.read(d_frame))\r\n            break;\r\n        tm.stop();\r\n        gpu_times.push_back(tm.getTimeMilli());\r\n\r\n        cv::imshow(\"CPU\", frame);\r\n        cv::imshow(\"GPU\", d_frame);\r\n\r\n        if (cv::waitKey(3) > 0)\r\n            break;\r\n    }\r\n\r\n    if (!cpu_times.empty() && !gpu_times.empty())\r\n    {\r\n        std::cout << std::endl << \"Results:\" << std::endl;\r\n\r\n        std::sort(cpu_times.begin(), cpu_times.end());\r\n        std::sort(gpu_times.begin(), gpu_times.end());\r\n\r\n        double cpu_avg = std::accumulate(cpu_times.begin(), cpu_times.end(), 0.0) \/ cpu_times.size();\r\n        double gpu_avg = std::accumulate(gpu_times.begin(), gpu_times.end(), 0.0) \/ gpu_times.size();\r\n\r\n        std::cout << \"CPU : Avg : \" << cpu_avg << \" ms FPS : \" << 1000.0 \/ cpu_avg << std::endl;\r\n        std::cout << \"GPU : Avg : \" << gpu_avg << \" ms FPS : \" << 1000.0 \/ gpu_avg << std::endl;\r\n    }\r\n\r\n    return 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: dif.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: hr $ $Date: 2003-03-26 18:04: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#ifndef _DIF_HXX\n#define _DIF_HXX\n\n\n#ifndef _TOOLS_DEBUG_HXX \/\/autogen\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\n#ifndef SC_SCGLOB_HXX\n#include \"global.hxx\"\n#endif\n\n\nclass SvStream;\nclass SvNumberFormatter;\nclass ScDocument;\nclass ScPatternAttr;\n\nextern const sal_Unicode pKeyTABLE[];\nextern const sal_Unicode pKeyVECTORS[];\nextern const sal_Unicode pKeyTUPLES[];\nextern const sal_Unicode pKeyDATA[];\nextern const sal_Unicode pKeyBOT[];\nextern const sal_Unicode pKeyEOD[];\nextern const sal_Unicode pKeyTRUE[];\nextern const sal_Unicode pKeyFALSE[];\nextern const sal_Unicode pKeyNA[];\nextern const sal_Unicode pKeyV[];\nextern const sal_Unicode pKey1_0[];\n\n\nenum TOPIC\n{\n    T_UNKNOWN,\n    T_TABLE, T_VECTORS, T_TUPLES, T_DATA, T_LABEL, T_COMMENT, T_SIZE,\n    T_PERIODICITY, T_MAJORSTART, T_MINORSTART, T_TRUELENGTH, T_UINITS,\n    T_DISPLAYUNITS,\n    T_END\n};\n\nenum DATASET { D_BOT, D_EOD, D_NUMERIC, D_STRING, D_UNKNOWN, D_SYNT_ERROR };\n\n\nclass DifParser\n{\npublic:\n    String              aData;\n    double              fVal;\n    UINT32              nVector;\n    UINT32              nVal;\n    UINT32              nNumFormat;\n    CharSet             eCharSet;\nprivate:\n    SvNumberFormatter*  pNumFormatter;\n    SvStream&           rIn;\n    BOOL                bPlain;\n\n    static inline BOOL  IsBOT( const sal_Unicode* pRef );\n    static inline BOOL  IsEOD( const sal_Unicode* pRef );\n    static inline BOOL  Is1_0( const sal_Unicode* pRef );\npublic:\n                        DifParser( SvStream&, const UINT32 nOption, ScDocument&, CharSet );\n\n    TOPIC               GetNextTopic( void );\n\n    DATASET             GetNextDataset( void );\n\n    const sal_Unicode*  ScanIntVal( const sal_Unicode* pStart, UINT32& rRet );\n    BOOL                ScanFloatVal( const sal_Unicode* pStart );\n\n    inline BOOL         IsNumber( const sal_Unicode cChar );\n    inline BOOL         IsNumberEnding( const sal_Unicode cChar );\n\n    static inline BOOL  IsV( const sal_Unicode* pRef );\n\n    inline BOOL         IsPlain( void ) const;\n};\n\n\ninline BOOL DifParser::IsBOT( const sal_Unicode* pRef )\n{\n    return  (   pRef[ 0 ] == pKeyBOT[0] &&\n                pRef[ 1 ] == pKeyBOT[1] &&\n                pRef[ 2 ] == pKeyBOT[2] &&\n                pRef[ 3 ] == pKeyBOT[3] );\n}\n\n\ninline BOOL DifParser::IsEOD( const sal_Unicode* pRef )\n{\n    return  (   pRef[ 0 ] == pKeyEOD[0] &&\n                pRef[ 1 ] == pKeyEOD[1] &&\n                pRef[ 2 ] == pKeyEOD[2] &&\n                pRef[ 3 ] == pKeyEOD[3] );\n}\n\n\ninline BOOL DifParser::Is1_0( const sal_Unicode* pRef )\n{\n    return  (   pRef[ 0 ] == pKey1_0[0] &&\n                pRef[ 1 ] == pKey1_0[1] &&\n                pRef[ 2 ] == pKey1_0[2] &&\n                pRef[ 3 ] == pKey1_0[3] );\n}\n\n\ninline BOOL DifParser::IsV( const sal_Unicode* pRef )\n{\n    return  (   pRef[ 0 ] == pKeyV[0] &&\n                pRef[ 1 ] == pKeyV[1]   );\n}\n\n\ninline BOOL DifParser::IsNumber( const sal_Unicode cChar )\n{\n    return ( cChar >= '0' && cChar <= '9' );\n}\n\n\ninline BOOL DifParser::IsNumberEnding( const sal_Unicode cChar )\n{\n    return ( cChar == 0x00 );\n}\n\n\ninline BOOL DifParser::IsPlain( void ) const\n{\n    return bPlain;\n}\n\n\n\n\nclass DifAttrCache;\nclass ScPatternAttr;\n\n\nclass DifColumn : private List\n{\nprivate:\n    friend DifAttrCache;\n    struct ENTRY\n    {\n        UINT32          nNumFormat;\n\n        UINT16          nStart;\n        UINT16          nEnd;\n    };\n\n    ENTRY*              pAkt;\n\n    inline              DifColumn( void );\n                        ~DifColumn();\n    void                SetLogical( UINT16 nRow );\n    void                SetNumFormat( UINT16 nRow, const UINT32 nNumFormat );\n    void                NewEntry( const UINT16 nPos, const UINT32 nNumFormat );\n    void                Apply( ScDocument&, const UINT16 nCol, const UINT16 nTab, const ScPatternAttr& );\n    void                Apply( ScDocument &rDoc, const UINT16 nCol, const UINT16 nTab );\npublic:     \/\/ geht niemanden etwas an...\n};\n\n\ninline DifColumn::DifColumn( void )\n{\n    pAkt = NULL;\n}\n\n\n\n\nclass DifAttrCache\n{\nprivate:\n    DifColumn**         ppCols;\n    BOOL                bPlain;\npublic:\n                        DifAttrCache( const BOOL bPlain );\n                        ~DifAttrCache();\n    inline void         SetLogical( const UINT16 nCol, const UINT16 nRow );\n    void                SetNumFormat( const UINT16 nCol, const UINT16 nRow, const UINT32 nNumFormat );\n    void                Apply( ScDocument&, UINT16 nTab );\n};\n\n\ninline void DifAttrCache::SetLogical( const UINT16 nCol, const UINT16 nRow )\n{\n    DBG_ASSERT( nCol <= MAXCOL, \"-DifAttrCache::SetLogical(): Col zu gross!\" );\n    DBG_ASSERT( bPlain, \"*DifAttrCache::SetLogical(): muss Plain sein!\" );\n\n    if( !ppCols[ nCol ] )\n        ppCols[ nCol ] = new DifColumn;\n    ppCols[ nCol ]->SetLogical( nRow );\n}\n\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS ooo20031110 (1.2.166); FILE MERGED 2003\/11\/07 11:00:47 waratah 1.2.166.1: #i21906# add class keyword after friend<commit_after>\/*************************************************************************\n *\n *  $RCSfile: dif.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2003-12-01 17:51: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#ifndef _DIF_HXX\n#define _DIF_HXX\n\n\n#ifndef _TOOLS_DEBUG_HXX \/\/autogen\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\n#ifndef SC_SCGLOB_HXX\n#include \"global.hxx\"\n#endif\n\n\nclass SvStream;\nclass SvNumberFormatter;\nclass ScDocument;\nclass ScPatternAttr;\n\nextern const sal_Unicode pKeyTABLE[];\nextern const sal_Unicode pKeyVECTORS[];\nextern const sal_Unicode pKeyTUPLES[];\nextern const sal_Unicode pKeyDATA[];\nextern const sal_Unicode pKeyBOT[];\nextern const sal_Unicode pKeyEOD[];\nextern const sal_Unicode pKeyTRUE[];\nextern const sal_Unicode pKeyFALSE[];\nextern const sal_Unicode pKeyNA[];\nextern const sal_Unicode pKeyV[];\nextern const sal_Unicode pKey1_0[];\n\n\nenum TOPIC\n{\n    T_UNKNOWN,\n    T_TABLE, T_VECTORS, T_TUPLES, T_DATA, T_LABEL, T_COMMENT, T_SIZE,\n    T_PERIODICITY, T_MAJORSTART, T_MINORSTART, T_TRUELENGTH, T_UINITS,\n    T_DISPLAYUNITS,\n    T_END\n};\n\nenum DATASET { D_BOT, D_EOD, D_NUMERIC, D_STRING, D_UNKNOWN, D_SYNT_ERROR };\n\n\nclass DifParser\n{\npublic:\n    String              aData;\n    double              fVal;\n    UINT32              nVector;\n    UINT32              nVal;\n    UINT32              nNumFormat;\n    CharSet             eCharSet;\nprivate:\n    SvNumberFormatter*  pNumFormatter;\n    SvStream&           rIn;\n    BOOL                bPlain;\n\n    static inline BOOL  IsBOT( const sal_Unicode* pRef );\n    static inline BOOL  IsEOD( const sal_Unicode* pRef );\n    static inline BOOL  Is1_0( const sal_Unicode* pRef );\npublic:\n                        DifParser( SvStream&, const UINT32 nOption, ScDocument&, CharSet );\n\n    TOPIC               GetNextTopic( void );\n\n    DATASET             GetNextDataset( void );\n\n    const sal_Unicode*  ScanIntVal( const sal_Unicode* pStart, UINT32& rRet );\n    BOOL                ScanFloatVal( const sal_Unicode* pStart );\n\n    inline BOOL         IsNumber( const sal_Unicode cChar );\n    inline BOOL         IsNumberEnding( const sal_Unicode cChar );\n\n    static inline BOOL  IsV( const sal_Unicode* pRef );\n\n    inline BOOL         IsPlain( void ) const;\n};\n\n\ninline BOOL DifParser::IsBOT( const sal_Unicode* pRef )\n{\n    return  (   pRef[ 0 ] == pKeyBOT[0] &&\n                pRef[ 1 ] == pKeyBOT[1] &&\n                pRef[ 2 ] == pKeyBOT[2] &&\n                pRef[ 3 ] == pKeyBOT[3] );\n}\n\n\ninline BOOL DifParser::IsEOD( const sal_Unicode* pRef )\n{\n    return  (   pRef[ 0 ] == pKeyEOD[0] &&\n                pRef[ 1 ] == pKeyEOD[1] &&\n                pRef[ 2 ] == pKeyEOD[2] &&\n                pRef[ 3 ] == pKeyEOD[3] );\n}\n\n\ninline BOOL DifParser::Is1_0( const sal_Unicode* pRef )\n{\n    return  (   pRef[ 0 ] == pKey1_0[0] &&\n                pRef[ 1 ] == pKey1_0[1] &&\n                pRef[ 2 ] == pKey1_0[2] &&\n                pRef[ 3 ] == pKey1_0[3] );\n}\n\n\ninline BOOL DifParser::IsV( const sal_Unicode* pRef )\n{\n    return  (   pRef[ 0 ] == pKeyV[0] &&\n                pRef[ 1 ] == pKeyV[1]   );\n}\n\n\ninline BOOL DifParser::IsNumber( const sal_Unicode cChar )\n{\n    return ( cChar >= '0' && cChar <= '9' );\n}\n\n\ninline BOOL DifParser::IsNumberEnding( const sal_Unicode cChar )\n{\n    return ( cChar == 0x00 );\n}\n\n\ninline BOOL DifParser::IsPlain( void ) const\n{\n    return bPlain;\n}\n\n\n\n\nclass DifAttrCache;\nclass ScPatternAttr;\n\n\nclass DifColumn : private List\n{\nprivate:\n    friend class DifAttrCache;\n    struct ENTRY\n    {\n        UINT32          nNumFormat;\n\n        UINT16          nStart;\n        UINT16          nEnd;\n    };\n\n    ENTRY*              pAkt;\n\n    inline              DifColumn( void );\n                        ~DifColumn();\n    void                SetLogical( UINT16 nRow );\n    void                SetNumFormat( UINT16 nRow, const UINT32 nNumFormat );\n    void                NewEntry( const UINT16 nPos, const UINT32 nNumFormat );\n    void                Apply( ScDocument&, const UINT16 nCol, const UINT16 nTab, const ScPatternAttr& );\n    void                Apply( ScDocument &rDoc, const UINT16 nCol, const UINT16 nTab );\npublic:     \/\/ geht niemanden etwas an...\n};\n\n\ninline DifColumn::DifColumn( void )\n{\n    pAkt = NULL;\n}\n\n\n\n\nclass DifAttrCache\n{\nprivate:\n    DifColumn**         ppCols;\n    BOOL                bPlain;\npublic:\n                        DifAttrCache( const BOOL bPlain );\n                        ~DifAttrCache();\n    inline void         SetLogical( const UINT16 nCol, const UINT16 nRow );\n    void                SetNumFormat( const UINT16 nCol, const UINT16 nRow, const UINT32 nNumFormat );\n    void                Apply( ScDocument&, UINT16 nTab );\n};\n\n\ninline void DifAttrCache::SetLogical( const UINT16 nCol, const UINT16 nRow )\n{\n    DBG_ASSERT( nCol <= MAXCOL, \"-DifAttrCache::SetLogical(): Col zu gross!\" );\n    DBG_ASSERT( bPlain, \"*DifAttrCache::SetLogical(): muss Plain sein!\" );\n\n    if( !ppCols[ nCol ] )\n        ppCols[ nCol ] = new DifColumn;\n    ppCols[ nCol ]->SetLogical( nRow );\n}\n\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cbutton.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 21:13:59 $\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\n#ifndef SC_CBUTTON_HXX\n#define SC_CBUTTON_HXX\n\n#ifndef _GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n\nclass Window;\n\n\n\/\/==================================================================\n\nclass ScDDComboBoxButton\n{\npublic:\n            ScDDComboBoxButton( Window* pOutputDevice );\n            ~ScDDComboBoxButton();\n\n    void    Draw( const Point&  rAt,\n                  const Size&   rSize,\n                  BOOL          bState,\n                  BOOL          bBtnIn = FALSE );\n\n    void    Draw( const Point&  rAt,\n                  BOOL          bState,\n                  BOOL          bBtnIn = FALSE )\n                { Draw( rAt, aBtnSize, bState, bBtnIn ); }\n\n    void    Draw( BOOL          bState,\n                  BOOL          bBtnIn = FALSE )\n                { Draw( aBtnPos, aBtnSize, bState, bBtnIn ); }\n\n    void    SetOptSizePixel();\n\n    void    SetPosPixel( const Point& rNewPos )  { aBtnPos = rNewPos; }\n    Point   GetPosPixel() const                  { return aBtnPos; }\n\n    void    SetSizePixel( const Size& rNewSize ) { aBtnSize = rNewSize; }\n    Size    GetSizePixel() const                 { return aBtnSize; }\n\nprivate:\n    void    ImpDrawArrow( const Rectangle&  rRect,\n                          BOOL              bState );\n\nprotected:\n    Window* pOut;\n    Point   aBtnPos;\n    Size    aBtnSize;\n};\n\n\n#endif \/\/ SC_CBUTTON_HXX\n\n\n<commit_msg>INTEGRATION: CWS aw046 (1.4.384); FILE MERGED 2007\/02\/22 17:56:07 nn 1.4.384.1: #i74768# use variable pContentDev to draw content in ScGridWindow::Draw<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cbutton.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-26 11:50: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\/\/------------------------------------------------------------------\n\n#ifndef SC_CBUTTON_HXX\n#define SC_CBUTTON_HXX\n\n#ifndef _GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n\nclass OutputDevice;\n\n\n\/\/==================================================================\n\nclass ScDDComboBoxButton\n{\npublic:\n            ScDDComboBoxButton( OutputDevice* pOutputDevice );\n            ~ScDDComboBoxButton();\n\n    void    SetOutputDevice( OutputDevice* pOutputDevice );\n\n    void    Draw( const Point&  rAt,\n                  const Size&   rSize,\n                  BOOL          bState,\n                  BOOL          bBtnIn = FALSE );\n\n    void    Draw( const Point&  rAt,\n                  BOOL          bState,\n                  BOOL          bBtnIn = FALSE )\n                { Draw( rAt, aBtnSize, bState, bBtnIn ); }\n\n    void    Draw( BOOL          bState,\n                  BOOL          bBtnIn = FALSE )\n                { Draw( aBtnPos, aBtnSize, bState, bBtnIn ); }\n\n    void    SetOptSizePixel();\n\n    void    SetPosPixel( const Point& rNewPos )  { aBtnPos = rNewPos; }\n    Point   GetPosPixel() const                  { return aBtnPos; }\n\n    void    SetSizePixel( const Size& rNewSize ) { aBtnSize = rNewSize; }\n    Size    GetSizePixel() const                 { return aBtnSize; }\n\nprivate:\n    void    ImpDrawArrow( const Rectangle&  rRect,\n                          BOOL              bState );\n\nprotected:\n    OutputDevice* pOut;\n    Point   aBtnPos;\n    Size    aBtnSize;\n};\n\n\n#endif \/\/ SC_CBUTTON_HXX\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: hdrcont.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2004-06-04 11:34:09 $\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_HDRCONT_HXX\n#define SC_HDRCONT_HXX\n\n#ifndef _WINDOW_HXX \/\/autogen\n#include <vcl\/window.hxx>\n#endif\n#ifndef _SELENG_HXX \/\/autogen\n#include <vcl\/seleng.hxx>\n#endif\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\n\/\/ ---------------------------------------------------------------------------\n\n\n#define HDR_HORIZONTAL      0\n#define HDR_VERTICAL        1\n\n#define HDR_SIZE_OPTIMUM    0xFFFF\n\n\n                                    \/\/ Groesse des Sliders\n#define HDR_SLIDERSIZE      2\n\nclass ScHeaderControl : public Window\n{\nprivate:\n    SelectionEngine*    pSelEngine;\n    Font                aNormFont;\n    Font                aBoldFont;\n    BOOL                bBoldSet;\n\n    USHORT          nFlags;\n    BOOL            bVertical;              \/\/ Vertikal = Zeilenheader\n\n    long            nWidth;\n    long            nSmallWidth;\n    long            nBigWidth;\n\n    SCCOLROW        nSize;\n\n    SCCOLROW        nMarkStart;\n    SCCOLROW        nMarkEnd;\n    BOOL            bMarkRange;\n\n    BOOL            bDragging;              \/\/ Groessen aendern\n    SCCOLROW        nDragNo;\n    long            nDragStart;\n    long            nDragPos;\n    BOOL            bDragMoved;\n\n    BOOL            bIgnoreMove;\n\n    long            GetScrPos( SCCOLROW nEntryNo );\n    SCCOLROW        GetMousePos( const MouseEvent& rMEvt, BOOL& rBorder );\n\n    void            ShowDragHelp();\n\n    void            DoPaint( SCCOLROW nStart, SCCOLROW nEnd );\n\nprotected:\n                    \/\/  von Window ueberladen\n\n    virtual void    Paint( const Rectangle& rRect );\n\n    virtual void    MouseMove( const MouseEvent& rMEvt );\n    virtual void    MouseButtonUp( const MouseEvent& rMEvt );\n    virtual void    MouseButtonDown( const MouseEvent& rMEvt );\n    virtual void    Tracking( const TrackingEvent& rTEvt );\n\n    virtual void    RequestHelp( const HelpEvent& rHEvt );\n\n                    \/\/  neue Methoden\n\n    virtual SCCOLROW    GetPos() = 0;                               \/\/ aktuelle Position (Scrolling)\n    virtual USHORT  GetEntrySize( SCCOLROW nEntryNo ) = 0;      \/\/ Breite \/ Hoehe (Pixel)\n    virtual String  GetEntryText( SCCOLROW nEntryNo ) = 0;\n\n    virtual SCCOLROW GetHiddenCount( SCCOLROW nEntryNo );\n    virtual BOOL    IsLayoutRTL();\n    virtual BOOL    IsMirrored();\n\n    virtual void    SetEntrySize( SCCOLROW nPos, USHORT nNewWidth ) = 0;\n    virtual void    HideEntries( SCCOLROW nStart, SCCOLROW nEnd ) = 0;\n\n    virtual void    SetMarking( BOOL bSet );\n    virtual void    SelectWindow();\n    virtual BOOL    IsDisabled();\n    virtual BOOL    ResizeAllowed();\n    virtual String  GetDragHelp( long nVal );\n\n    virtual void    DrawInvert( long nDragPos );\n    virtual void    Command( const CommandEvent& rCEvt );\n\npublic:\n            ScHeaderControl( Window* pParent, SelectionEngine* pSelectionEngine,\n                                SCCOLROW nNewSize, USHORT nNewFlags );\n            ~ScHeaderControl();\n\n    void    SetIgnoreMove(BOOL bSet)            { bIgnoreMove = bSet; }\n\n    void    StopMarking();\n\n    void    SetMark( BOOL bNewSet, SCCOLROW nNewStart, SCCOLROW nNewEnd );\n\n    long    GetWidth() const                    { return nWidth; }\n    long    GetSmallWidth() const               { return nSmallWidth; }\n    long    GetBigWidth() const                 { return nBigWidth; }\n    void    SetWidth( long nNew );\n};\n\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.452); FILE MERGED 2005\/09\/05 15:05:28 rt 1.3.452.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hdrcont.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 21:31:21 $\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_HDRCONT_HXX\n#define SC_HDRCONT_HXX\n\n#ifndef _WINDOW_HXX \/\/autogen\n#include <vcl\/window.hxx>\n#endif\n#ifndef _SELENG_HXX \/\/autogen\n#include <vcl\/seleng.hxx>\n#endif\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\n\/\/ ---------------------------------------------------------------------------\n\n\n#define HDR_HORIZONTAL      0\n#define HDR_VERTICAL        1\n\n#define HDR_SIZE_OPTIMUM    0xFFFF\n\n\n                                    \/\/ Groesse des Sliders\n#define HDR_SLIDERSIZE      2\n\nclass ScHeaderControl : public Window\n{\nprivate:\n    SelectionEngine*    pSelEngine;\n    Font                aNormFont;\n    Font                aBoldFont;\n    BOOL                bBoldSet;\n\n    USHORT          nFlags;\n    BOOL            bVertical;              \/\/ Vertikal = Zeilenheader\n\n    long            nWidth;\n    long            nSmallWidth;\n    long            nBigWidth;\n\n    SCCOLROW        nSize;\n\n    SCCOLROW        nMarkStart;\n    SCCOLROW        nMarkEnd;\n    BOOL            bMarkRange;\n\n    BOOL            bDragging;              \/\/ Groessen aendern\n    SCCOLROW        nDragNo;\n    long            nDragStart;\n    long            nDragPos;\n    BOOL            bDragMoved;\n\n    BOOL            bIgnoreMove;\n\n    long            GetScrPos( SCCOLROW nEntryNo );\n    SCCOLROW        GetMousePos( const MouseEvent& rMEvt, BOOL& rBorder );\n\n    void            ShowDragHelp();\n\n    void            DoPaint( SCCOLROW nStart, SCCOLROW nEnd );\n\nprotected:\n                    \/\/  von Window ueberladen\n\n    virtual void    Paint( const Rectangle& rRect );\n\n    virtual void    MouseMove( const MouseEvent& rMEvt );\n    virtual void    MouseButtonUp( const MouseEvent& rMEvt );\n    virtual void    MouseButtonDown( const MouseEvent& rMEvt );\n    virtual void    Tracking( const TrackingEvent& rTEvt );\n\n    virtual void    RequestHelp( const HelpEvent& rHEvt );\n\n                    \/\/  neue Methoden\n\n    virtual SCCOLROW    GetPos() = 0;                               \/\/ aktuelle Position (Scrolling)\n    virtual USHORT  GetEntrySize( SCCOLROW nEntryNo ) = 0;      \/\/ Breite \/ Hoehe (Pixel)\n    virtual String  GetEntryText( SCCOLROW nEntryNo ) = 0;\n\n    virtual SCCOLROW GetHiddenCount( SCCOLROW nEntryNo );\n    virtual BOOL    IsLayoutRTL();\n    virtual BOOL    IsMirrored();\n\n    virtual void    SetEntrySize( SCCOLROW nPos, USHORT nNewWidth ) = 0;\n    virtual void    HideEntries( SCCOLROW nStart, SCCOLROW nEnd ) = 0;\n\n    virtual void    SetMarking( BOOL bSet );\n    virtual void    SelectWindow();\n    virtual BOOL    IsDisabled();\n    virtual BOOL    ResizeAllowed();\n    virtual String  GetDragHelp( long nVal );\n\n    virtual void    DrawInvert( long nDragPos );\n    virtual void    Command( const CommandEvent& rCEvt );\n\npublic:\n            ScHeaderControl( Window* pParent, SelectionEngine* pSelectionEngine,\n                                SCCOLROW nNewSize, USHORT nNewFlags );\n            ~ScHeaderControl();\n\n    void    SetIgnoreMove(BOOL bSet)            { bIgnoreMove = bSet; }\n\n    void    StopMarking();\n\n    void    SetMark( BOOL bNewSet, SCCOLROW nNewStart, SCCOLROW nNewEnd );\n\n    long    GetWidth() const                    { return nWidth; }\n    long    GetSmallWidth() const               { return nSmallWidth; }\n    long    GetBigWidth() const                 { return nBigWidth; }\n    void    SetWidth( long nNew );\n};\n\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sizedev.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 21:50: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#ifndef SC_SIZEDEV_HXX\n#define SC_SIZEDEV_HXX\n\n#ifndef _SV_MAPMOD_HXX\n#include <vcl\/mapmod.hxx>\n#endif\n\nclass OutputDevice;\nclass ScDocShell;\n\nclass ScSizeDeviceProvider\n{\n    OutputDevice*   pDevice;\n    BOOL            bOwner;\n    double          nPPTX;\n    double          nPPTY;\n    MapMode         aOldMapMode;\n\npublic:\n                ScSizeDeviceProvider( ScDocShell* pDocSh );\n                ~ScSizeDeviceProvider();\n\n    OutputDevice*   GetDevice() const   { return pDevice; }\n    double          GetPPTX() const     { return nPPTX; }\n    double          GetPPTY() const     { return nPPTY; }\n    BOOL            IsPrinter() const   { return !bOwner; }\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.700); FILE MERGED 2008\/04\/01 15:31:00 thb 1.3.700.2: #i85898# Stripping all external header guards 2008\/03\/31 17:15:48 rt 1.3.700.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: sizedev.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 SC_SIZEDEV_HXX\n#define SC_SIZEDEV_HXX\n\n#include <vcl\/mapmod.hxx>\n\nclass OutputDevice;\nclass ScDocShell;\n\nclass ScSizeDeviceProvider\n{\n    OutputDevice*   pDevice;\n    BOOL            bOwner;\n    double          nPPTX;\n    double          nPPTY;\n    MapMode         aOldMapMode;\n\npublic:\n                ScSizeDeviceProvider( ScDocShell* pDocSh );\n                ~ScSizeDeviceProvider();\n\n    OutputDevice*   GetDevice() const   { return pDevice; }\n    double          GetPPTX() const     { return nPPTX; }\n    double          GetPPTY() const     { return nPPTY; }\n    BOOL            IsPrinter() const   { return !bOwner; }\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n *  @author Richard Everhart\n *  @date   July 2017\n *\n *  Declarations and template definitions for all tsty library \n *  functions\n!*\/\n\n#ifndef TSTY_HPP__\n#define TSTY_HPP__\n\n#include <type_traits>\n#include <string>\n\nnamespace tsty {\n\n\/\/! Rudimentary structure for storing RGB color values.\nstruct Rgb {\n    unsigned char r = 0, g = 0, b = 0;\n\n    \/\/! Constructor for initializing r, g, b values from a hexadecimal\n    explicit Rgb(unsigned int hex);\n\n    \/*! \n     *  Method for acquiring a hexadecimal representation of the rgb color \n     *  data.\n     *\n     *  @return An unsigned integer that is the hexadecimal representation\n    !*\/\n    unsigned int hex();\n};\ntypedef Rgb rgb;\n\n\n\/\/! Enum containing flags representing various ANSI-Supported text emphasis\nenum Emphasis {\n    NORMAL          = 0x000001,\n    BOLD            = 0x000002,\n    FAINT           = 0x000004,\n    ITALIC          = 0x000008,\n    UNDERLINE       = 0x000010,\n    SLOW_BLINK      = 0x000020,\n    FAST_BLINK      = 0x000040,\n    NEGATIVE        = 0x000080,\n    CONCEAL         = 0x000100,\n    CROSS_OUT       = 0x000200,\n    FRAKTUR         = 0x000400,\n    NO_BOLD         = 0x000800,\n    NO_COLOR        = 0x001000,\n    NO_ITALIC       = 0x002000,\n    NO_UNDERLINE    = 0x004000,\n    POSITIVE        = 0x008000,\n    REVEAL          = 0x010000,\n    NO_CROSS_OUT    = 0x020000,\n    FRAME           = 0x040000,\n    ENCIRCLE        = 0x080000,\n    OVERLINE        = 0x100000,\n    NO_FRAME        = 0x200000,\n    NO_OVERLINE     = 0x400000\n};\ntypedef Emphasis emphasis;\n\n\/*!\n *  Sets the current emphasis of all subsequent outputted text to correspond to\n *  the emphasis specified by flags.\n *\n *  Example usage:\n *  @code\n *      emphasis(ITALIC | NEGATIVE | FRAME);\n *  @endcode\n *\n *  @param flags    A bit flag specifying the emphasis\n!*\/\nvoid emphasis_on(unsigned int flags);\n\n\/*!\n *  Sets the current emphasis of all subsequent outputted text to correspond to\n *  the emphasis specified by a variadic list of elements n.\n *\n *  Example usage:\n *  @code\n *      emphasis(ITALIC, NEGATIVE, FRAME);\n *  @endcode\n *\n *  @param n    A variadic list specifying the emphasis\n!*\/\nvoid emphasis_on(Emphasis n...);\n\n\/\/! Turns off any emphasis that may have been set previously using \nvoid emphasis_off();\n\n\/*!\n *  Returns a string representing an ANSI escape sequence that may be printed\n *  in the future to set the emphasis.\n *\n *  Example usage:\n *  @code\n *      std::string str = ansi_emphasis(ITALIC | BOLD);\n *      std::cout << str << \"Styled text!\" << std::endl;\n *  @endcode\n *\n *  @param flags    A bit flag specifying the emphasis\n *\n *  @return A string representing an ANSI escape sequence that may be pinted in\n *          the future to set the emphasis.\n!*\/\nstd::string ansi_emphasis(unsigned int flags);\n\n\/*!\n *  Returns a string representing an ANSI escape sequence that may be printed\n *  in the future to set the emphasis.\n *\n *  Example usage:\n *  @code\n *      std::string str = ansi_emphasis(ITALIC, BOLD);\n *      std::cout << str << \"Styled text!\" << std::endl;\n *  @endcode\n *  \n *  @param n    A variadic list specifying the emphasis\n *\n *  @return A string representing an ANSI escape sequence that may be pinted in\n *          the future to set the emphasis.\n!*\/\nstd::string ansi_emphasis(Emphasis n...);\n\n}\n\n#endif\n<commit_msg>Added color_on(), color_off() and ansi_color() function declarations.<commit_after>\/*!\n *  @author Richard Everhart\n *  @date   July 2017\n *\n *  Declarations and template definitions for all tsty library \n *  functions\n!*\/\n\n#ifndef TSTY_HPP__\n#define TSTY_HPP__\n\n#include <type_traits>\n#include <string>\n\nnamespace tsty {\n\n\/\/! Rudimentary structure for storing RGB color values.\nstruct Rgb {\n    unsigned char r = 0, g = 0, b = 0;\n\n    \/\/! Constructor for initializing r, g, b values from a hexadecimal\n    explicit Rgb(unsigned int hex);\n\n    \/*! \n     *  Method for acquiring a hexadecimal representation of the rgb color \n     *  data.\n     *\n     *  @return An unsigned integer that is the hexadecimal representation\n    !*\/\n    unsigned int hex();\n};\ntypedef Rgb rgb;\n\n\n\/\/! Enum containing flags representing various ANSI-Supported text emphasis\nenum Emphasis {\n    NORMAL          = 0x000001,\n    BOLD            = 0x000002,\n    FAINT           = 0x000004,\n    ITALIC          = 0x000008,\n    UNDERLINE       = 0x000010,\n    SLOW_BLINK      = 0x000020,\n    FAST_BLINK      = 0x000040,\n    NEGATIVE        = 0x000080,\n    CONCEAL         = 0x000100,\n    CROSS_OUT       = 0x000200,\n    FRAKTUR         = 0x000400,\n    NO_BOLD         = 0x000800,\n    NO_COLOR        = 0x001000,\n    NO_ITALIC       = 0x002000,\n    NO_UNDERLINE    = 0x004000,\n    POSITIVE        = 0x008000,\n    REVEAL          = 0x010000,\n    NO_CROSS_OUT    = 0x020000,\n    FRAME           = 0x040000,\n    ENCIRCLE        = 0x080000,\n    OVERLINE        = 0x100000,\n    NO_FRAME        = 0x200000,\n    NO_OVERLINE     = 0x400000\n};\ntypedef Emphasis emphasis;\n\n\/*!\n *  Sets the current emphasis of all subsequent outputted text to correspond to\n *  the emphasis specified by flags.\n *\n *  Example usage:\n *  @code\n *      emphasis(ITALIC | NEGATIVE | FRAME);\n *  @endcode\n *\n *  @param flags    A bit flag specifying the emphasis\n!*\/\nvoid emphasis_on(unsigned int flags);\n\n\/*!\n *  Sets the current emphasis of all subsequent outputted text to correspond to\n *  the emphasis specified by a variadic list of elements n.\n *\n *  Example usage:\n *  @code\n *      emphasis(ITALIC, NEGATIVE, FRAME);\n *  @endcode\n *\n *  @param n    A variadic list specifying the emphasis\n!*\/\nvoid emphasis_on(Emphasis n...);\n\n\/\/! Turns off any emphasis that may have been set previously\nvoid emphasis_off();\n\n\/*!\n *  Returns a string representing an ANSI escape sequence that may be printed\n *  in the future to set the emphasis.\n *\n *  Example usage:\n *  @code\n *      std::string str = ansi_emphasis(ITALIC | BOLD);\n *      std::cout << str << \"Styled text!\" << std::endl;\n *  @endcode\n *\n *  @param flags    A bit flag specifying the emphasis\n *\n *  @return A string representing an ANSI escape sequence that may be pinted in\n *          the future to set the text emphasis.\n!*\/\nstd::string ansi_emphasis(unsigned int flags);\n\n\/*!\n *  Returns a string representing an ANSI escape sequence that may be printed\n *  in the future to set the emphasis.\n *\n *  Example usage:\n *  @code\n *      std::string str = ansi_emphasis(ITALIC, BOLD);\n *      std::cout << str << \"Styled text!\" << std::endl;\n *  @endcode\n *  \n *  @param n    A variadic list specifying the emphasis\n *\n *  @return A string representing an ANSI escape sequence that may be printed\n *          in the future to set the text emphasis.\n!*\/\nstd::string ansi_emphasis(Emphasis n...);\n\n\/*!\n *  Sets the background and foreground colors of all subsequent outputted text\n *  to correspond to the values specified by fg and bg, respectively.\n * \n *  Example usage:\n *  @code\n *      color_on(rgb(127, 127, 255), rgb(255, 127, 127);\n *  @endcode\n *\n *  @param fg   A rgb color value specifying the desired foreground color\n *  @param bg   A rgb color value specifying the desired background color\n!*\/\nvoid color_on(rgb fg, rgb bg);\n\n\/\/! Turns off any color that may have been set previously\nvoid color_off();\n\n\/*!\n *  Returns a string representing an ANSI escape sequence that may be printed\n *  in the future to set the text color.\n *  \n *  Example usage:\n *  @code\n *      std::string str = ansi_color(rgb(0, 0, 0), rgb(255, 255, 255));\n *      std::cout << str << \"Black text on a white background!\" << std::endl;\n *  @endcode\n *\n *  @param fg   A rgb color value specifying the desired foreground color\n *  @param bg   A rgb color value specifying the desired background color\n *\n *  @return A string representing an ANSI escape sequence that may be printed\n *          in the future to set the text color.\n!*\/\nansi_color(rgb fg, rgb bg);\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"fencemodel.h\"\n\nusing namespace troen;\n\nFenceModel::FenceModel(FenceController* fenceController)\n{\n\tm_fenceController = fenceController;\n\tm_rigidBodies = std::vector<std::shared_ptr<btRigidBody>>();\n}\n\nvoid FenceModel::addFencePart(btVector3 a, btVector3 b)\n{\n\tbtVector3 fenceVector = b - a;\n\t\n\t\/\/ TODO: convert to shared_ptr\n\tbtBoxShape *boxShape = new btBoxShape(btVector3(1, fenceVector.length() \/ 2, getFenceHeight() \/ 2));\n\t\n\tconst btVector3 up = btVector3(0, 0, 1);\n\tconst btVector3 forward = btVector3(0, 1, 0);\n\tconst btScalar angle = fenceVector.angle(forward);\n\n\tbtQuaternion rotationQuat;\n\tif (angle > 0) {\n\t\tbtVector3 axis = fenceVector.cross(-forward).normalized();\n\t\trotationQuat = btQuaternion(axis, angle);\n\t}\n\tbtDefaultMotionState *fenceMotionState = new btDefaultMotionState(btTransform(rotationQuat, (a + b) \/ 2 + btVector3(0, 0, getFenceHeight() \/ 2)));\n\n\tconst btScalar mass = 0;\n\tconst btVector3 fenceInertia(0, 0, 0);\n\t\n\tbtRigidBody::btRigidBodyConstructionInfo m_fenceRigidBodyCI(mass, fenceMotionState, boxShape, fenceInertia);\n\n\tstd::shared_ptr<btRigidBody> fenceRigidBody = std::make_shared<btRigidBody>(m_fenceRigidBodyCI);\n\n\tm_rigidBodies.push_back(fenceRigidBody);\n}\n\nbtRigidBody* FenceModel::getLastPart() {\n\treturn m_rigidBodies.back().get();\n}\n\nvoid FenceModel::addFenceMarker(btVector3 a)\n{\n\t\/\/ TODO: convert to shared_ptr\n\tbtBoxShape *boxShape = new btBoxShape(btVector3(0.5, 0.5, getFenceHeight() \/ 2));\n\t\n\tbtDefaultMotionState *fenceMotionState = new btDefaultMotionState(btTransform(btQuaternion(0, 0, 0, 1), a + btVector3(0, 0, getFenceHeight() \/ 4)));\n\n\t\/\/ set mass to zero so that we get a static rigidBody (is this enough?)\n\tbtScalar mass = 0;\n\tbtVector3 fenceInertia(0, 0, 0);\n\t\/\/ boxShape->calculateLocalInertia(mass, fenceInertia);www\n\n\tbtRigidBody::btRigidBodyConstructionInfo m_fenceRigidBodyCI(mass, fenceMotionState, boxShape, fenceInertia);\n\n\tstd::shared_ptr<btRigidBody> fenceRigidBody = std::make_shared<btRigidBody>(m_fenceRigidBodyCI);\n\n\tm_rigidBodies.push_back(fenceRigidBody);\n}\n\nfloat FenceModel::getFenceHeight()\n{\n\treturn 20;\n}<commit_msg>fixes collision with fence sound, two lines of code got lost in merge<commit_after>#include \"fencemodel.h\"\n\nusing namespace troen;\n\nFenceModel::FenceModel(FenceController* fenceController)\n{\n\tm_fenceController = fenceController;\n\tm_rigidBodies = std::vector<std::shared_ptr<btRigidBody>>();\n}\n\nvoid FenceModel::addFencePart(btVector3 a, btVector3 b)\n{\n\tbtVector3 fenceVector = b - a;\n\t\n\t\/\/ TODO: convert to shared_ptr\n\tbtBoxShape *boxShape = new btBoxShape(btVector3(1, fenceVector.length() \/ 2, getFenceHeight() \/ 2));\n\t\n\tconst btVector3 up = btVector3(0, 0, 1);\n\tconst btVector3 forward = btVector3(0, 1, 0);\n\tconst btScalar angle = fenceVector.angle(forward);\n\n\tbtQuaternion rotationQuat;\n\tif (angle > 0) {\n\t\tbtVector3 axis = fenceVector.cross(-forward).normalized();\n\t\trotationQuat = btQuaternion(axis, angle);\n\t}\n\tbtDefaultMotionState *fenceMotionState = new btDefaultMotionState(btTransform(rotationQuat, (a + b) \/ 2 + btVector3(0, 0, getFenceHeight() \/ 2)));\n\n\tconst btScalar mass = 0;\n\tconst btVector3 fenceInertia(0, 0, 0);\n\t\n\tbtRigidBody::btRigidBodyConstructionInfo m_fenceRigidBodyCI(mass, fenceMotionState, boxShape, fenceInertia);\n\n\tstd::shared_ptr<btRigidBody> fenceRigidBody = std::make_shared<btRigidBody>(m_fenceRigidBodyCI);\n\tfenceRigidBody->setUserPointer(m_fenceController);\n\n\tm_rigidBodies.push_back(fenceRigidBody);\n}\n\nbtRigidBody* FenceModel::getLastPart() {\n\treturn m_rigidBodies.back().get();\n}\n\nvoid FenceModel::addFenceMarker(btVector3 a)\n{\n\t\/\/ TODO: convert to shared_ptr\n\tbtBoxShape *boxShape = new btBoxShape(btVector3(0.5, 0.5, getFenceHeight() \/ 2));\n\t\n\tbtDefaultMotionState *fenceMotionState = new btDefaultMotionState(btTransform(btQuaternion(0, 0, 0, 1), a + btVector3(0, 0, getFenceHeight() \/ 4)));\n\n\t\/\/ set mass to zero so that we get a static rigidBody (is this enough?)\n\tbtScalar mass = 0;\n\tbtVector3 fenceInertia(0, 0, 0);\n\t\/\/ boxShape->calculateLocalInertia(mass, fenceInertia);www\n\n\tbtRigidBody::btRigidBodyConstructionInfo m_fenceRigidBodyCI(mass, fenceMotionState, boxShape, fenceInertia);\n\n\tstd::shared_ptr<btRigidBody> fenceRigidBody = std::make_shared<btRigidBody>(m_fenceRigidBodyCI);\n\tfenceRigidBody->setUserPointer(m_fenceController);\n\n\tm_rigidBodies.push_back(fenceRigidBody);\n}\n\nfloat FenceModel::getFenceHeight()\n{\n\treturn 20;\n}<|endoftext|>"}
{"text":"<commit_before>#include \"picasso.h\"\n\n\/\/ !! Taken from ctrulib !!\nu32 f32tof24(float vf)\n{\n\tif (!vf) return 0;\n\n\tunion { float f; u32 v; } q;\n\tq.f=vf;\n\n\tu8 s = q.v>>31;\n\tu32 exp = ((q.v>>23) & 0xFF) - 0x40;\n\tu32 man = (q.v>>7) & 0xFFFF;\n\n\tif (exp >= 0)\n\t\treturn man | (exp<<16) | (s<<23);\n\telse\n\t\treturn s<<23;\n}\n\n#ifdef WIN32\nstatic inline void FixMinGWPath(char* buf)\n{\n\tif (buf && *buf == '\/')\n\t{\n\t\tbuf[0] = buf[1];\n\t\tbuf[1] = ':';\n\t}\n}\n#endif\n\nint usage(const char* prog)\n{\n\tfprintf(stderr,\n\t\t\"Usage:\\n\\n\"\n\t\t\"%s shbinFile vshFile [hFile]\\n\", prog);\n\treturn 0;\n}\n\nint main(int argc, char* argv[])\n{\n\tif (argc < 3 || argc > 4)\n\t\treturn usage(argv[0]);\n\n\tchar* shbinFile = argv[1];\n\tchar* vshFile = argv[2];\n\tchar* hFile = argc > 3 ? argv[3] : NULL;\n\n#ifdef WIN32\n\tFixMinGWPath(shbinFile);\n\tFixMinGWPath(vshFile);\n\tFixMinGWPath(hFile);\n#endif\n\n\tchar* sourceCode = StringFromFile(vshFile);\n\tif (!sourceCode)\n\t{\n\t\tfprintf(stderr, \"Cannot open input file!\\n\");\n\t\treturn 1;\n\t}\n\n\tint rc = AssembleString(sourceCode, vshFile);\n\tfree(sourceCode);\n\tif (rc != 0)\n\t\treturn rc;\n\n\tprocTableIter mainIt = g_procTable.find(\"main\");\n\tif (mainIt == g_procTable.end())\n\t{\n\t\tfprintf(stderr, \"Error: main proc not defined\\n\");\n\t\treturn 1;\n\t}\n\n\tFileClass f(shbinFile, \"wb\");\n\n\tif (f.openerror())\n\t{\n\t\tfprintf(stderr, \"Can't open output file!\");\n\t\treturn 1;\n\t}\n\n\tf.WriteWord(0x424C5644); \/\/ DVLB\n\tf.WriteWord(1); \/\/ 1 DVLE\n\tf.WriteWord(3*4 + 0x28); \/\/ offset to DVLE\n\n\tu32 dvlpStart = f.Tell();\n\tu32 shaderSize = g_outputBuf.size();\n\tu32 paramStart = 0x28 + 0x40;\n\n\tf.WriteWord(0x504C5644); \/\/ DVLP\n\tf.WriteWord(0); \/\/ version\n\tf.WriteWord(paramStart); \/\/ offset to shader binary blob\n\tf.WriteWord(shaderSize); \/\/ size of shader binary blob\n\tparamStart += shaderSize*4;\n\tf.WriteWord(paramStart); \/\/ offset to opdesc table\n\tf.WriteWord(g_opdescCount); \/\/ number of opdescs\n\tparamStart += g_opdescCount*8;\n\tf.WriteWord(paramStart); \/\/ offset to symtable (TODO)\n\tf.WriteWord(0); \/\/ ????\n\tf.WriteWord(0); \/\/ ????\n\tf.WriteWord(0); \/\/ ????\n\n\tu32 dvleStart = f.Tell();\n\tparamStart -= dvleStart - dvlpStart;\n\t\n\tf.WriteWord(0x454C5644); \/\/ DVLE\n\tf.WriteHword(0); \/\/ padding?\n\tf.WriteHword(0); \/\/ Vertex shader\n\tf.WriteWord(mainIt->second.first); \/\/ offset to main\n\tf.WriteWord(mainIt->second.first+mainIt->second.second); \/\/ offset to end of main\n\tf.WriteWord(0); \/\/ ???\n\tf.WriteWord(0); \/\/ ???\n\tf.WriteWord(paramStart); \/\/ offset to constant table\n\tf.WriteWord(g_constantCount); \/\/ size of constant table\n\tparamStart += g_constantCount*0x14;\n\tf.WriteWord(paramStart); \/\/ offset to label table (TODO)\n\tf.WriteWord(0); \/\/ size of label table (TODO)\n\tf.WriteWord(paramStart); \/\/ offset to output table\n\tf.WriteWord(g_outputCount); \/\/ size of output table\n\tparamStart += g_outputCount*8;\n\tf.WriteWord(paramStart); \/\/ offset to uniform table\n\tf.WriteWord(g_uniformCount); \/\/ size of uniform table\n\tparamStart += g_uniformCount*8;\n\tf.WriteWord(paramStart); \/\/ offset to symbol table\n\tu32 temp = f.Tell();\n\tf.WriteWord(0); \/\/ size of symbol table\n\n\t\/\/ Write program\n\t\/\/for (u32 p : g_outputBuf)\n\tfor (outputBufIter it = g_outputBuf.begin(); it != g_outputBuf.end(); ++it)\n\t\tf.WriteWord(*it);\n\n\t\/\/ Write opdescs\n\tfor (int i = 0; i < g_opdescCount; i ++)\n\t{\n\t\tf.WriteWord(g_opdescTable[i]);\n\t\tf.WriteWord(0x0000000F); \/\/ unknown\n\t}\n\n\t\/\/ Write constants\n\tfor (int i = 0; i < g_constantCount; i ++)\n\t{\n\t\tConstant& ct = g_constantTable[i];\n\t\tf.WriteHword(0);\n\t\tf.WriteByte(ct.regId-0x20);\n\t\tf.WriteByte(0);\n\t\tfor (int j = 0; j < 4; j ++)\n\t\t\tf.WriteWord(f32tof24(ct.param[j]));\n\t}\n\n\t\/\/ Write outputs\n\tfor (int i = 0; i < g_outputCount; i ++)\n\t\tf.WriteDword(g_outputTable[i]);\n\n\t\/\/ Write uniforms\n\tsize_t sp = 0;\n\tfor (int i = 0; i < g_uniformCount; i ++)\n\t{\n\t\tUniform& u = g_uniformTable[i];\n\t\tsize_t l = strlen(u.name)+1;\n\t\tf.WriteWord(sp); sp += l;\n\t\tf.WriteHword(u.pos-0x20);\n\t\tf.WriteHword(u.pos+u.size-1-0x20);\n\t}\n\n\t\/\/ Write size of symbol table\n\tu32 temp2 = f.Tell();\n\tf.Seek(temp, SEEK_SET);\n\tf.WriteWord(sp);\n\tf.Seek(temp2, SEEK_SET);\n\n\t\/\/ Write symbols\n\tfor (int i = 0; i < g_uniformCount; i ++)\n\t{\n\t\tconst char* u = g_uniformTable[i].name;\n\t\tsize_t l = strlen(u)+1;\n\t\tf.WriteRaw(u, l);\n\t}\n\n\tif (hFile)\n\t{\n\t\tFILE* f2 = fopen(hFile, \"w\");\n\t\tif (!f2)\n\t\t{\n\t\t\tfprintf(stderr, \"Can't open header file!\\n\");\n\t\t\treturn 1;\n\t\t}\n\n\t\tfprintf(f2, \"\/\/ Generated by picasso\\n\");\n\t\tfprintf(f2, \"#pragma once\\n\");\n\t\tfor (int i = 0; i < g_uniformCount; i ++)\n\t\t{\n\t\t\tUniform& u = g_uniformTable[i];\n\t\t\tfprintf(f2, \"#define SHADER_UREG_%s 0x%02X\\n\", u.name, u.pos-0x20);\n\t\t\tfprintf(f2, \"#define SHADER_ULEN_%s %d\\n\", u.name, u.size);\n\t\t}\n\n\t\tfclose(f2);\n\t}\n\n\treturn 0;\n}\n<commit_msg>Correct uniform handling value [pointed out by smea]<commit_after>#include \"picasso.h\"\n\n\/\/ !! Taken from ctrulib !!\nu32 f32tof24(float vf)\n{\n\tif (!vf) return 0;\n\n\tunion { float f; u32 v; } q;\n\tq.f=vf;\n\n\tu8 s = q.v>>31;\n\tu32 exp = ((q.v>>23) & 0xFF) - 0x40;\n\tu32 man = (q.v>>7) & 0xFFFF;\n\n\tif (exp >= 0)\n\t\treturn man | (exp<<16) | (s<<23);\n\telse\n\t\treturn s<<23;\n}\n\n#ifdef WIN32\nstatic inline void FixMinGWPath(char* buf)\n{\n\tif (buf && *buf == '\/')\n\t{\n\t\tbuf[0] = buf[1];\n\t\tbuf[1] = ':';\n\t}\n}\n#endif\n\nint usage(const char* prog)\n{\n\tfprintf(stderr,\n\t\t\"Usage:\\n\\n\"\n\t\t\"%s shbinFile vshFile [hFile]\\n\", prog);\n\treturn 0;\n}\n\nint main(int argc, char* argv[])\n{\n\tif (argc < 3 || argc > 4)\n\t\treturn usage(argv[0]);\n\n\tchar* shbinFile = argv[1];\n\tchar* vshFile = argv[2];\n\tchar* hFile = argc > 3 ? argv[3] : NULL;\n\n#ifdef WIN32\n\tFixMinGWPath(shbinFile);\n\tFixMinGWPath(vshFile);\n\tFixMinGWPath(hFile);\n#endif\n\n\tchar* sourceCode = StringFromFile(vshFile);\n\tif (!sourceCode)\n\t{\n\t\tfprintf(stderr, \"Cannot open input file!\\n\");\n\t\treturn 1;\n\t}\n\n\tint rc = AssembleString(sourceCode, vshFile);\n\tfree(sourceCode);\n\tif (rc != 0)\n\t\treturn rc;\n\n\tprocTableIter mainIt = g_procTable.find(\"main\");\n\tif (mainIt == g_procTable.end())\n\t{\n\t\tfprintf(stderr, \"Error: main proc not defined\\n\");\n\t\treturn 1;\n\t}\n\n\tFileClass f(shbinFile, \"wb\");\n\n\tif (f.openerror())\n\t{\n\t\tfprintf(stderr, \"Can't open output file!\");\n\t\treturn 1;\n\t}\n\n\tf.WriteWord(0x424C5644); \/\/ DVLB\n\tf.WriteWord(1); \/\/ 1 DVLE\n\tf.WriteWord(3*4 + 0x28); \/\/ offset to DVLE\n\n\tu32 dvlpStart = f.Tell();\n\tu32 shaderSize = g_outputBuf.size();\n\tu32 paramStart = 0x28 + 0x40;\n\n\tf.WriteWord(0x504C5644); \/\/ DVLP\n\tf.WriteWord(0); \/\/ version\n\tf.WriteWord(paramStart); \/\/ offset to shader binary blob\n\tf.WriteWord(shaderSize); \/\/ size of shader binary blob\n\tparamStart += shaderSize*4;\n\tf.WriteWord(paramStart); \/\/ offset to opdesc table\n\tf.WriteWord(g_opdescCount); \/\/ number of opdescs\n\tparamStart += g_opdescCount*8;\n\tf.WriteWord(paramStart); \/\/ offset to symtable (TODO)\n\tf.WriteWord(0); \/\/ ????\n\tf.WriteWord(0); \/\/ ????\n\tf.WriteWord(0); \/\/ ????\n\n\tu32 dvleStart = f.Tell();\n\tparamStart -= dvleStart - dvlpStart;\n\t\n\tf.WriteWord(0x454C5644); \/\/ DVLE\n\tf.WriteHword(0); \/\/ padding?\n\tf.WriteHword(0); \/\/ Vertex shader\n\tf.WriteWord(mainIt->second.first); \/\/ offset to main\n\tf.WriteWord(mainIt->second.first+mainIt->second.second); \/\/ offset to end of main\n\tf.WriteWord(0); \/\/ ???\n\tf.WriteWord(0); \/\/ ???\n\tf.WriteWord(paramStart); \/\/ offset to constant table\n\tf.WriteWord(g_constantCount); \/\/ size of constant table\n\tparamStart += g_constantCount*0x14;\n\tf.WriteWord(paramStart); \/\/ offset to label table (TODO)\n\tf.WriteWord(0); \/\/ size of label table (TODO)\n\tf.WriteWord(paramStart); \/\/ offset to output table\n\tf.WriteWord(g_outputCount); \/\/ size of output table\n\tparamStart += g_outputCount*8;\n\tf.WriteWord(paramStart); \/\/ offset to uniform table\n\tf.WriteWord(g_uniformCount); \/\/ size of uniform table\n\tparamStart += g_uniformCount*8;\n\tf.WriteWord(paramStart); \/\/ offset to symbol table\n\tu32 temp = f.Tell();\n\tf.WriteWord(0); \/\/ size of symbol table\n\n\t\/\/ Write program\n\t\/\/for (u32 p : g_outputBuf)\n\tfor (outputBufIter it = g_outputBuf.begin(); it != g_outputBuf.end(); ++it)\n\t\tf.WriteWord(*it);\n\n\t\/\/ Write opdescs\n\tfor (int i = 0; i < g_opdescCount; i ++)\n\t{\n\t\tf.WriteWord(g_opdescTable[i]);\n\t\tf.WriteWord(0x0000000F); \/\/ unknown\n\t}\n\n\t\/\/ Write constants\n\tfor (int i = 0; i < g_constantCount; i ++)\n\t{\n\t\tConstant& ct = g_constantTable[i];\n\t\tf.WriteHword(0);\n\t\tf.WriteByte(ct.regId-0x20);\n\t\tf.WriteByte(0);\n\t\tfor (int j = 0; j < 4; j ++)\n\t\t\tf.WriteWord(f32tof24(ct.param[j]));\n\t}\n\n\t\/\/ Write outputs\n\tfor (int i = 0; i < g_outputCount; i ++)\n\t\tf.WriteDword(g_outputTable[i]);\n\n\t\/\/ Write uniforms\n\tsize_t sp = 0;\n\tfor (int i = 0; i < g_uniformCount; i ++)\n\t{\n\t\tUniform& u = g_uniformTable[i];\n\t\tsize_t l = strlen(u.name)+1;\n\t\tf.WriteWord(sp); sp += l;\n\t\tf.WriteHword(u.pos-0x10);\n\t\tf.WriteHword(u.pos+u.size-1-0x10);\n\t}\n\n\t\/\/ Write size of symbol table\n\tu32 temp2 = f.Tell();\n\tf.Seek(temp, SEEK_SET);\n\tf.WriteWord(sp);\n\tf.Seek(temp2, SEEK_SET);\n\n\t\/\/ Write symbols\n\tfor (int i = 0; i < g_uniformCount; i ++)\n\t{\n\t\tconst char* u = g_uniformTable[i].name;\n\t\tsize_t l = strlen(u)+1;\n\t\tf.WriteRaw(u, l);\n\t}\n\n\tif (hFile)\n\t{\n\t\tFILE* f2 = fopen(hFile, \"w\");\n\t\tif (!f2)\n\t\t{\n\t\t\tfprintf(stderr, \"Can't open header file!\\n\");\n\t\t\treturn 1;\n\t\t}\n\n\t\tfprintf(f2, \"\/\/ Generated by picasso\\n\");\n\t\tfprintf(f2, \"#pragma once\\n\");\n\t\tfor (int i = 0; i < g_uniformCount; i ++)\n\t\t{\n\t\t\tUniform& u = g_uniformTable[i];\n\t\t\tfprintf(f2, \"#define SHADER_UREG_%s 0x%02X\\n\", u.name, u.pos-0x20);\n\t\t\tfprintf(f2, \"#define SHADER_ULEN_%s %d\\n\", u.name, u.size);\n\t\t}\n\n\t\tfclose(f2);\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/@\t{\"targets\":[{\"name\":\"type.hpp\",\"type\":\"include\"}]}\n\n#ifndef TEMPLE_TYPE_HPP\n#define TEMPLE_TYPE_HPP\n\n#include \"error.hpp\"\n#include <cassert>\n#include <type_traits>\n\nnamespace Temple\n\t{\n\tenum class Type:int\n\t\t{\n\t\t I8=0,I8_ARRAY\n\t\t,I16,I16_ARRAY\n\t\t,I32,I32_ARRAY\n\t\t,I64,I64_ARRAY\n\t\t,FLOAT,FLOAT_ARRAY\n\t\t,DOUBLE,DOUBLE_ARRAY\n\t\t,STRING,STRING_ARRAY\n\t\t,COMPOUND,COMPOUND_ARRAY\n\t\t};\n\n\tinline constexpr Type arraySet(Type t)\n\t\t{return static_cast<Type>(static_cast<int>(t) | 1);}\n\n\tinline constexpr Type arrayUnset(Type t)\n\t\t{return static_cast<Type>(static_cast<int>(t)&( ~1));}\n\n\tinline constexpr Type next(Type t)\n\t\t{return static_cast<Type>(static_cast<int>(t) + 1);}\n\n\tinline constexpr Type step(Type t,int x)\n\t\t{return static_cast<Type>(static_cast<int>(t) + x);}\n\n\tinline constexpr Type previous(Type t)\n\t\t{return static_cast<Type>(static_cast<int>(t) - 1);}\n\n\n\n\ttemplate<Type t,class StorageModel>\n\tstruct TypeGet:private TypeGet<arrayUnset(t),StorageModel>\n\t\t{\n\t\ttypedef typename TypeGet<arrayUnset(t),StorageModel>::type BaseType;\n\t\tstatic constexpr auto id=t;\n\t\ttypedef typename StorageModel::template ArrayType<BaseType> type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::I8,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I8;\n\t\ttypedef int8_t type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::I16,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I16;\n\t\ttypedef int8_t type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::I32,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I32;\n\t\ttypedef int32_t type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::I64,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I64;\n\t\ttypedef int64_t type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::FLOAT,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::FLOAT;\n\t\ttypedef float type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::DOUBLE,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::DOUBLE;\n\t\ttypedef double type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::STRING,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::STRING;\n\t\ttypedef typename StorageModel::StringType type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::COMPOUND,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::COMPOUND;\n\t\ttypedef void type;\n\t\t};\n\n\n\n\ttemplate<Type t,int x,Type t_end,class StorageModel,bool cont>\n\tstruct TypeProcess\n\t\t{\n\t\ttemplate<class Callback,class ExceptionHandler>\n\t\tstatic void doIt(Type type,Callback& cb,ExceptionHandler& eh)\n\t\t\t{\t\n\t\t\tif(t==type)\n\t\t\t\t{\n\t\t\t\tcb(TypeGet<t,StorageModel>{});\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tstatic constexpr auto t_next=step(t,x);\n\t\t\t\tstatic constexpr bool cont_next=static_cast<int>(t_next) <= static_cast<int>(t_end);\n\t\t\t\tTypeProcess<t_next,x,t_end,StorageModel,cont_next>::doIt(type,cb,eh);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\ttemplate<Type t,int x,Type t_end,class StorageModel>\n\tstruct TypeProcess<t,x,t_end,StorageModel,0>\n\t\t{\n\t\ttemplate<class Callback,class ExceptionHandler>\n\t\tstatic void doIt(Type type,Callback& cb,ExceptionHandler& eh)\n\t\t\t{eh.raise(Error(\"Internal error: Type not found.\"));}\n\t\t};\n\n\ttemplate<class StorageModel,Type start,int x,Type end,class Callback,class ExceptionHandler>\n\tinline void for_type(Type type,Callback&& cb,ExceptionHandler& eh) \n\t\t{TypeProcess<start,x,end,StorageModel,1>::doIt(type,cb,eh);}\n\n\ttemplate<class StringType,class ExceptionHandler>\n\tinline Type type(const StringType& str,ExceptionHandler& eh)\n\t\t{\n\t\tif(str==\"s\")\n\t\t\t{return Type::STRING;}\n\t\tif(str==\"i8\")\n\t\t\t{return Type::I8;}\n\t\tif(str==\"i16\")\n\t\t\t{return Type::I16;}\n\t\tif(str==\"i32\")\n\t\t\t{return Type::I32;}\n\t\tif(str==\"i64\")\n\t\t\t{return Type::I64;}\n\t\tif(str==\"f\")\n\t\t\t{return Type::FLOAT;}\n\t\tif(str==\"d\")\n\t\t\t{return Type::DOUBLE;}\n\t\tif(str==\"\")\n\t\t\t{return Type::COMPOUND;}\n\t\teh.raise(Error(\"The type identifier \",str.c_str(),\" does not correspond to a known type.\"));\n\t\treturn Type::COMPOUND;\n\t\t}\n\n\tinline const char* type(Type type)\n\t\t{\n\t\tswitch(arrayUnset(type))\n\t\t\t{\n\t\t\tcase Type::I8:\n\t\t\t\treturn \"i8\";\n\t\t\tcase Type::I16:\n\t\t\t\treturn \"i16\";\n\t\t\tcase Type::I32:\n\t\t\t\treturn \"i32\";\n\t\t\tcase Type::I64:\n\t\t\t\treturn \"i64\";\n\t\t\tcase Type::FLOAT:\n\t\t\t\treturn \"f\";\n\t\t\tcase Type::DOUBLE:\n\t\t\t\treturn \"d\";\n\t\t\tcase Type::STRING:\n\t\t\t\treturn \"s\";\n\t\t\tcase Type::COMPOUND:\n\t\t\t\treturn \"\";\n\t\t\tdefault:\n\t\t\t\tassert(1!=1);\n\t\t\t\treturn nullptr;\n\t\t\t}\n\t\tassert(1!=1);\n\t\treturn nullptr;\n\t\t}\n\t}\n\n#endif\n<commit_msg>Inverse type map<commit_after>\/\/@\t{\"targets\":[{\"name\":\"type.hpp\",\"type\":\"include\"}]}\n\n#ifndef TEMPLE_TYPE_HPP\n#define TEMPLE_TYPE_HPP\n\n#include \"error.hpp\"\n\/\/#include \"stringconst.hpp\"\n#include <cassert>\n#include <type_traits>\n\nnamespace Temple\n\t{\n\tenum class Type:int\n\t\t{\n\t\t I8=0,I8_ARRAY\n\t\t,I16,I16_ARRAY\n\t\t,I32,I32_ARRAY\n\t\t,I64,I64_ARRAY\n\t\t,FLOAT,FLOAT_ARRAY\n\t\t,DOUBLE,DOUBLE_ARRAY\n\t\t,STRING,STRING_ARRAY\n\t\t,COMPOUND,COMPOUND_ARRAY\n\t\t};\n\n\tinline constexpr Type arraySet(Type t)\n\t\t{return static_cast<Type>(static_cast<int>(t) | 1);}\n\n\tinline constexpr Type arrayUnset(Type t)\n\t\t{return static_cast<Type>(static_cast<int>(t)&( ~1));}\n\n\tinline constexpr Type next(Type t)\n\t\t{return static_cast<Type>(static_cast<int>(t) + 1);}\n\n\tinline constexpr Type step(Type t,int x)\n\t\t{return static_cast<Type>(static_cast<int>(t) + x);}\n\n\tinline constexpr Type previous(Type t)\n\t\t{return static_cast<Type>(static_cast<int>(t) - 1);}\n\n\n\n\n\n\ttemplate<Type t,class StorageModel>\n\tstruct TypeGet:private TypeGet<arrayUnset(t),StorageModel>\n\t\t{\n\t\ttypedef typename TypeGet<arrayUnset(t),StorageModel>::type BaseType;\n\t\tstatic constexpr auto id=t;\n\t\ttypedef typename StorageModel::template ArrayType<BaseType> type;\n\n\n\/*\t\tstatic constexpr auto name_buffer=concat(TypeGet<arrayUnset(t),StorageModel>::name,\" array\");\n\t\tstatic constexpr const char* name=name_buffer.begin();*\/\n\t\t};\n\n\ttemplate<class T,class StorageModel>\n\tstruct IdGet\n\t\t{\n\t\tstatic constexpr auto id=arraySet(IdGet<typename T::value_type,StorageModel>::id);\n\t\ttypedef T type;\n\t\t};\n\n\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::I8,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I8;\n\t\ttypedef int8_t type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct IdGet<int8_t,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I8;\n\t\ttypedef int8_t type;\n\t\t};\n\n\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::I16,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I16;\n\t\ttypedef int8_t type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct IdGet<int16_t,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I16;\n\t\ttypedef int16_t type;\n\t\t};\n\n\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::I32,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I32;\n\t\ttypedef int32_t type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct IdGet<int32_t,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I32;\n\t\ttypedef int32_t type;\n\t\t};\n\n\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::I64,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I64;\n\t\ttypedef int64_t type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct IdGet<int64_t,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::I64;\n\t\ttypedef int64_t type;\n\t\t};\n\n\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::FLOAT,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::FLOAT;\n\t\ttypedef float type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct IdGet<float,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::FLOAT;\n\t\ttypedef float type;\n\t\t};\n\n\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::DOUBLE,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::DOUBLE;\n\t\ttypedef double type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct IdGet<double,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::DOUBLE;\n\t\ttypedef double type;\n\t\t};\n\n\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::STRING,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::STRING;\n\t\ttypedef typename StorageModel::StringType type;\n\t\t};\n\n\ttemplate<class StorageModel>\n\tstruct IdGet<typename StorageModel::StringType,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::STRING;\n\t\ttypedef typename StorageModel::StringType type;\n\t\t};\n\n\n\n\ttemplate<class StorageModel>\n\tstruct TypeGet<Type::COMPOUND,StorageModel>\n\t\t{\n\t\tstatic constexpr auto id=Type::COMPOUND;\n\t\ttypedef void type;\n\t\t};\n\n\n\n\ttemplate<Type t,int x,Type t_end,class StorageModel,bool cont>\n\tstruct TypeProcess\n\t\t{\n\t\ttemplate<class Callback,class ExceptionHandler>\n\t\tstatic void doIt(Type type,Callback& cb,ExceptionHandler& eh)\n\t\t\t{\t\n\t\t\tif(t==type)\n\t\t\t\t{\n\t\t\t\tcb(TypeGet<t,StorageModel>{});\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tstatic constexpr auto t_next=step(t,x);\n\t\t\t\tstatic constexpr bool cont_next=static_cast<int>(t_next) <= static_cast<int>(t_end);\n\t\t\t\tTypeProcess<t_next,x,t_end,StorageModel,cont_next>::doIt(type,cb,eh);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\ttemplate<Type t,int x,Type t_end,class StorageModel>\n\tstruct TypeProcess<t,x,t_end,StorageModel,0>\n\t\t{\n\t\ttemplate<class Callback,class ExceptionHandler>\n\t\tstatic void doIt(Type type,Callback& cb,ExceptionHandler& eh)\n\t\t\t{eh.raise(Error(\"Internal error: Type not found.\"));}\n\t\t};\n\n\ttemplate<class StorageModel,Type start,int x,Type end,class Callback,class ExceptionHandler>\n\tinline void for_type(Type type,Callback&& cb,ExceptionHandler& eh) \n\t\t{TypeProcess<start,x,end,StorageModel,1>::doIt(type,cb,eh);}\n\n\ttemplate<class StringType,class ExceptionHandler>\n\tinline Type type(const StringType& str,ExceptionHandler& eh)\n\t\t{\n\t\tif(str==\"s\")\n\t\t\t{return Type::STRING;}\n\t\tif(str==\"i8\")\n\t\t\t{return Type::I8;}\n\t\tif(str==\"i16\")\n\t\t\t{return Type::I16;}\n\t\tif(str==\"i32\")\n\t\t\t{return Type::I32;}\n\t\tif(str==\"i64\")\n\t\t\t{return Type::I64;}\n\t\tif(str==\"f\")\n\t\t\t{return Type::FLOAT;}\n\t\tif(str==\"d\")\n\t\t\t{return Type::DOUBLE;}\n\t\tif(str==\"\")\n\t\t\t{return Type::COMPOUND;}\n\t\teh.raise(Error(\"The type identifier \",str.c_str(),\" does not correspond to a known type.\"));\n\t\treturn Type::COMPOUND;\n\t\t}\n\n\tinline const char* type(Type type)\n\t\t{\n\t\tswitch(arrayUnset(type))\n\t\t\t{\n\t\t\tcase Type::I8:\n\t\t\t\treturn \"i8\";\n\t\t\tcase Type::I16:\n\t\t\t\treturn \"i16\";\n\t\t\tcase Type::I32:\n\t\t\t\treturn \"i32\";\n\t\t\tcase Type::I64:\n\t\t\t\treturn \"i64\";\n\t\t\tcase Type::FLOAT:\n\t\t\t\treturn \"f\";\n\t\t\tcase Type::DOUBLE:\n\t\t\t\treturn \"d\";\n\t\t\tcase Type::STRING:\n\t\t\t\treturn \"s\";\n\t\t\tcase Type::COMPOUND:\n\t\t\t\treturn \"\";\n\t\t\tdefault:\n\t\t\t\tassert(1!=1);\n\t\t\t\treturn nullptr;\n\t\t\t}\n\t\tassert(1!=1);\n\t\treturn nullptr;\n\t\t}\n\t}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"Game.hpp\"\n#include \"chimera\/core\/device\/JoystickManager.hpp\"\n#include \"chimera\/core\/utils.hpp\"\n#include \"chimera\/render\/scene\/Components.hpp\"\n\nGame::Game(Chimera::Scene& scene) : pCorpoRigido(nullptr), scene(&scene) { SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Constructor Game\"); }\n\nGame::~Game() { SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Destructor Game\"); }\n\nbool Game::onEvent(const SDL_Event& event) {\n    using namespace Chimera;\n\n    switch (event.type) {\n        case SDL_USEREVENT: {\n            switch (event.user.code) {\n                case Chimera::EVENT_COLLIDE_START: {\n                    uint32_t* n1 = (uint32_t*)event.user.data1;\n                    uint32_t* n2 = (uint32_t*)event.user.data2;\n                    SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Colisao start: %d -> %d\", *n1, *n2);\n                } break;\n                case Chimera::EVENT_COLLIDE_ON: {\n                    uint32_t* n1 = (uint32_t*)event.user.data1;\n                    uint32_t* n2 = (uint32_t*)event.user.data2;\n                    SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Colisao ON: %d -> %d\", *n1, *n2);\n                } break;\n                case Chimera::EVENT_COLLIDE_OFF: {\n                    uint32_t* n1 = (uint32_t*)event.user.data1;\n                    uint32_t* n2 = (uint32_t*)event.user.data2;\n                    SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Colisao OFF: %d -> %d\", *n1, *n2);\n                } break;\n                case Chimera::EVENT_NEW_FPS: {\n                    uint32_t* pFps = (uint32_t*)event.user.data1;\n                    fps = *pFps;\n                    \/\/ glm::vec3 val1 = pCorpoRigido->getPosition();\n                    \/\/ sPosicaoObj = \"pos:(\" + std::to_string(val1.x) + \",\" + std::to_string(val1.y) + \",\" + std::to_string(val1.z) + \")\";\n                } break;\n                default:\n                    break;\n            }\n\n        } break;\n        case SDL_KEYDOWN: {\n            switch (event.key.keysym.sym) {\n                case SDLK_ESCAPE:\n                    utilSendEvent(EVENT_FLOW_STOP, nullptr, nullptr);\n                    break;\n                    \/\/ case SDLK_F1:\n                    \/\/     pHUD->setOn(!pHUD->isOn());\n                    \/\/ break;\n                case SDLK_F10:\n                    utilSendEvent(EVENT_TOGGLE_FULL_SCREEN, nullptr, nullptr);\n                    break;\n                case SDLK_UP:\n                    pCorpoRigido->applyForce(glm::vec3(10.0, 0.0, 0.0));\n                    break;\n                case SDLK_DOWN:\n                    pCorpoRigido->applyForce(glm::vec3(-10.0, 0.0, 0.0));\n                    break;\n                case SDLK_LEFT:\n                    pCorpoRigido->applyForce(glm::vec3(0.0, 10.0, 0.0));\n                    break;\n                case SDLK_RIGHT:\n                    pCorpoRigido->applyForce(glm::vec3(0.0, -10.0, 0.0));\n                    break;\n                case SDLK_a:\n                    pCorpoRigido->applyTorc(glm::vec3(0.0, 0.0, 10.0));\n                    break;\n                case SDLK_s:\n                    pCorpoRigido->applyTorc(glm::vec3(0.0, 0.0, -10.0));\n                    break;\n                default:\n                    break;\n            }\n        } break;\n\n        case SDL_JOYAXISMOTION:\n        case SDL_JOYBUTTONDOWN:\n        case SDL_JOYBUTTONUP:\n        case SDL_JOYHATMOTION:\n        case SDL_JOYBALLMOTION: {\n\n            JoystickState* pJoy = JoystickManager::select(event.jball.which);\n\n            \/\/ Captura joystick 0 se existir\n            if (pJoy != nullptr) {\n\n                pJoy->debug();\n\n                float propulsaoPrincipal = 3.0f;\n\n                crt.yaw = JoystickState::scale16(pJoy->getAxis((uint8_t)JOY_AXIX_COD::LEFT_X, 32));\n                crt.pitch = JoystickState::scale16(pJoy->getAxis((uint8_t)JOY_AXIX_COD::LEFT_Y, 32));\n                crt.roll = JoystickState::scale16(pJoy->getAxis((uint8_t)JOY_AXIX_COD::RIGHT_X, 32));\n\n                double throttle = 0;\n                crt.throttle = -propulsaoPrincipal * ((1 + JoystickState::scale16(pJoy->getAxis((uint8_t)JOY_AXIX_COD::LEFT_TRIGGER))) \/ 2);\n\n                if (pJoy->getButtonState((uint8_t)JOY_BUTTON_COD::X) == SDL_PRESSED) {\n                    \/\/ glm::vec3 posicao = pEmissor->getPosSource();\n                    \/\/ posicao.x = posicao.x - 0.1f;\n                    \/\/ pEmissor->setPosSource( posicao );\n                }\n\n                if (pJoy->getButtonState((uint8_t)JOY_BUTTON_COD::B) == SDL_PRESSED) { \/\/ ( or SDL_RELEASED)\n                    \/\/ glm::vec3 posicao = pEmissor->getPosSource();\n                    \/\/ posicao.x = posicao.x + 0.1f;\n                    \/\/ pEmissor->setPosSource(posicao);\n                }\n\n                crt.hat = pJoy->getHat(0);\n            }\n\n        } break;\n\n        case SDL_MOUSEBUTTONDOWN:\n        case SDL_MOUSEBUTTONUP:\n        case SDL_MOUSEMOTION: {\n        } break;\n        case SDL_WINDOWEVENT: {\n            switch (event.window.event) {\n                case SDL_WINDOWEVENT_ENTER:\n                    utilSendEvent(EVENT_FLOW_RESUME, nullptr, nullptr); \/\/ isPaused = false;\n                    break;\n                case SDL_WINDOWEVENT_LEAVE:\n                    utilSendEvent(EVENT_FLOW_PAUSE, nullptr, nullptr); \/\/ isPaused = true;\n                    break;\n            }\n        } break;\n    }\n    return true;\n}\n\nvoid Game::onAttach() {\n\n    using namespace Chimera;\n    \/\/ Localiza objeto como o primario\n    TransComponent& tc = scene->getRegistry()->findComponent<TransComponent>(\"Zoltan\");\n    pCorpoRigido = (Solid*)tc.trans;\n\n    lFPS = new Label(\"None\", -500, 280, glm::vec4(1.0, 1.0, 1.0, 1.0));\n    Tile* tile = (Tile*)scene->getLayes().getState(\"TileText\");\n    tile->add(lFPS);\n\n    glClearColor(0.f, 0.f, 0.f, 1.f); \/\/ Initialize clear color\n    glEnable(GL_DEPTH_TEST);\n    glEnable(GL_CULL_FACE);\n\n    glClearDepth(1.0f);\n    glDepthFunc(GL_LEQUAL);\n    glHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n}\n\nvoid Game::onDeatach() {}\n\nvoid Game::onUpdate(const double& ts) {\n\n    if (pCorpoRigido)\n        scene->setOrigem(pCorpoRigido);\n\n    using namespace Chimera;\n\n    float propulsaoLRUD = 5.0f;\n    float torque = 0.5f;\n\n    if (pCorpoRigido) {\n        if (crt.hat & (uint8_t)SDL_HAT_UP)\n            pCorpoRigido->applyForce(glm::vec3(0.0, 0.0, propulsaoLRUD));\n\n        if (crt.hat & (uint8_t)SDL_HAT_DOWN)\n            pCorpoRigido->applyForce(glm::vec3(0.0, 0.0, -propulsaoLRUD));\n\n        if (crt.hat & (uint8_t)SDL_HAT_RIGHTUP)\n            pCorpoRigido->applyForce(glm::vec3(propulsaoLRUD, 0.0, 0.0));\n\n        if (crt.hat & (uint8_t)SDL_HAT_LEFTUP)\n            pCorpoRigido->applyForce(glm::vec3(-propulsaoLRUD, 0.0, 0.0));\n\n        if ((crt.roll != 0.0) || (crt.pitch != 0.0) || (crt.yaw != 0.0) || (crt.throttle != 0.0)) {\n            pCorpoRigido->applyForce(glm::vec3(0.0, crt.throttle, 0.0));\n            pCorpoRigido->applyTorc(glm::vec3(-torque * crt.pitch, -torque * crt.roll, -torque * crt.yaw));\n        }\n    }\n\n    lFPS->setText(std::string(\"FPS: \") + std::to_string(fps));\n}\n\nvoid Game::onRender() {}<commit_msg>Grupo2d funcional junto a texto no models3<commit_after>#include \"Game.hpp\"\n#include \"chimera\/core\/device\/JoystickManager.hpp\"\n#include \"chimera\/core\/utils.hpp\"\n#include \"chimera\/render\/2d\/Group.hpp\"\n#include \"chimera\/render\/2d\/Sprite.hpp\"\n#include \"chimera\/render\/scene\/Components.hpp\"\n\nGame::Game(Chimera::Scene& scene) : pCorpoRigido(nullptr), scene(&scene) { SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Constructor Game\"); }\n\nGame::~Game() { SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Destructor Game\"); }\n\nbool Game::onEvent(const SDL_Event& event) {\n    using namespace Chimera;\n\n    switch (event.type) {\n        case SDL_USEREVENT: {\n            switch (event.user.code) {\n                case Chimera::EVENT_COLLIDE_START: {\n                    uint32_t* n1 = (uint32_t*)event.user.data1;\n                    uint32_t* n2 = (uint32_t*)event.user.data2;\n                    SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Colisao start: %d -> %d\", *n1, *n2);\n                } break;\n                case Chimera::EVENT_COLLIDE_ON: {\n                    uint32_t* n1 = (uint32_t*)event.user.data1;\n                    uint32_t* n2 = (uint32_t*)event.user.data2;\n                    SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Colisao ON: %d -> %d\", *n1, *n2);\n                } break;\n                case Chimera::EVENT_COLLIDE_OFF: {\n                    uint32_t* n1 = (uint32_t*)event.user.data1;\n                    uint32_t* n2 = (uint32_t*)event.user.data2;\n                    SDL_LogDebug(SDL_LOG_CATEGORY_APPLICATION, \"Colisao OFF: %d -> %d\", *n1, *n2);\n                } break;\n                case Chimera::EVENT_NEW_FPS: {\n                    uint32_t* pFps = (uint32_t*)event.user.data1;\n                    fps = *pFps;\n                    \/\/ glm::vec3 val1 = pCorpoRigido->getPosition();\n                    \/\/ sPosicaoObj = \"pos:(\" + std::to_string(val1.x) + \",\" + std::to_string(val1.y) + \",\" + std::to_string(val1.z) + \")\";\n                } break;\n                default:\n                    break;\n            }\n\n        } break;\n        case SDL_KEYDOWN: {\n            switch (event.key.keysym.sym) {\n                case SDLK_ESCAPE:\n                    utilSendEvent(EVENT_FLOW_STOP, nullptr, nullptr);\n                    break;\n                    \/\/ case SDLK_F1:\n                    \/\/     pHUD->setOn(!pHUD->isOn());\n                    \/\/ break;\n                case SDLK_F10:\n                    utilSendEvent(EVENT_TOGGLE_FULL_SCREEN, nullptr, nullptr);\n                    break;\n                case SDLK_UP:\n                    pCorpoRigido->applyForce(glm::vec3(10.0, 0.0, 0.0));\n                    break;\n                case SDLK_DOWN:\n                    pCorpoRigido->applyForce(glm::vec3(-10.0, 0.0, 0.0));\n                    break;\n                case SDLK_LEFT:\n                    pCorpoRigido->applyForce(glm::vec3(0.0, 10.0, 0.0));\n                    break;\n                case SDLK_RIGHT:\n                    pCorpoRigido->applyForce(glm::vec3(0.0, -10.0, 0.0));\n                    break;\n                case SDLK_a:\n                    pCorpoRigido->applyTorc(glm::vec3(0.0, 0.0, 10.0));\n                    break;\n                case SDLK_s:\n                    pCorpoRigido->applyTorc(glm::vec3(0.0, 0.0, -10.0));\n                    break;\n                default:\n                    break;\n            }\n        } break;\n\n        case SDL_JOYAXISMOTION:\n        case SDL_JOYBUTTONDOWN:\n        case SDL_JOYBUTTONUP:\n        case SDL_JOYHATMOTION:\n        case SDL_JOYBALLMOTION: {\n\n            JoystickState* pJoy = JoystickManager::select(event.jball.which);\n\n            \/\/ Captura joystick 0 se existir\n            if (pJoy != nullptr) {\n\n                pJoy->debug();\n\n                float propulsaoPrincipal = 3.0f;\n\n                crt.yaw = JoystickState::scale16(pJoy->getAxis((uint8_t)JOY_AXIX_COD::LEFT_X, 32));\n                crt.pitch = JoystickState::scale16(pJoy->getAxis((uint8_t)JOY_AXIX_COD::LEFT_Y, 32));\n                crt.roll = JoystickState::scale16(pJoy->getAxis((uint8_t)JOY_AXIX_COD::RIGHT_X, 32));\n\n                double throttle = 0;\n                crt.throttle = -propulsaoPrincipal * ((1 + JoystickState::scale16(pJoy->getAxis((uint8_t)JOY_AXIX_COD::LEFT_TRIGGER))) \/ 2);\n\n                if (pJoy->getButtonState((uint8_t)JOY_BUTTON_COD::X) == SDL_PRESSED) {\n                    \/\/ glm::vec3 posicao = pEmissor->getPosSource();\n                    \/\/ posicao.x = posicao.x - 0.1f;\n                    \/\/ pEmissor->setPosSource( posicao );\n                }\n\n                if (pJoy->getButtonState((uint8_t)JOY_BUTTON_COD::B) == SDL_PRESSED) { \/\/ ( or SDL_RELEASED)\n                    \/\/ glm::vec3 posicao = pEmissor->getPosSource();\n                    \/\/ posicao.x = posicao.x + 0.1f;\n                    \/\/ pEmissor->setPosSource(posicao);\n                }\n\n                crt.hat = pJoy->getHat(0);\n            }\n\n        } break;\n\n        case SDL_MOUSEBUTTONDOWN:\n        case SDL_MOUSEBUTTONUP:\n        case SDL_MOUSEMOTION: {\n        } break;\n        case SDL_WINDOWEVENT: {\n            switch (event.window.event) {\n                case SDL_WINDOWEVENT_ENTER:\n                    utilSendEvent(EVENT_FLOW_RESUME, nullptr, nullptr); \/\/ isPaused = false;\n                    break;\n                case SDL_WINDOWEVENT_LEAVE:\n                    utilSendEvent(EVENT_FLOW_PAUSE, nullptr, nullptr); \/\/ isPaused = true;\n                    break;\n            }\n        } break;\n    }\n    return true;\n}\n\nvoid Game::onAttach() {\n\n    using namespace Chimera;\n    \/\/ Localiza objeto como o primario\n    TransComponent& tc = scene->getRegistry()->findComponent<TransComponent>(\"Zoltan\");\n    pCorpoRigido = (Solid*)tc.trans;\n\n    lFPS = new Label(\"None\", 0, 0, glm::vec4(1.0, 1.0, 1.0, 1.0));\n    Tile* tile = (Tile*)scene->getLayes().getState(\"TileText\");\n\n    Group* group = new Group(glm::translate(glm::mat4(1.0f), glm::vec3(-500.0f, 270.0f, 0.0f)));\n    group->add(new Sprite(0.0f, 0.0f, 200.0f, 50.0f, glm::vec4(0, 0, 1, 1)));\n    group->add(lFPS);\n    tile->add(group);\n    \/\/ tile->add(lFPS);\n\n    glClearColor(0.f, 0.f, 0.f, 1.f); \/\/ Initialize clear color\n    glEnable(GL_DEPTH_TEST);\n    glEnable(GL_CULL_FACE);\n\n    glClearDepth(1.0f);\n    glDepthFunc(GL_LEQUAL);\n    glHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n}\n\nvoid Game::onDeatach() {}\n\nvoid Game::onUpdate(const double& ts) {\n\n    if (pCorpoRigido)\n        scene->setOrigem(pCorpoRigido);\n\n    using namespace Chimera;\n\n    float propulsaoLRUD = 5.0f;\n    float torque = 0.5f;\n\n    if (pCorpoRigido) {\n        if (crt.hat & (uint8_t)SDL_HAT_UP)\n            pCorpoRigido->applyForce(glm::vec3(0.0, 0.0, propulsaoLRUD));\n\n        if (crt.hat & (uint8_t)SDL_HAT_DOWN)\n            pCorpoRigido->applyForce(glm::vec3(0.0, 0.0, -propulsaoLRUD));\n\n        if (crt.hat & (uint8_t)SDL_HAT_RIGHTUP)\n            pCorpoRigido->applyForce(glm::vec3(propulsaoLRUD, 0.0, 0.0));\n\n        if (crt.hat & (uint8_t)SDL_HAT_LEFTUP)\n            pCorpoRigido->applyForce(glm::vec3(-propulsaoLRUD, 0.0, 0.0));\n\n        if ((crt.roll != 0.0) || (crt.pitch != 0.0) || (crt.yaw != 0.0) || (crt.throttle != 0.0)) {\n            pCorpoRigido->applyForce(glm::vec3(0.0, crt.throttle, 0.0));\n            pCorpoRigido->applyTorc(glm::vec3(-torque * crt.pitch, -torque * crt.roll, -torque * crt.yaw));\n        }\n    }\n\n    lFPS->setText(std::string(\"FPS: \") + std::to_string(fps));\n}\n\nvoid Game::onRender() {}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip>\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n    cout << \"      |\";\n    for (int x = 1; x<=12; ++x)\n    {\n        cout <<setw(5)<< x <<\"|\";\n        \n    }\n    cout << endl;\n\n    for( int x = 0; x<=12; ++x)\n    {\n        cout << \"-----+\";\n    }\n    cout << endl;\n\n    for( int y = 1; y<=12; ++y)\n    {\n        cout<<setw(5)<< y << \"|\";\n\n        for (int x=1; x<=12; ++x)\n        {\n            cout<<setw(5)<<x*y << \"|\";\n        }\n        cout<< endl;\n\n        for(int x =0; x<=12; ++x)\n        {\n            cout << \"-----+\";\n        }\n        cout <<endl;\n    }\n\n}\n<commit_msg>fixed table.closes #35<commit_after>#include <iostream>\n#include <iomanip>\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n    cout << \"      |\";\n    for (int x = 1; x<=12; ++x)\n    {\n        cout <<setw(5)<< x <<\"|\";\n        \n    }\n    cout << endl;\n\n    for(int x = 0; x<=12; ++x)\n    {\n        cout << \"-----+\";\n    }\n    cout << endl;\n\n    for(int y = 1; y<=12; ++y)\n    {\n        cout<<setw(5)<< y << \"|\";\n\n        for (int x=1; x<=12; ++x)\n        {\n            cout<<setw(5)<<x*y << \"|\";\n        }\n        cout<< endl;\n\n        for(int x =0; x<=12; ++x)\n        {\n            cout << \"-----+\";\n        }\n        cout <<endl;\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"StateSpace.h\"\n\nStateSpace::StateSpace(const unsigned int _angle_max, const unsigned int _velocity_max, PriorityQueue<Action*,double> queue ):\n\tangle_max(_angle_max),\n\tvelocity_max(_velocity_max),\n\tspace(_angle_max, std::vector< PriorityQueue<Action*,double> > (_velocity_max, PriorityQueue<Action*,double> (queue)))\n{}\n\nStateSpace::SubscriptProxy1 StateSpace::operator[](const unsigned int robot_state)\n{\n\t\/\/throw if the the index is out of bounds\n\tif(robot_state>1)throw std::domain_error(\"action index exceeded\");\n\t\/\/return proxy object to accept second [] operator\n\treturn SubscriptProxy1( robot_state ? space1 : space2 );\n}\n\n\/\/searches state space by state object\nPriorityQueue<Action *, double>& StateSpace::operator[](const State & state)\n{\n\t\/\/call the subscript operators with the members of the state object\n\treturn (*this)[state.robot_state][state.theta][state.theta_dot];\n}\n<commit_msg>so many comments<commit_after>#include \"StateSpace.h\"\n\nStateSpace::StateSpace(const unsigned int _angle_bins, const unsigned int _velocity_bins, PriorityQueue<Action*,double> queue ):\n\tangle_bins(_angle_bins),\n\tvelocity_bins(_velocity_bins),\n\tspace(_angle_max, std::vector< PriorityQueue<Action*,double> > (_velocity_max, PriorityQueue<Action*,double> (queue)))\n{}\n\nStateSpace::SubscriptProxy1 StateSpace::operator[](const unsigned int robot_state)\n{\n\t\/\/throw if the the index is out of bounds\n\tif(robot_state>1)throw std::domain_error(\"action index exceeded\");\n\t\/\/return proxy object to accept second [] operator\n\treturn SubscriptProxy1( robot_state ? space1 : space2 );\n}\n\n\/\/searches state space by state object\nPriorityQueue<Action *, double>& StateSpace::operator[](const State & state)\n{\n\t\/\/call the subscript operators with the members of the state object\n\treturn (*this)[state.robot_state][state.theta][state.theta_dot];\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file crf_analyzer.cpp\n * Implementation of class CRF_Analyzer.\n *\n * \\author Jun Jiang\n * \\version 0.1\n * \\date Mar 2, 2009\n *\/\n\n\n#include <cassert>\n#include <iostream>\n#include <sstream>\n#include <fstream>\n\n#include \"jma_analyzer.h\"\n#include \"jma_knowledge.h\"\n#include \"tokenizer.h\"\n\n\nnamespace jma\n{\n\n\/**\n * Whether the two MorphemeLists is the same\n * \\param list1 the MorphemeList 1\n * \\param list2 the MorphemeList 2\n *\/\ninline bool isSameMorphemeList( const MorphemeList* list1, const MorphemeList* list2, bool printPOS )\n{\n\t\/\/ if one is zero pointer, return null\n\tif( !list1 || !list2 )\n\t{\n\t\treturn false;\n\t}\n\n\tif( list1->size() != list2->size() )\n\t\treturn false;\n\t\/\/compare one by one\n\tsize_t N = list1->size();\n\tif( printPOS )\n\t{\n\t\tfor( size_t i = 0; i < N; ++i )\n\t\t{\n\t\t\tconst Morpheme& m1 = (*list1)[i];\n\t\t\tconst Morpheme& m2 = (*list2)[i];\n\t\t\tif( m1.lexicon_ != m2.lexicon_ || m1.posCode_ != m2.posCode_\n\t\t\t\t\t|| m1.posStr_ != m2.posStr_ )\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor( size_t i = 0; i < N; ++i )\n\t\t{\n\t\t\tif( (*list1)[i].lexicon_ != (*list2)[i].lexicon_ )\n\t\t\t\treturn false;\n\t\t}\n\t}\n\t\/\/all the elements are the same\n\treturn true;\n}\n\nJMA_Analyzer::JMA_Analyzer()\n    : knowledge_(0), tagger_(0)\n{\n}\n\nJMA_Analyzer::~JMA_Analyzer()\n{\n}\n\nvoid JMA_Analyzer::setKnowledge(Knowledge* pKnowledge)\n{\n    assert(pKnowledge);\n\n    knowledge_ = dynamic_cast<JMA_Knowledge*>(pKnowledge);\n    assert(knowledge_);\n    tagger_ = knowledge_->getTagger();\n    assert(tagger_);\n    tagger_->set_lattice_level(1);\n    maxPosCateOffset_ = knowledge_->getPOSCatNum() - 1;\n}\n\nint JMA_Analyzer::runWithSentence(Sentence& sentence)\n{\n\tbool printPOS = getOption(OPTION_TYPE_POS_TAGGING) > 0;\n\tint N = (int)getOption(Analyzer::OPTION_TYPE_NBEST);\n\n\t\/\/one best\n\tif(N <= 1)\n\t{\n\t\tconst MeCab::Node* bosNode = tagger_->parseToNode( sentence.getString() );\n\t\tMorphemeList list;\n\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next)\n\t\t{\n\t\t\tstring seg(node->surface, node->length);\n\t\t\tif(knowledge_->isStopWord(seg))\n\t\t\t\tcontinue;\n\t\t\tlist.push_back(Morpheme());\n\t\t\tMorpheme& morp = list.back();\n\t\t\tmorp.lexicon_ = seg;\n\t\t\tif(printPOS)\n\t\t\t{\n\t\t\t\tmorp.posCode_ = (int)node->posid;\n\t\t\t\tmorp.posStr_ = string(node->feature, getPOSOffset(node->feature));\n\t\t\t}\n\t\t}\n\t\tsentence.addList(list, 1.0);\n\t}\n\t\/\/ N-best\n\telse\n\t{\n\t\tdouble totalScore = 0;\n\n\t\tif( !tagger_->parseNBestInit( sentence.getString() ) )\n\t\t{\n\t\t\tcerr << \"[Error] Cannot parseNBestInit on the \" << sentence.getString() << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\tlong base = 0;\n\t\tint i = 0;\n\t\tfor ( ; i < N;  )\n\t\t{\n\t\t\tconst MeCab::Node* bosNode = tagger_->nextNode();\n\t\t\tif( !bosNode )\n\t\t\t\tbreak;\n\t\t\tMorphemeList list;\n\t\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next)\n\t\t\t{\n\t\t\t\tstring seg(node->surface, node->length);\n\t\t\t\tif(knowledge_->isStopWord(seg))\n\t\t\t\t\tcontinue;\n\t\t\t\tlist.push_back(Morpheme());\n\t\t\t\tMorpheme& morp = list.back();\n\t\t\t\tmorp.lexicon_ = seg;\n\t\t\t\tif(printPOS)\n\t\t\t\t{\n\t\t\t\t\tmorp.posCode_ = (int)node->posid;\n\t\t\t\t\tmorp.posStr_ = string(node->feature, getPOSOffset(node->feature));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbool isDupl = false;\n\t\t\t\/\/check the current result with exits results\n\t\t\tfor( int listOffset = sentence.getListSize() - 1 ; listOffset >= 0; --listOffset )\n\t\t\t{\n\t\t\t\tif( isSameMorphemeList( sentence.getMorphemeList(listOffset), &list, printPOS ) )\n\t\t\t\t{\n\t\t\t\t\tisDupl = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ignore the duplicate results\n\t\t\tif( isDupl )\n\t\t\t\tcontinue;\n\n\t\t\tlong score = tagger_->nextScore();\n\t\t\tif( i == 0 )\n\t\t\t\tbase = score > BASE_NBEST_SCORE ? score - BASE_NBEST_SCORE : 0;\n\n\t\t\tdouble dScore = 1.0 \/ (score - base );\n\t\t\ttotalScore += dScore;\n\t\t\tsentence.addList( list, dScore );\n\t\t\t++i;\n\t\t}\n\n\t\tfor ( int j = 0; j < i; ++j )\n\t\t{\n\t\t\tsentence.setScore(j, sentence.getScore(j) \/ totalScore );\n\t\t}\n\t}\n\n\treturn 1;\n}\n\nconst char* JMA_Analyzer::runWithString(const char* inStr)\n{\n\tbool printPOS = getOption(OPTION_TYPE_POS_TAGGING) > 0;\n\n\tconst MeCab::Node* bosNode = tagger_->parseToNode( inStr );\n\n\tstrBuf_.clear();\n\tif (printPOS) {\n\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next){\n\t\t\tstrBuf_.append(node->surface, node->length).append(posDelimiter_).\n\t\t\t\tappend(node->feature, getPOSOffset(node->feature) ).append(wordDelimiter_);\n\t\t}\n\n\t} else {\n\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next){\n\t\t\tstrBuf_.append(node->surface, node->length).append(wordDelimiter_);\n\t\t}\n\t}\n\n\treturn strBuf_.c_str();\n\n}\n\nint JMA_Analyzer::runWithStream(const char* inFileName, const char* outFileName)\n{\n\tassert(inFileName);\n\tassert(outFileName);\n\n\tbool printPOS = getOption(OPTION_TYPE_POS_TAGGING) > 0;\n\n\tifstream in(inFileName);\n\tif(!in)\n\t{\n\t\tcerr<<\"[Error] The input file \"<<inFileName<<\" not exists!\"<<endl;\n\t\treturn 0;\n\t}\n    ofstream out(outFileName);\n    string line;\n    bool remains = !in.eof();\n    while (remains) {\n        getline(in, line);\n        remains = !in.eof();\n        if (!line.length()) {\n            if( remains )\n\t\t\t\tout << endl;\n            continue;\n        }\n\n        const MeCab::Node* bosNode = tagger_->parseToNode( line.c_str() );\n\n        if (printPOS) {\n\t\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next){\n\t\t\t\tout.write(node->surface, node->length) << posDelimiter_;\n\t\t\t\tout.write(node->feature, getPOSOffset(node->feature) ) << wordDelimiter_;\n\t\t\t}\n\n            if (remains)\n                out << endl;\n            else\n                break;\n\n        } else {\n\t\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next){\n\t\t\t\tout.write(node->surface, node->length) << wordDelimiter_;\n\t\t\t}\n\n\t\t\tif (remains)\n\t\t\t\tout << endl;\n\t\t\telse\n\t\t\t\tbreak;\n        }\n    }\n\n    in.close();\n    out.close();\n    return 1;\n}\n\nvoid JMA_Analyzer::splitSentence(const char* paragraph, std::vector<Sentence>& sentences)\n{\n    if(! paragraph)\n        return;\n\n    Sentence result;\n    string sentenceStr;\n    CTypeTokenizer tokenizer( knowledge_->getCType() );\n    tokenizer.assign(paragraph);\n    for(const char* p=tokenizer.next(); p; p=tokenizer.next())\n    {\n        if( knowledge_->isSentenceSeparator(p) )\n        {\n            sentenceStr += p;\n\n            result.setString(sentenceStr.c_str());\n            sentences.push_back(result);\n\n            sentenceStr.clear();\n        }\n        \/*\/\/ white-space characters are also used as sentence separator,\n        \/\/ but they are ignored in the sentence result\n        else if(ctype_->isSpace(p))\n        {\n            if(! sentenceStr.empty())\n            {\n                result.setString(sentenceStr.c_str());\n                sentences.push_back(result);\n\n                sentenceStr.clear();\n            }\n        }*\/\n        else\n        {\n            sentenceStr += p;\n        }\n    }\n\n    \/\/ in case the last character is not space or sentence separator\n    if(! sentenceStr.empty())\n    {\n        result.setString(sentenceStr.c_str());\n        sentences.push_back(result);\n\n        sentenceStr.clear();\n    }\n}\n\n\nint JMA_Analyzer::getPOSOffset(const char* feature){\n\tif( knowledge_->isOutputFullPOS() )\n\t{\n\t\t\/\/ count for the index of the fourth offset\n\t\tint offset = 0;\n\t\tint commaCount = 0;\n\t\tfor( ; feature[offset]; ++offset )\n\t\t{\n\t\t\tif(feature[offset] == ',')\n\t\t\t{\n\t\t\t\t++commaCount;\n\t\t\t\tif( commaCount > maxPosCateOffset_ )\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn offset;\n\t}\n\n\t \/\/count for the index of the comma that after non-star pos sections\n\tint offset = 0;\n\tint commaCount = 0;\n\tfor( ; feature[offset]; ++offset )\n\t{\n\t\tif(feature[offset] == ',')\n\t\t{\n\t\t\t++commaCount;\n\t\t\tif( commaCount > maxPosCateOffset_ )\n\t\t\t\tbreak;\n\t\t}\n\t\telse if(feature[offset] == '*')\n\t\t{\n\t\t\t\/\/if offset is 0, contains nothing\n\t\t\treturn offset ? offset - 1 : 0 ;\n\t\t}\n\t}\n\n\treturn offset;\n}\n\n} \/\/ namespace jma\n<commit_msg>check whether a word is stop word in the runWithString and runWithStream<commit_after>\/** \\file crf_analyzer.cpp\n * Implementation of class CRF_Analyzer.\n *\n * \\author Jun Jiang\n * \\version 0.1\n * \\date Mar 2, 2009\n *\/\n\n\n#include <cassert>\n#include <iostream>\n#include <sstream>\n#include <fstream>\n\n#include \"jma_analyzer.h\"\n#include \"jma_knowledge.h\"\n#include \"tokenizer.h\"\n\n\nnamespace jma\n{\n\n\/**\n * Whether the two MorphemeLists is the same\n * \\param list1 the MorphemeList 1\n * \\param list2 the MorphemeList 2\n *\/\ninline bool isSameMorphemeList( const MorphemeList* list1, const MorphemeList* list2, bool printPOS )\n{\n\t\/\/ if one is zero pointer, return null\n\tif( !list1 || !list2 )\n\t{\n\t\treturn false;\n\t}\n\n\tif( list1->size() != list2->size() )\n\t\treturn false;\n\t\/\/compare one by one\n\tsize_t N = list1->size();\n\tif( printPOS )\n\t{\n\t\tfor( size_t i = 0; i < N; ++i )\n\t\t{\n\t\t\tconst Morpheme& m1 = (*list1)[i];\n\t\t\tconst Morpheme& m2 = (*list2)[i];\n\t\t\tif( m1.lexicon_ != m2.lexicon_ || m1.posCode_ != m2.posCode_\n\t\t\t\t\t|| m1.posStr_ != m2.posStr_ )\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor( size_t i = 0; i < N; ++i )\n\t\t{\n\t\t\tif( (*list1)[i].lexicon_ != (*list2)[i].lexicon_ )\n\t\t\t\treturn false;\n\t\t}\n\t}\n\t\/\/all the elements are the same\n\treturn true;\n}\n\nJMA_Analyzer::JMA_Analyzer()\n    : knowledge_(0), tagger_(0)\n{\n}\n\nJMA_Analyzer::~JMA_Analyzer()\n{\n}\n\nvoid JMA_Analyzer::setKnowledge(Knowledge* pKnowledge)\n{\n    assert(pKnowledge);\n\n    knowledge_ = dynamic_cast<JMA_Knowledge*>(pKnowledge);\n    assert(knowledge_);\n    tagger_ = knowledge_->getTagger();\n    assert(tagger_);\n    tagger_->set_lattice_level(1);\n    maxPosCateOffset_ = knowledge_->getPOSCatNum() - 1;\n}\n\nint JMA_Analyzer::runWithSentence(Sentence& sentence)\n{\n\tbool printPOS = getOption(OPTION_TYPE_POS_TAGGING) > 0;\n\tint N = (int)getOption(Analyzer::OPTION_TYPE_NBEST);\n\n\t\/\/one best\n\tif(N <= 1)\n\t{\n\t\tconst MeCab::Node* bosNode = tagger_->parseToNode( sentence.getString() );\n\t\tMorphemeList list;\n\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next)\n\t\t{\n\t\t\tstring seg(node->surface, node->length);\n\t\t\tif(knowledge_->isStopWord(seg))\n\t\t\t\tcontinue;\n\t\t\tlist.push_back(Morpheme());\n\t\t\tMorpheme& morp = list.back();\n\t\t\tmorp.lexicon_ = seg;\n\t\t\tif(printPOS)\n\t\t\t{\n\t\t\t\tmorp.posCode_ = (int)node->posid;\n\t\t\t\tmorp.posStr_ = string(node->feature, getPOSOffset(node->feature));\n\t\t\t}\n\t\t}\n\t\tsentence.addList(list, 1.0);\n\t}\n\t\/\/ N-best\n\telse\n\t{\n\t\tdouble totalScore = 0;\n\n\t\tif( !tagger_->parseNBestInit( sentence.getString() ) )\n\t\t{\n\t\t\tcerr << \"[Error] Cannot parseNBestInit on the \" << sentence.getString() << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\tlong base = 0;\n\t\tint i = 0;\n\t\tfor ( ; i < N;  )\n\t\t{\n\t\t\tconst MeCab::Node* bosNode = tagger_->nextNode();\n\t\t\tif( !bosNode )\n\t\t\t\tbreak;\n\t\t\tMorphemeList list;\n\t\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next)\n\t\t\t{\n\t\t\t\tstring seg(node->surface, node->length);\n\t\t\t\tif(knowledge_->isStopWord(seg))\n\t\t\t\t\tcontinue;\n\t\t\t\tlist.push_back(Morpheme());\n\t\t\t\tMorpheme& morp = list.back();\n\t\t\t\tmorp.lexicon_ = seg;\n\t\t\t\tif(printPOS)\n\t\t\t\t{\n\t\t\t\t\tmorp.posCode_ = (int)node->posid;\n\t\t\t\t\tmorp.posStr_ = string(node->feature, getPOSOffset(node->feature));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbool isDupl = false;\n\t\t\t\/\/check the current result with exits results\n\t\t\tfor( int listOffset = sentence.getListSize() - 1 ; listOffset >= 0; --listOffset )\n\t\t\t{\n\t\t\t\tif( isSameMorphemeList( sentence.getMorphemeList(listOffset), &list, printPOS ) )\n\t\t\t\t{\n\t\t\t\t\tisDupl = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ignore the duplicate results\n\t\t\tif( isDupl )\n\t\t\t\tcontinue;\n\n\t\t\tlong score = tagger_->nextScore();\n\t\t\tif( i == 0 )\n\t\t\t\tbase = score > BASE_NBEST_SCORE ? score - BASE_NBEST_SCORE : 0;\n\n\t\t\tdouble dScore = 1.0 \/ (score - base );\n\t\t\ttotalScore += dScore;\n\t\t\tsentence.addList( list, dScore );\n\t\t\t++i;\n\t\t}\n\n\t\tfor ( int j = 0; j < i; ++j )\n\t\t{\n\t\t\tsentence.setScore(j, sentence.getScore(j) \/ totalScore );\n\t\t}\n\t}\n\n\treturn 1;\n}\n\nconst char* JMA_Analyzer::runWithString(const char* inStr)\n{\n\tbool printPOS = getOption(OPTION_TYPE_POS_TAGGING) > 0;\n\n\tconst MeCab::Node* bosNode = tagger_->parseToNode( inStr );\n\n\tstrBuf_.clear();\n\tif (printPOS) {\n\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next){\n\t\t\tstring seg(node->surface, node->length);\n\t\t\tif(knowledge_->isStopWord(seg))\n\t\t\t\tcontinue;\n\n\t\t\tstrBuf_.append(node->surface, node->length).append(posDelimiter_).\n\t\t\t\tappend(node->feature, getPOSOffset(node->feature) ).append(wordDelimiter_);\n\t\t}\n\n\t} else {\n\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next){\n\t\t\tstring seg(node->surface, node->length);\n\t\t\tif(knowledge_->isStopWord(seg))\n\t\t\t\tcontinue;\n\n\t\t\tstrBuf_.append(node->surface, node->length).append(wordDelimiter_);\n\t\t}\n\t}\n\n\treturn strBuf_.c_str();\n\n}\n\nint JMA_Analyzer::runWithStream(const char* inFileName, const char* outFileName)\n{\n\tassert(inFileName);\n\tassert(outFileName);\n\n\tbool printPOS = getOption(OPTION_TYPE_POS_TAGGING) > 0;\n\n\tifstream in(inFileName);\n\tif(!in)\n\t{\n\t\tcerr<<\"[Error] The input file \"<<inFileName<<\" not exists!\"<<endl;\n\t\treturn 0;\n\t}\n    ofstream out(outFileName);\n    string line;\n    bool remains = !in.eof();\n    while (remains) {\n        getline(in, line);\n        remains = !in.eof();\n        if (!line.length()) {\n            if( remains )\n\t\t\t\tout << endl;\n            continue;\n        }\n\n        const MeCab::Node* bosNode = tagger_->parseToNode( line.c_str() );\n\n        if (printPOS) {\n\t\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next){\n\t\t\t\tstring seg(node->surface, node->length);\n\t\t\t\tif(knowledge_->isStopWord(seg))\n\t\t\t\t\tcontinue;\n\n\t\t\t\tout.write(node->surface, node->length) << posDelimiter_;\n\t\t\t\tout.write(node->feature, getPOSOffset(node->feature) ) << wordDelimiter_;\n\t\t\t}\n\n            if (remains)\n                out << endl;\n            else\n                break;\n\n        } else {\n\t\t\tfor (const MeCab::Node *node = bosNode->next; node->next; node = node->next){\n\t\t\t\tstring seg(node->surface, node->length);\n\t\t\t\tif(knowledge_->isStopWord(seg))\n\t\t\t\t\tcontinue;\n\n\t\t\t\tout.write(node->surface, node->length) << wordDelimiter_;\n\t\t\t}\n\n\t\t\tif (remains)\n\t\t\t\tout << endl;\n\t\t\telse\n\t\t\t\tbreak;\n        }\n    }\n\n    in.close();\n    out.close();\n    return 1;\n}\n\nvoid JMA_Analyzer::splitSentence(const char* paragraph, std::vector<Sentence>& sentences)\n{\n    if(! paragraph)\n        return;\n\n    Sentence result;\n    string sentenceStr;\n    CTypeTokenizer tokenizer( knowledge_->getCType() );\n    tokenizer.assign(paragraph);\n    for(const char* p=tokenizer.next(); p; p=tokenizer.next())\n    {\n        if( knowledge_->isSentenceSeparator(p) )\n        {\n            sentenceStr += p;\n\n            result.setString(sentenceStr.c_str());\n            sentences.push_back(result);\n\n            sentenceStr.clear();\n        }\n        \/*\/\/ white-space characters are also used as sentence separator,\n        \/\/ but they are ignored in the sentence result\n        else if(ctype_->isSpace(p))\n        {\n            if(! sentenceStr.empty())\n            {\n                result.setString(sentenceStr.c_str());\n                sentences.push_back(result);\n\n                sentenceStr.clear();\n            }\n        }*\/\n        else\n        {\n            sentenceStr += p;\n        }\n    }\n\n    \/\/ in case the last character is not space or sentence separator\n    if(! sentenceStr.empty())\n    {\n        result.setString(sentenceStr.c_str());\n        sentences.push_back(result);\n\n        sentenceStr.clear();\n    }\n}\n\n\nint JMA_Analyzer::getPOSOffset(const char* feature){\n\tif( knowledge_->isOutputFullPOS() )\n\t{\n\t\t\/\/ count for the index of the fourth offset\n\t\tint offset = 0;\n\t\tint commaCount = 0;\n\t\tfor( ; feature[offset]; ++offset )\n\t\t{\n\t\t\tif(feature[offset] == ',')\n\t\t\t{\n\t\t\t\t++commaCount;\n\t\t\t\tif( commaCount > maxPosCateOffset_ )\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn offset;\n\t}\n\n\t \/\/count for the index of the comma that after non-star pos sections\n\tint offset = 0;\n\tint commaCount = 0;\n\tfor( ; feature[offset]; ++offset )\n\t{\n\t\tif(feature[offset] == ',')\n\t\t{\n\t\t\t++commaCount;\n\t\t\tif( commaCount > maxPosCateOffset_ )\n\t\t\t\tbreak;\n\t\t}\n\t\telse if(feature[offset] == '*')\n\t\t{\n\t\t\t\/\/if offset is 0, contains nothing\n\t\t\treturn offset ? offset - 1 : 0 ;\n\t\t}\n\t}\n\n\treturn offset;\n}\n\n} \/\/ namespace jma\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: formula.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2004-03-08 11:55:35 $\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_FORMULA_HXX\n#define SC_FORMULA_HXX\n\n#ifndef SC_ANYREFDG_HXX\n#include \"anyrefdg.hxx\"\n#endif\n\n#ifndef SC_FUNCUTL_HXX\n#include \"funcutl.hxx\"\n#endif\n\n#ifndef SC_SCGLOB_HXX\n#include \"global.hxx\"       \/\/ ScAddress\n#endif\n\n#ifndef _STDCTRL_HXX \/\/autogen\n#include <svtools\/stdctrl.hxx>\n#endif\n#ifndef _LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _SV_GROUP_HXX \/\/autogen\n#include <vcl\/group.hxx>\n#endif\n\n#ifndef _SVEDIT_HXX \/\/autogen\n#include <svtools\/svmedit.hxx>\n#endif\n\n#ifndef _SV_TABPAGE_HXX \/\/autogen\n#include <vcl\/tabpage.hxx>\n#endif\n\n#ifndef _SVSTDARR_STRINGS\n\n#define _SVSTDARR_STRINGS\n#include <svtools\/svstdarr.hxx>\n\n#endif\n\n#ifndef _SV_TABCTRL_HXX \/\/autogen\n#include <vcl\/tabctrl.hxx>\n#endif\n\n#ifndef SC_PARAWIN_HXX\n#include \"parawin.hxx\"\n#endif\n\n#ifndef _SVTREEBOX_HXX \/\/autogen\n#include <svtools\/svtreebx.hxx>\n#endif\n\n#ifndef SC_COMPILER_HXX\n#include \"compiler.hxx\"\n#endif\n\n#ifndef SC_CELL_HXX\n#include \"cell.hxx\"\n#endif\n\n#ifndef SC_FUNCPAGE_HXX\n#include \"funcpage.hxx\"\n#endif\n\n#ifndef SC_STRUCTPG_HXX\n#include \"structpg.hxx\"\n#endif\n\nclass ScViewData;\nclass ScDocument;\nclass ScFuncDesc;\nclass ScInputHandler;\nclass ScDocShell;\n\n\/\/============================================================================\n\nenum ScFormulaDlgMode { SC_FORMDLG_FORMULA, SC_FORMDLG_ARGS, SC_FORMDLG_EDIT };\n\n\/\/============================================================================\n\ntypedef ScTabViewShell* PtrTabViewShell;\n\n\/\/============================================================================\n\n\/\/============================================================================\n\nclass ScFormulaDlg : public ScAnyRefDlg\n{\npublic:\n                    ScFormulaDlg( SfxBindings* pB, SfxChildWindow* pCW,\n                                    Window* pParent, ScViewData* pViewData );\n                    ~ScFormulaDlg();\n\n    virtual void    SetReference( const ScRange& rRef, ScDocument* pRefDoc );\n    virtual BOOL    IsRefInputMode() const;\n    virtual BOOL    IsDocAllowed(SfxObjectShell* pDocSh) const;\n    virtual void    SetActive();\n    virtual BOOL    Close();\n\nprivate:\n\n    TabControl      aTabCtrl;\n    GroupBox        aGbEdit;        \/\/! MUST be placed before aScParaWin for initializing\n    ScParaWin       aScParaWin;\n    FixedText       aFtHeadLine;\n    FixedInfo       aFtFuncName;\n    FixedInfo       aFtFuncDesc;\n\n    FixedText       aFtEditName;\n    \/\/FixedInfo     aFtEditDesc;\n\n    FixedText       aFtResult;\n    ValWnd          aWndResult;\n\n    FixedText       aFtFormula;\n    ScEditBox       aMEFormula;\n\n    CheckBox        aBtnMatrix;\n    HelpButton      aBtnHelp;\n    CancelButton    aBtnCancel;\n\n    PushButton      aBtnBackward;\n    PushButton      aBtnForward;\n    OKButton        aBtnEnd;\n\n    ScRefEdit       aEdRef;\n    ScRefButton     aRefBtn;\n\n    FixedText       aFtFormResult;\n    ValWnd          aWndFormResult;\n\n    ScRefEdit*      pTheRefEdit;\n    ScRefButton*    pTheRefButton;\n    ScFuncPage*     pScFuncPage;\n    ScStructPage*   pScStructPage;\n    ScFormulaCell*  pCell;\n    ScCompiler*     pComp;\n    ScTokenArray*   pScTokA;\n    String          aOldFormula;\n    BOOL            bStructUpdate;\n    MultiLineEdit*  pMEdit;\n    BOOL            bUserMatrixFlag;\n    Timer           aTimer;\n\n    const String    aTitle1;\n    const String    aTitle2;\n    const String    aTxtEnd;\n    const String    aTxtOk;     \/\/ hinter aBtnEnd\n\n    ULONG           nOldHelp;\n    ULONG           nOldUnique;\n    ULONG           nActivWinId;\n    BOOL            bIsShutDown;\n\n\n\n    Font            aFntBold;\n    Font            aFntLight;\n    USHORT          nEdFocus;\n\/\/    Selection       theCurSel;\n    BOOL            bEditFlag;\n    const ScFuncDesc*   pFuncDesc;\n    USHORT          nArgs;\n    String**        pArgArr;\n    Selection       aFuncSel;\n\n    static ScDocument*  pDoc;\n    static ScAddress    aCursorPos;\n\nprotected:\n\n    virtual long    PreNotify( NotifyEvent& rNEvt );\n    virtual void    RefInputStart( ScRefEdit* pEdit, ScRefButton* pButton = NULL );\n    virtual void    RefInputDone( BOOL bForced = FALSE );\n    ULONG           FindFocusWin(Window *pWin);\n    void            SetFocusWin(Window *pWin,ULONG nUniqueId);\n    String          RepairFormula(const String& aFormula);\n    void            SaveLRUEntry(const ScFuncDesc*  pFuncDesc);\n    void            HighlightFunctionParas(const String& aFormula);\n\nprivate:\n\n    BOOL            IsInputHdl(ScInputHandler* pHdl);\n    ScInputHandler* GetNextInputHandler(ScDocShell* pDocShell,PtrTabViewShell* ppViewSh=NULL);\n\n    void            MakeTree(SvLBoxEntry* pParent,ScToken* pScToken,long Count,\n                                    ScTokenArray* pScTokA,ScCompiler*   pComp);\n\n    void            ClearAllParas();\n    void            DeleteArgs();\n    void            FillDialog(BOOL nFlag=TRUE);\n    void            EditNextFunc( BOOL bForward, xub_StrLen nFStart=NOT_FOUND );\n    void            EditThisFunc(xub_StrLen nFStart);\n    void            EditFuncParas(xub_StrLen nEditPos);\n\n\n    void            UpdateArgInput( USHORT nOffset, USHORT nInput );\n    BOOL            CalcValue( const String& rStrExp, String& rStrResult );\n    BOOL            CalcStruct( const String& rStrExp);\n\n    void            UpdateValues();\n    void            SaveArg( USHORT nEd );\n    void            UpdateSelection();\n    void            DoEnter( BOOL bOk );\n    void            UpdateFunctionDesc();\n    void            ResizeArgArr( const ScFuncDesc* pNewFunc );\n    void            FillListboxes();\n    void            FillControls();\n\n    xub_StrLen      GetFunctionPos(xub_StrLen nPos);\n    void            UpdateTokenArray( const String& rStrExp);\n\n    ScRefEdit*      GetCurrRefEdit();\n\n    DECL_LINK( ScrollHdl, ScParaWin* );\n    DECL_LINK( ModifyHdl, ScParaWin* );\n    DECL_LINK( FxHdl, ScParaWin* );\n\n    DECL_LINK( MatrixHdl, CheckBox *);\n    DECL_LINK( FormulaHdl, MultiLineEdit* );\n    DECL_LINK( FormulaCursorHdl, ScEditBox*);\n    DECL_LINK( BtnHdl, PushButton* );\n    DECL_LINK( GetEdFocusHdl, ArgInput* );\n    DECL_LINK( GetFxFocusHdl, ArgInput* );\n    DECL_LINK( DblClkHdl, ScFuncPage* );\n    DECL_LINK( FuncSelHdl, ScFuncPage*);\n    DECL_LINK( StructSelHdl, ScStructPage * );\n    DECL_LINK( UpdateFocusHdl, Timer*);\n};\n\n\n\n#endif \/\/ SC_CRNRDLG_HXX\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.520); FILE MERGED 2005\/09\/05 15:05:22 rt 1.3.520.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: formula.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 21:26: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 SC_FORMULA_HXX\n#define SC_FORMULA_HXX\n\n#ifndef SC_ANYREFDG_HXX\n#include \"anyrefdg.hxx\"\n#endif\n\n#ifndef SC_FUNCUTL_HXX\n#include \"funcutl.hxx\"\n#endif\n\n#ifndef SC_SCGLOB_HXX\n#include \"global.hxx\"       \/\/ ScAddress\n#endif\n\n#ifndef _STDCTRL_HXX \/\/autogen\n#include <svtools\/stdctrl.hxx>\n#endif\n#ifndef _LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _SV_GROUP_HXX \/\/autogen\n#include <vcl\/group.hxx>\n#endif\n\n#ifndef _SVEDIT_HXX \/\/autogen\n#include <svtools\/svmedit.hxx>\n#endif\n\n#ifndef _SV_TABPAGE_HXX \/\/autogen\n#include <vcl\/tabpage.hxx>\n#endif\n\n#ifndef _SVSTDARR_STRINGS\n\n#define _SVSTDARR_STRINGS\n#include <svtools\/svstdarr.hxx>\n\n#endif\n\n#ifndef _SV_TABCTRL_HXX \/\/autogen\n#include <vcl\/tabctrl.hxx>\n#endif\n\n#ifndef SC_PARAWIN_HXX\n#include \"parawin.hxx\"\n#endif\n\n#ifndef _SVTREEBOX_HXX \/\/autogen\n#include <svtools\/svtreebx.hxx>\n#endif\n\n#ifndef SC_COMPILER_HXX\n#include \"compiler.hxx\"\n#endif\n\n#ifndef SC_CELL_HXX\n#include \"cell.hxx\"\n#endif\n\n#ifndef SC_FUNCPAGE_HXX\n#include \"funcpage.hxx\"\n#endif\n\n#ifndef SC_STRUCTPG_HXX\n#include \"structpg.hxx\"\n#endif\n\nclass ScViewData;\nclass ScDocument;\nclass ScFuncDesc;\nclass ScInputHandler;\nclass ScDocShell;\n\n\/\/============================================================================\n\nenum ScFormulaDlgMode { SC_FORMDLG_FORMULA, SC_FORMDLG_ARGS, SC_FORMDLG_EDIT };\n\n\/\/============================================================================\n\ntypedef ScTabViewShell* PtrTabViewShell;\n\n\/\/============================================================================\n\n\/\/============================================================================\n\nclass ScFormulaDlg : public ScAnyRefDlg\n{\npublic:\n                    ScFormulaDlg( SfxBindings* pB, SfxChildWindow* pCW,\n                                    Window* pParent, ScViewData* pViewData );\n                    ~ScFormulaDlg();\n\n    virtual void    SetReference( const ScRange& rRef, ScDocument* pRefDoc );\n    virtual BOOL    IsRefInputMode() const;\n    virtual BOOL    IsDocAllowed(SfxObjectShell* pDocSh) const;\n    virtual void    SetActive();\n    virtual BOOL    Close();\n\nprivate:\n\n    TabControl      aTabCtrl;\n    GroupBox        aGbEdit;        \/\/! MUST be placed before aScParaWin for initializing\n    ScParaWin       aScParaWin;\n    FixedText       aFtHeadLine;\n    FixedInfo       aFtFuncName;\n    FixedInfo       aFtFuncDesc;\n\n    FixedText       aFtEditName;\n    \/\/FixedInfo     aFtEditDesc;\n\n    FixedText       aFtResult;\n    ValWnd          aWndResult;\n\n    FixedText       aFtFormula;\n    ScEditBox       aMEFormula;\n\n    CheckBox        aBtnMatrix;\n    HelpButton      aBtnHelp;\n    CancelButton    aBtnCancel;\n\n    PushButton      aBtnBackward;\n    PushButton      aBtnForward;\n    OKButton        aBtnEnd;\n\n    ScRefEdit       aEdRef;\n    ScRefButton     aRefBtn;\n\n    FixedText       aFtFormResult;\n    ValWnd          aWndFormResult;\n\n    ScRefEdit*      pTheRefEdit;\n    ScRefButton*    pTheRefButton;\n    ScFuncPage*     pScFuncPage;\n    ScStructPage*   pScStructPage;\n    ScFormulaCell*  pCell;\n    ScCompiler*     pComp;\n    ScTokenArray*   pScTokA;\n    String          aOldFormula;\n    BOOL            bStructUpdate;\n    MultiLineEdit*  pMEdit;\n    BOOL            bUserMatrixFlag;\n    Timer           aTimer;\n\n    const String    aTitle1;\n    const String    aTitle2;\n    const String    aTxtEnd;\n    const String    aTxtOk;     \/\/ hinter aBtnEnd\n\n    ULONG           nOldHelp;\n    ULONG           nOldUnique;\n    ULONG           nActivWinId;\n    BOOL            bIsShutDown;\n\n\n\n    Font            aFntBold;\n    Font            aFntLight;\n    USHORT          nEdFocus;\n\/\/    Selection       theCurSel;\n    BOOL            bEditFlag;\n    const ScFuncDesc*   pFuncDesc;\n    USHORT          nArgs;\n    String**        pArgArr;\n    Selection       aFuncSel;\n\n    static ScDocument*  pDoc;\n    static ScAddress    aCursorPos;\n\nprotected:\n\n    virtual long    PreNotify( NotifyEvent& rNEvt );\n    virtual void    RefInputStart( ScRefEdit* pEdit, ScRefButton* pButton = NULL );\n    virtual void    RefInputDone( BOOL bForced = FALSE );\n    ULONG           FindFocusWin(Window *pWin);\n    void            SetFocusWin(Window *pWin,ULONG nUniqueId);\n    String          RepairFormula(const String& aFormula);\n    void            SaveLRUEntry(const ScFuncDesc*  pFuncDesc);\n    void            HighlightFunctionParas(const String& aFormula);\n\nprivate:\n\n    BOOL            IsInputHdl(ScInputHandler* pHdl);\n    ScInputHandler* GetNextInputHandler(ScDocShell* pDocShell,PtrTabViewShell* ppViewSh=NULL);\n\n    void            MakeTree(SvLBoxEntry* pParent,ScToken* pScToken,long Count,\n                                    ScTokenArray* pScTokA,ScCompiler*   pComp);\n\n    void            ClearAllParas();\n    void            DeleteArgs();\n    void            FillDialog(BOOL nFlag=TRUE);\n    void            EditNextFunc( BOOL bForward, xub_StrLen nFStart=NOT_FOUND );\n    void            EditThisFunc(xub_StrLen nFStart);\n    void            EditFuncParas(xub_StrLen nEditPos);\n\n\n    void            UpdateArgInput( USHORT nOffset, USHORT nInput );\n    BOOL            CalcValue( const String& rStrExp, String& rStrResult );\n    BOOL            CalcStruct( const String& rStrExp);\n\n    void            UpdateValues();\n    void            SaveArg( USHORT nEd );\n    void            UpdateSelection();\n    void            DoEnter( BOOL bOk );\n    void            UpdateFunctionDesc();\n    void            ResizeArgArr( const ScFuncDesc* pNewFunc );\n    void            FillListboxes();\n    void            FillControls();\n\n    xub_StrLen      GetFunctionPos(xub_StrLen nPos);\n    void            UpdateTokenArray( const String& rStrExp);\n\n    ScRefEdit*      GetCurrRefEdit();\n\n    DECL_LINK( ScrollHdl, ScParaWin* );\n    DECL_LINK( ModifyHdl, ScParaWin* );\n    DECL_LINK( FxHdl, ScParaWin* );\n\n    DECL_LINK( MatrixHdl, CheckBox *);\n    DECL_LINK( FormulaHdl, MultiLineEdit* );\n    DECL_LINK( FormulaCursorHdl, ScEditBox*);\n    DECL_LINK( BtnHdl, PushButton* );\n    DECL_LINK( GetEdFocusHdl, ArgInput* );\n    DECL_LINK( GetFxFocusHdl, ArgInput* );\n    DECL_LINK( DblClkHdl, ScFuncPage* );\n    DECL_LINK( FuncSelHdl, ScFuncPage*);\n    DECL_LINK( StructSelHdl, ScStructPage * );\n    DECL_LINK( UpdateFocusHdl, Timer*);\n};\n\n\n\n#endif \/\/ SC_CRNRDLG_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: gridwin.hxx,v $\n *\n *  $Revision: 1.20 $\n *\n *  last change: $Author: vg $ $Date: 2005-03-08 15:44: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#ifndef SC_GRIDWIN_HXX\n#define SC_GRIDWIN_HXX\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\n#ifndef _TRANSFER_HXX\n#include <svtools\/transfer.hxx>\n#endif\n\n\/\/ nur auf dem MAC Auto-Filter per Popup\n#ifdef MAC\n#define AUTOFILTER_POPUP\n#else\n#undef AUTOFILTER_POPUP\n#endif\n\n#ifndef SC_VIEWUTIL_HXX\n#include \"viewutil.hxx\"\n#endif\n\n#ifndef SC_VIEWDATA_HXX\n#include \"viewdata.hxx\"\n#endif\n\n#ifndef SC_CBUTTON_HXX\n#include \"cbutton.hxx\"\n#endif\n\n\/\/ ---------------------------------------------------------------------------\n\nstruct ScTableInfo;\nclass ScViewSelectionEngine;\nclass ScPivot;\nclass ScDPObject;\nclass ScOutputData;\nclass ScFilterListBox;\nclass AutoFilterPopup;\nclass SdrObject;\nclass SdrEditView;\nclass ScNoteMarker;\nclass FloatingWindow;\nclass SdrHdlList;\nclass ScTransferObj;\nstruct SpellCallbackInfo;\n\n        \/\/  Maus-Status (nMouseStatus)\n\n#define SC_GM_NONE          0\n#define SC_GM_TABDOWN       1\n#define SC_GM_DBLDOWN       2\n#define SC_GM_FILTER        3\n#define SC_GM_IGNORE        4\n#define SC_GM_WATERUNDO     5\n#define SC_GM_URLDOWN       6\n\n        \/\/  Page-Drag-Modus\n\n#define SC_PD_NONE          0\n#define SC_PD_RANGE_L       1\n#define SC_PD_RANGE_R       2\n#define SC_PD_RANGE_T       4\n#define SC_PD_RANGE_B       8\n#define SC_PD_RANGE_TL      (SC_PD_RANGE_T|SC_PD_RANGE_L)\n#define SC_PD_RANGE_TR      (SC_PD_RANGE_T|SC_PD_RANGE_R)\n#define SC_PD_RANGE_BL      (SC_PD_RANGE_B|SC_PD_RANGE_L)\n#define SC_PD_RANGE_BR      (SC_PD_RANGE_B|SC_PD_RANGE_R)\n#define SC_PD_BREAK_H       16\n#define SC_PD_BREAK_V       32\n\n\nclass ScHideTextCursor\n{\nprivate:\n    ScViewData* pViewData;\n    ScSplitPos  eWhich;\n\npublic:\n            ScHideTextCursor( ScViewData* pData, ScSplitPos eW );\n            ~ScHideTextCursor();\n};\n\n\nclass ScGridWindow : public Window, public DropTargetHelper, public DragSourceHelper\n{\n    \/\/  ScFilterListBox wird immer fuer Auswahlliste benutzt\n    friend class ScFilterListBox;\n#ifdef AUTOFILTER_POPUP\n    friend class AutoFilterPopup;\n#endif\n\nprivate:\n    ScViewData*             pViewData;\n    ScSplitPos              eWhich;\n    ScHSplitPos             eHWhich;\n    ScVSplitPos             eVWhich;\n\n    ScNoteMarker*           pNoteMarker;\n\n    ScFilterListBox*        pFilterBox;\n    FloatingWindow*         pFilterFloat;\n\n    USHORT                  nCursorHideCount;\n\n    BOOL                    bMarking;\n\n    USHORT                  nButtonDown;\n    BOOL                    bEEMouse;               \/\/ Edit-Engine hat Maus\n    BYTE                    nMouseStatus;\n    BYTE                    nNestedButtonState;     \/\/ track nested button up\/down calls\n\n    BOOL                    bPivotMouse;            \/\/ Pivot-D&D (alte Pivottabellen)\n    ScPivot*                pDragPivot;\n    BOOL                    bPivotColField;\n    SCCOL                   nPivotCol;\n    SCCOL                   nPivotField;\n\n    BOOL                    bDPMouse;               \/\/ DataPilot-D&D (neue Pivottabellen)\n    long                    nDPField;\n    ScDPObject*             pDragDPObj; \/\/! name?\n\n    BOOL                    bRFMouse;               \/\/ RangeFinder-Drag\n    BOOL                    bRFSize;\n    USHORT                  nRFIndex;\n    SCsCOL                  nRFAddX;\n    SCsROW                  nRFAddY;\n\n    USHORT                  nPagebreakMouse;        \/\/ Pagebreak-Modus Drag\n    SCCOLROW                nPagebreakBreak;\n    SCCOLROW                nPagebreakPrev;\n    ScRange                 aPagebreakSource;\n    ScRange                 aPagebreakDrag;\n    BOOL                    bPagebreakDrawn;\n\n    BYTE                    nPageScript;\n\n    long                    nLastClickX;\n    long                    nLastClickY;\n\n    BOOL                    bDragRect;\n    SCCOL                   nDragStartX;\n    SCROW                   nDragStartY;\n    SCCOL                   nDragEndX;\n    SCROW                   nDragEndY;\n\n    USHORT                  nCurrentPointer;\n\n    BOOL                    bIsInScroll;\n    BOOL                    bIsInPaint;\n\n    ScDDComboBoxButton      aComboButton;\n\n    Point                   aCurMousePos;\n\n    USHORT                  nPaintCount;\n    Rectangle               aRepaintPixel;\n    BOOL                    bNeedsRepaint;\n\n    BOOL                    bAutoMarkVisible;\n    ScAddress               aAutoMarkPos;\n\n    BOOL                    bListValButton;\n    ScAddress               aListValPos;\n\n    Rectangle               aInvertRect;\n\n    DECL_LINK( PopupModeEndHdl, FloatingWindow* );\n    DECL_LINK( PopupSpellingHdl, SpellCallbackInfo* );\n\n    BOOL            TestMouse( const MouseEvent& rMEvt, BOOL bAction );\n\n    BOOL            DoPageFieldSelection( SCCOL nCol, SCROW nRow );\n    void            DoPushButton( SCCOL nCol, SCROW nRow, const MouseEvent& rMEvt );\n    void            PivotMouseMove( const MouseEvent& rMEvt );\n    void            PivotMouseButtonUp( const MouseEvent& rMEvt );\n    BOOL            PivotTestMouse( const MouseEvent& rMEvt, BOOL bMove );\n    void            DoPivotDrop( BOOL bDelete, BOOL bToCols, SCSIZE nDestPos );\n\n    void            DPMouseMove( const MouseEvent& rMEvt );\n    void            DPMouseButtonUp( const MouseEvent& rMEvt );\n    void            DPTestMouse( const MouseEvent& rMEvt, BOOL bMove );\n\n    void            RFMouseMove( const MouseEvent& rMEvt, BOOL bUp );\n\n    void            PagebreakMove( const MouseEvent& rMEvt, BOOL bUp );\n\n    void            UpdateDragRect( BOOL bShowRange, const Rectangle& rPosRect );\n\n    BOOL            IsAutoFilterActive( SCCOL nCol, SCROW nRow, SCTAB nTab );\n    void            ExecFilter( ULONG nSel, SCCOL nCol, SCROW nRow,\n                                const String& aValue );\n    void            FilterSelect( ULONG nSel );\n\n    void            ExecDataSelect( SCCOL nCol, SCROW nRow, const String& rStr );\n\n    void            ExecPageFieldSelect( SCCOL nCol, SCROW nRow, BOOL bHasSelection, const String& rStr );\n\n    BOOL            HasScenarioButton( const Point& rPosPixel, ScRange& rScenRange );\n\n    BOOL            DropScroll( const Point& rMousePos );\n\n    sal_Int8        AcceptPrivateDrop( const AcceptDropEvent& rEvt );\n    sal_Int8        ExecutePrivateDrop( const ExecuteDropEvent& rEvt );\n    sal_Int8        DropTransferObj( ScTransferObj* pTransObj, SCCOL nDestPosX, SCROW nDestPosY,\n                                    const Point& rLogicPos, sal_Int8 nDndAction );\n\n    void            HandleMouseButtonDown( const MouseEvent& rMEvt );\n\n    BOOL            DrawMouseButtonDown(const MouseEvent& rMEvt);\n    BOOL            DrawMouseButtonUp(const MouseEvent& rMEvt);\n    BOOL            DrawMouseMove(const MouseEvent& rMEvt);\n    BOOL            DrawKeyInput(const KeyEvent& rKEvt);\n    BOOL            DrawCommand(const CommandEvent& rCEvt);\n    BOOL            DrawHasMarkedObj();\n    void            DrawEndAction();\n    void            DrawMarkDropObj( SdrObject* pObj );\n    SdrObject*      GetEditObject();\n    BOOL            IsMyModel(SdrEditView* pSdrView);\n    void            DrawStartTimer();\n\n    void            DrawRedraw( ScOutputData& rOutputData, const Rectangle& rDrawingRect,\n                                        ScUpdateMode eMode, ULONG nLayer );\n    void            DrawSdrGrid( const Rectangle& rDrawingRect );\n    BOOL            DrawBeforeScroll();\n    void            DrawAfterScroll(BOOL bVal);\n    void            OutlinerViewPaint( const Rectangle& rRect );\n    void            DrawMarks();\n    BOOL            NeedDrawMarks();\n    void            DrawComboButton( const Point&   rCellPos,\n                                     long           nCellSizeX,\n                                     long           nCellSizeY,\n                                     BOOL           bArrowState,\n                                     BOOL           bBtnIn  = FALSE );\n    Rectangle       GetListValButtonRect( const ScAddress& rButtonPos );\n\n    void            DrawPagePreview( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2 );\n\n    BOOL            GetEditUrl( const Point& rPos,\n                                String* pName=0, String* pUrl=0, String* pTarget=0 );\n    BOOL            GetEditUrlOrError( BOOL bSpellErr, const Point& rPos,\n                                String* pName=0, String* pUrl=0, String* pTarget=0 );\n\n    BOOL            HitRangeFinder( const Point& rMouse, BOOL& rCorner, USHORT* pIndex = NULL,\n                                        SCsCOL* pAddX = NULL, SCsROW* pAddY = NULL );\n\n    USHORT          HitPageBreak( const Point& rMouse, ScRange* pSource = NULL,\n                                    SCCOLROW* pBreak = NULL, SCCOLROW* pPrev = NULL );\n\n#ifdef AUTOFILTER_POPUP\n    void            DoAutoFilterPopup( SCCOL nCol, SCROW nRow, BOOL bDataSelect );\n#endif\n\n    void            PasteSelection( const Point& rPosPixel );\n\n    void            SelectForContextMenu( const Point& rPosPixel );\n\nprotected:\n    virtual void    Resize( const Size& rSize );\n    virtual void    Paint( const Rectangle& rRect );\n    virtual void    KeyInput(const KeyEvent& rKEvt);\n    virtual void    GetFocus();\n    virtual void    LoseFocus();\n\n    virtual void    RequestHelp( const HelpEvent& rEvt );\n    virtual void    Command( const CommandEvent& rCEvt );\n\n    virtual sal_Int8 AcceptDrop( const AcceptDropEvent& rEvt );\n    virtual sal_Int8 ExecuteDrop( const ExecuteDropEvent& rEvt );\n    virtual void    StartDrag( sal_Int8 nAction, const Point& rPosPixel );\n\npublic:\n    ScGridWindow( Window* pParent, ScViewData* pData, ScSplitPos eWhichPos );\n    ~ScGridWindow();\n\n    virtual void    DataChanged( const DataChangedEvent& rDCEvt );\n\n    virtual void    MouseButtonDown( const MouseEvent& rMEvt );\n    virtual void    MouseButtonUp( const MouseEvent& rMEvt );\n    virtual void    MouseMove( const MouseEvent& rMEvt );\n    virtual long    PreNotify( NotifyEvent& rNEvt );\n    virtual void    Tracking( const TrackingEvent& rTEvt );\n\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::accessibility::XAccessible > CreateAccessible();\n\n    void            FakeButtonUp();\n\n    Point           GetMousePosPixel() const;\n    void            UpdateStatusPosSize();\n\n    void            ClickExtern();\n\n    void            SetPointer( const Pointer& rPointer );\n\n    void            MoveMouseStatus( ScGridWindow &rDestWin );\n\n    void            ScrollPixel( long nDifX, long nDifY );\n    void            UpdateEditViewPos();\n\n    void            UpdateFormulas();\n\n    void            DoAutoFilterMenue( SCCOL nCol, SCROW nRow, BOOL bDataSelect );\n    void            DoScenarioMenue( const ScRange& rScenRange );\n    void            DoPageFieldMenue( SCCOL nCol, SCROW nRow );\n\n    BOOL            HasPageFieldData( SCCOL nCol, SCROW nRow ) const;\n\n    void            DrawButtons( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2,\n                                    ScTableInfo& rTabInfo );\n\n    void            Draw( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2,\n                        ScUpdateMode eMode = SC_UPDATE_ALL );\n\n    void            InvertSimple( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2,\n                                    BOOL bTestMerge = FALSE, BOOL bRepeat = FALSE );\n\n    void            DrawDragRect( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2,\n                                    BOOL bMarkDrop = TRUE );\n\n    void            DrawRefMark( SCCOL nRefStartX, SCROW nRefStartY,\n                                    SCCOL nRefEndX, SCROW nRefEndY,\n                                    const Color& rColor, BOOL bHandle );\n\n    void            CreateAnchorHandle(SdrHdlList& rHdl, const ScAddress& rAddress);\n\n    void            HideCursor();\n    void            ShowCursor();\n    void            DrawCursor();\n    void            DrawAutoFillMark();\n    void            UpdateAutoFillMark(BOOL bMarked, const ScRange& rMarkRange);\n\n    void            UpdateListValPos( BOOL bVisible, const ScAddress& rPos );\n\n    BOOL            ShowNoteMarker( SCsCOL nPosX, SCsROW nPosY, BOOL bKeyboard );\n    void            HideNoteMarker();\n\n    MapMode         GetDrawMapMode( BOOL bForce = FALSE );\n\n    void            ContinueDrag();\n\n    void            StopMarking();\n    void            UpdateInputContext();\n\n    void            CheckInverted()     { if (nPaintCount) bNeedsRepaint = TRUE; }\n\n    void            DoInvertRect( const Rectangle& rPixel );\n\n    void            CheckNeedsRepaint();\n};\n\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.20.128); FILE MERGED 2005\/09\/05 15:05:27 rt 1.20.128.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: gridwin.hxx,v $\n *\n *  $Revision: 1.21 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 21:30:53 $\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_GRIDWIN_HXX\n#define SC_GRIDWIN_HXX\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\n#ifndef _TRANSFER_HXX\n#include <svtools\/transfer.hxx>\n#endif\n\n\/\/ nur auf dem MAC Auto-Filter per Popup\n#ifdef MAC\n#define AUTOFILTER_POPUP\n#else\n#undef AUTOFILTER_POPUP\n#endif\n\n#ifndef SC_VIEWUTIL_HXX\n#include \"viewutil.hxx\"\n#endif\n\n#ifndef SC_VIEWDATA_HXX\n#include \"viewdata.hxx\"\n#endif\n\n#ifndef SC_CBUTTON_HXX\n#include \"cbutton.hxx\"\n#endif\n\n\/\/ ---------------------------------------------------------------------------\n\nstruct ScTableInfo;\nclass ScViewSelectionEngine;\nclass ScPivot;\nclass ScDPObject;\nclass ScOutputData;\nclass ScFilterListBox;\nclass AutoFilterPopup;\nclass SdrObject;\nclass SdrEditView;\nclass ScNoteMarker;\nclass FloatingWindow;\nclass SdrHdlList;\nclass ScTransferObj;\nstruct SpellCallbackInfo;\n\n        \/\/  Maus-Status (nMouseStatus)\n\n#define SC_GM_NONE          0\n#define SC_GM_TABDOWN       1\n#define SC_GM_DBLDOWN       2\n#define SC_GM_FILTER        3\n#define SC_GM_IGNORE        4\n#define SC_GM_WATERUNDO     5\n#define SC_GM_URLDOWN       6\n\n        \/\/  Page-Drag-Modus\n\n#define SC_PD_NONE          0\n#define SC_PD_RANGE_L       1\n#define SC_PD_RANGE_R       2\n#define SC_PD_RANGE_T       4\n#define SC_PD_RANGE_B       8\n#define SC_PD_RANGE_TL      (SC_PD_RANGE_T|SC_PD_RANGE_L)\n#define SC_PD_RANGE_TR      (SC_PD_RANGE_T|SC_PD_RANGE_R)\n#define SC_PD_RANGE_BL      (SC_PD_RANGE_B|SC_PD_RANGE_L)\n#define SC_PD_RANGE_BR      (SC_PD_RANGE_B|SC_PD_RANGE_R)\n#define SC_PD_BREAK_H       16\n#define SC_PD_BREAK_V       32\n\n\nclass ScHideTextCursor\n{\nprivate:\n    ScViewData* pViewData;\n    ScSplitPos  eWhich;\n\npublic:\n            ScHideTextCursor( ScViewData* pData, ScSplitPos eW );\n            ~ScHideTextCursor();\n};\n\n\nclass ScGridWindow : public Window, public DropTargetHelper, public DragSourceHelper\n{\n    \/\/  ScFilterListBox wird immer fuer Auswahlliste benutzt\n    friend class ScFilterListBox;\n#ifdef AUTOFILTER_POPUP\n    friend class AutoFilterPopup;\n#endif\n\nprivate:\n    ScViewData*             pViewData;\n    ScSplitPos              eWhich;\n    ScHSplitPos             eHWhich;\n    ScVSplitPos             eVWhich;\n\n    ScNoteMarker*           pNoteMarker;\n\n    ScFilterListBox*        pFilterBox;\n    FloatingWindow*         pFilterFloat;\n\n    USHORT                  nCursorHideCount;\n\n    BOOL                    bMarking;\n\n    USHORT                  nButtonDown;\n    BOOL                    bEEMouse;               \/\/ Edit-Engine hat Maus\n    BYTE                    nMouseStatus;\n    BYTE                    nNestedButtonState;     \/\/ track nested button up\/down calls\n\n    BOOL                    bPivotMouse;            \/\/ Pivot-D&D (alte Pivottabellen)\n    ScPivot*                pDragPivot;\n    BOOL                    bPivotColField;\n    SCCOL                   nPivotCol;\n    SCCOL                   nPivotField;\n\n    BOOL                    bDPMouse;               \/\/ DataPilot-D&D (neue Pivottabellen)\n    long                    nDPField;\n    ScDPObject*             pDragDPObj; \/\/! name?\n\n    BOOL                    bRFMouse;               \/\/ RangeFinder-Drag\n    BOOL                    bRFSize;\n    USHORT                  nRFIndex;\n    SCsCOL                  nRFAddX;\n    SCsROW                  nRFAddY;\n\n    USHORT                  nPagebreakMouse;        \/\/ Pagebreak-Modus Drag\n    SCCOLROW                nPagebreakBreak;\n    SCCOLROW                nPagebreakPrev;\n    ScRange                 aPagebreakSource;\n    ScRange                 aPagebreakDrag;\n    BOOL                    bPagebreakDrawn;\n\n    BYTE                    nPageScript;\n\n    long                    nLastClickX;\n    long                    nLastClickY;\n\n    BOOL                    bDragRect;\n    SCCOL                   nDragStartX;\n    SCROW                   nDragStartY;\n    SCCOL                   nDragEndX;\n    SCROW                   nDragEndY;\n\n    USHORT                  nCurrentPointer;\n\n    BOOL                    bIsInScroll;\n    BOOL                    bIsInPaint;\n\n    ScDDComboBoxButton      aComboButton;\n\n    Point                   aCurMousePos;\n\n    USHORT                  nPaintCount;\n    Rectangle               aRepaintPixel;\n    BOOL                    bNeedsRepaint;\n\n    BOOL                    bAutoMarkVisible;\n    ScAddress               aAutoMarkPos;\n\n    BOOL                    bListValButton;\n    ScAddress               aListValPos;\n\n    Rectangle               aInvertRect;\n\n    DECL_LINK( PopupModeEndHdl, FloatingWindow* );\n    DECL_LINK( PopupSpellingHdl, SpellCallbackInfo* );\n\n    BOOL            TestMouse( const MouseEvent& rMEvt, BOOL bAction );\n\n    BOOL            DoPageFieldSelection( SCCOL nCol, SCROW nRow );\n    void            DoPushButton( SCCOL nCol, SCROW nRow, const MouseEvent& rMEvt );\n    void            PivotMouseMove( const MouseEvent& rMEvt );\n    void            PivotMouseButtonUp( const MouseEvent& rMEvt );\n    BOOL            PivotTestMouse( const MouseEvent& rMEvt, BOOL bMove );\n    void            DoPivotDrop( BOOL bDelete, BOOL bToCols, SCSIZE nDestPos );\n\n    void            DPMouseMove( const MouseEvent& rMEvt );\n    void            DPMouseButtonUp( const MouseEvent& rMEvt );\n    void            DPTestMouse( const MouseEvent& rMEvt, BOOL bMove );\n\n    void            RFMouseMove( const MouseEvent& rMEvt, BOOL bUp );\n\n    void            PagebreakMove( const MouseEvent& rMEvt, BOOL bUp );\n\n    void            UpdateDragRect( BOOL bShowRange, const Rectangle& rPosRect );\n\n    BOOL            IsAutoFilterActive( SCCOL nCol, SCROW nRow, SCTAB nTab );\n    void            ExecFilter( ULONG nSel, SCCOL nCol, SCROW nRow,\n                                const String& aValue );\n    void            FilterSelect( ULONG nSel );\n\n    void            ExecDataSelect( SCCOL nCol, SCROW nRow, const String& rStr );\n\n    void            ExecPageFieldSelect( SCCOL nCol, SCROW nRow, BOOL bHasSelection, const String& rStr );\n\n    BOOL            HasScenarioButton( const Point& rPosPixel, ScRange& rScenRange );\n\n    BOOL            DropScroll( const Point& rMousePos );\n\n    sal_Int8        AcceptPrivateDrop( const AcceptDropEvent& rEvt );\n    sal_Int8        ExecutePrivateDrop( const ExecuteDropEvent& rEvt );\n    sal_Int8        DropTransferObj( ScTransferObj* pTransObj, SCCOL nDestPosX, SCROW nDestPosY,\n                                    const Point& rLogicPos, sal_Int8 nDndAction );\n\n    void            HandleMouseButtonDown( const MouseEvent& rMEvt );\n\n    BOOL            DrawMouseButtonDown(const MouseEvent& rMEvt);\n    BOOL            DrawMouseButtonUp(const MouseEvent& rMEvt);\n    BOOL            DrawMouseMove(const MouseEvent& rMEvt);\n    BOOL            DrawKeyInput(const KeyEvent& rKEvt);\n    BOOL            DrawCommand(const CommandEvent& rCEvt);\n    BOOL            DrawHasMarkedObj();\n    void            DrawEndAction();\n    void            DrawMarkDropObj( SdrObject* pObj );\n    SdrObject*      GetEditObject();\n    BOOL            IsMyModel(SdrEditView* pSdrView);\n    void            DrawStartTimer();\n\n    void            DrawRedraw( ScOutputData& rOutputData, const Rectangle& rDrawingRect,\n                                        ScUpdateMode eMode, ULONG nLayer );\n    void            DrawSdrGrid( const Rectangle& rDrawingRect );\n    BOOL            DrawBeforeScroll();\n    void            DrawAfterScroll(BOOL bVal);\n    void            OutlinerViewPaint( const Rectangle& rRect );\n    void            DrawMarks();\n    BOOL            NeedDrawMarks();\n    void            DrawComboButton( const Point&   rCellPos,\n                                     long           nCellSizeX,\n                                     long           nCellSizeY,\n                                     BOOL           bArrowState,\n                                     BOOL           bBtnIn  = FALSE );\n    Rectangle       GetListValButtonRect( const ScAddress& rButtonPos );\n\n    void            DrawPagePreview( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2 );\n\n    BOOL            GetEditUrl( const Point& rPos,\n                                String* pName=0, String* pUrl=0, String* pTarget=0 );\n    BOOL            GetEditUrlOrError( BOOL bSpellErr, const Point& rPos,\n                                String* pName=0, String* pUrl=0, String* pTarget=0 );\n\n    BOOL            HitRangeFinder( const Point& rMouse, BOOL& rCorner, USHORT* pIndex = NULL,\n                                        SCsCOL* pAddX = NULL, SCsROW* pAddY = NULL );\n\n    USHORT          HitPageBreak( const Point& rMouse, ScRange* pSource = NULL,\n                                    SCCOLROW* pBreak = NULL, SCCOLROW* pPrev = NULL );\n\n#ifdef AUTOFILTER_POPUP\n    void            DoAutoFilterPopup( SCCOL nCol, SCROW nRow, BOOL bDataSelect );\n#endif\n\n    void            PasteSelection( const Point& rPosPixel );\n\n    void            SelectForContextMenu( const Point& rPosPixel );\n\nprotected:\n    virtual void    Resize( const Size& rSize );\n    virtual void    Paint( const Rectangle& rRect );\n    virtual void    KeyInput(const KeyEvent& rKEvt);\n    virtual void    GetFocus();\n    virtual void    LoseFocus();\n\n    virtual void    RequestHelp( const HelpEvent& rEvt );\n    virtual void    Command( const CommandEvent& rCEvt );\n\n    virtual sal_Int8 AcceptDrop( const AcceptDropEvent& rEvt );\n    virtual sal_Int8 ExecuteDrop( const ExecuteDropEvent& rEvt );\n    virtual void    StartDrag( sal_Int8 nAction, const Point& rPosPixel );\n\npublic:\n    ScGridWindow( Window* pParent, ScViewData* pData, ScSplitPos eWhichPos );\n    ~ScGridWindow();\n\n    virtual void    DataChanged( const DataChangedEvent& rDCEvt );\n\n    virtual void    MouseButtonDown( const MouseEvent& rMEvt );\n    virtual void    MouseButtonUp( const MouseEvent& rMEvt );\n    virtual void    MouseMove( const MouseEvent& rMEvt );\n    virtual long    PreNotify( NotifyEvent& rNEvt );\n    virtual void    Tracking( const TrackingEvent& rTEvt );\n\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::accessibility::XAccessible > CreateAccessible();\n\n    void            FakeButtonUp();\n\n    Point           GetMousePosPixel() const;\n    void            UpdateStatusPosSize();\n\n    void            ClickExtern();\n\n    void            SetPointer( const Pointer& rPointer );\n\n    void            MoveMouseStatus( ScGridWindow &rDestWin );\n\n    void            ScrollPixel( long nDifX, long nDifY );\n    void            UpdateEditViewPos();\n\n    void            UpdateFormulas();\n\n    void            DoAutoFilterMenue( SCCOL nCol, SCROW nRow, BOOL bDataSelect );\n    void            DoScenarioMenue( const ScRange& rScenRange );\n    void            DoPageFieldMenue( SCCOL nCol, SCROW nRow );\n\n    BOOL            HasPageFieldData( SCCOL nCol, SCROW nRow ) const;\n\n    void            DrawButtons( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2,\n                                    ScTableInfo& rTabInfo );\n\n    void            Draw( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2,\n                        ScUpdateMode eMode = SC_UPDATE_ALL );\n\n    void            InvertSimple( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2,\n                                    BOOL bTestMerge = FALSE, BOOL bRepeat = FALSE );\n\n    void            DrawDragRect( SCCOL nX1, SCROW nY1, SCCOL nX2, SCROW nY2,\n                                    BOOL bMarkDrop = TRUE );\n\n    void            DrawRefMark( SCCOL nRefStartX, SCROW nRefStartY,\n                                    SCCOL nRefEndX, SCROW nRefEndY,\n                                    const Color& rColor, BOOL bHandle );\n\n    void            CreateAnchorHandle(SdrHdlList& rHdl, const ScAddress& rAddress);\n\n    void            HideCursor();\n    void            ShowCursor();\n    void            DrawCursor();\n    void            DrawAutoFillMark();\n    void            UpdateAutoFillMark(BOOL bMarked, const ScRange& rMarkRange);\n\n    void            UpdateListValPos( BOOL bVisible, const ScAddress& rPos );\n\n    BOOL            ShowNoteMarker( SCsCOL nPosX, SCsROW nPosY, BOOL bKeyboard );\n    void            HideNoteMarker();\n\n    MapMode         GetDrawMapMode( BOOL bForce = FALSE );\n\n    void            ContinueDrag();\n\n    void            StopMarking();\n    void            UpdateInputContext();\n\n    void            CheckInverted()     { if (nPaintCount) bNeedsRepaint = TRUE; }\n\n    void            DoInvertRect( const Rectangle& rPixel );\n\n    void            CheckNeedsRepaint();\n};\n\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\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\/\/ Test running a file in the same directory `cling CurrentDir.C`.\n\/\/ More info in CIFactory.cpp (\"<<< cling interactive line includer >>>\")\n\n\/\/ RUN: cp \"%s\" \"%T\/CurrentDir.C\" && cd %T && %cling -Xclang -verify CurrentDir.C 2>&1 | FileCheck %s\n\/\/ Test testCurrentDir\n\nextern \"C\" {\n  int printf(const char*, ...);\n  char* getcwd(char *buf, std::size_t size);\n}\n\nvoid CurrentDir() {\n  printf(\"Script ran\\n\"); \/\/ CHECK: Script ran\n}\n\/\/expected-no-diagnostics\n<commit_msg>Revert \"Simplify; make Windows compatible (cannot delete cwd).\"<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\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\/\/ Test runing a file in the same directory `cling CurrentDir.C`\n\/\/ More info in CIFactory.cpp createCIImpl (line ~850)\n\n\/\/ RUN: cd %S && %cling -Xclang -verify CurrentDir.C 2>&1 | FileCheck %s\n\/\/ RUN: mkdir %T\/Remove && cd %T\/Remove && rm -rf %T\/Remove && %cling -DTEST_CWDRETURN %s -Xclang -verify 2>&1 | FileCheck --check-prefix CHECK --check-prefix CHECKcwd %s\n\/\/ Test testCurrentDir\n\nextern \"C\" {\n  int printf(const char*, ...);\n  char* getcwd(char *buf, std::size_t size);\n}\n\n#ifdef TEST_CWDRETURN\n  \/\/ Make sure include still works\n  #include <string.h>\n  #include <vector>\n#endif\n\nvoid CurrentDir() {\n #ifdef TEST_CWDRETURN\n    char thisDir[1024];\n    const char *rslt = getcwd(thisDir, sizeof(thisDir));\n    \/\/ Make sure cling reported the error\n    \/\/ CHECKcwd: Could not get current working directory: {{.*}}\n\n    if (rslt)\n      printf(\"Working directory exists\\n\");\n    \/\/ CHECK-NOT: Working directory exists\n #endif\n\n  printf(\"Script ran\\n\");\n  \/\/ CHECK: Script ran\n}\n\n\/\/expected-no-diagnostics\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"GenCF1.h\"\n\n\nCGenCF1::CGenCF1()\n{\n\tt_cnt = 10000;\n\tt_allocated = 10;\n\tInit();\n}\n\n\nCGenCF1::~CGenCF1()\n{\n}\n\nvoid CGenCF1::Generate()\n{\n\tfor (int i = 0; i < t_cnt; i++) {\n\t\tif (i >= t_allocated) ResizeVectors(t_allocated * 2);\n\t\t\/\/TCHAR st[100];\n\t\t\/\/_stprintf_s(st, _T(\"%d\"), rand2());\n\t\t\/\/TRACE(st);\n\t\tif ((i > 0) && (len[i-1][0] > 1) && (coff[i-1][0] < len[i-1][0]-1)) {\n\t\t\tnote[i][0] = note[i - 1][0];\n\t\t\tlen[i][0] = len[i - 1][0];\n\t\t\tcoff[i][0] = coff[i - 1][0] + 1;\n\t\t\tpoff[i][0] = poff[i - 1][0] + 1;\n\t\t}\n\t\telse {\n\t\t\tnote[i][0] = 60 + 12 * rand2() \/ RAND_MAX;\n\t\t\tunsigned int test = RAND_MAX;\n\t\t\tlen[i][0] = 8 * rand2() \/ RAND_MAX;\n\t\t\tcoff[i][0] = 0;\n\t\t\tif (i > 0) poff[i][0] = coff[i - 1][0] + 1;\n\t\t\telse poff[i][0] = 0;\n\t\t}\n\t\t\/\/if (i < t_cnt-1) noff[i][0] = 1;\n\t\t\/\/else noff[i][0] = 0;\n\t\tatt[i][0] = 100;\n\t\ttempo[i][0] = 100;\n\t\tpause[i][0] = 0;\n\t\tt_generated = i+1;\n\t\tif (ng_min > note[i][0]) ng_min = note[i][0];\n\t\tif (ng_max < note[i][0]) ng_max = note[i][0];\n\t\t\/\/CString* st = new CString;\n\t\t\/\/st->Format(\"Note generated %d\", note[i][0]);\n\t\t\/\/::PostMessage(m_hWnd, WM_DEBUG_MSG, 0, (LPARAM)st);\n\t\tif (i % t_send == 0) t_sent = t_generated;\n\t\t\/\/Sleep(1);\n\t\tif (need_exit) return;\n\t}\n\tt_sent = t_generated;\n}\n<commit_msg>Added noff calculation<commit_after>#include \"stdafx.h\"\n#include \"GenCF1.h\"\n\n\nCGenCF1::CGenCF1()\n{\n\tt_cnt = 10000;\n\tt_allocated = 10;\n\tInit();\n}\n\n\nCGenCF1::~CGenCF1()\n{\n}\n\nvoid CGenCF1::Generate()\n{\n\tfor (int i = 0; i < t_cnt; i++) {\n\t\tif (i >= t_allocated) ResizeVectors(t_allocated * 2);\n\t\t\/\/TCHAR st[100];\n\t\t\/\/_stprintf_s(st, _T(\"%d\"), rand2());\n\t\t\/\/TRACE(st);\n\t\tif ((i > 0) && (len[i-1][0] > 1) && (coff[i-1][0] < len[i-1][0]-1)) {\n\t\t\tnote[i][0] = note[i - 1][0];\n\t\t\tlen[i][0] = len[i - 1][0];\n\t\t\tcoff[i][0] = coff[i - 1][0] + 1;\n\t\t\tpoff[i][0] = poff[i - 1][0] + 1;\n\t\t}\n\t\telse {\n\t\t\tnote[i][0] = 60 + 12 * rand2() \/ RAND_MAX;\n\t\t\tlen[i][0] = max(1, 8 * rand2() \/ RAND_MAX);\n\t\t\tcoff[i][0] = 0;\n\t\t\tif (i > 0) poff[i][0] = coff[i - 1][0] + 1;\n\t\t\telse poff[i][0] = 0;\n\t\t\tif (i > 0) {\n\t\t\t\tfor (int x = i - 1; x >= i-len[i-1][0]; x--) {\n\t\t\t\t\tnoff[x][0] = i - x;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\/\/if (i < t_cnt-1) noff[i][0] = 1;\n\t\t\/\/else noff[i][0] = 0;\n\t\tatt[i][0] = 100;\n\t\ttempo[i][0] = 100;\n\t\tpause[i][0] = 0;\n\t\tt_generated = i+1;\n\t\tif (ng_min > note[i][0]) ng_min = note[i][0];\n\t\tif (ng_max < note[i][0]) ng_max = note[i][0];\n\t\t\/\/CString* st = new CString;\n\t\t\/\/st->Format(\"Note generated %d\", note[i][0]);\n\t\t\/\/::PostMessage(m_hWnd, WM_DEBUG_MSG, 0, (LPARAM)st);\n\t\tif (i % t_send == 0) t_sent = t_generated;\n\t\t\/\/Sleep(1);\n\t\tif (need_exit) return;\n\t}\n\tt_sent = t_generated;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"itkImage.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n#include \"itkImageFileWriter.h\"\n\n#include \"itkMersenneTwisterRandomVariateGenerator.h\"\n\n#include \"..\/itkMatrixMath.h\"\n\ntemplate< int dimensionT >\nint Test( void )\n{\n  double epsilon = 0.000001;\n\n  itk::Statistics::MersenneTwisterRandomVariateGenerator::Pointer rndGen\n    = itk::Statistics::MersenneTwisterRandomVariateGenerator::New();\n  rndGen->Initialize( 1 );\n\n  int returnStatus = EXIT_SUCCESS;\n\n  for( unsigned int count=0; count<1000; count++ )\n    {\n    vnl_vector<float> v1(dimensionT);\n    for( unsigned int d=0; d<dimensionT; d++ )\n      {\n      v1[d] = rndGen->GetVariateWithOpenRange();\n      }\n    vnl_vector<float> v2(dimensionT);\n    if( dimensionT == 3 )\n      {\n      v2 = itk::GetOrthogonalVector( v1 );\n      if( dot_product( v1, v2 ) > epsilon )\n        {\n        std::cerr << count << \" : \";\n        std::cerr << \"FAILURE: GetOrthogonalVector: DotProduct = \"\n                  << v1 << \" .* \" << v2 << \" = \" \n                  << dot_product( v1, v2 ) << std::endl;\n        returnStatus = EXIT_FAILURE;\n        }\n    \n      vnl_vector<float> v3 = itk::GetCrossVector( v1, v2 );\n      if( dot_product( v1, v3 ) > epsilon ||\n          dot_product( v2, v3 ) > epsilon )\n        {\n        std::cerr << count << \" : \";\n        std::cerr << \"FAILURE: GetCrossVector: DotProduct = \"\n          << dot_product( v1, v3 ) << \" and \" \n          << dot_product( v2, v3 ) << std::endl;\n        returnStatus = EXIT_FAILURE;\n        }\n      }\n    else\n      {\n      for( unsigned int d=0; d<dimensionT; d++ )\n        {\n        v2[d] = rndGen->GetVariateWithOpenRange();\n        }\n      }\n  \n    v2 = v2.normalize();\n    vnl_vector<float> v4 = itk::ComputeLineStep( v1, 0.5, v2 );\n    if( vnl_math_abs( itk::ComputeEuclideanDistanceVector( v1, v4 ) - 0.5 )\n        > epsilon )\n      {\n      std::cerr << count << \" : \";\n      std::cerr << \"FAILURE: ComputeLineStep = \"\n        << v1 << \" + 0.5 * \" << v2 << \" != \" << v4 << std::endl;\n      std::cerr << \"FAILURE: ComputeEuclidenDistanceVector = \"\n        << itk::ComputeEuclideanDistanceVector( v1, v4 ) << std::endl;\n      returnStatus = EXIT_FAILURE;\n      }\n\n    vnl_matrix<float> m1(dimensionT, dimensionT);\n    for( unsigned int r=0; r<dimensionT; r++ )\n      {\n      for( unsigned int c=r; c<dimensionT; c++ )\n        {\n        m1(r,c) = rndGen->GetVariateWithOpenRange();\n        m1(r,c) = m1(c,r);\n        }\n      }\n\n    vnl_matrix<float> eVects(dimensionT, dimensionT);\n    vnl_vector<float> eVals(dimensionT);\n    itk::Eigen( m1, eVects, eVals, true );\n    for( unsigned int d=0; d<dimensionT; d++ )\n      {\n      v1 = m1 * eVects.get_column(d);\n      if( vnl_math_abs( v1.magnitude() - eVals[d] ) > epsilon )\n        {\n        std::cerr << count << \" : \";\n        std::cerr << \"FAILURE: Eigen : \"\n          << \" v1 * M1 = \" << v1 \n          << \" and v1 norm = \" << v1.magnitude()\n          << \" != \" << eVals[d] \n          << std::endl;\n        returnStatus = EXIT_FAILURE;\n        }\n      }\n    }\n  \n  return returnStatus;\n}\n\nint itkMatrixMathTest(int itkNotUsed(argc), char * itkNotUsed(argv)[])\n{\n\n  if( Test<2>() == EXIT_FAILURE || \n      Test<3>() == EXIT_FAILURE ||\n      Test<4>() == EXIT_FAILURE )\n    {\n    return EXIT_FAILURE;\n    }\n\n  return EXIT_SUCCESS;\n\n}\n\n<commit_msg>STYLE: Missing header text<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 \"itkImageRegionIteratorWithIndex.h\"\n#include \"itkImageFileWriter.h\"\n\n#include \"itkMersenneTwisterRandomVariateGenerator.h\"\n\n#include \"..\/itkMatrixMath.h\"\n\ntemplate< int dimensionT >\nint Test( void )\n{\n  double epsilon = 0.000001;\n\n  itk::Statistics::MersenneTwisterRandomVariateGenerator::Pointer rndGen\n    = itk::Statistics::MersenneTwisterRandomVariateGenerator::New();\n  rndGen->Initialize( 1 );\n\n  int returnStatus = EXIT_SUCCESS;\n\n  for( unsigned int count=0; count<1000; count++ )\n    {\n    vnl_vector<float> v1(dimensionT);\n    for( unsigned int d=0; d<dimensionT; d++ )\n      {\n      v1[d] = rndGen->GetVariateWithOpenRange();\n      }\n    vnl_vector<float> v2(dimensionT);\n    if( dimensionT == 3 )\n      {\n      v2 = itk::GetOrthogonalVector( v1 );\n      if( dot_product( v1, v2 ) > epsilon )\n        {\n        std::cerr << count << \" : \";\n        std::cerr << \"FAILURE: GetOrthogonalVector: DotProduct = \"\n                  << v1 << \" .* \" << v2 << \" = \" \n                  << dot_product( v1, v2 ) << std::endl;\n        returnStatus = EXIT_FAILURE;\n        }\n    \n      vnl_vector<float> v3 = itk::GetCrossVector( v1, v2 );\n      if( dot_product( v1, v3 ) > epsilon ||\n          dot_product( v2, v3 ) > epsilon )\n        {\n        std::cerr << count << \" : \";\n        std::cerr << \"FAILURE: GetCrossVector: DotProduct = \"\n          << dot_product( v1, v3 ) << \" and \" \n          << dot_product( v2, v3 ) << std::endl;\n        returnStatus = EXIT_FAILURE;\n        }\n      }\n    else\n      {\n      for( unsigned int d=0; d<dimensionT; d++ )\n        {\n        v2[d] = rndGen->GetVariateWithOpenRange();\n        }\n      }\n  \n    v2 = v2.normalize();\n    vnl_vector<float> v4 = itk::ComputeLineStep( v1, 0.5, v2 );\n    if( vnl_math_abs( itk::ComputeEuclideanDistanceVector( v1, v4 ) - 0.5 )\n        > epsilon )\n      {\n      std::cerr << count << \" : \";\n      std::cerr << \"FAILURE: ComputeLineStep = \"\n        << v1 << \" + 0.5 * \" << v2 << \" != \" << v4 << std::endl;\n      std::cerr << \"FAILURE: ComputeEuclidenDistanceVector = \"\n        << itk::ComputeEuclideanDistanceVector( v1, v4 ) << std::endl;\n      returnStatus = EXIT_FAILURE;\n      }\n\n    vnl_matrix<float> m1(dimensionT, dimensionT);\n    for( unsigned int r=0; r<dimensionT; r++ )\n      {\n      for( unsigned int c=r; c<dimensionT; c++ )\n        {\n        m1(r,c) = rndGen->GetVariateWithOpenRange();\n        m1(r,c) = m1(c,r);\n        }\n      }\n\n    vnl_matrix<float> eVects(dimensionT, dimensionT);\n    vnl_vector<float> eVals(dimensionT);\n    itk::Eigen( m1, eVects, eVals, true );\n    for( unsigned int d=0; d<dimensionT; d++ )\n      {\n      v1 = m1 * eVects.get_column(d);\n      if( vnl_math_abs( v1.magnitude() - eVals[d] ) > epsilon )\n        {\n        std::cerr << count << \" : \";\n        std::cerr << \"FAILURE: Eigen : \"\n          << \" v1 * M1 = \" << v1 \n          << \" and v1 norm = \" << v1.magnitude()\n          << \" != \" << eVals[d] \n          << std::endl;\n        returnStatus = EXIT_FAILURE;\n        }\n      }\n    }\n  \n  return returnStatus;\n}\n\nint itkMatrixMathTest(int itkNotUsed(argc), char * itkNotUsed(argv)[])\n{\n\n  if( Test<2>() == EXIT_FAILURE || \n      Test<3>() == EXIT_FAILURE ||\n      Test<4>() == EXIT_FAILURE )\n    {\n    return EXIT_FAILURE;\n    }\n\n  return EXIT_SUCCESS;\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* The goal of these tests is to verify the behavior of all blob commands given\n * the current state is verificationStarted.  This state is achieved as a out of\n * verificationPending.\n *\/\n#include \"firmware_handler.hpp\"\n#include \"firmware_unittest.hpp\"\n#include \"status.hpp\"\n#include \"util.hpp\"\n\n#include <cstdint>\n#include <string>\n#include <vector>\n\n#include <gtest\/gtest.h>\n\nnamespace ipmi_flash\n{\nnamespace\n{\n\nusing ::testing::Return;\n\n\/*\n * There are the following calls (parameters may vary):\n * canHandleBlob(blob)\n * getBlobIds\n * deleteBlob(blob)\n * stat(blob)\n * stat(session)\n * open(blob)\n * close(session)\n * writemeta(session)\n * write(session)\n * read(session)\n * commit(session)\n *\n * Testing canHandleBlob is uninteresting in this state.  Getting the BlobIDs\n * will inform what canHandleBlob will return.\n *\/\n\nclass FirmwareHandlerVerificationStartedTest : public IpmiOnlyFirmwareStaticTest\n{\n  protected:\n    void getToVerificationStarted(const std::string& blobId)\n    {\n        auto realHandler = dynamic_cast<FirmwareBlobHandler*>(handler.get());\n        EXPECT_CALL(imageMock, open(blobId)).WillOnce(Return(true));\n        EXPECT_TRUE(handler->open(session, flags, blobId));\n        EXPECT_EQ(FirmwareBlobHandler::UpdateState::uploadInProgress,\n                  realHandler->getCurrentState());\n        EXPECT_CALL(imageMock, close()).WillRepeatedly(Return());\n        handler->close(session);\n        EXPECT_EQ(FirmwareBlobHandler::UpdateState::verificationPending,\n                  realHandler->getCurrentState());\n\n        EXPECT_TRUE(handler->open(session, flags, verifyBlobId));\n        EXPECT_CALL(*verifyMockPtr, triggerVerification())\n            .WillOnce(Return(true));\n\n        EXPECT_TRUE(handler->commit(session, {}));\n        EXPECT_EQ(FirmwareBlobHandler::UpdateState::verificationStarted,\n                  realHandler->getCurrentState());\n    }\n\n    std::uint16_t session = 1;\n    std::uint16_t flags =\n        blobs::OpenFlags::write | FirmwareBlobHandler::UpdateFlags::ipmi;\n};\n\n\/*\n * stat(session)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       StatOnVerifyBlobIdAfterCommitChecksStateAndReturnsRunning)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n    EXPECT_CALL(*verifyMockPtr, checkVerificationState())\n        .WillOnce(Return(VerifyCheckResponses::running));\n\n    blobs::BlobMeta meta, expectedMeta = {};\n    expectedMeta.size = 0;\n    expectedMeta.blobState = flags | blobs::StateFlags::committing;\n    expectedMeta.metadata.push_back(\n        static_cast<std::uint8_t>(VerifyCheckResponses::running));\n\n    EXPECT_TRUE(handler->stat(session, &meta));\n    EXPECT_EQ(expectedMeta, meta);\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       StatOnVerifyBlobIdAfterCommitCheckStateAndReturnsFailed)\n{\n    \/* If the returned state from the verification handler is failed, it sets\n     * commit_error and transitions to verificationCompleted.\n     *\/\n    getToVerificationStarted(staticLayoutBlobId);\n    EXPECT_CALL(*verifyMockPtr, checkVerificationState())\n        .WillOnce(Return(VerifyCheckResponses::failed));\n\n    blobs::BlobMeta meta, expectedMeta = {};\n    expectedMeta.size = 0;\n    expectedMeta.blobState = flags | blobs::StateFlags::commit_error;\n    expectedMeta.metadata.push_back(\n        static_cast<std::uint8_t>(VerifyCheckResponses::failed));\n\n    auto realHandler = dynamic_cast<FirmwareBlobHandler*>(handler.get());\n    EXPECT_TRUE(handler->stat(session, &meta));\n    EXPECT_EQ(expectedMeta, meta);\n\n    EXPECT_EQ(FirmwareBlobHandler::UpdateState::verificationCompleted,\n              realHandler->getCurrentState());\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       StatOnVerifyBlobIdAfterCommitCheckStateAndReturnsSuccess)\n{\n    \/* If the returned state from the verification handler is success, it sets\n     * committed and transitions to verificationCompleted.\n     *\/\n    getToVerificationStarted(staticLayoutBlobId);\n    EXPECT_CALL(*verifyMockPtr, checkVerificationState())\n        .WillOnce(Return(VerifyCheckResponses::success));\n\n    blobs::BlobMeta meta, expectedMeta = {};\n    expectedMeta.size = 0;\n    expectedMeta.blobState = flags | blobs::StateFlags::committed;\n    expectedMeta.metadata.push_back(\n        static_cast<std::uint8_t>(VerifyCheckResponses::success));\n\n    auto realHandler = dynamic_cast<FirmwareBlobHandler*>(handler.get());\n    EXPECT_TRUE(handler->stat(session, &meta));\n    EXPECT_EQ(expectedMeta, meta);\n\n    EXPECT_EQ(FirmwareBlobHandler::UpdateState::verificationCompleted,\n              realHandler->getCurrentState());\n}\n\n\/* TODO: Once verificationCompleted is the state, canHandleBlob should accept\n * updateBlobId.\n *\/\n\n\/* TODO:\n * canHandleBlob(blob)\n *\n * getBlobIds\n *\n * deleteBlob(blob)\n *\/\n\n\/*\n * stat(blob)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest, StatOnActiveImageReturnsFailure)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n    ASSERT_TRUE(handler->canHandleBlob(activeImageBlobId));\n\n    blobs::BlobMeta meta;\n    EXPECT_FALSE(handler->stat(activeImageBlobId, &meta));\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest, StatOnActiveHashReturnsFailure)\n{\n    getToVerificationStarted(hashBlobId);\n    ASSERT_TRUE(handler->canHandleBlob(activeHashBlobId));\n\n    blobs::BlobMeta meta;\n    EXPECT_FALSE(handler->stat(activeHashBlobId, &meta));\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest, StatOnVerifyBlobReturnsFailure)\n{\n    \/* the verifyBlobId is available starting at verificationPending. *\/\n    getToVerificationStarted(staticLayoutBlobId);\n    ASSERT_TRUE(handler->canHandleBlob(verifyBlobId));\n\n    blobs::BlobMeta meta;\n    EXPECT_FALSE(handler->stat(verifyBlobId, &meta));\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest, StatOnNormalBlobsReturnsSuccess)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n\n    blobs::BlobMeta expected;\n    expected.blobState = FirmwareBlobHandler::UpdateFlags::ipmi;\n    expected.size = 0;\n\n    std::vector<std::string> testBlobs = {staticLayoutBlobId, hashBlobId};\n    for (const auto& blob : testBlobs)\n    {\n        ASSERT_TRUE(handler->canHandleBlob(blob));\n\n        blobs::BlobMeta meta = {};\n        EXPECT_TRUE(handler->stat(blob, &meta));\n        EXPECT_EQ(expected, meta);\n    }\n}\n\n\/*\n * writemeta(session)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       WriteMetaOnVerifySessionReturnsFailure)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n\n    std::vector<std::uint8_t> bytes = {0x01, 0x02};\n    EXPECT_FALSE(handler->writeMeta(session, 0, bytes));\n}\n\n\/*\n * write(session)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       WriteOnVerifySessionReturnsFailure)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n\n    std::vector<std::uint8_t> bytes = {0x01, 0x02};\n    EXPECT_FALSE(handler->write(session, 0, bytes));\n}\n\n\/*\n * open(blob) - there is nothing you can open, this state has an open file.\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       AttemptToOpenImageFileReturnsFailure)\n{\n    \/* Attempt to open a file one normally can open, however, as there is\n     * already a file open, this will fail.\n     *\/\n    getToVerificationStarted(staticLayoutBlobId);\n\n    EXPECT_FALSE(handler->open(session + 1, flags, staticLayoutBlobId));\n}\n\n\/*\n * close(session) - close while state if verificationStarted without calling\n * stat first will abort.\n *\n * read(session)\n *\n * commit(session)\n *\/\n\n} \/\/ namespace\n} \/\/ namespace ipmi_flash\n<commit_msg>test: firmware verificationStarted: read<commit_after>\/* The goal of these tests is to verify the behavior of all blob commands given\n * the current state is verificationStarted.  This state is achieved as a out of\n * verificationPending.\n *\/\n#include \"firmware_handler.hpp\"\n#include \"firmware_unittest.hpp\"\n#include \"status.hpp\"\n#include \"util.hpp\"\n\n#include <cstdint>\n#include <string>\n#include <vector>\n\n#include <gtest\/gtest.h>\n\nnamespace ipmi_flash\n{\nnamespace\n{\n\nusing ::testing::IsEmpty;\nusing ::testing::Return;\n\n\/*\n * There are the following calls (parameters may vary):\n * canHandleBlob(blob)\n * getBlobIds\n * deleteBlob(blob)\n * stat(blob)\n * stat(session)\n * open(blob)\n * close(session)\n * writemeta(session)\n * write(session)\n * read(session)\n * commit(session)\n *\n * Testing canHandleBlob is uninteresting in this state.  Getting the BlobIDs\n * will inform what canHandleBlob will return.\n *\/\n\nclass FirmwareHandlerVerificationStartedTest : public IpmiOnlyFirmwareStaticTest\n{\n  protected:\n    void getToVerificationStarted(const std::string& blobId)\n    {\n        auto realHandler = dynamic_cast<FirmwareBlobHandler*>(handler.get());\n        EXPECT_CALL(imageMock, open(blobId)).WillOnce(Return(true));\n        EXPECT_TRUE(handler->open(session, flags, blobId));\n        EXPECT_EQ(FirmwareBlobHandler::UpdateState::uploadInProgress,\n                  realHandler->getCurrentState());\n        EXPECT_CALL(imageMock, close()).WillRepeatedly(Return());\n        handler->close(session);\n        EXPECT_EQ(FirmwareBlobHandler::UpdateState::verificationPending,\n                  realHandler->getCurrentState());\n\n        EXPECT_TRUE(handler->open(session, flags, verifyBlobId));\n        EXPECT_CALL(*verifyMockPtr, triggerVerification())\n            .WillOnce(Return(true));\n\n        EXPECT_TRUE(handler->commit(session, {}));\n        EXPECT_EQ(FirmwareBlobHandler::UpdateState::verificationStarted,\n                  realHandler->getCurrentState());\n    }\n\n    std::uint16_t session = 1;\n    std::uint16_t flags =\n        blobs::OpenFlags::write | FirmwareBlobHandler::UpdateFlags::ipmi;\n};\n\n\/*\n * stat(session)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       StatOnVerifyBlobIdAfterCommitChecksStateAndReturnsRunning)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n    EXPECT_CALL(*verifyMockPtr, checkVerificationState())\n        .WillOnce(Return(VerifyCheckResponses::running));\n\n    blobs::BlobMeta meta, expectedMeta = {};\n    expectedMeta.size = 0;\n    expectedMeta.blobState = flags | blobs::StateFlags::committing;\n    expectedMeta.metadata.push_back(\n        static_cast<std::uint8_t>(VerifyCheckResponses::running));\n\n    EXPECT_TRUE(handler->stat(session, &meta));\n    EXPECT_EQ(expectedMeta, meta);\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       StatOnVerifyBlobIdAfterCommitCheckStateAndReturnsFailed)\n{\n    \/* If the returned state from the verification handler is failed, it sets\n     * commit_error and transitions to verificationCompleted.\n     *\/\n    getToVerificationStarted(staticLayoutBlobId);\n    EXPECT_CALL(*verifyMockPtr, checkVerificationState())\n        .WillOnce(Return(VerifyCheckResponses::failed));\n\n    blobs::BlobMeta meta, expectedMeta = {};\n    expectedMeta.size = 0;\n    expectedMeta.blobState = flags | blobs::StateFlags::commit_error;\n    expectedMeta.metadata.push_back(\n        static_cast<std::uint8_t>(VerifyCheckResponses::failed));\n\n    auto realHandler = dynamic_cast<FirmwareBlobHandler*>(handler.get());\n    EXPECT_TRUE(handler->stat(session, &meta));\n    EXPECT_EQ(expectedMeta, meta);\n\n    EXPECT_EQ(FirmwareBlobHandler::UpdateState::verificationCompleted,\n              realHandler->getCurrentState());\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       StatOnVerifyBlobIdAfterCommitCheckStateAndReturnsSuccess)\n{\n    \/* If the returned state from the verification handler is success, it sets\n     * committed and transitions to verificationCompleted.\n     *\/\n    getToVerificationStarted(staticLayoutBlobId);\n    EXPECT_CALL(*verifyMockPtr, checkVerificationState())\n        .WillOnce(Return(VerifyCheckResponses::success));\n\n    blobs::BlobMeta meta, expectedMeta = {};\n    expectedMeta.size = 0;\n    expectedMeta.blobState = flags | blobs::StateFlags::committed;\n    expectedMeta.metadata.push_back(\n        static_cast<std::uint8_t>(VerifyCheckResponses::success));\n\n    auto realHandler = dynamic_cast<FirmwareBlobHandler*>(handler.get());\n    EXPECT_TRUE(handler->stat(session, &meta));\n    EXPECT_EQ(expectedMeta, meta);\n\n    EXPECT_EQ(FirmwareBlobHandler::UpdateState::verificationCompleted,\n              realHandler->getCurrentState());\n}\n\n\/* TODO: Once verificationCompleted is the state, canHandleBlob should accept\n * updateBlobId.\n *\/\n\n\/* TODO:\n * canHandleBlob(blob)\n *\n * getBlobIds\n *\n * deleteBlob(blob)\n *\/\n\n\/*\n * stat(blob)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest, StatOnActiveImageReturnsFailure)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n    ASSERT_TRUE(handler->canHandleBlob(activeImageBlobId));\n\n    blobs::BlobMeta meta;\n    EXPECT_FALSE(handler->stat(activeImageBlobId, &meta));\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest, StatOnActiveHashReturnsFailure)\n{\n    getToVerificationStarted(hashBlobId);\n    ASSERT_TRUE(handler->canHandleBlob(activeHashBlobId));\n\n    blobs::BlobMeta meta;\n    EXPECT_FALSE(handler->stat(activeHashBlobId, &meta));\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest, StatOnVerifyBlobReturnsFailure)\n{\n    \/* the verifyBlobId is available starting at verificationPending. *\/\n    getToVerificationStarted(staticLayoutBlobId);\n    ASSERT_TRUE(handler->canHandleBlob(verifyBlobId));\n\n    blobs::BlobMeta meta;\n    EXPECT_FALSE(handler->stat(verifyBlobId, &meta));\n}\n\nTEST_F(FirmwareHandlerVerificationStartedTest, StatOnNormalBlobsReturnsSuccess)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n\n    blobs::BlobMeta expected;\n    expected.blobState = FirmwareBlobHandler::UpdateFlags::ipmi;\n    expected.size = 0;\n\n    std::vector<std::string> testBlobs = {staticLayoutBlobId, hashBlobId};\n    for (const auto& blob : testBlobs)\n    {\n        ASSERT_TRUE(handler->canHandleBlob(blob));\n\n        blobs::BlobMeta meta = {};\n        EXPECT_TRUE(handler->stat(blob, &meta));\n        EXPECT_EQ(expected, meta);\n    }\n}\n\n\/*\n * writemeta(session)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       WriteMetaOnVerifySessionReturnsFailure)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n\n    std::vector<std::uint8_t> bytes = {0x01, 0x02};\n    EXPECT_FALSE(handler->writeMeta(session, 0, bytes));\n}\n\n\/*\n * write(session)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       WriteOnVerifySessionReturnsFailure)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n\n    std::vector<std::uint8_t> bytes = {0x01, 0x02};\n    EXPECT_FALSE(handler->write(session, 0, bytes));\n}\n\n\/*\n * open(blob) - there is nothing you can open, this state has an open file.\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest,\n       AttemptToOpenImageFileReturnsFailure)\n{\n    \/* Attempt to open a file one normally can open, however, as there is\n     * already a file open, this will fail.\n     *\/\n    getToVerificationStarted(staticLayoutBlobId);\n\n    EXPECT_FALSE(handler->open(session + 1, flags, staticLayoutBlobId));\n}\n\n\/*\n * read(session)\n *\/\nTEST_F(FirmwareHandlerVerificationStartedTest, ReadOfVerifyBlobReturnsEmpty)\n{\n    getToVerificationStarted(staticLayoutBlobId);\n    EXPECT_THAT(handler->read(session, 0, 32), IsEmpty());\n}\n\n\/*\n * close(session) - close while state if verificationStarted without calling\n * stat first will abort.\n *\n * commit(session)\n *\/\n\n} \/\/ namespace\n} \/\/ namespace ipmi_flash\n<|endoftext|>"}
{"text":"<commit_before>#include <arrayfire.h>\n#include <stdio.h>\n#include <vector>\n#include <string>\n#include <af\/utils.h>\n#include <math.h>\n#include \"mnist_common.h\"\n\nusing namespace af;\n\n\/\/ Get accuracy of the predicted results\nfloat accuracy(const array& predicted, const array& target)\n{\n    return 100 * count(predicted == target) \/ target.elements();\n}\n\nvoid naive_bayes_train(array &mu, array &sig2, const array &train_feats, const array &train_classes, int num_classes)\n{\n    int feat_len = train_feats.dims(0);\n\n    \/\/ Get mean and variance from trianing data\n    mu  = constant(0, feat_len, num_classes);\n    sig2 = constant(0, feat_len, num_classes);\n    for (int ii = 0; ii < num_classes; ii++) {\n        array idx = where(train_classes == ii);\n        array train_feats_ii = train_feats(span, idx);\n\n        mu(span, ii)  = mean(train_feats_ii, 1);\n\n        \/\/ Some pixels are always 0. Add a small variance.\n        sig2(span,ii) = var(train_feats_ii, 0, 1) + 0.01;\n    }\n\n    mu.eval();\n    sig2.eval();\n}\n\narray naive_bayes_predict(const array &mu, const array &sig2, const array &test_feats, int num_classes)\n{\n    int num_test = test_feats.dims(1);\n\n    \/\/ Predict the probabilities for testing data\n    \/\/ Using log of probabilities to reduce rounding errors\n    array log_probs = constant(1, num_test, num_classes);\n    for (int ii = 0; ii < num_classes; ii++) {\n\n        \/\/ Tile the current mean and variance to the testing data size\n        array Mu  = tile(mu (span, ii), 1, num_test);\n        array Sig2 = tile(sig2(span, ii), 1, num_test);\n\n        array Df = test_feats - Mu;\n        array log_P =  (-(Df * Df) \/ (2 * Sig2))  - log(sqrt(2 * af::Pi * Sig2));\n\n        \/\/ Accumulate the probabilities\n        log_probs(span, ii) = sum(log_P).T();\n    }\n\n    \/\/ Get the location of the maximum value\n    array val, idx;\n    max(val, idx, log_probs, 1);\n    return idx.as(f32);\n}\n\nvoid benchmark_nb(const array &train_feats, const array test_feats,\n                  const array &train_labels, int num_classes)\n{\n    array mu, sig2;\n    int iter = 25;\n\n    timer::start();\n    for (int i = 0; i < iter; i++) {\n        naive_bayes_train(mu, sig2, train_feats, train_labels, num_classes);\n    }\n    af::sync();\n    printf(\"Training time: %4.4lf s\\n\", timer::stop() \/ iter);\n\n    timer::start();\n    for (int i = 0; i < iter; i++) {\n        naive_bayes_predict(mu, sig2, test_feats, num_classes);\n    }\n    af::sync();\n    printf(\"Prediction time: %4.4lf s\\n\", timer::stop() \/ iter);\n}\n\nvoid naive_bayes_demo(bool console, int perc)\n{\n    array train_images, train_labels;\n    array test_images, test_labels;\n    int num_train, num_test, num_classes;\n\n    \/\/ Load mnist data\n    float frac = (float)(perc) \/ 100.0;\n    setup_mnist<false>(&num_classes, &num_train, &num_test,\n                       train_images, test_images,\n                       train_labels, test_labels, frac);\n\n    int feature_length = train_images.elements() \/ num_train;\n    array train_feats = moddims(train_images, feature_length, num_train);\n    array test_feats  = moddims(test_images , feature_length, num_test );\n\n    \/\/ Preprocess\n    train_feats = train_feats + tile(min(train_feats, 1), 1, num_train);\n    test_feats  =  test_feats + tile(min(test_feats , 1), 1, num_test );\n\n    \/\/ Get training parameters\n    array mu, sig2;\n    naive_bayes_train(mu, sig2, train_feats, train_labels, num_classes);\n\n    \/\/ Predict the classes\n    array res_labels = naive_bayes_predict(mu, sig2, test_feats, num_classes);\n\n    \/\/ Results\n    printf(\"Trainng samples: %4d, Testing samples: %4d\\n\", num_train, num_test);\n    printf(\"Accuracy on testing  data: %2.2f\\n\",\n           accuracy(res_labels , test_labels));\n\n    benchmark_nb(train_feats, test_feats, train_labels, num_classes);\n\n    if (!console) {\n        display_results<false>(test_images, res_labels, 20);\n    }\n}\n\nint main(int argc, char** argv)\n{\n    int device   = argc > 1 ? atoi(argv[1]) : 0;\n    bool console = argc > 2 ? argv[2][0] == '-' : false;\n    int perc     = argc > 3 ? atoi(argv[3]) : 60;\n\n    try {\n\n        af::deviceset(device);\n        af::info();\n        naive_bayes_demo(console, perc);\n\n    } catch (af::exception &ae) {\n        std::cout << ae.what() << std::endl;\n    }\n\n}\n<commit_msg>Cleaning up naive bayes<commit_after>#include <arrayfire.h>\n#include <stdio.h>\n#include <vector>\n#include <string>\n#include <af\/utils.h>\n#include <math.h>\n#include \"mnist_common.h\"\n\nusing namespace af;\n\n\/\/ Get accuracy of the predicted results\nfloat accuracy(const array& predicted, const array& target)\n{\n    return 100 * count(predicted == target) \/ target.elements();\n}\n\nvoid naive_bayes_train(array &mu, array &sig2, const array &train_feats,\n                       const array &train_classes, int num_classes)\n{\n    int feat_len = train_feats.dims(0);\n\n    \/\/ Get mean and variance from trianing data\n    mu  = constant(0, feat_len, num_classes);\n    sig2 = constant(0, feat_len, num_classes);\n    for (int ii = 0; ii < num_classes; ii++) {\n        array idx = where(train_classes == ii);\n        array train_feats_ii = train_feats(span, idx);\n\n        mu(span, ii)  = mean(train_feats_ii, 1);\n\n        \/\/ Some pixels are always 0. Add a small variance.\n        sig2(span,ii) = var(train_feats_ii, 0, 1) + 0.01;\n    }\n\n    mu.eval();\n    sig2.eval();\n}\n\narray naive_bayes_predict(const array &mu, const array &sig2, const array &test_feats, int num_classes)\n{\n    int num_test = test_feats.dims(1);\n\n    \/\/ Predict the probabilities for testing data\n    \/\/ Using log of probabilities to reduce rounding errors\n    array log_probs = constant(1, num_test, num_classes);\n    for (int ii = 0; ii < num_classes; ii++) {\n\n        \/\/ Tile the current mean and variance to the testing data size\n        array Mu  = tile(mu (span, ii), 1, num_test);\n        array Sig2 = tile(sig2(span, ii), 1, num_test);\n\n        array Df = test_feats - Mu;\n        array log_P =  (-(Df * Df) \/ (2 * Sig2))  - log(sqrt(2 * af::Pi * Sig2));\n\n        \/\/ Accumulate the probabilities\n        log_probs(span, ii) = sum(log_P).T();\n    }\n\n    \/\/ Get the location of the maximum value\n    array val, idx;\n    max(val, idx, log_probs, 1);\n    return idx.as(f32);\n}\n\nvoid benchmark_nb(const array &train_feats, const array test_feats,\n                  const array &train_labels, int num_classes)\n{\n    array mu, sig2;\n    int iter = 25;\n\n    timer::start();\n    for (int i = 0; i < iter; i++) {\n        naive_bayes_train(mu, sig2, train_feats, train_labels, num_classes);\n    }\n    af::sync();\n    printf(\"Training time: %4.4lf s\\n\", timer::stop() \/ iter);\n\n    timer::start();\n    for (int i = 0; i < iter; i++) {\n        naive_bayes_predict(mu, sig2, test_feats, num_classes);\n    }\n    af::sync();\n    printf(\"Prediction time: %4.4lf s\\n\", timer::stop() \/ iter);\n}\n\nvoid naive_bayes_demo(bool console, int perc)\n{\n    array train_images, train_labels;\n    array test_images, test_labels;\n    int num_train, num_test, num_classes;\n\n    \/\/ Load mnist data\n    float frac = (float)(perc) \/ 100.0;\n    setup_mnist<false>(&num_classes, &num_train, &num_test,\n                       train_images, test_images,\n                       train_labels, test_labels, frac);\n\n    int feature_length = train_images.elements() \/ num_train;\n    array train_feats = moddims(train_images, feature_length, num_train);\n    array test_feats  = moddims(test_images , feature_length, num_test );\n\n    \/\/ Preprocess\n    train_feats = train_feats;\n    test_feats  =  test_feats;\n\n    \/\/ Get training parameters\n    array mu, sig2;\n    naive_bayes_train(mu, sig2, train_feats, train_labels, num_classes);\n\n    \/\/ Predict the classes\n    array res_labels = naive_bayes_predict(mu, sig2, test_feats, num_classes);\n\n    \/\/ Results\n    printf(\"Trainng samples: %4d, Testing samples: %4d\\n\", num_train, num_test);\n    printf(\"Accuracy on testing  data: %2.2f\\n\",\n           accuracy(res_labels , test_labels));\n\n    benchmark_nb(train_feats, test_feats, train_labels, num_classes);\n\n    if (!console) {\n        display_results<false>(test_images, res_labels, 20);\n    }\n}\n\nint main(int argc, char** argv)\n{\n    int device   = argc > 1 ? atoi(argv[1]) : 0;\n    bool console = argc > 2 ? argv[2][0] == '-' : false;\n    int perc     = argc > 3 ? atoi(argv[3]) : 60;\n\n    try {\n\n        af::deviceset(device);\n        af::info();\n        naive_bayes_demo(console, perc);\n\n    } catch (af::exception &ae) {\n        std::cout << ae.what() << std::endl;\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <cstdlib>\t\t\/\/for exit()\n\nint main(int argc, char *argv[])\n{\n\tusing namespace std;\n\tif(argc==1)\t\t\t\/\/quit if no argument\n\t{\n\t\tcerr<<\"Usage: \"<<argv[0]<<\" filename[s]\\n\";\n\t\texit(EXIT_FAILUERE);\n\t}\n\tifstream fin;\t\t\/\/open stream\n\tlong count;\n\tlong total = 0;\n\tint in;\n\n\n\tfor(int file=1;file<argc;file++)\n\t{\n\t\tfin.open(argv[file]);\n\t\tcount = 0;\n\t\twhile(fin>>in)\n\t\t{\n\t\t\tcout<<in<<endl;\n\t\t}\n\t\tcout<<count<<\" int in \"<<argv[file]<<endl;\n\t\ttotal += in;\n\t\tfin.clear();\n\t\tfin.close();\n\t}\n\tcout<<\"All int's value in all files is \"\n\t<<total<<endl;\n\n\treturn 0;\n}<commit_msg>修改了，ex1_16.cpp<commit_after>#include <iostream>\n#include <fstream>\n#include <cstdlib>\t\t\/\/for exit()\n\nint main(int argc, char *argv[])\n{\n\tusing namespace std;\n\tif(argc==1)\t\t\t\/\/quit if no argument\n\t{\n\t\tcerr<<\"Usage: \"<<argv[0]<<\" filename[s]\\n\";\n\t\texit(EXIT_FAILURE);\n\t}\n\tifstream fin;\t\t\/\/open stream\n\tlong count;\n\tlong total = 0;\n\tint in;\n\n\n\tfor(int file=1;file<argc;file++)\n\t{\n\t\tfin.open(argv[file]);\n\t\tcount = 0;\n\t\twhile(fin>>in)\n\t\t{\n\t\t\tcout<<in<<endl;\n\t\t}\n\t\tcout<<count<<\" int in \"<<argv[file]<<endl;\n\t\ttotal += in;\n\t\tfin.clear();\n\t\tfin.close();\n\t}\n\tcout<<\"All int's value in all files is \"\n\t<<total<<endl;\n\n\treturn 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2009 Digital Bazaar, Inc.  All rights reserved.\n *\/\n#include \"db\/fiber\/FiberScheduler2.h\"\n\n#include <algorithm>\n#include <setjmp.h>\n\nusing namespace std;\nusing namespace db::fiber;\nusing namespace db::modest;\nusing namespace db::rt;\n\n#define DEFAULT_STACK_SIZE 0x1000 \/\/ 32k\n\nFiberScheduler2::FiberScheduler2()\n{\n   \/\/ add first FiberId\n   mFiberIdFreeList.push_back(1);\n}\n\nFiberScheduler2::~FiberScheduler2()\n{\n   \/\/ ensure stopped\n   FiberScheduler2::stop();\n   \n   \/\/ delete all fibers\n   for(FiberMap::iterator i = mFiberMap.begin(); i != mFiberMap.end(); i++)\n   {\n      i->second->setState(Fiber2::Dead);\n      delete i->second;\n   }\n   mFiberMap.clear();\n}\n\nvoid FiberScheduler2::start(\n   OperationRunner* opRunner, int numOps, size_t fiberStackSize)\n{\n   \/\/ save stack size\n   mFiberStackSize =\n      (fiberStackSize == 0 ? DEFAULT_STACK_SIZE : fiberStackSize);\n   \n   \/\/ create \"numOps\" Operations\n   for(int i = 0; i < numOps; i++)\n   {\n      \/\/ create Operation\n      Operation op(*this);\n      mOpList.add(op);\n   }\n   \n   \/\/ queue Operations\n   mOpList.queue(opRunner);\n}\n\ninline void FiberScheduler2::stop()\n{\n   \/\/ terminate all operations\n   mOpList.terminate();\n   \n   \/\/ delete all thread contexts\n   for(ContextList::iterator i = mContextList.begin();\n       i != mContextList.end(); i++)\n   {\n      delete *i;\n   }\n   mContextList.clear();\n}\n\nbool FiberScheduler2::waitForLastFiberExit(bool stop)\n{\n   bool rval = true;\n   \n   mNoFibersWaitLock.lock();\n   {\n      \/\/ wait on the no fibers lock until there are no more fibers\n      while(rval && !mFiberMap.empty())\n      {\n         rval = mNoFibersWaitLock.wait();\n      }\n   }\n   mNoFibersWaitLock.unlock();\n   \n   if(rval && stop)\n   {\n      \/\/ stop fiber scheduler\n      this->stop();\n   }\n   \n   return rval;\n}\n\nFiberId2 FiberScheduler2::addFiber(Fiber2* fiber)\n{\n   FiberId2 id;\n   \n   \/\/ lock scheduler to add fiber\n   mScheduleLock.lock();\n   {\n      \/\/ get available FiberId\n      id = mFiberIdFreeList.front();\n      mFiberIdFreeList.pop_front();\n      \n      \/\/ add new id if list is empty\n      if(mFiberIdFreeList.empty())\n      {\n         mFiberIdFreeList.push_back(id + 1);\n      }\n      \n      \/\/ assign id and scheduler to fiber\n      fiber->setScheduler(id, this);\n      \n      \/\/ add fiber to map and queue\n      mFiberMap.insert(make_pair(id, fiber));\n      mFiberQueue.push_back(fiber);\n      \n      \/\/ notify that a fiber is available for scheduling\n      fiberAvailable();\n   }\n   mScheduleLock.unlock();\n   \n   return id;\n}\n\nvoid FiberScheduler2::run()\n{\n   \/\/ get and store scheduler context for this thread\n   FiberContext* scheduler = new FiberContext();\n   mScheduleLock.lock();\n   {\n      mContextList.push_back(scheduler);\n   }\n   mScheduleLock.unlock();\n   \n   \/\/ continue scheduling fibers while this thread is not interrupted\n   Thread* t = Thread::currentThread();\n   while(!t->isInterrupted())\n   {\n      \/\/ synchronously get the next fiber to schedule\n      Fiber2* fiber = nextFiber();\n      \n      \/\/ if there is no fiber to schedule\n      if(fiber == NULL)\n      {\n         \/\/ wait until one is available\n         waitForFiber();\n      }\n      \/\/ else a fiber has been found\n      else\n      {\n         if(fiber->getState() == Fiber2::New)\n         {\n            \/\/ initialize the fiber's context\n            if(fiber->getContext()->init(fiber, mFiberStackSize))\n            {\n               \/\/ set fiber state to running\n               fiber->setState(Fiber2::Running);\n            }\n            else\n            {\n               \/\/ failed to init fiber, not enough memory, lock to re-queue it\n               mScheduleLock.lock();\n               {\n                  mFiberQueue.push_back(fiber);\n               }\n               mScheduleLock.unlock();\n            }\n         }\n         \n         if(fiber->getState() == Fiber2::Running)\n         {\n            \/\/ swap in the fiber's context\n            scheduler->swap(fiber->getContext());\n            \n            if(fiber->getState() != Fiber2::Sleeping)\n            {\n               \/\/ lock scheduling while adding fiber back to queue\n               mScheduleLock.lock();\n               {\n                  mFiberQueue.push_back(fiber);\n               }\n               mScheduleLock.unlock();\n               \n               \/\/ notify that a fiber is available\n               fiberAvailable();\n            }\n         }\n      }\n   }\n}\n\nvoid FiberScheduler2::yield(Fiber2* fiber)\n{\n   \/\/ swap scheduler back in\n   fiber->getContext()->swapBack();\n}\n\nvoid FiberScheduler2::sleep(Fiber2* fiber)\n{\n   fiber->setState(Fiber2::Sleeping);\n   \n   \/\/ lock scheduling to insert sleeping fiber entry\n   mScheduleLock.lock();\n   {\n      mSleepingFibers.insert(make_pair(fiber->getId(), fiber));      \n   }\n   mScheduleLock.unlock();\n   \n   \/\/ swap scheduler back in\n   fiber->getContext()->swapBack();\n}\n\nvoid FiberScheduler2::wakeup(FiberId2 id)\n{\n   \/\/ lock scheduling while waking up sleeping fiber\n   mScheduleLock.lock();\n   {\n      \/\/ find the sleeping fiber\n      FiberMap::iterator i = mSleepingFibers.find(id);\n      if(i != mSleepingFibers.end())\n      {\n         \/\/ update fiber state, add to queue, remove from sleeping fibers map\n         i->second->setState(Fiber2::Running);\n         mFiberQueue.push_back(i->second);\n         mSleepingFibers.erase(i);\n         \n         \/\/ notify that a fiber is available\n         fiberAvailable();\n      }\n   }\n   mScheduleLock.unlock();\n}\n\nvoid FiberScheduler2::exit(Fiber2* fiber)\n{\n   fiber->setState(Fiber2::Exited);\n   \n   \/\/ load scheduler back in\n   fiber->getContext()->loadBack();\n}\n\nFiber2* FiberScheduler2::nextFiber()\n{\n   Fiber2* rval = NULL;\n   \n   \/\/ lock scheduling while iterating over and modifying fiber queue\n   mScheduleLock.lock();\n   {\n      \/\/ look for a fiber that can be scheduled:\n      \n      \/\/ cycle through fibers not more than once\n      FiberId2 cycleEnd = 0;\n      for(FiberQueue::iterator i = mFiberQueue.begin();\n          rval == NULL && i != mFiberQueue.end() && (*i)->getId() != cycleEnd;)\n      {\n         \/\/ pop fiber off queue\n         Fiber2* fiber = *i;\n         i = mFiberQueue.erase(i);\n         \n         \/\/ check state of fiber\n         switch(fiber->getState())\n         {\n            \/\/ if fiber is new or running, it can be scheduled\n            case Fiber2::New:\n            case Fiber2::Running:\n               rval = fiber;\n               break;\n               \/\/ exited or dead fibers must be deleted\n            case Fiber2::Exited:\n               fiber->setState(Fiber2::Dead);\n            case Fiber2::Dead:\n               \/\/ add fiber ID to free list, remove fiber from scheduler\n               mFiberIdFreeList.push_front(fiber->getId());\n               mFiberMap.erase(fiber->getId());\n               delete fiber;\n               fiber = NULL;\n               break;\n               \/\/ sleeping fibers cannot be scheduled\n            case Fiber2::Sleeping:\n               break;\n         }\n         \n         \/\/ if current fiber cannot be scheduled\n         if(rval == NULL && fiber != NULL)\n         {\n            \/\/ push fiber onto end of queue\n            mFiberQueue.push_back(fiber);\n            \n            \/\/ ensure current fiber is not checked again\n            if(cycleEnd == 0)\n            {\n               cycleEnd = fiber->getId();\n            }\n         }\n      }\n      \n      if(mFiberMap.empty())\n      {\n         \/\/ notify that no fibers are available\n         noFibersAvailable();\n      }\n   }\n   mScheduleLock.unlock();\n   \n   return rval;\n}\n\ninline void FiberScheduler2::fiberAvailable()\n{\n   mFiberWaitLock.lock();\n   mFiberWaitLock.notifyAll();\n   mFiberWaitLock.unlock();\n}\n\ninline void FiberScheduler2::waitForFiber()\n{\n   mFiberWaitLock.lock();\n   mFiberWaitLock.wait();\n   mFiberWaitLock.unlock();\n}\n\ninline void FiberScheduler2::noFibersAvailable()\n{\n   mNoFibersWaitLock.lock();\n   mNoFibersWaitLock.notifyAll();\n   mNoFibersWaitLock.unlock();\n}\n<commit_msg>Added optimizations to handle low memory for fiber stacks.<commit_after>\/*\n * Copyright (c) 2009 Digital Bazaar, Inc.  All rights reserved.\n *\/\n#include \"db\/fiber\/FiberScheduler2.h\"\n\n#include <algorithm>\n#include <setjmp.h>\n\nusing namespace std;\nusing namespace db::fiber;\nusing namespace db::modest;\nusing namespace db::rt;\n\n#define DEFAULT_STACK_SIZE 0x1000 \/\/ 32k\n\nFiberScheduler2::FiberScheduler2()\n{\n   \/\/ add first FiberId\n   mFiberIdFreeList.push_back(1);\n}\n\nFiberScheduler2::~FiberScheduler2()\n{\n   \/\/ ensure stopped\n   FiberScheduler2::stop();\n   \n   \/\/ delete all fibers\n   for(FiberMap::iterator i = mFiberMap.begin(); i != mFiberMap.end(); i++)\n   {\n      i->second->setState(Fiber2::Dead);\n      delete i->second;\n   }\n   mFiberMap.clear();\n}\n\nvoid FiberScheduler2::start(\n   OperationRunner* opRunner, int numOps, size_t fiberStackSize)\n{\n   \/\/ save stack size\n   mFiberStackSize =\n      (fiberStackSize == 0 ? DEFAULT_STACK_SIZE : fiberStackSize);\n   \n   \/\/ create \"numOps\" Operations\n   for(int i = 0; i < numOps; i++)\n   {\n      \/\/ create Operation\n      Operation op(*this);\n      mOpList.add(op);\n   }\n   \n   \/\/ queue Operations\n   mOpList.queue(opRunner);\n}\n\ninline void FiberScheduler2::stop()\n{\n   \/\/ terminate all operations\n   mOpList.terminate();\n   \n   \/\/ delete all thread contexts\n   for(ContextList::iterator i = mContextList.begin();\n       i != mContextList.end(); i++)\n   {\n      delete *i;\n   }\n   mContextList.clear();\n}\n\nbool FiberScheduler2::waitForLastFiberExit(bool stop)\n{\n   bool rval = true;\n   \n   mNoFibersWaitLock.lock();\n   {\n      \/\/ wait on the no fibers lock until there are no more fibers\n      while(rval && !mFiberMap.empty())\n      {\n         rval = mNoFibersWaitLock.wait();\n      }\n   }\n   mNoFibersWaitLock.unlock();\n   \n   if(rval && stop)\n   {\n      \/\/ stop fiber scheduler\n      this->stop();\n   }\n   \n   return rval;\n}\n\nFiberId2 FiberScheduler2::addFiber(Fiber2* fiber)\n{\n   FiberId2 id;\n   \n   \/\/ lock scheduler to add fiber\n   mScheduleLock.lock();\n   {\n      \/\/ get available FiberId\n      id = mFiberIdFreeList.front();\n      mFiberIdFreeList.pop_front();\n      \n      \/\/ add new id if list is empty\n      if(mFiberIdFreeList.empty())\n      {\n         mFiberIdFreeList.push_back(id + 1);\n      }\n      \n      \/\/ assign id and scheduler to fiber\n      fiber->setScheduler(id, this);\n      \n      \/\/ add fiber to map and queue\n      mFiberMap.insert(make_pair(id, fiber));\n      mFiberQueue.push_back(fiber);\n      \n      \/\/ notify that a fiber is available for scheduling\n      fiberAvailable();\n   }\n   mScheduleLock.unlock();\n   \n   return id;\n}\n\nvoid FiberScheduler2::run()\n{\n   \/\/ get and store scheduler context for this thread\n   FiberContext* scheduler = new FiberContext();\n   mScheduleLock.lock();\n   {\n      mContextList.push_back(scheduler);\n   }\n   mScheduleLock.unlock();\n   \n   \/\/ continue scheduling fibers while this thread is not interrupted\n   bool tryInit = true;\n   Thread* t = Thread::currentThread();\n   while(!t->isInterrupted())\n   {\n      \/\/ synchronously get the next fiber to schedule\n      Fiber2* fiber = nextFiber();\n      \n      \/\/ if there is no fiber to schedule\n      if(fiber == NULL)\n      {\n         \/\/ wait until one is available\n         waitForFiber();\n      }\n      \/\/ else a fiber has been found\n      else\n      {\n         if(fiber->getState() == Fiber2::New)\n         {\n            \/\/ initialize the fiber's context\n            if(tryInit && fiber->getContext()->init(fiber, mFiberStackSize))\n            {\n               \/\/ set fiber state to running\n               fiber->setState(Fiber2::Running);\n            }\n            else\n            {\n               \/\/ do not try init again until a fiber's stack is reclaimed\n               tryInit = false;\n            }\n         }\n         \n         if(fiber->getState() != Fiber2::Running)\n         {\n            \/\/ failed to init fiber, not enough memory, lock to re-queue it\n            mScheduleLock.lock();\n            {\n               mFiberQueue.push_back(fiber);\n            }\n            mScheduleLock.unlock();\n         }\n         else\n         {\n            \/\/ swap in the fiber's context\n            scheduler->swap(fiber->getContext());\n            \n            if(fiber->getState() != Fiber2::Sleeping)\n            {\n               \/\/ lock scheduling while adding fiber back to queue\n               mScheduleLock.lock();\n               {\n                  \/\/ if fiber is running, put it in the back of the queue\n                  if(fiber->getState() == Fiber2::Running)\n                  {\n                     mFiberQueue.push_back(fiber);\n                  }\n                  \/\/ fiber is dying, so put it in front for quicker cleanup\n                  else\n                  {\n                     mFiberQueue.push_front(fiber);\n                     \n                     \/\/ because fiber's stack memory will be reclaimed, it\n                     \/\/ is safe to try init on new fibers again\n                     tryInit = true;\n                  }\n               }\n               mScheduleLock.unlock();\n               \n               \/\/ notify that a fiber is available\n               fiberAvailable();\n            }\n         }\n      }\n   }\n}\n\nvoid FiberScheduler2::yield(Fiber2* fiber)\n{\n   \/\/ swap scheduler back in\n   fiber->getContext()->swapBack();\n}\n\nvoid FiberScheduler2::sleep(Fiber2* fiber)\n{\n   fiber->setState(Fiber2::Sleeping);\n   \n   \/\/ lock scheduling to insert sleeping fiber entry\n   mScheduleLock.lock();\n   {\n      mSleepingFibers.insert(make_pair(fiber->getId(), fiber));      \n   }\n   mScheduleLock.unlock();\n   \n   \/\/ swap scheduler back in\n   fiber->getContext()->swapBack();\n}\n\nvoid FiberScheduler2::wakeup(FiberId2 id)\n{\n   \/\/ lock scheduling while waking up sleeping fiber\n   mScheduleLock.lock();\n   {\n      \/\/ find the sleeping fiber\n      FiberMap::iterator i = mSleepingFibers.find(id);\n      if(i != mSleepingFibers.end())\n      {\n         \/\/ update fiber state, add to queue, remove from sleeping fibers map\n         i->second->setState(Fiber2::Running);\n         mFiberQueue.push_back(i->second);\n         mSleepingFibers.erase(i);\n         \n         \/\/ notify that a fiber is available\n         fiberAvailable();\n      }\n   }\n   mScheduleLock.unlock();\n}\n\nvoid FiberScheduler2::exit(Fiber2* fiber)\n{\n   fiber->setState(Fiber2::Exited);\n   \n   \/\/ load scheduler back in\n   fiber->getContext()->loadBack();\n}\n\nFiber2* FiberScheduler2::nextFiber()\n{\n   Fiber2* rval = NULL;\n   \n   \/\/ lock scheduling while iterating over and modifying fiber queue\n   mScheduleLock.lock();\n   {\n      \/\/ look for a fiber that can be scheduled:\n      \n      \/\/ cycle through fibers not more than once\n      FiberId2 cycleEnd = 0;\n      for(FiberQueue::iterator i = mFiberQueue.begin();\n          rval == NULL && i != mFiberQueue.end() && (*i)->getId() != cycleEnd;)\n      {\n         \/\/ pop fiber off queue\n         Fiber2* fiber = *i;\n         i = mFiberQueue.erase(i);\n         \n         \/\/ check state of fiber\n         switch(fiber->getState())\n         {\n            \/\/ if fiber is new or running, it can be scheduled\n            case Fiber2::New:\n            case Fiber2::Running:\n               rval = fiber;\n               break;\n               \/\/ exited or dead fibers must be deleted\n            case Fiber2::Exited:\n               fiber->setState(Fiber2::Dead);\n            case Fiber2::Dead:\n               \/\/ add fiber ID to free list, remove fiber from scheduler\n               mFiberIdFreeList.push_front(fiber->getId());\n               mFiberMap.erase(fiber->getId());\n               delete fiber;\n               fiber = NULL;\n               break;\n               \/\/ sleeping fibers cannot be scheduled\n            case Fiber2::Sleeping:\n               break;\n         }\n         \n         \/\/ if current fiber cannot be scheduled\n         if(rval == NULL && fiber != NULL)\n         {\n            \/\/ push fiber onto end of queue\n            mFiberQueue.push_back(fiber);\n            \n            \/\/ ensure current fiber is not checked again\n            if(cycleEnd == 0)\n            {\n               cycleEnd = fiber->getId();\n            }\n         }\n      }\n      \n      if(mFiberMap.empty())\n      {\n         \/\/ notify that no fibers are available\n         noFibersAvailable();\n      }\n   }\n   mScheduleLock.unlock();\n   \n   return rval;\n}\n\ninline void FiberScheduler2::fiberAvailable()\n{\n   mFiberWaitLock.lock();\n   mFiberWaitLock.notifyAll();\n   mFiberWaitLock.unlock();\n}\n\ninline void FiberScheduler2::waitForFiber()\n{\n   mFiberWaitLock.lock();\n   mFiberWaitLock.wait();\n   mFiberWaitLock.unlock();\n}\n\ninline void FiberScheduler2::noFibersAvailable()\n{\n   mNoFibersWaitLock.lock();\n   mNoFibersWaitLock.notifyAll();\n   mNoFibersWaitLock.unlock();\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>cppcheck reduce scope of var in toolkit\/...controlmodelcontainerbase.cxx<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 Benjamin Glatzel\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ Precompiled header file\n#include \"stdafx.h\"\n#include \"stdafx_editor.h\"\n\n\/\/ Ui\n#include \"ui_IntrinsicEdPropertyEditorRotation.h\"\n\nIntrinsicEdPropertyEditorRotation::IntrinsicEdPropertyEditorRotation(\n    rapidjson::Document* p_Document, rapidjson::Value* p_CurrentProperties,\n    rapidjson::Value* p_CurrentProperty, const char* p_PropertyName,\n    QWidget* parent)\n    : IntrinsicEdPropertyEditorBase(p_Document, p_CurrentProperties,\n                                    p_CurrentProperty, p_PropertyName, parent)\n{\n  _ui.setupUi(this);\n  updateFromProperty();\n\n  QObject::connect(_ui.yaw, SIGNAL(valueChanged(double)), this,\n                   SLOT(onValueChanged()));\n  QObject::connect(_ui.pitch, SIGNAL(valueChanged(double)), this,\n                   SLOT(onValueChanged()));\n  QObject::connect(_ui.roll, SIGNAL(valueChanged(double)), this,\n                   SLOT(onValueChanged()));\n  QObject::connect(_ui.sYaw, SIGNAL(valueChanged(int)), this,\n                   SLOT(onSliderValueChanged()));\n  QObject::connect(_ui.sPitch, SIGNAL(valueChanged(int)), this,\n                   SLOT(onSliderValueChanged()));\n  QObject::connect(_ui.sRoll, SIGNAL(valueChanged(int)), this,\n                   SLOT(onSliderValueChanged()));\n}\n\nIntrinsicEdPropertyEditorRotation::~IntrinsicEdPropertyEditorRotation() {}\n\nvoid IntrinsicEdPropertyEditorRotation::updateFromProperty()\n{\n  _INTR_ASSERT(_property);\n  const rapidjson::Value& prop = *_property;\n\n  if (prop[\"readOnly\"].GetBool())\n  {\n    _ui.yaw->setReadOnly(true);\n    _ui.pitch->setReadOnly(true);\n    _ui.roll->setReadOnly(true);\n    _ui.sYaw->setDisabled(true);\n    _ui.sPitch->setDisabled(true);\n    _ui.sRoll->setDisabled(true);\n  }\n\n  glm::vec3 euler;\n\n  if (strcmp(prop[\"type\"].GetString(), \"quat\") == 0u)\n  {\n    const glm::quat quat =\n        glm::quat(prop[\"values\"][3].GetFloat(), prop[\"values\"][0].GetFloat(),\n                  prop[\"values\"][1].GetFloat(), prop[\"values\"][2].GetFloat());\n    euler = glm::eulerAngles(quat);\n  }\n  else if (strcmp(prop[\"type\"].GetString(), \"vec3\") == 0u)\n  {\n    euler =\n        glm::vec3(glm::radians(glm::mod(prop[\"values\"][0].GetFloat(), 360.0f)),\n                  glm::radians(glm::mod(prop[\"values\"][1].GetFloat(), 360.0f)),\n                  glm::radians(glm::mod(prop[\"values\"][2].GetFloat(), 360.0f)));\n  }\n\n  bool changed = _ui.yaw->value() != glm::degrees(euler.x) ||\n                 _ui.pitch->value() != glm::degrees(euler.y) ||\n                 _ui.roll->value() != glm::degrees(euler.z);\n\n  if (changed)\n  {\n    _ui.yaw->blockSignals(true);\n    _ui.pitch->blockSignals(true);\n    _ui.roll->blockSignals(true);\n    _ui.yaw->setValue(glm::degrees(euler.x));\n    _ui.pitch->setValue(glm::degrees(euler.y));\n    _ui.roll->setValue(glm::degrees(euler.z));\n    _ui.sYaw->setValue(glm::degrees(euler.x));\n    _ui.sPitch->setValue(glm::degrees(euler.y));\n    _ui.sRoll->setValue(glm::degrees(euler.z));\n    _ui.yaw->blockSignals(false);\n    _ui.pitch->blockSignals(false);\n    _ui.roll->blockSignals(false);\n  }\n\n  _ui.propertyTitle->setText(_propertyName.c_str());\n}\n\nvoid IntrinsicEdPropertyEditorRotation::onValueChanged()\n{\n  _INTR_ASSERT(_property);\n  rapidjson::Value& prop = *_property;\n\n  _ui.sYaw->setValue(_ui.yaw->value());\n  _ui.sPitch->setValue(_ui.pitch->value());\n  _ui.sRoll->setValue(_ui.roll->value());\n\n  const glm::vec3 euler = glm::vec3(glm::radians(_ui.yaw->value()),\n                                    glm::radians(_ui.pitch->value()),\n                                    glm::radians(_ui.roll->value()));\n\n  bool changed = false;\n  if (strcmp(prop[\"type\"].GetString(), \"quat\") == 0u)\n  {\n    const glm::quat quat = glm::quat(euler);\n\n    changed = prop[\"values\"][0].GetFloat() != quat.x ||\n              prop[\"values\"][1].GetFloat() != quat.y ||\n              prop[\"values\"][2].GetFloat() != quat.z ||\n              prop[\"values\"][3].GetFloat() != quat.w;\n\n    if (changed)\n    {\n      prop[\"values\"][0].SetFloat(quat.x);\n      prop[\"values\"][1].SetFloat(quat.y);\n      prop[\"values\"][2].SetFloat(quat.z);\n      prop[\"values\"][3].SetFloat(quat.w);\n    }\n  }\n  else if (strcmp(prop[\"type\"].GetString(), \"vec3\") == 0u)\n  {\n    changed = prop[\"values\"][0].GetFloat() != glm::degrees(euler.x) ||\n              prop[\"values\"][1].GetFloat() != glm::degrees(euler.y) ||\n              prop[\"values\"][2].GetFloat() != glm::degrees(euler.z);\n\n    if (changed)\n    {\n      prop[\"values\"][0].SetFloat(glm::degrees(euler.x));\n      prop[\"values\"][1].SetFloat(glm::degrees(euler.y));\n      prop[\"values\"][2].SetFloat(glm::degrees(euler.z));\n    }\n  }\n\n  if (changed)\n    emit valueChanged(*_properties);\n}\n\nvoid IntrinsicEdPropertyEditorRotation::onSliderValueChanged()\n{\n  _INTR_ASSERT(_property);\n  rapidjson::Value& prop = *_property;\n\n  _ui.yaw->setValue(_ui.sYaw->value());\n  _ui.pitch->setValue(_ui.sPitch->value());\n  _ui.roll->setValue(_ui.sRoll->value());\n\n  onValueChanged();\n}\n<commit_msg>Correctly block signals from sliders when updating from a property<commit_after>\/\/ Copyright 2016 Benjamin Glatzel\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ Precompiled header file\n#include \"stdafx.h\"\n#include \"stdafx_editor.h\"\n\n\/\/ Ui\n#include \"ui_IntrinsicEdPropertyEditorRotation.h\"\n\nIntrinsicEdPropertyEditorRotation::IntrinsicEdPropertyEditorRotation(\n    rapidjson::Document* p_Document, rapidjson::Value* p_CurrentProperties,\n    rapidjson::Value* p_CurrentProperty, const char* p_PropertyName,\n    QWidget* parent)\n    : IntrinsicEdPropertyEditorBase(p_Document, p_CurrentProperties,\n                                    p_CurrentProperty, p_PropertyName, parent)\n{\n  _ui.setupUi(this);\n  updateFromProperty();\n\n  QObject::connect(_ui.yaw, SIGNAL(valueChanged(double)), this,\n                   SLOT(onValueChanged()));\n  QObject::connect(_ui.pitch, SIGNAL(valueChanged(double)), this,\n                   SLOT(onValueChanged()));\n  QObject::connect(_ui.roll, SIGNAL(valueChanged(double)), this,\n                   SLOT(onValueChanged()));\n  QObject::connect(_ui.sYaw, SIGNAL(valueChanged(int)), this,\n                   SLOT(onSliderValueChanged()));\n  QObject::connect(_ui.sPitch, SIGNAL(valueChanged(int)), this,\n                   SLOT(onSliderValueChanged()));\n  QObject::connect(_ui.sRoll, SIGNAL(valueChanged(int)), this,\n                   SLOT(onSliderValueChanged()));\n}\n\nIntrinsicEdPropertyEditorRotation::~IntrinsicEdPropertyEditorRotation() {}\n\nvoid IntrinsicEdPropertyEditorRotation::updateFromProperty()\n{\n  _INTR_ASSERT(_property);\n  const rapidjson::Value& prop = *_property;\n\n  if (prop[\"readOnly\"].GetBool())\n  {\n    _ui.yaw->setReadOnly(true);\n    _ui.pitch->setReadOnly(true);\n    _ui.roll->setReadOnly(true);\n    _ui.sYaw->setDisabled(true);\n    _ui.sPitch->setDisabled(true);\n    _ui.sRoll->setDisabled(true);\n  }\n\n  glm::vec3 euler;\n\n  if (strcmp(prop[\"type\"].GetString(), \"quat\") == 0u)\n  {\n    const glm::quat quat =\n        glm::quat(prop[\"values\"][3].GetFloat(), prop[\"values\"][0].GetFloat(),\n                  prop[\"values\"][1].GetFloat(), prop[\"values\"][2].GetFloat());\n    euler = glm::eulerAngles(quat);\n  }\n  else if (strcmp(prop[\"type\"].GetString(), \"vec3\") == 0u)\n  {\n    euler =\n        glm::vec3(glm::radians(glm::mod(prop[\"values\"][0].GetFloat(), 360.0f)),\n                  glm::radians(glm::mod(prop[\"values\"][1].GetFloat(), 360.0f)),\n                  glm::radians(glm::mod(prop[\"values\"][2].GetFloat(), 360.0f)));\n  }\n\n  bool changed = _ui.yaw->value() != glm::degrees(euler.x) ||\n                 _ui.pitch->value() != glm::degrees(euler.y) ||\n                 _ui.roll->value() != glm::degrees(euler.z);\n\n  if (changed)\n  {\n    _ui.yaw->blockSignals(true);\n    _ui.pitch->blockSignals(true);\n    _ui.roll->blockSignals(true);\n    _ui.sYaw->blockSignals(true);\n    _ui.sPitch->blockSignals(true);\n    _ui.sRoll->blockSignals(true);\n    _ui.yaw->setValue(glm::degrees(euler.x));\n    _ui.pitch->setValue(glm::degrees(euler.y));\n    _ui.roll->setValue(glm::degrees(euler.z));\n    _ui.sYaw->setValue(glm::degrees(euler.x));\n    _ui.sPitch->setValue(glm::degrees(euler.y));\n    _ui.sRoll->setValue(glm::degrees(euler.z));\n    _ui.yaw->blockSignals(false);\n    _ui.pitch->blockSignals(false);\n    _ui.roll->blockSignals(false);\n    _ui.sYaw->blockSignals(false);\n    _ui.sPitch->blockSignals(false);\n    _ui.sRoll->blockSignals(false);\n  }\n\n  _ui.propertyTitle->setText(_propertyName.c_str());\n}\n\nvoid IntrinsicEdPropertyEditorRotation::onValueChanged()\n{\n  _INTR_ASSERT(_property);\n  rapidjson::Value& prop = *_property;\n\n  _ui.sYaw->setValue(_ui.yaw->value());\n  _ui.sPitch->setValue(_ui.pitch->value());\n  _ui.sRoll->setValue(_ui.roll->value());\n\n  const glm::vec3 euler = glm::vec3(glm::radians(_ui.yaw->value()),\n                                    glm::radians(_ui.pitch->value()),\n                                    glm::radians(_ui.roll->value()));\n\n  bool changed = false;\n  if (strcmp(prop[\"type\"].GetString(), \"quat\") == 0u)\n  {\n    const glm::quat quat = glm::quat(euler);\n\n    changed = prop[\"values\"][0].GetFloat() != quat.x ||\n              prop[\"values\"][1].GetFloat() != quat.y ||\n              prop[\"values\"][2].GetFloat() != quat.z ||\n              prop[\"values\"][3].GetFloat() != quat.w;\n\n    if (changed)\n    {\n      prop[\"values\"][0].SetFloat(quat.x);\n      prop[\"values\"][1].SetFloat(quat.y);\n      prop[\"values\"][2].SetFloat(quat.z);\n      prop[\"values\"][3].SetFloat(quat.w);\n    }\n  }\n  else if (strcmp(prop[\"type\"].GetString(), \"vec3\") == 0u)\n  {\n    changed = prop[\"values\"][0].GetFloat() != glm::degrees(euler.x) ||\n              prop[\"values\"][1].GetFloat() != glm::degrees(euler.y) ||\n              prop[\"values\"][2].GetFloat() != glm::degrees(euler.z);\n\n    if (changed)\n    {\n      prop[\"values\"][0].SetFloat(glm::degrees(euler.x));\n      prop[\"values\"][1].SetFloat(glm::degrees(euler.y));\n      prop[\"values\"][2].SetFloat(glm::degrees(euler.z));\n    }\n  }\n\n  if (changed)\n    emit valueChanged(*_properties);\n}\n\nvoid IntrinsicEdPropertyEditorRotation::onSliderValueChanged()\n{\n  _INTR_ASSERT(_property);\n  rapidjson::Value& prop = *_property;\n\n  _ui.yaw->setValue(_ui.sYaw->value());\n  _ui.pitch->setValue(_ui.sPitch->value());\n  _ui.roll->setValue(_ui.sRoll->value());\n\n  onValueChanged();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*-------------------------------------------------------------------------\n * drawElements Quality Program Tester Core\n * ----------------------------------------\n *\n * Copyright 2014 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 * \\file\n * \\brief String template class.\n *\/\/*--------------------------------------------------------------------*\/\n\n#include \"tcuStringTemplate.hpp\"\n#include \"tcuDefs.hpp\"\n\n#include <sstream>\n\nusing std::string;\nusing std::map;\nusing std::ostringstream;\n\nnamespace tcu\n{\n\nStringTemplate::StringTemplate (void)\n{\n}\n\nStringTemplate::StringTemplate (const std::string& str)\n{\n\tsetString(str);\n}\n\nStringTemplate::~StringTemplate (void)\n{\n}\n\nvoid StringTemplate::setString (const std::string& str)\n{\n\tm_template = str;\n}\n\nstring StringTemplate::specialize (const map<string, string>& params) const\n{\n\tostringstream res;\n\n\tsize_t curNdx = 0;\n\tfor (;;)\n\t{\n\t\tsize_t paramNdx = m_template.find(\"${\", curNdx);\n\t\tif (paramNdx != string::npos)\n\t\t{\n\t\t\t\/\/ Append in-between stuff.\n\t\t\tres << m_template.substr(curNdx, paramNdx - curNdx);\n\n\t\t\t\/\/ Find end-of-param.\n\t\t\tsize_t paramEndNdx = m_template.find(\"}\", paramNdx);\n\t\t\tif (paramEndNdx == string::npos)\n\t\t\t\tthrow tcu::InternalError(\"No '}' found in template parameter\", \"\", __FILE__, __LINE__);\n\n\t\t\t\/\/ Parse parameter contents.\n\t\t\tstring\tparamStr\t\t= m_template.substr(paramNdx+2, paramEndNdx-2-paramNdx);\n\t\t\tbool\tparamSingleLine\t= false;\n\t\t\tstring\tparamName;\n\t\t\tsize_t colonNdx = paramStr.find(\":\");\n\t\t\tif (colonNdx != string::npos)\n\t\t\t{\n\t\t\t\tparamName = paramStr.substr(0, colonNdx);\n\t\t\t\tstring flagsStr = paramStr.substr(colonNdx+1);\n\t\t\t\tTCU_CHECK(flagsStr == \"single-line\");\n\t\t\t\tparamSingleLine = true;\n\t\t\t}\n\t\t\telse\n\t\t\t\tparamName = paramStr;\n\n\t\t\t\/\/ Fill in parameter value.\n\t\t\tif (params.find(paramName) != params.end())\n\t\t\t{\n\t\t\t\tconst string& val = (*params.find(paramName)).second;\n\t\t\t\tif (paramSingleLine)\n\t\t\t\t{\n\t\t\t\t\tstring tmp = val;\n\t\t\t\t\tfor (size_t ndx = tmp.find(\"\\n\"); ndx != string::npos; ndx = tmp.find(\"\\n\"))\n\t\t\t\t\t\ttmp = tmp.replace(ndx, 1, \" \");\n\t\t\t\t\tres << tmp;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tres << val;\n\t\t\t}\n\t\t\telse\n\t\t\t\tthrow tcu::InternalError((string(\"Value for parameter '\") + paramName + \"' not found in map\").c_str(), \"\", __FILE__, __LINE__);\n\n\t\t\t\/\/ Skip over template.\n\t\t\tcurNdx = paramEndNdx + 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (curNdx < m_template.length())\n\t\t\t\tres << &m_template[curNdx];\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn res.str();\n}\n\n} \/\/ tcu\n<commit_msg>Cherry-pick a few tcu::StringTemplate fixes to master<commit_after>\/*-------------------------------------------------------------------------\n * drawElements Quality Program Tester Core\n * ----------------------------------------\n *\n * Copyright 2014 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 * \\file\n * \\brief String template class.\n *\/\/*--------------------------------------------------------------------*\/\n\n#include \"tcuStringTemplate.hpp\"\n#include \"tcuDefs.hpp\"\n\n#include <sstream>\n\nusing std::string;\nusing std::map;\nusing std::ostringstream;\n\nnamespace tcu\n{\n\nStringTemplate::StringTemplate (void)\n{\n}\n\nStringTemplate::StringTemplate (const std::string& str)\n{\n\tsetString(str);\n}\n\nStringTemplate::~StringTemplate (void)\n{\n}\n\nvoid StringTemplate::setString (const std::string& str)\n{\n\tm_template = str;\n}\n\nstring StringTemplate::specialize (const map<string, string>& params) const\n{\n\tostringstream res;\n\n\tsize_t curNdx = 0;\n\tfor (;;)\n\t{\n\t\tsize_t paramNdx = m_template.find(\"${\", curNdx);\n\t\tif (paramNdx != string::npos)\n\t\t{\n\t\t\t\/\/ Append in-between stuff.\n\t\t\tres << m_template.substr(curNdx, paramNdx - curNdx);\n\n\t\t\t\/\/ Find end-of-param.\n\t\t\tsize_t paramEndNdx = m_template.find(\"}\", paramNdx);\n\t\t\tif (paramEndNdx == string::npos)\n\t\t\t\tTCU_THROW(InternalError, \"No '}' found in template parameter\");\n\n\t\t\t\/\/ Parse parameter contents.\n\t\t\tstring\tparamStr\t\t= m_template.substr(paramNdx+2, paramEndNdx-2-paramNdx);\n\t\t\tbool\tparamSingleLine\t= false;\n\t\t\tbool\tparamOptional\t= false;\n\t\t\tstring\tparamName;\n\t\t\tsize_t colonNdx = paramStr.find(\":\");\n\t\t\tif (colonNdx != string::npos)\n\t\t\t{\n\t\t\t\tparamName = paramStr.substr(0, colonNdx);\n\t\t\t\tstring flagsStr = paramStr.substr(colonNdx+1);\n\t\t\t\tif (flagsStr == \"single-line\")\n\t\t\t\t{\n\t\t\t\t\tparamSingleLine = true;\n\t\t\t\t}\n\t\t\t\telse if (flagsStr == \"opt\")\n\t\t\t\t{\n\t\t\t\t\tparamOptional = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tTCU_THROW(InternalError, (string(\"Unrecognized flag\") + paramStr).c_str());\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t\tparamName = paramStr;\n\n\t\t\t\/\/ Fill in parameter value.\n\t\t\tif (params.find(paramName) != params.end())\n\t\t\t{\n\t\t\t\tconst string& val = (*params.find(paramName)).second;\n\t\t\t\tif (paramSingleLine)\n\t\t\t\t{\n\t\t\t\t\tstring tmp = val;\n\t\t\t\t\tfor (size_t ndx = tmp.find(\"\\n\"); ndx != string::npos; ndx = tmp.find(\"\\n\"))\n\t\t\t\t\t\ttmp = tmp.replace(ndx, 1, \" \");\n\t\t\t\t\tres << tmp;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tres << val;\n\t\t\t}\n\t\t\telse if (!paramOptional)\n\t\t\t\tTCU_THROW(InternalError, (string(\"Value for parameter '\") + paramName + \"' not found in map\").c_str());\n\n\t\t\t\/\/ Skip over template.\n\t\t\tcurNdx = paramEndNdx + 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (curNdx < m_template.length())\n\t\t\t\tres << &m_template[curNdx];\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn res.str();\n}\n\n} \/\/ tcu\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************************\n *                                                                                       *\n * OpenSpace                                                                             *\n *                                                                                       *\n * Copyright (c) 2014-2017                                                               *\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#include <QApplication>\n#include <QFile>\n\n#include \"mainwindow.h\"\n\n#include <ghoul\/filesystem\/filesystem>\n\nstatic const QString style = R\"style(\nQWidget {\n    \/*font-family: \"Helvetica\";*\/\n}\nQWidget#MainWindow, QTextEdit, QWidget#SyncWidget, QWidget#DownloadArea {\n    background-color: rgb(40, 40, 40);\n}\nQTextEdit, QLabel, QComboBox, QCheckBox {\n    color: #EDEDED;\n    font-size: 12px;\n}\nQLabel {\n    font-size: 13px;\n}\nQLabel#Image {\n    margin: -10px 0px -5px 0px;\n}\nQTextEdit {\n    border-width: 2px 2px 0px 0px;\n    border-style: solid;\n    background-color: rgb(60, 60, 60);\n}\nQPushButton {\n    color:#202020;\n    background-color:\n        qlineargradient(\n            x1: 0, y1: 0, x2: 0, y2: 1,\n            stop: 0 white,\n            stop: 1 #555555\n        );\n    border: 1px solid black;\n    font-size: 11px;\n    min-height: 20px;\n}\nQComboBox { \n    background-color: rgb(60, 60, 60);\n    min-height: 20px;\n}\nQComboBox:focus, QComboBox:focus QAbstractItemView {\n    color: white;\n    background-color: rgb(60, 60, 60);\n    selection-background-color: rgb(75, 75, 75);\n}\nQCheckBox {\n    border: none;\n}\nQCheckBox::indicator {\n    width: 12px;\n    height: 12px;\n}\nQCheckBox::indicator::unchecked {\n    border: 1px solid #5A5A5A;\n    background: #A0A0A0;\n}\nQCheckBox::indicator:unchecked:hover {\n    border: 1px solid #DDDDDD;\n}\nQCheckBox::indicator::checked {\n    border: 1px solid #5A5A5A;\n    background: #5AB65A;\n}\nQCheckBox::indicator:checked:hover {\n    border: 1px solid #DDDDDD;\n}\nQGroupBox, QScrollArea {\n    border: 0px;\n}\nInfoWidget {\n    border-width: 1px;\n    border-style: solid;\n    border-color: #BBBBBB;\n    margin: 2px 1px 2px 1px;\n    padding: 7.5px;\n}\nInfoWidget QLabel#Name {\n    font-size: 17px;\n}\nInfoWidget QLabel#Bytes {\n    font-size: 13px;\n    font-family: \"Lucida Console\";\n} \nInfoWidget QLabel#MessageLeft, QLabel#MessageCenter, QLabel#MessageRight {\n    font-size: 11.5px;\n    margin-top: -2px;\n} \nInfoWidget QProgressBar {\n    border: 2px solid #BBBBBB;\n    border-radius: 5px;\n    background: white;\n    height: 15px;\n}\nInfoWidget QProgressBar::chunk {\n    background: qlineargradient(\n        x1: 0, y1: 0.5, x2: 1, y2: 0.5,\n        stop: 0 #444444,\n        stop: 1 #600000\n    );\n}\nQScrollBar {\n    border: 1px solid #000000;\n    background: #282828;\n    width: 15px;\n    margin: 16px 0px 16px 0px;\n}\nQScrollBar::handle {\n    background: #B0B0B0;\n    border: 1px solid #000000;\n    border-width: 1px 0px 1px 0px;\n    min-height: 20px;\n}\nQScrollBar::add-line, QScrollBar::sub-line {\n    background:#B0B0B0;\n    border: 1px solid #5A5A5A;\n    subcontrol-origin: margin;\n}\nQScrollBar::add-line {\n    top: 15px;\n    height: 15px;\n}\nQScrollBar::sub-line {\n    height: 15px;\n    subcontrol-position: top;\n}\nQScrollBar::up-arrow, QScrollBar::down-arrow {\n    border: 1px solid #5A5A5A;\n    width: 3px;\n    height: 3px;\n    background-color: #353535;\n}\nQScrollBar::add-page, QScrollBar::sub-page {\n    background: none;\n}\n)style\";\n\nint main(int argc, char** argv) {\n    QApplication app(argc, argv);\n    app.setStyleSheet(style);\n\n\tMainWindow window;\n    window.show();\n\n    return app.exec();\n}\n<commit_msg>Change tab to spaces<commit_after>\/*****************************************************************************************\n *                                                                                       *\n * OpenSpace                                                                             *\n *                                                                                       *\n * Copyright (c) 2014-2017                                                               *\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#include <QApplication>\n#include <QFile>\n\n#include \"mainwindow.h\"\n\n#include <ghoul\/filesystem\/filesystem>\n\nstatic const QString style = R\"style(\nQWidget {\n    \/*font-family: \"Helvetica\";*\/\n}\nQWidget#MainWindow, QTextEdit, QWidget#SyncWidget, QWidget#DownloadArea {\n    background-color: rgb(40, 40, 40);\n}\nQTextEdit, QLabel, QComboBox, QCheckBox {\n    color: #EDEDED;\n    font-size: 12px;\n}\nQLabel {\n    font-size: 13px;\n}\nQLabel#Image {\n    margin: -10px 0px -5px 0px;\n}\nQTextEdit {\n    border-width: 2px 2px 0px 0px;\n    border-style: solid;\n    background-color: rgb(60, 60, 60);\n}\nQPushButton {\n    color:#202020;\n    background-color:\n        qlineargradient(\n            x1: 0, y1: 0, x2: 0, y2: 1,\n            stop: 0 white,\n            stop: 1 #555555\n        );\n    border: 1px solid black;\n    font-size: 11px;\n    min-height: 20px;\n}\nQComboBox { \n    background-color: rgb(60, 60, 60);\n    min-height: 20px;\n}\nQComboBox:focus, QComboBox:focus QAbstractItemView {\n    color: white;\n    background-color: rgb(60, 60, 60);\n    selection-background-color: rgb(75, 75, 75);\n}\nQCheckBox {\n    border: none;\n}\nQCheckBox::indicator {\n    width: 12px;\n    height: 12px;\n}\nQCheckBox::indicator::unchecked {\n    border: 1px solid #5A5A5A;\n    background: #A0A0A0;\n}\nQCheckBox::indicator:unchecked:hover {\n    border: 1px solid #DDDDDD;\n}\nQCheckBox::indicator::checked {\n    border: 1px solid #5A5A5A;\n    background: #5AB65A;\n}\nQCheckBox::indicator:checked:hover {\n    border: 1px solid #DDDDDD;\n}\nQGroupBox, QScrollArea {\n    border: 0px;\n}\nInfoWidget {\n    border-width: 1px;\n    border-style: solid;\n    border-color: #BBBBBB;\n    margin: 2px 1px 2px 1px;\n    padding: 7.5px;\n}\nInfoWidget QLabel#Name {\n    font-size: 17px;\n}\nInfoWidget QLabel#Bytes {\n    font-size: 13px;\n    font-family: \"Lucida Console\";\n} \nInfoWidget QLabel#MessageLeft, QLabel#MessageCenter, QLabel#MessageRight {\n    font-size: 11.5px;\n    margin-top: -2px;\n} \nInfoWidget QProgressBar {\n    border: 2px solid #BBBBBB;\n    border-radius: 5px;\n    background: white;\n    height: 15px;\n}\nInfoWidget QProgressBar::chunk {\n    background: qlineargradient(\n        x1: 0, y1: 0.5, x2: 1, y2: 0.5,\n        stop: 0 #444444,\n        stop: 1 #600000\n    );\n}\nQScrollBar {\n    border: 1px solid #000000;\n    background: #282828;\n    width: 15px;\n    margin: 16px 0px 16px 0px;\n}\nQScrollBar::handle {\n    background: #B0B0B0;\n    border: 1px solid #000000;\n    border-width: 1px 0px 1px 0px;\n    min-height: 20px;\n}\nQScrollBar::add-line, QScrollBar::sub-line {\n    background:#B0B0B0;\n    border: 1px solid #5A5A5A;\n    subcontrol-origin: margin;\n}\nQScrollBar::add-line {\n    top: 15px;\n    height: 15px;\n}\nQScrollBar::sub-line {\n    height: 15px;\n    subcontrol-position: top;\n}\nQScrollBar::up-arrow, QScrollBar::down-arrow {\n    border: 1px solid #5A5A5A;\n    width: 3px;\n    height: 3px;\n    background-color: #353535;\n}\nQScrollBar::add-page, QScrollBar::sub-page {\n    background: none;\n}\n)style\";\n\nint main(int argc, char** argv) {\n    QApplication app(argc, argv);\n    app.setStyleSheet(style);\n\n    MainWindow window;\n    window.show();\n\n    return app.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2013.  All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Containers_Set_inl_\n#define _Stroika_Foundation_Containers_Set_inl_\n\n#include    \"..\/Debug\/Assertions.h\"\n\n#include    \"Concrete\/Set_Factory.h\"\n\n\nnamespace   Stroika {\n    namespace   Foundation {\n        namespace   Containers {\n\n\n            \/*\n             ********************************************************************************\n             ***************************** Set<T, TRAITS> ***********************************\n             ********************************************************************************\n             *\/\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::Set ()\n                : inherited (static_cast<const inherited&> (Concrete::Set_Factory<T, TRAITS>::mk ()))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::Set (const Set<T, TRAITS>& src)\n                : inherited (static_cast<const inherited&> (src))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n            }\n#if      qCompilerAndStdLib_Supports_initializer_lists\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::Set (const std::initializer_list<T>& s)\n                : inherited (static_cast<const inherited&> (Concrete::Set_Factory<T, TRAITS>::mk ()))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n                AddAll (src);\n            }\n#endif\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  Set<T, TRAITS>::Set (const CONTAINER_OF_T& src)\n                : inherited (static_cast<const inherited&> (Concrete::Set_Factory<T, TRAITS>::mk ()))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n                AddAll (src);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::Set (const _SharedPtrIRep& rep)\n                : inherited (typename inherited::_SharedPtrIRep (rep))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n                RequireNotNull (rep);\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename COPY_FROM_ITERATOR_OF_T>\n            inline Set<T, TRAITS>::Set (COPY_FROM_ITERATOR_OF_T start, COPY_FROM_ITERATOR_OF_T end)\n                : inherited (static_cast<const inherited&> (Concrete::Set_Factory<T, TRAITS>::mk ()))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n                AddAll (start, end);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator= (const Set<T, TRAITS>& rhs)\n            {\n                inherited::operator= (rhs);\n                return *this;\n            }\n            template    <typename T, typename TRAITS>\n            inline  const typename  Set<T, TRAITS>::_IRep&    Set<T, TRAITS>::_GetRep () const\n            {\n                EnsureMember (&inherited::_GetRep (), _IRep);       \/\/ use static_cast cuz more efficient, but validate with assertion\n                return *static_cast<const _IRep*> (&inherited::_GetRep ());\n            }\n            template    <typename T, typename TRAITS>\n            inline  typename    Set<T, TRAITS>::_IRep&  Set<T, TRAITS>::_GetRep ()\n            {\n                EnsureMember (&inherited::_GetRep (), _IRep);       \/\/ use static_cast cuz more efficient, but validate with assertion\n                return *static_cast<_IRep*> (&inherited::_GetRep ());\n            }\n            template    <typename T, typename TRAITS>\n            inline  bool    Set<T, TRAITS>::Contains (T item) const\n            {\n                return _GetRep ().Contains (item);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Memory::Optional<T>    Set<T, TRAITS>::Lookup (T item) const\n            {\n                return _GetRep ().Lookup (item);\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::Add (T item)\n            {\n                _GetRep ().Add (item);\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename COPY_FROM_ITERATOR_OF_T>\n            void    Set<T, TRAITS>::AddAll (COPY_FROM_ITERATOR_OF_T start, COPY_FROM_ITERATOR_OF_T end)\n            {\n                for (auto i = start; i != end; ++i) {\n                    Add (*i);\n                }\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  void    Set<T, TRAITS>::AddAll (const CONTAINER_OF_T& s)\n            {\n                \/\/ Note - unlike Bag<T, TRAITS> - we dont need to check for this != &s because if we\n                \/\/ attempt to add items that already exist, it would do nothing, and not lead to\n                \/\/ an infinite loop\n                AddAll (std::begin (s), std::end (s));\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::Remove (T item)\n            {\n                _GetRep ().Remove (item);\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::Remove (const Iterator<T>& i)\n            {\n                _GetRep ().Remove (i);\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename COPY_FROM_ITERATOR_OF_T>\n            void    Set<T, TRAITS>::RemoveAll (COPY_FROM_ITERATOR_OF_T start, COPY_FROM_ITERATOR_OF_T end)\n            {\n                for (auto i = start; i != end; ++i) {\n                    Remove (*i);\n                }\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  void    Set<T, TRAITS>::RemoveAll (const CONTAINER_OF_T& s)\n            {\n                RemoveAll (std::begin (s), std::end (s));\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::RemoveAll ()\n            {\n                _GetRep ().RemoveAll ();\n            }\n            template    <typename T, typename TRAITS>\n            bool  Set<T, TRAITS>::Equals (const Set<T, TRAITS>& rhs) const\n            {\n                return (_GetRep ().Equals (rhs._GetRep ()));\n            }\n            template    <typename T, typename TRAITS>\n            inline  bool  Set<T, TRAITS>::operator== (const Set<T, TRAITS>& rhs) const\n            {\n                return Equals (rhs);\n            }\n            template    <typename T, typename TRAITS>\n            inline  bool    Set<T, TRAITS>::operator!= (const Set<T, TRAITS>& rhs) const\n            {\n                return (not Equals (rhs));\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator+= (T item)\n            {\n                Add (item);\n                return *this;\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator+= (const CONTAINER_OF_T& items)\n            {\n                AddAll (items);\n                return (*this);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator-= (T item)\n            {\n                Remove (item);\n                return *this;\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator-= (const CONTAINER_OF_T& items)\n            {\n                RemoveAll (items);\n                return *this;\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::clear ()\n            {\n                RemoveAll ();\n            }\n\n\n            \/*\n             ********************************************************************************\n             ************************** Set<T, TRAITS>::_IRep *******************************\n             ********************************************************************************\n             *\/\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::_IRep::_IRep ()\n            {\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::_IRep::~_IRep ()\n            {\n            }\n            template    <typename T, typename TRAITS>\n            bool    Set<T, TRAITS>::_IRep::_Equals_Reference_Implementation (const _IRep& rhs) const\n            {\n                if (this == &rhs) {\n                    return true;\n                }\n                if (this->GetLength () != rhs.GetLength ()) {\n                    return false;\n                }\n                \/\/ Note - no need to iterate over rhs because we checked sizes the same\n                for (auto i = this->MakeIterator (); not i.Done (); ++i) {\n                    if (not rhs.Contains (*i)) {\n                        return false;\n                    }\n                }\n                return true;\n            }\n\n\n        }\n    }\n}\n#endif \/* _Stroika_Foundation_Containers_Set_inl_ *\/\n<commit_msg>fixed typo<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2013.  All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Containers_Set_inl_\n#define _Stroika_Foundation_Containers_Set_inl_\n\n#include    \"..\/Debug\/Assertions.h\"\n\n#include    \"Concrete\/Set_Factory.h\"\n\n\nnamespace   Stroika {\n    namespace   Foundation {\n        namespace   Containers {\n\n\n            \/*\n             ********************************************************************************\n             ***************************** Set<T, TRAITS> ***********************************\n             ********************************************************************************\n             *\/\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::Set ()\n                : inherited (static_cast<const inherited&> (Concrete::Set_Factory<T, TRAITS>::mk ()))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::Set (const Set<T, TRAITS>& src)\n                : inherited (static_cast<const inherited&> (src))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n            }\n#if      qCompilerAndStdLib_Supports_initializer_lists\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::Set (const std::initializer_list<T>& src)\n                : inherited (static_cast<const inherited&> (Concrete::Set_Factory<T, TRAITS>::mk ()))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n                AddAll (src);\n            }\n#endif\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  Set<T, TRAITS>::Set (const CONTAINER_OF_T& src)\n                : inherited (static_cast<const inherited&> (Concrete::Set_Factory<T, TRAITS>::mk ()))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n                AddAll (src);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::Set (const _SharedPtrIRep& rep)\n                : inherited (typename inherited::_SharedPtrIRep (rep))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n                RequireNotNull (rep);\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename COPY_FROM_ITERATOR_OF_T>\n            inline Set<T, TRAITS>::Set (COPY_FROM_ITERATOR_OF_T start, COPY_FROM_ITERATOR_OF_T end)\n                : inherited (static_cast<const inherited&> (Concrete::Set_Factory<T, TRAITS>::mk ()))\n            {\n                AssertMember (&inherited::_GetRep (), _IRep);\n                AddAll (start, end);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator= (const Set<T, TRAITS>& rhs)\n            {\n                inherited::operator= (rhs);\n                return *this;\n            }\n            template    <typename T, typename TRAITS>\n            inline  const typename  Set<T, TRAITS>::_IRep&    Set<T, TRAITS>::_GetRep () const\n            {\n                EnsureMember (&inherited::_GetRep (), _IRep);       \/\/ use static_cast cuz more efficient, but validate with assertion\n                return *static_cast<const _IRep*> (&inherited::_GetRep ());\n            }\n            template    <typename T, typename TRAITS>\n            inline  typename    Set<T, TRAITS>::_IRep&  Set<T, TRAITS>::_GetRep ()\n            {\n                EnsureMember (&inherited::_GetRep (), _IRep);       \/\/ use static_cast cuz more efficient, but validate with assertion\n                return *static_cast<_IRep*> (&inherited::_GetRep ());\n            }\n            template    <typename T, typename TRAITS>\n            inline  bool    Set<T, TRAITS>::Contains (T item) const\n            {\n                return _GetRep ().Contains (item);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Memory::Optional<T>    Set<T, TRAITS>::Lookup (T item) const\n            {\n                return _GetRep ().Lookup (item);\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::Add (T item)\n            {\n                _GetRep ().Add (item);\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename COPY_FROM_ITERATOR_OF_T>\n            void    Set<T, TRAITS>::AddAll (COPY_FROM_ITERATOR_OF_T start, COPY_FROM_ITERATOR_OF_T end)\n            {\n                for (auto i = start; i != end; ++i) {\n                    Add (*i);\n                }\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  void    Set<T, TRAITS>::AddAll (const CONTAINER_OF_T& s)\n            {\n                \/\/ Note - unlike Bag<T, TRAITS> - we dont need to check for this != &s because if we\n                \/\/ attempt to add items that already exist, it would do nothing, and not lead to\n                \/\/ an infinite loop\n                AddAll (std::begin (s), std::end (s));\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::Remove (T item)\n            {\n                _GetRep ().Remove (item);\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::Remove (const Iterator<T>& i)\n            {\n                _GetRep ().Remove (i);\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename COPY_FROM_ITERATOR_OF_T>\n            void    Set<T, TRAITS>::RemoveAll (COPY_FROM_ITERATOR_OF_T start, COPY_FROM_ITERATOR_OF_T end)\n            {\n                for (auto i = start; i != end; ++i) {\n                    Remove (*i);\n                }\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  void    Set<T, TRAITS>::RemoveAll (const CONTAINER_OF_T& s)\n            {\n                RemoveAll (std::begin (s), std::end (s));\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::RemoveAll ()\n            {\n                _GetRep ().RemoveAll ();\n            }\n            template    <typename T, typename TRAITS>\n            bool  Set<T, TRAITS>::Equals (const Set<T, TRAITS>& rhs) const\n            {\n                return (_GetRep ().Equals (rhs._GetRep ()));\n            }\n            template    <typename T, typename TRAITS>\n            inline  bool  Set<T, TRAITS>::operator== (const Set<T, TRAITS>& rhs) const\n            {\n                return Equals (rhs);\n            }\n            template    <typename T, typename TRAITS>\n            inline  bool    Set<T, TRAITS>::operator!= (const Set<T, TRAITS>& rhs) const\n            {\n                return (not Equals (rhs));\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator+= (T item)\n            {\n                Add (item);\n                return *this;\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator+= (const CONTAINER_OF_T& items)\n            {\n                AddAll (items);\n                return (*this);\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator-= (T item)\n            {\n                Remove (item);\n                return *this;\n            }\n            template    <typename T, typename TRAITS>\n            template    <typename CONTAINER_OF_T>\n            inline  Set<T, TRAITS>& Set<T, TRAITS>::operator-= (const CONTAINER_OF_T& items)\n            {\n                RemoveAll (items);\n                return *this;\n            }\n            template    <typename T, typename TRAITS>\n            inline  void    Set<T, TRAITS>::clear ()\n            {\n                RemoveAll ();\n            }\n\n\n            \/*\n             ********************************************************************************\n             ************************** Set<T, TRAITS>::_IRep *******************************\n             ********************************************************************************\n             *\/\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::_IRep::_IRep ()\n            {\n            }\n            template    <typename T, typename TRAITS>\n            inline  Set<T, TRAITS>::_IRep::~_IRep ()\n            {\n            }\n            template    <typename T, typename TRAITS>\n            bool    Set<T, TRAITS>::_IRep::_Equals_Reference_Implementation (const _IRep& rhs) const\n            {\n                if (this == &rhs) {\n                    return true;\n                }\n                if (this->GetLength () != rhs.GetLength ()) {\n                    return false;\n                }\n                \/\/ Note - no need to iterate over rhs because we checked sizes the same\n                for (auto i = this->MakeIterator (); not i.Done (); ++i) {\n                    if (not rhs.Contains (*i)) {\n                        return false;\n                    }\n                }\n                return true;\n            }\n\n\n        }\n    }\n}\n#endif \/* _Stroika_Foundation_Containers_Set_inl_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <cstdlib>\n#include <cstdio>\n#include \"util.h\"\n\nusing namespace std;\n\nbool show_addresses;\n\nvoid status(string message) {\n  cout << \"[+] \" << message << \"\\n\";\n}\n\nvoid header() {\n  cout << \"SIC-Disassembler v1.3 by Jay Bosamiya\\n\"\n          \"-------------------------------------\\n\\n\";\n}\n\nvoid usage(string progname) {\n  cerr << \"Usage: \" << progname << \" input_object_file output_assembly_file [-a]\\n\";\n  cerr << \"  Options:\\n\";\n  cerr << \"    -a   Show addresses in assembly output\\n\";\n  exit(-2);\n}\n\nvoid error(string err) {\n  cerr << \"[!] Error: \" << err << \"\\n\";\n}\n\nvoid fatal(string err, int code) {\n  error(err);\n  exit(code);\n}\n\nbool is_hex_digit(char c) {\n\treturn\n\t\t(c >= 'A' && c <= 'F') ||\n\t\t(c >= '0' && c <= '9');\n}\n\nbool is_hex_string(std::string s) {\n\tbool ret = true;\n\tfor ( const char *c = s.c_str(); *c && ret ; c++ ) {\n\t\tret = ret && is_hex_digit(*c);\n\t}\n\treturn ret;\n}\n\nvoid make_upper_case(std::string &s) {\n\tfor ( string::iterator c = s.begin() ; c != s.end() ; c++ ) {\n\t\tif ( *c >= 'a' && *c <= 'z' ) {\n\t\t\t*c = (*c - 'a') + 'A';\n\t\t}\n\t}\n}\n\nint hexchar2int(char c) {\n\tint ret = -1;\n\tif ( c >= '0' && c <= '9' ) {\n\t\tret = (c-'0');\n\t} else if ( c >= 'A' && c <= 'F' ) {\n\t\tret = (c-'A')+10;\n\t}\n\treturn ret;\n}\n\nint hex2int(string s) {\n\tint ret = 0;\n\tfor ( const char * cc = s.c_str() ; *cc ; cc++ ) {\n\t\tret *= 16;\n\t\tconst char &c = *cc;\n\t\tif ( is_hex_digit(c) ) {\n\t\t\tret += hexchar2int(c);\n\t\t} else {\n\t\t\tfatal(\"Hex values need to be 0-9 or A-F\");\n\t\t}\n\t}\n\treturn ret;\n}\n\nstring byte2hex(int c) {\n\tstring ret = \"\";\n\tif ( c < 0 || c >= 256 ) {\n\t\tfatal(\"Illegal value for byte\");\n\t}\n\tret += (c\/16 < 10)?('0'+c\/16):('A'+c\/16-10);\n\tret += (c%16 < 10)?('0'+c%16):('A'+c%16-10);\n\treturn ret;\n}\n\nstring int2hex(int c, int bytes) {\n\tif ( c < 0 ) {\n\t\treturn int2hex(c&0x7FFFFFFF,bytes);\n\t}\n\tif ( bytes <= 0 ) {\n\t\treturn \"\";\n\t}\n\treturn int2hex(c\/256,bytes-1)+byte2hex(c%256);\n}\n\nstd::string int2str(int c) {\n\tchar ret[20];\n\tsprintf(ret,\"%d\",c);\n\treturn ret;\n}\n<commit_msg>Update version<commit_after>#include <iostream>\n#include <cstdlib>\n#include <cstdio>\n#include \"util.h\"\n\nusing namespace std;\n\nbool show_addresses;\n\nvoid status(string message) {\n  cout << \"[+] \" << message << \"\\n\";\n}\n\nvoid header() {\n  cout << \"SIC-Disassembler v1.4 by Jay Bosamiya\\n\"\n          \"-------------------------------------\\n\\n\";\n}\n\nvoid usage(string progname) {\n  cerr << \"Usage: \" << progname << \" input_object_file output_assembly_file [-a]\\n\";\n  cerr << \"  Options:\\n\";\n  cerr << \"    -a   Show addresses in assembly output\\n\";\n  exit(-2);\n}\n\nvoid error(string err) {\n  cerr << \"[!] Error: \" << err << \"\\n\";\n}\n\nvoid fatal(string err, int code) {\n  error(err);\n  exit(code);\n}\n\nbool is_hex_digit(char c) {\n\treturn\n\t\t(c >= 'A' && c <= 'F') ||\n\t\t(c >= '0' && c <= '9');\n}\n\nbool is_hex_string(std::string s) {\n\tbool ret = true;\n\tfor ( const char *c = s.c_str(); *c && ret ; c++ ) {\n\t\tret = ret && is_hex_digit(*c);\n\t}\n\treturn ret;\n}\n\nvoid make_upper_case(std::string &s) {\n\tfor ( string::iterator c = s.begin() ; c != s.end() ; c++ ) {\n\t\tif ( *c >= 'a' && *c <= 'z' ) {\n\t\t\t*c = (*c - 'a') + 'A';\n\t\t}\n\t}\n}\n\nint hexchar2int(char c) {\n\tint ret = -1;\n\tif ( c >= '0' && c <= '9' ) {\n\t\tret = (c-'0');\n\t} else if ( c >= 'A' && c <= 'F' ) {\n\t\tret = (c-'A')+10;\n\t}\n\treturn ret;\n}\n\nint hex2int(string s) {\n\tint ret = 0;\n\tfor ( const char * cc = s.c_str() ; *cc ; cc++ ) {\n\t\tret *= 16;\n\t\tconst char &c = *cc;\n\t\tif ( is_hex_digit(c) ) {\n\t\t\tret += hexchar2int(c);\n\t\t} else {\n\t\t\tfatal(\"Hex values need to be 0-9 or A-F\");\n\t\t}\n\t}\n\treturn ret;\n}\n\nstring byte2hex(int c) {\n\tstring ret = \"\";\n\tif ( c < 0 || c >= 256 ) {\n\t\tfatal(\"Illegal value for byte\");\n\t}\n\tret += (c\/16 < 10)?('0'+c\/16):('A'+c\/16-10);\n\tret += (c%16 < 10)?('0'+c%16):('A'+c%16-10);\n\treturn ret;\n}\n\nstring int2hex(int c, int bytes) {\n\tif ( c < 0 ) {\n\t\treturn int2hex(c&0x7FFFFFFF,bytes);\n\t}\n\tif ( bytes <= 0 ) {\n\t\treturn \"\";\n\t}\n\treturn int2hex(c\/256,bytes-1)+byte2hex(c%256);\n}\n\nstd::string int2str(int c) {\n\tchar ret[20];\n\tsprintf(ret,\"%d\",c);\n\treturn ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************\/\n\/*               DO NOT MODIFY THIS HEADER                      *\/\n\/* MOOSE - Multiphysics Object Oriented Simulation Environment  *\/\n\/*                                                              *\/\n\/*           (c) 2010 Battelle Energy Alliance, LLC             *\/\n\/*                   ALL RIGHTS RESERVED                        *\/\n\/*                                                              *\/\n\/*          Prepared by Battelle Energy Alliance, LLC           *\/\n\/*            Under Contract No. DE-AC07-05ID14517              *\/\n\/*            With the U. S. Department of Energy               *\/\n\/*                                                              *\/\n\/*            See COPYRIGHT for full restrictions               *\/\n\/****************************************************************\/\n\n#include \"Transient.h\"\n\n\/\/Moose includes\n#include \"Kernel.h\"\n#include \"Factory.h\"\n#include \"SubProblem.h\"\n#include \"ProblemFactory.h\"\n#include \"TimePeriod.h\"\n#include \"TimeScheme.h\"\n\/\/libMesh includes\n#include \"implicit_system.h\"\n#include \"nonlinear_implicit_system.h\"\n#include \"transient_system.h\"\n#include \"numeric_vector.h\"\n#include \"o_string_stream.h\"\n\n\/\/ C++ Includes\n#include <iomanip>\n#include <iostream>\n#include <fstream>\n\ntemplate<>\nInputParameters validParams<Transient>()\n{\n  InputParameters params = validParams<Executioner>();\n  std::vector<Real> sync_times(1);\n  sync_times[0] = -1;\n\n  params.addParam<Real>(\"start_time\",      0.0,    \"The start time of the simulation\");\n  params.addParam<Real>(\"end_time\",        1.0e30, \"The end time of the simulation\");\n  params.addRequiredParam<Real>(\"dt\", \"The timestep size between solves\");\n  params.addParam<Real>(\"dtmin\",           0.0,    \"The minimum timestep size in an adaptive run\");\n  params.addParam<Real>(\"dtmax\",           1.0e30, \"The maximum timestep size in an adaptive run\");\n  params.addParam<Real>(\"num_steps\",       std::numeric_limits<Real>::max(),     \"The number of timesteps in a transient run\");\n  params.addParam<int> (\"n_startup_steps\", 0,      \"The number of timesteps during startup\");\n  params.addParam<bool>(\"trans_ss_check\",  false,  \"Whether or not to check for steady state conditions\");\n  params.addParam<Real>(\"ss_check_tol\",    1.0e-08,\"Whenever the relative residual changes by less than this the solution will be considered to be at steady state.\");\n  params.addParam<Real>(\"ss_tmin\",         0.0,    \"Minimum number of timesteps to take before checking for steady state conditions.\");\n  params.addParam<std::vector<Real> >(\"sync_times\", sync_times, \"A list of times that will be solved for provided they are within the simulation time\");\n  params.addParam<std::vector<Real> >(\"time_t\", \"The values of t\");\n  params.addParam<std::vector<Real> >(\"time_dt\", \"The values of dt\");\n  params.addParam<Real>(\"growth_factor\", 2, \"Maximum ratio of new to previous timestep sizes following a step that required the time step to be cut due to a failed solve.  For use with 'time_t' and 'time_dt'.\");\n  params.addParam<Real>(\"predictor_scale\", \"The scale factor for the predictor (can range from 0 to 1)\");\n\n  params.addParam<std::vector<std::string> >(\"time_periods\", \"The names of periods\");\n  params.addParam<std::vector<Real> >(\"time_period_starts\", \"The start times of time periods\");\n  params.addParam<std::vector<Real> >(\"time_period_ends\", \"The end times of time periods\");\n  params.addParam<bool>(\"use_AB2\", false, \"Whether to use the Adams-Bashforth 2 predictor\");\n  params.addParam<bool>(\"use_littlef\", false, \"if a function evaluation should be used or time deriv's in predictors\");\n  params.addParam<bool>(\"abort_on_solve_fail\", false, \"abort if solve not converged rather than cut timestep\");\n  return params;\n}\n\nTransient::Transient(const std::string & name, InputParameters parameters) :\n    Executioner(name, parameters),\n    _problem(*ProblemFactory::instance()->createFEProblem(_mesh)),\n    _t_step(_problem.timeStep()),\n    _time(_problem.time()),\n    _time_old(_problem.timeOld()),\n    _input_dt(getParam<Real>(\"dt\")),\n    _dt(_problem.dt()),\n    _dt_old(_problem.dtOld()),\n    _prev_dt(-1),\n    _reset_dt(false),\n    _end_time(getParam<Real>(\"end_time\")),\n    _dtmin(getParam<Real>(\"dtmin\")),\n    _dtmax(getParam<Real>(\"dtmax\")),\n    _num_steps(getParam<Real>(\"num_steps\")),\n    _n_startup_steps(getParam<int>(\"n_startup_steps\")),\n    _trans_ss_check(getParam<bool>(\"trans_ss_check\")),\n    _ss_check_tol(getParam<Real>(\"ss_check_tol\")),\n    _ss_tmin(getParam<Real>(\"ss_tmin\")),\n    _old_time_solution_norm(0.0),\n    _converged(true),\n    _sync_times(getParam<std::vector<Real> >(\"sync_times\")),\n    _remaining_sync_time(true),\n    _time_ipol(getParam<std::vector<Real> >(\"time_t\"),\n               getParam<std::vector<Real> >(\"time_dt\")),\n    _use_time_ipol(_time_ipol.getSampleSize() > 0),\n    _growth_factor(getParam<Real>(\"growth_factor\")),\n    _cutback_occurred(false),\n    _abort(getParam<bool>(\"abort_on_solve_fail\"))\n{\n  _t_step = 0;\n  _dt = 0;\n  _time = _time_old = getParam<Real>(\"start_time\");\n  _problem.transient(true);\n  if (parameters.isParamValid(\"predictor_scale\"))\n  {\n    Real predscale(getParam<Real>(\"predictor_scale\"));\n    if (predscale >= 0.0 and predscale <= 1.0)\n    {\n      _problem.getNonlinearSystem().setPredictorScale(getParam<Real>(\"predictor_scale\"));\n    }\n    else\n    {\n      mooseError(\"Input value for predictor_scale = \"<< predscale << \", outside of permissible range (0 to 1)\");\n    }\n  }\n\n  _problem.getTimeScheme()->_use_AB2 = getParam<bool>(\"use_AB2\");\n  _problem.getTimeScheme()->_use_littlef = getParam<bool>(\"use_littlef\");\n  if (!_restart_file_base.empty())\n    _problem.setRestartFile(_restart_file_base);\n}\n\nTransient::~Transient()\n{\n  \/\/ This problem was built by the Factory and needs to be released by this destructor\n  delete &_problem;\n}\n\nvoid\nTransient::execute()\n{\n  _problem.initialSetup();\n\n  preExecute();\n\n  \/\/ Start time loop...\n  while(keepGoing())\n  {\n    takeStep();\n    if (lastSolveConverged())\n      endStep();\n  }\n  postExecute();\n}\n\nvoid\nTransient::takeStep(Real input_dt)\n{\n  if (_converged)\n    _problem.copyOldSolutions();\n  else\n    _problem.restoreSolutions();\n\n  _dt_old = _dt;\n  if (input_dt == -1.0)\n    _dt = computeConstrainedDT();\n  else\n    _dt = input_dt;\n\n  _problem.onTimestepBegin();\n  if (_converged)\n  {\n    \/\/ Update backward material data structures\n    _problem.updateMaterials();\n  }\n\n  \/\/ Increment time\n  _time = _time_old + _dt;\n\n  std::cout<<\"DT: \"<<_dt<<std::endl;\n\n  std::cout << \" Solving time step \";\n  {\n    OStringStream out;\n\n    OSSInt(out,2,_t_step);\n    out << \", time=\";\n    OSSRealzeroleft(out, 9, 6, _time);\n    out <<  \"...\";\n    std::cout << out.str() << std::endl;\n  }\n\n  preSolve();\n\n  _problem.timestepSetup();\n\n  \/\/ Compute Pre-Aux User Objects (Timestep begin)\n  _problem.computeUserObjects(EXEC_TIMESTEP_BEGIN, UserObjectWarehouse::PRE_AUX);\n\n  \/\/ Compute TimestepBegin AuxKernels\n  _problem.computeAuxiliaryKernels(EXEC_TIMESTEP_BEGIN);\n\n  \/\/ Compute Post-Aux User Objects (Timestep begin)\n  _problem.computeUserObjects(EXEC_TIMESTEP_BEGIN, UserObjectWarehouse::POST_AUX);\n\n  _problem.solve();\n\n  _converged = _problem.converged();\n\n  \/\/ Compute Pre-Aux User Objects\n  _problem.computeUserObjects(EXEC_TIMESTEP, UserObjectWarehouse::PRE_AUX);\n\n  postSolve();\n\n  _problem.onTimestepEnd();\n\n  \/\/ We know whether or not the nonlinear solver thinks it converged, but we need to see if the executioner concurs\n  bool last_solve_converged = lastSolveConverged();\n\n  \/\/ If _reset_dt is true, the time step was synced to the user defined value and we dump the solution in an output file\n  if (last_solve_converged)\n  {\n    _problem.computeUserObjects(EXEC_TIMESTEP, UserObjectWarehouse::POST_AUX);\n  }\n}\n\nvoid\nTransient::endStep()\n{\n  \/\/ Compute the Error Indicators and Markers\n  _problem.computeIndicatorsAndMarkers();\n\n  \/\/ if _reset_dt is true, force the output no matter what\n  _problem.output(_reset_dt);\n  _problem.outputPostprocessors(_reset_dt);\n\n#ifdef LIBMESH_ENABLE_AMR\n  if (_problem.adaptivity().isOn())\n  {\n    _problem.adaptMesh();\n    _problem.out().meshChanged();\n  }\n#endif\n\n  _time_old = _time;\n  _t_step++;\n}\n\nReal\nTransient::computeConstrainedDT()\n{\n  \/\/ If this is the first step\n  if (_t_step == 0)\n  {\n    _t_step = 1;\n    _dt = _input_dt;\n  }\n\n\/\/  \/\/ If start up steps are needed\n\/\/  if(_t_step == 1 && _n_startup_steps > 1)\n\/\/    _dt = _input_dt\/(double)(_n_startup_steps);\n\/\/  else if (_t_step == 1+_n_startup_steps && _n_startup_steps > 1)\n\/\/    _dt = _input_dt;\n\n  Real dt_cur = _dt;\n  \/\/After startup steps, compute new dt\n  if (_t_step > _n_startup_steps)\n    dt_cur = computeDT();\n\n  \/\/ Don't let the time step size exceed maximum time step size\n  if (dt_cur > _dtmax)\n    dt_cur = _dtmax;\n\n  \/\/ Don't allow time step size to be smaller than minimum time step size\n  if (dt_cur < _dtmin)\n    dt_cur = _dtmin;\n\n  \/\/ Don't let time go beyond simulation end time\n  if (_time + dt_cur > _end_time)\n    dt_cur = _end_time - _time;\n\n  \/\/ Adjust to a sync time if supplied and skipped over\n  if (_remaining_sync_time && _time + dt_cur >= *_curr_sync_time_iter)\n  {\n    dt_cur = *_curr_sync_time_iter - _time;\n    if (++_curr_sync_time_iter == _sync_times.end())\n      _remaining_sync_time = false;\n\n    _prev_dt = _dt;\n\n    _reset_dt = true;\n  }\n  else\n  {\n    if (_reset_dt)\n    {\n      if (_use_time_ipol)\n        dt_cur = _time_ipol.sample(_time);\n      else\n        dt_cur = _prev_dt;\n      _reset_dt = false;\n    }\n  }\n\n  return dt_cur;\n\n}\n\nReal\nTransient::computeDT()\n{\n  if (!lastSolveConverged())\n  {\n    _cutback_occurred = true;\n    \/\/std::cout<<\"Solve failed... cutting timestep\"<<std::endl;\n    \/\/return _dt \/ 2.0;\n\n    \/\/ Instead of blindly cutting timestep, respect dtmin.\n    if (_dt <= _dtmin)\n      mooseError(\"Solve failed and timestep already at or below dtmin, cannot continue!\");\n\n    if (0.5 * _dt >= _dtmin)\n      return 0.5 * _dt;\n\n    else \/\/ (0.5 * _dt < _dtmin)\n      return _dtmin;\n  }\n\n  Real dt = _dt;\n  if (_use_time_ipol)\n  {\n    dt = _time_ipol.sample(_time);\n    if (_cutback_occurred &&\n        dt > _dt * _growth_factor)\n    {\n      dt = _dt * _growth_factor;\n    }\n  }\n\n  _cutback_occurred = false;\n  return dt;\n}\n\nbool\nTransient::keepGoing()\n{\n  \/\/ Check for stop condition based upon steady-state check flag:\n  if(_converged && _trans_ss_check == true && _time > _ss_tmin)\n  {\n    \/\/ Compute new time solution l2_norm\n    Real new_time_solution_norm = _problem.getNonlinearSystem().currentSolution()->l2_norm();\n\n    \/\/ Compute l2_norm relative error\n    Real ss_relerr_norm = fabs(new_time_solution_norm - _old_time_solution_norm)\/new_time_solution_norm;\n\n    \/\/ Check current solution relative error norm against steady-state tolerance\n    if(ss_relerr_norm < _ss_check_tol)\n    {\n      std::cout<<\"Steady-State Solution Achieved at time: \"<<_time<<std::endl;\n      return false;\n    }\n    else \/\/ Keep going\n    {\n      \/\/ Update solution norm for next time step\n      _old_time_solution_norm = new_time_solution_norm;\n      \/\/ Print steady-state relative error norm\n      std::cout<<\"Steady-State Relative Differential Norm: \"<<ss_relerr_norm<<std::endl;\n    }\n  }\n\n  if(!_converged && _abort)\n  {\n    std::cout<<\"Aborting as solve did not converge and input selected to abort\"<<std::endl;\n    return false;\n  }\n\n  \/\/ Check for stop condition based upon number of simulation steps and\/or solution end time:\n  if(_t_step>_num_steps)\n    return false;\n\n  if((_time>_end_time) || (fabs(_time-_end_time)<1.e-14))\n    return false;\n\n  return true;\n}\n\n\nbool\nTransient::lastSolveConverged()\n{\n  return _converged;\n}\n\nvoid\nTransient::preExecute()\n{\n  \/\/ process time periods\n  const std::vector<TimePeriod *> _time_periods = _problem.getTimePeriods();\n  for (unsigned int i = 0; i < _time_periods.size(); ++i)\n    _sync_times.push_back(_time_periods[i]->start());\n\n  const std::vector<Real> & time = getParam<std::vector<Real> >(\"time_t\");\n  if (_use_time_ipol)\n    _sync_times.insert(_sync_times.end(), time.begin()+1, time.end());          \/\/ insert times as sync points except the very first one\n  sort(_sync_times.begin(), _sync_times.end());\n  _sync_times.erase(std::unique(_sync_times.begin(), _sync_times.end()), _sync_times.end());    \/\/ remove duplicates (needs sorted array)\n\n  \/\/ Advance to the first sync time if one is provided in sim time range\n  _curr_sync_time_iter = _sync_times.begin();\n  while (_remaining_sync_time && *_curr_sync_time_iter <= _time)\n    if (++_curr_sync_time_iter == _sync_times.end())\n      _remaining_sync_time = false;\n}\n<commit_msg>Solutions are copied\/restored in endStep() not at the beginning of the time step (closes #1373)<commit_after>\/****************************************************************\/\n\/*               DO NOT MODIFY THIS HEADER                      *\/\n\/* MOOSE - Multiphysics Object Oriented Simulation Environment  *\/\n\/*                                                              *\/\n\/*           (c) 2010 Battelle Energy Alliance, LLC             *\/\n\/*                   ALL RIGHTS RESERVED                        *\/\n\/*                                                              *\/\n\/*          Prepared by Battelle Energy Alliance, LLC           *\/\n\/*            Under Contract No. DE-AC07-05ID14517              *\/\n\/*            With the U. S. Department of Energy               *\/\n\/*                                                              *\/\n\/*            See COPYRIGHT for full restrictions               *\/\n\/****************************************************************\/\n\n#include \"Transient.h\"\n\n\/\/Moose includes\n#include \"Kernel.h\"\n#include \"Factory.h\"\n#include \"SubProblem.h\"\n#include \"ProblemFactory.h\"\n#include \"TimePeriod.h\"\n#include \"TimeScheme.h\"\n\/\/libMesh includes\n#include \"implicit_system.h\"\n#include \"nonlinear_implicit_system.h\"\n#include \"transient_system.h\"\n#include \"numeric_vector.h\"\n#include \"o_string_stream.h\"\n\n\/\/ C++ Includes\n#include <iomanip>\n#include <iostream>\n#include <fstream>\n\ntemplate<>\nInputParameters validParams<Transient>()\n{\n  InputParameters params = validParams<Executioner>();\n  std::vector<Real> sync_times(1);\n  sync_times[0] = -1;\n\n  params.addParam<Real>(\"start_time\",      0.0,    \"The start time of the simulation\");\n  params.addParam<Real>(\"end_time\",        1.0e30, \"The end time of the simulation\");\n  params.addRequiredParam<Real>(\"dt\", \"The timestep size between solves\");\n  params.addParam<Real>(\"dtmin\",           0.0,    \"The minimum timestep size in an adaptive run\");\n  params.addParam<Real>(\"dtmax\",           1.0e30, \"The maximum timestep size in an adaptive run\");\n  params.addParam<Real>(\"num_steps\",       std::numeric_limits<Real>::max(),     \"The number of timesteps in a transient run\");\n  params.addParam<int> (\"n_startup_steps\", 0,      \"The number of timesteps during startup\");\n  params.addParam<bool>(\"trans_ss_check\",  false,  \"Whether or not to check for steady state conditions\");\n  params.addParam<Real>(\"ss_check_tol\",    1.0e-08,\"Whenever the relative residual changes by less than this the solution will be considered to be at steady state.\");\n  params.addParam<Real>(\"ss_tmin\",         0.0,    \"Minimum number of timesteps to take before checking for steady state conditions.\");\n  params.addParam<std::vector<Real> >(\"sync_times\", sync_times, \"A list of times that will be solved for provided they are within the simulation time\");\n  params.addParam<std::vector<Real> >(\"time_t\", \"The values of t\");\n  params.addParam<std::vector<Real> >(\"time_dt\", \"The values of dt\");\n  params.addParam<Real>(\"growth_factor\", 2, \"Maximum ratio of new to previous timestep sizes following a step that required the time step to be cut due to a failed solve.  For use with 'time_t' and 'time_dt'.\");\n  params.addParam<Real>(\"predictor_scale\", \"The scale factor for the predictor (can range from 0 to 1)\");\n\n  params.addParam<std::vector<std::string> >(\"time_periods\", \"The names of periods\");\n  params.addParam<std::vector<Real> >(\"time_period_starts\", \"The start times of time periods\");\n  params.addParam<std::vector<Real> >(\"time_period_ends\", \"The end times of time periods\");\n  params.addParam<bool>(\"use_AB2\", false, \"Whether to use the Adams-Bashforth 2 predictor\");\n  params.addParam<bool>(\"use_littlef\", false, \"if a function evaluation should be used or time deriv's in predictors\");\n  params.addParam<bool>(\"abort_on_solve_fail\", false, \"abort if solve not converged rather than cut timestep\");\n  return params;\n}\n\nTransient::Transient(const std::string & name, InputParameters parameters) :\n    Executioner(name, parameters),\n    _problem(*ProblemFactory::instance()->createFEProblem(_mesh)),\n    _t_step(_problem.timeStep()),\n    _time(_problem.time()),\n    _time_old(_problem.timeOld()),\n    _input_dt(getParam<Real>(\"dt\")),\n    _dt(_problem.dt()),\n    _dt_old(_problem.dtOld()),\n    _prev_dt(-1),\n    _reset_dt(false),\n    _end_time(getParam<Real>(\"end_time\")),\n    _dtmin(getParam<Real>(\"dtmin\")),\n    _dtmax(getParam<Real>(\"dtmax\")),\n    _num_steps(getParam<Real>(\"num_steps\")),\n    _n_startup_steps(getParam<int>(\"n_startup_steps\")),\n    _trans_ss_check(getParam<bool>(\"trans_ss_check\")),\n    _ss_check_tol(getParam<Real>(\"ss_check_tol\")),\n    _ss_tmin(getParam<Real>(\"ss_tmin\")),\n    _old_time_solution_norm(0.0),\n    _converged(true),\n    _sync_times(getParam<std::vector<Real> >(\"sync_times\")),\n    _remaining_sync_time(true),\n    _time_ipol(getParam<std::vector<Real> >(\"time_t\"),\n               getParam<std::vector<Real> >(\"time_dt\")),\n    _use_time_ipol(_time_ipol.getSampleSize() > 0),\n    _growth_factor(getParam<Real>(\"growth_factor\")),\n    _cutback_occurred(false),\n    _abort(getParam<bool>(\"abort_on_solve_fail\"))\n{\n  _t_step = 0;\n  _dt = 0;\n  _time = _time_old = getParam<Real>(\"start_time\");\n  _problem.transient(true);\n  if (parameters.isParamValid(\"predictor_scale\"))\n  {\n    Real predscale(getParam<Real>(\"predictor_scale\"));\n    if (predscale >= 0.0 and predscale <= 1.0)\n    {\n      _problem.getNonlinearSystem().setPredictorScale(getParam<Real>(\"predictor_scale\"));\n    }\n    else\n    {\n      mooseError(\"Input value for predictor_scale = \"<< predscale << \", outside of permissible range (0 to 1)\");\n    }\n  }\n\n  _problem.getTimeScheme()->_use_AB2 = getParam<bool>(\"use_AB2\");\n  _problem.getTimeScheme()->_use_littlef = getParam<bool>(\"use_littlef\");\n  if (!_restart_file_base.empty())\n    _problem.setRestartFile(_restart_file_base);\n}\n\nTransient::~Transient()\n{\n  \/\/ This problem was built by the Factory and needs to be released by this destructor\n  delete &_problem;\n}\n\nvoid\nTransient::execute()\n{\n  _problem.initialSetup();\n\n  preExecute();\n\n  \/\/ NOTE: if you remove this line, you will see a subset of tests failing. Those tests might have a wrong answer and might need to be regolded.\n  \/\/ The reason is that we actually move the solution back in time before we actually start solving (which I think is wrong).  So this call here\n  \/\/ is to maintain backward compatibility and so that MOOSE is giving the same answer.  However, we might remove this call and regold the test\n  \/\/ in the future eventually.\n  _problem.copyOldSolutions();\n\n  \/\/ Start time loop...\n  while(keepGoing())\n  {\n    takeStep();\n    endStep();\n  }\n  postExecute();\n}\n\nvoid\nTransient::takeStep(Real input_dt)\n{\n  _dt_old = _dt;\n  if (input_dt == -1.0)\n    _dt = computeConstrainedDT();\n  else\n    _dt = input_dt;\n\n  _problem.onTimestepBegin();\n  if (_converged)\n  {\n    \/\/ Update backward material data structures\n    _problem.updateMaterials();\n  }\n\n  \/\/ Increment time\n  _time = _time_old + _dt;\n\n  std::cout<<\"DT: \"<<_dt<<std::endl;\n\n  std::cout << \" Solving time step \";\n  {\n    OStringStream out;\n\n    OSSInt(out,2,_t_step);\n    out << \", time=\";\n    OSSRealzeroleft(out, 9, 6, _time);\n    out <<  \"...\";\n    std::cout << out.str() << std::endl;\n  }\n\n  preSolve();\n\n  _problem.timestepSetup();\n\n  \/\/ Compute Pre-Aux User Objects (Timestep begin)\n  _problem.computeUserObjects(EXEC_TIMESTEP_BEGIN, UserObjectWarehouse::PRE_AUX);\n\n  \/\/ Compute TimestepBegin AuxKernels\n  _problem.computeAuxiliaryKernels(EXEC_TIMESTEP_BEGIN);\n\n  \/\/ Compute Post-Aux User Objects (Timestep begin)\n  _problem.computeUserObjects(EXEC_TIMESTEP_BEGIN, UserObjectWarehouse::POST_AUX);\n\n  _problem.solve();\n\n  _converged = _problem.converged();\n\n  \/\/ Compute Pre-Aux User Objects\n  _problem.computeUserObjects(EXEC_TIMESTEP, UserObjectWarehouse::PRE_AUX);\n\n  postSolve();\n\n  _problem.onTimestepEnd();\n\n  \/\/ We know whether or not the nonlinear solver thinks it converged, but we need to see if the executioner concurs\n  bool last_solve_converged = lastSolveConverged();\n\n  \/\/ If _reset_dt is true, the time step was synced to the user defined value and we dump the solution in an output file\n  if (last_solve_converged)\n  {\n    _problem.computeUserObjects(EXEC_TIMESTEP, UserObjectWarehouse::POST_AUX);\n  }\n}\n\nvoid\nTransient::endStep()\n{\n  if (lastSolveConverged())\n  {\n    \/\/ Compute the Error Indicators and Markers\n    _problem.computeIndicatorsAndMarkers();\n\n    \/\/ if _reset_dt is true, force the output no matter what\n    _problem.output(_reset_dt);\n    _problem.outputPostprocessors(_reset_dt);\n\n#ifdef LIBMESH_ENABLE_AMR\n    if (_problem.adaptivity().isOn())\n    {\n      _problem.adaptMesh();\n      _problem.out().meshChanged();\n    }\n#endif\n\n    _time_old = _time;\n    _t_step++;\n\n    _problem.copyOldSolutions();\n  }\n  else\n    _problem.restoreSolutions();\n}\n\nReal\nTransient::computeConstrainedDT()\n{\n  \/\/ If this is the first step\n  if (_t_step == 0)\n  {\n    _t_step = 1;\n    _dt = _input_dt;\n  }\n\n\/\/  \/\/ If start up steps are needed\n\/\/  if(_t_step == 1 && _n_startup_steps > 1)\n\/\/    _dt = _input_dt\/(double)(_n_startup_steps);\n\/\/  else if (_t_step == 1+_n_startup_steps && _n_startup_steps > 1)\n\/\/    _dt = _input_dt;\n\n  Real dt_cur = _dt;\n  \/\/After startup steps, compute new dt\n  if (_t_step > _n_startup_steps)\n    dt_cur = computeDT();\n\n  \/\/ Don't let the time step size exceed maximum time step size\n  if (dt_cur > _dtmax)\n    dt_cur = _dtmax;\n\n  \/\/ Don't allow time step size to be smaller than minimum time step size\n  if (dt_cur < _dtmin)\n    dt_cur = _dtmin;\n\n  \/\/ Don't let time go beyond simulation end time\n  if (_time + dt_cur > _end_time)\n    dt_cur = _end_time - _time;\n\n  \/\/ Adjust to a sync time if supplied and skipped over\n  if (_remaining_sync_time && _time + dt_cur >= *_curr_sync_time_iter)\n  {\n    dt_cur = *_curr_sync_time_iter - _time;\n    if (++_curr_sync_time_iter == _sync_times.end())\n      _remaining_sync_time = false;\n\n    _prev_dt = _dt;\n\n    _reset_dt = true;\n  }\n  else\n  {\n    if (_reset_dt)\n    {\n      if (_use_time_ipol)\n        dt_cur = _time_ipol.sample(_time);\n      else\n        dt_cur = _prev_dt;\n      _reset_dt = false;\n    }\n  }\n\n  return dt_cur;\n\n}\n\nReal\nTransient::computeDT()\n{\n  if (!lastSolveConverged())\n  {\n    _cutback_occurred = true;\n    \/\/std::cout<<\"Solve failed... cutting timestep\"<<std::endl;\n    \/\/return _dt \/ 2.0;\n\n    \/\/ Instead of blindly cutting timestep, respect dtmin.\n    if (_dt <= _dtmin)\n      mooseError(\"Solve failed and timestep already at or below dtmin, cannot continue!\");\n\n    if (0.5 * _dt >= _dtmin)\n      return 0.5 * _dt;\n\n    else \/\/ (0.5 * _dt < _dtmin)\n      return _dtmin;\n  }\n\n  Real dt = _dt;\n  if (_use_time_ipol)\n  {\n    dt = _time_ipol.sample(_time);\n    if (_cutback_occurred &&\n        dt > _dt * _growth_factor)\n    {\n      dt = _dt * _growth_factor;\n    }\n  }\n\n  _cutback_occurred = false;\n  return dt;\n}\n\nbool\nTransient::keepGoing()\n{\n  \/\/ Check for stop condition based upon steady-state check flag:\n  if(_converged && _trans_ss_check == true && _time > _ss_tmin)\n  {\n    \/\/ Compute new time solution l2_norm\n    Real new_time_solution_norm = _problem.getNonlinearSystem().currentSolution()->l2_norm();\n\n    \/\/ Compute l2_norm relative error\n    Real ss_relerr_norm = fabs(new_time_solution_norm - _old_time_solution_norm)\/new_time_solution_norm;\n\n    \/\/ Check current solution relative error norm against steady-state tolerance\n    if(ss_relerr_norm < _ss_check_tol)\n    {\n      std::cout<<\"Steady-State Solution Achieved at time: \"<<_time<<std::endl;\n      return false;\n    }\n    else \/\/ Keep going\n    {\n      \/\/ Update solution norm for next time step\n      _old_time_solution_norm = new_time_solution_norm;\n      \/\/ Print steady-state relative error norm\n      std::cout<<\"Steady-State Relative Differential Norm: \"<<ss_relerr_norm<<std::endl;\n    }\n  }\n\n  if(!_converged && _abort)\n  {\n    std::cout<<\"Aborting as solve did not converge and input selected to abort\"<<std::endl;\n    return false;\n  }\n\n  \/\/ Check for stop condition based upon number of simulation steps and\/or solution end time:\n  if(_t_step>_num_steps)\n    return false;\n\n  if((_time>_end_time) || (fabs(_time-_end_time)<1.e-14))\n    return false;\n\n  return true;\n}\n\n\nbool\nTransient::lastSolveConverged()\n{\n  return _converged;\n}\n\nvoid\nTransient::preExecute()\n{\n  \/\/ process time periods\n  const std::vector<TimePeriod *> _time_periods = _problem.getTimePeriods();\n  for (unsigned int i = 0; i < _time_periods.size(); ++i)\n    _sync_times.push_back(_time_periods[i]->start());\n\n  const std::vector<Real> & time = getParam<std::vector<Real> >(\"time_t\");\n  if (_use_time_ipol)\n    _sync_times.insert(_sync_times.end(), time.begin()+1, time.end());          \/\/ insert times as sync points except the very first one\n  sort(_sync_times.begin(), _sync_times.end());\n  _sync_times.erase(std::unique(_sync_times.begin(), _sync_times.end()), _sync_times.end());    \/\/ remove duplicates (needs sorted array)\n\n  \/\/ Advance to the first sync time if one is provided in sim time range\n  _curr_sync_time_iter = _sync_times.begin();\n  while (_remaining_sync_time && *_curr_sync_time_iter <= _time)\n    if (++_curr_sync_time_iter == _sync_times.end())\n      _remaining_sync_time = false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <ventura\/file_operations.hpp>\n#include <ventura\/write_file.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <fstream>\n\n#if VENTURA_HAS_ABSOLUTE_PATH_OPERATIONS\n\n#ifdef _WIN32\n#define SILICIUM_TEST_ROOT L\"C:\/\"\n#else\n#define SILICIUM_TEST_ROOT \"\/\"\n#endif\n\nnamespace\n{\n\tventura::absolute_path const absolute_root = *ventura::absolute_path::create(SILICIUM_TEST_ROOT);\n}\n\nBOOST_AUTO_TEST_CASE(get_current_executable_path)\n{\n\tSi::error_or<ventura::absolute_path> const p = ventura::get_current_executable_path();\n\tBOOST_REQUIRE(!p.is_error());\n\tauto const expected = \"unit_test\"\n#ifdef _WIN32\n\t                      \".exe\"\n#endif\n\t    ;\n\tBOOST_CHECK_EQUAL(expected, p.get().to_boost_path().leaf());\n}\n\nBOOST_AUTO_TEST_CASE(get_current_executable_path_throw)\n{\n\tventura::absolute_path p = ventura::get_current_executable_path(Si::throw_);\n\tauto const expected = \"unit_test\"\n#ifdef _WIN32\n\t                      \".exe\"\n#endif\n\t    ;\n\tBOOST_CHECK_EQUAL(expected, p.to_boost_path().leaf());\n}\n\nBOOST_AUTO_TEST_CASE(get_current_executable_path_variant)\n{\n\tSi::error_or<ventura::absolute_path> const p = ventura::get_current_executable_path(Si::variant_);\n\tBOOST_REQUIRE(!p.is_error());\n\tauto const expected = \"unit_test\"\n#ifdef _WIN32\n\t                      \".exe\"\n#endif\n\t    ;\n\tBOOST_CHECK_EQUAL(expected, p.get().to_boost_path().leaf());\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_true)\n{\n\tSi::error_or<bool> const exists = ventura::file_exists(absolute_root);\n\tBOOST_CHECK(exists.get());\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_true_throw)\n{\n\tbool exists = ventura::file_exists(absolute_root, Si::throw_);\n\tBOOST_CHECK(exists);\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_true_variant)\n{\n\tSi::error_or<bool> const exists = ventura::file_exists(absolute_root, Si::variant_);\n\tBOOST_CHECK(exists.get());\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_false)\n{\n\tSi::error_or<bool> const exists =\n\t    ventura::file_exists(absolute_root \/ *ventura::path_segment::create(\"does-not-exist\"));\n\tBOOST_CHECK(!exists.get());\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_false_throw)\n{\n\tbool exists = ventura::file_exists(absolute_root \/ *ventura::path_segment::create(\"does-not-exist\"), Si::throw_);\n\tBOOST_CHECK(!exists);\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_false_variant)\n{\n\tSi::error_or<bool> const exists =\n\t    ventura::file_exists(absolute_root \/ *ventura::path_segment::create(\"does-not-exist\"), Si::variant_);\n\tBOOST_CHECK(!exists.get());\n}\n\nBOOST_AUTO_TEST_CASE(test_rename)\n{\n\tventura::absolute_path const from = ventura::temporary_directory().get() \/ ventura::unique_path();\n\tventura::create_file(from).move_value();\n\tventura::absolute_path const to = ventura::temporary_directory().get() \/ ventura::unique_path();\n\tBOOST_CHECK(!ventura::file_exists(to).get());\n\tboost::system::error_code const error = ventura::rename(from, to);\n\tBOOST_CHECK(ventura::file_exists(to).get());\n\tBOOST_CHECK(!error);\n}\n\nBOOST_AUTO_TEST_CASE(test_temporary_directory)\n{\n\tSi::error_or<ventura::absolute_path> const p = ventura::temporary_directory();\n\tBOOST_REQUIRE(!p.is_error());\n\tBOOST_CHECK(!p.get().empty());\n}\n\nBOOST_AUTO_TEST_CASE(test_temporary_directory_throw)\n{\n\tventura::absolute_path const p = ventura::temporary_directory(Si::throw_);\n\tBOOST_CHECK(!p.empty());\n}\n\nBOOST_AUTO_TEST_CASE(test_temporary_directory_variant)\n{\n\tSi::error_or<ventura::absolute_path> const p = ventura::temporary_directory(Si::variant_);\n\tBOOST_REQUIRE(!p.is_error());\n\tBOOST_CHECK(!p.get().empty());\n}\n\nBOOST_AUTO_TEST_CASE(test_get_home)\n{\n\tventura::absolute_path const home = ventura::get_home();\n#ifdef _WIN32\n\tBOOST_CHECK(boost::algorithm::starts_with(to_os_string(home), \"C:\/Users\/\"));\n\tBOOST_CHECK(boost::algorithm::ends_with(to_os_string(home), \"\/AppData\/Local\"));\n#elif defined(__linux__)\n\tBOOST_CHECK(boost::algorithm::starts_with(ventura::to_os_string(home), \"\/home\/\"));\n#else\n\t\/\/ OSX\n\tBOOST_CHECK(boost::algorithm::starts_with(to_os_string(home), \"\/Users\/\"));\n#endif\n}\n\nBOOST_AUTO_TEST_CASE(test_copy_recursively)\n{\n\tventura::absolute_path const temp =\n\t    ventura::temporary_directory(Si::throw_) \/ ventura::relative_path(\"silicium-test_copy_recursively\");\n\tventura::recreate_directories(temp, Si::throw_);\n\tventura::absolute_path const from = temp \/ ventura::relative_path(\"from\");\n\tventura::absolute_path const to = temp \/ ventura::relative_path(\"to\");\n\tventura::create_directories(from, Si::throw_);\n\tauto const expected = Si::make_c_str_range(\"Hello\");\n\tSi::throw_if_error(ventura::write_file(\n\t    Si::native_path_string(to_os_string(from \/ ventura::relative_path(\"file.txt\")).c_str()), expected));\n\tventura::copy_recursively(from, to, nullptr, Si::throw_);\n\tstd::ifstream file((to \/ ventura::relative_path(\"file.txt\")).c_str(), std::ios::binary);\n\tBOOST_REQUIRE(file);\n\tstd::vector<char> const file_content((std::istreambuf_iterator<char>(file)), std::istreambuf_iterator<char>());\n\tBOOST_CHECK_EQUAL_COLLECTIONS(file_content.begin(), file_content.end(), expected.begin(), expected.end());\n}\n#endif\n<commit_msg>more tests for copy_recursively<commit_after>#include <ventura\/file_operations.hpp>\n#include <ventura\/write_file.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <fstream>\n\n#if VENTURA_HAS_ABSOLUTE_PATH_OPERATIONS\n\n#ifdef _WIN32\n#define SILICIUM_TEST_ROOT L\"C:\/\"\n#else\n#define SILICIUM_TEST_ROOT \"\/\"\n#endif\n\nnamespace\n{\n\tventura::absolute_path const absolute_root = *ventura::absolute_path::create(SILICIUM_TEST_ROOT);\n}\n\nBOOST_AUTO_TEST_CASE(get_current_executable_path)\n{\n\tSi::error_or<ventura::absolute_path> const p = ventura::get_current_executable_path();\n\tBOOST_REQUIRE(!p.is_error());\n\tauto const expected = \"unit_test\"\n#ifdef _WIN32\n\t                      \".exe\"\n#endif\n\t    ;\n\tBOOST_CHECK_EQUAL(expected, p.get().to_boost_path().leaf());\n}\n\nBOOST_AUTO_TEST_CASE(get_current_executable_path_throw)\n{\n\tventura::absolute_path p = ventura::get_current_executable_path(Si::throw_);\n\tauto const expected = \"unit_test\"\n#ifdef _WIN32\n\t                      \".exe\"\n#endif\n\t    ;\n\tBOOST_CHECK_EQUAL(expected, p.to_boost_path().leaf());\n}\n\nBOOST_AUTO_TEST_CASE(get_current_executable_path_variant)\n{\n\tSi::error_or<ventura::absolute_path> const p = ventura::get_current_executable_path(Si::variant_);\n\tBOOST_REQUIRE(!p.is_error());\n\tauto const expected = \"unit_test\"\n#ifdef _WIN32\n\t                      \".exe\"\n#endif\n\t    ;\n\tBOOST_CHECK_EQUAL(expected, p.get().to_boost_path().leaf());\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_true)\n{\n\tSi::error_or<bool> const exists = ventura::file_exists(absolute_root);\n\tBOOST_CHECK(exists.get());\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_true_throw)\n{\n\tbool exists = ventura::file_exists(absolute_root, Si::throw_);\n\tBOOST_CHECK(exists);\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_true_variant)\n{\n\tSi::error_or<bool> const exists = ventura::file_exists(absolute_root, Si::variant_);\n\tBOOST_CHECK(exists.get());\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_false)\n{\n\tSi::error_or<bool> const exists =\n\t    ventura::file_exists(absolute_root \/ *ventura::path_segment::create(\"does-not-exist\"));\n\tBOOST_CHECK(!exists.get());\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_false_throw)\n{\n\tbool exists = ventura::file_exists(absolute_root \/ *ventura::path_segment::create(\"does-not-exist\"), Si::throw_);\n\tBOOST_CHECK(!exists);\n}\n\nBOOST_AUTO_TEST_CASE(test_file_exists_false_variant)\n{\n\tSi::error_or<bool> const exists =\n\t    ventura::file_exists(absolute_root \/ *ventura::path_segment::create(\"does-not-exist\"), Si::variant_);\n\tBOOST_CHECK(!exists.get());\n}\n\nBOOST_AUTO_TEST_CASE(test_rename)\n{\n\tventura::absolute_path const from = ventura::temporary_directory().get() \/ ventura::unique_path();\n\tventura::create_file(from).move_value();\n\tventura::absolute_path const to = ventura::temporary_directory().get() \/ ventura::unique_path();\n\tBOOST_CHECK(!ventura::file_exists(to).get());\n\tboost::system::error_code const error = ventura::rename(from, to);\n\tBOOST_CHECK(ventura::file_exists(to).get());\n\tBOOST_CHECK(!error);\n}\n\nBOOST_AUTO_TEST_CASE(test_temporary_directory)\n{\n\tSi::error_or<ventura::absolute_path> const p = ventura::temporary_directory();\n\tBOOST_REQUIRE(!p.is_error());\n\tBOOST_CHECK(!p.get().empty());\n}\n\nBOOST_AUTO_TEST_CASE(test_temporary_directory_throw)\n{\n\tventura::absolute_path const p = ventura::temporary_directory(Si::throw_);\n\tBOOST_CHECK(!p.empty());\n}\n\nBOOST_AUTO_TEST_CASE(test_temporary_directory_variant)\n{\n\tSi::error_or<ventura::absolute_path> const p = ventura::temporary_directory(Si::variant_);\n\tBOOST_REQUIRE(!p.is_error());\n\tBOOST_CHECK(!p.get().empty());\n}\n\nBOOST_AUTO_TEST_CASE(test_get_home)\n{\n\tventura::absolute_path const home = ventura::get_home();\n#ifdef _WIN32\n\tBOOST_CHECK(boost::algorithm::starts_with(to_os_string(home), \"C:\/Users\/\"));\n\tBOOST_CHECK(boost::algorithm::ends_with(to_os_string(home), \"\/AppData\/Local\"));\n#elif defined(__linux__)\n\tBOOST_CHECK(boost::algorithm::starts_with(ventura::to_os_string(home), \"\/home\/\"));\n#else\n\t\/\/ OSX\n\tBOOST_CHECK(boost::algorithm::starts_with(to_os_string(home), \"\/Users\/\"));\n#endif\n}\n\nBOOST_AUTO_TEST_CASE(test_copy_recursively_exists)\n{\n\tventura::absolute_path const temp =\n\t    ventura::temporary_directory(Si::throw_) \/ ventura::relative_path(\"silicium-test_copy_recursively\");\n\tventura::recreate_directories(temp, Si::throw_);\n\tventura::absolute_path const from = temp \/ ventura::relative_path(\"from\");\n\tventura::absolute_path const to = temp \/ ventura::relative_path(\"to\");\n\tventura::create_directories(from, Si::throw_);\n\tauto const expected = Si::make_c_str_range(\"Hello\");\n\tSi::throw_if_error(ventura::write_file(\n\t    Si::native_path_string(to_os_string(from \/ ventura::relative_path(\"file.txt\")).c_str()), expected));\n\tventura::create_directories(to, Si::throw_);\n\tventura::copy_recursively(from, to, nullptr, Si::throw_);\n\tBOOST_REQUIRE(ventura::file_exists(to).get());\n\tstd::ifstream file((to \/ ventura::relative_path(\"file.txt\")).c_str(), std::ios::binary);\n\tBOOST_REQUIRE(file);\n\tstd::vector<char> const file_content((std::istreambuf_iterator<char>(file)), std::istreambuf_iterator<char>());\n\tBOOST_CHECK_EQUAL_COLLECTIONS(file_content.begin(), file_content.end(), expected.begin(), expected.end());\n}\n\nBOOST_AUTO_TEST_CASE(test_copy_recursively_does_not_exist)\n{\n\tventura::absolute_path const temp =\n\t\tventura::temporary_directory(Si::throw_) \/ ventura::relative_path(\"silicium-test_copy_recursively\");\n\tventura::recreate_directories(temp, Si::throw_);\n\tventura::absolute_path const from = temp \/ ventura::relative_path(\"from\");\n\tventura::absolute_path const to = temp \/ ventura::relative_path(\"to\");\n\tventura::create_directories(from, Si::throw_);\n\tauto const expected = Si::make_c_str_range(\"Hello\");\n\tSi::throw_if_error(ventura::write_file(\n\t\tSi::native_path_string(to_os_string(from \/ ventura::relative_path(\"file.txt\")).c_str()), expected));\n\tBOOST_REQUIRE(!ventura::file_exists(to).get());\n\tventura::copy_recursively(from, to, nullptr, Si::throw_);\n\tBOOST_REQUIRE(ventura::file_exists(to).get());\n\tstd::ifstream file((to \/ ventura::relative_path(\"file.txt\")).c_str(), std::ios::binary);\n\tBOOST_REQUIRE(file);\n\tstd::vector<char> const file_content((std::istreambuf_iterator<char>(file)), std::istreambuf_iterator<char>());\n\tBOOST_CHECK_EQUAL_COLLECTIONS(file_content.begin(), file_content.end(), expected.begin(), expected.end());\n}\n\nBOOST_AUTO_TEST_CASE(test_copy_recursively_parent_does_not_exist)\n{\n\tventura::absolute_path const temp =\n\t\tventura::temporary_directory(Si::throw_) \/ ventura::relative_path(\"silicium-test_copy_recursively\");\n\tventura::recreate_directories(temp, Si::throw_);\n\tventura::absolute_path const from = temp \/ ventura::relative_path(\"from\");\n\tventura::absolute_path const to = temp \/ ventura::relative_path(\"parent\/to\");\n\tventura::create_directories(from, Si::throw_);\n\tauto const expected = Si::make_c_str_range(\"Hello\");\n\tSi::throw_if_error(ventura::write_file(\n\t\tSi::native_path_string(to_os_string(from \/ ventura::relative_path(\"file.txt\")).c_str()), expected));\n\tBOOST_REQUIRE(!ventura::file_exists(to).get());\n\tventura::copy_recursively(from, to, nullptr, Si::throw_);\n\tBOOST_REQUIRE(ventura::file_exists(to).get());\n\tstd::ifstream file((to \/ ventura::relative_path(\"file.txt\")).c_str(), std::ios::binary);\n\tBOOST_REQUIRE(file);\n\tstd::vector<char> const file_content((std::istreambuf_iterator<char>(file)), std::istreambuf_iterator<char>());\n\tBOOST_CHECK_EQUAL_COLLECTIONS(file_content.begin(), file_content.end(), expected.begin(), expected.end());\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/******************************************************************************************\n\/\/  File: EX_RGB_NeoPixelBus.h\n\/\/  Authors: Allan (vseven) based on EX_Switch_Dim by Dan G Ogorchock\n\/\/\n\/\/  Summary:  EX_RGB_NeoPixelBus is a class which implements the SmartThings \"Color Control\", \"Switch\", and \"Switch Level\" device capabilities.\n\/\/\t\t\t  It inherits from the st::Executor class.\n\/\/\n\/\/\t\t\t  Create an instance of this class in your sketch's global variable section\n\/\/\t\t\t  For Example:  st::EX_RGB_NeoPixelBus executor1(\"rgbSwitch1\", PIN_RGB, PIXEL_COUNT);\n\/\/\n\/\/\t\t\t  st::EX_RGB_NeoPixelBus() constructor requires the following arguments\n\/\/\t\t\t\t- String &name - REQUIRED - the name of the object - must match the Groovy ST_Anything DeviceType tile name.\n\/\/\t\t\t\t- byte pin - REQUIRED - the Arduino Pin to be used as a digital output for the RGB strip\n\/\/\t\t\t\t- byte count - REQUIRED - the number of programmable pixels in the RGB strip\n\/\/\n\/\/  Change History:\n\/\/\n\/\/    Date        Who            What\n\/\/    ----        ---            ----\n\/\/    2016-04-30  Dan Ogorchock  Original Creation\n\/\/    2018-08-14  Dan Ogorchock  Modified to avoid compiler errors on ESP32 since it currently does not support \"analogWrite()\"\n\/\/    2017-08-30  Dan Ogorchock  Modified comment section above to comply with new Parent\/Child Device Handler requirements\n\/\/    2017-10-06  Allan (vseven) Modified original code from EX_Switch_Dim to be used for RGB lighting\n\/\/    2020-08-01  Allan (vseven) Modified the EX_RGB_Dim for use with addressable LED strips using the NeoPixelBus library\n\/\/\n\/\/******************************************************************************************\n#include \"EX_RGB_NeoPixelBus.h\"\n\n#include \"Constants.h\"\n#include \"Everything.h\"\n\n#include <NeoPixelBus.h>\n\nnamespace st\n{\n\n\/\/private\n\tvoid EX_RGB_NeoPixelBus::writeCommandToOutput()\n\t{\n\t\tuint8_t R;\n\t\tuint8_t G;\n\t\tuint8_t B;\n\n\t\tif (st::Executor::debug) {\n\t\t\tSerial.println(\"m_bCurrentState: \" + String(m_bCurrentState));\n\t\t\tSerial.println(\"m_sCurrentHEX: \" + String(m_sCurrentHEX));\n\t\t}\n\n\n\t\tif (m_bCurrentState == HIGH){\n\t\t\t\/\/ Our status is on so get the RGB value from the hex\n\t\t\tString hexstring = m_sCurrentHEX;\n\t\t\tlong number = (long) strtol( &hexstring[1], NULL, 16);\n      \t\t\t\/\/ Split them up into r, g, b values\n      \t\t\tR = number >> 16;\n      \t\t\tG = number >> 8 & 0xFF;\n      \t\t\tB = number & 0xFF;\n\t\t} else {\n\t\t\t\/\/ Status is off so turn off LED\n\t\t\tR = 00;\n      \t\t\tG = 00;\n      \t\t\tB = 00;\n\t\t}\n\t\t\n\t\t\/\/ Any adjustments to the colors can be done here before sending the commands.  For example if red is always too bright reduce it:\n\t\t\/\/ R = R * 0.95\n\n\t\t\/\/ Write to our output\n\n\t\tif (st::Executor::debug) {\n\t\t\tSerial.print(F(\"subString R:G:B = \"));\n\t\t\tSerial.println(String(R) + \":\" + String(G) + \":\" + String(B));\n\t\t}\n\n\t\t\/\/ set all pixels to the same color\n\n\t\tRgbColor myColor = RgbColor(R, G, B);\n\n\n\t\tif (st::Executor::debug) {\n\t\t\tSerial.print(F(\"Total number of pixels reported by strip: \"));\n\t\t\tSerial.println(String(m_nStrip.PixelCount()));\n\t\t\t\/\/Serial.print(F(\"Color being sent: \"));\n\t\t\t\/\/Serial.println(String(myColor.r + myColor.g + myColor.b));\n\t\t}\n\n\t\tm_nStrip.ClearTo(myColor);\n\n\t\tif (st::Executor::debug) {\n\t\t\tSerial.println(F(\"All pixels set.  Sending show command.\"));\n\t\t}\n\n\t\t\/\/ then display it\n\t\tm_nStrip.Show();\n\t}\n\n\/\/public\n\t\/\/constructor\n\tEX_RGB_NeoPixelBus::EX_RGB_NeoPixelBus(const __FlashStringHelper *name, byte count, byte pin):\n\t\tExecutor(name),\n\t\tm_nStrip(count,pin)\n\t{\n\n\t}\n\n\t\/\/destructor\n\tEX_RGB_NeoPixelBus::~EX_RGB_NeoPixelBus()\n\t{\n\t\n\t}\n\t\n\tvoid EX_RGB_NeoPixelBus::init()\n\t{\n\t\tEverything::sendSmartString(getName() + \" \" + (m_bCurrentState == HIGH ? F(\"on\") : F(\"off\")));\n\t\t\n\t\tif (st::Executor::debug) {\n\t\t\tSerial.println(\"init called. Sending Begin to strip.\");\n\t\t}\n\t\t\/\/ On startup make sure strip is turned off\n  \t\tm_nStrip.Begin();\n\t\tm_nStrip.Show();\n\t}\n\n\tvoid EX_RGB_NeoPixelBus::beSmart(const String &str)\n\t{\n\t\tString s=str.substring(str.indexOf(' ')+1);\n\t\tif (st::Executor::debug) {\n\t\t\tSerial.print(F(\"EX_RGB_NeoPixelBus::beSmart s = \"));\n\t\t\tSerial.println(s);\n\t\t}\n\t\tif(s==F(\"on\"))\n\t\t{\n\t\t\tm_bCurrentState=HIGH;\n\t\t}\n\t\telse if(s==F(\"off\"))\n\t\t{\n\t\t\tm_bCurrentState=LOW;\n\t\t}\n\t\telse \/\/must be a set color command\n\t\t{\n\t\t\ts.trim();\n\t\t\tm_sCurrentHEX = s;\n\t\t}\n\n\t\twriteCommandToOutput();\n\n\t\t\/\/Send data to SmartThings\/Hubitat\n\t\tEverything::sendSmartString(getName() + \" \" + (m_bCurrentState == HIGH?F(\"on\"):F(\"off\")));\n\t}\n\t\n\tvoid EX_RGB_NeoPixelBus::refresh()\n\t{\n\t\tEverything::sendSmartString(getName() + \" \" + (m_bCurrentState == HIGH?F(\"on\"):F(\"off\")));\n\t}\n}<commit_msg>Delete EX_RGB_NeoPixelBus.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of the AliceVision project.\n\/\/ Copyright (c) 2016 AliceVision contributors.\n\/\/ Copyright (c) 2012 openMVG contributors.\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,\n\/\/ You can obtain one at https:\/\/mozilla.org\/MPL\/2.0\/.\n\n#pragma once\n\n\/\/#include \"aliceVision\/multiview\/homographyKernelSolver.hpp\"\n\/\/#include \"aliceVision\/robustEstimation\/ACRansac.hpp\"\n\/\/#include \"aliceVision\/robustEstimation\/ACRansacKernelAdaptator.hpp\"\n\/\/#include \"aliceVision\/robustEstimation\/guidedMatching.hpp\"\n\n\/\/#include \"aliceVision\/matching\/IndMatch.hpp\"\n\/\/#include \"aliceVision\/matching\/IndMatchDecorator.hpp\"\n#include \"aliceVision\/sfm\/SfMData.hpp\"\n#include \"aliceVision\/feature\/RegionsPerView.hpp\"\n#include \"aliceVision\/matchingImageCollection\/GeometricFilterMatrix.hpp\"\n\nnamespace aliceVision {\nnamespace matchingImageCollection {\n\n\/\/-- Multiple homography matrices estimation template functor, based on homography growing, used for filter pair of putative correspondences\nstruct GeometricFilterMatrix_HGrowing : public GeometricFilterMatrix\n{\n  GeometricFilterMatrix_HGrowing(\n    double dPrecision = std::numeric_limits<double>::infinity(),\n    size_t iteration = 1024)\n    : GeometricFilterMatrix(dPrecision, std::numeric_limits<double>::infinity(), iteration)\n    , _maxNbHomographies(10)\n    , _minRemainingMatches(20)\n    , _similarityTolerance(10)\n    , _affinityTolerance(10)\n    , _homographyTolerance(5)\n    , _minNbPlanarMatches(6)\n    , _nbIterations(8)\n    , _maxFractionPlanarMatches(0.7)\n  {\n    _Hs.push_back(Mat3::Identity());\n  }\n\/**\n   * @brief Given two sets of image points, it estimates the homography matrix\n   * relating them using a robust method (like A Contrario Ransac).\n   *\/\n  template<typename Regions_or_Features_ProviderT>\n  EstimationStatus geometricEstimation(\n    const sfm::SfMData * sfmData,\n    const Regions_or_Features_ProviderT& regionsPerView,\n    const Pair pairIndex,\n    const matching::MatchesPerDescType & putativeMatchesPerType,\n    matching::MatchesPerDescType & out_geometricInliersPerType)\n  {\n    \n    using namespace aliceVision;\n    using namespace aliceVision::robustEstimation;\n    out_geometricInliersPerType.clear();\n    \n    \/\/ Get back corresponding view index\n    const IndexT iIndex = pairIndex.first;\n    const IndexT jIndex = pairIndex.second;\n    \n    const std::vector<feature::EImageDescriberType> descTypes = regionsPerView.getCommonDescTypes(pairIndex);\n    if(descTypes.empty())\n      return EstimationStatus(false, false);\n    \n    \/\/ Retrieve all 2D features as undistorted positions into flat arrays\n    Mat xI, xJ;\n    MatchesPairToMat(pairIndex, putativeMatchesPerType, sfmData, regionsPerView, descTypes, xI, xJ);\n    std::cout << \"Pair id. : \" << pairIndex << std::endl;\n    std::cout << \"|- xI: \" << xI.rows() << \"x\" << xI.cols() << std::endl;\n    std::cout << \"|- xJ: \" << xJ.rows() << \"x\" << xJ.cols() << std::endl;\n    std::size_t nbMatches = xI.cols();\n    \n    \/\/ (?) make a map\n    std::vector<Mat3> homographies;\n    std::vector<std::vector<IndexT>> planarMatchesPerH;\n    \n    for (IndexT iTransform = 0; iTransform < _maxNbHomographies; ++iTransform)\n    {\n      for (IndexT iMatch = 0; iMatch < nbMatches; ++iMatch)\n      {\n        \/\/ [TODO] Add 1st improvment\n        \n        \/\/ Growing a homography from one match ([F.Srajer, 2016] algo. 1, p. 20)  \n        std::vector<IndexT> planarMatchesIds;\n        Mat3 homographie;\n        \n        growHomography(xI, xJ, iMatch ,planarMatchesIds, homographie);\n        \n        if (!planarMatchesIds.empty())\n        {\n          homographies.push_back(homographie);\n          planarMatchesPerH.push_back(planarMatchesIds);\n        }\n      }\n    }\n    \n    \n    \/\/ Check if resection has strong support\n    const bool hasStrongSupport = true;\n    return EstimationStatus(true, hasStrongSupport);\n  }\n  \n  \/**\n   * @brief Geometry_guided_matching\n   * @param sfm_data\n   * @param regionsPerView\n   * @param pairIndex\n   * @param dDistanceRatio\n   * @param matches\n   * @return\n   *\/\n  bool Geometry_guided_matching\n  (\n    const sfm::SfMData * sfmData,\n    const feature::RegionsPerView & regionsPerView,\n    const Pair imageIdsPair,\n    const double dDistanceRatio,\n    matching::MatchesPerDescType & matches) override\n  {\n    \n    \/* ... *\/\n    return matches.getNbAllMatches() != 0;\n  }\n\nprivate:\n\n  \/\/ Growing a homography from one match ([F.Srajer, 2016] algo. 1, p. 20)  \n  \/\/-- See: YASM\/relative_pose.h\n  void growHomography(const Mat & featuresI, \n                      const Mat & featuresJ, \n                      const IndexT & matchId,\n                      std::vector<IndexT> & planarMatchesIndices, \n                      Mat3 & homographie)\n  {\n  \n    planarMatchesIndices.clear();\n    homographie = Mat3::Identity();\n    \n    for (IndexT iRefineStep = 0; iRefineStep < _nbIterations; ++iRefineStep)\n    {\n      if (iRefineStep == 0)\n      {\n        computeSimilarityFromMatch();\n      }\n      else if (iRefineStep <= 4)\n      {\n        estimateAffinity();\n      }\n      else\n      {\n        estimateHomography();\n      }\n      \n      findHomographyInliers();\n      \n    }\n  }\n  \n  \/**\n   * @brief computeSimilarityFromMatch\n   * see: alicevision::sfm::computeSimilarity() [sfm\/utils\/alignment.cpp]\n   *      alicevision::geometry::ACRansac_FindRTS() [geometry\/rigidTransformation3D(_test).hpp]\n   *\/   \n  void computeSimilarityFromMatch()\n  {\n    std::cout << \"computeSimilarityFromMatch\" << std::endl;\n  }\n  \n  \/**\n   * @brief estimateAffinity\n   * see: alicevision::Affine2DFromCorrespondencesLinear() [multiview\/affineSolver(_test).hpp]\n   *\/\n  void estimateAffinity()\n  {\n    std::cout << \"estimateAffinity\" << std::endl;\n  }\n  \n  \/**\n   * @brief estimateHomography\n   * see: by DLT: alicevision::homography::kernel::FourPointSolver::Solve() [multiview\/homographyKernelSolver.hpp]\n   *      by RANSAC: alicevision::matchingImageCOllection::geometricEstimation() [matchingImageCollection\/GeometricFilterMatrix_H_AC.hpp]\n   *\/\n  void estimateHomography()\n  {\n    std::cout << \"estimateHomography\" << std::endl;\n  }\n  \n  \/**\n   * @brief findHomographyInliers Test the reprojection error\n   *\/\n  void findHomographyInliers()\n  {\n    std::cout << \"findHomographyInliers\" << std::endl;\n  }\n  \n  \/\/-- Stored data\n  std::vector<Mat3> _Hs;\n  \n  \/\/-- Options\n  \n  std::size_t _maxNbHomographies; \/\/ = MaxHoms\n  std::size_t _minRemainingMatches; \/\/ = MinInsNum\n  \n  \/\/ growHomography function:\n  std::size_t _similarityTolerance; \/\/ = SimTol\n  std::size_t _affinityTolerance;   \/\/ = AffTol\n  std::size_t _homographyTolerance; \/\/ = HomTol\n  \n  std::size_t _minNbPlanarMatches; \/\/ = MinIns\n  std::size_t _nbIterations; \/\/ = RefIterNum\n  std::size_t _maxFractionPlanarMatches; \/\/ = StopInsFrac\n  \n  \n};\n\n} \/\/ namespace matchingImageCollection\n} \/\/ namespace aliceVision\n\n\n<commit_msg>[Hgrowing] 'computeSimilarityFromMatch' integration<commit_after>\/\/ This file is part of the AliceVision project.\n\/\/ Copyright (c) 2016 AliceVision contributors.\n\/\/ Copyright (c) 2012 openMVG contributors.\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,\n\/\/ You can obtain one at https:\/\/mozilla.org\/MPL\/2.0\/.\n\n#pragma once\n\n\/\/#include \"aliceVision\/multiview\/homographyKernelSolver.hpp\"\n\/\/#include \"aliceVision\/robustEstimation\/ACRansac.hpp\"\n\/\/#include \"aliceVision\/robustEstimation\/ACRansacKernelAdaptator.hpp\"\n\/\/#include \"aliceVision\/robustEstimation\/guidedMatching.hpp\"\n\n#include \"aliceVision\/matching\/IndMatch.hpp\"\n\/\/#include \"aliceVision\/matching\/IndMatchDecorator.hpp\"\n#include \"aliceVision\/sfm\/SfMData.hpp\"\n#include \"aliceVision\/feature\/RegionsPerView.hpp\"\n#include \"aliceVision\/matchingImageCollection\/GeometricFilterMatrix.hpp\"\n\nnamespace aliceVision {\nnamespace matchingImageCollection {\n\n\/\/-- Multiple homography matrices estimation template functor, based on homography growing, used for filter pair of putative correspondences\nstruct GeometricFilterMatrix_HGrowing : public GeometricFilterMatrix\n{\n  GeometricFilterMatrix_HGrowing(\n    double dPrecision = std::numeric_limits<double>::infinity(),\n    size_t iteration = 1024)\n    : GeometricFilterMatrix(dPrecision, std::numeric_limits<double>::infinity(), iteration)\n    , _maxNbHomographies(10)\n    , _minRemainingMatches(20)\n    , _similarityTolerance(10)\n    , _affinityTolerance(10)\n    , _homographyTolerance(5)\n    , _minNbPlanarMatches(6)\n    , _nbIterations(8)\n    , _maxFractionPlanarMatches(0.7)\n  {\n    _Hs.push_back(Mat3::Identity());\n  }\n\/**\n   * @brief Given two sets of image points, it estimates the homography matrix\n   * relating them using a robust method (like A Contrario Ransac).\n   *\/\n  template<typename Regions_or_Features_ProviderT>\n  EstimationStatus geometricEstimation(\n    const sfm::SfMData * sfmData,\n    const Regions_or_Features_ProviderT& regionsPerView,\n    const Pair pairIndex,\n    const matching::MatchesPerDescType & putativeMatchesPerType,\n    matching::MatchesPerDescType & out_geometricInliersPerType)\n  {\n    \n    using namespace aliceVision;\n    using namespace aliceVision::robustEstimation;\n    out_geometricInliersPerType.clear();\n    \n    \/\/ Get back corresponding view index\n    const IndexT viewId_I = pairIndex.first;\n    const IndexT viewId_J = pairIndex.second;\n    \n    const std::vector<feature::EImageDescriberType> descTypes = regionsPerView.getCommonDescTypes(pairIndex);\n    if(descTypes.empty())\n      return EstimationStatus(false, false);\n    \n    \/\/ Retrieve all 2D features as undistorted positions into flat arrays\n    Mat xI, xJ;\n    MatchesPairToMat(pairIndex, putativeMatchesPerType, sfmData, regionsPerView, descTypes, xI, xJ);\n    \n    std::cout << \"Pair id. : \" << pairIndex << std::endl;\n    std::cout << \"|- putative: \" << putativeMatchesPerType.at(feature::EImageDescriberType::SIFT).size() << std::endl;\n    std::cout << \"|- xI: \" << xI.rows() << \"x\" << xI.cols() << std::endl;\n    std::cout << \"|- xJ: \" << xJ.rows() << \"x\" << xJ.cols() << std::endl;\n    \n    const feature::Regions& regionsSIFT_I = regionsPerView.getRegions(viewId_I, descTypes.at(0));\n    const feature::Regions& regionsSIFT_J = regionsPerView.getRegions(viewId_J, descTypes.at(0));\n    const std::vector<feature::SIOPointFeature> allFeaturesI = getSIOPointFeatures(regionsSIFT_I);\n    const std::vector<feature::SIOPointFeature> allFeaturesJ = getSIOPointFeatures(regionsSIFT_J);\n    \n    matching::IndMatches putativeMatchesSIFT = putativeMatchesPerType.at(feature::EImageDescriberType::SIFT);\n    std::vector<feature::SIOPointFeature> putativeFeaturesI, putativeFeaturesJ;\n    putativeFeaturesI.reserve(putativeMatchesSIFT.size());\n    putativeFeaturesJ.reserve(putativeMatchesSIFT.size());\n    \n    for (const matching::IndMatch & idMatch : putativeMatchesSIFT)\n    {\n      putativeFeaturesI.push_back(allFeaturesI.at(idMatch._i));\n      putativeFeaturesJ.push_back(allFeaturesJ.at(idMatch._j));\n    }\n    \n    if (viewId_I == 200563944 && viewId_J == 1112206013) \/\/ MATLAB exemple\n    {\n      std::cout << \"|- #matches: \" << putativeMatchesSIFT.size() << std::endl;\n      std::cout << \"|- allFeaturesI : \" << allFeaturesI.size() << std::endl;\n      std::cout << \"|- allFeaturesJ : \" << allFeaturesJ.size() << std::endl;\n      std::cout << \"|- putativeFeaturesI : \" << putativeFeaturesI.size() << std::endl;\n      std::cout << \"|- putativeFeaturesJ : \" << putativeFeaturesJ.size() << std::endl;\n      \/\/      std::cout << \"-------\" << std::endl;\n      \/\/      std::cout << \"xI : \" << std::endl;\n      \/\/      std::cout << xI << std::endl;    \n      \/\/      std::cout << \"putativeFeaturesI : \" << std::endl;\n      \/\/      std::cout << putativeFeaturesI << std::endl;\n      \n      \n      std::size_t nbMatches = putativeMatchesSIFT.size();\n      \n      \/\/ (?) make a map\n      std::vector<Mat3> homographies;\n      std::vector<std::vector<IndexT>> planarMatchesPerH;\n      \n      for (IndexT iTransform = 0; iTransform < _maxNbHomographies; ++iTransform)\n      {\n        for (IndexT iMatch = 0; iMatch < nbMatches; ++iMatch)\n        {\n          \/\/ [TODO] Add 1st improvment\n          \n          \/\/ Growing a homography from one match ([F.Srajer, 2016] algo. 1, p. 20)  \n          std::vector<IndexT> planarMatchesIds;\n          Mat3 homographie;\n          \n          growHomography(putativeFeaturesI, putativeFeaturesJ, iMatch , planarMatchesIds, homographie);\n          \n          if (!planarMatchesIds.empty())\n          {\n            homographies.push_back(homographie);\n            planarMatchesPerH.push_back(planarMatchesIds);\n          }\n        }\n      }\n    }\n    \n    \n    \/\/ Check if resection has strong support\n    const bool hasStrongSupport = true;\n    return EstimationStatus(true, hasStrongSupport);\n  }\n  \n  \/**\n   * @brief Geometry_guided_matching\n   * @param sfm_data\n   * @param regionsPerView\n   * @param pairIndex\n   * @param dDistanceRatio\n   * @param matches\n   * @return\n   *\/\n  bool Geometry_guided_matching\n  (\n    const sfm::SfMData * sfmData,\n    const feature::RegionsPerView & regionsPerView,\n    const Pair imageIdsPair,\n    const double dDistanceRatio,\n    matching::MatchesPerDescType & matches) override\n  {\n    \n    \/* ... *\/\n    return matches.getNbAllMatches() != 0;\n  }\n\nprivate:\n\n  \/\/ Growing a homography from one match ([F.Srajer, 2016] algo. 1, p. 20)  \n  \/\/-- See: YASM\/relative_pose.h\n  void growHomography(const std::vector<feature::SIOPointFeature> & featuresI, \n                      const std::vector<feature::SIOPointFeature> & featuresJ, \n                      const IndexT & seedMatchId,\n                      std::vector<IndexT> & out_planarMatchesIndices, \n                      Mat3 & out_transformation)\n  {\n  \n    assert(featuresI.size() == featuresJ.size());\n    assert(seedMatchId <= featuresI.size());\n    \n\/\/    std::cout << \"featuresI = \" << featuresI << std::endl;\n\/\/    std::cout << \"featuresI = \" << featuresI << std::endl;\n    \n    out_planarMatchesIndices.clear();\n    out_transformation = Mat3::Identity();\n    \n    feature::SIOPointFeature seedFeatureI = featuresI.at(seedMatchId);\n    feature::SIOPointFeature seedFeatureJ = featuresJ.at(seedMatchId);\n    std::size_t currentTolerance;\n    for (IndexT iRefineStep = 0; iRefineStep < _nbIterations; ++iRefineStep)\n    {\n      if (iRefineStep == 0)\n      {\n        computeSimilarityFromMatch(seedFeatureI, seedFeatureJ, out_transformation);\n        std::cout << \"featI: \" << seedFeatureI << std::endl;\n        std::cout << \"featJ: \" << seedFeatureJ << std::endl;\n        std::cout << \"S = \" << out_transformation << std::endl;\n        getchar();\n        currentTolerance = _similarityTolerance;\n      }\n      else if (iRefineStep <= 4)\n      {\n        estimateAffinity();\n        currentTolerance = _affinityTolerance;\n      }\n      else\n      {\n        estimateHomography();\n        currentTolerance = _homographyTolerance;\n      }\n      \n      findHomographyInliers();\n      \n    }\n  }\n  \n  \/**\n   * @brief computeSimilarityFromMatch\n   * see: alicevision::sfm::computeSimilarity() [sfm\/utils\/alignment.cpp]\n   *      alicevision::geometry::ACRansac_FindRTS() [geometry\/rigidTransformation3D(_test).hpp]\n   *\/   \n\n  void computeSimilarityFromMatch(const feature::SIOPointFeature & feat1,\n                                  const feature::SIOPointFeature & feat2,\n                                  Mat3 & S)\n  {\n    computeSimilarityFromMatch(feat1.coords(), feat1.scale(), feat1.orientation(),\n                               feat2.coords(), feat2.scale(), feat2.orientation(),\n                               S);\n  }\n\n  \/**\n   * @brief computeSimilarityFromMatch\n   * Source: https:\/\/github.com\/fsrajer\/yasfm\/blob\/master\/YASFM\/relative_pose.cpp#L1649\n   * @param coord1\n   * @param scale1\n   * @param orientation1\n   * @param coord2\n   * @param scale2\n   * @param orientation2\n   * @param S\n   *\/  \n  void computeSimilarityFromMatch(const Vec2f & coord1, double scale1, double orientation1,\n                                  const Vec2f & coord2, double scale2, double orientation2,\n                                  Mat3 & S)\n  {\n    double c1 = cos(orientation1),\n        s1 = sin(orientation1),\n        c2 = cos(orientation2),\n        s2 = sin(orientation2);\n    \n    Mat3 A1,A2;\n    A1 << scale1*c1,scale1*(-s1),coord1(0),\n        scale1*s1,scale1*c1,coord1(1),\n        0,0,1;\n    A2 << scale2*c2,scale2*(-s2),coord2(0),\n        scale2*s2,scale2*c2,coord2(1),\n        0,0,1;\n    \n    S = A2*A1.inverse();\n  }\n  \n  \/**\n   * @brief estimateAffinity\n   * see: alicevision::Affine2DFromCorrespondencesLinear() [multiview\/affineSolver(_test).hpp]\n   *\/\n  void estimateAffinity()\n  {\n\/\/    std::cout << \"estimateAffinity\" << std::endl;\n  }\n  \n  \/**\n   * @brief estimateHomography\n   * see: by DLT: alicevision::homography::kernel::FourPointSolver::Solve() [multiview\/homographyKernelSolver.hpp]\n   *      by RANSAC: alicevision::matchingImageCOllection::geometricEstimation() [matchingImageCollection\/GeometricFilterMatrix_H_AC.hpp]\n   *\/\n  void estimateHomography()\n  {\n\/\/    std::cout << \"estimateHomography\" << std::endl;\n  }\n  \n  \/**\n   * @brief findHomographyInliers Test the reprojection error\n   *\/\n  void findHomographyInliers()\n  {\n\/\/    std::cout << \"findHomographyInliers\" << std::endl;\n  }\n  \n  \/\/-- Stored data\n  std::vector<Mat3> _Hs;\n  \n  \/\/-- Options\n  \n  std::size_t _maxNbHomographies; \/\/ = MaxHoms\n  std::size_t _minRemainingMatches; \/\/ = MinInsNum\n  \n  \/\/ growHomography function:\n  std::size_t _similarityTolerance; \/\/ = SimTol\n  std::size_t _affinityTolerance;   \/\/ = AffTol\n  std::size_t _homographyTolerance; \/\/ = HomTol\n  \n  std::size_t _minNbPlanarMatches; \/\/ = MinIns\n  std::size_t _nbIterations; \/\/ = RefIterNum\n  std::size_t _maxFractionPlanarMatches; \/\/ = StopInsFrac\n  \n  \n};\n\n} \/\/ namespace matchingImageCollection\n} \/\/ namespace aliceVision\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Application entry point.\n\/\/\n#include <iostream>\n#include <string>\n\n\nusing namespace std;\n\n\nint main() {\n    extern string greeting();  \/\/ greeting.cpp\n    std::cout << greeting() << endl;\n    return EXIT_SUCCESS;\n}\n<commit_msg>added <cstdlib> header to main.cpp<commit_after>\/\/ Application entry point.\n\/\/\n#include <cstdlib>\n#include <iostream>\n#include <string>\n\n\nusing namespace std;\n\n\nint main() {\n    extern string greeting();  \/\/ greeting.cpp\n    std::cout << greeting() << endl;\n    return EXIT_SUCCESS;\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#include \"openthread-core-config.h\"\n\n#include <stdarg.h>\n#include <stdio.h>\n#include <string.h>\n\n#include <openthread-system.h>\n#include <openthread\/cli.h>\n\n#include \"cli\/cli_config.h\"\n#include \"common\/code_utils.hpp\"\n#include \"common\/debug.hpp\"\n#include \"common\/logging.hpp\"\n#include \"utils\/uart.h\"\n\n#if OPENTHREAD_POSIX\n#include <signal.h>\n#include <sys\/types.h>\n#endif\n\n\/**\n * @def OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE\n *\n * The size of CLI UART RX buffer in bytes.\n *\n *\/\n#ifndef OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE\n#if OPENTHREAD_CONFIG_REFERENCE_DEVICE_ENABLE\n#define OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE 640\n#else\n#define OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE 512\n#endif\n#endif\n\n\/**\n * @def OPENTHREAD_CONFIG_CLI_TX_BUFFER_SIZE\n *\n * The size of CLI message buffer in bytes.\n *\n *\/\n#ifndef OPENTHREAD_CONFIG_CLI_UART_TX_BUFFER_SIZE\n#define OPENTHREAD_CONFIG_CLI_UART_TX_BUFFER_SIZE 1024\n#endif\n\n#if OPENTHREAD_CONFIG_DIAG_ENABLE\n#if OPENTHREAD_CONFIG_DIAG_OUTPUT_BUFFER_SIZE > OPENTHREAD_CONFIG_CLI_UART_TX_BUFFER_SIZE\n#error \"diag output buffer should be smaller than CLI UART tx buffer\"\n#endif\n#if OPENTHREAD_CONFIG_DIAG_CMD_LINE_BUFFER_SIZE > OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE\n#error \"diag command line should be smaller than CLI UART rx buffer\"\n#endif\n#endif\n\n#if OPENTHREAD_CONFIG_CLI_MAX_LINE_LENGTH > OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE\n#error \"command line should be should be smaller than CLI rx buffer\"\n#endif\n\nenum\n{\n    kRxBufferSize = OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE,\n    kTxBufferSize = OPENTHREAD_CONFIG_CLI_UART_TX_BUFFER_SIZE,\n};\n\nchar     sRxBuffer[kRxBufferSize];\nuint16_t sRxLength;\n\nchar     sTxBuffer[kTxBufferSize];\nuint16_t sTxHead;\nuint16_t sTxLength;\n\nuint16_t sSendLength;\n\n#ifdef OT_CLI_UART_LOCK_HDR_FILE\n\n#include OT_CLI_UART_LOCK_HDR_FILE\n\n#else\n\n\/**\n * Macro to acquire an exclusive lock of uart cli output\n * Default implementation does nothing\n *\n *\/\n#ifndef OT_CLI_UART_OUTPUT_LOCK\n#define OT_CLI_UART_OUTPUT_LOCK() \\\n    do                            \\\n    {                             \\\n    } while (0)\n#endif\n\n\/**\n * Macro to release the exclusive lock of uart cli output\n * Default implementation does nothing\n *\n *\/\n#ifndef OT_CLI_UART_OUTPUT_UNLOCK\n#define OT_CLI_UART_OUTPUT_UNLOCK() \\\n    do                              \\\n    {                               \\\n    } while (0)\n#endif\n\n#endif \/\/ OT_CLI_UART_LOCK_HDR_FILE\n\nstatic int     Output(const char *aBuf, uint16_t aBufLength);\nstatic otError ProcessCommand(void);\n\nstatic void ReceiveTask(const uint8_t *aBuf, uint16_t aBufLength)\n{\n    static const char sEraseString[]   = {'\\b', ' ', '\\b'};\n    static const char CRNL[]           = {'\\r', '\\n'};\n    static const char sCommandPrompt[] = {'>', ' '};\n    const uint8_t *   end;\n\n    end = aBuf + aBufLength;\n\n    for (; aBuf < end; aBuf++)\n    {\n        switch (*aBuf)\n        {\n        case '\\r':\n        case '\\n':\n            Output(CRNL, sizeof(CRNL));\n            if (sRxLength > 0)\n            {\n                sRxBuffer[sRxLength] = '\\0';\n                IgnoreError(ProcessCommand());\n            }\n\n            Output(sCommandPrompt, sizeof(sCommandPrompt));\n\n            break;\n\n#if OPENTHREAD_POSIX && !defined(FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION)\n        case 0x03: \/\/ ASCII for Ctrl-C\n            kill(0, SIGINT);\n            break;\n\n        case 0x04: \/\/ ASCII for Ctrl-D\n            exit(EXIT_SUCCESS);\n            break;\n#endif\n\n        case '\\b':\n        case 127:\n            if (sRxLength > 0)\n            {\n                Output(sEraseString, sizeof(sEraseString));\n                sRxBuffer[--sRxLength] = '\\0';\n            }\n\n            break;\n\n        default:\n            if (sRxLength < kRxBufferSize - 1)\n            {\n                Output(reinterpret_cast<const char *>(aBuf), 1);\n                sRxBuffer[sRxLength++] = static_cast<char>(*aBuf);\n            }\n\n            break;\n        }\n    }\n}\n\nstatic otError ProcessCommand(void)\n{\n    otError error = OT_ERROR_NONE;\n\n    while (sRxBuffer[sRxLength - 1] == '\\n' || sRxBuffer[sRxLength - 1] == '\\r')\n    {\n        sRxBuffer[--sRxLength] = '\\0';\n    }\n\n#if OPENTHREAD_CONFIG_LOG_OUTPUT != OPENTHREAD_CONFIG_LOG_OUTPUT_NONE\n    \/*\n     * Note this is here for this reason:\n     *\n     * TEXT (command) input ... in a test automation script occurs\n     * rapidly and often without gaps between the command and the\n     * terminal CR\n     *\n     * In contrast as a human is typing there is a delay between the\n     * last character of a command and the terminal CR which executes\n     * a command.\n     *\n     * During that human induced delay a tasklet may be scheduled and\n     * the LOG becomes confusing and it is hard to determine when\n     * something happened.  Which happened first? the command-CR or\n     * the tasklet.\n     *\n     * Yes, while rare it is a race condition that is hard to debug.\n     *\n     * Thus this is here to affirmatively LOG exactly when the CLI\n     * command is being executed.\n     *\/\n#if OPENTHREAD_CONFIG_MULTIPLE_INSTANCE_ENABLE\n    \/* TODO: how exactly do we get the instance here? *\/\n#else\n    otLogInfoCli(\"execute command: %s\", sRxBuffer);\n#endif\n#endif\n    if (sRxLength > 0)\n    {\n        otCliInputLine(sRxBuffer);\n    }\n\n    sRxLength = 0;\n\n    return error;\n}\n\nstatic void Send(void)\n{\n    VerifyOrExit(sSendLength == 0);\n\n    if (sTxLength > kTxBufferSize - sTxHead)\n    {\n        sSendLength = kTxBufferSize - sTxHead;\n    }\n    else\n    {\n        sSendLength = sTxLength;\n    }\n\n    if (sSendLength > 0)\n    {\n#if OPENTHREAD_CONFIG_ENABLE_DEBUG_UART\n        \/* duplicate the output to the debug uart *\/\n        otSysDebugUart_write_bytes(reinterpret_cast<uint8_t *>(sTxBuffer + sTxHead), sSendLength);\n#endif\n        IgnoreError(otPlatUartSend(reinterpret_cast<uint8_t *>(sTxBuffer + sTxHead), sSendLength));\n    }\n\nexit:\n    return;\n}\n\nstatic void SendDoneTask(void)\n{\n    sTxHead = (sTxHead + sSendLength) % kTxBufferSize;\n    sTxLength -= sSendLength;\n    sSendLength = 0;\n\n    Send();\n}\n\nstatic int Output(const char *aBuf, uint16_t aBufLength)\n{\n    OT_CLI_UART_OUTPUT_LOCK();\n    uint16_t sent = 0;\n\n    while (aBufLength > 0)\n    {\n        uint16_t remaining = kTxBufferSize - sTxLength;\n        uint16_t tail;\n        uint16_t sendLength = aBufLength;\n\n        if (sendLength > remaining)\n        {\n            sendLength = remaining;\n        }\n\n        for (uint16_t i = 0; i < sendLength; i++)\n        {\n            tail            = (sTxHead + sTxLength) % kTxBufferSize;\n            sTxBuffer[tail] = *aBuf++;\n            aBufLength--;\n            sTxLength++;\n        }\n\n        Send();\n\n        sent += sendLength;\n\n        if (aBufLength > 0)\n        {\n            \/\/ More to send, so flush what's waiting now\n            otError err = otPlatUartFlush();\n\n            if (err == OT_ERROR_NONE)\n            {\n                \/\/ Flush successful, reset the pointers\n                SendDoneTask();\n            }\n            else\n            {\n                \/\/ Flush did not succeed, so abort here.\n                break;\n            }\n        }\n    }\n\n    OT_CLI_UART_OUTPUT_UNLOCK();\n\n    return sent;\n}\n\nstatic int CliUartOutput(void *aContext, const char *aFormat, va_list aArguments)\n{\n    OT_UNUSED_VARIABLE(aContext);\n\n    int rval;\n\n    if (sTxLength == 0)\n    {\n        rval = vsnprintf(sTxBuffer, kTxBufferSize, aFormat, aArguments);\n        VerifyOrExit(rval > 0 && rval < kTxBufferSize, otLogWarnPlat(\"Failed to format CLI output `%s`\", aFormat));\n        sTxHead     = 0;\n        sTxLength   = static_cast<uint16_t>(rval);\n        sSendLength = 0;\n    }\n    else\n    {\n        va_list  retryArguments;\n        uint16_t tail      = (sTxHead + sTxLength) % kTxBufferSize;\n        uint16_t remaining = (sTxHead > tail ? (sTxHead - tail) : (kTxBufferSize - tail));\n\n        va_copy(retryArguments, aArguments);\n\n        rval = vsnprintf(&sTxBuffer[tail], remaining, aFormat, aArguments);\n\n        if (rval < 0)\n        {\n            otLogWarnPlat(\"Failed to format CLI output `%s`\", aFormat);\n        }\n        else if (rval < remaining)\n        {\n            sTxLength += rval;\n        }\n        else if (rval < kTxBufferSize)\n        {\n            while (sTxLength != 0)\n            {\n                otError error;\n\n                Send();\n\n                error = otPlatUartFlush();\n\n                if (error == OT_ERROR_NONE)\n                {\n                    \/\/ Flush successful, reset the pointers\n                    SendDoneTask();\n                }\n                else\n                {\n                    \/\/ Flush did not succeed, so abort here.\n                    otLogWarnPlat(\"Failed to output CLI: %s\", otThreadErrorToString(error));\n                    ExitNow();\n                }\n            }\n            rval = vsnprintf(sTxBuffer, kTxBufferSize, aFormat, retryArguments);\n            OT_ASSERT(rval > 0);\n            sTxLength   = static_cast<uint16_t>(rval);\n            sTxHead     = 0;\n            sSendLength = 0;\n        }\n        else\n        {\n            otLogWarnPlat(\"CLI output `%s` truncated\", aFormat);\n        }\n\n        va_end(retryArguments);\n    }\n\n    Send();\n\nexit:\n    return rval;\n}\n\nvoid otPlatUartReceived(const uint8_t *aBuf, uint16_t aBufLength)\n{\n    ReceiveTask(aBuf, aBufLength);\n}\n\nvoid otPlatUartSendDone(void)\n{\n    SendDoneTask();\n}\n\nextern \"C\" void otAppCliInit(otInstance *aInstance)\n{\n    sRxLength   = 0;\n    sTxHead     = 0;\n    sTxLength   = 0;\n    sSendLength = 0;\n\n    IgnoreError(otPlatUartEnable());\n\n    otCliInit(aInstance, CliUartOutput, aInstance);\n}\n<commit_msg>[cli] fix false alarm when printing empty line (#6499)<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#include \"openthread-core-config.h\"\n\n#include <stdarg.h>\n#include <stdio.h>\n#include <string.h>\n\n#include <openthread-system.h>\n#include <openthread\/cli.h>\n\n#include \"cli\/cli_config.h\"\n#include \"common\/code_utils.hpp\"\n#include \"common\/debug.hpp\"\n#include \"common\/logging.hpp\"\n#include \"utils\/uart.h\"\n\n#if OPENTHREAD_POSIX\n#include <signal.h>\n#include <sys\/types.h>\n#endif\n\n\/**\n * @def OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE\n *\n * The size of CLI UART RX buffer in bytes.\n *\n *\/\n#ifndef OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE\n#if OPENTHREAD_CONFIG_REFERENCE_DEVICE_ENABLE\n#define OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE 640\n#else\n#define OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE 512\n#endif\n#endif\n\n\/**\n * @def OPENTHREAD_CONFIG_CLI_TX_BUFFER_SIZE\n *\n * The size of CLI message buffer in bytes.\n *\n *\/\n#ifndef OPENTHREAD_CONFIG_CLI_UART_TX_BUFFER_SIZE\n#define OPENTHREAD_CONFIG_CLI_UART_TX_BUFFER_SIZE 1024\n#endif\n\n#if OPENTHREAD_CONFIG_DIAG_ENABLE\n#if OPENTHREAD_CONFIG_DIAG_OUTPUT_BUFFER_SIZE > OPENTHREAD_CONFIG_CLI_UART_TX_BUFFER_SIZE\n#error \"diag output buffer should be smaller than CLI UART tx buffer\"\n#endif\n#if OPENTHREAD_CONFIG_DIAG_CMD_LINE_BUFFER_SIZE > OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE\n#error \"diag command line should be smaller than CLI UART rx buffer\"\n#endif\n#endif\n\n#if OPENTHREAD_CONFIG_CLI_MAX_LINE_LENGTH > OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE\n#error \"command line should be should be smaller than CLI rx buffer\"\n#endif\n\nenum\n{\n    kRxBufferSize = OPENTHREAD_CONFIG_CLI_UART_RX_BUFFER_SIZE,\n    kTxBufferSize = OPENTHREAD_CONFIG_CLI_UART_TX_BUFFER_SIZE,\n};\n\nchar     sRxBuffer[kRxBufferSize];\nuint16_t sRxLength;\n\nchar     sTxBuffer[kTxBufferSize];\nuint16_t sTxHead;\nuint16_t sTxLength;\n\nuint16_t sSendLength;\n\n#ifdef OT_CLI_UART_LOCK_HDR_FILE\n\n#include OT_CLI_UART_LOCK_HDR_FILE\n\n#else\n\n\/**\n * Macro to acquire an exclusive lock of uart cli output\n * Default implementation does nothing\n *\n *\/\n#ifndef OT_CLI_UART_OUTPUT_LOCK\n#define OT_CLI_UART_OUTPUT_LOCK() \\\n    do                            \\\n    {                             \\\n    } while (0)\n#endif\n\n\/**\n * Macro to release the exclusive lock of uart cli output\n * Default implementation does nothing\n *\n *\/\n#ifndef OT_CLI_UART_OUTPUT_UNLOCK\n#define OT_CLI_UART_OUTPUT_UNLOCK() \\\n    do                              \\\n    {                               \\\n    } while (0)\n#endif\n\n#endif \/\/ OT_CLI_UART_LOCK_HDR_FILE\n\nstatic int     Output(const char *aBuf, uint16_t aBufLength);\nstatic otError ProcessCommand(void);\n\nstatic void ReceiveTask(const uint8_t *aBuf, uint16_t aBufLength)\n{\n    static const char sEraseString[]   = {'\\b', ' ', '\\b'};\n    static const char CRNL[]           = {'\\r', '\\n'};\n    static const char sCommandPrompt[] = {'>', ' '};\n    const uint8_t *   end;\n\n    end = aBuf + aBufLength;\n\n    for (; aBuf < end; aBuf++)\n    {\n        switch (*aBuf)\n        {\n        case '\\r':\n        case '\\n':\n            Output(CRNL, sizeof(CRNL));\n            if (sRxLength > 0)\n            {\n                sRxBuffer[sRxLength] = '\\0';\n                IgnoreError(ProcessCommand());\n            }\n\n            Output(sCommandPrompt, sizeof(sCommandPrompt));\n\n            break;\n\n#if OPENTHREAD_POSIX && !defined(FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION)\n        case 0x03: \/\/ ASCII for Ctrl-C\n            kill(0, SIGINT);\n            break;\n\n        case 0x04: \/\/ ASCII for Ctrl-D\n            exit(EXIT_SUCCESS);\n            break;\n#endif\n\n        case '\\b':\n        case 127:\n            if (sRxLength > 0)\n            {\n                Output(sEraseString, sizeof(sEraseString));\n                sRxBuffer[--sRxLength] = '\\0';\n            }\n\n            break;\n\n        default:\n            if (sRxLength < kRxBufferSize - 1)\n            {\n                Output(reinterpret_cast<const char *>(aBuf), 1);\n                sRxBuffer[sRxLength++] = static_cast<char>(*aBuf);\n            }\n\n            break;\n        }\n    }\n}\n\nstatic otError ProcessCommand(void)\n{\n    otError error = OT_ERROR_NONE;\n\n    while (sRxBuffer[sRxLength - 1] == '\\n' || sRxBuffer[sRxLength - 1] == '\\r')\n    {\n        sRxBuffer[--sRxLength] = '\\0';\n    }\n\n#if OPENTHREAD_CONFIG_LOG_OUTPUT != OPENTHREAD_CONFIG_LOG_OUTPUT_NONE\n    \/*\n     * Note this is here for this reason:\n     *\n     * TEXT (command) input ... in a test automation script occurs\n     * rapidly and often without gaps between the command and the\n     * terminal CR\n     *\n     * In contrast as a human is typing there is a delay between the\n     * last character of a command and the terminal CR which executes\n     * a command.\n     *\n     * During that human induced delay a tasklet may be scheduled and\n     * the LOG becomes confusing and it is hard to determine when\n     * something happened.  Which happened first? the command-CR or\n     * the tasklet.\n     *\n     * Yes, while rare it is a race condition that is hard to debug.\n     *\n     * Thus this is here to affirmatively LOG exactly when the CLI\n     * command is being executed.\n     *\/\n#if OPENTHREAD_CONFIG_MULTIPLE_INSTANCE_ENABLE\n    \/* TODO: how exactly do we get the instance here? *\/\n#else\n    otLogInfoCli(\"execute command: %s\", sRxBuffer);\n#endif\n#endif\n    if (sRxLength > 0)\n    {\n        otCliInputLine(sRxBuffer);\n    }\n\n    sRxLength = 0;\n\n    return error;\n}\n\nstatic void Send(void)\n{\n    VerifyOrExit(sSendLength == 0);\n\n    if (sTxLength > kTxBufferSize - sTxHead)\n    {\n        sSendLength = kTxBufferSize - sTxHead;\n    }\n    else\n    {\n        sSendLength = sTxLength;\n    }\n\n    if (sSendLength > 0)\n    {\n#if OPENTHREAD_CONFIG_ENABLE_DEBUG_UART\n        \/* duplicate the output to the debug uart *\/\n        otSysDebugUart_write_bytes(reinterpret_cast<uint8_t *>(sTxBuffer + sTxHead), sSendLength);\n#endif\n        IgnoreError(otPlatUartSend(reinterpret_cast<uint8_t *>(sTxBuffer + sTxHead), sSendLength));\n    }\n\nexit:\n    return;\n}\n\nstatic void SendDoneTask(void)\n{\n    sTxHead = (sTxHead + sSendLength) % kTxBufferSize;\n    sTxLength -= sSendLength;\n    sSendLength = 0;\n\n    Send();\n}\n\nstatic int Output(const char *aBuf, uint16_t aBufLength)\n{\n    OT_CLI_UART_OUTPUT_LOCK();\n    uint16_t sent = 0;\n\n    while (aBufLength > 0)\n    {\n        uint16_t remaining = kTxBufferSize - sTxLength;\n        uint16_t tail;\n        uint16_t sendLength = aBufLength;\n\n        if (sendLength > remaining)\n        {\n            sendLength = remaining;\n        }\n\n        for (uint16_t i = 0; i < sendLength; i++)\n        {\n            tail            = (sTxHead + sTxLength) % kTxBufferSize;\n            sTxBuffer[tail] = *aBuf++;\n            aBufLength--;\n            sTxLength++;\n        }\n\n        Send();\n\n        sent += sendLength;\n\n        if (aBufLength > 0)\n        {\n            \/\/ More to send, so flush what's waiting now\n            otError err = otPlatUartFlush();\n\n            if (err == OT_ERROR_NONE)\n            {\n                \/\/ Flush successful, reset the pointers\n                SendDoneTask();\n            }\n            else\n            {\n                \/\/ Flush did not succeed, so abort here.\n                break;\n            }\n        }\n    }\n\n    OT_CLI_UART_OUTPUT_UNLOCK();\n\n    return sent;\n}\n\nstatic int CliUartOutput(void *aContext, const char *aFormat, va_list aArguments)\n{\n    OT_UNUSED_VARIABLE(aContext);\n\n    int rval;\n\n    if (sTxLength == 0)\n    {\n        rval = vsnprintf(sTxBuffer, kTxBufferSize, aFormat, aArguments);\n        VerifyOrExit(rval >= 0 && rval < kTxBufferSize, otLogWarnPlat(\"Failed to format CLI output `%s`\", aFormat));\n        sTxHead     = 0;\n        sTxLength   = static_cast<uint16_t>(rval);\n        sSendLength = 0;\n    }\n    else\n    {\n        va_list  retryArguments;\n        uint16_t tail      = (sTxHead + sTxLength) % kTxBufferSize;\n        uint16_t remaining = (sTxHead > tail ? (sTxHead - tail) : (kTxBufferSize - tail));\n\n        va_copy(retryArguments, aArguments);\n\n        rval = vsnprintf(&sTxBuffer[tail], remaining, aFormat, aArguments);\n\n        if (rval < 0)\n        {\n            otLogWarnPlat(\"Failed to format CLI output `%s`\", aFormat);\n        }\n        else if (rval < remaining)\n        {\n            sTxLength += rval;\n        }\n        else if (rval < kTxBufferSize)\n        {\n            while (sTxLength != 0)\n            {\n                otError error;\n\n                Send();\n\n                error = otPlatUartFlush();\n\n                if (error == OT_ERROR_NONE)\n                {\n                    \/\/ Flush successful, reset the pointers\n                    SendDoneTask();\n                }\n                else\n                {\n                    \/\/ Flush did not succeed, so abort here.\n                    otLogWarnPlat(\"Failed to output CLI: %s\", otThreadErrorToString(error));\n                    ExitNow();\n                }\n            }\n            rval = vsnprintf(sTxBuffer, kTxBufferSize, aFormat, retryArguments);\n            OT_ASSERT(rval > 0);\n            sTxLength   = static_cast<uint16_t>(rval);\n            sTxHead     = 0;\n            sSendLength = 0;\n        }\n        else\n        {\n            otLogWarnPlat(\"CLI output `%s` truncated\", aFormat);\n        }\n\n        va_end(retryArguments);\n    }\n\n    Send();\n\nexit:\n    return rval;\n}\n\nvoid otPlatUartReceived(const uint8_t *aBuf, uint16_t aBufLength)\n{\n    ReceiveTask(aBuf, aBufLength);\n}\n\nvoid otPlatUartSendDone(void)\n{\n    SendDoneTask();\n}\n\nextern \"C\" void otAppCliInit(otInstance *aInstance)\n{\n    sRxLength   = 0;\n    sTxHead     = 0;\n    sTxLength   = 0;\n    sSendLength = 0;\n\n    IgnoreError(otPlatUartEnable());\n\n    otCliInit(aInstance, CliUartOutput, aInstance);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n#include <thread>\n#include <mutex>\n#include <condition_variable>\n#include \"Channel.h\"\n\n\n\nvoid worker_thread(Channel<std::string>* data)\n{\n    while(true){\n        auto Channeldata = data->get();\n        if(Channeldata == \"END\"){\n            break;\n        }\n        std::cout << \"Worker says: \" << Channeldata << std::endl;\n    }\n    std::cout << \"Exiting loop\" << std::endl;\n}\n\nint main()\n{\n    Channel<std::string>* myChan = new Channel<std::string>;\n\n    myChan->put(\"Hello\");\n    myChan->put(\"World\");\n\n    std::thread worker(worker_thread,myChan);\n\n    while (true){\n        std::string input;\n        std::cin >> input;\n        myChan->put(input);\n        if(input == \"END\"){\n            break;\n        }\n    }\n\n    worker.join();\n}<commit_msg>Changed to pass channel by reference<commit_after>#include <iostream>\n#include <string>\n#include <thread>\n#include <mutex>\n#include <condition_variable>\n#include \"Channel.h\"\n\n\n\nvoid worker_thread(Channel<std::string>& data)\n{\n    while(true){\n        auto Channeldata = data.get();\n        if(Channeldata == \"END\"){\n            break;\n        }\n        std::cout << \"Worker says: \" << Channeldata << std::endl;\n    }\n    std::cout << \"Exiting loop\" << std::endl;\n}\n\nint main()\n{\n    Channel<std::string> myChan;\n\n    myChan.put(\"Hello\");\n    myChan.put(\"World\");\n\n    std::thread worker(worker_thread,std::ref(myChan));\n\n    while (true){\n        std::string input;\n        std::cin >> input;\n        myChan.put(input);\n        if(input == \"END\"){\n            break;\n        }\n    }\n\n    worker.join();\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011-2015 The Cryptonote developers\n\/\/ Copyright (c) 2016 The Karbowanec 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 <QCoreApplication>\n#include <QDateTime>\n#include <QDir>\n#include <QTimer>\n#include <QUrl>\n\n#include <CryptoNoteCore\/CoreConfig.h>\n#include <P2p\/NetNodeConfig.h>\n#include <Wallet\/WalletErrors.h>\n\n#include \"CurrencyAdapter.h\"\n#include \"LoggerAdapter.h\"\n#include \"NodeAdapter.h\"\n#include \"Settings.h\"\n\nnamespace WalletGui {\n\nnamespace {\n\nstd::vector<std::string> convertStringListToVector(const QStringList& list) {\n  std::vector<std::string> result;\n  Q_FOREACH (const QString& item, list) {\n    result.push_back(item.toStdString());\n  }\n\n  return result;\n}\n\n}\n\nclass InProcessNodeInitializer : public QObject {\n  Q_OBJECT\n  Q_DISABLE_COPY(InProcessNodeInitializer)\n\nQ_SIGNALS:\n  void nodeInitCompletedSignal();\n  void nodeInitFailedSignal(int _errorCode);\n  void nodeDeinitCompletedSignal();\n\npublic:\n  InProcessNodeInitializer(QObject* _parent = nullptr) {\n  }\n\n  ~InProcessNodeInitializer() {\n  }\n\n  void start(Node** _node, const CryptoNote::Currency* currency,  INodeCallback* _callback, Logging::LoggerManager* _loggerManager,\n    const CryptoNote::CoreConfig& _coreConfig, const CryptoNote::NetNodeConfig& _netNodeConfig) {\n    (*_node) = createInprocessNode(*currency, *_loggerManager, _coreConfig, _netNodeConfig, *_callback);\n    try {\n      (*_node)->init([this](std::error_code _err) {\n          if (_err) {\n            Q_EMIT nodeInitFailedSignal(_err.value());\n            QCoreApplication::processEvents();\n            return;\n          }\n\n          Q_EMIT nodeInitCompletedSignal();\n          QCoreApplication::processEvents();\n        });\n    } catch (std::runtime_error& err) {\n      Q_EMIT nodeInitFailedSignal(CryptoNote::error::INTERNAL_WALLET_ERROR);\n      QCoreApplication::processEvents();\n      return;\n    }\n\n    delete *_node;\n    *_node = nullptr;\n    Q_EMIT nodeDeinitCompletedSignal();\n  }\n\n  void stop(Node** _node) {\n    Q_CHECK_PTR(*_node);\n    (*_node)->deinit();\n  }\n};\n\nNodeAdapter& NodeAdapter::instance() {\n  static NodeAdapter inst;\n  return inst;\n}\n\nNodeAdapter::NodeAdapter() : QObject(), m_node(nullptr), m_nodeInitializerThread(), m_nodeInitializer(new InProcessNodeInitializer) {\n  m_nodeInitializer->moveToThread(&m_nodeInitializerThread);\n\n  qRegisterMetaType<CryptoNote::CoreConfig>(\"CryptoNote::CoreConfig\");\n  qRegisterMetaType<CryptoNote::NetNodeConfig>(\"CryptoNote::NetNodeConfig\");\n\n  connect(m_nodeInitializer, &InProcessNodeInitializer::nodeInitCompletedSignal, this, &NodeAdapter::nodeInitCompletedSignal, Qt::QueuedConnection);\n  connect(this, &NodeAdapter::initNodeSignal, m_nodeInitializer, &InProcessNodeInitializer::start, Qt::QueuedConnection);\n  connect(this, &NodeAdapter::deinitNodeSignal, m_nodeInitializer, &InProcessNodeInitializer::stop, Qt::QueuedConnection);\n}\n\nNodeAdapter::~NodeAdapter() {\n}\n\nquintptr NodeAdapter::getPeerCount() const {\n  Q_ASSERT(m_node != nullptr);\n  return m_node->getPeerCount();\n}\n\nstd::string NodeAdapter::convertPaymentId(const QString& _paymentIdString) const {\n  Q_CHECK_PTR(m_node);\n  try {\n    return m_node->convertPaymentId(_paymentIdString.toStdString());\n  } catch (std::runtime_error& err) {\n  }\n  return std::string();\n}\n\nQString NodeAdapter::extractPaymentId(const std::string& _extra) const {\n  Q_CHECK_PTR(m_node);\n  return QString::fromStdString(m_node->extractPaymentId(_extra));\n}\n\nCryptoNote::IWalletLegacy* NodeAdapter::createWallet() const {\n  Q_CHECK_PTR(m_node);\n  return m_node->createWallet();\n}\n\nbool NodeAdapter::init() {\n  Q_ASSERT(m_node == nullptr);\n\n  QString connection = Settings::instance().getConnection();\n\n  if(connection.compare(\"embedded\") == 0) {\n\n      m_node = nullptr;\n      return initInProcessNode();\n\n  } else if(connection.compare(\"local\") == 0) {\n      QUrl localNodeUrl = QUrl::fromUserInput(QString(\"127.0.0.1:%1\").arg(Settings::instance().getCurrentLocalDaemonPort()));\n      m_node = createRpcNode(CurrencyAdapter::instance().getCurrency(), *this, localNodeUrl.host().toStdString(), localNodeUrl.port());\n      QTimer initTimer;\n      initTimer.setInterval(3000);\n      initTimer.setSingleShot(true);\n      initTimer.start();\n          m_node->init([this](std::error_code _err) {\n              Q_UNUSED(_err);\n            });\n      QEventLoop waitLoop;\n      connect(&initTimer, &QTimer::timeout, &waitLoop, &QEventLoop::quit);\n      connect(this, &NodeAdapter::peerCountUpdatedSignal, &waitLoop, &QEventLoop::quit);\n      connect(this, &NodeAdapter::localBlockchainUpdatedSignal, &waitLoop, &QEventLoop::quit);\n      waitLoop.exec();\n      if (initTimer.isActive()) {\n        initTimer.stop();\n        Q_EMIT nodeInitCompletedSignal();\n        return true;\n      }\n\n  } else if(connection.compare(\"remote\") == 0) {\n      QUrl remoteNodeUrl = QUrl::fromUserInput(Settings::instance().getCurrentRemoteNode());\n      m_node = createRpcNode(CurrencyAdapter::instance().getCurrency(), *this, remoteNodeUrl.host().toStdString(), remoteNodeUrl.port());\n      QTimer initTimer;\n      initTimer.setInterval(3000);\n      initTimer.setSingleShot(true);\n      initTimer.start();\n      m_node->init([this](std::error_code _err) {\n          Q_UNUSED(_err);\n        });\n      QEventLoop waitLoop;\n      connect(&initTimer, &QTimer::timeout, &waitLoop, &QEventLoop::quit);\n      connect(this, &NodeAdapter::peerCountUpdatedSignal, &waitLoop, &QEventLoop::quit);\n      connect(this, &NodeAdapter::localBlockchainUpdatedSignal, &waitLoop, &QEventLoop::quit);\n      waitLoop.exec();\n      if (initTimer.isActive()) {\n        initTimer.stop();\n        Q_EMIT nodeInitCompletedSignal();\n        return true;\n      }\n\n  } else {\n            QUrl localNodeUrl = QUrl::fromUserInput(QString(\"127.0.0.1:%1\").arg(CryptoNote::RPC_DEFAULT_PORT));\n            m_node = createRpcNode(CurrencyAdapter::instance().getCurrency(), *this, localNodeUrl.host().toStdString(), localNodeUrl.port());\n            QTimer initTimer;\n            initTimer.setInterval(3000);\n            initTimer.setSingleShot(true);\n            initTimer.start();\n            m_node->init([this](std::error_code _err) {\n                Q_UNUSED(_err);\n              });\n            QEventLoop waitLoop;\n            connect(&initTimer, &QTimer::timeout, &waitLoop, &QEventLoop::quit);\n            connect(this, &NodeAdapter::peerCountUpdatedSignal, &waitLoop, &QEventLoop::quit);\n            connect(this, &NodeAdapter::localBlockchainUpdatedSignal, &waitLoop, &QEventLoop::quit);\n            waitLoop.exec();\n            if (initTimer.isActive()) {\n              initTimer.stop();\n              Q_EMIT nodeInitCompletedSignal();\n              return true;\n            }\n            delete m_node;\n            m_node = nullptr;\n            return initInProcessNode();\n        }\n\n}\n\nquint64 NodeAdapter::getLastKnownBlockHeight() const {\n  Q_CHECK_PTR(m_node);\n  return m_node->getLastKnownBlockHeight();\n}\n\nquint64 NodeAdapter::getLastLocalBlockHeight() const {\n  Q_CHECK_PTR(m_node);\n  return m_node->getLastLocalBlockHeight();\n}\n\nQDateTime NodeAdapter::getLastLocalBlockTimestamp() const {\n  Q_CHECK_PTR(m_node);\n  return QDateTime::fromTime_t(m_node->getLastLocalBlockTimestamp(), Qt::UTC);\n}\n\nvoid NodeAdapter::peerCountUpdated(Node& _node, size_t _count) {\n  Q_UNUSED(_node);\n  Q_EMIT peerCountUpdatedSignal(_count);\n}\n\nvoid NodeAdapter::localBlockchainUpdated(Node& _node, uint64_t _height) {\n  Q_UNUSED(_node);\n  Q_EMIT localBlockchainUpdatedSignal(_height);\n}\n\nvoid NodeAdapter::lastKnownBlockHeightUpdated(Node& _node, uint64_t _height) {\n  Q_UNUSED(_node);\n  Q_EMIT lastKnownBlockHeightUpdatedSignal(_height);\n}\n\nbool NodeAdapter::initInProcessNode() {\n  Q_ASSERT(m_node == nullptr);\n  m_nodeInitializerThread.start();\n  CryptoNote::CoreConfig coreConfig = makeCoreConfig();\n  CryptoNote::NetNodeConfig netNodeConfig = makeNetNodeConfig();\n  Q_EMIT initNodeSignal(&m_node, &CurrencyAdapter::instance().getCurrency(), this, &LoggerAdapter::instance().getLoggerManager(), coreConfig, netNodeConfig);\n  QEventLoop waitLoop;\n  connect(m_nodeInitializer, &InProcessNodeInitializer::nodeInitCompletedSignal, &waitLoop, &QEventLoop::quit);\n  connect(m_nodeInitializer, &InProcessNodeInitializer::nodeInitFailedSignal, &waitLoop, &QEventLoop::exit);\n  if (waitLoop.exec() != 0) {\n    return false;\n  }\n\n  Q_EMIT localBlockchainUpdatedSignal(getLastLocalBlockHeight());\n  Q_EMIT lastKnownBlockHeightUpdatedSignal(getLastKnownBlockHeight());\n  return true;\n}\n\nvoid NodeAdapter::deinit() {\n  if (m_node != nullptr) {\n    if (m_nodeInitializerThread.isRunning()) {\n      m_nodeInitializer->stop(&m_node);\n      QEventLoop waitLoop;\n      connect(m_nodeInitializer, &InProcessNodeInitializer::nodeDeinitCompletedSignal, &waitLoop, &QEventLoop::quit, Qt::QueuedConnection);\n      waitLoop.exec();\n      m_nodeInitializerThread.quit();\n      m_nodeInitializerThread.wait();\n    } else {\n      delete m_node;\n      m_node = nullptr;\n    }\n  }\n}\n\nCryptoNote::CoreConfig NodeAdapter::makeCoreConfig() const {\n  CryptoNote::CoreConfig config;\n  boost::program_options::variables_map options;\n  boost::any dataDir = std::string(Settings::instance().getDataDir().absolutePath().toLocal8Bit().data());\n  options.insert(std::make_pair(\"data-dir\", boost::program_options::variable_value(dataDir, false)));\n  config.init(options);\n  return config;\n}\n\nCryptoNote::NetNodeConfig NodeAdapter::makeNetNodeConfig() const {\n  CryptoNote::NetNodeConfig config;\n  boost::program_options::variables_map options;\n  boost::any p2pBindIp = Settings::instance().getP2pBindIp().toStdString();\n  boost::any p2pBindPort = static_cast<uint16_t>(Settings::instance().getP2pBindPort());\n  boost::any p2pExternalPort = static_cast<uint16_t>(Settings::instance().getP2pExternalPort());\n  boost::any p2pAllowLocalIp = Settings::instance().hasAllowLocalIpOption();\n  boost::any dataDir = std::string(Settings::instance().getDataDir().absolutePath().toLocal8Bit().data());\n  boost::any hideMyPort = Settings::instance().hasHideMyPortOption();\n  options.insert(std::make_pair(\"p2p-bind-ip\", boost::program_options::variable_value(p2pBindIp, false)));\n  options.insert(std::make_pair(\"p2p-bind-port\", boost::program_options::variable_value(p2pBindPort, false)));\n  options.insert(std::make_pair(\"p2p-external-port\", boost::program_options::variable_value(p2pExternalPort, false)));\n  options.insert(std::make_pair(\"allow-local-ip\", boost::program_options::variable_value(p2pAllowLocalIp, false)));\n  std::vector<std::string> peerList = convertStringListToVector(Settings::instance().getPeers());\n  if (!peerList.empty()) {\n    options.insert(std::make_pair(\"add-peer\", boost::program_options::variable_value(peerList, false)));\n  }\n\n  std::vector<std::string> priorityNodeList = convertStringListToVector(Settings::instance().getPriorityNodes());\n  if (!priorityNodeList.empty()) {\n    options.insert(std::make_pair(\"add-priority-node\", boost::program_options::variable_value(priorityNodeList, false)));\n  }\n\n  std::vector<std::string> exclusiveNodeList = convertStringListToVector(Settings::instance().getExclusiveNodes());\n  if (!exclusiveNodeList.empty()) {\n    options.insert(std::make_pair(\"add-exclusive-node\", boost::program_options::variable_value(exclusiveNodeList, false)));\n  }\n\n  std::vector<std::string> seedNodeList = convertStringListToVector(Settings::instance().getSeedNodes());\n  if (!seedNodeList.empty()) {\n    options.insert(std::make_pair(\"seed-node\", boost::program_options::variable_value(seedNodeList, false)));\n  }\n\n  options.insert(std::make_pair(\"hide-my-port\", boost::program_options::variable_value(hideMyPort, false)));\n  options.insert(std::make_pair(\"data-dir\", boost::program_options::variable_value(dataDir, false)));\n  int size = options.size();\n  config.init(options);\n  config.setTestnet(Settings::instance().isTestnet());\n  return config;\n}\n\n}\n\n#include \"NodeAdapter.moc\"\n<commit_msg>Delete NodeAdapter.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"..\/std\/algorithm.hpp\"\n#include \"..\/std\/vector.hpp\"\n#include \"..\/base\/assert.hpp\"\n#include \"..\/base\/swap.hpp\"\n\ntemplate <class T, size_t N> class buffer_vector\n{\nprivate:\n  enum { USE_DYNAMIC = N + 1 };\n  T m_static[N];\n  size_t m_size;\n  vector<T> m_dynamic;\n\npublic:\n  typedef T value_type;\n  typedef T const & const_reference;\n  typedef T & reference;\n\n  buffer_vector() : m_size(0) {}\n  explicit buffer_vector(size_t n, T c = T()) : m_size(0)\n  {\n    resize(n, c);\n  }\n\n  void reserve(size_t n)\n  {\n    if (m_size == USE_DYNAMIC || n > N)\n      m_dynamic.reserve(n);\n  }\n\n  void resize(size_t n, T c = T())\n  {\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.resize(n);\n    else\n    {\n      if (n <= N)\n      {\n        for (size_t i = m_size; i < n; ++i)\n          m_static[i] = c;\n        m_size = n;\n      }\n      else\n      {\n        m_dynamic.reserve(n);\n        size_t const oldSize = m_size;\n        SwitchToDynamic();\n        m_dynamic.insert(m_dynamic.end(), n - oldSize, c);\n        ASSERT_EQUAL(m_dynamic.size(), n, ());\n      }\n    }\n  }\n\n  void clear()\n  {\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.clear();\n    else\n      m_size = 0;\n  }\n\n  T const * data() const { return m_size == USE_DYNAMIC ? &m_dynamic[0] : &m_static[0]; }\n  T       * data()       { return m_size == USE_DYNAMIC ? &m_dynamic[0] : &m_static[0]; }\n\n  T const * begin() const { return data(); }\n  T       * begin()       { return data(); }\n  T const * end() const { return data() + size(); }\n  T       * end()       { return data() + size(); }\n\n  bool empty() const { return m_size == USE_DYNAMIC ? m_dynamic.empty() : m_size == 0; }\n  size_t size() const { return m_size == USE_DYNAMIC ? m_dynamic.size() : m_size; }\n\n  T const & front() const\n  {\n    ASSERT(!empty(), ());\n    return *begin();\n  }\n  T & front()\n  {\n    ASSERT(!empty(), ());\n    return *begin();\n  }\n  T const & back() const\n  {\n    ASSERT(!empty(), ());\n    return *(end() - 1);\n  }\n  T & back()\n  {\n    ASSERT(!empty(), ());\n    return *(end() - 1);\n  }\n\n  T const & operator[](size_t i) const\n  {\n    ASSERT_LESS(i, size(), ());\n    return *(begin() + i);\n  }\n  T & operator[](size_t i)\n  {\n    ASSERT_LESS(i, size(), ());\n    return *(begin() + i);\n  }\n\n  void swap(buffer_vector<T, N> & rhs)\n  {\n    m_dynamic.swap(rhs.m_dynamic);\n    Swap(m_size, rhs.m_size);\n    for (size_t i = 0; i < N; ++i)\n      Swap(m_static[i], rhs.m_static[i]);\n  }\n\n  void push_back(T const & t)\n  {\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.push_back(t);\n    else\n    {\n      if (m_size < N)\n        m_static[m_size++] = t;\n      else\n      {\n        ASSERT_EQUAL(m_size, N, ());\n        m_dynamic.reserve(N + 1);\n        SwitchToDynamic();\n        m_dynamic.push_back(t);\n        ASSERT_EQUAL(m_dynamic.size(), N + 1, ());\n      }\n    }\n  }\n\n  void pop_back()\n  {\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.pop_back();\n    else\n    {\n      ASSERT_GREATER(m_size, 0, ());\n      --m_size;\n    }\n  }\n\n  template <typename IterT> void insert(T const * where, IterT beg, IterT end)\n  {\n    ptrdiff_t const pos = where - data();\n    ASSERT_GREATER_OR_EQUAL(pos, 0, ());\n    ASSERT_LESS_OR_EQUAL(pos, size(), ());\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.insert(m_dynamic.begin() + pos, beg, end);\n    else\n    {\n      size_t const n = end - beg;\n      if (m_size + n <= N)\n      {\n        if (pos != m_size)\n          for (ptrdiff_t i = m_size - 1; i >= pos; --i)\n            Swap(m_static[i], m_static[i + n]);\n\n        m_size += n;\n        T * writableWhere = &m_static[0] + pos;\n        ASSERT_EQUAL(where, writableWhere, ());\n        while (beg != end)\n          *(writableWhere++) = *(beg++);\n      }\n      else\n      {\n        m_dynamic.reserve(m_size + n);\n        SwitchToDynamic();\n        m_dynamic.insert(m_dynamic.begin() + pos, beg, end);\n        ASSERT_EQUAL(m_dynamic.size(), m_dynamic.capacity(), ());\n      }\n    }\n  }\n\nprivate:\n  void SwitchToDynamic()\n  {\n    ASSERT_NOT_EQUAL(m_size, USE_DYNAMIC, ());\n    ASSERT_EQUAL(m_dynamic.size(), 0, ());\n    m_dynamic.insert(m_dynamic.end(), m_size, T());\n    for (size_t i = 0; i < m_size; ++i)\n      Swap(m_static[i], m_dynamic[i]);\n    m_size = USE_DYNAMIC;\n  }\n};\n\ntemplate <class T, size_t N>\nvoid swap(buffer_vector<T, N> & r1, buffer_vector<T, N> & r2) { r1.swap(r2); }\n\ntemplate <typename T, size_t N>\ninline string debug_print(buffer_vector<T, N> const & v)\n{\n  return ::my::impl::DebugPrintSequence(v.data(), v.data() + v.size());\n}\n<commit_msg>Almost no-op, fix compilation issue.<commit_after>#pragma once\n\n#include \"..\/std\/algorithm.hpp\"\n#include \"..\/std\/vector.hpp\"\n#include \"..\/base\/assert.hpp\"\n#include \"..\/base\/swap.hpp\"\n\ntemplate <class T, size_t N> class buffer_vector\n{\nprivate:\n  enum { USE_DYNAMIC = N + 1 };\n  T m_static[N];\n  size_t m_size;\n  vector<T> m_dynamic;\n\npublic:\n  typedef T value_type;\n  typedef T const & const_reference;\n  typedef T & reference;\n\n  buffer_vector() : m_size(0) {}\n  explicit buffer_vector(size_t n, T c = T()) : m_size(0)\n  {\n    resize(n, c);\n  }\n\n  void reserve(size_t n)\n  {\n    if (m_size == USE_DYNAMIC || n > N)\n      m_dynamic.reserve(n);\n  }\n\n  void resize(size_t n, T c = T())\n  {\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.resize(n);\n    else\n    {\n      if (n <= N)\n      {\n        for (size_t i = m_size; i < n; ++i)\n          m_static[i] = c;\n        m_size = n;\n      }\n      else\n      {\n        m_dynamic.reserve(n);\n        size_t const oldSize = m_size;\n        SwitchToDynamic();\n        m_dynamic.insert(m_dynamic.end(), n - oldSize, c);\n        ASSERT_EQUAL(m_dynamic.size(), n, ());\n      }\n    }\n  }\n\n  void clear()\n  {\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.clear();\n    else\n      m_size = 0;\n  }\n\n  T const * data() const { return m_size == USE_DYNAMIC ? &m_dynamic[0] : &m_static[0]; }\n  T       * data()       { return m_size == USE_DYNAMIC ? &m_dynamic[0] : &m_static[0]; }\n\n  T const * begin() const { return data(); }\n  T       * begin()       { return data(); }\n  T const * end() const { return data() + size(); }\n  T       * end()       { return data() + size(); }\n\n  bool empty() const { return m_size == USE_DYNAMIC ? m_dynamic.empty() : m_size == 0; }\n  size_t size() const { return m_size == USE_DYNAMIC ? m_dynamic.size() : m_size; }\n\n  T const & front() const\n  {\n    ASSERT(!empty(), ());\n    return *begin();\n  }\n  T & front()\n  {\n    ASSERT(!empty(), ());\n    return *begin();\n  }\n  T const & back() const\n  {\n    ASSERT(!empty(), ());\n    return *(end() - 1);\n  }\n  T & back()\n  {\n    ASSERT(!empty(), ());\n    return *(end() - 1);\n  }\n\n  T const & operator[](size_t i) const\n  {\n    ASSERT_LESS(i, size(), ());\n    return *(begin() + i);\n  }\n  T & operator[](size_t i)\n  {\n    ASSERT_LESS(i, size(), ());\n    return *(begin() + i);\n  }\n\n  void swap(buffer_vector<T, N> & rhs)\n  {\n    m_dynamic.swap(rhs.m_dynamic);\n    Swap(m_size, rhs.m_size);\n    for (size_t i = 0; i < N; ++i)\n      Swap(m_static[i], rhs.m_static[i]);\n  }\n\n  void push_back(T const & t)\n  {\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.push_back(t);\n    else\n    {\n      if (m_size < N)\n        m_static[m_size++] = t;\n      else\n      {\n        ASSERT_EQUAL(m_size, N, ());\n        m_dynamic.reserve(N + 1);\n        SwitchToDynamic();\n        m_dynamic.push_back(t);\n        ASSERT_EQUAL(m_dynamic.size(), N + 1, ());\n      }\n    }\n  }\n\n  void pop_back()\n  {\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.pop_back();\n    else\n    {\n      ASSERT_GREATER(m_size, 0, ());\n      --m_size;\n    }\n  }\n\n  template <typename IterT> void insert(T const * where, IterT beg, IterT end)\n  {\n    ptrdiff_t const pos = where - data();\n    ASSERT_GREATER_OR_EQUAL(pos, 0, ());\n    ASSERT_LESS_OR_EQUAL(pos, size(), ());\n    if (m_size == USE_DYNAMIC)\n      m_dynamic.insert(m_dynamic.begin() + pos, beg, end);\n    else\n    {\n      size_t const n = end - beg;\n      if (m_size + n <= N)\n      {\n        if (pos != m_size)\n          for (ptrdiff_t i = m_size - 1; i >= pos; --i)\n            Swap(m_static[i], m_static[i + n]);\n\n        m_size += n;\n        T * writableWhere = &m_static[0] + pos;\n        ASSERT_EQUAL(where, writableWhere, ());\n        while (beg != end)\n          *(writableWhere++) = *(beg++);\n      }\n      else\n      {\n        m_dynamic.reserve(m_size + n);\n        SwitchToDynamic();\n        m_dynamic.insert(m_dynamic.begin() + pos, beg, end);\n        ASSERT_EQUAL(m_dynamic.size(), m_dynamic.capacity(), ());\n      }\n    }\n  }\n\nprivate:\n  void SwitchToDynamic()\n  {\n    ASSERT_NOT_EQUAL(m_size, static_cast<size_t>(USE_DYNAMIC), ());\n    ASSERT_EQUAL(m_dynamic.size(), 0, ());\n    m_dynamic.insert(m_dynamic.end(), m_size, T());\n    for (size_t i = 0; i < m_size; ++i)\n      Swap(m_static[i], m_dynamic[i]);\n    m_size = USE_DYNAMIC;\n  }\n};\n\ntemplate <class T, size_t N>\nvoid swap(buffer_vector<T, N> & r1, buffer_vector<T, N> & r2) { r1.swap(r2); }\n\ntemplate <typename T, size_t N>\ninline string debug_print(buffer_vector<T, N> const & v)\n{\n  return ::my::impl::DebugPrintSequence(v.data(), v.data() + v.size());\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"base\/get_line.hpp\"\n\n#include <string>\n\nnamespace principia {\nnamespace base {\n\nnamespace {\n\nint constexpr kBufferSize = 100;\n\nstd::string GetLineWithSize(std::size_t const size,\n                            not_null<std::ifstream*> const stream) {\n  char* buffer = new char[size];\n  if (!stream->getline(buffer, size).eof() && stream->fail()) {\n    stream->clear();\n    std::string string_buffer(buffer);\n    string_buffer += GetLineWithSize(2 * size, stream);\n    return std::move(string_buffer);\n  }\n  return buffer;\n}\n\n}  \/\/ namespace\n\nstd::string GetLine(not_null<std::ifstream*> const stream) {\n  return GetLineWithSize(kBufferSize, stream);\n}\n\n}  \/\/ namespace base\n}  \/\/ namespace principia\n<commit_msg>Unique ptr.<commit_after>#pragma once\n\n#include \"base\/get_line.hpp\"\n\n#include <string>\n\nnamespace principia {\nnamespace base {\n\nnamespace {\n\nint constexpr kBufferSize = 200;\n\nstd::string GetLineWithSize(std::size_t const size,\n                            not_null<std::ifstream*> const stream) {\n  std::unique_ptr<char[]> buffer(new char[size]);\n  if (!stream->getline(&buffer[0], size).eof() && stream->fail()) {\n    stream->clear();\n    std::string string_buffer(buffer.get());\n    string_buffer += GetLineWithSize(2 * size, stream);\n    return std::move(string_buffer);\n  } else {\n    std::string string_buffer(buffer.get());\n    return std::move(string_buffer);\n  }\n}\n\n}  \/\/ namespace\n\nstd::string GetLine(not_null<std::ifstream*> const stream) {\n  return GetLineWithSize(kBufferSize, stream);\n}\n\n}  \/\/ namespace base\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstdint>\n#include <cstring>\n\n#include <iostream>\n#include <string>\n\n#include \"sixtracklib\/testlib.h\"\n#include \"sixtracklib\/sixtracklib.hpp\"\n\nint main( int argc, char* argv[] )\n{\n    namespace st = sixtrack;\n\n    using size_t      = st::Buffer::size_type;\n    using track_job_t = st::TrackJobCpu;\n\n    st::Buffer input_pb;\n    st::Buffer pb;\n    st::Buffer eb;\n\n    st::Particles* particles = nullptr;\n\n    int NUM_PARTICLES                  = 0;\n    int NUM_TURNS                      = 10;\n    int NUM_TURNS_ELEM_BY_ELEM         = 3;\n    int OUTPUT_SKIP                    = 1;\n    int track_status                   = 0;\n\n    \/* -------------------------------------------------------------------- *\/\n    \/* Read command line parameters *\/\n\n    if( argc < 3 )\n    {\n        std::cout << \"Usage: \" << argv[ 0 ]\n                  << \" PATH_TO_PARTICLES PATH_TO_BEAM_ELEMENTS\" << std::endl;\n        return 0;\n    }\n\n    if( ( argc >= 3 ) &&\n        ( argv[ 1 ] != nullptr ) && ( std::strlen( argv[ 1 ] ) > 0u ) &&\n        ( argv[ 2 ] != nullptr ) && ( std::strlen( argv[ 2 ] ) > 0u ) )\n    {\n        input_pb.readFromFile( argv[ 1 ] );\n        eb.readFromFile( argv[ 2 ] );\n\n        NUM_PARTICLES = st::Particles::FromBuffer(\n            input_pb, 0u )->getNumParticles();\n    }\n\n    \/* --------------------------------------------------------------------- *\/\n    \/* Prepare input and tracking data from run-time parameters: *\/\n\n    std::printf(\"%-30s = %10d\\n\",\"NUM_PARTICLES\",NUM_PARTICLES);\n    std::printf(\"%-30s = %10d\\n\",\"NUM_TURNS\",NUM_TURNS);\n    std::printf(\"%-30s = %10d\\n\",\"NUM_TURNS_ELEM_BY_ELEM\",NUM_TURNS_ELEM_BY_ELEM);\n    std::printf(\"%-30s = %10d\\n\",\"OUTPUT_SKIP\", OUTPUT_SKIP);\n\n    if( NUM_PARTICLES >= 0 )\n    {\n        particles = pb.createNew< st::Particles >(\n            st::Particles::FromBuffer( input_pb, 0u )->getNumParticles() );\n    }\n\n    if( ( eb.getNumObjects() > size_t{ 0 } ) &&\n        ( NUM_TURNS > NUM_TURNS_ELEM_BY_ELEM ) )\n    {\n        st::BeamMonitor* beam_monitor = eb.createNew< st::BeamMonitor >();\n        beam_monitor->setNumStores( NUM_TURNS - NUM_TURNS_ELEM_BY_ELEM );\n        beam_monitor->setStart( NUM_TURNS_ELEM_BY_ELEM );\n        beam_monitor->setSkip( OUTPUT_SKIP );\n        beam_monitor->setIsRolling( true );\n    }\n\n    \/* ********************************************************************* *\/\n    \/* ****               PERFORM TRACKING OPERATIONS                ******* *\/\n    \/* ********************************************************************* *\/\n\n    if( ( particles != nullptr ) && ( NUM_PARTICLES > 0 ) && ( NUM_TURNS > 0 ) )\n    {\n        \/* Create the track_job *\/\n        track_job_t job( pb, eb, nullptr, NUM_TURNS_ELEM_BY_ELEM );\n\n        if( NUM_TURNS_ELEM_BY_ELEM > 0 )\n        {\n            track_status |= st::trackElemByElem( job, NUM_TURNS_ELEM_BY_ELEM );\n        }\n\n        if( NUM_TURNS > NUM_TURNS_ELEM_BY_ELEM )\n        {\n            track_status |= st::track( job, NUM_TURNS );\n        }\n\n        \/* ****************************************************************** *\/\n        \/* ****               PERFORM OUTPUT OPERATIONS                ****** *\/\n        \/* ****************************************************************** *\/\n\n        \/* NOTE: for the CPU Track Job, collect (currently) performs no\n         * operations. Since this *might* change in the future, it's\n         * mandated to always call NS(TrackJobCpu_collect)() before\n         * accessing the particles, the beam elements or the\n         * output buffer *\/\n\n        st::collect( job );\n\n        if( track_status == 0 )\n        {\n            st::Buffer* out_buffer = nullptr;\n\n            if( job.hasOutputBuffer() )\n            {\n                out_buffer = job.ptrOutputBuffer();\n            }\n\n            if( job.hasElemByElemOutput() )\n            {\n                ::st_ElemByElemConfig const* elem_by_elem_config =\n                    job.ptrElemByElemConfig();\n\n                size_t const out_offset = job.elemByElemOutputBufferOffset();\n\n                st_Particles* elem_by_elem_output = st::Particles::FromBuffer(\n                    *out_buffer, out_offset );\n\n                \/* ::st_Particles_print_out(\n                       elem_by_elem_output->getCApiPtr() ); *\/\n\n                ( void )elem_by_elem_config;\n                ( void )elem_by_elem_output;\n            }\n\n            if( job.hasBeamMonitorOutput() )\n            {\n                st_size_t const bemon_start_index =\n                    job.beamMonitorsOutputBufferOffset();\n\n                st_size_t const bemon_stop_index =\n                    bemon_start_index + job.numBeamMonitors();\n\n                st_size_t ii = bemon_start_index;\n\n                for(  ; ii < bemon_stop_index ; ++ii )\n                {\n                    st::Particles* out_particles = st::Particles::FromBuffer(\n                        *out_buffer, ii );\n\n                    \/* ::st_Particles_print_out(\n                           out_particles->getCApiPtr() ); *\/\n\n                    ( void )out_particles;\n                }\n            }\n        }\n    }\n\n    return 0;\n}\n\n\/* end: examples\/cxx\/track_job_cpu.cpp *\/\n<commit_msg>examples\/cxx: use updated public trackJob API for example<commit_after>#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstdint>\n#include <cstring>\n\n#include <iostream>\n#include <string>\n\n#include \"sixtracklib\/testlib.h\"\n#include \"sixtracklib\/sixtracklib.hpp\"\n\nint main( int argc, char* argv[] )\n{\n    namespace st = sixtrack;\n\n    using size_t      = st::Buffer::size_type;\n    using track_job_t = st::TrackJobCpu;\n\n    st::Buffer input_pb;\n    st::Buffer pb;\n    st::Buffer eb;\n\n    st::Particles* particles = nullptr;\n\n    int NUM_PARTICLES                  = 0;\n    int NUM_TURNS                      = 10;\n    int NUM_TURNS_ELEM_BY_ELEM         = 3;\n    int OUTPUT_SKIP                    = 1;\n    int track_status                   = 0;\n\n    \/* -------------------------------------------------------------------- *\/\n    \/* Read command line parameters *\/\n\n    if( argc < 3 )\n    {\n        std::cout << \"Usage: \" << argv[ 0 ]\n                  << \" PATH_TO_PARTICLES PATH_TO_BEAM_ELEMENTS\" << std::endl;\n        return 0;\n    }\n\n    if( ( argc >= 3 ) &&\n        ( argv[ 1 ] != nullptr ) && ( std::strlen( argv[ 1 ] ) > 0u ) &&\n        ( argv[ 2 ] != nullptr ) && ( std::strlen( argv[ 2 ] ) > 0u ) )\n    {\n        input_pb.readFromFile( argv[ 1 ] );\n        eb.readFromFile( argv[ 2 ] );\n\n        NUM_PARTICLES = st::Particles::FromBuffer(\n            input_pb, 0u )->getNumParticles();\n    }\n\n    \/* --------------------------------------------------------------------- *\/\n    \/* Prepare input and tracking data from run-time parameters: *\/\n\n    std::printf(\"%-30s = %10d\\n\",\"NUM_PARTICLES\",NUM_PARTICLES);\n    std::printf(\"%-30s = %10d\\n\",\"NUM_TURNS\",NUM_TURNS);\n    std::printf(\"%-30s = %10d\\n\",\"NUM_TURNS_ELEM_BY_ELEM\",NUM_TURNS_ELEM_BY_ELEM);\n    std::printf(\"%-30s = %10d\\n\",\"OUTPUT_SKIP\", OUTPUT_SKIP);\n\n    if( NUM_PARTICLES >= 0 )\n    {\n        particles = pb.createNew< st::Particles >(\n            st::Particles::FromBuffer( input_pb, 0u )->getNumParticles() );\n    }\n\n    if( ( eb.getNumObjects() > size_t{ 0 } ) &&\n        ( NUM_TURNS > NUM_TURNS_ELEM_BY_ELEM ) )\n    {\n        st::BeamMonitor* beam_monitor = eb.createNew< st::BeamMonitor >();\n        beam_monitor->setNumStores( NUM_TURNS - NUM_TURNS_ELEM_BY_ELEM );\n        beam_monitor->setStart( NUM_TURNS_ELEM_BY_ELEM );\n        beam_monitor->setSkip( OUTPUT_SKIP );\n        beam_monitor->setIsRolling( true );\n    }\n\n    \/* ********************************************************************* *\/\n    \/* ****               PERFORM TRACKING OPERATIONS                ******* *\/\n    \/* ********************************************************************* *\/\n\n    if( ( particles != nullptr ) && ( NUM_PARTICLES > 0 ) && ( NUM_TURNS > 0 ) )\n    {\n        \/* Create the track_job *\/\n        track_job_t job( pb, eb, nullptr, NUM_TURNS_ELEM_BY_ELEM );\n\n        if( NUM_TURNS_ELEM_BY_ELEM > 0 )\n        {\n            track_status |= st::trackElemByElem( job, NUM_TURNS_ELEM_BY_ELEM );\n        }\n\n        if( NUM_TURNS > NUM_TURNS_ELEM_BY_ELEM )\n        {\n            track_status |= st::trackUntil( job, NUM_TURNS );\n        }\n\n        \/* ****************************************************************** *\/\n        \/* ****               PERFORM OUTPUT OPERATIONS                ****** *\/\n        \/* ****************************************************************** *\/\n\n        \/* NOTE: for the CPU Track Job, collect (currently) performs no\n         * operations. Since this *might* change in the future, it's\n         * mandated to always call NS(TrackJobCpu_collect)() before\n         * accessing the particles, the beam elements or the\n         * output buffer *\/\n\n        st::collect( job );\n\n        if( track_status == 0 )\n        {\n            st::Buffer* out_buffer = nullptr;\n\n            if( job.hasOutputBuffer() )\n            {\n                out_buffer = job.ptrOutputBuffer();\n            }\n\n            if( job.hasElemByElemOutput() )\n            {\n                ::st_ElemByElemConfig const* elem_by_elem_config =\n                    job.ptrElemByElemConfig();\n\n                size_t const out_offset = job.elemByElemOutputBufferOffset();\n\n                st_Particles* elem_by_elem_output = st::Particles::FromBuffer(\n                    *out_buffer, out_offset );\n\n                \/* ::st_Particles_print_out(\n                       elem_by_elem_output->getCApiPtr() ); *\/\n\n                ( void )elem_by_elem_config;\n                ( void )elem_by_elem_output;\n            }\n\n            if( job.hasBeamMonitorOutput() )\n            {\n                st_size_t const bemon_start_index =\n                    job.beamMonitorsOutputBufferOffset();\n\n                st_size_t const bemon_stop_index =\n                    bemon_start_index + job.numBeamMonitors();\n\n                st_size_t ii = bemon_start_index;\n\n                for(  ; ii < bemon_stop_index ; ++ii )\n                {\n                    st::Particles* out_particles = st::Particles::FromBuffer(\n                        *out_buffer, ii );\n\n                    \/* ::st_Particles_print_out(\n                           out_particles->getCApiPtr() ); *\/\n\n                    ( void )out_particles;\n                }\n            }\n        }\n    }\n\n    return 0;\n}\n\n\/* end: examples\/cxx\/track_job_cpu.cpp *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: animationcommandnode.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: obo $ $Date: 2007-07-17 14:47: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_slideshow.hxx\"\n\n\/\/ must be first\n#include <canvas\/debug.hxx>\n#include <canvas\/verbosetrace.hxx>\n#include <com\/sun\/star\/presentation\/EffectCommands.hpp>\n\n#include \"animationcommandnode.hxx\"\n#include \"delayevent.hxx\"\n#include \"tools.hxx\"\n#include \"nodetools.hxx\"\n\n#include <boost\/bind.hpp>\n\nnamespace slideshow {\nnamespace internal {\n\nvoid AnimationCommandNode::dispose()\n{\n    mxCommandNode.clear();\n    BaseNode::dispose();\n}\n\nvoid AnimationCommandNode::activate_()\n{\n    namespace EffectCommands = com::sun::star::presentation::EffectCommands;\n\n    switch( mxCommandNode->getCommand() ) {\n        \/\/ the command is user defined\n    case EffectCommands::CUSTOM: break;\n        \/\/ the command is an ole verb.\n    case EffectCommands::VERB: break;\n        \/\/ the command starts playing on a media object\n    case EffectCommands::PLAY: break;\n        \/\/ the command toggles the pause status on a media object\n    case EffectCommands::TOGGLEPAUSE: break;\n        \/\/ the command stops the animation on a media object\n    case EffectCommands::STOP: break;\n        \/\/ the command stops all currently running sound effects\n    case EffectCommands::STOPAUDIO:\n        getContext().mrEventMultiplexer.notifyCommandStopAudio( getSelf() );\n        break;\n    }\n\n    \/\/ deactivate ASAP:\n    scheduleDeactivationEvent(\n        makeEvent( boost::bind( &AnimationNode::deactivate, getSelf() ) ) );\n}\n\nbool AnimationCommandNode::hasPendingAnimation() const\n{\n    return false;\n}\n\n} \/\/ namespace internal\n} \/\/ namespace slideshow\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.46); FILE MERGED 2008\/03\/31 14:00:17 rt 1.8.46.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: animationcommandnode.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_slideshow.hxx\"\n\n\/\/ must be first\n#include <canvas\/debug.hxx>\n#include <canvas\/verbosetrace.hxx>\n#include <com\/sun\/star\/presentation\/EffectCommands.hpp>\n\n#include \"animationcommandnode.hxx\"\n#include \"delayevent.hxx\"\n#include \"tools.hxx\"\n#include \"nodetools.hxx\"\n\n#include <boost\/bind.hpp>\n\nnamespace slideshow {\nnamespace internal {\n\nvoid AnimationCommandNode::dispose()\n{\n    mxCommandNode.clear();\n    BaseNode::dispose();\n}\n\nvoid AnimationCommandNode::activate_()\n{\n    namespace EffectCommands = com::sun::star::presentation::EffectCommands;\n\n    switch( mxCommandNode->getCommand() ) {\n        \/\/ the command is user defined\n    case EffectCommands::CUSTOM: break;\n        \/\/ the command is an ole verb.\n    case EffectCommands::VERB: break;\n        \/\/ the command starts playing on a media object\n    case EffectCommands::PLAY: break;\n        \/\/ the command toggles the pause status on a media object\n    case EffectCommands::TOGGLEPAUSE: break;\n        \/\/ the command stops the animation on a media object\n    case EffectCommands::STOP: break;\n        \/\/ the command stops all currently running sound effects\n    case EffectCommands::STOPAUDIO:\n        getContext().mrEventMultiplexer.notifyCommandStopAudio( getSelf() );\n        break;\n    }\n\n    \/\/ deactivate ASAP:\n    scheduleDeactivationEvent(\n        makeEvent( boost::bind( &AnimationNode::deactivate, getSelf() ) ) );\n}\n\nbool AnimationCommandNode::hasPendingAnimation() const\n{\n    return false;\n}\n\n} \/\/ namespace internal\n} \/\/ namespace slideshow\n<|endoftext|>"}
{"text":"<commit_before>#include <FAST\/Config.hpp>\n#include <FAST\/Utility.hpp>\n#ifndef WIN32\n#include <dlfcn.h>\n#endif\n#include \"InferenceEngineManager.hpp\"\n\nnamespace fast {\n\nbool InferenceEngineManager::m_loaded = false;\nstd::unordered_map<std::string, std::function<InferenceEngine*()>> InferenceEngineManager::m_engines;\n\n#ifdef WIN32\n\/\/Returns the last Win32 error, in string format. Returns an empty string if there is no error.\nstd::string GetLastErrorAsString()\n{\n    \/\/Get the error message, if any.\n    DWORD errorMessageID = ::GetLastError();\n    if(errorMessageID == 0)\n        return std::string(); \/\/No error message has been recorded\n\n    LPSTR messageBuffer = nullptr;\n    size_t size = FormatMessageA(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS,\n                                 NULL, errorMessageID, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), (LPSTR)&messageBuffer, 0, NULL);\n\n    std::string message(messageBuffer, size);\n\n    \/\/Free the buffer.\n    LocalFree(messageBuffer);\n\n    return message;\n}\n#endif\n\nstd::vector<std::string> InferenceEngineManager::getEngineList() {\n    loadAll();\n    std::vector<std::string> list;\n    for(auto&& engine : m_engines)\n        list.push_back(engine.first);\n    return list;\n}\n\nvoid InferenceEngineManager::loadAll() {\n    if(m_loaded) {\n        return;\n    }\n    std::string prefix = \"InferenceEngine\";\n#ifndef WIN32\n    prefix = \"lib\" + prefix;\n#endif\n    Reporter::info() << \"Loading inference engines in folder \" << Config::getLibraryPath() << Reporter::end();\n    for(auto&& item : getDirectoryList(Config::getLibraryPath(), true, false)) {\n        if(item.substr(0, prefix.size()) == prefix) {\n            std::string name = item.substr(prefix.size(), item.rfind('.') - prefix.size());\n            Reporter::info() << \"Loading inference engine \" << name << \" from shared library \" << item << Reporter::end();\n#ifdef WIN32\n            SetErrorMode(SEM_FAILCRITICALERRORS); \/\/ TODO To avoid diaglog box, when not able to load a DLL\n            auto handle = LoadLibrary(item.c_str());\n            if(!handle) {\n                Reporter::warning() << \"Failed to load plugin because \" << GetLastErrorAsString() << Reporter::end();\n                continue;\n            }\n            auto load = (InferenceEngine* (*)())GetProcAddress(handle, \"load\");\n            if(!load) {\n                FreeLibrary(handle);\n                Reporter::warning() << \"Failed to get adress to load function because \" << GetLastErrorAsString() << Reporter::end();\n                continue;\n            }\n#else\n            auto handle = dlopen(item.c_str(), RTLD_LAZY);\n            if(!handle) {\n                Reporter::warning() << \"Failed to load plugin because \" << dlerror() << Reporter::end();\n                continue;\n            }\n            auto load = (InferenceEngine* (*)())dlsym(handle, \"load\");\n            if(!load) {\n                dlclose(handle);\n                Reporter::warning() << \"Failed to get address of load function because \" << Reporter::end();\/\/ dlerror() << Reporter::end();\n                continue;\n            }\n#endif\n            m_engines[name] = load;\n        }\n    }\n    m_loaded = true;\n}\n\n\nstd::shared_ptr<InferenceEngine> InferenceEngineManager::loadBestAvailableEngine() {\n    loadAll();\n    if(m_engines.empty())\n        throw Exception(\"No inference engines available on the system\");\n\n    if(isEngineAvailable(\"TensorFlow\")) {\n        \/\/ Default is tensorflow if GPU support is enabled\n        auto engine = loadEngine(\"TensorFlow\");\n        auto devices = engine->getDeviceList();\n        for (auto &&device : devices) {\n            if (device.type == InferenceDeviceType::GPU)\n                return engine;\n        }\n    }\n\n    if(isEngineAvailable(\"TensorRT\"))\n        return loadEngine(\"TensorRT\");\n\n    return loadEngine(getEngineList().front());\n}\n\nstd::shared_ptr<InferenceEngine> InferenceEngineManager::loadBestAvailableEngine(ModelFormat modelFormat) {\n    loadAll();\n    if(m_engines.empty())\n        throw Exception(\"No inference engines available on the system\");\n\n    if(isEngineAvailable(\"TensorFlow\") && loadEngine(\"TensorFlow\")->isModelFormatSupported(modelFormat)) {\n        \/\/ Default is tensorflow if GPU support is enabled\n        auto engine = loadEngine(\"TensorFlow\");\n        auto devices = engine->getDeviceList();\n        for (auto &&device : devices) {\n            if (device.type == InferenceDeviceType::GPU)\n                return engine;\n        }\n    }\n\n    if(isEngineAvailable(\"TensorRT\") && loadEngine(\"TensorRT\")->isModelFormatSupported(modelFormat))\n        return loadEngine(\"TensorRT\");\n\n    for(auto name : getEngineList()) {\n        auto engine = loadEngine(name);\n        if(engine->isModelFormatSupported(modelFormat))\n            return engine;\n    }\n    throw Exception(\"No engine for model format found\");\n}\n\n\n\nbool InferenceEngineManager::isEngineAvailable(std::string name) {\n    loadAll();\n    return m_engines.count(name) > 0;\n}\n\nstd::shared_ptr<InferenceEngine> InferenceEngineManager::loadEngine(std::string name) {\n    loadAll();\n    if(m_engines.count(name) == 0)\n        throw Exception(\"Inference engine with name \" + name + \" is not available\");\n    \/\/ Call the load function which the map stores a handle to\n    return std::shared_ptr<InferenceEngine>(m_engines.at(name)());\n}\n\n}<commit_msg>Check for AVX2 support before loading TensorFlow<commit_after>#include <FAST\/Config.hpp>\n#include <FAST\/Utility.hpp>\n#ifdef WIN32\n\/\/ For TensorFlow AVX2 check - Taken from https:\/\/docs.microsoft.com\/en-us\/cpp\/intrinsics\/cpuid-cpuidex?view=msvc-160\n#include <vector>\n#include <bitset>\n#include <array>\n#include <string>\n#include <intrin.h>\nnamespace fast {\nclass InstructionSet\n{\n    \/\/ forward declarations\n    class InstructionSet_Internal;\n\npublic:\n    \/\/ getters\n    static std::string Vendor(void) { return CPU_Rep.vendor_; }\n    static std::string Brand(void) { return CPU_Rep.brand_; }\n\n    static bool SSE3(void) { return CPU_Rep.f_1_ECX_[0]; }\n    static bool PCLMULQDQ(void) { return CPU_Rep.f_1_ECX_[1]; }\n    static bool MONITOR(void) { return CPU_Rep.f_1_ECX_[3]; }\n    static bool SSSE3(void) { return CPU_Rep.f_1_ECX_[9]; }\n    static bool FMA(void) { return CPU_Rep.f_1_ECX_[12]; }\n    static bool CMPXCHG16B(void) { return CPU_Rep.f_1_ECX_[13]; }\n    static bool SSE41(void) { return CPU_Rep.f_1_ECX_[19]; }\n    static bool SSE42(void) { return CPU_Rep.f_1_ECX_[20]; }\n    static bool MOVBE(void) { return CPU_Rep.f_1_ECX_[22]; }\n    static bool POPCNT(void) { return CPU_Rep.f_1_ECX_[23]; }\n    static bool AES(void) { return CPU_Rep.f_1_ECX_[25]; }\n    static bool XSAVE(void) { return CPU_Rep.f_1_ECX_[26]; }\n    static bool OSXSAVE(void) { return CPU_Rep.f_1_ECX_[27]; }\n    static bool AVX(void) { return CPU_Rep.f_1_ECX_[28]; }\n    static bool F16C(void) { return CPU_Rep.f_1_ECX_[29]; }\n    static bool RDRAND(void) { return CPU_Rep.f_1_ECX_[30]; }\n\n    static bool MSR(void) { return CPU_Rep.f_1_EDX_[5]; }\n    static bool CX8(void) { return CPU_Rep.f_1_EDX_[8]; }\n    static bool SEP(void) { return CPU_Rep.f_1_EDX_[11]; }\n    static bool CMOV(void) { return CPU_Rep.f_1_EDX_[15]; }\n    static bool CLFSH(void) { return CPU_Rep.f_1_EDX_[19]; }\n    static bool MMX(void) { return CPU_Rep.f_1_EDX_[23]; }\n    static bool FXSR(void) { return CPU_Rep.f_1_EDX_[24]; }\n    static bool SSE(void) { return CPU_Rep.f_1_EDX_[25]; }\n    static bool SSE2(void) { return CPU_Rep.f_1_EDX_[26]; }\n\n    static bool FSGSBASE(void) { return CPU_Rep.f_7_EBX_[0]; }\n    static bool BMI1(void) { return CPU_Rep.f_7_EBX_[3]; }\n    static bool HLE(void) { return CPU_Rep.isIntel_ && CPU_Rep.f_7_EBX_[4]; }\n    static bool AVX2(void) { return CPU_Rep.f_7_EBX_[5]; }\n    static bool BMI2(void) { return CPU_Rep.f_7_EBX_[8]; }\n    static bool ERMS(void) { return CPU_Rep.f_7_EBX_[9]; }\n    static bool INVPCID(void) { return CPU_Rep.f_7_EBX_[10]; }\n    static bool RTM(void) { return CPU_Rep.isIntel_ && CPU_Rep.f_7_EBX_[11]; }\n    static bool AVX512F(void) { return CPU_Rep.f_7_EBX_[16]; }\n    static bool RDSEED(void) { return CPU_Rep.f_7_EBX_[18]; }\n    static bool ADX(void) { return CPU_Rep.f_7_EBX_[19]; }\n    static bool AVX512PF(void) { return CPU_Rep.f_7_EBX_[26]; }\n    static bool AVX512ER(void) { return CPU_Rep.f_7_EBX_[27]; }\n    static bool AVX512CD(void) { return CPU_Rep.f_7_EBX_[28]; }\n    static bool SHA(void) { return CPU_Rep.f_7_EBX_[29]; }\n\n    static bool PREFETCHWT1(void) { return CPU_Rep.f_7_ECX_[0]; }\n\n    static bool LAHF(void) { return CPU_Rep.f_81_ECX_[0]; }\n    static bool LZCNT(void) { return CPU_Rep.isIntel_ && CPU_Rep.f_81_ECX_[5]; }\n    static bool ABM(void) { return CPU_Rep.isAMD_ && CPU_Rep.f_81_ECX_[5]; }\n    static bool SSE4a(void) { return CPU_Rep.isAMD_ && CPU_Rep.f_81_ECX_[6]; }\n    static bool XOP(void) { return CPU_Rep.isAMD_ && CPU_Rep.f_81_ECX_[11]; }\n    static bool TBM(void) { return CPU_Rep.isAMD_ && CPU_Rep.f_81_ECX_[21]; }\n\n    static bool SYSCALL(void) { return CPU_Rep.isIntel_ && CPU_Rep.f_81_EDX_[11]; }\n    static bool MMXEXT(void) { return CPU_Rep.isAMD_ && CPU_Rep.f_81_EDX_[22]; }\n    static bool RDTSCP(void) { return CPU_Rep.isIntel_ && CPU_Rep.f_81_EDX_[27]; }\n    static bool _3DNOWEXT(void) { return CPU_Rep.isAMD_ && CPU_Rep.f_81_EDX_[30]; }\n    static bool _3DNOW(void) { return CPU_Rep.isAMD_ && CPU_Rep.f_81_EDX_[31]; }\n\nprivate:\n    static const InstructionSet_Internal CPU_Rep;\n\n    class InstructionSet_Internal\n    {\n    public:\n        InstructionSet_Internal()\n            : nIds_{ 0 },\n            nExIds_{ 0 },\n            isIntel_{ false },\n            isAMD_{ false },\n            f_1_ECX_{ 0 },\n            f_1_EDX_{ 0 },\n            f_7_EBX_{ 0 },\n            f_7_ECX_{ 0 },\n            f_81_ECX_{ 0 },\n            f_81_EDX_{ 0 },\n            data_{},\n            extdata_{}\n        {\n            \/\/int cpuInfo[4] = {-1};\n            std::array<int, 4> cpui;\n\n            \/\/ Calling __cpuid with 0x0 as the function_id argument\n            \/\/ gets the number of the highest valid function ID.\n            __cpuid(cpui.data(), 0);\n            nIds_ = cpui[0];\n\n            for (int i = 0; i <= nIds_; ++i)\n            {\n                __cpuidex(cpui.data(), i, 0);\n                data_.push_back(cpui);\n            }\n\n            \/\/ Capture vendor string\n            char vendor[0x20];\n            memset(vendor, 0, sizeof(vendor));\n            *reinterpret_cast<int*>(vendor) = data_[0][1];\n            *reinterpret_cast<int*>(vendor + 4) = data_[0][3];\n            *reinterpret_cast<int*>(vendor + 8) = data_[0][2];\n            vendor_ = vendor;\n            if (vendor_ == \"GenuineIntel\")\n            {\n                isIntel_ = true;\n            }\n            else if (vendor_ == \"AuthenticAMD\")\n            {\n                isAMD_ = true;\n            }\n\n            \/\/ load bitset with flags for function 0x00000001\n            if (nIds_ >= 1)\n            {\n                f_1_ECX_ = data_[1][2];\n                f_1_EDX_ = data_[1][3];\n            }\n\n            \/\/ load bitset with flags for function 0x00000007\n            if (nIds_ >= 7)\n            {\n                f_7_EBX_ = data_[7][1];\n                f_7_ECX_ = data_[7][2];\n            }\n\n            \/\/ Calling __cpuid with 0x80000000 as the function_id argument\n            \/\/ gets the number of the highest valid extended ID.\n            __cpuid(cpui.data(), 0x80000000);\n            nExIds_ = cpui[0];\n\n            char brand[0x40];\n            memset(brand, 0, sizeof(brand));\n\n            for (int i = 0x80000000; i <= nExIds_; ++i)\n            {\n                __cpuidex(cpui.data(), i, 0);\n                extdata_.push_back(cpui);\n            }\n\n            \/\/ load bitset with flags for function 0x80000001\n            if (nExIds_ >= 0x80000001)\n            {\n                f_81_ECX_ = extdata_[1][2];\n                f_81_EDX_ = extdata_[1][3];\n            }\n\n            \/\/ Interpret CPU brand string if reported\n            if (nExIds_ >= 0x80000004)\n            {\n                memcpy(brand, extdata_[2].data(), sizeof(cpui));\n                memcpy(brand + 16, extdata_[3].data(), sizeof(cpui));\n                memcpy(brand + 32, extdata_[4].data(), sizeof(cpui));\n                brand_ = brand;\n            }\n        };\n\n        int nIds_;\n        int nExIds_;\n        std::string vendor_;\n        std::string brand_;\n        bool isIntel_;\n        bool isAMD_;\n        std::bitset<32> f_1_ECX_;\n        std::bitset<32> f_1_EDX_;\n        std::bitset<32> f_7_EBX_;\n        std::bitset<32> f_7_ECX_;\n        std::bitset<32> f_81_ECX_;\n        std::bitset<32> f_81_EDX_;\n        std::vector<std::array<int, 4>> data_;\n        std::vector<std::array<int, 4>> extdata_;\n    };\n};\n}\n#else\n#include <dlfcn.h>\n#endif\n#include \"InferenceEngineManager.hpp\"\n\nnamespace fast {\n\nbool InferenceEngineManager::m_loaded = false;\nstd::unordered_map<std::string, std::function<InferenceEngine*()>> InferenceEngineManager::m_engines;\n\n#ifdef WIN32\n\/\/Returns the last Win32 error, in string format. Returns an empty string if there is no error.\nstd::string GetLastErrorAsString()\n{\n    \/\/Get the error message, if any.\n    DWORD errorMessageID = ::GetLastError();\n    if(errorMessageID == 0)\n        return std::string(); \/\/No error message has been recorded\n\n    LPSTR messageBuffer = nullptr;\n    size_t size = FormatMessageA(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS,\n                                 NULL, errorMessageID, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), (LPSTR)&messageBuffer, 0, NULL);\n\n    std::string message(messageBuffer, size);\n\n    \/\/Free the buffer.\n    LocalFree(messageBuffer);\n\n    return message;\n}\n#endif\n\nstd::vector<std::string> InferenceEngineManager::getEngineList() {\n    loadAll();\n    std::vector<std::string> list;\n    for(auto&& engine : m_engines)\n        list.push_back(engine.first);\n    return list;\n}\n\nvoid InferenceEngineManager::loadAll() {\n    if(m_loaded) {\n        return;\n    }\n    std::string prefix = \"InferenceEngine\";\n#ifndef WIN32\n    prefix = \"lib\" + prefix;\n#endif\n    Reporter::info() << \"Loading inference engines in folder \" << Config::getLibraryPath() << Reporter::end();\n    for(auto&& item : getDirectoryList(Config::getLibraryPath(), true, false)) {\n        if(item.substr(0, prefix.size()) == prefix) {\n            std::string name = item.substr(prefix.size(), item.rfind('.') - prefix.size());\n            Reporter::info() << \"Loading inference engine \" << name << \" from shared library \" << item << Reporter::end();\n#ifdef WIN32\n            if(name == \"TensorFlow\") {\n                if(!InstructionSet::AVX2()) {\n                    Reporter::warning() << \"You CPU does not support AVX2, unable to load TensorFlow inference engine.\" << Reporter::end();\n                    continue;\n                }\n            }\n            SetErrorMode(SEM_FAILCRITICALERRORS); \/\/ TODO To avoid diaglog box, when not able to load a DLL\n            auto handle = LoadLibrary(item.c_str());\n            if(!handle) {\n                Reporter::warning() << \"Failed to load plugin because \" << GetLastErrorAsString() << Reporter::end();\n                continue;\n            }\n            auto load = (InferenceEngine* (*)())GetProcAddress(handle, \"load\");\n            if(!load) {\n                FreeLibrary(handle);\n                Reporter::warning() << \"Failed to get adress to load function because \" << GetLastErrorAsString() << Reporter::end();\n                continue;\n            }\n#else\n            if(name == \"TensorFlow\") {\n                if(!__builtin_cpu_supports(\"avx2\")) {\n                    Reporter::warning() << \"You CPU does not support AVX2, unable to load TensorFlow inference engine.\" << Reporter::end();\n                    continue;\n                }\n            }\n            auto handle = dlopen(item.c_str(), RTLD_LAZY);\n            if(!handle) {\n                Reporter::warning() << \"Failed to load plugin because \" << dlerror() << Reporter::end();\n                continue;\n            }\n            auto load = (InferenceEngine* (*)())dlsym(handle, \"load\");\n            if(!load) {\n                dlclose(handle);\n                Reporter::warning() << \"Failed to get address of load function because \" << Reporter::end();\/\/ dlerror() << Reporter::end();\n                continue;\n            }\n#endif\n            m_engines[name] = load;\n        }\n    }\n    m_loaded = true;\n}\n\n\nstd::shared_ptr<InferenceEngine> InferenceEngineManager::loadBestAvailableEngine() {\n    loadAll();\n    if(m_engines.empty())\n        throw Exception(\"No inference engines available on the system\");\n\n    if(isEngineAvailable(\"TensorFlow\")) {\n        \/\/ Default is tensorflow if GPU support is enabled\n        auto engine = loadEngine(\"TensorFlow\");\n        auto devices = engine->getDeviceList();\n        for (auto &&device : devices) {\n            if (device.type == InferenceDeviceType::GPU)\n                return engine;\n        }\n    }\n\n    if(isEngineAvailable(\"TensorRT\"))\n        return loadEngine(\"TensorRT\");\n\n    return loadEngine(getEngineList().front());\n}\n\nstd::shared_ptr<InferenceEngine> InferenceEngineManager::loadBestAvailableEngine(ModelFormat modelFormat) {\n    loadAll();\n    if(m_engines.empty())\n        throw Exception(\"No inference engines available on the system\");\n\n    if(isEngineAvailable(\"TensorFlow\") && loadEngine(\"TensorFlow\")->isModelFormatSupported(modelFormat)) {\n        \/\/ Default is tensorflow if GPU support is enabled\n        auto engine = loadEngine(\"TensorFlow\");\n        auto devices = engine->getDeviceList();\n        for (auto &&device : devices) {\n            if (device.type == InferenceDeviceType::GPU)\n                return engine;\n        }\n    }\n\n    if(isEngineAvailable(\"TensorRT\") && loadEngine(\"TensorRT\")->isModelFormatSupported(modelFormat))\n        return loadEngine(\"TensorRT\");\n\n    for(auto name : getEngineList()) {\n        auto engine = loadEngine(name);\n        if(engine->isModelFormatSupported(modelFormat))\n            return engine;\n    }\n    throw Exception(\"No engine for model format found\");\n}\n\n\n\nbool InferenceEngineManager::isEngineAvailable(std::string name) {\n    loadAll();\n    return m_engines.count(name) > 0;\n}\n\nstd::shared_ptr<InferenceEngine> InferenceEngineManager::loadEngine(std::string name) {\n    loadAll();\n    if(m_engines.count(name) == 0)\n        throw Exception(\"Inference engine with name \" + name + \" is not available\");\n    \/\/ Call the load function which the map stores a handle to\n    return std::shared_ptr<InferenceEngine>(m_engines.at(name)());\n}\n\n}<|endoftext|>"}
{"text":"<commit_before>#include \"QtVmbViewer.h\"\n#include <iostream>\n#include <QPixmap>\n#include <QVBoxLayout>\n\n\/\/ Constructor\nQtVmbViewer::QtVmbViewer( QWidget *parent ) : QWidget( parent ), label( new QLabel ) {\n    \/\/ Scale the image label\n    label->setScaledContents( true );\n    \/\/ Widget layout\n    QVBoxLayout* layout = new QVBoxLayout( this );\n    layout->addWidget( label );\n    layout->setSizeConstraint( QLayout::SetFixedSize );\n    \/\/ Create the camera\n    camera = new VmbCamera( \"50-0503323406\" );\n    \/\/ Connect the camera signal to get the received frame\n    connect( camera, &VmbCamera::FrameReceived, this, &QtVmbViewer::GetFrame );\n    \/\/ Open the camera\n    camera->Open();\n    \/\/ Create the image\n    image = new QImage( camera->width, camera->height, QImage::Format_Indexed8 );\n    \/\/ Create a indexed color table\n    image->setColorCount( 256 );\n    for( int i = 0; i < 256; i++ ) {\n        image->setColor( i, qRgb(i, i, i) );\n    }\n    \/\/ Start acquisition\n    camera->StartCapture();\n}\n\n\/\/ Destructor\nQtVmbViewer::~QtVmbViewer() {\n    \/\/ Stop acquisition\n    camera->StopCapture();\n    \/\/ Close the camera\n    camera->Close();\n    \/\/ Delete the camera\n    delete camera;\n    \/\/ Delete the image\n    delete image;\n}\n\n\/\/ Image callback\nvoid QtVmbViewer::GetFrame( const VmbFrame_t* frame_pointer ) {\n    \/\/ Copy the camera frame to the widget image\n    VmbUchar_t* pCursor = image->bits();\n    VmbUchar_t* pInBuffer = (VmbUchar_t*)frame_pointer->buffer;\n    for( int y=0; y<camera->height; ++y ) {\n        pCursor = image->scanLine( y );\n        for( int x=0; x<camera->width; ++x ) {\n            *pCursor = *pInBuffer;\n            ++pCursor;\n            ++pInBuffer;\n        }\n    }\n    \/\/ Set the image to the label\n    label->setPixmap( QPixmap::fromImage( *image ) );\n    \/\/ Update the widget\n    label->update();\n}\n\n<commit_msg>Copy the camera frame buffer to the Qt image using memcpy.<commit_after>#include \"QtVmbViewer.h\"\n#include <iostream>\n#include <QPixmap>\n#include <QVBoxLayout>\n\n\/\/ Constructor\nQtVmbViewer::QtVmbViewer( QWidget *parent ) : QWidget( parent ), label( new QLabel ) {\n    \/\/ Scale the image label\n    label->setScaledContents( true );\n    \/\/ Widget layout\n    QVBoxLayout* layout = new QVBoxLayout( this );\n    layout->addWidget( label );\n    layout->setSizeConstraint( QLayout::SetFixedSize );\n    \/\/ Create the camera\n    camera = new VmbCamera( \"50-0503323406\" );\n    \/\/ Connect the camera signal to get the received frame\n    connect( camera, &VmbCamera::FrameReceived, this, &QtVmbViewer::GetFrame );\n    \/\/ Open the camera\n    camera->Open();\n    \/\/ Create the image\n    image = new QImage( camera->width, camera->height, QImage::Format_Indexed8 );\n    \/\/ Create a indexed color table\n    image->setColorCount( 256 );\n    for( int i = 0; i < 256; i++ ) {\n        image->setColor( i, qRgb(i, i, i) );\n    }\n    \/\/ Start acquisition\n    camera->StartCapture();\n}\n\n\/\/ Destructor\nQtVmbViewer::~QtVmbViewer() {\n    \/\/ Stop acquisition\n    camera->StopCapture();\n    \/\/ Close the camera\n    camera->Close();\n    \/\/ Delete the camera\n    delete camera;\n    \/\/ Delete the image\n    delete image;\n}\n\n\/\/ Image callback\nvoid QtVmbViewer::GetFrame( const VmbFrame_t* frame_pointer ) {\n    \/\/ Copy the camera frame buffer to the Qt image\n    memcpy( image->bits(), frame_pointer->buffer, camera->height*camera->width );\n    \/\/ Set the image to the label\n    label->setPixmap( QPixmap::fromImage( *image ) );\n    \/\/ Update the widget\n    label->update();\n}\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\n#ifndef LUABIND_OUT_VALUE_POLICY_HPP_INCLUDED\n#define LUABIND_OUT_VALUE_POLICY_HPP_INCLUDED\n\n#include <luabind\/config.hpp>\n#include <luabind\/detail\/policy.hpp>    \/\/ for find_conversion_policy, etc\n#include <luabind\/detail\/decorate_type.hpp>  \/\/ for decorated_type\n#include <luabind\/detail\/primitives.hpp>  \/\/ for by_pointer, by_reference, etc\n#include <luabind\/detail\/typetraits.hpp>  \/\/ for is_nonconst_pointer, is_nonconst_reference, etc\n#include <new>                          \/\/ for operator new\n\nnamespace luabind { namespace detail\n{\n\ttemplate<int N>\n\tstruct char_array\n\t{\n\t\tchar storage[N];\n\t};\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_reference<U>);\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_const_reference<U>);\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_pointer<U>);\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_const_pointer<U>);\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_value<U>);\n\n\ttemplate<class T>\n\tstruct indirect_sizeof\n\t{\n\t\tstatic const int value = sizeof(indirect_sizeof_test(decorated_type<T>()));\n\t};\n\t\n\tnamespace out_value_detail {\n\n\t\ttemplate< int Size >\n\t\tstruct temporary_storage_size {\n\t\t\t\n\t\t\ttemplate< typename T, typename... Args >\n\t\t\tvoid construct(Args&&... args)\n\t\t\t{\n\t\t\t\tnew (&m_storage) T(std::forward<Args>(args)...);\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tT& get() {\n\t\t\t\treturn *reinterpret_cast<T*>(&m_storage);\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tconst T& get() const {\n\t\t\t\treturn *reinterpret_cast<T*>(&m_storage);\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tvoid destroy()\n\t\t\t{\n\t\t\t\tget<T>().~T();\n\t\t\t}\n\n\t\t\ttypename std::aligned_storage<Size>::type m_storage;\n\t\t\n\t\t};\n\n\t\ttemplate< typename T >\n\t\tstruct temporary_storage_type {\n\n\t\t\ttemplate< typename... Args >\n\t\t\tvoid construct(Args&&... args)\n\t\t\t{\n\t\t\t\tnew (&m_storage) T(std::forward<Args>(args)...);\n\t\t\t}\n\n\t\t\tT& get() {\n\t\t\t\treturn *reinterpret_cast<T*>(&m_storage);\n\t\t\t}\n\n\t\t\tconst T& get() const {\n\t\t\t\treturn *reinterpret_cast<T*>(&m_storage);\n\t\t\t}\n\n\t\t\tvoid destroy()\n\t\t\t{\n\t\t\t\tget().~T();\n\t\t\t}\n\n\t\t\ttypename std::aligned_storage<sizeof(T),alignof(T)>::type m_storage;\n\n\t\t};\n\n\t}\n\n\t\/\/ See note in out_value_policy about why we're not templating\n\t\/\/ for the parameter type.\n\ttemplate<typename T, class Policies = no_policies>\n\tstruct out_value_converter\n\t{\n\t\tenum { consumed_args = 1 };\n\n        template<class T>\n\t\tT& to_cpp(lua_State* L, by_reference<T>, int index)\n\t\t{\n\t\t\t\/\/specialized_converter_policy_n<1, Policies, T, lua_to_cpp> converter;\n\t\t\tstorage_.construct(converter_.to_cpp(L, decorated_type<T>(), index));\n\t\t\treturn storage_.get();\n\t\t}\n\n\t\tstatic int match(lua_State* L, by_reference<T>, int index)\n\t\t{\n\t\t\treturn converter_.match(L, decorated_type<T&>(), index);\n\t\t}\n\n\t\tvoid converter_postcall(lua_State* L, by_reference<T>, int) \n\t\t{\n\t\t\t\/\/specialized_converter_policy_n<2,Policies,T,cpp_to_lua> converter;\n\t\t\tconverter_.to_lua(L, storage_.get());\n\t\t\tstorage_.destroy();\n\t\t}\n\n\t\tT* to_cpp(lua_State* L, by_pointer<T>, int index)\n\t\t{\n\t\t\tstorage_.construct(converter_.to_cpp(L, decorated_type<T>(), index));\n\t\t\treturn &storage_.get();\n\t\t}\n\n\t\tint match(lua_State* L, by_pointer<T>, int index)\n\t\t{\n\t\t\treturn converter_.match(L, decorated_type<T>(), index);\n\t\t}\n\n\t\ttemplate<class T>\n\t\tvoid converter_postcall(lua_State* L, by_pointer<T>, int)\n\t\t{\n\t\t\t\/\/specialized_converter_policy_n<2, Policies, T, cpp_to_lua> converter;\n\t\t\tconverter_.to_lua(L, storage_.get());\n\t\t\tstorage_.destroy();\n\t\t}\n\n\tprivate:\n\t\tspecialized_converter_policy_n<1, Policies, T, lua_to_cpp > converter_;\n\t\tout_value_detail::temporary_storage_type<T> storage_;\n\t};\n\n\ttemplate<class Policies = no_policies>\n\tstruct out_value_policy\n\t{\n\t\tstruct only_accepts_nonconst_references_or_pointers {};\n\t\tstruct can_only_convert_from_lua_to_cpp {};\n\n\t\ttemplate<class T, class Direction>\n\t\tstruct specialize\n\t\t{\n\t\t\tstatic_assert(std::is_same< Direction, lua_to_cpp >::value, \"Out value policy can only convert from lua to cpp\");\n\t\t\tstatic_assert(meta::or_< is_nonconst_reference<T>, is_nonconst_pointer<T> >::value, \"Out value policy only accepts non const references or pointers\");\n\n\t\t\t\/\/ Note to myself:\n\t\t\t\/\/ Using the size and template members instead of a policy templated for the type seems\n\t\t\t\/\/ to be done to tame template bloat. Need to check if this is worth is.\n\t\t\tusing base_type = typename std::remove_pointer< typename std::remove_reference< T >::type >::type;\n\t\t\ttypedef out_value_converter<base_type, Policies> type;\n\t\t};\n\t};\n\n\ttemplate<int Size, class Policies = no_policies>\n\tstruct pure_out_value_converter\n\t{\n\t\tenum { consumed_args = 0 };\n\n        template<class T>\n\t\tT& to_cpp(lua_State*, by_reference<T>, int)\n\t\t{\n\t\t\tstorage_.construct<T>();\n\t\t\treturn storage_.get<T>();\n\t\t}\n\n\t\ttemplate<class T>\n\t\tstatic int match(lua_State*, by_reference<T>, int)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\ttemplate<class T>\n\t\tvoid converter_postcall(lua_State* L, by_reference<T>, int) \n\t\t{\n\t\t\tspecialized_converter_policy_n<1, Policies, T, cpp_to_lua> converter;\n\t\t\tconverter.to_lua(L, storage_.get<T>());\n\t\t\tstorage_.destroy<T>();\n\t\t}\n\n\t\ttemplate<class T>\n\t\tT* to_cpp(lua_State*, by_pointer<T>, int)\n\t\t{\n\t\t\tstorage_.construct<T>();\n\t\t\treturn &storage_.get<T>();\n\t\t}\n\n\t\ttemplate<class T>\n\t\tstatic int match(lua_State*, by_pointer<T>, int)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\ttemplate<class T>\n\t\tvoid converter_postcall(lua_State* L, by_pointer<T>, int) \n\t\t{\n\t\t\tspecialized_converter_policy_n<1, Policies, T, cpp_to_lua> converter;\n\t\t\tconverter.to_lua(L, storage_.get<T>());\n\t\t\tstorage_.destroy<T>();\n\t\t}\n\n\tprivate:\n\t\tout_value_detail::temporary_storage_size<Size> storage_;\n\t};\n\n\ttemplate<class Policies = no_policies>\n\tstruct pure_out_value_policy\n\t{\n\t\tstruct only_accepts_nonconst_references_or_pointers {};\n\t\tstruct can_only_convert_from_lua_to_cpp {};\n\n\t\ttemplate<class T, class Direction>\n\t\tstruct specialize\n\t\t{\n\t\t\tstatic_assert(std::is_same< Direction, lua_to_cpp >::value, \"Pure out value policy can only convert from lua to cpp\");\n\t\t\tstatic_assert(meta::or_< is_nonconst_reference<T>, is_nonconst_pointer<T> >::value, \"Pure out value policy only accepts non const references or pointers\");\n\n\t\t\ttypedef pure_out_value_converter<indirect_sizeof<T>::value, Policies> type;\n\t\t};\n\t};\n\t\n}}\n\nnamespace luabind\n{\n\ttemplate<unsigned int N, class Policies = no_policies >\n\tusing out_value = meta::type_list<converter_policy_injector<N,detail::out_value_policy<Policies>>>;\n\n\ttemplate<unsigned int N, class Policies = no_policies >\n\tusing pure_out_value = meta::type_list<converter_policy_injector<N,detail::pure_out_value_policy<Policies>>>;\n}\n\n#endif \/\/ LUABIND_OUT_VALUE_POLICY_HPP_INCLUDED\n\n<commit_msg>Fix out_value_converter compilation.<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\n#ifndef LUABIND_OUT_VALUE_POLICY_HPP_INCLUDED\n#define LUABIND_OUT_VALUE_POLICY_HPP_INCLUDED\n\n#include <luabind\/config.hpp>\n#include <luabind\/detail\/policy.hpp>    \/\/ for find_conversion_policy, etc\n#include <luabind\/detail\/decorate_type.hpp>  \/\/ for decorated_type\n#include <luabind\/detail\/primitives.hpp>  \/\/ for by_pointer, by_reference, etc\n#include <luabind\/detail\/typetraits.hpp>  \/\/ for is_nonconst_pointer, is_nonconst_reference, etc\n#include <new>                          \/\/ for operator new\n\nnamespace luabind { namespace detail\n{\n\ttemplate<int N>\n\tstruct char_array\n\t{\n\t\tchar storage[N];\n\t};\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_reference<U>);\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_const_reference<U>);\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_pointer<U>);\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_const_pointer<U>);\n\n\ttemplate<class U>\n\tchar_array<sizeof(typename identity<U>::type)> indirect_sizeof_test(by_value<U>);\n\n\ttemplate<class T>\n\tstruct indirect_sizeof\n\t{\n\t\tstatic const int value = sizeof(indirect_sizeof_test(decorated_type<T>()));\n\t};\n\t\n\tnamespace out_value_detail {\n\n\t\ttemplate< int Size >\n\t\tstruct temporary_storage_size {\n\t\t\t\n\t\t\ttemplate< typename T, typename... Args >\n\t\t\tvoid construct(Args&&... args)\n\t\t\t{\n\t\t\t\tnew (&m_storage) T(std::forward<Args>(args)...);\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tT& get() {\n\t\t\t\treturn *reinterpret_cast<T*>(&m_storage);\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tconst T& get() const {\n\t\t\t\treturn *reinterpret_cast<T*>(&m_storage);\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tvoid destroy()\n\t\t\t{\n\t\t\t\tget<T>().~T();\n\t\t\t}\n\n\t\t\ttypename std::aligned_storage<Size>::type m_storage;\n\t\t\n\t\t};\n\n\t\ttemplate< typename T >\n\t\tstruct temporary_storage_type {\n\n\t\t\ttemplate< typename... Args >\n\t\t\tvoid construct(Args&&... args)\n\t\t\t{\n\t\t\t\tnew (&m_storage) T(std::forward<Args>(args)...);\n\t\t\t}\n\n\t\t\tT& get() {\n\t\t\t\treturn *reinterpret_cast<T*>(&m_storage);\n\t\t\t}\n\n\t\t\tconst T& get() const {\n\t\t\t\treturn *reinterpret_cast<T*>(&m_storage);\n\t\t\t}\n\n\t\t\tvoid destroy()\n\t\t\t{\n\t\t\t\tget().~T();\n\t\t\t}\n\n\t\t\ttypename std::aligned_storage<sizeof(T),alignof(T)>::type m_storage;\n\n\t\t};\n\n\t}\n\n\t\/\/ See note in out_value_policy about why we're not templating\n\t\/\/ for the parameter type.\n\ttemplate<typename T, class Policies = no_policies>\n\tstruct out_value_converter\n\t{\n\t\tenum { consumed_args = 1 };\n\n        template<class T>\n\t\tT& to_cpp(lua_State* L, by_reference<T>, int index)\n\t\t{\n\t\t\t\/\/specialized_converter_policy_n<1, Policies, T, lua_to_cpp> converter;\n\t\t\tstorage_.construct(converter_.to_cpp(L, decorated_type<T>(), index));\n\t\t\treturn storage_.get();\n\t\t}\n\n\t\tint match(lua_State* L, by_reference<T>, int index)\n\t\t{\n\t\t\treturn converter_.match(L, decorated_type<T>(), index);\n\t\t}\n\n\t\tvoid converter_postcall(lua_State* L, by_reference<T>, int) \n\t\t{\n\t\t\t\/\/specialized_converter_policy_n<2,Policies,T,cpp_to_lua> converter;\n\t\t\tconverter_.to_lua(L, storage_.get());\n\t\t\tstorage_.destroy();\n\t\t}\n\n\t\tT* to_cpp(lua_State* L, by_pointer<T>, int index)\n\t\t{\n\t\t\tstorage_.construct(converter_.to_cpp(L, decorated_type<T>(), index));\n\t\t\treturn &storage_.get();\n\t\t}\n\n\t\tint match(lua_State* L, by_pointer<T>, int index)\n\t\t{\n\t\t\treturn converter_.match(L, decorated_type<T>(), index);\n\t\t}\n\n\t\ttemplate<class T>\n\t\tvoid converter_postcall(lua_State* L, by_pointer<T>, int)\n\t\t{\n\t\t\t\/\/specialized_converter_policy_n<2, Policies, T, cpp_to_lua> converter;\n\t\t\tconverter_.to_lua(L, storage_.get());\n\t\t\tstorage_.destroy();\n\t\t}\n\n\tprivate:\n\t\tspecialized_converter_policy_n<1, Policies, T, lua_to_cpp > converter_;\n\t\tout_value_detail::temporary_storage_type<T> storage_;\n\t};\n\n\ttemplate<class Policies = no_policies>\n\tstruct out_value_policy\n\t{\n\t\tstruct only_accepts_nonconst_references_or_pointers {};\n\t\tstruct can_only_convert_from_lua_to_cpp {};\n\n\t\ttemplate<class T, class Direction>\n\t\tstruct specialize\n\t\t{\n\t\t\tstatic_assert(std::is_same< Direction, lua_to_cpp >::value, \"Out value policy can only convert from lua to cpp\");\n\t\t\tstatic_assert(meta::or_< is_nonconst_reference<T>, is_nonconst_pointer<T> >::value, \"Out value policy only accepts non const references or pointers\");\n\n\t\t\t\/\/ Note to myself:\n\t\t\t\/\/ Using the size and template members instead of a policy templated for the type seems\n\t\t\t\/\/ to be done to tame template bloat. Need to check if this is worth is.\n\t\t\tusing base_type = typename std::remove_pointer< typename std::remove_reference< T >::type >::type;\n\t\t\ttypedef out_value_converter<base_type, Policies> type;\n\t\t};\n\t};\n\n\ttemplate<int Size, class Policies = no_policies>\n\tstruct pure_out_value_converter\n\t{\n\t\tenum { consumed_args = 0 };\n\n        template<class T>\n\t\tT& to_cpp(lua_State*, by_reference<T>, int)\n\t\t{\n\t\t\tstorage_.construct<T>();\n\t\t\treturn storage_.get<T>();\n\t\t}\n\n\t\ttemplate<class T>\n\t\tstatic int match(lua_State*, by_reference<T>, int)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\ttemplate<class T>\n\t\tvoid converter_postcall(lua_State* L, by_reference<T>, int) \n\t\t{\n\t\t\tspecialized_converter_policy_n<1, Policies, T, cpp_to_lua> converter;\n\t\t\tconverter.to_lua(L, storage_.get<T>());\n\t\t\tstorage_.destroy<T>();\n\t\t}\n\n\t\ttemplate<class T>\n\t\tT* to_cpp(lua_State*, by_pointer<T>, int)\n\t\t{\n\t\t\tstorage_.construct<T>();\n\t\t\treturn &storage_.get<T>();\n\t\t}\n\n\t\ttemplate<class T>\n\t\tstatic int match(lua_State*, by_pointer<T>, int)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\ttemplate<class T>\n\t\tvoid converter_postcall(lua_State* L, by_pointer<T>, int) \n\t\t{\n\t\t\tspecialized_converter_policy_n<1, Policies, T, cpp_to_lua> converter;\n\t\t\tconverter.to_lua(L, storage_.get<T>());\n\t\t\tstorage_.destroy<T>();\n\t\t}\n\n\tprivate:\n\t\tout_value_detail::temporary_storage_size<Size> storage_;\n\t};\n\n\ttemplate<class Policies = no_policies>\n\tstruct pure_out_value_policy\n\t{\n\t\tstruct only_accepts_nonconst_references_or_pointers {};\n\t\tstruct can_only_convert_from_lua_to_cpp {};\n\n\t\ttemplate<class T, class Direction>\n\t\tstruct specialize\n\t\t{\n\t\t\tstatic_assert(std::is_same< Direction, lua_to_cpp >::value, \"Pure out value policy can only convert from lua to cpp\");\n\t\t\tstatic_assert(meta::or_< is_nonconst_reference<T>, is_nonconst_pointer<T> >::value, \"Pure out value policy only accepts non const references or pointers\");\n\n\t\t\ttypedef pure_out_value_converter<indirect_sizeof<T>::value, Policies> type;\n\t\t};\n\t};\n\t\n}}\n\nnamespace luabind\n{\n\ttemplate<unsigned int N, class Policies = no_policies >\n\tusing out_value = meta::type_list<converter_policy_injector<N,detail::out_value_policy<Policies>>>;\n\n\ttemplate<unsigned int N, class Policies = no_policies >\n\tusing pure_out_value = meta::type_list<converter_policy_injector<N,detail::pure_out_value_policy<Policies>>>;\n}\n\n#endif \/\/ LUABIND_OUT_VALUE_POLICY_HPP_INCLUDED\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2014, 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 \"media_manager\/audio\/from_mic_to_file_recorder_thread.h\"\n#include <unistd.h>\n#include <cstring>\n#include <sstream>\n#include \"interfaces\/MOBILE_API.h\"\n#include \"utils\/logger.h\"\n\nnamespace media_manager {\n\nSDL_CREATE_LOG_VARIABLE(\"MediaManager\")\n\nGMainLoop* FromMicToFileRecorderThread::loop = NULL;\n\n\/\/ As per spec, AudioPassThru recording is in monaural\nstatic const int kNumAudioChannels = 1;\n\nFromMicToFileRecorderThread::FromMicToFileRecorderThread(\n    const std::string& output_file,\n    int32_t duration,\n    mobile_apis::SamplingRate::eType sampling_rate,\n    mobile_apis::BitsPerSample::eType bits_per_sample,\n    mobile_apis::AudioType::eType audio_type)\n    : threads::ThreadDelegate()\n    , argc_(5)\n    , argv_(NULL)\n    , oKey_(\"-o\")\n    , tKey_(\"-t\")\n    , sleepThread_(NULL)\n    , outputFileName_(output_file)\n    , samplingRate_(sampling_rate)\n    , bitsPerSample_(bits_per_sample) {\n  SDL_LOG_AUTO_TRACE();\n  set_record_duration(duration);\n  \/\/ audio_type is not used as we always employ LPCM\n}\n\nFromMicToFileRecorderThread::~FromMicToFileRecorderThread() {\n  SDL_LOG_AUTO_TRACE();\n  if (sleepThread_) {\n    sleepThread_->Stop(threads::Thread::kThreadSoftStop);\n    delete sleepThread_->GetDelegate();\n    threads::DeleteThread(sleepThread_);\n  }\n}\n\nvoid FromMicToFileRecorderThread::set_output_file(\n    const std::string& output_file) {\n  SDL_LOG_AUTO_TRACE();\n  outputFileName_ = output_file;\n}\n\nvoid FromMicToFileRecorderThread::set_record_duration(int32_t duration) {\n  SDL_LOG_AUTO_TRACE();\n\n  std::stringstream stringStream;\n  stringStream << duration \/ 1000;\n  durationString_ = stringStream.str();\n}\n\nvoid FromMicToFileRecorderThread::initArgs() {\n  SDL_LOG_AUTO_TRACE();\n\n  argv_ = new gchar*[argc_];\n\n  argv_[0] = new gchar[14];\n  argv_[1] = new gchar[3];\n  argv_[2] = new gchar[outputFileName_.length() + 1];\n  argv_[3] = new gchar[3];\n  argv_[4] = new gchar[durationString_.length() + 1];\n\n  std::strcpy(argv_[0], \"AudioManager\");\n  std::strcpy(argv_[1], oKey_.c_str());\n  std::strcpy(argv_[2], outputFileName_.c_str());\n  std::strcpy(argv_[3], tKey_.c_str());\n  std::strcpy(argv_[4], durationString_.c_str());\n}\n\nvoid FromMicToFileRecorderThread::deinitArgs() {\n  SDL_LOG_AUTO_TRACE();\n\n  if (argv_) {\n    for (int32_t i = 0; i < argc_; ++i) {\n      delete[] argv_[i];\n    }\n    delete[] argv_;\n    argv_ = NULL;\n  }\n}\n\nvoid FromMicToFileRecorderThread::threadMain() {\n  SDL_LOG_AUTO_TRACE();\n\n  {\n    sync_primitives::AutoLock auto_lock(stopFlagLock_);\n    shouldBeStoped_ = false;\n  }\n\n  initArgs();\n\n  GstElement* pipeline;\n  GstElement *alsasrc, *audioconvert, *capsfilter, *wavenc, *filesink;\n  GstCaps* audiocaps;\n  GstBus* bus;\n\n  const gchar* device = \"hw:0,0\";\n  gchar* outfile = NULL;\n  gint duration = -1;\n  GOptionContext* context = NULL;\n  GError* err = NULL;\n  GOptionEntry entries[] = {{\"device\",\n                             'd',\n                             0,\n                             G_OPTION_ARG_FILENAME,\n                             &device,\n                             \"device file (Default: hw:0,0)\",\n                             \"SRC\"},\n                            {\"output\",\n                             'o',\n                             0,\n                             G_OPTION_ARG_FILENAME,\n                             &outfile,\n                             \"save output of the stream to DEST\",\n                             \"DEST\"},\n                            {\"duration\",\n                             't',\n                             0,\n                             G_OPTION_ARG_INT,\n                             &duration,\n                             \"length of time in seconds to capture\",\n                             \"int32_t\"},\n                            {NULL}};\n  \/\/ g_option_context_parse() modifies params, so keep argc_ and argv_\n  int32_t argc = argc_;\n  gchar** argv = new gchar*[argc];\n  for (int32_t i = 0; i < argc; ++i) {\n    argv[i] = argv_[i];\n  }\n\n#ifndef GLIB_VERSION_2_32  \/\/ g_thread_init() does nothing since 2.32\n  if (!g_thread_supported()) {\n    g_thread_init(NULL);\n  }\n#endif\n  \/\/ Parse the arguments\n  context = g_option_context_new(\"-- M-AUDIO RAW\");\n  g_option_context_add_main_entries(context, entries, NULL);\n  g_option_context_add_group(context, gst_init_get_option_group());\n  if (!g_option_context_parse(context, &argc, &argv, &err)) {\n    g_error(\"%s\\n\", err->message);\n  }\n\n  \/\/ Check for proper arguments\n  if (outfile == NULL) {\n    g_error(\"Must supply destination (-d FILE)\\n\");\n  }\n\n  SDL_LOG_TRACE(\"Reading from device: \" << device);\n  SDL_LOG_TRACE(\"Saving pipeline output to: \" << outfile);\n  SDL_LOG_TRACE(\"Duration set to: \" << duration);\n\n  \/\/ Initialize gstreamer and setup the main loop information\n  gst_init(&argc, &argv);\n\n  delete[] argv;\n  argv = NULL;\n\n  pipeline = gst_pipeline_new(\"vga2usb-h264\");\n\n  \/\/ Set up error handling\n  bus = gst_pipeline_get_bus(GST_PIPELINE(pipeline));\n  gst_bus_add_watch(\n      bus,\n      reinterpret_cast<int32_t (*)(_GstBus*, _GstMessage*, void*)>(recvmsg),\n      NULL);\n  gst_object_unref(bus);\n\n  \/\/ Create all of the elements to be added to the pipeline\n  alsasrc = gst_element_factory_make(\"alsasrc\", \"alsasrc0\");\n  audioconvert = gst_element_factory_make(\"audioconvert\", \"audioconvert0\");\n  capsfilter = gst_element_factory_make(\"capsfilter\", \"filter0\");\n  wavenc = gst_element_factory_make(\"wavenc\", \"wavenc0\");\n  filesink = gst_element_factory_make(\"filesink\", \"filesink0\");\n\n  \/\/ Create a capability to specify audio format. It also downmixes the recorded\n  \/\/ audio to monaural.\n  std::string caps_string = create_caps_string();\n  SDL_LOG_DEBUG(\"Using audio caps: \" << caps_string);\n  audiocaps = gst_caps_from_string(caps_string.c_str());\n\n  \/\/ Assert that all the elements were created\n  if (!alsasrc || !audioconvert || !capsfilter || !wavenc || !filesink ||\n      !audiocaps) {\n    g_error(\"Failed creating one or more of the pipeline elements.\\n\");\n  }\n\n  \/\/ Set input and output destinations\n  g_object_set(G_OBJECT(alsasrc), \"device\", device, NULL);\n  g_object_set(G_OBJECT(filesink), \"location\", outfile, NULL);\n\n  \/\/ Add the elements to the pipeline\n  gst_bin_add_many(GST_BIN(pipeline),\n                   alsasrc,\n                   audioconvert,\n                   capsfilter,\n                   wavenc,\n                   filesink,\n                   NULL);\n\n  \/\/ Link the elements\n  gst_element_link_many(\n      alsasrc, audioconvert, capsfilter, wavenc, filesink, NULL);\n\n  \/\/ set the capability\n  g_object_set(G_OBJECT(capsfilter), \"caps\", audiocaps, NULL);\n  gst_caps_unref(audiocaps);\n\n  gst_element_set_state(pipeline, GST_STATE_PLAYING);\n\n  SDL_LOG_TRACE(\"Initializing pipeline ...\");\n  while (GST_STATE(pipeline) != GST_STATE_PLAYING) {\n    bool shouldBeStoped;\n    {\n      \/\/ FIXME(dchmerev@luxoft.com):\n      sync_primitives::AutoLock auto_lock(stopFlagLock_);\n      shouldBeStoped = shouldBeStoped_;\n    }\n\n    if (shouldBeStoped) {\n      gst_element_set_state(pipeline, GST_STATE_NULL);\n      gst_object_unref(GST_OBJECT(pipeline));\n      g_option_context_free(context);\n\n      deinitArgs();\n      return;\n    }\n  }\n  SDL_LOG_TRACE(\"Pipeline started ...\\n\");\n\n  \/\/ Start up a timer for the pipeline\n  if (duration > 0) {\n    GstTimeout timeout;\n    timeout.pipeline = pipeline;\n    timeout.duration = duration;\n\n    sleepThread_ =\n        threads::CreateThread(\"SleepThread\", new SleepThreadDelegate(timeout));\n    sleepThread_->Start();\n  }\n\n  loop = g_main_loop_new(NULL, FALSE);\n\n  g_main_loop_run(loop);\n\n  gst_element_set_state(pipeline, GST_STATE_NULL);\n\n  SDL_LOG_TRACE(\"Deleting pipeline\\n\");\n  gst_object_unref(GST_OBJECT(pipeline));\n  g_main_loop_unref(loop);\n  g_option_context_free(context);\n\n  deinitArgs();\n\n  loop = NULL;\n}\n\nstd::string FromMicToFileRecorderThread::create_caps_string() {\n  SDL_LOG_AUTO_TRACE();\n\n  std::stringstream ss;\n  ss << \"audio\/x-raw\";\n\n  switch (bitsPerSample_) {\n    case mobile_apis::BitsPerSample::BitsPerSample_8_BIT:\n      \/\/ format is 8-bit unsigned\n      ss << \",format=(string)U8\";\n      break;\n    case mobile_apis::BitsPerSample::BitsPerSample_16_BIT:\n      \/\/ format is 16-bit signed, in little endian\n      ss << \",format=(string)S16LE\";\n      break;\n    default:\n      \/\/ do not specify the format; use system default\n      break;\n  }\n\n  switch (samplingRate_) {\n    case mobile_apis::SamplingRate::SamplingRate_8KHZ:\n      ss << \",rate=8000\";\n      break;\n    case mobile_apis::SamplingRate::SamplingRate_16KHZ:\n      ss << \",rate=16000\";\n      break;\n    case mobile_apis::SamplingRate::SamplingRate_22KHZ:\n      ss << \",rate=22050\";\n      break;\n    case mobile_apis::SamplingRate::SamplingRate_44KHZ:\n      ss << \",rate=44100\";\n      break;\n    default:\n      \/\/ do not specify the sampling rate; use system default\n      break;\n  }\n\n  ss << \",channels=\" << kNumAudioChannels;\n\n  return ss.str();\n}\n\nFromMicToFileRecorderThread::SleepThreadDelegate::SleepThreadDelegate(\n    GstTimeout timeout)\n    : threads::ThreadDelegate(), timeout_(timeout) {}\n\nvoid FromMicToFileRecorderThread::SleepThreadDelegate::threadMain() {\n  SDL_LOG_TRACE(\"Sleep for \" << timeout_.duration << \" seconds\");\n\n  sleep(timeout_.duration);\n\n  if (NULL != loop) {\n    if (g_main_loop_is_running(loop)) {\n      gst_element_send_event(timeout_.pipeline, gst_event_new_eos());\n    }\n  }\n}\n\nvoid FromMicToFileRecorderThread::exitThreadMain() {\n  SDL_LOG_AUTO_TRACE();\n\n  if (NULL != loop) {\n    if (g_main_loop_is_running(loop)) {\n      SDL_LOG_TRACE(\"Quit loop\\n\");\n      g_main_loop_quit(loop);\n    }\n  }\n\n  if (sleepThread_) {\n    SDL_LOG_DEBUG(\"Stop sleep thread\\n\");\n    sleepThread_->stop();\n  }\n\n  SDL_LOG_TRACE(\"Set should be stopped flag\\n\");\n  sync_primitives::AutoLock auto_lock(stopFlagLock_);\n  shouldBeStoped_ = true;\n}\n\n}  \/\/ namespace media_manager\n<commit_msg>Fix thread stop method (#3712)<commit_after>\/*\n * Copyright (c) 2014, 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 \"media_manager\/audio\/from_mic_to_file_recorder_thread.h\"\n#include <unistd.h>\n#include <cstring>\n#include <sstream>\n#include \"interfaces\/MOBILE_API.h\"\n#include \"utils\/logger.h\"\n\nnamespace media_manager {\n\nSDL_CREATE_LOG_VARIABLE(\"MediaManager\")\n\nGMainLoop* FromMicToFileRecorderThread::loop = NULL;\n\n\/\/ As per spec, AudioPassThru recording is in monaural\nstatic const int kNumAudioChannels = 1;\n\nFromMicToFileRecorderThread::FromMicToFileRecorderThread(\n    const std::string& output_file,\n    int32_t duration,\n    mobile_apis::SamplingRate::eType sampling_rate,\n    mobile_apis::BitsPerSample::eType bits_per_sample,\n    mobile_apis::AudioType::eType audio_type)\n    : threads::ThreadDelegate()\n    , argc_(5)\n    , argv_(NULL)\n    , oKey_(\"-o\")\n    , tKey_(\"-t\")\n    , sleepThread_(NULL)\n    , outputFileName_(output_file)\n    , samplingRate_(sampling_rate)\n    , bitsPerSample_(bits_per_sample) {\n  SDL_LOG_AUTO_TRACE();\n  set_record_duration(duration);\n  \/\/ audio_type is not used as we always employ LPCM\n}\n\nFromMicToFileRecorderThread::~FromMicToFileRecorderThread() {\n  SDL_LOG_AUTO_TRACE();\n  if (sleepThread_) {\n    sleepThread_->Stop(threads::Thread::kThreadSoftStop);\n    delete sleepThread_->GetDelegate();\n    threads::DeleteThread(sleepThread_);\n  }\n}\n\nvoid FromMicToFileRecorderThread::set_output_file(\n    const std::string& output_file) {\n  SDL_LOG_AUTO_TRACE();\n  outputFileName_ = output_file;\n}\n\nvoid FromMicToFileRecorderThread::set_record_duration(int32_t duration) {\n  SDL_LOG_AUTO_TRACE();\n\n  std::stringstream stringStream;\n  stringStream << duration \/ 1000;\n  durationString_ = stringStream.str();\n}\n\nvoid FromMicToFileRecorderThread::initArgs() {\n  SDL_LOG_AUTO_TRACE();\n\n  argv_ = new gchar*[argc_];\n\n  argv_[0] = new gchar[14];\n  argv_[1] = new gchar[3];\n  argv_[2] = new gchar[outputFileName_.length() + 1];\n  argv_[3] = new gchar[3];\n  argv_[4] = new gchar[durationString_.length() + 1];\n\n  std::strcpy(argv_[0], \"AudioManager\");\n  std::strcpy(argv_[1], oKey_.c_str());\n  std::strcpy(argv_[2], outputFileName_.c_str());\n  std::strcpy(argv_[3], tKey_.c_str());\n  std::strcpy(argv_[4], durationString_.c_str());\n}\n\nvoid FromMicToFileRecorderThread::deinitArgs() {\n  SDL_LOG_AUTO_TRACE();\n\n  if (argv_) {\n    for (int32_t i = 0; i < argc_; ++i) {\n      delete[] argv_[i];\n    }\n    delete[] argv_;\n    argv_ = NULL;\n  }\n}\n\nvoid FromMicToFileRecorderThread::threadMain() {\n  SDL_LOG_AUTO_TRACE();\n\n  {\n    sync_primitives::AutoLock auto_lock(stopFlagLock_);\n    shouldBeStoped_ = false;\n  }\n\n  initArgs();\n\n  GstElement* pipeline;\n  GstElement *alsasrc, *audioconvert, *capsfilter, *wavenc, *filesink;\n  GstCaps* audiocaps;\n  GstBus* bus;\n\n  const gchar* device = \"hw:0,0\";\n  gchar* outfile = NULL;\n  gint duration = -1;\n  GOptionContext* context = NULL;\n  GError* err = NULL;\n  GOptionEntry entries[] = {{\"device\",\n                             'd',\n                             0,\n                             G_OPTION_ARG_FILENAME,\n                             &device,\n                             \"device file (Default: hw:0,0)\",\n                             \"SRC\"},\n                            {\"output\",\n                             'o',\n                             0,\n                             G_OPTION_ARG_FILENAME,\n                             &outfile,\n                             \"save output of the stream to DEST\",\n                             \"DEST\"},\n                            {\"duration\",\n                             't',\n                             0,\n                             G_OPTION_ARG_INT,\n                             &duration,\n                             \"length of time in seconds to capture\",\n                             \"int32_t\"},\n                            {NULL}};\n  \/\/ g_option_context_parse() modifies params, so keep argc_ and argv_\n  int32_t argc = argc_;\n  gchar** argv = new gchar*[argc];\n  for (int32_t i = 0; i < argc; ++i) {\n    argv[i] = argv_[i];\n  }\n\n#ifndef GLIB_VERSION_2_32  \/\/ g_thread_init() does nothing since 2.32\n  if (!g_thread_supported()) {\n    g_thread_init(NULL);\n  }\n#endif\n  \/\/ Parse the arguments\n  context = g_option_context_new(\"-- M-AUDIO RAW\");\n  g_option_context_add_main_entries(context, entries, NULL);\n  g_option_context_add_group(context, gst_init_get_option_group());\n  if (!g_option_context_parse(context, &argc, &argv, &err)) {\n    g_error(\"%s\\n\", err->message);\n  }\n\n  \/\/ Check for proper arguments\n  if (outfile == NULL) {\n    g_error(\"Must supply destination (-d FILE)\\n\");\n  }\n\n  SDL_LOG_TRACE(\"Reading from device: \" << device);\n  SDL_LOG_TRACE(\"Saving pipeline output to: \" << outfile);\n  SDL_LOG_TRACE(\"Duration set to: \" << duration);\n\n  \/\/ Initialize gstreamer and setup the main loop information\n  gst_init(&argc, &argv);\n\n  delete[] argv;\n  argv = NULL;\n\n  pipeline = gst_pipeline_new(\"vga2usb-h264\");\n\n  \/\/ Set up error handling\n  bus = gst_pipeline_get_bus(GST_PIPELINE(pipeline));\n  gst_bus_add_watch(\n      bus,\n      reinterpret_cast<int32_t (*)(_GstBus*, _GstMessage*, void*)>(recvmsg),\n      NULL);\n  gst_object_unref(bus);\n\n  \/\/ Create all of the elements to be added to the pipeline\n  alsasrc = gst_element_factory_make(\"alsasrc\", \"alsasrc0\");\n  audioconvert = gst_element_factory_make(\"audioconvert\", \"audioconvert0\");\n  capsfilter = gst_element_factory_make(\"capsfilter\", \"filter0\");\n  wavenc = gst_element_factory_make(\"wavenc\", \"wavenc0\");\n  filesink = gst_element_factory_make(\"filesink\", \"filesink0\");\n\n  \/\/ Create a capability to specify audio format. It also downmixes the recorded\n  \/\/ audio to monaural.\n  std::string caps_string = create_caps_string();\n  SDL_LOG_DEBUG(\"Using audio caps: \" << caps_string);\n  audiocaps = gst_caps_from_string(caps_string.c_str());\n\n  \/\/ Assert that all the elements were created\n  if (!alsasrc || !audioconvert || !capsfilter || !wavenc || !filesink ||\n      !audiocaps) {\n    g_error(\"Failed creating one or more of the pipeline elements.\\n\");\n  }\n\n  \/\/ Set input and output destinations\n  g_object_set(G_OBJECT(alsasrc), \"device\", device, NULL);\n  g_object_set(G_OBJECT(filesink), \"location\", outfile, NULL);\n\n  \/\/ Add the elements to the pipeline\n  gst_bin_add_many(GST_BIN(pipeline),\n                   alsasrc,\n                   audioconvert,\n                   capsfilter,\n                   wavenc,\n                   filesink,\n                   NULL);\n\n  \/\/ Link the elements\n  gst_element_link_many(\n      alsasrc, audioconvert, capsfilter, wavenc, filesink, NULL);\n\n  \/\/ set the capability\n  g_object_set(G_OBJECT(capsfilter), \"caps\", audiocaps, NULL);\n  gst_caps_unref(audiocaps);\n\n  gst_element_set_state(pipeline, GST_STATE_PLAYING);\n\n  SDL_LOG_TRACE(\"Initializing pipeline ...\");\n  while (GST_STATE(pipeline) != GST_STATE_PLAYING) {\n    bool shouldBeStoped;\n    {\n      \/\/ FIXME(dchmerev@luxoft.com):\n      sync_primitives::AutoLock auto_lock(stopFlagLock_);\n      shouldBeStoped = shouldBeStoped_;\n    }\n\n    if (shouldBeStoped) {\n      gst_element_set_state(pipeline, GST_STATE_NULL);\n      gst_object_unref(GST_OBJECT(pipeline));\n      g_option_context_free(context);\n\n      deinitArgs();\n      return;\n    }\n  }\n  SDL_LOG_TRACE(\"Pipeline started ...\\n\");\n\n  \/\/ Start up a timer for the pipeline\n  if (duration > 0) {\n    GstTimeout timeout;\n    timeout.pipeline = pipeline;\n    timeout.duration = duration;\n\n    sleepThread_ =\n        threads::CreateThread(\"SleepThread\", new SleepThreadDelegate(timeout));\n    sleepThread_->Start();\n  }\n\n  loop = g_main_loop_new(NULL, FALSE);\n\n  g_main_loop_run(loop);\n\n  gst_element_set_state(pipeline, GST_STATE_NULL);\n\n  SDL_LOG_TRACE(\"Deleting pipeline\\n\");\n  gst_object_unref(GST_OBJECT(pipeline));\n  g_main_loop_unref(loop);\n  g_option_context_free(context);\n\n  deinitArgs();\n\n  loop = NULL;\n}\n\nstd::string FromMicToFileRecorderThread::create_caps_string() {\n  SDL_LOG_AUTO_TRACE();\n\n  std::stringstream ss;\n  ss << \"audio\/x-raw\";\n\n  switch (bitsPerSample_) {\n    case mobile_apis::BitsPerSample::BitsPerSample_8_BIT:\n      \/\/ format is 8-bit unsigned\n      ss << \",format=(string)U8\";\n      break;\n    case mobile_apis::BitsPerSample::BitsPerSample_16_BIT:\n      \/\/ format is 16-bit signed, in little endian\n      ss << \",format=(string)S16LE\";\n      break;\n    default:\n      \/\/ do not specify the format; use system default\n      break;\n  }\n\n  switch (samplingRate_) {\n    case mobile_apis::SamplingRate::SamplingRate_8KHZ:\n      ss << \",rate=8000\";\n      break;\n    case mobile_apis::SamplingRate::SamplingRate_16KHZ:\n      ss << \",rate=16000\";\n      break;\n    case mobile_apis::SamplingRate::SamplingRate_22KHZ:\n      ss << \",rate=22050\";\n      break;\n    case mobile_apis::SamplingRate::SamplingRate_44KHZ:\n      ss << \",rate=44100\";\n      break;\n    default:\n      \/\/ do not specify the sampling rate; use system default\n      break;\n  }\n\n  ss << \",channels=\" << kNumAudioChannels;\n\n  return ss.str();\n}\n\nFromMicToFileRecorderThread::SleepThreadDelegate::SleepThreadDelegate(\n    GstTimeout timeout)\n    : threads::ThreadDelegate(), timeout_(timeout) {}\n\nvoid FromMicToFileRecorderThread::SleepThreadDelegate::threadMain() {\n  SDL_LOG_TRACE(\"Sleep for \" << timeout_.duration << \" seconds\");\n\n  sleep(timeout_.duration);\n\n  if (NULL != loop) {\n    if (g_main_loop_is_running(loop)) {\n      gst_element_send_event(timeout_.pipeline, gst_event_new_eos());\n    }\n  }\n}\n\nvoid FromMicToFileRecorderThread::exitThreadMain() {\n  SDL_LOG_AUTO_TRACE();\n\n  if (NULL != loop) {\n    if (g_main_loop_is_running(loop)) {\n      SDL_LOG_TRACE(\"Quit loop\\n\");\n      g_main_loop_quit(loop);\n    }\n  }\n\n  if (sleepThread_) {\n    SDL_LOG_DEBUG(\"Stop sleep thread\\n\");\n    sleepThread_->Stop(threads::Thread::kThreadStopDelegate);\n  }\n\n  SDL_LOG_TRACE(\"Set should be stopped flag\\n\");\n  sync_primitives::AutoLock auto_lock(stopFlagLock_);\n  shouldBeStoped_ = true;\n}\n\n}  \/\/ namespace media_manager\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>tpcNClsFound -> tpcNClsFoundMin<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: javacompskeleton.cxx,v $\n *\n *  $Revision: 1.1 $\n *\n *  last change: $Author: jsc $ $Date: 2005-08-23 08:30: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#include \"skeletonjava.hxx\"\n\nusing namespace ::codemaker::java;\n\nnamespace skeletonmaker { namespace java {\n\nvoid generatePackage(std::ostream & o, const rtl::OString & implname)\n{\n    short count=0;\n    sal_Int32 index = implname.lastIndexOf('.');\n    if (index != -1) {\n        o << \"package \" << implname.copy(0, index) << \";\\n\\n\";\n    }\n}\n\nvoid generateImports(std::ostream & o,\n         const std::hash_set< rtl::OString, rtl::OStringHash >& interfaces,\n         const rtl::OString & propertyhelper,\n         bool serviceobject, bool supportxcomponent)\n{\n    o << \"import com.sun.star.uno.XComponentContext;\\n\";\n    if (serviceobject) {\n        o << \"import com.sun.star.lib.uno.helper.Factory;\\n\";\n        o << \"import com.sun.star.lang.XSingleComponentFactory;\\n\";\n        o << \"import com.sun.star.registry.XRegistryKey;\\n\";\n    }\n\n    if  (!propertyhelper.equals(\"_\")) {\n        if (supportxcomponent)\n            o << \"import com.sun.star.lib.uno.helper.ComponentBase;\\n\";\n        else\n            o << \"import com.sun.star.lib.uno.helper.WeakBase;\\n\";\n    }\n    if (propertyhelper.getLength() > 0) {\n        if (propertyhelper.equals(\"_\")) {\n            o << \"import com.sun.star.lib.uno.helper.PropertySet;\\n\";\n            o << \"import com.sun.star.beans.PropertyAttribute;\\n\";\n        } else {\n            o << \"import com.sun.star.uno.Type;\\n\";\n            o << \"import com.sun.star.lib.uno.helper.PropertySetMixin;\\n\";\n        }\n    }\n\n\/\/     std::hash_set< rtl::OString, rtl::OStringHash >::const_iterator iter = interfaces.begin();\n\/\/     while (iter != interfaces.end()) {\n\/\/         o << \"import \" << ((*iter).getStr()) << \";\\n\";\n\/\/         iter++;\n\/\/     }\n}\n\nvoid generateCompFunctions(std::ostream & o, const rtl::OString & classname)\n{\n    o << \"    public static XSingleComponentFactory __getComponentFactory(\"\n      << \"String sImplementationName ) {\\n\"\n      << \"        XSingleComponentFactory xFactory = null;\\n\\n\"\n      << \"        if ( sImplementationName.equals( m_implementationName ) )\\n\"\n      << \"            xFactory = Factory.createComponentFactory(\"\n      << classname << \".class, m_serviceNames);\\n\"\n      << \"        return xFactory;\\n    }\\n\\n\";\n\n    o << \"    public static boolean __writeRegistryServiceInfo(\"\n      << \"XRegistryKey xRegistryKey ) {\\n\"\n      << \"        return Factory.writeRegistryServiceInfo(m_implementationName,\\n\"\n      << \"                                                m_serviceNames,\\n\"\n      << \"                                                xRegistryKey);\\n\"\n      << \"    }\\n\\n\";\n}\n\nvoid generateXServiceInfoBodies(std::ostream& o)\n{\n    o << \"    \/* com.sun.star.lang.XServiceInfo *\/\\n\";\n    o << \"    public java.lang.String getImplementationName() {\\n\"\n      << \"         return m_implementationName;\\n    }\\n\\n\";\n\n    o << \"    public boolean supportsService( java.lang.String sService ) {\\n\"\n      << \"        int len = m_serviceNames.length;\\n\\n\"\n      << \"        for( int i=0; i < len; i++) {\\n\"\n      << \"            if (sService.equals(m_serviceNames[i]))\\n\"\n      << \"                return true;\\n\"\n      << \"        }\\n        return false;\\n    }\\n\\n\";\n\n    o << \"    public java.lang.String[] getSupportedServiceNames() {\\n\"\n      << \"        return m_serviceNames;\\n    }\\n\\n\";\n}\n\n\nbool checkAttribute(rtl::OStringBuffer& attributeValue, sal_uInt16 attribute) {\n    bool cast = false;\n    sal_uInt16 attributes[9] = {\n        \/* com::sun::star::beans::PropertyValue::MAYBEVOID *\/ 1,\n        \/* com::sun::star::beans::PropertyValue::BOUND *\/ 2,\n        \/* com::sun::star::beans::PropertyValue::CONSTRAINED *\/ 4,\n        \/* com::sun::star::beans::PropertyValue::TRANSIENT *\/ 8,\n        \/* com::sun::star::beans::PropertyValue::READONLY *\/ 16,\n        \/* com::sun::star::beans::PropertyValue::MAYBEAMBIGIOUS *\/ 32,\n        \/* com::sun::star::beans::PropertyValue::MAYBEDEFAULT *\/ 64,\n        \/* com::sun::star::beans::PropertyValue::REMOVEABLE *\/ 128,\n        \/* com::sun::star::beans::PropertyValue::OPTIONAL *\/ 256 };\n\n    for (sal_uInt16 i = 0; i < 9; i++) {\n        if (attribute & attributes[i]) {\n            if (attributeValue.getLength() > 0) {\n                cast |= true;\n                attributeValue.append(\"|\");\n            }\n            switch (attributes[i]) {\n            case 1:\n                attributeValue.append(\"PropertyAttribute.MAYBEVOID\");\n                break;\n            case 2:\n                attributeValue.append(\"PropertyAttribute.BOUND\");\n                break;\n            case 4:\n                attributeValue.append(\"PropertyAttribute.CONSTRAINED\");\n                break;\n            case 8:\n                attributeValue.append(\"PropertyAttribute.TRANSIENT\");\n                break;\n            case 16:\n                attributeValue.append(\"PropertyAttribute.READONLY\");\n                break;\n            case 32:\n                attributeValue.append(\"PropertyAttribute.MAYBEAMBIGIOUS\");\n                break;\n            case 64:\n                attributeValue.append(\"PropertyAttribute.MAYBEDEFAULT\");\n                break;\n            case 128:\n                attributeValue.append(\"PropertyAttribute.REMOVEABLE\");\n                break;\n            case 256:\n                attributeValue.append(\"PropertyAttribute.OPTIONAL\");\n                break;\n            }\n        }\n    }\n    if (cast) {\n        attributeValue.insert(0, '(');\n        attributeValue.append(')');\n    }\n\n    return cast;\n}\n\nvoid registerProperties(std::ostream& o,\n                        TypeManager const & manager,\n                        const StringPairHashMap& properties,\n                        const rtl::OString& indentation)\n{\n    if (!properties.empty()) {\n        StringPairHashMap::const_iterator iter =\n            properties.begin();\n        bool cast = false;\n        rtl::OStringBuffer attributeValue;\n        while (iter != properties.end()) {\n            if (iter->second.second > 0) {\n                cast = checkAttribute(attributeValue, iter->second.second);\n            } else {\n                cast = true;\n                attributeValue.append('0');\n            }\n\n            o << indentation << \"registerProperty(\\\"\" << iter->first\n              << \"\\\", \\\"m_\" << iter->first << \"\\\",\\n\"\n              << indentation << \"      \";\n            if (cast)\n                o << \"(short)\";\n\n            o << attributeValue.makeStringAndClear() << \");\\n\";\n            iter++;\n        }\n    }\n}\n\nvoid generateMethodBodies(std::ostream& o,\n         ProgramOptions const & options,\n         TypeManager const & manager,\n         const std::hash_set< rtl::OString, rtl::OStringHash >& interfaces,\n         const rtl::OString& indentation)\n{\n    std::hash_set< rtl::OString, rtl::OStringHash >::const_iterator iter =\n        interfaces.begin();\n    codemaker::GeneratedTypeSet generated;\n    while (iter != interfaces.end()) {\n        if ( (*iter).equals(\"com.sun.star.lang.XServiceInfo\")) {\n                generateXServiceInfoBodies(o);\n        } else {\n            typereg::Reader reader(manager.getTypeReader((*iter).replace('.','\/')));\n            printMethods(o, options, manager, reader, generated, \"_\",\n                         indentation, true);\n        }\n        iter++;\n    }\n}\n\nvoid generateClassDefinition(std::ostream& o,\n         ProgramOptions const & options,\n         TypeManager const & manager,\n         const rtl::OString & classname,\n         const std::hash_set< rtl::OString, rtl::OStringHash >& services,\n         const std::hash_set< rtl::OString, rtl::OStringHash >& interfaces,\n         const StringPairHashMap& properties,\n         const rtl::OString& propertyhelper, bool supportxcomponent)\n{\n    o << \"\\n\\npublic final class \" << classname << \" extends \";\n\n    if (!interfaces.empty()) {\n        if (propertyhelper.equals(\"_\")) {\n                o << \"PropertySet\\n\";\n        } else {\n            if (supportxcomponent)\n                o << \"ComponentBase\\n\";\n            else\n                o << \"WeakBase\\n\";\n        }\n        o << \"    implements \";\n        std::hash_set< rtl::OString, rtl::OStringHash >::const_iterator iter =\n            interfaces.begin();\n        while (iter != interfaces.end()) {\n            o << (*iter);\n            iter++;\n            if (iter != interfaces.end())\n                o << \",\\n               \";\n        }\n    }\n    o << \"\\n{\\n\";\n\n    o << \"    private final XComponentContext m_context;\\n\";\n\n    \/\/ check property helper\n    if (propertyhelper.getLength() > 1) {\n        o << \"    private final PropertySetMixin m_prophlp;\";\n    }\n\n    o << \"    private static final java.lang.String m_implementationName = \"\n      << classname << \".class.getName();\\n\";\n\n    if (!services.empty()) {\n        o << \"    private static final java.lang.String[] m_serviceNames = {\\n\";\n        std::hash_set< rtl::OString, rtl::OStringHash >::const_iterator iter =\n            services.begin();\n        while (iter != services.end()) {\n            o << \"        \\\"\" << (*iter).replace('\/','.') << \"\\\"\";\n            iter++;\n            if (iter != services.end())\n                o << \",\\n\";\n            else\n                o << \" };\\n\";\n        }\n    }\n    o << \"\\n    public \" << classname << \"( XComponentContext context ) {\\n\"\n      << \"        m_context = context;\\n\";\n    if (propertyhelper.equals(\"_\")) {\n        registerProperties(o, manager, properties, \"        \");\n    } else {\n        if (propertyhelper.getLength() > 1) {\n            o << \"        m_prophlp = new PropertySetMixin(\\n\"\n              << \"            m_context, this, new Type(\" << propertyhelper\n              << \".class));\\n\";\n        }\n    }\n    o << \"    };\\n\\n\";\n\n    if (!services.empty())\n        generateCompFunctions(o, classname);\n\n    generateMethodBodies(o, options, manager, interfaces, \"    \");\n\n    if (!properties.empty()) {\n        StringPairHashMap::const_iterator iter =\n            properties.begin();\n        while (iter != properties.end()) {\n            o << \"    protected \";\n            printType(o, options, manager, iter->second.first.replace('.','\/'),\n                      false, false);\n            o << \" m_\" << iter->first << \";\\n\";\n            iter++;\n        }\n    }\n\n    \/\/ end of class definition\n    o << \"}\\n\";\n}\n\nvoid generateSkeleton(ProgramOptions const & options,\n                      TypeManager const & manager,\n                      std::vector< rtl::OString > const & types,\n                      rtl::OString const & delegate)\n{\n    std::hash_set< rtl::OString, rtl::OStringHash > interfaces;\n    std::hash_set< rtl::OString, rtl::OStringHash > services;\n    StringPairHashMap properties;\n    bool attributes = false;\n    bool serviceobject = false;\n    bool supportxcomponent = false;\n\n    std::vector< rtl::OString >::const_iterator iter = types.begin();\n    while (iter != types.end()) {\n        checkType(manager, *iter, interfaces, services, properties, attributes);\n        iter++;\n    }\n\n    \/\/ check if service object or simple UNO object\n    if (!services.empty())\n        serviceobject = true;\n\n    rtl::OString propertyhelper = checkPropertyHelper(manager, services);\n    checkDefaultInterfaces(interfaces, services, propertyhelper);\n\n    supportxcomponent = checkXComponentSupport(manager, interfaces);\n\n    rtl::OString compFileName(createFileNameFromType(\n                                  options.outputpath,\n                                  options.implname.replace('.','\/'),\n                                  \".java\"));\n\n    rtl::OString tmpDir = getTempDir(compFileName);\n    FileStream file;\n    file.createTempFile(tmpDir);\n    rtl::OString tmpFileName;\n\n    if(!file.isValid())\n    {\n        rtl::OString message(\"cannot open \");\n        message += compFileName + \" for writing\";\n        throw CannotDumpException(message);\n    } else {\n        tmpFileName = file.getName();\n    }\n    file.close();\n    std::ofstream oFile(tmpFileName.getStr(), std::ios_base::binary);\n\n    try {\n        generatePackage(oFile, options.implname);\n\n        generateImports(oFile, interfaces, propertyhelper,\n                        serviceobject, supportxcomponent);\n\n        rtl::OString classname(options.implname);\n        sal_Int32 index = 0;\n        if ((index = classname.lastIndexOf('.')) > 0)\n            classname = classname.copy(index+1);\n\n        generateClassDefinition(oFile, options, manager, classname, services,\n                                interfaces, properties, propertyhelper,\n                                supportxcomponent);\n\n        oFile.close();\n        OSL_VERIFY(makeValidTypeFile(compFileName, tmpFileName, sal_False));\n    } catch(CannotDumpException& e) {\n\n        std::cout << \"ERROR: \" << e.m_message.getStr() << \"\\n\";\n        \/\/ remove existing type file if something goes wrong to ensure consistency\n        if (fileExists(compFileName))\n            removeTypeFile(compFileName);\n\n        \/\/ remove tmp file if something goes wrong\n        removeTypeFile(tmpFileName);\n    }\n}\n\n} }\n\n\n<commit_msg>#i52208# formatting<commit_after>\/*************************************************************************\n *\n *  $RCSfile: javacompskeleton.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: jsc $ $Date: 2005-08-23 11:23: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#include \"skeletonjava.hxx\"\n\nusing namespace ::codemaker::java;\n\nnamespace skeletonmaker { namespace java {\n\nvoid generatePackage(std::ostream & o, const rtl::OString & implname)\n{\n    short count=0;\n    sal_Int32 index = implname.lastIndexOf('.');\n    if (index != -1) {\n        o << \"package \" << implname.copy(0, index) << \";\\n\\n\";\n    }\n}\n\nvoid generateImports(std::ostream & o,\n         const std::hash_set< rtl::OString, rtl::OStringHash >& interfaces,\n         const rtl::OString & propertyhelper,\n         bool serviceobject, bool supportxcomponent)\n{\n    o << \"import com.sun.star.uno.XComponentContext;\\n\";\n    if (serviceobject) {\n        o << \"import com.sun.star.lib.uno.helper.Factory;\\n\";\n        o << \"import com.sun.star.lang.XSingleComponentFactory;\\n\";\n        o << \"import com.sun.star.registry.XRegistryKey;\\n\";\n    }\n\n    if  (!propertyhelper.equals(\"_\")) {\n        if (supportxcomponent)\n            o << \"import com.sun.star.lib.uno.helper.ComponentBase;\\n\";\n        else\n            o << \"import com.sun.star.lib.uno.helper.WeakBase;\\n\";\n    }\n    if (propertyhelper.getLength() > 0) {\n        if (propertyhelper.equals(\"_\")) {\n            o << \"import com.sun.star.lib.uno.helper.PropertySet;\\n\";\n            o << \"import com.sun.star.beans.PropertyAttribute;\\n\";\n        } else {\n            o << \"import com.sun.star.uno.Type;\\n\";\n            o << \"import com.sun.star.lib.uno.helper.PropertySetMixin;\\n\";\n        }\n    }\n\n\/\/     std::hash_set< rtl::OString, rtl::OStringHash >::const_iterator iter = interfaces.begin();\n\/\/     while (iter != interfaces.end()) {\n\/\/         o << \"import \" << ((*iter).getStr()) << \";\\n\";\n\/\/         iter++;\n\/\/     }\n}\n\nvoid generateCompFunctions(std::ostream & o, const rtl::OString & classname)\n{\n    o << \"    public static XSingleComponentFactory __getComponentFactory(\"\n      << \"String sImplementationName ) {\\n\"\n      << \"        XSingleComponentFactory xFactory = null;\\n\\n\"\n      << \"        if ( sImplementationName.equals( m_implementationName ) )\\n\"\n      << \"            xFactory = Factory.createComponentFactory(\"\n      << classname << \".class, m_serviceNames);\\n\"\n      << \"        return xFactory;\\n    }\\n\\n\";\n\n    o << \"    public static boolean __writeRegistryServiceInfo(\"\n      << \"XRegistryKey xRegistryKey ) {\\n\"\n      << \"        return Factory.writeRegistryServiceInfo(m_implementationName,\\n\"\n      << \"                                                m_serviceNames,\\n\"\n      << \"                                                xRegistryKey);\\n\"\n      << \"    }\\n\\n\";\n}\n\nvoid generateXServiceInfoBodies(std::ostream& o)\n{\n    o << \"    \/* com.sun.star.lang.XServiceInfo *\/\\n\";\n    o << \"    public java.lang.String getImplementationName() {\\n\"\n      << \"         return m_implementationName;\\n    }\\n\\n\";\n\n    o << \"    public boolean supportsService( java.lang.String sService ) {\\n\"\n      << \"        int len = m_serviceNames.length;\\n\\n\"\n      << \"        for( int i=0; i < len; i++) {\\n\"\n      << \"            if (sService.equals(m_serviceNames[i]))\\n\"\n      << \"                return true;\\n\"\n      << \"        }\\n        return false;\\n    }\\n\\n\";\n\n    o << \"    public java.lang.String[] getSupportedServiceNames() {\\n\"\n      << \"        return m_serviceNames;\\n    }\\n\\n\";\n}\n\n\nbool checkAttribute(rtl::OStringBuffer& attributeValue, sal_uInt16 attribute) {\n    bool cast = false;\n    sal_uInt16 attributes[9] = {\n        \/* com::sun::star::beans::PropertyValue::MAYBEVOID *\/ 1,\n        \/* com::sun::star::beans::PropertyValue::BOUND *\/ 2,\n        \/* com::sun::star::beans::PropertyValue::CONSTRAINED *\/ 4,\n        \/* com::sun::star::beans::PropertyValue::TRANSIENT *\/ 8,\n        \/* com::sun::star::beans::PropertyValue::READONLY *\/ 16,\n        \/* com::sun::star::beans::PropertyValue::MAYBEAMBIGIOUS *\/ 32,\n        \/* com::sun::star::beans::PropertyValue::MAYBEDEFAULT *\/ 64,\n        \/* com::sun::star::beans::PropertyValue::REMOVEABLE *\/ 128,\n        \/* com::sun::star::beans::PropertyValue::OPTIONAL *\/ 256 };\n\n    for (sal_uInt16 i = 0; i < 9; i++) {\n        if (attribute & attributes[i]) {\n            if (attributeValue.getLength() > 0) {\n                cast |= true;\n                attributeValue.append(\"|\");\n            }\n            switch (attributes[i]) {\n            case 1:\n                attributeValue.append(\"PropertyAttribute.MAYBEVOID\");\n                break;\n            case 2:\n                attributeValue.append(\"PropertyAttribute.BOUND\");\n                break;\n            case 4:\n                attributeValue.append(\"PropertyAttribute.CONSTRAINED\");\n                break;\n            case 8:\n                attributeValue.append(\"PropertyAttribute.TRANSIENT\");\n                break;\n            case 16:\n                attributeValue.append(\"PropertyAttribute.READONLY\");\n                break;\n            case 32:\n                attributeValue.append(\"PropertyAttribute.MAYBEAMBIGIOUS\");\n                break;\n            case 64:\n                attributeValue.append(\"PropertyAttribute.MAYBEDEFAULT\");\n                break;\n            case 128:\n                attributeValue.append(\"PropertyAttribute.REMOVEABLE\");\n                break;\n            case 256:\n                attributeValue.append(\"PropertyAttribute.OPTIONAL\");\n                break;\n            }\n        }\n    }\n    if (cast) {\n        attributeValue.insert(0, '(');\n        attributeValue.append(')');\n    }\n\n    return cast;\n}\n\nvoid registerProperties(std::ostream& o,\n                        TypeManager const & manager,\n                        const StringPairHashMap& properties,\n                        const rtl::OString& indentation)\n{\n    if (!properties.empty()) {\n        StringPairHashMap::const_iterator iter =\n            properties.begin();\n        bool cast = false;\n        rtl::OStringBuffer attributeValue;\n        while (iter != properties.end()) {\n            if (iter->second.second > 0) {\n                cast = checkAttribute(attributeValue, iter->second.second);\n            } else {\n                cast = true;\n                attributeValue.append('0');\n            }\n\n            o << indentation << \"registerProperty(\\\"\" << iter->first\n              << \"\\\", \\\"m_\" << iter->first << \"\\\",\\n\"\n              << indentation << \"      \";\n            if (cast)\n                o << \"(short)\";\n\n            o << attributeValue.makeStringAndClear() << \");\\n\";\n            iter++;\n        }\n    }\n}\n\nvoid generateMethodBodies(std::ostream& o,\n         ProgramOptions const & options,\n         TypeManager const & manager,\n         const std::hash_set< rtl::OString, rtl::OStringHash >& interfaces,\n         const rtl::OString& indentation)\n{\n    std::hash_set< rtl::OString, rtl::OStringHash >::const_iterator iter =\n        interfaces.begin();\n    codemaker::GeneratedTypeSet generated;\n    while (iter != interfaces.end()) {\n        if ( (*iter).equals(\"com.sun.star.lang.XServiceInfo\")) {\n                generateXServiceInfoBodies(o);\n        } else {\n            typereg::Reader reader(manager.getTypeReader((*iter).replace('.','\/')));\n            printMethods(o, options, manager, reader, generated, \"_\",\n                         indentation, true);\n        }\n        iter++;\n    }\n}\n\nvoid generateClassDefinition(std::ostream& o,\n         ProgramOptions const & options,\n         TypeManager const & manager,\n         const rtl::OString & classname,\n         const std::hash_set< rtl::OString, rtl::OStringHash >& services,\n         const std::hash_set< rtl::OString, rtl::OStringHash >& interfaces,\n         const StringPairHashMap& properties,\n         const rtl::OString& propertyhelper, bool supportxcomponent)\n{\n    o << \"\\n\\npublic final class \" << classname << \" extends \";\n\n    if (!interfaces.empty()) {\n        if (propertyhelper.equals(\"_\")) {\n                o << \"PropertySet\\n\";\n        } else {\n            if (supportxcomponent)\n                o << \"ComponentBase\\n\";\n            else\n                o << \"WeakBase\\n\";\n        }\n        o << \"    implements \";\n        std::hash_set< rtl::OString, rtl::OStringHash >::const_iterator iter =\n            interfaces.begin();\n        while (iter != interfaces.end()) {\n            o << (*iter);\n            iter++;\n            if (iter != interfaces.end())\n                o << \",\\n               \";\n        }\n    }\n    o << \"\\n{\\n\";\n\n    o << \"    private final XComponentContext m_context;\\n\";\n\n    \/\/ check property helper\n    if (propertyhelper.getLength() > 1) {\n        o << \"    private final PropertySetMixin m_prophlp;\\n\";\n    }\n\n    o << \"    private static final java.lang.String m_implementationName = \"\n      << classname << \".class.getName();\\n\";\n\n    if (!services.empty()) {\n        o << \"    private static final java.lang.String[] m_serviceNames = {\\n\";\n        std::hash_set< rtl::OString, rtl::OStringHash >::const_iterator iter =\n            services.begin();\n        while (iter != services.end()) {\n            o << \"        \\\"\" << (*iter).replace('\/','.') << \"\\\"\";\n            iter++;\n            if (iter != services.end())\n                o << \",\\n\";\n            else\n                o << \" };\\n\";\n        }\n    }\n    o << \"\\n    public \" << classname << \"( XComponentContext context ) {\\n\"\n      << \"        m_context = context;\\n\";\n    if (propertyhelper.equals(\"_\")) {\n        registerProperties(o, manager, properties, \"        \");\n    } else {\n        if (propertyhelper.getLength() > 1) {\n            o << \"        m_prophlp = new PropertySetMixin(\\n\"\n              << \"            m_context, this, new Type(\" << propertyhelper\n              << \".class));\\n\";\n        }\n    }\n    o << \"    };\\n\\n\";\n\n    if (!services.empty())\n        generateCompFunctions(o, classname);\n\n    generateMethodBodies(o, options, manager, interfaces, \"    \");\n\n    if (!properties.empty()) {\n        StringPairHashMap::const_iterator iter =\n            properties.begin();\n        while (iter != properties.end()) {\n            o << \"    protected \";\n            printType(o, options, manager, iter->second.first.replace('.','\/'),\n                      false, false);\n            o << \" m_\" << iter->first << \";\\n\";\n            iter++;\n        }\n    }\n\n    \/\/ end of class definition\n    o << \"}\\n\";\n}\n\nvoid generateSkeleton(ProgramOptions const & options,\n                      TypeManager const & manager,\n                      std::vector< rtl::OString > const & types,\n                      rtl::OString const & delegate)\n{\n    std::hash_set< rtl::OString, rtl::OStringHash > interfaces;\n    std::hash_set< rtl::OString, rtl::OStringHash > services;\n    StringPairHashMap properties;\n    bool attributes = false;\n    bool serviceobject = false;\n    bool supportxcomponent = false;\n\n    std::vector< rtl::OString >::const_iterator iter = types.begin();\n    while (iter != types.end()) {\n        checkType(manager, *iter, interfaces, services, properties, attributes);\n        iter++;\n    }\n\n    \/\/ check if service object or simple UNO object\n    if (!services.empty())\n        serviceobject = true;\n\n    rtl::OString propertyhelper = checkPropertyHelper(manager, services);\n    checkDefaultInterfaces(interfaces, services, propertyhelper);\n\n    supportxcomponent = checkXComponentSupport(manager, interfaces);\n\n    rtl::OString compFileName(createFileNameFromType(\n                                  options.outputpath,\n                                  options.implname.replace('.','\/'),\n                                  \".java\"));\n\n    rtl::OString tmpDir = getTempDir(compFileName);\n    FileStream file;\n    file.createTempFile(tmpDir);\n    rtl::OString tmpFileName;\n\n    if(!file.isValid())\n    {\n        rtl::OString message(\"cannot open \");\n        message += compFileName + \" for writing\";\n        throw CannotDumpException(message);\n    } else {\n        tmpFileName = file.getName();\n    }\n    file.close();\n    std::ofstream oFile(tmpFileName.getStr(), std::ios_base::binary);\n\n    try {\n        generatePackage(oFile, options.implname);\n\n        generateImports(oFile, interfaces, propertyhelper,\n                        serviceobject, supportxcomponent);\n\n        rtl::OString classname(options.implname);\n        sal_Int32 index = 0;\n        if ((index = classname.lastIndexOf('.')) > 0)\n            classname = classname.copy(index+1);\n\n        generateClassDefinition(oFile, options, manager, classname, services,\n                                interfaces, properties, propertyhelper,\n                                supportxcomponent);\n\n        oFile.close();\n        OSL_VERIFY(makeValidTypeFile(compFileName, tmpFileName, sal_False));\n    } catch(CannotDumpException& e) {\n\n        std::cout << \"ERROR: \" << e.m_message.getStr() << \"\\n\";\n        \/\/ remove existing type file if something goes wrong to ensure consistency\n        if (fileExists(compFileName))\n            removeTypeFile(compFileName);\n\n        \/\/ remove tmp file if something goes wrong\n        removeTypeFile(tmpFileName);\n    }\n}\n\n} }\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2015, 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 \"ProxyRequestContext.h\"\n\n#include <folly\/Memory.h>\n\n#include \"mcrouter\/config.h\"\n#include \"mcrouter\/McrouterClient.h\"\n#include \"mcrouter\/proxy.h\"\n\nnamespace facebook { namespace memcache { namespace mcrouter {\n\nProxyRequestContext::ProxyRequestContext(\n  proxy_t& pr,\n  McMsgRef req,\n  void (*enqReply)(ProxyRequestContext& preq),\n  void* context,\n  void (*reqComplete)(ProxyRequestContext& preq))\n    : proxy_(pr),\n      context_(context),\n      enqueueReply_(enqReply),\n      reqComplete_(reqComplete),\n      logger_(&pr),\n      additionalLogger_(&pr) {\n\n  static const char* const kInternalGetPrefix = \"__mcrouter__.\";\n\n  if (req->op == mc_op_get && !strncmp(req->key.str, kInternalGetPrefix,\n                                       strlen(kInternalGetPrefix))) {\n    \/* HACK: for backwards compatibility, convert (get, \"__mcrouter__.key\")\n       into (get-service-info, \"key\") *\/\n    auto copy = MutableMcMsgRef(mc_msg_dup(req.get()));\n    copy->op = mc_op_get_service_info;\n    copy->key.str += strlen(kInternalGetPrefix);\n    copy->key.len -= strlen(kInternalGetPrefix);\n    origReq_ = std::move(copy);\n  } else {\n    origReq_ = std::move(req);\n  }\n\n  stat_incr_safe(proxy_.stats, proxy_request_num_outstanding_stat);\n}\n\nProxyRequestContext::~ProxyRequestContext() {\n  assert(replied_);\n  if (reqComplete_) {\n    reqComplete_(*this);\n  }\n\n  if (processing_) {\n    --proxy_.numRequestsProcessing_;\n    stat_decr(proxy_.stats, proxy_reqs_processing_stat, 1);\n    proxy_.pump();\n  }\n\n  if (requester_) {\n    requester_->decref();\n  }\n\n  stat_decr_safe(proxy_.stats, proxy_request_num_outstanding_stat);\n}\n\nuint64_t ProxyRequestContext::senderId() const {\n  uint64_t id = 0;\n  if (requester_) {\n    id = requester_->clientId();\n  }\n\n  return id;\n}\n\nvoid ProxyRequestContext::sendReply(McReply newReply) {\n  if (replied_) {\n    return;\n  }\n  reply_ = std::move(newReply);\n  replied_ = true;\n\n  enqueueReply_(*this);\n\n  stat_incr(proxy_.stats, request_replied_stat, 1);\n  stat_incr(proxy_.stats, request_replied_count_stat, 1);\n  if (mc_res_is_err(reply_->result())) {\n    stat_incr(proxy_.stats, request_error_stat, 1);\n    stat_incr(proxy_.stats, request_error_count_stat, 1);\n  } else {\n    stat_incr(proxy_.stats, request_success_stat, 1);\n    stat_incr(proxy_.stats, request_success_count_stat, 1);\n  }\n}\n\n}}}\n<commit_msg>Fix embedded mcrouter mode<commit_after>\/*\n *  Copyright (c) 2015, 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 \"ProxyRequestContext.h\"\n\n#include <folly\/Memory.h>\n\n#include \"mcrouter\/config.h\"\n#include \"mcrouter\/McrouterClient.h\"\n#include \"mcrouter\/proxy.h\"\n\nnamespace facebook { namespace memcache { namespace mcrouter {\n\nProxyRequestContext::ProxyRequestContext(\n  proxy_t& pr,\n  McMsgRef req,\n  void (*enqReply)(ProxyRequestContext& preq),\n  void* context,\n  void (*reqComplete)(ProxyRequestContext& preq))\n    : proxy_(pr),\n      context_(context),\n      enqueueReply_(enqReply),\n      reqComplete_(reqComplete),\n      logger_(&pr),\n      additionalLogger_(&pr) {\n\n  static const char* const kInternalGetPrefix = \"__mcrouter__.\";\n\n  if (req->op == mc_op_get && !strncmp(req->key.str, kInternalGetPrefix,\n                                       strlen(kInternalGetPrefix))) {\n    \/* HACK: for backwards compatibility, convert (get, \"__mcrouter__.key\")\n       into (get-service-info, \"key\") *\/\n    auto copy = MutableMcMsgRef(mc_msg_dup(req.get()));\n    copy->op = mc_op_get_service_info;\n    copy->key.str += strlen(kInternalGetPrefix);\n    copy->key.len -= strlen(kInternalGetPrefix);\n    origReq_ = std::move(copy);\n  } else {\n    origReq_ = std::move(req);\n  }\n\n  stat_incr_safe(proxy_.stats, proxy_request_num_outstanding_stat);\n}\n\nProxyRequestContext::~ProxyRequestContext() {\n  assert(replied_);\n  if (reqComplete_) {\n    reqComplete_(*this);\n  }\n\n  if (processing_) {\n    --proxy_.numRequestsProcessing_;\n    stat_decr(proxy_.stats, proxy_reqs_processing_stat, 1);\n    proxy_.pump();\n  }\n\n  if (requester_) {\n    requester_->decref();\n  }\n\n  stat_decr_safe(proxy_.stats, proxy_request_num_outstanding_stat);\n}\n\nuint64_t ProxyRequestContext::senderId() const {\n  uint64_t id = 0;\n  if (requester_) {\n    id = requester_->clientId();\n  }\n\n  return id;\n}\n\nvoid ProxyRequestContext::sendReply(McReply newReply) {\n  if (replied_) {\n    return;\n  }\n  reply_ = std::move(newReply);\n  replied_ = true;\n\n  if (LIKELY(enqueueReply_ != nullptr)) {\n    enqueueReply_(*this);\n  }\n\n  stat_incr(proxy_.stats, request_replied_stat, 1);\n  stat_incr(proxy_.stats, request_replied_count_stat, 1);\n  if (mc_res_is_err(reply_->result())) {\n    stat_incr(proxy_.stats, request_error_stat, 1);\n    stat_incr(proxy_.stats, request_error_count_stat, 1);\n  } else {\n    stat_incr(proxy_.stats, request_success_stat, 1);\n    stat_incr(proxy_.stats, request_success_count_stat, 1);\n  }\n}\n\n}}}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <sstream>\n\n#include <vector>\n#include <list>\n#include <map>\n\n#include <algorithm>\n\n#include <iomanip>      \/\/ setw, set::precision, ...\n\n\nusing namespace std;\n\n#define EXP\n\n\/\/______________________________________________________________________________\nclass EXP msrOptionsElement\n{\n  public:\n\n    \/\/ creation from MusicXML\n    \/\/ ------------------------------------------------------\n\n  protected:\n\n    msrOptionsElement (\n      string optionsElementShortName,\n      string optionsElementLongName,\n      string optionsElementDescription);\n\n    virtual ~msrOptionsElement();\n\n  public:\n\n    \/\/ set and get\n    \/\/ ------------------------------------------------------\n\n    string                getOptionsElementShortName () const\n                              { return fOptionsElementShortName; }\n\n    string                getOptionsElementLongName () const\n                              { return fOptionsElementLongName; }\n\n    string                getOptionsElementDescription () const\n                              { return fOptionsElementDescription; }\n\n    \/\/ services\n    \/\/ ------------------------------------------------------\n\n    string                operator() () const\n                              { return fOptionsElementDescription; }\n  \n    \/\/ print\n    \/\/ ------------------------------------------------------\n\n    virtual void          print (ostream& os) const;\n    \n  protected:\n     \n    string                fOptionsElementShortName;\n    string                fOptionsElementLongName;\n    string                fOptionsElementDescription;\n};\n\/\/typedef SMARTP<msrOptionsElement> S_msrOptionsElement;\ntypedef msrOptionsElement* S_msrOptionsElement;\nEXP ostream& operator<< (ostream& os, const S_msrOptionsElement& elt);\n\n\nmsrOptionsElement::msrOptionsElement (\n  string optionsElementShortName,\n  string optionsElementLongName,\n  string optionsElementDescription)\n{\n  fOptionsElementShortName   = optionsElementShortName;  \n  fOptionsElementLongName    = optionsElementLongName;  \n  fOptionsElementDescription = optionsElementDescription;  \n}\n\nmsrOptionsElement::~msrOptionsElement()\n{}\n\nostream& operator<< (ostream& os, const S_msrOptionsElement& elt)\n{\n  elt->print (os);\n  return os;\n}\n\nvoid msrOptionsElement::print (ostream& os) const\n{\n  os << \"??? msrOptionsElement ???\" << endl;\n}\n\n\/\/______________________________________________________________________________\nclass EXP msrOptionsItem : public msrOptionsElement\n{\n  public:\n  \n    msrOptionsItem (\n      string optionsItemShortName,\n      string optionsItemLongName,\n      string optionsItemDescription)\n      : msrOptionsElement (\n          optionsItemShortName,\n          optionsItemLongName,\n          optionsItemDescription)\n      {\n        fOptionsItemHasBeenSelected = false;\n      }\n    \n    void                  setOptionsItemHasBeenSelected ()\n                              { fOptionsItemHasBeenSelected = true; }\n  \n    bool                  getOptionsItemHasBeenSelected () const\n                              { return fOptionsItemHasBeenSelected; }\n  \n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsItemHasBeenSelected\" << \" : \" << fOptionsItemHasBeenSelected <<\n          endl;\n      }\n\n  protected:\n      \n    bool                  fOptionsItemHasBeenSelected;\n};\ntypedef msrOptionsItem* S_msrOptionsItem;\n\nostream& operator<< (ostream& os, const msrOptionsItem& elt)\n{\n  elt.print (os);\n  return os;\n}\n\n\/\/______________________________________________________________________________\nclass EXP msrOptionsIntItem : public msrOptionsItem\n{\n  public:\n  \n    msrOptionsIntItem (\n      string optionsItemShortName,\n      string optionsItemLongName,\n      string optionsItemDescription,\n      int&   optionsIntItemVariable)\n      : msrOptionsItem (\n          optionsItemShortName,\n          optionsItemLongName,\n          optionsItemDescription),\n        fOptionsIntItemVariable (optionsIntItemVariable)\n      {}\n      \n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsItemHasBeenSelected\" << \" : \" << fOptionsItemHasBeenSelected <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsIntItemVariable\" << \" : \" << fOptionsIntItemVariable <<\n          endl;\n      }\n\n  private:\n  \n    int&                  fOptionsIntItemVariable;\n};\ntypedef msrOptionsIntItem* S_msrOptionsIntItem;\n\nostream& operator<< (ostream& os, const msrOptionsIntItem& elt)\n{\n  elt.print (os);\n  return os;\n}\n\n\/\/______________________________________________________________________________\nclass EXP msrOptionsStringItem : public msrOptionsItem\n{\n  public:\n  \n    msrOptionsStringItem (\n      string  optionsItemShortName,\n      string  optionsItemLongName,\n      string  optionsItemDescription,\n      string& optionsStringItemVariable)\n      : msrOptionsItem (\n          optionsItemShortName,\n          optionsItemLongName,\n          optionsItemDescription),\n        fOptionsStringItemVariable (optionsStringItemVariable)\n      {}\n      \n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsItemHasBeenSelected\" << \" : \" << fOptionsItemHasBeenSelected <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsStringItemVariable\" << \" : \" << fOptionsStringItemVariable <<\n          endl;\n      }\n\n  private:\n  \n    string&                  fOptionsStringItemVariable;\n};\ntypedef msrOptionsStringItem* S_msrOptionsStringItem;\n\nostream& operator<< (ostream& os, const msrOptionsStringItem& elt)\n{\n  elt.print (os);\n  return os;\n}\n\n\/\/_______________________________________________________________________________\nclass EXP msrOptionsSubGroup : public msrOptionsElement\n{\n  public:\n  \n    msrOptionsSubGroup (\n      string optionsSubGroupShortName,\n      string optionsSubGroupLongName,\n      string optionsSubGroupDescription)\n      : msrOptionsElement (\n          optionsSubGroupShortName,\n          optionsSubGroupLongName,\n          optionsSubGroupDescription)\n      {}\n    \n    void                  appendOptionsItem (\n                            S_msrOptionsItem optionsItem)\n      {\n        fOptionsSubGroupItemsList.push_back (\n          optionsItem);\n      }\n\n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl;\n  \n        for (\n          list<S_msrOptionsItem>::const_iterator\n            i = fOptionsSubGroupItemsList.begin();\n          i != fOptionsSubGroupItemsList.end();\n          i++) {\n          \/\/ print the element\n          os << (*i);\n        } \/\/ for\n      }\n\n  private:\n  \n    list<S_msrOptionsItem>\n                          fOptionsSubGroupItemsList;\n};\ntypedef msrOptionsSubGroup* S_msrOptionsSubGroup;\n\nostream& operator<< (ostream& os, const msrOptionsSubGroup& elt)\n{\n  elt.print (os);\n  return os;\n}\n\n\/\/_______________________________________________________________________________\nclass EXP msrOptionsGroup : public msrOptionsElement\n{\n  public:\n  \n    msrOptionsGroup (\n      string optionGroupShortName,\n      string optionGroupLongName,\n      string optionGroupDescription)\n      : msrOptionsElement (\n          optionGroupShortName,\n          optionGroupLongName,\n          optionGroupDescription)\n      {}\n      \n    void                  appendOptionsSubGroup (\n                            S_msrOptionsSubGroup optionsSubGroup)\n      {\n        fOptionsGroupSubGroupsList.push_back (\n          optionsSubGroup);\n      }\n        \n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl;\n  \n        for (\n          list<S_msrOptionsSubGroup>::const_iterator\n            i = fOptionsGroupSubGroupsList.begin();\n          i != fOptionsGroupSubGroupsList.end();\n          i++) {\n          \/\/ print the element\n          os << (*i);\n        } \/\/ for\n      }\n\n  private:\n\n    list<S_msrOptionsSubGroup>\n                          fOptionsGroupSubGroupsList;\n};\ntypedef msrOptionsGroup* S_msrOptionsGroup;\n\nostream& operator<< (ostream& os, const msrOptionsGroup& elt)\n{\n  elt.print (os);\n  return os;\n}\n\n\/\/______________________________________________________________________________\nvoid optionError (string errorMessage)\n{\n  cerr <<\n    endl <<\n    endl <<\n    \"### ERROR in the options:\" <<\n    endl <<\n    errorMessage <<\n    endl <<\n    endl;\n    \n  exit(99);\n}\n\n\/\/_______________________________________________________________________________\n\/\/ a private variable\nmap<string, string> pOptionShortNames;\n\nvoid checkOptionUniqueness (\n  string optionLongName, string optionShortName)\n{\n  if (optionShortName == optionLongName) {\n    stringstream s;\n\n    s <<\n      \"option long name '\" << optionLongName << \"'\" <<\n      \" is also used as short name\";\n      \n    optionError (s.str());\n  }\n  \n  for (\n    map<string, string>::iterator i = pOptionShortNames.begin();\n    i != pOptionShortNames.end();\n    i++) {\n      \n    \/\/ is optionLongName in the options names map?\n    if ((*i).first == optionLongName) {\n      stringstream s;\n  \n      s <<\n        \"option long name '\" << optionLongName << \"'\" <<\n        \" is specified more that once\";\n        \n      optionError (s.str());\n    }\n\n    \/\/ is optionShortName in the options names map?\n    if ((*i).second == optionShortName) {\n      if (optionShortName.size ()) {\n        stringstream s;\n    \n        s <<\n          \"option short name '\" << optionShortName << \"'\" <<\n          \" for option long name '\" << optionLongName << \"'\" <<\n          \" is specified more that once\";\n          \n        optionError (s.str());\n      }\n    }\n  } \/\/ for\n\n  \/\/ everything OK, register the option names\n  pOptionShortNames [optionLongName] = optionShortName;\n}\n\n\/\/_______________________________________________________________________________\nvoid analyzeOptions (\n  int            argc,\n  char*          argv[])\n{\n  int   n = 0;\n\n  S_msrOptionsGroup optionsGroup =\n    new msrOptionsGroup (\n    \"hog\", \"helpOptionsGroup\", \" help for OptionsGroup\");\n\n  S_msrOptionsSubGroup optionsSubGroup =\n    new msrOptionsSubGroup (\n    \"hosg\", \"helpOptionsSubGroup\", \" help for OptionsSubGroup\");\n\n  optionsGroup->\n    appendOptionsSubGroup (optionsSubGroup);\n\n  int intVariable;\n  S_msrOptionsIntItem optionsItem1 =\n    new msrOptionsIntItem (\n      \"is\", \"il\", \"intVariable\", intVariable);\n  optionsSubGroup->\n    appendOptionsItem (optionsItem1);\n      \n  string stringVariable;\n  S_msrOptionsStringItem optionsItem2 =\n    new msrOptionsStringItem (\n      \"ss\", \"sl\", \"stringVariable\", stringVariable);\n  optionsSubGroup->\n    appendOptionsItem (optionsItem2);\n\n  cerr <<\n    \"optionsGroup:\" << endl <<\n    optionsGroup <<\n    endl;\n    \n  while (true) { \n    if (argv [n] == 0)\n      break;\n\n    string currentElement = string (argv [n]);\n    \n    \/\/ print current element\n    cout <<\n      n << \":\" << currentElement <<\n      endl;\n\n    \/\/ handle current element\n    if (currentElement [0] == '-') {\n      \/\/ this is an option\n      string elementTrailer =\n        currentElement.substr (1, string::npos);\n\n      \/* JMI\n      cout <<\n        \"elementTrailer '\" << elementTrailer << \"' is preceded by a dash\" <<\n        endl;\n      *\/\n\n      if (elementTrailer.size ()) {\n        if (elementTrailer [0] == '-') {\n          \/\/ it is a double-dashed option\n          string currentDoubleDashedOption =\n            elementTrailer.substr (1, string::npos);\n          \n          cout <<\n            \"'\" << currentDoubleDashedOption << \"' is a double-dashed option\" <<\n            endl;\n        }\n        else {\n          \/\/ it is a single-dashed option\n          string currentSingleDashedOption =\n            elementTrailer; \/\/.substr (1, string::npos);\n          \n          cout <<\n            \"'\" << currentSingleDashedOption << \"' is a single-dashed option\" <<\n            endl;\n        }\n      }\n      \n      else {\n        cout <<\n          \"'-' is the minimal single-dashed option\" <<\n          endl;\n      }\n    }\n\n    \/\/ next please\n    n++;\n  } \/\/ while\n}\n\nint main (int argc, char *argv[])\n{\n\/*\n  vector<msrOptionsItem> vec {\n    msrOptionItem (\"1short\", \"1long\", \"descr1\"),\n    msrOptionItem (\"2short\", \"1long\", \"descr2\")\n  };\n\n  int counter = 0;\n  cout <<\n    \"The contents of 'vec' is:\" <<\n    endl << endl;\n  for (msrOptionItem i : vec)\n  {\n    cout <<\n      \"Element \" << counter << \":\" <<\n      endl <<\n      i <<\n      endl;\n    counter++;\n  }\n\nstruct option\n{\n  const char *name;\n  \/\/ has_arg can't be an enum because some compilers complain about\n  \/\/ type mismatches in all the code that assumes it is an int.\n  int has_arg;\n  int *flag;\n  int val;\n};\n*\/\n\n\/*\n  vector<struct option> myLongOptions {\n    option (\"1short\", no_argument, &vec [0].fOptionSelected, 1),\n    option (\"1long\", no_argument, &vec [0].fOptionSelected, 1),\n    \n    option (\"2short\", required_argument, &vec [1].fOptionSelected, 1),\n    option (\"2long\", required_argument, &vec [1].fOptionSelected, 1),\n    \n    option (0, 0, 0, 0) \/\/ option trailer\n  };\n*\/\n\n\n\/*\n  cout << \"Which element should be printed? \";\n  \n  int n;\n  cin >> n;\n\n  cout << endl;\n  \n  if (n < vec.size ())\n    cout <<\n      \"Element \" << n << \" constains:\" <<\n      endl <<\n      endl <<\n      vec [n] <<\n      endl;\n  else\n    cout <<\n      \"Sorry, only elements from 0 to \" << vec.size () - 1 << \" exist\" <<\n      endl;\n*\/\n\n  analyzeOptions (\n    argc, argv);\n\n}\n<commit_msg>OptionsTest 4<commit_after>#include <iostream>\n#include <sstream>\n\n#include <vector>\n#include <list>\n#include <map>\n\n#include <algorithm>\n\n#include <iomanip>      \/\/ setw, set::precision, ...\n\n\nusing namespace std;\n\n#define EXP\n\n\/\/______________________________________________________________________________\nclass EXP msrOptionsElement\n{\n  public:\n\n    \/\/ creation from MusicXML\n    \/\/ ------------------------------------------------------\n\n  protected:\n\n    msrOptionsElement (\n      string optionsElementShortName,\n      string optionsElementLongName,\n      string optionsElementDescription);\n\n    virtual ~msrOptionsElement();\n\n  public:\n\n    \/\/ set and get\n    \/\/ ------------------------------------------------------\n\n    string                getOptionsElementShortName () const\n                              { return fOptionsElementShortName; }\n\n    string                getOptionsElementLongName () const\n                              { return fOptionsElementLongName; }\n\n    string                getOptionsElementDescription () const\n                              { return fOptionsElementDescription; }\n\n    \/\/ services\n    \/\/ ------------------------------------------------------\n\n    string                operator() () const\n                              { return fOptionsElementDescription; }\n  \n    \/\/ print\n    \/\/ ------------------------------------------------------\n\n    virtual void          print (ostream& os) const;\n    \n  protected:\n     \n    string                fOptionsElementShortName;\n    string                fOptionsElementLongName;\n    string                fOptionsElementDescription;\n};\n\/\/typedef SMARTP<msrOptionsElement> S_msrOptionsElement;\ntypedef msrOptionsElement* S_msrOptionsElement;\nEXP ostream& operator<< (ostream& os, const S_msrOptionsElement& elt);\n\n\nmsrOptionsElement::msrOptionsElement (\n  string optionsElementShortName,\n  string optionsElementLongName,\n  string optionsElementDescription)\n{\n  fOptionsElementShortName   = optionsElementShortName;  \n  fOptionsElementLongName    = optionsElementLongName;  \n  fOptionsElementDescription = optionsElementDescription;  \n}\n\nmsrOptionsElement::~msrOptionsElement()\n{}\n\nostream& operator<< (ostream& os, const S_msrOptionsElement& elt)\n{\n  elt->print (os);\n  return os;\n}\n\nvoid msrOptionsElement::print (ostream& os) const\n{\n  os << \"??? msrOptionsElement ???\" << endl;\n}\n\n\/\/______________________________________________________________________________\nclass EXP msrOptionsItem : public msrOptionsElement\n{\n  public:\n  \n    msrOptionsItem (\n      string optionsItemShortName,\n      string optionsItemLongName,\n      string optionsItemDescription)\n      : msrOptionsElement (\n          optionsItemShortName,\n          optionsItemLongName,\n          optionsItemDescription)\n      {\n        fOptionsItemHasBeenSelected = false;\n      }\n    \n    void                  setOptionsItemHasBeenSelected ()\n                              { fOptionsItemHasBeenSelected = true; }\n  \n    bool                  getOptionsItemHasBeenSelected () const\n                              { return fOptionsItemHasBeenSelected; }\n  \n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          \"OptionsItem ???:\" <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsItemHasBeenSelected\" << \" : \" << fOptionsItemHasBeenSelected <<\n          endl;\n      }\n\n  protected:\n      \n    bool                  fOptionsItemHasBeenSelected;\n};\ntypedef msrOptionsItem* S_msrOptionsItem;\n\nostream& operator<< (ostream& os, const msrOptionsItem& elt)\n{\n  os <<\n    \"OptionsItem ???:\" <<\n    endl;\n  elt.print (os);\n  return os;\n}\n\n\/\/______________________________________________________________________________\nclass EXP msrOptionsIntItem : public msrOptionsItem\n{\n  public:\n  \n    msrOptionsIntItem (\n      string optionsItemShortName,\n      string optionsItemLongName,\n      string optionsItemDescription,\n      int&   optionsIntItemVariable)\n      : msrOptionsItem (\n          optionsItemShortName,\n          optionsItemLongName,\n          optionsItemDescription),\n        fOptionsIntItemVariable (optionsIntItemVariable)\n      {}\n      \n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          \"OptionsIntItem:\" <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsItemHasBeenSelected\" << \" : \" << fOptionsItemHasBeenSelected <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsIntItemVariable\" << \" : \" << fOptionsIntItemVariable <<\n          endl;\n      }\n\n  private:\n  \n    int&                  fOptionsIntItemVariable;\n};\ntypedef msrOptionsIntItem* S_msrOptionsIntItem;\n\nostream& operator<< (ostream& os, const msrOptionsIntItem& elt)\n{\n  os <<\n    \"OptionsIntItem:\" <<\n    endl;\n  elt.print (os);\n  return os;\n}\n\n\/\/______________________________________________________________________________\nclass EXP msrOptionsStringItem : public msrOptionsItem\n{\n  public:\n  \n    msrOptionsStringItem (\n      string  optionsItemShortName,\n      string  optionsItemLongName,\n      string  optionsItemDescription,\n      string& optionsStringItemVariable)\n      : msrOptionsItem (\n          optionsItemShortName,\n          optionsItemLongName,\n          optionsItemDescription),\n        fOptionsStringItemVariable (optionsStringItemVariable)\n      {}\n      \n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          \"OptionsStringItem:\" <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsItemHasBeenSelected\" << \" : \" << fOptionsItemHasBeenSelected <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsStringItemVariable\" << \" : \" << fOptionsStringItemVariable <<\n          endl;\n      }\n\n  private:\n  \n    string&                  fOptionsStringItemVariable;\n};\ntypedef msrOptionsStringItem* S_msrOptionsStringItem;\n\nostream& operator<< (ostream& os, const msrOptionsStringItem& elt)\n{\n  os <<\n    \"OptionsStringItem:\" <<\n    endl;\n  elt.print (os);\n  return os;\n}\n\n\/\/_______________________________________________________________________________\nclass EXP msrOptionsSubGroup : public msrOptionsElement\n{\n  public:\n  \n    msrOptionsSubGroup (\n      string optionsSubGroupShortName,\n      string optionsSubGroupLongName,\n      string optionsSubGroupDescription)\n      : msrOptionsElement (\n          optionsSubGroupShortName,\n          optionsSubGroupLongName,\n          optionsSubGroupDescription)\n      {}\n    \n    void                  appendOptionsItem (\n                            S_msrOptionsItem optionsItem)\n      {\n        fOptionsSubGroupItemsList.push_back (\n          optionsItem);\n      }\n\n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          \"OptionsSubGroup:\" <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl;\n  \n        for (\n          list<S_msrOptionsItem>::const_iterator\n            i = fOptionsSubGroupItemsList.begin();\n          i != fOptionsSubGroupItemsList.end();\n          i++) {\n          \/\/ print the element\n          os << (*i);\n        } \/\/ for\n      }\n\n  private:\n  \n    list<S_msrOptionsItem>\n                          fOptionsSubGroupItemsList;\n};\ntypedef msrOptionsSubGroup* S_msrOptionsSubGroup;\n\nostream& operator<< (ostream& os, const msrOptionsSubGroup& elt)\n{\n  os <<\n    \"OptionsSubGroup:\" <<\n    endl;\n  elt.print (os);\n  return os;\n}\n\n\/\/_______________________________________________________________________________\nclass EXP msrOptionsGroup : public msrOptionsElement\n{\n  public:\n  \n    msrOptionsGroup (\n      string optionGroupShortName,\n      string optionGroupLongName,\n      string optionGroupDescription)\n      : msrOptionsElement (\n          optionGroupShortName,\n          optionGroupLongName,\n          optionGroupDescription)\n      {}\n      \n    void                  appendOptionsSubGroup (\n                            S_msrOptionsSubGroup optionsSubGroup)\n      {\n        fOptionsGroupSubGroupsList.push_back (\n          optionsSubGroup);\n      }\n        \n    void                  print (ostream& os) const\n      {\n        const int fieldWidth = 19;\n        \n        os <<\n          \"OptionsGroup:\" <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementShortName\" << \" : \" << fOptionsElementShortName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementLongName\" << \" : \" << fOptionsElementLongName <<\n          endl <<\n          setw(fieldWidth) <<\n          \"fOptionsElementDescription\" << \" : \" << fOptionsElementDescription <<\n          endl;\n  \n        for (\n          list<S_msrOptionsSubGroup>::const_iterator\n            i = fOptionsGroupSubGroupsList.begin();\n          i != fOptionsGroupSubGroupsList.end();\n          i++) {\n          \/\/ print the element\n          os << (*i);\n        } \/\/ for\n      }\n\n  private:\n\n    list<S_msrOptionsSubGroup>\n                          fOptionsGroupSubGroupsList;\n};\ntypedef msrOptionsGroup* S_msrOptionsGroup;\n\nostream& operator<< (ostream& os, const msrOptionsGroup& elt)\n{\n  os <<\n    \"OptionsGroup:\" <<\n    endl;\n  elt.print (os);\n  return os;\n}\n\n\/\/______________________________________________________________________________\nvoid optionError (string errorMessage)\n{\n  cerr <<\n    endl <<\n    endl <<\n    \"### ERROR in the options:\" <<\n    endl <<\n    errorMessage <<\n    endl <<\n    endl;\n    \n  exit(99);\n}\n\n\/\/_______________________________________________________________________________\n\/\/ a private variable\nmap<string, string> pOptionShortNames;\n\nvoid checkOptionUniqueness (\n  string optionLongName, string optionShortName)\n{\n  if (optionShortName == optionLongName) {\n    stringstream s;\n\n    s <<\n      \"option long name '\" << optionLongName << \"'\" <<\n      \" is also used as short name\";\n      \n    optionError (s.str());\n  }\n  \n  for (\n    map<string, string>::iterator i = pOptionShortNames.begin();\n    i != pOptionShortNames.end();\n    i++) {\n      \n    \/\/ is optionLongName in the options names map?\n    if ((*i).first == optionLongName) {\n      stringstream s;\n  \n      s <<\n        \"option long name '\" << optionLongName << \"'\" <<\n        \" is specified more that once\";\n        \n      optionError (s.str());\n    }\n\n    \/\/ is optionShortName in the options names map?\n    if ((*i).second == optionShortName) {\n      if (optionShortName.size ()) {\n        stringstream s;\n    \n        s <<\n          \"option short name '\" << optionShortName << \"'\" <<\n          \" for option long name '\" << optionLongName << \"'\" <<\n          \" is specified more that once\";\n          \n        optionError (s.str());\n      }\n    }\n  } \/\/ for\n\n  \/\/ everything OK, register the option names\n  pOptionShortNames [optionLongName] = optionShortName;\n}\n\n\/\/_______________________________________________________________________________\nvoid analyzeOptions (\n  int            argc,\n  char*          argv[])\n{\n  int   n = 0;\n\n  S_msrOptionsGroup optionsGroup =\n    new msrOptionsGroup (\n    \"hog\", \"helpOptionsGroup\", \" help for OptionsGroup\");\n\n  S_msrOptionsSubGroup optionsSubGroup =\n    new msrOptionsSubGroup (\n    \"hosg\", \"helpOptionsSubGroup\", \" help for OptionsSubGroup\");\n\n  optionsGroup->\n    appendOptionsSubGroup (optionsSubGroup);\n\n  int intVariable = -3;\n  S_msrOptionsIntItem optionsItem1 =\n    new msrOptionsIntItem (\n      \"is\", \"il\", \"intVariable\", intVariable);\n  optionsSubGroup->\n    appendOptionsItem (optionsItem1);\n      \n  string stringVariable = \"a string\";\n  S_msrOptionsStringItem optionsItem2 =\n    new msrOptionsStringItem (\n      \"ss\", \"sl\", \"stringVariable\", stringVariable);\n  optionsSubGroup->\n    appendOptionsItem (optionsItem2);\n\n  cerr <<\n    \"optionsItem1:\" << endl <<\n    optionsItem1 <<\n    endl;\n    \n  cerr <<\n    \"optionsGroup:\" << endl <<\n    optionsGroup <<\n    endl;\n    \n  while (true) { \n    if (argv [n] == 0)\n      break;\n\n    string currentElement = string (argv [n]);\n    \n    \/\/ print current element\n    cout <<\n      n << \":\" << currentElement <<\n      endl;\n\n    \/\/ handle current element\n    if (currentElement [0] == '-') {\n      \/\/ this is an option\n      string elementTrailer =\n        currentElement.substr (1, string::npos);\n\n      \/* JMI\n      cout <<\n        \"elementTrailer '\" << elementTrailer << \"' is preceded by a dash\" <<\n        endl;\n      *\/\n\n      if (elementTrailer.size ()) {\n        if (elementTrailer [0] == '-') {\n          \/\/ it is a double-dashed option\n          string currentDoubleDashedOption =\n            elementTrailer.substr (1, string::npos);\n          \n          cout <<\n            \"'\" << currentDoubleDashedOption << \"' is a double-dashed option\" <<\n            endl;\n        }\n        else {\n          \/\/ it is a single-dashed option\n          string currentSingleDashedOption =\n            elementTrailer; \/\/.substr (1, string::npos);\n          \n          cout <<\n            \"'\" << currentSingleDashedOption << \"' is a single-dashed option\" <<\n            endl;\n        }\n      }\n      \n      else {\n        cout <<\n          \"'-' is the minimal single-dashed option\" <<\n          endl;\n      }\n    }\n\n    \/\/ next please\n    n++;\n  } \/\/ while\n}\n\nint main (int argc, char *argv[])\n{\n\/*\n  vector<msrOptionsItem> vec {\n    msrOptionItem (\"1short\", \"1long\", \"descr1\"),\n    msrOptionItem (\"2short\", \"1long\", \"descr2\")\n  };\n\n  int counter = 0;\n  cout <<\n    \"The contents of 'vec' is:\" <<\n    endl << endl;\n  for (msrOptionItem i : vec)\n  {\n    cout <<\n      \"Element \" << counter << \":\" <<\n      endl <<\n      i <<\n      endl;\n    counter++;\n  }\n\nstruct option\n{\n  const char *name;\n  \/\/ has_arg can't be an enum because some compilers complain about\n  \/\/ type mismatches in all the code that assumes it is an int.\n  int has_arg;\n  int *flag;\n  int val;\n};\n*\/\n\n\/*\n  vector<struct option> myLongOptions {\n    option (\"1short\", no_argument, &vec [0].fOptionSelected, 1),\n    option (\"1long\", no_argument, &vec [0].fOptionSelected, 1),\n    \n    option (\"2short\", required_argument, &vec [1].fOptionSelected, 1),\n    option (\"2long\", required_argument, &vec [1].fOptionSelected, 1),\n    \n    option (0, 0, 0, 0) \/\/ option trailer\n  };\n*\/\n\n\n\/*\n  cout << \"Which element should be printed? \";\n  \n  int n;\n  cin >> n;\n\n  cout << endl;\n  \n  if (n < vec.size ())\n    cout <<\n      \"Element \" << n << \" constains:\" <<\n      endl <<\n      endl <<\n      vec [n] <<\n      endl;\n  else\n    cout <<\n      \"Sorry, only elements from 0 to \" << vec.size () - 1 << \" exist\" <<\n      endl;\n*\/\n\n  analyzeOptions (\n    argc, argv);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (C) 2018 Jakob Sinclair\n\nThis program 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 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 Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"game.hpp\"\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include \"entity.hpp\"\n#include \"shader.hpp\"\n#include \"input.hpp\"\n#include \"graphics.hpp\"\n#include \"rect2d.hpp\"\n#include \"camera.hpp\"\n#include \"sprite.hpp\"\n#include \"cache.hpp\"\n#include \"luascript.hpp\"\n#include \"iomanager.hpp\"\n\nGame::Game()\n{\n\t;\n}\n\nGame::~Game()\n{\n\t;\n}\n\nbool Game::Init()\n{\n\t\/\/if (Res.CreateModel(\"nanosuit\", \"Model\/nanosuit.obj\") != nullptr)\n\t\/\/\tm_Model = static_cast<Model*>(Res.GetResource(\"nanosuit\")->Data());\n\n\n\tm_EM.AddEntity<Entity>(std::make_unique<Entity>(\"Camera\"));\n\tm_EM.GetEntity(\"Camera\").AddComponent<Camera>(std::make_unique<Camera>(1280, 720));\t\n\n\tRes.LoadSample(\"sound.ogg\")->Play();\n\tm_EM.GetSystem<Graphics>().RegisterComponent(std::type_index(typeid(Sprite)));\n\n\tm_EM.AddEntity<Entity>(std::make_unique<Entity>(\"Player\"));\n\tauto &sprite = m_EM.GetEntity(\"Player\").AddComponent<Sprite>(std::make_unique<Sprite>(Res.LoadTex(\"sprite.png\"),\n\t                                        110, 200,\n\t                                        std::vector<uint32_t>({25, 29, 135, 229, 150, 29, 260, 229, 287, 29, 397, 229, 438, 29, 548, 229})));\t\n\n\tLuaScript script(\"player.lua\");\n\tint posX = script.Get<int>(\"player.pos.X\");\n\tint posY = script.Get<int>(\"player.pos.Y\");\n\n\tsprite.SetImageSpeed(0.1f);\n\tsprite.SetPos(glm::vec3((float)posX, (float)posY, 0.0f));\n\n\treturn true;\n}\n\nvoid Game::Update(double delta)\n{\n\t\/*\n\tfloat speed = 3.0f * (float)delta;\n\tfloat xoffset = m_Input.GetMousePos().x - m_LastX;\n\tfloat yoffset = m_LastY - m_Input.GetMousePos().y;\n\tm_LastX = m_Input.GetMousePos().x;\n\tm_LastY = m_Input.GetMousePos().y;\n\n\tfloat sensitivity = 0.05f;\n\txoffset *= sensitivity;\n\tyoffset *= sensitivity;\n\tm_Yaw += xoffset;\n\tm_Pitch +=  yoffset;\n\n\tif (m_Pitch > 89.0f)\n\t\tm_Pitch = 89.0f;\n\telse if (m_Pitch < -89.0f)\n\t\tm_Pitch = -89.0f;\n\n\tglm::vec3 front;\n\tfront.x = cos(glm::radians(m_Pitch)) * cos(glm::radians(m_Yaw));\n\tfront.y = sin(glm::radians(m_Pitch));\n\tfront.z = sin(glm::radians(m_Yaw)) * cos(glm::radians(m_Pitch));\n\tm_Front = glm::normalize(front);\n\t*\/\n\tif (m_EM.GetSystem<Input>().GetKey(GLFW_KEY_ESCAPE))\n\t\tm_Quit = true;\n\telse if (m_EM.GetSystem<Input>().GetKey(GLFW_KEY_SPACE))\n\t\tRes.LoadSample(\"sound.ogg\")->Play();\n\t\/*if (m_Input.GetKey(GLFW_KEY_W))\n\t\tm_Pos += speed * m_Front;\n\tif (m_Input.GetKey(GLFW_KEY_S))\n\t\tm_Pos -= speed * m_Front;\n\tif (m_Input.GetKey(GLFW_KEY_A))\n\t\tm_Pos -= glm::normalize(glm::cross(m_Front, m_Up)) * speed;\n\tif (m_Input.GetKey(GLFW_KEY_D))\n\t\tm_Pos += glm::normalize(glm::cross(m_Front, m_Up)) * speed;\n\tm_EntityManager.GetCamera()->SetPos(m_Pos);\n\tm_EntityManager.GetCamera()->SetDir(m_Front);*\/\n}<commit_msg>Remove all 3D code from 2D demo<commit_after>\/*\nCopyright (C) 2018 Jakob Sinclair\n\nThis program 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 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 Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"game.hpp\"\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include \"entity.hpp\"\n#include \"shader.hpp\"\n#include \"input.hpp\"\n#include \"graphics.hpp\"\n#include \"rect2d.hpp\"\n#include \"camera.hpp\"\n#include \"sprite.hpp\"\n#include \"cache.hpp\"\n#include \"luascript.hpp\"\n#include \"iomanager.hpp\"\n\nGame::Game()\n{\n\t;\n}\n\nGame::~Game()\n{\n\t;\n}\n\nbool Game::Init()\n{\n\tm_EM.AddEntity<Entity>(std::make_unique<Entity>(\"Camera\"));\n\tm_EM.GetEntity(\"Camera\").AddComponent<Camera>(std::make_unique<Camera>(1280, 720));\t\n\n\tRes.LoadSample(\"sound.ogg\")->Play();\n\tm_EM.GetSystem<Graphics>().RegisterComponent(std::type_index(typeid(Sprite)));\n\n\tm_EM.AddEntity<Entity>(std::make_unique<Entity>(\"Player\"));\n\tauto &sprite = m_EM.GetEntity(\"Player\").AddComponent<Sprite>(std::make_unique<Sprite>(Res.LoadTex(\"sprite.png\"),\n\t                                        110, 200,\n\t                                        std::vector<uint32_t>({25, 29, 135, 229, 150, 29, 260, 229, 287, 29, 397, 229, 438, 29, 548, 229})));\t\n\n\tLuaScript script(\"player.lua\");\n\tint posX = script.Get<int>(\"player.pos.X\");\n\tint posY = script.Get<int>(\"player.pos.Y\");\n\n\tsprite.SetImageSpeed(0.1f);\n\tsprite.SetPos(glm::vec3((float)posX, (float)posY, 0.0f));\n\n\treturn true;\n}\n\nvoid Game::Update(double delta)\n{\n\tif (m_EM.GetSystem<Input>().GetKey(GLFW_KEY_ESCAPE))\n\t\tm_Quit = true;\n\telse if (m_EM.GetSystem<Input>().GetKey(GLFW_KEY_SPACE))\n\t\tRes.LoadSample(\"sound.ogg\")->Play();\n}<|endoftext|>"}
{"text":"<commit_before> \/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: aboutdialog.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: sj $ $Date: 2007-07-10 16:16: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 ABOUTDIALOG_HXX\n#include \"aboutdialog.hxx\"\n#endif\n#ifndef OPTIMIZATIONSTATS_HXX\n#include \"optimizationstats.hxx\"\n#endif\n#ifndef _FILEOPEN_DIALOG_HXX_\n#include \"fileopendialog.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_UI_DIALOGS_EXECUTABLEDIALOGRESULTS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/ExecutableDialogResults.hpp>\n#endif\n\n\/\/ ---------------\n\/\/ - ABOUTDIALOG -\n\/\/ ---------------\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star::ui;\nusing namespace ::com::sun::star::awt;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::util;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::frame;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::script;\nusing namespace ::com::sun::star::container;\n\n#define ABOUT_DIALOG_WIDTH  220\n#define ABOUT_DIALOG_HEIGHT 221\n\n\/\/ -----------------------------------------------------------------------------\n\n\nrtl::OUString InsertFixedText( AboutDialog& rAboutDialog, const rtl::OUString& rControlName, const OUString& rLabel,\n                                sal_Int32 nXPos, sal_Int32 nYPos, sal_Int32 nWidth, sal_Int32 nHeight, sal_Bool bMultiLine, sal_Int16 nTabIndex )\n{\n    OUString pNames[] = {\n        TKGet( TK_Height ),\n        TKGet( TK_Label ),\n        TKGet( TK_MultiLine ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_Step ),\n        TKGet( TK_TabIndex ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( nHeight ),\n        Any( rLabel ),\n        Any( bMultiLine ),\n        Any( nXPos ),\n        Any( nYPos ),\n        Any( (sal_Int16)0 ),\n        Any( nTabIndex ),\n        Any( nWidth ) };\n\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rAboutDialog.insertFixedText( rControlName, aNames, aValues );\n    return rControlName;\n}\n\nrtl::OUString InsertSeparator( AboutDialog& rAboutDialog, const OUString& rControlName, sal_Int32 nOrientation,\n                        sal_Int32 nPosX, sal_Int32 nPosY, sal_Int32 nWidth, sal_Int32 nHeight )\n{\n    OUString pNames[] = {\n        TKGet( TK_Height ),\n        TKGet( TK_Orientation ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_Step ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( nHeight ),\n        Any( nOrientation ),\n        Any( nPosX ),\n        Any( nPosY ),\n        Any( sal_Int16( 0 ) ),\n        Any( nWidth ) };\n\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rAboutDialog.insertControlModel( OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.awt.UnoControlFixedLineModel\" ) ),\n        rControlName, aNames, aValues );\n    return rControlName;\n}\n\nrtl::OUString InsertImage( AboutDialog& rAboutDialog, const OUString& rControlName, const OUString& rURL,\n                        sal_Int32 nPosX, sal_Int32 nPosY, sal_Int32 nWidth, sal_Int32 nHeight )\n{\n    OUString pNames[] = {\n        TKGet( TK_Border ),\n        TKGet( TK_Height ),\n        TKGet( TK_ImageURL ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_ScaleImage ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( sal_Int16( 1 ) ),\n        Any( nHeight ),\n        Any( rURL ),\n        Any( nPosX ),\n        Any( nPosY ),\n        Any( sal_True ),\n        Any( nWidth ) };\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rAboutDialog.insertImage( rControlName, aNames, aValues );\n    return rControlName;\n}\n\nrtl::OUString InsertButton( AboutDialog& rAboutDialog, const OUString& rControlName, Reference< XActionListener >& xActionListener,\n    sal_Int32 nXPos, sal_Int32 nYPos, sal_Int32 nWidth, sal_Int32 nHeight, sal_Int16 nTabIndex, PPPOptimizerTokenEnum nResID )\n{\n    OUString pNames[] = {\n        TKGet( TK_Enabled ),\n        TKGet( TK_Height ),\n        TKGet( TK_Label ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_PushButtonType ),\n        TKGet( TK_Step ),\n        TKGet( TK_TabIndex ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( sal_True ),\n        Any( nHeight ),\n        Any( rAboutDialog.getString( nResID ) ),\n        Any( nXPos ),\n        Any( nYPos ),\n        Any( static_cast< sal_Int16 >( PushButtonType_OK ) ),\n        Any( (sal_Int16)0 ),\n        Any( nTabIndex ),\n        Any( nWidth ) };\n\n\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rAboutDialog.insertButton( rControlName, xActionListener, aNames, aValues );\n    return rControlName;\n}\n\nvoid AboutDialog::InitDialog()\n{\n   \/\/ setting the dialog properties\n    OUString pNames[] = {\n        TKGet( TK_Closeable ),\n        TKGet( TK_Height ),\n        TKGet( TK_Moveable ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_Title ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( sal_True ),\n        Any( sal_Int32( ABOUT_DIALOG_HEIGHT ) ),\n        Any( sal_True ),\n        Any( sal_Int32( 113 ) ),\n        Any( sal_Int32( 42 ) ),\n        Any( getString( STR_ABOUT_VERSION ) ),\n        Any( sal_Int32( ABOUT_DIALOG_WIDTH ) ) };\n\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rtl::OUString sBitmapPath( getPath( TK_BitmapPath ) );\n    rtl::OUString sBitmap( rtl::OUString::createFromAscii( \"\/aboutlogo.png\" ) );\n    rtl::OUString sURL( sBitmapPath += sBitmap );\n\n    mxDialogModelMultiPropertySet->setPropertyValues( aNames, aValues );\n\n    int nWidth = (int) getMapsFromPixels( 387 );\n\/\/    int nHeight = (int) getMapsFromPixels( 95 );\n\n    InsertImage( *this, rtl::OUString( rtl::OUString::createFromAscii( \"aboutimage\" ) ), sURL, 0, 0, ABOUT_DIALOG_WIDTH, 60 );\n    InsertFixedText( *this, rtl::OUString( rtl::OUString::createFromAscii( \"fixedtext\" ) ), getString( STR_ABOUT_PRN ), 9, 66, ABOUT_DIALOG_WIDTH - 18, 127, sal_True, 0 );\n    InsertSeparator( *this, rtl::OUString( rtl::OUString::createFromAscii( \"separator\" ) ), 0, 0, 196, ABOUT_DIALOG_WIDTH, 8 );\n    InsertButton( *this, rtl::OUString( rtl::OUString::createFromAscii( \"button\" ) ), mxActionListener, ( nWidth \/ 2 ) - 25, 204, 50, 14, 1, STR_OK );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nAboutDialog::AboutDialog( const Reference< XComponentContext > &rxMSF, Reference< XFrame >& rxFrame ) :\n    UnoDialog( rxMSF, rxFrame ),\n    ConfigurationAccess( rxMSF, NULL ),\n    mxMSF( rxMSF ),\n    mxFrame( rxFrame ),\n    mxActionListener( new AboutActionListener( *this ) )\n{\n    Reference< XFrame > xFrame( mxController->getFrame() );\n    Reference< XWindow > xContainerWindow( xFrame->getContainerWindow() );\n    Reference< XWindowPeer > xWindowPeer( xContainerWindow, UNO_QUERY_THROW );\n    createWindowPeer( xWindowPeer );\n\n    InitDialog();\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nAboutDialog::~AboutDialog()\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nsal_Bool AboutDialog::execute()\n{\n    UnoDialog::execute();\n    return mbStatus;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid AboutActionListener::actionPerformed( const ActionEvent& rEvent )\n    throw ( com::sun::star::uno::RuntimeException )\n{\n    if ( rEvent.ActionCommand == rtl::OUString( rtl::OUString::createFromAscii( \"button\" ) ) )\n    {\n        mrAboutDialog.endExecute( sal_True );\n    }\n}\nvoid AboutActionListener::disposing( const ::com::sun::star::lang::EventObject& \/* Source *\/ )\n    throw ( com::sun::star::uno::RuntimeException )\n{\n}\n<commit_msg>fixed about image scaling<commit_after> \/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: aboutdialog.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: sj $ $Date: 2007-08-17 15:10: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 ABOUTDIALOG_HXX\n#include \"aboutdialog.hxx\"\n#endif\n#ifndef OPTIMIZATIONSTATS_HXX\n#include \"optimizationstats.hxx\"\n#endif\n#ifndef _FILEOPEN_DIALOG_HXX_\n#include \"fileopendialog.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_UI_DIALOGS_EXECUTABLEDIALOGRESULTS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/ExecutableDialogResults.hpp>\n#endif\n\n\/\/ ---------------\n\/\/ - ABOUTDIALOG -\n\/\/ ---------------\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star::ui;\nusing namespace ::com::sun::star::awt;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::util;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::frame;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::script;\nusing namespace ::com::sun::star::container;\n\n#define ABOUT_DIALOG_WIDTH  200\n#define ABOUT_DIALOG_HEIGHT 221\n\n\/\/ -----------------------------------------------------------------------------\n\n\nrtl::OUString InsertFixedText( AboutDialog& rAboutDialog, const rtl::OUString& rControlName, const OUString& rLabel,\n                                sal_Int32 nXPos, sal_Int32 nYPos, sal_Int32 nWidth, sal_Int32 nHeight, sal_Bool bMultiLine, sal_Int16 nTabIndex )\n{\n    OUString pNames[] = {\n        TKGet( TK_Height ),\n        TKGet( TK_Label ),\n        TKGet( TK_MultiLine ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_Step ),\n        TKGet( TK_TabIndex ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( nHeight ),\n        Any( rLabel ),\n        Any( bMultiLine ),\n        Any( nXPos ),\n        Any( nYPos ),\n        Any( (sal_Int16)0 ),\n        Any( nTabIndex ),\n        Any( nWidth ) };\n\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rAboutDialog.insertFixedText( rControlName, aNames, aValues );\n    return rControlName;\n}\n\nrtl::OUString InsertSeparator( AboutDialog& rAboutDialog, const OUString& rControlName, sal_Int32 nOrientation,\n                        sal_Int32 nPosX, sal_Int32 nPosY, sal_Int32 nWidth, sal_Int32 nHeight )\n{\n    OUString pNames[] = {\n        TKGet( TK_Height ),\n        TKGet( TK_Orientation ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_Step ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( nHeight ),\n        Any( nOrientation ),\n        Any( nPosX ),\n        Any( nPosY ),\n        Any( sal_Int16( 0 ) ),\n        Any( nWidth ) };\n\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rAboutDialog.insertControlModel( OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.awt.UnoControlFixedLineModel\" ) ),\n        rControlName, aNames, aValues );\n    return rControlName;\n}\n\nrtl::OUString InsertImage( AboutDialog& rAboutDialog, const OUString& rControlName, const OUString& rURL,\n                        sal_Int32 nPosX, sal_Int32 nPosY, sal_Int32 nWidth, sal_Int32 nHeight )\n{\n    OUString pNames[] = {\n        TKGet( TK_Border ),\n        TKGet( TK_Height ),\n        TKGet( TK_ImageURL ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_ScaleImage ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( sal_Int16( 1 ) ),\n        Any( nHeight ),\n        Any( rURL ),\n        Any( nPosX ),\n        Any( nPosY ),\n        Any( sal_False ),\n        Any( nWidth ) };\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rAboutDialog.insertImage( rControlName, aNames, aValues );\n    return rControlName;\n}\n\nrtl::OUString InsertButton( AboutDialog& rAboutDialog, const OUString& rControlName, Reference< XActionListener >& xActionListener,\n    sal_Int32 nXPos, sal_Int32 nYPos, sal_Int32 nWidth, sal_Int32 nHeight, sal_Int16 nTabIndex, PPPOptimizerTokenEnum nResID )\n{\n    OUString pNames[] = {\n        TKGet( TK_Enabled ),\n        TKGet( TK_Height ),\n        TKGet( TK_Label ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_PushButtonType ),\n        TKGet( TK_Step ),\n        TKGet( TK_TabIndex ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( sal_True ),\n        Any( nHeight ),\n        Any( rAboutDialog.getString( nResID ) ),\n        Any( nXPos ),\n        Any( nYPos ),\n        Any( static_cast< sal_Int16 >( PushButtonType_OK ) ),\n        Any( (sal_Int16)0 ),\n        Any( nTabIndex ),\n        Any( nWidth ) };\n\n\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rAboutDialog.insertButton( rControlName, xActionListener, aNames, aValues );\n    return rControlName;\n}\n\nvoid AboutDialog::InitDialog()\n{\n   \/\/ setting the dialog properties\n    OUString pNames[] = {\n        TKGet( TK_Closeable ),\n        TKGet( TK_Height ),\n        TKGet( TK_Moveable ),\n        TKGet( TK_PositionX ),\n        TKGet( TK_PositionY ),\n        TKGet( TK_Title ),\n        TKGet( TK_Width ) };\n\n    Any pValues[] = {\n        Any( sal_True ),\n        Any( sal_Int32( ABOUT_DIALOG_HEIGHT ) ),\n        Any( sal_True ),\n        Any( sal_Int32( 113 ) ),\n        Any( sal_Int32( 42 ) ),\n        Any( getString( STR_ABOUT_VERSION ) ),\n        Any( sal_Int32( ABOUT_DIALOG_WIDTH ) ) };\n\n    sal_Int32 nCount = sizeof( pNames ) \/ sizeof( OUString );\n\n    Sequence< rtl::OUString >   aNames( pNames, nCount );\n    Sequence< Any >             aValues( pValues, nCount );\n\n    rtl::OUString sBitmapPath( getPath( TK_BitmapPath ) );\n    rtl::OUString sBitmap( rtl::OUString::createFromAscii( \"\/aboutlogo.png\" ) );\n    rtl::OUString sURL( sBitmapPath += sBitmap );\n\n    mxDialogModelMultiPropertySet->setPropertyValues( aNames, aValues );\n    sal_Int32 nWidth = getMapsFromPixels( 387 );\n    if ( nWidth )\n        mxDialogModelPropertySet->setPropertyValue( TKGet( TK_Width ), Any( nWidth ) );\n    else\n        nWidth = ABOUT_DIALOG_WIDTH;\n\n\/\/    int nHeight = (int) getMapsFromPixels( 95 );\n\n    InsertImage( *this, rtl::OUString( rtl::OUString::createFromAscii( \"aboutimage\" ) ), sURL, 0, 0, nWidth, 60 );\n    InsertFixedText( *this, rtl::OUString( rtl::OUString::createFromAscii( \"fixedtext\" ) ), getString( STR_ABOUT_PRN ), 9, 66, nWidth - 18, 127, sal_True, 0 );\n    InsertSeparator( *this, rtl::OUString( rtl::OUString::createFromAscii( \"separator\" ) ), 0, 0, 196, nWidth, 8 );\n    InsertButton( *this, rtl::OUString( rtl::OUString::createFromAscii( \"button\" ) ), mxActionListener, ( nWidth \/ 2 ) - 25, 204, 50, 14, 1, STR_OK );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nAboutDialog::AboutDialog( const Reference< XComponentContext > &rxMSF, Reference< XFrame >& rxFrame ) :\n    UnoDialog( rxMSF, rxFrame ),\n    ConfigurationAccess( rxMSF, NULL ),\n    mxMSF( rxMSF ),\n    mxFrame( rxFrame ),\n    mxActionListener( new AboutActionListener( *this ) )\n{\n    Reference< XFrame > xFrame( mxController->getFrame() );\n    Reference< XWindow > xContainerWindow( xFrame->getContainerWindow() );\n    Reference< XWindowPeer > xWindowPeer( xContainerWindow, UNO_QUERY_THROW );\n    createWindowPeer( xWindowPeer );\n\n    InitDialog();\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nAboutDialog::~AboutDialog()\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nsal_Bool AboutDialog::execute()\n{\n    UnoDialog::execute();\n    return mbStatus;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid AboutActionListener::actionPerformed( const ActionEvent& rEvent )\n    throw ( com::sun::star::uno::RuntimeException )\n{\n    if ( rEvent.ActionCommand == rtl::OUString( rtl::OUString::createFromAscii( \"button\" ) ) )\n    {\n        mrAboutDialog.endExecute( sal_True );\n    }\n}\nvoid AboutActionListener::disposing( const ::com::sun::star::lang::EventObject& \/* Source *\/ )\n    throw ( com::sun::star::uno::RuntimeException )\n{\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*  ----------------------------------------------------------------\n Copyright 2016 Cisco 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 <string.h>\n#include <iostream>\n\n#include <ydk\/netconf_provider.hpp>\n#include <ydk\/netconf_service.hpp>\n#include <ydk_ydktest\/ydktest_sanity.hpp>\n#include <ydk_ydktest\/openconfig_bgp.hpp>\n#include <ydk_ydktest\/openconfig_interfaces.hpp>\n#include <ydk\/types.hpp>\n#include <ydk\/common_utilities.hpp>\n\n#include <spdlog\/spdlog.h>\n\n#include \"config.hpp\"\n#include \"catch.hpp\"\n\nusing namespace ydk;\nusing namespace ydktest;\nusing namespace std;\n\nvoid print_data_node(shared_ptr<ydk::path::DataNode> dn);\nvoid print_entity(shared_ptr<ydk::Entity> entity, ydk::path::RootSchemaNode& root);\n\n\/\/ cancel_commit -- issues in netsim\n\/\/TEST_CASE(\"cancel_commit\")\n\/\/{\n\/\/    \/\/ session\n\/\/    path::Repository repo{TEST_HOME};\n\/\/    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n\/\/    NetconfService ns{};\n\/\/\n\/\/    auto reply = ns.cancel_commit(session);\n\/\/    REQUIRE(reply);\n\/\/}\n\n\/\/ close_session\nTEST_CASE(\"close_session\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    auto reply = ns.close_session(provider);\n    REQUIRE(reply);\n}\n\n\/\/ commit\nTEST_CASE(\"commit\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    auto reply = ns.commit(provider);\n    REQUIRE(reply);\n}\n\n\/\/ copy_config\nTEST_CASE(\"copy_config\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n    DataStore source = DataStore::running;\n\n    auto reply = ns.copy_config(provider, target, source);\n    REQUIRE(reply);\n}\n\n\/\/ delete_config -- issues in netsim\nTEST_CASE(\"delete_config\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::url;\n\n\/\/    auto reply = ns.delete_config(session, target, \"http:\/\/test\");\n    CHECK_THROWS_AS(ns.delete_config(provider, target, \"http:\/\/test\"), YError);\n}\n\n\/\/ discard_changes\nTEST_CASE(\"discard_changes\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    auto reply = ns.discard_changes(provider);\n    REQUIRE(reply);\n}\n\nTEST_CASE(\"get_edit_copy_config\")\n{\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n    DataStore source = DataStore::running;\n\n    \/\/ Build filter\n    openconfig_interfaces::Interfaces interfaces_filter{};\n    openconfig_bgp::Bgp bgp_filter{};\n    vector<ydk::Entity*> filter_list{};\n    filter_list.push_back(&interfaces_filter);\n    filter_list.push_back(&bgp_filter);\n\n    \/\/ Read running config\n    auto get_config_list = ns.get_config(provider, source, filter_list);\n\n    vector<Entity*> copy_config_list{};\n    for (auto ent : get_config_list) {\n    \t\/\/print_entity(ent, provider.get_session().get_root_schema());\n        copy_config_list.push_back(ent.get());\n    }\n\n    \/\/ Copy config to candidate\n    auto result = ns.copy_config(provider, target, copy_config_list);\n    REQUIRE(result);\n\n    \/\/ Discard changes\n    result = ns.discard_changes(provider);\n    REQUIRE(result);\n}\n\n\/\/ edit_config, get_config\nTEST_CASE(\"edit_config\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n    DataStore source = DataStore::candidate;\n    openconfig_bgp::Bgp filter = {};\n    openconfig_bgp::Bgp bgp = {};\n    bgp.global->config->as = 6500;\n\n    auto reply = ns.edit_config(provider, target, bgp);\n    REQUIRE(reply);\n\n    auto data = ns.get_config(provider, source, filter);\n    REQUIRE(data);\n\n    auto data_ptr = dynamic_cast<openconfig_bgp::Bgp*>(data.get());\n    REQUIRE(data_ptr != nullptr);\n    REQUIRE(data_ptr->global->config->as == bgp.global->config->as);\n\n    reply = ns.discard_changes(provider);\n    REQUIRE(reply);\n}\n\nTEST_CASE(\"edit_multiple_config\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n    DataStore source = DataStore::candidate;\n\n    \/\/ Create 'native' configuration\n    ydktest::ydktest_sanity::Native native{};\n    native.hostname = \"My Host\";\n    native.version = \"0.1.2\";\n\n    \/\/ Set the Global AS\n    openconfig_bgp::Bgp bgp{};\n    bgp.global->config->as = 65051;\n    bgp.global->config->router_id = \"10.20.30.40\";\n\n    \/\/ Create entity list\n    vector<ydk::Entity*> edit_list{};\n    edit_list.push_back(&native);\n    edit_list.push_back(&bgp);\n\n    auto reply = ns.edit_config(provider, target, edit_list);\n    REQUIRE(reply);\n\n    \/\/ Build filter\n    ydktest::ydktest_sanity::Native native_filter{};\n    openconfig_bgp::Bgp bgp_filter{};\n    vector<ydk::Entity*> filter_list{};\n    filter_list.push_back(&native_filter);\n    filter_list.push_back(&bgp_filter);\n\n    \/\/ Read current configuration and print it\n    auto read_list = ns.get_config(provider, source, filter_list);\n    REQUIRE(read_list.size() == 2);\n    for (auto item : read_list) {\n        string path = item->get_segment_path();\n        if (path.find(\"bgp\") != string::npos) {\n            auto data_ptr = dynamic_cast<openconfig_bgp::Bgp*>(item.get());\n            REQUIRE(data_ptr != nullptr);\n            REQUIRE(data_ptr->global->config->as == bgp.global->config->as);\n            REQUIRE(data_ptr->global->config->router_id == bgp.global->config->router_id);\n        }\n        if (path.find(\"native\") != string::npos) {\n            auto data_ptr = dynamic_cast<ydktest::ydktest_sanity::Native*>(item.get());\n            REQUIRE(data_ptr != nullptr);\n            REQUIRE(data_ptr->hostname == native.hostname);\n            REQUIRE(data_ptr->version == native.version);\n        }\n    }\n\n    \/\/ Discard config changes\n    reply = ns.discard_changes(provider);\n    REQUIRE(reply);\n}\n\n\/\/ get\nTEST_CASE(\"get\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    openconfig_bgp::Bgp filter = {};\n\n    auto reply = ns.get(provider, filter);\n    REQUIRE(reply);\n}\n\n\/\/ kill_session\nTEST_CASE(\"kill_session\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    int session_id = 3;\n\n\/\/    auto reply = ns.kill_session(session, session_id);\n    CHECK_THROWS_AS(ns.kill_session(provider, session_id), YError);\n}\n\n\/\/ lock, unlock\nTEST_CASE(\"lock\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n\n    auto reply = ns.lock(provider, target);\n    REQUIRE(reply);\n\n    reply = ns.unlock(provider, target);\n    REQUIRE(reply);\n}\n\n\/\/ validate\nTEST_CASE(\"validate\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore source = DataStore::candidate;\n\n    auto reply = ns.validate(provider, source);\n    REQUIRE(reply);\n}\n\n\/\/ read device configuration (no filter)\nTEST_CASE(\"ietf_get_config_rpc\")\n{\n    path::Repository repo{TEST_HOME};\n    ydk::path::NetconfSession session{repo, \"127.0.0.1\", \"admin\", \"admin\",  12022};\n    ydk::path::RootSchemaNode& schema = session.get_root_schema();\n\n    std::shared_ptr<ydk::path::Rpc> read_rpc { schema.create_rpc(\"ietf-netconf:get-config\") };\n    read_rpc->get_input_node().create_datanode(\"source\/running\");\n\n    auto read_result = (*read_rpc)(session);\n    REQUIRE(read_result != nullptr);\n\n    \/\/ Print config\n    vector<shared_ptr<ydk::path::DataNode>> data_nodes = read_result->get_children();\n    for (auto dn : data_nodes) {\n        print_data_node(dn);\n    }\n}\n\n\/\/ read device configuration and state (no filter)\nTEST_CASE(\"ietf_get_rpc\")\n{\n    NetconfServiceProvider provider{\"127.0.0.1\", \"admin\", \"admin\", 12022};\n    ydk::path::RootSchemaNode& schema = provider.get_session().get_root_schema();\n\n    std::shared_ptr<ydk::path::Rpc> read_rpc { schema.create_rpc(\"ietf-netconf:get\") };\n\n    REQUIRE_THROWS_AS((*read_rpc)(provider.get_session()), ydk::YModelError);\n}\n\nTEST_CASE(\"get_config_openconfig_interfaces_and_bgp\")\n{\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    ydk::path::RootSchemaNode& schema = provider.get_session().get_root_schema();\n\n    std::shared_ptr<ydk::path::Rpc> read_rpc { schema.create_rpc(\"ietf-netconf:get\") };\n\n    \/\/ filter\n    openconfig_interfaces::Interfaces interfaces_filter{};\n    openconfig_bgp::Bgp bgp_filter{};\n\n    std::string filter_string = get_xml_subtree_filter_payload(interfaces_filter, provider);\n    filter_string += \"\\n\" + get_xml_subtree_filter_payload(bgp_filter, provider);\n\n    read_rpc->get_input_node().create_datanode(\"filter\", filter_string);\n\n    auto read_result = (*read_rpc)(provider.get_session());\n    REQUIRE(read_result != nullptr);\n\n    \/\/ Print config\n    vector<shared_ptr<ydk::path::DataNode>> data_nodes = read_result->get_children();\n    for (auto dn : data_nodes) {\n        print_data_node(dn);\n    }\n}\n<commit_msg>Fixed Travis c++ test<commit_after>\/*  ----------------------------------------------------------------\n Copyright 2016 Cisco 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 <string.h>\n#include <iostream>\n\n#include <ydk\/netconf_provider.hpp>\n#include <ydk\/netconf_service.hpp>\n#include <ydk_ydktest\/ydktest_sanity.hpp>\n#include <ydk_ydktest\/openconfig_bgp.hpp>\n#include <ydk_ydktest\/openconfig_interfaces.hpp>\n#include <ydk\/types.hpp>\n#include <ydk\/common_utilities.hpp>\n\n#include <spdlog\/spdlog.h>\n\n#include \"config.hpp\"\n#include \"catch.hpp\"\n\nusing namespace ydk;\nusing namespace ydktest;\nusing namespace std;\n\nvoid print_data_node(shared_ptr<ydk::path::DataNode> dn);\nvoid print_entity(shared_ptr<ydk::Entity> entity, ydk::path::RootSchemaNode& root);\n\n\/\/ cancel_commit -- issues in netsim\n\/\/TEST_CASE(\"cancel_commit\")\n\/\/{\n\/\/    \/\/ session\n\/\/    path::Repository repo{TEST_HOME};\n\/\/    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n\/\/    NetconfService ns{};\n\/\/\n\/\/    auto reply = ns.cancel_commit(session);\n\/\/    REQUIRE(reply);\n\/\/}\n\n\/\/ close_session\nTEST_CASE(\"close_session\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    auto reply = ns.close_session(provider);\n    REQUIRE(reply);\n}\n\n\/\/ commit\nTEST_CASE(\"commit\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    auto reply = ns.commit(provider);\n    REQUIRE(reply);\n}\n\n\/\/ copy_config\nTEST_CASE(\"copy_config\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n    DataStore source = DataStore::running;\n\n    auto reply = ns.copy_config(provider, target, source);\n    REQUIRE(reply);\n}\n\n\/\/ delete_config -- issues in netsim\nTEST_CASE(\"delete_config\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::url;\n\n\/\/    auto reply = ns.delete_config(session, target, \"http:\/\/test\");\n    CHECK_THROWS_AS(ns.delete_config(provider, target, \"http:\/\/test\"), YError);\n}\n\n\/\/ discard_changes\nTEST_CASE(\"discard_changes\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    auto reply = ns.discard_changes(provider);\n    REQUIRE(reply);\n}\n\nTEST_CASE(\"get_edit_copy_config\")\n{\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n    DataStore source = DataStore::running;\n\n    \/\/ Build filter\n    openconfig_interfaces::Interfaces interfaces_filter{};\n    openconfig_bgp::Bgp bgp_filter{};\n    vector<ydk::Entity*> filter_list{};\n    filter_list.push_back(&interfaces_filter);\n    filter_list.push_back(&bgp_filter);\n\n    \/\/ Read running config\n    auto get_config_list = ns.get_config(provider, source, filter_list);\n\n    vector<Entity*> copy_config_list{};\n    for (auto ent : get_config_list) {\n    \t\/\/print_entity(ent, provider.get_session().get_root_schema());\n        copy_config_list.push_back(ent.get());\n    }\n\n    \/\/ Copy config to candidate\n    auto result = ns.copy_config(provider, target, copy_config_list);\n    REQUIRE(result);\n\n    \/\/ Discard changes\n    result = ns.discard_changes(provider);\n    REQUIRE(result);\n}\n\n\/\/ edit_config, get_config\nTEST_CASE(\"edit_config\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n    DataStore source = DataStore::candidate;\n    openconfig_bgp::Bgp filter = {};\n    openconfig_bgp::Bgp bgp = {};\n    bgp.global->config->as = 6500;\n\n    auto reply = ns.edit_config(provider, target, bgp);\n    REQUIRE(reply);\n\n    auto data = ns.get_config(provider, source, filter);\n    REQUIRE(data);\n\n    auto data_ptr = dynamic_cast<openconfig_bgp::Bgp*>(data.get());\n    REQUIRE(data_ptr != nullptr);\n    REQUIRE(data_ptr->global->config->as == bgp.global->config->as);\n\n    reply = ns.discard_changes(provider);\n    REQUIRE(reply);\n}\n\nTEST_CASE(\"edit_multiple_config\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n    DataStore source = DataStore::candidate;\n\n    \/\/ Create 'native' configuration\n    ydktest::ydktest_sanity::Native native{};\n    native.hostname = \"My Host\";\n    native.version = \"0.1.2\";\n\n    \/\/ Set the Global AS\n    openconfig_bgp::Bgp bgp{};\n    bgp.global->config->as = 65051;\n    bgp.global->config->router_id = \"10.20.30.40\";\n\n    \/\/ Create entity list\n    vector<ydk::Entity*> edit_list{};\n    edit_list.push_back(&native);\n    edit_list.push_back(&bgp);\n\n    auto reply = ns.edit_config(provider, target, edit_list);\n    REQUIRE(reply);\n\n    \/\/ Build filter\n    ydktest::ydktest_sanity::Native native_filter{};\n    openconfig_bgp::Bgp bgp_filter{};\n    vector<ydk::Entity*> filter_list{};\n    filter_list.push_back(&native_filter);\n    filter_list.push_back(&bgp_filter);\n\n    \/\/ Read current configuration and print it\n    auto read_list = ns.get_config(provider, source, filter_list);\n    REQUIRE(read_list.size() == 2);\n    for (auto item : read_list) {\n        string path = item->get_segment_path();\n        if (path.find(\"bgp\") != string::npos) {\n            auto data_ptr = dynamic_cast<openconfig_bgp::Bgp*>(item.get());\n            REQUIRE(data_ptr != nullptr);\n            REQUIRE(data_ptr->global->config->as == bgp.global->config->as);\n            REQUIRE(data_ptr->global->config->router_id == bgp.global->config->router_id);\n        }\n        if (path.find(\"native\") != string::npos) {\n            auto data_ptr = dynamic_cast<ydktest::ydktest_sanity::Native*>(item.get());\n            REQUIRE(data_ptr != nullptr);\n            REQUIRE(data_ptr->hostname == native.hostname);\n            REQUIRE(data_ptr->version == native.version);\n        }\n    }\n\n    \/\/ Discard config changes\n    reply = ns.discard_changes(provider);\n    REQUIRE(reply);\n}\n\n\/\/ get\nTEST_CASE(\"get\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    openconfig_bgp::Bgp filter = {};\n\n    auto reply = ns.get(provider, filter);\n    REQUIRE(reply);\n}\n\n\/\/ kill_session\nTEST_CASE(\"kill_session\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    int session_id = 3;\n\n\/\/    auto reply = ns.kill_session(session, session_id);\n    CHECK_THROWS_AS(ns.kill_session(provider, session_id), YError);\n}\n\n\/\/ lock, unlock\nTEST_CASE(\"lock\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore target = DataStore::candidate;\n\n    auto reply = ns.lock(provider, target);\n    REQUIRE(reply);\n\n    reply = ns.unlock(provider, target);\n    REQUIRE(reply);\n}\n\n\/\/ validate\nTEST_CASE(\"validate\")\n{\n    \/\/ session\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    NetconfService ns{};\n\n    DataStore source = DataStore::candidate;\n\n    auto reply = ns.validate(provider, source);\n    REQUIRE(reply);\n}\n\n\/\/ read device configuration (no filter)\nTEST_CASE(\"ietf_get_config_rpc\")\n{\n    path::Repository repo{TEST_HOME};\n    ydk::path::NetconfSession session{repo, \"127.0.0.1\", \"admin\", \"admin\",  12022};\n    ydk::path::RootSchemaNode& schema = session.get_root_schema();\n\n    std::shared_ptr<ydk::path::Rpc> read_rpc { schema.create_rpc(\"ietf-netconf:get-config\") };\n    read_rpc->get_input_node().create_datanode(\"source\/running\");\n\n    auto read_result = (*read_rpc)(session);\n    REQUIRE(read_result != nullptr);\n\n    \/\/ Print config\n    vector<shared_ptr<ydk::path::DataNode>> data_nodes = read_result->get_children();\n    for (auto dn : data_nodes) {\n        print_data_node(dn);\n    }\n}\n\n\/\/ read device configuration and state (no filter)\nTEST_CASE(\"ietf_get_rpc\")\n{\n    NetconfServiceProvider provider{\"127.0.0.1\", \"admin\", \"admin\", 12022};\n    ydk::path::RootSchemaNode& schema = provider.get_session().get_root_schema();\n\n    std::shared_ptr<ydk::path::Rpc> read_rpc { schema.create_rpc(\"ietf-netconf:get\") };\n    try {\n        (*read_rpc)(provider.get_session());\n    }\n    catch (YModelError ex) {\n        cout << \"Exception while executing RPC: \" << ex.what() << endl;\n    }\n}\n\nTEST_CASE(\"get_config_openconfig_interfaces_and_bgp\")\n{\n    path::Repository repo{TEST_HOME};\n    NetconfServiceProvider provider{repo, \"127.0.0.1\", \"admin\", \"admin\", 12022};\n    ydk::path::RootSchemaNode& schema = provider.get_session().get_root_schema();\n\n    std::shared_ptr<ydk::path::Rpc> read_rpc { schema.create_rpc(\"ietf-netconf:get\") };\n\n    \/\/ filter\n    openconfig_interfaces::Interfaces interfaces_filter{};\n    openconfig_bgp::Bgp bgp_filter{};\n\n    std::string filter_string = get_xml_subtree_filter_payload(interfaces_filter, provider);\n    filter_string += \"\\n\" + get_xml_subtree_filter_payload(bgp_filter, provider);\n\n    read_rpc->get_input_node().create_datanode(\"filter\", filter_string);\n\n    auto read_result = (*read_rpc)(provider.get_session());\n    REQUIRE(read_result != nullptr);\n\n    \/\/ Print config\n    vector<shared_ptr<ydk::path::DataNode>> data_nodes = read_result->get_children();\n    for (auto dn : data_nodes) {\n        print_data_node(dn);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program: Visomics\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.apache.org\/licenses\/LICENSE-2.0\n\n  Unless required by applicable law or agreed to in writing, software\n  distributed under the License is distributed on an \"AS IS\" BASIS,\n  WITHOUT WARRANTIES OR CONDITIONS OF 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 <QDebug>\n#include <QList>\n#include <QScriptEngine>\n#include <QScriptValue>\n\n\/\/ Visomics includes\n#include \"voDataObject.h\"\n#include \"voKMeansClusteringDynView.h\"\n#include \"voUtils.h\"\n\n\/\/ VTK includes\n#include <vtkIntArray.h>\n#include <vtkTable.h>\n\n\/\/ --------------------------------------------------------------------------\nclass voKMeansClusteringDynViewPrivate\n{\npublic:\n  voKMeansClusteringDynViewPrivate();\n};\n\n\/\/ --------------------------------------------------------------------------\n\/\/ voKMeansClusteringDynViewPrivate methods\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClusteringDynViewPrivate::voKMeansClusteringDynViewPrivate()\n{\n}\n\n\/\/ --------------------------------------------------------------------------\n\/\/ voKMeansClusteringDynView methods\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClusteringDynView::voKMeansClusteringDynView(QWidget * newParent):\n    Superclass(newParent), d_ptr(new voKMeansClusteringDynViewPrivate)\n{\n}\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClusteringDynView::~voKMeansClusteringDynView()\n{\n}\n\nnamespace\n{\n\n\/\/ --------------------------------------------------------------------------\nQScriptValue scriptValueFromCluster(QScriptEngine* scriptEngine, vtkTable * clusterTable, int clusterId)\n{\n  QScriptValue clusterChildren = scriptEngine->newArray();\n  quint32 childCount = 0;\n  for(vtkIdType cid = 1; cid < clusterTable->GetNumberOfColumns() ; ++cid)\n    {\n    vtkIntArray * currentColumn = vtkIntArray::SafeDownCast(clusterTable->GetColumn(cid));\n    int currentValue = currentColumn->GetValue(0);\n    if (currentValue == clusterId)\n      {\n      QScriptValue clusterChild = scriptEngine->newObject();\n      clusterChild.setProperty(\"name\", QScriptValue(currentColumn->GetName()));\n      clusterChildren.setProperty(childCount, clusterChild);\n      ++childCount;\n      }\n    }\n  return clusterChildren;\n}\n\n\/\/ --------------------------------------------------------------------------\nQScriptValue scriptValueFromClusters(QScriptEngine* scriptEngine, vtkTable * clusterTable, quint32 kmeansCenters)\n{\n  QScriptValue array = scriptEngine->newArray();\n  QScriptValueList::const_iterator it;\n  for (quint32 i = 0; i < kmeansCenters; ++i)\n    {\n    QScriptValue cluster = scriptEngine->newObject();\n    cluster.setProperty(\"name\", QScriptValue(QString(\"Cluster %1\").arg(i + 1)));\n    cluster.setProperty(\"children\", scriptValueFromCluster(scriptEngine, clusterTable, i + 1));\n    array.setProperty(i, cluster);\n    }\n  return array;\n}\n\n} \/\/ end of anonymous namespace\n\n\/\/ --------------------------------------------------------------------------\nQString voKMeansClusteringDynView::stringify(const voDataObject& dataObject)\n{\n  vtkTable * table = vtkTable::SafeDownCast(dataObject.dataAsVTKDataObject());\n  if (!table)\n    {\n    qCritical() << \"voKMeansClusteringDynView - Failed to setDataObject - vtkTable data is expected !\";\n    return QString();\n    }\n\n  bool ok = false;\n  int kmeansCenters = dataObject.property(\"kmeans_centers\").toInt(&ok);\n  if (!ok)\n    {\n    qCritical() << \"voKMeansClusteringDynView - Failed to setDataObject - 'kmeans_center' property is expected !\";\n    return QString();\n    }\n\n  QScriptEngine scriptEngine;\n  QScriptValue object = scriptEngine.newObject();\n  object.setProperty(\"name\", QScriptValue(\"Clusters\"));\n  object.setProperty(\"children\", scriptValueFromClusters(&scriptEngine, table, kmeansCenters));\n\n  return voUtils::stringify(&scriptEngine, object);\n}\n<commit_msg>Cast to vtkAbstractArray rather than vtkIntArray<commit_after>\/*=========================================================================\n\n  Program: Visomics\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.apache.org\/licenses\/LICENSE-2.0\n\n  Unless required by applicable law or agreed to in writing, software\n  distributed under the License is distributed on an \"AS IS\" BASIS,\n  WITHOUT WARRANTIES OR CONDITIONS OF 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 <QDebug>\n#include <QList>\n#include <QScriptEngine>\n#include <QScriptValue>\n\n\/\/ Visomics includes\n#include \"voDataObject.h\"\n#include \"voKMeansClusteringDynView.h\"\n#include \"voUtils.h\"\n\n\/\/ VTK includes\n#include <vtkAbstractArray.h>\n#include <vtkTable.h>\n\n\/\/ --------------------------------------------------------------------------\nclass voKMeansClusteringDynViewPrivate\n{\npublic:\n  voKMeansClusteringDynViewPrivate();\n};\n\n\/\/ --------------------------------------------------------------------------\n\/\/ voKMeansClusteringDynViewPrivate methods\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClusteringDynViewPrivate::voKMeansClusteringDynViewPrivate()\n{\n}\n\n\/\/ --------------------------------------------------------------------------\n\/\/ voKMeansClusteringDynView methods\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClusteringDynView::voKMeansClusteringDynView(QWidget * newParent):\n    Superclass(newParent), d_ptr(new voKMeansClusteringDynViewPrivate)\n{\n}\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClusteringDynView::~voKMeansClusteringDynView()\n{\n}\n\nnamespace\n{\n\n\/\/ --------------------------------------------------------------------------\nQScriptValue scriptValueFromCluster(QScriptEngine* scriptEngine, vtkTable * clusterTable, int clusterId)\n{\n  QScriptValue clusterChildren = scriptEngine->newArray();\n  quint32 childCount = 0;\n\n  for(vtkIdType cid = 1; cid < clusterTable->GetNumberOfColumns() ; ++cid)\n    {\n\n    vtkAbstractArray * currentColumn = vtkAbstractArray::SafeDownCast(clusterTable->GetColumn(cid));\n    int currentValue = currentColumn->GetVariantValue(0).ToInt();\n    if (currentValue == clusterId)\n      {\n      QScriptValue clusterChild = scriptEngine->newObject();\n      clusterChild.setProperty(\"name\", QScriptValue(currentColumn->GetName()));\n      clusterChildren.setProperty(childCount, clusterChild);\n      ++childCount;\n      }\n    }\n  return clusterChildren;\n}\n\n\/\/ --------------------------------------------------------------------------\nQScriptValue scriptValueFromClusters(QScriptEngine* scriptEngine, vtkTable * clusterTable, quint32 kmeansCenters)\n{\n  QScriptValue array = scriptEngine->newArray();\n  QScriptValueList::const_iterator it;\n  for (quint32 i = 0; i < kmeansCenters; ++i)\n    {\n    QScriptValue cluster = scriptEngine->newObject();\n    cluster.setProperty(\"name\", QScriptValue(QString(\"Cluster %1\").arg(i + 1)));\n    cluster.setProperty(\"children\", scriptValueFromCluster(scriptEngine, clusterTable, i + 1));\n    array.setProperty(i, cluster);\n    }\n  return array;\n}\n\n} \/\/ end of anonymous namespace\n\n\/\/ --------------------------------------------------------------------------\nQString voKMeansClusteringDynView::stringify(const voDataObject& dataObject)\n{\n  vtkTable * table = vtkTable::SafeDownCast(dataObject.dataAsVTKDataObject());\n  if (!table)\n    {\n    qCritical() << \"voKMeansClusteringDynView - Failed to setDataObject - vtkTable data is expected !\";\n    return QString();\n    }\n\n  bool ok = false;\n  int kmeansCenters = dataObject.property(\"kmeans_centers\").toInt(&ok);\n  if (!ok)\n    {\n    qCritical() << \"voKMeansClusteringDynView - Failed to setDataObject - 'kmeans_center' property is expected !\";\n    return QString();\n    }\n\n  QScriptEngine scriptEngine;\n  QScriptValue object = scriptEngine.newObject();\n  object.setProperty(\"name\", QScriptValue(\"Clusters\"));\n  object.setProperty(\"children\", scriptValueFromClusters(&scriptEngine, table, kmeansCenters));\n\n  return voUtils::stringify(&scriptEngine, object);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"chs.hpp\"\n\nCHS::CHS()\n{\ncylinder=0,head=0,sector=0,\nspt=63,tpc=255;\n}\n\nCHS::CHS(int c,int h,int s)\n{\ncylinder=c,head=h,sector=s,\n\nspt=63,tpc=255;\n}\n\nCHS::CHS(long long lba)\n{\nspt=63,tpc=255;\ncalc(lba);\n\n}\n\n\nvoid CHS::calc(long long lba)\n{\nlong long temp;\n\ncylinder =lba \/ (tpc * spt);\ntemp     = lba % (tpc * spt);\nhead     = temp \/ spt;\nsector   = temp % spt + 1;\n\n}\n\n\nbool CHS::SetCylinder(long long cylinder)\n{\n   this->cylinder=cylinder;\n   return true;\n}\n\nbool CHS::SetHead(unsigned int head)\n{\n   if(head>tpc) return false;\n   this->head=head;\n   return true;\n}\n\nbool CHS::SetSector(unsigned int sector)\n{\n   if(head>spt) return false;\n   this->sector=sector;\n   return true;\n}\n\n\nunsigned long CHS::GetCylinder()\n{\n  return this->cylinder;\n}\nunsigned int CHS::GetHead()\n{\n  return this->head;\n}\nunsigned int CHS::GetSector()\n{\n   return this->sector;\n}\n\n\nbool CHS::SetGeometry(int spt,int tpc)\n{\n  this->spt=spt;\n  this->tpc=tpc;\nreturn true;\n}\n\nint CHS::GetSPT() { return spt; }\nint CHS::GetTPC() { return tpc; }\n\nvoid CHS::SetSPT(int spt)\n{\nlong long old_lba=ToLBA();\nthis->spt=spt;\ncalc(old_lba);\n}\nvoid CHS::SetTPC(int tpc)\n{\nlong long old_lba=ToLBA();\nthis->tpc=tpc;\n calc(old_lba);\n\n}\n\n\nlong long CHS::ToLBA()\n{\n return ( ( cylinder * tpc + head ) * spt ) + sector - 1;\n}\n\n\n\n\n\n\nCHS &CHS::operator =(long long lba)\n{\nunsigned long temp;\n\ncylinder =lba \/ (tpc * spt);\ntemp     = lba % (tpc * spt);\nhead     = temp \/ spt;\nsector   = temp % spt + 1;\n\nreturn *this;\n}\n\nbool CHS::operator ==(CHS &chs)\n{\nif(this->ToLBA()==chs.ToLBA())\n    return true;\n\nreturn false;\n}\n\n\n\nCHS &CHS::operator ++()\n{\nunsigned long temp;\nlong long lba=this->ToLBA()+1;\n\ncylinder =lba \/ (tpc * spt);\ntemp     = lba % (tpc * spt);\nhead     = temp \/ spt;\nsector   = temp % spt + 1;\n\nreturn *this;\n}\n\nCHS &CHS::operator ++(int)\n{\nCHS ret=*this;\n\nunsigned long temp;\nlong long lba=this->ToLBA()+1;\n\ncylinder =lba \/ (tpc * spt);\ntemp     = lba % (tpc * spt);\nhead     = temp \/ spt;\nsector   = temp % spt + 1;\n\nreturn ret;\n}\n\n<commit_msg>Added MBR_CHS CHS::ToMbrChs() function<commit_after>#include \"chs.hpp\"\n#include \"definitions.h\"\n\nCHS::CHS()\n{\ncylinder=0,head=0,sector=0,\nspt=63,tpc=255;\n}\n\nCHS::CHS(int c,int h,int s)\n{\ncylinder=c,head=h,sector=s,\n\nspt=63,tpc=255;\n}\n\nCHS::CHS(long long lba)\n{\nspt=63,tpc=255;\ncalc(lba);\n\n}\n\n\nvoid CHS::calc(long long lba)\n{\nlong long temp;\n\ncylinder =lba \/ (tpc * spt);\ntemp     = lba % (tpc * spt);\nhead     = temp \/ spt;\nsector   = temp % spt + 1;\n\n}\n\n\nbool CHS::SetCylinder(long long cylinder)\n{\n   this->cylinder=cylinder;\n   return true;\n}\n\nbool CHS::SetHead(unsigned int head)\n{\n   if(head>tpc) return false;\n   this->head=head;\n   return true;\n}\n\nbool CHS::SetSector(unsigned int sector)\n{\n   if(head>spt) return false;\n   this->sector=sector;\n   return true;\n}\n\n\nunsigned long CHS::GetCylinder()\n{\n  return this->cylinder;\n}\nunsigned int CHS::GetHead()\n{\n  return this->head;\n}\nunsigned int CHS::GetSector()\n{\n   return this->sector;\n}\n\n\nbool CHS::SetGeometry(int spt,int tpc)\n{\n  this->spt=spt;\n  this->tpc=tpc;\nreturn true;\n}\n\nint CHS::GetSPT() { return spt; }\nint CHS::GetTPC() { return tpc; }\n\nvoid CHS::SetSPT(int spt)\n{\nlong long old_lba=ToLBA();\nthis->spt=spt;\ncalc(old_lba);\n}\nvoid CHS::SetTPC(int tpc)\n{\nlong long old_lba=ToLBA();\nthis->tpc=tpc;\n calc(old_lba);\n\n}\n\n\nlong long CHS::ToLBA()\n{\n return ( ( cylinder * tpc + head ) * spt ) + sector - 1;\n}\n\n\nMBR_CHS CHS::ToMbrChs()\n{\n  MBR_CHS chs= {0};\n\n  if(ToLBA()>=CHS_LIMIT)\n  {\n    chs.cylinder_bits=1023>>8;\n    chs.cylinder=1023&0xFF;\n\n    chs.head=254;\n    chs.sector=63;\n    return chs;\n  }\n\n  unsigned cylinder,head,sector,temp=0;\n\n  cylinder =ToLBA()\/ (tpc * spt);\n  temp     = ToLBA() % (tpc * spt);\n  head     = temp \/ spt;\n  sector   = temp % spt + 1;\n\n  chs.cylinder_bits=cylinder>>8;\n  chs.cylinder=cylinder&0xFF;\n\n  chs.head=head;\n  chs.sector=sector;\n\n  return chs;\n}\n\n\n\nCHS &CHS::operator =(long long lba)\n{\nunsigned long temp;\n\ncylinder =lba \/ (tpc * spt);\ntemp     = lba % (tpc * spt);\nhead     = temp \/ spt;\nsector   = temp % spt + 1;\n\nreturn *this;\n}\n\nbool CHS::operator ==(CHS &chs)\n{\nif(this->ToLBA()==chs.ToLBA())\n    return true;\n\nreturn false;\n}\n\n\n\nCHS &CHS::operator ++()\n{\nunsigned long temp;\nlong long lba=this->ToLBA()+1;\n\ncylinder =lba \/ (tpc * spt);\ntemp     = lba % (tpc * spt);\nhead     = temp \/ spt;\nsector   = temp % spt + 1;\n\nreturn *this;\n}\n\nCHS &CHS::operator ++(int)\n{\nCHS ret=*this;\n\nunsigned long temp;\nlong long lba=this->ToLBA()+1;\n\ncylinder =lba \/ (tpc * spt);\ntemp     = lba % (tpc * spt);\nhead     = temp \/ spt;\nsector   = temp % spt + 1;\n\nreturn ret;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* This file is part of PyMesh.\n*\n* PyMesh 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* PyMesh is distributed in the hope that it 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 Foobar.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\n*\/\n\n\n#ifndef PYMESHPLUGIN_HH\n#define PYMESHPLUGIN_HH\n\n#include <pybind11\/pybind11.h>\n#include <pybind11\/embed.h>\n#include <pybind11\/pytypes.h>\n\n#include <QObject>\n\n#include <OpenFlipper\/BasePlugin\/BaseInterface.hh>\n#include <OpenFlipper\/BasePlugin\/LoggingInterface.hh>\n#include <OpenFlipper\/BasePlugin\/ToolboxInterface.hh>\n#include <OpenFlipper\/BasePlugin\/LoadSaveInterface.hh>\n#include <OpenFlipper\/BasePlugin\/BackupInterface.hh>\n#include <OpenFlipper\/BasePlugin\/ProcessInterface.hh>\n#include <OpenFlipper\/BasePlugin\/ScriptInterface.hh>\n#include <OpenFlipper\/BasePlugin\/RPCInterface.hh>\n\n#include <ObjectTypes\/PolyMesh\/PolyMesh.hh>\n#include <ObjectTypes\/TriangleMesh\/TriangleMesh.hh>\n\n#include <vector>\n\n\n#include \"PyMeshToolbox.hh\"\n\n\nclass PyMeshPlugin : public QObject, BaseInterface, ToolboxInterface, LoadSaveInterface, LoggingInterface, BackupInterface, ProcessInterface, ScriptInterface, RPCInterface\n{\n  Q_OBJECT\n  Q_INTERFACES(BaseInterface)\n  Q_INTERFACES(ToolboxInterface)\n  Q_INTERFACES(LoadSaveInterface)\n  Q_INTERFACES(LoggingInterface)\n  Q_INTERFACES(BackupInterface)\n  Q_INTERFACES(ProcessInterface)\n  Q_INTERFACES(ScriptInterface)\n  Q_INTERFACES(RPCInterface)\n  Q_PLUGIN_METADATA(IID \"org.OpenFlipper.Plugins.Plugin-PyMesh\")\n\nQ_SIGNALS:\n\n  \/\/ Base Interface\n  void updatedObject(int _identifier, const UpdateType& _type);\n\n  \/\/ Toolbox Interface\n  void addToolbox(QString  _name, QWidget* _widget , QIcon* _icon);\n\n  \/\/ Load-Save Interface\n  void addEmptyObject(DataType _type, int& _id);\n  void deleteObject(int _id);\n\n  \/\/ Logging Interface\n  void log(Logtype _type, QString _message);\n  void log(QString _message);\n\n  \/\/ Process Interface\n  void setJobDescription(QString _jobId, QString _text);\n  void startJob(QString _jobId, QString _description, int _min, int _max, bool _blocking = false);\n  void finishJob(QString _jobId);\n\n  \/\/ Script Interface\n  void getAvailableFunctions(QStringList& _functions);\n  void getDescription(QString _function, QString& _description, QStringList& _parameters, QStringList& _descriptions);\n\n  \/\/ Backup Interface\n  void createBackup(int _objectid, QString _name, UpdateType _type = UPDATE_ALL);\n\npublic Q_SLOTS:\n\n  bool runPyScriptFile(const QString& _filename, bool _clearPrevious);\n  void runPyScriptFileAsync(const QString& _filename, bool _clearPrevious);\n\n  bool runPyScript(const QString& _script, bool _clearPrevious);\n  void runPyScriptAsync(const QString& _script, bool _clearPrevious);\n\n  void convertPropsPyToCpp(const IdList& _list);\n\n  void resetInterpreter();\n\npublic:\n\n  \/\/ Python callback functions\n  void pyOutput(const char* w);\n  void pyError(const char* w);  \n  void* createTriMesh();\n  void* createPolyMesh();\n\n\n  PyMeshPlugin();\n  ~PyMeshPlugin();\n\n  QString name(){return QString(\"PyMesh\");}\n  QString description(){return QString(\"Run OpenMesh Python Scripts and shows the resulting mesh.\");}\n\nprivate:\n\n    pybind11::module main_module_;\n    PyObject* global_dict_clean_ = nullptr; \/\/clean global dict. used for reset. do not change\n\n    PyMeshToolbox* toolbox_ = nullptr;\n    std::vector<int> createdObjects_;\n\n    QWidget* scriptingFunctionsPresenter_ = nullptr;\n\n    void initPython();\n    \/\/\/ Run Python Script. Does not update any object. save to call from another thread\n    bool runPyScript_internal(const QString& _script, bool _clearPrevious);\n    \/\/\/ Does not update all objects, save to call from another thread\n    void convertPropsPyToCpp_internal(const IdList& _list);\n\nprivate Q_SLOTS:\n\n  void initializePlugin();\n\n  void pluginsInitialized();\n\n  void slotRunScript();\n\n  void slotSelectFile();\n\n  void canceledJob(QString _job);\n\n  void runPyScriptFinished();\n\n  void noguiSupported() {};\n\n  void showScriptingFunctions();\n\npublic Q_SLOTS:\n  QString version(){ return QString(\"1.0\"); }\n};\n\n\n#endif \/\/PYMESHPLUGIN_HH\n<commit_msg>increased version number<commit_after>\/*\n* This file is part of PyMesh.\n*\n* PyMesh 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* PyMesh is distributed in the hope that it 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 Foobar.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\n*\/\n\n\n#ifndef PYMESHPLUGIN_HH\n#define PYMESHPLUGIN_HH\n\n#include <pybind11\/pybind11.h>\n#include <pybind11\/embed.h>\n#include <pybind11\/pytypes.h>\n\n#include <QObject>\n\n#include <OpenFlipper\/BasePlugin\/BaseInterface.hh>\n#include <OpenFlipper\/BasePlugin\/LoggingInterface.hh>\n#include <OpenFlipper\/BasePlugin\/ToolboxInterface.hh>\n#include <OpenFlipper\/BasePlugin\/LoadSaveInterface.hh>\n#include <OpenFlipper\/BasePlugin\/BackupInterface.hh>\n#include <OpenFlipper\/BasePlugin\/ProcessInterface.hh>\n#include <OpenFlipper\/BasePlugin\/ScriptInterface.hh>\n#include <OpenFlipper\/BasePlugin\/RPCInterface.hh>\n\n#include <ObjectTypes\/PolyMesh\/PolyMesh.hh>\n#include <ObjectTypes\/TriangleMesh\/TriangleMesh.hh>\n\n#include <vector>\n\n\n#include \"PyMeshToolbox.hh\"\n\n\nclass PyMeshPlugin : public QObject, BaseInterface, ToolboxInterface, LoadSaveInterface, LoggingInterface, BackupInterface, ProcessInterface, ScriptInterface, RPCInterface\n{\n  Q_OBJECT\n  Q_INTERFACES(BaseInterface)\n  Q_INTERFACES(ToolboxInterface)\n  Q_INTERFACES(LoadSaveInterface)\n  Q_INTERFACES(LoggingInterface)\n  Q_INTERFACES(BackupInterface)\n  Q_INTERFACES(ProcessInterface)\n  Q_INTERFACES(ScriptInterface)\n  Q_INTERFACES(RPCInterface)\n  Q_PLUGIN_METADATA(IID \"org.OpenFlipper.Plugins.Plugin-PyMesh\")\n\nQ_SIGNALS:\n\n  \/\/ Base Interface\n  void updatedObject(int _identifier, const UpdateType& _type);\n\n  \/\/ Toolbox Interface\n  void addToolbox(QString  _name, QWidget* _widget , QIcon* _icon);\n\n  \/\/ Load-Save Interface\n  void addEmptyObject(DataType _type, int& _id);\n  void deleteObject(int _id);\n\n  \/\/ Logging Interface\n  void log(Logtype _type, QString _message);\n  void log(QString _message);\n\n  \/\/ Process Interface\n  void setJobDescription(QString _jobId, QString _text);\n  void startJob(QString _jobId, QString _description, int _min, int _max, bool _blocking = false);\n  void finishJob(QString _jobId);\n\n  \/\/ Script Interface\n  void getAvailableFunctions(QStringList& _functions);\n  void getDescription(QString _function, QString& _description, QStringList& _parameters, QStringList& _descriptions);\n\n  \/\/ Backup Interface\n  void createBackup(int _objectid, QString _name, UpdateType _type = UPDATE_ALL);\n\npublic Q_SLOTS:\n\n  bool runPyScriptFile(const QString& _filename, bool _clearPrevious);\n  void runPyScriptFileAsync(const QString& _filename, bool _clearPrevious);\n\n  bool runPyScript(const QString& _script, bool _clearPrevious);\n  void runPyScriptAsync(const QString& _script, bool _clearPrevious);\n\n  void convertPropsPyToCpp(const IdList& _list);\n\n  void resetInterpreter();\n\npublic:\n\n  \/\/ Python callback functions\n  void pyOutput(const char* w);\n  void pyError(const char* w);  \n  void* createTriMesh();\n  void* createPolyMesh();\n\n\n  PyMeshPlugin();\n  ~PyMeshPlugin();\n\n  QString name(){return QString(\"PyMesh\");}\n  QString description(){return QString(\"Run OpenMesh Python Scripts and shows the resulting mesh.\");}\n\nprivate:\n\n    pybind11::module main_module_;\n    PyObject* global_dict_clean_ = nullptr; \/\/clean global dict. used for reset. do not change\n\n    PyMeshToolbox* toolbox_ = nullptr;\n    std::vector<int> createdObjects_;\n\n    QWidget* scriptingFunctionsPresenter_ = nullptr;\n\n    void initPython();\n    \/\/\/ Run Python Script. Does not update any object. save to call from another thread\n    bool runPyScript_internal(const QString& _script, bool _clearPrevious);\n    \/\/\/ Does not update all objects, save to call from another thread\n    void convertPropsPyToCpp_internal(const IdList& _list);\n\nprivate Q_SLOTS:\n\n  void initializePlugin();\n\n  void pluginsInitialized();\n\n  void slotRunScript();\n\n  void slotSelectFile();\n\n  void canceledJob(QString _job);\n\n  void runPyScriptFinished();\n\n  void noguiSupported() {};\n\n  void showScriptingFunctions();\n\npublic Q_SLOTS:\n  QString version(){ return QString(\"2.0\"); }\n};\n\n\n#endif \/\/PYMESHPLUGIN_HH\n<|endoftext|>"}
{"text":"<commit_before>#include \"Scene.h\"\n\nScene::Scene(void)\n{\n\tview_matrix = glm::lookAt(glm::vec3(0.f, 0.f, 0.f), glm::vec3(0.f, 0.f, -1.f), glm::vec3(0.f, 1.f, 0.f));\n\tmemset(&KeyStates, 0, sizeof(KeyStates));\n\tbbo = new BulletBufferObject(this, 50);\n\tthis->debug = false;\n\tthis->game = true;\n\tthis->score = 0;\n}\n\nScene::~Scene(void)\n{\n\tif (player != 0) delete player;\n\tfor (unsigned int i = 0; i < objects.size(); i++){\n\t\tif (objects[i] != 0) delete objects[i];\n\t}\n\n}\nvoid Scene::Init(GLuint *texture){\n\tthis->texture = texture;\n\n\t\/\/ Init Player\n\tthis->player = new Player(this, this->texture[0], 0.0f, 0.0f);\n\n\t\/\/ Init Objects\t\n\tAddObstacle(new Obstacle(this, this->texture[2], 15.0, 15.0, 7.00));\n\tAddObstacle(new Obstacle(this, this->texture[2], -12.0, -17.0, 9.00));\n\tAddObstacle(new Obstacle(this, this->texture[2], 12.0, -6.0, 5.00));\n\tAddObstacle(new Obstacle(this, this->texture[2], -16.0, 15.0, 6.00));\n\n\t\/\/ Init Zombies\n\tfor (unsigned int i = 0; i < ZOMBIE_AMOUNT; ++i) AddZombie(new Zombie(this, this->texture[1]));\n\n\t\/\/Init PowerUps\n\tfor (unsigned int i = 0; i < POWERUP_AMOUNT; ++i) AddPowerUp(new PowerUp(this));\n\n\tPrintPlayerData();\n\n}\n\nvoid Scene::PrintResult()\n{\n\tsystem(\"cls\");\n\tcout << \"---------- RESULT ----------\" << endl;\n\tcout << \"Score: \" << player->score << endl << endl;\n\tcout << \"Type [R] to restart game\" << endl << endl;\n}\n\nvoid Scene::PrintPlayerData()\n{\n\n}\nstring Scene::GetPlayerData()\n{\n\treturn player->GetPlayerData();\n}\n\nvoid Scene::Update(double delta_time)\n{\n\tDisplayData();\n\tif (this->game){\n\t\tCheckVictoryCondition();\n\t\tbbo->Update(delta_time);\n\t\tfor (unsigned int i = 0; i < objects.size(); i++)\n\t\t{\n\t\t\tobjects[i]->Update(delta_time);\n\t\t}\n\n\t\tif (KeyStates['w'] || KeyStates['W']) player->Move(glm::vec2(0, 0.3), delta_time);\n\t\tif (KeyStates['s'] || KeyStates['S']) player->Move(glm::vec2(0, -0.3), delta_time);\n\t\tif (KeyStates['a'] || KeyStates['A']) player->Move(glm::vec2(-0.3, 0), delta_time);\n\t\tif (KeyStates['d'] || KeyStates['D']) player->Move(glm::vec2(0.3, 0), delta_time);\n\n\t\tplayer->Update(delta_time);\n\t}\n\tif ((KeyStates['r'] || KeyStates['R']) && !game) Restart();\n\tif (KeyStates[27]) exit(0); \/\/ESC key quits the game\n}\n\nbool Scene::CheckVictoryCondition(void)\n{\n\tif(player->immortality_duration > 0)\n\t\treturn game;\n\n\tfor (unsigned int i = 0; i<zombies.size(); ++i)\n\t{\n\t\tif (GetDistance(player->GetObjectPosition(), zombies[i]->GetObjectPosition()) < 2)\n\t\t{\n\t\t\tif(player->lifes > 0)\n\t\t\t{\n\t\t\t\tplayer->Respawn();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis->game = false;\n\t\t\t\tPrintResult();\n\t\t\t}\n\t\t}\n\t}\n\n\treturn game;\n}\n\nvoid Scene::Restart(void){\n\tthis->game = true;\n\tthis->debug = true;\n\tfor (unsigned int i = 0; i < zombies.size(); i++)\n\t{\n\t\tzombies[i]->RandomPosition();\t\n\t\tzombies[i]->aggressive = false;\n\t}\n\tthis->debug = false;\n\tplayer->Reset();\n\tfor(unsigned int i = 0; i < powerups.size(); i++)\n\t{\n\t\tpowerups[i]->Respawn();\n\t}\n\tPrintPlayerData();\n}\n\nstring NumberWithSpaces(int n, int m)\n{\n\tstringstream ss;\n\tss << n;\n\n\tstring s = ss.str();\n\n\twhile(s.size() < m)\n\t\ts = \" \" + s;\n\n\treturn s;\n}\n\nvoid Scene::Draw(void)\n{\n\tplayer->Draw();\n\tbbo->Draw();\n\tfor(unsigned int i = 0; i < objects.size(); i++)\n\t{\n\t\tobjects[i]->Draw();\n\t}\n\t\n\tstring rail_info = (player->current_weapon == Player::WEAPON_TYPE::RAIL ? \"-> \" : \"   \");\n\trail_info += \"Railgun     [\" + NumberWithSpaces(player->rail_lvl, 1) +  \"] [\" + NumberWithSpaces(player->rail_ammo, 4) + \"]\";\n\n\tif(player->current_weapon == Player::WEAPON_TYPE::RAIL)\n\t\tglColor3f(1.0f, 1.0f, 1.0f);\n\telse\n\t\tglColor3f(0.2f, 0.2f, 1.0f);\n\tglRasterPos2f(0.35f, -0.94f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)rail_info.c_str());\n\n\tstring machine_info = (player->current_weapon == Player::WEAPON_TYPE::MACHINE ? \"-> \" : \"   \");\n\tmachine_info += \"Machine gun [\" + NumberWithSpaces(player->machine_lvl, 1) +  \"] [\" + NumberWithSpaces(player->machine_ammo, 4) + \"]\";\n\n\tif(player->current_weapon == Player::WEAPON_TYPE::MACHINE)\n\t\tglColor3f(1.0f, 1.0f, 1.0f);\n\telse\n\t\tglColor3f(0.2f, 0.2f, 1.0f);\n\tglRasterPos2f(0.35f, -0.98f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)machine_info.c_str());\n\n\tstring lifes_info = \"Lifes: \" + NumberWithSpaces(player->lifes, 3);\n\tglColor3f(1.0f, 0.1f, 0.1f);\n\tglRasterPos2f(-0.99f, -0.90f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)lifes_info.c_str());\n\n\tstring score_info = \"Score: \" + NumberWithSpaces(player->score, 3);\n\tglColor3f(0.3f, 0.8f, 0.8f);\n\tglRasterPos2f(-0.99f, -0.94f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)score_info.c_str());\n\n\tstring cash_info = \"Cash:  \" + NumberWithSpaces(player->cash, 3);\n\tglColor3f(0.2f, 1.0f, 0.2f);\n\tglRasterPos2f(-0.99f, -0.98f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)cash_info.c_str());\n\n\tstring info = \"Press [q] to switch weapon\";\n\tglColor3f(0.5f, 0.5f, 0.5f);\n\tglRasterPos2f(0.30f, 0.96f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)info.c_str());\n\n\tinfo = \"Press [e] to upgrade weapon\";\n\tglColor3f(0.5f, 0.5f, 0.5f);\n\tglRasterPos2f(0.30f, 0.92f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)info.c_str());\n}\n\nvoid Scene::PlayerRotate(glm::vec2 heading)\n{\n\tplayer->Rotate(heading);\n\t\n}\n\nvoid Scene::PlayerShoot(glm::vec2 aim)\n{\n\tplayer->Shoot(aim);\n}\n\nvoid Scene::KeyState(unsigned char key, bool tf)\n{\n\tKeyStates[key] = tf;\n\n\tif(key == 'q' && tf)\n\t{\n\t\tif(player->current_weapon == Player::WEAPON_TYPE::RAIL)\n\t\t\tplayer->current_weapon = Player::WEAPON_TYPE::MACHINE;\n\t\telse\n\t\t\tplayer->current_weapon = Player::WEAPON_TYPE::RAIL;\n\n\t\tPrintPlayerData();\n\t}\n\telse if(key == 'e' && tf)\n\t{\n\t\tif(player->current_weapon == Player::WEAPON_TYPE::MACHINE)\n\t\t\tplayer->UpgradeWeapon(Player::WEAPON_TYPE::MACHINE);\n\t\telse\n\t\t\tplayer->UpgradeWeapon(Player::WEAPON_TYPE::RAIL);\n\t}\n}\n\nvoid Scene::AddObject(GameEntity *entity)\n{\n\tobjects.push_back(entity);\n}\nvoid Scene::AddZombie(Zombie *entity)\n{\n\tzombies.push_back(entity);\n\tobjects.push_back(entity);\n}\nvoid Scene::AddObstacle(Obstacle *entity)\n{\n\tobstacles.push_back(entity);\n\tobjects.push_back(entity);\n}\n\nvoid Scene::AddPowerUp(PowerUp *entity)\n{\n\tpowerups.push_back(entity);\n\tobjects.push_back(entity);\n}\n\nostream& operator<<(ostream &o, const Scene &gw)\n{\n\to << \"---------------- SCENE ---------------\" << \"\\n\";\n\n\to << \"--------------------------------------\" << endl;\n\treturn o;\n}\n\nvoid Scene::DisplayData()\n{\n\tstring str;\n\tstringstream ss;\n\n\tss << \"Lifes: \" << player->lifes << endl;\n\tstr = \"\";\n\tss >> str;\n\n\t\/\/glRasterPos2i(0, 0);\n\t\/\/glColor3f(1, 0, 0);\n\t\/\/glutBitmapString(GLUT_BITMAP_TIMES_ROMAN_24, (const unsigned char*)\"Dzialaj\");\n\n\n\n\n}\n<commit_msg>Instruction for Quitting the game<commit_after>#include \"Scene.h\"\n\nScene::Scene(void)\n{\n\tview_matrix = glm::lookAt(glm::vec3(0.f, 0.f, 0.f), glm::vec3(0.f, 0.f, -1.f), glm::vec3(0.f, 1.f, 0.f));\n\tmemset(&KeyStates, 0, sizeof(KeyStates));\n\tbbo = new BulletBufferObject(this, 50);\n\tthis->debug = false;\n\tthis->game = true;\n\tthis->score = 0;\n}\n\nScene::~Scene(void)\n{\n\tif (player != 0) delete player;\n\tfor (unsigned int i = 0; i < objects.size(); i++){\n\t\tif (objects[i] != 0) delete objects[i];\n\t}\n\n}\nvoid Scene::Init(GLuint *texture){\n\tthis->texture = texture;\n\n\t\/\/ Init Player\n\tthis->player = new Player(this, this->texture[0], 0.0f, 0.0f);\n\n\t\/\/ Init Objects\t\n\tAddObstacle(new Obstacle(this, this->texture[2], 15.0, 15.0, 7.00));\n\tAddObstacle(new Obstacle(this, this->texture[2], -12.0, -17.0, 9.00));\n\tAddObstacle(new Obstacle(this, this->texture[2], 12.0, -6.0, 5.00));\n\tAddObstacle(new Obstacle(this, this->texture[2], -16.0, 15.0, 6.00));\n\n\t\/\/ Init Zombies\n\tfor (unsigned int i = 0; i < ZOMBIE_AMOUNT; ++i) AddZombie(new Zombie(this, this->texture[1]));\n\n\t\/\/Init PowerUps\n\tfor (unsigned int i = 0; i < POWERUP_AMOUNT; ++i) AddPowerUp(new PowerUp(this));\n\n\tPrintPlayerData();\n\n}\n\nvoid Scene::PrintResult()\n{\n\tsystem(\"cls\");\n\tcout << \"---------- RESULT ----------\" << endl;\n\tcout << \"Score: \" << player->score << endl << endl;\n\tcout << \"Type [R] to restart game\" << endl << endl;\n}\n\nvoid Scene::PrintPlayerData()\n{\n\n}\nstring Scene::GetPlayerData()\n{\n\treturn player->GetPlayerData();\n}\n\nvoid Scene::Update(double delta_time)\n{\n\tDisplayData();\n\tif (this->game){\n\t\tCheckVictoryCondition();\n\t\tbbo->Update(delta_time);\n\t\tfor (unsigned int i = 0; i < objects.size(); i++)\n\t\t{\n\t\t\tobjects[i]->Update(delta_time);\n\t\t}\n\n\t\tif (KeyStates['w'] || KeyStates['W']) player->Move(glm::vec2(0, 0.3), delta_time);\n\t\tif (KeyStates['s'] || KeyStates['S']) player->Move(glm::vec2(0, -0.3), delta_time);\n\t\tif (KeyStates['a'] || KeyStates['A']) player->Move(glm::vec2(-0.3, 0), delta_time);\n\t\tif (KeyStates['d'] || KeyStates['D']) player->Move(glm::vec2(0.3, 0), delta_time);\n\n\t\tplayer->Update(delta_time);\n\t}\n\tif ((KeyStates['r'] || KeyStates['R']) && !game) Restart();\n\tif (KeyStates[27]) exit(0); \/\/ESC key quits the game\n}\n\nbool Scene::CheckVictoryCondition(void)\n{\n\tif(player->immortality_duration > 0)\n\t\treturn game;\n\n\tfor (unsigned int i = 0; i<zombies.size(); ++i)\n\t{\n\t\tif (GetDistance(player->GetObjectPosition(), zombies[i]->GetObjectPosition()) < 2)\n\t\t{\n\t\t\tif(player->lifes > 0)\n\t\t\t{\n\t\t\t\tplayer->Respawn();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis->game = false;\n\t\t\t\tPrintResult();\n\t\t\t}\n\t\t}\n\t}\n\n\treturn game;\n}\n\nvoid Scene::Restart(void){\n\tthis->game = true;\n\tthis->debug = true;\n\tfor (unsigned int i = 0; i < zombies.size(); i++)\n\t{\n\t\tzombies[i]->RandomPosition();\t\n\t\tzombies[i]->aggressive = false;\n\t}\n\tthis->debug = false;\n\tplayer->Reset();\n\tfor(unsigned int i = 0; i < powerups.size(); i++)\n\t{\n\t\tpowerups[i]->Respawn();\n\t}\n\tPrintPlayerData();\n}\n\nstring NumberWithSpaces(int n, int m)\n{\n\tstringstream ss;\n\tss << n;\n\n\tstring s = ss.str();\n\n\twhile(s.size() < m)\n\t\ts = \" \" + s;\n\n\treturn s;\n}\n\nvoid Scene::Draw(void)\n{\n\tplayer->Draw();\n\tbbo->Draw();\n\tfor(unsigned int i = 0; i < objects.size(); i++)\n\t{\n\t\tobjects[i]->Draw();\n\t}\n\t\n\tstring rail_info = (player->current_weapon == Player::WEAPON_TYPE::RAIL ? \"-> \" : \"   \");\n\trail_info += \"Railgun     [\" + NumberWithSpaces(player->rail_lvl, 1) +  \"] [\" + NumberWithSpaces(player->rail_ammo, 4) + \"]\";\n\n\tif(player->current_weapon == Player::WEAPON_TYPE::RAIL)\n\t\tglColor3f(1.0f, 1.0f, 1.0f);\n\telse\n\t\tglColor3f(0.2f, 0.2f, 1.0f);\n\tglRasterPos2f(0.35f, -0.94f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)rail_info.c_str());\n\n\tstring machine_info = (player->current_weapon == Player::WEAPON_TYPE::MACHINE ? \"-> \" : \"   \");\n\tmachine_info += \"Machine gun [\" + NumberWithSpaces(player->machine_lvl, 1) +  \"] [\" + NumberWithSpaces(player->machine_ammo, 4) + \"]\";\n\n\tif(player->current_weapon == Player::WEAPON_TYPE::MACHINE)\n\t\tglColor3f(1.0f, 1.0f, 1.0f);\n\telse\n\t\tglColor3f(0.2f, 0.2f, 1.0f);\n\tglRasterPos2f(0.35f, -0.98f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)machine_info.c_str());\n\n\tstring lifes_info = \"Lifes: \" + NumberWithSpaces(player->lifes, 3);\n\tglColor3f(1.0f, 0.1f, 0.1f);\n\tglRasterPos2f(-0.99f, -0.90f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)lifes_info.c_str());\n\n\tstring score_info = \"Score: \" + NumberWithSpaces(player->score, 3);\n\tglColor3f(0.3f, 0.8f, 0.8f);\n\tglRasterPos2f(-0.99f, -0.94f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)score_info.c_str());\n\n\tstring cash_info = \"Cash:  \" + NumberWithSpaces(player->cash, 3);\n\tglColor3f(0.2f, 1.0f, 0.2f);\n\tglRasterPos2f(-0.99f, -0.98f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)cash_info.c_str());\n\n\tstring info = \"Press [ESC] to quit\";\n\tglColor3f(0.5f, 0.5f, 0.5f);\n\tglRasterPos2f(-0.95f, 0.96f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)info.c_str());\n\n\tinfo = \"Press [q] to switch weapon\";\n\tglColor3f(0.5f, 0.5f, 0.5f);\n\tglRasterPos2f(0.30f, 0.96f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)info.c_str());\n\n\tinfo = \"Press [e] to upgrade weapon\";\n\tglColor3f(0.5f, 0.5f, 0.5f);\n\tglRasterPos2f(0.30f, 0.92f);\n\tglutBitmapString(GLUT_BITMAP_9_BY_15, (const unsigned char*)info.c_str());\n}\n\nvoid Scene::PlayerRotate(glm::vec2 heading)\n{\n\tplayer->Rotate(heading);\n\t\n}\n\nvoid Scene::PlayerShoot(glm::vec2 aim)\n{\n\tplayer->Shoot(aim);\n}\n\nvoid Scene::KeyState(unsigned char key, bool tf)\n{\n\tKeyStates[key] = tf;\n\n\tif(key == 'q' && tf)\n\t{\n\t\tif(player->current_weapon == Player::WEAPON_TYPE::RAIL)\n\t\t\tplayer->current_weapon = Player::WEAPON_TYPE::MACHINE;\n\t\telse\n\t\t\tplayer->current_weapon = Player::WEAPON_TYPE::RAIL;\n\n\t\tPrintPlayerData();\n\t}\n\telse if(key == 'e' && tf)\n\t{\n\t\tif(player->current_weapon == Player::WEAPON_TYPE::MACHINE)\n\t\t\tplayer->UpgradeWeapon(Player::WEAPON_TYPE::MACHINE);\n\t\telse\n\t\t\tplayer->UpgradeWeapon(Player::WEAPON_TYPE::RAIL);\n\t}\n}\n\nvoid Scene::AddObject(GameEntity *entity)\n{\n\tobjects.push_back(entity);\n}\nvoid Scene::AddZombie(Zombie *entity)\n{\n\tzombies.push_back(entity);\n\tobjects.push_back(entity);\n}\nvoid Scene::AddObstacle(Obstacle *entity)\n{\n\tobstacles.push_back(entity);\n\tobjects.push_back(entity);\n}\n\nvoid Scene::AddPowerUp(PowerUp *entity)\n{\n\tpowerups.push_back(entity);\n\tobjects.push_back(entity);\n}\n\nostream& operator<<(ostream &o, const Scene &gw)\n{\n\to << \"---------------- SCENE ---------------\" << \"\\n\";\n\n\to << \"--------------------------------------\" << endl;\n\treturn o;\n}\n\nvoid Scene::DisplayData()\n{\n\tstring str;\n\tstringstream ss;\n\n\tss << \"Lifes: \" << player->lifes << endl;\n\tstr = \"\";\n\tss >> str;\n\n\t\/\/glRasterPos2i(0, 0);\n\t\/\/glColor3f(1, 0, 0);\n\t\/\/glutBitmapString(GLUT_BITMAP_TIMES_ROMAN_24, (const unsigned char*)\"Dzialaj\");\n\n\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n \nProgram:   Medical Imaging & Interaction Toolkit\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 \"mitkManualSegmentationToSurfaceFilter.h\"\n#include <itksys\/SystemTools.hxx>\n#include \"mitkDataTreeNodeFactory.h\"\n#include <mitkSurfaceVtkWriter.h>\n#include <vtkSTLWriter.h>\n\n#include <fstream>\n\/**\n* Test class for ManualSegmentationToSurfaceFilter and ImageToSurface\n* 1. Read an image\n* 2. Create a surface\n* 3. Create a Surface with all image processing facillities\n*\/\nint mitkManualSegmentationToSurfaceFilterTest(int argc, char* argv[])\n{\n  \n  if(argc==0)\n  {\n    std::cout<<\"no file specified [FAILED]\"<<std::endl;\n    return EXIT_FAILURE;\n  }\n  \n  std::string path = argv[1];\n  itksys::SystemTools::ConvertToUnixSlashes(path);\n  std::string fileIn = path;\n  std::string fileOut = \"BallBinary30x30x30.stl\";\n\n  \n  fileIn = itksys::SystemTools::ConvertToOutputPath(fileIn.c_str());\n  fileOut = itksys::SystemTools::ConvertToOutputPath(fileOut.c_str());\n  std::cout<<\"Eingabe Datei: \"<<fileIn<<std::endl;\n  std::cout<<\"Ausgabe Datei: \"<<fileOut<<std::endl;\n  mitk::Image::Pointer image = NULL;\n  mitk::DataTreeNodeFactory::Pointer factory = mitk::DataTreeNodeFactory::New();\n  try\n  {\n    std::cout << \"Loading file: \"<<std::flush;\n    factory->SetFileName( fileIn.c_str() );\n    factory->Update();\n\n    if(factory->GetNumberOfOutputs()<1)\n    {\n      std::cout<<\"file could not be loaded [FAILED]\"<<std::endl;\n      return EXIT_FAILURE;\n    }\n    mitk::DataTreeNode::Pointer node = factory->GetOutput( 0 );\n    image = dynamic_cast<mitk::Image*>(node->GetData());\n    if(image.IsNull())\n    {\n      std::cout<<\"file not an image - test will not be applied [PASSED]\"<<std::endl;\n      std::cout<<\"[TEST DONE]\"<<std::endl;\n      return EXIT_SUCCESS;\n    }\n  }\n  catch ( itk::ExceptionObject & ex )\n  {\n    std::cout << \"Exception: \" << ex << \"[FAILED]\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n\n  mitk::ManualSegmentationToSurfaceFilter::Pointer filter;\n  std::cout << \"Instantiat mitk::ManualSegmentationToSurfaceFilter - implicit: mitk::ImageToSurface: \";\n  filter = mitk::ManualSegmentationToSurfaceFilter::New();\n\n  if (filter.IsNull())\n  {\n    std::cout<<\"[FAILED]\"<<std::endl;\n    return EXIT_FAILURE;\n  }\n  else {\n  std::cout<<\"[PASSED]\"<<std::endl;\n  }\n\n\n  \/\/Wirter instance\n  mitk::SurfaceVtkWriter<vtkSTLWriter>::Pointer writer = mitk::SurfaceVtkWriter<vtkSTLWriter>::New();\n  if (filter.IsNull())\n  {\n    std::cout<<\"Instantiat SurfaceVtkWirter: [FAILED]\"<<std::endl;\n    return EXIT_FAILURE;\n  }\n  else {  \n    writer->GlobalWarningDisplayOn();\n    writer->SetFileName(fileOut.c_str());\n    writer->GetVtkWriter()->SetFileTypeToBinary();  \n   \n  }\n  \n  std::cout << \"Create surface with default settings: \";\n  if (image->GetDimension()==3)\n  {\n    filter->SetInput(image);\n    filter->Update();\n    writer->SetInput(filter->GetOutput());\n    writer->Write();\n\n    if( writer->GetNumberOfInputs() < 1 )\n    {\n      std::cout<<\"[FAILED]\"<<std::endl;\n      writer->Delete();\n      return EXIT_FAILURE;\n    }\n    else\n    {\n      std::cout<<\"[PASSED]\"<<std::endl;\n    }\n\n    std::cout << \"Create surface all optimised settings: \";\n    \/\/configure ImageToSurfaceFilter\n    filter->MedianFilter3DOn();\n    filter->SetGaussianStandardDeviation(1.5);\n    filter->InterpolationOn();\n    filter->UseGaussianImageSmoothOn();\n    filter->SetThreshold( 1 ); \/\/if( Gauss ) --> TH manipulated for vtkMarchingCube\n    filter->SetDecimate( mitk::ImageToSurfaceFilter::DecimatePro );\n    filter->SetTargetReduction(0.05f);\n    filter->SmoothOn();\n\n    \/\/filter->Update();\n    writer->SetInput( filter->GetOutput() );\n    if( writer->GetNumberOfInputs() < 1 )\n    {\n      std::cout<<\"[FAILED]\"<<std::endl;\n      return EXIT_FAILURE;\n    }\n    else\n    {\n      std::cout<<\"[PASSED]\"<<std::endl;\n      writer->Write();\n    }\n  }\n  else\n  {\n    std::cout<<\"Image not suitable for filter: Dimension!=3\"<<std::endl;\n  }\n\n  std::cout<<\"[TEST DONE]\"<<std::endl;\n  return EXIT_SUCCESS;\n}\n\n\n\n<commit_msg>COMP: exception handling for writing<commit_after>\/*=========================================================================\n \nProgram:   Medical Imaging & Interaction Toolkit\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 \"mitkManualSegmentationToSurfaceFilter.h\"\n#include <itksys\/SystemTools.hxx>\n#include \"mitkDataTreeNodeFactory.h\"\n#include <mitkSurfaceVtkWriter.h>\n#include <vtkSTLWriter.h>\n\n#include <fstream>\n\/**\n* Test class for ManualSegmentationToSurfaceFilter and ImageToSurface\n* 1. Read an image\n* 2. Create a surface\n* 3. Create a Surface with all image processing facillities\n*\/\nint mitkManualSegmentationToSurfaceFilterTest(int argc, char* argv[])\n{\n  \n  if(argc==0)\n  {\n    std::cout<<\"no file specified [FAILED]\"<<std::endl;\n    return EXIT_FAILURE;\n  }\n  \n  std::string path = argv[1];\n  itksys::SystemTools::ConvertToUnixSlashes(path);\n  std::string fileIn = path;\n  std::string fileOut = \"BallBinary30x30x30.stl\";\n\n  \n  fileIn = itksys::SystemTools::ConvertToOutputPath(fileIn.c_str());\n  fileOut = itksys::SystemTools::ConvertToOutputPath(fileOut.c_str());\n  std::cout<<\"Eingabe Datei: \"<<fileIn<<std::endl;\n  std::cout<<\"Ausgabe Datei: \"<<fileOut<<std::endl;\n  mitk::Image::Pointer image = NULL;\n  mitk::DataTreeNodeFactory::Pointer factory = mitk::DataTreeNodeFactory::New();\n  try\n  {\n    std::cout << \"Loading file: \"<<std::flush;\n    factory->SetFileName( fileIn.c_str() );\n    factory->Update();\n\n    if(factory->GetNumberOfOutputs()<1)\n    {\n      std::cout<<\"file could not be loaded [FAILED]\"<<std::endl;\n      return EXIT_FAILURE;\n    }\n    mitk::DataTreeNode::Pointer node = factory->GetOutput( 0 );\n    image = dynamic_cast<mitk::Image*>(node->GetData());\n    if(image.IsNull())\n    {\n      std::cout<<\"file not an image - test will not be applied [PASSED]\"<<std::endl;\n      std::cout<<\"[TEST DONE]\"<<std::endl;\n      return EXIT_SUCCESS;\n    }\n  }\n  catch ( itk::ExceptionObject & ex )\n  {\n    std::cout << \"Exception: \" << ex << \"[FAILED]\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n\n  mitk::ManualSegmentationToSurfaceFilter::Pointer filter;\n  std::cout << \"Instantiat mitk::ManualSegmentationToSurfaceFilter - implicit: mitk::ImageToSurface: \";\n  filter = mitk::ManualSegmentationToSurfaceFilter::New();\n\n  if (filter.IsNull())\n  {\n    std::cout<<\"[FAILED]\"<<std::endl;\n    return EXIT_FAILURE;\n  }\n  else {\n  std::cout<<\"[PASSED]\"<<std::endl;\n  }\n\n\n  \/\/Wirter instance\n  mitk::SurfaceVtkWriter<vtkSTLWriter>::Pointer writer = mitk::SurfaceVtkWriter<vtkSTLWriter>::New();\n  if (filter.IsNull())\n  {\n    std::cout<<\"Instantiat SurfaceVtkWirter: [FAILED]\"<<std::endl;\n    return EXIT_FAILURE;\n  }\n  else {  \n    writer->GlobalWarningDisplayOn();\n    writer->SetFileName(fileOut.c_str());\n    writer->GetVtkWriter()->SetFileTypeToBinary();  \n   \n  }\n  \n  std::cout << \"Create surface with default settings: \";\n  if (image->GetDimension()==3)\n  {\n    filter->SetInput(image);\n    filter->Update();\n    writer->SetInput(filter->GetOutput());\n    writer->Write();\n\n    if( writer->GetNumberOfInputs() < 1 )\n    {\n      std::cout<<\"[FAILED]\"<<std::endl;\n      writer->Delete();\n      return EXIT_FAILURE;\n    }\n    else\n    {\n      std::cout<<\"[PASSED]\"<<std::endl;\n    }\n\n    std::cout << \"Create surface all optimised settings: \";\n    \/\/configure ImageToSurfaceFilter\n    filter->MedianFilter3DOn();\n    filter->SetGaussianStandardDeviation(1.5);\n    filter->InterpolationOn();\n    filter->UseGaussianImageSmoothOn();\n    filter->SetThreshold( 1 ); \/\/if( Gauss ) --> TH manipulated for vtkMarchingCube\n    filter->SetDecimate( mitk::ImageToSurfaceFilter::DecimatePro );\n    filter->SetTargetReduction(0.05f);\n    filter->SmoothOn();\n\n    \/\/filter->Update();\n    writer->SetInput( filter->GetOutput() );\n    if( writer->GetNumberOfInputs() < 1 )\n    {\n      std::cout<<\"[FAILED]\"<<std::endl;\n      return EXIT_FAILURE;\n    }\n    else\n    {\n      std::cout<<\"[PASSED]\"<<std::endl;\n      try {\n        writer->Write();\n      }\n      catch( itk::ExceptionObject e)\n      {\n        std::cout<<\"caught exception: \"<<e<<std::endl;\n      }\n    }\n  }\n  else\n  {\n    std::cout<<\"Image not suitable for filter: Dimension!=3\"<<std::endl;\n  }\n\n  std::cout<<\"[TEST DONE]\"<<std::endl;\n  return EXIT_SUCCESS;\n}\n\n\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\/Games\/Game.hpp>\n#include <Rosetta\/Tasks\/SimpleTasks\/DamageTask.hpp>\n\nusing namespace RosettaStone;\nusing namespace SimpleTasks;\nusing namespace TestUtils;\n\nTEST(DamageTask, GetTaskID)\n{\n    const DamageTask damage(EntityType::ENEMIES, 2);\n    EXPECT_EQ(damage.GetTaskID(), +TaskID::DAMAGE);\n}\n\nTEST(DamageTask, Run)\n{\n    GameConfig config;\n    config.startPlayer = PlayerType::PLAYER1;\n    Game game(config);\n\n    Player& player1 = game.GetPlayer1();\n\n    std::vector<Card> cards;\n    cards.reserve(5);\n\n    const std::string name = \"test\";\n    for (std::size_t i = 0; i < 5; ++i)\n    {\n        const auto id = static_cast<char>(i + 0x30);\n        cards.emplace_back(GenerateMinionCard(name + id, 1, 1));\n        PlayMinionCard(player1, cards[i]);\n    }\n\n    DamageTask damage(EntityType::FRIENDS, 1);\n    TaskStatus result = damage.Run(player1);\n\n    EXPECT_EQ(result, TaskStatus::COMPLETE);\n    EXPECT_EQ(player1.GetField().GetNumOfMinions(), 0u);\n}\n<commit_msg>test: Add code to test spell power<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\/Tasks\/PlayerTasks\/PlayCardTask.hpp>\n#include <Rosetta\/Tasks\/SimpleTasks\/DamageTask.hpp>\n\nusing namespace RosettaStone;\nusing namespace SimpleTasks;\nusing namespace TestUtils;\n\nTEST(DamageTask, GetTaskID)\n{\n    const DamageTask damage(EntityType::ENEMIES, 2);\n    EXPECT_EQ(damage.GetTaskID(), +TaskID::DAMAGE);\n}\n\nTEST(DamageTask, Run)\n{\n    GameConfig config;\n    config.startPlayer = PlayerType::PLAYER1;\n    Game game(config);\n\n    Player& player1 = game.GetPlayer1();\n\n    std::vector<Card> cards;\n    cards.reserve(5);\n\n    const std::string name = \"test\";\n    for (std::size_t i = 0; i < 5; ++i)\n    {\n        const auto id = static_cast<char>(i + 0x30);\n        cards.emplace_back(GenerateMinionCard(name + id, 1, 1));\n        PlayMinionCard(player1, cards[i]);\n    }\n\n    DamageTask damage(EntityType::FRIENDS, 1);\n    TaskStatus result = damage.Run(player1);\n\n    EXPECT_EQ(result, TaskStatus::COMPLETE);\n    EXPECT_EQ(player1.GetField().GetNumOfMinions(), 0u);\n}\n\nTEST(DamageTask, SpellPower)\n{\n    GameConfig config;\n    config.startPlayer = PlayerType::PLAYER1;\n    Game game(config);\n\n    Player& player1 = game.GetPlayer1();\n\n    std::vector<Card> cards;\n    cards.reserve(5);\n\n    const std::string name = \"test\";\n    for (std::size_t i = 0; i < 5; ++i)\n    {\n        const auto id = static_cast<char>(i + 0x30);\n        cards.emplace_back(GenerateMinionCard(name + id, 1, 5));\n        PlayMinionCard(player1, cards[i]);\n    }\n\n    DamageTask damage1(EntityType::FRIENDS, 1, true);\n    damage1.SetSource(player1.GetField().GetMinion(0));\n    TaskStatus result = damage1.Run(player1);\n\n    EXPECT_EQ(result, TaskStatus::COMPLETE);\n    for (std::size_t i = 0; i < 5; ++i)\n    {\n        EXPECT_EQ(player1.GetField().GetMinion(i)->health, 4);\n    }\n\n    player1.currentSpellPower = 1;\n\n    DamageTask damage2(EntityType::FRIENDS, 1, true);\n    damage2.SetSource(player1.GetField().GetMinion(0));\n    result = damage2.Run(player1);\n\n    EXPECT_EQ(result, TaskStatus::COMPLETE);\n    for (std::size_t i = 0; i < 5; ++i)\n    {\n        EXPECT_EQ(player1.GetField().GetMinion(i)->health, 2);\n    }\n}<|endoftext|>"}
{"text":"<commit_before>#include <ros\/ros.h>\n#include <std_msgs\/String.h>\n#include <string>\n#include \"serialDriver.c\"\n#include <sstream>      \/\/ std::stringstream\n\nclass serialListener{\n\tpublic:\n\tros::NodeHandle handle;\n\tros::Publisher arduino;\n\tstd_msgs::String serialmsg;\n\tstd::stringstream read;\n\n\tint checklastln(const char* toCheck , int maxLength){\n\t\tfor(int i=0;i<maxLength;i++){\n\t\t\tif(toCheck[i]==10){\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tif(toCheck[i]==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\tint validatemsg(std::string msg){\n\t\tROS_INFO(\"SerialListener: validatemsg: %c\", msg[0]);\n\t\tif(msg[0]=='c'||msg[0]=='w'){\n\t\t\treturn 1;\n\t\t}\n\t\tROS_INFO(\"SerialListener: Invalid message received\");\n\t\treturn 0;\n\t}\n\n\tvoid writeSerial(std::string shit){\n\t\tROS_INFO(\"SerialListener: Writing to serial line\");\n\t\tstd::stringstream sysCall;\n\t        sysCall<<\"\/home\/ubuntu\/robotica-minor-5\/com\/arduino-serial\/arduino-serial --port=\/dev\/ttyACM0 --send=\"<<shit; \t\n\t\tstd::string temp= sysCall.str();\n\t\tROS_INFO(\"serialListener: syscall: %s\", temp.c_str());\n\t\tsystem(temp.c_str());\n\t}\n\n\tvoid poll(){\n\t\tROS_INFO(\"polling\");\n\t\tread<<(char*)readline();\n\n\t\tif(read.str()[0]!=0&&read.str()[0]!=10){\n\t\t\tserialmsg.data=read.str();\n\t\t\tROS_INFO(\"SerialListener:received data: %s\" , read.str().c_str());\n\t\t\tif(checklastln(read.str().c_str(),255)){\n\t\t\t\tif(validatemsg(read.str())){\t\n\t\t\t\t\twriteSerial(\"conf\");\t\t\t\t\n\t\t\t\t\tarduino.publish(serialmsg);\n\t\t\t\t\tread.str(\"\");\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tserialListener():handle(\"~\"){\n\t\tarduino=handle.advertise<std_msgs::String>(\"\/tawi\/arduino\/serial\",100);\n\t}\n};\n\n\nint main (int argc, char **argv){\n\tros::init(argc, argv, \"serialListener\");\n\tserialListener serial;\n\tros::Rate hz(5);\n\twhile(ros::ok()){\n\t\tserial.poll();\n\t\tros::spinOnce();\t\n\t\thz.sleep();\n\t}\n}\n<commit_msg>Trying to clarify serialListener.poll<commit_after>#include <ros\/ros.h>\n#include <std_msgs\/String.h>\n#include <string>\n#include \"serialDriver.c\"\n#include <sstream>      \/\/ std::stringstream\n\nclass serialListener{\n\tpublic:\n\tros::NodeHandle handle;\n\tros::Publisher arduino;\n\tstd_msgs::String serialmsg;\n\tstd::stringstream read;\n\n\tint checklastln(const char* toCheck , int maxLength){\n\t\tfor(int i=0;i<maxLength;i++){\n\t\t\tif(toCheck[i]==10){\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tif(toCheck[i]==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\tint validatemsg(std::string msg){\n\t\tROS_INFO(\"SerialListener: validatemsg: %c\", msg[0]);\n\t\tif(msg[0]=='c'||msg[0]=='w'){\n\t\t\treturn 1;\n\t\t}\n\t\tROS_INFO(\"SerialListener: Invalid message received\");\n\t\treturn 0;\n\t}\n\n\tvoid writeSerial(std::string shit){\n\t\tROS_INFO(\"SerialListener: Writing to serial line\");\n\t\tstd::stringstream sysCall;\n\t        sysCall<<\"\/home\/ubuntu\/robotica-minor-5\/com\/arduino-serial\/arduino-serial --port=\/dev\/ttyACM0 --send=\"<<shit; \t\n\t\tstd::string temp= sysCall.str();\n\t\tROS_INFO(\"serialListener: syscall: %s\", temp.c_str());\n\t\tsystem(temp.c_str());\n\t}\n\n\tvoid poll(){\n\t\tread<<(char*)readline();\n\t\tROS_INFO(\"SerialListener: poll: Read some line\");\n\t\tif(read.str()[0]!=0&&read.str()[0]!=10){ \/\/what is even going on here\n\t\t\tROS_INFO(\"SerialListener: poll: weird ass if statement fullfilled\")\n\t\t\tserialmsg.data=read.str();\n\t\t\tROS_INFO(\"SerialListener:received data: %s\" , read.str().c_str());\n\t\t\tif(checklastln(read.str().c_str(),255)){\n\t\t\t\tif(validatemsg(read.str())){\t\n\t\t\t\t\twriteSerial(\"conf\");\t\t\t\t\n\t\t\t\t\tarduino.publish(serialmsg);\n\t\t\t\t\tread.str(\"\");\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tserialListener():handle(\"~\"){\n\t\tarduino=handle.advertise<std_msgs::String>(\"\/tawi\/arduino\/serial\",100);\n\t}\n};\n\n\nint main (int argc, char **argv){\n\tros::init(argc, argv, \"serialListener\");\n\tserialListener serial;\n\tros::Rate hz(5);\n\twhile(ros::ok()){\n\t\tserial.poll();\n\t\tros::spinOnce();\t\n\t\thz.sleep();\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"mitkImageBackground2D.h\"\n\/\/ MITK includes\n#include \"mitkVtkLayerController.h\"\n#include \"mitkVtkRenderWindow.h\"\n#include \"mitkRenderWindow.h\"\n\n\/\/ VTK includes\n#include \"vtkSystemIncludes.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkMapper.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkImageActor.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkImageImport.h\"\n#include \"vtkCommand.h\"\n#include \"vtkCamera.h\"\n\n#include <iostream>\n\n\/\/ VTK CALLBACK for automatic resize of the video\nclass vtkVideoSizeCallback : public vtkCommand\n{\npublic:\n  static vtkVideoSizeCallback *New(){ return new vtkVideoSizeCallback; }\n  \n  vtkRenderer * m_ImageRenderer;\n  int m_ImageWidth, m_ImageHeight;\n\n  void SetVtkVideoRenderer(vtkRenderer* r)\n  {\n    m_ImageRenderer = r;\n  }\n  void SetVideoDimensions(int x, int y)\n  {\n    m_ImageWidth = x; m_ImageHeight = y;\n  }\n\n  virtual void Execute(vtkObject* \/*caller*\/, unsigned long, void*)\n  {\n    \/\/vtkRenderWindow * RenderWindow = reinterpret_cast<vtkRenderWindow*>(caller);\n    \/\/m_ImageRenderer->ResetCameraClippingRange();\n  }\n};\n\nmitk::ImageBackground2D::ImageBackground2D()\n{\n  m_ImageWidth              = 720;\n  m_ImageHeight             = 576;\n  m_ImageScalarComponents   = 3;\n  m_ParallelScale           = 0;\n  m_RenderWindow = NULL;\n  \n  m_Actor             = vtkImageActor::New();\n  m_ImageRenderer     = vtkRenderer::New();\n  m_VtkImageImport    = vtkImageImport::New();\n  \n  m_ImageData         = 0;\n\n  InitVtkImageImport();\n}\n\nvoid mitk::ImageBackground2D::InitVtkImageImport()\n{ \n  m_VtkImageImport->SetDataScalarTypeToUnsignedChar();\n  m_VtkImageImport->SetNumberOfScalarComponents(m_ImageScalarComponents);\n  m_VtkImageImport->SetWholeExtent(0,m_ImageWidth-1,0,m_ImageHeight-1,0,1-1);\n  m_VtkImageImport->SetDataExtentToWholeExtent();  \n}\n\nmitk::ImageBackground2D::~ImageBackground2D()\n{\n  if ( m_RenderWindow != NULL )\n    if ( this->IsEnabled() )\n      this->Disable();\n  if ( m_Actor!=NULL )\n    m_Actor->Delete();\n  if ( m_ImageRenderer != NULL )\n    m_ImageRenderer->Delete();\n  if ( m_VtkImageImport != NULL)\n    m_VtkImageImport->Delete();\n}\n\/**\n * Sets the renderwindow, in which the Video background\n * will be shown. Make sure, you have called this function\n * before calling Enable()\n *\/\nvoid mitk::ImageBackground2D::SetRenderWindow( const mitk::RenderWindow* renderWindow )\n{\n  m_RenderWindow = renderWindow;\n\n  \/*m_SizeCallback = vtkVideoSizeCallback::New();\n  m_RenderWindow->GetVtkRenderWindow()->AddObserver(vtkCommand::ModifiedEvent,m_SizeCallback);*\/\n  \n}\n\nvoid mitk::ImageBackground2D::SetParallelScale(int scale)\n{\n  m_ParallelScale = scale;\n  m_ImageRenderer->GetActiveCamera()->SetParallelScale(m_ParallelScale);\n}\nint mitk::ImageBackground2D::GetParallelScale()\n{\n  \/\/ TODO someone who knows this, check if double->int could cause problems\n  return static_cast<int>(m_ImageRenderer->GetActiveCamera()->GetParallelScale());\n}\n\/**\n * Enables drawing of the color Video background.\n * If you want to disable it, call the Disable() function.\n *\/\nvoid mitk::ImageBackground2D::Enable()\n{\n  m_ImageRenderer = vtkRenderer::New();\n  \n  unsigned char * c = 0;\n  Update(c);\n  m_Actor->SetInput(m_VtkImageImport->GetOutput());\n \n  m_ImageRenderer->AddActor2D(m_Actor);\n  m_ImageRenderer->ResetCamera();\n  m_ImageRenderer->InteractiveOff();\n  m_ImageRenderer->GetActiveCamera()->ParallelProjectionOn();\n  if(m_ParallelScale == 0)\n    m_ImageRenderer->GetActiveCamera()->SetParallelScale(m_ImageHeight\/2);\n \n  \/\/m_SizeCallback->SetVtkVideoRenderer(m_ImageRenderer);\n  \/\/m_SizeCallback->SetVideoDimensions(m_ImageWidth, m_ImageHeight);\n  m_RenderWindow->GetVtkLayerController()->InsertBackgroundRenderer(m_ImageRenderer,true); \n}\n\n\/**\n * Disables drawing of the color Video background.\n * If you want to enable it, call the Enable() function.\n *\/\nvoid mitk::ImageBackground2D::Disable()\n{\n  if ( this->IsEnabled() )\n    m_RenderWindow->GetVtkLayerController()->RemoveRenderer(m_ImageRenderer);    \n}\n\/**\n * Checks, if the Video background is currently\n * enabled (visible)\n *\/\nbool mitk::ImageBackground2D::IsEnabled()\n{\n  if ( m_RenderWindow->GetVtkLayerController()->IsRendererInserted(m_ImageRenderer) )\n      return true;\n  else\n      return false;    \n}\n\nvoid mitk::ImageBackground2D::Update(unsigned char * datapointer)\n{\n  if(!IsEnabled())\n    return;\n\n  if(!datapointer)\n  {\/\/ no valid image pointer provided -> initialize black image\n    m_ImageData = new unsigned char[m_ImageHeight*m_ImageWidth*m_ImageScalarComponents];\n    unsigned char* b = m_ImageData;\n    for ( int textCounter = 0; textCounter < (m_ImageHeight*m_ImageWidth*m_ImageScalarComponents); textCounter++ )\n      *b++ = 0;\n  }\n  \n  m_VtkImageImport->SetImportVoidPointer(m_ImageData);\n  m_VtkImageImport->Modified();\n  m_VtkImageImport->Update();\n  m_RenderWindow->GetVtkRenderWindow()->Render();\n   \n}\n\n#ifdef OPEN_CV\n\nvoid mitk::ImageBackground2D::Update(IplImage * image)\n{\n  if(!image || !IsEnabled())\n    return;\n  \n  \n  if(image->roi == NULL)\n  {\n    if(image->height != m_ImageHeight || image->width != m_ImageWidth || image->nChannels != m_ImageScalarComponents)\n    { \/\/ image parameters changed, update data array \n      m_ImageHeight           = image->height;\n      m_ImageWidth            = image->width;\n      m_ImageScalarComponents = image->nChannels;\n      \n      if(m_ImageData != 0)\n      {  \n        delete m_ImageData;\n        m_ImageData = 0;\n      }\n    }\n    if(m_ImageData == 0)\n      m_ImageData = new unsigned char[m_ImageWidth*m_ImageHeight*m_ImageScalarComponents];\n\n  }\n  else\n  {\n    if(image->roi->height != m_ImageHeight|| image->roi->width != m_ImageWidth || image->nChannels != m_ImageScalarComponents)\n    {\n\n    }\n  }\n\n  InitVtkImageImport();\n\n  int column, row;\n  unsigned char* tex = m_ImageData;\n  char* data = image->imageData;\n  \n  if(image->nChannels == 1 && image->origin == 1)\n  { \/\/ flip image\n    unsigned char g;\n    for (column = 0; column < m_ImageHeight; column++)\n    {\n      for (row = 0; row < m_ImageWidth; row++)\n      {\n            g   = *data++;\n        *tex++  = g;\n      }\n    }\n  }\n  else if(image->nChannels == 3 && image->origin == 1)\n  { \/\/ flip image, change color channels\n    unsigned char r, g, b;\n    for (column = 0; column < m_ImageHeight; column++)\n    {\n      for (row = 0; row < m_ImageWidth; row++)\n      {   \/\/change r with b\n          b = *data++;\n          g = *data++;\n          r = *data++;\n          *tex++ = r;\n          *tex++ = g;\n          *tex++ = b;\n      }\n    }\n  }\n  else\n    std::cout << \"opencv image not supported in mitkimagebackround2d.cpp\" << std::endl;\n\n  m_VtkImageImport->SetImportVoidPointer(m_ImageData);\n  m_VtkImageImport->Modified();\n  m_VtkImageImport->Update();\n  m_RenderWindow->GetVtkRenderWindow()->Render();\n}\n#endif\n<commit_msg>CHG: removed opencv dependency<commit_after>#include \"mitkImageBackground2D.h\"\n\/\/ MITK includes\n#include \"mitkVtkLayerController.h\"\n#include \"mitkVtkRenderWindow.h\"\n#include \"mitkRenderWindow.h\"\n\n\/\/ VTK includes\n#include \"vtkSystemIncludes.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkMapper.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkImageActor.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkImageImport.h\"\n#include \"vtkCommand.h\"\n#include \"vtkCamera.h\"\n\n#include <iostream>\n\n\/\/ VTK CALLBACK for automatic resize of the video\nclass vtkVideoSizeCallback : public vtkCommand\n{\npublic:\n  static vtkVideoSizeCallback *New(){ return new vtkVideoSizeCallback; }\n  \n  vtkRenderer * m_ImageRenderer;\n  int m_ImageWidth, m_ImageHeight;\n\n  void SetVtkVideoRenderer(vtkRenderer* r)\n  {\n    m_ImageRenderer = r;\n  }\n  void SetVideoDimensions(int x, int y)\n  {\n    m_ImageWidth = x; m_ImageHeight = y;\n  }\n\n  virtual void Execute(vtkObject* \/*caller*\/, unsigned long, void*)\n  {\n    \/\/vtkRenderWindow * RenderWindow = reinterpret_cast<vtkRenderWindow*>(caller);\n    \/\/m_ImageRenderer->ResetCameraClippingRange();\n  }\n};\n\nmitk::ImageBackground2D::ImageBackground2D()\n{\n  m_ImageWidth              = 720;\n  m_ImageHeight             = 576;\n  m_ImageScalarComponents   = 3;\n  m_ParallelScale           = 0;\n  m_RenderWindow = NULL;\n  \n  m_Actor             = vtkImageActor::New();\n  m_ImageRenderer     = vtkRenderer::New();\n  m_VtkImageImport    = vtkImageImport::New();\n  \n  m_ImageData         = 0;\n\n  InitVtkImageImport();\n}\n\nvoid mitk::ImageBackground2D::InitVtkImageImport()\n{ \n  m_VtkImageImport->SetDataScalarTypeToUnsignedChar();\n  m_VtkImageImport->SetNumberOfScalarComponents(m_ImageScalarComponents);\n  m_VtkImageImport->SetWholeExtent(0,m_ImageWidth-1,0,m_ImageHeight-1,0,1-1);\n  m_VtkImageImport->SetDataExtentToWholeExtent();  \n}\n\nmitk::ImageBackground2D::~ImageBackground2D()\n{\n  if ( m_RenderWindow != NULL )\n    if ( this->IsEnabled() )\n      this->Disable();\n  if ( m_Actor!=NULL )\n    m_Actor->Delete();\n  if ( m_ImageRenderer != NULL )\n    m_ImageRenderer->Delete();\n  if ( m_VtkImageImport != NULL)\n    m_VtkImageImport->Delete();\n}\n\/**\n * Sets the renderwindow, in which the Video background\n * will be shown. Make sure, you have called this function\n * before calling Enable()\n *\/\nvoid mitk::ImageBackground2D::SetRenderWindow( const mitk::RenderWindow* renderWindow )\n{\n  m_RenderWindow = renderWindow;\n\n  \/*m_SizeCallback = vtkVideoSizeCallback::New();\n  m_RenderWindow->GetVtkRenderWindow()->AddObserver(vtkCommand::ModifiedEvent,m_SizeCallback);*\/\n  \n}\n\nvoid mitk::ImageBackground2D::SetParallelScale(int scale)\n{\n  m_ParallelScale = scale;\n  m_ImageRenderer->GetActiveCamera()->SetParallelScale(m_ParallelScale);\n}\nint mitk::ImageBackground2D::GetParallelScale()\n{\n  \/\/ TODO someone who knows this, check if double->int could cause problems\n  return static_cast<int>(m_ImageRenderer->GetActiveCamera()->GetParallelScale());\n}\n\/**\n * Enables drawing of the color Video background.\n * If you want to disable it, call the Disable() function.\n *\/\nvoid mitk::ImageBackground2D::Enable()\n{\n  m_ImageRenderer = vtkRenderer::New();\n  \n  unsigned char * c = 0;\n  Update(c);\n  m_Actor->SetInput(m_VtkImageImport->GetOutput());\n \n  m_ImageRenderer->AddActor2D(m_Actor);\n  m_ImageRenderer->ResetCamera();\n  m_ImageRenderer->InteractiveOff();\n  m_ImageRenderer->GetActiveCamera()->ParallelProjectionOn();\n  if(m_ParallelScale == 0)\n    m_ImageRenderer->GetActiveCamera()->SetParallelScale(m_ImageHeight\/2);\n \n  \/\/m_SizeCallback->SetVtkVideoRenderer(m_ImageRenderer);\n  \/\/m_SizeCallback->SetVideoDimensions(m_ImageWidth, m_ImageHeight);\n  m_RenderWindow->GetVtkLayerController()->InsertBackgroundRenderer(m_ImageRenderer,true); \n}\n\n\/**\n * Disables drawing of the color Video background.\n * If you want to enable it, call the Enable() function.\n *\/\nvoid mitk::ImageBackground2D::Disable()\n{\n  if ( this->IsEnabled() )\n    m_RenderWindow->GetVtkLayerController()->RemoveRenderer(m_ImageRenderer);    \n}\n\/**\n * Checks, if the Video background is currently\n * enabled (visible)\n *\/\nbool mitk::ImageBackground2D::IsEnabled()\n{\n  if ( m_RenderWindow->GetVtkLayerController()->IsRendererInserted(m_ImageRenderer) )\n      return true;\n  else\n      return false;    \n}\n\nvoid mitk::ImageBackground2D::Update(unsigned char * datapointer)\n{\n  if(!IsEnabled())\n    return;\n\n  if(!datapointer)\n  {\/\/ no valid image pointer provided -> initialize black image\n    m_ImageData = new unsigned char[m_ImageHeight*m_ImageWidth*m_ImageScalarComponents];\n    unsigned char* b = m_ImageData;\n    for ( int textCounter = 0; textCounter < (m_ImageHeight*m_ImageWidth*m_ImageScalarComponents); textCounter++ )\n      *b++ = 0;\n  }\n  \n  m_VtkImageImport->SetImportVoidPointer(m_ImageData);\n  m_VtkImageImport->Modified();\n  m_VtkImageImport->Update();\n  m_RenderWindow->GetVtkRenderWindow()->Render();\n   \n}\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Implement tutorial 02<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <queso\/GslVector.h>\n#include <queso\/GslMatrix.h>\n#include <queso\/UniformVectorRV.h>\n#include <queso\/StatisticalInverseProblem.h>\n#include <queso\/VectorSet.h>\n#include <queso\/GaussianProcessEmulator.h>\n\n#include <cstdio>\n\n\/\/ Read in data files\nvoid readData(const std::vector<QUESO::GslVector *> & simulationScenarios,\n    const std::vector<QUESO::GslVector *> & simulationParameters,\n    const std::vector<QUESO::GslVector *> & simulationOutputs,\n    const std::vector<QUESO::GslVector *> & experimentScenarios,\n    const std::vector<QUESO::GslVector *> & experimentOutputs) {\n  FILE * fp_in = fopen(\"gp\/scalar\/dakota_pstudy.dat\", \"r\");\n  unsigned int i, id, size = 512;\n  double k_tmasl, k_tmoml, k_tnrgl, k_xkwlx, k_cd, pressure;\n  char line[size];\n\n  double mins[] = {0.95, 0.9, 0.9, 0.9, 0.9};\n  double maxs[] = {1.05, 1.1, 1.1, 1.1, 1.1};\n\n  double meansim = 0;\n  double m2sim = 0;\n\n  \/\/ First line is a header, so we ignore it\n  fgets(line, size, fp_in);\n\n  i = 0;\n  while (fscanf(fp_in, \"%d %lf %lf %lf %lf %lf %lf\\n\", &id, &k_tmasl, &k_tmoml,\n        &k_tnrgl, &k_xkwlx, &k_cd, &pressure) != EOF) {\n    (*(simulationScenarios[i]))[0] = 0.5;\n\n    (*(simulationParameters[i]))[0] = (k_tmasl - mins[0]) \/ (maxs[0] - mins[0]);\n    (*(simulationParameters[i]))[1] = (k_tmoml - mins[1]) \/ (maxs[1] - mins[1]);\n    (*(simulationParameters[i]))[2] = (k_tnrgl - mins[2]) \/ (maxs[2] - mins[2]);\n    (*(simulationParameters[i]))[3] = (k_xkwlx - mins[3]) \/ (maxs[3] - mins[3]);\n    (*(simulationParameters[i]))[4] = (k_cd    - mins[4]) \/ (maxs[4] - mins[4]);\n\n    (*(simulationOutputs[i]))[0] = pressure;\n    i++;\n\n    double delta = pressure - meansim;\n    meansim += delta \/ i;\n    m2sim += delta * (pressure - meansim);\n  }\n\n  double stdsim = m2sim \/ (double)(i - 1);\n\n  for (unsigned int j = 0; j < i; j++) {\n    (*(simulationOutputs[j]))[0] -= meansim;\n    (*(simulationOutputs[j]))[0] \/= stdsim;\n  }\n\n  fclose(fp_in);  \/\/ Done with simulation data\n\n  \/\/ Read in experimental data\n  fp_in = fopen(\"gp\/scalar\/ctf_dat.txt\", \"r\");\n  i = 0;\n  while (fscanf(fp_in, \"%lf\\n\", &pressure) != EOF) {\n    (*(experimentOutputs[i]))[0] = pressure;\n    i++;\n  }\n\n  for (unsigned int j = 0; j < i; j++) {\n    (*(experimentOutputs[j]))[0] -= meansim;\n    (*(experimentOutputs[j]))[0] \/= stdsim;\n  }\n\n  fclose(fp_in);\n}\n\nint main(int argc, char ** argv) {\n  \/\/ Step 0: Set up some variables\n  unsigned int numExperiments = 10;  \/\/ Number of experiments\n  unsigned int numUncertainVars = 5;  \/\/ Number of things to calibrate\n  unsigned int numSimulations = 50;  \/\/ Number of simulations\n  unsigned int numConfigVars = 1;  \/\/ Dimension of configuration space\n  unsigned int numEta = 1;  \/\/ Number of responses the model is returning\n  unsigned int experimentSize = 1;  \/\/ Size of each experiment\n\n  MPI_Init(&argc, &argv);\n\n  \/\/ Step 1: Set up QUESO environment\n  QUESO::FullEnvironment env(MPI_COMM_WORLD, argv[1], \"\", NULL);\n\n  \/\/ Step 2: Set up prior for calibration parameters\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> paramSpace(env,\n      \"param_\", numUncertainVars, NULL);\n\n  \/\/ Parameter (theta) bounds:\n  \/\/   descriptors   'k_tmasl' 'k_xkle' 'k_xkwew' 'k_xkwlx' 'k_cd'\n  \/\/   upper_bounds   1.05      1.1      1.1       1.1       1.1\n  \/\/   lower_bounds   0.95      0.9      0.9       0.9       0.9\n  QUESO::GslVector paramMins(paramSpace.zeroVector());\n  QUESO::GslVector paramMaxs(paramSpace.zeroVector());\n\n  paramMins.cwSet(0.9);\n  paramMaxs.cwSet(1.1);\n\n  paramMins[0] = 0.95;\n  paramMaxs[0] = 1.05;\n\n  QUESO::BoxSubset<QUESO::GslVector, QUESO::GslMatrix> paramDomain(\"param_\",\n      paramSpace, paramMins, paramMaxs);\n\n  QUESO::UniformVectorRV<QUESO::GslVector, QUESO::GslMatrix> priorRv(\"prior_\",\n      paramDomain);\n\n  \/\/ Step 3: Instantiate the 'scenario' and 'output' spaces for simulation\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> configSpace(env,\n      \"scenario_\", numConfigVars, NULL);\n\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> nEtaSpace(env,\n      \"output_\", numEta, NULL);\n\n  \/\/ Step 4: Instantiate the 'output' space for the experiments\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> experimentSpace(env,\n      \"experimentspace_\", experimentSize, NULL);\n\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> totalExperimentSpace(env,\n      \"experimentspace_\", experimentSize * numExperiments, NULL);\n\n  \/\/ Step 5: Instantiate the Gaussian process emulator object\n  \/\/\n  \/\/ Regarding simulation scenario input values, QUESO should standardise them\n  \/\/ so that they exist inside a hypercube.\n  \/\/\n  \/\/ Regarding simulation output data, QUESO should transform it so that the\n  \/\/ mean is zero and the variance is one.\n  \/\/\n  \/\/ Regarding experimental scenario input values, QUESO should standardize\n  \/\/ them so that they exist inside a hypercube.\n  \/\/\n  \/\/ Regarding experimental data, QUESO should transformed it so that it has\n  \/\/ zero mean and variance one.\n\n  \/\/ GaussianProcessEmulator stores all the information about our simulation\n  \/\/ data and experimental data.  It also stores default information about the\n  \/\/ hyperparameter distributions.\n  QUESO::GaussianProcessFactory<QUESO::GslVector, QUESO::GslMatrix>\n    gpFactory(\"gp_\",\n              priorRv,\n              configSpace,\n              paramSpace,\n              nEtaSpace,\n              experimentSpace,\n              numSimulations,\n              numExperiments);\n\n  \/\/ std::vector containing all the points in scenario space where we have\n  \/\/ simulations\n  std::vector<QUESO::GslVector *> simulationScenarios(numSimulations,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ std::vector containing all the points in parameter space where we have\n  \/\/ simulations\n  std::vector<QUESO::GslVector *> paramVecs(numSimulations,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ std::vector containing all the simulation output data\n  std::vector<QUESO::GslVector *> outputVecs(numSimulations,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ std::vector containing all the points in scenario space where we have\n  \/\/ experiments\n  std::vector<QUESO::GslVector *> experimentScenarios(numExperiments,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ std::vector containing all the experimental output data\n  std::vector<QUESO::GslVector *> experimentVecs(numExperiments,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ The experimental output data observation error covariance matrix\n  QUESO::GslMatrix experimentMat(totalExperimentSpace.zeroVector());\n\n  \/\/ Instantiate each of the simulation points\/outputs\n  for (unsigned int i = 0; i < numSimulations; i++) {\n    simulationScenarios[i] = new QUESO::GslVector(configSpace.zeroVector());  \/\/ 'x_{i+1}^*' in paper\n    paramVecs          [i] = new QUESO::GslVector(paramSpace.zeroVector());  \/\/ 't_{i+1}^*' in paper\n    outputVecs         [i] = new QUESO::GslVector(nEtaSpace.zeroVector());  \/\/ 'eta_{i+1}' in paper\n  }\n\n  for (unsigned int i = 0; i < numExperiments; i++) {\n    experimentScenarios[i] = new QUESO::GslVector(configSpace.zeroVector()); \/\/ 'x_{i+1}' in paper\n    experimentVecs[i] = new QUESO::GslVector(experimentSpace.zeroVector());\n  }\n\n  readExpData(experimentScenarios, experimentVecs);\n  readSimData(simulationScenarios, paramVecs, outputVecs);\n\n  for (unsigned int i = 0; i < numExperiments; i++) {\n    experimentMat(i, i) = 0.025 * 0.025;\n  }\n\n  \/\/ Add simulation and experimental data\n  gpFactory.addSimulations(simulationScenarios, paramVecs, outputVecs);\n  gpFactory.addExperiments(experimentScenarios, experimentVecs, &experimentMat);\n\n  QUESO::GenericVectorRV<QUESO::GslVector, QUESO::GslMatrix> postRv(\n      \"post_\",\n      gpFactory.prior().imageSet().vectorSpace());\n  QUESO::StatisticalInverseProblem<QUESO::GslVector, QUESO::GslMatrix> ip(\"\",\n      NULL, gpFactory, postRv);\n\n  QUESO::GslVector paramInitials(\n      gpFactory.prior().imageSet().vectorSpace().zeroVector());\n\n  \/\/ Initial condition of the chain\n  \/\/ for (unsigned int i = 0; i < paramInitials.sizeLocal(); i++) {\n  \/\/   paramInitials[i] = 0.95;\n  \/\/ }\n\n  \/\/ 'Best' initial conditions (from cobra report) are:\n  paramInitials[0] = 1.05;  \/\/ k_tmasl\n  paramInitials[1] = 0.9;  \/\/ k_tmoml\n  paramInitials[2] = 0.9888;  \/\/ k_tnrgl\n  paramInitials[3] = 0.995;  \/\/ k_xkwlx\n  paramInitials[4] = 1.0178;  \/\/ k_cd\n  paramInitials[5] = 0.0;  \/\/ Emulator mean\n\n  for (unsigned int i = 6; i < 15; i++) {\n    paramInitials[i] = 0.01;\n  }\n\n  QUESO::GslMatrix proposalCovMatrix(\n      gpFactory.prior().imageSet().vectorSpace().zeroVector());\n  for (unsigned int i = 0; i < proposalCovMatrix.numRowsLocal(); i++) {\n    proposalCovMatrix(i, i) = 0.01;\n  }\n  std::cout << \"got here 25\" << std::endl;\n\n  ip.solveWithBayesMetropolisHastings(NULL, paramInitials, &proposalCovMatrix);\n  std::cout << \"got here 26\" << std::endl;\n\n  MPI_Finalize();\n  std::cout << \"got here 27\" << std::endl;\n\n  return 0;\n}\n<commit_msg>Update params for standardised data<commit_after>#include <queso\/GslVector.h>\n#include <queso\/GslMatrix.h>\n#include <queso\/UniformVectorRV.h>\n#include <queso\/StatisticalInverseProblem.h>\n#include <queso\/VectorSet.h>\n#include <queso\/GaussianProcessEmulator.h>\n\n#include <cstdio>\n\n\/\/ Read in data files\nvoid readData(const std::vector<QUESO::GslVector *> & simulationScenarios,\n    const std::vector<QUESO::GslVector *> & simulationParameters,\n    const std::vector<QUESO::GslVector *> & simulationOutputs,\n    const std::vector<QUESO::GslVector *> & experimentScenarios,\n    const std::vector<QUESO::GslVector *> & experimentOutputs) {\n  FILE * fp_in = fopen(\"gp\/scalar\/dakota_pstudy.dat\", \"r\");\n  unsigned int i, id, size = 512;\n  double k_tmasl, k_tmoml, k_tnrgl, k_xkwlx, k_cd, pressure;\n  char line[size];\n\n  double mins[] = {0.95, 0.9, 0.9, 0.9, 0.9};\n  double maxs[] = {1.05, 1.1, 1.1, 1.1, 1.1};\n\n  double meansim = 0;\n  double m2sim = 0;\n\n  \/\/ First line is a header, so we ignore it\n  fgets(line, size, fp_in);\n\n  i = 0;\n  while (fscanf(fp_in, \"%d %lf %lf %lf %lf %lf %lf\\n\", &id, &k_tmasl, &k_tmoml,\n        &k_tnrgl, &k_xkwlx, &k_cd, &pressure) != EOF) {\n    (*(simulationScenarios[i]))[0] = 0.5;\n\n    (*(simulationParameters[i]))[0] = (k_tmasl - mins[0]) \/ (maxs[0] - mins[0]);\n    (*(simulationParameters[i]))[1] = (k_tmoml - mins[1]) \/ (maxs[1] - mins[1]);\n    (*(simulationParameters[i]))[2] = (k_tnrgl - mins[2]) \/ (maxs[2] - mins[2]);\n    (*(simulationParameters[i]))[3] = (k_xkwlx - mins[3]) \/ (maxs[3] - mins[3]);\n    (*(simulationParameters[i]))[4] = (k_cd    - mins[4]) \/ (maxs[4] - mins[4]);\n\n    (*(simulationOutputs[i]))[0] = pressure;\n    i++;\n\n    double delta = pressure - meansim;\n    meansim += delta \/ i;\n    m2sim += delta * (pressure - meansim);\n  }\n\n  double stdsim = m2sim \/ (double)(i - 1);\n\n  for (unsigned int j = 0; j < i; j++) {\n    (*(simulationOutputs[j]))[0] -= meansim;\n    (*(simulationOutputs[j]))[0] \/= stdsim;\n  }\n\n  fclose(fp_in);  \/\/ Done with simulation data\n\n  \/\/ Read in experimental data\n  fp_in = fopen(\"gp\/scalar\/ctf_dat.txt\", \"r\");\n  i = 0;\n  while (fscanf(fp_in, \"%lf\\n\", &pressure) != EOF) {\n    (*(experimentOutputs[i]))[0] = pressure;\n    i++;\n  }\n\n  for (unsigned int j = 0; j < i; j++) {\n    (*(experimentOutputs[j]))[0] -= meansim;\n    (*(experimentOutputs[j]))[0] \/= stdsim;\n  }\n\n  fclose(fp_in);\n}\n\nint main(int argc, char ** argv) {\n  \/\/ Step 0: Set up some variables\n  unsigned int numExperiments = 10;  \/\/ Number of experiments\n  unsigned int numUncertainVars = 5;  \/\/ Number of things to calibrate\n  unsigned int numSimulations = 50;  \/\/ Number of simulations\n  unsigned int numConfigVars = 1;  \/\/ Dimension of configuration space\n  unsigned int numEta = 1;  \/\/ Number of responses the model is returning\n  unsigned int experimentSize = 1;  \/\/ Size of each experiment\n\n  MPI_Init(&argc, &argv);\n\n  \/\/ Step 1: Set up QUESO environment\n  QUESO::FullEnvironment env(MPI_COMM_WORLD, argv[1], \"\", NULL);\n\n  \/\/ Step 2: Set up prior for calibration parameters\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> paramSpace(env,\n      \"param_\", numUncertainVars, NULL);\n\n  \/\/ Parameter (theta) bounds:\n  \/\/   descriptors   'k_tmasl' 'k_xkle' 'k_xkwew' 'k_xkwlx' 'k_cd'\n  \/\/   upper_bounds   1.05      1.1      1.1       1.1       1.1\n  \/\/   lower_bounds   0.95      0.9      0.9       0.9       0.9\n  QUESO::GslVector paramMins(paramSpace.zeroVector());\n  QUESO::GslVector paramMaxs(paramSpace.zeroVector());\n\n  paramMins.cwSet(0.0);\n  paramMaxs.cwSet(1.0);\n\n  QUESO::BoxSubset<QUESO::GslVector, QUESO::GslMatrix> paramDomain(\"param_\",\n      paramSpace, paramMins, paramMaxs);\n\n  QUESO::UniformVectorRV<QUESO::GslVector, QUESO::GslMatrix> priorRv(\"prior_\",\n      paramDomain);\n\n  \/\/ Step 3: Instantiate the 'scenario' and 'output' spaces for simulation\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> configSpace(env,\n      \"scenario_\", numConfigVars, NULL);\n\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> nEtaSpace(env,\n      \"output_\", numEta, NULL);\n\n  \/\/ Step 4: Instantiate the 'output' space for the experiments\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> experimentSpace(env,\n      \"experimentspace_\", experimentSize, NULL);\n\n  QUESO::VectorSpace<QUESO::GslVector, QUESO::GslMatrix> totalExperimentSpace(env,\n      \"experimentspace_\", experimentSize * numExperiments, NULL);\n\n  \/\/ Step 5: Instantiate the Gaussian process emulator object\n  \/\/\n  \/\/ Regarding simulation scenario input values, QUESO should standardise them\n  \/\/ so that they exist inside a hypercube.\n  \/\/\n  \/\/ Regarding simulation output data, QUESO should transform it so that the\n  \/\/ mean is zero and the variance is one.\n  \/\/\n  \/\/ Regarding experimental scenario input values, QUESO should standardize\n  \/\/ them so that they exist inside a hypercube.\n  \/\/\n  \/\/ Regarding experimental data, QUESO should transformed it so that it has\n  \/\/ zero mean and variance one.\n\n  \/\/ GaussianProcessEmulator stores all the information about our simulation\n  \/\/ data and experimental data.  It also stores default information about the\n  \/\/ hyperparameter distributions.\n  QUESO::GaussianProcessFactory<QUESO::GslVector, QUESO::GslMatrix>\n    gpFactory(\"gp_\",\n              priorRv,\n              configSpace,\n              paramSpace,\n              nEtaSpace,\n              experimentSpace,\n              numSimulations,\n              numExperiments);\n\n  \/\/ std::vector containing all the points in scenario space where we have\n  \/\/ simulations\n  std::vector<QUESO::GslVector *> simulationScenarios(numSimulations,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ std::vector containing all the points in parameter space where we have\n  \/\/ simulations\n  std::vector<QUESO::GslVector *> paramVecs(numSimulations,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ std::vector containing all the simulation output data\n  std::vector<QUESO::GslVector *> outputVecs(numSimulations,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ std::vector containing all the points in scenario space where we have\n  \/\/ experiments\n  std::vector<QUESO::GslVector *> experimentScenarios(numExperiments,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ std::vector containing all the experimental output data\n  std::vector<QUESO::GslVector *> experimentVecs(numExperiments,\n      (QUESO::GslVector *) NULL);\n\n  \/\/ The experimental output data observation error covariance matrix\n  QUESO::GslMatrix experimentMat(totalExperimentSpace.zeroVector());\n\n  \/\/ Instantiate each of the simulation points\/outputs\n  for (unsigned int i = 0; i < numSimulations; i++) {\n    simulationScenarios[i] = new QUESO::GslVector(configSpace.zeroVector());  \/\/ 'x_{i+1}^*' in paper\n    paramVecs          [i] = new QUESO::GslVector(paramSpace.zeroVector());  \/\/ 't_{i+1}^*' in paper\n    outputVecs         [i] = new QUESO::GslVector(nEtaSpace.zeroVector());  \/\/ 'eta_{i+1}' in paper\n  }\n\n  for (unsigned int i = 0; i < numExperiments; i++) {\n    experimentScenarios[i] = new QUESO::GslVector(configSpace.zeroVector()); \/\/ 'x_{i+1}' in paper\n    experimentVecs[i] = new QUESO::GslVector(experimentSpace.zeroVector());\n  }\n\n  readData(simulationScenarios,\n      paramVecs,\n      outputVecs,\n      experimentScenarios,\n      experimentVecs);\n\n  for (unsigned int i = 0; i < numExperiments; i++) {\n    experimentMat(i, i) = 1.0;\n  }\n\n  \/\/ Add simulation and experimental data\n  gpFactory.addSimulations(simulationScenarios, paramVecs, outputVecs);\n  gpFactory.addExperiments(experimentScenarios, experimentVecs, &experimentMat);\n\n  QUESO::GenericVectorRV<QUESO::GslVector, QUESO::GslMatrix> postRv(\n      \"post_\",\n      gpFactory.prior().imageSet().vectorSpace());\n  QUESO::StatisticalInverseProblem<QUESO::GslVector, QUESO::GslMatrix> ip(\"\",\n      NULL, gpFactory, postRv);\n\n  QUESO::GslVector paramInitials(\n      gpFactory.prior().imageSet().vectorSpace().zeroVector());\n\n  \/\/ Initial condition of the chain\n  \/\/ for (unsigned int i = 0; i < paramInitials.sizeLocal(); i++) {\n  \/\/   paramInitials[i] = 0.95;\n  \/\/ }\n\n  \/\/ 'Best' initial conditions (from cobra report) are:\n  paramInitials[0] = 1.05;  \/\/ k_tmasl\n  paramInitials[1] = 0.9;  \/\/ k_tmoml\n  paramInitials[2] = 0.9888;  \/\/ k_tnrgl\n  paramInitials[3] = 0.995;  \/\/ k_xkwlx\n  paramInitials[4] = 1.0178;  \/\/ k_cd\n  paramInitials[5] = 0.0;  \/\/ Emulator mean\n\n  for (unsigned int i = 6; i < 15; i++) {\n    paramInitials[i] = 0.01;\n  }\n\n  QUESO::GslMatrix proposalCovMatrix(\n      gpFactory.prior().imageSet().vectorSpace().zeroVector());\n  for (unsigned int i = 0; i < proposalCovMatrix.numRowsLocal(); i++) {\n    proposalCovMatrix(i, i) = 0.01;\n  }\n  std::cout << \"got here 25\" << std::endl;\n\n  ip.solveWithBayesMetropolisHastings(NULL, paramInitials, &proposalCovMatrix);\n  std::cout << \"got here 26\" << std::endl;\n\n  MPI_Finalize();\n  std::cout << \"got here 27\" << std::endl;\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** @file multiGrid_example.cpp\n\n    @brief Provides an examples for the multigrid solver.\n\n    This file is part of the G+Smo library.\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    Author(s): C. Hofreither, S. Takacs\n*\/\n\n#include <gismo.h>\n\nusing namespace gismo;\n\nint main(int argc, char *argv[])\n{\n    \/************** Define command line options *************\/\n\n    std::string geometry(\"domain2d\/yeti_mp2.xml\");\n    index_t refinements = 3;\n    index_t degree = 2;\n    bool dg = false;\n    index_t levels = -1;\n    index_t cycles = 1;\n    index_t presmooth = 1;\n    index_t postsmooth = 1;\n    std::string smoother(\"GaussSeidel\");\n    real_t damping = -1;\n    real_t scaling = 0.12;\n    real_t tolerance = 1.e-8;\n    index_t maxIterations = 100;\n    bool plot = false;\n    std::string boundary_conditions(\"d\");\n\n    gsCmdLine cmd(\"Solves a PDE with an isogeometric discretization using a multigrid solver.\");\n    cmd.addString(\"g\", \"Geometry\",              \"Geometry file\", geometry);\n    cmd.addInt   (\"r\", \"Refinements\",           \"Number of uniform h-refinement steps to perform before solving\", refinements);\n    cmd.addInt   (\"p\", \"Degree\",                \"Degree of the B-spline discretization space\", degree);\n    cmd.addSwitch(\"\",  \"DG\",                    \"Use a discontinuous Galerkin discretization\", dg);\n    cmd.addInt   (\"l\", \"MG.Levels\",             \"Number of levels to use for multigrid iteration\", levels);\n    cmd.addInt   (\"c\", \"MG.Cycles\",             \"Number of multi-grid cycles\", cycles);\n    cmd.addInt   (\"\",  \"MG.Presmooth\",          \"Number of pre-smoothing steps\", presmooth);\n    cmd.addInt   (\"\",  \"MG.Postsmooth\",         \"Number of post-smoothing steps\", postsmooth);\n    cmd.addString(\"s\", \"MG.Smoother\",           \"Smoothing method\", smoother);\n    cmd.addReal  (\"\",  \"MG.Damping\",            \"Damping factor for the smoother\", damping);\n    cmd.addReal  (\"\",  \"MG.Scaling\",            \"Scaling factor for the subspace corrected mass smoother\", scaling);\n    cmd.addReal  (\"t\", \"CG.Tolerance\",          \"Stopping criterion for cg\", tolerance);\n    cmd.addInt   (\"\",  \"CG.MaxIterations\",      \"Stopping criterion for cg\", maxIterations);\n    cmd.addString(\"b\", \"BoundaryConditions\",    \"Boundary conditions\", boundary_conditions);\n    cmd.addSwitch(\"\",  \"Plot\",                  \"Plot the result with Paraview\", plot);\n\n    try { cmd.getValues(argc,argv); } catch (int rv) { return rv; }\n\n    gsOptionList opt = cmd.getOptionList();\n\n    \/\/ Default case is levels:=refinements, so replace invalid default accordingly\n    if (levels <0) { levels = refinements; opt.setInt( \"MG.Levels\", levels ); }\n    \/\/ The smoothers know their defaults, so remove the invalid default\n    if (damping<0) { opt.remove( \"MG.Damping\" ); }\n\n    \/\/ Define assembler options\n    opt.remove( \"DG\" );\n    opt.addInt( \"Ass.InterfaceStrategy\", \"\", (index_t)( dg ? iFace::dg : iFace::conforming )  );\n    opt.addInt( \"Ass.DirichletStrategy\", \"\", (index_t) dirichlet::elimination                 );\n\n    if ( ! gsFileManager::fileExists(geometry) )\n    {\n        gsInfo << \"Geometry file could not be found.\\n\";\n        gsInfo << \"I was searching in the current directory and in: \" << gsFileManager::getSearchPaths() << \"\\n\";\n        return EXIT_FAILURE;\n    }\n\n    gsInfo << \"Run multiGrid_example with options:\\n\" << opt << std::endl;\n\n    \/******************* Define geometry ********************\/\n\n    gsInfo << \"Define geometry... \" << std::flush;\n\n    gsMultiPatch<>::uPtr mpPtr = gsReadFile<>(geometry);\n    if (!mpPtr)\n    {\n        gsInfo << \"No geometry found in file \" << geometry << \".\\n\";\n        return EXIT_FAILURE;\n    }\n    gsMultiPatch<>& mp = *mpPtr;\n\n    gsInfo << \"done.\\n\";\n\n    \/************** Define boundary conditions **************\/\n\n    gsInfo << \"Define boundary conditions... \" << std::flush;\n\n    gsConstantFunction<> one(1.0, mp.geoDim());\n\n    gsBoundaryConditions<> bc;\n    {\n        const index_t len = boundary_conditions.length();\n        index_t i = 0;\n        for (gsMultiPatch<>::const_biterator it = mp.bBegin(); it < mp.bEnd(); ++it)\n        {\n            char b_local;\n            if ( len == 1 )\n                b_local = boundary_conditions[0];\n            else if ( i < len )\n                b_local = boundary_conditions[i];\n            else\n            {\n                gsInfo << \"\\nNot enough boundary conditions given.\\n\";\n                return EXIT_FAILURE;\n            }\n\n            if ( b_local == 'd' )\n                bc.addCondition( *it, condition_type::dirichlet, &one );\n            else if ( b_local == 'n' )\n                bc.addCondition( *it, condition_type::neumann, &one );\n            else\n            {\n                gsInfo << \"\\nInvalid boundary condition given; only 'd' (Dirichlet) and 'n' (Neumann) are supported.\\n\";\n                return EXIT_FAILURE;\n            }\n\n            ++i;\n        }\n        if ( len > i )\n            gsInfo << \"\\nToo much boundary conditions have been specified. Ingnoring the remaining ones.\\n\";\n        gsInfo << \"done. \"<<i<<\" boundary conditions set.\\n\";\n    }\n\n\n    \/************ Setup bases and adjust degree *************\/\n\n    gsInfo << \"Setup bases and adjust degree... \" << std::flush;\n\n    gsMultiBasis<> mb(mp);\n\n    for ( size_t i = 0; i < mb.nBases(); ++ i )\n        mb[i].setDegreePreservingMultiplicity(degree);\n\n    for ( index_t i = 0; i < refinements; ++i )\n        mb.uniformRefine();\n\n    gsInfo << \"done.\\n\";\n\n    \/********* Setup assembler and assemble matrix **********\/\n\n    gsInfo << \"Setup assembler and assemble matrix... \" << std::flush;\n\n    gsPoissonAssembler<> assembler(\n        mp,\n        mb,\n        bc,\n        gsConstantFunction<>(1,mp.geoDim()),\n        (dirichlet::strategy) opt.getInt(\"Ass.DirichletStrategy\"),\n        (iFace::strategy)     opt.getInt(\"Ass.InterfaceStrategy\")\n    );\n    assembler.assemble();\n\n    gsInfo << \"done.\\n\";\n\n    \/**************** Setup solver and solve ****************\/\n\n    gsInfo << \"Setup solver and solve... \" << std::flush;\n\n    std::vector< gsSparseMatrix<real_t,RowMajor> > transferMatrices;\n    std::vector< gsMultiBasis<real_t> > multiBases; \/\/ only needed for subspace corrected mass smoother\n\n    gsGridHierarchy<>::buildByCoarsening(give(mb), bc, opt.getGroup(\"MG\"))\n        .moveMultiBasesTo(multiBases)\n        .moveTransferMatricesTo(transferMatrices)\n        .clear();\n\n    gsMultiGridOp<>::Ptr mg = gsMultiGridOp<>::make( assembler.matrix(), transferMatrices );\n    mg->setOptions( opt.getGroup(\"MG\") );\n\n    for (index_t i = 1; i < mg->numLevels(); ++i)\n    {\n        gsPreconditionerOp<>::Ptr smootherOp;\n        if ( opt.getString(\"MG.Smoother\") == \"Richardson\" )\n            smootherOp = makeRichardsonOp(mg->matrix(i));\n        else if ( opt.getString(\"MG.Smoother\") == \"Jacobi\" )\n            smootherOp = makeJacobiOp(mg->matrix(i));\n        else if ( opt.getString(\"MG.Smoother\") == \"GaussSeidel\" )\n            smootherOp = makeGaussSeidelOp(mg->matrix(i));\n        else if ( opt.getString(\"MG.Smoother\") == \"SubspaceCorrectedMassSmoother\" )\n        {\n            if (multiBases[i].nBases() != 1)\n            {\n                gsInfo << \"The chosen smoother only works for single-patch geometries.\\n\\n\";\n                return EXIT_FAILURE;\n            }\n            smootherOp = gsPreconditionerFromOp<>::make(\n                mg->underlyingOp(i),\n                gsPatchPreconditionersCreator<>::subspaceCorrectedMassSmootherOp(multiBases[i][0],bc,opt.getGroup(\"Ass\"),scaling)\n            );\n        }\n        else\n        {\n            gsInfo << \"The chosen smoother is unknown.\\n\\nKnown are:\\n  Richardson\\n  Jacobi\\n  GaussSeidel\"\n                      \"\\n  SubspaceCorrectedMassSmoother\\n\\n\";\n            return EXIT_FAILURE;\n        }\n        smootherOp->setOptions( opt.getGroup(\"MG\") );\n        mg->setSmoother(i, smootherOp);\n    }\n\n    gsMatrix<> x, errorHistory;\n    x.setRandom( assembler.matrix().rows(), 1 );\n\n    gsConjugateGradient<>( assembler.matrix(), mg )\n        .setOptions( opt.getGroup(\"CG\") )\n        .solveDetailed( assembler.rhs(), x, errorHistory );\n\n    gsInfo << \"done.\\n\\n\";\n\n    \/******************** Print end Exit ********************\/\n\n    const index_t iter = errorHistory.rows()-1;\n    const bool success = errorHistory(iter,0) < tolerance;\n    if (success)\n        gsInfo << \"Reached desired tolerance after \" << iter << \" iterates:\\n\";\n    else\n        gsInfo << \"Did not reach desired tolerance after \" << iter << \" iterates:\\n\";\n\n    if (errorHistory.rows() < 20)\n        gsInfo << errorHistory.transpose() << \"\\n\\n\";\n    else\n        gsInfo << errorHistory.topRows(5).transpose() << \" ... \" << errorHistory.bottomRows(5).transpose()  << \"\\n\\n\";\n\n    if (plot)\n    {\n        \/\/ Construct the solution as a scalar field\n        gsMultiPatch<> mpsol;\n        assembler.constructSolution(x, mpsol);\n        gsField<> sol( assembler.patches(), mpsol );\n\n        \/\/ Write approximate and exact solution to paraview files\n        gsInfo << \"Plotting in Paraview.\\n\";\n        gsWriteParaview<>(sol, \"multiGrid_result\", 1000);\n        gsFileManager::open(\"multiGrid_result.pvd\");\n    }\n    else\n    {\n        gsInfo << \"Done. No output created, re-run with --Plot to get a ParaView \"\n                  \"file containing the solution.\\n\";\n    }\n    return success ? EXIT_SUCCESS : EXIT_FAILURE;\n};\n<commit_msg>More options in multiGrid_example (#279)<commit_after>\/** @file multiGrid_example.cpp\n\n    @brief Provides an examples for the multigrid solver.\n\n    This file is part of the G+Smo library.\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    Author(s): C. Hofreither, S. Takacs\n*\/\n\n#include <gismo.h>\n\nusing namespace gismo;\n\nint main(int argc, char *argv[])\n{\n    \/************** Define command line options *************\/\n\n    std::string geometry(\"domain2d\/yeti_mp2.xml\");\n    index_t refinements = 3;\n    index_t degree = 2;\n    bool dg = false;\n    index_t levels = -1;\n    index_t cycles = 1;\n    index_t presmooth = 1;\n    index_t postsmooth = 1;\n    bool extrasmooth = false;\n    std::string smoother(\"GaussSeidel\");\n    real_t damping = -1;\n    real_t scaling = 0.12;\n    real_t tolerance = 1.e-8;\n    index_t maxIterations = 100;\n    bool plot = false;\n    std::string boundary_conditions(\"d\");\n\n    gsCmdLine cmd(\"Solves a PDE with an isogeometric discretization using a multigrid solver.\");\n    cmd.addString(\"g\", \"Geometry\",              \"Geometry file\", geometry);\n    cmd.addInt   (\"r\", \"Refinements\",           \"Number of uniform h-refinement steps to perform before solving\", refinements);\n    cmd.addInt   (\"p\", \"Degree\",                \"Degree of the B-spline discretization space\", degree);\n    cmd.addSwitch(\"\",  \"DG\",                    \"Use a discontinuous Galerkin discretization\", dg);\n    cmd.addInt   (\"l\", \"MG.Levels\",             \"Number of levels to use for multigrid iteration\", levels);\n    cmd.addInt   (\"c\", \"MG.Cycles\",             \"Number of multi-grid cycles\", cycles);\n    cmd.addInt   (\"\",  \"MG.Presmooth\",          \"Number of pre-smoothing steps\", presmooth);\n    cmd.addInt   (\"\",  \"MG.Postsmooth\",         \"Number of post-smoothing steps\", postsmooth);\n    cmd.addSwitch(\"\",  \"MG.Extrasmooth\",        \"Doubles the number of smoothing steps for each coarser level\", extrasmooth);\n    cmd.addString(\"s\", \"MG.Smoother\",           \"Smoothing method\", smoother);\n    cmd.addReal  (\"\",  \"MG.Damping\",            \"Damping factor for the smoother\", damping);\n    cmd.addReal  (\"\",  \"MG.Scaling\",            \"Scaling factor for the subspace corrected mass smoother\", scaling);\n    cmd.addReal  (\"t\", \"CG.Tolerance\",          \"Stopping criterion for cg\", tolerance);\n    cmd.addInt   (\"\",  \"CG.MaxIterations\",      \"Stopping criterion for cg\", maxIterations);\n    cmd.addString(\"b\", \"BoundaryConditions\",    \"Boundary conditions\", boundary_conditions);\n    cmd.addSwitch(\"\",  \"Plot\",                  \"Plot the result with Paraview\", plot);\n\n    try { cmd.getValues(argc,argv); } catch (int rv) { return rv; }\n\n    gsOptionList opt = cmd.getOptionList();\n\n    \/\/ Default case is levels:=refinements, so replace invalid default accordingly\n    if (levels <0) { levels = refinements; opt.setInt( \"MG.Levels\", levels ); }\n    \/\/ The smoothers know their defaults, so remove the invalid default\n    if (damping<0) { opt.remove( \"MG.Damping\" ); }\n\n    \/\/ Define assembler options\n    opt.remove( \"DG\" );\n    opt.addInt( \"MG.InterfaceStrategy\", \"\", (index_t)( dg ? iFace::dg : iFace::conforming )  );\n    opt.addInt( \"MG.DirichletStrategy\", \"\", (index_t) dirichlet::elimination                 );\n\n    if ( ! gsFileManager::fileExists(geometry) )\n    {\n        gsInfo << \"Geometry file could not be found.\\n\";\n        gsInfo << \"I was searching in the current directory and in: \" << gsFileManager::getSearchPaths() << \"\\n\";\n        return EXIT_FAILURE;\n    }\n\n    gsInfo << \"Run multiGrid_example with options:\\n\" << opt << std::endl;\n\n    \/******************* Define geometry ********************\/\n\n    gsInfo << \"Define geometry... \" << std::flush;\n\n    gsMultiPatch<>::uPtr mpPtr = gsReadFile<>(geometry);\n    if (!mpPtr)\n    {\n        gsInfo << \"No geometry found in file \" << geometry << \".\\n\";\n        return EXIT_FAILURE;\n    }\n    gsMultiPatch<>& mp = *mpPtr;\n\n    gsInfo << \"done.\\n\";\n\n    \/************** Define boundary conditions **************\/\n\n    gsInfo << \"Define boundary conditions... \" << std::flush;\n\n    gsConstantFunction<> one(1.0, mp.geoDim());\n\n    gsBoundaryConditions<> bc;\n    {\n        const index_t len = boundary_conditions.length();\n        index_t i = 0;\n        for (gsMultiPatch<>::const_biterator it = mp.bBegin(); it < mp.bEnd(); ++it)\n        {\n            char b_local;\n            if ( len == 1 )\n                b_local = boundary_conditions[0];\n            else if ( i < len )\n                b_local = boundary_conditions[i];\n            else\n            {\n                gsInfo << \"\\nNot enough boundary conditions given.\\n\";\n                return EXIT_FAILURE;\n            }\n\n            if ( b_local == 'd' )\n                bc.addCondition( *it, condition_type::dirichlet, &one );\n            else if ( b_local == 'n' )\n                bc.addCondition( *it, condition_type::neumann, &one );\n            else\n            {\n                gsInfo << \"\\nInvalid boundary condition given; only 'd' (Dirichlet) and 'n' (Neumann) are supported.\\n\";\n                return EXIT_FAILURE;\n            }\n\n            ++i;\n        }\n        if ( len > i )\n            gsInfo << \"\\nToo much boundary conditions have been specified. Ingnoring the remaining ones.\\n\";\n        gsInfo << \"done. \"<<i<<\" boundary conditions set.\\n\";\n    }\n\n\n    \/************ Setup bases and adjust degree *************\/\n\n    gsInfo << \"Setup bases and adjust degree... \" << std::flush;\n\n    gsMultiBasis<> mb(mp);\n\n    for ( size_t i = 0; i < mb.nBases(); ++ i )\n        mb[i].setDegreePreservingMultiplicity(degree);\n\n    for ( index_t i = 0; i < refinements; ++i )\n        mb.uniformRefine();\n\n    gsInfo << \"done.\\n\";\n\n    \/********* Setup assembler and assemble matrix **********\/\n\n    gsInfo << \"Setup assembler and assemble matrix... \" << std::flush;\n\n    gsPoissonAssembler<> assembler(\n        mp,\n        mb,\n        bc,\n        gsConstantFunction<>(1,mp.geoDim()),\n        (dirichlet::strategy) opt.getInt(\"MG.DirichletStrategy\"),\n        (iFace::strategy)     opt.getInt(\"MG.InterfaceStrategy\")\n    );\n    assembler.assemble();\n\n    gsInfo << \"done.\\n\";\n\n    \/**************** Setup solver and solve ****************\/\n\n    gsInfo << \"Setup solver and solve... \" << std::flush;\n\n    std::vector< gsSparseMatrix<real_t,RowMajor> > transferMatrices;\n    std::vector< gsMultiBasis<real_t> > multiBases; \/\/ only needed for subspace corrected mass smoother\n\n    gsGridHierarchy<>::buildByCoarsening(give(mb), bc, opt.getGroup(\"MG\"))\n        .moveMultiBasesTo(multiBases)\n        .moveTransferMatricesTo(transferMatrices)\n        .clear();\n\n    gsMultiGridOp<>::Ptr mg = gsMultiGridOp<>::make( assembler.matrix(), transferMatrices );\n    mg->setOptions( opt.getGroup(\"MG\") );\n\n    for (index_t i = 1; i < mg->numLevels(); ++i)\n    {\n        gsPreconditionerOp<>::Ptr smootherOp;\n        if ( smoother == \"Richardson\" || smoother == \"r\" )\n            smootherOp = makeRichardsonOp(mg->matrix(i));\n        else if ( smoother == \"Jacobi\" || smoother == \"j\" )\n            smootherOp = makeJacobiOp(mg->matrix(i));\n        else if ( smoother == \"GaussSeidel\" || smoother == \"gs\" )\n            smootherOp = makeGaussSeidelOp(mg->matrix(i));\n        else if ( smoother == \"SubspaceCorrectedMassSmoother\" || smoother == \"scms\" || smoother == \"Hybrid\" || smoother == \"hyb\" )\n        {\n            if (multiBases[i].nBases() != 1)\n            {\n                gsInfo << \"The chosen smoother only works for single-patch geometries.\\n\\n\";\n                return EXIT_FAILURE;\n            }\n            smootherOp = gsPreconditionerFromOp<>::make(\n                mg->underlyingOp(i),\n                gsPatchPreconditionersCreator<>::subspaceCorrectedMassSmootherOp(multiBases[i][0],bc,opt.getGroup(\"Ass\"),scaling)\n            );\n\n            if ( smoother == \"Hybrid\" || smoother == \"hyb\" )\n                smootherOp = gsCompositePrecOp<>::make( makeGaussSeidelOp(mg->matrix(i)), smootherOp );\n        }\n        else\n        {\n            gsInfo << \"The chosen smoother is unknown.\\n\\nKnown are:\\n  Richardson (r)\\n  Jacobi (j)\\n  GaussSeidel (gs)\"\n                      \"\\n  SubspaceCorrectedMassSmoother (scms)\\n  Hybrid (hyb)\\n\\n\";\n            return EXIT_FAILURE;\n        }\n        smootherOp->setOptions( opt.getGroup(\"MG\") );\n        \/\/ Handle the extra-smooth option. On the finest grid level, there is nothing to handle.\n        if (extrasmooth && i < mg->numLevels()-1 )\n        {\n            smootherOp->setNumOfSweeps( 1 << (mg->numLevels()-1-i) );\n            smootherOp = gsPreconditionerFromOp<>::make(mg->underlyingOp(i),smootherOp);\n        }\n        mg->setSmoother(i, smootherOp);\n    }\n\n    gsMatrix<> x, errorHistory;\n    x.setRandom( assembler.matrix().rows(), 1 );\n\n    gsConjugateGradient<>( assembler.matrix(), mg )\n        .setOptions( opt.getGroup(\"CG\") )\n        .solveDetailed( assembler.rhs(), x, errorHistory );\n\n    gsInfo << \"done.\\n\\n\";\n\n    \/******************** Print end Exit ********************\/\n\n    const index_t iter = errorHistory.rows()-1;\n    const bool success = errorHistory(iter,0) < tolerance;\n    if (success)\n        gsInfo << \"Reached desired tolerance after \" << iter << \" iterates:\\n\";\n    else\n        gsInfo << \"Did not reach desired tolerance after \" << iter << \" iterates:\\n\";\n\n    if (errorHistory.rows() < 20)\n        gsInfo << errorHistory.transpose() << \"\\n\\n\";\n    else\n        gsInfo << errorHistory.topRows(5).transpose() << \" ... \" << errorHistory.bottomRows(5).transpose()  << \"\\n\\n\";\n\n    if (plot)\n    {\n        \/\/ Construct the solution as a scalar field\n        gsMultiPatch<> mpsol;\n        assembler.constructSolution(x, mpsol);\n        gsField<> sol( assembler.patches(), mpsol );\n\n        \/\/ Write approximate and exact solution to paraview files\n        gsInfo << \"Plotting in Paraview.\\n\";\n        gsWriteParaview<>(sol, \"multiGrid_result\", 1000);\n        gsFileManager::open(\"multiGrid_result.pvd\");\n    }\n    else\n    {\n        gsInfo << \"Done. No output created, re-run with --Plot to get a ParaView \"\n                  \"file containing the solution.\\n\";\n    }\n    return success ? EXIT_SUCCESS : EXIT_FAILURE;\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"kalman_filter.h\"\n#include <iostream>\nusing Eigen::MatrixXd;\nusing Eigen::VectorXd;\nusing namespace std;\n\/\/ Please note that the Eigen library does not initialize \n\/\/ VectorXd or MatrixXd objects with zeros upon creation.\n\nKalmanFilter::KalmanFilter() {\n  cout<<\"Kalman Filter constructor running\\n\"<<endl;\n}\n\nKalmanFilter::~KalmanFilter() {}\n\nvoid KalmanFilter::Predict() {\n  \/**\n  TODO:\n    * predict the state\n  *\/\n  x_ = F_ * x_;\n  MatrixXd Ft = F_.transpose();\n  P_ = F_ * P_ * Ft + Q_;\n}\n\nvoid KalmanFilter::Update(const VectorXd &z) {\n  \/**\n  TODO:\n    * update the state by using Kalman Filter equations\n  *\/\n  VectorXd z_pred = H_ * x_;\n  VectorXd y = z - z_pred;\n  MatrixXd Ht = H_.transpose();\n  MatrixXd S = H_ * P_ * Ht + R_;\n  MatrixXd Si = S.inverse();\n  MatrixXd PHt = P_ * Ht;\n  MatrixXd K = PHt * Si;\n\n  \/\/new estimate\n  x_ = x_ + (K * y);\n  long x_size = x_.size();\n  MatrixXd I = MatrixXd::Identity(x_size, x_size);\n  P_ = (I - K * H_) * P_;\n}\n\nvoid KalmanFilter::UpdateEKF(const VectorXd &z) {\n  \/**\n  TODO:\n    * update the state by using Extended Kalman Filter equations\n  *\/\n  VectorXd z_pred(4);\n\n  double rho = sqrt(x_(0)*x_(0) + x_(1)*x_(1));\n  double phi = atan2(x_(1), x_(0)); \n  double rho_dot;\n  \n  if(fabs(rho) > 0.0001){\n    rho_dot = (x_(0)*x_(2) + x_(1)*x_(3))\/rho;\n  }\n  else{\n    rho_dot = 0; \n  }\n\n  z_pred << rho, phi, rho_dot;\n  \n  VectorXd y = z - z_pred;\n  \n  \/\/Normalize residual phi to be between -pi to pi\n  y(2) = atan2(sin(y(2)), cos(y(2)));\n  \n  MatrixXd Ht = H_.transpose();\n  MatrixXd S = H_ * P_ * Ht + R_;\n  MatrixXd Si = S.inverse();\n  MatrixXd PHt = P_ * Ht;\n  MatrixXd K = PHt * Si;\n\n  \/\/new estimate\n  x_ = x_ + (K * y);\n  long x_size = x_.size();\n  MatrixXd I = MatrixXd::Identity(x_size, x_size);\n  P_ = (I - K * H_) * P_; \n}\n<commit_msg>fix: pass variables with references and add missing headers<commit_after>#include \"kalman_filter.h\"\n#include <iostream>\n#include <math.h>\n\nusing Eigen::MatrixXd;\nusing Eigen::VectorXd;\nusing namespace std;\n\/\/ Please note that the Eigen library does not initialize \n\/\/ VectorXd or MatrixXd objects with zeros upon creation.\n\nKalmanFilter::KalmanFilter() {\n  \/\/cout<<\"Kalman Filter constructor running...\\n\"<<endl;\n}\n\nKalmanFilter::~KalmanFilter() {}\n\nvoid KalmanFilter::Predict() {\n  \/\/ predict the state\n  x_ = F_ * x_;\n  MatrixXd Ft = F_.transpose();\n  P_ = F_ * P_ * Ft + Q_;\n}\n\nvoid KalmanFilter::Update(const VectorXd &z) {\n  \/\/update the state by using Kalman Filter equations\n  VectorXd z_pred = H_ * x_;\n  VectorXd y = z - z_pred;\n  MatrixXd Ht = H_.transpose();\n  MatrixXd S = H_ * P_ * Ht + R_;\n  MatrixXd Si = S.inverse();\n  MatrixXd PHt = P_ * Ht;\n  MatrixXd K = PHt * Si;\n\n  \/\/new estimate\n  x_ = x_ + (K * y);\n  long x_size = x_.size();\n  MatrixXd I = MatrixXd::Identity(x_size, x_size);\n  P_ = (I - K * H_) * P_;\n}\n\nvoid KalmanFilter::UpdateEKF(const VectorXd &z) {\n  \/\/update the state by using Extended Kalman Filter equations\n  VectorXd z_pred(3);\n\n  double rho = sqrt(x_(0)*x_(0) + x_(1)*x_(1));\n  double phi = atan2(x_(1), x_(0)); \n  double rho_dot;\n  \n  if(fabs(rho) > 0.0001){\n    rho_dot = (x_(0)*x_(2) + x_(1)*x_(3))\/rho;\n  }\n  else{\n    rho_dot = 0; \n  }\n\n  z_pred << rho, phi, rho_dot;\n  \n  VectorXd y = z - z_pred;\n  \n  \/\/Normalize residual phi to be between -pi to pi\n  y(2) = atan2(sin(y(2)), cos(y(2)));\n  \n  MatrixXd Ht = H_.transpose();\n  MatrixXd S = H_ * P_ * Ht + R_;\n  MatrixXd Si = S.inverse();\n  MatrixXd PHt = P_ * Ht;\n  MatrixXd K = PHt * Si;\n\n  \/\/new estimate\n  x_ = x_ + (K * y);\n  long x_size = x_.size();\n  MatrixXd I = MatrixXd::Identity(x_size, x_size);\n  P_ = (I - K * H_) * P_; \n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=============================================================================\n\/\/ ■ ASM76\/ASM76.cpp\n\/\/-----------------------------------------------------------------------------\n\/\/   全局变量与实用函数。\n\/\/=============================================================================\n\n#include \"ASM76.hpp\"\n\nnamespace ASM76 {\n\t\/\/-------------------------------------------------------------------------\n\t\/\/ ● 全局变量\n\t\/\/-------------------------------------------------------------------------\n\t\/\/-------------------------------------------------------------------------\n\t\/\/ ● 初始化\n\t\/\/-------------------------------------------------------------------------\n\tvoid init() {\n\t\tprintf(\"Init ASM76 environment\\n\");\n\t\t\/\/ nothing to do here now\n\t}\n\t\/\/-------------------------------------------------------------------------\n\t\/\/ ● 结束处理\n\t\/\/-------------------------------------------------------------------------\n\tvoid terminate() {\n\t\tprintf(\"Terminate ASM76 environment\\n\");\n\t}\n}\n<commit_msg>Optimize printf -> puts — just one useless step<commit_after>\/\/=============================================================================\n\/\/ ■ ASM76\/ASM76.cpp\n\/\/-----------------------------------------------------------------------------\n\/\/   全局变量与实用函数。\n\/\/=============================================================================\n\n#include \"ASM76.hpp\"\n\nnamespace ASM76 {\n\t\/\/-------------------------------------------------------------------------\n\t\/\/ ● 全局变量\n\t\/\/-------------------------------------------------------------------------\n\t\/\/-------------------------------------------------------------------------\n\t\/\/ ● 初始化\n\t\/\/-------------------------------------------------------------------------\n\tvoid init() {\n\t\tputs(\"Init ASM76 environment\");\n\t\t\/\/ nothing to do here now\n\t}\n\t\/\/-------------------------------------------------------------------------\n\t\/\/ ● 结束处理\n\t\/\/-------------------------------------------------------------------------\n\tvoid terminate() {\n\t\tputs(\"Terminate ASM76 environment\");\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <yuni\/yuni.h>\n#include \"details\/pass\/build-ast-to-ir\/scope.h\"\n#include \"details\/utils\/check-for-valid-identifier-name.h\"\n\nusing namespace Yuni;\n\n\n\n\nnamespace Nany\n{\nnamespace IR\n{\nnamespace Producer\n{\n\n\n\tbool Scope::visitASTExprIn(const AST::Node& node, LVID& localvar, ShortString128& elementname)\n\t{\n\t\t\/\/ lvid representing the input container\n\t\tAST::Node* container = nullptr;\n\t\tAST::Node* predicate = nullptr;\n\n\t\tfor (auto& childptr: node.children)\n\t\t{\n\t\t\tauto& child = *childptr;\n\t\t\tswitch (child.rule)\n\t\t\t{\n\t\t\t\tcase AST::rgInVars:\n\t\t\t\t{\n\t\t\t\t\tif (unlikely(child.children.size() != 1))\n\t\t\t\t\t\treturn error(child) << \"only one cursor name is allowed in views\";\n\t\t\t\t\tauto& identifier = child.firstChild();\n\t\t\t\t\tif (unlikely(identifier.rule != AST::rgIdentifier))\n\t\t\t\t\t\treturn ICE(identifier) << \"identifier expected\";\n\n\t\t\t\t\tif (unlikely(not checkForValidIdentifierName(context.report, child, identifier.text, false)))\n\t\t\t\t\t\treturn false;\n\n\t\t\t\t\telementname = identifier.text;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tcase AST::rgInContainer:\n\t\t\t\t{\n\t\t\t\t\tif (unlikely(child.children.size() != 1))\n\t\t\t\t\t\treturn ICE(child) << \"invalid expression\";\n\n\t\t\t\t\tcontainer = &child.firstChild();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tcase AST::rgInPredicate:\n\t\t\t\t{\n\t\t\t\t\tif (unlikely(child.children.size() != 1))\n\t\t\t\t\t\treturn ICE(child) << \"invalid predicate expr\";\n\t\t\t\t\tauto& expr = child.firstChild();\n\t\t\t\t\tif (unlikely(expr.rule != AST::rgExpr))\n\t\t\t\t\t\treturn ICE(expr) << \"invalid node type for predicate\";\n\n\t\t\t\t\twarning(expr) << \"predicates in views are not fully implemented\";\n\t\t\t\t\tpredicate = &expr;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t\treturn ICEUnexpectedNode(child, \"[expr\/in]\");\n\t\t\t}\n\t\t}\n\n\t\tif (unlikely(!container))\n\t\t\treturn ICE(node) << \"invalid view container expr\";\n\n\t\tif (!context.reuse.inset.node)\n\t\t\tcontext.prepareReuseForIn();\n\n\t\tcontext.reuse.inset.container->children.clear();\n\t\tcontext.reuse.inset.container->children.push_back(container);\n\t\tcontext.reuse.inset.viewname->text = \"^view^default\";\n\n\t\tif (elementname.empty())\n\t\t\telementname << \"%vr\" << nextvar();\n\t\tcontext.reuse.inset.elementname->text = elementname;\n\n\t\tif (!predicate)\n\t\t\tpredicate = AST::Node::Ptr::WeakPointer(context.reuse.inset.premadeAlwaysTrue);\n\t\tcontext.reuse.inset.predicate->children.clear();\n\t\tcontext.reuse.inset.predicate->children.push_back(predicate);\n\n\t\temitDebugpos(node);\n\t\treturn visitASTExpr(*context.reuse.inset.node, localvar);\n\t}\n\n\n\tbool Scope::visitASTExprIn(const AST::Node& node, LVID& localvar)\n\t{\n\t\t\/\/ Name of the target ref for each element in the container (ignored here)\n\t\tShortString128 elementname;\n\t\treturn visitASTExprIn(node, localvar, elementname);\n\t}\n\n\n\n\n} \/\/ namespace Producer\n} \/\/ namespace IR\n} \/\/ namespace Nany\n<commit_msg>removed warning 'predicates in views are not fully implemented'<commit_after>#include <yuni\/yuni.h>\n#include \"details\/pass\/build-ast-to-ir\/scope.h\"\n#include \"details\/utils\/check-for-valid-identifier-name.h\"\n\nusing namespace Yuni;\n\n\n\n\nnamespace Nany\n{\nnamespace IR\n{\nnamespace Producer\n{\n\n\n\tbool Scope::visitASTExprIn(const AST::Node& node, LVID& localvar, ShortString128& elementname)\n\t{\n\t\t\/\/ lvid representing the input container\n\t\tAST::Node* container = nullptr;\n\t\tAST::Node* predicate = nullptr;\n\n\t\tfor (auto& childptr: node.children)\n\t\t{\n\t\t\tauto& child = *childptr;\n\t\t\tswitch (child.rule)\n\t\t\t{\n\t\t\t\tcase AST::rgInVars:\n\t\t\t\t{\n\t\t\t\t\tif (unlikely(child.children.size() != 1))\n\t\t\t\t\t\treturn error(child) << \"only one cursor name is allowed in views\";\n\t\t\t\t\tauto& identifier = child.firstChild();\n\t\t\t\t\tif (unlikely(identifier.rule != AST::rgIdentifier))\n\t\t\t\t\t\treturn ICE(identifier) << \"identifier expected\";\n\n\t\t\t\t\tif (unlikely(not checkForValidIdentifierName(context.report, child, identifier.text, false)))\n\t\t\t\t\t\treturn false;\n\n\t\t\t\t\telementname = identifier.text;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tcase AST::rgInContainer:\n\t\t\t\t{\n\t\t\t\t\tif (unlikely(child.children.size() != 1))\n\t\t\t\t\t\treturn ICE(child) << \"invalid expression\";\n\n\t\t\t\t\tcontainer = &child.firstChild();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tcase AST::rgInPredicate:\n\t\t\t\t{\n\t\t\t\t\tif (unlikely(child.children.size() != 1))\n\t\t\t\t\t\treturn ICE(child) << \"invalid predicate expr\";\n\t\t\t\t\tauto& expr = child.firstChild();\n\t\t\t\t\tif (unlikely(expr.rule != AST::rgExpr))\n\t\t\t\t\t\treturn ICE(expr) << \"invalid node type for predicate\";\n\n\t\t\t\t\tpredicate = &expr;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t\treturn ICEUnexpectedNode(child, \"[expr\/in]\");\n\t\t\t}\n\t\t}\n\n\t\tif (unlikely(!container))\n\t\t\treturn ICE(node) << \"invalid view container expr\";\n\n\t\tif (!context.reuse.inset.node)\n\t\t\tcontext.prepareReuseForIn();\n\n\t\tcontext.reuse.inset.container->children.clear();\n\t\tcontext.reuse.inset.container->children.push_back(container);\n\t\tcontext.reuse.inset.viewname->text = \"^view^default\";\n\n\t\tif (elementname.empty())\n\t\t\telementname << \"%vr\" << nextvar();\n\t\tcontext.reuse.inset.elementname->text = elementname;\n\n\t\tif (!predicate)\n\t\t\tpredicate = AST::Node::Ptr::WeakPointer(context.reuse.inset.premadeAlwaysTrue);\n\t\tcontext.reuse.inset.predicate->children.clear();\n\t\tcontext.reuse.inset.predicate->children.push_back(predicate);\n\n\t\temitDebugpos(node);\n\t\treturn visitASTExpr(*context.reuse.inset.node, localvar);\n\t}\n\n\n\tbool Scope::visitASTExprIn(const AST::Node& node, LVID& localvar)\n\t{\n\t\t\/\/ Name of the target ref for each element in the container (ignored here)\n\t\tShortString128 elementname;\n\t\treturn visitASTExprIn(node, localvar, elementname);\n\t}\n\n\n\n\n} \/\/ namespace Producer\n} \/\/ namespace IR\n} \/\/ namespace Nany\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2020-present 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#include \"service\/raft\/raft_sys_table_storage.hh\"\n\n#include \"cql3\/untyped_result_set.hh\"\n#include \"db\/system_keyspace.hh\"\n#include \"utils\/UUID.hh\"\n\n#include \"serializer.hh\"\n#include \"idl\/raft.dist.hh\"\n#include \"serializer_impl.hh\"\n#include \"idl\/raft.dist.impl.hh\"\n\n#include \"cql3\/statements\/batch_statement.hh\"\n#include \"cql3\/statements\/modification_statement.hh\"\n#include \"cql3\/query_processor.hh\"\n\n#include <seastar\/core\/loop.hh>\n#include <seastar\/core\/coroutine.hh>\n\nnamespace service {\n\nraft_sys_table_storage::raft_sys_table_storage(cql3::query_processor& qp, raft::group_id gid)\n    : _group_id(std::move(gid))\n    , _qp(qp)\n    , _dummy_query_state(service::client_state::for_internal_calls(), empty_service_permit())\n    , _pending_op_fut(make_ready_future<>())\n{\n    static const auto store_cql = format(\"INSERT INTO system.{} (group_id, term, \\\"index\\\", data) VALUES (?, ?, ?, ?)\",\n        db::system_keyspace::RAFT);\n    auto prepared_stmt_ptr = _qp.prepare_internal(store_cql);\n    shared_ptr<cql3::cql_statement> cql_stmt = prepared_stmt_ptr->statement;\n    _store_entry_stmt = dynamic_pointer_cast<cql3::statements::modification_statement>(cql_stmt);\n}\n\nfuture<> raft_sys_table_storage::store_term_and_vote(raft::term_t term, raft::server_id vote) {\n    return execute_with_linearization_point([this, term, vote] {\n        static const auto store_cql = format(\"INSERT INTO system.{} (group_id, vote_term, vote) VALUES (?, ?, ?)\",\n            db::system_keyspace::RAFT);\n        return _qp.execute_internal(\n            store_cql,\n            {_group_id.id, int64_t(term), vote.id}).discard_result();\n    });\n}\n\nfuture<std::pair<raft::term_t, raft::server_id>> raft_sys_table_storage::load_term_and_vote() {\n    static const auto load_cql = format(\"SELECT vote_term, vote FROM system.{} WHERE group_id = ?\", db::system_keyspace::RAFT);\n    ::shared_ptr<cql3::untyped_result_set> rs = co_await _qp.execute_internal(load_cql, {_group_id.id});\n    if (rs->empty()) {\n        co_return std::pair(raft::term_t(), raft::server_id());\n    }\n    const auto& static_row = rs->one();\n    raft::term_t vote_term = raft::term_t(static_row.get_or<int64_t>(\"vote_term\", raft::term_t{}));\n    raft::server_id vote{static_row.get_or<utils::UUID>(\"vote\", raft::server_id{}.id)};\n    co_return std::pair(vote_term, vote);\n}\n\nfuture<raft::log_entries> raft_sys_table_storage::load_log() {\n    static const auto load_cql = format(\"SELECT term, \\\"index\\\", data FROM system.{} WHERE group_id = ?\", db::system_keyspace::RAFT);\n    ::shared_ptr<cql3::untyped_result_set> rs = co_await _qp.execute_internal(load_cql, {_group_id.id});\n\n    raft::log_entries log;\n    for (const cql3::untyped_result_set_row& row : *rs) {\n        if (!row.has(\"data\")) {\n            \/\/ The partition only contains static cells, the log\n            \/\/ is empty.\n            break;\n        }\n        raft::term_t term = raft::term_t(row.get_as<int64_t>(\"term\"));\n        raft::index_t idx = raft::index_t(row.get_as<int64_t>(\"index\"));\n        auto raw_data = row.get_blob(\"data\");\n        auto in = ser::as_input_stream(raw_data);\n        using data_variant_type = decltype(raft::log_entry::data);\n        data_variant_type data = ser::deserialize(in, boost::type<data_variant_type>());\n\n        log.emplace_back(make_lw_shared<const raft::log_entry>(\n            raft::log_entry{.term = term, .idx = idx, .data = std::move(data)}));\n\n        co_await make_ready_future<>();\n    }\n    co_return log;\n}\n\nfuture<raft::snapshot> raft_sys_table_storage::load_snapshot() {\n    static const auto load_id_cql = format(\"SELECT snapshot_id FROM system.{} WHERE group_id = ?\", db::system_keyspace::RAFT);\n    ::shared_ptr<cql3::untyped_result_set> id_rs = co_await _qp.execute_internal(load_id_cql, {_group_id.id});\n    if (id_rs->empty() || !id_rs->one().has(\"snapshot_id\")) {\n        co_return raft::snapshot();\n    }\n    const auto& id_row = id_rs->one(); \/\/ should be only one row since snapshot_id column is static\n    utils::UUID snapshot_id = id_row.get_as<utils::UUID>(\"snapshot_id\");\n\n    static const auto load_snp_info_cql = format(\"SELECT idx, term, config FROM system.{} WHERE group_id = ? AND id = ?\",\n        db::system_keyspace::RAFT_SNAPSHOTS);\n    ::shared_ptr<cql3::untyped_result_set> snp_rs = co_await _qp.execute_internal(load_snp_info_cql, {_group_id.id, snapshot_id});\n    const auto& snp_row = snp_rs->one(); \/\/ should be only one matching row for a given snapshot id\n    auto snp_cfg = snp_row.get_blob(\"config\");\n    auto in = ser::as_input_stream(snp_cfg);\n\n    raft::snapshot s{\n        .idx = raft::index_t(snp_row.get_as<int64_t>(\"idx\")),\n        .term = raft::term_t(snp_row.get_as<int64_t>(\"term\")),\n        .config = ser::deserialize(in, boost::type<raft::configuration>()),\n        .id = raft::snapshot_id(snapshot_id)};\n    co_return s;\n}\n\nfuture<> raft_sys_table_storage::store_snapshot(const raft::snapshot& snap, size_t preserve_log_entries) {\n    \/\/ TODO: check that snap.idx refers to an already persisted entry\n    return execute_with_linearization_point([this, &snap, preserve_log_entries] () -> future<> {\n        static const auto store_snp_cql = format(\"INSERT INTO system.{} (group_id, id, idx, term, config) VALUES (?, ?, ?, ?, ?)\",\n            db::system_keyspace::RAFT_SNAPSHOTS);\n        co_await _qp.execute_internal(\n            store_snp_cql,\n            {_group_id.id, snap.id.id, int64_t(snap.idx), int64_t(snap.term), data_value(ser::serialize_to_buffer<bytes>(snap.config))}\n        );\n        \/\/ Also update the latest snapshot id in `system.raft` table\n        static const auto store_latest_id_cql = format(\"INSERT INTO system.{} (group_id, snapshot_id) VALUES (?, ?)\",\n            db::system_keyspace::RAFT);\n        co_await _qp.execute_internal(\n            store_latest_id_cql,\n            {_group_id.id, snap.id.id}\n        );\n        if (preserve_log_entries > snap.idx) {\n            co_return;\n        }\n        \/\/ TODO: make truncation and snapshot update in `system.raft` atomic\n        co_await truncate_log_tail(raft::index_t(static_cast<uint64_t>(snap.idx) - static_cast<uint64_t>(preserve_log_entries)));\n    });\n}\n\nfuture<> raft_sys_table_storage::do_store_log_entries(const std::vector<raft::log_entry_ptr>& entries) {\n    if (entries.empty()) {\n        co_return;\n    }\n    std::vector<cql3::statements::batch_statement::single_statement> batch_stmts;\n    \/\/ statement values that can be allocated at once (one contiguous allocation)\n    std::vector<std::vector<cql3::raw_value>> stmt_values;\n    \/\/ fragmented storage for log_entries data\n    std::vector<fragmented_temporary_buffer> stmt_data_views;\n    \/\/ statement value views -- required for `query_options` to consume `fragmented_temporary_buffer::view`\n    std::vector<std::vector<cql3::raw_value_view>> stmt_value_views;\n    const size_t entries_size = entries.size();\n    batch_stmts.reserve(entries_size);\n    stmt_values.reserve(entries_size);\n    stmt_data_views.reserve(entries_size);\n    stmt_value_views.reserve(entries_size);\n\n    for (const raft::log_entry_ptr& eptr : entries) {\n        batch_stmts.emplace_back(cql3::statements::batch_statement::single_statement(_store_entry_stmt, false));\n\n        auto data_tmp_buf = fragmented_temporary_buffer::allocate_to_fit(ser::get_sizeof(eptr->data));\n        auto data_out_str = data_tmp_buf.get_ostream();\n        ser::serialize(data_out_str, eptr->data);\n\n        \/\/ don't include serialized \"data\" here since it will require to linearize the stream\n        std::vector<cql3::raw_value> single_stmt_values = {\n            cql3::raw_value::make_value(timeuuid_type->decompose(_group_id.id)),\n            cql3::raw_value::make_value(long_type->decompose(int64_t(eptr->term))),\n            cql3::raw_value::make_value(long_type->decompose(int64_t(eptr->idx)))\n        };\n        stmt_values.emplace_back(std::move(single_stmt_values));\n        stmt_data_views.emplace_back(std::move(data_tmp_buf));\n\n        \/\/ allocate value views\n        std::vector<cql3::raw_value_view> value_views;\n        value_views.reserve(4); \/\/ 4 is the number of required values for the insertion query \n        for (const cql3::raw_value& raw : stmt_values.back()) {\n            value_views.push_back(raw.to_view());\n        }\n        value_views.emplace_back(\n            cql3::raw_value_view::make_value(\n                fragmented_temporary_buffer::view(stmt_data_views.back())));\n        stmt_value_views.emplace_back(std::move(value_views));\n\n        co_await make_ready_future<>();\n    }\n\n    auto batch_options = cql3::query_options::make_batch_options(\n        cql3::query_options(\n            cql3::default_cql_config,\n            db::consistency_level::ONE,\n            std::nullopt,\n            std::vector<cql3::raw_value>{},\n            false,\n            cql3::query_options::specific_options::DEFAULT,\n            cql_serialization_format::latest()),\n        std::move(stmt_value_views));\n\n    cql3::statements::batch_statement batch(\n        cql3::statements::batch_statement::type::UNLOGGED,\n        std::move(batch_stmts),\n        cql3::attributes::none(),\n        _qp.get_cql_stats());\n\n    co_await batch.execute(_qp, _dummy_query_state, batch_options);\n}\n\nfuture<> raft_sys_table_storage::store_log_entries(const std::vector<raft::log_entry_ptr>& entries) {\n    return execute_with_linearization_point([this, &entries] {\n        return do_store_log_entries(entries);\n    });\n}\n\nfuture<> raft_sys_table_storage::truncate_log(raft::index_t idx) {\n    return execute_with_linearization_point([this, idx] {\n        static const auto truncate_cql = format(\"DELETE FROM system.{} WHERE group_id = ? AND \\\"index\\\" >= ?\",\n            db::system_keyspace::RAFT); \n        return _qp.execute_internal(truncate_cql, {_group_id.id, int64_t(idx)}).discard_result();\n    });\n}\n\nfuture<> raft_sys_table_storage::abort() {\n    \/\/ wait for pending write requests to complete.\n    \/\/ TODO: should we wait for all kinds of requests?\n    return std::move(_pending_op_fut);\n}\n\nfuture<> raft_sys_table_storage::truncate_log_tail(raft::index_t idx) {\n    static const auto truncate_cql = format(\"DELETE FROM system.{} WHERE group_id = ? AND \\\"index\\\" <= ?\", db::system_keyspace::RAFT);\n    return _qp.execute_internal(truncate_cql, {_group_id.id, int64_t(idx)}).discard_result();\n}\n\nfuture<> raft_sys_table_storage::execute_with_linearization_point(std::function<future<>()> f) {\n    promise<> task_promise;\n    auto pending_fut = std::exchange(_pending_op_fut, task_promise.get_future());\n    co_await std::move(pending_fut);\n    try {\n        co_await f();\n        task_promise.set_value();\n    } catch (...) {\n        task_promise.set_exception(std::current_exception());\n        throw;\n    }\n}\n\n} \/\/ end of namespace service\n<commit_msg>raft: raft_sys_table_storage: fix broken `load_snapshot` and `load_term_and_vote`<commit_after>\/*\n * Copyright (C) 2020-present 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#include \"service\/raft\/raft_sys_table_storage.hh\"\n\n#include \"cql3\/untyped_result_set.hh\"\n#include \"db\/system_keyspace.hh\"\n#include \"utils\/UUID.hh\"\n\n#include \"serializer.hh\"\n#include \"idl\/raft.dist.hh\"\n#include \"serializer_impl.hh\"\n#include \"idl\/raft.dist.impl.hh\"\n\n#include \"cql3\/statements\/batch_statement.hh\"\n#include \"cql3\/statements\/modification_statement.hh\"\n#include \"cql3\/query_processor.hh\"\n\n#include <seastar\/core\/loop.hh>\n#include <seastar\/core\/coroutine.hh>\n\nnamespace service {\n\nraft_sys_table_storage::raft_sys_table_storage(cql3::query_processor& qp, raft::group_id gid)\n    : _group_id(std::move(gid))\n    , _qp(qp)\n    , _dummy_query_state(service::client_state::for_internal_calls(), empty_service_permit())\n    , _pending_op_fut(make_ready_future<>())\n{\n    static const auto store_cql = format(\"INSERT INTO system.{} (group_id, term, \\\"index\\\", data) VALUES (?, ?, ?, ?)\",\n        db::system_keyspace::RAFT);\n    auto prepared_stmt_ptr = _qp.prepare_internal(store_cql);\n    shared_ptr<cql3::cql_statement> cql_stmt = prepared_stmt_ptr->statement;\n    _store_entry_stmt = dynamic_pointer_cast<cql3::statements::modification_statement>(cql_stmt);\n}\n\nfuture<> raft_sys_table_storage::store_term_and_vote(raft::term_t term, raft::server_id vote) {\n    return execute_with_linearization_point([this, term, vote] {\n        static const auto store_cql = format(\"INSERT INTO system.{} (group_id, vote_term, vote) VALUES (?, ?, ?)\",\n            db::system_keyspace::RAFT);\n        return _qp.execute_internal(\n            store_cql,\n            {_group_id.id, int64_t(term), vote.id}).discard_result();\n    });\n}\n\nfuture<std::pair<raft::term_t, raft::server_id>> raft_sys_table_storage::load_term_and_vote() {\n    static const auto load_cql = format(\"SELECT vote_term, vote FROM system.{} WHERE group_id = ? LIMIT 1\", db::system_keyspace::RAFT);\n    ::shared_ptr<cql3::untyped_result_set> rs = co_await _qp.execute_internal(load_cql, {_group_id.id});\n    if (rs->empty()) {\n        co_return std::pair(raft::term_t(), raft::server_id());\n    }\n    const auto& static_row = rs->one();\n    raft::term_t vote_term = raft::term_t(static_row.get_or<int64_t>(\"vote_term\", raft::term_t{}));\n    raft::server_id vote{static_row.get_or<utils::UUID>(\"vote\", raft::server_id{}.id)};\n    co_return std::pair(vote_term, vote);\n}\n\nfuture<raft::log_entries> raft_sys_table_storage::load_log() {\n    static const auto load_cql = format(\"SELECT term, \\\"index\\\", data FROM system.{} WHERE group_id = ?\", db::system_keyspace::RAFT);\n    ::shared_ptr<cql3::untyped_result_set> rs = co_await _qp.execute_internal(load_cql, {_group_id.id});\n\n    raft::log_entries log;\n    for (const cql3::untyped_result_set_row& row : *rs) {\n        if (!row.has(\"data\")) {\n            \/\/ The partition only contains static cells, the log\n            \/\/ is empty.\n            break;\n        }\n        raft::term_t term = raft::term_t(row.get_as<int64_t>(\"term\"));\n        raft::index_t idx = raft::index_t(row.get_as<int64_t>(\"index\"));\n        auto raw_data = row.get_blob(\"data\");\n        auto in = ser::as_input_stream(raw_data);\n        using data_variant_type = decltype(raft::log_entry::data);\n        data_variant_type data = ser::deserialize(in, boost::type<data_variant_type>());\n\n        log.emplace_back(make_lw_shared<const raft::log_entry>(\n            raft::log_entry{.term = term, .idx = idx, .data = std::move(data)}));\n\n        co_await make_ready_future<>();\n    }\n    co_return log;\n}\n\nfuture<raft::snapshot> raft_sys_table_storage::load_snapshot() {\n    static const auto load_id_cql = format(\"SELECT snapshot_id FROM system.{} WHERE group_id = ? LIMIT 1\", db::system_keyspace::RAFT);\n    ::shared_ptr<cql3::untyped_result_set> id_rs = co_await _qp.execute_internal(load_id_cql, {_group_id.id});\n    if (id_rs->empty() || !id_rs->one().has(\"snapshot_id\")) {\n        co_return raft::snapshot();\n    }\n    const auto& id_row = id_rs->one(); \/\/ should be only one row since snapshot_id column is static\n    utils::UUID snapshot_id = id_row.get_as<utils::UUID>(\"snapshot_id\");\n\n    static const auto load_snp_info_cql = format(\"SELECT idx, term, config FROM system.{} WHERE group_id = ? AND id = ?\",\n        db::system_keyspace::RAFT_SNAPSHOTS);\n    ::shared_ptr<cql3::untyped_result_set> snp_rs = co_await _qp.execute_internal(load_snp_info_cql, {_group_id.id, snapshot_id});\n    const auto& snp_row = snp_rs->one(); \/\/ should be only one matching row for a given snapshot id\n    auto snp_cfg = snp_row.get_blob(\"config\");\n    auto in = ser::as_input_stream(snp_cfg);\n\n    raft::snapshot s{\n        .idx = raft::index_t(snp_row.get_as<int64_t>(\"idx\")),\n        .term = raft::term_t(snp_row.get_as<int64_t>(\"term\")),\n        .config = ser::deserialize(in, boost::type<raft::configuration>()),\n        .id = raft::snapshot_id(snapshot_id)};\n    co_return s;\n}\n\nfuture<> raft_sys_table_storage::store_snapshot(const raft::snapshot& snap, size_t preserve_log_entries) {\n    \/\/ TODO: check that snap.idx refers to an already persisted entry\n    return execute_with_linearization_point([this, &snap, preserve_log_entries] () -> future<> {\n        static const auto store_snp_cql = format(\"INSERT INTO system.{} (group_id, id, idx, term, config) VALUES (?, ?, ?, ?, ?)\",\n            db::system_keyspace::RAFT_SNAPSHOTS);\n        co_await _qp.execute_internal(\n            store_snp_cql,\n            {_group_id.id, snap.id.id, int64_t(snap.idx), int64_t(snap.term), data_value(ser::serialize_to_buffer<bytes>(snap.config))}\n        );\n        \/\/ Also update the latest snapshot id in `system.raft` table\n        static const auto store_latest_id_cql = format(\"INSERT INTO system.{} (group_id, snapshot_id) VALUES (?, ?)\",\n            db::system_keyspace::RAFT);\n        co_await _qp.execute_internal(\n            store_latest_id_cql,\n            {_group_id.id, snap.id.id}\n        );\n        if (preserve_log_entries > snap.idx) {\n            co_return;\n        }\n        \/\/ TODO: make truncation and snapshot update in `system.raft` atomic\n        co_await truncate_log_tail(raft::index_t(static_cast<uint64_t>(snap.idx) - static_cast<uint64_t>(preserve_log_entries)));\n    });\n}\n\nfuture<> raft_sys_table_storage::do_store_log_entries(const std::vector<raft::log_entry_ptr>& entries) {\n    if (entries.empty()) {\n        co_return;\n    }\n    std::vector<cql3::statements::batch_statement::single_statement> batch_stmts;\n    \/\/ statement values that can be allocated at once (one contiguous allocation)\n    std::vector<std::vector<cql3::raw_value>> stmt_values;\n    \/\/ fragmented storage for log_entries data\n    std::vector<fragmented_temporary_buffer> stmt_data_views;\n    \/\/ statement value views -- required for `query_options` to consume `fragmented_temporary_buffer::view`\n    std::vector<std::vector<cql3::raw_value_view>> stmt_value_views;\n    const size_t entries_size = entries.size();\n    batch_stmts.reserve(entries_size);\n    stmt_values.reserve(entries_size);\n    stmt_data_views.reserve(entries_size);\n    stmt_value_views.reserve(entries_size);\n\n    for (const raft::log_entry_ptr& eptr : entries) {\n        batch_stmts.emplace_back(cql3::statements::batch_statement::single_statement(_store_entry_stmt, false));\n\n        auto data_tmp_buf = fragmented_temporary_buffer::allocate_to_fit(ser::get_sizeof(eptr->data));\n        auto data_out_str = data_tmp_buf.get_ostream();\n        ser::serialize(data_out_str, eptr->data);\n\n        \/\/ don't include serialized \"data\" here since it will require to linearize the stream\n        std::vector<cql3::raw_value> single_stmt_values = {\n            cql3::raw_value::make_value(timeuuid_type->decompose(_group_id.id)),\n            cql3::raw_value::make_value(long_type->decompose(int64_t(eptr->term))),\n            cql3::raw_value::make_value(long_type->decompose(int64_t(eptr->idx)))\n        };\n        stmt_values.emplace_back(std::move(single_stmt_values));\n        stmt_data_views.emplace_back(std::move(data_tmp_buf));\n\n        \/\/ allocate value views\n        std::vector<cql3::raw_value_view> value_views;\n        value_views.reserve(4); \/\/ 4 is the number of required values for the insertion query \n        for (const cql3::raw_value& raw : stmt_values.back()) {\n            value_views.push_back(raw.to_view());\n        }\n        value_views.emplace_back(\n            cql3::raw_value_view::make_value(\n                fragmented_temporary_buffer::view(stmt_data_views.back())));\n        stmt_value_views.emplace_back(std::move(value_views));\n\n        co_await make_ready_future<>();\n    }\n\n    auto batch_options = cql3::query_options::make_batch_options(\n        cql3::query_options(\n            cql3::default_cql_config,\n            db::consistency_level::ONE,\n            std::nullopt,\n            std::vector<cql3::raw_value>{},\n            false,\n            cql3::query_options::specific_options::DEFAULT,\n            cql_serialization_format::latest()),\n        std::move(stmt_value_views));\n\n    cql3::statements::batch_statement batch(\n        cql3::statements::batch_statement::type::UNLOGGED,\n        std::move(batch_stmts),\n        cql3::attributes::none(),\n        _qp.get_cql_stats());\n\n    co_await batch.execute(_qp, _dummy_query_state, batch_options);\n}\n\nfuture<> raft_sys_table_storage::store_log_entries(const std::vector<raft::log_entry_ptr>& entries) {\n    return execute_with_linearization_point([this, &entries] {\n        return do_store_log_entries(entries);\n    });\n}\n\nfuture<> raft_sys_table_storage::truncate_log(raft::index_t idx) {\n    return execute_with_linearization_point([this, idx] {\n        static const auto truncate_cql = format(\"DELETE FROM system.{} WHERE group_id = ? AND \\\"index\\\" >= ?\",\n            db::system_keyspace::RAFT); \n        return _qp.execute_internal(truncate_cql, {_group_id.id, int64_t(idx)}).discard_result();\n    });\n}\n\nfuture<> raft_sys_table_storage::abort() {\n    \/\/ wait for pending write requests to complete.\n    \/\/ TODO: should we wait for all kinds of requests?\n    return std::move(_pending_op_fut);\n}\n\nfuture<> raft_sys_table_storage::truncate_log_tail(raft::index_t idx) {\n    static const auto truncate_cql = format(\"DELETE FROM system.{} WHERE group_id = ? AND \\\"index\\\" <= ?\", db::system_keyspace::RAFT);\n    return _qp.execute_internal(truncate_cql, {_group_id.id, int64_t(idx)}).discard_result();\n}\n\nfuture<> raft_sys_table_storage::execute_with_linearization_point(std::function<future<>()> f) {\n    promise<> task_promise;\n    auto pending_fut = std::exchange(_pending_op_fut, task_promise.get_future());\n    co_await std::move(pending_fut);\n    try {\n        co_await f();\n        task_promise.set_value();\n    } catch (...) {\n        task_promise.set_exception(std::current_exception());\n        throw;\n    }\n}\n\n} \/\/ end of namespace service\n<|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 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_FEATURES_IMPL_SHOT_LRF_OMP_H_\n#define PCL_FEATURES_IMPL_SHOT_LRF_OMP_H_\n\n#include <utility>\n#include <pcl\/features\/shot_lrf_omp.h>\n#include <pcl\/features\/shot_lrf.h>\n\ntemplate<typename PointInT, typename PointOutT>\nvoid\npcl::SHOTLocalReferenceFrameEstimationOMP<PointInT, PointOutT>::computeFeature (PointCloudOut &output)\n{\n  \/\/check whether used with search radius or search k-neighbors\n  if (this->getKSearch () != 0)\n  {\n    PCL_ERROR(\n        \"[pcl::%s::computeFeature] Error! Search method set to k-neighborhood. Call setKSearch(0) and setRadiusSearch( radius ) to use this class.\\n\",\n        getClassName().c_str ());\n    return;\n  }\n  tree_->setSortedResults (true);\n\n#pragma omp parallel for num_threads(threads_)\n  for (size_t i = 0; i < indices_->size (); ++i)\n  {\n    \/\/ point result\n    Eigen::Matrix3f rf;\n    PointOutT& output_rf = output[i];\n\n    \/\/output_rf.confidence = getLocalRF ((*indices_)[i], rf);\n    \/\/if (output_rf.confidence == std::numeric_limits<float>::max ())\n\n    std::vector<int> n_indices;\n    std::vector<float> n_sqr_distances;\n    searchForNeighbors ((*indices_)[i], search_parameter_, n_indices, n_sqr_distances);\n    if (getLocalRF ((*indices_)[i], rf) == std::numeric_limits<float>::max ())\n    {\n      output.is_dense = false;\n    }\n\n    output_rf.x_axis.getNormalVector3fMap () = rf.row (0);\n    output_rf.y_axis.getNormalVector3fMap () = rf.row (1);\n    output_rf.z_axis.getNormalVector3fMap () = rf.row (2);\n  }\n\n}\n\ntemplate<typename PointInT, typename PointOutT>\nvoid\npcl::SHOTLocalReferenceFrameEstimationOMP<PointInT, PointOutT>::computeFeatureEigen (pcl::PointCloud<Eigen::MatrixXf> &output)\n{\n  \/\/check whether used with search radius or search k-neighbors\n  if (this->getKSearch () != 0)\n  {\n    PCL_ERROR(\n        \"[pcl::%s::computeFeatureEigen] Error! Search method set to k-neighborhood. Call setKSearch(0) and setRadiusSearch( radius ) to use this class.\\n\",\n        getClassName().c_str ());\n    return;\n  }\n  tree_->setSortedResults (true);\n\n  \/\/ Set up the output channels\n  output.channels[\"shot_lrf\"].name = \"shot_lrf\";\n  output.channels[\"shot_lrf\"].offset = 0;\n  output.channels[\"shot_lrf\"].size = 4;\n  output.channels[\"shot_lrf\"].count = 9;\n  output.channels[\"shot_lrf\"].datatype = sensor_msgs::PointField::FLOAT32;\n\n  \/\/output.points.resize (indices_->size (), 10);\n  output.points.resize (indices_->size (), 9);\n\n#pragma omp parallel for num_threads(threads_)\n  for (size_t i = 0; i < indices_->size (); ++i)\n  {\n    \/\/ point result\n    Eigen::Matrix3f rf;\n\n    \/\/output.points (i, 9) = getLocalRF ((*indices_)[i], rf);\n    \/\/if (output.points (i, 9) == std::numeric_limits<float>::max ())\n    if (getLocalRF ((*indices_)[i], rf) == std::numeric_limits<float>::max ())\n    {\n      output.is_dense = false;\n    }\n\n    output.points.block<1, 3> (i, 0) = rf.row (0);\n    output.points.block<1, 3> (i, 3) = rf.row (1);\n    output.points.block<1, 3> (i, 6) = rf.row (2);\n  }\n\n}\n\n#define PCL_INSTANTIATE_SHOTLocalReferenceFrameEstimationOMP(T,OutT) template class PCL_EXPORTS pcl::SHOTLocalReferenceFrameEstimationOMP<T,OutT>;\n\n#endif    \/\/ PCL_FEATURES_IMPL_SHOT_LRF_H_\n<commit_msg>Added check to ensure that num_threads is a positive integer, otherwise omp raises an out of memory error. This should fix the test errors for features. However, does not fix the compilation issue in Windows. Visual Studio compiler has a bug:<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 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_FEATURES_IMPL_SHOT_LRF_OMP_H_\n#define PCL_FEATURES_IMPL_SHOT_LRF_OMP_H_\n\n#include <utility>\n#include <pcl\/features\/shot_lrf_omp.h>\n#include <pcl\/features\/shot_lrf.h>\n\ntemplate<typename PointInT, typename PointOutT>\nvoid\npcl::SHOTLocalReferenceFrameEstimationOMP<PointInT, PointOutT>::computeFeature (PointCloudOut &output)\n{\n  if (threads_ < 0)\n    threads_ = 1;\n\n  \/\/check whether used with search radius or search k-neighbors\n  if (this->getKSearch () != 0)\n  {\n    PCL_ERROR(\n        \"[pcl::%s::computeFeature] Error! Search method set to k-neighborhood. Call setKSearch(0) and setRadiusSearch( radius ) to use this class.\\n\",\n        getClassName().c_str ());\n    return;\n  }\n  tree_->setSortedResults (true);\n\n#pragma omp parallel for num_threads(threads_)\n  for (size_t i = 0; i < indices_->size (); ++i)\n  {\n    \/\/ point result\n    Eigen::Matrix3f rf;\n    PointOutT& output_rf = output[i];\n\n    \/\/output_rf.confidence = getLocalRF ((*indices_)[i], rf);\n    \/\/if (output_rf.confidence == std::numeric_limits<float>::max ())\n\n    std::vector<int> n_indices;\n    std::vector<float> n_sqr_distances;\n    searchForNeighbors ((*indices_)[i], search_parameter_, n_indices, n_sqr_distances);\n    if (getLocalRF ((*indices_)[i], rf) == std::numeric_limits<float>::max ())\n    {\n      output.is_dense = false;\n    }\n\n    output_rf.x_axis.getNormalVector3fMap () = rf.row (0);\n    output_rf.y_axis.getNormalVector3fMap () = rf.row (1);\n    output_rf.z_axis.getNormalVector3fMap () = rf.row (2);\n  }\n\n}\n\ntemplate<typename PointInT, typename PointOutT>\nvoid\npcl::SHOTLocalReferenceFrameEstimationOMP<PointInT, PointOutT>::computeFeatureEigen (pcl::PointCloud<Eigen::MatrixXf> &output)\n{\n  if (threads_ < 0)\n     threads_ = 1;\n\n  \/\/check whether used with search radius or search k-neighbors\n  if (this->getKSearch () != 0)\n  {\n    PCL_ERROR(\n        \"[pcl::%s::computeFeatureEigen] Error! Search method set to k-neighborhood. Call setKSearch(0) and setRadiusSearch( radius ) to use this class.\\n\",\n        getClassName().c_str ());\n    return;\n  }\n  tree_->setSortedResults (true);\n\n  \/\/ Set up the output channels\n  output.channels[\"shot_lrf\"].name = \"shot_lrf\";\n  output.channels[\"shot_lrf\"].offset = 0;\n  output.channels[\"shot_lrf\"].size = 4;\n  output.channels[\"shot_lrf\"].count = 9;\n  output.channels[\"shot_lrf\"].datatype = sensor_msgs::PointField::FLOAT32;\n\n  \/\/output.points.resize (indices_->size (), 10);\n  output.points.resize (indices_->size (), 9);\n\n#pragma omp parallel for num_threads(threads_)\n  for (size_t i = 0; i < indices_->size (); ++i)\n  {\n    \/\/ point result\n    Eigen::Matrix3f rf;\n\n    \/\/output.points (i, 9) = getLocalRF ((*indices_)[i], rf);\n    \/\/if (output.points (i, 9) == std::numeric_limits<float>::max ())\n    if (getLocalRF ((*indices_)[i], rf) == std::numeric_limits<float>::max ())\n    {\n      output.is_dense = false;\n    }\n\n    output.points.block<1, 3> (i, 0) = rf.row (0);\n    output.points.block<1, 3> (i, 3) = rf.row (1);\n    output.points.block<1, 3> (i, 6) = rf.row (2);\n  }\n\n}\n\n#define PCL_INSTANTIATE_SHOTLocalReferenceFrameEstimationOMP(T,OutT) template class PCL_EXPORTS pcl::SHOTLocalReferenceFrameEstimationOMP<T,OutT>;\n\n#endif    \/\/ PCL_FEATURES_IMPL_SHOT_LRF_H_\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: filedlg.cxx,v $\n *\n *  $Revision: 1.18 $\n *\n *  last change: $Author: kz $ $Date: 2008-03-07 16:26:00 $\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#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef  _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\n#endif\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n\n#ifndef  _COM_SUN_STAR_LANG_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_COMMONFILEPICKERELEMENTIDS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/CommonFilePickerElementIds.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_EXECUTABLEDIALOGRESULTS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/ExecutableDialogResults.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_LISTBOXCONTROLACTIONS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/ListboxControlActions.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_EXTENDEDFILEPICKERELEMENTIDS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/ExtendedFilePickerElementIds.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_TEMPLATEDESCRIPTION_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/TemplateDescription.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_XFILEPICKERCONTROLACCESS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilePickerControlAccess.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_XFILEPICKERLISTENER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilePickerListener.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_XFILEPICKERNOTIFIER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilePickerNotifier.hpp>\n#endif\n#ifndef  _COM_SUN_STAR_UI_DIALOGS_XFILEPICKER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilePicker.hpp>\n#endif\n\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n#ifndef _URLOBJ_HXX\n#include <tools\/urlobj.hxx>\n#endif\n\n#ifndef _VOS_THREAD_HXX_\n#include <vos\/thread.hxx>\n#endif\n#ifndef _VOS_MUTEX_HXX_\n#include <vos\/mutex.hxx>\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\n#ifndef _FILEDLGHELPER_HXX\n#include <sfx2\/filedlghelper.hxx>\n#endif\n\n#include <svx\/impgrf.hxx>\n\n#include <avmedia\/mediawindow.hxx>\n#include \"filedlg.hxx\"\n#include \"sdresid.hxx\"\n#include \"strings.hrc\"\n\n\n\n\/\/-----------------------------------------------------------------------------\n\nnamespace css = ::com::sun::star;\n\n\n\/\/ --------------------------------------------------------------------\n\/\/ -----------      SdFileDialog_Imp        ---------------------------\n\/\/ --------------------------------------------------------------------\nclass SdFileDialog_Imp : public sfx2::FileDialogHelper\n{\nprivate:\n#if defined __SUNPRO_CC\n    using sfx2::FileDialogHelper::Execute;\n#endif\n\n    friend class SdExportFileDialog;\n    friend class SdOpenSoundFileDialog;\n\n    css::uno::Reference< css::ui::dialogs::XFilePickerControlAccess >   mxControlAccess;\n\n    css::uno::Reference< css::media::XPlayer > mxPlayer;\n    ULONG                       mnPlaySoundEvent;\n    BOOL                        mbUsableSelection;\n    BOOL                        mbLabelPlaying;\n\n    void                        CheckSelectionState();\n\n                                DECL_LINK( PlayMusicHdl, void * );\n\n    Timer                       maUpdateTimer;\n\n                                DECL_LINK( IsMusicStoppedHdl, void * );\n\npublic:\n                                SdFileDialog_Imp( const short nDialogType, sal_Bool bUsableSelection );\n                                   ~SdFileDialog_Imp();\n\n    ErrCode                     Execute();\n\n    \/\/ overwritten from FileDialogHelper, to receive user feedback\n    virtual void SAL_CALL       ControlStateChanged( const css::ui::dialogs::FilePickerEvent& aEvent );\n\n    sal_Bool                    SelectionBoxState() const;\n};\n\n\/\/ ------------------------------------------------------------------------\nvoid SAL_CALL SdFileDialog_Imp::ControlStateChanged( const css::ui::dialogs::FilePickerEvent& aEvent )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    switch( aEvent.ElementId )\n    {\n        case css::ui::dialogs::CommonFilePickerElementIds::LISTBOX_FILTER:\n            CheckSelectionState();\n            break;\n\n        case css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY:\n            if( mxControlAccess.is() )\n            {\n                if( mnPlaySoundEvent )\n                    Application::RemoveUserEvent( mnPlaySoundEvent );\n\n                mnPlaySoundEvent = Application::PostUserEvent( LINK( this, SdFileDialog_Imp, PlayMusicHdl ) );\n            }\n            break;\n    }\n}\n\n\/\/ ------------------------------------------------------------------------\nIMPL_LINK( SdFileDialog_Imp, PlayMusicHdl, void *, EMPTYARG )\n{\n    maUpdateTimer.Stop();\n    mnPlaySoundEvent = 0;\n\n    if (mxPlayer.is())\n    {\n        if (mxPlayer->isPlaying())\n            mxPlayer->stop();\n        mxPlayer.clear();\n    }\n\n    if( mbLabelPlaying )\n    {\n        try\n        {\n            mxControlAccess->setLabel( css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY,\n                                       String( SdResId( STR_PLAY ) ) );\n\n            mbLabelPlaying = FALSE;\n        }\n        catch( css::lang::IllegalArgumentException )\n        {\n#ifdef DBG_UTIL\n            DBG_ERROR( \"Cannot access play button\" );\n#endif\n        }\n    }\n    else\n    {\n        rtl::OUString aUrl( GetPath() );\n        if ( aUrl.getLength() )\n        {\n            try\n            {\n                mxPlayer.set( avmedia::MediaWindow::createPlayer( aUrl ), css::uno::UNO_QUERY_THROW );\n                mxPlayer->start();\n                maUpdateTimer.SetTimeout( 100 );\n                maUpdateTimer.Start();\n            }\n            catch( css::uno::Exception& e )\n            {\n                (void)e;\n                mxPlayer.clear();\n            }\n\n            if (mxPlayer.is())\n            {\n                try\n                {\n                    mxControlAccess->setLabel( css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY,\n                                               String( SdResId( STR_STOP ) ) );\n\n                    mbLabelPlaying = TRUE;\n                }\n                catch( css::lang::IllegalArgumentException )\n                {\n#ifdef DBG_UTIL\n                    DBG_ERROR( \"Cannot access play button\" );\n#endif\n                }\n            }\n        }\n    }\n\n    return 0;\n}\n\n\/\/ ------------------------------------------------------------------------\nIMPL_LINK( SdFileDialog_Imp, IsMusicStoppedHdl, void *, EMPTYARG )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    if (\n        mxPlayer.is() && mxPlayer->isPlaying() &&\n        mxPlayer->getMediaTime() < mxPlayer->getDuration()\n       )\n    {\n        maUpdateTimer.Start();\n        return 0L;\n    }\n\n\n    if( mxControlAccess.is() )\n    {\n        try\n        {\n            mxControlAccess->setLabel( css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY,\n                                       String( SdResId( STR_PLAY ) ) );\n            mbLabelPlaying = FALSE;\n        }\n        catch( css::lang::IllegalArgumentException )\n        {\n#ifdef DBG_UTIL\n            DBG_ERROR( \"Cannot access play button\" );\n#endif\n        }\n    }\n\n    return( 0L );\n}\n\n\/\/ check whether to disable the \"selection\" checkbox\nvoid SdFileDialog_Imp::CheckSelectionState()\n{\n    if( mbUsableSelection && mxControlAccess.is() )\n    {\n        String  aCurrFilter( GetCurrentFilter() );\n\n        try\n        {\n            if( !aCurrFilter.Len() || ( aCurrFilter == String( SdResId( STR_EXPORT_HTML_NAME ) ) ) )\n                mxControlAccess->enableControl( css::ui::dialogs::ExtendedFilePickerElementIds::CHECKBOX_SELECTION, FALSE );\n            else\n                mxControlAccess->enableControl( css::ui::dialogs::ExtendedFilePickerElementIds::CHECKBOX_SELECTION, TRUE );\n        }\n        catch( css::lang::IllegalArgumentException )\n        {\n#ifdef DBG_UTIL\n            DBG_ERROR( \"Cannot access \\\"selection\\\" checkbox\" );\n#endif\n        }\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nSdFileDialog_Imp::SdFileDialog_Imp( const short     nDialogType,\n                                    sal_Bool        bUsableSelection    ) :\n    FileDialogHelper( nDialogType, 0 ),\n    mnPlaySoundEvent( 0 ),\n    mbUsableSelection( bUsableSelection ),\n    mbLabelPlaying(FALSE)\n{\n    maUpdateTimer.SetTimeoutHdl(LINK(this, SdFileDialog_Imp, IsMusicStoppedHdl));\n\n    css::uno::Reference < ::com::sun::star::ui::dialogs::XFilePicker > xFileDlg = GetFilePicker();\n\n    \/\/ get the control access\n    mxControlAccess = css::uno::Reference< css::ui::dialogs::XFilePickerControlAccess > ( xFileDlg, css::uno::UNO_QUERY );\n\n    if( mxControlAccess.is() )\n    {\n        if( nDialogType ==\n            css::ui::dialogs::TemplateDescription::FILEOPEN_PLAY )\n        {\n            try\n            {\n                mxControlAccess->setLabel( css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY,\n                                           String( SdResId( STR_PLAY ) ) );\n            }\n            catch( css::lang::IllegalArgumentException )\n            {\n#ifdef DBG_UTIL\n                DBG_ERROR( \"Cannot set play button label\" );\n#endif\n            }\n        }\n        else if( mbUsableSelection != sal_True )\n        {\n            try\n            {\n                mxControlAccess->enableControl( css::ui::dialogs::ExtendedFilePickerElementIds::CHECKBOX_SELECTION, FALSE );\n            }\n            catch( css::lang::IllegalArgumentException )\n            {\n#ifdef DBG_UTIL\n                DBG_ERROR( \"Cannot disable selection checkbox\" );\n#endif\n            }\n        }\n    }\n}\n\n\n\/\/ ------------------------------------------------------------------------\nSdFileDialog_Imp::~SdFileDialog_Imp()\n{\n    if( mnPlaySoundEvent )\n        Application::RemoveUserEvent( mnPlaySoundEvent );\n}\n\n\/\/ ------------------------------------------------------------------------\nErrCode SdFileDialog_Imp::Execute()\n{\n    \/\/ make sure selection checkbox is disabled if\n    \/\/ HTML is current filter!\n    CheckSelectionState();\n    return FileDialogHelper::Execute();\n}\n\n\/\/ ------------------------------------------------------------------------\nsal_Bool SdFileDialog_Imp::SelectionBoxState() const\n{\n    if ( !mbUsableSelection || !mxControlAccess.is() )\n        return sal_False;\n\n    sal_Bool bState(0);\n    try\n    {\n        mxControlAccess->getValue( css::ui::dialogs::ExtendedFilePickerElementIds::CHECKBOX_SELECTION, 0 ) >>= bState;\n    }\n    catch( css::lang::IllegalArgumentException )\n    {\n#ifdef DBG_UTIL\n        DBG_ERROR( \"Cannot access \\\"selection\\\" checkbox\" );\n#endif\n    }\n\n    return bState;\n}\n\n\n\/\/ --------------------------------------------------------------------\n\/\/ -----------      SdExportFileDialog      ---------------------------\n\/\/ --------------------------------------------------------------------\n\n\/\/ these are simple forwarders\nSdExportFileDialog::SdExportFileDialog(BOOL bHaveCheckbox) :\n    mpImpl( new SdFileDialog_Imp( css::ui::dialogs::TemplateDescription::FILESAVE_AUTOEXTENSION_SELECTION,\n                                  bHaveCheckbox ) )\n{\n    \/\/ setup filter\n    const String    aHTMLFilter( SdResId( STR_EXPORT_HTML_NAME ) );\n    GraphicFilter*  pFilter = GetGrfFilter();\n    const USHORT    nFilterCount = pFilter->GetExportFormatCount();\n\n    \/\/ add HTML filter\n    mpImpl->AddFilter( aHTMLFilter, String( SdResId( STR_EXPORT_HTML_FILTER ) ) );\n\n    \/\/ add other graphic filters\n    for ( USHORT i = 0; i < nFilterCount; i++ )\n    {\n        mpImpl->AddFilter( pFilter->GetExportFormatName( i ),\n                           pFilter->GetExportWildcard( i ) );\n    }\n\n    \/\/ set dialog title\n    mpImpl->SetTitle( String( SdResId( STR_EXPORT_DIALOG_TITLE ) ) );\n}\n\n\/\/ ------------------------------------------------------------------------\nSdExportFileDialog::~SdExportFileDialog()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\nErrCode SdExportFileDialog::Execute()\n{\n    return mpImpl->Execute();\n}\n\nString SdExportFileDialog::GetPath() const\n{\n    return mpImpl->GetPath();\n}\n\n\/\/ ------------------------------------------------------------------------\nvoid SdExportFileDialog::SetPath( const String& rPath )\n{\n    mpImpl->SetDisplayDirectory( rPath );\n}\n\n\/\/ ------------------------------------------------------------------------\nString SdExportFileDialog::ReqCurrentFilter() const\n{\n    return mpImpl->GetCurrentFilter();\n}\n\n\/\/ ------------------------------------------------------------------------\nBOOL SdExportFileDialog::IsExportSelection() const\n{\n    return mpImpl->SelectionBoxState();\n}\n\n\n\/\/ --------------------------------------------------------------------\n\/\/ -----------      SdOpenSoundFileDialog       -----------------------\n\/\/ --------------------------------------------------------------------\n\n\/\/ these are simple forwarders\nSdOpenSoundFileDialog::SdOpenSoundFileDialog() :\n    mpImpl(\n        new SdFileDialog_Imp(\n            css::ui::dialogs::TemplateDescription::FILEOPEN_PLAY, sal_False ) )\n{\n    String aDescr;\n    aDescr = String(SdResId(STR_ALL_FILES));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.*\" ) ) );\n\n    \/\/ setup filter\n#if defined UNX\n    aDescr = String(SdResId(STR_AU_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.au;*.snd\" ) ) );\n    aDescr = String(SdResId(STR_VOC_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.voc\" ) ) );\n    aDescr = String(SdResId(STR_WAV_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.wav\" ) ) );\n    aDescr = String(SdResId(STR_AIFF_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.aiff\" ) ) );\n    aDescr = String(SdResId(STR_SVX_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.svx\" ) ) );\n#else\n    aDescr = String(SdResId(STR_WAV_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.wav;*.mp3;*.ogg\" ) ) );\n    aDescr = String(SdResId(STR_MIDI_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.mid\" ) ) );\n#endif\n}\n\n\/\/ ------------------------------------------------------------------------\nSdOpenSoundFileDialog::~SdOpenSoundFileDialog()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\nErrCode SdOpenSoundFileDialog::Execute()\n{\n    return mpImpl->Execute();\n}\n\n\/\/ ------------------------------------------------------------------------\nString SdOpenSoundFileDialog::GetPath() const\n{\n    return mpImpl->GetPath();\n}\n\n\/\/ ------------------------------------------------------------------------\nvoid SdOpenSoundFileDialog::SetPath( const String& rPath )\n{\n    mpImpl->SetDisplayDirectory( rPath );\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.18.24); FILE MERGED 2008\/04\/01 15:34:19 thb 1.18.24.3: #i85898# Stripping all external header guards 2008\/04\/01 12:38:41 thb 1.18.24.2: #i85898# Stripping all external header guards 2008\/03\/31 13:57:45 rt 1.18.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: filedlg.cxx,v $\n * $Revision: 1.19 $\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_sd.hxx\"\n#include <tools\/debug.hxx>\n#include <cppuhelper\/implbase1.hxx>\n#include <comphelper\/processfactory.hxx>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/CommonFilePickerElementIds.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/ExecutableDialogResults.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/ListboxControlActions.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/ExtendedFilePickerElementIds.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/TemplateDescription.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/XFilePickerControlAccess.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/XFilePickerListener.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/XFilePickerNotifier.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/XFilePicker.hpp>\n#include <vcl\/msgbox.hxx>\n#include <sal\/types.h>\n#include <tools\/urlobj.hxx>\n#include <vos\/thread.hxx>\n#include <vos\/mutex.hxx>\n#include <vcl\/svapp.hxx>\n#include <sfx2\/filedlghelper.hxx>\n\n#include <svx\/impgrf.hxx>\n\n#include <avmedia\/mediawindow.hxx>\n#include \"filedlg.hxx\"\n#include \"sdresid.hxx\"\n#include \"strings.hrc\"\n\n\n\n\/\/-----------------------------------------------------------------------------\n\nnamespace css = ::com::sun::star;\n\n\n\/\/ --------------------------------------------------------------------\n\/\/ -----------      SdFileDialog_Imp        ---------------------------\n\/\/ --------------------------------------------------------------------\nclass SdFileDialog_Imp : public sfx2::FileDialogHelper\n{\nprivate:\n#if defined __SUNPRO_CC\n    using sfx2::FileDialogHelper::Execute;\n#endif\n\n    friend class SdExportFileDialog;\n    friend class SdOpenSoundFileDialog;\n\n    css::uno::Reference< css::ui::dialogs::XFilePickerControlAccess >   mxControlAccess;\n\n    css::uno::Reference< css::media::XPlayer > mxPlayer;\n    ULONG                       mnPlaySoundEvent;\n    BOOL                        mbUsableSelection;\n    BOOL                        mbLabelPlaying;\n\n    void                        CheckSelectionState();\n\n                                DECL_LINK( PlayMusicHdl, void * );\n\n    Timer                       maUpdateTimer;\n\n                                DECL_LINK( IsMusicStoppedHdl, void * );\n\npublic:\n                                SdFileDialog_Imp( const short nDialogType, sal_Bool bUsableSelection );\n                                   ~SdFileDialog_Imp();\n\n    ErrCode                     Execute();\n\n    \/\/ overwritten from FileDialogHelper, to receive user feedback\n    virtual void SAL_CALL       ControlStateChanged( const css::ui::dialogs::FilePickerEvent& aEvent );\n\n    sal_Bool                    SelectionBoxState() const;\n};\n\n\/\/ ------------------------------------------------------------------------\nvoid SAL_CALL SdFileDialog_Imp::ControlStateChanged( const css::ui::dialogs::FilePickerEvent& aEvent )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    switch( aEvent.ElementId )\n    {\n        case css::ui::dialogs::CommonFilePickerElementIds::LISTBOX_FILTER:\n            CheckSelectionState();\n            break;\n\n        case css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY:\n            if( mxControlAccess.is() )\n            {\n                if( mnPlaySoundEvent )\n                    Application::RemoveUserEvent( mnPlaySoundEvent );\n\n                mnPlaySoundEvent = Application::PostUserEvent( LINK( this, SdFileDialog_Imp, PlayMusicHdl ) );\n            }\n            break;\n    }\n}\n\n\/\/ ------------------------------------------------------------------------\nIMPL_LINK( SdFileDialog_Imp, PlayMusicHdl, void *, EMPTYARG )\n{\n    maUpdateTimer.Stop();\n    mnPlaySoundEvent = 0;\n\n    if (mxPlayer.is())\n    {\n        if (mxPlayer->isPlaying())\n            mxPlayer->stop();\n        mxPlayer.clear();\n    }\n\n    if( mbLabelPlaying )\n    {\n        try\n        {\n            mxControlAccess->setLabel( css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY,\n                                       String( SdResId( STR_PLAY ) ) );\n\n            mbLabelPlaying = FALSE;\n        }\n        catch( css::lang::IllegalArgumentException )\n        {\n#ifdef DBG_UTIL\n            DBG_ERROR( \"Cannot access play button\" );\n#endif\n        }\n    }\n    else\n    {\n        rtl::OUString aUrl( GetPath() );\n        if ( aUrl.getLength() )\n        {\n            try\n            {\n                mxPlayer.set( avmedia::MediaWindow::createPlayer( aUrl ), css::uno::UNO_QUERY_THROW );\n                mxPlayer->start();\n                maUpdateTimer.SetTimeout( 100 );\n                maUpdateTimer.Start();\n            }\n            catch( css::uno::Exception& e )\n            {\n                (void)e;\n                mxPlayer.clear();\n            }\n\n            if (mxPlayer.is())\n            {\n                try\n                {\n                    mxControlAccess->setLabel( css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY,\n                                               String( SdResId( STR_STOP ) ) );\n\n                    mbLabelPlaying = TRUE;\n                }\n                catch( css::lang::IllegalArgumentException )\n                {\n#ifdef DBG_UTIL\n                    DBG_ERROR( \"Cannot access play button\" );\n#endif\n                }\n            }\n        }\n    }\n\n    return 0;\n}\n\n\/\/ ------------------------------------------------------------------------\nIMPL_LINK( SdFileDialog_Imp, IsMusicStoppedHdl, void *, EMPTYARG )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    if (\n        mxPlayer.is() && mxPlayer->isPlaying() &&\n        mxPlayer->getMediaTime() < mxPlayer->getDuration()\n       )\n    {\n        maUpdateTimer.Start();\n        return 0L;\n    }\n\n\n    if( mxControlAccess.is() )\n    {\n        try\n        {\n            mxControlAccess->setLabel( css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY,\n                                       String( SdResId( STR_PLAY ) ) );\n            mbLabelPlaying = FALSE;\n        }\n        catch( css::lang::IllegalArgumentException )\n        {\n#ifdef DBG_UTIL\n            DBG_ERROR( \"Cannot access play button\" );\n#endif\n        }\n    }\n\n    return( 0L );\n}\n\n\/\/ check whether to disable the \"selection\" checkbox\nvoid SdFileDialog_Imp::CheckSelectionState()\n{\n    if( mbUsableSelection && mxControlAccess.is() )\n    {\n        String  aCurrFilter( GetCurrentFilter() );\n\n        try\n        {\n            if( !aCurrFilter.Len() || ( aCurrFilter == String( SdResId( STR_EXPORT_HTML_NAME ) ) ) )\n                mxControlAccess->enableControl( css::ui::dialogs::ExtendedFilePickerElementIds::CHECKBOX_SELECTION, FALSE );\n            else\n                mxControlAccess->enableControl( css::ui::dialogs::ExtendedFilePickerElementIds::CHECKBOX_SELECTION, TRUE );\n        }\n        catch( css::lang::IllegalArgumentException )\n        {\n#ifdef DBG_UTIL\n            DBG_ERROR( \"Cannot access \\\"selection\\\" checkbox\" );\n#endif\n        }\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nSdFileDialog_Imp::SdFileDialog_Imp( const short     nDialogType,\n                                    sal_Bool        bUsableSelection    ) :\n    FileDialogHelper( nDialogType, 0 ),\n    mnPlaySoundEvent( 0 ),\n    mbUsableSelection( bUsableSelection ),\n    mbLabelPlaying(FALSE)\n{\n    maUpdateTimer.SetTimeoutHdl(LINK(this, SdFileDialog_Imp, IsMusicStoppedHdl));\n\n    css::uno::Reference < ::com::sun::star::ui::dialogs::XFilePicker > xFileDlg = GetFilePicker();\n\n    \/\/ get the control access\n    mxControlAccess = css::uno::Reference< css::ui::dialogs::XFilePickerControlAccess > ( xFileDlg, css::uno::UNO_QUERY );\n\n    if( mxControlAccess.is() )\n    {\n        if( nDialogType ==\n            css::ui::dialogs::TemplateDescription::FILEOPEN_PLAY )\n        {\n            try\n            {\n                mxControlAccess->setLabel( css::ui::dialogs::ExtendedFilePickerElementIds::PUSHBUTTON_PLAY,\n                                           String( SdResId( STR_PLAY ) ) );\n            }\n            catch( css::lang::IllegalArgumentException )\n            {\n#ifdef DBG_UTIL\n                DBG_ERROR( \"Cannot set play button label\" );\n#endif\n            }\n        }\n        else if( mbUsableSelection != sal_True )\n        {\n            try\n            {\n                mxControlAccess->enableControl( css::ui::dialogs::ExtendedFilePickerElementIds::CHECKBOX_SELECTION, FALSE );\n            }\n            catch( css::lang::IllegalArgumentException )\n            {\n#ifdef DBG_UTIL\n                DBG_ERROR( \"Cannot disable selection checkbox\" );\n#endif\n            }\n        }\n    }\n}\n\n\n\/\/ ------------------------------------------------------------------------\nSdFileDialog_Imp::~SdFileDialog_Imp()\n{\n    if( mnPlaySoundEvent )\n        Application::RemoveUserEvent( mnPlaySoundEvent );\n}\n\n\/\/ ------------------------------------------------------------------------\nErrCode SdFileDialog_Imp::Execute()\n{\n    \/\/ make sure selection checkbox is disabled if\n    \/\/ HTML is current filter!\n    CheckSelectionState();\n    return FileDialogHelper::Execute();\n}\n\n\/\/ ------------------------------------------------------------------------\nsal_Bool SdFileDialog_Imp::SelectionBoxState() const\n{\n    if ( !mbUsableSelection || !mxControlAccess.is() )\n        return sal_False;\n\n    sal_Bool bState(0);\n    try\n    {\n        mxControlAccess->getValue( css::ui::dialogs::ExtendedFilePickerElementIds::CHECKBOX_SELECTION, 0 ) >>= bState;\n    }\n    catch( css::lang::IllegalArgumentException )\n    {\n#ifdef DBG_UTIL\n        DBG_ERROR( \"Cannot access \\\"selection\\\" checkbox\" );\n#endif\n    }\n\n    return bState;\n}\n\n\n\/\/ --------------------------------------------------------------------\n\/\/ -----------      SdExportFileDialog      ---------------------------\n\/\/ --------------------------------------------------------------------\n\n\/\/ these are simple forwarders\nSdExportFileDialog::SdExportFileDialog(BOOL bHaveCheckbox) :\n    mpImpl( new SdFileDialog_Imp( css::ui::dialogs::TemplateDescription::FILESAVE_AUTOEXTENSION_SELECTION,\n                                  bHaveCheckbox ) )\n{\n    \/\/ setup filter\n    const String    aHTMLFilter( SdResId( STR_EXPORT_HTML_NAME ) );\n    GraphicFilter*  pFilter = GetGrfFilter();\n    const USHORT    nFilterCount = pFilter->GetExportFormatCount();\n\n    \/\/ add HTML filter\n    mpImpl->AddFilter( aHTMLFilter, String( SdResId( STR_EXPORT_HTML_FILTER ) ) );\n\n    \/\/ add other graphic filters\n    for ( USHORT i = 0; i < nFilterCount; i++ )\n    {\n        mpImpl->AddFilter( pFilter->GetExportFormatName( i ),\n                           pFilter->GetExportWildcard( i ) );\n    }\n\n    \/\/ set dialog title\n    mpImpl->SetTitle( String( SdResId( STR_EXPORT_DIALOG_TITLE ) ) );\n}\n\n\/\/ ------------------------------------------------------------------------\nSdExportFileDialog::~SdExportFileDialog()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\nErrCode SdExportFileDialog::Execute()\n{\n    return mpImpl->Execute();\n}\n\nString SdExportFileDialog::GetPath() const\n{\n    return mpImpl->GetPath();\n}\n\n\/\/ ------------------------------------------------------------------------\nvoid SdExportFileDialog::SetPath( const String& rPath )\n{\n    mpImpl->SetDisplayDirectory( rPath );\n}\n\n\/\/ ------------------------------------------------------------------------\nString SdExportFileDialog::ReqCurrentFilter() const\n{\n    return mpImpl->GetCurrentFilter();\n}\n\n\/\/ ------------------------------------------------------------------------\nBOOL SdExportFileDialog::IsExportSelection() const\n{\n    return mpImpl->SelectionBoxState();\n}\n\n\n\/\/ --------------------------------------------------------------------\n\/\/ -----------      SdOpenSoundFileDialog       -----------------------\n\/\/ --------------------------------------------------------------------\n\n\/\/ these are simple forwarders\nSdOpenSoundFileDialog::SdOpenSoundFileDialog() :\n    mpImpl(\n        new SdFileDialog_Imp(\n            css::ui::dialogs::TemplateDescription::FILEOPEN_PLAY, sal_False ) )\n{\n    String aDescr;\n    aDescr = String(SdResId(STR_ALL_FILES));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.*\" ) ) );\n\n    \/\/ setup filter\n#if defined UNX\n    aDescr = String(SdResId(STR_AU_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.au;*.snd\" ) ) );\n    aDescr = String(SdResId(STR_VOC_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.voc\" ) ) );\n    aDescr = String(SdResId(STR_WAV_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.wav\" ) ) );\n    aDescr = String(SdResId(STR_AIFF_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.aiff\" ) ) );\n    aDescr = String(SdResId(STR_SVX_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.svx\" ) ) );\n#else\n    aDescr = String(SdResId(STR_WAV_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.wav;*.mp3;*.ogg\" ) ) );\n    aDescr = String(SdResId(STR_MIDI_FILE));\n    mpImpl->AddFilter( aDescr, UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"*.mid\" ) ) );\n#endif\n}\n\n\/\/ ------------------------------------------------------------------------\nSdOpenSoundFileDialog::~SdOpenSoundFileDialog()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\nErrCode SdOpenSoundFileDialog::Execute()\n{\n    return mpImpl->Execute();\n}\n\n\/\/ ------------------------------------------------------------------------\nString SdOpenSoundFileDialog::GetPath() const\n{\n    return mpImpl->GetPath();\n}\n\n\/\/ ------------------------------------------------------------------------\nvoid SdOpenSoundFileDialog::SetPath( const String& rPath )\n{\n    mpImpl->SetDisplayDirectory( rPath );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: docprev.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: kz $ $Date: 2008-04-03 14:00: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#ifndef _SD_DOCPREV_HXX_\n#define _SD_DOCPREV_HXX_\n\n#ifndef _COM_SUN_STAR_PRESENTATION_FADEEFFECT_HPP_\n#include <com\/sun\/star\/presentation\/FadeEffect.hpp>\n#endif\n\n#ifndef _SV_WINDOW_HXX \/\/autogen\n#include <vcl\/window.hxx>\n#endif\n\n#ifndef _SV_GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n\n#include <rtl\/ref.hxx>\n\n#ifndef _SFXLSTNER_HXX\n#include <svtools\/lstner.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_COLORCFG_HXX\n#include <svtools\/colorcfg.hxx>\n#endif\n\n#ifndef _SD_FADEDEF_H\n#include \"fadedef.h\"\n#endif\n#ifndef INCLUDED_SDDLLAPI_H\n#include \"sddllapi.h\"\n#endif\n\nnamespace sd {\n    class SlideShow;\n}\n\nclass GDIMetaFile;\n\nclass SD_DLLPUBLIC SdDocPreviewWin : public Control, public SfxListener\n{\nprotected:\n    GDIMetaFile*    pMetaFile;\n    BOOL            bInEffect;\n    Link            aClickHdl;\n    SfxObjectShell* mpObj;\n    sal_uInt16      mnShowPage;\n    Color           maDocumentColor;\n    rtl::Reference< sd::SlideShow > mxSlideShow;\n\n    virtual void    Paint( const Rectangle& rRect );\n    static void     CalcSizeAndPos( GDIMetaFile* pFile, Size& rSize, Point& rPoint );\n    void            ImpPaint( GDIMetaFile* pFile, OutputDevice* pVDev );\n\n    static const int FRAME;\n\n    svtools::ColorConfig maColorConfig;\n\n    virtual void SFX_NOTIFY(SfxBroadcaster& rBC, const TypeId& rBCType, const SfxHint& rHint, const TypeId& rHintType);\n\n    void updateViewSettings();\n\npublic:\n                    SdDocPreviewWin( Window* pParent, const ResId& rResId );\n                    SdDocPreviewWin( Window* pParent );\n                    ~SdDocPreviewWin();\n    void            SetObjectShell( SfxObjectShell* pObj, sal_uInt16 nShowPage = 0 );\n    void            SetGDIFile( GDIMetaFile* pFile );\n    virtual void    Resize();\n    void            startPreview();\n\n    virtual long    Notify( NotifyEvent& rNEvt );\n\n    void            SetClickHdl( const Link& rLink ) { aClickHdl = rLink; }\n    const Link&     GetClickHdl() const { return aClickHdl; }\n\n    virtual void DataChanged( const DataChangedEvent& rDCEvt );\n\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.624); FILE MERGED 2008\/04\/01 15:35:22 thb 1.8.624.3: #i85898# Stripping all external header guards 2008\/04\/01 12:39:03 thb 1.8.624.2: #i85898# Stripping all external header guards 2008\/03\/31 13:58:13 rt 1.8.624.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: docprev.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 _SD_DOCPREV_HXX_\n#define _SD_DOCPREV_HXX_\n\n#include <com\/sun\/star\/presentation\/FadeEffect.hpp>\n#include <vcl\/window.hxx>\n#include <tools\/gen.hxx>\n\n#include <rtl\/ref.hxx>\n\n#include <svtools\/lstner.hxx>\n#include <svtools\/colorcfg.hxx>\n#include \"fadedef.h\"\n#include \"sddllapi.h\"\n\nnamespace sd {\n    class SlideShow;\n}\n\nclass GDIMetaFile;\n\nclass SD_DLLPUBLIC SdDocPreviewWin : public Control, public SfxListener\n{\nprotected:\n    GDIMetaFile*    pMetaFile;\n    BOOL            bInEffect;\n    Link            aClickHdl;\n    SfxObjectShell* mpObj;\n    sal_uInt16      mnShowPage;\n    Color           maDocumentColor;\n    rtl::Reference< sd::SlideShow > mxSlideShow;\n\n    virtual void    Paint( const Rectangle& rRect );\n    static void     CalcSizeAndPos( GDIMetaFile* pFile, Size& rSize, Point& rPoint );\n    void            ImpPaint( GDIMetaFile* pFile, OutputDevice* pVDev );\n\n    static const int FRAME;\n\n    svtools::ColorConfig maColorConfig;\n\n    virtual void SFX_NOTIFY(SfxBroadcaster& rBC, const TypeId& rBCType, const SfxHint& rHint, const TypeId& rHintType);\n\n    void updateViewSettings();\n\npublic:\n                    SdDocPreviewWin( Window* pParent, const ResId& rResId );\n                    SdDocPreviewWin( Window* pParent );\n                    ~SdDocPreviewWin();\n    void            SetObjectShell( SfxObjectShell* pObj, sal_uInt16 nShowPage = 0 );\n    void            SetGDIFile( GDIMetaFile* pFile );\n    virtual void    Resize();\n    void            startPreview();\n\n    virtual long    Notify( NotifyEvent& rNEvt );\n\n    void            SetClickHdl( const Link& rLink ) { aClickHdl = rLink; }\n    const Link&     GetClickHdl() const { return aClickHdl; }\n\n    virtual void DataChanged( const DataChangedEvent& rDCEvt );\n\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <string>\n#include <sstream>\n#include \"StateSpace.h\"\n#include \"PriorityQueue.h\"\n#include \"State.h\"\n#include \"encoder.h\"\n#include \"CreateModule.h\"\n\n\/**\n * @brief Gives a std::string representation of a primitive type\n * \n * @param x Primitive type such as int, double, long\n * @return std::string conversion of param x\n *\/\ntemplate<typename T> std::string to_string(T x) {\n\treturn static_cast<std::ostringstream&>((std::ostringstream() << std::dec << x)).str();\n}\n\n\/\/function to calculate a temperature for the select action function as a function of time\ndouble temperature();\n\n\/\/function to select next action\nint * selectAction(PriorityQueue<int,double>& a_queue);\n\n\/\/function to update a q value\nvoid updateQ(StateSpace & space, int * action, State & new_state, State & old_state, double alpha, double gamma);\n\nint main()\n{\t\n\t\/\/ STUFF WE DONT UNDERSTAND, AND DONT NEED TO\n\t\/\/__________________________________________________________________________________________\n\t\/\/__________________________________________________________________________________________\n\t\/\/ Libraries to load\n\tstd::string bodyLibName = \"bodyinfo\";\n\tstd::string movementLibName = \"movementtools\";\n\t\n\t\/\/ Name of camera module in library\n\tstd::string bodyModuleName = \"BodyInfo\";\n\tstd::string movementModuleName = \"MovementTools\";\n\n\t\/\/ Set broker name, ip and port, finding first available port from 54000\n\tconst std::string brokerName = \"MotionTimingBroker\";\n\tint brokerPort = qi::os::findAvailablePort(54000);\n\tconst std::string brokerIp = \"0.0.0.0\";\n\t\n\t\/\/ Default parent port and ip\n\tint pport = 9559;\n\tstd::string pip = \"127.0.0.1\";\n\t\n\t\/\/ Need this for SOAP serialisation of floats to work\n\tsetlocale(LC_NUMERIC, \"C\");\n\n\t\/\/ Create a broker\n\tboost::shared_ptr<AL::ALBroker> broker;\n\ttry\n\t{\n\t\tbroker = AL::ALBroker::createBroker(\n\t\t\t\tbrokerName,\n\t\t\t\tbrokerIp,\n\t\t\t\tbrokerPort,\n\t\t\t\tpip,\n\t\t\t\tpport,\n\t\t\t\t0);\n\t}\n\t\/\/ Throw error and quit if a broker could not be created\n\tcatch(...)\n\t{\n\t\tstd::cerr << \"Failed to connect broker to: \"\n\t\t\t  << pip\n\t\t\t  << \":\"\n\t\t\t  << pport\n\t\t\t  << std::endl;\n\t\tAL::ALBrokerManager::getInstance()->killAllBroker();\n\t\tAL::ALBrokerManager::kill();\n\n\t\treturn 1;\n\t}\n\n\t\/\/ Add the broker to NAOqi\n\tAL::ALBrokerManager::setInstance(broker->fBrokerManager.lock());\n\tAL::ALBrokerManager::getInstance()->addBroker(broker);\n\n\tCreateModule(movementLibName, movementModuleName, broker, false, true);\n\tCreateModule(bodyLibName, bodyModuleName, broker, false, true);\n\t\n\tAL::ALProxy bodyInfoProxy(bodyModuleName, pip, pport);\n\tAL::ALProxy movementToolsProxy(movementModuleName, pip, pport);\n\tAL::ALMotionProxy motion(pip, pport);\n\t\/\/__________________________________________________________________________________________\n\t\/\/__________________________________________________________________________________________\n\t\/\/END OF STUFF WE DONT UNDERSTAND, BREATHE NOW\n\t\n\t\/\/learning factor\n\tconst double alpha=0.5;\n\t\/\/discount factor\n\tconst double gamma=0.5;\n\t\n\t\/\/seed rng\n\tstd::srand(std::time(NULL));\n\t\n\tint action_forwards = FORWARD;\n\tint* p_action_forwards = &action_forwards;\n\tint action_backwards = BACKWARD;\n\tint* p_action_backwards = &action_backwards;\n\tint* chosen_action = &action_forwards;\n\t\n\t\/\/create a priority queue to copy to all the state space priority queues\n\tPriorityQueue<int*,double> initiator_queue(MAX);\n\tinitiator_queue.enqueueWithPriority(p_action_forwards,0);\n\tinitiator_queue.enqueueWithPriority(p_action_backwards,0);\n\t\n\t\/\/create encoder\n\tEncoder encoder();\n\tencoder.calibrate();\n\t\n\t\/\/create the state space\n\tStateSpace space(initiator_queue);\n\tspace.setAngle(100);\n\tspace.setVelocity(50);\n\t\n\t\/\/state objects\n\tState current_state(0,0,FORWARD);\n\tState old_state(0,0,FORWARD);\n\t\n\twhile(true)\n\t{\n\t\tcurrent_state.theta= M_PI * encoder.GetAngle()\/180;\n\t\tcurrent_state.theta_dot=(current_state.theta - old_state.theta)\/700; \/\/Needs actual time\n\t\tcurrent_state.robot_state=*chosen_action;\n\t\t\n\t\tupdateQ(space, chosen_action, old_state, current_state, alpha, gamma);\n\t\t\n\t\told_state=current_state;\n\t\t\n\t\tchosen_action=selectAction(space[current_state]);\n\t\t\n\t\t(*chosen_action)?movementToolsProxy.callVoid(\"swingForwards\"):movementToolsProxy.callVoid(\"swingBackwards\");\n\t}\n\t\n\treturn 1;\n}\n\ndouble temperature()\n{\n\treturn std::time(NULL);\n}\n\n\/\/function is fed with a priority queue of action-values \n\/\/generates Boltzmann distribution of these action-values\n\/\/and selects an action based on probabilities \nint * selectAction(PriorityQueue<int *,double>& a_queue)\n{\t\n\ttypedef PriorityQueue<int *,double> PQ;\n\ttypedef std::vector< std::pair<int *, double> > Vec_Pair;\n\ttypedef std::pair<int *, double> Pair;\n\t\n\tdouble sum= 0;\n\tint i = 0;\n\t\n\tint size = a_queue.getSize();\n\tVec_Pair action_vec(size);\n\t\n\t\/\/Calculate partition function by iterating over action-values\n\tfor(PQ::const_iterator iter = a_queue.begin(),end=a_queue.end(); iter < end; ++iter)\n\t{\n\t\tsum += std::exp((iter->second)\/temperature());\n\t}\n\t\/\/Calculate boltzmann factors for action-values\n\tfor(Vec_Pair::iterator it = action_vec.begin(),end=action_vec.end(); it < end; ++it)\n\t{\n\t    it->first = a_queue[i].first;\n\t    it->second = std::exp(a_queue[i].second \/temperature()) \/ sum;\n\t    ++i;\n\t}\n\t\n\t\/\/calculate cumulative probability distribution    \n\tfor(Vec_Pair::iterator it1 = action_vec.begin()++,it2 = action_vec.begin(),end=action_vec.end(); it < end; ++it1,++it2)\n\t{\n\t    it1->second += it2->second;\n\t}\n\t\n\t\/\/generate RN between 0 and 1\n\tdouble rand_num = static_cast<double>(rand()\/ (RAND_MAX));\n\t\n\t\/\/select action based on probability \n\tfor(Vec_Pair::iterator it = action_vec.begin(),end=action_vec.end(); it < end; ++it)\n\t{\n\t\t\/\/if RN falls within cumulative probability bin return the corresponding action\n\t\tif(rand_num < it->second)return &(it->first);\n\t}\n \t\n\treturn NULL; \/\/note that this line should never be reached\n}\n\nvoid updateQ(StateSpace & space, int * action, State & new_state, State & old_state, double alpha, double gamma)\n{\n    \/\/oldQ value reference\n    double oldQ = space[old_state].search(action).second;\n    \n    \/\/reward given to current state \n    double R = new_state.getReward();\n    \n    \/\/optimal Q value for new state i.e. first element \n    double maxQ = space[current_state].peekFront().second;\n    \n    \/\/new Q value determined by Q learning algorithm\n    double newQ = oldQ + alpha * (R + (gamma * maxQ) - oldQ);\n    \n    \/\/ change priority of action to new Q value\n    space[old_state].changePriority(action, newQ);\n}\n\n<commit_msg>Update Main.cpp<commit_after>#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <string>\n#include <sstream>\n#include \"StateSpace.h\"\n#include \"PriorityQueue.h\"\n#include \"State.h\"\n#include \"encoder.h\"\n#include \"CreateModule.h\"\n\n\/**\n * @brief Gives a std::string representation of a primitive type\n * \n * @param x Primitive type such as int, double, long\n * @return std::string conversion of param x\n *\/\ntemplate<typename T> std::string to_string(T x) {\n\treturn static_cast<std::ostringstream&>((std::ostringstream() << std::dec << x)).str();\n}\n\n\/\/function to calculate a temperature for the select action function as a function of time\ndouble temperature();\n\n\/\/function to select next action\nint * selectAction(PriorityQueue<int,double>& a_queue);\n\n\/\/function to update a q value\nvoid updateQ(StateSpace & space, int * action, State & new_state, State & old_state, double alpha, double gamma);\n\nint main()\n{\t\n\t\/\/ STUFF WE DONT UNDERSTAND, AND DONT NEED TO\n\t\/\/__________________________________________________________________________________________\n\t\/\/__________________________________________________________________________________________\n\t\/\/ Libraries to load\n\tstd::string bodyLibName = \"bodyinfo\";\n\tstd::string movementLibName = \"movementtools\";\n\t\n\t\/\/ Name of camera module in library\n\tstd::string bodyModuleName = \"BodyInfo\";\n\tstd::string movementModuleName = \"MovementTools\";\n\n\t\/\/ Set broker name, ip and port, finding first available port from 54000\n\tconst std::string brokerName = \"MotionTimingBroker\";\n\tint brokerPort = qi::os::findAvailablePort(54000);\n\tconst std::string brokerIp = \"0.0.0.0\";\n\t\n\t\/\/ Default parent port and ip\n\tint pport = 9559;\n\tstd::string pip = \"127.0.0.1\";\n\t\n\t\/\/ Need this for SOAP serialisation of floats to work\n\tsetlocale(LC_NUMERIC, \"C\");\n\n\t\/\/ Create a broker\n\tboost::shared_ptr<AL::ALBroker> broker;\n\ttry\n\t{\n\t\tbroker = AL::ALBroker::createBroker(\n\t\t\t\tbrokerName,\n\t\t\t\tbrokerIp,\n\t\t\t\tbrokerPort,\n\t\t\t\tpip,\n\t\t\t\tpport,\n\t\t\t\t0);\n\t}\n\t\/\/ Throw error and quit if a broker could not be created\n\tcatch(...)\n\t{\n\t\tstd::cerr << \"Failed to connect broker to: \"\n\t\t\t  << pip\n\t\t\t  << \":\"\n\t\t\t  << pport\n\t\t\t  << std::endl;\n\t\tAL::ALBrokerManager::getInstance()->killAllBroker();\n\t\tAL::ALBrokerManager::kill();\n\n\t\treturn 1;\n\t}\n\n\t\/\/ Add the broker to NAOqi\n\tAL::ALBrokerManager::setInstance(broker->fBrokerManager.lock());\n\tAL::ALBrokerManager::getInstance()->addBroker(broker);\n\n\tCreateModule(movementLibName, movementModuleName, broker, false, true);\n\tCreateModule(bodyLibName, bodyModuleName, broker, false, true);\n\t\n\tAL::ALProxy bodyInfoProxy(bodyModuleName, pip, pport);\n\tAL::ALProxy movementToolsProxy(movementModuleName, pip, pport);\n\tAL::ALMotionProxy motion(pip, pport);\n\t\/\/__________________________________________________________________________________________\n\t\/\/__________________________________________________________________________________________\n\t\/\/END OF STUFF WE DONT UNDERSTAND, BREATHE NOW\n\t\n\t\/\/learning factor\n\tconst double alpha=0.5;\n\t\/\/discount factor\n\tconst double gamma=0.5;\n\t\n\t\/\/seed rng\n\tstd::srand(std::time(NULL));\n\t\n\tint action_forwards = FORWARD;\n\tint* p_action_forwards = &action_forwards;\n\tint action_backwards = BACKWARD;\n\tint* p_action_backwards = &action_backwards;\n\tint* chosen_action = &action_forwards;\n\t\n\t\/\/create a priority queue to copy to all the state space priority queues\n\tPriorityQueue<int*,double> initiator_queue(MAX);\n\tinitiator_queue.enqueueWithPriority(p_action_forwards,0);\n\tinitiator_queue.enqueueWithPriority(p_action_backwards,0);\n\t\n\t\/\/create encoder\n\tEncoder encoder();\n\tencoder.calibrate();\n\t\n\t\/\/create the state space\n\tStateSpace space(initiator_queue);\n\tspace.setAngleBins(100);\n\tspace.setVelocityBins(50);\n\t\n\t\/\/state objects\n\tState current_state(0,0,FORWARD);\n\tState old_state(0,0,FORWARD);\n\t\n\twhile(true)\n\t{\n\t\tcurrent_state.theta= M_PI * encoder.GetAngle()\/180;\n\t\tcurrent_state.theta_dot=(current_state.theta - old_state.theta)\/700; \/\/Needs actual time\n\t\tcurrent_state.robot_state=*chosen_action;\n\t\t\n\t\tupdateQ(space, chosen_action, old_state, current_state, alpha, gamma);\n\t\t\n\t\told_state=current_state;\n\t\t\n\t\tchosen_action=selectAction(space[current_state]);\n\t\t\n\t\t(*chosen_action)?movementToolsProxy.callVoid(\"swingForwards\"):movementToolsProxy.callVoid(\"swingBackwards\");\n\t}\n\t\n\treturn 1;\n}\n\ndouble temperature()\n{\n\treturn std::time(NULL);\n}\n\n\/\/function is fed with a priority queue of action-values \n\/\/generates Boltzmann distribution of these action-values\n\/\/and selects an action based on probabilities \nint * selectAction(PriorityQueue<int *,double>& a_queue)\n{\t\n\ttypedef PriorityQueue<int *,double> PQ;\n\ttypedef std::vector< std::pair<int *, double> > Vec_Pair;\n\ttypedef std::pair<int *, double> Pair;\n\t\n\tdouble sum= 0;\n\tint i = 0;\n\t\n\tint size = a_queue.getSize();\n\tVec_Pair action_vec(size);\n\t\n\t\/\/Calculate partition function by iterating over action-values\n\tfor(PQ::const_iterator iter = a_queue.begin(),end=a_queue.end(); iter < end; ++iter)\n\t{\n\t\tsum += std::exp((iter->second)\/temperature());\n\t}\n\t\/\/Calculate boltzmann factors for action-values\n\tfor(Vec_Pair::iterator it = action_vec.begin(),end=action_vec.end(); it < end; ++it)\n\t{\n\t    it->first = a_queue[i].first;\n\t    it->second = std::exp(a_queue[i].second \/temperature()) \/ sum;\n\t    ++i;\n\t}\n\t\n\t\/\/calculate cumulative probability distribution    \n\tfor(Vec_Pair::iterator it1 = action_vec.begin()++,it2 = action_vec.begin(),end=action_vec.end(); it < end; ++it1,++it2)\n\t{\n\t    it1->second += it2->second;\n\t}\n\t\n\t\/\/generate RN between 0 and 1\n\tdouble rand_num = static_cast<double>(rand()\/ (RAND_MAX));\n\t\n\t\/\/select action based on probability \n\tfor(Vec_Pair::iterator it = action_vec.begin(),end=action_vec.end(); it < end; ++it)\n\t{\n\t\t\/\/if RN falls within cumulative probability bin return the corresponding action\n\t\tif(rand_num < it->second)return &(it->first);\n\t}\n \t\n\treturn NULL; \/\/note that this line should never be reached\n}\n\nvoid updateQ(StateSpace & space, int * action, State & new_state, State & old_state, double alpha, double gamma)\n{\n    \/\/oldQ value reference\n    double oldQ = space[old_state].search(action).second;\n    \n    \/\/reward given to current state \n    double R = new_state.getReward();\n    \n    \/\/optimal Q value for new state i.e. first element \n    double maxQ = space[current_state].peekFront().second;\n    \n    \/\/new Q value determined by Q learning algorithm\n    double newQ = oldQ + alpha * (R + (gamma * maxQ) - oldQ);\n    \n    \/\/ change priority of action to new Q value\n    space[old_state].changePriority(action, newQ);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\nUselessMine\n    Copyright (C) 2014 Vladimir \"allejo\" Jimenez\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 <memory>\n#include <stdlib.h>\n\n#include \"bzfsAPI.h\"\n#include \"bztoolkit\/bzToolkitAPI.h\"\n\n\/\/ Define plugin name\nconst std::string PLUGIN_NAME = \"Useless Mine\";\n\n\/\/ Define plugin version numbering\nconst int MAJOR = 1;\nconst int MINOR = 0;\nconst int REV = 0;\nconst int BUILD = 8;\n\nclass UselessMine : public bz_Plugin, public bz_CustomSlashCommandHandler\n{\npublic:\n    virtual const char* Name ();\n    virtual void Init (const char* config);\n    virtual void Event (bz_EventData *eventData);\n    virtual void Cleanup (void);\n\n    virtual bool SlashCommand (int playerID, bz_ApiString, bz_ApiString, bz_APIStringList*);\n\n    virtual int  getMineCount ();\n    virtual void initializeMessages (void),\n                 removeAllMines(int playerID),\n                 removeMine (int mineIndex),\n                 setMine (int owner, float pos[3], bz_eTeamType team);\n\n    \/\/ The information each mine will contain\n    struct Mine\n    {\n        int owner, victim; \/\/ The owner of the mine and the victim, respectively\n\n        float x, y, z;     \/\/ The coordinates of where the mine was placed\n\n        bz_eTeamType team; \/\/ The team of the owner\n\n        bool detonated;    \/\/ Whether or not the mine has been detonated; to prepare it for removal from play\n\n        Mine (int _owner, float _pos[3], bz_eTeamType _team) :\n            owner(_owner),\n            victim(-1),\n            x(_pos[0]),\n            y(_pos[1]),\n            z(_pos[2]),\n            team(_team),\n            detonated(false)\n        {}\n    };\n\n    std::vector<Mine>        activeMines;   \/\/ A vector that will store all of the mines that are in play\n    std::vector<std::string> deathMessages; \/\/ A vector that will store all of the witty death messages\n\n    double bzdb_SpawnSafetyTime, \/\/ The BZDB variable that will store the amount of seconds a player has before a mine is detonated\n           playerSpawnTime[256]; \/\/ The time of a player's last spawn time used to calculate their safety from detonation\n};\n\nBZ_PLUGIN(UselessMine)\n\nconst char* UselessMine::Name (void)\n{\n    static std::string pluginBuild = \"\";\n\n    if (!pluginBuild.size())\n    {\n        std::ostringstream pluginBuildStream;\n\n        pluginBuildStream << PLUGIN_NAME << \" \" << MAJOR << \".\" << MINOR << \".\" << REV << \" (\" << BUILD << \")\";\n        pluginBuild = pluginBuildStream.str();\n    }\n\n    return pluginBuild.c_str();\n}\n\nvoid UselessMine::Init (const char* commandLine)\n{\n    \/\/ Register our events with Register()\n    Register(bz_eFlagGrabbedEvent);\n    Register(bz_ePlayerDieEvent);\n    Register(bz_ePlayerPartEvent);\n    Register(bz_ePlayerSpawnEvent);\n    Register(bz_ePlayerUpdateEvent);\n\n    \/\/ Register our custom slash commands\n    bz_registerCustomSlashCommand(\"mine\", this);\n\n    \/\/ Initialize all of the witty death messages\n    initializeMessages();\n\n    \/\/ Set some custom BZDB variables\n    bzdb_SpawnSafetyTime = bztk_registerCustomDoubleBZDB(\"_mineSafetyTime\", 5.0);\n}\n\nvoid UselessMine::Cleanup (void)\n{\n    Flush(); \/\/ Clean up all the events\n\n    \/\/ Clean up our custom slash commands\n    bz_removeCustomSlashCommand(\"mine\");\n}\n\nvoid UselessMine::Event (bz_EventData *eventData)\n{\n    switch (eventData->eventType)\n    {\n        case bz_eFlagGrabbedEvent: \/\/ This event is called each time a flag is grabbed by a player\n        {\n            bz_FlagGrabbedEventData_V1* flagGrabData = (bz_FlagGrabbedEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/    (int)           playerID  - The player that grabbed the flag\n            \/\/    (int)           flagID    - The flag ID that was grabbed\n            \/\/    (bz_ApiString)  flagType  - The flag abbreviation of the flag that was grabbed\n            \/\/    (float[3])      pos       - The position at which the flag was grabbed\n            \/\/    (double)        eventTime - This value is the local server time of the event.\n\n            \/\/ If the user grabbed the Useless flag, let them know they can place a mine\n            if (strcmp(flagGrabData->flagType, \"US\") == 0)\n            {\n                bz_sendTextMessage(BZ_SERVER, flagGrabData->playerID, \"You grabbed a Useless flag! Type \/mine at any time to set a useless mine!\");\n            }\n        }\n        break;\n\n\n        case bz_ePlayerDieEvent: \/\/ This event is called each time a tank is killed.\n        {\n            bz_PlayerDieEventData_V1* dieData = (bz_PlayerDieEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/   (int)                   playerID       - ID of the player who was killed.\n            \/\/   (bz_eTeamType)          team           - The team the killed player was on.\n            \/\/   (int)                   killerID       - The owner of the shot that killed the player, or BZ_SERVER for server side kills\n            \/\/   (bz_eTeamType)          killerTeam     - The team the owner of the shot was on.\n            \/\/   (bz_ApiString)          flagKilledWith - The flag name the owner of the shot had when the shot was fired.\n            \/\/   (int)                   shotID         - The shot ID that killed the player, if the player was not killed by a shot, the id will be -1.\n            \/\/   (bz_PlayerUpdateState)  state          - The state record for the killed player at the time of the event\n            \/\/   (double)                eventTime      - Time of the event on the server.\n\n            int playerID = dieData->playerID;\n\n            \/\/ Loop through all the mines in play\n            for (int i = 0; i < getMineCount(); i++)\n            {\n                \/\/ Create a local variable for easy access\n                Mine &detonatedMine = activeMines.at(i);\n\n                \/\/ Check if the mine has already been detonated\n                if (detonatedMine.detonated)\n                {\n                    \/\/ Check if the victim killed is the player who just died\n                    if (detonatedMine.victim == playerID)\n                    {\n                        \/\/ Check if the player who just died was killed by the server\n                        if (dieData->killerID == 253)\n                        {\n                            \/\/ The random number used to fetch a random taunting death message\n                            int randomNumber = rand() % deathMessages.size();\n\n                            \/\/ Get the callsigns of the players\n                            const char* owner  = bz_getPlayerCallsign(detonatedMine.owner);\n                            const char* victim = bz_getPlayerCallsign(detonatedMine.victim);\n\n                            \/\/ Attribute the kill to the mine owner\n                            dieData->killerID = detonatedMine.owner;\n\n                            \/\/ This mine has been detonated and we're done with the information that we need\n                            removeMine(i);\n\n                            bz_sendTextMessagef(BZ_SERVER, BZ_ALLUSERS, deathMessages.at(randomNumber).c_str(), owner, victim);\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n        break;\n\n        case bz_ePlayerPartEvent: \/\/ This event is called each time a player leaves a game\n        {\n            bz_PlayerJoinPartEventData_V1* partData = (bz_PlayerJoinPartEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/    (int)                   playerID  - The player ID that is leaving\n            \/\/    (bz_BasePlayerRecord*)  record    - The player record for the leaving player\n            \/\/    (bz_ApiString)          reason    - The reason for leaving, such as a kick or a ban\n            \/\/    (double)                eventTime - Time of event.\n\n            int playerID = partData->playerID;\n\n            removeAllMines(playerID);\n        }\n        break;\n\n        case bz_ePlayerSpawnEvent: \/\/ This event is called each time a playing tank is being spawned into the world\n        {\n            bz_PlayerSpawnEventData_V1* spawnData = (bz_PlayerSpawnEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/    (int)                   playerID  - ID of the player who was added to the world.\n            \/\/    (bz_eTeamType)          team      - The team the player is a member of.\n            \/\/    (bz_PlayerUpdateState)  state     - The state record for the spawning player\n            \/\/    (double)                eventTime - Time local server time for the event.\n\n            int playerID = spawnData->playerID;\n\n            \/\/ Save the time the player spawned last\n            playerSpawnTime[playerID] = bz_getCurrentTime();\n        }\n        break;\n\n        case bz_ePlayerUpdateEvent: \/\/ This event is called each time a player sends an update to the server\n        {\n            bz_PlayerUpdateEventData_V1* updateData = (bz_PlayerUpdateEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/   (int)       playerID  - ID of the player that sent the update\n            \/\/   (float[3])  pos       - The player's current position\n            \/\/   (float[3])  velocity  - The player's current velocity\n            \/\/   (float)     azimuth   - The direction the player is facing\n            \/\/   (float)     angvel    - The player's angular velocity\n            \/\/   (int)       phydrv    - The physics driver the player is on\n            \/\/   (double)    eventTime - The current server time\n\n            int playerID = updateData->playerID;\n\n            \/\/ Loop through all of the players\n            for (int i = 0; i < getMineCount(); i++)\n            {\n                \/\/ Make an easy access mine\n                Mine &currentMine = activeMines.at(i);\n\n                \/\/ If the mine owner is not the player triggering the mine (so no self kills) and the player is a rogue or does is an enemy team relative to the mine owner\n                if (currentMine.owner != playerID && (bz_getPlayerTeam(playerID) == eRogueTeam || bz_getPlayerTeam(playerID) != currentMine.team))\n                {\n                    \/\/ Make easy to access variables\n                    float  playerPos[3] = {updateData->state.pos[0], updateData->state.pos[1], updateData->state.pos[2]};\n                    double shockRange   = bz_getBZDBDouble(\"_shockOutRadius\") * 0.75;\n\n                    \/\/ Check if the player is in the detonation range\n                    if ((playerPos[0] > currentMine.x - shockRange && playerPos[0] < currentMine.x + shockRange) &&\n                        (playerPos[1] > currentMine.y - shockRange && playerPos[1] < currentMine.y + shockRange) &&\n                        (playerPos[2] > currentMine.z - shockRange && playerPos[2] < currentMine.z + shockRange) &&\n                        playerSpawnTime[playerID] + bzdb_SpawnSafetyTime <= bz_getCurrentTime() && !currentMine.detonated)\n                    {\n                        \/\/ Check that the mine owner exists and is not an observer\n                        if (bztk_isValidPlayerID(currentMine.owner) && bz_getPlayerTeam(currentMine.owner) != eObservers)\n                        {\n                            \/\/ Get the current mine position\n                            float minePos[3] = {currentMine.x, currentMine.y, currentMine.z};\n\n                            \/\/ Save who detonated the mine and mark it as detonated\n                            currentMine.victim    = playerID;\n                            currentMine.detonated = true;\n\n                            \/\/ BOOM!\n                            bz_fireWorldWep(\"SW\", 2.0, BZ_SERVER, minePos, 0, 0, 0, currentMine.team);\n                        }\n                        \/\/ Just in case the player doesn't exist or is an observer, then remove the mine because it shouldn't be there\n                        else\n                        {\n                            removeMine(i);\n                        }\n\n                        break;\n                    }\n                }\n            }\n        }\n        break;\n\n        default: break;\n    }\n}\n\nbool UselessMine::SlashCommand(int playerID, bz_ApiString command, bz_ApiString \/*message*\/, bz_APIStringList *params)\n{\n    if (command == \"mine\")\n    {\n        std::shared_ptr<bz_BasePlayerRecord> playerRecord(bz_getPlayerByIndex(playerID));\n\n        \/\/ If the player is not an observer, they let them proceed to the next check\n        if (playerRecord->team != eObservers)\n        {\n            \/\/ Check if the player has the Useless flag\n            if (playerRecord->currentFlag == \"USeless (+US)\")\n            {\n                \/\/ Store their current position\n                float currentPosition[3] = {playerRecord->lastKnownState.pos[0], playerRecord->lastKnownState.pos[1], playerRecord->lastKnownState.pos[2]};\n\n                setMine(playerID, currentPosition, playerRecord->team);\n            }\n            else\n            {\n                bz_sendTextMessage(BZ_SERVER, playerID, \"You can't place a mine without the Useless flag!\");\n            }\n        }\n        else\n        {\n            bz_sendTextMessage(BZ_SERVER, playerID, \"Silly observer, you can't place a mine.\");\n        }\n\n        return true;\n    }\n}\n\n\/\/ A shortcut to get the amount of mines that are in play\nint UselessMine::getMineCount()\n{\n    return activeMines.size();\n}\n\n\/\/ In order to keep things organized, this function is where you can specify all the witty death messages you want to be available\nvoid UselessMine::initializeMessages()\n{\n    deathMessages.push_back(\"%s was killed by %s's mine.\");\n    deathMessages.push_back(\"%s was owned by %s's mine.\");\n    deathMessages.push_back(\"%s was obliterated by %s's mine.\");\n    deathMessages.push_back(\"%s's tank disintegrated from %s's mine.\");\n    deathMessages.push_back(\"%s was permanently blinded by the bright light from %s's mine.\");\n    deathMessages.push_back(\"%s was sent shooting into the stars by %s's mine.\");\n    deathMessages.push_back(\"%s was never heard from again thanks to %s's mine.\");\n    deathMessages.push_back(\"We salute %s for taking an atrocious hit from %s's mine.\");\n    deathMessages.push_back(\"%s's mine left %s's tank parts scattered all over.\");\n    deathMessages.push_back(\"%s thought %s's mine was a shiny brand new car.\");\n    deathMessages.push_back(\"%s was bombarded by many concussive attacks from %s's mine.\");\n    deathMessages.push_back(\"%s was ignited by %s's mine.\");\n    deathMessages.push_back(\"%s's mine bursted %s's tank to bite-size flaming pieces.\");\n    deathMessages.push_back(\"%s took a nosedive into %s's mine.\");\n    deathMessages.push_back(\"%s fell face first into %s's mine.\");\n    deathMessages.push_back(\"I knew %s would be clumsy enough to run into %s's mine.\");\n    deathMessages.push_back(\"%s killed %s with a mine. No surprise there.\");\n    deathMessages.push_back(\"DID YOU SEE THAT? %s did total carnage to %s's tank with that one little mine.\");\n    deathMessages.push_back(\"%s purposely ran into %s's mine.\");\n    deathMessages.push_back(\"I ascertain that %s has been ruptured by a mine created from the heavens with the name dubbed %s.\");\n}\n\nvoid UselessMine::removeAllMines(int playerID)\n{\n    \/\/ Go through all of the mines\n    for (int i = 0; i < getMineCount(); i++)\n    {\n        \/\/ Quick access mine\n        Mine &currentMine = activeMines.at(i);\n\n        \/\/ If the mine belongs to the player, remove it\n        if (currentMine.owner == playerID)\n        {\n            removeMine(i);\n        }\n    }\n}\n\n\/\/ A shortcut to remove a mine from play\nvoid UselessMine::removeMine(int mineIndex)\n{\n    activeMines.erase(activeMines.begin() + mineIndex);\n}\n\n\/\/ A shortcut to set a mine\nvoid UselessMine::setMine(int owner, float pos[3], bz_eTeamType team)\n{\n    \/\/ Remove their flag because it's going to be a US flag\n    bz_removePlayerFlag(owner);\n\n    \/\/ Push the new mine\n    Mine newMine(owner, pos, team);\n    activeMines.push_back(newMine);\n}<commit_msg>Silly me. Fix order of mine owner and victim in death messages<commit_after>\/*\nUselessMine\n    Copyright (C) 2014 Vladimir \"allejo\" Jimenez\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 <memory>\n#include <stdlib.h>\n\n#include \"bzfsAPI.h\"\n#include \"bztoolkit\/bzToolkitAPI.h\"\n\n\/\/ Define plugin name\nconst std::string PLUGIN_NAME = \"Useless Mine\";\n\n\/\/ Define plugin version numbering\nconst int MAJOR = 1;\nconst int MINOR = 0;\nconst int REV = 0;\nconst int BUILD = 8;\n\nclass UselessMine : public bz_Plugin, public bz_CustomSlashCommandHandler\n{\npublic:\n    virtual const char* Name ();\n    virtual void Init (const char* config);\n    virtual void Event (bz_EventData *eventData);\n    virtual void Cleanup (void);\n\n    virtual bool SlashCommand (int playerID, bz_ApiString, bz_ApiString, bz_APIStringList*);\n\n    virtual int  getMineCount ();\n    virtual void initializeMessages (void),\n                 removeAllMines(int playerID),\n                 removeMine (int mineIndex),\n                 setMine (int owner, float pos[3], bz_eTeamType team);\n\n    \/\/ The information each mine will contain\n    struct Mine\n    {\n        int owner, victim; \/\/ The owner of the mine and the victim, respectively\n\n        float x, y, z;     \/\/ The coordinates of where the mine was placed\n\n        bz_eTeamType team; \/\/ The team of the owner\n\n        bool detonated;    \/\/ Whether or not the mine has been detonated; to prepare it for removal from play\n\n        Mine (int _owner, float _pos[3], bz_eTeamType _team) :\n            owner(_owner),\n            victim(-1),\n            x(_pos[0]),\n            y(_pos[1]),\n            z(_pos[2]),\n            team(_team),\n            detonated(false)\n        {}\n    };\n\n    std::vector<Mine>        activeMines;   \/\/ A vector that will store all of the mines that are in play\n    std::vector<std::string> deathMessages; \/\/ A vector that will store all of the witty death messages\n\n    double bzdb_SpawnSafetyTime, \/\/ The BZDB variable that will store the amount of seconds a player has before a mine is detonated\n           playerSpawnTime[256]; \/\/ The time of a player's last spawn time used to calculate their safety from detonation\n};\n\nBZ_PLUGIN(UselessMine)\n\nconst char* UselessMine::Name (void)\n{\n    static std::string pluginBuild = \"\";\n\n    if (!pluginBuild.size())\n    {\n        std::ostringstream pluginBuildStream;\n\n        pluginBuildStream << PLUGIN_NAME << \" \" << MAJOR << \".\" << MINOR << \".\" << REV << \" (\" << BUILD << \")\";\n        pluginBuild = pluginBuildStream.str();\n    }\n\n    return pluginBuild.c_str();\n}\n\nvoid UselessMine::Init (const char* commandLine)\n{\n    \/\/ Register our events with Register()\n    Register(bz_eFlagGrabbedEvent);\n    Register(bz_ePlayerDieEvent);\n    Register(bz_ePlayerPartEvent);\n    Register(bz_ePlayerSpawnEvent);\n    Register(bz_ePlayerUpdateEvent);\n\n    \/\/ Register our custom slash commands\n    bz_registerCustomSlashCommand(\"mine\", this);\n\n    \/\/ Initialize all of the witty death messages\n    initializeMessages();\n\n    \/\/ Set some custom BZDB variables\n    bzdb_SpawnSafetyTime = bztk_registerCustomDoubleBZDB(\"_mineSafetyTime\", 5.0);\n}\n\nvoid UselessMine::Cleanup (void)\n{\n    Flush(); \/\/ Clean up all the events\n\n    \/\/ Clean up our custom slash commands\n    bz_removeCustomSlashCommand(\"mine\");\n}\n\nvoid UselessMine::Event (bz_EventData *eventData)\n{\n    switch (eventData->eventType)\n    {\n        case bz_eFlagGrabbedEvent: \/\/ This event is called each time a flag is grabbed by a player\n        {\n            bz_FlagGrabbedEventData_V1* flagGrabData = (bz_FlagGrabbedEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/    (int)           playerID  - The player that grabbed the flag\n            \/\/    (int)           flagID    - The flag ID that was grabbed\n            \/\/    (bz_ApiString)  flagType  - The flag abbreviation of the flag that was grabbed\n            \/\/    (float[3])      pos       - The position at which the flag was grabbed\n            \/\/    (double)        eventTime - This value is the local server time of the event.\n\n            \/\/ If the user grabbed the Useless flag, let them know they can place a mine\n            if (strcmp(flagGrabData->flagType, \"US\") == 0)\n            {\n                bz_sendTextMessage(BZ_SERVER, flagGrabData->playerID, \"You grabbed a Useless flag! Type \/mine at any time to set a useless mine!\");\n            }\n        }\n        break;\n\n\n        case bz_ePlayerDieEvent: \/\/ This event is called each time a tank is killed.\n        {\n            bz_PlayerDieEventData_V1* dieData = (bz_PlayerDieEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/   (int)                   playerID       - ID of the player who was killed.\n            \/\/   (bz_eTeamType)          team           - The team the killed player was on.\n            \/\/   (int)                   killerID       - The owner of the shot that killed the player, or BZ_SERVER for server side kills\n            \/\/   (bz_eTeamType)          killerTeam     - The team the owner of the shot was on.\n            \/\/   (bz_ApiString)          flagKilledWith - The flag name the owner of the shot had when the shot was fired.\n            \/\/   (int)                   shotID         - The shot ID that killed the player, if the player was not killed by a shot, the id will be -1.\n            \/\/   (bz_PlayerUpdateState)  state          - The state record for the killed player at the time of the event\n            \/\/   (double)                eventTime      - Time of the event on the server.\n\n            int playerID = dieData->playerID;\n\n            \/\/ Loop through all the mines in play\n            for (int i = 0; i < getMineCount(); i++)\n            {\n                \/\/ Create a local variable for easy access\n                Mine &detonatedMine = activeMines.at(i);\n\n                \/\/ Check if the mine has already been detonated\n                if (detonatedMine.detonated)\n                {\n                    \/\/ Check if the victim killed is the player who just died\n                    if (detonatedMine.victim == playerID)\n                    {\n                        \/\/ Check if the player who just died was killed by the server\n                        if (dieData->killerID == 253)\n                        {\n                            \/\/ The random number used to fetch a random taunting death message\n                            int randomNumber = rand() % deathMessages.size();\n\n                            \/\/ Get the callsigns of the players\n                            const char* owner  = bz_getPlayerCallsign(detonatedMine.owner);\n                            const char* victim = bz_getPlayerCallsign(detonatedMine.victim);\n\n                            \/\/ Attribute the kill to the mine owner\n                            dieData->killerID = detonatedMine.owner;\n\n                            \/\/ This mine has been detonated and we're done with the information that we need\n                            removeMine(i);\n\n                            bz_sendTextMessagef(BZ_SERVER, BZ_ALLUSERS, deathMessages.at(randomNumber).c_str(), victim, owner);\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n        break;\n\n        case bz_ePlayerPartEvent: \/\/ This event is called each time a player leaves a game\n        {\n            bz_PlayerJoinPartEventData_V1* partData = (bz_PlayerJoinPartEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/    (int)                   playerID  - The player ID that is leaving\n            \/\/    (bz_BasePlayerRecord*)  record    - The player record for the leaving player\n            \/\/    (bz_ApiString)          reason    - The reason for leaving, such as a kick or a ban\n            \/\/    (double)                eventTime - Time of event.\n\n            int playerID = partData->playerID;\n\n            removeAllMines(playerID);\n        }\n        break;\n\n        case bz_ePlayerSpawnEvent: \/\/ This event is called each time a playing tank is being spawned into the world\n        {\n            bz_PlayerSpawnEventData_V1* spawnData = (bz_PlayerSpawnEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/    (int)                   playerID  - ID of the player who was added to the world.\n            \/\/    (bz_eTeamType)          team      - The team the player is a member of.\n            \/\/    (bz_PlayerUpdateState)  state     - The state record for the spawning player\n            \/\/    (double)                eventTime - Time local server time for the event.\n\n            int playerID = spawnData->playerID;\n\n            \/\/ Save the time the player spawned last\n            playerSpawnTime[playerID] = bz_getCurrentTime();\n        }\n        break;\n\n        case bz_ePlayerUpdateEvent: \/\/ This event is called each time a player sends an update to the server\n        {\n            bz_PlayerUpdateEventData_V1* updateData = (bz_PlayerUpdateEventData_V1*)eventData;\n\n            \/\/ Data\n            \/\/ ---\n            \/\/   (int)       playerID  - ID of the player that sent the update\n            \/\/   (float[3])  pos       - The player's current position\n            \/\/   (float[3])  velocity  - The player's current velocity\n            \/\/   (float)     azimuth   - The direction the player is facing\n            \/\/   (float)     angvel    - The player's angular velocity\n            \/\/   (int)       phydrv    - The physics driver the player is on\n            \/\/   (double)    eventTime - The current server time\n\n            int playerID = updateData->playerID;\n\n            \/\/ Loop through all of the players\n            for (int i = 0; i < getMineCount(); i++)\n            {\n                \/\/ Make an easy access mine\n                Mine &currentMine = activeMines.at(i);\n\n                \/\/ If the mine owner is not the player triggering the mine (so no self kills) and the player is a rogue or does is an enemy team relative to the mine owner\n                if (currentMine.owner != playerID && (bz_getPlayerTeam(playerID) == eRogueTeam || bz_getPlayerTeam(playerID) != currentMine.team))\n                {\n                    \/\/ Make easy to access variables\n                    float  playerPos[3] = {updateData->state.pos[0], updateData->state.pos[1], updateData->state.pos[2]};\n                    double shockRange   = bz_getBZDBDouble(\"_shockOutRadius\") * 0.75;\n\n                    \/\/ Check if the player is in the detonation range\n                    if ((playerPos[0] > currentMine.x - shockRange && playerPos[0] < currentMine.x + shockRange) &&\n                        (playerPos[1] > currentMine.y - shockRange && playerPos[1] < currentMine.y + shockRange) &&\n                        (playerPos[2] > currentMine.z - shockRange && playerPos[2] < currentMine.z + shockRange) &&\n                        playerSpawnTime[playerID] + bzdb_SpawnSafetyTime <= bz_getCurrentTime() && !currentMine.detonated)\n                    {\n                        \/\/ Check that the mine owner exists and is not an observer\n                        if (bztk_isValidPlayerID(currentMine.owner) && bz_getPlayerTeam(currentMine.owner) != eObservers)\n                        {\n                            \/\/ Get the current mine position\n                            float minePos[3] = {currentMine.x, currentMine.y, currentMine.z};\n\n                            \/\/ Save who detonated the mine and mark it as detonated\n                            currentMine.victim    = playerID;\n                            currentMine.detonated = true;\n\n                            \/\/ BOOM!\n                            bz_fireWorldWep(\"SW\", 2.0, BZ_SERVER, minePos, 0, 0, 0, currentMine.team);\n                        }\n                        \/\/ Just in case the player doesn't exist or is an observer, then remove the mine because it shouldn't be there\n                        else\n                        {\n                            removeMine(i);\n                        }\n\n                        break;\n                    }\n                }\n            }\n        }\n        break;\n\n        default: break;\n    }\n}\n\nbool UselessMine::SlashCommand(int playerID, bz_ApiString command, bz_ApiString \/*message*\/, bz_APIStringList *params)\n{\n    if (command == \"mine\")\n    {\n        std::shared_ptr<bz_BasePlayerRecord> playerRecord(bz_getPlayerByIndex(playerID));\n\n        \/\/ If the player is not an observer, they let them proceed to the next check\n        if (playerRecord->team != eObservers)\n        {\n            \/\/ Check if the player has the Useless flag\n            if (playerRecord->currentFlag == \"USeless (+US)\")\n            {\n                \/\/ Store their current position\n                float currentPosition[3] = {playerRecord->lastKnownState.pos[0], playerRecord->lastKnownState.pos[1], playerRecord->lastKnownState.pos[2]};\n\n                setMine(playerID, currentPosition, playerRecord->team);\n            }\n            else\n            {\n                bz_sendTextMessage(BZ_SERVER, playerID, \"You can't place a mine without the Useless flag!\");\n            }\n        }\n        else\n        {\n            bz_sendTextMessage(BZ_SERVER, playerID, \"Silly observer, you can't place a mine.\");\n        }\n\n        return true;\n    }\n}\n\n\/\/ A shortcut to get the amount of mines that are in play\nint UselessMine::getMineCount()\n{\n    return activeMines.size();\n}\n\n\/\/ In order to keep things organized, this function is where you can specify all the witty death messages you want to be available\nvoid UselessMine::initializeMessages()\n{\n    deathMessages.push_back(\"%s was killed by %s's mine.\");\n    deathMessages.push_back(\"%s was owned by %s's mine.\");\n    deathMessages.push_back(\"%s was obliterated by %s's mine.\");\n    deathMessages.push_back(\"%s's tank disintegrated from %s's mine.\");\n    deathMessages.push_back(\"%s was permanently blinded by the bright light from %s's mine.\");\n    deathMessages.push_back(\"%s was sent shooting into the stars by %s's mine.\");\n    deathMessages.push_back(\"%s was never heard from again thanks to %s's mine.\");\n    deathMessages.push_back(\"We salute %s for taking an atrocious hit from %s's mine.\");\n    deathMessages.push_back(\"%s's mine left %s's tank parts scattered all over.\");\n    deathMessages.push_back(\"%s thought %s's mine was a shiny brand new car.\");\n    deathMessages.push_back(\"%s was bombarded by many concussive attacks from %s's mine.\");\n    deathMessages.push_back(\"%s was ignited by %s's mine.\");\n    deathMessages.push_back(\"%s's mine bursted %s's tank to bite-size flaming pieces.\");\n    deathMessages.push_back(\"%s took a nosedive into %s's mine.\");\n    deathMessages.push_back(\"%s fell face first into %s's mine.\");\n    deathMessages.push_back(\"I knew %s would be clumsy enough to run into %s's mine.\");\n    deathMessages.push_back(\"%s killed %s with a mine. No surprise there.\");\n    deathMessages.push_back(\"DID YOU SEE THAT? %s did total carnage to %s's tank with that one little mine.\");\n    deathMessages.push_back(\"%s purposely ran into %s's mine.\");\n    deathMessages.push_back(\"I ascertain that %s has been ruptured by a mine created from the heavens with the name dubbed %s.\");\n}\n\nvoid UselessMine::removeAllMines(int playerID)\n{\n    \/\/ Go through all of the mines\n    for (int i = 0; i < getMineCount(); i++)\n    {\n        \/\/ Quick access mine\n        Mine &currentMine = activeMines.at(i);\n\n        \/\/ If the mine belongs to the player, remove it\n        if (currentMine.owner == playerID)\n        {\n            removeMine(i);\n        }\n    }\n}\n\n\/\/ A shortcut to remove a mine from play\nvoid UselessMine::removeMine(int mineIndex)\n{\n    activeMines.erase(activeMines.begin() + mineIndex);\n}\n\n\/\/ A shortcut to set a mine\nvoid UselessMine::setMine(int owner, float pos[3], bz_eTeamType team)\n{\n    \/\/ Remove their flag because it's going to be a US flag\n    bz_removePlayerFlag(owner);\n\n    \/\/ Push the new mine\n    Mine newMine(owner, pos, team);\n    activeMines.push_back(newMine);\n}<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  AliEveHLTZMQeventManager\n\/\/\n\/\/  blame: Mikolaj Krzewicki, mikolaj.krzewicki@cern.ch\n\/\/\n\/\/\n\n#include \"AliEveHLTZMQeventManager.h\"\n\n#include \"AliEveConfigManager.h\"\n#include \"AliCDBManager.h\"\n#include \"AliGRPPreprocessor.h\"\n#include <TEnv.h>\n#include <TInterpreter.h>\n#include <iostream>\n\n#include \"AliHLTComponent.h\"\n#include \"AliHLTMessage.h\"\n\n#include \"AliOnlineReconstructionUtil.h\"\n\n#ifdef ZMQ\n#include \"zmq.h\"\n#endif\n\n\nusing namespace std;\n\nAliEveHLTZMQeventManager::AliEveHLTZMQeventManager(Int_t ev, bool storageManager) :\n    AliEveEventManager(\"HLT\",ev,false),\n    fEventListenerThreadHLT(0),\n    fCurrentRun(-1),\n    fZMQContext(NULL),\n    fZMQeventQueue(NULL),\n    fHLTPublisherAddress(\"tcp:\/\/localhost:60201\")\n{\n#ifdef ZMQ\n  fIsOpen=kTRUE;\n  \/\/get the address of the HLT proxy from the environment\n  if (gSystem->Getenv(\"HLT_ZMQ_proxy\")) \n    fHLTPublisherAddress=gSystem->Getenv(\"HLT_ZMQ_proxy\");\n  \/\/single ZMQ context for inter thread comm. etc.\n  fZMQContext = zmq_ctx_new();\n  \/\/single ZMQ socket for gathering the events form various listening threads\n  \/\/must be bound before threads can connect\n  fZMQeventQueue = zmq_socket(fZMQContext, ZMQ_PULL);\n  zmq_bind(fZMQeventQueue, \"inproc:\/\/fCurrentEvent\");\n\n  cout<<\"ZMQ FOUND. Starting subscriber threads.\"<<endl;\n  fEventListenerThreadHLT = new TThread(\"fEventListenerThreadHLT\",DispatchEventListenerHLT,(void*)this);\n  fEventListenerThreadHLT->Run();\n#endif\n    \n  AliEveEventManager::SetMaster(this);\n}\n\nAliEveHLTZMQeventManager::~AliEveHLTZMQeventManager()\n{\n#ifdef ZMQ\n  if (fZMQeventQueue)\n  {\n    int lingerValue = 0;\n    int rc = zmq_setsockopt(fZMQeventQueue, ZMQ_LINGER, &lingerValue, sizeof(int));\n    if (rc<0) printf(\"error setting linger on fZMQeventQueue\\n\");\n    rc = zmq_close(fZMQeventQueue);\n    if (rc<0) printf(\"error closing socket fZMQeventQueue\\n\");\n  }\n\n  printf(\"trying to destroy fZMQContext\\n\");\n  if (fZMQContext) zmq_ctx_destroy(fZMQContext);\n  printf(\"destroyed fZMQContext\\n\");\n#endif\n\n  if(fEventListenerThreadHLT)\n  {\n    fEventListenerThreadHLT->Join();\n    fEventListenerThreadHLT->Kill();\n    delete fEventListenerThreadHLT;\n    cout<<\"HLT listener thread killed and deleted\"<<endl;\n  }\n\n\n}\n\nvoid AliEveHLTZMQeventManager::PullEventFromHLT()\n{\n#ifdef ZMQ\n  int rc = 0;\n  \n  if (!fZMQContext) return;\n  \n  \/\/connection to the HLT data\n  void* listenerSocket = zmq_socket(fZMQContext, ZMQ_SUB);\n  if (!listenerSocket) {return;}\n  printf(\"connecting to ZMQ socket: %s\\n\", fHLTPublisherAddress.Data());\n  rc = zmq_connect(listenerSocket, fHLTPublisherAddress.Data());\n  rc = zmq_setsockopt (listenerSocket, ZMQ_SUBSCRIBE, NULL, 0);\n  if (rc < 0) {return;}\n\n  \/\/internal publisher\n  void* internalPublisher = zmq_socket(fZMQContext, ZMQ_PUSH);\n  if (!internalPublisher) {return;}\n  rc = zmq_connect(internalPublisher, \"inproc:\/\/fCurrentEvent\");\n  if (rc < 0) {return;}\n  \n  \/\/create a default selection of any data:\n  char requestedTopic[kAliHLTComponentDataTypeTopicSize+1]; memset(&requestedTopic, 0, sizeof(requestedTopic));\n  memset(&requestedTopic, '*', kAliHLTComponentDataTypeTopicSize);\n  strncpy(requestedTopic, \"ALIESDV0HLT**************\", kAliHLTComponentDataTypeTopicSize);\n  char requestedTopic1[kAliHLTComponentDataTypeTopicSize+1]; memset(&requestedTopic1, 0, sizeof(requestedTopic1));\n  memset(&requestedTopic1, '*', kAliHLTComponentDataTypeTopicSize);\n  strncpy(requestedTopic1, \"FLATESD**************\", kAliHLTComponentDataTypeTopicSize);\n\n  Bool_t done=false;\n  while (!done)\n  {\n    int more = 0;\n    size_t more_size = sizeof more;\n    do\n    {\n      \/\/here the HLT data comes in\n      \/\/receive the topic\n      char receivedTopic[kAliHLTComponentDataTypeTopicSize+1]; memset(&receivedTopic, 0, sizeof(receivedTopic));\n      int receivedTopicSize = zmq_recv(listenerSocket, &receivedTopic, sizeof(receivedTopic), 0);\n      if (receivedTopicSize < 0 && errno==ETERM) {printf(\"listenerSocket received ETERM, exiting main loop\\n\"); done=true; break;}\n\n      \/\/reive the message if there is any\n      zmq_msg_t message;\n      rc = zmq_msg_init(&message);\n      rc = zmq_getsockopt(listenerSocket, ZMQ_RCVMORE, &more, &more_size);\n      if (more) \n      {\n        rc = zmq_msg_recv(&message, listenerSocket, 0);\n        if (rc < 0 && errno==ETERM) { zmq_msg_close(&message); done=true; break; }\n      }\n      rc = zmq_getsockopt(listenerSocket, ZMQ_RCVMORE, &more, &more_size);\n      \n      \/\/after receiving a single part (topic+message) publish it internally\n      \/\/in general this will be an HLT ESD.\n      \/\/do check first if this is what we wanted\n      bool isSelected = Topicncmp(requestedTopic, receivedTopic, kAliHLTComponentDataTypeTopicSize, receivedTopicSize) ||\n                        Topicncmp(requestedTopic1, receivedTopic, kAliHLTComponentDataTypeTopicSize, receivedTopicSize);\n                      \n      if (!isSelected)\n      {\n        \/\/clean up the memory and continue\n        \/\/printf(\"  dropped %s\\n\",receivedTopic);\n        zmq_msg_close(&message);\n        continue;\n      }\n\n      \/\/publish the data for further use\n      rc = -1;\n      \/\/printf(\"pushing %s\\n\", receivedTopic);\n      rc = zmq_send(internalPublisher, &receivedTopic, receivedTopicSize, ZMQ_SNDMORE);\n      rc = zmq_msg_send(&message, internalPublisher, 0);\n      if (rc < 0) zmq_msg_close(&message);\n\n    } while (more != 0);\n  }\n  \/\/cleanly exit the thread\n  int lingerValue = 10;\n  rc = zmq_setsockopt(listenerSocket, ZMQ_LINGER, &lingerValue, sizeof(lingerValue));\n  if (rc<0) printf(\"error setting linger on listenerSocket, errno: %i\\n\", errno);\n  rc = zmq_setsockopt(internalPublisher, ZMQ_LINGER, &lingerValue, sizeof(lingerValue));\n  if (rc<0) printf(\"error setting linger on internalPublisher, errno: %i\\n\",errno);\n  rc = zmq_close(listenerSocket);\n  if (rc<0) printf(\"error closing listenerSocket, errno: %i\\n\", errno);\n  rc = zmq_close(internalPublisher);\n  if (rc<0) printf(\"error closing internalPublisher, errno: %i\\n\", errno);\n#endif\n}\n\nvoid AliEveHLTZMQeventManager::InitOCDB(int runNo)\n{\n    AliCDBManager* cdb = AliCDBManager::Instance();\n    if (runNo!=fCurrentRun){\n      fCurrentRun=runNo;\n      cdb->SetRun(runNo);\n    }\n}\n\nvoid AliEveHLTZMQeventManager::GotoEvent(Int_t \/*event*\/)\n{\n    static const TEveException kEH(\"AliEveEventManager::GotoEvent \");\n    \n    if (fAutoLoadTimerRunning){throw (kEH + \"Event auto-load timer is running.\");}\n    \n    NextEvent();\n    gEve->Redraw3D(kFALSE, kTRUE); \/\/ Enforce drop of all logicals.\n    \n    return;\n    \n}\n\nvoid AliEveHLTZMQeventManager::NextEvent()\n{\n    static const TEveException kEH(\"AliEveEventManager::NextEvent \");\n  \/\/read event from queue\n  if (fAutoLoadTimerRunning){throw (kEH + \"Event auto-load timer is running.\");}\n\n#ifdef ZMQ\n  \/\/init some stuff\n  int rc = 0;\n  AliESDEvent* esdObject = NULL;\n  char topic[kAliHLTComponentDataTypeTopicSize+1]; memset(topic, 0, sizeof(topic));\n  memset(topic, 0, kAliHLTComponentDataTypeTopicSize);\n  zmq_msg_t message;\n  rc = zmq_msg_init(&message);\n  int64_t more = 0;\n  size_t more_size = sizeof(more);\n\n  \/\/try to receive a new topic+message from the queue\n  int topicSize = zmq_recv(fZMQeventQueue, &topic, kAliHLTComponentDataTypeTopicSize, ZMQ_DONTWAIT);\n  int errnoTopic = errno;\n  rc = zmq_getsockopt(fZMQeventQueue, ZMQ_RCVMORE, &more, &more_size);\n  if (more) rc = zmq_msg_recv(&message, fZMQeventQueue, ZMQ_DONTWAIT);\n\n  \/\/decode the message into an AliESDEvent,\n  \/\/for HLT messages AliHLTMessage needs to be used\n  if( topicSize > 0 \/*&& errnoTopic != EAGAIN*\/ && zmq_msg_size(&message) > 0 )\n  {\n    if (Topicncmp(topic, \"ALIESDV0HLT\", topicSize, 11))\n    {\n      printf(\"trying to decode %s with AliHLTMessage\\n\", topic);\n      AliHLTMessage msg(zmq_msg_data(&message), zmq_msg_size(&message));\n      TClass* objclass = msg.GetClass();\n      esdObject = static_cast<AliESDEvent*>(msg.ReadObject(AliESDEvent::Class()));\n    }\n    else if (Topicncmp(topic, \"ALIESDV0POR\", topicSize, 11))\n    {\n      printf(\"trying to decode %s with TBufferFile\\n\", topic);\n      TBufferFile *mess = new TBufferFile(TBuffer::kRead,\n          zmq_msg_size(&message)+sizeof(UInt_t),\n          zmq_msg_data(&message));\n      mess->InitMap();\n      mess->ReadClass();\/\/ get first the class stored in message\n      mess->SetBufferOffset(sizeof(UInt_t) + sizeof(kMESS_OBJECT));\n      mess->ResetMap();\n      esdObject = (AliESDEvent*)(mess->ReadObjectAny(AliESDEvent::Class()));\n    } \n    else\n    {\n      printf(\"Don't know what to do with %s\\n\",topic);\n    }\n  }\n  if (esdObject) \n  {\n    printf(\"setting new event\\n\");\n    esdObject->GetStdContent();\n    DestroyElements();\n    int runNumber = esdObject->GetRunNumber();\n    InitOCDB(runNumber);\n\n    \/\/replace the ESD\n    delete fESD;\n    fESD = esdObject;\n    fHasEvent=kTRUE;\n    \n    AfterNewEventLoaded();\n  }\n  else\n  {\n    cout<<\"No new event is avaliable.\"<<endl;\n    fHasEvent=kFALSE;\n    NoEventLoaded();\n  }\n  zmq_msg_close(&message);\n#endif\n  gSystem->ProcessEvents();\n}\n\n<commit_msg>cleanup includes<commit_after>\/\/\n\/\/  AliEveHLTZMQeventManager\n\/\/\n\/\/  blame: Mikolaj Krzewicki, mikolaj.krzewicki@cern.ch\n\/\/\n\/\/\n\n#include \"AliEveHLTZMQeventManager.h\"\n\n#include \"AliEveConfigManager.h\"\n#include \"AliCDBManager.h\"\n#include \"AliGRPPreprocessor.h\"\n#include <TEnv.h>\n#include <TInterpreter.h>\n#include <iostream>\n\n#include \"AliHLTComponent.h\"\n#include \"AliHLTMessage.h\"\n\n#ifdef ZMQ\n#include \"zmq.h\"\n#endif\n\n\nusing namespace std;\n\nAliEveHLTZMQeventManager::AliEveHLTZMQeventManager(Int_t ev, bool storageManager) :\n    AliEveEventManager(\"HLT\",ev,false),\n    fEventListenerThreadHLT(0),\n    fCurrentRun(-1),\n    fZMQContext(NULL),\n    fZMQeventQueue(NULL),\n    fHLTPublisherAddress(\"tcp:\/\/localhost:60201\")\n{\n#ifdef ZMQ\n  fIsOpen=kTRUE;\n  \/\/get the address of the HLT proxy from the environment\n  if (gSystem->Getenv(\"HLT_ZMQ_proxy\")) \n    fHLTPublisherAddress=gSystem->Getenv(\"HLT_ZMQ_proxy\");\n  \/\/single ZMQ context for inter thread comm. etc.\n  fZMQContext = zmq_ctx_new();\n  \/\/single ZMQ socket for gathering the events form various listening threads\n  \/\/must be bound before threads can connect\n  fZMQeventQueue = zmq_socket(fZMQContext, ZMQ_PULL);\n  zmq_bind(fZMQeventQueue, \"inproc:\/\/fCurrentEvent\");\n\n  cout<<\"ZMQ FOUND. Starting subscriber threads.\"<<endl;\n  fEventListenerThreadHLT = new TThread(\"fEventListenerThreadHLT\",DispatchEventListenerHLT,(void*)this);\n  fEventListenerThreadHLT->Run();\n#endif\n    \n  AliEveEventManager::SetMaster(this);\n}\n\nAliEveHLTZMQeventManager::~AliEveHLTZMQeventManager()\n{\n#ifdef ZMQ\n  if (fZMQeventQueue)\n  {\n    int lingerValue = 0;\n    int rc = zmq_setsockopt(fZMQeventQueue, ZMQ_LINGER, &lingerValue, sizeof(int));\n    if (rc<0) printf(\"error setting linger on fZMQeventQueue\\n\");\n    rc = zmq_close(fZMQeventQueue);\n    if (rc<0) printf(\"error closing socket fZMQeventQueue\\n\");\n  }\n\n  printf(\"trying to destroy fZMQContext\\n\");\n  if (fZMQContext) zmq_ctx_destroy(fZMQContext);\n  printf(\"destroyed fZMQContext\\n\");\n#endif\n\n  if(fEventListenerThreadHLT)\n  {\n    fEventListenerThreadHLT->Join();\n    fEventListenerThreadHLT->Kill();\n    delete fEventListenerThreadHLT;\n    cout<<\"HLT listener thread killed and deleted\"<<endl;\n  }\n\n\n}\n\nvoid AliEveHLTZMQeventManager::PullEventFromHLT()\n{\n#ifdef ZMQ\n  int rc = 0;\n  \n  if (!fZMQContext) return;\n  \n  \/\/connection to the HLT data\n  void* listenerSocket = zmq_socket(fZMQContext, ZMQ_SUB);\n  if (!listenerSocket) {return;}\n  printf(\"connecting to ZMQ socket: %s\\n\", fHLTPublisherAddress.Data());\n  rc = zmq_connect(listenerSocket, fHLTPublisherAddress.Data());\n  rc = zmq_setsockopt (listenerSocket, ZMQ_SUBSCRIBE, NULL, 0);\n  if (rc < 0) {return;}\n\n  \/\/internal publisher\n  void* internalPublisher = zmq_socket(fZMQContext, ZMQ_PUSH);\n  if (!internalPublisher) {return;}\n  rc = zmq_connect(internalPublisher, \"inproc:\/\/fCurrentEvent\");\n  if (rc < 0) {return;}\n  \n  \/\/create a default selection of any data:\n  char requestedTopic[kAliHLTComponentDataTypeTopicSize+1]; memset(&requestedTopic, 0, sizeof(requestedTopic));\n  memset(&requestedTopic, '*', kAliHLTComponentDataTypeTopicSize);\n  strncpy(requestedTopic, \"ALIESDV0HLT**************\", kAliHLTComponentDataTypeTopicSize);\n  char requestedTopic1[kAliHLTComponentDataTypeTopicSize+1]; memset(&requestedTopic1, 0, sizeof(requestedTopic1));\n  memset(&requestedTopic1, '*', kAliHLTComponentDataTypeTopicSize);\n  strncpy(requestedTopic1, \"FLATESD**************\", kAliHLTComponentDataTypeTopicSize);\n\n  Bool_t done=false;\n  while (!done)\n  {\n    int more = 0;\n    size_t more_size = sizeof more;\n    do\n    {\n      \/\/here the HLT data comes in\n      \/\/receive the topic\n      char receivedTopic[kAliHLTComponentDataTypeTopicSize+1]; memset(&receivedTopic, 0, sizeof(receivedTopic));\n      int receivedTopicSize = zmq_recv(listenerSocket, &receivedTopic, sizeof(receivedTopic), 0);\n      if (receivedTopicSize < 0 && errno==ETERM) {printf(\"listenerSocket received ETERM, exiting main loop\\n\"); done=true; break;}\n\n      \/\/reive the message if there is any\n      zmq_msg_t message;\n      rc = zmq_msg_init(&message);\n      rc = zmq_getsockopt(listenerSocket, ZMQ_RCVMORE, &more, &more_size);\n      if (more) \n      {\n        rc = zmq_msg_recv(&message, listenerSocket, 0);\n        if (rc < 0 && errno==ETERM) { zmq_msg_close(&message); done=true; break; }\n      }\n      rc = zmq_getsockopt(listenerSocket, ZMQ_RCVMORE, &more, &more_size);\n      \n      \/\/after receiving a single part (topic+message) publish it internally\n      \/\/in general this will be an HLT ESD.\n      \/\/do check first if this is what we wanted\n      bool isSelected = Topicncmp(requestedTopic, receivedTopic, kAliHLTComponentDataTypeTopicSize, receivedTopicSize) ||\n                        Topicncmp(requestedTopic1, receivedTopic, kAliHLTComponentDataTypeTopicSize, receivedTopicSize);\n                      \n      if (!isSelected)\n      {\n        \/\/clean up the memory and continue\n        \/\/printf(\"  dropped %s\\n\",receivedTopic);\n        zmq_msg_close(&message);\n        continue;\n      }\n\n      \/\/publish the data for further use\n      rc = -1;\n      \/\/printf(\"pushing %s\\n\", receivedTopic);\n      rc = zmq_send(internalPublisher, &receivedTopic, receivedTopicSize, ZMQ_SNDMORE);\n      rc = zmq_msg_send(&message, internalPublisher, 0);\n      if (rc < 0) zmq_msg_close(&message);\n\n    } while (more != 0);\n  }\n  \/\/cleanly exit the thread\n  int lingerValue = 10;\n  rc = zmq_setsockopt(listenerSocket, ZMQ_LINGER, &lingerValue, sizeof(lingerValue));\n  if (rc<0) printf(\"error setting linger on listenerSocket, errno: %i\\n\", errno);\n  rc = zmq_setsockopt(internalPublisher, ZMQ_LINGER, &lingerValue, sizeof(lingerValue));\n  if (rc<0) printf(\"error setting linger on internalPublisher, errno: %i\\n\",errno);\n  rc = zmq_close(listenerSocket);\n  if (rc<0) printf(\"error closing listenerSocket, errno: %i\\n\", errno);\n  rc = zmq_close(internalPublisher);\n  if (rc<0) printf(\"error closing internalPublisher, errno: %i\\n\", errno);\n#endif\n}\n\nvoid AliEveHLTZMQeventManager::InitOCDB(int runNo)\n{\n    AliCDBManager* cdb = AliCDBManager::Instance();\n    if (runNo!=fCurrentRun){\n      fCurrentRun=runNo;\n      cdb->SetRun(runNo);\n    }\n}\n\nvoid AliEveHLTZMQeventManager::GotoEvent(Int_t \/*event*\/)\n{\n    static const TEveException kEH(\"AliEveEventManager::GotoEvent \");\n    \n    if (fAutoLoadTimerRunning){throw (kEH + \"Event auto-load timer is running.\");}\n    \n    NextEvent();\n    gEve->Redraw3D(kFALSE, kTRUE); \/\/ Enforce drop of all logicals.\n    \n    return;\n    \n}\n\nvoid AliEveHLTZMQeventManager::NextEvent()\n{\n    static const TEveException kEH(\"AliEveEventManager::NextEvent \");\n  \/\/read event from queue\n  if (fAutoLoadTimerRunning){throw (kEH + \"Event auto-load timer is running.\");}\n\n#ifdef ZMQ\n  \/\/init some stuff\n  int rc = 0;\n  AliESDEvent* esdObject = NULL;\n  char topic[kAliHLTComponentDataTypeTopicSize+1]; memset(topic, 0, sizeof(topic));\n  memset(topic, 0, kAliHLTComponentDataTypeTopicSize);\n  zmq_msg_t message;\n  rc = zmq_msg_init(&message);\n  int64_t more = 0;\n  size_t more_size = sizeof(more);\n\n  \/\/try to receive a new topic+message from the queue\n  int topicSize = zmq_recv(fZMQeventQueue, &topic, kAliHLTComponentDataTypeTopicSize, ZMQ_DONTWAIT);\n  int errnoTopic = errno;\n  rc = zmq_getsockopt(fZMQeventQueue, ZMQ_RCVMORE, &more, &more_size);\n  if (more) rc = zmq_msg_recv(&message, fZMQeventQueue, ZMQ_DONTWAIT);\n\n  \/\/decode the message into an AliESDEvent,\n  \/\/for HLT messages AliHLTMessage needs to be used\n  if( topicSize > 0 \/*&& errnoTopic != EAGAIN*\/ && zmq_msg_size(&message) > 0 )\n  {\n    if (Topicncmp(topic, \"ALIESDV0HLT\", topicSize, 11))\n    {\n      printf(\"trying to decode %s with AliHLTMessage\\n\", topic);\n      AliHLTMessage msg(zmq_msg_data(&message), zmq_msg_size(&message));\n      TClass* objclass = msg.GetClass();\n      esdObject = static_cast<AliESDEvent*>(msg.ReadObject(AliESDEvent::Class()));\n    }\n    else if (Topicncmp(topic, \"ALIESDV0POR\", topicSize, 11))\n    {\n      printf(\"trying to decode %s with TBufferFile\\n\", topic);\n      TBufferFile *mess = new TBufferFile(TBuffer::kRead,\n          zmq_msg_size(&message)+sizeof(UInt_t),\n          zmq_msg_data(&message));\n      mess->InitMap();\n      mess->ReadClass();\/\/ get first the class stored in message\n      mess->SetBufferOffset(sizeof(UInt_t) + sizeof(kMESS_OBJECT));\n      mess->ResetMap();\n      esdObject = (AliESDEvent*)(mess->ReadObjectAny(AliESDEvent::Class()));\n    } \n    else\n    {\n      printf(\"Don't know what to do with %s\\n\",topic);\n    }\n  }\n  if (esdObject) \n  {\n    printf(\"setting new event\\n\");\n    esdObject->GetStdContent();\n    DestroyElements();\n    int runNumber = esdObject->GetRunNumber();\n    InitOCDB(runNumber);\n\n    \/\/replace the ESD\n    delete fESD;\n    fESD = esdObject;\n    fHasEvent=kTRUE;\n    \n    AfterNewEventLoaded();\n  }\n  else\n  {\n    cout<<\"No new event is avaliable.\"<<endl;\n    fHasEvent=kFALSE;\n    NoEventLoaded();\n  }\n  zmq_msg_close(&message);\n#endif\n  gSystem->ProcessEvents();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* RoboticsLab, Copyright 2008-2010 SimLab Co., Ltd. All rights reserved.\r\n*\r\n* This library is commercial and cannot be redistributed, and\/or modified\r\n* WITHOUT ANY ALLOWANCE OR PERMISSION OF SimLab Co., LTD.\r\n*\/\r\n#include \"hybrid_automaton\/include\/hybrid_automaton_manager\/AbstractHybridAutomatonManager.h\"\r\n#include \"hybrid_automaton\/include\/hybrid_automaton_manager\/AbstractHybridAutomatonManagerCmd.h\"\r\n\r\n#include \"ros_bridge\\include\\msgs\\String.h\"\r\n#include \"ros_bridge\\include\\msgs\\Transform.h\"\r\n\r\n#include <process.h>\r\n\r\nunsigned __stdcall deserializeHybridAutomaton(void *udata)\r\n{\r\n\tDeserializingThreadArguments* thread_args = static_cast<DeserializingThreadArguments*>(udata);\r\n\tHybridAutomaton* ha = NULL;\r\n\ttry {\r\n\t\tha = XMLDeserializer::createHybridAutomaton(thread_args->_string, thread_args->_sys, thread_args->_dT);\r\n\t\t\/\/std::cout << \"--------------- recieving hybrid automaton ------------------\" << std::endl;\r\n\t\t\/\/std::cout << ha->toStringXML() << std::endl;\r\n\t}\r\n\tcatch(std::string e)\r\n\t{\r\n\t\tstd::cerr << \"[deserializeHybridAutomaton] ERROR while deserializing hybrid automaton!\" << std::endl;\r\n\t\tstd::cerr << e << std::endl;\r\n\r\n\t\tdelete ha;\r\n\t\tdelete thread_args;\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tWaitForSingleObject(*(thread_args->_deserialize_mutex), INFINITE);\r\n\tif(thread_args->_noQueue)\r\n\t{\r\n\t\tfor(size_t i=0;i<thread_args->_deserialized_hybrid_automatons->size();i++)\r\n\t\t{\r\n\t\t\tdelete thread_args->_deserialized_hybrid_automatons->at(i);\r\n\t\t}\r\n\t\tthread_args->_deserialized_hybrid_automatons->clear();\t\r\n\t}\r\n\r\n\tthread_args->_deserialized_hybrid_automatons->push_back(ha);\r\n\tReleaseMutex(*(thread_args->_deserialize_mutex));\r\n\t\r\n\tdelete thread_args;\r\n\r\n\treturn 0;\r\n}\r\n\r\nAbstractHybridAutomatonManager::AbstractHybridAutomatonManager(rDC rdc) \r\n:rControlAlgorithm(rdc)\r\n, _sys(NULL)\r\n, _blackboard(NULL)\r\n, _activeMotionBehaviour(NULL)\r\n, _dof(0)\r\n, _servo_on(false)\r\n, _hybrid_automaton(NULL)\r\n, _qdot_filter(NULL)\r\n, _noQueue(false)\r\n{\r\n\t_deserialize_mutex = CreateMutex(0, FALSE, 0);\r\n\tif( !_deserialize_mutex ) {\r\n\t\tthrow(std::string(\"[AbstractHybridAutomatonManager::HybridAutomatonManager] ERROR: Mutex was not created (_deserialize_mutex)!\"));\r\n\t}\r\n}\r\n\r\nAbstractHybridAutomatonManager::~AbstractHybridAutomatonManager()\r\n{\r\n\tif(_activeMotionBehaviour)\r\n\t\tdelete _activeMotionBehaviour;\r\n\r\n\tif(_blackboard)\r\n\t{\r\n\t\tdelete _blackboard;\r\n\t\t_blackboard = NULL;\r\n\t}\r\n\r\n\tif(_qdot_filter)\r\n\t{\r\n\t\tdelete _qdot_filter;\r\n\t}\t\r\n\r\n\tFREE_SYSTEMS();\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::init(int mode)\r\n{\r\n\t_sys = LOAD_SYSTEM(_path, _aml, _T0, _q0);\r\n\tassert(_sys);\r\n\r\n\t\/\/Find the robot device. This device is used to read position and write torques\r\n\t\/\/to the robot\r\n\t_robot = findDevice(_T(\"ROBOT\"));\r\n\tRASSERT(_robot != INVALID_RHANDLE);\r\n\r\n\trxDevice* ft_sensor = (rxDevice*)findDevice(_T(\"FT_SENSOR\"));\r\n\tif (ft_sensor)\r\n\t\t_sys->addDevice(ft_sensor);\r\n\r\n\t_dof = _sys->jointDOF() + _sys->earthDOF() + _sys->constraintDOF();\r\n\r\n\t\/\/Initialize variables\r\n\t_q.resize(_dof);\r\n\t_qOld.resize(_dof);\r\n\t_qdot.resize(_dof);\r\n\t_torque.resize(_dof);\r\n\r\n\t_q.zero();\r\n\t_qOld.zero();\r\n\t_torque.zero();\r\n\t_qdot.zero();\r\n\r\n\t_qdot_filter = new rxFilteredDerivative(this->_dT, 10.0*this->_dT, this->_sys->jdof());\r\n\r\n\t_activeMotionBehaviour = new MotionBehaviour(new Milestone(), new Milestone(), _sys);\r\n\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::activateBlackboard(std::string &rlab_host, int rlab_port, std::string &ros_host, int ros_port)\r\n{\r\n\t_blackboard = RTBlackBoard::getInstance(rlab_host, rlab_port, ros_host, ros_port);\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::setHybridAutomaton(const std::string& _new_hybrid_automaton_str)\r\n{\r\n\tDeserializingThreadArguments* thread_args = new DeserializingThreadArguments();\r\n\tthread_args->_sys = this->_sys;\r\n\tthread_args->_string = _new_hybrid_automaton_str;\r\n\tthread_args->_dT = this->_dT;\r\n\tthread_args->_noQueue = this->_noQueue;\r\n\tthread_args->_deserialize_mutex = &(this->_deserialize_mutex);\r\n\tthread_args->_deserialized_hybrid_automatons = &(this->_deserialized_hybrid_automatons);\r\n\r\n\tif (_beginthreadex(NULL, 0, deserializeHybridAutomaton, (void*)thread_args, 0, NULL) == 0)\r\n\t{\r\n\t\tstd::cerr << \"[AbstractHybridAutomatonManager::updateHybridAutomaton] Error creating thread to deserialize xml string!\" << std::endl;\r\n\t}\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::setHybridAutomaton(HybridAutomaton* _new_hybrid_automaton)\r\n{\r\n\tWaitForSingleObject(_deserialize_mutex, INFINITE);\r\n\tthis->_deserialized_hybrid_automatons.push_back(_new_hybrid_automaton);\r\n\tReleaseMutex(_deserialize_mutex);\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::update(const rTime& t)\r\n{\r\n\tthis->updateHybridAutomaton();\r\n\r\n\tthis->updateMotionBehaviour(t);\r\n\r\n\tif (_activeMotionBehaviour)\r\n\t{\r\n\t\tMilestone* currentMilestone = (Milestone*)(_activeMotionBehaviour->getChild());\r\n\t\tcurrentMilestone->update(t);\r\n\t}\r\n\r\n\trControlAlgorithm::update(t);\r\n\r\n\tthis->updateBlackboard();\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::updateHybridAutomaton()\r\n{\r\n\tif (_blackboard && _blackboard->isUpdated(\"update_hybrid_automaton\"))\r\n\t{\r\n\t\trlab::String* ha_xml = dynamic_cast<rlab::String*>(_blackboard->getData(\"update_hybrid_automaton\"));\r\n\t\ttry\r\n\t\t{\r\n\t\t\tDeserializingThreadArguments* thread_args = new DeserializingThreadArguments();\r\n\t\t\tthread_args->_sys = this->_sys;\r\n\t\t\tthread_args->_string = ha_xml->get();\r\n\t\t\tthread_args->_dT = this->_dT;\r\n\t\t\tthread_args->_noQueue= this->_noQueue;\r\n\t\t\tthread_args->_deserialize_mutex = &(this->_deserialize_mutex);\r\n\t\t\tthread_args->_deserialized_hybrid_automatons = &(this->_deserialized_hybrid_automatons);\r\n\r\n\t\t\tif (_beginthreadex(NULL, 0, deserializeHybridAutomaton, (void*)thread_args, 0, NULL) == 0)\r\n\t\t\t{\r\n\t\t\t\tstd::cerr << \"[AbstractHybridAutomatonManager::updateHybridAutomaton] Error creating thread to deserialize xml string!\" << std::endl;\r\n\t\t\t}\r\n\t\t}\r\n\t\tcatch(::std::string e)\r\n\t\t{\r\n\t\t\tstd::cout << \"[AbstractHybridAutomatonManager::updateHybridAutomaton] Error caught: \" << std::endl;\r\n\t\t\t::std::cout << e << ::std::endl;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::updateBlackboard()\r\n{\r\n\tif(!_blackboard)\r\n\t\treturn;\r\n\r\n\t_blackboard->setJointState(\"\/joint_states\", _sys->q(), _sys->qdot(), _torque);\r\n\r\n\tHTransform relative_transform;\r\n\trxBody* end_effector = _sys->getUCSBody(_T(\"EE\"), relative_transform);\r\n\tHTransform absolute_transform = end_effector->T() * relative_transform;\r\n\t_blackboard->setTransform(\"ee\", absolute_transform, \"base_link\");\r\n\t\r\n\t_blackboard->step();\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::setNominalSystem(const TCHAR* path, const TCHAR* aml, const HTransform& T0, const dVector& q0)\r\n{\r\n\tthis->_path = path;\r\n\tthis->_aml = aml;\r\n\tthis->_T0 = T0;\r\n\tthis->_q0 = q0;\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::setPeriod(const rTime& dT)\r\n{\r\n\tthis->_dT = dT;\r\n}\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::_readDevices()\r\n{\t\r\n\t_qOld = _q;\r\n\r\n\tint r = readDeviceValue(_robot, &_q[0], sizeof(double) * _q.size(), 0);\r\n\tassert (r == sizeof(double) * _q.size());\r\n\r\n}\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::_writeDevices()\r\n{\r\n\tint w = writeDeviceValue(_robot, &_torque[0], sizeof(double) * _torque.size());\r\n\tassert(w == sizeof(double)*_torque.size());\r\n}\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::_reflect()\r\n{\r\n\t_sys->q(_q);\r\n\t_sys->qdot(_qdot);\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::_compute(const double& t)\r\n{\r\n\tif (_servo_on)\r\n\t{\r\n\t\t_torque = _activeMotionBehaviour->update(t);\r\n\t}\r\n\telse \r\n\t{\r\n\t\t_torque.zero();\r\n\t}\r\n\r\n\tsetTorque(_torque);\r\n}\r\n\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::_estimate()\r\n{\r\n\tthis->_qdot_filter->compute(this->_q, this->_qdot);\r\n}\r\n\r\nint AbstractHybridAutomatonManager::command(const short& cmd, const int& arg)\r\n{\r\n\tswitch (cmd)\r\n\t{\r\n\tcase SERVO_ON:\r\n\t\t{\r\n\t\t\t_servo_on = !_servo_on;\r\n\r\n\t\t\tif(_servo_on)\r\n\t\t\t\tthis->_qdot_filter->initialize(this->_q);\r\n\r\n\t\t\tstd::cout << \"[AbstractHybridAutomatonManager::command] Servo ON: \" << _servo_on << std::endl;\r\n\t\t}\r\n\t\tbreak;\r\n\t\t\r\n\tcase BLACKBOARD_ON:\r\n\t\t{\r\n\t\t\tstd::map<int, std::string> domain_names;\r\n\t\t\tdomain_names[URI_LOCAL] = \"\";\r\n\t\t\tdomain_names[URI_BOTTOM_1]\t= \"130.149.238.178\";\r\n\t\t\tdomain_names[URI_BOTTOM_2]\t= \"130.149.238.179\";\r\n\t\t\tdomain_names[URI_BOTTOM_3]\t= \"130.149.238.180\";\r\n\t\t\tdomain_names[URI_LOHENGRIN] = \"130.149.238.186\";\r\n\t\t\tdomain_names[URI_HASMA]\t\t= \"130.149.238.184\";\r\n\t\t\tdomain_names[URI_LEIBNIZ]\t= \"130.149.238.185\";\r\n            domain_names[URI_POSEIDON]\t= \"130.149.238.193\";\r\n\t\t\tdomain_names[URI_FIRSTMM]\t= \"130.149.238.220\";\r\n\t\t\tdomain_names[URI_SHOEFER]\t= \"130.149.238.182\";\r\n\t\t\tdomain_names[URI_TOP_1A]\t= \"130.149.238.188\";\r\n\t\t\tdomain_names[URI_TOP_1B]\t= \"130.149.238.189\";\r\n\t\t\tdomain_names[URI_ARIS]\t\t= \"130.149.238.194\";\r\n\t\t\tdomain_names[URI_ANGEL]\t\t= \"130.149.238.149\";\r\n\t\t\tint bit_code = arg;\r\n\t\t\t\r\n\t\t\tint port = bit_code >> 16;\r\n\t\t\tbit_code &= ~(port << 16);\r\n\t\t\t\r\n\t\t\tint local_host = bit_code >> 8;\r\n\t\t\tbit_code &= ~(local_host << 8);\r\n\r\n\t\t\tint remote_host = bit_code;\r\n\t\t\t\r\n\t\t\tstd::cout << \"Enabled BlackBoard. Establishing connection between \" << domain_names[local_host] << \":\" << port << \" and \" << domain_names[remote_host] << \":\" << port << \".\" << std::endl;\t\r\n\t\t\t\r\n\t\t\tif (local_host != URI_LOCAL && domain_names[local_host].empty() ||\r\n\t\t\t\tremote_host != URI_LOCAL && domain_names[remote_host].empty())\r\n\t\t\t{\r\n\t\t\t\tstd::cout << \"WARNING! Unknown host: \" << local_host << \" or \" << remote_host << \"! (Will only establish unconnected BlackBoard)\" << std::endl;\r\n\t\t\t}\r\n\r\n\t\t\tactivateBlackboard(domain_names[local_host], port, domain_names[remote_host], port);\r\n\t\t}\r\n\t\tbreak;\r\n\r\n\tdefault:\r\n\t\tbreak;\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::datanames(vector<string_type>& names, int channel)\r\n{\r\n\tswitch (channel) {\r\n\t\tcase PLOT_TORQUE: names.push_back(_T(\"Torque\"));\r\n\t\tcase PLOT_Q: names.push_back(_T(\"Q\"));\r\n\t\tcase PLOT_VELOCITY: names.push_back(_T(\"Velocity\"));\r\n\t\tcase PLOT_EEFRAME: names.push_back(_T(\"EEPosition\"));\r\n\t}\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::collect(vector<double>& data, int channel)\r\n{\r\n\tif (channel == PLOT_TORQUE)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_torque[i]);\r\n\t}\r\n\telse if (channel == PLOT_Q)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_sys->q()[i]);\r\n\t}\r\n\telse if (channel == PLOT_VELOCITY)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_sys->qdot()[i]);\r\n\t}\t\r\n\telse if (channel == PLOT_EEFRAME)\r\n\t{\r\n\t\tHTransform relative_transform;\r\n\t\trxBody* end_effector = _sys->getUCSBody(_T(\"EE\"), relative_transform);\r\n\t\tHTransform absolute_transform = end_effector->T() * relative_transform;\r\n\t\tfor(int i = 0; i < 3; ++i)\r\n\t\t\tdata.push_back(absolute_transform.r(i));\r\n\t}\t\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::onSetInterestFrame(const TCHAR* name, const HTransform& T)\r\n{\r\n}\r\n\r\n\/*\r\nrControlAlgorithm* CreateControlAlgorithm(rDC& rdc)\r\n{\r\n\treturn new AbstractHybridAutomatonManager(rdc);\r\n}\r\n*\/<commit_msg>Commented FREE_SYSTEMS out. Gave always a run-time exception.<commit_after>\/* RoboticsLab, Copyright 2008-2010 SimLab Co., Ltd. All rights reserved.\r\n*\r\n* This library is commercial and cannot be redistributed, and\/or modified\r\n* WITHOUT ANY ALLOWANCE OR PERMISSION OF SimLab Co., LTD.\r\n*\/\r\n#include \"hybrid_automaton\/include\/hybrid_automaton_manager\/AbstractHybridAutomatonManager.h\"\r\n#include \"hybrid_automaton\/include\/hybrid_automaton_manager\/AbstractHybridAutomatonManagerCmd.h\"\r\n\r\n#include \"ros_bridge\\include\\msgs\\String.h\"\r\n#include \"ros_bridge\\include\\msgs\\Transform.h\"\r\n\r\n#include <process.h>\r\n\r\nunsigned __stdcall deserializeHybridAutomaton(void *udata)\r\n{\r\n\tDeserializingThreadArguments* thread_args = static_cast<DeserializingThreadArguments*>(udata);\r\n\tHybridAutomaton* ha = NULL;\r\n\ttry {\r\n\t\tha = XMLDeserializer::createHybridAutomaton(thread_args->_string, thread_args->_sys, thread_args->_dT);\r\n\t\t\/\/std::cout << \"--------------- recieving hybrid automaton ------------------\" << std::endl;\r\n\t\t\/\/std::cout << ha->toStringXML() << std::endl;\r\n\t}\r\n\tcatch(std::string e)\r\n\t{\r\n\t\tstd::cerr << \"[deserializeHybridAutomaton] ERROR while deserializing hybrid automaton!\" << std::endl;\r\n\t\tstd::cerr << e << std::endl;\r\n\r\n\t\tdelete ha;\r\n\t\tdelete thread_args;\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tWaitForSingleObject(*(thread_args->_deserialize_mutex), INFINITE);\r\n\tif(thread_args->_noQueue)\r\n\t{\r\n\t\tfor(size_t i=0;i<thread_args->_deserialized_hybrid_automatons->size();i++)\r\n\t\t{\r\n\t\t\tdelete thread_args->_deserialized_hybrid_automatons->at(i);\r\n\t\t}\r\n\t\tthread_args->_deserialized_hybrid_automatons->clear();\t\r\n\t}\r\n\r\n\tthread_args->_deserialized_hybrid_automatons->push_back(ha);\r\n\tReleaseMutex(*(thread_args->_deserialize_mutex));\r\n\t\r\n\tdelete thread_args;\r\n\r\n\treturn 0;\r\n}\r\n\r\nAbstractHybridAutomatonManager::AbstractHybridAutomatonManager(rDC rdc) \r\n:rControlAlgorithm(rdc)\r\n, _sys(NULL)\r\n, _blackboard(NULL)\r\n, _activeMotionBehaviour(NULL)\r\n, _dof(0)\r\n, _servo_on(false)\r\n, _hybrid_automaton(NULL)\r\n, _qdot_filter(NULL)\r\n, _noQueue(false)\r\n{\r\n\t_deserialize_mutex = CreateMutex(0, FALSE, 0);\r\n\tif( !_deserialize_mutex ) {\r\n\t\tthrow(std::string(\"[AbstractHybridAutomatonManager::HybridAutomatonManager] ERROR: Mutex was not created (_deserialize_mutex)!\"));\r\n\t}\r\n}\r\n\r\nAbstractHybridAutomatonManager::~AbstractHybridAutomatonManager()\r\n{\r\n\tif(_activeMotionBehaviour)\r\n\t\tdelete _activeMotionBehaviour;\r\n\r\n\tif(_blackboard)\r\n\t{\r\n\t\tdelete _blackboard;\r\n\t\t_blackboard = NULL;\r\n\t}\r\n\r\n\tif(_qdot_filter)\r\n\t{\r\n\t\tdelete _qdot_filter;\r\n\t}\t\r\n\r\n\t\/*\r\n\tFREE_SYSTEMS();\r\n\t*\/\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::init(int mode)\r\n{\r\n\t_sys = LOAD_SYSTEM(_path, _aml, _T0, _q0);\r\n\tassert(_sys);\r\n\r\n\t\/\/Find the robot device. This device is used to read position and write torques\r\n\t\/\/to the robot\r\n\t_robot = findDevice(_T(\"ROBOT\"));\r\n\tRASSERT(_robot != INVALID_RHANDLE);\r\n\r\n\trxDevice* ft_sensor = (rxDevice*)findDevice(_T(\"FT_SENSOR\"));\r\n\tif (ft_sensor)\r\n\t\t_sys->addDevice(ft_sensor);\r\n\r\n\t_dof = _sys->jointDOF() + _sys->earthDOF() + _sys->constraintDOF();\r\n\r\n\t\/\/Initialize variables\r\n\t_q.resize(_dof);\r\n\t_qOld.resize(_dof);\r\n\t_qdot.resize(_dof);\r\n\t_torque.resize(_dof);\r\n\r\n\t_q.zero();\r\n\t_qOld.zero();\r\n\t_torque.zero();\r\n\t_qdot.zero();\r\n\r\n\t_qdot_filter = new rxFilteredDerivative(this->_dT, 10.0*this->_dT, this->_sys->jdof());\r\n\r\n\t_activeMotionBehaviour = new MotionBehaviour(new Milestone(), new Milestone(), _sys);\r\n\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::activateBlackboard(std::string &rlab_host, int rlab_port, std::string &ros_host, int ros_port)\r\n{\r\n\t_blackboard = RTBlackBoard::getInstance(rlab_host, rlab_port, ros_host, ros_port);\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::setHybridAutomaton(const std::string& _new_hybrid_automaton_str)\r\n{\r\n\tDeserializingThreadArguments* thread_args = new DeserializingThreadArguments();\r\n\tthread_args->_sys = this->_sys;\r\n\tthread_args->_string = _new_hybrid_automaton_str;\r\n\tthread_args->_dT = this->_dT;\r\n\tthread_args->_noQueue = this->_noQueue;\r\n\tthread_args->_deserialize_mutex = &(this->_deserialize_mutex);\r\n\tthread_args->_deserialized_hybrid_automatons = &(this->_deserialized_hybrid_automatons);\r\n\r\n\tif (_beginthreadex(NULL, 0, deserializeHybridAutomaton, (void*)thread_args, 0, NULL) == 0)\r\n\t{\r\n\t\tstd::cerr << \"[AbstractHybridAutomatonManager::updateHybridAutomaton] Error creating thread to deserialize xml string!\" << std::endl;\r\n\t}\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::setHybridAutomaton(HybridAutomaton* _new_hybrid_automaton)\r\n{\r\n\tWaitForSingleObject(_deserialize_mutex, INFINITE);\r\n\tthis->_deserialized_hybrid_automatons.push_back(_new_hybrid_automaton);\r\n\tReleaseMutex(_deserialize_mutex);\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::update(const rTime& t)\r\n{\r\n\tthis->updateHybridAutomaton();\r\n\r\n\tthis->updateMotionBehaviour(t);\r\n\r\n\tif (_activeMotionBehaviour)\r\n\t{\r\n\t\tMilestone* currentMilestone = (Milestone*)(_activeMotionBehaviour->getChild());\r\n\t\tcurrentMilestone->update(t);\r\n\t}\r\n\r\n\trControlAlgorithm::update(t);\r\n\r\n\tthis->updateBlackboard();\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::updateHybridAutomaton()\r\n{\r\n\tif (_blackboard && _blackboard->isUpdated(\"update_hybrid_automaton\"))\r\n\t{\r\n\t\trlab::String* ha_xml = dynamic_cast<rlab::String*>(_blackboard->getData(\"update_hybrid_automaton\"));\r\n\t\ttry\r\n\t\t{\r\n\t\t\tDeserializingThreadArguments* thread_args = new DeserializingThreadArguments();\r\n\t\t\tthread_args->_sys = this->_sys;\r\n\t\t\tthread_args->_string = ha_xml->get();\r\n\t\t\tthread_args->_dT = this->_dT;\r\n\t\t\tthread_args->_noQueue= this->_noQueue;\r\n\t\t\tthread_args->_deserialize_mutex = &(this->_deserialize_mutex);\r\n\t\t\tthread_args->_deserialized_hybrid_automatons = &(this->_deserialized_hybrid_automatons);\r\n\r\n\t\t\tif (_beginthreadex(NULL, 0, deserializeHybridAutomaton, (void*)thread_args, 0, NULL) == 0)\r\n\t\t\t{\r\n\t\t\t\tstd::cerr << \"[AbstractHybridAutomatonManager::updateHybridAutomaton] Error creating thread to deserialize xml string!\" << std::endl;\r\n\t\t\t}\r\n\t\t}\r\n\t\tcatch(::std::string e)\r\n\t\t{\r\n\t\t\tstd::cout << \"[AbstractHybridAutomatonManager::updateHybridAutomaton] Error caught: \" << std::endl;\r\n\t\t\t::std::cout << e << ::std::endl;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::updateBlackboard()\r\n{\r\n\tif(!_blackboard)\r\n\t\treturn;\r\n\r\n\t_blackboard->setJointState(\"\/joint_states\", _sys->q(), _sys->qdot(), _torque);\r\n\r\n\tHTransform relative_transform;\r\n\trxBody* end_effector = _sys->getUCSBody(_T(\"EE\"), relative_transform);\r\n\tHTransform absolute_transform = end_effector->T() * relative_transform;\r\n\t_blackboard->setTransform(\"ee\", absolute_transform, \"base_link\");\r\n\t\r\n\t_blackboard->step();\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::setNominalSystem(const TCHAR* path, const TCHAR* aml, const HTransform& T0, const dVector& q0)\r\n{\r\n\tthis->_path = path;\r\n\tthis->_aml = aml;\r\n\tthis->_T0 = T0;\r\n\tthis->_q0 = q0;\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::setPeriod(const rTime& dT)\r\n{\r\n\tthis->_dT = dT;\r\n}\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::_readDevices()\r\n{\t\r\n\t_qOld = _q;\r\n\r\n\tint r = readDeviceValue(_robot, &_q[0], sizeof(double) * _q.size(), 0);\r\n\tassert (r == sizeof(double) * _q.size());\r\n\r\n}\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::_writeDevices()\r\n{\r\n\tint w = writeDeviceValue(_robot, &_torque[0], sizeof(double) * _torque.size());\r\n\tassert(w == sizeof(double)*_torque.size());\r\n}\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::_reflect()\r\n{\r\n\t_sys->q(_q);\r\n\t_sys->qdot(_qdot);\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::_compute(const double& t)\r\n{\r\n\tif (_servo_on)\r\n\t{\r\n\t\t_torque = _activeMotionBehaviour->update(t);\r\n\t}\r\n\telse \r\n\t{\r\n\t\t_torque.zero();\r\n\t}\r\n\r\n\tsetTorque(_torque);\r\n}\r\n\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::_estimate()\r\n{\r\n\tthis->_qdot_filter->compute(this->_q, this->_qdot);\r\n}\r\n\r\nint AbstractHybridAutomatonManager::command(const short& cmd, const int& arg)\r\n{\r\n\tswitch (cmd)\r\n\t{\r\n\tcase SERVO_ON:\r\n\t\t{\r\n\t\t\t_servo_on = !_servo_on;\r\n\r\n\t\t\tif(_servo_on)\r\n\t\t\t\tthis->_qdot_filter->initialize(this->_q);\r\n\r\n\t\t\tstd::cout << \"[AbstractHybridAutomatonManager::command] Servo ON: \" << _servo_on << std::endl;\r\n\t\t}\r\n\t\tbreak;\r\n\t\t\r\n\tcase BLACKBOARD_ON:\r\n\t\t{\r\n\t\t\tstd::map<int, std::string> domain_names;\r\n\t\t\tdomain_names[URI_LOCAL] = \"\";\r\n\t\t\tdomain_names[URI_BOTTOM_1]\t= \"130.149.238.178\";\r\n\t\t\tdomain_names[URI_BOTTOM_2]\t= \"130.149.238.179\";\r\n\t\t\tdomain_names[URI_BOTTOM_3]\t= \"130.149.238.180\";\r\n\t\t\tdomain_names[URI_LOHENGRIN] = \"130.149.238.186\";\r\n\t\t\tdomain_names[URI_HASMA]\t\t= \"130.149.238.184\";\r\n\t\t\tdomain_names[URI_LEIBNIZ]\t= \"130.149.238.185\";\r\n            domain_names[URI_POSEIDON]\t= \"130.149.238.193\";\r\n\t\t\tdomain_names[URI_FIRSTMM]\t= \"130.149.238.220\";\r\n\t\t\tdomain_names[URI_SHOEFER]\t= \"130.149.238.182\";\r\n\t\t\tdomain_names[URI_TOP_1A]\t= \"130.149.238.188\";\r\n\t\t\tdomain_names[URI_TOP_1B]\t= \"130.149.238.189\";\r\n\t\t\tdomain_names[URI_ARIS]\t\t= \"130.149.238.194\";\r\n\t\t\tdomain_names[URI_ANGEL]\t\t= \"130.149.238.149\";\r\n\t\t\tint bit_code = arg;\r\n\t\t\t\r\n\t\t\tint port = bit_code >> 16;\r\n\t\t\tbit_code &= ~(port << 16);\r\n\t\t\t\r\n\t\t\tint local_host = bit_code >> 8;\r\n\t\t\tbit_code &= ~(local_host << 8);\r\n\r\n\t\t\tint remote_host = bit_code;\r\n\t\t\t\r\n\t\t\tstd::cout << \"Enabled BlackBoard. Establishing connection between \" << domain_names[local_host] << \":\" << port << \" and \" << domain_names[remote_host] << \":\" << port << \".\" << std::endl;\t\r\n\t\t\t\r\n\t\t\tif (local_host != URI_LOCAL && domain_names[local_host].empty() ||\r\n\t\t\t\tremote_host != URI_LOCAL && domain_names[remote_host].empty())\r\n\t\t\t{\r\n\t\t\t\tstd::cout << \"WARNING! Unknown host: \" << local_host << \" or \" << remote_host << \"! (Will only establish unconnected BlackBoard)\" << std::endl;\r\n\t\t\t}\r\n\r\n\t\t\tactivateBlackboard(domain_names[local_host], port, domain_names[remote_host], port);\r\n\t\t}\r\n\t\tbreak;\r\n\r\n\tdefault:\r\n\t\tbreak;\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n\r\n\r\nvoid AbstractHybridAutomatonManager::datanames(vector<string_type>& names, int channel)\r\n{\r\n\tswitch (channel) {\r\n\t\tcase PLOT_TORQUE: names.push_back(_T(\"Torque\"));\r\n\t\tcase PLOT_Q: names.push_back(_T(\"Q\"));\r\n\t\tcase PLOT_VELOCITY: names.push_back(_T(\"Velocity\"));\r\n\t\tcase PLOT_EEFRAME: names.push_back(_T(\"EEPosition\"));\r\n\t}\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::collect(vector<double>& data, int channel)\r\n{\r\n\tif (channel == PLOT_TORQUE)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_torque[i]);\r\n\t}\r\n\telse if (channel == PLOT_Q)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_sys->q()[i]);\r\n\t}\r\n\telse if (channel == PLOT_VELOCITY)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_sys->qdot()[i]);\r\n\t}\t\r\n\telse if (channel == PLOT_EEFRAME)\r\n\t{\r\n\t\tHTransform relative_transform;\r\n\t\trxBody* end_effector = _sys->getUCSBody(_T(\"EE\"), relative_transform);\r\n\t\tHTransform absolute_transform = end_effector->T() * relative_transform;\r\n\t\tfor(int i = 0; i < 3; ++i)\r\n\t\t\tdata.push_back(absolute_transform.r(i));\r\n\t}\t\r\n}\r\n\r\nvoid AbstractHybridAutomatonManager::onSetInterestFrame(const TCHAR* name, const HTransform& T)\r\n{\r\n}\r\n\r\n\/*\r\nrControlAlgorithm* CreateControlAlgorithm(rDC& rdc)\r\n{\r\n\treturn new AbstractHybridAutomatonManager(rdc);\r\n}\r\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\/customize\/p9_xip_customize.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_XIP_CUSTOMIZE_\n#define _P9_XIP_CUSTOMIZE_\n\n#include <fapi2.H>\n\ntypedef fapi2::ReturnCode (*p9_xip_customize_FP_t) (\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_proc_target,\n    void*     io_image,\n    uint32_t& io_imageSize,\n    void*     io_ringSectionBuf,\n    uint32_t& io_ringSectionBufSize,\n    uint8_t   i_sysPhase,\n    uint8_t   i_modeBuild,\n    void*     io_ringBuf1,\n    uint32_t  i_ringBufSize1,\n    void*     io_ringBuf2,\n    uint32_t  i_ringBufSize2,\n    uint32_t& io_bootCoreMask);\n\nextern \"C\"\n{\n\/\/\/ @brief p9_xip_customize used to customize the SBE\/CME\/SGPE images with\n\/\/\/        mailbox attributes, VPD rings and other stuff.\n\/\/\/\n\/\/\/ @param[in] i_proc_target             => P9 proc chip target\n\/\/\/ @param[in\/out] io_image              => Pointer to an in-memory image\n\/\/\/                                         HB_SBE:\n\/\/\/                                             In:  SBE image\n\/\/\/                                             Out: Seeprom image\n\/\/\/                                         RT_{CME,SGPE}:\n\/\/\/                                             In:  HW image\n\/\/\/                                             Out: HW image\n\/\/\/ @param[in\/out] io_imageSize          => Size of image\n\/\/\/                                         HB_SBE:\n\/\/\/                                             In:  MAX_SEEPROM_IMAGE_SIZE\n\/\/\/                                             Out: Final size\n\/\/\/                                         RT_{CME,SGPE}:\n\/\/\/                                             In:  Size of HW image\n\/\/\/                                             Out: Unchanged\n\/\/\/ @param[in\/out] io_ringSectionBuf     => Pointer to an in-memory ring section\n\/\/\/                                         buffer\n\/\/\/                                         HB_SBE:\n\/\/\/                                             Used as temporary image work buffer\n\/\/\/                                             In:  Undefined\n\/\/\/                                             Out: Undefined\n\/\/\/                                         RT_{CME,SGPE}:\n\/\/\/                                             In:  Undefined\n\/\/\/                                             Out: Updated .rings section\n\/\/\/ @param[in\/out] io_ringSectionBufSize => In: Size of ring section buffer\n\/\/\/                                         HB_SBE:\n\/\/\/                                             In:  MAX_SEEPROM_IMAGE_SIZE\n\/\/\/                                             Out: Unchanged\n\/\/\/                                         RT_{CME,SGPE}:\n\/\/\/                                             In:  MAX_SEEPROM_IMAGE_SIZE\n\/\/\/                                             Out: Final size\n\/\/\/ @param[in] i_sysPhase                => ={HB_SBE, RT_CME, RT_SGPE}\n\/\/\/ @param[in] i_modeBuild               => ={IPL, REBUILD}\n\/\/\/ @param[in\/out] io_ringBuf1           => Caller supplied in-memory buffer\n\/\/\/                                         for uncompressed VPD rings in\n\/\/\/ @param[in] i_ringBufSize1            => Max size of VPD ring buffer\n\/\/\/                                         (Should equal MAX_RING_BUF_SIZE)\n\/\/\/ @param[in\/out] io_ringBuf2           => Caller supplied in-memory buffer\n\/\/\/                                         for uncompressed overlay rings\n\/\/\/ @param[in] i_ringBufSize2            => Max size of overlay ring buffer\n\/\/\/                                         (Should equal MAX_RING_BUF_SIZE)\n\/\/\/ @param[in\/out] io_bootCoreMask       => In: Mask of the desired boot cores\n\/\/\/                                         Out: Actual boot cores\n\/\/\/                                         (Only used in HB_SBE sysPhase)\n\/\/\/                                         (Bits(8:31) = EC00:EC23)\n\/\/\/\n\/\/\/ @return FAPI_RC_SUCCESS if the customization was successful\n\/\/\/\n    fapi2::ReturnCode p9_xip_customize (\n        const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_proc_target,\n        void*     io_image,\n        uint32_t& io_imageSize,\n        void*     io_ringSectionBuf,\n        uint32_t& io_ringSectionBufSize,\n        uint8_t   i_sysPhase,\n        uint8_t   i_modeBuild,\n        void*     io_ringBuf1,\n        uint32_t  i_ringBufSize1,\n        void*     io_ringBuf2,\n        uint32_t  i_ringBufSize2,\n        uint32_t& io_bootCoreMask);\n\n}\n#endif\n<commit_msg>xip_customize: Four fixes for relieving Seeprom space constraint.<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/customize\/p9_xip_customize.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_XIP_CUSTOMIZE_\n#define _P9_XIP_CUSTOMIZE_\n\n#include <fapi2.H>\n\ntypedef fapi2::ReturnCode (*p9_xip_customize_FP_t) (\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_proc_target,\n    void*     io_image,\n    uint32_t& io_imageSize,\n    void*     io_ringSectionBuf,\n    uint32_t& io_ringSectionBufSize,\n    uint8_t   i_sysPhase,\n    uint8_t   i_modeBuild,\n    void*     io_ringBuf1,\n    uint32_t  i_ringBufSize1,\n    void*     io_ringBuf2,\n    uint32_t  i_ringBufSize2,\n    uint32_t& io_bootCoreMask);\n\nextern \"C\"\n{\n\/\/\/ @brief p9_xip_customize used to customize the SBE\/CME\/SGPE images with\n\/\/\/        mailbox attributes, VPD rings and other stuff.\n\/\/\/\n\/\/\/ @param[in] i_proc_target             => P9 proc chip target\n\/\/\/ @param[in\/out] io_image              => Pointer to an in-memory image\n\/\/\/                                         HB_SBE:\n\/\/\/                                             In:  SBE image\n\/\/\/                                             Out: Seeprom image\n\/\/\/                                         RT_{CME,SGPE}:\n\/\/\/                                             In:  HW image\n\/\/\/                                             Out: HW image\n\/\/\/ @param[in\/out] io_imageSize          => Size of image\n\/\/\/                                         HB_SBE:\n\/\/\/                                             In:  >=MAX_SBE_SEEPROM_SIZE\n\/\/\/                                             Out: Final size\n\/\/\/                                         RT_{CME,SGPE}:\n\/\/\/                                             In:  Size of HW image\n\/\/\/                                             Out: Unchanged\n\/\/\/ @param[in\/out] io_ringSectionBuf     => Pointer to an in-memory ring section\n\/\/\/                                         buffer\n\/\/\/                                         HB_SBE:\n\/\/\/                                             Used as temporary image work buffer\n\/\/\/                                             In:  Undefined\n\/\/\/                                             Out: Undefined\n\/\/\/                                         RT_{CME,SGPE}:\n\/\/\/                                             In:  Undefined\n\/\/\/                                             Out: Updated .rings section\n\/\/\/ @param[in\/out] io_ringSectionBufSize => In: Size of ring section buffer\n\/\/\/                                         HB_SBE:\n\/\/\/                                             In:  Input value of io_imageSize\n\/\/\/                                             Out: Final size\n\/\/\/                                         RT_{CME,SGPE}:\n\/\/\/                                             In:  >=MAX_SBE_SEEPROM_SIZE\n\/\/\/                                             Out: Final size\n\/\/\/ @param[in] i_sysPhase                => ={HB_SBE, RT_CME, RT_SGPE}\n\/\/\/ @param[in] i_modeBuild               => ={IPL, REBUILD}\n\/\/\/ @param[in\/out] io_ringBuf1           => Caller supplied in-memory buffer\n\/\/\/                                         for uncompressed VPD rings in\n\/\/\/ @param[in] i_ringBufSize1            => Max size of VPD ring buffer\n\/\/\/                                         (Should equal MAX_RING_BUF_SIZE)\n\/\/\/ @param[in\/out] io_ringBuf2           => Caller supplied in-memory buffer\n\/\/\/                                         for uncompressed overlay rings\n\/\/\/ @param[in] i_ringBufSize2            => Max size of overlay ring buffer\n\/\/\/                                         (Should equal MAX_RING_BUF_SIZE)\n\/\/\/ @param[in\/out] io_bootCoreMask       => In: Mask of the desired boot cores\n\/\/\/                                         Out: Actual boot cores\n\/\/\/                                         (Only used in HB_SBE sysPhase)\n\/\/\/                                         (Bits(8:31) = EC00:EC23)\n\/\/\/\n\/\/\/ @return FAPI_RC_SUCCESS if the customization was successful\n\/\/\/\n    fapi2::ReturnCode p9_xip_customize (\n        const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_proc_target,\n        void*     io_image,\n        uint32_t& io_imageSize,\n        void*     io_ringSectionBuf,\n        uint32_t& io_ringSectionBufSize,\n        uint8_t   i_sysPhase,\n        uint8_t   i_modeBuild,\n        void*     io_ringBuf1,\n        uint32_t  i_ringBufSize1,\n        void*     io_ringBuf2,\n        uint32_t  i_ringBufSize2,\n        uint32_t& io_bootCoreMask);\n\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n*\n* Copyright 2013 Telefonica Investigacion y Desarrollo, S.A.U\n*\n* This file is part of Orion Context Broker.\n*\n* Orion Context Broker is free software: you can redistribute it and\/or\n* modify 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* Orion Context 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 Affero\n* General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with Orion Context Broker. If not, see http:\/\/www.gnu.org\/licenses\/.\n*\n* For those usages not covered by this license please contact with\n* fermin at tid dot es\n*\n* Author: Ken Zangelin\n*\/\n#include <string>\n#include <vector>\n\n#include \"logMsg\/logMsg.h\"\n#include \"logMsg\/traceLevels.h\"\n\n#include \"convenience\/UpdateContextElementResponse.h\"\n#include \"convenienceMap\/mapPutIndividualContextEntityAttribute.h\"\n#include \"ngsi\/ParseData.h\"\n#include \"rest\/ConnectionInfo.h\"\n#include \"serviceRoutines\/putIndividualContextEntityAttribute.h\"\n\n\n\n\/* ****************************************************************************\n*\n* putIndividualContextEntityAttribute -\n*\/\nstd::string putIndividualContextEntityAttribute(ConnectionInfo* ciP, int components, std::vector<std::string> compV, ParseData* parseDataP)\n{\n  std::string  answer;\n  std::string  entityId      = compV[2];\n  std::string  attributeName = compV[4];\n  StatusCode   response;\n\n  LM_T(LmtConvenience, (\"CONVENIENCE: got a 'PUT' request for entityId '%s'\", entityId.c_str()));\n  ciP->httpStatusCode = mapPutIndividualContextEntityAttribute(entityId, attributeName, &parseDataP->upcar.res, &response);\n  answer = response.render(ciP->outFormat, \"\");\n  response.release();\n\n  return answer;\n}\n<commit_msg>Change author<commit_after>\/*\n*\n* Copyright 2013 Telefonica Investigacion y Desarrollo, S.A.U\n*\n* This file is part of Orion Context Broker.\n*\n* Orion Context Broker is free software: you can redistribute it and\/or\n* modify 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* Orion Context 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 Affero\n* General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with Orion Context Broker. If not, see http:\/\/www.gnu.org\/licenses\/.\n*\n* For those usages not covered by this license please contact with\n* fermin at tid dot es\n*\n* Author: TID Developer\n*\/\n#include <string>\n#include <vector>\n\n#include \"logMsg\/logMsg.h\"\n#include \"logMsg\/traceLevels.h\"\n\n#include \"convenience\/UpdateContextElementResponse.h\"\n#include \"convenienceMap\/mapPutIndividualContextEntityAttribute.h\"\n#include \"ngsi\/ParseData.h\"\n#include \"rest\/ConnectionInfo.h\"\n#include \"serviceRoutines\/putIndividualContextEntityAttribute.h\"\n\n\n\n\/* ****************************************************************************\n*\n* putIndividualContextEntityAttribute -\n*\/\nstd::string putIndividualContextEntityAttribute(ConnectionInfo* ciP, int components, std::vector<std::string> compV, ParseData* parseDataP)\n{\n  std::string  answer;\n  std::string  entityId      = compV[2];\n  std::string  attributeName = compV[4];\n  StatusCode   response;\n\n  LM_T(LmtConvenience, (\"CONVENIENCE: got a 'PUT' request for entityId '%s'\", entityId.c_str()));\n  ciP->httpStatusCode = mapPutIndividualContextEntityAttribute(entityId, attributeName, &parseDataP->upcar.res, &response);\n  answer = response.render(ciP->outFormat, \"\");\n  response.release();\n\n  return answer;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tThis file is part of cpp-ethereum.\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\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\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 ClientModel.cpp\n * @author Yann yann@ethdev.com\n * @author Arkadiy Paronyan arkadiy@ethdev.com\n * @date 2015\n * Ethereum IDE client.\n *\/\n\n#include <QtConcurrent\/QtConcurrent>\n#include <QDebug>\n#include <QQmlContext>\n#include <QQmlApplicationEngine>\n#include <libdevcore\/CommonJS.h>\n#include <libethereum\/Transaction.h>\n#include <libqwebthree\/QWebThree.h>\n#include \"AppContext.h\"\n#include \"DebuggingStateWrapper.h\"\n#include \"QContractDefinition.h\"\n#include \"QVariableDeclaration.h\"\n#include \"ContractCallDataEncoder.h\"\n#include \"CodeModel.h\"\n#include \"ClientModel.h\"\n#include \"QEther.h\"\n#include \"Web3Server.h\"\n#include \"ClientModel.h\"\n\nusing namespace dev;\nusing namespace dev::eth;\nusing namespace dev::mix;\n\nClientModel::ClientModel(AppContext* _context):\n\tm_context(_context), m_running(false), m_qWebThree(nullptr)\n{\n\tqRegisterMetaType<QBigInt*>(\"QBigInt*\");\n\tqRegisterMetaType<QEther*>(\"QEther*\");\n\tqRegisterMetaType<QVariableDefinition*>(\"QVariableDefinition*\");\n\tqRegisterMetaType<QVariableDefinitionList*>(\"QVariableDefinitionList*\");\n\tqRegisterMetaType<QList<QVariableDefinition*>>(\"QList<QVariableDefinition*>\");\n\tqRegisterMetaType<QList<QVariableDeclaration*>>(\"QList<QVariableDeclaration*>\");\n\tqRegisterMetaType<QVariableDeclaration*>(\"QVariableDeclaration*\");\n\tqRegisterMetaType<AssemblyDebuggerData>(\"AssemblyDebuggerData\");\n\n\tconnect(this, &ClientModel::dataAvailable, this, &ClientModel::showDebugger, Qt::QueuedConnection);\n\tm_client.reset(new MixClient());\n\n\tm_qWebThree = new QWebThree(this);\n\tm_qWebThreeConnector.reset(new QWebThreeConnector());\n\tm_qWebThreeConnector->setQWeb(m_qWebThree);\n\tm_web3Server.reset(new Web3Server(*m_qWebThreeConnector.get(), std::vector<dev::KeyPair> { m_client->userAccount() }, m_client.get()));\n\tconnect(m_qWebThree, &QWebThree::response, this, &ClientModel::apiResponse);\n\n\t_context->appEngine()->rootContext()->setContextProperty(\"clientModel\", this);\n}\n\nClientModel::~ClientModel()\n{\n}\n\nvoid ClientModel::apiRequest(QString const& _message)\n{\n\t(void)_message;\n\/\/\tm_qWebThree->postMessage(_message);\n}\n\nQString ClientModel::contractAddress() const\n{\n\tQString address = QString::fromStdString(dev::toJS(m_client->lastContractAddress()));\n\treturn address;\n}\n\nvoid ClientModel::debugDeployment()\n{\n\texecuteSequence(std::vector<TransactionSettings>(), 10000000 * ether);\n}\n\nvoid ClientModel::debugState(QVariantMap _state)\n{\n\tu256 balance = (qvariant_cast<QEther*>(_state.value(\"balance\")))->toU256Wei();\n\tQVariantList transactions = _state.value(\"transactions\").toList();\n\n\tstd::vector<TransactionSettings> transactionSequence;\n\tTransactionSettings constructorTr;\n\tfor (auto const& t: transactions)\n\t{\n\t\tQVariantMap transaction = t.toMap();\n\t\tQString functionId = transaction.value(\"functionId\").toString();\n\t\tu256 gas = (qvariant_cast<QEther*>(transaction.value(\"gas\")))->toU256Wei();\n\t\tu256 value = (qvariant_cast<QEther*>(transaction.value(\"value\")))->toU256Wei();\n\t\tu256 gasPrice = (qvariant_cast<QEther*>(transaction.value(\"gasPrice\")))->toU256Wei();\n\t\tQVariantMap params = transaction.value(\"parameters\").toMap();\n\t\tTransactionSettings transactionSettings(functionId, value, gas, gasPrice);\n\n\t\tfor (auto p = params.cbegin(); p != params.cend(); ++p)\n\t\t{\n\t\t\tQBigInt* param = qvariant_cast<QBigInt*>(p.value());\n\t\t\ttransactionSettings.parameterValues.insert(std::make_pair(p.key(), boost::get<dev::u256>(param->internalValue())));\n\t\t}\n\n\t\tif (transaction.value(\"executeConstructor\").toBool())\n\t\t\tconstructorTr = transactionSettings;\n\t\telse\n\t\t\ttransactionSequence.push_back(transactionSettings);\n\t}\n\texecuteSequence(transactionSequence, balance, constructorTr);\n}\n\nvoid ClientModel::executeSequence(std::vector<TransactionSettings> const& _sequence, u256 _balance, TransactionSettings const& ctrTransaction)\n{\n\tif (m_running)\n\t\tthrow (std::logic_error(\"debugging already running\"));\n\tauto compilerRes = m_context->codeModel()->code();\n\tstd::shared_ptr<QContractDefinition> contractDef = compilerRes->sharedContract();\n\tm_running = true;\n\n\temit runStarted();\n\temit stateChanged();\n\n\t\/\/run sequence\n\tQtConcurrent::run([=]()\n\t{\n\t\ttry\n\t\t{\n\t\t\tbytes contractCode = compilerRes->bytes();\n\t\t\tstd::vector<dev::bytes> transactonData;\n\t\t\tQFunctionDefinition* f = nullptr;\n\t\t\tContractCallDataEncoder c;\n\t\t\t\/\/encode data for all transactions\n\t\t\tfor (auto const& t: _sequence)\n\t\t\t{\n\t\t\t\tf = nullptr;\n\t\t\t\tfor (int tf = 0; tf < contractDef->functionsList().size(); tf++)\n\t\t\t\t{\n\t\t\t\t\tif (contractDef->functionsList().at(tf)->name() == t.functionId)\n\t\t\t\t\t{\n\t\t\t\t\t\tf = contractDef->functionsList().at(tf);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!f)\n\t\t\t\t\tthrow std::runtime_error(\"function \" + t.functionId.toStdString() + \" not found\");\n\n\t\t\t\tc.encode(f);\n\t\t\t\tfor (int p = 0; p < f->parametersList().size(); p++)\n\t\t\t\t{\n\t\t\t\t\tQVariableDeclaration* var = (QVariableDeclaration*)f->parametersList().at(p);\n\t\t\t\t\tu256 value = 0;\n\t\t\t\t\tauto v = t.parameterValues.find(var->name());\n\t\t\t\t\tif (v != t.parameterValues.cend())\n\t\t\t\t\t\tvalue = v->second;\n\t\t\t\t\tc.encode(var, value);\n\t\t\t\t}\n\t\t\t\ttransactonData.emplace_back(c.encodedData());\n\t\t\t}\n\n\t\t\t\/\/run contract creation first\n\t\t\tm_client->resetState(_balance);\n\t\t\tExecutionResult debuggingContent = deployContract(contractCode, ctrTransaction);\n\t\t\tAddress address = debuggingContent.contractAddress;\n\t\t\tfor (unsigned i = 0; i < _sequence.size(); ++i)\n\t\t\t\tdebuggingContent = callContract(address, transactonData.at(i), _sequence.at(i));\n\n\t\t\tQList<QVariableDefinition*> returnParameters;\n\n\t\t\tif (f)\n\t\t\t\treturnParameters = c.decode(f->returnParameters(), debuggingContent.returnValue);\n\n\t\t\t\/\/we need to wrap states in a QObject before sending to QML.\n\t\t\tQList<QObject*> wStates;\n\t\t\tfor (unsigned i = 0; i < debuggingContent.machineStates.size(); i++)\n\t\t\t{\n\t\t\t\tQPointer<DebuggingStateWrapper> s(new DebuggingStateWrapper(debuggingContent.executionCode, debuggingContent.executionData.toBytes()));\n\t\t\t\ts->setState(debuggingContent.machineStates[i]);\n\t\t\t\twStates.append(s);\n\t\t\t}\n\t\t\t\/\/collect states for last transaction\n\t\t\tAssemblyDebuggerData code = DebuggingStateWrapper::getHumanReadableCode(debuggingContent.executionCode);\n\t\t\temit dataAvailable(returnParameters, wStates, code);\n\t\t\temit runComplete();\n\t\t}\n\t\tcatch(boost::exception const&)\n\t\t{\n\t\t\temit runFailed(QString::fromStdString(boost::current_exception_diagnostic_information()));\n\t\t}\n\n\t\tcatch(std::exception const& e)\n\t\t{\n\t\t\temit runFailed(e.what());\n\t\t}\n\t\tm_running = false;\n\t\temit stateChanged();\n\t});\n}\n\nvoid ClientModel::showDebugger(QList<QVariableDefinition*> const& _returnParam, QList<QObject*> const& _wStates, AssemblyDebuggerData const& _code)\n{\n\tm_context->appEngine()->rootContext()->setContextProperty(\"debugStates\", QVariant::fromValue(_wStates));\n\tm_context->appEngine()->rootContext()->setContextProperty(\"humanReadableExecutionCode\", QVariant::fromValue(std::get<0>(_code)));\n\tm_context->appEngine()->rootContext()->setContextProperty(\"bytesCodeMapping\", QVariant::fromValue(std::get<1>(_code)));\n\tm_context->appEngine()->rootContext()->setContextProperty(\"contractCallReturnParameters\", QVariant::fromValue(new QVariableDefinitionList(_returnParam)));\n\tshowDebuggerWindow();\n}\n\nvoid ClientModel::showDebugError(QString const& _error)\n{\n\t\/\/TODO: change that to a signal\n\tm_context->displayMessageDialog(tr(\"Debugger\"), _error);\n}\n\nExecutionResult ClientModel::deployContract(bytes const& _code, TransactionSettings const& _ctrTransaction)\n{\n\tAddress newAddress;\n\tif (!ctrTransaction.isEmpty())\n\t\tnewAddress = m_client->transact(m_client->userAccount().secret(), _ctrTransaction.value, _code, _ctrTransaction.gas, _ctrTransaction.gasPrice);\n\telse\n\t{\n\t\tu256 gasPrice = 10000000000000;\n\t\tu256 gas = 125000;\n\t\tu256 amount = 100;\n\t\tnewAddress = m_client->transact(m_client->userAccount().secret(), amount, _code, gas, gasPrice);\n\t}\n\n\tAddress lastAddress = m_client->lastContractAddress();\n\tExecutionResult r = m_client->lastExecutionResult();\n\tif (newAddress != lastAddress)\n\t\tcontractAddressChanged();\n\treturn r;\n}\n\nExecutionResult ClientModel::callContract(Address const& _contract, bytes const& _data, TransactionSettings const& _tr)\n{\n\tm_client->transact(m_client->userAccount().secret(), _tr.value, _contract, _data, _tr.gas, _tr.gasPrice);\n\tExecutionResult r = m_client->lastExecutionResult();\n\tr.contractAddress = _contract;\n\treturn r;\n}\n<commit_msg> - Coding Standards<commit_after>\/*\n\tThis file is part of cpp-ethereum.\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\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\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 ClientModel.cpp\n * @author Yann yann@ethdev.com\n * @author Arkadiy Paronyan arkadiy@ethdev.com\n * @date 2015\n * Ethereum IDE client.\n *\/\n\n#include <QtConcurrent\/QtConcurrent>\n#include <QDebug>\n#include <QQmlContext>\n#include <QQmlApplicationEngine>\n#include <libdevcore\/CommonJS.h>\n#include <libethereum\/Transaction.h>\n#include <libqwebthree\/QWebThree.h>\n#include \"AppContext.h\"\n#include \"DebuggingStateWrapper.h\"\n#include \"QContractDefinition.h\"\n#include \"QVariableDeclaration.h\"\n#include \"ContractCallDataEncoder.h\"\n#include \"CodeModel.h\"\n#include \"ClientModel.h\"\n#include \"QEther.h\"\n#include \"Web3Server.h\"\n#include \"ClientModel.h\"\n\nusing namespace dev;\nusing namespace dev::eth;\nusing namespace dev::mix;\n\nClientModel::ClientModel(AppContext* _context):\n\tm_context(_context), m_running(false), m_qWebThree(nullptr)\n{\n\tqRegisterMetaType<QBigInt*>(\"QBigInt*\");\n\tqRegisterMetaType<QEther*>(\"QEther*\");\n\tqRegisterMetaType<QVariableDefinition*>(\"QVariableDefinition*\");\n\tqRegisterMetaType<QVariableDefinitionList*>(\"QVariableDefinitionList*\");\n\tqRegisterMetaType<QList<QVariableDefinition*>>(\"QList<QVariableDefinition*>\");\n\tqRegisterMetaType<QList<QVariableDeclaration*>>(\"QList<QVariableDeclaration*>\");\n\tqRegisterMetaType<QVariableDeclaration*>(\"QVariableDeclaration*\");\n\tqRegisterMetaType<AssemblyDebuggerData>(\"AssemblyDebuggerData\");\n\n\tconnect(this, &ClientModel::dataAvailable, this, &ClientModel::showDebugger, Qt::QueuedConnection);\n\tm_client.reset(new MixClient());\n\n\tm_qWebThree = new QWebThree(this);\n\tm_qWebThreeConnector.reset(new QWebThreeConnector());\n\tm_qWebThreeConnector->setQWeb(m_qWebThree);\n\tm_web3Server.reset(new Web3Server(*m_qWebThreeConnector.get(), std::vector<dev::KeyPair> { m_client->userAccount() }, m_client.get()));\n\tconnect(m_qWebThree, &QWebThree::response, this, &ClientModel::apiResponse);\n\n\t_context->appEngine()->rootContext()->setContextProperty(\"clientModel\", this);\n}\n\nClientModel::~ClientModel()\n{\n}\n\nvoid ClientModel::apiRequest(QString const& _message)\n{\n\t(void)_message;\n\/\/\tm_qWebThree->postMessage(_message);\n}\n\nQString ClientModel::contractAddress() const\n{\n\tQString address = QString::fromStdString(dev::toJS(m_client->lastContractAddress()));\n\treturn address;\n}\n\nvoid ClientModel::debugDeployment()\n{\n\texecuteSequence(std::vector<TransactionSettings>(), 10000000 * ether);\n}\n\nvoid ClientModel::debugState(QVariantMap _state)\n{\n\tu256 balance = (qvariant_cast<QEther*>(_state.value(\"balance\")))->toU256Wei();\n\tQVariantList transactions = _state.value(\"transactions\").toList();\n\n\tstd::vector<TransactionSettings> transactionSequence;\n\tTransactionSettings constructorTr;\n\tfor (auto const& t: transactions)\n\t{\n\t\tQVariantMap transaction = t.toMap();\n\t\tQString functionId = transaction.value(\"functionId\").toString();\n\t\tu256 gas = (qvariant_cast<QEther*>(transaction.value(\"gas\")))->toU256Wei();\n\t\tu256 value = (qvariant_cast<QEther*>(transaction.value(\"value\")))->toU256Wei();\n\t\tu256 gasPrice = (qvariant_cast<QEther*>(transaction.value(\"gasPrice\")))->toU256Wei();\n\t\tQVariantMap params = transaction.value(\"parameters\").toMap();\n\t\tTransactionSettings transactionSettings(functionId, value, gas, gasPrice);\n\n\t\tfor (auto p = params.cbegin(); p != params.cend(); ++p)\n\t\t{\n\t\t\tQBigInt* param = qvariant_cast<QBigInt*>(p.value());\n\t\t\ttransactionSettings.parameterValues.insert(std::make_pair(p.key(), boost::get<dev::u256>(param->internalValue())));\n\t\t}\n\n\t\tif (transaction.value(\"executeConstructor\").toBool())\n\t\t\tconstructorTr = transactionSettings;\n\t\telse\n\t\t\ttransactionSequence.push_back(transactionSettings);\n\t}\n\texecuteSequence(transactionSequence, balance, constructorTr);\n}\n\nvoid ClientModel::executeSequence(std::vector<TransactionSettings> const& _sequence, u256 _balance, TransactionSettings const& ctrTransaction)\n{\n\tif (m_running)\n\t\tthrow (std::logic_error(\"debugging already running\"));\n\tauto compilerRes = m_context->codeModel()->code();\n\tstd::shared_ptr<QContractDefinition> contractDef = compilerRes->sharedContract();\n\tm_running = true;\n\n\temit runStarted();\n\temit stateChanged();\n\n\t\/\/run sequence\n\tQtConcurrent::run([=]()\n\t{\n\t\ttry\n\t\t{\n\t\t\tbytes contractCode = compilerRes->bytes();\n\t\t\tstd::vector<dev::bytes> transactonData;\n\t\t\tQFunctionDefinition* f = nullptr;\n\t\t\tContractCallDataEncoder c;\n\t\t\t\/\/encode data for all transactions\n\t\t\tfor (auto const& t: _sequence)\n\t\t\t{\n\t\t\t\tf = nullptr;\n\t\t\t\tfor (int tf = 0; tf < contractDef->functionsList().size(); tf++)\n\t\t\t\t{\n\t\t\t\t\tif (contractDef->functionsList().at(tf)->name() == t.functionId)\n\t\t\t\t\t{\n\t\t\t\t\t\tf = contractDef->functionsList().at(tf);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!f)\n\t\t\t\t\tthrow std::runtime_error(\"function \" + t.functionId.toStdString() + \" not found\");\n\n\t\t\t\tc.encode(f);\n\t\t\t\tfor (int p = 0; p < f->parametersList().size(); p++)\n\t\t\t\t{\n\t\t\t\t\tQVariableDeclaration* var = (QVariableDeclaration*)f->parametersList().at(p);\n\t\t\t\t\tu256 value = 0;\n\t\t\t\t\tauto v = t.parameterValues.find(var->name());\n\t\t\t\t\tif (v != t.parameterValues.cend())\n\t\t\t\t\t\tvalue = v->second;\n\t\t\t\t\tc.encode(var, value);\n\t\t\t\t}\n\t\t\t\ttransactonData.emplace_back(c.encodedData());\n\t\t\t}\n\n\t\t\t\/\/run contract creation first\n\t\t\tm_client->resetState(_balance);\n\t\t\tExecutionResult debuggingContent = deployContract(contractCode, ctrTransaction);\n\t\t\tAddress address = debuggingContent.contractAddress;\n\t\t\tfor (unsigned i = 0; i < _sequence.size(); ++i)\n\t\t\t\tdebuggingContent = callContract(address, transactonData.at(i), _sequence.at(i));\n\n\t\t\tQList<QVariableDefinition*> returnParameters;\n\n\t\t\tif (f)\n\t\t\t\treturnParameters = c.decode(f->returnParameters(), debuggingContent.returnValue);\n\n\t\t\t\/\/we need to wrap states in a QObject before sending to QML.\n\t\t\tQList<QObject*> wStates;\n\t\t\tfor (unsigned i = 0; i < debuggingContent.machineStates.size(); i++)\n\t\t\t{\n\t\t\t\tQPointer<DebuggingStateWrapper> s(new DebuggingStateWrapper(debuggingContent.executionCode, debuggingContent.executionData.toBytes()));\n\t\t\t\ts->setState(debuggingContent.machineStates[i]);\n\t\t\t\twStates.append(s);\n\t\t\t}\n\t\t\t\/\/collect states for last transaction\n\t\t\tAssemblyDebuggerData code = DebuggingStateWrapper::getHumanReadableCode(debuggingContent.executionCode);\n\t\t\temit dataAvailable(returnParameters, wStates, code);\n\t\t\temit runComplete();\n\t\t}\n\t\tcatch(boost::exception const&)\n\t\t{\n\t\t\temit runFailed(QString::fromStdString(boost::current_exception_diagnostic_information()));\n\t\t}\n\n\t\tcatch(std::exception const& e)\n\t\t{\n\t\t\temit runFailed(e.what());\n\t\t}\n\t\tm_running = false;\n\t\temit stateChanged();\n\t});\n}\n\nvoid ClientModel::showDebugger(QList<QVariableDefinition*> const& _returnParam, QList<QObject*> const& _wStates, AssemblyDebuggerData const& _code)\n{\n\tm_context->appEngine()->rootContext()->setContextProperty(\"debugStates\", QVariant::fromValue(_wStates));\n\tm_context->appEngine()->rootContext()->setContextProperty(\"humanReadableExecutionCode\", QVariant::fromValue(std::get<0>(_code)));\n\tm_context->appEngine()->rootContext()->setContextProperty(\"bytesCodeMapping\", QVariant::fromValue(std::get<1>(_code)));\n\tm_context->appEngine()->rootContext()->setContextProperty(\"contractCallReturnParameters\", QVariant::fromValue(new QVariableDefinitionList(_returnParam)));\n\tshowDebuggerWindow();\n}\n\nvoid ClientModel::showDebugError(QString const& _error)\n{\n\t\/\/TODO: change that to a signal\n\tm_context->displayMessageDialog(tr(\"Debugger\"), _error);\n}\n\nExecutionResult ClientModel::deployContract(bytes const& _code, TransactionSettings const& _ctrTransaction)\n{\n\tAddress newAddress;\n\tif (!_ctrTransaction.isEmpty())\n\t\tnewAddress = m_client->transact(m_client->userAccount().secret(), _ctrTransaction.value, _code, _ctrTransaction.gas, _ctrTransaction.gasPrice);\n\telse\n\t{\n\t\tu256 gasPrice = 10000000000000;\n\t\tu256 gas = 125000;\n\t\tu256 amount = 100;\n\t\tnewAddress = m_client->transact(m_client->userAccount().secret(), amount, _code, gas, gasPrice);\n\t}\n\n\tAddress lastAddress = m_client->lastContractAddress();\n\tExecutionResult r = m_client->lastExecutionResult();\n\tif (newAddress != lastAddress)\n\t\tcontractAddressChanged();\n\treturn r;\n}\n\nExecutionResult ClientModel::callContract(Address const& _contract, bytes const& _data, TransactionSettings const& _tr)\n{\n\tm_client->transact(m_client->userAccount().secret(), _tr.value, _contract, _data, _tr.gas, _tr.gasPrice);\n\tExecutionResult r = m_client->lastExecutionResult();\n\tr.contractAddress = _contract;\n\treturn r;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"SphericalProjectionSurface.h\"\n#include \"utils\/Const.h\"\n\nnamespace carto {\n    \n    SphericalProjectionSurface::SphericalProjectionSurface() {\n    }\n\n    MapPos SphericalProjectionSurface::calculateMapPos(const cglib::vec3<double>& pos) const {\n        return SphericalToInternal(pos * (1.0 \/ SPHERE_SIZE));\n    }\n\n    MapVec SphericalProjectionSurface::calculateMapVec(const cglib::vec3<double>& pos, const cglib::vec3<double>& vec) const {\n        cglib::vec3<double> xyzPos = pos * (1.0 \/ SPHERE_SIZE);\n        cglib::mat3x3<double> xyzFrame = LocalFrame(xyzPos);\n        double scale = std::sqrt(xyzPos(0) * xyzPos(0) + xyzPos(1) * xyzPos(1)) \/ Const::PI;\n        cglib::vec3<double> mapVec = cglib::transform(vec, cglib::transpose(xyzFrame));\n        return MapVec(mapVec(0) * scale, mapVec(1) * scale, mapVec(2) * scale);\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::calculatePosition(const MapPos& mapPos) const {\n        return InternalToSpherical(mapPos) * SPHERE_SIZE;\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::calculateNormal(const MapPos& mapPos) const {\n        return InternalToSpherical(mapPos);\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::calculateVector(const MapPos& mapPos, const MapVec& mapVec) const {\n        cglib::vec3<double> xyzPos = InternalToSpherical(mapPos);\n        cglib::mat3x3<double> xyzFrame = LocalFrame(xyzPos);\n        double scale = Const::PI \/ std::sqrt(xyzPos(0) * xyzPos(0) + xyzPos(1) * xyzPos(1));\n        return cglib::transform(cglib::vec3<double>(mapVec.getX() * scale, mapVec.getY() * scale, mapVec.getZ() * scale), xyzFrame);\n    }\n\n    void SphericalProjectionSurface::tesselateSegment(const MapPos& mapPos0, const MapPos& mapPos1, std::vector<MapPos>& mapPoses) const {\n        \/\/ TODO: make it faster, non-recursive\n        MapPos mapPosM;\n        if (SplitSegment(mapPos0, mapPos1, mapPosM)) {\n            tesselateSegment(mapPos0, mapPosM, mapPoses);\n            tesselateSegment(mapPosM, mapPos1, mapPoses);\n            return;\n        }\n\n        mapPoses.push_back(mapPos0);\n        mapPoses.push_back(mapPos1);\n    }\n\n    void SphericalProjectionSurface::tesselateTriangle(unsigned int i0, unsigned int i1, unsigned int i2, std::vector<unsigned int>& indices, std::vector<MapPos>& mapPoses) const {\n        const MapPos& mapPos0 = mapPoses.at(i0);\n        const MapPos& mapPos1 = mapPoses.at(i1);\n        const MapPos& mapPos2 = mapPoses.at(i2);\n        \n        \/\/ TODO: make it faster, non-recursive\n        MapPos mapPosM;\n        if (SplitSegment(mapPos0, mapPos1, mapPosM)) {\n            unsigned int iM = static_cast<int>(mapPoses.size());\n            mapPoses.push_back(mapPosM);\n            tesselateTriangle(i2, i0, iM, indices, mapPoses);\n            tesselateTriangle(i1, i2, iM, indices, mapPoses);\n            return;\n        } else if (SplitSegment(mapPos0, mapPos2, mapPosM)) {\n            unsigned int iM = static_cast<int>(mapPoses.size());\n            mapPoses.push_back(mapPosM);\n            tesselateTriangle(i0, i1, iM, indices, mapPoses);\n            tesselateTriangle(i1, i2, iM, indices, mapPoses);\n            return;\n        } else if (SplitSegment(mapPos1, mapPos2, mapPosM)) {\n            unsigned int iM = static_cast<int>(mapPoses.size());\n            mapPoses.push_back(mapPosM);\n            tesselateTriangle(i0, i1, iM, indices, mapPoses);\n            tesselateTriangle(i2, i0, iM, indices, mapPoses);\n            return;\n        }\n\n        indices.push_back(i0);\n        indices.push_back(i1);\n        indices.push_back(i2);\n    }\n\n    double SphericalProjectionSurface::calculateDistance(const cglib::vec3<double> pos0, const cglib::vec3<double>& pos1) const {\n        double dot = cglib::dot_product(cglib::unit(pos0), cglib::unit(pos1));\n        double angle = std::acos(std::min(1.0, std::max(-1.0, dot)));\n        if (angle < PLANAR_APPROX_ANGLE) {\n            cglib::vec3<double> delta = cglib::unit(pos0) - cglib::unit(pos1);\n            return cglib::length(delta) * Const::WORLD_SIZE;\n        }\n        return angle * Const::WORLD_SIZE;\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::calculateNearestPoint(const cglib::vec3<double>& pos, double height) const {\n        return cglib::unit(pos) * (SPHERE_SIZE + height);\n    }\n    \n    cglib::vec3<double> SphericalProjectionSurface::calculateNearestPoint(const cglib::ray3<double>& ray, double height, double& t) const {\n        if (calculateHitPoint(ray, height, t)) {\n            return ray(t);\n        }\n        t = -cglib::dot_product(ray.origin, ray.direction) \/ cglib::norm(ray.direction);\n        return cglib::unit(ray(t)) * (SPHERE_SIZE + height);\n    }\n\n    bool SphericalProjectionSurface::calculateHitPoint(const cglib::ray3<double>& ray, double height, double& t) const {\n        double a = cglib::norm(ray.direction);\n        double b = 2.0 * cglib::dot_product(ray.direction, ray.origin);\n        double c = cglib::norm(ray.origin) - (SPHERE_SIZE + height) * (SPHERE_SIZE + height);\n        double d = b * b - 4.0 * a * c;\n        if (d < 0.0) {\n            return false;\n        }\n        t = (-b - std::sqrt(d)) \/ (2.0 * a);\n        return true;\n    }\n\n    cglib::mat4x4<double> SphericalProjectionSurface::calculateLocalFrameMatrix(const cglib::vec3<double>& pos) const {\n        cglib::mat3x3<double> localFrameMat3 = LocalFrame(pos * (1.0 \/ SPHERE_SIZE));\n        cglib::mat4x4<double> localFrameMat4 = cglib::mat4x4<double>::identity();\n        for (int i = 0; i < 3; i++) {\n            cglib::vec3<double> dir = cglib::unit(cglib::col_vector(localFrameMat3, i));\n            for (int j = 0; j < 3; j++) {\n                localFrameMat4(j, i) = dir(j) * SPHERE_SIZE \/ Const::EARTH_RADIUS;\n            }\n            localFrameMat4(i, 3) = pos(i);\n        }\n        return localFrameMat4;\n    }\n\n    cglib::mat4x4<double> SphericalProjectionSurface::calculateTranslateMatrix(const cglib::vec3<double>& pos0, const cglib::vec3<double>& pos1, double t) const {\n        double scale = (1 - t) + (cglib::length(pos1) \/ cglib::length(pos0)) * t;\n        cglib::mat4x4<double> scaleMat = cglib::scale4_matrix(cglib::vec3<double>(scale, scale, scale));\n\n        double dot = cglib::dot_product(cglib::unit(pos0), cglib::unit(pos1));\n        double angle = std::acos(std::min(1.0, std::max(-1.0, dot)));\n        cglib::vec3<double> axis = cglib::vector_product(cglib::unit(pos0), cglib::unit(pos1));\n        if (cglib::length(axis) > 0) {\n            if (angle < PLANAR_APPROX_ANGLE) { \/\/ less than 10m\n                return cglib::translate4_matrix((cglib::unit(pos1) - cglib::unit(pos0)) * (SPHERE_SIZE * t)) * scaleMat;\n            }\n            return cglib::rotate4_matrix(axis, angle * t) * scaleMat;\n        }\n        return scaleMat;\n    }\n\n    bool SphericalProjectionSurface::SplitSegment(const MapPos& mapPos0, const MapPos& mapPos1, MapPos& mapPosM) {\n        cglib::vec3<double> pos0 = cglib::unit(InternalToSpherical(mapPos0));\n        cglib::vec3<double> pos1 = cglib::unit(InternalToSpherical(mapPos1));\n        double dot = cglib::dot_product(pos0, pos1);\n        if (dot <= -1) {\n            return false; \/\/ exactly on the opposite side, no way to split\n        }\n        double angle = std::acos(std::min(1.0, std::max(-1.0, dot)));\n        if (angle * Const::EARTH_RADIUS < SEGMENT_SPLIT_THRESHOLD) {\n            return false;\n        }\n        mapPosM = SphericalToInternal(cglib::unit(pos0 + pos1));\n        return true;\n    }\n\n    MapPos SphericalProjectionSurface::SphericalToInternal(const cglib::vec3<double>& pos) {\n        double scale = Const::WORLD_SIZE \/ (2 * Const::PI);\n        double length = cglib::length(pos);\n        double x1 = pos(0) != 0 || pos(1) != 0 ? std::atan2(pos(1), pos(0)) : 0;\n        double y1 = std::atanh(std::max(-1.0, std::min(1.0, pos(2) \/ length)));\n        double z1 = length - 1.0;\n        return MapPos(x1 * scale, y1 * scale, z1 * scale);\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::InternalToSpherical(const MapPos& mapPos) {\n        double scale = 2 * Const::PI \/ Const::WORLD_SIZE;\n        double x1 = mapPos.getX() * scale;\n        double y1 = mapPos.getY() * scale;\n        double z1 = mapPos.getZ() * scale;\n        double rz = std::tanh(y1);\n        double ss = std::sqrt(std::max(0.0, 1.0 - rz * rz));\n        double rx = ss * std::cos(x1);\n        double ry = ss * std::sin(x1);\n        return cglib::vec3<double>(rx, ry, rz) * (1.0 + z1);\n    }\n\n    cglib::mat3x3<double> SphericalProjectionSurface::LocalFrame(const cglib::vec3<double>& pos) {\n        double x = pos(0);\n        double y = pos(1);\n        double z = pos(2);\n        \n        double dx_du = -y;\n        double dy_du = x;\n        double dz_du = 0;\n\n        double dx_dv = -z * x;\n        double dy_dv = -z * y;\n        double dz_dv = x * x + y * y;\n\n        double dx_dh = x;\n        double dy_dh = y;\n        double dz_dh = z;\n\n        return cglib::mat3x3<double> { { dx_du, dx_dv, dx_dh }, { dy_du, dy_dv, dy_dh }, { dz_du, dz_dv, dz_dh } };\n    }\n\n    const double SphericalProjectionSurface::SPHERE_SIZE = Const::WORLD_SIZE \/ Const::PI;\n\n    const double SphericalProjectionSurface::PLANAR_APPROX_ANGLE = 1.0e-6;\n\n    const double SphericalProjectionSurface::SEGMENT_SPLIT_THRESHOLD = Const::EARTH_CIRCUMFERENCE \/ 120.0;\n    \n}\n<commit_msg>Fix Z coordinate handling in SphericalProjectionSurface<commit_after>#include \"SphericalProjectionSurface.h\"\n#include \"utils\/Const.h\"\n\nnamespace carto {\n    \n    SphericalProjectionSurface::SphericalProjectionSurface() {\n    }\n\n    MapPos SphericalProjectionSurface::calculateMapPos(const cglib::vec3<double>& pos) const {\n        return SphericalToInternal(pos * (1.0 \/ SPHERE_SIZE));\n    }\n\n    MapVec SphericalProjectionSurface::calculateMapVec(const cglib::vec3<double>& pos, const cglib::vec3<double>& vec) const {\n        cglib::vec3<double> xyzPos = pos * (1.0 \/ SPHERE_SIZE);\n        cglib::mat3x3<double> xyzFrame = LocalFrame(xyzPos);\n        double scale = std::sqrt(xyzPos(0) * xyzPos(0) + xyzPos(1) * xyzPos(1)) \/ Const::PI;\n        cglib::vec3<double> mapVec = cglib::transform(vec, cglib::transpose(xyzFrame));\n        return MapVec(mapVec(0) * scale, mapVec(1) * scale, mapVec(2) * scale);\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::calculatePosition(const MapPos& mapPos) const {\n        return InternalToSpherical(mapPos) * SPHERE_SIZE;\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::calculateNormal(const MapPos& mapPos) const {\n        return InternalToSpherical(mapPos);\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::calculateVector(const MapPos& mapPos, const MapVec& mapVec) const {\n        cglib::vec3<double> xyzPos = InternalToSpherical(mapPos);\n        cglib::mat3x3<double> xyzFrame = LocalFrame(xyzPos);\n        double scale = Const::PI \/ std::sqrt(xyzPos(0) * xyzPos(0) + xyzPos(1) * xyzPos(1));\n        return cglib::transform(cglib::vec3<double>(mapVec.getX() * scale, mapVec.getY() * scale, mapVec.getZ() * scale), xyzFrame);\n    }\n\n    void SphericalProjectionSurface::tesselateSegment(const MapPos& mapPos0, const MapPos& mapPos1, std::vector<MapPos>& mapPoses) const {\n        \/\/ TODO: make it faster, non-recursive\n        MapPos mapPosM;\n        if (SplitSegment(mapPos0, mapPos1, mapPosM)) {\n            tesselateSegment(mapPos0, mapPosM, mapPoses);\n            tesselateSegment(mapPosM, mapPos1, mapPoses);\n            return;\n        }\n\n        mapPoses.push_back(mapPos0);\n        mapPoses.push_back(mapPos1);\n    }\n\n    void SphericalProjectionSurface::tesselateTriangle(unsigned int i0, unsigned int i1, unsigned int i2, std::vector<unsigned int>& indices, std::vector<MapPos>& mapPoses) const {\n        const MapPos& mapPos0 = mapPoses.at(i0);\n        const MapPos& mapPos1 = mapPoses.at(i1);\n        const MapPos& mapPos2 = mapPoses.at(i2);\n        \n        \/\/ TODO: make it faster, non-recursive\n        MapPos mapPosM;\n        if (SplitSegment(mapPos0, mapPos1, mapPosM)) {\n            unsigned int iM = static_cast<int>(mapPoses.size());\n            mapPoses.push_back(mapPosM);\n            tesselateTriangle(i2, i0, iM, indices, mapPoses);\n            tesselateTriangle(i1, i2, iM, indices, mapPoses);\n            return;\n        } else if (SplitSegment(mapPos0, mapPos2, mapPosM)) {\n            unsigned int iM = static_cast<int>(mapPoses.size());\n            mapPoses.push_back(mapPosM);\n            tesselateTriangle(i0, i1, iM, indices, mapPoses);\n            tesselateTriangle(i1, i2, iM, indices, mapPoses);\n            return;\n        } else if (SplitSegment(mapPos1, mapPos2, mapPosM)) {\n            unsigned int iM = static_cast<int>(mapPoses.size());\n            mapPoses.push_back(mapPosM);\n            tesselateTriangle(i0, i1, iM, indices, mapPoses);\n            tesselateTriangle(i2, i0, iM, indices, mapPoses);\n            return;\n        }\n\n        indices.push_back(i0);\n        indices.push_back(i1);\n        indices.push_back(i2);\n    }\n\n    double SphericalProjectionSurface::calculateDistance(const cglib::vec3<double> pos0, const cglib::vec3<double>& pos1) const {\n        double dot = cglib::dot_product(cglib::unit(pos0), cglib::unit(pos1));\n        double angle = std::acos(std::min(1.0, std::max(-1.0, dot)));\n        if (angle < PLANAR_APPROX_ANGLE) {\n            cglib::vec3<double> delta = cglib::unit(pos0) - cglib::unit(pos1);\n            return cglib::length(delta) * Const::WORLD_SIZE;\n        }\n        return angle * Const::WORLD_SIZE;\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::calculateNearestPoint(const cglib::vec3<double>& pos, double height) const {\n        return cglib::unit(pos) * (SPHERE_SIZE + height);\n    }\n    \n    cglib::vec3<double> SphericalProjectionSurface::calculateNearestPoint(const cglib::ray3<double>& ray, double height, double& t) const {\n        if (calculateHitPoint(ray, height, t)) {\n            return ray(t);\n        }\n        t = -cglib::dot_product(ray.origin, ray.direction) \/ cglib::norm(ray.direction);\n        return cglib::unit(ray(t)) * (SPHERE_SIZE + height);\n    }\n\n    bool SphericalProjectionSurface::calculateHitPoint(const cglib::ray3<double>& ray, double height, double& t) const {\n        double a = cglib::norm(ray.direction);\n        double b = 2.0 * cglib::dot_product(ray.direction, ray.origin);\n        double c = cglib::norm(ray.origin) - (SPHERE_SIZE + height) * (SPHERE_SIZE + height);\n        double d = b * b - 4.0 * a * c;\n        if (d < 0.0) {\n            return false;\n        }\n        t = (-b - std::sqrt(d)) \/ (2.0 * a);\n        return true;\n    }\n\n    cglib::mat4x4<double> SphericalProjectionSurface::calculateLocalFrameMatrix(const cglib::vec3<double>& pos) const {\n        cglib::mat3x3<double> localFrameMat3 = LocalFrame(pos * (1.0 \/ SPHERE_SIZE));\n        cglib::mat4x4<double> localFrameMat4 = cglib::mat4x4<double>::identity();\n        for (int i = 0; i < 3; i++) {\n            cglib::vec3<double> dir = cglib::unit(cglib::col_vector(localFrameMat3, i));\n            for (int j = 0; j < 3; j++) {\n                localFrameMat4(j, i) = dir(j) * SPHERE_SIZE \/ Const::EARTH_RADIUS;\n            }\n            localFrameMat4(i, 3) = pos(i);\n        }\n        return localFrameMat4;\n    }\n\n    cglib::mat4x4<double> SphericalProjectionSurface::calculateTranslateMatrix(const cglib::vec3<double>& pos0, const cglib::vec3<double>& pos1, double t) const {\n        double scale = (1 - t) + (cglib::length(pos1) \/ cglib::length(pos0)) * t;\n        cglib::mat4x4<double> scaleMat = cglib::scale4_matrix(cglib::vec3<double>(scale, scale, scale));\n\n        double dot = cglib::dot_product(cglib::unit(pos0), cglib::unit(pos1));\n        double angle = std::acos(std::min(1.0, std::max(-1.0, dot)));\n        cglib::vec3<double> axis = cglib::vector_product(cglib::unit(pos0), cglib::unit(pos1));\n        if (cglib::length(axis) > 0) {\n            if (angle < PLANAR_APPROX_ANGLE) { \/\/ less than 10m\n                return cglib::translate4_matrix((cglib::unit(pos1) - cglib::unit(pos0)) * (SPHERE_SIZE * t)) * scaleMat;\n            }\n            return cglib::rotate4_matrix(axis, angle * t) * scaleMat;\n        }\n        return scaleMat;\n    }\n\n    bool SphericalProjectionSurface::SplitSegment(const MapPos& mapPos0, const MapPos& mapPos1, MapPos& mapPosM) {\n        cglib::vec3<double> pos0 = cglib::unit(InternalToSpherical(mapPos0));\n        cglib::vec3<double> pos1 = cglib::unit(InternalToSpherical(mapPos1));\n        double dot = cglib::dot_product(pos0, pos1);\n        if (dot <= -1) {\n            return false; \/\/ exactly on the opposite side, no way to split\n        }\n        double angle = std::acos(std::min(1.0, std::max(-1.0, dot)));\n        if (angle * Const::EARTH_RADIUS < SEGMENT_SPLIT_THRESHOLD) {\n            return false;\n        }\n        mapPosM = SphericalToInternal(cglib::unit(pos0 + pos1));\n        return true;\n    }\n\n    MapPos SphericalProjectionSurface::SphericalToInternal(const cglib::vec3<double>& pos) {\n        double scale = Const::WORLD_SIZE \/ (2 * Const::PI);\n        double len = cglib::length(pos);\n        double rz = pos(2) \/ len;\n        double ss = std::sqrt(std::max(0.0, 1.0 - rz * rz));\n        double x1 = pos(0) != 0 || pos(1) != 0 ? std::atan2(pos(1), pos(0)) : 0;\n        double y1 = std::atanh(std::max(-1.0, std::min(1.0, rz)));\n        double z1 = (len - 1.0) \/ ss;\n        return MapPos(x1 * scale, y1 * scale, z1 * scale);\n    }\n\n    cglib::vec3<double> SphericalProjectionSurface::InternalToSpherical(const MapPos& mapPos) {\n        double scale = 2 * Const::PI \/ Const::WORLD_SIZE;\n        double x1 = mapPos.getX() * scale;\n        double y1 = mapPos.getY() * scale;\n        double z1 = mapPos.getZ() * scale;\n        double rz = std::tanh(y1);\n        double ss = std::sqrt(std::max(0.0, 1.0 - rz * rz));\n        double rx = ss * std::cos(x1);\n        double ry = ss * std::sin(x1);\n        double len = 1.0 + z1 * ss;\n        return cglib::vec3<double>(rx, ry, rz) * len;\n    }\n\n    cglib::mat3x3<double> SphericalProjectionSurface::LocalFrame(const cglib::vec3<double>& pos) {\n        double x = pos(0);\n        double y = pos(1);\n        double z = pos(2);\n        \n        double dx_du = -y;\n        double dy_du = x;\n        double dz_du = 0;\n\n        double dx_dv = -z * x;\n        double dy_dv = -z * y;\n        double dz_dv = x * x + y * y;\n\n        double dx_dh = x;\n        double dy_dh = y;\n        double dz_dh = z;\n\n        return cglib::mat3x3<double> { { dx_du, dx_dv, dx_dh }, { dy_du, dy_dv, dy_dh }, { dz_du, dz_dv, dz_dh } };\n    }\n\n    const double SphericalProjectionSurface::SPHERE_SIZE = Const::WORLD_SIZE \/ Const::PI;\n\n    const double SphericalProjectionSurface::PLANAR_APPROX_ANGLE = 1.0e-6;\n\n    const double SphericalProjectionSurface::SEGMENT_SPLIT_THRESHOLD = Const::EARTH_CIRCUMFERENCE \/ 120.0;\n    \n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"types.h\"\n#include \"stat.h\"\n#include \"user.h\"\n#include \"mtrace.h\"\n#include \"amd64.h\"\n#include \"uspinlock.h\"\n#include \"pthread.h\"\n\nenum { readaccess = 0 };\nenum { verbose = 0 };\nenum { npg = 1 };\n\nvoid*\nthr(void *arg)\n{\n  u64 tid = (u64)arg;\n\n  for (int i = 0; i < 1000000; i++) {\n    if (verbose && ((i % 100) == 0))\n      fprintf(1, \"%d: %d ops\\n\", tid, i);\n\n    volatile char *p = (char*) (0x40000UL + tid * npg * 4096);\n    if (map((void *) p, npg * 4096) < 0) {\n      fprintf(1, \"%d: map failed\\n\", tid);\n      exit();\n    }\n\n    if (readaccess) {\n      for (int j = 0; j < npg * 4096; j++)\n\tp[j] = '\\0';\n    }\n\n    if (unmap((void *) p, npg * 4096) < 0) {\n      fprintf(1, \"%d: unmap failed\\n\", tid);\n      exit();\n    }\n  }\n  return 0;\n}\n\nint\nmain(int ac, char **av)\n{\n  mtenable(\"xv6-mapbench\");\n\n  if (ac != 2) {\n    fprintf(1, \"usage: %s nthreads\\n\", av[0]);\n    exit();\n  }\n\n  int nthread = atoi(av[1]);\n\n  \/\/ fprintf(1, \"mapbench[%d]: start esp %x, nthread=%d\\n\", getpid(), rrsp(), nthread);\n\n  for(u64 i = 0; i < nthread; i++) {\n    pthread_t tid;\n    pthread_create(&tid, 0, thr, (void*) i);\n    if (0) fprintf(1, \"mapbench[%d]: child %d\\n\", getpid(), tid);\n  }\n\n  for(int i = 0; i < nthread; i++)\n    wait();\n\n  \/\/ fprintf(1, \"mapbench[%d]: done\\n\", getpid());\n  mtdisable(\"xv6-mapbench\");\n  \/\/ halt();\n  exit();\n}\n<commit_msg>get rid of mtenable\/mtdisable in mapbench<commit_after>#include \"types.h\"\n#include \"stat.h\"\n#include \"user.h\"\n#include \"amd64.h\"\n#include \"uspinlock.h\"\n#include \"pthread.h\"\n\nenum { readaccess = 0 };\nenum { verbose = 0 };\nenum { npg = 1 };\n\nvoid*\nthr(void *arg)\n{\n  u64 tid = (u64)arg;\n\n  for (int i = 0; i < 1000000; i++) {\n    if (verbose && ((i % 100) == 0))\n      fprintf(1, \"%d: %d ops\\n\", tid, i);\n\n    volatile char *p = (char*) (0x40000UL + tid * npg * 4096);\n    if (map((void *) p, npg * 4096) < 0) {\n      fprintf(1, \"%d: map failed\\n\", tid);\n      exit();\n    }\n\n    if (readaccess) {\n      for (int j = 0; j < npg * 4096; j++)\n\tp[j] = '\\0';\n    }\n\n    if (unmap((void *) p, npg * 4096) < 0) {\n      fprintf(1, \"%d: unmap failed\\n\", tid);\n      exit();\n    }\n  }\n  return 0;\n}\n\nint\nmain(int ac, char **av)\n{\n  if (ac != 2) {\n    fprintf(1, \"usage: %s nthreads\\n\", av[0]);\n    exit();\n  }\n\n  int nthread = atoi(av[1]);\n\n  \/\/ fprintf(1, \"mapbench[%d]: start esp %x, nthread=%d\\n\", getpid(), rrsp(), nthread);\n\n  for(u64 i = 0; i < nthread; i++) {\n    pthread_t tid;\n    pthread_create(&tid, 0, thr, (void*) i);\n    if (0) fprintf(1, \"mapbench[%d]: child %d\\n\", getpid(), tid);\n  }\n\n  for(int i = 0; i < nthread; i++)\n    wait();\n\n  \/\/ fprintf(1, \"mapbench[%d]: done\\n\", getpid());\n  \/\/ halt();\n  exit();\n}\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 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 \"UseAnalysisGroupings.h\"\n\n#include \"ModelBase\/src\/nodes\/Reference.h\"\n\nnamespace CodeReview\n{\n\nbool const UseAnalysisGroupings::ONLY_CONSIDER_CHANGES = true;\n\nUseAnalysisGroupings::DiffFrameInfo UseAnalysisGroupings::computeDiffFrameDependenciesAndPresentations\n\t\t(VersionControlUI::DiffFrame* diffFrame)\n{\n\tauto oldNode = diffFrame->oldVersionNode();\n\tauto newNode = diffFrame->newVersionNode();\n\n\tif (!oldNode && !newNode)\n\t\treturn {};\n\n\tQList<Model::Node*> stack;\n\tif (oldNode)\n\t\tstack << oldNode;\n\tif (newNode)\n\t\tstack << newNode;\n\n\tDiffFrameInfo diffFrameInfo;\n\n\twhile (!stack.isEmpty())\n\t{\n\t\tauto top = stack.takeLast();\n\t\tif (top)\n\t\t{\n\n\t\t\tif (auto referenceNode = DCast<Model::Reference>(top))\n\t\t\t{\n\t\t\t\tif (referenceNode->isResolved())\n\t\t\t\t\tdiffFrameInfo.refersTo_.insert(referenceNode->target());\n\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstack.append(top->children());\n\t\t\t\tdiffFrameInfo.shows_.insert(top);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ remove ids which are shown by this DiffFrame from the dependencies\n\tdiffFrameInfo.refersTo_.subtract(diffFrameInfo.shows_);\n\n\treturn diffFrameInfo;\n}\n\n\nQList<QList<VersionControlUI::DiffFrame*>> UseAnalysisGroupings::useAnalysisGrouping(QList<VersionControlUI::DiffFrame*>\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\t diffFrames)\n{\n\tQList<QList<VersionControlUI::DiffFrame*>> result;\n\n\tQHash<VersionControlUI::DiffFrame*, DiffFrameInfo> diffFrameToInfo;\n\tQHash<VersionControlUI::DiffFrame*, QList<VersionControlUI::DiffFrame*>*> groupLists;\n\n\tfor (auto diffFrame : diffFrames)\n\t{\n\t\tauto info = computeDiffFrameDependenciesAndPresentations(diffFrame);\n\n\t\tdiffFrameToInfo.insert(diffFrame, info);\n\t}\n\n\tfor (auto diffFrame : diffFrames)\n\t{\n\t\tbool dependsOnOther = false;\n\n\t\tfor (auto otherDiffFrame : diffFrames)\n\t\t{\n\t\t\tif (diffFrame == otherDiffFrame) continue;\n\n\t\t\tif (dependsOn(diffFrameToInfo.value(diffFrame), otherDiffFrame, diffFrameToInfo.value(otherDiffFrame)))\n\t\t\t{\n\t\t\t\tdependsOnOther = true;\n\t\t\t\tauto iter = groupLists.find(otherDiffFrame);\n\t\t\t\tif (iter != groupLists.end())\n\t\t\t\t{\n\t\t\t\t\titer.value()->append(diffFrame);\n\t\t\t\t\tgroupLists.insert(diffFrame, iter.value());\n\t\t\t\t} else\n\t\t\t\t{\n\t\t\t\t\tresult.append(QList<VersionControlUI::DiffFrame*>{});\n\t\t\t\t\tresult.last().append(diffFrame);\n\t\t\t\t\tresult.last().append(otherDiffFrame);\n\t\t\t\t\tgroupLists.insert(diffFrame, &result.last());\n\t\t\t\t\tgroupLists.insert(otherDiffFrame, &result.last());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (!dependsOnOther && !groupLists.contains(diffFrame))\n\t\t{\n\t\t\tresult.append(QList<VersionControlUI::DiffFrame*>{});\n\t\t\tresult.last().append(diffFrame);\n\t\t\tgroupLists.insert(diffFrame, &result.last());\n\t\t}\n\t}\n\treturn result;\n}\n\nbool UseAnalysisGroupings::dependsOn(DiffFrameInfo infoA,\n\t\t\t\t\t\t\t\t\t\t\t\tVersionControlUI::DiffFrame* frameB, DiffFrameInfo infoB)\n{\n\tif (ONLY_CONSIDER_CHANGES)\n\t{\n\t\tfor (auto referal : infoA.refersTo_)\n\t\t{\n\t\t\tfor (auto changesOld : frameB->oldChangedNodes())\n\t\t\t\tif (changesOld->isSameOrAncestorOf(referal))\n\t\t\t\t\treturn true;\n\t\t\tfor (auto changesNew : frameB->newChangedNodes())\n\t\t\t\tif (changesNew->isSameOrAncestorOf(referal))\n\t\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\tauto refers = infoA.refersTo_;\n\t\tauto shows = infoB.shows_;\n\t\treturn !refers.intersect(shows).isEmpty();\n\t}\n}\n\n}\n<commit_msg>Fix condition for dependsOn function<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 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 \"UseAnalysisGroupings.h\"\n\n#include \"ModelBase\/src\/nodes\/Reference.h\"\n\nnamespace CodeReview\n{\n\nbool const UseAnalysisGroupings::ONLY_CONSIDER_CHANGES = true;\n\nUseAnalysisGroupings::DiffFrameInfo UseAnalysisGroupings::computeDiffFrameDependenciesAndPresentations\n\t\t(VersionControlUI::DiffFrame* diffFrame)\n{\n\tauto oldNode = diffFrame->oldVersionNode();\n\tauto newNode = diffFrame->newVersionNode();\n\n\tif (!oldNode && !newNode)\n\t\treturn {};\n\n\tQList<Model::Node*> stack;\n\tif (oldNode)\n\t\tstack << oldNode;\n\tif (newNode)\n\t\tstack << newNode;\n\n\tDiffFrameInfo diffFrameInfo;\n\n\twhile (!stack.isEmpty())\n\t{\n\t\tauto top = stack.takeLast();\n\t\tif (top)\n\t\t{\n\n\t\t\tif (auto referenceNode = DCast<Model::Reference>(top))\n\t\t\t{\n\t\t\t\tif (referenceNode->isResolved())\n\t\t\t\t\tdiffFrameInfo.refersTo_.insert(referenceNode->target());\n\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstack.append(top->children());\n\t\t\t\tdiffFrameInfo.shows_.insert(top);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ remove ids which are shown by this DiffFrame from the dependencies\n\tdiffFrameInfo.refersTo_.subtract(diffFrameInfo.shows_);\n\n\treturn diffFrameInfo;\n}\n\n\nQList<QList<VersionControlUI::DiffFrame*>> UseAnalysisGroupings::useAnalysisGrouping(QList<VersionControlUI::DiffFrame*>\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\t diffFrames)\n{\n\tQList<QList<VersionControlUI::DiffFrame*>> result;\n\n\tQHash<VersionControlUI::DiffFrame*, DiffFrameInfo> diffFrameToInfo;\n\tQHash<VersionControlUI::DiffFrame*, QList<VersionControlUI::DiffFrame*>*> groupLists;\n\n\tfor (auto diffFrame : diffFrames)\n\t{\n\t\tauto info = computeDiffFrameDependenciesAndPresentations(diffFrame);\n\n\t\tdiffFrameToInfo.insert(diffFrame, info);\n\t}\n\n\tfor (auto diffFrame : diffFrames)\n\t{\n\t\tbool dependsOnOther = false;\n\n\t\tfor (auto otherDiffFrame : diffFrames)\n\t\t{\n\t\t\tif (diffFrame == otherDiffFrame) continue;\n\n\t\t\tif (dependsOn(diffFrameToInfo.value(diffFrame), otherDiffFrame, diffFrameToInfo.value(otherDiffFrame)))\n\t\t\t{\n\t\t\t\tdependsOnOther = true;\n\t\t\t\tauto iter = groupLists.find(otherDiffFrame);\n\t\t\t\tif (iter != groupLists.end())\n\t\t\t\t{\n\t\t\t\t\titer.value()->append(diffFrame);\n\t\t\t\t\tgroupLists.insert(diffFrame, iter.value());\n\t\t\t\t} else\n\t\t\t\t{\n\t\t\t\t\tresult.append(QList<VersionControlUI::DiffFrame*>{});\n\t\t\t\t\tresult.last().append(diffFrame);\n\t\t\t\t\tresult.last().append(otherDiffFrame);\n\t\t\t\t\tgroupLists.insert(diffFrame, &result.last());\n\t\t\t\t\tgroupLists.insert(otherDiffFrame, &result.last());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (!dependsOnOther && !groupLists.contains(diffFrame))\n\t\t{\n\t\t\tresult.append(QList<VersionControlUI::DiffFrame*>{});\n\t\t\tresult.last().append(diffFrame);\n\t\t\tgroupLists.insert(diffFrame, &result.last());\n\t\t}\n\t}\n\treturn result;\n}\n\nbool UseAnalysisGroupings::dependsOn(DiffFrameInfo infoA,\n\t\t\t\t\t\t\t\t\t\t\t\tVersionControlUI::DiffFrame* frameB, DiffFrameInfo infoB)\n{\n\tif (ONLY_CONSIDER_CHANGES)\n\t{\n\t\tfor (auto referal : infoA.refersTo_)\n\t\t{\n\t\t\tfor (auto changesOld : frameB->oldChangedNodes())\n\t\t\t\tif (changesOld->isSameOrAncestorOf(referal) || referal->isSameOrAncestorOf(changesOld))\n\t\t\t\t\treturn true;\n\t\t\tfor (auto changesNew : frameB->newChangedNodes())\n\t\t\t\tif (changesNew->isSameOrAncestorOf(referal) || referal->isSameOrAncestorOf(changesNew))\n\t\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\tauto refers = infoA.refersTo_;\n\t\tauto shows = infoB.shows_;\n\t\treturn !refers.intersect(shows).isEmpty();\n\t}\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n* This is an open source non-commercial project. Dear PVS-Studio, please check it.\r\n* PVS-Studio Static Code Analyzer for C, C++ and C#: http:\/\/www.viva64.com\r\n*\/\r\n\/\/ Google Test library\r\n#include <gtest\/gtest.h>\r\n\r\n\/\/ uArchSim modules\r\n#include \"..\/cow_string.h\"\r\n\r\nTEST( Cow_String, Copy_Check)\r\n{\r\n    CowString a {\"Hello\"};\r\n    CowString b = a;\r\n    ASSERT_EQ( a, b);\r\n    ASSERT_EQ( static_cast<std::string_view>(a).data(), static_cast<std::string_view>(b).data());\r\n\r\n    b += \" World!\";\r\n    ASSERT_EQ( a, \"Hello\");\r\n    ASSERT_EQ( b, \"Hello World!\");\r\n    ASSERT_NE( a, b);\r\n    ASSERT_NE( static_cast<std::string_view>(a).data(), static_cast<std::string_view>(b).data());\r\n}\r\n\r\nTEST( Cow_String, Assignment_Check)\r\n{\r\n    CowString a {\"Hello\"};\r\n    CowString b = a;\r\n    ASSERT_EQ( a, b);\r\n    ASSERT_EQ( static_cast<std::string_view>(a).data(), static_cast<std::string_view>(b).data());\r\n\r\n    a = \"Goodbye!\";\r\n    ASSERT_EQ( a, \"Goodbye!\");\r\n    ASSERT_EQ( b, \"Hello\");\r\n    ASSERT_NE( a, b);\r\n    ASSERT_NE( static_cast<std::string_view>(a).data(), static_cast<std::string_view>(b).data());\r\n}\r\n\r\nTEST( Cow_String, Empty_String)\r\n{\r\n    CowString a;\r\n    ASSERT_EQ( a, \"\");\r\n    CowString b = a;\r\n    ASSERT_EQ( b, \"\");\r\n\r\n    a = \"Hello!\";\r\n    ASSERT_EQ( a, \"Hello!\");\r\n    ASSERT_EQ( b, \"\");\r\n    ASSERT_NE( a, b);\r\n    \r\n    b = \"Goodbye!\";\r\n    ASSERT_EQ( b, \"Goodbye!\");\r\n    ASSERT_NE( a, b);\r\n\r\n    CowString c;\r\n    ASSERT_EQ( c, \"\");\r\n    c += \"World!\";\r\n    ASSERT_EQ( c, \"World!\");\r\n}\r\n\r\nint main( int argc, char* argv[])\r\n{\r\n    ::testing::InitGoogleTest( &argc, argv);\r\n    ::testing::FLAGS_gtest_death_test_style = \"threadsafe\";\r\n    return RUN_ALL_TESTS();\r\n}\r\n<commit_msg>Update unit_test.cpp<commit_after>\/*\r\n* This is an open source non-commercial project. Dear PVS-Studio, please check it.\r\n* PVS-Studio Static Code Analyzer for C, C++ and C#: http:\/\/www.viva64.com\r\n*\/\r\n\/\/ Google Test library\r\n#include <gtest\/gtest.h>\r\n\r\n\/\/ uArchSim modules\r\n#include \"..\/cow_string.h\"\r\n\r\nTEST( Cow_String, Copy_Check)\r\n{\r\n    CowString a {\"Hello\"};\r\n    CowString b = a;\r\n    ASSERT_EQ( a, b);\r\n    ASSERT_EQ( static_cast<std::string_view>(a).data(), static_cast<std::string_view>(b).data());\r\n\r\n    b += \" World!\";\r\n    ASSERT_EQ( a, \"Hello\");\r\n    ASSERT_EQ( b, \"Hello World!\");\r\n    ASSERT_NE( a, b);\r\n    ASSERT_NE( static_cast<std::string_view>(a).data(), static_cast<std::string_view>(b).data());\r\n}\r\n\r\nTEST( Cow_String, Assignment_Check)\r\n{\r\n    CowString a {\"Hello\"};\r\n    CowString b = a;\r\n    ASSERT_EQ( a, b);\r\n    ASSERT_EQ( static_cast<std::string_view>(a).data(), static_cast<std::string_view>(b).data());\r\n\r\n    a = \"Goodbye!\";\r\n    ASSERT_EQ( a, \"Goodbye!\");\r\n    ASSERT_EQ( b, \"Hello\");\r\n    ASSERT_NE( a, b);\r\n    ASSERT_NE( static_cast<std::string_view>(a).data(), static_cast<std::string_view>(b).data());\r\n}\r\n\r\nTEST( Cow_String, Empty_String)\r\n{\r\n    CowString a;\r\n    ASSERT_EQ( a, \"\");\r\n    CowString b = a;\r\n    ASSERT_EQ( b, \"\");\r\n\r\n    a = \"Hello!\";\r\n    ASSERT_EQ( a, \"Hello!\");\r\n    ASSERT_EQ( b, \"\");\r\n    ASSERT_NE( a, b);\r\n    \r\n    b = \"Goodbye!\";\r\n    ASSERT_EQ( b, \"Goodbye!\");\r\n    ASSERT_NE( a, b);\r\n\r\n    CowString c;\r\n    CowString d = c;\r\n    ASSERT_EQ( c, \"\");\r\n    c += \"World!\";\r\n    ASSERT_EQ( c, \"World!\");\r\n    ASSERT_EQ( d, \"\");\r\n}\r\n\r\nint main( int argc, char* argv[])\r\n{\r\n    ::testing::InitGoogleTest( &argc, argv);\r\n    ::testing::FLAGS_gtest_death_test_style = \"threadsafe\";\r\n    return RUN_ALL_TESTS();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"ConfigTypes.h\"\n\n\/*\nvoid ConfigSet::set(string name, string value){\n    Strings[name] = value;\n}\n\nvoid ConfigSet::set( string name, std::map <string, std::pair <int, int> > value ){\n\tPairs[name] = value;\n}\n\nvoid ConfigSet::set( string name, std::vector < int > value ){\n\tVectors[name] = value;\n}\n\nstring ConfigSet::get(string name){\n    std::map < string, string>::iterator iter = Strings.find( name );\n    if( iter != Strings.end() )\n        return iter->second;\n    return \"\";\n}\n*\/\n<commit_msg>Cleanup<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTreeDifferenceFilter.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#include \"vtkTreeDifferenceFilter.h\"\n\n#include \"vtkDataSetAttributes.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkMath.h\"\n#include \"vtkNew.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkTree.h\"\n\nvtkStandardNewMacro(vtkTreeDifferenceFilter);\n\n\/\/---------------------------------------------------------------------------\nvtkTreeDifferenceFilter::vtkTreeDifferenceFilter()\n{\n  this->SetNumberOfInputPorts(2);\n  this->SetNumberOfOutputPorts(1);\n\n  this->IdArrayName = 0;\n  this->ComparisonArrayName = 0;\n  this->OutputArrayName = 0;\n  this->ComparisonArrayIsVertexData = false;\n}\n\n\/\/---------------------------------------------------------------------------\nvtkTreeDifferenceFilter::~vtkTreeDifferenceFilter()\n{\n  \/\/ release memory\n  this->SetIdArrayName(0);\n  this->SetComparisonArrayName(0);\n  this->SetOutputArrayName(0);\n}\n\n\/\/---------------------------------------------------------------------------\nint vtkTreeDifferenceFilter::FillInputPortInformation(int port, vtkInformation *info)\n{\n  if(port == 0)\n    {\n    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkTree\");\n    }\n  else if(port == 1)\n    {\n    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkTree\");\n    info->Set(vtkAlgorithm::INPUT_IS_OPTIONAL(), 1);\n    }\n\n  return 1;\n}\n\n\/\/---------------------------------------------------------------------------\nint vtkTreeDifferenceFilter::RequestData(\n  vtkInformation*,\n  vtkInformationVector** inputVector,\n  vtkInformationVector* outputVector)\n{\n  vtkInformation* tree1_info = inputVector[0]->GetInformationObject(0);\n  vtkTree* tree1 = vtkTree::SafeDownCast(\n    tree1_info->Get(vtkDataObject::DATA_OBJECT()));\n\n  \/\/ Copy the structure into the output.\n  vtkTree* outputTree = vtkTree::GetData(outputVector);\n\n  vtkInformation* tree2_info = inputVector[1]->GetInformationObject(0);\n  if(!tree2_info)\n    {\n    \/\/ If no second tree provided, we're done\n    outputTree->CheckedShallowCopy(tree1);\n    return 0;\n    }\n\n  vtkTree* tree2 = vtkTree::SafeDownCast(\n    tree2_info->Get(vtkDataObject::DATA_OBJECT()));\n\n  if (this->IdArrayName != 0)\n    {\n    if (!this->GenerateMapping(tree1, tree2))\n      {\n      return 0;\n      }\n    }\n  else\n    {\n    this->VertexMap.clear();\n    for (vtkIdType vertex = 0; vertex < tree1->GetNumberOfVertices(); ++vertex)\n      {\n      this->VertexMap[vertex] = vertex;\n      }\n\n    this->EdgeMap.clear();\n    for (vtkIdType edge = 0; edge < tree1->GetNumberOfEdges(); ++edge)\n      {\n      this->VertexMap[edge] = edge;\n      }\n    }\n\n  this->ComputeDifference(tree1, tree2);\n\n  if (!outputTree->CheckedShallowCopy(tree1))\n    {\n    vtkErrorMacro(<<\"Invalid tree structure.\");\n    return 0;\n    }\n  return 1;\n}\n\n\/\/---------------------------------------------------------------------------\nbool vtkTreeDifferenceFilter::GenerateMapping(vtkTree *tree1, vtkTree *tree2)\n{\n  this->VertexMap.clear();\n  this->VertexMap.assign(tree1->GetNumberOfVertices(), -1);\n\n  this->EdgeMap.clear();\n  this->EdgeMap.assign(tree1->GetNumberOfEdges(), -1);\n\n  vtkStringArray *nodeNames1 = vtkStringArray::SafeDownCast(\n    tree1->GetVertexData()->GetAbstractArray(this->IdArrayName));\n  if (nodeNames1 == NULL)\n    {\n    vtkErrorMacro(\"tree #1's VertexData does not have a vtkStringArray named \"\n      << this->IdArrayName);\n    return false;\n    }\n\n  vtkStringArray *nodeNames2 = vtkStringArray::SafeDownCast(\n    tree2->GetVertexData()->GetAbstractArray(this->IdArrayName));\n  if (nodeNames2 == NULL)\n    {\n    vtkErrorMacro(\"tree #2's VertexData does not have a vtkStringArray named \"\n      << this->IdArrayName);\n    return false;\n    }\n\n  vtkIdType root1 = tree1->GetRoot();\n  vtkIdType root2 = tree2->GetRoot();\n\n  vtkIdType edgeId1 = -1;\n  vtkIdType edgeId2 = -1;\n\n  \/\/ iterate over the vertex names for tree #1, finding the corresponding\n  \/\/ vertex in tree #2.\n  for (vtkIdType vertexItr = 0; vertexItr < nodeNames1->GetNumberOfTuples();\n       ++vertexItr)\n    {\n    vtkIdType vertexId1 = vertexItr;\n    std::string nodeName = nodeNames1->GetValue(vertexId1);\n    if (nodeName.compare(\"\") == 0)\n      {\n      continue;\n      }\n\n    \/\/ record this correspondence in the maps\n    vtkIdType vertexId2 = nodeNames2->LookupValue(nodeName);\n    if (vertexId2 == -1)\n      {\n      vtkWarningMacro(\"tree #2 does not contain a vertex named \" << nodeName);\n      continue;\n      }\n    this->VertexMap[vertexId1] = vertexId2;\n\n    if (vertexId1 == root1 || vertexId2 == root2)\n      {\n      continue;\n      }\n\n    edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1);\n    edgeId2 = tree2->GetEdgeId(tree2->GetParent(vertexId2), vertexId2);\n    this->EdgeMap[edgeId1] = edgeId2;\n\n    \/\/ descend the tree until we reach the root, mapping parent vertices to\n    \/\/ each other along the way.\n    while (tree1->GetParent(vertexId1) != root1 &&\n           tree2->GetParent(vertexId2) != root2)\n      {\n      vertexId1 = tree1->GetParent(vertexId1);\n      vertexId2 = tree2->GetParent(vertexId2);\n      if (this->VertexMap[vertexId1] == -1)\n        {\n        this->VertexMap[vertexId1] = vertexId2;\n        edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1);\n        edgeId2 = tree2->GetEdgeId(tree2->GetParent(vertexId2), vertexId2);\n        this->EdgeMap[edgeId1] = edgeId2;\n        }\n      }\n    }\n\n  return true;\n}\n\n\/\/---------------------------------------------------------------------------\nvoid vtkTreeDifferenceFilter::ComputeDifference(vtkTree *tree1, vtkTree *tree2)\n{\n  if (this->ComparisonArrayName == 0)\n    {\n    vtkErrorMacro(\"ComparisonArrayName has not been set.\");\n    return;\n    }\n\n  vtkDataSetAttributes *treeData1, *treeData2;\n  const char *dataName;\n  if (this->ComparisonArrayIsVertexData)\n    {\n    treeData1 = tree1->GetVertexData();\n    treeData2 = tree2->GetVertexData();\n    dataName = \"VertexData\";\n    }\n  else\n    {\n    treeData1 = tree1->GetEdgeData();\n    treeData2 = tree2->GetEdgeData();\n    dataName = \"EdgeData\";\n    }\n\n  vtkDoubleArray *arrayToCompare1 = vtkDoubleArray::SafeDownCast(\n    treeData1->GetAbstractArray(this->ComparisonArrayName));\n  if (arrayToCompare1 == NULL)\n    {\n    vtkErrorMacro(\"tree #1's \" << dataName <<\n      \" does not have a vtkDoubleArray named \" << this->IdArrayName);\n    return;\n    }\n\n  vtkDoubleArray *arrayToCompare2 = vtkDoubleArray::SafeDownCast(\n    treeData2->GetAbstractArray(this->ComparisonArrayName));\n  if (arrayToCompare2 == NULL)\n    {\n    vtkErrorMacro(\"tree #2's \" << dataName <<\n      \" does not have a vtkDoubleArray named \" << this->IdArrayName);\n    return;\n    }\n\n  vtkNew<vtkDoubleArray> resultArray;\n  resultArray->SetNumberOfValues(arrayToCompare1->GetNumberOfTuples());\n  resultArray->FillComponent(0, vtkMath::Nan());\n\n  if (this->OutputArrayName == 0)\n    {\n    resultArray->SetName(\"difference\");\n    }\n  else\n    {\n    resultArray->SetName(this->OutputArrayName);\n    }\n\n  vtkIdType treeId2;\n  for (vtkIdType treeId1 = 0; treeId1 < arrayToCompare1->GetNumberOfTuples();\n       ++treeId1)\n    {\n    treeId2 = this->EdgeMap[treeId1];\n    double result =\n      arrayToCompare1->GetValue(treeId1) - arrayToCompare2->GetValue(treeId2);\n    resultArray->SetValue(treeId1, result);\n    }\n\n  treeData1->AddArray(resultArray.GetPointer());\n}\n\n\/\/---------------------------------------------------------------------------\nvoid vtkTreeDifferenceFilter::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n}\n<commit_msg>Fix some logic errors<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTreeDifferenceFilter.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#include \"vtkTreeDifferenceFilter.h\"\n\n#include \"vtkDataSetAttributes.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkMath.h\"\n#include \"vtkNew.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkTree.h\"\n\nvtkStandardNewMacro(vtkTreeDifferenceFilter);\n\n\/\/---------------------------------------------------------------------------\nvtkTreeDifferenceFilter::vtkTreeDifferenceFilter()\n{\n  this->SetNumberOfInputPorts(2);\n  this->SetNumberOfOutputPorts(1);\n\n  this->IdArrayName = 0;\n  this->ComparisonArrayName = 0;\n  this->OutputArrayName = 0;\n  this->ComparisonArrayIsVertexData = false;\n}\n\n\/\/---------------------------------------------------------------------------\nvtkTreeDifferenceFilter::~vtkTreeDifferenceFilter()\n{\n  \/\/ release memory\n  this->SetIdArrayName(0);\n  this->SetComparisonArrayName(0);\n  this->SetOutputArrayName(0);\n}\n\n\/\/---------------------------------------------------------------------------\nint vtkTreeDifferenceFilter::FillInputPortInformation(int port, vtkInformation *info)\n{\n  if(port == 0)\n    {\n    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkTree\");\n    }\n  else if(port == 1)\n    {\n    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkTree\");\n    info->Set(vtkAlgorithm::INPUT_IS_OPTIONAL(), 1);\n    }\n\n  return 1;\n}\n\n\/\/---------------------------------------------------------------------------\nint vtkTreeDifferenceFilter::RequestData(\n  vtkInformation*,\n  vtkInformationVector** inputVector,\n  vtkInformationVector* outputVector)\n{\n  vtkInformation* tree1_info = inputVector[0]->GetInformationObject(0);\n  vtkTree* tree1 = vtkTree::SafeDownCast(\n    tree1_info->Get(vtkDataObject::DATA_OBJECT()));\n\n  \/\/ Copy the structure into the output.\n  vtkTree* outputTree = vtkTree::GetData(outputVector);\n\n  vtkInformation* tree2_info = inputVector[1]->GetInformationObject(0);\n  if(!tree2_info)\n    {\n    \/\/ If no second tree provided, we're done\n    outputTree->CheckedShallowCopy(tree1);\n    return 0;\n    }\n\n  vtkTree* tree2 = vtkTree::SafeDownCast(\n    tree2_info->Get(vtkDataObject::DATA_OBJECT()));\n\n  if (this->IdArrayName != 0)\n    {\n    if (!this->GenerateMapping(tree1, tree2))\n      {\n      return 0;\n      }\n    }\n  else\n    {\n    this->VertexMap.clear();\n    for (vtkIdType vertex = 0; vertex < tree1->GetNumberOfVertices(); ++vertex)\n      {\n      this->VertexMap[vertex] = vertex;\n      }\n\n    this->EdgeMap.clear();\n    for (vtkIdType edge = 0; edge < tree1->GetNumberOfEdges(); ++edge)\n      {\n      this->EdgeMap[edge] = edge;\n      }\n    }\n\n  this->ComputeDifference(tree1, tree2);\n\n  if (!outputTree->CheckedShallowCopy(tree1))\n    {\n    vtkErrorMacro(<<\"Invalid tree structure.\");\n    return 0;\n    }\n  return 1;\n}\n\n\/\/---------------------------------------------------------------------------\nbool vtkTreeDifferenceFilter::GenerateMapping(vtkTree *tree1, vtkTree *tree2)\n{\n  this->VertexMap.clear();\n  this->VertexMap.assign(tree1->GetNumberOfVertices(), -1);\n\n  this->EdgeMap.clear();\n  this->EdgeMap.assign(tree1->GetNumberOfEdges(), -1);\n\n  vtkStringArray *nodeNames1 = vtkStringArray::SafeDownCast(\n    tree1->GetVertexData()->GetAbstractArray(this->IdArrayName));\n  if (nodeNames1 == NULL)\n    {\n    vtkErrorMacro(\"tree #1's VertexData does not have a vtkStringArray named \"\n      << this->IdArrayName);\n    return false;\n    }\n\n  vtkStringArray *nodeNames2 = vtkStringArray::SafeDownCast(\n    tree2->GetVertexData()->GetAbstractArray(this->IdArrayName));\n  if (nodeNames2 == NULL)\n    {\n    vtkErrorMacro(\"tree #2's VertexData does not have a vtkStringArray named \"\n      << this->IdArrayName);\n    return false;\n    }\n\n  vtkIdType root1 = tree1->GetRoot();\n  vtkIdType root2 = tree2->GetRoot();\n\n  vtkIdType edgeId1 = -1;\n  vtkIdType edgeId2 = -1;\n\n  \/\/ iterate over the vertex names for tree #1, finding the corresponding\n  \/\/ vertex in tree #2.\n  for (vtkIdType vertexItr = 0; vertexItr < nodeNames1->GetNumberOfTuples();\n       ++vertexItr)\n    {\n    vtkIdType vertexId1 = vertexItr;\n    std::string nodeName = nodeNames1->GetValue(vertexId1);\n    if (nodeName.compare(\"\") == 0)\n      {\n      continue;\n      }\n\n    \/\/ record this correspondence in the maps\n    vtkIdType vertexId2 = nodeNames2->LookupValue(nodeName);\n    if (vertexId2 == -1)\n      {\n      vtkWarningMacro(\"tree #2 does not contain a vertex named \" << nodeName);\n      continue;\n      }\n    this->VertexMap[vertexId1] = vertexId2;\n\n    if (vertexId1 == root1 || vertexId2 == root2)\n      {\n      continue;\n      }\n\n    edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1);\n    edgeId2 = tree2->GetEdgeId(tree2->GetParent(vertexId2), vertexId2);\n    this->EdgeMap[edgeId1] = edgeId2;\n\n    \/\/ descend the tree until we reach the root, mapping parent vertices to\n    \/\/ each other along the way.\n    while (tree1->GetParent(vertexId1) != root1 &&\n           tree2->GetParent(vertexId2) != root2)\n      {\n      vertexId1 = tree1->GetParent(vertexId1);\n      vertexId2 = tree2->GetParent(vertexId2);\n      if (this->VertexMap[vertexId1] == -1)\n        {\n        this->VertexMap[vertexId1] = vertexId2;\n        edgeId1 = tree1->GetEdgeId(tree1->GetParent(vertexId1), vertexId1);\n        edgeId2 = tree2->GetEdgeId(tree2->GetParent(vertexId2), vertexId2);\n        this->EdgeMap[edgeId1] = edgeId2;\n        }\n      }\n    }\n\n  return true;\n}\n\n\/\/---------------------------------------------------------------------------\nvoid vtkTreeDifferenceFilter::ComputeDifference(vtkTree *tree1, vtkTree *tree2)\n{\n  if (this->ComparisonArrayName == 0)\n    {\n    vtkErrorMacro(\"ComparisonArrayName has not been set.\");\n    return;\n    }\n\n  vtkDataSetAttributes *treeData1, *treeData2;\n  const char *dataName;\n  if (this->ComparisonArrayIsVertexData)\n    {\n    treeData1 = tree1->GetVertexData();\n    treeData2 = tree2->GetVertexData();\n    dataName = \"VertexData\";\n    }\n  else\n    {\n    treeData1 = tree1->GetEdgeData();\n    treeData2 = tree2->GetEdgeData();\n    dataName = \"EdgeData\";\n    }\n\n  vtkDoubleArray *arrayToCompare1 = vtkDoubleArray::SafeDownCast(\n    treeData1->GetAbstractArray(this->ComparisonArrayName));\n  if (arrayToCompare1 == NULL)\n    {\n    vtkErrorMacro(\"tree #1's \" << dataName <<\n      \" does not have a vtkDoubleArray named \" << this->IdArrayName);\n    return;\n    }\n\n  vtkDoubleArray *arrayToCompare2 = vtkDoubleArray::SafeDownCast(\n    treeData2->GetAbstractArray(this->ComparisonArrayName));\n  if (arrayToCompare2 == NULL)\n    {\n    vtkErrorMacro(\"tree #2's \" << dataName <<\n      \" does not have a vtkDoubleArray named \" << this->IdArrayName);\n    return;\n    }\n\n  vtkNew<vtkDoubleArray> resultArray;\n  resultArray->SetNumberOfValues(arrayToCompare1->GetNumberOfTuples());\n  resultArray->FillComponent(0, vtkMath::Nan());\n\n  if (this->OutputArrayName == 0)\n    {\n    resultArray->SetName(\"difference\");\n    }\n  else\n    {\n    resultArray->SetName(this->OutputArrayName);\n    }\n\n  vtkIdType treeId2;\n  for (vtkIdType treeId1 = 0; treeId1 < arrayToCompare1->GetNumberOfTuples();\n       ++treeId1)\n    {\n    if (this->ComparisonArrayIsVertexData)\n      {\n      treeId2 = this->VertexMap[treeId1];\n      }\n    else\n      {\n      treeId2 = this->EdgeMap[treeId1];\n      }\n    double result =\n      arrayToCompare1->GetValue(treeId1) - arrayToCompare2->GetValue(treeId2);\n    resultArray->SetValue(treeId1, result);\n    }\n\n  treeData1->AddArray(resultArray.GetPointer());\n}\n\n\/\/---------------------------------------------------------------------------\nvoid vtkTreeDifferenceFilter::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sys\/types.h>\n#include <sys\/epoll.h>\n#include <sys\/errno.h>\n#include <sys\/time.h>\n#include <unistd.h>\n\n#include <common\/buffer.h>\n\n#include <event\/event_callback.h>\n#include <event\/event_poll.h>\n\n#define\tEPOLL_EVENT_COUNT\t128\n\nstruct EventPollState {\n\tint ep_;\n};\n\nEventPoll::EventPoll(void)\n: log_(\"\/event\/poll\"),\n  read_poll_(),\n  write_poll_(),\n  state_(new EventPollState())\n{\n\tstate_->ep_ = epoll_create(EPOLL_EVENT_COUNT);\n\tASSERT(state_->ep_ != -1);\n}\n\nEventPoll::~EventPoll()\n{\n\tASSERT(read_poll_.empty());\n\tASSERT(write_poll_.empty());\n\n\tif (state_ != NULL) {\n\t\tif (state_->ep_ != -1) {\n\t\t\tclose(state_->ep_);\n\t\t\tstate_->ep_ = -1;\n\t\t}\n\t\tdelete state_;\n\t\tstate_ = NULL;\n\t}\n}\n\nAction *\nEventPoll::poll(const Type& type, int fd, EventCallback *cb)\n{\n\tASSERT(fd != -1);\n\n\tEventPoll::PollHandler *poll_handler;\n\tstruct epoll_event eev;\n\tbool unique = true;\n\teev.data.fd = fd;\n\tswitch (type) {\n\tcase EventPoll::Readable:\n\t\tASSERT(read_poll_.find(fd) == read_poll_.end());\n\t\tunique = write_poll_.find(fd) == write_poll_.end();\n\t\tpoll_handler = &read_poll_[fd];\n\t\teev.events = EPOLLIN | (unique ? 0 : EPOLLOUT);\n\t\tbreak;\n\tcase EventPoll::Writable:\n\t\tASSERT(write_poll_.find(fd) == write_poll_.end());\n\t\tunique = read_poll_.find(fd) == read_poll_.end();\n\t\tpoll_handler = &write_poll_[fd];\n\t\teev.events = EPOLLOUT | (unique ? 0 : EPOLLIN);\n\t\tbreak;\n\tdefault:\n\t\tNOTREACHED();\n\t}\n\tint rv = ::epoll_ctl(state_->ep_, unique ? EPOLL_CTL_ADD : EPOLL_CTL_MOD, fd, &eev);\n\tif (rv == -1)\n\t\tHALT(log_) << \"Could not add event to epoll.\";\n\tASSERT(rv == 0);\n\tASSERT(poll_handler->action_ == NULL);\n\tpoll_handler->callback_ = cb;\n\tAction *a = new EventPoll::PollAction(this, type, fd);\n\treturn (a);\n}\n\nvoid\nEventPoll::cancel(const Type& type, int fd)\n{\n\tEventPoll::PollHandler *poll_handler;\n\n\tstruct epoll_event eev;\n\tbool unique = true;\n\teev.data.fd = fd;\n\tswitch (type) {\n\tcase EventPoll::Readable:\n\t\tASSERT(read_poll_.find(fd) != read_poll_.end());\n\t\tunique = write_poll_.find(fd) == write_poll_.end();\n\t\tpoll_handler = &read_poll_[fd];\n\t\tpoll_handler->cancel();\n\t\tread_poll_.erase(fd);\n\t\teev.events = unique ? 0 : EPOLLOUT;\n\t\tbreak;\n\tcase EventPoll::Writable:\n\t\tASSERT(write_poll_.find(fd) != write_poll_.end());\n\t\tunique = read_poll_.find(fd) == read_poll_.end();\n\t\tpoll_handler = &write_poll_[fd];\n\t\tpoll_handler->cancel();\n\t\twrite_poll_.erase(fd);\n\t\teev.events = unique ? 0 : EPOLLIN;\n\t\tbreak;\n\t}\n\tint rv = ::epoll_ctl(state_->ep_, unique ? EPOLL_CTL_DEL : EPOLL_CTL_MOD, fd, &eev);\n\tif (rv == -1)\n\t\tHALT(log_) << \"Could not delete event from epoll.\";\n\tASSERT(rv == 0);\n}\n\nvoid\nEventPoll::wait(int ms)\n{\n\tstruct timespec ts;\n\n\tts.tv_sec = ms \/ 1000;\n\tts.tv_nsec = (ms % 1000) * 1000000;\n\n\tif (idle()) {\n\t\tif (ms != -1) {\n\t\t\tint rv;\n\n\t\t\trv = nanosleep(&ts, NULL);\n\t\t\tASSERT(rv != -1);\n\t\t}\n\t\treturn;\n\t}\n\n\tstruct epoll_event eev[EPOLL_EVENT_COUNT];\n\tint evcnt = ::epoll_wait(state_->ep_, eev, EPOLL_EVENT_COUNT, ms);\n\tif (evcnt == -1) {\n\t\tif (errno == EINTR) {\n\t\t\tINFO(log_) << \"Received interrupt, ceasing polling until stop handlers have run.\";\n\t\t\treturn;\n\t\t}\n\t\tHALT(log_) << \"Could not poll epoll.\";\n\t}\n\n\tint i;\n\tfor (i = 0; i < evcnt; i++) {\n\t\tstruct epoll_event *ev = &eev[i];\n\t\tEventPoll::PollHandler *poll_handler;\n\t\tif ((ev->events & EPOLLIN) != 0) {\n\t\t\tASSERT(read_poll_.find(ev->data.fd) != read_poll_.end());\n\t\t\tpoll_handler = &read_poll_[ev->data.fd];\n\t\t\tpoll_handler->callback(Event::Done);\n\t\t}\n\n\t\tif ((ev->events & EPOLLOUT) != 0) {\n\t\t\tASSERT(write_poll_.find(ev->data.fd) != write_poll_.end());\n\t\t\tpoll_handler = &write_poll_[ev->data.fd];\n\t\t\tpoll_handler->callback(Event::Done);\n\t\t}\n\n\t\tif ((ev->events & EPOLLIN) == 0 && (ev->events & EPOLLOUT) == 0) {\n\t\t\tif (read_poll_.find(ev->data.fd) != read_poll_.end()) {\n\t\t\t\tpoll_handler = &read_poll_[ev->data.fd];\n\t\t\t} else if (write_poll_.find(ev->data.fd) != write_poll_.end()) {\n\t\t\t\tpoll_handler = &write_poll_[ev->data.fd];\n\t\t\t} else {\n\t\t\t\tHALT(log_) << \"Unexpected poll fd.\";\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((ev->events & EPOLLERR) != 0) {\n\t\t\t\tpoll_handler->callback(Event::Error);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((ev->events & EPOLLHUP) != 0) {\n\t\t\t\tpoll_handler->callback(Event::EOS);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tHALT(log_) << \"Unexpected poll events: \" << ev->events;\n\t\t}\n\t}\n}\n<commit_msg>Ignore hangup on write polls.<commit_after>#include <sys\/types.h>\n#include <sys\/epoll.h>\n#include <sys\/errno.h>\n#include <sys\/time.h>\n#include <unistd.h>\n\n#include <common\/buffer.h>\n\n#include <event\/event_callback.h>\n#include <event\/event_poll.h>\n\n#define\tEPOLL_EVENT_COUNT\t128\n\nstruct EventPollState {\n\tint ep_;\n};\n\nEventPoll::EventPoll(void)\n: log_(\"\/event\/poll\"),\n  read_poll_(),\n  write_poll_(),\n  state_(new EventPollState())\n{\n\tstate_->ep_ = epoll_create(EPOLL_EVENT_COUNT);\n\tASSERT(state_->ep_ != -1);\n}\n\nEventPoll::~EventPoll()\n{\n\tASSERT(read_poll_.empty());\n\tASSERT(write_poll_.empty());\n\n\tif (state_ != NULL) {\n\t\tif (state_->ep_ != -1) {\n\t\t\tclose(state_->ep_);\n\t\t\tstate_->ep_ = -1;\n\t\t}\n\t\tdelete state_;\n\t\tstate_ = NULL;\n\t}\n}\n\nAction *\nEventPoll::poll(const Type& type, int fd, EventCallback *cb)\n{\n\tASSERT(fd != -1);\n\n\tEventPoll::PollHandler *poll_handler;\n\tstruct epoll_event eev;\n\tbool unique = true;\n\teev.data.fd = fd;\n\tswitch (type) {\n\tcase EventPoll::Readable:\n\t\tASSERT(read_poll_.find(fd) == read_poll_.end());\n\t\tunique = write_poll_.find(fd) == write_poll_.end();\n\t\tpoll_handler = &read_poll_[fd];\n\t\teev.events = EPOLLIN | (unique ? 0 : EPOLLOUT);\n\t\tbreak;\n\tcase EventPoll::Writable:\n\t\tASSERT(write_poll_.find(fd) == write_poll_.end());\n\t\tunique = read_poll_.find(fd) == read_poll_.end();\n\t\tpoll_handler = &write_poll_[fd];\n\t\teev.events = EPOLLOUT | (unique ? 0 : EPOLLIN);\n\t\tbreak;\n\tdefault:\n\t\tNOTREACHED();\n\t}\n\tint rv = ::epoll_ctl(state_->ep_, unique ? EPOLL_CTL_ADD : EPOLL_CTL_MOD, fd, &eev);\n\tif (rv == -1)\n\t\tHALT(log_) << \"Could not add event to epoll.\";\n\tASSERT(rv == 0);\n\tASSERT(poll_handler->action_ == NULL);\n\tpoll_handler->callback_ = cb;\n\tAction *a = new EventPoll::PollAction(this, type, fd);\n\treturn (a);\n}\n\nvoid\nEventPoll::cancel(const Type& type, int fd)\n{\n\tEventPoll::PollHandler *poll_handler;\n\n\tstruct epoll_event eev;\n\tbool unique = true;\n\teev.data.fd = fd;\n\tswitch (type) {\n\tcase EventPoll::Readable:\n\t\tASSERT(read_poll_.find(fd) != read_poll_.end());\n\t\tunique = write_poll_.find(fd) == write_poll_.end();\n\t\tpoll_handler = &read_poll_[fd];\n\t\tpoll_handler->cancel();\n\t\tread_poll_.erase(fd);\n\t\teev.events = unique ? 0 : EPOLLOUT;\n\t\tbreak;\n\tcase EventPoll::Writable:\n\t\tASSERT(write_poll_.find(fd) != write_poll_.end());\n\t\tunique = read_poll_.find(fd) == read_poll_.end();\n\t\tpoll_handler = &write_poll_[fd];\n\t\tpoll_handler->cancel();\n\t\twrite_poll_.erase(fd);\n\t\teev.events = unique ? 0 : EPOLLIN;\n\t\tbreak;\n\t}\n\tint rv = ::epoll_ctl(state_->ep_, unique ? EPOLL_CTL_DEL : EPOLL_CTL_MOD, fd, &eev);\n\tif (rv == -1)\n\t\tHALT(log_) << \"Could not delete event from epoll.\";\n\tASSERT(rv == 0);\n}\n\nvoid\nEventPoll::wait(int ms)\n{\n\tstruct timespec ts;\n\n\tts.tv_sec = ms \/ 1000;\n\tts.tv_nsec = (ms % 1000) * 1000000;\n\n\tif (idle()) {\n\t\tif (ms != -1) {\n\t\t\tint rv;\n\n\t\t\trv = nanosleep(&ts, NULL);\n\t\t\tASSERT(rv != -1);\n\t\t}\n\t\treturn;\n\t}\n\n\tstruct epoll_event eev[EPOLL_EVENT_COUNT];\n\tint evcnt = ::epoll_wait(state_->ep_, eev, EPOLL_EVENT_COUNT, ms);\n\tif (evcnt == -1) {\n\t\tif (errno == EINTR) {\n\t\t\tINFO(log_) << \"Received interrupt, ceasing polling until stop handlers have run.\";\n\t\t\treturn;\n\t\t}\n\t\tHALT(log_) << \"Could not poll epoll.\";\n\t}\n\n\tint i;\n\tfor (i = 0; i < evcnt; i++) {\n\t\tstruct epoll_event *ev = &eev[i];\n\t\tEventPoll::PollHandler *poll_handler;\n\t\tif ((ev->events & EPOLLIN) != 0) {\n\t\t\tASSERT(read_poll_.find(ev->data.fd) != read_poll_.end());\n\t\t\tpoll_handler = &read_poll_[ev->data.fd];\n\t\t\tpoll_handler->callback(Event::Done);\n\t\t}\n\n\t\tif ((ev->events & EPOLLOUT) != 0) {\n\t\t\tASSERT(write_poll_.find(ev->data.fd) != write_poll_.end());\n\t\t\tpoll_handler = &write_poll_[ev->data.fd];\n\t\t\tpoll_handler->callback(Event::Done);\n\t\t}\n\n\t\tif ((ev->events & EPOLLIN) == 0 && (ev->events & EPOLLOUT) == 0) {\n\t\t\tif (read_poll_.find(ev->data.fd) != read_poll_.end()) {\n\t\t\t\tpoll_handler = &read_poll_[ev->data.fd];\n\t\t\t} else if (write_poll_.find(ev->data.fd) != write_poll_.end()) {\n\t\t\t\tpoll_handler = &write_poll_[ev->data.fd];\n\n\t\t\t\tif ((ev->events & (EPOLLERR | EPOLLHUP)) == EPOLLHUP) {\n\t\t\t\t\tDEBUG(log_) << \"Got EPOLLHUP on write poll.\";\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tHALT(log_) << \"Unexpected poll fd.\";\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((ev->events & EPOLLERR) != 0) {\n\t\t\t\tpoll_handler->callback(Event::Error);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((ev->events & EPOLLHUP) != 0) {\n\t\t\t\tpoll_handler->callback(Event::EOS);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tHALT(log_) << \"Unexpected poll events: \" << ev->events;\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===========================================\n\/\/  Lumina-DE source code\n\/\/  Copyright (c) 2016, Ken Moore\n\/\/  Available under the 3-clause BSD license\n\/\/  See the LICENSE file for full details\n\/\/===========================================\n#include \"session.h\"\n\n#include <QObject>\n#include <QProcess>\n#include <QProcessEnvironment>\n#include <QDebug>\n#include <QSettings>\n#include <QDir>\n\n#include <LUtils.h>\n#include <LuminaOS.h>\n#include <LDesktopUtils.h>\n\nvoid LSession::stopall(){\n  stopping = true;\n  for(int i=0; i<PROCS.length(); i++){\n    if(PROCS[i]->state()!=QProcess::NotRunning){ PROCS[i]->kill(); }\n  }\n  QCoreApplication::processEvents();\n  for(int i=0; i<PROCS.length(); i++){\n    if(PROCS[i]->state()!=QProcess::NotRunning){ PROCS[i]->terminate(); }\n  }\n  QCoreApplication::exit(0);\n}\n\nvoid LSession::procFinished(){\n  \/\/Go through and check the status on all the procs to determine which one finished\n  int stopped = 0;\n  \/\/qDebug() << \"Got Process Stopped Signal:\";\n  for(int i=0; i<PROCS.length(); i++){\n    if(PROCS[i]->state()==QProcess::NotRunning){\n      \/\/qDebug() << \" - Stopped:\" << PROCS[i]->objectName();\n      stopped++;\n      if(!stopping){\n        \/\/See if this process is the main desktop binary\n        if(PROCS[i]->objectName()==\"runtime\"){\n          qDebug() << \"Got Desktop Process Finished:\" << PROCS[i]->exitCode();\n          \/\/if(PROCS[i]->exitCode()==787){ PROCS[i]->start(QIODevice::ReadOnly); } \/\/special internal restart code\n          \/\/else{\n          stopall(); \/\/}\n        }else if(PROCS[i]->objectName()==\"wm\" && wmfails<2){ wmfails++; PROCS[i]->start(QIODevice::ReadOnly); wmTimer->start(); } \/\/restart the WM\n        \/\/if(PROCS[i]->program().section(\"\/\",-1) == \"lumina-desktop\"){ stopall();  } \/\/start closing down everything\n        \/\/else{ PROCS[i]->start(QIODevice::ReadOnly); } \/\/restart the process\n        \/\/break;\n      }\n    }\n  }\n  \/\/qDebug() << \" - Final Count:\" << stopped << stopping;\n  if(stopping || stopped==PROCS.length()){\n    \/\/Note about compton: It does not like running multiple sessions under the *same user*\n    \/\/ (even on different displays). Run a blanket killall on it when closing down so that\n    \/\/ any other Lumina sessions will automatically restart compton on that specific display\n    QProcess::execute(\"killall compton\");\n    QCoreApplication::exit(0);\n  }else{\n    \/\/Make sure we restart the process as needed\n    for(int i=0; i<PROCS.length(); i++){\n      if(PROCS[i]->state()==QProcess::NotRunning){\n        \/\/runtime\/wm processes have special restart rules above\n        if(PROCS[i]->objectName()!=\"runtime\" && PROCS[i]->objectName()!=\"wm\"){\n          PROCS[i]->start(QIODevice::ReadOnly);\n        }\n      }\n    }\n  }\n}\n\nvoid LSession::startProcess(QString ID, QString command, QStringList watchfiles){\n  QString dir = QString(getenv(\"XDG_CONFIG_HOME\"))+\"\/lumina-desktop\/logs\";\n  QString display = QString(getenv(\"DISPLAY\")).section(\":\",1,1);\n  if(!QFile::exists(dir)){ QDir tmp(dir); tmp.mkpath(dir); }\n  QString logfile = dir+\"\/\"+ID+\"_\"+display+\".log\";\n  if(QFile::exists(logfile+\".old\")){ QFile::remove(logfile+\".old\"); }\n  if(QFile::exists(logfile)){ QFile::rename(logfile,logfile+\".old\"); }\n\n  LProcess *proc = new LProcess(ID, watchfiles);\n  proc->setProcessChannelMode(QProcess::MergedChannels);\n  proc->setProcessEnvironment( QProcessEnvironment::systemEnvironment() );\n  proc->setStandardOutputFile(logfile);\n  proc->setObjectName(ID);\n  if(ID==\"runtime\"){\n    \/\/Bypass for a hidden dbus file requirement for Qt itself (Qt 5.5.1+?)\n    if(!QFile::exists(\"\/etc\/machine-id\") && !QFile::exists(\"\/var\/db\/dbus\/machine-id\")){\n      if(LUtils::isValidBinary(\"dbus-uuidgen\") && LUtils::runCmd(\"dbus-uuidgen --ensure\") ){ } \/\/good - the UUID was created successfully\n      else if(LUtils::isValidBinary(\"dbus-launch\")){ command.prepend(\"dbus-launch --exit-with-session \"); }\n      else{\n        \/\/create a simple DBUS UUID and put it in the universal-fallback location (OS-independent)\n        \/\/ TO-DO - root vs user level permissions issue?\n        qDebug() << \"Could not find '\/etc\/machine-id' or '\/var\/db\/dbus\/machine-id': Qt will most likely crash. \\nPlease run 'dbus-uuidgen --ensure' with root permissions to generate this file if Lumina does not start properly.\";\n      }\n   }\n  }\n  proc->start(command, QIODevice::ReadOnly);\n  connect(proc, SIGNAL(finished(int, QProcess::ExitStatus)), this, SLOT(procFinished()) );\n  PROCS << proc;\n}\n\nvoid LSession::setupCompositor(bool force){\n  \/\/Compositing manager\n  QSettings settings(\"lumina-desktop\",\"sessionsettings\");\n  if(settings.value(\"enableCompositing\",false).toBool() || force){\n    if(LUtils::isValidBinary(\"compton\")){\n      \/\/Compton available - check the config file\n      QString set = QString(getenv(\"XDG_CONFIG_HOME\"))+\"\/lumina-desktop\/compton.conf\";\n      if(!QFile::exists(set)){\n\t  if(QFile::exists(LOS::LuminaShare()+\"\/compton.conf\")){\n\t    QFile::copy(LOS::LuminaShare()+\"\/compton.conf\", set);\n\t  }\n      }\n\t\/\/Auto-detect if GLX is available on the system and turn it on\/off as needed\n       bool startcompton = true;\n       if(LUtils::isValidBinary(\"glxinfo\")){\n\t bool hasAccel =! LUtils::getCmdOutput(\"glxinfo -B\").filter(\"direct rendering:\").filter(\"Yes\").isEmpty();\n\t qDebug() << \"Detected GPU Acceleration:\" << hasAccel;\n\t QStringList info = LUtils::readFile(set);\n\t for(int i=0; i<info.length(); i++){\n\t   if(info[i].section(\"=\",0,0).simplified()==\"backend\"){ info[i] = QString(\"backend = \\\"\")+ (hasAccel ? \"glx\" : \"xrender\")+\"\\\"\"; break; } \/\/replace this line\n\t }\n\t LUtils::writeFile(set, info, true);\n\t if( !hasAccel && settings.value(\"compositingWithGpuAccelOnly\",true).toBool() ){ startcompton = false; }\n       }\n       QString disp = getenv(\"DISPLAY\");\n\tif(startcompton || force){ startProcess(\"compositing\",\"compton --backend xr_glx_hybrid -d \"+disp); }\n    }else if(LUtils::isValidBinary(\"xcompmgr\") && !settings.value(\"compositingWithGpuAccelOnly\",true).toBool() ){ startProcess(\"compositing\",\"xcompmgr\"); }\n  }\n}\n\nvoid LSession::start(bool unified){\n  \/\/First check for a valid installation\n  if(!LUtils::isValidBinary(\"lumina-desktop\") ){\n    exit(1);\n  }\n  setenv(\"DESKTOP_SESSION\",\"Lumina\",1);\n  setenv(\"XDG_CURRENT_DESKTOP\",\"Lumina\",1);\n  setenv(\"QT_QPA_PLATFORMTHEME\",\"lthemeengine\", true);\n  setenv(\"QT_NO_GLIB\", \"1\", 1); \/\/Disable the glib event loop within Qt at runtime (performance hit + bugs)\n  unsetenv(\"QT_AUTO_SCREEN_SCALE_FACTOR\"); \/\/need exact-pixel measurements (no fake scaling)\n  if(LUtils::isValidBinary(\"xdg-user-dirs-update\")){\n    \/\/Make sure the XDG user directories are created as needed first\n    QProcess::execute(\"xdg-user-dirs-update\");\n  }\n\n if(!unified){\n  QSettings sessionsettings(\"lumina-desktop\",\"sessionsettings\");\n  QString WM = sessionsettings.value(\"WindowManager\", \"fluxbox\").toString();\n  \/\/Window Manager First\n  if(WM==\"fluxbox\" || WM.endsWith(\"\/fluxbox\") || WM.simplified().isEmpty() ){\n\t  \/\/ FLUXBOX BUG BYPASS: if the ~\/.fluxbox dir does not exist, it will ignore the given config file\n\t  if( !LUtils::isValidBinary(\"fluxbox\") ){\n\t    qDebug() << \"[INCOMPLETE LUMINA INSTALLATION] fluxbox binary is missing - cannot continue\";\n\t  }else{\n\t    QString confDir = QString( getenv(\"XDG_CONFIG_HOME\"))+\"\/lumina-desktop\";\n\t    if(!QFile::exists(confDir)){ QDir dir(confDir); dir.mkpath(confDir); }\n\t    if(!QFile::exists(confDir+\"\/fluxbox-init\")){\n\t      QStringList keys = LUtils::readFile(LOS::LuminaShare()+\"\/fluxbox-init-rc\");\n\t       keys = keys.replaceInStrings(\"${XDG_CONFIG_HOME}\", QString( getenv(\"XDG_CONFIG_HOME\")));\n\t       LUtils::writeFile(confDir+\"\/fluxbox-init\", keys, true);\n\t      QFile::setPermissions(confDir+\"\/fluxbox-init\", QFile::ReadOwner | QFile::WriteOwner | QFile::ReadUser | QFile::ReadOther | QFile::ReadGroup);\n\t    }\n\t    if(!QFile::exists(confDir+\"\/fluxbox-keys\")){\n\t      QStringList keys = LUtils::readFile(LOS::LuminaShare()+\"\/fluxbox-keys\");\n\t       keys = keys.replaceInStrings(\"${XDG_CONFIG_HOME}\", QString( getenv(\"XDG_CONFIG_HOME\")));\n\t       LUtils::writeFile(confDir+\"\/fluxbox-keys\", keys, true);\n\t      QFile::setPermissions(confDir+\"\/fluxbox-keys\", QFile::ReadOwner | QFile::WriteOwner | QFile::ReadUser | QFile::ReadOther | QFile::ReadGroup);\n\t    }\n\t    \/\/ FLUXBOX BUG BYPASS: if the ~\/.fluxbox dir does not exist, it will ignore the given config file\n\t    if(!QFile::exists(QDir::homePath()+\"\/.fluxbox\")){\n\t      QDir dir; dir.mkpath(QDir::homePath()+\"\/.fluxbox\");\n\t    }\n\t    QString cmd = \"fluxbox -rc \"+confDir+\"\/fluxbox-init -no-slit -no-toolbar\";\n\t    startProcess(\"wm\", cmd, QStringList() << confDir+\"\/fluxbox-init\" << confDir+\"\/fluxbox-keys\");\n\t  }\n\t  \/\/Compositing manager\n\t  setupCompositor();\n  } else {\n\tif(!LUtils::isValidBinary(WM)){\n\t  exit(1);\n\t}\n\tstartProcess(\"wm\", WM);\n  }\n  \/\/Desktop Next\n  startProcess(\"runtime\",\"lumina-desktop -new-instance\");\n  \/\/ScreenSaver\n  if(LUtils::isValidBinary(\"xscreensaver\")){ startProcess(\"screensaver\",\"xscreensaver -no-splash\"); }\n }else{\n  \/\/unified process\n  setupCompositor(true); \/\/required for Lumina 2\n  startProcess(\"runtime\",\"lumina-desktop-unified -new-instance\");\n }\n}\n\nvoid LSession::checkFiles(){\n\/\/internal version conversion examples:\n  \/\/  [1.0.0 -> 1000000], [1.2.3 -> 1002003], [0.6.1 -> 6001]\n  qDebug() << \"[Lumina] Checking User Files\";\n  QSettings sset(\"lumina-desktop\", \"sessionsettings\");\n  QString OVS = sset.value(\"DesktopVersion\",\"0\").toString(); \/\/Old Version String\n  qDebug() << \" - Old Version:\" << OVS;\n  qDebug() << \" - Current Version:\" << LDesktopUtils::LuminaDesktopVersion();\n  bool changed = LDesktopUtils::checkUserFiles(OVS, LDesktopUtils::LuminaDesktopVersion());\n  qDebug() << \" - Made Changes:\" << changed;\n  if(changed){\n    \/\/Save the current version of the session to the settings file (for next time)\n    sset.setValue(\"DesktopVersion\", LDesktopUtils::LuminaDesktopVersion());\n  }\n  qDebug() << \"Finished with user files check\";\n}\n<commit_msg>Ensure that the Fluxbox background\/wallpaper setter is disabled before Lumina starts it up<commit_after>\/\/===========================================\n\/\/  Lumina-DE source code\n\/\/  Copyright (c) 2016, Ken Moore\n\/\/  Available under the 3-clause BSD license\n\/\/  See the LICENSE file for full details\n\/\/===========================================\n#include \"session.h\"\n\n#include <QObject>\n#include <QProcess>\n#include <QProcessEnvironment>\n#include <QDebug>\n#include <QSettings>\n#include <QDir>\n\n#include <LUtils.h>\n#include <LuminaOS.h>\n#include <LDesktopUtils.h>\n\nvoid LSession::stopall(){\n  stopping = true;\n  for(int i=0; i<PROCS.length(); i++){\n    if(PROCS[i]->state()!=QProcess::NotRunning){ PROCS[i]->kill(); }\n  }\n  QCoreApplication::processEvents();\n  for(int i=0; i<PROCS.length(); i++){\n    if(PROCS[i]->state()!=QProcess::NotRunning){ PROCS[i]->terminate(); }\n  }\n  QCoreApplication::exit(0);\n}\n\nvoid LSession::procFinished(){\n  \/\/Go through and check the status on all the procs to determine which one finished\n  int stopped = 0;\n  \/\/qDebug() << \"Got Process Stopped Signal:\";\n  for(int i=0; i<PROCS.length(); i++){\n    if(PROCS[i]->state()==QProcess::NotRunning){\n      \/\/qDebug() << \" - Stopped:\" << PROCS[i]->objectName();\n      stopped++;\n      if(!stopping){\n        \/\/See if this process is the main desktop binary\n        if(PROCS[i]->objectName()==\"runtime\"){\n          qDebug() << \"Got Desktop Process Finished:\" << PROCS[i]->exitCode();\n          \/\/if(PROCS[i]->exitCode()==787){ PROCS[i]->start(QIODevice::ReadOnly); } \/\/special internal restart code\n          \/\/else{\n          stopall(); \/\/}\n        }else if(PROCS[i]->objectName()==\"wm\" && wmfails<2){ wmfails++; PROCS[i]->start(QIODevice::ReadOnly); wmTimer->start(); } \/\/restart the WM\n        \/\/if(PROCS[i]->program().section(\"\/\",-1) == \"lumina-desktop\"){ stopall();  } \/\/start closing down everything\n        \/\/else{ PROCS[i]->start(QIODevice::ReadOnly); } \/\/restart the process\n        \/\/break;\n      }\n    }\n  }\n  \/\/qDebug() << \" - Final Count:\" << stopped << stopping;\n  if(stopping || stopped==PROCS.length()){\n    \/\/Note about compton: It does not like running multiple sessions under the *same user*\n    \/\/ (even on different displays). Run a blanket killall on it when closing down so that\n    \/\/ any other Lumina sessions will automatically restart compton on that specific display\n    QProcess::execute(\"killall compton\");\n    QCoreApplication::exit(0);\n  }else{\n    \/\/Make sure we restart the process as needed\n    for(int i=0; i<PROCS.length(); i++){\n      if(PROCS[i]->state()==QProcess::NotRunning){\n        \/\/runtime\/wm processes have special restart rules above\n        if(PROCS[i]->objectName()!=\"runtime\" && PROCS[i]->objectName()!=\"wm\"){\n          PROCS[i]->start(QIODevice::ReadOnly);\n        }\n      }\n    }\n  }\n}\n\nvoid LSession::startProcess(QString ID, QString command, QStringList watchfiles){\n  QString dir = QString(getenv(\"XDG_CONFIG_HOME\"))+\"\/lumina-desktop\/logs\";\n  QString display = QString(getenv(\"DISPLAY\")).section(\":\",1,1);\n  if(!QFile::exists(dir)){ QDir tmp(dir); tmp.mkpath(dir); }\n  QString logfile = dir+\"\/\"+ID+\"_\"+display+\".log\";\n  if(QFile::exists(logfile+\".old\")){ QFile::remove(logfile+\".old\"); }\n  if(QFile::exists(logfile)){ QFile::rename(logfile,logfile+\".old\"); }\n\n  LProcess *proc = new LProcess(ID, watchfiles);\n  proc->setProcessChannelMode(QProcess::MergedChannels);\n  proc->setProcessEnvironment( QProcessEnvironment::systemEnvironment() );\n  proc->setStandardOutputFile(logfile);\n  proc->setObjectName(ID);\n  if(ID==\"runtime\"){\n    \/\/Bypass for a hidden dbus file requirement for Qt itself (Qt 5.5.1+?)\n    if(!QFile::exists(\"\/etc\/machine-id\") && !QFile::exists(\"\/var\/db\/dbus\/machine-id\")){\n      if(LUtils::isValidBinary(\"dbus-uuidgen\") && LUtils::runCmd(\"dbus-uuidgen --ensure\") ){ } \/\/good - the UUID was created successfully\n      else if(LUtils::isValidBinary(\"dbus-launch\")){ command.prepend(\"dbus-launch --exit-with-session \"); }\n      else{\n        \/\/create a simple DBUS UUID and put it in the universal-fallback location (OS-independent)\n        \/\/ TO-DO - root vs user level permissions issue?\n        qDebug() << \"Could not find '\/etc\/machine-id' or '\/var\/db\/dbus\/machine-id': Qt will most likely crash. \\nPlease run 'dbus-uuidgen --ensure' with root permissions to generate this file if Lumina does not start properly.\";\n      }\n   }\n  }\n  proc->start(command, QIODevice::ReadOnly);\n  connect(proc, SIGNAL(finished(int, QProcess::ExitStatus)), this, SLOT(procFinished()) );\n  PROCS << proc;\n}\n\nvoid LSession::setupCompositor(bool force){\n  \/\/Compositing manager\n  QSettings settings(\"lumina-desktop\",\"sessionsettings\");\n  if(settings.value(\"enableCompositing\",false).toBool() || force){\n    if(LUtils::isValidBinary(\"compton\")){\n      \/\/Compton available - check the config file\n      QString set = QString(getenv(\"XDG_CONFIG_HOME\"))+\"\/lumina-desktop\/compton.conf\";\n      if(!QFile::exists(set)){\n\t  if(QFile::exists(LOS::LuminaShare()+\"\/compton.conf\")){\n\t    QFile::copy(LOS::LuminaShare()+\"\/compton.conf\", set);\n\t  }\n      }\n\t\/\/Auto-detect if GLX is available on the system and turn it on\/off as needed\n       bool startcompton = true;\n       if(LUtils::isValidBinary(\"glxinfo\")){\n\t bool hasAccel =! LUtils::getCmdOutput(\"glxinfo -B\").filter(\"direct rendering:\").filter(\"Yes\").isEmpty();\n\t qDebug() << \"Detected GPU Acceleration:\" << hasAccel;\n\t QStringList info = LUtils::readFile(set);\n\t for(int i=0; i<info.length(); i++){\n\t   if(info[i].section(\"=\",0,0).simplified()==\"backend\"){ info[i] = QString(\"backend = \\\"\")+ (hasAccel ? \"glx\" : \"xrender\")+\"\\\"\"; break; } \/\/replace this line\n\t }\n\t LUtils::writeFile(set, info, true);\n\t if( !hasAccel && settings.value(\"compositingWithGpuAccelOnly\",true).toBool() ){ startcompton = false; }\n       }\n       QString disp = getenv(\"DISPLAY\");\n\tif(startcompton || force){ startProcess(\"compositing\",\"compton --backend xr_glx_hybrid -d \"+disp); }\n    }else if(LUtils::isValidBinary(\"xcompmgr\") && !settings.value(\"compositingWithGpuAccelOnly\",true).toBool() ){ startProcess(\"compositing\",\"xcompmgr\"); }\n  }\n}\n\nvoid LSession::start(bool unified){\n  \/\/First check for a valid installation\n  if(!LUtils::isValidBinary(\"lumina-desktop\") ){\n    exit(1);\n  }\n  setenv(\"DESKTOP_SESSION\",\"Lumina\",1);\n  setenv(\"XDG_CURRENT_DESKTOP\",\"Lumina\",1);\n  setenv(\"QT_QPA_PLATFORMTHEME\",\"lthemeengine\", true);\n  setenv(\"QT_NO_GLIB\", \"1\", 1); \/\/Disable the glib event loop within Qt at runtime (performance hit + bugs)\n  unsetenv(\"QT_AUTO_SCREEN_SCALE_FACTOR\"); \/\/need exact-pixel measurements (no fake scaling)\n  if(LUtils::isValidBinary(\"xdg-user-dirs-update\")){\n    \/\/Make sure the XDG user directories are created as needed first\n    QProcess::execute(\"xdg-user-dirs-update\");\n  }\n\n if(!unified){\n  QSettings sessionsettings(\"lumina-desktop\",\"sessionsettings\");\n  QString WM = sessionsettings.value(\"WindowManager\", \"fluxbox\").toString();\n  \/\/Window Manager First\n  if(WM==\"fluxbox\" || WM.endsWith(\"\/fluxbox\") || WM.simplified().isEmpty() ){\n\t  \/\/ FLUXBOX BUG BYPASS: if the ~\/.fluxbox dir does not exist, it will ignore the given config file\n\t  if( !LUtils::isValidBinary(\"fluxbox\") ){\n\t    qDebug() << \"[INCOMPLETE LUMINA INSTALLATION] fluxbox binary is missing - cannot continue\";\n\t  }else{\n\t    QString confDir = QString( getenv(\"XDG_CONFIG_HOME\"))+\"\/lumina-desktop\";\n\t    if(!QFile::exists(confDir)){ QDir dir(confDir); dir.mkpath(confDir); }\n\t    if(!QFile::exists(confDir+\"\/fluxbox-init\")){\n\t      QStringList keys = LUtils::readFile(LOS::LuminaShare()+\"\/fluxbox-init-rc\");\n\t       keys = keys.replaceInStrings(\"${XDG_CONFIG_HOME}\", QString( getenv(\"XDG_CONFIG_HOME\")));\n\t       LUtils::writeFile(confDir+\"\/fluxbox-init\", keys, true);\n\t      QFile::setPermissions(confDir+\"\/fluxbox-init\", QFile::ReadOwner | QFile::WriteOwner | QFile::ReadUser | QFile::ReadOther | QFile::ReadGroup);\n\t    }\n\t    if(!QFile::exists(confDir+\"\/fluxbox-keys\")){\n\t      QStringList keys = LUtils::readFile(LOS::LuminaShare()+\"\/fluxbox-keys\");\n\t       keys = keys.replaceInStrings(\"${XDG_CONFIG_HOME}\", QString( getenv(\"XDG_CONFIG_HOME\")));\n\t       LUtils::writeFile(confDir+\"\/fluxbox-keys\", keys, true);\n\t      QFile::setPermissions(confDir+\"\/fluxbox-keys\", QFile::ReadOwner | QFile::WriteOwner | QFile::ReadUser | QFile::ReadOther | QFile::ReadGroup);\n\t    }\n            if(!QFile::exists(confDir+\"\/fluxbox-overlay\")){\n              QStringList contents; contents << \"background: unset\";\n              LUtils::writeFile(confDir+\"\/fluxbox-overlay\", contents, true);\n              \/\/Now make sure this overlay file is set within the init file\n              contents = LUtils::readFile(confDir+\"\/fluxbox-init\");\n              contents << \"session.styleOverlay:\t\"+confDir+\"\/fluxbox-overlay\";\n              LUtils::writeFile(confDir+\"\/fluxbox-init\", contents, true);\n            }\n\t    \/\/ FLUXBOX BUG BYPASS: if the ~\/.fluxbox dir does not exist, it will ignore the given config file\n\t    if(!QFile::exists(QDir::homePath()+\"\/.fluxbox\")){\n\t      QDir dir; dir.mkpath(QDir::homePath()+\"\/.fluxbox\");\n\t    }\n\t    QString cmd = \"fluxbox -rc \"+confDir+\"\/fluxbox-init -no-slit -no-toolbar\";\n\t    startProcess(\"wm\", cmd, QStringList() << confDir+\"\/fluxbox-init\" << confDir+\"\/fluxbox-keys\");\n\t  }\n\t  \/\/Compositing manager\n\t  setupCompositor();\n  } else {\n\tif(!LUtils::isValidBinary(WM)){\n\t  exit(1);\n\t}\n\tstartProcess(\"wm\", WM);\n  }\n  \/\/Desktop Next\n  startProcess(\"runtime\",\"lumina-desktop -new-instance\");\n  \/\/ScreenSaver\n  if(LUtils::isValidBinary(\"xscreensaver\")){ startProcess(\"screensaver\",\"xscreensaver -no-splash\"); }\n }else{\n  \/\/unified process\n  setupCompositor(true); \/\/required for Lumina 2\n  startProcess(\"runtime\",\"lumina-desktop-unified -new-instance\");\n }\n}\n\nvoid LSession::checkFiles(){\n\/\/internal version conversion examples:\n  \/\/  [1.0.0 -> 1000000], [1.2.3 -> 1002003], [0.6.1 -> 6001]\n  qDebug() << \"[Lumina] Checking User Files\";\n  QSettings sset(\"lumina-desktop\", \"sessionsettings\");\n  QString OVS = sset.value(\"DesktopVersion\",\"0\").toString(); \/\/Old Version String\n  qDebug() << \" - Old Version:\" << OVS;\n  qDebug() << \" - Current Version:\" << LDesktopUtils::LuminaDesktopVersion();\n  bool changed = LDesktopUtils::checkUserFiles(OVS, LDesktopUtils::LuminaDesktopVersion());\n  qDebug() << \" - Made Changes:\" << changed;\n  if(changed){\n    \/\/Save the current version of the session to the settings file (for next time)\n    sset.setValue(\"DesktopVersion\", LDesktopUtils::LuminaDesktopVersion());\n  }\n  qDebug() << \"Finished with user files check\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: waitsymbol.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: obo $ $Date: 2007-07-17 14:43: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_slideshow.hxx\"\n\n#include <boost\/current_function.hpp>\n#include <canvas\/canvastools.hxx>\n\n#include <comphelper\/anytostring.hxx>\n#include <cppuhelper\/exc_hlp.hxx>\n\n#include <basegfx\/point\/b2dpoint.hxx>\n#include <basegfx\/vector\/b2dvector.hxx>\n\n#include \"waitsymbol.hxx\"\n#include \"eventmultiplexer.hxx\"\n\n#include <algorithm>\n\n\nusing namespace com::sun::star;\n\nnamespace slideshow {\nnamespace internal {\n\nconst sal_Int32 LEFT_BORDER_SPACE  = 10;\nconst sal_Int32 LOWER_BORDER_SPACE = 10;\n\nWaitSymbolSharedPtr WaitSymbol::create( const uno::Reference<rendering::XBitmap>& xBitmap,\n                                        ScreenUpdater&                            rScreenUpdater,\n                                        EventMultiplexer&                         rEventMultiplexer,\n                                        const UnoViewContainer&                   rViewContainer )\n{\n    WaitSymbolSharedPtr pRet(\n        new WaitSymbol( xBitmap,\n                        rScreenUpdater,\n                        rViewContainer ));\n\n    rEventMultiplexer.addViewHandler( pRet );\n\n    return pRet;\n}\n\nWaitSymbol::WaitSymbol( uno::Reference<rendering::XBitmap> const &   xBitmap,\n                        ScreenUpdater&                               rScreenUpdater,\n                        const UnoViewContainer&                      rViewContainer ) :\n    mxBitmap(xBitmap),\n    maViews(),\n    mrScreenUpdater( rScreenUpdater ),\n    mbVisible(false)\n{\n    std::for_each( rViewContainer.begin(),\n                   rViewContainer.end(),\n                   boost::bind( &WaitSymbol::viewAdded,\n                                this,\n                                _1 ));\n}\n\nvoid WaitSymbol::setVisible( const bool bVisible )\n{\n    if( mbVisible != bVisible )\n    {\n        mbVisible = bVisible;\n\n        ViewsVecT::const_iterator       aIter( maViews.begin() );\n        ViewsVecT::const_iterator const aEnd ( maViews.end() );\n        while( aIter != aEnd )\n        {\n            if( aIter->second )\n            {\n                if( bVisible )\n                    aIter->second->show();\n                else\n                    aIter->second->hide();\n            }\n\n            ++aIter;\n        }\n\n        \/\/ sprites changed, need a screen update for this frame.\n        mrScreenUpdater.requestImmediateUpdate();\n    }\n}\n\nbasegfx::B2DPoint WaitSymbol::calcSpritePos(\n    UnoViewSharedPtr const & rView ) const\n{\n    const uno::Reference<rendering::XBitmap> xBitmap( rView->getCanvas()->getUNOCanvas(),\n                                                      uno::UNO_QUERY_THROW );\n    const geometry::IntegerSize2D realSize( xBitmap->getSize() );\n    return basegfx::B2DPoint(\n        std::min<sal_Int32>( realSize.Width, LEFT_BORDER_SPACE ),\n        std::max<sal_Int32>( 0, realSize.Height - mxBitmap->getSize().Height\n                                                - LOWER_BORDER_SPACE ) );\n}\n\nvoid WaitSymbol::viewAdded( const UnoViewSharedPtr& rView )\n{\n    cppcanvas::CustomSpriteSharedPtr sprite;\n\n    try\n    {\n        const geometry::IntegerSize2D spriteSize( mxBitmap->getSize() );\n        sprite = rView->createSprite( basegfx::B2DVector( spriteSize.Width,\n                                                          spriteSize.Height ),\n                                      1000.0 ); \/\/ sprite should be in front of all\n                                                \/\/ other sprites\n        rendering::ViewState viewState;\n        canvas::tools::initViewState( viewState );\n        rendering::RenderState renderState;\n        canvas::tools::initRenderState( renderState );\n        sprite->getContentCanvas()->getUNOCanvas()->drawBitmap(\n            mxBitmap, viewState, renderState );\n\n        sprite->setAlpha( 0.9 );\n        sprite->movePixel( calcSpritePos( rView ) );\n        if( mbVisible )\n            sprite->show();\n    }\n    catch( uno::Exception& )\n    {\n        OSL_ENSURE( false,\n                    rtl::OUStringToOString(\n                        comphelper::anyToString( cppu::getCaughtException() ),\n                        RTL_TEXTENCODING_UTF8 ).getStr() );\n    }\n\n    maViews.push_back( ViewsVecT::value_type( rView, sprite ) );\n}\n\nvoid WaitSymbol::viewRemoved( const UnoViewSharedPtr& rView )\n{\n    maViews.erase(\n        std::remove_if(\n            maViews.begin(), maViews.end(),\n            boost::bind(\n                std::equal_to<UnoViewSharedPtr>(),\n                rView,\n                \/\/ select view:\n                boost::bind( std::select1st<ViewsVecT::value_type>(), _1 ) ) ),\n        maViews.end() );\n}\n\nvoid WaitSymbol::viewChanged( const UnoViewSharedPtr& rView )\n{\n    \/\/ find entry corresponding to modified view\n    ViewsVecT::iterator aModifiedEntry(\n        std::find_if(\n            maViews.begin(),\n            maViews.end(),\n            boost::bind(\n                std::equal_to<UnoViewSharedPtr>(),\n                rView,\n                \/\/ select view:\n                boost::bind( std::select1st<ViewsVecT::value_type>(), _1 ))));\n\n    OSL_ASSERT( aModifiedEntry != maViews.end() );\n    if( aModifiedEntry == maViews.end() )\n        return;\n\n    if( aModifiedEntry->second )\n        aModifiedEntry->second->movePixel(\n            calcSpritePos(aModifiedEntry->first) );\n}\n\nvoid WaitSymbol::viewsChanged()\n{\n    \/\/ reposition sprites on all views\n    ViewsVecT::const_iterator       aIter( maViews.begin() );\n    ViewsVecT::const_iterator const aEnd ( maViews.end() );\n    while( aIter != aEnd )\n    {\n        if( aIter->second )\n            aIter->second->movePixel(\n                calcSpritePos( aIter->first ));\n        ++aIter;\n    }\n}\n\n} \/\/ namespace internal\n} \/\/ namespace presentation\n<commit_msg>INTEGRATION: CWS changefileheader (1.10.46); FILE MERGED 2008\/03\/31 14:00:15 rt 1.10.46.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: waitsymbol.cxx,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\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_slideshow.hxx\"\n\n#include <boost\/current_function.hpp>\n#include <canvas\/canvastools.hxx>\n\n#include <comphelper\/anytostring.hxx>\n#include <cppuhelper\/exc_hlp.hxx>\n\n#include <basegfx\/point\/b2dpoint.hxx>\n#include <basegfx\/vector\/b2dvector.hxx>\n\n#include \"waitsymbol.hxx\"\n#include \"eventmultiplexer.hxx\"\n\n#include <algorithm>\n\n\nusing namespace com::sun::star;\n\nnamespace slideshow {\nnamespace internal {\n\nconst sal_Int32 LEFT_BORDER_SPACE  = 10;\nconst sal_Int32 LOWER_BORDER_SPACE = 10;\n\nWaitSymbolSharedPtr WaitSymbol::create( const uno::Reference<rendering::XBitmap>& xBitmap,\n                                        ScreenUpdater&                            rScreenUpdater,\n                                        EventMultiplexer&                         rEventMultiplexer,\n                                        const UnoViewContainer&                   rViewContainer )\n{\n    WaitSymbolSharedPtr pRet(\n        new WaitSymbol( xBitmap,\n                        rScreenUpdater,\n                        rViewContainer ));\n\n    rEventMultiplexer.addViewHandler( pRet );\n\n    return pRet;\n}\n\nWaitSymbol::WaitSymbol( uno::Reference<rendering::XBitmap> const &   xBitmap,\n                        ScreenUpdater&                               rScreenUpdater,\n                        const UnoViewContainer&                      rViewContainer ) :\n    mxBitmap(xBitmap),\n    maViews(),\n    mrScreenUpdater( rScreenUpdater ),\n    mbVisible(false)\n{\n    std::for_each( rViewContainer.begin(),\n                   rViewContainer.end(),\n                   boost::bind( &WaitSymbol::viewAdded,\n                                this,\n                                _1 ));\n}\n\nvoid WaitSymbol::setVisible( const bool bVisible )\n{\n    if( mbVisible != bVisible )\n    {\n        mbVisible = bVisible;\n\n        ViewsVecT::const_iterator       aIter( maViews.begin() );\n        ViewsVecT::const_iterator const aEnd ( maViews.end() );\n        while( aIter != aEnd )\n        {\n            if( aIter->second )\n            {\n                if( bVisible )\n                    aIter->second->show();\n                else\n                    aIter->second->hide();\n            }\n\n            ++aIter;\n        }\n\n        \/\/ sprites changed, need a screen update for this frame.\n        mrScreenUpdater.requestImmediateUpdate();\n    }\n}\n\nbasegfx::B2DPoint WaitSymbol::calcSpritePos(\n    UnoViewSharedPtr const & rView ) const\n{\n    const uno::Reference<rendering::XBitmap> xBitmap( rView->getCanvas()->getUNOCanvas(),\n                                                      uno::UNO_QUERY_THROW );\n    const geometry::IntegerSize2D realSize( xBitmap->getSize() );\n    return basegfx::B2DPoint(\n        std::min<sal_Int32>( realSize.Width, LEFT_BORDER_SPACE ),\n        std::max<sal_Int32>( 0, realSize.Height - mxBitmap->getSize().Height\n                                                - LOWER_BORDER_SPACE ) );\n}\n\nvoid WaitSymbol::viewAdded( const UnoViewSharedPtr& rView )\n{\n    cppcanvas::CustomSpriteSharedPtr sprite;\n\n    try\n    {\n        const geometry::IntegerSize2D spriteSize( mxBitmap->getSize() );\n        sprite = rView->createSprite( basegfx::B2DVector( spriteSize.Width,\n                                                          spriteSize.Height ),\n                                      1000.0 ); \/\/ sprite should be in front of all\n                                                \/\/ other sprites\n        rendering::ViewState viewState;\n        canvas::tools::initViewState( viewState );\n        rendering::RenderState renderState;\n        canvas::tools::initRenderState( renderState );\n        sprite->getContentCanvas()->getUNOCanvas()->drawBitmap(\n            mxBitmap, viewState, renderState );\n\n        sprite->setAlpha( 0.9 );\n        sprite->movePixel( calcSpritePos( rView ) );\n        if( mbVisible )\n            sprite->show();\n    }\n    catch( uno::Exception& )\n    {\n        OSL_ENSURE( false,\n                    rtl::OUStringToOString(\n                        comphelper::anyToString( cppu::getCaughtException() ),\n                        RTL_TEXTENCODING_UTF8 ).getStr() );\n    }\n\n    maViews.push_back( ViewsVecT::value_type( rView, sprite ) );\n}\n\nvoid WaitSymbol::viewRemoved( const UnoViewSharedPtr& rView )\n{\n    maViews.erase(\n        std::remove_if(\n            maViews.begin(), maViews.end(),\n            boost::bind(\n                std::equal_to<UnoViewSharedPtr>(),\n                rView,\n                \/\/ select view:\n                boost::bind( std::select1st<ViewsVecT::value_type>(), _1 ) ) ),\n        maViews.end() );\n}\n\nvoid WaitSymbol::viewChanged( const UnoViewSharedPtr& rView )\n{\n    \/\/ find entry corresponding to modified view\n    ViewsVecT::iterator aModifiedEntry(\n        std::find_if(\n            maViews.begin(),\n            maViews.end(),\n            boost::bind(\n                std::equal_to<UnoViewSharedPtr>(),\n                rView,\n                \/\/ select view:\n                boost::bind( std::select1st<ViewsVecT::value_type>(), _1 ))));\n\n    OSL_ASSERT( aModifiedEntry != maViews.end() );\n    if( aModifiedEntry == maViews.end() )\n        return;\n\n    if( aModifiedEntry->second )\n        aModifiedEntry->second->movePixel(\n            calcSpritePos(aModifiedEntry->first) );\n}\n\nvoid WaitSymbol::viewsChanged()\n{\n    \/\/ reposition sprites on all views\n    ViewsVecT::const_iterator       aIter( maViews.begin() );\n    ViewsVecT::const_iterator const aEnd ( maViews.end() );\n    while( aIter != aEnd )\n    {\n        if( aIter->second )\n            aIter->second->movePixel(\n                calcSpritePos( aIter->first ));\n        ++aIter;\n    }\n}\n\n} \/\/ namespace internal\n} \/\/ namespace presentation\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 \"views\/controls\/tabbed_pane\/native_tabbed_pane_win.h\"\n\n#include <vssym32.h>\n\n#include \"app\/l10n_util_win.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/logging.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"gfx\/canvas.h\"\n#include \"gfx\/font.h\"\n#include \"gfx\/native_theme_win.h\"\n#include \"views\/controls\/tabbed_pane\/tabbed_pane.h\"\n#include \"views\/fill_layout.h\"\n#include \"views\/widget\/root_view.h\"\n#include \"views\/widget\/widget_win.h\"\n\nnamespace views {\n\n\/\/ A background object that paints the tab panel background which may be\n\/\/ rendered by the system visual styles system.\nclass TabBackground : public Background {\n public:\n  explicit TabBackground() {\n    \/\/ TMT_FILLCOLORHINT returns a color value that supposedly\n    \/\/ approximates the texture drawn by PaintTabPanelBackground.\n    SkColor tab_page_color =\n        gfx::NativeTheme::instance()->GetThemeColorWithDefault(\n            gfx::NativeTheme::TAB, TABP_BODY, 0, TMT_FILLCOLORHINT,\n            COLOR_3DFACE);\n    SetNativeControlColor(tab_page_color);\n  }\n  virtual ~TabBackground() {}\n\n  virtual void Paint(gfx::Canvas* canvas, View* view) const {\n    HDC dc = canvas->beginPlatformPaint();\n    RECT r = {0, 0, view->width(), view->height()};\n    gfx::NativeTheme::instance()->PaintTabPanelBackground(dc, &r);\n    canvas->endPlatformPaint();\n  }\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(TabBackground);\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWin, public:\n\nNativeTabbedPaneWin::NativeTabbedPaneWin(TabbedPane* tabbed_pane)\n    : NativeControlWin(),\n      tabbed_pane_(tabbed_pane),\n      content_window_(NULL),\n      selected_index_(-1) {\n  \/\/ Associates the actual HWND with the tabbed-pane so the tabbed-pane is\n  \/\/ the one considered as having the focus (not the wrapper) when the HWND is\n  \/\/ focused directly (with a click for example).\n  set_focus_view(tabbed_pane);\n}\n\nNativeTabbedPaneWin::~NativeTabbedPaneWin() {\n  \/\/ We own the tab views, let's delete them.\n  STLDeleteContainerPointers(tab_views_.begin(), tab_views_.end());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWin, NativeTabbedPaneWrapper implementation:\n\nvoid NativeTabbedPaneWin::AddTab(const std::wstring& title, View* contents) {\n  AddTabAtIndex(static_cast<int>(tab_views_.size()), title, contents, true);\n}\n\nvoid NativeTabbedPaneWin::AddTabAtIndex(int index, const std::wstring& title,\n                                        View* contents,\n                                        bool select_if_first_tab) {\n  DCHECK(index <= static_cast<int>(tab_views_.size()));\n  contents->set_parent_owned(false);\n  tab_views_.insert(tab_views_.begin() + index, contents);\n  tab_titles_.insert(tab_titles_.begin() + index, title);\n\n  if (!contents->background())\n    contents->set_background(new TabBackground);\n\n  if (tab_views_.size() == 1 && select_if_first_tab) {\n    \/\/ If this is the only tab displayed, make sure the contents is set.\n    selected_index_ = 0;\n    if (content_window_)\n      content_window_->GetRootView()->AddChildView(contents);\n  }\n\n  \/\/ Add native tab only if the native control is alreay created.\n  if (content_window_) {\n    AddNativeTab(index, title, contents);\n\n    \/\/ The newly added tab may have made the contents window smaller.\n    ResizeContents();\n  }\n}\n\nvoid NativeTabbedPaneWin::AddNativeTab(int index,\n                                       const std::wstring &title,\n                                       views::View* contents) {\n  TCITEM tcitem;\n  tcitem.mask = TCIF_TEXT;\n\n  \/\/ If the locale is RTL, we set the TCIF_RTLREADING so that BiDi text is\n  \/\/ rendered properly on the tabs.\n  if (UILayoutIsRightToLeft()) {\n    tcitem.mask |= TCIF_RTLREADING;\n  }\n\n  tcitem.pszText = const_cast<wchar_t*>(title.c_str());\n  int result = TabCtrl_InsertItem(native_view(), index, &tcitem);\n  DCHECK(result != -1);\n}\n\nView* NativeTabbedPaneWin::RemoveTabAtIndex(int index) {\n  int tab_count = static_cast<int>(tab_views_.size());\n  DCHECK(index >= 0 && index < tab_count);\n\n  if (index < (tab_count - 1)) {\n    \/\/ Select the next tab.\n    SelectTabAt(index + 1);\n  } else {\n    \/\/ We are the last tab, select the previous one.\n    if (index > 0) {\n      SelectTabAt(index - 1);\n    } else if (content_window_) {\n      \/\/ That was the last tab. Remove the contents.\n      content_window_->GetRootView()->RemoveAllChildViews(false);\n    }\n  }\n  TabCtrl_DeleteItem(native_view(), index);\n\n  \/\/ The removed tab may have made the contents window bigger.\n  if (content_window_)\n    ResizeContents();\n\n  std::vector<View*>::iterator iter = tab_views_.begin() + index;\n  View* removed_tab = *iter;\n  tab_views_.erase(iter);\n  tab_titles_.erase(tab_titles_.begin() + index);\n\n  return removed_tab;\n}\n\nvoid NativeTabbedPaneWin::SelectTabAt(int index) {\n  DCHECK((index >= 0) && (index < static_cast<int>(tab_views_.size())));\n  if (native_view())\n    TabCtrl_SetCurSel(native_view(), index);\n  DoSelectTabAt(index, true);\n}\n\nint NativeTabbedPaneWin::GetTabCount() {\n  return TabCtrl_GetItemCount(native_view());\n}\n\nint NativeTabbedPaneWin::GetSelectedTabIndex() {\n  return TabCtrl_GetCurSel(native_view());\n}\n\nView* NativeTabbedPaneWin::GetSelectedTab() {\n  if (selected_index_ < 0)\n    return NULL;\n  return tab_views_[selected_index_];\n}\n\nView* NativeTabbedPaneWin::GetView() {\n  return this;\n}\n\nvoid NativeTabbedPaneWin::SetFocus() {\n  \/\/ Focus the associated HWND.\n  Focus();\n}\n\ngfx::NativeView NativeTabbedPaneWin::GetTestingHandle() const {\n  return native_view();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWin, NativeControlWin override:\n\nvoid NativeTabbedPaneWin::CreateNativeControl() {\n  \/\/ Create the tab control.\n  \/\/\n  \/\/ Note that we don't follow the common convention for NativeControl\n  \/\/ subclasses and we don't pass the value returned from\n  \/\/ NativeControl::GetAdditionalExStyle() as the dwExStyle parameter. Here is\n  \/\/ why: on RTL locales, if we pass NativeControl::GetAdditionalExStyle() when\n  \/\/ we basically tell Windows to create our HWND with the WS_EX_LAYOUTRTL. If\n  \/\/ we do that, then the HWND we create for |content_window_| below will\n  \/\/ inherit the WS_EX_LAYOUTRTL property and this will result in the contents\n  \/\/ being flipped, which is not what we want (because we handle mirroring in\n  \/\/ views without the use of Windows' support for mirroring). Therefore,\n  \/\/ we initially create our HWND without the aforementioned property and we\n  \/\/ explicitly set this property our child is created. This way, on RTL\n  \/\/ locales, our tabs will be nicely rendered from right to left (by virtue of\n  \/\/ Windows doing the right thing with the TabbedPane HWND) and each tab\n  \/\/ contents will use an RTL layout correctly (by virtue of the mirroring\n  \/\/ infrastructure in views doing the right thing with each View we put\n  \/\/ in the tab).\n  HWND tab_control = ::CreateWindowEx(0,\n                                      WC_TABCONTROL,\n                                      L\"\",\n                                      WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE,\n                                      0, 0, width(), height(),\n                                      GetWidget()->GetNativeView(), NULL, NULL,\n                                      NULL);\n\n  HFONT font = ResourceBundle::GetSharedInstance().\n      GetFont(ResourceBundle::BaseFont).hfont();\n  SendMessage(tab_control, WM_SETFONT, reinterpret_cast<WPARAM>(font), FALSE);\n\n  \/\/ Create the view container which is a child of the TabControl.\n  content_window_ = new WidgetWin();\n  content_window_->Init(tab_control, gfx::Rect());\n\n  \/\/ Explicitly setting the WS_EX_LAYOUTRTL property for the HWND (see above\n  \/\/ for a thorough explanation regarding why we waited until |content_window_|\n  \/\/ if created before we set this property for the tabbed pane's HWND).\n  if (UILayoutIsRightToLeft())\n    l10n_util::HWNDSetRTLLayout(tab_control);\n\n  RootView* root_view = content_window_->GetRootView();\n  root_view->SetLayoutManager(new FillLayout());\n  DWORD sys_color = ::GetSysColor(COLOR_3DHILIGHT);\n  SkColor color = SkColorSetRGB(GetRValue(sys_color), GetGValue(sys_color),\n                                GetBValue(sys_color));\n  root_view->set_background(Background::CreateSolidBackground(color));\n\n  content_window_->SetFocusTraversableParentView(this);\n\n  NativeControlCreated(tab_control);\n\n  \/\/ Add tabs that are already added if any.\n  if (tab_views_.size() > 0) {\n    InitializeTabs();\n    if (selected_index_ >= 0)\n      DoSelectTabAt(selected_index_, false);\n  }\n\n  ResizeContents();\n}\n\nbool NativeTabbedPaneWin::ProcessMessage(UINT message,\n                                         WPARAM w_param,\n                                         LPARAM l_param,\n                                         LRESULT* result) {\n  if (message == WM_NOTIFY &&\n      reinterpret_cast<LPNMHDR>(l_param)->code == TCN_SELCHANGE) {\n    int selected_tab = TabCtrl_GetCurSel(native_view());\n    DCHECK(selected_tab != -1);\n    DoSelectTabAt(selected_tab, true);\n    return TRUE;\n  }\n  return NativeControlWin::ProcessMessage(message, w_param, l_param, result);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ View override:\n\nvoid NativeTabbedPaneWin::Layout() {\n  NativeControlWin::Layout();\n  ResizeContents();\n}\n\nFocusTraversable* NativeTabbedPaneWin::GetFocusTraversable() {\n  return content_window_;\n}\n\nvoid NativeTabbedPaneWin::ViewHierarchyChanged(bool is_add,\n                                               View *parent,\n                                               View *child) {\n  NativeControlWin::ViewHierarchyChanged(is_add, parent, child);\n\n  if (is_add && (child == this) && content_window_) {\n    \/\/ We have been added to a view hierarchy, update the FocusTraversable\n    \/\/ parent.\n    content_window_->SetFocusTraversableParent(GetRootView());\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWin, private:\n\nvoid NativeTabbedPaneWin::InitializeTabs() {\n  for (size_t i = 0; i < tab_views_.size(); ++i) {\n    AddNativeTab(i, tab_titles_[i], tab_views_[i]);\n  }\n}\n\nvoid NativeTabbedPaneWin::DoSelectTabAt(int index, boolean invoke_listener) {\n  selected_index_ = index;\n  if (content_window_) {\n    RootView* content_root = content_window_->GetRootView();\n\n    \/\/ Clear the focus if the focused view was on the tab.\n    FocusManager* focus_manager = GetFocusManager();\n    DCHECK(focus_manager);\n    View* focused_view = focus_manager->GetFocusedView();\n    if (focused_view && content_root->IsParentOf(focused_view))\n      focus_manager->ClearFocus();\n\n    content_root->RemoveAllChildViews(false);\n    content_root->AddChildView(tab_views_[index]);\n    content_root->Layout();\n  }\n  if (invoke_listener && tabbed_pane_->listener())\n    tabbed_pane_->listener()->TabSelectedAt(index);\n}\n\nvoid NativeTabbedPaneWin::ResizeContents() {\n  CRect content_bounds;\n  if (!GetClientRect(native_view(), &content_bounds))\n    return;\n  TabCtrl_AdjustRect(native_view(), FALSE, &content_bounds);\n  content_window_->MoveWindow(content_bounds.left, content_bounds.top,\n                              content_bounds.Width(), content_bounds.Height(),\n                              TRUE);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWrapper, public:\n\n\/\/ static\nNativeTabbedPaneWrapper* NativeTabbedPaneWrapper::CreateNativeWrapper(\n    TabbedPane* tabbed_pane) {\n  return new NativeTabbedPaneWin(tabbed_pane);\n}\n\n}  \/\/ namespace views\n<commit_msg>Add style to clip children which reduces flashing when the tab control is resized. The tab control still flashes a little bit but it is only the outer area and not the large content area\/child controls. Fixing that probably requires drawing the tab control on our own which is perhaps overkill. BUG=28383 TEST=follow steps given in the bug and resize password manager window, tab should not flicker as much as it did earlier. <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 \"views\/controls\/tabbed_pane\/native_tabbed_pane_win.h\"\n\n#include <vssym32.h>\n\n#include \"app\/l10n_util_win.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/logging.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"gfx\/canvas.h\"\n#include \"gfx\/font.h\"\n#include \"gfx\/native_theme_win.h\"\n#include \"views\/controls\/tabbed_pane\/tabbed_pane.h\"\n#include \"views\/fill_layout.h\"\n#include \"views\/widget\/root_view.h\"\n#include \"views\/widget\/widget_win.h\"\n\nnamespace views {\n\n\/\/ A background object that paints the tab panel background which may be\n\/\/ rendered by the system visual styles system.\nclass TabBackground : public Background {\n public:\n  explicit TabBackground() {\n    \/\/ TMT_FILLCOLORHINT returns a color value that supposedly\n    \/\/ approximates the texture drawn by PaintTabPanelBackground.\n    SkColor tab_page_color =\n        gfx::NativeTheme::instance()->GetThemeColorWithDefault(\n            gfx::NativeTheme::TAB, TABP_BODY, 0, TMT_FILLCOLORHINT,\n            COLOR_3DFACE);\n    SetNativeControlColor(tab_page_color);\n  }\n  virtual ~TabBackground() {}\n\n  virtual void Paint(gfx::Canvas* canvas, View* view) const {\n    HDC dc = canvas->beginPlatformPaint();\n    RECT r = {0, 0, view->width(), view->height()};\n    gfx::NativeTheme::instance()->PaintTabPanelBackground(dc, &r);\n    canvas->endPlatformPaint();\n  }\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(TabBackground);\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWin, public:\n\nNativeTabbedPaneWin::NativeTabbedPaneWin(TabbedPane* tabbed_pane)\n    : NativeControlWin(),\n      tabbed_pane_(tabbed_pane),\n      content_window_(NULL),\n      selected_index_(-1) {\n  \/\/ Associates the actual HWND with the tabbed-pane so the tabbed-pane is\n  \/\/ the one considered as having the focus (not the wrapper) when the HWND is\n  \/\/ focused directly (with a click for example).\n  set_focus_view(tabbed_pane);\n}\n\nNativeTabbedPaneWin::~NativeTabbedPaneWin() {\n  \/\/ We own the tab views, let's delete them.\n  STLDeleteContainerPointers(tab_views_.begin(), tab_views_.end());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWin, NativeTabbedPaneWrapper implementation:\n\nvoid NativeTabbedPaneWin::AddTab(const std::wstring& title, View* contents) {\n  AddTabAtIndex(static_cast<int>(tab_views_.size()), title, contents, true);\n}\n\nvoid NativeTabbedPaneWin::AddTabAtIndex(int index, const std::wstring& title,\n                                        View* contents,\n                                        bool select_if_first_tab) {\n  DCHECK(index <= static_cast<int>(tab_views_.size()));\n  contents->set_parent_owned(false);\n  tab_views_.insert(tab_views_.begin() + index, contents);\n  tab_titles_.insert(tab_titles_.begin() + index, title);\n\n  if (!contents->background())\n    contents->set_background(new TabBackground);\n\n  if (tab_views_.size() == 1 && select_if_first_tab) {\n    \/\/ If this is the only tab displayed, make sure the contents is set.\n    selected_index_ = 0;\n    if (content_window_)\n      content_window_->GetRootView()->AddChildView(contents);\n  }\n\n  \/\/ Add native tab only if the native control is alreay created.\n  if (content_window_) {\n    AddNativeTab(index, title, contents);\n\n    \/\/ The newly added tab may have made the contents window smaller.\n    ResizeContents();\n  }\n}\n\nvoid NativeTabbedPaneWin::AddNativeTab(int index,\n                                       const std::wstring &title,\n                                       views::View* contents) {\n  TCITEM tcitem;\n  tcitem.mask = TCIF_TEXT;\n\n  \/\/ If the locale is RTL, we set the TCIF_RTLREADING so that BiDi text is\n  \/\/ rendered properly on the tabs.\n  if (UILayoutIsRightToLeft()) {\n    tcitem.mask |= TCIF_RTLREADING;\n  }\n\n  tcitem.pszText = const_cast<wchar_t*>(title.c_str());\n  int result = TabCtrl_InsertItem(native_view(), index, &tcitem);\n  DCHECK(result != -1);\n}\n\nView* NativeTabbedPaneWin::RemoveTabAtIndex(int index) {\n  int tab_count = static_cast<int>(tab_views_.size());\n  DCHECK(index >= 0 && index < tab_count);\n\n  if (index < (tab_count - 1)) {\n    \/\/ Select the next tab.\n    SelectTabAt(index + 1);\n  } else {\n    \/\/ We are the last tab, select the previous one.\n    if (index > 0) {\n      SelectTabAt(index - 1);\n    } else if (content_window_) {\n      \/\/ That was the last tab. Remove the contents.\n      content_window_->GetRootView()->RemoveAllChildViews(false);\n    }\n  }\n  TabCtrl_DeleteItem(native_view(), index);\n\n  \/\/ The removed tab may have made the contents window bigger.\n  if (content_window_)\n    ResizeContents();\n\n  std::vector<View*>::iterator iter = tab_views_.begin() + index;\n  View* removed_tab = *iter;\n  tab_views_.erase(iter);\n  tab_titles_.erase(tab_titles_.begin() + index);\n\n  return removed_tab;\n}\n\nvoid NativeTabbedPaneWin::SelectTabAt(int index) {\n  DCHECK((index >= 0) && (index < static_cast<int>(tab_views_.size())));\n  if (native_view())\n    TabCtrl_SetCurSel(native_view(), index);\n  DoSelectTabAt(index, true);\n}\n\nint NativeTabbedPaneWin::GetTabCount() {\n  return TabCtrl_GetItemCount(native_view());\n}\n\nint NativeTabbedPaneWin::GetSelectedTabIndex() {\n  return TabCtrl_GetCurSel(native_view());\n}\n\nView* NativeTabbedPaneWin::GetSelectedTab() {\n  if (selected_index_ < 0)\n    return NULL;\n  return tab_views_[selected_index_];\n}\n\nView* NativeTabbedPaneWin::GetView() {\n  return this;\n}\n\nvoid NativeTabbedPaneWin::SetFocus() {\n  \/\/ Focus the associated HWND.\n  Focus();\n}\n\ngfx::NativeView NativeTabbedPaneWin::GetTestingHandle() const {\n  return native_view();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWin, NativeControlWin override:\n\nvoid NativeTabbedPaneWin::CreateNativeControl() {\n  \/\/ Create the tab control.\n  \/\/\n  \/\/ Note that we don't follow the common convention for NativeControl\n  \/\/ subclasses and we don't pass the value returned from\n  \/\/ NativeControl::GetAdditionalExStyle() as the dwExStyle parameter. Here is\n  \/\/ why: on RTL locales, if we pass NativeControl::GetAdditionalExStyle() when\n  \/\/ we basically tell Windows to create our HWND with the WS_EX_LAYOUTRTL. If\n  \/\/ we do that, then the HWND we create for |content_window_| below will\n  \/\/ inherit the WS_EX_LAYOUTRTL property and this will result in the contents\n  \/\/ being flipped, which is not what we want (because we handle mirroring in\n  \/\/ views without the use of Windows' support for mirroring). Therefore,\n  \/\/ we initially create our HWND without the aforementioned property and we\n  \/\/ explicitly set this property our child is created. This way, on RTL\n  \/\/ locales, our tabs will be nicely rendered from right to left (by virtue of\n  \/\/ Windows doing the right thing with the TabbedPane HWND) and each tab\n  \/\/ contents will use an RTL layout correctly (by virtue of the mirroring\n  \/\/ infrastructure in views doing the right thing with each View we put\n  \/\/ in the tab).\n  DWORD style = WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE | WS_CLIPCHILDREN;\n  HWND tab_control = ::CreateWindowEx(0,\n                                      WC_TABCONTROL,\n                                      L\"\",\n                                      style,\n                                      0, 0, width(), height(),\n                                      GetWidget()->GetNativeView(), NULL, NULL,\n                                      NULL);\n\n  HFONT font = ResourceBundle::GetSharedInstance().\n      GetFont(ResourceBundle::BaseFont).hfont();\n  SendMessage(tab_control, WM_SETFONT, reinterpret_cast<WPARAM>(font), FALSE);\n\n  \/\/ Create the view container which is a child of the TabControl.\n  content_window_ = new WidgetWin();\n  content_window_->Init(tab_control, gfx::Rect());\n\n  \/\/ Explicitly setting the WS_EX_LAYOUTRTL property for the HWND (see above\n  \/\/ for a thorough explanation regarding why we waited until |content_window_|\n  \/\/ if created before we set this property for the tabbed pane's HWND).\n  if (UILayoutIsRightToLeft())\n    l10n_util::HWNDSetRTLLayout(tab_control);\n\n  RootView* root_view = content_window_->GetRootView();\n  root_view->SetLayoutManager(new FillLayout());\n  DWORD sys_color = ::GetSysColor(COLOR_3DHILIGHT);\n  SkColor color = SkColorSetRGB(GetRValue(sys_color), GetGValue(sys_color),\n                                GetBValue(sys_color));\n  root_view->set_background(Background::CreateSolidBackground(color));\n\n  content_window_->SetFocusTraversableParentView(this);\n\n  NativeControlCreated(tab_control);\n\n  \/\/ Add tabs that are already added if any.\n  if (tab_views_.size() > 0) {\n    InitializeTabs();\n    if (selected_index_ >= 0)\n      DoSelectTabAt(selected_index_, false);\n  }\n\n  ResizeContents();\n}\n\nbool NativeTabbedPaneWin::ProcessMessage(UINT message,\n                                         WPARAM w_param,\n                                         LPARAM l_param,\n                                         LRESULT* result) {\n  if (message == WM_NOTIFY &&\n      reinterpret_cast<LPNMHDR>(l_param)->code == TCN_SELCHANGE) {\n    int selected_tab = TabCtrl_GetCurSel(native_view());\n    DCHECK(selected_tab != -1);\n    DoSelectTabAt(selected_tab, true);\n    return TRUE;\n  }\n  return NativeControlWin::ProcessMessage(message, w_param, l_param, result);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ View override:\n\nvoid NativeTabbedPaneWin::Layout() {\n  NativeControlWin::Layout();\n  ResizeContents();\n}\n\nFocusTraversable* NativeTabbedPaneWin::GetFocusTraversable() {\n  return content_window_;\n}\n\nvoid NativeTabbedPaneWin::ViewHierarchyChanged(bool is_add,\n                                               View *parent,\n                                               View *child) {\n  NativeControlWin::ViewHierarchyChanged(is_add, parent, child);\n\n  if (is_add && (child == this) && content_window_) {\n    \/\/ We have been added to a view hierarchy, update the FocusTraversable\n    \/\/ parent.\n    content_window_->SetFocusTraversableParent(GetRootView());\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWin, private:\n\nvoid NativeTabbedPaneWin::InitializeTabs() {\n  for (size_t i = 0; i < tab_views_.size(); ++i) {\n    AddNativeTab(i, tab_titles_[i], tab_views_[i]);\n  }\n}\n\nvoid NativeTabbedPaneWin::DoSelectTabAt(int index, boolean invoke_listener) {\n  selected_index_ = index;\n  if (content_window_) {\n    RootView* content_root = content_window_->GetRootView();\n\n    \/\/ Clear the focus if the focused view was on the tab.\n    FocusManager* focus_manager = GetFocusManager();\n    DCHECK(focus_manager);\n    View* focused_view = focus_manager->GetFocusedView();\n    if (focused_view && content_root->IsParentOf(focused_view))\n      focus_manager->ClearFocus();\n\n    content_root->RemoveAllChildViews(false);\n    content_root->AddChildView(tab_views_[index]);\n    content_root->Layout();\n  }\n  if (invoke_listener && tabbed_pane_->listener())\n    tabbed_pane_->listener()->TabSelectedAt(index);\n}\n\nvoid NativeTabbedPaneWin::ResizeContents() {\n  CRect content_bounds;\n  if (!GetClientRect(native_view(), &content_bounds))\n    return;\n  TabCtrl_AdjustRect(native_view(), FALSE, &content_bounds);\n  content_window_->MoveWindow(content_bounds.left, content_bounds.top,\n                              content_bounds.Width(), content_bounds.Height(),\n                              TRUE);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeTabbedPaneWrapper, public:\n\n\/\/ static\nNativeTabbedPaneWrapper* NativeTabbedPaneWrapper::CreateNativeWrapper(\n    TabbedPane* tabbed_pane) {\n  return new NativeTabbedPaneWin(tabbed_pane);\n}\n\n}  \/\/ namespace views\n<|endoftext|>"}
{"text":"<commit_before>#include \"powerup.hpp\"\n\n#define SEARCH_RADIUS 5\n\nint Powerup::vertex_type( Vertex& v ) {\n\tint num_neighbors = map->getNumActors();\n\tfor ( int i = 0; i < num_neighbors; i++ ) {\n\t\tint a, b;\n\t\tmap->getActorPosition( i, a, b );\n\t\tVertex temp( a, b );\n\t\tif( temp == v ) {\n\t\t\treturn map->getActorType( i );\n\t\t}\n\t}\n\treturn 0;\n}\n\nPowerup::Powerup( int type ): Actor( type ) {}\n\nPowerup* Powerup::duplicate() {\n\treturn new Powerup( getType() );\n}\n\nconst char*  Powerup::getActorId() { \t\n\treturn \"simplehero\"; \n}\n\nconst char* Powerup::getNetId() {\n\treturn \"hammesa\"; \n}\n\nbool Powerup::visited( const Vertex& v ) const {\n\treturn v_set.find( v ) != v_set.end();\n}\n\nint Powerup::selectNeighbor( GraphMap* map, int cur_x, int cur_y ) {\n\tthis->map = map;\n\tv_set.clear();\n\trank_nodes( cur_x, cur_y );\n\n\treturn 0;\n}\n\nvoid Powerup::rank_nodes( int x, int y ) {\n\tqueue< Vertex > q;\n\tVertex temp( x, y );\n\tdist[temp] = 0;\n\n\tq.push( Vertex( x, y ) );\n\n\tvector< Vertex > enemies;\n\tvector< Vertex > eatables;\n\n\tbool stop = false;\n\twhile( !q.empty() && enemies.size() < SEARCH_RADIUS && !stop ) {\n\t\tVertex popped = q.front();\n\t\tq.pop();\n\n\t\tv_set.insert( popped );\n\t\tif( vertex_type( popped ) & ACTOR_ENEMY ) {\n\t\t\tenemies.push_back( popped );\n\t\t}\n\n\t\tif( vertex_type( popped ) & ACTOR_EATABLE ) {\n\t\t\teatables.push_back( popped );\n\t\t}\n\n\t\tint num_neighbors = map->getNumNeighbors( popped.x, popped. y )\n\t\tfor ( int i = 0; i < num_neighbors; i++ ) {\n\t\t\tint a, b;\n\t\t\tmap->getNeighbor( popped.x, popped.y, i, a, b );\n\t\t\tVertex temp( a, b );\n\n\t\t\tif( !visited( temp ) ) {\n\t\t\t\tdist[temp] = dist[popped] + 1;\n\t\t\t\tif( dist[temp] > SEARCH_RADIUS ) {\n\t\t\t\t\tstop = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tq.push( temp );\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n\n<commit_msg>added const<commit_after>#include \"powerup.hpp\"\n\n#define SEARCH_RADIUS 5\n\nint Powerup::vertex_type( const Vertex& v ) const {\n\tint num_neighbors = map->getNumActors();\n\tfor ( int i = 0; i < num_neighbors; i++ ) {\n\t\tint a, b;\n\t\tmap->getActorPosition( i, a, b );\n\t\tVertex temp( a, b );\n\t\tif( temp == v ) {\n\t\t\treturn map->getActorType( i );\n\t\t}\n\t}\n\treturn 0;\n}\n\nPowerup::Powerup( int type ): Actor( type ) {}\n\nPowerup* Powerup::duplicate() {\n\treturn new Powerup( getType() );\n}\n\nconst char*  Powerup::getActorId() { \t\n\treturn \"simplehero\"; \n}\n\nconst char* Powerup::getNetId() {\n\treturn \"hammesa\"; \n}\n\nbool Powerup::visited( const Vertex& v ) const {\n\treturn v_set.find( v ) != v_set.end();\n}\n\nint Powerup::selectNeighbor( GraphMap* map, int cur_x, int cur_y ) {\n\tthis->map = map;\n\tv_set.clear();\n\trank_nodes( cur_x, cur_y );\n\n\treturn 0;\n}\n\nvoid Powerup::rank_nodes( int x, int y ) {\n\tqueue< Vertex > q;\n\tVertex temp( x, y );\n\tdist[temp] = 0;\n\n\tq.push( Vertex( x, y ) );\n\n\tvector< Vertex > enemies;\n\tvector< Vertex > eatables;\n\n\tbool stop = false;\n\twhile( !q.empty() && enemies.size() < SEARCH_RADIUS && !stop ) {\n\t\tVertex popped = q.front();\n\t\tq.pop();\n\n\t\tv_set.insert( popped );\n\t\tif( vertex_type( popped ) & ACTOR_ENEMY ) {\n\t\t\tenemies.push_back( popped );\n\t\t}\n\n\t\tif( vertex_type( popped ) & ACTOR_EATABLE ) {\n\t\t\teatables.push_back( popped );\n\t\t}\n\n\t\tint num_neighbors = map->getNumNeighbors( popped.x, popped. y );\n\t\tfor ( int i = 0; i < num_neighbors; i++ ) {\n\t\t\tint a, b;\n\t\t\tmap->getNeighbor( popped.x, popped.y, i, a, b );\n\t\t\tVertex temp( a, b );\n\n\t\t\tif( !visited( temp ) ) {\n\t\t\t\tdist[temp] = dist[popped] + 1;\n\t\t\t\tif( dist[temp] > SEARCH_RADIUS ) {\n\t\t\t\t\tstop = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tq.push( temp );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n#include <babylon\/asio\/asio.h>\n#include <babylon\/misc\/string_tools.h>\n#include <babylon\/core\/filesystem.h>\n#include <babylon\/babylon_common.h>\n\n#include <thread>\n#include <iostream>\n\nstd::string assets_folder = BABYLON::babylon_repo_folder() + std::string(\"\/assets\/\");\n\nstd::string textUrl = std::string(\"file:\/\") + assets_folder + \"\/fonts\/fa-regular-400.ttf\";\nstd::string binaryUrl = std::string(\"file:\/\") + assets_folder\n  + \"\/glTF-Sample-Models\/2.0\/AntiqueCamera\/glTF\/camera_camera_Normal.png\";\nstd::string nonExistingFileUrl = \"file:\/non_existing_file\";\n\nstd::vector<std::string> textFilesUrls = {\n  textUrl, nonExistingFileUrl, textUrl, textUrl, nonExistingFileUrl, textUrl, nonExistingFileUrl\n};\n\nstd::vector<std::string> binaryFilesUrls  = {\n  binaryUrl, nonExistingFileUrl, binaryUrl, binaryUrl, nonExistingFileUrl, binaryUrl, nonExistingFileUrl\n};\n\nvoid SampleApplicationLoop()\n{\n  auto mainThreadId = std::this_thread::get_id();\n\n  int nb_success_text = 0;\n  int nb_success_binary = 0;\n  int nb_error = 0;\n  int nb_calls_to_progress = 0;\n\n  \/\/ Sample callbacks that will be called *synchronously*\n  auto onSuccessText = [&nb_success_text, mainThreadId](const std::string& \/*textContent*\/) {\n    auto thisThreadId = std::this_thread::get_id();\n    EXPECT_EQ(thisThreadId, mainThreadId);\n    ++nb_success_text;\n  };\n  auto onSuccessBinary = [&nb_success_binary, mainThreadId](const BABYLON::ArrayBuffer& \/*data*\/) {\n    auto thisThreadId = std::this_thread::get_id();\n    EXPECT_EQ(thisThreadId, mainThreadId);\n    ++nb_success_binary;\n  };\n  auto onError = [&nb_error, mainThreadId](const std::string& message) {\n    auto thisThreadId = std::this_thread::get_id();\n    EXPECT_EQ(thisThreadId, mainThreadId);\n    ++nb_error;\n    std::cout << \"onError: \"<< message << \"\\n\";\n  };\n  auto onProgress = [&nb_calls_to_progress, mainThreadId](bool \/*lengthComputable*\/, size_t \/*loaded*\/, size_t \/*total*\/) {\n    auto thisThreadId = std::this_thread::get_id();\n    EXPECT_EQ(thisThreadId, mainThreadId);\n    ++nb_calls_to_progress;\n  };\n\n\n  \/\/ Sample application main loop\n  bool applicationShallExit = false;\n  while(!applicationShallExit)\n  {\n    if (!textFilesUrls.empty())\n    {\n      std::string url = textFilesUrls.back();\n      textFilesUrls.pop_back();\n      BABYLON::asio::LoadAssetAsync_Text(url, onSuccessText, onError, onProgress);\n    }\n    if (!binaryFilesUrls.empty())\n    {\n      std::string url = binaryFilesUrls.back();\n      binaryFilesUrls.pop_back();\n      BABYLON::asio::LoadAssetAsync_Binary(url, onSuccessBinary, onError, onProgress);\n    }\n\n    applicationShallExit =\n      textFilesUrls.empty() && binaryFilesUrls.empty() && ! BABYLON::asio::HasRemainingTasks();\n\n    \/\/ Remember to call asio::HeartBeat_Sync() in your application main loop:\n    \/\/ if there are pending callbacks, this will call the first one *synchronously*\n    BABYLON::asio::HeartBeat_Sync();\n  };\n\n  EXPECT_EQ(nb_success_text, 4);\n  EXPECT_EQ(nb_success_binary, 4);\n  EXPECT_EQ(nb_error, 6);\n  EXPECT_GT(nb_calls_to_progress, 10);\n\/\/  printf(\"nb_success_text=%i, nb_success_binary=%i, nb_error=%i nb_calls_to_progress=%i\\n\",\n\/\/    nb_success_text, nb_success_binary, nb_error, nb_calls_to_progress);\n}\n\nTEST(async_requests, SampleApplicationLoop)\n{\n#ifndef _WIN32\n  std::cout << \"isFile(\" <<  textUrl.substr(6) << \") => \" << BABYLON::Filesystem::isFile(textUrl.substr(6)) << \"\\n\";\n  std::cout << \"isFile(\" <<  binaryUrl.substr(6) << \") => \" << BABYLON::Filesystem::isFile(binaryUrl.substr(6)) << \"\\n\";\n  SampleApplicationLoop();\n  BABYLON::asio::Service_Stop();\n#endif \/\/ _WIN32\n}\n\nTEST(async_requests, LoadText)\n{\n#if 0 \/\/ This code works, but features no real google test call\n  std::cout << \"\\n\";\n  auto onSuccessText = [](const std::string& textContent) {\n    std::cout << \"\\n==>\\n\" << textContent << \"\\n<==\\n\";\n  };\n  auto onError = [](const std::string& message) {\n    std::cout << \"Error:\" << message << \"!!!\\n\";\n  };\n  auto onProgress = [](bool lengthComputable, size_t loaded, size_t total) {\n    std::cout << \"onProgress \" << loaded << \" \/ \" << total << \" lengthComputable: \" << lengthComputable << \"\\n\";\n  };\n\n  BABYLON::asio::LoadUrlAsync_Text(textUrl, onSuccessText, onError, onProgress);\n  BABYLON::asio::Service_WaitAll_Sync();\n#endif\n}\n<commit_msg>fix asio_test<commit_after>#include <gtest\/gtest.h>\n#include <babylon\/asio\/asio.h>\n#include <babylon\/misc\/string_tools.h>\n#include <babylon\/core\/filesystem.h>\n#include <babylon\/babylon_common.h>\n\n#include <thread>\n#include <iostream>\n\nstd::string textUrl = \"fonts\/fa-regular-400.ttf\";\nstd::string binaryUrl = \"glTF-Sample-Models\/2.0\/AntiqueCamera\/glTF\/camera_camera_Normal.png\";\nstd::string nonExistingFileUrl = \"non_existing_file\";\n\nstd::vector<std::string> textFilesUrls = {\n  textUrl, nonExistingFileUrl, textUrl, textUrl, nonExistingFileUrl, textUrl, nonExistingFileUrl\n};\n\nstd::vector<std::string> binaryFilesUrls  = {\n  binaryUrl, nonExistingFileUrl, binaryUrl, binaryUrl, nonExistingFileUrl, binaryUrl, nonExistingFileUrl\n};\n\nvoid SampleApplicationLoop()\n{\n  auto mainThreadId = std::this_thread::get_id();\n\n  int nb_success_text = 0;\n  int nb_success_binary = 0;\n  int nb_error = 0;\n  int nb_calls_to_progress = 0;\n\n  \/\/ Sample callbacks that will be called *synchronously*\n  auto onSuccessText = [&nb_success_text, mainThreadId](const std::string& \/*textContent*\/) {\n    auto thisThreadId = std::this_thread::get_id();\n    EXPECT_EQ(thisThreadId, mainThreadId);\n    ++nb_success_text;\n  };\n  auto onSuccessBinary = [&nb_success_binary, mainThreadId](const BABYLON::ArrayBuffer& \/*data*\/) {\n    auto thisThreadId = std::this_thread::get_id();\n    EXPECT_EQ(thisThreadId, mainThreadId);\n    ++nb_success_binary;\n  };\n  auto onError = [&nb_error, mainThreadId](const std::string& message) {\n    auto thisThreadId = std::this_thread::get_id();\n    EXPECT_EQ(thisThreadId, mainThreadId);\n    ++nb_error;\n    std::cout << \"onError: \"<< message << \"\\n\";\n  };\n  auto onProgress = [&nb_calls_to_progress, mainThreadId](bool \/*lengthComputable*\/, size_t \/*loaded*\/, size_t \/*total*\/) {\n    auto thisThreadId = std::this_thread::get_id();\n    EXPECT_EQ(thisThreadId, mainThreadId);\n    ++nb_calls_to_progress;\n  };\n\n\n  \/\/ Sample application main loop\n  bool applicationShallExit = false;\n  while(!applicationShallExit)\n  {\n    if (!textFilesUrls.empty())\n    {\n      std::string url = textFilesUrls.back();\n      textFilesUrls.pop_back();\n      BABYLON::asio::LoadAssetAsync_Text(url, onSuccessText, onError, onProgress);\n    }\n    if (!binaryFilesUrls.empty())\n    {\n      std::string url = binaryFilesUrls.back();\n      binaryFilesUrls.pop_back();\n      BABYLON::asio::LoadAssetAsync_Binary(url, onSuccessBinary, onError, onProgress);\n    }\n\n    applicationShallExit =\n      textFilesUrls.empty() && binaryFilesUrls.empty() && ! BABYLON::asio::HasRemainingTasks();\n\n    \/\/ Remember to call asio::HeartBeat_Sync() in your application main loop:\n    \/\/ if there are pending callbacks, this will call the first one *synchronously*\n    BABYLON::asio::HeartBeat_Sync();\n  };\n\n  EXPECT_EQ(nb_success_text, 4);\n  EXPECT_EQ(nb_success_binary, 4);\n  EXPECT_EQ(nb_error, 6);\n  EXPECT_GT(nb_calls_to_progress, 10);\n\/\/  printf(\"nb_success_text=%i, nb_success_binary=%i, nb_error=%i nb_calls_to_progress=%i\\n\",\n\/\/    nb_success_text, nb_success_binary, nb_error, nb_calls_to_progress);\n}\n\nTEST(async_requests, SampleApplicationLoop)\n{\n#ifndef _WIN32\n  std::cout << \"isFile(\" <<  textUrl.substr(6) << \") => \" << BABYLON::Filesystem::isFile(textUrl.substr(6)) << \"\\n\";\n  std::cout << \"isFile(\" <<  binaryUrl.substr(6) << \") => \" << BABYLON::Filesystem::isFile(binaryUrl.substr(6)) << \"\\n\";\n  SampleApplicationLoop();\n  BABYLON::asio::Service_Stop();\n#endif \/\/ _WIN32\n}\n\nTEST(async_requests, LoadText)\n{\n#if 0 \/\/ This code works, but features no real google test call\n  std::cout << \"\\n\";\n  auto onSuccessText = [](const std::string& textContent) {\n    std::cout << \"\\n==>\\n\" << textContent << \"\\n<==\\n\";\n  };\n  auto onError = [](const std::string& message) {\n    std::cout << \"Error:\" << message << \"!!!\\n\";\n  };\n  auto onProgress = [](bool lengthComputable, size_t loaded, size_t total) {\n    std::cout << \"onProgress \" << loaded << \" \/ \" << total << \" lengthComputable: \" << lengthComputable << \"\\n\";\n  };\n\n  BABYLON::asio::LoadUrlAsync_Text(textUrl, onSuccessText, onError, onProgress);\n  BABYLON::asio::Service_WaitAll_Sync();\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"StdAfx.h\"\r\n#include \"WebBrowserHelper.h\"\r\n#include <sstream>\r\n#include <iomanip>\r\n#include <WinInet.h>\r\n\r\nusing namespace Utilities::WebBrowser;\r\n\r\nWebBrowserHelper::WebBrowserHelper(void)\r\n{\r\n}\r\n\r\n\r\nWebBrowserHelper::~WebBrowserHelper(void)\r\n{\r\n}\r\n\r\nint WebBrowserHelper::ClearCache()\r\n{\r\n\/\/ Pointer to a GROUPID variable\r\n\tGROUPID groupId = 0;\r\n\t\r\n\t\/\/ Local variables\r\n\tDWORD cacheEntryInfoBufferSizeInitial = 0;\r\n    DWORD cacheEntryInfoBufferSize = 0;\r\n    int *cacheEntryInfoBuffer = 0;\r\n    INTERNET_CACHE_ENTRY_INFO *internetCacheEntry;\r\n    HANDLE enumHandle = NULL;\r\n    BOOL returnValue = false;\r\n\r\n\t\/\/ Delete the groups first.\r\n    \/\/ Groups may not always exist on the system.\r\n    \/\/ For more information, visit the following Microsoft Web site:\r\n    \/\/ http:\/\/msdn2.microsoft.com\/en-us\/library\/ms909365.aspx\t\t\t\r\n    \/\/ By default, a URL does not belong to any group. Therefore, that cache may become\r\n    \/\/ empty even when the CacheGroup APIs are not used because the existing URL does not belong to any group.\t\t\t\r\n    enumHandle = FindFirstUrlCacheGroup(0, CACHEGROUP_SEARCH_ALL, 0, 0, &groupId, 0);\r\n\r\n\t\/\/ If there are no items in the Cache, you are finished.\r\n\tif (enumHandle != NULL && ERROR_NO_MORE_ITEMS == GetLastError())\r\n\t\treturn 0;\r\n\t\r\n\t\/\/ Loop through Cache Group, and then delete entries.\r\n\tif (enumHandle != NULL)\r\n\t{\r\n\t\twhile (groupId != NULL)\r\n\t\t{\r\n\t\t\t\/\/ Delete a particular Cache Group.\r\n\t\t\treturnValue = DeleteUrlCacheGroup(groupId, CACHEGROUP_FLAG_FLUSHURL_ONDELETE, 0);\r\n\t\t\r\n\t\t\tif (!returnValue && ERROR_FILE_NOT_FOUND == GetLastError())\r\n\t\t\t{\t\r\n\t\t\t\treturnValue = FindNextUrlCacheGroup(enumHandle, &groupId, 0);\r\n\t\t\t}\r\n\t\t\r\n\t\t\tif (!returnValue && (ERROR_NO_MORE_ITEMS == GetLastError() || ERROR_FILE_NOT_FOUND == GetLastError()))\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\t \/\/ Start to delete URLs that do not belong to any group.\r\n\tenumHandle = FindFirstUrlCacheEntry(NULL, 0, &cacheEntryInfoBufferSizeInitial);\r\n\tif (enumHandle == NULL && ERROR_NO_MORE_ITEMS == GetLastError())\r\n\t\treturn 0;\r\n\t\r\n\tcacheEntryInfoBufferSize = cacheEntryInfoBufferSizeInitial;\r\n\tinternetCacheEntry =  (INTERNET_CACHE_ENTRY_INFO*)malloc(cacheEntryInfoBufferSize);\r\n\tenumHandle = FindFirstUrlCacheEntry(NULL, internetCacheEntry, &cacheEntryInfoBufferSizeInitial);\r\n\tif (enumHandle != NULL)\r\n\t{\r\n\t\twhile (internetCacheEntry != NULL)\r\n\t\t{\r\n\t\t\tcacheEntryInfoBufferSizeInitial = cacheEntryInfoBufferSize;\t\t\r\n\t\t\treturnValue = DeleteUrlCacheEntry(internetCacheEntry->lpszSourceUrlName);\t\t\t\t\r\n\t\t\r\n\t\t\tif (!returnValue)\r\n\t\t\t{\t\r\n\t\t\t\treturnValue = FindNextUrlCacheEntry(enumHandle, internetCacheEntry, &cacheEntryInfoBufferSizeInitial);\r\n\t\t\t}\r\n\t\t\r\n\t\t\tDWORD dwError = GetLastError();\r\n\t\t\tif (!returnValue && ERROR_NO_MORE_ITEMS == dwError)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\t\t\t\r\n\t\t\r\n\t\t\tif (!returnValue && cacheEntryInfoBufferSizeInitial > cacheEntryInfoBufferSize)\r\n\t\t\t{\r\n\t\t\t\tcacheEntryInfoBufferSize = cacheEntryInfoBufferSizeInitial;\r\n\t\t\t\tinternetCacheEntry =  (INTERNET_CACHE_ENTRY_INFO*)realloc(internetCacheEntry, cacheEntryInfoBufferSize);\r\n\t\t\t\treturnValue = FindNextUrlCacheEntry(enumHandle, internetCacheEntry, &cacheEntryInfoBufferSizeInitial);\t\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tfree(internetCacheEntry);\r\n\treturn 0;\r\n}\r\n\r\nstd::wstring WebBrowserHelper::hexencode(const std::wstring& input)\r\n{\r\n\tstd::wostringstream ssOut;\r\n    ssOut << std::setbase(16);\r\n    for(std::wstring::const_iterator i = input.begin(); i != input.end(); ++i)\r\n    {\r\n        if(isalnum(*i))\r\n            ssOut << *i;\r\n        else\r\n            ssOut << '%' << std::setw(2) << ((unsigned int)(unsigned char)*i);\r\n    }\r\n    return ssOut.str();\r\n}<commit_msg>Modify MS ClearCache procedure to fix infinite loop<commit_after>#include \"StdAfx.h\"\r\n#include \"WebBrowserHelper.h\"\r\n#include <sstream>\r\n#include <iomanip>\r\n#include <WinInet.h>\r\n\r\nusing namespace Utilities::WebBrowser;\r\n\r\nWebBrowserHelper::WebBrowserHelper(void)\r\n{\r\n}\r\n\r\n\r\nWebBrowserHelper::~WebBrowserHelper(void)\r\n{\r\n}\r\n\r\nint WebBrowserHelper::ClearCache()\r\n{\r\n\t\/\/ Pointer to a GROUPID variable\r\n\tGROUPID groupId = 0;\r\n\t\r\n\t\/\/ Local variables\r\n\tDWORD cacheEntryInfoBufferSizeInitial = 0;\r\n    DWORD cacheEntryInfoBufferSize = 0;\r\n    int *cacheEntryInfoBuffer = 0;\r\n    INTERNET_CACHE_ENTRY_INFO *internetCacheEntry;\r\n    HANDLE enumHandle = NULL;\r\n    BOOL returnValue = false;\r\n\r\n\t\/\/ Delete the groups first.\r\n    \/\/ Groups may not always exist on the system.\r\n    \/\/ For more information, visit the following Microsoft Web site:\r\n    \/\/ http:\/\/msdn2.microsoft.com\/en-us\/library\/ms909365.aspx\t\t\t\r\n    \/\/ By default, a URL does not belong to any group. Therefore, that cache may become\r\n    \/\/ empty even when the CacheGroup APIs are not used because the existing URL does not belong to any group.\t\t\t\r\n    enumHandle = FindFirstUrlCacheGroup(0, CACHEGROUP_SEARCH_ALL, 0, 0, &groupId, 0);\r\n\r\n\t\/\/ If there are no items in the Cache, you are finished.\r\n\tif (enumHandle != NULL && ERROR_NO_MORE_ITEMS == GetLastError())\r\n\t\treturn 0;\r\n\t\r\n\t\/\/ Loop through Cache Group, and then delete entries.\r\n\tif (enumHandle != NULL)\r\n\t{\r\n\t\twhile (1)\r\n\t\t{\r\n\t\t\t\/\/ Delete a particular Cache Group.\r\n\t\t\treturnValue = DeleteUrlCacheGroup(groupId, CACHEGROUP_FLAG_FLUSHURL_ONDELETE, 0);\r\n\t\t\r\n\t\t\treturnValue = FindNextUrlCacheGroup(enumHandle, &groupId, 0);\r\n\t\t\t\r\n\t\t\tif (!returnValue)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\t \/\/ Start to delete URLs that do not belong to any group.\r\n\tenumHandle = FindFirstUrlCacheEntry(NULL, 0, &cacheEntryInfoBufferSizeInitial);\r\n\tif (enumHandle == NULL && ERROR_NO_MORE_ITEMS == GetLastError())\r\n\t\treturn 0;\r\n\t\r\n\tcacheEntryInfoBufferSize = cacheEntryInfoBufferSizeInitial;\r\n\tinternetCacheEntry =  (INTERNET_CACHE_ENTRY_INFO*)malloc(cacheEntryInfoBufferSize);\r\n\tenumHandle = FindFirstUrlCacheEntry(NULL, internetCacheEntry, &cacheEntryInfoBufferSizeInitial);\r\n\tif (enumHandle != NULL)\r\n\t{\r\n\t\twhile (1)\r\n\t\t{\r\n\t\t\tcacheEntryInfoBufferSizeInitial = cacheEntryInfoBufferSize;\t\t\r\n\t\t\treturnValue = DeleteUrlCacheEntry(internetCacheEntry->lpszSourceUrlName);\t\t\t\t\r\n\t\t\r\n\t\t\t\/\/ Allows try to get the next entry\r\n\t\t\treturnValue = FindNextUrlCacheEntry(enumHandle, internetCacheEntry, &cacheEntryInfoBufferSizeInitial);\r\n\t\t\t\r\n\t\t\tDWORD dwError = GetLastError();\r\n\t\t\tif (!returnValue && ERROR_NO_MORE_ITEMS == dwError)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\t\t\t\r\n\t\t\r\n\t\t\tif (!returnValue && cacheEntryInfoBufferSizeInitial > cacheEntryInfoBufferSize)\r\n\t\t\t{\r\n\t\t\t\tcacheEntryInfoBufferSize = cacheEntryInfoBufferSizeInitial;\r\n\t\t\t\tinternetCacheEntry =  (INTERNET_CACHE_ENTRY_INFO*)realloc(internetCacheEntry, cacheEntryInfoBufferSize);\r\n\t\t\t\treturnValue = FindNextUrlCacheEntry(enumHandle, internetCacheEntry, &cacheEntryInfoBufferSizeInitial);\t\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tfree(internetCacheEntry);\r\n\treturn 0;\r\n}\r\n\r\nstd::wstring WebBrowserHelper::hexencode(const std::wstring& input)\r\n{\r\n\tstd::wostringstream ssOut;\r\n    ssOut << std::setbase(16);\r\n    for(std::wstring::const_iterator i = input.begin(); i != input.end(); ++i)\r\n    {\r\n        if(isalnum(*i))\r\n            ssOut << *i;\r\n        else\r\n            ssOut << '%' << std::setw(2) << ((unsigned int)(unsigned char)*i);\r\n    }\r\n    return ssOut.str();\r\n}<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkGenericDataSetTessellator.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 \"vtkGenericDataSetTessellator.h\"\n\n#include \"vtkObjectFactory.h\"\n#include \"vtkUnstructuredGrid.h\"\n#include \"vtkPointData.h\"\n#include \"vtkTetra.h\"\n#include \"vtkCellArray.h\"\n#include \"vtkUnsignedCharArray.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkMergePoints.h\"\n#include \"vtkGenericDataSet.h\"\n#include \"vtkGenericCellIterator.h\"\n#include \"vtkGenericAdaptorCell.h\"\n\nvtkCxxRevisionMacro(vtkGenericDataSetTessellator, \"1.2\");\nvtkStandardNewMacro(vtkGenericDataSetTessellator);\n\n\/\/----------------------------------------------------------------------------\n\/\/\nvtkGenericDataSetTessellator::vtkGenericDataSetTessellator()\n{\n}\n\n\/\/----------------------------------------------------------------------------\nvtkGenericDataSetTessellator::~vtkGenericDataSetTessellator()\n{\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/\nvoid vtkGenericDataSetTessellator::Execute()\n{\n  vtkDebugMacro(<< \"Executing vtkGenericDataSetTessellator...\");\n\n  vtkGenericDataSet *input = this->GetInput();\n  vtkUnstructuredGrid *output = this->GetOutput();\n  vtkIdType numPts = input->GetNumberOfPoints();\n  vtkIdType numCells = input->GetNumberOfCells();\n  vtkPointData *outputPD = output->GetPointData();\n  vtkCellData *outputCD = output->GetCellData();\n  vtkGenericAdaptorCell *cell;\n  vtkIdType numInserted=0, numNew, i;\n  vtkIdType npts, *pts;\n\n  \/\/ Copy original points and point data\n  vtkPoints *newPts = vtkPoints::New();\n  newPts->Allocate(2*numPts,numPts);\n\n  \/\/ loop over region\n  vtkUnsignedCharArray *types = vtkUnsignedCharArray::New();\n  types->Allocate(numCells);\n  vtkIdTypeArray *locs = vtkIdTypeArray::New();\n  locs->Allocate(numCells);\n  vtkCellArray *conn = vtkCellArray::New();\n  conn->Allocate(numCells);\n\n  vtkGenericCellIterator *cellIt = input->NewCellIterator();\n  for(cellIt->Begin(); !cellIt->IsAtEnd(); cellIt->Next())\n    {\n    cell = cellIt->GetCell();\n    cell->Tessellate(input->GetAttributes(), input->GetTessellator(),\n                     newPts, conn, outputPD, outputCD);\n\n    numNew = conn->GetNumberOfCells() - numInserted;\n    numInserted = conn->GetNumberOfCells();\n    \n    for (i=0; i < numNew; i++) \n      {\n      locs->InsertNextValue(conn->GetTraversalLocation());\n      conn->GetNextCell(npts,pts); \/\/side effect updates traversal location\n      switch (cell->GetDimension())\n        {\n        case 1:\n          types->InsertNextValue(VTK_LINE);\n          break;\n        case 2:\n          types->InsertNextValue(VTK_TRIANGLE);\n          break;\n        case 3:\n          types->InsertNextValue(VTK_TETRA);\n          break;\n        default:\n          vtkErrorMacro(<<\"Bad mojo in data set tessellation\");\n        } \/\/switch\n      } \/\/insert each new cell\n    } \/\/for all cells\n  cellIt->Delete();\n  \n  \/\/ Send to the output\n  output->SetPoints(newPts);\n  output->SetCells(types, locs, conn);\n\n  vtkDebugMacro(<<\"Subdivided \" << numCells << \" cells to produce \"\n                << conn->GetNumberOfCells() << \"new cells\");\n\n  newPts->Delete();\n  types->Delete();\n  locs->Delete();\n  conn->Delete();\n\n  output->Squeeze();  \n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkGenericDataSetTessellator::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n<commit_msg>ERR:Handle progress events and abort<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkGenericDataSetTessellator.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 \"vtkGenericDataSetTessellator.h\"\n\n#include \"vtkObjectFactory.h\"\n#include \"vtkUnstructuredGrid.h\"\n#include \"vtkPointData.h\"\n#include \"vtkTetra.h\"\n#include \"vtkCellArray.h\"\n#include \"vtkUnsignedCharArray.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkMergePoints.h\"\n#include \"vtkGenericDataSet.h\"\n#include \"vtkGenericCellIterator.h\"\n#include \"vtkGenericAdaptorCell.h\"\n\nvtkCxxRevisionMacro(vtkGenericDataSetTessellator, \"1.3\");\nvtkStandardNewMacro(vtkGenericDataSetTessellator);\n\n\/\/----------------------------------------------------------------------------\n\/\/\nvtkGenericDataSetTessellator::vtkGenericDataSetTessellator()\n{\n}\n\n\/\/----------------------------------------------------------------------------\nvtkGenericDataSetTessellator::~vtkGenericDataSetTessellator()\n{\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/\nvoid vtkGenericDataSetTessellator::Execute()\n{\n  vtkDebugMacro(<< \"Executing vtkGenericDataSetTessellator...\");\n\n  vtkGenericDataSet *input = this->GetInput();\n  vtkUnstructuredGrid *output = this->GetOutput();\n  vtkIdType numPts = input->GetNumberOfPoints();\n  vtkIdType numCells = input->GetNumberOfCells();\n  vtkPointData *outputPD = output->GetPointData();\n  vtkCellData *outputCD = output->GetCellData();\n  vtkGenericAdaptorCell *cell;\n  vtkIdType numInserted=0, numNew, i;\n  vtkIdType npts, *pts;\n  int abortExecute=0;\n\n  \/\/ Copy original points and point data\n  vtkPoints *newPts = vtkPoints::New();\n  newPts->Allocate(2*numPts,numPts);\n\n  \/\/ loop over region\n  vtkUnsignedCharArray *types = vtkUnsignedCharArray::New();\n  types->Allocate(numCells);\n  vtkIdTypeArray *locs = vtkIdTypeArray::New();\n  locs->Allocate(numCells);\n  vtkCellArray *conn = vtkCellArray::New();\n  conn->Allocate(numCells);\n\n  vtkGenericCellIterator *cellIt = input->NewCellIterator();\n  vtkIdType updateTime = numCells\/20 + 1;  \/\/ update roughly every 5%\n  vtkIdType count = 0;\n  for(cellIt->Begin(); !cellIt->IsAtEnd() && !abortExecute; cellIt->Next(), count++)\n    {\n    if ( !(count % updateTime) )\n      {\n      this->UpdateProgress((double)count \/ numCells);\n      abortExecute = this->GetAbortExecute();\n      }\n\n    cell = cellIt->GetCell();\n    cell->Tessellate(input->GetAttributes(), input->GetTessellator(),\n                     newPts, conn, outputPD, outputCD);\n\n    numNew = conn->GetNumberOfCells() - numInserted;\n    numInserted = conn->GetNumberOfCells();\n    \n    for (i=0; i < numNew; i++) \n      {\n      locs->InsertNextValue(conn->GetTraversalLocation());\n      conn->GetNextCell(npts,pts); \/\/side effect updates traversal location\n      switch (cell->GetDimension())\n        {\n        case 1:\n          types->InsertNextValue(VTK_LINE);\n          break;\n        case 2:\n          types->InsertNextValue(VTK_TRIANGLE);\n          break;\n        case 3:\n          types->InsertNextValue(VTK_TETRA);\n          break;\n        default:\n          vtkErrorMacro(<<\"Bad mojo in data set tessellation\");\n        } \/\/switch\n      } \/\/insert each new cell\n    } \/\/for all cells\n  cellIt->Delete();\n  \n  \/\/ Send to the output\n  output->SetPoints(newPts);\n  output->SetCells(types, locs, conn);\n\n  vtkDebugMacro(<<\"Subdivided \" << numCells << \" cells to produce \"\n                << conn->GetNumberOfCells() << \"new cells\");\n\n  newPts->Delete();\n  types->Delete();\n  locs->Delete();\n  conn->Delete();\n\n  output->Squeeze();  \n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkGenericDataSetTessellator::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @file SNIIS_Linux.cpp\n\/\/\/ Linux implementation of input\n\n#include \"SNIIS_Linux.h\"\n#include \"SNIIS_Intern.h\"\n\n#if SNIIS_SYSTEM_LINUX\nusing namespace SNIIS;\n#include \"..\/Traumklassen\/TraumBasis.h\"\n\n#include <cstring>\n#include <sstream>\n#include <fcntl.h>\n#include <linux\/input.h>\n\nstatic bool IsBitSet( const uint8_t* bits, size_t i) { return (bits[i\/8] & (1<<(i&7))) != 0; }\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Constructor\nLinuxInput::LinuxInput( Window wnd)\n{\n  mWindow = wnd;\n  mDisplay = nullptr;\n\n  mDisplay = XOpenDisplay( nullptr);\n  if( !mDisplay )\n    throw std::runtime_error( \"Failed to open XDisplay\");\n\n  int event = 0, error = 0;\n  int major = 2, minor = 0;\n  bool isAvailable = (XQueryExtension( mDisplay, \"XInputExtension\", &mXiOpcode, &event, &error) != False\n               && XIQueryVersion( mDisplay, &major, &minor) != BadRequest);\n  if( !isAvailable )\n    throw std::runtime_error( \"Failed to get XInputExtension\");\n\n  \/\/ Register for events\n  XIEventMask evmask;\n  uint8_t mask[] = { 0, 0, 0, 0 };\n  XISetMask( mask, XI_HierarchyChanged);\n  XISetMask( mask, XI_RawMotion);\n  XISetMask( mask, XI_RawButtonPress);\n  XISetMask( mask, XI_RawButtonRelease);\n  XISetMask( mask, XI_RawKeyPress);\n  XISetMask( mask, XI_RawKeyRelease);\n\n  evmask.deviceid = XIAllDevices;\n  evmask.mask_len = sizeof( mask);\n  evmask.mask = mask;\n  auto selwnd = DefaultRootWindow( mDisplay);\n  if( XISelectEvents( mDisplay, selwnd, &evmask, 1) != 0 )\n    throw std::runtime_error( \"Failed to register for XInput2 events\");\n\n  int deviceCount = 0;\n  XIDeviceInfo* devices = XIQueryDevice( mDisplay, XIAllDevices, &deviceCount);\n  for( int i = 0; i < deviceCount; i++ )\n  {\n    \/* We only look at \"slave\" devices. \"Master\" pointers are the logical\n     * cursors, \"slave\" pointers are the hardware that back them.\n     * \"Floating slaves\" are hardware that don't back a cursor.\n     *\/\n\n    switch( devices[i].use )\n    {\n      case XISlavePointer:\n      case XIFloatingSlave:\n      {\n        Traum::Konsole.Log( \"Mouse %d (id %d) - \\\"%s\\\"\", mNumMice, mDevices.size(), devices[i].name);\n\n        \/\/ a mouse. probably. Ignore some common pffft cases\n        if( strstr(devices[i].name, \"XTEST\") != nullptr )\n          break;\n\n        try {\n          auto m = new LinuxMouse( this, mDevices.size(), devices[i]);\n          InputSystemHelper::AddDevice( m);\n          mMiceById[devices[i].deviceid] = m;\n        } catch( std::exception& e)\n        {\n          \/\/ TODO: invent logging\n          Traum::Konsole.Log( \"Exception: %s\", e.what());\n        }\n        break;\n      }\n\n      case XISlaveKeyboard:\n      {\n        Traum::Konsole.Log( \"Keyboard %d (id %d) - \\\"%s\\\"\", mNumKeyboards, mDevices.size(), devices[i].name);\n        \/\/ a keyboard\n        if( strstr(devices[i].name, \"XTEST\") != nullptr )\n          break;\n\n        try {\n          auto k = new LinuxKeyboard( this, mDevices.size(), devices[i]);\n          InputSystemHelper::AddDevice( k);\n          mKeyboardsById[devices[i].deviceid] = k;\n        } catch( std::exception& e)\n        {\n          \/\/ TODO: invent logging\n          Traum::Konsole.Log( \"Exception: %s\", e.what());\n        }\n        break;\n      }\n\n      default:\n        \/\/ pffft.\n        break;\n    }\n  }\n\n  XIFreeDeviceInfo( devices);\n\n  \/\/ use a completely different API for controllers, because XInput would be perfectly capable of supporting\n  \/\/ those, too, but refuses to do so. It enumerates my USB headset as a keyboard, but it does not expose\n  \/\/ my XBox controller. Sometimes I wish to look into the coders' minds and learn what possessed them when\n  \/\/ designing x separate APIs for the same purpose, but each with a different set of flaws.\n\tfor( size_t a = 0; a < 64; ++a )\n\t{\n\t\tstd::stringstream eventPath;\n\t\teventPath << \"\/dev\/input\/event\" << a;\n\t\tint fd = open( eventPath.str().c_str(), O_RDWR |O_NONBLOCK );\n\t\tif( fd == -1 )\n\t\t\tcontinue;\n\n    char tmp[256] = \"Unknown\";\n    if( ioctl( fd, EVIOCGNAME( sizeof( tmp)), tmp) < 0)\n      throw std::runtime_error( \"Could not read device name\");\n\n    Traum::Konsole.Log( \"Controller %d (id %d) - \\\"%s\\\"\", mNumJoysticks, mDevices.size(), &tmp[0]);\n\n    \/\/ check if it's a controller. If we're started with root privileges, we'd get mice and keyboards here, too,\n    \/\/ but we can't rely on it, so we sort those out and only use it for controllers.\n    \/\/ (Side note: mice and keyboards are root-only because you'd otherwise be able to write a keylogger with it.\n    \/\/ It will take a few years until someone will notice that on SteamOS you enter your credit card credentials\n    \/\/ and passwords with a controller. Then it's a viable approach to also spy on the controller, so they'll\n    \/\/ probably make the controllers root-only, too, and this whole mess finally ends up\n    \/\/ in the \"Linux Hall Of Self-Digged Graves\" where it belongs. Sorry for the rant.)\n    uint8_t ev_bits[(EV_MAX+7)\/8];\n    memset( ev_bits, 0, sizeof(ev_bits) );\n\n    \/\/Read \"all\" (hence 0) components of the device\n    if( ioctl( fd, EVIOCGBIT(0, sizeof(ev_bits)), ev_bits) == -1 )\n      throw std::runtime_error( \"Could not read device events features\");\n\n    if( IsBitSet( ev_bits, EV_KEY) )\n    {\n      uint8_t key_bits[(KEY_MAX+7)\/8];\n      memset( key_bits, 0, sizeof(key_bits) );\n\n      if( ioctl( fd, EVIOCGBIT( EV_KEY, sizeof(key_bits)), key_bits) == -1 )\n        throw std::runtime_error( \"Could not read device buttons features\");\n\n      bool isController = false;\n      for( size_t b = 0; b < KEY_MAX; b++ )\n      {\n        if( IsBitSet( key_bits, b) )\n        {\n          \/\/ Check to ensure we find at least one joy only button\n          if( (b >= BTN_JOYSTICK && b < BTN_GAMEPAD) || (b >= BTN_GAMEPAD && b < BTN_DIGI) || (b >= BTN_WHEEL && b < KEY_OK) )\n            isController = true;\n        }\n      }\n\n      if( isController )\n      {\n        try {\n          auto j = new LinuxJoystick( this, mDevices.size(), fd);\n          InputSystemHelper::AddDevice( j);\n        } catch( std::exception& e)\n        {\n          \/\/ TODO: invent logging\n          Traum::Konsole.Log( \"Exception: %s\", e.what());\n        }\n      } else\n      {\n        close( fd);\n      }\n    }\n\t}\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Destructor\nLinuxInput::~LinuxInput()\n{\n  for( auto d : mDevices )\n    delete d;\n\n  if( mDisplay != nullptr )\n    XCloseDisplay( mDisplay);\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Updates the inputs, to be called before handling system messages\nvoid LinuxInput::Update()\n{\n  \/\/ Basis work\n  InputSystem::Update();\n\n  \/\/ begin updating all devices\n  for( auto d : mDevices )\n  {\n    if( auto mouse = dynamic_cast<LinuxMouse*> (d) )\n      mouse->StartUpdate();\n    else if( auto keyboard = dynamic_cast<LinuxKeyboard*> (d) )\n      keyboard->StartUpdate();\n    else if( auto joy = dynamic_cast<LinuxJoystick*> (d) )\n      joy->StartUpdate();\n  }\n\n  \/\/ process XEvents\n  XEvent event;\n\twhile( XPending( mDisplay) > 0 )\n\t{\n\t\tXNextEvent( mDisplay, &event);\n\n    if( event.xcookie.type != GenericEvent )\n      continue;\n    else if( event.xcookie.extension != mXiOpcode )\n      continue;\n    else if( !XGetEventData( mDisplay, &event.xcookie) )\n      continue;\n\n    switch( event.xcookie.evtype )\n    {\n      case XI_RawMotion:\n      case XI_RawButtonPress:\n      case XI_RawButtonRelease:\n      {\n        auto rawev = *((const XIRawEvent *) event.xcookie.data);\n        auto mit = mMiceById.find( rawev.deviceid);\n        if( mit == mMiceById.end() )\n          break;\n        mit->second->HandleEvent( rawev);\n        break;\n      }\n\n      case XI_RawKeyPress:\n      case XI_RawKeyRelease:\n      {\n        auto rawev = *((const XIRawEvent *) event.xcookie.data);\n        auto kit = mKeyboardsById.find( rawev.deviceid);\n        if( kit == mKeyboardsById.end() )\n          break;\n        kit->second->HandleEvent( rawev);\n        break;\n      }\n    }\n\n    XFreeEventData( mDisplay, &event.xcookie);\n  }\n\n  \/\/ update postprocessing\n  for( auto d : mDevices )\n  {\n    if( auto mouse = dynamic_cast<LinuxMouse*> (d) )\n      mouse->EndUpdate();\n  }\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Notifies the input system that the application has lost\/gained focus.\nvoid LinuxInput::InternSetFocus( bool pHasFocus)\n{\n  for( auto d : mDevices )\n  {\n    if( auto k = dynamic_cast<LinuxKeyboard*> (d) )\n      k->SetFocus( mHasFocus);\n    else if( auto m = dynamic_cast<LinuxMouse*> (d) )\n      m->SetFocus( mHasFocus);\n    else if( auto j = dynamic_cast<LinuxJoystick*> (d) )\n      j->SetFocus( mHasFocus);\n  }\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\nvoid LinuxInput::InternSetMouseGrab( bool enabled)\n{\n  \/\/ The Linux XInput2 API is nice to already provide mouse acceleration and all, so all that mouse coordinate cheating\n  \/\/ is simply not necessary. Just grab the mouse and be happy\n  if( enabled )\n  {\n    XGrabPointer( mDisplay, mWindow, True, 0, GrabModeAsync, GrabModeAsync, mWindow, None, CurrentTime);\n  } else\n  {\n    XUngrabPointer( mDisplay, CurrentTime);\n  }\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Initializes the input system with the given InitArgs. When successful, gInstance is not Null.\nbool InputSystem::Initialize(void* pInitArg)\n{\n  if( gInstance )\n    throw std::runtime_error( \"Input already initialized\");\n\n  try\n  {\n    gInstance = new LinuxInput( (Window) pInitArg);\n  } catch( std::exception& )\n  {\n    \/\/ nope\n    gInstance = nullptr;\n    return false;\n  }\n\n  return true;\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Destroys the input system. After returning gInstance is Null again\nvoid InputSystem::Shutdown()\n{\n  delete gInstance;\n  gInstance = nullptr;\n}\n\n#endif \/\/ SNIIS_SYSTEM_LINUX\n<commit_msg>- improved guessing the device type on Linux<commit_after>\/\/\/ @file SNIIS_Linux.cpp\n\/\/\/ Linux implementation of input\n\n#include \"SNIIS_Linux.h\"\n#include \"SNIIS_Intern.h\"\n\n#if SNIIS_SYSTEM_LINUX\nusing namespace SNIIS;\n#include \"..\/Traumklassen\/TraumBasis.h\"\n\n#include <cstring>\n#include <sstream>\n#include <fcntl.h>\n#include <linux\/input.h>\n\nstatic bool IsBitSet( const uint8_t* bits, size_t i) { return (bits[i\/8] & (1<<(i&7))) != 0; }\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Constructor\nLinuxInput::LinuxInput( Window wnd)\n{\n  mWindow = wnd;\n  mDisplay = nullptr;\n\n  mDisplay = XOpenDisplay( nullptr);\n  if( !mDisplay )\n    throw std::runtime_error( \"Failed to open XDisplay\");\n\n  int event = 0, error = 0;\n  int major = 2, minor = 0;\n  bool isAvailable = (XQueryExtension( mDisplay, \"XInputExtension\", &mXiOpcode, &event, &error) != False\n               && XIQueryVersion( mDisplay, &major, &minor) != BadRequest);\n  if( !isAvailable )\n    throw std::runtime_error( \"Failed to get XInputExtension\");\n\n  \/\/ Register for events\n  XIEventMask evmask;\n  uint8_t mask[] = { 0, 0, 0, 0 };\n  XISetMask( mask, XI_HierarchyChanged);\n  XISetMask( mask, XI_RawMotion);\n  XISetMask( mask, XI_RawButtonPress);\n  XISetMask( mask, XI_RawButtonRelease);\n  XISetMask( mask, XI_RawKeyPress);\n  XISetMask( mask, XI_RawKeyRelease);\n\n  evmask.deviceid = XIAllDevices;\n  evmask.mask_len = sizeof( mask);\n  evmask.mask = mask;\n  auto selwnd = DefaultRootWindow( mDisplay);\n  if( XISelectEvents( mDisplay, selwnd, &evmask, 1) != 0 )\n    throw std::runtime_error( \"Failed to register for XInput2 events\");\n\n  int deviceCount = 0;\n  XIDeviceInfo* devices = XIQueryDevice( mDisplay, XIAllDevices, &deviceCount);\n  for( int i = 0; i < deviceCount; i++ )\n  {\n    \/* We only look at \"slave\" devices. \"Master\" pointers are the logical\n     * cursors, \"slave\" pointers are the hardware that back them.\n     * \"Floating slaves\" are hardware that don't back a cursor.\n     *\/\n\n    switch( devices[i].use )\n    {\n      case XISlavePointer:\n      {\n        Traum::Konsole.Log( \"Mouse %d (id %d) - \\\"%s\\\"\", mNumMice, mDevices.size(), devices[i].name);\n\n        \/\/ a mouse. probably. Ignore some common pffft cases\n        if( strstr(devices[i].name, \"XTEST\") != nullptr )\n          break;\n\n        try {\n          auto m = new LinuxMouse( this, mDevices.size(), devices[i]);\n          InputSystemHelper::AddDevice( m);\n          mMiceById[devices[i].deviceid] = m;\n        } catch( std::exception& e)\n        {\n          \/\/ TODO: invent logging\n          Traum::Konsole.Log( \"Exception: %s\", e.what());\n        }\n        break;\n      }\n\n      case XISlaveKeyboard:\n      {\n        Traum::Konsole.Log( \"Keyboard %d (id %d) - \\\"%s\\\"\", mNumKeyboards, mDevices.size(), devices[i].name);\n        \/\/ a keyboard\n        if( strstr(devices[i].name, \"XTEST\") != nullptr )\n          break;\n\n        try {\n          auto k = new LinuxKeyboard( this, mDevices.size(), devices[i]);\n          InputSystemHelper::AddDevice( k);\n          mKeyboardsById[devices[i].deviceid] = k;\n        } catch( std::exception& e)\n        {\n          \/\/ TODO: invent logging\n          Traum::Konsole.Log( \"Exception: %s\", e.what());\n        }\n        break;\n      }\n\n      case XIFloatingSlave:\n      {\n        \/\/ Look through the controls of this device - if we find two absolute axes at 0 and 1, it might be a mouse.\n        \/\/ Otherwise register it as a keyboard.\n        const auto& dev = devices[i];\n        bool isAxisPresent[2] = { false, false };\n        for( int a = 0; a < dev.num_classes; ++a )\n        {\n          auto cl = dev.classes[a];\n          if( cl->type != XIValuatorClass )\n            continue;\n\n          auto vcl = reinterpret_cast<const XIValuatorClassInfo*> (cl);\n          if( vcl->number < 2 && vcl->mode == XIModeAbsolute )\n            isAxisPresent[vcl->number] = true;\n        }\n\n        try {\n          if( isAxisPresent[0] && isAxisPresent[1] )\n          {\n            Traum::Konsole.Log( \"Floating slave \\\"%s\\\", seems to be mouse %d (id %d)\", devices[i].name, mNumMice, mDevices.size());\n            auto m = new LinuxMouse( this, mDevices.size(), dev);\n            InputSystemHelper::AddDevice( m);\n            mMiceById[dev.deviceid] = m;\n          } else\n          {\n            Traum::Konsole.Log( \"Floating slave \\\"%s\\\", seems to be keyboard %d (id %d)\", devices[i].name, mNumKeyboards, mDevices.size());\n            auto k = new LinuxKeyboard( this, mDevices.size(), dev);\n            InputSystemHelper::AddDevice( k);\n            mKeyboardsById[dev.deviceid] = k;\n          }\n        } catch( std::exception& e)\n        {\n          \/\/ TODO: invent logging\n          Traum::Konsole.Log( \"Exception: %s\", e.what());\n        }\n        break;\n      }\n\n      default:\n        \/\/ pffft.\n        Traum::Konsole.Log( \"Unknown device classs %d, ignoring.\", devices[i].use);\n        break;\n    }\n  }\n\n  XIFreeDeviceInfo( devices);\n\n  \/\/ use a completely different API for controllers, because XInput would be perfectly capable of supporting\n  \/\/ those, too, but refuses to do so. It enumerates my USB headset as a keyboard, but it does not expose\n  \/\/ my XBox controller. Sometimes I wish to look into the coders' minds and learn what possessed them when\n  \/\/ designing x separate APIs for the same purpose, but each with a different set of flaws.\n\tfor( size_t a = 0; a < 64; ++a )\n\t{\n\t\tstd::stringstream eventPath;\n\t\teventPath << \"\/dev\/input\/event\" << a;\n\t\tint fd = open( eventPath.str().c_str(), O_RDWR |O_NONBLOCK );\n\t\tif( fd == -1 )\n\t\t\tcontinue;\n\n    char tmp[256] = \"Unknown\";\n    if( ioctl( fd, EVIOCGNAME( sizeof( tmp)), tmp) < 0)\n      throw std::runtime_error( \"Could not read device name\");\n\n    Traum::Konsole.Log( \"Controller %d (id %d) - \\\"%s\\\"\", mNumJoysticks, mDevices.size(), &tmp[0]);\n\n    \/\/ check if it's a controller. If we're started with root privileges, we'd get mice and keyboards here, too,\n    \/\/ but we can't rely on it, so we sort those out and only use it for controllers.\n    \/\/ (Side note: mice and keyboards are root-only because you'd otherwise be able to write a keylogger with it.\n    \/\/ It will take a few years until someone will notice that on SteamOS you enter your credit card credentials\n    \/\/ and passwords with a controller. Then it's a viable approach to also spy on the controller, so they'll\n    \/\/ probably make the controllers root-only, too, and this whole mess finally ends up\n    \/\/ in the \"Linux Hall Of Self-Digged Graves\" where it belongs. Sorry for the rant.)\n    uint8_t ev_bits[(EV_MAX+7)\/8];\n    memset( ev_bits, 0, sizeof(ev_bits) );\n\n    \/\/Read \"all\" (hence 0) components of the device\n    if( ioctl( fd, EVIOCGBIT(0, sizeof(ev_bits)), ev_bits) == -1 )\n      throw std::runtime_error( \"Could not read device events features\");\n\n    if( IsBitSet( ev_bits, EV_KEY) )\n    {\n      uint8_t key_bits[(KEY_MAX+7)\/8];\n      memset( key_bits, 0, sizeof(key_bits) );\n\n      if( ioctl( fd, EVIOCGBIT( EV_KEY, sizeof(key_bits)), key_bits) == -1 )\n        throw std::runtime_error( \"Could not read device buttons features\");\n\n      bool isController = false;\n      for( size_t b = 0; b < KEY_MAX; b++ )\n      {\n        if( IsBitSet( key_bits, b) )\n        {\n          \/\/ Check to ensure we find at least one joy only button\n          if( (b >= BTN_JOYSTICK && b < BTN_GAMEPAD) || (b >= BTN_GAMEPAD && b < BTN_DIGI) || (b >= BTN_WHEEL && b < KEY_OK) )\n            isController = true;\n        }\n      }\n\n      if( isController )\n      {\n        try {\n          auto j = new LinuxJoystick( this, mDevices.size(), fd);\n          InputSystemHelper::AddDevice( j);\n        } catch( std::exception& e)\n        {\n          \/\/ TODO: invent logging\n          Traum::Konsole.Log( \"Exception: %s\", e.what());\n        }\n      } else\n      {\n        close( fd);\n      }\n    }\n\t}\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Destructor\nLinuxInput::~LinuxInput()\n{\n  for( auto d : mDevices )\n    delete d;\n\n  if( mDisplay != nullptr )\n    XCloseDisplay( mDisplay);\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Updates the inputs, to be called before handling system messages\nvoid LinuxInput::Update()\n{\n  \/\/ Basis work\n  InputSystem::Update();\n\n  \/\/ begin updating all devices\n  for( auto d : mDevices )\n  {\n    if( auto mouse = dynamic_cast<LinuxMouse*> (d) )\n      mouse->StartUpdate();\n    else if( auto keyboard = dynamic_cast<LinuxKeyboard*> (d) )\n      keyboard->StartUpdate();\n    else if( auto joy = dynamic_cast<LinuxJoystick*> (d) )\n      joy->StartUpdate();\n  }\n\n  \/\/ process XEvents\n  XEvent event;\n\twhile( XPending( mDisplay) > 0 )\n\t{\n\t\tXNextEvent( mDisplay, &event);\n\n    if( event.xcookie.type != GenericEvent )\n      continue;\n    else if( event.xcookie.extension != mXiOpcode )\n      continue;\n    else if( !XGetEventData( mDisplay, &event.xcookie) )\n      continue;\n\n    switch( event.xcookie.evtype )\n    {\n      case XI_RawMotion:\n      case XI_RawButtonPress:\n      case XI_RawButtonRelease:\n      {\n        auto rawev = *((const XIRawEvent *) event.xcookie.data);\n        auto mit = mMiceById.find( rawev.deviceid);\n        if( mit == mMiceById.end() )\n          break;\n        mit->second->HandleEvent( rawev);\n        break;\n      }\n\n      case XI_RawKeyPress:\n      case XI_RawKeyRelease:\n      {\n        auto rawev = *((const XIRawEvent *) event.xcookie.data);\n        auto kit = mKeyboardsById.find( rawev.deviceid);\n        if( kit == mKeyboardsById.end() )\n          break;\n        kit->second->HandleEvent( rawev);\n        break;\n      }\n    }\n\n    XFreeEventData( mDisplay, &event.xcookie);\n  }\n\n  \/\/ update postprocessing\n  for( auto d : mDevices )\n  {\n    if( auto mouse = dynamic_cast<LinuxMouse*> (d) )\n      mouse->EndUpdate();\n  }\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Notifies the input system that the application has lost\/gained focus.\nvoid LinuxInput::InternSetFocus( bool pHasFocus)\n{\n  for( auto d : mDevices )\n  {\n    if( auto k = dynamic_cast<LinuxKeyboard*> (d) )\n      k->SetFocus( mHasFocus);\n    else if( auto m = dynamic_cast<LinuxMouse*> (d) )\n      m->SetFocus( mHasFocus);\n    else if( auto j = dynamic_cast<LinuxJoystick*> (d) )\n      j->SetFocus( mHasFocus);\n  }\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\nvoid LinuxInput::InternSetMouseGrab( bool enabled)\n{\n  \/\/ The Linux XInput2 API is nice to already provide mouse acceleration and all, so all that mouse coordinate cheating\n  \/\/ is simply not necessary. Just grab the mouse and be happy\n  if( enabled )\n  {\n    XGrabPointer( mDisplay, mWindow, True, 0, GrabModeAsync, GrabModeAsync, mWindow, None, CurrentTime);\n  } else\n  {\n    XUngrabPointer( mDisplay, CurrentTime);\n  }\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Initializes the input system with the given InitArgs. When successful, gInstance is not Null.\nbool InputSystem::Initialize(void* pInitArg)\n{\n  if( gInstance )\n    throw std::runtime_error( \"Input already initialized\");\n\n  try\n  {\n    gInstance = new LinuxInput( (Window) pInitArg);\n  } catch( std::exception& )\n  {\n    \/\/ nope\n    gInstance = nullptr;\n    return false;\n  }\n\n  return true;\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Destroys the input system. After returning gInstance is Null again\nvoid InputSystem::Shutdown()\n{\n  delete gInstance;\n  gInstance = nullptr;\n}\n\n#endif \/\/ SNIIS_SYSTEM_LINUX\n<|endoftext|>"}
{"text":"<commit_before>#include \"process.h\"\n#include <stdexcept>\n#include <set>\n#include <fstream>\n#include <sstream>\n#include <cstring>\n\n#if defined(__linux__)\n# include <unistd.h>\n# include <sys\/types.h>\n# include <sys\/stat.h>\nnamespace scpak\n{\n    const char pathsep = '\/';\n\n    void createDirectory(const char *path)\n    {\n        int result = mkdir(path, 0777);\n        if (result == -1)\n            throw std::runtime_error(\"failed to create directory: \" + std::string(path));\n    }\n\n    bool directoryExists(const char *path)\n    {\n        return access(path, F_OK) == 0;\n    }\n\n    int getFileSize(const char *path)\n    {\n        unsigned long filesize = -1;\n        struct stat statbuf;\n        if (stat(path, &statbuf) < 0)\n            throw std::runtime_error(\"failed to get stat: \" + std::string(path));\n        filesize = statbuf.st_size;\n        return static_cast<int>(filesize);\n    }\n}\n#elif defined(MSV_VER)\n# include <io.h>\nnamespace scpak\n{\n    const char pathsep = '\\\\';\n\n    void createDirectory(const char *path)\n    {\n        int result = _mkdir(path);\n        if (result == -1)\n            throw std::runtime_error(\"failed to create directory: \" + std::string(path));\n    }\n    bool directoryExists(const char *path)\n    {\n        return _access(path, 0) == 0;\n    }\n}\n#endif\n\nnamespace scpak\n{\n    void unpack(const PakFile &pak, const std::string &dirPath)\n    {\n        std::string dirPathSafe = dirPath;\n        if (*dirPathSafe.rbegin() != pathsep)\n            dirPathSafe += pathsep;\n        \/\/ find all the directories we possibly need to create\n        std::set<std::string> directoriesToCreate;\n        directoriesToCreate.insert(dirPath);\n        for (const PakItem &item : pak.contents())\n        {\n            std::string filePath = dirPathSafe + item.name;\n            std::size_t pend = filePath.rfind(pathsep);\n            if (pend == std::string::npos)\n                continue;\n            std::size_t p = 0;\n            while (p != pend)\n            {\n                p = filePath.find(pathsep, p+1);\n                directoriesToCreate.insert(filePath.substr(0, p));\n            }\n        }\n        \/\/ create directories if necessary\n        for (const std::string &dir : directoriesToCreate)\n            if (!directoryExists(dir.c_str()))\n                createDirectory(dir.c_str());\n        \/\/ unpack contents\n        for (const PakItem &item : pak.contents())\n        {\n            if (std::strcmp(item.type, \"System.String\") == 0)\n            {\n                std::ofstream fout(dirPathSafe + item.name + \".txt\", std::ios::binary);\n                std::stringstream ss(reinterpret_cast<char*>(item.data));\n                BinaryReader reader(&ss);\n                std::string value = reader.readString();\n                fout.write(value.data(), value.length());\n                fout.close();\n            }\n            else if (std::strcmp(item.type, \"System.Xml.Linq.XElement\") == 0)\n            {\n                std::ofstream fout(dirPathSafe + item.name + \".xml\", std::ios::binary);\n                std::stringstream ss(reinterpret_cast<char*>(item.data));\n                BinaryReader reader(&ss);\n                std::string value = reader.readString();\n                fout.write(value.data(), value.length());\n                fout.close();\n            }\n            else\n            {\n                \/\/ just write out raw data\n                std::ofstream fout(dirPathSafe + item.name, std::ios::binary);\n                fout.write(reinterpret_cast<char*>(item.data), item.length);\n                fout.close();\n            }\n        }\n        \/\/ write pakinfo.txt - we need to repack it later\n        std::ofstream fout(dirPathSafe + \"pakinfo.txt\");\n        for (const PakItem &item : pak.contents())\n            fout << item.name << ':' << item.type << std::endl;\n        fout.close();\n    }\n\n    PakFile pack(const std::string &dirPath)\n    {\n        PakFile pak;\n        std::vector<PakItem> contents = pak.contents();\n        std::string dirPathSafe = dirPath;\n        if (*dirPathSafe.rbegin() != pathsep)\n            dirPathSafe += pathsep;\n        std::ifstream fPakInfo(dirPathSafe + \"pakinfo.txt\");\n        std::string line;\n        int lineNumber = 1;\n        while(std::getline(fPakInfo, line))\n        {\n            std::size_t p = line.find(':');\n            if (p == std::string::npos)\n            {\n                std::stringstream ss;\n                ss << \"cannot parse pakinfo.txt, line \" << lineNumber;\n                throw std::runtime_error(ss.str());\n            }\n            std::string name = line.substr(0, p);\n            std::string type = line.substr(p+1, std::string::npos);\n            PakItem item;\n            item.name = new char[name.length()+1];\n            strcpy(item.name, name.c_str());\n            item.type = new char[type.length()+1];\n            strcpy(item.type, type.c_str());\n            if (type == \"System.String\")\n            {\n                std::string filePath = dirPathSafe + name + \".txt\";\n                int fileSize = getFileSize(filePath.c_str());\n                std::ifstream file(filePath, std::ios::binary);\n                item.data = new byte[fileSize+5];\n                std::stringstream ss(reinterpret_cast<char*>(item.data));\n                BinaryWriter writer(&ss);\n                writer.write7BitEncodedInt(fileSize);\n                item.length = fileSize + ss.tellp();\n                file.read(reinterpret_cast<char*>(item.data+ss.tellp()), fileSize);\n                file.close();\n            }\n            else if (type == \"System.Xml.Linq.XElement\")\n            {\n                std::string filePath = dirPathSafe + name + \".xml\";\n                int fileSize = getFileSize(filePath.c_str());\n                std::ifstream file(filePath, std::ios::binary);\n                item.data = new byte[fileSize+5];\n                std::stringstream ss(reinterpret_cast<char*>(item.data));\n                BinaryWriter writer(&ss);\n                writer.write7BitEncodedInt(fileSize);\n                item.length = fileSize + ss.tellp();\n                file.read(reinterpret_cast<char*>(item.data+ss.tellp()), fileSize);\n                file.close();\n            }\n            else\n            {\n                std::string filePath = dirPathSafe + name;\n                int fileSize = getFileSize(filePath.c_str());\n                std::ifstream file(filePath, std::ios::binary);\n                item.data = new byte[fileSize];\n                item.length = fileSize;\n                file.read(reinterpret_cast<char*>(item.data), fileSize);\n                file.close();\n            }\n            pak.addItem(std::move(item));\n            ++lineNumber;\n        }\n        fPakInfo.close();\n        return pak;\n    }\n}\n\n<commit_msg>port to win32<commit_after>#include \"process.h\"\n#include <stdexcept>\n#include <set>\n#include <fstream>\n#include <sstream>\n#include <cstring>\n\n#if defined(__linux__)\n# include <unistd.h>\n# include <sys\/types.h>\n# include <sys\/stat.h>\nnamespace scpak\n{\n    const char pathsep = '\/';\n\n    void createDirectory(const char *path)\n    {\n        int result = mkdir(path, 0777);\n        if (result == -1)\n            throw std::runtime_error(\"failed to create directory: \" + std::string(path));\n    }\n\n    bool directoryExists(const char *path)\n    {\n        return access(path, F_OK) == 0;\n    }\n\n    int getFileSize(const char *path)\n    {\n        unsigned long filesize = -1;\n        struct stat statbuf;\n        if (stat(path, &statbuf) < 0)\n            throw std::runtime_error(\"failed to get call stat: \" + std::string(path));\n        filesize = statbuf.st_size;\n        return static_cast<int>(filesize);\n    }\n}\n#elif defined(_WIN32)\n# include <windows.h>\nnamespace scpak\n{\n    const char pathsep = '\\\\';\n\n    void createDirectory(const char *path)\n    {\n\t\tint result = CreateDirectoryA(path, NULL);\n        if (result == 0)\n            throw std::runtime_error(\"failed to get file size: \" + std::string(path));\n    }\n\n    bool directoryExists(const char *path)\n    {\n\t\tWIN32_FIND_DATA FindFileData;\n\t\tHANDLE hFind;\n\t\thFind = FindFirstFileA(path, &FindFileData);\n\t\tif (hFind == INVALID_HANDLE_VALUE)\n\t\t\treturn false;\n\t\telse\n\t\t{\n\t\t\tFindClose(hFind);\n\t\t\treturn true;\n\t\t}\n    }\n\n\tint getFileSize(const char *path)\n\t{\n\t\tWIN32_FIND_DATA fileInfo;\n\t\tHANDLE hFind;\n\t\thFind = FindFirstFileA(path, &fileInfo);\n\t\tif (hFind == INVALID_HANDLE_VALUE)\n\t\t\tthrow std::runtime_error(\"failed get file size: \" + std::string(path));\n\t\tint size = fileInfo.nFileSizeLow;\n\t\tFindClose(hFind);\n\t\treturn size;\n\t}\n}\n#endif\n\nnamespace scpak\n{\n    void unpack(const PakFile &pak, const std::string &dirPath)\n    {\n        std::string dirPathSafe = dirPath;\n        if (*dirPathSafe.rbegin() != pathsep)\n            dirPathSafe += pathsep;\n        \/\/ find all the directories we possibly need to create\n        std::set<std::string> directoriesToCreate;\n        directoriesToCreate.insert(dirPath);\n        for (const PakItem &item : pak.contents())\n        {\n            std::string filePath = dirPathSafe + item.name;\n            std::size_t pend = filePath.rfind(pathsep);\n            if (pend == std::string::npos)\n                continue;\n            std::size_t p = 0;\n            while (p != pend)\n            {\n                p = filePath.find(pathsep, p+1);\n                directoriesToCreate.insert(filePath.substr(0, p));\n            }\n        }\n        \/\/ create directories if necessary\n        for (const std::string &dir : directoriesToCreate)\n            if (!directoryExists(dir.c_str()))\n                createDirectory(dir.c_str());\n        \/\/ unpack contents\n        for (const PakItem &item : pak.contents())\n        {\n            if (std::strcmp(item.type, \"System.String\") == 0)\n            {\n                std::ofstream fout(dirPathSafe + item.name + \".txt\", std::ios::binary);\n                std::stringstream ss(reinterpret_cast<char*>(item.data));\n                BinaryReader reader(&ss);\n                std::string value = reader.readString();\n                fout.write(value.data(), value.length());\n                fout.close();\n            }\n            else if (std::strcmp(item.type, \"System.Xml.Linq.XElement\") == 0)\n            {\n                std::ofstream fout(dirPathSafe + item.name + \".xml\", std::ios::binary);\n                std::stringstream ss(reinterpret_cast<char*>(item.data));\n                BinaryReader reader(&ss);\n                std::string value = reader.readString();\n                fout.write(value.data(), value.length());\n                fout.close();\n            }\n            else\n            {\n                \/\/ just write out raw data\n                std::ofstream fout(dirPathSafe + item.name, std::ios::binary);\n                fout.write(reinterpret_cast<char*>(item.data), item.length);\n                fout.close();\n            }\n        }\n        \/\/ write pakinfo.txt - we need to repack it later\n        std::ofstream fout(dirPathSafe + \"pakinfo.txt\");\n        for (const PakItem &item : pak.contents())\n            fout << item.name << ':' << item.type << std::endl;\n        fout.close();\n    }\n\n    PakFile pack(const std::string &dirPath)\n    {\n        PakFile pak;\n        std::vector<PakItem> contents = pak.contents();\n        std::string dirPathSafe = dirPath;\n        if (*dirPathSafe.rbegin() != pathsep)\n            dirPathSafe += pathsep;\n        std::ifstream fPakInfo(dirPathSafe + \"pakinfo.txt\");\n        std::string line;\n        int lineNumber = 1;\n        while(std::getline(fPakInfo, line))\n        {\n            std::size_t p = line.find(':');\n            if (p == std::string::npos)\n            {\n                std::stringstream ss;\n                ss << \"cannot parse pakinfo.txt, line \" << lineNumber;\n                throw std::runtime_error(ss.str());\n            }\n            std::string name = line.substr(0, p);\n            std::string type = line.substr(p+1, std::string::npos);\n            PakItem item;\n            item.name = new char[name.length()+1];\n            strcpy(item.name, name.c_str());\n            item.type = new char[type.length()+1];\n            strcpy(item.type, type.c_str());\n            if (type == \"System.String\")\n            {\n                std::string filePath = dirPathSafe + name + \".txt\";\n                int fileSize = getFileSize(filePath.c_str());\n                std::ifstream file(filePath, std::ios::binary);\n                item.data = new byte[fileSize+5];\n                std::stringstream ss(reinterpret_cast<char*>(item.data));\n                BinaryWriter writer(&ss);\n                writer.write7BitEncodedInt(fileSize);\n                item.length = fileSize + ss.tellp();\n                file.read(reinterpret_cast<char*>(item.data+ss.tellp()), fileSize);\n                file.close();\n            }\n            else if (type == \"System.Xml.Linq.XElement\")\n            {\n                std::string filePath = dirPathSafe + name + \".xml\";\n                int fileSize = getFileSize(filePath.c_str());\n                std::ifstream file(filePath, std::ios::binary);\n                item.data = new byte[fileSize+5];\n                std::stringstream ss(reinterpret_cast<char*>(item.data));\n                BinaryWriter writer(&ss);\n                writer.write7BitEncodedInt(fileSize);\n                item.length = fileSize + ss.tellp();\n                file.read(reinterpret_cast<char*>(item.data+ss.tellp()), fileSize);\n                file.close();\n            }\n            else\n            {\n                std::string filePath = dirPathSafe + name;\n                int fileSize = getFileSize(filePath.c_str());\n                std::ifstream file(filePath, std::ios::binary);\n                item.data = new byte[fileSize];\n                item.length = fileSize;\n                file.read(reinterpret_cast<char*>(item.data), fileSize);\n                file.close();\n            }\n            pak.addItem(std::move(item));\n            ++lineNumber;\n        }\n        fPakInfo.close();\n        return pak;\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * A set of network utility functions.\n *\n * @date                    December 13, 2014\n * @author                  Joeri HERMANS\n * @version                 0.1\n *\n * Copyright 2014 Joeri HERMANS\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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\/\/ BEGIN Includes. \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ System dependencies.\n#include <cassert>\n#include <cstring>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <sys\/ioctl.h>\n#include <unistd.h>\n#include <netinet\/in.h>\n#include <iostream>\n#include <poll.h>\n#include <netdb.h>\n#include <errno.h>\n\n\/\/ System dependencies.\n#include <ias\/network\/util.h>\n\n\/\/ END Includes. \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint connect( const std::string & address, const std::size_t port ) {\n    struct addrinfo hints;\n    struct addrinfo * results;\n    std::string portString;\n    int result;\n    int fd;\n\n    \/\/ Checking the precondition.\n    assert( !address.empty() && port > 0 );\n\n    result = -1;\n    memset(&hints,0,sizeof hints);\n    hints.ai_family = AF_UNSPEC;\n    hints.ai_socktype = SOCK_STREAM;\n    hints.ai_flags = AI_PASSIVE;\n    portString = std::to_string(port);\n    getaddrinfo(address.c_str(),portString.c_str(),&hints,&results);\n    if( results != nullptr ) {\n        fd = socket(results->ai_family,results->ai_socktype,results->ai_protocol);\n        if( fd >= 0 ) {\n            if( connect(fd,results->ai_addr,results->ai_addrlen) == 0 )\n                result = fd;\n            else\n                close(fd);\n        }\n        freeaddrinfo(results);\n    }\n\n    return ( result );\n}\n\nbool enableKeepAlive( const int fd ) {\n    static const int optval = 1;\n    bool s;\n\n    s = (setsockopt(fd,SOL_SOCKET,SO_KEEPALIVE,&optval,sizeof optval) >= 0);\n\n    return ( s );\n}\n<commit_msg>Add implementation of the disableNagle prototype. Add preconditions.<commit_after>\/**\n * A set of network utility functions.\n *\n * @date                    December 13, 2014\n * @author                  Joeri HERMANS\n * @version                 0.1\n *\n * Copyright 2014 Joeri HERMANS\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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\/\/ BEGIN Includes. \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ System dependencies.\n#include <cassert>\n#include <cstring>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <sys\/ioctl.h>\n#include <unistd.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <iostream>\n#include <poll.h>\n#include <netdb.h>\n#include <errno.h>\n\n\/\/ System dependencies.\n#include <ias\/network\/util.h>\n\n\/\/ END Includes. \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint connect( const std::string & address, const std::size_t port ) {\n    struct addrinfo hints;\n    struct addrinfo * results;\n    std::string portString;\n    int result;\n    int fd;\n\n    \/\/ Checking the precondition.\n    assert( !address.empty() && port > 0 );\n\n    result = -1;\n    memset(&hints,0,sizeof hints);\n    hints.ai_family = AF_UNSPEC;\n    hints.ai_socktype = SOCK_STREAM;\n    hints.ai_flags = AI_PASSIVE;\n    portString = std::to_string(port);\n    getaddrinfo(address.c_str(),portString.c_str(),&hints,&results);\n    if( results != nullptr ) {\n        fd = socket(results->ai_family,results->ai_socktype,results->ai_protocol);\n        if( fd >= 0 ) {\n            if( connect(fd,results->ai_addr,results->ai_addrlen) == 0 )\n                result = fd;\n            else\n                close(fd);\n        }\n        freeaddrinfo(results);\n    }\n\n    return ( result );\n}\n\nbool enableKeepAlive( const int fd ) {\n    static const int optval = 1;\n    bool s;\n\n    s = (setsockopt(fd,SOL_SOCKET,SO_KEEPALIVE,&optval,sizeof optval) >= 0);\n\n    return ( s );\n}\n\nbool disableNagle( const int fd ) {\n    static const int optval = 1;\n    bool s;\n\n    s = (setsockopt(fd,IPPROTO_TCP,TCP_NODELAY,&optval,sizeof optval) >= 0);\n\n    return (s);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/#####################################################################\n\/\/ Class Rotation\n\/\/#####################################################################\n#include <other\/core\/python\/from_python.h>\n#include <other\/core\/array\/convert.h>\n#include <other\/core\/vector\/Matrix.h>\n#include <other\/core\/vector\/Rotation.h>\n#include <other\/core\/python\/numpy.h>\n#include <other\/core\/python\/wrap.h>\nnamespace other{\n\ntypedef real T;\n\n#ifdef OTHER_PYTHON\n\nnamespace {\ntemplate<class TV> struct NumpyDescr<Rotation<TV>>{static PyArray_Descr* d;static PyArray_Descr* descr(){OTHER_ASSERT(d);Py_INCREF(d);return d;}};\ntemplate<class TV> struct NumpyArrayType<Rotation<TV>>{static PyTypeObject* t;static PyTypeObject* type(){OTHER_ASSERT(t);Py_INCREF(t);return t;}};\ntemplate<class TV> struct NumpyIsStatic<Rotation<TV>>:public mpl::true_{};\ntemplate<class TV> struct NumpyRank<Rotation<TV>>:public mpl::int_<0>{};\n\ntemplate<class TV> PyArray_Descr* NumpyDescr<Rotation<TV>>::d;\ntemplate<class TV> PyTypeObject* NumpyArrayType<Rotation<TV>>::t;\n}\n\nstatic void set_rotation_types(PyObject* t2d,PyObject* t3d) {\n  OTHER_ASSERT(PyType_Check(t2d));\n  OTHER_ASSERT(PyType_Check(t3d));\n  PyObject* d2d = PyObject_GetAttrString(t2d,\"dtype\");\n  if (!d2d) throw_python_error();\n  PyObject* d3d = PyObject_GetAttrString(t3d,\"dtype\");\n  if (!d3d) throw_python_error();\n  OTHER_ASSERT(PyArray_DescrCheck(d2d));\n  OTHER_ASSERT(PyArray_DescrCheck(d3d));\n  Py_INCREF(t2d);\n  Py_INCREF(t3d);\n  Py_INCREF(d2d);\n  Py_INCREF(d3d);\n  NumpyArrayType<Rotation<Vector<real,2>>>::t = (PyTypeObject*)t2d;\n  NumpyArrayType<Rotation<Vector<real,3>>>::t = (PyTypeObject*)t3d;\n  NumpyDescr<Rotation<Vector<real,2>>>::d = (PyArray_Descr*)d2d;\n  NumpyDescr<Rotation<Vector<real,3>>>::d = (PyArray_Descr*)d3d;\n}\n\ntemplate<class TV> PyObject* to_python(const Rotation<TV>& q) {\n  return to_numpy(q);\n}\n\ntemplate<class TV> bool rotations_check(PyObject* object) {\n  return PyArray_Check(object) && PyArray_EquivTypes(PyArray_DESCR((PyArrayObject*)object),NumpyDescr<Rotation<TV>>::d);\n}\n\ntemplate<class TV> Rotation<TV> FromPython<Rotation<TV>>::convert(PyObject* object) {\n  if (!rotations_check<TV>(object))\n    throw_array_conversion_error(object,0,0,NumpyDescr<Rotation<TV>>::d);\n  return from_numpy<Rotation<TV>>(object);\n}\n\n#define INSTANTIATE(T,d) \\\n    template OTHER_CORE_EXPORT PyObject* to_python<Vector<T,d>>(const Rotation<Vector<T,d>>&); \\\n    template OTHER_CORE_EXPORT Rotation<Vector<T,d>> FromPython<Rotation<Vector<T,d>>>::convert(PyObject*); \\\n    template OTHER_CORE_EXPORT bool rotations_check<Vector<T,d>>(PyObject*); \\\n    ARRAY_CONVERSIONS(1,Rotation<Vector<T,d>>)\nINSTANTIATE(real,2)\nINSTANTIATE(real,3)\n\ntemplate<class TV> static Rotation<TV> rotation_test(const Rotation<TV>& r) {\n    return r*r;\n}\n\ntemplate<class TV> static Array<Rotation<TV>> rotation_array_test(Array<const Rotation<TV>> r) {\n    Array<Rotation<TV>> rr(r.size());\n    for (int i=0;i<r.size();i++)\n        rr[i] = sqr(r[i]);\n    return rr;\n}\n\nstatic PyObject* rotation_from_matrix(NdArray<const real> A) {\n  OTHER_ASSERT(A.rank()>=2);\n  const int r = A.rank();\n  if (A.shape[r-1]==2 && A.shape[r-2]==2) {\n    NdArray<Rotation<Vector<T,2>>> rs(A.shape.slice_own(0,r-2),false);\n    for (const int i : range(rs.flat.size()))\n      rs.flat[i] = Rotation<Vector<T,2>>(Matrix<real,2>(A.flat.slice(4*i,4*(i+1)).reshape(2,2)));\n    return to_python(rs);\n  } else if (A.shape[r-1]==3 && A.shape[r-2]==3) {\n    NdArray<Rotation<Vector<T,3>>> rs(A.shape.slice_own(0,r-2),false);\n    for (const int i : range(rs.flat.size()))\n      rs.flat[i] = Rotation<Vector<T,3>>(Matrix<real,3>(A.flat.slice(9*i,9*(i+1)).reshape(3,3)));\n    return to_python(rs);\n  } else\n    throw TypeError(format(\"expected 2x2 or 3x3 matrices, got shape %s\",str(A.shape)));\n}\n\n#endif\n}\nusing namespace other;\n\nvoid wrap_rotation() {\n#ifdef OTHER_PYTHON\n  using namespace python;\n  function(\"_set_rotation_types\",set_rotation_types);\n  function(\"rotation_test_2d\",rotation_test<Vector<real,2>>);\n  function(\"rotation_test_3d\",rotation_test<Vector<real,3>>);\n  function(\"rotation_array_test_2d\",rotation_array_test<Vector<real,2>>);\n  function(\"rotation_array_test_3d\",rotation_array_test<Vector<real,3>>);\n  OTHER_FUNCTION(rotation_from_matrix);\n#endif\n}\n<commit_msg>Remove an unnecessary semicolon<commit_after>\/\/#####################################################################\n\/\/ Class Rotation\n\/\/#####################################################################\n#include <other\/core\/python\/from_python.h>\n#include <other\/core\/array\/convert.h>\n#include <other\/core\/vector\/Matrix.h>\n#include <other\/core\/vector\/Rotation.h>\n#include <other\/core\/python\/numpy.h>\n#include <other\/core\/python\/wrap.h>\nnamespace other{\n\ntypedef real T;\n\n#ifdef OTHER_PYTHON\n\nnamespace {\ntemplate<class TV> struct NumpyDescr<Rotation<TV>>{static PyArray_Descr* d;static PyArray_Descr* descr(){OTHER_ASSERT(d);Py_INCREF(d);return d;}};\ntemplate<class TV> struct NumpyArrayType<Rotation<TV>>{static PyTypeObject* t;static PyTypeObject* type(){OTHER_ASSERT(t);Py_INCREF(t);return t;}};\ntemplate<class TV> struct NumpyIsStatic<Rotation<TV>>:public mpl::true_{};\ntemplate<class TV> struct NumpyRank<Rotation<TV>>:public mpl::int_<0>{};\n\ntemplate<class TV> PyArray_Descr* NumpyDescr<Rotation<TV>>::d;\ntemplate<class TV> PyTypeObject* NumpyArrayType<Rotation<TV>>::t;\n}\n\nstatic void set_rotation_types(PyObject* t2d,PyObject* t3d) {\n  OTHER_ASSERT(PyType_Check(t2d));\n  OTHER_ASSERT(PyType_Check(t3d));\n  PyObject* d2d = PyObject_GetAttrString(t2d,\"dtype\");\n  if (!d2d) throw_python_error();\n  PyObject* d3d = PyObject_GetAttrString(t3d,\"dtype\");\n  if (!d3d) throw_python_error();\n  OTHER_ASSERT(PyArray_DescrCheck(d2d));\n  OTHER_ASSERT(PyArray_DescrCheck(d3d));\n  Py_INCREF(t2d);\n  Py_INCREF(t3d);\n  Py_INCREF(d2d);\n  Py_INCREF(d3d);\n  NumpyArrayType<Rotation<Vector<real,2>>>::t = (PyTypeObject*)t2d;\n  NumpyArrayType<Rotation<Vector<real,3>>>::t = (PyTypeObject*)t3d;\n  NumpyDescr<Rotation<Vector<real,2>>>::d = (PyArray_Descr*)d2d;\n  NumpyDescr<Rotation<Vector<real,3>>>::d = (PyArray_Descr*)d3d;\n}\n\ntemplate<class TV> PyObject* to_python(const Rotation<TV>& q) {\n  return to_numpy(q);\n}\n\ntemplate<class TV> bool rotations_check(PyObject* object) {\n  return PyArray_Check(object) && PyArray_EquivTypes(PyArray_DESCR((PyArrayObject*)object),NumpyDescr<Rotation<TV>>::d);\n}\n\ntemplate<class TV> Rotation<TV> FromPython<Rotation<TV>>::convert(PyObject* object) {\n  if (!rotations_check<TV>(object))\n    throw_array_conversion_error(object,0,0,NumpyDescr<Rotation<TV>>::d);\n  return from_numpy<Rotation<TV>>(object);\n}\n\n#define INSTANTIATE(T,d) \\\n    template OTHER_CORE_EXPORT PyObject* to_python<Vector<T,d>>(const Rotation<Vector<T,d>>&); \\\n    template OTHER_CORE_EXPORT Rotation<Vector<T,d>> FromPython<Rotation<Vector<T,d>>>::convert(PyObject*); \\\n    template OTHER_CORE_EXPORT bool rotations_check<Vector<T,d>>(PyObject*); \\\n    ARRAY_CONVERSIONS(1,Rotation<Vector<T,d>>)\nINSTANTIATE(real,2)\nINSTANTIATE(real,3)\n\ntemplate<class TV> static Rotation<TV> rotation_test(const Rotation<TV>& r) {\n    return r*r;\n}\n\ntemplate<class TV> static Array<Rotation<TV>> rotation_array_test(Array<const Rotation<TV>> r) {\n    Array<Rotation<TV>> rr(r.size());\n    for (int i=0;i<r.size();i++)\n        rr[i] = sqr(r[i]);\n    return rr;\n}\n\nstatic PyObject* rotation_from_matrix(NdArray<const real> A) {\n  OTHER_ASSERT(A.rank()>=2);\n  const int r = A.rank();\n  if (A.shape[r-1]==2 && A.shape[r-2]==2) {\n    NdArray<Rotation<Vector<T,2>>> rs(A.shape.slice_own(0,r-2),false);\n    for (const int i : range(rs.flat.size()))\n      rs.flat[i] = Rotation<Vector<T,2>>(Matrix<real,2>(A.flat.slice(4*i,4*(i+1)).reshape(2,2)));\n    return to_python(rs);\n  } else if (A.shape[r-1]==3 && A.shape[r-2]==3) {\n    NdArray<Rotation<Vector<T,3>>> rs(A.shape.slice_own(0,r-2),false);\n    for (const int i : range(rs.flat.size()))\n      rs.flat[i] = Rotation<Vector<T,3>>(Matrix<real,3>(A.flat.slice(9*i,9*(i+1)).reshape(3,3)));\n    return to_python(rs);\n  } else\n    throw TypeError(format(\"expected 2x2 or 3x3 matrices, got shape %s\",str(A.shape)));\n}\n\n#endif\n}\nusing namespace other;\n\nvoid wrap_rotation() {\n#ifdef OTHER_PYTHON\n  using namespace python;\n  function(\"_set_rotation_types\",set_rotation_types);\n  function(\"rotation_test_2d\",rotation_test<Vector<real,2>>);\n  function(\"rotation_test_3d\",rotation_test<Vector<real,3>>);\n  function(\"rotation_array_test_2d\",rotation_array_test<Vector<real,2>>);\n  function(\"rotation_array_test_3d\",rotation_array_test<Vector<real,3>>);\n  OTHER_FUNCTION(rotation_from_matrix)\n#endif\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\/\/ array.hpp\n\/\/ An STL-like structure that resides in video memory.\n\/\/\n\/\/ Author: Scott D. Zuyderduyn, Ph.D. (scott.zuyderduyn@utoronto.ca)\n\/\/----------------------------------------------------------------------------\n\n#pragma once\n#ifndef ECUDA_ARRAY_HPP\n#define ECUDA_ARRAY_HPP\n\n#include <cstddef>\n#include <limits>\n#include <vector>\n#include \"iterators.hpp\"\n\/\/#include <estd\/iterators.hpp>\n#include \"global.hpp\"\n#include \"memory.hpp\"\n\nnamespace ecuda {\n\ntemplate<typename T>\nclass array {\n\npublic:\n\ttypedef T value_type;\n\ttypedef std::size_t size_type;\n\ttypedef std::ptrdiff_t difference_type;\n\ttypedef value_type& reference;\n\ttypedef const value_type& const_reference;\n\ttypedef value_type* pointer;\n\ttypedef const value_type* const_pointer;\n\n\ttypedef ecuda::RandomAccessIterator< array<T> > iterator;\n\ttypedef const ecuda::RandomAccessIterator< const array<T> > const_iterator;\n\/*\npublic:\n\tstruct DevicePayload {\n\t\tsize_type n;\n\t\tdevice_ptr<T> deviceMemory;\n\t};\n*\/\nprivate:\n\tsize_type n;\n\tdevice_ptr<T> deviceMemory; \/\/ video card memory\n\npublic:\n\t__host__ __device__ array( const size_type n=0, const_reference value = T() ) : n(n) {\n\t\t#ifndef __CUDA_ARCH__\n\t\tif( n ) {\n\t\t\tCUDA_CALL( cudaMalloc( deviceMemory.alloc_ptr(), n*sizeof(T) ) );\n\t\t\tstd::vector<T> v( n, value );\n\t\t\tCUDA_CALL( cudaMemcpy( deviceMemory.get(), &v[0], n*sizeof(T), cudaMemcpyHostToDevice ) );\n\t\t}\n\t\t#endif\n\t}\n\t__host__ array( const array<T>& src ) : n(src.n) {\n\t\tif( n ) {\n\t\t\tCUDA_CALL( cudaMalloc( deviceMemory.alloc_ptr(), n*sizeof(T) ) );\n\t\t\tCUDA_CALL( cudaMemcpy( deviceMemory.get(), src.deviceMemory.get(), n*sizeof(T), cudaMemcpyDeviceToDevice ) );\n\t\t}\n\t}\n\t__host__ array( const std::vector<T>& src ) : n(src.size()) {\n\t\tif( n ) {\n\t\t\tCUDA_CALL( cudaMalloc( deviceMemory.alloc_ptr(), n*sizeof(T) ) );\n\t\t\tCUDA_CALL( cudaMemcpy( deviceMemory.get(), &src[0], n*sizeof(T), cudaMemcpyHostToDevice ) );\n\t\t}\n\t}\n\t\/*\n\t__host__ array( const T* sourcePtr, const size_type n=0 ) : n(n) {\n\t\tif( n ) {\n\t\t\tCUDA_CALL( cudaMalloc( deviceMemory.alloc_ptr(), n*sizeof(T) ) );\n\t\t\tCUDA_CALL( cudaMemcpy( deviceMemory.get(), sourcePtr, n*sizeof(T), cudaMemcpyHostToDevice ) );\n\t\t}\n\t}\n\t*\/\n\n\t\/\/__device__ array( const DevicePayload& devicePayload ) : n(devicePayload.n), deviceMemory(devicePayload.deviceMemory) {}\n\n\t__host__ __device__ virtual ~array() {}\n\n\t__device__ reference at( size_type index ) { return deviceMemory[index]; }\n\t__device__ reference operator[]( size_type index ) { return deviceMemory[index]; }\n\t__device__ const_reference at( size_type index ) const { return deviceMemory[index]; }\n\t__device__ const_reference operator[]( size_type index ) const { return deviceMemory[index]; }\n\n\t__device__ reference front() { return *deviceMemory; }\n\t__device__ reference back() { return operator[]( size()-1 ); }\n\t__device__ const_reference front() const { return *deviceMemory; }\n\t__device__ const_reference back() const { return operator[]( size()-1 ); }\n\n\t__host__ __device__ size_type size() const { return n; }\n\n\t__device__ iterator begin() { return iterator(*this); }\n\t__device__ iterator end() { return iterator(*this,size()); }\n\t__device__ const_iterator begin() const { return const_iterator(*this); }\n\t__device__ const_iterator end() const { return const_iterator(*this,size()); }\n\n\t__host__ const array<T>& operator>>( std::vector<T>& vector ) const {\n\t\tvector.resize( n );\nstd::cerr << \"copy destination = \" << deviceMemory.get() << std::endl;\nstd::cerr << \"copying device contents of size \" << n << \" [\" << (n*sizeof(T)) << \"] to host vector\" << std::endl;\n\t\tCUDA_CALL( cudaMemcpy( &vector[0], deviceMemory.get(), n*sizeof(T), cudaMemcpyDeviceToHost ) );\nfor( size_t i = 0; i < n; ++i ) std::cerr << \"IN SITU [\" << i << \"]=\" << vector[i] << std::endl;\n\t\treturn *this;\n\t}\n\n\t__device__ array<T>& operator=( const array<T>& other ) {\n\t\tn = other.n;\n\t\tdeviceMemory = other.deviceMemory;\n\t\treturn *this;\n\t}\n\n\t\/*\n\tDevicePayload passToDevice() {\n\t\tDevicePayload payload;\n\t\tpayload.n = n;\n\t\tpayload.deviceMemory = deviceMemory;\n\t\treturn payload;\n\t}\n\t*\/\n\n};\n\n} \/\/ namespace ecuda\n\n#endif\n<commit_msg>working array<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\/\/ array.hpp\n\/\/ An STL-like structure that resides in video memory.\n\/\/\n\/\/ Author: Scott D. Zuyderduyn, Ph.D. (scott.zuyderduyn@utoronto.ca)\n\/\/----------------------------------------------------------------------------\n\n#pragma once\n#ifndef ECUDA_ARRAY_HPP\n#define ECUDA_ARRAY_HPP\n\n#include <cstddef>\n#include <limits>\n#include <vector>\n#include \"iterators.hpp\"\n\/\/#include <estd\/iterators.hpp>\n#include \"global.hpp\"\n#include \"memory.hpp\"\n\nnamespace ecuda {\n\ntemplate<typename T>\nclass array {\n\npublic:\n\ttypedef T value_type;\n\ttypedef std::size_t size_type;\n\ttypedef std::ptrdiff_t difference_type;\n\ttypedef value_type& reference;\n\ttypedef const value_type& const_reference;\n\ttypedef value_type* pointer;\n\ttypedef const value_type* const_pointer;\n\n\ttypedef ecuda::RandomAccessIterator< array<T> > iterator;\n\ttypedef const ecuda::RandomAccessIterator< const array<T> > const_iterator;\n\/*\npublic:\n\tstruct DevicePayload {\n\t\tsize_type n;\n\t\tdevice_ptr<T> deviceMemory;\n\t};\n*\/\nprivate:\n\tsize_type n;\n\tdevice_ptr<T> deviceMemory; \/\/ video card memory\n\npublic:\n\t__host__ __device__ array( const size_type n=0, const_reference value = T() ) : n(n) {\n\t\t#ifndef __CUDA_ARCH__\n\t\tif( n ) {\n\t\t\tCUDA_CALL( cudaMalloc( deviceMemory.alloc_ptr(), n*sizeof(T) ) );\n\t\t\tstd::vector<T> v( n, value );\n\t\t\tCUDA_CALL( cudaMemcpy( deviceMemory.get(), &v[0], n*sizeof(T), cudaMemcpyHostToDevice ) );\n\t\t}\n\t\t#endif\n\t}\n\t__host__ array( const array<T>& src ) : n(src.n), deviceMemory(src.deviceMemory) {\n\t\tstd::cerr << \"performing inplace copy\" << std::endl;\n\/*\n\t\tif( n ) {\n\t\t\tCUDA_CALL( cudaMalloc( deviceMemory.alloc_ptr(), n*sizeof(T) ) );\n\t\t\tCUDA_CALL( cudaMemcpy( deviceMemory.get(), src.deviceMemory.get(), n*sizeof(T), cudaMemcpyDeviceToDevice ) );\n\t\t}\n*\/\n\t}\n\t__host__ array( const std::vector<T>& src ) : n(src.size()) {\n\t\tif( n ) {\n\t\t\tCUDA_CALL( cudaMalloc( deviceMemory.alloc_ptr(), n*sizeof(T) ) );\n\t\t\tCUDA_CALL( cudaMemcpy( deviceMemory.get(), &src[0], n*sizeof(T), cudaMemcpyHostToDevice ) );\n\t\t}\n\t}\n\t\/*\n\t__host__ array( const T* sourcePtr, const size_type n=0 ) : n(n) {\n\t\tif( n ) {\n\t\t\tCUDA_CALL( cudaMalloc( deviceMemory.alloc_ptr(), n*sizeof(T) ) );\n\t\t\tCUDA_CALL( cudaMemcpy( deviceMemory.get(), sourcePtr, n*sizeof(T), cudaMemcpyHostToDevice ) );\n\t\t}\n\t}\n\t*\/\n\n\t\/\/__device__ array( const DevicePayload& devicePayload ) : n(devicePayload.n), deviceMemory(devicePayload.deviceMemory) {}\n\n\t__host__ __device__ virtual ~array() {}\n\n\t__device__ reference at( size_type index ) { return deviceMemory[index]; }\n\t__device__ reference operator[]( size_type index ) { return deviceMemory[index]; }\n\t__device__ const_reference at( size_type index ) const { return deviceMemory[index]; }\n\t__device__ const_reference operator[]( size_type index ) const { return deviceMemory[index]; }\n\n\t__device__ reference front() { return *deviceMemory; }\n\t__device__ reference back() { return operator[]( size()-1 ); }\n\t__device__ const_reference front() const { return *deviceMemory; }\n\t__device__ const_reference back() const { return operator[]( size()-1 ); }\n\n\t__host__ __device__ size_type size() const { return n; }\n\n\t__device__ iterator begin() { return iterator(*this); }\n\t__device__ iterator end() { return iterator(*this,size()); }\n\t__device__ const_iterator begin() const { return const_iterator(*this); }\n\t__device__ const_iterator end() const { return const_iterator(*this,size()); }\n\n\t__host__ const array<T>& operator>>( std::vector<T>& vector ) const {\n\t\tvector.resize( n );\nstd::cerr << \"copy destination = \" << deviceMemory.get() << std::endl;\nstd::cerr << \"copying device contents of size \" << n << \" [\" << (n*sizeof(T)) << \"] to host vector\" << std::endl;\n\t\tCUDA_CALL( cudaMemcpy( &vector[0], deviceMemory.get(), n*sizeof(T), cudaMemcpyDeviceToHost ) );\nfor( size_t i = 0; i < n; ++i ) std::cerr << \"IN SITU [\" << i << \"]=\" << vector[i] << std::endl;\n\t\treturn *this;\n\t}\n\n\t__device__ array<T>& operator=( const array<T>& other ) {\n\t\tn = other.n;\n\t\tdeviceMemory = other.deviceMemory;\n\t\treturn *this;\n\t}\n\n\t\/*\n\tDevicePayload passToDevice() {\n\t\tDevicePayload payload;\n\t\tpayload.n = n;\n\t\tpayload.deviceMemory = deviceMemory;\n\t\treturn payload;\n\t}\n\t*\/\n\n};\n\n} \/\/ namespace ecuda\n\n#endif\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 \"CreatureAI.h\"\n#include \"InstanceScript.h\"\n#include \"ScriptMgr.h\"\n#include \"SpellScript.h\"\n#include \"uldaman.h\"\n\nenum Spells\n{\n    SPELL_ARCHAEDAS_AWAKEN      = 10347,\n    SPELL_AWAKEN_VAULT_WALKER   = 10258,\n};\n\nenum Events\n{\n    EVENT_SUB_BOSS_AGGRO        = 2228\n};\n\nclass instance_uldaman : public InstanceMapScript\n{\npublic:\n    instance_uldaman() : InstanceMapScript(\"instance_uldaman\", 70) { }\n\n    struct instance_uldaman_InstanceMapScript : public InstanceScript\n    {\n        instance_uldaman_InstanceMapScript(Map* map) : InstanceScript(map) { }\n\n        void Initialize() override\n        {\n            memset(&_encounters, 0, sizeof(_encounters));\n        }\n\n        void OnGameObjectCreate(GameObject* gameobject) override\n        {\n            switch (gameobject->GetEntry())\n            {\n                case GO_IRONAYA_SEAL_DOOR:\n                case GO_KEYSTONE:\n                    if (_encounters[DATA_IRONAYA_DOORS] == DONE)\n                    {\n                        HandleGameObject(ObjectGuid::Empty, true, gameobject);\n                        gameobject->SetFlag(GAMEOBJECT_FLAGS, GO_FLAG_NOT_SELECTABLE);\n                    }\n                    break;\n                case GO_TEMPLE_DOOR:\n                    if (_encounters[DATA_STONE_KEEPERS] == DONE)\n                        HandleGameObject(ObjectGuid::Empty, true, gameobject);\n                    break;\n                case GO_ANCIENT_VAULT_DOOR:\n                    ancientVaultDoorGUID = gameobject->GetGUID();\n                    if (_encounters[DATA_ARCHAEDAS] == DONE)\n                        HandleGameObject(ObjectGuid::Empty, true, gameobject);\n                    break;\n                case GO_ARCHAEDAS_TEMPLE_DOOR:\n                    archaedasTempleDoorGUID = gameobject->GetGUID();\n                    break;\n            }\n        }\n\n        void SetData(uint32 type, uint32 data) override\n        {\n            switch (type)\n            {\n                case DATA_IRONAYA_DOORS:\n                case DATA_STONE_KEEPERS:\n                    _encounters[type] = data;\n                    break;\n                case DATA_ARCHAEDAS:\n                    _encounters[type] = data;\n                    HandleGameObject(ancientVaultDoorGUID, data == DONE, nullptr);\n                    HandleGameObject(archaedasTempleDoorGUID, data != IN_PROGRESS, nullptr);\n                    break;\n            }\n\n            if (data == DONE)\n                SaveToDB();\n        }\n\n        std::string GetSaveData() override\n        {\n            std::ostringstream saveStream;\n            saveStream << \"U D \" << _encounters[DATA_IRONAYA_DOORS] << ' ' << _encounters[DATA_STONE_KEEPERS] << ' ' << _encounters[DATA_ARCHAEDAS];\n            return saveStream.str();\n        }\n\n        void Load(const char* in) override\n        {\n            if (!in)\n                return;\n\n            char dataHead1, dataHead2;\n            std::istringstream loadStream(in);\n            loadStream >> dataHead1 >> dataHead2;\n\n            if (dataHead1 == 'U' && dataHead2 == 'D')\n            {\n                for (uint8 i = 0; i < MAX_ENCOUNTERS; ++i)\n                {\n                    loadStream >> _encounters[i];\n                    if (_encounters[i] == IN_PROGRESS)\n                        _encounters[i] = NOT_STARTED;\n                }\n            }\n        }\n\n        void OnCreatureCreate(Creature* creature) override\n        {\n            switch (creature->GetEntry())\n            {\n                case NPC_STONE_KEEPER:\n                    if (_encounters[DATA_STONE_KEEPERS] != DONE && !creature->IsAlive())\n                        creature->Respawn();\n                    break;\n            }\n        }\n\n    private:\n        uint32 _encounters[MAX_ENCOUNTERS];\n        ObjectGuid archaedasTempleDoorGUID;\n        ObjectGuid ancientVaultDoorGUID;\n    };\n\n    InstanceScript* GetInstanceScript(InstanceMap* map) const override\n    {\n        return new instance_uldaman_InstanceMapScript(map);\n    }\n};\n\nclass spell_uldaman_sub_boss_agro_keepers : public SpellScriptLoader\n{\npublic:\n    spell_uldaman_sub_boss_agro_keepers() : SpellScriptLoader(\"spell_uldaman_sub_boss_agro_keepers\") { }\n\n    class spell_uldaman_sub_boss_agro_keepers_SpellScript : public SpellScript\n    {\n        PrepareSpellScript(spell_uldaman_sub_boss_agro_keepers_SpellScript);\n\n        void HandleSendEvent(SpellEffIndex  \/*effIndex*\/)\n        {\n            if (Creature* keeper = GetCaster()->FindNearestCreature(NPC_STONE_KEEPER, 100.0f, true))\n                keeper->AI()->SetData(1, 1);\n        }\n\n        void Register() override\n        {\n            OnEffectLaunch += SpellEffectFn(spell_uldaman_sub_boss_agro_keepers_SpellScript::HandleSendEvent, EFFECT_0, SPELL_EFFECT_SEND_EVENT);\n        }\n    };\n\n    SpellScript* GetSpellScript() const override\n    {\n        return new spell_uldaman_sub_boss_agro_keepers_SpellScript();\n    }\n};\n\nenum UldamanStonedEnum\n{\n    MAP_ULDAMAN = 70\n};\n\nclass spell_uldaman_stoned : public SpellScriptLoader\n{\npublic:\n    spell_uldaman_stoned() : SpellScriptLoader(\"spell_uldaman_stoned\") { }\n\n    class spell_uldaman_stoned_AuraScript : public AuraScript\n    {\n        PrepareAuraScript(spell_uldaman_stoned_AuraScript);\n\n        bool Load() override\n        {\n            return GetUnitOwner()->GetTypeId() == TYPEID_UNIT && GetUnitOwner()->GetMapId() == MAP_ULDAMAN;\n        }\n\n        void HandleEffectApply(AuraEffect const* \/*aurEff*\/, AuraEffectHandleModes \/*mode*\/)\n        {\n            Creature* target = GetUnitOwner()->ToCreature();\n            target->SetReactState(REACT_PASSIVE);\n            target->SetFlag(UNIT_FIELD_FLAGS, UNIT_FLAG_IMMUNE_TO_PC | UNIT_FLAG_IMMUNE_TO_NPC);\n        }\n\n        void HandleEffectRemove(AuraEffect const* \/*aurEff*\/, AuraEffectHandleModes \/*mode*\/)\n        {\n            Creature* target = GetUnitOwner()->ToCreature();\n            target->SetReactState(REACT_AGGRESSIVE);\n            target->RemoveFlag(UNIT_FIELD_FLAGS, UNIT_FLAG_IMMUNE_TO_PC | UNIT_FLAG_IMMUNE_TO_NPC);\n        }\n\n        void Register() override\n        {\n            OnEffectApply += AuraEffectApplyFn(spell_uldaman_stoned_AuraScript::HandleEffectApply, EFFECT_0, SPELL_AURA_DUMMY, AURA_EFFECT_HANDLE_REAL);\n            OnEffectRemove += AuraEffectRemoveFn(spell_uldaman_stoned_AuraScript::HandleEffectRemove, EFFECT_0, SPELL_AURA_DUMMY, AURA_EFFECT_HANDLE_REAL);\n        }\n    };\n\n    AuraScript* GetAuraScript() const override\n    {\n        return new spell_uldaman_stoned_AuraScript();\n    }\n};\n\nclass spell_uldaman_boss_agro_archaedas : public SpellScriptLoader\n{\npublic:\n    spell_uldaman_boss_agro_archaedas() : SpellScriptLoader(\"spell_uldaman_boss_agro_archaedas\") { }\n\n    class spell_uldaman_boss_agro_archaedas_SpellScript : public SpellScript\n    {\n        PrepareSpellScript(spell_uldaman_boss_agro_archaedas_SpellScript);\n\n        void HandleSendEvent(SpellEffIndex  \/*effIndex*\/)\n        {\n            InstanceScript* instance = GetCaster()->GetInstanceScript();\n            if (!instance || instance->GetData(DATA_ARCHAEDAS) == IN_PROGRESS)\n                return;\n\n            instance->SetData(DATA_ARCHAEDAS, IN_PROGRESS);\n            if (Creature* archaedas = GetCaster()->FindNearestCreature(NPC_ARCHAEDAS, 100.0f, true))\n                archaedas->AI()->SetData(1, 1);\n        }\n\n        void Register() override\n        {\n            OnEffectLaunch += SpellEffectFn(spell_uldaman_boss_agro_archaedas_SpellScript::HandleSendEvent, EFFECT_0, SPELL_EFFECT_SEND_EVENT);\n        }\n    };\n\n    SpellScript* GetSpellScript() const override\n    {\n        return new spell_uldaman_boss_agro_archaedas_SpellScript();\n    }\n};\n\nvoid AddSC_instance_uldaman()\n{\n    new instance_uldaman();\n    new spell_uldaman_sub_boss_agro_keepers();\n    new spell_uldaman_stoned();\n    new spell_uldaman_boss_agro_archaedas();\n}\n<commit_msg>Fix(Core\/Uldaman): Door behind Archaedas can close after event. (#8024)<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 \"CreatureAI.h\"\n#include \"InstanceScript.h\"\n#include \"ScriptMgr.h\"\n#include \"SpellScript.h\"\n#include \"uldaman.h\"\n\nenum Spells\n{\n    SPELL_ARCHAEDAS_AWAKEN      = 10347,\n    SPELL_AWAKEN_VAULT_WALKER   = 10258,\n};\n\nenum Events\n{\n    EVENT_SUB_BOSS_AGGRO        = 2228\n};\n\nclass instance_uldaman : public InstanceMapScript\n{\npublic:\n    instance_uldaman() : InstanceMapScript(\"instance_uldaman\", 70) { }\n\n    struct instance_uldaman_InstanceMapScript : public InstanceScript\n    {\n        instance_uldaman_InstanceMapScript(Map* map) : InstanceScript(map) { }\n\n        void Initialize() override\n        {\n            memset(&_encounters, 0, sizeof(_encounters));\n        }\n\n        void OnGameObjectCreate(GameObject* gameobject) override\n        {\n            switch (gameobject->GetEntry())\n            {\n                case GO_IRONAYA_SEAL_DOOR:\n                case GO_KEYSTONE:\n                    if (_encounters[DATA_IRONAYA_DOORS] == DONE)\n                    {\n                        HandleGameObject(ObjectGuid::Empty, true, gameobject);\n                        gameobject->SetFlag(GAMEOBJECT_FLAGS, GO_FLAG_NOT_SELECTABLE);\n                    }\n                    break;\n                case GO_TEMPLE_DOOR:\n                    if (_encounters[DATA_STONE_KEEPERS] == DONE)\n                        HandleGameObject(ObjectGuid::Empty, true, gameobject);\n                    break;\n                case GO_ANCIENT_VAULT_DOOR:\n                    ancientVaultDoorGUID = gameobject->GetGUID();\n                    if (_encounters[DATA_ARCHAEDAS] == DONE)\n                        HandleGameObject(ObjectGuid::Empty, true, gameobject);\n                    break;\n                case GO_ARCHAEDAS_TEMPLE_DOOR:\n                    archaedasTempleDoorGUID = gameobject->GetGUID();\n                    break;\n            }\n        }\n\n        void SetData(uint32 type, uint32 data) override\n        {\n            switch (type)\n            {\n                case DATA_IRONAYA_DOORS:\n                case DATA_STONE_KEEPERS:\n                    _encounters[type] = data;\n                    break;\n                case DATA_ARCHAEDAS:\n                    _encounters[type] = data;\n                    HandleGameObject(ancientVaultDoorGUID, data == DONE, nullptr);\n                    HandleGameObject(archaedasTempleDoorGUID, data != IN_PROGRESS, nullptr);\n                    break;\n            }\n\n            if (data == DONE)\n                SaveToDB();\n        }\n\n        uint32 GetData(uint32 data) const override\n        {\n            if (data < MAX_ENCOUNTERS)\n            {\n                return _encounters[data];\n            }\n            return 0;\n        }\n\n        std::string GetSaveData() override\n        {\n            std::ostringstream saveStream;\n            saveStream << \"U D \" << _encounters[DATA_IRONAYA_DOORS] << ' ' << _encounters[DATA_STONE_KEEPERS] << ' ' << _encounters[DATA_ARCHAEDAS];\n            return saveStream.str();\n        }\n\n        void Load(const char* in) override\n        {\n            if (!in)\n                return;\n\n            char dataHead1, dataHead2;\n            std::istringstream loadStream(in);\n            loadStream >> dataHead1 >> dataHead2;\n\n            if (dataHead1 == 'U' && dataHead2 == 'D')\n            {\n                for (uint8 i = 0; i < MAX_ENCOUNTERS; ++i)\n                {\n                    loadStream >> _encounters[i];\n                    if (_encounters[i] == IN_PROGRESS)\n                        _encounters[i] = NOT_STARTED;\n                }\n            }\n        }\n\n        void OnCreatureCreate(Creature* creature) override\n        {\n            switch (creature->GetEntry())\n            {\n                case NPC_STONE_KEEPER:\n                    if (_encounters[DATA_STONE_KEEPERS] != DONE && !creature->IsAlive())\n                        creature->Respawn();\n                    break;\n            }\n        }\n\n    private:\n        uint32 _encounters[MAX_ENCOUNTERS];\n        ObjectGuid archaedasTempleDoorGUID;\n        ObjectGuid ancientVaultDoorGUID;\n    };\n\n    InstanceScript* GetInstanceScript(InstanceMap* map) const override\n    {\n        return new instance_uldaman_InstanceMapScript(map);\n    }\n};\n\nclass spell_uldaman_sub_boss_agro_keepers : public SpellScriptLoader\n{\npublic:\n    spell_uldaman_sub_boss_agro_keepers() : SpellScriptLoader(\"spell_uldaman_sub_boss_agro_keepers\") { }\n\n    class spell_uldaman_sub_boss_agro_keepers_SpellScript : public SpellScript\n    {\n        PrepareSpellScript(spell_uldaman_sub_boss_agro_keepers_SpellScript);\n\n        void HandleSendEvent(SpellEffIndex  \/*effIndex*\/)\n        {\n            if (Creature* keeper = GetCaster()->FindNearestCreature(NPC_STONE_KEEPER, 100.0f, true))\n                keeper->AI()->SetData(1, 1);\n        }\n\n        void Register() override\n        {\n            OnEffectLaunch += SpellEffectFn(spell_uldaman_sub_boss_agro_keepers_SpellScript::HandleSendEvent, EFFECT_0, SPELL_EFFECT_SEND_EVENT);\n        }\n    };\n\n    SpellScript* GetSpellScript() const override\n    {\n        return new spell_uldaman_sub_boss_agro_keepers_SpellScript();\n    }\n};\n\nenum UldamanStonedEnum\n{\n    MAP_ULDAMAN = 70\n};\n\nclass spell_uldaman_stoned : public SpellScriptLoader\n{\npublic:\n    spell_uldaman_stoned() : SpellScriptLoader(\"spell_uldaman_stoned\") { }\n\n    class spell_uldaman_stoned_AuraScript : public AuraScript\n    {\n        PrepareAuraScript(spell_uldaman_stoned_AuraScript);\n\n        bool Load() override\n        {\n            return GetUnitOwner()->GetTypeId() == TYPEID_UNIT && GetUnitOwner()->GetMapId() == MAP_ULDAMAN;\n        }\n\n        void HandleEffectApply(AuraEffect const* \/*aurEff*\/, AuraEffectHandleModes \/*mode*\/)\n        {\n            Creature* target = GetUnitOwner()->ToCreature();\n            target->SetReactState(REACT_PASSIVE);\n            target->SetFlag(UNIT_FIELD_FLAGS, UNIT_FLAG_IMMUNE_TO_PC | UNIT_FLAG_IMMUNE_TO_NPC);\n        }\n\n        void HandleEffectRemove(AuraEffect const* \/*aurEff*\/, AuraEffectHandleModes \/*mode*\/)\n        {\n            Creature* target = GetUnitOwner()->ToCreature();\n            target->SetReactState(REACT_AGGRESSIVE);\n            target->RemoveFlag(UNIT_FIELD_FLAGS, UNIT_FLAG_IMMUNE_TO_PC | UNIT_FLAG_IMMUNE_TO_NPC);\n        }\n\n        void Register() override\n        {\n            OnEffectApply += AuraEffectApplyFn(spell_uldaman_stoned_AuraScript::HandleEffectApply, EFFECT_0, SPELL_AURA_DUMMY, AURA_EFFECT_HANDLE_REAL);\n            OnEffectRemove += AuraEffectRemoveFn(spell_uldaman_stoned_AuraScript::HandleEffectRemove, EFFECT_0, SPELL_AURA_DUMMY, AURA_EFFECT_HANDLE_REAL);\n        }\n    };\n\n    AuraScript* GetAuraScript() const override\n    {\n        return new spell_uldaman_stoned_AuraScript();\n    }\n};\n\nclass spell_uldaman_boss_agro_archaedas : public SpellScriptLoader\n{\npublic:\n    spell_uldaman_boss_agro_archaedas() : SpellScriptLoader(\"spell_uldaman_boss_agro_archaedas\") { }\n\n    class spell_uldaman_boss_agro_archaedas_SpellScript : public SpellScript\n    {\n        PrepareSpellScript(spell_uldaman_boss_agro_archaedas_SpellScript);\n\n        void HandleSendEvent(SpellEffIndex  \/*effIndex*\/)\n        {\n            InstanceScript* instance = GetCaster()->GetInstanceScript();\n\n            if (!instance || instance->GetData(DATA_ARCHAEDAS) == IN_PROGRESS || instance->GetData(DATA_ARCHAEDAS) == DONE)\n                return;\n\n            instance->SetData(DATA_ARCHAEDAS, IN_PROGRESS);\n            if (Creature* archaedas = GetCaster()->FindNearestCreature(NPC_ARCHAEDAS, 100.0f, true))\n                archaedas->AI()->SetData(1, 1);\n        }\n\n        void Register() override\n        {\n            OnEffectLaunch += SpellEffectFn(spell_uldaman_boss_agro_archaedas_SpellScript::HandleSendEvent, EFFECT_0, SPELL_EFFECT_SEND_EVENT);\n        }\n    };\n\n    SpellScript* GetSpellScript() const override\n    {\n        return new spell_uldaman_boss_agro_archaedas_SpellScript();\n    }\n};\n\nvoid AddSC_instance_uldaman()\n{\n    new instance_uldaman();\n    new spell_uldaman_sub_boss_agro_keepers();\n    new spell_uldaman_stoned();\n    new spell_uldaman_boss_agro_archaedas();\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ DungeonRoomsFinisher.cpp\n\n\/\/ Declares the cDungeonRoomsFinisher class representing the finisher that generates dungeon rooms\n\n#include \"Globals.h\"\n#include \"DungeonRoomsFinisher.h\"\n#include \"..\/FastRandom.h\"\n\n\n\n\n\n\/** Height, in blocks, of the internal dungeon room open space. This many air blocks Y-wise. *\/\nstatic const int ROOM_HEIGHT = 4;\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cDungeonRoom:\n\nclass cDungeonRoom :\n\tpublic cGridStructGen::cStructure\n{\n\ttypedef cGridStructGen::cStructure super;\n\npublic:\n\n\tcDungeonRoom(\n\t\tint a_GridX, int a_GridZ,\n\t\tint a_OriginX, int a_OriginZ,\n\t\tint a_HalfSizeX, int a_HalfSizeZ,\n\t\tint a_FloorHeight,\n\t\tcNoise & a_Noise\n\t) :\n\t\tsuper(a_GridX, a_GridZ, a_OriginX, a_OriginZ),\n\t\tm_StartX(a_OriginX - a_HalfSizeX),\n\t\tm_EndX(a_OriginX + a_HalfSizeX),\n\t\tm_StartZ(a_OriginZ - a_HalfSizeZ),\n\t\tm_EndZ(a_OriginZ + a_HalfSizeZ),\n\t\tm_FloorHeight(a_FloorHeight)\n\t{\n\t\t\/*\n\t\tPick coords next to the wall for the chests.\n\t\tThis is done by indexing the possible coords, picking any one for the first chest\n\t\tand then picking another position for the second chest that is not adjacent to the first pos\n\t\t*\/\n\t\tint rnd = a_Noise.IntNoise2DInt(a_OriginX, a_OriginZ) \/ 7;\n\t\tint SizeX = m_EndX - m_StartX - 1;\n\t\tint SizeZ = m_EndZ - m_StartZ - 1;\n\t\tint NumPositions = 2 * SizeX + 2 * SizeZ;\n\t\tint FirstChestPos = rnd % NumPositions;  \/\/ The corner positions are a bit more likely, but we don't mind\n\t\trnd = rnd \/ 512;\n\t\tint SecondChestPos = (FirstChestPos + 2 + (rnd % (NumPositions - 3))) % NumPositions;\n\t\tm_Chest1 = DecodeChestCoords(FirstChestPos,  SizeX, SizeZ);\n\t\tm_Chest2 = DecodeChestCoords(SecondChestPos, SizeX, SizeZ);\n\t}\n\nprotected:\n\n\t\/\/ The X range of the room, start inclusive, end exclusive:\n\tint m_StartX, m_EndX;\n\n\t\/\/ The Z range of the room, start inclusive, end exclusive:\n\tint m_StartZ, m_EndZ;\n\n\t\/** The Y coord of the floor of the room *\/\n\tint m_FloorHeight;\n\n\t\/** The (absolute) coords of the first chest. The Y coord represents the chest's Meta value (facing). *\/\n\tVector3i m_Chest1;\n\n\t\/** The (absolute) coords of the second chest. The Y coord represents the chest's Meta value (facing). *\/\n\tVector3i m_Chest2;\n\n\n\n\t\/** Decodes the position index along the room walls into a proper 2D position for a chest. *\/\n\tVector3i DecodeChestCoords(int a_PosIdx, int a_SizeX, int a_SizeZ)\n\t{\n\t\tif (a_PosIdx < a_SizeX)\n\t\t{\n\t\t\t\/\/ Return a coord on the ZM side of the room:\n\t\t\treturn Vector3i(m_StartX + a_PosIdx + 1, E_META_CHEST_FACING_ZP, m_StartZ + 1);\n\t\t}\n\t\ta_PosIdx -= a_SizeX;\n\t\tif (a_PosIdx < a_SizeZ)\n\t\t{\n\t\t\t\/\/ Return a coord on the XP side of the room:\n\t\t\treturn Vector3i(m_EndX - 1, E_META_CHEST_FACING_XM, m_StartZ + a_PosIdx + 1);\n\t\t}\n\t\ta_PosIdx -= a_SizeZ;\n\t\tif (a_PosIdx < a_SizeX)\n\t\t{\n\t\t\t\/\/ Return a coord on the ZP side of the room:\n\t\t\treturn Vector3i(m_StartX + a_PosIdx + 1, E_META_CHEST_FACING_ZM, m_StartZ + 1);\n\t\t}\n\t\ta_PosIdx -= a_SizeX;\n\t\t\/\/ Return a coord on the XM side of the room:\n\t\treturn Vector3i(m_StartX + 1, E_META_CHEST_FACING_XP, m_StartZ + a_PosIdx + 1);\n\t}\n\n\n\n\t\/** Fills the specified area of blocks in the chunk with the specified blocktype if they are one of the overwritten block types.\n\tThe coords are absolute, start coords are inclusive, end coords are exclusive. *\/\n\tvoid ReplaceCuboid(cChunkDesc & a_ChunkDesc, int a_StartX, int a_StartY, int a_StartZ, int a_EndX, int a_EndY, int a_EndZ, BLOCKTYPE a_DstBlockType)\n\t{\n\t\tint BlockX = a_ChunkDesc.GetChunkX() * cChunkDef::Width;\n\t\tint BlockZ = a_ChunkDesc.GetChunkZ() * cChunkDef::Width;\n\t\tint RelStartX = Clamp(a_StartX - BlockX, 0, cChunkDef::Width - 1);\n\t\tint RelStartZ = Clamp(a_StartZ - BlockZ, 0, cChunkDef::Width - 1);\n\t\tint RelEndX   = Clamp(a_EndX - BlockX,   0, cChunkDef::Width);\n\t\tint RelEndZ   = Clamp(a_EndZ - BlockZ,   0, cChunkDef::Width);\n\t\tfor (int y = a_StartY; y < a_EndY; y++)\n\t\t{\n\t\t\tfor (int z = RelStartZ; z < RelEndZ; z++)\n\t\t\t{\n\t\t\t\tfor (int x = RelStartX; x < RelEndX; x++)\n\t\t\t\t{\n\t\t\t\t\tif (cBlockInfo::CanBeTerraformed(a_ChunkDesc.GetBlockType(x, y, z)))\n\t\t\t\t\t{\n\t\t\t\t\t\ta_ChunkDesc.SetBlockType(x, y, z, a_DstBlockType);\n\t\t\t\t\t}\n\t\t\t\t}  \/\/ for x\n\t\t\t}  \/\/ for z\n\t\t}  \/\/ for z\n\t}\n\n\n\n\t\/** Fills the specified area of blocks in the chunk with a random pattern of the specified blocktypes, if they are one of the overwritten block types.\n\tThe coords are absolute, start coords are inclusive, end coords are exclusive. The first blocktype uses 75% chance, the second 25% chance. *\/\n\tvoid ReplaceCuboidRandom(cChunkDesc & a_ChunkDesc, int a_StartX, int a_StartY, int a_StartZ, int a_EndX, int a_EndY, int a_EndZ, BLOCKTYPE a_DstBlockType1, BLOCKTYPE a_DstBlockType2)\n\t{\n\t\tint BlockX = a_ChunkDesc.GetChunkX() * cChunkDef::Width;\n\t\tint BlockZ = a_ChunkDesc.GetChunkZ() * cChunkDef::Width;\n\t\tint RelStartX = Clamp(a_StartX - BlockX, 0, cChunkDef::Width - 1);\n\t\tint RelStartZ = Clamp(a_StartZ - BlockZ, 0, cChunkDef::Width - 1);\n\t\tint RelEndX   = Clamp(a_EndX - BlockX,   0, cChunkDef::Width);\n\t\tint RelEndZ   = Clamp(a_EndZ - BlockZ,   0, cChunkDef::Width);\n\t\tcFastRandom rnd;\n\t\tfor (int y = a_StartY; y < a_EndY; y++)\n\t\t{\n\t\t\tfor (int z = RelStartZ; z < RelEndZ; z++)\n\t\t\t{\n\t\t\t\tfor (int x = RelStartX; x < RelEndX; x++)\n\t\t\t\t{\n\t\t\t\t\tif (cBlockInfo::CanBeTerraformed(a_ChunkDesc.GetBlockType(x, y, z)))\n\t\t\t\t\t{\n\t\t\t\t\t\tBLOCKTYPE BlockType = (rnd.NextInt(101) < 75) ? a_DstBlockType1 : a_DstBlockType2;\n\t\t\t\t\t\ta_ChunkDesc.SetBlockType(x, y, z, BlockType);\n\t\t\t\t\t}\n\t\t\t\t}  \/\/ for x\n\t\t\t}  \/\/ for z\n\t\t}  \/\/ for z\n\t}\n\n\n\n\t\/** Tries to place a chest at the specified (absolute) coords.\n\tDoes nothing if the coords are outside the chunk. *\/\n\tvoid TryPlaceChest(cChunkDesc & a_ChunkDesc, const Vector3i & a_Chest)\n\t{\n\t\tint RelX = a_Chest.x - a_ChunkDesc.GetChunkX() * cChunkDef::Width;\n\t\tint RelZ = a_Chest.z - a_ChunkDesc.GetChunkZ() * cChunkDef::Width;\n\t\tif (\n\t\t\t(RelX < 0) || (RelX >= cChunkDef::Width) ||  \/\/ The X coord is not in this chunk\n\t\t\t(RelZ < 0) || (RelZ >= cChunkDef::Width)     \/\/ The Z coord is not in this chunk\n\t\t)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\ta_ChunkDesc.SetBlockTypeMeta(RelX, m_FloorHeight + 1, RelZ, E_BLOCK_CHEST, (NIBBLETYPE)a_Chest.y);\n\n\t\t\/\/ TODO: Fill the chest with random loot\n\t}\n\n\n\n\t\/\/ cGridStructGen::cStructure override:\n\tvirtual void DrawIntoChunk(cChunkDesc & a_ChunkDesc) override\n\t{\n\t\tif (\n\t\t\t(m_EndX <= a_ChunkDesc.GetChunkX() * cChunkDef::Width) ||\n\t\t\t(m_StartX >= a_ChunkDesc.GetChunkX() * cChunkDef::Width + cChunkDef::Width) ||\n\t\t\t(m_EndZ <= a_ChunkDesc.GetChunkZ() * cChunkDef::Width) ||\n\t\t\t(m_StartZ >= a_ChunkDesc.GetChunkZ() * cChunkDef::Width + cChunkDef::Width)\n\t\t)\n\t\t{\n\t\t\t\/\/ The chunk is not intersecting the room at all, bail out\n\t\t\treturn;\n\t\t}\n\t\tint b = m_FloorHeight + 1;  \/\/ Bottom\n\t\tint t = m_FloorHeight + 1 + ROOM_HEIGHT;  \/\/ Top\n\t\tReplaceCuboidRandom(a_ChunkDesc, m_StartX, m_FloorHeight, m_StartZ, m_EndX + 1, b, m_EndZ + 1, E_BLOCK_MOSSY_COBBLESTONE, E_BLOCK_COBBLESTONE);  \/\/ Floor\n\t\tReplaceCuboid(a_ChunkDesc, m_StartX + 1, b, m_StartZ + 1, m_EndX, t, m_EndZ, E_BLOCK_AIR);  \/\/ Insides\n\n\t\t\/\/ Walls:\n\t\tReplaceCuboid(a_ChunkDesc, m_StartX, b, m_StartZ, m_StartX + 1, t, m_EndZ,       E_BLOCK_COBBLESTONE);  \/\/ XM wall\n\t\tReplaceCuboid(a_ChunkDesc, m_EndX,   b, m_StartZ, m_EndX + 1,   t, m_EndZ,       E_BLOCK_COBBLESTONE);  \/\/ XP wall\n\t\tReplaceCuboid(a_ChunkDesc, m_StartX, b, m_StartZ, m_EndX + 1,   t, m_StartZ + 1, E_BLOCK_COBBLESTONE);  \/\/ ZM wall\n\t\tReplaceCuboid(a_ChunkDesc, m_StartX, b, m_EndZ,   m_EndX + 1,   t, m_EndZ + 1,   E_BLOCK_COBBLESTONE);  \/\/ ZP wall\n\n\t\t\/\/ Place chests:\n\t\tTryPlaceChest(a_ChunkDesc, m_Chest1);\n\t\tTryPlaceChest(a_ChunkDesc, m_Chest2);\n\n\t\t\/\/ Place the spawner:\n\t\tint CenterX = (m_StartX + m_EndX) \/ 2 - a_ChunkDesc.GetChunkX() * cChunkDef::Width;\n\t\tint CenterZ = (m_StartZ + m_EndZ) \/ 2 - a_ChunkDesc.GetChunkZ() * cChunkDef::Width;\n\t\tif (\n\t\t\t(CenterX >= 0) && (CenterX < cChunkDef::Width) &&\n\t\t\t(CenterZ >= 0) && (CenterZ < cChunkDef::Width)\n\t\t)\n\t\t{\n\t\t\ta_ChunkDesc.SetBlockTypeMeta(CenterX, b, CenterZ, E_BLOCK_MOB_SPAWNER, 0);\n\t\t\t\/\/ TODO: Set the spawned mob\n\t\t}\n\t}\n} ;\n\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cDungeonRoomsFinisher:\n\ncDungeonRoomsFinisher::cDungeonRoomsFinisher(cTerrainHeightGen & a_HeightGen, int a_Seed, int a_GridSize, int a_MaxSize, int a_MinSize, const AString & a_HeightDistrib) :\n\tsuper(a_Seed + 100, a_GridSize, a_GridSize, a_GridSize, a_GridSize, a_MaxSize, a_MaxSize, 1024),\n\tm_HeightGen(a_HeightGen),\n\tm_MaxHalfSize((a_MaxSize + 1) \/ 2),\n\tm_MinHalfSize((a_MinSize + 1) \/ 2),\n\tm_HeightProbability(cChunkDef::Height)\n{\n\t\/\/ Initialize the height probability distribution:\n\tm_HeightProbability.SetDefString(a_HeightDistrib);\n\n\t\/\/ Normalize the min and max size:\n\tif (m_MinHalfSize > m_MaxHalfSize)\n\t{\n\t\tstd::swap(m_MinHalfSize, m_MaxHalfSize);\n\t}\n}\n\n\n\n\n\n\ncDungeonRoomsFinisher::cStructurePtr cDungeonRoomsFinisher::CreateStructure(int a_GridX, int a_GridZ, int a_OriginX, int a_OriginZ)\n{\n\t\/\/ Select a random room size in each direction:\n\tint rnd = m_Noise.IntNoise2DInt(a_OriginX, a_OriginZ) \/ 7;\n\tint HalfSizeX = m_MinHalfSize + (rnd % (m_MaxHalfSize - m_MinHalfSize + 1));\n\trnd = rnd \/ 32;\n\tint HalfSizeZ = m_MinHalfSize + (rnd % (m_MaxHalfSize - m_MinHalfSize + 1));\n\trnd = rnd \/ 32;\n\n\t\/\/ Select a random floor height for the room, based on the height generator:\n\tint ChunkX, ChunkZ;\n\tint RelX = a_OriginX, RelY = 0, RelZ = a_OriginZ;\n\tcChunkDef::AbsoluteToRelative(RelX, RelY, RelZ, ChunkX, ChunkZ);\n\tcChunkDef::HeightMap HeightMap;\n\tm_HeightGen.GenHeightMap(ChunkX, ChunkZ, HeightMap);\n\tint Height = cChunkDef::GetHeight(HeightMap, RelX, RelZ);  \/\/ Max room height at {a_OriginX, a_OriginZ}\n\tHeight = Clamp(m_HeightProbability.MapValue(rnd % m_HeightProbability.GetSum()), 10, Height - 5);\n\n\t\/\/ Create the dungeon room descriptor:\n\treturn cStructurePtr(new cDungeonRoom(a_GridX, a_GridZ, a_OriginX, a_OriginZ, HalfSizeX, HalfSizeZ, Height, m_Noise));\n}\n\n\n\n\n<commit_msg>DungeonRooms: Fixed an off-by-one error.<commit_after>\n\/\/ DungeonRoomsFinisher.cpp\n\n\/\/ Declares the cDungeonRoomsFinisher class representing the finisher that generates dungeon rooms\n\n#include \"Globals.h\"\n#include \"DungeonRoomsFinisher.h\"\n#include \"..\/FastRandom.h\"\n\n\n\n\n\n\/** Height, in blocks, of the internal dungeon room open space. This many air blocks Y-wise. *\/\nstatic const int ROOM_HEIGHT = 4;\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cDungeonRoom:\n\nclass cDungeonRoom :\n\tpublic cGridStructGen::cStructure\n{\n\ttypedef cGridStructGen::cStructure super;\n\npublic:\n\n\tcDungeonRoom(\n\t\tint a_GridX, int a_GridZ,\n\t\tint a_OriginX, int a_OriginZ,\n\t\tint a_HalfSizeX, int a_HalfSizeZ,\n\t\tint a_FloorHeight,\n\t\tcNoise & a_Noise\n\t) :\n\t\tsuper(a_GridX, a_GridZ, a_OriginX, a_OriginZ),\n\t\tm_StartX(a_OriginX - a_HalfSizeX),\n\t\tm_EndX(a_OriginX + a_HalfSizeX),\n\t\tm_StartZ(a_OriginZ - a_HalfSizeZ),\n\t\tm_EndZ(a_OriginZ + a_HalfSizeZ),\n\t\tm_FloorHeight(a_FloorHeight)\n\t{\n\t\t\/*\n\t\tPick coords next to the wall for the chests.\n\t\tThis is done by indexing the possible coords, picking any one for the first chest\n\t\tand then picking another position for the second chest that is not adjacent to the first pos\n\t\t*\/\n\t\tint rnd = a_Noise.IntNoise2DInt(a_OriginX, a_OriginZ) \/ 7;\n\t\tint SizeX = m_EndX - m_StartX - 1;\n\t\tint SizeZ = m_EndZ - m_StartZ - 1;\n\t\tint NumPositions = 2 * SizeX + 2 * SizeZ;\n\t\tint FirstChestPos = rnd % NumPositions;  \/\/ The corner positions are a bit more likely, but we don't mind\n\t\trnd = rnd \/ 512;\n\t\tint SecondChestPos = (FirstChestPos + 2 + (rnd % (NumPositions - 3))) % NumPositions;\n\t\tm_Chest1 = DecodeChestCoords(FirstChestPos,  SizeX, SizeZ);\n\t\tm_Chest2 = DecodeChestCoords(SecondChestPos, SizeX, SizeZ);\n\t}\n\nprotected:\n\n\t\/\/ The X range of the room, start inclusive, end exclusive:\n\tint m_StartX, m_EndX;\n\n\t\/\/ The Z range of the room, start inclusive, end exclusive:\n\tint m_StartZ, m_EndZ;\n\n\t\/** The Y coord of the floor of the room *\/\n\tint m_FloorHeight;\n\n\t\/** The (absolute) coords of the first chest. The Y coord represents the chest's Meta value (facing). *\/\n\tVector3i m_Chest1;\n\n\t\/** The (absolute) coords of the second chest. The Y coord represents the chest's Meta value (facing). *\/\n\tVector3i m_Chest2;\n\n\n\n\t\/** Decodes the position index along the room walls into a proper 2D position for a chest. *\/\n\tVector3i DecodeChestCoords(int a_PosIdx, int a_SizeX, int a_SizeZ)\n\t{\n\t\tif (a_PosIdx < a_SizeX)\n\t\t{\n\t\t\t\/\/ Return a coord on the ZM side of the room:\n\t\t\treturn Vector3i(m_StartX + a_PosIdx + 1, E_META_CHEST_FACING_ZP, m_StartZ + 1);\n\t\t}\n\t\ta_PosIdx -= a_SizeX;\n\t\tif (a_PosIdx < a_SizeZ)\n\t\t{\n\t\t\t\/\/ Return a coord on the XP side of the room:\n\t\t\treturn Vector3i(m_EndX - 1, E_META_CHEST_FACING_XM, m_StartZ + a_PosIdx + 1);\n\t\t}\n\t\ta_PosIdx -= a_SizeZ;\n\t\tif (a_PosIdx < a_SizeX)\n\t\t{\n\t\t\t\/\/ Return a coord on the ZP side of the room:\n\t\t\treturn Vector3i(m_StartX + a_PosIdx + 1, E_META_CHEST_FACING_ZM, m_StartZ + 1);\n\t\t}\n\t\ta_PosIdx -= a_SizeX;\n\t\t\/\/ Return a coord on the XM side of the room:\n\t\treturn Vector3i(m_StartX + 1, E_META_CHEST_FACING_XP, m_StartZ + a_PosIdx + 1);\n\t}\n\n\n\n\t\/** Fills the specified area of blocks in the chunk with the specified blocktype if they are one of the overwritten block types.\n\tThe coords are absolute, start coords are inclusive, end coords are exclusive. *\/\n\tvoid ReplaceCuboid(cChunkDesc & a_ChunkDesc, int a_StartX, int a_StartY, int a_StartZ, int a_EndX, int a_EndY, int a_EndZ, BLOCKTYPE a_DstBlockType)\n\t{\n\t\tint BlockX = a_ChunkDesc.GetChunkX() * cChunkDef::Width;\n\t\tint BlockZ = a_ChunkDesc.GetChunkZ() * cChunkDef::Width;\n\t\tint RelStartX = Clamp(a_StartX - BlockX, 0, cChunkDef::Width - 1);\n\t\tint RelStartZ = Clamp(a_StartZ - BlockZ, 0, cChunkDef::Width - 1);\n\t\tint RelEndX   = Clamp(a_EndX - BlockX,   0, cChunkDef::Width);\n\t\tint RelEndZ   = Clamp(a_EndZ - BlockZ,   0, cChunkDef::Width);\n\t\tfor (int y = a_StartY; y < a_EndY; y++)\n\t\t{\n\t\t\tfor (int z = RelStartZ; z < RelEndZ; z++)\n\t\t\t{\n\t\t\t\tfor (int x = RelStartX; x < RelEndX; x++)\n\t\t\t\t{\n\t\t\t\t\tif (cBlockInfo::CanBeTerraformed(a_ChunkDesc.GetBlockType(x, y, z)))\n\t\t\t\t\t{\n\t\t\t\t\t\ta_ChunkDesc.SetBlockType(x, y, z, a_DstBlockType);\n\t\t\t\t\t}\n\t\t\t\t}  \/\/ for x\n\t\t\t}  \/\/ for z\n\t\t}  \/\/ for z\n\t}\n\n\n\n\t\/** Fills the specified area of blocks in the chunk with a random pattern of the specified blocktypes, if they are one of the overwritten block types.\n\tThe coords are absolute, start coords are inclusive, end coords are exclusive. The first blocktype uses 75% chance, the second 25% chance. *\/\n\tvoid ReplaceCuboidRandom(cChunkDesc & a_ChunkDesc, int a_StartX, int a_StartY, int a_StartZ, int a_EndX, int a_EndY, int a_EndZ, BLOCKTYPE a_DstBlockType1, BLOCKTYPE a_DstBlockType2)\n\t{\n\t\tint BlockX = a_ChunkDesc.GetChunkX() * cChunkDef::Width;\n\t\tint BlockZ = a_ChunkDesc.GetChunkZ() * cChunkDef::Width;\n\t\tint RelStartX = Clamp(a_StartX - BlockX, 0, cChunkDef::Width - 1);\n\t\tint RelStartZ = Clamp(a_StartZ - BlockZ, 0, cChunkDef::Width - 1);\n\t\tint RelEndX   = Clamp(a_EndX - BlockX,   0, cChunkDef::Width);\n\t\tint RelEndZ   = Clamp(a_EndZ - BlockZ,   0, cChunkDef::Width);\n\t\tcFastRandom rnd;\n\t\tfor (int y = a_StartY; y < a_EndY; y++)\n\t\t{\n\t\t\tfor (int z = RelStartZ; z < RelEndZ; z++)\n\t\t\t{\n\t\t\t\tfor (int x = RelStartX; x < RelEndX; x++)\n\t\t\t\t{\n\t\t\t\t\tif (cBlockInfo::CanBeTerraformed(a_ChunkDesc.GetBlockType(x, y, z)))\n\t\t\t\t\t{\n\t\t\t\t\t\tBLOCKTYPE BlockType = (rnd.NextInt(101) < 75) ? a_DstBlockType1 : a_DstBlockType2;\n\t\t\t\t\t\ta_ChunkDesc.SetBlockType(x, y, z, BlockType);\n\t\t\t\t\t}\n\t\t\t\t}  \/\/ for x\n\t\t\t}  \/\/ for z\n\t\t}  \/\/ for z\n\t}\n\n\n\n\t\/** Tries to place a chest at the specified (absolute) coords.\n\tDoes nothing if the coords are outside the chunk. *\/\n\tvoid TryPlaceChest(cChunkDesc & a_ChunkDesc, const Vector3i & a_Chest)\n\t{\n\t\tint RelX = a_Chest.x - a_ChunkDesc.GetChunkX() * cChunkDef::Width;\n\t\tint RelZ = a_Chest.z - a_ChunkDesc.GetChunkZ() * cChunkDef::Width;\n\t\tif (\n\t\t\t(RelX < 0) || (RelX >= cChunkDef::Width) ||  \/\/ The X coord is not in this chunk\n\t\t\t(RelZ < 0) || (RelZ >= cChunkDef::Width)     \/\/ The Z coord is not in this chunk\n\t\t)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\ta_ChunkDesc.SetBlockTypeMeta(RelX, m_FloorHeight + 1, RelZ, E_BLOCK_CHEST, (NIBBLETYPE)a_Chest.y);\n\n\t\t\/\/ TODO: Fill the chest with random loot\n\t}\n\n\n\n\t\/\/ cGridStructGen::cStructure override:\n\tvirtual void DrawIntoChunk(cChunkDesc & a_ChunkDesc) override\n\t{\n\t\tif (\n\t\t\t(m_EndX   <  a_ChunkDesc.GetChunkX() * cChunkDef::Width) ||\n\t\t\t(m_StartX >= a_ChunkDesc.GetChunkX() * cChunkDef::Width + cChunkDef::Width) ||\n\t\t\t(m_EndZ   <  a_ChunkDesc.GetChunkZ() * cChunkDef::Width) ||\n\t\t\t(m_StartZ >= a_ChunkDesc.GetChunkZ() * cChunkDef::Width + cChunkDef::Width)\n\t\t)\n\t\t{\n\t\t\t\/\/ The chunk is not intersecting the room at all, bail out\n\t\t\treturn;\n\t\t}\n\t\tint b = m_FloorHeight + 1;  \/\/ Bottom\n\t\tint t = m_FloorHeight + 1 + ROOM_HEIGHT;  \/\/ Top\n\t\tReplaceCuboidRandom(a_ChunkDesc, m_StartX, m_FloorHeight, m_StartZ, m_EndX + 1, b, m_EndZ + 1, E_BLOCK_MOSSY_COBBLESTONE, E_BLOCK_COBBLESTONE);  \/\/ Floor\n\t\tReplaceCuboid(a_ChunkDesc, m_StartX + 1, b, m_StartZ + 1, m_EndX, t, m_EndZ, E_BLOCK_AIR);  \/\/ Insides\n\n\t\t\/\/ Walls:\n\t\tReplaceCuboid(a_ChunkDesc, m_StartX, b, m_StartZ, m_StartX + 1, t, m_EndZ,       E_BLOCK_COBBLESTONE);  \/\/ XM wall\n\t\tReplaceCuboid(a_ChunkDesc, m_EndX,   b, m_StartZ, m_EndX + 1,   t, m_EndZ,       E_BLOCK_COBBLESTONE);  \/\/ XP wall\n\t\tReplaceCuboid(a_ChunkDesc, m_StartX, b, m_StartZ, m_EndX + 1,   t, m_StartZ + 1, E_BLOCK_COBBLESTONE);  \/\/ ZM wall\n\t\tReplaceCuboid(a_ChunkDesc, m_StartX, b, m_EndZ,   m_EndX + 1,   t, m_EndZ + 1,   E_BLOCK_COBBLESTONE);  \/\/ ZP wall\n\n\t\t\/\/ Place chests:\n\t\tTryPlaceChest(a_ChunkDesc, m_Chest1);\n\t\tTryPlaceChest(a_ChunkDesc, m_Chest2);\n\n\t\t\/\/ Place the spawner:\n\t\tint CenterX = (m_StartX + m_EndX) \/ 2 - a_ChunkDesc.GetChunkX() * cChunkDef::Width;\n\t\tint CenterZ = (m_StartZ + m_EndZ) \/ 2 - a_ChunkDesc.GetChunkZ() * cChunkDef::Width;\n\t\tif (\n\t\t\t(CenterX >= 0) && (CenterX < cChunkDef::Width) &&\n\t\t\t(CenterZ >= 0) && (CenterZ < cChunkDef::Width)\n\t\t)\n\t\t{\n\t\t\ta_ChunkDesc.SetBlockTypeMeta(CenterX, b, CenterZ, E_BLOCK_MOB_SPAWNER, 0);\n\t\t\t\/\/ TODO: Set the spawned mob\n\t\t}\n\t}\n} ;\n\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cDungeonRoomsFinisher:\n\ncDungeonRoomsFinisher::cDungeonRoomsFinisher(cTerrainHeightGen & a_HeightGen, int a_Seed, int a_GridSize, int a_MaxSize, int a_MinSize, const AString & a_HeightDistrib) :\n\tsuper(a_Seed + 100, a_GridSize, a_GridSize, a_GridSize, a_GridSize, a_MaxSize, a_MaxSize, 1024),\n\tm_HeightGen(a_HeightGen),\n\tm_MaxHalfSize((a_MaxSize + 1) \/ 2),\n\tm_MinHalfSize((a_MinSize + 1) \/ 2),\n\tm_HeightProbability(cChunkDef::Height)\n{\n\t\/\/ Initialize the height probability distribution:\n\tm_HeightProbability.SetDefString(a_HeightDistrib);\n\n\t\/\/ Normalize the min and max size:\n\tif (m_MinHalfSize > m_MaxHalfSize)\n\t{\n\t\tstd::swap(m_MinHalfSize, m_MaxHalfSize);\n\t}\n}\n\n\n\n\n\n\ncDungeonRoomsFinisher::cStructurePtr cDungeonRoomsFinisher::CreateStructure(int a_GridX, int a_GridZ, int a_OriginX, int a_OriginZ)\n{\n\t\/\/ Select a random room size in each direction:\n\tint rnd = m_Noise.IntNoise2DInt(a_OriginX, a_OriginZ) \/ 7;\n\tint HalfSizeX = m_MinHalfSize + (rnd % (m_MaxHalfSize - m_MinHalfSize + 1));\n\trnd = rnd \/ 32;\n\tint HalfSizeZ = m_MinHalfSize + (rnd % (m_MaxHalfSize - m_MinHalfSize + 1));\n\trnd = rnd \/ 32;\n\n\t\/\/ Select a random floor height for the room, based on the height generator:\n\tint ChunkX, ChunkZ;\n\tint RelX = a_OriginX, RelY = 0, RelZ = a_OriginZ;\n\tcChunkDef::AbsoluteToRelative(RelX, RelY, RelZ, ChunkX, ChunkZ);\n\tcChunkDef::HeightMap HeightMap;\n\tm_HeightGen.GenHeightMap(ChunkX, ChunkZ, HeightMap);\n\tint Height = cChunkDef::GetHeight(HeightMap, RelX, RelZ);  \/\/ Max room height at {a_OriginX, a_OriginZ}\n\tHeight = Clamp(m_HeightProbability.MapValue(rnd % m_HeightProbability.GetSum()), 10, Height - 5);\n\n\t\/\/ Create the dungeon room descriptor:\n\treturn cStructurePtr(new cDungeonRoom(a_GridX, a_GridZ, a_OriginX, a_OriginZ, HalfSizeX, HalfSizeZ, Height, m_Noise));\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* Released under the same permissive MIT-license as Urho3D.\n* https:\/\/raw.githubusercontent.com\/urho3d\/Urho3D\/master\/License.txt\n*\/\n\n#include <string>\n#include <memory>\n\n#include <Urho3D\/Urho3D.h>\n#include <Urho3D\/Core\/CoreEvents.h>\n#include <Urho3D\/Graphics\/RenderPath.h>\n#include <Urho3D\/Engine\/Application.h>\n#include <Urho3D\/Engine\/Engine.h>\n#include <Urho3D\/Input\/Input.h>\n#include <Urho3D\/Input\/InputEvents.h>\n#include <Urho3D\/Resource\/ResourceCache.h>\n#include <Urho3D\/Resource\/XMLFile.h>\n#include <Urho3D\/IO\/Log.h>\n#include <Urho3D\/UI\/UI.h>\n#include <Urho3D\/UI\/Text.h>\n#include <Urho3D\/UI\/Font.h>\n#include <Urho3D\/UI\/Button.h>\n#include <Urho3D\/UI\/UIEvents.h>\n#include <Urho3D\/Scene\/Scene.h>\n#include <Urho3D\/Scene\/SceneEvents.h>\n#include <Urho3D\/Graphics\/Graphics.h>\n#include <Urho3D\/Graphics\/Camera.h>\n#include <Urho3D\/Graphics\/Geometry.h>\n#include <Urho3D\/Graphics\/Renderer.h>\n#include <Urho3D\/Graphics\/DebugRenderer.h>\n#include <Urho3D\/Graphics\/Octree.h>\n#include <Urho3D\/Graphics\/Light.h>\n#include <Urho3D\/Graphics\/Model.h>\n#include <Urho3D\/Graphics\/StaticModel.h>\n#include <Urho3D\/Graphics\/Material.h>\n#include <Urho3D\/Graphics\/Skybox.h>\n#include <Urho3D\/Graphics\/Zone.h>\n#include <Urho3D\/Audio\/Sound.h>\n#include <Urho3D\/Audio\/SoundSource3D.h>\n#include <Urho3D\/Audio\/SoundListener.h>\n#include <Urho3D\/Audio\/Audio.h>\n\n#include \"gs_main_menu.h\"\n#include \"gs_playing.h\"\n\nusing namespace Urho3D;\n\nclass MyApp : public Application\n{\npublic:\n    SharedPtr<Scene> scene_;\n    Node* cameraNode_;\n\n    MyApp(Context * context) : Application(context)\n    {\n    }\n\n    virtual void Setup()\n    {\n        engineParameters_[\"FullScreen\"]=false;\n        engineParameters_[\"WindowWidth\"]=1280;\n        engineParameters_[\"WindowHeight\"]=720;\n        engineParameters_[\"WindowResizable\"]=true;\n        engineParameters_[\"Multisample\"]=4;\n    }\n\n    virtual void Start()\n    {\n        ResourceCache* cache=GetSubsystem<ResourceCache>();\n        GetSubsystem<UI>()->GetRoot()->SetDefaultStyle(cache->GetResource<XMLFile>(\"UI\/DefaultStyle.xml\"));\n\n        scene_=new Scene(context_);\n        scene_->CreateComponent<Octree>();\n        scene_->CreateComponent<DebugRenderer>();\n\n        \/\/ until we get a better sky system\n        Node* skyNode=scene_->CreateChild(\"Sky\");\n        skyNode->SetScale(500.0f);\n        Skybox* skybox=skyNode->CreateComponent<Skybox>();\n        skybox->SetModel(cache->GetResource<Model>(\"Models\/Box.mdl\"));\n        skybox->SetMaterial(cache->GetResource<Material>(\"Materials\/Skybox.xml\"));\n\n        cameraNode_=scene_->CreateChild(\"Camera\");\n        Camera* camera=cameraNode_->CreateComponent<Camera>();\n        camera->SetFarClip(10000);\n        SoundListener* listener=cameraNode_->CreateComponent<SoundListener>();\n        GetSubsystem<Audio>()->SetListener(listener);\n\n        Renderer* renderer=GetSubsystem<Renderer>();\n        SharedPtr<Viewport> viewport(new Viewport(context_,scene_,cameraNode_->GetComponent<Camera>()));\n        renderer->SetViewport(0,viewport);\n        renderer->SetShadowMapSize(4096);\n        renderer->SetHDRRendering(true);\n\n        RenderPath* effectRenderPath=viewport->GetRenderPath();\n        effectRenderPath->Append(cache->GetResource<XMLFile>(\"PostProcess\/AutoExposure.xml\"));\n        effectRenderPath->Append(cache->GetResource<XMLFile>(\"PostProcess\/BloomHDR.xml\"));\n        effectRenderPath->Append(cache->GetResource<XMLFile>(\"PostProcess\/FXAA2.xml\"));\n        \/\/effectRenderPath.SetEnabled(\"GammaCorrection\",false);\n        viewport->SetRenderPath(effectRenderPath);\n\n        Node* zoneNode=scene_->CreateChild(\"Zone\");\n        Zone* zone=zoneNode->CreateComponent<Zone>();\n        zone->SetBoundingBox(BoundingBox(-20000.0f,20000.0f));\n        zone->SetFogStart(100.0f);\n        zone->SetFogEnd(5000.0f);\n        zone->SetAmbientColor(Color(0.1,0.1,0.1));\n\n        SubscribeToEvent(E_KEYDOWN,HANDLER(MyApp,HandleKeyDown));\n        SubscribeToEvent(E_UPDATE,HANDLER(MyApp,HandleUpdate));\n\n        \/\/ fill our game state shared variables\n        globals::instance()->cache=cache;\n        globals::instance()->camera=camera;\n        globals::instance()->scene=scene_;\n        globals::instance()->context=context_;\n        globals::instance()->ui_root=GetSubsystem<UI>()->GetRoot();\n        globals::instance()->engine=engine_;\n        globals::instance()->game_states.emplace_back(new gs_main_menu);\n    }\n    virtual void Stop()\n    {\n        globals::instance()->game_states.resize(0);\n    }\n\n    void HandleKeyDown(StringHash eventType,VariantMap& eventData)\n    {\n        using namespace KeyDown;\n        int key=eventData[P_KEY].GetInt();\n\n        if(key==KEY_TAB)\n        {\n            GetSubsystem<Input>()->SetMouseVisible(!GetSubsystem<Input>()->IsMouseVisible());\n            GetSubsystem<Input>()->SetMouseGrabbed(!GetSubsystem<Input>()->IsMouseGrabbed());\n        }\n    }\n\n    void HandleUpdate(StringHash eventType,VariantMap& eventData)\n    {\n\n    }\n};\n\nDEFINE_APPLICATION_MAIN(MyApp)\n<commit_msg>Reduced shadow map size from 4096 to 1024 to improve the framerate. This would be a nice game setting.<commit_after>\/**\n* Released under the same permissive MIT-license as Urho3D.\n* https:\/\/raw.githubusercontent.com\/urho3d\/Urho3D\/master\/License.txt\n*\/\n\n#include <string>\n#include <memory>\n\n#include <Urho3D\/Urho3D.h>\n#include <Urho3D\/Core\/CoreEvents.h>\n#include <Urho3D\/Graphics\/RenderPath.h>\n#include <Urho3D\/Engine\/Application.h>\n#include <Urho3D\/Engine\/Engine.h>\n#include <Urho3D\/Input\/Input.h>\n#include <Urho3D\/Input\/InputEvents.h>\n#include <Urho3D\/Resource\/ResourceCache.h>\n#include <Urho3D\/Resource\/XMLFile.h>\n#include <Urho3D\/IO\/Log.h>\n#include <Urho3D\/UI\/UI.h>\n#include <Urho3D\/UI\/Text.h>\n#include <Urho3D\/UI\/Font.h>\n#include <Urho3D\/UI\/Button.h>\n#include <Urho3D\/UI\/UIEvents.h>\n#include <Urho3D\/Scene\/Scene.h>\n#include <Urho3D\/Scene\/SceneEvents.h>\n#include <Urho3D\/Graphics\/Graphics.h>\n#include <Urho3D\/Graphics\/Camera.h>\n#include <Urho3D\/Graphics\/Geometry.h>\n#include <Urho3D\/Graphics\/Renderer.h>\n#include <Urho3D\/Graphics\/DebugRenderer.h>\n#include <Urho3D\/Graphics\/Octree.h>\n#include <Urho3D\/Graphics\/Light.h>\n#include <Urho3D\/Graphics\/Model.h>\n#include <Urho3D\/Graphics\/StaticModel.h>\n#include <Urho3D\/Graphics\/Material.h>\n#include <Urho3D\/Graphics\/Skybox.h>\n#include <Urho3D\/Graphics\/Zone.h>\n#include <Urho3D\/Audio\/Sound.h>\n#include <Urho3D\/Audio\/SoundSource3D.h>\n#include <Urho3D\/Audio\/SoundListener.h>\n#include <Urho3D\/Audio\/Audio.h>\n\n#include \"gs_main_menu.h\"\n#include \"gs_playing.h\"\n\nusing namespace Urho3D;\n\nclass MyApp : public Application\n{\npublic:\n    SharedPtr<Scene> scene_;\n    Node* cameraNode_;\n\n    MyApp(Context * context) : Application(context)\n    {\n    }\n\n    virtual void Setup()\n    {\n        engineParameters_[\"FullScreen\"]=false;\n        engineParameters_[\"WindowWidth\"]=1280;\n        engineParameters_[\"WindowHeight\"]=720;\n        engineParameters_[\"WindowResizable\"]=true;\n        engineParameters_[\"Multisample\"]=4;\n    }\n\n    virtual void Start()\n    {\n        ResourceCache* cache=GetSubsystem<ResourceCache>();\n        GetSubsystem<UI>()->GetRoot()->SetDefaultStyle(cache->GetResource<XMLFile>(\"UI\/DefaultStyle.xml\"));\n\n        scene_=new Scene(context_);\n        scene_->CreateComponent<Octree>();\n        scene_->CreateComponent<DebugRenderer>();\n\n        \/\/ until we get a better sky system\n        Node* skyNode=scene_->CreateChild(\"Sky\");\n        skyNode->SetScale(500.0f);\n        Skybox* skybox=skyNode->CreateComponent<Skybox>();\n        skybox->SetModel(cache->GetResource<Model>(\"Models\/Box.mdl\"));\n        skybox->SetMaterial(cache->GetResource<Material>(\"Materials\/Skybox.xml\"));\n\n        cameraNode_=scene_->CreateChild(\"Camera\");\n        Camera* camera=cameraNode_->CreateComponent<Camera>();\n        camera->SetFarClip(10000);\n        SoundListener* listener=cameraNode_->CreateComponent<SoundListener>();\n        GetSubsystem<Audio>()->SetListener(listener);\n\n        Renderer* renderer=GetSubsystem<Renderer>();\n        SharedPtr<Viewport> viewport(new Viewport(context_,scene_,cameraNode_->GetComponent<Camera>()));\n        renderer->SetViewport(0,viewport);\n        renderer->SetShadowMapSize(1024);\n        renderer->SetHDRRendering(true);\n\n        RenderPath* effectRenderPath=viewport->GetRenderPath();\n        effectRenderPath->Append(cache->GetResource<XMLFile>(\"PostProcess\/AutoExposure.xml\"));\n        effectRenderPath->Append(cache->GetResource<XMLFile>(\"PostProcess\/BloomHDR.xml\"));\n        effectRenderPath->Append(cache->GetResource<XMLFile>(\"PostProcess\/FXAA2.xml\"));\n        \/\/effectRenderPath.SetEnabled(\"GammaCorrection\",false);\n        viewport->SetRenderPath(effectRenderPath);\n\n        Node* zoneNode=scene_->CreateChild(\"Zone\");\n        Zone* zone=zoneNode->CreateComponent<Zone>();\n        zone->SetBoundingBox(BoundingBox(-20000.0f,20000.0f));\n        zone->SetFogStart(100.0f);\n        zone->SetFogEnd(5000.0f);\n        zone->SetAmbientColor(Color(0.1,0.1,0.1));\n\n        SubscribeToEvent(E_KEYDOWN,HANDLER(MyApp,HandleKeyDown));\n        SubscribeToEvent(E_UPDATE,HANDLER(MyApp,HandleUpdate));\n\n        \/\/ fill our game state shared variables\n        globals::instance()->cache=cache;\n        globals::instance()->camera=camera;\n        globals::instance()->scene=scene_;\n        globals::instance()->context=context_;\n        globals::instance()->ui_root=GetSubsystem<UI>()->GetRoot();\n        globals::instance()->engine=engine_;\n        globals::instance()->game_states.emplace_back(new gs_main_menu);\n    }\n    virtual void Stop()\n    {\n        globals::instance()->game_states.resize(0);\n    }\n\n    void HandleKeyDown(StringHash eventType,VariantMap& eventData)\n    {\n        using namespace KeyDown;\n        int key=eventData[P_KEY].GetInt();\n\n        if(key==KEY_TAB)\n        {\n            GetSubsystem<Input>()->SetMouseVisible(!GetSubsystem<Input>()->IsMouseVisible());\n            GetSubsystem<Input>()->SetMouseGrabbed(!GetSubsystem<Input>()->IsMouseGrabbed());\n        }\n    }\n\n    void HandleUpdate(StringHash eventType,VariantMap& eventData)\n    {\n\n    }\n};\n\nDEFINE_APPLICATION_MAIN(MyApp)\n<|endoftext|>"}
{"text":"<commit_before>\/* Please refer to license.txt *\/\n\n#include \"interface.hpp\"\n\n#include <iostream>\n\n#include \"..\/graphic\/2d\/2d.hpp\"\n#include \"..\/graphic\/window\/window.hpp\"\n\n#include \"..\/file\/file.hpp\"\n\nnamespace GEngine\n{\n\nnamespace mui\n{\n\nInterface::Interface()\n{\n\t\/\/d2d = nullptr;\n\tcegui_system = nullptr;\n\n\tcegui_configfile_path = CEGUI_CONFIGFILE_PATH;\n\tcegui_logfile_path = CEGUI_LOGFILE_PATH;\n\tcegui_schemes_path = CEGUI_SCHEMES_PATH;\n\tcegui_imagesets_path = CEGUI_IMAGESETS_PATH;\n\tcegui_fonts_path = CEGUI_FONTS_PATH;\n\tcegui_layouts_path = CEGUI_LAYOUTS_PATH;\n\tcegui_looknfeels_path = CEGUI_LOOKNFEELS_PATH;\n\tcegui_luascripts_path = CEGUI_LUASCRIPTS_PATH;\n\n\tcegui_resourceprovider = nullptr;\n\t\/\/cegui_root_window = nullptr;\n\t\/\/cegui_windowmanager = nullptr;\n}\n\nInterface::~Interface()\n{\n\t\/*if (d2d)\n\t{\n\t\td2d = nullptr;\n\t}\n\n\tif (cegui_root_window)\n\t{\n\t\tdelete cegui_root_window;\n\t}*\/\n\n\tcegui_system = nullptr;\n\tcegui_resourceprovider = nullptr;\n}\n\nbool Interface::initialize(mgfx::d2d::D2D &d2d, std::vector<std::string> cegui_schemes)\n{\n\t\/\/d2d = &_d2d;\n\t\/\/d2d->window->showMouseCursor(false); \/\/CEGUI's default schemes are fugly with the mouse or don't have one at all. Using default sfml mouse. \/\/TODO: Handle mouse.\n\n\ttry\n\t{\n\t\tCEGUI::OpenGLRenderer& myRenderer = CEGUI::OpenGLRenderer::create();\n\n\t\tstd::string log_directory(\"\");\n\t\tmfile::FileManager::separatePathFromFilename(cegui_logfile_path, log_directory);\n\t\t\/\/Check if the directory the cegui logfile is going to be kept in exists. It not, create it.\n\t\tif (!mfile::FileManager::directoryExists(log_directory))\n\t\t{\n\t\t\tmfile::FileManager::mkDir(log_directory);\n\t\t}\n\n\t\tCEGUI::System::create(myRenderer, nullptr, nullptr, nullptr, nullptr, cegui_configfile_path, cegui_logfile_path);\n\n\t\t\/\/Initialise the required dirs for the CEGUI DefaultResourceProvider.\n\t\tcegui_resourceprovider = static_cast<CEGUI::DefaultResourceProvider*>(CEGUI::System::getSingleton().getResourceProvider());\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"imagesets\", cegui_imagesets_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"fonts\", cegui_fonts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"layouts\", cegui_layouts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"looknfeels\", cegui_looknfeels_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"lua_scripts\", cegui_luascripts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"schemes\", cegui_schemes_path);\n\t\t\/\/According to the documentation, this is only really needed if you are using Xerces and need to specify the schemas location.\n\t\t\/\/cegui_resourceprovider->setResourceGroupDirectory(\"schemas\", \"datafiles\/xml_schemas\/\");\n\n\t\t\/\/Set the default resource groups to be used\n\t\tCEGUI::ImageManager::setImagesetDefaultResourceGroup(\"imagesets\");\n\t\tCEGUI::Font::setDefaultResourceGroup(\"fonts\");\n\t\tCEGUI::Scheme::setDefaultResourceGroup(\"schemes\");\n\t\tCEGUI::ScriptModule::setDefaultResourceGroup(\"lua_scripts\");\n\t\tCEGUI::WidgetLookManager::setDefaultResourceGroup(\"looknfeels\");\n\t\tCEGUI::WindowManager::setDefaultResourceGroup(\"layouts\");\n\t\t\/\/This is only needed if the resourceprovider's schemas is set.\n\t\t\/\/Setup default group for validation schemas.\n\t\t\/\/CEGUI::XMLParser* parser = CEGUI::System::getSingleton().getXMLParser();\n\t\t\/\/if (parser->isPropertyPresent(\"SchemaDefaultResourceGroup\"))\n\t\t\/\/{\n\t\t\/\/\tparser->setProperty(\"SchemaDefaultResourceGroup\", \"schemas\");\n\t\t\/\/}\n\n\t\t\/\/Load the schemes specified in cegui_schemes.\n\t\tfor (std::vector<std::string>::iterator i = cegui_schemes.begin(); i != cegui_schemes.end(); ++i) \/\/TODO: Vector iterator.\n\t\t{\n\t\t\tCEGUI::SchemeManager::getSingleton().createFromFile(*i + \".scheme\");\n\t\t\tloaded_schemes.push_back(*i); \/\/Save it so we know how to access it later, if needed.\n\t\t}\n\n\t\t\/\/TODO: Handle the mouse.\n\t\t\/*CEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().setDefaultImage(\"GlossySerpent\/MouseArrow\");\n\t\tCEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().show();*\/\n\n\n\t\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().setDefaultTooltipType(\"GlossySerpent\/Tooltip\"); \/\/TODO: Set in XML, if possible.\n\n\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d.window->window2d);\n\t\tCEGUI::System::getSingleton().getDefaultGUIContext().injectMousePosition(coords.x, coords.y);\n\n\t\t\/\/Map SFML Key and Mouse stuff to CEGUI stuff for injecting input into CEGUI.\n\t\tmapSFMLKeysToCEGUI();\n\t\tmapSFMLMouseToCEGUI();\n\n\t\td2d.cegui_gui_context = &CEGUI::System::getSingleton().getDefaultGUIContext(); \/\/Point this accordingly.\n\t\td2d.cegui_renderer = &myRenderer;\n\t\td2d.default_d2d = true;\n\t}\n\tcatch(CEGUI::Exception& e)\n\t{\n\t\tstd::cout << \"CEGUI Exception:\" << e.getMessage().c_str() << \"\\n\";\n\t\treturn false;\n\t}\n\n\taddD2D(d2d); \/\/Add the D2D to the list of D2Ds.\n\n\treturn true; \/\/Success.\n}\n\nbool Interface::loadFont(std::string filepath)\n{\n\tfont.loadFromFile(filepath);\n\n\treturn true;\n}\n\nvoid Interface::update()\n{\n\tstd::vector<mgfx::d2d::D2D* >::iterator iter = windows.begin();\n\tfor (iter = windows.begin(); iter != windows.end(); ++iter)\n\t\/\/for (int i = 0; i < windows.size(); ++i)\n\t{\n\t\tmgfx::d2d::D2D *d2d = *iter; \/\/First point to this so I don't have to type crazy things every time.\n\t\t\/\/mgfx::d2d::D2D *d2d = windows[i]; \/\/First point to this so I don't have to type crazy things every time.\n\t\tCEGUI::GUIContext& context = *d2d->cegui_gui_context; \/\/Next, point to this so that I don't have to type out the full thing every time.\n\n\t\tcontext.getMouseCursor().draw(); \/\/Force draw it because it doesn't seem to want to work otherwise.\n\n\t\t\/\/Now, handle injecting events into CEGUI.\n\t\tfor (unsigned int i = 0; i < d2d->window->events.size(); ++i)\n\t\t{\n\t\t\tswitch (d2d->window->events[i].type)\n\t\t\t{\n\t\t\tcase sf::Event::KeyPressed:\n\t\t\t\tcontext.injectKeyDown(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::KeyReleased:\n\t\t\t\tcontext.injectKeyUp(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::TextEntered:\n\t\t\t\tcontext.injectChar(static_cast<char>(d2d->window->events[i].text.unicode));\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseMoved:\n\t\t\t\t{\n\t\t\t\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d->window->window2d);\n\t\t\t\t\tcontext.injectMousePosition(coords.x, coords.y);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseButtonPressed:\n\t\t\t\tif (sf::Mouse::isButtonPressed(sf::Mouse::Left))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::LeftButton);\n\t\t\t\t}\n\t\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Middle))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::MiddleButton);\n\t\t\t\t}\n\t\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Right))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::RightButton);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseButtonReleased:\n\t\t\t\tswitch (d2d->window->events[i].mouseButton.button)\n\t\t\t\t{\n\t\t\t\tcase sf::Mouse::Left:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::LeftButton);\n\t\t\t\t\tbreak;\n\t\t\t\tcase sf::Mouse::Middle:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::MiddleButton);\n\t\t\t\t\tbreak;\n\t\t\t\tcase sf::Mouse::Right:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::RightButton);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseWheelMoved:\n\t\t\t\tcontext.injectMouseWheelChange(d2d->window->events[i].mouseWheel.delta);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tCEGUI::System::getSingleton().renderAllGUIContexts(); \/\/Render all of CEGUI's stuffs.\n\n\n\n\n\t\/*CEGUI::GUIContext& context = CEGUI::System::getSingleton().getDefaultGUIContext();\n\t\/\/First, handle injecting events into CEGUI.\n\tfor (unsigned int i = 0; i < d2d->window->events.size(); ++i)\n\t{\n\t\tswitch (d2d->window->events[i].type)\n\t\t{\n\t\tcase sf::Event::KeyPressed:\n\t\t\tcontext.injectKeyDown(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\tbreak;\n\t\tcase sf::Event::KeyReleased:\n\t\t\tcontext.injectKeyUp(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\tbreak;\n\t\tcase sf::Event::TextEntered:\n\t\t\tcontext.injectChar(static_cast<char>(d2d->window->events[i].text.unicode));\n\t\t\tbreak;\n\t\tcase sf::Event::MouseMoved:\n\t\t\t{\n\t\t\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d->window->window2d);\n\t\t\t\tcontext.injectMousePosition(coords.x, coords.y);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseButtonPressed:\n\t\t\tif (sf::Mouse::isButtonPressed(sf::Mouse::Left))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::LeftButton);\n\t\t\t}\n\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Middle))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::MiddleButton);\n\t\t\t}\n\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Right))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::RightButton);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseButtonReleased:\n\t\t\tswitch (d2d->window->events[i].mouseButton.button)\n\t\t\t{\n\t\t\tcase sf::Mouse::Left:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::LeftButton);\n\t\t\t\tbreak;\n\t\t\tcase sf::Mouse::Middle:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::MiddleButton);\n\t\t\t\tbreak;\n\t\t\tcase sf::Mouse::Right:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::RightButton);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseWheelMoved:\n\t\t\tcontext.injectMouseWheelChange(d2d->window->events[i].mouseWheel.delta);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/onMouseButtonUp \/\/Use this to check if the frame window's button was pressed.\n\n\tCEGUI::System::getSingleton().renderAllGUIContexts(); \/\/Render all of CEGUI's stuffs. \/\/TODO: Make this work properly later.\n\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().draw();\n\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().getRenderTarget().draw();\n\tCEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().draw(); \/\/Force draw it because it doesn't seem to want to work otherwise.*\/\n}\n\nCEGUI::Window* Interface::getRootWindow(mgfx::d2d::D2D &d2d)\n{\n\t\/\/return cegui_root_window;\n\treturn d2d.getRootWindow();\n}\n\nvoid Interface::setRootWindow(CEGUI::Window *window, mgfx::d2d::D2D &d2d) \/\/Sets the root window.\n{\n\t\/*cegui_root_window = window;\n\tCEGUI::System::getSingleton().getDefaultGUIContext().setRootWindow(cegui_root_window);*\/\n\td2d.cegui_root_window = window;\n\td2d.cegui_gui_context->setRootWindow(d2d.cegui_root_window);\n}\n\nCEGUI::Window* Interface::createVirtualWindowFromLayout(std::string layout\/*, bool root*\/)\n{\n\tCEGUI::Window *window = CEGUI::WindowManager::getSingleton().loadLayoutFromFile(layout);\n\t\/*if (root) \/\/If it's supposed to be the root window...\n\t{\n\t\tsetRootWindow(window); \/\/Set it.\n\t}*\/\n\n\treturn window;\n}\n\nvoid Interface::addD2D(mgfx::d2d::D2D &d2d)\n{\n\tif (!d2d.cegui_renderer)\n\t{\n\t\td2d.cegui_renderer = &CEGUI::OpenGLRenderer::create();\n\t}\n\n\tif (!d2d.cegui_gui_context)\n\t{\n\t\td2d.cegui_gui_context = &CEGUI::System::getSingleton().createGUIContext(d2d.cegui_renderer->getDefaultRenderTarget());\n\t}\n\n\twindows.push_back(&d2d);\n}\n\n} \/\/namespace mui\n\n} \/\/namespace GEngine\n<commit_msg>Stuff<commit_after>\/* Please refer to license.txt *\/\n\n#include \"interface.hpp\"\n\n#include <iostream>\n\n#include \"..\/graphic\/2d\/2d.hpp\"\n#include \"..\/graphic\/window\/window.hpp\"\n\n#include \"..\/file\/file.hpp\"\n\nnamespace GEngine\n{\n\nnamespace mui\n{\n\nInterface::Interface()\n{\n\t\/\/d2d = nullptr;\n\tcegui_system = nullptr;\n\n\tcegui_configfile_path = CEGUI_CONFIGFILE_PATH;\n\tcegui_logfile_path = CEGUI_LOGFILE_PATH;\n\tcegui_schemes_path = CEGUI_SCHEMES_PATH;\n\tcegui_imagesets_path = CEGUI_IMAGESETS_PATH;\n\tcegui_fonts_path = CEGUI_FONTS_PATH;\n\tcegui_layouts_path = CEGUI_LAYOUTS_PATH;\n\tcegui_looknfeels_path = CEGUI_LOOKNFEELS_PATH;\n\tcegui_luascripts_path = CEGUI_LUASCRIPTS_PATH;\n\n\tcegui_resourceprovider = nullptr;\n\t\/\/cegui_root_window = nullptr;\n\t\/\/cegui_windowmanager = nullptr;\n}\n\nInterface::~Interface()\n{\n\t\/*if (d2d)\n\t{\n\t\td2d = nullptr;\n\t}\n\n\tif (cegui_root_window)\n\t{\n\t\tdelete cegui_root_window;\n\t}*\/\n\n\tcegui_system = nullptr;\n\tcegui_resourceprovider = nullptr;\n}\n\nbool Interface::initialize(mgfx::d2d::D2D &d2d, std::vector<std::string> cegui_schemes)\n{\n\t\/\/d2d = &_d2d;\n\t\/\/d2d->window->showMouseCursor(false); \/\/CEGUI's default schemes are fugly with the mouse or don't have one at all. Using default sfml mouse. \/\/TODO: Handle mouse.\n\n\ttry\n\t{\n\t\tCEGUI::OpenGLRenderer& myRenderer = CEGUI::OpenGLRenderer::create();\n\n\t\tstd::string log_directory(\"\");\n\t\tmfile::FileManager::separatePathFromFilename(cegui_logfile_path, log_directory);\n\t\t\/\/Check if the directory the cegui logfile is going to be kept in exists. It not, create it.\n\t\tif (!mfile::FileManager::directoryExists(log_directory))\n\t\t{\n\t\t\tmfile::FileManager::mkDir(log_directory);\n\t\t}\n\n\t\tCEGUI::System::create(myRenderer, nullptr, nullptr, nullptr, nullptr, cegui_configfile_path, cegui_logfile_path);\n\n\t\t\/\/Initialise the required dirs for the CEGUI DefaultResourceProvider.\n\t\tcegui_resourceprovider = static_cast<CEGUI::DefaultResourceProvider*>(CEGUI::System::getSingleton().getResourceProvider());\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"imagesets\", cegui_imagesets_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"fonts\", cegui_fonts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"layouts\", cegui_layouts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"looknfeels\", cegui_looknfeels_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"lua_scripts\", cegui_luascripts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"schemes\", cegui_schemes_path);\n\t\t\/\/According to the documentation, this is only really needed if you are using Xerces and need to specify the schemas location.\n\t\t\/\/cegui_resourceprovider->setResourceGroupDirectory(\"schemas\", \"datafiles\/xml_schemas\/\");\n\n\t\t\/\/Set the default resource groups to be used\n\t\tCEGUI::ImageManager::setImagesetDefaultResourceGroup(\"imagesets\");\n\t\tCEGUI::Font::setDefaultResourceGroup(\"fonts\");\n\t\tCEGUI::Scheme::setDefaultResourceGroup(\"schemes\");\n\t\tCEGUI::ScriptModule::setDefaultResourceGroup(\"lua_scripts\");\n\t\tCEGUI::WidgetLookManager::setDefaultResourceGroup(\"looknfeels\");\n\t\tCEGUI::WindowManager::setDefaultResourceGroup(\"layouts\");\n\t\t\/\/This is only needed if the resourceprovider's schemas is set.\n\t\t\/\/Setup default group for validation schemas.\n\t\t\/\/CEGUI::XMLParser* parser = CEGUI::System::getSingleton().getXMLParser();\n\t\t\/\/if (parser->isPropertyPresent(\"SchemaDefaultResourceGroup\"))\n\t\t\/\/{\n\t\t\/\/\tparser->setProperty(\"SchemaDefaultResourceGroup\", \"schemas\");\n\t\t\/\/}\n\n\t\t\/\/Load the schemes specified in cegui_schemes.\n\t\tfor (std::vector<std::string>::iterator i = cegui_schemes.begin(); i != cegui_schemes.end(); ++i) \/\/TODO: Vector iterator.\n\t\t{\n\t\t\tCEGUI::SchemeManager::getSingleton().createFromFile(*i + \".scheme\");\n\t\t\tloaded_schemes.push_back(*i); \/\/Save it so we know how to access it later, if needed.\n\t\t}\n\n\t\t\/\/TODO: Handle the mouse.\n\t\t\/*CEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().setDefaultImage(\"GlossySerpent\/MouseArrow\");\n\t\tCEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().show();*\/\n\n\n\t\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().setDefaultTooltipType(\"GlossySerpent\/Tooltip\"); \/\/TODO: Set in XML, if possible.\n\n\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d.window->window2d);\n\t\tCEGUI::System::getSingleton().getDefaultGUIContext().injectMousePosition(coords.x, coords.y);\n\n\t\t\/\/Map SFML Key and Mouse stuff to CEGUI stuff for injecting input into CEGUI.\n\t\tmapSFMLKeysToCEGUI();\n\t\tmapSFMLMouseToCEGUI();\n\n\t\td2d.cegui_gui_context = &CEGUI::System::getSingleton().getDefaultGUIContext(); \/\/Point this accordingly.\n\t\td2d.cegui_renderer = &myRenderer;\n\t\td2d.default_d2d = true;\n\t}\n\tcatch(CEGUI::Exception& e)\n\t{\n\t\tstd::cout << \"CEGUI Exception:\" << e.getMessage().c_str() << \"\\n\";\n\t\treturn false;\n\t}\n\n\taddD2D(d2d); \/\/Add the D2D to the list of D2Ds.\n\n\treturn true; \/\/Success.\n}\n\nbool Interface::loadFont(std::string filepath)\n{\n\tfont.loadFromFile(filepath);\n\n\treturn true;\n}\n\nvoid Interface::update()\n{\n\tstd::vector<mgfx::d2d::D2D* >::iterator iter;\n\tfor (iter = windows.begin(); iter != windows.end(); ++iter)\n\t\/\/for (int i = 0; i < windows.size(); ++i)\n\t{\n\t\tmgfx::d2d::D2D *d2d = *iter; \/\/First point to this so I don't have to type crazy things every time.\n\t\t\/\/mgfx::d2d::D2D *d2d = windows[i]; \/\/First point to this so I don't have to type crazy things every time.\n\t\tCEGUI::GUIContext& context = *d2d->cegui_gui_context; \/\/Next, point to this so that I don't have to type out the full thing every time.\n\n\t\tcontext.getMouseCursor().draw(); \/\/Force draw it because it doesn't seem to want to work otherwise.\n\n\t\t\/\/Now, handle injecting events into CEGUI.\n\t\tfor (unsigned int i = 0; i < d2d->window->events.size(); ++i)\n\t\t{\n\t\t\tswitch (d2d->window->events[i].type)\n\t\t\t{\n\t\t\tcase sf::Event::KeyPressed:\n\t\t\t\tcontext.injectKeyDown(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::KeyReleased:\n\t\t\t\tcontext.injectKeyUp(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::TextEntered:\n\t\t\t\tcontext.injectChar(static_cast<char>(d2d->window->events[i].text.unicode));\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseMoved:\n\t\t\t\t{\n\t\t\t\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d->window->window2d);\n\t\t\t\t\tcontext.injectMousePosition(coords.x, coords.y);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseButtonPressed:\n\t\t\t\tif (sf::Mouse::isButtonPressed(sf::Mouse::Left))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::LeftButton);\n\t\t\t\t}\n\t\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Middle))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::MiddleButton);\n\t\t\t\t}\n\t\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Right))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::RightButton);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseButtonReleased:\n\t\t\t\tswitch (d2d->window->events[i].mouseButton.button)\n\t\t\t\t{\n\t\t\t\tcase sf::Mouse::Left:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::LeftButton);\n\t\t\t\t\tbreak;\n\t\t\t\tcase sf::Mouse::Middle:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::MiddleButton);\n\t\t\t\t\tbreak;\n\t\t\t\tcase sf::Mouse::Right:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::RightButton);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseWheelMoved:\n\t\t\t\tcontext.injectMouseWheelChange(d2d->window->events[i].mouseWheel.delta);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tCEGUI::System::getSingleton().renderAllGUIContexts(); \/\/Render all of CEGUI's stuffs.\n\n\n\n\n\t\/*CEGUI::GUIContext& context = CEGUI::System::getSingleton().getDefaultGUIContext();\n\t\/\/First, handle injecting events into CEGUI.\n\tfor (unsigned int i = 0; i < d2d->window->events.size(); ++i)\n\t{\n\t\tswitch (d2d->window->events[i].type)\n\t\t{\n\t\tcase sf::Event::KeyPressed:\n\t\t\tcontext.injectKeyDown(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\tbreak;\n\t\tcase sf::Event::KeyReleased:\n\t\t\tcontext.injectKeyUp(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\tbreak;\n\t\tcase sf::Event::TextEntered:\n\t\t\tcontext.injectChar(static_cast<char>(d2d->window->events[i].text.unicode));\n\t\t\tbreak;\n\t\tcase sf::Event::MouseMoved:\n\t\t\t{\n\t\t\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d->window->window2d);\n\t\t\t\tcontext.injectMousePosition(coords.x, coords.y);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseButtonPressed:\n\t\t\tif (sf::Mouse::isButtonPressed(sf::Mouse::Left))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::LeftButton);\n\t\t\t}\n\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Middle))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::MiddleButton);\n\t\t\t}\n\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Right))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::RightButton);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseButtonReleased:\n\t\t\tswitch (d2d->window->events[i].mouseButton.button)\n\t\t\t{\n\t\t\tcase sf::Mouse::Left:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::LeftButton);\n\t\t\t\tbreak;\n\t\t\tcase sf::Mouse::Middle:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::MiddleButton);\n\t\t\t\tbreak;\n\t\t\tcase sf::Mouse::Right:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::RightButton);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseWheelMoved:\n\t\t\tcontext.injectMouseWheelChange(d2d->window->events[i].mouseWheel.delta);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/onMouseButtonUp \/\/Use this to check if the frame window's button was pressed.\n\n\tCEGUI::System::getSingleton().renderAllGUIContexts(); \/\/Render all of CEGUI's stuffs. \/\/TODO: Make this work properly later.\n\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().draw();\n\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().getRenderTarget().draw();\n\tCEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().draw(); \/\/Force draw it because it doesn't seem to want to work otherwise.*\/\n}\n\nCEGUI::Window* Interface::getRootWindow(mgfx::d2d::D2D &d2d)\n{\n\t\/\/return cegui_root_window;\n\treturn d2d.getRootWindow();\n}\n\nvoid Interface::setRootWindow(CEGUI::Window *window, mgfx::d2d::D2D &d2d) \/\/Sets the root window.\n{\n\t\/*cegui_root_window = window;\n\tCEGUI::System::getSingleton().getDefaultGUIContext().setRootWindow(cegui_root_window);*\/\n\td2d.cegui_root_window = window;\n\td2d.cegui_gui_context->setRootWindow(d2d.cegui_root_window);\n}\n\nCEGUI::Window* Interface::createVirtualWindowFromLayout(std::string layout\/*, bool root*\/)\n{\n\tCEGUI::Window *window = CEGUI::WindowManager::getSingleton().loadLayoutFromFile(layout);\n\t\/*if (root) \/\/If it's supposed to be the root window...\n\t{\n\t\tsetRootWindow(window); \/\/Set it.\n\t}*\/\n\n\treturn window;\n}\n\nvoid Interface::addD2D(mgfx::d2d::D2D &d2d)\n{\n\tif (!d2d.cegui_renderer)\n\t{\n\t\td2d.cegui_renderer = &CEGUI::OpenGLRenderer::create();\n\t}\n\n\tif (!d2d.cegui_gui_context)\n\t{\n\t\td2d.cegui_gui_context = &CEGUI::System::getSingleton().createGUIContext(d2d.cegui_renderer->getDefaultRenderTarget());\n\t}\n\n\twindows.push_back(&d2d);\n}\n\n} \/\/namespace mui\n\n} \/\/namespace GEngine\n<|endoftext|>"}
{"text":"<commit_before>\/* Please refer to license.txt *\/\n\n#include \"interface.hpp\"\n\n#include <iostream>\n\n#include \"..\/graphic\/2d\/2d.hpp\"\n#include \"..\/graphic\/window\/window.hpp\"\n\n#include \"..\/file\/file.hpp\"\n\nnamespace GEngine\n{\n\nnamespace mui\n{\n\nInterface::Interface()\n{\n\t\/\/d2d = nullptr;\n\tcegui_system = nullptr;\n\n\tcegui_configfile_path = CEGUI_CONFIGFILE_PATH;\n\tcegui_logfile_path = CEGUI_LOGFILE_PATH;\n\tcegui_schemes_path = CEGUI_SCHEMES_PATH;\n\tcegui_imagesets_path = CEGUI_IMAGESETS_PATH;\n\tcegui_fonts_path = CEGUI_FONTS_PATH;\n\tcegui_layouts_path = CEGUI_LAYOUTS_PATH;\n\tcegui_looknfeels_path = CEGUI_LOOKNFEELS_PATH;\n\tcegui_luascripts_path = CEGUI_LUASCRIPTS_PATH;\n\n\tcegui_resourceprovider = nullptr;\n\t\/\/cegui_root_window = nullptr;\n\t\/\/cegui_windowmanager = nullptr;\n}\n\nInterface::~Interface()\n{\n\t\/*if (d2d)\n\t{\n\t\td2d = nullptr;\n\t}\n\n\tif (cegui_root_window)\n\t{\n\t\tdelete cegui_root_window;\n\t}*\/\n\n\tcegui_system = nullptr;\n\tcegui_resourceprovider = nullptr;\n}\n\nbool Interface::initialize(mgfx::d2d::D2D &d2d, std::vector<std::string> cegui_schemes)\n{\n\t\/\/d2d = &_d2d;\n\t\/\/d2d->window->showMouseCursor(false); \/\/CEGUI's default schemes are fugly with the mouse or don't have one at all. Using default sfml mouse. \/\/TODO: Handle mouse.\n\n\ttry\n\t{\n\t\tCEGUI::OpenGLRenderer& myRenderer = CEGUI::OpenGLRenderer::create();\n\n\t\tstd::string log_directory(\"\");\n\t\tmfile::FileManager::separatePathFromFilename(cegui_logfile_path, log_directory);\n\t\t\/\/Check if the directory the cegui logfile is going to be kept in exists. It not, create it.\n\t\tif (!mfile::FileManager::directoryExists(log_directory))\n\t\t{\n\t\t\tmfile::FileManager::mkDir(log_directory);\n\t\t}\n\n\t\tCEGUI::System::create(myRenderer, nullptr, nullptr, nullptr, nullptr, cegui_configfile_path, cegui_logfile_path);\n\n\t\t\/\/Initialise the required dirs for the CEGUI DefaultResourceProvider.\n\t\tcegui_resourceprovider = static_cast<CEGUI::DefaultResourceProvider*>(CEGUI::System::getSingleton().getResourceProvider());\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"imagesets\", cegui_imagesets_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"fonts\", cegui_fonts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"layouts\", cegui_layouts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"looknfeels\", cegui_looknfeels_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"lua_scripts\", cegui_luascripts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"schemes\", cegui_schemes_path);\n\t\t\/\/According to the documentation, this is only really needed if you are using Xerces and need to specify the schemas location.\n\t\t\/\/cegui_resourceprovider->setResourceGroupDirectory(\"schemas\", \"datafiles\/xml_schemas\/\");\n\n\t\t\/\/Set the default resource groups to be used\n\t\tCEGUI::ImageManager::setImagesetDefaultResourceGroup(\"imagesets\");\n\t\tCEGUI::Font::setDefaultResourceGroup(\"fonts\");\n\t\tCEGUI::Scheme::setDefaultResourceGroup(\"schemes\");\n\t\tCEGUI::ScriptModule::setDefaultResourceGroup(\"lua_scripts\");\n\t\tCEGUI::WidgetLookManager::setDefaultResourceGroup(\"looknfeels\");\n\t\tCEGUI::WindowManager::setDefaultResourceGroup(\"layouts\");\n\t\t\/\/This is only needed if the resourceprovider's schemas is set.\n\t\t\/\/Setup default group for validation schemas.\n\t\t\/\/CEGUI::XMLParser* parser = CEGUI::System::getSingleton().getXMLParser();\n\t\t\/\/if (parser->isPropertyPresent(\"SchemaDefaultResourceGroup\"))\n\t\t\/\/{\n\t\t\/\/\tparser->setProperty(\"SchemaDefaultResourceGroup\", \"schemas\");\n\t\t\/\/}\n\n\t\t\/\/Load the schemes specified in cegui_schemes.\n\t\tfor (std::vector<std::string>::iterator i = cegui_schemes.begin(); i != cegui_schemes.end(); ++i) \/\/TODO: Vector iterator.\n\t\t{\n\t\t\tCEGUI::SchemeManager::getSingleton().createFromFile(*i + \".scheme\");\n\t\t\tloaded_schemes.push_back(*i); \/\/Save it so we know how to access it later, if needed.\n\t\t}\n\n\t\t\/\/TODO: Handle the mouse.\n\t\t\/*CEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().setDefaultImage(\"GlossySerpent\/MouseArrow\");\n\t\tCEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().show();*\/\n\n\n\t\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().setDefaultTooltipType(\"GlossySerpent\/Tooltip\"); \/\/TODO: Set in XML, if possible.\n\n\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d.window->window2d);\n\t\tCEGUI::System::getSingleton().getDefaultGUIContext().injectMousePosition(coords.x, coords.y);\n\n\t\t\/\/Map SFML Key and Mouse stuff to CEGUI stuff for injecting input into CEGUI.\n\t\tmapSFMLKeysToCEGUI();\n\t\tmapSFMLMouseToCEGUI();\n\n\t\td2d.cegui_gui_context = &CEGUI::System::getSingleton().getDefaultGUIContext(); \/\/Point this accordingly.\n\t\td2d.cegui_renderer = &myRenderer;\n\t\td2d.default_d2d = true;\n\t}\n\tcatch(CEGUI::Exception& e)\n\t{\n\t\tstd::cout << \"CEGUI Exception:\" << e.getMessage().c_str() << \"\\n\";\n\t\treturn false;\n\t}\n\n\taddD2D(d2d); \/\/Add the D2D to the list of D2Ds.\n\n\treturn true; \/\/Success.\n}\n\nbool Interface::loadFont(std::string filepath)\n{\n\tfont.loadFromFile(filepath);\n\n\treturn true;\n}\n\nvoid Interface::update()\n{\n\tfor (std::vector<mgfx::d2d::D2D* >::iterator iter = windows.begin(); iter != windows.end(); ++iter)\n\t\/\/for (int i = 0; i < windows.size(); ++i)\n\t{\n\t\tif (windows.size() > 1)\n\t\t{\n\t\t\t\/\/std::cout << \"More than one & i = \" << i << \"\\n\";\n\t\t\t\/\/std::cout << \"More than 1.\\n\";\n\t\t}\n\t\tmgfx::d2d::D2D *d2d = *iter; \/\/First point to this so I don't have to type crazy things every time.\n\t\t\/\/mgfx::d2d::D2D *d2d = windows[i]; \/\/First point to this so I don't have to type crazy things every time.\n\t\tCEGUI::GUIContext& context = *d2d->cegui_gui_context; \/\/Next, point to this so that I don't have to type out the full thing every time.\n\n\t\tcontext.getMouseCursor().draw(); \/\/Force draw it because it doesn't seem to want to work otherwise.\n\n\t\t\/\/Now, handle injecting events into CEGUI.\n\t\tfor (unsigned int i = 0; i < d2d->window->events.size(); ++i)\n\t\t{\n\t\t\tswitch (d2d->window->events[i].type)\n\t\t\t{\n\t\t\tcase sf::Event::KeyPressed:\n\t\t\t\tcontext.injectKeyDown(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::KeyReleased:\n\t\t\t\tcontext.injectKeyUp(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::TextEntered:\n\t\t\t\tcontext.injectChar(static_cast<char>(d2d->window->events[i].text.unicode));\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseMoved:\n\t\t\t\t{\n\t\t\t\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d->window->window2d);\n\t\t\t\t\tcontext.injectMousePosition(coords.x, coords.y);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseButtonPressed:\n\t\t\t\tif (sf::Mouse::isButtonPressed(sf::Mouse::Left))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::LeftButton);\n\t\t\t\t}\n\t\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Middle))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::MiddleButton);\n\t\t\t\t}\n\t\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Right))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::RightButton);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseButtonReleased:\n\t\t\t\tswitch (d2d->window->events[i].mouseButton.button)\n\t\t\t\t{\n\t\t\t\tcase sf::Mouse::Left:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::LeftButton);\n\t\t\t\t\tbreak;\n\t\t\t\tcase sf::Mouse::Middle:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::MiddleButton);\n\t\t\t\t\tbreak;\n\t\t\t\tcase sf::Mouse::Right:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::RightButton);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseWheelMoved:\n\t\t\t\tcontext.injectMouseWheelChange(d2d->window->events[i].mouseWheel.delta);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tCEGUI::System::getSingleton().renderAllGUIContexts(); \/\/Render all of CEGUI's stuffs.\n\n\n\n\n\t\/*CEGUI::GUIContext& context = CEGUI::System::getSingleton().getDefaultGUIContext();\n\t\/\/First, handle injecting events into CEGUI.\n\tfor (unsigned int i = 0; i < d2d->window->events.size(); ++i)\n\t{\n\t\tswitch (d2d->window->events[i].type)\n\t\t{\n\t\tcase sf::Event::KeyPressed:\n\t\t\tcontext.injectKeyDown(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\tbreak;\n\t\tcase sf::Event::KeyReleased:\n\t\t\tcontext.injectKeyUp(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\tbreak;\n\t\tcase sf::Event::TextEntered:\n\t\t\tcontext.injectChar(static_cast<char>(d2d->window->events[i].text.unicode));\n\t\t\tbreak;\n\t\tcase sf::Event::MouseMoved:\n\t\t\t{\n\t\t\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d->window->window2d);\n\t\t\t\tcontext.injectMousePosition(coords.x, coords.y);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseButtonPressed:\n\t\t\tif (sf::Mouse::isButtonPressed(sf::Mouse::Left))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::LeftButton);\n\t\t\t}\n\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Middle))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::MiddleButton);\n\t\t\t}\n\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Right))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::RightButton);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseButtonReleased:\n\t\t\tswitch (d2d->window->events[i].mouseButton.button)\n\t\t\t{\n\t\t\tcase sf::Mouse::Left:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::LeftButton);\n\t\t\t\tbreak;\n\t\t\tcase sf::Mouse::Middle:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::MiddleButton);\n\t\t\t\tbreak;\n\t\t\tcase sf::Mouse::Right:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::RightButton);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseWheelMoved:\n\t\t\tcontext.injectMouseWheelChange(d2d->window->events[i].mouseWheel.delta);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/onMouseButtonUp \/\/Use this to check if the frame window's button was pressed.\n\n\tCEGUI::System::getSingleton().renderAllGUIContexts(); \/\/Render all of CEGUI's stuffs. \/\/TODO: Make this work properly later.\n\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().draw();\n\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().getRenderTarget().draw();\n\tCEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().draw(); \/\/Force draw it because it doesn't seem to want to work otherwise.*\/\n}\n\nCEGUI::Window* Interface::getRootWindow(mgfx::d2d::D2D &d2d)\n{\n\t\/\/return cegui_root_window;\n\treturn d2d.getRootWindow();\n}\n\nvoid Interface::setRootWindow(CEGUI::Window *window, mgfx::d2d::D2D &d2d) \/\/Sets the root window.\n{\n\t\/*cegui_root_window = window;\n\tCEGUI::System::getSingleton().getDefaultGUIContext().setRootWindow(cegui_root_window);*\/\n\td2d.cegui_root_window = window;\n\td2d.cegui_gui_context->setRootWindow(d2d.cegui_root_window);\n}\n\nCEGUI::Window* Interface::createVirtualWindowFromLayout(std::string layout\/*, bool root*\/)\n{\n\tCEGUI::Window *window = CEGUI::WindowManager::getSingleton().loadLayoutFromFile(layout);\n\t\/*if (root) \/\/If it's supposed to be the root window...\n\t{\n\t\tsetRootWindow(window); \/\/Set it.\n\t}*\/\n\n\treturn window;\n}\n\nvoid Interface::addD2D(mgfx::d2d::D2D &d2d)\n{\n\tif (!d2d.cegui_renderer)\n\t{\n\t\t\/\/When creating a renderer, perhaps force SFML to set the viewport to the d2d's window?\n\t\td2d.cegui_renderer = &CEGUI::OpenGLRenderer::create();\n\t}\n\n\tif (!d2d.cegui_gui_context)\n\t{\n\t\td2d.cegui_gui_context = &CEGUI::System::getSingleton().createGUIContext(d2d.cegui_renderer->getDefaultRenderTarget());\n\t}\n\n\twindows.push_back(&d2d);\n}\n\n} \/\/namespace mui\n\n} \/\/namespace GEngine\n<commit_msg>Testing if this contexts thing is working...<commit_after>\/* Please refer to license.txt *\/\n\n#include \"interface.hpp\"\n\n#include <iostream>\n\n#include \"..\/graphic\/2d\/2d.hpp\"\n#include \"..\/graphic\/window\/window.hpp\"\n\n#include \"..\/file\/file.hpp\"\n\nnamespace GEngine\n{\n\nnamespace mui\n{\n\nInterface::Interface()\n{\n\t\/\/d2d = nullptr;\n\tcegui_system = nullptr;\n\n\tcegui_configfile_path = CEGUI_CONFIGFILE_PATH;\n\tcegui_logfile_path = CEGUI_LOGFILE_PATH;\n\tcegui_schemes_path = CEGUI_SCHEMES_PATH;\n\tcegui_imagesets_path = CEGUI_IMAGESETS_PATH;\n\tcegui_fonts_path = CEGUI_FONTS_PATH;\n\tcegui_layouts_path = CEGUI_LAYOUTS_PATH;\n\tcegui_looknfeels_path = CEGUI_LOOKNFEELS_PATH;\n\tcegui_luascripts_path = CEGUI_LUASCRIPTS_PATH;\n\n\tcegui_resourceprovider = nullptr;\n\t\/\/cegui_root_window = nullptr;\n\t\/\/cegui_windowmanager = nullptr;\n}\n\nInterface::~Interface()\n{\n\t\/*if (d2d)\n\t{\n\t\td2d = nullptr;\n\t}\n\n\tif (cegui_root_window)\n\t{\n\t\tdelete cegui_root_window;\n\t}*\/\n\n\tcegui_system = nullptr;\n\tcegui_resourceprovider = nullptr;\n}\n\nbool Interface::initialize(mgfx::d2d::D2D &d2d, std::vector<std::string> cegui_schemes)\n{\n\t\/\/d2d = &_d2d;\n\t\/\/d2d->window->showMouseCursor(false); \/\/CEGUI's default schemes are fugly with the mouse or don't have one at all. Using default sfml mouse. \/\/TODO: Handle mouse.\n\n\ttry\n\t{\n\t\tCEGUI::OpenGLRenderer& myRenderer = CEGUI::OpenGLRenderer::create();\n\n\t\tstd::string log_directory(\"\");\n\t\tmfile::FileManager::separatePathFromFilename(cegui_logfile_path, log_directory);\n\t\t\/\/Check if the directory the cegui logfile is going to be kept in exists. It not, create it.\n\t\tif (!mfile::FileManager::directoryExists(log_directory))\n\t\t{\n\t\t\tmfile::FileManager::mkDir(log_directory);\n\t\t}\n\n\t\tCEGUI::System::create(myRenderer, nullptr, nullptr, nullptr, nullptr, cegui_configfile_path, cegui_logfile_path);\n\n\t\t\/\/Initialise the required dirs for the CEGUI DefaultResourceProvider.\n\t\tcegui_resourceprovider = static_cast<CEGUI::DefaultResourceProvider*>(CEGUI::System::getSingleton().getResourceProvider());\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"imagesets\", cegui_imagesets_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"fonts\", cegui_fonts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"layouts\", cegui_layouts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"looknfeels\", cegui_looknfeels_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"lua_scripts\", cegui_luascripts_path);\n\t\tcegui_resourceprovider->setResourceGroupDirectory(\"schemes\", cegui_schemes_path);\n\t\t\/\/According to the documentation, this is only really needed if you are using Xerces and need to specify the schemas location.\n\t\t\/\/cegui_resourceprovider->setResourceGroupDirectory(\"schemas\", \"datafiles\/xml_schemas\/\");\n\n\t\t\/\/Set the default resource groups to be used\n\t\tCEGUI::ImageManager::setImagesetDefaultResourceGroup(\"imagesets\");\n\t\tCEGUI::Font::setDefaultResourceGroup(\"fonts\");\n\t\tCEGUI::Scheme::setDefaultResourceGroup(\"schemes\");\n\t\tCEGUI::ScriptModule::setDefaultResourceGroup(\"lua_scripts\");\n\t\tCEGUI::WidgetLookManager::setDefaultResourceGroup(\"looknfeels\");\n\t\tCEGUI::WindowManager::setDefaultResourceGroup(\"layouts\");\n\t\t\/\/This is only needed if the resourceprovider's schemas is set.\n\t\t\/\/Setup default group for validation schemas.\n\t\t\/\/CEGUI::XMLParser* parser = CEGUI::System::getSingleton().getXMLParser();\n\t\t\/\/if (parser->isPropertyPresent(\"SchemaDefaultResourceGroup\"))\n\t\t\/\/{\n\t\t\/\/\tparser->setProperty(\"SchemaDefaultResourceGroup\", \"schemas\");\n\t\t\/\/}\n\n\t\t\/\/Load the schemes specified in cegui_schemes.\n\t\tfor (std::vector<std::string>::iterator i = cegui_schemes.begin(); i != cegui_schemes.end(); ++i) \/\/TODO: Vector iterator.\n\t\t{\n\t\t\tCEGUI::SchemeManager::getSingleton().createFromFile(*i + \".scheme\");\n\t\t\tloaded_schemes.push_back(*i); \/\/Save it so we know how to access it later, if needed.\n\t\t}\n\n\t\t\/\/TODO: Handle the mouse.\n\t\t\/*CEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().setDefaultImage(\"GlossySerpent\/MouseArrow\");\n\t\tCEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().show();*\/\n\n\n\t\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().setDefaultTooltipType(\"GlossySerpent\/Tooltip\"); \/\/TODO: Set in XML, if possible.\n\n\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d.window->window2d);\n\t\tCEGUI::System::getSingleton().getDefaultGUIContext().injectMousePosition(coords.x, coords.y);\n\n\t\t\/\/Map SFML Key and Mouse stuff to CEGUI stuff for injecting input into CEGUI.\n\t\tmapSFMLKeysToCEGUI();\n\t\tmapSFMLMouseToCEGUI();\n\n\t\td2d.cegui_gui_context = &CEGUI::System::getSingleton().getDefaultGUIContext(); \/\/Point this accordingly.\n\t\td2d.cegui_renderer = &myRenderer;\n\t\td2d.default_d2d = true;\n\t}\n\tcatch(CEGUI::Exception& e)\n\t{\n\t\tstd::cout << \"CEGUI Exception:\" << e.getMessage().c_str() << \"\\n\";\n\t\treturn false;\n\t}\n\n\taddD2D(d2d); \/\/Add the D2D to the list of D2Ds.\n\n\treturn true; \/\/Success.\n}\n\nbool Interface::loadFont(std::string filepath)\n{\n\tfont.loadFromFile(filepath);\n\n\treturn true;\n}\n\nvoid Interface::update()\n{\n\tfor (std::vector<mgfx::d2d::D2D* >::iterator iter = windows.begin(); iter != windows.end(); ++iter)\n\t\/\/for (int i = 0; i < windows.size(); ++i)\n\t{\n\t\tif (windows.size() > 1)\n\t\t{\n\t\t\t\/\/std::cout << \"More than one & i = \" << i << \"\\n\";\n\t\t\t\/\/std::cout << \"More than 1.\\n\";\n\t\t}\n\t\tmgfx::d2d::D2D *d2d = *iter; \/\/First point to this so I don't have to type crazy things every time.\n\t\t\/\/mgfx::d2d::D2D *d2d = windows[i]; \/\/First point to this so I don't have to type crazy things every time.\n\t\tCEGUI::GUIContext& context = *d2d->cegui_gui_context; \/\/Next, point to this so that I don't have to type out the full thing every time.\n\n\t\tcontext.getMouseCursor().draw(); \/\/Force draw it because it doesn't seem to want to work otherwise.\n\n\t\t\/\/Now, handle injecting events into CEGUI.\n\t\tfor (unsigned int i = 0; i < d2d->window->events.size(); ++i)\n\t\t{\n\t\t\tswitch (d2d->window->events[i].type)\n\t\t\t{\n\t\t\tcase sf::Event::KeyPressed:\n\t\t\t\tcontext.injectKeyDown(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::KeyReleased:\n\t\t\t\tcontext.injectKeyUp(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::TextEntered:\n\t\t\t\tcontext.injectChar(static_cast<char>(d2d->window->events[i].text.unicode));\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseMoved:\n\t\t\t\t{\n\t\t\t\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d->window->window2d);\n\t\t\t\t\tcontext.injectMousePosition(coords.x, coords.y);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseButtonPressed:\n\t\t\t\tif (sf::Mouse::isButtonPressed(sf::Mouse::Left))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::LeftButton);\n\t\t\t\t}\n\t\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Middle))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::MiddleButton);\n\t\t\t\t}\n\t\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Right))\n\t\t\t\t{\n\t\t\t\t\tcontext.injectMouseButtonDown(CEGUI::RightButton);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseButtonReleased:\n\t\t\t\tswitch (d2d->window->events[i].mouseButton.button)\n\t\t\t\t{\n\t\t\t\tcase sf::Mouse::Left:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::LeftButton);\n\t\t\t\t\tbreak;\n\t\t\t\tcase sf::Mouse::Middle:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::MiddleButton);\n\t\t\t\t\tbreak;\n\t\t\t\tcase sf::Mouse::Right:\n\t\t\t\t\tcontext.injectMouseButtonUp(CEGUI::RightButton);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase sf::Event::MouseWheelMoved:\n\t\t\t\tcontext.injectMouseWheelChange(d2d->window->events[i].mouseWheel.delta);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tglBegin(GL_TRIANGLES);\n\t\t\tglVertex3f(  0.0f,  1.0f, 0.0f );\n\t\t\tglVertex3f( -1.0f, -1.0f, 0.0f );\n\t\t\tglVertex3f(  1.0f, -1.0f, 0.0f );\n\t\tglEnd( );\n\t}\n\n\tCEGUI::System::getSingleton().renderAllGUIContexts(); \/\/Render all of CEGUI's stuffs.\n\n\n\n\n\t\/*CEGUI::GUIContext& context = CEGUI::System::getSingleton().getDefaultGUIContext();\n\t\/\/First, handle injecting events into CEGUI.\n\tfor (unsigned int i = 0; i < d2d->window->events.size(); ++i)\n\t{\n\t\tswitch (d2d->window->events[i].type)\n\t\t{\n\t\tcase sf::Event::KeyPressed:\n\t\t\tcontext.injectKeyDown(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\tbreak;\n\t\tcase sf::Event::KeyReleased:\n\t\t\tcontext.injectKeyUp(sfml_cegui_keymap[d2d->window->events[i].key.code]);\n\t\t\tbreak;\n\t\tcase sf::Event::TextEntered:\n\t\t\tcontext.injectChar(static_cast<char>(d2d->window->events[i].text.unicode));\n\t\t\tbreak;\n\t\tcase sf::Event::MouseMoved:\n\t\t\t{\n\t\t\t\tsf::Vector2i coords = sf::Mouse::getPosition(*d2d->window->window2d);\n\t\t\t\tcontext.injectMousePosition(coords.x, coords.y);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseButtonPressed:\n\t\t\tif (sf::Mouse::isButtonPressed(sf::Mouse::Left))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::LeftButton);\n\t\t\t}\n\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Middle))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::MiddleButton);\n\t\t\t}\n\t\t\telse if (sf::Mouse::isButtonPressed(sf::Mouse::Right))\n\t\t\t{\n\t\t\t\tcontext.injectMouseButtonDown(CEGUI::RightButton);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseButtonReleased:\n\t\t\tswitch (d2d->window->events[i].mouseButton.button)\n\t\t\t{\n\t\t\tcase sf::Mouse::Left:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::LeftButton);\n\t\t\t\tbreak;\n\t\t\tcase sf::Mouse::Middle:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::MiddleButton);\n\t\t\t\tbreak;\n\t\t\tcase sf::Mouse::Right:\n\t\t\t\tcontext.injectMouseButtonUp(CEGUI::RightButton);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase sf::Event::MouseWheelMoved:\n\t\t\tcontext.injectMouseWheelChange(d2d->window->events[i].mouseWheel.delta);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/onMouseButtonUp \/\/Use this to check if the frame window's button was pressed.\n\n\tCEGUI::System::getSingleton().renderAllGUIContexts(); \/\/Render all of CEGUI's stuffs. \/\/TODO: Make this work properly later.\n\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().draw();\n\t\/\/CEGUI::System::getSingleton().getDefaultGUIContext().getRenderTarget().draw();\n\tCEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().draw(); \/\/Force draw it because it doesn't seem to want to work otherwise.*\/\n}\n\nCEGUI::Window* Interface::getRootWindow(mgfx::d2d::D2D &d2d)\n{\n\t\/\/return cegui_root_window;\n\treturn d2d.getRootWindow();\n}\n\nvoid Interface::setRootWindow(CEGUI::Window *window, mgfx::d2d::D2D &d2d) \/\/Sets the root window.\n{\n\t\/*cegui_root_window = window;\n\tCEGUI::System::getSingleton().getDefaultGUIContext().setRootWindow(cegui_root_window);*\/\n\td2d.cegui_root_window = window;\n\td2d.cegui_gui_context->setRootWindow(d2d.cegui_root_window);\n}\n\nCEGUI::Window* Interface::createVirtualWindowFromLayout(std::string layout\/*, bool root*\/)\n{\n\tCEGUI::Window *window = CEGUI::WindowManager::getSingleton().loadLayoutFromFile(layout);\n\t\/*if (root) \/\/If it's supposed to be the root window...\n\t{\n\t\tsetRootWindow(window); \/\/Set it.\n\t}*\/\n\n\treturn window;\n}\n\nvoid Interface::addD2D(mgfx::d2d::D2D &d2d)\n{\n\tif (!d2d.cegui_renderer)\n\t{\n\t\t\/\/When creating a renderer, perhaps force SFML to set the viewport to the d2d's window?\n\t\td2d.cegui_renderer = &CEGUI::OpenGLRenderer::create();\n\t}\n\n\tif (!d2d.cegui_gui_context)\n\t{\n\t\td2d.cegui_gui_context = &CEGUI::System::getSingleton().createGUIContext(d2d.cegui_renderer->getDefaultRenderTarget());\n\t}\n\n\twindows.push_back(&d2d);\n}\n\n} \/\/namespace mui\n\n} \/\/namespace GEngine\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************************\n *\n * uEcho for C\n *\n * Copyright (C) Satoshi Konno 2015\n *\n * This is licensed under BSD-style license, see file COPYING.\n *\n ************************************************************\/\n\n#include \"TestDevice.h\"\n\n#undef UECHO_TEST_VERBOSE\n\nvoid uecho_test_printrequest(uEchoMessage* msg)\n{\n  uEchoProperty* prop;\n  size_t opc, n;\n\n  opc = uecho_message_getopc(msg);\n  printf(\"%s %2X %2X %04X %06X %06X %02X %ld \",\n      uecho_message_getsourceaddress(msg),\n      uecho_message_getehd1(msg),\n      uecho_message_getehd2(msg),\n      uecho_message_gettid(msg),\n      uecho_message_getsourceobjectcode(msg),\n      uecho_message_getdestinationobjectcode(msg),\n      uecho_message_getesv(msg),\n      opc);\n\n  for (n = 0; n < opc; n++) {\n    prop = uecho_message_getproperty(msg, n);\n    printf(\"%02X(%d)\", uecho_property_getcode(prop), uecho_property_getdatasize(prop));\n  }\n\n  printf(\"\\n\");\n}\n\nvoid uecho_test_object_messagelitener(uEchoObject* obj, uEchoMessage* msg)\n{\n#if defined(UECHO_TEST_VERBOSE)\n  uecho_test_printrequest(msg);\n#endif\n}\n\nbool uecho_test_property_requesthandler(uEchoObject* obj, uEchoProperty* prop, uEchoEsv esv, size_t pdc, byte* edt)\n{\n#if defined(UECHO_TEST_VERBOSE)\n  byte status;\n\n  printf(\"%02X %02X (%d)\\n\",\n      esv,\n      uecho_property_getcode(prop),\n      pdc);\n#endif\n\n  if (pdc != 1)\n    return false;\n\n#if defined(UECHO_TEST_VERBOSE)\n  status = edt[0];\n  switch (status) {\n  case UECHO_TEST_PROPERTY_SWITCH_ON:\n    printf(\"POWER = %02X\\n\", status);\n    break;\n  case UECHO_TEST_PROPERTY_SWITCH_OFF:\n    printf(\"POWER = %02X\\n\", status);\n    break;\n  }\n#endif\n\n  return true;\n}\n\nuEchoObject* uecho_test_createtestdevice()\n{\n  uEchoObject* obj = uecho_device_new();\n\n  uecho_object_setmanufacturercode(obj, UECHO_TEST_MANCODE);\n  uecho_object_setcode(obj, UECHO_TEST_OBJECTCODE);\n\n  byte prop[32];\n\n  \/\/ Operation status property\n  uecho_object_setproperty(obj, UECHO_TEST_PROPERTY_SWITCHCODE, uEchoPropertyAttrReadWrite);\n  prop[0] = UECHO_TEST_PROPERTY_SWITCH_ON;\n  uecho_object_setpropertydata(obj, UECHO_TEST_PROPERTY_SWITCHCODE, prop, 1);\n\n  \/\/ Set object listner\n\n  uecho_object_setmessagelistener(obj, uecho_test_object_messagelitener);\n\n  \/\/ Set property observer\n\n  uecho_object_setpropertywriterequesthandler(obj, UECHO_TEST_PROPERTY_SWITCHCODE, uecho_test_property_requesthandler);\n\n  return obj;\n}\n\nuEchoNode* uecho_test_createtestnode()\n{\n  uEchoNode* node = uecho_node_new();\n  uEchoObject* dev = uecho_test_createtestdevice();\n  uecho_node_addobject(node, dev);\n  return node;\n}\n<commit_msg>Update uecho_test_printrequest()<commit_after>\/************************************************************\n *\n * uEcho for C\n *\n * Copyright (C) Satoshi Konno 2015\n *\n * This is licensed under BSD-style license, see file COPYING.\n *\n ************************************************************\/\n\n#include \"TestDevice.h\"\n\n#undef UECHO_TEST_VERBOSE\n\nvoid uecho_test_printrequest(uEchoMessage* msg)\n{\n  uEchoProperty* prop;\n  size_t opc, n;\n\n  opc = uecho_message_getopc(msg);\n  printf(\"%s %2X %2X %04X %06X %06X %02X %ld \",\n      uecho_message_getsourceaddress(msg),\n      uecho_message_getehd1(msg),\n      uecho_message_getehd2(msg),\n      uecho_message_gettid(msg),\n      uecho_message_getsourceobjectcode(msg),\n      uecho_message_getdestinationobjectcode(msg),\n      uecho_message_getesv(msg),\n      opc);\n\n  for (n = 0; n < opc; n++) {\n    prop = uecho_message_getproperty(msg, n);\n    printf(\"%02X(%ld)\", uecho_property_getcode(prop), uecho_property_getdatasize(prop));\n  }\n\n  printf(\"\\n\");\n}\n\nvoid uecho_test_object_messagelitener(uEchoObject* obj, uEchoMessage* msg)\n{\n#if defined(UECHO_TEST_VERBOSE)\n  uecho_test_printrequest(msg);\n#endif\n}\n\nbool uecho_test_property_requesthandler(uEchoObject* obj, uEchoProperty* prop, uEchoEsv esv, size_t pdc, byte* edt)\n{\n#if defined(UECHO_TEST_VERBOSE)\n  byte status;\n\n  printf(\"%02X %02X (%d)\\n\",\n      esv,\n      uecho_property_getcode(prop),\n      pdc);\n#endif\n\n  if (pdc != 1)\n    return false;\n\n#if defined(UECHO_TEST_VERBOSE)\n  status = edt[0];\n  switch (status) {\n  case UECHO_TEST_PROPERTY_SWITCH_ON:\n    printf(\"POWER = %02X\\n\", status);\n    break;\n  case UECHO_TEST_PROPERTY_SWITCH_OFF:\n    printf(\"POWER = %02X\\n\", status);\n    break;\n  }\n#endif\n\n  return true;\n}\n\nuEchoObject* uecho_test_createtestdevice()\n{\n  uEchoObject* obj = uecho_device_new();\n\n  uecho_object_setmanufacturercode(obj, UECHO_TEST_MANCODE);\n  uecho_object_setcode(obj, UECHO_TEST_OBJECTCODE);\n\n  byte prop[32];\n\n  \/\/ Operation status property\n  uecho_object_setproperty(obj, UECHO_TEST_PROPERTY_SWITCHCODE, uEchoPropertyAttrReadWrite);\n  prop[0] = UECHO_TEST_PROPERTY_SWITCH_ON;\n  uecho_object_setpropertydata(obj, UECHO_TEST_PROPERTY_SWITCHCODE, prop, 1);\n\n  \/\/ Set object listner\n\n  uecho_object_setmessagelistener(obj, uecho_test_object_messagelitener);\n\n  \/\/ Set property observer\n\n  uecho_object_setpropertywriterequesthandler(obj, UECHO_TEST_PROPERTY_SWITCHCODE, uecho_test_property_requesthandler);\n\n  return obj;\n}\n\nuEchoNode* uecho_test_createtestnode()\n{\n  uEchoNode* node = uecho_node_new();\n  uEchoObject* dev = uecho_test_createtestdevice();\n  uecho_node_addobject(node, dev);\n  return node;\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 * SscReader.tcc\n *\n *  Created on: Nov 1, 2018\n *      Author: Jason Wang\n *\/\n\n#ifndef ADIOS2_ENGINE_SSCREADER_TCC_\n#define ADIOS2_ENGINE_SSCREADER_TCC_\n\n#include \"SscReader.h\"\n#include \"adios2\/helper\/adiosMemory.h\"\n#include <iostream>\n\nnamespace adios2\n{\nnamespace core\n{\nnamespace engine\n{\n\ntemplate <class T>\ninline void SscReader::GetSyncCommon(Variable<T> &variable, T *data)\n{\n    TAU_SCOPED_TIMER_FUNC();\n    GetDeferredCommon(variable, data);\n    PerformGets();\n}\n\ntemplate <class T>\nvoid SscReader::GetDeferredCommon(Variable<T> &variable, T *data)\n{\n    TAU_SCOPED_TIMER_FUNC();\n    if (m_CurrentStep == 0)\n    {\n        m_LocalReadPattern.emplace_back();\n        auto &b = m_LocalReadPattern.back();\n        b.name = variable.m_Name;\n        b.count = variable.m_Count;\n        b.start = variable.m_Start;\n        b.shape = variable.m_Shape;\n        b.type = helper::GetType<T>();\n\n        for (const auto &d : b.count)\n        {\n            if (d == 0)\n            {\n                throw(std::runtime_error(\n                    \"SetSelection count dimensions cannot be 0\"));\n            }\n        }\n\n        m_LocalReadPatternJson[\"Variables\"].emplace_back();\n        auto &jref = m_LocalReadPatternJson[\"Variables\"].back();\n        jref[\"Name\"] = variable.m_Name;\n        jref[\"Type\"] = helper::GetType<T>();\n        jref[\"Start\"] = variable.m_Start;\n        jref[\"Count\"] = variable.m_Count;\n        jref[\"Shape\"] = variable.m_Shape;\n        jref[\"BufferStart\"] = 0;\n        jref[\"BufferCount\"] = 0;\n\n        ssc::JsonToBlockVecVec(m_GlobalWritePatternJson, m_GlobalWritePattern);\n        ssc::CalculateOverlap(m_GlobalWritePattern, m_LocalReadPattern);\n        m_AllReceivingWriterRanks = ssc::AllOverlapRanks(m_GlobalWritePattern);\n        CalculatePosition(m_GlobalWritePattern, m_AllReceivingWriterRanks);\n        size_t totalDataSize = 0;\n        for (auto i : m_AllReceivingWriterRanks)\n        {\n            totalDataSize += i.second.second;\n        }\n        m_Buffer.resize(totalDataSize);\n        std::vector<MPI_Request> requests;\n        for (const auto &i : m_AllReceivingWriterRanks)\n        {\n            requests.emplace_back();\n            MPI_Rget(m_Buffer.data() + i.second.first, i.second.second,\n                     MPI_CHAR, i.first, 0, i.second.second, MPI_CHAR, m_MpiWin,\n                     &requests.back());\n        }\n        MPI_Status statuses[requests.size()];\n        MPI_Waitall(requests.size(), requests.data(), statuses);\n    }\n\n    for (const auto &i : m_AllReceivingWriterRanks)\n    {\n        const auto &v = m_GlobalWritePattern[i.first];\n        for (const auto &b : v)\n        {\n            if (b.name == variable.m_Name)\n            {\n                if (b.start.size() == 1 and b.count.size() == 1 and\n                    b.shape.size() == 1 and b.start[0] == 0 and\n                    b.count[0] == 1 and b.shape[0] == 1)\n                {\n                    std::memcpy(data, m_Buffer.data() + b.bufferStart,\n                                sizeof(T));\n                }\n                else\n                {\n                    helper::NdCopy<T>(\n                        m_Buffer.data() + b.bufferStart, b.start, b.count, true,\n                        true, reinterpret_cast<char *>(data), variable.m_Start,\n                        variable.m_Count, true, true);\n                }\n            }\n        }\n    }\n}\n\ntemplate <typename T>\nstd::map<size_t, std::vector<typename Variable<T>::Info>>\nSscReader::AllStepsBlocksInfoCommon(const Variable<T> &variable) const\n{\n    TAU_SCOPED_TIMER_FUNC();\n    std::map<size_t, std::vector<typename Variable<T>::Info>> m;\n    return m;\n}\n\ntemplate <typename T>\nstd::vector<typename Variable<T>::Info>\nSscReader::BlocksInfoCommon(const Variable<T> &variable,\n                            const size_t step) const\n{\n    TAU_SCOPED_TIMER_FUNC();\n    std::vector<typename Variable<T>::Info> ret;\n\n    for (const auto &r : m_GlobalWritePattern)\n    {\n        for (auto &v : r)\n        {\n            if (v.name != variable.m_Name)\n            {\n                continue;\n            }\n            typename Variable<T>::Info b;\n            b.Start = v.start;\n            b.Count = v.count;\n            b.Shape = v.shape;\n            b.IsValue = false;\n            if (v.shape.size() == 1)\n            {\n                if (v.shape[0] == 1)\n                {\n                    b.IsValue = true;\n                }\n            }\n            ret.push_back(b);\n        }\n    }\n    return ret;\n}\n\n} \/\/ end namespace engine\n} \/\/ end namespace core\n} \/\/ end namespace adios2\n\n#endif \/\/ ADIOS2_ENGINE_SSCREADER_TCC_\n<commit_msg>removed specific handling for single value<commit_after>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0.  See\n * accompanying file Copyright.txt for details.\n *\n * SscReader.tcc\n *\n *  Created on: Nov 1, 2018\n *      Author: Jason Wang\n *\/\n\n#ifndef ADIOS2_ENGINE_SSCREADER_TCC_\n#define ADIOS2_ENGINE_SSCREADER_TCC_\n\n#include \"SscReader.h\"\n#include \"adios2\/helper\/adiosMemory.h\"\n#include <iostream>\n\nnamespace adios2\n{\nnamespace core\n{\nnamespace engine\n{\n\ntemplate <class T>\ninline void SscReader::GetSyncCommon(Variable<T> &variable, T *data)\n{\n    TAU_SCOPED_TIMER_FUNC();\n    GetDeferredCommon(variable, data);\n    PerformGets();\n}\n\ntemplate <class T>\nvoid SscReader::GetDeferredCommon(Variable<T> &variable, T *data)\n{\n    TAU_SCOPED_TIMER_FUNC();\n    if (m_CurrentStep == 0)\n    {\n        m_LocalReadPattern.emplace_back();\n        auto &b = m_LocalReadPattern.back();\n        b.name = variable.m_Name;\n        b.count = variable.m_Count;\n        b.start = variable.m_Start;\n        b.shape = variable.m_Shape;\n        b.type = helper::GetType<T>();\n\n        for (const auto &d : b.count)\n        {\n            if (d == 0)\n            {\n                throw(std::runtime_error(\n                    \"SetSelection count dimensions cannot be 0\"));\n            }\n        }\n\n        m_LocalReadPatternJson[\"Variables\"].emplace_back();\n        auto &jref = m_LocalReadPatternJson[\"Variables\"].back();\n        jref[\"Name\"] = variable.m_Name;\n        jref[\"Type\"] = helper::GetType<T>();\n        jref[\"Start\"] = variable.m_Start;\n        jref[\"Count\"] = variable.m_Count;\n        jref[\"Shape\"] = variable.m_Shape;\n        jref[\"BufferStart\"] = 0;\n        jref[\"BufferCount\"] = 0;\n\n        ssc::JsonToBlockVecVec(m_GlobalWritePatternJson, m_GlobalWritePattern);\n        ssc::CalculateOverlap(m_GlobalWritePattern, m_LocalReadPattern);\n        m_AllReceivingWriterRanks = ssc::AllOverlapRanks(m_GlobalWritePattern);\n        CalculatePosition(m_GlobalWritePattern, m_AllReceivingWriterRanks);\n        size_t totalDataSize = 0;\n        for (auto i : m_AllReceivingWriterRanks)\n        {\n            totalDataSize += i.second.second;\n        }\n        m_Buffer.resize(totalDataSize);\n        std::vector<MPI_Request> requests;\n        for (const auto &i : m_AllReceivingWriterRanks)\n        {\n            requests.emplace_back();\n            MPI_Rget(m_Buffer.data() + i.second.first, i.second.second,\n                     MPI_CHAR, i.first, 0, i.second.second, MPI_CHAR, m_MpiWin,\n                     &requests.back());\n        }\n        MPI_Status statuses[requests.size()];\n        MPI_Waitall(requests.size(), requests.data(), statuses);\n    }\n\n    for (const auto &i : m_AllReceivingWriterRanks)\n    {\n        const auto &v = m_GlobalWritePattern[i.first];\n        for (const auto &b : v)\n        {\n            if (b.name == variable.m_Name)\n            {\n                helper::NdCopy<T>(\n                    m_Buffer.data() + b.bufferStart, b.start, b.count, true,\n                    true, reinterpret_cast<char *>(data), variable.m_Start,\n                    variable.m_Count, true, true);\n            }\n        }\n    }\n}\n\ntemplate <typename T>\nstd::map<size_t, std::vector<typename Variable<T>::Info>>\nSscReader::AllStepsBlocksInfoCommon(const Variable<T> &variable) const\n{\n    TAU_SCOPED_TIMER_FUNC();\n    std::map<size_t, std::vector<typename Variable<T>::Info>> m;\n    return m;\n}\n\ntemplate <typename T>\nstd::vector<typename Variable<T>::Info>\nSscReader::BlocksInfoCommon(const Variable<T> &variable,\n                            const size_t step) const\n{\n    TAU_SCOPED_TIMER_FUNC();\n    std::vector<typename Variable<T>::Info> ret;\n\n    for (const auto &r : m_GlobalWritePattern)\n    {\n        for (auto &v : r)\n        {\n            if (v.name != variable.m_Name)\n            {\n                continue;\n            }\n            typename Variable<T>::Info b;\n            b.Start = v.start;\n            b.Count = v.count;\n            b.Shape = v.shape;\n            b.IsValue = false;\n            if (v.shape.size() == 1)\n            {\n                if (v.shape[0] == 1)\n                {\n                    b.IsValue = true;\n                }\n            }\n            ret.push_back(b);\n        }\n    }\n    return ret;\n}\n\n} \/\/ end namespace engine\n} \/\/ end namespace core\n} \/\/ end namespace adios2\n\n#endif \/\/ ADIOS2_ENGINE_SSCREADER_TCC_\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 * SscWriter.cpp\n *\n *  Created on: Nov 1, 2018\n *      Author: Jason Wang\n *\/\n\n#include \"SscWriter.tcc\"\n#include \"adios2\/helper\/adiosComm.h\"\n#include \"adios2\/helper\/adiosCommMPI.h\"\n#include \"adios2\/helper\/adiosString.h\"\n\nnamespace adios2\n{\nnamespace core\n{\nnamespace engine\n{\n\nSscWriter::SscWriter(IO &io, const std::string &name, const Mode mode,\n                     helper::Comm comm)\n: Engine(\"SscWriter\", io, name, mode, std::move(comm))\n{\n    TAU_SCOPED_TIMER_FUNC();\n\n    helper::GetParameter(m_IO.m_Parameters, \"MpiMode\", m_MpiMode);\n    helper::GetParameter(m_IO.m_Parameters, \"Verbose\", m_Verbosity);\n    helper::GetParameter(m_IO.m_Parameters, \"MaxFilenameLength\",\n                         m_MaxFilenameLength);\n    helper::GetParameter(m_IO.m_Parameters, \"RendezvousAppCount\",\n                         m_RendezvousAppCount);\n    helper::GetParameter(m_IO.m_Parameters, \"MaxStreamsPerApp\",\n                         m_MaxStreamsPerApp);\n    helper::GetParameter(m_IO.m_Parameters, \"OpenTimeoutSecs\",\n                         m_OpenTimeoutSecs);\n\n    m_Buffer.resize(1);\n\n    SyncMpiPattern();\n    m_WriterRank = m_Comm.Rank();\n    m_WriterSize = m_Comm.Size();\n    MPI_Comm_rank(m_StreamComm, &m_StreamRank);\n    MPI_Comm_size(m_StreamComm, &m_StreamSize);\n\n    m_GlobalWritePattern.resize(m_StreamSize);\n    m_GlobalReadPattern.resize(m_StreamSize);\n}\n\nStepStatus SscWriter::BeginStep(StepMode mode, const float timeoutSeconds)\n{\n    TAU_SCOPED_TIMER_FUNC();\n\n    MpiWait();\n\n    if (m_InitialStep)\n    {\n        m_InitialStep = false;\n    }\n    else\n    {\n        ++m_CurrentStep;\n    }\n\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::BeginStep, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << \", Step \"\n                  << m_CurrentStep << std::endl;\n    }\n\n    return StepStatus::OK;\n}\n\nsize_t SscWriter::CurrentStep() const\n{\n    TAU_SCOPED_TIMER_FUNC();\n    return m_CurrentStep;\n}\n\nvoid SscWriter::PerformPuts() { TAU_SCOPED_TIMER_FUNC(); }\n\nvoid SscWriter::PutOneSidedPostPush()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    MPI_Win_start(m_MpiAllReadersGroup, 0, m_MpiWin);\n    for (const auto &i : m_AllSendingReaderRanks)\n    {\n        MPI_Put(m_Buffer.data(), m_Buffer.size(), MPI_CHAR, i.first,\n                i.second.first, m_Buffer.size(), MPI_CHAR, m_MpiWin);\n    }\n    MPI_Win_complete(m_MpiWin);\n}\n\nvoid SscWriter::PutOneSidedFencePush()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    MPI_Win_fence(0, m_MpiWin);\n    for (const auto &i : m_AllSendingReaderRanks)\n    {\n        MPI_Put(m_Buffer.data(), m_Buffer.size(), MPI_CHAR, i.first,\n                i.second.first, m_Buffer.size(), MPI_CHAR, m_MpiWin);\n    }\n    MPI_Win_fence(0, m_MpiWin);\n}\n\nvoid SscWriter::PutOneSidedPostPull()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    MPI_Win_post(m_MpiAllReadersGroup, 0, m_MpiWin);\n    MPI_Win_wait(m_MpiWin);\n}\n\nvoid SscWriter::PutOneSidedFencePull()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    MPI_Win_fence(0, m_MpiWin);\n    MPI_Win_fence(0, m_MpiWin);\n}\n\nvoid SscWriter::PutTwoSided()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    for (const auto &i : m_AllSendingReaderRanks)\n    {\n        m_MpiRequests.emplace_back();\n        MPI_Isend(m_Buffer.data(), m_Buffer.size(), MPI_CHAR, i.first, 0,\n                  m_StreamComm, &m_MpiRequests.back());\n    }\n    m_NeedWait = true;\n}\n\nvoid SscWriter::EndStep()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::EndStep, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << \", Step \"\n                  << m_CurrentStep << std::endl;\n    }\n\n    if (m_CurrentStep == 0)\n    {\n        SyncWritePattern();\n        MPI_Win_create(m_Buffer.data(), m_Buffer.size(), 1, MPI_INFO_NULL,\n                       m_StreamComm, &m_MpiWin);\n        PutOneSidedPostPull();\n        MPI_Win_free(&m_MpiWin);\n        SyncReadPattern();\n        MPI_Win_create(m_Buffer.data(), m_Buffer.size(), 1, MPI_INFO_NULL,\n                       m_StreamComm, &m_MpiWin);\n    }\n    else\n    {\n        if (m_MpiMode == \"twosided\")\n        {\n            PutTwoSided();\n        }\n        else if (m_MpiMode == \"onesidedfencepush\")\n        {\n            PutOneSidedFencePush();\n        }\n        else if (m_MpiMode == \"onesidedpostpush\")\n        {\n            PutOneSidedPostPush();\n        }\n        else if (m_MpiMode == \"onesidedfencepull\")\n        {\n            PutOneSidedFencePull();\n        }\n        else if (m_MpiMode == \"onesidedpostpull\")\n        {\n            PutOneSidedPostPull();\n        }\n    }\n}\n\nvoid SscWriter::Flush(const int transportIndex) { TAU_SCOPED_TIMER_FUNC(); }\n\n\/\/ PRIVATE\n\nvoid SscWriter::MpiWait()\n{\n    if (m_NeedWait)\n    {\n        if (m_MpiMode == \"twosided\")\n        {\n            MPI_Status statuses[m_MpiRequests.size()];\n            MPI_Waitall(m_MpiRequests.size(), m_MpiRequests.data(), statuses);\n            m_MpiRequests.clear();\n        }\n        else if (m_MpiMode == \"onesidedfencepush\")\n        {\n        }\n        else if (m_MpiMode == \"onesidedpostpush\")\n        {\n        }\n        else if (m_MpiMode == \"onesidedfencepull\")\n        {\n        }\n        else if (m_MpiMode == \"onesidedpostpull\")\n        {\n        }\n        m_NeedWait = false;\n    }\n}\n\nvoid SscWriter::SyncMpiPattern()\n{\n    TAU_SCOPED_TIMER_FUNC();\n\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::SyncMpiPattern, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << std::endl;\n    }\n\n    m_MpiHandshake.Handshake(m_Name, 'w', m_OpenTimeoutSecs, m_MaxStreamsPerApp,\n                             m_MaxFilenameLength, m_RendezvousAppCount,\n                             CommAsMPI(m_Comm));\n\n    std::vector<int> allStreamRanks;\n    std::vector<int> allReaderRanks;\n\n    for (const auto &app : m_MpiHandshake.GetWriterMap(m_Name))\n    {\n        for (int rank : app.second)\n        {\n            allStreamRanks.push_back(rank);\n        }\n    }\n\n    for (const auto &app : m_MpiHandshake.GetReaderMap(m_Name))\n    {\n        for (int rank : app.second)\n        {\n            allStreamRanks.push_back(rank);\n            allReaderRanks.push_back(rank);\n        }\n    }\n    MPI_Group worldGroup;\n    MPI_Group allReadersGroup;\n    MPI_Comm_group(MPI_COMM_WORLD, &worldGroup);\n    MPI_Group_incl(worldGroup, allReaderRanks.size(), allReaderRanks.data(),\n                   &m_MpiAllReadersGroup);\n\n    MPI_Comm_group(MPI_COMM_WORLD, &worldGroup);\n    std::sort(allStreamRanks.begin(), allStreamRanks.end());\n    MPI_Group allWorkersGroup;\n    MPI_Group_incl(worldGroup, allStreamRanks.size(), allStreamRanks.data(),\n                   &allWorkersGroup);\n    MPI_Comm_create_group(MPI_COMM_WORLD, allWorkersGroup, 0, &m_StreamComm);\n}\n\nvoid SscWriter::SyncWritePattern()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::SyncWritePattern, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << std::endl;\n    }\n\n    nlohmann::json localRankMetaJ;\n\n    ssc::BlockVecToJson(m_GlobalWritePattern[m_StreamRank], localRankMetaJ);\n\n    if (m_WriterRank == 0)\n    {\n        ssc::AttributeMapToJson(m_IO, localRankMetaJ);\n    }\n\n    std::string localStr = localRankMetaJ.dump();\n\n    \/\/ aggregate global write pattern\n    size_t localSize = localStr.size();\n    size_t maxLocalSize;\n    MPI_Allreduce(&localSize, &maxLocalSize, 1, MPI_UNSIGNED_LONG_LONG, MPI_MAX,\n                  m_StreamComm);\n    std::vector<char> localVec(maxLocalSize, '\\0');\n    std::memcpy(localVec.data(), localStr.data(), localStr.size());\n    std::vector<char> globalVec(maxLocalSize * m_StreamSize, '\\0');\n    MPI_Allgather(localVec.data(), maxLocalSize, MPI_CHAR, globalVec.data(),\n                  maxLocalSize, MPI_CHAR, m_StreamComm);\n\n    \/\/ deserialize global metadata Json\n    nlohmann::json globalJson;\n    ssc::LocalJsonToGlobalJson(globalVec, maxLocalSize, m_StreamSize,\n                               globalJson);\n\n    \/\/ deserialize variables metadata\n    ssc::JsonToBlockVecVec(globalJson, m_GlobalWritePattern);\n}\n\nvoid SscWriter::SyncReadPattern()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::SyncReadPattern, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << std::endl;\n    }\n\n    size_t localSize = 0;\n    size_t maxLocalSize;\n    MPI_Allreduce(&localSize, &maxLocalSize, 1, MPI_UNSIGNED_LONG_LONG, MPI_MAX,\n                  m_StreamComm);\n    std::vector<char> localVec(maxLocalSize, '\\0');\n    std::vector<char> globalVec(maxLocalSize * m_StreamSize);\n    MPI_Allgather(localVec.data(), maxLocalSize, MPI_CHAR, globalVec.data(),\n                  maxLocalSize, MPI_CHAR, m_StreamComm);\n\n    \/\/ deserialize global metadata Json\n    nlohmann::json globalJson;\n    try\n    {\n        for (size_t i = 0; i < m_StreamSize; ++i)\n        {\n            if (globalVec[i * maxLocalSize] == '\\0')\n            {\n                globalJson[i] = nullptr;\n            }\n            else\n            {\n                globalJson[i] = nlohmann::json::parse(\n                    globalVec.begin() + i * maxLocalSize,\n                    globalVec.begin() + (i + 1) * maxLocalSize);\n            }\n        }\n    }\n    catch (std::exception &e)\n    {\n        throw(std::runtime_error(\n            std::string(\"corrupted global read pattern metadata, \") +\n            std::string(e.what())));\n    }\n\n    ssc::JsonToBlockVecVec(globalJson, m_GlobalReadPattern);\n    m_AllSendingReaderRanks = ssc::CalculateOverlap(\n        m_GlobalReadPattern, m_GlobalWritePattern[m_StreamRank]);\n    CalculatePosition(m_GlobalWritePattern, m_GlobalReadPattern, m_WriterRank,\n                      m_AllSendingReaderRanks);\n\n    if (m_Verbosity >= 10)\n    {\n        ssc::PrintBlockVecVec(m_GlobalWritePattern, \"Global Write Pattern\");\n        ssc::PrintBlockVec(m_GlobalWritePattern[m_WriterRank],\n                           \"Local Write Pattern\");\n    }\n}\n\nvoid SscWriter::CalculatePosition(ssc::BlockVecVec &writerVecVec,\n                                  ssc::BlockVecVec &readerVecVec,\n                                  const int writerRank,\n                                  ssc::RankPosMap &allOverlapRanks)\n{\n    TAU_SCOPED_TIMER_FUNC();\n    for (auto &overlapRank : allOverlapRanks)\n    {\n        auto &readerRankMap = readerVecVec[overlapRank.first];\n        auto currentReaderOverlapWriterRanks =\n            CalculateOverlap(writerVecVec, readerRankMap);\n        size_t bufferPosition = 0;\n        for (size_t rank = 0; rank < writerVecVec.size(); ++rank)\n        {\n            bool hasOverlap = false;\n            for (const auto r : currentReaderOverlapWriterRanks)\n            {\n                if (r.first == rank)\n                {\n                    hasOverlap = true;\n                    break;\n                }\n            }\n            if (hasOverlap)\n            {\n                currentReaderOverlapWriterRanks[rank].first = bufferPosition;\n                auto &bv = writerVecVec[rank];\n                size_t currentRankTotalSize = TotalDataSize(bv) + 1;\n                currentReaderOverlapWriterRanks[rank].second =\n                    currentRankTotalSize;\n                bufferPosition += currentRankTotalSize;\n            }\n        }\n        allOverlapRanks[overlapRank.first] =\n            currentReaderOverlapWriterRanks[writerRank];\n    }\n}\n\n#define declare_type(T)                                                        \\\n    void SscWriter::DoPutSync(Variable<T> &variable, const T *data)            \\\n    {                                                                          \\\n        PutDeferredCommon(variable, data);                                     \\\n        PerformPuts();                                                         \\\n    }                                                                          \\\n    void SscWriter::DoPutDeferred(Variable<T> &variable, const T *data)        \\\n    {                                                                          \\\n        PutDeferredCommon(variable, data);                                     \\\n    }\nADIOS2_FOREACH_STDTYPE_1ARG(declare_type)\n#undef declare_type\n\nvoid SscWriter::DoClose(const int transportIndex)\n{\n    TAU_SCOPED_TIMER_FUNC();\n\n    MpiWait();\n\n    m_Buffer[0] = 1;\n\n    if (m_MpiMode == \"twosided\")\n    {\n        std::vector<MPI_Request> requests;\n        for (const auto &i : m_AllSendingReaderRanks)\n        {\n            requests.emplace_back();\n            MPI_Isend(m_Buffer.data(), 1, MPI_CHAR, i.first, 0, m_StreamComm,\n                      &requests.back());\n        }\n        MPI_Status statuses[requests.size()];\n        MPI_Waitall(requests.size(), requests.data(), statuses);\n    }\n    else if (m_MpiMode == \"onesidedfencepush\")\n    {\n        MPI_Win_fence(0, m_MpiWin);\n        for (const auto &i : m_AllSendingReaderRanks)\n        {\n            MPI_Put(m_Buffer.data(), 1, MPI_CHAR, i.first, 0, 1, MPI_CHAR,\n                    m_MpiWin);\n        }\n        MPI_Win_fence(0, m_MpiWin);\n    }\n    else if (m_MpiMode == \"onesidedpostpush\")\n    {\n        MPI_Win_start(m_MpiAllReadersGroup, 0, m_MpiWin);\n        for (const auto &i : m_AllSendingReaderRanks)\n        {\n            MPI_Put(m_Buffer.data(), 1, MPI_CHAR, i.first, 0, 1, MPI_CHAR,\n                    m_MpiWin);\n        }\n        MPI_Win_complete(m_MpiWin);\n    }\n    else if (m_MpiMode == \"onesidedfencepull\")\n    {\n        MPI_Win_fence(0, m_MpiWin);\n        MPI_Win_fence(0, m_MpiWin);\n    }\n    else if (m_MpiMode == \"onesidedpostpull\")\n    {\n        MPI_Win_post(m_MpiAllReadersGroup, 0, m_MpiWin);\n        MPI_Win_wait(m_MpiWin);\n    }\n\n    MPI_Win_free(&m_MpiWin);\n}\n\n} \/\/ end namespace engine\n} \/\/ end namespace core\n} \/\/ end namespace adios2\n<commit_msg>moved MPI_Win_fence from EndStep to BeginStep<commit_after>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0.  See\n * accompanying file Copyright.txt for details.\n *\n * SscWriter.cpp\n *\n *  Created on: Nov 1, 2018\n *      Author: Jason Wang\n *\/\n\n#include \"SscWriter.tcc\"\n#include \"adios2\/helper\/adiosComm.h\"\n#include \"adios2\/helper\/adiosCommMPI.h\"\n#include \"adios2\/helper\/adiosString.h\"\n\nnamespace adios2\n{\nnamespace core\n{\nnamespace engine\n{\n\nSscWriter::SscWriter(IO &io, const std::string &name, const Mode mode,\n                     helper::Comm comm)\n: Engine(\"SscWriter\", io, name, mode, std::move(comm))\n{\n    TAU_SCOPED_TIMER_FUNC();\n\n    helper::GetParameter(m_IO.m_Parameters, \"MpiMode\", m_MpiMode);\n    helper::GetParameter(m_IO.m_Parameters, \"Verbose\", m_Verbosity);\n    helper::GetParameter(m_IO.m_Parameters, \"MaxFilenameLength\",\n                         m_MaxFilenameLength);\n    helper::GetParameter(m_IO.m_Parameters, \"RendezvousAppCount\",\n                         m_RendezvousAppCount);\n    helper::GetParameter(m_IO.m_Parameters, \"MaxStreamsPerApp\",\n                         m_MaxStreamsPerApp);\n    helper::GetParameter(m_IO.m_Parameters, \"OpenTimeoutSecs\",\n                         m_OpenTimeoutSecs);\n\n    m_Buffer.resize(1);\n\n    SyncMpiPattern();\n    m_WriterRank = m_Comm.Rank();\n    m_WriterSize = m_Comm.Size();\n    MPI_Comm_rank(m_StreamComm, &m_StreamRank);\n    MPI_Comm_size(m_StreamComm, &m_StreamSize);\n\n    m_GlobalWritePattern.resize(m_StreamSize);\n    m_GlobalReadPattern.resize(m_StreamSize);\n}\n\nStepStatus SscWriter::BeginStep(StepMode mode, const float timeoutSeconds)\n{\n    TAU_SCOPED_TIMER_FUNC();\n\n    MpiWait();\n\n    if (m_InitialStep)\n    {\n        m_InitialStep = false;\n    }\n    else\n    {\n        ++m_CurrentStep;\n    }\n\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::BeginStep, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << \", Step \"\n                  << m_CurrentStep << std::endl;\n    }\n\n    return StepStatus::OK;\n}\n\nsize_t SscWriter::CurrentStep() const\n{\n    TAU_SCOPED_TIMER_FUNC();\n    return m_CurrentStep;\n}\n\nvoid SscWriter::PerformPuts() { TAU_SCOPED_TIMER_FUNC(); }\n\nvoid SscWriter::PutOneSidedPostPush()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    MPI_Win_start(m_MpiAllReadersGroup, 0, m_MpiWin);\n    for (const auto &i : m_AllSendingReaderRanks)\n    {\n        MPI_Put(m_Buffer.data(), m_Buffer.size(), MPI_CHAR, i.first,\n                i.second.first, m_Buffer.size(), MPI_CHAR, m_MpiWin);\n    }\n    MPI_Win_complete(m_MpiWin);\n}\n\nvoid SscWriter::PutOneSidedFencePush()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    MPI_Win_fence(0, m_MpiWin);\n    for (const auto &i : m_AllSendingReaderRanks)\n    {\n        MPI_Put(m_Buffer.data(), m_Buffer.size(), MPI_CHAR, i.first,\n                i.second.first, m_Buffer.size(), MPI_CHAR, m_MpiWin);\n    }\n    m_NeedWait = true;\n}\n\nvoid SscWriter::PutOneSidedPostPull()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    MPI_Win_post(m_MpiAllReadersGroup, 0, m_MpiWin);\n    MPI_Win_wait(m_MpiWin);\n}\n\nvoid SscWriter::PutOneSidedFencePull()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    MPI_Win_fence(0, m_MpiWin);\n    m_NeedWait = true;\n}\n\nvoid SscWriter::PutTwoSided()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    for (const auto &i : m_AllSendingReaderRanks)\n    {\n        m_MpiRequests.emplace_back();\n        MPI_Isend(m_Buffer.data(), m_Buffer.size(), MPI_CHAR, i.first, 0,\n                  m_StreamComm, &m_MpiRequests.back());\n    }\n    m_NeedWait = true;\n}\n\nvoid SscWriter::EndStep()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::EndStep, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << \", Step \"\n                  << m_CurrentStep << std::endl;\n    }\n\n    if (m_CurrentStep == 0)\n    {\n        SyncWritePattern();\n        MPI_Win_create(m_Buffer.data(), m_Buffer.size(), 1, MPI_INFO_NULL,\n                       m_StreamComm, &m_MpiWin);\n        PutOneSidedPostPull();\n        MPI_Win_free(&m_MpiWin);\n        SyncReadPattern();\n        MPI_Win_create(m_Buffer.data(), m_Buffer.size(), 1, MPI_INFO_NULL,\n                       m_StreamComm, &m_MpiWin);\n    }\n    else\n    {\n        if (m_MpiMode == \"twosided\")\n        {\n            PutTwoSided();\n        }\n        else if (m_MpiMode == \"onesidedfencepush\")\n        {\n            PutOneSidedFencePush();\n        }\n        else if (m_MpiMode == \"onesidedpostpush\")\n        {\n            PutOneSidedPostPush();\n        }\n        else if (m_MpiMode == \"onesidedfencepull\")\n        {\n            PutOneSidedFencePull();\n        }\n        else if (m_MpiMode == \"onesidedpostpull\")\n        {\n            PutOneSidedPostPull();\n        }\n    }\n}\n\nvoid SscWriter::Flush(const int transportIndex) { TAU_SCOPED_TIMER_FUNC(); }\n\n\/\/ PRIVATE\n\nvoid SscWriter::MpiWait()\n{\n    if (m_NeedWait)\n    {\n        if (m_MpiMode == \"twosided\")\n        {\n            MPI_Status statuses[m_MpiRequests.size()];\n            MPI_Waitall(m_MpiRequests.size(), m_MpiRequests.data(), statuses);\n            m_MpiRequests.clear();\n        }\n        else if (m_MpiMode == \"onesidedfencepush\")\n        {\n            MPI_Win_fence(0, m_MpiWin);\n        }\n        else if (m_MpiMode == \"onesidedpostpush\")\n        {\n        }\n        else if (m_MpiMode == \"onesidedfencepull\")\n        {\n            MPI_Win_fence(0, m_MpiWin);\n        }\n        else if (m_MpiMode == \"onesidedpostpull\")\n        {\n        }\n        m_NeedWait = false;\n    }\n}\n\nvoid SscWriter::SyncMpiPattern()\n{\n    TAU_SCOPED_TIMER_FUNC();\n\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::SyncMpiPattern, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << std::endl;\n    }\n\n    m_MpiHandshake.Handshake(m_Name, 'w', m_OpenTimeoutSecs, m_MaxStreamsPerApp,\n                             m_MaxFilenameLength, m_RendezvousAppCount,\n                             CommAsMPI(m_Comm));\n\n    std::vector<int> allStreamRanks;\n    std::vector<int> allReaderRanks;\n\n    for (const auto &app : m_MpiHandshake.GetWriterMap(m_Name))\n    {\n        for (int rank : app.second)\n        {\n            allStreamRanks.push_back(rank);\n        }\n    }\n\n    for (const auto &app : m_MpiHandshake.GetReaderMap(m_Name))\n    {\n        for (int rank : app.second)\n        {\n            allStreamRanks.push_back(rank);\n            allReaderRanks.push_back(rank);\n        }\n    }\n    MPI_Group worldGroup;\n    MPI_Group allReadersGroup;\n    MPI_Comm_group(MPI_COMM_WORLD, &worldGroup);\n    MPI_Group_incl(worldGroup, allReaderRanks.size(), allReaderRanks.data(),\n                   &m_MpiAllReadersGroup);\n\n    MPI_Comm_group(MPI_COMM_WORLD, &worldGroup);\n    std::sort(allStreamRanks.begin(), allStreamRanks.end());\n    MPI_Group allWorkersGroup;\n    MPI_Group_incl(worldGroup, allStreamRanks.size(), allStreamRanks.data(),\n                   &allWorkersGroup);\n    MPI_Comm_create_group(MPI_COMM_WORLD, allWorkersGroup, 0, &m_StreamComm);\n}\n\nvoid SscWriter::SyncWritePattern()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::SyncWritePattern, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << std::endl;\n    }\n\n    nlohmann::json localRankMetaJ;\n\n    ssc::BlockVecToJson(m_GlobalWritePattern[m_StreamRank], localRankMetaJ);\n\n    if (m_WriterRank == 0)\n    {\n        ssc::AttributeMapToJson(m_IO, localRankMetaJ);\n    }\n\n    std::string localStr = localRankMetaJ.dump();\n\n    \/\/ aggregate global write pattern\n    size_t localSize = localStr.size();\n    size_t maxLocalSize;\n    MPI_Allreduce(&localSize, &maxLocalSize, 1, MPI_UNSIGNED_LONG_LONG, MPI_MAX,\n                  m_StreamComm);\n    std::vector<char> localVec(maxLocalSize, '\\0');\n    std::memcpy(localVec.data(), localStr.data(), localStr.size());\n    std::vector<char> globalVec(maxLocalSize * m_StreamSize, '\\0');\n    MPI_Allgather(localVec.data(), maxLocalSize, MPI_CHAR, globalVec.data(),\n                  maxLocalSize, MPI_CHAR, m_StreamComm);\n\n    \/\/ deserialize global metadata Json\n    nlohmann::json globalJson;\n    ssc::LocalJsonToGlobalJson(globalVec, maxLocalSize, m_StreamSize,\n                               globalJson);\n\n    \/\/ deserialize variables metadata\n    ssc::JsonToBlockVecVec(globalJson, m_GlobalWritePattern);\n}\n\nvoid SscWriter::SyncReadPattern()\n{\n    TAU_SCOPED_TIMER_FUNC();\n    if (m_Verbosity >= 5)\n    {\n        std::cout << \"SscWriter::SyncReadPattern, World Rank \" << m_StreamRank\n                  << \", Writer Rank \" << m_WriterRank << std::endl;\n    }\n\n    size_t localSize = 0;\n    size_t maxLocalSize;\n    MPI_Allreduce(&localSize, &maxLocalSize, 1, MPI_UNSIGNED_LONG_LONG, MPI_MAX,\n                  m_StreamComm);\n    std::vector<char> localVec(maxLocalSize, '\\0');\n    std::vector<char> globalVec(maxLocalSize * m_StreamSize);\n    MPI_Allgather(localVec.data(), maxLocalSize, MPI_CHAR, globalVec.data(),\n                  maxLocalSize, MPI_CHAR, m_StreamComm);\n\n    \/\/ deserialize global metadata Json\n    nlohmann::json globalJson;\n    try\n    {\n        for (size_t i = 0; i < m_StreamSize; ++i)\n        {\n            if (globalVec[i * maxLocalSize] == '\\0')\n            {\n                globalJson[i] = nullptr;\n            }\n            else\n            {\n                globalJson[i] = nlohmann::json::parse(\n                    globalVec.begin() + i * maxLocalSize,\n                    globalVec.begin() + (i + 1) * maxLocalSize);\n            }\n        }\n    }\n    catch (std::exception &e)\n    {\n        throw(std::runtime_error(\n            std::string(\"corrupted global read pattern metadata, \") +\n            std::string(e.what())));\n    }\n\n    ssc::JsonToBlockVecVec(globalJson, m_GlobalReadPattern);\n    m_AllSendingReaderRanks = ssc::CalculateOverlap(\n        m_GlobalReadPattern, m_GlobalWritePattern[m_StreamRank]);\n    CalculatePosition(m_GlobalWritePattern, m_GlobalReadPattern, m_WriterRank,\n                      m_AllSendingReaderRanks);\n\n    if (m_Verbosity >= 10)\n    {\n        ssc::PrintBlockVecVec(m_GlobalWritePattern, \"Global Write Pattern\");\n        ssc::PrintBlockVec(m_GlobalWritePattern[m_WriterRank],\n                           \"Local Write Pattern\");\n    }\n}\n\nvoid SscWriter::CalculatePosition(ssc::BlockVecVec &writerVecVec,\n                                  ssc::BlockVecVec &readerVecVec,\n                                  const int writerRank,\n                                  ssc::RankPosMap &allOverlapRanks)\n{\n    TAU_SCOPED_TIMER_FUNC();\n    for (auto &overlapRank : allOverlapRanks)\n    {\n        auto &readerRankMap = readerVecVec[overlapRank.first];\n        auto currentReaderOverlapWriterRanks =\n            CalculateOverlap(writerVecVec, readerRankMap);\n        size_t bufferPosition = 0;\n        for (size_t rank = 0; rank < writerVecVec.size(); ++rank)\n        {\n            bool hasOverlap = false;\n            for (const auto r : currentReaderOverlapWriterRanks)\n            {\n                if (r.first == rank)\n                {\n                    hasOverlap = true;\n                    break;\n                }\n            }\n            if (hasOverlap)\n            {\n                currentReaderOverlapWriterRanks[rank].first = bufferPosition;\n                auto &bv = writerVecVec[rank];\n                size_t currentRankTotalSize = TotalDataSize(bv) + 1;\n                currentReaderOverlapWriterRanks[rank].second =\n                    currentRankTotalSize;\n                bufferPosition += currentRankTotalSize;\n            }\n        }\n        allOverlapRanks[overlapRank.first] =\n            currentReaderOverlapWriterRanks[writerRank];\n    }\n}\n\n#define declare_type(T)                                                        \\\n    void SscWriter::DoPutSync(Variable<T> &variable, const T *data)            \\\n    {                                                                          \\\n        PutDeferredCommon(variable, data);                                     \\\n        PerformPuts();                                                         \\\n    }                                                                          \\\n    void SscWriter::DoPutDeferred(Variable<T> &variable, const T *data)        \\\n    {                                                                          \\\n        PutDeferredCommon(variable, data);                                     \\\n    }\nADIOS2_FOREACH_STDTYPE_1ARG(declare_type)\n#undef declare_type\n\nvoid SscWriter::DoClose(const int transportIndex)\n{\n    TAU_SCOPED_TIMER_FUNC();\n\n    MpiWait();\n\n    m_Buffer[0] = 1;\n\n    if (m_MpiMode == \"twosided\")\n    {\n        std::vector<MPI_Request> requests;\n        for (const auto &i : m_AllSendingReaderRanks)\n        {\n            requests.emplace_back();\n            MPI_Isend(m_Buffer.data(), 1, MPI_CHAR, i.first, 0, m_StreamComm,\n                      &requests.back());\n        }\n        MPI_Status statuses[requests.size()];\n        MPI_Waitall(requests.size(), requests.data(), statuses);\n    }\n    else if (m_MpiMode == \"onesidedfencepush\")\n    {\n        MPI_Win_fence(0, m_MpiWin);\n        for (const auto &i : m_AllSendingReaderRanks)\n        {\n            MPI_Put(m_Buffer.data(), 1, MPI_CHAR, i.first, 0, 1, MPI_CHAR,\n                    m_MpiWin);\n        }\n        MPI_Win_fence(0, m_MpiWin);\n    }\n    else if (m_MpiMode == \"onesidedpostpush\")\n    {\n        MPI_Win_start(m_MpiAllReadersGroup, 0, m_MpiWin);\n        for (const auto &i : m_AllSendingReaderRanks)\n        {\n            MPI_Put(m_Buffer.data(), 1, MPI_CHAR, i.first, 0, 1, MPI_CHAR,\n                    m_MpiWin);\n        }\n        MPI_Win_complete(m_MpiWin);\n    }\n    else if (m_MpiMode == \"onesidedfencepull\")\n    {\n        MPI_Win_fence(0, m_MpiWin);\n        MPI_Win_fence(0, m_MpiWin);\n    }\n    else if (m_MpiMode == \"onesidedpostpull\")\n    {\n        MPI_Win_post(m_MpiAllReadersGroup, 0, m_MpiWin);\n        MPI_Win_wait(m_MpiWin);\n    }\n\n    MPI_Win_free(&m_MpiWin);\n}\n\n} \/\/ end namespace engine\n} \/\/ end namespace core\n} \/\/ end namespace adios2\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n#include \"consoleui.h\"\n#include \"scientist.h\"\n\nusing namespace std;\n\nConsoleUI::ConsoleUI()\n{\n\n}\n\n\/\/ Should not contain logic for individual commands, that should be in separate functions!\nvoid ConsoleUI::run()\n{\n    string command;\n    do\n    {\n        cout << \"Select one of the following options: \" << endl;\n        cout << \"Add - add a programmer\/computer scientist\" << endl;\n        cout << \"List - show a list of all programmer's\/computer scientist's\" << endl;\n        cout << \"Search - search the list of programmer's\/computer scientist's\" << endl;\n        cout << \"Quit - end program\" << endl;\n\n\n        cin >> command;\n        for(unsigned int i = 0; i < command.length(); i++) \/\/ to make all lowercase, taken from c++ site\n        {\n            command[i] = tolower(command[i]);\n        }\n\n        cout << endl;\n\n        if(command == \"add\") \/\/ Could possibly be improved upon\n        {\n           userMenuAdd();\n        }\n        else if(command == \"list\") \/\/ Could possibly be improved upon\n        {\n           userMenuList();\n        }\n        else if(command == \"search\") \/\/ Could possibly be improved upon\n        {\n           userMenuSearch();\n        }\n        else\n        {\n            cout << \"Invalid input\" << endl;\n        }\n    }while(command != \"quit\");\n\n\n\n}\nvoid ConsoleUI::userMenuAdd()\n{\n    string name;\n    char gender;\n    int birthYear;\n    int deathYear = 0;\n\n\n    cout << \"Enter the programmer's\/computer scientist's name: \";\n    cin.ignore();\n    getline(cin, name);\n\n    bool check = true;\n    do\n    {\n        cout << \"Enter the programmer's\/computer scientist's gender (m\/f): \";\n        cin >> gender;\n\n        if((gender != 'm') && (gender != 'f'))\n        {\n            cout << \"Invalid input\" << endl;\n        }\n        else\n        {\n            check = false;\n        }\n    }while(check == true);\n\n    bool check2 = true;\n    do\n    {\n        cout << \"Enter the programmer's\/computer scientist's year of birth: \";\n        cin >> birthYear;\n        if(birthYear < 2016) \/\/ Just in case we find a programmer of the univers\n        {\n            check2 = false;\n        }\n        else\n        {\n            cout << \"Invalid input\" << endl;\n        }\n    }while(check2 == true);\n\n    bool check3 = true;\n    do\n    {\n        cout << \"Enter the programmer's\/computer scientist's year of death (type 0 if not applicable): \";\n        cin >> deathYear;\n        if (deathYear == 0)\n        {\n            check3 = false;\n        }\n        else if(deathYear >= birthYear)\n        {\n            check3 = false;\n        }\n        else\n        {\n            cout << \"Invalid input\" << endl;\n        }\n    }while(check3 == true);\n\n    _service.addScientist(name, gender, birthYear, deathYear);\n}\nvoid ConsoleUI::userMenuList()\n{\n    vector<Scientist> scientist = _service.getScientists();\n\n    cout << \"Scientist name:\" << endl;\n    cout << \"===============\" << endl;\n    for (size_t i = 0; i< scientist.size(); ++i)\n    {\n        cout << scientist[i].getName() << \"\\t\"\n             << scientist[i].getGender() << \"\\t\"\n             << scientist[i].getAge() << \"\\t\"\n             << scientist[i].getDeath() << endl;\n    }\n    cout << endl;\n}\nvoid ConsoleUI::userMenuSearch()\n{\n    string command;\n    cout << \"Select a search option: \" << endl;\n    cout << \"Name - Search by name\" << endl;\n    cout << \"Birth - Search by year of birth\" << endl;\n    cout << \"Death - search by year of death\" << endl;\n    cin >> command;\n\n    if(command == \"name\" || command == \"Name\" || command == \"NAME\")\n    {\n        vector<Scientist> scientist = _service.getScientists();\n        string nameInputSearch;\n        cout << \"Enter a name to search: \";\n        cin >> nameInputSearch;\n\n        for(unsigned int i = 0; i < scientist.size(); ++i)\n        {\n            if(scientist[i].getName() == nameInputSearch)\n            {\n                cout << scientist[i].getName() << endl;\n            }\n        }\n    }\n    else if(command == \"birth\" || command == \"Birth\" || command == \"BIRTH\")\n    {\n\n    }\n    else if(command == \"death\" || command == \"Death\" || command == \"DEATH\")\n    {\n\n    }\n\n\n}\n<commit_msg>console printout update<commit_after>#include <iostream>\n#include <string>\n#include \"consoleui.h\"\n#include \"scientist.h\"\n\nusing namespace std;\n\nConsoleUI::ConsoleUI()\n{\n\n}\n\n\/\/ Should not contain logic for individual commands, that should be in separate functions!\nvoid ConsoleUI::run()\n{\n    string command;\n    do\n    {\n        cout << \"Select one of the following options: \" << endl;\n        cout << \"Add - add a programmer\/computer scientist\" << endl;\n        cout << \"List - show a list of all programmer's\/computer scientist's\" << endl;\n        cout << \"Search - search the list of programmer's\/computer scientist's\" << endl;\n        cout << \"Quit - end program\" << endl;\n\n\n        cin >> command;\n        for(unsigned int i = 0; i < command.length(); i++) \/\/ to make all lowercase, taken from c++ site\n        {\n            command[i] = tolower(command[i]);\n        }\n\n        cout << endl;\n\n        if(command == \"add\") \/\/ Could possibly be improved upon\n        {\n           userMenuAdd();\n        }\n        else if(command == \"list\") \/\/ Could possibly be improved upon\n        {\n           userMenuList();\n        }\n        else if(command == \"search\") \/\/ Could possibly be improved upon\n        {\n           userMenuSearch();\n        }\n        else\n        {\n            cout << \"Invalid input\" << endl;\n        }\n    }while(command != \"quit\");\n\n\n\n}\nvoid ConsoleUI::userMenuAdd()\n{\n    string name;\n    char gender;\n    int birthYear;\n    int deathYear = 0;\n\n\n    cout << \"Enter the programmer's\/computer scientist's name: \";\n    cin.ignore();\n    getline(cin, name);\n\n    bool check = true;\n    do\n    {\n        cout << \"Enter the programmer's\/computer scientist's gender (m\/f): \";\n        cin >> gender;\n\n        if((gender != 'm') && (gender != 'f'))\n        {\n            cout << \"Invalid input\" << endl;\n        }\n        else\n        {\n            check = false;\n        }\n    }while(check == true);\n\n    bool check2 = true;\n    do\n    {\n        cout << \"Enter the programmer's\/computer scientist's year of birth: \";\n        cin >> birthYear;\n        if(birthYear < 2016) \/\/ Just in case we find a programmer of the univers\n        {\n            check2 = false;\n        }\n        else\n        {\n            cout << \"Invalid input\" << endl;\n        }\n    }while(check2 == true);\n\n    bool check3 = true;\n    do\n    {\n        cout << \"Enter the programmer's\/computer scientist's year of death (type 0 if not applicable): \";\n        cin >> deathYear;\n        if (deathYear == 0)\n        {\n            check3 = false;\n        }\n        else if(deathYear >= birthYear)\n        {\n            check3 = false;\n        }\n        else\n        {\n            cout << \"Invalid input\" << endl;\n        }\n    }while(check3 == true);\n    cout << endl;\n\n    _service.addScientist(name, gender, birthYear, deathYear);\n}\nvoid ConsoleUI::userMenuList()\n{\n    vector<Scientist> scientist = _service.getScientists();\n\n    cout << \"Scientist name: \\t\" << \"gender: \\t\" << \"age: \\t\" << \"died:\" << endl;\n    cout << \"================================================================\" << endl;\n    for (size_t i = 0; i< scientist.size(); ++i)\n    {\n        cout << scientist[i].getName() << \"\\t\"\n             << scientist[i].getGender() << \"\\t\\t\"\n             << scientist[i].getAge() << \"\\t\"\n             << scientist[i].getDeath() << endl;\n    }\n    cout << endl;\n}\nvoid ConsoleUI::userMenuSearch()\n{\n    string command;\n    cout << \"Select a search option: \" << endl;\n    cout << \"Name - Search by name\" << endl;\n    cout << \"Birth - Search by year of birth\" << endl;\n    cout << \"Death - search by year of death\" << endl;\n    cin >> command;\n\n    if(command == \"name\" || command == \"Name\" || command == \"NAME\")\n    {\n        vector<Scientist> scientist = _service.getScientists();\n        string nameInputSearch;\n        cout << \"Enter a name to search: \";\n        cin >> nameInputSearch;\n\n        for(unsigned int i = 0; i < scientist.size(); ++i)\n        {\n            if(scientist[i].getName() == nameInputSearch)\n            {\n                cout << scientist[i].getName() << endl;\n            }\n        }\n    }\n    else if(command == \"birth\" || command == \"Birth\" || command == \"BIRTH\")\n    {\n\n    }\n    else if(command == \"death\" || command == \"Death\" || command == \"DEATH\")\n    {\n\n    }\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _SOSPD_HPP_\n#define _SOSPD_HPP_\n\n\/** \\file sospd.hpp\n * Sum-of-submodular Primal Dual algorithm for multilabel problems\n *\/\n\n\/\/#define PROGRESS_DISPLAY\n\/\/#define CHECK_INVARIANTS\n\n#include \"energy-common.hpp\"\n#include <vector>\n#include <functional>\n\n#include \"clique.hpp\"\n#include \"submodular-ibfs.hpp\"\n#include \"submodular-functions.hpp\"\n\n\n\/** Optimizer using Sum-of-submodular Primal Dual algorithm. \n *\n * Implements SoSPD algorithm from Fix, Wang, Zabih in CVPR 14.\n *\/\nclass SoSPD {\n    public:\n        typedef MultilabelEnergy::NodeId NodeId;\n        typedef MultilabelEnergy::Label Label;\n\n        \/** Proposal callbacks take as input the iteration number and current\n         * labeling (as a vector of labels) and write the next proposal to the\n         * final parameter.\n         *\/\n        typedef std::function<\n              void(int niter,\n                   const std::vector<Label>& current,\n                   std::vector<Label>& proposed)\n            > ProposalCallback;\n\n        \/** Set up SoSPD to optimize a particular energy function\n         *\n         * \\param energy Energy function to optimize.\n         *\/\n        explicit SoSPD(const MultilabelEnergy* energy);\n\n        \/** Run SoSPD algorithm either to completion, or for a number of steps.\n         *\n         * Each iteration has a single proposal (determined by \n         * SetProposalCallback), and solves a corresponding Sum-of-Submodular\n         * flow problem. \n         *\n         * Resulting labeling can be queried from GetLabel.\n         *\n         * \\param niters Number of iterations\n         *\/\n        void Solve(int niters = std::numeric_limits<int>::max());\n\n        \/** Return label of a node i, returns -1 if Solve has not been called.*\/\n        int GetLabel(NodeId i) const;\n\n        \/** Give hint that energy is expansion submodular. Enables optimizations\n         * because we don't need to find submodular upper\/lower bounds for the\n         * function.\n         *\/\n        void SetExpansionSubmodular(bool b) { m_expansion_submodular = b; }\n\n        \/** Choose whether to use lower\/upper bound in approximating function.\n         *\/\n        void SetLowerBound(bool b) { m_lower_bound = b; }\n\n        \/** Specify method for choosing proposals. *\/\n        void SetProposalCallback(const ProposalCallback& pc) { m_pc = pc; }\n\n        \/** Set the proposal method to alpha-expansion \n         *\n         * Alpha-expansion proposals simply cycle through the labels, proposing\n         * a constant labeling (i.e., all \"alpha\") at each iteration.\n         *\/\n        void SetAlphaExpansion() { \n            m_pc = [&](int, const std::vector<Label>&, std::vector<Label>&) {\n                AlphaProposal();\n            };\n        }\n\n        \/** Set the proposal method to best-height alpha-expansion\n         *\n         * Best-height alpha-expansion, instead of cycling through labels, \n         * chooses the single alpha with the biggest sum of differences in \n         * heights.\n         *\/\n        void SetHeightAlphaExpansion() { \n            m_pc = [&](int, const std::vector<Label>&, std::vector<Label>&) {\n                HeightAlphaProposal();\n            };\n        }\n\n        \/** Return lower bound on optimum, determined by current dual *\/\n        double LowerBound();\n\n    private:\n        typedef MultilabelEnergy::CliquePtr CliquePtr;\n        typedef std::vector<std::vector<REAL> > Dual;\n        typedef std::vector<std::pair<size_t, size_t>> NodeNeighborList;\n        typedef std::vector<NodeNeighborList> NodeCliqueList;\n\n        REAL ComputeHeight(NodeId, Label);\n        REAL ComputeHeightDiff(NodeId i, Label l1, Label l2) const;\n        void SetupGraph(SubmodularIBFS& crf);\n        void SetupAlphaEnergy(SubmodularIBFS& crf);\n        void InitialLabeling();\n        void InitialDual();\n        void InitialNodeCliqueList();\n        bool InitialFusionLabeling();\n        void PreEditDual(SubmodularIBFS& crf);\n        bool UpdatePrimalDual(SubmodularIBFS& crf);\n        void PostEditDual();\n        void DualFit();\n        bool CheckHeightInvariant();\n        bool CheckLabelInvariant();\n        bool CheckDualBoundInvariant();\n        bool CheckActiveInvariant();\n        REAL& Height(NodeId i, Label l) { return m_heights[i*m_num_labels+l]; }\n\n        \/\/ Move Proposals\n        void HeightAlphaProposal();\n        void AlphaProposal();\n\n        const MultilabelEnergy* m_energy;\n        SubmodularIBFS m_ibfs;\n        const size_t m_num_labels;\n        std::vector<Label> m_labels;\n        std::vector<Label> m_fusion_labels;\n        NodeCliqueList m_node_clique_list;\n        std::vector<Dual> m_dual;\n        std::vector<REAL> m_heights;\n        bool m_expansion_submodular;\n        bool m_lower_bound;\n        int m_iter;\n        ProposalCallback m_pc;\n};\n\n#endif\n<commit_msg>Fixmes in sospd<commit_after>#ifndef _SOSPD_HPP_\n#define _SOSPD_HPP_\n\n\/** \\file sospd.hpp\n * Sum-of-submodular Primal Dual algorithm for multilabel problems\n *\/\n\n\/\/#define PROGRESS_DISPLAY\n\/\/#define CHECK_INVARIANTS\n\n#include \"energy-common.hpp\"\n#include <vector>\n#include <functional>\n\n#include \"clique.hpp\"\n#include \"submodular-ibfs.hpp\"\n#include \"submodular-functions.hpp\"\n\n\n\/** Optimizer using Sum-of-submodular Primal Dual algorithm. \n *\n * Implements SoSPD algorithm from Fix, Wang, Zabih in CVPR 14.\n *\/\nclass SoSPD {\n    public:\n        typedef MultilabelEnergy::NodeId NodeId;\n        typedef MultilabelEnergy::Label Label;\n\n        \/** Proposal callbacks take as input the iteration number and current\n         * labeling (as a vector of labels) and write the next proposal to the\n         * final parameter.\n         *\/\n        typedef std::function<\n              void(int niter,\n                   const std::vector<Label>& current,\n                   std::vector<Label>& proposed)\n            > ProposalCallback;\n\n        \/** Set up SoSPD to optimize a particular energy function\n         *\n         * \\param energy Energy function to optimize.\n         *\/\n        explicit SoSPD(const MultilabelEnergy* energy);\n\n        \/** Run SoSPD algorithm either to completion, or for a number of steps.\n         *\n         * Each iteration has a single proposal (determined by \n         * SetProposalCallback), and solves a corresponding Sum-of-Submodular\n         * flow problem. \n         *\n         * Resulting labeling can be queried from GetLabel.\n         *\n         * \\param niters Number of iterations\n         *\/\n        void Solve(int niters = std::numeric_limits<int>::max());\n\n        \/** Return label of a node i, returns -1 if Solve has not been called.*\/\n        int GetLabel(NodeId i) const;\n\n        \/** Give hint that energy is expansion submodular. Enables optimizations\n         * because we don't need to find submodular upper\/lower bounds for the\n         * function.\n         *\/\n        void SetExpansionSubmodular(bool b) { m_expansion_submodular = b; }\n\n        \/** Choose whether to use lower\/upper bound in approximating function.\n         *\/\n        void SetLowerBound(bool b) { m_lower_bound = b; }\n\n        \/** Specify method for choosing proposals. *\/\n        void SetProposalCallback(const ProposalCallback& pc) { m_pc = pc; }\n\n        \/** Set the proposal method to alpha-expansion \n         *\n         * Alpha-expansion proposals simply cycle through the labels, proposing\n         * a constant labeling (i.e., all \"alpha\") at each iteration.\n         *\/\n        void SetAlphaExpansion() { \n            m_pc = [&](int, const std::vector<Label>&, std::vector<Label>&) {\n                AlphaProposal();\n            };\n        }\n\n        \/** Set the proposal method to best-height alpha-expansion\n         *\n         * Best-height alpha-expansion, instead of cycling through labels, \n         * chooses the single alpha with the biggest sum of differences in \n         * heights.\n         *\/\n        void SetHeightAlphaExpansion() { \n            m_pc = [&](int, const std::vector<Label>&, std::vector<Label>&) {\n                HeightAlphaProposal();\n            };\n        }\n\n        \/** Return lower bound on optimum, determined by current dual *\/\n        double LowerBound();\n\n    private:\n        typedef MultilabelEnergy::CliquePtr CliquePtr;\n        typedef std::vector<std::vector<REAL> > Dual;\n        typedef std::vector<std::pair<size_t, size_t>> NodeNeighborList;\n        typedef std::vector<NodeNeighborList> NodeCliqueList;\n\n        REAL ComputeHeight(NodeId, Label);\n        REAL ComputeHeightDiff(NodeId i, Label l1, Label l2) const;\n        void SetupGraph(SubmodularIBFS& crf);\n        \/\/ TODO(afix): redo this\n        void SetupAlphaEnergy(SubmodularIBFS& crf);\n        void InitialLabeling();\n        void InitialDual();\n        void InitialNodeCliqueList();\n        bool InitialFusionLabeling();\n        void PreEditDual(SubmodularIBFS& crf);\n        bool UpdatePrimalDual(SubmodularIBFS& crf);\n        void PostEditDual();\n        void DualFit();\n        bool CheckHeightInvariant();\n        bool CheckLabelInvariant();\n        bool CheckDualBoundInvariant();\n        bool CheckActiveInvariant();\n        REAL& Height(NodeId i, Label l) { return m_heights[i*m_num_labels+l]; }\n\n        \/\/ Move Proposals\n        void HeightAlphaProposal();\n        void AlphaProposal();\n\n        const MultilabelEnergy* m_energy;\n        \/\/ Unique ptr so we can forward declare?\n        SubmodularIBFS m_ibfs;\n        const size_t m_num_labels;\n        std::vector<Label> m_labels;\n        \/\/\/ The proposed labeling in a given iteration\n        std::vector<Label> m_fusion_labels;\n        \/\/ Factor this list back into a node list?\n        NodeCliqueList m_node_clique_list;\n        \/\/ FIXME(afix) change way m_dual is stored. Put lambda_alpha as separate\n        \/\/ double* for each clique, indexed by i, l. \n        std::vector<Dual> m_dual;\n        std::vector<REAL> m_heights;\n        bool m_expansion_submodular;\n        bool m_lower_bound;\n        int m_iter;\n        ProposalCallback m_pc;\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"stack.hpp\"\n#include <stdexcept>\n#ifndef STACK_CPP\n#define STACK_CPP\n\n\nbitset::bitset(size_t size) : ptr_(std::make_unique<bool[]>(size)),size_(size),counter_(0) \n{}\n\nauto bitset::set(size_t index)->void \/\/инициализация всех битов единицами или изменение значения тдельного бита\n{ \n\tif (index >= 0 && index < size_) \n\t{ \n\t\tptr_[index] = true; ++counter_; \n\t}\n\telse throw(\"problem with index\");\n}\n\nauto bitset::reset(size_t index) throw(std::out_of_range) -> void \/\/обнуление указанных битов\n{\n\tif (index >= size_)\n\t{\n\t\tthrow (std::out_of_range(\"problem with index\"));\n\t}\n\tptr_[index] = false;\n\t--counter_;\n}\n\nauto bitset::test(size_t index) const throw(std::out_of_range) -> bool \/\/возвращает значение указанного бита\n{\n\tif (index >= size_) \n\t{\n\t\tthrow (std::out_of_range(\"problem with index\"));\n\t}\n\treturn ptr_[index];\n}\n\nauto bitset::size() const -> size_t \n{\n\treturn size_;\n}\nauto bitset::counter() const -> size_t \n{\n\treturn counter_;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename T>\nallocator<T>::allocator(size_t size) : ptr_((T*)operator new(size*sizeof(T))), size_(size), map_(std::make_unique<bitset>(size))\/\/конструктор с параметром\n{}\n\ntemplate<typename T>\nallocator<T>::allocator(allocator const& other) : allocator<T>(other.size_) \/\/конструктор копирования\n{\n\tfor (size_t i=0; i < size_; i++) \n\t{ \n\t\tif (map_->test(i)) \n\t\t{ \n\t\t\tdestroy(ptr_, ptr_ +i); \n\t\t}\n\tconstruct(ptr_ + i, other.ptr_[i]); \n}\n\ntemplate<typename T>\nallocator<T>::~allocator()\n{\n\tif (this->count() > 0) \n\t{\n\t\tdestroy(ptr_, ptr_ + size_());\n\t}\n\toperator delete(ptr_);\n}\n\ntemplate<typename T> \/\/увеличение памяти\nauto allocator<T>::resize()->void\n{\n\tallocator<T> alloc(size_ * 2 + (size_ == 0));\n\tfor (size_t i = 0; i < size_; ++i) if(map_->test(i)) alloc.construct(alloc.get() + i, ptr_[i]);\n\tthis->swap(alloc);\n}\n\ntemplate<typename T>\nauto allocator<T>::construct(T * ptr, T const & value)->void\n{\n\tif (ptr >= ptr_&&ptr < ptr_ + size_)\n\t{\n\t\tnew(ptr)T(value);\n\t\tmap_->set(ptr - ptr_);\n\t}\n\telse { throw(\"error\"); }\n}\ntemplate <typename T>\nauto allocator<T>::destroy(T * ptr)->void\n{ \nif (ptr < ptr_ || ptr >= ptr_ + size_ || map_->test(ptr-ptr_) == false)\n{\n\t\tthrow std::out_of_range(\"Error\");\n}\n\tptr->~T();\n\tmap_->reset(ptr - ptr_);\n\n}\n\ntemplate<typename T> \/\/получаем ptr_\nauto allocator<T>::get()-> T* { return ptr_; }\n\ntemplate<typename T>\nauto allocator<T>::get() const -> T const * { return ptr_; }\n\ntemplate<typename T>\nauto allocator<T>::count() const -> size_t{ return map_->counter(); }\n\ntemplate<typename T> \/\/заполненность \nauto allocator<T>::full() const -> bool { return (map_->counter() == size_); }\n\ntemplate<typename T>\nauto allocator<T>::empty() const -> bool { return (map_->counter() == 0); }\n\ntemplate<typename T>\nauto allocator<T>::destroy(T * first, T * last)->void\n{\n\tif(first>=ptr_&&last<=ptr_+this->count())\n\t\tfor (; first != last; ++first) \n\t\t{\n\t\t\tdestroy(&*first);\n\t\t}\n}\n\ntemplate<typename T>\nauto allocator<T>::swap(allocator & other)->void{\n\tstd::swap(ptr_, other.ptr_);\n\tstd::swap(size_, other.size_);\n\tstd::swap(map_, other.map_);\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<typename T>\nstack<T>::stack(size_t size) : allocator_(size)\n{}\n\ntemplate<typename T>\nauto stack<T>::operator =(stack const & other)-> stack &\n{ \n\tif (this != &other) \n\t{\n\t\t(allocator<T>(other.allocator_)).swap(allocator_);\n\t}\n\treturn *this;\n}\n\ntemplate<typename T>\nauto stack<T>::empty() const ->bool\n{ \nreturn allocator_.empty(); \n}\n\ntemplate<typename T>\nauto stack<T>::count()const->size_t\n{\nreturn allocator_.count(); \n}\n\ntemplate<typename T>\nauto stack<T>::push(T const & value)->void\n{\n\tif (allocator_.full()) allocator_.resize(); \n\tallocator_.construct(allocator_.get() + this->count(), value);\n}\n\ntemplate<typename T>\nauto stack<T>::pop()->void \n{\n\tif (allocator_.count() == 0) throw std::logic_error(\"Empty\");\n\tallocator_.destroy(allocator_.get() + (this->count() - 1));\n}\n\ntemplate<typename T>\nauto stack<T>::top()->T& \n{\n\tif (this->count() > 0) return(*(allocator_.get() + this->count() - 1));\n\telse this->throw_is_empty();\n}\n\ntemplate<typename T>\nauto stack<T>::top()const->T const & \n{\n\tif (this->count() > 0) return(*(allocator_.get() + this->count() - 1));\n\telse this->throw_is_empty();\n}\n\ntemplate<typename T>\nauto stack<T>::throw_is_empty()const->void\n{\nthrow(\"Stack is empty\");\n}\n\n\n\n\n#endif\n<commit_msg>Update stack.cpp<commit_after>#include \"stack.hpp\"\n#include <stdexcept>\n#ifndef STACK_CPP\n#define STACK_CPP\n\n\nbitset::bitset(size_t size) : ptr_(std::make_unique<bool[]>(size)),size_(size),counter_(0) \n{}\n\nauto bitset::set(size_t index)->void \/\/инициализация всех битов единицами или изменение значения тдельного бита\n{ \n\tif (index >= 0 && index < size_) \n\t{ \n\t\tptr_[index] = true; ++counter_; \n\t}\n\telse throw(\"problem with index\");\n}\n\nauto bitset::reset(size_t index) throw(std::out_of_range) -> void \/\/обнуление указанных битов\n{\n\tif (index >= size_)\n\t{\n\t\tthrow (std::out_of_range(\"problem with index\"));\n\t}\n\tptr_[index] = false;\n\t--counter_;\n}\n\nauto bitset::test(size_t index) const throw(std::out_of_range) -> bool \/\/возвращает значение указанного бита\n{\n\tif (index >= size_) \n\t{\n\t\tthrow (std::out_of_range(\"problem with index\"));\n\t}\n\treturn ptr_[index];\n}\n\nauto bitset::size() const -> size_t \n{\n\treturn size_;\n}\nauto bitset::counter() const -> size_t \n{\n\treturn counter_;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename T>\nallocator<T>::allocator(size_t size) : ptr_((T*)operator new(size*sizeof(T))), size_(size), map_(std::make_unique<bitset>(size))\/\/конструктор с параметром\n{}\n\ntemplate<typename T>\nallocator<T>::allocator(allocator const& other) : allocator<T>(other.size_) \/\/конструктор копирования\n{\n\tfor (size_t i=0; i < size_; i++) \n\t{ \n\t\tif (map_->test(i)) \n\t\t{ \n\t\t\tdestroy(ptr_, ptr_ +i); \n\t\t}\n\tconstruct(ptr_ + i, other.ptr_[i]); \n}}\n\ntemplate<typename T>\nallocator<T>::~allocator()\n{\n\tif (this->count() > 0) \n\t{\n\t\tdestroy(ptr_, ptr_ + size_());\n\t}\n\toperator delete(ptr_);\n}\n\ntemplate<typename T> \/\/увеличение памяти\nauto allocator<T>::resize()->void\n{\n\tallocator<T> alloc(size_ * 2 + (size_ == 0));\n\tfor (size_t i = 0; i < size_; ++i) if(map_->test(i)) alloc.construct(alloc.get() + i, ptr_[i]);\n\tthis->swap(alloc);\n}\n\ntemplate<typename T>\nauto allocator<T>::construct(T * ptr, T const & value)->void\n{\n\tif (ptr >= ptr_&&ptr < ptr_ + size_)\n\t{\n\t\tnew(ptr)T(value);\n\t\tmap_->set(ptr - ptr_);\n\t}\n\telse { throw(\"error\"); }\n}\ntemplate <typename T>\nauto allocator<T>::destroy(T * ptr)->void\n{ \nif (ptr < ptr_ || ptr >= ptr_ + size_ || map_->test(ptr-ptr_) == false)\n{\n\t\tthrow std::out_of_range(\"Error\");\n}\n\tptr->~T();\n\tmap_->reset(ptr - ptr_);\n\n}\n\ntemplate<typename T> \/\/получаем ptr_\nauto allocator<T>::get()-> T* { return ptr_; }\n\ntemplate<typename T>\nauto allocator<T>::get() const -> T const * { return ptr_; }\n\ntemplate<typename T>\nauto allocator<T>::count() const -> size_t{ return map_->counter(); }\n\ntemplate<typename T> \/\/заполненность \nauto allocator<T>::full() const -> bool { return (map_->counter() == size_); }\n\ntemplate<typename T>\nauto allocator<T>::empty() const -> bool { return (map_->counter() == 0); }\n\ntemplate<typename T>\nauto allocator<T>::destroy(T * first, T * last)->void\n{\n\tif(first>=ptr_&&last<=ptr_+this->count())\n\t\tfor (; first != last; ++first) \n\t\t{\n\t\t\tdestroy(&*first);\n\t\t}\n}\n\ntemplate<typename T>\nauto allocator<T>::swap(allocator & other)->void{\n\tstd::swap(ptr_, other.ptr_);\n\tstd::swap(size_, other.size_);\n\tstd::swap(map_, other.map_);\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<typename T>\nstack<T>::stack(size_t size) : allocator_(size)\n{}\n\ntemplate<typename T>\nauto stack<T>::operator =(stack const & other)-> stack &\n{ \n\tif (this != &other) \n\t{\n\t\t(allocator<T>(other.allocator_)).swap(allocator_);\n\t}\n\treturn *this;\n}\n\ntemplate<typename T>\nauto stack<T>::empty() const ->bool\n{ \nreturn allocator_.empty(); \n}\n\ntemplate<typename T>\nauto stack<T>::count()const->size_t\n{\nreturn allocator_.count(); \n}\n\ntemplate<typename T>\nauto stack<T>::push(T const & value)->void\n{\n\tif (allocator_.full()) allocator_.resize(); \n\tallocator_.construct(allocator_.get() + this->count(), value);\n}\n\ntemplate<typename T>\nauto stack<T>::pop()->void \n{\n\tif (allocator_.count() == 0) throw std::logic_error(\"Empty\");\n\tallocator_.destroy(allocator_.get() + (this->count() - 1));\n}\n\ntemplate<typename T>\nauto stack<T>::top()->T& \n{\n\tif (this->count() > 0) return(*(allocator_.get() + this->count() - 1));\n\telse this->throw_is_empty();\n}\n\ntemplate<typename T>\nauto stack<T>::top()const->T const & \n{\n\tif (this->count() > 0) return(*(allocator_.get() + this->count() - 1));\n\telse this->throw_is_empty();\n}\n\ntemplate<typename T>\nauto stack<T>::throw_is_empty()const->void\n{\nthrow(\"Stack is empty\");\n}\n\n\n\n\n#endif\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 __itkRawImageIO_hxx\n#define __itkRawImageIO_hxx\n#include \"itkRawImageIO.h\"\n\nnamespace itk\n{\ntemplate< class TPixel, unsigned int VImageDimension >\nRawImageIO< TPixel, VImageDimension >::RawImageIO():\n  ImageIOBase()\n{\n  this->SetNumberOfComponents(1);\n  this->SetPixelTypeInfo( static_cast<const PixelType *>(0) );\n  this->SetNumberOfDimensions(VImageDimension);\n\n  for ( unsigned int idx = 0; idx < VImageDimension; ++idx )\n    {\n    m_Spacing.insert(m_Spacing.begin() + idx, 1.0);\n    m_Origin.insert(m_Origin.begin() + idx, 0.0);\n    }\n\n  m_HeaderSize = 0;\n  m_ManualHeaderSize = false;\n\n  \/\/ Left over from short reader\n  m_ImageMask = 0xffff;\n  m_ByteOrder = ImageIOBase::BigEndian;\n  m_FileDimensionality = 2;\n  m_FileType = Binary;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nRawImageIO< TPixel, VImageDimension >::~RawImageIO()\n{}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >::PrintSelf(std::ostream & os, Indent indent) const\n{\n  Superclass::PrintSelf(os, indent);\n\n  os << indent << \"ImageMask: \" << m_ImageMask << std::endl;\n  os << indent << \"FileDimensionality: \" << m_FileDimensionality << std::endl;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nSizeValueType RawImageIO< TPixel, VImageDimension >::GetHeaderSize()\n{\n  std::ifstream file;\n\n  if ( m_FileName == \"\" )\n    {\n    itkExceptionMacro(<< \"A FileName must be specified.\");\n    }\n\n  if ( !m_ManualHeaderSize )\n    {\n    if ( m_FileType == ASCII )\n      {\n      return 0;                          \/\/cannot determine it\n      }\n    this->ComputeStrides();\n\n    \/\/ make sure we figure out a filename to open\n    this->OpenFileForReading(file);\n\n    \/\/ Get the size of the header from the size of the image\n    file.seekg(0, std::ios::end);\n\n    m_HeaderSize = static_cast<SizeValueType>(\n      static_cast<typename ::itk::intmax_t>( file.tellg() )\n      - static_cast<typename ::itk::intmax_t>( this->m_Strides[m_FileDimensionality + 1] )\n    );\n    }\n\n  return m_HeaderSize;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >::OpenFileForReading(std::ifstream & is)\n{\n  if ( m_FileName == \"\" )\n    {\n    itkExceptionMacro(<< \"A FileName must be specified.\");\n    }\n\n  \/\/ Close file from any previous image\n  if ( is.is_open() )\n    {\n    is.close();\n    }\n\n  \/\/ Open the new file\n  itkDebugMacro(<< \"Initialize: opening file \" << m_FileName);\n#ifdef _WIN32\n  is.open(m_FileName.c_str(), std::ios::in | std::ios::binary);\n#else\n  is.open(m_FileName.c_str(), std::ios::in);\n#endif\n  if ( is.fail() )\n    {\n    itkExceptionMacro(<< \"Could not open file: \" << m_FileName);\n    }\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >::OpenFileForWriting(std::ofstream & os)\n{\n  if ( m_FileName == \"\" )\n    {\n    itkExceptionMacro(<< \"A FileName must be specified.\");\n    }\n\n  std::ofstream tFile(m_FileName.c_str(), std::ios::out);\n  tFile.close();\n\n  \/\/ Close file from any previous image\n  if ( os.is_open() )\n    {\n    os.close();\n    }\n\n  \/\/ Open the new file\n  itkDebugMacro(<< \"Initialize: opening file \" << m_FileName);\n#ifdef _WIN32\n  os.open(m_FileName.c_str(), std::ios::out | std::ios::binary);\n#else\n  os.open(m_FileName.c_str(), std::ios::out);\n#endif\n  if ( os.fail() )\n    {\n    itkExceptionMacro(<< \"Could not open file: \" << m_FileName);\n    }\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >\n::SetHeaderSize(SizeValueType size)\n{\n  if ( size != m_HeaderSize )\n    {\n    m_HeaderSize = size;\n    this->Modified();\n    }\n  m_ManualHeaderSize = true;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >\n::Read(void *buffer)\n{\n  std::ifstream file;\n\n  \/\/ Open the file\n  this->OpenFileForReading(file);\n  this->ComputeStrides();\n\n  \/\/ Offset into file\n  SizeValueType streamStart = this->GetHeaderSize();\n  file.seekg( (OffsetValueType)streamStart, std::ios::beg );\n  if ( file.fail() )\n    {\n    itkExceptionMacro(<< \"File seek failed\");\n    }\n\n  const SizeValueType numberOfBytesToBeRead =\n    static_cast< SizeValueType >( this->GetImageSizeInBytes() );\n\n  itkDebugMacro(<< \"Reading \" << numberOfBytesToBeRead << \" bytes\");\n\n  if ( m_FileType == Binary )\n    {\n    if ( !this->ReadBufferAsBinary(file, buffer, numberOfBytesToBeRead) )\n      {\n      itkExceptionMacro(<< \"Read failed: Wanted \"\n                        << numberOfBytesToBeRead\n                        << \" bytes, but read \"\n                        << file.gcount() << \" bytes.\");\n      }\n    }\n  else\n    {\n    this->ReadBufferAsASCII( file, buffer, this->GetComponentType(),\n                             this->GetImageSizeInComponents() );\n    }\n\n  itkDebugMacro(<< \"Reading Done\");\n\n#define itkReadRawBytesAfterSwappingMacro(StrongType, WeakType)   \\\n  ( this->GetComponentType() == WeakType )                        \\\n    {                                                             \\\n    typedef ByteSwapper< StrongType > InternalByteSwapperType;    \\\n    if ( m_ByteOrder == LittleEndian )                            \\\n      {                                                           \\\n      InternalByteSwapperType::SwapRangeFromSystemToLittleEndian( \\\n        (StrongType *)buffer, this->GetImageSizeInComponents() ); \\\n      }                                                           \\\n    else if ( m_ByteOrder == BigEndian )                          \\\n      {                                                           \\\n      InternalByteSwapperType::SwapRangeFromSystemToBigEndian(    \\\n        (StrongType *)buffer, this->GetImageSizeInComponents() ); \\\n      }                                                           \\\n    }\n\n  \/\/ Swap bytes if necessary\n  if itkReadRawBytesAfterSwappingMacro(unsigned short, USHORT)\n  else if itkReadRawBytesAfterSwappingMacro(short, SHORT)\n  else if itkReadRawBytesAfterSwappingMacro(char, CHAR)\n  else if itkReadRawBytesAfterSwappingMacro(unsigned char, UCHAR)\n  else if itkReadRawBytesAfterSwappingMacro(unsigned int, UINT)\n  else if itkReadRawBytesAfterSwappingMacro(int, INT)\n  else if itkReadRawBytesAfterSwappingMacro(long, LONG)\n  else if itkReadRawBytesAfterSwappingMacro(unsigned long, ULONG)\n  else if itkReadRawBytesAfterSwappingMacro(float, FLOAT)\n  else if itkReadRawBytesAfterSwappingMacro(double, DOUBLE)\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nbool RawImageIO< TPixel, VImageDimension >\n::CanWriteFile(const char *fname)\n{\n  std::string filename(fname);\n\n  if ( filename == \"\" )\n    {\n    return false;\n    }\n\n  return true;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >\n::Write(const void *buffer)\n{\n  std::ofstream file;\n\n  \/\/ Open the file\n  \/\/\n  this->OpenFileForWriting(file);\n\n  \/\/ Set up for reading\n  this->ComputeStrides();\n\n  \/\/ Actually do the writing\n  \/\/\n  if ( m_FileType == ASCII )\n    {\n    this->WriteBufferAsASCII( file, buffer, this->GetComponentType(),\n                              this->GetImageSizeInComponents() );\n    }\n  else \/\/binary\n    {\n    const SizeValueType numberOfBytes      = this->GetImageSizeInBytes();\n    const SizeValueType numberOfComponents = this->GetImageSizeInComponents();\n\n#define itkWriteRawBytesAfterSwappingMacro(StrongType, WeakType)        \\\n  ( this->GetComponentType() == WeakType )                              \\\n    {                                                                   \\\n    typedef ByteSwapper< StrongType > InternalByteSwapperType;          \\\n    if ( m_ByteOrder == LittleEndian )                                  \\\n      {                                                                 \\\n      char *tempBuffer = new char[numberOfBytes];                       \\\n      memcpy(tempBuffer, buffer, numberOfBytes);                        \\\n      InternalByteSwapperType::SwapRangeFromSystemToLittleEndian(       \\\n        (StrongType *)tempBuffer, numberOfComponents);                  \\\n      file.write(tempBuffer, numberOfBytes);                            \\\n      delete[] tempBuffer;                                              \\\n      }                                                                 \\\n    else if ( m_ByteOrder == BigEndian )                                \\\n      {                                                                 \\\n      char *tempBuffer = new char[numberOfBytes];                       \\\n      memcpy(tempBuffer, buffer, numberOfBytes);                        \\\n      InternalByteSwapperType::SwapRangeFromSystemToBigEndian(          \\\n        (StrongType *)tempBuffer, numberOfComponents);                  \\\n      file.write(tempBuffer, numberOfBytes);                            \\\n      delete[] tempBuffer;                                              \\\n      }                                                                 \\\n    else                                                                \\\n      {                                                                 \\\n      file.write(static_cast< const char * >( buffer ), numberOfBytes); \\\n      }                                                                 \\\n    }\n\n    \/\/ Swap bytes if necessary\n    if itkWriteRawBytesAfterSwappingMacro(unsigned short, USHORT)\n    else if itkWriteRawBytesAfterSwappingMacro(short, SHORT)\n    else if itkWriteRawBytesAfterSwappingMacro(char, CHAR)\n    else if itkWriteRawBytesAfterSwappingMacro(unsigned char, UCHAR)\n    else if itkWriteRawBytesAfterSwappingMacro(unsigned int, UINT)\n    else if itkWriteRawBytesAfterSwappingMacro(int, INT)\n    else if itkWriteRawBytesAfterSwappingMacro(long, LONG)\n    else if itkWriteRawBytesAfterSwappingMacro(unsigned long, ULONG)\n    else if itkWriteRawBytesAfterSwappingMacro(float, FLOAT)\n    else if itkWriteRawBytesAfterSwappingMacro(double, DOUBLE)\n    }\n\n  file.close();\n}\n} \/\/ namespace itk\n#endif\n<commit_msg>COMP: missing include<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 __itkRawImageIO_hxx\n#define __itkRawImageIO_hxx\n\n#include \"itkRawImageIO.h\"\n#include \"itkIntTypes.h\"\n\nnamespace itk\n{\ntemplate< class TPixel, unsigned int VImageDimension >\nRawImageIO< TPixel, VImageDimension >::RawImageIO():\n  ImageIOBase()\n{\n  this->SetNumberOfComponents(1);\n  this->SetPixelTypeInfo( static_cast<const PixelType *>(0) );\n  this->SetNumberOfDimensions(VImageDimension);\n\n  for ( unsigned int idx = 0; idx < VImageDimension; ++idx )\n    {\n    m_Spacing.insert(m_Spacing.begin() + idx, 1.0);\n    m_Origin.insert(m_Origin.begin() + idx, 0.0);\n    }\n\n  m_HeaderSize = 0;\n  m_ManualHeaderSize = false;\n\n  \/\/ Left over from short reader\n  m_ImageMask = 0xffff;\n  m_ByteOrder = ImageIOBase::BigEndian;\n  m_FileDimensionality = 2;\n  m_FileType = Binary;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nRawImageIO< TPixel, VImageDimension >::~RawImageIO()\n{}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >::PrintSelf(std::ostream & os, Indent indent) const\n{\n  Superclass::PrintSelf(os, indent);\n\n  os << indent << \"ImageMask: \" << m_ImageMask << std::endl;\n  os << indent << \"FileDimensionality: \" << m_FileDimensionality << std::endl;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nSizeValueType RawImageIO< TPixel, VImageDimension >::GetHeaderSize()\n{\n  std::ifstream file;\n\n  if ( m_FileName == \"\" )\n    {\n    itkExceptionMacro(<< \"A FileName must be specified.\");\n    }\n\n  if ( !m_ManualHeaderSize )\n    {\n    if ( m_FileType == ASCII )\n      {\n      return 0;                          \/\/cannot determine it\n      }\n    this->ComputeStrides();\n\n    \/\/ make sure we figure out a filename to open\n    this->OpenFileForReading(file);\n\n    \/\/ Get the size of the header from the size of the image\n    file.seekg(0, std::ios::end);\n\n    m_HeaderSize = static_cast<SizeValueType>(\n      static_cast<typename ::itk::intmax_t>( file.tellg() )\n      - static_cast<typename ::itk::intmax_t>( this->m_Strides[m_FileDimensionality + 1] )\n    );\n    }\n\n  return m_HeaderSize;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >::OpenFileForReading(std::ifstream & is)\n{\n  if ( m_FileName == \"\" )\n    {\n    itkExceptionMacro(<< \"A FileName must be specified.\");\n    }\n\n  \/\/ Close file from any previous image\n  if ( is.is_open() )\n    {\n    is.close();\n    }\n\n  \/\/ Open the new file\n  itkDebugMacro(<< \"Initialize: opening file \" << m_FileName);\n#ifdef _WIN32\n  is.open(m_FileName.c_str(), std::ios::in | std::ios::binary);\n#else\n  is.open(m_FileName.c_str(), std::ios::in);\n#endif\n  if ( is.fail() )\n    {\n    itkExceptionMacro(<< \"Could not open file: \" << m_FileName);\n    }\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >::OpenFileForWriting(std::ofstream & os)\n{\n  if ( m_FileName == \"\" )\n    {\n    itkExceptionMacro(<< \"A FileName must be specified.\");\n    }\n\n  std::ofstream tFile(m_FileName.c_str(), std::ios::out);\n  tFile.close();\n\n  \/\/ Close file from any previous image\n  if ( os.is_open() )\n    {\n    os.close();\n    }\n\n  \/\/ Open the new file\n  itkDebugMacro(<< \"Initialize: opening file \" << m_FileName);\n#ifdef _WIN32\n  os.open(m_FileName.c_str(), std::ios::out | std::ios::binary);\n#else\n  os.open(m_FileName.c_str(), std::ios::out);\n#endif\n  if ( os.fail() )\n    {\n    itkExceptionMacro(<< \"Could not open file: \" << m_FileName);\n    }\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >\n::SetHeaderSize(SizeValueType size)\n{\n  if ( size != m_HeaderSize )\n    {\n    m_HeaderSize = size;\n    this->Modified();\n    }\n  m_ManualHeaderSize = true;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >\n::Read(void *buffer)\n{\n  std::ifstream file;\n\n  \/\/ Open the file\n  this->OpenFileForReading(file);\n  this->ComputeStrides();\n\n  \/\/ Offset into file\n  SizeValueType streamStart = this->GetHeaderSize();\n  file.seekg( (OffsetValueType)streamStart, std::ios::beg );\n  if ( file.fail() )\n    {\n    itkExceptionMacro(<< \"File seek failed\");\n    }\n\n  const SizeValueType numberOfBytesToBeRead =\n    static_cast< SizeValueType >( this->GetImageSizeInBytes() );\n\n  itkDebugMacro(<< \"Reading \" << numberOfBytesToBeRead << \" bytes\");\n\n  if ( m_FileType == Binary )\n    {\n    if ( !this->ReadBufferAsBinary(file, buffer, numberOfBytesToBeRead) )\n      {\n      itkExceptionMacro(<< \"Read failed: Wanted \"\n                        << numberOfBytesToBeRead\n                        << \" bytes, but read \"\n                        << file.gcount() << \" bytes.\");\n      }\n    }\n  else\n    {\n    this->ReadBufferAsASCII( file, buffer, this->GetComponentType(),\n                             this->GetImageSizeInComponents() );\n    }\n\n  itkDebugMacro(<< \"Reading Done\");\n\n#define itkReadRawBytesAfterSwappingMacro(StrongType, WeakType)   \\\n  ( this->GetComponentType() == WeakType )                        \\\n    {                                                             \\\n    typedef ByteSwapper< StrongType > InternalByteSwapperType;    \\\n    if ( m_ByteOrder == LittleEndian )                            \\\n      {                                                           \\\n      InternalByteSwapperType::SwapRangeFromSystemToLittleEndian( \\\n        (StrongType *)buffer, this->GetImageSizeInComponents() ); \\\n      }                                                           \\\n    else if ( m_ByteOrder == BigEndian )                          \\\n      {                                                           \\\n      InternalByteSwapperType::SwapRangeFromSystemToBigEndian(    \\\n        (StrongType *)buffer, this->GetImageSizeInComponents() ); \\\n      }                                                           \\\n    }\n\n  \/\/ Swap bytes if necessary\n  if itkReadRawBytesAfterSwappingMacro(unsigned short, USHORT)\n  else if itkReadRawBytesAfterSwappingMacro(short, SHORT)\n  else if itkReadRawBytesAfterSwappingMacro(char, CHAR)\n  else if itkReadRawBytesAfterSwappingMacro(unsigned char, UCHAR)\n  else if itkReadRawBytesAfterSwappingMacro(unsigned int, UINT)\n  else if itkReadRawBytesAfterSwappingMacro(int, INT)\n  else if itkReadRawBytesAfterSwappingMacro(long, LONG)\n  else if itkReadRawBytesAfterSwappingMacro(unsigned long, ULONG)\n  else if itkReadRawBytesAfterSwappingMacro(float, FLOAT)\n  else if itkReadRawBytesAfterSwappingMacro(double, DOUBLE)\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nbool RawImageIO< TPixel, VImageDimension >\n::CanWriteFile(const char *fname)\n{\n  std::string filename(fname);\n\n  if ( filename == \"\" )\n    {\n    return false;\n    }\n\n  return true;\n}\n\ntemplate< class TPixel, unsigned int VImageDimension >\nvoid RawImageIO< TPixel, VImageDimension >\n::Write(const void *buffer)\n{\n  std::ofstream file;\n\n  \/\/ Open the file\n  \/\/\n  this->OpenFileForWriting(file);\n\n  \/\/ Set up for reading\n  this->ComputeStrides();\n\n  \/\/ Actually do the writing\n  \/\/\n  if ( m_FileType == ASCII )\n    {\n    this->WriteBufferAsASCII( file, buffer, this->GetComponentType(),\n                              this->GetImageSizeInComponents() );\n    }\n  else \/\/binary\n    {\n    const SizeValueType numberOfBytes      = this->GetImageSizeInBytes();\n    const SizeValueType numberOfComponents = this->GetImageSizeInComponents();\n\n#define itkWriteRawBytesAfterSwappingMacro(StrongType, WeakType)        \\\n  ( this->GetComponentType() == WeakType )                              \\\n    {                                                                   \\\n    typedef ByteSwapper< StrongType > InternalByteSwapperType;          \\\n    if ( m_ByteOrder == LittleEndian )                                  \\\n      {                                                                 \\\n      char *tempBuffer = new char[numberOfBytes];                       \\\n      memcpy(tempBuffer, buffer, numberOfBytes);                        \\\n      InternalByteSwapperType::SwapRangeFromSystemToLittleEndian(       \\\n        (StrongType *)tempBuffer, numberOfComponents);                  \\\n      file.write(tempBuffer, numberOfBytes);                            \\\n      delete[] tempBuffer;                                              \\\n      }                                                                 \\\n    else if ( m_ByteOrder == BigEndian )                                \\\n      {                                                                 \\\n      char *tempBuffer = new char[numberOfBytes];                       \\\n      memcpy(tempBuffer, buffer, numberOfBytes);                        \\\n      InternalByteSwapperType::SwapRangeFromSystemToBigEndian(          \\\n        (StrongType *)tempBuffer, numberOfComponents);                  \\\n      file.write(tempBuffer, numberOfBytes);                            \\\n      delete[] tempBuffer;                                              \\\n      }                                                                 \\\n    else                                                                \\\n      {                                                                 \\\n      file.write(static_cast< const char * >( buffer ), numberOfBytes); \\\n      }                                                                 \\\n    }\n\n    \/\/ Swap bytes if necessary\n    if itkWriteRawBytesAfterSwappingMacro(unsigned short, USHORT)\n    else if itkWriteRawBytesAfterSwappingMacro(short, SHORT)\n    else if itkWriteRawBytesAfterSwappingMacro(char, CHAR)\n    else if itkWriteRawBytesAfterSwappingMacro(unsigned char, UCHAR)\n    else if itkWriteRawBytesAfterSwappingMacro(unsigned int, UINT)\n    else if itkWriteRawBytesAfterSwappingMacro(int, INT)\n    else if itkWriteRawBytesAfterSwappingMacro(long, LONG)\n    else if itkWriteRawBytesAfterSwappingMacro(unsigned long, ULONG)\n    else if itkWriteRawBytesAfterSwappingMacro(float, FLOAT)\n    else if itkWriteRawBytesAfterSwappingMacro(double, DOUBLE)\n    }\n\n  file.close();\n}\n} \/\/ namespace itk\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef stack_cpp\r\n#define stack_cpp\r\n#pragma once\r\n#include <iostream>\r\nusing namespace std;\r\ntemplate<typename T>\r\nauto newcopy( const T * item, size_t size, size_t count) -> T*\r\n{\r\n\tT * buff = new T[size];\r\n\tcopy(item, item + count, buff);\r\n\treturn buff;\t\r\n}\r\ntemplate <typename T>\r\nclass stack\r\n{\r\npublic:\r\n\tstack();\r\n\tstack(stack const &);\r\n\t~stack();\r\n\tsize_t count() const;\r\n\tauto push(T const &) -> void;\r\n\tT pop();\r\n\tauto operator=(stack const & right)->stack &;\r\nprivate:\r\n\tT * array_;\r\n\tsize_t array_size_;\r\n\tsize_t count_;\r\n};\r\ntemplate <typename T>\r\nsize_t stack<T>::count() const\r\n{\r\n\treturn count_;\r\n}\r\ntemplate <typename T>\r\nstack<T>::stack():(array_ T[array_size_], array_size_(0), count_(0))\r\n{\r\n\r\n}\r\n\r\ntemplate<typename T>\r\nstack<T>::stack(stack const & item):array_size_(item.array_size_), count_(item.count_),array_(newcopy(item.array_, item.array_size_,item.count_))\r\n{\r\n\r\n}\r\n\r\ntemplate <typename T>\r\nstack<T>::~stack()\r\n{\r\n\tdelete[] array_;\r\n}\r\n\r\ntemplate<typename T>\r\nauto stack<T>::push(T const & item) -> void {\r\n\tif (count_ == array_size_) {\r\n\t\tsize_t size = array_size_ * 2 + (array_size_ == 0) ;\r\n\t\tT * buff = newcopy(array_, size, array_size_);\r\n\t\tbuff[count_] = size;\r\n\t\tdelete[] array_;\r\n\t\tarray_ = buff;\r\n\t\tarray_size_ = size;\r\n\t}\r\n\tarray_[count_] = item;\r\n\t++count_;\r\n}\r\n\r\n\r\ntemplate<typename T>\r\nT stack<T>::pop() {\r\n\tif (count_ == 0) {\r\n\t\tthrow std::logic_error(\"Stack is empty!\");\r\n\t}\r\n\treturn array_[--count_];\r\n}\r\ntemplate<typename T>\r\nauto stack<T>::operator=(stack const & right) -> stack & {\r\n\tif (this != &right) {\r\n\tdelete[] array_;\r\n\tcount_ = right.count_;\r\n\tarray_size_ = right.array_size_;\r\n\tnewcopy(right.array_, array_size_, count_);\r\n\t}\r\n\treturn *this;\r\n}\r\n\r\n#endif\r\n<commit_msg>Update stack.cpp<commit_after>#ifndef stack_cpp\r\n#define stack_cpp\r\n#pragma once\r\n#include <iostream>\r\nusing namespace std;\r\ntemplate<typename T>\r\nauto newcopy( const T * item, size_t size, size_t count) -> T*\r\n{\r\n\tT * buff = new T[size];\r\n\tcopy(item, item + count, buff);\r\n\treturn buff;\t\r\n}\r\ntemplate <typename T>\r\nclass stack\r\n{\r\npublic:\r\n\tstack();\r\n\tstack(stack const &);\r\n\t~stack();\r\n\tsize_t count() const;\r\n\tauto push(T const &) -> void;\r\n\tT pop();\r\n\tauto operator=(stack const & right)->stack &;\r\nprivate:\r\n\tT * array_;\r\n\tsize_t array_size_;\r\n\tsize_t count_;\r\n};\r\ntemplate <typename T>\r\nsize_t stack<T>::count() const\r\n{\r\n\treturn count_;\r\n}\r\ntemplate <typename T>\r\nstack<T>::stack():array_ (new T[array_size_]), array_size_(0), count_(0)\r\n{\r\n\r\n}\r\n\r\ntemplate<typename T>\r\nstack<T>::stack(stack const & item):array_size_(item.array_size_), count_(item.count_),array_(newcopy(item.array_, item.array_size_,item.count_))\r\n{\r\n\r\n}\r\n\r\ntemplate <typename T>\r\nstack<T>::~stack()\r\n{\r\n\tdelete[] array_;\r\n}\r\n\r\ntemplate<typename T>\r\nauto stack<T>::push(T const & item) -> void {\r\n\tif (count_ == array_size_) {\r\n\t\tsize_t size = array_size_ * 2 + (array_size_ == 0) ;\r\n\t\tT * buff = newcopy(array_, size, array_size_);\r\n\t\tbuff[count_] = size;\r\n\t\tdelete[] array_;\r\n\t\tarray_ = buff;\r\n\t\tarray_size_ = size;\r\n\t}\r\n\tarray_[count_] = item;\r\n\t++count_;\r\n}\r\n\r\n\r\ntemplate<typename T>\r\nT stack<T>::pop() {\r\n\tif (count_ == 0) {\r\n\t\tthrow std::logic_error(\"Stack is empty!\");\r\n\t}\r\n\treturn array_[--count_];\r\n}\r\ntemplate<typename T>\r\nauto stack<T>::operator=(stack const & right) -> stack & {\r\n\tif (this != &right) {\r\n\tdelete[] array_;\r\n\tcount_ = right.count_;\r\n\tarray_size_ = right.array_size_;\r\n\tnewcopy(right.array_, array_size_, count_);\r\n\t}\r\n\treturn *this;\r\n}\r\n\r\n#endif\r\n<|endoftext|>"}
{"text":"<commit_before>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\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* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include \"common\/RhoPort.h\"\n#include \"ruby\/ext\/rho\/rhoruby.h\"\n#include \"rubyext\/WebView.h\"\n#include \"common\/RhodesApp.h\"\n#include \"common\/StringConverter.h\"\n#include \"MainWindowImpl.h\"\n\n#undef DEFAULT_LOGCATEGORY\n#define DEFAULT_LOGCATEGORY \"WebView\"\n\nusing namespace rho;\nusing namespace rho::common;\n\nstatic wchar_t *dup_wcs(const wchar_t *s)\n{\n    size_t len = wcslen(s);\n    wchar_t *ret = (wchar_t*)malloc((len+1)*sizeof(wchar_t));\n    wcscpy(ret, s);\n    return ret;\n}\n\nextern \"C\" {\n\nvoid rho_webview_refresh(int index) \n{\n    CMainWindow::getInstance()->refreshCommand(index);\n}\n\nvoid rho_webview_navigate(const char* url, int index) \n{\n    if ( !url )\n    {\n        RAWLOG_ERROR(\"WebView.navigate failed: url is nil\");\n        return;\n    }\n\n    String strUrl = RHODESAPP().canonicalizeRhoUrl(url);\n\n    TNavigateData* nd = (TNavigateData*)malloc(sizeof(TNavigateData));\n    nd->index = index;\n    nd->url = dup_wcs(convertToStringW(strUrl).c_str());\n    CMainWindow::getInstance()->navigateCommand(nd);\n}\n\nvoid rho_webview_navigate_back()\n{\n    CMainWindow::getInstance()->navigateBackCommand();\n}\n\nvoid rho_webview_navigate_forward()\n{\n    CMainWindow::getInstance()->navigateForwardCommand();\n}\n\nconst char* rho_webview_execute_js(const char* js, int index) \n{\n    String strJS = \"javascript:\";\n    strJS += js;\n    rho_webview_navigate(strJS.c_str(), index);\n    return \"\";\n}\n\nconst char* rho_webview_current_location(int index) \n{\n    return RHODESAPP().getCurrentUrl(index).c_str();\n}\n\nint rho_webview_active_tab() \n{\n    return CMainWindow::getInstance()->tabbarGetCurrent();\n}\n\nvoid rho_webview_set_menu_items(VALUE valMenu) \n{\n    rho_rhodesapp_setViewMenu(valMenu); \n}\n\nvoid rho_webview_full_screen_mode(int enable)\n{\n    CMainWindow::getInstance()->fullscreenCommand(enable);\n}\n\nvoid rho_webview_set_cookie(const char *url, const char *cookie)\n{\n    CMainWindow::getInstance()->setCookie(url, cookie);\n}\n\nvoid rho_webview_save(const char* format, const char* path, int tab_index)\n{\n    RAWLOG_ERROR(\"rho_webview_save is not implemented\");\n}\n    \nVALUE rho_webview_get_current_url(int tab_index)\n{\n    RAWLOG_ERROR(\"rho_webview_get_current_url is not implemented\");\n    return rho_ruby_get_NIL();\n}\n   \n\n} \/\/extern \"C\"\n<commit_msg>rhosimulator\/macosx: build fixed<commit_after>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\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* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include \"common\/RhoPort.h\"\n#include \"ruby\/ext\/rho\/rhoruby.h\"\n#include \"rubyext\/WebView.h\"\n#include \"common\/RhodesApp.h\"\n#include \"common\/StringConverter.h\"\n#include \"MainWindowImpl.h\"\n\n#undef DEFAULT_LOGCATEGORY\n#define DEFAULT_LOGCATEGORY \"WebView\"\n\nusing namespace rho;\nusing namespace rho::common;\n\nstatic wchar_t *dup_wcs(const wchar_t *s)\n{\n    size_t len = wcslen(s);\n    wchar_t *ret = (wchar_t*)malloc((len+1)*sizeof(wchar_t));\n    wcscpy(ret, s);\n    return ret;\n}\n\nextern \"C\" {\n\nvoid rho_webview_refresh(int index) \n{\n    CMainWindow::getInstance()->refreshCommand(index);\n}\n\nvoid rho_webview_navigate(const char* url, int index) \n{\n    if ( !url )\n    {\n        RAWLOG_ERROR(\"WebView.navigate failed: url is nil\");\n        return;\n    }\n\n    String strUrl = RHODESAPP().canonicalizeRhoUrl(url);\n\n    TNavigateData* nd = (TNavigateData*)malloc(sizeof(TNavigateData));\n    nd->index = index;\n    nd->url = dup_wcs(convertToStringW(strUrl).c_str());\n    CMainWindow::getInstance()->navigateCommand(nd);\n}\n\nvoid rho_webview_navigate_back()\n{\n    CMainWindow::getInstance()->navigateBackCommand();\n}\n\nvoid rho_webview_navigate_forward()\n{\n    CMainWindow::getInstance()->navigateForwardCommand();\n}\n\nconst char* rho_webview_execute_js(const char* js, int index) \n{\n    String strJS = \"javascript:\";\n    strJS += js;\n    rho_webview_navigate(strJS.c_str(), index);\n    return \"\";\n}\n\nconst char* rho_webview_current_location(int index) \n{\n    return RHODESAPP().getCurrentUrl(index).c_str();\n}\n\nint rho_webview_active_tab() \n{\n    return CMainWindow::getInstance()->tabbarGetCurrent();\n}\n\nvoid rho_webview_set_menu_items(VALUE valMenu) \n{\n    rho_rhodesapp_setViewMenu(valMenu); \n}\n\nvoid rho_webview_full_screen_mode(int enable)\n{\n    CMainWindow::getInstance()->fullscreenCommand(enable);\n}\n\nvoid rho_webview_set_cookie(const char *url, const char *cookie)\n{\n    CMainWindow::getInstance()->setCookie(url, cookie);\n}\n\nvoid rho_webview_save(const char* format, const char* path, int tab_index)\n{\n    RAWLOG_ERROR(\"rho_webview_save is not implemented\");\n}\n\nconst char* rho_webview_get_current_url(int tab_index)\n{\n    RAWLOG_ERROR(\"rho_webview_get_current_url is not implemented\");\n    return NULL;\n}\n\n} \/\/extern \"C\"\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/\n\/\/ File   : IcomCAT.cpp\n\/\/\n\/\/ Purpose: Implementation of the class IcomCAT\n\/\/\n\/\/ $Id$\n\/\/\n\n\n#include <Stream.h>\n#include <Streaming.h>\n\n#include <CATutil.h>\n#include <IcomCAT.h>\n\nIcomCAT::IcomCAT(Stream& stream,byte address)\n : myStream(stream), rigAddress(address), \n   rxMsgLength(0), rxMsgComplete(false),\n   myMode(ILLEGAL_MODE), myFrequency(ILLEGAL_FREQ)\n {\n\n}\n\nstatic int getNibble(const byte* s,int i) {\n\n  byte k = s[i\/2];\n  if ( i % 2 == 0 )\n    k = k >> 4;\n  return k & 0x0f;\n}\n\nuint32_t IcomCAT::parseFrequency(const byte* message) {\n\n  static byte ks[] = { 10, 11, 8, 9, 6, 7, 4, 5, 2, 3 };\n  uint32_t f = 0;\n\n  for (size_t i=0; i<sizeof(ks); ++i) {\n     byte k = ks[i];\n     f = 10*f + getNibble(message,k);\n  }\n\n  return f;\n}\n\nbool IcomCAT::parseMessage() {\n\n  if ( !rxMsgComplete ) return false;\n\n#ifdef DEBUG\n  Serial << F(\"Rx(\") << rxMsgLength << F(\"): \"); \n  CATutil::print(rxMessage,rxMsgLength);\n#endif \/\/ DEBUG\n\n  \/\/ reset 'complete' flag\n  rxMsgComplete = false;\n  \n  bool err = false;\n  \n  if (rxMessage[0] != IcomCAT::INTRO) err = true;\n  if (rxMessage[1] != IcomCAT::INTRO) err = true;\n  if (rxMessage[rxMsgLength-1] != IcomCAT::EOM) err = true;\n  \/\/ message to the rig?\n  if (rxMessage[2] == rigAddress) {\n    \/\/ erase it\n    rxMsgLength = 0;\n    Serial << F(\"Skipped ECHO!\") << endl;\n    return false;\n  }\n  \/\/ message from the rig?\n  if (rxMessage[3] != rigAddress) err = true;\n\n  if ( err ) {\n    Serial << F(\"CAT message error!\") << endl;\n    rxMsgLength = 0;\n    \n    return false;\n  }\n\n  bool status = true;\n  \n  switch ( rxMessage[4] ) {\n\n    case eTRANSFER_FREQ: \/\/ transfer operating frequency data\n    case eGET_OPERATING_FREQ:\n      myFrequency = parseFrequency(&rxMessage[4]);\n      break;\n\n    case eTRANSFER_MODE: \/\/ transfer operating mode data\n    case eGET_OPERATING_MODE:\n      \/\/ rxMessage[6] is the passband\/filter data\n      \/\/ 0x01 = wide, 0x02 = normal, 0x03 = narrow\n      myMode = rxMessage[5];\n      break;\n    \n    default:\n      Serial << F(\"Message \");\n      CATutil::print(rxMessage[4]);\n      Serial << F(\" ignored!\") << endl;\n      status = false;\n      break;\n  }\n  \n  rxMsgLength = 0;\n  \n  return status;\n}\n\nbool IcomCAT::read() {\n\n  static int nIntro = 0;\n  \n  byte ch = myStream.read();\n\n#ifdef DEBUG\n  \/\/Serial << F(\"Rx: \"); CATutil::print(ch); Serial.println();\n#endif \/\/ DEBUG\n\n  if ( ch == IcomCAT::INTRO ) {\n    nIntro++;\n    rxMessage[rxMsgLength++] = ch;\n  }\n  if ( ch != IcomCAT::INTRO && nIntro == 2 ) {\n    rxMessage[rxMsgLength++] = ch;\n  }\n  if ( ch == IcomCAT::EOM ) {\n    nIntro = 0;\n    rxMsgComplete = true;\n  }\n  if ( rxMsgLength > IcomCAT::MAXLEN ) {\n    Serial << F(\"MSG length error!\") << endl;\n    rxMsgComplete = false;\n    rxMsgLength = 0;  \/\/ clear message buffer\n    nIntro = 0;\n  }\n\n  return rxMsgComplete;\n}\n\n\/**\n * - message to ICom:\n *  +------+------+----+----+----+------+\n *  | 0xFE | 0xFE | 58 | E0 | 03 | 0xFD |\n *  +------+------+----+----+----+------+\n *  \n *  - message from ICom:\n *  +------+------+----+----+----+-------+-------+-------+-------+-------+------+\n *  | 0xFE | 0xFE | 00 | 58 | 00 | Data0 | Data1 | Data2 | Data3 | Data4 | 0xFD |\n *  +------+------+----+----+----+-------+-------+-------+-------+-------+------+\n *\/\nbool IcomCAT::requestFrequency() {\n\n  int msgLen = 0;\n  byte message[8];\n\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = rigAddress;\n  message[msgLen++] = MY_ADDRESS;\n  message[msgLen++] = IcomCAT::eGET_OPERATING_FREQ;\n  message[msgLen++] = IcomCAT::EOM;\n\n  return sendMessage(message, msgLen);\n}\n\n\/**\n * - message to ICom:\n *  +------+------+----+----+----+------+\n *  | 0xFE | 0xFE | 58 | E0 | 03 | 0xFD |\n *  +------+------+----+----+----+------+\n *  \n *  - message from ICom:\n *  +------+------+----+----+----+------+------+\n *  | 0xFE | 0xFE | 00 | 58 | 01 | mode | 0xFD |\n *  +------+------+----+----+----+------+------+\n *\/\nbool IcomCAT::requestMode() {\n\n  int msgLen = 0;\n  byte message[8];\n\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = rigAddress;\n  message[msgLen++] = MY_ADDRESS;\n  message[msgLen++] = IcomCAT::eGET_OPERATING_MODE;\n  message[msgLen++] = IcomCAT::EOM;\n\n  return sendMessage(message, msgLen);\n}\n\nbool IcomCAT::sendMessage(const byte* msg,size_t msgLen) {\n  \n  if (!msgLen ) return false;\n\n#ifdef DEBUG\n  Serial << F(\"Tx(\") << msgLen << F(\"): \");\n  CATutil::print(msg, msgLen);\n#endif \/\/ DEBUG\n  \n  for (size_t i=0; i<msgLen; ++i) {\n\n    \/\/ SoftwareSerial will not receive during send\n    if ( myStream.available() ) read();\n    \n    \/\/ should return 1 on success (i.e. 1 byte written)\n    if ( !myStream.write(msg[i]) ) return false;\n  }\n  \n  return true;\n}\n\n\/** Create BCD 'byte' from two characters (digits), no error checking done! *\/\n#define bcd(_h,_l) ((int)_l - '0' + 16 * ((int)_h - '0'))\n\n\/**\n *  - message to ICom:\n *  +------+------+----+----+----+-------+-------+-------+-------+-------+------+\n *  | 0xFE | 0xFE | 58 | E0 | 05 | Data0 | Data1 | Data2 | Data3 | Data4 | 0xFD |\n *  +------+------+----+----+----+-------+-------+-------+-------+-------+------+\n *  \n *  - message from ICom:\n *  +------+------+----+----+------+------+\n *  | 0xFE | 0xFE | E0 | 58 | 0xFB | 0xFD |\n *  +------+------+----+----+------+------+\n *\/\nbool IcomCAT::writeFrequency(uint32_t frequency) {\n\n  int msgLen = 0;\n  byte message[12];\n\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = rigAddress;\n  message[msgLen++] = MY_ADDRESS;\n  message[msgLen++] = IcomCAT::eSET_OPERATING_FREQ;\n\n  byte *ptr = &message[msgLen];\n  \n  for (int i=0; i<5; ++i )\n    message[msgLen++] = 0;\n\n  \/\/ convert the integer frequency into a string of 10 bytes length\n  char freq_str[12];\n  ultoa(frequency, freq_str, 10);\n\n  \/\/ ... with leading zeros\n  while ( strlen(freq_str) < 10 ) {\n    freq_str[strlen(freq_str)+1] = 0;\n    for ( int i=strlen(freq_str); i>0; --i)\n      freq_str[i] = freq_str[i-1];\n    freq_str[0] = '0';\n  }\n\n#ifdef DEBUG\n  \/\/Serial << \"f= \" << freq_str << endl;\n  \/\/Serial << \"len(f)= \" << strlen(freq_str) << endl;\n#endif \/\/ DEBUG\n\n  *ptr++ = bcd(freq_str[8], freq_str[9]);\n  *ptr++ = bcd(freq_str[6], freq_str[7]);\n  *ptr++ = bcd(freq_str[4], freq_str[5]);\n  *ptr++ = bcd(freq_str[2], freq_str[3]);\n  *ptr++ = bcd(freq_str[0], freq_str[1]);\n  \n  message[msgLen++] = IcomCAT::EOM;\n\n#ifdef DEBUG\n  \/\/Serial << F(\"Tx: \");\n  \/\/CATutil::print(message, msgLen);\n#endif \/\/ DEBUG\n\n  myFrequency = IcomCAT::ILLEGAL_FREQ;\n  \n  return sendMessage(message, msgLen);\n}\n\n\/**\n *  - message to ICom:\n *  +------+------+----+----+----+------+------+\n *  | 0xFE | 0xFE | 58 | E0 | 06 | mode | 0xFD |\n *  +------+------+----+----+----+------+------+\n *  \n *  - message from ICom:\n *  +------+------+----+----+------+------+\n *  | 0xFE | 0xFE | E0 | 58 | 0xFB | 0xFD |\n *  +------+------+----+----+------+------+\n *\/\nbool IcomCAT::writeMode(byte mode) {\n\n  int msgLen = 0;\n  byte message[8];\n\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = rigAddress;\n  message[msgLen++] = MY_ADDRESS;\n  message[msgLen++] = IcomCAT::eSET_OPERATING_MODE;\n  message[msgLen++] = mode;\n  message[msgLen++] = IcomCAT::EOM;\n\n  myMode = IcomCAT::ILLEGAL_MODE;\n  \n  return sendMessage(message, msgLen);\n}\n\n<commit_msg>DEBUG\/_DEBUG<commit_after>\n\/\/\n\/\/ File   : IcomCAT.cpp\n\/\/\n\/\/ Purpose: Implementation of the class IcomCAT\n\/\/\n\/\/ $Id$\n\/\/\n\n\n#include <Stream.h>\n#include <Streaming.h>\n\n#include <CATutil.h>\n#include <IcomCAT.h>\n\n#define _DEBUG\n\nIcomCAT::IcomCAT(Stream& stream,byte address)\n : myStream(stream), rigAddress(address),\n   rxMsgLength(0), rxMsgComplete(false),\n   myMode(ILLEGAL_MODE), myFrequency(ILLEGAL_FREQ)\n {\n\n}\n\nstatic int getNibble(const byte* s,int i) {\n\n  byte k = s[i\/2];\n  if ( i % 2 == 0 )\n    k = k >> 4;\n  return k & 0x0f;\n}\n\nuint32_t IcomCAT::parseFrequency(const byte* message) {\n\n  static byte ks[] = { 10, 11, 8, 9, 6, 7, 4, 5, 2, 3 };\n  uint32_t f = 0;\n\n  for (size_t i=0; i<sizeof(ks); ++i) {\n     byte k = ks[i];\n     f = 10*f + getNibble(message,k);\n  }\n\n  return f;\n}\n\nbool IcomCAT::parseMessage() {\n\n  if ( !rxMsgComplete ) return false;\n\n#ifdef DEBUG\n  Serial << F(\"Rx(\") << rxMsgLength << F(\"): \");\n  CATutil::print(rxMessage,rxMsgLength);\n#endif \/\/ DEBUG\n\n  \/\/ reset 'complete' flag\n  rxMsgComplete = false;\n\n  bool err = false;\n\n  if (rxMessage[0] != IcomCAT::INTRO) err = true;\n  if (rxMessage[1] != IcomCAT::INTRO) err = true;\n  if (rxMessage[rxMsgLength-1] != IcomCAT::EOM) err = true;\n  \/\/ message to the rig?\n  if (rxMessage[2] == rigAddress) {\n    \/\/ erase it\n    rxMsgLength = 0;\n    Serial << F(\"Skipped ECHO!\") << endl;\n    return false;\n  }\n  \/\/ message from the rig?\n  if (rxMessage[3] != rigAddress) err = true;\n\n  if ( err ) {\n    Serial << F(\"CAT message error!\") << endl;\n    rxMsgLength = 0;\n\n    return false;\n  }\n\n  bool status = true;\n\n  switch ( rxMessage[4] ) {\n\n    case eTRANSFER_FREQ: \/\/ transfer operating frequency data\n    case eGET_OPERATING_FREQ:\n      myFrequency = parseFrequency(&rxMessage[4]);\n      break;\n\n    case eTRANSFER_MODE: \/\/ transfer operating mode data\n    case eGET_OPERATING_MODE:\n      \/\/ rxMessage[6] is the passband\/filter data\n      \/\/ 0x01 = wide, 0x02 = normal, 0x03 = narrow\n      myMode = rxMessage[5];\n      break;\n\n    default:\n      Serial << F(\"Message \");\n      CATutil::print(rxMessage[4]);\n      Serial << F(\" ignored!\") << endl;\n      status = false;\n      break;\n  }\n\n  rxMsgLength = 0;\n\n  return status;\n}\n\nbool IcomCAT::read() {\n\n  static int nIntro = 0;\n\n  byte ch = myStream.read();\n\n#ifdef DEBUG\n  \/\/Serial << F(\"Rx: \"); CATutil::print(ch); Serial.println();\n#endif \/\/ DEBUG\n\n  if ( ch == IcomCAT::INTRO ) {\n    nIntro++;\n    rxMessage[rxMsgLength++] = ch;\n  }\n  if ( ch != IcomCAT::INTRO && nIntro == 2 ) {\n    rxMessage[rxMsgLength++] = ch;\n  }\n  if ( ch == IcomCAT::EOM ) {\n    nIntro = 0;\n    rxMsgComplete = true;\n  }\n  if ( rxMsgLength > IcomCAT::MAXLEN ) {\n    Serial << F(\"MSG length error!\") << endl;\n    rxMsgComplete = false;\n    rxMsgLength = 0;  \/\/ clear message buffer\n    nIntro = 0;\n  }\n\n  return rxMsgComplete;\n}\n\n\/**\n * - message to ICom:\n *  +------+------+----+----+----+------+\n *  | 0xFE | 0xFE | 58 | E0 | 03 | 0xFD |\n *  +------+------+----+----+----+------+\n *\n *  - message from ICom:\n *  +------+------+----+----+----+-------+-------+-------+-------+-------+------+\n *  | 0xFE | 0xFE | 00 | 58 | 00 | Data0 | Data1 | Data2 | Data3 | Data4 | 0xFD |\n *  +------+------+----+----+----+-------+-------+-------+-------+-------+------+\n *\/\nbool IcomCAT::requestFrequency() {\n\n  int msgLen = 0;\n  byte message[8];\n\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = rigAddress;\n  message[msgLen++] = MY_ADDRESS;\n  message[msgLen++] = IcomCAT::eGET_OPERATING_FREQ;\n  message[msgLen++] = IcomCAT::EOM;\n\n  return sendMessage(message, msgLen);\n}\n\n\/**\n * - message to ICom:\n *  +------+------+----+----+----+------+\n *  | 0xFE | 0xFE | 58 | E0 | 03 | 0xFD |\n *  +------+------+----+----+----+------+\n *\n *  - message from ICom:\n *  +------+------+----+----+----+------+------+\n *  | 0xFE | 0xFE | 00 | 58 | 01 | mode | 0xFD |\n *  +------+------+----+----+----+------+------+\n *\/\nbool IcomCAT::requestMode() {\n\n  int msgLen = 0;\n  byte message[8];\n\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = rigAddress;\n  message[msgLen++] = MY_ADDRESS;\n  message[msgLen++] = IcomCAT::eGET_OPERATING_MODE;\n  message[msgLen++] = IcomCAT::EOM;\n\n  return sendMessage(message, msgLen);\n}\n\nbool IcomCAT::sendMessage(const byte* msg,size_t msgLen) {\n\n  if (!msgLen ) return false;\n\n#ifdef DEBUG\n  Serial << F(\"Tx(\") << msgLen << F(\"): \");\n  CATutil::print(msg, msgLen);\n#endif \/\/ DEBUG\n\n  for (size_t i=0; i<msgLen; ++i) {\n\n    \/\/ SoftwareSerial will not receive during send\n    if ( myStream.available() ) read();\n\n    \/\/ should return 1 on success (i.e. 1 byte written)\n    if ( !myStream.write(msg[i]) ) return false;\n  }\n\n  return true;\n}\n\n\/** Create BCD 'byte' from two characters (digits), no error checking done! *\/\n#define bcd(_h,_l) ((int)_l - '0' + 16 * ((int)_h - '0'))\n\n\/**\n *  - message to ICom:\n *  +------+------+----+----+----+-------+-------+-------+-------+-------+------+\n *  | 0xFE | 0xFE | 58 | E0 | 05 | Data0 | Data1 | Data2 | Data3 | Data4 | 0xFD |\n *  +------+------+----+----+----+-------+-------+-------+-------+-------+------+\n *\n *  - message from ICom:\n *  +------+------+----+----+------+------+\n *  | 0xFE | 0xFE | E0 | 58 | 0xFB | 0xFD |\n *  +------+------+----+----+------+------+\n *\/\nbool IcomCAT::writeFrequency(uint32_t frequency) {\n\n  int msgLen = 0;\n  byte message[12];\n\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = rigAddress;\n  message[msgLen++] = MY_ADDRESS;\n  message[msgLen++] = IcomCAT::eSET_OPERATING_FREQ;\n\n  byte *ptr = &message[msgLen];\n\n  for (int i=0; i<5; ++i )\n    message[msgLen++] = 0;\n\n  \/\/ convert the integer frequency into a string of 10 bytes length\n  char freq_str[12];\n  ultoa(frequency, freq_str, 10);\n\n  \/\/ ... with leading zeros\n  while ( strlen(freq_str) < 10 ) {\n    freq_str[strlen(freq_str)+1] = 0;\n    for ( int i=strlen(freq_str); i>0; --i)\n      freq_str[i] = freq_str[i-1];\n    freq_str[0] = '0';\n  }\n\n#ifdef DEBUG\n  \/\/Serial << \"f= \" << freq_str << endl;\n  \/\/Serial << \"len(f)= \" << strlen(freq_str) << endl;\n#endif \/\/ DEBUG\n\n  *ptr++ = bcd(freq_str[8], freq_str[9]);\n  *ptr++ = bcd(freq_str[6], freq_str[7]);\n  *ptr++ = bcd(freq_str[4], freq_str[5]);\n  *ptr++ = bcd(freq_str[2], freq_str[3]);\n  *ptr++ = bcd(freq_str[0], freq_str[1]);\n\n  message[msgLen++] = IcomCAT::EOM;\n\n#ifdef DEBUG\n  \/\/Serial << F(\"Tx: \");\n  \/\/CATutil::print(message, msgLen);\n#endif \/\/ DEBUG\n\n  myFrequency = IcomCAT::ILLEGAL_FREQ;\n\n  return sendMessage(message, msgLen);\n}\n\n\/**\n *  - message to ICom:\n *  +------+------+----+----+----+------+------+\n *  | 0xFE | 0xFE | 58 | E0 | 06 | mode | 0xFD |\n *  +------+------+----+----+----+------+------+\n *\n *  - message from ICom:\n *  +------+------+----+----+------+------+\n *  | 0xFE | 0xFE | E0 | 58 | 0xFB | 0xFD |\n *  +------+------+----+----+------+------+\n *\/\nbool IcomCAT::writeMode(byte mode) {\n\n  int msgLen = 0;\n  byte message[8];\n\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = IcomCAT::INTRO;\n  message[msgLen++] = rigAddress;\n  message[msgLen++] = MY_ADDRESS;\n  message[msgLen++] = IcomCAT::eSET_OPERATING_MODE;\n  message[msgLen++] = mode;\n  message[msgLen++] = IcomCAT::EOM;\n\n  myMode = IcomCAT::ILLEGAL_MODE;\n\n  return sendMessage(message, msgLen);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _algorithm_hpp_1337420\n#define _algorithm_hpp_1337420\n\n#include \"..\/ztl_base.hpp\"\n\n__ztl_namespace_start\n\ntemplate<typename T> void swap(T& t1, T& t2) {\n\tT tmp(t1);\n\tt1 = t2;     \n\tt2 = tmp; \t\t\t \n}\n\ntemplate<typename T>\nvoid memset32(T *dest, int32_t val, uint32_t count) {\n\t\/*__asm {\n\t\tmov ecx, val\n\t\tmov eax, count\n\t\tmov edi, dest\n\t\trep stosd\n\t};*\/\n\twhile (count--)\n\t\t*dest++ = val;\n}\n\ntemplate<typename T>\nvoid memset_custom(T *dest, T val, uint32_t count) {\n\twhile (count--)\n\t\t*dest++ = val;\n}\n\n\n__ztl_namespace_end\n\n#endif \/*_algorithm_hpp_1337420 *\/\n<commit_msg>Fix memset parameters<commit_after>#ifndef _algorithm_hpp_1337420\n#define _algorithm_hpp_1337420\n\n#include \"..\/ztl_base.hpp\"\n\n__ztl_namespace_start\n\ntemplate<typename T> void swap(T& t1, T& t2) {\n\tT tmp(t1);\n\tt1 = t2;     \n\tt2 = tmp; \t\t\t \n}\n\ntemplate<typename T>\nvoid memset32(T *dest, T val, uint32_t count) {\n\t\/*__asm {\n\t\tmov ecx, val\n\t\tmov eax, count\n\t\tmov edi, dest\n\t\trep stosd\n\t};*\/\n\twhile (count--)\n\t\t*dest++ = val;\n}\n\ntemplate<typename T>\nvoid memset_custom(T *dest, T val, uint32_t count) {\n\twhile (count--)\n\t\t*dest++ = val;\n}\n\n\n__ztl_namespace_end\n\n#endif \/*_algorithm_hpp_1337420 *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This istream filter reads a 32 bit header size from the stream,\n * reads it into a buffer and invokes a callback with the tail of the\n * stream.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"sink_header.hxx\"\n#include \"istream_pointer.hxx\"\n#include \"istream_oo.hxx\"\n#include \"async.hxx\"\n#include \"util\/Cast.hxx\"\n#include \"util\/ByteOrder.hxx\"\n\n#include <glib.h>\n\n#include <assert.h>\n#include <string.h>\n#include <stdint.h>\n\nstruct HeaderSink {\n    struct istream output;\n\n    enum {\n        SIZE, HEADER, CALLBACK, DATA\n    } state = SIZE;\n\n    IstreamPointer input;\n\n    unsigned char size_buffer[4];\n\n    unsigned char *buffer;\n    size_t size, position = 0;\n\n    \/**\n     * How much data of the input is pending to be consumed?  Only\n     * valid while state==CALLBACK.\n     *\/\n    size_t pending;\n\n    const struct sink_header_handler *handler;\n    void *handler_ctx;\n\n    struct async_operation operation;\n\n    void Abort() {\n        input.Close();\n        istream_deinit(&output);\n    }\n\n    size_t InvokeCallback(size_t consumed);\n\n    size_t ConsumeSize(const void *data, size_t length);\n    size_t ConsumeHeader(const void *data, size_t length);\n\n    \/* handler *\/\n\n    size_t OnData(const void *data, size_t length);\n    ssize_t OnDirect(FdType type, int fd, size_t max_length);\n    void OnEof();\n    void OnError(GError *error);\n};\n\nstatic GQuark\nsink_header_quark(void)\n{\n    return g_quark_from_static_string(\"sink_header\");\n}\n\nsize_t\nHeaderSink::InvokeCallback(size_t consumed)\n{\n    assert(state == SIZE || state == HEADER);\n\n    operation.Finished();\n\n    const ScopePoolRef ref(*output.pool TRACE_ARGS);\n\n    \/* the base value has been set by sink_header_input_data() *\/\n    pending += consumed;\n\n    state = CALLBACK;\n    handler->done(buffer, size,\n                  &output,\n                  handler_ctx);\n\n    if (input.IsDefined()) {\n        state = DATA;\n        input.SetDirect(output.handler_direct);\n    } else\n        \/* we have been closed meanwhile; bail out *\/\n        consumed = 0;\n\n    return consumed;\n}\n\ninline size_t\nHeaderSink::ConsumeSize(const void *data, size_t length)\n{\n    assert(position < sizeof(size_buffer));\n\n    if (length > sizeof(size_buffer) - position)\n        length = sizeof(size_buffer) - position;\n\n    memcpy(size_buffer + position, data, length);\n    position += length;\n\n    if (position < sizeof(size_buffer))\n        return length;\n\n    const uint32_t *size_p = (const uint32_t *)(const void *)size_buffer;\n    size = FromBE32(*size_p);\n    if (size > 0x100000) {\n        \/* header too large *\/\n        operation.Finished();\n        input.Close();\n\n        GError *error =\n            g_error_new_literal(sink_header_quark(), 0,\n                                \"header is too large\");\n        handler->error(error, handler_ctx);\n        istream_deinit(&output);\n        return 0;\n    }\n\n    if (size > 0) {\n        buffer = (unsigned char *)\n            p_malloc(output.pool, size);\n        state = HeaderSink::HEADER;\n        position = 0;\n    } else {\n        \/* header empty: don't allocate, invoke callback now *\/\n\n        buffer = nullptr;\n\n        length = InvokeCallback(length);\n    }\n\n    return length;\n}\n\ninline size_t\nHeaderSink::ConsumeHeader(const void *data, size_t length)\n{\n    size_t nbytes = size - position;\n\n    assert(position < size);\n\n    if (nbytes > length)\n        nbytes = length;\n\n    memcpy(buffer + position, data, nbytes);\n    position += nbytes;\n\n    if (position < size)\n        return nbytes;\n\n    return InvokeCallback(nbytes);\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\ninline size_t\nHeaderSink::OnData(const void *data0, size_t length)\n{\n    const unsigned char *data = (const unsigned char *)data0;\n    size_t consumed = 0, nbytes;\n\n    if (state == DATA)\n        return istream_invoke_data(&output, data, length);\n\n    if (state == SIZE) {\n        pending = 0; \/* just in case the callback is invoked *\/\n\n        consumed = ConsumeSize(data, length);\n        if (consumed == 0)\n            return 0;\n\n        if (consumed == length)\n            return length;\n\n        data += consumed;\n        length -= consumed;\n    }\n\n    if (state == HEADER) {\n        pending = consumed; \/* just in case the callback is invoked *\/\n\n        nbytes = ConsumeHeader(data, length);\n        if (nbytes == 0)\n            return 0;\n\n        consumed += nbytes;\n        if (consumed == length)\n            return length;\n\n        data += nbytes;\n        length -= nbytes;\n    }\n\n    assert(consumed > 0);\n\n    if (state == DATA && length > 0) {\n        const ScopePoolRef ref(*output.pool TRACE_ARGS);\n\n        nbytes = istream_invoke_data(&output, data, length);\n        if (nbytes == 0 && !input.IsDefined())\n            consumed = 0;\n        else\n            consumed += nbytes;\n    }\n\n    return consumed;\n}\n\ninline ssize_t\nHeaderSink::OnDirect(FdType type, int fd, size_t max_length)\n{\n    assert(state == DATA);\n\n    return istream_invoke_direct(&output, type, fd, max_length);\n}\n\ninline void\nHeaderSink::OnEof()\n{\n    GError *error;\n\n    switch (state) {\n    case SIZE:\n    case HEADER:\n        operation.Finished();\n\n        error = g_error_new_literal(sink_header_quark(), 0,\n                                    \"premature end of file\");\n        handler->error(error, handler_ctx);\n        istream_deinit(&output);\n        break;\n\n    case CALLBACK:\n        assert(false);\n        gcc_unreachable();\n\n    case DATA:\n        istream_deinit_eof(&output);\n        break;\n    }\n}\n\ninline void\nHeaderSink::OnError(GError *error)\n{\n    switch (state) {\n    case SIZE:\n    case HEADER:\n        operation.Finished();\n        handler->error(error, handler_ctx);\n        istream_deinit(&output);\n        break;\n\n    case CALLBACK:\n        assert(false);\n        gcc_unreachable();\n\n    case DATA:\n        istream_deinit_abort(&output, error);\n        break;\n    }\n}\n\n\/*\n * istream implementation\n *\n *\/\n\nstatic inline HeaderSink *\nistream_to_header(struct istream *istream)\n{\n    return &ContainerCast2(*istream, &HeaderSink::output);\n}\n\nstatic off_t\nsink_header_available(struct istream *istream, bool partial)\n{\n    HeaderSink *header = istream_to_header(istream);\n    off_t available = header->input.GetAvailable(partial);\n\n    if (available >= 0 && header->state == HeaderSink::CALLBACK) {\n        if (available < (off_t)header->pending) {\n            assert(partial);\n\n            return -1;\n        }\n\n        available -= header->pending;\n    }\n\n    return available;\n}\n\nstatic void\nsink_header_read(struct istream *istream)\n{\n    HeaderSink *header = istream_to_header(istream);\n\n    if (header->state == HeaderSink::CALLBACK)\n        \/* workaround: when invoking the callback from the data()\n           handler, it would be illegal to call header->input again *\/\n        return;\n\n    header->input.SetDirect(header->output.handler_direct);\n    header->input.Read();\n}\n\nstatic void\nsink_header_close(struct istream *istream)\n{\n    HeaderSink *header = istream_to_header(istream);\n\n    header->input.ClearAndClose();\n    istream_deinit(&header->output);\n}\n\nstatic const struct istream_class istream_sink = {\n    .available = sink_header_available,\n    .read = sink_header_read,\n    .close = sink_header_close,\n};\n\n\/*\n * constructor\n *\n *\/\n\nvoid\nsink_header_new(struct pool *pool, struct istream *input,\n                const struct sink_header_handler *handler, void *ctx,\n                struct async_operation_ref *async_ref)\n{\n    assert(input != NULL);\n    assert(!istream_has_handler(input));\n    assert(handler != NULL);\n    assert(handler->done != NULL);\n    assert(handler->error != NULL);\n\n    auto header = NewFromPool<HeaderSink>(*pool);\n    istream_init(&header->output, &istream_sink, pool);\n\n    header->input.Set(*input,\n                      MakeIstreamHandler<HeaderSink>::handler, header);\n\n    header->handler = handler;\n    header->handler_ctx = ctx;\n\n    header->operation.Init2<HeaderSink>();\n    async_ref->Set(header->operation);\n}\n<commit_msg>sink_header: use class ForwardIstream<commit_after>\/*\n * This istream filter reads a 32 bit header size from the stream,\n * reads it into a buffer and invokes a callback with the tail of the\n * stream.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"sink_header.hxx\"\n#include \"ForwardIstream.hxx\"\n#include \"async.hxx\"\n#include \"util\/Cast.hxx\"\n#include \"util\/ByteOrder.hxx\"\n\n#include <glib.h>\n\n#include <assert.h>\n#include <string.h>\n#include <stdint.h>\n\nclass HeaderSink final : public ForwardIstream {\n    enum {\n        SIZE, HEADER, CALLBACK, DATA\n    } state = SIZE;\n\n    unsigned char size_buffer[4];\n\n    unsigned char *buffer;\n    size_t size, position = 0;\n\n    \/**\n     * How much data of the input is pending to be consumed?  Only\n     * valid while state==CALLBACK.\n     *\/\n    size_t pending;\n\n    const struct sink_header_handler *handler;\n    void *handler_ctx;\n\n    struct async_operation operation;\n\npublic:\n    HeaderSink(struct pool &_pool, struct istream &_input,\n               const struct sink_header_handler &_handler, void *_ctx,\n               struct async_operation_ref &async_ref)\n        :ForwardIstream(_pool, _input,\n                        MakeIstreamHandler<HeaderSink>::handler, this),\n         handler(&_handler), handler_ctx(_ctx) {\n        operation.Init2<HeaderSink, &HeaderSink::operation>();\n        async_ref.Set(operation);\n    }\n\n    void Abort() {\n        input.Close();\n        Destroy();\n    }\n\n    size_t InvokeCallback(size_t consumed);\n\n    size_t ConsumeSize(const void *data, size_t length);\n    size_t ConsumeHeader(const void *data, size_t length);\n\n    \/* virtual methods from class Istream *\/\n\n    off_t GetAvailable(bool partial) override;\n\n    void Read() override {\n        if (state == HeaderSink::CALLBACK)\n            \/* workaround: when invoking the callback from the data()\n               handler, it would be illegal to call header->input again *\/\n            return;\n\n        ForwardIstream::Read();\n    }\n\n    \/* handler *\/\n\n    size_t OnData(const void *data, size_t length);\n    ssize_t OnDirect(FdType type, int fd, size_t max_length);\n    void OnEof();\n    void OnError(GError *error);\n};\n\nstatic GQuark\nsink_header_quark(void)\n{\n    return g_quark_from_static_string(\"sink_header\");\n}\n\nsize_t\nHeaderSink::InvokeCallback(size_t consumed)\n{\n    assert(state == SIZE || state == HEADER);\n\n    operation.Finished();\n\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n\n    \/* the base value has been set by sink_header_input_data() *\/\n    pending += consumed;\n\n    state = CALLBACK;\n    handler->done(buffer, size,\n                  Cast(),\n                  handler_ctx);\n\n    if (input.IsDefined()) {\n        state = DATA;\n        input.SetDirect(GetHandlerDirect());\n    } else\n        \/* we have been closed meanwhile; bail out *\/\n        consumed = 0;\n\n    return consumed;\n}\n\ninline size_t\nHeaderSink::ConsumeSize(const void *data, size_t length)\n{\n    assert(position < sizeof(size_buffer));\n\n    if (length > sizeof(size_buffer) - position)\n        length = sizeof(size_buffer) - position;\n\n    memcpy(size_buffer + position, data, length);\n    position += length;\n\n    if (position < sizeof(size_buffer))\n        return length;\n\n    const uint32_t *size_p = (const uint32_t *)(const void *)size_buffer;\n    size = FromBE32(*size_p);\n    if (size > 0x100000) {\n        \/* header too large *\/\n        operation.Finished();\n        input.Close();\n\n        GError *error =\n            g_error_new_literal(sink_header_quark(), 0,\n                                \"header is too large\");\n        handler->error(error, handler_ctx);\n        Destroy();\n        return 0;\n    }\n\n    if (size > 0) {\n        buffer = (unsigned char *)p_malloc(&GetPool(), size);\n        state = HeaderSink::HEADER;\n        position = 0;\n    } else {\n        \/* header empty: don't allocate, invoke callback now *\/\n\n        buffer = nullptr;\n\n        length = InvokeCallback(length);\n    }\n\n    return length;\n}\n\ninline size_t\nHeaderSink::ConsumeHeader(const void *data, size_t length)\n{\n    size_t nbytes = size - position;\n\n    assert(position < size);\n\n    if (nbytes > length)\n        nbytes = length;\n\n    memcpy(buffer + position, data, nbytes);\n    position += nbytes;\n\n    if (position < size)\n        return nbytes;\n\n    return InvokeCallback(nbytes);\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\ninline size_t\nHeaderSink::OnData(const void *data0, size_t length)\n{\n    const unsigned char *data = (const unsigned char *)data0;\n    size_t consumed = 0, nbytes;\n\n    if (state == DATA)\n        return InvokeData(data, length);\n\n    if (state == SIZE) {\n        pending = 0; \/* just in case the callback is invoked *\/\n\n        consumed = ConsumeSize(data, length);\n        if (consumed == 0)\n            return 0;\n\n        if (consumed == length)\n            return length;\n\n        data += consumed;\n        length -= consumed;\n    }\n\n    if (state == HEADER) {\n        pending = consumed; \/* just in case the callback is invoked *\/\n\n        nbytes = ConsumeHeader(data, length);\n        if (nbytes == 0)\n            return 0;\n\n        consumed += nbytes;\n        if (consumed == length)\n            return length;\n\n        data += nbytes;\n        length -= nbytes;\n    }\n\n    assert(consumed > 0);\n\n    if (state == DATA && length > 0) {\n        const ScopePoolRef ref(GetPool() TRACE_ARGS);\n\n        nbytes = InvokeData(data, length);\n        if (nbytes == 0 && !input.IsDefined())\n            consumed = 0;\n        else\n            consumed += nbytes;\n    }\n\n    return consumed;\n}\n\ninline ssize_t\nHeaderSink::OnDirect(FdType type, int fd, size_t max_length)\n{\n    assert(state == DATA);\n\n    return ForwardIstream::OnDirect(type, fd, max_length);\n}\n\ninline void\nHeaderSink::OnEof()\n{\n    GError *error;\n\n    switch (state) {\n    case SIZE:\n    case HEADER:\n        operation.Finished();\n\n        error = g_error_new_literal(sink_header_quark(), 0,\n                                    \"premature end of file\");\n        handler->error(error, handler_ctx);\n        Destroy();\n        break;\n\n    case CALLBACK:\n        assert(false);\n        gcc_unreachable();\n\n    case DATA:\n        DestroyEof();\n        break;\n    }\n}\n\ninline void\nHeaderSink::OnError(GError *error)\n{\n    switch (state) {\n    case SIZE:\n    case HEADER:\n        operation.Finished();\n        handler->error(error, handler_ctx);\n        Destroy();\n        break;\n\n    case CALLBACK:\n        assert(false);\n        gcc_unreachable();\n\n    case DATA:\n        DestroyError(error);\n        break;\n    }\n}\n\n\/*\n * istream implementation\n *\n *\/\n\noff_t\nHeaderSink::GetAvailable(bool partial)\n{\n    off_t available = ForwardIstream::GetAvailable(partial);\n\n    if (available >= 0 && state == HeaderSink::CALLBACK) {\n        if (available < (off_t)pending) {\n            assert(partial);\n\n            return -1;\n        }\n\n        available -= pending;\n    }\n\n    return available;\n}\n\n\/*\n * constructor\n *\n *\/\n\nvoid\nsink_header_new(struct pool *pool, struct istream *input,\n                const struct sink_header_handler *handler, void *ctx,\n                struct async_operation_ref *async_ref)\n{\n    assert(input != NULL);\n    assert(!istream_has_handler(input));\n    assert(handler != NULL);\n    assert(handler->done != NULL);\n    assert(handler->error != NULL);\n\n    NewIstream<HeaderSink>(*pool, *input, *handler, ctx, *async_ref);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"LanguageTranslator.h\"\n\n#include <sstream>\n\n#include \"Logger.h\"\n#include \"StringUtils.h\"\n\nstd::vector<std::wstring> LanguageTranslator::CurrentLocale() {\n    wchar_t buf[LOCALE_NAME_MAX_LENGTH];\n    GetUserDefaultLocaleName(buf, LOCALE_NAME_MAX_LENGTH);\n    CLOG(L\"Locale: %s\", buf);\n\n    std::wstring locale(buf);\n\n    \/* Remove custom supplemental locales *\/\n    int custom = locale.find(L\"-x-\");\n    if (custom > 0) {\n        locale.erase(custom, locale.size() - 1);\n    }\n\n    \/* Split up parts of the locale string *\/\n    std::vector<std::wstring> parts;\n    std::wstring sub;\n    std::wistringstream ss(locale);\n    while (std::getline(ss, sub, L'-')) {\n        parts.push_back(sub);\n    }\n\n    std::vector<std::wstring> finalLocale;\n    for (std::wstring sub : parts) {\n        \/* Remove sort orders *\/\n        int sort = sub.find(L\"_\");\n        if (sort > 0) {\n            sub.erase(sort, sub.size() - 1);\n        }\n\n        finalLocale.push_back(sub);\n    }\n\n    return finalLocale;\n}\n\nLanguageTranslator::LanguageTranslator() {\n\n}\n\nLanguageTranslator::LanguageTranslator(std::wstring langFileName) {\n    CLOG(L\"Loading language XML: %s\", langFileName.c_str());\n    std::string u8FileName = StringUtils::Narrow(langFileName);\n    tinyxml2::XMLError result = _xml.LoadFile(u8FileName.c_str());\n    if (result != tinyxml2::XMLError::XML_SUCCESS) {\n        if (result == tinyxml2::XMLError::XML_ERROR_FILE_NOT_FOUND) {\n            \/\/Error::ErrorMessageDie(SKINERR_INVALID_SKIN);\n        }\n        throw std::logic_error(\"Failed to read XML file!\");\n    }\n\n    _root = _xml.GetDocument()->FirstChildElement(\"translation\");\n    if (_root == NULL) {\n        throw std::runtime_error(\"Could not find root XML element\");\n    }\n\n    _author = StringUtils::Widen(_root->Attribute(\"author\", \"\"));\n    tinyxml2::XMLElement *trans = _root->FirstChildElement(\"language\");\n    if (trans == NULL) {\n        CLOG(L\"No <language> tag.\");\n    }\n\n    CLOG(L\"Loading translation header\");\n    _name = StringUtils::Widen(trans->Attribute(\"name\"));\n    _id = StringUtils::Widen(trans->Attribute(\"id\"));\n\n    if (_name == L\"\" || _id == L\"\") {\n        CLOG(L\"whoops\");\n    }\n\n    QCLOG(L\"Language name: %s\", _name.c_str());\n    QCLOG(L\"Locale identifier: %s\", _id.c_str());\n    const char *regions = trans->Attribute(\"regions\");\n    if (regions != NULL) {\n        std::string region;\n        std::istringstream ss(regions);\n        while (std::getline(ss, region, ',')) {\n            std::wstring regionStr = StringUtils::Widen(region);\n            _regions.push_back(regionStr);\n            QCLOG(L\"Region: %s\", regionStr.c_str());\n        }\n    }\n\n    tinyxml2::XMLElement *string = _root->FirstChildElement(\"string\");\n    for (; string != NULL; string = string->NextSiblingElement()) {\n        \/* parse translation *\/\n    }\n\n\n}\n\nstd::wstring LanguageTranslator::Translate(std::wstring str) {\n    return str;\n}<commit_msg>Fix the build<commit_after>#include \"LanguageTranslator.h\"\n\n#include <sstream>\n\n#include \"Logger.h\"\n#include \"StringUtils.h\"\n\nstd::vector<std::wstring> LanguageTranslator::CurrentLocale() {\n    wchar_t buf[LOCALE_NAME_MAX_LENGTH];\n    GetUserDefaultLocaleName(buf, LOCALE_NAME_MAX_LENGTH);\n    CLOG(L\"Locale: %s\", buf);\n\n    std::wstring locale(buf);\n\n    \/* Remove custom supplemental locales *\/\n    int custom = locale.find(L\"-x-\");\n    if (custom > 0) {\n        locale.erase(custom, locale.size() - 1);\n    }\n\n    \/* Split up parts of the locale string *\/\n    std::vector<std::wstring> parts;\n    std::wstring sub;\n    std::wistringstream ss(locale);\n    while (std::getline(ss, sub, L'-')) {\n        parts.push_back(sub);\n    }\n\n    std::vector<std::wstring> finalLocale;\n    for (std::wstring sub : parts) {\n        \/* Remove sort orders *\/\n        int sort = sub.find(L\"_\");\n        if (sort > 0) {\n            sub.erase(sort, sub.size() - 1);\n        }\n\n        finalLocale.push_back(sub);\n    }\n\n    return finalLocale;\n}\n\nLanguageTranslator::LanguageTranslator() {\n\n}\n\nLanguageTranslator::LanguageTranslator(std::wstring langFileName) {\n    CLOG(L\"Loading language XML: %s\", langFileName.c_str());\n    std::string u8FileName = StringUtils::Narrow(langFileName);\n    tinyxml2::XMLError result = _xml.LoadFile(u8FileName.c_str());\n    if (result != tinyxml2::XMLError::XML_SUCCESS) {\n        if (result == tinyxml2::XMLError::XML_ERROR_FILE_NOT_FOUND) {\n            \/\/Error::ErrorMessageDie(SKINERR_INVALID_SKIN);\n        }\n        throw std::logic_error(\"Failed to read XML file!\");\n    }\n\n    _root = _xml.GetDocument()->FirstChildElement(\"translation\");\n    if (_root == NULL) {\n        throw std::runtime_error(\"Could not find root XML element\");\n    }\n\n    _author = StringUtils::Widen(_root->Attribute(\"author\", \"\"));\n    tinyxml2::XMLElement *trans = _root->FirstChildElement(\"language\");\n    if (trans == NULL) {\n        CLOG(L\"No <language> tag.\");\n    }\n\n    CLOG(L\"Loading translation header\");\n    _name = StringUtils::Widen(trans->Attribute(\"name\"));\n    _id = StringUtils::Widen(trans->Attribute(\"id\"));\n\n    if (_name == L\"\" || _id == L\"\") {\n        CLOG(L\"whoops\");\n    }\n\n    QCLOG(L\"Language name: %s\", _name.c_str());\n    QCLOG(L\"Locale identifier: %s\", _id.c_str());\n    const char *regions = trans->Attribute(\"regions\");\n    if (regions != NULL) {\n        std::string region;\n        std::istringstream ss(regions);\n        while (std::getline(ss, region, ',')) {\n            std::wstring regionStr = StringUtils::Widen(region);\n            _regions.push_back(regionStr);\n            QCLOG(L\"Region: %s\", regionStr.c_str());\n        }\n    }\n\n    tinyxml2::XMLElement *string = _root->FirstChildElement(\"string\");\n    for (; string != NULL; string = string->NextSiblingElement()) {\n        string->FirstChildElement(\"resource\");\n        \/* parse translation *\/\n    }\n\n\n}\n\nstd::wstring LanguageTranslator::Translate(std::wstring str) {\n    return str;\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\n#include <cstring>\n#include <csignal>\n\n#include <unistd.h>\n\n#include \"gestionFichiersw.hpp\"\n#include \"pipe.hpp\"\n\nconstexpr size_t const TAILLEBUF = 255;\n\nint main() {\n\ttry {\n\t\tPipe myPipe(\/* nonBlocking = *\/ true);\n\t\tpid_t pid = fork();\n\n\t\tif(pid == -1) {\n\t\t\tstd::perror(\"fork() a échoué\");\n\t\t\texit(errno);\n\t\t} else if(pid == 0) {\n\t\t\tchar status[TAILLEBUF];\n\n\t\t\tsleep(10);\n\n\t\t\tmyPipe >> status;\n\n\t\t\tif(std::strcmp(status, \"Finished\\n\")) {\n\t\t\t\tstd::cout << \"Too late: safe closed.\" << std::endl;\n\t\t\t\tmyPipe << \"Too late\\n\";\n\t\t\t\treturn EPERM;\n\t\t\t}\n\n\t\t} else {\n\t\t\ttry {\n\t\t\t\tchar code[TAILLEBUF];\n\t\t\t\tstd::cout << \"You have 10 seconds to open the safe.\" << std::endl\n\t\t\t\t          << \"Please enter the code of the safe: \" << std::flush;\n\n\t\t\t\tIFile consoleIn(0, TAILLEBUF);\n\t\t\t\tconsoleIn >> code;\n\n\t\t\t\tchar status[TAILLEBUF];\n\t\t\t\tmyPipe >> status;\n\t\t\t\tmyPipe << \"Finished\\n\";\n\n\t\t\t\tbool invalidCode = std::strcmp(code, \"1234\\n\"),\n\t\t\t\t     notTooLate = std::strcmp(status, \"Too late\\n\");\n\t\t\t\tif(notTooLate) {\n\t\t\t\t\tif(invalidCode) {\n\t\t\t\t\t\tstd::cout << \"Code incorrect: safe closed\" << std::endl;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstd::cout << \"Code correct: safe opened.\" << std::endl;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t} catch(std::ios_base::failure const& e) {\n\t\t\t\tstd::cerr << \"Error: \" << e.what() << std::endl;\n\t\t\t\treturn e.code().value();\n\t\t\t}\n\t\t}\n\n\t} catch(std::system_error const& e) {\n\t\tstd::cerr << \"Error: \" << e.what() << std::endl;\n\t\treturn e.code().value();\n\t}\n}\n<commit_msg>Using signals instead of pipes for TD3-exIII<commit_after>#include <iostream>\n\n#include <cstring>\n#include <csignal>\n\n#include <unistd.h>\n\n#include \"gestionFichiersw.hpp\"\n#include \"pipe.hpp\"\n\nconstexpr size_t const TAILLEBUF = 255;\n\nint main() {\n\ttry {\n\t\tpid_t pid = fork();\n\n\t\tif(pid == -1) {\n\t\t\tstd::perror(\"fork() a échoué\");\n\t\t\texit(errno);\n\t\t} else if(pid == 0) {\n\t\t\tsleep(10);\n\t\t\tkill(getppid(), SIGUSR1);\n\t\t\treturn EPERM;\n\t\t} else {\n\t\t\ttry {\n\t\t\t\tchar code[TAILLEBUF];\n\t\t\t\tstd::cout << \"You have 10 seconds to open the safe.\" << std::endl\n\t\t\t\t          << \"Please enter the code of the safe: \" << std::flush;\n\n\t\t\t\t\/\/bool notTooLate = true;\n\n\t\t\t\t\/\/ Cannot pass a lambda with a capture to signal (cannot be converted to a function\n\t\t\t\t\/\/ pointer)\n\t\t\t\tsignal(SIGUSR1, [\/*&notTooLate*\/](int sig) {\n\t\t\t\t\tif(sig == SIGUSR1) {\n\t\t\t\t\t\tstd::cout << \"\\nToo late: safe closed\" << std::endl;\n\t\t\t\t\t\t\/\/ notTooLate = false;\n\t\t\t\t\t\twait();\n\t\t\t\t\t\texit(EPERM);\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\tIFile consoleIn(0, TAILLEBUF);\n\t\t\t\tconsoleIn >> code;\n\n\t\t\t\tbool invalidCode = std::strcmp(code, \"1234\\n\");\n\n\t\t\t\tif(invalidCode) {\n\t\t\t\t\tstd::cout << \"Code incorrect: safe closed\" << std::endl;\n\t\t\t\t} else {\n\t\t\t\t\tstd::cout << \"Code correct: safe opened.\" << std::endl;\n\t\t\t\t}\n\n\t\t\t\tsignal(SIGUSR1, SIG_IGN);\n\t\t\t\t\/\/ Stop the child\n\t\t\t\tkill(pid, SIGTERM);\n\n\t\t\t\treturn invalidCode ? EPERM : 0;\n\n\t\t\t} catch(std::ios_base::failure const& e) {\n\t\t\t\tstd::cerr << \"Error: \" << e.what() << std::endl;\n\t\t\t\treturn e.code().value();\n\t\t\t}\n\t\t}\n\n\t} catch(std::system_error const& e) {\n\t\tstd::cerr << \"Error: \" << e.what() << std::endl;\n\t\treturn e.code().value();\n\t}\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#include \"Riostream.h\"\n\n#include <TClonesArray.h>\n#include \"AliRun.h\"\n#include \"AliRunLoader.h\"\n#include \"AliACORDETrigger.h\"\n#include \"AliACORDEConstants.h\"\n\n\/\/______________________________________________________________________\nClassImp(AliACORDETrigger)\n\nAliACORDETrigger::AliACORDETrigger()\n  :AliTriggerDetector(),\n   fSingleMuon(0),\n   fMultiMuon(0)\n{\n\n  cout << \" ================>>>>>>>>>>>>>>>>> AliACORDETrigger\" << endl;\n   SetName(\"ACORDE\");\n   CreateInputs();\n   for (Int_t i=0; i<60; i++) fModuleFired[i]=kFALSE;\n}\n\nvoid AliACORDETrigger::CreateInputs()\n{\n  \/\/ Do not create inputs again!!\n  if( fInputs.GetEntriesFast() > 0 ) return;\n\n  \/\/ two acorde triggers, single muon and multicoincidence\n  fInputs.AddLast( new \n\t\t   AliTriggerInput( \"ACORDE_SINGLE\", \n\t\t\t\t    \"ACORDE\", 0 ) );\n  fInputs.AddLast( new \n\t\t   AliTriggerInput( \"ACORDE_MULTI\",\n\t\t\t\t    \"ACORDE\", 0 ) );\n}\n\nvoid AliACORDETrigger::Trigger()\n{\n  \n  \/\/ 1.- Get loaders and pointers\n  \/\/ 2.- Loop over all entries\n  \/\/     set temporal variables to default values\n  \/\/     start the loop\n  \/\/ 3.- Loop over all digits in an entrie\n  \/\/     Fill temporal arrays\n  \/\/     Find module with lowest time\n  \/\/ 4.- Loop over temporal arrays\n  \/\/     Find number of modules within the time window\n  \/\/ 5.- Set the relevant trigger\n\n  \/\/ 1.- Get loaders and pointers\n  AliRunLoader* runLoader = AliRunLoader::Instance();\n  AliACORDELoader* loader = \n    (AliACORDELoader* )runLoader->GetLoader( \"ACORDELoader\" );\n  loader->LoadDigits(\"READ\");\n  TTree* acordeDigitsTree = loader->TreeD();\n  if (!acordeDigitsTree) return;\n  TClonesArray* acordeDigits = new TClonesArray(\"AliACORDEdigit\",1000);\n  TBranch* digitBranch = acordeDigitsTree->GetBranch(\"ACORDEdigit\");\n  digitBranch->SetAddress(&acordeDigits);\n\n  \/\/ 2.- Loop over all entries\n  \/\/     set temporal variables to default values\n\n  Int_t MultiMin = AliACORDEConstants::Instance()->MultiMuonThreshold();\n  Float_t time_window = AliACORDEConstants::Instance()->MultiMuonWindow();\n  Int_t MinTimeModule = -1;\n  Float_t MinTime = 1e10;\n  Float_t ModuleTimes[60];\n  for (Int_t i=0; i<60; i++) ModuleTimes[i] = -1.0;\n\n  \/\/     start the loop\n  Int_t nEntries = (Int_t)acordeDigitsTree->GetEntries();\n  cout << \" ===AliACORDETrigger=== nEntries  \" <<nEntries << endl; \n  for (Int_t e=0; e<nEntries; e++) {\n    acordeDigitsTree->GetEvent(e);\n    \/\/ 3.- Loop over all digits in an entrie\n    \/\/     Fill temporal arrays\n    \/\/     Find module with lowest time\n    Int_t nDigits = acordeDigits->GetEntriesFast();\n    cout << \" ===AliACORDETrigger=== nDigits  \" <<nDigits << endl; \n    for (Int_t d=0; d<nDigits; d++) {\n      AliACORDEdigit* digit = (AliACORDEdigit*)acordeDigits->At(d);\n      Int_t module = digit->GetModule();\n      Float_t mod_time = digit->GetTime();\n      ModuleTimes[module-1]=mod_time;\n      if (mod_time < MinTime) {\n\tMinTime = mod_time;\n\tMinTimeModule = module;\n      }\n    } \/\/ end of loop over digits\n  } \/\/ end of loop over events in digits tree\n\n  \/\/ 4.- Loop over temporal arrays\n  \/\/     Find number of modules within the time window\n  if (MinTimeModule == -1) return;\n  for (Int_t i=0; i<60; i++) {\n    if (ModuleTimes[i]<0) continue;\n    Float_t diff = ModuleTimes[i]-MinTime;\n    if (diff<time_window) {\n      fMultiMuon++;\n      fModuleFired[i]=kTRUE;\n    }\n  }\n  cout << \" fSingleMuon \" << fSingleMuon\n       << \" MinTime \" << MinTime\n       << \" fMultiMuon \" << fMultiMuon << endl;\n  \/\/ 5.- Set the relevant trigger\n  fSingleMuon = MinTimeModule;\n  SetInput( \"ACORDE_SINGLE\" );\n  if (fMultiMuon>=MultiMin) SetInput( \"ACORDE_MULTI\" );\n  return;\n}\n<commit_msg>ACORDE trigger inputs following trigger naming conventions<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#include \"Riostream.h\"\n\n#include <TClonesArray.h>\n#include \"AliRun.h\"\n#include \"AliRunLoader.h\"\n#include \"AliACORDETrigger.h\"\n#include \"AliACORDEConstants.h\"\n\n\/\/______________________________________________________________________\nClassImp(AliACORDETrigger)\n\nAliACORDETrigger::AliACORDETrigger()\n  :AliTriggerDetector(),\n   fSingleMuon(0),\n   fMultiMuon(0)\n{\n\n  cout << \" ================>>>>>>>>>>>>>>>>> AliACORDETrigger\" << endl;\n   SetName(\"ACORDE\");\n   CreateInputs();\n   for (Int_t i=0; i<60; i++) fModuleFired[i]=kFALSE;\n}\n\nvoid AliACORDETrigger::CreateInputs()\n{\n  \/\/ Do not create inputs again!!\n  if( fInputs.GetEntriesFast() > 0 ) return;\n\n  \/\/ two acorde triggers, single muon and multicoincidence\n  fInputs.AddLast( new \n\t\t   AliTriggerInput( \"0ASL\", \n\t\t\t\t    \"ACORDE\", 0 ) );\n  fInputs.AddLast( new \n\t\t   AliTriggerInput( \"0AMU\",\n\t\t\t\t    \"ACORDE\", 0 ) );\n}\n\nvoid AliACORDETrigger::Trigger()\n{\n  \n  \/\/ 1.- Get loaders and pointers\n  \/\/ 2.- Loop over all entries\n  \/\/     set temporal variables to default values\n  \/\/     start the loop\n  \/\/ 3.- Loop over all digits in an entrie\n  \/\/     Fill temporal arrays\n  \/\/     Find module with lowest time\n  \/\/ 4.- Loop over temporal arrays\n  \/\/     Find number of modules within the time window\n  \/\/ 5.- Set the relevant trigger\n\n  \/\/ 1.- Get loaders and pointers\n  AliRunLoader* runLoader = AliRunLoader::Instance();\n  AliACORDELoader* loader = \n    (AliACORDELoader* )runLoader->GetLoader( \"ACORDELoader\" );\n  loader->LoadDigits(\"READ\");\n  TTree* acordeDigitsTree = loader->TreeD();\n  if (!acordeDigitsTree) return;\n  TClonesArray* acordeDigits = new TClonesArray(\"AliACORDEdigit\",1000);\n  TBranch* digitBranch = acordeDigitsTree->GetBranch(\"ACORDEdigit\");\n  digitBranch->SetAddress(&acordeDigits);\n\n  \/\/ 2.- Loop over all entries\n  \/\/     set temporal variables to default values\n\n  Int_t MultiMin = AliACORDEConstants::Instance()->MultiMuonThreshold();\n  Float_t time_window = AliACORDEConstants::Instance()->MultiMuonWindow();\n  Int_t MinTimeModule = -1;\n  Float_t MinTime = 1e10;\n  Float_t ModuleTimes[60];\n  for (Int_t i=0; i<60; i++) ModuleTimes[i] = -1.0;\n\n  \/\/     start the loop\n  Int_t nEntries = (Int_t)acordeDigitsTree->GetEntries();\n  cout << \" ===AliACORDETrigger=== nEntries  \" <<nEntries << endl; \n  for (Int_t e=0; e<nEntries; e++) {\n    acordeDigitsTree->GetEvent(e);\n    \/\/ 3.- Loop over all digits in an entrie\n    \/\/     Fill temporal arrays\n    \/\/     Find module with lowest time\n    Int_t nDigits = acordeDigits->GetEntriesFast();\n    cout << \" ===AliACORDETrigger=== nDigits  \" <<nDigits << endl; \n    for (Int_t d=0; d<nDigits; d++) {\n      AliACORDEdigit* digit = (AliACORDEdigit*)acordeDigits->At(d);\n      Int_t module = digit->GetModule();\n      Float_t mod_time = digit->GetTime();\n      ModuleTimes[module-1]=mod_time;\n      if (mod_time < MinTime) {\n\tMinTime = mod_time;\n\tMinTimeModule = module;\n      }\n    } \/\/ end of loop over digits\n  } \/\/ end of loop over events in digits tree\n\n  \/\/ 4.- Loop over temporal arrays\n  \/\/     Find number of modules within the time window\n  if (MinTimeModule == -1) return;\n  for (Int_t i=0; i<60; i++) {\n    if (ModuleTimes[i]<0) continue;\n    Float_t diff = ModuleTimes[i]-MinTime;\n    if (diff<time_window) {\n      fMultiMuon++;\n      fModuleFired[i]=kTRUE;\n    }\n  }\n  cout << \" fSingleMuon \" << fSingleMuon\n       << \" MinTime \" << MinTime\n       << \" fMultiMuon \" << fMultiMuon << endl;\n  \/\/ 5.- Set the relevant trigger\n  fSingleMuon = MinTimeModule;\n  SetInput( \"0ASL\" );\n  if (fMultiMuon>=MultiMin) SetInput( \"0AMU\" );\n  return;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <pqxx\/transaction>\n\n#include \"..\/test_helpers.hxx\"\n\nnamespace\n{\n\/\/\/ Test conversions for some floating-point type.\ntemplate<typename T> void infinity_test()\n{\n  T inf{std::numeric_limits<T>::infinity()};\n  std::string inf_string;\n  T back_conversion;\n\n  inf_string = pqxx::to_string(inf);\n  pqxx::from_string(inf_string, back_conversion);\n  PQXX_CHECK_LESS(\n    T(999999999), back_conversion,\n    \"Infinity doesn't convert back to something huge.\");\n\n  inf_string = pqxx::to_string(-inf);\n  pqxx::from_string(inf_string, back_conversion);\n  PQXX_CHECK_LESS(\n    back_conversion, -T(999999999), \"Negative infinity is broken\");\n}\n\nvoid test_infinities()\n{\n  infinity_test<float>();\n  infinity_test<double>();\n  infinity_test<long double>();\n}\n\n\n\/\/\/ Reproduce bug #262: repeated float conversions break without charconv.\ntemplate<typename T> void bug_262()\n{\n  pqxx::connection conn;\n  conn.prepare(\"stmt\", \"select cast($1 as float)\");\n  pqxx::work tr{conn};\n\n  \/\/ We must use the same float type both for passing the value to the\n  \/\/ statement and for retrieving result of the statement execution.  This is\n  \/\/ due to an internal stringstream being instantiated as a a parameterized\n  \/\/ thread-local singleton.  So, there are separate stream<float>,\n  \/\/ stream<double>, stream<long double>, but every such instance is a\n  \/\/ singleton. We should use only one of them for this test.\n\n  pqxx::row row;\n\n  \/\/ Nothing bad here, select a float value.\n  \/\/ The stream is clear, so just fill it with the value and extract str().\n  row = tr.exec1(\"SELECT 1.0\");\n\n  \/\/ This works properly, but as we parse the value from the stream, the\n  \/\/ seeking cursor moves towards the EOF. When the inevitable EOF happens\n  \/\/ 'eof' flag is set in the stream and 'good' flag is unset.\n  row[0].as<T>();\n\n  \/\/ The second try. Select a float value again. The stream is not clean, so\n  \/\/ we need to put an empty string into its buffer {stream.str(\"\");}. This\n  \/\/ resets the seeking cursor to 0. Then we will put the value using\n  \/\/ operator<<().\n  \/\/ ...\n  \/\/ ...\n  \/\/ OOPS. stream.str(\"\") does not reset 'eof' flag and 'good' flag! We are\n  \/\/ trying to read from EOF! This is no good.\n  \/\/ Throws on unpatched pqxx v6.4.5\n  row = tr.exec1(\"SELECT 2.0\");\n\n  \/\/ We won't get here without patch. The following statements are just for\n  \/\/ demonstration of how are intended to work. If we\n  \/\/ simply just reset the stream flags properly, this would work fine.\n  \/\/ The most obvious patch is just explicitly stream.seekg(0).\n  row[0].as<T>();\n  row = tr.exec1(\"SELECT 3.0\");\n  row[0].as<T>();\n}\n\n\n\/\/\/ Test for bug #262.\nvoid test_bug_262()\n{\n  bug_262<float>();\n  bug_262<double>();\n  bug_262<long double>();\n}\n\n\n\/\/\/ Test conversion of malformed floating-point values.\nvoid test_bad_float()\n{\n  float x [[maybe_unused]];\n  PQXX_CHECK_THROWS(\n    x = pqxx::from_string<float>(\"\"), pqxx::conversion_error,\n    \"Conversion of empty string to float was not caught.\");\n\n  PQXX_CHECK_THROWS(\n    x = pqxx::from_string<float>(\"Infancy\"), pqxx::conversion_error,\n    \"Misleading infinity was not caught.\");\n  PQXX_CHECK_THROWS(\n    x = pqxx::from_string<float>(\"-Infighting\"), pqxx::conversion_error,\n    \"Misleading negative infinity was not caught.\");\n\n  PQXX_CHECK_THROWS(\n    x = pqxx::from_string<float>(\"Nanny\"), pqxx::conversion_error,\n    \"Conversion of misleading NaN was not caught.\");\n}\n\n\n\/\/\/ Test conversion of long float values to strings.\nvoid test_long_float()\n{\n  auto const dot_one{pqxx::to_string(0.1)};\n  auto const detailed_double{-1.3339772437713657e-322};\n  auto const detailed{pqxx::to_string(detailed_double)};\n  PQXX_CHECK_LESS_EQUAL(\n    dot_one.size(), 25u, \"0.1 converted to too long a string.\");\n  PQXX_CHECK_LESS_EQUAL(\n    pqxx::to_string(detailed).size(), 25u,\n    \"Detailed double converted to too long a string.\");\n  PQXX_CHECK_GREATER_EQUAL(\n    pqxx::string_traits<double>::size_buffer(0.1), dot_one.size() + 1,\n    \"Not enough buffer space for 0.1.\");\n  PQXX_CHECK_GREATER_EQUAL(\n    pqxx::string_traits<double>::size_buffer(detailed_double), 25u,\n    \"Not enough buffer space for -1.3339772437713657e-322.\");\n}\n\n\nPQXX_REGISTER_TEST(test_infinities);\nPQXX_REGISTER_TEST(test_bug_262);\nPQXX_REGISTER_TEST(test_bad_float);\nPQXX_REGISTER_TEST(test_long_float);\n} \/\/ namespace\n<commit_msg>Smoke testing for #328.<commit_after>#include <cmath>\n\n#include <pqxx\/transaction>\n\n#include \"..\/test_helpers.hxx\"\n\nnamespace\n{\n\/\/\/ Test conversions for some floating-point type.\ntemplate<typename T> void infinity_test()\n{\n  T inf{std::numeric_limits<T>::infinity()};\n  std::string inf_string;\n  T back_conversion;\n\n  inf_string = pqxx::to_string(inf);\n  pqxx::from_string(inf_string, back_conversion);\n  PQXX_CHECK_LESS(\n    T(999999999), back_conversion,\n    \"Infinity doesn't convert back to something huge.\");\n\n  inf_string = pqxx::to_string(-inf);\n  pqxx::from_string(inf_string, back_conversion);\n  PQXX_CHECK_LESS(\n    back_conversion, -T(999999999), \"Negative infinity is broken\");\n}\n\nvoid test_infinities()\n{\n  infinity_test<float>();\n  infinity_test<double>();\n  infinity_test<long double>();\n}\n\n\n\/\/\/ Reproduce bug #262: repeated float conversions break without charconv.\ntemplate<typename T> void bug_262()\n{\n  pqxx::connection conn;\n  conn.prepare(\"stmt\", \"select cast($1 as float)\");\n  pqxx::work tr{conn};\n\n  \/\/ We must use the same float type both for passing the value to the\n  \/\/ statement and for retrieving result of the statement execution.  This is\n  \/\/ due to an internal stringstream being instantiated as a a parameterized\n  \/\/ thread-local singleton.  So, there are separate stream<float>,\n  \/\/ stream<double>, stream<long double>, but every such instance is a\n  \/\/ singleton. We should use only one of them for this test.\n\n  pqxx::row row;\n\n  \/\/ Nothing bad here, select a float value.\n  \/\/ The stream is clear, so just fill it with the value and extract str().\n  row = tr.exec1(\"SELECT 1.0\");\n\n  \/\/ This works properly, but as we parse the value from the stream, the\n  \/\/ seeking cursor moves towards the EOF. When the inevitable EOF happens\n  \/\/ 'eof' flag is set in the stream and 'good' flag is unset.\n  row[0].as<T>();\n\n  \/\/ The second try. Select a float value again. The stream is not clean, so\n  \/\/ we need to put an empty string into its buffer {stream.str(\"\");}. This\n  \/\/ resets the seeking cursor to 0. Then we will put the value using\n  \/\/ operator<<().\n  \/\/ ...\n  \/\/ ...\n  \/\/ OOPS. stream.str(\"\") does not reset 'eof' flag and 'good' flag! We are\n  \/\/ trying to read from EOF! This is no good.\n  \/\/ Throws on unpatched pqxx v6.4.5\n  row = tr.exec1(\"SELECT 2.0\");\n\n  \/\/ We won't get here without patch. The following statements are just for\n  \/\/ demonstration of how are intended to work. If we\n  \/\/ simply just reset the stream flags properly, this would work fine.\n  \/\/ The most obvious patch is just explicitly stream.seekg(0).\n  row[0].as<T>();\n  row = tr.exec1(\"SELECT 3.0\");\n  row[0].as<T>();\n}\n\n\n\/\/\/ Test for bug #262.\nvoid test_bug_262()\n{\n  bug_262<float>();\n  bug_262<double>();\n  bug_262<long double>();\n}\n\n\n\/\/\/ Test conversion of malformed floating-point values.\nvoid test_bad_float()\n{\n  float x [[maybe_unused]];\n  PQXX_CHECK_THROWS(\n    x = pqxx::from_string<float>(\"\"), pqxx::conversion_error,\n    \"Conversion of empty string to float was not caught.\");\n\n  PQXX_CHECK_THROWS(\n    x = pqxx::from_string<float>(\"Infancy\"), pqxx::conversion_error,\n    \"Misleading infinity was not caught.\");\n  PQXX_CHECK_THROWS(\n    x = pqxx::from_string<float>(\"-Infighting\"), pqxx::conversion_error,\n    \"Misleading negative infinity was not caught.\");\n\n  PQXX_CHECK_THROWS(\n    x = pqxx::from_string<float>(\"Nanny\"), pqxx::conversion_error,\n    \"Conversion of misleading NaN was not caught.\");\n}\n\n\ntemplate<typename T> void test_float_length(T value)\n{\n  auto const text{pqxx::to_string(value)};\n  PQXX_CHECK_GREATER_EQUAL(\n    pqxx::string_traits<T>::size_buffer(value), text.size() + 1,\n    \"Not enough buffer space for \" + text + \".\");\n}\n\n\n\/\/\/ Test conversion of long float values to strings.\nvoid test_long_float()\n{\n  test_float_length(0.1f);\n  test_float_length(0.1);\n\n  test_float_length(std::numeric_limits<float>::denorm_min());\n  test_float_length(-std::numeric_limits<float>::denorm_min());\n  test_float_length(std::numeric_limits<float>::max());\n  test_float_length(-std::numeric_limits<double>::max());\n  test_float_length(-std::nextafter(1.0f, 2.0f));\n\n  test_float_length(std::numeric_limits<double>::denorm_min());\n  test_float_length(-std::numeric_limits<double>::denorm_min());\n  test_float_length(std::numeric_limits<double>::max());\n  test_float_length(-std::numeric_limits<double>::max());\n  test_float_length(-std::nextafter(1.0, 2.0));\n\n  test_float_length(std::numeric_limits<long double>::denorm_min());\n  test_float_length(-std::numeric_limits<long double>::denorm_min());\n  test_float_length(std::numeric_limits<long double>::max());\n  test_float_length(-std::numeric_limits<long double>::max());\n  test_float_length(-std::nextafter(1.0L, 2.0L));\n\n  auto constexpr awkward{-2.2250738585072014e-308};\n  test_float_length(-1.3339772437713657e-322);\n  test_float_length(awkward);\n  test_float_length(-1.7976931348623157e+308);\n\n  test_float_length(-1.3339772437713657e-322L);\n  test_float_length(static_cast<long double>(awkward));\n  test_float_length(-1.7976931348623157e+308L);\n\n  \/\/ Ahem.  I'm not proud of this.  We really can't assume much about the\n  \/\/ floating-point types, but I'd really like to try a few things to see that\n  \/\/ buffer sizes are in the right ballpark.  So, if \"double\" is at least 64\n  \/\/ bits, check for some examples of long conversions.\n  if constexpr (sizeof(double) >= 8)\n  {\n    auto const text{pqxx::to_string(awkward)};\n    PQXX_CHECK_LESS_EQUAL(\n      text.size(), 25u, text + \" converted to too long a string.\");\n  }\n  if constexpr (sizeof(double) <= 8)\n  {\n    auto const text{pqxx::to_string(awkward)};\n    PQXX_CHECK_LESS_EQUAL(\n      pqxx::string_traits<double>::size_buffer(awkward), 25u,\n      text + \" converted to too long a string.\");\n  }\n}\n\n\nPQXX_REGISTER_TEST(test_infinities);\nPQXX_REGISTER_TEST(test_bug_262);\nPQXX_REGISTER_TEST(test_bad_float);\nPQXX_REGISTER_TEST(test_long_float);\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>#include \"SkillSystem.h\"\n#include \"BulletSystem.h\"\n#include \"interface.h\"\n#include \"GameProcess.h\"\n#include \"ObjectParticles.h\"\n\nCSkillSystem::CSkillSystem(CGameProcess*\tpGameProcess)\n{\n\tCBulletSystem::GetInstance()->SetCallback(MakeInterface(this, &CSkillSystem::OnSkillCallback));\n\tm_pGameProcess = pGameProcess;\n\tAddListen(BR_PARTICLE_HIT, MakeMessageFunc(this, &CSkillSystem::OnParticleHit));\n}\n\nCSkillSystem::~CSkillSystem(void)\n{\n\tCBulletSystem::ReleaseInstance();\n}\n\nint CSkillSystem::OnSkillCallback(void* pVoid)\n{\n\t_BulletCallback* pBase = (_BulletCallback*)pVoid;\n\n}<commit_msg>Signed-off-by: mrlitong <litongtongxue@gmail.com><commit_after>#include \"SkillSystem.h\"\n#include \"BulletSystem.h\"\n#include \"interface.h\"\n#include \"GameProcess.h\"\n#include \"ObjectParticles.h\"\n\nCSkillSystem::CSkillSystem(CGameProcess*\tpGameProcess)\n{\n\tCBulletSystem::GetInstance()->SetCallback(MakeInterface(this, &CSkillSystem::OnSkillCallback));\n\tm_pGameProcess = pGameProcess;\n\tAddListen(BR_PARTICLE_HIT, MakeMessageFunc(this, &CSkillSystem::OnParticleHit));\n}\n\nCSkillSystem::~CSkillSystem(void)\n{\n\tCBulletSystem::ReleaseInstance();\n}\n\nint CSkillSystem::OnSkillCallback(void* pVoid)\n{\n\t_BulletCallback* pBase = (_BulletCallback*)pVoid;\n\tswitch (pBase->nMsgID)\n\t{\n\tcase _BulletCallback::GetTargetPosition:\n\t{\n\t\t_Bullet_GetTargetPosition* pBullet = (_Bullet_GetTargetPosition*)pBase;\n\t\tCRoleBase* pRole = m_pGameProcess->GetRole(pBullet->nTarget);\/\/test\n\t\tif (pRole)\n\t\t{\n\t\t\tpBullet->nRetState = 1;\n\t\t\tpBullet->vRetPos = pRole->GetPosition() + vec3(0.0f, 0.0f, 1.2f);\n\t\t\tpBullet->vRetDir = pRole->GetDirection();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpBullet->nRetState = 0;\n\t\t}\n\t}break;\n\tcase _BulletCallback::HitTarget:\n\t{\n\t\t_Bullet_HitTarget* pBullet = (_Bullet_HitTarget*)pBase;\n\n\t}break;\n\tcase _BulletCallback::GetCollision:\n\t{\n\t\t_Bullet_GetCollision* pBullet = (_Bullet_GetCollision*)pBase;\n\t\t\/\/test\n\t\tfor (int i = 0; i < 20; i++)\n\t\t{\n\t\t\tCRoleBase* pRole = m_pGameProcess->GetRoleFormIndex(i);\n\t\t\tif (pRole)\n\t\t\t{\n\t\t\t\tif ((pRole->GetPosition() - pBullet->vPos).length() < pBullet->fRadius + pRole->GetRoleRadius())\n\t\t\t\t{\n\t\t\t\t\tpBullet->nRetTarget = pRole->GetRoleID();\n\t\t\t\t\tpBullet->vRetHitPoint = pRole->GetPosition() + vec3(0.0f, 0.0f, 1.2f);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}break;\n\tcase _BulletCallback::Blast:\n\t{\n\t\t_Bullet_Blast* pBullet = (_Bullet_Blast*)pBase;\n\n\t}break;\n\t}\n\n\treturn 1;\n}<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file\n * \\brief SignalInformationQueueWrapper 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-10-24\n *\/\n\n#ifndef INCLUDE_DISTORTOS_SIGNALINFORMATIONQUEUEWRAPPER_HPP_\n#define INCLUDE_DISTORTOS_SIGNALINFORMATIONQUEUEWRAPPER_HPP_\n\n#include \"distortos\/memory\/dummyDeleter.hpp\"\n\n#include \"distortos\/synchronization\/SignalInformationQueue.hpp\"\n\n#include <array>\n\nnamespace distortos\n{\n\nnamespace synchronization\n{\n\nclass SignalsReceiverControlBlock;\n\n}\t\/\/ namespace synchronization\n\n\/\/\/ SignalInformationQueueWrapper class is a container for synchronization::SignalInformationQueue\nclass SignalInformationQueueWrapper\n{\n\tfriend class synchronization::SignalsReceiverControlBlock;\n\npublic:\n\n\t\/\/\/ import Storage type alias from synchronization::SignalInformationQueue\n\tusing Storage = synchronization::SignalInformationQueue::Storage;\n\n\t\/**\n\t * \\brief SignalInformationQueueWrapper's constructor\n\t *\n\t * \\param [in] storage is an array of Storage elements\n\t * \\param [in] maxElements is the number of elements in \\a storage array\n\t *\/\n\n\tSignalInformationQueueWrapper(Storage* storage, size_t maxElements) :\n\t\t\tsignalInformationQueue_{{storage, memory::dummyDeleter}, maxElements}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief SignalInformationQueueWrapper's constructor\n\t *\n\t * \\param N is the number of elements in \\a storage array\n\t *\n\t * \\param [in] storage is a reference to array of Storage elements\n\t *\/\n\n\ttemplate<size_t N>\n\texplicit SignalInformationQueueWrapper(Storage (& storage)[N]) :\n\t\t\tSignalInformationQueueWrapper{storage, sizeof(storage) \/ sizeof(*storage)}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief SignalInformationQueueWrapper's constructor\n\t *\n\t * \\param N is the number of elements in \\a storage array\n\t *\n\t * \\param [in] storage is a reference to std::array of Storage elements\n\t *\/\n\n\ttemplate<size_t N>\n\texplicit SignalInformationQueueWrapper(std::array<Storage, N>& storage) :\n\t\t\tSignalInformationQueueWrapper{storage.data(), storage.size()}\n\t{\n\n\t}\n\nprivate:\n\n\t\/\/\/ contained synchronization::SignalInformationQueue object\n\tsynchronization::SignalInformationQueue signalInformationQueue_;\n};\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_SIGNALINFORMATIONQUEUEWRAPPER_HPP_\n<commit_msg>SignalInformationQueueWrapper: remove helper constructors<commit_after>\/**\n * \\file\n * \\brief SignalInformationQueueWrapper 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-10-24\n *\/\n\n#ifndef INCLUDE_DISTORTOS_SIGNALINFORMATIONQUEUEWRAPPER_HPP_\n#define INCLUDE_DISTORTOS_SIGNALINFORMATIONQUEUEWRAPPER_HPP_\n\n#include \"distortos\/memory\/dummyDeleter.hpp\"\n\n#include \"distortos\/synchronization\/SignalInformationQueue.hpp\"\n\nnamespace distortos\n{\n\nnamespace synchronization\n{\n\nclass SignalsReceiverControlBlock;\n\n}\t\/\/ namespace synchronization\n\n\/\/\/ SignalInformationQueueWrapper class is a container for synchronization::SignalInformationQueue\nclass SignalInformationQueueWrapper\n{\n\tfriend class synchronization::SignalsReceiverControlBlock;\n\npublic:\n\n\t\/\/\/ import Storage type alias from synchronization::SignalInformationQueue\n\tusing Storage = synchronization::SignalInformationQueue::Storage;\n\n\t\/**\n\t * \\brief SignalInformationQueueWrapper's constructor\n\t *\n\t * \\param [in] storage is an array of Storage elements\n\t * \\param [in] maxElements is the number of elements in \\a storage array\n\t *\/\n\n\tSignalInformationQueueWrapper(Storage* storage, size_t maxElements) :\n\t\t\tsignalInformationQueue_{{storage, memory::dummyDeleter}, maxElements}\n\t{\n\n\t}\n\nprivate:\n\n\t\/\/\/ contained synchronization::SignalInformationQueue object\n\tsynchronization::SignalInformationQueue signalInformationQueue_;\n};\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_SIGNALINFORMATIONQUEUEWRAPPER_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/**\n\\file\n\\brief Main header file for dsb::comm.\n*\/\n#ifndef DSB_COMM_HPP\n#define DSB_COMM_HPP\n\n#include <deque>\n#include <string>\n#include \"zmq.hpp\"\n\n\nnamespace dsb\n{\n\n\/\/\/ Helper functions for communication over ZMQ sockets.\nnamespace comm\n{\n\n\n\/**\n\\brief Sends a message.\n\nThe message content will be cleared on return.\n\n\\throws std::invalid_argument if `message` is empty.\n*\/\nvoid Send(zmq::socket_t& socket, std::deque<zmq::message_t>& message);\n\n\n\/**\n\\brief  Sends an addressed message.\n\nThis function sends a multipart message consisting of the frames in `envelope`\nfollowed by an empty delimiter frame and the frames in `body`.\n\nBoth `envelope` and `body` will be cleared on return.\n\n\\throws std::invalid_argument if either of `envelope` or `body` are empty.\n*\/\nvoid AddressedSend(\n    zmq::socket_t& socket,\n    std::deque<zmq::message_t>& envelope,\n    std::deque<zmq::message_t>& body);\n\n\n\/**\n\\brief Receives a message.\n\nExisting message content will be overwritten.\n*\/\nvoid Receive(\n    zmq::socket_t& socket,\n    std::deque<zmq::message_t>& message);\n\n\n\/**\n\\brief  Removes or moves the envelope from a message.\n\nThe envelope of a message are the message frames starting at the beginning\nof the message and ending at the first empty frame, called a \"delimiter\".\n\nIf `message` is empty, or has no envelope (i.e., no delimiter), this\nfunction returns without doing anything.  Otherwise, if `envelope` is not\nnull, all message frames up to, but not including, the delimiter are moved\nto `envelope`. Any existing contents of `envelope` will be overwritten.\nFinally, all frames up to and including the delimiter are removed from\n`message`.\n\n\\returns The number of frames removed from `message`, including the delimiter.\n*\/\nsize_t PopMessageEnvelope(\n    std::deque<zmq::message_t>& message,\n    std::deque<zmq::message_t>* envelope = nullptr);\n\n\nvoid CopyMessage(\n    std::deque<zmq::message_t>& source,\n    std::deque<zmq::message_t>& target);\n\n\n\/\/\/ Returns the content of a message frame as a `std::string`.\nstd::string ToString(const zmq::message_t& frame);\n\n\n}}      \/\/ namespace\n#endif  \/\/ header guard\n<commit_msg>Documented some exceptions thrown in dsb::comm<commit_after>\/**\n\\file\n\\brief Main header file for dsb::comm.\n*\/\n#ifndef DSB_COMM_HPP\n#define DSB_COMM_HPP\n\n#include <deque>\n#include <string>\n#include \"zmq.hpp\"\n\n\nnamespace dsb\n{\n\n\/\/\/ Helper functions for communication over ZMQ sockets.\nnamespace comm\n{\n\n\n\/**\n\\brief Sends a message.\n\nThe message content will be cleared on return.\n\n\\throws std::invalid_argument if `message` is empty.\n\\throws zmq::error_t on failure to send a message frame.\n*\/\nvoid Send(zmq::socket_t& socket, std::deque<zmq::message_t>& message);\n\n\n\/**\n\\brief  Sends an addressed message.\n\nThis function sends a multipart message consisting of the frames in `envelope`\nfollowed by an empty delimiter frame and the frames in `body`.\n\nBoth `envelope` and `body` will be cleared on return.\n\n\\throws std::invalid_argument if either of `envelope` or `body` are empty.\n\\throws zmq::error_t on failure to send a message frame.\n*\/\nvoid AddressedSend(\n    zmq::socket_t& socket,\n    std::deque<zmq::message_t>& envelope,\n    std::deque<zmq::message_t>& body);\n\n\n\/**\n\\brief Receives a message.\n\nExisting message content will be overwritten.\n\n\\throws zmq::error_t on failure to receive a message frame.\n*\/\nvoid Receive(\n    zmq::socket_t& socket,\n    std::deque<zmq::message_t>& message);\n\n\n\/**\n\\brief  Removes or moves the envelope from a message.\n\nThe envelope of a message are the message frames starting at the beginning\nof the message and ending at the first empty frame, called a \"delimiter\".\n\nIf `message` is empty, or has no envelope (i.e., no delimiter), this\nfunction returns without doing anything.  Otherwise, if `envelope` is not\nnull, all message frames up to, but not including, the delimiter are moved\nto `envelope`. Any existing contents of `envelope` will be overwritten.\nFinally, all frames up to and including the delimiter are removed from\n`message`.\n\n\\returns The number of frames removed from `message`, including the delimiter.\n*\/\nsize_t PopMessageEnvelope(\n    std::deque<zmq::message_t>& message,\n    std::deque<zmq::message_t>* envelope = nullptr);\n\n\nvoid CopyMessage(\n    std::deque<zmq::message_t>& source,\n    std::deque<zmq::message_t>& target);\n\n\n\/\/\/ Returns the content of a message frame as a `std::string`.\nstd::string ToString(const zmq::message_t& frame);\n\n\n}}      \/\/ namespace\n#endif  \/\/ header guard\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\/vector.h>\n\nnamespace MATH_NAMESPACE\n{\n\n\/\/--------------------------------------------------------------------------------------------------\n\/\/ matrix4 members\n\/\/\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4>::matrix(\n        simd::float4 const& c0,\n        simd::float4 const& c1,\n        simd::float4 const& c2,\n        simd::float4 const& c3\n        )\n    : col0(c0)\n    , col1(c1)\n    , col2(c2)\n    , col3(c3)\n{\n}\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4>::matrix(float const data[16])\n    : col0(&data[ 0])\n    , col1(&data[ 4])\n    , col2(&data[ 8])\n    , col3(&data[12])\n{\n}\n\ntemplate <typename U>\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4>::matrix(matrix<4, 4, U> const& rhs)\n    : col0( simd::float4(rhs.col0.x, rhs.col0.y, rhs.col0.z, rhs.col0.w) )\n    , col1( simd::float4(rhs.col1.x, rhs.col1.y, rhs.col1.z, rhs.col1.w) )\n    , col2( simd::float4(rhs.col2.x, rhs.col2.y, rhs.col2.z, rhs.col2.w) )\n    , col3( simd::float4(rhs.col3.x, rhs.col3.y, rhs.col3.z, rhs.col3.w) )\n{\n}\n\ntemplate <typename U>\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4>& matrix<4, 4, simd::float4>::operator=(matrix<4, 4, U> const& rhs)\n{\n    col0 = simd::float4(rhs.col0.x, rhs.col0.y, rhs.col0.z, rhs.col0.w);\n    col1 = simd::float4(rhs.col1.x, rhs.col1.y, rhs.col1.z, rhs.col1.w);\n    col2 = simd::float4(rhs.col2.x, rhs.col2.y, rhs.col2.z, rhs.col2.w);\n    col3 = simd::float4(rhs.col3.x, rhs.col3.y, rhs.col3.z, rhs.col3.w);\n    return *this;\n}\n\nVSNRAY_FORCE_INLINE simd::float4& matrix<4, 4, simd::float4>::operator()(size_t col)\n{\n    return *(reinterpret_cast<simd::float4*>(this) + col);\n}\n\nVSNRAY_FORCE_INLINE simd::float4 const& matrix<4, 4, simd::float4>::operator()(size_t col) const\n{\n    return *(reinterpret_cast<simd::float4 const*>(this) + col);\n}\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4> matrix<4, 4, simd::float4>::identity()\n{\n    return matrix<4, 4, simd::float4>(\n            simd::float4(1.0f, 0.0f, 0.0f, 0.0f),\n            simd::float4(0.0f, 1.0f, 0.0f, 0.0f),\n            simd::float4(0.0f, 0.0f, 1.0f, 0.0f),\n            simd::float4(0.0f, 0.0f, 0.0f, 1.0f)\n            );\n}\n\n\n\/\/--------------------------------------------------------------------------------------------------\n\/\/ Basic arithmetic\n\/\/\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4> operator*(\n        matrix<4, 4, simd::float4> const& a,\n        matrix<4, 4, simd::float4> const& b\n        )\n{\n\n    using simd::shuffle;\n\n    matrix<4, 4, simd::float4> result;\n\n    for (size_t i = 0; i < 4; ++i)\n    {\n        result(i) = a(0) * shuffle<0, 0, 0, 0>( b(i) )\n                  + a(1) * shuffle<1, 1, 1, 1>( b(i) )\n                  + a(2) * shuffle<2, 2, 2, 2>( b(i) )\n                  + a(3) * shuffle<3, 3, 3, 3>( b(i) );\n    }\n\n    return result;\n\n}\n\nVSNRAY_FORCE_INLINE vector<4, simd::float4> operator*(\n        matrix<4, 4, simd::float4> const& m,\n        vector<4, simd::float4> const& v\n        )\n{\n\n    matrix<4, 4, simd::float4> tmp(v.x, v.y, v.z, v.w);\n    matrix<4, 4, simd::float4> res = tmp * transpose(m);\n    return vector<4, simd::float4>( res.col0, res.col1, res.col2, res.col3 );\n\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Geometric functions\n\/\/\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4> transpose(matrix<4, 4, simd::float4> const& m)\n{\n\n    using simd::float4;\n\n    float4 tmp0 = _mm_unpacklo_ps( m(0), m(1) );\n    float4 tmp1 = _mm_unpacklo_ps( m(2), m(3) );\n    float4 tmp2 = _mm_unpackhi_ps( m(0), m(1) );\n    float4 tmp3 = _mm_unpackhi_ps( m(2), m(3) );\n\n    return matrix<4, 4, simd::float4>(\n            _mm_movelh_ps(tmp0, tmp1),\n            _mm_movehl_ps(tmp1, tmp0),\n            _mm_movelh_ps(tmp2, tmp3),\n            _mm_movehl_ps(tmp3, tmp2)\n            );\n\n}\n\n} \/\/ MATH_NAMESPACE\n<commit_msg>Unnecessary conversion<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <visionaray\/math\/vector.h>\n\nnamespace MATH_NAMESPACE\n{\n\n\/\/--------------------------------------------------------------------------------------------------\n\/\/ matrix4 members\n\/\/\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4>::matrix(\n        simd::float4 const& c0,\n        simd::float4 const& c1,\n        simd::float4 const& c2,\n        simd::float4 const& c3\n        )\n    : col0(c0)\n    , col1(c1)\n    , col2(c2)\n    , col3(c3)\n{\n}\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4>::matrix(float const data[16])\n    : col0(&data[ 0])\n    , col1(&data[ 4])\n    , col2(&data[ 8])\n    , col3(&data[12])\n{\n}\n\ntemplate <typename U>\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4>::matrix(matrix<4, 4, U> const& rhs)\n    : col0( simd::float4(rhs.col0.x, rhs.col0.y, rhs.col0.z, rhs.col0.w) )\n    , col1( simd::float4(rhs.col1.x, rhs.col1.y, rhs.col1.z, rhs.col1.w) )\n    , col2( simd::float4(rhs.col2.x, rhs.col2.y, rhs.col2.z, rhs.col2.w) )\n    , col3( simd::float4(rhs.col3.x, rhs.col3.y, rhs.col3.z, rhs.col3.w) )\n{\n}\n\ntemplate <typename U>\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4>& matrix<4, 4, simd::float4>::operator=(matrix<4, 4, U> const& rhs)\n{\n    col0 = simd::float4(rhs.col0.x, rhs.col0.y, rhs.col0.z, rhs.col0.w);\n    col1 = simd::float4(rhs.col1.x, rhs.col1.y, rhs.col1.z, rhs.col1.w);\n    col2 = simd::float4(rhs.col2.x, rhs.col2.y, rhs.col2.z, rhs.col2.w);\n    col3 = simd::float4(rhs.col3.x, rhs.col3.y, rhs.col3.z, rhs.col3.w);\n    return *this;\n}\n\nVSNRAY_FORCE_INLINE simd::float4& matrix<4, 4, simd::float4>::operator()(size_t col)\n{\n    return *(reinterpret_cast<simd::float4*>(this) + col);\n}\n\nVSNRAY_FORCE_INLINE simd::float4 const& matrix<4, 4, simd::float4>::operator()(size_t col) const\n{\n    return *(reinterpret_cast<simd::float4 const*>(this) + col);\n}\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4> matrix<4, 4, simd::float4>::identity()\n{\n    return matrix<4, 4, simd::float4>(\n            simd::float4(1.0f, 0.0f, 0.0f, 0.0f),\n            simd::float4(0.0f, 1.0f, 0.0f, 0.0f),\n            simd::float4(0.0f, 0.0f, 1.0f, 0.0f),\n            simd::float4(0.0f, 0.0f, 0.0f, 1.0f)\n            );\n}\n\n\n\/\/--------------------------------------------------------------------------------------------------\n\/\/ Basic arithmetic\n\/\/\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4> operator*(\n        matrix<4, 4, simd::float4> const& a,\n        matrix<4, 4, simd::float4> const& b\n        )\n{\n\n    using simd::shuffle;\n\n    matrix<4, 4, simd::float4> result;\n\n    for (size_t i = 0; i < 4; ++i)\n    {\n        result(i) = a(0) * shuffle<0, 0, 0, 0>( b(i) )\n                  + a(1) * shuffle<1, 1, 1, 1>( b(i) )\n                  + a(2) * shuffle<2, 2, 2, 2>( b(i) )\n                  + a(3) * shuffle<3, 3, 3, 3>( b(i) );\n    }\n\n    return result;\n\n}\n\nVSNRAY_FORCE_INLINE vector<4, simd::float4> operator*(\n        matrix<4, 4, simd::float4> const& m,\n        vector<4, simd::float4> const& v\n        )\n{\n\n    matrix<4, 4, simd::float4> tmp(v.x, v.y, v.z, v.w);\n    matrix<4, 4, simd::float4> res = tmp * transpose(m);\n    return vector<4, simd::float4>( res.col0, res.col1, res.col2, res.col3 );\n\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Geometric functions\n\/\/\n\nVSNRAY_FORCE_INLINE matrix<4, 4, simd::float4> transpose(matrix<4, 4, simd::float4> const& m)\n{\n    __m128 tmp0 = _mm_unpacklo_ps( m(0), m(1) );\n    __m128 tmp1 = _mm_unpacklo_ps( m(2), m(3) );\n    __m128 tmp2 = _mm_unpackhi_ps( m(0), m(1) );\n    __m128 tmp3 = _mm_unpackhi_ps( m(2), m(3) );\n\n    return matrix<4, 4, simd::float4>(\n            _mm_movelh_ps(tmp0, tmp1),\n            _mm_movehl_ps(tmp1, tmp0),\n            _mm_movelh_ps(tmp2, tmp3),\n            _mm_movehl_ps(tmp3, tmp2)\n            );\n\n}\n\n} \/\/ MATH_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix crasher in framegraph<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"data\/Format.h\"\n#include \"hardware\/parsing\/Samples.h\"\n#include \"exception\/Base.h\"\n\nnamespace blitzortung {\n  namespace hardware {\n    namespace parsing {\n\n      Samples::Samples(const std::vector<std::string>& fields, const hardware::gps::Base& gps) :\n\tBase(),\n\tlogger_(\"hardware.parsing.Samples\")\n      {\n\tvalid_ = false;\n\n\tif (gps.isValid()) {\n\t  \/\/ the counter value is always at the second position\n\t  counter_ = parseHex(fields[1]);\n\n\t  pt::ptime eventtime = gps.getTime(counter_);\n\n\t  if (eventtime != pt::not_a_date_time) {\n\n\t    if (fields[0] == \"BLSIG\") {\n\t      if (fields.size() > 3) {\n\t\tif (fields[2].size() == 2 && fields[3].size() ==2) {\n\t\t  \/\/ BLSIG type 1\n\t\t  setWaveform(FORMAT_8_2_1, eventtime, pt::nanoseconds(0), fields[2] + fields[3]);\n\t\t} else if (fields[2].size() == 3 && fields[3].size() ==3) {\n\t\t  \/\/ BLSIG type 2\n\t\t  setWaveform(FORMAT_12_2_1, eventtime, pt::nanoseconds(0), std::move(fields[2] + fields[3]), 12);\n\t\t} else {\n\t\t  logger_.warnStream() << \"Samples() BLSIG field size mismatch 2: '\" << fields[2] << \"', 3: '\" << fields[3] << \"'\";\n\t\t}\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BLSIG total number of fields mismatch: \" << fields.size();\n\t      }\n\t    } else if (fields[0] == \"BLSEQ\") {\n\t      if (fields[2].size() == 256) {\n\t\t\/\/ BLSIG type 2\n\t\tsetWaveform(FORMAT_8_2_64, eventtime, pt::nanoseconds(2900), std::move(fields[2]));\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BLSEQ field 2 size mismatch: \" << fields[2].size() << \" vs. 256\";\n\t      }\n\t    } else if (fields[0] == \"BD\") {\n\t      if (fields[2].size() == 256) {\n\t\t\/\/ BD type\n\t\tsetWaveform(FORMAT_8_2_64, eventtime, pt::nanoseconds(2800), std::move(fields[2]));\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BD field 2 size mismatch: \" << fields[2].size() << \" vs. 256\";\n\t      }\n\t    } else if (fields[0] == \"BM\") {\n\t      if (fields[2].size() == 256) {\n\t\t\/\/ BM type\n\t\tsetWaveform(FORMAT_8_1_128, eventtime, pt::nanoseconds(2800), std::move(fields[2]));\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BM field 2 size mismatch: \" << fields[2].size() << \" vs. 256\";\n\t      }\n\t    } else if (fields[0] == \"L\") {\n\t      if (fields[2].size() == 1024) {\n\t\t\/\/ L type\n\t\tsetWaveform(FORMAT_8_2_256, eventtime, pt::nanoseconds(1950), std::move(fields[2]));\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BD field 2 size mismatch: \" << fields[2].size() << \" vs. 256\";\n\t      }\n\t    } else {\n\t      logger_.warnStream() << \"Samples() unknown sample type '\" << fields[0] << \"'\";\n\t    }\n\t  } else {\n\t    logger_.warnStream() << \"Samples() invalid event time\";\n\t  }\n\n\t  if (! valid_) {\n\t    waveform_.reset();\n\n\t    std::string line;\n\t    for (std::vector<std::string>::const_iterator field = fields.begin(); field != fields.end(); field++)\n\t      line += *field + \" \";\n\n\t    logger_.warnStream() << \"Samples() could not parse '\" << line << \"'\";\n\t  }\n\t}\n      }\n\n      void Samples::setWaveform(const data::Format& format, const pt::ptime& eventtime, const pt::time_duration&& sampleDt, const std::string&& rawData, unsigned char numberOfBitsPerSample) {\n\tif (numberOfBitsPerSample == 0) {\n\t  numberOfBitsPerSample = format.getNumberOfBytesPerSample() * 8;\n\t}\n\n\tstd::ostringstream oss;\n\toss << (int)format.getNumberOfChannels() << \" \" << format.getNumberOfSamples() << \" \"  << (int)numberOfBitsPerSample <<  \" \" << rawData;\n\trawData_ = oss.str();\n\n\t\/\/ parse lighning event information\n\tif (format.isValid()) {\n\t  int numberOfEvents = rawData.size() >> 2;\n\n\n\t  waveform_ = format.createWaveform(eventtime, sampleDt);\n\n\t  unsigned short hexCharsPerSample = (numberOfBitsPerSample + 3 ) \/ 4;\n\t  unsigned short numberOfChannels = format.getNumberOfChannels();\n\n\t  int offset =  -(1 << (numberOfBitsPerSample - 1));\n\n\t  if (logger_.isDebugEnabled())\n\t    logger_.debugStream() << \"#ch \" << numberOfChannels << \", #chars\/sample \" << hexCharsPerSample << \" zeroOffset \" << offset;\n\n\t  int index = 0;\n\t  for (int sample=0; sample < numberOfEvents; sample++) {\n\t    for (int channel=0; channel < numberOfChannels; channel++) {\n\t      std::string hexString = rawData_.substr(index, hexCharsPerSample);\n\t      waveform_->setInt(int(offset + parseHex(hexString)), sample, channel);\n\t      index += hexCharsPerSample;\n\t    }\n\t  }\n\n\t  valid_ = true;\n\t} else {\n\t  logger_.warnStream() << \"invalid format \" << format;\n\t}\n      }\n\n      data::Waveform::AP Samples::getWaveform() {\n\treturn std::move(waveform_);\n      }\n\n      const std::string& Samples::getRawData() const {\n\treturn rawData_;\n      }\n\n      const data::Format Samples::FORMAT_8_2_1(1,2,1);\n      const data::Format Samples::FORMAT_12_2_1(2,2,1);\n      const data::Format Samples::FORMAT_8_2_64(1,2,64);\n      const data::Format Samples::FORMAT_8_1_128(1,1,128);\n      const data::Format Samples::FORMAT_8_2_256(1,2,256);\n    }\n  }\n}\n<commit_msg>fixed faulty sample buildup<commit_after>#include \"data\/Format.h\"\n#include \"hardware\/parsing\/Samples.h\"\n#include \"exception\/Base.h\"\n\nnamespace blitzortung {\n  namespace hardware {\n    namespace parsing {\n\n      Samples::Samples(const std::vector<std::string>& fields, const hardware::gps::Base& gps) :\n\tBase(),\n\tlogger_(\"hardware.parsing.Samples\")\n      {\n\tvalid_ = false;\n\n\tif (gps.isValid()) {\n\t  \/\/ the counter value is always at the second position\n\t  counter_ = parseHex(fields[1]);\n\n\t  pt::ptime eventtime = gps.getTime(counter_);\n\n\t  if (eventtime != pt::not_a_date_time) {\n\n\t    if (fields[0] == \"BLSIG\") {\n\t      if (fields.size() > 3) {\n\t\tif (fields[2].size() == 2 && fields[3].size() ==2) {\n\t\t  \/\/ BLSIG type 1\n\t\t  setWaveform(FORMAT_8_2_1, eventtime, pt::nanoseconds(0), fields[2] + fields[3]);\n\t\t} else if (fields[2].size() == 3 && fields[3].size() ==3) {\n\t\t  \/\/ BLSIG type 2\n\t\t  setWaveform(FORMAT_12_2_1, eventtime, pt::nanoseconds(0), std::move(fields[2] + fields[3]), 12);\n\t\t} else {\n\t\t  logger_.warnStream() << \"Samples() BLSIG field size mismatch 2: '\" << fields[2] << \"', 3: '\" << fields[3] << \"'\";\n\t\t}\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BLSIG total number of fields mismatch: \" << fields.size();\n\t      }\n\t    } else if (fields[0] == \"BLSEQ\") {\n\t      if (fields[2].size() == 256) {\n\t\t\/\/ BLSIG type 2\n\t\tsetWaveform(FORMAT_8_2_64, eventtime, pt::nanoseconds(2900), std::move(fields[2]));\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BLSEQ field 2 size mismatch: \" << fields[2].size() << \" vs. 256\";\n\t      }\n\t    } else if (fields[0] == \"BD\") {\n\t      if (fields[2].size() == 256) {\n\t\t\/\/ BD type\n\t\tsetWaveform(FORMAT_8_2_64, eventtime, pt::nanoseconds(2800), std::move(fields[2]));\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BD field 2 size mismatch: \" << fields[2].size() << \" vs. 256\";\n\t      }\n\t    } else if (fields[0] == \"BM\") {\n\t      if (fields[2].size() == 256) {\n\t\t\/\/ BM type\n\t\tsetWaveform(FORMAT_8_1_128, eventtime, pt::nanoseconds(2800), std::move(fields[2]));\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BM field 2 size mismatch: \" << fields[2].size() << \" vs. 256\";\n\t      }\n\t    } else if (fields[0] == \"L\") {\n\t      if (fields[2].size() == 1024) {\n\t\t\/\/ L type\n\t\tsetWaveform(FORMAT_8_2_256, eventtime, pt::nanoseconds(1950), std::move(fields[2]));\n\t      } else {\n\t\tlogger_.warnStream() << \"Samples() BD field 2 size mismatch: \" << fields[2].size() << \" vs. 256\";\n\t      }\n\t    } else {\n\t      logger_.warnStream() << \"Samples() unknown sample type '\" << fields[0] << \"'\";\n\t    }\n\t  } else {\n\t    logger_.warnStream() << \"Samples() invalid event time\";\n\t  }\n\n\t  if (! valid_) {\n\t    waveform_.reset();\n\n\t    std::string line;\n\t    for (std::vector<std::string>::const_iterator field = fields.begin(); field != fields.end(); field++)\n\t      line += *field + \" \";\n\n\t    logger_.warnStream() << \"Samples() could not parse '\" << line << \"'\";\n\t  }\n\t}\n      }\n\n      void Samples::setWaveform(const data::Format& format, const pt::ptime& eventtime, const pt::time_duration&& sampleDt, const std::string&& rawData, unsigned char numberOfBitsPerSample) {\n\tif (numberOfBitsPerSample == 0) {\n\t  numberOfBitsPerSample = format.getNumberOfBytesPerSample() * 8;\n\t}\n\n\tstd::ostringstream oss;\n\toss << (int)format.getNumberOfChannels() << \" \" << format.getNumberOfSamples() << \" \"  << (int)numberOfBitsPerSample <<  \" \" << rawData;\n\trawData_ = oss.str();\n\n\t\/\/ parse lighning event information\n\tif (format.isValid()) {\n\t  int numberOfEvents = rawData.size() >> 2;\n\n\n\t  waveform_ = format.createWaveform(eventtime, sampleDt);\n\n\t  unsigned short hexCharsPerSample = (numberOfBitsPerSample + 3 ) \/ 4;\n\t  unsigned short numberOfChannels = format.getNumberOfChannels();\n\n\t  int offset =  -(1 << (numberOfBitsPerSample - 1));\n\n\t  if (logger_.isDebugEnabled())\n\t    logger_.debugStream() << \"#ch \" << numberOfChannels << \", #chars\/sample \" << hexCharsPerSample << \" zeroOffset \" << offset;\n\n\t  int index = 0;\n\t  for (int sample=0; sample < numberOfEvents; sample++) {\n\t    for (int channel=0; channel < numberOfChannels; channel++) {\n\t      std::string hexString = rawData.substr(index, hexCharsPerSample);\n\t      waveform_->setInt(int(offset + parseHex(hexString)), sample, channel);\n\t      index += hexCharsPerSample;\n\t    }\n\t  }\n\n\t  valid_ = true;\n\t} else {\n\t  logger_.warnStream() << \"invalid format \" << format;\n\t}\n      }\n\n      data::Waveform::AP Samples::getWaveform() {\n\treturn std::move(waveform_);\n      }\n\n      const std::string& Samples::getRawData() const {\n\treturn rawData_;\n      }\n\n      const data::Format Samples::FORMAT_8_2_1(1,2,1);\n      const data::Format Samples::FORMAT_12_2_1(2,2,1);\n      const data::Format Samples::FORMAT_8_2_64(1,2,64);\n      const data::Format Samples::FORMAT_8_1_128(1,1,128);\n      const data::Format Samples::FORMAT_8_2_256(1,2,256);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ inc order weird for these guys\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n\n\/\/%deps(opengl, glfw)\n\n#include \"viewer\/gl_aliases.hh\"\n#include \"viewer\/primitives\/simple_geometry_primitives.hh\"\n#include \"viewer\/window_3d.hh\"\n#include \"viewer\/window_manager.hh\"\n\n#include \"eigen_helpers.hh\"\n\n#include <map>\n#include <thread>\n\n\/\/TODO\n#include \"viewer\/text\/gl_text.hh\"\n\nnamespace viewer {\nnamespace {\n\nvoid apply_view(const OrbitCamera &view, bool show_axes) {\n  glMatrixMode(GL_MODELVIEW);\n  glLoadIdentity();\n\n  glTransform(view.camera_from_anchor());\n  glScaled(view.zoom(), view.zoom(), view.zoom());\n  if (show_axes) {\n    draw_axes({SE3(), 0.1 \/ view.zoom(), 3.0});\n  }\n\n  glTransform(view.anchor_from_world());\n  if (show_axes) {\n    draw_axes({SE3(), 0.2 \/ view.zoom(), 3.0});\n  }\n}\n\nvoid prepare_to_render() {\n  \/\/\n  \/\/ Flag soup\n  \/\/\n\n  glShadeModel(GL_SMOOTH);\n\n  \/\/ Check depth when rendering\n  glEnable(GL_DEPTH_TEST);\n\n  \/\/ Turn on lighting\n  \/\/ glEnable(GL_LIGHTING);\n\n  glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n  glEnable(GL_BLEND);\n  glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n  glEnable(GL_SAMPLE_ALPHA_TO_COVERAGE);\n  glEnable(GL_LINE_SMOOTH);\n  glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\n\n  glEnable(GL_MULTISAMPLE);\n}\n\nvoid set_perspective(const GlSize &gl_size, bool ortho = false) {\n  glViewport(0, 0, gl_size.width, gl_size.height);\n  glMatrixMode(GL_PROJECTION);\n\n  glLoadIdentity();\n\n  constexpr double NEAR_CLIP = 0.001;\n  constexpr double FAR_CLIP = 1000.0;\n  const double aspect_ratio =\n      (static_cast<double>(gl_size.width) \/ static_cast<double>(gl_size.height));\n  if (ortho) {\n    glOrtho(-aspect_ratio, aspect_ratio, -1.0, 1.0, NEAR_CLIP, FAR_CLIP);\n  } else {\n    constexpr double FOV = 60.0;\n    gluPerspective(FOV, aspect_ratio, NEAR_CLIP, FAR_CLIP);\n  }\n}\n\n}  \/\/ namespace\n\nWindow3D::Window3D(const GlSize &gl_size) : gl_size_(gl_size) {\n  set_view_preset(ViewSetting::STANDARD);\n}\n\nvoid Window3D::set_view_preset(const ViewSetting &setting) {\n  switch (setting) {\n    case ViewSetting::STANDARD: {\n      set_target_from_world(SE3(SO3::exp(Eigen::Vector3d(-3.1415 * 0.5, 0.0, 0.0)),\n                                Eigen::Vector3d::Zero()));\n      break;\n    }\n    case ViewSetting::CAMERA: {\n      set_target_from_world(\n          SE3(SO3::exp(Eigen::Vector3d::Zero()), Eigen::Vector3d::Zero()));\n      break;\n    }\n  }\n}\n\nvoid Window3D::spin_until_step() {\n  while (!should_step_ && !should_continue_ && !should_close()) {\n    std::this_thread::sleep_for(std::chrono::milliseconds(10));\n  }\n\n  if (should_continue_ && !should_close()) {\n    std::this_thread::sleep_for(std::chrono::milliseconds(continue_ms_));\n  }\n\n  if (should_step_) {\n    should_step_ = false;\n  }\n}\n\nvoid Window3D::on_key(int key, int scancode, int action, int mods) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const char key_char = static_cast<char>(key);\n\n  if (action == GLFW_PRESS) {\n    \/\/\n    \/\/ Toggling\n    \/\/\n    if (key_mappings_.count(key_char) != 0) {\n      const std::string toggle_name = key_mappings_.at(key_char);\n      toggles_[toggle_name] = !toggles_[toggle_name];\n      const bool new_toggle_state = toggles_[toggle_name];\n      for (const auto &toggle_callback : toggle_callbacks_[toggle_name]) {\n        toggle_callback(new_toggle_state);\n      }\n    }\n\n    \/\/\n    \/\/ Navigation UI management\n    \/\/\n    if (key_char == 'N') {\n      should_step_ = true;\n    }\n\n    if (key_char == 'C') {\n      should_continue_ = !should_continue_;\n    }\n\n    if (key_char == 'O') {\n      orthogonal_projection_ = !orthogonal_projection_;\n    }\n    if (key_char == 'H') {\n      hide_axes_ = !hide_axes_;\n    }\n  }\n}\nvoid Window3D::on_mouse_button(int button, int action, int mods) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const auto current_mouse_pos = mouse_pos();\n  \/\/ const auto ray = projection_.unproject(current_mouse_pos);\n\n  mouse_pos_last_click_ = current_mouse_pos;\n}\n\nvoid Window3D::on_mouse_move(const WindowPoint &mouse_pos) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const bool shift = held_keys().count(GLFW_KEY_LEFT_SHIFT) == 1\n                         ? held_keys().at(GLFW_KEY_LEFT_SHIFT)\n                         : false;\n\n  const bool left = left_mouse_held() && !shift;\n  const bool right = right_mouse_held() || (shift && left_mouse_held());\n\n  \/\/ if (left || right) {\n  \/\/ glfwSetInputMode(get_window(), GLFW_CURSOR, GLFW_CURSOR_DISABLED);\n  \/\/ } else {\n  \/\/ glfwSetInputMode(get_window(), GLFW_CURSOR, GLFW_CURSOR_NORMAL);\n  \/\/ }\n\n  view_.apply_mouse(mouse_pos, mouse_pos_last_click_, left, right);\n\n  const auto ray = projection_.unproject(mouse_pos);\n  callback_manager_.handle_callbacks(ray);\n\n  if (left || right) {\n    mouse_pos_last_click_ = mouse_pos;\n  }\n}\n\nvoid Window3D::on_scroll(const double amount) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n  view_.apply_scroll(amount);\n}\n\nvoid Window3D::resize(const GlSize &gl_size) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  glViewport(0, 0, gl_size.width, gl_size.height);\n  gl_size_ = gl_size;\n}\n\nvoid Window3D::draw_all_primitives() const {\n  for (const auto &primitive : primitives_) {\n    primitive->draw();\n  }\n}\n\nvoid Window3D::render() {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  \/\/\n  \/\/ Render cameras\n  \/\/\n  for (const auto &camera : cameras_) {\n    prepare_to_render();\n    camera->prepare_view();\n    draw_all_primitives();\n    camera->draw();\n  }\n\n  {  \/\/ Render main scene\n    set_perspective(gl_size_, orthogonal_projection_);\n    prepare_to_render();\n    apply_view(view_, !hide_axes_);\n    projection_ = Projection::get_from_current();\n    draw_all_primitives();\n  }\n\n  const auto strlib = create_text_library();\n  write_string(\"Jagop\", strlib);\n\n  const double t_now = glfwGetTime();\n\n  const double dt = std::max(t_now - last_update_time_, 0.02);\n  view_.apply_keys(held_keys(), dt);\n  view_ = view_.simulate(dt);\n  last_update_time_ = t_now;\n\n  glFinish();\n}  \/\/ namespace viewer\n\nnamespace {\nstruct Window3DGlobalState {\n  std::map<std::string, std::shared_ptr<Window3D>> windows;\n};\n\nWindow3DGlobalState window_3d_state;\n\nWindow3DGlobalState &get_global_state() {\n  return window_3d_state;\n}\n}  \/\/ namespace\n\nstd::shared_ptr<Window3D> get_window3d(const std::string &title) {\n  const auto it = get_global_state().windows.find(title);\n  if (it != get_global_state().windows.end()) {\n    return it->second;\n  } else {\n    const GlSize gl_size(640, 640);\n    auto window = std::make_shared<Window3D>(gl_size);\n    get_global_state().windows[title] = window;\n    WindowManager::register_window(gl_size, window, title);\n    return window;\n  }\n}\n}  \/\/ namespace viewer\n<commit_msg>More str<commit_after>\/\/ inc order weird for these guys\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n\n\/\/%deps(opengl, glfw)\n\n#include \"viewer\/gl_aliases.hh\"\n#include \"viewer\/primitives\/simple_geometry_primitives.hh\"\n#include \"viewer\/window_3d.hh\"\n#include \"viewer\/window_manager.hh\"\n\n#include \"eigen_helpers.hh\"\n\n#include <map>\n#include <thread>\n\n\/\/TODO\n#include \"viewer\/text\/gl_text.hh\"\n\nnamespace viewer {\nnamespace {\n\nvoid apply_view(const OrbitCamera &view, bool show_axes) {\n  glMatrixMode(GL_MODELVIEW);\n  glLoadIdentity();\n\n  glTransform(view.camera_from_anchor());\n  glScaled(view.zoom(), view.zoom(), view.zoom());\n  if (show_axes) {\n    draw_axes({SE3(), 0.1 \/ view.zoom(), 3.0});\n  }\n\n  glTransform(view.anchor_from_world());\n  if (show_axes) {\n    draw_axes({SE3(), 0.2 \/ view.zoom(), 3.0});\n  }\n}\n\nvoid prepare_to_render() {\n  \/\/\n  \/\/ Flag soup\n  \/\/\n\n  glShadeModel(GL_SMOOTH);\n\n  \/\/ Check depth when rendering\n  glEnable(GL_DEPTH_TEST);\n\n  \/\/ Turn on lighting\n  \/\/ glEnable(GL_LIGHTING);\n\n  glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n  glEnable(GL_BLEND);\n  glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n  glEnable(GL_SAMPLE_ALPHA_TO_COVERAGE);\n  glEnable(GL_LINE_SMOOTH);\n  glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\n\n  glEnable(GL_MULTISAMPLE);\n}\n\nvoid set_perspective(const GlSize &gl_size, bool ortho = false) {\n  glViewport(0, 0, gl_size.width, gl_size.height);\n  glMatrixMode(GL_PROJECTION);\n\n  glLoadIdentity();\n\n  constexpr double NEAR_CLIP = 0.001;\n  constexpr double FAR_CLIP = 1000.0;\n  const double aspect_ratio =\n      (static_cast<double>(gl_size.width) \/ static_cast<double>(gl_size.height));\n  if (ortho) {\n    glOrtho(-aspect_ratio, aspect_ratio, -1.0, 1.0, NEAR_CLIP, FAR_CLIP);\n  } else {\n    constexpr double FOV = 60.0;\n    gluPerspective(FOV, aspect_ratio, NEAR_CLIP, FAR_CLIP);\n  }\n}\n\n}  \/\/ namespace\n\nWindow3D::Window3D(const GlSize &gl_size) : gl_size_(gl_size) {\n  set_view_preset(ViewSetting::STANDARD);\n}\n\nvoid Window3D::set_view_preset(const ViewSetting &setting) {\n  switch (setting) {\n    case ViewSetting::STANDARD: {\n      set_target_from_world(SE3(SO3::exp(Eigen::Vector3d(-3.1415 * 0.5, 0.0, 0.0)),\n                                Eigen::Vector3d::Zero()));\n      break;\n    }\n    case ViewSetting::CAMERA: {\n      set_target_from_world(\n          SE3(SO3::exp(Eigen::Vector3d::Zero()), Eigen::Vector3d::Zero()));\n      break;\n    }\n  }\n}\n\nvoid Window3D::spin_until_step() {\n  while (!should_step_ && !should_continue_ && !should_close()) {\n    std::this_thread::sleep_for(std::chrono::milliseconds(10));\n  }\n\n  if (should_continue_ && !should_close()) {\n    std::this_thread::sleep_for(std::chrono::milliseconds(continue_ms_));\n  }\n\n  if (should_step_) {\n    should_step_ = false;\n  }\n}\n\nvoid Window3D::on_key(int key, int scancode, int action, int mods) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const char key_char = static_cast<char>(key);\n\n  if (action == GLFW_PRESS) {\n    \/\/\n    \/\/ Toggling\n    \/\/\n    if (key_mappings_.count(key_char) != 0) {\n      const std::string toggle_name = key_mappings_.at(key_char);\n      toggles_[toggle_name] = !toggles_[toggle_name];\n      const bool new_toggle_state = toggles_[toggle_name];\n      for (const auto &toggle_callback : toggle_callbacks_[toggle_name]) {\n        toggle_callback(new_toggle_state);\n      }\n    }\n\n    \/\/\n    \/\/ Navigation UI management\n    \/\/\n    if (key_char == 'N') {\n      should_step_ = true;\n    }\n\n    if (key_char == 'C') {\n      should_continue_ = !should_continue_;\n    }\n\n    if (key_char == 'O') {\n      orthogonal_projection_ = !orthogonal_projection_;\n    }\n    if (key_char == 'H') {\n      hide_axes_ = !hide_axes_;\n    }\n  }\n}\nvoid Window3D::on_mouse_button(int button, int action, int mods) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const auto current_mouse_pos = mouse_pos();\n  \/\/ const auto ray = projection_.unproject(current_mouse_pos);\n\n  mouse_pos_last_click_ = current_mouse_pos;\n}\n\nvoid Window3D::on_mouse_move(const WindowPoint &mouse_pos) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const bool shift = held_keys().count(GLFW_KEY_LEFT_SHIFT) == 1\n                         ? held_keys().at(GLFW_KEY_LEFT_SHIFT)\n                         : false;\n\n  const bool left = left_mouse_held() && !shift;\n  const bool right = right_mouse_held() || (shift && left_mouse_held());\n\n  \/\/ if (left || right) {\n  \/\/ glfwSetInputMode(get_window(), GLFW_CURSOR, GLFW_CURSOR_DISABLED);\n  \/\/ } else {\n  \/\/ glfwSetInputMode(get_window(), GLFW_CURSOR, GLFW_CURSOR_NORMAL);\n  \/\/ }\n\n  view_.apply_mouse(mouse_pos, mouse_pos_last_click_, left, right);\n\n  const auto ray = projection_.unproject(mouse_pos);\n  callback_manager_.handle_callbacks(ray);\n\n  if (left || right) {\n    mouse_pos_last_click_ = mouse_pos;\n  }\n}\n\nvoid Window3D::on_scroll(const double amount) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n  view_.apply_scroll(amount);\n}\n\nvoid Window3D::resize(const GlSize &gl_size) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  glViewport(0, 0, gl_size.width, gl_size.height);\n  gl_size_ = gl_size;\n}\n\nvoid Window3D::draw_all_primitives() const {\n  for (const auto &primitive : primitives_) {\n    primitive->draw();\n  }\n}\n\nvoid Window3D::render() {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  \/\/\n  \/\/ Render cameras\n  \/\/\n  for (const auto &camera : cameras_) {\n    prepare_to_render();\n    camera->prepare_view();\n    draw_all_primitives();\n    camera->draw();\n  }\n\n  {  \/\/ Render main scene\n    set_perspective(gl_size_, orthogonal_projection_);\n    prepare_to_render();\n    apply_view(view_, !hide_axes_);\n    projection_ = Projection::get_from_current();\n    draw_all_primitives();\n  }\n\n  \/\/ const auto strlib = create_text_library();\n  \/\/ write_string(\"Jagop: Analytical 240.599\", strlib);\n\n  const double t_now = glfwGetTime();\n\n  const double dt = std::max(t_now - last_update_time_, 0.02);\n  view_.apply_keys(held_keys(), dt);\n  view_ = view_.simulate(dt);\n  last_update_time_ = t_now;\n\n  glFinish();\n}  \/\/ namespace viewer\n\nnamespace {\nstruct Window3DGlobalState {\n  std::map<std::string, std::shared_ptr<Window3D>> windows;\n};\n\nWindow3DGlobalState window_3d_state;\n\nWindow3DGlobalState &get_global_state() {\n  return window_3d_state;\n}\n}  \/\/ namespace\n\nstd::shared_ptr<Window3D> get_window3d(const std::string &title) {\n  const auto it = get_global_state().windows.find(title);\n  if (it != get_global_state().windows.end()) {\n    return it->second;\n  } else {\n    const GlSize gl_size(640, 640);\n    auto window = std::make_shared<Window3D>(gl_size);\n    get_global_state().windows[title] = window;\n    WindowManager::register_window(gl_size, window, title);\n    return window;\n  }\n}\n}  \/\/ namespace viewer\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: dlgsnap.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: obo $ $Date: 2007-01-23 11:13:53 $\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#ifdef SD_DLLIMPLEMENTATION\n#undef SD_DLLIMPLEMENTATION\n#endif\n\n\n#include <svx\/svxids.hrc>\n#include <svx\/dlgutil.hxx>\n#ifndef _SFXITEMPOOL_HXX \/\/autogen\n#include <svtools\/itempool.hxx>\n#endif\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n\n#include \"dlgsnap.hrc\"\n#include \"sdattr.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#include \"sdresid.hxx\"\n#include \"drawdoc.hxx\"\n#include \"dlgsnap.hxx\"\n\n\n\/*************************************************************************\n|*\n|* Dialog zum Einstellen des Rasters (wohl kaum ESO!)\n|*\n\\************************************************************************\/\n\nSdSnapLineDlg::SdSnapLineDlg(\n    ::Window* pWindow,\n    const SfxItemSet& rInAttrs,\n    ::sd::View* pView)\n    : ModalDialog (pWindow, SdResId(DLG_SNAPLINE)),\n      aFlPos      (this, SdResId(FL_POSITION)),\n      aFtX        (this, SdResId(FT_X)),\n      aMtrFldX    (this, SdResId(MTR_FLD_X)),\n      aFtY        (this, SdResId(FT_Y)),\n      aMtrFldY    (this, SdResId(MTR_FLD_Y)),\n      aFlDir      (this, SdResId(FL_DIRECTION)),\n      aRbPoint    (this, SdResId(RB_POINT)),\n      aRbVert     (this, SdResId(RB_VERTICAL)),\n      aRbHorz     (this, SdResId(RB_HORIZONTAL)),\n      aBtnOK      (this, SdResId(BTN_OK)),\n      aBtnCancel  (this, SdResId(BTN_CANCEL)),\n      aBtnHelp    (this, SdResId(BTN_HELP)),\n      aBtnDelete  (this, SdResId(BTN_DELETE)),\n      eUIUnit(pView->GetDoc()->GetUIUnit()),\n      aUIScale(pView->GetDoc()->GetUIScale())\n{\n    aRbPoint.SetModeRadioImage( Image( SdResId( BMP_POINT_H ) ), BMP_COLOR_HIGHCONTRAST );\n    aRbVert.SetModeRadioImage( Image( SdResId( BMP_VERTICAL_H ) ), BMP_COLOR_HIGHCONTRAST );\n    aRbHorz.SetModeRadioImage( Image( SdResId( BMP_HORIZONTAL_H ) ), BMP_COLOR_HIGHCONTRAST );\n\n    FreeResource();\n\n    aRbHorz.SetClickHdl(LINK(this, SdSnapLineDlg, ClickHdl));\n    aRbVert.SetClickHdl(LINK(this, SdSnapLineDlg, ClickHdl));\n    aRbPoint.SetClickHdl(LINK(this, SdSnapLineDlg, ClickHdl));\n\n    aBtnDelete.SetClickHdl(LINK(this, SdSnapLineDlg, ClickHdl));\n\n    SetFieldUnit( aMtrFldX, eUIUnit, TRUE );\n    SetFieldUnit( aMtrFldY, eUIUnit, TRUE );\n\n    \/\/ WorkArea holen\n    Rectangle aWorkArea = pView->GetWorkArea();\n\n    \/\/ PoolUnit ermitteln\n    SfxItemPool* pPool = rInAttrs.GetPool();\n    DBG_ASSERT( pPool, \"Wo ist der Pool?\" );\n    SfxMapUnit ePoolUnit = pPool->GetMetric( SID_ATTR_FILL_HATCH );\n\n    \/\/ Hier werden die Max- und MinWerte in Ahaengigkeit von der\n    \/\/ WorkArea, PoolUnit und der FieldUnit:\n    SetMetricValue( aMtrFldX, aWorkArea.Left(), ePoolUnit );\n    long nValue = static_cast<long>(aMtrFldX.GetValue());\n    nValue = Fraction( nValue ) \/ aUIScale;\n    aMtrFldX.SetMin( nValue );\n    aMtrFldX.SetFirst( nValue );\n\n    SetMetricValue( aMtrFldX, aWorkArea.Right()+1, ePoolUnit );\n    nValue = static_cast<long>(aMtrFldX.GetValue());\n    nValue = Fraction( nValue ) \/ aUIScale;\n    aMtrFldX.SetMax( nValue );\n    aMtrFldX.SetLast( nValue );\n\n    SetMetricValue( aMtrFldY, aWorkArea.Top(), ePoolUnit );\n    nValue = static_cast<long>(aMtrFldY.GetValue());\n    nValue = Fraction( nValue ) \/ aUIScale;\n    aMtrFldY.SetMin( nValue );\n    aMtrFldY.SetFirst( nValue );\n\n    SetMetricValue( aMtrFldY, aWorkArea.Bottom()+1, ePoolUnit );\n    nValue = static_cast<long>(aMtrFldY.GetValue());\n    nValue = Fraction( nValue ) \/ aUIScale;\n    aMtrFldY.SetMax( nValue );\n    aMtrFldY.SetLast( nValue );\n\n    \/\/ Setzen der Werte\n    nXValue = ((const SfxUInt32Item&) rInAttrs.Get(ATTR_SNAPLINE_X)).GetValue();\n    nYValue = ((const SfxUInt32Item&) rInAttrs.Get(ATTR_SNAPLINE_Y)).GetValue();\n    nXValue = Fraction(nXValue) \/ aUIScale;\n    nYValue = Fraction(nYValue) \/ aUIScale;\n    SetMetricValue( aMtrFldX, nXValue, SFX_MAPUNIT_100TH_MM);\n    SetMetricValue( aMtrFldY, nYValue, SFX_MAPUNIT_100TH_MM);\n\n    aRbPoint.Check();\n}\n\n\/*************************************************************************\n|*\n|* Fuellt uebergebenes Item-Set mit Dialogbox-Attributen\n|*\n\\************************************************************************\/\n\nIMPL_LINK( SdSnapLineDlg, ClickHdl, Button *, pBtn )\n{\n    if ( pBtn == &aRbPoint )        SetInputFields(TRUE, TRUE);\n    else if ( pBtn == &aRbHorz )    SetInputFields(FALSE, TRUE);\n    else if ( pBtn == &aRbVert )    SetInputFields(TRUE, FALSE);\n    else if ( pBtn == &aBtnDelete ) EndDialog(RET_SNAP_DELETE);\n\n    return 0;\n}\n\n\/*************************************************************************\n|*\n|* Fuellt uebergebenes Item-Set mit Dialogbox-Attributen\n|*\n\\************************************************************************\/\n\nvoid SdSnapLineDlg::GetAttr(SfxItemSet& rOutAttrs)\n{\n    SnapKind eKind;\n\n    if ( aRbHorz.IsChecked() )      eKind = SK_HORIZONTAL;\n    else if ( aRbVert.IsChecked() ) eKind = SK_VERTICAL;\n    else                            eKind = SK_POINT;\n\n    nXValue = Fraction( GetCoreValue( aMtrFldX, SFX_MAPUNIT_100TH_MM) ) * aUIScale;\n    nYValue = Fraction( GetCoreValue( aMtrFldY, SFX_MAPUNIT_100TH_MM) ) * aUIScale;\n\n    rOutAttrs.Put(SfxAllEnumItem(ATTR_SNAPLINE_KIND, (USHORT)eKind));\n    rOutAttrs.Put(SfxUInt32Item(ATTR_SNAPLINE_X, nXValue));\n    rOutAttrs.Put(SfxUInt32Item(ATTR_SNAPLINE_Y, nYValue));\n}\n\n\/*************************************************************************\n|*\n|* Gruppe mit Radiobutton verstecken\n|*\n\\************************************************************************\/\n\nvoid SdSnapLineDlg::HideRadioGroup()\n{\n    aFlDir.Hide();\n    aRbHorz.Hide();\n    aRbVert.Hide();\n    aRbPoint.Hide();\n}\n\n\/*************************************************************************\n|*\n|* X- bzw. Y-Inputfeld disablen\n|*\n\\************************************************************************\/\n\nvoid SdSnapLineDlg::SetInputFields(BOOL bEnableX, BOOL bEnableY)\n{\n    if ( bEnableX )\n    {\n        if ( !aMtrFldX.IsEnabled() )\n            aMtrFldX.SetValue(nXValue);\n        aMtrFldX.Enable();\n        aFtX.Enable();\n    }\n    else if ( aMtrFldX.IsEnabled() )\n    {\n        nXValue = static_cast<long>(aMtrFldX.GetValue());\n        aMtrFldX.SetText(String());\n        aMtrFldX.Disable();\n        aFtX.Disable();\n    }\n    if ( bEnableY )\n    {\n        if ( !aMtrFldY.IsEnabled() )\n            aMtrFldY.SetValue(nYValue);\n        aMtrFldY.Enable();\n        aFtY.Enable();\n    }\n    else if ( aMtrFldY.IsEnabled() )\n    {\n        nYValue = static_cast<long>(aMtrFldY.GetValue());\n        aMtrFldY.SetText(String());\n        aMtrFldY.Disable();\n        aFtY.Disable();\n    }\n}\n\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.10.256); FILE MERGED 2008\/04\/01 15:34:19 thb 1.10.256.3: #i85898# Stripping all external header guards 2008\/04\/01 12:38:41 thb 1.10.256.2: #i85898# Stripping all external header guards 2008\/03\/31 13:57:45 rt 1.10.256.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: dlgsnap.cxx,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\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n#ifdef SD_DLLIMPLEMENTATION\n#undef SD_DLLIMPLEMENTATION\n#endif\n\n\n#include <svx\/svxids.hrc>\n#include <svx\/dlgutil.hxx>\n#include <svtools\/itempool.hxx>\n#include <svtools\/aeitem.hxx>\n\n#include \"dlgsnap.hrc\"\n#include \"sdattr.hxx\"\n#include \"View.hxx\"\n#include \"sdresid.hxx\"\n#include \"drawdoc.hxx\"\n#include \"dlgsnap.hxx\"\n\n\n\/*************************************************************************\n|*\n|* Dialog zum Einstellen des Rasters (wohl kaum ESO!)\n|*\n\\************************************************************************\/\n\nSdSnapLineDlg::SdSnapLineDlg(\n    ::Window* pWindow,\n    const SfxItemSet& rInAttrs,\n    ::sd::View* pView)\n    : ModalDialog (pWindow, SdResId(DLG_SNAPLINE)),\n      aFlPos      (this, SdResId(FL_POSITION)),\n      aFtX        (this, SdResId(FT_X)),\n      aMtrFldX    (this, SdResId(MTR_FLD_X)),\n      aFtY        (this, SdResId(FT_Y)),\n      aMtrFldY    (this, SdResId(MTR_FLD_Y)),\n      aFlDir      (this, SdResId(FL_DIRECTION)),\n      aRbPoint    (this, SdResId(RB_POINT)),\n      aRbVert     (this, SdResId(RB_VERTICAL)),\n      aRbHorz     (this, SdResId(RB_HORIZONTAL)),\n      aBtnOK      (this, SdResId(BTN_OK)),\n      aBtnCancel  (this, SdResId(BTN_CANCEL)),\n      aBtnHelp    (this, SdResId(BTN_HELP)),\n      aBtnDelete  (this, SdResId(BTN_DELETE)),\n      eUIUnit(pView->GetDoc()->GetUIUnit()),\n      aUIScale(pView->GetDoc()->GetUIScale())\n{\n    aRbPoint.SetModeRadioImage( Image( SdResId( BMP_POINT_H ) ), BMP_COLOR_HIGHCONTRAST );\n    aRbVert.SetModeRadioImage( Image( SdResId( BMP_VERTICAL_H ) ), BMP_COLOR_HIGHCONTRAST );\n    aRbHorz.SetModeRadioImage( Image( SdResId( BMP_HORIZONTAL_H ) ), BMP_COLOR_HIGHCONTRAST );\n\n    FreeResource();\n\n    aRbHorz.SetClickHdl(LINK(this, SdSnapLineDlg, ClickHdl));\n    aRbVert.SetClickHdl(LINK(this, SdSnapLineDlg, ClickHdl));\n    aRbPoint.SetClickHdl(LINK(this, SdSnapLineDlg, ClickHdl));\n\n    aBtnDelete.SetClickHdl(LINK(this, SdSnapLineDlg, ClickHdl));\n\n    SetFieldUnit( aMtrFldX, eUIUnit, TRUE );\n    SetFieldUnit( aMtrFldY, eUIUnit, TRUE );\n\n    \/\/ WorkArea holen\n    Rectangle aWorkArea = pView->GetWorkArea();\n\n    \/\/ PoolUnit ermitteln\n    SfxItemPool* pPool = rInAttrs.GetPool();\n    DBG_ASSERT( pPool, \"Wo ist der Pool?\" );\n    SfxMapUnit ePoolUnit = pPool->GetMetric( SID_ATTR_FILL_HATCH );\n\n    \/\/ Hier werden die Max- und MinWerte in Ahaengigkeit von der\n    \/\/ WorkArea, PoolUnit und der FieldUnit:\n    SetMetricValue( aMtrFldX, aWorkArea.Left(), ePoolUnit );\n    long nValue = static_cast<long>(aMtrFldX.GetValue());\n    nValue = Fraction( nValue ) \/ aUIScale;\n    aMtrFldX.SetMin( nValue );\n    aMtrFldX.SetFirst( nValue );\n\n    SetMetricValue( aMtrFldX, aWorkArea.Right()+1, ePoolUnit );\n    nValue = static_cast<long>(aMtrFldX.GetValue());\n    nValue = Fraction( nValue ) \/ aUIScale;\n    aMtrFldX.SetMax( nValue );\n    aMtrFldX.SetLast( nValue );\n\n    SetMetricValue( aMtrFldY, aWorkArea.Top(), ePoolUnit );\n    nValue = static_cast<long>(aMtrFldY.GetValue());\n    nValue = Fraction( nValue ) \/ aUIScale;\n    aMtrFldY.SetMin( nValue );\n    aMtrFldY.SetFirst( nValue );\n\n    SetMetricValue( aMtrFldY, aWorkArea.Bottom()+1, ePoolUnit );\n    nValue = static_cast<long>(aMtrFldY.GetValue());\n    nValue = Fraction( nValue ) \/ aUIScale;\n    aMtrFldY.SetMax( nValue );\n    aMtrFldY.SetLast( nValue );\n\n    \/\/ Setzen der Werte\n    nXValue = ((const SfxUInt32Item&) rInAttrs.Get(ATTR_SNAPLINE_X)).GetValue();\n    nYValue = ((const SfxUInt32Item&) rInAttrs.Get(ATTR_SNAPLINE_Y)).GetValue();\n    nXValue = Fraction(nXValue) \/ aUIScale;\n    nYValue = Fraction(nYValue) \/ aUIScale;\n    SetMetricValue( aMtrFldX, nXValue, SFX_MAPUNIT_100TH_MM);\n    SetMetricValue( aMtrFldY, nYValue, SFX_MAPUNIT_100TH_MM);\n\n    aRbPoint.Check();\n}\n\n\/*************************************************************************\n|*\n|* Fuellt uebergebenes Item-Set mit Dialogbox-Attributen\n|*\n\\************************************************************************\/\n\nIMPL_LINK( SdSnapLineDlg, ClickHdl, Button *, pBtn )\n{\n    if ( pBtn == &aRbPoint )        SetInputFields(TRUE, TRUE);\n    else if ( pBtn == &aRbHorz )    SetInputFields(FALSE, TRUE);\n    else if ( pBtn == &aRbVert )    SetInputFields(TRUE, FALSE);\n    else if ( pBtn == &aBtnDelete ) EndDialog(RET_SNAP_DELETE);\n\n    return 0;\n}\n\n\/*************************************************************************\n|*\n|* Fuellt uebergebenes Item-Set mit Dialogbox-Attributen\n|*\n\\************************************************************************\/\n\nvoid SdSnapLineDlg::GetAttr(SfxItemSet& rOutAttrs)\n{\n    SnapKind eKind;\n\n    if ( aRbHorz.IsChecked() )      eKind = SK_HORIZONTAL;\n    else if ( aRbVert.IsChecked() ) eKind = SK_VERTICAL;\n    else                            eKind = SK_POINT;\n\n    nXValue = Fraction( GetCoreValue( aMtrFldX, SFX_MAPUNIT_100TH_MM) ) * aUIScale;\n    nYValue = Fraction( GetCoreValue( aMtrFldY, SFX_MAPUNIT_100TH_MM) ) * aUIScale;\n\n    rOutAttrs.Put(SfxAllEnumItem(ATTR_SNAPLINE_KIND, (USHORT)eKind));\n    rOutAttrs.Put(SfxUInt32Item(ATTR_SNAPLINE_X, nXValue));\n    rOutAttrs.Put(SfxUInt32Item(ATTR_SNAPLINE_Y, nYValue));\n}\n\n\/*************************************************************************\n|*\n|* Gruppe mit Radiobutton verstecken\n|*\n\\************************************************************************\/\n\nvoid SdSnapLineDlg::HideRadioGroup()\n{\n    aFlDir.Hide();\n    aRbHorz.Hide();\n    aRbVert.Hide();\n    aRbPoint.Hide();\n}\n\n\/*************************************************************************\n|*\n|* X- bzw. Y-Inputfeld disablen\n|*\n\\************************************************************************\/\n\nvoid SdSnapLineDlg::SetInputFields(BOOL bEnableX, BOOL bEnableY)\n{\n    if ( bEnableX )\n    {\n        if ( !aMtrFldX.IsEnabled() )\n            aMtrFldX.SetValue(nXValue);\n        aMtrFldX.Enable();\n        aFtX.Enable();\n    }\n    else if ( aMtrFldX.IsEnabled() )\n    {\n        nXValue = static_cast<long>(aMtrFldX.GetValue());\n        aMtrFldX.SetText(String());\n        aMtrFldX.Disable();\n        aFtX.Disable();\n    }\n    if ( bEnableY )\n    {\n        if ( !aMtrFldY.IsEnabled() )\n            aMtrFldY.SetValue(nYValue);\n        aMtrFldY.Enable();\n        aFtY.Enable();\n    }\n    else if ( aMtrFldY.IsEnabled() )\n    {\n        nYValue = static_cast<long>(aMtrFldY.GetValue());\n        aMtrFldY.SetText(String());\n        aMtrFldY.Disable();\n        aFtY.Disable();\n    }\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sduiexp.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: kz $ $Date: 2006-12-12 17:10:03 $\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#ifdef SD_DLLIMPLEMENTATION\n#undef SD_DLLIMPLEMENTATION\n#endif\n\n#include \"sddlgfact.hxx\"\n\n#ifndef _SAL_TYPES_H_\n#include \"sal\/types.h\"\n#endif\n\nnamespace sdui\n{\n    static SdAbstractDialogFactory_Impl* pFactory=NULL;\n    SdAbstractDialogFactory_Impl* GetFactory()\n    {\n        if ( !pFactory )\n            pFactory = new SdAbstractDialogFactory_Impl;\n        return pFactory;\n    }\n}\n\nextern \"C\"\n{\n    SAL_DLLPUBLIC_EXPORT SdAbstractDialogFactory* CreateDialogFactory()\n    {\n        return ::sdui::GetFactory();\n    }\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.298); FILE MERGED 2008\/04\/01 15:34:22 thb 1.6.298.2: #i85898# Stripping all external header guards 2008\/03\/31 13:57:49 rt 1.6.298.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: sduiexp.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_sd.hxx\"\n\n#ifdef SD_DLLIMPLEMENTATION\n#undef SD_DLLIMPLEMENTATION\n#endif\n\n#include \"sddlgfact.hxx\"\n#include \"sal\/types.h\"\n\nnamespace sdui\n{\n    static SdAbstractDialogFactory_Impl* pFactory=NULL;\n    SdAbstractDialogFactory_Impl* GetFactory()\n    {\n        if ( !pFactory )\n            pFactory = new SdAbstractDialogFactory_Impl;\n        return pFactory;\n    }\n}\n\nextern \"C\"\n{\n    SAL_DLLPUBLIC_EXPORT SdAbstractDialogFactory* CreateDialogFactory()\n    {\n        return ::sdui::GetFactory();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: fuarea.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: ka $ $Date: 2000-09-21 16:11:55 $\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#pragma hdrstop\n\n#include <svx\/svxids.hrc>\n#ifndef _SVX_TAB_AREA_HXX \/\/autogen\n#include <svx\/tabarea.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SFXVIEWFRM_HXX\n#include <sfx2\/viewfrm.hxx>\n#endif\n#ifndef _SFX_BINDINGS_HXX \/\/autogen\n#include <sfx2\/bindings.hxx>\n#endif\n#ifndef _SD_VIEWSHEL_HXX\n#include \"viewshel.hxx\"\n#endif\n\n#include \"drawdoc.hxx\"\n#include \"sdview.hxx\"\n#include \"sdwindow.hxx\"\n#include \"fuarea.hxx\"\n#include \"app.hrc\"\n\nTYPEINIT1( FuArea, FuPoor );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuArea::FuArea(SdViewShell* pViewSh, SdWindow* pWin, SdView* pView,\n               SdDrawDocument* pDoc, SfxRequest& rReq)\n    : FuPoor(pViewSh, pWin, pView, pDoc, rReq)\n{\n    const SfxItemSet* pArgs = rReq.GetArgs();\n\n    if( !pArgs )\n    {\n        \/\/ erst einmal alle eingabeparameter fuer den dialog retten\n        SfxItemSet aInputAttr( pDoc->GetPool() );\n        pView->GetAttributes( aInputAttr );\n\n        const XFillStyleItem    &rIFillStyleItem    = (const XFillStyleItem &) aInputAttr.Get (XATTR_FILLSTYLE);\n        const XFillColorItem    &rIFillColorItem    = (const XFillColorItem &) aInputAttr.Get (XATTR_FILLCOLOR);\n        const XFillGradientItem &rIFillGradientItem = (const XFillGradientItem &) aInputAttr.Get (XATTR_FILLGRADIENT);\n        const XFillHatchItem    &rIFillHatchItem    = (const XFillHatchItem &) aInputAttr.Get (XATTR_FILLHATCH);\n        const XFillBitmapItem   &rIXFillBitmapItem  = (const XFillBitmapItem &) aInputAttr.Get (XATTR_FILLBITMAP);\n\n        SfxItemSet* pNewAttr = new SfxItemSet( pDoc->GetPool() );\n        pView->GetAttributes( *pNewAttr );\n\n        SvxAreaTabDialog* pDlg = new SvxAreaTabDialog( NULL, pNewAttr, pDoc, pView );\n\n        if ( pDlg->Execute() == RET_OK )\n        {\n            pView->SetAttributes (*(pDlg->GetOutputItemSet ()));\n        }\n\n        \/\/ Attribute wurden geaendert, Listboxes in Objectbars muessen aktualisiert werden\n        static USHORT SidArray[] = {\n                        SID_ATTR_FILL_STYLE,\n                        SID_ATTR_FILL_COLOR,\n                        SID_ATTR_FILL_GRADIENT,\n                        SID_ATTR_FILL_HATCH,\n                        SID_ATTR_FILL_BITMAP,\n                        0 };\n\n        pViewShell->GetViewFrame()->GetBindings().Invalidate( SidArray );\n\n        delete pDlg;\n        delete pNewAttr;\n    }\n\n    rReq.Ignore ();\n\n}\n\n\n<commit_msg>INTEGRATION: CWS impress1 (1.2.262); FILE MERGED 2003\/09\/17 09:02:29 af 1.2.262.1: #111996# Transition to stacked sub-shells. Introduction of namespace sd.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: fuarea.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2004-01-20 10:55:56 $\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#pragma hdrstop\n\n#include \"fuarea.hxx\"\n\n#include <svx\/svxids.hrc>\n#ifndef _SVX_TAB_AREA_HXX \/\/autogen\n#include <svx\/tabarea.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SFXVIEWFRM_HXX\n#include <sfx2\/viewfrm.hxx>\n#endif\n#ifndef _SFX_BINDINGS_HXX \/\/autogen\n#include <sfx2\/bindings.hxx>\n#endif\n#ifndef SD_VIEW_SHELL_HXX\n#include \"ViewShell.hxx\"\n#endif\n\n#include \"drawdoc.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n#include \"app.hrc\"\n\nnamespace sd {\n\nTYPEINIT1( FuArea, FuPoor );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuArea::FuArea (\n    ViewShell* pViewSh,\n    ::sd::Window* pWin,\n    ::sd::View* pView,\n    SdDrawDocument* pDoc,\n    SfxRequest& rReq)\n    : FuPoor(pViewSh, pWin, pView, pDoc, rReq)\n{\n    const SfxItemSet* pArgs = rReq.GetArgs();\n\n    if( !pArgs )\n    {\n        \/\/ erst einmal alle eingabeparameter fuer den dialog retten\n        SfxItemSet aInputAttr( pDoc->GetPool() );\n        pView->GetAttributes( aInputAttr );\n\n        const XFillStyleItem    &rIFillStyleItem    = (const XFillStyleItem &) aInputAttr.Get (XATTR_FILLSTYLE);\n        const XFillColorItem    &rIFillColorItem    = (const XFillColorItem &) aInputAttr.Get (XATTR_FILLCOLOR);\n        const XFillGradientItem &rIFillGradientItem = (const XFillGradientItem &) aInputAttr.Get (XATTR_FILLGRADIENT);\n        const XFillHatchItem    &rIFillHatchItem    = (const XFillHatchItem &) aInputAttr.Get (XATTR_FILLHATCH);\n        const XFillBitmapItem   &rIXFillBitmapItem  = (const XFillBitmapItem &) aInputAttr.Get (XATTR_FILLBITMAP);\n\n        SfxItemSet* pNewAttr = new SfxItemSet( pDoc->GetPool() );\n        pView->GetAttributes( *pNewAttr );\n\n        SvxAreaTabDialog* pDlg = new SvxAreaTabDialog( NULL, pNewAttr, pDoc, pView );\n\n        if ( pDlg->Execute() == RET_OK )\n        {\n            pView->SetAttributes (*(pDlg->GetOutputItemSet ()));\n        }\n\n        \/\/ Attribute wurden geaendert, Listboxes in Objectbars muessen aktualisiert werden\n        static USHORT SidArray[] = {\n                        SID_ATTR_FILL_STYLE,\n                        SID_ATTR_FILL_COLOR,\n                        SID_ATTR_FILL_GRADIENT,\n                        SID_ATTR_FILL_HATCH,\n                        SID_ATTR_FILL_BITMAP,\n                        0 };\n\n        pViewShell->GetViewFrame()->GetBindings().Invalidate( SidArray );\n\n        delete pDlg;\n        delete pNewAttr;\n    }\n\n    rReq.Ignore ();\n\n}\n\n} \/\/ end of namespace sd\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: futhes.cxx,v $\n *\n *  $Revision: 1.11 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 04:52: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#pragma hdrstop\n\n#include \"futhes.hxx\"\n\n#include <tools\/pstm.hxx>\n#include <svx\/outliner.hxx>\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SVDOBJ_HXX \/\/autogen\n#include <svx\/svdobj.hxx>\n#endif\n#ifndef _SVDOTEXT_HXX \/\/autogen\n#include <svx\/svdotext.hxx>\n#endif\n\n#ifndef _EEITEM_HXX\n#include <svx\/eeitem.hxx>\n#endif\n\n#define ITEMID_LANGUAGE         SID_ATTR_CHAR_LANGUAGE\n#include <svx\/dialogs.hrc>\n#include <svx\/svxerr.hxx>\n#include <svx\/dialmgr.hxx>\n\n#ifndef _UNO_LINGU_HXX\n#include <svx\/unolingu.hxx>\n#endif\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n#include \"app.hrc\"\n#include \"strings.hrc\"\n#include \"drawdoc.hxx\"\n#include \"app.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#ifndef SD_OUTLINER_HXX\n#include \"Outliner.hxx\"\n#endif\n#ifndef SD_DRAW_VIEW_SHELL_HXX\n#include \"DrawViewShell.hxx\"\n#endif\n#ifndef SD_OUTLINE_VIEW_SHELL_HXX\n#include \"OutlineViewShell.hxx\"\n#endif\n#ifndef SD_WINDOW_SHELL_HXX\n#include \"Window.hxx\"\n#endif\n#include \"sdresid.hxx\"\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::linguistic2;\n\nclass SfxRequest;\n\nnamespace sd {\n\nTYPEINIT1( FuThesaurus, FuPoor );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuThesaurus::FuThesaurus( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView,\n                  SdDrawDocument* pDoc, SfxRequest& rReq )\n       : FuPoor(pViewSh, pWin, pView, pDoc, rReq)\n{\n    SfxErrorContext aContext(ERRCTX_SVX_LINGU_THESAURUS, String(),\n                             pWin, RID_SVXERRCTX, DIALOG_MGR() );\n\n    if ( pViewShell->ISA(DrawViewShell) )\n    {\n        SdrTextObj* pTextObj = NULL;\n\n        if ( pView->AreObjectsMarked() )\n        {\n            const SdrMarkList& rMarkList = pView->GetMarkedObjectList();\n\n            if ( rMarkList.GetMarkCount() == 1 )\n            {\n                SdrMark* pMark = rMarkList.GetMark(0);\n                SdrObject* pObj = pMark->GetObj();\n\n                if ( pObj->ISA(SdrTextObj) )\n                {\n                    pTextObj = (SdrTextObj*) pObj;\n                }\n            }\n        }\n\n        ::Outliner* pOutliner = pView->GetTextEditOutliner();\n        const OutlinerView* pOutlView = pView->GetTextEditOutlinerView();\n\n        if ( pTextObj && pOutliner && pOutlView )\n        {\n            if ( !pOutliner->GetSpeller().is() )\n            {\n                Reference< XSpellChecker1 > xSpellChecker( LinguMgr::GetSpellChecker() );\n                if ( xSpellChecker.is() )\n                    pOutliner->SetSpeller( xSpellChecker );\n\n                Reference< XHyphenator > xHyphenator( LinguMgr::GetHyphenator() );\n                if( xHyphenator.is() )\n                    pOutliner->SetHyphenator( xHyphenator );\n\n                pOutliner->SetDefaultLanguage( pDoc->GetLanguage( EE_CHAR_LANGUAGE ) );\n            }\n\n            EESpellState eState = ( (OutlinerView*) pOutlView)->StartThesaurus();\n            DBG_ASSERT(eState != EE_SPELL_NOSPELLER, \"No SpellChecker\");\n\n            if (eState == EE_SPELL_NOLANGUAGE)\n            {\n                ErrorBox(pWindow, WB_OK, String(SdResId(STR_NOLANGUAGE))).Execute();\n            }\n        }\n    }\n    else if ( pViewShell->ISA(OutlineViewShell) )\n    {\n        Outliner* pOutliner = pDoc->GetOutliner();\n        OutlinerView* pOutlView = pOutliner->GetView(0);\n\n        if ( !pOutliner->GetSpeller().is() )\n        {\n            Reference< XSpellChecker1 > xSpellChecker( LinguMgr::GetSpellChecker() );\n            if ( xSpellChecker.is() )\n                pOutliner->SetSpeller( xSpellChecker );\n\n            Reference< XHyphenator > xHyphenator( LinguMgr::GetHyphenator() );\n            if( xHyphenator.is() )\n                pOutliner->SetHyphenator( xHyphenator );\n\n            pOutliner->SetDefaultLanguage( pDoc->GetLanguage( EE_CHAR_LANGUAGE ) );\n        }\n\n        EESpellState eState = pOutlView->StartThesaurus();\n        DBG_ASSERT(eState != EE_SPELL_NOSPELLER, \"No SpellChecker\");\n\n        if (eState == EE_SPELL_NOLANGUAGE)\n        {\n            ErrorBox(pWindow, WB_OK, String(SdResId(STR_NOLANGUAGE))).Execute();\n        }\n    }\n}\n\n\n\n\/*************************************************************************\n|*\n|* Destruktor\n|*\n\\************************************************************************\/\nFuThesaurus::~FuThesaurus()\n{\n}\n\n\n} \/\/ end of namespace sd\n<commit_msg>INTEGRATION: CWS impressfunctions (1.11.40); FILE MERGED 2005\/10\/28 12:03:14 cl 1.11.40.2: #125341# fixed unix build problems 2005\/10\/28 10:57:42 cl 1.11.40.1: #125341# reworked FuPoor classes to use refcounting<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: futhes.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: rt $ $Date: 2005-12-14 17:05: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#pragma hdrstop\n\n#include \"futhes.hxx\"\n\n#include <tools\/pstm.hxx>\n#include <svx\/outliner.hxx>\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SVDOBJ_HXX \/\/autogen\n#include <svx\/svdobj.hxx>\n#endif\n#ifndef _SVDOTEXT_HXX \/\/autogen\n#include <svx\/svdotext.hxx>\n#endif\n\n#ifndef _EEITEM_HXX\n#include <svx\/eeitem.hxx>\n#endif\n\n#define ITEMID_LANGUAGE         SID_ATTR_CHAR_LANGUAGE\n#include <svx\/dialogs.hrc>\n#include <svx\/svxerr.hxx>\n#include <svx\/dialmgr.hxx>\n\n#ifndef _UNO_LINGU_HXX\n#include <svx\/unolingu.hxx>\n#endif\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n#include \"app.hrc\"\n#include \"strings.hrc\"\n#include \"drawdoc.hxx\"\n#include \"app.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#ifndef SD_OUTLINER_HXX\n#include \"Outliner.hxx\"\n#endif\n#ifndef SD_DRAW_VIEW_SHELL_HXX\n#include \"DrawViewShell.hxx\"\n#endif\n#ifndef SD_OUTLINE_VIEW_SHELL_HXX\n#include \"OutlineViewShell.hxx\"\n#endif\n#ifndef SD_WINDOW_SHELL_HXX\n#include \"Window.hxx\"\n#endif\n#include \"sdresid.hxx\"\n\nusing ::rtl::OUString;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::linguistic2;\n\nclass SfxRequest;\n\nnamespace sd {\n\nTYPEINIT1( FuThesaurus, FuPoor );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuThesaurus::FuThesaurus( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView,\n                  SdDrawDocument* pDoc, SfxRequest& rReq )\n       : FuPoor(pViewSh, pWin, pView, pDoc, rReq)\n{\n}\n\nFunctionReference FuThesaurus::Create( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView, SdDrawDocument* pDoc, SfxRequest& rReq )\n{\n    FunctionReference xFunc( new FuThesaurus( pViewSh, pWin, pView, pDoc, rReq ) );\n    xFunc->DoExecute(rReq);\n    return xFunc;\n}\n\nvoid FuThesaurus::DoExecute( SfxRequest& rReq )\n{\n    SfxErrorContext aContext(ERRCTX_SVX_LINGU_THESAURUS, String(),\n                             pWindow, RID_SVXERRCTX, DIALOG_MGR() );\n\n    if( pViewShell && pViewShell->ISA(DrawViewShell) )\n    {\n        SdrTextObj* pTextObj = NULL;\n\n        if ( pView->AreObjectsMarked() )\n        {\n            const SdrMarkList& rMarkList = pView->GetMarkedObjectList();\n\n            if ( rMarkList.GetMarkCount() == 1 )\n            {\n                SdrMark* pMark = rMarkList.GetMark(0);\n                SdrObject* pObj = pMark->GetObj();\n\n                if ( pObj->ISA(SdrTextObj) )\n                {\n                    pTextObj = (SdrTextObj*) pObj;\n                }\n            }\n        }\n\n        ::Outliner* pOutliner = pView->GetTextEditOutliner();\n        const OutlinerView* pOutlView = pView->GetTextEditOutlinerView();\n\n        if ( pTextObj && pOutliner && pOutlView )\n        {\n            if ( !pOutliner->GetSpeller().is() )\n            {\n                Reference< XSpellChecker1 > xSpellChecker( LinguMgr::GetSpellChecker() );\n                if ( xSpellChecker.is() )\n                    pOutliner->SetSpeller( xSpellChecker );\n\n                Reference< XHyphenator > xHyphenator( LinguMgr::GetHyphenator() );\n                if( xHyphenator.is() )\n                    pOutliner->SetHyphenator( xHyphenator );\n\n                pOutliner->SetDefaultLanguage( pDoc->GetLanguage( EE_CHAR_LANGUAGE ) );\n            }\n\n            EESpellState eState = ( (OutlinerView*) pOutlView)->StartThesaurus();\n            DBG_ASSERT(eState != EE_SPELL_NOSPELLER, \"No SpellChecker\");\n\n            if (eState == EE_SPELL_NOLANGUAGE)\n            {\n                ErrorBox(pWindow, WB_OK, String(SdResId(STR_NOLANGUAGE))).Execute();\n            }\n        }\n    }\n    else if ( pViewShell->ISA(OutlineViewShell) )\n    {\n        Outliner* pOutliner = pDoc->GetOutliner();\n        OutlinerView* pOutlView = pOutliner->GetView(0);\n\n        if ( !pOutliner->GetSpeller().is() )\n        {\n            Reference< XSpellChecker1 > xSpellChecker( LinguMgr::GetSpellChecker() );\n            if ( xSpellChecker.is() )\n                pOutliner->SetSpeller( xSpellChecker );\n\n            Reference< XHyphenator > xHyphenator( LinguMgr::GetHyphenator() );\n            if( xHyphenator.is() )\n                pOutliner->SetHyphenator( xHyphenator );\n\n            pOutliner->SetDefaultLanguage( pDoc->GetLanguage( EE_CHAR_LANGUAGE ) );\n        }\n\n        EESpellState eState = pOutlView->StartThesaurus();\n        DBG_ASSERT(eState != EE_SPELL_NOSPELLER, \"No SpellChecker\");\n\n        if (eState == EE_SPELL_NOLANGUAGE)\n        {\n            ErrorBox(pWindow, WB_OK, String(SdResId(STR_NOLANGUAGE))).Execute();\n        }\n    }\n}\n\n} \/\/ end of namespace sd\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: futhes.cxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 18:57: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\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n\n#include \"futhes.hxx\"\n\n#include <tools\/pstm.hxx>\n#include <svx\/outliner.hxx>\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SVDOBJ_HXX \/\/autogen\n#include <svx\/svdobj.hxx>\n#endif\n#ifndef _SVDOTEXT_HXX \/\/autogen\n#include <svx\/svdotext.hxx>\n#endif\n\n#ifndef _EEITEM_HXX\n#include <svx\/eeitem.hxx>\n#endif\n\n#define ITEMID_LANGUAGE         SID_ATTR_CHAR_LANGUAGE\n#include <svx\/dialogs.hrc>\n#include <svx\/svxerr.hxx>\n#include <svx\/dialmgr.hxx>\n\n#ifndef _UNO_LINGU_HXX\n#include <svx\/unolingu.hxx>\n#endif\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n#include \"app.hrc\"\n#include \"strings.hrc\"\n#include \"drawdoc.hxx\"\n#include \"app.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#ifndef SD_OUTLINER_HXX\n#include \"Outliner.hxx\"\n#endif\n#ifndef SD_DRAW_VIEW_SHELL_HXX\n#include \"DrawViewShell.hxx\"\n#endif\n#ifndef SD_OUTLINE_VIEW_SHELL_HXX\n#include \"OutlineViewShell.hxx\"\n#endif\n#ifndef SD_WINDOW_SHELL_HXX\n#include \"Window.hxx\"\n#endif\n#include \"sdresid.hxx\"\n\nusing ::rtl::OUString;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::linguistic2;\n\nclass SfxRequest;\n\nnamespace sd {\n\nTYPEINIT1( FuThesaurus, FuPoor );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuThesaurus::FuThesaurus( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView,\n                  SdDrawDocument* pDoc, SfxRequest& rReq )\n       : FuPoor(pViewSh, pWin, pView, pDoc, rReq)\n{\n}\n\nFunctionReference FuThesaurus::Create( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView, SdDrawDocument* pDoc, SfxRequest& rReq )\n{\n    FunctionReference xFunc( new FuThesaurus( pViewSh, pWin, pView, pDoc, rReq ) );\n    xFunc->DoExecute(rReq);\n    return xFunc;\n}\n\nvoid FuThesaurus::DoExecute( SfxRequest& rReq )\n{\n    SfxErrorContext aContext(ERRCTX_SVX_LINGU_THESAURUS, String(),\n                             pWindow, RID_SVXERRCTX, DIALOG_MGR() );\n\n    if( pViewShell && pViewShell->ISA(DrawViewShell) )\n    {\n        SdrTextObj* pTextObj = NULL;\n\n        if ( pView->AreObjectsMarked() )\n        {\n            const SdrMarkList& rMarkList = pView->GetMarkedObjectList();\n\n            if ( rMarkList.GetMarkCount() == 1 )\n            {\n                SdrMark* pMark = rMarkList.GetMark(0);\n                SdrObject* pObj = pMark->GetMarkedSdrObj();\n\n                if ( pObj->ISA(SdrTextObj) )\n                {\n                    pTextObj = (SdrTextObj*) pObj;\n                }\n            }\n        }\n\n        ::Outliner* pOutliner = pView->GetTextEditOutliner();\n        const OutlinerView* pOutlView = pView->GetTextEditOutlinerView();\n\n        if ( pTextObj && pOutliner && pOutlView )\n        {\n            if ( !pOutliner->GetSpeller().is() )\n            {\n                Reference< XSpellChecker1 > xSpellChecker( LinguMgr::GetSpellChecker() );\n                if ( xSpellChecker.is() )\n                    pOutliner->SetSpeller( xSpellChecker );\n\n                Reference< XHyphenator > xHyphenator( LinguMgr::GetHyphenator() );\n                if( xHyphenator.is() )\n                    pOutliner->SetHyphenator( xHyphenator );\n\n                pOutliner->SetDefaultLanguage( pDoc->GetLanguage( EE_CHAR_LANGUAGE ) );\n            }\n\n            EESpellState eState = ( (OutlinerView*) pOutlView)->StartThesaurus();\n            DBG_ASSERT(eState != EE_SPELL_NOSPELLER, \"No SpellChecker\");\n\n            if (eState == EE_SPELL_NOLANGUAGE)\n            {\n                ErrorBox(pWindow, WB_OK, String(SdResId(STR_NOLANGUAGE))).Execute();\n            }\n        }\n    }\n    else if ( pViewShell->ISA(OutlineViewShell) )\n    {\n        Outliner* pOutliner = pDoc->GetOutliner();\n        OutlinerView* pOutlView = pOutliner->GetView(0);\n\n        if ( !pOutliner->GetSpeller().is() )\n        {\n            Reference< XSpellChecker1 > xSpellChecker( LinguMgr::GetSpellChecker() );\n            if ( xSpellChecker.is() )\n                pOutliner->SetSpeller( xSpellChecker );\n\n            Reference< XHyphenator > xHyphenator( LinguMgr::GetHyphenator() );\n            if( xHyphenator.is() )\n                pOutliner->SetHyphenator( xHyphenator );\n\n            pOutliner->SetDefaultLanguage( pDoc->GetLanguage( EE_CHAR_LANGUAGE ) );\n        }\n\n        EESpellState eState = pOutlView->StartThesaurus();\n        DBG_ASSERT(eState != EE_SPELL_NOSPELLER, \"No SpellChecker\");\n\n        if (eState == EE_SPELL_NOLANGUAGE)\n        {\n            ErrorBox(pWindow, WB_OK, String(SdResId(STR_NOLANGUAGE))).Execute();\n        }\n    }\n}\n\n} \/\/ end of namespace sd\n<commit_msg>INTEGRATION: CWS sdwarningsbegone (1.14.38); FILE MERGED 2006\/11\/22 12:41:57 cl 1.14.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: futhes.cxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: kz $ $Date: 2006-12-12 17:25:52 $\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\n#include \"futhes.hxx\"\n\n#include <tools\/pstm.hxx>\n#include <svx\/outliner.hxx>\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SVDOBJ_HXX \/\/autogen\n#include <svx\/svdobj.hxx>\n#endif\n#ifndef _SVDOTEXT_HXX \/\/autogen\n#include <svx\/svdotext.hxx>\n#endif\n\n#ifndef _EEITEM_HXX\n#include <svx\/eeitem.hxx>\n#endif\n\n#define ITEMID_LANGUAGE         SID_ATTR_CHAR_LANGUAGE\n#include <svx\/dialogs.hrc>\n#include <svx\/svxerr.hxx>\n#include <svx\/dialmgr.hxx>\n\n#ifndef _UNO_LINGU_HXX\n#include <svx\/unolingu.hxx>\n#endif\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n#include \"app.hrc\"\n#include \"strings.hrc\"\n#include \"drawdoc.hxx\"\n#include \"app.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#ifndef SD_OUTLINER_HXX\n#include \"Outliner.hxx\"\n#endif\n#ifndef SD_DRAW_VIEW_SHELL_HXX\n#include \"DrawViewShell.hxx\"\n#endif\n#ifndef SD_OUTLINE_VIEW_SHELL_HXX\n#include \"OutlineViewShell.hxx\"\n#endif\n#ifndef SD_WINDOW_SHELL_HXX\n#include \"Window.hxx\"\n#endif\n#include \"sdresid.hxx\"\n\nusing ::rtl::OUString;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::linguistic2;\n\nclass SfxRequest;\n\nnamespace sd {\n\nTYPEINIT1( FuThesaurus, FuPoor );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuThesaurus::FuThesaurus( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView,\n                  SdDrawDocument* pDoc, SfxRequest& rReq )\n       : FuPoor(pViewSh, pWin, pView, pDoc, rReq)\n{\n}\n\nFunctionReference FuThesaurus::Create( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView, SdDrawDocument* pDoc, SfxRequest& rReq )\n{\n    FunctionReference xFunc( new FuThesaurus( pViewSh, pWin, pView, pDoc, rReq ) );\n    xFunc->DoExecute(rReq);\n    return xFunc;\n}\n\nvoid FuThesaurus::DoExecute( SfxRequest& )\n{\n    SfxErrorContext aContext(ERRCTX_SVX_LINGU_THESAURUS, String(),\n                             mpWindow, RID_SVXERRCTX, DIALOG_MGR() );\n\n    if( mpViewShell && mpViewShell->ISA(DrawViewShell) )\n    {\n        SdrTextObj* pTextObj = NULL;\n\n        if ( mpView->AreObjectsMarked() )\n        {\n            const SdrMarkList& rMarkList = mpView->GetMarkedObjectList();\n\n            if ( rMarkList.GetMarkCount() == 1 )\n            {\n                SdrMark* pMark = rMarkList.GetMark(0);\n                SdrObject* pObj = pMark->GetMarkedSdrObj();\n\n                if ( pObj->ISA(SdrTextObj) )\n                {\n                    pTextObj = (SdrTextObj*) pObj;\n                }\n            }\n        }\n\n        ::Outliner* pOutliner = mpView->GetTextEditOutliner();\n        const OutlinerView* pOutlView = mpView->GetTextEditOutlinerView();\n\n        if ( pTextObj && pOutliner && pOutlView )\n        {\n            if ( !pOutliner->GetSpeller().is() )\n            {\n                Reference< XSpellChecker1 > xSpellChecker( LinguMgr::GetSpellChecker() );\n                if ( xSpellChecker.is() )\n                    pOutliner->SetSpeller( xSpellChecker );\n\n                Reference< XHyphenator > xHyphenator( LinguMgr::GetHyphenator() );\n                if( xHyphenator.is() )\n                    pOutliner->SetHyphenator( xHyphenator );\n\n                pOutliner->SetDefaultLanguage( mpDoc->GetLanguage( EE_CHAR_LANGUAGE ) );\n            }\n\n            EESpellState eState = ( (OutlinerView*) pOutlView)->StartThesaurus();\n            DBG_ASSERT(eState != EE_SPELL_NOSPELLER, \"No SpellChecker\");\n\n            if (eState == EE_SPELL_NOLANGUAGE)\n            {\n                ErrorBox(mpWindow, WB_OK, String(SdResId(STR_NOLANGUAGE))).Execute();\n            }\n        }\n    }\n    else if ( mpViewShell->ISA(OutlineViewShell) )\n    {\n        Outliner* pOutliner = mpDoc->GetOutliner();\n        OutlinerView* pOutlView = pOutliner->GetView(0);\n\n        if ( !pOutliner->GetSpeller().is() )\n        {\n            Reference< XSpellChecker1 > xSpellChecker( LinguMgr::GetSpellChecker() );\n            if ( xSpellChecker.is() )\n                pOutliner->SetSpeller( xSpellChecker );\n\n            Reference< XHyphenator > xHyphenator( LinguMgr::GetHyphenator() );\n            if( xHyphenator.is() )\n                pOutliner->SetHyphenator( xHyphenator );\n\n            pOutliner->SetDefaultLanguage( mpDoc->GetLanguage( EE_CHAR_LANGUAGE ) );\n        }\n\n        EESpellState eState = pOutlView->StartThesaurus();\n        DBG_ASSERT(eState != EE_SPELL_NOSPELLER, \"No SpellChecker\");\n\n        if (eState == EE_SPELL_NOLANGUAGE)\n        {\n            ErrorBox(mpWindow, WB_OK, String(SdResId(STR_NOLANGUAGE))).Execute();\n        }\n    }\n}\n\n} \/\/ end of namespace sd\n<|endoftext|>"}
{"text":"<commit_before>#ifndef GROW_CLOUD_HPP_\n#define GROW_CLOUD_HPP_\n\n#include <iostream>\n\n#include <lcm\/lcm.h>\n\n#include \"pcl\/io\/pcd_io.h\"\n#include \"pcl\/point_types.h\"\n\n\/\/ Find Floor:\n#include \"pcl\/ModelCoefficients.h\"\n#include \"pcl\/segmentation\/sac_segmentation.h\"\n#include \"pcl\/sample_consensus\/method_types.h\"\n#include \"pcl\/sample_consensus\/model_types.h\"\n\/\/ person filtering:\n#include <pcl\/filters\/passthrough.h>\n#include \"pcl\/filters\/conditional_removal.h\"\n#include \"pcl\/filters\/statistical_outlier_removal.h\"\n#include \"pcl\/filters\/extract_indices.h\"\n\/\/ Plane Extractions:\n#include \"pcl\/filters\/voxel_grid.h\"\n#include \"pcl\/filters\/project_inliers.h\"\n#include \"pcl\/surface\/convex_hull.h\"\n#include \"pcl\/surface\/concave_hull.h\"\n#include \"pcl\/PolygonMesh.h\"\n#include \"pcl\/octree\/octree.h\"\n\n\n#include <pronto_utils\/pronto_vis.hpp> \/\/ visualize pt clds\n\nusing namespace std;\ntypedef pcl::PointXYZRGB PointT;\n\/\/ removed due to conflict with VS_SLAM\n\/\/typedef pcl::PointCloud<pcl::PointXYZRGB>::Ptr PointCloudPtr;\n\n\n\ntypedef struct _BasicPlane\n{\n  int64_t utime;\n  std::string name; \/\/ a unique name eg the file name\n  int major; \/\/ which major plane \n  int minor; \/\/ which minor plane\n  \/\/Hull of Plane (either convex or concave - depending on algorithm)\n  pcl::PointCloud<pcl::PointXYZRGB> cloud ;\n   pcl::ModelCoefficients coeffs;  \n  Eigen::Vector4f centroid;\n\n  \/\/ this number of points in the original soure cloud.\n  \/\/ Used for voting when combining to a final cloud\n  int n_source_points; \n  \n  \/\/ New members added in jun17_2011: mfallon\n  EIGEN_ALIGN16 Eigen::Matrix3f covariance_matrix;\n  Eigen::Affine3f transform000; \/\/ transform to move the plane to 0,0,0 [ie centroid=0,0,0] aligned to the x,y axis (i think)\n  \n  EIGEN_MAKE_ALIGNED_OPERATOR_NEW \n  \n} BasicPlane;\n\n\n\n\nclass GrowCloud {\n  public:\n    GrowCloud (); \n\n    inline void setInputCloud (const pcl::PointCloud<pcl::PointXYZRGB>::Ptr &input)\n    {\n      incloud   = input;\n    }    \n\n    virtual inline void setLCM(lcm_t *publish_lcm_in){\n      publish_lcm = publish_lcm_in;\n    }    \n\n    \n    \n    \n    \/\/ function to 'grow' point cloud from a set of points, \n    \/\/ seperatating disconnected points into different cloud using octrees\n    \/\/ @input: a point cloud with all points on a plane. points may be from disconnected clouds\n    \/\/ @output: individual clouds    \n    void doGrowCloud (vector<BasicPlane> &outstack);\n    \n    virtual inline void setMinCloudSize(int min_cloud_size_in){\n      min_cloud_size_ = min_cloud_size_in;\n    }    \n    \n    \/\/ function to return a plane stack's coeffs in string\n    void printPlaneStackCoeffs (vector<BasicPlane> &planeStack,  std::stringstream &ss);\n    \/\/ ditto for the bounding points \n    void printPlaneStackHull (vector<BasicPlane> &planeStack,  std::stringstream &ss);\n    \n    void visualizePlanes(vector<BasicPlane> &plane_stack,pronto_vis* pc_vis_ , int null_id );\n    \n  protected:\n    pcl::PointCloud<pcl::PointXYZRGB>::Ptr incloud;    \n    \n    \/\/ the pose that this cloud is connected to (so as to publish onto a collections pose)\n    \/\/ if pose_coll_id is negative, don't publish to LCM:\n    int pose_coll_id;\n    int64_t pose_element_id;\n    \n    int verbose_text;\n    int verbose_lcm;\n    lcm_t *publish_lcm;     \n    \n    \/\/ settings:\n    int min_cloud_size_;\n};\n\n#endif  \/\/#ifndef _GROW_CLOUD_HPP_\n<commit_msg>minor change for ubuntu 16<commit_after>#ifndef GROW_CLOUD_HPP_\n#define GROW_CLOUD_HPP_\n\n#include <iostream>\n\n#include <lcm\/lcm.h>\n\n#include \"pcl\/io\/pcd_io.h\"\n#include \"pcl\/point_types.h\"\n\n\/\/ Find Floor:\n#include \"pcl\/ModelCoefficients.h\"\n#include \"pcl\/segmentation\/sac_segmentation.h\"\n#include \"pcl\/sample_consensus\/method_types.h\"\n#include \"pcl\/sample_consensus\/model_types.h\"\n\/\/ person filtering:\n#include <pcl\/filters\/passthrough.h>\n#include \"pcl\/filters\/conditional_removal.h\"\n#include \"pcl\/filters\/statistical_outlier_removal.h\"\n#include \"pcl\/filters\/extract_indices.h\"\n\/\/ Plane Extractions:\n#include \"pcl\/filters\/voxel_grid.h\"\n#include \"pcl\/filters\/project_inliers.h\"\n#include \"pcl\/surface\/convex_hull.h\"\n#include \"pcl\/surface\/concave_hull.h\"\n#include \"pcl\/PolygonMesh.h\"\n#include \"pcl\/octree\/octree.h\"\n#include \"pcl\/common\/centroid.h\"\n\n#include <pronto_utils\/pronto_vis.hpp> \/\/ visualize pt clds\n\nusing namespace std;\ntypedef pcl::PointXYZRGB PointT;\n\/\/ removed due to conflict with VS_SLAM\n\/\/typedef pcl::PointCloud<pcl::PointXYZRGB>::Ptr PointCloudPtr;\n\n\n\ntypedef struct _BasicPlane\n{\n  int64_t utime;\n  std::string name; \/\/ a unique name eg the file name\n  int major; \/\/ which major plane \n  int minor; \/\/ which minor plane\n  \/\/Hull of Plane (either convex or concave - depending on algorithm)\n  pcl::PointCloud<pcl::PointXYZRGB> cloud ;\n   pcl::ModelCoefficients coeffs;  \n  Eigen::Vector4f centroid;\n\n  \/\/ this number of points in the original soure cloud.\n  \/\/ Used for voting when combining to a final cloud\n  int n_source_points; \n  \n  \/\/ New members added in jun17_2011: mfallon\n  EIGEN_ALIGN16 Eigen::Matrix3f covariance_matrix;\n  Eigen::Affine3f transform000; \/\/ transform to move the plane to 0,0,0 [ie centroid=0,0,0] aligned to the x,y axis (i think)\n  \n  EIGEN_MAKE_ALIGNED_OPERATOR_NEW \n  \n} BasicPlane;\n\n\n\n\nclass GrowCloud {\n  public:\n    GrowCloud (); \n\n    inline void setInputCloud (const pcl::PointCloud<pcl::PointXYZRGB>::Ptr &input)\n    {\n      incloud   = input;\n    }    \n\n    virtual inline void setLCM(lcm_t *publish_lcm_in){\n      publish_lcm = publish_lcm_in;\n    }    \n\n    \n    \n    \n    \/\/ function to 'grow' point cloud from a set of points, \n    \/\/ seperatating disconnected points into different cloud using octrees\n    \/\/ @input: a point cloud with all points on a plane. points may be from disconnected clouds\n    \/\/ @output: individual clouds    \n    void doGrowCloud (vector<BasicPlane> &outstack);\n    \n    virtual inline void setMinCloudSize(int min_cloud_size_in){\n      min_cloud_size_ = min_cloud_size_in;\n    }    \n    \n    \/\/ function to return a plane stack's coeffs in string\n    void printPlaneStackCoeffs (vector<BasicPlane> &planeStack,  std::stringstream &ss);\n    \/\/ ditto for the bounding points \n    void printPlaneStackHull (vector<BasicPlane> &planeStack,  std::stringstream &ss);\n    \n    void visualizePlanes(vector<BasicPlane> &plane_stack,pronto_vis* pc_vis_ , int null_id );\n    \n  protected:\n    pcl::PointCloud<pcl::PointXYZRGB>::Ptr incloud;    \n    \n    \/\/ the pose that this cloud is connected to (so as to publish onto a collections pose)\n    \/\/ if pose_coll_id is negative, don't publish to LCM:\n    int pose_coll_id;\n    int64_t pose_element_id;\n    \n    int verbose_text;\n    int verbose_lcm;\n    lcm_t *publish_lcm;     \n    \n    \/\/ settings:\n    int min_cloud_size_;\n};\n\n#endif  \/\/#ifndef _GROW_CLOUD_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\nstatic void (*real_one) ();\nstatic void stub(){}\n\n\/* in CheatSheetTest.cpp *\/\n#include \"CppUTest\/TestHarness.h\"\n\n\/* Declare TestGroup with name CheatSheet *\/\nTEST_GROUP(CheatSheet)\n{\n\/* declare a setup method for the test group. Optional. *\/\n    void setup ()\n    {\n\/* Set method real_one to stub. Automatically restore in teardown *\/\n        UT_PTR_SET(real_one, stub);\n    }\n\n\/* Declare a teardown method for the test group. Optional *\/\n    void teardown()\n    {\n    }\n}; \/* Do not forget semicolumn *\/\n\n\/* Declare one test within the test group *\/\nTEST(CheatSheet, TestName)\n{\n    \/* Check two longs are equal *\/\n    LONGS_EQUAL(1, 2);\n\n    \/* Check a condition *\/\n    CHECK(true == true);\n\n    \/* Check a string *\/\n    STRCMP_EQUAL(\"HelloWorld\", \"HelloWorld\");\n}\n\n<commit_msg>Remove intentional failure again, so build can pass<commit_after>\nstatic void (*real_one) ();\nstatic void stub(){}\n\n\/* in CheatSheetTest.cpp *\/\n#include \"CppUTest\/TestHarness.h\"\n\n\/* Declare TestGroup with name CheatSheet *\/\nTEST_GROUP(CheatSheet)\n{\n\/* declare a setup method for the test group. Optional. *\/\n    void setup ()\n    {\n\/* Set method real_one to stub. Automatically restore in teardown *\/\n        UT_PTR_SET(real_one, stub);\n    }\n\n\/* Declare a teardown method for the test group. Optional *\/\n    void teardown()\n    {\n    }\n}; \/* Do not forget semicolumn *\/\n\n\/* Declare one test within the test group *\/\nTEST(CheatSheet, TestName)\n{\n    \/* Check two longs are equal *\/\n    LONGS_EQUAL(1, 1);\n\n    \/* Check a condition *\/\n    CHECK(true == true);\n\n    \/* Check a string *\/\n    STRCMP_EQUAL(\"HelloWorld\", \"HelloWorld\");\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\/prediction\/prediction.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <vector>\n\n#include \"boost\/filesystem.hpp\"\n#include \"boost\/range\/iterator_range.hpp\"\n#include \"rosbag\/bag.h\"\n#include \"rosbag\/view.h\"\n\n#include \"modules\/common\/adapters\/adapter_gflags.h\"\n#include \"modules\/common\/adapters\/adapter_manager.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\/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\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::adapter::AdapterManager;\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;\n\nstd::string Prediction::Name() const { return FLAGS_prediction_module_name; }\n\nvoid GetBagFiles(const boost::filesystem::path& p,\n                 std::vector<std::string>* bag_files) {\n  CHECK(bag_files);\n  if (!boost::filesystem::exists(p)) {\n    return;\n  }\n  if (boost::filesystem::is_regular_file(p)) {\n    const auto ext = p.extension();\n    if (ext == \".bag\" || ext == \".BAG\") {\n      AINFO << \"Found bag file: \" << p.c_str();\n      bag_files->push_back(p.c_str());\n    }\n    return;\n  }\n  if (boost::filesystem::is_directory(p)) {\n    for (auto& entry : boost::make_iterator_range(\n             boost::filesystem::directory_iterator(p), {})) {\n      GetBagFiles(entry.path(), bag_files);\n    }\n  }\n}\nvoid Prediction::ProcessRosbag(const std::string& filename) {\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\nStatus Prediction::Init() {\n  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    return OnError(\"Unable to load prediction conf file: \" +\n                   FLAGS_prediction_conf_file);\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    return OnError(\"Unable to load adapter conf file: \" +\n                   FLAGS_prediction_adapter_config_filename);\n  } else {\n    ADEBUG << \"Adapter config file is loaded into: \"\n           << adapter_conf_.ShortDebugString();\n  }\n\n  \/\/ Initialization of all managers\n  AdapterManager::Init(adapter_conf_);\n  ContainerManager::instance()->Init(adapter_conf_);\n  EvaluatorManager::instance()->Init(prediction_conf_);\n  PredictorManager::instance()->Init(prediction_conf_);\n\n  CHECK(AdapterManager::GetLocalization()) << \"Localization is not registered.\";\n  CHECK(AdapterManager::GetPerceptionObstacles())\n      << \"Perception is not registered.\";\n\n  \/\/ Set localization callback function\n  AdapterManager::AddLocalizationCallback(&Prediction::OnLocalization, this);\n  \/\/ Set planning callback function\n  AdapterManager::AddPlanningCallback(&Prediction::OnPlanning, this);\n  \/\/ Set perception obstacle callback function\n  AdapterManager::AddPerceptionObstaclesCallback(&Prediction::RunOnce, this);\n\n  if (!FLAGS_use_navigation_mode && !PredictionMap::Ready()) {\n    return OnError(\"Map cannot be loaded.\");\n  }\n\n  if (FLAGS_prediction_offline_mode) {\n    if (!FeatureOutput::Ready()) {\n      return OnError(\"Feature output is not ready.\");\n    }\n    if (FLAGS_prediction_offline_bags.empty()) {\n      return Status::OK();  \/\/ 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      GetBagFiles(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        ProcessRosbag(offline_bags[i]);\n      }\n    }\n    Stop();\n    ros::shutdown();\n  }\n  return Status::OK();\n}\n\nStatus Prediction::Start() { return Status::OK(); }\n\nvoid Prediction::Stop() {\n  if (FLAGS_prediction_offline_mode) {\n    FeatureOutput::Close();\n  }\n}\n\nvoid Prediction::OnLocalization(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 Prediction::OnPlanning(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\nvoid Prediction::RunOnce(const PerceptionObstacles& perception_obstacles) {\n  if (FLAGS_prediction_test_mode && FLAGS_prediction_test_duration > 0 &&\n      (Clock::NowInSeconds() - start_time_ > FLAGS_prediction_test_duration)) {\n    AINFO << \"Prediction finished running in test mode\";\n    ros::shutdown();\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;\n  }\n\n  double start_timestamp = Clock::NowInSeconds();\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  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    Vec2d adc_position(x, y);\n    adc_container->SetPosition(adc_position);\n  }\n\n  \/\/ Make evaluations\n  EvaluatorManager::instance()->Run(perception_obstacles);\n\n  \/\/ No prediction for offline mode\n  if (FLAGS_prediction_offline_mode) {\n    return;\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\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;\n          }\n        }\n      }\n    }\n  }\n\n  Publish(&prediction_obstacles);\n}\n\nStatus Prediction::OnError(const std::string& error_msg) {\n  return Status(ErrorCode::PREDICTION_ERROR, error_msg);\n}\n\n}  \/\/ namespace prediction\n}  \/\/ namespace apollo\n<commit_msg>prediction: added sensors time for end to end performance evaluation.<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\/prediction\/prediction.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <vector>\n\n#include \"boost\/filesystem.hpp\"\n#include \"boost\/range\/iterator_range.hpp\"\n#include \"rosbag\/bag.h\"\n#include \"rosbag\/view.h\"\n\n#include \"modules\/common\/adapters\/adapter_gflags.h\"\n#include \"modules\/common\/adapters\/adapter_manager.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\/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\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::adapter::AdapterManager;\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;\n\nstd::string Prediction::Name() const { return FLAGS_prediction_module_name; }\n\nvoid GetBagFiles(const boost::filesystem::path& p,\n                 std::vector<std::string>* bag_files) {\n  CHECK(bag_files);\n  if (!boost::filesystem::exists(p)) {\n    return;\n  }\n  if (boost::filesystem::is_regular_file(p)) {\n    const auto ext = p.extension();\n    if (ext == \".bag\" || ext == \".BAG\") {\n      AINFO << \"Found bag file: \" << p.c_str();\n      bag_files->push_back(p.c_str());\n    }\n    return;\n  }\n  if (boost::filesystem::is_directory(p)) {\n    for (auto& entry : boost::make_iterator_range(\n             boost::filesystem::directory_iterator(p), {})) {\n      GetBagFiles(entry.path(), bag_files);\n    }\n  }\n}\nvoid Prediction::ProcessRosbag(const std::string& filename) {\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\nStatus Prediction::Init() {\n  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    return OnError(\"Unable to load prediction conf file: \" +\n                   FLAGS_prediction_conf_file);\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    return OnError(\"Unable to load adapter conf file: \" +\n                   FLAGS_prediction_adapter_config_filename);\n  } else {\n    ADEBUG << \"Adapter config file is loaded into: \"\n           << adapter_conf_.ShortDebugString();\n  }\n\n  \/\/ Initialization of all managers\n  AdapterManager::Init(adapter_conf_);\n  ContainerManager::instance()->Init(adapter_conf_);\n  EvaluatorManager::instance()->Init(prediction_conf_);\n  PredictorManager::instance()->Init(prediction_conf_);\n\n  CHECK(AdapterManager::GetLocalization()) << \"Localization is not registered.\";\n  CHECK(AdapterManager::GetPerceptionObstacles())\n      << \"Perception is not registered.\";\n\n  \/\/ Set localization callback function\n  AdapterManager::AddLocalizationCallback(&Prediction::OnLocalization, this);\n  \/\/ Set planning callback function\n  AdapterManager::AddPlanningCallback(&Prediction::OnPlanning, this);\n  \/\/ Set perception obstacle callback function\n  AdapterManager::AddPerceptionObstaclesCallback(&Prediction::RunOnce, this);\n\n  if (!FLAGS_use_navigation_mode && !PredictionMap::Ready()) {\n    return OnError(\"Map cannot be loaded.\");\n  }\n\n  if (FLAGS_prediction_offline_mode) {\n    if (!FeatureOutput::Ready()) {\n      return OnError(\"Feature output is not ready.\");\n    }\n    if (FLAGS_prediction_offline_bags.empty()) {\n      return Status::OK();  \/\/ 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      GetBagFiles(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        ProcessRosbag(offline_bags[i]);\n      }\n    }\n    Stop();\n    ros::shutdown();\n  }\n  return Status::OK();\n}\n\nStatus Prediction::Start() { return Status::OK(); }\n\nvoid Prediction::Stop() {\n  if (FLAGS_prediction_offline_mode) {\n    FeatureOutput::Close();\n  }\n}\n\nvoid Prediction::OnLocalization(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 Prediction::OnPlanning(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\nvoid Prediction::RunOnce(const PerceptionObstacles& perception_obstacles) {\n  if (FLAGS_prediction_test_mode && FLAGS_prediction_test_duration > 0 &&\n      (Clock::NowInSeconds() - start_time_ > FLAGS_prediction_test_duration)) {\n    AINFO << \"Prediction finished running in test mode\";\n    ros::shutdown();\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;\n  }\n\n  double start_timestamp = Clock::NowInSeconds();\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  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    Vec2d adc_position(x, y);\n    adc_container->SetPosition(adc_position);\n  }\n\n  \/\/ Make evaluations\n  EvaluatorManager::instance()->Run(perception_obstacles);\n\n  \/\/ No prediction for offline mode\n  if (FLAGS_prediction_offline_mode) {\n    return;\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;\n          }\n        }\n      }\n    }\n  }\n\n  Publish(&prediction_obstacles);\n}\n\nStatus Prediction::OnError(const std::string& error_msg) {\n  return Status(ErrorCode::PREDICTION_ERROR, error_msg);\n}\n\n}  \/\/ namespace prediction\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2020 Andrii Verbytskyi <andrii.verbytskyi@mpp.mpg.de> for the binder project\n\/\/\n\/\/ All rights reserved. Use of this source code is governed by a\n\/\/ MIT license that can be found in the LICENSE file.\n#include <iostream>\n#include <fstream>\n#include <stdio.h>\n#include <vector>\n#include <string.h>\n\nint skip(std::string const & s1)\n{\n    if (s1.length()==0) return 1;\n    if (s1.length()>1) \n    {\n        size_t comment=s1.find_first_of(\"\/\/\");\n        if (comment==s1.find_first_not_of(\" \\t\")&&comment!=std::string::npos) return 2; \/\/The comments should be ignored\n    }\n    if (s1.find(\"Source list file\")!=std::string::npos) return 3;       \/\/Same as the list of source files\n    if (s1.find(\"Modules list file\")!=std::string::npos) return 4;      \/\/Same as the list of modules\n    if (s1.find(\"File:\")!=std::string::npos) return 5;                  \/\/Same as the full file paths.\n    if (s1.find(\"pybind11::handle cl_type = cl;\")!=std::string::npos) return 6;  \/\/This could be optimized in binder\n    if (s1.find(\"__cxx11\")!=std::string::npos) return 7;                         \/\/This looks like implementation dependent\n    if (s1.find(\"assign\")!=std::string::npos) return 8;                          \/\/ The assing is binded differently for some reasons\n    return 0;\n}\nint compare_text_files(std::string const & f1,const std::string & f2)\n{\n    std::fstream file1(f1), file2(f2);\n    std::string string1, string2;\n    int j1,j2;\n    j1 = 0;\n    j2 = 0;\n    if (!file1 || !file2 ) \n    {\n            std::cout << \"Cannot open one of files \" << f1<<\" or \"<<f2<<\"\\n\";\n            return EXIT_FAILURE;\n    }\n    std::cout <<\"Run comparison\"<< \"\\n\";\n    while((!file1.eof())&&(!file2.eof()))\n    {\n        for (;;) {\n            j1++;\n            if (!std::getline(file1,string1)) break;\n            if (skip(string1)==0) break;\n        }\n        for (;;) {\n            j2++;\n            if (!std::getline(file2,string2)) break;\n            if (skip(string2)==0) break;\n        }\n        if(string1.compare(string2) != 0)\n        {\n            std::cout << j1<<\"\/\"<<j2 << \"-th strings are not equal\" << f1<<f2<<\"\\n\";\n            std::cout << \"   ->\" << string1 << \"<-\\n\";\n            std::cout << \"   ->\" << string2 << \"<-\\n\";\n            return EXIT_FAILURE;\n        }\n    }\n    return EXIT_SUCCESS;\n}\nint main(int argc, char** argv)\n{\n    if (argc!=3&&argc!=4) {\n        std::cout<<\"Wrong number of arguments\"<<std::endl;\n        return EXIT_FAILURE;\n    }\n    int status=compare_text_files(argv[1],argv[2]);\n    if (argc==4)  { if (strcmp(argv[3],\"--always-success\")==0)  return EXIT_SUCCESS; }\n    return status;\n}\n<commit_msg>Ignore difference of the includes<commit_after>\/\/\n\/\/ Copyright (c) 2020 Andrii Verbytskyi <andrii.verbytskyi@mpp.mpg.de> for the binder project\n\/\/\n\/\/ All rights reserved. Use of this source code is governed by a\n\/\/ MIT license that can be found in the LICENSE file.\n#include <iostream>\n#include <fstream>\n#include <stdio.h>\n#include <vector>\n#include <string.h>\n\nint skip(std::string const & s1)\n{\n    if (s1.length()==0) return 1;\n    if (s1.length()>1) \n    {\n        size_t comment=s1.find_first_of(\"\/\/\");\n        if (comment==s1.find_first_not_of(\" \\t\")&&comment!=std::string::npos) return 2; \/\/The comments should be ignored\n    }\n    if (s1.find(\"Source list file\")!=std::string::npos) return 3;       \/\/Same as the list of source files\n    if (s1.find(\"Modules list file\")!=std::string::npos) return 4;      \/\/Same as the list of modules\n    if (s1.find(\"File:\")!=std::string::npos) return 5;                  \/\/Same as the full file paths.\n    if (s1.find(\"pybind11::handle cl_type = cl;\")!=std::string::npos) return 6;  \/\/This could be optimized in binder\n    if (s1.find(\"__cxx11\")!=std::string::npos) return 7;                         \/\/This looks like implementation dependent\n    if (s1.find(\"assign\")!=std::string::npos) return 8;                          \/\/ The assing is binded differently for some reasons\n    if (s1.find(\"#include\")==std::string::npos) return 9;                        \/\/ Includes could differ\n    return 0;\n}\nint compare_text_files(std::string const & f1,const std::string & f2)\n{\n    std::fstream file1(f1), file2(f2);\n    std::string string1, string2;\n    int j1,j2;\n    j1 = 0;\n    j2 = 0;\n    if (!file1 || !file2 ) \n    {\n            std::cout << \"Cannot open one of files \" << f1<<\" or \"<<f2<<\"\\n\";\n            return EXIT_FAILURE;\n    }\n    std::cout <<\"Run comparison\"<< \"\\n\";\n    while((!file1.eof())&&(!file2.eof()))\n    {\n        for (;;) {\n            j1++;\n            if (!std::getline(file1,string1)) break;\n            if (skip(string1)==0) break;\n        }\n        for (;;) {\n            j2++;\n            if (!std::getline(file2,string2)) break;\n            if (skip(string2)==0) break;\n        }\n        if(string1.compare(string2) != 0)\n        {\n            std::cout << j1<<\"\/\"<<j2 << \"-th strings are not equal\" << f1<<\" \"<<f2<<\"\\n\";\n            std::cout << \"   ->\" << string1 << \"<-\\n\";\n            std::cout << \"   ->\" << string2 << \"<-\\n\";\n            return EXIT_FAILURE;\n        }\n    }\n    return EXIT_SUCCESS;\n}\nint main(int argc, char** argv)\n{\n    if (argc!=3&&argc!=4) {\n        std::cout<<\"Wrong number of arguments\"<<std::endl;\n        return EXIT_FAILURE;\n    }\n    int status=compare_text_files(argv[1],argv[2]);\n    if (argc==4)  { if (strcmp(argv[3],\"--always-success\")==0)  return EXIT_SUCCESS; }\n    return status;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n#include <chrono>\n#include <assert.h>\n#include <stdlib.h>\n#include <chrono>\n#include <typeinfo>\n#include <vector>\n\n#include \"..\/sources\/table.h\"\n#include \"..\/sources\/columnStoreTable.h\"\n#include \"..\/sources\/rowStoreTable.h\"\n#include \"..\/sources\/timer.h\"\n\n\/**\n* Returns numValues random Values from 1 - maxValues\n*\/\nuint32_t *getRandomValuesInRange(int32_t numValues, int32_t maxValue)\n{\n    uint32_t *returnValues = new uint32_t[numValues];\n    for (auto i = 0; i < numValues; ++i)\n    {\n        returnValues[i] = (uint32_t)(std::rand() % maxValue + 1);\n    }\n    return returnValues;\n}\n\n\n\/**\n* Returns a predefined selectivity. Selectivity is 0 to 1, representing a procentual value of distinct values. 0 means ther will be just one value\n**\/\nuint32_t *getValuesWithSelectivity(int32_t numValues, int32_t maxValue, int32_t relativeSelectivity)\n{\n    uint32_t *returnValues = new uint32_t[numValues];\n    for (auto i = 0; i < numValues; ++i)\n    {\n        if (relativeSelectivity == 0) {\n            returnValues[i] = 1;\n        } else {\n            returnValues[i] = relativeSelectivity * maxValue;\n        }\n    }\n    return returnValues;\n}\n\nint main(int argc, char const *argv[])\n{\n    std::cout << \"Starting scan benchmark... \" << std::endl;\n\n    std::ofstream out(\"times_scan.csv\");\n    out << \"rows,columns,relativeSelectivity,ns rowstore, ns columnstore\" << std::endl;\n    int32_t rows = 10000000;\n    int32_t rounds = 20;\n\n    for (int columns = 1; columns <= 128; columns *= 2)\n    {\n        for (int relativeSelectivity = 0; relativeSelectivity <= 1; relativeSelectivity += 0.2) {\n            \/\/ start with relativeSelectivity = 0 (means onaly 1 distinct value in every row) and increase it 20% every round until 100% is reached\n\n            std::cout << \"Creating table with \" << columns << \" columns and a selectivity of \" << relativeSelectivity << std::endl;\n\n            \/\/ create tables\n            auto row_table = RowStoreTable(rows, columns);\n            auto column_table = ColumnStoreTable(rows, columns);\n\n\n            \/\/ fill tables with same data\n            \/\/ TODO: replace with data with known selectivity\n\n            \/\/ auto randomValues = getRandomValuesInRange(columns, (rows \/ 500));\n\n            auto distinctValues = getValuesWithSelectivity(columns, rows, 0.1); \n\n             std::cout << \"Distinct vlaues in col 0: \" << distinctValues[0] << std::endl;\n\n            row_table.generateData(rows, distinctValues);\n            column_table.generateData(rows, distinctValues);\n            delete[] distinctValues;\n            auto column = columns\/2;\n\n\n            \/\/ scan tables\n            \/\/ -> row\n            auto comparison_value = row_table.getLocation(0, column); \/\/ TODO: replace with know value\n            std::cout << \"comparsion value is \" << comparison_value << std::endl;\n            auto start = std::chrono::high_resolution_clock::now();\n            for (int32_t round = 0; round != rounds; ++round) {\n                row_table.table_eq_scan(column, comparison_value);\n                \/\/ (optional) clear caches\n            }\n            auto end = std::chrono::high_resolution_clock::now();\n            auto scanTime_row = std::chrono::duration_cast<std::chrono::nanoseconds>(end - start).count() \/ rounds;\n\n            \/\/ -> col\n            comparison_value = column_table.getLocation(0, column); \/\/ TODO: replace with know value\n            start = std::chrono::high_resolution_clock::now();\n            for (int32_t round = 0; round != rounds; ++round) {\n                column_table.table_eq_scan(column, comparison_value);\n                \/\/ (optional) clear caches\n            }\n            end = std::chrono::high_resolution_clock::now();\n            auto scanTime_col = std::chrono::duration_cast<std::chrono::nanoseconds>(end - start).count() \/ rounds;\n\n\n\n            \/\/ output results\n            out << rows << \",\" << columns << \",\" << relativeSelectivity << \",\" << scanTime_row << \",\" << scanTime_col << std::endl;\n            std::cout << rows << \",\" << columns << \",\" << relativeSelectivity << \",\" << scanTime_row << \",\" << scanTime_col << std::endl;\n        }\n    }\n\n}\n<commit_msg>fix ints<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n#include <chrono>\n#include <assert.h>\n#include <stdlib.h>\n#include <chrono>\n#include <typeinfo>\n#include <vector>\n\n#include \"..\/sources\/table.h\"\n#include \"..\/sources\/columnStoreTable.h\"\n#include \"..\/sources\/rowStoreTable.h\"\n#include \"..\/sources\/timer.h\"\n\n\/**\n* Returns numValues random Values from 1 - maxValues\n*\/\nuint32_t *getRandomValuesInRange(int32_t numValues, int32_t maxValue)\n{\n    uint32_t *returnValues = new uint32_t[numValues];\n    for (auto i = 0; i < numValues; ++i)\n    {\n        returnValues[i] = (uint32_t)(std::rand() % maxValue + 1);\n    }\n    return returnValues;\n}\n\n\n\/**\n* Returns a predefined selectivity. Selectivity is 0 to 100, representing a procentual value of distinct values. 0 means ther will be just one value\n**\/\nuint32_t *getValuesWithSelectivity(int32_t numValues, int32_t maxValue, int32_t relativeSelectivity)\n{\n    uint32_t *returnValues = new uint32_t[numValues];\n    for (auto i = 0; i < numValues; ++i)\n    {\n        if (relativeSelectivity == 0) {\n            returnValues[i] = 1;\n        } else {\n            returnValues[i] = relativeSelectivity * maxValue \/ 100;\n        }\n    }\n    return returnValues;\n}\n\nint main(int argc, char const *argv[])\n{\n    std::cout << \"Starting scan benchmark... \" << std::endl;\n\n    std::ofstream out(\"times_scan.csv\");\n    out << \"rows,columns,relativeSelectivity,ns rowstore, ns columnstore\" << std::endl;\n    int32_t rows = 10000000;\n    int32_t rounds = 20;\n\n    for (int columns = 1; columns <= 128; columns *= 2)\n    {\n        for (int relativeSelectivity = 0; relativeSelectivity <= 100; relativeSelectivity += 20) {\n            \/\/ start with relativeSelectivity = 0 (means onaly 1 distinct value in every row) and increase it 20% every round until 100% is reached\n\n            std::cout << \"Creating table with \" << columns << \" columns and a selectivity of \" << relativeSelectivity << \"%\" << std::endl;\n\n            \/\/ create tables\n            auto row_table = RowStoreTable(rows, columns);\n            auto column_table = ColumnStoreTable(rows, columns);\n\n\n            \/\/ fill tables with same data\n            \/\/ TODO: replace with data with known selectivity\n\n            \/\/ auto randomValues = getRandomValuesInRange(columns, (rows \/ 500));\n\n\n            auto selectivityValues = getValuesWithSelectivity(columns, rows, relativeSelectivity); \n\n            std::cout << \"Distinct values in col 0: \" << selectivityValues[0] << std::endl;\n\n            row_table.generateData(rows, selectivityValues);\n            column_table.generateData(rows, selectivityValues);\n            delete[] selectivityValues;\n            auto column = columns\/2;\n\n\n            \/\/ scan tables\n            \/\/ -> row\n            auto comparison_value = row_table.getLocation(0, column); \/\/ TODO: replace with know value\n            std::cout << \"comparsion value is \" << comparison_value << std::endl;\n            auto start = std::chrono::high_resolution_clock::now();\n            for (int32_t round = 0; round != rounds; ++round) {\n                row_table.table_eq_scan(column, comparison_value);\n                \/\/ (optional) clear caches\n            }\n            auto end = std::chrono::high_resolution_clock::now();\n            auto scanTime_row = std::chrono::duration_cast<std::chrono::nanoseconds>(end - start).count() \/ rounds;\n\n            \/\/ -> col\n            comparison_value = column_table.getLocation(0, column); \/\/ TODO: replace with know value\n            start = std::chrono::high_resolution_clock::now();\n            for (int32_t round = 0; round != rounds; ++round) {\n                column_table.table_eq_scan(column, comparison_value);\n                \/\/ (optional) clear caches\n            }\n            end = std::chrono::high_resolution_clock::now();\n            auto scanTime_col = std::chrono::duration_cast<std::chrono::nanoseconds>(end - start).count() \/ rounds;\n\n\n\n            \/\/ output results\n            out << rows << \",\" << columns << \",\" << relativeSelectivity << \",\" << scanTime_row << \",\" << scanTime_col << std::endl;\n            std::cout << rows << \",\" << columns << \",\" << relativeSelectivity << \",\" << scanTime_row << \",\" << scanTime_col << std::endl;\n        }\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2014 CNRS\n\/\/ Authors: Florent Lamiraux\n\/\/\n\/\/ This file is part of hpp-core\n\/\/ hpp-core 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 version\n\/\/ 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ hpp-core 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\/\/ General Lesser Public License for more details.  You should have\n\/\/ received a copy of the GNU Lesser General Public License along with\n\/\/ hpp-core  If not, see\n\/\/ <http:\/\/www.gnu.org\/licenses\/>.\n\n#include <hpp\/core\/kinodynamic-distance.hh>\n#include <limits>\n#include <hpp\/util\/debug.hh>\n#include <hpp\/model\/body.hh>\n#include <hpp\/model\/device.hh>\n#include <hpp\/model\/joint.hh>\n#include <hpp\/core\/problem.hh>\n#include <hpp\/model\/joint-configuration.hh>\n#include <hpp\/model\/children-iterator.hh>\n#include <hpp\/model\/configuration.hh>\n#include <Eigen\/SVD>\n\nnamespace hpp {\nnamespace core {\n\n\nKinodynamicDistancePtr_t KinodynamicDistance::create (const DevicePtr_t& robot)\n{\n    KinodynamicDistance* ptr = new KinodynamicDistance (robot);\n    KinodynamicDistancePtr_t shPtr (ptr);\n    ptr->init (shPtr);\n    return shPtr;\n}\n\nKinodynamicDistancePtr_t KinodynamicDistance::createFromProblem (const ProblemPtr_t& problem)\n{\n    KinodynamicDistance* ptr = new KinodynamicDistance (problem->robot());\n    KinodynamicDistancePtr_t shPtr (ptr);\n    ptr->init (shPtr);\n    return shPtr;\n}\n\n\nKinodynamicDistancePtr_t KinodynamicDistance::createCopy\n(const KinodynamicDistancePtr_t& distance)\n{\n    KinodynamicDistance* ptr = new KinodynamicDistance (*distance);\n    KinodynamicDistancePtr_t shPtr (ptr);\n    ptr->init (shPtr);\n    return shPtr;\n}\n\nDistancePtr_t KinodynamicDistance::clone () const\n{\n    return createCopy (weak_.lock ());\n}\n\n\n\nKinodynamicDistance::KinodynamicDistance (const DevicePtr_t& robot) :\n    robot_ (robot)\n{\n    if((2*(robot_->extraConfigSpace().dimension())) < robot_->configSize()){\n        std::cout<<\"Error : you need at least \"<<robot_->configSize()-robot_->extraConfigSpace().dimension()<<\" extra DOF\"<<std::endl;\n        hppDout(error,\"Error : you need at least \"<<robot_->configSize() - robot_->extraConfigSpace().dimension()<<\" extra DOF\");\n    }\n    aMax_ = 1;\n    vMax_ = 2;\n}\n\n\nKinodynamicDistance::KinodynamicDistance (const KinodynamicDistance& distance) :\n    robot_ (distance.robot_)\n{\n}\n\nvoid KinodynamicDistance::init (KinodynamicDistanceWkPtr_t self)\n{\n    weak_ = self;\n}\n\ninline double sgnenum(double val) {\n  return ((0. < val ) - (val < 0.));\n}\n\ninline int sgn(double d)  {\n  return d >= 0.0 ? 1 : -1;\n}\n\ninline double sgnf(double d)  {\n  return d >= 0.0 ? 1.0 : -1.0;\n}\n\ndouble KinodynamicDistance::computeMinTime(double p1, double p2, double v1, double v2) const{\n  \/\/hppDout(info,\"p1 = \"<<p1<<\"  p2 = \"<<p2<<\"   ; v1 = \"<<v1<<\"    v2 = \"<<v2);\n  \/\/ compute the sign of each acceleration\n  double t1,t2,tv;\n  int sigma;\n  double deltaPacc = 0.5*(v1+v2)*(fabs(v2-v1)\/aMax_);\n  sigma = sgn(p2-p1-deltaPacc);  \/\/TODO bug sigma == 0, temp fix ?\n  \/\/hppDout(info,\"sigma = \"<<sigma);\n  if(sigma == 0){ \/\/ ??? FIXME\n    sigma = sgn(p2-p1);\n    \/\/hppDout(info,\"sigma Bis= \"<<sigma);\n  }\n  double a1 = (sigma)*aMax_;\n  double a2 = -a1;\n  double vLim = (sigma) * vMax_;\n  \/\/hppDout(info,\"Vlim = \"<<vLim<<\"   ;  aMax = \"<<aMax_);\n  if((p2-p1) == 0. && (v2-v1)==0. ){\n    \/\/hppDout(notice,\"No movement in this joints, abort.\");\n    return 0.;\n  }\n  \/\/ test if two segment trajectory is valid :\n  bool twoSegment = false;\n\n  \/\/ solve quadratic equation (cf eq 13 article)\n  const double a = a1;\n  const double b = 2. * v1;\n  const double c = (0.5*(v1+v2)*(v2-v1)\/a2) - (p2-p1);\n\n  const double q = -0.5*(b+sgnf(b)*sqrt(b*b-4*a*c));\n  \/\/hppDout(info, \"sign of \"<<b<<\" is : \"<<sgnf(b));\n  const double x1 = q\/a;\n  const double x2 = c\/q;\n  const double x = std::max(x1,x2);\n  \/\/hppDout(info,\"Solve quadratic equation : x1 = \"<<x1<<\"  ; x2 = \"<<x2);\n  \/\/hppDout(info,\" x = \"<<x);\n  \/\/hppDout(info,\"t1 before vel limit = \"<<x);\n\n  \/\/hppDout(info,\"inf bound on t1 (from t2 > 0) \"<<-((v2-v1)\/a2));\n  double minT1 = std::max(0.,-((v2-v1)\/a2));  \/\/lower bound for valid t1 value (cf eq 14)\n\n\n  if(x >= minT1){\n    twoSegment = true;\n    t1 = x;\n    \/\/hppDout(info,\"t1 >= minT1\");\n  }\n  if(twoSegment){ \/\/ check if max velocity is respected\n    if(std::abs(v1+(t1)*a1) > vMax_){\n      twoSegment = false;\n      \/\/hppDout(info,\"Doesn't respect max velocity, need 3 segments\");\n    }\n  }\n  if(twoSegment){ \/\/ compute t2 for two segment trajectory\n    tv = 0.;\n    t2 = ((v2-v1)\/a2) + (t1);\/\/ eq 14\n  }else{\/\/ compute 3 segment trajectory, with constant velocity phase :\n    t1 = (vLim - v1)\/a1;  \/\/eq 15\n    tv = ((v1*v1+v2*v2 - 2*vLim*vLim)\/(2*vLim*a1)) + (p2-p1)\/vLim ; \/\/eq 16\n    t2 = (v2-vLim)\/a2;  \/\/eq 17\n  }\n  if(twoSegment){\n    \/\/hppDout(notice,\"Trajectory with 2 segments\");\n  }else{\n    \/\/hppDout(notice,\"Trajectory with 3 segments\");\n  }\n  \/\/hppDout(notice,\"a1 = \"<<a1<<\"  ;  a2 =\"<<a2);\n  \/\/hppDout(notice,\"t = \"<<(t1)<<\"   ;   \"<<(tv)<<\"   ;   \"<<(t2));\n  double T = (t1)+(tv)+(t2);\n  \/\/hppDout(notice,\"T = \"<<T);\n  return T;\n}\n\nvalue_type KinodynamicDistance::impl_distance (ConfigurationIn_t q1,\n                                               ConfigurationIn_t q2) const\n{\n    double Tmax = 0;\n    double T = 0;\n\n    size_type configSize = robot_->configSize() - robot_->extraConfigSpace().dimension ();\n    \/\/ looking for Tmax\n    \/\/hppDout(notice,\"KinodynamicDistance :  Looking for Tmax :\");\n   \/\/ hppDout(info,\"Distance between : \"<<model::displayConfig(q1));\n    \/\/hppDout(info,\"and              : \"<<model::displayConfig(q2));\n\n    for(int indexConfig = 0 ; indexConfig < 3 ; indexConfig++){\/\/ FIX ME : only work with freeflyer\n        size_type indexVel = indexConfig + configSize;\n        \/\/hppDout(notice,\"For joint :\"<<robot_->getJointAtConfigRank(indexConfig)->name());\n        if(robot_->getJointAtConfigRank(indexConfig)->name() != \"base_joint_SO3\"){\n            T = computeMinTime(q1[indexConfig],q2[indexConfig],q1[indexVel],q2[indexVel]);\n            if(T > Tmax)\n                Tmax = T;\n        }else{\n            \/\/hppDout(notice,\"!! Kinodynamic distance for quaternion not implemented yet.\");\n        }\n\n    }\n   \/\/ hppDout(info,\" is : \"<<Tmax);\n    return Tmax;\n}\n} \/\/   namespace core\n} \/\/ namespace hpp\n<commit_msg>small cleaning in kindoynamicDistance<commit_after>\/\/\n\/\/ Copyright (c) 2014 CNRS\n\/\/ Authors: Florent Lamiraux\n\/\/\n\/\/ This file is part of hpp-core\n\/\/ hpp-core 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 version\n\/\/ 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ hpp-core 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\/\/ General Lesser Public License for more details.  You should have\n\/\/ received a copy of the GNU Lesser General Public License along with\n\/\/ hpp-core  If not, see\n\/\/ <http:\/\/www.gnu.org\/licenses\/>.\n\n#include <hpp\/core\/kinodynamic-distance.hh>\n#include <limits>\n#include <hpp\/util\/debug.hh>\n#include <hpp\/model\/body.hh>\n#include <hpp\/model\/device.hh>\n#include <hpp\/model\/joint.hh>\n#include <hpp\/core\/problem.hh>\n#include <hpp\/model\/joint-configuration.hh>\n#include <hpp\/model\/children-iterator.hh>\n#include <hpp\/model\/configuration.hh>\n#include <Eigen\/SVD>\n\nnamespace hpp {\nnamespace core {\n\n\nKinodynamicDistancePtr_t KinodynamicDistance::create (const DevicePtr_t& robot)\n{\n    KinodynamicDistance* ptr = new KinodynamicDistance (robot);\n    KinodynamicDistancePtr_t shPtr (ptr);\n    ptr->init (shPtr);\n    return shPtr;\n}\n\nKinodynamicDistancePtr_t KinodynamicDistance::createFromProblem (const ProblemPtr_t& problem)\n{\n    KinodynamicDistance* ptr = new KinodynamicDistance (problem->robot());\n    KinodynamicDistancePtr_t shPtr (ptr);\n    ptr->init (shPtr);\n    return shPtr;\n}\n\n\nKinodynamicDistancePtr_t KinodynamicDistance::createCopy\n(const KinodynamicDistancePtr_t& distance)\n{\n    KinodynamicDistance* ptr = new KinodynamicDistance (*distance);\n    KinodynamicDistancePtr_t shPtr (ptr);\n    ptr->init (shPtr);\n    return shPtr;\n}\n\nDistancePtr_t KinodynamicDistance::clone () const\n{\n    return createCopy (weak_.lock ());\n}\n\n\n\nKinodynamicDistance::KinodynamicDistance (const DevicePtr_t& robot) :\n    robot_ (robot)\n{\n    if((2*(robot_->extraConfigSpace().dimension())) < robot_->configSize()){\n        std::cout<<\"Error : you need at least \"<<robot_->configSize()-robot_->extraConfigSpace().dimension()<<\" extra DOF\"<<std::endl;\n        hppDout(error,\"Error : you need at least \"<<robot_->configSize() - robot_->extraConfigSpace().dimension()<<\" extra DOF\");\n    }\n    aMax_ = 1;\n    vMax_ = 2;\n}\n\n\nKinodynamicDistance::KinodynamicDistance (const KinodynamicDistance& distance) :\n    robot_ (distance.robot_)\n{\n}\n\nvoid KinodynamicDistance::init (KinodynamicDistanceWkPtr_t self)\n{\n    weak_ = self;\n}\n\ninline double sgnenum(double val) {\n  return ((0. < val ) - (val < 0.));\n}\n\ninline int sgn(double d)  {\n  return d >= 0.0 ? 1 : -1;\n}\n\ninline double sgnf(double d)  {\n  return d >= 0.0 ? 1.0 : -1.0;\n}\n\ndouble KinodynamicDistance::computeMinTime(double p1, double p2, double v1, double v2) const{\n  \/\/hppDout(info,\"p1 = \"<<p1<<\"  p2 = \"<<p2<<\"   ; v1 = \"<<v1<<\"    v2 = \"<<v2);\n  \/\/ compute the sign of each acceleration\n  double t1,t2,tv;\n  int sigma;\n  double deltaPacc = 0.5*(v1+v2)*(fabs(v2-v1)\/aMax_);\n  sigma = sgn(p2-p1-deltaPacc);  \/\/TODO bug sigma == 0, temp fix ?\n  \/\/hppDout(info,\"sigma = \"<<sigma);\n  if(sigma == 0){ \/\/ ??? FIXME\n    sigma = sgn(p2-p1);\n    \/\/hppDout(info,\"sigma Bis= \"<<sigma);\n  }\n  double a1 = (sigma)*aMax_;\n  double a2 = -a1;\n  double vLim = (sigma) * vMax_;\n  \/\/hppDout(info,\"Vlim = \"<<vLim<<\"   ;  aMax = \"<<aMax_);\n  if((p2-p1) == 0. && (v2-v1)==0. ){\n    \/\/hppDout(notice,\"No movement in this joints, abort.\");\n    return 0.;\n  }\n  \/\/ test if two segment trajectory is valid :\n  bool twoSegment = false;\n\n  \/\/ solve quadratic equation (cf eq 13 article)\n  const double a = a1;\n  const double b = 2. * v1;\n  const double c = (0.5*(v1+v2)*(v2-v1)\/a2) - (p2-p1);\n\n  const double q = -0.5*(b+sgnf(b)*sqrt(b*b-4*a*c));\n  \/\/hppDout(info, \"sign of \"<<b<<\" is : \"<<sgnf(b));\n  const double x1 = q\/a;\n  const double x2 = c\/q;\n  const double x = std::max(x1,x2);\n  \/\/hppDout(info,\"Solve quadratic equation : x1 = \"<<x1<<\"  ; x2 = \"<<x2);\n  \/\/hppDout(info,\" x = \"<<x);\n  \/\/hppDout(info,\"t1 before vel limit = \"<<x);\n\n  \/\/hppDout(info,\"inf bound on t1 (from t2 > 0) \"<<-((v2-v1)\/a2));\n  double minT1 = std::max(0.,-((v2-v1)\/a2));  \/\/lower bound for valid t1 value (cf eq 14)\n\n\n  if(x >= minT1){\n    twoSegment = true;\n    t1 = x;\n    \/\/hppDout(info,\"t1 >= minT1\");\n  }\n  if(twoSegment){ \/\/ check if max velocity is respected\n    if(std::abs(v1+(t1)*a1) > vMax_){\n      twoSegment = false;\n      \/\/hppDout(info,\"Doesn't respect max velocity, need 3 segments\");\n    }\n  }\n  if(twoSegment){ \/\/ compute t2 for two segment trajectory\n    tv = 0.;\n    t2 = ((v2-v1)\/a2) + (t1);\/\/ eq 14\n  }else{\/\/ compute 3 segment trajectory, with constant velocity phase :\n    t1 = (vLim - v1)\/a1;  \/\/eq 15\n    tv = ((v1*v1+v2*v2 - 2*vLim*vLim)\/(2*vLim*a1)) + (p2-p1)\/vLim ; \/\/eq 16\n    t2 = (v2-vLim)\/a2;  \/\/eq 17\n  }\n  \/*\n  if(twoSegment){\n    hppDout(notice,\"Trajectory with 2 segments\");\n  }else{\n    hppDout(notice,\"Trajectory with 3 segments\");\n  }\n  *\/\n  \/\/hppDout(notice,\"a1 = \"<<a1<<\"  ;  a2 =\"<<a2);\n  \/\/hppDout(notice,\"t = \"<<(t1)<<\"   ;   \"<<(tv)<<\"   ;   \"<<(t2));\n  \/\/double T = (t1)+(tv)+(t2);\n  \/\/hppDout(notice,\"T = \"<<T);\n  return (t1)+(tv)+(t2);\n}\n\nvalue_type KinodynamicDistance::impl_distance (ConfigurationIn_t q1,\n                                               ConfigurationIn_t q2) const\n{\n    double Tmax = 0;\n    double T = 0;\n\n    size_type configSize = robot_->configSize() - robot_->extraConfigSpace().dimension ();\n    \/\/ looking for Tmax\n    \/\/hppDout(notice,\"KinodynamicDistance :  Looking for Tmax :\");\n   \/\/ hppDout(info,\"Distance between : \"<<model::displayConfig(q1));\n    \/\/hppDout(info,\"and              : \"<<model::displayConfig(q2));\n\n    for(int indexConfig = 0 ; indexConfig < 3 ; indexConfig++){\/\/ FIX ME : only work with freeflyer\n        \/\/hppDout(notice,\"For joint :\"<<robot_->getJointAtConfigRank(indexConfig)->name());\n        \/\/if(robot_->getJointAtConfigRank(indexConfig)->name() != \"base_joint_SO3\" true){\n            T = computeMinTime(q1[indexConfig],q2[indexConfig],q1[indexConfig + configSize],q2[indexConfig + configSize]);\n            if(T > Tmax)\n                Tmax = T;\n        \/*}else{\n            hppDout(notice,\"!! Kinodynamic distance for quaternion not implemented yet.\");\n        }*\/\n\n    }\n   \/\/ hppDout(info,\" is : \"<<Tmax);\n    return Tmax;\n}\n} \/\/   namespace core\n} \/\/ namespace hpp\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2021 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_support\/cc\/task\/processor\/image_preprocessor.h\"\n\n#include \"tensorflow_lite_support\/cc\/port\/status_macros.h\"\n#include \"tensorflow_lite_support\/cc\/task\/core\/task_utils.h\"\n#include \"tensorflow_lite_support\/cc\/task\/vision\/proto\/bounding_box_proto_inc.h\"\n#include \"tensorflow_lite_support\/cc\/task\/vision\/utils\/frame_buffer_utils.h\"\n#include \"tensorflow_lite_support\/cc\/task\/vision\/utils\/image_tensor_specs.h\"\n\nnamespace tflite {\nnamespace task {\nnamespace processor {\n\nnamespace {\n\/\/ Number of bytes required for 8-bit per pixel RGB color space.\nstatic constexpr int kRgbPixelBytes = 3;\n\nusing ::tflite::task::vision::BoundingBox;\nusing ::tflite::task::vision::FrameBuffer;\n}  \/\/ namespace\n\n\/\/ Returns false if image preprocessing could be skipped, true otherwise.\nbool ImagePreprocessor::IsImagePreprocessingNeeded(\n    const FrameBuffer& frame_buffer, const BoundingBox& roi) {\n  \/\/ Is crop required?\n  if (roi.origin_x() != 0 || roi.origin_y() != 0 ||\n      roi.width() != frame_buffer.dimension().width ||\n      roi.height() != frame_buffer.dimension().height) {\n    return true;\n  }\n\n  \/\/ Are image transformations required?\n  if (frame_buffer.orientation() != FrameBuffer::Orientation::kTopLeft ||\n      frame_buffer.format() != FrameBuffer::Format::kRGB ||\n      frame_buffer.dimension().width != input_specs_.image_width ||\n      frame_buffer.dimension().height != input_specs_.image_height) {\n    return true;\n  }\n\n  return false;\n}\n\n\/\/ Returns true if the model expects dynamic image shape, false otherwise.\nbool ImagePreprocessor::IsInputImageDynamic()\n{\n  \/\/ Determine if the input shape is resizable.\n  const TfLiteIntArray* dims_signature = Tensor()->dims_signature;\n  \n  if (dims_signature == nullptr) return false;\n\n  bool height_or_width_mutable = dims_signature->data[1] == -1 || \n                                 dims_signature->data[2] == -1;\n  \/\/ Only the HXW dimensions support mutability.\n  bool batch_and_color_fixed = dims_signature->data[0] != -1 &&\n                               dims_signature->data[3] != -1;\n\n  if (height_or_width_mutable && batch_and_color_fixed) return true;\n\n  return false;\n}\n\nabsl::Status ImagePreprocessor::Init(\n    const vision::FrameBufferUtils::ProcessEngine& process_engine) {\n  frame_buffer_utils_ = vision::FrameBufferUtils::Create(process_engine);\n\n  ASSIGN_OR_RETURN(input_specs_, vision::BuildInputImageTensorSpecs(\n                                     *engine_->interpreter(),\n                                     *engine_->metadata_extractor()));\n\n  if (input_specs_.color_space != tflite::ColorSpaceType_RGB) {\n    return tflite::support::CreateStatusWithPayload(\n        absl::StatusCode::kUnimplemented,\n        \"ImagePreprocessor only supports RGB color space for now.\");\n  }\n\n  return absl::OkStatus();\n}\n\nabsl::Status ImagePreprocessor::Preprocess(const FrameBuffer& frame_buffer) {\n  BoundingBox roi;\n  roi.set_width(frame_buffer.dimension().width);\n  roi.set_height(frame_buffer.dimension().height);\n  return Preprocess(frame_buffer, roi);\n}\n\nabsl::Status ImagePreprocessor::Preprocess(const FrameBuffer& frame_buffer,\n                                           const BoundingBox& roi) {\n  \/\/ Input data to be normalized (if needed) and used for inference. In most\n  \/\/ cases, this is the result of image preprocessing. In case no image\n  \/\/ preprocessing is needed (see below), this points to the input frame\n  \/\/ buffer raw data.\n  const uint8* input_data;\n  size_t input_data_byte_size;\n\n  \/\/ Optional buffers in case image preprocessing is needed.\n  std::unique_ptr<FrameBuffer> preprocessed_frame_buffer;\n  std::vector<uint8> preprocessed_data;\n\n  if (IsImagePreprocessingNeeded(frame_buffer, roi) && !IsInputImageDynamic()) {\n    \/\/ Preprocess input image to fit model requirements.\n    \/\/ For now RGB is the only color space supported, which is ensured by\n    \/\/ `InitInternal`.\n    FrameBuffer::Dimension to_buffer_dimension = {input_specs_.image_width,\n                                                  input_specs_.image_height};\n    input_data_byte_size =\n        GetBufferByteSize(to_buffer_dimension, FrameBuffer::Format::kRGB);\n    preprocessed_data.resize(input_data_byte_size \/ sizeof(uint8), 0);\n    input_data = preprocessed_data.data();\n\n    FrameBuffer::Plane preprocessed_plane = {\n        \/*buffer=*\/preprocessed_data.data(),\n        \/*stride=*\/{input_specs_.image_width * kRgbPixelBytes, kRgbPixelBytes}};\n    preprocessed_frame_buffer = FrameBuffer::Create(\n        {preprocessed_plane}, to_buffer_dimension, FrameBuffer::Format::kRGB,\n        FrameBuffer::Orientation::kTopLeft);\n\n    RETURN_IF_ERROR(frame_buffer_utils_->Preprocess(\n        frame_buffer, roi, preprocessed_frame_buffer.get()));\n  } else {\n    \/\/ Input frame buffer already targets model requirements: skip image\n    \/\/ preprocessing. For RGB, the data is always stored in a single plane.\n\n    \/\/ If dynamic, it will re-dim the entire graph as per the input.\n    if (IsInputImageDynamic()) {\n      \/\/ Determine if the input shape is resizable.\n      const TfLiteIntArray* dims_signature = Tensor()->dims_signature;\n\n      const bool height_mutable = dims_signature->data[1] == -1;\n      const bool width_mutable = dims_signature->data[2] == -1;\n      \n      if (height_mutable || width_mutable) {\n        const TfLiteIntArray* dims = Tensor()->dims;\n        const Interpreter* interpreter = engine_->interpreter();\n\n        \/\/ The expected BXHXWXD values of the model.\n        const int expected_batch = Tensor()->dims->data[0];\n        int expected_height = Tensor()->dims->data[1];\n        int expected_width = Tensor()->dims->data[2];\n        const int expected_depth = Tensor()->dims->data[3];\n\n        \/\/ HXW of the input image.\n        int image_height = frame_buffer.dimension().height;\n        int image_width = frame_buffer.dimension().width;\n\n        int height = height_mutable ? image_height : expected_height;\n        int width = width_mutable ? image_width : expected_width;\n\n        const std::vector<int> new_dims {expected_batch, height, width, expected_depth};\n\n         \n        interpreter->ResizeInputTensorStrict(0, new_dims);\n      }\n    }\n\n    input_data = frame_buffer.plane(0).buffer;\n    input_data_byte_size = frame_buffer.plane(0).stride.row_stride_bytes *\n                           frame_buffer.dimension().height;\n  }\n\n  \/\/ Then normalize pixel data (if needed) and populate the input tensor.\n  switch (input_specs_.tensor_type) {\n    case kTfLiteUInt8:\n      if (Tensor()->bytes != input_data_byte_size) {\n        return tflite::support::CreateStatusWithPayload(\n            absl::StatusCode::kInternal,\n            \"Size mismatch or unsupported padding bytes between pixel data \"\n            \"and input tensor.\");\n      }\n      \/\/ No normalization required: directly populate data.\n      tflite::task::core::PopulateTensor(\n          input_data, input_data_byte_size \/ sizeof(uint8), Tensor());\n      break;\n    case kTfLiteFloat32: {\n      if (Tensor()->bytes \/ sizeof(float) !=\n          input_data_byte_size \/ sizeof(uint8)) {\n        return tflite::support::CreateStatusWithPayload(\n            absl::StatusCode::kInternal,\n            \"Size mismatch or unsupported padding bytes between pixel data \"\n            \"and input tensor.\");\n      }\n      \/\/ Normalize and populate.\n      float* normalized_input_data =\n          tflite::task::core::AssertAndReturnTypedTensor<float>(Tensor());\n      const tflite::task::vision::NormalizationOptions& normalization_options =\n          input_specs_.normalization_options.value();\n      for (int i = 0; i < normalization_options.num_values; i++) {\n        if (std::abs(normalization_options.std_values[i]) <\n            std::numeric_limits<float>::epsilon()) {\n          return tflite::support::CreateStatusWithPayload(\n              absl::StatusCode::kInternal,\n              \"NormalizationOptions.std_values can't be 0. Please check if the \"\n              \"tensor metadata has been populated correctly.\");\n        }\n      }\n      if (normalization_options.num_values == 1) {\n        float mean_value = normalization_options.mean_values[0];\n        float inv_std_value = (1.0f \/ normalization_options.std_values[0]);\n        for (size_t i = 0; i < input_data_byte_size \/ sizeof(uint8);\n             i++, input_data++, normalized_input_data++) {\n          *normalized_input_data =\n              inv_std_value * (static_cast<float>(*input_data) - mean_value);\n        }\n      } else {\n        std::array<float, 3> inv_std_values = {\n            1.0f \/ normalization_options.std_values[0],\n            1.0f \/ normalization_options.std_values[1],\n            1.0f \/ normalization_options.std_values[2]};\n        for (size_t i = 0; i < input_data_byte_size \/ sizeof(uint8);\n             i++, input_data++, normalized_input_data++) {\n          *normalized_input_data = inv_std_values[i % 3] *\n                                   (static_cast<float>(*input_data) -\n                                    normalization_options.mean_values[i % 3]);\n        }\n      }\n      break;\n    }\n    case kTfLiteInt8:\n      return tflite::support::CreateStatusWithPayload(\n          absl::StatusCode::kUnimplemented,\n          \"kTfLiteInt8 input type is not implemented yet.\");\n    default:\n      return tflite::support::CreateStatusWithPayload(\n          absl::StatusCode::kInternal, \"Unexpected input tensor type.\");\n  }\n\n  return absl::OkStatus();\n}\n\n}  \/\/ namespace processor\n}  \/\/ namespace task\n}  \/\/ namespace tflite\n<commit_msg>redundant space<commit_after>\/* Copyright 2021 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_support\/cc\/task\/processor\/image_preprocessor.h\"\n\n#include \"tensorflow_lite_support\/cc\/port\/status_macros.h\"\n#include \"tensorflow_lite_support\/cc\/task\/core\/task_utils.h\"\n#include \"tensorflow_lite_support\/cc\/task\/vision\/proto\/bounding_box_proto_inc.h\"\n#include \"tensorflow_lite_support\/cc\/task\/vision\/utils\/frame_buffer_utils.h\"\n#include \"tensorflow_lite_support\/cc\/task\/vision\/utils\/image_tensor_specs.h\"\n\nnamespace tflite {\nnamespace task {\nnamespace processor {\n\nnamespace {\n\/\/ Number of bytes required for 8-bit per pixel RGB color space.\nstatic constexpr int kRgbPixelBytes = 3;\n\nusing ::tflite::task::vision::BoundingBox;\nusing ::tflite::task::vision::FrameBuffer;\n}  \/\/ namespace\n\n\/\/ Returns false if image preprocessing could be skipped, true otherwise.\nbool ImagePreprocessor::IsImagePreprocessingNeeded(\n    const FrameBuffer& frame_buffer, const BoundingBox& roi) {\n  \/\/ Is crop required?\n  if (roi.origin_x() != 0 || roi.origin_y() != 0 ||\n      roi.width() != frame_buffer.dimension().width ||\n      roi.height() != frame_buffer.dimension().height) {\n    return true;\n  }\n\n  \/\/ Are image transformations required?\n  if (frame_buffer.orientation() != FrameBuffer::Orientation::kTopLeft ||\n      frame_buffer.format() != FrameBuffer::Format::kRGB ||\n      frame_buffer.dimension().width != input_specs_.image_width ||\n      frame_buffer.dimension().height != input_specs_.image_height) {\n    return true;\n  }\n\n  return false;\n}\n\n\/\/ Returns true if the model expects dynamic image shape, false otherwise.\nbool ImagePreprocessor::IsInputImageDynamic()\n{\n  \/\/ Determine if the input shape is resizable.\n  const TfLiteIntArray* dims_signature = Tensor()->dims_signature;\n  \n  if (dims_signature == nullptr) return false;\n\n  bool height_or_width_mutable = dims_signature->data[1] == -1 || \n                                 dims_signature->data[2] == -1;\n  \/\/ Only the HXW dimensions support mutability.\n  bool batch_and_color_fixed = dims_signature->data[0] != -1 &&\n                               dims_signature->data[3] != -1;\n\n  if (height_or_width_mutable && batch_and_color_fixed) return true;\n\n  return false;\n}\n\nabsl::Status ImagePreprocessor::Init(\n    const vision::FrameBufferUtils::ProcessEngine& process_engine) {\n  frame_buffer_utils_ = vision::FrameBufferUtils::Create(process_engine);\n\n  ASSIGN_OR_RETURN(input_specs_, vision::BuildInputImageTensorSpecs(\n                                     *engine_->interpreter(),\n                                     *engine_->metadata_extractor()));\n\n  if (input_specs_.color_space != tflite::ColorSpaceType_RGB) {\n    return tflite::support::CreateStatusWithPayload(\n        absl::StatusCode::kUnimplemented,\n        \"ImagePreprocessor only supports RGB color space for now.\");\n  }\n\n  return absl::OkStatus();\n}\n\nabsl::Status ImagePreprocessor::Preprocess(const FrameBuffer& frame_buffer) {\n  BoundingBox roi;\n  roi.set_width(frame_buffer.dimension().width);\n  roi.set_height(frame_buffer.dimension().height);\n  return Preprocess(frame_buffer, roi);\n}\n\nabsl::Status ImagePreprocessor::Preprocess(const FrameBuffer& frame_buffer,\n                                           const BoundingBox& roi) {\n  \/\/ Input data to be normalized (if needed) and used for inference. In most\n  \/\/ cases, this is the result of image preprocessing. In case no image\n  \/\/ preprocessing is needed (see below), this points to the input frame\n  \/\/ buffer raw data.\n  const uint8* input_data;\n  size_t input_data_byte_size;\n\n  \/\/ Optional buffers in case image preprocessing is needed.\n  std::unique_ptr<FrameBuffer> preprocessed_frame_buffer;\n  std::vector<uint8> preprocessed_data;\n\n  if (IsImagePreprocessingNeeded(frame_buffer, roi) && !IsInputImageDynamic()) {\n    \/\/ Preprocess input image to fit model requirements.\n    \/\/ For now RGB is the only color space supported, which is ensured by\n    \/\/ `InitInternal`.\n    FrameBuffer::Dimension to_buffer_dimension = {input_specs_.image_width,\n                                                  input_specs_.image_height};\n    input_data_byte_size =\n        GetBufferByteSize(to_buffer_dimension, FrameBuffer::Format::kRGB);\n    preprocessed_data.resize(input_data_byte_size \/ sizeof(uint8), 0);\n    input_data = preprocessed_data.data();\n\n    FrameBuffer::Plane preprocessed_plane = {\n        \/*buffer=*\/preprocessed_data.data(),\n        \/*stride=*\/{input_specs_.image_width * kRgbPixelBytes, kRgbPixelBytes}};\n    preprocessed_frame_buffer = FrameBuffer::Create(\n        {preprocessed_plane}, to_buffer_dimension, FrameBuffer::Format::kRGB,\n        FrameBuffer::Orientation::kTopLeft);\n\n    RETURN_IF_ERROR(frame_buffer_utils_->Preprocess(\n        frame_buffer, roi, preprocessed_frame_buffer.get()));\n  } else {\n    \/\/ Input frame buffer already targets model requirements: skip image\n    \/\/ preprocessing. For RGB, the data is always stored in a single plane.\n\n    \/\/ If dynamic, it will re-dim the entire graph as per the input.\n    if (IsInputImageDynamic()) {\n      \/\/ Determine if the input shape is resizable.\n      const TfLiteIntArray* dims_signature = Tensor()->dims_signature;\n\n      const bool height_mutable = dims_signature->data[1] == -1;\n      const bool width_mutable = dims_signature->data[2] == -1;\n      \n      if (height_mutable || width_mutable) {\n        const TfLiteIntArray* dims = Tensor()->dims;\n        const Interpreter* interpreter = engine_->interpreter();\n\n        \/\/ The expected BXHXWXD values of the model.\n        const int expected_batch = Tensor()->dims->data[0];\n        int expected_height = Tensor()->dims->data[1];\n        int expected_width = Tensor()->dims->data[2];\n        const int expected_depth = Tensor()->dims->data[3];\n\n        \/\/ HXW of the input image.\n        int image_height = frame_buffer.dimension().height;\n        int image_width = frame_buffer.dimension().width;\n\n        int height = height_mutable ? image_height : expected_height;\n        int width = width_mutable ? image_width : expected_width;\n\n        const std::vector<int> new_dims {expected_batch, height, width, expected_depth};\n\n        interpreter->ResizeInputTensorStrict(0, new_dims);\n      }\n    }\n\n    input_data = frame_buffer.plane(0).buffer;\n    input_data_byte_size = frame_buffer.plane(0).stride.row_stride_bytes *\n                           frame_buffer.dimension().height;\n  }\n\n  \/\/ Then normalize pixel data (if needed) and populate the input tensor.\n  switch (input_specs_.tensor_type) {\n    case kTfLiteUInt8:\n      if (Tensor()->bytes != input_data_byte_size) {\n        return tflite::support::CreateStatusWithPayload(\n            absl::StatusCode::kInternal,\n            \"Size mismatch or unsupported padding bytes between pixel data \"\n            \"and input tensor.\");\n      }\n      \/\/ No normalization required: directly populate data.\n      tflite::task::core::PopulateTensor(\n          input_data, input_data_byte_size \/ sizeof(uint8), Tensor());\n      break;\n    case kTfLiteFloat32: {\n      if (Tensor()->bytes \/ sizeof(float) !=\n          input_data_byte_size \/ sizeof(uint8)) {\n        return tflite::support::CreateStatusWithPayload(\n            absl::StatusCode::kInternal,\n            \"Size mismatch or unsupported padding bytes between pixel data \"\n            \"and input tensor.\");\n      }\n      \/\/ Normalize and populate.\n      float* normalized_input_data =\n          tflite::task::core::AssertAndReturnTypedTensor<float>(Tensor());\n      const tflite::task::vision::NormalizationOptions& normalization_options =\n          input_specs_.normalization_options.value();\n      for (int i = 0; i < normalization_options.num_values; i++) {\n        if (std::abs(normalization_options.std_values[i]) <\n            std::numeric_limits<float>::epsilon()) {\n          return tflite::support::CreateStatusWithPayload(\n              absl::StatusCode::kInternal,\n              \"NormalizationOptions.std_values can't be 0. Please check if the \"\n              \"tensor metadata has been populated correctly.\");\n        }\n      }\n      if (normalization_options.num_values == 1) {\n        float mean_value = normalization_options.mean_values[0];\n        float inv_std_value = (1.0f \/ normalization_options.std_values[0]);\n        for (size_t i = 0; i < input_data_byte_size \/ sizeof(uint8);\n             i++, input_data++, normalized_input_data++) {\n          *normalized_input_data =\n              inv_std_value * (static_cast<float>(*input_data) - mean_value);\n        }\n      } else {\n        std::array<float, 3> inv_std_values = {\n            1.0f \/ normalization_options.std_values[0],\n            1.0f \/ normalization_options.std_values[1],\n            1.0f \/ normalization_options.std_values[2]};\n        for (size_t i = 0; i < input_data_byte_size \/ sizeof(uint8);\n             i++, input_data++, normalized_input_data++) {\n          *normalized_input_data = inv_std_values[i % 3] *\n                                   (static_cast<float>(*input_data) -\n                                    normalization_options.mean_values[i % 3]);\n        }\n      }\n      break;\n    }\n    case kTfLiteInt8:\n      return tflite::support::CreateStatusWithPayload(\n          absl::StatusCode::kUnimplemented,\n          \"kTfLiteInt8 input type is not implemented yet.\");\n    default:\n      return tflite::support::CreateStatusWithPayload(\n          absl::StatusCode::kInternal, \"Unexpected input tensor type.\");\n  }\n\n  return absl::OkStatus();\n}\n\n}  \/\/ namespace processor\n}  \/\/ namespace task\n}  \/\/ namespace tflite\n<|endoftext|>"}
{"text":"<commit_before>#include \"builtin\/class.hpp\"\n#include \"builtin\/object.hpp\"\n#include \"builtin\/stat.hpp\"\n#include \"builtin\/string.hpp\"\n#include \"builtin\/time.hpp\"\n#include \"ontology.hpp\"\n\nnamespace rubinius {\n  void Stat::init(STATE) {\n    GO(stat_class).set(ontology::new_class(state, \"Stat\", G(object), G(rubinius)));\n    G(stat_class)->set_object_type(state, StatType);\n  }\n\n  Fixnum* Stat::stat(STATE, String* p) {\n    path(state, p);\n    return Fixnum::from(::stat(p->c_str_null_safe(state), &st_));\n  }\n\n  Fixnum* Stat::fstat(STATE, Integer* fd) {\n    return Fixnum::from(::fstat(fd->to_native(), &st_));\n  }\n\n  Fixnum* Stat::lstat(STATE, String* p) {\n    path(state, p);\n    return Fixnum::from(::lstat(p->c_str_null_safe(state), &st_));\n  }\n\n  Integer* Stat::stat_dev(STATE) {\n    return Integer::from(state, st_.st_dev);\n  }\n\n  Integer* Stat::stat_ino(STATE) {\n    return Integer::from(state, st_.st_ino);\n  }\n\n  Integer* Stat::stat_mode(STATE) {\n    return Integer::from(state, st_.st_mode);\n  }\n\n  Integer* Stat::stat_nlink(STATE) {\n    return Integer::from(state, st_.st_nlink);\n  }\n\n  Integer* Stat::stat_uid(STATE) {\n    return Integer::from(state, st_.st_uid);\n  }\n\n  Integer* Stat::stat_gid(STATE) {\n    return Integer::from(state, st_.st_gid);\n  }\n\n  Integer* Stat::stat_rdev(STATE) {\n    return Integer::from(state, st_.st_rdev);\n  }\n\n  Integer* Stat::stat_size(STATE) {\n    return Integer::from(state, st_.st_size);\n  }\n\n  Integer* Stat::stat_blksize(STATE) {\n    return Integer::from(state, st_.st_blksize);\n  }\n\n  Integer* Stat::stat_blocks(STATE) {\n    return Integer::from(state, st_.st_blocks);\n  }\n\n  Time* Stat::stat_atime(STATE) {\n    return Time::at(state, st_.st_atime);\n  }\n\n  Time* Stat::stat_mtime(STATE) {\n    return Time::at(state, st_.st_mtime);\n  }\n\n  Time* Stat::stat_ctime(STATE) {\n    return Time::at(state, st_.st_ctime);\n  }\n\n  Object* Stat::stat_birthtime(STATE) {\n    #ifdef HAVE_ST_BIRTHTIME\n      return Time::at(state, st_.st_birthtimespec);\n    #else\n      return Primitives::failure();\n    #endif\n  }\n\n}\n\n<commit_msg>Fix Stat::stat_birthtime.<commit_after>#include \"builtin\/class.hpp\"\n#include \"builtin\/object.hpp\"\n#include \"builtin\/stat.hpp\"\n#include \"builtin\/string.hpp\"\n#include \"builtin\/time.hpp\"\n#include \"ontology.hpp\"\n\nnamespace rubinius {\n  void Stat::init(STATE) {\n    GO(stat_class).set(ontology::new_class(state, \"Stat\", G(object), G(rubinius)));\n    G(stat_class)->set_object_type(state, StatType);\n  }\n\n  Fixnum* Stat::stat(STATE, String* p) {\n    path(state, p);\n    return Fixnum::from(::stat(p->c_str_null_safe(state), &st_));\n  }\n\n  Fixnum* Stat::fstat(STATE, Integer* fd) {\n    return Fixnum::from(::fstat(fd->to_native(), &st_));\n  }\n\n  Fixnum* Stat::lstat(STATE, String* p) {\n    path(state, p);\n    return Fixnum::from(::lstat(p->c_str_null_safe(state), &st_));\n  }\n\n  Integer* Stat::stat_dev(STATE) {\n    return Integer::from(state, st_.st_dev);\n  }\n\n  Integer* Stat::stat_ino(STATE) {\n    return Integer::from(state, st_.st_ino);\n  }\n\n  Integer* Stat::stat_mode(STATE) {\n    return Integer::from(state, st_.st_mode);\n  }\n\n  Integer* Stat::stat_nlink(STATE) {\n    return Integer::from(state, st_.st_nlink);\n  }\n\n  Integer* Stat::stat_uid(STATE) {\n    return Integer::from(state, st_.st_uid);\n  }\n\n  Integer* Stat::stat_gid(STATE) {\n    return Integer::from(state, st_.st_gid);\n  }\n\n  Integer* Stat::stat_rdev(STATE) {\n    return Integer::from(state, st_.st_rdev);\n  }\n\n  Integer* Stat::stat_size(STATE) {\n    return Integer::from(state, st_.st_size);\n  }\n\n  Integer* Stat::stat_blksize(STATE) {\n    return Integer::from(state, st_.st_blksize);\n  }\n\n  Integer* Stat::stat_blocks(STATE) {\n    return Integer::from(state, st_.st_blocks);\n  }\n\n  Time* Stat::stat_atime(STATE) {\n    return Time::at(state, st_.st_atime);\n  }\n\n  Time* Stat::stat_mtime(STATE) {\n    return Time::at(state, st_.st_mtime);\n  }\n\n  Time* Stat::stat_ctime(STATE) {\n    return Time::at(state, st_.st_ctime);\n  }\n\n  Object* Stat::stat_birthtime(STATE) {\n    #ifdef HAVE_ST_BIRTHTIME\n      struct timespec ts = st_.st_birthtimespec;\n      return Time::at(state, ts.tv_sec, ts.tv_nsec);\n    #else\n      return Primitives::failure();\n    #endif\n  }\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  This file is part of KOrganizer.\n\n  Copyright (c) 2004 Till Adam <adam@kde.org>\n  Copyright (c) 2005 Rafal Rzepecki <divide@users.sourceforge.net>\n  Copyright (c) 2008 Thomas Thrainer <tom_t@gmx.at>\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,\n  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 \"kotodoviewquicksearch.h\"\n#include \"koprefs.h\"\n\n#include <libkdepim\/categoryhierarchyreader.h>\n\n#include <kcal\/calendar.h>\n#include <kcal\/calfilter.h>\n\n#include \"kcheckcombobox.h\"\n#include <KLineEdit>\n\n#include <QString>\n#include <QStringList>\n#include <QModelIndex>\n#include <QStandardItemModel>\n#include <QStandardItem>\n#include <QAbstractItemView>\n#include <QHBoxLayout>\n\nusing namespace KCal;\nusing namespace KPIM;\n\nKOTodoViewQuickSearch::KOTodoViewQuickSearch( Calendar *calendar, QWidget *parent )\n  : QWidget( parent ), mCalendar( calendar )\n{\n  QHBoxLayout *layout = new QHBoxLayout( this );\n  \/\/ no special margin because it is added by the view\n  layout->setContentsMargins( 0, 0, 0, 0 );\n\n  mSearchLine = new KLineEdit( this );\n  mSearchLine->setClickMessage( i18nc( \"@label in QuickSearchLine\", \"Search\" ) );\n  mSearchLine->setClearButtonShown( true );\n  connect( mSearchLine, SIGNAL(textChanged(const QString &)),\n           this, SIGNAL(searchTextChanged(const QString &)) );\n\n  layout->addWidget( mSearchLine, 3 );\n\n  mCategoryCombo = new KCheckComboBox( this );\n  mCategoryCombo->setDefaultText( i18nc( \"@item:inlistbox\", \"Select Categories\" ) );\n  mCategoryCombo->setSeparator( i18nc( \"@info delimiter for joining category names\", \",\" ) );\n\n  connect( mCategoryCombo, SIGNAL(checkedItemsChanged(const QStringList &)),\n           this, SIGNAL(searchCategoryChanged(const QStringList &)) );\n\n  layout->addWidget( mCategoryCombo, 1 );\n  fillCategories();\n\n  setLayout( layout );\n}\n\nvoid KOTodoViewQuickSearch::setCalendar( Calendar *calendar )\n{\n  mCalendar = calendar;\n  fillCategories();\n}\n\nvoid KOTodoViewQuickSearch::updateCategories()\n{\n  fillCategories();\n}\n\nvoid KOTodoViewQuickSearch::reset()\n{\n  mSearchLine->clear();\n  mCategoryCombo->setCurrentIndex( 0 );\n}\n\nvoid KOTodoViewQuickSearch::fillCategories()\n{\n  QStringList currentCategories = mCategoryCombo->checkedItems();\n  mCategoryCombo->clear();\n\n  QStringList categories;\n\n  if ( mCalendar ) {\n    CalFilter *filter = mCalendar->filter();\n    if ( filter->criteria() & CalFilter::ShowCategories ) {\n      categories = filter->categoryList();\n      categories.sort();\n    } else {\n      categories = KOPrefs::instance()->mCustomCategories;\n      QStringList filterCategories = filter->categoryList();\n      categories.sort();\n      filterCategories.sort();\n\n      QStringList::Iterator it = categories.begin();\n      QStringList::Iterator jt = filterCategories.begin();\n      while ( it != categories.end() && jt != filterCategories.end() ) {\n        if ( *it == *jt ) {\n          it = categories.erase( it );\n          jt++;\n        } else if ( *it < *jt ) {\n          it++;\n        } else if ( *it > *jt ) {\n          jt++;\n        }\n      }\n    }\n  }\n\n  CategoryHierarchyReaderQComboBox( mCategoryCombo ).read( categories );\n\n  QStandardItemModel *model =\n      qobject_cast<QStandardItemModel *>( mCategoryCombo->model() );\n  Q_ASSERT( model );\n  for ( int r = 0; r < model->rowCount(); ++r ) {\n    QStandardItem *item = model->item( r );\n    item->setCheckable( true );\n  }\n  mCategoryCombo->setCheckedItems( currentCategories );\n}\n\n#include \"kotodoviewquicksearch.moc\"\n<commit_msg>Backport: @info return a richtext for separator<commit_after>\/*\n  This file is part of KOrganizer.\n\n  Copyright (c) 2004 Till Adam <adam@kde.org>\n  Copyright (c) 2005 Rafal Rzepecki <divide@users.sourceforge.net>\n  Copyright (c) 2008 Thomas Thrainer <tom_t@gmx.at>\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,\n  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 \"kotodoviewquicksearch.h\"\n#include \"koprefs.h\"\n\n#include <libkdepim\/categoryhierarchyreader.h>\n\n#include <kcal\/calendar.h>\n#include <kcal\/calfilter.h>\n\n#include \"kcheckcombobox.h\"\n#include <KLineEdit>\n\n#include <QString>\n#include <QStringList>\n#include <QModelIndex>\n#include <QStandardItemModel>\n#include <QStandardItem>\n#include <QAbstractItemView>\n#include <QHBoxLayout>\n\nusing namespace KCal;\nusing namespace KPIM;\n\nKOTodoViewQuickSearch::KOTodoViewQuickSearch( Calendar *calendar, QWidget *parent )\n  : QWidget( parent ), mCalendar( calendar )\n{\n  QHBoxLayout *layout = new QHBoxLayout( this );\n  \/\/ no special margin because it is added by the view\n  layout->setContentsMargins( 0, 0, 0, 0 );\n\n  mSearchLine = new KLineEdit( this );\n  mSearchLine->setClickMessage( i18nc( \"@label in QuickSearchLine\", \"Search\" ) );\n  mSearchLine->setClearButtonShown( true );\n  connect( mSearchLine, SIGNAL(textChanged(const QString &)),\n           this, SIGNAL(searchTextChanged(const QString &)) );\n\n  layout->addWidget( mSearchLine, 3 );\n\n  mCategoryCombo = new KCheckComboBox( this );\n  mCategoryCombo->setDefaultText( i18nc( \"@item:inlistbox\", \"Select Categories\" ) );\n  mCategoryCombo->setSeparator( i18nc( \"@item delimiter for joining category names\", \",\" ) );\n\n  connect( mCategoryCombo, SIGNAL(checkedItemsChanged(const QStringList &)),\n           this, SIGNAL(searchCategoryChanged(const QStringList &)) );\n\n  layout->addWidget( mCategoryCombo, 1 );\n  fillCategories();\n\n  setLayout( layout );\n}\n\nvoid KOTodoViewQuickSearch::setCalendar( Calendar *calendar )\n{\n  mCalendar = calendar;\n  fillCategories();\n}\n\nvoid KOTodoViewQuickSearch::updateCategories()\n{\n  fillCategories();\n}\n\nvoid KOTodoViewQuickSearch::reset()\n{\n  mSearchLine->clear();\n  mCategoryCombo->setCurrentIndex( 0 );\n}\n\nvoid KOTodoViewQuickSearch::fillCategories()\n{\n  QStringList currentCategories = mCategoryCombo->checkedItems();\n  mCategoryCombo->clear();\n\n  QStringList categories;\n\n  if ( mCalendar ) {\n    CalFilter *filter = mCalendar->filter();\n    if ( filter->criteria() & CalFilter::ShowCategories ) {\n      categories = filter->categoryList();\n      categories.sort();\n    } else {\n      categories = KOPrefs::instance()->mCustomCategories;\n      QStringList filterCategories = filter->categoryList();\n      categories.sort();\n      filterCategories.sort();\n\n      QStringList::Iterator it = categories.begin();\n      QStringList::Iterator jt = filterCategories.begin();\n      while ( it != categories.end() && jt != filterCategories.end() ) {\n        if ( *it == *jt ) {\n          it = categories.erase( it );\n          jt++;\n        } else if ( *it < *jt ) {\n          it++;\n        } else if ( *it > *jt ) {\n          jt++;\n        }\n      }\n    }\n  }\n\n  CategoryHierarchyReaderQComboBox( mCategoryCombo ).read( categories );\n\n  QStandardItemModel *model =\n      qobject_cast<QStandardItemModel *>( mCategoryCombo->model() );\n  Q_ASSERT( model );\n  for ( int r = 0; r < model->rowCount(); ++r ) {\n    QStandardItem *item = model->item( r );\n    item->setCheckable( true );\n  }\n  mCategoryCombo->setCheckedItems( currentCategories );\n}\n\n#include \"kotodoviewquicksearch.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\/\n\/*  eq.cpp                                                               *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                      https:\/\/godotengine.org                          *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur.                 *\/\n\/* Copyright (c) 2014-2019 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\/\/ Author: reduzio@gmail.com (C) 2006\n\n#include \"eq.h\"\n#include \"core\/error_macros.h\"\n#include \"core\/math\/math_funcs.h\"\n#include <math.h>\n\n#define POW2(v) ((v) * (v))\n\n\/* Helper *\/\nstatic int solve_quadratic(double a, double b, double c, double *r1, double *r2) {\n\t\/\/solves quadractic and returns number of roots\n\n\tdouble base = 2 * a;\n\tif (base == 0.0f)\n\t\treturn 0;\n\n\tdouble squared = b * b - 4 * a * c;\n\tif (squared < 0.0)\n\t\treturn 0;\n\n\tsquared = sqrt(squared);\n\n\t*r1 = (-b + squared) \/ base;\n\t*r2 = (-b - squared) \/ base;\n\n\tif (*r1 == *r2)\n\t\treturn 1;\n\telse\n\t\treturn 2;\n}\n\nEQ::BandProcess::BandProcess() {\n\n\tc1 = c2 = c3 = history.a1 = history.a2 = history.a3 = 0;\n\thistory.b1 = history.b2 = history.b3 = 0;\n}\n\nvoid EQ::recalculate_band_coefficients() {\n\n#define BAND_LOG(m_f) (log((m_f)) \/ log(2.))\n\n\tfor (int i = 0; i < band.size(); i++) {\n\n\t\tdouble octave_size;\n\n\t\tdouble frq = band[i].freq;\n\n\t\tif (i == 0) {\n\n\t\t\toctave_size = BAND_LOG(band[1].freq) - BAND_LOG(frq);\n\t\t} else if (i == (band.size() - 1)) {\n\n\t\t\toctave_size = BAND_LOG(frq) - BAND_LOG(band[i - 1].freq);\n\t\t} else {\n\n\t\t\tdouble next = BAND_LOG(band[i + 1].freq) - BAND_LOG(frq);\n\t\t\tdouble prev = BAND_LOG(frq) - BAND_LOG(band[i - 1].freq);\n\t\t\toctave_size = (next + prev) \/ 2.0;\n\t\t}\n\n\t\tdouble frq_l = round(frq \/ pow(2.0, octave_size \/ 2.0));\n\n\t\tdouble side_gain2 = POW2(Math_SQRT12);\n\t\tdouble th = 2.0 * Math_PI * frq \/ mix_rate;\n\t\tdouble th_l = 2.0 * Math_PI * frq_l \/ mix_rate;\n\n\t\tdouble c2a = side_gain2 * POW2(cos(th)) - 2.0 * side_gain2 * cos(th_l) * cos(th) + side_gain2 - POW2(sin(th_l));\n\n\t\tdouble c2b = 2.0 * side_gain2 * POW2(cos(th_l)) + side_gain2 * POW2(cos(th)) - 2.0 * side_gain2 * cos(th_l) * cos(th) - side_gain2 + POW2(sin(th_l));\n\n\t\tdouble c2c = 0.25 * side_gain2 * POW2(cos(th)) - 0.5 * side_gain2 * cos(th_l) * cos(th) + 0.25 * side_gain2 - 0.25 * POW2(sin(th_l));\n\n\t\t\/\/printf(\"band %i, precoefs = %f,%f,%f\\n\",i,c2a,c2b,c2c);\n\n\t\tdouble r1, r2; \/\/roots\n\t\tint roots = solve_quadratic(c2a, c2b, c2c, &r1, &r2);\n\n\t\tERR_CONTINUE(roots == 0);\n\n\t\tband.write[i].c1 = 2.0 * ((0.5 - r1) \/ 2.0);\n\t\tband.write[i].c2 = 2.0 * r1;\n\t\tband.write[i].c3 = 2.0 * (0.5 + r1) * cos(th);\n\t\t\/\/printf(\"band %i, coefs = %f,%f,%f\\n\",i,(float)bands[i].c1,(float)bands[i].c2,(float)bands[i].c3);\n\t}\n}\n\nvoid EQ::set_preset_band_mode(Preset p_preset) {\n\n\tband.clear();\n\n#define PUSH_BANDS(m_bands)             \\\n\tfor (int i = 0; i < m_bands; i++) { \\\n\t\tBand b;                         \\\n\t\tb.freq = bands[i];              \\\n\t\tband.push_back(b);              \\\n\t}\n\n\tswitch (p_preset) {\n\n\t\tcase PRESET_6_BANDS: {\n\n\t\t\tstatic const double bands[] = { 32, 100, 320, 1e3, 3200, 10e3 };\n\t\t\tPUSH_BANDS(6);\n\n\t\t} break;\n\n\t\tcase PRESET_8_BANDS: {\n\n\t\t\tstatic const double bands[] = { 32, 72, 192, 512, 1200, 3000, 7500, 16e3 };\n\n\t\t\tPUSH_BANDS(8);\n\t\t} break;\n\n\t\tcase PRESET_10_BANDS: {\n\t\t\tstatic const double bands[] = { 31.25, 62.5, 125, 250, 500, 1e3, 2e3, 4e3, 8e3, 16e3 };\n\n\t\t\tPUSH_BANDS(10);\n\n\t\t} break;\n\n\t\tcase PRESET_21_BANDS: {\n\n\t\t\tstatic const double bands[] = { 22, 32, 44, 63, 90, 125, 175, 250, 350, 500, 700, 1e3, 1400, 2e3, 2800, 4e3, 5600, 8e3, 11e3, 16e3, 22e3 };\n\t\t\tPUSH_BANDS(21);\n\n\t\t} break;\n\n\t\tcase PRESET_31_BANDS: {\n\n\t\t\tstatic const double bands[] = { 20, 25, 31.5, 40, 50, 63, 80, 100, 125, 160, 200, 250, 315, 400, 500, 630, 800, 1e3, 1250, 1600, 2e3, 2500, 3150, 4e3, 5e3, 6300, 8e3, 10e3, 12500, 16e3, 20e3 };\n\t\t\tPUSH_BANDS(31);\n\t\t} break;\n\t};\n\n\trecalculate_band_coefficients();\n}\n\nint EQ::get_band_count() const {\n\n\treturn band.size();\n}\nfloat EQ::get_band_frequency(int p_band) {\n\n\tERR_FAIL_INDEX_V(p_band, band.size(), 0);\n\treturn band[p_band].freq;\n}\nvoid EQ::set_bands(const Vector<float> &p_bands) {\n\n\tband.resize(p_bands.size());\n\tfor (int i = 0; i < p_bands.size(); i++) {\n\n\t\tband.write[i].freq = p_bands[i];\n\t}\n\n\trecalculate_band_coefficients();\n}\n\nvoid EQ::set_mix_rate(float p_mix_rate) {\n\n\tmix_rate = p_mix_rate;\n\trecalculate_band_coefficients();\n}\n\nEQ::BandProcess EQ::get_band_processor(int p_band) const {\n\n\tEQ::BandProcess band_proc;\n\n\tERR_FAIL_INDEX_V(p_band, band.size(), band_proc);\n\n\tband_proc.c1 = band[p_band].c1;\n\tband_proc.c2 = band[p_band].c2;\n\tband_proc.c3 = band[p_band].c3;\n\n\treturn band_proc;\n}\n\nEQ::EQ() {\n\tmix_rate = 44100;\n}\n\nEQ::~EQ() {\n}\n<commit_msg>Fix 'r1' (and r2) may be used uninitialized warning in eq.cpp.<commit_after>\/*************************************************************************\/\n\/*  eq.cpp                                                               *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                      https:\/\/godotengine.org                          *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur.                 *\/\n\/* Copyright (c) 2014-2019 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\/\/ Author: reduzio@gmail.com (C) 2006\n\n#include \"eq.h\"\n#include \"core\/error_macros.h\"\n#include \"core\/math\/math_funcs.h\"\n#include <math.h>\n\n#define POW2(v) ((v) * (v))\n\n\/* Helper *\/\nstatic int solve_quadratic(double a, double b, double c, double *r1, double *r2) {\n\t\/\/solves quadractic and returns number of roots\n\n\tdouble base = 2 * a;\n\tif (base == 0.0f)\n\t\treturn 0;\n\n\tdouble squared = b * b - 4 * a * c;\n\tif (squared < 0.0)\n\t\treturn 0;\n\n\tsquared = sqrt(squared);\n\n\t*r1 = (-b + squared) \/ base;\n\t*r2 = (-b - squared) \/ base;\n\n\tif (*r1 == *r2)\n\t\treturn 1;\n\telse\n\t\treturn 2;\n}\n\nEQ::BandProcess::BandProcess() {\n\n\tc1 = c2 = c3 = history.a1 = history.a2 = history.a3 = 0;\n\thistory.b1 = history.b2 = history.b3 = 0;\n}\n\nvoid EQ::recalculate_band_coefficients() {\n\n#define BAND_LOG(m_f) (log((m_f)) \/ log(2.))\n\n\tfor (int i = 0; i < band.size(); i++) {\n\n\t\tdouble octave_size;\n\n\t\tdouble frq = band[i].freq;\n\n\t\tif (i == 0) {\n\n\t\t\toctave_size = BAND_LOG(band[1].freq) - BAND_LOG(frq);\n\t\t} else if (i == (band.size() - 1)) {\n\n\t\t\toctave_size = BAND_LOG(frq) - BAND_LOG(band[i - 1].freq);\n\t\t} else {\n\n\t\t\tdouble next = BAND_LOG(band[i + 1].freq) - BAND_LOG(frq);\n\t\t\tdouble prev = BAND_LOG(frq) - BAND_LOG(band[i - 1].freq);\n\t\t\toctave_size = (next + prev) \/ 2.0;\n\t\t}\n\n\t\tdouble frq_l = round(frq \/ pow(2.0, octave_size \/ 2.0));\n\n\t\tdouble side_gain2 = POW2(Math_SQRT12);\n\t\tdouble th = 2.0 * Math_PI * frq \/ mix_rate;\n\t\tdouble th_l = 2.0 * Math_PI * frq_l \/ mix_rate;\n\n\t\tdouble c2a = side_gain2 * POW2(cos(th)) - 2.0 * side_gain2 * cos(th_l) * cos(th) + side_gain2 - POW2(sin(th_l));\n\n\t\tdouble c2b = 2.0 * side_gain2 * POW2(cos(th_l)) + side_gain2 * POW2(cos(th)) - 2.0 * side_gain2 * cos(th_l) * cos(th) - side_gain2 + POW2(sin(th_l));\n\n\t\tdouble c2c = 0.25 * side_gain2 * POW2(cos(th)) - 0.5 * side_gain2 * cos(th_l) * cos(th) + 0.25 * side_gain2 - 0.25 * POW2(sin(th_l));\n\n\t\t\/\/printf(\"band %i, precoefs = %f,%f,%f\\n\",i,c2a,c2b,c2c);\n\n\t\t\/\/ Default initializing to silence compiler warning about potential uninitialized use.\n\t\t\/\/ Both variables are properly set in _solve_quadratic before use, or we continue if roots == 0.\n\t\tdouble r1 = 0, r2 = 0; \/\/roots\n\t\tint roots = solve_quadratic(c2a, c2b, c2c, &r1, &r2);\n\n\t\tERR_CONTINUE(roots == 0);\n\n\t\tband.write[i].c1 = 2.0 * ((0.5 - r1) \/ 2.0);\n\t\tband.write[i].c2 = 2.0 * r1;\n\t\tband.write[i].c3 = 2.0 * (0.5 + r1) * cos(th);\n\t\t\/\/printf(\"band %i, coefs = %f,%f,%f\\n\",i,(float)bands[i].c1,(float)bands[i].c2,(float)bands[i].c3);\n\t}\n}\n\nvoid EQ::set_preset_band_mode(Preset p_preset) {\n\n\tband.clear();\n\n#define PUSH_BANDS(m_bands)             \\\n\tfor (int i = 0; i < m_bands; i++) { \\\n\t\tBand b;                         \\\n\t\tb.freq = bands[i];              \\\n\t\tband.push_back(b);              \\\n\t}\n\n\tswitch (p_preset) {\n\n\t\tcase PRESET_6_BANDS: {\n\n\t\t\tstatic const double bands[] = { 32, 100, 320, 1e3, 3200, 10e3 };\n\t\t\tPUSH_BANDS(6);\n\n\t\t} break;\n\n\t\tcase PRESET_8_BANDS: {\n\n\t\t\tstatic const double bands[] = { 32, 72, 192, 512, 1200, 3000, 7500, 16e3 };\n\n\t\t\tPUSH_BANDS(8);\n\t\t} break;\n\n\t\tcase PRESET_10_BANDS: {\n\t\t\tstatic const double bands[] = { 31.25, 62.5, 125, 250, 500, 1e3, 2e3, 4e3, 8e3, 16e3 };\n\n\t\t\tPUSH_BANDS(10);\n\n\t\t} break;\n\n\t\tcase PRESET_21_BANDS: {\n\n\t\t\tstatic const double bands[] = { 22, 32, 44, 63, 90, 125, 175, 250, 350, 500, 700, 1e3, 1400, 2e3, 2800, 4e3, 5600, 8e3, 11e3, 16e3, 22e3 };\n\t\t\tPUSH_BANDS(21);\n\n\t\t} break;\n\n\t\tcase PRESET_31_BANDS: {\n\n\t\t\tstatic const double bands[] = { 20, 25, 31.5, 40, 50, 63, 80, 100, 125, 160, 200, 250, 315, 400, 500, 630, 800, 1e3, 1250, 1600, 2e3, 2500, 3150, 4e3, 5e3, 6300, 8e3, 10e3, 12500, 16e3, 20e3 };\n\t\t\tPUSH_BANDS(31);\n\t\t} break;\n\t};\n\n\trecalculate_band_coefficients();\n}\n\nint EQ::get_band_count() const {\n\n\treturn band.size();\n}\nfloat EQ::get_band_frequency(int p_band) {\n\n\tERR_FAIL_INDEX_V(p_band, band.size(), 0);\n\treturn band[p_band].freq;\n}\nvoid EQ::set_bands(const Vector<float> &p_bands) {\n\n\tband.resize(p_bands.size());\n\tfor (int i = 0; i < p_bands.size(); i++) {\n\n\t\tband.write[i].freq = p_bands[i];\n\t}\n\n\trecalculate_band_coefficients();\n}\n\nvoid EQ::set_mix_rate(float p_mix_rate) {\n\n\tmix_rate = p_mix_rate;\n\trecalculate_band_coefficients();\n}\n\nEQ::BandProcess EQ::get_band_processor(int p_band) const {\n\n\tEQ::BandProcess band_proc;\n\n\tERR_FAIL_INDEX_V(p_band, band.size(), band_proc);\n\n\tband_proc.c1 = band[p_band].c1;\n\tband_proc.c2 = band[p_band].c2;\n\tband_proc.c3 = band[p_band].c3;\n\n\treturn band_proc;\n}\n\nEQ::EQ() {\n\tmix_rate = 44100;\n}\n\nEQ::~EQ() {\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"builtin\/nativemethod.hpp\"\n#include \"objectmemory.hpp\"\n#include \"gc\/baker.hpp\"\n#include \"capi\/capi.hpp\"\n#include \"capi\/handles.hpp\"\n\nnamespace rubinius {\n  namespace capi {\n\n    Handle* Handles::allocate(STATE, Object* obj) {\n      bool needs_gc = false;\n      Handle* handle = allocator_->allocate(&needs_gc);\n      handle->set_object(obj);\n      handle->validate();\n      if(needs_gc) {\n        state->memory()->collect_mature_now = true;\n      }\n      atomic::memory_barrier();\n      return handle;\n    }\n\n    uintptr_t Handles::allocate_index(STATE, Object* obj) {\n      bool needs_gc = false;\n      uintptr_t handle_index = allocator_->allocate_index(&needs_gc);\n      Handle* handle = allocator_->from_index(handle_index);\n      handle->set_object(obj);\n      handle->validate();\n      if(needs_gc) {\n        state->memory()->collect_mature_now = true;\n      }\n      atomic::memory_barrier();\n\n      if(handle_index > UINT32_MAX) {\n        rubinius::bug(\"Rubinius can't handle more than 4G C-API handles active at the same time\");\n      }\n\n      return handle_index;\n    }\n\n    bool Handles::validate(Handle* handle) {\n      return allocator_->validate(handle);\n    }\n\n    Handles::~Handles() {\n      for(std::vector<int>::size_type i = 0; i < allocator_->chunks_.size(); ++i) {\n        Handle* chunk = allocator_->chunks_[i];\n\n        for(size_t j = 0; j < allocator_->cChunkSize; j++) {\n          Handle* handle = &chunk[j];\n          if(handle->in_use_p()) {\n            handle->clear();\n          }\n        }\n      }\n      delete allocator_;\n    }\n\n    void Handles::deallocate_handles(std::list<Handle*>* cached, int mark, BakerGC* young) {\n      std::vector<bool> chunk_marks(allocator_->chunks_.size(), false);\n\n      for(std::vector<int>::size_type i = 0; i < allocator_->chunks_.size(); ++i) {\n        Handle* chunk = allocator_->chunks_[i];\n\n        for(size_t j = 0; j < allocator_->cChunkSize; j++) {\n          Handle* handle = &chunk[j];\n\n          Object* obj = handle->object();\n\n          if(!handle->in_use_p()) {\n            continue;\n          }\n\n          \/\/ Strong references will already have been updated.\n          if(!handle->weak_p()) {\n            chunk_marks[i] = true;\n            continue;\n          }\n\n          if(young) {\n            if(obj->young_object_p()) {\n              \/\/ A weakref pointing to a valid young object\n              \/\/\n              \/\/ TODO this only works because we run prune_handles right after\n              \/\/ a collection. In this state, valid objects are only in current.\n              if(young->in_current_p(obj)) {\n                chunk_marks[i] = true;\n              \/\/ A weakref pointing to a forwarded young object\n              } else if(obj->forwarded_p()) {\n                handle->set_object(obj->forward());\n                chunk_marks[i] = true;\n              \/\/ A weakref pointing to a dead young object\n              } else {\n                handle->clear();\n              }\n            } else {\n              \/\/ Not a young object, so won't be GC'd so mark\n              \/\/ chunk as still active\n              chunk_marks[i] = true;\n            }\n\n          \/\/ A weakref pointing to a dead mature object\n          } else if(!obj->marked_p(mark)) {\n            handle->clear();\n          } else {\n            chunk_marks[i] = true;\n          }\n        }\n      }\n\n      \/\/ Cleanup cached handles\n      for(std::list<Handle*>::iterator it = cached->begin(); it != cached->end();) {\n        Handle* handle = *it;\n\n        if(handle->in_use_p()) {\n          ++it;\n        } else {\n          it = cached->erase(it);\n        }\n      }\n\n      allocator_->rebuild_freelist(&chunk_marks);\n    }\n  }\n}\n<commit_msg>Also add the size check for C-API handles<commit_after>#include \"builtin\/nativemethod.hpp\"\n#include \"objectmemory.hpp\"\n#include \"gc\/baker.hpp\"\n#include \"capi\/capi.hpp\"\n#include \"capi\/handles.hpp\"\n\nnamespace rubinius {\n  namespace capi {\n\n    Handle* Handles::allocate(STATE, Object* obj) {\n      bool needs_gc = false;\n      Handle* handle = allocator_->allocate(&needs_gc);\n      handle->set_object(obj);\n      handle->validate();\n      if(needs_gc) {\n        state->memory()->collect_mature_now = true;\n      }\n      atomic::memory_barrier();\n      return handle;\n    }\n\n    uintptr_t Handles::allocate_index(STATE, Object* obj) {\n      bool needs_gc = false;\n      uintptr_t handle_index = allocator_->allocate_index(&needs_gc);\n      if(handle_index > UINT32_MAX) {\n        rubinius::bug(\"Rubinius can't handle more than 4G C-API handles active at the same time\");\n      }\n      Handle* handle = allocator_->from_index(handle_index);\n      handle->set_object(obj);\n      handle->validate();\n      if(needs_gc) {\n        state->memory()->collect_mature_now = true;\n      }\n      atomic::memory_barrier();\n\n      if(handle_index > UINT32_MAX) {\n        rubinius::bug(\"Rubinius can't handle more than 4G C-API handles active at the same time\");\n      }\n\n      return handle_index;\n    }\n\n    bool Handles::validate(Handle* handle) {\n      return allocator_->validate(handle);\n    }\n\n    Handles::~Handles() {\n      for(std::vector<int>::size_type i = 0; i < allocator_->chunks_.size(); ++i) {\n        Handle* chunk = allocator_->chunks_[i];\n\n        for(size_t j = 0; j < allocator_->cChunkSize; j++) {\n          Handle* handle = &chunk[j];\n          if(handle->in_use_p()) {\n            handle->clear();\n          }\n        }\n      }\n      delete allocator_;\n    }\n\n    void Handles::deallocate_handles(std::list<Handle*>* cached, int mark, BakerGC* young) {\n      std::vector<bool> chunk_marks(allocator_->chunks_.size(), false);\n\n      for(std::vector<int>::size_type i = 0; i < allocator_->chunks_.size(); ++i) {\n        Handle* chunk = allocator_->chunks_[i];\n\n        for(size_t j = 0; j < allocator_->cChunkSize; j++) {\n          Handle* handle = &chunk[j];\n\n          Object* obj = handle->object();\n\n          if(!handle->in_use_p()) {\n            continue;\n          }\n\n          \/\/ Strong references will already have been updated.\n          if(!handle->weak_p()) {\n            chunk_marks[i] = true;\n            continue;\n          }\n\n          if(young) {\n            if(obj->young_object_p()) {\n              \/\/ A weakref pointing to a valid young object\n              \/\/\n              \/\/ TODO this only works because we run prune_handles right after\n              \/\/ a collection. In this state, valid objects are only in current.\n              if(young->in_current_p(obj)) {\n                chunk_marks[i] = true;\n              \/\/ A weakref pointing to a forwarded young object\n              } else if(obj->forwarded_p()) {\n                handle->set_object(obj->forward());\n                chunk_marks[i] = true;\n              \/\/ A weakref pointing to a dead young object\n              } else {\n                handle->clear();\n              }\n            } else {\n              \/\/ Not a young object, so won't be GC'd so mark\n              \/\/ chunk as still active\n              chunk_marks[i] = true;\n            }\n\n          \/\/ A weakref pointing to a dead mature object\n          } else if(!obj->marked_p(mark)) {\n            handle->clear();\n          } else {\n            chunk_marks[i] = true;\n          }\n        }\n      }\n\n      \/\/ Cleanup cached handles\n      for(std::list<Handle*>::iterator it = cached->begin(); it != cached->end();) {\n        Handle* handle = *it;\n\n        if(handle->in_use_p()) {\n          ++it;\n        } else {\n          it = cached->erase(it);\n        }\n      }\n\n      allocator_->rebuild_freelist(&chunk_marks);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#define CATCH_CONFIG_MAIN\n#include <catch.hpp>\n\n#include \"managed.h\"\n#include \"glib.h\"\n\nTEST_CASE(\"Types.C\", \"[C][Types]\") {\n    BuiltinTypes* bt = BuiltinTypes_new();\n    BuiltinTypes_ReturnsVoid(bt);\n    REQUIRE(BuiltinTypes_ReturnsBool(bt)   == true);\n    REQUIRE(BuiltinTypes_ReturnsSByte(bt)  == -5);\n    REQUIRE(BuiltinTypes_ReturnsByte(bt)   ==  5);\n    REQUIRE(BuiltinTypes_ReturnsShort(bt)  == -5);\n    REQUIRE(BuiltinTypes_ReturnsUShort(bt) ==  5);\n    REQUIRE(BuiltinTypes_ReturnsInt(bt)    == -5);\n    REQUIRE(BuiltinTypes_ReturnsUInt(bt)   ==  5);\n    REQUIRE(BuiltinTypes_ReturnsLong(bt)   == -5);\n    REQUIRE(BuiltinTypes_ReturnsULong(bt)  ==  5);\n    REQUIRE(BuiltinTypes_ReturnsChar(bt) == 'a');\n    REQUIRE(strcmp(BuiltinTypes_ReturnsString(bt), \"Mono\") == 0);\n\n    REQUIRE(BuiltinTypes_PassAndReturnsBool(bt, true) == true);\n    REQUIRE(BuiltinTypes_PassAndReturnsSByte(bt, -5) == -5);\n    REQUIRE(BuiltinTypes_PassAndReturnsByte(bt, 5) == 5);\n    REQUIRE(BuiltinTypes_PassAndReturnsShort(bt, -5) == -5);\n    REQUIRE(BuiltinTypes_PassAndReturnsUShort(bt, 5) == 5);\n    REQUIRE(BuiltinTypes_PassAndReturnsInt(bt, -5) == -5);\n    REQUIRE(BuiltinTypes_PassAndReturnsUInt(bt, 5) == 5);\n    REQUIRE(BuiltinTypes_PassAndReturnsLong(bt, -5) == -5);\n    REQUIRE(BuiltinTypes_PassAndReturnsULong(bt, 5) == 5);\n    REQUIRE(BuiltinTypes_PassAndReturnsChar(bt, 'a') == 'a');\n    REQUIRE(strcmp(BuiltinTypes_PassAndReturnsString(bt, \"Mono\"), \"Mono\") == 0);\n\n    int OutInt = 0;\n    BuiltinTypes_PassOutInt(bt, &OutInt);\n    REQUIRE(OutInt == 5);\n\n    int RefInt = 0;\n    BuiltinTypes_PassRefInt(bt, &RefInt);\n    REQUIRE(RefInt == 10);\n\n    GString* RefOut = g_string_new(\"\");\n    BuiltinTypes_PassOutString(bt, RefOut);\n    REQUIRE(strcmp(RefOut->str, \"Mono\") == 0);\n\n    GString* RefStr = g_string_new(\"monomono\");\n    BuiltinTypes_PassRefString(bt, RefStr);\n    REQUIRE(strcmp(RefStr->str, \"Mono\") == 0);\n}\n\nTEST_CASE(\"Properties\", \"[C][Properties]\") {\n    REQUIRE(Platform_get_IsWindows() == false);\n\n    Platform_set_ExitCode(255);\n    REQUIRE(Platform_get_ExitCode() == 255);\n\n    REQUIRE(Properties_Query_get_UniversalAnswer() == 42);\n\n    Properties_Query* prop = Properties_Query_new();\n    REQUIRE(Properties_Query_get_IsGood(prop) == true);\n    REQUIRE(Properties_Query_get_IsBad(prop) == false);\n    REQUIRE(Properties_Query_get_Answer(prop) == 42);\n    Properties_Query_set_Answer(prop, 911);\n    REQUIRE(Properties_Query_get_Answer(prop) == 911);\n\n    REQUIRE(Properties_Query_get_IsSecret(prop) == false);\n    Properties_Query_set_Secret(prop, 1);\n    REQUIRE(Properties_Query_get_IsSecret(prop) == true);\n}\n\nTEST_CASE(\"Namespaces.C\", \"[C][Namespaces]\") {\n    ClassWithoutNamespace* nonamespace = ClassWithoutNamespace_new();\n    REQUIRE(strcmp(ClassWithoutNamespace_ToString(nonamespace), \"ClassWithoutNamespace\") == 0);\n\n    First_ClassWithSingleNamespace* singlenamespace = First_ClassWithSingleNamespace_new();\n    REQUIRE(strcmp(First_ClassWithSingleNamespace_ToString(singlenamespace), \"First.ClassWithSingleNamespace\") == 0);\n\n    First_Second_ClassWithNestedNamespace* nestednamespaces = First_Second_ClassWithNestedNamespace_new();\n    REQUIRE(strcmp(First_Second_ClassWithNestedNamespace_ToString(nestednamespaces), \"First.Second.ClassWithNestedNamespace\") == 0);\n\n    First_Second_Third_ClassWithNestedNamespace* nestednamespaces2 = First_Second_Third_ClassWithNestedNamespace_new();\n    REQUIRE(strcmp(First_Second_Third_ClassWithNestedNamespace_ToString(nestednamespaces2), \"First.Second.Third.ClassWithNestedNamespace\") == 0);\n}\nTEST_CASE(\"Enums.C\", \"[C][Enums]\") {\n    REQUIRE(Enums_EnumTypes_PassEnum(Enum_Two) == 2);\n    REQUIRE(Enums_EnumTypes_PassEnum(Enum_Three) == 3);\n\n    REQUIRE(Enums_EnumTypes_PassEnumByte(EnumByte_Two) == 2);\n    REQUIRE(Enums_EnumTypes_PassEnumByte(EnumByte_Three) == 3);\n\n    REQUIRE(Enums_EnumTypes_PassEnumFlags(EnumFlags_FlagOne) == (1 << 0));\n    REQUIRE(Enums_EnumTypes_PassEnumFlags(EnumFlags_FlagTwo) == (1 << 2));\n}\n\nTEST_CASE(\"Arrays.C\", \"[C][Arrays]\") {\n    char _byte_arr[] = { 1, 2, 3 };\n    _UnsignedcharArray _byte;\n    _byte.array = g_array_sized_new(\/*zero_terminated=*\/false,\n        \/*clear=*\/true, sizeof(char), G_N_ELEMENTS(_byte_arr));\n    g_array_append_vals (_byte.array, _byte_arr, G_N_ELEMENTS(_byte_arr));\n\n    int _sum = Arrays_ArrayTypes_SumByteArray(_byte);\n    REQUIRE(_sum == 6);\n\n    _IntArray _int = Arrays_ArrayTypes_ReturnsIntArray();\n    REQUIRE(_int.array->len == 3);\n    REQUIRE(g_array_index(_int.array, int, 0) == 1);\n    REQUIRE(g_array_index(_int.array, int, 1) == 2);\n    REQUIRE(g_array_index(_int.array, int, 2) == 3);\n\n    _CharArray _string = Arrays_ArrayTypes_ReturnsStringArray();\n    REQUIRE(_string.array->len == 3);\n    REQUIRE(strcmp(g_array_index(_string.array, gchar*, 0), \"1\") == 0);\n    REQUIRE(strcmp(g_array_index(_string.array, gchar*, 1), \"2\") == 0);\n    REQUIRE(strcmp(g_array_index(_string.array, gchar*, 2), \"3\") == 0);\n}\n<commit_msg>[tests][c] Added a few more tests for constructors.<commit_after>#define CATCH_CONFIG_MAIN\n#include <catch.hpp>\n\n#include \"managed.h\"\n#include \"glib.h\"\n\n#include \"float.h\"\n\nTEST_CASE(\"Types.C\", \"[C][Types]\") {\n    BuiltinTypes* bt = BuiltinTypes_new();\n    BuiltinTypes_ReturnsVoid(bt);\n    REQUIRE(BuiltinTypes_ReturnsBool(bt)   == true);\n    REQUIRE(BuiltinTypes_ReturnsSByte(bt)  == -5);\n    REQUIRE(BuiltinTypes_ReturnsByte(bt)   ==  5);\n    REQUIRE(BuiltinTypes_ReturnsShort(bt)  == -5);\n    REQUIRE(BuiltinTypes_ReturnsUShort(bt) ==  5);\n    REQUIRE(BuiltinTypes_ReturnsInt(bt)    == -5);\n    REQUIRE(BuiltinTypes_ReturnsUInt(bt)   ==  5);\n    REQUIRE(BuiltinTypes_ReturnsLong(bt)   == -5);\n    REQUIRE(BuiltinTypes_ReturnsULong(bt)  ==  5);\n    REQUIRE(BuiltinTypes_ReturnsChar(bt) == 'a');\n    REQUIRE(strcmp(BuiltinTypes_ReturnsString(bt), \"Mono\") == 0);\n\n    REQUIRE(BuiltinTypes_PassAndReturnsBool(bt, true) == true);\n    REQUIRE(BuiltinTypes_PassAndReturnsSByte(bt, -5) == -5);\n    REQUIRE(BuiltinTypes_PassAndReturnsByte(bt, 5) == 5);\n    REQUIRE(BuiltinTypes_PassAndReturnsShort(bt, -5) == -5);\n    REQUIRE(BuiltinTypes_PassAndReturnsUShort(bt, 5) == 5);\n    REQUIRE(BuiltinTypes_PassAndReturnsInt(bt, -5) == -5);\n    REQUIRE(BuiltinTypes_PassAndReturnsUInt(bt, 5) == 5);\n    REQUIRE(BuiltinTypes_PassAndReturnsLong(bt, -5) == -5);\n    REQUIRE(BuiltinTypes_PassAndReturnsULong(bt, 5) == 5);\n    REQUIRE(BuiltinTypes_PassAndReturnsChar(bt, 'a') == 'a');\n    REQUIRE(strcmp(BuiltinTypes_PassAndReturnsString(bt, \"Mono\"), \"Mono\") == 0);\n\n    int OutInt = 0;\n    BuiltinTypes_PassOutInt(bt, &OutInt);\n    REQUIRE(OutInt == 5);\n\n    int RefInt = 0;\n    BuiltinTypes_PassRefInt(bt, &RefInt);\n    REQUIRE(RefInt == 10);\n\n    GString* RefOut = g_string_new(\"\");\n    BuiltinTypes_PassOutString(bt, RefOut);\n    REQUIRE(strcmp(RefOut->str, \"Mono\") == 0);\n\n    GString* RefStr = g_string_new(\"monomono\");\n    BuiltinTypes_PassRefString(bt, RefStr);\n    REQUIRE(strcmp(RefStr->str, \"Mono\") == 0);\n}\n\nTEST_CASE(\"Properties\", \"[C][Properties]\") {\n    REQUIRE(Platform_get_IsWindows() == false);\n\n    Platform_set_ExitCode(255);\n    REQUIRE(Platform_get_ExitCode() == 255);\n\n    REQUIRE(Properties_Query_get_UniversalAnswer() == 42);\n\n    Properties_Query* prop = Properties_Query_new();\n    REQUIRE(Properties_Query_get_IsGood(prop) == true);\n    REQUIRE(Properties_Query_get_IsBad(prop) == false);\n    REQUIRE(Properties_Query_get_Answer(prop) == 42);\n    Properties_Query_set_Answer(prop, 911);\n    REQUIRE(Properties_Query_get_Answer(prop) == 911);\n\n    REQUIRE(Properties_Query_get_IsSecret(prop) == false);\n    Properties_Query_set_Secret(prop, 1);\n    REQUIRE(Properties_Query_get_IsSecret(prop) == true);\n}\n\nTEST_CASE(\"Namespaces.C\", \"[C][Namespaces]\") {\n    ClassWithoutNamespace* nonamespace = ClassWithoutNamespace_new();\n    REQUIRE(strcmp(ClassWithoutNamespace_ToString(nonamespace), \"ClassWithoutNamespace\") == 0);\n\n    First_ClassWithSingleNamespace* singlenamespace = First_ClassWithSingleNamespace_new();\n    REQUIRE(strcmp(First_ClassWithSingleNamespace_ToString(singlenamespace), \"First.ClassWithSingleNamespace\") == 0);\n\n    First_Second_ClassWithNestedNamespace* nestednamespaces = First_Second_ClassWithNestedNamespace_new();\n    REQUIRE(strcmp(First_Second_ClassWithNestedNamespace_ToString(nestednamespaces), \"First.Second.ClassWithNestedNamespace\") == 0);\n\n    First_Second_Third_ClassWithNestedNamespace* nestednamespaces2 = First_Second_Third_ClassWithNestedNamespace_new();\n    REQUIRE(strcmp(First_Second_Third_ClassWithNestedNamespace_ToString(nestednamespaces2), \"First.Second.Third.ClassWithNestedNamespace\") == 0);\n}\n\nTEST_CASE(\"Constructors.C\", \"[C][Constructors]\") {\n    Constructors_Unique* unique = Constructors_Unique_new_1();\n    REQUIRE(Constructors_Unique_get_Id(unique) == 1);\n\n    Constructors_Unique* unique_init_id = Constructors_Unique_new_2(911);\n    REQUIRE(Constructors_Unique_get_Id(unique_init_id) == 911);\n\n    Constructors_SuperUnique* super_unique_default_init = Constructors_SuperUnique_new();\n    REQUIRE(Constructors_Unique_get_Id(super_unique_default_init) == 411);\n\n    Constructors_Implicit* implicit = Constructors_Implicit_new();\n    REQUIRE(strcmp(Constructors_Implicit_get_TestResult(implicit), \"OK\") == 0);\n\n    Constructors_AllTypeCode* all1 = Constructors_AllTypeCode_new(true, USHRT_MAX, \"Mono\");\n    REQUIRE(Constructors_AllTypeCode_get_TestResult(all1) == true);\n\n    Constructors_AllTypeCode* all2 = Constructors_AllTypeCode_new_1(SCHAR_MAX, SHRT_MAX, INT_MAX, LONG_MAX);\n    REQUIRE(Constructors_AllTypeCode_get_TestResult(all2) == true);\n\n    Constructors_AllTypeCode* all3 = Constructors_AllTypeCode_new_2(UCHAR_MAX, USHRT_MAX, UINT_MAX, ULONG_MAX);\n    REQUIRE(Constructors_AllTypeCode_get_TestResult(all3) == true);\n\n    Constructors_AllTypeCode* all4 = Constructors_AllTypeCode_new_3(FLT_MAX, DBL_MAX);\n    REQUIRE(Constructors_AllTypeCode_get_TestResult(all4) == true);\n}\n\nTEST_CASE(\"Enums.C\", \"[C][Enums]\") {\n    REQUIRE(Enums_EnumTypes_PassEnum(Enum_Two) == 2);\n    REQUIRE(Enums_EnumTypes_PassEnum(Enum_Three) == 3);\n\n    REQUIRE(Enums_EnumTypes_PassEnumByte(EnumByte_Two) == 2);\n    REQUIRE(Enums_EnumTypes_PassEnumByte(EnumByte_Three) == 3);\n\n    REQUIRE(Enums_EnumTypes_PassEnumFlags(EnumFlags_FlagOne) == (1 << 0));\n    REQUIRE(Enums_EnumTypes_PassEnumFlags(EnumFlags_FlagTwo) == (1 << 2));\n}\n\nTEST_CASE(\"Arrays.C\", \"[C][Arrays]\") {\n    char _byte_arr[] = { 1, 2, 3 };\n    _UnsignedcharArray _byte;\n    _byte.array = g_array_sized_new(\/*zero_terminated=*\/false,\n        \/*clear=*\/true, sizeof(char), G_N_ELEMENTS(_byte_arr));\n    g_array_append_vals (_byte.array, _byte_arr, G_N_ELEMENTS(_byte_arr));\n\n    int _sum = Arrays_ArrayTypes_SumByteArray(_byte);\n    REQUIRE(_sum == 6);\n\n    _IntArray _int = Arrays_ArrayTypes_ReturnsIntArray();\n    REQUIRE(_int.array->len == 3);\n    REQUIRE(g_array_index(_int.array, int, 0) == 1);\n    REQUIRE(g_array_index(_int.array, int, 1) == 2);\n    REQUIRE(g_array_index(_int.array, int, 2) == 3);\n\n    _CharArray _string = Arrays_ArrayTypes_ReturnsStringArray();\n    REQUIRE(_string.array->len == 3);\n    REQUIRE(strcmp(g_array_index(_string.array, gchar*, 0), \"1\") == 0);\n    REQUIRE(strcmp(g_array_index(_string.array, gchar*, 1), \"2\") == 0);\n    REQUIRE(strcmp(g_array_index(_string.array, gchar*, 2), \"3\") == 0);\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_internal.hpp\"\n\nthread_local std::unordered_set<amd::HostQueue*> streamSet;\n\nstatic hipError_t ihipStreamCreateWithFlags(hipStream_t *stream, unsigned int flags) {\n  amd::Device* device = hip::getCurrentContext()->devices()[0];\n\n  amd::HostQueue* queue = new amd::HostQueue(*hip::getCurrentContext(), *device, 0,\n                                             amd::CommandQueue::RealTimeDisabled,\n                                             amd::CommandQueue::Priority::Normal);\n\n  if (!(flags & hipStreamNonBlocking)) {\n    hip::syncStreams();\n    streamSet.insert(queue);\n  }\n\n  if (queue == nullptr) {\n    return hipErrorOutOfMemory;\n  }\n\n  *stream = reinterpret_cast<hipStream_t>(as_cl(queue));\n\n  return hipSuccess;\n}\n\nhipError_t hipStreamCreateWithFlags(hipStream_t *stream, unsigned int flags) {\n  HIP_INIT_API(stream, flags);\n\n  return ihipStreamCreateWithFlags(stream, flags);\n}\n\nhipError_t hipStreamCreate(hipStream_t *stream) {\n  HIP_INIT_API(stream);\n\n  return ihipStreamCreateWithFlags(stream, hipStreamDefault);\n}\n\nhipError_t hipStreamGetFlags(hipStream_t stream, unsigned int *flags) {\n  HIP_INIT_API(stream, flags);\n\n  amd::HostQueue* hostQueue = as_amd(reinterpret_cast<cl_command_queue>(stream))->asHostQueue();\n  auto it = streamSet.find(hostQueue);\n\n  if(flags != nullptr) {\n    *flags = (it != streamSet.end()) ? hipStreamNonBlocking : hipStreamDefault;\n  } else {\n    return hipErrorInvalidValue;\n  }\n\n  return hipSuccess;\n}\n\nhipError_t hipStreamSynchronize(hipStream_t stream) {\n  HIP_INIT_API(stream);\n\n  amd::HostQueue* hostQueue;\n\n  if (stream == nullptr) {\n    hostQueue = hip::getNullStream();\n  } else {\n    hostQueue = as_amd(reinterpret_cast<cl_command_queue>(stream))->asHostQueue();\n  }\n\n  if (hostQueue == nullptr) {\n    return hipErrorUnknown;\n  }\n\n  hostQueue->finish();\n\n  return hipSuccess;\n}\n\nhipError_t hipStreamDestroy(hipStream_t stream) {\n  HIP_INIT_API(stream);\n\n  if (stream == nullptr) {\n    return hipErrorInvalidResourceHandle;\n  }\n\n  amd::HostQueue* hostQueue = as_amd(reinterpret_cast<cl_command_queue>(stream))->asHostQueue();\n\n  streamSet.erase(hostQueue);\n\n  hostQueue->release();\n\n  return hipSuccess;\n}\n\nhipError_t hipStreamWaitEvent(hipStream_t stream, hipEvent_t event, unsigned int flags) {\n  HIP_INIT_API(stream, event, flags);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n\nhipError_t hipStreamQuery(hipStream_t stream) {\n  HIP_INIT_API(stream);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n\nhipError_t hipStreamAddCallback(hipStream_t stream, hipStreamCallback_t callback, void* userData,\n                                unsigned int flags) {\n  HIP_INIT_API(stream, callback, userData, flags);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n\n\n<commit_msg>P4 to Git Change 1552807 by skudchad@skudchad_test2_win_opencl on 2018\/05\/09 18:08:07<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_internal.hpp\"\n\nthread_local std::unordered_set<amd::HostQueue*> streamSet;\n\nstatic hipError_t ihipStreamCreateWithFlags(hipStream_t *stream, unsigned int flags) {\n  amd::Device* device = hip::getCurrentContext()->devices()[0];\n\n  amd::HostQueue* queue = new amd::HostQueue(*hip::getCurrentContext(), *device, 0,\n                                             amd::CommandQueue::RealTimeDisabled,\n                                             amd::CommandQueue::Priority::Normal);\n\n  if (queue == nullptr || !queue->create()) {\n    return hipErrorOutOfMemory;\n  }\n\n  if (!(flags & hipStreamNonBlocking)) {\n    hip::syncStreams();\n    streamSet.insert(queue);\n  }\n\n  *stream = reinterpret_cast<hipStream_t>(as_cl(queue));\n\n  return hipSuccess;\n}\n\nhipError_t hipStreamCreateWithFlags(hipStream_t *stream, unsigned int flags) {\n  HIP_INIT_API(stream, flags);\n\n  return ihipStreamCreateWithFlags(stream, flags);\n}\n\nhipError_t hipStreamCreate(hipStream_t *stream) {\n  HIP_INIT_API(stream);\n\n  return ihipStreamCreateWithFlags(stream, hipStreamDefault);\n}\n\nhipError_t hipStreamGetFlags(hipStream_t stream, unsigned int *flags) {\n  HIP_INIT_API(stream, flags);\n\n  amd::HostQueue* hostQueue = as_amd(reinterpret_cast<cl_command_queue>(stream))->asHostQueue();\n  auto it = streamSet.find(hostQueue);\n\n  if(flags != nullptr) {\n    *flags = (it != streamSet.end()) ? hipStreamNonBlocking : hipStreamDefault;\n  } else {\n    return hipErrorInvalidValue;\n  }\n\n  return hipSuccess;\n}\n\nhipError_t hipStreamSynchronize(hipStream_t stream) {\n  HIP_INIT_API(stream);\n\n  amd::HostQueue* hostQueue;\n\n  if (stream == nullptr) {\n    hostQueue = hip::getNullStream();\n  } else {\n    hostQueue = as_amd(reinterpret_cast<cl_command_queue>(stream))->asHostQueue();\n  }\n\n  if (hostQueue == nullptr) {\n    return hipErrorUnknown;\n  }\n\n  hostQueue->finish();\n\n  return hipSuccess;\n}\n\nhipError_t hipStreamDestroy(hipStream_t stream) {\n  HIP_INIT_API(stream);\n\n  if (stream == nullptr) {\n    return hipErrorInvalidResourceHandle;\n  }\n\n  amd::HostQueue* hostQueue = as_amd(reinterpret_cast<cl_command_queue>(stream))->asHostQueue();\n  hostQueue->release();\n  streamSet.erase(hostQueue);\n\n  return hipSuccess;\n}\n\nhipError_t hipStreamWaitEvent(hipStream_t stream, hipEvent_t event, unsigned int flags) {\n  HIP_INIT_API(stream, event, flags);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n\nhipError_t hipStreamQuery(hipStream_t stream) {\n  HIP_INIT_API(stream);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n\nhipError_t hipStreamAddCallback(hipStream_t stream, hipStreamCallback_t callback, void* userData,\n                                unsigned int flags) {\n  HIP_INIT_API(stream, callback, userData, flags);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\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\/\/ UNSUPPORTED: c++98, c++03, c++11\n\/\/ <vector>\n\/\/  vector.bool\n\n\/\/ template <class... Args> reference emplace_back(Args&&... args);\n\/\/ return type is 'reference' in C++17; 'void' before\n\n#include <vector>\n#include <cassert>\n#include \"test_macros.h\"\n#include \"min_allocator.h\"\n\nint main()\n{\n    {\n        typedef std::vector<bool> C;\n        C c;\n#if TEST_STD_VER > 14\n        typedef C::reference Ref;\n        Ref r1 = c.emplace_back();\n        assert(c.size() == 1);\n        assert(c.front() == false);\n        r1 = true;\n        assert(c.front() == true);\n        r1 = false;\n        Ref r2 = c.emplace_back(true);\n        assert(c.size() == 2);\n        assert(c.front() == false);\n        assert(c.back() == true);\n        r2 = false;\n        assert(c.back() == false);\n        r2 = true;\n#else\n        c.emplace_back();\n        assert(c.size() == 1);\n        assert(c.front() == false);\n        c.emplace_back(true);\n        assert(c.size() == 2);\n        assert(c.front() == false);\n        assert(c.back() == true);\n#endif\n        c.emplace_back(1 == 1);\n        assert(c.size() == 3);\n        assert(c.front() == false);\n        assert(c[1] == true);\n        assert(c.back() == true);\n    }\n    {\n        typedef std::vector<bool, min_allocator<bool>> C;\n        C c;\n\n#if TEST_STD_VER > 14\n        typedef C::reference Ref;\n        Ref r1 = c.emplace_back();\n        assert(c.size() == 1);\n        assert(c.front() == false);\n        r1 = true;\n        assert(c.front() == true);\n        r1 = false;\n        Ref r2 = c.emplace_back(true);\n        assert(c.size() == 2);\n        assert(c.front() == false);\n        assert(c.back() == true);\n        r2 = false;\n        assert(c.back() == false);\n        r2 = true;\n#else\n        c.emplace_back();\n        assert(c.size() == 1);\n        assert(c.front() == false);\n        c.emplace_back(true);\n        assert(c.size() == 2);\n        assert(c.front() == false);\n        assert(c.back() == true);\n#endif\n        c.emplace_back(1 == 1);\n        assert(c.size() == 3);\n        assert(c.front() == false);\n        assert(c[1] == true);\n        assert(c.back() == true);\n    }\n}\n<commit_msg>[libcxx] [test] Fix MSVC \"warning C6326: Potential comparison of a constant with another constant\".<commit_after>\/\/===----------------------------------------------------------------------===\/\/\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\/\/ UNSUPPORTED: c++98, c++03, c++11\n\/\/ <vector>\n\/\/  vector.bool\n\n\/\/ template <class... Args> reference emplace_back(Args&&... args);\n\/\/ return type is 'reference' in C++17; 'void' before\n\n#include <vector>\n#include <cassert>\n#include \"test_macros.h\"\n#include \"min_allocator.h\"\n\nint main()\n{\n    {\n        typedef std::vector<bool> C;\n        C c;\n#if TEST_STD_VER > 14\n        typedef C::reference Ref;\n        Ref r1 = c.emplace_back();\n        assert(c.size() == 1);\n        assert(c.front() == false);\n        r1 = true;\n        assert(c.front() == true);\n        r1 = false;\n        Ref r2 = c.emplace_back(true);\n        assert(c.size() == 2);\n        assert(c.front() == false);\n        assert(c.back() == true);\n        r2 = false;\n        assert(c.back() == false);\n        r2 = true;\n#else\n        c.emplace_back();\n        assert(c.size() == 1);\n        assert(c.front() == false);\n        c.emplace_back(true);\n        assert(c.size() == 2);\n        assert(c.front() == false);\n        assert(c.back() == true);\n#endif\n        c.emplace_back(true);\n        assert(c.size() == 3);\n        assert(c.front() == false);\n        assert(c[1] == true);\n        assert(c.back() == true);\n    }\n    {\n        typedef std::vector<bool, min_allocator<bool>> C;\n        C c;\n\n#if TEST_STD_VER > 14\n        typedef C::reference Ref;\n        Ref r1 = c.emplace_back();\n        assert(c.size() == 1);\n        assert(c.front() == false);\n        r1 = true;\n        assert(c.front() == true);\n        r1 = false;\n        Ref r2 = c.emplace_back(true);\n        assert(c.size() == 2);\n        assert(c.front() == false);\n        assert(c.back() == true);\n        r2 = false;\n        assert(c.back() == false);\n        r2 = true;\n#else\n        c.emplace_back();\n        assert(c.size() == 1);\n        assert(c.front() == false);\n        c.emplace_back(true);\n        assert(c.size() == 2);\n        assert(c.front() == false);\n        assert(c.back() == true);\n#endif\n        c.emplace_back(true);\n        assert(c.size() == 3);\n        assert(c.front() == false);\n        assert(c[1] == true);\n        assert(c.back() == true);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *   Copyright (C) 2013-2016 by Savoir-faire Linux                          *\n *   Author : Emmanuel Lepage Vallee <emmanuel.lepage@savoirfairelinux.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 General Public License      *\n *   along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.  *\n ***************************************************************************\/\n#include \"lastusednumbermodel.h\"\n#include \"call.h\"\n#include \"uri.h\"\n#include \"contactmethod.h\"\n\nstruct ChainedContactMethod {\n   ChainedContactMethod(ContactMethod* n) : m_pPrevious(nullptr),m_pNext(nullptr),m_pSelf(n){}\n   ChainedContactMethod* m_pPrevious;\n   ChainedContactMethod* m_pNext;\n   ContactMethod*  m_pSelf;\n};\n\nclass LastUsedNumberModelPrivate\n{\npublic:\n   LastUsedNumberModelPrivate();\n\n   \/\/Const\n   constexpr static const int MAX_ITEM = 15;\n\n   \/\/Attributes\n   ChainedContactMethod* m_pFirstNode;\n   QHash<ContactMethod*,ChainedContactMethod*> m_hNumbers;\n   bool m_IsValid;\n   ChainedContactMethod* m_lLastNumbers[MAX_ITEM];\n};\n\nLastUsedNumberModelPrivate::LastUsedNumberModelPrivate():m_pFirstNode(nullptr),m_IsValid(false)\n{}\n\nLastUsedNumberModel::LastUsedNumberModel() : QAbstractListModel(),d_ptr(new LastUsedNumberModelPrivate())\n{\n   for (int i=0;i<LastUsedNumberModelPrivate::MAX_ITEM;i++)\n      d_ptr->m_lLastNumbers[i] = nullptr;\n}\n\nLastUsedNumberModel::~LastUsedNumberModel()\n{\n   delete d_ptr;\n}\n\nLastUsedNumberModel& LastUsedNumberModel::instance()\n{\n    static auto instance = new LastUsedNumberModel();\n    return *instance;\n}\n\nQHash<int,QByteArray> LastUsedNumberModel::roleNames() const\n{\n   static QHash<int, QByteArray> roles = QAbstractItemModel::roleNames();\n   \/*static bool initRoles = false;\n   if (!initRoles) {\n      initRoles = true;\n\n   }*\/\n   return roles;\n}\n\n\/\/\/Push 'call' phoneNumber on the top of the stack\nvoid LastUsedNumberModel::addCall(Call* call)\n{\n   ContactMethod* number = call->peerContactMethod();\n   ChainedContactMethod* node = d_ptr->m_hNumbers[number];\n   if (!number || ( node && d_ptr->m_pFirstNode == node) ) {\n      \/\/TODO enable threaded numbers now\n      return;\n   }\n\n   if (!node) {\n      node = new ChainedContactMethod(number);\n      d_ptr->m_hNumbers[number] = node;\n   }\n   else {\n      if (node->m_pPrevious)\n         node->m_pPrevious->m_pNext = node->m_pNext;\n      if (node->m_pNext)\n         node->m_pNext->m_pPrevious = node->m_pPrevious;\n   }\n   if (d_ptr->m_pFirstNode) {\n      d_ptr->m_pFirstNode->m_pPrevious = node;\n      node->m_pNext = d_ptr->m_pFirstNode;\n   }\n   d_ptr->m_pFirstNode = node;\n   d_ptr->m_IsValid = false;\n   emit layoutChanged();\n}\n\n\nQVariant LastUsedNumberModel::data( const QModelIndex& index, int role) const\n{\n   if (!index.isValid())\n      return QVariant();\n   if (!d_ptr->m_IsValid) {\n      ChainedContactMethod* current = d_ptr->m_pFirstNode;\n      for (int i=0;i<LastUsedNumberModelPrivate::MAX_ITEM;i++) { \/\/Can only grow, no need to clear\n         d_ptr->m_lLastNumbers[i] = current;\n         current = current->m_pNext;\n         if (!current)\n            break;\n      }\n      d_ptr->m_IsValid = true;\n   }\n   switch (role) {\n      case Qt::DisplayRole: {\n         return d_ptr->m_lLastNumbers[index.row()]->m_pSelf->uri();\n      }\n   };\n   return QVariant();\n}\n\nint LastUsedNumberModel::rowCount( const QModelIndex& parent) const\n{\n   if (parent.isValid())\n      return 0;\n   return d_ptr->m_hNumbers.size() < LastUsedNumberModelPrivate::MAX_ITEM?d_ptr->m_hNumbers.size():LastUsedNumberModelPrivate::MAX_ITEM;\n}\n\nQt::ItemFlags LastUsedNumberModel::flags( const QModelIndex& index) const\n{\n   Q_UNUSED(index)\n   return Qt::ItemIsSelectable | Qt::ItemIsEnabled;\n}\n\nbool LastUsedNumberModel::setData( const QModelIndex& index, const QVariant &value, int role)\n{\n   Q_UNUSED(index)\n   Q_UNUSED(value)\n   Q_UNUSED(role)\n   return false;\n}\n<commit_msg>lastusednumber: Fix uninitialized pointers<commit_after>\/****************************************************************************\n *   Copyright (C) 2013-2016 by Savoir-faire Linux                          *\n *   Author : Emmanuel Lepage Vallee <emmanuel.lepage@savoirfairelinux.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 General Public License      *\n *   along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.  *\n ***************************************************************************\/\n#include \"lastusednumbermodel.h\"\n#include \"call.h\"\n#include \"uri.h\"\n#include \"contactmethod.h\"\n\nstruct ChainedContactMethod {\n   ChainedContactMethod(ContactMethod* n) : m_pPrevious(nullptr),m_pNext(nullptr),m_pSelf(n){}\n   ChainedContactMethod* m_pPrevious;\n   ChainedContactMethod* m_pNext;\n   ContactMethod*  m_pSelf;\n};\n\nclass LastUsedNumberModelPrivate\n{\npublic:\n   LastUsedNumberModelPrivate();\n\n   \/\/Const\n   constexpr static const int MAX_ITEM = 15;\n\n   \/\/Attributes\n   ChainedContactMethod* m_pFirstNode;\n   QHash<ContactMethod*,ChainedContactMethod*> m_hNumbers;\n   bool m_IsValid;\n   ChainedContactMethod* m_lLastNumbers[MAX_ITEM] {};\n};\n\nLastUsedNumberModelPrivate::LastUsedNumberModelPrivate():m_pFirstNode(nullptr),m_IsValid(false)\n{}\n\nLastUsedNumberModel::LastUsedNumberModel() : QAbstractListModel(),d_ptr(new LastUsedNumberModelPrivate())\n{\n   for (int i=0;i<LastUsedNumberModelPrivate::MAX_ITEM;i++)\n      d_ptr->m_lLastNumbers[i] = nullptr;\n}\n\nLastUsedNumberModel::~LastUsedNumberModel()\n{\n   delete d_ptr;\n}\n\nLastUsedNumberModel& LastUsedNumberModel::instance()\n{\n    static auto instance = new LastUsedNumberModel();\n    return *instance;\n}\n\nQHash<int,QByteArray> LastUsedNumberModel::roleNames() const\n{\n   static QHash<int, QByteArray> roles = QAbstractItemModel::roleNames();\n   \/*static bool initRoles = false;\n   if (!initRoles) {\n      initRoles = true;\n\n   }*\/\n   return roles;\n}\n\n\/\/\/Push 'call' phoneNumber on the top of the stack\nvoid LastUsedNumberModel::addCall(Call* call)\n{\n   ContactMethod* number = call->peerContactMethod();\n   ChainedContactMethod* node = d_ptr->m_hNumbers[number];\n   if (!number || ( node && d_ptr->m_pFirstNode == node) ) {\n      \/\/TODO enable threaded numbers now\n      return;\n   }\n\n   if (!node) {\n      node = new ChainedContactMethod(number);\n      d_ptr->m_hNumbers[number] = node;\n   }\n   else {\n      if (node->m_pPrevious)\n         node->m_pPrevious->m_pNext = node->m_pNext;\n      if (node->m_pNext)\n         node->m_pNext->m_pPrevious = node->m_pPrevious;\n   }\n   if (d_ptr->m_pFirstNode) {\n      d_ptr->m_pFirstNode->m_pPrevious = node;\n      node->m_pNext = d_ptr->m_pFirstNode;\n   }\n   d_ptr->m_pFirstNode = node;\n   d_ptr->m_IsValid = false;\n   emit layoutChanged();\n}\n\n\nQVariant LastUsedNumberModel::data( const QModelIndex& index, int role) const\n{\n   if (!index.isValid())\n      return QVariant();\n   if (!d_ptr->m_IsValid) {\n      ChainedContactMethod* current = d_ptr->m_pFirstNode;\n      for (int i=0;i<LastUsedNumberModelPrivate::MAX_ITEM;i++) { \/\/Can only grow, no need to clear\n         d_ptr->m_lLastNumbers[i] = current;\n         current = current->m_pNext;\n         if (!current)\n            break;\n      }\n      d_ptr->m_IsValid = true;\n   }\n   switch (role) {\n      case Qt::DisplayRole: {\n         return d_ptr->m_lLastNumbers[index.row()]->m_pSelf->uri();\n      }\n   };\n   return QVariant();\n}\n\nint LastUsedNumberModel::rowCount( const QModelIndex& parent) const\n{\n   if (parent.isValid())\n      return 0;\n   return d_ptr->m_hNumbers.size() < LastUsedNumberModelPrivate::MAX_ITEM?d_ptr->m_hNumbers.size():LastUsedNumberModelPrivate::MAX_ITEM;\n}\n\nQt::ItemFlags LastUsedNumberModel::flags( const QModelIndex& index) const\n{\n   Q_UNUSED(index)\n   return Qt::ItemIsSelectable | Qt::ItemIsEnabled;\n}\n\nbool LastUsedNumberModel::setData( const QModelIndex& index, const QVariant &value, int role)\n{\n   Q_UNUSED(index)\n   Q_UNUSED(value)\n   Q_UNUSED(role)\n   return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stable.h\"\n\n#include \"SoundBuffer.h\"\n#include \"WtsAudio.h\"\n\n#include <cmath>\n\n#include <sndfile.hh>\n\nusing namespace WTS;\n\nSoundBuffer::SoundBuffer(const QString& name)\n    : m_name(name)\n    , m_saved(true)\n    , m_writePos(0)\n    , m_readPos(0)\n    , m_normGain(1)\n    , m_gain(1)\n{\n    setRange(0,0);\n}\n\nSoundBuffer::SoundBuffer(qint64 sampleCount, const QString& name)\n    : m_name(name)\n    , m_saved(true)\n    , m_data(sampleCount, 0)\n    , m_writePos(0)\n    , m_readPos(0)\n    , m_normGain(1)\n    , m_gain(1)\n{\n    setRange(0,sampleCount);\n}\n\nSoundBuffer::SoundBuffer(const QString& name, const SoundBuffer& other, qint64 sampleCount)\n    : m_name(name)\n    , m_saved(false)\n    , m_data(other.m_data)\n    , m_writePos(0)\n    , m_readPos(0)\n    , m_normGain(1)\n    , m_gain(1)\n{\n    if (sampleCount && sampleCount != other.sampleCount())\n        m_data.resize(sampleCount);\n    setRange(0,sampleCount);\n}\n\nSoundBuffer& SoundBuffer::operator= (const SoundBuffer& other)\n{\n    m_data = other.m_data;\n    m_name = other.m_name;\n    m_saved = other.m_saved;\n    m_writePos = 0;\n    m_readPos = 0;\n    m_range[0] = other.m_range[0];\n    m_range[1] = other.m_range[1];\n    m_normGain = other.m_normGain;\n    m_gain = other.m_gain;\n    return *this;\n}\n\nvoid SoundBuffer::save( const QDir& dir )\n{\n    QString path = dir.filePath( makeFileName( m_name ) );\n\n    if (m_savedAs != path) {\n        QFileInfo fi(m_savedAs);\n        if (fi.exists()) {\n            if (m_saved && fi.dir().rename( m_savedAs, path )) {\n                qDebug() << \"Renamed\" << m_savedAs << \"to\" << path;\n                m_savedAs = path;\n                return;\n            } else\n                fi.dir().remove( fi.fileName() );\n        }\n    }\n\n    if (m_saved)\n        return;\n\n    qDebug() << \"Save sample to\" << path;\n    { \/\/ block to ensure file is closed by the moment we ask its modification time\n        SndfileHandle snd(qPrintable(path),SFM_WRITE,\n                SF_FORMAT_WAV | SF_FORMAT_FLOAT,\n                1, \/\/ channel\n                WtsAudio::samplingRate());\n\n        snd.writef(m_data.data(),m_data.size());\n    }\n    m_timestamp = QFileInfo(path).lastModified();\n    m_saved = true;\n    m_savedAs = path;\n}\n\nvoid SoundBuffer::load( const QDir& dir )\n{\n    QString path = dir.filePath( makeFileName( m_name ) );\n\n    qDebug() << \"loading sample from\" << path;\n\n    if (QFile(path).exists()) {\n        SndfileHandle snd(qPrintable(path));\n        m_data.resize(snd.frames());\n        snd.readf(m_data.data(),m_data.size());\n        m_saved = true;\n        m_savedAs = path;\n    }\n\n    m_readPos = 0;\n    m_writePos = 0;\n    m_timestamp = QFileInfo(path).lastModified();\n}\n\nbool SoundBuffer::maybeReload( const QDir& dir )\n{\n    QString path = dir.filePath( makeFileName( m_name ) );\n\n    if (QFileInfo(path).lastModified() > m_timestamp) {\n        qDebug() << \"Sample \" << m_name << \" has changed on disk\";\n\n        qint64 old_length = m_data.size();\n\n        load(dir);\n        \/*\n         * if length has changed - select all\n         *\/\n        if (m_data.size() != old_length) {\n            m_range[0] = 0;\n            m_range[1] = m_data.size()-1;\n        }\n        return true;\n    } else\n        return false;\n}\n\n\nfloat* SoundBuffer::floatAt(qint64 pos)\n{\n    return m_data.data() + pos;\n}\n\nconst float* SoundBuffer::floatAt(qint64 pos) const\n{\n    return m_data.constData() + pos;\n}\n\nvoid SoundBuffer::paste(const SoundBuffer * other)\n{\n    qint64 pasteSize = std::min(sampleCount() - m_writePos, other->sampleCount());\n    qCopy( other->m_data.begin(), other->m_data.begin() + pasteSize, m_data.begin() );\n    m_writePos += pasteSize;\n}\n\nfloat* SoundBuffer::chunkToWrite(qint64& size) {\n    size = std::min(size, sampleCount() - m_writePos);\n    float * chunk = floatAt(m_writePos);\n    m_writePos += size;\n    return chunk;\n}\n\nqint64 SoundBuffer::duration() const\n{\n    return WtsAudio::sampleCountToMs(m_data.size());\n}\n\nvoid SoundBuffer::initGains()\n{\n    float peak = 0.0;\n    foreach(float v, m_data) {\n        if (fabs(v) > peak) {\n            peak = v;\n        }\n    }\n    m_normGain = 1.0 \/ peak;\n    m_gain = peak;\n    \/\/ What?\n}\n\nfloat WTS::SoundBuffer::draw(QPixmap& surface, bool recording, float scaleMax)\n{\n    QPainter painter(&surface);\n    painter.setPen(QColor(0,0,0,100));\n    painter.fillRect(0,0,surface.width(),surface.height(), color() );\n    int midY = surface.height()\/2;\n\n    qint64 stride = 1;\n    const float * val = floatAt(0);\n    qint64 lineCount =\n            std::min((qint64)surface.width(),\n                     recording ? m_writePos : sampleCount());\n    QVector<float> Y(lineCount, 0.0);\n\n    if (recording) {\n        val = floatAt(m_writePos - lineCount);\n    } else {\n        \/\/ show the whole thing\n        stride = sampleCount() \/ lineCount;\n    }\n\n    for(int x = 0; x<lineCount; ++x) {\n        Y[x] = val[x*stride];\n        for(int i=1; i<stride; ++i) {\n            Y[x] = std::max(Y[x], (float)fabs(val[x*stride+i]));\n        }\n        scaleMax = std::max(Y[x],scaleMax);\n    }\n\n    for(int x = 0; x<lineCount; ++x) {\n        int y1 = midY + (0.45 * (Y[x]\/scaleMax) * (float)surface.height());\n        int y2 = midY - (0.45 * (Y[x]\/scaleMax) * (float)surface.height());\n        painter.drawLine(x, y1, x, y2);\n    }\n\n    painter.drawLine(lineCount, midY, surface.width(), midY);\n    return scaleMax;\n}\n\nQString WTS::SoundBuffer::makeFileName(const QString &name)\n{\n    QString badsyms = \"[^a-z0-9_]+\";\n    QRegExp lead( \"^\"+ badsyms );\n    QRegExp tail( badsyms + \"$\" );\n    QRegExp mid(badsyms);\n    QString result = name;\n    result.remove(lead).remove(tail).replace(mid,\"_\").append(\".wav\");\n    return result;\n}\n<commit_msg>don't filter out caps from sample names when making a file name<commit_after>#include \"stable.h\"\n\n#include \"SoundBuffer.h\"\n#include \"WtsAudio.h\"\n\n#include <cmath>\n\n#include <sndfile.hh>\n\nusing namespace WTS;\n\nSoundBuffer::SoundBuffer(const QString& name)\n    : m_name(name)\n    , m_saved(true)\n    , m_writePos(0)\n    , m_readPos(0)\n    , m_normGain(1)\n    , m_gain(1)\n{\n    setRange(0,0);\n}\n\nSoundBuffer::SoundBuffer(qint64 sampleCount, const QString& name)\n    : m_name(name)\n    , m_saved(true)\n    , m_data(sampleCount, 0)\n    , m_writePos(0)\n    , m_readPos(0)\n    , m_normGain(1)\n    , m_gain(1)\n{\n    setRange(0,sampleCount);\n}\n\nSoundBuffer::SoundBuffer(const QString& name, const SoundBuffer& other, qint64 sampleCount)\n    : m_name(name)\n    , m_saved(false)\n    , m_data(other.m_data)\n    , m_writePos(0)\n    , m_readPos(0)\n    , m_normGain(1)\n    , m_gain(1)\n{\n    if (sampleCount && sampleCount != other.sampleCount())\n        m_data.resize(sampleCount);\n    setRange(0,sampleCount);\n}\n\nSoundBuffer& SoundBuffer::operator= (const SoundBuffer& other)\n{\n    m_data = other.m_data;\n    m_name = other.m_name;\n    m_saved = other.m_saved;\n    m_writePos = 0;\n    m_readPos = 0;\n    m_range[0] = other.m_range[0];\n    m_range[1] = other.m_range[1];\n    m_normGain = other.m_normGain;\n    m_gain = other.m_gain;\n    return *this;\n}\n\nvoid SoundBuffer::save( const QDir& dir )\n{\n    QString path = dir.filePath( makeFileName( m_name ) );\n\n    if (m_savedAs != path) {\n        QFileInfo fi(m_savedAs);\n        if (fi.exists()) {\n            if (m_saved && fi.dir().rename( m_savedAs, path )) {\n                qDebug() << \"Renamed\" << m_savedAs << \"to\" << path;\n                m_savedAs = path;\n                return;\n            } else\n                fi.dir().remove( fi.fileName() );\n        }\n    }\n\n    if (m_saved)\n        return;\n\n    qDebug() << \"Save sample to\" << path;\n    { \/\/ block to ensure file is closed by the moment we ask its modification time\n        SndfileHandle snd(qPrintable(path),SFM_WRITE,\n                SF_FORMAT_WAV | SF_FORMAT_FLOAT,\n                1, \/\/ channel\n                WtsAudio::samplingRate());\n\n        snd.writef(m_data.data(),m_data.size());\n    }\n    m_timestamp = QFileInfo(path).lastModified();\n    m_saved = true;\n    m_savedAs = path;\n}\n\nvoid SoundBuffer::load( const QDir& dir )\n{\n    QString path = dir.filePath( makeFileName( m_name ) );\n\n    qDebug() << \"loading sample from\" << path;\n\n    if (QFile(path).exists()) {\n        SndfileHandle snd(qPrintable(path));\n        m_data.resize(snd.frames());\n        snd.readf(m_data.data(),m_data.size());\n        m_saved = true;\n        m_savedAs = path;\n    }\n\n    m_readPos = 0;\n    m_writePos = 0;\n    m_timestamp = QFileInfo(path).lastModified();\n}\n\nbool SoundBuffer::maybeReload( const QDir& dir )\n{\n    QString path = dir.filePath( makeFileName( m_name ) );\n\n    if (QFileInfo(path).lastModified() > m_timestamp) {\n        qDebug() << \"Sample \" << m_name << \" has changed on disk\";\n\n        qint64 old_length = m_data.size();\n\n        load(dir);\n        \/*\n         * if length has changed - select all\n         *\/\n        if (m_data.size() != old_length) {\n            m_range[0] = 0;\n            m_range[1] = m_data.size()-1;\n        }\n        return true;\n    } else\n        return false;\n}\n\n\nfloat* SoundBuffer::floatAt(qint64 pos)\n{\n    return m_data.data() + pos;\n}\n\nconst float* SoundBuffer::floatAt(qint64 pos) const\n{\n    return m_data.constData() + pos;\n}\n\nvoid SoundBuffer::paste(const SoundBuffer * other)\n{\n    qint64 pasteSize = std::min(sampleCount() - m_writePos, other->sampleCount());\n    qCopy( other->m_data.begin(), other->m_data.begin() + pasteSize, m_data.begin() );\n    m_writePos += pasteSize;\n}\n\nfloat* SoundBuffer::chunkToWrite(qint64& size) {\n    size = std::min(size, sampleCount() - m_writePos);\n    float * chunk = floatAt(m_writePos);\n    m_writePos += size;\n    return chunk;\n}\n\nqint64 SoundBuffer::duration() const\n{\n    return WtsAudio::sampleCountToMs(m_data.size());\n}\n\nvoid SoundBuffer::initGains()\n{\n    float peak = 0.0;\n    foreach(float v, m_data) {\n        if (fabs(v) > peak) {\n            peak = v;\n        }\n    }\n    m_normGain = 1.0 \/ peak;\n    m_gain = peak;\n    \/\/ What?\n}\n\nfloat WTS::SoundBuffer::draw(QPixmap& surface, bool recording, float scaleMax)\n{\n    QPainter painter(&surface);\n    painter.setPen(QColor(0,0,0,100));\n    painter.fillRect(0,0,surface.width(),surface.height(), color() );\n    int midY = surface.height()\/2;\n\n    qint64 stride = 1;\n    const float * val = floatAt(0);\n    qint64 lineCount =\n            std::min((qint64)surface.width(),\n                     recording ? m_writePos : sampleCount());\n    QVector<float> Y(lineCount, 0.0);\n\n    if (recording) {\n        val = floatAt(m_writePos - lineCount);\n    } else {\n        \/\/ show the whole thing\n        stride = sampleCount() \/ lineCount;\n    }\n\n    for(int x = 0; x<lineCount; ++x) {\n        Y[x] = val[x*stride];\n        for(int i=1; i<stride; ++i) {\n            Y[x] = std::max(Y[x], (float)fabs(val[x*stride+i]));\n        }\n        scaleMax = std::max(Y[x],scaleMax);\n    }\n\n    for(int x = 0; x<lineCount; ++x) {\n        int y1 = midY + (0.45 * (Y[x]\/scaleMax) * (float)surface.height());\n        int y2 = midY - (0.45 * (Y[x]\/scaleMax) * (float)surface.height());\n        painter.drawLine(x, y1, x, y2);\n    }\n\n    painter.drawLine(lineCount, midY, surface.width(), midY);\n    return scaleMax;\n}\n\nQString WTS::SoundBuffer::makeFileName(const QString &name)\n{\n    QString badsyms = \"[^a-z0-9_]+\";\n    QRegExp lead( \"^\"+ badsyms, Qt::CaseInsensitive );\n    QRegExp tail( badsyms + \"$\", Qt::CaseInsensitive );\n    QRegExp  mid( badsyms, Qt::CaseInsensitive );\n    QString result = name;\n    result.remove(lead).remove(tail).replace(mid,\"_\").append(\".wav\");\n    return result;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <boost\/hana\/equal.hpp>\n#include <boost\/hana\/for_each.hpp>\n#include <boost\/hana\/size.hpp>\n\n#include <functional>\n#include <memory>\n#include <string>\n#include <utility>\n\n#include \"all_type_variant.hpp\"\n#include \"utils\/assert.hpp\"\n\n#include \"storage\/dictionary_column.hpp\"\n#include \"storage\/reference_column.hpp\"\n#include \"storage\/value_column.hpp\"\n\nnamespace opossum {\n\nnamespace hana = boost::hana;\n\n\/**\n * Resolves a type string by creating an instance of a templated class and\n * returning it as a unique_ptr of its non-templated base class.\n *\n * @param type is a string representation of any of the supported column types\n * @param args is a list of constructor arguments\n *\n *\n * Example:\n *\n *   class BaseImpl {\n *    public:\n *     virtual void execute() = 0;\n *   };\n *\n *   template <typename T>\n *   class Impl : public BaseImpl {\n *    public:\n *     Impl(int var) : _var{var} { ... }\n *\n *     void execute() override { ... }\n *   };\n *\n *   constexpr auto var = 12;\n *   auto impl = make_unique_by_column_type<BaseImpl, Impl>(\"string\", var);\n *   impl->execute();\n *\/\ntemplate <class Base, template <typename...> class Impl, class... TemplateArgs, typename... ConstructorArgs>\nstd::unique_ptr<Base> make_unique_by_column_type(const std::string& type, ConstructorArgs&&... args) {\n  std::unique_ptr<Base> ret = nullptr;\n  hana::for_each(column_types, [&](auto x) {\n    if (std::string(hana::first(x)) == type) {\n      \/\/ The + before hana::second - which returns a reference - converts its return value\n      \/\/ into a value so that we can access ::type\n      using ColumnType = typename decltype(+hana::second(x))::type;\n      ret = std::make_unique<Impl<ColumnType, TemplateArgs...>>(std::forward<ConstructorArgs>(args)...);\n      return;\n    }\n  });\n  DebugAssert(static_cast<bool>(ret), \"unknown type \" + type);\n  return ret;\n}\n\n\/**\n * Resolves two type strings by creating an instance of a templated class and\n * returning it as a unique_ptr of its non-templated base class.\n * It does the same as make_unique_by_column_type but with two type strings.\n *\n * @param type1 is a string representation of any of the supported column types\n * @param type2 is a string representation of any of the supported column types\n * @param args is a list of constructor arguments\n *\n * Note: We need to pass parameter packs explicitly for GCC due to the following bug:\n *       http:\/\/stackoverflow.com\/questions\/41769851\/gcc-causes-segfault-for-lambda-captured-parameter-pack\n *\/\ntemplate <class Base, template <typename...> class Impl, class... TemplateArgs, typename... ConstructorArgs>\nstd::unique_ptr<Base> make_unique_by_column_types(const std::string& type1, const std::string& type2,\n                                                  ConstructorArgs&&... args) {\n  std::unique_ptr<Base> ret = nullptr;\n  hana::for_each(column_types, [&ret, &type1, &type2, &args...](auto x) {\n    if (std::string(hana::first(x)) == type1) {\n      hana::for_each(column_types, [&ret, &type2, &args...](auto y) {\n        if (std::string(hana::first(y)) == type2) {\n          using ColumnType1 = typename decltype(+hana::second(x))::type;\n          using ColumnType2 = typename decltype(+hana::second(y))::type;\n          ret =\n              std::make_unique<Impl<ColumnType1, ColumnType2, TemplateArgs...>>(std::forward<ConstructorArgs>(args)...);\n          return;\n        }\n      });\n      return;\n    }\n  });\n  DebugAssert(static_cast<bool>(ret), \"unknown type \" + type1 + \" or \" + type2);\n  return ret;\n}\n\n\/**\n * Convenience function. Calls make_unique_by_column_type and casts the result into a shared_ptr.\n *\/\ntemplate <class Base, template <typename...> class impl, class... TemplateArgs, class... ConstructorArgs>\nstd::shared_ptr<Base> make_shared_by_column_type(const std::string& type, ConstructorArgs&&... args) {\n  return make_unique_by_column_type<Base, impl, TemplateArgs...>(type, std::forward<ConstructorArgs>(args)...);\n}\n\n\/**\n * Resolves a type string by passing a hana::type object on to a generic lambda\n *\n * @param type_string is a string representation of any of the supported column types\n * @param func is a generic lambda or similar accepting a hana::type object\n *\n *\n * Note on hana::type (taken from Boost.Hana documentation):\n *\n * For subtle reasons having to do with ADL, the actual representation of hana::type is\n * implementation-defined. In particular, hana::type may be a dependent type, so one\n * should not attempt to do pattern matching on it. However, one can assume that hana::type\n * inherits from hana::basic_type, which can be useful when declaring overloaded functions.\n *\n * This means that we need to use hana::basic_type as a parameter in methods so that the\n * underlying type can be deduced from the object.\n *\n *\n * Note on generic lambdas (taken from paragraph 5.1.2\/5 of the C++14 Standard Draft n3690):\n *\n * For a generic lambda, the closure type has a public inline function call operator member template (14.5.2)\n * whose template-parameter-list consists of one invented type template-parameter for each occurrence of auto\n * in the lambda’s parameter-declaration-clause, in order of appearance. Example:\n *\n *   auto lambda = [] (auto a) { return a; };\n *\n *   class \/\/ unnamed {\n *    public:\n *     template<typename T>\n *     auto operator()(T a) const { return a; }\n *   };\n *\n *\n * Example:\n *\n *   template <typename T>\n *   process_variant(const T& var);\n *\n *   template <typename T>\n *   process_type(hana::basic_type<T> type);  \/\/ note: parameter type needs to be hana::basic_type not hana::type!\n *\n *   resolve_data_type(type_string, [&](auto type) {\n *     using Type = typename decltype(type)::type;\n *     const auto var = type_cast<Type>(variant_from_elsewhere);\n *     process_variant(var);\n *\n *     process_type(type);\n *   });\n *\/\ntemplate <typename Functor>\nvoid resolve_data_type(const std::string& type_string, const Functor& func) {\n  hana::for_each(column_types, [&](auto x) {\n    if (std::string(hana::first(x)) == type_string) {\n      \/\/ The + before hana::second - which returns a reference - converts its return value into a value\n      func(+hana::second(x));\n      return;\n    }\n  });\n}\n\n\/**\n * Given a BaseColumn and its known DataType, resolve the column implementation and call the lambda\n *\n * @param func is a generic lambda or similar accepting a reference to a specialized column (value, dictionary,\n * reference)\n *\n *\n * Example:\n *\n *   template <typename T>\n *   process_column(ValueColumn<T>& column);\n *\n *   template <typename T>\n *   process_column(DictionaryColumn<T>& column);\n *\n *   process_column(ReferenceColumn& column);\n *\n *   resolve_column_type<T>(base_column, [&](auto& typed_column) {\n *     process_column(typed_column);\n *   });\n *\/\ntemplate <typename DataType, typename Functor>\nvoid resolve_column_type(BaseColumn& column, const Functor& func) {\n  if (auto value_column = dynamic_cast<ValueColumn<DataType>*>(&column)) {\n    func(*value_column);\n  } else if (auto dict_column = dynamic_cast<DictionaryColumn<DataType>*>(&column)) {\n    func(*dict_column);\n  } else if (auto ref_column = dynamic_cast<ReferenceColumn*>(&column)) {\n    func(*ref_column);\n  } else {\n    Fail(\"Unrecognized column type encountered.\");\n  }\n}\n\n\/**\n * Resolves a type string by passing a hana::type object and the downcasted column on to a generic lambda\n *\n * @param type_string is a string representation of any of the supported column types\n * @param func is a generic lambda or similar accepting two parameters: a hana::type object and\n *   a reference to a specialized column (value, dictionary, reference)\n *\n *\n * Example:\n *\n *   template <typename T>\n *   process_column(hana::basic_type<T> type, ValueColumn<T>& column);\n *\n *   template <typename T>\n *   process_column(hana::basic_type<T> type, DictionaryColumn<T>& column);\n *\n *   template <typename T>\n *   process_column(hana::basic_type<T> type, ReferenceColumn& column);\n *\n *   resolve_data_and_column_type(column_type, base_column, [&](auto type, auto& typed_column) {\n *     process_column(type, typed_column);\n *   });\n *\/\ntemplate <typename Functor>\nvoid resolve_data_and_column_type(const std::string& type_string, BaseColumn& column, const Functor& func) {\n  resolve_data_type(type_string, [&](auto data_type) {\n    using DataType = typename decltype(data_type)::type;\n\n    resolve_column_type<DataType>(column, [&](auto& typed_column) { func(data_type, typed_column); });\n  });\n}\n\n\/**\n * This function returns the name of an Opossum datatype based on the definition in column_types.\n *\/\ntemplate <typename T>\nstd::string type_string_from_type() {\n  const auto func = [](std::string s, auto type_tuple) {\n    \/\/ a matching type was found before\n    if (s.size() != 0) {\n      return s;\n    }\n\n    \/\/ check whether T is one of the Opossum datatypes\n    if (hana::type_c<T> == hana::second(type_tuple)) {\n      return std::string{hana::first(type_tuple)};\n    }\n\n    return std::string{};\n  };\n\n  const auto type_string = hana::fold_left(column_types, std::string{}, func);\n  Assert(type_string.size() > 0, \"Trying to parse unknown type which is not part of AllTypeVariant\");\n\n  return type_string;\n}\n\n\/**\n * This function returns the name of an Opossum datatype based on the definition in column_types.\n *\/\ninline std::string type_string_from_all_type_variant(const AllTypeVariant& all_type_variant) {\n  \/\/ Special case for NullValue data type\n  if (all_type_variant.which() == 0) {\n    return \"None\";\n  }\n\n  \/\/ iterate over column_types\n  int column_types_index = 1;\n\n  auto func = [all_type_variant, &column_types_index](std::string s, auto type_tuple) {\n    \/\/ a matching type was found before\n    if (s.size() != 0) {\n      return s;\n    }\n\n    if (all_type_variant.which() == column_types_index) {\n      column_types_index++;\n      return std::string{hana::first(type_tuple)};\n    }\n\n    column_types_index++;\n    return std::string{};\n  };\n\n  return hana::fold_left(column_types, std::string{}, func);\n}\n\n}  \/\/ namespace opossum\n<commit_msg>Allow resolve_column_type to use const (#350)<commit_after>#pragma once\n\n#include <boost\/hana\/equal.hpp>\n#include <boost\/hana\/for_each.hpp>\n#include <boost\/hana\/size.hpp>\n\n#include <functional>\n#include <memory>\n#include <string>\n#include <utility>\n\n#include \"all_type_variant.hpp\"\n#include \"utils\/assert.hpp\"\n\n#include \"storage\/dictionary_column.hpp\"\n#include \"storage\/reference_column.hpp\"\n#include \"storage\/value_column.hpp\"\n\nnamespace opossum {\n\nnamespace hana = boost::hana;\n\n\/**\n * Resolves a type string by creating an instance of a templated class and\n * returning it as a unique_ptr of its non-templated base class.\n *\n * @param type is a string representation of any of the supported column types\n * @param args is a list of constructor arguments\n *\n *\n * Example:\n *\n *   class BaseImpl {\n *    public:\n *     virtual void execute() = 0;\n *   };\n *\n *   template <typename T>\n *   class Impl : public BaseImpl {\n *    public:\n *     Impl(int var) : _var{var} { ... }\n *\n *     void execute() override { ... }\n *   };\n *\n *   constexpr auto var = 12;\n *   auto impl = make_unique_by_column_type<BaseImpl, Impl>(\"string\", var);\n *   impl->execute();\n *\/\ntemplate <class Base, template <typename...> class Impl, class... TemplateArgs, typename... ConstructorArgs>\nstd::unique_ptr<Base> make_unique_by_column_type(const std::string& type, ConstructorArgs&&... args) {\n  std::unique_ptr<Base> ret = nullptr;\n  hana::for_each(column_types, [&](auto x) {\n    if (std::string(hana::first(x)) == type) {\n      \/\/ The + before hana::second - which returns a reference - converts its return value\n      \/\/ into a value so that we can access ::type\n      using ColumnType = typename decltype(+hana::second(x))::type;\n      ret = std::make_unique<Impl<ColumnType, TemplateArgs...>>(std::forward<ConstructorArgs>(args)...);\n      return;\n    }\n  });\n  DebugAssert(static_cast<bool>(ret), \"unknown type \" + type);\n  return ret;\n}\n\n\/**\n * Resolves two type strings by creating an instance of a templated class and\n * returning it as a unique_ptr of its non-templated base class.\n * It does the same as make_unique_by_column_type but with two type strings.\n *\n * @param type1 is a string representation of any of the supported column types\n * @param type2 is a string representation of any of the supported column types\n * @param args is a list of constructor arguments\n *\n * Note: We need to pass parameter packs explicitly for GCC due to the following bug:\n *       http:\/\/stackoverflow.com\/questions\/41769851\/gcc-causes-segfault-for-lambda-captured-parameter-pack\n *\/\ntemplate <class Base, template <typename...> class Impl, class... TemplateArgs, typename... ConstructorArgs>\nstd::unique_ptr<Base> make_unique_by_column_types(const std::string& type1, const std::string& type2,\n                                                  ConstructorArgs&&... args) {\n  std::unique_ptr<Base> ret = nullptr;\n  hana::for_each(column_types, [&ret, &type1, &type2, &args...](auto x) {\n    if (std::string(hana::first(x)) == type1) {\n      hana::for_each(column_types, [&ret, &type2, &args...](auto y) {\n        if (std::string(hana::first(y)) == type2) {\n          using ColumnType1 = typename decltype(+hana::second(x))::type;\n          using ColumnType2 = typename decltype(+hana::second(y))::type;\n          ret =\n              std::make_unique<Impl<ColumnType1, ColumnType2, TemplateArgs...>>(std::forward<ConstructorArgs>(args)...);\n          return;\n        }\n      });\n      return;\n    }\n  });\n  DebugAssert(static_cast<bool>(ret), \"unknown type \" + type1 + \" or \" + type2);\n  return ret;\n}\n\n\/**\n * Convenience function. Calls make_unique_by_column_type and casts the result into a shared_ptr.\n *\/\ntemplate <class Base, template <typename...> class impl, class... TemplateArgs, class... ConstructorArgs>\nstd::shared_ptr<Base> make_shared_by_column_type(const std::string& type, ConstructorArgs&&... args) {\n  return make_unique_by_column_type<Base, impl, TemplateArgs...>(type, std::forward<ConstructorArgs>(args)...);\n}\n\n\/**\n * Resolves a type string by passing a hana::type object on to a generic lambda\n *\n * @param type_string is a string representation of any of the supported column types\n * @param func is a generic lambda or similar accepting a hana::type object\n *\n *\n * Note on hana::type (taken from Boost.Hana documentation):\n *\n * For subtle reasons having to do with ADL, the actual representation of hana::type is\n * implementation-defined. In particular, hana::type may be a dependent type, so one\n * should not attempt to do pattern matching on it. However, one can assume that hana::type\n * inherits from hana::basic_type, which can be useful when declaring overloaded functions.\n *\n * This means that we need to use hana::basic_type as a parameter in methods so that the\n * underlying type can be deduced from the object.\n *\n *\n * Note on generic lambdas (taken from paragraph 5.1.2\/5 of the C++14 Standard Draft n3690):\n *\n * For a generic lambda, the closure type has a public inline function call operator member template (14.5.2)\n * whose template-parameter-list consists of one invented type template-parameter for each occurrence of auto\n * in the lambda’s parameter-declaration-clause, in order of appearance. Example:\n *\n *   auto lambda = [] (auto a) { return a; };\n *\n *   class \/\/ unnamed {\n *    public:\n *     template<typename T>\n *     auto operator()(T a) const { return a; }\n *   };\n *\n *\n * Example:\n *\n *   template <typename T>\n *   process_variant(const T& var);\n *\n *   template <typename T>\n *   process_type(hana::basic_type<T> type);  \/\/ note: parameter type needs to be hana::basic_type not hana::type!\n *\n *   resolve_data_type(type_string, [&](auto type) {\n *     using Type = typename decltype(type)::type;\n *     const auto var = type_cast<Type>(variant_from_elsewhere);\n *     process_variant(var);\n *\n *     process_type(type);\n *   });\n *\/\ntemplate <typename Functor>\nvoid resolve_data_type(const std::string& type_string, const Functor& func) {\n  hana::for_each(column_types, [&](auto x) {\n    if (std::string(hana::first(x)) == type_string) {\n      \/\/ The + before hana::second - which returns a reference - converts its return value into a value\n      func(+hana::second(x));\n      return;\n    }\n  });\n}\n\n\/**\n * Given a BaseColumn and its known DataType, resolve the column implementation and call the lambda\n *\n * @param func is a generic lambda or similar accepting a reference to a specialized column (value, dictionary,\n * reference)\n *\n *\n * Example:\n *\n *   template <typename T>\n *   void process_column(ValueColumn<T>& column);\n *\n *   template <typename T>\n *   void process_column(DictionaryColumn<T>& column);\n *\n *   void process_column(ReferenceColumn& column);\n *\n *   resolve_column_type<T>(base_column, [&](auto& typed_column) {\n *     process_column(typed_column);\n *   });\n *\/\ntemplate <typename In, typename Out>\nusing Const_out_if_const_in = std::conditional_t<std::is_const<In>::value, const Out, Out>;\n\ntemplate <typename DataType, typename BaseColumnType, typename Functor>\n\/\/ BaseColumnType allows column to be const and non-const\nstd::enable_if_t<std::is_same<BaseColumn, std::remove_const_t<BaseColumnType>>::value>\n    \/*void*\/ resolve_column_type(BaseColumnType& column, const Functor& func) {\n  using ValueColumnPtr = Const_out_if_const_in<BaseColumnType, ValueColumn<DataType>*>;\n  using DictionaryColumnPtr = Const_out_if_const_in<BaseColumnType, DictionaryColumn<DataType>*>;\n  using ReferenceColumnPtr = Const_out_if_const_in<BaseColumnType, ReferenceColumn*>;\n\n  if (auto value_column = dynamic_cast<ValueColumnPtr>(&column)) {\n    func(*value_column);\n  } else if (auto dict_column = dynamic_cast<DictionaryColumnPtr>(&column)) {\n    func(*dict_column);\n  } else if (auto ref_column = dynamic_cast<ReferenceColumnPtr>(&column)) {\n    func(*ref_column);\n  } else {\n    Fail(\"Unrecognized column type encountered.\");\n  }\n}\n\n\/**\n * Resolves a type string by passing a hana::type object and the downcasted column on to a generic lambda\n *\n * @param type_string is a string representation of any of the supported column types\n * @param func is a generic lambda or similar accepting two parameters: a hana::type object and\n *   a reference to a specialized column (value, dictionary, reference)\n *\n *\n * Example:\n *\n *   template <typename T>\n *   void process_column(hana::basic_type<T> type, ValueColumn<T>& column);\n *\n *   template <typename T>\n *   void process_column(hana::basic_type<T> type, DictionaryColumn<T>& column);\n *\n *   template <typename T>\n *   void process_column(hana::basic_type<T> type, ReferenceColumn& column);\n *\n *   resolve_data_and_column_type(column_type, base_column, [&](auto type, auto& typed_column) {\n *     process_column(type, typed_column);\n *   });\n *\/\ntemplate <typename Functor, typename BaseColumnT>  \/\/ BaseColumnT allows column to be const and non-const\nstd::enable_if_t<std::is_same<BaseColumn, std::remove_const_t<BaseColumnT>>::value>\n    \/*void*\/ resolve_data_and_column_type(const std::string& type_string, BaseColumnT& column, const Functor& func) {\n  resolve_data_type(type_string, [&](auto data_type) {\n    using DataType = typename decltype(data_type)::type;\n\n    resolve_column_type<DataType>(column, [&](auto& typed_column) { func(data_type, typed_column); });\n  });\n}\n\n\/**\n * This function returns the name of an Opossum datatype based on the definition in column_types.\n *\/\ntemplate <typename T>\nstd::string type_string_from_type() {\n  const auto func = [](std::string s, auto type_tuple) {\n    \/\/ a matching type was found before\n    if (s.size() != 0) {\n      return s;\n    }\n\n    \/\/ check whether T is one of the Opossum datatypes\n    if (hana::type_c<T> == hana::second(type_tuple)) {\n      return std::string{hana::first(type_tuple)};\n    }\n\n    return std::string{};\n  };\n\n  const auto type_string = hana::fold_left(column_types, std::string{}, func);\n  Assert(type_string.size() > 0, \"Trying to parse unknown type which is not part of AllTypeVariant\");\n\n  return type_string;\n}\n\n\/**\n * This function returns the name of an Opossum datatype based on the definition in column_types.\n *\/\ninline std::string type_string_from_all_type_variant(const AllTypeVariant& all_type_variant) {\n  \/\/ Special case for NullValue data type\n  if (all_type_variant.which() == 0) {\n    return \"None\";\n  }\n\n  \/\/ iterate over column_types\n  int column_types_index = 1;\n\n  auto func = [all_type_variant, &column_types_index](std::string s, auto type_tuple) {\n    \/\/ a matching type was found before\n    if (s.size() != 0) {\n      return s;\n    }\n\n    if (all_type_variant.which() == column_types_index) {\n      column_types_index++;\n      return std::string{hana::first(type_tuple)};\n    }\n\n    column_types_index++;\n    return std::string{};\n  };\n\n  return hana::fold_left(column_types, std::string{}, func);\n}\n\n}  \/\/ namespace opossum\n<|endoftext|>"}
{"text":"<commit_before>#include \"HttpParser.h\"\n\n#include \"http_parser\/http_parser.h\"\n#include <memory>\n\nHttpParser::Status::Status(void* parser)\n\t: _parser(parser)\n{\n}\n\nunsigned HttpParser::Status::method() const\n{\n\treturn static_cast<http_parser*>(_parser)->method;\n}\n\nunsigned HttpParser::Status::code() const\n{\n\treturn static_cast<http_parser*>(_parser)->status_code;\n}\n\nclass HttpParser::Impl\n{\npublic:\n\tImpl()\n\t\t: _parser(new http_parser)\n\t\t, _settings{0}\n\t{\n\t\thttp_parser_init(_parser.get(), HTTP_REQUEST);\n\t}\n\n\tbool parseBuffer(const char* buffer, unsigned size)\n\t{\n\t\tint parsedSize = http_parser_execute(_parser.get(), &_settings, buffer, size);\n\t\treturn parsedSize == size;\n\t}\n\n\/\/callbacks\npublic:\n\tvoid setOnMessageBegin(const callback& fun)\n\t{\n\t\tstatic auto wrapper = fun;\n\t\t_settings.on_message_begin = [](http_parser*){ return wrapper(); };\n\t}\n\n\tvoid setOnMessageComplete(const callback& fun)\n\t{\n\t\tstatic auto wrapper = fun;\n\t\t_settings.on_message_complete = [](http_parser*){ return wrapper(); };\n\t}\n\n\tvoid setOnUrl(const dataCallback& fun)\n\t{\n\t\tstatic auto wrapper = fun;\n\t\t_settings.on_url = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\n\tvoid setOnHeaderField(const dataCallback& fun)\n\t{\n\t\tstatic auto wrapper = fun;\n\t\t_settings.on_header_field = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\n\tvoid setOnHeaderValue(const dataCallback& fun)\n\t{\n\t\tstatic auto wrapper = fun;\n\t\t_settings.on_header_value = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\n\tvoid setOnHeadersComplete(const infoCallback& fun)\n\t{\n\t\tstatic auto wrapper = fun;\n\t\t_settings.on_headers_complete = [](http_parser* parser){ return wrapper(HttpParser::Status(parser)); };\n\t}\n\n\tvoid setOnStatus(const dataCallback& fun)\n\t{\n\t\tstatic auto wrapper = fun;\n\t\t_settings.on_status = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\n\tvoid setOnBody(const dataCallback& fun)\n\t{\n\t\tstatic auto wrapper = fun;\n\t\t_settings.on_body = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\nprotected:\n\tstd::unique_ptr<http_parser> _parser;\n\thttp_parser_settings _settings;\n};\n\nHttpParser::HttpParser()\n\t: _pimpl(new Impl)\n{\n}\n\nHttpParser::~HttpParser()\n{\n\tdelete _pimpl;\n}\n\nbool HttpParser::parseBuffer(const std::string& buffer)\n{\n\treturn _pimpl->parseBuffer(buffer.data(), buffer.size());\n}\n\nbool HttpParser::parseBuffer(const char* buffer, unsigned size)\n{\n\treturn _pimpl->parseBuffer(buffer, size);\n}\n\nvoid HttpParser::setOnMessageBegin(callback fun)\n{\n\t_pimpl->setOnMessageBegin(fun);\n}\n\nvoid HttpParser::setOnMessageComplete(callback fun)\n{\n\t_pimpl->setOnMessageComplete(fun);\n}\n\nvoid HttpParser::setOnUrl(dataCallback fun)\n{\n\t_pimpl->setOnUrl(fun);\n}\n\nvoid HttpParser::setOnHeaderField(dataCallback fun)\n{\n\t_pimpl->setOnHeaderField(fun);\n}\n\nvoid HttpParser::setOnHeaderValue(dataCallback fun)\n{\n\t_pimpl->setOnHeaderValue(fun);\n}\n\nvoid HttpParser::setOnHeadersComplete(infoCallback fun)\n{\n\t_pimpl->setOnHeadersComplete(fun);\n}\n\nvoid HttpParser::setOnStatus(dataCallback fun)\n{\n\t_pimpl->setOnStatus(fun);\n}\n\nvoid HttpParser::setOnBody(dataCallback fun)\n{\n\t_pimpl->setOnBody(fun);\n}\n<commit_msg>Ok... trying again w\/ thread_local and doing the assignment *after* the static initialization (d'oh)<commit_after>#include \"HttpParser.h\"\n\n#include \"http_parser\/http_parser.h\"\n#include <memory>\n\nHttpParser::Status::Status(void* parser)\n\t: _parser(parser)\n{\n}\n\nunsigned HttpParser::Status::method() const\n{\n\treturn static_cast<http_parser*>(_parser)->method;\n}\n\nunsigned HttpParser::Status::code() const\n{\n\treturn static_cast<http_parser*>(_parser)->status_code;\n}\n\nclass HttpParser::Impl\n{\npublic:\n\tImpl()\n\t\t: _parser(new http_parser)\n\t\t, _settings{0}\n\t{\n\t\thttp_parser_init(_parser.get(), HTTP_REQUEST);\n\t}\n\n\tbool parseBuffer(const char* buffer, unsigned size)\n\t{\n\t\tint parsedSize = http_parser_execute(_parser.get(), &_settings, buffer, size);\n\t\treturn parsedSize == size;\n\t}\n\n\/\/callbacks\npublic:\n\tvoid setOnMessageBegin(const callback& fun)\n\t{\n\t\tstatic thread_local callback wrapper;\n\t\twrapper = fun;\n\t\t_settings.on_message_begin = [](http_parser*){ return wrapper(); };\n\t}\n\n\tvoid setOnMessageComplete(const callback& fun)\n\t{\n\t\tstatic thread_local callback wrapper;\n\t\twrapper = fun;\n\t\t_settings.on_message_complete = [](http_parser*){ return wrapper(); };\n\t}\n\n\tvoid setOnUrl(const dataCallback& fun)\n\t{\n\t\tstatic thread_local dataCallback wrapper;\n\t\twrapper = fun;\n\t\t_settings.on_url = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\n\tvoid setOnHeaderField(const dataCallback& fun)\n\t{\n\t\tstatic thread_local dataCallback wrapper;\n\t\twrapper = fun;\n\t\t_settings.on_header_field = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\n\tvoid setOnHeaderValue(const dataCallback& fun)\n\t{\n\t\tstatic thread_local dataCallback wrapper;\n\t\twrapper = fun;\n\t\t_settings.on_header_value = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\n\tvoid setOnHeadersComplete(const infoCallback& fun)\n\t{\n\t\tstatic thread_local infoCallback wrapper;\n\t\twrapper = fun;\n\t\t_settings.on_headers_complete = [](http_parser* parser){ return wrapper(HttpParser::Status(parser)); };\n\t}\n\n\tvoid setOnStatus(const dataCallback& fun)\n\t{\n\t\tstatic thread_local dataCallback wrapper;\n\t\twrapper = fun;\n\t\t_settings.on_status = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\n\tvoid setOnBody(const dataCallback& fun)\n\t{\n\t\tstatic thread_local dataCallback wrapper;\n\t\twrapper = fun;\n\t\t_settings.on_body = [](http_parser*, const char* buff, size_t len){ return wrapper(buff, len); };\n\t}\n\nprotected:\n\tstd::unique_ptr<http_parser> _parser;\n\thttp_parser_settings _settings;\n};\n\nHttpParser::HttpParser()\n\t: _pimpl(new Impl)\n{\n}\n\nHttpParser::~HttpParser()\n{\n\tdelete _pimpl;\n}\n\nbool HttpParser::parseBuffer(const std::string& buffer)\n{\n\treturn _pimpl->parseBuffer(buffer.data(), buffer.size());\n}\n\nbool HttpParser::parseBuffer(const char* buffer, unsigned size)\n{\n\treturn _pimpl->parseBuffer(buffer, size);\n}\n\nvoid HttpParser::setOnMessageBegin(callback fun)\n{\n\t_pimpl->setOnMessageBegin(fun);\n}\n\nvoid HttpParser::setOnMessageComplete(callback fun)\n{\n\t_pimpl->setOnMessageComplete(fun);\n}\n\nvoid HttpParser::setOnUrl(dataCallback fun)\n{\n\t_pimpl->setOnUrl(fun);\n}\n\nvoid HttpParser::setOnHeaderField(dataCallback fun)\n{\n\t_pimpl->setOnHeaderField(fun);\n}\n\nvoid HttpParser::setOnHeaderValue(dataCallback fun)\n{\n\t_pimpl->setOnHeaderValue(fun);\n}\n\nvoid HttpParser::setOnHeadersComplete(infoCallback fun)\n{\n\t_pimpl->setOnHeadersComplete(fun);\n}\n\nvoid HttpParser::setOnStatus(dataCallback fun)\n{\n\t_pimpl->setOnStatus(fun);\n}\n\nvoid HttpParser::setOnBody(dataCallback fun)\n{\n\t_pimpl->setOnBody(fun);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file   nth_prime3.cpp\n\/\/\/ @brief  Long distance nth prime testing.\n\/\/\/\n\/\/\/ Copyright (C) 2017 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 <primesieve.hpp>\n\n#include <stdint.h>\n#include <iostream>\n#include <cstdlib>\n\nusing namespace std;\nusing namespace primesieve;\n\nvoid nth_prime_test(int64_t n, int64_t start, int64_t iters)\n{\n  for (int64_t i = 1; i <= iters; i++)\n  {\n    int64_t i_start = (i * start) + 1;\n    int64_t prime = nth_prime(-n, i_start);\n    int64_t smaller = nth_prime(n, prime - 1);\n    int64_t larger = nth_prime(n, prime);\n\n    if (smaller >= i_start || larger < i_start)\n    {\n      cerr << endl;\n      cerr << \"nth_prime(\" << -n << \", \" << i_start << \") = \" << prime << \"   ERROR\" << endl;\n      exit(1);\n    }\n  }\n}\n\nint main()\n{\n  for (int i = 3; i <= 7; i++)\n  {\n    for (int j = 10; j <= 13; j++)\n    {\n      int64_t n = (int64_t) pow(10.0, i);\n      int64_t start = (int64_t) pow(10.0, j);\n      int64_t iters = 5;\n      \n      cout << \"nth_prime_test(\" << n << \", \" << start << \", \" << iters << \")\";\n      nth_prime_test(n, start, iters);\n      cout << \" = OK\" << endl;\n    }\n  }\n\n  cout << endl;\n  cout << \"All tests passed successfully!\" << endl;\n\n  return 0;\n}\n<commit_msg>Refactor<commit_after>\/\/\/\n\/\/\/ @file   nth_prime3.cpp\n\/\/\/ @brief  Long distance nth prime testing.\n\/\/\/\n\/\/\/ Copyright (C) 2017 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 <primesieve.hpp>\n\n#include <stdint.h>\n#include <iostream>\n#include <cstdlib>\n\nusing namespace std;\nusing namespace primesieve;\n\nvoid nth_prime_test(int64_t n, int64_t start, int64_t iters)\n{\n  for (int64_t i = 1; i <= iters; i++)\n  {\n    int64_t i_start = (i * start) + 1;\n    int64_t prime = nth_prime(-n, i_start);\n    int64_t smaller = nth_prime(n, prime - 1);\n    int64_t larger = nth_prime(n, prime);\n\n    if (i_start <= smaller || i_start > larger)\n    {\n      cerr << endl;\n      cerr << \"nth_prime(\" << -n << \", \" << i_start << \") = \" << prime << \"   ERROR\" << endl;\n      exit(1);\n    }\n  }\n}\n\nint main()\n{\n  for (int i = 3; i <= 7; i++)\n  {\n    for (int j = 10; j <= 13; j++)\n    {\n      int64_t n = (int64_t) pow(10.0, i);\n      int64_t start = (int64_t) pow(10.0, j);\n      int64_t iters = 5;\n      \n      cout << \"nth_prime_test(\" << n << \", \" << start << \", \" << iters << \")\";\n      nth_prime_test(n, start, iters);\n      cout << \" = OK\" << endl;\n    }\n  }\n\n  cout << endl;\n  cout << \"All tests passed successfully!\" << endl;\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* OCSP subtypes\n* (C) 2012 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/ocsp_types.h>\n#include <botan\/der_enc.h>\n#include <botan\/ber_dec.h>\n#include <botan\/x509_ext.h>\n#include <botan\/hash.h>\n#include <botan\/oids.h>\n\nnamespace Botan {\n\nnamespace OCSP {\n\nCertID::CertID(const X509_Certificate& issuer,\n               const BigInt& subject_serial)\n   {\n   \/*\n   In practice it seems some responders, including, notably,\n   ocsp.verisign.com, will reject anything but SHA-1 here\n   *\/\n   std::unique_ptr<HashFunction> hash(HashFunction::create(\"SHA-160\"));\n\n   m_hash_id = AlgorithmIdentifier(hash->name(), AlgorithmIdentifier::USE_NULL_PARAM);\n   m_issuer_key_hash = unlock(hash->process(issuer.subject_public_key_bitstring()));\n   m_issuer_dn_hash = unlock(hash->process(issuer.raw_subject_dn()));\n   m_subject_serial = subject_serial;\n   }\n\nbool CertID::is_id_for(const X509_Certificate& issuer,\n                       const X509_Certificate& subject) const\n   {\n   try\n      {\n      if(BigInt::decode(subject.serial_number()) != m_subject_serial)\n         return false;\n\n      std::unique_ptr<HashFunction> hash(HashFunction::create(OIDS::lookup(m_hash_id.oid)));\n\n      if(m_issuer_dn_hash != unlock(hash->process(subject.raw_issuer_dn())))\n         return false;\n\n      if(m_issuer_key_hash != unlock(hash->process(issuer.subject_public_key_bitstring())))\n         return false;\n      }\n   catch(...)\n      {\n      return false;\n      }\n\n   return true;\n   }\n\nvoid CertID::encode_into(class DER_Encoder& to) const\n   {\n   to.start_cons(SEQUENCE)\n      .encode(m_hash_id)\n      .encode(m_issuer_dn_hash, OCTET_STRING)\n      .encode(m_issuer_key_hash, OCTET_STRING)\n      .encode(m_subject_serial)\n      .end_cons();\n   }\n\nvoid CertID::decode_from(class BER_Decoder& from)\n   {\n   from.start_cons(SEQUENCE)\n      .decode(m_hash_id)\n      .decode(m_issuer_dn_hash, OCTET_STRING)\n      .decode(m_issuer_key_hash, OCTET_STRING)\n      .decode(m_subject_serial)\n      .end_cons();\n\n   }\n\nvoid SingleResponse::encode_into(class DER_Encoder&) const\n   {\n   throw Not_Implemented(\"SingleResponse::encode_into\");\n   }\n\nvoid SingleResponse::decode_from(class BER_Decoder& from)\n   {\n   BER_Object cert_status;\n   Extensions extensions;\n\n   from.start_cons(SEQUENCE)\n      .decode(m_certid)\n      .get_next(cert_status)\n      .decode(m_thisupdate)\n      .decode_optional(m_nextupdate, ASN1_Tag(0),\n                       ASN1_Tag(CONTEXT_SPECIFIC | CONSTRUCTED))\n      .decode_optional(extensions,\n                       ASN1_Tag(1),\n                       ASN1_Tag(CONTEXT_SPECIFIC | CONSTRUCTED))\n      .end_cons();\n\n   m_cert_status = cert_status.type_tag;\n   }\n\n}\n\n}\n<commit_msg>In OCSP::CertID don't crash if SHA-1 not available<commit_after>\/*\n* OCSP subtypes\n* (C) 2012 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/ocsp_types.h>\n#include <botan\/der_enc.h>\n#include <botan\/ber_dec.h>\n#include <botan\/x509_ext.h>\n#include <botan\/hash.h>\n#include <botan\/oids.h>\n\nnamespace Botan {\n\nnamespace OCSP {\n\nCertID::CertID(const X509_Certificate& issuer,\n               const BigInt& subject_serial)\n   {\n   \/*\n   In practice it seems some responders, including, notably,\n   ocsp.verisign.com, will reject anything but SHA-1 here\n   *\/\n   std::unique_ptr<HashFunction> hash(HashFunction::create_or_throw(\"SHA-160\"));\n\n   m_hash_id = AlgorithmIdentifier(hash->name(), AlgorithmIdentifier::USE_NULL_PARAM);\n   m_issuer_key_hash = unlock(hash->process(issuer.subject_public_key_bitstring()));\n   m_issuer_dn_hash = unlock(hash->process(issuer.raw_subject_dn()));\n   m_subject_serial = subject_serial;\n   }\n\nbool CertID::is_id_for(const X509_Certificate& issuer,\n                       const X509_Certificate& subject) const\n   {\n   try\n      {\n      if(BigInt::decode(subject.serial_number()) != m_subject_serial)\n         return false;\n\n      std::unique_ptr<HashFunction> hash(HashFunction::create(OIDS::lookup(m_hash_id.oid)));\n\n      if(m_issuer_dn_hash != unlock(hash->process(subject.raw_issuer_dn())))\n         return false;\n\n      if(m_issuer_key_hash != unlock(hash->process(issuer.subject_public_key_bitstring())))\n         return false;\n      }\n   catch(...)\n      {\n      return false;\n      }\n\n   return true;\n   }\n\nvoid CertID::encode_into(class DER_Encoder& to) const\n   {\n   to.start_cons(SEQUENCE)\n      .encode(m_hash_id)\n      .encode(m_issuer_dn_hash, OCTET_STRING)\n      .encode(m_issuer_key_hash, OCTET_STRING)\n      .encode(m_subject_serial)\n      .end_cons();\n   }\n\nvoid CertID::decode_from(class BER_Decoder& from)\n   {\n   from.start_cons(SEQUENCE)\n      .decode(m_hash_id)\n      .decode(m_issuer_dn_hash, OCTET_STRING)\n      .decode(m_issuer_key_hash, OCTET_STRING)\n      .decode(m_subject_serial)\n      .end_cons();\n\n   }\n\nvoid SingleResponse::encode_into(class DER_Encoder&) const\n   {\n   throw Not_Implemented(\"SingleResponse::encode_into\");\n   }\n\nvoid SingleResponse::decode_from(class BER_Decoder& from)\n   {\n   BER_Object cert_status;\n   Extensions extensions;\n\n   from.start_cons(SEQUENCE)\n      .decode(m_certid)\n      .get_next(cert_status)\n      .decode(m_thisupdate)\n      .decode_optional(m_nextupdate, ASN1_Tag(0),\n                       ASN1_Tag(CONTEXT_SPECIFIC | CONSTRUCTED))\n      .decode_optional(extensions,\n                       ASN1_Tag(1),\n                       ASN1_Tag(CONTEXT_SPECIFIC | CONSTRUCTED))\n      .end_cons();\n\n   m_cert_status = cert_status.type_tag;\n   }\n\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * Copyright 2009-2011 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 <algorithm>\n#include <votca\/csg\/topology.h>\n#include <votca\/csg\/exclusionlist.h>\n\nnamespace votca { namespace csg {\n\nvoid ExclusionList::Clear(void)\n{\n    list< exclusion_t *>::iterator iter;\n    \n    for(iter=_exclusions.begin();iter!=_exclusions.end();++iter)\n        delete *iter;    \n    _exclusions.clear(); \n}\n    \nvoid ExclusionList::CreateExclusions(Topology *top) {\n\tInteractionContainer &ic = top->BondedInteractions();\n\tInteractionContainer::iterator ia;\n\n\tfor (ia = ic.begin(); ia != ic.end(); ++ia) {\n\t\tint beads_in_int = (*ia)->BeadCount();\n\t\tlist<Bead *> l;\n\n\t\tfor (int ibead = 0; ibead < beads_in_int; ibead ++) {\n\t\t\tint ii = (*ia)->getBeadId(ibead);\n\t\t\tl.push_back(top->getBead(ii));\n\t\t}\n\t\tExcludeList(l);\n\t}\n}\n\nbool ExclusionList::IsExcluded(Bead *bead1, Bead *bead2) {\n    exclusion_t *excl;\n    if(bead1->getMolecule() == bead2->getMolecule()) return false;\n    if (bead2 < bead1) swap(bead1, bead2);\n    if ((excl = GetExclusions(bead1))) {\n        if(find(excl->_exclude.begin(), excl->_exclude.end(), bead2) \n                != excl->_exclude.end()) return true;        \n    }\n    return false;\n}\n\nstd::ostream &operator<<(std::ostream &out, ExclusionList& exl)\n{\n    list<ExclusionList::exclusion_t*>::iterator ex;\n    \n    for(ex=exl._exclusions.begin();ex!=exl._exclusions.end();++ex) {\n        list<Bead *>::iterator i;\n        out << (int)((*ex)->_atom->getId()) + 1;\n        for(i=(*ex)->_exclude.begin(); i!=(*ex)->_exclude.end(); ++i) {\n            out << \" \" << ((*i)->getId()+1);\n        }\n        out << endl;\n    }\n    return out;\n}\n\n}}\n<commit_msg>fixed Victor's new exclusion list scheme (fixes issue #165)<commit_after>\/* \n * Copyright 2009-2011 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 <algorithm>\n#include <votca\/csg\/topology.h>\n#include <votca\/csg\/exclusionlist.h>\n\nnamespace votca { namespace csg {\n\nvoid ExclusionList::Clear(void)\n{\n    list< exclusion_t *>::iterator iter;\n    \n    for(iter=_exclusions.begin();iter!=_exclusions.end();++iter)\n        delete *iter;    \n    _exclusions.clear(); \n}\n    \nvoid ExclusionList::CreateExclusions(Topology *top) {\n\tInteractionContainer &ic = top->BondedInteractions();\n\tInteractionContainer::iterator ia;\n\n\tfor (ia = ic.begin(); ia != ic.end(); ++ia) {\n\t\tint beads_in_int = (*ia)->BeadCount();\n\t\tlist<Bead *> l;\n\n\t\tfor (int ibead = 0; ibead < beads_in_int; ibead ++) {\n\t\t\tint ii = (*ia)->getBeadId(ibead);\n\t\t\tl.push_back(top->getBead(ii));\n\t\t}\n\t\tExcludeList(l);\n\t}\n}\n\nbool ExclusionList::IsExcluded(Bead *bead1, Bead *bead2) {\n    exclusion_t *excl;\n    if(bead1->getMolecule() != bead2->getMolecule()) return false;\n    if (bead2 < bead1) swap(bead1, bead2);\n    if ((excl = GetExclusions(bead1))) {\n        if(find(excl->_exclude.begin(), excl->_exclude.end(), bead2) \n                != excl->_exclude.end()) return true;        \n    }\n    return false;\n}\n\nstd::ostream &operator<<(std::ostream &out, ExclusionList& exl)\n{\n    list<ExclusionList::exclusion_t*>::iterator ex;\n    \n    for(ex=exl._exclusions.begin();ex!=exl._exclusions.end();++ex) {\n        list<Bead *>::iterator i;\n        out << (int)((*ex)->_atom->getId()) + 1;\n        for(i=(*ex)->_exclude.begin(); i!=(*ex)->_exclude.end(); ++i) {\n            out << \" \" << ((*i)->getId()+1);\n        }\n        out << endl;\n    }\n    return out;\n}\n\n}}\n<|endoftext|>"}
{"text":"<commit_before>#include <catch\/catch.hpp>\n#include <cmath>\n#include <limits>\n#include <RaPsCallion\/serializer.h>\n\nnamespace rapscallion {\nnamespace test {\n\nvoid test(const double in, const std::ptrdiff_t expected_size = -1) {\n  Serializer s;\n  serializer<decltype(+in)>::write(s, in);\n  Deserializer d(s);\n\n  const auto size = d.end - d.ptr;\n  if (expected_size >= 0)\n    CHECK(size == expected_size);\n\n  \/\/ largest encoding of IEEE754 binary64 float:\n  \/\/  (11 exponent bits + exponent sign + NaN\/inf flag) = 13 bits \/ 7 bit\/byte = 2 byte\n  \/\/  (52 bit fraction + sign) = 53 bits \/ 7 bit\/byte = 8 byte\n  \/\/ + = 10 byte\n  CHECK(size <= 10);\n\n  const auto out = serializer<decltype(+in)>::read(d);\n  if (std::isnan(in))\n    CHECK(std::isnan(out));\n  else\n    CHECK(out == in);\n}\n\n}\n}\n\nTEST_CASE(\"Floats are serialized properly\", \"[serialization]\") {\n  using namespace rapscallion::test;\n\n  \/\/ Smallest encodings, only requiring flags\n  test(std::numeric_limits<double>::infinity(), 1);\n  test(-std::numeric_limits<double>::infinity(), 1);\n  test(std::numeric_limits<double>::quiet_NaN(), 1);\n  test(0.0, 1);\n  test(-0.0, 1);\n\n  test(0.03125, 2);\n  test(-0.03125, 2);\n  test(0.0625, 2);\n  test(-0.0625, 2);\n  test(0.125, 2);\n  test(-0.125, 2);\n  test(0.25, 2);\n  test(-0.25, 2);\n  test(0.5, 2);\n  test(-0.5, 2);\n  test(1.0, 2);\n  test(-1.0, 2);\n  test(2.0, 2);\n  test(-2.0, 2);\n  test(M_PI, 9);\n  test(-M_PI, 9);\n  test((float)M_PI, 5);\n  test(-(float)M_PI, 5);\n  test(std::numeric_limits<double>::epsilon());\n  test(std::numeric_limits<double>::min());\n  test(std::numeric_limits<double>::max());\n  test(std::numeric_limits<double>::denorm_min());\n}\n<commit_msg>Put test in BDD-style sections<commit_after>#include <catch\/catch.hpp>\n#include <cmath>\n#include <limits>\n#include <RaPsCallion\/serializer.h>\n\nnamespace rapscallion {\nnamespace test {\n\nvoid test(const std::string& inStr, const double in, const std::ptrdiff_t expected_size = -1) {\n  GIVEN(\"the real number \" + inStr) {\n    WHEN(\"we serialize it\") {\n      Serializer s;\n      serializer<decltype(+in)>::write(s, in);\n      Deserializer d(s);\n\n      THEN(\"the output meets size expectations\") {\n        const auto size = d.end - d.ptr;\n        if (expected_size >= 0)\n          CHECK(size == expected_size);\n\n        \/\/ largest encoding of IEEE754 binary64 float:\n        \/\/  (11 exponent bits + exponent sign + NaN\/inf flag) = 13 bits \/ 7 bit\/byte = 2 byte\n        \/\/  (52 bit fraction + sign) = 53 bits \/ 7 bit\/byte = 8 byte\n        \/\/ + = 10 byte\n        CHECK(size <= 10);\n\n        AND_WHEN(\"we deserialize it again\") {\n          const auto out = serializer<decltype(+in)>::read(d);\n          THEN(\"the deserialized output is equal to the original input\") {\n            if (std::isnan(in))\n              CHECK(std::isnan(out));\n            else\n              CHECK(out == in);\n          }\n        }\n      }\n    }\n  }\n}\n\n}\n}\n\nSCENARIO(\"Serializing floating point numbers\", \"[serialization]\") {\n  using namespace rapscallion::test;\n\n#define STRIFY1ST(num, ...) #num\n#define TEST(...) \\\n  test(STRIFY1ST(__VA_ARGS__, void), __VA_ARGS__)\n\n  \/\/ Smallest encodings, only requiring flags\n  TEST(std::numeric_limits<double>::infinity(), 1);\n  TEST(-std::numeric_limits<double>::infinity(), 1);\n  TEST(std::numeric_limits<double>::quiet_NaN(), 1);\n  TEST(0.0, 1);\n  TEST(-0.0, 1);\n\n  TEST(0.03125, 2);\n  TEST(-0.03125, 2);\n  TEST(0.0625, 2);\n  TEST(-0.0625, 2);\n  TEST(0.125, 2);\n  TEST(-0.125, 2);\n  TEST(0.25, 2);\n  TEST(-0.25, 2);\n  TEST(0.5, 2);\n  TEST(-0.5, 2);\n  TEST(1.0, 2);\n  TEST(-1.0, 2);\n  TEST(2.0, 2);\n  TEST(-2.0, 2);\n  TEST(M_PI, 9);\n  TEST(-M_PI, 9);\n  TEST((float)M_PI, 5);\n  TEST(-(float)M_PI, 5);\n  TEST(std::numeric_limits<double>::epsilon());\n  TEST(std::numeric_limits<double>::min());\n  TEST(std::numeric_limits<double>::max(), 10);\n  TEST(std::numeric_limits<double>::denorm_min());\n\n#undef STRIFY\n#undef TEST\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifdef _WIN32\n\t#include <windows.h>\n\t#include <boost\/nowide\/convert.hpp>\n#else\n\t\/\/ any posix system\n\t#include <pthread.h>\n#endif\n\n#include <atomic>\n#include <condition_variable>\n#include <mutex>\n#include <tbb\/parallel_for.h>\n#include <tbb\/tbb_thread.h>\n#include <tbb\/task_scheduler_init.h>\n\n\n#include \"Thread.hpp\"\n\nnamespace Slic3r {\n\n#ifdef _WIN32\n\/\/ The new API is better than the old SEH style thread naming since the names also show up in crash dumpsand ETW traces.\n\/\/ Because the new API is only available on newer Windows 10, look it up dynamically.\n\ntypedef HRESULT(__stdcall* SetThreadDescriptionType)(HANDLE, PCWSTR);\ntypedef HRESULT(__stdcall* GetThreadDescriptionType)(HANDLE, PWSTR*);\n\nstatic bool \t\t\t\t\ts_SetGetThreadDescriptionInitialized = false;\nstatic HMODULE\t\t\t\t\ts_hKernel32 = nullptr;\nstatic SetThreadDescriptionType s_fnSetThreadDescription = nullptr;\nstatic GetThreadDescriptionType\ts_fnGetThreadDescription = nullptr;\n\nstatic bool WindowsGetSetThreadNameAPIInitialize()\n{\n\tif (! s_SetGetThreadDescriptionInitialized) {\n\t\t\/\/ Not thread safe! It is therefore a good idea to name the main thread before spawning worker threads\n\t\t\/\/ to initialize \n\t\ts_hKernel32 = LoadLibraryW(L\"Kernel32.dll\");\n\t\tif (s_hKernel32) {\n\t\t\ts_fnSetThreadDescription = (SetThreadDescriptionType)::GetProcAddress(s_hKernel32, \"SetThreadDescription\");\n\t\t\ts_fnGetThreadDescription = (GetThreadDescriptionType)::GetProcAddress(s_hKernel32, \"GetThreadDescription\");\n\t\t}\n\t\ts_SetGetThreadDescriptionInitialized = true;\n\t}\n\treturn s_fnSetThreadDescription && s_fnGetThreadDescription;\n}\n\n#ifndef NDEBUG\n\t\/\/ Use the old way by throwing an exception, so at least in Debug mode the thread names are shown by the debugger.\n\tstatic constexpr DWORD MSVC_SEH_EXCEPTION_NAME_THREAD = 0x406D1388;\n\n#pragma pack(push,8)\n\ttypedef struct tagTHREADNAME_INFO\n\t{\n\t\tDWORD  dwType; \t\t\/\/ Must be 0x1000.\n\t\tLPCSTR szName; \t\t\/\/ Pointer to name (in user addr space).\n\t\tDWORD  dwThreadID; \t\/\/ Thread ID (-1=caller thread).\n\t\tDWORD  dwFlags; \t\/\/ Reserved for future use, must be zero.\n\t} THREADNAME_INFO;\n#pragma pack(pop)\n\n\tstatic void WindowsSetThreadNameSEH(HANDLE hThread, const char* thread_name)\n\t{\n\t\tTHREADNAME_INFO info;\n\t\tinfo.dwType \t= 0x1000;\n\t\tinfo.szName \t= thread_name;\n\t\tinfo.dwThreadID = ::GetThreadId(hThread);\n\t\tinfo.dwFlags \t= 0;\n\t\t__try {\n\t\t\tRaiseException(MSVC_SEH_EXCEPTION_NAME_THREAD, 0, sizeof(info) \/ sizeof(ULONG_PTR), (ULONG_PTR*)&info);\n\t\t} __except (EXCEPTION_EXECUTE_HANDLER) {\n\t\t}\n\t}\n#endif \/\/ NDEBUG\n\nstatic bool WindowsSetThreadName(HANDLE hThread, const char *thread_name)\n{\n\tif (! WindowsGetSetThreadNameAPIInitialize()) {\n#ifdef NDEBUG\n\t\treturn false;\n#else \/\/ NDEBUG\n\t\t\/\/ Running on Windows 7 or old Windows 7 in debug mode,\n\t\t\/\/ inform the debugger about the thread name by throwing an SEH.\n\t\tWindowsSetThreadNameSEH(hThread, thread_name);\n\t\treturn true;\n#endif \/\/ NDEBUG\n\t}\n\n\tsize_t len = strlen(thread_name);\n\tif (len < 1024) {\n\t\t\/\/ Allocate the temp string on stack.\n\t\twchar_t buf[1024];\n\t\ts_fnSetThreadDescription(hThread, boost::nowide::widen(buf, 1024, thread_name));\n\t} else {\n\t\t\/\/ Allocate dynamically.\n\t\ts_fnSetThreadDescription(hThread, boost::nowide::widen(thread_name).c_str());\n\t}\n\treturn true;\n}\n\nbool set_thread_name(std::thread &thread, const char *thread_name)\n{\n   \treturn WindowsSetThreadName(static_cast<HANDLE>(thread.native_handle()), thread_name);\n}\n\nbool set_thread_name(boost::thread &thread, const char *thread_name)\n{\n   \treturn WindowsSetThreadName(static_cast<HANDLE>(thread.native_handle()), thread_name);\n}\n\nbool set_current_thread_name(const char *thread_name)\n{\n    return WindowsSetThreadName(::GetCurrentThread(), thread_name);\n}\n\nstd::optional<std::string> get_current_thread_name()\n{\n\tif (! WindowsGetSetThreadNameAPIInitialize())\n\t\treturn std::nullopt;\n\n\twchar_t *ptr = nullptr;\n\ts_fnGetThreadDescription(::GetCurrentThread(), &ptr);\n\treturn (ptr == nullptr) ? std::string() : boost::nowide::narrow(ptr);\n}\n\n#else \/\/ _WIN32\n\n#ifdef __APPLE__\n\n\/\/ Appe screwed the Posix norm.\nbool set_thread_name(std::thread &thread, const char *thread_name)\n{\n\/\/ not supported\n\/\/   \tpthread_setname_np(thread.native_handle(), thread_name);\n\treturn false;\n}\n\nbool set_thread_name(boost::thread &thread, const char *thread_name)\n{\n\/\/ not supported\t\n\/\/   \tpthread_setname_np(thread.native_handle(), thread_name);\n\treturn false;\n}\n\nbool set_current_thread_name(const char *thread_name)\n{\n\tpthread_setname_np(thread_name);\n\treturn true;\n}\n\nstd::optional<std::string> get_current_thread_name()\n{\n\/\/ not supported\t\n\/\/\tchar buf[16];\n\/\/\treturn std::string(thread_getname_np(buf, 16) == 0 ? buf : \"\");\n\treturn std::nullopt;\n}\n\n#else\n\n\/\/ posix\nbool set_thread_name(std::thread &thread, const char *thread_name)\n{\n   \tpthread_setname_np(thread.native_handle(), thread_name);\n\treturn true;\n}\n\nbool set_thread_name(boost::thread &thread, const char *thread_name)\n{\n   \tpthread_setname_np(thread.native_handle(), thread_name);\n\treturn true;\n}\n\nbool set_current_thread_name(const char *thread_name)\n{\n\tpthread_setname_np(pthread_self(), thread_name);\n\treturn true;\n}\n\nstd::optional<std::string> get_current_thread_name()\n{\n\tchar buf[16];\n\treturn std::string(pthread_getname_np(pthread_self(), buf, 16) == 0 ? buf : \"\");\n}\n\n#endif\n\n#endif \/\/ _WIN32\n\n\/\/ Spawn (n - 1) worker threads on Intel TBB thread pool and name them by an index and a system thread ID.\nvoid name_tbb_thread_pool_threads()\n{\n\tstatic bool initialized = false;\n\tif (initialized)\n\t\treturn;\n\tinitialized = true;\n\n\tconst size_t nthreads_hw = std::thread::hardware_concurrency();\n\tsize_t \t\t nthreads    = nthreads_hw;\n\n#ifdef SLIC3R_PROFILE\n\t\/\/ Shiny profiler is not thread safe, thus disable parallelization.\n\tnthreads = 1;\n#endif\n\n\tif (nthreads != nthreads_hw) \n\t\tnew tbb::task_scheduler_init(int(nthreads));\n\n\tstd::atomic<size_t>\t\tnthreads_running(0);\n\tstd::condition_variable cv;\n\tstd::mutex\t\t\t\tcv_m;\n\tauto\t\t\t\t\tmaster_thread_id = tbb::this_tbb_thread::get_id();\n    tbb::parallel_for(\n        tbb::blocked_range<size_t>(0, nthreads, 1),\n        [&nthreads_running, nthreads, &master_thread_id, &cv, &cv_m](const tbb::blocked_range<size_t> &range) {\n        \tassert(range.begin() + 1 == range.end());\n        \tif (nthreads_running.fetch_add(1) + 1 == nthreads) {\n        \t\t\/\/ All threads are spinning.\n        \t\t\/\/ Wake them up.\n    \t\t\tcv.notify_all();\n        \t} else {\n        \t\t\/\/ Wait for the last thread to wake the others.\n\t\t\t\tstd::unique_lock<std::mutex> lk(cv_m);\n\t\t\t    cv.wait(lk, [&nthreads_running, nthreads]{return nthreads_running == nthreads;});\n        \t}\n        \tauto thread_id = tbb::this_tbb_thread::get_id();\n\t\t\tif (thread_id == master_thread_id) {\n\t\t\t\t\/\/ The calling thread runs the 0'th task.\n\t\t\t\tassert(range.begin() == 0);\n\t\t\t} else {\n\t\t\t\tassert(range.begin() > 0);\n\t\t\t\tstd::ostringstream name;\n\t\t        name << \"slic3r_tbb_\" << range.begin();\n\t\t        set_current_thread_name(name.str().c_str());\n    \t\t}\n        });\n}\n\n}\n<commit_msg>Fix of PrusaSlicer hangs on Linux when run with non standard task affinity #5661<commit_after>#ifdef _WIN32\n\t#include <windows.h>\n\t#include <boost\/nowide\/convert.hpp>\n#else\n\t\/\/ any posix system\n\t#include <pthread.h>\n#endif\n\n#include <atomic>\n#include <condition_variable>\n#include <mutex>\n#include <tbb\/parallel_for.h>\n#include <tbb\/tbb_thread.h>\n#include <tbb\/task_arena.h>\n#include <tbb\/task_scheduler_init.h>\n\n#include \"Thread.hpp\"\n\nnamespace Slic3r {\n\n#ifdef _WIN32\n\/\/ The new API is better than the old SEH style thread naming since the names also show up in crash dumpsand ETW traces.\n\/\/ Because the new API is only available on newer Windows 10, look it up dynamically.\n\ntypedef HRESULT(__stdcall* SetThreadDescriptionType)(HANDLE, PCWSTR);\ntypedef HRESULT(__stdcall* GetThreadDescriptionType)(HANDLE, PWSTR*);\n\nstatic bool \t\t\t\t\ts_SetGetThreadDescriptionInitialized = false;\nstatic HMODULE\t\t\t\t\ts_hKernel32 = nullptr;\nstatic SetThreadDescriptionType s_fnSetThreadDescription = nullptr;\nstatic GetThreadDescriptionType\ts_fnGetThreadDescription = nullptr;\n\nstatic bool WindowsGetSetThreadNameAPIInitialize()\n{\n\tif (! s_SetGetThreadDescriptionInitialized) {\n\t\t\/\/ Not thread safe! It is therefore a good idea to name the main thread before spawning worker threads\n\t\t\/\/ to initialize \n\t\ts_hKernel32 = LoadLibraryW(L\"Kernel32.dll\");\n\t\tif (s_hKernel32) {\n\t\t\ts_fnSetThreadDescription = (SetThreadDescriptionType)::GetProcAddress(s_hKernel32, \"SetThreadDescription\");\n\t\t\ts_fnGetThreadDescription = (GetThreadDescriptionType)::GetProcAddress(s_hKernel32, \"GetThreadDescription\");\n\t\t}\n\t\ts_SetGetThreadDescriptionInitialized = true;\n\t}\n\treturn s_fnSetThreadDescription && s_fnGetThreadDescription;\n}\n\n#ifndef NDEBUG\n\t\/\/ Use the old way by throwing an exception, so at least in Debug mode the thread names are shown by the debugger.\n\tstatic constexpr DWORD MSVC_SEH_EXCEPTION_NAME_THREAD = 0x406D1388;\n\n#pragma pack(push,8)\n\ttypedef struct tagTHREADNAME_INFO\n\t{\n\t\tDWORD  dwType; \t\t\/\/ Must be 0x1000.\n\t\tLPCSTR szName; \t\t\/\/ Pointer to name (in user addr space).\n\t\tDWORD  dwThreadID; \t\/\/ Thread ID (-1=caller thread).\n\t\tDWORD  dwFlags; \t\/\/ Reserved for future use, must be zero.\n\t} THREADNAME_INFO;\n#pragma pack(pop)\n\n\tstatic void WindowsSetThreadNameSEH(HANDLE hThread, const char* thread_name)\n\t{\n\t\tTHREADNAME_INFO info;\n\t\tinfo.dwType \t= 0x1000;\n\t\tinfo.szName \t= thread_name;\n\t\tinfo.dwThreadID = ::GetThreadId(hThread);\n\t\tinfo.dwFlags \t= 0;\n\t\t__try {\n\t\t\tRaiseException(MSVC_SEH_EXCEPTION_NAME_THREAD, 0, sizeof(info) \/ sizeof(ULONG_PTR), (ULONG_PTR*)&info);\n\t\t} __except (EXCEPTION_EXECUTE_HANDLER) {\n\t\t}\n\t}\n#endif \/\/ NDEBUG\n\nstatic bool WindowsSetThreadName(HANDLE hThread, const char *thread_name)\n{\n\tif (! WindowsGetSetThreadNameAPIInitialize()) {\n#ifdef NDEBUG\n\t\treturn false;\n#else \/\/ NDEBUG\n\t\t\/\/ Running on Windows 7 or old Windows 7 in debug mode,\n\t\t\/\/ inform the debugger about the thread name by throwing an SEH.\n\t\tWindowsSetThreadNameSEH(hThread, thread_name);\n\t\treturn true;\n#endif \/\/ NDEBUG\n\t}\n\n\tsize_t len = strlen(thread_name);\n\tif (len < 1024) {\n\t\t\/\/ Allocate the temp string on stack.\n\t\twchar_t buf[1024];\n\t\ts_fnSetThreadDescription(hThread, boost::nowide::widen(buf, 1024, thread_name));\n\t} else {\n\t\t\/\/ Allocate dynamically.\n\t\ts_fnSetThreadDescription(hThread, boost::nowide::widen(thread_name).c_str());\n\t}\n\treturn true;\n}\n\nbool set_thread_name(std::thread &thread, const char *thread_name)\n{\n   \treturn WindowsSetThreadName(static_cast<HANDLE>(thread.native_handle()), thread_name);\n}\n\nbool set_thread_name(boost::thread &thread, const char *thread_name)\n{\n   \treturn WindowsSetThreadName(static_cast<HANDLE>(thread.native_handle()), thread_name);\n}\n\nbool set_current_thread_name(const char *thread_name)\n{\n    return WindowsSetThreadName(::GetCurrentThread(), thread_name);\n}\n\nstd::optional<std::string> get_current_thread_name()\n{\n\tif (! WindowsGetSetThreadNameAPIInitialize())\n\t\treturn std::nullopt;\n\n\twchar_t *ptr = nullptr;\n\ts_fnGetThreadDescription(::GetCurrentThread(), &ptr);\n\treturn (ptr == nullptr) ? std::string() : boost::nowide::narrow(ptr);\n}\n\n#else \/\/ _WIN32\n\n#ifdef __APPLE__\n\n\/\/ Appe screwed the Posix norm.\nbool set_thread_name(std::thread &thread, const char *thread_name)\n{\n\/\/ not supported\n\/\/   \tpthread_setname_np(thread.native_handle(), thread_name);\n\treturn false;\n}\n\nbool set_thread_name(boost::thread &thread, const char *thread_name)\n{\n\/\/ not supported\t\n\/\/   \tpthread_setname_np(thread.native_handle(), thread_name);\n\treturn false;\n}\n\nbool set_current_thread_name(const char *thread_name)\n{\n\tpthread_setname_np(thread_name);\n\treturn true;\n}\n\nstd::optional<std::string> get_current_thread_name()\n{\n\/\/ not supported\t\n\/\/\tchar buf[16];\n\/\/\treturn std::string(thread_getname_np(buf, 16) == 0 ? buf : \"\");\n\treturn std::nullopt;\n}\n\n#else\n\n\/\/ posix\nbool set_thread_name(std::thread &thread, const char *thread_name)\n{\n   \tpthread_setname_np(thread.native_handle(), thread_name);\n\treturn true;\n}\n\nbool set_thread_name(boost::thread &thread, const char *thread_name)\n{\n   \tpthread_setname_np(thread.native_handle(), thread_name);\n\treturn true;\n}\n\nbool set_current_thread_name(const char *thread_name)\n{\n\tpthread_setname_np(pthread_self(), thread_name);\n\treturn true;\n}\n\nstd::optional<std::string> get_current_thread_name()\n{\n\tchar buf[16];\n\treturn std::string(pthread_getname_np(pthread_self(), buf, 16) == 0 ? buf : \"\");\n}\n\n#endif\n\n#endif \/\/ _WIN32\n\n\/\/ Spawn (n - 1) worker threads on Intel TBB thread pool and name them by an index and a system thread ID.\nvoid name_tbb_thread_pool_threads()\n{\n\tstatic bool initialized = false;\n\tif (initialized)\n\t\treturn;\n\tinitialized = true;\n\n\t\/\/ see GH issue #5661 PrusaSlicer hangs on Linux when run with non standard task affinity\n\t\/\/ TBB will respect the task affinity mask on Linux and spawn less threads than std::thread::hardware_concurrency().\n\/\/\tconst size_t nthreads_hw = std::thread::hardware_concurrency();\n\tconst size_t nthreads_hw = tbb::this_task_arena::max_concurrency();\n\tsize_t \t\t nthreads    = nthreads_hw;\n\n#ifdef SLIC3R_PROFILE\n\t\/\/ Shiny profiler is not thread safe, thus disable parallelization.\n\tnthreads = 1;\n#endif\n\n\tif (nthreads != nthreads_hw) \n\t\tnew tbb::task_scheduler_init(int(nthreads));\n\n\tstd::atomic<size_t>\t\tnthreads_running(0);\n\tstd::condition_variable cv;\n\tstd::mutex\t\t\t\tcv_m;\n\tauto\t\t\t\t\tmaster_thread_id = tbb::this_tbb_thread::get_id();\n    tbb::parallel_for(\n        tbb::blocked_range<size_t>(0, nthreads, 1),\n        [&nthreads_running, nthreads, &master_thread_id, &cv, &cv_m](const tbb::blocked_range<size_t> &range) {\n        \tassert(range.begin() + 1 == range.end());\n        \tif (nthreads_running.fetch_add(1) + 1 == nthreads) {\n        \t\t\/\/ All threads are spinning.\n        \t\t\/\/ Wake them up.\n    \t\t\tcv.notify_all();\n        \t} else {\n        \t\t\/\/ Wait for the last thread to wake the others.\n\t\t\t\tstd::unique_lock<std::mutex> lk(cv_m);\n\t\t\t    cv.wait(lk, [&nthreads_running, nthreads]{return nthreads_running == nthreads;});\n        \t}\n        \tauto thread_id = tbb::this_tbb_thread::get_id();\n\t\t\tif (thread_id == master_thread_id) {\n\t\t\t\t\/\/ The calling thread runs the 0'th task.\n\t\t\t\tassert(range.begin() == 0);\n\t\t\t} else {\n\t\t\t\tassert(range.begin() > 0);\n\t\t\t\tstd::ostringstream name;\n\t\t        name << \"slic3r_tbb_\" << range.begin();\n\t\t        set_current_thread_name(name.str().c_str());\n    \t\t}\n        });\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- LazyRandomTypeCollection.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 \"llvm\/DebugInfo\/CodeView\/LazyRandomTypeCollection.h\"\n\n#include \"llvm\/DebugInfo\/CodeView\/CVTypeVisitor.h\"\n#include \"llvm\/DebugInfo\/CodeView\/CodeViewError.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeDatabase.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeName.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeServerHandler.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeVisitorCallbacks.h\"\n\nusing namespace llvm;\nusing namespace llvm::codeview;\n\nstatic void error(Error &&EC) {\n  assert(!static_cast<bool>(EC));\n  if (EC)\n    consumeError(std::move(EC));\n}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(uint32_t RecordCountHint)\n    : LazyRandomTypeCollection(CVTypeArray(), RecordCountHint,\n                               PartialOffsetArray()) {}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(\n    const CVTypeArray &Types, uint32_t RecordCountHint,\n    PartialOffsetArray PartialOffsets)\n    : NameStorage(Allocator), Database(RecordCountHint), Types(Types),\n      DatabaseVisitor(Database), PartialOffsets(PartialOffsets) {\n  KnownOffsets.resize(Database.capacity());\n}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(ArrayRef<uint8_t> Data,\n                                                   uint32_t RecordCountHint)\n    : LazyRandomTypeCollection(RecordCountHint) {\n  reset(Data);\n}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(StringRef Data,\n                                                   uint32_t RecordCountHint)\n    : LazyRandomTypeCollection(\n          makeArrayRef(Data.bytes_begin(), Data.bytes_end()), RecordCountHint) {\n}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(const CVTypeArray &Types,\n                                                   uint32_t NumRecords)\n    : LazyRandomTypeCollection(Types, NumRecords, PartialOffsetArray()) {}\n\nvoid LazyRandomTypeCollection::reset(StringRef Data) {\n  reset(makeArrayRef(Data.bytes_begin(), Data.bytes_end()));\n}\n\nvoid LazyRandomTypeCollection::reset(ArrayRef<uint8_t> Data) {\n  PartialOffsets = PartialOffsetArray();\n\n  BinaryStreamReader Reader(Data, support::little);\n  error(Reader.readArray(Types, Reader.getLength()));\n\n  KnownOffsets.resize(Database.capacity());\n}\n\nCVType LazyRandomTypeCollection::getType(TypeIndex Index) {\n  error(ensureTypeExists(Index));\n  return Database.getTypeRecord(Index);\n}\n\nStringRef LazyRandomTypeCollection::getTypeName(TypeIndex Index) {\n  if (Index.isNoneType() || Index.isSimple())\n    return TypeIndex::simpleTypeName(Index);\n\n  uint32_t I = Index.toArrayIndex();\n  if (I >= TypeNames.size())\n    TypeNames.resize(I + 1);\n\n  if (TypeNames[I].data() == nullptr) {\n    StringRef Result = NameStorage.save(computeTypeName(*this, Index));\n    TypeNames[I] = Result;\n  }\n  return TypeNames[I];\n}\n\nbool LazyRandomTypeCollection::contains(TypeIndex Index) {\n  return Database.contains(Index);\n}\n\nuint32_t LazyRandomTypeCollection::size() { return Database.size(); }\n\nuint32_t LazyRandomTypeCollection::capacity() { return Database.capacity(); }\n\nError LazyRandomTypeCollection::ensureTypeExists(TypeIndex TI) {\n  if (!Database.contains(TI)) {\n    if (auto EC = visitRangeForType(TI))\n      return EC;\n  }\n  return Error::success();\n}\n\nError LazyRandomTypeCollection::visitRangeForType(TypeIndex TI) {\n  if (PartialOffsets.empty())\n    return fullScanForType(TI);\n\n  auto Next = std::upper_bound(PartialOffsets.begin(), PartialOffsets.end(), TI,\n                               [](TypeIndex Value, const TypeIndexOffset &IO) {\n                                 return Value < IO.Type;\n                               });\n\n  assert(Next != PartialOffsets.begin());\n  auto Prev = std::prev(Next);\n\n  TypeIndex TIB = Prev->Type;\n  if (Database.contains(TIB)) {\n    \/\/ They've asked us to fetch a type index, but the entry we found in the\n    \/\/ partial offsets array has already been visited.  Since we visit an entire\n    \/\/ block every time, that means this record should have been previously\n    \/\/ discovered.  Ultimately, this means this is a request for a non-existant\n    \/\/ type index.\n    return make_error<CodeViewError>(\"Invalid type index\");\n  }\n\n  TypeIndex TIE;\n  if (Next == PartialOffsets.end()) {\n    TIE = TypeIndex::fromArrayIndex(Database.capacity());\n  } else {\n    TIE = Next->Type;\n  }\n\n  if (auto EC = visitRange(TIB, Prev->Offset, TIE))\n    return EC;\n  return Error::success();\n}\n\nOptional<TypeIndex> LazyRandomTypeCollection::getFirst() {\n  TypeIndex TI = TypeIndex::fromArrayIndex(0);\n  if (auto EC = ensureTypeExists(TI)) {\n    consumeError(std::move(EC));\n    return None;\n  }\n  return TI;\n}\n\nOptional<TypeIndex> LazyRandomTypeCollection::getNext(TypeIndex Prev) {\n  \/\/ We can't be sure how long this type stream is, given that the initial count\n  \/\/ given to the constructor is just a hint.  So just try to make sure the next\n  \/\/ record exists, and if anything goes wrong, we must be at the end.\n  if (auto EC = ensureTypeExists(Prev + 1)) {\n    consumeError(std::move(EC));\n    return None;\n  }\n\n  return Prev + 1;\n}\n\nError LazyRandomTypeCollection::fullScanForType(TypeIndex TI) {\n  assert(PartialOffsets.empty());\n\n  TypeIndex CurrentTI = TypeIndex::fromArrayIndex(0);\n  uint32_t Offset = 0;\n  auto Begin = Types.begin();\n\n  if (!Database.empty()) {\n    \/\/ In the case of type streams which we don't know the number of records of,\n    \/\/ it's possible to search for a type index triggering a full scan, but then\n    \/\/ later additional records are added since we didn't know how many there\n    \/\/ would be until we did a full visitation, then you try to access the new\n    \/\/ type triggering another full scan.  To avoid this, we assume that if the\n    \/\/ database has some records, this must be what's going on.  So we ask the\n    \/\/ database for the largest type index less than the one we're searching for\n    \/\/ and only do the forward scan from there.\n    auto Prev = Database.largestTypeIndexLessThan(TI);\n    assert(Prev.hasValue() && \"Empty database with valid types?\");\n    Offset = KnownOffsets[Prev->toArrayIndex()];\n    CurrentTI = *Prev;\n    ++CurrentTI;\n    Begin = Types.at(Offset);\n    ++Begin;\n    Offset = Begin.offset();\n  }\n\n  auto End = Types.end();\n  while (Begin != End) {\n    if (auto EC = visitOneRecord(CurrentTI, Offset, *Begin))\n      return EC;\n\n    Offset += Begin.getRecordLength();\n    ++Begin;\n    ++CurrentTI;\n  }\n  if (CurrentTI <= TI) {\n    return make_error<CodeViewError>(\"Type Index does not exist!\");\n  }\n  return Error::success();\n}\n\nError LazyRandomTypeCollection::visitRange(TypeIndex Begin,\n                                           uint32_t BeginOffset,\n                                           TypeIndex End) {\n\n  auto RI = Types.at(BeginOffset);\n  assert(RI != Types.end());\n\n  while (Begin != End) {\n    if (auto EC = visitOneRecord(Begin, BeginOffset, *RI))\n      return EC;\n\n    BeginOffset += RI.getRecordLength();\n    ++Begin;\n    ++RI;\n  }\n\n  return Error::success();\n}\n\nError LazyRandomTypeCollection::visitOneRecord(TypeIndex TI, uint32_t Offset,\n                                               CVType &Record) {\n  assert(!Database.contains(TI));\n  if (auto EC = codeview::visitTypeRecord(Record, TI, DatabaseVisitor))\n    return EC;\n  \/\/ Keep the KnownOffsets array the same size as the Database's capacity. Since\n  \/\/ we don't always know how many records are in the type stream, we need to be\n  \/\/ prepared for the database growing and receicing a type index that can't fit\n  \/\/ in our current buffer.\n  if (KnownOffsets.size() < Database.capacity())\n    KnownOffsets.resize(Database.capacity());\n  KnownOffsets[TI.toArrayIndex()] = Offset;\n  return Error::success();\n}\n<commit_msg>Don't crash if a type record can't be found.<commit_after>\/\/===- LazyRandomTypeCollection.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 \"llvm\/DebugInfo\/CodeView\/LazyRandomTypeCollection.h\"\n\n#include \"llvm\/DebugInfo\/CodeView\/CVTypeVisitor.h\"\n#include \"llvm\/DebugInfo\/CodeView\/CodeViewError.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeDatabase.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeName.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeServerHandler.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeVisitorCallbacks.h\"\n\nusing namespace llvm;\nusing namespace llvm::codeview;\n\nstatic void error(Error &&EC) {\n  assert(!static_cast<bool>(EC));\n  if (EC)\n    consumeError(std::move(EC));\n}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(uint32_t RecordCountHint)\n    : LazyRandomTypeCollection(CVTypeArray(), RecordCountHint,\n                               PartialOffsetArray()) {}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(\n    const CVTypeArray &Types, uint32_t RecordCountHint,\n    PartialOffsetArray PartialOffsets)\n    : NameStorage(Allocator), Database(RecordCountHint), Types(Types),\n      DatabaseVisitor(Database), PartialOffsets(PartialOffsets) {\n  KnownOffsets.resize(Database.capacity());\n}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(ArrayRef<uint8_t> Data,\n                                                   uint32_t RecordCountHint)\n    : LazyRandomTypeCollection(RecordCountHint) {\n  reset(Data);\n}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(StringRef Data,\n                                                   uint32_t RecordCountHint)\n    : LazyRandomTypeCollection(\n          makeArrayRef(Data.bytes_begin(), Data.bytes_end()), RecordCountHint) {\n}\n\nLazyRandomTypeCollection::LazyRandomTypeCollection(const CVTypeArray &Types,\n                                                   uint32_t NumRecords)\n    : LazyRandomTypeCollection(Types, NumRecords, PartialOffsetArray()) {}\n\nvoid LazyRandomTypeCollection::reset(StringRef Data) {\n  reset(makeArrayRef(Data.bytes_begin(), Data.bytes_end()));\n}\n\nvoid LazyRandomTypeCollection::reset(ArrayRef<uint8_t> Data) {\n  PartialOffsets = PartialOffsetArray();\n\n  BinaryStreamReader Reader(Data, support::little);\n  error(Reader.readArray(Types, Reader.getLength()));\n\n  KnownOffsets.resize(Database.capacity());\n}\n\nCVType LazyRandomTypeCollection::getType(TypeIndex Index) {\n  error(ensureTypeExists(Index));\n  return Database.getTypeRecord(Index);\n}\n\nStringRef LazyRandomTypeCollection::getTypeName(TypeIndex Index) {\n  if (Index.isNoneType() || Index.isSimple())\n    return TypeIndex::simpleTypeName(Index);\n\n  \/\/ Try to make sure the type exists.  Even if it doesn't though, it may be\n  \/\/ because we're dumping a symbol stream with no corresponding type stream\n  \/\/ present, in which case we still want to be able to print <unknown UDT>\n  \/\/ for the type names.\n  if (auto EC = ensureTypeExists(Index)) {\n    consumeError(std::move(EC));\n    return \"<unknown UDT>\";\n  }\n\n  uint32_t I = Index.toArrayIndex();\n  if (I >= TypeNames.size())\n    TypeNames.resize(I + 1);\n\n  if (TypeNames[I].data() == nullptr) {\n    StringRef Result = NameStorage.save(computeTypeName(*this, Index));\n    TypeNames[I] = Result;\n  }\n  return TypeNames[I];\n}\n\nbool LazyRandomTypeCollection::contains(TypeIndex Index) {\n  return Database.contains(Index);\n}\n\nuint32_t LazyRandomTypeCollection::size() { return Database.size(); }\n\nuint32_t LazyRandomTypeCollection::capacity() { return Database.capacity(); }\n\nError LazyRandomTypeCollection::ensureTypeExists(TypeIndex TI) {\n  if (!Database.contains(TI)) {\n    if (auto EC = visitRangeForType(TI))\n      return EC;\n  }\n  return Error::success();\n}\n\nError LazyRandomTypeCollection::visitRangeForType(TypeIndex TI) {\n  if (PartialOffsets.empty())\n    return fullScanForType(TI);\n\n  auto Next = std::upper_bound(PartialOffsets.begin(), PartialOffsets.end(), TI,\n                               [](TypeIndex Value, const TypeIndexOffset &IO) {\n                                 return Value < IO.Type;\n                               });\n\n  assert(Next != PartialOffsets.begin());\n  auto Prev = std::prev(Next);\n\n  TypeIndex TIB = Prev->Type;\n  if (Database.contains(TIB)) {\n    \/\/ They've asked us to fetch a type index, but the entry we found in the\n    \/\/ partial offsets array has already been visited.  Since we visit an entire\n    \/\/ block every time, that means this record should have been previously\n    \/\/ discovered.  Ultimately, this means this is a request for a non-existant\n    \/\/ type index.\n    return make_error<CodeViewError>(\"Invalid type index\");\n  }\n\n  TypeIndex TIE;\n  if (Next == PartialOffsets.end()) {\n    TIE = TypeIndex::fromArrayIndex(Database.capacity());\n  } else {\n    TIE = Next->Type;\n  }\n\n  if (auto EC = visitRange(TIB, Prev->Offset, TIE))\n    return EC;\n  return Error::success();\n}\n\nOptional<TypeIndex> LazyRandomTypeCollection::getFirst() {\n  TypeIndex TI = TypeIndex::fromArrayIndex(0);\n  if (auto EC = ensureTypeExists(TI)) {\n    consumeError(std::move(EC));\n    return None;\n  }\n  return TI;\n}\n\nOptional<TypeIndex> LazyRandomTypeCollection::getNext(TypeIndex Prev) {\n  \/\/ We can't be sure how long this type stream is, given that the initial count\n  \/\/ given to the constructor is just a hint.  So just try to make sure the next\n  \/\/ record exists, and if anything goes wrong, we must be at the end.\n  if (auto EC = ensureTypeExists(Prev + 1)) {\n    consumeError(std::move(EC));\n    return None;\n  }\n\n  return Prev + 1;\n}\n\nError LazyRandomTypeCollection::fullScanForType(TypeIndex TI) {\n  assert(PartialOffsets.empty());\n\n  TypeIndex CurrentTI = TypeIndex::fromArrayIndex(0);\n  uint32_t Offset = 0;\n  auto Begin = Types.begin();\n\n  if (!Database.empty()) {\n    \/\/ In the case of type streams which we don't know the number of records of,\n    \/\/ it's possible to search for a type index triggering a full scan, but then\n    \/\/ later additional records are added since we didn't know how many there\n    \/\/ would be until we did a full visitation, then you try to access the new\n    \/\/ type triggering another full scan.  To avoid this, we assume that if the\n    \/\/ database has some records, this must be what's going on.  So we ask the\n    \/\/ database for the largest type index less than the one we're searching for\n    \/\/ and only do the forward scan from there.\n    auto Prev = Database.largestTypeIndexLessThan(TI);\n    assert(Prev.hasValue() && \"Empty database with valid types?\");\n    Offset = KnownOffsets[Prev->toArrayIndex()];\n    CurrentTI = *Prev;\n    ++CurrentTI;\n    Begin = Types.at(Offset);\n    ++Begin;\n    Offset = Begin.offset();\n  }\n\n  auto End = Types.end();\n  while (Begin != End) {\n    if (auto EC = visitOneRecord(CurrentTI, Offset, *Begin))\n      return EC;\n\n    Offset += Begin.getRecordLength();\n    ++Begin;\n    ++CurrentTI;\n  }\n  if (CurrentTI <= TI) {\n    return make_error<CodeViewError>(\"Type Index does not exist!\");\n  }\n  return Error::success();\n}\n\nError LazyRandomTypeCollection::visitRange(TypeIndex Begin,\n                                           uint32_t BeginOffset,\n                                           TypeIndex End) {\n\n  auto RI = Types.at(BeginOffset);\n  assert(RI != Types.end());\n\n  while (Begin != End) {\n    if (auto EC = visitOneRecord(Begin, BeginOffset, *RI))\n      return EC;\n\n    BeginOffset += RI.getRecordLength();\n    ++Begin;\n    ++RI;\n  }\n\n  return Error::success();\n}\n\nError LazyRandomTypeCollection::visitOneRecord(TypeIndex TI, uint32_t Offset,\n                                               CVType &Record) {\n  assert(!Database.contains(TI));\n  if (auto EC = codeview::visitTypeRecord(Record, TI, DatabaseVisitor))\n    return EC;\n  \/\/ Keep the KnownOffsets array the same size as the Database's capacity. Since\n  \/\/ we don't always know how many records are in the type stream, we need to be\n  \/\/ prepared for the database growing and receicing a type index that can't fit\n  \/\/ in our current buffer.\n  if (KnownOffsets.size() < Database.capacity())\n    KnownOffsets.resize(Database.capacity());\n  KnownOffsets[TI.toArrayIndex()] = Offset;\n  return Error::success();\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#include \"parametersController.hpp\"\n\n#include <iostream>\n\ntemplate <typename T>\nstatic bool readFromNode(cv::FileNode node, T& value)\n{\n    if(!node.isNone()) {\n        node >> value;\n        return true;\n    }\n    else\n        return false;\n}\n\nstatic bool checkAssertion(bool value, const std::string& msg)\n{\n    if(!value)\n        std::cerr << \"Error: \" << msg << std::endl;\n\n    return value;\n}\n\nbool calib::parametersController::loadFromFile(const std::string &inputFileName)\n{\n    cv::FileStorage reader;\n    reader.open(inputFileName, cv::FileStorage::READ);\n\n    if(!reader.isOpened()) {\n        std::cerr << \"Warning: Unable to open \" << inputFileName <<\n                     \" Application started with default advanced parameters\" << std::endl;\n        return true;\n    }\n\n    readFromNode(reader[\"charuco_dict\"], mCapParams.charucoDictName);\n    if (readFromNode(reader[\"charuco_square_lenght\"], mCapParams.charucoSquareLength)) {\n        std::cout << \"DEPRECATION: Parameter 'charuco_square_lenght' has been deprecated (typo). Use 'charuco_square_length' instead.\" << std::endl;\n    }\n    readFromNode(reader[\"charuco_square_length\"], mCapParams.charucoSquareLength);\n    readFromNode(reader[\"charuco_marker_size\"], mCapParams.charucoMarkerSize);\n    readFromNode(reader[\"camera_resolution\"], mCapParams.cameraResolution);\n    readFromNode(reader[\"calibration_step\"], mCapParams.calibrationStep);\n    readFromNode(reader[\"max_frames_num\"], mCapParams.maxFramesNum);\n    readFromNode(reader[\"min_frames_num\"], mCapParams.minFramesNum);\n    readFromNode(reader[\"solver_eps\"], mInternalParameters.solverEps);\n    readFromNode(reader[\"solver_max_iters\"], mInternalParameters.solverMaxIters);\n    readFromNode(reader[\"fast_solver\"], mInternalParameters.fastSolving);\n    readFromNode(reader[\"frame_filter_conv_param\"], mInternalParameters.filterAlpha);\n\n    bool retValue =\n            checkAssertion(mCapParams.charucoDictName >= 0, \"Dict name must be >= 0\") &&\n            checkAssertion(mCapParams.charucoMarkerSize > 0, \"Marker size must be positive\") &&\n            checkAssertion(mCapParams.charucoSquareLength > 0, \"Square size must be positive\") &&\n            checkAssertion(mCapParams.minFramesNum > 1, \"Minimal number of frames for calibration < 1\") &&\n            checkAssertion(mCapParams.calibrationStep > 0, \"Calibration step must be positive\") &&\n            checkAssertion(mCapParams.maxFramesNum > mCapParams.minFramesNum, \"maxFramesNum < minFramesNum\") &&\n            checkAssertion(mInternalParameters.solverEps > 0, \"Solver precision must be positive\") &&\n            checkAssertion(mInternalParameters.solverMaxIters > 0, \"Max solver iterations number must be positive\") &&\n            checkAssertion(mInternalParameters.filterAlpha >=0 && mInternalParameters.filterAlpha <=1 ,\n                           \"Frame filter convolution parameter must be in [0,1] interval\") &&\n            checkAssertion(mCapParams.cameraResolution.width > 0 && mCapParams.cameraResolution.height > 0,\n                           \"Wrong camera resolution values\");\n\n    reader.release();\n    return retValue;\n}\n\ncalib::parametersController::parametersController()\n{\n}\n\ncalib::captureParameters calib::parametersController::getCaptureParameters() const\n{\n    return mCapParams;\n}\n\ncalib::internalParameters calib::parametersController::getInternalParameters() const\n{\n    return mInternalParameters;\n}\n\nbool calib::parametersController::loadFromParser(cv::CommandLineParser &parser)\n{\n    mCapParams.flipVertical = parser.get<bool>(\"flip\");\n    mCapParams.captureDelay = parser.get<float>(\"d\");\n    mCapParams.squareSize = parser.get<float>(\"sz\");\n    mCapParams.templDst = parser.get<float>(\"dst\");\n    mCapParams.saveFrames = parser.has(\"save_frames\");\n    mCapParams.zoom = parser.get<float>(\"zoom\");\n\n    if(!checkAssertion(mCapParams.squareSize > 0, \"Distance between corners or circles must be positive\"))\n        return false;\n    if(!checkAssertion(mCapParams.templDst > 0, \"Distance between parts of dual template must be positive\"))\n        return false;\n\n    if (parser.has(\"v\")) {\n        mCapParams.source = File;\n        mCapParams.videoFileName = parser.get<std::string>(\"v\");\n    }\n    else {\n        mCapParams.source = Camera;\n        mCapParams.camID = parser.get<int>(\"ci\");\n    }\n\n    std::string templateType = parser.get<std::string>(\"t\");\n\n    if(templateType.find(\"circles\", 0) == 0) {\n        mCapParams.board = AcirclesGrid;\n        mCapParams.boardSize = cv::Size(4, 11);\n    }\n    else if(templateType.find(\"chessboard\", 0) == 0) {\n        mCapParams.board = Chessboard;\n        mCapParams.boardSize = cv::Size(7, 7);\n    }\n    else if(templateType.find(\"dualcircles\", 0) == 0) {\n        mCapParams.board = DoubleAcirclesGrid;\n        mCapParams.boardSize = cv::Size(4, 11);\n    }\n    else if(templateType.find(\"charuco\", 0) == 0) {\n        mCapParams.board = chAruco;\n        mCapParams.boardSize = cv::Size(6, 8);\n        mCapParams.charucoDictName = 0;\n        mCapParams.charucoSquareLength = 200;\n        mCapParams.charucoMarkerSize = 100;\n    }\n    else {\n        std::cerr << \"Wrong template name\\n\";\n        return false;\n    }\n\n    if(parser.has(\"w\") && parser.has(\"h\")) {\n        mCapParams.boardSize = cv::Size(parser.get<int>(\"w\"), parser.get<int>(\"h\"));\n        if(!checkAssertion(mCapParams.boardSize.width > 0 || mCapParams.boardSize.height > 0,\n                           \"Board size must be positive\"))\n            return false;\n    }\n\n    if(!checkAssertion(parser.get<std::string>(\"of\").find(\".xml\") > 0,\n                       \"Wrong output file name: correct format is [name].xml\"))\n        return false;\n\n    loadFromFile(parser.get<std::string>(\"pf\"));\n    return true;\n}\n<commit_msg>fix save_frames parameter<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 \"parametersController.hpp\"\n\n#include <iostream>\n\ntemplate <typename T>\nstatic bool readFromNode(cv::FileNode node, T& value)\n{\n    if(!node.isNone()) {\n        node >> value;\n        return true;\n    }\n    else\n        return false;\n}\n\nstatic bool checkAssertion(bool value, const std::string& msg)\n{\n    if(!value)\n        std::cerr << \"Error: \" << msg << std::endl;\n\n    return value;\n}\n\nbool calib::parametersController::loadFromFile(const std::string &inputFileName)\n{\n    cv::FileStorage reader;\n    reader.open(inputFileName, cv::FileStorage::READ);\n\n    if(!reader.isOpened()) {\n        std::cerr << \"Warning: Unable to open \" << inputFileName <<\n                     \" Application started with default advanced parameters\" << std::endl;\n        return true;\n    }\n\n    readFromNode(reader[\"charuco_dict\"], mCapParams.charucoDictName);\n    if (readFromNode(reader[\"charuco_square_lenght\"], mCapParams.charucoSquareLength)) {\n        std::cout << \"DEPRECATION: Parameter 'charuco_square_lenght' has been deprecated (typo). Use 'charuco_square_length' instead.\" << std::endl;\n    }\n    readFromNode(reader[\"charuco_square_length\"], mCapParams.charucoSquareLength);\n    readFromNode(reader[\"charuco_marker_size\"], mCapParams.charucoMarkerSize);\n    readFromNode(reader[\"camera_resolution\"], mCapParams.cameraResolution);\n    readFromNode(reader[\"calibration_step\"], mCapParams.calibrationStep);\n    readFromNode(reader[\"max_frames_num\"], mCapParams.maxFramesNum);\n    readFromNode(reader[\"min_frames_num\"], mCapParams.minFramesNum);\n    readFromNode(reader[\"solver_eps\"], mInternalParameters.solverEps);\n    readFromNode(reader[\"solver_max_iters\"], mInternalParameters.solverMaxIters);\n    readFromNode(reader[\"fast_solver\"], mInternalParameters.fastSolving);\n    readFromNode(reader[\"frame_filter_conv_param\"], mInternalParameters.filterAlpha);\n\n    bool retValue =\n            checkAssertion(mCapParams.charucoDictName >= 0, \"Dict name must be >= 0\") &&\n            checkAssertion(mCapParams.charucoMarkerSize > 0, \"Marker size must be positive\") &&\n            checkAssertion(mCapParams.charucoSquareLength > 0, \"Square size must be positive\") &&\n            checkAssertion(mCapParams.minFramesNum > 1, \"Minimal number of frames for calibration < 1\") &&\n            checkAssertion(mCapParams.calibrationStep > 0, \"Calibration step must be positive\") &&\n            checkAssertion(mCapParams.maxFramesNum > mCapParams.minFramesNum, \"maxFramesNum < minFramesNum\") &&\n            checkAssertion(mInternalParameters.solverEps > 0, \"Solver precision must be positive\") &&\n            checkAssertion(mInternalParameters.solverMaxIters > 0, \"Max solver iterations number must be positive\") &&\n            checkAssertion(mInternalParameters.filterAlpha >=0 && mInternalParameters.filterAlpha <=1 ,\n                           \"Frame filter convolution parameter must be in [0,1] interval\") &&\n            checkAssertion(mCapParams.cameraResolution.width > 0 && mCapParams.cameraResolution.height > 0,\n                           \"Wrong camera resolution values\");\n\n    reader.release();\n    return retValue;\n}\n\ncalib::parametersController::parametersController()\n{\n}\n\ncalib::captureParameters calib::parametersController::getCaptureParameters() const\n{\n    return mCapParams;\n}\n\ncalib::internalParameters calib::parametersController::getInternalParameters() const\n{\n    return mInternalParameters;\n}\n\nbool calib::parametersController::loadFromParser(cv::CommandLineParser &parser)\n{\n    mCapParams.flipVertical = parser.get<bool>(\"flip\");\n    mCapParams.captureDelay = parser.get<float>(\"d\");\n    mCapParams.squareSize = parser.get<float>(\"sz\");\n    mCapParams.templDst = parser.get<float>(\"dst\");\n    mCapParams.saveFrames = parser.get<bool>(\"save_frames\");\n    mCapParams.zoom = parser.get<float>(\"zoom\");\n\n    if(!checkAssertion(mCapParams.squareSize > 0, \"Distance between corners or circles must be positive\"))\n        return false;\n    if(!checkAssertion(mCapParams.templDst > 0, \"Distance between parts of dual template must be positive\"))\n        return false;\n\n    if (parser.has(\"v\")) {\n        mCapParams.source = File;\n        mCapParams.videoFileName = parser.get<std::string>(\"v\");\n    }\n    else {\n        mCapParams.source = Camera;\n        mCapParams.camID = parser.get<int>(\"ci\");\n    }\n\n    std::string templateType = parser.get<std::string>(\"t\");\n\n    if(templateType.find(\"circles\", 0) == 0) {\n        mCapParams.board = AcirclesGrid;\n        mCapParams.boardSize = cv::Size(4, 11);\n    }\n    else if(templateType.find(\"chessboard\", 0) == 0) {\n        mCapParams.board = Chessboard;\n        mCapParams.boardSize = cv::Size(7, 7);\n    }\n    else if(templateType.find(\"dualcircles\", 0) == 0) {\n        mCapParams.board = DoubleAcirclesGrid;\n        mCapParams.boardSize = cv::Size(4, 11);\n    }\n    else if(templateType.find(\"charuco\", 0) == 0) {\n        mCapParams.board = chAruco;\n        mCapParams.boardSize = cv::Size(6, 8);\n        mCapParams.charucoDictName = 0;\n        mCapParams.charucoSquareLength = 200;\n        mCapParams.charucoMarkerSize = 100;\n    }\n    else {\n        std::cerr << \"Wrong template name\\n\";\n        return false;\n    }\n\n    if(parser.has(\"w\") && parser.has(\"h\")) {\n        mCapParams.boardSize = cv::Size(parser.get<int>(\"w\"), parser.get<int>(\"h\"));\n        if(!checkAssertion(mCapParams.boardSize.width > 0 || mCapParams.boardSize.height > 0,\n                           \"Board size must be positive\"))\n            return false;\n    }\n\n    if(!checkAssertion(parser.get<std::string>(\"of\").find(\".xml\") > 0,\n                       \"Wrong output file name: correct format is [name].xml\"))\n        return false;\n\n    loadFromFile(parser.get<std::string>(\"pf\"));\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *   Copyright (C) 2004 by Stanislav Karchebny                             *\n *   Stanislav.Karchebny@kdemail.net                                       *\n *                                                                         *\n *   Licensed under GPL.                                                   *\n ***************************************************************************\/\n\n#include \"feed.h\"\n#include \"feediconmanager.h\"\n#include \"feedscollection.h\"\n\n#include <kurl.h>\n#include <kdebug.h>\n#include <kglobal.h>\n#include <kstandarddirs.h>\n#include <kiconloader.h>\n\n#include <qtimer.h>\n#include <qlistview.h>\n#include <qdom.h>\n\nusing namespace Akregator;\nusing namespace RSS;\n\nFeed::Feed(QListViewItem *i, FeedsCollection *coll)\n    : FeedGroup(i, coll)\n    , updateTitle(false)\n    , articles()\n    , m_fetchError(false)\n    , m_fetchTries(0)\n    , m_merged(false)\n    , m_unread(0)\n{\n}\n\nFeed::~Feed()\n{\n}\n\nbool Feed::isGroup()\n{\n    return false;\n}\n\nQDomElement Feed::toXml( QDomElement parent, QDomDocument document )\n{\n    QDomElement el = document.createElement( \"outline\" );\n    el.setAttribute( \"text\", title() );\n    el.setAttribute( \"title\", title() );\n    el.setAttribute( \"xmlUrl\", xmlUrl );\n    el.setAttribute( \"htmlUrl\", htmlUrl );\n    el.setAttribute( \"description\", description );\n    el.setAttribute( \"updateTitle\", (updateTitle ? \"true\" : \"false\") );\n    el.setAttribute( \"type\", \"rss\" ); \/\/ despite some additional fields, its still \"rss\" OPML\n    el.setAttribute( \"version\", \"RSS\" );\n    parent.appendChild( el );\n    return el;\n}\n\nvoid Feed::dumpXmlData( QDomElement parent, QDomDocument doc )\n{\n    QDomElement channode = doc.createElement( \"channel\" );\n    parent.appendChild(channode);\n    QDomElement tnode = doc.createElement( \"title\" );\n    QDomText t=doc.createTextNode( title() );\n    tnode.appendChild(t);\n    channode.appendChild(tnode);\n\n    if (!htmlUrl.isEmpty())\n    {\n        QDomElement lnode = doc.createElement( \"link\" );\n        QDomText ht=doc.createTextNode( htmlUrl );\n        lnode.appendChild(ht);\n        channode.appendChild(lnode);\n    }\n\n    \/\/ rss 2.0 requires channel description\n    QDomElement dnode = doc.createElement( \"description\" );\n    QDomText dt=doc.createTextNode( htmlUrl );\n    dnode.appendChild(dt);\n    channode.appendChild(dnode);\n\n    ArticleSequence::ConstIterator it;\n    ArticleSequence::ConstIterator en=articles.end();\n    for (it = articles.begin(); it != en; ++it)\n    {\n        QDomElement enode = doc.createElement( \"item\" );\n        (*it).dumpXmlData(enode, doc);\n        channode.appendChild(enode);\n    }\n\n}\n\nvoid Feed::markAllRead()\n{\n    ArticleSequence::Iterator it;\n    ArticleSequence::Iterator en=articles.end();\n    for (it = articles.begin(); it != en; ++it)\n    {\n        (*it).setStatus(MyArticle::Read);\n    }\n    m_unread=0;\n}\n\n\nvoid Feed::appendArticles(const Document &d, bool findDups)\n{\n\/\/    kdDebug() << \"appendArticles findDups==\"<<findDups<< \" isMerged==\"<< m_merged<<endl;\n    findDups=true;\n    Article::List::ConstIterator it;\n    Article::List::ConstIterator en = d.articles().end();\n    \/\/kdDebug() << \"m_unread before appending articles==\"<<m_unread<<endl;\n    for (it = d.articles().begin(); it != en; ++it)\n    {\n        MyArticle mya(*it);\n        if (findDups)\n        {\n            ArticleSequence::ConstIterator oo=articles.find(mya);\n            if (oo == articles.end() )\n            {\n                if (m_merged)\n                    mya.setStatus(MyArticle::New);\n                else\n                {\n                    if (mya.status()==MyArticle::New)\n                        mya.setStatus(MyArticle::Unread);\n                }\n                appendArticle(mya);\n            }\n            \/*else{\n            kdDebug() << \"got dup!!\"<<mya.title()<<endl;\n            }*\/\n        }\n        else\n        {\n            MyArticle mya(*it);\n            if (!m_merged)\n            {\n                if (mya.status()==MyArticle::New)\n                    mya.setStatus(MyArticle::Unread);\n            }\n            appendArticle(mya);\n        }\n    }\n    \/\/kdDebug() << \"m_unread after appending articles==\"<<m_unread<<endl;\n}\n\nvoid Feed::appendArticle(const MyArticle &a)\n{\n    if (a.status()!=MyArticle::Read)\n        m_unread++;\n    articles.append(a);\n}\n\n\nvoid Feed::fetch(bool followDiscovery)\n{\n    m_fetchError=false;\n\tm_followDiscovery=followDiscovery;\n    m_fetchTries=0;\n\n    \/\/ mark all new as unread\n    ArticleSequence::Iterator it;\n    ArticleSequence::Iterator en=articles.end();\n    for (it = articles.begin(); it != en; ++it)\n    {\n        if ((*it).status()==MyArticle::New)\n        {\n            (*it).setStatus(MyArticle::Unread);\n        }\n    }\n\n    tryFetch();\n}\n\n\nvoid Feed::tryFetch()\n{\n    Loader *loader = Loader::create( this, SLOT(fetchCompleted(Loader *, Document, Status)) );\n    loader->loadFrom( xmlUrl, new FileRetriever );\n    \/\/ TODO: note that we probably don't want to load the favicon here enventually..\n    QTimer::singleShot( 1000, this, SLOT(loadFavicon()) );\n    \/\/loadFavicon();\n}\n\nvoid Feed::fetchCompleted(Loader *l, Document doc, Status status)\n{\n    \/\/ Note that Loader::~Loader() is private, so you cannot delete Loader instances.\n    \/\/ You don't need to do that anyway since Loader instances delete themselves.\n\n    if (status!= Success)\n    {\n        if (m_followDiscovery && (status==ParseError) && (m_fetchTries < 3) && \t\t\t(l->discoveredFeedURL().isValid()))\n        {\n            m_fetchTries++;\n            xmlUrl=l->discoveredFeedURL().url();\n            emit fetchDiscovery(this);\n            tryFetch();\n            return;\n        }\n        else\n        {\n            faviconChanged(xmlUrl, KGlobal::iconLoader()->loadIcon(\"cancel\", KIcon::Small));\n            m_fetchError=true;\n            emit fetchError(this);\n            return;\n        }\n    }\n\n    m_fetchError=false;\n    m_document=doc;\n    kdDebug() << \"Feed fetched successfully [\" << m_document.title() << \"]\" << endl;\n\n    \n    if (image.isNull())\n    {\n        QString u=xmlUrl;\n        QString imageFileName=KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\")+u.replace(\"\/\", \"_\").replace(\":\", \"_\")+\".png\";\n        image=QPixmap(imageFileName, \"PNG\");\n   \n        if (image.isNull())\n        {\n            if (m_document.image()) \/\/ if we aint got teh image\n                                    \/\/ and the feed provides one, get it....\n            {\n                connect (m_document.image(), SIGNAL(gotPixmap(const QPixmap &)),\n                                   this, SLOT(imageChanged(const QPixmap &)));\n                m_document.image()->getPixmap();\n            }\n        }\n    }\n    \n    if (updateTitle || title().isEmpty()) setTitle( m_document.title() );\n\n    description = m_document.description();\n    htmlUrl = m_document.link().url();\n\n    \/\/kdDebug() << \"ismerged reprots:::\"<<isMerged()<<endl;\n\n    bool findDups=isMerged();\n    appendArticles(m_document, findDups);\n\n    emit fetched(this);\n}\n\nvoid Feed::loadFavicon()\n{\n    FeedIconManager::self()->loadIcon(xmlUrl);\n    connect (FeedIconManager::self(), SIGNAL(iconChanged(const QString &, const QPixmap &)),\n                                this, SLOT(faviconChanged(const QString &, const QPixmap &)));\n}\n\nvoid Feed::faviconChanged(const QString &url, const QPixmap &p)\n{\n    if (xmlUrl==url && !m_fetchError)\n    {\n        if (item())\n            item()->setPixmap(0, p);\n        favicon=p;\n        emit(faviconLoaded(this)); \/\/ emit so that other sources can be updated.. not used right now\n    }\n}\n\nvoid Feed::imageChanged(const QPixmap &p)\n{\n    image=p;\n    QString u=xmlUrl;\n    image.save(KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\")+u.replace(\"\/\", \"_\").replace(\":\", \"_\")+\".png\",\"PNG\");\n    emit(imageLoaded(this));\n}\n\n\/\/ = ArticleSequence ===================================================== \/\/\n\nstruct ArticleSequence::Private\n{\n   int dummy;\n\/\/   bool doSort :1;\n};\n\nArticleSequence::ArticleSequence()\n   : MyArticle::List()\n   , d(new Private)\n{\n}\n\nArticleSequence::ArticleSequence(const ArticleSequence &other)\n   : MyArticle::List(other)\n   , d(new Private)\n{\n}\n\nArticleSequence::~ArticleSequence()\n{\n   delete d;\n}\n\n\/*\n    The reason to include insert\/append\/prepend code here is to:\n    a) check if there's another record with the exactly same pubDate() present,\n    b) if so, adjust this inserted item's clock off by one second to keep sorting sane,\n    c) re-sort added items (if enabled).\n    d) use MyArticle::fetchDate for sorting! ( defined by MyArticle::operator <() )\n *\/\nArticleSequence::iterator ArticleSequence::insert( iterator it, const MyArticle &x )\n{\n    return MyArticle::List::insert( it, x );\n}\n\nvoid ArticleSequence::insert( iterator it, size_type n, const MyArticle &x )\n{\n    MyArticle::List::insert( it, n, x );\n}\n\nArticleSequence::iterator ArticleSequence::append( const MyArticle &x )\n{\n    return MyArticle::List::append( x );\n}\n\nArticleSequence::iterator ArticleSequence::prepend( const MyArticle &x )\n{\n    return MyArticle::List::prepend( x );\n}\n\n\/*\nvoid ArticleSequence::doNotSort()\n{\n    d->doSort = false;\n}\n\nvoid ArticleSequence::sort()\n{\n    d->doSort = true;\n\/\/    qHeapSort( *this );\n}\n*\/\n\n#include \"feed.moc\"\n<commit_msg>reset the feed favicon if it error'd last time fetching it.<commit_after>\/***************************************************************************\n *   Copyright (C) 2004 by Stanislav Karchebny                             *\n *   Stanislav.Karchebny@kdemail.net                                       *\n *                                                                         *\n *   Licensed under GPL.                                                   *\n ***************************************************************************\/\n\n#include \"feed.h\"\n#include \"feediconmanager.h\"\n#include \"feedscollection.h\"\n\n#include <kurl.h>\n#include <kdebug.h>\n#include <kglobal.h>\n#include <kstandarddirs.h>\n#include <kiconloader.h>\n\n#include <qtimer.h>\n#include <qlistview.h>\n#include <qdom.h>\n\nusing namespace Akregator;\nusing namespace RSS;\n\nFeed::Feed(QListViewItem *i, FeedsCollection *coll)\n    : FeedGroup(i, coll)\n    , updateTitle(false)\n    , articles()\n    , m_fetchError(false)\n    , m_fetchTries(0)\n    , m_merged(false)\n    , m_unread(0)\n{\n}\n\nFeed::~Feed()\n{\n}\n\nbool Feed::isGroup()\n{\n    return false;\n}\n\nQDomElement Feed::toXml( QDomElement parent, QDomDocument document )\n{\n    QDomElement el = document.createElement( \"outline\" );\n    el.setAttribute( \"text\", title() );\n    el.setAttribute( \"title\", title() );\n    el.setAttribute( \"xmlUrl\", xmlUrl );\n    el.setAttribute( \"htmlUrl\", htmlUrl );\n    el.setAttribute( \"description\", description );\n    el.setAttribute( \"updateTitle\", (updateTitle ? \"true\" : \"false\") );\n    el.setAttribute( \"type\", \"rss\" ); \/\/ despite some additional fields, its still \"rss\" OPML\n    el.setAttribute( \"version\", \"RSS\" );\n    parent.appendChild( el );\n    return el;\n}\n\nvoid Feed::dumpXmlData( QDomElement parent, QDomDocument doc )\n{\n    QDomElement channode = doc.createElement( \"channel\" );\n    parent.appendChild(channode);\n    QDomElement tnode = doc.createElement( \"title\" );\n    QDomText t=doc.createTextNode( title() );\n    tnode.appendChild(t);\n    channode.appendChild(tnode);\n\n    if (!htmlUrl.isEmpty())\n    {\n        QDomElement lnode = doc.createElement( \"link\" );\n        QDomText ht=doc.createTextNode( htmlUrl );\n        lnode.appendChild(ht);\n        channode.appendChild(lnode);\n    }\n\n    \/\/ rss 2.0 requires channel description\n    QDomElement dnode = doc.createElement( \"description\" );\n    QDomText dt=doc.createTextNode( htmlUrl );\n    dnode.appendChild(dt);\n    channode.appendChild(dnode);\n\n    ArticleSequence::ConstIterator it;\n    ArticleSequence::ConstIterator en=articles.end();\n    for (it = articles.begin(); it != en; ++it)\n    {\n        QDomElement enode = doc.createElement( \"item\" );\n        (*it).dumpXmlData(enode, doc);\n        channode.appendChild(enode);\n    }\n\n}\n\nvoid Feed::markAllRead()\n{\n    ArticleSequence::Iterator it;\n    ArticleSequence::Iterator en=articles.end();\n    for (it = articles.begin(); it != en; ++it)\n    {\n        (*it).setStatus(MyArticle::Read);\n    }\n    m_unread=0;\n}\n\n\nvoid Feed::appendArticles(const Document &d, bool findDups)\n{\n\/\/    kdDebug() << \"appendArticles findDups==\"<<findDups<< \" isMerged==\"<< m_merged<<endl;\n    findDups=true;\n    Article::List::ConstIterator it;\n    Article::List::ConstIterator en = d.articles().end();\n    \/\/kdDebug() << \"m_unread before appending articles==\"<<m_unread<<endl;\n    for (it = d.articles().begin(); it != en; ++it)\n    {\n        MyArticle mya(*it);\n        if (findDups)\n        {\n            ArticleSequence::ConstIterator oo=articles.find(mya);\n            if (oo == articles.end() )\n            {\n                if (m_merged)\n                    mya.setStatus(MyArticle::New);\n                else\n                {\n                    if (mya.status()==MyArticle::New)\n                        mya.setStatus(MyArticle::Unread);\n                }\n                appendArticle(mya);\n            }\n            \/*else{\n            kdDebug() << \"got dup!!\"<<mya.title()<<endl;\n            }*\/\n        }\n        else\n        {\n            MyArticle mya(*it);\n            if (!m_merged)\n            {\n                if (mya.status()==MyArticle::New)\n                    mya.setStatus(MyArticle::Unread);\n            }\n            appendArticle(mya);\n        }\n    }\n    \/\/kdDebug() << \"m_unread after appending articles==\"<<m_unread<<endl;\n}\n\nvoid Feed::appendArticle(const MyArticle &a)\n{\n    if (a.status()!=MyArticle::Read)\n        m_unread++;\n    articles.append(a);\n}\n\n\nvoid Feed::fetch(bool followDiscovery)\n{\n\tm_followDiscovery=followDiscovery;\n    m_fetchTries=0;\n\n    \/\/ mark all new as unread\n    ArticleSequence::Iterator it;\n    ArticleSequence::Iterator en=articles.end();\n    for (it = articles.begin(); it != en; ++it)\n    {\n        if ((*it).status()==MyArticle::New)\n        {\n            (*it).setStatus(MyArticle::Unread);\n        }\n    }\n\n    tryFetch();\n}\n\n\nvoid Feed::tryFetch()\n{\n    if (item() && m_fetchError)\n        item()->setPixmap(0, KGlobal::iconLoader()->loadIcon(\"txt\", KIcon::Small));\n    \n    m_fetchError=false;\n    \n    Loader *loader = Loader::create( this, SLOT(fetchCompleted(Loader *, Document, Status)) );\n    loader->loadFrom( xmlUrl, new FileRetriever );\n    \/\/ TODO: note that we probably don't want to load the favicon here enventually..\n    QTimer::singleShot( 1000, this, SLOT(loadFavicon()) );\n    \/\/loadFavicon();\n}\n\nvoid Feed::fetchCompleted(Loader *l, Document doc, Status status)\n{\n    \/\/ Note that Loader::~Loader() is private, so you cannot delete Loader instances.\n    \/\/ You don't need to do that anyway since Loader instances delete themselves.\n\n    if (status!= Success)\n    {\n        if (m_followDiscovery && (status==ParseError) && (m_fetchTries < 3) && \t\t\t(l->discoveredFeedURL().isValid()))\n        {\n            m_fetchTries++;\n            xmlUrl=l->discoveredFeedURL().url();\n            emit fetchDiscovery(this);\n            tryFetch();\n            return;\n        }\n        else\n        {\n            faviconChanged(xmlUrl, KGlobal::iconLoader()->loadIcon(\"cancel\", KIcon::Small));\n            m_fetchError=true;\n            emit fetchError(this);\n            return;\n        }\n    }\n\n    m_fetchError=false;\n    m_document=doc;\n    \/\/kdDebug() << \"Feed fetched successfully [\" << m_document.title() << \"]\" << endl;\n\n    \n    if (image.isNull())\n    {\n        QString u=xmlUrl;\n        QString imageFileName=KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\")+u.replace(\"\/\", \"_\").replace(\":\", \"_\")+\".png\";\n        image=QPixmap(imageFileName, \"PNG\");\n   \n        if (image.isNull())\n        {\n            if (m_document.image()) \/\/ if we aint got teh image\n                                    \/\/ and the feed provides one, get it....\n            {\n                connect (m_document.image(), SIGNAL(gotPixmap(const QPixmap &)),\n                                   this, SLOT(imageChanged(const QPixmap &)));\n                m_document.image()->getPixmap();\n            }\n        }\n    }\n    \n    if (updateTitle || title().isEmpty()) setTitle( m_document.title() );\n\n    description = m_document.description();\n    htmlUrl = m_document.link().url();\n\n    \/\/kdDebug() << \"ismerged reprots:::\"<<isMerged()<<endl;\n\n    bool findDups=isMerged();\n    appendArticles(m_document, findDups);\n\n    emit fetched(this);\n}\n\nvoid Feed::loadFavicon()\n{\n    FeedIconManager::self()->loadIcon(xmlUrl);\n    connect (FeedIconManager::self(), SIGNAL(iconChanged(const QString &, const QPixmap &)),\n                                this, SLOT(faviconChanged(const QString &, const QPixmap &)));\n}\n\nvoid Feed::faviconChanged(const QString &url, const QPixmap &p)\n{\n    if (xmlUrl==url && !m_fetchError)\n    {\n        if (item())\n            item()->setPixmap(0, p);\n        favicon=p;\n        emit(faviconLoaded(this)); \/\/ emit so that other sources can be updated.. not used right now\n    }\n}\n\nvoid Feed::imageChanged(const QPixmap &p)\n{\n    image=p;\n    QString u=xmlUrl;\n    image.save(KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\")+u.replace(\"\/\", \"_\").replace(\":\", \"_\")+\".png\",\"PNG\");\n    emit(imageLoaded(this));\n}\n\n\/\/ = ArticleSequence ===================================================== \/\/\n\nstruct ArticleSequence::Private\n{\n   int dummy;\n\/\/   bool doSort :1;\n};\n\nArticleSequence::ArticleSequence()\n   : MyArticle::List()\n   , d(new Private)\n{\n}\n\nArticleSequence::ArticleSequence(const ArticleSequence &other)\n   : MyArticle::List(other)\n   , d(new Private)\n{\n}\n\nArticleSequence::~ArticleSequence()\n{\n   delete d;\n}\n\n\/*\n    The reason to include insert\/append\/prepend code here is to:\n    a) check if there's another record with the exactly same pubDate() present,\n    b) if so, adjust this inserted item's clock off by one second to keep sorting sane,\n    c) re-sort added items (if enabled).\n    d) use MyArticle::fetchDate for sorting! ( defined by MyArticle::operator <() )\n *\/\nArticleSequence::iterator ArticleSequence::insert( iterator it, const MyArticle &x )\n{\n    return MyArticle::List::insert( it, x );\n}\n\nvoid ArticleSequence::insert( iterator it, size_type n, const MyArticle &x )\n{\n    MyArticle::List::insert( it, n, x );\n}\n\nArticleSequence::iterator ArticleSequence::append( const MyArticle &x )\n{\n    return MyArticle::List::append( x );\n}\n\nArticleSequence::iterator ArticleSequence::prepend( const MyArticle &x )\n{\n    return MyArticle::List::prepend( x );\n}\n\n\/*\nvoid ArticleSequence::doNotSort()\n{\n    d->doSort = false;\n}\n\nvoid ArticleSequence::sort()\n{\n    d->doSort = true;\n\/\/    qHeapSort( *this );\n}\n*\/\n\n#include \"feed.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#define BOOST_TEST_MODULE exscan\n\n#include <boost\/test\/included\/unit_test.hpp>\n#include <mpl\/mpl.hpp>\n\ntemplate<typename T>\nstruct add {\n  T operator()(const T &a, const T &b) { return a + b; }\n};\n\ntemplate<typename T>\nbool exscan_func_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)}, y{};\n  comm_world.exscan(add<T>(), x, y);\n  return comm_world.rank() == 0 ? true : y == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_op_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)}, y{};\n  comm_world.exscan(mpl::plus<T>(), x, y);\n  return comm_world.rank() == 0 ? true : y == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_lambda_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)}, y{};\n  comm_world.exscan([](T a, T b) { return a + b; }, x, y);\n  return comm_world.rank() == 0 ? true : y == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_inplace_func_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)};\n  comm_world.exscan(add<T>(), x);\n  return comm_world.rank() == 0 ? true : x == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_inplace_op_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)};\n  comm_world.exscan(mpl::plus<T>(), x);\n  return comm_world.rank() == 0 ? true : x == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_inplace_lambda_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)};\n  comm_world.exscan([](T a, T b) { return a + b; }, x);\n  return comm_world.rank() == 0 ? true : x == T((N * N - N) \/ 2);\n}\n\n\nBOOST_AUTO_TEST_CASE(reduce) {\n  BOOST_TEST(exscan_func_test<double>());\n  BOOST_TEST(exscan_op_test<double>());\n  BOOST_TEST(exscan_lambda_test<double>());\n  BOOST_TEST(exscan_inplace_func_test<double>());\n  BOOST_TEST(exscan_inplace_op_test<double>());\n  BOOST_TEST(exscan_inplace_lambda_test<double>());\n}\n<commit_msg>simplify logical expression<commit_after>#define BOOST_TEST_MODULE exscan\n\n#include <boost\/test\/included\/unit_test.hpp>\n#include <mpl\/mpl.hpp>\n\ntemplate<typename T>\nstruct add {\n  T operator()(const T &a, const T &b) { return a + b; }\n};\n\ntemplate<typename T>\nbool exscan_func_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)}, y{};\n  comm_world.exscan(add<T>(), x, y);\n  return comm_world.rank() == 0 || y == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_op_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)}, y{};\n  comm_world.exscan(mpl::plus<T>(), x, y);\n  return comm_world.rank() == 0 || y == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_lambda_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)}, y{};\n  comm_world.exscan([](T a, T b) { return a + b; }, x, y);\n  return comm_world.rank() == 0 || y == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_inplace_func_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)};\n  comm_world.exscan(add<T>(), x);\n  return comm_world.rank() == 0 || x == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_inplace_op_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)};\n  comm_world.exscan(mpl::plus<T>(), x);\n  return comm_world.rank() == 0 || x == T((N * N - N) \/ 2);\n}\n\ntemplate<typename T>\nbool exscan_inplace_lambda_test() {\n  const mpl::communicator &comm_world = mpl::environment::comm_world();\n  int N = comm_world.rank() + 1;\n  T x{T(N)};\n  comm_world.exscan([](T a, T b) { return a + b; }, x);\n  return comm_world.rank() == 0 || x == T((N * N - N) \/ 2);\n}\n\n\nBOOST_AUTO_TEST_CASE(reduce) {\n  BOOST_TEST(exscan_func_test<double>());\n  BOOST_TEST(exscan_op_test<double>());\n  BOOST_TEST(exscan_lambda_test<double>());\n  BOOST_TEST(exscan_inplace_func_test<double>());\n  BOOST_TEST(exscan_inplace_op_test<double>());\n  BOOST_TEST(exscan_inplace_lambda_test<double>());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Daemon.h\"\n\n#ifndef _WIN32\n\n#include <signal.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n\n#include \"Log.h\"\n#include \"util.h\"\n\n\nvoid handle_signal(int sig)\n{\n\tswitch (sig)\n\t{\n\tcase SIGHUP:\n\t\tif (i2p::util::config::GetArg(\"daemon\", 0) == 1)\n\t\t{\n\t\t\tstatic bool first=true;\n\t\t\tif (first)\n\t\t\t{\n\t\t\t\tfirst=false;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tLogPrint(\"Reloading config.\");\n\t\ti2p::util::filesystem::ReadConfigFile(i2p::util::config::mapArgs, i2p::util::config::mapMultiArgs);\n\t\tbreak;\n\tcase SIGABRT:\n\tcase SIGTERM:\n\tcase SIGINT:\n\t\tDaemon.running = 0; \/\/ Exit loop\n\t\tbreak;\n\t}\n}\n\n\nnamespace i2p\n{\n\tnamespace util\n\t{\n\t\tbool DaemonLinux::start()\n\t\t{\n\t\t\tif (isDaemon == 1)\n\t\t\t{\n\t\t\t\tpid_t pid;\n\t\t\t\tpid = fork();\n\t\t\t\tif (pid > 0) \/\/ parent\n\t\t\t\t\t::exit (EXIT_SUCCESS);\n\n\t\t\t\tif (pid < 0) \/\/ error\n\t\t\t\t\treturn false;\n\n\t\t\t\t\/\/ child\n\t\t\t\tumask(0);\n\t\t\t\tint sid = setsid();\n\t\t\t\tif (sid < 0)\n\t\t\t\t{\n\t\t\t\t\tLogPrint(\"Error, could not create process group.\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tstd::string d(i2p::util::filesystem::GetDataDir()); \/\/ make a copy\n\t\t\t\tchdir(d.c_str());\n\n\t\t\t\t\/\/ close stdin\/stdout\/stderr descriptors\n\t\t\t\t::close (0);\n\t\t\t\t::open (\"\/dev\/null\", O_RDWR);\n\t\t\t\t::close (1);\n\t\t\t\t::open (\"\/dev\/null\", O_RDWR);\t\n\t\t\t\t::close (2);\n\t\t\t\t::open (\"\/dev\/null\", O_RDWR);\n\t\t\t}\n\n\t\t\t\/\/ Pidfile\n\t\t\tpidfile = IsService () ? \"\/var\/run\" : i2p::util::filesystem::GetDataDir().string();\n\t\t\tpidfile.append(\"\/i2pd.pid\");\n\t\t\tpidFilehandle = open(pidfile.c_str(), O_RDWR | O_CREAT, 0600);\n\t\t\tif (pidFilehandle == -1)\n\t\t\t{\n\t\t\t\tLogPrint(\"Error, could not create pid file (\", pidfile, \")\\nIs an instance already running?\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (lockf(pidFilehandle, F_TLOCK, 0) == -1)\n\t\t\t{\n\t\t\t\tLogPrint(\"Error, could not lock pid file (\", pidfile, \")\\nIs an instance already running?\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tchar pid[10];\n\t\t\tsprintf(pid, \"%d\\n\", getpid());\n\t\t\twrite(pidFilehandle, pid, strlen(pid));\n\n\t\t\t\/\/ Signal handler\n\t\t\tstruct sigaction sa;\n\t\t\tsa.sa_handler = handle_signal;\n\t\t\tsigemptyset(&sa.sa_mask);\n\t\t\tsa.sa_flags = SA_RESTART;\n\t\t\tsigaction(SIGHUP, &sa, 0);\n\t\t\tsigaction(SIGABRT, &sa, 0);\n\t\t\tsigaction(SIGTERM, &sa, 0);\n\t\t\tsigaction(SIGINT, &sa, 0);\n\n\t\t\treturn Daemon_Singleton::start();\n\t\t}\n\n\t\tbool DaemonLinux::stop()\n\t\t{\n\t\t\tclose(pidFilehandle);\n\t\t\tunlink(pidfile.c_str());\n\n\t\t\treturn Daemon_Singleton::stop();\t\t\t\n\t\t}\n\n\t}\n}\n\n#endif\n<commit_msg>fixed build error<commit_after>#include \"Daemon.h\"\n\n#ifndef _WIN32\n\n#include <signal.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n\n#include \"Log.h\"\n#include \"util.h\"\n\n\nvoid handle_signal(int sig)\n{\n\tswitch (sig)\n\t{\n\tcase SIGHUP:\n\t\tif (i2p::util::config::GetArg(\"daemon\", 0) == 1)\n\t\t{\n\t\t\tstatic bool first=true;\n\t\t\tif (first)\n\t\t\t{\n\t\t\t\tfirst=false;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tLogPrint(\"Reloading config.\");\n\t\ti2p::util::filesystem::ReadConfigFile(i2p::util::config::mapArgs, i2p::util::config::mapMultiArgs);\n\t\tbreak;\n\tcase SIGABRT:\n\tcase SIGTERM:\n\tcase SIGINT:\n\t\tDaemon.running = 0; \/\/ Exit loop\n\t\tbreak;\n\t}\n}\n\n\nnamespace i2p\n{\n\tnamespace util\n\t{\n\t\tbool DaemonLinux::start()\n\t\t{\n\t\t\tif (isDaemon == 1)\n\t\t\t{\n\t\t\t\tpid_t pid;\n\t\t\t\tpid = fork();\n\t\t\t\tif (pid > 0) \/\/ parent\n\t\t\t\t\t::exit (EXIT_SUCCESS);\n\n\t\t\t\tif (pid < 0) \/\/ error\n\t\t\t\t\treturn false;\n\n\t\t\t\t\/\/ child\n\t\t\t\tumask(0);\n\t\t\t\tint sid = setsid();\n\t\t\t\tif (sid < 0)\n\t\t\t\t{\n\t\t\t\t\tLogPrint(\"Error, could not create process group.\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tstd::string d(i2p::util::filesystem::GetDataDir().string ()); \/\/ make a copy\n\t\t\t\tchdir(d.c_str());\n\n\t\t\t\t\/\/ close stdin\/stdout\/stderr descriptors\n\t\t\t\t::close (0);\n\t\t\t\t::open (\"\/dev\/null\", O_RDWR);\n\t\t\t\t::close (1);\n\t\t\t\t::open (\"\/dev\/null\", O_RDWR);\t\n\t\t\t\t::close (2);\n\t\t\t\t::open (\"\/dev\/null\", O_RDWR);\n\t\t\t}\n\n\t\t\t\/\/ Pidfile\n\t\t\tpidfile = IsService () ? \"\/var\/run\" : i2p::util::filesystem::GetDataDir().string();\n\t\t\tpidfile.append(\"\/i2pd.pid\");\n\t\t\tpidFilehandle = open(pidfile.c_str(), O_RDWR | O_CREAT, 0600);\n\t\t\tif (pidFilehandle == -1)\n\t\t\t{\n\t\t\t\tLogPrint(\"Error, could not create pid file (\", pidfile, \")\\nIs an instance already running?\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (lockf(pidFilehandle, F_TLOCK, 0) == -1)\n\t\t\t{\n\t\t\t\tLogPrint(\"Error, could not lock pid file (\", pidfile, \")\\nIs an instance already running?\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tchar pid[10];\n\t\t\tsprintf(pid, \"%d\\n\", getpid());\n\t\t\twrite(pidFilehandle, pid, strlen(pid));\n\n\t\t\t\/\/ Signal handler\n\t\t\tstruct sigaction sa;\n\t\t\tsa.sa_handler = handle_signal;\n\t\t\tsigemptyset(&sa.sa_mask);\n\t\t\tsa.sa_flags = SA_RESTART;\n\t\t\tsigaction(SIGHUP, &sa, 0);\n\t\t\tsigaction(SIGABRT, &sa, 0);\n\t\t\tsigaction(SIGTERM, &sa, 0);\n\t\t\tsigaction(SIGINT, &sa, 0);\n\n\t\t\treturn Daemon_Singleton::start();\n\t\t}\n\n\t\tbool DaemonLinux::stop()\n\t\t{\n\t\t\tclose(pidFilehandle);\n\t\t\tunlink(pidfile.c_str());\n\n\t\t\treturn Daemon_Singleton::stop();\t\t\t\n\t\t}\n\n\t}\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"Tesselate.hpp\"\n\n#include \"ExPolygon.hpp\"\n\n#include <glu-libtess.h>\n\nnamespace Slic3r {\n\nclass GluTessWrapper {\npublic:\n    GluTessWrapper() : m_tesselator(gluNewTess()) {\n        \/\/ register callback functions\n        gluTessCallback(m_tesselator, GLU_TESS_BEGIN_DATA,   (_GLUfuncptr)tessBeginCB);\n        gluTessCallback(m_tesselator, GLU_TESS_END_DATA,     (_GLUfuncptr)tessEndCB);\n        gluTessCallback(m_tesselator, GLU_TESS_ERROR_DATA,   (_GLUfuncptr)tessErrorCB);\n        gluTessCallback(m_tesselator, GLU_TESS_VERTEX_DATA,  (_GLUfuncptr)tessVertexCB);\n        gluTessCallback(m_tesselator, GLU_TESS_COMBINE_DATA, (_GLUfuncptr)tessCombineCB);        \n    }\n    ~GluTessWrapper() {\n        gluDeleteTess(m_tesselator);\n    }\n\n    Pointf3s tesselate(const ExPolygon &expoly, double z_, bool flipped_)\n    {\n        m_z = z_;\n        m_flipped = flipped_;\n        std::vector<GLdouble> coords;\n        {\n            size_t num_coords = expoly.contour.points.size();\n            for (const Polygon &poly : expoly.holes)\n                num_coords += poly.points.size();\n            coords.reserve(num_coords * 3);\n        }\n        gluTessBeginPolygon(m_tesselator, (void*)this);\n        gluTessBeginContour(m_tesselator);\n        for (const Point &pt : expoly.contour.points) {\n            coords.emplace_back(unscale<double>(pt[0]));\n            coords.emplace_back(unscale<double>(pt[1]));\n            coords.emplace_back(0.);\n            gluTessVertex(m_tesselator, &coords[coords.size() - 3], &coords[coords.size() - 3]);\n        }\n        gluTessEndContour(m_tesselator);\n        for (const Polygon &poly : expoly.holes) {\n            gluTessBeginContour(m_tesselator);\n            for (const Point &pt : poly.points) {\n                coords.emplace_back(unscale<double>(pt[0]));\n                coords.emplace_back(unscale<double>(pt[1]));\n                coords.emplace_back(0.);\n                gluTessVertex(m_tesselator, &coords[coords.size() - 3], &coords[coords.size() - 3]);\n            }\n            gluTessEndContour(m_tesselator);\n        }\n        gluTessEndPolygon(m_tesselator);\n        m_output_triangles.clear();\n        m_intersection_points.clear();\n        return std::move(m_output_triangles);\n    }\n\n    Pointf3s tesselate(const ExPolygons &expolygons, double z_, bool flipped_)\n    {\n        m_z = z_;\n        m_flipped = flipped_;\n        std::vector<GLdouble> coords;\n        {\n            size_t num_coords = 0;\n            for (const ExPolygon &expoly : expolygons) {\n                size_t num_coords_this = expoly.contour.points.size();\n                for (const Polygon &poly : expoly.holes)\n                    num_coords_this += poly.points.size();\n                num_coords = std::max(num_coords, num_coords_this);\n            }\n            coords.assign(num_coords * 3, 0);\n        }\n        for (const ExPolygon &expoly : expolygons) {\n            gluTessBeginPolygon(m_tesselator, (void*)this);\n            gluTessBeginContour(m_tesselator);\n            size_t idx = 0;\n            for (const Point &pt : expoly.contour.points) {\n                coords[idx ++] = unscale<double>(pt[0]);\n                coords[idx ++] = unscale<double>(pt[1]);\n                coords[idx ++] = 0.;\n                gluTessVertex(m_tesselator, &coords[idx - 3], &coords[idx - 3]);\n            }\n            gluTessEndContour(m_tesselator);\n            for (const Polygon &poly : expoly.holes) {\n                gluTessBeginContour(m_tesselator);\n                for (const Point &pt : poly.points) {\n                    coords[idx ++] = unscale<double>(pt[0]);\n                    coords[idx ++] = unscale<double>(pt[1]);\n                    coords[idx ++] = 0.;\n                    gluTessVertex(m_tesselator, &coords[idx - 3], &coords[idx - 3]);\n                }\n                gluTessEndContour(m_tesselator);\n            }\n            gluTessEndPolygon(m_tesselator);\n        }\n        m_output_triangles.clear();\n        m_intersection_points.clear();\n        return std::move(m_output_triangles);\n    }\n\nprivate:\n    static void tessBeginCB(GLenum which, void *polygonData)        { reinterpret_cast<GluTessWrapper*>(polygonData)->tessBegin(which); }\n    static void tessEndCB(void *polygonData)                        { reinterpret_cast<GluTessWrapper*>(polygonData)->tessEnd(); }\n    static void tessVertexCB(const GLvoid *data, void *polygonData) { reinterpret_cast<GluTessWrapper*>(polygonData)->tessVertex(data); }\n    static void tessCombineCB(const GLdouble newVertex[3], const GLdouble *neighborVertex[4], const GLfloat neighborWeight[4], GLdouble **outData, void *polygonData)\n                                                                    { reinterpret_cast<GluTessWrapper*>(polygonData)->tessCombine(newVertex, neighborVertex, neighborWeight, outData); }\n    static void tessErrorCB(GLenum errorCode, void *polygonData)    { reinterpret_cast<GluTessWrapper*>(polygonData)->tessError(errorCode); }\n\n    void tessBegin(GLenum which)\n    {\n        assert(which == GL_TRIANGLES || which == GL_TRIANGLE_FAN || which == GL_TRIANGLE_STRIP);\n        m_primitive_type = which;\n        m_num_points = 0;\n    }\n\n    void tessEnd()\n    {\n        m_num_points = 0;\n    }\n\n    void tessVertex(const GLvoid *data)\n    {\n        if (data == nullptr)\n            return;\n        const GLdouble *ptr = (const GLdouble*)data;\n        ++ m_num_points;\n        if (m_num_points == 1) {\n            memcpy(m_pt0, ptr, sizeof(GLdouble) * 3);\n        } else if (m_num_points == 2) {\n            memcpy(m_pt1, ptr, sizeof(GLdouble) * 3);\n        } else {\n            bool flip = m_flipped;\n            if (m_primitive_type == GL_TRIANGLE_STRIP && m_num_points == 4) {\n                flip = !flip;\n                m_num_points = 2;\n            }\n            m_output_triangles.emplace_back(m_pt0[0], m_pt0[1], m_z);\n            if (flip) {\n                m_output_triangles.emplace_back(ptr[0],   ptr[1],   m_z);\n                m_output_triangles.emplace_back(m_pt1[0], m_pt1[1], m_z);\n            } else {\n                m_output_triangles.emplace_back(m_pt1[0], m_pt1[1], m_z);\n                m_output_triangles.emplace_back(ptr[0],   ptr[1],   m_z);\n            }\n            if (m_primitive_type == GL_TRIANGLE_STRIP) {\n                memcpy(m_pt0, m_pt1, sizeof(GLdouble) * 3);\n                memcpy(m_pt1, ptr,   sizeof(GLdouble) * 3);\n            } else if (m_primitive_type == GL_TRIANGLE_FAN) {\n                memcpy(m_pt1, ptr,   sizeof(GLdouble) * 3);\n            } else {\n                assert(m_primitive_type == GL_TRIANGLES);\n                assert(m_num_points == 3);\n                m_num_points = 0;\n            }\n        }\n    }\n\n    void tessCombine(const GLdouble newVertex[3], const GLdouble *neighborVertex[4], const GLfloat neighborWeight[4], GLdouble **outData)\n    {\n        m_intersection_points.emplace_back(newVertex[0], newVertex[1], m_z);\n        *outData = m_intersection_points.back().data();\n    }\n\n    static void tessError(GLenum errorCode)\n    {\n\/\/        const GLubyte *errorStr;\n\/\/        errorStr = gluErrorString(errorCode);\n\/\/        printf(\"Error: %s\\n\", (const char*)errorStr);\n    }\n\n    \/\/ Instance owned over the life time of this wrapper.\n    GLUtesselator  *m_tesselator;\n\n    \/\/ Currently processed primitive type.\n    GLenum          m_primitive_type;\n    \/\/ Two last vertices received for m_primitive_type. Used for processing triangle strips, fans etc.\n    GLdouble        m_pt0[3];\n    GLdouble        m_pt1[3];\n    \/\/ Number of points processed over m_primitive_type.\n    int             m_num_points;\n    \/\/ Triangles generated by the tesselator.\n    Pointf3s        m_output_triangles;\n    \/\/ Intersection points generated by tessCombine callback. There should be none if the input contour is not self intersecting.\n    std::deque<Vec3d> m_intersection_points;\n    \/\/ Fixed third coordinate.\n    double          m_z;\n    \/\/ Output triangles shall be flipped (normal points down).\n    bool            m_flipped;\n};\n\nPointf3s triangulate_expolygons_3df(const ExPolygon &poly, coordf_t z, bool flip)\n{\n    GluTessWrapper tess;\n    return tess.tesselate(poly, z, flip);\n}\n\nPointf3s triangulate_expolygons_3df(const ExPolygons &polys, coordf_t z, bool flip)\n{\n\tGluTessWrapper tess;\n    return tess.tesselate(polys, z, flip);\n}\n\n} \/\/ namespace Slic3r\n<commit_msg>Fixed last buggy commit.<commit_after>#include \"Tesselate.hpp\"\n\n#include \"ExPolygon.hpp\"\n\n#include <glu-libtess.h>\n\nnamespace Slic3r {\n\nclass GluTessWrapper {\npublic:\n    GluTessWrapper() : m_tesselator(gluNewTess()) {\n        \/\/ register callback functions\n        gluTessCallback(m_tesselator, GLU_TESS_BEGIN_DATA,   (_GLUfuncptr)tessBeginCB);\n        gluTessCallback(m_tesselator, GLU_TESS_END_DATA,     (_GLUfuncptr)tessEndCB);\n        gluTessCallback(m_tesselator, GLU_TESS_ERROR_DATA,   (_GLUfuncptr)tessErrorCB);\n        gluTessCallback(m_tesselator, GLU_TESS_VERTEX_DATA,  (_GLUfuncptr)tessVertexCB);\n        gluTessCallback(m_tesselator, GLU_TESS_COMBINE_DATA, (_GLUfuncptr)tessCombineCB);        \n    }\n    ~GluTessWrapper() {\n        gluDeleteTess(m_tesselator);\n    }\n\n    Pointf3s tesselate(const ExPolygon &expoly, double z_, bool flipped_)\n    {\n        m_z = z_;\n        m_flipped = flipped_;\n        m_output_triangles.clear();\n        std::vector<GLdouble> coords;\n        {\n            size_t num_coords = expoly.contour.points.size();\n            for (const Polygon &poly : expoly.holes)\n                num_coords += poly.points.size();\n            coords.reserve(num_coords * 3);\n        }\n        gluTessBeginPolygon(m_tesselator, (void*)this);\n        gluTessBeginContour(m_tesselator);\n        for (const Point &pt : expoly.contour.points) {\n            coords.emplace_back(unscale<double>(pt[0]));\n            coords.emplace_back(unscale<double>(pt[1]));\n            coords.emplace_back(0.);\n            gluTessVertex(m_tesselator, &coords[coords.size() - 3], &coords[coords.size() - 3]);\n        }\n        gluTessEndContour(m_tesselator);\n        for (const Polygon &poly : expoly.holes) {\n            gluTessBeginContour(m_tesselator);\n            for (const Point &pt : poly.points) {\n                coords.emplace_back(unscale<double>(pt[0]));\n                coords.emplace_back(unscale<double>(pt[1]));\n                coords.emplace_back(0.);\n                gluTessVertex(m_tesselator, &coords[coords.size() - 3], &coords[coords.size() - 3]);\n            }\n            gluTessEndContour(m_tesselator);\n        }\n        gluTessEndPolygon(m_tesselator);\n        m_intersection_points.clear();\n        return std::move(m_output_triangles);\n    }\n\n    Pointf3s tesselate(const ExPolygons &expolygons, double z_, bool flipped_)\n    {\n        m_z = z_;\n        m_flipped = flipped_;\n        m_output_triangles.clear();\n        std::vector<GLdouble> coords;\n        {\n            size_t num_coords = 0;\n            for (const ExPolygon &expoly : expolygons) {\n                size_t num_coords_this = expoly.contour.points.size();\n                for (const Polygon &poly : expoly.holes)\n                    num_coords_this += poly.points.size();\n                num_coords = std::max(num_coords, num_coords_this);\n            }\n            coords.assign(num_coords * 3, 0);\n        }\n        for (const ExPolygon &expoly : expolygons) {\n            gluTessBeginPolygon(m_tesselator, (void*)this);\n            gluTessBeginContour(m_tesselator);\n            size_t idx = 0;\n            for (const Point &pt : expoly.contour.points) {\n                coords[idx ++] = unscale<double>(pt[0]);\n                coords[idx ++] = unscale<double>(pt[1]);\n                coords[idx ++] = 0.;\n                gluTessVertex(m_tesselator, &coords[idx - 3], &coords[idx - 3]);\n            }\n            gluTessEndContour(m_tesselator);\n            for (const Polygon &poly : expoly.holes) {\n                gluTessBeginContour(m_tesselator);\n                for (const Point &pt : poly.points) {\n                    coords[idx ++] = unscale<double>(pt[0]);\n                    coords[idx ++] = unscale<double>(pt[1]);\n                    coords[idx ++] = 0.;\n                    gluTessVertex(m_tesselator, &coords[idx - 3], &coords[idx - 3]);\n                }\n                gluTessEndContour(m_tesselator);\n            }\n            gluTessEndPolygon(m_tesselator);\n        }\n        m_intersection_points.clear();\n        return std::move(m_output_triangles);\n    }\n\nprivate:\n    static void tessBeginCB(GLenum which, void *polygonData)        { reinterpret_cast<GluTessWrapper*>(polygonData)->tessBegin(which); }\n    static void tessEndCB(void *polygonData)                        { reinterpret_cast<GluTessWrapper*>(polygonData)->tessEnd(); }\n    static void tessVertexCB(const GLvoid *data, void *polygonData) { reinterpret_cast<GluTessWrapper*>(polygonData)->tessVertex(data); }\n    static void tessCombineCB(const GLdouble newVertex[3], const GLdouble *neighborVertex[4], const GLfloat neighborWeight[4], GLdouble **outData, void *polygonData)\n                                                                    { reinterpret_cast<GluTessWrapper*>(polygonData)->tessCombine(newVertex, neighborVertex, neighborWeight, outData); }\n    static void tessErrorCB(GLenum errorCode, void *polygonData)    { reinterpret_cast<GluTessWrapper*>(polygonData)->tessError(errorCode); }\n\n    void tessBegin(GLenum which)\n    {\n        assert(which == GL_TRIANGLES || which == GL_TRIANGLE_FAN || which == GL_TRIANGLE_STRIP);\n        m_primitive_type = which;\n        m_num_points = 0;\n    }\n\n    void tessEnd()\n    {\n        m_num_points = 0;\n    }\n\n    void tessVertex(const GLvoid *data)\n    {\n        if (data == nullptr)\n            return;\n        const GLdouble *ptr = (const GLdouble*)data;\n        ++ m_num_points;\n        if (m_num_points == 1) {\n            memcpy(m_pt0, ptr, sizeof(GLdouble) * 3);\n        } else if (m_num_points == 2) {\n            memcpy(m_pt1, ptr, sizeof(GLdouble) * 3);\n        } else {\n            bool flip = m_flipped;\n            if (m_primitive_type == GL_TRIANGLE_STRIP && m_num_points == 4) {\n                flip = !flip;\n                m_num_points = 2;\n            }\n            m_output_triangles.emplace_back(m_pt0[0], m_pt0[1], m_z);\n            if (flip) {\n                m_output_triangles.emplace_back(ptr[0],   ptr[1],   m_z);\n                m_output_triangles.emplace_back(m_pt1[0], m_pt1[1], m_z);\n            } else {\n                m_output_triangles.emplace_back(m_pt1[0], m_pt1[1], m_z);\n                m_output_triangles.emplace_back(ptr[0],   ptr[1],   m_z);\n            }\n            if (m_primitive_type == GL_TRIANGLE_STRIP) {\n                memcpy(m_pt0, m_pt1, sizeof(GLdouble) * 3);\n                memcpy(m_pt1, ptr,   sizeof(GLdouble) * 3);\n            } else if (m_primitive_type == GL_TRIANGLE_FAN) {\n                memcpy(m_pt1, ptr,   sizeof(GLdouble) * 3);\n            } else {\n                assert(m_primitive_type == GL_TRIANGLES);\n                assert(m_num_points == 3);\n                m_num_points = 0;\n            }\n        }\n    }\n\n    void tessCombine(const GLdouble newVertex[3], const GLdouble *neighborVertex[4], const GLfloat neighborWeight[4], GLdouble **outData)\n    {\n        m_intersection_points.emplace_back(newVertex[0], newVertex[1], m_z);\n        *outData = m_intersection_points.back().data();\n    }\n\n    static void tessError(GLenum errorCode)\n    {\n\/\/        const GLubyte *errorStr;\n\/\/        errorStr = gluErrorString(errorCode);\n\/\/        printf(\"Error: %s\\n\", (const char*)errorStr);\n    }\n\n    \/\/ Instance owned over the life time of this wrapper.\n    GLUtesselator  *m_tesselator;\n\n    \/\/ Currently processed primitive type.\n    GLenum          m_primitive_type;\n    \/\/ Two last vertices received for m_primitive_type. Used for processing triangle strips, fans etc.\n    GLdouble        m_pt0[3];\n    GLdouble        m_pt1[3];\n    \/\/ Number of points processed over m_primitive_type.\n    int             m_num_points;\n    \/\/ Triangles generated by the tesselator.\n    Pointf3s        m_output_triangles;\n    \/\/ Intersection points generated by tessCombine callback. There should be none if the input contour is not self intersecting.\n    std::deque<Vec3d> m_intersection_points;\n    \/\/ Fixed third coordinate.\n    double          m_z;\n    \/\/ Output triangles shall be flipped (normal points down).\n    bool            m_flipped;\n};\n\nPointf3s triangulate_expolygons_3df(const ExPolygon &poly, coordf_t z, bool flip)\n{\n    GluTessWrapper tess;\n    return tess.tesselate(poly, z, flip);\n}\n\nPointf3s triangulate_expolygons_3df(const ExPolygons &polys, coordf_t z, bool flip)\n{\n\tGluTessWrapper tess;\n    return tess.tesselate(polys, z, flip);\n}\n\n} \/\/ namespace Slic3r\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- sanitizer_atomic_test.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 ThreadSanitizer\/AddressSanitizer runtime.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"sanitizer_common\/sanitizer_atomic.h\"\n#include \"gtest\/gtest.h\"\n\nnamespace __sanitizer {\n\ntemplate<typename T>\nvoid CheckAtomicCompareExchange() {\n  typedef typename T::Type Type;\n  {\n    Type old_val = 42;\n    Type new_val = 24;\n    Type var = old_val;\n    EXPECT_TRUE(atomic_compare_exchange_strong((T*)&var, &old_val, new_val,\n                                               memory_order_relaxed));\n    EXPECT_FALSE(atomic_compare_exchange_strong((T*)&var, &old_val, new_val,\n                                                memory_order_relaxed));\n    EXPECT_EQ(new_val, old_val);\n  }\n  {\n    Type old_val = 42;\n    Type new_val = 24;\n    Type var = old_val;\n    EXPECT_TRUE(atomic_compare_exchange_weak((T*)&var, &old_val, new_val,\n                                             memory_order_relaxed));\n    EXPECT_FALSE(atomic_compare_exchange_weak((T*)&var, &old_val, new_val,\n                                              memory_order_relaxed));\n    EXPECT_EQ(new_val, old_val);\n  }\n}\n\nTEST(SanitizerCommon, AtomicCompareExchangeTest) {\n  CheckAtomicCompareExchange<atomic_uint8_t>();\n  CheckAtomicCompareExchange<atomic_uint16_t>();\n  CheckAtomicCompareExchange<atomic_uint32_t>();\n  CheckAtomicCompareExchange<atomic_uint64_t>();\n  CheckAtomicCompareExchange<atomic_uintptr_t>();\n}\n\n}  \/\/ namespace __sanitizer\n<commit_msg>[Sanitizer] Disable atomic_test on Android, where it crashes Clang.<commit_after>\/\/===-- sanitizer_atomic_test.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 ThreadSanitizer\/AddressSanitizer runtime.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"sanitizer_common\/sanitizer_atomic.h\"\n#include \"gtest\/gtest.h\"\n\nnamespace __sanitizer {\n\n\/\/ Clang crashes while compiling this test for Android:\n\/\/ http:\/\/llvm.org\/bugs\/show_bug.cgi?id=15587\n#if !SANITIZER_ANDROID\ntemplate<typename T>\nvoid CheckAtomicCompareExchange() {\n  typedef typename T::Type Type;\n  {\n    Type old_val = 42;\n    Type new_val = 24;\n    Type var = old_val;\n    EXPECT_TRUE(atomic_compare_exchange_strong((T*)&var, &old_val, new_val,\n                                               memory_order_relaxed));\n    EXPECT_FALSE(atomic_compare_exchange_strong((T*)&var, &old_val, new_val,\n                                                memory_order_relaxed));\n    EXPECT_EQ(new_val, old_val);\n  }\n  {\n    Type old_val = 42;\n    Type new_val = 24;\n    Type var = old_val;\n    EXPECT_TRUE(atomic_compare_exchange_weak((T*)&var, &old_val, new_val,\n                                             memory_order_relaxed));\n    EXPECT_FALSE(atomic_compare_exchange_weak((T*)&var, &old_val, new_val,\n                                              memory_order_relaxed));\n    EXPECT_EQ(new_val, old_val);\n  }\n}\n\nTEST(SanitizerCommon, AtomicCompareExchangeTest) {\n  CheckAtomicCompareExchange<atomic_uint8_t>();\n  CheckAtomicCompareExchange<atomic_uint16_t>();\n  CheckAtomicCompareExchange<atomic_uint32_t>();\n  CheckAtomicCompareExchange<atomic_uint64_t>();\n  CheckAtomicCompareExchange<atomic_uintptr_t>();\n}\n#endif  \/\/!SANITIZER_ANDROID\n\n}  \/\/ namespace __sanitizer\n<|endoftext|>"}
{"text":"<commit_before>\/*\n*  Author(s):\n*  - Chris  Kilner <ckilner@aldebaran-robotics.com>\n*  - Cedric Gestes <gestes@aldebaran-robotics.com>\n*\n*  Copyright (C) 2010 Aldebaran Robotics\n*\/\n\n#include \"src\/messaging\/network\/ip_address.hpp\"\n#include <boost\/algorithm\/string.hpp>\n\n#ifdef _WIN32\n#  include <windows.h>\n#  include <winsock2.h>\n#  include <iphlpapi.h>\n#  include <Ws2tcpip.h>\n#else\n#  include <arpa\/inet.h>\n#  include <sys\/socket.h>\n#  include <netdb.h>\n#  include <ifaddrs.h>\n#  include <stdio.h>\n#  include <stdlib.h>\n#  include <unistd.h>\n#endif\n\nnamespace qi {\nnamespace detail {\n\nstd::string getPrimaryPublicIPAddress()\n{\n  std::vector<std::string> ips = getIPAddresses();\n  static const std::string ipLocalHost = \"127.0.0.1\";\n  \/\/ todo: some logic to choose between good addresses\n  for (unsigned int i = 0; i< ips.size(); i++)\n  {\n    if (ipLocalHost.compare(ips[i]) != 0)\n      return ips[i];\n  }\n  return \"\";\n}\n\nbool isValidAddress(const std::string& userHostString,\n  Address& outAddress)\n{\n  if (userHostString.empty())\n    return false;\n\n  std::vector<std::string> parts;\n  boost::split(parts, userHostString, boost::is_any_of(\":\/\"));\n\n  if (parts.size() <= 2)\n    parts.insert(parts.begin(), \"tcp\");\n\n  if (parts.size() < 2 || parts.size() > 3)\n    return false;\n\n  if (parts[1].empty())\n    return false;\n\n  outAddress.transport = parts[0];\n  outAddress.address = parts[1];\n\n  if (parts.size() == 3)\n  {\n    outAddress.port = atoi(parts[2].c_str());\n  }\n  else\n  {\n    outAddress.port = 0;\n    parts.push_back(\"0\"); \/\/ hmmm\n  }\n\n  return isValidHostAndPort(outAddress.address, parts[2]);\n}\n\n\nbool isValidHostAndPort(const std::string& hostName, std::string& port)\n{\n  bool ret = true;\n#ifdef _WIN32\n  WSADATA WSAData;\n  if(::WSAStartup(MAKEWORD(1, 0), &WSAData))\n    ret = false;\n#endif\n\n  addrinfo req;\n  memset(&req, 0, sizeof(req));\n  req.ai_family = AF_INET;\n  req.ai_socktype = SOCK_STREAM;\n  req.ai_flags = AI_NUMERICSERV;\n  addrinfo *res;\n\n  if(getaddrinfo(hostName.c_str(), port.c_str(), &req, &res))\n    ret = false; \/\/ lookup failed\n  else\n  {\n    if (res == NULL)\n      ret = false;\n    else\n      freeaddrinfo(res);\n  }\n#ifdef _WIN32\n  WSACleanup();\n#endif\n  return ret;\n}\n\nstd::vector<std::string> getIPAddresses()\n{\n  std::vector<std::string> ret;\n\n#ifdef _WIN32\n  \/\/ win version\n  char szHostName[128] = \"\";\n\n  WSADATA WSAData;\n  if(::WSAStartup(MAKEWORD(1, 0), &WSAData))\n    return ret;\n\n  if(::gethostname(szHostName, sizeof(szHostName)))\n    return ret;\n\n  struct sockaddr_in socketAddress;\n  struct hostent*    host = 0;\n\n  host = ::gethostbyname(szHostName);\n  if(!host)\n    return ret;\n\n  for(int i = 0; ((host->h_addr_list[i]) && (i < 10)); ++i)\n  {\n    memcpy(&socketAddress.sin_addr, host->h_addr_list[i], host->h_length);\n    ret.push_back(inet_ntoa(socketAddress.sin_addr));\n  }\n\n  WSACleanup();\n#else\n  \/\/ linux version\n  struct ifaddrs *ifaddr, *ifa;\n  int family, s;\n  char host[NI_MAXHOST];\n\n  if (getifaddrs(&ifaddr) == -1)\n    return ret;\n\n  for (ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next)\n  {\n    if (ifa->ifa_addr == NULL)\n      continue;\n    family = ifa->ifa_addr->sa_family;\n\n    \/\/ Don't include AF_INET6 for the moment\n    if (family == AF_INET)\n    {\n      s = getnameinfo(ifa->ifa_addr,\n        (family == AF_INET) ? sizeof(struct sockaddr_in) :\n        sizeof(struct sockaddr_in6),\n        host, NI_MAXHOST, NULL, 0, NI_NUMERICHOST);\n\n      if (s != 0)\n        break;\n      ret.push_back(host);\n    }\n  }\n\n  freeifaddrs(ifaddr);\n#endif\n  return ret;\n}\n\n} \/\/ namespace detail\n} \/\/ namespace qi\n<commit_msg>Fix transport handling in address<commit_after>\/*\n*  Author(s):\n*  - Chris  Kilner <ckilner@aldebaran-robotics.com>\n*  - Cedric Gestes <gestes@aldebaran-robotics.com>\n*\n*  Copyright (C) 2010 Aldebaran Robotics\n*\/\n\n#include \"src\/messaging\/network\/ip_address.hpp\"\n#include <boost\/algorithm\/string.hpp>\n\n#ifdef _WIN32\n#  include <windows.h>\n#  include <winsock2.h>\n#  include <iphlpapi.h>\n#  include <Ws2tcpip.h>\n#else\n#  include <arpa\/inet.h>\n#  include <sys\/socket.h>\n#  include <netdb.h>\n#  include <ifaddrs.h>\n#  include <stdio.h>\n#  include <stdlib.h>\n#  include <unistd.h>\n#endif\n\nnamespace qi {\nnamespace detail {\n\nstd::string getPrimaryPublicIPAddress()\n{\n  std::vector<std::string> ips = getIPAddresses();\n  static const std::string ipLocalHost = \"127.0.0.1\";\n  \/\/ todo: some logic to choose between good addresses\n  for (unsigned int i = 0; i< ips.size(); i++)\n  {\n    if (ipLocalHost.compare(ips[i]) != 0)\n      return ips[i];\n  }\n  return \"\";\n}\n\nbool isValidAddress(const std::string& userHostString,\n  Address& outAddress)\n{\n  if (userHostString.empty())\n    return false;\n\n  std::vector<std::string> parts;\n  boost::split(parts, userHostString, boost::is_any_of(\":\/\"));\n\n  std::vector<std::string>::iterator i = parts.begin();\n  while (i != parts.end())\n  {\n    if (i->empty())\n      parts.erase(i);\n    else\n      ++i;\n  }\n\n  if (parts.size() <= 2)\n    parts.insert(parts.begin(), \"tcp\");\n\n  if (parts.size() < 2 || parts.size() > 3)\n    return false;\n\n  if (parts[1].empty())\n    return false;\n\n  outAddress.transport = parts[0];\n  outAddress.address = parts[1];\n\n  if (parts.size() == 3)\n  {\n    outAddress.port = atoi(parts[2].c_str());\n  }\n  else\n  {\n    outAddress.port = 0;\n    parts.push_back(\"0\"); \/\/ hmmm\n  }\n\n  return isValidHostAndPort(outAddress.address, parts[2]);\n}\n\n\nbool isValidHostAndPort(const std::string& hostName, std::string& port)\n{\n  bool ret = true;\n#ifdef _WIN32\n  WSADATA WSAData;\n  if(::WSAStartup(MAKEWORD(1, 0), &WSAData))\n    ret = false;\n#endif\n\n  addrinfo req;\n  memset(&req, 0, sizeof(req));\n  req.ai_family = AF_INET;\n  req.ai_socktype = SOCK_STREAM;\n  req.ai_flags = AI_NUMERICSERV;\n  addrinfo *res;\n\n  if(getaddrinfo(hostName.c_str(), port.c_str(), &req, &res))\n    ret = false; \/\/ lookup failed\n  else\n  {\n    if (res == NULL)\n      ret = false;\n    else\n      freeaddrinfo(res);\n  }\n#ifdef _WIN32\n  WSACleanup();\n#endif\n  return ret;\n}\n\nstd::vector<std::string> getIPAddresses()\n{\n  std::vector<std::string> ret;\n\n#ifdef _WIN32\n  \/\/ win version\n  char szHostName[128] = \"\";\n\n  WSADATA WSAData;\n  if(::WSAStartup(MAKEWORD(1, 0), &WSAData))\n    return ret;\n\n  if(::gethostname(szHostName, sizeof(szHostName)))\n    return ret;\n\n  struct sockaddr_in socketAddress;\n  struct hostent*    host = 0;\n\n  host = ::gethostbyname(szHostName);\n  if(!host)\n    return ret;\n\n  for(int i = 0; ((host->h_addr_list[i]) && (i < 10)); ++i)\n  {\n    memcpy(&socketAddress.sin_addr, host->h_addr_list[i], host->h_length);\n    ret.push_back(inet_ntoa(socketAddress.sin_addr));\n  }\n\n  WSACleanup();\n#else\n  \/\/ linux version\n  struct ifaddrs *ifaddr, *ifa;\n  int family, s;\n  char host[NI_MAXHOST];\n\n  if (getifaddrs(&ifaddr) == -1)\n    return ret;\n\n  for (ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next)\n  {\n    if (ifa->ifa_addr == NULL)\n      continue;\n    family = ifa->ifa_addr->sa_family;\n\n    \/\/ Don't include AF_INET6 for the moment\n    if (family == AF_INET)\n    {\n      s = getnameinfo(ifa->ifa_addr,\n        (family == AF_INET) ? sizeof(struct sockaddr_in) :\n        sizeof(struct sockaddr_in6),\n        host, NI_MAXHOST, NULL, 0, NI_NUMERICHOST);\n\n      if (s != 0)\n        break;\n      ret.push_back(host);\n    }\n  }\n\n  freeifaddrs(ifaddr);\n#endif\n  return ret;\n}\n\n} \/\/ namespace detail\n} \/\/ namespace qi\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n\nThis file is part of the QtMediaHub project on http:\/\/www.gitorious.org.\n\nCopyright (c) 2009 Nokia Corporation and\/or its subsidiary(-ies).*\nAll rights reserved.\n\nContact:  Nokia Corporation (qt-info@nokia.com)**\n\nYou 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 modification, are permitted provided that the following conditions are met:\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 Nokia Corporation and its Subsidiary(-ies) nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\"\n\n****************************************************************************\/\n\n#include \"mediamodel.h\"\n#include \"mediascanner.h\"\n#include \"dbreader.h\"\n#include \"backend.h\"\n\n#define DEBUG if (0) qDebug() << __PRETTY_FUNCTION__\n\nMediaModel::MediaModel(QObject *parent)\n    : QAbstractItemModel(parent), m_loading(false), m_loaded(false), m_reader(0), m_readerThread(0)\n{\n}\n\nMediaModel::~MediaModel()\n{\n}\n\nQString MediaModel::part() const\n{\n    return m_structure.split(\"|\").value(m_cursor.length());\n}\n\nQString MediaModel::mediaType() const\n{\n    return m_mediaType;\n}\n\nvoid MediaModel::setMediaType(const QString &type)\n{\n    if (type == m_mediaType)\n        return;\n\n    initialize();\n\n    m_mediaType = type;\n    emit mediaTypeChanged();\n\n    \/\/ Add the fields of the table as role names\n    QSqlDriver *driver = Backend::instance()->mediaDatabase().driver();\n    QSqlRecord record = driver->record(m_mediaType);\n    if (record.isEmpty())\n        qWarning() << \"Table \" << type << \" is not valid it seems\";\n\n    QHash<int, QByteArray> hash = roleNames();\n    hash.insert(DotDotRole, \"dotdot\");\n    hash.insert(IsLeafRole, \"isLeaf\");\n    hash.insert(PreviewUrlRole, \"previewUrl\");\n\n    for (int i = 0; i < record.count(); i++) {\n        hash.insert(FieldRolesBegin + i, record.fieldName(i).toUtf8());\n    }\n\n    setRoleNames(hash);\n}\n\nvoid MediaModel::addSearchPath(const QString &path, const QString &name)\n{\n    if (m_mediaType.isEmpty()) {\n        qWarning() << m_mediaType << \" is not set yet\";\n        return;\n    }\n\n    QMetaObject::invokeMethod(MediaScanner::instance(), \"addSearchPath\", Qt::QueuedConnection, \n                              Q_ARG(QString, m_mediaType), Q_ARG(QString, path), Q_ARG(QString, name));\n}\n\nvoid MediaModel::removeSearchPath(int index)\n{\n    Q_UNUSED(index);\n}\n\nQString MediaModel::structure() const\n{\n    return m_structure;\n}\n\nvoid MediaModel::setStructure(const QString &str)\n{\n    m_structure = str;\n    initialize();\n    m_layoutInfo.clear();\n    foreach(const QString &part, m_structure.split(\"|\"))\n        m_layoutInfo.append(part.split(\",\"));\n\n    emit structureChanged();\n}\n\nvoid MediaModel::enter(int index)\n{\n    if (m_cursor.count() + 1 == m_layoutInfo.count() && index != 0 \/* up on leaf node is OK *\/) {\n        DEBUG << \"Refusing to enter leaf node\";\n        return;\n    }\n\n    if (index == 0 && !m_cursor.isEmpty()) {\n        back();\n        return;\n    }\n\n    DEBUG << \"Entering \" << index;\n    m_cursor.append(m_data[index]);\n    initialize();\n    emit partChanged();\n}\n\nvoid MediaModel::back()\n{\n    m_cursor.removeLast();\n    initialize();\n    emit partChanged();\n}\n\nQVariant MediaModel::data(const QModelIndex &index, int role) const\n{\n    if (!index.isValid())\n        return QVariant();\n    \n    return m_data.value(index.row()).value(role);\n}\n\nQModelIndex MediaModel::index(int row, int col, const QModelIndex &parent) const\n{\n    if (parent.isValid())\n        return QModelIndex();\n\n    return createIndex(row, col);\n}\n\nQModelIndex MediaModel::parent(const QModelIndex &idx) const\n{\n    Q_UNUSED(idx);\n    return QModelIndex();\n}\n\nint MediaModel::rowCount(const QModelIndex &parent) const\n{\n    if (parent.isValid())\n        return 0;\n    return m_data.count();\n}\n\nint MediaModel::columnCount(const QModelIndex &idx) const\n{\n    Q_UNUSED(idx);\n    return 1;\n}\n\nbool MediaModel::hasChildren(const QModelIndex &parent) const\n{\n    return !parent.isValid();\n}\n\nbool MediaModel::canFetchMore(const QModelIndex &parent) const\n{\n    if (parent.isValid() || m_mediaType.isEmpty() || m_layoutInfo.isEmpty())\n        return false;\n    return !m_loading && !m_loaded;\n}\n\nvoid MediaModel::fetchMore(const QModelIndex &parent)\n{\n    if (!canFetchMore(parent))\n        return;\n\n    m_loading = true;\n\n    QSqlQuery q = buildQuery();\n    DEBUG << q.lastQuery();\n    QMetaObject::invokeMethod(m_reader, \"execute\", Qt::QueuedConnection, Q_ARG(QSqlQuery, q));\n}\n\nvoid MediaModel::initialize()\n{\n    DEBUG << \"\";\n\n    beginResetModel();\n\n    m_data.clear();\n\n    DbReader *newReader = new DbReader;\n    if (m_reader) {\n        disconnect(m_reader, 0, this, 0);\n        m_reader->stop();\n        m_reader->deleteLater();\n    }\n    m_reader = newReader;\n\n    if (!m_readerThread) {\n        m_readerThread = new QThread(this);\n        m_readerThread->start();\n    }\n    m_reader->moveToThread(m_readerThread);\n    QMetaObject::invokeMethod(m_reader, \"initialize\", Q_ARG(QSqlDatabase, Backend::instance()->mediaDatabase()));\n    connect(m_reader, SIGNAL(dataReady(DbReader *, QList<QSqlRecord>, void *)),\n            this, SLOT(handleDataReady(DbReader *, QList<QSqlRecord>, void *)));\n\n    m_loading = m_loaded = false;\n\n    endResetModel();\n}\n\nvoid MediaModel::handleDataReady(DbReader *reader, const QList<QSqlRecord> &records, void *node)\n{\n    Q_ASSERT(reader == m_reader);\n    Q_UNUSED(reader);\n    Q_UNUSED(node);\n\n    DEBUG << \"Received response from db of size \" << records.size();\n\n    if (records.isEmpty())\n        return;\n\n    if (!m_cursor.isEmpty()) {\n        beginInsertRows(QModelIndex(), 0, records.count());\n        QHash<int, QVariant> data;\n        data.insert(Qt::DisplayRole, tr(\"..\"));\n        data.insert(DotDotRole, true);\n        data.insert(IsLeafRole, false);\n        m_data.append(data);\n    } else {\n        beginInsertRows(QModelIndex(), 0, records.count() - 1);\n    }\n\n    const bool isLeaf = m_cursor.count() + 1 == m_layoutInfo.count();\n\n    QSqlDriver *driver = Backend::instance()->mediaDatabase().driver();\n    const QSqlRecord tableRecord = driver->record(m_mediaType);\n\n    for (int i = 0; i < records.count(); i++) {\n        QHash<int, QVariant> data;\n        for (int j = 0; j < records[i].count(); j++) {\n            int idx = tableRecord.indexOf(records[i].fieldName(j));\n            data.insert(FieldRolesBegin + idx, records[i].value(j));\n        }\n\n        \/\/ Provide 'display' role as , separated values\n        QStringList cols = m_layoutInfo.value(m_cursor.count());\n        QStringList displayString;\n        for (int j = 0; j < cols.count(); j++) {\n            displayString << records[i].value(cols[j]).toString();\n        }\n        data.insert(Qt::DisplayRole, displayString.join(\", \"));\n        data.insert(DotDotRole, false);\n        data.insert(IsLeafRole, isLeaf);\n\n        data.insert(PreviewUrlRole, records[i].value(\"thumbnail\").toByteArray());\n\n        m_data.append(data);\n    }\n\n    m_loading = false;\n    m_loaded = true;\n\n    endInsertRows();\n}\n\nvoid MediaModel::handleDatabaseUpdated(const QList<QSqlRecord> &records)\n{\n    Q_UNUSED(records);\n    \/\/ not implemented yet\n}\n\nQSqlQuery MediaModel::buildQuery() const\n{\n    QSqlDriver *driver = Backend::instance()->mediaDatabase().driver();\n\n    QStringList escapedCurParts;\n    QStringList curParts = m_layoutInfo[m_cursor.count()];\n    for (int i = 0; i < curParts.count(); i++)\n        escapedCurParts.append(driver->escapeIdentifier(curParts[i], QSqlDriver::FieldName));\n    QString escapedCurPart = escapedCurParts.join(\",\");\n\n    QSqlQuery query(Backend::instance()->mediaDatabase());\n    query.setForwardOnly(true);\n\n    QStringList placeHolders;\n    const bool lastPart = m_cursor.count() == m_layoutInfo.count()-1;\n    QString queryString;\n    \/\/ SQLite allows us to select columns that are not present in the GROUP BY. We use this feature\n    \/\/ to select thumbnails for non-leaf nodes\n    queryString.append(\"SELECT *\");\n    queryString.append(\" FROM \" + driver->escapeIdentifier(m_mediaType, QSqlDriver::TableName));\n\n    if (!m_cursor.isEmpty()) {\n        QStringList where;\n        const QSqlRecord tableRecord = driver->record(m_mediaType);\n        for (int i = 0; i < m_cursor.count(); i++) {\n            QStringList subParts = m_layoutInfo[i];\n            for (int j = 0; j < subParts.count(); j++) {\n                where.append(subParts[j] + \" = ?\");\n                const int role = FieldRolesBegin + tableRecord.indexOf(subParts[j]);\n                placeHolders << m_cursor[i].value(role).toString();\n            }\n        }\n\n        queryString.append(\" WHERE \" + where.join(\" AND \"));\n    }\n\n    if (!lastPart)\n        queryString.append(\" GROUP BY \" + escapedCurPart);\n\n    queryString.append(\" ORDER BY \" + escapedCurPart);\n\n    query.prepare(queryString);\n\n    foreach(const QString &placeHolder, placeHolders)\n        query.addBindValue(placeHolder);\n\n    return query;\n}\n\n<commit_msg>Return a string since that is what QML url properties usually want<commit_after>\/****************************************************************************\n\nThis file is part of the QtMediaHub project on http:\/\/www.gitorious.org.\n\nCopyright (c) 2009 Nokia Corporation and\/or its subsidiary(-ies).*\nAll rights reserved.\n\nContact:  Nokia Corporation (qt-info@nokia.com)**\n\nYou 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 modification, are permitted provided that the following conditions are met:\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 Nokia Corporation and its Subsidiary(-ies) nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\"\n\n****************************************************************************\/\n\n#include \"mediamodel.h\"\n#include \"mediascanner.h\"\n#include \"dbreader.h\"\n#include \"backend.h\"\n\n#define DEBUG if (0) qDebug() << __PRETTY_FUNCTION__\n\nMediaModel::MediaModel(QObject *parent)\n    : QAbstractItemModel(parent), m_loading(false), m_loaded(false), m_reader(0), m_readerThread(0)\n{\n}\n\nMediaModel::~MediaModel()\n{\n}\n\nQString MediaModel::part() const\n{\n    return m_structure.split(\"|\").value(m_cursor.length());\n}\n\nQString MediaModel::mediaType() const\n{\n    return m_mediaType;\n}\n\nvoid MediaModel::setMediaType(const QString &type)\n{\n    if (type == m_mediaType)\n        return;\n\n    initialize();\n\n    m_mediaType = type;\n    emit mediaTypeChanged();\n\n    \/\/ Add the fields of the table as role names\n    QSqlDriver *driver = Backend::instance()->mediaDatabase().driver();\n    QSqlRecord record = driver->record(m_mediaType);\n    if (record.isEmpty())\n        qWarning() << \"Table \" << type << \" is not valid it seems\";\n\n    QHash<int, QByteArray> hash = roleNames();\n    hash.insert(DotDotRole, \"dotdot\");\n    hash.insert(IsLeafRole, \"isLeaf\");\n    hash.insert(PreviewUrlRole, \"previewUrl\");\n\n    for (int i = 0; i < record.count(); i++) {\n        hash.insert(FieldRolesBegin + i, record.fieldName(i).toUtf8());\n    }\n\n    setRoleNames(hash);\n}\n\nvoid MediaModel::addSearchPath(const QString &path, const QString &name)\n{\n    if (m_mediaType.isEmpty()) {\n        qWarning() << m_mediaType << \" is not set yet\";\n        return;\n    }\n\n    QMetaObject::invokeMethod(MediaScanner::instance(), \"addSearchPath\", Qt::QueuedConnection, \n                              Q_ARG(QString, m_mediaType), Q_ARG(QString, path), Q_ARG(QString, name));\n}\n\nvoid MediaModel::removeSearchPath(int index)\n{\n    Q_UNUSED(index);\n}\n\nQString MediaModel::structure() const\n{\n    return m_structure;\n}\n\nvoid MediaModel::setStructure(const QString &str)\n{\n    m_structure = str;\n    initialize();\n    m_layoutInfo.clear();\n    foreach(const QString &part, m_structure.split(\"|\"))\n        m_layoutInfo.append(part.split(\",\"));\n\n    emit structureChanged();\n}\n\nvoid MediaModel::enter(int index)\n{\n    if (m_cursor.count() + 1 == m_layoutInfo.count() && index != 0 \/* up on leaf node is OK *\/) {\n        DEBUG << \"Refusing to enter leaf node\";\n        return;\n    }\n\n    if (index == 0 && !m_cursor.isEmpty()) {\n        back();\n        return;\n    }\n\n    DEBUG << \"Entering \" << index;\n    m_cursor.append(m_data[index]);\n    initialize();\n    emit partChanged();\n}\n\nvoid MediaModel::back()\n{\n    m_cursor.removeLast();\n    initialize();\n    emit partChanged();\n}\n\nQVariant MediaModel::data(const QModelIndex &index, int role) const\n{\n    if (!index.isValid())\n        return QVariant();\n    \n    return m_data.value(index.row()).value(role);\n}\n\nQModelIndex MediaModel::index(int row, int col, const QModelIndex &parent) const\n{\n    if (parent.isValid())\n        return QModelIndex();\n\n    return createIndex(row, col);\n}\n\nQModelIndex MediaModel::parent(const QModelIndex &idx) const\n{\n    Q_UNUSED(idx);\n    return QModelIndex();\n}\n\nint MediaModel::rowCount(const QModelIndex &parent) const\n{\n    if (parent.isValid())\n        return 0;\n    return m_data.count();\n}\n\nint MediaModel::columnCount(const QModelIndex &idx) const\n{\n    Q_UNUSED(idx);\n    return 1;\n}\n\nbool MediaModel::hasChildren(const QModelIndex &parent) const\n{\n    return !parent.isValid();\n}\n\nbool MediaModel::canFetchMore(const QModelIndex &parent) const\n{\n    if (parent.isValid() || m_mediaType.isEmpty() || m_layoutInfo.isEmpty())\n        return false;\n    return !m_loading && !m_loaded;\n}\n\nvoid MediaModel::fetchMore(const QModelIndex &parent)\n{\n    if (!canFetchMore(parent))\n        return;\n\n    m_loading = true;\n\n    QSqlQuery q = buildQuery();\n    DEBUG << q.lastQuery();\n    QMetaObject::invokeMethod(m_reader, \"execute\", Qt::QueuedConnection, Q_ARG(QSqlQuery, q));\n}\n\nvoid MediaModel::initialize()\n{\n    DEBUG << \"\";\n\n    beginResetModel();\n\n    m_data.clear();\n\n    DbReader *newReader = new DbReader;\n    if (m_reader) {\n        disconnect(m_reader, 0, this, 0);\n        m_reader->stop();\n        m_reader->deleteLater();\n    }\n    m_reader = newReader;\n\n    if (!m_readerThread) {\n        m_readerThread = new QThread(this);\n        m_readerThread->start();\n    }\n    m_reader->moveToThread(m_readerThread);\n    QMetaObject::invokeMethod(m_reader, \"initialize\", Q_ARG(QSqlDatabase, Backend::instance()->mediaDatabase()));\n    connect(m_reader, SIGNAL(dataReady(DbReader *, QList<QSqlRecord>, void *)),\n            this, SLOT(handleDataReady(DbReader *, QList<QSqlRecord>, void *)));\n\n    m_loading = m_loaded = false;\n\n    endResetModel();\n}\n\nvoid MediaModel::handleDataReady(DbReader *reader, const QList<QSqlRecord> &records, void *node)\n{\n    Q_ASSERT(reader == m_reader);\n    Q_UNUSED(reader);\n    Q_UNUSED(node);\n\n    DEBUG << \"Received response from db of size \" << records.size();\n\n    if (records.isEmpty())\n        return;\n\n    if (!m_cursor.isEmpty()) {\n        beginInsertRows(QModelIndex(), 0, records.count());\n        QHash<int, QVariant> data;\n        data.insert(Qt::DisplayRole, tr(\"..\"));\n        data.insert(DotDotRole, true);\n        data.insert(IsLeafRole, false);\n        m_data.append(data);\n    } else {\n        beginInsertRows(QModelIndex(), 0, records.count() - 1);\n    }\n\n    const bool isLeaf = m_cursor.count() + 1 == m_layoutInfo.count();\n\n    QSqlDriver *driver = Backend::instance()->mediaDatabase().driver();\n    const QSqlRecord tableRecord = driver->record(m_mediaType);\n\n    for (int i = 0; i < records.count(); i++) {\n        QHash<int, QVariant> data;\n        for (int j = 0; j < records[i].count(); j++) {\n            int idx = tableRecord.indexOf(records[i].fieldName(j));\n            data.insert(FieldRolesBegin + idx, records[i].value(j));\n        }\n\n        \/\/ Provide 'display' role as , separated values\n        QStringList cols = m_layoutInfo.value(m_cursor.count());\n        QStringList displayString;\n        for (int j = 0; j < cols.count(); j++) {\n            displayString << records[i].value(cols[j]).toString();\n        }\n        data.insert(Qt::DisplayRole, displayString.join(\", \"));\n        data.insert(DotDotRole, false);\n        data.insert(IsLeafRole, isLeaf);\n\n        data.insert(PreviewUrlRole, records[i].value(\"thumbnail\").toString());\n\n        m_data.append(data);\n    }\n\n    m_loading = false;\n    m_loaded = true;\n\n    endInsertRows();\n}\n\nvoid MediaModel::handleDatabaseUpdated(const QList<QSqlRecord> &records)\n{\n    Q_UNUSED(records);\n    \/\/ not implemented yet\n}\n\nQSqlQuery MediaModel::buildQuery() const\n{\n    QSqlDriver *driver = Backend::instance()->mediaDatabase().driver();\n\n    QStringList escapedCurParts;\n    QStringList curParts = m_layoutInfo[m_cursor.count()];\n    for (int i = 0; i < curParts.count(); i++)\n        escapedCurParts.append(driver->escapeIdentifier(curParts[i], QSqlDriver::FieldName));\n    QString escapedCurPart = escapedCurParts.join(\",\");\n\n    QSqlQuery query(Backend::instance()->mediaDatabase());\n    query.setForwardOnly(true);\n\n    QStringList placeHolders;\n    const bool lastPart = m_cursor.count() == m_layoutInfo.count()-1;\n    QString queryString;\n    \/\/ SQLite allows us to select columns that are not present in the GROUP BY. We use this feature\n    \/\/ to select thumbnails for non-leaf nodes\n    queryString.append(\"SELECT *\");\n    queryString.append(\" FROM \" + driver->escapeIdentifier(m_mediaType, QSqlDriver::TableName));\n\n    if (!m_cursor.isEmpty()) {\n        QStringList where;\n        const QSqlRecord tableRecord = driver->record(m_mediaType);\n        for (int i = 0; i < m_cursor.count(); i++) {\n            QStringList subParts = m_layoutInfo[i];\n            for (int j = 0; j < subParts.count(); j++) {\n                where.append(subParts[j] + \" = ?\");\n                const int role = FieldRolesBegin + tableRecord.indexOf(subParts[j]);\n                placeHolders << m_cursor[i].value(role).toString();\n            }\n        }\n\n        queryString.append(\" WHERE \" + where.join(\" AND \"));\n    }\n\n    if (!lastPart)\n        queryString.append(\" GROUP BY \" + escapedCurPart);\n\n    queryString.append(\" ORDER BY \" + escapedCurPart);\n\n    query.prepare(queryString);\n\n    foreach(const QString &placeHolder, placeHolders)\n        query.addBindValue(placeHolder);\n\n    return query;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <imgui.h>\n#include <imgui_internal.h>\n#include \"SeqUISequencer.h\";\n#include \"SeqProjectHeaders.h\";\n#include \"SeqSerializer.h\";\n#include \"SeqString.h\";\n#include \"SeqList.h\";\n\nSeqUISequencer::SeqUISequencer(SeqProject *project):\n\tproject(project)\n{\n\tInit();\n}\n\nSeqUISequencer::SeqUISequencer(SeqProject *project, SeqSerializer *serializer):\n\tproject(project)\n{\n\tInit();\n\tDeserialize(serializer);\n}\n\nvoid SeqUISequencer::Init()\n{\n\t\/\/ alloc memory\n\tname = SeqString::Format(\"Sequencer##%d\", project->NextWindowId());\n\tchannelHeights = new SeqList<int>();\n\tfor (int i = 0; i < project->GetChannelCount(); i++)\n\t\tchannelHeights->Add(initialChannelHeight);\n\t\/\/ start listening for project changes\n\tproject->AddActionHandler(this);\n}\n\nSeqUISequencer::~SeqUISequencer()\n{\n\t\/\/ stop listening for project changes\n\tproject->RemoveActionHandler(this);\n\t\/\/ free memory\n\tdelete[] name;\n\tdelete channelHeights; \n}\n\nvoid SeqUISequencer::ActionDone(const SeqAction action)\n{\n\tswitch (action.type)\n\t{\n\t\tcase SeqActionType::AddChannel:\n\t\t\tchannelHeights->Add(initialChannelHeight);\n\t\t\tbreak;\n\t}\n}\n\nvoid SeqUISequencer::ActionUndone(const SeqAction action)\n{\n\tswitch (action.type)\n\t{\n\t\tcase SeqActionType::AddChannel:\n\t\t\tchannelHeights->RemoveAt(channelHeights->Count() - 1);\n\t\t\tbreak;\n\t}\n}\n\nSeqWindowType SeqUISequencer::GetWindowType()\n{\n\treturn SeqWindowType::Sequencer;\n}\n\nvoid SeqUISequencer::Draw()\n{\n\tbool isWindowNew = false;\n\tif (!ImGui::FindWindowByName(name))\n\t\tisWindowNew = true;\n\tbool isOpen = true;\n\t\n\tif (ImGui::Begin(name, &isOpen, ImGuiWindowFlags_::ImGuiWindowFlags_NoScrollbar))\n\t{\n\t\tconst static ImVec2 textSize = ImGui::CalcTextSize(\"01234567889:.\");\n\t\tconst float headerHeight = textSize.y + 3;\n\t\tImGui::Columns(2, \"panel\");\n\t\tDrawChannelSettings(headerHeight, isWindowNew);\n\t\tImGui::NextColumn();\n\t\tImGui::SetCursorPos(ImVec2(ImGui::GetCursorPosX() - 4, ImGui::GetCursorPosY() + 1));\n\t\tDrawSequencerRuler(headerHeight);\n\t\tDrawChannels();\n\t\tImGui::Columns(1);\n\t}\n\tImGui::End();\n\tif (!isOpen)\n\t\tproject->RemoveWindow(this);\n}\n\nvoid SeqUISequencer::DrawChannelSettings(float rulerHeight, bool isWindowNew)\n{\n\tconst ImGuiStyle style = ImGui::GetStyle();\n\tconst ImVec2 origin = ImGui::GetCursorScreenPos();\n\tconst ImVec2 size = ImVec2(settingsPanelWidth, ImGui::GetContentRegionAvail().y);\n\t\n\t\/\/ draw channel settings\n\tImDrawList* drawList = ImGui::GetWindowDrawList();\n\tconst ImU32 color = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_TextDisabled]);\n\tconst ImU32 bgColor = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_ComboBg]);\n\t\n\t\/\/ default panel width\n\tif (isWindowNew)\n\t\tImGui::SetColumnOffset(1, settingsPanelWidth + 7);\n\n\t\/\/ debug text\n\tImGui::Text(\"%s\", name);\n\n\tImVec2 cursor = origin;\n\tcursor.y += rulerHeight + 1;\n\tImGui::PushClipRect(cursor, ImVec2(cursor.x + size.x, cursor.y + size.y - rulerHeight - style.ScrollbarSize), false);\n\t\/\/ draw settings panels\n\tfor (int i = 0; i < project->GetChannelCount(); i++)\n\t{\n\t\tfloat channelHeight = channelHeights->Get(i);\n\t\t\/\/ only draw if visible\n\t\tif (cursor.y - origin.y + channelHeight >= scrollY &&\n\t\t\tcursor.y - origin.y < scrollY + size.y)\n\t\t{\n\t\t\tdrawList->AddRectFilled(ImVec2(cursor.x, cursor.y - scrollY), ImVec2(cursor.x + size.x, cursor.y - scrollY + channelHeight), bgColor, rounding, 0x1 | 0x8);\n\t\t\tdrawList->AddRect(ImVec2(cursor.x, cursor.y - scrollY), ImVec2(cursor.x + size.x, cursor.y - scrollY + channelHeight), color, rounding, 0x1 | 0x8, lineThickness);\n\t\t\tImGui::SetCursorScreenPos(ImVec2(cursor.x + 4, cursor.y - scrollY + 4));\n\t\t\tImGui::Text(\"%s %d\", project->GetChannel(i).name, i);\n\t\t}\n\t\tcursor.y += channelHeight + channelVerticalSpacing;\n\t}\n\t\/\/ draw and handle row resizing\n\t\/\/ code based on ImGui::Column()\n\tcursor = origin;\n\tcursor.y += rulerHeight;\n\tImGuiContext* g = ImGui::GetCurrentContext();\n\tfor (int i = 0; i < project->GetChannelCount(); i++)\n\t{\n\t\tfloat channelHeight = channelHeights->Get(i);\n\t\tcursor.y += channelHeight;\n\t\t\/\/ if visible\n\t\tif (cursor.y - origin.y >= scrollY && \n\t\t\tcursor.y - origin.y < scrollY + size.y)\n\t\t{\n\t\t\tconst ImGuiID row_id = ImGui::GetID(\"row\") + ImGuiID(i);\n\t\t\tImGui::KeepAliveID(row_id);\n\t\t\tconst ImRect row_rect(ImVec2(cursor.x, cursor.y - scrollY - 4), ImVec2(cursor.x + size.x, cursor.y - scrollY + 4));\n\n\t\t\tbool hovered, held;\n\t\t\tImGui::ButtonBehavior(row_rect, row_id, &hovered, &held);\n\t\t\tif (hovered || held)\n\t\t\t\tg->MouseCursor = ImGuiMouseCursor_ResizeNS;\n\n\t\t\t\/\/ Draw before resize so our items positioning are in sync with the line being drawn\n\t\t\tconst ImU32 col = ImGui::GetColorU32(held ? ImGuiCol_ColumnActive : hovered ? ImGuiCol_ColumnHovered : ImGuiCol_Column);\n\t\t\tdrawList->AddLine(ImVec2(cursor.x + rounding, cursor.y - scrollY), ImVec2(cursor.x + size.x, cursor.y - scrollY), col);\n\n\t\t\tif (held)\n\t\t\t{\n\t\t\t\tif (g->ActiveIdIsJustActivated)\n\t\t\t\t\tg->ActiveIdClickOffset.y -= 4;   \/\/ Store from center of row line (we used a 8 high rect for row clicking)\n\t\t\t\t\n\t\t\t\tImGuiWindow* window = ImGui::GetCurrentWindowRead();\n\t\t\t\tfloat newHeight = ImClamp(g->IO.MousePos.y - (cursor.y - channelHeight - scrollY) - g->ActiveIdClickOffset.y, minChannelHeight, maxChannelHeight);\n\t\t\t\tchannelHeights->Set(i, newHeight);\n\t\t\t}\n\t\t}\n\t\tcursor.y += channelVerticalSpacing;\n\t}\n\tImGui::PopClipRect();\n\t\/\/ clamp width\n\tsettingsPanelWidth = ImGui::GetColumnOffset(1) - 7;\n\tif (settingsPanelWidth < minSettingsPanelWidth)\n\t{\n\t\tsettingsPanelWidth = minSettingsPanelWidth;\n\t\tImGui::SetColumnOffset(1, settingsPanelWidth);\n\t}\n\tif (settingsPanelWidth > maxSettingsPanelWidth)\n\t{\n\t\tsettingsPanelWidth = maxSettingsPanelWidth;\n\t\tImGui::SetColumnOffset(1, settingsPanelWidth);\n\t}\n}\n\nvoid SeqUISequencer::DrawSequencerRuler(float height)\n{\n\tconst ImGuiStyle style = ImGui::GetStyle();\n\n\tconst ImVec2 origin = ImVec2(ImGui::GetCursorScreenPos().x, ImGui::GetCursorScreenPos().y);\n\tconst float width = ImGui::GetContentRegionAvailWidth() - style.ScrollbarSize;\n\tconst float thickness = 1.0f;\n\tconst ImU32 color = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_TextDisabled]);\n\n\t\/\/ clip so we won't draw on top of the settings panel\n\tImGui::PushClipRect(origin, ImVec2(origin.x + width, origin.y + height), false);\n\n\tImDrawList* drawList = ImGui::GetWindowDrawList();\n\t\/\/ underline\n\tdrawList->AddLine(ImVec2(origin.x, origin.y + height - 2), ImVec2(origin.x + width, origin.y + height - 2), color, thickness);\n\n\t\/\/ seconds lines\n\tint seconds = ceil(position);\n\tfloat firstOffset = -(position - floor(position)) * pixelsPerSecond \/ zoom;\n\tfloat scaledWidth = (origin.x + width) \/ zoom;\n\tfloat scaledStep = pixelsPerSecond \/ zoom;\n\tfor (float x = origin.x + firstOffset; x < origin.x + scaledWidth; x += scaledStep)\n\t{\n\t\tdrawList->AddLine(ImVec2(x, origin.y), ImVec2(x, origin.y + height - 1), color, thickness);\n\t\tImGui::SetCursorScreenPos(ImVec2(x + style.FramePadding.x, origin.y));\n\t\tImGui::Text(\"%02d\\:%02d\\.%d\", (seconds - (seconds % 60)), seconds % 60, 0);\n\t\tseconds++;\n\t}\n\tImGui::PopClipRect();\n\n\t\/\/ setup the position for channel drawing\n\tImGui::SetCursorScreenPos(ImVec2(origin.x, origin.y + height));\n}\n\nvoid SeqUISequencer::DrawChannels()\n{\n\tconst ImGuiStyle style = ImGui::GetStyle();\n\tconst ImVec2 contentSize = ImVec2(project->GetLength() * pixelsPerSecond \/ zoom, TotalChannelHeight() + 100);\n\tconst ImVec2 size = ImVec2(ImGui::GetContentRegionAvail().x - style.ScrollbarSize, ImGui::GetContentRegionAvail().y - style.ScrollbarSize);\n\tImGui::SetNextWindowContentSize(contentSize);\n\tImGui::BeginChild(\"channels\", ImVec2(0, 0), false, ImGuiWindowFlags_AlwaysVerticalScrollbar | ImGuiWindowFlags_AlwaysHorizontalScrollbar);\n\t{\n\t\tposition = ImGui::GetScrollX() \/ pixelsPerSecond * zoom;\n\t\tscrollY = ImGui::GetScrollY();\n\n\t\tconst ImVec2 origin = ImGui::GetCursorScreenPos();\n\n\t\tImDrawList* drawList = ImGui::GetWindowDrawList();\n\n\t\tconst ImU32 color = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_TextDisabled]);\n\t\tconst ImU32 bgColor = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_ComboBg]);\n\n\t\tImVec2 cursor = origin;\n\t\tfor (int i = 0; i < project->GetChannelCount(); i++)\n\t\t{\n\t\t\tfloat channelHeight = channelHeights->Get(i);\n\t\t\t\/\/ only draw if visible\n\t\t\tif (cursor.y - origin.y + channelHeight >= scrollY && \n\t\t\t\tcursor.y - origin.y < scrollY + size.y)\n\t\t\t{\n\t\t\t\tdrawList->AddRectFilled(ImVec2(cursor.x + ImGui::GetScrollX(), cursor.y), ImVec2(cursor.x + contentSize.x, cursor.y + channelHeight), bgColor, rounding, 0x2 | 0x4);\n\t\t\t\tdrawList->AddRect(ImVec2(cursor.x, cursor.y), ImVec2(cursor.x + contentSize.x, cursor.y + channelHeight), color, rounding, 0x2 | 0x4, lineThickness);\n\t\t\t\t\/\/ImGui::SetCursorScreenPos(ImVec2(cursor.x + ImGui::GetScrollX() + 4, cursor.y + 4));\n\t\t\t\t\/\/ImGui::Text(\"%s %d\", project->GetChannel(i).name, i);\n\t\t\t}\n\t\t\tcursor.y += channelHeight + channelVerticalSpacing;\n\t\t}\n\n\t\tstatic ImVec2 scrollPosTextSize = ImGui::CalcTextSize(\"ScrollPos: 00000.000, 00000.000\");\n\t\tImGui::SetCursorPos(ImVec2(ImGui::GetScrollX() + size.x - scrollPosTextSize.x, ImGui::GetScrollY() + size.y - scrollPosTextSize.y));\n\t\tImGui::Text(\"ScrollPos: %.3f, %.3f\", ImGui::GetScrollX(), ImGui::GetScrollY());\n\t}\n\tImGui::EndChild();\n}\n\nint SeqUISequencer::TotalChannelHeight()\n{\n\tint totalHeight = 0;\n\tfor (int i = 0; i < channelHeights->Count(); i++)\n\t\ttotalHeight += channelHeights->Get(i) + channelVerticalSpacing;\n\t\/\/ remove spacing on the bottom most channel\n\ttotalHeight -= channelVerticalSpacing;\n\treturn totalHeight;\n}\n\nvoid SeqUISequencer::Serialize(SeqSerializer *serializer)\n{\n\tserializer->Write(position);\n\tserializer->Write(zoom);\n\tserializer->Write(scrollY);\n\tserializer->Write(settingsPanelWidth);\n\tserializer->Write(channelHeights->Count());\n\tfor (int i = 0; i < channelHeights->Count(); i++)\n\t\tserializer->Write(channelHeights->Get(i));\n}\n\nvoid SeqUISequencer::Deserialize(SeqSerializer *serializer)\n{\n\tposition = serializer->ReadDouble();\n\tzoom = serializer->ReadFloat();\n\tscrollY = serializer->ReadFloat();\n\tsettingsPanelWidth = serializer->ReadFloat();\n\tint channelSettingsCount = serializer->ReadInt();\n\tfor (int i = 0; i < channelSettingsCount; i++)\n\t\tchannelHeights->ReplaceAt(serializer->ReadInt(), i);\n}<commit_msg>Improved some awkward code in SeqUISequencer.<commit_after>#include <imgui.h>\n#include <imgui_internal.h>\n#include \"SeqUISequencer.h\";\n#include \"SeqProjectHeaders.h\";\n#include \"SeqSerializer.h\";\n#include \"SeqString.h\";\n#include \"SeqList.h\";\n\nSeqUISequencer::SeqUISequencer(SeqProject *project):\n\tproject(project)\n{\n\tInit();\n}\n\nSeqUISequencer::SeqUISequencer(SeqProject *project, SeqSerializer *serializer):\n\tproject(project)\n{\n\tInit();\n\tDeserialize(serializer);\n}\n\nvoid SeqUISequencer::Init()\n{\n\t\/\/ alloc memory\n\tname = SeqString::Format(\"Sequencer##%d\", project->NextWindowId());\n\tchannelHeights = new SeqList<int>();\n\tfor (int i = 0; i < project->GetChannelCount(); i++)\n\t\tchannelHeights->Add(initialChannelHeight);\n\t\/\/ start listening for project changes\n\tproject->AddActionHandler(this);\n}\n\nSeqUISequencer::~SeqUISequencer()\n{\n\t\/\/ stop listening for project changes\n\tproject->RemoveActionHandler(this);\n\t\/\/ free memory\n\tdelete[] name;\n\tdelete channelHeights; \n}\n\nvoid SeqUISequencer::ActionDone(const SeqAction action)\n{\n\tswitch (action.type)\n\t{\n\t\tcase SeqActionType::AddChannel:\n\t\t\tchannelHeights->Add(initialChannelHeight);\n\t\t\tbreak;\n\t}\n}\n\nvoid SeqUISequencer::ActionUndone(const SeqAction action)\n{\n\tswitch (action.type)\n\t{\n\t\tcase SeqActionType::AddChannel:\n\t\t\tchannelHeights->RemoveAt(channelHeights->Count() - 1);\n\t\t\tbreak;\n\t}\n}\n\nSeqWindowType SeqUISequencer::GetWindowType()\n{\n\treturn SeqWindowType::Sequencer;\n}\n\nvoid SeqUISequencer::Draw()\n{\n\tbool isWindowNew = false;\n\tif (!ImGui::FindWindowByName(name))\n\t\tisWindowNew = true;\n\tbool isOpen = true;\n\t\n\tif (ImGui::Begin(name, &isOpen, ImGuiWindowFlags_::ImGuiWindowFlags_NoScrollbar))\n\t{\n\t\tconst float headerHeight = ImGui::GetTextLineHeightWithSpacing();\n\t\tImGui::Columns(2, \"panel\");\n\t\tDrawChannelSettings(headerHeight, isWindowNew);\n\t\tImGui::NextColumn();\n\t\tImGui::SetCursorPos(ImVec2(ImGui::GetCursorPosX() - 4, ImGui::GetCursorPosY() + 1));\n\t\tDrawSequencerRuler(headerHeight);\n\t\tDrawChannels();\n\t\tImGui::Columns(1);\n\t}\n\tImGui::End();\n\tif (!isOpen)\n\t\tproject->RemoveWindow(this);\n}\n\nvoid SeqUISequencer::DrawChannelSettings(float rulerHeight, bool isWindowNew)\n{\n\tconst ImGuiStyle style = ImGui::GetStyle();\n\tconst ImVec2 origin = ImGui::GetCursorScreenPos();\n\tconst ImVec2 size = ImVec2(settingsPanelWidth, ImGui::GetContentRegionAvail().y);\n\t\n\t\/\/ draw channel settings\n\tImDrawList* drawList = ImGui::GetWindowDrawList();\n\tconst ImU32 color = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_TextDisabled]);\n\tconst ImU32 bgColor = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_ComboBg]);\n\t\n\t\/\/ default panel width\n\tif (isWindowNew)\n\t\tImGui::SetColumnOffset(1, settingsPanelWidth + 7);\n\n\t\/\/ debug text\n\tImGui::Text(\"%s\", name);\n\n\tImVec2 cursor = origin;\n\tcursor.y += rulerHeight + 1;\n\tImGui::PushClipRect(cursor, ImVec2(cursor.x + size.x, cursor.y + size.y - rulerHeight - style.ScrollbarSize), false);\n\t\/\/ draw settings panels\n\tfor (int i = 0; i < project->GetChannelCount(); i++)\n\t{\n\t\tfloat channelHeight = channelHeights->Get(i);\n\t\t\/\/ only draw if visible\n\t\tif (cursor.y - origin.y + channelHeight >= scrollY &&\n\t\t\tcursor.y - origin.y < scrollY + size.y)\n\t\t{\n\t\t\tdrawList->AddRectFilled(ImVec2(cursor.x, cursor.y - scrollY), ImVec2(cursor.x + size.x, cursor.y - scrollY + channelHeight), bgColor, rounding, 0x1 | 0x8);\n\t\t\tdrawList->AddRect(ImVec2(cursor.x, cursor.y - scrollY), ImVec2(cursor.x + size.x, cursor.y - scrollY + channelHeight), color, rounding, 0x1 | 0x8, lineThickness);\n\t\t\tImGui::SetCursorScreenPos(ImVec2(cursor.x + 4, cursor.y - scrollY + 4));\n\t\t\tImGui::Text(\"%s %d\", project->GetChannel(i).name, i);\n\t\t}\n\t\tcursor.y += channelHeight + channelVerticalSpacing;\n\t}\n\t\/\/ draw and handle row resizing\n\t\/\/ code based on ImGui::Column()\n\tcursor = origin;\n\tcursor.y += rulerHeight;\n\tImGuiContext* g = ImGui::GetCurrentContext();\n\tfor (int i = 0; i < project->GetChannelCount(); i++)\n\t{\n\t\tfloat channelHeight = channelHeights->Get(i);\n\t\tcursor.y += channelHeight;\n\t\t\/\/ if visible\n\t\tif (cursor.y - origin.y >= scrollY && \n\t\t\tcursor.y - origin.y < scrollY + size.y)\n\t\t{\n\t\t\tconst ImGuiID row_id = ImGui::GetID(\"row\") + ImGuiID(i);\n\t\t\tImGui::KeepAliveID(row_id);\n\t\t\tconst ImRect row_rect(ImVec2(cursor.x, cursor.y - scrollY - 4), ImVec2(cursor.x + size.x, cursor.y - scrollY + 4));\n\n\t\t\tbool hovered, held;\n\t\t\tImGui::ButtonBehavior(row_rect, row_id, &hovered, &held);\n\t\t\tif (hovered || held)\n\t\t\t\tg->MouseCursor = ImGuiMouseCursor_ResizeNS;\n\n\t\t\t\/\/ Draw before resize so our items positioning are in sync with the line being drawn\n\t\t\tconst ImU32 col = ImGui::GetColorU32(held ? ImGuiCol_ColumnActive : hovered ? ImGuiCol_ColumnHovered : ImGuiCol_Column);\n\t\t\tdrawList->AddLine(ImVec2(cursor.x + rounding, cursor.y - scrollY), ImVec2(cursor.x + size.x, cursor.y - scrollY), col);\n\n\t\t\tif (held)\n\t\t\t{\n\t\t\t\tif (g->ActiveIdIsJustActivated)\n\t\t\t\t\tg->ActiveIdClickOffset.y -= 4;   \/\/ Store from center of row line (we used a 8 high rect for row clicking)\n\t\t\t\t\n\t\t\t\tImGuiWindow* window = ImGui::GetCurrentWindowRead();\n\t\t\t\tfloat newHeight = ImClamp(g->IO.MousePos.y - (cursor.y - channelHeight - scrollY) - g->ActiveIdClickOffset.y, minChannelHeight, maxChannelHeight);\n\t\t\t\tchannelHeights->Set(i, newHeight);\n\t\t\t}\n\t\t}\n\t\tcursor.y += channelVerticalSpacing;\n\t}\n\tImGui::PopClipRect();\n\t\/\/ clamp width\n\tsettingsPanelWidth = ImGui::GetColumnOffset(1) - 7;\n\tif (settingsPanelWidth < minSettingsPanelWidth)\n\t{\n\t\tsettingsPanelWidth = minSettingsPanelWidth;\n\t\tImGui::SetColumnOffset(1, settingsPanelWidth);\n\t}\n\tif (settingsPanelWidth > maxSettingsPanelWidth)\n\t{\n\t\tsettingsPanelWidth = maxSettingsPanelWidth;\n\t\tImGui::SetColumnOffset(1, settingsPanelWidth);\n\t}\n}\n\nvoid SeqUISequencer::DrawSequencerRuler(float height)\n{\n\tconst ImGuiStyle style = ImGui::GetStyle();\n\n\tconst ImVec2 origin = ImVec2(ImGui::GetCursorScreenPos().x, ImGui::GetCursorScreenPos().y);\n\tconst float width = ImGui::GetContentRegionAvailWidth() - style.ScrollbarSize;\n\tconst float thickness = 1.0f;\n\tconst ImU32 color = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_TextDisabled]);\n\n\t\/\/ clip so we won't draw on top of the settings panel\n\tImGui::PushClipRect(origin, ImVec2(origin.x + width, origin.y + height), false);\n\n\tImDrawList* drawList = ImGui::GetWindowDrawList();\n\t\/\/ underline\n\tdrawList->AddLine(ImVec2(origin.x, origin.y + height - 2), ImVec2(origin.x + width, origin.y + height - 2), color, thickness);\n\n\t\/\/ seconds lines\n\tint seconds = ceil(position);\n\tfloat firstOffset = -(position - floor(position)) * pixelsPerSecond \/ zoom;\n\tfloat scaledWidth = (origin.x + width) \/ zoom;\n\tfloat scaledStep = pixelsPerSecond \/ zoom;\n\tfor (float x = origin.x + firstOffset; x < origin.x + scaledWidth; x += scaledStep)\n\t{\n\t\tdrawList->AddLine(ImVec2(x, origin.y), ImVec2(x, origin.y + height - 1), color, thickness);\n\t\tImGui::SetCursorScreenPos(ImVec2(x + style.FramePadding.x, origin.y));\n\t\tImGui::Text(\"%02d\\:%02d\\.%d\", (seconds - (seconds % 60)), seconds % 60, 0);\n\t\tseconds++;\n\t}\n\tImGui::PopClipRect();\n\n\t\/\/ setup the position for channel drawing\n\tImGui::SetCursorScreenPos(ImVec2(origin.x, origin.y + height));\n}\n\nvoid SeqUISequencer::DrawChannels()\n{\n\tconst ImGuiStyle style = ImGui::GetStyle();\n\tconst ImVec2 contentSize = ImVec2(project->GetLength() * pixelsPerSecond \/ zoom, TotalChannelHeight() + 100);\n\tconst ImVec2 size = ImVec2(ImGui::GetContentRegionAvail().x - style.ScrollbarSize, ImGui::GetContentRegionAvail().y - style.ScrollbarSize);\n\tImGui::SetNextWindowContentSize(contentSize);\n\tImGui::BeginChild(\"channels\", ImVec2(0, 0), false, ImGuiWindowFlags_AlwaysVerticalScrollbar | ImGuiWindowFlags_AlwaysHorizontalScrollbar);\n\t{\n\t\tposition = ImGui::GetScrollX() \/ pixelsPerSecond * zoom;\n\t\tscrollY = ImGui::GetScrollY();\n\n\t\tconst ImVec2 origin = ImGui::GetCursorScreenPos();\n\n\t\tImDrawList* drawList = ImGui::GetWindowDrawList();\n\n\t\tconst ImU32 color = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_TextDisabled]);\n\t\tconst ImU32 bgColor = ImGui::ColorConvertFloat4ToU32(style.Colors[ImGuiCol_::ImGuiCol_ComboBg]);\n\n\t\tImVec2 cursor = origin;\n\t\tfor (int i = 0; i < project->GetChannelCount(); i++)\n\t\t{\n\t\t\tfloat channelHeight = channelHeights->Get(i);\n\t\t\t\/\/ only draw if visible\n\t\t\tif (cursor.y - origin.y + channelHeight >= scrollY && \n\t\t\t\tcursor.y - origin.y < scrollY + size.y)\n\t\t\t{\n\t\t\t\tdrawList->AddRectFilled(ImVec2(cursor.x + ImGui::GetScrollX(), cursor.y), ImVec2(cursor.x + contentSize.x, cursor.y + channelHeight), bgColor, rounding, 0x2 | 0x4);\n\t\t\t\tdrawList->AddRect(ImVec2(cursor.x, cursor.y), ImVec2(cursor.x + contentSize.x, cursor.y + channelHeight), color, rounding, 0x2 | 0x4, lineThickness);\n\t\t\t\t\/\/ImGui::SetCursorScreenPos(ImVec2(cursor.x + ImGui::GetScrollX() + 4, cursor.y + 4));\n\t\t\t\t\/\/ImGui::Text(\"%s %d\", project->GetChannel(i).name, i);\n\t\t\t}\n\t\t\tcursor.y += channelHeight + channelVerticalSpacing;\n\t\t}\n\n\t\tstatic ImVec2 scrollPosTextSize = ImGui::CalcTextSize(\"ScrollPos: 00000.000, 00000.000\");\n\t\tImGui::SetCursorPos(ImVec2(ImGui::GetScrollX() + size.x - scrollPosTextSize.x, ImGui::GetScrollY() + size.y - scrollPosTextSize.y));\n\t\tImGui::Text(\"ScrollPos: %.3f, %.3f\", ImGui::GetScrollX(), ImGui::GetScrollY());\n\t}\n\tImGui::EndChild();\n}\n\nint SeqUISequencer::TotalChannelHeight()\n{\n\tint totalHeight = 0;\n\tfor (int i = 0; i < channelHeights->Count(); i++)\n\t\ttotalHeight += channelHeights->Get(i) + channelVerticalSpacing;\n\t\/\/ remove spacing on the bottom most channel\n\ttotalHeight -= channelVerticalSpacing;\n\treturn totalHeight;\n}\n\nvoid SeqUISequencer::Serialize(SeqSerializer *serializer)\n{\n\tserializer->Write(position);\n\tserializer->Write(zoom);\n\tserializer->Write(scrollY);\n\tserializer->Write(settingsPanelWidth);\n\tserializer->Write(channelHeights->Count());\n\tfor (int i = 0; i < channelHeights->Count(); i++)\n\t\tserializer->Write(channelHeights->Get(i));\n}\n\nvoid SeqUISequencer::Deserialize(SeqSerializer *serializer)\n{\n\tposition = serializer->ReadDouble();\n\tzoom = serializer->ReadFloat();\n\tscrollY = serializer->ReadFloat();\n\tsettingsPanelWidth = serializer->ReadFloat();\n\tint channelSettingsCount = serializer->ReadInt();\n\tfor (int i = 0; i < channelSettingsCount; i++)\n\t\tchannelHeights->ReplaceAt(serializer->ReadInt(), i);\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2008, 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\/session.hpp\"\n#include \"libtorrent\/session_settings.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/alert_types.hpp\"\n#include \"libtorrent\/thread.hpp\"\n#include \"libtorrent\/time.hpp\"\n#include <boost\/tuple\/tuple.hpp>\n\n#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n\nvoid test_swarm(bool super_seeding = false, bool strict = false, bool seed_mode = false, bool time_critical = false)\n{\n\tusing namespace libtorrent;\n\n\t\/\/ in case the previous run was terminated\n\terror_code ec;\n\tremove_all(\".\/tmp1_swarm\", ec);\n\tremove_all(\".\/tmp2_swarm\", ec);\n\tremove_all(\".\/tmp3_swarm\", ec);\n\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48000, 49000), \"0.0.0.0\", 0);\n\tsession ses2(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(49000, 50000), \"0.0.0.0\", 0);\n\tsession ses3(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(50000, 51000), \"0.0.0.0\", 0);\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 = 100000;\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\tses2.set_upload_rate_limit(int(rate_limit \/ 2));\n\tses3.set_upload_rate_limit(int(rate_limit \/ 2));\n\n\tsession_settings settings;\n\tsettings.allow_multiple_connections_per_ip = true;\n\tsettings.ignore_limits_on_local_network = false;\n\tsettings.strict_super_seeding = strict;\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\tadd_torrent_params p;\n\tp.seed_mode = seed_mode;\n\t\/\/ test using piece sizes smaller than 16kB\n\tboost::tie(tor1, tor2, tor3) = setup_transfer(&ses1, &ses2, &ses3, true\n\t\t, false, true, \"_swarm\", 32 * 1024, 0, super_seeding, &p);\n\n\tint mask = alert::all_categories & ~(alert::progress_notification | alert::performance_warning);\n\tses1.set_alert_mask(mask);\n\tses2.set_alert_mask(mask);\n\tses3.set_alert_mask(mask);\n\n\tif (time_critical)\n\t{\n\t\ttor2.set_piece_deadline(2, seconds(0));\n\t\ttor2.set_piece_deadline(5, seconds(1));\n\t\ttor2.set_piece_deadline(8, seconds(2));\n\t}\n\n\tfloat sum_dl_rate2 = 0.f;\n\tfloat sum_dl_rate3 = 0.f;\n\tint count_dl_rates2 = 0;\n\tint count_dl_rates3 = 0;\n\n\tfor (int i = 0; i < 80; ++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\tif (st2.progress < 1.f && st2.progress > 0.5f)\n\t\t{\n\t\t\tsum_dl_rate2 += st2.download_payload_rate;\n\t\t\t++count_dl_rates2;\n\t\t}\n\t\tif (st3.progress < 1.f && st3.progress > 0.5f)\n\t\t{\n\t\t\tsum_dl_rate3 += st3.download_rate;\n\t\t\t++count_dl_rates3;\n\t\t}\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 (tor2.is_seed() && tor3.is_seed()) break;\n\t\ttest_sleep(1000);\n\t}\n\n\tTEST_CHECK(tor2.is_seed());\n\tTEST_CHECK(tor3.is_seed());\n\n\tfloat average2 = sum_dl_rate2 \/ float(count_dl_rates2);\n\tfloat average3 = sum_dl_rate3 \/ float(count_dl_rates3);\n\n\tstd::cerr << average2 << std::endl;\n\tstd::cerr << \"average rate: \" << (average2 \/ 1000.f) << \"kB\/s - \"\n\t\t<< (average3 \/ 1000.f) << \"kB\/s\" << std::endl;\n\n\tif (tor2.is_seed() && tor3.is_seed()) std::cerr << \"done\\n\";\n\n\t\/\/ make sure the files are deleted\n\tses1.remove_torrent(tor1, session::delete_files);\n\tses2.remove_torrent(tor2, session::delete_files);\n\tses3.remove_torrent(tor3, session::delete_files);\n\n\tstd::auto_ptr<alert> a = ses1.pop_alert();\n\tptime end = time_now() + seconds(20);\n\twhile (a.get() == 0 || dynamic_cast<torrent_deleted_alert*>(a.get()) == 0)\n\t{\n\t\tif (ses1.wait_for_alert(end - time_now()) == 0)\n\t\t{\n\t\t\tstd::cerr << \"wait_for_alert() expired\" << std::endl;\n\t\t\tbreak;\n\t\t}\n\t\ta = ses1.pop_alert();\n\t\tassert(a.get());\n\t\tstd::cerr << a->message() << std::endl;\n\t}\n\n\tTEST_CHECK(dynamic_cast<torrent_deleted_alert*>(a.get()) != 0);\n\n\t\/\/ there shouldn't be any alerts generated from now on\n\t\/\/ make sure that the timer in wait_for_alert() works\n\t\/\/ this should time out (ret == 0) and it should take\n\t\/\/ about 2 seconds\n\tptime start = time_now_hires();\n\talert const* ret;\n\twhile ((ret = ses1.wait_for_alert(seconds(2))))\n\t{\n\t\ta = ses1.pop_alert();\n\t\tstd::cerr << ret->message() << std::endl;\n\t\tstart = time_now();\n\t}\n\tTEST_CHECK(time_now_hires() - start < seconds(3));\n\tTEST_CHECK(time_now_hires() - start >= seconds(2));\n\n\tTEST_CHECK(!exists(\".\/tmp1_swarm\/temporary\"));\n\tTEST_CHECK(!exists(\".\/tmp2_swarm\/temporary\"));\n\tTEST_CHECK(!exists(\".\/tmp3_swarm\/temporary\"));\n\n\tremove_all(\".\/tmp1_swarm\", ec);\n\tremove_all(\".\/tmp2_swarm\", ec);\n\tremove_all(\".\/tmp3_swarm\", ec);\n}\n\nint test_main()\n{\n\tusing namespace libtorrent;\n\n\t\/\/ with time critical pieces\n\ttest_swarm(false, false, false, true);\n\n\t\/\/ with seed mode\n\ttest_swarm(false, false, true);\n\n\ttest_swarm();\n\n\t\/\/ with super seeding\n\ttest_swarm(true);\n\t\n\t\/\/ with strict super seeding\n\ttest_swarm(true, true);\n\n\treturn 0;\n}\n\n<commit_msg>fixed test_swarm build<commit_after>\/*\n\nCopyright (c) 2008, 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\/session.hpp\"\n#include \"libtorrent\/session_settings.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/alert_types.hpp\"\n#include \"libtorrent\/thread.hpp\"\n#include \"libtorrent\/time.hpp\"\n#include <boost\/tuple\/tuple.hpp>\n\n#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n\nvoid test_swarm(bool super_seeding = false, bool strict = false, bool seed_mode = false, bool time_critical = false)\n{\n\tusing namespace libtorrent;\n\n\t\/\/ in case the previous run was terminated\n\terror_code ec;\n\tremove_all(\".\/tmp1_swarm\", ec);\n\tremove_all(\".\/tmp2_swarm\", ec);\n\tremove_all(\".\/tmp3_swarm\", ec);\n\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48000, 49000), \"0.0.0.0\", 0);\n\tsession ses2(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(49000, 50000), \"0.0.0.0\", 0);\n\tsession ses3(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(50000, 51000), \"0.0.0.0\", 0);\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 = 100000;\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\tses2.set_upload_rate_limit(int(rate_limit \/ 2));\n\tses3.set_upload_rate_limit(int(rate_limit \/ 2));\n\n\tsession_settings settings;\n\tsettings.allow_multiple_connections_per_ip = true;\n\tsettings.ignore_limits_on_local_network = false;\n\tsettings.strict_super_seeding = strict;\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\tadd_torrent_params p;\n\tp.seed_mode = seed_mode;\n\t\/\/ test using piece sizes smaller than 16kB\n\tboost::tie(tor1, tor2, tor3) = setup_transfer(&ses1, &ses2, &ses3, true\n\t\t, false, true, \"_swarm\", 32 * 1024, 0, super_seeding, &p);\n\n\tint mask = alert::all_categories & ~(alert::progress_notification | alert::performance_warning);\n\tses1.set_alert_mask(mask);\n\tses2.set_alert_mask(mask);\n\tses3.set_alert_mask(mask);\n\n\tif (time_critical)\n\t{\n\t\ttor2.set_piece_deadline(2, 0);\n\t\ttor2.set_piece_deadline(5, 1000);\n\t\ttor2.set_piece_deadline(8, 2000);\n\t}\n\n\tfloat sum_dl_rate2 = 0.f;\n\tfloat sum_dl_rate3 = 0.f;\n\tint count_dl_rates2 = 0;\n\tint count_dl_rates3 = 0;\n\n\tfor (int i = 0; i < 80; ++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\tif (st2.progress < 1.f && st2.progress > 0.5f)\n\t\t{\n\t\t\tsum_dl_rate2 += st2.download_payload_rate;\n\t\t\t++count_dl_rates2;\n\t\t}\n\t\tif (st3.progress < 1.f && st3.progress > 0.5f)\n\t\t{\n\t\t\tsum_dl_rate3 += st3.download_rate;\n\t\t\t++count_dl_rates3;\n\t\t}\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 (tor2.is_seed() && tor3.is_seed()) break;\n\t\ttest_sleep(1000);\n\t}\n\n\tTEST_CHECK(tor2.is_seed());\n\tTEST_CHECK(tor3.is_seed());\n\n\tfloat average2 = sum_dl_rate2 \/ float(count_dl_rates2);\n\tfloat average3 = sum_dl_rate3 \/ float(count_dl_rates3);\n\n\tstd::cerr << average2 << std::endl;\n\tstd::cerr << \"average rate: \" << (average2 \/ 1000.f) << \"kB\/s - \"\n\t\t<< (average3 \/ 1000.f) << \"kB\/s\" << std::endl;\n\n\tif (tor2.is_seed() && tor3.is_seed()) std::cerr << \"done\\n\";\n\n\t\/\/ make sure the files are deleted\n\tses1.remove_torrent(tor1, session::delete_files);\n\tses2.remove_torrent(tor2, session::delete_files);\n\tses3.remove_torrent(tor3, session::delete_files);\n\n\tstd::auto_ptr<alert> a = ses1.pop_alert();\n\tptime end = time_now() + seconds(20);\n\twhile (a.get() == 0 || dynamic_cast<torrent_deleted_alert*>(a.get()) == 0)\n\t{\n\t\tif (ses1.wait_for_alert(end - time_now()) == 0)\n\t\t{\n\t\t\tstd::cerr << \"wait_for_alert() expired\" << std::endl;\n\t\t\tbreak;\n\t\t}\n\t\ta = ses1.pop_alert();\n\t\tassert(a.get());\n\t\tstd::cerr << a->message() << std::endl;\n\t}\n\n\tTEST_CHECK(dynamic_cast<torrent_deleted_alert*>(a.get()) != 0);\n\n\t\/\/ there shouldn't be any alerts generated from now on\n\t\/\/ make sure that the timer in wait_for_alert() works\n\t\/\/ this should time out (ret == 0) and it should take\n\t\/\/ about 2 seconds\n\tptime start = time_now_hires();\n\talert const* ret;\n\twhile ((ret = ses1.wait_for_alert(seconds(2))))\n\t{\n\t\ta = ses1.pop_alert();\n\t\tstd::cerr << ret->message() << std::endl;\n\t\tstart = time_now();\n\t}\n\tTEST_CHECK(time_now_hires() - start < seconds(3));\n\tTEST_CHECK(time_now_hires() - start >= seconds(2));\n\n\tTEST_CHECK(!exists(\".\/tmp1_swarm\/temporary\"));\n\tTEST_CHECK(!exists(\".\/tmp2_swarm\/temporary\"));\n\tTEST_CHECK(!exists(\".\/tmp3_swarm\/temporary\"));\n\n\tremove_all(\".\/tmp1_swarm\", ec);\n\tremove_all(\".\/tmp2_swarm\", ec);\n\tremove_all(\".\/tmp3_swarm\", ec);\n}\n\nint test_main()\n{\n\tusing namespace libtorrent;\n\n\t\/\/ with time critical pieces\n\ttest_swarm(false, false, false, true);\n\n\t\/\/ with seed mode\n\ttest_swarm(false, false, true);\n\n\ttest_swarm();\n\n\t\/\/ with super seeding\n\ttest_swarm(true);\n\t\n\t\/\/ with strict super seeding\n\ttest_swarm(true, true);\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef DOWNURL_CPP\r\n#define DOWNURL_CPP\r\n#include \"header.h\"\r\n#include \"class_struct.h\"\r\n#include \"FUNCTIONS.h\"\r\n\r\n\r\nHTML_DOWN::HTML_DOWN(){}\r\n\t\t\r\nHTML_DOWN:: ~HTML_DOWN(){}\r\n\r\nstring HTML_DOWN::download(string url)\r\n{\r\n    curl = curl_easy_init();\r\n\tstd::stringstream out;\r\n\tcurl_easy_setopt(curl, CURLOPT_URL, url.c_str());\r\n\tcurl_easy_setopt(curl, CURLOPT_TIMEOUT, 10L);\r\n\tcurl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);\r\n\tcurl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);\r\n\tcurl_easy_setopt(curl, CURLOPT_ACCEPT_ENCODING, \"deflate\");\r\n\tcurl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);\r\n\tcurl_easy_setopt(curl, CURLOPT_WRITEDATA, &out);\r\n\tCURLcode res = curl_easy_perform(curl);\r\n\tif (res != CURLE_OK)\r\n\t{\r\n\t   cout<<stderr<<\"UNABLE TO ACCESS \"<<url<<\" \"<<curl_easy_strerror(res)<<\"\\n\";\r\n\t}\r\n\tcurl_easy_cleanup(curl);\r\n\treturn out.str();\r\n}\r\n\t\r\nvoid HTML_DOWN::save_down(string url,string file)\r\n{\r\n\tcout<<file<<\"     ____FILE____\\n\";\r\n\tFILE* fp = fopen(file.c_str(), \"wb\");\r\n\tif (!fp)\r\n\t{\r\n\t    printf(\"!!! Failed to create file \\n\");\r\n\t\texit(-1);\r\n\t}\r\n\tcout<<\"WRITING DATA TO FILE\\n\";\r\n\tcurl = curl_easy_init();\r\n\tcurl_easy_setopt(curl, CURLOPT_URL, url.c_str());\r\n\tcurl_easy_setopt(curl, CURLOPT_TIMEOUT, 10L);\r\n\tcurl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);\r\n\tcurl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);\r\n\tcurl_easy_setopt(curl, CURLOPT_ACCEPT_ENCODING, \"deflate\");\r\n\tcurl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data_file);\r\n\tcurl_easy_setopt(curl, CURLOPT_WRITEDATA, fp);\r\n\tCURLcode res = curl_easy_perform(curl);\r\n\tif (res != CURLE_OK)\r\n\t{\r\n\t    cout<<stderr<<\"UNABLE TO ACCESS \"<<url<<\" \"<<curl_easy_strerror(res)<<\"\\n\";\r\n\t}\r\n\tcurl_easy_cleanup(curl);\r\n\tfclose(fp);\r\n}\r\n\t\r\nhp HTML_DOWN::path_to_save(string url)\r\n{\r\n\thp temp;\r\n\tsize_t found = url.find(\"\/\/\");\r\n\tsize_t found2 = url.find_last_of(\"\/\");\t\r\n\tif(found2!=std::string::npos){\r\n\tif(found!=std::string::npos) temp.host =  url.substr(found+2,found2);\r\n\ttemp.host =  url.substr(0,found2);\r\n\ttemp.path =  url.substr(found2+1);\r\n\t\/\/else temp.path = \"NOT_FOUND_PATH_NOFILE\";\r\n\tfound = temp.path.find_last_of(\".\");\r\n\tif(found ==std::string::npos){\r\n\t\ttemp.host.append(\"\/\").append(temp.path);\r\n\t\t temp.path = (\"\/_index.html\");\r\n\t}\r\n\t}\r\n\telse{\r\n\t\ttemp.host =  url;\r\n\t\ttemp.path = \"NO_PATH.html\";\r\n\t} \r\n\treturn temp;\r\n}\r\n\r\nvoid HTML_DOWN::save(string url)\r\n{\r\n\tofstream myfile;\r\n\tstring tp = \"mkdir -p \";\r\n\thp t = path_to_save(url);\r\n\tif(t.path.size() >2)\r\n\t{\r\n\t\ttp.append(t.host);\r\n\t\tsystem(tp.c_str());\r\n\t\tsave_down(url,t.host.append(\"\/\").append(t.path));\r\n\t}\r\n}\r\n\t\r\nvoid HTML_DOWN::rm_getvar(string *s)\r\n{\r\n\tsize_t found1 = s->find(\"href=\\\"\");\r\n\tif(found1!=std::string::npos)\r\n\t\ts->assign(s->substr(found1+6));\r\n\tint n = s->size();\r\n\tstring st=\"\";\r\n\tfor(int i=0;i<n;i++){\r\n\t\tif(s->at(i) !=' ' && s->at(i) !='\\n' && s->at(i) != '\\t'){\r\n\t\t\tif(s->at(i) =='?')break;\r\n\t\t\tif(s->at(i) =='\"')break;\r\n\t\t\tif(s->at(i) =='#')break;\r\n\t\t\tst.push_back(s->at(i));\r\n\t\t}\r\n\t}\r\n\tif(st.size() ==0)st=\"\/\";\r\n\ts->assign(st);\r\n}\r\n\r\nvoid HTML_DOWN::is_dir(string *s)\r\n{\r\n\t\t\r\n}\r\nvoid HTML_DOWN::url_res(string *s)\r\n{\r\n\tsize_t found = s->find(\"\/\/\");\r\n\tif(found!=std::string::npos)\r\n\t{\r\n\t\ts->assign(s->substr(found+2));\r\n\t}\r\n}\r\n\t\t\r\nhp HTML_DOWN::host_path(string *s, string curr_url)\r\n{\r\n\thp temp;\r\n\ttemp.host=\"\";\r\n\ttemp.host=\"\";\r\n\tsize_t path =std::string::npos;\r\n\tsize_t found = s->find(\"\/\/\");\r\n\tif(found!=std::string::npos)\r\n\t{\r\n\t\ts->assign(s->substr(found+2));\r\n\t\tint n = s->size();\r\n\t\tfor(int i=0;i<n;++i)\r\n\t\t{\r\n\t\t\tif(s->at(i) =='\/'){ path =i;break;}\r\n\t\t\ttemp.host.push_back(s->at(i));\r\n\t\t}\r\n\t\tif(path !=std::string::npos)\r\n\t\t\ttemp.path = s->substr(path);\r\n\t\telse  temp.path =\"\/\";\r\n\t\treturn temp;\r\n\t}\r\n\telse\r\n\t{\r\n\t\turl_res(&curr_url);\r\n\t\tint n = curr_url.size();\r\n\t\tsize_t t2 =std::string::npos;\r\n\t\tfor(int i=0;i<n;++i)\r\n\t\t{\r\n\t\t\tif(curr_url.at(i) =='\/'){ path =i;break;}\r\n\t\t\ttemp.host.push_back(curr_url.at(i));\r\n\t\t}\r\n\t\tif(path!=std::string::npos)\r\n\t\t{\r\n\t\t\tfor(int i=n-1;i >=0;i--)\r\n\t\t\t{\r\n\t\t\t\tif(curr_url.at(i) =='\/'){t2 =i;break;}\r\n\t\t\t}\r\n\t\t\tif(t2!=std::string::npos)\r\n\t\t\t{\r\n\t\t\t\tfor(int i=path;i<=t2;++i)\r\n\t\t\t\t{\r\n\t\t\t\t\ttemp.path.push_back(curr_url.at(i));\r\n\t\t\t\t}\r\n\t\t\t\tif(s->at(0) == '\/')\r\n\t\t\t\t{\r\n\t\t\t\t\tif(s->size()>1)\r\n\t\t\t\t\t\ttemp.path.assign(s->substr(0));\r\n\t\t\t\t}\r\n\t\t\t\telse temp.path.append(s->substr(0));\r\n\t\t\t\treturn temp;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tif(s->at(0) == '\/')\r\n\t\t\ttemp.path.append((*s));\r\n\t\t\telse temp.path.append(\"\/\").append((*s));\r\n\t\t\treturn temp;\r\n\t\t}\r\n\t}\r\n\treturn temp;\r\n}\r\nvector<hp> HTML_DOWN::get_links(string s,string url)\r\n{\r\n\tvector<hp> temp;\r\n\tstd::regex word_regex(\"\\\\s*?href\\\\s*=\\\\s*\\\"[^\\\"]*\\\"\");\r\n\tauto words_begin =\tstd::sregex_iterator(s.begin(), s.end(), word_regex);\r\n\tauto words_end = std::sregex_iterator();\r\n\tfor (std::sregex_iterator i = words_begin; i != words_end; ++i)\r\n\t{\r\n\t\tstd::smatch match = *i;\r\n\t\tstd::string match_str = match.str();\r\n\t\tif(match_str.size()>1)\r\n\t\t{\r\n\t\t\trm_getvar(&match_str);\r\n\t\t\thp test = host_path(&match_str,url);\r\n\t\t\ttemp.push_back(test);\r\n\t\t}\r\n\t}\r\n\ts.clear();\r\n    return temp;\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\r\nURLS::URLS(){;}\r\nURLS::~URLS(){;};\r\nvoid URLS::add_path(string path,domain_ext *itt )\r\n{\r\n\tstd::map<string,time_t>::iterator its;\r\n\tits = ((itt)->path).find(path);\r\n\tif(its != (itt)->path.end())\r\n\t{\r\n\t\t\/\/found\r\n\t}\r\n\telse{\r\n\t\t\/\/(itt)->PATH_WRITE_MTX.lock();\r\n\t\tits = ((itt)->path).find(path);\r\n\t\tif(its != (itt)->path.end())\r\n\t\t{\r\n\t\t\t\/\/found\r\n\t\t\t\/\/(itt)->PATH_WRITE_MTX.unlock();\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\ttime_t tl = time(0);\r\n\t\t\t(itt)->path.insert(std::pair<string,time_t>(path,tl));\r\n\t\t\t(itt)->lt = time(0);\r\n\t\t\t\/\/(itt)->PATH_WRITE_MTX.unlock();\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid URLS::add_url(string domain,string path,time_t temp_time)\r\n{ \t\/\/to add url if not exists\r\n\tstd::map<string,domain_ext>::iterator it;\r\n\tit = urls.find(domain);\r\n\tif (it != urls.end())\r\n\t{\r\n\t\tadd_path(path,&(it->second));\r\n\t}\r\n\telse\r\n\t{    \/\/if domain not found\r\n\t\tDOMAIN_WRITE_MTX.lock();\r\n\t\tit = urls.find(domain);\r\n\t\tif (it != urls.end())\r\n\t\t{\r\n\t\t\tDOMAIN_WRITE_MTX.unlock();   \/\/domain found recent entry\r\n\t\t\tadd_path(path,&(it->second));\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tmap<string,time_t> t;\r\n\t\t\tt.insert(std::pair<string,time_t>(path,time(0)));\r\n\t\t\tdomain_ext temp ;\r\n\t\t\ttemp.path = t;\r\n\t\t\ttemp.lt = temp_time;\r\n\t\t\turls.insert(std::make_pair(domain,temp));\r\n\t\t\tDOMAIN_WRITE_MTX.unlock();\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid URLS::get_path(domain_ext *ext,string host)\r\n{\r\n\tfor (std::map<string,time_t>::iterator it=ext->path.begin(); it!=ext->path.end(); ++it)\r\n\tstd::cout << \"http:\/\/\"<<host<<it->first << \"   => \" << it->second << '\\n';\r\n}\r\n\r\nvoid URLS::get_domain()\r\n{\r\n\tfor (std::map<string,domain_ext>::iterator it=urls.begin(); it!=urls.end(); ++it)\r\n\t{\r\n\t\t\/\/std::cout << it->first << \" => \";\r\n\t\tget_path(&(it->second),it->first);\r\n\t}\r\n}\r\n\t\r\nCtrler::Ctrler(URLS *url)\r\n{\r\n\turls = url;\r\n}\r\n\r\nCtrler::Ctrler(){};\r\n\r\nvoid Ctrler::toask(string url)\r\n{\r\n\tvector<hp> hp1 = htm.get_links(htm.download(url),url);\r\n\t\t\r\n\tint size = hp1.size();\r\n\tfor(int i=0;i<size;++i)\r\n\t{\r\n\t\turls->add_url(hp1.at(i).host,hp1.at(i).path,0);\r\n\t}\r\n\thp1.clear();\r\n}\r\n\r\nvoid Ctrler::dotask(map<string,domain_ext>::iterator  *itp)\r\n{\r\n\t(*itp)->second.lt =time(0);\r\n\ttime_t max =time(0);\r\n\t\t\r\n\tstd::map<string,time_t>::iterator its= (*itp)->second.path.begin();\r\n\tfor (std::map<string,time_t>::iterator it=(*itp)->second.path.begin(); it!=(*itp)->second.path.end(); ++it)\r\n\t\tif((it)->second < max)its = it;\r\n\t\r\n\tstring temp_url = (*itp)->first;\r\n\ttemp_url.append((its)->first);\r\n\ts =htm.download(temp_url);\r\n\tvector<hp> hp1 = htm.get_links(s,temp_url);\r\n\ts=\"\";\r\n\tint size = hp1.size();\r\n\tfor(int i=0;i<size;++i)\r\n\t{\r\n\t\turls->add_url(hp1.at(i).host,hp1.at(i).path,0);\r\n\t}\r\n\thp1.clear();\r\n\t(*itp)->second.lt =time(0);\r\n}\r\n\r\nstd::map<string,time_t>::iterator* Ctrler::_last(map<string,domain_ext>::iterator  *itp)\r\n{\r\n\tdomain_ext *ext = &(itn)->second;\r\n\ttime_t max =time(0);\r\n\tstd::map<string,time_t>::iterator *its;\r\n\tfor (std::map<string,time_t>::iterator it=(ext)->path.begin(); it!=(ext)->path.end(); ++it)\r\n\t\tif((it)->second < max)its = &it;\r\n\t\treturn its;\r\n}\r\n\t\t\r\nvoid Ctrler::nexttask()\r\n{\r\n\tint t=1;\r\n\tfor(itn =urls->urls.begin() ;(itn) !=urls->urls.end();itn++)\r\n\t{\r\n\t\tif(difftime(time(0),(itn)->second.lt) > 10000)\r\n\t\t{\r\n\t\t\t\/\/cin>>t;\r\n\t\t\tif(t==1)\r\n\t\t\t\tdotask(&itn);\r\n\t\t\telse if(t==5)break;\r\n\t\t}\r\n\t}\r\n}\r\n\t\r\nvoid Ctrler::save_help(map<string,domain_ext>::iterator  *itp)\r\n{\r\n\t(*itp)->second.lt =time(0);\r\n\ttime_t max =time(0);\r\n\tstd::map<string,time_t>::iterator its= (*itp)->second.path.begin();\r\n\tfor (std::map<string,time_t>::iterator it=(*itp)->second.path.begin(); it!=(*itp)->second.path.end(); ++it){\r\n\t\tif((it)->second < max)its = it;\r\n\tstring temp_url = (*itp)->first;\r\n\ttemp_url.append((its)->first);\r\n\thtm.save(temp_url);\r\n\t}\r\n}\r\n\r\nvoid Ctrler::save()\r\n{\r\n\tfor(itn =urls->urls.begin() ;(itn) !=urls->urls.end();itn++)\r\n\t{\r\n\t\t\/\/if(difftime(time(0),(itn)->second.lt) > 10){\r\n\t\t\/\/cin>>t;\r\n\t\tsave_help(&itn);\r\n\r\n\t\t\/\/}\r\n\t}\r\n}\r\n\r\n\r\n\r\n#endif\r\n\r\n<commit_msg>update: pathfix for dir and same file , added _index.html<commit_after>#ifndef DOWNURL_CPP\r\n#define DOWNURL_CPP\r\n#include \"header.h\"\r\n#include \"class_struct.h\"\r\n#include \"FUNCTIONS.h\"\r\n\r\nHTML_DOWN::HTML_DOWN() {}\r\n\r\nHTML_DOWN::~HTML_DOWN() {}\r\n\r\nstring HTML_DOWN::download(string url)\r\n{\r\n\tcurl = curl_easy_init();\r\n\tstd::stringstream out;\r\n\tcurl_easy_setopt(curl, CURLOPT_URL, url.c_str());\r\n\tcurl_easy_setopt(curl, CURLOPT_TIMEOUT, 10L);\r\n\tcurl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);\r\n\tcurl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);\r\n\tcurl_easy_setopt(curl, CURLOPT_ACCEPT_ENCODING, \"deflate\");\r\n\tcurl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);\r\n\tcurl_easy_setopt(curl, CURLOPT_WRITEDATA, &out);\r\n\tCURLcode res = curl_easy_perform(curl);\r\n\tif (res != CURLE_OK)\r\n\t{\r\n\t\tcout << stderr << \"UNABLE TO ACCESS \" << url << \" \" << curl_easy_strerror(res) << \"\\n\";\r\n\t}\r\n\tcurl_easy_cleanup(curl);\r\n\treturn out.str();\r\n}\r\n\r\nvoid HTML_DOWN::save_down(string url, string file)\r\n{\r\n\tcout << file << \"     ____FILE____\\n\";\r\n\tFILE *fp = fopen(file.c_str(), \"wb\");\r\n\tif (!fp)\r\n\t{\r\n\t\tprintf(\"!!! Failed to create file \\n\");\r\n\t\texit(-1);\r\n\t}\r\n\tcout << \"WRITING DATA TO FILE\\n\";\r\n\tcurl = curl_easy_init();\r\n\tcurl_easy_setopt(curl, CURLOPT_URL, url.c_str());\r\n\tcurl_easy_setopt(curl, CURLOPT_TIMEOUT, 10L);\r\n\tcurl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);\r\n\tcurl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);\r\n\tcurl_easy_setopt(curl, CURLOPT_ACCEPT_ENCODING, \"deflate\");\r\n\tcurl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data_file);\r\n\tcurl_easy_setopt(curl, CURLOPT_WRITEDATA, fp);\r\n\tCURLcode res = curl_easy_perform(curl);\r\n\tif (res != CURLE_OK)\r\n\t{\r\n\t\tcout << stderr << \"UNABLE TO ACCESS \" << url << \" \" << curl_easy_strerror(res) << \"\\n\";\r\n\t}\r\n\tcurl_easy_cleanup(curl);\r\n\tfclose(fp);\r\n}\r\n\r\nhp HTML_DOWN::path_to_save(string url)\r\n{\r\n\thp temp;\r\n\tsize_t found = url.find(\"\/\/\");\r\n\tsize_t found2 = url.find_last_of(\"\/\");\r\n\tif (found2 != std::string::npos)\r\n\t{\r\n\t\tif (found != std::string::npos)\r\n\t\t\ttemp.host = url.substr(found + 2, found2);\r\n\t\ttemp.host = url.substr(0, found2);\r\n\t\ttemp.path = url.substr(found2 + 1);\r\n\t\t\/\/else temp.path = \"NOT_FOUND_PATH_NOFILE\";\r\n\t\tfound = temp.path.find_last_of(\".\");\r\n\t\tif (found == std::string::npos)\r\n\t\t{\r\n\t\t\ttemp.host.append(\"\/\").append(temp.path);\r\n\t\t\ttemp.path = (\"\/_index.html\");\r\n\t\t}\r\n\t}\r\n\telse\r\n\t{\r\n\t\ttemp.host = url;\r\n\t\ttemp.path = \"NO_PATH.html\";\r\n\t}\r\n\treturn temp;\r\n}\r\n\r\nvoid HTML_DOWN::save(string url)\r\n{\r\n\tofstream myfile;\r\n\tstring tp = \"mkdir -p \";\r\n\thp t = path_to_save(url);\r\n\tif (t.path.size() > 2)\r\n\t{\r\n\t\ttp.append(t.host);\r\n\t\tsystem(tp.c_str());\r\n\t\tsave_down(url, t.host.append(\"\/\").append(t.path));\r\n\t}\r\n}\r\n\r\nvoid HTML_DOWN::rm_getvar(string *s)\r\n{\r\n\tsize_t found1 = s->find(\"href=\\\"\");\r\n\tif (found1 != std::string::npos)\r\n\t\ts->assign(s->substr(found1 + 6));\r\n\tint n = s->size();\r\n\tstring st = \"\";\r\n\tfor (int i = 0; i < n; i++)\r\n\t{\r\n\t\tif (s->at(i) != ' ' && s->at(i) != '\\n' && s->at(i) != '\\t')\r\n\t\t{\r\n\t\t\tif (s->at(i) == '?')\r\n\t\t\t\tbreak;\r\n\t\t\tif (s->at(i) == '\"')\r\n\t\t\t\tbreak;\r\n\t\t\tif (s->at(i) == '#')\r\n\t\t\t\tbreak;\r\n\t\t\tst.push_back(s->at(i));\r\n\t\t}\r\n\t}\r\n\tif (st.size() == 0)\r\n\t\tst = \"\/\";\r\n\ts->assign(st);\r\n}\r\n\r\nvoid HTML_DOWN::is_dir(string *s)\r\n{\r\n}\r\nvoid HTML_DOWN::url_res(string *s)\r\n{\r\n\tsize_t found = s->find(\"\/\/\");\r\n\tif (found != std::string::npos)\r\n\t{\r\n\t\ts->assign(s->substr(found + 2));\r\n\t}\r\n}\r\n\r\nhp HTML_DOWN::host_path(string *s, string curr_url)\r\n{\r\n\thp temp;\r\n\ttemp.host = \"\";\r\n\ttemp.host = \"\";\r\n\tsize_t path = std::string::npos;\r\n\tsize_t found = s->find(\"\/\/\");\r\n\tif (found != std::string::npos)\r\n\t{\r\n\t\ts->assign(s->substr(found + 2));\r\n\t\tint n = s->size();\r\n\t\tfor (int i = 0; i < n; ++i)\r\n\t\t{\r\n\t\t\tif (s->at(i) == '\/')\r\n\t\t\t{\r\n\t\t\t\tpath = i;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\ttemp.host.push_back(s->at(i));\r\n\t\t}\r\n\t\tif (path != std::string::npos)\r\n\t\t\ttemp.path = s->substr(path);\r\n\t\telse\r\n\t\t\ttemp.path = \"\/\";\r\n\t\treturn temp;\r\n\t}\r\n\telse\r\n\t{\r\n\t\turl_res(&curr_url);\r\n\t\tint n = curr_url.size();\r\n\t\tsize_t t2 = std::string::npos;\r\n\t\tfor (int i = 0; i < n; ++i)\r\n\t\t{\r\n\t\t\tif (curr_url.at(i) == '\/')\r\n\t\t\t{\r\n\t\t\t\tpath = i;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\ttemp.host.push_back(curr_url.at(i));\r\n\t\t}\r\n\t\tif (path != std::string::npos)\r\n\t\t{\r\n\t\t\tfor (int i = n - 1; i >= 0; i--)\r\n\t\t\t{\r\n\t\t\t\tif (curr_url.at(i) == '\/')\r\n\t\t\t\t{\r\n\t\t\t\t\tt2 = i;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (t2 != std::string::npos)\r\n\t\t\t{\r\n\t\t\t\tfor (int i = path; i <= t2; ++i)\r\n\t\t\t\t{\r\n\t\t\t\t\ttemp.path.push_back(curr_url.at(i));\r\n\t\t\t\t}\r\n\t\t\t\tif (s->at(0) == '\/')\r\n\t\t\t\t{\r\n\t\t\t\t\tif (s->size() > 1)\r\n\t\t\t\t\t\ttemp.path.assign(s->substr(0));\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t\ttemp.path.append(s->substr(0));\r\n\t\t\t\treturn temp;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tif (s->at(0) == '\/')\r\n\t\t\t\ttemp.path.append((*s));\r\n\t\t\telse\r\n\t\t\t\ttemp.path.append(\"\/\").append((*s));\r\n\t\t\treturn temp;\r\n\t\t}\r\n\t}\r\n\treturn temp;\r\n}\r\nvector<hp> HTML_DOWN::get_links(string s, string url)\r\n{\r\n\tvector<hp> temp;\r\n\tstd::regex word_regex(\"\\\\s*?href\\\\s*=\\\\s*\\\"[^\\\"]*\\\"\");\r\n\tauto words_begin = std::sregex_iterator(s.begin(), s.end(), word_regex);\r\n\tauto words_end = std::sregex_iterator();\r\n\tfor (std::sregex_iterator i = words_begin; i != words_end; ++i)\r\n\t{\r\n\t\tstd::smatch match = *i;\r\n\t\tstd::string match_str = match.str();\r\n\t\tif (match_str.size() > 1)\r\n\t\t{\r\n\t\t\trm_getvar(&match_str);\r\n\t\t\thp test = host_path(&match_str, url);\r\n\t\t\ttemp.push_back(test);\r\n\t\t}\r\n\t}\r\n\ts.clear();\r\n\treturn temp;\r\n}\r\n\r\nURLS::URLS() { ; }\r\nURLS::~URLS() { ; };\r\nvoid URLS::add_path(string path, domain_ext *itt)\r\n{\r\n\tstd::map<string, time_t>::iterator its;\r\n\tits = ((itt)->path).find(path);\r\n\tif (its != (itt)->path.end())\r\n\t{\r\n\t\t\/\/found\r\n\t}\r\n\telse\r\n\t{\r\n\t\t\/\/(itt)->PATH_WRITE_MTX.lock();\r\n\t\tits = ((itt)->path).find(path);\r\n\t\tif (its != (itt)->path.end())\r\n\t\t{\r\n\t\t\t\/\/found\r\n\t\t\t\/\/(itt)->PATH_WRITE_MTX.unlock();\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\ttime_t tl = time(0);\r\n\t\t\t(itt)->path.insert(std::pair<string, time_t>(path, tl));\r\n\t\t\t(itt)->lt = time(0);\r\n\t\t\t\/\/(itt)->PATH_WRITE_MTX.unlock();\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid URLS::add_url(string domain, string path, time_t temp_time)\r\n{ \/\/to add url if not exists\r\n\tstd::map<string, domain_ext>::iterator it;\r\n\tit = urls.find(domain);\r\n\tif (it != urls.end())\r\n\t{\r\n\t\tadd_path(path, &(it->second));\r\n\t}\r\n\telse\r\n\t{ \/\/if domain not found\r\n\t\tDOMAIN_WRITE_MTX.lock();\r\n\t\tit = urls.find(domain);\r\n\t\tif (it != urls.end())\r\n\t\t{\r\n\t\t\tDOMAIN_WRITE_MTX.unlock(); \/\/domain found recent entry\r\n\t\t\tadd_path(path, &(it->second));\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tmap<string, time_t> t;\r\n\t\t\tt.insert(std::pair<string, time_t>(path, time(0)));\r\n\t\t\tdomain_ext temp;\r\n\t\t\ttemp.path = t;\r\n\t\t\ttemp.lt = temp_time;\r\n\t\t\turls.insert(std::make_pair(domain, temp));\r\n\t\t\tDOMAIN_WRITE_MTX.unlock();\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid URLS::get_path(domain_ext *ext, string host)\r\n{\r\n\tfor (std::map<string, time_t>::iterator it = ext->path.begin(); it != ext->path.end(); ++it)\r\n\t\tstd::cout << \"http:\/\/\" << host << it->first << \"   => \" << it->second << '\\n';\r\n}\r\n\r\nvoid URLS::get_domain()\r\n{\r\n\tfor (std::map<string, domain_ext>::iterator it = urls.begin(); it != urls.end(); ++it)\r\n\t{\r\n\t\t\/\/std::cout << it->first << \" => \";\r\n\t\tget_path(&(it->second), it->first);\r\n\t}\r\n}\r\n\r\nCtrler::Ctrler(URLS *url)\r\n{\r\n\turls = url;\r\n}\r\n\r\nCtrler::Ctrler(){};\r\n\r\nvoid Ctrler::toask(string url)\r\n{\r\n\tvector<hp> hp1 = htm.get_links(htm.download(url), url);\r\n\r\n\tint size = hp1.size();\r\n\tfor (int i = 0; i < size; ++i)\r\n\t{\r\n\t\turls->add_url(hp1.at(i).host, hp1.at(i).path, 0);\r\n\t}\r\n\thp1.clear();\r\n}\r\n\r\nvoid Ctrler::dotask(map<string, domain_ext>::iterator *itp)\r\n{\r\n\t(*itp)->second.lt = time(0);\r\n\ttime_t max = time(0);\r\n\r\n\tstd::map<string, time_t>::iterator its = (*itp)->second.path.begin();\r\n\tfor (std::map<string, time_t>::iterator it = (*itp)->second.path.begin(); it != (*itp)->second.path.end(); ++it)\r\n\t\tif ((it)->second < max)\r\n\t\t\tits = it;\r\n\r\n\tstring temp_url = (*itp)->first;\r\n\ttemp_url.append((its)->first);\r\n\ts = htm.download(temp_url);\r\n\tvector<hp> hp1 = htm.get_links(s, temp_url);\r\n\ts = \"\";\r\n\tint size = hp1.size();\r\n\tfor (int i = 0; i < size; ++i)\r\n\t{\r\n\t\turls->add_url(hp1.at(i).host, hp1.at(i).path, 0);\r\n\t}\r\n\thp1.clear();\r\n\t(*itp)->second.lt = time(0);\r\n}\r\n\r\nstd::map<string, time_t>::iterator *Ctrler::_last(map<string, domain_ext>::iterator *itp)\r\n{\r\n\tdomain_ext *ext = &(itn)->second;\r\n\ttime_t max = time(0);\r\n\tstd::map<string, time_t>::iterator *its;\r\n\tfor (std::map<string, time_t>::iterator it = (ext)->path.begin(); it != (ext)->path.end(); ++it)\r\n\t\tif ((it)->second < max)\r\n\t\t\tits = &it;\r\n\treturn its;\r\n}\r\n\r\nvoid Ctrler::nexttask()\r\n{\r\n\tint t = 1;\r\n\tfor (itn = urls->urls.begin(); (itn) != urls->urls.end(); itn++)\r\n\t{\r\n\t\tif (difftime(time(0), (itn)->second.lt) > 10000)\r\n\t\t{\r\n\t\t\t\/\/cin>>t;\r\n\t\t\tif (t == 1)\r\n\t\t\t\tdotask(&itn);\r\n\t\t\telse if (t == 5)\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid Ctrler::save_help(map<string, domain_ext>::iterator *itp)\r\n{\r\n\t(*itp)->second.lt = time(0);\r\n\ttime_t max = time(0);\r\n\tstd::map<string, time_t>::iterator its = (*itp)->second.path.begin();\r\n\tfor (std::map<string, time_t>::iterator it = (*itp)->second.path.begin(); it != (*itp)->second.path.end(); ++it)\r\n\t{\r\n\t\tif ((it)->second < max)\r\n\t\t\tits = it;\r\n\t\tstring temp_url = (*itp)->first;\r\n\t\ttemp_url.append((its)->first);\r\n\t\thtm.save(temp_url);\r\n\t}\r\n}\r\n\r\nvoid Ctrler::save()\r\n{\r\n\tfor (itn = urls->urls.begin(); (itn) != urls->urls.end(); itn++)\r\n\t{\r\n\t\t\/\/if(difftime(time(0),(itn)->second.lt) > 10){\r\n\t\t\/\/cin>>t;\r\n\t\tsave_help(&itn);\r\n\r\n\t\t\/\/}\r\n\t}\r\n}\r\n\r\n#endif\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ Copyright 2014 Perttu Ahola <celeron55@gmail.com>\n#include \"lua_bindings\/util.h\"\n#include \"core\/log.h\"\n#include <cereal\/archives\/portable_binary.hpp>\n#include <cereal\/types\/string.hpp>\n#define MODULE \"lua_bindings\"\n\nnamespace lua_bindings {\n\n\/* Type format:\n{\"object\",\n    {\"peer\", \"int32_t\"},\n    {\"players\", {\"unordered_map\",\n        \"int32_t\",\n        {\"object\",\n            {\"peer\", \"int32_t\"},\n            {\"x\", \"int32_t\"},\n            {\"y\", \"int32_t\"},\n        },\n    }},\n    {\"playfield\", {\"object\",\n        {\"w\", \"int32_t\"},\n        {\"h\", \"int32_t\"},\n        {\"tiles\", {\"array\", \"int32_t\"}},\n    }},\n}) *\/\n\nstatic constexpr auto known_types =\n\t\t\"byte, int32_t, double, array, unordered_map, object\";\n\n\/\/ Places result value on top of stack\nstatic void binary_input_read_value(lua_State *L, int type_L,\n\t\tcereal::PortableBinaryInputArchive &ar)\n{\n\tif(type_L < 0) type_L = lua_gettop(L) + type_L + 1;\n\n\t\/\/ Read value definition\n\tbool has_table = false;\n\tss_ outfield_type;\n\tif(lua_istable(L, type_L)){\n\t\thas_table = true;\n\t\tlua_rawgeti(L, type_L, 1);\n\t\toutfield_type = lua_tocppstring(L, -1);\n\t\tlua_pop(L, 1);\n\t} else if(lua_isstring(L, type_L)){\n\t\toutfield_type = lua_tocppstring(L, type_L);\n\t} else {\n\t\tthrow Exception(\"Value definition table or string expected\");\n\t}\n\n\tlog_t(MODULE, \"binary_input_read_value(): type=%s\", cs(outfield_type));\n\n\tif(outfield_type == \"byte\"){\n\t\tuchar value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"byte value=%i\", (int)value);\n\t\tlua_pushinteger(L, value);\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"int32_t\"){\n\t\tint32_t value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"int32_t value=%i\", value);\n\t\tlua_pushinteger(L, value);\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"double\"){\n\t\tdouble value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"double value=%f\", value);\n\t\tlua_pushnumber(L, value);\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"string\"){\n\t\tss_ value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"string value=%s\", cs(value));\n\t\tlua_pushlstring(L, value.c_str(), value.size());\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"array\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"array requires parameter table\");\n\t\tlua_newtable(L);\n\t\tint value_result_table_L = lua_gettop(L);\n\t\tlua_rawgeti(L, type_L, 2);\n\t\tint array_type_L = lua_gettop(L);\n\t\t\/\/ Loop through array items\n\t\tuint64_t num_entries;\n\t\tar(num_entries);\n\t\tfor(uint64_t i = 0; i < num_entries; i++){\n\t\t\tlog_t(MODULE, \"array[%s]\", cs(i));\n\t\t\tbinary_input_read_value(L, array_type_L, ar);\n\t\t\tlua_rawseti(L, value_result_table_L, i + 1);\n\t\t}\n\t\tlua_pop(L, 1); \/\/ array_type_L\n\t\t\/\/ value_result_table_L is left on stack\n\t} else if(outfield_type == \"unordered_map\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"unordered_map requires parameter table\");\n\t\tlua_newtable(L);\n\t\tint value_result_table_L = lua_gettop(L);\n\t\tlua_rawgeti(L, type_L, 2);\n\t\tint map_key_type_L = lua_gettop(L);\n\t\tlua_rawgeti(L, type_L, 3);\n\t\tint map_value_type_L = lua_gettop(L);\n\t\t\/\/ Loop through map entries\n\t\tuint64_t num_entries;\n\t\tar(num_entries);\n\t\tfor(uint64_t i = 0; i < num_entries; i++){\n\t\t\tlog_t(MODULE, \"unordered_map[%s]\", cs(i));\n\t\t\tbinary_input_read_value(L, map_key_type_L, ar);\n\t\t\tbinary_input_read_value(L, map_value_type_L, ar);\n\t\t\tlua_rawset(L, value_result_table_L);\n\t\t}\n\t\tlua_pop(L, 1); \/\/ map_value_type_L\n\t\tlua_pop(L, 1); \/\/ map_key_type_L\n\t\t\/\/ value_result_table_L is left on stack\n\t} else if(outfield_type == \"object\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"object requires parameter table\");\n\t\tlua_newtable(L);\n\t\tint value_result_table_L = lua_gettop(L);\n\t\t\/\/ Loop through object fields\n\t\tsize_t field_i = 0;\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, type_L) != 0){\n\t\t\tif(field_i != 0){\n\t\t\t\tlog_t(MODULE, \"object field %zu\", field_i);\n\t\t\t\tint field_def_L = lua_gettop(L);\n\t\t\t\tlua_rawgeti(L, field_def_L, 1); \/\/ name\n\t\t\t\tlua_rawgeti(L, field_def_L, 2); \/\/ type\n\t\t\t\tlog_t(MODULE, \" = object[\\\"%s\\\"]\", lua_tostring(L, -2));\n\t\t\t\tbinary_input_read_value(L, -1, ar); \/\/ Uses type, pushes value\n\t\t\t\tlua_remove(L, -2); \/\/ Remove type\n\t\t\t\tlua_rawset(L, value_result_table_L); \/\/ Set t[#-2] = #-1\n\t\t\t}\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\tfield_i++;\n\t\t}\n\t\t\/\/ value_result_table_L is left on stack\n\t} else {\n\t\tthrow Exception(ss_()+\"Unknown type \\\"\"+outfield_type+\"\\\"\"\n\t\t\t\t\t  \"; known types are \"+known_types);\n\t}\n}\n\nstatic void binary_output_write_value(lua_State *L, int value_L, int type_L,\n\t\tcereal::PortableBinaryOutputArchive &ar)\n{\n\tif(value_L < 0) value_L = lua_gettop(L) + value_L + 1;\n\tif(type_L < 0) type_L = lua_gettop(L) + type_L + 1;\n\n\t\/\/ Read value definition\n\tbool has_table = false;\n\tss_ outfield_type;\n\tif(lua_istable(L, type_L)){\n\t\thas_table = true;\n\t\tlua_rawgeti(L, type_L, 1);\n\t\toutfield_type = lua_tocppstring(L, -1);\n\t\tlua_pop(L, 1);\n\t} else if(lua_isstring(L, type_L)){\n\t\toutfield_type = lua_tocppstring(L, type_L);\n\t} else {\n\t\tthrow Exception(\"Value definition table or string expected\");\n\t}\n\n\tlog_t(MODULE, \"binary_output_write_value(): type=%s\", cs(outfield_type));\n\n\tif(outfield_type == \"byte\"){\n\t\tuchar value = lua_tointeger(L, value_L);\n\t\tlog_t(MODULE, \"byte value=%i\", (int)value);\n\t\tar(value);\n\t} else if(outfield_type == \"int32_t\"){\n\t\tint32_t value = lua_tointeger(L, value_L);\n\t\tlog_t(MODULE, \"int32_t value=%i\", value);\n\t\tar(value);\n\t} else if(outfield_type == \"double\"){\n\t\tdouble value = lua_tonumber(L, value_L);\n\t\tlog_t(MODULE, \"double value=%f\", value);\n\t\tar(value);\n\t} else if(outfield_type == \"string\"){\n\t\tss_ value = lua_tocppstring(L, value_L);\n\t\tlog_t(MODULE, \"string value=%s\", cs(value));\n\t\tar(value);\n\t} else if(outfield_type == \"array\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"array requires parameter table\");\n\t\tlua_rawgeti(L, type_L, 2);\n\t\tint array_type_L = lua_gettop(L);\n\t\t\/\/ Loop through array items\n\t\tuint64_t num_entries = 0;\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, value_L) != 0){\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\tnum_entries++;\n\t\t}\n\t\tar(num_entries);\n\t\tlua_pushnil(L);\n\t\tint i = 1;\n\t\twhile(lua_next(L, value_L) != 0){\n\t\t\tlog_t(MODULE, \"array[%i]\", i);\n\t\t\tbinary_output_write_value(L, -1, array_type_L, ar);\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\ti++;\n\t\t}\n\t\tlua_pop(L, 1); \/\/ array_type_L\n\t\t\/\/ value_result_table_L is left on stack\n\t} else if(outfield_type == \"unordered_map\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"unordered_map requires parameter table\");\n\t\tlua_rawgeti(L, type_L, 2);\n\t\tint map_key_type_L = lua_gettop(L);\n\t\tlua_rawgeti(L, type_L, 3);\n\t\tint map_value_type_L = lua_gettop(L);\n\t\t\/\/ Loop through map entries\n\t\tuint64_t num_entries = 0;\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, value_L) != 0){\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\tnum_entries++;\n\t\t}\n\t\tar(num_entries);\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, value_L) != 0){\n\t\t\tint key_L = lua_gettop(L) - 1;\n\t\t\tint value_L = lua_gettop(L);\n\t\t\tlog_t(MODULE, \"unordered_map[%s]\", lua_tostring(L, key_L));\n\t\t\tbinary_output_write_value(L, key_L, map_key_type_L, ar);\n\t\t\tbinary_output_write_value(L, value_L, map_value_type_L, ar);\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t}\n\t\tlua_pop(L, 1); \/\/ map_value_type_L\n\t\tlua_pop(L, 1); \/\/ map_key_type_L\n\t\t\/\/ value_result_table_L is left on stack\n\t} else if(outfield_type == \"object\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"object requires parameter table\");\n\t\t\/\/ Loop through object fields\n\t\tsize_t field_i = 0;\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, type_L) != 0){\n\t\t\tif(field_i != 0){\n\t\t\t\tlog_t(MODULE, \"object field %zu\", field_i);\n\t\t\t\tint field_def_L = lua_gettop(L);\n\t\t\t\tlua_rawgeti(L, field_def_L, 2); \/\/ type\n\t\t\t\tlua_rawgeti(L, field_def_L, 1); \/\/ name\n\t\t\t\tlog_t(MODULE, \" = object[\\\"%s\\\"]\", lua_tostring(L, -1));\n\t\t\t\t\/\/ Get value_L[name]; name is replaced by value\n\t\t\t\tlua_rawget(L, value_L);\n\t\t\t\t\/\/ Recurse into this value\n\t\t\t\tbinary_output_write_value(L, -1, -2, ar);\n\t\t\t\tlua_pop(L, 1); \/\/ Pop value\n\t\t\t\tlua_pop(L, 1); \/\/ Pop type\n\t\t\t}\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\tfield_i++;\n\t\t}\n\t} else {\n\t\tthrow Exception(ss_()+\"Unknown type \\\"\"+outfield_type+\"\\\"\"\n\t\t\t\t\t  \"; known types are \"+known_types);\n\t}\n}\n\n\/\/ cereal_binary_input(data: string, types: table) -> table of values\nstatic int l_cereal_binary_input(lua_State *L)\n{\n\tsize_t data_len = 0;\n\tconst char *data_c = lua_tolstring(L, 1, &data_len);\n\tss_ data(data_c, data_len);\n\n\tint type_L = 2;\n\n\tstd::istringstream is(data, std::ios::binary);\n\tcereal::PortableBinaryInputArchive ar(is);\n\n\tbinary_input_read_value(L, type_L, ar);\n\n\treturn 1;\n}\n\n\/\/ cereal_binary_output(values: table, types: table) -> data\nstatic int l_cereal_binary_output(lua_State *L)\n{\n\tint value_L = 1;\n\n\tint type_L = 2;\n\n\tstd::ostringstream os(std::ios::binary);\n\t{\n\t\tcereal::PortableBinaryOutputArchive ar(os);\n\n\t\tbinary_output_write_value(L, value_L, type_L, ar);\n\t}\n\tss_ data = os.str();\n\tlua_pushlstring(L, data.c_str(), data.size());\n\treturn 1;\n}\n\nvoid init_cereal(lua_State *L)\n{\n#define DEF_BUILDAT_FUNC(name){ \\\n\t\tlua_pushcfunction(L, l_##name); \\\n\t\tlua_setglobal(L, \"__buildat_\" #name); \\\n}\n\tDEF_BUILDAT_FUNC(cereal_binary_input)\n\tDEF_BUILDAT_FUNC(cereal_binary_output)\n}\n\n} \/\/ namespace lua_bindingss\n\n\/\/ vim: set noet ts=4 sw=4:\n<commit_msg>lua_bindings\/cereal: support int16_t<commit_after>\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ Copyright 2014 Perttu Ahola <celeron55@gmail.com>\n#include \"lua_bindings\/util.h\"\n#include \"core\/log.h\"\n#include <cereal\/archives\/portable_binary.hpp>\n#include <cereal\/types\/string.hpp>\n#define MODULE \"lua_bindings\"\n\nnamespace lua_bindings {\n\n\/* Type format:\n{\"object\",\n    {\"peer\", \"int32_t\"},\n    {\"players\", {\"unordered_map\",\n        \"int32_t\",\n        {\"object\",\n            {\"peer\", \"int32_t\"},\n            {\"x\", \"int32_t\"},\n            {\"y\", \"int32_t\"},\n        },\n    }},\n    {\"playfield\", {\"object\",\n        {\"w\", \"int32_t\"},\n        {\"h\", \"int32_t\"},\n        {\"tiles\", {\"array\", \"int32_t\"}},\n    }},\n}) *\/\n\nstatic constexpr auto known_types =\n\t\t\"byte, int16_t, int32_t, double, array, unordered_map, object\";\n\n\/\/ Places result value on top of stack\nstatic void binary_input_read_value(lua_State *L, int type_L,\n\t\tcereal::PortableBinaryInputArchive &ar)\n{\n\tif(type_L < 0) type_L = lua_gettop(L) + type_L + 1;\n\n\t\/\/ Read value definition\n\tbool has_table = false;\n\tss_ outfield_type;\n\tif(lua_istable(L, type_L)){\n\t\thas_table = true;\n\t\tlua_rawgeti(L, type_L, 1);\n\t\toutfield_type = lua_tocppstring(L, -1);\n\t\tlua_pop(L, 1);\n\t} else if(lua_isstring(L, type_L)){\n\t\toutfield_type = lua_tocppstring(L, type_L);\n\t} else {\n\t\tthrow Exception(\"Value definition table or string expected\");\n\t}\n\n\tlog_t(MODULE, \"binary_input_read_value(): type=%s\", cs(outfield_type));\n\n\tif(outfield_type == \"byte\"){\n\t\tuchar value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"byte value=%i\", (int)value);\n\t\tlua_pushinteger(L, value);\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"int16_t\"){\n\t\tint16_t value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"int16_t value=%i\", value);\n\t\tlua_pushinteger(L, value);\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"int32_t\"){\n\t\tint32_t value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"int32_t value=%i\", value);\n\t\tlua_pushinteger(L, value);\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"double\"){\n\t\tdouble value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"double value=%f\", value);\n\t\tlua_pushnumber(L, value);\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"string\"){\n\t\tss_ value;\n\t\tar(value);\n\t\tlog_t(MODULE, \"string value=%s\", cs(value));\n\t\tlua_pushlstring(L, value.c_str(), value.size());\n\t\t\/\/ value is left on stack\n\t} else if(outfield_type == \"array\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"array requires parameter table\");\n\t\tlua_newtable(L);\n\t\tint value_result_table_L = lua_gettop(L);\n\t\tlua_rawgeti(L, type_L, 2);\n\t\tint array_type_L = lua_gettop(L);\n\t\t\/\/ Loop through array items\n\t\tuint64_t num_entries;\n\t\tar(num_entries);\n\t\tfor(uint64_t i = 0; i < num_entries; i++){\n\t\t\tlog_t(MODULE, \"array[%s]\", cs(i));\n\t\t\tbinary_input_read_value(L, array_type_L, ar);\n\t\t\tlua_rawseti(L, value_result_table_L, i + 1);\n\t\t}\n\t\tlua_pop(L, 1); \/\/ array_type_L\n\t\t\/\/ value_result_table_L is left on stack\n\t} else if(outfield_type == \"unordered_map\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"unordered_map requires parameter table\");\n\t\tlua_newtable(L);\n\t\tint value_result_table_L = lua_gettop(L);\n\t\tlua_rawgeti(L, type_L, 2);\n\t\tint map_key_type_L = lua_gettop(L);\n\t\tlua_rawgeti(L, type_L, 3);\n\t\tint map_value_type_L = lua_gettop(L);\n\t\t\/\/ Loop through map entries\n\t\tuint64_t num_entries;\n\t\tar(num_entries);\n\t\tfor(uint64_t i = 0; i < num_entries; i++){\n\t\t\tlog_t(MODULE, \"unordered_map[%s]\", cs(i));\n\t\t\tbinary_input_read_value(L, map_key_type_L, ar);\n\t\t\tbinary_input_read_value(L, map_value_type_L, ar);\n\t\t\tlua_rawset(L, value_result_table_L);\n\t\t}\n\t\tlua_pop(L, 1); \/\/ map_value_type_L\n\t\tlua_pop(L, 1); \/\/ map_key_type_L\n\t\t\/\/ value_result_table_L is left on stack\n\t} else if(outfield_type == \"object\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"object requires parameter table\");\n\t\tlua_newtable(L);\n\t\tint value_result_table_L = lua_gettop(L);\n\t\t\/\/ Loop through object fields\n\t\tsize_t field_i = 0;\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, type_L) != 0){\n\t\t\tif(field_i != 0){\n\t\t\t\tlog_t(MODULE, \"object field %zu\", field_i);\n\t\t\t\tint field_def_L = lua_gettop(L);\n\t\t\t\tlua_rawgeti(L, field_def_L, 1); \/\/ name\n\t\t\t\tlua_rawgeti(L, field_def_L, 2); \/\/ type\n\t\t\t\tlog_t(MODULE, \" = object[\\\"%s\\\"]\", lua_tostring(L, -2));\n\t\t\t\tbinary_input_read_value(L, -1, ar); \/\/ Uses type, pushes value\n\t\t\t\tlua_remove(L, -2); \/\/ Remove type\n\t\t\t\tlua_rawset(L, value_result_table_L); \/\/ Set t[#-2] = #-1\n\t\t\t}\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\tfield_i++;\n\t\t}\n\t\t\/\/ value_result_table_L is left on stack\n\t} else {\n\t\tthrow Exception(ss_()+\"Unknown type \\\"\"+outfield_type+\"\\\"\"\n\t\t\t\t\t  \"; known types are \"+known_types);\n\t}\n}\n\nstatic void binary_output_write_value(lua_State *L, int value_L, int type_L,\n\t\tcereal::PortableBinaryOutputArchive &ar)\n{\n\tif(value_L < 0) value_L = lua_gettop(L) + value_L + 1;\n\tif(type_L < 0) type_L = lua_gettop(L) + type_L + 1;\n\n\t\/\/ Read value definition\n\tbool has_table = false;\n\tss_ outfield_type;\n\tif(lua_istable(L, type_L)){\n\t\thas_table = true;\n\t\tlua_rawgeti(L, type_L, 1);\n\t\toutfield_type = lua_tocppstring(L, -1);\n\t\tlua_pop(L, 1);\n\t} else if(lua_isstring(L, type_L)){\n\t\toutfield_type = lua_tocppstring(L, type_L);\n\t} else {\n\t\tthrow Exception(\"Value definition table or string expected\");\n\t}\n\n\tlog_t(MODULE, \"binary_output_write_value(): type=%s\", cs(outfield_type));\n\n\tif(outfield_type == \"byte\"){\n\t\tuchar value = lua_tointeger(L, value_L);\n\t\tlog_t(MODULE, \"byte value=%i\", (int)value);\n\t\tar(value);\n\t} else if(outfield_type == \"int16_t\"){\n\t\tint16_t value = lua_tointeger(L, value_L);\n\t\tlog_t(MODULE, \"int16_t value=%i\", value);\n\t\tar(value);\n\t} else if(outfield_type == \"int32_t\"){\n\t\tint32_t value = lua_tointeger(L, value_L);\n\t\tlog_t(MODULE, \"int32_t value=%i\", value);\n\t\tar(value);\n\t} else if(outfield_type == \"double\"){\n\t\tdouble value = lua_tonumber(L, value_L);\n\t\tlog_t(MODULE, \"double value=%f\", value);\n\t\tar(value);\n\t} else if(outfield_type == \"string\"){\n\t\tss_ value = lua_tocppstring(L, value_L);\n\t\tlog_t(MODULE, \"string value=%s\", cs(value));\n\t\tar(value);\n\t} else if(outfield_type == \"array\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"array requires parameter table\");\n\t\tlua_rawgeti(L, type_L, 2);\n\t\tint array_type_L = lua_gettop(L);\n\t\t\/\/ Loop through array items\n\t\tuint64_t num_entries = 0;\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, value_L) != 0){\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\tnum_entries++;\n\t\t}\n\t\tar(num_entries);\n\t\tlua_pushnil(L);\n\t\tint i = 1;\n\t\twhile(lua_next(L, value_L) != 0){\n\t\t\tlog_t(MODULE, \"array[%i]\", i);\n\t\t\tbinary_output_write_value(L, -1, array_type_L, ar);\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\ti++;\n\t\t}\n\t\tlua_pop(L, 1); \/\/ array_type_L\n\t\t\/\/ value_result_table_L is left on stack\n\t} else if(outfield_type == \"unordered_map\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"unordered_map requires parameter table\");\n\t\tlua_rawgeti(L, type_L, 2);\n\t\tint map_key_type_L = lua_gettop(L);\n\t\tlua_rawgeti(L, type_L, 3);\n\t\tint map_value_type_L = lua_gettop(L);\n\t\t\/\/ Loop through map entries\n\t\tuint64_t num_entries = 0;\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, value_L) != 0){\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\tnum_entries++;\n\t\t}\n\t\tar(num_entries);\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, value_L) != 0){\n\t\t\tint key_L = lua_gettop(L) - 1;\n\t\t\tint value_L = lua_gettop(L);\n\t\t\tlog_t(MODULE, \"unordered_map[%s]\", lua_tostring(L, key_L));\n\t\t\tbinary_output_write_value(L, key_L, map_key_type_L, ar);\n\t\t\tbinary_output_write_value(L, value_L, map_value_type_L, ar);\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t}\n\t\tlua_pop(L, 1); \/\/ map_value_type_L\n\t\tlua_pop(L, 1); \/\/ map_key_type_L\n\t\t\/\/ value_result_table_L is left on stack\n\t} else if(outfield_type == \"object\"){\n\t\tif(!has_table)\n\t\t\tthrow Exception(\"object requires parameter table\");\n\t\t\/\/ Loop through object fields\n\t\tsize_t field_i = 0;\n\t\tlua_pushnil(L);\n\t\twhile(lua_next(L, type_L) != 0){\n\t\t\tif(field_i != 0){\n\t\t\t\tlog_t(MODULE, \"object field %zu\", field_i);\n\t\t\t\tint field_def_L = lua_gettop(L);\n\t\t\t\tlua_rawgeti(L, field_def_L, 2); \/\/ type\n\t\t\t\tlua_rawgeti(L, field_def_L, 1); \/\/ name\n\t\t\t\tlog_t(MODULE, \" = object[\\\"%s\\\"]\", lua_tostring(L, -1));\n\t\t\t\t\/\/ Get value_L[name]; name is replaced by value\n\t\t\t\tlua_rawget(L, value_L);\n\t\t\t\t\/\/ Recurse into this value\n\t\t\t\tbinary_output_write_value(L, -1, -2, ar);\n\t\t\t\tlua_pop(L, 1); \/\/ Pop value\n\t\t\t\tlua_pop(L, 1); \/\/ Pop type\n\t\t\t}\n\t\t\tlua_pop(L, 1); \/\/ Continue iterating by popping table value\n\t\t\tfield_i++;\n\t\t}\n\t} else {\n\t\tthrow Exception(ss_()+\"Unknown type \\\"\"+outfield_type+\"\\\"\"\n\t\t\t\t\t  \"; known types are \"+known_types);\n\t}\n}\n\n\/\/ cereal_binary_input(data: string, types: table) -> table of values\nstatic int l_cereal_binary_input(lua_State *L)\n{\n\tsize_t data_len = 0;\n\tconst char *data_c = lua_tolstring(L, 1, &data_len);\n\tss_ data(data_c, data_len);\n\n\tint type_L = 2;\n\n\tstd::istringstream is(data, std::ios::binary);\n\tcereal::PortableBinaryInputArchive ar(is);\n\n\tbinary_input_read_value(L, type_L, ar);\n\n\treturn 1;\n}\n\n\/\/ cereal_binary_output(values: table, types: table) -> data\nstatic int l_cereal_binary_output(lua_State *L)\n{\n\tint value_L = 1;\n\n\tint type_L = 2;\n\n\tstd::ostringstream os(std::ios::binary);\n\t{\n\t\tcereal::PortableBinaryOutputArchive ar(os);\n\n\t\tbinary_output_write_value(L, value_L, type_L, ar);\n\t}\n\tss_ data = os.str();\n\tlua_pushlstring(L, data.c_str(), data.size());\n\treturn 1;\n}\n\nvoid init_cereal(lua_State *L)\n{\n#define DEF_BUILDAT_FUNC(name){ \\\n\t\tlua_pushcfunction(L, l_##name); \\\n\t\tlua_setglobal(L, \"__buildat_\" #name); \\\n}\n\tDEF_BUILDAT_FUNC(cereal_binary_input)\n\tDEF_BUILDAT_FUNC(cereal_binary_output)\n}\n\n} \/\/ namespace lua_bindingss\n\n\/\/ vim: set noet ts=4 sw=4:\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#pragma once\n\n#include \"service\/migration_listener.hh\"\n#include \"db\/legacy_schema_tables.hh\"\n#include \"gms\/endpoint_state.hh\"\n#include \"core\/distributed.hh\"\n#include \"gms\/inet_address.hh\"\n#include \"utils\/UUID.hh\"\n\n#include <vector>\n\nnamespace service {\n\nclass migration_manager {\n#if 0\n    private final Logger logger = LoggerFactory.getLogger(MigrationManager.class);\n\n    private final RuntimeMXBean runtimeMXBean = ManagementFactory.getRuntimeMXBean();\n#endif\n\n    std::vector<migration_listener*> _listeners;\n\n    static const std::chrono::milliseconds MIGRATION_DELAY_IN_MS;\npublic:\n    migration_manager();\n\n    \/\/\/ Register a migration listener on current shard.\n    void register_listener(migration_listener* listener);\n\n    \/\/\/ Unregister a migration listener on current shard.\n    void unregister_listener(migration_listener* listener);\n\n    future<> schedule_schema_pull(const gms::inet_address& endpoint, const gms::endpoint_state& state);\n\n    future<> maybe_schedule_schema_pull(service::storage_proxy& proxy, const utils::UUID& their_version, const gms::inet_address& endpoint);\n\n    future<> submit_migration_task(service::storage_proxy& proxy, const gms::inet_address& endpoint);\n\n    static future<> notify_create_keyspace(const lw_shared_ptr<keyspace_metadata>& ksm);\n\n    static future<> notify_create_column_family(schema_ptr cfm);\n\n    static future<> notify_update_keyspace(const lw_shared_ptr<keyspace_metadata>& ksm);\n\n    static future<> notify_update_column_family(schema_ptr cfm);\n\n    static future<> notify_drop_keyspace(const lw_shared_ptr<keyspace_metadata>& ksm);\n\n    static future<> notify_drop_column_family(schema_ptr cfm);\n\n    bool should_pull_schema_from(const gms::inet_address& endpoint);\n\n    future<> announce_new_keyspace(distributed<service::storage_proxy>& proxy, lw_shared_ptr<keyspace_metadata> ksm, bool announce_locally = false);\n\n    future<> announce_new_keyspace(distributed<service::storage_proxy>& proxy, lw_shared_ptr<keyspace_metadata> ksm, api::timestamp_type timestamp, bool announce_locally);\n\n    future<> announce_column_family_update(distributed<service::storage_proxy>& proxy, schema_ptr cfm, bool from_thrift, bool announce_locally = false);\n\n    future<> announce_new_column_family(distributed<service::storage_proxy>& proxy, schema_ptr cfm, bool announce_locally = false);\n\n    future<> announce_keyspace_drop(distributed<service::storage_proxy>& proxy, const sstring& ks_name, bool announce_locally = false);\n\n    future<> announce_column_family_drop(distributed<service::storage_proxy>& proxy, const sstring& ks_name, const sstring& cf_name, bool announce_locally = false);\n\n    \/**\n     * actively announce a new version to active hosts via rpc\n     * @param schema The schema mutation to be applied\n     *\/\n    static future<> announce(distributed<service::storage_proxy>& proxy, mutation schema, bool announce_locally);\n\n    static future<> announce(distributed<service::storage_proxy>& proxy, std::vector<mutation> mutations, bool announce_locally);\n\n    static future<> push_schema_mutation(const gms::inet_address& endpoint, const std::vector<mutation>& schema);\n\n    \/\/ Returns a future on the local application of the schema\n    static future<> announce(distributed<service::storage_proxy>& proxy, std::vector<mutation> schema);\n\n    static future<> passive_announce(utils::UUID version);\n\n    future<> stop();\n};\n\nextern distributed<migration_manager> _the_migration_manager;\n\ninline distributed<migration_manager>& get_migration_manager() {\n    return _the_migration_manager;\n}\n\ninline migration_manager& get_local_migration_manager() {\n    return _the_migration_manager.local();\n}\n\n}\n<commit_msg>service\/migration_manager: Remove ifdef'd code<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#pragma once\n\n#include \"service\/migration_listener.hh\"\n#include \"db\/legacy_schema_tables.hh\"\n#include \"gms\/endpoint_state.hh\"\n#include \"core\/distributed.hh\"\n#include \"gms\/inet_address.hh\"\n#include \"utils\/UUID.hh\"\n\n#include <vector>\n\nnamespace service {\n\nclass migration_manager {\n    std::vector<migration_listener*> _listeners;\n\n    static const std::chrono::milliseconds MIGRATION_DELAY_IN_MS;\npublic:\n    migration_manager();\n\n    \/\/\/ Register a migration listener on current shard.\n    void register_listener(migration_listener* listener);\n\n    \/\/\/ Unregister a migration listener on current shard.\n    void unregister_listener(migration_listener* listener);\n\n    future<> schedule_schema_pull(const gms::inet_address& endpoint, const gms::endpoint_state& state);\n\n    future<> maybe_schedule_schema_pull(service::storage_proxy& proxy, const utils::UUID& their_version, const gms::inet_address& endpoint);\n\n    future<> submit_migration_task(service::storage_proxy& proxy, const gms::inet_address& endpoint);\n\n    static future<> notify_create_keyspace(const lw_shared_ptr<keyspace_metadata>& ksm);\n\n    static future<> notify_create_column_family(schema_ptr cfm);\n\n    static future<> notify_update_keyspace(const lw_shared_ptr<keyspace_metadata>& ksm);\n\n    static future<> notify_update_column_family(schema_ptr cfm);\n\n    static future<> notify_drop_keyspace(const lw_shared_ptr<keyspace_metadata>& ksm);\n\n    static future<> notify_drop_column_family(schema_ptr cfm);\n\n    bool should_pull_schema_from(const gms::inet_address& endpoint);\n\n    future<> announce_new_keyspace(distributed<service::storage_proxy>& proxy, lw_shared_ptr<keyspace_metadata> ksm, bool announce_locally = false);\n\n    future<> announce_new_keyspace(distributed<service::storage_proxy>& proxy, lw_shared_ptr<keyspace_metadata> ksm, api::timestamp_type timestamp, bool announce_locally);\n\n    future<> announce_column_family_update(distributed<service::storage_proxy>& proxy, schema_ptr cfm, bool from_thrift, bool announce_locally = false);\n\n    future<> announce_new_column_family(distributed<service::storage_proxy>& proxy, schema_ptr cfm, bool announce_locally = false);\n\n    future<> announce_keyspace_drop(distributed<service::storage_proxy>& proxy, const sstring& ks_name, bool announce_locally = false);\n\n    future<> announce_column_family_drop(distributed<service::storage_proxy>& proxy, const sstring& ks_name, const sstring& cf_name, bool announce_locally = false);\n\n    \/**\n     * actively announce a new version to active hosts via rpc\n     * @param schema The schema mutation to be applied\n     *\/\n    static future<> announce(distributed<service::storage_proxy>& proxy, mutation schema, bool announce_locally);\n\n    static future<> announce(distributed<service::storage_proxy>& proxy, std::vector<mutation> mutations, bool announce_locally);\n\n    static future<> push_schema_mutation(const gms::inet_address& endpoint, const std::vector<mutation>& schema);\n\n    \/\/ Returns a future on the local application of the schema\n    static future<> announce(distributed<service::storage_proxy>& proxy, std::vector<mutation> schema);\n\n    static future<> passive_announce(utils::UUID version);\n\n    future<> stop();\n};\n\nextern distributed<migration_manager> _the_migration_manager;\n\ninline distributed<migration_manager>& get_migration_manager() {\n    return _the_migration_manager;\n}\n\ninline migration_manager& get_local_migration_manager() {\n    return _the_migration_manager.local();\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    mFSM\n *\/\n\n#include \"FSM.hpp\"\n\n#include <new>\n#include <string>\n#include <functional>\n#include <algorithm>\n#include <type_traits>\n\n#include <iostream>\n\nnamespace mFSM\n{\n\n\nState::State(const std::string& name, bool final) :\n    name_(name), final_(final)\n{}\n\nbool State::accept() const\n{\n    return final_;\n}\n\nconst std::string& State::name() const\n{\n    return name_;\n}\n\nvoid State::setFinal(bool final)\n{\n    final_ = final;\n}\n\n\/\/ ------------------------------------------\n\nRule::Rule(const std::string& rule) :\n    rule_(rule)\n{\n    if (rule.length() == 1) {\n        setsize_ = 1;\n    } else if (rule[0] == '~') {\n        setsize_ = 255;\n    } else if (rule.compare(\"any\") == 0) {\n        setsize_ = 256;\n    } else {\n        setsize_ = 0;\n    }\n}\n\nbool Rule::satisfiedBy(int c) const\n{\n    if (exactMatch()) {\n        return rule_[0] == c;\n    } else if (matchAll()) {\n        return true;\n    } else if (rule_[0] == '~') {\n        return c != rule_[1];\n    }\n    \/\/ here we should raise an exception; but no exception\n    \/\/ are used in this code... that's it. Rather, I would\n    \/\/ set an internal state to \"machine is out of service\"!\n    return false;\n}\n\nbool Rule::exactMatch() const\n{\n    return rule_.length() == 1;\n}\n\nbool Rule::matchMany() const\n{\n    return rule_.length() > 1 &&\n        (rule_.compare(\"any\") == 0 || rule_[0] == '~');\n}\n\nbool Rule::matchAll() const\n{\n    return rule_.length() > 1 && rule_.compare(\"any\") == 0;\n}\n\nsize_t Rule::size() const\n{\n    return setsize_;\n}\n\n\n\n\/\/ ------------------------------------------\n\nAwareState::AwareState(const std::string& name, bool final) :\n    State(name, final)\n{}\n\nAwareState& AwareState::onRule(const Rule* rule, const AwareState* dest)\n{\n    Connection con{rule, dest->name()};\n    connections_.push_front(con);\n    connections_.sort([](const Connection& a, const Connection& b)->bool {\n            return a.rule->size() < b.rule->size();\n        });\n    return *this;\n}\n\nbool AwareState::overConnectionsDo(\n    std::function<bool(const Rule*,\n                       const std::string& stateName)> action) const\n{\n    return std::any_of(connections_.begin(),\n                       connections_.end(),\n                       [&](decltype(connections_.front()) c) {\n                           return action(c.rule, c.destState);\n                       });\n    \/\/ the previous piece should work like the following\n    \/* \n    for (auto& c : connections_) {\n        if (action(c.rule, c.destState)) {\n            return true;\n        }\n    }\n    return false;\n    *\/\n}\n\n\/\/ ------------------------------------------\n\nFSM::FSM(bool debug) : current_(nullptr),\n                       first_(nullptr),\n                       strict_(false),\n                       debug_(debug)\n{}\n\n\nFSM::~FSM()\n{\n    for (auto& p : rules_) {\n        delete p.second;\n    }\n    for (auto& p : states_) {\n        delete p.second;\n    }\n}\n\nbool FSM::accepted() const\n{\n    if (debug_ && current_) {\n        std::cerr << \"state: \" << current_->name() << \"\\n\";\n    }\n    return current_ ? current_->accept() : false;\n}\n\nvoid FSM::rewind()\n{\n    current_ = first_;\n}\n\nvoid FSM::first(const std::string& s)\n{\n    if (states_.count(s) > 0) {\n        first_ = states_[s];\n    }\n}\n\nvoid FSM::strict(bool b)\n{\n    strict_ = b;\n}\n\n\nAwareState& FSM::state(const std::string& n, bool final)\n{\n    if (states_.count(n) > 0) {\n        \/\/ the name's already taken;\n        \/\/ return whatever it was created, ignore final arg.\n        return *states_[n];\n    }\n    AwareState* new_state = new AwareState(n, final); \/\/ no nothrow...\n    states_[n] = new_state;\n    if (!first_) {\n        first_ = new_state;\n    }\n    return *new_state;\n}\n\n\nAwareState& FSM::get(const std::string& n)\n{\n    if (states_.count(n) > 0) {\n        return *states_[n];\n    }\n    return state(n, false);\n}\n\n\nbool FSM::connect(const std::string& s1,\n                  const std::string& s2,\n                  const std::string& rule)\n{\n    AwareState* state1 = nullptr;\n    AwareState* state2 = nullptr;\n    Rule* orule = nullptr;\n\n    if (states_.count(s1) > 0) {\n        state1 = states_[s1];\n    } else {\n        state1 = &state(s1, false);\n        if (!state1) {\n            return false;\n        }\n        states_[s1] = state1;\n    }\n\n    if (states_.count(s2) > 0) {\n        state2 = states_[s2];\n    } else {\n        state2 = &state(s2, false);\n        if (!state2) {\n            return false;\n        }\n        states_[s2] = state2;\n    }\n\n    if (rules_.count(rule) > 0) {\n        orule = rules_[rule];\n    } else {\n        orule = new (std::nothrow) Rule(rule);\n        if (!orule) {\n            return false;\n        }\n        rules_[rule] = orule;\n    }\n\n    state1->onRule(orule, state2);\n    return true;\n}\n\nbool FSM::feed(int c)\n{\n    if (!first_) {\n        return false;\n    }\n    if (!current_) {\n        current_ = first_;\n    }\n\n    const AwareState* next_current = current_;\n    bool matched = current_->overConnectionsDo(\n        [c,&next_current,this](const Rule* r, const std::string& s)->bool {\n            if (r->satisfiedBy(c)) {\n                if (this->states_.count(s) > 0) {\n                    next_current = states_[s];\n                }\n                return true;\n            }\n            return false;\n        });\n\n    if (debug_) {\n        std::cerr << current_->name() << \"(\" << c << \")\"\n                  << next_current->name() << \"\\n\";\n    }\n\n    current_ = next_current;\n\n    return matched;\n}\n\n\nbool FSM::run(const std::string& s)\n{\n    bool matched;\n    rewind();\n    for (auto& c : s) {\n        matched = feed(c);\n        if (strict_ && !matched) {\n            break;\n        }\n    }\n    return current_->accept() && (!strict_ || matched);\n}\n\n\n\n} \/\/ ns: mFSM\n<commit_msg>let's make a line a little bit shorter<commit_after>\/*\n    mFSM\n *\/\n\n#include \"FSM.hpp\"\n\n#include <new>\n#include <string>\n#include <functional>\n#include <algorithm>\n#include <type_traits>\n\n#include <iostream>\n\nnamespace mFSM\n{\n\n\nState::State(const std::string& name, bool final) :\n    name_(name), final_(final)\n{}\n\nbool State::accept() const\n{\n    return final_;\n}\n\nconst std::string& State::name() const\n{\n    return name_;\n}\n\nvoid State::setFinal(bool final)\n{\n    final_ = final;\n}\n\n\/\/ ------------------------------------------\n\nRule::Rule(const std::string& rule) :\n    rule_(rule)\n{\n    if (rule.length() == 1) {\n        setsize_ = 1;\n    } else if (rule[0] == '~') {\n        setsize_ = 255;\n    } else if (rule.compare(\"any\") == 0) {\n        setsize_ = 256;\n    } else {\n        setsize_ = 0;\n    }\n}\n\nbool Rule::satisfiedBy(int c) const\n{\n    if (exactMatch()) {\n        return rule_[0] == c;\n    } else if (matchAll()) {\n        return true;\n    } else if (rule_[0] == '~') {\n        return c != rule_[1];\n    }\n    \/\/ here we should raise an exception; but no exception\n    \/\/ are used in this code... that's it. Rather, I would\n    \/\/ set an internal state to \"machine is out of service\"!\n    return false;\n}\n\nbool Rule::exactMatch() const\n{\n    return rule_.length() == 1;\n}\n\nbool Rule::matchMany() const\n{\n    return rule_.length() > 1 &&\n        (rule_.compare(\"any\") == 0 || rule_[0] == '~');\n}\n\nbool Rule::matchAll() const\n{\n    return rule_.length() > 1 && rule_.compare(\"any\") == 0;\n}\n\nsize_t Rule::size() const\n{\n    return setsize_;\n}\n\n\n\n\/\/ ------------------------------------------\n\nAwareState::AwareState(const std::string& name, bool final) :\n    State(name, final)\n{}\n\nAwareState& AwareState::onRule(const Rule* rule, const AwareState* dest)\n{\n    Connection con{rule, dest->name()};\n    connections_.push_front(con);\n    connections_.sort([](const Connection& a, const Connection& b)->bool {\n            return a.rule->size() < b.rule->size();\n        });\n    return *this;\n}\n\nbool AwareState::overConnectionsDo(\n    std::function<bool(const Rule*,\n                       const std::string&)> action) const\n{\n    return std::any_of(connections_.begin(),\n                       connections_.end(),\n                       [&](decltype(connections_.front()) c) {\n                           return action(c.rule, c.destState);\n                       });\n    \/\/ the previous piece should work like the following\n    \/* \n    for (auto& c : connections_) {\n        if (action(c.rule, c.destState)) {\n            return true;\n        }\n    }\n    return false;\n    *\/\n}\n\n\/\/ ------------------------------------------\n\nFSM::FSM(bool debug) : current_(nullptr),\n                       first_(nullptr),\n                       strict_(false),\n                       debug_(debug)\n{}\n\n\nFSM::~FSM()\n{\n    for (auto& p : rules_) {\n        delete p.second;\n    }\n    for (auto& p : states_) {\n        delete p.second;\n    }\n}\n\nbool FSM::accepted() const\n{\n    if (debug_ && current_) {\n        std::cerr << \"state: \" << current_->name() << \"\\n\";\n    }\n    return current_ ? current_->accept() : false;\n}\n\nvoid FSM::rewind()\n{\n    current_ = first_;\n}\n\nvoid FSM::first(const std::string& s)\n{\n    if (states_.count(s) > 0) {\n        first_ = states_[s];\n    }\n}\n\nvoid FSM::strict(bool b)\n{\n    strict_ = b;\n}\n\n\nAwareState& FSM::state(const std::string& n, bool final)\n{\n    if (states_.count(n) > 0) {\n        \/\/ the name's already taken;\n        \/\/ return whatever it was created, ignore final arg.\n        return *states_[n];\n    }\n    AwareState* new_state = new AwareState(n, final); \/\/ no nothrow...\n    states_[n] = new_state;\n    if (!first_) {\n        first_ = new_state;\n    }\n    return *new_state;\n}\n\n\nAwareState& FSM::get(const std::string& n)\n{\n    if (states_.count(n) > 0) {\n        return *states_[n];\n    }\n    return state(n, false);\n}\n\n\nbool FSM::connect(const std::string& s1,\n                  const std::string& s2,\n                  const std::string& rule)\n{\n    AwareState* state1 = nullptr;\n    AwareState* state2 = nullptr;\n    Rule* orule = nullptr;\n\n    if (states_.count(s1) > 0) {\n        state1 = states_[s1];\n    } else {\n        state1 = &state(s1, false);\n        if (!state1) {\n            return false;\n        }\n        states_[s1] = state1;\n    }\n\n    if (states_.count(s2) > 0) {\n        state2 = states_[s2];\n    } else {\n        state2 = &state(s2, false);\n        if (!state2) {\n            return false;\n        }\n        states_[s2] = state2;\n    }\n\n    if (rules_.count(rule) > 0) {\n        orule = rules_[rule];\n    } else {\n        orule = new (std::nothrow) Rule(rule);\n        if (!orule) {\n            return false;\n        }\n        rules_[rule] = orule;\n    }\n\n    state1->onRule(orule, state2);\n    return true;\n}\n\nbool FSM::feed(int c)\n{\n    if (!first_) {\n        return false;\n    }\n    if (!current_) {\n        current_ = first_;\n    }\n\n    const AwareState* next_current = current_;\n    bool matched = current_->overConnectionsDo(\n        [c,&next_current,this](const Rule* r, const std::string& s)->bool {\n            if (r->satisfiedBy(c)) {\n                if (this->states_.count(s) > 0) {\n                    next_current = states_[s];\n                }\n                return true;\n            }\n            return false;\n        });\n\n    if (debug_) {\n        std::cerr << current_->name() << \"(\" << c << \")\"\n                  << next_current->name() << \"\\n\";\n    }\n\n    current_ = next_current;\n\n    return matched;\n}\n\n\nbool FSM::run(const std::string& s)\n{\n    bool matched;\n    rewind();\n    for (auto& c : s) {\n        matched = feed(c);\n        if (strict_ && !matched) {\n            break;\n        }\n    }\n    return current_->accept() && (!strict_ || matched);\n}\n\n\n\n} \/\/ ns: mFSM\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *   Copyright (C) 2003 by Hans Karlsson <karlsson.h@home.se>              *\n *   Copyright (C) 2007 Matt Broadstone <mbroadst@gmail.com>               *\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#include \"textlabel.h\"\n#include \"textlabel.moc\"\n\n#include <QPainter>\n#include <QMouseEvent>\n#include <QGraphicsSceneMouseEvent>\n#include <QCursor>\n\n#include <KRun>\n\nTextLabel::TextLabel(Karamba *k, int x, int y, int w, int h)\n        :   Meter(k, x, y, w, h),\n        alignment(Qt::AlignLeft),\n        clip(0),\n        bgColor(0, 0, 0),\n        lineHeight(0),\n        shadow(0),\n        scrollSpeed(0, 0),\n        scrollPos(0, 0),\n        scrollGap(0),\n        scrollPause(0),\n        pauseCounter(0),\n        scrollType(ScrollNone),\n        m_clickable(false)\n{\n    origPoint = QPoint(x, y);\n\n    calculateTextSize();\n    if (h != 0 || w != 0)\n        clip = 0;\n    else\n        clip = Qt::TextDontClip;\n\n    if (h == 0 || w == 0) {\n        setWidth(-1);\n        setHeight(-1);\n    }\n}\n\nTextLabel::TextLabel(Karamba *k)\n        :   Meter(k, 0, 0, 0, 0),\n        alignment(Qt::AlignLeft),\n        clip(0),\n        bgColor(0, 0, 0),\n        lineHeight(0),\n        shadow(0),\n        scrollSpeed(0, 0),\n        scrollPos(0, 0),\n        scrollGap(0),\n        scrollPause(0),\n        pauseCounter(0),\n        scrollType(ScrollNone),\n        m_clickable(false)\n{}\n\nTextLabel::~TextLabel()\n{}\n\nvoid TextLabel::show()\n{\n    Meter::show();\n    setEnabled(true);\n}\n\nvoid TextLabel::hide()\n{\n    Meter::hide();\n    setEnabled(false);\n}\n\nvoid TextLabel::setTextProps(TextField *field)\n{\n    if (field) {\n        text = *field;\n        \/\/lineHeight = t->getLineHeight();\n        shadow = field->getShadow();\n        alignment = field->getAlignment();\n        setFontSize(field->getFontSize());\n        setFont(field->getFont());\n\n        setColor(field->getColor());\n        setBGColor(field->getBGColor());\n    }\n\n    calculateTextSize();\n}\n\nvoid TextLabel::calculateTextSize()\n{\n    int tmp;\n\n    prepareGeometryChange();\n\n    QFontMetrics fm(font);\n    lineHeight = fm.height();\n    textSize.setWidth(0);\n    textSize.setHeight(lineHeight * value.count());\n    QStringList::Iterator it = value.begin();\n\n    while (it != value.end()) {\n        tmp = fm.width(*it);\n        if (tmp > textSize.width())\n            textSize.setWidth(tmp);\n\n        ++it;\n    }\n\n    if (getWidth() <= 0) {\n        Meter::setWidth(textSize.width());\n    }\n\n    if (getHeight() <= 0) {\n       Meter::setHeight(textSize.height());\n    }\n\n    if (alignment == Qt::AlignLeft)\n        Meter::setX(origPoint.x());\n    else if (alignment == Qt::AlignRight)\n        Meter::setX(origPoint.x() - textSize.width());\n    else if (alignment == Qt::AlignCenter)\n        Meter::setX(origPoint.x() - textSize.width() \/ 2);\n}\n\nvoid TextLabel::setValue(const QString &text)\n{\n    value = text.split('\\n');\n\n    calculateTextSize();\n    update();\n}\n\nvoid TextLabel::setValue(int v)\n{\n    value = QStringList(QString::number(v));\n\n    calculateTextSize();\n    update();\n}\n\nvoid TextLabel::setBGColor(QColor clr)\n{\n    bgColor = clr;\n}\n\nQColor TextLabel::getBGColor() const\n{\n    return bgColor;\n}\n\nvoid TextLabel::setFont(const QString &f)\n{\n    font.setFamily(f);\n    calculateTextSize();\n}\n\nQString TextLabel::getFont() const\n{\n    return font.family();\n}\n\nvoid TextLabel::setFontSize(int size)\n{\n    font.setPixelSize(size);\n    calculateTextSize();\n}\n\nint TextLabel::getFontSize() const\n{\n    return font.pixelSize();\n}\n\nvoid TextLabel::setAlignment(const QString &align)\n{\n    QString a = align.toUpper();\n    if (a == \"LEFT\" || a.isEmpty())\n        alignment = Qt::AlignLeft;\n    if (a == \"RIGHT\")\n        alignment = Qt::AlignRight;\n    if (a == \"CENTER\")\n        alignment = Qt::AlignHCenter;\n\n    calculateTextSize();\n}\n\nQString TextLabel::getAlignment() const\n{\n    if (alignment == Qt::AlignHCenter)\n        return \"CENTER\";\n    else if (alignment == Qt::AlignRight)\n        return \"RIGHT\";\n    else\n        return \"LEFT\";\n}\n\nvoid TextLabel::setFixedPitch(bool fp)\n{\n    font.setFixedPitch(fp);\n}\n\nbool TextLabel::getFixedPitch() const\n{\n    return font.fixedPitch();\n}\n\nvoid TextLabel::setShadow(int s)\n{\n    shadow = s;\n}\n\nint TextLabel::getShadow() const\n{\n    return shadow;\n}\n\nvoid TextLabel::setScroll(const QString &a, const QPoint &speed, int gap, int pause)\n{\n    ScrollType t = TextLabel::ScrollNone;\n    QString scroll = a.toUpper();\n\n    if (scroll == \"NONE\")\n        scroll = TextLabel::ScrollNone;\n    else if (a == \"NORMAL\")\n        scroll = TextLabel::ScrollNormal;\n    else if (a == \"BACKANDFORTH\")\n        scroll = TextLabel::ScrollBackAndForth;\n    else if (a == \"ONEPASS\")\n        scroll = TextLabel::ScrollOnePass;\n\n    setScroll(t, speed, gap, pause);\n}\n\nvoid TextLabel::setScroll(ScrollType type, QPoint speed, int gap, int pause)\n{\n    scrollType = type;\n    scrollSpeed = speed;\n\n    switch (scrollType) {\n    case ScrollNormal:\n    case ScrollOnePass: {\n        int x = 0, y = 0;\n\n        if (speed.x() > 0)\n            x = -1 * textSize.width();\n        else if (speed.x() < 0)\n            x = getWidth() - 1;\n\n        if (speed.y() > 0)\n            x = -1 * textSize.height();\n        else if (speed.y() < 0)\n            x = getHeight() - 1;\n\n        scrollPos = QPoint(x, y);\n        break;\n    }\n\n    case ScrollNone:\n    case ScrollBackAndForth:\n    default:\n        scrollPos = QPoint(0, 0);\n        break;\n    }\n\n    scrollGap = gap;\n    scrollPause = pause;\n    pauseCounter = 1;\n}\n\nint TextLabel::drawText(QPainter *p, int x, int y, int width, int height,\n                        const QString &text)\n{\n    if (shadow != 0) {\n        p->setPen(getBGColor());\n        p->drawText(x + shadow, y + shadow, width, height,\n                    alignment | clip | Qt::TextExpandTabs, text);\n    }\n\n    p->setPen(getColor());\n    p->drawText(x, y, width, height, alignment | clip |\n                Qt::TextExpandTabs, text);\n\n    return 0;\n}\n\nbool TextLabel::calculateScrollCoords(const QRect &meterRect, QRect &textRect,\n                                      QPoint &next, int x, int y)\n{\n    if (scrollType == ScrollBackAndForth &&\n            (scrollSpeed.x() != 0 && textSize.width() < getWidth() ||\n             scrollSpeed.y() != 0 && textSize.height() < getHeight()))\n        return true;\n\n    x += scrollPos.x();\n    y += scrollPos.y();\n\n    if (pauseCounter < 1) {\n        scrollPos += scrollSpeed;\n\n        \/\/ -1 | 0 | 1\n        QPoint direction(scrollSpeed.x() \/ abs((scrollSpeed.x() == 0) ?\n                                               1 : scrollSpeed.x()),\n                         scrollSpeed.y() \/ abs((scrollSpeed.y() == 0) ?\n                                               1 : scrollSpeed.y()));\n        next = QPoint(-1 * direction.x() * (scrollGap + textSize.width()),\n                      -1 * direction.y() * (scrollGap + textSize.height()));\n        textRect.setCoords(x, y, x + textSize.width(), y + textSize.height());\n\n        if (scrollType == ScrollBackAndForth) {\n            if (direction.x() < 0 && textRect.right() <= meterRect.right() ||\n                    direction.x() > 0 && textRect.left() >= meterRect.left()) {\n                scrollSpeed.setX(scrollSpeed.x() * -1);\n                pauseCounter = scrollPause;\n            }\n            if (direction.y() < 0 && textRect.bottom() <= meterRect.bottom() ||\n                    direction.y() > 0 && textRect.top() >= meterRect.top()) {\n                scrollSpeed.setY(scrollSpeed.y() * -1);\n                pauseCounter = scrollPause;\n            }\n        } else if (!textRect.intersects(meterRect)) {\n            if (scrollType == ScrollNormal)\n                scrollPos += next;\n            else if (scrollType == ScrollOnePass)\n                return false;\n        }\n    } else\n        --pauseCounter;\n\n    return true;\n}\n\nvoid TextLabel::paint(QPainter *p, const QStyleOptionGraphicsItem *option,\n                      QWidget *widget)\n{\n    Q_UNUSED(option);\n    Q_UNUSED(widget);\n\n    if (!m_hidden) {\n        int i = 0; \/\/ lineHeight;\n        int row = 1;\n        int width = getWidth();\n        int height = getHeight();\n        QRect meterRect(0, 0, width, height);\n        QRect textRect;\n        QPoint next;\n\n        p->setFont(font);\n        if (scrollType != ScrollNone) {\n            p->setClipRect(0, 0, width, height);\n            if (!calculateScrollCoords(meterRect, textRect, next, 0, 0)) {\n                p->setClipping(false);\n                return;\n            }\n            width = textSize.width();\n            height = textSize.height();\n        }\n\n        QStringList::Iterator it = value.begin();\n        while (it != value.end() && (row <= height || height == -1)) {\n            drawText(p, 0, 0 + i, width, height, *it);\n\n            \/\/ Draw more instances of text if scroll type is normal scroll\n            if (scrollType == ScrollNormal) {\n                textRect.adjust(next.x(), next.y(), next.x(), next.y());\n                while (textRect.intersects(meterRect)) {\n                    drawText(p, textRect.x(), textRect.y() + i, width, height, *it);\n                    textRect.adjust(next.x(), next.y(), next.x(), next.y());\n                }\n            }\n\n            i += lineHeight;\n            it++;\n            row++;\n        }\n\n        if (scrollType != ScrollNone)\n            p->setClipping(false);\n    }\n}\n\nbool TextLabel::mouseEvent(QEvent* e)\n{\n    if (isEnabled()) {\n        Qt::MouseButtons button;\n        if (QGraphicsSceneMouseEvent *event = dynamic_cast<QGraphicsSceneMouseEvent*>(e)) {\n            button = event->button();\n        } else if (QGraphicsSceneWheelEvent *event = dynamic_cast<QGraphicsSceneWheelEvent*>(e)) {\n            button = event->buttons();\n        }\n\n        QString program;\n        if (button == Qt::LeftButton)\n            program = m_leftMouseButtonAction;\n        else if (button == Qt::MidButton)\n            program = m_middleMouseButtonAction;\n        else if (button == Qt::RightButton)\n            program = m_rightMouseButtonAction;\n\n        if (!program.isEmpty())\n            KRun::runCommand(program);\n        else\n            return true;\n    }\n\n    return false;\n}\n\nvoid TextLabel::allowClick(bool enable)\n{\n    m_clickable = enable;\n}\n\nbool TextLabel::clickable()\n{\n    return m_clickable;\n}\n\nvoid TextLabel::attachClickArea(const QString &leftMouseButton,\n                                const QString &middleMouseButton,\n                                const QString &rightMouseButton)\n{\n    m_leftMouseButtonAction = leftMouseButton;\n    m_middleMouseButtonAction = middleMouseButton;\n    m_rightMouseButtonAction = rightMouseButton;\n\n    QGraphicsItem::setCursor(QCursor(Qt::PointingHandCursor));\n}\n\nQRectF TextLabel::boundingRect() const\n{\n    return Meter::boundingRect();\n}\n\nint TextLabel::getTextWidth() const\n{\n    QFontMetrics fm(font);\n    return fm.width(value[0]);\n}\n<commit_msg>Fix centered text<commit_after>\/***************************************************************************\n *   Copyright (C) 2003 by Hans Karlsson <karlsson.h@home.se>              *\n *   Copyright (C) 2007 Matt Broadstone <mbroadst@gmail.com>               *\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#include \"textlabel.h\"\n#include \"textlabel.moc\"\n\n#include <QPainter>\n#include <QMouseEvent>\n#include <QGraphicsSceneMouseEvent>\n#include <QCursor>\n\n#include <KRun>\n\nTextLabel::TextLabel(Karamba *k, int x, int y, int w, int h)\n        :   Meter(k, x, y, w, h),\n        alignment(Qt::AlignLeft),\n        clip(0),\n        bgColor(0, 0, 0),\n        lineHeight(0),\n        shadow(0),\n        scrollSpeed(0, 0),\n        scrollPos(0, 0),\n        scrollGap(0),\n        scrollPause(0),\n        pauseCounter(0),\n        scrollType(ScrollNone),\n        m_clickable(false)\n{\n    origPoint = QPoint(x, y);\n\n    calculateTextSize();\n    if (h != 0 || w != 0)\n        clip = 0;\n    else\n        clip = Qt::TextDontClip;\n\n    if (h == 0 || w == 0) {\n        setWidth(-1);\n        setHeight(-1);\n    }\n}\n\nTextLabel::TextLabel(Karamba *k)\n        :   Meter(k, 0, 0, 0, 0),\n        alignment(Qt::AlignLeft),\n        clip(0),\n        bgColor(0, 0, 0),\n        lineHeight(0),\n        shadow(0),\n        scrollSpeed(0, 0),\n        scrollPos(0, 0),\n        scrollGap(0),\n        scrollPause(0),\n        pauseCounter(0),\n        scrollType(ScrollNone),\n        m_clickable(false)\n{}\n\nTextLabel::~TextLabel()\n{}\n\nvoid TextLabel::show()\n{\n    Meter::show();\n    setEnabled(true);\n}\n\nvoid TextLabel::hide()\n{\n    Meter::hide();\n    setEnabled(false);\n}\n\nvoid TextLabel::setTextProps(TextField *field)\n{\n    if (field) {\n        text = *field;\n        \/\/lineHeight = t->getLineHeight();\n        shadow = field->getShadow();\n        alignment = field->getAlignment();\n        setFontSize(field->getFontSize());\n        setFont(field->getFont());\n\n        setColor(field->getColor());\n        setBGColor(field->getBGColor());\n    }\n\n    calculateTextSize();\n}\n\nvoid TextLabel::calculateTextSize()\n{\n    int tmp;\n\n    prepareGeometryChange();\n\n    QFontMetrics fm(font);\n    lineHeight = fm.height();\n    textSize.setWidth(0);\n    textSize.setHeight(lineHeight * value.count());\n    QStringList::Iterator it = value.begin();\n\n    while (it != value.end()) {\n        tmp = fm.width(*it);\n        if (tmp > textSize.width())\n            textSize.setWidth(tmp);\n\n        ++it;\n    }\n\n    if (getWidth() <= 0) {\n        Meter::setWidth(textSize.width());\n    }\n\n    if (getHeight() <= 0) {\n       Meter::setHeight(textSize.height());\n    }\n\n    if (alignment == Qt::AlignLeft) {\n        Meter::setX(origPoint.x());\n    }\n    else if (alignment == Qt::AlignRight) {\n        Meter::setX(origPoint.x() - textSize.width());\n    }\n    else if (alignment == Qt::AlignHCenter) {\n        Meter::setX(origPoint.x() - textSize.width() \/ 2);\n    }\n}\n\nvoid TextLabel::setValue(const QString &text)\n{\n    value = text.split('\\n');\n\n    calculateTextSize();\n    update();\n}\n\nvoid TextLabel::setValue(int v)\n{\n    value = QStringList(QString::number(v));\n\n    calculateTextSize();\n    update();\n}\n\nvoid TextLabel::setBGColor(QColor clr)\n{\n    bgColor = clr;\n}\n\nQColor TextLabel::getBGColor() const\n{\n    return bgColor;\n}\n\nvoid TextLabel::setFont(const QString &f)\n{\n    font.setFamily(f);\n    calculateTextSize();\n}\n\nQString TextLabel::getFont() const\n{\n    return font.family();\n}\n\nvoid TextLabel::setFontSize(int size)\n{\n    font.setPixelSize(size);\n    calculateTextSize();\n}\n\nint TextLabel::getFontSize() const\n{\n    return font.pixelSize();\n}\n\nvoid TextLabel::setAlignment(const QString &align)\n{\n    QString a = align.toUpper();\n    if (a == \"LEFT\" || a.isEmpty())\n        alignment = Qt::AlignLeft;\n    if (a == \"RIGHT\")\n        alignment = Qt::AlignRight;\n    if (a == \"CENTER\")\n        alignment = Qt::AlignHCenter;\n\n    calculateTextSize();\n}\n\nQString TextLabel::getAlignment() const\n{\n    if (alignment == Qt::AlignHCenter)\n        return \"CENTER\";\n    else if (alignment == Qt::AlignRight)\n        return \"RIGHT\";\n    else\n        return \"LEFT\";\n}\n\nvoid TextLabel::setFixedPitch(bool fp)\n{\n    font.setFixedPitch(fp);\n}\n\nbool TextLabel::getFixedPitch() const\n{\n    return font.fixedPitch();\n}\n\nvoid TextLabel::setShadow(int s)\n{\n    shadow = s;\n}\n\nint TextLabel::getShadow() const\n{\n    return shadow;\n}\n\nvoid TextLabel::setScroll(const QString &a, const QPoint &speed, int gap, int pause)\n{\n    ScrollType t = TextLabel::ScrollNone;\n    QString scroll = a.toUpper();\n\n    if (scroll == \"NONE\")\n        scroll = TextLabel::ScrollNone;\n    else if (a == \"NORMAL\")\n        scroll = TextLabel::ScrollNormal;\n    else if (a == \"BACKANDFORTH\")\n        scroll = TextLabel::ScrollBackAndForth;\n    else if (a == \"ONEPASS\")\n        scroll = TextLabel::ScrollOnePass;\n\n    setScroll(t, speed, gap, pause);\n}\n\nvoid TextLabel::setScroll(ScrollType type, QPoint speed, int gap, int pause)\n{\n    scrollType = type;\n    scrollSpeed = speed;\n\n    switch (scrollType) {\n    case ScrollNormal:\n    case ScrollOnePass: {\n        int x = 0, y = 0;\n\n        if (speed.x() > 0)\n            x = -1 * textSize.width();\n        else if (speed.x() < 0)\n            x = getWidth() - 1;\n\n        if (speed.y() > 0)\n            x = -1 * textSize.height();\n        else if (speed.y() < 0)\n            x = getHeight() - 1;\n\n        scrollPos = QPoint(x, y);\n        break;\n    }\n\n    case ScrollNone:\n    case ScrollBackAndForth:\n    default:\n        scrollPos = QPoint(0, 0);\n        break;\n    }\n\n    scrollGap = gap;\n    scrollPause = pause;\n    pauseCounter = 1;\n}\n\nint TextLabel::drawText(QPainter *p, int x, int y, int width, int height,\n                        const QString &text)\n{\n    if (shadow != 0) {\n        p->setPen(getBGColor());\n        p->drawText(x + shadow, y + shadow, width, height,\n                    alignment | clip | Qt::TextExpandTabs, text);\n    }\n\n    p->setPen(getColor());\n    p->drawText(x, y, width, height, alignment | clip |\n                Qt::TextExpandTabs, text);\n\n    return 0;\n}\n\nbool TextLabel::calculateScrollCoords(const QRect &meterRect, QRect &textRect,\n                                      QPoint &next, int x, int y)\n{\n    if (scrollType == ScrollBackAndForth &&\n            (scrollSpeed.x() != 0 && textSize.width() < getWidth() ||\n             scrollSpeed.y() != 0 && textSize.height() < getHeight()))\n        return true;\n\n    x += scrollPos.x();\n    y += scrollPos.y();\n\n    if (pauseCounter < 1) {\n        scrollPos += scrollSpeed;\n\n        \/\/ -1 | 0 | 1\n        QPoint direction(scrollSpeed.x() \/ abs((scrollSpeed.x() == 0) ?\n                                               1 : scrollSpeed.x()),\n                         scrollSpeed.y() \/ abs((scrollSpeed.y() == 0) ?\n                                               1 : scrollSpeed.y()));\n        next = QPoint(-1 * direction.x() * (scrollGap + textSize.width()),\n                      -1 * direction.y() * (scrollGap + textSize.height()));\n        textRect.setCoords(x, y, x + textSize.width(), y + textSize.height());\n\n        if (scrollType == ScrollBackAndForth) {\n            if (direction.x() < 0 && textRect.right() <= meterRect.right() ||\n                    direction.x() > 0 && textRect.left() >= meterRect.left()) {\n                scrollSpeed.setX(scrollSpeed.x() * -1);\n                pauseCounter = scrollPause;\n            }\n            if (direction.y() < 0 && textRect.bottom() <= meterRect.bottom() ||\n                    direction.y() > 0 && textRect.top() >= meterRect.top()) {\n                scrollSpeed.setY(scrollSpeed.y() * -1);\n                pauseCounter = scrollPause;\n            }\n        } else if (!textRect.intersects(meterRect)) {\n            if (scrollType == ScrollNormal)\n                scrollPos += next;\n            else if (scrollType == ScrollOnePass)\n                return false;\n        }\n    } else\n        --pauseCounter;\n\n    return true;\n}\n\nvoid TextLabel::paint(QPainter *p, const QStyleOptionGraphicsItem *option,\n                      QWidget *widget)\n{\n    Q_UNUSED(option);\n    Q_UNUSED(widget);\n\n    if (!m_hidden) {\n        int i = 0; \/\/ lineHeight;\n        int row = 1;\n        int width = getWidth();\n        int height = getHeight();\n        QRect meterRect(0, 0, width, height);\n        QRect textRect;\n        QPoint next;\n\n        p->setFont(font);\n        if (scrollType != ScrollNone) {\n            p->setClipRect(0, 0, width, height);\n            if (!calculateScrollCoords(meterRect, textRect, next, 0, 0)) {\n                p->setClipping(false);\n                return;\n            }\n            width = textSize.width();\n            height = textSize.height();\n        }\n\n        QStringList::Iterator it = value.begin();\n        while (it != value.end() && (row <= height || height == -1)) {\n            drawText(p, 0, 0 + i, width, height, *it);\n\n            \/\/ Draw more instances of text if scroll type is normal scroll\n            if (scrollType == ScrollNormal) {\n                textRect.adjust(next.x(), next.y(), next.x(), next.y());\n                while (textRect.intersects(meterRect)) {\n                    drawText(p, textRect.x(), textRect.y() + i, width, height, *it);\n                    textRect.adjust(next.x(), next.y(), next.x(), next.y());\n                }\n            }\n\n            i += lineHeight;\n            it++;\n            row++;\n        }\n\n        if (scrollType != ScrollNone)\n            p->setClipping(false);\n    }\n}\n\nbool TextLabel::mouseEvent(QEvent* e)\n{\n    if (isEnabled()) {\n        Qt::MouseButtons button;\n        if (QGraphicsSceneMouseEvent *event = dynamic_cast<QGraphicsSceneMouseEvent*>(e)) {\n            button = event->button();\n        } else if (QGraphicsSceneWheelEvent *event = dynamic_cast<QGraphicsSceneWheelEvent*>(e)) {\n            button = event->buttons();\n        }\n\n        QString program;\n        if (button == Qt::LeftButton)\n            program = m_leftMouseButtonAction;\n        else if (button == Qt::MidButton)\n            program = m_middleMouseButtonAction;\n        else if (button == Qt::RightButton)\n            program = m_rightMouseButtonAction;\n\n        if (!program.isEmpty())\n            KRun::runCommand(program);\n        else\n            return true;\n    }\n\n    return false;\n}\n\nvoid TextLabel::allowClick(bool enable)\n{\n    m_clickable = enable;\n}\n\nbool TextLabel::clickable()\n{\n    return m_clickable;\n}\n\nvoid TextLabel::attachClickArea(const QString &leftMouseButton,\n                                const QString &middleMouseButton,\n                                const QString &rightMouseButton)\n{\n    m_leftMouseButtonAction = leftMouseButton;\n    m_middleMouseButtonAction = middleMouseButton;\n    m_rightMouseButtonAction = rightMouseButton;\n\n    QGraphicsItem::setCursor(QCursor(Qt::PointingHandCursor));\n}\n\nQRectF TextLabel::boundingRect() const\n{\n    return Meter::boundingRect();\n}\n\nint TextLabel::getTextWidth() const\n{\n    QFontMetrics fm(font);\n    return fm.width(value[0]);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <exodus\/library.h>\r\nlibraryinit()\r\n\r\n#include <sysmsg.h>\r\n\r\nvar id;\r\n\r\nfunction main(in mode, io tx, in arg3, io arg4, in arg5) {\r\n\t\/\/c sys in,io,in,io,in\r\n\r\n\tif (mode == \"INITMENUS\") {\r\n\r\n\t\ttx = \"<!DOCTYPE html>\";\r\n\t\ttx ^= FM ^ \"<html>\";\r\n\t\ttx ^= FM ^ \"<!-- Generated by init.general and other modules -->\";\r\n\t\ttx ^= FM ^ \"<head>\";\r\n\t\ttx ^= FM ^ \"<meta http-equiv=\\\"Content-Type\\\" content=\\\"text\/html; charset=utf-8\\\" \/>\";\r\n\t\ttx ^= FM ^ \"<\/head>\";\r\n\t\ttx ^= FM ^ \"<body style=\\\"text-align: left\\\">\";\r\n\t\ttx ^= FM ^ \"<div id=\\\"menudiv\\\" class=\\\"menu\\\" style=\\\"display: none; text-align: left\\\">\";\r\n\r\n\t} else if (mode == \"ADDMENU\") {\r\n\r\n\t\t#define menu arg3\r\n\t\tif (arg4.unassigned()) {\r\n\t\t\tid = \"\";\r\n\t\t}else{\r\n\t\t\tid = arg4;\r\n\t\t}\r\n\r\n\t\t\/\/<a id=\"menu_SUPPORT\">_Support<\/a>\r\n\t\t\/\/<div class=\"menu\">\r\n\r\n\t\t\/\/use menu title as menu id\r\n\t\tif (not id) {\r\n\t\t\tid = var(menu).ucase();\r\n\t\t\tid.converter(\"_\", \"\");\r\n\t\t}\r\n\r\n\t\t\/\/convert _x to <u>x<\/u> to indicate keyboard shortcut\r\n\t\tvar tt = var(menu).index(\"_\");\r\n\t\tif (tt) {\r\n\t\t\tvar(menu).splicer(tt, 2, \"<u>\" ^ var(menu)[tt + 1] ^ \"<\/u>\");\r\n\t\t}\r\n\r\n\t\ttx ^= FM ^ \"<a id=\\\"menu_\" ^ id ^ \"\\\">\" ^ menu ^ \"<\/a>\";\r\n\t\ttx ^= FM ^ \"<div class=\\\"menu\\\">\";\r\n\r\n\t\tid = \"\";\r\n\r\n\t} else if (mode == \"SUBMENU\") {\r\n\r\n\t\t\/\/<a>_Reports<\/a>\r\n\t\t\/\/<div class=\"menu\">\r\n\r\n\t\tvar submenu = arg3;\r\n\r\n\t\t\/\/convert _x to <u>x<\/u> to indicate keyboard shortcut\r\n\t\tvar tt = submenu.index(\"_\");\r\n\t\tif (tt) {\r\n\t\t\tsubmenu.splicer(tt, 2, \"<u>\" ^ submenu[tt + 1] ^ \"<\/u>\");\r\n\t\t}\r\n\r\n\t\ttx ^= FM ^ \"<a>\" ^ submenu ^ \"<\/a>\";\r\n\t\t\/\/submenus are same class as menus\r\n\t\ttx ^= FM ^ \" <div class=\\\"menu\\\">\";\r\n\r\n\t} else if (mode == \"ADDITEM\") {\r\n\r\n\t\tvar item = arg3;\r\n\t\t#define href arg4\r\n\t\t\/\/equate onclick to arg5\r\n\r\n\t\t\/\/<a href=\"..\/media\/schedules.htm?filename=PLANS&amp;plantype=1&ratings=1\"><u>M<\/u>onth Plan File<\/a><br \/>\r\n\t\tvar props = \"\";\r\n\t\t\/\/if unassigned(id) else props:=' id=':quote(id)\r\n\t\t\/\/if unassigned(onclick) else props:=' onclick = ':quote(onclick)\r\n\t\tif (not(arg5.unassigned())) {\r\n\t\t\tprops ^= \" arg5 = \" ^ (arg5.quote());\r\n\t\t}\r\n\r\n\t\t\/\/convert _x to <u>x<\/u> to indicate keyboard shortcut\r\n\t\tvar tt = item.index(\"_\");\r\n\t\tif (tt) {\r\n\t\t\titem.splicer(tt, 2, \"<u>\" ^ item[tt + 1] ^ \"<\/u>\");\r\n\t\t}\r\n\r\n\t\ttx ^= FM ^ \" <a\" ^ props ^ \" href=\\\"\" ^ href ^ \"\\\">\" ^ item ^ \"<\/a><br \/>\";\r\n\r\n\t} else if (mode == \"ADDSEP\") {\r\n\r\n\t\ttx ^= FM ^ \" <hr class=\\\"menu_hr\\\" \/>\";\r\n\r\n\t} else if (mode == \"ENDSUBMENU\") {\r\n\r\n\t\ttx ^= FM ^ \"<\/div>\";\r\n\t\ttx ^= FM ^ \"<br \/>\";\r\n\r\n\t} else if (mode == \"ENDMENU\") {\r\n\r\n\t\ttx ^= FM ^ \"<\/div>\";\r\n\r\n\t} else if (mode == \"EXITMENUS\") {\r\n\r\n\t\ttx ^= FM ^ \"<button tabindex=\\\"-1\\\" style=\\\"background-color: white; height: 1px; width: 1px; border-style: none; margin: 0; padding: 0\\\" accesskey=\\\"M\\\"\";\r\n\t\tvar onclickx = \"javascript:if (typeof menuonmouseover!=\\'undefined\\') menuonmouseover(\\'click\\')\";\r\n\t\ttx ^= FM ^ \" onclick=\" ^ (onclickx.quote()) ^ \">\";\r\n\t\ttx ^= FM ^ \"<\/button>\";\r\n\t\ttx ^= FM ^ \"<\/body>\";\r\n\r\n\t} else {\r\n\t\tcall sysmsg(mode.quote() ^ \" invalid mode in MENU.SUBS\");\r\n\t}\r\n\r\n\t\/\/prevent href being carried forwards to ADDITEM which use onclick instead\r\n\targ4 = \"\";\r\n\r\n\treturn 0;\r\n}\r\n\r\nlibraryexit()\r\n<commit_msg>ditto<commit_after>#include <exodus\/library.h>\r\nlibraryinit()\r\n\r\n#include <sysmsg.h>\r\n\r\nvar id;\r\n\r\nfunction main(in mode, io tx, in arg3, io arg4, in arg5) {\r\n\t\/\/c sys in,io,in,io,in\r\n\r\n\tif (mode == \"INITMENUS\") {\r\n\r\n\t\ttx = \"<!DOCTYPE html>\";\r\n\t\ttx ^= FM ^ \"<html>\";\r\n\t\ttx ^= FM ^ \"<!-- Generated by init.general and other modules -->\";\r\n\t\ttx ^= FM ^ \"<head>\";\r\n\t\ttx ^= FM ^ \"<meta http-equiv=\\\"Content-Type\\\" content=\\\"text\/html; charset=utf-8\\\" \/>\";\r\n\t\ttx ^= FM ^ \"<\/head>\";\r\n\t\ttx ^= FM ^ \"<body style=\\\"text-align: left\\\">\";\r\n\t\ttx ^= FM ^ \"<div id=\\\"menudiv\\\" class=\\\"menu\\\" style=\\\"display: none; text-align: left\\\">\";\r\n\r\n\t} else if (mode == \"ADDMENU\") {\r\n\r\n\t\t#define menu arg3\r\n\t\tif (arg4.unassigned()) {\r\n\t\t\tid = \"\";\r\n\t\t}else{\r\n\t\t\tid = arg4;\r\n\t\t}\r\n\r\n\t\t\/\/<a id=\"menu_SUPPORT\">_Support<\/a>\r\n\t\t\/\/<div class=\"menu\">\r\n\r\n\t\t\/\/use menu title as menu id\r\n\t\tif (not id) {\r\n\t\t\tid = var(menu).ucase();\r\n\t\t\tid.converter(\"_\", \"\");\r\n\t\t}\r\n\r\n\t\t\/\/convert _x to <u>x<\/u> to indicate keyboard shortcut\r\n\t\tvar tt = var(menu).index(\"_\");\r\n\t\tif (tt) {\r\n\t\t\tvar(menu).splicer(tt, 2, \"<u>\" ^ var(menu)[tt + 1] ^ \"<\/u>\");\r\n\t\t}\r\n\r\n\t\ttx ^= FM ^ \"<a id=\\\"menu_\" ^ id ^ \"\\\">\" ^ menu ^ \"<\/a>\";\r\n\t\ttx ^= FM ^ \"<div class=\\\"menu\\\">\";\r\n\r\n\t\tid = \"\";\r\n\r\n\t} else if (mode == \"SUBMENU\") {\r\n\r\n\t\t\/\/<a>_Reports<\/a>\r\n\t\t\/\/<div class=\"menu\">\r\n\r\n\t\tvar submenu = arg3;\r\n\r\n\t\t\/\/convert _x to <u>x<\/u> to indicate keyboard shortcut\r\n\t\tvar tt = submenu.index(\"_\");\r\n\t\tif (tt) {\r\n\t\t\tsubmenu.splicer(tt, 2, \"<u>\" ^ submenu[tt + 1] ^ \"<\/u>\");\r\n\t\t}\r\n\r\n\t\ttx ^= FM ^ \"<a>\" ^ submenu ^ \"<\/a>\";\r\n\t\t\/\/submenus are same class as menus\r\n\t\ttx ^= FM ^ \" <div class=\\\"menu\\\">\";\r\n\r\n\t} else if (mode == \"ADDITEM\") {\r\n\r\n\t\tvar item = arg3;\r\n\t\t#define href arg4\r\n\t\t\/\/equate onclick to arg5\r\n\r\n\t\t\/\/<a href=\"..\/media\/schedules.htm?filename=PLANS&amp;plantype=1&ratings=1\"><u>M<\/u>onth Plan File<\/a><br \/>\r\n\t\tvar props = \"\";\r\n\t\t\/\/if unassigned(id) else props:=' id=':quote(id)\r\n\t\t\/\/if unassigned(onclick) else props:=' onclick = ':quote(onclick)\r\n\t\tif (not(arg5.unassigned())) {\r\n\t\t\tprops ^= \" onclick = \" ^ (arg5.quote());\r\n\t\t}\r\n\r\n\t\t\/\/convert _x to <u>x<\/u> to indicate keyboard shortcut\r\n\t\tvar tt = item.index(\"_\");\r\n\t\tif (tt) {\r\n\t\t\titem.splicer(tt, 2, \"<u>\" ^ item[tt + 1] ^ \"<\/u>\");\r\n\t\t}\r\n\r\n\t\ttx ^= FM ^ \" <a\" ^ props ^ \" href=\\\"\" ^ href ^ \"\\\">\" ^ item ^ \"<\/a><br \/>\";\r\n\r\n\t} else if (mode == \"ADDSEP\") {\r\n\r\n\t\ttx ^= FM ^ \" <hr class=\\\"menu_hr\\\" \/>\";\r\n\r\n\t} else if (mode == \"ENDSUBMENU\") {\r\n\r\n\t\ttx ^= FM ^ \"<\/div>\";\r\n\t\ttx ^= FM ^ \"<br \/>\";\r\n\r\n\t} else if (mode == \"ENDMENU\") {\r\n\r\n\t\ttx ^= FM ^ \"<\/div>\";\r\n\r\n\t} else if (mode == \"EXITMENUS\") {\r\n\r\n\t\ttx ^= FM ^ \"<button tabindex=\\\"-1\\\" style=\\\"background-color: white; height: 1px; width: 1px; border-style: none; margin: 0; padding: 0\\\" accesskey=\\\"M\\\"\";\r\n\t\tvar onclickx = \"javascript:if (typeof menuonmouseover!=\\'undefined\\') menuonmouseover(\\'click\\')\";\r\n\t\ttx ^= FM ^ \" onclick=\" ^ (onclickx.quote()) ^ \">\";\r\n\t\ttx ^= FM ^ \"<\/button>\";\r\n\t\ttx ^= FM ^ \"<\/body>\";\r\n\r\n\t} else {\r\n\t\tcall sysmsg(mode.quote() ^ \" invalid mode in MENU.SUBS\");\r\n\t}\r\n\r\n\t\/\/prevent href being carried forwards to ADDITEM which use onclick instead\r\n\targ4 = \"\";\r\n\r\n\treturn 0;\r\n}\r\n\r\nlibraryexit()\r\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n    filename:   CEGuiOgreBaseApplication.cpp\n    created:    9\/3\/2004\n    author:     Paul D Turner\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2009 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#ifdef HAVE_CONFIG_H\n#   include \"config.h\"\n#endif\n\n#if defined(__linux__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__HAIKU__)\n# include <unistd.h>\n#endif\n\n\/\/ this controls conditional compile of file for Apple\n#include \"CEGUISamplesConfig.h\"\n#ifdef CEGUI_SAMPLES_USE_OGRE\n\n#include <OgreWindowEventUtilities.h>\n#include \"CEGuiOgreBaseApplication.h\"\n#include \"SamplesFrameworkBase.h\"\n#include \"CEGUI\/RendererModules\/Ogre\/ImageCodec.h\"\n#include \"CEGUI\/RendererModules\/Ogre\/ResourceProvider.h\"\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGuiOgreBaseApplication::CEGuiOgreBaseApplication() :\n    d_ogreRoot(0),\n    d_initialised(false),\n    d_frameListener(0),\n    d_windowEventListener(0)\n{\n    using namespace Ogre;\n    \n#ifdef DEBUG\n    Ogre::String pluginsFileName = \"plugins_d.cfg\";\n#else\n    Ogre::String pluginsFileName = \"plugins.cfg\";\n#endif\n\n    d_ogreRoot = new Root(pluginsFileName);\n\n    if (d_ogreRoot->showConfigDialog())\n    {\n        \/\/ initialise system according to user options.\n        d_window = d_ogreRoot->initialise(true);\n\n        \/\/ Create the scene manager\n        SceneManager* sm = d_ogreRoot->\n            createSceneManager(ST_GENERIC, \"SampleSceneMgr\");\n        \/\/ Create and initialise the camera\n        d_camera = sm->createCamera(\"SampleCam\");\n        d_camera->setPosition(Vector3(0,0,500));\n        d_camera->lookAt(Vector3(0,0,-300));\n        d_camera->setNearClipDistance(5);\n\n        \/\/ Create a viewport covering whole window\n        Viewport* vp = d_window->addViewport(d_camera);\n        vp->setBackgroundColour(ColourValue(1.0f, 1.0f, 1.0f, 1.0f));\n        \/\/ Update the camera aspect ratio to that of the viewport\n        d_camera->setAspectRatio(Real(vp->getActualWidth()) \/ Real(vp->getActualHeight()));\n\n        \/\/ create ogre renderer, image codec and resource provider.\n        CEGUI::OgreRenderer& renderer = CEGUI::OgreRenderer::create();\n        d_renderer = &renderer;\n        d_imageCodec = &renderer.createOgreImageCodec();\n        d_resourceProvider = &renderer.createOgreResourceProvider();\n\n        \/\/ create frame listener\n        d_frameListener= new CEGuiDemoFrameListener(this, d_sampleApp, d_window, d_camera);\n        d_ogreRoot->addFrameListener(d_frameListener);\n\n        \/\/ add a listener for OS framework window events (for resizing)\n        d_windowEventListener = new WndEvtListener(d_frameListener->getOISMouse());\n        WindowEventUtilities::addWindowEventListener(d_window,\n                                                     d_windowEventListener);\n\n      \n        d_ogreRoot->addFrameListener(this);\n        renderer.setRenderingEnabled(false);\n\n        d_initialised = true;\n    }\n    else\n    {\n        \/\/ aborted.  Clean up and set root to 0 so when app attempts to run it\n        \/\/ knows what happened here.\n        delete d_ogreRoot;\n        d_ogreRoot = 0;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGuiOgreBaseApplication::~CEGuiOgreBaseApplication()\n{\n    delete d_frameListener;\n\n    CEGUI::OgreRenderer& renderer =\n        *static_cast<CEGUI::OgreRenderer*>(d_renderer);\n    renderer.destroyOgreResourceProvider(\n        *static_cast<CEGUI::OgreResourceProvider*>(d_resourceProvider));\n    renderer.destroyOgreImageCodec(\n        *static_cast<CEGUI::OgreImageCodec*>(d_imageCodec));\n    CEGUI::OgreRenderer::destroy(renderer);\n\n    delete d_ogreRoot;\n    delete d_windowEventListener;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::run()\n{\n    \/\/ if base initialisation failed or app was cancelled by user, bail out now.\n    if (!d_ogreRoot || !d_initialised)\n        return;\n\n    Ogre::ResourceGroupManager::getSingleton().initialiseAllResourceGroups();\n    d_sampleApp->initialise();\n\n    \/\/ start rendering via Ogre3D engine.\n    CEGUI_TRY\n    {\n        d_ogreRoot->startRendering();\n    }\n    CEGUI_CATCH(...)\n    {}\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::destroyWindow()\n{\n\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::beginRendering(const float elapsed)\n{\n    \/\/ this is nover called under Ogre, since we're not in control of the\n    \/\/ rendering process.\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::endRendering()\n{\n    \/\/ this is nover called under Ogre, since we're not in control of the\n    \/\/ rendering process.\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::initialiseResourceGroupDirectories()\n{\n    using namespace Ogre;\n    ResourceGroupManager& rgm = ResourceGroupManager::getSingleton();\n\n    \/\/ add resource groups that we use\n    rgm.createResourceGroup(\"animations\");\n    rgm.createResourceGroup(\"imagesets\");\n    rgm.createResourceGroup(\"fonts\");\n    rgm.createResourceGroup(\"layouts\");\n    rgm.createResourceGroup(\"schemes\");\n    rgm.createResourceGroup(\"looknfeels\");\n    rgm.createResourceGroup(\"lua_scripts\");\n    rgm.createResourceGroup(\"schemas\");\n\n\n    \/\/ add CEGUI sample framework datafile dirs as resource locations\n    ResourceGroupManager::getSingleton().addResourceLocation(\".\/\", \"FileSystem\");\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    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"schemes\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"imagesets\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"imagesets\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"fonts\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"fonts\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"layouts\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"layouts\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"looknfeel\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"looknfeels\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"lua_scripts\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"lua_scripts\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"animations\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"animations\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"xml_schemas\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"schemas\");\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::doFrameUpdate(const float elapsed)\n{\n    CEGUI::System& gui_system(CEGUI::System::getSingleton());\n\n    gui_system.injectTimePulse(elapsed);\n    d_sampleApp->update(static_cast<float>(elapsed));\n\n    updateFPS(elapsed);\n    updateLogo(elapsed);\n}\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiOgreBaseApplication::frameRenderingQueued(const Ogre::FrameEvent& args)\n{\n    renderSingleFrame(static_cast<float>(args.timeSinceLastFrame));\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\nbool CEGuiOgreBaseApplication::isInitialised()\n{\n    return d_initialised;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*******************************************************************************\n    Start of CEGuiDemoFrameListener mehods\n*******************************************************************************\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGuiDemoFrameListener::CEGuiDemoFrameListener(CEGuiOgreBaseApplication* baseApp, SamplesFrameworkBase*& sampleApp,\n    Ogre::RenderWindow* window, Ogre::Camera* camera, bool useBufferedInputKeys, bool useBufferedInputMouse)\n    : d_baseApp(baseApp),\n    d_sampleApp(sampleApp)\n{\n    \/\/ OIS setup\n    OIS::ParamList paramList;\n    size_t windowHnd = 0;\n    std::ostringstream windowHndStr;\n\n    \/\/ get window handle\n    window->getCustomAttribute(\"WINDOW\", &windowHnd);\n\n    \/\/ fill param list\n    windowHndStr << (unsigned int)windowHnd;\n    paramList.insert(std::make_pair(std::string(\"WINDOW\"), windowHndStr.str()));\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_LINUX && defined (DEBUG)\n    paramList.insert(std::make_pair(std::string(\"x11_keyboard_grab\"), \"false\"));\n    paramList.insert(std::make_pair(std::string(\"x11_mouse_grab\"), \"false\"));\n    paramList.insert(std::make_pair(std::string(\"x11_mouse_hide\"), \"false\"));\n#endif\n\n    \/\/ create input system\n    d_inputManager = OIS::InputManager::createInputSystem(paramList);\n\n    \/\/ create buffered keyboard\n#ifdef CEGUI_OLD_OIS_API\n    if (d_inputManager->numKeyboards() > 0)\n#else\n    if (d_inputManager->getNumberOfDevices(OIS::OISKeyboard) > 0)\n#endif\n    {\n        d_keyboard = static_cast<OIS::Keyboard*>(d_inputManager->createInputObject(OIS::OISKeyboard, true));\n        d_keyboard->setEventCallback(this);\n    }\n\n    \/\/ create buffered mouse\n#ifdef CEGUI_OLD_OIS_API\n    if (d_inputManager->numMice() > 0)\n#else\n    if (d_inputManager->getNumberOfDevices(OIS::OISMouse) > 0)\n#endif\n    {\n        d_mouse = static_cast<OIS::Mouse*>(d_inputManager->createInputObject(OIS::OISMouse, true));\n        d_mouse->setEventCallback(this);\n\n        unsigned int width, height, depth;\n        int left, top;\n\n        window->getMetrics(width, height, depth, left, top);\n        const OIS::MouseState& mouseState = d_mouse->getMouseState();\n        mouseState.width = width;\n        mouseState.height = height;\n    }\n\n    \/\/ store inputs we want to make use of\n    d_camera = camera;\n    d_window = window;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGuiDemoFrameListener::~CEGuiDemoFrameListener()\n{\n    if (d_inputManager)\n    {\n        d_inputManager->destroyInputObject(d_mouse);\n        d_inputManager->destroyInputObject(d_keyboard);\n        OIS::InputManager::destroyInputSystem(d_inputManager);\n    }\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::frameStarted(const Ogre::FrameEvent& evt)\n{\n    if(d_window->isClosed() || d_sampleApp->isQuitting())\n        return false;\n\n    static_cast<CEGuiOgreBaseApplication*>(d_baseApp)->\n        doFrameUpdate(static_cast<float>(evt.timeSinceLastFrame));\n\n    \/\/ update input system\n    if (d_mouse)\n        d_mouse->capture();\n    if (d_keyboard)\n        d_keyboard->capture();\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::frameEnded(const Ogre::FrameEvent& evt)\n{\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::mouseMoved(const OIS::MouseEvent &e)\n{\n    d_sampleApp->injectMousePosition(e.state.X.abs, e.state.Y.abs);\n    d_sampleApp->injectMouseWheelChange(e.state.Z.rel \/ 120.0f);\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::keyPressed(const OIS::KeyEvent &e)\n{\n    d_sampleApp->injectKeyDown(static_cast<CEGUI::Key::Scan>(e.key));\n    d_sampleApp->injectChar(e.text);\n\n    return true;\n}\n\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::keyReleased(const OIS::KeyEvent &e)\n{\n    d_sampleApp->injectKeyUp(static_cast<CEGUI::Key::Scan>(e.key));\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::mousePressed(const OIS::MouseEvent &e, OIS::MouseButtonID id)\n{\n    d_sampleApp->injectMouseButtonDown(convertOISButtonToCegui(id));\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::mouseReleased(const OIS::MouseEvent &e, OIS::MouseButtonID id)\n{\n   d_sampleApp->injectMouseButtonUp(convertOISButtonToCegui(id));\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGUI::MouseButton CEGuiDemoFrameListener::convertOISButtonToCegui(int buttonID)\n{\n   using namespace OIS;\n\n   switch (buttonID)\n    {\n   case OIS::MB_Left:\n        return CEGUI::LeftButton;\n   case OIS::MB_Right:\n        return CEGUI::RightButton;\n   case OIS::MB_Middle:\n        return CEGUI::MiddleButton;\n    default:\n        return CEGUI::LeftButton;\n   }\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOIS::Mouse* CEGuiDemoFrameListener::getOISMouse()\n{\n    return d_mouse;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*******************************************************************************\n    Start of WndEvtListener member functions\n*******************************************************************************\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/----------------------------------------------------------------------------\/\/\nWndEvtListener::WndEvtListener(OIS::Mouse* mouse) :\n    d_mouse(mouse)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid WndEvtListener::windowResized(Ogre::RenderWindow* rw)\n{\n    CEGUI::System* const sys = CEGUI::System::getSingletonPtr();\n    if (sys)\n        sys->notifyDisplaySizeChanged(\n        CEGUI::Sizef(static_cast<float>(rw->getWidth()),\n        static_cast<float>(rw->getHeight())));\n\n\n    const OIS::MouseState& mouseState = d_mouse->getMouseState();\n    mouseState.width = rw->getWidth();\n    mouseState.height = rw->getHeight();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n#endif\n\n\n\n<commit_msg>FIX: OgreBaseAPP update fix<commit_after>\/***********************************************************************\n    filename:   CEGuiOgreBaseApplication.cpp\n    created:    9\/3\/2004\n    author:     Paul D Turner\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2009 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#ifdef HAVE_CONFIG_H\n#   include \"config.h\"\n#endif\n\n#if defined(__linux__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__HAIKU__)\n# include <unistd.h>\n#endif\n\n\/\/ this controls conditional compile of file for Apple\n#include \"CEGUISamplesConfig.h\"\n#ifdef CEGUI_SAMPLES_USE_OGRE\n\n#include <OgreWindowEventUtilities.h>\n#include \"CEGuiOgreBaseApplication.h\"\n#include \"SamplesFrameworkBase.h\"\n#include \"CEGUI\/RendererModules\/Ogre\/ImageCodec.h\"\n#include \"CEGUI\/RendererModules\/Ogre\/ResourceProvider.h\"\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGuiOgreBaseApplication::CEGuiOgreBaseApplication() :\n    d_ogreRoot(0),\n    d_initialised(false),\n    d_frameListener(0),\n    d_windowEventListener(0)\n{\n    using namespace Ogre;\n    \n#ifdef DEBUG\n    Ogre::String pluginsFileName = \"plugins_d.cfg\";\n#else\n    Ogre::String pluginsFileName = \"plugins.cfg\";\n#endif\n\n    d_ogreRoot = new Root(pluginsFileName);\n\n    if (d_ogreRoot->showConfigDialog())\n    {\n        \/\/ initialise system according to user options.\n        d_window = d_ogreRoot->initialise(true);\n\n        \/\/ Create the scene manager\n        SceneManager* sm = d_ogreRoot->\n            createSceneManager(ST_GENERIC, \"SampleSceneMgr\");\n        \/\/ Create and initialise the camera\n        d_camera = sm->createCamera(\"SampleCam\");\n        d_camera->setPosition(Vector3(0,0,500));\n        d_camera->lookAt(Vector3(0,0,-300));\n        d_camera->setNearClipDistance(5);\n\n        \/\/ Create a viewport covering whole window\n        Viewport* vp = d_window->addViewport(d_camera);\n        vp->setBackgroundColour(ColourValue(1.0f, 1.0f, 1.0f, 1.0f));\n        \/\/ Update the camera aspect ratio to that of the viewport\n        d_camera->setAspectRatio(Real(vp->getActualWidth()) \/ Real(vp->getActualHeight()));\n\n        \/\/ create ogre renderer, image codec and resource provider.\n        CEGUI::OgreRenderer& renderer = CEGUI::OgreRenderer::create();\n        d_renderer = &renderer;\n        d_imageCodec = &renderer.createOgreImageCodec();\n        d_resourceProvider = &renderer.createOgreResourceProvider();\n\n        \/\/ create frame listener\n        d_frameListener= new CEGuiDemoFrameListener(this, d_sampleApp, d_window, d_camera);\n        d_ogreRoot->addFrameListener(d_frameListener);\n\n        \/\/ add a listener for OS framework window events (for resizing)\n        d_windowEventListener = new WndEvtListener(d_frameListener->getOISMouse());\n        WindowEventUtilities::addWindowEventListener(d_window,\n                                                     d_windowEventListener);\n\n      \n        d_ogreRoot->addFrameListener(this);\n        renderer.setRenderingEnabled(false);\n\n        d_initialised = true;\n    }\n    else\n    {\n        \/\/ aborted.  Clean up and set root to 0 so when app attempts to run it\n        \/\/ knows what happened here.\n        delete d_ogreRoot;\n        d_ogreRoot = 0;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGuiOgreBaseApplication::~CEGuiOgreBaseApplication()\n{\n    delete d_frameListener;\n\n    CEGUI::OgreRenderer& renderer =\n        *static_cast<CEGUI::OgreRenderer*>(d_renderer);\n    renderer.destroyOgreResourceProvider(\n        *static_cast<CEGUI::OgreResourceProvider*>(d_resourceProvider));\n    renderer.destroyOgreImageCodec(\n        *static_cast<CEGUI::OgreImageCodec*>(d_imageCodec));\n    CEGUI::OgreRenderer::destroy(renderer);\n\n    delete d_ogreRoot;\n    delete d_windowEventListener;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::run()\n{\n    \/\/ if base initialisation failed or app was cancelled by user, bail out now.\n    if (!d_ogreRoot || !d_initialised)\n        return;\n\n    Ogre::ResourceGroupManager::getSingleton().initialiseAllResourceGroups();\n    d_sampleApp->initialise();\n\n    \/\/ start rendering via Ogre3D engine.\n    CEGUI_TRY\n    {\n        d_ogreRoot->startRendering();\n    }\n    CEGUI_CATCH(...)\n    {}\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::destroyWindow()\n{\n\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::beginRendering(const float elapsed)\n{\n    \/\/ this is nover called under Ogre, since we're not in control of the\n    \/\/ rendering process.\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::endRendering()\n{\n    \/\/ this is nover called under Ogre, since we're not in control of the\n    \/\/ rendering process.\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::initialiseResourceGroupDirectories()\n{\n    using namespace Ogre;\n    ResourceGroupManager& rgm = ResourceGroupManager::getSingleton();\n\n    \/\/ add resource groups that we use\n    rgm.createResourceGroup(\"animations\");\n    rgm.createResourceGroup(\"imagesets\");\n    rgm.createResourceGroup(\"fonts\");\n    rgm.createResourceGroup(\"layouts\");\n    rgm.createResourceGroup(\"schemes\");\n    rgm.createResourceGroup(\"looknfeels\");\n    rgm.createResourceGroup(\"lua_scripts\");\n    rgm.createResourceGroup(\"schemas\");\n\n\n    \/\/ add CEGUI sample framework datafile dirs as resource locations\n    ResourceGroupManager::getSingleton().addResourceLocation(\".\/\", \"FileSystem\");\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    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"schemes\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"imagesets\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"imagesets\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"fonts\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"fonts\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"layouts\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"layouts\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"looknfeel\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"looknfeels\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"lua_scripts\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"lua_scripts\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"animations\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"animations\");\n    sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"xml_schemas\/\");\n    ResourceGroupManager::getSingleton().addResourceLocation(resourcePath, \"FileSystem\", \"schemas\");\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid CEGuiOgreBaseApplication::doFrameUpdate(const float elapsed)\n{\n}\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiOgreBaseApplication::frameRenderingQueued(const Ogre::FrameEvent& args)\n{\n    renderSingleFrame(static_cast<float>(args.timeSinceLastFrame));\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\nbool CEGuiOgreBaseApplication::isInitialised()\n{\n    return d_initialised;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*******************************************************************************\n    Start of CEGuiDemoFrameListener mehods\n*******************************************************************************\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGuiDemoFrameListener::CEGuiDemoFrameListener(CEGuiOgreBaseApplication* baseApp, SamplesFrameworkBase*& sampleApp,\n    Ogre::RenderWindow* window, Ogre::Camera* camera, bool useBufferedInputKeys, bool useBufferedInputMouse)\n    : d_baseApp(baseApp),\n    d_sampleApp(sampleApp)\n{\n    \/\/ OIS setup\n    OIS::ParamList paramList;\n    size_t windowHnd = 0;\n    std::ostringstream windowHndStr;\n\n    \/\/ get window handle\n    window->getCustomAttribute(\"WINDOW\", &windowHnd);\n\n    \/\/ fill param list\n    windowHndStr << (unsigned int)windowHnd;\n    paramList.insert(std::make_pair(std::string(\"WINDOW\"), windowHndStr.str()));\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_LINUX && defined (DEBUG)\n    paramList.insert(std::make_pair(std::string(\"x11_keyboard_grab\"), \"false\"));\n    paramList.insert(std::make_pair(std::string(\"x11_mouse_grab\"), \"false\"));\n    paramList.insert(std::make_pair(std::string(\"x11_mouse_hide\"), \"false\"));\n#endif\n\n    \/\/ create input system\n    d_inputManager = OIS::InputManager::createInputSystem(paramList);\n\n    \/\/ create buffered keyboard\n#ifdef CEGUI_OLD_OIS_API\n    if (d_inputManager->numKeyboards() > 0)\n#else\n    if (d_inputManager->getNumberOfDevices(OIS::OISKeyboard) > 0)\n#endif\n    {\n        d_keyboard = static_cast<OIS::Keyboard*>(d_inputManager->createInputObject(OIS::OISKeyboard, true));\n        d_keyboard->setEventCallback(this);\n    }\n\n    \/\/ create buffered mouse\n#ifdef CEGUI_OLD_OIS_API\n    if (d_inputManager->numMice() > 0)\n#else\n    if (d_inputManager->getNumberOfDevices(OIS::OISMouse) > 0)\n#endif\n    {\n        d_mouse = static_cast<OIS::Mouse*>(d_inputManager->createInputObject(OIS::OISMouse, true));\n        d_mouse->setEventCallback(this);\n\n        unsigned int width, height, depth;\n        int left, top;\n\n        window->getMetrics(width, height, depth, left, top);\n        const OIS::MouseState& mouseState = d_mouse->getMouseState();\n        mouseState.width = width;\n        mouseState.height = height;\n    }\n\n    \/\/ store inputs we want to make use of\n    d_camera = camera;\n    d_window = window;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGuiDemoFrameListener::~CEGuiDemoFrameListener()\n{\n    if (d_inputManager)\n    {\n        d_inputManager->destroyInputObject(d_mouse);\n        d_inputManager->destroyInputObject(d_keyboard);\n        OIS::InputManager::destroyInputSystem(d_inputManager);\n    }\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::frameStarted(const Ogre::FrameEvent& evt)\n{\n    if(d_window->isClosed() || d_sampleApp->isQuitting())\n        return false;\n\n    static_cast<CEGuiOgreBaseApplication*>(d_baseApp)->\n        doFrameUpdate(static_cast<float>(evt.timeSinceLastFrame));\n\n    \/\/ update input system\n    if (d_mouse)\n        d_mouse->capture();\n    if (d_keyboard)\n        d_keyboard->capture();\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::frameEnded(const Ogre::FrameEvent& evt)\n{\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::mouseMoved(const OIS::MouseEvent &e)\n{\n    d_sampleApp->injectMousePosition(e.state.X.abs, e.state.Y.abs);\n    d_sampleApp->injectMouseWheelChange(e.state.Z.rel \/ 120.0f);\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::keyPressed(const OIS::KeyEvent &e)\n{\n    d_sampleApp->injectKeyDown(static_cast<CEGUI::Key::Scan>(e.key));\n    d_sampleApp->injectChar(e.text);\n\n    return true;\n}\n\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::keyReleased(const OIS::KeyEvent &e)\n{\n    d_sampleApp->injectKeyUp(static_cast<CEGUI::Key::Scan>(e.key));\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::mousePressed(const OIS::MouseEvent &e, OIS::MouseButtonID id)\n{\n    d_sampleApp->injectMouseButtonDown(convertOISButtonToCegui(id));\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool CEGuiDemoFrameListener::mouseReleased(const OIS::MouseEvent &e, OIS::MouseButtonID id)\n{\n   d_sampleApp->injectMouseButtonUp(convertOISButtonToCegui(id));\n\n    return true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nCEGUI::MouseButton CEGuiDemoFrameListener::convertOISButtonToCegui(int buttonID)\n{\n   using namespace OIS;\n\n   switch (buttonID)\n    {\n   case OIS::MB_Left:\n        return CEGUI::LeftButton;\n   case OIS::MB_Right:\n        return CEGUI::RightButton;\n   case OIS::MB_Middle:\n        return CEGUI::MiddleButton;\n    default:\n        return CEGUI::LeftButton;\n   }\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOIS::Mouse* CEGuiDemoFrameListener::getOISMouse()\n{\n    return d_mouse;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*******************************************************************************\n    Start of WndEvtListener member functions\n*******************************************************************************\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/----------------------------------------------------------------------------\/\/\nWndEvtListener::WndEvtListener(OIS::Mouse* mouse) :\n    d_mouse(mouse)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid WndEvtListener::windowResized(Ogre::RenderWindow* rw)\n{\n    CEGUI::System* const sys = CEGUI::System::getSingletonPtr();\n    if (sys)\n        sys->notifyDisplaySizeChanged(\n        CEGUI::Sizef(static_cast<float>(rw->getWidth()),\n        static_cast<float>(rw->getHeight())));\n\n\n    const OIS::MouseState& mouseState = d_mouse->getMouseState();\n    mouseState.width = rw->getWidth();\n    mouseState.height = rw->getHeight();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n#endif\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2008 by Tommi Rantala <tt.rantala@gmail.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\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\/* Implements a multi-way mergesort based on the loser tree.\n *\/\n\n#include \"routine.h\"\n#include \"util\/debug.h\"\n#include <cassert>\n#include <cstring>\n#include <boost\/array.hpp>\n\nstatic inline int\ncmp(const unsigned char* a, const unsigned char* b)\n{\n\tassert(a != 0);\n\tassert(b != 0);\n\treturn strcmp(reinterpret_cast<const char*>(a),\n\t              reinterpret_cast<const char*>(b));\n}\n\n#include \"losertree.h\"\n\nvoid mergesort_4way(unsigned char**, size_t, unsigned char**);\n\ntemplate <unsigned K>\nstatic void\nmergesort_losertree(unsigned char** strings, size_t n, unsigned char** tmp)\n{\n\tif (n < 0x10000) {\n\t\tmergesort_4way(strings, n, tmp);\n\t\treturn;\n\t}\n\tdebug() << __func__ << \"(), n=\"<<n<<\"\\n\";\n\tconst size_t split = size_t(double(n) \/ double(K));\n\tboost::array<std::pair<unsigned char**, size_t>, K> ranges;\n\tfor (unsigned i=0; i < K-1; ++i) {\n\t\tranges[i] = std::make_pair(strings+i*split, split);\n\t}\n\tranges[K-1] = std::make_pair(strings+(K-1)*split, n-(K-1)*split);\n\tfor (unsigned i=0; i < K; ++i) {\n\t\tmergesort_losertree<K>(ranges[i].first, ranges[i].second,\n\t\t\t\ttmp+(ranges[i].first-strings));\n\t}\n\tunsigned char** result = tmp;\n\tloser_tree<unsigned char*> tree(ranges.begin(), ranges.end());\n\twhile (tree._nonempty_streams) { *result++ = tree.min(); }\n\t(void) memcpy(strings, tmp, n*sizeof(unsigned char*));\n}\n\nvoid mergesort_losertree_64way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<64>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_128way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<128>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_256way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<256>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_512way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<512>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_1024way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<1024>(strings, n, tmp);\n\tfree(tmp);\n}\n\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_64way,\n\t\t\"64way loser tree based mergesort\")\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_128way,\n\t\t\"128way loser tree based mergesort\")\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_256way,\n\t\t\"256way loser tree based mergesort\")\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_512way,\n\t\t\"512way loser tree based mergesort\")\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_1024way,\n\t\t\"1024way loser tree based mergesort\")\n<commit_msg>Parallel losertree based mergesort routines<commit_after>\/*\n * Copyright 2008 by Tommi Rantala <tt.rantala@gmail.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\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\/* Implements a multi-way mergesort based on the loser tree.\n *\/\n\n#include \"routine.h\"\n#include \"util\/debug.h\"\n#include <cassert>\n#include <cstring>\n#include <boost\/array.hpp>\n\nstatic inline int\ncmp(const unsigned char* a, const unsigned char* b)\n{\n\tassert(a != 0);\n\tassert(b != 0);\n\treturn strcmp(reinterpret_cast<const char*>(a),\n\t              reinterpret_cast<const char*>(b));\n}\n\n#include \"losertree.h\"\n\nvoid mergesort_4way(unsigned char**, size_t, unsigned char**);\n\ntemplate <unsigned K>\nstatic void\nmergesort_losertree(unsigned char** strings, size_t n, unsigned char** tmp)\n{\n\tif (n < 0x10000) {\n\t\tmergesort_4way(strings, n, tmp);\n\t\treturn;\n\t}\n\tdebug() << __func__ << \"(), n=\"<<n<<\"\\n\";\n\tconst size_t split = size_t(double(n) \/ double(K));\n\tboost::array<std::pair<unsigned char**, size_t>, K> ranges;\n\tfor (unsigned i=0; i < K-1; ++i) {\n\t\tranges[i] = std::make_pair(strings+i*split, split);\n\t}\n\tranges[K-1] = std::make_pair(strings+(K-1)*split, n-(K-1)*split);\n\tfor (unsigned i=0; i < K; ++i) {\n\t\tmergesort_losertree<K>(ranges[i].first, ranges[i].second,\n\t\t\t\ttmp+(ranges[i].first-strings));\n\t}\n\tunsigned char** result = tmp;\n\tloser_tree<unsigned char*> tree(ranges.begin(), ranges.end());\n\twhile (tree._nonempty_streams) { *result++ = tree.min(); }\n\t(void) memcpy(strings, tmp, n*sizeof(unsigned char*));\n}\n\nvoid mergesort_losertree_64way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<64>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_128way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<128>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_256way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<256>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_512way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<512>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_1024way(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree<1024>(strings, n, tmp);\n\tfree(tmp);\n}\n\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_64way,\n\t\t\"64way loser tree based mergesort\")\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_128way,\n\t\t\"128way loser tree based mergesort\")\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_256way,\n\t\t\"256way loser tree based mergesort\")\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_512way,\n\t\t\"512way loser tree based mergesort\")\nROUTINE_REGISTER_SINGLECORE(mergesort_losertree_1024way,\n\t\t\"1024way loser tree based mergesort\")\n\nvoid mergesort_4way_parallel(unsigned char**, size_t, unsigned char**);\n\ntemplate <unsigned K>\nstatic void\nmergesort_losertree_parallel(unsigned char** strings, size_t n, unsigned char** tmp)\n{\n\tif (n < 0x10000) {\n\t\tmergesort_4way_parallel(strings, n, tmp);\n\t\treturn;\n\t}\n\tdebug() << __func__ << \"(), n=\"<<n<<\"\\n\";\n\tconst size_t split = size_t(double(n) \/ double(K));\n\tboost::array<std::pair<unsigned char**, size_t>, K> ranges;\n\tfor (unsigned i=0; i < K-1; ++i) {\n\t\tranges[i] = std::make_pair(strings+i*split, split);\n\t}\n\tranges[K-1] = std::make_pair(strings+(K-1)*split, n-(K-1)*split);\n#pragma omp parallel for\n\tfor (unsigned i=0; i < K; ++i) {\n\t\tmergesort_losertree_parallel<K>(ranges[i].first, ranges[i].second,\n\t\t\t\ttmp+(ranges[i].first-strings));\n\t}\n\tunsigned char** result = tmp;\n\tloser_tree<unsigned char*> tree(ranges.begin(), ranges.end());\n\twhile (tree._nonempty_streams) { *result++ = tree.min(); }\n\t(void) memcpy(strings, tmp, n*sizeof(unsigned char*));\n}\n\nvoid mergesort_losertree_64way_parallel(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree_parallel<64>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_128way_parallel(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree_parallel<128>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_256way_parallel(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree_parallel<256>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_512way_parallel(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree_parallel<512>(strings, n, tmp);\n\tfree(tmp);\n}\nvoid mergesort_losertree_1024way_parallel(unsigned char** strings, size_t n)\n{\n\tunsigned char** tmp = static_cast<unsigned char**>(\n\t\t\tmalloc(n*sizeof(unsigned char*)));\n\tmergesort_losertree_parallel<1024>(strings, n, tmp);\n\tfree(tmp);\n}\n\nROUTINE_REGISTER_MULTICORE(mergesort_losertree_64way_parallel,\n\t\t\"Parallel 64way loser tree based mergesort\")\nROUTINE_REGISTER_MULTICORE(mergesort_losertree_128way_parallel,\n\t\t\"Parallel 128way loser tree based mergesort\")\nROUTINE_REGISTER_MULTICORE(mergesort_losertree_256way_parallel,\n\t\t\"Parallel 256way loser tree based mergesort\")\nROUTINE_REGISTER_MULTICORE(mergesort_losertree_512way_parallel,\n\t\t\"Parallel 512way loser tree based mergesort\")\nROUTINE_REGISTER_MULTICORE(mergesort_losertree_1024way_parallel,\n\t\t\"Parallel 1024way loser tree based mergesort\")\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: appmisc.cxx,v $\n *\n *  $Revision: 1.57 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 22:56: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_sfx2.hxx\"\n\n#ifndef _SV_STATUS_HXX\n#include <vcl\/status.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _VOS_PROCESS_HXX \/\/autogen\n#include <vos\/process.hxx>\n#endif\n#ifndef _XCEPTION_HXX_\n#include <vos\/xception.hxx>\n#endif\n#ifndef _SFX_WHITER_HXX \/\/autogen\n#include <svtools\/whiter.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX \/\/autogen\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _FILTER_HXX \/\/autogen\n#include <svtools\/filter.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_INTERNALOPTIONS_HXX\n#include <svtools\/internaloptions.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#include <svtools\/pathoptions.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_REGISTRY_INVALIDREGISTRYEXCEPTION_HPP_\n#include <com\/sun\/star\/registry\/InvalidRegistryException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PropertyValue_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XFRAME_HPP_\n#include <com\/sun\/star\/frame\/XFrame.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XURLTRANSFORMER_HPP_\n#include <com\/sun\/star\/util\/XURLTransformer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XFRAMESSUPPLIER_HPP_\n#include <com\/sun\/star\/frame\/XFramesSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n#ifndef _CONFIG_HXX\n#include <tools\/config.hxx>\n#endif\n#include <tools\/rcid.h>\n#include <vos\/mutex.hxx>\n#ifndef GCC\n#endif\n#ifndef _UTL_CONFIGMGR_HXX_\n#include <unotools\/configmgr.hxx>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XDESKTOP_HPP_\n#include <com\/sun\/star\/frame\/XDesktop.hpp>\n#endif\n\n#include <unotools\/ucbstreamhelper.hxx>\n#include <framework\/menuconfiguration.hxx>\n#include <comphelper\/processfactory.hxx>\n#include <unotools\/localfilehelper.hxx>\n#include <unotools\/bootstrap.hxx>\n#include <svtools\/moduleoptions.hxx>\n#include <osl\/file.hxx>\n\n#include \"sfxresid.hxx\"\n#include <sfx2\/app.hxx>\n#include \"appdata.hxx\"\n#include \"arrdecl.hxx\"\n#include <sfx2\/tbxctrl.hxx>\n#include \"stbitem.hxx\"\n#include <sfx2\/mnuitem.hxx>\n#include <sfx2\/docfac.hxx>\n#include <sfx2\/docfile.hxx>\n#include <sfx2\/docfilt.hxx>\n#include <sfx2\/request.hxx>\n#include <sfx2\/bindings.hxx>\n#include <sfx2\/dispatch.hxx>\n#include \"workwin.hxx\"\n#include \"intro.hxx\"\n#include <sfx2\/fcontnr.hxx>\n#include \"sfxlocal.hrc\"\n#include <sfx2\/sfx.hrc>\n#include \"app.hrc\"\n#include <sfx2\/templdlg.hxx>\n#include <sfx2\/module.hxx>\n#include <sfx2\/msgpool.hxx>\n#include <sfx2\/topfrm.hxx>\n#include \"openflag.hxx\"\n#include <sfx2\/viewsh.hxx>\n#include <sfx2\/objface.hxx>\n#include \"helper.hxx\"   \/\/ SfxContentHelper::Kill()\n\nusing namespace ::vos;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::util;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::container;\n\n\/\/===================================================================\n\nSV_IMPL_PTRARR( SfxTbxCtrlFactArr_Impl, SfxTbxCtrlFactory* );\nSV_IMPL_PTRARR( SfxStbCtrlFactArr_Impl, SfxStbCtrlFactory* );\nSV_IMPL_PTRARR( SfxMenuCtrlFactArr_Impl, SfxMenuCtrlFactory* );\nSV_IMPL_PTRARR( SfxChildWinFactArr_Impl, SfxChildWinFactory* );\nSV_IMPL_PTRARR( SfxModuleArr_Impl, SfxModule* );\n\n\/\/===================================================================\n\n#define SfxApplication\n#include \"sfxslots.hxx\"\n\nclass SfxSpecialConfigError_Impl\n{\n    String aError;\n\npublic:\n\n    SfxSpecialConfigError_Impl( const String& rStr );\n    DECL_LINK( TimerHdl, Timer*);\n};\n\n\nSfxSpecialConfigError_Impl::SfxSpecialConfigError_Impl( const String& rStr ) :\n    aError( rStr )\n{\n    Timer *pTimer = new Timer;\n    pTimer->SetTimeoutHdl( LINK(this, SfxSpecialConfigError_Impl, TimerHdl) );\n    pTimer->SetTimeout( 0 );\n    pTimer->Start();\n}\n\nIMPL_LINK( SfxSpecialConfigError_Impl, TimerHdl, Timer*, pTimer )\n{\n    delete pTimer;\n    ErrorBox( 0, WinBits( WB_OK ) , aError ).Execute();\n    delete this;\n    SFX_APP()->GetAppDispatcher_Impl()->Execute( SID_QUITAPP );\n    return 0L;\n}\n\n\/\/====================================================================\n\n#define SFX_ITEMTYPE_STATBAR             4\n\nSFX_IMPL_INTERFACE(SfxApplication,SfxShell,SfxResId(RID_DESKTOP))\n{\n    SFX_STATUSBAR_REGISTRATION(SfxResId(SFX_ITEMTYPE_STATBAR));\n}\n\n\/\/--------------------------------------------------------------------\n\nvoid SfxApplication::InitializeDisplayName_Impl()\n{\n    SfxAppData_Impl* pAppData = Get_Impl();\n    if ( !pAppData->pLabelResMgr )\n        return;\n\n    String aTitle = Application::GetDisplayName();\n    if ( !aTitle.Len() )\n    {\n        OClearableGuard aGuard( OMutex::getGlobalMutex() );\n\n        \/\/ create version string\n\/*!!! (pb) don't show a version number at the moment\n        USHORT nProductVersion = ProductVersion::GetVersion().ToInt32();\n        String aVersion( String::CreateFromInt32( nProductVersion \/ 10 ) );\n        aVersion += 0x002E ; \/\/ 2Eh ^= '.'\n        aVersion += ( String::CreateFromInt32( nProductVersion % 10 ) );\n*\/\n        \/\/ load application title\n        aTitle = String( ResId( RID_APPTITLE, *pAppData->pLabelResMgr ) );\n        \/\/ merge version into title\n        aTitle.SearchAndReplaceAscii( \"$(VER)\", String() \/*aVersion*\/ );\n\n        aGuard.clear();\n\n#ifndef PRODUCT\n        ::rtl::OUString aDefault;\n        aTitle += DEFINE_CONST_UNICODE(\" [\");\n\n        String aVerId( utl::Bootstrap::getBuildIdData( aDefault ));\n        aTitle += aVerId;\n        aTitle += ']';\n#endif\n        Application::SetDisplayName( aTitle );\n    }\n}\n\n\/\/--------------------------------------------------------------------\nSfxProgress* SfxApplication::GetProgress() const\n\n\/*  [Beschreibung]\n\n    Liefert den f\"ur die gesamte Applikation laufenden SfxProgress\n    oder 0, falls keiner f\"ur die gesamte Applikation l\"auft.\n\n\n    [Querverweise]\n\n    <SfxProgress::GetActiveProgress(SfxViewFrame*)>\n    <SfxViewFrame::GetProgress()const>\n*\/\n\n{\n    return pAppData_Impl->pProgress;\n}\n\n\/\/------------------------------------------------------------------------\n\nSvUShorts* SfxApplication::GetDisabledSlotList_Impl()\n{\n    sal_Bool bError = sal_False;\n    SvUShorts* pList = pAppData_Impl->pDisabledSlotList;\n    if ( !pList )\n    {\n        \/\/ Gibt es eine Slotdatei ?\n        INetURLObject aUserObj( SvtPathOptions().GetUserConfigPath() );\n        aUserObj.insertName( DEFINE_CONST_UNICODE( \"slots.cfg\" ) );\n        SvStream* pStream = ::utl::UcbStreamHelper::CreateStream( aUserObj.GetMainURL( INetURLObject::NO_DECODE ), STREAM_STD_READ );\n        if ( !pStream || pStream->GetError() == ERRCODE_IO_NOTEXISTS )\n        {\n            delete pStream;\n            INetURLObject aObj( SvtPathOptions().GetConfigPath() );\n            aObj.insertName( DEFINE_CONST_UNICODE( \"slots.cfg\" ) );\n            pStream = ::utl::UcbStreamHelper::CreateStream( aObj.GetMainURL( INetURLObject::NO_DECODE ), STREAM_STD_READ );\n        }\n\n        BOOL bSlotsEnabled = SvtInternalOptions().SlotCFGEnabled();\n        BOOL bSlots = ( pStream && !pStream->GetError() );\n        if( bSlots && bSlotsEnabled )\n        {\n            \/\/ SlotDatei einlesen\n            String aTitle;\n            pStream->ReadByteString(aTitle);\n            if ( aTitle.CompareToAscii(\"SfxSlotFile\" ) == COMPARE_EQUAL )\n            {\n                sal_uInt16 nCount;\n                (*pStream) >> nCount;\n                pList = pAppData_Impl->pDisabledSlotList =\n                        new SvUShorts( nCount < 255 ? (sal_Int8) nCount : 255, 255 );\n\n                sal_uInt16 nSlot;\n                for ( sal_uInt16 n=0; n<nCount; n++ )\n                {\n                    (*pStream) >> nSlot;\n                    pList->Insert( nSlot, n );\n                }\n\n                pStream->ReadByteString(aTitle);\n                if ( aTitle.CompareToAscii(\"END\" ) != COMPARE_EQUAL || pStream->GetError() )\n                {\n                    \/\/ Lesen schief gegangen\n                    DELETEZ( pList );\n                    bError = sal_True;\n                }\n            }\n            else\n            {\n                \/\/ Streamerkennung  fehlgeschlagen\n                bError = sal_True;\n            }\n        }\n        else if ( bSlots != bSlotsEnabled )\n        {\n            \/\/ Wenn kein Slotlist-Eintrag, dann darf auch keine SlotDatei\n            \/\/ vorhanden sein\n            bError = sal_True;\n        }\n\n        delete pStream;\n    }\n    else if ( pList == (SvUShorts*) -1L )\n    {\n        return NULL;\n    }\n\n    if ( !pList )\n        pAppData_Impl->pDisabledSlotList = (SvUShorts*) -1L;\n\n    if ( bError )\n    {\n        \/\/ Wenn ein Sloteintrag vorhanden ist, aber keine oder eine fehlerhafte\n        \/\/ SlotDatei, oder aber eine Slotdatei, aber kein Sloteintrag, dann\n        \/\/ gilt dies als fehlerhafte Konfiguration\n        new SfxSpecialConfigError_Impl( String( SfxResId( RID_SPECIALCONFIG_ERROR ) ) );\n    }\n\n       return pList;\n}\n\n\nSfxModule* SfxApplication::GetModule_Impl()\n{\n    SfxModule* pModule = SfxModule::GetActiveModule();\n    if ( !pModule )\n        pModule = SfxModule::GetActiveModule( SfxViewFrame::GetFirst( FALSE ) );\n    if( pModule )\n        return pModule;\n    else\n    {\n        DBG_ERROR( \"No module!\" );\n        return NULL;\n    }\n}\n\nISfxTemplateCommon* SfxApplication::GetCurrentTemplateCommon( SfxBindings& rBindings )\n{\n    if( pAppData_Impl->pTemplateCommon )\n        return pAppData_Impl->pTemplateCommon;\n    SfxChildWindow *pChild = rBindings.GetWorkWindow_Impl()->GetChildWindow_Impl(\n        SfxTemplateDialogWrapper::GetChildWindowId() );\n    if ( pChild )\n        return ((SfxTemplateDialog*) pChild->GetWindow())->GetISfxTemplateCommon();\n    return 0;\n}\n\nSfxCancelManager* SfxApplication::GetCancelManager() const\n{\n    if ( !pAppData_Impl->pCancelMgr )\n        pAppData_Impl->pCancelMgr = new SfxCancelManager;\n    return pAppData_Impl->pCancelMgr;\n}\n\nSfxResourceManager& SfxApplication::GetResourceManager() const { return *pAppData_Impl->pResMgr; }\nBOOL  SfxApplication::IsDowning() const { return pAppData_Impl->bDowning; }\nSfxDispatcher* SfxApplication::GetAppDispatcher_Impl() { return pAppData_Impl->pAppDispat; }\nSfxSlotPool& SfxApplication::GetAppSlotPool_Impl() const { return *pAppData_Impl->pSlotPool; }\n\/\/SfxOptions&  SfxApplication::GetOptions() { return *pAppData_Impl->pOptions; }\n\/\/const SfxOptions& SfxApplication::GetOptions() const { return *pAppData_Impl->pOptions; }\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.57.216); FILE MERGED 2008\/04\/01 15:38:41 thb 1.57.216.3: #i85898# Stripping all external header guards 2008\/04\/01 12:40:39 thb 1.57.216.2: #i85898# Stripping all external header guards 2008\/03\/31 13:38:00 rt 1.57.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: appmisc.cxx,v $\n * $Revision: 1.58 $\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_sfx2.hxx\"\n#include <vcl\/status.hxx>\n#include <vcl\/msgbox.hxx>\n#ifndef _VOS_PROCESS_HXX \/\/autogen\n#include <vos\/process.hxx>\n#endif\n#include <vos\/xception.hxx>\n#include <svtools\/whiter.hxx>\n#include <svtools\/stritem.hxx>\n#include <svtools\/intitem.hxx>\n#include <svtools\/eitem.hxx>\n#include <svtools\/filter.hxx>\n#include <svtools\/internaloptions.hxx>\n#include <svtools\/pathoptions.hxx>\n#include <com\/sun\/star\/registry\/InvalidRegistryException.hpp>\n#ifndef _COM_SUN_STAR_BEANS_PropertyValue_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#include <com\/sun\/star\/frame\/XFrame.hpp>\n#include <com\/sun\/star\/util\/XURLTransformer.hpp>\n#include <com\/sun\/star\/frame\/XFramesSupplier.hpp>\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <tools\/config.hxx>\n#include <tools\/rcid.h>\n#include <vos\/mutex.hxx>\n#ifndef GCC\n#endif\n#include <unotools\/configmgr.hxx>\n#include <com\/sun\/star\/frame\/XDesktop.hpp>\n\n#include <unotools\/ucbstreamhelper.hxx>\n#include <framework\/menuconfiguration.hxx>\n#include <comphelper\/processfactory.hxx>\n#include <unotools\/localfilehelper.hxx>\n#include <unotools\/bootstrap.hxx>\n#include <svtools\/moduleoptions.hxx>\n#include <osl\/file.hxx>\n\n#include \"sfxresid.hxx\"\n#include <sfx2\/app.hxx>\n#include \"appdata.hxx\"\n#include \"arrdecl.hxx\"\n#include <sfx2\/tbxctrl.hxx>\n#include \"stbitem.hxx\"\n#include <sfx2\/mnuitem.hxx>\n#include <sfx2\/docfac.hxx>\n#include <sfx2\/docfile.hxx>\n#include <sfx2\/docfilt.hxx>\n#include <sfx2\/request.hxx>\n#include <sfx2\/bindings.hxx>\n#include <sfx2\/dispatch.hxx>\n#include \"workwin.hxx\"\n#include \"intro.hxx\"\n#include <sfx2\/fcontnr.hxx>\n#include \"sfxlocal.hrc\"\n#include <sfx2\/sfx.hrc>\n#include \"app.hrc\"\n#include <sfx2\/templdlg.hxx>\n#include <sfx2\/module.hxx>\n#include <sfx2\/msgpool.hxx>\n#include <sfx2\/topfrm.hxx>\n#include \"openflag.hxx\"\n#include <sfx2\/viewsh.hxx>\n#include <sfx2\/objface.hxx>\n#include \"helper.hxx\"   \/\/ SfxContentHelper::Kill()\n\nusing namespace ::vos;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::util;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::container;\n\n\/\/===================================================================\n\nSV_IMPL_PTRARR( SfxTbxCtrlFactArr_Impl, SfxTbxCtrlFactory* );\nSV_IMPL_PTRARR( SfxStbCtrlFactArr_Impl, SfxStbCtrlFactory* );\nSV_IMPL_PTRARR( SfxMenuCtrlFactArr_Impl, SfxMenuCtrlFactory* );\nSV_IMPL_PTRARR( SfxChildWinFactArr_Impl, SfxChildWinFactory* );\nSV_IMPL_PTRARR( SfxModuleArr_Impl, SfxModule* );\n\n\/\/===================================================================\n\n#define SfxApplication\n#include \"sfxslots.hxx\"\n\nclass SfxSpecialConfigError_Impl\n{\n    String aError;\n\npublic:\n\n    SfxSpecialConfigError_Impl( const String& rStr );\n    DECL_LINK( TimerHdl, Timer*);\n};\n\n\nSfxSpecialConfigError_Impl::SfxSpecialConfigError_Impl( const String& rStr ) :\n    aError( rStr )\n{\n    Timer *pTimer = new Timer;\n    pTimer->SetTimeoutHdl( LINK(this, SfxSpecialConfigError_Impl, TimerHdl) );\n    pTimer->SetTimeout( 0 );\n    pTimer->Start();\n}\n\nIMPL_LINK( SfxSpecialConfigError_Impl, TimerHdl, Timer*, pTimer )\n{\n    delete pTimer;\n    ErrorBox( 0, WinBits( WB_OK ) , aError ).Execute();\n    delete this;\n    SFX_APP()->GetAppDispatcher_Impl()->Execute( SID_QUITAPP );\n    return 0L;\n}\n\n\/\/====================================================================\n\n#define SFX_ITEMTYPE_STATBAR             4\n\nSFX_IMPL_INTERFACE(SfxApplication,SfxShell,SfxResId(RID_DESKTOP))\n{\n    SFX_STATUSBAR_REGISTRATION(SfxResId(SFX_ITEMTYPE_STATBAR));\n}\n\n\/\/--------------------------------------------------------------------\n\nvoid SfxApplication::InitializeDisplayName_Impl()\n{\n    SfxAppData_Impl* pAppData = Get_Impl();\n    if ( !pAppData->pLabelResMgr )\n        return;\n\n    String aTitle = Application::GetDisplayName();\n    if ( !aTitle.Len() )\n    {\n        OClearableGuard aGuard( OMutex::getGlobalMutex() );\n\n        \/\/ create version string\n\/*!!! (pb) don't show a version number at the moment\n        USHORT nProductVersion = ProductVersion::GetVersion().ToInt32();\n        String aVersion( String::CreateFromInt32( nProductVersion \/ 10 ) );\n        aVersion += 0x002E ; \/\/ 2Eh ^= '.'\n        aVersion += ( String::CreateFromInt32( nProductVersion % 10 ) );\n*\/\n        \/\/ load application title\n        aTitle = String( ResId( RID_APPTITLE, *pAppData->pLabelResMgr ) );\n        \/\/ merge version into title\n        aTitle.SearchAndReplaceAscii( \"$(VER)\", String() \/*aVersion*\/ );\n\n        aGuard.clear();\n\n#ifndef PRODUCT\n        ::rtl::OUString aDefault;\n        aTitle += DEFINE_CONST_UNICODE(\" [\");\n\n        String aVerId( utl::Bootstrap::getBuildIdData( aDefault ));\n        aTitle += aVerId;\n        aTitle += ']';\n#endif\n        Application::SetDisplayName( aTitle );\n    }\n}\n\n\/\/--------------------------------------------------------------------\nSfxProgress* SfxApplication::GetProgress() const\n\n\/*  [Beschreibung]\n\n    Liefert den f\"ur die gesamte Applikation laufenden SfxProgress\n    oder 0, falls keiner f\"ur die gesamte Applikation l\"auft.\n\n\n    [Querverweise]\n\n    <SfxProgress::GetActiveProgress(SfxViewFrame*)>\n    <SfxViewFrame::GetProgress()const>\n*\/\n\n{\n    return pAppData_Impl->pProgress;\n}\n\n\/\/------------------------------------------------------------------------\n\nSvUShorts* SfxApplication::GetDisabledSlotList_Impl()\n{\n    sal_Bool bError = sal_False;\n    SvUShorts* pList = pAppData_Impl->pDisabledSlotList;\n    if ( !pList )\n    {\n        \/\/ Gibt es eine Slotdatei ?\n        INetURLObject aUserObj( SvtPathOptions().GetUserConfigPath() );\n        aUserObj.insertName( DEFINE_CONST_UNICODE( \"slots.cfg\" ) );\n        SvStream* pStream = ::utl::UcbStreamHelper::CreateStream( aUserObj.GetMainURL( INetURLObject::NO_DECODE ), STREAM_STD_READ );\n        if ( !pStream || pStream->GetError() == ERRCODE_IO_NOTEXISTS )\n        {\n            delete pStream;\n            INetURLObject aObj( SvtPathOptions().GetConfigPath() );\n            aObj.insertName( DEFINE_CONST_UNICODE( \"slots.cfg\" ) );\n            pStream = ::utl::UcbStreamHelper::CreateStream( aObj.GetMainURL( INetURLObject::NO_DECODE ), STREAM_STD_READ );\n        }\n\n        BOOL bSlotsEnabled = SvtInternalOptions().SlotCFGEnabled();\n        BOOL bSlots = ( pStream && !pStream->GetError() );\n        if( bSlots && bSlotsEnabled )\n        {\n            \/\/ SlotDatei einlesen\n            String aTitle;\n            pStream->ReadByteString(aTitle);\n            if ( aTitle.CompareToAscii(\"SfxSlotFile\" ) == COMPARE_EQUAL )\n            {\n                sal_uInt16 nCount;\n                (*pStream) >> nCount;\n                pList = pAppData_Impl->pDisabledSlotList =\n                        new SvUShorts( nCount < 255 ? (sal_Int8) nCount : 255, 255 );\n\n                sal_uInt16 nSlot;\n                for ( sal_uInt16 n=0; n<nCount; n++ )\n                {\n                    (*pStream) >> nSlot;\n                    pList->Insert( nSlot, n );\n                }\n\n                pStream->ReadByteString(aTitle);\n                if ( aTitle.CompareToAscii(\"END\" ) != COMPARE_EQUAL || pStream->GetError() )\n                {\n                    \/\/ Lesen schief gegangen\n                    DELETEZ( pList );\n                    bError = sal_True;\n                }\n            }\n            else\n            {\n                \/\/ Streamerkennung  fehlgeschlagen\n                bError = sal_True;\n            }\n        }\n        else if ( bSlots != bSlotsEnabled )\n        {\n            \/\/ Wenn kein Slotlist-Eintrag, dann darf auch keine SlotDatei\n            \/\/ vorhanden sein\n            bError = sal_True;\n        }\n\n        delete pStream;\n    }\n    else if ( pList == (SvUShorts*) -1L )\n    {\n        return NULL;\n    }\n\n    if ( !pList )\n        pAppData_Impl->pDisabledSlotList = (SvUShorts*) -1L;\n\n    if ( bError )\n    {\n        \/\/ Wenn ein Sloteintrag vorhanden ist, aber keine oder eine fehlerhafte\n        \/\/ SlotDatei, oder aber eine Slotdatei, aber kein Sloteintrag, dann\n        \/\/ gilt dies als fehlerhafte Konfiguration\n        new SfxSpecialConfigError_Impl( String( SfxResId( RID_SPECIALCONFIG_ERROR ) ) );\n    }\n\n       return pList;\n}\n\n\nSfxModule* SfxApplication::GetModule_Impl()\n{\n    SfxModule* pModule = SfxModule::GetActiveModule();\n    if ( !pModule )\n        pModule = SfxModule::GetActiveModule( SfxViewFrame::GetFirst( FALSE ) );\n    if( pModule )\n        return pModule;\n    else\n    {\n        DBG_ERROR( \"No module!\" );\n        return NULL;\n    }\n}\n\nISfxTemplateCommon* SfxApplication::GetCurrentTemplateCommon( SfxBindings& rBindings )\n{\n    if( pAppData_Impl->pTemplateCommon )\n        return pAppData_Impl->pTemplateCommon;\n    SfxChildWindow *pChild = rBindings.GetWorkWindow_Impl()->GetChildWindow_Impl(\n        SfxTemplateDialogWrapper::GetChildWindowId() );\n    if ( pChild )\n        return ((SfxTemplateDialog*) pChild->GetWindow())->GetISfxTemplateCommon();\n    return 0;\n}\n\nSfxCancelManager* SfxApplication::GetCancelManager() const\n{\n    if ( !pAppData_Impl->pCancelMgr )\n        pAppData_Impl->pCancelMgr = new SfxCancelManager;\n    return pAppData_Impl->pCancelMgr;\n}\n\nSfxResourceManager& SfxApplication::GetResourceManager() const { return *pAppData_Impl->pResMgr; }\nBOOL  SfxApplication::IsDowning() const { return pAppData_Impl->bDowning; }\nSfxDispatcher* SfxApplication::GetAppDispatcher_Impl() { return pAppData_Impl->pAppDispat; }\nSfxSlotPool& SfxApplication::GetAppSlotPool_Impl() const { return *pAppData_Impl->pSlotPool; }\n\/\/SfxOptions&  SfxApplication::GetOptions() { return *pAppData_Impl->pOptions; }\n\/\/const SfxOptions& SfxApplication::GetOptions() const { return *pAppData_Impl->pOptions; }\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#58370 - 'Send Feedback...' URL invalid in other languages then English<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"narf\/version.h\"\n#include \"narf\/bytestream.h\"\n#include \"narf\/cursesconsole.h\"\n#include \"narf\/gameloop.h\"\n#include \"narf\/playercmd.h\"\n#include \"narf\/world.h\"\n#include \"narf\/cmd\/cmd.h\"\n#include \"narf\/util\/path.h\"\n#include \"narf\/net\/net.h\"\n\n#include <chrono>\n\n#include <enet\/enet.h>\n\n#include <string.h>\n\nnarf::CursesConsole *cursesConsole;\n\n\/\/ TODO: put this somewhere else\nclass Client {\npublic:\n\n\tClient() : peer(nullptr) {\n\t}\n\n\tENetPeer* peer;\n};\n\n\nclass ServerGameLoop : public narf::GameLoop {\npublic:\n\tServerGameLoop(double maxFrameTime, double tickRate, size_t maxClients);\n\t~ServerGameLoop();\n\n\tvoid tick(narf::timediff dt) override;\n\tvoid updateStatus(const std::string& status) override;\n\tvoid draw(float stateBlend) override;\n\n\tvoid processConnect(ENetEvent& evt);\n\tvoid processDisconnect(ENetEvent& evt);\n\tvoid processChat(ENetEvent& evt, Client* client);\n\tvoid processPlayerCommand(ENetEvent& evt, Client* client);\n\tvoid processReceive(ENetEvent& evt);\n\tvoid processNetEvent(ENetEvent& evt);\n\n\tENetHost* server;\n\tsize_t maxClients;\n\tClient* clients;\n};\n\nServerGameLoop* game;\n\nnarf::World *world;\n\n\/\/ TODO: move these\n#define WORLD_X_MAX 64\n#define WORLD_Y_MAX 64\n#define WORLD_Z_MAX 64\n\n\/\/ TODO: this is copied from client\nnarf::BlockType genNormalBlockType() {\n\tnarf::BlockType bt;\n\tbt.solid = true;\n\tbt.indestructible = false;\n\treturn bt;\n}\n\n\/\/ TODO: this is copied from client\nvoid genWorld() {\n\tworld = new narf::World(WORLD_X_MAX, WORLD_Y_MAX, WORLD_Z_MAX, 16, 16, 16);\n\n\t\/\/ set up block types\n\t\/\/ TODO: put this in a config file\n\tauto airType = genNormalBlockType(); \/\/ TODO\n\tairType.solid = false;\n\tworld->addBlockType(airType); \/\/ air\n\n\tauto adminiumType = genNormalBlockType();\n\tadminiumType.indestructible = true;\n\tworld->addBlockType(adminiumType); \/\/ adminium\n\n\tworld->addBlockType(genNormalBlockType()); \/\/ dirt\n\tworld->addBlockType(genNormalBlockType()); \/\/ dirt with grass top\n\tworld->addBlockType(genNormalBlockType()); \/\/ TODO\n\tworld->addBlockType(genNormalBlockType()); \/\/ brick\n\tworld->addBlockType(genNormalBlockType()); \/\/ stone1\n\tauto stone2 = world->addBlockType(genNormalBlockType()); \/\/ stone2\n\tworld->addBlockType(genNormalBlockType()); \/\/ stone3\n\n\tworld->set_gravity(-24.0f);\n}\n\n\n\nvoid cmdQuit(const std::string &args) {\n\tnarf::console->println(\"Quitting in response to user command\");\n\tgame->quit = true;\n}\n\n\nvoid tell(const Client* to, const Client* from, const std::string& text) {\n\t\/\/ TODO: use client nickname here\n\tstd::string fromName = from ? narf::net::to_string(from->peer->address) : \"server\";\n\tstd::string packetData(\"<\" + fromName + \"> \" + text);\n\tauto packet = enet_packet_create(packetData.c_str(), packetData.length(), ENET_PACKET_FLAG_RELIABLE);\n\tenet_peer_send(to->peer, narf::net::CHAN_CHAT, packet);\n}\n\n\nvoid tellAll(const Client* from, const std::string& text) {\n\tfor (size_t i = 0; i < game->maxClients; i++) {\n\t\tauto client = &game->clients[i];\n\t\tif (client->peer) {\n\t\t\ttell(client, from, text);\n\t\t}\n\t}\n}\n\n\nvoid sendChunkUpdate(const Client* to, const narf::World::ChunkCoord& wcc, bool dirtyOnly) {\n\tauto chunk = world->get_chunk(wcc);\n\tif (!dirtyOnly || chunk->dirty()) {\n\t\tnarf::ByteStreamWriter bs;\n\t\tworld->serializeChunk(bs, wcc);\n\t\tauto packet = enet_packet_create(bs.data(), bs.size(), ENET_PACKET_FLAG_RELIABLE);\n\t\tenet_peer_send(to->peer, narf::net::CHAN_CHUNK, packet);\n\t}\n}\n\n\nvoid markChunksClean() {\n\tnarf::math::coord::ZYXCoordIter<narf::World::ChunkCoord> iter({ 0, 0, 0 }, { world->chunks_x(), world->chunks_y(), world->chunks_z() });\n\tfor (const auto& wcc : iter) {\n\t\tworld->get_chunk(wcc)->markClean();\n\t}\n}\n\n\nServerGameLoop::ServerGameLoop(double maxFrameTime, double tickRate, size_t maxClients) :\n\tnarf::GameLoop(maxFrameTime, tickRate),\n\tmaxClients(maxClients) {\n\n\tclients = new Client[maxClients];\n\tif (!clients) {\n\t\treturn;\n\t}\n\n\tENetAddress bindAddress;\n\tbindAddress.host = ENET_HOST_ANY;\n\tbindAddress.port = narf::net::DEFAULT_PORT;\n\n\tnarf::console->println(\"Binding to \" + narf::net::to_string(bindAddress));\n\tserver = enet_host_create(&bindAddress, maxClients, narf::net::MAX_CHANNELS, 0, 0);\n\tif (server == nullptr) {\n\t\tnarf::console->println(\"Could not bind to \" + narf::net::to_string(bindAddress));\n\t}\n}\n\n\nServerGameLoop::~ServerGameLoop() {\n\tif (server) {\n\t\tenet_host_destroy(server);\n\t}\n\tenet_deinitialize();\n\tif (clients) {\n\t\tdelete[] clients;\n\t}\n}\n\n\nvoid ServerGameLoop::processConnect(ENetEvent& evt) {\n\tnarf::console->println(\"Client connected from \" + narf::net::to_string(evt.peer->address));\n\t\/\/ add the client to list of connected clients\n\t\/\/ find an unused client\n\tClient* client = nullptr;\n\tfor (unsigned i = 0; i < maxClients; i++) {\n\t\tif (!clients[i].peer) {\n\t\t\tclient = &clients[i];\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (client == nullptr) {\n\t\t\/\/ TODO!!!!\n\t\tnarf::console->println(\"ERROR: No client slots available\");\n\t\tenet_peer_reset(evt.peer);\n\t\treturn;\n\t}\n\n\tclient->peer = evt.peer;\n\n\t\/\/ store Client pointer in peer data\n\tevt.peer->data = client;\n\n\t\/\/ send a server message greeting\n\ttellAll(nullptr, \"Client connected from \" + narf::net::to_string(evt.peer->address));\n\n\t\/\/ send all chunks (!!)\n\tnarf::math::coord::ZYXCoordIter<narf::World::ChunkCoord> iter({ 0, 0, 0 }, { world->chunks_x(), world->chunks_y(), world->chunks_z() });\n\tfor (const auto& wcc : iter) {\n\t\tsendChunkUpdate(client, wcc, false);\n\t}\n}\n\n\nvoid ServerGameLoop::processDisconnect(ENetEvent& evt) {\n\tauto client = static_cast<Client*>(evt.peer->data);\n\tauto disconnectType = static_cast<narf::net::DisconnectType>(evt.data);\n\tstd::string reason;\n\tswitch (disconnectType) {\n\tcase narf::net::DisconnectType::Timeout:\n\t\treason = \"timed out\";\n\t\tbreak;\n\tcase narf::net::DisconnectType::UserQuit:\n\t\treason = \"user quit\";\n\t\tbreak;\n\tdefault:\n\t\treason = \"unknown\";\n\t\tbreak;\n\t}\n\n\tstd::string disconnectMsg = \"Client disconnected from \" + narf::net::to_string(evt.peer->address) + \" (\" + reason + \")\";\n\tclient->peer = nullptr;\n\tevt.peer->data = nullptr;\n\n\tnarf::console->println(disconnectMsg);\n\ttellAll(nullptr, disconnectMsg);\n}\n\n\nvoid ServerGameLoop::processChat(ENetEvent& evt, Client* client) {\n\tstd::string text((char*)evt.packet->data, evt.packet->dataLength);\n\tnarf::console->println(\"Chat: \" + text);\n\t\/\/ send the chat out to all clients\n\ttellAll(client, text);\n}\n\n\nvoid ServerGameLoop::processPlayerCommand(ENetEvent& evt, Client* client) {\n\tnarf::ByteStreamReader bs(evt.packet->data, evt.packet->dataLength);\n\tnarf::PlayerCommand cmd(bs);\n\tcmd.exec(world);\n}\n\n\nvoid ServerGameLoop::processReceive(ENetEvent& evt) {\n\tauto client = static_cast<Client*>(evt.peer->data);\n\tswitch (evt.channelID) {\n\tcase narf::net::CHAN_CHAT:\n\t\tprocessChat(evt, client);\n\t\tbreak;\n\tcase narf::net::CHAN_PLAYERCMD:\n\t\tprocessPlayerCommand(evt, client);\n\t\tbreak;\n\tdefault:\n\t\tnarf::console->println(\"Got unexpected packet from \" + narf::net::to_string(evt.peer->address) + \" channel \" + std::to_string(evt.channelID) + \" size \" + std::to_string(evt.packet->dataLength));\n\t\tbreak;\n\t}\n}\n\n\nvoid ServerGameLoop::processNetEvent(ENetEvent& evt) {\n\tswitch (evt.type) {\n\tcase ENET_EVENT_TYPE_CONNECT:\n\t\tprocessConnect(evt);\n\t\tbreak;\n\tcase ENET_EVENT_TYPE_DISCONNECT:\n\t\tprocessDisconnect(evt);\n\t\tbreak;\n\tcase ENET_EVENT_TYPE_RECEIVE:\n\t\tprocessReceive(evt);\n\t\tbreak;\n\tcase ENET_EVENT_TYPE_NONE:\n\t\t\/\/ make the compiler shut up about unhandled enum value\n\t\tbreak;\n\t}\n}\n\n\nvoid ServerGameLoop::tick(narf::timediff dt) {\n\t\/\/ check for console input\n\tauto input = narf::console->pollInput();\n\tif (input != \"\") {\n\t\tif (input[0] == '\/') { \/\/ commands begin with slash\n\t\t\tnarf::cmd::exec(input.substr(1));\n\t\t}\n\t}\n\tENetEvent evt;\n\tif (enet_host_service(server, &evt, 0) > 0) {\n\t\tprocessNetEvent(evt);\n\t}\n\n\tworld->update(dt);\n\n\t\/\/ send chunk updates to all clients\n\tfor (size_t i = 0; i < maxClients; i++) {\n\t\tauto client = &clients[i];\n\t\tif (client->peer) {\n\t\t\tnarf::math::coord::ZYXCoordIter<narf::World::ChunkCoord> iter({ 0, 0, 0 }, { world->chunks_x(), world->chunks_y(), world->chunks_z() });\n\t\t\tfor (const auto& wcc : iter) {\n\t\t\t\tsendChunkUpdate(client, wcc, true);\n\t\t\t}\n\t\t}\n\t}\n\tmarkChunksClean();\n}\n\n\nvoid ServerGameLoop::updateStatus(const std::string& status) {\n\tcursesConsole->setStatus(status);\n}\n\n\nvoid ServerGameLoop::draw(float stateBlend) {\n}\n\n\nint main(int argc, char **argv)\n{\n\tcursesConsole = new narf::CursesConsole();\n\tnarf::console = cursesConsole;\n\n\tnarf::console->println(\"Hello, world - I'm a server.\");\n\tnarf::console->println(\"Version: \" + std::to_string(VERSION_MAJOR) + \".\" + std::to_string(VERSION_MINOR) + std::string(VERSION_RELEASE) + \"+\" VERSION_REV);\n\n\tif (enet_initialize() != 0) {\n\t\tnarf::console->println(\"Error initializing ENet\");\n\t\treturn 1;\n\t}\n\n\tnarf::console->println(\"Executable filename:  \" + narf::util::exeName());\n\tnarf::console->println(\"Executable directory: \" + narf::util::exeDir());\n\tnarf::console->println(\"Data directory: \" + narf::util::dataDir());\n\tnarf::console->println(\"Type \/quit to quit.\");\n\n\tnarf::cmd::cmds[\"quit\"] = cmdQuit;\n\n\tgenWorld();\n\n\t\/\/ TODO: make tick rate and max clients configurable\n\tgame = new ServerGameLoop(0.25, 60.0, 32);\n\tgame->callDraw = false;\n\tgame->run();\n\tdelete game;\n\tdelete narf::console;\n\treturn 0;\n}\n<commit_msg>server: format chat the same way as the client<commit_after>#include \"narf\/version.h\"\n#include \"narf\/bytestream.h\"\n#include \"narf\/cursesconsole.h\"\n#include \"narf\/gameloop.h\"\n#include \"narf\/playercmd.h\"\n#include \"narf\/world.h\"\n#include \"narf\/cmd\/cmd.h\"\n#include \"narf\/util\/path.h\"\n#include \"narf\/net\/net.h\"\n\n#include <chrono>\n\n#include <enet\/enet.h>\n\n#include <string.h>\n\nnarf::CursesConsole *cursesConsole;\n\n\/\/ TODO: put this somewhere else\nclass Client {\npublic:\n\n\tClient() : peer(nullptr) {\n\t}\n\n\tENetPeer* peer;\n};\n\n\nclass ServerGameLoop : public narf::GameLoop {\npublic:\n\tServerGameLoop(double maxFrameTime, double tickRate, size_t maxClients);\n\t~ServerGameLoop();\n\n\tvoid tick(narf::timediff dt) override;\n\tvoid updateStatus(const std::string& status) override;\n\tvoid draw(float stateBlend) override;\n\n\tvoid processConnect(ENetEvent& evt);\n\tvoid processDisconnect(ENetEvent& evt);\n\tvoid processChat(ENetEvent& evt, Client* client);\n\tvoid processPlayerCommand(ENetEvent& evt, Client* client);\n\tvoid processReceive(ENetEvent& evt);\n\tvoid processNetEvent(ENetEvent& evt);\n\n\tENetHost* server;\n\tsize_t maxClients;\n\tClient* clients;\n};\n\nServerGameLoop* game;\n\nnarf::World *world;\n\n\/\/ TODO: move these\n#define WORLD_X_MAX 64\n#define WORLD_Y_MAX 64\n#define WORLD_Z_MAX 64\n\n\/\/ TODO: this is copied from client\nnarf::BlockType genNormalBlockType() {\n\tnarf::BlockType bt;\n\tbt.solid = true;\n\tbt.indestructible = false;\n\treturn bt;\n}\n\n\/\/ TODO: this is copied from client\nvoid genWorld() {\n\tworld = new narf::World(WORLD_X_MAX, WORLD_Y_MAX, WORLD_Z_MAX, 16, 16, 16);\n\n\t\/\/ set up block types\n\t\/\/ TODO: put this in a config file\n\tauto airType = genNormalBlockType(); \/\/ TODO\n\tairType.solid = false;\n\tworld->addBlockType(airType); \/\/ air\n\n\tauto adminiumType = genNormalBlockType();\n\tadminiumType.indestructible = true;\n\tworld->addBlockType(adminiumType); \/\/ adminium\n\n\tworld->addBlockType(genNormalBlockType()); \/\/ dirt\n\tworld->addBlockType(genNormalBlockType()); \/\/ dirt with grass top\n\tworld->addBlockType(genNormalBlockType()); \/\/ TODO\n\tworld->addBlockType(genNormalBlockType()); \/\/ brick\n\tworld->addBlockType(genNormalBlockType()); \/\/ stone1\n\tauto stone2 = world->addBlockType(genNormalBlockType()); \/\/ stone2\n\tworld->addBlockType(genNormalBlockType()); \/\/ stone3\n\n\tworld->set_gravity(-24.0f);\n}\n\n\n\nvoid cmdQuit(const std::string &args) {\n\tnarf::console->println(\"Quitting in response to user command\");\n\tgame->quit = true;\n}\n\n\nstd::string formatChat(const Client* from, const std::string& text) {\n\t\/\/ TODO: use client nickname here\n\tstd::string fromName = from ? narf::net::to_string(from->peer->address) : \"server\";\n\treturn \"<\" + fromName + \"> \" + text;\n}\n\n\nvoid tell(const Client* to, const Client* from, const std::string& text) {\n\tstd::string packetData(formatChat(from, text));\n\tauto packet = enet_packet_create(packetData.c_str(), packetData.length(), ENET_PACKET_FLAG_RELIABLE);\n\tenet_peer_send(to->peer, narf::net::CHAN_CHAT, packet);\n}\n\n\nvoid tellAll(const Client* from, const std::string& text) {\n\tfor (size_t i = 0; i < game->maxClients; i++) {\n\t\tauto client = &game->clients[i];\n\t\tif (client->peer) {\n\t\t\ttell(client, from, text);\n\t\t}\n\t}\n}\n\n\nvoid sendChunkUpdate(const Client* to, const narf::World::ChunkCoord& wcc, bool dirtyOnly) {\n\tauto chunk = world->get_chunk(wcc);\n\tif (!dirtyOnly || chunk->dirty()) {\n\t\tnarf::ByteStreamWriter bs;\n\t\tworld->serializeChunk(bs, wcc);\n\t\tauto packet = enet_packet_create(bs.data(), bs.size(), ENET_PACKET_FLAG_RELIABLE);\n\t\tenet_peer_send(to->peer, narf::net::CHAN_CHUNK, packet);\n\t}\n}\n\n\nvoid markChunksClean() {\n\tnarf::math::coord::ZYXCoordIter<narf::World::ChunkCoord> iter({ 0, 0, 0 }, { world->chunks_x(), world->chunks_y(), world->chunks_z() });\n\tfor (const auto& wcc : iter) {\n\t\tworld->get_chunk(wcc)->markClean();\n\t}\n}\n\n\nServerGameLoop::ServerGameLoop(double maxFrameTime, double tickRate, size_t maxClients) :\n\tnarf::GameLoop(maxFrameTime, tickRate),\n\tmaxClients(maxClients) {\n\n\tclients = new Client[maxClients];\n\tif (!clients) {\n\t\treturn;\n\t}\n\n\tENetAddress bindAddress;\n\tbindAddress.host = ENET_HOST_ANY;\n\tbindAddress.port = narf::net::DEFAULT_PORT;\n\n\tnarf::console->println(\"Binding to \" + narf::net::to_string(bindAddress));\n\tserver = enet_host_create(&bindAddress, maxClients, narf::net::MAX_CHANNELS, 0, 0);\n\tif (server == nullptr) {\n\t\tnarf::console->println(\"Could not bind to \" + narf::net::to_string(bindAddress));\n\t}\n}\n\n\nServerGameLoop::~ServerGameLoop() {\n\tif (server) {\n\t\tenet_host_destroy(server);\n\t}\n\tenet_deinitialize();\n\tif (clients) {\n\t\tdelete[] clients;\n\t}\n}\n\n\nvoid ServerGameLoop::processConnect(ENetEvent& evt) {\n\tnarf::console->println(\"Client connected from \" + narf::net::to_string(evt.peer->address));\n\t\/\/ add the client to list of connected clients\n\t\/\/ find an unused client\n\tClient* client = nullptr;\n\tfor (unsigned i = 0; i < maxClients; i++) {\n\t\tif (!clients[i].peer) {\n\t\t\tclient = &clients[i];\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (client == nullptr) {\n\t\t\/\/ TODO!!!!\n\t\tnarf::console->println(\"ERROR: No client slots available\");\n\t\tenet_peer_reset(evt.peer);\n\t\treturn;\n\t}\n\n\tclient->peer = evt.peer;\n\n\t\/\/ store Client pointer in peer data\n\tevt.peer->data = client;\n\n\t\/\/ send a server message greeting\n\ttellAll(nullptr, \"Client connected from \" + narf::net::to_string(evt.peer->address));\n\n\t\/\/ send all chunks (!!)\n\tnarf::math::coord::ZYXCoordIter<narf::World::ChunkCoord> iter({ 0, 0, 0 }, { world->chunks_x(), world->chunks_y(), world->chunks_z() });\n\tfor (const auto& wcc : iter) {\n\t\tsendChunkUpdate(client, wcc, false);\n\t}\n}\n\n\nvoid ServerGameLoop::processDisconnect(ENetEvent& evt) {\n\tauto client = static_cast<Client*>(evt.peer->data);\n\tauto disconnectType = static_cast<narf::net::DisconnectType>(evt.data);\n\tstd::string reason;\n\tswitch (disconnectType) {\n\tcase narf::net::DisconnectType::Timeout:\n\t\treason = \"timed out\";\n\t\tbreak;\n\tcase narf::net::DisconnectType::UserQuit:\n\t\treason = \"user quit\";\n\t\tbreak;\n\tdefault:\n\t\treason = \"unknown\";\n\t\tbreak;\n\t}\n\n\tstd::string disconnectMsg = \"Client disconnected from \" + narf::net::to_string(evt.peer->address) + \" (\" + reason + \")\";\n\tclient->peer = nullptr;\n\tevt.peer->data = nullptr;\n\n\tnarf::console->println(disconnectMsg);\n\ttellAll(nullptr, disconnectMsg);\n}\n\n\nvoid ServerGameLoop::processChat(ENetEvent& evt, Client* client) {\n\tstd::string text((char*)evt.packet->data, evt.packet->dataLength);\n\tnarf::console->println(formatChat(client, text));\n\t\/\/ send the chat out to all clients\n\ttellAll(client, text);\n}\n\n\nvoid ServerGameLoop::processPlayerCommand(ENetEvent& evt, Client* client) {\n\tnarf::ByteStreamReader bs(evt.packet->data, evt.packet->dataLength);\n\tnarf::PlayerCommand cmd(bs);\n\tcmd.exec(world);\n}\n\n\nvoid ServerGameLoop::processReceive(ENetEvent& evt) {\n\tauto client = static_cast<Client*>(evt.peer->data);\n\tswitch (evt.channelID) {\n\tcase narf::net::CHAN_CHAT:\n\t\tprocessChat(evt, client);\n\t\tbreak;\n\tcase narf::net::CHAN_PLAYERCMD:\n\t\tprocessPlayerCommand(evt, client);\n\t\tbreak;\n\tdefault:\n\t\tnarf::console->println(\"Got unexpected packet from \" + narf::net::to_string(evt.peer->address) + \" channel \" + std::to_string(evt.channelID) + \" size \" + std::to_string(evt.packet->dataLength));\n\t\tbreak;\n\t}\n}\n\n\nvoid ServerGameLoop::processNetEvent(ENetEvent& evt) {\n\tswitch (evt.type) {\n\tcase ENET_EVENT_TYPE_CONNECT:\n\t\tprocessConnect(evt);\n\t\tbreak;\n\tcase ENET_EVENT_TYPE_DISCONNECT:\n\t\tprocessDisconnect(evt);\n\t\tbreak;\n\tcase ENET_EVENT_TYPE_RECEIVE:\n\t\tprocessReceive(evt);\n\t\tbreak;\n\tcase ENET_EVENT_TYPE_NONE:\n\t\t\/\/ make the compiler shut up about unhandled enum value\n\t\tbreak;\n\t}\n}\n\n\nvoid ServerGameLoop::tick(narf::timediff dt) {\n\t\/\/ check for console input\n\tauto input = narf::console->pollInput();\n\tif (input != \"\") {\n\t\tif (input[0] == '\/') { \/\/ commands begin with slash\n\t\t\tnarf::cmd::exec(input.substr(1));\n\t\t} else {\n\t\t\tnarf::console->println(formatChat(nullptr, input));\n\t\t\ttellAll(nullptr, input);\n\t\t}\n\t}\n\tENetEvent evt;\n\tif (enet_host_service(server, &evt, 0) > 0) {\n\t\tprocessNetEvent(evt);\n\t}\n\n\tworld->update(dt);\n\n\t\/\/ send chunk updates to all clients\n\tfor (size_t i = 0; i < maxClients; i++) {\n\t\tauto client = &clients[i];\n\t\tif (client->peer) {\n\t\t\tnarf::math::coord::ZYXCoordIter<narf::World::ChunkCoord> iter({ 0, 0, 0 }, { world->chunks_x(), world->chunks_y(), world->chunks_z() });\n\t\t\tfor (const auto& wcc : iter) {\n\t\t\t\tsendChunkUpdate(client, wcc, true);\n\t\t\t}\n\t\t}\n\t}\n\tmarkChunksClean();\n}\n\n\nvoid ServerGameLoop::updateStatus(const std::string& status) {\n\tcursesConsole->setStatus(status);\n}\n\n\nvoid ServerGameLoop::draw(float stateBlend) {\n}\n\n\nint main(int argc, char **argv)\n{\n\tcursesConsole = new narf::CursesConsole();\n\tnarf::console = cursesConsole;\n\n\tnarf::console->println(\"Hello, world - I'm a server.\");\n\tnarf::console->println(\"Version: \" + std::to_string(VERSION_MAJOR) + \".\" + std::to_string(VERSION_MINOR) + std::string(VERSION_RELEASE) + \"+\" VERSION_REV);\n\n\tif (enet_initialize() != 0) {\n\t\tnarf::console->println(\"Error initializing ENet\");\n\t\treturn 1;\n\t}\n\n\tnarf::console->println(\"Executable filename:  \" + narf::util::exeName());\n\tnarf::console->println(\"Executable directory: \" + narf::util::exeDir());\n\tnarf::console->println(\"Data directory: \" + narf::util::dataDir());\n\tnarf::console->println(\"Type \/quit to quit.\");\n\n\tnarf::cmd::cmds[\"quit\"] = cmdQuit;\n\n\tgenWorld();\n\n\t\/\/ TODO: make tick rate and max clients configurable\n\tgame = new ServerGameLoop(0.25, 60.0, 32);\n\tgame->callDraw = false;\n\tgame->run();\n\tdelete game;\n\tdelete narf::console;\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <yuni\/yuni.h>\n#include <yuni\/string.h>\n#include <nany\/nany.h>\n#include <iostream>\n#include <cassert>\n\nusing namespace Yuni;\n\n\n\n\nstatic int printNoInputScript(const char* argv0)\n#include <iostream>\n{\n\tstd::cerr << argv0 << \": no input script file\\n\";\n\treturn EXIT_FAILURE;\n}\n\n\nstatic int printUsage(const char* const argv0)\n{\n\tstd::cout\n\t\t<< \"Usage: \" << argv0 << \" [options] file...\\n\"\n\t\t<< \"Options:\\n\"\n\t\t<< \"  --bugreport       Display some useful information to report a bug\\n\"\n\t\t<< \"                    (https:\/\/github.com\/nany-lang\/nany\/issues\/new)\\n\"\n\t\t<< \"  --help, -h        Display this information\\n\"\n\t\t<< \"  --version, -v     Print the version\\n\\n\";\n\treturn EXIT_SUCCESS;\n}\n\n\nstatic int printBugReportInfo()\n{\n\tnylib_print_info_for_bugreport();\n\treturn EXIT_SUCCESS;\n}\n\n\nstatic int printVersion()\n{\n\tstd::cout << nylib_version() << '\\n';\n\treturn EXIT_SUCCESS;\n}\n\n\nstatic int unknownOption(const char* argv0, const AnyString& name)\n{\n\tstd::cerr << argv0 << \": unknown option '\" << name << \"'\\n\";\n\treturn EXIT_FAILURE;\n}\n\n\nstatic void on_error_file_eacces(const nyproject_t*, nybuild_t*, const char* file, uint32_t length)\n{\n\tstd::cerr << \"error: failed to access to '\";\n\tstd::cerr << AnyString{file, length} << \"'\\n\";\n}\n\n\n\n\nint main(int argc, const char** argv)\n{\n\tconst char* const argv0 = argv[0];\n\n\tif (argc > 1)\n\t{\n\t\tnyrun_cf_t runcf;\n\t\tnyrun_cf_init(&runcf);\n\n\t\tint firstarg = argc; \/\/ end of the list\n\n\t\tfor (int i = 1; i < argc; ++i)\n\t\t{\n\t\t\tconst char* const carg = argv[i];\n\t\t\tif (carg[0] == '-')\n\t\t\t{\n\t\t\t\tif (carg[1] == '-')\n\t\t\t\t{\n\t\t\t\t\tif (carg[2] != '\\0') \/\/ to handle '--' option\n\t\t\t\t\t{\n\t\t\t\t\t\tAnyString arg{carg};\n\n\t\t\t\t\t\tif (arg == \"--help\")\n\t\t\t\t\t\t\treturn printUsage(argv[0]);\n\t\t\t\t\t\tif (arg == \"--version\")\n\t\t\t\t\t\t\treturn printVersion();\n\t\t\t\t\t\tif (arg == \"--bugreport\")\n\t\t\t\t\t\t\treturn printBugReportInfo();\n\t\t\t\t\t\tif (arg == \"--verbose\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\truncf.verbose = nytrue;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn unknownOption(argv0, arg);\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\/\/ nothing must interpreted after '--'\n\t\t\t\t\t\tfirstarg = i + 1;\n\t\t\t\t\t\tbreak;\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\tAnyString arg{carg};\n\t\t\t\t\tif (arg == \"-h\")\n\t\t\t\t\t\treturn printUsage(argv[0]);\n\t\t\t\t\tif (arg == \"-v\")\n\t\t\t\t\t\treturn printVersion();\n\t\t\t\t\treturn unknownOption(argv0, arg);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfirstarg = i;\n\t\t\tbreak;\n\t\t}\n\n\n\t\t\/\/\n\t\t\/\/ -- execute the script\n\t\t\/\/\n\t\tint exitstatus = -1;\n\t\tif (firstarg < argc)\n\t\t{\n\t\t\t\/\/ callbacks\n\t\t\truncf.build.on_error_file_eacces = &on_error_file_eacces;\n\n\t\t\t\/\/ the new arguments, after removing all command line arguments\n\t\t\tint nargc = argc - firstarg;\n\t\t\tconst char** nargv = argv + firstarg;\n\t\t\t\/\/ the nany sript to load, which should be the first new argument\n\t\t\tconst char* nargv0 = nargv[0];\n\n\t\t\t--nargc;\n\t\t\tuint32_t pargc = (nargc > 0) ? static_cast<uint32_t>(nargc) : 0;\n\t\t\tconst char** pargv = (!pargc ? nullptr : (++nargv));\n\n\t\t\texitstatus = nyrun_file_n(&runcf, nargv0, strlen(nargv0), pargc, pargv);\n\t\t}\n\n\t\tnyrun_cf_release(&runcf);\n\t\treturn exitstatus;\n\t}\n\n\treturn printNoInputScript(argv0);\n}\n<commit_msg>nany: remove spurious include in the middle of the code<commit_after>#include <yuni\/yuni.h>\n#include <yuni\/string.h>\n#include <nany\/nany.h>\n#include <iostream>\n#include <cassert>\n\nusing namespace Yuni;\n\n\n\n\nstatic int printNoInputScript(const char* argv0)\n{\n\tstd::cerr << argv0 << \": no input script file\\n\";\n\treturn EXIT_FAILURE;\n}\n\n\nstatic int printUsage(const char* const argv0)\n{\n\tstd::cout\n\t\t<< \"Usage: \" << argv0 << \" [options] file...\\n\"\n\t\t<< \"Options:\\n\"\n\t\t<< \"  --bugreport       Display some useful information to report a bug\\n\"\n\t\t<< \"                    (https:\/\/github.com\/nany-lang\/nany\/issues\/new)\\n\"\n\t\t<< \"  --help, -h        Display this information\\n\"\n\t\t<< \"  --version, -v     Print the version\\n\\n\";\n\treturn EXIT_SUCCESS;\n}\n\n\nstatic int printBugReportInfo()\n{\n\tnylib_print_info_for_bugreport();\n\treturn EXIT_SUCCESS;\n}\n\n\nstatic int printVersion()\n{\n\tstd::cout << nylib_version() << '\\n';\n\treturn EXIT_SUCCESS;\n}\n\n\nstatic int unknownOption(const char* argv0, const AnyString& name)\n{\n\tstd::cerr << argv0 << \": unknown option '\" << name << \"'\\n\";\n\treturn EXIT_FAILURE;\n}\n\n\nstatic void on_error_file_eacces(const nyproject_t*, nybuild_t*, const char* file, uint32_t length)\n{\n\tstd::cerr << \"error: failed to access to '\";\n\tstd::cerr << AnyString{file, length} << \"'\\n\";\n}\n\n\n\n\nint main(int argc, const char** argv)\n{\n\tconst char* const argv0 = argv[0];\n\n\tif (argc > 1)\n\t{\n\t\tnyrun_cf_t runcf;\n\t\tnyrun_cf_init(&runcf);\n\n\t\tint firstarg = argc; \/\/ end of the list\n\n\t\tfor (int i = 1; i < argc; ++i)\n\t\t{\n\t\t\tconst char* const carg = argv[i];\n\t\t\tif (carg[0] == '-')\n\t\t\t{\n\t\t\t\tif (carg[1] == '-')\n\t\t\t\t{\n\t\t\t\t\tif (carg[2] != '\\0') \/\/ to handle '--' option\n\t\t\t\t\t{\n\t\t\t\t\t\tAnyString arg{carg};\n\n\t\t\t\t\t\tif (arg == \"--help\")\n\t\t\t\t\t\t\treturn printUsage(argv[0]);\n\t\t\t\t\t\tif (arg == \"--version\")\n\t\t\t\t\t\t\treturn printVersion();\n\t\t\t\t\t\tif (arg == \"--bugreport\")\n\t\t\t\t\t\t\treturn printBugReportInfo();\n\t\t\t\t\t\tif (arg == \"--verbose\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\truncf.verbose = nytrue;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn unknownOption(argv0, arg);\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\/\/ nothing must interpreted after '--'\n\t\t\t\t\t\tfirstarg = i + 1;\n\t\t\t\t\t\tbreak;\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\tAnyString arg{carg};\n\t\t\t\t\tif (arg == \"-h\")\n\t\t\t\t\t\treturn printUsage(argv[0]);\n\t\t\t\t\tif (arg == \"-v\")\n\t\t\t\t\t\treturn printVersion();\n\t\t\t\t\treturn unknownOption(argv0, arg);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfirstarg = i;\n\t\t\tbreak;\n\t\t}\n\n\n\t\t\/\/\n\t\t\/\/ -- execute the script\n\t\t\/\/\n\t\tint exitstatus = -1;\n\t\tif (firstarg < argc)\n\t\t{\n\t\t\t\/\/ callbacks\n\t\t\truncf.build.on_error_file_eacces = &on_error_file_eacces;\n\n\t\t\t\/\/ the new arguments, after removing all command line arguments\n\t\t\tint nargc = argc - firstarg;\n\t\t\tconst char** nargv = argv + firstarg;\n\t\t\t\/\/ the nany sript to load, which should be the first new argument\n\t\t\tconst char* nargv0 = nargv[0];\n\n\t\t\t--nargc;\n\t\t\tuint32_t pargc = (nargc > 0) ? static_cast<uint32_t>(nargc) : 0;\n\t\t\tconst char** pargv = (!pargc ? nullptr : (++nargv));\n\n\t\t\texitstatus = nyrun_file_n(&runcf, nargv0, strlen(nargv0), pargc, pargv);\n\t\t}\n\n\t\tnyrun_cf_release(&runcf);\n\t\treturn exitstatus;\n\t}\n\n\treturn printNoInputScript(argv0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2008-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 <stdio.h>\n#include <string.h>\n#include \"esnpapi.h\"\n\nnamespace\n{\n\nNPObject* stubAllocate(NPP npp, NPClass* aClass)\n{\n    return new StubObject(npp);\n}\n\nvoid stubDeallocate(NPObject* object)\n{\n    static_cast<StubObject*>(object)->deallocate();\n}\n\nvoid stubInvalidate(NPObject* object)\n{\n    static_cast<StubObject*>(object)->invalidate();\n}\n\nbool stubHasMethod(NPObject* object, NPIdentifier name)\n{\n    return static_cast<StubObject*>(object)->hasMethod(name);\n}\n\nbool stubInvoke(NPObject* object, NPIdentifier name, const NPVariant* args, uint32_t argCount, NPVariant* result)\n{\n    return static_cast<StubObject*>(object)->invoke(name, args, argCount, result);\n}\n\nbool stubInvokeDefault(NPObject* object, const NPVariant* args, uint32_t argCount, NPVariant* result)\n{\n    return static_cast<StubObject*>(object)->invokeDefault(args, argCount, result);\n}\n\nbool stubHasProperty(NPObject* object, NPIdentifier name)\n{\n    return static_cast<StubObject*>(object)->hasProperty(name);\n}\n\nbool stubGetProperty(NPObject* object, NPIdentifier name, NPVariant* result)\n{\n    return static_cast<StubObject*>(object)->getProperty(name, result);\n}\n\nbool stubSetProperty(NPObject* object, NPIdentifier name, const NPVariant* value)\n{\n    return static_cast<StubObject*>(object)->setProperty(name, value);\n}\n\nbool stubRemoveProperty(NPObject* object, NPIdentifier name)\n{\n    return static_cast<StubObject*>(object)->removeProperty(name);\n}\n\nbool stubEnumeration(NPObject* object, NPIdentifier** value, uint32_t* count)\n{\n    return static_cast<StubObject*>(object)->enumeration(value, count);\n}\n\nbool stubConstruct(NPObject* object, const NPVariant* args, uint32_t argCount, NPVariant* result)\n{\n    return static_cast<StubObject*>(object)->construct(args, argCount, result);\n}\n\nconst Reflect::SymbolData* lookupSymbolTalbe(Object* object, const char* identifier, unsigned& interfaceNumber, unsigned& symbolNumber)\n{\n    const Reflect::SymbolData* symbolTable;\n    while (symbolTable = object->getSymbolTable(interfaceNumber))\n    {\n        unsigned offset = 0;\n        for (symbolTable += symbolNumber; symbolTable->symbol; ++symbolNumber, ++symbolTable)\n        {\n            if (!std::strcmp(symbolTable->symbol, identifier))\n            {\n                return symbolTable;\n            }\n        }\n        ++interfaceNumber;\n    }\n    return 0;\n}\n\nvoid processResult(NPP npp, const Any& any, NPVariant* variant)\n{\n    if (any.getType() == Any::TypeString)\n    {\n        const std::string value = static_cast<const std::string>(any);\n        if (value.length() == 0)\n        {\n            STRINGN_TO_NPVARIANT(0, 0, *variant);\n            return;\n        }\n        void* buffer = NPN_MemAlloc(value.length());\n        if (!buffer)\n        {\n            STRINGN_TO_NPVARIANT(0, 0, *variant);\n            return;\n        }\n        memmove(buffer, value.c_str(), value.length());\n        STRINGN_TO_NPVARIANT(static_cast<NPUTF8*>(buffer), value.length(), *variant);\n        return;\n    }\n    convertToVariant(npp, any, variant);\n}\n\n}   \/\/ namespace\n\nlong StubObject::enter()\n{\n    PluginInstance* instance = static_cast<PluginInstance*>(npp->pdata);\n    if (instance)\n    {\n        ProxyControl* proxyControl = instance->getProxyControl();\n        if (proxyControl)\n        {\n            return proxyControl->enter();\n        }\n    }\n    return 0;\n}\n\nlong StubObject::leave()\n{\n    PluginInstance* instance = static_cast<PluginInstance*>(npp->pdata);\n    if (instance)\n    {\n        ProxyControl* proxyControl = instance->getProxyControl();\n        if (proxyControl)\n        {\n            return proxyControl->leave();\n        }\n    }\n    return 0;\n}\n\n\/\/ Note deallocate() can be invoked after the plugin instance is destroyed.\nvoid StubObject::deallocate()\n{\n    printf(\"%s()\\n\", __func__);\n    PluginInstance* instance = static_cast<PluginInstance*>(npp->pdata);\n    if (instance)\n    {\n        StubControl* stubControl = instance->getStubControl();\n        if (stubControl)\n        {\n            stubControl->remove(object);\n        }\n    }\n    delete object;\n    delete this;\n}\n\nvoid StubObject::invalidate()\n{\n    printf(\"%s()\\n\", __func__);\n}\n\nbool StubObject::hasMethod(NPIdentifier name)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s)\\n\", __func__, identifier);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kOperation)\n        {\n            found = true;\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::invoke(NPIdentifier name, const NPVariant* args, uint32_t arg_count, NPVariant* result)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s, %p, %u, %p)\\n\", __func__, identifier, args, arg_count, result);\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kOperation)\n        {\n            Reflect::Method method(metaData);\n            unsigned argumentCount = method.getParameterCount();\n            \/\/ TODO: Support variadic operation\n            if (argumentCount != arg_count)\n            {\n                continue;\n            }\n            enter();\n            Reflect::Parameter parameter = method.listParameter();\n            Any arguments[argumentCount];\n            for (unsigned i = 0; i < argumentCount; ++i)\n            {\n                parameter.next();\n                arguments[i] = convertToAny(npp, &args[i], parameter.getType());\n            }\n            Any value = object->call(interfaceNumber, data->number, argumentCount, arguments);\n            processResult(npp, value, result);\n            found = true;\n            leave();\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::invokeDefault(const NPVariant* args, uint32_t arg_count, NPVariant* result)\n{\n    printf(\"%s()\\n\", __func__);\n    return false;\n}\n\nbool StubObject::hasProperty(NPIdentifier name)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s)\\n\", __func__, identifier);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kConstant || *metaData == Reflect::kGetter || *metaData == Reflect::kSetter)\n        {\n            found = true;\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::getProperty(NPIdentifier name, NPVariant* result)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s)\\n\", __func__, identifier);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kConstant)\n        {\n            \/\/ TODO: eval the constant value\n            found = true;\n            break;\n        }\n        if (*metaData == Reflect::kGetter)\n        {\n            enter();\n            Any property = object->call(interfaceNumber, data->number, 0, 0);\n            processResult(npp, property, result);\n            found = true;\n            leave();\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::setProperty(NPIdentifier name, const NPVariant* value)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s)\\n\", __func__, identifier);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kSetter)\n        {\n            Reflect::Method method(metaData);\n            Reflect::Parameter parameter = method.listParameter();\n            parameter.next();\n            enter();\n            Any argument = convertToAny(npp, value, parameter.getType());\n            object->call(interfaceNumber, data->number, 1, &argument);\n            found = true;\n            leave();\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::removeProperty(NPIdentifier name)\n{\n    return false;\n}\n\nbool StubObject::enumeration(NPIdentifier** value, uint32_t* count)\n{\n    return false;\n}\n\nbool StubObject::construct(const NPVariant* args, uint32_t arg_count, NPVariant* result)\n{\n    printf(\"%s(%p, %u, %p)\\n\", __func__, args, arg_count, result);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, \"createInstance\", interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kConstructor)\n        {\n            Reflect::Method method(metaData);\n            unsigned argumentCount = method.getParameterCount();\n            \/\/ TODO: Support variadic operation\n            if (argumentCount != arg_count)\n            {\n                continue;\n            }\n            enter();\n            Reflect::Parameter parameter = method.listParameter();\n            Any arguments[argumentCount];\n            for (unsigned i = 0; i < argumentCount; ++i)\n            {\n                parameter.next();\n                arguments[i] = convertToAny(npp, &args[i], parameter.getType());\n            }\n            Any value = object->call(interfaceNumber, data->number, argumentCount, arguments);\n            processResult(npp, value, result);\n            found = true;\n            leave();\n            break;\n        }\n    }\n    return found;\n}\n\nNPClass StubObject::npclass =\n{\n    NP_CLASS_STRUCT_VERSION_CTOR,\n    stubAllocate,\n    stubDeallocate,\n    stubInvalidate,\n    stubHasMethod,\n    stubInvoke,\n    stubInvokeDefault,\n    stubHasProperty,\n    stubGetProperty,\n    stubSetProperty,\n    stubRemoveProperty,\n    stubEnumeration,\n    stubConstruct\n};\n\nStubControl::StubControl(NPP npp) :\n    npp(npp)\n{\n}\n\nStubControl::~StubControl()\n{\n}\n\nNPObject* StubControl::findStub(Object* object)\n{\n    std::map<Object*, StubObject*>::iterator i;\n    i = stubMap.find(object);\n    if (i != stubMap.end())\n    {\n        return i->second;\n    }\n    return 0;\n}\n\nNPObject* StubControl::createStub(Object* object)\n{\n    NPObject* npobject = findStub(object);\n    if (npobject)\n    {\n        return npobject;\n    }\n    npobject = NPN_CreateObject(npp, &StubObject::npclass);\n    if (!npobject)\n    {\n        return 0;\n    }\n    StubObject* stub = static_cast<StubObject*>(npobject);\n    stub->setObject(object);\n    stubMap.insert(std::pair<Object*, StubObject*>(object, stub));\n    return stub;\n}\n\nvoid StubControl::remove(Object* object)\n{\n    stubMap.erase(object);\n}\n\nunsigned int PluginInstance::retain(Object* stub)\n{\n    NPObject* npobject = stubControl.findStub(stub);\n    if (!npobject)\n    {\n        return 1;\n    }\n    NPN_RetainObject(npobject);\n    return npobject->referenceCount;\n}\n\nunsigned int PluginInstance::release(Object* stub)\n{\n    NPObject* npobject = stubControl.findStub(stub);\n    if (!npobject)\n    {\n        delete stub;\n        return 0;\n    }\n    unsigned int count = npobject->referenceCount;\n    NPN_ReleaseObject(npobject);\n    return --count;\n}\n<commit_msg>(StubObject) : Add one more TODO.<commit_after>\/*\n * Copyright 2008-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 <stdio.h>\n#include <string.h>\n#include \"esnpapi.h\"\n\nnamespace\n{\n\nNPObject* stubAllocate(NPP npp, NPClass* aClass)\n{\n    return new StubObject(npp);\n}\n\nvoid stubDeallocate(NPObject* object)\n{\n    static_cast<StubObject*>(object)->deallocate();\n}\n\nvoid stubInvalidate(NPObject* object)\n{\n    static_cast<StubObject*>(object)->invalidate();\n}\n\nbool stubHasMethod(NPObject* object, NPIdentifier name)\n{\n    return static_cast<StubObject*>(object)->hasMethod(name);\n}\n\nbool stubInvoke(NPObject* object, NPIdentifier name, const NPVariant* args, uint32_t argCount, NPVariant* result)\n{\n    return static_cast<StubObject*>(object)->invoke(name, args, argCount, result);\n}\n\nbool stubInvokeDefault(NPObject* object, const NPVariant* args, uint32_t argCount, NPVariant* result)\n{\n    return static_cast<StubObject*>(object)->invokeDefault(args, argCount, result);\n}\n\nbool stubHasProperty(NPObject* object, NPIdentifier name)\n{\n    return static_cast<StubObject*>(object)->hasProperty(name);\n}\n\nbool stubGetProperty(NPObject* object, NPIdentifier name, NPVariant* result)\n{\n    return static_cast<StubObject*>(object)->getProperty(name, result);\n}\n\nbool stubSetProperty(NPObject* object, NPIdentifier name, const NPVariant* value)\n{\n    return static_cast<StubObject*>(object)->setProperty(name, value);\n}\n\nbool stubRemoveProperty(NPObject* object, NPIdentifier name)\n{\n    return static_cast<StubObject*>(object)->removeProperty(name);\n}\n\nbool stubEnumeration(NPObject* object, NPIdentifier** value, uint32_t* count)\n{\n    return static_cast<StubObject*>(object)->enumeration(value, count);\n}\n\nbool stubConstruct(NPObject* object, const NPVariant* args, uint32_t argCount, NPVariant* result)\n{\n    return static_cast<StubObject*>(object)->construct(args, argCount, result);\n}\n\nconst Reflect::SymbolData* lookupSymbolTalbe(Object* object, const char* identifier, unsigned& interfaceNumber, unsigned& symbolNumber)\n{\n    const Reflect::SymbolData* symbolTable;\n    while (symbolTable = object->getSymbolTable(interfaceNumber))\n    {\n        unsigned offset = 0;\n        for (symbolTable += symbolNumber; symbolTable->symbol; ++symbolNumber, ++symbolTable)\n        {\n            if (!std::strcmp(symbolTable->symbol, identifier))\n            {\n                return symbolTable;\n            }\n        }\n        ++interfaceNumber;\n    }\n    return 0;\n}\n\nvoid processResult(NPP npp, const Any& any, NPVariant* variant)\n{\n    \/\/ TODO: Additional code if any.isSequence() is true.\n    if (any.getType() == Any::TypeString)\n    {\n        const std::string value = static_cast<const std::string>(any);\n        if (value.length() == 0)\n        {\n            STRINGN_TO_NPVARIANT(0, 0, *variant);\n            return;\n        }\n        void* buffer = NPN_MemAlloc(value.length());\n        if (!buffer)\n        {\n            STRINGN_TO_NPVARIANT(0, 0, *variant);\n            return;\n        }\n        memmove(buffer, value.c_str(), value.length());\n        STRINGN_TO_NPVARIANT(static_cast<NPUTF8*>(buffer), value.length(), *variant);\n        return;\n    }\n    convertToVariant(npp, any, variant);\n}\n\n}   \/\/ namespace\n\nlong StubObject::enter()\n{\n    PluginInstance* instance = static_cast<PluginInstance*>(npp->pdata);\n    if (instance)\n    {\n        ProxyControl* proxyControl = instance->getProxyControl();\n        if (proxyControl)\n        {\n            return proxyControl->enter();\n        }\n    }\n    return 0;\n}\n\nlong StubObject::leave()\n{\n    PluginInstance* instance = static_cast<PluginInstance*>(npp->pdata);\n    if (instance)\n    {\n        ProxyControl* proxyControl = instance->getProxyControl();\n        if (proxyControl)\n        {\n            return proxyControl->leave();\n        }\n    }\n    return 0;\n}\n\n\/\/ Note deallocate() can be invoked after the plugin instance is destroyed.\nvoid StubObject::deallocate()\n{\n    printf(\"%s()\\n\", __func__);\n    PluginInstance* instance = static_cast<PluginInstance*>(npp->pdata);\n    if (instance)\n    {\n        StubControl* stubControl = instance->getStubControl();\n        if (stubControl)\n        {\n            stubControl->remove(object);\n        }\n    }\n    delete object;\n    delete this;\n}\n\nvoid StubObject::invalidate()\n{\n    printf(\"%s()\\n\", __func__);\n}\n\nbool StubObject::hasMethod(NPIdentifier name)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s)\\n\", __func__, identifier);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kOperation)\n        {\n            found = true;\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::invoke(NPIdentifier name, const NPVariant* args, uint32_t arg_count, NPVariant* result)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s, %p, %u, %p)\\n\", __func__, identifier, args, arg_count, result);\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kOperation)\n        {\n            Reflect::Method method(metaData);\n            unsigned argumentCount = method.getParameterCount();\n            \/\/ TODO: Support variadic operation\n            if (argumentCount != arg_count)\n            {\n                continue;\n            }\n            enter();\n            Reflect::Parameter parameter = method.listParameter();\n            Any arguments[argumentCount];\n            for (unsigned i = 0; i < argumentCount; ++i)\n            {\n                parameter.next();\n                arguments[i] = convertToAny(npp, &args[i], parameter.getType());\n            }\n            Any value = object->call(interfaceNumber, data->number, argumentCount, arguments);\n            processResult(npp, value, result);\n            found = true;\n            leave();\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::invokeDefault(const NPVariant* args, uint32_t arg_count, NPVariant* result)\n{\n    printf(\"%s()\\n\", __func__);\n    return false;\n}\n\nbool StubObject::hasProperty(NPIdentifier name)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s)\\n\", __func__, identifier);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kConstant || *metaData == Reflect::kGetter || *metaData == Reflect::kSetter)\n        {\n            found = true;\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::getProperty(NPIdentifier name, NPVariant* result)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s)\\n\", __func__, identifier);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kConstant)\n        {\n            \/\/ TODO: eval the constant value\n            found = true;\n            break;\n        }\n        if (*metaData == Reflect::kGetter)\n        {\n            enter();\n            Any property = object->call(interfaceNumber, data->number, 0, 0);\n            processResult(npp, property, result);\n            found = true;\n            leave();\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::setProperty(NPIdentifier name, const NPVariant* value)\n{\n    NPUTF8* identifier = NPN_UTF8FromIdentifier(name);\n    if (!identifier)\n    {\n        return false;\n    }\n\n    printf(\"%s(%s)\\n\", __func__, identifier);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, identifier, interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kSetter)\n        {\n            Reflect::Method method(metaData);\n            Reflect::Parameter parameter = method.listParameter();\n            parameter.next();\n            enter();\n            Any argument = convertToAny(npp, value, parameter.getType());\n            object->call(interfaceNumber, data->number, 1, &argument);\n            found = true;\n            leave();\n            break;\n        }\n    }\n    NPN_MemFree(identifier);\n    return found;\n}\n\nbool StubObject::removeProperty(NPIdentifier name)\n{\n    return false;\n}\n\nbool StubObject::enumeration(NPIdentifier** value, uint32_t* count)\n{\n    return false;\n}\n\nbool StubObject::construct(const NPVariant* args, uint32_t arg_count, NPVariant* result)\n{\n    printf(\"%s(%p, %u, %p)\\n\", __func__, args, arg_count, result);\n\n    bool found = false;\n    unsigned interfaceNumber = 0;\n    unsigned symbolNumber = 0;\n    for (;; ++symbolNumber)\n    {\n        const Reflect::SymbolData* data = lookupSymbolTalbe(object, \"createInstance\", interfaceNumber, symbolNumber);\n        if (!data)\n        {\n            break;\n        }\n        const char* metaData = object->getMetaData(interfaceNumber);\n        metaData += data->offset;\n        if (*metaData == Reflect::kConstructor)\n        {\n            Reflect::Method method(metaData);\n            unsigned argumentCount = method.getParameterCount();\n            \/\/ TODO: Support variadic operation\n            if (argumentCount != arg_count)\n            {\n                continue;\n            }\n            enter();\n            Reflect::Parameter parameter = method.listParameter();\n            Any arguments[argumentCount];\n            for (unsigned i = 0; i < argumentCount; ++i)\n            {\n                parameter.next();\n                arguments[i] = convertToAny(npp, &args[i], parameter.getType());\n            }\n            Any value = object->call(interfaceNumber, data->number, argumentCount, arguments);\n            processResult(npp, value, result);\n            found = true;\n            leave();\n            break;\n        }\n    }\n    return found;\n}\n\nNPClass StubObject::npclass =\n{\n    NP_CLASS_STRUCT_VERSION_CTOR,\n    stubAllocate,\n    stubDeallocate,\n    stubInvalidate,\n    stubHasMethod,\n    stubInvoke,\n    stubInvokeDefault,\n    stubHasProperty,\n    stubGetProperty,\n    stubSetProperty,\n    stubRemoveProperty,\n    stubEnumeration,\n    stubConstruct\n};\n\nStubControl::StubControl(NPP npp) :\n    npp(npp)\n{\n}\n\nStubControl::~StubControl()\n{\n}\n\nNPObject* StubControl::findStub(Object* object)\n{\n    std::map<Object*, StubObject*>::iterator i;\n    i = stubMap.find(object);\n    if (i != stubMap.end())\n    {\n        return i->second;\n    }\n    return 0;\n}\n\nNPObject* StubControl::createStub(Object* object)\n{\n    NPObject* npobject = findStub(object);\n    if (npobject)\n    {\n        return npobject;\n    }\n    npobject = NPN_CreateObject(npp, &StubObject::npclass);\n    if (!npobject)\n    {\n        return 0;\n    }\n    StubObject* stub = static_cast<StubObject*>(npobject);\n    stub->setObject(object);\n    stubMap.insert(std::pair<Object*, StubObject*>(object, stub));\n    return stub;\n}\n\nvoid StubControl::remove(Object* object)\n{\n    stubMap.erase(object);\n}\n\nunsigned int PluginInstance::retain(Object* stub)\n{\n    NPObject* npobject = stubControl.findStub(stub);\n    if (!npobject)\n    {\n        return 1;\n    }\n    NPN_RetainObject(npobject);\n    return npobject->referenceCount;\n}\n\nunsigned int PluginInstance::release(Object* stub)\n{\n    NPObject* npobject = stubControl.findStub(stub);\n    if (!npobject)\n    {\n        delete stub;\n        return 0;\n    }\n    unsigned int count = npobject->referenceCount;\n    NPN_ReleaseObject(npobject);\n    return --count;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n*  killstreaks.cpp\n*  StatusSpec project\n*\n*  Copyright (c) 2014 thesupremecommander\n*  BSD 2-Clause License\n*  http:\/\/opensource.org\/licenses\/BSD-2-Clause\n*\n*\/\n\n#include \"killstreaks.h\"\n\nKillstreaks::Killstreaks() {\n\tenabled = new ConVar(\"statusspec_killstreaks_enabled\", \"0\", FCVAR_NONE, \"enable killstreaks display\", Killstreaks::ToggleEnabled);\n}\n\nbool Killstreaks::IsEnabled() {\n\treturn enabled->GetBool();\n}\n\nbool Killstreaks::FireEvent(IGameEvent *event) {\n\tif (strcmp(event->GetName(), \"player_spawn\") == 0) {\n\t\tint userID = event->GetInt(\"userid\", -1);\n\n\t\tif (userID != -1) {\n\t\t\tcurrentKillstreaks.erase(userID);\n\t\t}\n\t}\n\telse if (strcmp(event->GetName(), \"player_death\") == 0) {\n\t\tint victimUserID = event->GetInt(\"userid\", -1);\n\t\tint attackerUserID = event->GetInt(\"attacker\", -1);\n\t\tint assisterUserID = event->GetInt(\"assister\", -1);\n\t\tint weaponID = event->GetInt(\"weaponid\");\n\n\t\tif (attackerUserID != -1) {\n\t\t\tif (attackerUserID != victimUserID) {\n\t\t\t\tcurrentKillstreaks[attackerUserID][weaponID]++;\n\n\t\t\t\tif (IsEnabled()) {\n\t\t\t\t\tint attackerKillstreak = 0;\n\n\t\t\t\t\tfor (auto iterator = currentKillstreaks[victimUserID].begin(); iterator != currentKillstreaks[victimUserID].end(); ++iterator) {\n\t\t\t\t\t\tattackerKillstreak += iterator->second;\n\t\t\t\t\t}\n\n\t\t\t\t\tevent->SetInt(\"kill_streak_total\", GetCurrentKillstreak(attackerUserID));\n\n\t\t\t\t\tif (weaponID != TF_WEAPON_NONE) {\n\t\t\t\t\t\tevent->SetInt(\"kill_streak_wep\", currentKillstreaks[attackerUserID][weaponID]);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tevent->SetInt(\"kill_streak_wep\", 0);\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\tif (IsEnabled()) {\n\t\t\t\t\tevent->SetInt(\"kill_streak_total\", 0);\n\t\t\t\t\tevent->SetInt(\"kill_streak_wep\", 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (assisterUserID != -1) {\n\t\t\tIClientEntity *assister = Interfaces::pClientEntityList->GetClientEntity(Interfaces::pEngineClient->GetPlayerForUserID(assisterUserID));\n\n\t\t\tif (assister && Entities::CheckClassBaseclass(assister->GetClientClass(), \"DT_TFPlayer\")) {\n\t\t\t\tfor (int i = 0; i < MAX_WEAPONS; i++) {\n\t\t\t\t\tIClientEntity *weapon = Interfaces::pClientEntityList->GetClientEntity(ENTITY_INDEX_FROM_ENTITY_OFFSET(assister, Entities::pCTFPlayer__m_hMyWeapons[i]));\n\n\t\t\t\t\tif (!weapon || !Entities::CheckClassBaseclass(weapon->GetClientClass(), \"DT_WeaponMedigun\")) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tbool healing = *MAKE_PTR(bool *, weapon, Entities::pCWeaponMedigun__m_bHealing);\n\n\t\t\t\t\tif (healing) {\n\t\t\t\t\t\tint healingTarget = ENTITY_INDEX_FROM_ENTITY_OFFSET(weapon, Entities::pCWeaponMedigun__m_hHealingTarget);\n\n\t\t\t\t\t\tif (healingTarget == Interfaces::pEngineClient->GetPlayerForUserID(attackerUserID)) {\n\t\t\t\t\t\t\tcurrentKillstreaks[assisterUserID][TF_WEAPON_MEDIGUN]++;\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\tif (IsEnabled()) {\n\t\t\t\tevent->SetInt(\"kill_streak_assist\", GetCurrentKillstreak(assisterUserID));\n\t\t\t}\n\t\t}\n\n\t\tif (victimUserID != -1) {\n\t\t\tif (IsEnabled()) {\n\t\t\t\tevent->SetInt(\"kill_streak_victim\", GetCurrentKillstreak(victimUserID));\n\t\t\t}\n\t\t}\n\n\t\tif (IsEnabled()) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nvoid Killstreaks::ProcessEntity(IClientEntity* entity) {\n\tif (!Entities::CheckClassBaseclass(entity->GetClientClass(), \"DT_TFPlayer\")) {\n\t\treturn;\n\t}\n\n\tif (IsEnabled()) {\n\t\tint *killstreakPlayer = MAKE_PTR(int *, entity, Entities::pCTFPlayer__m_iKillStreak);\n\t\t*killstreakPlayer = 0;\n\n\t\tC_PlayerResource *playerResource = dynamic_cast<C_PlayerResource *>(Interfaces::GetGameResources());\n\n\t\tif (playerResource) {\n\t\t\tplayer_info_t playerInfo;\n\n\t\t\tif (Interfaces::pEngineClient->GetPlayerInfo(entity->entindex(), &playerInfo)) {\n\t\t\t\tint *killstreakGlobal = MAKE_PTR(int *, playerResource, Entities::pCTFPlayerResource__m_iKillstreak[entity->entindex()]);\n\t\t\t\t*killstreakGlobal = 0;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Killstreaks::PostEntityUpdate() {\n\tC_PlayerResource *playerResource = dynamic_cast<C_PlayerResource *>(Interfaces::GetGameResources());\n\n\tfor (auto iterator = currentKillstreaks.begin(); iterator != currentKillstreaks.end(); ++iterator) {\n\t\tint player = Interfaces::pEngineClient->GetPlayerForUserID(iterator->first);\n\t\tIClientEntity *playerEntity = Interfaces::pClientEntityList->GetClientEntity(player);\n\n\t\tif (!playerEntity || !Entities::CheckClassBaseclass(playerEntity->GetClientClass(), \"DT_TFPlayer\")) {\n\t\t\tcurrentKillstreaks.erase(iterator);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (IsEnabled() && Interfaces::GetGameResources()->IsAlive(player)) {\n\t\t\tint currentKillstreak = GetCurrentKillstreak(iterator->first);\n\n\t\t\tint *killstreakPlayer = MAKE_PTR(int *, playerEntity, Entities::pCTFPlayer__m_iKillStreak);\n\t\t\t*killstreakPlayer = currentKillstreak;\n\n\t\t\tif (playerResource) {\n\t\t\t\tint *killstreakGlobal = MAKE_PTR(int *, playerResource, Entities::pCTFPlayerResource__m_iKillstreak[player]);\n\t\t\t\t*killstreakGlobal = currentKillstreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nint Killstreaks::GetCurrentKillstreak(int userid) {\n\tint killstreak = 0;\n\n\tfor (auto iterator = currentKillstreaks[userid].begin(); iterator != currentKillstreaks[userid].end(); ++iterator) {\n\t\tkillstreak += iterator->second;\n\t}\n\n\treturn killstreak;\n}\n\nvoid Killstreaks::ToggleEnabled(IConVar *var, const char *pOldValue, float flOldValue) {\n\tif (!g_Killstreaks->IsEnabled()) {\n\t\tfor (int i = 0; i <= MAX_PLAYERS; i++) {\n\t\t\tIClientEntity *entity = Interfaces::pClientEntityList->GetClientEntity(i);\n\n\t\t\tif (!entity) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (!Entities::CheckClassBaseclass(entity->GetClientClass(), \"DT_TFPlayer\")) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tC_PlayerResource *playerResource = dynamic_cast<C_PlayerResource *>(Interfaces::GetGameResources());\n\n\t\t\tif (playerResource) {\n\t\t\t\tplayer_info_t playerInfo;\n\n\t\t\t\tif (Interfaces::pEngineClient->GetPlayerInfo(entity->entindex(), &playerInfo)) {\n\t\t\t\t\tint *killstreak = MAKE_PTR(int *, playerResource, Entities::pCTFPlayerResource__m_iKillstreak[entity->entindex()]);\n\t\t\t\t\t*killstreak = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}<commit_msg>Fix killstreak module causing post-game crashes.<commit_after>\/*\n*  killstreaks.cpp\n*  StatusSpec project\n*\n*  Copyright (c) 2014 thesupremecommander\n*  BSD 2-Clause License\n*  http:\/\/opensource.org\/licenses\/BSD-2-Clause\n*\n*\/\n\n#include \"killstreaks.h\"\n\nKillstreaks::Killstreaks() {\n\tenabled = new ConVar(\"statusspec_killstreaks_enabled\", \"0\", FCVAR_NONE, \"enable killstreaks display\", Killstreaks::ToggleEnabled);\n}\n\nbool Killstreaks::IsEnabled() {\n\treturn enabled->GetBool();\n}\n\nbool Killstreaks::FireEvent(IGameEvent *event) {\n\tif (strcmp(event->GetName(), \"player_spawn\") == 0) {\n\t\tint userID = event->GetInt(\"userid\", -1);\n\n\t\tif (userID != -1) {\n\t\t\tcurrentKillstreaks.erase(userID);\n\t\t}\n\t}\n\telse if (strcmp(event->GetName(), \"player_death\") == 0) {\n\t\tint victimUserID = event->GetInt(\"userid\", -1);\n\t\tint attackerUserID = event->GetInt(\"attacker\", -1);\n\t\tint assisterUserID = event->GetInt(\"assister\", -1);\n\t\tint weaponID = event->GetInt(\"weaponid\");\n\n\t\tif (attackerUserID != -1) {\n\t\t\tif (attackerUserID != victimUserID) {\n\t\t\t\tcurrentKillstreaks[attackerUserID][weaponID]++;\n\n\t\t\t\tif (IsEnabled()) {\n\t\t\t\t\tint attackerKillstreak = 0;\n\n\t\t\t\t\tfor (auto iterator = currentKillstreaks[victimUserID].begin(); iterator != currentKillstreaks[victimUserID].end(); ++iterator) {\n\t\t\t\t\t\tattackerKillstreak += iterator->second;\n\t\t\t\t\t}\n\n\t\t\t\t\tevent->SetInt(\"kill_streak_total\", GetCurrentKillstreak(attackerUserID));\n\n\t\t\t\t\tif (weaponID != TF_WEAPON_NONE) {\n\t\t\t\t\t\tevent->SetInt(\"kill_streak_wep\", currentKillstreaks[attackerUserID][weaponID]);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tevent->SetInt(\"kill_streak_wep\", 0);\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\tif (IsEnabled()) {\n\t\t\t\t\tevent->SetInt(\"kill_streak_total\", 0);\n\t\t\t\t\tevent->SetInt(\"kill_streak_wep\", 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (assisterUserID != -1) {\n\t\t\tIClientEntity *assister = Interfaces::pClientEntityList->GetClientEntity(Interfaces::pEngineClient->GetPlayerForUserID(assisterUserID));\n\n\t\t\tif (assister && Entities::CheckClassBaseclass(assister->GetClientClass(), \"DT_TFPlayer\")) {\n\t\t\t\tfor (int i = 0; i < MAX_WEAPONS; i++) {\n\t\t\t\t\tIClientEntity *weapon = Interfaces::pClientEntityList->GetClientEntity(ENTITY_INDEX_FROM_ENTITY_OFFSET(assister, Entities::pCTFPlayer__m_hMyWeapons[i]));\n\n\t\t\t\t\tif (!weapon || !Entities::CheckClassBaseclass(weapon->GetClientClass(), \"DT_WeaponMedigun\")) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tbool healing = *MAKE_PTR(bool *, weapon, Entities::pCWeaponMedigun__m_bHealing);\n\n\t\t\t\t\tif (healing) {\n\t\t\t\t\t\tint healingTarget = ENTITY_INDEX_FROM_ENTITY_OFFSET(weapon, Entities::pCWeaponMedigun__m_hHealingTarget);\n\n\t\t\t\t\t\tif (healingTarget == Interfaces::pEngineClient->GetPlayerForUserID(attackerUserID)) {\n\t\t\t\t\t\t\tcurrentKillstreaks[assisterUserID][TF_WEAPON_MEDIGUN]++;\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\tif (IsEnabled()) {\n\t\t\t\tevent->SetInt(\"kill_streak_assist\", GetCurrentKillstreak(assisterUserID));\n\t\t\t}\n\t\t}\n\n\t\tif (victimUserID != -1) {\n\t\t\tif (IsEnabled()) {\n\t\t\t\tevent->SetInt(\"kill_streak_victim\", GetCurrentKillstreak(victimUserID));\n\t\t\t}\n\t\t}\n\n\t\tif (IsEnabled()) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nvoid Killstreaks::ProcessEntity(IClientEntity* entity) {\n\tif (!Entities::CheckClassBaseclass(entity->GetClientClass(), \"DT_TFPlayer\")) {\n\t\treturn;\n\t}\n\n\tif (IsEnabled()) {\n\t\tint *killstreakPlayer = MAKE_PTR(int *, entity, Entities::pCTFPlayer__m_iKillStreak);\n\t\t*killstreakPlayer = 0;\n\n\t\tC_PlayerResource *playerResource = dynamic_cast<C_PlayerResource *>(Interfaces::GetGameResources());\n\n\t\tif (playerResource) {\n\t\t\tplayer_info_t playerInfo;\n\n\t\t\tif (Interfaces::pEngineClient->GetPlayerInfo(entity->entindex(), &playerInfo)) {\n\t\t\t\tint *killstreakGlobal = MAKE_PTR(int *, playerResource, Entities::pCTFPlayerResource__m_iKillstreak[entity->entindex()]);\n\t\t\t\t*killstreakGlobal = 0;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Killstreaks::PostEntityUpdate() {\n\tif (!Interfaces::pEngineClient->IsInGame()) {\n\t\tcurrentKillstreaks.clear();\n\t\treturn;\n\t}\n\n\tC_PlayerResource *playerResource = dynamic_cast<C_PlayerResource *>(Interfaces::GetGameResources());\n\n\tfor (auto iterator = currentKillstreaks.begin(); iterator != currentKillstreaks.end(); ++iterator) {\n\t\tint player = Interfaces::pEngineClient->GetPlayerForUserID(iterator->first);\n\t\tIClientEntity *playerEntity = Interfaces::pClientEntityList->GetClientEntity(player);\n\n\t\tif (IsEnabled() && Interfaces::GetGameResources()->IsAlive(player)) {\n\t\t\tint currentKillstreak = GetCurrentKillstreak(iterator->first);\n\n\t\t\tint *killstreakPlayer = MAKE_PTR(int *, playerEntity, Entities::pCTFPlayer__m_iKillStreak);\n\t\t\t*killstreakPlayer = currentKillstreak;\n\n\t\t\tif (playerResource) {\n\t\t\t\tint *killstreakGlobal = MAKE_PTR(int *, playerResource, Entities::pCTFPlayerResource__m_iKillstreak[player]);\n\t\t\t\t*killstreakGlobal = currentKillstreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nint Killstreaks::GetCurrentKillstreak(int userid) {\n\tint killstreak = 0;\n\n\tfor (auto iterator = currentKillstreaks[userid].begin(); iterator != currentKillstreaks[userid].end(); ++iterator) {\n\t\tkillstreak += iterator->second;\n\t}\n\n\treturn killstreak;\n}\n\nvoid Killstreaks::ToggleEnabled(IConVar *var, const char *pOldValue, float flOldValue) {\n\tif (!g_Killstreaks->IsEnabled()) {\n\t\tfor (int i = 0; i <= MAX_PLAYERS; i++) {\n\t\t\tIClientEntity *entity = Interfaces::pClientEntityList->GetClientEntity(i);\n\n\t\t\tif (!entity) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (!Entities::CheckClassBaseclass(entity->GetClientClass(), \"DT_TFPlayer\")) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tC_PlayerResource *playerResource = dynamic_cast<C_PlayerResource *>(Interfaces::GetGameResources());\n\n\t\t\tif (playerResource) {\n\t\t\t\tplayer_info_t playerInfo;\n\n\t\t\t\tif (Interfaces::pEngineClient->GetPlayerInfo(entity->entindex(), &playerInfo)) {\n\t\t\t\t\tint *killstreak = MAKE_PTR(int *, playerResource, Entities::pCTFPlayerResource__m_iKillstreak[entity->entindex()]);\n\t\t\t\t\t*killstreak = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/** Splits input into tokens (words) *\/\n\n#include <string.h>\n#include <ctype.h>\n#include <iostream>\n#include <string>\n\n#define PUNCTUATION \".,!?()&@()[]{}\/\\\\\\\"'#:;<>^”*=-−—\"\n\nusing namespace std;\n\nclass Tokenizer\n{\nprivate:\n  const char* keep; \/\/ punctuation to include in output  \n  bool includeParens;\n  char lastChar;\n  \n  inline bool isPunctuation(char ch) \n  {\n    if(ch == '\\'')\n      return isWS(lastChar);\n\n    return strchr(PUNCTUATION, ch);\n  }\n\n  inline bool isDigit(char ch) \n  {\n    return isdigit(ch);\n  }\n\n  inline bool isKeep(char ch) \n  {\n    return strchr(keep, ch);\n  }\n\n  inline bool isWS(char ch)\n  {\n    return isspace(ch);\n  }\n\n  inline void space()\n  {\n    if(!isWS(lastChar)) {\n      fputc(' ', stdout);\n      lastChar = ' ';\n    }\n  }\n\n  inline void character(char ch)\n  {\n    fputc(ch, stdout);\n    lastChar = ch;\n  }\n  \npublic:\n  Tokenizer(const char* keep, bool includeParens) {\n    this->keep = keep;\n    this->includeParens = includeParens;\n    this->lastChar = '\\0';\n  }\n\n  void tokenize(string input) {\n    int parenLevel = 0;\n    for(size_t i=0; i < input.length(); i++) {\n      char ch = input[i];\n      switch(ch) {\n      case '(':\n        parenLevel++;\n        if(!includeParens) \/\/ skip over the '('\n          continue;\n        else {\n          space();\n          character('(');\n          space();\n          continue;\n        }\n        break;\n      case ')':\n        parenLevel--;\n        if(!includeParens) \/\/ skip over the ')'\n          continue;\n        else {\n          space();\n          character(')');\n          space();\n          continue;\n        }\n        break;\n      }\n      \n      if(parenLevel == 0 || includeParens) {\n        if(isWS(ch))\n          space();\n        else if(isPunctuation(ch) && isKeep(ch)) {\n          space();\n          character(ch);\n          space();\n        }\n        else if(isPunctuation(ch)) {\n          \/\/ don't break words on commas delimiting orders of magnitude\n          \/\/ in numbers, e.g. 1,000,000\n          if(ch == ',' && isDigit(lastChar) && isDigit(input[i+1]))\n            character(ch);\n          else\n            space();\n        }\n        else if(!isPunctuation(ch))\n          character(tolower(ch));\n      }\n    }\n\n    character('\\n');\n  } \/\/ end of tokenize()\n};\n\nvoid printUsage(const char* name)\n{\n  printf(\"Usage: %s [--keep CHARACTERS] [--parens]\\n\", name);\n}\n\nint main(int argc, const char** argv)\n{\n  bool includeParens = false;\n  const char* keep = \"\";\n\n  for(int i=1; i<argc; i++) {\n    if(strcmp(\"--keep\", argv[i]) == 0 && i<argc-1) {\n      keep = argv[i+1];\n      i++;\n    }\n    else if(strcmp(\"--parens\", argv[i]) == 0) {\n      includeParens = true;\n    }\n    else {\n      printUsage(argv[0]);\n      return 1;\n    }\n  }\n\n  Tokenizer tokenizer(keep, includeParens);\n\n  string line;\n  try {\n    while(getline(cin, line)) {\n      tokenizer.tokenize(line);\n    }\n  } catch(string err) {\n    cerr << err << endl;\n    return 1;\n  }\n\n}\n<commit_msg>recognize the ASCII character 0x93 (open quote) as punctuation in the tokenizer<commit_after>\/** Splits input into tokens (words) *\/\n\n#include <string.h>\n#include <ctype.h>\n#include <iostream>\n#include <string>\n\n#define PUNCTUATION \".,!?()&@()[]{}\/\\\\\\\"'#:;<>^”*=-−—\\x93\"\n\nusing namespace std;\n\nclass Tokenizer\n{\nprivate:\n  const char* keep; \/\/ punctuation to include in output  \n  bool includeParens;\n  char lastChar;\n  \n  inline bool isPunctuation(char ch) \n  {\n    if(ch == '\\'')\n      return isWS(lastChar);\n\n    return strchr(PUNCTUATION, ch);\n  }\n\n  inline bool isDigit(char ch) \n  {\n    return isdigit(ch);\n  }\n\n  inline bool isKeep(char ch) \n  {\n    return strchr(keep, ch);\n  }\n\n  inline bool isWS(char ch)\n  {\n    return isspace(ch);\n  }\n\n  inline void space()\n  {\n    if(!isWS(lastChar)) {\n      fputc(' ', stdout);\n      lastChar = ' ';\n    }\n  }\n\n  inline void character(char ch)\n  {\n    fputc(ch, stdout);\n    lastChar = ch;\n  }\n  \npublic:\n  Tokenizer(const char* keep, bool includeParens) {\n    this->keep = keep;\n    this->includeParens = includeParens;\n    this->lastChar = '\\0';\n  }\n\n  void tokenize(string input) {\n    int parenLevel = 0;\n    for(size_t i=0; i < input.length(); i++) {\n      char ch = input[i];\n      switch(ch) {\n      case '(':\n        parenLevel++;\n        if(!includeParens) \/\/ skip over the '('\n          continue;\n        else {\n          space();\n          character('(');\n          space();\n          continue;\n        }\n        break;\n      case ')':\n        parenLevel--;\n        if(!includeParens) \/\/ skip over the ')'\n          continue;\n        else {\n          space();\n          character(')');\n          space();\n          continue;\n        }\n        break;\n      }\n      \n      if(parenLevel == 0 || includeParens) {\n        if(isWS(ch))\n          space();\n        else if(isPunctuation(ch) && isKeep(ch)) {\n          space();\n          character(ch);\n          space();\n        }\n        else if(isPunctuation(ch)) {\n          \/\/ don't break words on commas delimiting orders of magnitude\n          \/\/ in numbers, e.g. 1,000,000\n          if(ch == ',' && isDigit(lastChar) && isDigit(input[i+1]))\n            character(ch);\n          else\n            space();\n        }\n        else if(!isPunctuation(ch))\n          character(tolower(ch));\n      }\n    }\n\n    character('\\n');\n  } \/\/ end of tokenize()\n};\n\nvoid printUsage(const char* name)\n{\n  printf(\"Usage: %s [--keep CHARACTERS] [--parens]\\n\", name);\n}\n\nint main(int argc, const char** argv)\n{\n  bool includeParens = false;\n  const char* keep = \"\";\n\n  for(int i=1; i<argc; i++) {\n    if(strcmp(\"--keep\", argv[i]) == 0 && i<argc-1) {\n      keep = argv[i+1];\n      i++;\n    }\n    else if(strcmp(\"--parens\", argv[i]) == 0) {\n      includeParens = true;\n    }\n    else {\n      printUsage(argv[0]);\n      return 1;\n    }\n  }\n\n  Tokenizer tokenizer(keep, includeParens);\n\n  string line;\n  try {\n    while(getline(cin, line)) {\n      tokenizer.tokenize(line);\n    }\n  } catch(string err) {\n    cerr << err << endl;\n    return 1;\n  }\n\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 \"ProducerSideServiceImpl.h\"\n\n#include <thread>\n\n#include \"OrbitBase\/Logging.h\"\n\nnamespace orbit_service {\n\nvoid ProducerSideServiceImpl::OnCaptureStartRequested(CaptureEventBuffer* capture_event_buffer) {\n  CHECK(capture_event_buffer != nullptr);\n  LOG(\"About to send StartCaptureCommand to CaptureEventProducers (if any)\");\n  {\n    absl::WriterMutexLock lock{&capture_event_buffer_mutex_};\n    capture_event_buffer_ = capture_event_buffer;\n  }\n  {\n    absl::MutexLock lock{&service_state_mutex_};\n    service_state_.capture_status = CaptureStatus::kCaptureStarted;\n  }\n}\n\nvoid ProducerSideServiceImpl::OnCaptureStopRequested() {\n  LOG(\"About to send StopCaptureCommand to CaptureEventProducers (if any)\");\n  {\n    absl::MutexLock lock{&service_state_mutex_};\n    service_state_.capture_status = CaptureStatus::kCaptureStopping;\n\n    \/\/ Wait (for a limited amount of time) for all producers to send AllEventsSent or to disconnect.\n    service_state_mutex_.AwaitWithTimeout(\n        absl::Condition(\n            +[](ServiceState* service_state) {\n              return service_state->producers_remaining == 0 || service_state->exit_requested;\n            },\n            &service_state_),\n        absl::Milliseconds(static_cast<int64_t>(max_wait_for_all_events_sent_ms_)));\n    CHECK(service_state_.producers_remaining >= 0);\n    if (service_state_.producers_remaining == 0) {\n      LOG(\"All CaptureEventProducers have finished sending their CaptureEvents\");\n    } else {\n      ERROR(\n          \"Stopped receiving CaptureEvents from CaptureEventProducers \"\n          \"even if not all have sent all their CaptureEvents\");\n    }\n    LOG(\"About to send CaptureFinishedCommand to CaptureEventProducers (if any)\");\n    service_state_.capture_status = CaptureStatus::kCaptureFinished;\n    service_state_.producers_remaining = 0;\n  }\n\n  {\n    absl::WriterMutexLock lock{&capture_event_buffer_mutex_};\n    capture_event_buffer_ = nullptr;\n  }\n}\n\nvoid ProducerSideServiceImpl::OnExitRequest() {\n  {\n    absl::MutexLock lock{&service_state_mutex_};\n    service_state_.exit_requested = true;\n  }\n\n  LOG(\"Attempting to disconnect from CaptureEventProducers as exit was requested\");\n  {\n    absl::MutexLock lock{&server_contexts_mutex_};\n    for (grpc::ServerContext* context : server_contexts_) {\n      \/\/ This should cause blocking Reads on ServerReaderWriter to fail immediately.\n      context->TryCancel();\n    }\n  }\n\n  {\n    absl::WriterMutexLock lock{&capture_event_buffer_mutex_};\n    capture_event_buffer_ = nullptr;\n  }\n}\n\ngrpc::Status ProducerSideServiceImpl::ReceiveCommandsAndSendEvents(\n    ::grpc::ServerContext* context,\n    ::grpc::ServerReaderWriter< ::orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                                ::orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream) {\n  LOG(\"A CaptureEventProducer has connected calling ReceiveCommandsAndSendEvents\");\n\n  {\n    absl::MutexLock lock{&server_contexts_mutex_};\n    server_contexts_.emplace(context);\n  }\n\n  \/\/ This keeps whether we are still waiting for an AllEventsSent message at the end of a capture.\n  \/\/ It starts as true as we aren't yet waiting for such message when the connection is established.\n  \/\/ Note that this will also be protected by service_state_mutex_.\n  bool all_events_sent_received = true;\n\n  std::atomic<bool> receive_events_thread_exited = false;\n\n  \/\/ This thread is responsible for writing on stream, and specifically for\n  \/\/ sending StartCaptureCommands and StopCaptureCommands to the connected producer.\n  std::thread send_commands_thread{&ProducerSideServiceImpl::SendCommandsThread,\n                                   this,\n                                   context,\n                                   stream,\n                                   &all_events_sent_received,\n                                   &receive_events_thread_exited};\n\n  \/\/ This thread is responsible for reading from stream, and specifically for\n  \/\/ receiving CaptureEvents and AllEventsSent messages.\n  std::thread receive_events_thread{&ProducerSideServiceImpl::ReceiveEventsThread, this, context,\n                                    stream, &all_events_sent_received};\n  receive_events_thread.join();\n\n  \/\/ When receive_events_thread exits because stream->Read(&request) fails,\n  \/\/ it means that the producer has disconnected: ask send_commands_thread to exit, too.\n  receive_events_thread_exited = true;\n  send_commands_thread.join();\n\n  {\n    absl::MutexLock lock{&server_contexts_mutex_};\n    server_contexts_.erase(context);\n  }\n\n  LOG(\"Finished handling ReceiveCommandsAndSendEvents for a CaptureEventProducer\");\n  return grpc::Status::OK;\n}\n\nstatic bool SendStartCaptureCommand(\n    grpc::ServerContext* context,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream) {\n  orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse command;\n  command.mutable_start_capture_command();\n  if (!stream->Write(command)) {\n    ERROR(\"Sending StartCaptureCommand to CaptureEventProducer\");\n    LOG(\"Terminating call to ReceiveCommandsAndSendEvents as Write failed\");\n    \/\/ Cause Read in ReceiveEventsThread to also fail if for some reason it hasn't already.\n    context->TryCancel();\n    return false;\n  }\n  LOG(\"Sent StartCaptureCommand to CaptureEventProducer\");\n  return true;\n}\n\nstatic bool SendStopCaptureCommand(\n    grpc::ServerContext* context,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream) {\n  orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse command;\n  command.mutable_stop_capture_command();\n  if (!stream->Write(command)) {\n    ERROR(\"Sending StopCaptureCommand to CaptureEventProducer\");\n    LOG(\"Terminating call to ReceiveCommandsAndSendEvents as Write failed\");\n    \/\/ Cause Read in ReceiveEventsThread to also fail if for some reason it hasn't already.\n    context->TryCancel();\n    return false;\n  }\n  LOG(\"Sent StopCaptureCommand to CaptureEventProducer\");\n  return true;\n}\n\nstatic bool SendCaptureFinishedCommand(\n    grpc::ServerContext* context,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream) {\n  orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse command;\n  command.mutable_capture_finished_command();\n  if (!stream->Write(command)) {\n    ERROR(\"Sending CaptureFinishedCommand to CaptureEventProducer\");\n    LOG(\"Terminating call to ReceiveCommandsAndSendEvents as Write failed\");\n    \/\/ Cause Read in ReceiveEventsThread to also fail if for some reason it hasn't already.\n    context->TryCancel();\n    return false;\n  }\n  LOG(\"Sent CaptureFinishedCommand to CaptureEventProducer\");\n  return true;\n}\n\nvoid ProducerSideServiceImpl::SendCommandsThread(\n    grpc::ServerContext* context,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream,\n    bool* all_events_sent_received, std::atomic<bool>* receive_events_thread_exited) {\n  \/\/ As a result of initializing prev_capture_status to kCaptureFinished,\n  \/\/ an initial StartCaptureCommand is sent\n  \/\/ if service_state_.capture_status is actually CaptureStatus::kCaptureStarted,\n  \/\/ and an initial StopCaptureCommand is sent (with little effect)\n  \/\/ if service_state_.capture_status is actually CaptureStatus::kCaptureStopping.\n  CaptureStatus prev_capture_status = CaptureStatus::kCaptureFinished;\n\n  \/\/ This loop keeps track of changes to service_state_.capture_status using\n  \/\/ conditional critical sections on service_state_mutex_ and updating prev_capture_status,\n  \/\/ and sends StartCaptureCommands and StopCaptureCommands accordingly.\n  \/\/ It exits when one of *receive_events_thread_exited and service_state_.exit_requested is true,\n  \/\/ or when Write fails (because the producer disconnected or because the context was cancelled).\n  while (true) {\n    \/\/ This is set when ReceiveEventsThread has exited. At that point this thread should also exit.\n    if (*receive_events_thread_exited) {\n      return;\n    }\n\n    CaptureStatus curr_capture_status;\n    {\n      absl::MutexLock lock{&service_state_mutex_};\n      if (service_state_.exit_requested) {\n        return;\n      }\n\n      if (service_state_.capture_status == prev_capture_status) {\n        \/\/ Wait for service_state_.capture_status to change or for service_state->exit_requested\n        \/\/ (the next iteration will handle the change).\n        \/\/ Use a timeout to periodically check (in the next iteration)\n        \/\/ for *terminate_send_commands_thread, set by ReceiveCommandsAndSendEvents.\n        static constexpr absl::Duration kCheckExitSendCommandsThreadInterval = absl::Seconds(1);\n\n        \/\/ The three cases in this switch are almost identical, except\n        \/\/ for the value service_state->capture_status is compared with.\n        \/\/ The reason for the duplication is that AwaitWithTimeout takes a function pointer, which\n        \/\/ means that the lambda cannot capture the initial value of service_state_.capture_status.\n        switch (service_state_.capture_status) {\n          case CaptureStatus::kCaptureStarted: {\n            service_state_mutex_.AwaitWithTimeout(absl::Condition(\n                                                      +[](ServiceState* service_state) {\n                                                        return service_state->exit_requested ||\n                                                               service_state->capture_status !=\n                                                                   CaptureStatus::kCaptureStarted;\n                                                      },\n                                                      &service_state_),\n                                                  kCheckExitSendCommandsThreadInterval);\n          } break;\n\n          case CaptureStatus::kCaptureStopping: {\n            service_state_mutex_.AwaitWithTimeout(absl::Condition(\n                                                      +[](ServiceState* service_state) {\n                                                        return service_state->exit_requested ||\n                                                               service_state->capture_status !=\n                                                                   CaptureStatus::kCaptureStopping;\n                                                      },\n                                                      &service_state_),\n                                                  kCheckExitSendCommandsThreadInterval);\n          } break;\n\n          case CaptureStatus::kCaptureFinished: {\n            service_state_mutex_.AwaitWithTimeout(absl::Condition(\n                                                      +[](ServiceState* service_state) {\n                                                        return service_state->exit_requested ||\n                                                               service_state->capture_status !=\n                                                                   CaptureStatus::kCaptureFinished;\n                                                      },\n                                                      &service_state_),\n                                                  kCheckExitSendCommandsThreadInterval);\n          } break;\n        }\n\n        continue;\n      }\n\n      \/\/ service_state_.capture_status has changed compared to prev_capture_status: handle the\n      \/\/ change while holding service_state_mutex_ (that also protects all_events_sent_received).\n      switch (service_state_.capture_status) {\n        case CaptureStatus::kCaptureStarted: {\n          ++service_state_.producers_remaining;\n          *all_events_sent_received = false;\n        } break;\n\n        case CaptureStatus::kCaptureStopping:\n          break;\n\n        case CaptureStatus::kCaptureFinished: {\n          *all_events_sent_received = true;\n        } break;\n      }\n      curr_capture_status = service_state_.capture_status;\n    }  \/\/ absl::MutexLock lock{&service_state_mutex_}\n\n    \/\/ curr_capture_status now holds the new service_state_.capture_status. Send commands\n    \/\/ to the producer based on its value and also based on the value of prev_capture_status,\n    \/\/ in case this thread missed an intermediate change of service_state_.capture_status.\n    if (curr_capture_status == CaptureStatus::kCaptureStarted &&\n        prev_capture_status == CaptureStatus::kCaptureFinished) {\n      if (!SendStartCaptureCommand(context, stream)) {\n        return;\n      }\n    } else if (curr_capture_status == CaptureStatus::kCaptureStarted &&\n               prev_capture_status == CaptureStatus::kCaptureStopping) {\n      if (!SendCaptureFinishedCommand(context, stream) ||\n          !SendStartCaptureCommand(context, stream)) {\n        return;\n      }\n\n    } else if (curr_capture_status == CaptureStatus::kCaptureStopping &&\n               prev_capture_status == CaptureStatus::kCaptureStarted) {\n      if (!SendStopCaptureCommand(context, stream)) {\n        return;\n      }\n    } else if (curr_capture_status == CaptureStatus::kCaptureStopping &&\n               prev_capture_status == CaptureStatus::kCaptureFinished) {\n      if (!SendStartCaptureCommand(context, stream) || !SendStopCaptureCommand(context, stream)) {\n        return;\n      }\n\n    } else if (curr_capture_status == CaptureStatus::kCaptureFinished &&\n               prev_capture_status == CaptureStatus::kCaptureStopping) {\n      if (!SendCaptureFinishedCommand(context, stream)) {\n        return;\n      }\n    } else if (curr_capture_status == CaptureStatus::kCaptureFinished &&\n               prev_capture_status == CaptureStatus::kCaptureStarted) {\n      if (!SendStopCaptureCommand(context, stream) ||\n          !SendCaptureFinishedCommand(context, stream)) {\n        return;\n      }\n    } else {\n      UNREACHABLE();\n    }\n    prev_capture_status = curr_capture_status;\n  }\n}\n\nvoid ProducerSideServiceImpl::ReceiveEventsThread(\n    grpc::ServerContext* \/*context*\/,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream,\n    bool* all_events_sent_received) {\n  orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest request;\n  while (stream->Read(&request)) {\n    {\n      absl::MutexLock lock{&service_state_mutex_};\n      if (service_state_.exit_requested) {\n        break;\n      }\n    }\n\n    switch (request.event_case()) {\n      case orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest::kBufferedCaptureEvents: {\n        absl::MutexLock lock{&capture_event_buffer_mutex_};\n        \/\/ capture_event_buffer_ can be nullptr if a producer sends events while not capturing.\n        \/\/ Don't log an error in such a case as it could easily spam the logs.\n        if (capture_event_buffer_ != nullptr) {\n          for (orbit_grpc_protos::CaptureEvent event :\n               request.buffered_capture_events().capture_events()) {\n            capture_event_buffer_->AddEvent(std::move(event));\n          }\n        }\n      } break;\n\n      case orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest::kAllEventsSent: {\n        LOG(\"Received AllEventsSent from CaptureEventProducer\");\n        absl::MutexLock lock{&service_state_mutex_};\n        switch (service_state_.capture_status) {\n          case CaptureStatus::kCaptureStarted: {\n            ERROR(\"CaptureEventProducer sent AllEventsSent while still capturing\");\n            \/\/ Even if we weren't waiting for the AllEventsSent message yet,\n            \/\/ still keep track of the fact that we have already received it.\n            if (!*all_events_sent_received) {\n              --service_state_.producers_remaining;\n              *all_events_sent_received = true;\n            }\n          } break;\n\n          case CaptureStatus::kCaptureStopping: {\n            \/\/ If we were waiting for AllEventsSent, keep track of the fact that we received it.\n            if (!*all_events_sent_received) {\n              --service_state_.producers_remaining;\n              *all_events_sent_received = true;\n            }\n          } break;\n\n          case CaptureStatus::kCaptureFinished: {\n            ERROR(\"CaptureEventProducer sent AllEventsSent after the capture had finished\");\n          } break;\n        }\n      } break;\n\n      case orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest::EVENT_NOT_SET: {\n        ERROR(\"CaptureEventProducer sent EVENT_NOT_SET\");\n      } break;\n    }\n  }\n\n  ERROR(\"Receiving ReceiveCommandsAndSendEventsRequest from CaptureEventProducer\");\n  {\n    absl::MutexLock lock{&service_state_mutex_};\n    \/\/ Producer has disconnected: treat this as if it had sent all its CaptureEvents.\n    if (!*all_events_sent_received &&\n        (service_state_.capture_status == CaptureStatus::kCaptureStarted ||\n         service_state_.capture_status == CaptureStatus::kCaptureStopping)) {\n      --service_state_.producers_remaining;\n      *all_events_sent_received = true;\n    }\n  }\n}\n\n}  \/\/ namespace orbit_service\n<commit_msg>Replace if with switch in ProducerSideServiceImpl::SendCommandsThread<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 \"ProducerSideServiceImpl.h\"\n\n#include <thread>\n\n#include \"OrbitBase\/Logging.h\"\n\nnamespace orbit_service {\n\nvoid ProducerSideServiceImpl::OnCaptureStartRequested(CaptureEventBuffer* capture_event_buffer) {\n  CHECK(capture_event_buffer != nullptr);\n  LOG(\"About to send StartCaptureCommand to CaptureEventProducers (if any)\");\n  {\n    absl::WriterMutexLock lock{&capture_event_buffer_mutex_};\n    capture_event_buffer_ = capture_event_buffer;\n  }\n  {\n    absl::MutexLock lock{&service_state_mutex_};\n    service_state_.capture_status = CaptureStatus::kCaptureStarted;\n  }\n}\n\nvoid ProducerSideServiceImpl::OnCaptureStopRequested() {\n  LOG(\"About to send StopCaptureCommand to CaptureEventProducers (if any)\");\n  {\n    absl::MutexLock lock{&service_state_mutex_};\n    service_state_.capture_status = CaptureStatus::kCaptureStopping;\n\n    \/\/ Wait (for a limited amount of time) for all producers to send AllEventsSent or to disconnect.\n    service_state_mutex_.AwaitWithTimeout(\n        absl::Condition(\n            +[](ServiceState* service_state) {\n              return service_state->producers_remaining == 0 || service_state->exit_requested;\n            },\n            &service_state_),\n        absl::Milliseconds(static_cast<int64_t>(max_wait_for_all_events_sent_ms_)));\n    CHECK(service_state_.producers_remaining >= 0);\n    if (service_state_.producers_remaining == 0) {\n      LOG(\"All CaptureEventProducers have finished sending their CaptureEvents\");\n    } else {\n      ERROR(\n          \"Stopped receiving CaptureEvents from CaptureEventProducers \"\n          \"even if not all have sent all their CaptureEvents\");\n    }\n    LOG(\"About to send CaptureFinishedCommand to CaptureEventProducers (if any)\");\n    service_state_.capture_status = CaptureStatus::kCaptureFinished;\n    service_state_.producers_remaining = 0;\n  }\n\n  {\n    absl::WriterMutexLock lock{&capture_event_buffer_mutex_};\n    capture_event_buffer_ = nullptr;\n  }\n}\n\nvoid ProducerSideServiceImpl::OnExitRequest() {\n  {\n    absl::MutexLock lock{&service_state_mutex_};\n    service_state_.exit_requested = true;\n  }\n\n  LOG(\"Attempting to disconnect from CaptureEventProducers as exit was requested\");\n  {\n    absl::MutexLock lock{&server_contexts_mutex_};\n    for (grpc::ServerContext* context : server_contexts_) {\n      \/\/ This should cause blocking Reads on ServerReaderWriter to fail immediately.\n      context->TryCancel();\n    }\n  }\n\n  {\n    absl::WriterMutexLock lock{&capture_event_buffer_mutex_};\n    capture_event_buffer_ = nullptr;\n  }\n}\n\ngrpc::Status ProducerSideServiceImpl::ReceiveCommandsAndSendEvents(\n    ::grpc::ServerContext* context,\n    ::grpc::ServerReaderWriter< ::orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                                ::orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream) {\n  LOG(\"A CaptureEventProducer has connected calling ReceiveCommandsAndSendEvents\");\n\n  {\n    absl::MutexLock lock{&server_contexts_mutex_};\n    server_contexts_.emplace(context);\n  }\n\n  \/\/ This keeps whether we are still waiting for an AllEventsSent message at the end of a capture.\n  \/\/ It starts as true as we aren't yet waiting for such message when the connection is established.\n  \/\/ Note that this will also be protected by service_state_mutex_.\n  bool all_events_sent_received = true;\n\n  std::atomic<bool> receive_events_thread_exited = false;\n\n  \/\/ This thread is responsible for writing on stream, and specifically for\n  \/\/ sending StartCaptureCommands and StopCaptureCommands to the connected producer.\n  std::thread send_commands_thread{&ProducerSideServiceImpl::SendCommandsThread,\n                                   this,\n                                   context,\n                                   stream,\n                                   &all_events_sent_received,\n                                   &receive_events_thread_exited};\n\n  \/\/ This thread is responsible for reading from stream, and specifically for\n  \/\/ receiving CaptureEvents and AllEventsSent messages.\n  std::thread receive_events_thread{&ProducerSideServiceImpl::ReceiveEventsThread, this, context,\n                                    stream, &all_events_sent_received};\n  receive_events_thread.join();\n\n  \/\/ When receive_events_thread exits because stream->Read(&request) fails,\n  \/\/ it means that the producer has disconnected: ask send_commands_thread to exit, too.\n  receive_events_thread_exited = true;\n  send_commands_thread.join();\n\n  {\n    absl::MutexLock lock{&server_contexts_mutex_};\n    server_contexts_.erase(context);\n  }\n\n  LOG(\"Finished handling ReceiveCommandsAndSendEvents for a CaptureEventProducer\");\n  return grpc::Status::OK;\n}\n\nstatic bool SendStartCaptureCommand(\n    grpc::ServerContext* context,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream) {\n  orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse command;\n  command.mutable_start_capture_command();\n  if (!stream->Write(command)) {\n    ERROR(\"Sending StartCaptureCommand to CaptureEventProducer\");\n    LOG(\"Terminating call to ReceiveCommandsAndSendEvents as Write failed\");\n    \/\/ Cause Read in ReceiveEventsThread to also fail if for some reason it hasn't already.\n    context->TryCancel();\n    return false;\n  }\n  LOG(\"Sent StartCaptureCommand to CaptureEventProducer\");\n  return true;\n}\n\nstatic bool SendStopCaptureCommand(\n    grpc::ServerContext* context,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream) {\n  orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse command;\n  command.mutable_stop_capture_command();\n  if (!stream->Write(command)) {\n    ERROR(\"Sending StopCaptureCommand to CaptureEventProducer\");\n    LOG(\"Terminating call to ReceiveCommandsAndSendEvents as Write failed\");\n    \/\/ Cause Read in ReceiveEventsThread to also fail if for some reason it hasn't already.\n    context->TryCancel();\n    return false;\n  }\n  LOG(\"Sent StopCaptureCommand to CaptureEventProducer\");\n  return true;\n}\n\nstatic bool SendCaptureFinishedCommand(\n    grpc::ServerContext* context,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream) {\n  orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse command;\n  command.mutable_capture_finished_command();\n  if (!stream->Write(command)) {\n    ERROR(\"Sending CaptureFinishedCommand to CaptureEventProducer\");\n    LOG(\"Terminating call to ReceiveCommandsAndSendEvents as Write failed\");\n    \/\/ Cause Read in ReceiveEventsThread to also fail if for some reason it hasn't already.\n    context->TryCancel();\n    return false;\n  }\n  LOG(\"Sent CaptureFinishedCommand to CaptureEventProducer\");\n  return true;\n}\n\nvoid ProducerSideServiceImpl::SendCommandsThread(\n    grpc::ServerContext* context,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream,\n    bool* all_events_sent_received, std::atomic<bool>* receive_events_thread_exited) {\n  \/\/ As a result of initializing prev_capture_status to kCaptureFinished,\n  \/\/ an initial StartCaptureCommand is sent\n  \/\/ if service_state_.capture_status is actually CaptureStatus::kCaptureStarted,\n  \/\/ and an initial StopCaptureCommand is sent (with little effect)\n  \/\/ if service_state_.capture_status is actually CaptureStatus::kCaptureStopping.\n  CaptureStatus prev_capture_status = CaptureStatus::kCaptureFinished;\n\n  \/\/ This loop keeps track of changes to service_state_.capture_status using\n  \/\/ conditional critical sections on service_state_mutex_ and updating prev_capture_status,\n  \/\/ and sends StartCaptureCommands and StopCaptureCommands accordingly.\n  \/\/ It exits when one of *receive_events_thread_exited and service_state_.exit_requested is true,\n  \/\/ or when Write fails (because the producer disconnected or because the context was cancelled).\n  while (true) {\n    \/\/ This is set when ReceiveEventsThread has exited. At that point this thread should also exit.\n    if (*receive_events_thread_exited) {\n      return;\n    }\n\n    CaptureStatus curr_capture_status;\n    {\n      absl::MutexLock lock{&service_state_mutex_};\n      if (service_state_.exit_requested) {\n        return;\n      }\n\n      if (service_state_.capture_status == prev_capture_status) {\n        \/\/ Wait for service_state_.capture_status to change or for service_state->exit_requested\n        \/\/ (the next iteration will handle the change).\n        \/\/ Use a timeout to periodically check (in the next iteration)\n        \/\/ for *terminate_send_commands_thread, set by ReceiveCommandsAndSendEvents.\n        static constexpr absl::Duration kCheckExitSendCommandsThreadInterval = absl::Seconds(1);\n\n        \/\/ The three cases in this switch are almost identical, except\n        \/\/ for the value service_state->capture_status is compared with.\n        \/\/ The reason for the duplication is that AwaitWithTimeout takes a function pointer, which\n        \/\/ means that the lambda cannot capture the initial value of service_state_.capture_status.\n        switch (service_state_.capture_status) {\n          case CaptureStatus::kCaptureStarted: {\n            service_state_mutex_.AwaitWithTimeout(absl::Condition(\n                                                      +[](ServiceState* service_state) {\n                                                        return service_state->exit_requested ||\n                                                               service_state->capture_status !=\n                                                                   CaptureStatus::kCaptureStarted;\n                                                      },\n                                                      &service_state_),\n                                                  kCheckExitSendCommandsThreadInterval);\n          } break;\n\n          case CaptureStatus::kCaptureStopping: {\n            service_state_mutex_.AwaitWithTimeout(absl::Condition(\n                                                      +[](ServiceState* service_state) {\n                                                        return service_state->exit_requested ||\n                                                               service_state->capture_status !=\n                                                                   CaptureStatus::kCaptureStopping;\n                                                      },\n                                                      &service_state_),\n                                                  kCheckExitSendCommandsThreadInterval);\n          } break;\n\n          case CaptureStatus::kCaptureFinished: {\n            service_state_mutex_.AwaitWithTimeout(absl::Condition(\n                                                      +[](ServiceState* service_state) {\n                                                        return service_state->exit_requested ||\n                                                               service_state->capture_status !=\n                                                                   CaptureStatus::kCaptureFinished;\n                                                      },\n                                                      &service_state_),\n                                                  kCheckExitSendCommandsThreadInterval);\n          } break;\n        }\n\n        continue;\n      }\n\n      \/\/ service_state_.capture_status has changed compared to prev_capture_status: handle the\n      \/\/ change while holding service_state_mutex_ (that also protects all_events_sent_received).\n      switch (service_state_.capture_status) {\n        case CaptureStatus::kCaptureStarted: {\n          ++service_state_.producers_remaining;\n          *all_events_sent_received = false;\n        } break;\n\n        case CaptureStatus::kCaptureStopping:\n          break;\n\n        case CaptureStatus::kCaptureFinished: {\n          *all_events_sent_received = true;\n        } break;\n      }\n      curr_capture_status = service_state_.capture_status;\n    }  \/\/ absl::MutexLock lock{&service_state_mutex_}\n\n    \/\/ curr_capture_status now holds the new service_state_.capture_status. Send commands\n    \/\/ to the producer based on its value and also based on the value of prev_capture_status,\n    \/\/ in case this thread missed an intermediate change of service_state_.capture_status.\n    switch (curr_capture_status) {\n      case CaptureStatus::kCaptureStarted: {\n        if (prev_capture_status == CaptureStatus::kCaptureFinished) {\n          if (!SendStartCaptureCommand(context, stream)) {\n            return;\n          }\n        } else if (prev_capture_status == CaptureStatus::kCaptureStopping) {\n          if (!SendCaptureFinishedCommand(context, stream) ||\n              !SendStartCaptureCommand(context, stream)) {\n            return;\n          }\n        } else {\n          UNREACHABLE();\n        }\n      } break;\n\n      case CaptureStatus::kCaptureStopping: {\n        if (prev_capture_status == CaptureStatus::kCaptureStarted) {\n          if (!SendStopCaptureCommand(context, stream)) {\n            return;\n          }\n        } else if (prev_capture_status == CaptureStatus::kCaptureFinished) {\n          if (!SendStartCaptureCommand(context, stream) ||\n              !SendStopCaptureCommand(context, stream)) {\n            return;\n          }\n        } else {\n          UNREACHABLE();\n        }\n      } break;\n\n      case CaptureStatus::kCaptureFinished:\n        if (prev_capture_status == CaptureStatus::kCaptureStopping) {\n          if (!SendCaptureFinishedCommand(context, stream)) {\n            return;\n          }\n        } else if (prev_capture_status == CaptureStatus::kCaptureStarted) {\n          if (!SendStopCaptureCommand(context, stream) ||\n              !SendCaptureFinishedCommand(context, stream)) {\n            return;\n          }\n        } else {\n          UNREACHABLE();\n        }\n        break;\n    }\n\n    prev_capture_status = curr_capture_status;\n  }\n}\n\nvoid ProducerSideServiceImpl::ReceiveEventsThread(\n    grpc::ServerContext* \/*context*\/,\n    grpc::ServerReaderWriter<orbit_grpc_protos::ReceiveCommandsAndSendEventsResponse,\n                             orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest>* stream,\n    bool* all_events_sent_received) {\n  orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest request;\n  while (stream->Read(&request)) {\n    {\n      absl::MutexLock lock{&service_state_mutex_};\n      if (service_state_.exit_requested) {\n        break;\n      }\n    }\n\n    switch (request.event_case()) {\n      case orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest::kBufferedCaptureEvents: {\n        absl::MutexLock lock{&capture_event_buffer_mutex_};\n        \/\/ capture_event_buffer_ can be nullptr if a producer sends events while not capturing.\n        \/\/ Don't log an error in such a case as it could easily spam the logs.\n        if (capture_event_buffer_ != nullptr) {\n          for (orbit_grpc_protos::CaptureEvent event :\n               request.buffered_capture_events().capture_events()) {\n            capture_event_buffer_->AddEvent(std::move(event));\n          }\n        }\n      } break;\n\n      case orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest::kAllEventsSent: {\n        LOG(\"Received AllEventsSent from CaptureEventProducer\");\n        absl::MutexLock lock{&service_state_mutex_};\n        switch (service_state_.capture_status) {\n          case CaptureStatus::kCaptureStarted: {\n            ERROR(\"CaptureEventProducer sent AllEventsSent while still capturing\");\n            \/\/ Even if we weren't waiting for the AllEventsSent message yet,\n            \/\/ still keep track of the fact that we have already received it.\n            if (!*all_events_sent_received) {\n              --service_state_.producers_remaining;\n              *all_events_sent_received = true;\n            }\n          } break;\n\n          case CaptureStatus::kCaptureStopping: {\n            \/\/ If we were waiting for AllEventsSent, keep track of the fact that we received it.\n            if (!*all_events_sent_received) {\n              --service_state_.producers_remaining;\n              *all_events_sent_received = true;\n            }\n          } break;\n\n          case CaptureStatus::kCaptureFinished: {\n            ERROR(\"CaptureEventProducer sent AllEventsSent after the capture had finished\");\n          } break;\n        }\n      } break;\n\n      case orbit_grpc_protos::ReceiveCommandsAndSendEventsRequest::EVENT_NOT_SET: {\n        ERROR(\"CaptureEventProducer sent EVENT_NOT_SET\");\n      } break;\n    }\n  }\n\n  ERROR(\"Receiving ReceiveCommandsAndSendEventsRequest from CaptureEventProducer\");\n  {\n    absl::MutexLock lock{&service_state_mutex_};\n    \/\/ Producer has disconnected: treat this as if it had sent all its CaptureEvents.\n    if (!*all_events_sent_received &&\n        (service_state_.capture_status == CaptureStatus::kCaptureStarted ||\n         service_state_.capture_status == CaptureStatus::kCaptureStopping)) {\n      --service_state_.producers_remaining;\n      *all_events_sent_received = true;\n    }\n  }\n}\n\n}  \/\/ namespace orbit_service\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"Ext.h\"\n\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/TypeBuilder.h>\n#include <llvm\/IR\/IntrinsicInst.h>\n\n\/\/#include <libdevcrypto\/SHA3.h>\n\/\/#include <libevm\/FeeStructure.h>\n\n#include \"RuntimeManager.h\"\n#include \"Memory.h\"\n#include \"Type.h\"\n#include \"Endianness.h\"\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nExt::Ext(RuntimeManager& _runtimeManager, Memory& _memoryMan):\n\tRuntimeHelper(_runtimeManager),\n\tm_memoryMan(_memoryMan)\n#ifdef __MSCVER\n\t,\n\tm_funcs({}),  \/\/ The only std::array initialization that works in both Visual Studio & GCC\n\tm_argAllocas({})\n#endif\n{\n\tm_size = m_builder.CreateAlloca(Type::Size, nullptr, \"env.size\");\n}\n\n\nusing FuncDesc = std::tuple<char const*, llvm::FunctionType*>;\n\nllvm::FunctionType* getFunctionType(llvm::Type* _returnType, std::initializer_list<llvm::Type*> const& _argsTypes)\n{\n\treturn llvm::FunctionType::get(_returnType, llvm::ArrayRef<llvm::Type*>{_argsTypes.begin(), _argsTypes.size()}, false);\n}\n\nstd::array<FuncDesc, sizeOf<EnvFunc>::value> const& getEnvFuncDescs()\n{\n\tstatic std::array<FuncDesc, sizeOf<EnvFunc>::value> descs{{\n\t\tFuncDesc{\"env_sload\",   getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_sstore\",  getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_sha3\", getFunctionType(Type::Void, {Type::BytePtr, Type::Size, Type::WordPtr})},\n\t\tFuncDesc{\"env_balance\", getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_create\", getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr, Type::BytePtr, Type::Size, Type::WordPtr})},\n\t\tFuncDesc{\"env_call\", getFunctionType(Type::Bool, {Type::EnvPtr, Type::WordPtr, Type::WordPtr, Type::WordPtr, Type::BytePtr, Type::Size, Type::BytePtr, Type::Size, Type::WordPtr})},\n\t\tFuncDesc{\"env_log\", getFunctionType(Type::Void, {Type::EnvPtr, Type::BytePtr, Type::Size, Type::WordPtr, Type::WordPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_blockhash\", getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_extcode\", getFunctionType(Type::BytePtr, {Type::EnvPtr, Type::WordPtr, Type::Size->getPointerTo()})},\n\t\tFuncDesc{\"ext_calldataload\", getFunctionType(Type::Void, {Type::RuntimeDataPtr, Type::WordPtr, Type::WordPtr})},\n\t}};\n\n\treturn descs;\n}\n\nllvm::Function* createFunc(EnvFunc _id, llvm::Module* _module)\n{\n\tauto&& desc = getEnvFuncDescs()[static_cast<size_t>(_id)];\n\treturn llvm::Function::Create(std::get<1>(desc), llvm::Function::ExternalLinkage, std::get<0>(desc), _module);\n}\n\nllvm::Value* Ext::getArgAlloca()\n{\n\tauto& a = m_argAllocas[m_argCounter++];\n\tif (!a)\n\t{\n\t\t\/\/ FIXME: Improve order and names\n\t\tInsertPointGuard g{getBuilder()};\n\t\tgetBuilder().SetInsertPoint(getMainFunction()->front().getFirstNonPHI());\n\t\ta = getBuilder().CreateAlloca(Type::Word, nullptr, \"arg\");\n\t}\n\t\t\n\treturn a;\n}\n\nllvm::Value* Ext::byPtr(llvm::Value* _value)\n{\n\tauto a = getArgAlloca();\n\tgetBuilder().CreateStore(_value, a);\n\treturn a;\n}\n\nllvm::CallInst* Ext::createCall(EnvFunc _funcId, std::initializer_list<llvm::Value*> const& _args)\n{\n\tauto& func = m_funcs[static_cast<size_t>(_funcId)];\n\tif (!func)\n\t\tfunc = createFunc(_funcId, getModule());\n\n\tm_argCounter = 0;\n\treturn getBuilder().CreateCall(func, {_args.begin(), _args.size()});\n}\n\nllvm::Value* Ext::sload(llvm::Value* _index)\n{\n\tauto ret = getArgAlloca();\n\tcreateCall(EnvFunc::sload, {getRuntimeManager().getEnvPtr(), byPtr(_index), ret}); \/\/ Uses native endianness\n\treturn m_builder.CreateLoad(ret);\n}\n\nvoid Ext::sstore(llvm::Value* _index, llvm::Value* _value)\n{\n\tcreateCall(EnvFunc::sstore, {getRuntimeManager().getEnvPtr(), byPtr(_index), byPtr(_value)}); \/\/ Uses native endianness\n}\n\nllvm::Value* Ext::calldataload(llvm::Value* _index)\n{\n\tauto ret = getArgAlloca();\n\tcreateCall(EnvFunc::calldataload, {getRuntimeManager().getDataPtr(), byPtr(_index), ret});\n\tret = m_builder.CreateLoad(ret);\n\treturn Endianness::toNative(m_builder, ret);\n}\n\nllvm::Value* Ext::balance(llvm::Value* _address)\n{\n\tauto address = Endianness::toBE(m_builder, _address);\n\tauto ret = getArgAlloca();\n\tcreateCall(EnvFunc::balance, {getRuntimeManager().getEnvPtr(), byPtr(address), ret});\n\treturn m_builder.CreateLoad(ret);\n}\n\nllvm::Value* Ext::blockhash(llvm::Value* _number)\n{\n\tauto hash = getArgAlloca();\n\tcreateCall(EnvFunc::blockhash, {getRuntimeManager().getEnvPtr(), byPtr(_number), hash});\n\thash =  m_builder.CreateLoad(hash);\n\treturn Endianness::toNative(getBuilder(), hash);\n}\n\nllvm::Value* Ext::create(llvm::Value*& _gas, llvm::Value* _endowment, llvm::Value* _initOff, llvm::Value* _initSize)\n{\n\tauto gas = byPtr(_gas);\n\tauto ret = getArgAlloca();\n\tauto begin = m_memoryMan.getBytePtr(_initOff);\n\tauto size = m_builder.CreateTrunc(_initSize, Type::Size, \"size\");\n\tcreateCall(EnvFunc::create, {getRuntimeManager().getEnvPtr(), gas, byPtr(_endowment), begin, size, ret});\n\t_gas = m_builder.CreateLoad(gas); \/\/ Return gas\n\tllvm::Value* address = m_builder.CreateLoad(ret);\n\taddress = Endianness::toNative(m_builder, address);\n\treturn address;\n}\n\nllvm::Value* Ext::call(llvm::Value*& _gas, llvm::Value* _receiveAddress, llvm::Value* _value, llvm::Value* _inOff, llvm::Value* _inSize, llvm::Value* _outOff, llvm::Value* _outSize, llvm::Value* _codeAddress)\n{\n\tauto gas = byPtr(_gas);\n\tauto receiveAddress = Endianness::toBE(m_builder, _receiveAddress);\n\tauto inBeg = m_memoryMan.getBytePtr(_inOff);\n\tauto inSize = m_builder.CreateTrunc(_inSize, Type::Size, \"in.size\");\n\tauto outBeg = m_memoryMan.getBytePtr(_outOff);\n\tauto outSize = m_builder.CreateTrunc(_outSize, Type::Size, \"out.size\");\n\tauto codeAddress = Endianness::toBE(m_builder, _codeAddress);\n\tauto ret = createCall(EnvFunc::call, {getRuntimeManager().getEnvPtr(), gas, byPtr(receiveAddress), byPtr(_value), inBeg, inSize, outBeg, outSize, byPtr(codeAddress)});\n\t_gas = m_builder.CreateLoad(gas); \/\/ Return gas\n\treturn m_builder.CreateZExt(ret, Type::Word, \"ret\");\n}\n\nllvm::Value* Ext::sha3(llvm::Value* _inOff, llvm::Value* _inSize)\n{\n\tauto begin = m_memoryMan.getBytePtr(_inOff);\n\tauto size = m_builder.CreateTrunc(_inSize, Type::Size, \"size\");\n\tauto ret = getArgAlloca();\n\tcreateCall(EnvFunc::sha3, {begin, size, ret});\n\tllvm::Value* hash = m_builder.CreateLoad(ret);\n\thash = Endianness::toNative(m_builder, hash);\n\treturn hash;\n}\n\nMemoryRef Ext::extcode(llvm::Value* _addr)\n{\n\tauto addr = Endianness::toBE(m_builder, _addr);\n\tauto code = createCall(EnvFunc::extcode, {getRuntimeManager().getEnvPtr(), byPtr(addr), m_size});\n\tauto codeSize = m_builder.CreateLoad(m_size);\n\tauto codeSize256 = m_builder.CreateZExt(codeSize, Type::Word);\n\treturn {code, codeSize256};\n}\n\nvoid Ext::log(llvm::Value* _memIdx, llvm::Value* _numBytes, std::array<llvm::Value*,4> const& _topics)\n{\n\tauto begin = m_memoryMan.getBytePtr(_memIdx);\n\tauto size = m_builder.CreateTrunc(_numBytes, Type::Size, \"size\");\n\tllvm::Value* args[] = {getRuntimeManager().getEnvPtr(), begin, size, getArgAlloca(), getArgAlloca(), getArgAlloca(), getArgAlloca()};\n\n\tauto topicArgPtr = &args[3];\n\tfor (auto&& topic : _topics)\n\t{\n\t\tif (topic)\n\t\t\tm_builder.CreateStore(Endianness::toBE(m_builder, topic), *topicArgPtr);\n\t\telse\n\t\t\t*topicArgPtr = llvm::ConstantPointerNull::get(Type::WordPtr);\n\t\t++topicArgPtr;\n\t}\n\n\tcreateCall(EnvFunc::log, {args[0], args[1], args[2], args[3], args[4], args[5], args[6]});  \/\/ TODO: use std::initializer_list<>\n}\n\n}\n}\n}\n<commit_msg>Correct std::array intialization (again!)<commit_after>\n#include \"Ext.h\"\n\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/TypeBuilder.h>\n#include <llvm\/IR\/IntrinsicInst.h>\n\n\/\/#include <libdevcrypto\/SHA3.h>\n\/\/#include <libevm\/FeeStructure.h>\n\n#include \"RuntimeManager.h\"\n#include \"Memory.h\"\n#include \"Type.h\"\n#include \"Endianness.h\"\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nExt::Ext(RuntimeManager& _runtimeManager, Memory& _memoryMan):\n\tRuntimeHelper(_runtimeManager),\n\tm_memoryMan(_memoryMan)\n{\n\tm_funcs = decltype(m_funcs)();\n\tm_argAllocas = decltype(m_argAllocas)();\n\tm_size = m_builder.CreateAlloca(Type::Size, nullptr, \"env.size\");\n}\n\n\nusing FuncDesc = std::tuple<char const*, llvm::FunctionType*>;\n\nllvm::FunctionType* getFunctionType(llvm::Type* _returnType, std::initializer_list<llvm::Type*> const& _argsTypes)\n{\n\treturn llvm::FunctionType::get(_returnType, llvm::ArrayRef<llvm::Type*>{_argsTypes.begin(), _argsTypes.size()}, false);\n}\n\nstd::array<FuncDesc, sizeOf<EnvFunc>::value> const& getEnvFuncDescs()\n{\n\tstatic std::array<FuncDesc, sizeOf<EnvFunc>::value> descs{{\n\t\tFuncDesc{\"env_sload\",   getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_sstore\",  getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_sha3\", getFunctionType(Type::Void, {Type::BytePtr, Type::Size, Type::WordPtr})},\n\t\tFuncDesc{\"env_balance\", getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_create\", getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr, Type::BytePtr, Type::Size, Type::WordPtr})},\n\t\tFuncDesc{\"env_call\", getFunctionType(Type::Bool, {Type::EnvPtr, Type::WordPtr, Type::WordPtr, Type::WordPtr, Type::BytePtr, Type::Size, Type::BytePtr, Type::Size, Type::WordPtr})},\n\t\tFuncDesc{\"env_log\", getFunctionType(Type::Void, {Type::EnvPtr, Type::BytePtr, Type::Size, Type::WordPtr, Type::WordPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_blockhash\", getFunctionType(Type::Void, {Type::EnvPtr, Type::WordPtr, Type::WordPtr})},\n\t\tFuncDesc{\"env_extcode\", getFunctionType(Type::BytePtr, {Type::EnvPtr, Type::WordPtr, Type::Size->getPointerTo()})},\n\t\tFuncDesc{\"ext_calldataload\", getFunctionType(Type::Void, {Type::RuntimeDataPtr, Type::WordPtr, Type::WordPtr})},\n\t}};\n\n\treturn descs;\n}\n\nllvm::Function* createFunc(EnvFunc _id, llvm::Module* _module)\n{\n\tauto&& desc = getEnvFuncDescs()[static_cast<size_t>(_id)];\n\treturn llvm::Function::Create(std::get<1>(desc), llvm::Function::ExternalLinkage, std::get<0>(desc), _module);\n}\n\nllvm::Value* Ext::getArgAlloca()\n{\n\tauto& a = m_argAllocas[m_argCounter++];\n\tif (!a)\n\t{\n\t\t\/\/ FIXME: Improve order and names\n\t\tInsertPointGuard g{getBuilder()};\n\t\tgetBuilder().SetInsertPoint(getMainFunction()->front().getFirstNonPHI());\n\t\ta = getBuilder().CreateAlloca(Type::Word, nullptr, \"arg\");\n\t}\n\t\t\n\treturn a;\n}\n\nllvm::Value* Ext::byPtr(llvm::Value* _value)\n{\n\tauto a = getArgAlloca();\n\tgetBuilder().CreateStore(_value, a);\n\treturn a;\n}\n\nllvm::CallInst* Ext::createCall(EnvFunc _funcId, std::initializer_list<llvm::Value*> const& _args)\n{\n\tauto& func = m_funcs[static_cast<size_t>(_funcId)];\n\tif (!func)\n\t\tfunc = createFunc(_funcId, getModule());\n\n\tm_argCounter = 0;\n\treturn getBuilder().CreateCall(func, {_args.begin(), _args.size()});\n}\n\nllvm::Value* Ext::sload(llvm::Value* _index)\n{\n\tauto ret = getArgAlloca();\n\tcreateCall(EnvFunc::sload, {getRuntimeManager().getEnvPtr(), byPtr(_index), ret}); \/\/ Uses native endianness\n\treturn m_builder.CreateLoad(ret);\n}\n\nvoid Ext::sstore(llvm::Value* _index, llvm::Value* _value)\n{\n\tcreateCall(EnvFunc::sstore, {getRuntimeManager().getEnvPtr(), byPtr(_index), byPtr(_value)}); \/\/ Uses native endianness\n}\n\nllvm::Value* Ext::calldataload(llvm::Value* _index)\n{\n\tauto ret = getArgAlloca();\n\tcreateCall(EnvFunc::calldataload, {getRuntimeManager().getDataPtr(), byPtr(_index), ret});\n\tret = m_builder.CreateLoad(ret);\n\treturn Endianness::toNative(m_builder, ret);\n}\n\nllvm::Value* Ext::balance(llvm::Value* _address)\n{\n\tauto address = Endianness::toBE(m_builder, _address);\n\tauto ret = getArgAlloca();\n\tcreateCall(EnvFunc::balance, {getRuntimeManager().getEnvPtr(), byPtr(address), ret});\n\treturn m_builder.CreateLoad(ret);\n}\n\nllvm::Value* Ext::blockhash(llvm::Value* _number)\n{\n\tauto hash = getArgAlloca();\n\tcreateCall(EnvFunc::blockhash, {getRuntimeManager().getEnvPtr(), byPtr(_number), hash});\n\thash =  m_builder.CreateLoad(hash);\n\treturn Endianness::toNative(getBuilder(), hash);\n}\n\nllvm::Value* Ext::create(llvm::Value*& _gas, llvm::Value* _endowment, llvm::Value* _initOff, llvm::Value* _initSize)\n{\n\tauto gas = byPtr(_gas);\n\tauto ret = getArgAlloca();\n\tauto begin = m_memoryMan.getBytePtr(_initOff);\n\tauto size = m_builder.CreateTrunc(_initSize, Type::Size, \"size\");\n\tcreateCall(EnvFunc::create, {getRuntimeManager().getEnvPtr(), gas, byPtr(_endowment), begin, size, ret});\n\t_gas = m_builder.CreateLoad(gas); \/\/ Return gas\n\tllvm::Value* address = m_builder.CreateLoad(ret);\n\taddress = Endianness::toNative(m_builder, address);\n\treturn address;\n}\n\nllvm::Value* Ext::call(llvm::Value*& _gas, llvm::Value* _receiveAddress, llvm::Value* _value, llvm::Value* _inOff, llvm::Value* _inSize, llvm::Value* _outOff, llvm::Value* _outSize, llvm::Value* _codeAddress)\n{\n\tauto gas = byPtr(_gas);\n\tauto receiveAddress = Endianness::toBE(m_builder, _receiveAddress);\n\tauto inBeg = m_memoryMan.getBytePtr(_inOff);\n\tauto inSize = m_builder.CreateTrunc(_inSize, Type::Size, \"in.size\");\n\tauto outBeg = m_memoryMan.getBytePtr(_outOff);\n\tauto outSize = m_builder.CreateTrunc(_outSize, Type::Size, \"out.size\");\n\tauto codeAddress = Endianness::toBE(m_builder, _codeAddress);\n\tauto ret = createCall(EnvFunc::call, {getRuntimeManager().getEnvPtr(), gas, byPtr(receiveAddress), byPtr(_value), inBeg, inSize, outBeg, outSize, byPtr(codeAddress)});\n\t_gas = m_builder.CreateLoad(gas); \/\/ Return gas\n\treturn m_builder.CreateZExt(ret, Type::Word, \"ret\");\n}\n\nllvm::Value* Ext::sha3(llvm::Value* _inOff, llvm::Value* _inSize)\n{\n\tauto begin = m_memoryMan.getBytePtr(_inOff);\n\tauto size = m_builder.CreateTrunc(_inSize, Type::Size, \"size\");\n\tauto ret = getArgAlloca();\n\tcreateCall(EnvFunc::sha3, {begin, size, ret});\n\tllvm::Value* hash = m_builder.CreateLoad(ret);\n\thash = Endianness::toNative(m_builder, hash);\n\treturn hash;\n}\n\nMemoryRef Ext::extcode(llvm::Value* _addr)\n{\n\tauto addr = Endianness::toBE(m_builder, _addr);\n\tauto code = createCall(EnvFunc::extcode, {getRuntimeManager().getEnvPtr(), byPtr(addr), m_size});\n\tauto codeSize = m_builder.CreateLoad(m_size);\n\tauto codeSize256 = m_builder.CreateZExt(codeSize, Type::Word);\n\treturn {code, codeSize256};\n}\n\nvoid Ext::log(llvm::Value* _memIdx, llvm::Value* _numBytes, std::array<llvm::Value*,4> const& _topics)\n{\n\tauto begin = m_memoryMan.getBytePtr(_memIdx);\n\tauto size = m_builder.CreateTrunc(_numBytes, Type::Size, \"size\");\n\tllvm::Value* args[] = {getRuntimeManager().getEnvPtr(), begin, size, getArgAlloca(), getArgAlloca(), getArgAlloca(), getArgAlloca()};\n\n\tauto topicArgPtr = &args[3];\n\tfor (auto&& topic : _topics)\n\t{\n\t\tif (topic)\n\t\t\tm_builder.CreateStore(Endianness::toBE(m_builder, topic), *topicArgPtr);\n\t\telse\n\t\t\t*topicArgPtr = llvm::ConstantPointerNull::get(Type::WordPtr);\n\t\t++topicArgPtr;\n\t}\n\n\tcreateCall(EnvFunc::log, {args[0], args[1], args[2], args[3], args[4], args[5], args[6]});  \/\/ TODO: use std::initializer_list<>\n}\n\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n Program:   Visualization Toolkit\n Module:    vtkFieldDataSerializer.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 \"vtkFieldDataSerializer.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkFieldData.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkIdList.h\"\n#include \"vtkStructuredData.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkMultiProcessStream.h\"\n\n#include <cassert> \/\/ For assert()\n#include <cstring> \/\/ For memcpy\n\nvtkStandardNewMacro(vtkFieldDataSerializer);\n\n\/\/------------------------------------------------------------------------------\nvtkFieldDataSerializer::vtkFieldDataSerializer()\n{\n\n}\n\n\/\/------------------------------------------------------------------------------\nvtkFieldDataSerializer::~vtkFieldDataSerializer()\n{\n\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::SerializeMetaData(\n    vtkFieldData *fieldData, vtkMultiProcessStream& bytestream)\n{\n  if( fieldData == NULL )\n    {\n    vtkGenericWarningMacro(\"Field data is NULL!\");\n    return;\n    }\n\n  \/\/ STEP 0: Write the number of arrays\n  bytestream << fieldData->GetNumberOfArrays();\n\n  \/\/ STEP 1: Loop through each array and write the metadata\n  for( int array=0; array < fieldData->GetNumberOfArrays(); ++array )\n    {\n    vtkDataArray *dataArray = fieldData->GetArray( array );\n    assert(\"pre: data array should not be NULL!\" && (dataArray != NULL));\n\n    int dataType  = dataArray->GetDataType();\n    int numComp   = dataArray->GetNumberOfComponents();\n    int numTuples = dataArray->GetNumberOfTuples();\n\n    \/\/ serialize array information\n    bytestream << dataType << numTuples << numComp;\n    bytestream << std::string( dataArray->GetName() );\n    } \/\/ END for all arrays\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::DeserializeMetaData(\n    vtkMultiProcessStream& bytestream,\n    vtkStringArray *names,\n    vtkIntArray *datatypes,\n    vtkIntArray *dimensions)\n{\n  if( bytestream.Empty() )\n    {\n    vtkGenericWarningMacro(\"ByteStream is empty\");\n    return;\n    }\n\n  if( (names == NULL) || (datatypes == NULL) || (dimensions == NULL) )\n    {\n    vtkGenericWarningMacro(\n        \"ERROR: caller must pre-allocation names\/datatypes\/dimensions!\");\n    return;\n    }\n\n  \/\/ STEP 0: Extract the number of arrays\n  int NumberOfArrays;\n  bytestream >> NumberOfArrays;\n  if( NumberOfArrays == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Allocate output data-structures\n  names->SetNumberOfValues(NumberOfArrays);\n  datatypes->SetNumberOfValues(NumberOfArrays);\n  dimensions->SetNumberOfComponents(2);\n  dimensions->SetNumberOfTuples(NumberOfArrays);\n\n  std::string *namesPtr = static_cast<std::string*>(names->GetVoidPointer(0));\n  int *datatypesPtr     = static_cast<int*>(datatypes->GetVoidPointer(0));\n  int *dimensionsPtr    = static_cast<int*>(dimensions->GetVoidPointer(0));\n\n  \/\/ STEP 2: Extract metadata for each array in corresponding output arrays\n  for( int arrayIdx=0; arrayIdx < NumberOfArrays; ++arrayIdx )\n    {\n    bytestream >> datatypesPtr[ arrayIdx ] >> dimensionsPtr[arrayIdx*2] >>\n                  dimensionsPtr[arrayIdx*2+1] >> namesPtr[ arrayIdx ];\n    } \/\/ END for all arrays\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::Serialize(\n    vtkFieldData *fieldData, vtkMultiProcessStream& bytestream)\n{\n  if( fieldData == NULL )\n    {\n    vtkGenericWarningMacro(\"Field data is NULL!\");\n    return;\n    }\n\n  \/\/ STEP 0: Write the number of arrays\n  bytestream << fieldData->GetNumberOfArrays();\n\n  if( fieldData->GetNumberOfArrays() == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Loop through each array and serialize its metadata\n  for( int array=0; array < fieldData->GetNumberOfArrays(); ++array )\n    {\n    vtkDataArray *dataArray = fieldData->GetArray( array );\n    vtkFieldDataSerializer::SerializeDataArray( dataArray, bytestream );\n    } \/\/ END for all arrays\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::SerializeTuples(\n    vtkIdList *tupleIds, vtkFieldData *fieldData,\n    vtkMultiProcessStream& bytestream )\n{\n  if( fieldData == NULL )\n   {\n   vtkGenericWarningMacro(\"Field data is NULL!\");\n   return;\n   }\n\n  \/\/ STEP 0: Write the number of arrays\n  bytestream << fieldData->GetNumberOfArrays();\n\n  if( fieldData->GetNumberOfArrays() == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Loop through each array, extract the data on the selected tuples\n  \/\/ and serialize it\n  for( int array=0; array < fieldData->GetNumberOfArrays(); ++array )\n   {\n   vtkDataArray *dataArray = fieldData->GetArray( array );\n\n   \/\/ STEP 2: For each array extract only the selected tuples, i.e., a subset\n   vtkDataArray *subSet = NULL;\n   subSet = vtkFieldDataSerializer::ExtractSelectedTuples(tupleIds,dataArray);\n   assert(\"pre: subset array is NULL!\" && (subSet != NULL) );\n\n   \/\/ STEP 3: Serialize only a subset of the data\n   vtkFieldDataSerializer::SerializeDataArray( subSet, bytestream );\n   subSet->Delete();\n   } \/\/ END for all arrays\n\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::SerializeSubExtent(\n    int subext[6], int gridExtent[6], vtkFieldData *fieldData,\n    vtkMultiProcessStream& bytestream)\n{\n  if( fieldData == NULL )\n   {\n   vtkGenericWarningMacro(\"Field data is NULL!\");\n   return;\n   }\n\n  \/\/ STEP 0: Write the number of arrays\n  bytestream << fieldData->GetNumberOfArrays();\n\n  if( fieldData->GetNumberOfArrays() == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Loop through each array, extract the data within the subext\n  \/\/ and serialize it\n  for( int array=0; array < fieldData->GetNumberOfArrays(); ++array )\n    {\n    vtkDataArray *dataArray = fieldData->GetArray( array );\n\n    \/\/ STEP 2: Extract the data within the requested sub-extent\n    vtkDataArray *subSet = NULL;\n    subSet = vtkFieldDataSerializer::ExtractSubExtentData(\n        subext,gridExtent,dataArray);\n    assert(\"pre: subset array is NULL!\" && (subSet != NULL) );\n\n    \/\/ STEP 3: Serialize only a subset of the data\n    vtkFieldDataSerializer::SerializeDataArray( subSet, bytestream );\n    subSet->Delete();\n    } \/\/ END for all arrays\n\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDataArray* vtkFieldDataSerializer::ExtractSubExtentData(\n    int subext[6], int gridExtent[6], vtkDataArray *inputDataArray )\n{\n  if( inputDataArray == NULL )\n    {\n    vtkGenericWarningMacro(\"input data array is NULL!\");\n    return NULL;\n    }\n\n  \/\/ STEP 0: Acquire structured data description, i.e, XY_PLANE, XYZ_GRID etc.\n  int description = vtkStructuredData::GetDataDescriptionFromExtent(gridExtent);\n\n  \/\/ STEP 1: Allocate subset array\n  vtkDataArray *subSetArray =\n      vtkDataArray::CreateDataArray( inputDataArray->GetDataType() );\n  subSetArray->SetName( inputDataArray->GetName() );\n  subSetArray->SetNumberOfComponents( inputDataArray->GetNumberOfComponents());\n  subSetArray->SetNumberOfTuples(\n      vtkStructuredData::GetNumberOfNodes(subext,description));\n\n  int ijk[3];\n  for( ijk[0]=subext[0]; ijk[0] <= subext[1]; ++ijk[0] )\n    {\n    for( ijk[1]=subext[2]; ijk[1] <= subext[3]; ++ijk[1] )\n      {\n      for( ijk[2]=subext[4]; ijk[2] <= subext[5]; ++ijk[2] )\n        {\n        \/\/ Compute the source index from the grid extent. Note, this could be\n        \/\/ a cell index if the incoming gridExtent and subext are cell extents.\n        vtkIdType sourceIdx =\n            vtkStructuredData::ComputePointIdForExtent(\n                gridExtent,ijk,description);\n        assert(\"pre: source index is out-of-bounds\" &&\n               (sourceIdx >= 0) &&\n               (sourceIdx < inputDataArray->GetNumberOfTuples()));\n\n        \/\/ Compute the target index in the subset array. Likewise, this could be\n        \/\/ either a cell index or a node index depending on what gridExtent or\n        \/\/ subext represent.\n        vtkIdType targetIdx =\n            vtkStructuredData::ComputePointIdForExtent(\n                subext,ijk,description);\n        assert(\"pre: target index is out-of-bounds\" &&\n               (targetIdx >= 0) &&\n               (targetIdx < subSetArray->GetNumberOfTuples()));\n\n        subSetArray->SetTuple( targetIdx, sourceIdx, inputDataArray );\n        } \/\/ END for all k\n      } \/\/ END for all j\n    } \/\/ END for all i\n\n  return(subSetArray);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDataArray* vtkFieldDataSerializer::ExtractSelectedTuples(\n    vtkIdList *tupleIds, vtkDataArray *inputDataArray )\n{\n  vtkDataArray *subSetArray =\n      vtkDataArray::CreateDataArray( inputDataArray->GetDataType() );\n  subSetArray->SetName( inputDataArray->GetName() );\n  subSetArray->SetNumberOfComponents( inputDataArray->GetNumberOfComponents());\n  subSetArray->SetNumberOfTuples(tupleIds->GetNumberOfIds());\n\n  vtkIdType idx = 0;\n  for( ; idx < tupleIds->GetNumberOfIds(); ++idx )\n    {\n    vtkIdType tupleIdx = tupleIds->GetId(idx);\n    assert(\"pre: tuple ID is out-of bounds\" &&\n           (tupleIdx >= 0) && (tupleIdx < inputDataArray->GetNumberOfTuples()));\n\n    subSetArray->SetTuple( idx, tupleIdx, inputDataArray );\n    } \/\/ END for all tuples to extract\n  return( subSetArray );\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::SerializeDataArray(\n    vtkDataArray *dataArray, vtkMultiProcessStream& bytestream)\n{\n  if( dataArray == NULL )\n    {\n    vtkGenericWarningMacro(\"data array is NULL!\");\n    return;\n    }\n\n  \/\/ STEP 0: Serialize array information\n  int dataType  = dataArray->GetDataType();\n  int numComp   = dataArray->GetNumberOfComponents();\n  int numTuples = dataArray->GetNumberOfTuples();\n\n  \/\/ serialize array information\n  bytestream << dataType << numTuples << numComp;\n  bytestream << std::string( dataArray->GetName() );\n\n  \/\/ STEP 1: Push the raw data into the bytestream\n  \/\/ TODO: Add more cases for more datatypes here (?)\n  unsigned int size = numComp*numTuples;\n  switch( dataArray->GetDataType() )\n    {\n    case VTK_FLOAT:\n       bytestream.Push(static_cast<float*>(dataArray->GetVoidPointer(0)),size);\n       break;\n     case VTK_DOUBLE:\n       bytestream.Push(static_cast<double*>(dataArray->GetVoidPointer(0)),size);\n       break;\n     case VTK_INT:\n       bytestream.Push(static_cast<int*>(dataArray->GetVoidPointer(0)),size);\n       break;\n     default:\n       assert(\"ERROR: cannot serialize data of given type\" && false);\n       cerr << \"Canot serialize data of type=\"\n            << dataArray->GetDataType() << endl;\n\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::Deserialize(\n    vtkMultiProcessStream& bytestream, vtkFieldData *fieldData)\n{\n  if( fieldData == NULL )\n    {\n    vtkGenericWarningMacro(\"FieldData is NULL!\");\n    return;\n    }\n\n  if( bytestream.Empty() )\n    {\n    vtkGenericWarningMacro(\"Bytestream is empty!\");\n    return;\n    }\n\n  \/\/ STEP 0: Get the number of arrays\n  int numberOfArrays = 0;\n  bytestream >> numberOfArrays;\n\n  if( numberOfArrays == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Loop and deserialize each array\n  for( int array=0; array < numberOfArrays; ++array )\n    {\n    vtkDataArray *dataArray = NULL;\n    vtkFieldDataSerializer::DeserializeDataArray( bytestream,dataArray );\n    assert(\"post: deserialized data array should not be NULL!\" &&\n            (dataArray != NULL));\n    fieldData->AddArray( dataArray );\n    dataArray->Delete();\n    } \/\/ END for all arrays\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::DeserializeDataArray(\n    vtkMultiProcessStream& bytestream,\n    vtkDataArray *&dataArray)\n{\n  if( bytestream.Empty() )\n    {\n    vtkGenericWarningMacro(\"Bytestream is empty!\");\n    return;\n    }\n\n  \/\/ STEP 0: Deserialize array information\n  int dataType, numTuples, numComp;\n  std::string name;\n\n  bytestream >> dataType >> numTuples >> numComp >> name;\n\n  \/\/ STEP 1: Construct vtkDataArray object\n  dataArray = vtkDataArray::CreateDataArray( dataType );\n  dataArray->SetNumberOfComponents( numComp );\n  dataArray->SetNumberOfTuples( numTuples );\n  dataArray->SetName( name.c_str() );\n\n  \/\/ STEP 2: Extract raw data to vtkDataArray\n  \/\/ TODO: Add more cases for more datatypes here (?)\n  unsigned int size = 0;\n  switch( dataType )\n    {\n    case VTK_FLOAT:\n      {\n      float *data = NULL;\n      bytestream.Pop(data,size);\n      assert(\"pre: deserialized raw data array is NULL\" && (data != NULL) );\n\n      float *dataArrayPtr = static_cast<float*>(dataArray->GetVoidPointer(0));\n      assert(\"pre: data array pointer is NULL!\" && (dataArrayPtr != NULL) );\n\n      std::memcpy(dataArrayPtr,data,size*sizeof(float));\n      delete [] data;\n      }\n      break;\n    case VTK_DOUBLE:\n      {\n      double *data = NULL;\n      bytestream.Pop(data,size);\n      assert(\"pre: deserialized raw data array is NULL\" && (data != NULL) );\n\n      double *dataArrayPtr = static_cast<double*>(dataArray->GetVoidPointer(0));\n      assert(\"pre: data array pointer is NULL!\" && (dataArrayPtr != NULL) );\n\n      std::memcpy(dataArrayPtr,data,size*sizeof(double));\n      delete [] data;\n      }\n      break;\n    case VTK_INT:\n      {\n      int *data = NULL;\n      bytestream.Pop(data,size);\n      assert(\"pre: deserialized raw data array is NULL\" && (data != NULL) );\n\n      int *dataArrayPtr = static_cast<int*>(dataArray->GetVoidPointer(0));\n      assert(\"pre: data array pointer is NULL!\" && (dataArrayPtr != NULL) );\n\n      std::memcpy(dataArrayPtr,data,size*sizeof(int));\n      delete [] data;\n      }\n      break;\n    default:\n      assert(\"ERROR: cannot serialize data of given type\" && false);\n      cerr << \"Canot serialize data of type=\"\n           << dataArray->GetDataType() << endl;\n    }\n}\n<commit_msg>ENH: Support for VtkIdType & enhancements<commit_after>\/*=========================================================================\n\n Program:   Visualization Toolkit\n Module:    vtkFieldDataSerializer.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 \"vtkFieldDataSerializer.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkFieldData.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkIdList.h\"\n#include \"vtkStructuredData.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkMultiProcessStream.h\"\n\n#include <cassert> \/\/ For assert()\n#include <cstring> \/\/ For memcpy\n\nvtkStandardNewMacro(vtkFieldDataSerializer);\n\n\/\/------------------------------------------------------------------------------\nvtkFieldDataSerializer::vtkFieldDataSerializer()\n{\n\n}\n\n\/\/------------------------------------------------------------------------------\nvtkFieldDataSerializer::~vtkFieldDataSerializer()\n{\n\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::SerializeMetaData(\n    vtkFieldData *fieldData, vtkMultiProcessStream& bytestream)\n{\n  if( fieldData == NULL )\n    {\n    vtkGenericWarningMacro(\"Field data is NULL!\");\n    return;\n    }\n\n  \/\/ STEP 0: Write the number of arrays\n  bytestream << fieldData->GetNumberOfArrays();\n\n  \/\/ STEP 1: Loop through each array and write the metadata\n  for( int array=0; array < fieldData->GetNumberOfArrays(); ++array )\n    {\n    vtkDataArray *dataArray = fieldData->GetArray( array );\n    assert(\"pre: data array should not be NULL!\" && (dataArray != NULL));\n\n    int dataType  = dataArray->GetDataType();\n    int numComp   = dataArray->GetNumberOfComponents();\n    int numTuples = dataArray->GetNumberOfTuples();\n\n    \/\/ serialize array information\n    bytestream << dataType << numTuples << numComp;\n    bytestream << std::string( dataArray->GetName() );\n    } \/\/ END for all arrays\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::DeserializeMetaData(\n    vtkMultiProcessStream& bytestream,\n    vtkStringArray *names,\n    vtkIntArray *datatypes,\n    vtkIntArray *dimensions)\n{\n  if( bytestream.Empty() )\n    {\n    vtkGenericWarningMacro(\"ByteStream is empty\");\n    return;\n    }\n\n  if( (names == NULL) || (datatypes == NULL) || (dimensions == NULL) )\n    {\n    vtkGenericWarningMacro(\n        \"ERROR: caller must pre-allocation names\/datatypes\/dimensions!\");\n    return;\n    }\n\n  \/\/ STEP 0: Extract the number of arrays\n  int NumberOfArrays;\n  bytestream >> NumberOfArrays;\n  if( NumberOfArrays == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Allocate output data-structures\n  names->SetNumberOfValues(NumberOfArrays);\n  datatypes->SetNumberOfValues(NumberOfArrays);\n  dimensions->SetNumberOfComponents(2);\n  dimensions->SetNumberOfTuples(NumberOfArrays);\n\n  std::string *namesPtr = static_cast<std::string*>(names->GetVoidPointer(0));\n  int *datatypesPtr     = static_cast<int*>(datatypes->GetVoidPointer(0));\n  int *dimensionsPtr    = static_cast<int*>(dimensions->GetVoidPointer(0));\n\n  \/\/ STEP 2: Extract metadata for each array in corresponding output arrays\n  for( int arrayIdx=0; arrayIdx < NumberOfArrays; ++arrayIdx )\n    {\n    bytestream >> datatypesPtr[ arrayIdx ] >> dimensionsPtr[arrayIdx*2] >>\n                  dimensionsPtr[arrayIdx*2+1] >> namesPtr[ arrayIdx ];\n    } \/\/ END for all arrays\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::Serialize(\n    vtkFieldData *fieldData, vtkMultiProcessStream& bytestream)\n{\n  if( fieldData == NULL )\n    {\n    vtkGenericWarningMacro(\"Field data is NULL!\");\n    return;\n    }\n\n  \/\/ STEP 0: Write the number of arrays\n  bytestream << fieldData->GetNumberOfArrays();\n\n  if( fieldData->GetNumberOfArrays() == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Loop through each array and serialize its metadata\n  for( int array=0; array < fieldData->GetNumberOfArrays(); ++array )\n    {\n    vtkDataArray *dataArray = fieldData->GetArray( array );\n    vtkFieldDataSerializer::SerializeDataArray( dataArray, bytestream );\n    } \/\/ END for all arrays\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::SerializeTuples(\n    vtkIdList *tupleIds, vtkFieldData *fieldData,\n    vtkMultiProcessStream& bytestream )\n{\n  if( fieldData == NULL )\n   {\n   vtkGenericWarningMacro(\"Field data is NULL!\");\n   return;\n   }\n\n  \/\/ STEP 0: Write the number of arrays\n  bytestream << fieldData->GetNumberOfArrays();\n\n  if( fieldData->GetNumberOfArrays() == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Loop through each array, extract the data on the selected tuples\n  \/\/ and serialize it\n  for( int array=0; array < fieldData->GetNumberOfArrays(); ++array )\n   {\n   vtkDataArray *dataArray = fieldData->GetArray( array );\n\n   \/\/ STEP 2: For each array extract only the selected tuples, i.e., a subset\n   vtkDataArray *subSet = NULL;\n   subSet = vtkFieldDataSerializer::ExtractSelectedTuples(tupleIds,dataArray);\n   assert(\"pre: subset array is NULL!\" && (subSet != NULL) );\n\n   \/\/ STEP 3: Serialize only a subset of the data\n   vtkFieldDataSerializer::SerializeDataArray( subSet, bytestream );\n   subSet->Delete();\n   } \/\/ END for all arrays\n\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::SerializeSubExtent(\n    int subext[6], int gridExtent[6], vtkFieldData *fieldData,\n    vtkMultiProcessStream& bytestream)\n{\n  if( fieldData == NULL )\n   {\n   vtkGenericWarningMacro(\"Field data is NULL!\");\n   return;\n   }\n\n  \/\/ STEP 0: Write the number of arrays\n  bytestream << fieldData->GetNumberOfArrays();\n\n  if( fieldData->GetNumberOfArrays() == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Loop through each array, extract the data within the subext\n  \/\/ and serialize it\n  for( int array=0; array < fieldData->GetNumberOfArrays(); ++array )\n    {\n    vtkDataArray *dataArray = fieldData->GetArray( array );\n\n    \/\/ STEP 2: Extract the data within the requested sub-extent\n    vtkDataArray *subSet = NULL;\n    subSet = vtkFieldDataSerializer::ExtractSubExtentData(\n        subext,gridExtent,dataArray);\n    assert(\"pre: subset array is NULL!\" && (subSet != NULL) );\n\n    \/\/ STEP 3: Serialize only a subset of the data\n    vtkFieldDataSerializer::SerializeDataArray( subSet, bytestream );\n    subSet->Delete();\n    } \/\/ END for all arrays\n\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDataArray* vtkFieldDataSerializer::ExtractSubExtentData(\n    int subext[6], int gridExtent[6], vtkDataArray *inputDataArray )\n{\n  if( inputDataArray == NULL )\n    {\n    vtkGenericWarningMacro(\"input data array is NULL!\");\n    return NULL;\n    }\n\n  \/\/ STEP 0: Acquire structured data description, i.e, XY_PLANE, XYZ_GRID etc.\n  int description = vtkStructuredData::GetDataDescriptionFromExtent(gridExtent);\n\n  \/\/ STEP 1: Allocate subset array\n  vtkDataArray *subSetArray =\n      vtkDataArray::CreateDataArray( inputDataArray->GetDataType() );\n  subSetArray->SetName( inputDataArray->GetName() );\n  subSetArray->SetNumberOfComponents( inputDataArray->GetNumberOfComponents());\n  subSetArray->SetNumberOfTuples(\n      vtkStructuredData::GetNumberOfNodes(subext,description));\n\n  int ijk[3];\n  for( ijk[0]=subext[0]; ijk[0] <= subext[1]; ++ijk[0] )\n    {\n    for( ijk[1]=subext[2]; ijk[1] <= subext[3]; ++ijk[1] )\n      {\n      for( ijk[2]=subext[4]; ijk[2] <= subext[5]; ++ijk[2] )\n        {\n        \/\/ Compute the source index from the grid extent. Note, this could be\n        \/\/ a cell index if the incoming gridExtent and subext are cell extents.\n        vtkIdType sourceIdx =\n            vtkStructuredData::ComputePointIdForExtent(\n                gridExtent,ijk,description);\n        assert(\"pre: source index is out-of-bounds\" &&\n               (sourceIdx >= 0) &&\n               (sourceIdx < inputDataArray->GetNumberOfTuples()));\n\n        \/\/ Compute the target index in the subset array. Likewise, this could be\n        \/\/ either a cell index or a node index depending on what gridExtent or\n        \/\/ subext represent.\n        vtkIdType targetIdx =\n            vtkStructuredData::ComputePointIdForExtent(\n                subext,ijk,description);\n        assert(\"pre: target index is out-of-bounds\" &&\n               (targetIdx >= 0) &&\n               (targetIdx < subSetArray->GetNumberOfTuples()));\n\n        subSetArray->SetTuple( targetIdx, sourceIdx, inputDataArray );\n        } \/\/ END for all k\n      } \/\/ END for all j\n    } \/\/ END for all i\n\n  return(subSetArray);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDataArray* vtkFieldDataSerializer::ExtractSelectedTuples(\n    vtkIdList *tupleIds, vtkDataArray *inputDataArray )\n{\n  vtkDataArray *subSetArray =\n      vtkDataArray::CreateDataArray( inputDataArray->GetDataType() );\n  subSetArray->SetName( inputDataArray->GetName() );\n  subSetArray->SetNumberOfComponents( inputDataArray->GetNumberOfComponents());\n  subSetArray->SetNumberOfTuples(tupleIds->GetNumberOfIds());\n\n  vtkIdType idx = 0;\n  for( ; idx < tupleIds->GetNumberOfIds(); ++idx )\n    {\n    vtkIdType tupleIdx = tupleIds->GetId(idx);\n    assert(\"pre: tuple ID is out-of bounds\" &&\n           (tupleIdx >= 0) && (tupleIdx < inputDataArray->GetNumberOfTuples()));\n\n    subSetArray->SetTuple( idx, tupleIdx, inputDataArray );\n    } \/\/ END for all tuples to extract\n  return( subSetArray );\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::SerializeDataArray(\n    vtkDataArray *dataArray, vtkMultiProcessStream& bytestream)\n{\n  if( dataArray == NULL )\n    {\n    vtkGenericWarningMacro(\"data array is NULL!\");\n    return;\n    }\n\n  \/\/ STEP 0: Serialize array information\n  int dataType  = dataArray->GetDataType();\n  int numComp   = dataArray->GetNumberOfComponents();\n  int numTuples = dataArray->GetNumberOfTuples();\n\n  \/\/ serialize array information\n  bytestream << dataType << numTuples << numComp;\n  bytestream << std::string( dataArray->GetName() );\n\n  \/\/ STEP 1: Push the raw data into the bytestream\n  \/\/ TODO: Add more cases for more datatypes here (?)\n  unsigned int size = numComp*numTuples;\n  switch( dataArray->GetDataType() )\n    {\n    case VTK_FLOAT:\n       bytestream.Push(static_cast<float*>(dataArray->GetVoidPointer(0)),size);\n       break;\n     case VTK_DOUBLE:\n       bytestream.Push(static_cast<double*>(dataArray->GetVoidPointer(0)),size);\n       break;\n     case VTK_INT:\n       bytestream.Push(static_cast<int*>(dataArray->GetVoidPointer(0)),size);\n       break;\n     case VTK_ID_TYPE:\n       bytestream.Push(\n           static_cast<vtkIdType*>(dataArray->GetVoidPointer(0)),size);\n       break;\n     default:\n       assert(\"ERROR: cannot serialize data of given type\" && false);\n       cerr << \"Canot serialize data of type=\"\n            << dataArray->GetDataType() << endl;\n\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::Deserialize(\n    vtkMultiProcessStream& bytestream, vtkFieldData *fieldData)\n{\n  if( fieldData == NULL )\n    {\n    vtkGenericWarningMacro(\"FieldData is NULL!\");\n    return;\n    }\n\n  if( bytestream.Empty() )\n    {\n    vtkGenericWarningMacro(\"Bytestream is empty!\");\n    return;\n    }\n\n  \/\/ STEP 0: Get the number of arrays\n  int numberOfArrays = 0;\n  bytestream >> numberOfArrays;\n\n  if( numberOfArrays == 0 )\n    {\n    return;\n    }\n\n  \/\/ STEP 1: Loop and deserialize each array\n  for( int array=0; array < numberOfArrays; ++array )\n    {\n    vtkDataArray *dataArray = NULL;\n    vtkFieldDataSerializer::DeserializeDataArray( bytestream,dataArray );\n    assert(\"post: deserialized data array should not be NULL!\" &&\n            (dataArray != NULL));\n    fieldData->AddArray( dataArray );\n    dataArray->Delete();\n    } \/\/ END for all arrays\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkFieldDataSerializer::DeserializeDataArray(\n    vtkMultiProcessStream& bytestream,\n    vtkDataArray *&dataArray)\n{\n  if( bytestream.Empty() )\n    {\n    vtkGenericWarningMacro(\"Bytestream is empty!\");\n    return;\n    }\n\n  \/\/ STEP 0: Deserialize array information\n  int dataType, numTuples, numComp;\n  std::string name;\n\n  bytestream >> dataType >> numTuples >> numComp >> name;\n  assert(\"pre: numComp >= 1\" && (numComp >= 1) );\n\n  \/\/ STEP 1: Construct vtkDataArray object\n  dataArray = vtkDataArray::CreateDataArray( dataType );\n  dataArray->SetNumberOfComponents( numComp );\n  dataArray->SetNumberOfTuples( numTuples );\n  dataArray->SetName( name.c_str() );\n\n  \/\/ STEP 2: Extract raw data to vtkDataArray\n  \/\/ TODO: Add more cases for more datatypes here (?)\n  unsigned int size = numTuples*numComp;\n  void* rawPtr = dataArray->GetVoidPointer(0);\n  assert(\"pre: raw pointer is NULL!\" && (rawPtr != NULL) );\n  switch( dataType )\n    {\n    case VTK_FLOAT:\n      {\n      float* data = static_cast<float*>(rawPtr);\n      bytestream.Pop(data,size);\n      }\n      break;\n    case VTK_DOUBLE:\n      {\n      double *data = static_cast<double*>(rawPtr);\n      bytestream.Pop(data,size);\n      }\n      break;\n    case VTK_INT:\n      {\n      int *data = static_cast<int*>(rawPtr);\n      bytestream.Pop(data,size);\n      }\n      break;\n    case VTK_ID_TYPE:\n      {\n      vtkIdType* data = static_cast<vtkIdType*>(rawPtr);\n      bytestream.Pop(data,size);\n      }\n      break;\n    default:\n      assert(\"ERROR: cannot serialize data of given type\" && false);\n      cerr << \"Canot serialize data of type=\"\n           << dataArray->GetDataType() << endl;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <assert.h>\n#include <chrono>\n#include <list>\n#include <algorithm>\n\n#include \"narf\/client\/console.h\"\n\nnarf::Console *narf::console;\n\n\nstruct narf::ClientConsoleImpl {\n\n\tClientConsoleImpl() : editState() {}\n\n\t~ClientConsoleImpl() {\n\t\tif (textBuffer) {\n\t\t\tdelete textBuffer;\n\t\t}\n\t\tif (editBuffer) {\n\t\t\tdelete textBuffer;\n\t\t}\n\t}\n\n\tnarf::font::Font *font;\n\tuint32_t lineHeight;\n\tuint32_t x;\n\tuint32_t y;\n\tuint32_t width;\n\tuint32_t height;\n\tuint32_t paddingLeft;\n\tuint32_t scrollback;\n\tnarf::font::TextBuffer *textBuffer;\n\tnarf::font::TextBuffer *editBuffer;\n\tstd::vector<std::string> text;\n\tnarf::TextEditor editState;\n\tbool editing;\n\tnarf::ClientConsole::CursorShape cursorShape;\n\tnarf::gl::Context* gl;\n};\n\n\nnarf::ClientConsole::ClientConsole() {\n\timpl = new ClientConsoleImpl();\n\timpl->font = nullptr;\n\timpl->textBuffer = nullptr;\n\timpl->editBuffer = nullptr;\n\timpl->paddingLeft = 5; \/\/ TODO: make this configurable\n\timpl->cursorShape = CursorShape::Default;\n\timpl->gl = nullptr;\n\timpl->scrollback = 0;\n\tlast_blink = std::chrono::system_clock::now();\n\tblink_cursor = true;\n\tblink_rate = 600;  \/\/ Milliseconds\n}\n\n\nuint32_t narf::ClientConsole::getHeightInLines() {\n\t\/\/ TODO: fix rendering so this is not so crazy\n\treturn (impl->height - impl->lineHeight * 3 \/ 2) \/ impl->lineHeight;\n}\n\n\nvoid narf::ClientConsole::pageUp() {\n\timpl->scrollback += getHeightInLines();\n\timpl->scrollback = std::min(impl->scrollback, impl->text.size() - getHeightInLines());\n}\n\n\nvoid narf::ClientConsole::pageDown() {\n\timpl->scrollback -= std::min(getHeightInLines(), impl->scrollback);\n}\n\n\nvoid narf::ClientConsole::scrollHome() {\n\timpl->scrollback = impl->text.size() - getHeightInLines();\n}\n\n\nvoid narf::ClientConsole::scrollEnd() {\n\timpl->scrollback = 0;\n}\n\n\nvoid narf::ClientConsole::setGLContext(narf::gl::Context* gl) {\n\timpl->gl = gl;\n}\n\n\nnarf::TextEditor &narf::ClientConsole::getTextEditor() {\n\treturn impl->editState;\n}\n\n\nnarf::font::Font* narf::ClientConsole::getFont() const {\n\treturn impl->font;\n}\n\n\nvoid narf::ClientConsole::setFont(narf::font::Font *font) {\n\timpl->font = font;\n\timpl->lineHeight = (uint32_t)font->height();\n\n\tif (impl->textBuffer) {\n\t\timpl->textBuffer->setFont(font);\n\t} else {\n\t\timpl->textBuffer = new narf::font::TextBuffer(*impl->gl, font);\n\t}\n\n\tif (impl->editBuffer) {\n\t\timpl->editBuffer->setFont(font);\n\t} else {\n\t\timpl->editBuffer = new narf::font::TextBuffer(*impl->gl, font);\n\t}\n\n\t\/\/ re-render current text\n\tupdate();\n}\n\n\nvoid narf::ClientConsole::setLocation(uint32_t x, uint32_t y, uint32_t width, uint32_t height) {\n\tif (impl->x != x ||\n\t\timpl->y != y ||\n\t\timpl->width != width ||\n\t\timpl->height != height) {\n\t\timpl->x = x;\n\t\timpl->y = y;\n\t\timpl->width = width;\n\t\timpl->height = height;\n\t\tupdate();\n\t}\n}\n\n\nvoid narf::ClientConsole::setEditState(bool editing) {\n\tif (editing && !impl->editing) {\n\t\timpl->editState.last_edited = std::chrono::system_clock::now();\n\t}\n\timpl->editing = editing;\n\tupdate();\n}\n\n\nvoid narf::ClientConsole::setCursorShape(CursorShape shape) {\n\timpl->cursorShape = shape;\n}\n\n\nvoid narf::ClientConsole::update() {\n\tauto textX = static_cast<float>(impl->x + impl->paddingLeft);\n\n\tif (impl->textBuffer) {\n\t\timpl->textBuffer->clear();\n\n\t\tuint32_t y = impl->y + impl->lineHeight * 3 \/ 2;\n\t\tauto scrollLines = impl->scrollback;\n\t\tfor (auto iter = impl->text.rbegin(); iter != impl->text.rend(); ++iter) {\n\t\t\tif (scrollLines > 0) {\n\t\t\t\tscrollLines--;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (y + impl->lineHeight >= impl->height) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tauto textY = static_cast<float>(y);\n\t\t\timpl->textBuffer->print(*iter, textX + 1, textY - 1, narf::Color(0.0f, 0.0f, 0.0f, 1.0f));\n\t\t\timpl->textBuffer->print(*iter, textX, textY, narf::Color(1.0f, 1.0f, 1.0f, 1.0f));\n\t\t\ty += impl->lineHeight;\n\t\t}\n\t}\n\n\tif (impl->editBuffer) {\n\t\timpl->editBuffer->clear();\n\n\t\tauto editY = static_cast<float>(impl->y + impl->lineHeight \/ 2);\n\t\timpl->editBuffer->print(impl->editState.getString(), textX + 1, editY - 1, narf::Color(0.0f, 0.0f, 0.0f, 1.0f));\n\t\timpl->editBuffer->print(impl->editState.getString(), textX, editY, narf::Color(1.0f, 1.0f, 1.0f, 1.0f));\n\t}\n}\n\n\nvoid narf::ClientConsole::render() {\n\tif (impl->textBuffer) {\n\n\t\t\/\/ draw console background\n\t\tauto x1 = float(impl->x);\n\t\tauto y1 = float(impl->y);\n\t\tauto x2 = float(impl->x + impl->width);\n\t\tauto y2 = float(impl->y + impl->height);\n\n\t\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\t\tglColor4f(0.5f, 0.5f, 0.5f, 0.7f);\n\t\tglBegin(GL_QUADS);\n\t\tglVertex2f(x1, y1);\n\t\tglVertex2f(x1, y2);\n\t\tglVertex2f(x2, y2);\n\t\tglVertex2f(x2, y1);\n\t\tglEnd();\n\t\tglPopAttrib();\n\n\t\timpl->textBuffer->render();\n\t}\n\tif (impl->editBuffer && impl->editing) {\n\t\timpl->editBuffer->render();\n\n\t\t\/\/ draw cursor\n\t\tauto now = std::chrono::system_clock::now();\n\t\tif (std::chrono::duration_cast<std::chrono::milliseconds>(now - impl->editState.last_edited).count() < 100) {\n\t\t\tblink_cursor = true;\n\t\t\tlast_blink = now;\n\t\t} else if (std::chrono::duration_cast<std::chrono::milliseconds>(now - last_blink).count() > blink_rate) {\n\t\t\tlast_blink = now;\n\t\t\tblink_cursor = !blink_cursor;\n\t\t}\n\t\tif (blink_cursor) {\n\t\t\tauto editY = static_cast<float>(impl->y + impl->lineHeight \/ 2);\n\n\t\t\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\t\t\tglDisable(GL_TEXTURE_2D);\n\t\t\tglColor4f(1.0f, 1.0f, 1.0f, 0.7f);\n\n\t\t\tif (impl->cursorShape == CursorShape::Caret) {\n\t\t\t\tauto x1 = float(impl->x + impl->paddingLeft) + impl->editBuffer->width(impl->editState.getString(), impl->editState.cursor) - 0.5f;\n\t\t\t\tauto y1 = editY - 1.0f;\n\n\t\t\t\tglLineWidth(2);\n\t\t\t\tglBegin(GL_LINE_STRIP);\n\t\t\t\tglVertex2f(x1 - 4, y1 - 2);\n\t\t\t\tglVertex2f(x1, y1);\n\t\t\t\tglVertex2f(x1 + 4, y1 - 2);\n\t\t\t\tglEnd();\n\t\t\t} else if (impl->cursorShape == CursorShape::Line) {\n\t\t\t\tauto x1 = float(impl->x + impl->paddingLeft) + impl->editBuffer->width(impl->editState.getString(), impl->editState.cursor);\n\t\t\t\tauto y1 = editY - 1.0f;\n\t\t\t\tauto x2 = x1 + 2.0f;\n\t\t\t\tauto y2 = y1 + float(impl->lineHeight) - 1.0f;\n\n\t\t\t\tglBegin(GL_QUADS);\n\t\t\t\tglVertex2f(x1, y1);\n\t\t\t\tglVertex2f(x1, y2);\n\t\t\t\tglVertex2f(x2, y2);\n\t\t\t\tglVertex2f(x2, y1);\n\t\t\t\tglEnd();\n\t\t\t}\n\t\t\tglPopAttrib();\n\t\t}\n\t}\n}\n\n\nnarf::ClientConsole::~ClientConsole() {\n\tdelete impl;\n}\n\n\nvoid narf::ClientConsole::println(const std::string &s) {\n\timpl->text.push_back(s);\n\tscrollEnd();\n\tupdate();\n\n\t\/\/ also print to stdout for now\n\tprintf(\"%s\\n\", s.c_str());\n}\n\n\nstd::string narf::ClientConsole::pollInput() {\n\treturn impl->editState.getString();\n}\n<commit_msg>client: fix type conversion warnings and errors<commit_after>#include <assert.h>\n#include <chrono>\n#include <list>\n#include <algorithm>\n\n#include \"narf\/client\/console.h\"\n\nnarf::Console *narf::console;\n\n\nstruct narf::ClientConsoleImpl {\n\n\tClientConsoleImpl() : editState() {}\n\n\t~ClientConsoleImpl() {\n\t\tif (textBuffer) {\n\t\t\tdelete textBuffer;\n\t\t}\n\t\tif (editBuffer) {\n\t\t\tdelete textBuffer;\n\t\t}\n\t}\n\n\tnarf::font::Font *font;\n\tuint32_t lineHeight;\n\tuint32_t x;\n\tuint32_t y;\n\tuint32_t width;\n\tuint32_t height;\n\tuint32_t paddingLeft;\n\tuint32_t scrollback;\n\tnarf::font::TextBuffer *textBuffer;\n\tnarf::font::TextBuffer *editBuffer;\n\tstd::vector<std::string> text;\n\tnarf::TextEditor editState;\n\tbool editing;\n\tnarf::ClientConsole::CursorShape cursorShape;\n\tnarf::gl::Context* gl;\n};\n\n\nnarf::ClientConsole::ClientConsole() {\n\timpl = new ClientConsoleImpl();\n\timpl->font = nullptr;\n\timpl->textBuffer = nullptr;\n\timpl->editBuffer = nullptr;\n\timpl->paddingLeft = 5; \/\/ TODO: make this configurable\n\timpl->cursorShape = CursorShape::Default;\n\timpl->gl = nullptr;\n\timpl->scrollback = 0;\n\tlast_blink = std::chrono::system_clock::now();\n\tblink_cursor = true;\n\tblink_rate = 600;  \/\/ Milliseconds\n}\n\n\nuint32_t narf::ClientConsole::getHeightInLines() {\n\t\/\/ TODO: fix rendering so this is not so crazy\n\treturn (impl->height - impl->lineHeight * 3 \/ 2) \/ impl->lineHeight;\n}\n\n\nvoid narf::ClientConsole::pageUp() {\n\timpl->scrollback += getHeightInLines();\n\timpl->scrollback = std::min(impl->scrollback, (uint32_t)impl->text.size() - getHeightInLines());\n}\n\n\nvoid narf::ClientConsole::pageDown() {\n\timpl->scrollback -= std::min(getHeightInLines(), impl->scrollback);\n}\n\n\nvoid narf::ClientConsole::scrollHome() {\n\timpl->scrollback = (uint32_t)impl->text.size() - getHeightInLines();\n}\n\n\nvoid narf::ClientConsole::scrollEnd() {\n\timpl->scrollback = 0;\n}\n\n\nvoid narf::ClientConsole::setGLContext(narf::gl::Context* gl) {\n\timpl->gl = gl;\n}\n\n\nnarf::TextEditor &narf::ClientConsole::getTextEditor() {\n\treturn impl->editState;\n}\n\n\nnarf::font::Font* narf::ClientConsole::getFont() const {\n\treturn impl->font;\n}\n\n\nvoid narf::ClientConsole::setFont(narf::font::Font *font) {\n\timpl->font = font;\n\timpl->lineHeight = (uint32_t)font->height();\n\n\tif (impl->textBuffer) {\n\t\timpl->textBuffer->setFont(font);\n\t} else {\n\t\timpl->textBuffer = new narf::font::TextBuffer(*impl->gl, font);\n\t}\n\n\tif (impl->editBuffer) {\n\t\timpl->editBuffer->setFont(font);\n\t} else {\n\t\timpl->editBuffer = new narf::font::TextBuffer(*impl->gl, font);\n\t}\n\n\t\/\/ re-render current text\n\tupdate();\n}\n\n\nvoid narf::ClientConsole::setLocation(uint32_t x, uint32_t y, uint32_t width, uint32_t height) {\n\tif (impl->x != x ||\n\t\timpl->y != y ||\n\t\timpl->width != width ||\n\t\timpl->height != height) {\n\t\timpl->x = x;\n\t\timpl->y = y;\n\t\timpl->width = width;\n\t\timpl->height = height;\n\t\tupdate();\n\t}\n}\n\n\nvoid narf::ClientConsole::setEditState(bool editing) {\n\tif (editing && !impl->editing) {\n\t\timpl->editState.last_edited = std::chrono::system_clock::now();\n\t}\n\timpl->editing = editing;\n\tupdate();\n}\n\n\nvoid narf::ClientConsole::setCursorShape(CursorShape shape) {\n\timpl->cursorShape = shape;\n}\n\n\nvoid narf::ClientConsole::update() {\n\tauto textX = static_cast<float>(impl->x + impl->paddingLeft);\n\n\tif (impl->textBuffer) {\n\t\timpl->textBuffer->clear();\n\n\t\tuint32_t y = impl->y + impl->lineHeight * 3 \/ 2;\n\t\tauto scrollLines = impl->scrollback;\n\t\tfor (auto iter = impl->text.rbegin(); iter != impl->text.rend(); ++iter) {\n\t\t\tif (scrollLines > 0) {\n\t\t\t\tscrollLines--;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (y + impl->lineHeight >= impl->height) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tauto textY = static_cast<float>(y);\n\t\t\timpl->textBuffer->print(*iter, textX + 1, textY - 1, narf::Color(0.0f, 0.0f, 0.0f, 1.0f));\n\t\t\timpl->textBuffer->print(*iter, textX, textY, narf::Color(1.0f, 1.0f, 1.0f, 1.0f));\n\t\t\ty += impl->lineHeight;\n\t\t}\n\t}\n\n\tif (impl->editBuffer) {\n\t\timpl->editBuffer->clear();\n\n\t\tauto editY = static_cast<float>(impl->y + impl->lineHeight \/ 2);\n\t\timpl->editBuffer->print(impl->editState.getString(), textX + 1, editY - 1, narf::Color(0.0f, 0.0f, 0.0f, 1.0f));\n\t\timpl->editBuffer->print(impl->editState.getString(), textX, editY, narf::Color(1.0f, 1.0f, 1.0f, 1.0f));\n\t}\n}\n\n\nvoid narf::ClientConsole::render() {\n\tif (impl->textBuffer) {\n\n\t\t\/\/ draw console background\n\t\tauto x1 = float(impl->x);\n\t\tauto y1 = float(impl->y);\n\t\tauto x2 = float(impl->x + impl->width);\n\t\tauto y2 = float(impl->y + impl->height);\n\n\t\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\t\tglColor4f(0.5f, 0.5f, 0.5f, 0.7f);\n\t\tglBegin(GL_QUADS);\n\t\tglVertex2f(x1, y1);\n\t\tglVertex2f(x1, y2);\n\t\tglVertex2f(x2, y2);\n\t\tglVertex2f(x2, y1);\n\t\tglEnd();\n\t\tglPopAttrib();\n\n\t\timpl->textBuffer->render();\n\t}\n\tif (impl->editBuffer && impl->editing) {\n\t\timpl->editBuffer->render();\n\n\t\t\/\/ draw cursor\n\t\tauto now = std::chrono::system_clock::now();\n\t\tif (std::chrono::duration_cast<std::chrono::milliseconds>(now - impl->editState.last_edited).count() < 100) {\n\t\t\tblink_cursor = true;\n\t\t\tlast_blink = now;\n\t\t} else if (std::chrono::duration_cast<std::chrono::milliseconds>(now - last_blink).count() > blink_rate) {\n\t\t\tlast_blink = now;\n\t\t\tblink_cursor = !blink_cursor;\n\t\t}\n\t\tif (blink_cursor) {\n\t\t\tauto editY = static_cast<float>(impl->y + impl->lineHeight \/ 2);\n\n\t\t\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\t\t\tglDisable(GL_TEXTURE_2D);\n\t\t\tglColor4f(1.0f, 1.0f, 1.0f, 0.7f);\n\n\t\t\tif (impl->cursorShape == CursorShape::Caret) {\n\t\t\t\tauto x1 = float(impl->x + impl->paddingLeft) + impl->editBuffer->width(impl->editState.getString(), impl->editState.cursor) - 0.5f;\n\t\t\t\tauto y1 = editY - 1.0f;\n\n\t\t\t\tglLineWidth(2);\n\t\t\t\tglBegin(GL_LINE_STRIP);\n\t\t\t\tglVertex2f(x1 - 4, y1 - 2);\n\t\t\t\tglVertex2f(x1, y1);\n\t\t\t\tglVertex2f(x1 + 4, y1 - 2);\n\t\t\t\tglEnd();\n\t\t\t} else if (impl->cursorShape == CursorShape::Line) {\n\t\t\t\tauto x1 = float(impl->x + impl->paddingLeft) + impl->editBuffer->width(impl->editState.getString(), impl->editState.cursor);\n\t\t\t\tauto y1 = editY - 1.0f;\n\t\t\t\tauto x2 = x1 + 2.0f;\n\t\t\t\tauto y2 = y1 + float(impl->lineHeight) - 1.0f;\n\n\t\t\t\tglBegin(GL_QUADS);\n\t\t\t\tglVertex2f(x1, y1);\n\t\t\t\tglVertex2f(x1, y2);\n\t\t\t\tglVertex2f(x2, y2);\n\t\t\t\tglVertex2f(x2, y1);\n\t\t\t\tglEnd();\n\t\t\t}\n\t\t\tglPopAttrib();\n\t\t}\n\t}\n}\n\n\nnarf::ClientConsole::~ClientConsole() {\n\tdelete impl;\n}\n\n\nvoid narf::ClientConsole::println(const std::string &s) {\n\timpl->text.push_back(s);\n\tscrollEnd();\n\tupdate();\n\n\t\/\/ also print to stdout for now\n\tprintf(\"%s\\n\", s.c_str());\n}\n\n\nstd::string narf::ClientConsole::pollInput() {\n\treturn impl->editState.getString();\n}\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#include <net\/tcp\/write_queue.hpp>\n\nusing namespace net::tcp;\n\nWrite_queue::Write_queue(WriteCallback cb)\n  : current_(0),\n    offset_(0),\n    acked_(0),\n    on_write_(cb)\n{}\n\nvoid Write_queue::advance(size_t bytes)\n{\n  auto& buf = nxt();\n\n  offset_ += bytes;\n\n  debug2(\"<WriteQueue> Advance: bytes=%u off=%u rem=%u\\n\",\n    bytes, offset_, (buf->size() - offset_));\n\n  if(offset_ == buf->size())\n  {\n    current_++;\n    offset_ = 0;\n\n    if(on_write_)\n      on_write_(buf->size());\n\n    debug(\"<WriteQueue> Advance: Done (%u) current++ [%u] sz=%u\\n\",\n      buf->size(), current_, q.size());\n  }\n}\n\nvoid Write_queue::acknowledge(size_t bytes)\n{\n  debug2(\"<WriteQueue> Acknowledge %u bytes, ack=%u\\n\", bytes, acked_);\n  while(bytes and !q.empty())\n  {\n    auto& buf = una();\n    assert(buf->size() >= acked_);\n    \/\/ remaining\n    const auto rem = buf->size() - acked_;\n\n    \/\/ if everything or more is acked\n    if(bytes >= rem)\n    {\n      \/\/ subtract the bytes acked\n      bytes -= rem;\n      \/\/ reset acked\n      acked_ = 0;\n      \/\/ pop and subtract index\n      q.pop_front();\n      current_--;\n\n      debug(\"<WriteQueue> Acknowledge done, current-- [%u] sz=%u\\n\", current_, q.size());\n    }\n    else\n    {\n      \/\/ add to acked\n      acked_ += bytes;\n      bytes = 0;\n    }\n  }\n}\n\nvoid Write_queue::reset()\n{\n  if(offset_ > 0 and on_write_ != nullptr)\n    on_write_(offset_);\n\n  q.clear();\n  current_ = 0;\n  debug(\"<WriteQueue::reset> Reset\\n\");\n}\n\nuint32_t Write_queue::bytes_remaining() const\n{\n  if(current_ >= q.size()) return 0;\n\n  uint32_t n = nxt()->size() - offset_;\n\n  for(auto i = current_ + 1; i < q.size(); ++i)\n    n += q.at(i)->size();\n\n  return n;\n}\n\nuint32_t Write_queue::bytes_unacknowledged() const\n{\n  if(q.empty()) return 0;\n\n  uint32_t n = una()->size() - acked_;\n\n  for(uint32_t i = 1; i < q.size(); ++i)\n    n += q.at(i)->size();\n\n  return n;\n}\n\n__attribute__((weak))\nint Write_queue::deserialize_from(void*) { return 0; }\n__attribute__((weak))\nint  Write_queue::serialize_to(void*) const { return 0; }\n<commit_msg>tcp: Assert on size to avoid overshooting buffer<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#include <net\/tcp\/write_queue.hpp>\n\nusing namespace net::tcp;\n\nWrite_queue::Write_queue(WriteCallback cb)\n  : current_(0),\n    offset_(0),\n    acked_(0),\n    on_write_(cb)\n{}\n\nvoid Write_queue::advance(size_t bytes)\n{\n  auto& buf = nxt();\n\n  offset_ += bytes;\n  assert(offset_ <= buf->size());\n\n  debug2(\"<WriteQueue> Advance: bytes=%u off=%u rem=%u\\n\",\n    bytes, offset_, (buf->size() - offset_));\n\n  if(offset_ == buf->size())\n  {\n    current_++;\n    offset_ = 0;\n\n    if(on_write_)\n      on_write_(buf->size());\n\n    debug(\"<WriteQueue> Advance: Done (%u) current++ [%u] sz=%u\\n\",\n      buf->size(), current_, q.size());\n  }\n}\n\nvoid Write_queue::acknowledge(size_t bytes)\n{\n  debug2(\"<WriteQueue> Acknowledge %u bytes, ack=%u\\n\", bytes, acked_);\n  while(bytes and !q.empty())\n  {\n    auto& buf = una();\n    assert(buf->size() >= acked_);\n    \/\/ remaining\n    const auto rem = buf->size() - acked_;\n\n    \/\/ if everything or more is acked\n    if(bytes >= rem)\n    {\n      \/\/ subtract the bytes acked\n      bytes -= rem;\n      \/\/ reset acked\n      acked_ = 0;\n      \/\/ pop and subtract index\n      q.pop_front();\n      current_--;\n\n      debug(\"<WriteQueue> Acknowledge done, current-- [%u] sz=%u\\n\", current_, q.size());\n    }\n    else\n    {\n      \/\/ add to acked\n      acked_ += bytes;\n      bytes = 0;\n    }\n  }\n}\n\nvoid Write_queue::reset()\n{\n  if(offset_ > 0 and on_write_ != nullptr)\n    on_write_(offset_);\n\n  q.clear();\n  current_ = 0;\n  debug(\"<WriteQueue::reset> Reset\\n\");\n}\n\nuint32_t Write_queue::bytes_remaining() const\n{\n  if(current_ >= q.size()) return 0;\n\n  uint32_t n = nxt()->size() - offset_;\n\n  for(auto i = current_ + 1; i < q.size(); ++i)\n    n += q.at(i)->size();\n\n  return n;\n}\n\nuint32_t Write_queue::bytes_unacknowledged() const\n{\n  if(q.empty()) return 0;\n\n  uint32_t n = una()->size() - acked_;\n\n  for(uint32_t i = 1; i < q.size(); ++i)\n    n += q.at(i)->size();\n\n  return n;\n}\n\n__attribute__((weak))\nint Write_queue::deserialize_from(void*) { return 0; }\n__attribute__((weak))\nint  Write_queue::serialize_to(void*) const { return 0; }\n<|endoftext|>"}
{"text":"<commit_before>#pragma once \n\n\/\/ Use this helper macro to create a plugin creation method in your plugin implementation &\n\/\/ your base process. In the base process, the signature of the method will be used to lookup\n\/\/ the createPlugin() in the plugin shared library.\n#define MAKE_PLUGIN_CREATION_METHOD(ConcretePluginImpl) \\\nextern \"C\" { \\\n    void* createPlugin(void* service) \\\n    { \\\n        return new ConcretePluginImpl(service); \\\n    } \\\n}\\\n<commit_msg>Introducing a deleter into the plugin macro.<commit_after>#pragma once \n\n\/\/ Use this helper macro to create a plugin creation method in your plugin implementation &\n\/\/ your base process. In the base process, the signature of the method will be used to lookup\n\/\/ the createPlugin() in the plugin shared library.\n#define MAKE_PLUGIN_CREATION_METHOD(ConcretePluginImpl) \\\nextern \"C\" { \\\n    void* createPlugin(void* service) \\\n    { \\\n        return new ConcretePluginImpl(service); \\\n    } \\\n\\\n\\\n    void deletePlugin(void* plugin) \\\n    { \\\n        delete plugin; \\\n    } \\\n}\\\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <OpenNI.h>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/point_types.h>\n#include <pcl\/io\/Grabber.h>\n#include <pcl\/point_cloud.h>\n#include <pcl\/io\/openni2_grabber.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/io\/pcd_grabber.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/visualization\/boost.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/visualization\/image_viewer.h>\n#include <vector>\n#include \"onimeshfunctions.h\"\n\nnamespace onimesh\n{\n        \n    boost::mutex mutex_;\n    boost::shared_ptr<pcl::PCDGrabber<pcl::PointXYZRGBA> > grabber;\n    pcl::PointCloud<pcl::PointXYZRGBA>::ConstPtr cloud_;\n    \n    typedef pcl::PointCloud<pcl::PointXYZRGBA> Cloud;\n    typedef Cloud::ConstPtr CloudConstPtr;\n    \n    int i = 0;\n    char buf[4096];\n    \n\tconst int FRAME_DATA_MOD = 100;\n\n\t\/\/\/ <summary>\n\t\/\/\/ Creates a name for an output file\n\t\/\/\/ <\/summary>\n\tstd::string getOutputFileName(const char* outputDirectory, const char* inputFile, const char* fileExtension)\n\t{\n\t\t\/\/ If the path contains '\/' characters\n\t\tif (std::string(inputFile).find_last_of('\/') != std::string::npos)\n\t\t{\n\t\t\t\/\/ Check if the directory needs a trailing '\/'\n\t\t\tif (std::string(outputDirectory).back() == '\/' || std::string(outputDirectory).back() == '\\\\')\n\t\t\t\treturn std::string(std::string(outputDirectory) + std::string(inputFile).substr(std::string(inputFile).find_last_of('\/') + 1) + std::string(fileExtension));\n\n\t\t\treturn std::string(std::string(outputDirectory) + std::string(\"\/\") + std::string(inputFile).substr(std::string(inputFile).find_last_of('\/') + 1) + std::string(fileExtension));\n\t\t}\n\t\t\/\/ If the path contains '\\' characters\n\t\telse if (std::string(inputFile).find_last_of('\\\\') == std::string::npos)\n\t\t{\n\t\t\t\/\/ Check if the directory needs a trailing '\\'\n\t\t\tif (std::string(outputDirectory).back() == '\/' || std::string(outputDirectory).back() == '\\\\')\n\t\t\t\treturn std::string(std::string(outputDirectory) + std::string(inputFile).substr(std::string(inputFile).find_last_of('\\\\') + 1) + std::string(fileExtension));\n\n\t\t\treturn std::string(std::string(outputDirectory) + std::string(\"\\\\\") + std::string(inputFile).substr(std::string(inputFile).find_last_of('\\\\') + 1) + std::string(fileExtension));\n\t\t}\n\n\t\t\/\/ Otherwise the input file does not contain a path\n\t\t\/\/ Check if the directory needs a trailing '\/'\n\t\tif (std::string(outputDirectory).back() == '\/' || std::string(outputDirectory).back() == '\\\\')\n\t\t\treturn std::string(std::string(outputDirectory) + std::string(inputFile) + std::string(fileExtension));\n\n\t\treturn std::string(std::string(outputDirectory) + std::string(\"\/\") + std::string(inputFile) + std::string(fileExtension));\n\t}\n\n\t\/\/\/ <summary>\n\t\/\/\/ Reads oni input and exports data as excel docs\n\t\/\/\/ <\/summary>\n\tvoid outputExcel(const int argc, const char** argv)\n\t{\n\t\tstd::cout << \"Start excel data output...\\n\";\n\t\t\n        const char* outputDirectory = argv[1];\n        char* inputFile;\n\t\tconst int numberInputFiles = argc - 2;\n\t\topenni::Device device;\n\t\topenni::VideoStream ir;\n\t\topenni::VideoFrameRef irf;\n\t\tOniDepthPixel* pDepth;\n\t\tint frameHeight, frameWidth;\n\t\tlong frameIndex, numberOfFrames;\n\t\tstd::ofstream out;\n        \n        \/\/ Initialize openni\n        openni::Status rc = openni::OpenNI::initialize();\n        if (rc != openni::STATUS_OK)\n        {\n            printf(\"Initialize failed\\n%s\\n\", openni::OpenNI::getExtendedError());\n            exit(2);\n        }\n\n\t\t\/\/ Output excel doc for each input file\n\t\tfor (int w = 0; w < numberInputFiles; ++w)\n\t\t{\n\t\t\tinputFile = (char*)argv[w + 2];\n\t\t\tstd::cout << \"Working on file \" << inputFile << \"...\\n\";\n\t\t\t\n\t\t\t\/\/ Open the .oni file\n\t\t\trc = device.open(inputFile);\n            if (rc != openni::STATUS_OK)\n            {\n                printf(\"Couldn't open device\\n%s\\n\", openni::OpenNI::getExtendedError());\n                exit(3);\n            }\n            \n            \/\/ Create the Video Stream\n\t\t\trc = ir.create(device, openni::SENSOR_DEPTH);\n            if (rc != openni::STATUS_OK)\n            {\n                printf(\"Couldn't create depth stream\\n%s\\n\", openni::OpenNI::getExtendedError());\n                exit(4);\n            }\n            \n\t\t\t\/\/ Device Check\n\t\t\tif (!device.isValid())\n\t\t\t{\n\t\t\t\tstd::cerr << \"\\nThe device is not valid.\\n\";\n\t\t\t\texit(5);\n\t\t\t}\n            \n\t\t\t\/\/ Verify the device is a file\n\t\t\tif (!device.isFile())\n\t\t\t{\n\t\t\t\tstd::cerr << \"\\nThe device is not a file.\\n\";\n\t\t\t\texit(6);\n\t\t\t}\n\t\t\tstd::cout << \"File open success...\\n\";\n\n\t\t\t\/\/ Set playback controls\n\t\t\topenni::PlaybackControl* pbc = device.getPlaybackControl();\n\t\t\tpbc->setSpeed(-1);\n\t\t\tpbc->setRepeatEnabled(false);\n\n\t\t\t\/\/ Open output file\n\t\t\tstd::string outputFile = getOutputFileName(outputDirectory, inputFile, \".csv\");\n\t\t\tout.open(outputFile);\n\n\t\t\t\/\/ Read all frames\n\t\t\tnumberOfFrames = pbc->getNumberOfFrames(ir);\n\t\t\tstd::cout << \"Start reading frame data...\\n\";\n\t\t\trc = ir.start();\n            if (rc != openni::STATUS_OK)\n            {\n                printf(\"Couldn't start the depth stream\\n%s\\n\", openni::OpenNI::getExtendedError());\n                exit(7);\n            }\n            \n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\t\/\/ Read a frame\n\t\t\t\trc = ir.readFrame(&irf);\n                if (rc != openni::STATUS_OK)\n                {\n                    printf(\"Read failed!\\n%s\\n\", openni::OpenNI::getExtendedError());\n                    continue;\n                }\n\n\t\t\t\t\/\/ Verify frame data is valid\n\t\t\t\tif (!irf.isValid())\n\t\t\t\t{\n\t\t\t\t\tstd::cerr << \"Error reading video stream frame\\n\";\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t\/\/ Gather frame data\n\t\t\t\tpDepth = (OniDepthPixel*)irf.getData();\n\t\t\t\tframeIndex = irf.getFrameIndex();\n\n\t\t\t\t\/\/ Skip unneeded frames\n\t\t\t\tif (frameIndex % FRAME_DATA_MOD == 0)\n\t\t\t\t{\n\t\t\t\t\tframeHeight = irf.getHeight();\n\t\t\t\t\tframeWidth = irf.getWidth();\n\t\t\t\t\tstd::cout << \"Processing \" << frameWidth << \"x\" << frameHeight << \" frame number \" << frameIndex << \"...\\n\";\n\t\t\t\t\tout << \"FrameNumber=\" << frameIndex << \",FrameWidth=\" << frameWidth << \",FrameHeight=\" << frameHeight << \",\\n\";\n\t\t\t\t\tfor (int y = 0; y < frameHeight; ++y)  \/\/ All heights\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int x = 0; x < frameWidth; ++x, ++pDepth)  \/\/ All witdths\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tout << *pDepth << \",\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\tout << \"\\n\";\n\t\t\t\t\t}\n\t\t\t\t\tout << \",\\n\";\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/std::cout << \"Skipping frame \" << frameIndex << \"\\n\";\n\t\t\t\t}\n\n\t\t\t\t\/\/ Break if reading the last frame\n\t\t\t\tif (numberOfFrames == frameIndex)\n\t\t\t\t{\n\t\t\t\t\tstd::cout << \"Last frame has been read...\\n\";\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Cleanup\n\t\t\tout.clear();\n\t\t\tout.close();\n\t\t\tir.stop();\n\t\t\tir.destroy();\n\t\t\tdevice.close();\n\t\t}\n\n\t\t\/\/ OpenNI cleanup\n\t\topenni::OpenNI::shutdown();\n\t\tstd::cout << \"Excel data output complete.\\n\";\n\t}\n\n\t\/\/\/ <summary>\n\t\/\/\/ Reads oni input and exports data as point clouds\n\t\/\/\/ <\/summary>\n    \/*\n     * Software License Agreement (BSD License)\n     *\n     *  Point Cloud Library (PCL) - www.pointclouds.org\n     *  Copyright (c) 2011, Willow Garage, Inc.\n     *  Copyright (c) 2012-, Open Perception, 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 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     *\n     *\/\n       \n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/cloud_cb \n\t\/\/Purpose: Takes a cloud object and writes it to a PCD file.\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void cloud_cb (const CloudConstPtr& cloud)\n    {\n        pcl::PCDWriter w;\n        sprintf_s (buf, \"frame_%06d.pcd\", i);\n        w.writeBinaryCompressed (buf, *cloud);\n        PCL_INFO (\"Wrote a cloud with %lu (%ux%u) points in %s.\\n\",\n                  cloud->size (), cloud->width, cloud->height, buf);\n        ++i;\n    }\n    \n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ outputPointCloud\n\t\/\/ Purpose: Makes a OpenNI2Grabber to read from the ONI file. As the file is read in cloud_cb\n\t\/\/          is called to write the data to a PCD file. After the file has been read the \n\t\/\/\t\t\tgrabber is deleted.\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/          \n\tvoid outputPointCloud(const int argc, const char** argv)\n\t{\n\t\t\/\/Writes a message to the console.\n        pcl::console::print_info (\"Convert an ONI file to PCD format.\\n\");\n        \n        \/\/Initializes a grabber for the ONI file.\n        pcl::io::OpenNI2Grabber* grabber = new pcl::io::OpenNI2Grabber (argv[2]);\n\t\t\/\/Calls boost to set up writing to PCD\n        boost::function<void (const CloudConstPtr&) > f = boost::bind (&cloud_cb, _1);\n\t\t\/\/Callback to let the program know when the file has been written.\n        boost::signals2::connection c = grabber->registerCallback (f);\n        \n\t\t\/\/Do-while loop to read in all of the frames from the ONI file\n        do\n        {\n            grabber->start ();\n        }while (grabber->isRunning ());\n        \n        PCL_INFO (\"Successfully processed %d frames.\\n\", i);\n        \n        delete grabber;\n    }\n    \n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/This is the area for using the pointCloudViewer\n    \n    \/\/\/ <summary>\n\t\/\/\/ This is a dummy example to show the use of writing a pcl file\n\t\/\/\/ that contains a 5x2 cloud with random values\n\t\/\/\/ Code taken from here:\n\t\/\/\/ http:\/\/pointclouds.org\/documentation\/tutorials\/writing_pcd.php#writing-pcd\n\t\/\/\/ <\/summary>\n\tvoid createDummyPointCloud()\n\t{\n\t\tpcl::PointCloud<pcl::PointXYZ> cloud;\n\n\t\t\/\/ Fill in the cloud data\n\t\tcloud.width = 5;\n\t\tcloud.height = 2;\n\t\tcloud.is_dense = false;\n\t\tcloud.points.resize(cloud.width * cloud.height);\n\n\t\tfor (size_t i = 0; i < cloud.points.size(); ++i)\n\t\t{\n\t\t\tcloud.points[i].x = 1024 * rand() \/ (RAND_MAX + 1.0f);\n\t\t\tcloud.points[i].y = 1024 * rand() \/ (RAND_MAX + 1.0f);\n\t\t\tcloud.points[i].z = 1024 * rand() \/ (RAND_MAX + 1.0f);\n\t\t}\n\n\t\tpcl::io::savePCDFileASCII(\"test_pcd.pcd\", cloud);\n\t\tstd::cerr << \"Saved \" << cloud.points.size() << \" data points to test_pcd.pcd.\" << std::endl;\n\n\t\tfor (size_t i = 0; i < cloud.points.size(); ++i)\n\t\t\tstd::cerr << \"    \" << cloud.points[i].x << \" \" << cloud.points[i].y << \" \" << cloud.points[i].z << std::endl;\n\t}\n}<commit_msg>added modulus functionality for point cloud<commit_after>#include <iostream>\n#include <fstream>\n#include <OpenNI.h>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/point_types.h>\n#include <pcl\/io\/Grabber.h>\n#include <pcl\/point_cloud.h>\n#include <pcl\/io\/openni2_grabber.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/io\/pcd_grabber.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/visualization\/boost.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/visualization\/image_viewer.h>\n#include <vector>\n#include \"onimeshfunctions.h\"\n\nnamespace onimesh\n{\n        \n    boost::mutex mutex_;\n    boost::shared_ptr<pcl::PCDGrabber<pcl::PointXYZRGBA> > grabber;\n    pcl::PointCloud<pcl::PointXYZRGBA>::ConstPtr cloud_;\n    \n    typedef pcl::PointCloud<pcl::PointXYZRGBA> Cloud;\n    typedef Cloud::ConstPtr CloudConstPtr;\n    \n    int i = 0;\n    char buf[4096];\n    \n\tconst int FRAME_DATA_MOD = 100;\n\n\t\/\/\/ <summary>\n\t\/\/\/ Creates a name for an output file\n\t\/\/\/ <\/summary>\n\tstd::string getOutputFileName(const char* outputDirectory, const char* inputFile, const char* fileExtension)\n\t{\n\t\t\/\/ If the path contains '\/' characters\n\t\tif (std::string(inputFile).find_last_of('\/') != std::string::npos)\n\t\t{\n\t\t\t\/\/ Check if the directory needs a trailing '\/'\n\t\t\tif (std::string(outputDirectory).back() == '\/' || std::string(outputDirectory).back() == '\\\\')\n\t\t\t\treturn std::string(std::string(outputDirectory) + std::string(inputFile).substr(std::string(inputFile).find_last_of('\/') + 1) + std::string(fileExtension));\n\n\t\t\treturn std::string(std::string(outputDirectory) + std::string(\"\/\") + std::string(inputFile).substr(std::string(inputFile).find_last_of('\/') + 1) + std::string(fileExtension));\n\t\t}\n\t\t\/\/ If the path contains '\\' characters\n\t\telse if (std::string(inputFile).find_last_of('\\\\') == std::string::npos)\n\t\t{\n\t\t\t\/\/ Check if the directory needs a trailing '\\'\n\t\t\tif (std::string(outputDirectory).back() == '\/' || std::string(outputDirectory).back() == '\\\\')\n\t\t\t\treturn std::string(std::string(outputDirectory) + std::string(inputFile).substr(std::string(inputFile).find_last_of('\\\\') + 1) + std::string(fileExtension));\n\n\t\t\treturn std::string(std::string(outputDirectory) + std::string(\"\\\\\") + std::string(inputFile).substr(std::string(inputFile).find_last_of('\\\\') + 1) + std::string(fileExtension));\n\t\t}\n\n\t\t\/\/ Otherwise the input file does not contain a path\n\t\t\/\/ Check if the directory needs a trailing '\/'\n\t\tif (std::string(outputDirectory).back() == '\/' || std::string(outputDirectory).back() == '\\\\')\n\t\t\treturn std::string(std::string(outputDirectory) + std::string(inputFile) + std::string(fileExtension));\n\n\t\treturn std::string(std::string(outputDirectory) + std::string(\"\/\") + std::string(inputFile) + std::string(fileExtension));\n\t}\n\n\t\/\/\/ <summary>\n\t\/\/\/ Reads oni input and exports data as excel docs\n\t\/\/\/ <\/summary>\n\tvoid outputExcel(const int argc, const char** argv)\n\t{\n\t\tstd::cout << \"Start excel data output...\\n\";\n\t\t\n        const char* outputDirectory = argv[1];\n        char* inputFile;\n\t\tconst int numberInputFiles = argc - 2;\n\t\topenni::Device device;\n\t\topenni::VideoStream ir;\n\t\topenni::VideoFrameRef irf;\n\t\tOniDepthPixel* pDepth;\n\t\tint frameHeight, frameWidth;\n\t\tlong frameIndex, numberOfFrames;\n\t\tstd::ofstream out;\n        \n        \/\/ Initialize openni\n        openni::Status rc = openni::OpenNI::initialize();\n        if (rc != openni::STATUS_OK)\n        {\n            printf(\"Initialize failed\\n%s\\n\", openni::OpenNI::getExtendedError());\n            exit(2);\n        }\n\n\t\t\/\/ Output excel doc for each input file\n\t\tfor (int w = 0; w < numberInputFiles; ++w)\n\t\t{\n\t\t\tinputFile = (char*)argv[w + 2];\n\t\t\tstd::cout << \"Working on file \" << inputFile << \"...\\n\";\n\t\t\t\n\t\t\t\/\/ Open the .oni file\n\t\t\trc = device.open(inputFile);\n            if (rc != openni::STATUS_OK)\n            {\n                printf(\"Couldn't open device\\n%s\\n\", openni::OpenNI::getExtendedError());\n                exit(3);\n            }\n            \n            \/\/ Create the Video Stream\n\t\t\trc = ir.create(device, openni::SENSOR_DEPTH);\n            if (rc != openni::STATUS_OK)\n            {\n                printf(\"Couldn't create depth stream\\n%s\\n\", openni::OpenNI::getExtendedError());\n                exit(4);\n            }\n            \n\t\t\t\/\/ Device Check\n\t\t\tif (!device.isValid())\n\t\t\t{\n\t\t\t\tstd::cerr << \"\\nThe device is not valid.\\n\";\n\t\t\t\texit(5);\n\t\t\t}\n            \n\t\t\t\/\/ Verify the device is a file\n\t\t\tif (!device.isFile())\n\t\t\t{\n\t\t\t\tstd::cerr << \"\\nThe device is not a file.\\n\";\n\t\t\t\texit(6);\n\t\t\t}\n\t\t\tstd::cout << \"File open success...\\n\";\n\n\t\t\t\/\/ Set playback controls\n\t\t\topenni::PlaybackControl* pbc = device.getPlaybackControl();\n\t\t\tpbc->setSpeed(-1);\n\t\t\tpbc->setRepeatEnabled(false);\n\n\t\t\t\/\/ Open output file\n\t\t\tstd::string outputFile = getOutputFileName(outputDirectory, inputFile, \".csv\");\n\t\t\tout.open(outputFile);\n\n\t\t\t\/\/ Read all frames\n\t\t\tnumberOfFrames = pbc->getNumberOfFrames(ir);\n\t\t\tstd::cout << \"Start reading frame data...\\n\";\n\t\t\trc = ir.start();\n            if (rc != openni::STATUS_OK)\n            {\n                printf(\"Couldn't start the depth stream\\n%s\\n\", openni::OpenNI::getExtendedError());\n                exit(7);\n            }\n            \n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\t\/\/ Read a frame\n\t\t\t\trc = ir.readFrame(&irf);\n                if (rc != openni::STATUS_OK)\n                {\n                    printf(\"Read failed!\\n%s\\n\", openni::OpenNI::getExtendedError());\n                    continue;\n                }\n\n\t\t\t\t\/\/ Verify frame data is valid\n\t\t\t\tif (!irf.isValid())\n\t\t\t\t{\n\t\t\t\t\tstd::cerr << \"Error reading video stream frame\\n\";\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t\/\/ Gather frame data\n\t\t\t\tpDepth = (OniDepthPixel*)irf.getData();\n\t\t\t\tframeIndex = irf.getFrameIndex();\n\n\t\t\t\t\/\/ Skip unneeded frames\n\t\t\t\tif (frameIndex % FRAME_DATA_MOD == 0)\n\t\t\t\t{\n\t\t\t\t\tframeHeight = irf.getHeight();\n\t\t\t\t\tframeWidth = irf.getWidth();\n\t\t\t\t\tstd::cout << \"Processing \" << frameWidth << \"x\" << frameHeight << \" frame number \" << frameIndex << \"...\\n\";\n\t\t\t\t\tout << \"FrameNumber=\" << frameIndex << \",FrameWidth=\" << frameWidth << \",FrameHeight=\" << frameHeight << \",\\n\";\n\t\t\t\t\tfor (int y = 0; y < frameHeight; ++y)  \/\/ All heights\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int x = 0; x < frameWidth; ++x, ++pDepth)  \/\/ All witdths\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tout << *pDepth << \",\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\tout << \"\\n\";\n\t\t\t\t\t}\n\t\t\t\t\tout << \",\\n\";\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/std::cout << \"Skipping frame \" << frameIndex << \"\\n\";\n\t\t\t\t}\n\n\t\t\t\t\/\/ Break if reading the last frame\n\t\t\t\tif (numberOfFrames == frameIndex)\n\t\t\t\t{\n\t\t\t\t\tstd::cout << \"Last frame has been read...\\n\";\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Cleanup\n\t\t\tout.clear();\n\t\t\tout.close();\n\t\t\tir.stop();\n\t\t\tir.destroy();\n\t\t\tdevice.close();\n\t\t}\n\n\t\t\/\/ OpenNI cleanup\n\t\topenni::OpenNI::shutdown();\n\t\tstd::cout << \"Excel data output complete.\\n\";\n\t}\n\n\t\/\/\/ <summary>\n\t\/\/\/ Reads oni input and exports data as point clouds\n\t\/\/\/ <\/summary>\n    \/*\n     * Software License Agreement (BSD License)\n     *\n     *  Point Cloud Library (PCL) - www.pointclouds.org\n     *  Copyright (c) 2011, Willow Garage, Inc.\n     *  Copyright (c) 2012-, Open Perception, 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 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     *\n     *\/\n       \n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/cloud_cb \n\t\/\/Purpose: Takes a cloud object and writes it to a PCD file.\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void cloud_cb (const CloudConstPtr& cloud)\n    {\n        if ( i % 50 == 0)\n        {\n            pcl::PCDWriter w;\n            sprintf_s (buf, \"frame_%06d.pcd\", i);\n            w.writeBinaryCompressed (buf, *cloud);\n            PCL_INFO (\"Wrote a cloud with %lu (%ux%u) points in %s.\\n\",\n                  cloud->size (), cloud->width, cloud->height, buf);\n        }\n        ++i;\n    }\n    \n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ outputPointCloud\n\t\/\/ Purpose: Makes a OpenNI2Grabber to read from the ONI file. As the file is read in cloud_cb\n\t\/\/          is called to write the data to a PCD file. After the file has been read the \n\t\/\/\t\t\tgrabber is deleted.\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/          \n\tvoid outputPointCloud(const int argc, const char** argv)\n\t{\n        for (int j = 2; j < argc; j++)\n        {\n            \/\/Writes a message to the console.\n            pcl::console::print_info (\"Convert an ONI file to PCD format.\\n\");\n        \n            \/\/Initializes a grabber for the ONI file.\n            pcl::io::OpenNI2Grabber* grabber = new pcl::io::OpenNI2Grabber (argv[j]);\n            \/\/Calls boost to set up writing to PCD\n            boost::function<void (const CloudConstPtr&) > f = boost::bind (&cloud_cb, _1);\n            \/\/Callback to let the program know when the file has been written.\n            boost::signals2::connection c = grabber->registerCallback (f);\n        \n            \/\/Do-while loop to read in all of the frames from the ONI file\n            do\n            {\n                grabber->start ();\n            }while (grabber->isRunning ());\n        \n            PCL_INFO (\"Successfully processed %d frames.\\n\", i);\n        \n            delete grabber;\n        }\n    }\n    \n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/This is the area for using the pointCloudViewer\n    \n    \/\/\/ <summary>\n\t\/\/\/ This is a dummy example to show the use of writing a pcl file\n\t\/\/\/ that contains a 5x2 cloud with random values\n\t\/\/\/ Code taken from here:\n\t\/\/\/ http:\/\/pointclouds.org\/documentation\/tutorials\/writing_pcd.php#writing-pcd\n\t\/\/\/ <\/summary>\n\tvoid createDummyPointCloud()\n\t{\n\t\tpcl::PointCloud<pcl::PointXYZ> cloud;\n\n\t\t\/\/ Fill in the cloud data\n\t\tcloud.width = 5;\n\t\tcloud.height = 2;\n\t\tcloud.is_dense = false;\n\t\tcloud.points.resize(cloud.width * cloud.height);\n\n\t\tfor (size_t i = 0; i < cloud.points.size(); ++i)\n\t\t{\n\t\t\tcloud.points[i].x = 1024 * rand() \/ (RAND_MAX + 1.0f);\n\t\t\tcloud.points[i].y = 1024 * rand() \/ (RAND_MAX + 1.0f);\n\t\t\tcloud.points[i].z = 1024 * rand() \/ (RAND_MAX + 1.0f);\n\t\t}\n\n\t\tpcl::io::savePCDFileASCII(\"test_pcd.pcd\", cloud);\n\t\tstd::cerr << \"Saved \" << cloud.points.size() << \" data points to test_pcd.pcd.\" << std::endl;\n\n\t\tfor (size_t i = 0; i < cloud.points.size(); ++i)\n\t\t\tstd::cerr << \"    \" << cloud.points[i].x << \" \" << cloud.points[i].y << \" \" << cloud.points[i].z << std::endl;\n\t}\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) 2016 ScyllaDB\n *\/\n\n#include \"prometheus.hh\"\n#include <google\/protobuf\/io\/coded_stream.h>\n#include <google\/protobuf\/io\/zero_copy_stream_impl_lite.h>\n#include \"proto\/metrics2.pb.h\"\n\n#include \"scollectd_api.hh\"\n#include \"http\/function_handlers.hh\"\n#include <boost\/algorithm\/string\/replace.hpp>\n\nnamespace prometheus {\nnamespace pm = io::prometheus::client;\n\n\/**\n * Taken from an answer in stackoverflow:\n * http:\/\/stackoverflow.com\/questions\/2340730\/are-there-c-equivalents-for-the-protocol-buffers-delimited-i-o-functions-in-ja\n *\/\nstatic bool write_delimited_to(const google::protobuf::MessageLite& message,\n        google::protobuf::io::ZeroCopyOutputStream* rawOutput) {\n    google::protobuf::io::CodedOutputStream output(rawOutput);\n\n    const int size = message.ByteSize();\n    output.WriteVarint32(size);\n\n    uint8_t* buffer = output.GetDirectBufferForNBytesAndAdvance(size);\n    if (buffer != nullptr) {\n        message.SerializeWithCachedSizesToArray(buffer);\n    } else {\n        message.SerializeWithCachedSizes(&output);\n        if (output.HadError()) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\nstatic std::string safe_name(const sstring& name) {\n    return boost::replace_all_copy(boost::replace_all_copy(name, \"-\", \"_\"), \" \", \"_\");\n}\n\nstatic sstring collectd_name(const scollectd::type_instance_id & id, uint32_t cpu) {\n    return safe_name(id.plugin()) + \":\" + safe_name(id.type()) + \":\" + safe_name(id.type_instance()) + \":\" + std::to_string(cpu);\n}\n\n\nstatic void fill_metric(pm::MetricFamily& mf, const std::vector<scollectd::collectd_value>& vals) {\n    for (const scollectd::collectd_value& c : vals) {\n        switch (c.type()) {\n        case scollectd::data_type::DERIVE:\n            mf.add_metric()->mutable_counter()->set_value(c.i());\n            mf.set_type(pm::MetricType::COUNTER);\n            break;\n        case scollectd::data_type::GAUGE:\n            mf.add_metric()->mutable_gauge()->set_value(c.d());\n            mf.set_type(pm::MetricType::GAUGE);\n            break;\n        default:\n            mf.add_metric()->mutable_counter()->set_value(c.ui());\n            mf.set_type(pm::MetricType::COUNTER);\n            break;\n        }\n    }\n}\n\nfuture<> start(httpd::http_server_control& http_server, const config& ctx) {\n    return http_server.set_routes([&ctx](httpd::routes& r) {\n        httpd::future_handler_function f = [&ctx](std::unique_ptr<request> req, std::unique_ptr<reply> rep) {\n            return do_with(std::vector<scollectd::value_map>(), [rep = std::move(rep), &ctx] (auto& vec) mutable {\n                vec.resize(smp::count);\n                return parallel_for_each(boost::irange(0u, smp::count), [&vec] (auto cpu) {\n                    return smp::submit_to(cpu, [] {\n                        return scollectd::get_value_map();\n                    }).then([&vec, cpu] (auto res) {\n                        vec[cpu] = res;\n                    });\n                }).then([rep = std::move(rep), &vec, &ctx]() mutable {\n                    uint32_t cpu = 0;\n                    for (auto value: vec) {\n                        cpu++;\n                        for (auto i : value) {\n                            pm::MetricFamily mtf;\n                            std::string s;\n                            google::protobuf::io::StringOutputStream os(&s);\n                            mtf.set_name(collectd_name(i.first, cpu));\n                            mtf.set_help(ctx.metric_help);\n                            fill_metric(mtf, i.second);\n                            if (mtf.metric_size() > 0) {\n                                std::stringstream ss;\n                                if (!write_delimited_to(mtf, &os)) {\n                                    seastar_logger.warn(\"Failed to write protobuf metrics\");\n                                }\n                                rep->_content += s;\n                            }\n                        }\n                    }\n                    return make_ready_future<std::unique_ptr<reply>>(std::move(rep));\n                });\n            });\n        };\n        r.put(GET, \"\/metrics\", new httpd::function_handler(f, \"proto\"));\n    });\n}\n\n}\n<commit_msg>prometheus: remove invalid chars from meric names<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) 2016 ScyllaDB\n *\/\n\n#include \"prometheus.hh\"\n#include <google\/protobuf\/io\/coded_stream.h>\n#include <google\/protobuf\/io\/zero_copy_stream_impl_lite.h>\n#include \"proto\/metrics2.pb.h\"\n\n#include \"scollectd_api.hh\"\n#include \"http\/function_handlers.hh\"\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/range\/algorithm_ext\/erase.hpp>\n#include <boost\/algorithm\/string.hpp>\n\nnamespace prometheus {\nnamespace pm = io::prometheus::client;\n\n\/**\n * Taken from an answer in stackoverflow:\n * http:\/\/stackoverflow.com\/questions\/2340730\/are-there-c-equivalents-for-the-protocol-buffers-delimited-i-o-functions-in-ja\n *\/\nstatic bool write_delimited_to(const google::protobuf::MessageLite& message,\n        google::protobuf::io::ZeroCopyOutputStream* rawOutput) {\n    google::protobuf::io::CodedOutputStream output(rawOutput);\n\n    const int size = message.ByteSize();\n    output.WriteVarint32(size);\n\n    uint8_t* buffer = output.GetDirectBufferForNBytesAndAdvance(size);\n    if (buffer != nullptr) {\n        message.SerializeWithCachedSizesToArray(buffer);\n    } else {\n        message.SerializeWithCachedSizes(&output);\n        if (output.HadError()) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\nstatic std::string safe_name(const sstring& name) {\n    auto rep = boost::replace_all_copy(boost::replace_all_copy(name, \"-\", \"_\"), \" \", \"_\");\n    boost::remove_erase_if(rep, boost::is_any_of(\"+()\"));\n    return rep;\n}\n\nstatic sstring collectd_name(const scollectd::type_instance_id & id, uint32_t cpu) {\n    return safe_name(id.plugin()) + \":\" + safe_name(id.type()) + \":\" + safe_name(id.type_instance()) + \":\" + std::to_string(cpu);\n}\n\n\nstatic void fill_metric(pm::MetricFamily& mf, const std::vector<scollectd::collectd_value>& vals) {\n    for (const scollectd::collectd_value& c : vals) {\n        switch (c.type()) {\n        case scollectd::data_type::DERIVE:\n            mf.add_metric()->mutable_counter()->set_value(c.i());\n            mf.set_type(pm::MetricType::COUNTER);\n            break;\n        case scollectd::data_type::GAUGE:\n            mf.add_metric()->mutable_gauge()->set_value(c.d());\n            mf.set_type(pm::MetricType::GAUGE);\n            break;\n        default:\n            mf.add_metric()->mutable_counter()->set_value(c.ui());\n            mf.set_type(pm::MetricType::COUNTER);\n            break;\n        }\n    }\n}\n\nfuture<> start(httpd::http_server_control& http_server, const config& ctx) {\n    return http_server.set_routes([&ctx](httpd::routes& r) {\n        httpd::future_handler_function f = [&ctx](std::unique_ptr<request> req, std::unique_ptr<reply> rep) {\n            return do_with(std::vector<scollectd::value_map>(), [rep = std::move(rep), &ctx] (auto& vec) mutable {\n                vec.resize(smp::count);\n                return parallel_for_each(boost::irange(0u, smp::count), [&vec] (auto cpu) {\n                    return smp::submit_to(cpu, [] {\n                        return scollectd::get_value_map();\n                    }).then([&vec, cpu] (auto res) {\n                        vec[cpu] = res;\n                    });\n                }).then([rep = std::move(rep), &vec, &ctx]() mutable {\n                    uint32_t cpu = 0;\n                    for (auto value: vec) {\n                        cpu++;\n                        for (auto i : value) {\n                            pm::MetricFamily mtf;\n                            std::string s;\n                            google::protobuf::io::StringOutputStream os(&s);\n                            mtf.set_name(collectd_name(i.first, cpu));\n                            mtf.set_help(ctx.metric_help);\n                            fill_metric(mtf, i.second);\n                            if (mtf.metric_size() > 0) {\n                                std::stringstream ss;\n                                if (!write_delimited_to(mtf, &os)) {\n                                    seastar_logger.warn(\"Failed to write protobuf metrics\");\n                                }\n                                rep->_content += s;\n                            }\n                        }\n                    }\n                    return make_ready_future<std::unique_ptr<reply>>(std::move(rep));\n                });\n            });\n        };\n        r.put(GET, \"\/metrics\", new httpd::function_handler(f, \"proto\"));\n    });\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef JEZUK_EVENTS_MUTATIONEVENT_H\n#define JEZUK_EVENTS_MUTATIONEVENT_H\n\n#include <DOM\/Events\/Event.hpp>\n\nnamespace Arabica\n{\nnamespace DOM\n{\n\nnamespace Events\n{\n\ntemplate<class stringT, class string_adaptorT> class MutationEvent_impl;\n\ntemplate<class stringT, class string_adaptorT = Arabica::default_string_adaptor<stringT> >\nclass MutationEvent : public Event<stringT, string_adaptorT>\n{\n  public:\n    typedef MutationEvent_impl<stringT, string_adaptorT> MutationEvent_implT;\n    typedef Event<stringT, string_adaptorT> EventT;\n    typedef DOM::Proxy<MutationEvent_implT> proxy_t;\n\n    MutationEvent() : Event<stringT, string_adaptorT>() { }\n    MutationEvent(MutationEvent_impl<stringT, string_adaptorT>* const impl) : Event<stringT, string_adaptorT>(impl) { }\n    MutationEvent(const MutationEvent& rhs) : Event<stringT, string_adaptorT>(rhs) { }\n    explicit MutationEvent(const Event<stringT, string_adaptorT>& rhs) : Event<stringT, string_adaptorT>(rhs)  \n    {\n      if(dynamic_cast<MutationEvent_impl<stringT, string_adaptorT>*>(rhs.Event<stringT, string_adaptorT>::proxy_t::operator*()) == 0)\n        throw DOMBadCast(\"Element\");\n    } \/\/ Element\n    virtual ~MutationEvent() { }\n    bool operator==(const MutationEvent& rhs) const { return proxy_t::operator==(rhs); } \n    bool operator!=(const MutationEvent& rhs) const { return proxy_t::operator!=(rhs); }\n    bool operator==(int dummy) const { return proxy_t::operator==(dummy); }\n    bool operator!=(int dummy) const { return proxy_t::operator!=(dummy); }\n\n    MutationEvent& operator=(const MutationEvent& rhs) \n    {\n      proxy_t::operator=(rhs);\n      return *this;\n    } \/\/ operator=\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ MutationEvent methods\n    enum AttrChange\n    {\n      MODIFICATION = 1,\n      ADDITION = 2,\n      REMOVAL = 3\n    }; \/\/ enum Change\n\n    DOM::Node<stringT> getRelatedNode() const { return mImpl()->getRelatedNode(); }\n\n    stringT getPrevValue() const { return mImpl()->getPrevValue(); }\n\n    stringT getNextValue() const { return mImpl()->getNextValue(); }\n\n    stringT getAttrName() const { return mImpl()->getAttrName(); }\n\n    AttrChange getAttrChange() const { return mImpl()->getAttrChange(); }\n\n    void initMutationEvent(const stringT& typeArg,\n                           bool canBubble,\n                           bool canCancel,\n                           DOM::Node<stringT> relatedNode,\n                           const stringT& prevValueArg,\n                           const stringT& nextValueArg,\n                           const stringT& attrNameArg,\n                           AttrChange attrChangeArg)\n    {\n      mImpl()->initMutationEvent(typeArg, canBubble, canCancel, relatedNode,\n                                 prevValueArg, nextValueArg, attrNameArg, attrChangeArg);\n    } \/\/ initMutationEvent\n\n  private:\n  MutationEvent_implT* mImpl() const { return dynamic_cast<MutationEvent_implT*>(EventT::proxy_t::operator*()); }\n}; \/\/ class Event\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Event_impl\ntemplate<class stringT, class string_adaptorT = Arabica::default_string_adaptor<stringT> >\nclass MutationEvent_impl : virtual public Event_impl<stringT, string_adaptorT>\n{\n  public:\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ MutationEvent methods\n    virtual DOM::Node<stringT> getRelatedNode() const = 0;\n\n    virtual stringT getPrevValue() const = 0;\n\n    virtual stringT getNextValue() const = 0;\n\n    virtual stringT getAttrName() const = 0;\n\n    virtual typename MutationEvent<stringT, string_adaptorT>::AttrChange getAttrChange() const = 0;\n\n    virtual void initMutationEvent(const stringT& typeArg,\n                                   bool canBubble,\n                                   bool canCancel,\n                                   DOM::Node<stringT> relatedNode,\n                                   const stringT& prevValueArg,\n                                   const stringT& nextValueArg,\n                                   const stringT& attrNameArg,\n                                   typename MutationEvent<stringT, string_adaptorT>::AttrChange attrChangeArg) = 0;\n\n\n}; \/\/ class Event_impl\n\n} \/\/ namespace Events\n\n} \/\/ namespace DOM\n} \/\/ namespace Arabica\n\n#endif\n\/\/ end of file\n<commit_msg>Accept const char* to initMutationEvent<commit_after>#ifndef JEZUK_EVENTS_MUTATIONEVENT_H\r\n#define JEZUK_EVENTS_MUTATIONEVENT_H\r\n\r\n#include <DOM\/Events\/Event.hpp>\r\n\r\nnamespace Arabica\r\n{\r\nnamespace DOM\r\n{\r\n\r\nnamespace Events\r\n{\r\n\r\ntemplate<class stringT, class string_adaptorT> class MutationEvent_impl;\r\n\r\ntemplate<class stringT, class string_adaptorT = Arabica::default_string_adaptor<stringT> >\r\nclass MutationEvent : public Event<stringT, string_adaptorT>\r\n{\r\n  public:\r\n    typedef MutationEvent_impl<stringT, string_adaptorT> MutationEvent_implT;\r\n    typedef Event<stringT, string_adaptorT> EventT;\r\n    typedef DOM::Proxy<MutationEvent_implT> proxy_t;\r\n\r\n    MutationEvent() : Event<stringT, string_adaptorT>() { }\r\n    MutationEvent(MutationEvent_impl<stringT, string_adaptorT>* const impl) : Event<stringT, string_adaptorT>(impl) { }\r\n    MutationEvent(const MutationEvent& rhs) : Event<stringT, string_adaptorT>(rhs) { }\r\n    explicit MutationEvent(const Event<stringT, string_adaptorT>& rhs) : Event<stringT, string_adaptorT>(rhs)  \r\n    {\r\n      if(dynamic_cast<MutationEvent_impl<stringT, string_adaptorT>*>(rhs.Event<stringT, string_adaptorT>::proxy_t::operator*()) == 0)\r\n        throw DOMBadCast(\"Element\");\r\n    } \/\/ Element\r\n    virtual ~MutationEvent() { }\r\n    bool operator==(const MutationEvent& rhs) const { return proxy_t::operator==(rhs); } \r\n    bool operator!=(const MutationEvent& rhs) const { return proxy_t::operator!=(rhs); }\r\n    bool operator==(int dummy) const { return proxy_t::operator==(dummy); }\r\n    bool operator!=(int dummy) const { return proxy_t::operator!=(dummy); }\r\n\r\n    MutationEvent& operator=(const MutationEvent& rhs) \r\n    {\r\n      proxy_t::operator=(rhs);\r\n      return *this;\r\n    } \/\/ operator=\r\n\r\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n    \/\/ MutationEvent methods\r\n    enum AttrChange\r\n    {\r\n      MODIFICATION = 1,\r\n      ADDITION = 2,\r\n      REMOVAL = 3\r\n    }; \/\/ enum Change\r\n\r\n    DOM::Node<stringT> getRelatedNode() const { return mImpl()->getRelatedNode(); }\r\n\r\n    stringT getPrevValue() const { return mImpl()->getPrevValue(); }\r\n\r\n    stringT getNextValue() const { return mImpl()->getNextValue(); }\r\n\r\n    stringT getAttrName() const { return mImpl()->getAttrName(); }\r\n\r\n    AttrChange getAttrChange() const { return mImpl()->getAttrChange(); }\r\n\r\n    void initMutationEvent(const char* typeArg,\r\n                           bool canBubble,\r\n                           bool canCancel,\r\n                           DOM::Node<stringT> relatedNode,\r\n                           const stringT& prevValueArg,\r\n                           const stringT& nextValueArg,\r\n                           const stringT& attrNameArg,\r\n                           AttrChange attrChangeArg)\r\n    {\r\n      mImpl()->initMutationEvent(string_adaptorT::convert_from_utf8(typeArg),      \r\n                                 canBubble, canCancel, relatedNode,\r\n                                 prevValueArg, nextValueArg, attrNameArg, attrChangeArg);\r\n    } \/\/ initMutationEvent\r\n\r\n  private:\r\n  MutationEvent_implT* mImpl() const { return dynamic_cast<MutationEvent_implT*>(EventT::proxy_t::operator*()); }\r\n}; \/\/ class Event\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Event_impl\r\ntemplate<class stringT, class string_adaptorT = Arabica::default_string_adaptor<stringT> >\r\nclass MutationEvent_impl : virtual public Event_impl<stringT, string_adaptorT>\r\n{\r\n  public:\r\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n    \/\/ MutationEvent methods\r\n    virtual DOM::Node<stringT> getRelatedNode() const = 0;\r\n\r\n    virtual stringT getPrevValue() const = 0;\r\n\r\n    virtual stringT getNextValue() const = 0;\r\n\r\n    virtual stringT getAttrName() const = 0;\r\n\r\n    virtual typename MutationEvent<stringT, string_adaptorT>::AttrChange getAttrChange() const = 0;\r\n\r\n    virtual void initMutationEvent(const stringT& typeArg,\r\n                                   bool canBubble,\r\n                                   bool canCancel,\r\n                                   DOM::Node<stringT> relatedNode,\r\n                                   const stringT& prevValueArg,\r\n                                   const stringT& nextValueArg,\r\n                                   const stringT& attrNameArg,\r\n                                   typename MutationEvent<stringT, string_adaptorT>::AttrChange attrChangeArg) = 0;\r\n\r\n\r\n}; \/\/ class Event_impl\r\n\r\n} \/\/ namespace Events\r\n\r\n} \/\/ namespace DOM\r\n} \/\/ namespace Arabica\r\n\r\n#endif\r\n\/\/ end of file\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This File is part of Davix, The IO library for HTTP based protocols\n * Copyright (C) 2013  Adrien Devresse <adrien.devresse@cern.ch>, CERN\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#ifndef DAVIX_CONFIG\n#define DAVIX_CONFIG\n\n#include <functional>\n\n#ifndef __DAVIX_INSIDE__\n#error \"Only davix.hpp should be included.\"\n#endif\n\n\/\/\n\/\/ export\n\/\/\n#ifndef DAVIX_EXPORT\n#define DAVIX_EXPORT __attribute__((visibility(\"default\")))\n#endif\n\n\n\/\/\n\/\/ detect GCC\n\/\/\n#if (defined(__GNUC__) || defined(__GNUG__)) && !(defined(__clang__) || defined(__INTEL_COMPILER))\n#   ifndef __DAVIX_COMPILER_GCC\n#       define __DAVIX_COMPILER_GCC\n#   endif\n#endif\n\n\/\/\n\/\/ detect CXX11 support\n\/\/\n#if ( (__cplusplus > 199711L) \\\n     || (defined (DAVIX_FORCE_CXX11)) \\\n     || (defined __GXX_EXPERIMENTAL_CXX0X__) )\n#   ifndef __DAVIX_CX11_SUPPORT\n#       define __DAVIX_CX11_SUPPORT\n#   endif\n#endif\n\n\/\/\n\/\/ detect TR1 support\n\/\/\n#if ( (defined DAVIX_FORCE_TR1) \\\n      || (defined __DAVIX_COMPILER_GCC) \\\n      || (defined HAVE_TR1_SUPPORT))\n#   ifndef __DAVIX_TR1_SUPPORT\n#       define __DAVIX_TR1_SUPPORT\n#endif\n\n#endif\n\n\n\/\/\n\/\/ include tr1 namespace\n\/\/\n\n#if (!(defined __DAVIX_CX11_SUPPORT) \\\n    && (defined __DAVIX_TR1_SUPPORT))\n#       include <tr1\/functional>\n\nnamespace std{\n    using namespace std::tr1;\n}\n\n#endif\n\n\/\/\n\/\/ enable STD_FUNCTION_DECL\n\/\/\n#if ((defined __DAVIX_CX11_SUPPORT) \\\n    || (defined __DAVIX_TR1_SUPPORT) \\\n    || (defined HAVE_STD_FUNCTION))\n#   ifndef __DAVIX_HAS_STD_FUNCTION\n#       define __DAVIX_HAS_STD_FUNCTION\n#   endif\n#endif\n\n\/\/\n\/\/ davix preproc facilities\n\/\/\n#undef DAVIX_C_DECL_BEGIN\n#undef DAVIX_C_DECL_END\n#ifdef __cplusplus\n#define DAVIX_C_DECL_BEGIN \\\n        extern \"C\" {\n#define DAVIX_C_DECL_END }\n#else\n#define DAVIX_C_DECL_BEGIN  \/\/ void\n#define DAVIX_C_DECL_END    \/\/ void\n#endif\n\n\n\/\/\n\/\/ compat 32 bits\n#if  (( __WORDSIZE == 32 ) \\\n        || ( SIZE_MAX ==  (4294967295U) )) \\\n     && !(defined __DAVIX_COMPAT_32) \\\n     && !(defined __NO_DAVIX_COMPAT_32)\n#define __DAVIX_COMPAT_32\n#endif\n\n\n#endif \/\/ DAVIX_TYPES_HPP\n<commit_msg> add TR1 memory for EL5 compilation<commit_after>\/*\n * This File is part of Davix, The IO library for HTTP based protocols\n * Copyright (C) 2013  Adrien Devresse <adrien.devresse@cern.ch>, CERN\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#ifndef DAVIX_CONFIG\n#define DAVIX_CONFIG\n\n#include <functional>\n\n#ifndef __DAVIX_INSIDE__\n#error \"Only davix.hpp should be included.\"\n#endif\n\n\/\/\n\/\/ export\n\/\/\n#ifndef DAVIX_EXPORT\n#define DAVIX_EXPORT __attribute__((visibility(\"default\")))\n#endif\n\n\n\/\/\n\/\/ detect GCC\n\/\/\n#if (defined(__GNUC__) || defined(__GNUG__)) && !(defined(__clang__) || defined(__INTEL_COMPILER))\n#   ifndef __DAVIX_COMPILER_GCC\n#       define __DAVIX_COMPILER_GCC\n#   endif\n#endif\n\n\/\/\n\/\/ detect CXX11 support\n\/\/\n#if ( (__cplusplus > 199711L) \\\n     || (defined (DAVIX_FORCE_CXX11)) \\\n     || (defined __GXX_EXPERIMENTAL_CXX0X__) )\n#   ifndef __DAVIX_CX11_SUPPORT\n#       define __DAVIX_CX11_SUPPORT\n#   endif\n#endif\n\n\/\/\n\/\/ detect TR1 support\n\/\/\n#if ( (defined DAVIX_FORCE_TR1) \\\n      || (defined __DAVIX_COMPILER_GCC) \\\n      || (defined HAVE_TR1_SUPPORT))\n#   ifndef __DAVIX_TR1_SUPPORT\n#       define __DAVIX_TR1_SUPPORT\n#endif\n\n#endif\n\n\n\/\/\n\/\/ include tr1 namespace\n\/\/\n\n#if (!(defined __DAVIX_CX11_SUPPORT) \\\n    && (defined __DAVIX_TR1_SUPPORT))\n#       include <tr1\/functional>\n#       include <tr1\/memory>\n\nnamespace std{\n    using namespace std::tr1;\n}\n\n#endif\n\n\/\/\n\/\/ enable STD_FUNCTION_DECL\n\/\/\n#if ((defined __DAVIX_CX11_SUPPORT) \\\n    || (defined __DAVIX_TR1_SUPPORT) \\\n    || (defined HAVE_STD_FUNCTION))\n#   ifndef __DAVIX_HAS_STD_FUNCTION\n#       define __DAVIX_HAS_STD_FUNCTION\n#   endif\n#endif\n\n\/\/\n\/\/ davix preproc facilities\n\/\/\n#undef DAVIX_C_DECL_BEGIN\n#undef DAVIX_C_DECL_END\n#ifdef __cplusplus\n#define DAVIX_C_DECL_BEGIN \\\n        extern \"C\" {\n#define DAVIX_C_DECL_END }\n#else\n#define DAVIX_C_DECL_BEGIN  \/\/ void\n#define DAVIX_C_DECL_END    \/\/ void\n#endif\n\n\n\/\/\n\/\/ compat 32 bits\n#if  (( __WORDSIZE == 32 ) \\\n        || ( SIZE_MAX ==  (4294967295U) )) \\\n     && !(defined __DAVIX_COMPAT_32) \\\n     && !(defined __NO_DAVIX_COMPAT_32)\n#define __DAVIX_COMPAT_32\n#endif\n\n\n#endif \/\/ DAVIX_TYPES_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file\n * \\brief SignalsCatcher 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-04-16\n *\/\n\n#ifndef INCLUDE_DISTORTOS_SIGNALSCATCHER_HPP_\n#define INCLUDE_DISTORTOS_SIGNALSCATCHER_HPP_\n\n#include \"distortos\/synchronization\/SignalsCatcherControlBlock.hpp\"\n\nnamespace distortos\n{\n\nnamespace synchronization\n{\n\nclass SignalsReceiverControlBlock;\n\n}\t\/\/ namespace synchronization\n\n\/\/\/ SignalsCatcher class is a container for synchronization::SignalsCatcherControlBlock\nclass SignalsCatcher\n{\n\tfriend class synchronization::SignalsReceiverControlBlock;\n\npublic:\n\n\t\/\/\/ import Storage type alias from synchronization::SignalsCatcherControlBlock\n\tusing Storage = synchronization::SignalsCatcherControlBlock::Storage;\n\n\t\/**\n\t * \\brief SignalsCatcher's constructor\n\t *\n\t * \\param [in] storageBegin is a pointer to first element of storage for\n\t * synchronization::SignalsCatcherControlBlock::Association objects\n\t * \\param [in] storageEnd is a pointer to \"one past the last\" element of storage for\n\t * synchronization::SignalsCatcherControlBlock::Association objects\n\t *\/\n\n\tconstexpr SignalsCatcher(Storage* const storageBegin, Storage* const storageEnd) :\n\t\t\tsignalsCatcherControlBlock_{storageBegin, storageEnd}\n\t{\n\n\t}\n\nprivate:\n\n\t\/\/\/ contained synchronization::SignalsCatcherControlBlock object\n\tsynchronization::SignalsCatcherControlBlock signalsCatcherControlBlock_;\n};\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_SIGNALSCATCHER_HPP_\n<commit_msg>SignalsCatcher: add helper constructor with array as argument and size of array deduced by template<commit_after>\/**\n * \\file\n * \\brief SignalsCatcher 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-04-16\n *\/\n\n#ifndef INCLUDE_DISTORTOS_SIGNALSCATCHER_HPP_\n#define INCLUDE_DISTORTOS_SIGNALSCATCHER_HPP_\n\n#include \"distortos\/synchronization\/SignalsCatcherControlBlock.hpp\"\n\nnamespace distortos\n{\n\nnamespace synchronization\n{\n\nclass SignalsReceiverControlBlock;\n\n}\t\/\/ namespace synchronization\n\n\/\/\/ SignalsCatcher class is a container for synchronization::SignalsCatcherControlBlock\nclass SignalsCatcher\n{\n\tfriend class synchronization::SignalsReceiverControlBlock;\n\npublic:\n\n\t\/\/\/ import Storage type alias from synchronization::SignalsCatcherControlBlock\n\tusing Storage = synchronization::SignalsCatcherControlBlock::Storage;\n\n\t\/**\n\t * \\brief SignalsCatcher's constructor\n\t *\n\t * \\param [in] storageBegin is a pointer to first element of storage for\n\t * synchronization::SignalsCatcherControlBlock::Association objects\n\t * \\param [in] storageEnd is a pointer to \"one past the last\" element of storage for\n\t * synchronization::SignalsCatcherControlBlock::Association objects\n\t *\/\n\n\tconstexpr SignalsCatcher(Storage* const storageBegin, Storage* const storageEnd) :\n\t\t\tsignalsCatcherControlBlock_{storageBegin, storageEnd}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief SignalsCatcher's constructor\n\t *\n\t * \\param N is the number of elements in \\a storage array\n\t *\n\t * \\param [in] storage is a reference to array of Storage elements\n\t *\/\n\n\ttemplate<size_t N>\n\tconstexpr explicit SignalsCatcher(Storage (& storage)[N]) :\n\t\t\tSignalsCatcher{std::begin(storage), std::end(storage)}\n\t{\n\n\t}\n\nprivate:\n\n\t\/\/\/ contained synchronization::SignalsCatcherControlBlock object\n\tsynchronization::SignalsCatcherControlBlock signalsCatcherControlBlock_;\n};\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_SIGNALSCATCHER_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n* Copyright (c) 2012, Howard Butler, hobu.inc@gmail.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#ifndef INCLUDED_PDAL_DRIVER_SOCI_READER_HPP\n#define INCLUDED_PDAL_DRIVER_SOCI_READER_HPP\n\n#include <pdal\/Reader.hpp>\n#include <pdal\/ReaderIterator.hpp>\n#include <pdal\/GDALUtils.hpp>\n\n#include <pdal\/drivers\/soci\/common.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/scoped_array.hpp>\n\n#include <vector>\n\nnamespace pdal\n{\nnamespace drivers\n{\nnamespace soci\n{\n\n\n\nclass PDAL_DLL Reader : public pdal::Reader\n{\npublic:\n    SET_STAGE_NAME(\"drivers.soci.reader\", \"SOCI Reader\")\n\n    Reader(const Options&);\n    ~Reader();\n\n    virtual void initialize();\n    virtual const Options getDefaultOptions() const;\n    virtual void addDefaultDimensions();\n\n    bool supportsIterator(StageIteratorType t) const\n    {\n        if (t == StageIterator_Sequential) return true;\n        return false;\n    }\n    \n    virtual boost::uint64_t getNumPoints() const;\n\n    pdal::StageSequentialIterator* createSequentialIterator(PointBuffer& buffer) const;\n\n    QueryType getQueryType() const\n    {\n        return m_query_type;\n    }\n    QueryType describeQueryType(std::string const& query) const;\n    \n    inline DatabaseType getDatabaseType() const { return m_database_type; }\n    pdal::Schema fetchSchema(std::string const& query) const;\n    pdal::SpatialReference fetchSpatialReference(std::string const& query) const;\n\n\nprivate:\n\n    Reader& operator=(const Reader&); \/\/ not implemented\n    Reader(const Reader&); \/\/ not implemented\n    \/\/\n\n    DatabaseType m_database_type;\n    QueryType m_query_type;\n        \n    \/\/ Connection m_connection;\n    \/\/ Statement m_initialQueryStatement;\n    \/\/ QueryType m_querytype;\n    \/\/ \n    \/\/ BlockPtr m_block;\n    \/\/ boost::uint32_t m_capacity;\n    \/\/ \n    \/\/ \/\/ Fields in the form of NAME:TYPE\n    \/\/ std::map<std::string, int> m_fields;\n    \/\/ \n    \/\/ boost::shared_ptr<pdal::gdal::Debug> m_gdal_debug;\n    mutable boost::uint64_t m_cachedPointCount;\n\n\n    #ifdef PDAL_HAVE_SOCI\n        ::soci::session* m_session;\n    #else\n        void* m_session;\n    #endif\n\n};\n\nnamespace iterators\n{\n\nnamespace sequential\n{\n\n\n    typedef boost::shared_ptr<PointBuffer> BufferPtr;\n    typedef std::map<int, BufferPtr> BufferMap;\n\nclass IteratorBase\n{\npublic:\n    IteratorBase(const pdal::drivers::soci::Reader& reader);\n    ~IteratorBase();\n\nprotected:\n    const pdal::drivers::soci::Reader& getReader() const;\n\n    boost::uint32_t myReadBuffer(PointBuffer& data);\n    \/\/ boost::uint32_t unpackOracleData(PointBuffer& data);\n    \/\/ \n    boost::uint32_t myReadClouds(PointBuffer& data);\n    boost::uint32_t myReadBlocks(PointBuffer& data, ::soci::statement& statement, ::soci::row& row);\n    \/\/ \n    BufferPtr fetchPointBuffer( boost::int32_t const& cloud_id,\n                                std::string const& schema_xml);\n\n    bool m_at_end;\n\n    DatabaseType m_database_type;\n    QueryType m_query_type;    \n\n    boost::int32_t m_active_cloud_id;\n    BufferPtr m_active_buffer;\n    BufferMap m_buffers;\n    boost::uint32_t m_buffer_position;\n\n\n\nprivate:\n    const pdal::drivers::soci::Reader& m_reader;\n\n    #ifdef PDAL_HAVE_SOCI\n        ::soci::session* m_session;\n    #else\n        void* m_session;\n    #endif\n\n    \n    ::soci::statement getNextCloud(   std::string const& cloud_table_name, \n                                      boost::int32_t& cloud_id,\n                                      ::soci::row& r);\n    void readBlob(::soci::row& block,\n                  boost::uint32_t howMany);\n    void fillUserBuffer(PointBuffer& user_buffer);\n    \/\/ \n    void copyDatabaseData(PointBuffer& source, \n                          PointBuffer& destination, \n                          Dimension const& dest_dim, \n                          boost::uint32_t source_starting_position, \n                          boost::uint32_t destination_starting_position,\n                          boost::uint32_t howMany);\n    \/\/ pdal::Bounds<double> getBounds(Statement statement, BlockPtr block);\n    IteratorBase& operator=(const IteratorBase&); \/\/ not implemented\n    IteratorBase(const IteratorBase&); \/\/ not implemented;\n\n\n};\n\n\nclass Reader : public IteratorBase, public pdal::StageSequentialIterator\n{\npublic:\n    Reader(const pdal::drivers::soci::Reader& reader, PointBuffer& buffer);\n    ~Reader();\n\nprivate:\n    boost::uint64_t skipImpl(boost::uint64_t count);\n    boost::uint32_t readBufferImpl(PointBuffer& data);\n    bool atEndImpl() const;\n};\n\n\n} \/\/ sequential\n\n} \/\/ iterators\n}\n}\n} \/\/ namespace pdal::driver::oci\n\n\n#endif \/\/ INCLUDED_PDAL_DRIVER_OCI_READER_HPP\n<commit_msg>don't include GDAL stuff in soci driver<commit_after>\/******************************************************************************\n* Copyright (c) 2012, Howard Butler, hobu.inc@gmail.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#ifndef INCLUDED_PDAL_DRIVER_SOCI_READER_HPP\n#define INCLUDED_PDAL_DRIVER_SOCI_READER_HPP\n\n#include <pdal\/Reader.hpp>\n#include <pdal\/ReaderIterator.hpp>\n\n\n#include <pdal\/drivers\/soci\/common.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/scoped_array.hpp>\n\n#include <vector>\n\nnamespace pdal\n{\nnamespace drivers\n{\nnamespace soci\n{\n\n\n\nclass PDAL_DLL Reader : public pdal::Reader\n{\npublic:\n    SET_STAGE_NAME(\"drivers.soci.reader\", \"SOCI Reader\")\n\n    Reader(const Options&);\n    ~Reader();\n\n    virtual void initialize();\n    virtual const Options getDefaultOptions() const;\n    virtual void addDefaultDimensions();\n\n    bool supportsIterator(StageIteratorType t) const\n    {\n        if (t == StageIterator_Sequential) return true;\n        return false;\n    }\n    \n    virtual boost::uint64_t getNumPoints() const;\n\n    pdal::StageSequentialIterator* createSequentialIterator(PointBuffer& buffer) const;\n\n    QueryType getQueryType() const\n    {\n        return m_query_type;\n    }\n    QueryType describeQueryType(std::string const& query) const;\n    \n    inline DatabaseType getDatabaseType() const { return m_database_type; }\n    pdal::Schema fetchSchema(std::string const& query) const;\n    pdal::SpatialReference fetchSpatialReference(std::string const& query) const;\n\n\nprivate:\n\n    Reader& operator=(const Reader&); \/\/ not implemented\n    Reader(const Reader&); \/\/ not implemented\n    \/\/\n\n    DatabaseType m_database_type;\n    QueryType m_query_type;\n        \n    \/\/ Connection m_connection;\n    \/\/ Statement m_initialQueryStatement;\n    \/\/ QueryType m_querytype;\n    \/\/ \n    \/\/ BlockPtr m_block;\n    \/\/ boost::uint32_t m_capacity;\n    \/\/ \n    \/\/ \/\/ Fields in the form of NAME:TYPE\n    \/\/ std::map<std::string, int> m_fields;\n    \/\/ \n    \/\/ boost::shared_ptr<pdal::gdal::Debug> m_gdal_debug;\n    mutable boost::uint64_t m_cachedPointCount;\n\n\n    #ifdef PDAL_HAVE_SOCI\n        ::soci::session* m_session;\n    #else\n        void* m_session;\n    #endif\n\n};\n\nnamespace iterators\n{\n\nnamespace sequential\n{\n\n\n    typedef boost::shared_ptr<PointBuffer> BufferPtr;\n    typedef std::map<int, BufferPtr> BufferMap;\n\nclass IteratorBase\n{\npublic:\n    IteratorBase(const pdal::drivers::soci::Reader& reader);\n    ~IteratorBase();\n\nprotected:\n    const pdal::drivers::soci::Reader& getReader() const;\n\n    boost::uint32_t myReadBuffer(PointBuffer& data);\n    \/\/ boost::uint32_t unpackOracleData(PointBuffer& data);\n    \/\/ \n    boost::uint32_t myReadClouds(PointBuffer& data);\n    boost::uint32_t myReadBlocks(PointBuffer& data, ::soci::statement& statement, ::soci::row& row);\n    \/\/ \n    BufferPtr fetchPointBuffer( boost::int32_t const& cloud_id,\n                                std::string const& schema_xml);\n\n    bool m_at_end;\n\n    DatabaseType m_database_type;\n    QueryType m_query_type;    \n\n    boost::int32_t m_active_cloud_id;\n    BufferPtr m_active_buffer;\n    BufferMap m_buffers;\n    boost::uint32_t m_buffer_position;\n\n\n\nprivate:\n    const pdal::drivers::soci::Reader& m_reader;\n\n    #ifdef PDAL_HAVE_SOCI\n        ::soci::session* m_session;\n    #else\n        void* m_session;\n    #endif\n\n    \n    ::soci::statement getNextCloud(   std::string const& cloud_table_name, \n                                      boost::int32_t& cloud_id,\n                                      ::soci::row& r);\n    void readBlob(::soci::row& block,\n                  boost::uint32_t howMany);\n    void fillUserBuffer(PointBuffer& user_buffer);\n    \/\/ \n    void copyDatabaseData(PointBuffer& source, \n                          PointBuffer& destination, \n                          Dimension const& dest_dim, \n                          boost::uint32_t source_starting_position, \n                          boost::uint32_t destination_starting_position,\n                          boost::uint32_t howMany);\n    \/\/ pdal::Bounds<double> getBounds(Statement statement, BlockPtr block);\n    IteratorBase& operator=(const IteratorBase&); \/\/ not implemented\n    IteratorBase(const IteratorBase&); \/\/ not implemented;\n\n\n};\n\n\nclass Reader : public IteratorBase, public pdal::StageSequentialIterator\n{\npublic:\n    Reader(const pdal::drivers::soci::Reader& reader, PointBuffer& buffer);\n    ~Reader();\n\nprivate:\n    boost::uint64_t skipImpl(boost::uint64_t count);\n    boost::uint32_t readBufferImpl(PointBuffer& data);\n    bool atEndImpl() const;\n};\n\n\n} \/\/ sequential\n\n} \/\/ iterators\n}\n}\n} \/\/ namespace pdal::driver::oci\n\n\n#endif \/\/ INCLUDED_PDAL_DRIVER_OCI_READER_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include \"parser\/xmlParser.hpp\"\n\n\/\/ Too many false-positives involving default parameters in library functions\n#pragma GCC diagnostic ignored \"-Wzero-as-null-pointer-constant\"\n\nXMLParser::XMLParser() {}\n\nXMLParser& XMLParser::parse(char* str) {\n  rapidxml::xml_document<char> doc;\n  try {\n    doc.parse<0>(str);\n  } catch (rapidxml::parse_error& pe) {\n    throw XMLParseError(\"XML parsing failed\", {\n      METADATA_PAIRS,\n      {\"xml error\", pe.what()},\n      {\"position\", std::to_string(*pe.where<int>())}\n    });\n  }\n  auto rootNode = Node<BlockNode>::dynPtrCast(parseXMLNode(doc.first_node()));\n  if (rootNode == nullptr) throw XMLParseError(\"Root node isn't a block node\", {\n    METADATA_PAIRS,\n    {\"tag name\", doc.first_node()->name()}\n  });\n  tree = std::make_unique<AST>(AST(rootNode));\n  return *this;\n}\n\nXMLParser& XMLParser::parse(rapidxml::file<char> xmlFile) {\n  parse(xmlFile.data());\n  return *this;\n}\n\nvoid XMLParser::parseChildren(rapidxml::xml_node<>* node, ASTNode::Link target) {\n  for (auto child = node->first_node(); child; child = child->next_sibling()) {\n    auto parsedChild = parseXMLNode(child);\n    target->addChild(parsedChild);\n  }\n}\n\nstatic Visibility fromString(std::string str) {\n  Visibility vis =\n    str == \"private\" ? PRIVATE :\n    str == \"protected\" ? PROTECTED :\n    str == \"public\" ? PUBLIC :\n      INVALID;\n  if (vis == INVALID) throw XMLParseError(\"Invalid visibility for member\", {\n    METADATA_PAIRS,\n    {\"invalid value\", str}\n  });\n  return vis;\n}\n\nASTNode::Link XMLParser::parseXMLNode(rapidxml::xml_node<>* node) {\n  auto safeAttr = [node](std::string what, std::string defaultValue = \"\") -> std::string {\n    auto attr = node->first_attribute(what.c_str());\n    if (attr != nullptr) return attr->value();\n    else return defaultValue;\n  };\n  auto requiredAttr = [node](std::string what) -> std::string {\n    auto attr = node->first_attribute(what.c_str());\n    if (attr != nullptr) return attr->value();\n    else throw XMLParseError(\"Can't find required attribute\", {\n      METADATA_PAIRS,\n      {\"missing attribute\", what}\n    });\n  };\n  auto funArgs = [node, &safeAttr]() -> FunctionSignature::Arguments {\n    FunctionSignature::Arguments args {};\n    std::vector<std::string> stringArgs = split(safeAttr(\"args\"), ',');\n    for (auto& arg : stringArgs) {\n      std::vector<std::string> namePlusTypes = split(arg, ':');\n      std::vector<std::string> types = split(namePlusTypes[1], ' ');\n      args.push_back(std::make_pair(namePlusTypes[0], TypeList(ALL(types))));\n    }\n    return args;\n  };\n  auto funRet = [node, &safeAttr]() -> TypeInfo {\n    std::vector<std::string> returnTypes = split(safeAttr(\"return\"), ' ');\n    return returnTypes.size() == 0 ? nullptr : TypeInfo(TypeList(ALL(returnTypes)));\n  };\n  auto funBlock = [=](Node<FunctionNode>::Link f) {\n    if (!f->isForeign()) {\n      auto codeBlock = node->first_node(\"block\");\n      if (codeBlock == nullptr) throw XMLParseError(\"Method missing code block\", {METADATA_PAIRS});\n      f->setCode(Node<BlockNode>::staticPtrCast(parseXMLNode(codeBlock)));\n    }\n  };\n  auto getVisibility = [node, &safeAttr]() -> Visibility {\n    return fromString(safeAttr(\"visibility\", \"private\"));\n  };\n  auto boolAttr = [node, &safeAttr](std::string what) -> bool {\n    return safeAttr(what, \"false\") == \"true\";\n  };\n\n  if (node == nullptr) throw XMLParseError(\"Null node\", {METADATA_PAIRS});\n  std::string name = node->name();\n  if (name == \"block\") {\n    std::string type = safeAttr(\"type\", \"code\");\n    BlockType bt =\n      type == \"root\" ? ROOT_BLOCK :\n      type == \"if\" ? IF_BLOCK :\n      type == \"function\" ? FUNCTION_BLOCK : CODE_BLOCK;\n    auto block = Node<BlockNode>::make(bt);\n    parseChildren(node, block);\n    return block;\n  } else if (name == \"return\") {\n    auto retNode = Node<ReturnNode>::make();\n    auto val = node->first_node(\"expr\");\n    if (val != nullptr) retNode->setValue(Node<ExpressionNode>::dynPtrCast(parseXMLNode(val)));\n    return retNode;\n  } else if (name == \"expr\") {\n    TokenType tokenType = TT::findByPrettyName(requiredAttr(\"type\"));\n    std::string data = requiredAttr(\"value\");\n    std::unique_ptr<Token> content;\n    if (tokenType == TT::OPERATOR) {\n      content = std::make_unique<Token>(tokenType, Operator::find(data), defaultTrace);\n    } else {\n      content = std::make_unique<Token>(tokenType, data, defaultTrace);\n    }\n    auto expr = Node<ExpressionNode>::make(*content);\n    parseChildren(node, expr);\n    return expr;\n  } else if (name == \"decl\") {\n    Node<DeclarationNode>::Link decl;\n    std::string ident = requiredAttr(\"ident\");\n    bool isDynamic = boolAttr(\"dynamic\");\n    if (isDynamic) {\n      decl = Node<DeclarationNode>::make(ident, TypeList {});\n    } else {\n      std::string tlValue = requiredAttr(\"types\");\n      auto vec = split(tlValue, ' ');\n      decl = Node<DeclarationNode>::make(ident, TypeList(ALL(vec)));\n    }\n    auto expr = node->first_node(\"expr\");\n    if (expr != nullptr) {\n      decl->setInit(Node<ExpressionNode>::dynPtrCast(parseXMLNode(expr)));\n    }\n    return decl;\n  } else if (name == \"branch\") {\n    auto branch = Node<BranchNode>::make();\n    auto cond = node->first_node();\n    if (cond == nullptr) throw XMLParseError(\"Missing condition in branch\", {METADATA_PAIRS});\n    branch->setCondition(Node<ExpressionNode>::dynPtrCast(parseXMLNode(cond)));\n    auto success = cond->next_sibling();\n    if (success == nullptr) throw XMLParseError(\"Missing success node in branch\", {METADATA_PAIRS});\n    branch->setSuccessBlock(Node<BlockNode>::dynPtrCast(parseXMLNode(success)));\n    auto blockFailiure = success->next_sibling(\"block\");\n    if (blockFailiure != nullptr) {\n      branch->setFailiureBlock(Node<BlockNode>::dynPtrCast(parseXMLNode(blockFailiure)));\n    }\n    auto branchFailiure = success->next_sibling(\"branch\");\n    if (branchFailiure != nullptr) {\n      branch->setFailiureBlock(Node<BranchNode>::dynPtrCast(parseXMLNode(branchFailiure)));\n    }\n    return branch;\n  } else if (name == \"loop\") {\n    auto loop = Node<LoopNode>::make();\n    auto init = node->first_node(\"loop_init\");\n    if (init != nullptr) {\n      loop->setInit(Node<DeclarationNode>::dynPtrCast(parseXMLNode(init)));\n    }\n    auto cond = node->first_node(\"loop_condition\");\n    if (cond != nullptr) {\n      loop->setCondition(Node<ExpressionNode>::dynPtrCast(parseXMLNode(cond)));\n    }\n    auto update = node->first_node(\"loop_update\");\n    if (update != nullptr) {\n      loop->setUpdate(Node<ExpressionNode>::dynPtrCast(parseXMLNode(update)));\n    }\n    auto code = node->first_node(\"block\");\n    if (code != nullptr) {\n      loop->setCode(Node<BlockNode>::dynPtrCast(parseXMLNode(code)));\n    }\n    return loop;\n  } else if (name == \"loop_init\" || name == \"loop_condition\" || name == \"loop_update\") {\n    return parseXMLNode(node->first_node());\n  } else if (name == \"break\") {\n    return Node<BreakLoopNode>::make();\n  } else if (name == \"function\") {\n    std::string ident = safeAttr(\"ident\");\n    bool isForeign = boolAttr(\"foreign\");\n    auto n = Node<FunctionNode>::make(ident, FunctionSignature(funRet(), funArgs()), isForeign);\n    funBlock(n);\n    if (isForeign && ident.empty()) throw XMLParseError(\"Can't have anonymous foreign function\", {METADATA_PAIRS});\n    return n;\n  } else if (name == \"type\") {\n    std::string typeName = requiredAttr(\"name\");\n    std::vector<std::string> inheritTypes = split(safeAttr(\"inherits\"), ' ');\n    auto typeNode = Node<TypeNode>::make(typeName, TypeList(ALL(inheritTypes)));\n    parseChildren(node, typeNode);\n    return typeNode;\n  } else if (name == \"member\") {\n    std::string ident = requiredAttr(\"ident\");\n    std::vector<std::string> types = split(safeAttr(\"types\"), ' ');\n    auto member = Node<MemberNode>::make(ident, TypeList(ALL(types)), boolAttr(\"static\"), getVisibility());\n    auto init = node->first_node(\"expr\");\n    if (init != nullptr) {\n      member->setInit(Node<ExpressionNode>::staticPtrCast(parseXMLNode(init)));\n    }\n    return member;\n  } else if (name == \"method\") {\n    std::string ident = safeAttr(\"ident\");\n    bool isForeign = boolAttr(\"foreign\");\n    auto method = Node<MethodNode>::make(ident, FunctionSignature(funRet(), funArgs()), getVisibility(), boolAttr(\"static\"), isForeign);\n    funBlock(method);\n    if (isForeign && ident.empty()) throw XMLParseError(\"Can't have anonymous foreign method\", {METADATA_PAIRS});\n    return method;\n  } else if (name == \"constructor\") {\n    auto constructor = Node<ConstructorNode>::make(funArgs(), getVisibility());\n    funBlock(constructor);\n    return constructor;\n  }\n  throw XMLParseError(\"Unknown type of node\", {METADATA_PAIRS, {\"node name\", name}});\n}\n\nXMLParseError::XMLParseError(std::string msg, ErrorData data):\n  InternalError(\"XMLParseError\", msg, data) {}\n<commit_msg>Fix unknown pragma warning in clang<commit_after>#include \"parser\/xmlParser.hpp\"\n\n#ifndef __clang__\n#ifdef __GNUG__\n\/\/ Too many false-positives involving default parameters in library functions\n#pragma GCC diagnostic ignored \"-Wzero-as-null-pointer-constant\"\n#endif\n#endif\n\nXMLParser::XMLParser() {}\n\nXMLParser& XMLParser::parse(char* str) {\n  rapidxml::xml_document<char> doc;\n  try {\n    doc.parse<0>(str);\n  } catch (rapidxml::parse_error& pe) {\n    throw XMLParseError(\"XML parsing failed\", {\n      METADATA_PAIRS,\n      {\"xml error\", pe.what()},\n      {\"position\", std::to_string(*pe.where<int>())}\n    });\n  }\n  auto rootNode = Node<BlockNode>::dynPtrCast(parseXMLNode(doc.first_node()));\n  if (rootNode == nullptr) throw XMLParseError(\"Root node isn't a block node\", {\n    METADATA_PAIRS,\n    {\"tag name\", doc.first_node()->name()}\n  });\n  tree = std::make_unique<AST>(AST(rootNode));\n  return *this;\n}\n\nXMLParser& XMLParser::parse(rapidxml::file<char> xmlFile) {\n  parse(xmlFile.data());\n  return *this;\n}\n\nvoid XMLParser::parseChildren(rapidxml::xml_node<>* node, ASTNode::Link target) {\n  for (auto child = node->first_node(); child; child = child->next_sibling()) {\n    auto parsedChild = parseXMLNode(child);\n    target->addChild(parsedChild);\n  }\n}\n\nstatic Visibility fromString(std::string str) {\n  Visibility vis =\n    str == \"private\" ? PRIVATE :\n    str == \"protected\" ? PROTECTED :\n    str == \"public\" ? PUBLIC :\n      INVALID;\n  if (vis == INVALID) throw XMLParseError(\"Invalid visibility for member\", {\n    METADATA_PAIRS,\n    {\"invalid value\", str}\n  });\n  return vis;\n}\n\nASTNode::Link XMLParser::parseXMLNode(rapidxml::xml_node<>* node) {\n  auto safeAttr = [node](std::string what, std::string defaultValue = \"\") -> std::string {\n    auto attr = node->first_attribute(what.c_str());\n    if (attr != nullptr) return attr->value();\n    else return defaultValue;\n  };\n  auto requiredAttr = [node](std::string what) -> std::string {\n    auto attr = node->first_attribute(what.c_str());\n    if (attr != nullptr) return attr->value();\n    else throw XMLParseError(\"Can't find required attribute\", {\n      METADATA_PAIRS,\n      {\"missing attribute\", what}\n    });\n  };\n  auto funArgs = [node, &safeAttr]() -> FunctionSignature::Arguments {\n    FunctionSignature::Arguments args {};\n    std::vector<std::string> stringArgs = split(safeAttr(\"args\"), ',');\n    for (auto& arg : stringArgs) {\n      std::vector<std::string> namePlusTypes = split(arg, ':');\n      std::vector<std::string> types = split(namePlusTypes[1], ' ');\n      args.push_back(std::make_pair(namePlusTypes[0], TypeList(ALL(types))));\n    }\n    return args;\n  };\n  auto funRet = [node, &safeAttr]() -> TypeInfo {\n    std::vector<std::string> returnTypes = split(safeAttr(\"return\"), ' ');\n    return returnTypes.size() == 0 ? nullptr : TypeInfo(TypeList(ALL(returnTypes)));\n  };\n  auto funBlock = [=](Node<FunctionNode>::Link f) {\n    if (!f->isForeign()) {\n      auto codeBlock = node->first_node(\"block\");\n      if (codeBlock == nullptr) throw XMLParseError(\"Method missing code block\", {METADATA_PAIRS});\n      f->setCode(Node<BlockNode>::staticPtrCast(parseXMLNode(codeBlock)));\n    }\n  };\n  auto getVisibility = [node, &safeAttr]() -> Visibility {\n    return fromString(safeAttr(\"visibility\", \"private\"));\n  };\n  auto boolAttr = [node, &safeAttr](std::string what) -> bool {\n    return safeAttr(what, \"false\") == \"true\";\n  };\n\n  if (node == nullptr) throw XMLParseError(\"Null node\", {METADATA_PAIRS});\n  std::string name = node->name();\n  if (name == \"block\") {\n    std::string type = safeAttr(\"type\", \"code\");\n    BlockType bt =\n      type == \"root\" ? ROOT_BLOCK :\n      type == \"if\" ? IF_BLOCK :\n      type == \"function\" ? FUNCTION_BLOCK : CODE_BLOCK;\n    auto block = Node<BlockNode>::make(bt);\n    parseChildren(node, block);\n    return block;\n  } else if (name == \"return\") {\n    auto retNode = Node<ReturnNode>::make();\n    auto val = node->first_node(\"expr\");\n    if (val != nullptr) retNode->setValue(Node<ExpressionNode>::dynPtrCast(parseXMLNode(val)));\n    return retNode;\n  } else if (name == \"expr\") {\n    TokenType tokenType = TT::findByPrettyName(requiredAttr(\"type\"));\n    std::string data = requiredAttr(\"value\");\n    std::unique_ptr<Token> content;\n    if (tokenType == TT::OPERATOR) {\n      content = std::make_unique<Token>(tokenType, Operator::find(data), defaultTrace);\n    } else {\n      content = std::make_unique<Token>(tokenType, data, defaultTrace);\n    }\n    auto expr = Node<ExpressionNode>::make(*content);\n    parseChildren(node, expr);\n    return expr;\n  } else if (name == \"decl\") {\n    Node<DeclarationNode>::Link decl;\n    std::string ident = requiredAttr(\"ident\");\n    bool isDynamic = boolAttr(\"dynamic\");\n    if (isDynamic) {\n      decl = Node<DeclarationNode>::make(ident, TypeList {});\n    } else {\n      std::string tlValue = requiredAttr(\"types\");\n      auto vec = split(tlValue, ' ');\n      decl = Node<DeclarationNode>::make(ident, TypeList(ALL(vec)));\n    }\n    auto expr = node->first_node(\"expr\");\n    if (expr != nullptr) {\n      decl->setInit(Node<ExpressionNode>::dynPtrCast(parseXMLNode(expr)));\n    }\n    return decl;\n  } else if (name == \"branch\") {\n    auto branch = Node<BranchNode>::make();\n    auto cond = node->first_node();\n    if (cond == nullptr) throw XMLParseError(\"Missing condition in branch\", {METADATA_PAIRS});\n    branch->setCondition(Node<ExpressionNode>::dynPtrCast(parseXMLNode(cond)));\n    auto success = cond->next_sibling();\n    if (success == nullptr) throw XMLParseError(\"Missing success node in branch\", {METADATA_PAIRS});\n    branch->setSuccessBlock(Node<BlockNode>::dynPtrCast(parseXMLNode(success)));\n    auto blockFailiure = success->next_sibling(\"block\");\n    if (blockFailiure != nullptr) {\n      branch->setFailiureBlock(Node<BlockNode>::dynPtrCast(parseXMLNode(blockFailiure)));\n    }\n    auto branchFailiure = success->next_sibling(\"branch\");\n    if (branchFailiure != nullptr) {\n      branch->setFailiureBlock(Node<BranchNode>::dynPtrCast(parseXMLNode(branchFailiure)));\n    }\n    return branch;\n  } else if (name == \"loop\") {\n    auto loop = Node<LoopNode>::make();\n    auto init = node->first_node(\"loop_init\");\n    if (init != nullptr) {\n      loop->setInit(Node<DeclarationNode>::dynPtrCast(parseXMLNode(init)));\n    }\n    auto cond = node->first_node(\"loop_condition\");\n    if (cond != nullptr) {\n      loop->setCondition(Node<ExpressionNode>::dynPtrCast(parseXMLNode(cond)));\n    }\n    auto update = node->first_node(\"loop_update\");\n    if (update != nullptr) {\n      loop->setUpdate(Node<ExpressionNode>::dynPtrCast(parseXMLNode(update)));\n    }\n    auto code = node->first_node(\"block\");\n    if (code != nullptr) {\n      loop->setCode(Node<BlockNode>::dynPtrCast(parseXMLNode(code)));\n    }\n    return loop;\n  } else if (name == \"loop_init\" || name == \"loop_condition\" || name == \"loop_update\") {\n    return parseXMLNode(node->first_node());\n  } else if (name == \"break\") {\n    return Node<BreakLoopNode>::make();\n  } else if (name == \"function\") {\n    std::string ident = safeAttr(\"ident\");\n    bool isForeign = boolAttr(\"foreign\");\n    auto n = Node<FunctionNode>::make(ident, FunctionSignature(funRet(), funArgs()), isForeign);\n    funBlock(n);\n    if (isForeign && ident.empty()) throw XMLParseError(\"Can't have anonymous foreign function\", {METADATA_PAIRS});\n    return n;\n  } else if (name == \"type\") {\n    std::string typeName = requiredAttr(\"name\");\n    std::vector<std::string> inheritTypes = split(safeAttr(\"inherits\"), ' ');\n    auto typeNode = Node<TypeNode>::make(typeName, TypeList(ALL(inheritTypes)));\n    parseChildren(node, typeNode);\n    return typeNode;\n  } else if (name == \"member\") {\n    std::string ident = requiredAttr(\"ident\");\n    std::vector<std::string> types = split(safeAttr(\"types\"), ' ');\n    auto member = Node<MemberNode>::make(ident, TypeList(ALL(types)), boolAttr(\"static\"), getVisibility());\n    auto init = node->first_node(\"expr\");\n    if (init != nullptr) {\n      member->setInit(Node<ExpressionNode>::staticPtrCast(parseXMLNode(init)));\n    }\n    return member;\n  } else if (name == \"method\") {\n    std::string ident = safeAttr(\"ident\");\n    bool isForeign = boolAttr(\"foreign\");\n    auto method = Node<MethodNode>::make(ident, FunctionSignature(funRet(), funArgs()), getVisibility(), boolAttr(\"static\"), isForeign);\n    funBlock(method);\n    if (isForeign && ident.empty()) throw XMLParseError(\"Can't have anonymous foreign method\", {METADATA_PAIRS});\n    return method;\n  } else if (name == \"constructor\") {\n    auto constructor = Node<ConstructorNode>::make(funArgs(), getVisibility());\n    funBlock(constructor);\n    return constructor;\n  }\n  throw XMLParseError(\"Unknown type of node\", {METADATA_PAIRS, {\"node name\", name}});\n}\n\nXMLParseError::XMLParseError(std::string msg, ErrorData data):\n  InternalError(\"XMLParseError\", msg, data) {}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkRenderWindowInteractor.hh\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1995 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\/\/ .NAME vtkRenderWindowInteractor - provide event driven interface to rendering window\n\/\/ .SECTION Description\n\n\/\/ vtkRenderWindowInteractor is a convenience object that provides event\n\/\/ bindings to common graphics functions. For example, camera\n\/\/ zoom-in\/zoom-out, pan, rotate, resetting; picking of actors, points,\n\/\/ or cells; switching in\/out of stereo mode; property changes such as\n\/\/ wireframe and surface; and a toggle to force the light to be placed at\n\/\/ camera viewpoint (pointing in view direction).\n\n\/\/ .SECTION Event Bindings\n\/\/ Specific devices have different camera bindings. The bindings are on both\n\/\/ mouse events as well as keyboard presses. See vtkXInteractor and \n\/\/ vtkWin32Interactor for specific information.\n\n\/\/ .SECTION see also\n\/\/ vtkXRenderWindowInteractor vtkPicker\n\n#ifndef __vtkRenderWindowInteractor_h\n#define __vtkRenderWindowInteractor_h\n\n#include \"vtkRenderWindow.hh\"\n#include \"vtkCamera.hh\"\n#include \"vtkLight.hh\"\n#include \"vtkPicker.hh\"\n#include \"vtkPolyMapper.hh\"\n#include \"vtkOutlineSource.hh\"\n\nclass vtkRenderWindowInteractor : public vtkObject\n{\npublic:\n  vtkRenderWindowInteractor();\n  ~vtkRenderWindowInteractor();\n  char *GetClassName() {return \"vtkRenderWindowInteractor\";};\n  void PrintSelf(ostream& os, vtkIndent indent);\n\n  virtual void Initialize() = 0;\n  virtual void Start() = 0;\n\n  \/\/ Description:\n  \/\/ Set\/Get the rendering window being controlled by this object.\n  vtkSetObjectMacro(RenderWindow,vtkRenderWindow);\n  vtkGetObjectMacro(RenderWindow,vtkRenderWindow);\n\n  \/\/ Description:\n  \/\/ Turn on\/off the automatic repositioning of lights as the camera moves.\n  vtkSetMacro(LightFollowCamera,int);\n  vtkGetMacro(LightFollowCamera,int);\n  vtkBooleanMacro(LightFollowCamera,int);\n\n  \/\/ Description:\n  \/\/ Set\/Get the desired update rate. This is use dby vtkLODActors to tell \n  \/\/ them how quickly they need to render.  This update is in effect only\n  \/\/ when the camera is being rotated, or zoomed.  When the interactor is\n  \/\/ still the StillUpdateRate is used instead. A value of zero indicates\n  \/\/ that the update rate is unimportant. (i.e. take as long as you want)\n  vtkSetMacro(DesiredUpdateRate,float);\n  vtkGetMacro(DesiredUpdateRate,float);\n\n  \/\/ Description:\n  \/\/ Set\/Get the desired update rate when movement has stopped.\n  \/\/ See the SetDesiredUpdateRate method. \n  vtkSetMacro(StillUpdateRate,float);\n  vtkGetMacro(StillUpdateRate,float);\n\n  \/\/ Description:\n  \/\/ See whether interactor has been initialized yet.\n  vtkGetMacro(Initialized,int);\n\n  \/\/ Description:\n  \/\/ When an event occurs we must determine which Renderer the event\n  \/\/ occured within since one RenderWindow may contain multiple \n  \/\/ renderers. We also need to know what camera to operate on.\n  \/\/ This is just the ActiveCamera of the poked renderer. \n  void FindPokedCamera(int,int);\n  void FindPokedRenderer(int,int);\n\n  virtual void HighlightActor(vtkActor *actor);\n\n  void SetStartPickMethod(void (*f)(void *), void *arg);\n  void SetStartPickMethodArgDelete(void (*f)(void *));\n  void SetEndPickMethod(void (*f)(void *), void *arg);\n  void SetEndPickMethodArgDelete(void (*f)(void *));\n\n  void SetPicker(vtkPicker *picker);\n  void SetPicker(vtkPicker& picker) {this->SetPicker(&picker);};\n\n  \/\/ Description:\n  \/\/ Get the object used to perform pick operations.\n  vtkGetObjectMacro(Picker,vtkPicker);\n\n  \/\/ Description:\n  \/\/ Create default picker. Used to create one when none is specified.\n  virtual vtkPicker *CreateDefaultPicker();\n\n  void SetUserMethod(void (*f)(void *), void *arg);\n  void SetUserMethodArgDelete(void (*f)(void *));\n\nprotected:\n  vtkRenderWindow *RenderWindow;\n  vtkCamera   *CurrentCamera;\n  vtkLight    *CurrentLight;\n  vtkRenderer *CurrentRenderer;\n  int   LightFollowCamera;\n  float Center[2];\n  float DeltaAzimuth;\n  float DeltaElevation;\n  int   Size[2];\n  int   State;\n  float FocalDepth;\n  int   Initialized;\n  float DesiredUpdateRate;\n  float StillUpdateRate;\n\n  \/\/ for picking actors\n  vtkPicker *Picker;\n  int SelfCreatedPicker;\n  vtkOutlineSource Outline;\n  vtkPolyMapper OutlineMapper;\n  vtkActor *OutlineActor;\n  vtkRenderer *PickedRenderer;\n  vtkActor *CurrentActor;\n\n  \/\/ methods called prior to and after picking\n  void (*StartPickMethod)(void *);\n  void (*StartPickMethodArgDelete)(void *);\n  void *StartPickMethodArg;\n  void (*EndPickMethod)(void *);\n  void (*EndPickMethodArgDelete)(void *);\n  void *EndPickMethodArg;\n  void (*UserMethod)(void *);\n  void (*UserMethodArgDelete)(void *);\n  void *UserMethodArg;\n\n};\n\n#endif\n<commit_msg>*** empty log message ***<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkRenderWindowInteractor.hh\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1995 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\/\/ .NAME vtkRenderWindowInteractor - provide event driven interface to rendering window\n\/\/ .SECTION Description\n\n\/\/ vtkRenderWindowInteractor is a convenience object that provides event\n\/\/ bindings to common graphics functions. For example, camera\n\/\/ zoom-in\/zoom-out, pan, rotate, resetting; picking of actors, points,\n\/\/ or cells; switching in\/out of stereo mode; property changes such as\n\/\/ wireframe and surface; and a toggle to force the light to be placed at\n\/\/ camera viewpoint (pointing in view direction).\n\n\/\/ .SECTION Event Bindings\n\/\/ Specific devices have different camera bindings. The bindings are on both\n\/\/ mouse events as well as keyboard presses. See vtkXRenderWindowInteractor and \n\/\/ vtkWin32RenderWindowInteractor for specific information.\n\n\/\/ .SECTION see also\n\/\/ vtkXRenderWindowInteractor vtkWinRenderWindowInteractor vtkPicker\n\n#ifndef __vtkRenderWindowInteractor_h\n#define __vtkRenderWindowInteractor_h\n\n#include \"vtkRenderWindow.hh\"\n#include \"vtkCamera.hh\"\n#include \"vtkLight.hh\"\n#include \"vtkPicker.hh\"\n#include \"vtkPolyMapper.hh\"\n#include \"vtkOutlineSource.hh\"\n\nclass vtkRenderWindowInteractor : public vtkObject\n{\npublic:\n  vtkRenderWindowInteractor();\n  ~vtkRenderWindowInteractor();\n  char *GetClassName() {return \"vtkRenderWindowInteractor\";};\n  void PrintSelf(ostream& os, vtkIndent indent);\n\n  virtual void Initialize() = 0;\n  virtual void Start() = 0;\n\n  \/\/ Description:\n  \/\/ Set\/Get the rendering window being controlled by this object.\n  vtkSetObjectMacro(RenderWindow,vtkRenderWindow);\n  vtkGetObjectMacro(RenderWindow,vtkRenderWindow);\n\n  \/\/ Description:\n  \/\/ Turn on\/off the automatic repositioning of lights as the camera moves.\n  vtkSetMacro(LightFollowCamera,int);\n  vtkGetMacro(LightFollowCamera,int);\n  vtkBooleanMacro(LightFollowCamera,int);\n\n  \/\/ Description:\n  \/\/ Set\/Get the desired update rate. This is use dby vtkLODActors to tell \n  \/\/ them how quickly they need to render.  This update is in effect only\n  \/\/ when the camera is being rotated, or zoomed.  When the interactor is\n  \/\/ still the StillUpdateRate is used instead. A value of zero indicates\n  \/\/ that the update rate is unimportant. (i.e. take as long as you want)\n  vtkSetMacro(DesiredUpdateRate,float);\n  vtkGetMacro(DesiredUpdateRate,float);\n\n  \/\/ Description:\n  \/\/ Set\/Get the desired update rate when movement has stopped.\n  \/\/ See the SetDesiredUpdateRate method. \n  vtkSetMacro(StillUpdateRate,float);\n  vtkGetMacro(StillUpdateRate,float);\n\n  \/\/ Description:\n  \/\/ See whether interactor has been initialized yet.\n  vtkGetMacro(Initialized,int);\n\n  \/\/ Description:\n  \/\/ When an event occurs we must determine which Renderer the event\n  \/\/ occured within since one RenderWindow may contain multiple \n  \/\/ renderers. We also need to know what camera to operate on.\n  \/\/ This is just the ActiveCamera of the poked renderer. \n  void FindPokedCamera(int,int);\n  void FindPokedRenderer(int,int);\n\n  virtual void HighlightActor(vtkActor *actor);\n\n  void SetStartPickMethod(void (*f)(void *), void *arg);\n  void SetStartPickMethodArgDelete(void (*f)(void *));\n  void SetEndPickMethod(void (*f)(void *), void *arg);\n  void SetEndPickMethodArgDelete(void (*f)(void *));\n\n  void SetPicker(vtkPicker *picker);\n  void SetPicker(vtkPicker& picker) {this->SetPicker(&picker);};\n\n  \/\/ Description:\n  \/\/ Get the object used to perform pick operations.\n  vtkGetObjectMacro(Picker,vtkPicker);\n\n  \/\/ Description:\n  \/\/ Create default picker. Used to create one when none is specified.\n  virtual vtkPicker *CreateDefaultPicker();\n\n  void SetUserMethod(void (*f)(void *), void *arg);\n  void SetUserMethodArgDelete(void (*f)(void *));\n\nprotected:\n  vtkRenderWindow *RenderWindow;\n  vtkCamera   *CurrentCamera;\n  vtkLight    *CurrentLight;\n  vtkRenderer *CurrentRenderer;\n  int   LightFollowCamera;\n  float Center[2];\n  float DeltaAzimuth;\n  float DeltaElevation;\n  int   Size[2];\n  int   State;\n  float FocalDepth;\n  int   Initialized;\n  float DesiredUpdateRate;\n  float StillUpdateRate;\n\n  \/\/ for picking actors\n  vtkPicker *Picker;\n  int SelfCreatedPicker;\n  vtkOutlineSource Outline;\n  vtkPolyMapper OutlineMapper;\n  vtkActor *OutlineActor;\n  vtkRenderer *PickedRenderer;\n  vtkActor *CurrentActor;\n\n  \/\/ methods called prior to and after picking\n  void (*StartPickMethod)(void *);\n  void (*StartPickMethodArgDelete)(void *);\n  void *StartPickMethodArg;\n  void (*EndPickMethod)(void *);\n  void (*EndPickMethodArgDelete)(void *);\n  void *EndPickMethodArg;\n  void (*UserMethod)(void *);\n  void (*UserMethodArgDelete)(void *);\n  void *UserMethodArg;\n\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2016-2017 William W. Fisher (at gmail dot com)\n\/\/ This file is distributed under the MIT License.\n\n#include \"ofp\/demux\/pktsource.h\"\n#include <sstream>\n#include \"ofp\/bytelist.h\"\n#include \"ofp\/log.h\"\n\nusing namespace ofp;\nusing namespace ofp::demux;\n\nOFP_BEGIN_IGNORE_PADDING\n\nstruct sHandlerInfo {\n  PktSource::PktCallback callback;\n  void *context;\n  UInt32 nanosec_factor;\n  UInt32 alignPad;\n  UInt32 frameSkip;\n  UInt32 packetCount;\n  ByteList buffer;\n};\n\nOFP_END_IGNORE_PADDING\n\nstatic void sHandler(u_char *user, const struct pcap_pkthdr *hdr,\n                     const u_char *data) {\n  sHandlerInfo *info = reinterpret_cast<sHandlerInfo *>(user);\n  ByteList &buf = info->buffer;\n  Timestamp ts(Unsigned_cast(hdr->ts.tv_sec),\n               Unsigned_cast(hdr->ts.tv_usec) * info->nanosec_factor);\n\n  const UInt32 alignPad = info->alignPad;\n  const UInt32 frameSkip = info->frameSkip;\n\n  if (frameSkip > hdr->caplen) {\n    log_debug(\"PktSource: caplen less than frameSkip!\");\n    return;\n  }\n\n  const u_char *cap = data + frameSkip;\n  const size_t caplen = hdr->caplen - frameSkip;\n\n  buf.replace(buf.data() + alignPad, buf.end(), cap, caplen);\n  ByteRange pkt{buf.data() + alignPad, buf.size() - alignPad};\n  info->callback(ts, pkt, hdr->len, info->context);\n  ++info->packetCount;\n}\n\nstd::string PktSource::datalink() const {\n  if (datalink_ < 0) {\n    return \"<not open>\";\n  }\n\n  const char *name = pcap_datalink_val_to_name(datalink_);\n  if (name == nullptr) {\n    return \"<null\/error>\";\n  }\n\n  return name;\n}\n\n\/\/\/ \\brief Open capture device to read live packets from the network.\n\/\/\/\n\/\/\/ \\param device name of capture interface\/device\n\/\/\/ \\param filter bpf-filter expression\n\/\/\/\n\/\/\/ \\returns true if device is ready to use\nbool PktSource::openDevice(const std::string &device,\n                           const std::string &filter) {\n  if (!isPcapVersionSupported())\n    return false;\n\n  if (pcap_)\n    close();\n\n  if (!create(device)) {\n    close();\n    return false;\n  }\n\n  if (!activate(device)) {\n    close();\n    return false;\n  }\n\n  if (!checkDatalink()) {\n    close();\n    return false;\n  }\n\n  if (!setFilter(filter)) {\n    close();\n    return false;\n  }\n\n  return true;\n}\n\n\/\/\/ \\brief Open capture file to read packets offline.\nbool PktSource::openFile(const std::string &file, const std::string &filter) {\n  if (!isPcapVersionSupported())\n    return false;\n\n  if (pcap_)\n    close();\n\n  if (!openOffline(file)) {\n    return false;\n  }\n\n  \/\/ Verify we support this datalink type.\n  if (!checkDatalink()) {\n    close();\n    return false;\n  }\n\n  \/\/ Set the appropriate bpf filter.\n  if (!setFilter(filter)) {\n    close();\n    return false;\n  }\n\n  log_debug(\"PktSource::openFile\", file, \"filter\", filter);\n\n  return true;\n}\n\n\/\/\/ \\brief Close the pcap_t object, if it's open.\n\/\/\/\n\/\/\/ Do nothing if it's already closed.\nvoid PktSource::close() {\n  if (pcap_) {\n    pcap_close(pcap_);\n    pcap_ = nullptr;\n    encap_ = ENCAP_UNSUPPORTED;\n    datalink_ = -1;\n  }\n}\n\nbool PktSource::runLoop(PktCallback callback, void *context) {\n  assert(pcap_);\n\n  log_debug(\"PktSource::runLoop entered\");\n\n  int kAllPackets = -1;\n\n  sHandlerInfo info;\n  info.callback = callback;\n  info.context = context;\n  info.nanosec_factor = nanosec_factor_;\n  info.alignPad = (encapsulation() == ENCAP_ETHERNET) ? 2 : 0;\n  info.frameSkip = frameSkip_;\n  info.packetCount = packetCount_;\n  info.buffer.addZeros(info.alignPad);\n\n  int result = pcap_loop(pcap_, kAllPackets, sHandler, MutableBytePtr(&info));\n  if (result != 0) {\n    log_debug(\"pcap_loop returned\", result);\n  }\n\n  packetCount_ = info.packetCount;\n\n  log_debug(\"PktSource::runLoop exited\");\n\n  return result == 0;\n}\n\nbool PktSource::create(const std::string &device) {\n  assert(pcap_ == nullptr);\n\n  char errbuf[PCAP_ERRBUF_SIZE];\n  pcap_ = pcap_create(device.c_str(), errbuf);\n  if (!pcap_) {\n    setError(\"pcap_create\", device, errbuf);\n    return false;\n  }\n\n  int result = pcap_set_snaplen(pcap_, DEFAULT_SNAPLEN);\n  if (result) {\n    setError(\"pcap_set_snaplen\", device, \"failed\");\n    return false;\n  }\n\n  result = pcap_set_promisc(pcap_, DEFAULT_PROMISC);\n  if (result) {\n    setError(\"pcap_set_promisc\", device, \"failed\");\n    return false;\n  }\n\n  result = pcap_set_timeout(pcap_, DEFAULT_TIMEOUT);\n  if (result) {\n    setError(\"pcap_set_timeout failed\", device, \"failed\");\n    return false;\n  }\n\n  result = pcap_set_buffer_size(pcap_, DEFAULT_BUFFER_SIZE);\n  if (result) {\n    setError(\"pcap_set_buffer_size\", device, \"failed\");\n    return false;\n  }\n\n  return true;\n}\n\nbool PktSource::openOffline(const std::string &path) {\n  char errbuf[PCAP_ERRBUF_SIZE];\n\n#if HAVE_PCAP_OPEN_OFFLINE_WITH_TSTAMP_PRECISION\n  \/\/ Use the newer `pcap_open_offline_with_tstamp_precision` API if it is\n  \/\/ available, since it provides access to nanosecond precision timestamps.\n  pcap_ = pcap_open_offline_with_tstamp_precision(\n      path.c_str(), PCAP_TSTAMP_PRECISION_NANO, errbuf);\n  \/\/ pcap library will convert to nanoseconds for us.\n  nanosec_factor_ = 1;\n#else   \/\/ !HAVE_PCAP_OPEN_OFFLINE_WITH_TSTAMP_PRECISION\n  \/\/ Use the original `pcap_open_offline` API if the newer API is not available.\n  pcap_ = pcap_open_offline(path.c_str(), errbuf);\n  \/\/ Convert microseconds to nanoseconds.\n  nanosec_factor_ = 1000;\n#endif  \/\/ !HAVE_PCAP_OPEN_OFFLINE_WITH_TSTAMP_PRECISION\n\n  if (!pcap_) {\n    \/\/ Set the error string directly; the pcap error message includes the\n    \/\/ file name.\n    error_ = errbuf;\n    return false;\n  }\n\n  return true;\n}\n\n\/\/\/ \\brief Inspect data link type to determine encapsulation.\n\/\/\/\n\/\/\/ \\return false if the data link type is not supported\nbool PktSource::checkDatalink() {\n  assert(pcap_);\n\n  datalink_ = pcap_datalink(pcap_);\n  if (datalink_ < 0) {\n    setError(\"pcap_datalink\", \"\", \"\");\n    return false;\n  }\n\n  encap_ = lookupEncapsulation(datalink_, &frameSkip_);\n\n  return encap_ != ENCAP_UNSUPPORTED;\n}\n\nbool PktSource::setFilter(const std::string &filter) {\n  assert(pcap_);\n\n  std::string fullFilter;\n  bool supportsVlan = encapsulation() == ENCAP_ETHERNET;\n\n  if (filter.empty()) {\n    \/\/ If filter is empty, capture everything.\n    fullFilter = \"\";\n  } else if (supportsVlan) {\n    \/\/ If the datalink supports 802.1q vlans, combine our filter with the\n    \/\/ magic 'vlan' option.\n    std::ostringstream oss;\n    oss << \"(\" << filter << \") or (vlan and (\" << filter << \"))\";\n    fullFilter = oss.str();\n  } else {\n    \/\/ Use the filter \"as is\".\n    fullFilter = filter;\n  }\n\n  struct bpf_program prog;\n  int result =\n      pcap_compile(pcap_, &prog, fullFilter.c_str(), 1, PCAP_NETMASK_UNKNOWN);\n  if (result < 0) {\n    setError(\"pcap_compile\", fullFilter, pcap_geterr(pcap_));\n    return false;\n  }\n\n  result = pcap_setfilter(pcap_, &prog);\n  if (result < 0) {\n    setError(\"pcap_setfilter\", fullFilter, pcap_geterr(pcap_));\n  }\n\n  pcap_freecode(&prog);\n\n  return (result == 0);\n}\n\nbool PktSource::activate(const std::string &device) {\n  int result = pcap_activate(pcap_);\n  if (result == 0) {\n    return true;\n  }\n\n  const char *errMsg = \"Unknown error\";\n\n  switch (result) {\n    \/\/ Warnings log a message and allow activate to continue.\n    case PCAP_WARNING_PROMISC_NOTSUP:\n      log_warning(\"pcap_activate:\", device,\n                  \"does not support promiscuous mode --\", pcap_geterr(pcap_));\n      return true;\n#if defined(PCAP_WARNING_TSTAMP_TYPE_NOTSUP)\n    case PCAP_WARNING_TSTAMP_TYPE_NOTSUP:\n      log_warning(\n          \"pcap_activate: Capture source does not support timestamp type\");\n      return true;\n#endif  \/\/ defined(PCAP_WARNING_TSTAMP_TYPE_NOTSUP)\n    case PCAP_WARNING:\n      log_warning(\"pcap_activate: PCAP_WARNING:\", pcap_geterr(pcap_));\n      return true;\n\n    \/\/ Errors set the error message and return false. Log pcap_geterr to the\n    \/\/ log.\n    case PCAP_ERROR_NO_SUCH_DEVICE:\n      errMsg = \"No such device\";\n      break;\n    case PCAP_ERROR_ACTIVATED:\n      errMsg = \"Handle already activated\";\n      break;\n    case PCAP_ERROR_PERM_DENIED:\n      errMsg = \"Permission denied to open capture source\";\n      break;\n#if defined(PCAP_ERROR_PROMISC_PERM_DENIED)\n    case PCAP_ERROR_PROMISC_PERM_DENIED:\n      errMsg = \"Permission denied to put capture source into promiscuous mode\";\n      break;\n#endif  \/\/ defined(PCAP_ERROR_PROMISC_PERM_DENIED)\n    case PCAP_ERROR_RFMON_NOTSUP:\n      errMsg = \"Capture source does not support monitor mode\";\n      break;\n    case PCAP_ERROR_IFACE_NOT_UP:\n      errMsg = \"Capture source is not up\";\n      break;\n    case PCAP_ERROR:\n    default:\n      errMsg = pcap_geterr(pcap_);\n      break;\n  }\n\n  setError(\"pcap_activate\", device, errMsg);\n  log_error(\"pcap_activate:\", errMsg, \"--\", pcap_geterr(pcap_));\n\n  return false;\n}\n\nvoid PktSource::setError(const char *func, const std::string &arg,\n                         const char *result) {\n  std::ostringstream oss;\n  oss << func << \"(\" << arg << \"): \" << result;\n  error_ = oss.str();\n}\n\nstruct DatalinkInfo {\n  int dlType;\n  PktSource::Encapsulation encap;\n  UInt32 frameSkip;\n\n  bool operator==(int type) const { return dlType == type; }\n};\n\nstatic const DatalinkInfo sDatalinkInfo[] = {\n    {DLT_NULL, PktSource::ENCAP_IP, 4},\n    {DLT_EN10MB, PktSource::ENCAP_ETHERNET, 0},\n    {DLT_RAW, PktSource::ENCAP_IP, 0},\n    \/\/ TODO(bfish):\n    \/\/{ DLT_LINUX_SLL, PktSource::ENCAP_ETHERNET },\n    \/\/{ DLT_LOOP  , PktSource::ENCAP_IP }\n};\n\nPktSource::Encapsulation PktSource::lookupEncapsulation(int datalink,\n                                                        UInt32 *frameSkip) {\n  auto iter =\n      std::find(std::begin(sDatalinkInfo), std::end(sDatalinkInfo), datalink);\n  if (iter != std::end(sDatalinkInfo)) {\n    *frameSkip = iter->frameSkip;\n    return iter->encap;\n  }\n  return ENCAP_UNSUPPORTED;\n}\n\n\/\/\/ Return true if we support this version of libpcap (1.1 or newer). Set error_\n\/\/\/ if not. We use version 1.1 for support for Ubuntu Precise.\nbool PktSource::isPcapVersionSupported() {\n  const char *vers = pcap_lib_version();\n  log::fatal_if_null(vers, \"pcap_lib_version\");\n\n  const unsigned int LIB_MAJOR = 1;\n  const unsigned int LIB_MINOR = 1;\n\n  unsigned int major = 0;\n  unsigned int minor = 0;\n  unsigned int patch = 0;\n\n  if (std::sscanf(vers, \"libpcap version %u.%u.%u\", &major, &minor, &patch) <\n      2) {\n    setError(\"pcap_lib_version\", \"\", vers);\n    return false;\n  }\n\n  if (major > LIB_MAJOR || (major == LIB_MAJOR && minor >= LIB_MINOR)) {\n    return true;\n  }\n\n  error_ = \"Unsupported: \";\n  error_ += vers;\n\n  return false;\n}\n\n\/\/\/ Get list of all devices available for packet capture.\nbool PktSource::getDeviceList(std::string *result) {\n  result->clear();\n\n  pcap_if_t *devs = nullptr;\n  char errbuf[PCAP_ERRBUF_SIZE];\n\n  if (pcap_findalldevs(&devs, errbuf) < 0) {\n    assert(devs == nullptr);\n    error_ = errbuf;\n    return false;\n  }\n\n  \/\/ devs may still be null if empty.\n  if (devs) {\n    std::ostringstream oss;\n    for (pcap_if_t *dev = devs; dev; dev = dev->next) {\n      oss << \"  \" << dev->name;\n      if (dev->description) {\n        oss << \" (\" << dev->description << ')';\n      }\n      oss << '\\n';\n    }\n    *result = oss.str();\n\n    pcap_freealldevs(devs);\n  }\n\n  return true;\n}\n<commit_msg>Name the optimize argument.<commit_after>\/\/ Copyright (c) 2016-2017 William W. Fisher (at gmail dot com)\n\/\/ This file is distributed under the MIT License.\n\n#include \"ofp\/demux\/pktsource.h\"\n#include <sstream>\n#include \"ofp\/bytelist.h\"\n#include \"ofp\/log.h\"\n\nusing namespace ofp;\nusing namespace ofp::demux;\n\nOFP_BEGIN_IGNORE_PADDING\n\nstruct sHandlerInfo {\n  PktSource::PktCallback callback;\n  void *context;\n  UInt32 nanosec_factor;\n  UInt32 alignPad;\n  UInt32 frameSkip;\n  UInt32 packetCount;\n  ByteList buffer;\n};\n\nOFP_END_IGNORE_PADDING\n\nstatic void sHandler(u_char *user, const struct pcap_pkthdr *hdr,\n                     const u_char *data) {\n  sHandlerInfo *info = reinterpret_cast<sHandlerInfo *>(user);\n  ByteList &buf = info->buffer;\n  Timestamp ts(Unsigned_cast(hdr->ts.tv_sec),\n               Unsigned_cast(hdr->ts.tv_usec) * info->nanosec_factor);\n\n  const UInt32 alignPad = info->alignPad;\n  const UInt32 frameSkip = info->frameSkip;\n\n  if (frameSkip > hdr->caplen) {\n    log_debug(\"PktSource: caplen less than frameSkip!\");\n    return;\n  }\n\n  const u_char *cap = data + frameSkip;\n  const size_t caplen = hdr->caplen - frameSkip;\n\n  buf.replace(buf.data() + alignPad, buf.end(), cap, caplen);\n  ByteRange pkt{buf.data() + alignPad, buf.size() - alignPad};\n  info->callback(ts, pkt, hdr->len, info->context);\n  ++info->packetCount;\n}\n\nstd::string PktSource::datalink() const {\n  if (datalink_ < 0) {\n    return \"<not open>\";\n  }\n\n  const char *name = pcap_datalink_val_to_name(datalink_);\n  if (name == nullptr) {\n    return \"<null\/error>\";\n  }\n\n  return name;\n}\n\n\/\/\/ \\brief Open capture device to read live packets from the network.\n\/\/\/\n\/\/\/ \\param device name of capture interface\/device\n\/\/\/ \\param filter bpf-filter expression\n\/\/\/\n\/\/\/ \\returns true if device is ready to use\nbool PktSource::openDevice(const std::string &device,\n                           const std::string &filter) {\n  if (!isPcapVersionSupported())\n    return false;\n\n  if (pcap_)\n    close();\n\n  if (!create(device)) {\n    close();\n    return false;\n  }\n\n  if (!activate(device)) {\n    close();\n    return false;\n  }\n\n  if (!checkDatalink()) {\n    close();\n    return false;\n  }\n\n  if (!setFilter(filter)) {\n    close();\n    return false;\n  }\n\n  return true;\n}\n\n\/\/\/ \\brief Open capture file to read packets offline.\nbool PktSource::openFile(const std::string &file, const std::string &filter) {\n  if (!isPcapVersionSupported())\n    return false;\n\n  if (pcap_)\n    close();\n\n  if (!openOffline(file)) {\n    return false;\n  }\n\n  \/\/ Verify we support this datalink type.\n  if (!checkDatalink()) {\n    close();\n    return false;\n  }\n\n  \/\/ Set the appropriate bpf filter.\n  if (!setFilter(filter)) {\n    close();\n    return false;\n  }\n\n  log_debug(\"PktSource::openFile\", file, \"filter\", filter);\n\n  return true;\n}\n\n\/\/\/ \\brief Close the pcap_t object, if it's open.\n\/\/\/\n\/\/\/ Do nothing if it's already closed.\nvoid PktSource::close() {\n  if (pcap_) {\n    pcap_close(pcap_);\n    pcap_ = nullptr;\n    encap_ = ENCAP_UNSUPPORTED;\n    datalink_ = -1;\n  }\n}\n\nbool PktSource::runLoop(PktCallback callback, void *context) {\n  assert(pcap_);\n\n  log_debug(\"PktSource::runLoop entered\");\n\n  int kAllPackets = -1;\n\n  sHandlerInfo info;\n  info.callback = callback;\n  info.context = context;\n  info.nanosec_factor = nanosec_factor_;\n  info.alignPad = (encapsulation() == ENCAP_ETHERNET) ? 2 : 0;\n  info.frameSkip = frameSkip_;\n  info.packetCount = packetCount_;\n  info.buffer.addZeros(info.alignPad);\n\n  int result = pcap_loop(pcap_, kAllPackets, sHandler, MutableBytePtr(&info));\n  if (result != 0) {\n    log_debug(\"pcap_loop returned\", result);\n  }\n\n  packetCount_ = info.packetCount;\n\n  log_debug(\"PktSource::runLoop exited\");\n\n  return result == 0;\n}\n\nbool PktSource::create(const std::string &device) {\n  assert(pcap_ == nullptr);\n\n  char errbuf[PCAP_ERRBUF_SIZE];\n  pcap_ = pcap_create(device.c_str(), errbuf);\n  if (!pcap_) {\n    setError(\"pcap_create\", device, errbuf);\n    return false;\n  }\n\n  int result = pcap_set_snaplen(pcap_, DEFAULT_SNAPLEN);\n  if (result) {\n    setError(\"pcap_set_snaplen\", device, \"failed\");\n    return false;\n  }\n\n  result = pcap_set_promisc(pcap_, DEFAULT_PROMISC);\n  if (result) {\n    setError(\"pcap_set_promisc\", device, \"failed\");\n    return false;\n  }\n\n  result = pcap_set_timeout(pcap_, DEFAULT_TIMEOUT);\n  if (result) {\n    setError(\"pcap_set_timeout failed\", device, \"failed\");\n    return false;\n  }\n\n  result = pcap_set_buffer_size(pcap_, DEFAULT_BUFFER_SIZE);\n  if (result) {\n    setError(\"pcap_set_buffer_size\", device, \"failed\");\n    return false;\n  }\n\n  return true;\n}\n\nbool PktSource::openOffline(const std::string &path) {\n  char errbuf[PCAP_ERRBUF_SIZE];\n\n#if HAVE_PCAP_OPEN_OFFLINE_WITH_TSTAMP_PRECISION\n  \/\/ Use the newer `pcap_open_offline_with_tstamp_precision` API if it is\n  \/\/ available, since it provides access to nanosecond precision timestamps.\n  pcap_ = pcap_open_offline_with_tstamp_precision(\n      path.c_str(), PCAP_TSTAMP_PRECISION_NANO, errbuf);\n  \/\/ pcap library will convert to nanoseconds for us.\n  nanosec_factor_ = 1;\n#else   \/\/ !HAVE_PCAP_OPEN_OFFLINE_WITH_TSTAMP_PRECISION\n  \/\/ Use the original `pcap_open_offline` API if the newer API is not available.\n  pcap_ = pcap_open_offline(path.c_str(), errbuf);\n  \/\/ Convert microseconds to nanoseconds.\n  nanosec_factor_ = 1000;\n#endif  \/\/ !HAVE_PCAP_OPEN_OFFLINE_WITH_TSTAMP_PRECISION\n\n  if (!pcap_) {\n    \/\/ Set the error string directly; the pcap error message includes the\n    \/\/ file name.\n    error_ = errbuf;\n    return false;\n  }\n\n  return true;\n}\n\n\/\/\/ \\brief Inspect data link type to determine encapsulation.\n\/\/\/\n\/\/\/ \\return false if the data link type is not supported\nbool PktSource::checkDatalink() {\n  assert(pcap_);\n\n  datalink_ = pcap_datalink(pcap_);\n  if (datalink_ < 0) {\n    setError(\"pcap_datalink\", \"\", \"\");\n    return false;\n  }\n\n  encap_ = lookupEncapsulation(datalink_, &frameSkip_);\n\n  return encap_ != ENCAP_UNSUPPORTED;\n}\n\nbool PktSource::setFilter(const std::string &filter) {\n  assert(pcap_);\n\n  std::string fullFilter;\n  bool supportsVlan = encapsulation() == ENCAP_ETHERNET;\n\n  if (filter.empty()) {\n    \/\/ If filter is empty, capture everything.\n    fullFilter = \"\";\n  } else if (supportsVlan) {\n    \/\/ If the datalink supports 802.1q vlans, combine our filter with the\n    \/\/ magic 'vlan' option.\n    std::ostringstream oss;\n    oss << \"(\" << filter << \") or (vlan and (\" << filter << \"))\";\n    fullFilter = oss.str();\n  } else {\n    \/\/ Use the filter \"as is\".\n    fullFilter = filter;\n  }\n\n  const int kOptimize = 1;\n  struct bpf_program prog;\n  int result =\n      pcap_compile(pcap_, &prog, fullFilter.c_str(), kOptimize, PCAP_NETMASK_UNKNOWN);\n  if (result < 0) {\n    setError(\"pcap_compile\", fullFilter, pcap_geterr(pcap_));\n    return false;\n  }\n\n  result = pcap_setfilter(pcap_, &prog);\n  if (result < 0) {\n    setError(\"pcap_setfilter\", fullFilter, pcap_geterr(pcap_));\n  }\n\n  pcap_freecode(&prog);\n\n  return (result == 0);\n}\n\nbool PktSource::activate(const std::string &device) {\n  int result = pcap_activate(pcap_);\n  if (result == 0) {\n    return true;\n  }\n\n  const char *errMsg = \"Unknown error\";\n\n  switch (result) {\n    \/\/ Warnings log a message and allow activate to continue.\n    case PCAP_WARNING_PROMISC_NOTSUP:\n      log_warning(\"pcap_activate:\", device,\n                  \"does not support promiscuous mode --\", pcap_geterr(pcap_));\n      return true;\n#if defined(PCAP_WARNING_TSTAMP_TYPE_NOTSUP)\n    case PCAP_WARNING_TSTAMP_TYPE_NOTSUP:\n      log_warning(\n          \"pcap_activate: Capture source does not support timestamp type\");\n      return true;\n#endif  \/\/ defined(PCAP_WARNING_TSTAMP_TYPE_NOTSUP)\n    case PCAP_WARNING:\n      log_warning(\"pcap_activate: PCAP_WARNING:\", pcap_geterr(pcap_));\n      return true;\n\n    \/\/ Errors set the error message and return false. Log pcap_geterr to the\n    \/\/ log.\n    case PCAP_ERROR_NO_SUCH_DEVICE:\n      errMsg = \"No such device\";\n      break;\n    case PCAP_ERROR_ACTIVATED:\n      errMsg = \"Handle already activated\";\n      break;\n    case PCAP_ERROR_PERM_DENIED:\n      errMsg = \"Permission denied to open capture source\";\n      break;\n#if defined(PCAP_ERROR_PROMISC_PERM_DENIED)\n    case PCAP_ERROR_PROMISC_PERM_DENIED:\n      errMsg = \"Permission denied to put capture source into promiscuous mode\";\n      break;\n#endif  \/\/ defined(PCAP_ERROR_PROMISC_PERM_DENIED)\n    case PCAP_ERROR_RFMON_NOTSUP:\n      errMsg = \"Capture source does not support monitor mode\";\n      break;\n    case PCAP_ERROR_IFACE_NOT_UP:\n      errMsg = \"Capture source is not up\";\n      break;\n    case PCAP_ERROR:\n    default:\n      errMsg = pcap_geterr(pcap_);\n      break;\n  }\n\n  setError(\"pcap_activate\", device, errMsg);\n  log_error(\"pcap_activate:\", errMsg, \"--\", pcap_geterr(pcap_));\n\n  return false;\n}\n\nvoid PktSource::setError(const char *func, const std::string &arg,\n                         const char *result) {\n  std::ostringstream oss;\n  oss << func << \"(\" << arg << \"): \" << result;\n  error_ = oss.str();\n}\n\nstruct DatalinkInfo {\n  int dlType;\n  PktSource::Encapsulation encap;\n  UInt32 frameSkip;\n\n  bool operator==(int type) const { return dlType == type; }\n};\n\nstatic const DatalinkInfo sDatalinkInfo[] = {\n    {DLT_NULL, PktSource::ENCAP_IP, 4},\n    {DLT_EN10MB, PktSource::ENCAP_ETHERNET, 0},\n    {DLT_RAW, PktSource::ENCAP_IP, 0},\n    \/\/ TODO(bfish):\n    \/\/{ DLT_LINUX_SLL, PktSource::ENCAP_ETHERNET },\n    \/\/{ DLT_LOOP  , PktSource::ENCAP_IP }\n};\n\nPktSource::Encapsulation PktSource::lookupEncapsulation(int datalink,\n                                                        UInt32 *frameSkip) {\n  auto iter =\n      std::find(std::begin(sDatalinkInfo), std::end(sDatalinkInfo), datalink);\n  if (iter != std::end(sDatalinkInfo)) {\n    *frameSkip = iter->frameSkip;\n    return iter->encap;\n  }\n  return ENCAP_UNSUPPORTED;\n}\n\n\/\/\/ Return true if we support this version of libpcap (1.1 or newer). Set error_\n\/\/\/ if not. We use version 1.1 for support for Ubuntu Precise.\nbool PktSource::isPcapVersionSupported() {\n  const char *vers = pcap_lib_version();\n  log::fatal_if_null(vers, \"pcap_lib_version\");\n\n  const unsigned int LIB_MAJOR = 1;\n  const unsigned int LIB_MINOR = 1;\n\n  unsigned int major = 0;\n  unsigned int minor = 0;\n  unsigned int patch = 0;\n\n  if (std::sscanf(vers, \"libpcap version %u.%u.%u\", &major, &minor, &patch) <\n      2) {\n    setError(\"pcap_lib_version\", \"\", vers);\n    return false;\n  }\n\n  if (major > LIB_MAJOR || (major == LIB_MAJOR && minor >= LIB_MINOR)) {\n    return true;\n  }\n\n  error_ = \"Unsupported: \";\n  error_ += vers;\n\n  return false;\n}\n\n\/\/\/ Get list of all devices available for packet capture.\nbool PktSource::getDeviceList(std::string *result) {\n  result->clear();\n\n  pcap_if_t *devs = nullptr;\n  char errbuf[PCAP_ERRBUF_SIZE];\n\n  if (pcap_findalldevs(&devs, errbuf) < 0) {\n    assert(devs == nullptr);\n    error_ = errbuf;\n    return false;\n  }\n\n  \/\/ devs may still be null if empty.\n  if (devs) {\n    std::ostringstream oss;\n    for (pcap_if_t *dev = devs; dev; dev = dev->next) {\n      oss << \"  \" << dev->name;\n      if (dev->description) {\n        oss << \" (\" << dev->description << ')';\n      }\n      oss << '\\n';\n    }\n    *result = oss.str();\n\n    pcap_freealldevs(devs);\n  }\n\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * SEGS - Super Entity Game Server\n * http:\/\/www.segs.io\/\n * Copyright (c) 2006 - 2018 SEGS Team (see AUTHORS.md)\n * This software is licensed under the terms of the 3-clause BSD License. See LICENSE.md for details.\n *\/\n\n\/*!\n * @addtogroup piggtool Projects\/CoX\/Utilities\/piggtool\n * @{\n *\/\n\n#include <stdio.h>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QFile>\n#include <QtCore\/QDir>\n#include <QtCore\/QDebug>\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QCommandLineParser>\n\n#include <vector>\n#include <cassert>\n\nnamespace {\n#pragma pack(push, 1)\nstruct PiggHeader\n{\n    int pigg_magic;\n    int16_t unused;\n    int16_t version;\n    int16_t header_size;\n    int16_t used_header_bytes;\n    uint32_t num_entries;\n};\n\nstruct PiggInternalHeader\n{\n    int flag;\n    int name_id;\n    uint32_t size;\n    uint32_t ftime;\n    uint32_t offset;\n    int unused[6];\n    uint32_t packed_size;\n};\n\n#pragma pack(pop)\nstruct Pigg_DataTable\n{\n    int datapool_flag;\n    std::vector<QString> data_parts;\n};\n\nstruct PiggFile\n{\n   PiggHeader hdr;\n   std::vector<PiggInternalHeader> headers;\n   Pigg_DataTable strings_table;\n   QString fname;\n};\n\ntemplate<class POD>\nbool readPOD(QIODevice &src,POD &tgt) {\n    return sizeof(POD)==src.read((char *)&tgt,sizeof(POD));\n}\n\n\/\/Unpack the ZIP data using qt functions, need to prepend the uncompressed data size to the source data.\nQByteArray uncompr_zip(QByteArray &compressed_data,uint32_t size_uncom) {\n    compressed_data.prepend( char((size_uncom >> 0) & 0xFF));\n    compressed_data.prepend( char((size_uncom >> 8) & 0xFF));\n    compressed_data.prepend( char((size_uncom >> 16) & 0xFF));\n    compressed_data.prepend( char((size_uncom >> 24) & 0xFF));\n    return qUncompress(compressed_data);\n}\n\nbool loadDataTable(QFile &src,Pigg_DataTable &target) {\n    int table_sizes;\n    int num_entries;\n\n    if(!readPOD(src,target.datapool_flag))\n        return false;\n    if(!readPOD(src,table_sizes))\n        return false;\n    if(!readPOD(src,num_entries))\n        return false;\n    while(num_entries>0) {\n        uint32_t entrysize;\n        if(!readPOD(src,entrysize))\n            return false;\n        if(entrysize>0)\n            target.data_parts.push_back(QString::fromLocal8Bit(src.read(entrysize)));\n        num_entries -= entrysize+4;\n    }\n    return true;\n}\n\nbool loadPigg(const QString &fname,PiggFile &pigg)\n{\n    QFile src_fl(fname);\n    if(!src_fl.open(QFile::ReadOnly))\n        return false;\n    pigg.fname = fname;\n    if(false==readPOD(src_fl,pigg.hdr)) {\n        qDebug() << \"file too short\";\n        return false;\n    }\n    if(pigg.hdr.pigg_magic!=0x123) {\n        qDebug() << \"Bad juju!\";\n        return false;\n    }\n    if (pigg.hdr.version > 2)\n    {\n        qDebug() << \"File\" <<fname<< \"has bad pigg version\"<<pigg.hdr.version;\n        return  false;\n    }\n    if (pigg.hdr.header_size != 0x10)\n        src_fl.seek(src_fl.pos()+pigg.hdr.header_size - 0x10);\n    pigg.headers.resize(pigg.hdr.num_entries);\n    assert(pigg.hdr.used_header_bytes==0x30);\n    for(PiggInternalHeader &in_hdr : pigg.headers ) {\n        readPOD(src_fl,in_hdr);\n    }\n    int idx=0;\n    for(PiggInternalHeader &in_hdr : pigg.headers )\n    {\n        if (in_hdr.flag != 0x3456)\n        {\n            qDebug() << \"Bad flag on fileheader #\"<<idx;\n            return false;\n        }\n        uint32_t internal_fsize = in_hdr.packed_size ? in_hdr.packed_size : in_hdr.size;\n        if (in_hdr.offset + internal_fsize - 1 > src_fl.size())\n        {\n            qDebug() << \"File larger than available pigg data - probably corrupt .pigg file!  #\"<<idx;\n            return false;\n        }\n        if (in_hdr.name_id < 0)\n        {\n            qDebug() << \"Name id is invalid in #\"<<idx;\n            return false;\n        }\n        ++idx;\n    }\n    loadDataTable(src_fl,pigg.strings_table);\n    Pigg_DataTable headers_table; \/\/ 'headers' table is not used\/needed during file listing\/extraction operations\n    loadDataTable(src_fl,headers_table);\n    if (pigg.strings_table.datapool_flag != 0x6789)\n    {\n        qDebug() << \"Bad string table magic\";\n        return false;\n    }\n    if (headers_table.datapool_flag != 0x9ABC) {\n        qDebug() << \"Bad headers table magic\";\n        return false;\n    }\n\n    qDebug() << \"Header loaded\";\n    return true;\n}\n\nvoid dumpFileList(PiggFile &pigg)\n{\n    qDebug() << \"Filename    -  Compressed Size - Actual size\";\n    for(PiggInternalHeader & ih : pigg.headers) {\n        qDebug().noquote() << pigg.strings_table.data_parts[ih.name_id] << \"  \" <<ih.packed_size<<\"  \"<<ih.size;\n    }\n}\n\nvoid saveFile(const QString &fname,const QByteArray &data) {\n    QFile tgt_fl(fname);\n    if(!tgt_fl.open(QFile::WriteOnly)) {\n        qWarning() << \"failed to open target file\" << fname;\n        return;\n    }\n    if(data.size()!=tgt_fl.write(data)) {\n        qWarning() << \"Failed to write complete file - write error\";\n    }\n\n}\n\nvoid extractAllFiles(PiggFile &pigg,const QString &tgt_path)\n{\n    QFile src_fl(pigg.fname);\n    if(!src_fl.open(QFile::ReadOnly)) {\n        qWarning() << \"failed to open source file\" << pigg.fname;\n        return;\n    }\n    const QDir curdir(QDir::current());\n    for(const PiggInternalHeader & ih : pigg.headers) {\n        const QString target_fname=pigg.strings_table.data_parts[ih.name_id];\n        \/\/qDebug().noquote() << \"Extracting\"<<target_fname;\n        src_fl.seek(ih.offset);\n        bool was_packed = ih.packed_size!=0;\n        QByteArray src_data = src_fl.read(was_packed ? ih.packed_size : ih.size);\n        const QFileInfo fi(tgt_path+\"\/\"+target_fname);\n        if(!curdir.exists(fi.path()))\n            curdir.mkpath(fi.path());\n        if(was_packed) {\n            QByteArray actual_data = uncompr_zip(src_data,ih.size);\n            src_data = actual_data;\n        }\n        saveFile(tgt_path+\"\/\"+target_fname,src_data);\n    }\n}\n}\n\nint main(int argc, char **argv)\n{\n    QCoreApplication app(argc,argv);\n    QCommandLineParser parser;\n    parser.setApplicationDescription(\"Pigg utility\");\n    parser.addOptions({\n        {\"l\", \"List files in pigg archive\"},\n        {\"x\", \"Extract all files from pigg archive \"},\n    });\n    parser.addPositionalArgument(\"pigg_file\", \"File to process\");\n    parser.addPositionalArgument(\"target_directory\", \"directory to put extracted files in\");\n    parser.addHelpOption();\n\n    parser.process(app);\n    if(parser.positionalArguments().isEmpty() || parser.optionNames().isEmpty()) {\n        parser.showHelp(0);\n    }\n    QStringList positionals = parser.positionalArguments();\n    const QString &pigg_name = positionals.constFirst();\n    QString target_dir = positionals.count()>1 ? positionals[1] : \"data\";\n    PiggFile hdr;\n    if(!loadPigg(pigg_name,hdr))\n    {\n        qCritical() << \"Failed to read\"<<pigg_name;\n    }\n    if(parser.isSet(\"l\")) {\n        dumpFileList(hdr);\n    }\n    else if(parser.isSet(\"x\")) {\n        extractAllFiles(hdr,target_dir);\n    }\n    return 0;\n}\n\n\/\/! @}\n<commit_msg>Allow specifying a directory to PiggTool for extraction mode (#464)<commit_after>\/*\n * SEGS - Super Entity Game Server\n * http:\/\/www.segs.io\/\n * Copyright (c) 2006 - 2018 SEGS Team (see AUTHORS.md)\n * This software is licensed under the terms of the 3-clause BSD License. See LICENSE.md for details.\n *\/\n\n\/*!\n * @addtogroup piggtool Projects\/CoX\/Utilities\/piggtool\n * @{\n *\/\n\n#include <stdio.h>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QFile>\n#include <QtCore\/QDir>\n#include <QtCore\/QDebug>\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QCommandLineParser>\n\n#include <vector>\n#include <cassert>\n\nnamespace {\n#pragma pack(push, 1)\nstruct PiggHeader\n{\n    int pigg_magic;\n    int16_t unused;\n    int16_t version;\n    int16_t header_size;\n    int16_t used_header_bytes;\n    uint32_t num_entries;\n};\n\nstruct PiggInternalHeader\n{\n    int flag;\n    int name_id;\n    uint32_t size;\n    uint32_t ftime;\n    uint32_t offset;\n    int unused[6];\n    uint32_t packed_size;\n};\n\n#pragma pack(pop)\nstruct Pigg_DataTable\n{\n    int datapool_flag;\n    std::vector<QString> data_parts;\n};\n\nstruct PiggFile\n{\n   PiggHeader hdr;\n   std::vector<PiggInternalHeader> headers;\n   Pigg_DataTable strings_table;\n   QString fname;\n};\n\ntemplate<class POD>\nbool readPOD(QIODevice &src,POD &tgt) {\n    return sizeof(POD)==src.read((char *)&tgt,sizeof(POD));\n}\n\n\/\/Unpack the ZIP data using qt functions, need to prepend the uncompressed data size to the source data.\nQByteArray uncompr_zip(QByteArray &compressed_data,uint32_t size_uncom) {\n    compressed_data.prepend( char((size_uncom >> 0) & 0xFF));\n    compressed_data.prepend( char((size_uncom >> 8) & 0xFF));\n    compressed_data.prepend( char((size_uncom >> 16) & 0xFF));\n    compressed_data.prepend( char((size_uncom >> 24) & 0xFF));\n    return qUncompress(compressed_data);\n}\n\nbool loadDataTable(QFile &src,Pigg_DataTable &target) {\n    int table_sizes;\n    int num_entries;\n\n    if(!readPOD(src,target.datapool_flag))\n        return false;\n    if(!readPOD(src,table_sizes))\n        return false;\n    if(!readPOD(src,num_entries))\n        return false;\n    while(num_entries>0) {\n        uint32_t entrysize;\n        if(!readPOD(src,entrysize))\n            return false;\n        if(entrysize>0)\n            target.data_parts.push_back(QString::fromLocal8Bit(src.read(entrysize)));\n        num_entries -= entrysize+4;\n    }\n    return true;\n}\n\nbool loadPigg(const QString &fname,PiggFile &pigg)\n{\n    QFile src_fl(fname);\n    if(!src_fl.open(QFile::ReadOnly))\n        return false;\n    pigg.fname = fname;\n    if(false==readPOD(src_fl,pigg.hdr)) {\n        qDebug() << \"file too short\";\n        return false;\n    }\n    if(pigg.hdr.pigg_magic!=0x123) {\n        qDebug() << \"Bad juju!\";\n        return false;\n    }\n    if (pigg.hdr.version > 2)\n    {\n        qDebug() << \"File\" <<fname<< \"has bad pigg version\"<<pigg.hdr.version;\n        return  false;\n    }\n    if (pigg.hdr.header_size != 0x10)\n        src_fl.seek(src_fl.pos()+pigg.hdr.header_size - 0x10);\n    pigg.headers.resize(pigg.hdr.num_entries);\n    assert(pigg.hdr.used_header_bytes==0x30);\n    for(PiggInternalHeader &in_hdr : pigg.headers ) {\n        readPOD(src_fl,in_hdr);\n    }\n    int idx=0;\n    for(PiggInternalHeader &in_hdr : pigg.headers )\n    {\n        if (in_hdr.flag != 0x3456)\n        {\n            qDebug() << \"Bad flag on fileheader #\"<<idx;\n            return false;\n        }\n        uint32_t internal_fsize = in_hdr.packed_size ? in_hdr.packed_size : in_hdr.size;\n        if (in_hdr.offset + internal_fsize - 1 > src_fl.size())\n        {\n            qDebug() << \"File larger than available pigg data - probably corrupt .pigg file!  #\"<<idx;\n            return false;\n        }\n        if (in_hdr.name_id < 0)\n        {\n            qDebug() << \"Name id is invalid in #\"<<idx;\n            return false;\n        }\n        ++idx;\n    }\n    loadDataTable(src_fl,pigg.strings_table);\n    Pigg_DataTable headers_table; \/\/ 'headers' table is not used\/needed during file listing\/extraction operations\n    loadDataTable(src_fl,headers_table);\n    if (pigg.strings_table.datapool_flag != 0x6789)\n    {\n        qDebug() << \"Bad string table magic\";\n        return false;\n    }\n    if (headers_table.datapool_flag != 0x9ABC) {\n        qDebug() << \"Bad headers table magic\";\n        return false;\n    }\n\n    return true;\n}\n\nvoid dumpFileList(PiggFile &pigg)\n{\n    qDebug() << \"Filename    -  Compressed Size - Actual size\";\n    for(PiggInternalHeader & ih : pigg.headers) {\n        qDebug().noquote() << pigg.strings_table.data_parts[ih.name_id] << \"  \" <<ih.packed_size<<\"  \"<<ih.size;\n    }\n}\n\nvoid saveFile(const QString &fname,const QByteArray &data) {\n    QFile tgt_fl(fname);\n    if(!tgt_fl.open(QFile::WriteOnly)) {\n        qWarning() << \"failed to open target file\" << fname;\n        return;\n    }\n    if(data.size()!=tgt_fl.write(data)) {\n        qWarning() << \"Failed to write complete file - write error\";\n    }\n\n}\n\nbool extractAllFiles(PiggFile &pigg, const QString &tgt_path)\n{\n    QFile src_fl(pigg.fname);\n\n    if (!src_fl.open(QFile::ReadOnly)) {\n        qWarning() << \"failed to open source file\" << pigg.fname;\n        return false;\n    }\n\n    qInfo() << \"Found\" << pigg.headers.size() << \"internal files in:\" << pigg.fname;\n\n    const QDir curdir(QDir::current());\n\n    for(const PiggInternalHeader & ih : pigg.headers) {\n        const QString target_fname=pigg.strings_table.data_parts[ih.name_id];\n        \/\/qDebug().noquote() << \"Extracting\"<<target_fname;\n\n        src_fl.seek(ih.offset);\n\n        bool was_packed = ih.packed_size!=0;\n        QByteArray src_data = src_fl.read(was_packed ? ih.packed_size : ih.size);\n\n        const QFileInfo fi(tgt_path+\"\/\"+target_fname);\n\n        if(!curdir.exists(fi.path()))\n            curdir.mkpath(fi.path());\n\n        if(was_packed) {\n            QByteArray actual_data = uncompr_zip(src_data,ih.size);\n            src_data = actual_data;\n        }\n\n        saveFile(tgt_path+\"\/\"+target_fname,src_data);\n    }\n\n    return true;\n}\n\nbool extractFile(const QString &pigg_filename, const QString &target_directory)\n{\n    qInfo() << \"Reading Pigg file:\" << pigg_filename;\n\n    PiggFile header;\n\n    if (!loadPigg(pigg_filename, header))\n    {\n        qCritical() << \"Failed to read Pigg file:\" << pigg_filename;\n        return false;\n    }\n\n    return extractAllFiles(header, target_directory);\n}\n\nvoid extractFilesFromPath(const QString &source_path, const QString &target_directory)\n{\n    const QFileInfo file_info(source_path);\n\n    if (file_info.isDir())\n    {\n        const auto files = QDir(source_path).entryList(QStringList() << \"*.pigg\", QDir::Files);\n        qInfo() << \"Found\" << files.size() << \".pigg files.\";\n\n        for (const auto file : files)\n            extractFile(source_path + \"\/\" + file, target_directory);\n    }\n    else if (file_info.isFile())\n    {\n        extractFile(source_path, target_directory);\n    }\n}\n\n}\n\nint main(int argc, char **argv)\n{\n    QCoreApplication app(argc,argv);\n    QCommandLineParser parser;\n    parser.setApplicationDescription(\"Pigg utility\");\n    parser.addOptions({\n        {\"l\", \"List files in pigg archive\"},\n        {\"x\", \"Extract all files from pigg archive \"},\n    });\n    parser.addPositionalArgument(\"pigg_file\", \"File to process\");\n    parser.addPositionalArgument(\"target_directory\", \"directory to put extracted files in\");\n    parser.addHelpOption();\n\n    parser.process(app);\n\n    if (parser.positionalArguments().isEmpty() || parser.optionNames().isEmpty())\n        parser.showHelp(0);\n\n    QStringList positionals = parser.positionalArguments();\n    const QString &pigg_name = positionals.constFirst();\n    QString target_dir = positionals.count()>1 ? positionals[1] : \"data\";\n\n    if (parser.isSet(\"l\"))\n    {\n        PiggFile header;\n\n        if (loadPigg(pigg_name, header))\n          dumpFileList(header);\n    }\n    else if (parser.isSet(\"x\"))\n    {\n        extractFilesFromPath(pigg_name, target_dir);\n    }\n\n    return 0;\n}\n\n\/\/! @}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- *\/\n\/*\n * This file is part of the libetonyek 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 <libetonyek\/libetonyek.h>\n\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/logic\/tribool.hpp>\n\n#include <libxml\/xmlreader.h>\n\n#include \"libetonyek_utils.h\"\n#include \"libetonyek_xml.h\"\n#include \"IWORKPresentationRedirector.h\"\n#include \"IWORKSpreadsheetRedirector.h\"\n#include \"IWORKTextRedirector.h\"\n#include \"IWORKTokenizer.h\"\n#include \"IWORKZlibStream.h\"\n#include \"KEY1Parser.h\"\n#include \"KEY2Parser.h\"\n#include \"KEY2Token.h\"\n#include \"KEYCollector.h\"\n#include \"KEYDictionary.h\"\n#include \"NUMCollector.h\"\n#include \"NUMDictionary.h\"\n#include \"NUM1Parser.h\"\n#include \"NUM1Token.h\"\n#include \"PAGCollector.h\"\n#include \"PAG1Parser.h\"\n#include \"PAG1Token.h\"\n#include \"PAGDictionary.h\"\n\nusing boost::logic::indeterminate;\nusing boost::logic::tribool;\nusing boost::scoped_ptr;\nusing boost::shared_ptr;\nusing std::string;\n\nusing librevenge::RVNG_SEEK_SET;\n\nnamespace libetonyek\n{\n\nnamespace\n{\n\nenum CheckType\n{\n  CHECK_TYPE_NONE = 0,\n  CHECK_TYPE_KEYNOTE = 1 << 1,\n  CHECK_TYPE_NUMBERS = 1 << 2,\n  CHECK_TYPE_PAGES = 1 << 3,\n  CHECK_TYPE_ANY = CHECK_TYPE_KEYNOTE | CHECK_TYPE_NUMBERS | CHECK_TYPE_PAGES\n};\n\nstruct DetectionInfo\n{\n  DetectionInfo();\n\n  RVNGInputStreamPtr_t input;\n  RVNGInputStreamPtr_t package;\n  EtonyekDocument::Confidence confidence;\n  EtonyekDocument::Type type;\n  unsigned version;\n};\n\nDetectionInfo::DetectionInfo()\n  : input()\n  , package()\n  , confidence(EtonyekDocument::CONFIDENCE_NONE)\n  , type(EtonyekDocument::TYPE_UNKNOWN)\n  , version(0)\n{\n}\n\ntypedef bool (*ProbeXMLFun_t)(const RVNGInputStreamPtr_t &, unsigned &, xmlTextReaderPtr);\n\n\nstd::string queryAttribute(xmlTextReaderPtr reader, const int name, const int ns, const IWORKTokenizer &tokenizer)\n{\n  if (xmlTextReaderHasAttributes(reader))\n  {\n    int ret = xmlTextReaderMoveToFirstAttribute(reader);\n    while (1 == ret)\n    {\n      const int id = tokenizer.getQualifiedId(char_cast(xmlTextReaderConstLocalName(reader)), char_cast(xmlTextReaderConstNamespaceUri(reader)));\n      if ((ns | name) == id)\n        return char_cast(xmlTextReaderConstValue(reader));\n\n      ret = xmlTextReaderMoveToNextAttribute(reader);\n    }\n  }\n\n  return \"\";\n}\n\n\nbool probeKeynote1XML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  \/\/ TODO: implement me\n  (void) input;\n  (void) version;\n  (void) reader;\n  return false;\n}\n\nbool probeKeynote2XML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  if (input->isEnd())\n    return false;\n\n  const IWORKTokenizer &tokenizer(KEY2Token::getTokenizer());\n  assert(reader);\n\n  const int id = tokenizer.getQualifiedId(char_cast(xmlTextReaderConstLocalName(reader)), char_cast(xmlTextReaderConstNamespaceUri(reader)));\n\n  if ((KEY2Token::NS_URI_KEY | KEY2Token::presentation) == id)\n  {\n    const std::string v = queryAttribute(reader, KEY2Token::version, KEY2Token::NS_URI_KEY, tokenizer);\n\n    switch (tokenizer.getId(v.c_str()))\n    {\n    case KEY2Token::VERSION_STR_2 :\n      version = 2;\n      return true;\n    case KEY2Token::VERSION_STR_3 :\n      version = 3;\n      return true;\n    case KEY2Token::VERSION_STR_4 :\n      version = 4;\n      return true;\n    case KEY2Token::VERSION_STR_5 :\n      version = 5;\n      return true;\n    }\n  }\n\n  return false;\n}\n\nbool probeKeynoteXML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  if (probeKeynote2XML(input, version, reader))\n    return true;\n\n  input->seek(0, RVNG_SEEK_SET);\n\n  return probeKeynote1XML(input, version, reader);\n}\n\nbool probeNumbersXML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  if (input->isEnd())\n    return false;\n\n  const IWORKTokenizer &tokenizer(NUM1Token::getTokenizer());\n  assert(reader);\n\n  const int id = tokenizer.getQualifiedId(char_cast(xmlTextReaderConstLocalName(reader)), char_cast(xmlTextReaderConstNamespaceUri(reader)));\n\n  if ((NUM1Token::NS_URI_LS | NUM1Token::document) == id)\n  {\n    const std::string v = queryAttribute(reader, NUM1Token::version, NUM1Token::NS_URI_LS, tokenizer);\n\n    switch (tokenizer.getId(v.c_str()))\n    {\n    case NUM1Token::VERSION_STR_2 :\n      version = 2;\n      return true;\n    }\n  }\n\n  return false;\n}\n\nbool probePagesXML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  if (input->isEnd())\n    return false;\n\n  const IWORKTokenizer &tokenizer(PAG1Token::getTokenizer());\n  assert(reader);\n\n  const int id = tokenizer.getQualifiedId(char_cast(xmlTextReaderConstLocalName(reader)), char_cast(xmlTextReaderConstNamespaceUri(reader)));\n\n  if ((PAG1Token::NS_URI_SL | PAG1Token::document) == id)\n  {\n    const std::string v = queryAttribute(reader, PAG1Token::version, PAG1Token::NS_URI_SL, tokenizer);\n\n    switch (tokenizer.getId(v.c_str()))\n    {\n    case PAG1Token::VERSION_STR_4 :\n      version = 4;\n      return true;\n    }\n  }\n\n  return false;\n}\n\nbool probeXMLImpl(const RVNGInputStreamPtr_t &input, const ProbeXMLFun_t probe, const EtonyekDocument::Type type, DetectionInfo &info)\n{\n  const shared_ptr<xmlTextReader> reader(xmlReaderForIO(readFromStream, closeStream, input.get(), \"\", 0, 0), xmlFreeTextReader);\n  if (!reader)\n    return false;\n\n  int ret = 0;\n  do\n  {\n    ret = xmlTextReaderRead(reader.get());\n  }\n  while ((1 == ret) && (XML_READER_TYPE_ELEMENT != xmlTextReaderNodeType(reader.get())));\n\n  if (1 != ret)\n    return false;\n\n  if (probe(input, info.version, reader.get()))\n  {\n    info.type = type;\n    return true;\n  }\n\n  return false;\n}\n\nbool probeXML(const ProbeXMLFun_t probe, const EtonyekDocument::Type type, tribool &isGzipped, DetectionInfo &info)\n{\n  if (isGzipped || indeterminate(isGzipped))\n  {\n    try\n    {\n      const RVNGInputStreamPtr_t uncompressed(new IWORKZlibStream(info.input));\n      isGzipped = true;\n\n      if (probeXMLImpl(uncompressed, probe, type, info))\n      {\n        info.input = uncompressed;\n        return true;\n      }\n      else\n      {\n        return false; \/\/ compressed, but invalid format\n      }\n    }\n    catch (...)\n    {\n      if (isGzipped) \/\/ decompression failed? most probably a broken file...\n        return false;\n\n      isGzipped = false;\n    }\n\n    info.input->seek(0, RVNG_SEEK_SET);\n  }\n\n  assert(!isGzipped);\n\n  return probeXMLImpl(info.input, probe, type, info);\n}\n\nbool detect(const RVNGInputStreamPtr_t &input, unsigned checkTypes, DetectionInfo &info)\n{\n  info.confidence = EtonyekDocument::CONFIDENCE_SUPPORTED_PART;\n  bool isXML = true;\n  tribool isGzipped = indeterminate;\n  tribool isKeynote1 = indeterminate;\n\n  if (input->isStructured())\n  {\n    info.package = input;\n\n    \/\/ check which format it might be\n    if (CHECK_TYPE_KEYNOTE & checkTypes)\n    {\n      if (input->existsSubStream(\"index.apxl\"))\n      {\n        checkTypes = CHECK_TYPE_KEYNOTE;\n        isGzipped = false;\n        isKeynote1 = false;\n        info.input.reset(input->getSubStreamByName(\"index.apxl\"));\n      }\n      else if (input->existsSubStream(\"index.apxl.gz\"))\n      {\n        checkTypes = CHECK_TYPE_KEYNOTE;\n        isGzipped = true;\n        isKeynote1 = false;\n        info.input.reset(input->getSubStreamByName(\"index.apxl.gz\"));\n      }\n      else if (input->existsSubStream(\"presentation.apxl\"))\n      {\n        checkTypes = CHECK_TYPE_KEYNOTE;\n        isGzipped = false;\n        isKeynote1 = true;\n        info.input.reset(input->getSubStreamByName(\"presentation.apxl\"));\n      }\n      else if (input->existsSubStream(\"presentation.apxl.gz\"))\n      {\n        checkTypes = CHECK_TYPE_KEYNOTE;\n        isGzipped = true;\n        isKeynote1 = true;\n        info.input.reset(input->getSubStreamByName(\"presentation.apxl.gz\"));\n      }\n    }\n\n    if ((CHECK_TYPE_NUMBERS | CHECK_TYPE_PAGES) & checkTypes)\n    {\n      if (input->existsSubStream(\"index.xml\"))\n      {\n        checkTypes &= (CHECK_TYPE_NUMBERS | CHECK_TYPE_PAGES);\n        isGzipped = false;\n        info.input.reset(input->getSubStreamByName(\"index.xml\"));\n      }\n      else if (input->existsSubStream(\"index.xml.gz\"))\n      {\n        checkTypes &= (CHECK_TYPE_NUMBERS | CHECK_TYPE_PAGES);\n        isGzipped = false;\n        info.input.reset(input->getSubStreamByName(\"index.xml.gz\"));\n      }\n    }\n\n    if (!info.input && (CHECK_TYPE_ANY & checkTypes))\n    {\n      if (input->existsSubStream(\"Index.zip\"))\n      {\n        isXML = false;\n        info.input.reset(input->getSubStreamByName(\"Index.zip\"));\n      }\n    }\n\n    if (!info.input)\n    {\n      \/\/ nothing detected\n      \/\/ TODO: this might also be Index.zip...\n      return EtonyekDocument::CONFIDENCE_NONE;\n    }\n\n    info.confidence = EtonyekDocument::CONFIDENCE_EXCELLENT; \/\/ this is either a valid package of a false positive\n  }\n  else\n  {\n    info.input = input;\n  }\n\n  assert(bool(info.input));\n\n  if (isXML)\n  {\n    assert(CHECK_TYPE_ANY & checkTypes);\n    assert(!info.input->isStructured());\n\n    info.input->seek(0, RVNG_SEEK_SET);\n\n    if (CHECK_TYPE_KEYNOTE & checkTypes)\n    {\n      const ProbeXMLFun_t probe = (isKeynote1 ? probeKeynote1XML : ((!isKeynote1) ? probeKeynote2XML : probeKeynoteXML));\n      if (probeXML(probe, EtonyekDocument::TYPE_KEYNOTE, isGzipped, info))\n        return true;\n\n      info.input->seek(0, RVNG_SEEK_SET);\n    }\n\n    if (CHECK_TYPE_NUMBERS & checkTypes)\n    {\n      if (probeXML(probeNumbersXML, EtonyekDocument::TYPE_NUMBERS, isGzipped, info))\n        return true;\n\n      info.input->seek(0, RVNG_SEEK_SET);\n    }\n\n    if (CHECK_TYPE_PAGES & checkTypes)\n    {\n      if (probeXML(probePagesXML, EtonyekDocument::TYPE_PAGES, isGzipped, info))\n        return true;\n    }\n  }\n  else\n  {\n    \/\/ TODO: detect type in binary format\n  }\n\n  return EtonyekDocument::CONFIDENCE_NONE;\n}\n\n}\n\nnamespace\n{\n\nshared_ptr<IWORKParser> makeKeynoteParser(const unsigned version, const RVNGInputStreamPtr_t &input, const RVNGInputStreamPtr_t &package, KEYCollector *const collector, KEYDictionary &dict)\n{\n  shared_ptr<IWORKParser> parser;\n\n  if (1 == version)\n    parser.reset(new KEY1Parser(input, package, collector));\n  else if ((2 <= version) && (5 >= version))\n    parser.reset(new KEY2Parser(input, package, collector, dict));\n  else\n    assert(0);\n\n  return parser;\n}\n\n}\n\nETONYEKAPI EtonyekDocument::Confidence EtonyekDocument::isSupported(librevenge::RVNGInputStream *const input, EtonyekDocument::Type *type) try\n{\n  if (!input)\n    return CONFIDENCE_NONE;\n\n  if (type)\n    *type = TYPE_UNKNOWN;\n\n  DetectionInfo info;\n\n  if (detect(RVNGInputStreamPtr_t(input, EtonyekDummyDeleter()), CHECK_TYPE_ANY, info))\n  {\n    assert(TYPE_UNKNOWN != info.type);\n    assert(CONFIDENCE_NONE != info.confidence);\n    assert(bool(info.input));\n\n    if (type)\n      *type = info.type;\n    return info.confidence;\n  }\n\n  return CONFIDENCE_NONE;\n}\ncatch (...)\n{\n  return CONFIDENCE_NONE;\n}\n\nETONYEKAPI bool EtonyekDocument::parse(librevenge::RVNGInputStream *const input, librevenge::RVNGPresentationInterface *const generator) try\n{\n  if (!input || !generator)\n    return false;\n\n  DetectionInfo info;\n\n  if (!detect(RVNGInputStreamPtr_t(input, EtonyekDummyDeleter()), CHECK_TYPE_KEYNOTE, info))\n    return false;\n\n  assert(TYPE_UNKNOWN != info.type);\n  assert(CONFIDENCE_NONE != info.confidence);\n  assert(bool(info.input));\n  assert(0 != info.version);\n\n  info.input->seek(0, librevenge::RVNG_SEEK_SET);\n\n  KEYDictionary dict;\n  IWORKPresentationRedirector redirector(generator);\n  KEYCollector collector(&redirector);\n  const shared_ptr<IWORKParser> parser = makeKeynoteParser(info.version, info.input, info.package, &collector, dict);\n  return parser->parse();\n}\ncatch (...)\n{\n  return false;\n}\n\nETONYEKAPI bool EtonyekDocument::parse(librevenge::RVNGInputStream *const input, librevenge::RVNGSpreadsheetInterface *const document) try\n{\n  if (!input || !document)\n    return false;\n\n  DetectionInfo info;\n\n  if (!detect(RVNGInputStreamPtr_t(input, EtonyekDummyDeleter()), CHECK_TYPE_NUMBERS, info))\n    return false;\n\n  assert(TYPE_UNKNOWN != info.type);\n  assert(CONFIDENCE_NONE != info.confidence);\n  assert(bool(info.input));\n  assert(0 != info.version);\n\n  info.input->seek(0, librevenge::RVNG_SEEK_SET);\n\n  IWORKSpreadsheetRedirector redirector(document);\n  NUMCollector collector(&redirector);\n  NUMDictionary dict;\n  NUM1Parser parser(info.input, info.package, &collector, &dict);\n  return parser.parse();\n}\ncatch (...)\n{\n  return false;\n}\n\nETONYEKAPI bool EtonyekDocument::parse(librevenge::RVNGInputStream *const input, librevenge::RVNGTextInterface *const document) try\n{\n  if (!input || !document)\n    return false;\n\n  DetectionInfo info;\n\n  if (!detect(RVNGInputStreamPtr_t(input, EtonyekDummyDeleter()), CHECK_TYPE_PAGES, info))\n    return false;\n\n  assert(TYPE_UNKNOWN != info.type);\n  assert(CONFIDENCE_NONE != info.confidence);\n  assert(bool(info.input));\n  assert(0 != info.version);\n\n  info.input->seek(0, librevenge::RVNG_SEEK_SET);\n\n  IWORKTextRedirector redirector(document);\n  PAGCollector collector(&redirector);\n  PAGDictionary dict;\n  PAG1Parser parser(info.input, info.package, &collector, &dict);\n  return parser.parse();\n}\ncatch (...)\n{\n  return false;\n}\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<commit_msg>blind fix for windows build error<commit_after>\/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- *\/\n\/*\n * This file is part of the libetonyek 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 <libetonyek\/libetonyek.h>\n\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/logic\/tribool.hpp>\n\n#include <libxml\/xmlreader.h>\n\n#include \"libetonyek_utils.h\"\n#include \"libetonyek_xml.h\"\n#include \"IWORKPresentationRedirector.h\"\n#include \"IWORKSpreadsheetRedirector.h\"\n#include \"IWORKTextRedirector.h\"\n#include \"IWORKTokenizer.h\"\n#include \"IWORKZlibStream.h\"\n#include \"KEY1Parser.h\"\n#include \"KEY2Parser.h\"\n#include \"KEY2Token.h\"\n#include \"KEYCollector.h\"\n#include \"KEYDictionary.h\"\n#include \"NUMCollector.h\"\n#include \"NUMDictionary.h\"\n#include \"NUM1Parser.h\"\n#include \"NUM1Token.h\"\n#include \"PAGCollector.h\"\n#include \"PAG1Parser.h\"\n#include \"PAG1Token.h\"\n#include \"PAGDictionary.h\"\n\nusing boost::logic::indeterminate;\nusing boost::logic::tribool;\nusing boost::scoped_ptr;\nusing boost::shared_ptr;\nusing std::string;\n\nusing librevenge::RVNG_SEEK_SET;\n\nnamespace libetonyek\n{\n\nnamespace\n{\n\nenum CheckType\n{\n  CHECK_TYPE_NONE = 0,\n  CHECK_TYPE_KEYNOTE = 1 << 1,\n  CHECK_TYPE_NUMBERS = 1 << 2,\n  CHECK_TYPE_PAGES = 1 << 3,\n  CHECK_TYPE_ANY = CHECK_TYPE_KEYNOTE | CHECK_TYPE_NUMBERS | CHECK_TYPE_PAGES\n};\n\nstruct DetectionInfo\n{\n  DetectionInfo();\n\n  RVNGInputStreamPtr_t input;\n  RVNGInputStreamPtr_t package;\n  EtonyekDocument::Confidence confidence;\n  EtonyekDocument::Type type;\n  unsigned version;\n};\n\nDetectionInfo::DetectionInfo()\n  : input()\n  , package()\n  , confidence(EtonyekDocument::CONFIDENCE_NONE)\n  , type(EtonyekDocument::TYPE_UNKNOWN)\n  , version(0)\n{\n}\n\ntypedef bool (*ProbeXMLFun_t)(const RVNGInputStreamPtr_t &, unsigned &, xmlTextReaderPtr);\n\n\nstd::string queryAttribute(xmlTextReaderPtr reader, const int name, const int ns, const IWORKTokenizer &tokenizer)\n{\n  if (xmlTextReaderHasAttributes(reader))\n  {\n    int ret = xmlTextReaderMoveToFirstAttribute(reader);\n    while (1 == ret)\n    {\n      const int id = tokenizer.getQualifiedId(char_cast(xmlTextReaderConstLocalName(reader)), char_cast(xmlTextReaderConstNamespaceUri(reader)));\n      if ((ns | name) == id)\n        return char_cast(xmlTextReaderConstValue(reader));\n\n      ret = xmlTextReaderMoveToNextAttribute(reader);\n    }\n  }\n\n  return \"\";\n}\n\n\nbool probeKeynote1XML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  \/\/ TODO: implement me\n  (void) input;\n  (void) version;\n  (void) reader;\n  return false;\n}\n\nbool probeKeynote2XML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  if (input->isEnd())\n    return false;\n\n  const IWORKTokenizer &tokenizer(KEY2Token::getTokenizer());\n  assert(reader);\n\n  const int id = tokenizer.getQualifiedId(char_cast(xmlTextReaderConstLocalName(reader)), char_cast(xmlTextReaderConstNamespaceUri(reader)));\n\n  if ((KEY2Token::NS_URI_KEY | KEY2Token::presentation) == id)\n  {\n    const std::string v = queryAttribute(reader, KEY2Token::version, KEY2Token::NS_URI_KEY, tokenizer);\n\n    switch (tokenizer.getId(v.c_str()))\n    {\n    case KEY2Token::VERSION_STR_2 :\n      version = 2;\n      return true;\n    case KEY2Token::VERSION_STR_3 :\n      version = 3;\n      return true;\n    case KEY2Token::VERSION_STR_4 :\n      version = 4;\n      return true;\n    case KEY2Token::VERSION_STR_5 :\n      version = 5;\n      return true;\n    }\n  }\n\n  return false;\n}\n\nbool probeKeynoteXML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  if (probeKeynote2XML(input, version, reader))\n    return true;\n\n  input->seek(0, RVNG_SEEK_SET);\n\n  return probeKeynote1XML(input, version, reader);\n}\n\nbool probeNumbersXML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  if (input->isEnd())\n    return false;\n\n  const IWORKTokenizer &tokenizer(NUM1Token::getTokenizer());\n  assert(reader);\n\n  const int id = tokenizer.getQualifiedId(char_cast(xmlTextReaderConstLocalName(reader)), char_cast(xmlTextReaderConstNamespaceUri(reader)));\n\n  if ((NUM1Token::NS_URI_LS | NUM1Token::document) == id)\n  {\n    const std::string v = queryAttribute(reader, NUM1Token::version, NUM1Token::NS_URI_LS, tokenizer);\n\n    switch (tokenizer.getId(v.c_str()))\n    {\n    case NUM1Token::VERSION_STR_2 :\n      version = 2;\n      return true;\n    }\n  }\n\n  return false;\n}\n\nbool probePagesXML(const RVNGInputStreamPtr_t &input, unsigned &version, xmlTextReaderPtr reader)\n{\n  if (input->isEnd())\n    return false;\n\n  const IWORKTokenizer &tokenizer(PAG1Token::getTokenizer());\n  assert(reader);\n\n  const int id = tokenizer.getQualifiedId(char_cast(xmlTextReaderConstLocalName(reader)), char_cast(xmlTextReaderConstNamespaceUri(reader)));\n\n  if ((PAG1Token::NS_URI_SL | PAG1Token::document) == id)\n  {\n    const std::string v = queryAttribute(reader, PAG1Token::version, PAG1Token::NS_URI_SL, tokenizer);\n\n    switch (tokenizer.getId(v.c_str()))\n    {\n    case PAG1Token::VERSION_STR_4 :\n      version = 4;\n      return true;\n    }\n  }\n\n  return false;\n}\n\nbool probeXMLImpl(const RVNGInputStreamPtr_t &input, const ProbeXMLFun_t probe, const EtonyekDocument::Type type, DetectionInfo &info)\n{\n  const shared_ptr<xmlTextReader> reader(xmlReaderForIO(readFromStream, closeStream, input.get(), \"\", 0, 0), xmlFreeTextReader);\n  if (!reader)\n    return false;\n\n  int ret = 0;\n  do\n  {\n    ret = xmlTextReaderRead(reader.get());\n  }\n  while ((1 == ret) && (XML_READER_TYPE_ELEMENT != xmlTextReaderNodeType(reader.get())));\n\n  if (1 != ret)\n    return false;\n\n  if (probe(input, info.version, reader.get()))\n  {\n    info.type = type;\n    return true;\n  }\n\n  return false;\n}\n\nbool probeXML(const ProbeXMLFun_t probe, const EtonyekDocument::Type type, tribool &isGzipped, DetectionInfo &info)\n{\n  if (isGzipped || indeterminate(isGzipped))\n  {\n    try\n    {\n      const RVNGInputStreamPtr_t uncompressed(new IWORKZlibStream(info.input));\n      isGzipped = true;\n\n      if (probeXMLImpl(uncompressed, probe, type, info))\n      {\n        info.input = uncompressed;\n        return true;\n      }\n      else\n      {\n        return false; \/\/ compressed, but invalid format\n      }\n    }\n    catch (...)\n    {\n      if (isGzipped) \/\/ decompression failed? most probably a broken file...\n        return false;\n\n      isGzipped = false;\n    }\n\n    info.input->seek(0, RVNG_SEEK_SET);\n  }\n\n  assert(isGzipped == false);\n\n  return probeXMLImpl(info.input, probe, type, info);\n}\n\nbool detect(const RVNGInputStreamPtr_t &input, unsigned checkTypes, DetectionInfo &info)\n{\n  info.confidence = EtonyekDocument::CONFIDENCE_SUPPORTED_PART;\n  bool isXML = true;\n  tribool isGzipped = indeterminate;\n  tribool isKeynote1 = indeterminate;\n\n  if (input->isStructured())\n  {\n    info.package = input;\n\n    \/\/ check which format it might be\n    if (CHECK_TYPE_KEYNOTE & checkTypes)\n    {\n      if (input->existsSubStream(\"index.apxl\"))\n      {\n        checkTypes = CHECK_TYPE_KEYNOTE;\n        isGzipped = false;\n        isKeynote1 = false;\n        info.input.reset(input->getSubStreamByName(\"index.apxl\"));\n      }\n      else if (input->existsSubStream(\"index.apxl.gz\"))\n      {\n        checkTypes = CHECK_TYPE_KEYNOTE;\n        isGzipped = true;\n        isKeynote1 = false;\n        info.input.reset(input->getSubStreamByName(\"index.apxl.gz\"));\n      }\n      else if (input->existsSubStream(\"presentation.apxl\"))\n      {\n        checkTypes = CHECK_TYPE_KEYNOTE;\n        isGzipped = false;\n        isKeynote1 = true;\n        info.input.reset(input->getSubStreamByName(\"presentation.apxl\"));\n      }\n      else if (input->existsSubStream(\"presentation.apxl.gz\"))\n      {\n        checkTypes = CHECK_TYPE_KEYNOTE;\n        isGzipped = true;\n        isKeynote1 = true;\n        info.input.reset(input->getSubStreamByName(\"presentation.apxl.gz\"));\n      }\n    }\n\n    if ((CHECK_TYPE_NUMBERS | CHECK_TYPE_PAGES) & checkTypes)\n    {\n      if (input->existsSubStream(\"index.xml\"))\n      {\n        checkTypes &= (CHECK_TYPE_NUMBERS | CHECK_TYPE_PAGES);\n        isGzipped = false;\n        info.input.reset(input->getSubStreamByName(\"index.xml\"));\n      }\n      else if (input->existsSubStream(\"index.xml.gz\"))\n      {\n        checkTypes &= (CHECK_TYPE_NUMBERS | CHECK_TYPE_PAGES);\n        isGzipped = false;\n        info.input.reset(input->getSubStreamByName(\"index.xml.gz\"));\n      }\n    }\n\n    if (!info.input && (CHECK_TYPE_ANY & checkTypes))\n    {\n      if (input->existsSubStream(\"Index.zip\"))\n      {\n        isXML = false;\n        info.input.reset(input->getSubStreamByName(\"Index.zip\"));\n      }\n    }\n\n    if (!info.input)\n    {\n      \/\/ nothing detected\n      \/\/ TODO: this might also be Index.zip...\n      return EtonyekDocument::CONFIDENCE_NONE;\n    }\n\n    info.confidence = EtonyekDocument::CONFIDENCE_EXCELLENT; \/\/ this is either a valid package of a false positive\n  }\n  else\n  {\n    info.input = input;\n  }\n\n  assert(bool(info.input));\n\n  if (isXML)\n  {\n    assert(CHECK_TYPE_ANY & checkTypes);\n    assert(!info.input->isStructured());\n\n    info.input->seek(0, RVNG_SEEK_SET);\n\n    if (CHECK_TYPE_KEYNOTE & checkTypes)\n    {\n      const ProbeXMLFun_t probe = (isKeynote1 ? probeKeynote1XML : ((!isKeynote1) ? probeKeynote2XML : probeKeynoteXML));\n      if (probeXML(probe, EtonyekDocument::TYPE_KEYNOTE, isGzipped, info))\n        return true;\n\n      info.input->seek(0, RVNG_SEEK_SET);\n    }\n\n    if (CHECK_TYPE_NUMBERS & checkTypes)\n    {\n      if (probeXML(probeNumbersXML, EtonyekDocument::TYPE_NUMBERS, isGzipped, info))\n        return true;\n\n      info.input->seek(0, RVNG_SEEK_SET);\n    }\n\n    if (CHECK_TYPE_PAGES & checkTypes)\n    {\n      if (probeXML(probePagesXML, EtonyekDocument::TYPE_PAGES, isGzipped, info))\n        return true;\n    }\n  }\n  else\n  {\n    \/\/ TODO: detect type in binary format\n  }\n\n  return EtonyekDocument::CONFIDENCE_NONE;\n}\n\n}\n\nnamespace\n{\n\nshared_ptr<IWORKParser> makeKeynoteParser(const unsigned version, const RVNGInputStreamPtr_t &input, const RVNGInputStreamPtr_t &package, KEYCollector *const collector, KEYDictionary &dict)\n{\n  shared_ptr<IWORKParser> parser;\n\n  if (1 == version)\n    parser.reset(new KEY1Parser(input, package, collector));\n  else if ((2 <= version) && (5 >= version))\n    parser.reset(new KEY2Parser(input, package, collector, dict));\n  else\n    assert(0);\n\n  return parser;\n}\n\n}\n\nETONYEKAPI EtonyekDocument::Confidence EtonyekDocument::isSupported(librevenge::RVNGInputStream *const input, EtonyekDocument::Type *type) try\n{\n  if (!input)\n    return CONFIDENCE_NONE;\n\n  if (type)\n    *type = TYPE_UNKNOWN;\n\n  DetectionInfo info;\n\n  if (detect(RVNGInputStreamPtr_t(input, EtonyekDummyDeleter()), CHECK_TYPE_ANY, info))\n  {\n    assert(TYPE_UNKNOWN != info.type);\n    assert(CONFIDENCE_NONE != info.confidence);\n    assert(bool(info.input));\n\n    if (type)\n      *type = info.type;\n    return info.confidence;\n  }\n\n  return CONFIDENCE_NONE;\n}\ncatch (...)\n{\n  return CONFIDENCE_NONE;\n}\n\nETONYEKAPI bool EtonyekDocument::parse(librevenge::RVNGInputStream *const input, librevenge::RVNGPresentationInterface *const generator) try\n{\n  if (!input || !generator)\n    return false;\n\n  DetectionInfo info;\n\n  if (!detect(RVNGInputStreamPtr_t(input, EtonyekDummyDeleter()), CHECK_TYPE_KEYNOTE, info))\n    return false;\n\n  assert(TYPE_UNKNOWN != info.type);\n  assert(CONFIDENCE_NONE != info.confidence);\n  assert(bool(info.input));\n  assert(0 != info.version);\n\n  info.input->seek(0, librevenge::RVNG_SEEK_SET);\n\n  KEYDictionary dict;\n  IWORKPresentationRedirector redirector(generator);\n  KEYCollector collector(&redirector);\n  const shared_ptr<IWORKParser> parser = makeKeynoteParser(info.version, info.input, info.package, &collector, dict);\n  return parser->parse();\n}\ncatch (...)\n{\n  return false;\n}\n\nETONYEKAPI bool EtonyekDocument::parse(librevenge::RVNGInputStream *const input, librevenge::RVNGSpreadsheetInterface *const document) try\n{\n  if (!input || !document)\n    return false;\n\n  DetectionInfo info;\n\n  if (!detect(RVNGInputStreamPtr_t(input, EtonyekDummyDeleter()), CHECK_TYPE_NUMBERS, info))\n    return false;\n\n  assert(TYPE_UNKNOWN != info.type);\n  assert(CONFIDENCE_NONE != info.confidence);\n  assert(bool(info.input));\n  assert(0 != info.version);\n\n  info.input->seek(0, librevenge::RVNG_SEEK_SET);\n\n  IWORKSpreadsheetRedirector redirector(document);\n  NUMCollector collector(&redirector);\n  NUMDictionary dict;\n  NUM1Parser parser(info.input, info.package, &collector, &dict);\n  return parser.parse();\n}\ncatch (...)\n{\n  return false;\n}\n\nETONYEKAPI bool EtonyekDocument::parse(librevenge::RVNGInputStream *const input, librevenge::RVNGTextInterface *const document) try\n{\n  if (!input || !document)\n    return false;\n\n  DetectionInfo info;\n\n  if (!detect(RVNGInputStreamPtr_t(input, EtonyekDummyDeleter()), CHECK_TYPE_PAGES, info))\n    return false;\n\n  assert(TYPE_UNKNOWN != info.type);\n  assert(CONFIDENCE_NONE != info.confidence);\n  assert(bool(info.input));\n  assert(0 != info.version);\n\n  info.input->seek(0, librevenge::RVNG_SEEK_SET);\n\n  IWORKTextRedirector redirector(document);\n  PAGCollector collector(&redirector);\n  PAGDictionary dict;\n  PAG1Parser parser(info.input, info.package, &collector, &dict);\n  return parser.parse();\n}\ncatch (...)\n{\n  return false;\n}\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/** \n * @file llstatemachine.cpp\n * @brief LLStateMachine implementation file.\n *\n * $LicenseInfo:firstyear=2001&license=viewergpl$\n * \n * Copyright (c) 2001-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab.  Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"linden_common.h\"\n\n#include \"llstatemachine.h\"\n#include \"llapr.h\"\n\n#define FSM_PRINT_STATE_TRANSITIONS (0)\n\nU32 LLUniqueID::sNextID = 0;\n\nbool\toperator==(const LLUniqueID &a, const LLUniqueID &b)\n{\n\treturn (a.mId == b.mId);\n}\n\nbool\toperator!=(const LLUniqueID &a, const LLUniqueID &b)\n{\n\treturn (a.mId != b.mId);\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ LLStateDiagram\n\/\/-----------------------------------------------------------------------------\nLLStateDiagram::LLStateDiagram()\n{\n\tmUseDefaultState = FALSE;\n}\n\nLLStateDiagram::~LLStateDiagram()\n{\n\n}\n\n\/\/ add a state to the state graph\nBOOL LLStateDiagram::addState(LLFSMState *state)\n{\n\tmStates[state] = Transitions();\n\treturn TRUE;\n}\n\n\/\/ add a directed transition between 2 states\nBOOL LLStateDiagram::addTransition(LLFSMState& start_state, LLFSMState& end_state, LLFSMTransition& transition)\n{\n\tStateMap::iterator state_it;\n\tstate_it = mStates.find(&start_state);\n\tTransitions* state_transitions = NULL;\n\tif (state_it == mStates.end() )\n\t{\n\t\taddState(&start_state);\n\t\tstate_transitions = &mStates[&start_state];\n\t}\n\telse\n\t{\n\t\tstate_transitions = &state_it->second;\n\t}\n\tstate_it = mStates.find(&end_state);\n\tif (state_it == mStates.end() )\n\t{\n\t\taddState(&end_state);\n\t}\n\n\tTransitions::iterator transition_it = state_transitions->find(&transition);\n\tif (transition_it != state_transitions->end())\n\t{\n\t\tllerrs << \"LLStateTable::addDirectedTransition() : transition already exists\" << llendl;\n\t\treturn FALSE; \/\/ transition already exists\n\t}\n\n\t(*state_transitions)[&transition] = &end_state;\n\treturn TRUE;\n}\n\n\/\/ add an undirected transition between 2 states\nBOOL LLStateDiagram::addUndirectedTransition(LLFSMState& start_state, LLFSMState& end_state, LLFSMTransition& transition)\n{\n\tBOOL result;\n\tresult = addTransition(start_state, end_state, transition);\n\tif (result)\n\t{\n\t\tresult = addTransition(end_state, start_state, transition);\n\t}\n\treturn result;\n}\n\n\/\/ add a transition that exists for every state\nvoid LLStateDiagram::addDefaultTransition(LLFSMState& end_state, LLFSMTransition& transition)\n{\n\tmDefaultTransitions[&transition] = &end_state;\n}\n\n\/\/ process a possible transition, and get the resulting state\nLLFSMState* LLStateDiagram::processTransition(LLFSMState& start_state, LLFSMTransition& transition)\n{\n\t\/\/ look up transition\n\t\/\/LLFSMState** dest_state = (mStates.getValue(&start_state))->getValue(&transition);\n\tLLFSMState* dest_state = NULL;\n\tStateMap::iterator state_it = mStates.find(&start_state);\n\tif (state_it == mStates.end())\n\t{\n\t\treturn NULL;\n\t}\n\tTransitions::iterator transition_it = state_it->second.find(&transition);\n\t\n\t\/\/ try default transitions if state-specific transition not found\n\tif (transition_it == state_it->second.end()) \n\t{\n\t\tdest_state = mDefaultTransitions[&transition];\n\t}\n\telse\n\t{\n\t\tdest_state = transition_it->second;\n\t}\n\n\t\/\/ if we have a destination state...\n\tif (NULL != dest_state)\n\t{\n\t\t\/\/ ...return it...\n\t\treturn dest_state;\n\t}\n\t\/\/ ... otherwise ...\n\telse\n\t{\n\t\t\/\/ ...look for default state...\n\t\tif (mUseDefaultState)\n\t\t{\n\t\t\t\/\/ ...return it if we have it...\n\t\t\treturn mDefaultState;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ ...or else we're still in the same state.\n\t\t\treturn &start_state;\n\t\t}\n\t}\n}\n\nvoid LLStateDiagram::setDefaultState(LLFSMState& default_state)\n{\n\tmUseDefaultState = TRUE;\n\tmDefaultState = &default_state;\n}\n\nS32 LLStateDiagram::numDeadendStates()\n{\n\tS32 numDeadends = 0;\n\tStateMap::iterator state_it;\n\tfor(state_it = mStates.begin(); state_it != mStates.end(); ++state_it)\n\t{\n\t\tif (state_it->second.size() == 0)\n\t\t{\n\t\t\tnumDeadends++;\n\t\t}\n\t}\n\treturn numDeadends;\n}\n\nBOOL LLStateDiagram::stateIsValid(LLFSMState& state)\n{\n\tif (mStates.find(&state) != mStates.end())\n\t{\n\t\treturn TRUE;\n\t}\n\treturn FALSE;\n}\n\nLLFSMState* LLStateDiagram::getState(U32 state_id)\n{\n\tStateMap::iterator state_it;\n\tfor(state_it = mStates.begin(); state_it != mStates.end(); ++state_it)\n\t{\n\t\tif (state_it->first->getID() == state_id)\n\t\t{\n\t\t\treturn state_it->first;\n\t\t}\n\t}\n\treturn NULL;\n}\n\nBOOL LLStateDiagram::saveDotFile(const std::string& filename)\n{\n\tLLAPRFile outfile ;\n\toutfile.open(filename, LL_APR_W);\n\tapr_file_t* dot_file = outfile.getFileHandle() ;\n\n\tif (!dot_file)\n\t{\n\t\tllwarns << \"LLStateDiagram::saveDotFile() : Couldn't open \" << filename << \" to save state diagram.\" << llendl;\n\t\treturn FALSE;\n\t}\n\tapr_file_printf(dot_file, \"digraph StateMachine {\\n\\tsize=\\\"100,100\\\";\\n\\tfontsize=40;\\n\\tlabel=\\\"Finite State Machine\\\";\\n\\torientation=landscape\\n\\tratio=.77\\n\");\n\t\n\tStateMap::iterator state_it;\n\tfor(state_it = mStates.begin(); state_it != mStates.end(); ++state_it)\n\t{\n\t\tapr_file_printf(dot_file, \"\\t\\\"%s\\\" [fontsize=28,shape=box]\\n\", state_it->first->getName().c_str());\n\t}\n\tapr_file_printf(dot_file, \"\\t\\\"All States\\\" [fontsize=30,style=bold,shape=box]\\n\");\n\n\tTransitions::iterator transitions_it;\n\tfor(transitions_it = mDefaultTransitions.begin(); transitions_it != mDefaultTransitions.end(); ++transitions_it)\n\t{\n\t\tapr_file_printf(dot_file, \"\\t\\\"All States\\\" -> \\\"%s\\\" [label = \\\"%s\\\",fontsize=24];\\n\", transitions_it->second->getName().c_str(), \n\t\t\ttransitions_it->second->getName().c_str());\n\t}\n\n\tif (mDefaultState)\n\t{\n\t\tapr_file_printf(dot_file, \"\\t\\\"All States\\\" -> \\\"%s\\\";\\n\", mDefaultState->getName().c_str());\n\t}\n\n\t\n\tfor(state_it = mStates.begin(); state_it != mStates.end(); ++state_it)\n\t{\n\t\tLLFSMState *state = state_it->first;\n\n\t\tTransitions::iterator transitions_it;\n\t\tfor(transitions_it = state_it->second.begin();\n\t\t\ttransitions_it != state_it->second.end();\n\t\t\t++transitions_it)\n\t\t{\n\t\t\tstd::string state_name = state->getName();\n\t\t\tstd::string target_name = transitions_it->second->getName();\n\t\t\tstd::string transition_name = transitions_it->first->getName();\n\t\t\tapr_file_printf(dot_file, \"\\t\\\"%s\\\" -> \\\"%s\\\" [label = \\\"%s\\\",fontsize=24];\\n\", state->getName().c_str(), \n\t\t\t\ttarget_name.c_str(), \n\t\t\t\ttransition_name.c_str());\n\t\t}\n\t}\n\n\tapr_file_printf(dot_file, \"}\\n\");\n\n\treturn TRUE;\n}\n\nstd::ostream& operator<<(std::ostream &s, LLStateDiagram &FSM)\n{\n\tif (FSM.mDefaultState)\n\t{\n\t\ts << \"Default State: \" << FSM.mDefaultState->getName() << \"\\n\";\n\t}\n\n\tLLStateDiagram::Transitions::iterator transitions_it;\n\tfor(transitions_it = FSM.mDefaultTransitions.begin(); \n\t\ttransitions_it != FSM.mDefaultTransitions.end(); \n\t\t++transitions_it)\n\t{\n\t\ts << \"Any State -- \" << transitions_it->first->getName()\n\t\t\t<< \" --> \" << transitions_it->second->getName() << \"\\n\";\n\t}\n\n\tLLStateDiagram::StateMap::iterator state_it;\n\tfor(state_it = FSM.mStates.begin(); state_it != FSM.mStates.end(); ++state_it)\n\t{\n\t\tLLStateDiagram::Transitions::iterator transitions_it;\n\t\tfor(transitions_it = state_it->second.begin();\n\t\t\ttransitions_it != state_it->second.end();\n\t\t\t++transitions_it)\n\t\t{\n\t\t\ts << state_it->first->getName() << \" -- \" << transitions_it->first->getName() \n\t\t\t\t<< \" --> \" << transitions_it->second->getName() << \"\\n\";\n\t\t}\n\t\ts << \"\\n\";\n\t}\n\n\treturn s;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ LLStateMachine\n\/\/-----------------------------------------------------------------------------\n\nLLStateMachine::LLStateMachine()\n{\n\t\/\/ we haven't received a starting state yet\n\tmCurrentState = NULL;\n\tmLastState = NULL;\n\tmLastTransition = NULL;\n\tmStateDiagram = NULL;\n}\n\nLLStateMachine::~LLStateMachine()\n{\n\n}\n\n\/\/ returns current state\nLLFSMState*\tLLStateMachine::getCurrentState() const\n{\n\treturn mCurrentState;\n}\n\n\/\/ executes current state\nvoid LLStateMachine::runCurrentState(void *data)\n{\n\tmCurrentState->execute(data);\n}\n\n\/\/ set current state\nBOOL LLStateMachine::setCurrentState(LLFSMState *initial_state, void* user_data, BOOL skip_entry)\n{\n\tllassert(mStateDiagram);\n\n\tif (mStateDiagram->stateIsValid(*initial_state))\n\t{\n\t\tmLastState = mCurrentState = initial_state;\n\t\tif (!skip_entry)\n\t\t{\n\t\t\tinitial_state->onEntry(user_data);\n\t\t}\n\t\treturn TRUE;\n\t}\n\n\treturn FALSE;\n}\n\nBOOL LLStateMachine::setCurrentState(U32 state_id, void* user_data, BOOL skip_entry)\n{\n\tllassert(mStateDiagram);\n\n\tLLFSMState* state = mStateDiagram->getState(state_id);\n\n\tif (state)\n\t{\n\t\tmLastState = mCurrentState = state;\n\t\tif (!skip_entry)\n\t\t{\n\t\t\tstate->onEntry(user_data);\n\t\t}\n\t\treturn TRUE;\n\t}\n\n\treturn FALSE;\n}\n\nvoid LLStateMachine::processTransition(LLFSMTransition& transition, void* user_data)\n{\n\tllassert(mStateDiagram);\n\t\n\tif (NULL == mCurrentState)\n\t{\n\t\tllwarns << \"mCurrentState == NULL; aborting processTransition()\" << llendl;\n\t\treturn;\n\t}\n\n\tLLFSMState* new_state = mStateDiagram->processTransition(*mCurrentState, transition);\n\n\tif (NULL == new_state)\n\t{\n\t\tllwarns << \"new_state == NULL; aborting processTransition()\" << llendl;\n\t\treturn;\n\t}\n\n\tmLastTransition = &transition;\n\tmLastState = mCurrentState;\n\n\tif (*mCurrentState != *new_state)\n\t{\n\t\tmCurrentState->onExit(user_data);\n\t\tmCurrentState = new_state;\n\t\tmCurrentState->onEntry(user_data);\n#if FSM_PRINT_STATE_TRANSITIONS\n\t\tllinfos << \"Entering state \" << mCurrentState->getName() <<\n\t\t\t\" on transition \" << transition.getName() << \" from state \" << \n\t\t\tmLastState->getName() << llendl;\n#endif\n\t}\n}\n\nvoid LLStateMachine::setStateDiagram(LLStateDiagram* diagram)\n{\n\tmStateDiagram = diagram;\n}\n<commit_msg>CID-333<commit_after>\/** \n * @file llstatemachine.cpp\n * @brief LLStateMachine implementation file.\n *\n * $LicenseInfo:firstyear=2001&license=viewergpl$\n * \n * Copyright (c) 2001-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab.  Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"linden_common.h\"\n\n#include \"llstatemachine.h\"\n#include \"llapr.h\"\n\n#define FSM_PRINT_STATE_TRANSITIONS (0)\n\nU32 LLUniqueID::sNextID = 0;\n\nbool\toperator==(const LLUniqueID &a, const LLUniqueID &b)\n{\n\treturn (a.mId == b.mId);\n}\n\nbool\toperator!=(const LLUniqueID &a, const LLUniqueID &b)\n{\n\treturn (a.mId != b.mId);\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ LLStateDiagram\n\/\/-----------------------------------------------------------------------------\nLLStateDiagram::LLStateDiagram()\n{\n\tmDefaultState = NULL;\n\tmUseDefaultState = FALSE;\n}\n\nLLStateDiagram::~LLStateDiagram()\n{\n\n}\n\n\/\/ add a state to the state graph\nBOOL LLStateDiagram::addState(LLFSMState *state)\n{\n\tmStates[state] = Transitions();\n\treturn TRUE;\n}\n\n\/\/ add a directed transition between 2 states\nBOOL LLStateDiagram::addTransition(LLFSMState& start_state, LLFSMState& end_state, LLFSMTransition& transition)\n{\n\tStateMap::iterator state_it;\n\tstate_it = mStates.find(&start_state);\n\tTransitions* state_transitions = NULL;\n\tif (state_it == mStates.end() )\n\t{\n\t\taddState(&start_state);\n\t\tstate_transitions = &mStates[&start_state];\n\t}\n\telse\n\t{\n\t\tstate_transitions = &state_it->second;\n\t}\n\tstate_it = mStates.find(&end_state);\n\tif (state_it == mStates.end() )\n\t{\n\t\taddState(&end_state);\n\t}\n\n\tTransitions::iterator transition_it = state_transitions->find(&transition);\n\tif (transition_it != state_transitions->end())\n\t{\n\t\tllerrs << \"LLStateTable::addDirectedTransition() : transition already exists\" << llendl;\n\t\treturn FALSE; \/\/ transition already exists\n\t}\n\n\t(*state_transitions)[&transition] = &end_state;\n\treturn TRUE;\n}\n\n\/\/ add an undirected transition between 2 states\nBOOL LLStateDiagram::addUndirectedTransition(LLFSMState& start_state, LLFSMState& end_state, LLFSMTransition& transition)\n{\n\tBOOL result;\n\tresult = addTransition(start_state, end_state, transition);\n\tif (result)\n\t{\n\t\tresult = addTransition(end_state, start_state, transition);\n\t}\n\treturn result;\n}\n\n\/\/ add a transition that exists for every state\nvoid LLStateDiagram::addDefaultTransition(LLFSMState& end_state, LLFSMTransition& transition)\n{\n\tmDefaultTransitions[&transition] = &end_state;\n}\n\n\/\/ process a possible transition, and get the resulting state\nLLFSMState* LLStateDiagram::processTransition(LLFSMState& start_state, LLFSMTransition& transition)\n{\n\t\/\/ look up transition\n\t\/\/LLFSMState** dest_state = (mStates.getValue(&start_state))->getValue(&transition);\n\tLLFSMState* dest_state = NULL;\n\tStateMap::iterator state_it = mStates.find(&start_state);\n\tif (state_it == mStates.end())\n\t{\n\t\treturn NULL;\n\t}\n\tTransitions::iterator transition_it = state_it->second.find(&transition);\n\t\n\t\/\/ try default transitions if state-specific transition not found\n\tif (transition_it == state_it->second.end()) \n\t{\n\t\tdest_state = mDefaultTransitions[&transition];\n\t}\n\telse\n\t{\n\t\tdest_state = transition_it->second;\n\t}\n\n\t\/\/ if we have a destination state...\n\tif (NULL != dest_state)\n\t{\n\t\t\/\/ ...return it...\n\t\treturn dest_state;\n\t}\n\t\/\/ ... otherwise ...\n\telse\n\t{\n\t\t\/\/ ...look for default state...\n\t\tif (mUseDefaultState)\n\t\t{\n\t\t\t\/\/ ...return it if we have it...\n\t\t\treturn mDefaultState;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ ...or else we're still in the same state.\n\t\t\treturn &start_state;\n\t\t}\n\t}\n}\n\nvoid LLStateDiagram::setDefaultState(LLFSMState& default_state)\n{\n\tmUseDefaultState = TRUE;\n\tmDefaultState = &default_state;\n}\n\nS32 LLStateDiagram::numDeadendStates()\n{\n\tS32 numDeadends = 0;\n\tStateMap::iterator state_it;\n\tfor(state_it = mStates.begin(); state_it != mStates.end(); ++state_it)\n\t{\n\t\tif (state_it->second.size() == 0)\n\t\t{\n\t\t\tnumDeadends++;\n\t\t}\n\t}\n\treturn numDeadends;\n}\n\nBOOL LLStateDiagram::stateIsValid(LLFSMState& state)\n{\n\tif (mStates.find(&state) != mStates.end())\n\t{\n\t\treturn TRUE;\n\t}\n\treturn FALSE;\n}\n\nLLFSMState* LLStateDiagram::getState(U32 state_id)\n{\n\tStateMap::iterator state_it;\n\tfor(state_it = mStates.begin(); state_it != mStates.end(); ++state_it)\n\t{\n\t\tif (state_it->first->getID() == state_id)\n\t\t{\n\t\t\treturn state_it->first;\n\t\t}\n\t}\n\treturn NULL;\n}\n\nBOOL LLStateDiagram::saveDotFile(const std::string& filename)\n{\n\tLLAPRFile outfile ;\n\toutfile.open(filename, LL_APR_W);\n\tapr_file_t* dot_file = outfile.getFileHandle() ;\n\n\tif (!dot_file)\n\t{\n\t\tllwarns << \"LLStateDiagram::saveDotFile() : Couldn't open \" << filename << \" to save state diagram.\" << llendl;\n\t\treturn FALSE;\n\t}\n\tapr_file_printf(dot_file, \"digraph StateMachine {\\n\\tsize=\\\"100,100\\\";\\n\\tfontsize=40;\\n\\tlabel=\\\"Finite State Machine\\\";\\n\\torientation=landscape\\n\\tratio=.77\\n\");\n\t\n\tStateMap::iterator state_it;\n\tfor(state_it = mStates.begin(); state_it != mStates.end(); ++state_it)\n\t{\n\t\tapr_file_printf(dot_file, \"\\t\\\"%s\\\" [fontsize=28,shape=box]\\n\", state_it->first->getName().c_str());\n\t}\n\tapr_file_printf(dot_file, \"\\t\\\"All States\\\" [fontsize=30,style=bold,shape=box]\\n\");\n\n\tTransitions::iterator transitions_it;\n\tfor(transitions_it = mDefaultTransitions.begin(); transitions_it != mDefaultTransitions.end(); ++transitions_it)\n\t{\n\t\tapr_file_printf(dot_file, \"\\t\\\"All States\\\" -> \\\"%s\\\" [label = \\\"%s\\\",fontsize=24];\\n\", transitions_it->second->getName().c_str(), \n\t\t\ttransitions_it->second->getName().c_str());\n\t}\n\n\tif (mDefaultState)\n\t{\n\t\tapr_file_printf(dot_file, \"\\t\\\"All States\\\" -> \\\"%s\\\";\\n\", mDefaultState->getName().c_str());\n\t}\n\n\t\n\tfor(state_it = mStates.begin(); state_it != mStates.end(); ++state_it)\n\t{\n\t\tLLFSMState *state = state_it->first;\n\n\t\tTransitions::iterator transitions_it;\n\t\tfor(transitions_it = state_it->second.begin();\n\t\t\ttransitions_it != state_it->second.end();\n\t\t\t++transitions_it)\n\t\t{\n\t\t\tstd::string state_name = state->getName();\n\t\t\tstd::string target_name = transitions_it->second->getName();\n\t\t\tstd::string transition_name = transitions_it->first->getName();\n\t\t\tapr_file_printf(dot_file, \"\\t\\\"%s\\\" -> \\\"%s\\\" [label = \\\"%s\\\",fontsize=24];\\n\", state->getName().c_str(), \n\t\t\t\ttarget_name.c_str(), \n\t\t\t\ttransition_name.c_str());\n\t\t}\n\t}\n\n\tapr_file_printf(dot_file, \"}\\n\");\n\n\treturn TRUE;\n}\n\nstd::ostream& operator<<(std::ostream &s, LLStateDiagram &FSM)\n{\n\tif (FSM.mDefaultState)\n\t{\n\t\ts << \"Default State: \" << FSM.mDefaultState->getName() << \"\\n\";\n\t}\n\n\tLLStateDiagram::Transitions::iterator transitions_it;\n\tfor(transitions_it = FSM.mDefaultTransitions.begin(); \n\t\ttransitions_it != FSM.mDefaultTransitions.end(); \n\t\t++transitions_it)\n\t{\n\t\ts << \"Any State -- \" << transitions_it->first->getName()\n\t\t\t<< \" --> \" << transitions_it->second->getName() << \"\\n\";\n\t}\n\n\tLLStateDiagram::StateMap::iterator state_it;\n\tfor(state_it = FSM.mStates.begin(); state_it != FSM.mStates.end(); ++state_it)\n\t{\n\t\tLLStateDiagram::Transitions::iterator transitions_it;\n\t\tfor(transitions_it = state_it->second.begin();\n\t\t\ttransitions_it != state_it->second.end();\n\t\t\t++transitions_it)\n\t\t{\n\t\t\ts << state_it->first->getName() << \" -- \" << transitions_it->first->getName() \n\t\t\t\t<< \" --> \" << transitions_it->second->getName() << \"\\n\";\n\t\t}\n\t\ts << \"\\n\";\n\t}\n\n\treturn s;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ LLStateMachine\n\/\/-----------------------------------------------------------------------------\n\nLLStateMachine::LLStateMachine()\n{\n\t\/\/ we haven't received a starting state yet\n\tmCurrentState = NULL;\n\tmLastState = NULL;\n\tmLastTransition = NULL;\n\tmStateDiagram = NULL;\n}\n\nLLStateMachine::~LLStateMachine()\n{\n\n}\n\n\/\/ returns current state\nLLFSMState*\tLLStateMachine::getCurrentState() const\n{\n\treturn mCurrentState;\n}\n\n\/\/ executes current state\nvoid LLStateMachine::runCurrentState(void *data)\n{\n\tmCurrentState->execute(data);\n}\n\n\/\/ set current state\nBOOL LLStateMachine::setCurrentState(LLFSMState *initial_state, void* user_data, BOOL skip_entry)\n{\n\tllassert(mStateDiagram);\n\n\tif (mStateDiagram->stateIsValid(*initial_state))\n\t{\n\t\tmLastState = mCurrentState = initial_state;\n\t\tif (!skip_entry)\n\t\t{\n\t\t\tinitial_state->onEntry(user_data);\n\t\t}\n\t\treturn TRUE;\n\t}\n\n\treturn FALSE;\n}\n\nBOOL LLStateMachine::setCurrentState(U32 state_id, void* user_data, BOOL skip_entry)\n{\n\tllassert(mStateDiagram);\n\n\tLLFSMState* state = mStateDiagram->getState(state_id);\n\n\tif (state)\n\t{\n\t\tmLastState = mCurrentState = state;\n\t\tif (!skip_entry)\n\t\t{\n\t\t\tstate->onEntry(user_data);\n\t\t}\n\t\treturn TRUE;\n\t}\n\n\treturn FALSE;\n}\n\nvoid LLStateMachine::processTransition(LLFSMTransition& transition, void* user_data)\n{\n\tllassert(mStateDiagram);\n\t\n\tif (NULL == mCurrentState)\n\t{\n\t\tllwarns << \"mCurrentState == NULL; aborting processTransition()\" << llendl;\n\t\treturn;\n\t}\n\n\tLLFSMState* new_state = mStateDiagram->processTransition(*mCurrentState, transition);\n\n\tif (NULL == new_state)\n\t{\n\t\tllwarns << \"new_state == NULL; aborting processTransition()\" << llendl;\n\t\treturn;\n\t}\n\n\tmLastTransition = &transition;\n\tmLastState = mCurrentState;\n\n\tif (*mCurrentState != *new_state)\n\t{\n\t\tmCurrentState->onExit(user_data);\n\t\tmCurrentState = new_state;\n\t\tmCurrentState->onEntry(user_data);\n#if FSM_PRINT_STATE_TRANSITIONS\n\t\tllinfos << \"Entering state \" << mCurrentState->getName() <<\n\t\t\t\" on transition \" << transition.getName() << \" from state \" << \n\t\t\tmLastState->getName() << llendl;\n#endif\n\t}\n}\n\nvoid LLStateMachine::setStateDiagram(LLStateDiagram* diagram)\n{\n\tmStateDiagram = diagram;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file   lllinstancetracker.cpp\n * \n * $LicenseInfo:firstyear=2009&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\/\/ Precompiled header\n#include \"linden_common.h\"\n\/\/ associated header\n#include \"llinstancetracker.h\"\n\/\/ STL headers\n\/\/ std headers\n\/\/ external library headers\n\/\/ other Linden headers\n\n\n<commit_msg>Trivial change to note that earlier changeset 27742 (1c3262183eb5) is a re-work of the LLInstanceTracker code done by Richard.    The commit comment is cryptic<commit_after>\/**\n * @file   lllinstancetracker.cpp\n * \n * $LicenseInfo:firstyear=2009&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\/\/ Precompiled header\n#include \"linden_common.h\"\n\/\/ associated header\n#include \"llinstancetracker.h\"\n\/\/ STL headers\n\/\/ std headers\n\/\/ external library headers\n\/\/ other Linden headers\n\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2005 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#include <osg\/DisplaySettings>\n#include <osg\/ArgumentParser>\n#include <osg\/ApplicationUsage>\n#include <osg\/ref_ptr>\n\n#include <algorithm>\n\nusing namespace osg;\nusing namespace std;\n\nDisplaySettings* DisplaySettings::instance()\n{\n    static ref_ptr<DisplaySettings> s_displaySettings = new DisplaySettings;\n    return s_displaySettings.get();\n}\n\nDisplaySettings::DisplaySettings(const DisplaySettings& vs):Referenced()\n{\n    setDisplaySettings(vs);\n}\n\nDisplaySettings::~DisplaySettings()\n{\n}\n\n \n DisplaySettings& DisplaySettings::operator = (const DisplaySettings& vs)\n{\n    if (this==&vs) return *this;\n    setDisplaySettings(vs);\n    return *this;\n}\n\nvoid DisplaySettings::setDisplaySettings(const DisplaySettings& vs)\n{\n    _displayType = vs._displayType;\n    _stereo = vs._stereo;\n    _stereoMode = vs._stereoMode;\n    _eyeSeparation = vs._eyeSeparation;\n    _screenWidth = vs._screenWidth;\n    _screenHeight = vs._screenHeight;\n    _screenDistance = vs._screenDistance;\n\n    _splitStereoHorizontalEyeMapping = vs._splitStereoHorizontalEyeMapping;\n    _splitStereoHorizontalSeparation = vs._splitStereoHorizontalSeparation;\n\n    _splitStereoVerticalEyeMapping = vs._splitStereoVerticalEyeMapping;\n    _splitStereoVerticalSeparation = vs._splitStereoVerticalSeparation;\n    \n    _splitStereoAutoAdjustAspectRatio = vs._splitStereoAutoAdjustAspectRatio;\n\n    _doubleBuffer = vs._doubleBuffer;\n    _RGB = vs._RGB;\n    _depthBuffer = vs._depthBuffer;\n    _minimumNumberAlphaBits = vs._minimumNumberAlphaBits;\n    _minimumNumberStencilBits = vs._minimumNumberStencilBits;\n\n    _maxNumOfGraphicsContexts = vs._maxNumOfGraphicsContexts;\n    _numMultiSamples = vs._numMultiSamples;\n}\n\nvoid DisplaySettings::merge(const DisplaySettings& vs)\n{\n    if (_stereo       || vs._stereo)        _stereo = true;\n    \n    \/\/ need to think what to do about merging the stereo mode.\n    \n    if (_doubleBuffer || vs._doubleBuffer)  _doubleBuffer = true;\n    if (_RGB          || vs._RGB)           _RGB = true;\n    if (_depthBuffer  || vs._depthBuffer)   _depthBuffer = true;\n    \n    if (vs._minimumNumberAlphaBits>_minimumNumberAlphaBits) _minimumNumberAlphaBits = vs._minimumNumberAlphaBits;\n    if (vs._minimumNumberStencilBits>_minimumNumberStencilBits) _minimumNumberStencilBits = vs._minimumNumberStencilBits;\n    if (vs._numMultiSamples>_numMultiSamples) _numMultiSamples = vs._numMultiSamples;\n}\n\nvoid DisplaySettings::setDefaults()\n{\n    _displayType = MONITOR;\n\n    _stereo = false;\n    _stereoMode = ANAGLYPHIC;\n    _eyeSeparation = 0.05f;\n    _screenWidth = 0.325f;\n    _screenHeight = 0.26f;\n    _screenDistance = 0.5f;\n\n    _splitStereoHorizontalEyeMapping = LEFT_EYE_LEFT_VIEWPORT;\n    _splitStereoHorizontalSeparation = 0;\n\n    _splitStereoVerticalEyeMapping = LEFT_EYE_TOP_VIEWPORT;\n    _splitStereoVerticalSeparation = 0;\n\n    _splitStereoAutoAdjustAspectRatio = true;\n\n    _doubleBuffer = true;\n    _RGB = true;\n    _depthBuffer = true;\n    _minimumNumberAlphaBits = 0;\n    _minimumNumberStencilBits = 0;\n    _minimumNumberAccumRedBits = 0;\n    _minimumNumberAccumGreenBits = 0;\n    _minimumNumberAccumBlueBits = 0;\n    _minimumNumberAccumAlphaBits = 0;\n    \n    _maxNumOfGraphicsContexts = 3;\n    _numMultiSamples = 0;\n\n    #ifdef __sgi\n    \/\/ switch on anti-aliasing by default, just in case we have an Onyx :-)\n    _numMultiSamples = 4;\n    #endif\n}\n\nvoid DisplaySettings::setMinimumNumAccumBits(unsigned int red, unsigned int green, unsigned int blue, unsigned int alpha)\n{\n    _minimumNumberAccumRedBits = red;\n    _minimumNumberAccumGreenBits = green;\n    _minimumNumberAccumBlueBits = blue;\n    _minimumNumberAccumAlphaBits = alpha;\n}\n\nstatic ApplicationUsageProxy DisplaySetting_e0(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_DISPLAY_TYPE <type>\",\"MONITOR | POWERWALL | REALITY_CENTER | HEAD_MOUNTED_DISPLAY\");\nstatic ApplicationUsageProxy DisplaySetting_e1(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_STEREO_MODE <mode>\",\"QUAD_BUFFER | ANAGLYPHIC | HORIZONTAL_SPLIT | VERTICAL_SPLIT | LEFT_EYE | RIGHT_EYE | VERTICAL_INTERLACE | HORIZONTAL_INTERLACE\");\nstatic ApplicationUsageProxy DisplaySetting_e2(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_STEREO <mode>\",\"OFF | ON\");\nstatic ApplicationUsageProxy DisplaySetting_e3(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_EYE_SEPARATION <float>\",\"physical distance between eyes\");\nstatic ApplicationUsageProxy DisplaySetting_e4(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_DISTANCE <float>\",\"physical distance between eyes and screen\");\nstatic ApplicationUsageProxy DisplaySetting_e5(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_HEIGHT <float>\",\"physical screen height\");\nstatic ApplicationUsageProxy DisplaySetting_e6(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_WIDTH <float>\",\"physical screen width\");\nstatic ApplicationUsageProxy DisplaySetting_e7(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_HORIZONTAL_EYE_MAPPING <mode>\",\"LEFT_EYE_LEFT_VIEWPORT | LEFT_EYE_RIGHT_VIEWPORT\");\nstatic ApplicationUsageProxy DisplaySetting_e8(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_HORIZONTAL_SEPARATION <float>\",\"number of pixels between viewports\");\nstatic ApplicationUsageProxy DisplaySetting_e9(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_VERTICAL_EYE_MAPPING <mode>\",\"LEFT_EYE_TOP_VIEWPORT | LEFT_EYE_BOTTOM_VIEWPORT\");\nstatic ApplicationUsageProxy DisplaySetting_e10(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_AUTO_ADJUST_ASPECT_RATIO <mode>\",\"OFF | ON  Default to ON to compenstate for the compression of the aspect ratio when viewing in split screen stereo.  Note, if you are setting fovx and fovy explicityly OFF should be used.\");\nstatic ApplicationUsageProxy DisplaySetting_e11(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_VERTICAL_SEPARATION <float>\",\"number of pixels between viewports\");\nstatic ApplicationUsageProxy DisplaySetting_e12(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_MAX_NUMBER_OF_GRAPHICS_CONTEXTS <int>\",\"maximum number of graphics contexts to be used with applications.\");\n\nvoid DisplaySettings::readEnvironmentalVariables()\n{\n    const char* ptr = 0;\n    \n    if ((ptr = getenv(\"OSG_DISPLAY_TYPE\")) != 0)\n    {\n        if (strcmp(ptr,\"MONITOR\")==0)\n        {\n            _displayType = MONITOR;\n        }\n        else\n        if (strcmp(ptr,\"POWERWALL\")==0)\n        {\n            _displayType = POWERWALL;\n        }\n        else\n        if (strcmp(ptr,\"REALITY_CENTER\")==0)\n        {\n            _displayType = REALITY_CENTER;\n        }\n        else\n        if (strcmp(ptr,\"HEAD_MOUNTED_DISPLAY\")==0)\n        {\n            _displayType = HEAD_MOUNTED_DISPLAY;\n        }\n    }\n    \n    if( (ptr = getenv(\"OSG_STEREO_MODE\")) != 0)\n    {\n        if (strcmp(ptr,\"QUAD_BUFFER\")==0)\n        {\n            _stereoMode = QUAD_BUFFER;\n        }\n        else if (strcmp(ptr,\"ANAGLYPHIC\")==0)\n        {\n            _stereoMode = ANAGLYPHIC;\n        }\n        else if (strcmp(ptr,\"HORIZONTAL_SPLIT\")==0)\n        {\n            _stereoMode = HORIZONTAL_SPLIT;\n        }\n        else if (strcmp(ptr,\"VERTICAL_SPLIT\")==0)\n        {\n            _stereoMode = VERTICAL_SPLIT;\n        }\n        else if (strcmp(ptr,\"LEFT_EYE\")==0)\n        {\n            _stereoMode = LEFT_EYE;\n        }\n        else if (strcmp(ptr,\"RIGHT_EYE\")==0)\n        {\n            _stereoMode = RIGHT_EYE;\n        }\n        else if (strcmp(ptr,\"HORIZONTAL_INTERLACE\")==0)\n        {\n            _stereoMode = HORIZONTAL_INTERLACE;\n        }\n        else if (strcmp(ptr,\"VERTICAL_INTERLACE\")==0)\n        {\n            _stereoMode = VERTICAL_INTERLACE;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_STEREO\")) != 0)\n    {\n        if (strcmp(ptr,\"OFF\")==0)\n        {\n            _stereo = false;\n        }\n        else\n        if (strcmp(ptr,\"ON\")==0)\n        {\n            _stereo = true;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_EYE_SEPARATION\")) != 0)\n    {\n        _eyeSeparation = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_WIDTH\")) != 0)\n    {\n        _screenWidth = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_HEIGHT\")) != 0)\n    {\n        _screenHeight = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_DISTANCE\")) != 0)\n    {\n        _screenDistance = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_HORIZONTAL_EYE_MAPPING\")) != 0)\n    {\n        if (strcmp(ptr,\"LEFT_EYE_LEFT_VIEWPORT\")==0)\n        {\n            _splitStereoHorizontalEyeMapping = LEFT_EYE_LEFT_VIEWPORT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE_RIGHT_VIEWPORT\")==0)\n        {\n            _splitStereoHorizontalEyeMapping = LEFT_EYE_RIGHT_VIEWPORT;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_HORIZONTAL_SEPARATION\")) != 0)\n    {\n        _splitStereoHorizontalSeparation = atoi(ptr);\n    }\n\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_VERTICAL_EYE_MAPPING\")) != 0)\n    {\n        if (strcmp(ptr,\"LEFT_EYE_TOP_VIEWPORT\")==0)\n        {\n            _splitStereoVerticalEyeMapping = LEFT_EYE_TOP_VIEWPORT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE_BOTTOM_VIEWPORT\")==0)\n        {\n            _splitStereoVerticalEyeMapping = LEFT_EYE_BOTTOM_VIEWPORT;\n        }\n    }\n    \n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_AUTO_ADJUST_ASPECT_RATIO\")) != 0)\n    {\n        if (strcmp(ptr,\"OFF\")==0)\n        {\n            _splitStereoAutoAdjustAspectRatio = false;\n        }\n        else\n        if (strcmp(ptr,\"ON\")==0)\n        {\n            _splitStereoAutoAdjustAspectRatio = true;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_VERTICAL_SEPARATION\")) != 0)\n    {\n        _splitStereoVerticalSeparation = atoi(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_MAX_NUMBER_OF_GRAPHICS_CONTEXTS\")) != 0)\n    {\n        _maxNumOfGraphicsContexts = atoi(ptr);\n    }\n}\n\nvoid DisplaySettings::readCommandLine(ArgumentParser& arguments)\n{\n\n    \/\/ report the usage options.\n    if (arguments.getApplicationUsage())\n    {\n        arguments.getApplicationUsage()->addCommandLineOption(\"--display <type>\",\"MONITOR | POWERWALL | REALITY_CENTER | HEAD_MOUNTED_DISPLAY\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stereo\",\"Use default stereo mode which is ANAGLYPHIC if not overriden by environmental variable\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stereo <mode>\",\"ANAGLYPHIC | QUAD_BUFFER | HORIZONTAL_SPLIT | VERTICAL_SPLIT | LEFT_EYE | RIGHT_EYE | ON | OFF \");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--rgba\",\"Request a RGBA color buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stencil\",\"Request a stencil buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--accum-rgb\",\"Request a rgb accumulator buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--accum-rgba\",\"Request a rgb accumulator buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--samples <num>\",\"Request a multisample visual\");\n    }\n\n    std::string str;\n    while(arguments.read(\"--display\",str))\n    {\n        if (str==\"MONITOR\") _displayType = MONITOR;\n        else if (str==\"POWERWALL\") _displayType = POWERWALL;\n        else if (str==\"REALITY_CENTER\") _displayType = REALITY_CENTER;\n        else if (str==\"HEAD_MOUNTED_DISPLAY\") _displayType = HEAD_MOUNTED_DISPLAY;\n    }\n\n    int pos;\n    while ((pos=arguments.find(\"--stereo\"))!=0)\n    {\n        if (arguments.match(pos+1,\"ANAGLYPHIC\"))            { arguments.remove(pos,2); _stereo = true;_stereoMode = ANAGLYPHIC; }\n        else if (arguments.match(pos+1,\"QUAD_BUFFER\"))      { arguments.remove(pos,2); _stereo = true;_stereoMode = QUAD_BUFFER; }\n        else if (arguments.match(pos+1,\"HORIZONTAL_SPLIT\")) { arguments.remove(pos,2); _stereo = true;_stereoMode = HORIZONTAL_SPLIT; }\n        else if (arguments.match(pos+1,\"VERTICAL_SPLIT\"))   { arguments.remove(pos,2); _stereo = true;_stereoMode = VERTICAL_SPLIT; }\n        else if (arguments.match(pos+1,\"HORIZONTAL_INTERLACE\")) { arguments.remove(pos,2); _stereo = true;_stereoMode = HORIZONTAL_INTERLACE; }\n        else if (arguments.match(pos+1,\"VERTICAL_INTERLACE\"))   { arguments.remove(pos,2); _stereo = true;_stereoMode = VERTICAL_INTERLACE; }\n        else if (arguments.match(pos+1,\"LEFT_EYE\"))         { arguments.remove(pos,2); _stereo = true;_stereoMode = LEFT_EYE; }\n        else if (arguments.match(pos+1,\"RIGHT_EYE\"))        { arguments.remove(pos,2); _stereo = true;_stereoMode = RIGHT_EYE; }\n        else if (arguments.match(pos+1,\"ON\"))               { arguments.remove(pos,2); _stereo = true; }\n        else if (arguments.match(pos+1,\"OFF\"))              { arguments.remove(pos,2); _stereo = false; }\n        else                                                { arguments.remove(pos); _stereo = true; }\n    }\n\n    while (arguments.read(\"--rgba\"))\n    {\n        _RGB = true;\n        _minimumNumberAlphaBits = 1;\n    }            \n\n    while (arguments.read(\"--stencil\"))\n    {\n        _minimumNumberStencilBits = 1;\n    }\n\n    while (arguments.read(\"--accum-rgb\"))\n    {\n        setMinimumNumAccumBits(8,8,8,0);\n    }\n\n    while (arguments.read(\"--accum-rgba\"))\n    {\n        setMinimumNumAccumBits(8,8,8,8);\n    }\n\n    while(arguments.read(\"--samples\",str))\n    {\n        _numMultiSamples = atoi(str.c_str());\n    }\n}\n<commit_msg>Reset the default number of graphics context to 1.<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2005 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#include <osg\/DisplaySettings>\n#include <osg\/ArgumentParser>\n#include <osg\/ApplicationUsage>\n#include <osg\/ref_ptr>\n\n#include <algorithm>\n\nusing namespace osg;\nusing namespace std;\n\nDisplaySettings* DisplaySettings::instance()\n{\n    static ref_ptr<DisplaySettings> s_displaySettings = new DisplaySettings;\n    return s_displaySettings.get();\n}\n\nDisplaySettings::DisplaySettings(const DisplaySettings& vs):Referenced()\n{\n    setDisplaySettings(vs);\n}\n\nDisplaySettings::~DisplaySettings()\n{\n}\n\n \n DisplaySettings& DisplaySettings::operator = (const DisplaySettings& vs)\n{\n    if (this==&vs) return *this;\n    setDisplaySettings(vs);\n    return *this;\n}\n\nvoid DisplaySettings::setDisplaySettings(const DisplaySettings& vs)\n{\n    _displayType = vs._displayType;\n    _stereo = vs._stereo;\n    _stereoMode = vs._stereoMode;\n    _eyeSeparation = vs._eyeSeparation;\n    _screenWidth = vs._screenWidth;\n    _screenHeight = vs._screenHeight;\n    _screenDistance = vs._screenDistance;\n\n    _splitStereoHorizontalEyeMapping = vs._splitStereoHorizontalEyeMapping;\n    _splitStereoHorizontalSeparation = vs._splitStereoHorizontalSeparation;\n\n    _splitStereoVerticalEyeMapping = vs._splitStereoVerticalEyeMapping;\n    _splitStereoVerticalSeparation = vs._splitStereoVerticalSeparation;\n    \n    _splitStereoAutoAdjustAspectRatio = vs._splitStereoAutoAdjustAspectRatio;\n\n    _doubleBuffer = vs._doubleBuffer;\n    _RGB = vs._RGB;\n    _depthBuffer = vs._depthBuffer;\n    _minimumNumberAlphaBits = vs._minimumNumberAlphaBits;\n    _minimumNumberStencilBits = vs._minimumNumberStencilBits;\n\n    _maxNumOfGraphicsContexts = vs._maxNumOfGraphicsContexts;\n    _numMultiSamples = vs._numMultiSamples;\n}\n\nvoid DisplaySettings::merge(const DisplaySettings& vs)\n{\n    if (_stereo       || vs._stereo)        _stereo = true;\n    \n    \/\/ need to think what to do about merging the stereo mode.\n    \n    if (_doubleBuffer || vs._doubleBuffer)  _doubleBuffer = true;\n    if (_RGB          || vs._RGB)           _RGB = true;\n    if (_depthBuffer  || vs._depthBuffer)   _depthBuffer = true;\n    \n    if (vs._minimumNumberAlphaBits>_minimumNumberAlphaBits) _minimumNumberAlphaBits = vs._minimumNumberAlphaBits;\n    if (vs._minimumNumberStencilBits>_minimumNumberStencilBits) _minimumNumberStencilBits = vs._minimumNumberStencilBits;\n    if (vs._numMultiSamples>_numMultiSamples) _numMultiSamples = vs._numMultiSamples;\n}\n\nvoid DisplaySettings::setDefaults()\n{\n    _displayType = MONITOR;\n\n    _stereo = false;\n    _stereoMode = ANAGLYPHIC;\n    _eyeSeparation = 0.05f;\n    _screenWidth = 0.325f;\n    _screenHeight = 0.26f;\n    _screenDistance = 0.5f;\n\n    _splitStereoHorizontalEyeMapping = LEFT_EYE_LEFT_VIEWPORT;\n    _splitStereoHorizontalSeparation = 0;\n\n    _splitStereoVerticalEyeMapping = LEFT_EYE_TOP_VIEWPORT;\n    _splitStereoVerticalSeparation = 0;\n\n    _splitStereoAutoAdjustAspectRatio = true;\n\n    _doubleBuffer = true;\n    _RGB = true;\n    _depthBuffer = true;\n    _minimumNumberAlphaBits = 0;\n    _minimumNumberStencilBits = 0;\n    _minimumNumberAccumRedBits = 0;\n    _minimumNumberAccumGreenBits = 0;\n    _minimumNumberAccumBlueBits = 0;\n    _minimumNumberAccumAlphaBits = 0;\n    \n    _maxNumOfGraphicsContexts = 1;\n    _numMultiSamples = 0;\n\n    #ifdef __sgi\n    \/\/ switch on anti-aliasing by default, just in case we have an Onyx :-)\n    _numMultiSamples = 4;\n    #endif\n}\n\nvoid DisplaySettings::setMinimumNumAccumBits(unsigned int red, unsigned int green, unsigned int blue, unsigned int alpha)\n{\n    _minimumNumberAccumRedBits = red;\n    _minimumNumberAccumGreenBits = green;\n    _minimumNumberAccumBlueBits = blue;\n    _minimumNumberAccumAlphaBits = alpha;\n}\n\nstatic ApplicationUsageProxy DisplaySetting_e0(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_DISPLAY_TYPE <type>\",\"MONITOR | POWERWALL | REALITY_CENTER | HEAD_MOUNTED_DISPLAY\");\nstatic ApplicationUsageProxy DisplaySetting_e1(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_STEREO_MODE <mode>\",\"QUAD_BUFFER | ANAGLYPHIC | HORIZONTAL_SPLIT | VERTICAL_SPLIT | LEFT_EYE | RIGHT_EYE | VERTICAL_INTERLACE | HORIZONTAL_INTERLACE\");\nstatic ApplicationUsageProxy DisplaySetting_e2(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_STEREO <mode>\",\"OFF | ON\");\nstatic ApplicationUsageProxy DisplaySetting_e3(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_EYE_SEPARATION <float>\",\"physical distance between eyes\");\nstatic ApplicationUsageProxy DisplaySetting_e4(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_DISTANCE <float>\",\"physical distance between eyes and screen\");\nstatic ApplicationUsageProxy DisplaySetting_e5(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_HEIGHT <float>\",\"physical screen height\");\nstatic ApplicationUsageProxy DisplaySetting_e6(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_WIDTH <float>\",\"physical screen width\");\nstatic ApplicationUsageProxy DisplaySetting_e7(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_HORIZONTAL_EYE_MAPPING <mode>\",\"LEFT_EYE_LEFT_VIEWPORT | LEFT_EYE_RIGHT_VIEWPORT\");\nstatic ApplicationUsageProxy DisplaySetting_e8(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_HORIZONTAL_SEPARATION <float>\",\"number of pixels between viewports\");\nstatic ApplicationUsageProxy DisplaySetting_e9(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_VERTICAL_EYE_MAPPING <mode>\",\"LEFT_EYE_TOP_VIEWPORT | LEFT_EYE_BOTTOM_VIEWPORT\");\nstatic ApplicationUsageProxy DisplaySetting_e10(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_AUTO_ADJUST_ASPECT_RATIO <mode>\",\"OFF | ON  Default to ON to compenstate for the compression of the aspect ratio when viewing in split screen stereo.  Note, if you are setting fovx and fovy explicityly OFF should be used.\");\nstatic ApplicationUsageProxy DisplaySetting_e11(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_VERTICAL_SEPARATION <float>\",\"number of pixels between viewports\");\nstatic ApplicationUsageProxy DisplaySetting_e12(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_MAX_NUMBER_OF_GRAPHICS_CONTEXTS <int>\",\"maximum number of graphics contexts to be used with applications.\");\n\nvoid DisplaySettings::readEnvironmentalVariables()\n{\n    const char* ptr = 0;\n    \n    if ((ptr = getenv(\"OSG_DISPLAY_TYPE\")) != 0)\n    {\n        if (strcmp(ptr,\"MONITOR\")==0)\n        {\n            _displayType = MONITOR;\n        }\n        else\n        if (strcmp(ptr,\"POWERWALL\")==0)\n        {\n            _displayType = POWERWALL;\n        }\n        else\n        if (strcmp(ptr,\"REALITY_CENTER\")==0)\n        {\n            _displayType = REALITY_CENTER;\n        }\n        else\n        if (strcmp(ptr,\"HEAD_MOUNTED_DISPLAY\")==0)\n        {\n            _displayType = HEAD_MOUNTED_DISPLAY;\n        }\n    }\n    \n    if( (ptr = getenv(\"OSG_STEREO_MODE\")) != 0)\n    {\n        if (strcmp(ptr,\"QUAD_BUFFER\")==0)\n        {\n            _stereoMode = QUAD_BUFFER;\n        }\n        else if (strcmp(ptr,\"ANAGLYPHIC\")==0)\n        {\n            _stereoMode = ANAGLYPHIC;\n        }\n        else if (strcmp(ptr,\"HORIZONTAL_SPLIT\")==0)\n        {\n            _stereoMode = HORIZONTAL_SPLIT;\n        }\n        else if (strcmp(ptr,\"VERTICAL_SPLIT\")==0)\n        {\n            _stereoMode = VERTICAL_SPLIT;\n        }\n        else if (strcmp(ptr,\"LEFT_EYE\")==0)\n        {\n            _stereoMode = LEFT_EYE;\n        }\n        else if (strcmp(ptr,\"RIGHT_EYE\")==0)\n        {\n            _stereoMode = RIGHT_EYE;\n        }\n        else if (strcmp(ptr,\"HORIZONTAL_INTERLACE\")==0)\n        {\n            _stereoMode = HORIZONTAL_INTERLACE;\n        }\n        else if (strcmp(ptr,\"VERTICAL_INTERLACE\")==0)\n        {\n            _stereoMode = VERTICAL_INTERLACE;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_STEREO\")) != 0)\n    {\n        if (strcmp(ptr,\"OFF\")==0)\n        {\n            _stereo = false;\n        }\n        else\n        if (strcmp(ptr,\"ON\")==0)\n        {\n            _stereo = true;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_EYE_SEPARATION\")) != 0)\n    {\n        _eyeSeparation = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_WIDTH\")) != 0)\n    {\n        _screenWidth = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_HEIGHT\")) != 0)\n    {\n        _screenHeight = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_DISTANCE\")) != 0)\n    {\n        _screenDistance = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_HORIZONTAL_EYE_MAPPING\")) != 0)\n    {\n        if (strcmp(ptr,\"LEFT_EYE_LEFT_VIEWPORT\")==0)\n        {\n            _splitStereoHorizontalEyeMapping = LEFT_EYE_LEFT_VIEWPORT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE_RIGHT_VIEWPORT\")==0)\n        {\n            _splitStereoHorizontalEyeMapping = LEFT_EYE_RIGHT_VIEWPORT;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_HORIZONTAL_SEPARATION\")) != 0)\n    {\n        _splitStereoHorizontalSeparation = atoi(ptr);\n    }\n\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_VERTICAL_EYE_MAPPING\")) != 0)\n    {\n        if (strcmp(ptr,\"LEFT_EYE_TOP_VIEWPORT\")==0)\n        {\n            _splitStereoVerticalEyeMapping = LEFT_EYE_TOP_VIEWPORT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE_BOTTOM_VIEWPORT\")==0)\n        {\n            _splitStereoVerticalEyeMapping = LEFT_EYE_BOTTOM_VIEWPORT;\n        }\n    }\n    \n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_AUTO_ADJUST_ASPECT_RATIO\")) != 0)\n    {\n        if (strcmp(ptr,\"OFF\")==0)\n        {\n            _splitStereoAutoAdjustAspectRatio = false;\n        }\n        else\n        if (strcmp(ptr,\"ON\")==0)\n        {\n            _splitStereoAutoAdjustAspectRatio = true;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_VERTICAL_SEPARATION\")) != 0)\n    {\n        _splitStereoVerticalSeparation = atoi(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_MAX_NUMBER_OF_GRAPHICS_CONTEXTS\")) != 0)\n    {\n        _maxNumOfGraphicsContexts = atoi(ptr);\n    }\n}\n\nvoid DisplaySettings::readCommandLine(ArgumentParser& arguments)\n{\n\n    \/\/ report the usage options.\n    if (arguments.getApplicationUsage())\n    {\n        arguments.getApplicationUsage()->addCommandLineOption(\"--display <type>\",\"MONITOR | POWERWALL | REALITY_CENTER | HEAD_MOUNTED_DISPLAY\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stereo\",\"Use default stereo mode which is ANAGLYPHIC if not overriden by environmental variable\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stereo <mode>\",\"ANAGLYPHIC | QUAD_BUFFER | HORIZONTAL_SPLIT | VERTICAL_SPLIT | LEFT_EYE | RIGHT_EYE | ON | OFF \");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--rgba\",\"Request a RGBA color buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stencil\",\"Request a stencil buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--accum-rgb\",\"Request a rgb accumulator buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--accum-rgba\",\"Request a rgb accumulator buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--samples <num>\",\"Request a multisample visual\");\n    }\n\n    std::string str;\n    while(arguments.read(\"--display\",str))\n    {\n        if (str==\"MONITOR\") _displayType = MONITOR;\n        else if (str==\"POWERWALL\") _displayType = POWERWALL;\n        else if (str==\"REALITY_CENTER\") _displayType = REALITY_CENTER;\n        else if (str==\"HEAD_MOUNTED_DISPLAY\") _displayType = HEAD_MOUNTED_DISPLAY;\n    }\n\n    int pos;\n    while ((pos=arguments.find(\"--stereo\"))!=0)\n    {\n        if (arguments.match(pos+1,\"ANAGLYPHIC\"))            { arguments.remove(pos,2); _stereo = true;_stereoMode = ANAGLYPHIC; }\n        else if (arguments.match(pos+1,\"QUAD_BUFFER\"))      { arguments.remove(pos,2); _stereo = true;_stereoMode = QUAD_BUFFER; }\n        else if (arguments.match(pos+1,\"HORIZONTAL_SPLIT\")) { arguments.remove(pos,2); _stereo = true;_stereoMode = HORIZONTAL_SPLIT; }\n        else if (arguments.match(pos+1,\"VERTICAL_SPLIT\"))   { arguments.remove(pos,2); _stereo = true;_stereoMode = VERTICAL_SPLIT; }\n        else if (arguments.match(pos+1,\"HORIZONTAL_INTERLACE\")) { arguments.remove(pos,2); _stereo = true;_stereoMode = HORIZONTAL_INTERLACE; }\n        else if (arguments.match(pos+1,\"VERTICAL_INTERLACE\"))   { arguments.remove(pos,2); _stereo = true;_stereoMode = VERTICAL_INTERLACE; }\n        else if (arguments.match(pos+1,\"LEFT_EYE\"))         { arguments.remove(pos,2); _stereo = true;_stereoMode = LEFT_EYE; }\n        else if (arguments.match(pos+1,\"RIGHT_EYE\"))        { arguments.remove(pos,2); _stereo = true;_stereoMode = RIGHT_EYE; }\n        else if (arguments.match(pos+1,\"ON\"))               { arguments.remove(pos,2); _stereo = true; }\n        else if (arguments.match(pos+1,\"OFF\"))              { arguments.remove(pos,2); _stereo = false; }\n        else                                                { arguments.remove(pos); _stereo = true; }\n    }\n\n    while (arguments.read(\"--rgba\"))\n    {\n        _RGB = true;\n        _minimumNumberAlphaBits = 1;\n    }            \n\n    while (arguments.read(\"--stencil\"))\n    {\n        _minimumNumberStencilBits = 1;\n    }\n\n    while (arguments.read(\"--accum-rgb\"))\n    {\n        setMinimumNumAccumBits(8,8,8,0);\n    }\n\n    while (arguments.read(\"--accum-rgba\"))\n    {\n        setMinimumNumAccumBits(8,8,8,8);\n    }\n\n    while(arguments.read(\"--samples\",str))\n    {\n        _numMultiSamples = atoi(str.c_str());\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sys\/socket.h>\n\n#include <common\/buffer.h>\n\n#include <event\/action.h>\n#include <event\/callback.h>\n#include <event\/event_system.h>\n\n#include <io\/file_descriptor.h>\n#include <io\/socket.h>\n#include <io\/unix_server.h>\n\nUnixServer *\nUnixServer::listen(const std::string& name)\n{\n\tSocket *socket = Socket::create(SocketAddressFamilyUnix, SocketTypeStream, \"\");\n\tif (socket == NULL) {\n\t\tERROR(\"\/unix\/server\") << \"Unable to create socket.\";\n\t\treturn (NULL);\n\t}\n\t\/*\n\t * XXX\n\t * After this we could leak a socket, sigh.  Need a blocking close, or\n\t * a pool to return the socket to.\n\t *\/\n\tif (!socket->bind(name)) {\n\t\tERROR(\"\/unix\/server\") << \"Socket bind failed, leaking socket.\";\n\t\treturn (NULL);\n\t}\n\tif (!socket->listen(10)) {\n\t\tERROR(\"\/unix\/server\") << \"Socket listen failed, leaking socket.\";\n\t\treturn (NULL);\n\t}\n\tUnixServer *server = new UnixServer(socket);\n\treturn (server);\n}\n<commit_msg>Remove unused include.<commit_after>#include <common\/buffer.h>\n\n#include <event\/action.h>\n#include <event\/callback.h>\n#include <event\/event_system.h>\n\n#include <io\/file_descriptor.h>\n#include <io\/socket.h>\n#include <io\/unix_server.h>\n\nUnixServer *\nUnixServer::listen(const std::string& name)\n{\n\tSocket *socket = Socket::create(SocketAddressFamilyUnix, SocketTypeStream, \"\");\n\tif (socket == NULL) {\n\t\tERROR(\"\/unix\/server\") << \"Unable to create socket.\";\n\t\treturn (NULL);\n\t}\n\t\/*\n\t * XXX\n\t * After this we could leak a socket, sigh.  Need a blocking close, or\n\t * a pool to return the socket to.\n\t *\/\n\tif (!socket->bind(name)) {\n\t\tERROR(\"\/unix\/server\") << \"Socket bind failed, leaking socket.\";\n\t\treturn (NULL);\n\t}\n\tif (!socket->listen(10)) {\n\t\tERROR(\"\/unix\/server\") << \"Socket listen failed, leaking socket.\";\n\t\treturn (NULL);\n\t}\n\tUnixServer *server = new UnixServer(socket);\n\treturn (server);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/auth:$Id$\n\/\/ Author: G. Ganis   08\/07\/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\/\/ TRootSecContext                                                      \/\/\n\/\/                                                                      \/\/\n\/\/ Special implementation of TSecContext                                \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"RConfigure.h\"\n\n#include <stdlib.h>\n\n#include \"TError.h\"\n#include \"TRootSecContext.h\"\n#include \"TROOT.h\"\n#include \"TSocket.h\"\n#include \"TUrl.h\"\n#include \"TVirtualMutex.h\"\n\nClassImp(TRootSecContext)\n\n\/\/______________________________________________________________________________\n   TRootSecContext::TRootSecContext(const char *user, const char *host, Int_t meth,\n                                    Int_t offset, const char *id,\n                                    const char *token, TDatime expdate,\n                                    void *ctx, Int_t key)\n      : TSecContext(user, host, meth, offset, id, token, expdate, ctx)\n{\n   \/\/ Ctor for SecContext object.\n   R__ASSERT(gROOT);\n\n   fRSAKey  = key;\n   fMethodName = TAuthenticate::GetAuthMethod(fMethod);\n}\n\n\/\/______________________________________________________________________________\nTRootSecContext::TRootSecContext(const char *url, Int_t meth, Int_t offset,\n                                 const char *id, const char *token,\n                                 TDatime expdate, void *ctx, Int_t key)\n   : TSecContext(url, meth, offset, id, token, expdate, ctx)\n{\n   \/\/ Ctor for SecContext object.\n   \/\/ User and host from url = user@host .\n   R__ASSERT(gROOT);\n\n   fRSAKey  = key;\n   fMethodName = TAuthenticate::GetAuthMethod(fMethod);\n}\n\n\/\/______________________________________________________________________________\nTRootSecContext::~TRootSecContext()\n{\n   \/\/ Dtor: delete (deActivate, local\/remote cleanup, list removal)\n   \/\/ all what is still active\n\n   TSecContext::Cleanup();\n}\n\n\/\/______________________________________________________________________________\nvoid TRootSecContext::DeActivate(Option_t *Opt)\n{\n   \/\/ Set OffSet to -1 and expiring Date to default\n   \/\/ Remove from the list\n   \/\/ If globus, cleanup local stuff\n   \/\/ If Opt contains \"C\" or \"c\", ask for remote cleanup\n   \/\/ If Opt contains \"R\" or \"r\", remove from the list\n   \/\/ Default Opt=\"CR\"\n\n   \/\/ Ask remote cleanup of this context\n   Bool_t clean = (strstr(Opt,\"C\") || strstr(Opt,\"c\"));\n   if (clean && fOffSet > -1)\n      CleanupSecContext(kFALSE);\n\n   \/\/ Cleanup TPwdCtx object fro UsrPwd and SRP\n   if (fMethod == TAuthenticate::kClear ||\n       fMethod == TAuthenticate::kSRP)\n      if (fContext) {\n         delete (TPwdCtx *)fContext;\n         fContext = 0;\n      }\n\n   \/\/ Cleanup globus security context if needed\n   if (fMethod == TAuthenticate::kGlobus && fContext) {\n      GlobusAuth_t globusAuthHook = TAuthenticate::GetGlobusAuthHook();\n      if (globusAuthHook != 0) {\n         TString det(\"context\");\n         TString us(\"-1\");\n         (*globusAuthHook)((TAuthenticate *)fContext,us,det);\n         fContext = 0;\n      }\n   }\n\n   Bool_t remove = (strstr(Opt,\"R\") || strstr(Opt,\"r\"));\n   if (remove && fOffSet > -1){\n      R__LOCKGUARD2(gROOTMutex);\n      \/\/ Remove from the global list\n      gROOT->GetListOfSecContexts()->Remove(this);\n      \/\/ Remove also from local lists in THostAuth objects\n      TAuthenticate::RemoveSecContext(this);\n   }\n\n   \/\/ Set inactive\n   fOffSet  = -1;\n   fExpDate = kROOTTZERO;\n\n}\n\n\/\/______________________________________________________________________________\nBool_t TRootSecContext::CleanupSecContext(Bool_t all)\n{\n   \/\/ Ask remote client to cleanup security context 'ctx'\n   \/\/ If 'all', all sec context with the same host as ctx\n   \/\/ are cleaned.\n   Bool_t cleaned = kFALSE;\n\n   \/\/ Nothing to do if inactive ...\n   if (!IsActive())\n      return kTRUE;\n\n   \/\/ Contact remote services that used this context,\n   \/\/ starting from the last ...\n   TIter last(fCleanup,kIterBackward);\n   TSecContextCleanup *nscc = 0;\n   while ((nscc = (TSecContextCleanup *)last()) && !cleaned) {\n\n      \/\/ First check if remote daemon supports cleaning\n      Int_t srvtyp = nscc->GetType();\n      Int_t rproto = nscc->GetProtocol();\n      Int_t level = 2;\n      if ((srvtyp == TSocket::kROOTD && rproto < 10) ||\n          (srvtyp == TSocket::kPROOFD && rproto < 9))\n         level = 1;\n      if ((srvtyp == TSocket::kROOTD && rproto < 8) ||\n          (srvtyp == TSocket::kPROOFD && rproto < 7))\n         level = 0;\n      if (level) {\n         Int_t port = nscc->GetPort();\n\n         TSocket *news = new TSocket(fHost.Data(),port,-1);\n\n         if (news && news->IsValid()) {\n            if (srvtyp == TSocket::kPROOFD) {\n               news->SetOption(kNoDelay, 1);\n               news->Send(\"cleaning request\");\n            } else\n               news->SetOption(kNoDelay, 0);\n\n            \/\/ Backward compatibility: send socket size\n            if (srvtyp == TSocket::kROOTD && level == 1)\n               news->Send((Int_t)0, (Int_t)0);\n\n            if (all || level == 1) {\n               news->Send(Form(\"%d\",TAuthenticate::fgProcessID), kROOTD_CLEANUP);\n               cleaned = kTRUE;\n            } else {\n               news->Send(Form(\"%d %d %d %s\", TAuthenticate::fgProcessID, fMethod,\n                               fOffSet, fUser.Data()), kROOTD_CLEANUP);\n               if (TAuthenticate::SecureSend(news, 1, fRSAKey,\n                                             (char *)(fToken.Data())) == -1) {\n                  Info(\"CleanupSecContext\", \"problems secure-sending token\");\n               } else {\n                  cleaned = kTRUE;\n               }\n            }\n            if (cleaned && gDebug > 2) {\n               char srvname[3][10] = {\"sockd\", \"rootd\", \"proofd\"};\n               Info(\"CleanupSecContext\",\n                    \"remote %s notified for cleanup (%s,%d)\",\n                    srvname[srvtyp],fHost.Data(),port);\n            }\n         }\n         SafeDelete(news);\n      }\n   }\n\n   if (!cleaned)\n      if (gDebug > 2)\n         Info(\"CleanupSecContext\",\n              \"unable to open valid socket for cleanup for %s\", fHost.Data());\n\n   return cleaned;\n}\n\n\/\/______________________________________________________________________________\nvoid TRootSecContext::Print(Option_t *opt) const\n{\n   \/\/ If opt is \"F\" (default) print object content.\n   \/\/ If opt is \"<number>\" print in special form for calls within THostAuth\n   \/\/ with cardinality <number>\n   \/\/ If opt is \"S\" prints short in-line form for calls within TFTP,\n   \/\/ TSlave, TProof ...\n\n   char cord[10] = {0};\n   char cspc[10] = {0};\n\n   \/\/ Check if option is numeric\n   Int_t ord = -1, i = 0;\n   for (; i < (Int_t)strlen(opt); i++) {\n      if (opt[i] < 48 || opt[i] > 57) {\n         ord = -2;\n         break;\n      }\n   }\n   \/\/ If numeric get the cardinality and prepare the strings\n   if (ord == -1)\n      ord = atoi(opt);\n\n   \/\/ If asked to print ordinal number, preapre the string\n   if (ord > -1) {\n      snprintf(cord,10,\"%d)\",ord);\n      \/\/ and take care of alignment\n      Int_t len=strlen(cord);\n      while (len--)\n         strncat(cspc,\" \",10);\n   }\n\n   if (!strncasecmp(opt,\"F\",1)) {\n      Info(\"Print\",\n           \"+------------------------------------------------------+\");\n      Info(\"Print\",\n           \"+ Host:%s Method:%d (%s) User:'%s'\",\n           GetHost(), fMethod, GetMethodName(),\n           fUser.Data());\n      Info(\"Print\",\n           \"+         OffSet:%d Id: '%s'\", fOffSet, fID.Data());\n      if (fOffSet > -1)\n         Info(\"Print\",\n              \"+         Expiration time: %s\",fExpDate.AsString());\n      Info(\"Print\",\n           \"+------------------------------------------------------+\");\n   } else if (!strncasecmp(opt,\"S\",1)) {\n      if (fOffSet > -1) {\n         if (fID.BeginsWith(\"AFS\"))\n            Printf(\"Security context:     Method: AFS, not reusable\");\n         else\n            Printf(\"Security context:     Method: %d (%s) expiring on %s\",\n                   fMethod, GetMethodName(),\n                   fExpDate.AsString());\n      } else {\n         Printf(\"Security context:     Method: %d (%s) not reusable\",\n                fMethod, GetMethodName());\n      }\n   } else {\n      \/\/ special printing form for THostAuth\n      Info(\"PrintEstblshed\",\"+ %s h:%s met:%d (%s) us:'%s'\",\n           cord, GetHost(), fMethod, GetMethodName(),\n           fUser.Data());\n      Info(\"PrintEstblshed\",\"+ %s offset:%d id: '%s'\",\n           cspc, fOffSet, fID.Data());\n      if (fOffSet > -1)\n         Info(\"PrintEstblshed\",\"+ %s expiring: %s\",cspc,fExpDate.AsString());\n   }\n}\n\n\/\/______________________________________________________________________________\nconst char *TRootSecContext::AsString(TString &out)\n{\n   \/\/ Returns short string with relevant information about this\n   \/\/ security context\n\n   if (fOffSet > -1) {\n      if (fID.BeginsWith(\"AFS\"))\n         out = Form(\"Method: AFS, not reusable\");\n      else {\n         char expdate[32];\n         out = Form(\"Method: %d (%s) expiring on %s\",\n                    fMethod, GetMethodName(), fExpDate.AsString(expdate));\n      }\n   } else {\n      if (fOffSet == -1)\n         out = Form(\"Method: %d (%s) not reusable\", fMethod, GetMethodName());\n      else if (fOffSet == -3)\n         out = Form(\"Method: %d (%s) authorized by \/etc\/hosts.equiv or $HOME\/.rhosts\",\n                    fMethod, GetMethodName());\n      else if (fOffSet == -4)\n         out = Form(\"No authentication required remotely\");\n   }\n   return out.Data();\n}\n<commit_msg>Optimize use of strings in TRootSecContext::Print<commit_after>\/\/ @(#)root\/auth:$Id$\n\/\/ Author: G. Ganis   08\/07\/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\/\/ TRootSecContext                                                      \/\/\n\/\/                                                                      \/\/\n\/\/ Special implementation of TSecContext                                \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"RConfigure.h\"\n\n#include <stdlib.h>\n\n#include \"TError.h\"\n#include \"TRootSecContext.h\"\n#include \"TROOT.h\"\n#include \"TSocket.h\"\n#include \"TUrl.h\"\n#include \"TVirtualMutex.h\"\n\nClassImp(TRootSecContext)\n\n\/\/______________________________________________________________________________\n   TRootSecContext::TRootSecContext(const char *user, const char *host, Int_t meth,\n                                    Int_t offset, const char *id,\n                                    const char *token, TDatime expdate,\n                                    void *ctx, Int_t key)\n      : TSecContext(user, host, meth, offset, id, token, expdate, ctx)\n{\n   \/\/ Ctor for SecContext object.\n   R__ASSERT(gROOT);\n\n   fRSAKey  = key;\n   fMethodName = TAuthenticate::GetAuthMethod(fMethod);\n}\n\n\/\/______________________________________________________________________________\nTRootSecContext::TRootSecContext(const char *url, Int_t meth, Int_t offset,\n                                 const char *id, const char *token,\n                                 TDatime expdate, void *ctx, Int_t key)\n   : TSecContext(url, meth, offset, id, token, expdate, ctx)\n{\n   \/\/ Ctor for SecContext object.\n   \/\/ User and host from url = user@host .\n   R__ASSERT(gROOT);\n\n   fRSAKey  = key;\n   fMethodName = TAuthenticate::GetAuthMethod(fMethod);\n}\n\n\/\/______________________________________________________________________________\nTRootSecContext::~TRootSecContext()\n{\n   \/\/ Dtor: delete (deActivate, local\/remote cleanup, list removal)\n   \/\/ all what is still active\n\n   TSecContext::Cleanup();\n}\n\n\/\/______________________________________________________________________________\nvoid TRootSecContext::DeActivate(Option_t *Opt)\n{\n   \/\/ Set OffSet to -1 and expiring Date to default\n   \/\/ Remove from the list\n   \/\/ If globus, cleanup local stuff\n   \/\/ If Opt contains \"C\" or \"c\", ask for remote cleanup\n   \/\/ If Opt contains \"R\" or \"r\", remove from the list\n   \/\/ Default Opt=\"CR\"\n\n   \/\/ Ask remote cleanup of this context\n   Bool_t clean = (strstr(Opt,\"C\") || strstr(Opt,\"c\"));\n   if (clean && fOffSet > -1)\n      CleanupSecContext(kFALSE);\n\n   \/\/ Cleanup TPwdCtx object fro UsrPwd and SRP\n   if (fMethod == TAuthenticate::kClear ||\n       fMethod == TAuthenticate::kSRP)\n      if (fContext) {\n         delete (TPwdCtx *)fContext;\n         fContext = 0;\n      }\n\n   \/\/ Cleanup globus security context if needed\n   if (fMethod == TAuthenticate::kGlobus && fContext) {\n      GlobusAuth_t globusAuthHook = TAuthenticate::GetGlobusAuthHook();\n      if (globusAuthHook != 0) {\n         TString det(\"context\");\n         TString us(\"-1\");\n         (*globusAuthHook)((TAuthenticate *)fContext,us,det);\n         fContext = 0;\n      }\n   }\n\n   Bool_t remove = (strstr(Opt,\"R\") || strstr(Opt,\"r\"));\n   if (remove && fOffSet > -1){\n      R__LOCKGUARD2(gROOTMutex);\n      \/\/ Remove from the global list\n      gROOT->GetListOfSecContexts()->Remove(this);\n      \/\/ Remove also from local lists in THostAuth objects\n      TAuthenticate::RemoveSecContext(this);\n   }\n\n   \/\/ Set inactive\n   fOffSet  = -1;\n   fExpDate = kROOTTZERO;\n\n}\n\n\/\/______________________________________________________________________________\nBool_t TRootSecContext::CleanupSecContext(Bool_t all)\n{\n   \/\/ Ask remote client to cleanup security context 'ctx'\n   \/\/ If 'all', all sec context with the same host as ctx\n   \/\/ are cleaned.\n   Bool_t cleaned = kFALSE;\n\n   \/\/ Nothing to do if inactive ...\n   if (!IsActive())\n      return kTRUE;\n\n   \/\/ Contact remote services that used this context,\n   \/\/ starting from the last ...\n   TIter last(fCleanup,kIterBackward);\n   TSecContextCleanup *nscc = 0;\n   while ((nscc = (TSecContextCleanup *)last()) && !cleaned) {\n\n      \/\/ First check if remote daemon supports cleaning\n      Int_t srvtyp = nscc->GetType();\n      Int_t rproto = nscc->GetProtocol();\n      Int_t level = 2;\n      if ((srvtyp == TSocket::kROOTD && rproto < 10) ||\n          (srvtyp == TSocket::kPROOFD && rproto < 9))\n         level = 1;\n      if ((srvtyp == TSocket::kROOTD && rproto < 8) ||\n          (srvtyp == TSocket::kPROOFD && rproto < 7))\n         level = 0;\n      if (level) {\n         Int_t port = nscc->GetPort();\n\n         TSocket *news = new TSocket(fHost.Data(),port,-1);\n\n         if (news && news->IsValid()) {\n            if (srvtyp == TSocket::kPROOFD) {\n               news->SetOption(kNoDelay, 1);\n               news->Send(\"cleaning request\");\n            } else\n               news->SetOption(kNoDelay, 0);\n\n            \/\/ Backward compatibility: send socket size\n            if (srvtyp == TSocket::kROOTD && level == 1)\n               news->Send((Int_t)0, (Int_t)0);\n\n            if (all || level == 1) {\n               news->Send(Form(\"%d\",TAuthenticate::fgProcessID), kROOTD_CLEANUP);\n               cleaned = kTRUE;\n            } else {\n               news->Send(Form(\"%d %d %d %s\", TAuthenticate::fgProcessID, fMethod,\n                               fOffSet, fUser.Data()), kROOTD_CLEANUP);\n               if (TAuthenticate::SecureSend(news, 1, fRSAKey,\n                                             (char *)(fToken.Data())) == -1) {\n                  Info(\"CleanupSecContext\", \"problems secure-sending token\");\n               } else {\n                  cleaned = kTRUE;\n               }\n            }\n            if (cleaned && gDebug > 2) {\n               char srvname[3][10] = {\"sockd\", \"rootd\", \"proofd\"};\n               Info(\"CleanupSecContext\",\n                    \"remote %s notified for cleanup (%s,%d)\",\n                    srvname[srvtyp],fHost.Data(),port);\n            }\n         }\n         SafeDelete(news);\n      }\n   }\n\n   if (!cleaned)\n      if (gDebug > 2)\n         Info(\"CleanupSecContext\",\n              \"unable to open valid socket for cleanup for %s\", fHost.Data());\n\n   return cleaned;\n}\n\n\/\/______________________________________________________________________________\nvoid TRootSecContext::Print(Option_t *opt) const\n{\n   \/\/ If opt is \"F\" (default) print object content.\n   \/\/ If opt is \"<number>\" print in special form for calls within THostAuth\n   \/\/ with cardinality <number>\n   \/\/ If opt is \"S\" prints short in-line form for calls within TFTP,\n   \/\/ TSlave, TProof ...\n\n   \/\/ Check if option is numeric\n   Int_t ord = -1, i = 0;\n   for (; i < (Int_t)strlen(opt); i++) {\n      if (opt[i] < 48 || opt[i] > 57) {\n         ord = -2;\n         break;\n      }\n   }\n   \/\/ If numeric get the cardinality and prepare the strings\n   if (ord == -1)\n      ord = atoi(opt);\n\n   if (!strncasecmp(opt,\"F\",1)) {\n      Info(\"Print\",\n           \"+------------------------------------------------------+\");\n      Info(\"Print\",\n           \"+ Host:%s Method:%d (%s) User:'%s'\",\n           GetHost(), fMethod, GetMethodName(),\n           fUser.Data());\n      Info(\"Print\",\n           \"+         OffSet:%d Id: '%s'\", fOffSet, fID.Data());\n      if (fOffSet > -1)\n         Info(\"Print\",\n              \"+         Expiration time: %s\",fExpDate.AsString());\n      Info(\"Print\",\n           \"+------------------------------------------------------+\");\n   } else if (!strncasecmp(opt,\"S\",1)) {\n      if (fOffSet > -1) {\n         if (fID.BeginsWith(\"AFS\"))\n            Printf(\"Security context:     Method: AFS, not reusable\");\n         else\n            Printf(\"Security context:     Method: %d (%s) expiring on %s\",\n                   fMethod, GetMethodName(),\n                   fExpDate.AsString());\n      } else {\n         Printf(\"Security context:     Method: %d (%s) not reusable\",\n                fMethod, GetMethodName());\n      }\n   } else {\n      \/\/ special printing form for THostAuth\n      Info(\"PrintEstblshed\",\"+ %d \\t h:%s met:%d (%s) us:'%s'\",\n                               ord, GetHost(), fMethod, GetMethodName(),\n                               fUser.Data());\n      Info(\"PrintEstblshed\",\"+ \\t offset:%d id: '%s'\", fOffSet, fID.Data());\n      if (fOffSet > -1)\n         Info(\"PrintEstblshed\",\"+ \\t expiring: %s\",fExpDate.AsString());\n   }\n}\n\n\/\/______________________________________________________________________________\nconst char *TRootSecContext::AsString(TString &out)\n{\n   \/\/ Returns short string with relevant information about this\n   \/\/ security context\n\n   if (fOffSet > -1) {\n      if (fID.BeginsWith(\"AFS\"))\n         out = Form(\"Method: AFS, not reusable\");\n      else {\n         char expdate[32];\n         out = Form(\"Method: %d (%s) expiring on %s\",\n                    fMethod, GetMethodName(), fExpDate.AsString(expdate));\n      }\n   } else {\n      if (fOffSet == -1)\n         out = Form(\"Method: %d (%s) not reusable\", fMethod, GetMethodName());\n      else if (fOffSet == -3)\n         out = Form(\"Method: %d (%s) authorized by \/etc\/hosts.equiv or $HOME\/.rhosts\",\n                    fMethod, GetMethodName());\n      else if (fOffSet == -4)\n         out = Form(\"No authentication required remotely\");\n   }\n   return out.Data();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n\n#include <boost\/python.hpp>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n\n#include <cal3d\/buffersource.h>\n#include <cal3d\/coreanimation.h>\n#include <cal3d\/coreanimatedmorph.h>\n#include <cal3d\/corebone.h>\n#include <cal3d\/corematerial.h>\n#include <cal3d\/coremesh.h>\n#include <cal3d\/coreskeleton.h>\n#include <cal3d\/coresubmesh.h>\n#include <cal3d\/loader.h>\n#include <cal3d\/saver.h>\n#include <cal3d\/error.h>\n\nusing namespace boost::python;\n\nCalCoreAnimationPtr loadCoreAnimationFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreAnimation(cbs);\n}\n\nbool saveCoreAnimation(const boost::shared_ptr<CalCoreAnimation>& animation, const std::string& path) {\n    return CalSaver::saveCoreAnimation(path, animation.get());\n}\n\nCalCoreSkeletonPtr loadCoreSkeletonFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreSkeleton(cbs);\n}\n\nbool saveCoreSkeleton(const boost::shared_ptr<CalCoreSkeleton>& skeleton, const std::string& path) {\n    return CalSaver::saveCoreSkeleton(path, skeleton.get());\n}\n\nCalCoreMaterialPtr loadCoreMaterialFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreMaterial(cbs);\n}\n\nbool saveCoreMaterial(const boost::shared_ptr<CalCoreMaterial>& material, const std::string& path) {\n    return CalSaver::saveCoreMaterial(path, material.get());\n}\n\nCalCoreMeshPtr loadCoreMeshFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreMesh(cbs);\n}\n\nbool saveCoreMesh(const boost::shared_ptr<CalCoreMesh>& mesh, const std::string& path) {\n    return CalSaver::saveCoreMesh(path, mesh.get());\n}\n\nCalCoreAnimatedMorphPtr loadCoreAnimatedMorphFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreAnimatedMorph(cbs);\n}\n\nbool saveCoreAnimatedMorph(const boost::shared_ptr<CalCoreAnimatedMorph>& animatedMorph, const std::string& path) {\n    return CalSaver::saveCoreAnimatedMorph(path, animatedMorph.get());\n}\n\ntuple getCoreSkeletonSceneAmbientColor(const CalCoreSkeletonPtr& skel) {\n    CalVector sceneAmbient = skel->sceneAmbientColor;\n    return make_tuple(\n        sceneAmbient.x,\n        sceneAmbient.y,\n        sceneAmbient.z\n    );\n}\n\nvoid setCoreSkeletonSceneAmbientColor(const CalCoreSkeletonPtr& skel, tuple c) {\n    if (len(c) != 3) {\n        PyErr_SetString(PyExc_ValueError, \"sceneAmbientColor must be a triple\");\n        throw_error_already_set();\n    }\n    skel->sceneAmbientColor.x = extract<float>(c[0]);\n    skel->sceneAmbientColor.y = extract<float>(c[1]);\n    skel->sceneAmbientColor.z = extract<float>(c[2]);\n}\n\nlist getKeyframes(const CalCoreMorphTrack* t) {\n    list rv;\n    const std::vector<CalCoreMorphKeyframe>& keyframes = t->keyframes;\n    for (\n        std::vector<CalCoreMorphKeyframe>::const_iterator i = keyframes.begin();\n        i != keyframes.end();\n        ++i\n    ) {\n        rv.append(*i);\n    }\n    return rv;\n}\n\nlist getTracks(const CalCoreAnimatedMorph* m) {\n    list rv;\n    const std::vector<CalCoreMorphTrack>& tracks = m->tracks;\n    for (\n        std::vector<CalCoreMorphTrack>::const_iterator i = tracks.begin();\n        i != tracks.end();\n        ++i\n    ) {\n        rv.append(*i);\n    }\n    return rv;\n}\n\nnamespace cal3d {\n    struct PythonBuffer : public Buffer {\n    public:\n        PythonBuffer(PyObject* p) {\n            _ = p;\n            incref(get());\n        }\n\n        ~PythonBuffer() {\n            boost::python::PyGILState_AssertIsCurrent();\n            decref(get());\n        }\n\n        size_t size() const {\n            void* data;\n            return get()->ob_type->tp_as_buffer->bf_getreadbuffer(get(), 0, &data);\n        }\n\n        const void* data() const {\n            void* data;\n            get()->ob_type->tp_as_buffer->bf_getreadbuffer(get(), 0, &data);\n            return data;\n        }\n\n        boost::shared_ptr<Buffer> clone() const {\n            return boost::shared_ptr<Buffer>(new PythonBuffer(get()));\n        }\n    private:\n        PyObject* get() const {\n            return static_cast<PyObject*>(_);\n        }\n    };\n\n    struct BufferFromPythonObject {\n        BufferFromPythonObject() {\n            converter::registry::push_back(\n                &convertible,\n                &construct,\n                boost::python::type_id<Buffer>()\n            );\n        }\n\n        static void* convertible(PyObject* obj_ptr) {\n            return (obj_ptr->ob_type->tp_as_buffer &&\n                    obj_ptr->ob_type->tp_as_buffer->bf_getreadbuffer)\n                   ? obj_ptr\n                   : 0;\n        }\n\n        static void construct(\n            PyObject* obj_ptr,\n            boost::python::converter::rvalue_from_python_stage1_data* data\n        ) {\n            \/\/ Note that we're registered as a converter to the Buffer interface,\n            \/\/ so Boost has already allocated sizeof(Buffer) for us.  Since we're\n            \/\/ constructing PythonStringBuffer into that memory, assert that\n            \/\/ PythonStringBuffer and Buffer have the same size.\n            BOOST_STATIC_ASSERT(sizeof(Buffer) == sizeof(PythonBuffer));\n\n            void* storage = ((boost::python::converter::rvalue_from_python_storage<PythonBuffer>*)data)->storage.bytes;\n\n            new(storage) PythonBuffer(obj_ptr);\n\n            data->convertible = storage;\n        }\n    };\n}\n\ntemplate<unsigned i>\nCalIndex getFaceIndex(const CalCoreSubmesh::Face& f) {\n    return f.vertexId[i];\n}\n\nstruct PythonVertex {\n    PythonVertex() {}\n    PythonVertex(const CalCoreSubmesh::Vertex& v) {\n        position.x = v.position.x;\n        position.y = v.position.y;\n        position.z = v.position.z;\n\n        normal.x = v.normal.x;\n        normal.y = v.normal.y;\n        normal.z = v.normal.z;\n    }\n    CalVector position;\n    CalVector normal;\n\n    bool operator==(const PythonVertex& rhs) const {\n        return position == rhs.position && normal == rhs.normal;\n    }\n};\n\nstd::vector<PythonVertex> getVertices(const CalCoreSubmesh& submesh) {\n    return std::vector<PythonVertex>(\n        submesh.getVectorVertex().begin(),\n        submesh.getVectorVertex().end());\n}\n\ntemplate<typename T>\nvoid exportVector(const char* name) {\n    class_<std::vector<T> >(name)\n        .def(vector_indexing_suite< std::vector<T>, true>())\n        ;\n}\n\n#ifndef NDEBUG\nBOOST_PYTHON_MODULE(_cal3d_debug)\n#else\nBOOST_PYTHON_MODULE(_cal3d)\n#endif\n{\n    cal3d::BufferFromPythonObject();\n\n    class_<CalVector>(\"Vector\")\n        .def_readwrite(\"x\", &CalVector::x)\n        .def_readwrite(\"y\", &CalVector::y)\n        .def_readwrite(\"z\", &CalVector::z)\n        ;\n\n    class_<CalQuaternion>(\"Quaternion\")\n        .def_readwrite(\"x\", &CalQuaternion::x)\n        .def_readwrite(\"y\", &CalQuaternion::y)\n        .def_readwrite(\"z\", &CalQuaternion::z)\n        .def_readwrite(\"w\", &CalQuaternion::w)\n        ;\n\n    class_<cal3d::Transform>(\"Transform\")\n        .def_readwrite(\"translation\", &cal3d::Transform::translation)\n        .def_readwrite(\"rotation\", &cal3d::Transform::rotation)\n        ;\n\n    class_<CalCoreBone, boost::shared_ptr<CalCoreBone> >(\"CoreBone\", no_init)\n        .def(init<std::string>())\n        .def_readwrite(\"parentIndex\", &CalCoreBone::parentId)\n        .def_readonly(\"name\", &CalCoreBone::name)\n        .def_readwrite(\"relativeTransform\", &CalCoreBone::relativeTransform)\n        .def_readwrite(\"boneSpaceTransform\", &CalCoreBone::boneSpaceTransform)\n        ;\n\n    exportVector<CalCoreBonePtr>(\"BoneVector\");\n\n    class_<CalCoreSkeleton, boost::shared_ptr<CalCoreSkeleton>, boost::noncopyable>(\"CoreSkeleton\")\n        .def(\"addCoreBone\", &CalCoreSkeleton::addCoreBone)\n        .def(\"scale\", &CalCoreSkeleton::scale)\n        .def(\"zeroRootTransforms\", &CalCoreSkeleton::zeroRootTransforms)\n        .add_property(\"sceneAmbientColor\", &getCoreSkeletonSceneAmbientColor, &setCoreSkeletonSceneAmbientColor)\n        .add_property(\"bones\", make_function(&CalCoreSkeleton::getCoreBones, return_value_policy<return_by_value>()))\n        ;\n\n    {\n        scope CalCoreMaterial_class(\n            class_<CalCoreMaterial, boost::shared_ptr<CalCoreMaterial> >(\"CoreMaterial\")\n                .def_readwrite(\"maps\", &CalCoreMaterial::maps)\n        );\n\n        exportVector<CalCoreMaterial::Map>(\"MapVector\");\n\n        class_<CalCoreMaterial::Map>(\"Map\")\n            .def_readwrite(\"filename\", &CalCoreMaterial::Map::filename)\n            .def_readwrite(\"type\", &CalCoreMaterial::Map::type)\n            ;\n    }\n\n    class_<CalCoreSubmesh::Face>(\"Triangle\")\n        .add_property(\"v1\", &getFaceIndex<0>)\n        .add_property(\"v2\", &getFaceIndex<1>)\n        .add_property(\"v3\", &getFaceIndex<2>)\n        ;\n\n    exportVector<CalCoreSubmesh::Face>(\"TriangleVector\");\n\n    class_<PythonVertex>(\"Vertex\")\n        .def_readwrite(\"position\", &PythonVertex::position)\n        .def_readwrite(\"normal\", &PythonVertex::normal)\n        ;\n\n    exportVector<PythonVertex>(\"VertexVector\");\n\n    class_<CalCoreSubmesh::TextureCoordinate>(\"TextureCoordinate\")\n        .def_readwrite(\"u\", &CalCoreSubmesh::TextureCoordinate::u)\n        .def_readwrite(\"v\", &CalCoreSubmesh::TextureCoordinate::v)\n        ;\n\n    exportVector<CalCoreSubmesh::TextureCoordinate>(\"TextureCoordinateVector\");\n    exportVector<std::vector<CalCoreSubmesh::TextureCoordinate> >(\"TextureCoordinateVectorVector\");\n\n    class_<CalCoreSubmesh::Influence>(\"Influence\")\n        .def_readwrite(\"boneId\", &CalCoreSubmesh::Influence::boneId)\n        .def_readwrite(\"weight\", &CalCoreSubmesh::Influence::weight)\n        .def_readwrite(\"isLast\", &CalCoreSubmesh::Influence::lastInfluenceForThisVertex)\n        ;\n\n    exportVector<CalCoreSubmesh::Influence>(\"InfluenceVector\");\n\n    class_<CalCoreSubmesh, boost::shared_ptr<CalCoreSubmesh>, boost::noncopyable>(\"CoreSubmesh\", no_init)\n        .def_readwrite(\"coreMaterialThreadId\", &CalCoreSubmesh::coreMaterialThreadId)\n        .def_readwrite(\"triangles\", &CalCoreSubmesh::faces)\n        .add_property(\"vertices\", &getVertices)\n        .add_property(\"hasVertexColors\", &CalCoreSubmesh::hasVertexColors)\n        .add_property(\"colors\", make_function(&CalCoreSubmesh::getVertexColors, return_value_policy<return_by_value>()))\n        .add_property(\"texcoords\", make_function(&CalCoreSubmesh::getVectorVectorTextureCoordinate, return_value_policy<return_by_value>()))\n        .add_property(\"influences\", make_function(&CalCoreSubmesh::getInfluences, return_value_policy<return_by_value>()))\n        ;\n\n    class_< CalCoreMesh::CalCoreSubmeshVector >(\"CalCoreSubmeshVector\")\n        .def(vector_indexing_suite<CalCoreMesh::CalCoreSubmeshVector, true>())\n        ;\n\n    class_<CalCoreMesh, boost::shared_ptr<CalCoreMesh> >(\"CoreMesh\")\n        .def_readwrite(\"submeshes\", &CalCoreMesh::submeshes)\n        .def(\"scale\", &CalCoreMesh::scale)\n        .def(\"fixup\", &CalCoreMesh::fixup)\n        ;\n\n    class_<CalCoreAnimation, boost::shared_ptr<CalCoreAnimation> >(\"CoreAnimation\")\n        .def(\"scale\", &CalCoreAnimation::scale)\n        .def(\"fixup\", &CalCoreAnimation::fixup)\n        ;\n\n    class_<CalCoreMorphKeyframe>(\"CoreMorphKeyframe\")\n        .add_property(\"time\", &CalCoreMorphKeyframe::time)\n        .add_property(\"weight\", &CalCoreMorphKeyframe::weight)\n        ;\n\n    class_<CalCoreMorphTrack, boost::shared_ptr<CalCoreMorphTrack> >(\"CoreMorphTrack\")\n        .def_readonly(\"name\", &CalCoreMorphTrack::morphName)\n        .add_property(\"keyframes\", &getKeyframes)\n        ;\n\n    class_<CalCoreAnimatedMorph, boost::shared_ptr<CalCoreAnimatedMorph> >(\"CoreAnimatedMorph\")\n        .def(\"removeZeroScaleTracks\", &CalCoreAnimatedMorph::removeZeroScaleTracks)\n        .def(\"scale\", &CalCoreAnimatedMorph::scale)\n        .def_readonly(\"duration\", &CalCoreAnimatedMorph::duration)\n        .add_property(\"tracks\", &getTracks)\n        ;\n\n    def(\"loadCoreAnimationFromBuffer\", &loadCoreAnimationFromBuffer);\n    def(\"saveCoreAnimation\", &saveCoreAnimation);\n    def(\"saveCoreAnimationToBuffer\", &CalSaver::saveCoreAnimationToBuffer);\n\n    def(\"loadCoreSkeletonFromBuffer\", &loadCoreSkeletonFromBuffer);\n    def(\"saveCoreSkeleton\", &saveCoreSkeleton);\n    def(\"saveCoreSkeletonToBuffer\", &CalSaver::saveCoreSkeletonToBuffer);\n\n    def(\"loadCoreMaterialFromBuffer\", &loadCoreMaterialFromBuffer);\n    def(\"saveCoreMaterial\", &saveCoreMaterial);\n    def(\"saveCoreMaterialToBuffer\", &CalSaver::saveCoreMaterialToBuffer);\n\n    def(\"loadCoreMeshFromBuffer\", &loadCoreMeshFromBuffer);\n    def(\"saveCoreMesh\", &saveCoreMesh);\n    def(\"saveCoreMeshToBuffer\", &CalSaver::saveCoreMeshToBuffer);\n\n    def(\"loadCoreAnimatedMorphFromBuffer\", &loadCoreAnimatedMorphFromBuffer);\n    def(\"saveCoreAnimatedMorph\", &saveCoreAnimatedMorph);\n    def(\"saveCoreAnimatedMorphToBuffer\", &CalSaver::saveCoreAnimatedMorphToBuffer);\n\n    def(\"getLastErrorText\", &CalError::getLastErrorText);\n}\n<commit_msg>Export skeletal animations in the asset server<commit_after>#include <vector>\n\n#include <boost\/python.hpp>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n\n#include <cal3d\/buffersource.h>\n#include <cal3d\/coreanimation.h>\n#include <cal3d\/coreanimatedmorph.h>\n#include <cal3d\/corebone.h>\n#include <cal3d\/corematerial.h>\n#include <cal3d\/coremesh.h>\n#include <cal3d\/coreskeleton.h>\n#include <cal3d\/coresubmesh.h>\n#include <cal3d\/loader.h>\n#include <cal3d\/saver.h>\n#include <cal3d\/error.h>\n\nusing namespace boost::python;\n\nCalCoreAnimationPtr loadCoreAnimationFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreAnimation(cbs);\n}\n\nbool saveCoreAnimation(const boost::shared_ptr<CalCoreAnimation>& animation, const std::string& path) {\n    return CalSaver::saveCoreAnimation(path, animation.get());\n}\n\nCalCoreSkeletonPtr loadCoreSkeletonFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreSkeleton(cbs);\n}\n\nbool saveCoreSkeleton(const boost::shared_ptr<CalCoreSkeleton>& skeleton, const std::string& path) {\n    return CalSaver::saveCoreSkeleton(path, skeleton.get());\n}\n\nCalCoreMaterialPtr loadCoreMaterialFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreMaterial(cbs);\n}\n\nbool saveCoreMaterial(const boost::shared_ptr<CalCoreMaterial>& material, const std::string& path) {\n    return CalSaver::saveCoreMaterial(path, material.get());\n}\n\nCalCoreMeshPtr loadCoreMeshFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreMesh(cbs);\n}\n\nbool saveCoreMesh(const boost::shared_ptr<CalCoreMesh>& mesh, const std::string& path) {\n    return CalSaver::saveCoreMesh(path, mesh.get());\n}\n\nCalCoreAnimatedMorphPtr loadCoreAnimatedMorphFromBuffer(const cal3d::Buffer& buffer) {\n    CalBufferSource cbs(buffer.data(), buffer.size());\n    return CalLoader::loadCoreAnimatedMorph(cbs);\n}\n\nbool saveCoreAnimatedMorph(const boost::shared_ptr<CalCoreAnimatedMorph>& animatedMorph, const std::string& path) {\n    return CalSaver::saveCoreAnimatedMorph(path, animatedMorph.get());\n}\n\ntuple getCoreSkeletonSceneAmbientColor(const CalCoreSkeletonPtr& skel) {\n    CalVector sceneAmbient = skel->sceneAmbientColor;\n    return make_tuple(\n        sceneAmbient.x,\n        sceneAmbient.y,\n        sceneAmbient.z\n    );\n}\n\nvoid setCoreSkeletonSceneAmbientColor(const CalCoreSkeletonPtr& skel, tuple c) {\n    if (len(c) != 3) {\n        PyErr_SetString(PyExc_ValueError, \"sceneAmbientColor must be a triple\");\n        throw_error_already_set();\n    }\n    skel->sceneAmbientColor.x = extract<float>(c[0]);\n    skel->sceneAmbientColor.y = extract<float>(c[1]);\n    skel->sceneAmbientColor.z = extract<float>(c[2]);\n}\n\nlist getKeyframes(const CalCoreMorphTrack* t) {\n    list rv;\n    const std::vector<CalCoreMorphKeyframe>& keyframes = t->keyframes;\n    for (\n        std::vector<CalCoreMorphKeyframe>::const_iterator i = keyframes.begin();\n        i != keyframes.end();\n        ++i\n    ) {\n        rv.append(*i);\n    }\n    return rv;\n}\n\nlist getTracks(const CalCoreAnimatedMorph* m) {\n    list rv;\n    const std::vector<CalCoreMorphTrack>& tracks = m->tracks;\n    for (\n        std::vector<CalCoreMorphTrack>::const_iterator i = tracks.begin();\n        i != tracks.end();\n        ++i\n    ) {\n        rv.append(*i);\n    }\n    return rv;\n}\n\nnamespace cal3d {\n    struct PythonBuffer : public Buffer {\n    public:\n        PythonBuffer(PyObject* p) {\n            _ = p;\n            incref(get());\n        }\n\n        ~PythonBuffer() {\n            boost::python::PyGILState_AssertIsCurrent();\n            decref(get());\n        }\n\n        size_t size() const {\n            void* data;\n            return get()->ob_type->tp_as_buffer->bf_getreadbuffer(get(), 0, &data);\n        }\n\n        const void* data() const {\n            void* data;\n            get()->ob_type->tp_as_buffer->bf_getreadbuffer(get(), 0, &data);\n            return data;\n        }\n\n        boost::shared_ptr<Buffer> clone() const {\n            return boost::shared_ptr<Buffer>(new PythonBuffer(get()));\n        }\n    private:\n        PyObject* get() const {\n            return static_cast<PyObject*>(_);\n        }\n    };\n\n    struct BufferFromPythonObject {\n        BufferFromPythonObject() {\n            converter::registry::push_back(\n                &convertible,\n                &construct,\n                boost::python::type_id<Buffer>()\n            );\n        }\n\n        static void* convertible(PyObject* obj_ptr) {\n            return (obj_ptr->ob_type->tp_as_buffer &&\n                    obj_ptr->ob_type->tp_as_buffer->bf_getreadbuffer)\n                   ? obj_ptr\n                   : 0;\n        }\n\n        static void construct(\n            PyObject* obj_ptr,\n            boost::python::converter::rvalue_from_python_stage1_data* data\n        ) {\n            \/\/ Note that we're registered as a converter to the Buffer interface,\n            \/\/ so Boost has already allocated sizeof(Buffer) for us.  Since we're\n            \/\/ constructing PythonStringBuffer into that memory, assert that\n            \/\/ PythonStringBuffer and Buffer have the same size.\n            BOOST_STATIC_ASSERT(sizeof(Buffer) == sizeof(PythonBuffer));\n\n            void* storage = ((boost::python::converter::rvalue_from_python_storage<PythonBuffer>*)data)->storage.bytes;\n\n            new(storage) PythonBuffer(obj_ptr);\n\n            data->convertible = storage;\n        }\n    };\n}\n\ntemplate<unsigned i>\nCalIndex getFaceIndex(const CalCoreSubmesh::Face& f) {\n    return f.vertexId[i];\n}\n\nstruct PythonVertex {\n    PythonVertex() {}\n    PythonVertex(const CalCoreSubmesh::Vertex& v) {\n        position.x = v.position.x;\n        position.y = v.position.y;\n        position.z = v.position.z;\n\n        normal.x = v.normal.x;\n        normal.y = v.normal.y;\n        normal.z = v.normal.z;\n    }\n    CalVector position;\n    CalVector normal;\n\n    bool operator==(const PythonVertex& rhs) const {\n        return position == rhs.position && normal == rhs.normal;\n    }\n};\n\nstd::vector<PythonVertex> getVertices(const CalCoreSubmesh& submesh) {\n    return std::vector<PythonVertex>(\n        submesh.getVectorVertex().begin(),\n        submesh.getVectorVertex().end());\n}\n\ntemplate<typename T>\nvoid exportVector(const char* name) {\n    class_<std::vector<T> >(name)\n        .def(vector_indexing_suite< std::vector<T>, true>())\n        ;\n}\n\n#ifndef NDEBUG\nBOOST_PYTHON_MODULE(_cal3d_debug)\n#else\nBOOST_PYTHON_MODULE(_cal3d)\n#endif\n{\n    cal3d::BufferFromPythonObject();\n\n    class_<CalVector>(\"Vector\")\n        .def_readwrite(\"x\", &CalVector::x)\n        .def_readwrite(\"y\", &CalVector::y)\n        .def_readwrite(\"z\", &CalVector::z)\n        ;\n\n    class_<CalQuaternion>(\"Quaternion\")\n        .def_readwrite(\"x\", &CalQuaternion::x)\n        .def_readwrite(\"y\", &CalQuaternion::y)\n        .def_readwrite(\"z\", &CalQuaternion::z)\n        .def_readwrite(\"w\", &CalQuaternion::w)\n        ;\n\n    class_<cal3d::Transform>(\"Transform\")\n        .def_readwrite(\"translation\", &cal3d::Transform::translation)\n        .def_readwrite(\"rotation\", &cal3d::Transform::rotation)\n        ;\n\n    class_<CalCoreBone, boost::shared_ptr<CalCoreBone> >(\"CoreBone\", no_init)\n        .def(init<std::string>())\n        .def_readwrite(\"parentIndex\", &CalCoreBone::parentId)\n        .def_readonly(\"name\", &CalCoreBone::name)\n        .def_readwrite(\"relativeTransform\", &CalCoreBone::relativeTransform)\n        .def_readwrite(\"boneSpaceTransform\", &CalCoreBone::boneSpaceTransform)\n        ;\n\n    exportVector<CalCoreBonePtr>(\"BoneVector\");\n\n    class_<CalCoreSkeleton, boost::shared_ptr<CalCoreSkeleton>, boost::noncopyable>(\"CoreSkeleton\")\n        .def(\"addCoreBone\", &CalCoreSkeleton::addCoreBone)\n        .def(\"scale\", &CalCoreSkeleton::scale)\n        .def(\"zeroRootTransforms\", &CalCoreSkeleton::zeroRootTransforms)\n        .add_property(\"sceneAmbientColor\", &getCoreSkeletonSceneAmbientColor, &setCoreSkeletonSceneAmbientColor)\n        .add_property(\"bones\", make_function(&CalCoreSkeleton::getCoreBones, return_value_policy<return_by_value>()))\n        ;\n\n    {\n        scope CalCoreMaterial_class(\n            class_<CalCoreMaterial, boost::shared_ptr<CalCoreMaterial> >(\"CoreMaterial\")\n                .def_readwrite(\"maps\", &CalCoreMaterial::maps)\n        );\n\n        exportVector<CalCoreMaterial::Map>(\"MapVector\");\n\n        class_<CalCoreMaterial::Map>(\"Map\")\n            .def_readwrite(\"filename\", &CalCoreMaterial::Map::filename)\n            .def_readwrite(\"type\", &CalCoreMaterial::Map::type)\n            ;\n    }\n\n    class_<CalCoreSubmesh::Face>(\"Triangle\")\n        .add_property(\"v1\", &getFaceIndex<0>)\n        .add_property(\"v2\", &getFaceIndex<1>)\n        .add_property(\"v3\", &getFaceIndex<2>)\n        ;\n\n    exportVector<CalCoreSubmesh::Face>(\"TriangleVector\");\n\n    class_<PythonVertex>(\"Vertex\")\n        .def_readwrite(\"position\", &PythonVertex::position)\n        .def_readwrite(\"normal\", &PythonVertex::normal)\n        ;\n\n    exportVector<PythonVertex>(\"VertexVector\");\n\n    class_<CalCoreSubmesh::TextureCoordinate>(\"TextureCoordinate\")\n        .def_readwrite(\"u\", &CalCoreSubmesh::TextureCoordinate::u)\n        .def_readwrite(\"v\", &CalCoreSubmesh::TextureCoordinate::v)\n        ;\n\n    exportVector<CalCoreSubmesh::TextureCoordinate>(\"TextureCoordinateVector\");\n    exportVector<std::vector<CalCoreSubmesh::TextureCoordinate> >(\"TextureCoordinateVectorVector\");\n\n    class_<CalCoreSubmesh::Influence>(\"Influence\")\n        .def_readwrite(\"boneId\", &CalCoreSubmesh::Influence::boneId)\n        .def_readwrite(\"weight\", &CalCoreSubmesh::Influence::weight)\n        .def_readwrite(\"isLast\", &CalCoreSubmesh::Influence::lastInfluenceForThisVertex)\n        ;\n\n    exportVector<CalCoreSubmesh::Influence>(\"InfluenceVector\");\n\n    class_<CalCoreSubmesh, boost::shared_ptr<CalCoreSubmesh>, boost::noncopyable>(\"CoreSubmesh\", no_init)\n        .def_readwrite(\"coreMaterialThreadId\", &CalCoreSubmesh::coreMaterialThreadId)\n        .def_readwrite(\"triangles\", &CalCoreSubmesh::faces)\n        .add_property(\"vertices\", &getVertices)\n        .add_property(\"hasVertexColors\", &CalCoreSubmesh::hasVertexColors)\n        .add_property(\"colors\", make_function(&CalCoreSubmesh::getVertexColors, return_value_policy<return_by_value>()))\n        .add_property(\"texcoords\", make_function(&CalCoreSubmesh::getVectorVectorTextureCoordinate, return_value_policy<return_by_value>()))\n        .add_property(\"influences\", make_function(&CalCoreSubmesh::getInfluences, return_value_policy<return_by_value>()))\n        ;\n\n    class_< CalCoreMesh::CalCoreSubmeshVector >(\"CalCoreSubmeshVector\")\n        .def(vector_indexing_suite<CalCoreMesh::CalCoreSubmeshVector, true>())\n        ;\n\n    class_<CalCoreMesh, CalCoreMeshPtr>(\"CoreMesh\")\n        .def_readwrite(\"submeshes\", &CalCoreMesh::submeshes)\n        .def(\"scale\", &CalCoreMesh::scale)\n        .def(\"fixup\", &CalCoreMesh::fixup)\n        ;\n\n    class_<CalCoreKeyframe>(\"CoreKeyframe\")\n        .def_readwrite(\"time\", &CalCoreKeyframe::time)\n        .def_readwrite(\"transform\", &CalCoreKeyframe::transform)\n        ;\n\n    class_<CalCoreTrack::KeyframeList>(\"CoreKeyframeVector\")\n        .def(vector_indexing_suite<CalCoreTrack::KeyframeList, true>())\n        ;\n\n    class_<CalCoreTrack>(\"CoreTrack\", init<int, const CalCoreTrack::KeyframeList&>())\n        .def_readwrite(\"coreBoneId\", &CalCoreTrack::coreBoneId)\n        .def_readwrite(\"keyframes\", &CalCoreTrack::keyframes)\n        ;\n\n    class_< std::vector<CalCoreTrack> >(\"CoreTrackVector\")\n        .def(vector_indexing_suite< std::vector<CalCoreTrack>, true >())\n        ;\n\n    class_<CalCoreAnimation, CalCoreAnimationPtr>(\"CoreAnimation\")\n        .def(\"scale\", &CalCoreAnimation::scale)\n        .def(\"fixup\", &CalCoreAnimation::fixup)\n        .def_readwrite(\"duration\", &CalCoreAnimation::duration)\n        .def_readwrite(\"tracks\", &CalCoreAnimation::tracks)\n        ;\n\n    class_<CalCoreMorphKeyframe>(\"CoreMorphKeyframe\")\n        .add_property(\"time\", &CalCoreMorphKeyframe::time)\n        .add_property(\"weight\", &CalCoreMorphKeyframe::weight)\n        ;\n\n    class_<CalCoreMorphTrack, CalCoreMorphTrackPtr>(\"CoreMorphTrack\")\n        .def_readonly(\"name\", &CalCoreMorphTrack::morphName)\n        .add_property(\"keyframes\", &getKeyframes)\n        ;\n\n    class_<CalCoreAnimatedMorph, CalCoreAnimatedMorphPtr>(\"CoreAnimatedMorph\")\n        .def(\"removeZeroScaleTracks\", &CalCoreAnimatedMorph::removeZeroScaleTracks)\n        .def(\"scale\", &CalCoreAnimatedMorph::scale)\n        .def_readonly(\"duration\", &CalCoreAnimatedMorph::duration)\n        .add_property(\"tracks\", &getTracks)\n        ;\n\n    def(\"loadCoreAnimationFromBuffer\", &loadCoreAnimationFromBuffer);\n    def(\"saveCoreAnimation\", &saveCoreAnimation);\n    def(\"saveCoreAnimationToBuffer\", &CalSaver::saveCoreAnimationToBuffer);\n\n    def(\"loadCoreSkeletonFromBuffer\", &loadCoreSkeletonFromBuffer);\n    def(\"saveCoreSkeleton\", &saveCoreSkeleton);\n    def(\"saveCoreSkeletonToBuffer\", &CalSaver::saveCoreSkeletonToBuffer);\n\n    def(\"loadCoreMaterialFromBuffer\", &loadCoreMaterialFromBuffer);\n    def(\"saveCoreMaterial\", &saveCoreMaterial);\n    def(\"saveCoreMaterialToBuffer\", &CalSaver::saveCoreMaterialToBuffer);\n\n    def(\"loadCoreMeshFromBuffer\", &loadCoreMeshFromBuffer);\n    def(\"saveCoreMesh\", &saveCoreMesh);\n    def(\"saveCoreMeshToBuffer\", &CalSaver::saveCoreMeshToBuffer);\n\n    def(\"loadCoreAnimatedMorphFromBuffer\", &loadCoreAnimatedMorphFromBuffer);\n    def(\"saveCoreAnimatedMorph\", &saveCoreAnimatedMorph);\n    def(\"saveCoreAnimatedMorphToBuffer\", &CalSaver::saveCoreAnimatedMorphToBuffer);\n\n    def(\"getLastErrorText\", &CalError::getLastErrorText);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"vtkFLAC3DReader.h\"\n\n#include \"vtkUnstructuredGrid.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include <vtksys\/ios\/sstream>\n#include <sstream>\n\n#include <vtkStringList.h>\n#include <vtkStdString.h>\n#include <vtkStringArray.h>\n#include <vtkIntArray.h>\n#include <vtkDoubleArray.h>\n#include <vtkCellArray.h>\n#include <vtkPointData.h>\n#include <vtkCellData.h>\n\n#include \"StringUtilities.h\"\n\n\nvtkCxxRevisionMacro(vtkFLAC3DReader, \"$Revision: 1.1 $\");\nvtkStandardNewMacro(vtkFLAC3DReader);\n\n\/\/_________________________________________________________________________\nvtkFLAC3DReader::vtkFLAC3DReader()\n{\n\tthis->FileName = NULL;\n\tthis->SetNumberOfInputPorts(0);\n\n\tthis->DisplacementVectorsFile = NULL;\n\tthis->ZonesScalarsFile = NULL;\n\tthis->ZonesTensorsFile = NULL;\n}\n\n\/\/_________________________________________________________________________\nvtkFLAC3DReader::~vtkFLAC3DReader()\n{\n\tthis->SetFileName(NULL);\n}\n\n\/\/_________________________________________________________________________\nvoid vtkFLAC3DReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n\tthis->Superclass::PrintSelf(os,indent);\n\tos << indent <<  \"FileName: \"\n\t\t<< (this->FileName ? this->FileName : \"(none)\") << \"\\n\";\n}\n\n\/\/_________________________________________________________________________\nint vtkFLAC3DReader::CanReadFile( const char* fname )\n{\n\treturn 1;\t\n}\n\n\/\/_________________________________________________________________________\nint vtkFLAC3DReader::RequestInformation(vtkInformation* request,\n\t\t\t\t\t\t\t\t\t  vtkInformationVector** inputVector,\n\t\t\t\t\t\t\t\t\t  vtkInformationVector* outputVector)\n{\n\treturn 1;\n}\n\n\n\/\/_________________________________________________________________________\nint vtkFLAC3DReader::RequestData(vtkInformation* request,\n\t\t\t\t\t\t\t   vtkInformationVector** inputVector,\n\t\t\t\t\t\t\t   vtkInformationVector* outputVector)\n{\n\tvtkInformation *outInfo = outputVector->GetInformationObject(0);\n\tvtkUnstructuredGrid *output = vtkUnstructuredGrid::SafeDownCast(outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n\t\/\/ Make sure we have a file to read.\n\tif(!this->FileName)  {\n\t\tvtkErrorMacro(\"No file name specified.  Cannot open.\");\n\t\treturn 0;\n\t}\n\tif(strlen(this->FileName)==0)  {\n\t\tvtkErrorMacro(\"File name is null.  Cannot open.\");\n\t\treturn 0;\n\t}\n\n\n\tifstream inFile;\n\tinFile.open(this->FileName, ios::in);\n\tif(!inFile)\n\t{\n\t\tvtkErrorMacro(\"File Error: cannot open file: \"<< this->FileName);\n\t\treturn 0;\n\t}\n\n\tvtkPoints* outPoints = vtkPoints::New();\n\n\tvtkIdType ids[8];\n\tstring line;\n\tvector<string> lineSplit;\n\n\t\/\/ skip the headers\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() == 0) continue;\n\t\tif(line[0] == '*') continue;\n\t\tif(line[0] == 'G')\n\t\t\tbreak;\n\t}\n\n\t\/\/ read the GRIDPOINTS section\n\twhile(line.substr(0,2) == \"G \")\n\t{\n\t\tStringUtilities::split(line, lineSplit, \" \");\n\n\t\tvtkIdType id;\n\t\tdouble pt[3];\n\t\tid = atoi(lineSplit[1].c_str());\n\t\tpt[0] = atof(lineSplit[2].c_str());\n\t\tpt[1] = atof(lineSplit[3].c_str());\n\t\tpt[2] = atof(lineSplit[4].c_str());\n\n\t\toutPoints->InsertNextPoint(pt);\n\n\t\tif(inFile.eof()) break;\n\n\t\tdo\n\t\t{\n\t\t\tgetline(inFile, line);\n\t\t}while((line.size() == 0 || line[0] == '*') &! inFile.eof());\n\n\t\tif(line.size() == 0 || line[0] == '*')\n\t\t\tbreak;\n\t}\n\n\tif(line.size() == 0 || line[0] == '*' || inFile.eof())\n\t{\n\t\toutput->SetPoints(outPoints);\n\t\toutPoints->Delete();\n\t\treturn 1;\n\t}\n\n\tvtkUnstructuredGrid* temp= vtkUnstructuredGrid::New();\n\n\t\/\/ read the ZONES section\n\twhile(line.substr(0,2) == \"Z \")\n\t{\n\t\tStringUtilities::split(line, lineSplit, \" \");\n\n\t\tif(lineSplit[1] == \"B8\")\n\t\t{\n\t\t\tvtkIdType id = atoi(lineSplit[2].c_str());\n\n\t\t\t\/\/ see FLAC3D documentation for hexahedron topology\n\t\t\tids[0] = atoi(lineSplit[3].c_str()) -1;\n\t\t\tids[1] = atoi(lineSplit[4].c_str()) -1;\n\t\t\tids[2] = atoi(lineSplit[7].c_str()) -1;\n\t\t\tids[3] = atoi(lineSplit[5].c_str()) -1;\n\t\t\tids[4] = atoi(lineSplit[6].c_str()) -1;\n\t\t\tids[5] = atoi(lineSplit[9].c_str()) -1;\n\t\t\tids[6] = atoi(lineSplit[10].c_str()) -1;\n\t\t\tids[7] = atoi(lineSplit[8].c_str()) -1;\n\n\t\t\ttemp->InsertNextCell(VTK_HEXAHEDRON,8,ids);\n\t\t}\n\n\t\tif(inFile.eof()) break;\n\n\t\tdo\n\t\t{\n\t\t\tgetline(inFile, line);\n\t\t}while((line.size() == 0 || line[0] == '*') &! inFile.eof());\n\n\t\tif(line.size() == 0 || line[0] == '*')\n\t\t\tbreak;\n\t}\n\n\ttemp->SetPoints(outPoints);\n\toutput->ShallowCopy(temp);\n\toutPoints->Delete();\n\n\tif(line.size() == 0 || line[0] == '*' || inFile.eof())\n\t\treturn 1;\n\n\tvtkStringArray* groupNameArray = vtkStringArray::New();\n\tgroupNameArray->SetName(\"Group Name\");\n\tgroupNameArray->SetNumberOfValues(temp->GetNumberOfCells());\n\n\tvtkIntArray* groupIdArray = vtkIntArray::New();\n\tgroupIdArray->SetName(\"Group Id\");\n\tgroupIdArray->SetNumberOfValues(temp->GetNumberOfCells());\n\n\t\/\/ in case some zones doesn't belong to a group\n\t\/\/ if it's sure that all zones belong to a group, this\n\t\/\/ loop should be removed to save time\n\t\/\/for(vtkIdType i=0; i<temp->GetNumberOfCells(); ++i)\n\t\/\/{\n\t\/\/\tgroupNameArray->SetValue(i, \"\");\n\t\/\/\tgroupIdArray->SetValue(i,0);\n\t\/\/}\n\n\tint groupId = 0;\n\twhile(line.substr(0,7) == \"ZGROUP \")\n\t{\n\t\tStringUtilities::split(line, lineSplit, \" \");\n\t\tstring groupName = lineSplit[1].substr(1,lineSplit[1].size()-2);\n\n\t\twhile(true)\n\t\t{\n\t\t\tdo\n\t\t\t{\n\t\t\t\tgetline(inFile, line);\n\t\t\t}while((line.size() == 0 || line[0] == '*') &! inFile.eof());\n\n\t\t\tif(line.size() == 0 || line[0] == '*' || inFile.eof() || line.substr(0,6) == \"ZGROUP\")\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tStringUtilities::split(line, lineSplit, \" \");\n\t\t\tfor(vector<string>::iterator it = lineSplit.begin(); it != lineSplit.end(); ++it)\n\t\t\t{\n\t\t\t\tint zone = atoi(it->c_str()) -1;\n\t\t\t\tgroupNameArray->SetValue(zone, groupName);\n\t\t\t\tgroupIdArray->SetValue(zone, groupId);\n\t\t\t}\n\t\t}\n\t\t++groupId;\n\t}\n\n\toutput->GetCellData()->AddArray(groupNameArray);\n\toutput->GetCellData()->AddArray(groupIdArray);\n\n\tinFile.close();\n\n\tthis->importDisplacements(output);\n\tthis->importScalars(output);\n\tthis->importTensors(output);\n\n\treturn 1;\n}\n\n\n\n\/\/_________________________________________________________________________\nvoid vtkFLAC3DReader::importDisplacements(vtkUnstructuredGrid *output)\n{\n\t\/\/ Make sure we have a file to read.\n\tif(!this->DisplacementVectorsFile)  {\n\t\treturn;\n\t}\n\tif(strlen(this->DisplacementVectorsFile)==0)  {\n\t\treturn;\n\t}\n\n\n\tifstream inFile;\n\tinFile.open(this->DisplacementVectorsFile, ios::in);\n\tif(!inFile)\n\t{\n\t\tvtkErrorMacro(\"File Error: cannot open file: \"<< this->DisplacementVectorsFile);\n\t\treturn;\n\t}\n\n\tvtkDoubleArray* dispArray = vtkDoubleArray::New();\n\tdispArray->SetName(\"Displacement Vectors\");\n\tdispArray->SetNumberOfComponents(3);\n\t\n\tdispArray->SetNumberOfTuples(output->GetNumberOfPoints());\n\tfor(vtkIdType i=0; i<output->GetNumberOfPoints(); ++i)\n\t{\n\t\tdispArray->SetTuple3(i,0,0,0);\n\t}\n\n\tstring line;\n\tvector<string> lineSplit;\n\n\t\/\/ skip the headers\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() > 0)\n\t\t\tbreak;\n\t}\n\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() < 4)\n\t\t\tcontinue;\n\n\t\tStringUtilities::split(line, lineSplit, \";\");\n\t\tvtkIdType id = atoi(lineSplit[0].c_str()) - 1;\n\t\tdouble dispX = atof(lineSplit[1].c_str());\n\t\tdouble dispY = atof(lineSplit[2].c_str());\n\t\tdouble dispZ = atof(lineSplit[3].c_str());\n\n\t\tdispArray->SetTuple3(id, dispX, dispY, dispZ);\n\t}\n\n\tinFile.close();\n\n\toutput->GetPointData()->AddArray(dispArray);\n}\n\n\/\/_________________________________________________________________________\nvoid vtkFLAC3DReader::importScalars(vtkUnstructuredGrid *output)\n{\n\t\/\/ Make sure we have a file to read.\n\tif(!this->ZonesScalarsFile)  {\n\t\treturn;\n\t}\n\tif(strlen(this->ZonesScalarsFile)==0)  {\n\t\treturn;\n\t}\n\n\n\tifstream inFile;\n\tinFile.open(this->ZonesScalarsFile, ios::in);\n\tif(!inFile)\n\t{\n\t\tvtkErrorMacro(\"File Error: cannot open file: \"<< this->ZonesScalarsFile);\n\t\treturn;\n\t}\n\n\tvtkIntArray* stateArray = vtkIntArray::New();\n\tstateArray->SetName(\"state\");\n\n\tvtkDoubleArray* cohesionArray = vtkDoubleArray::New();\n\tcohesionArray->SetName(\"cohesion(Pa)\");\n\n\tvtkDoubleArray* frictionArray = vtkDoubleArray::New();\n\tfrictionArray->SetName(\"friction()\");\n\n\tvtkIntArray* excavationYearArray = vtkIntArray::New();\n\texcavationYearArray->SetName(\"Excavation Year\");\n\n\tvtkDoubleArray* damageArray = vtkDoubleArray::New();\n\tdamageArray->SetName(\"damage\");\n\t\n\tstateArray->SetNumberOfValues(output->GetNumberOfCells());\n\tcohesionArray->SetNumberOfValues(output->GetNumberOfCells());\n\tfrictionArray->SetNumberOfValues(output->GetNumberOfCells());\n\texcavationYearArray->SetNumberOfValues(output->GetNumberOfCells());\n\tdamageArray->SetNumberOfValues(output->GetNumberOfCells());\n\n\tfor(vtkIdType i=0; i<output->GetNumberOfCells(); ++i)\n\t{\n\t\tstateArray->SetValue(i,0);\n\t\tcohesionArray->SetValue(i,0);\n\t\tfrictionArray->SetValue(i,0);\n\t\texcavationYearArray->SetValue(i,0);\n\t\tdamageArray->SetValue(i,0);\n\t}\n\n\tstring line;\n\tvector<string> lineSplit;\n\n\t\/\/ skip the headers\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() > 0)\n\t\t\tbreak;\n\t}\n\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() < 4)\n\t\t\tcontinue;\n\n\t\tStringUtilities::split(line, lineSplit, \";\");\n\t\tvtkIdType id = atoi(lineSplit[0].c_str()) - 1;\n\t\tdouble state = atof(lineSplit[1].c_str());\n\t\tdouble cohesion = atof(lineSplit[2].c_str());\n\t\tdouble friction = atof(lineSplit[3].c_str());\n\n\t\tint excavationYear = atoi(lineSplit[4].c_str());\n\t\tif(lineSplit[4] == \"pfin\")\n\t\t\texcavationYear = 9999;\n\n\t\tdouble damage = atof(lineSplit[5].c_str());\n\n\t\tstateArray->SetValue(id,state);\n\t\tcohesionArray->SetValue(id,cohesion);\n\t\tfrictionArray->SetValue(id,friction);\n\t\texcavationYearArray->SetValue(id,excavationYear);\n\t\tdamageArray->SetValue(id,damage);\n\t}\n\n\tinFile.close();\n\n\toutput->GetCellData()->AddArray(stateArray);\n\toutput->GetCellData()->AddArray(cohesionArray);\n\toutput->GetCellData()->AddArray(frictionArray);\n\toutput->GetCellData()->AddArray(excavationYearArray);\n\toutput->GetCellData()->AddArray(damageArray);\n}\n\n\n\/\/_________________________________________________________________________\nvoid vtkFLAC3DReader::importTensors(vtkUnstructuredGrid *output)\n{\n\t\/\/ Make sure we have a file to read.\n\tif(!this->ZonesTensorsFile)  {\n\t\treturn;\n\t}\n\tif(strlen(this->ZonesTensorsFile)==0)  {\n\t\treturn;\n\t}\n\n\n\tifstream inFile;\n\tinFile.open(this->ZonesTensorsFile, ios::in);\n\tif(!inFile)\n\t{\n\t\tvtkErrorMacro(\"File Error: cannot open file: \"<< this->ZonesTensorsFile);\n\t\treturn;\n\t}\n\n\tvtkDoubleArray* tensorsArray = vtkDoubleArray::New();\n\ttensorsArray->SetName(\"tensors(Pa)\");\n\ttensorsArray->SetNumberOfComponents(9);\n\t\n\ttensorsArray->SetNumberOfTuples(output->GetNumberOfPoints());\n\tfor(vtkIdType i=0; i<output->GetNumberOfPoints(); ++i)\n\t{\n\t\ttensorsArray->SetTuple9(i,0,0,0,0,0,0,0,0,0);\n\t}\n\n\tstring line;\n\tvector<string> lineSplit;\n\n\t\/\/ skip the headers\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() > 0)\n\t\t\tbreak;\n\t}\n\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() < 4)\n\t\t\tcontinue;\n\n\t\tStringUtilities::split(line, lineSplit, \";\");\n\t\tvtkIdType id = atoi(lineSplit[0].c_str()) - 1;\n\t\tdouble sxx = atof(lineSplit[1].c_str());\n\t\tdouble syy = atof(lineSplit[2].c_str());\n\t\tdouble szz = atof(lineSplit[3].c_str());\n\t\tdouble sxy = atof(lineSplit[4].c_str());\n\t\tdouble sxz = atof(lineSplit[5].c_str());\n\t\tdouble syz = atof(lineSplit[6].c_str());\n\n\t\ttensorsArray->SetTuple9(id, sxx, sxy, sxz, sxy, syy, syz, sxz, syz, szz);\n\t}\n\n\tinFile.close();\n\n\toutput->GetCellData()->AddArray(tensorsArray);\n}<commit_msg>FLAC3DReader fixed a bug in tensors array size<commit_after>#include \"vtkFLAC3DReader.h\"\n\n#include \"vtkUnstructuredGrid.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include <vtksys\/ios\/sstream>\n#include <sstream>\n\n#include <vtkStringList.h>\n#include <vtkStdString.h>\n#include <vtkStringArray.h>\n#include <vtkIntArray.h>\n#include <vtkDoubleArray.h>\n#include <vtkCellArray.h>\n#include <vtkPointData.h>\n#include <vtkCellData.h>\n\n#include \"StringUtilities.h\"\n\n\nvtkCxxRevisionMacro(vtkFLAC3DReader, \"$Revision: 1.1 $\");\nvtkStandardNewMacro(vtkFLAC3DReader);\n\n\/\/_________________________________________________________________________\nvtkFLAC3DReader::vtkFLAC3DReader()\n{\n\tthis->FileName = NULL;\n\tthis->SetNumberOfInputPorts(0);\n\n\tthis->DisplacementVectorsFile = NULL;\n\tthis->ZonesScalarsFile = NULL;\n\tthis->ZonesTensorsFile = NULL;\n}\n\n\/\/_________________________________________________________________________\nvtkFLAC3DReader::~vtkFLAC3DReader()\n{\n\tthis->SetFileName(NULL);\n}\n\n\/\/_________________________________________________________________________\nvoid vtkFLAC3DReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n\tthis->Superclass::PrintSelf(os,indent);\n\tos << indent <<  \"FileName: \"\n\t\t<< (this->FileName ? this->FileName : \"(none)\") << \"\\n\";\n}\n\n\/\/_________________________________________________________________________\nint vtkFLAC3DReader::CanReadFile( const char* fname )\n{\n\treturn 1;\t\n}\n\n\/\/_________________________________________________________________________\nint vtkFLAC3DReader::RequestInformation(vtkInformation* request,\n\t\t\t\t\t\t\t\t\t  vtkInformationVector** inputVector,\n\t\t\t\t\t\t\t\t\t  vtkInformationVector* outputVector)\n{\n\treturn 1;\n}\n\n\n\/\/_________________________________________________________________________\nint vtkFLAC3DReader::RequestData(vtkInformation* request,\n\t\t\t\t\t\t\t   vtkInformationVector** inputVector,\n\t\t\t\t\t\t\t   vtkInformationVector* outputVector)\n{\n\tvtkInformation *outInfo = outputVector->GetInformationObject(0);\n\tvtkUnstructuredGrid *output = vtkUnstructuredGrid::SafeDownCast(outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n\t\/\/ Make sure we have a file to read.\n\tif(!this->FileName)  {\n\t\tvtkErrorMacro(\"No file name specified.  Cannot open.\");\n\t\treturn 0;\n\t}\n\tif(strlen(this->FileName)==0)  {\n\t\tvtkErrorMacro(\"File name is null.  Cannot open.\");\n\t\treturn 0;\n\t}\n\n\n\tifstream inFile;\n\tinFile.open(this->FileName, ios::in);\n\tif(!inFile)\n\t{\n\t\tvtkErrorMacro(\"File Error: cannot open file: \"<< this->FileName);\n\t\treturn 0;\n\t}\n\n\tvtkPoints* outPoints = vtkPoints::New();\n\n\tvtkIdType ids[8];\n\tstring line;\n\tvector<string> lineSplit;\n\n\t\/\/ skip the headers\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() == 0) continue;\n\t\tif(line[0] == '*') continue;\n\t\tif(line[0] == 'G')\n\t\t\tbreak;\n\t}\n\n\t\/\/ read the GRIDPOINTS section\n\twhile(line.substr(0,2) == \"G \")\n\t{\n\t\tStringUtilities::split(line, lineSplit, \" \");\n\n\t\tvtkIdType id;\n\t\tdouble pt[3];\n\t\tid = atoi(lineSplit[1].c_str());\n\t\tpt[0] = atof(lineSplit[2].c_str());\n\t\tpt[1] = atof(lineSplit[3].c_str());\n\t\tpt[2] = atof(lineSplit[4].c_str());\n\n\t\toutPoints->InsertNextPoint(pt);\n\n\t\tif(inFile.eof()) break;\n\n\t\tdo\n\t\t{\n\t\t\tgetline(inFile, line);\n\t\t}while((line.size() == 0 || line[0] == '*') &! inFile.eof());\n\n\t\tif(line.size() == 0 || line[0] == '*')\n\t\t\tbreak;\n\t}\n\n\tif(line.size() == 0 || line[0] == '*' || inFile.eof())\n\t{\n\t\toutput->SetPoints(outPoints);\n\t\toutPoints->Delete();\n\t\treturn 1;\n\t}\n\n\tvtkUnstructuredGrid* temp= vtkUnstructuredGrid::New();\n\n\t\/\/ read the ZONES section\n\twhile(line.substr(0,2) == \"Z \")\n\t{\n\t\tStringUtilities::split(line, lineSplit, \" \");\n\n\t\tif(lineSplit[1] == \"B8\")\n\t\t{\n\t\t\tvtkIdType id = atoi(lineSplit[2].c_str());\n\n\t\t\t\/\/ see FLAC3D documentation for hexahedron topology\n\t\t\tids[0] = atoi(lineSplit[3].c_str()) -1;\n\t\t\tids[1] = atoi(lineSplit[4].c_str()) -1;\n\t\t\tids[2] = atoi(lineSplit[7].c_str()) -1;\n\t\t\tids[3] = atoi(lineSplit[5].c_str()) -1;\n\t\t\tids[4] = atoi(lineSplit[6].c_str()) -1;\n\t\t\tids[5] = atoi(lineSplit[9].c_str()) -1;\n\t\t\tids[6] = atoi(lineSplit[10].c_str()) -1;\n\t\t\tids[7] = atoi(lineSplit[8].c_str()) -1;\n\n\t\t\ttemp->InsertNextCell(VTK_HEXAHEDRON,8,ids);\n\t\t}\n\n\t\tif(inFile.eof()) break;\n\n\t\tdo\n\t\t{\n\t\t\tgetline(inFile, line);\n\t\t}while((line.size() == 0 || line[0] == '*') &! inFile.eof());\n\n\t\tif(line.size() == 0 || line[0] == '*')\n\t\t\tbreak;\n\t}\n\n\ttemp->SetPoints(outPoints);\n\toutput->ShallowCopy(temp);\n\toutPoints->Delete();\n\n\tif(line.size() == 0 || line[0] == '*' || inFile.eof())\n\t\treturn 1;\n\n\tvtkStringArray* groupNameArray = vtkStringArray::New();\n\tgroupNameArray->SetName(\"Group Name\");\n\tgroupNameArray->SetNumberOfValues(temp->GetNumberOfCells());\n\n\tvtkIntArray* groupIdArray = vtkIntArray::New();\n\tgroupIdArray->SetName(\"Group Id\");\n\tgroupIdArray->SetNumberOfValues(temp->GetNumberOfCells());\n\n\t\/\/ in case some zones doesn't belong to a group\n\t\/\/ if it's sure that all zones belong to a group, this\n\t\/\/ loop should be removed to save time\n\t\/\/for(vtkIdType i=0; i<temp->GetNumberOfCells(); ++i)\n\t\/\/{\n\t\/\/\tgroupNameArray->SetValue(i, \"\");\n\t\/\/\tgroupIdArray->SetValue(i,0);\n\t\/\/}\n\n\tint groupId = 0;\n\twhile(line.substr(0,7) == \"ZGROUP \")\n\t{\n\t\tStringUtilities::split(line, lineSplit, \" \");\n\t\tstring groupName = lineSplit[1].substr(1,lineSplit[1].size()-2);\n\n\t\twhile(true)\n\t\t{\n\t\t\tdo\n\t\t\t{\n\t\t\t\tgetline(inFile, line);\n\t\t\t}while((line.size() == 0 || line[0] == '*') &! inFile.eof());\n\n\t\t\tif(line.size() == 0 || line[0] == '*' || inFile.eof() || line.substr(0,6) == \"ZGROUP\")\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tStringUtilities::split(line, lineSplit, \" \");\n\t\t\tfor(vector<string>::iterator it = lineSplit.begin(); it != lineSplit.end(); ++it)\n\t\t\t{\n\t\t\t\tint zone = atoi(it->c_str()) -1;\n\t\t\t\tgroupNameArray->SetValue(zone, groupName);\n\t\t\t\tgroupIdArray->SetValue(zone, groupId);\n\t\t\t}\n\t\t}\n\t\t++groupId;\n\t}\n\n\toutput->GetCellData()->AddArray(groupNameArray);\n\toutput->GetCellData()->AddArray(groupIdArray);\n\n\tinFile.close();\n\n\tthis->importDisplacements(output);\n\tthis->importScalars(output);\n\tthis->importTensors(output);\n\n\treturn 1;\n}\n\n\n\n\/\/_________________________________________________________________________\nvoid vtkFLAC3DReader::importDisplacements(vtkUnstructuredGrid *output)\n{\n\t\/\/ Make sure we have a file to read.\n\tif(!this->DisplacementVectorsFile)  {\n\t\treturn;\n\t}\n\tif(strlen(this->DisplacementVectorsFile)==0)  {\n\t\treturn;\n\t}\n\n\n\tifstream inFile;\n\tinFile.open(this->DisplacementVectorsFile, ios::in);\n\tif(!inFile)\n\t{\n\t\tvtkErrorMacro(\"File Error: cannot open file: \"<< this->DisplacementVectorsFile);\n\t\treturn;\n\t}\n\n\tvtkDoubleArray* dispArray = vtkDoubleArray::New();\n\tdispArray->SetName(\"Displacement Vectors\");\n\tdispArray->SetNumberOfComponents(3);\n\t\n\tdispArray->SetNumberOfTuples(output->GetNumberOfPoints());\n\tfor(vtkIdType i=0; i<output->GetNumberOfPoints(); ++i)\n\t{\n\t\tdispArray->SetTuple3(i,0,0,0);\n\t}\n\n\tstring line;\n\tvector<string> lineSplit;\n\n\t\/\/ skip the headers\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() > 0)\n\t\t\tbreak;\n\t}\n\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() < 4)\n\t\t\tcontinue;\n\n\t\tStringUtilities::split(line, lineSplit, \";\");\n\t\tvtkIdType id = atoi(lineSplit[0].c_str()) - 1;\n\t\tdouble dispX = atof(lineSplit[1].c_str());\n\t\tdouble dispY = atof(lineSplit[2].c_str());\n\t\tdouble dispZ = atof(lineSplit[3].c_str());\n\n\t\tdispArray->SetTuple3(id, dispX, dispY, dispZ);\n\t}\n\n\tinFile.close();\n\n\toutput->GetPointData()->AddArray(dispArray);\n}\n\n\/\/_________________________________________________________________________\nvoid vtkFLAC3DReader::importScalars(vtkUnstructuredGrid *output)\n{\n\t\/\/ Make sure we have a file to read.\n\tif(!this->ZonesScalarsFile)  {\n\t\treturn;\n\t}\n\tif(strlen(this->ZonesScalarsFile)==0)  {\n\t\treturn;\n\t}\n\n\n\tifstream inFile;\n\tinFile.open(this->ZonesScalarsFile, ios::in);\n\tif(!inFile)\n\t{\n\t\tvtkErrorMacro(\"File Error: cannot open file: \"<< this->ZonesScalarsFile);\n\t\treturn;\n\t}\n\n\tvtkIntArray* stateArray = vtkIntArray::New();\n\tstateArray->SetName(\"state\");\n\n\tvtkDoubleArray* cohesionArray = vtkDoubleArray::New();\n\tcohesionArray->SetName(\"cohesion(Pa)\");\n\n\tvtkDoubleArray* frictionArray = vtkDoubleArray::New();\n\tfrictionArray->SetName(\"friction()\");\n\n\tvtkIntArray* excavationYearArray = vtkIntArray::New();\n\texcavationYearArray->SetName(\"Excavation Year\");\n\n\tvtkDoubleArray* damageArray = vtkDoubleArray::New();\n\tdamageArray->SetName(\"damage\");\n\t\n\tstateArray->SetNumberOfValues(output->GetNumberOfCells());\n\tcohesionArray->SetNumberOfValues(output->GetNumberOfCells());\n\tfrictionArray->SetNumberOfValues(output->GetNumberOfCells());\n\texcavationYearArray->SetNumberOfValues(output->GetNumberOfCells());\n\tdamageArray->SetNumberOfValues(output->GetNumberOfCells());\n\n\tfor(vtkIdType i=0; i<output->GetNumberOfCells(); ++i)\n\t{\n\t\tstateArray->SetValue(i,0);\n\t\tcohesionArray->SetValue(i,0);\n\t\tfrictionArray->SetValue(i,0);\n\t\texcavationYearArray->SetValue(i,0);\n\t\tdamageArray->SetValue(i,0);\n\t}\n\n\tstring line;\n\tvector<string> lineSplit;\n\n\t\/\/ skip the headers\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() > 0)\n\t\t\tbreak;\n\t}\n\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() < 4)\n\t\t\tcontinue;\n\n\t\tStringUtilities::split(line, lineSplit, \";\");\n\t\tvtkIdType id = atoi(lineSplit[0].c_str()) - 1;\n\t\tdouble state = atof(lineSplit[1].c_str());\n\t\tdouble cohesion = atof(lineSplit[2].c_str());\n\t\tdouble friction = atof(lineSplit[3].c_str());\n\n\t\tint excavationYear = atoi(lineSplit[4].c_str());\n\t\tif(lineSplit[4] == \"pfin\")\n\t\t\texcavationYear = 9999;\n\n\t\tdouble damage = atof(lineSplit[5].c_str());\n\n\t\tstateArray->SetValue(id,state);\n\t\tcohesionArray->SetValue(id,cohesion);\n\t\tfrictionArray->SetValue(id,friction);\n\t\texcavationYearArray->SetValue(id,excavationYear);\n\t\tdamageArray->SetValue(id,damage);\n\t}\n\n\tinFile.close();\n\n\toutput->GetCellData()->AddArray(stateArray);\n\toutput->GetCellData()->AddArray(cohesionArray);\n\toutput->GetCellData()->AddArray(frictionArray);\n\toutput->GetCellData()->AddArray(excavationYearArray);\n\toutput->GetCellData()->AddArray(damageArray);\n}\n\n\n\/\/_________________________________________________________________________\nvoid vtkFLAC3DReader::importTensors(vtkUnstructuredGrid *output)\n{\n\t\/\/ Make sure we have a file to read.\n\tif(!this->ZonesTensorsFile)  {\n\t\treturn;\n\t}\n\tif(strlen(this->ZonesTensorsFile)==0)  {\n\t\treturn;\n\t}\n\n\n\tifstream inFile;\n\tinFile.open(this->ZonesTensorsFile, ios::in);\n\tif(!inFile)\n\t{\n\t\tvtkErrorMacro(\"File Error: cannot open file: \"<< this->ZonesTensorsFile);\n\t\treturn;\n\t}\n\n\tvtkDoubleArray* tensorsArray = vtkDoubleArray::New();\n\ttensorsArray->SetName(\"tensors(Pa)\");\n\ttensorsArray->SetNumberOfComponents(9);\n\t\n\ttensorsArray->SetNumberOfTuples(output->GetNumberOfCells());\n\tfor(vtkIdType i=0; i<output->GetNumberOfCells(); ++i)\n\t{\n\t\ttensorsArray->SetTuple9(i,0,0,0,0,0,0,0,0,0);\n\t}\n\n\tstring line;\n\tvector<string> lineSplit;\n\n\t\/\/ skip the headers\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() > 0)\n\t\t\tbreak;\n\t}\n\n\twhile(!inFile.eof())\n\t{\n\t\tgetline(inFile, line);\n\t\tif(line.size() < 4)\n\t\t\tcontinue;\n\n\t\tStringUtilities::split(line, lineSplit, \";\");\n\t\tvtkIdType id = atoi(lineSplit[0].c_str()) - 1;\n\t\tdouble sxx = atof(lineSplit[1].c_str());\n\t\tdouble syy = atof(lineSplit[2].c_str());\n\t\tdouble szz = atof(lineSplit[3].c_str());\n\t\tdouble sxy = atof(lineSplit[4].c_str());\n\t\tdouble sxz = atof(lineSplit[5].c_str());\n\t\tdouble syz = atof(lineSplit[6].c_str());\n\n\t\ttensorsArray->SetTuple9(id, sxx, sxy, sxz, sxy, syy, syz, sxz, syz, szz);\n\t}\n\n\tinFile.close();\n\n\toutput->GetCellData()->AddArray(tensorsArray);\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2007, 2008 libmv authors.\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#include <cmath>\n\n#include \"libmv\/image\/image.h\"\n#include \"libmv\/image\/convolve.h\"\n\nnamespace libmv {\n\n\/\/ Compute a Gaussian kernel and derivative, such that you can take the\n\/\/ derivative of an image by convolving with the kernel horizontally then the\n\/\/ derivative vertically to get (eg) the y derivative.\nvoid ComputeGaussianKernel(double sigma, Vec *kernel, Vec *derivative) {\n  assert(sigma >= 0.0);\n\n  \/\/ 0.004 implies a 3 pixel kernel with 1 pixel sigma.\n  const float truncation_factor = 0.004f;\n\n  \/\/ Calculate the kernel size based on sigma such that it is odd.\n  float precisehalfwidth = GaussianInversePositive(truncation_factor, sigma);\n  int width = lround(2*precisehalfwidth);\n  if (width % 2 == 0) {\n    width++;\n  }\n  \/\/ Calculate the gaussian kernel and its derivative.\n  kernel->resize(width);\n  derivative->resize(width);\n  kernel->setZero();\n  derivative->setZero();\n  int halfwidth = width \/ 2;\n  for (int i = -halfwidth; i <= halfwidth; ++i)  {\n    (*kernel)(i + halfwidth) = Gaussian(i, sigma);\n    (*derivative)(i + halfwidth) = GaussianDerivative(i, sigma);\n  }\n  \/\/ Since images should not get brighter or darker, normalize.\n  NormalizeL1(kernel);\n\n  \/\/ Normalize the derivative differently. See\n  \/\/ www.cs.duke.edu\/courses\/spring03\/cps296.1\/handouts\/Image%20Processing.pdf\n  double factor = 0.;\n  for (int i = -halfwidth; i <= halfwidth; ++i)  {\n    factor -= i*(*derivative)(i+halfwidth);\n  }\n  *derivative \/= factor;\n}\n\ntemplate <int size, bool vertical>\nvoid FastConvolve(const Vec &kernel, int width, int height,\n                  const float* src, int src_stride, int src_line_stride,\n                  float* dst, int dst_stride) {\n  double coefficients[2 * size + 1];\n  for (int k = 0; k < 2 * size + 1; ++k) {\n    coefficients[k] = kernel(2 * size - k);\n  }\n  \/\/ Fast path: if the kernel has a certain size, use the constant sized loops.\n  for (int y = 0; y < height; ++y) {\n    for (int x = 0; x < width; ++x) {\n      double sum = 0;\n      for (int k = -size; k <= size; ++k) {\n        if (vertical) {\n          if (y + k >= 0 && y + k < height) {\n            sum += src[k * src_line_stride] * coefficients[k + size];\n          }\n        } else {\n          if (x + k >= 0 && x + k < width) {\n            sum += src[k * src_stride] * coefficients[k + size];\n          }\n        }\n      }\n      dst[0] = static_cast<float>(sum);\n      src += src_stride;\n      dst += dst_stride;\n    }\n  }\n}\n\ntemplate<bool vertical>\nvoid Convolve(const Array3Df &in,\n              const Vec &kernel,\n              Array3Df *out_pointer,\n              int plane) {\n  int width = in.Width();\n  int height = in.Height();\n  Array3Df &out = *out_pointer;\n  if (plane == -1) {\n    out.ResizeLike(in);\n    plane = 0;\n  }\n\n  assert(kernel.size() % 2 == 1);\n  assert(&in != out_pointer);\n\n  int src_line_stride = in.Stride(0);\n  int src_stride = in.Stride(1);\n  int dst_stride = out.Stride(1);\n  const float* src = in.Data();\n  float* dst = out.Data()+plane;\n\n  \/\/ Use a dispatch table to make most convolutions used in practice use the\n  \/\/ fast path.\n  int half_width = kernel.size() \/ 2;\n  switch (half_width) {\n    case 1:\n      FastConvolve<1, vertical>(kernel, width, height, src, src_stride,\n                                src_line_stride, dst, dst_stride);\n      break;\n    case 2:\n      FastConvolve<2, vertical>(kernel, width, height, src, src_stride,\n                                src_line_stride, dst, dst_stride);\n      break;\n    case 3:\n      FastConvolve<3, vertical>(kernel, width, height, src, src_stride,\n                                src_line_stride, dst, dst_stride);\n      break;\n    case 4:\n      FastConvolve<4, vertical>(kernel, width, height, src, src_stride,\n                                src_line_stride, dst, dst_stride);\n      break;\n    case 5:\n      FastConvolve<5, vertical>(kernel, width, height, src, src_stride,\n                                src_line_stride, dst, dst_stride);\n      break;\n    case 6:\n      FastConvolve<6, vertical>(kernel, width, height, src, src_stride,\n                                src_line_stride, dst, dst_stride);\n      break;\n    case 7:\n      FastConvolve<7, vertical>(kernel, width, height, src, src_stride,\n                                src_line_stride, dst, dst_stride);\n      break;\n    default:\n      int dynamic_size = kernel.size() \/ 2;\n      for (int y = 0; y < height; ++y) {\n        for (int x = 0; x < width; ++x) {\n          double sum = 0;\n          \/\/ Slow path: this loop cannot be unrolled.\n          for (int k = -dynamic_size; k <= dynamic_size; ++k) {\n            if(vertical) {\n              if (y + k >= 0 && y + k < height) {\n                sum += src[k * src_line_stride] * kernel(2 * dynamic_size - (k + dynamic_size));\n              }\n            } else {\n              if (x + k >= 0 && x + k < width) {\n                sum += src[k * src_stride] * kernel(2 * dynamic_size - (k + dynamic_size));\n              }\n            }\n          }\n          dst[0] = static_cast<float>(sum);\n          src += src_stride;\n          dst += dst_stride;\n        }\n      }\n  }\n}\n\nvoid ConvolveHorizontal(const Array3Df &in,\n                        const Vec &kernel,\n                        Array3Df *out_pointer,\n                        int plane) {\n  Convolve<false>(in, kernel, out_pointer, plane);\n}\n\nvoid ConvolveVertical(const Array3Df &in,\n                      const Vec &kernel,\n                      Array3Df *out_pointer,\n                      int plane) {\n  Convolve<true>(in, kernel, out_pointer, plane);\n}\n\nvoid ConvolveGaussian(const Array3Df &in,\n                      double sigma,\n                      Array3Df *out_pointer) {\n  Vec kernel, derivative;\n  ComputeGaussianKernel(sigma, &kernel, &derivative);\n\n  Array3Df tmp;\n  ConvolveVertical(in, kernel, &tmp);\n  ConvolveHorizontal(tmp, kernel, out_pointer);\n}\n\nvoid BlurredImageAndDerivatives(const Array3Df &in,\n                                double sigma,\n                                Array3Df *blurred_image,\n                                Array3Df *gradient_x,\n                                Array3Df *gradient_y) {\n  Vec kernel, derivative;\n  ComputeGaussianKernel(sigma, &kernel, &derivative);\n  Array3Df tmp;\n\n  \/\/ Compute convolved image.\n  ConvolveVertical(in, kernel, &tmp);\n  ConvolveHorizontal(tmp, kernel, blurred_image);\n\n  \/\/ Compute first derivative in x (reusing vertical convolution above).\n  ConvolveHorizontal(tmp, derivative, gradient_x);\n\n  \/\/ Compute first derivative in y.\n  ConvolveHorizontal(in, kernel, &tmp);\n  ConvolveVertical(tmp, derivative, gradient_y);\n}\n\n\/\/ Compute the gaussian blur of an image and the derivatives of the blurred\n\/\/ image, and store the results in three channels. Since the blurred value and\n\/\/ gradients are closer in memory, this leads to better performance if all\n\/\/ three values are needed at the same time.\nvoid BlurredImageAndDerivativesChannels(const Array3Df &in,\n                                        double sigma,\n                                        Array3Df *blurred_and_gradxy) {\n  assert(in.Depth() == 1);\n\n  Vec kernel, derivative;\n  ComputeGaussianKernel(sigma, &kernel, &derivative);\n\n  \/\/ Compute convolved image.\n  Array3Df tmp;\n  ConvolveVertical(in, kernel, &tmp);\n  blurred_and_gradxy->Resize(in.Height(), in.Width(), 3);\n  ConvolveHorizontal(tmp, kernel, blurred_and_gradxy, 0);\n\n  \/\/ Compute first derivative in x.\n  ConvolveHorizontal(tmp, derivative, blurred_and_gradxy, 1);\n\n  \/\/ Compute first derivative in y.\n  ConvolveHorizontal(in, kernel, &tmp);\n  ConvolveVertical(tmp, derivative, blurred_and_gradxy, 2);\n}\n\nvoid BoxFilterHorizontal(const Array3Df &in,\n                         int window_size,\n                         Array3Df *out_pointer) {\n  Array3Df &out = *out_pointer;\n  out.ResizeLike(in);\n  int half_width = (window_size - 1) \/ 2;\n\n  for (int k = 0; k < in.Depth(); ++k) {\n    for (int i=0; i<in.Height(); ++i) {\n      float sum = 0;\n      \/\/ Init sum.\n      for (int j=0; j<half_width; ++j) {\n        sum += in(i, j, k);\n      }\n      \/\/ Fill left border.\n      for (int j=0; j < half_width + 1; ++j) {\n        sum += in(i, j + half_width, k);\n        out(i, j, k) = sum;\n      }\n      \/\/ Fill interior.\n      for (int j = half_width + 1; j<in.Width()-half_width; ++j) {\n        sum -= in(i, j - half_width - 1, k);\n        sum += in(i, j + half_width, k);\n        out(i, j, k) = sum;\n      }\n      \/\/ Fill right border.\n      for (int j = in.Width() - half_width; j<in.Width(); ++j) {\n        sum -= in(i, j - half_width - 1, k);\n        out(i, j, k) = sum;\n      }\n    }\n  }\n}\n\nvoid BoxFilterVertical(const Array3Df &in,\n                       int window_size,\n                       Array3Df *out_pointer) {\n  Array3Df &out = *out_pointer;\n  out.ResizeLike(in);\n  int half_width = (window_size - 1) \/ 2;\n\n  for (int k = 0; k < in.Depth(); ++k) {\n    for (int j = 0; j < in.Width(); ++j) {\n      float sum = 0;\n      \/\/ Init sum.\n      for (int i=0; i<half_width; ++i) {\n        sum += in(i, j, k);\n      }\n      \/\/ Fill left border.\n      for (int i=0; i < half_width + 1; ++i) {\n        sum += in(i + half_width, j, k);\n        out(i, j, k) = sum;\n      }\n      \/\/ Fill interior.\n      for (int i = half_width + 1; i<in.Height()-half_width; ++i) {\n        sum -= in(i - half_width - 1, j, k);\n        sum += in(i + half_width, j, k);\n        out(i, j, k) = sum;\n      }\n      \/\/ Fill right border.\n      for (int i = in.Height() - half_width; i<in.Height(); ++i) {\n        sum -= in(i - half_width - 1, j, k);\n        out(i, j, k) = sum;\n      }\n    }\n  }\n}\n\nvoid BoxFilter(const Array3Df &in,\n               int box_width,\n               Array3Df *out) {\n  Array3Df tmp;\n  BoxFilterHorizontal(in, box_width, &tmp);\n  BoxFilterVertical(tmp, box_width, out);\n}\n\n}  \/\/ namespace libmv\n<commit_msg>Reduce convolution boilerplate.<commit_after>\/\/ Copyright (c) 2007, 2008 libmv authors.\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#include <cmath>\n\n#include \"libmv\/image\/image.h\"\n#include \"libmv\/image\/convolve.h\"\n\nnamespace libmv {\n\n\/\/ Compute a Gaussian kernel and derivative, such that you can take the\n\/\/ derivative of an image by convolving with the kernel horizontally then the\n\/\/ derivative vertically to get (eg) the y derivative.\nvoid ComputeGaussianKernel(double sigma, Vec *kernel, Vec *derivative) {\n  assert(sigma >= 0.0);\n\n  \/\/ 0.004 implies a 3 pixel kernel with 1 pixel sigma.\n  const float truncation_factor = 0.004f;\n\n  \/\/ Calculate the kernel size based on sigma such that it is odd.\n  float precisehalfwidth = GaussianInversePositive(truncation_factor, sigma);\n  int width = lround(2*precisehalfwidth);\n  if (width % 2 == 0) {\n    width++;\n  }\n  \/\/ Calculate the gaussian kernel and its derivative.\n  kernel->resize(width);\n  derivative->resize(width);\n  kernel->setZero();\n  derivative->setZero();\n  int halfwidth = width \/ 2;\n  for (int i = -halfwidth; i <= halfwidth; ++i)  {\n    (*kernel)(i + halfwidth) = Gaussian(i, sigma);\n    (*derivative)(i + halfwidth) = GaussianDerivative(i, sigma);\n  }\n  \/\/ Since images should not get brighter or darker, normalize.\n  NormalizeL1(kernel);\n\n  \/\/ Normalize the derivative differently. See\n  \/\/ www.cs.duke.edu\/courses\/spring03\/cps296.1\/handouts\/Image%20Processing.pdf\n  double factor = 0.;\n  for (int i = -halfwidth; i <= halfwidth; ++i)  {\n    factor -= i*(*derivative)(i+halfwidth);\n  }\n  *derivative \/= factor;\n}\n\ntemplate <int size, bool vertical>\nvoid FastConvolve(const Vec &kernel, int width, int height,\n                  const float* src, int src_stride, int src_line_stride,\n                  float* dst, int dst_stride) {\n  double coefficients[2 * size + 1];\n  for (int k = 0; k < 2 * size + 1; ++k) {\n    coefficients[k] = kernel(2 * size - k);\n  }\n  \/\/ Fast path: if the kernel has a certain size, use the constant sized loops.\n  for (int y = 0; y < height; ++y) {\n    for (int x = 0; x < width; ++x) {\n      double sum = 0;\n      for (int k = -size; k <= size; ++k) {\n        if (vertical) {\n          if (y + k >= 0 && y + k < height) {\n            sum += src[k * src_line_stride] * coefficients[k + size];\n          }\n        } else {\n          if (x + k >= 0 && x + k < width) {\n            sum += src[k * src_stride] * coefficients[k + size];\n          }\n        }\n      }\n      dst[0] = static_cast<float>(sum);\n      src += src_stride;\n      dst += dst_stride;\n    }\n  }\n}\n\ntemplate<bool vertical>\nvoid Convolve(const Array3Df &in,\n              const Vec &kernel,\n              Array3Df *out_pointer,\n              int plane) {\n  int width = in.Width();\n  int height = in.Height();\n  Array3Df &out = *out_pointer;\n  if (plane == -1) {\n    out.ResizeLike(in);\n    plane = 0;\n  }\n\n  assert(kernel.size() % 2 == 1);\n  assert(&in != out_pointer);\n\n  int src_line_stride = in.Stride(0);\n  int src_stride = in.Stride(1);\n  int dst_stride = out.Stride(1);\n  const float* src = in.Data();\n  float* dst = out.Data() + plane;\n\n  \/\/ Use a dispatch table to make most convolutions used in practice use the\n  \/\/ fast path.\n  int half_width = kernel.size() \/ 2;\n  switch (half_width) {\n#define static_convolution( size ) case size: \\\n  FastConvolve<size, vertical>(kernel, width, height, src, src_stride, \\\n                               src_line_stride, dst, dst_stride); break;\n    static_convolution(1)\n    static_convolution(2)\n    static_convolution(3)\n    static_convolution(4)\n    static_convolution(5)\n    static_convolution(6)\n    static_convolution(7)\n#undef static_convolution\n    default:\n      int dynamic_size = kernel.size() \/ 2;\n      for (int y = 0; y < height; ++y) {\n        for (int x = 0; x < width; ++x) {\n          double sum = 0;\n          \/\/ Slow path: this loop cannot be unrolled.\n          for (int k = -dynamic_size; k <= dynamic_size; ++k) {\n            if(vertical) {\n              if (y + k >= 0 && y + k < height) {\n                sum += src[k * src_line_stride] * kernel(2 * dynamic_size - (k + dynamic_size));\n              }\n            } else {\n              if (x + k >= 0 && x + k < width) {\n                sum += src[k * src_stride] * kernel(2 * dynamic_size - (k + dynamic_size));\n              }\n            }\n          }\n          dst[0] = static_cast<float>(sum);\n          src += src_stride;\n          dst += dst_stride;\n        }\n      }\n  }\n}\n\nvoid ConvolveHorizontal(const Array3Df &in,\n                        const Vec &kernel,\n                        Array3Df *out_pointer,\n                        int plane) {\n  Convolve<false>(in, kernel, out_pointer, plane);\n}\n\nvoid ConvolveVertical(const Array3Df &in,\n                      const Vec &kernel,\n                      Array3Df *out_pointer,\n                      int plane) {\n  Convolve<true>(in, kernel, out_pointer, plane);\n}\n\nvoid ConvolveGaussian(const Array3Df &in,\n                      double sigma,\n                      Array3Df *out_pointer) {\n  Vec kernel, derivative;\n  ComputeGaussianKernel(sigma, &kernel, &derivative);\n\n  Array3Df tmp;\n  ConvolveVertical(in, kernel, &tmp);\n  ConvolveHorizontal(tmp, kernel, out_pointer);\n}\n\nvoid BlurredImageAndDerivatives(const Array3Df &in,\n                                double sigma,\n                                Array3Df *blurred_image,\n                                Array3Df *gradient_x,\n                                Array3Df *gradient_y) {\n  Vec kernel, derivative;\n  ComputeGaussianKernel(sigma, &kernel, &derivative);\n  Array3Df tmp;\n\n  \/\/ Compute convolved image.\n  ConvolveVertical(in, kernel, &tmp);\n  ConvolveHorizontal(tmp, kernel, blurred_image);\n\n  \/\/ Compute first derivative in x (reusing vertical convolution above).\n  ConvolveHorizontal(tmp, derivative, gradient_x);\n\n  \/\/ Compute first derivative in y.\n  ConvolveHorizontal(in, kernel, &tmp);\n  ConvolveVertical(tmp, derivative, gradient_y);\n}\n\n\/\/ Compute the gaussian blur of an image and the derivatives of the blurred\n\/\/ image, and store the results in three channels. Since the blurred value and\n\/\/ gradients are closer in memory, this leads to better performance if all\n\/\/ three values are needed at the same time.\nvoid BlurredImageAndDerivativesChannels(const Array3Df &in,\n                                        double sigma,\n                                        Array3Df *blurred_and_gradxy) {\n  assert(in.Depth() == 1);\n\n  Vec kernel, derivative;\n  ComputeGaussianKernel(sigma, &kernel, &derivative);\n\n  \/\/ Compute convolved image.\n  Array3Df tmp;\n  ConvolveVertical(in, kernel, &tmp);\n  blurred_and_gradxy->Resize(in.Height(), in.Width(), 3);\n  ConvolveHorizontal(tmp, kernel, blurred_and_gradxy, 0);\n\n  \/\/ Compute first derivative in x.\n  ConvolveHorizontal(tmp, derivative, blurred_and_gradxy, 1);\n\n  \/\/ Compute first derivative in y.\n  ConvolveHorizontal(in, kernel, &tmp);\n  ConvolveVertical(tmp, derivative, blurred_and_gradxy, 2);\n}\n\nvoid BoxFilterHorizontal(const Array3Df &in,\n                         int window_size,\n                         Array3Df *out_pointer) {\n  Array3Df &out = *out_pointer;\n  out.ResizeLike(in);\n  int half_width = (window_size - 1) \/ 2;\n\n  for (int k = 0; k < in.Depth(); ++k) {\n    for (int i=0; i<in.Height(); ++i) {\n      float sum = 0;\n      \/\/ Init sum.\n      for (int j=0; j<half_width; ++j) {\n        sum += in(i, j, k);\n      }\n      \/\/ Fill left border.\n      for (int j=0; j < half_width + 1; ++j) {\n        sum += in(i, j + half_width, k);\n        out(i, j, k) = sum;\n      }\n      \/\/ Fill interior.\n      for (int j = half_width + 1; j<in.Width()-half_width; ++j) {\n        sum -= in(i, j - half_width - 1, k);\n        sum += in(i, j + half_width, k);\n        out(i, j, k) = sum;\n      }\n      \/\/ Fill right border.\n      for (int j = in.Width() - half_width; j<in.Width(); ++j) {\n        sum -= in(i, j - half_width - 1, k);\n        out(i, j, k) = sum;\n      }\n    }\n  }\n}\n\nvoid BoxFilterVertical(const Array3Df &in,\n                       int window_size,\n                       Array3Df *out_pointer) {\n  Array3Df &out = *out_pointer;\n  out.ResizeLike(in);\n  int half_width = (window_size - 1) \/ 2;\n\n  for (int k = 0; k < in.Depth(); ++k) {\n    for (int j = 0; j < in.Width(); ++j) {\n      float sum = 0;\n      \/\/ Init sum.\n      for (int i=0; i<half_width; ++i) {\n        sum += in(i, j, k);\n      }\n      \/\/ Fill left border.\n      for (int i=0; i < half_width + 1; ++i) {\n        sum += in(i + half_width, j, k);\n        out(i, j, k) = sum;\n      }\n      \/\/ Fill interior.\n      for (int i = half_width + 1; i<in.Height()-half_width; ++i) {\n        sum -= in(i - half_width - 1, j, k);\n        sum += in(i + half_width, j, k);\n        out(i, j, k) = sum;\n      }\n      \/\/ Fill right border.\n      for (int i = in.Height() - half_width; i<in.Height(); ++i) {\n        sum -= in(i - half_width - 1, j, k);\n        out(i, j, k) = sum;\n      }\n    }\n  }\n}\n\nvoid BoxFilter(const Array3Df &in,\n               int box_width,\n               Array3Df *out) {\n  Array3Df tmp;\n  BoxFilterHorizontal(in, box_width, &tmp);\n  BoxFilterVertical(tmp, box_width, out);\n}\n\n}  \/\/ namespace libmv\n<|endoftext|>"}
{"text":"<commit_before>#include <rleahylib\/rleahylib.hpp>\n#include <chat\/chat.hpp>\n#include <command\/command.hpp>\n#include <permissions\/permissions.hpp>\n#include <mod.hpp>\n#include <algorithm>\n\n\nusing namespace MCPP;\n\n\nstatic const Word priority=1;\nstatic const String name(\"Permissions Commands\");\nstatic const String add_identifier(\"addgroup\");\nstatic const String remove_identifier(\"removegroup\");\nstatic const String grant_identifier(\"grant\");\nstatic const String revoke_identifier(\"revoke\");\nstatic const String all_suffix(\"_all\");\nstatic const String identifiers []={\n\tgrant_identifier,\n\trevoke_identifier,\n\tadd_identifier,\n\tremove_identifier\n};\nstatic const String group_arg(\"-g\");\nstatic const String all_arg(\"-a\");\nstatic const String quiet_arg(\"-q\");\n\n\nclass PermissionsCommand : public Module, public Command {\n\n\n\tprivate:\n\t\n\t\n\t\tclass Arguments {\n\t\t\n\t\t\n\t\t\tpublic:\n\t\t\t\n\t\t\t\n\t\t\t\tbool All;\n\t\t\t\tbool Group;\n\t\t\t\tbool Quiet;\n\t\t\t\tString Name;\n\t\t\t\tVector<String> Args;\n\t\t\n\t\t\n\t\t};\n\t\t\n\t\t\n\t\tstatic Nullable<Arguments> parse (Vector<String> args) {\n\t\t\n\t\t\tNullable<Arguments> retr;\n\t\t\n\t\t\tif (args.Count()==0) return retr;\n\t\t\t\n\t\t\tretr.Construct();\n\t\t\tretr->All=false;\n\t\t\tretr->Group=false;\n\t\t\tretr->Quiet=false;\n\t\t\tbool first=true;\n\t\t\tbool complete=false;\n\t\t\tfor (auto & s : args) {\n\t\t\t\n\t\t\t\tif (first) {\n\t\t\t\t\n\t\t\t\t\tif (s==group_arg) {\n\t\t\t\t\t\n\t\t\t\t\t\tif (retr->Group) break;\n\t\t\t\t\t\n\t\t\t\t\t\tretr->Group=true;\n\t\t\t\t\t\n\t\t\t\t\t} else if (s==all_arg) {\n\t\t\t\t\t\n\t\t\t\t\t\tif (retr->All) break;\n\t\t\t\t\t\n\t\t\t\t\t\tretr->All=true;\n\t\t\t\t\t\t\n\t\t\t\t\t} else if (s==quiet_arg) {\n\t\t\t\t\t\n\t\t\t\t\t\tif (retr->Quiet) break;\n\t\t\t\t\t\t\n\t\t\t\t\t\tretr->Quiet=true;\n\t\t\t\t\t\n\t\t\t\t\t} else {\n\t\t\t\t\t\n\t\t\t\t\t\tfirst=false;\n\t\t\t\t\t\t\n\t\t\t\t\t\tretr->Name=std::move(s);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (retr->All) complete=true;\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t} else if (retr->All) {\n\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t} else {\n\t\t\t\t\n\t\t\t\t\tretr->Args.Add(std::move(s));\n\t\t\t\t\t\n\t\t\t\t\tcomplete=true;\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif (!complete) retr.Destroy();\n\t\t\t\n\t\t\treturn retr;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tenum class Type {\n\t\t\n\t\t\tAdd,\n\t\t\tRemove,\n\t\t\tGrant,\n\t\t\tRevoke\n\t\t\n\t\t};\n\t\t\n\t\t\n\t\tstatic Type get_type (const String & str) noexcept {\n\t\t\n\t\t\tif (str==add_identifier) return Type::Add;\n\t\t\tif (str==remove_identifier) return Type::Remove;\n\t\t\tif (str==grant_identifier) return Type::Grant;\n\t\t\treturn Type::Revoke;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic bool check_syntax (const String & identifier, const Arguments & args) {\n\t\t\n\t\t\tswitch (get_type(identifier)) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\tif (\n\t\t\t\t\t\targs.All ||\n\t\t\t\t\t\t(args.Args.Count()!=1)\n\t\t\t\t\t) return false;\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tdefault:break;\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic bool check_permissions (const String & identifier, const Arguments & args, const PermissionsHandle & handle) {\n\t\t\t\n\t\t\t\/\/\tIf a user is granted the _all permission,\n\t\t\t\/\/\tthey can always proceed\n\t\t\tif (handle.Check(identifier+all_suffix)) return true;\n\t\t\t\n\t\t\t\/\/\tIf the user isn't granted the particular\n\t\t\t\/\/\tpermission, they can never proceed\n\t\t\tif (!handle.Check(identifier)) return false;\n\t\t\t\n\t\t\t\/\/\tOtherwise check particular conditions\n\t\t\tswitch (get_type(identifier)) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\n\t\t\t\t\t\/\/\tUser must be a member of the\n\t\t\t\t\t\/\/\ttarget group\n\t\t\t\t\tif (!handle.IsMember(args.Args[0])) return false;\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\n\t\t\t\t\t\/\/\tIf we're granting\/revoking all\n\t\t\t\t\t\/\/\tpermissions, user must themselves\n\t\t\t\t\t\/\/\thave all permissions\n\t\t\t\t\t\/\/\n\t\t\t\t\t\/\/\tSince we short-circuit out above\n\t\t\t\t\t\/\/\tif the user has a certain permission,\n\t\t\t\t\t\/\/\tgetting here means the user does NOT\n\t\t\t\t\t\/\/\thave all permissions\n\t\t\t\t\tif (args.All) return false;\n\t\t\t\t\t\n\t\t\t\t\t\/\/\tCheck each permission -- user\n\t\t\t\t\t\/\/\tmust have them all\n\t\t\t\t\tfor (auto & perm : args.Args) if (!handle.Check(perm)) return false;\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage add_remove (PermissionsHandle handle, Arguments args, bool add) {\n\t\t\n\t\t\tChatMessage retr;\n\t\t\tChatMessage send;\n\t\t\t\n\t\t\tif (add) send << ChatStyle::BrightGreen << \"Adding to \";\n\t\t\telse send << ChatStyle::Red << \"Removing from \";\n\t\t\t\n\t\t\tsend\t<<\t(handle.IsGroup() ? \"group\" : \"user\")\n\t\t\t\t\t<<\t\" \"\n\t\t\t\t\t<<\tChatStyle::Bold\n\t\t\t\t\t<<\thandle.Name()\n\t\t\t\t\t<<\tChatFormat::Pop\n\t\t\t\t\t<<\t\" group \"\n\t\t\t\t\t<<\tChatStyle::Bold\n\t\t\t\t\t<<\targs.Args[0];\n\t\t\t\t\t\n\t\t\tif (add) handle.Add(std::move(args.Args[0]));\n\t\t\telse handle.Remove(std::move(args.Args[0]));\n\t\t\t\n\t\t\tif (args.Quiet) retr=std::move(send);\n\t\t\telse Chat::Get().Send(send);\n\t\t\t\n\t\t\treturn retr;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage add (PermissionsHandle handle, Arguments args) {\n\t\t\n\t\t\treturn add_remove(\n\t\t\t\tstd::move(handle),\n\t\t\t\tstd::move(args),\n\t\t\t\ttrue\n\t\t\t);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage remove (PermissionsHandle handle, Arguments args) {\n\t\t\n\t\t\treturn add_remove(\n\t\t\t\tstd::move(handle),\n\t\t\t\tstd::move(args),\n\t\t\t\tfalse\n\t\t\t);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage grant_revoke (PermissionsHandle handle, Arguments args, bool grant) {\n\t\t\n\t\t\tChatMessage retr;\n\t\t\tChatMessage send;\n\t\t\t\n\t\t\tstd::sort(args.Args.begin(),args.Args.end());\n\t\t\t\n\t\t\tif (grant) send << ChatStyle::BrightGreen << \"Granting\";\n\t\t\telse send << ChatStyle::Red << \"Revoking from\";\n\t\t\t\n\t\t\tsend\t<<\t\" \"\n\t\t\t\t\t<<\t(handle.IsGroup() ? \"group\" : \"user\")\n\t\t\t\t\t<<\t\" \"\n\t\t\t\t\t<<\tChatStyle::Bold\n\t\t\t\t\t<<\thandle.Name()\n\t\t\t\t\t<<\tChatFormat::Pop\n\t\t\t\t\t<<\t\" \";\n\t\t\t\n\t\t\tif (args.All) {\n\t\t\t\n\t\t\t\tsend\t<<\tChatStyle::Bold\n\t\t\t\t\t\t<<\t\"all permissions\";\n\t\t\t\t\t\t\n\t\t\t\thandle.Revoke();\n\t\t\t\n\t\t\t} else {\n\t\t\t\n\t\t\t\tsend\t<<\t\"permissions: \"\n\t\t\t\t\t\t<<\tChatStyle::Bold;\n\t\t\t\n\t\t\t\tbool first=true;\n\t\t\t\tfor (auto & s : args.Args) {\n\n\t\t\t\t\tif (first) first=false;\n\t\t\t\t\telse send << \", \";\n\t\t\t\t\t\n\t\t\t\t\tsend << s;\n\t\t\t\t\t\n\t\t\t\t\tif (grant) handle.Grant(std::move(s));\n\t\t\t\t\telse handle.Revoke(std::move(s));\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif (args.Quiet) retr=std::move(send);\n\t\t\telse Chat::Get().Send(send);\n\t\t\t\n\t\t\treturn retr;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage grant (PermissionsHandle handle, Arguments args) {\n\t\t\n\t\t\treturn grant_revoke(\n\t\t\t\tstd::move(handle),\n\t\t\t\tstd::move(args),\n\t\t\t\ttrue\n\t\t\t);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage revoke (PermissionsHandle handle, Arguments args) {\n\t\t\n\t\t\treturn grant_revoke(\n\t\t\t\tstd::move(handle),\n\t\t\t\tstd::move(args),\n\t\t\t\tfalse\n\t\t\t);\n\t\t\n\t\t}\n\n\n\tpublic:\n\t\n\t\n\t\tvirtual Word Priority () const noexcept override {\n\t\t\n\t\t\treturn priority;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual const String & Name () const noexcept override {\n\t\t\n\t\t\treturn name;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual void Install () override {\n\t\t\n\t\t\tauto & commands=Commands::Get();\n\t\t\n\t\t\tfor (auto & i : identifiers) commands.Add(i,this);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual void Summary (const String & identifier, ChatMessage & message) override {\n\t\t\n\t\t\tswitch (get_type(identifier)) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\t\tmessage << \"Adds groups to users and groups.\";\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\tmessage << \"Removes groups from users and groups.\";\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Grant:\n\t\t\t\t\tmessage << \"Grants permissions.\";\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Revoke:\n\t\t\t\tdefault:\n\t\t\t\t\tmessage << \"Revokes permissions.\";\n\t\t\t\t\tbreak;\n\t\t\t\n\t\t\t}\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual void Help (const String & identifier, ChatMessage & message) override {\n\t\t\n\t\t\tmessage\t<<\t\"Syntax: \"\n\t\t\t\t\t<<\tChatStyle::Bold\n\t\t\t\t\t<<\t\"\/\"\n\t\t\t\t\t<<\tidentifier\n\t\t\t\t\t<<\t\" [-g] \";\n\t\t\t\t\t\n\t\t\tauto type=get_type(identifier);\n\t\t\tswitch (type) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\tmessage\t<<\t\"<user\/group name> <group name>\"\n\t\t\t\t\t\t\t<<\tChatFormat::Pop\n\t\t\t\t\t\t\t<<\tNewline\n\t\t\t\t\t\t\t<<\t((type==Type::Add) ? \"Adds\" : \"Removes\")\n\t\t\t\t\t\t\t<<\t\" the requested group \"\n\t\t\t\t\t\t\t<<\t((type==Type::Add) ? \"to\" : \"from\")\n\t\t\t\t\t\t\t<<\t\" the given user or group.  The resulting permissions of the user- or group-in-question \"\n\t\t\t\t\t\t\t\t\"will be \"\n\t\t\t\t\t\t\t<<\t(\n\t\t\t\t\t\t\t\t\t(type==Type::Add)\n\t\t\t\t\t\t\t\t\t\t?\t\"a union of the user or group's previous permissions, and the permissions \"\n\t\t\t\t\t\t\t\t\t\t\t\"associated with the group being added.\"\n\t\t\t\t\t\t\t\t\t\t:\t\"the permissions that user or group has as a result of permissions specifically \"\n\t\t\t\t\t\t\t\t\t\t\t\"granted them, or granted to a group which is still associated with them.\"\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Grant:\n\t\t\t\tcase Type::Revoke:\n\t\t\t\tdefault:\n\t\t\t\t\tmessage\t<<\t\"[-a] <user\/group name> <permissions>\"\n\t\t\t\t\t\t\t<<\tChatFormat::Pop\n\t\t\t\t\t\t\t<<\tNewline\n\t\t\t\t\t\t\t<<\t((type==Type::Grant) ? \"Grants\" : \"Revokes\")\n\t\t\t\t\t\t\t<<\t\" requested permissions.  \"\n\t\t\t\t\t\t\t\t\"If permissions are added to a group which does not exist, it will be created.  \"\n\t\t\t\t\t\t\t\t\"The -a flag specifies that all permissions should be \"\n\t\t\t\t\t\t\t<<\t((type==Type::Grant) ? \"granted\" : \"revoked\")\n\t\t\t\t\t\t\t<<\t\" and must not be specified alongside a list of permissions.\";\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tmessage\t<<\t\"  The -g flag specifies that a group is being named, rather than a user.\";\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual bool Check (const CommandEvent & event) override {\n\t\t\n\t\t\t\/\/\tConsole is always permitted\n\t\t\tif (event.Issuer.IsNull()) return true;\n\t\t\t\n\t\t\tauto handle=Permissions::Get().GetUser(event.Issuer);\n\t\t\t\n\t\t\treturn (\n\t\t\t\thandle.Check(event.Identifier) ||\n\t\t\t\thandle.Check(event.Identifier+all_suffix)\n\t\t\t);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual CommandResult Execute (CommandEvent event) override {\n\t\t\n\t\t\tCommandResult retr;\n\t\t\t\n\t\t\tauto args=parse(std::move(event.Arguments));\n\t\t\t\n\t\t\t\/\/\tMake sure the arguments are valid\n\t\t\tif (args.IsNull() || !check_syntax(event.Identifier,*args)) {\n\t\t\t\n\t\t\t\tretr.Status=CommandStatus::SyntaxError;\n\t\t\t\t\n\t\t\t\treturn retr;\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t\/\/\tGet the permissions handle for this\n\t\t\t\/\/\tuser or group\n\t\t\tauto & permissions=Permissions::Get();\n\t\t\tauto handle=args->Group ? permissions.GetGroup(std::move(args->Name)) : permissions.GetUser(std::move(args->Name));\n\t\t\n\t\t\t\/\/\tCheck permissions\n\t\t\tif (!(event.Issuer.IsNull() || check_permissions(\n\t\t\t\tevent.Identifier,\n\t\t\t\t*args,\n\t\t\t\tpermissions.GetUser(event.Issuer)\n\t\t\t))) {\n\t\t\t\n\t\t\t\tretr.Status=CommandStatus::Forbidden;\n\t\t\t\t\n\t\t\t\treturn retr;\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tretr.Status=CommandStatus::Success;\n\t\t\t\n\t\t\t\/\/\tInvoke\n\t\t\tswitch (get_type(event.Identifier)) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\t\tretr.Message=add(std::move(handle),std::move(*args));\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\tretr.Message=remove(std::move(handle),std::move(*args));\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Grant:\n\t\t\t\t\tretr.Message=grant(std::move(handle),std::move(*args));\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Revoke:\n\t\t\t\tdefault:\n\t\t\t\t\tretr.Message=revoke(std::move(handle),std::move(*args));\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\treturn retr;\n\t\t\n\t\t}\n\n\n};\n\n\nINSTALL_MODULE(PermissionsCommand)\n<commit_msg>Permissions Command Fix<commit_after>#include <rleahylib\/rleahylib.hpp>\n#include <chat\/chat.hpp>\n#include <command\/command.hpp>\n#include <permissions\/permissions.hpp>\n#include <mod.hpp>\n#include <algorithm>\n\n\nusing namespace MCPP;\n\n\nstatic const Word priority=1;\nstatic const String name(\"Permissions Commands\");\nstatic const String add_identifier(\"addgroup\");\nstatic const String remove_identifier(\"removegroup\");\nstatic const String grant_identifier(\"grant\");\nstatic const String revoke_identifier(\"revoke\");\nstatic const String all_suffix(\"_all\");\nstatic const String identifiers []={\n\tgrant_identifier,\n\trevoke_identifier,\n\tadd_identifier,\n\tremove_identifier\n};\nstatic const String group_arg(\"-g\");\nstatic const String all_arg(\"-a\");\nstatic const String quiet_arg(\"-q\");\n\n\nclass PermissionsCommand : public Module, public Command {\n\n\n\tprivate:\n\t\n\t\n\t\tclass Arguments {\n\t\t\n\t\t\n\t\t\tpublic:\n\t\t\t\n\t\t\t\n\t\t\t\tbool All;\n\t\t\t\tbool Group;\n\t\t\t\tbool Quiet;\n\t\t\t\tString Name;\n\t\t\t\tVector<String> Args;\n\t\t\n\t\t\n\t\t};\n\t\t\n\t\t\n\t\tstatic Nullable<Arguments> parse (Vector<String> args) {\n\t\t\n\t\t\tNullable<Arguments> retr;\n\t\t\n\t\t\tif (args.Count()==0) return retr;\n\t\t\t\n\t\t\tretr.Construct();\n\t\t\tretr->All=false;\n\t\t\tretr->Group=false;\n\t\t\tretr->Quiet=false;\n\t\t\tbool first=true;\n\t\t\tbool complete=false;\n\t\t\tfor (auto & s : args) {\n\t\t\t\n\t\t\t\tif (first) {\n\t\t\t\t\n\t\t\t\t\tif (s==group_arg) {\n\t\t\t\t\t\n\t\t\t\t\t\tif (retr->Group) break;\n\t\t\t\t\t\n\t\t\t\t\t\tretr->Group=true;\n\t\t\t\t\t\n\t\t\t\t\t} else if (s==all_arg) {\n\t\t\t\t\t\n\t\t\t\t\t\tif (retr->All) break;\n\t\t\t\t\t\n\t\t\t\t\t\tretr->All=true;\n\t\t\t\t\t\t\n\t\t\t\t\t} else if (s==quiet_arg) {\n\t\t\t\t\t\n\t\t\t\t\t\tif (retr->Quiet) break;\n\t\t\t\t\t\t\n\t\t\t\t\t\tretr->Quiet=true;\n\t\t\t\t\t\n\t\t\t\t\t} else {\n\t\t\t\t\t\n\t\t\t\t\t\tfirst=false;\n\t\t\t\t\t\t\n\t\t\t\t\t\tretr->Name=std::move(s);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (retr->All) complete=true;\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t} else if (retr->All) {\n\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t} else {\n\t\t\t\t\n\t\t\t\t\tretr->Args.Add(std::move(s));\n\t\t\t\t\t\n\t\t\t\t\tcomplete=true;\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif (!complete) retr.Destroy();\n\t\t\t\n\t\t\treturn retr;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tenum class Type {\n\t\t\n\t\t\tAdd,\n\t\t\tRemove,\n\t\t\tGrant,\n\t\t\tRevoke\n\t\t\n\t\t};\n\t\t\n\t\t\n\t\tstatic Type get_type (const String & str) noexcept {\n\t\t\n\t\t\tif (str==add_identifier) return Type::Add;\n\t\t\tif (str==remove_identifier) return Type::Remove;\n\t\t\tif (str==grant_identifier) return Type::Grant;\n\t\t\treturn Type::Revoke;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic bool check_syntax (const String & identifier, const Arguments & args) {\n\t\t\n\t\t\tswitch (get_type(identifier)) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\tif (\n\t\t\t\t\t\targs.All ||\n\t\t\t\t\t\t(args.Args.Count()!=1)\n\t\t\t\t\t) return false;\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tdefault:break;\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic bool check_permissions (const String & identifier, const Arguments & args, const PermissionsHandle & handle) {\n\t\t\t\n\t\t\t\/\/\tIf a user is granted the _all permission,\n\t\t\t\/\/\tthey can always proceed\n\t\t\tif (handle.Check(identifier+all_suffix)) return true;\n\t\t\t\n\t\t\t\/\/\tIf the user isn't granted the particular\n\t\t\t\/\/\tpermission, they can never proceed\n\t\t\tif (!handle.Check(identifier)) return false;\n\t\t\t\n\t\t\t\/\/\tOtherwise check particular conditions\n\t\t\tswitch (get_type(identifier)) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\n\t\t\t\t\t\/\/\tUser must be a member of the\n\t\t\t\t\t\/\/\ttarget group\n\t\t\t\t\tif (!handle.IsMember(args.Args[0])) return false;\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\n\t\t\t\t\t\/\/\tIf we're granting\/revoking all\n\t\t\t\t\t\/\/\tpermissions, user must themselves\n\t\t\t\t\t\/\/\thave all permissions\n\t\t\t\t\t\/\/\n\t\t\t\t\t\/\/\tSince we short-circuit out above\n\t\t\t\t\t\/\/\tif the user has a certain permission,\n\t\t\t\t\t\/\/\tgetting here means the user does NOT\n\t\t\t\t\t\/\/\thave all permissions\n\t\t\t\t\tif (args.All) return false;\n\t\t\t\t\t\n\t\t\t\t\t\/\/\tCheck each permission -- user\n\t\t\t\t\t\/\/\tmust have them all\n\t\t\t\t\tfor (auto & perm : args.Args) if (!handle.Check(perm)) return false;\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage add_remove (PermissionsHandle handle, Arguments args, bool add) {\n\t\t\n\t\t\tChatMessage retr;\n\t\t\tChatMessage send;\n\t\t\t\n\t\t\tif (add) send << ChatStyle::BrightGreen << \"Adding to \";\n\t\t\telse send << ChatStyle::Red << \"Removing from \";\n\t\t\t\n\t\t\tsend\t<<\t(handle.IsGroup() ? \"group\" : \"user\")\n\t\t\t\t\t<<\t\" \"\n\t\t\t\t\t<<\tChatStyle::Bold\n\t\t\t\t\t<<\thandle.Name()\n\t\t\t\t\t<<\tChatFormat::Pop\n\t\t\t\t\t<<\t\" group \"\n\t\t\t\t\t<<\tChatStyle::Bold\n\t\t\t\t\t<<\targs.Args[0];\n\t\t\t\t\t\n\t\t\tif (add) handle.Add(std::move(args.Args[0]));\n\t\t\telse handle.Remove(std::move(args.Args[0]));\n\t\t\t\n\t\t\tif (args.Quiet) retr=std::move(send);\n\t\t\telse Chat::Get().Send(send);\n\t\t\t\n\t\t\treturn retr;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage add (PermissionsHandle handle, Arguments args) {\n\t\t\n\t\t\treturn add_remove(\n\t\t\t\tstd::move(handle),\n\t\t\t\tstd::move(args),\n\t\t\t\ttrue\n\t\t\t);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage remove (PermissionsHandle handle, Arguments args) {\n\t\t\n\t\t\treturn add_remove(\n\t\t\t\tstd::move(handle),\n\t\t\t\tstd::move(args),\n\t\t\t\tfalse\n\t\t\t);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage grant_revoke (PermissionsHandle handle, Arguments args, bool grant) {\n\t\t\n\t\t\tChatMessage retr;\n\t\t\tChatMessage send;\n\t\t\t\n\t\t\tstd::sort(args.Args.begin(),args.Args.end());\n\t\t\t\n\t\t\tif (grant) send << ChatStyle::BrightGreen << \"Granting\";\n\t\t\telse send << ChatStyle::Red << \"Revoking from\";\n\t\t\t\n\t\t\tsend\t<<\t\" \"\n\t\t\t\t\t<<\t(handle.IsGroup() ? \"group\" : \"user\")\n\t\t\t\t\t<<\t\" \"\n\t\t\t\t\t<<\tChatStyle::Bold\n\t\t\t\t\t<<\thandle.Name()\n\t\t\t\t\t<<\tChatFormat::Pop\n\t\t\t\t\t<<\t\" \";\n\t\t\t\n\t\t\tif (args.All) {\n\t\t\t\n\t\t\t\tsend\t<<\tChatStyle::Bold\n\t\t\t\t\t\t<<\t\"all permissions\";\n\t\t\t\t\t\t\n\t\t\t\tif (grant) handle.Grant();\n\t\t\t\telse handle.Revoke();\n\t\t\t\n\t\t\t} else {\n\t\t\t\n\t\t\t\tsend\t<<\t\"permissions: \"\n\t\t\t\t\t\t<<\tChatStyle::Bold;\n\t\t\t\n\t\t\t\tbool first=true;\n\t\t\t\tfor (auto & s : args.Args) {\n\n\t\t\t\t\tif (first) first=false;\n\t\t\t\t\telse send << \", \";\n\t\t\t\t\t\n\t\t\t\t\tsend << s;\n\t\t\t\t\t\n\t\t\t\t\tif (grant) handle.Grant(std::move(s));\n\t\t\t\t\telse handle.Revoke(std::move(s));\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif (args.Quiet) retr=std::move(send);\n\t\t\telse Chat::Get().Send(send);\n\t\t\t\n\t\t\treturn retr;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage grant (PermissionsHandle handle, Arguments args) {\n\t\t\n\t\t\treturn grant_revoke(\n\t\t\t\tstd::move(handle),\n\t\t\t\tstd::move(args),\n\t\t\t\ttrue\n\t\t\t);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tstatic ChatMessage revoke (PermissionsHandle handle, Arguments args) {\n\t\t\n\t\t\treturn grant_revoke(\n\t\t\t\tstd::move(handle),\n\t\t\t\tstd::move(args),\n\t\t\t\tfalse\n\t\t\t);\n\t\t\n\t\t}\n\n\n\tpublic:\n\t\n\t\n\t\tvirtual Word Priority () const noexcept override {\n\t\t\n\t\t\treturn priority;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual const String & Name () const noexcept override {\n\t\t\n\t\t\treturn name;\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual void Install () override {\n\t\t\n\t\t\tauto & commands=Commands::Get();\n\t\t\n\t\t\tfor (auto & i : identifiers) commands.Add(i,this);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual void Summary (const String & identifier, ChatMessage & message) override {\n\t\t\n\t\t\tswitch (get_type(identifier)) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\t\tmessage << \"Adds groups to users and groups.\";\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\tmessage << \"Removes groups from users and groups.\";\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Grant:\n\t\t\t\t\tmessage << \"Grants permissions.\";\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Revoke:\n\t\t\t\tdefault:\n\t\t\t\t\tmessage << \"Revokes permissions.\";\n\t\t\t\t\tbreak;\n\t\t\t\n\t\t\t}\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual void Help (const String & identifier, ChatMessage & message) override {\n\t\t\n\t\t\tmessage\t<<\t\"Syntax: \"\n\t\t\t\t\t<<\tChatStyle::Bold\n\t\t\t\t\t<<\t\"\/\"\n\t\t\t\t\t<<\tidentifier\n\t\t\t\t\t<<\t\" [-g] \";\n\t\t\t\t\t\n\t\t\tauto type=get_type(identifier);\n\t\t\tswitch (type) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\tmessage\t<<\t\"<user\/group name> <group name>\"\n\t\t\t\t\t\t\t<<\tChatFormat::Pop\n\t\t\t\t\t\t\t<<\tNewline\n\t\t\t\t\t\t\t<<\t((type==Type::Add) ? \"Adds\" : \"Removes\")\n\t\t\t\t\t\t\t<<\t\" the requested group \"\n\t\t\t\t\t\t\t<<\t((type==Type::Add) ? \"to\" : \"from\")\n\t\t\t\t\t\t\t<<\t\" the given user or group.  The resulting permissions of the user- or group-in-question \"\n\t\t\t\t\t\t\t\t\"will be \"\n\t\t\t\t\t\t\t<<\t(\n\t\t\t\t\t\t\t\t\t(type==Type::Add)\n\t\t\t\t\t\t\t\t\t\t?\t\"a union of the user or group's previous permissions, and the permissions \"\n\t\t\t\t\t\t\t\t\t\t\t\"associated with the group being added.\"\n\t\t\t\t\t\t\t\t\t\t:\t\"the permissions that user or group has as a result of permissions specifically \"\n\t\t\t\t\t\t\t\t\t\t\t\"granted them, or granted to a group which is still associated with them.\"\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Grant:\n\t\t\t\tcase Type::Revoke:\n\t\t\t\tdefault:\n\t\t\t\t\tmessage\t<<\t\"[-a] <user\/group name> <permissions>\"\n\t\t\t\t\t\t\t<<\tChatFormat::Pop\n\t\t\t\t\t\t\t<<\tNewline\n\t\t\t\t\t\t\t<<\t((type==Type::Grant) ? \"Grants\" : \"Revokes\")\n\t\t\t\t\t\t\t<<\t\" requested permissions.  \"\n\t\t\t\t\t\t\t\t\"If permissions are added to a group which does not exist, it will be created.  \"\n\t\t\t\t\t\t\t\t\"The -a flag specifies that all permissions should be \"\n\t\t\t\t\t\t\t<<\t((type==Type::Grant) ? \"granted\" : \"revoked\")\n\t\t\t\t\t\t\t<<\t\" and must not be specified alongside a list of permissions.\";\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tmessage\t<<\t\"  The -g flag specifies that a group is being named, rather than a user.\";\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual bool Check (const CommandEvent & event) override {\n\t\t\n\t\t\t\/\/\tConsole is always permitted\n\t\t\tif (event.Issuer.IsNull()) return true;\n\t\t\t\n\t\t\tauto handle=Permissions::Get().GetUser(event.Issuer);\n\t\t\t\n\t\t\treturn (\n\t\t\t\thandle.Check(event.Identifier) ||\n\t\t\t\thandle.Check(event.Identifier+all_suffix)\n\t\t\t);\n\t\t\n\t\t}\n\t\t\n\t\t\n\t\tvirtual CommandResult Execute (CommandEvent event) override {\n\t\t\n\t\t\tCommandResult retr;\n\t\t\t\n\t\t\tauto args=parse(std::move(event.Arguments));\n\t\t\t\n\t\t\t\/\/\tMake sure the arguments are valid\n\t\t\tif (args.IsNull() || !check_syntax(event.Identifier,*args)) {\n\t\t\t\n\t\t\t\tretr.Status=CommandStatus::SyntaxError;\n\t\t\t\t\n\t\t\t\treturn retr;\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t\/\/\tGet the permissions handle for this\n\t\t\t\/\/\tuser or group\n\t\t\tauto & permissions=Permissions::Get();\n\t\t\tauto handle=args->Group ? permissions.GetGroup(std::move(args->Name)) : permissions.GetUser(std::move(args->Name));\n\t\t\n\t\t\t\/\/\tCheck permissions\n\t\t\tif (!(event.Issuer.IsNull() || check_permissions(\n\t\t\t\tevent.Identifier,\n\t\t\t\t*args,\n\t\t\t\tpermissions.GetUser(event.Issuer)\n\t\t\t))) {\n\t\t\t\n\t\t\t\tretr.Status=CommandStatus::Forbidden;\n\t\t\t\t\n\t\t\t\treturn retr;\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tretr.Status=CommandStatus::Success;\n\t\t\t\n\t\t\t\/\/\tInvoke\n\t\t\tswitch (get_type(event.Identifier)) {\n\t\t\t\n\t\t\t\tcase Type::Add:\n\t\t\t\t\tretr.Message=add(std::move(handle),std::move(*args));\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Remove:\n\t\t\t\t\tretr.Message=remove(std::move(handle),std::move(*args));\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Grant:\n\t\t\t\t\tretr.Message=grant(std::move(handle),std::move(*args));\n\t\t\t\t\tbreak;\n\t\t\t\tcase Type::Revoke:\n\t\t\t\tdefault:\n\t\t\t\t\tretr.Message=revoke(std::move(handle),std::move(*args));\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\treturn retr;\n\t\t\n\t\t}\n\n\n};\n\n\nINSTALL_MODULE(PermissionsCommand)\n<|endoftext|>"}
{"text":"<commit_before>#include \"Transform.h\"\n#include <math.h>\n\n\n\nMatrix4 Transform::GetTranslationMatrix(const Vector3& _position)\n{\n\treturn Matrix4 (1.0f, 0.0f, 0.0f, _position.x,\n\t\t\t\t\t0.0f, 1.0f, 0.0f, _position.y,\n\t\t\t\t\t0.0f, 0.0f, 1.0f, _position.z,\n\t\t\t\t\t0.0f, 0.0f, 0.0f, 1.0f\n\t\t\t\t\t);\n}\n\nMatrix4 Transform::GetScaleMatrix(const Vector3& _scale)\n{\n\treturn Matrix4(\t_scale.x,\t0.0f,\t\t0.0f,\t\t0.0f,\n\t\t\t\t\t0.0f,\t\t_scale.y,\t0.0f,\t\t0.0f,\n\t\t\t\t\t0.0f,\t\t0.0f,\t\t_scale.z,\t0.0f,\n\t\t\t\t\t0.0f,\t\t0.0f,\t\t0.0f,\t\t1.0f\n\t\t\t\t\t);\n}\n\n\/\/ Right-hand\nMatrix4 Transform::GetRotationMatrix(const Vector3& _rotation)\n{\n\t\/\/ X-axis\n\tMatrix4 roll(\t1.0f, 0.0f,\t\t\t\t\t0.0f,\t\t\t\t0.0f,\n\t\t\t\t\t0.0f, cosf(_rotation.x),\t-sinf(_rotation.x), 0.0f,\n\t\t\t\t\t0.0f, sinf(_rotation.x),\tcosf(_rotation.x),\t0.0f,\n\t\t\t\t\t0.0f, 0.0f,\t\t\t\t\t0.0f,\t\t\t\t1.0f\n\t);\n\t \n\t \/\/ Y-axis\n\t Matrix4 yaw(\tcosf(_rotation.y),\t0.0f, sinf(_rotation.y),\t0.0f,\n\t\t\t\t\t0.0f,\t\t\t\t1.0f, 0.0f,\t\t\t\t\t0.0f,\n\t\t\t\t\t-sinf(_rotation.y),\t0.0f, cosf(_rotation.y),\t0.0f,\n\t\t\t\t\t0.0f,\t\t\t\t0.0f, 0.0f,\t\t\t\t\t1.0f\n\t );\n\t \n\t \/\/ Z-axis\n\t Matrix4 pitch(\tcosf(_rotation.z),\t-sinf(_rotation.z),\t0.0f, 0.0f,\n\t\t\t\t\tsinf(_rotation.z),\tcosf(_rotation.z),\t0.0f, 0.0f,\n\t\t\t\t\t0.0f,\t\t\t\t0.0f,\t\t\t\t1.0f, 0.0f,\n\t\t\t\t\t0.0f,\t\t\t\t0.0f,\t\t\t\t0.0f, 1.0f\n\t );\n\n\t return yaw * pitch * roll;\n}\n\nTransform::Transform(const Vector3 & pos, const Vector3 & scl, const Vector3 & rot, Transform * _parent, SceneObject * obj)\n{\n\tposition = pos;\n\tscale = scl;\n\trotation = rot;\n\tparent = _parent;\n\tobject = obj;\n\n\tUpdateTransform();\n}\n\nTransform & Transform::operator=(const Transform & t)\n{\n\tparent = t.parent;\n\tm = t.m;\n\tposition = t.position;\n\tscale = t.scale;\n\trotation = t.rotation;\n\tobject = t.object;\n\treturn *this;\n}\n\nTransform & Transform::operator=(Transform && t)\n{\n\tparent = t.parent;\n\tm = t.m;\n\tposition = t.position;\n\tscale = t.scale;\n\trotation = t.rotation;\n\tobject = t.object;\n\treturn *this;\n}\n\nvoid Transform::SetPosition(const Vector3& position)\n{\n\tthis->position = position;\n\tUpdateTransform();\n}\n\nvoid Transform::SetScale(const Vector3& scale)\n{\n\tthis->scale = scale;\n\tUpdateTransform();\n}\n\nvoid Transform::SetRotation(const Vector3& rotation)\n{\n\tthis->rotation = rotation;\n\tUpdateTransform();\n}\n\nvoid Transform::SetPosition(float x, float y, float z)\n{\n\tSetPosition(Vector3(x, y, z));\n}\n\nvoid Transform::SetScale(float x, float y, float z)\n{\n\tSetScale(Vector3(x, y, z));\n}\n\nvoid Transform::SetRotation(float roll, float yaw, float pitch)\n{\n\tSetRotation(Vector3(roll, yaw, pitch));\n}\n\nvoid Transform::Translate(const Vector3& position_)\n{\n\tposition = position + position_;\n\tUpdateTransform();\n}\n\nvoid Transform::Translate(float x, float y, float z)\n{\n\tTranslate(Vector3(x, y, z));\n}\n\nvoid Transform::Scale(const Vector3& scale_)\n{\n\tscale = scale + scale_;\n\tUpdateTransform();\n}\n\nvoid Transform::Scale(float x, float y, float z)\n{\n\tScale(Vector3(x, y, z));\n}\n\nvoid Transform::Rotate(const Vector3& rotation_)\n{\n\trotation = rotation + rotation_;\n\tUpdateTransform();\n}\n\nvoid Transform::Rotate(float roll, float yaw, float pitch)\n{\n\tRotate(Vector3(roll, yaw, pitch));\n}\n\nvoid Transform::SetParent(Transform * par)\n{\n\tparent = par;\n\tdirty = true;\n}\n\nTransform Transform::Combine(const Transform & other) const\n{\n\treturn Transform(position + other.position, rotation + other.rotation, scale + other.scale, other.parent, other.object);\n}\n\n\n\n\n<commit_msg>Update Transform.cpp<commit_after>#include \"Transform.h\"\n#include <math.h>\n\n\n\nMatrix4 Transform::GetTranslationMatrix(const Vector3& _position)\n{\n\treturn Matrix4 (1.0f, 0.0f, 0.0f, _position.x,\n\t\t\t\t\t0.0f, 1.0f, 0.0f, _position.y,\n\t\t\t\t\t0.0f, 0.0f, 1.0f, _position.z,\n\t\t\t\t\t0.0f, 0.0f, 0.0f, 1.0f\n\t\t\t\t\t);\n}\n\nMatrix4 Transform::GetScaleMatrix(const Vector3& _scale)\n{\n\treturn Matrix4(\t_scale.x,\t0.0f,\t\t0.0f,\t\t0.0f,\n\t\t\t\t\t0.0f,\t\t_scale.y,\t0.0f,\t\t0.0f,\n\t\t\t\t\t0.0f,\t\t0.0f,\t\t_scale.z,\t0.0f,\n\t\t\t\t\t0.0f,\t\t0.0f,\t\t0.0f,\t\t1.0f\n\t\t\t\t\t);\n}\n\n\/\/ Right-hand\nMatrix4 Transform::GetRotationMatrix(const Vector3& _rotation)\n{\n\t\/\/ X-axis\n\tMatrix4 roll(\t1.0f, 0.0f,\t\t\t\t\t0.0f,\t\t\t\t0.0f,\n\t\t\t\t\t0.0f, cosf(_rotation.x),\t-sinf(_rotation.x), 0.0f,\n\t\t\t\t\t0.0f, sinf(_rotation.x),\tcosf(_rotation.x),\t0.0f,\n\t\t\t\t\t0.0f, 0.0f,\t\t\t\t\t0.0f,\t\t\t\t1.0f\n\t);\n\t \n\t \/\/ Y-axis\n\t Matrix4 yaw(\tcosf(_rotation.y),\t0.0f, sinf(_rotation.y),\t0.0f,\n\t\t\t\t\t0.0f,\t\t\t\t1.0f, 0.0f,\t\t\t\t\t0.0f,\n\t\t\t\t\t-sinf(_rotation.y),\t0.0f, cosf(_rotation.y),\t0.0f,\n\t\t\t\t\t0.0f,\t\t\t\t0.0f, 0.0f,\t\t\t\t\t1.0f\n\t );\n\t \n\t \/\/ Z-axis\n\t Matrix4 pitch(\tcosf(_rotation.z),\t-sinf(_rotation.z),\t0.0f, 0.0f,\n\t\t\t\t\tsinf(_rotation.z),\tcosf(_rotation.z),\t0.0f, 0.0f,\n\t\t\t\t\t0.0f,\t\t\t\t0.0f,\t\t\t\t1.0f, 0.0f,\n\t\t\t\t\t0.0f,\t\t\t\t0.0f,\t\t\t\t0.0f, 1.0f\n\t );\n\n\t return yaw * pitch * roll;\n}\n\nTransform::Transform(const Vector3 & pos, const Vector3 & scl, const Vector3 & rot, Transform * _parent, SceneObject * obj)\n{\n\tposition = pos;\n\tscale = scl;\n\trotation = rot;\n\tparent = _parent;\n\tobject = obj;\n\n\tUpdateTransform();\n}\n\nTransform & Transform::operator=(const Transform & t)\n{\n\tparent = t.parent;\n\tm = t.m;\n\tposition = t.position;\n\tscale = t.scale;\n\trotation = t.rotation;\n\tobject = t.object;\n\treturn *this;\n}\n\nTransform & Transform::operator=(Transform && t)\n{\n\tparent = t.parent;\n\tm = t.m;\n\tposition = t.position;\n\tscale = t.scale;\n\trotation = t.rotation;\n\tobject = t.object;\n\treturn *this;\n}\n\nvoid Transform::SetPosition(const Vector3& position)\n{\n\tthis->position = position;\n\tUpdateTransform();\n}\n\nvoid Transform::SetScale(const Vector3& scale)\n{\n\tthis->scale = scale;\n\tUpdateTransform();\n}\n\nvoid Transform::SetRotation(const Vector3& rotation)\n{\n\tthis->rotation = rotation;\n\tUpdateTransform();\n}\n\nvoid Transform::SetPosition(float x, float y, float z)\n{\n\tSetPosition(Vector3(x, y, z));\n}\n\nvoid Transform::SetScale(float x, float y, float z)\n{\n\tSetScale(Vector3(x, y, z));\n}\n\nvoid Transform::SetRotation(float roll, float yaw, float pitch)\n{\n\tSetRotation(Vector3(roll, yaw, pitch));\n}\n\nvoid Transform::Translate(const Vector3& position_)\n{\n\tposition = position + position_;\n\tUpdateTransform();\n}\n\nvoid Transform::Translate(float x, float y, float z)\n{\n\tTranslate(Vector3(x, y, z));\n}\n\nvoid Transform::Scale(const Vector3& scale_)\n{\n\tscale = scale + scale_;\n\tUpdateTransform();\n}\n\nvoid Transform::Scale(float x, float y, float z)\n{\n\tScale(Vector3(x, y, z));\n}\n\nvoid Transform::Rotate(const Vector3& radRotation_)\n{\n\trotation = rotation + radRotation_;\n\tUpdateTransform();\n}\n\nvoid Transform::RotateDeg(const Vector3 & rotation_)\n{\n\tRotate(rotation_ * TO_RADIANS);\n}\n\nvoid Transform::Rotate(float radRoll, float radYaw, float radPitch)\n{\n\tRotate(Vector3(radRoll, radYaw, radPitch));\n}\n\nvoid Transform::RotateDeg(float roll, float yaw, float pitch)\n{\n\tRotate(Vector3(roll, yaw, pitch)* TO_RADIANS);\n}\n\nvoid Transform::SetParent(Transform * par)\n{\n\tparent = par;\n\tdirty = true;\n}\n\nTransform Transform::Combine(const Transform & other) const\n{\n\treturn Transform(position + other.position, rotation + other.rotation, scale + other.scale, other.parent, other.object);\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *\n *             Copyright (c) 2009 Sony Pictures Imageworks, Inc.\n *                            All rights reserved.\n *\n *  This material contains the confidential and proprietary information\n *  of Sony Pictures Imageworks, Inc. and may not be disclosed, copied or\n *  duplicated in any form, electronic or hardcopy, in whole or in part,\n *  without the express prior written consent of Sony Pictures Imageworks,\n *  Inc. This copyright notice does not imply publication.\n *\n *****************************************************************************\/\n\n#include <iostream>\n\n#include \"oslexec_pvt.h\"\n#include \"oslops.h\"\n\n#include \"OpenImageIO\/varyingref.h\"\n\n\nnamespace OSL {\nnamespace pvt {\n\n\n\n\/\/ Heavy lifting of 'assign', this is a specialized version that assumes\n\/\/ the types of \ntemplate <class RET, class SRC>\nstatic DECLOP (specialized_assign)\n{\n    if (exec->debug())\n        std::cout << \"Executing specialized_assign!\\n\";\n    \/\/ Get references to the symbols this op accesses\n    Symbol &Result (exec->sym (args[0]));\n    Symbol &Src (exec->sym (args[1]));\n\n    \/\/ Adjust the result's uniform\/varying status\n    exec->adjust_varying (Result, Src.is_varying(),\n                          Result.data() == Src.data());\n\n    \/\/ Loop over points, do the assignment.\n    VaryingRef<RET> result ((RET *)Result.data(), Result.step());\n    VaryingRef<SRC> src ((SRC *)Src.data(), Src.step());\n    if (result.is_uniform()) {\n        \/\/ Result (and src) are uniform\n        *result = RET (*src);\n    } else {\n        \/\/ Potentially varying case\n        for (int i = beginpoint;  i < endpoint;  ++i)\n            if (runflags[i])\n                result[i] = RET (src[i]);\n    }\n}\n\n\n\n\/\/ Syntax of matrix assignment of scalar is slightly different because\n\/\/ Imath::Matrix44 defines operator= as setting all components to the\n\/\/ scalar, whereas OSL defines the operation as just setting the\n\/\/ diagonal to the scalar (i.e. m=f is equiv to m = Identity * f)\ntemplate <class SRC>\nstatic DECLOP (specialized_assign_matrix_scalar)\n{\n    if (exec->debug())\n        std::cout << \"Executing specialized_assign for matrix!\\n\";\n    typedef Imath::M44f RET;\n    \/\/ Get references to the symbols this op accesses\n    Symbol &Result (exec->sym (args[0]));\n    Symbol &Src (exec->sym (args[1]));\n\n    \/\/ Adjust the result's uniform\/varying status\n    exec->adjust_varying (Result, Src.is_varying(),\n                          Result.data() == Src.data());\n\n    \/\/ Loop over points, do the assignment.\n    VaryingRef<RET> result ((RET *)Result.data(), Result.step());\n    VaryingRef<SRC> src ((SRC *)Src.data(), Src.step());\n    if (result.is_uniform()) {\n        \/\/ Result (and src) are uniform\n        *result = 1.0f;\n        *result *= *src;\n    } else {\n        \/\/ Potentially varying case\n        for (int i = beginpoint;  i < endpoint;  ++i)\n            if (runflags[i]) {\n                result[i] = 1.0f;\n                result[i] *= (src[i]);\n            }\n    }\n}\n\n\n\nDECLOP (OP_assign)\n{\n    if (exec->debug())\n        std::cout << \"Executing assign!\\n\";\n    ASSERT (nargs == 2);\n    Symbol &Result (exec->sym (args[0]));\n    Symbol &Src (exec->sym (args[1]));\n    if (exec->debug()) {\n        std::cout << \"  Result is \" << Result.typespec().string() \n                  << \" \" << Result.mangled() << \" @ \" << (void *)Result.data() << \"\\n\";\n        std::cout << \"  Src is \" << Src.typespec().string() \n                  << \" \" << Src.mangled() << \" @ \" << (void*)Src.data() << \"\\n\";\n    }\n    ASSERT (! Result.typespec().is_closure() &&\n            ! Result.typespec().is_structure() &&\n            ! Result.typespec().is_array());   \/\/ Not yet\n    ASSERT (! Src.typespec().is_closure() &&\n            ! Src.typespec().is_structure() &&\n            ! Src.typespec().is_array());   \/\/ Not yet\n    OpImpl impl = NULL;\n    if (Result.typespec().is_closure()) {\n        \/\/ FIXME -- not handled yet\n    } else if (Result.typespec().is_structure()) {\n        \/\/ FIXME -- not handled yet\n    } else if (Result.typespec().is_float()) {\n        if (Src.typespec().is_float()) {\n            impl = specialized_assign<float,float>;\n        } if (Src.typespec().is_int()) {\n            impl = specialized_assign<float,int>;\n        } else {\n            \/\/ Nothing else can be assigned to a float\n        }\n    } else if (Result.typespec().is_triple()) {\n        if (Src.typespec().is_triple()) {\n            impl = specialized_assign<Imath::V3f,Imath::V3f>;\n        } else if (Src.typespec().is_float()) {\n            impl = specialized_assign<Imath::V3f,float>;\n        } if (Src.typespec().is_int()) {\n            impl = specialized_assign<Imath::V3f,int>;\n        } else {\n            \/\/ Nothing else can be assigned to a float\n        }\n    } else if (Result.typespec().is_matrix()) {\n        if (Src.typespec().is_matrix()) {\n            impl = specialized_assign<Imath::M44f,Imath::M44f>;\n        } else if (Src.typespec().is_float()) {\n            impl = specialized_assign_matrix_scalar<float>;\n        } if (Src.typespec().is_int()) {\n            impl = specialized_assign_matrix_scalar<int>;\n        } else {\n            \/\/ Nothing else can be assigned to a float\n        }\n    }\n    if (impl) {\n        impl (exec, nargs, args, runflags, beginpoint, endpoint);\n        \/\/ Use the specialized one for next time!  Never have to check the\n        \/\/ types or do the other sanity checks again.\n        \/\/ FIXME -- is this thread-safe?\n        exec->op().implementation (impl);\n        return;\n    }\n    ASSERT (0 && \"Assignment types can't be handled\");\n}\n\n\n\n}; \/\/ namespace pvt\n}; \/\/ namespace OSL\n<commit_msg>Simplify specialized_assign with a proxy class that defined the missing Matrix operations.<commit_after>\/*****************************************************************************\n *\n *             Copyright (c) 2009 Sony Pictures Imageworks, Inc.\n *                            All rights reserved.\n *\n *  This material contains the confidential and proprietary information\n *  of Sony Pictures Imageworks, Inc. and may not be disclosed, copied or\n *  duplicated in any form, electronic or hardcopy, in whole or in part,\n *  without the express prior written consent of Sony Pictures Imageworks,\n *  Inc. This copyright notice does not imply publication.\n *\n *****************************************************************************\/\n\n#include <iostream>\n\n#include \"oslexec_pvt.h\"\n#include \"oslops.h\"\n\n#include \"OpenImageIO\/varyingref.h\"\n\n\nnamespace OSL {\nnamespace pvt {\n\n\n\/\/ Proxy type that derives from Matrix44 but allows assignment of a float\n\/\/ to mean f*Identity.\nclass MatrixProxy : public Matrix44 {\npublic:\n    MatrixProxy (float a, float b, float c, float d,\n                 float e, float f, float g, float h,\n                 float i, float j, float k, float l,\n                 float m, float n, float o, float p)\n        : Matrix44 (a,b,c,d, e,f,g,h, i,j,k,l, m,n,o,p) { }\n\n    MatrixProxy (float f) : Matrix44 (f,0,0,0, 0,f,0,0, 0,0,f,0, 0,0,0,f) { }\n\n    const MatrixProxy& operator= (float f) {\n        *this = MatrixProxy (f);\n        return *this;\n    }\n};\n\n\n\n\/\/ Heavy lifting of 'assign', this is a specialized version that knows\n\/\/ the types of the arguments.\ntemplate <class RET, class SRC>\nstatic DECLOP (specialized_assign)\n{\n    if (exec->debug())\n        std::cout << \"Executing specialized_assign!\\n\";\n    \/\/ Get references to the symbols this op accesses\n    Symbol &Result (exec->sym (args[0]));\n    Symbol &Src (exec->sym (args[1]));\n\n    \/\/ Adjust the result's uniform\/varying status\n    exec->adjust_varying (Result, Src.is_varying(),\n                          Result.data() == Src.data());\n\n    \/\/ Loop over points, do the assignment.\n    VaryingRef<RET> result ((RET *)Result.data(), Result.step());\n    VaryingRef<SRC> src ((SRC *)Src.data(), Src.step());\n    if (result.is_uniform()) {\n        \/\/ Uniform case\n        *result = RET (*src);\n    } else {\n        \/\/ Potentially varying case\n        for (int i = beginpoint;  i < endpoint;  ++i)\n            if (runflags[i])\n                result[i] = RET (src[i]);\n    }\n}\n\n\n\nDECLOP (OP_assign)\n{\n    if (exec->debug())\n        std::cout << \"Executing assign!\\n\";\n    ASSERT (nargs == 2);\n    Symbol &Result (exec->sym (args[0]));\n    Symbol &Src (exec->sym (args[1]));\n    if (exec->debug()) {\n        std::cout << \"  Result is \" << Result.typespec().string() \n                  << \" \" << Result.mangled() << \" @ \" << (void *)Result.data() << \"\\n\";\n        std::cout << \"  Src is \" << Src.typespec().string() \n                  << \" \" << Src.mangled() << \" @ \" << (void*)Src.data() << \"\\n\";\n    }\n    ASSERT (! Result.typespec().is_closure() &&\n            ! Result.typespec().is_structure() &&\n            ! Result.typespec().is_array());   \/\/ Not yet\n    ASSERT (! Src.typespec().is_closure() &&\n            ! Src.typespec().is_structure() &&\n            ! Src.typespec().is_array());   \/\/ Not yet\n    OpImpl impl = NULL;\n    if (Result.typespec().is_closure()) {\n        \/\/ FIXME -- not handled yet\n    } else if (Result.typespec().is_structure()) {\n        \/\/ FIXME -- not handled yet\n    } else if (Result.typespec().is_float()) {\n        if (Src.typespec().is_float()) {\n            impl = specialized_assign<float,float>;\n        } if (Src.typespec().is_int()) {\n            impl = specialized_assign<float,int>;\n        } else {\n            \/\/ Nothing else can be assigned to a float\n        }\n    } else if (Result.typespec().is_triple()) {\n        if (Src.typespec().is_triple()) {\n            impl = specialized_assign<Vec3,Vec3>;\n        } else if (Src.typespec().is_float()) {\n            impl = specialized_assign<Vec3,float>;\n        } if (Src.typespec().is_int()) {\n            impl = specialized_assign<Vec3,int>;\n        } else {\n            \/\/ Nothing else can be assigned to a triple\n        }\n    } else if (Result.typespec().is_matrix()) {\n        if (Src.typespec().is_matrix()) {\n            impl = specialized_assign<Matrix44,Matrix44>;\n        } else if (Src.typespec().is_float()) {\n            impl = specialized_assign<MatrixProxy,float>;\n        } if (Src.typespec().is_int()) {\n            impl = specialized_assign<MatrixProxy,int>;\n        } else {\n            \/\/ Nothing else can be assigned to a matrix\n        }\n    } else if (Result.typespec().is_string()) {\n        if (Src.typespec().is_string())\n            impl = specialized_assign<ustring,ustring>;\n    }\n    if (impl) {\n        impl (exec, nargs, args, runflags, beginpoint, endpoint);\n        \/\/ Use the specialized one for next time!  Never have to check the\n        \/\/ types or do the other sanity checks again.\n        \/\/ FIXME -- is this thread-safe?\n        exec->op().implementation (impl);\n        return;\n    }\n    ASSERT (0 && \"Assignment types can't be handled\");\n}\n\n\n\n}; \/\/ namespace pvt\n}; \/\/ namespace OSL\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(C(n, k))\n\/\/ Space: O(k)\n\nclass Solution {\npublic:\n    vector<vector<int> > combinationSum3(int k, int n) {\n        vector<vector<int>> res;\n        vector<int> combination;\n        combinationSum3(res, combination, 1, k, n);\n        return res;\n    }\nprivate:\n    void combinationSum3(vector<vector<int> > &res, vector<int> &combination, int start, int k, int n) {\n        if (!k && !n) {\n            res.push_back(combination);\n            return;\n        } else if (k < 0) {\n            return;\n        }\n\n        for (int i = start; i < 10 && n >=  k * i + k * (k - 1) \/ 2; ++i) {\n            combination.push_back(i);\n            combinationSum3(res, combination, i + 1, k - 1, n - i);\n            combination.pop_back();\n        }\n    }\n};\n<commit_msg>Update combination-sum-iii.cpp<commit_after>\/\/ Time:  O(k * C(n, k))\n\/\/ Space: O(k)\n\nclass Solution {\npublic:\n    vector<vector<int> > combinationSum3(int k, int n) {\n        vector<vector<int>> res;\n        vector<int> combination;\n        combinationSum3(res, combination, 1, k, n);\n        return res;\n    }\nprivate:\n    void combinationSum3(vector<vector<int> > &res, vector<int> &combination, int start, int k, int n) {\n        if (!k && !n) {\n            res.push_back(combination);\n            return;\n        } else if (k < 0) {\n            return;\n        }\n\n        for (int i = start; i < 10 && n >=  k * i + k * (k - 1) \/ 2; ++i) {\n            combination.push_back(i);\n            combinationSum3(res, combination, i + 1, k - 1, n - i);\n            combination.pop_back();\n        }\n    }\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_sys.cpp\n* @version     \n* @brief      \n* @author\tduye\n* @date\t\t2014-03-04\n* @note \n*\n*  1. 2014-03-04 duye Created this file\n* \n*\/\n\n#include <unistd.h>\n#include <stdarg.h>\n#include <sys\/time.h>\n#include <stdio.h>\n#include <string.h>\n#include <g_sys.h>\n\nnamespace gsys {\n\nvoid System::sleep(const GUint64 time)\n{\n\t::sleep(time);\n}\n\nvoid System::usleep(const GUint64 time)\n{\n\t::usleep(time);\n}\n\nGUint64 System::pformat(GInt8* buffer, const GUint64 size, const GInt8* args, ...)\n{\n\tIS_NULL_R(buffer);\n\t\n\tva_list vaList;\n\tva_start(vaList, args);\n\tGUint64 strLen = vsnprintf(buffer, size, args, vaList);\n\tva_end(vaList);\t\n\treturn strLen;\n}\n\nGResult System::shell(const GInt8* cmd)\n{\n\tIS_NULL_R(cmd);\n\n\tFILE* retStream = popen(cmd, \"r\");\n\tif (retStream == NULL)\n\t{\n\t\treturn G_NO;\n\t}\n\t\n\tpclose(retStream);\n\n\treturn G_YES;      \n}\n\nGResult System::shell(const GInt8* cmd, GInt8* buffer, const GUint32 size)\n{\n\tIS_NULL_R(cmd);\n\tIS_NULL_R(buffer);\n\n\tFILE* retStream = popen(cmd, \"r\");\n\tif (retStream == NULL)\n\t{\n\t\treturn G_NO;\n\t}\n\n\tmemset(buffer, 0, size);\n\tfread(buffer, sizeof(GInt8), size, retStream);\n\t\n\tpclose(retStream);\n\n\treturn G_YES;      \n}\n\nGUint64 System::sysTime()\n{\n\tstruct timeval now;\n\tstruct timezone tz;\n\tif (gettimeofday(&now, &tz) < 0)\n\t{\n\t\treturn 0;\n\t}\n\t\n\treturn (GUint64)(now.tv_sec) * 1000000 + now.tv_usec;\n}\n\nGResult System::sysTime(const GInt8* format, GInt8* buffer, const GUint32 size)\n{\n\tIS_NULL_R(format);\n\tIS_NULL_R(buffer);\n\t\n    struct timeval tv;\n    struct tm tm;\n    \n    gettimeofday(&tv, NULL);\n    localtime_r(&tv.tv_sec, &tm);\n    \/\/strftime(buffer, size, \"%Y-%m-%d %H:%M:%S\", &tm);\n    GUint32 len = strftime(buffer, size, format, &tm);\n    if (len + 7 >= size)\n    {\n    \treturn G_NO;\t\n    }\n    \n    snprintf(buffer + len, size - len, \".%6d\", (GInt32)tv.tv_usec);\n\n    return G_YES;\t\t\n}\n\nGResult System::optArg(GInt32 argc, GInt8** argv, GInt8* cmd, GInt64& value)\n{\n\tIS_NULL_R(argv);\n\tIS_NULL_R(cmd);\n\t\n\tif (getopt(argc, argv, cmd) != cmd[0])\n\t{\n\t\treturn G_NO;\n\t}\n\t\n\tconst std::string temp_str(optarg);\n\tvalue = (GInt64)std::stoi(temp_str);\n\t\n\treturn G_YES;\n}\n\nGResult System::optArg(GInt32 argc, GInt8** argv, GInt8* cmd, GUint64& value)\n{\n\tIS_NULL_R(argv);\n\tIS_NULL_R(cmd);\n\t\n\tif (getopt(argc, argv, cmd) != cmd[0])\n\t{\n\t\treturn G_NO;\n\t}\n\t\n\tconst std::string temp_str(optarg);\n\tvalue = (GUint64)std::stoi(temp_str);\t\n\t\n\treturn G_YES;\n}\n\nGResult System::optArg(GInt32 argc, GInt8** argv, GInt8* cmd, std::string& value)\n{\n\tIS_NULL_R(argv);\n\tIS_NULL_R(cmd);\n\t\n\tif (getopt(argc, argv, cmd) != cmd[0])\n\t{\n\t\treturn G_NO;\n\t}\n\t\n\tvalue.assign(optarg);\n\t\n\treturn G_YES;\n}\n\n}\n<commit_msg>Update g_sys.cpp<commit_after>\/************************************************************************************\n**  \n* @copyright (c) 2013-2100, ChengDu Duyer Technology Co., LTD. All Right Reserved.\n*\n*************************************************************************************\/\n\/**\n* @file\t    g_sys.cpp\n* @version     \n* @brief      \n* @author   duye\n* @date\t    2014-03-04\n* @note \n*\n*  1. 2014-03-04 duye Created this file\n* \n*\/\n#include <unistd.h>\n#include <stdarg.h>\n#include <sys\/time.h>\n#include <stdio.h>\n#include <string.h>\n#include <g_sys.h>\n\nnamespace gsys {\n\nvoid System::sleep(const GUint64 time)\n{\n    ::sleep(time);\n}\n\nvoid System::usleep(const GUint64 time)\n{\n    ::usleep(time);\n}\n\nGUint64 System::pformat(GInt8* buffer, const GUint64 size, const GInt8* args, ...)\n{\n    IS_NULL_R(buffer);\n    va_list vaList;\n    va_start(vaList, args);\n    GUint64 strLen = vsnprintf(buffer, size, args, vaList);\n    va_end(vaList);\t\n    return strLen;\n}\n\nGResult System::shell(const GInt8* cmd)\n{\n    IS_NULL_R(cmd);\n\n    FILE* retStream = popen(cmd, \"r\");\n    if (retStream == NULL)\n    {\n    \treturn G_NO;\n    }\n\n    pclose(retStream);\n    return G_YES;      \n}\n\nGResult System::shell(const GInt8* cmd, GInt8* buffer, const GUint32 size)\n{\n    IS_NULL_R(cmd);\n    IS_NULL_R(buffer);\n\n    FILE* retStream = popen(cmd, \"r\");\n    if (retStream == NULL)\n    {\n    \treturn G_NO;\n    }\n\n    memset(buffer, 0, size); \n    fread(buffer, sizeof(GInt8), size, retStream);\n\t\n    pclose(retStream);\n    return G_YES;      \n}\n\nGUint64 System::sysTime()\n{\n    struct timeval now;\n    struct timezone tz;\n    if (gettimeofday(&now, &tz) < 0)\n    {\n    \treturn 0;\n    }\n\t\n    return (GUint64)(now.tv_sec) * 1000000 + now.tv_usec;\n}\n\nGResult System::sysTime(const GInt8* format, GInt8* buffer, const GUint32 size)\n{\n    IS_NULL_R(format);\n    IS_NULL_R(buffer);\n\t\n    struct timeval tv;\n    struct tm tm;\n    \n    gettimeofday(&tv, NULL);\n    localtime_r(&tv.tv_sec, &tm);\n    \/\/strftime(buffer, size, \"%Y-%m-%d %H:%M:%S\", &tm);\n    GUint32 len = strftime(buffer, size, format, &tm);\n    if (len + 7 >= size)\n    {\n    \treturn G_NO;\t\n    }\n    \n    snprintf(buffer + len, size - len, \".%6d\", (GInt32)tv.tv_usec);\n\n    return G_YES;\t\t\n}\n\nGResult System::optArg(GInt32 argc, GInt8** argv, GInt8* cmd, GInt64& value)\n{\n    IS_NULL_R(argv);\n    IS_NULL_R(cmd);\n\t\n    if (getopt(argc, argv, cmd) != cmd[0])\n    {\n    \treturn G_NO;\n    }\n\t\n    const std::string temp_str(optarg);\n    value = (GInt64)std::stoi(temp_str);\n    return G_YES;\n}\n\nGResult System::optArg(GInt32 argc, GInt8** argv, GInt8* cmd, GUint64& value)\n{\n    IS_NULL_R(argv);\n    IS_NULL_R(cmd);\n\t\n    if (getopt(argc, argv, cmd) != cmd[0])\n    {\n    \treturn G_NO;\n    }\n    \n    const std::string temp_str(optarg);\n    value = (GUint64)std::stoi(temp_str);\t\n    return G_YES;\n}\n\nGResult System::optArg(GInt32 argc, GInt8** argv, GInt8* cmd, std::string& value)\n{\n    IS_NULL_R(argv);\n    IS_NULL_R(cmd);\n\t\n    if (getopt(argc, argv, cmd) != cmd[0])\n    {\n    \treturn G_NO;\n    }\n\t\n    value.assign(optarg);\n    return G_YES;\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2007, Michael Feathers, James Grenning and Bas Vodde\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 <organization> 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 EARLIER MENTIONED AUTHORS ``AS IS'' AND ANY\n * 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 <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 DAMA\n *\/\n\n#include <stdlib.h>\n#include \"CppUTest\/TestHarness.h\"\n#undef malloc\n#undef free\n#undef calloc\n#undef realloc\n#undef strdup\n#undef strndup\n\n#ifdef CPPUTEST_HAVE_GETTIMEOFDAY\n#include <sys\/time.h>\n#endif\n#if defined(CPPUTEST_HAVE_FORK) && defined(CPPUTEST_HAVE_WAITPID)\n#include <unistd.h>\n#include <sys\/wait.h>\n#include <errno.h>\n#endif\n\n#include <time.h>\n#include <stdio.h>\n#include <stdarg.h>\n#include <setjmp.h>\n#include <string.h>\n#include <math.h>\n#include <ctype.h>\n#include <signal.h>\n\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\n#include <pthread.h>\n#endif\n\n#include \"CppUTest\/PlatformSpecificFunctions.h\"\n\nstatic jmp_buf test_exit_jmp_buf[10];\nstatic int jmp_buf_index = 0;\n\n\/\/ There is a possibility that a compiler provides fork but not waitpid.\n\/\/ TODO consider using spawn() and cwait()?\n#if !defined(CPPUTEST_HAVE_FORK) || !defined(CPPUTEST_HAVE_WAITPID)\n\nstatic void BorlandPlatformSpecificRunTestInASeperateProcess(UtestShell* shell, TestPlugin*, TestResult* result)\n{\n    result->addFailure(TestFailure(shell, \"-p doesn't work on this platform, as it is lacking fork.\\b\"));\n}\n\nstatic int PlatformSpecificForkImplementation(void)\n{\n    return 0;\n}\n\nstatic int PlatformSpecificWaitPidImplementation(int, int*, int)\n{\n    return 0;\n}\n\n#else\n\nstatic void SetTestFailureByStatusCode(UtestShell* shell, TestResult* result, int status)\n{\n    if (WIFEXITED(status) && WEXITSTATUS(status) != 0) {\n        result->addFailure(TestFailure(shell, \"Failed in separate process\"));\n    } else if (WIFSIGNALED(status)) {\n        SimpleString message(\"Failed in separate process - killed by signal \");\n        message += StringFrom(WTERMSIG(status));\n        result->addFailure(TestFailure(shell, message));\n    } else if (WIFSTOPPED(status)) {\n        result->addFailure(TestFailure(shell, \"Stopped in separate process - continuing\"));\n    }\n}\n\nstatic void BorlandPlatformSpecificRunTestInASeperateProcess(UtestShell* shell, TestPlugin* plugin, TestResult* result)\n{\n    const pid_t syscallError = -1;\n    pid_t cpid;\n    pid_t w;\n    int status = 0;\n\n    cpid = PlatformSpecificFork();\n\n    if (cpid == syscallError) {\n        result->addFailure(TestFailure(shell, \"Call to fork() failed\"));\n        return;\n    }\n\n    if (cpid == 0) {            \/* Code executed by child *\/\n        const size_t initialFailureCount = result->getFailureCount(); \/\/ LCOV_EXCL_LINE\n        shell->runOneTestInCurrentProcess(plugin, *result);        \/\/ LCOV_EXCL_LINE\n        _exit(initialFailureCount < result->getFailureCount());    \/\/ LCOV_EXCL_LINE\n    } else {                    \/* Code executed by parent *\/\n        size_t amountOfRetries = 0;\n        do {\n            w = PlatformSpecificWaitPid(cpid, &status, WUNTRACED);\n            if (w == syscallError) {\n                \/\/ OS X debugger causes EINTR\n                if (EINTR == errno) {\n                  if (amountOfRetries > 30) {\n                    result->addFailure(TestFailure(shell, \"Call to waitpid() failed with EINTR. Tried 30 times and giving up! Sometimes happens in debugger\"));\n                    return;\n                  }\n                  amountOfRetries++;\n                }\n                else {\n                    result->addFailure(TestFailure(shell, \"Call to waitpid() failed\"));\n                    return;\n                }\n            } else {\n                SetTestFailureByStatusCode(shell, result, status);\n                if (WIFSTOPPED(status)) kill(w, SIGCONT);\n            }\n        } while ((w == syscallError) || (!WIFEXITED(status) && !WIFSIGNALED(status)));\n    }\n}\n\nstatic pid_t PlatformSpecificForkImplementation(void)\n{\n    return fork();\n}\n\nstatic pid_t PlatformSpecificWaitPidImplementation(int pid, int* status, int options)\n{\n    return waitpid(pid, status, options);\n}\n\n#endif\n\nTestOutput::WorkingEnvironment PlatformSpecificGetWorkingEnvironment()\n{\n    return TestOutput::eclipse;\n}\n\nvoid (*PlatformSpecificRunTestInASeperateProcess)(UtestShell* shell, TestPlugin* plugin, TestResult* result) =\n        BorlandPlatformSpecificRunTestInASeperateProcess;\nint (*PlatformSpecificFork)(void) = PlatformSpecificForkImplementation;\nint (*PlatformSpecificWaitPid)(int, int*, int) = PlatformSpecificWaitPidImplementation;\n\nextern \"C\" {\n\nstatic int PlatformSpecificSetJmpImplementation(void (*function) (void* data), void* data)\n{\n    if (0 == setjmp(test_exit_jmp_buf[jmp_buf_index])) {\n        jmp_buf_index++;\n        function(data);\n        jmp_buf_index--;\n        return 1;\n    }\n    return 0;\n}\n\nstatic void PlatformSpecificLongJmpImplementation()\n{\n    jmp_buf_index--;\n    longjmp(test_exit_jmp_buf[jmp_buf_index], 1);\n}\n\nstatic void PlatformSpecificRestoreJumpBufferImplementation()\n{\n    jmp_buf_index--;\n}\n\nvoid (*PlatformSpecificLongJmp)() = PlatformSpecificLongJmpImplementation;\nint (*PlatformSpecificSetJmp)(void (*)(void*), void*) = PlatformSpecificSetJmpImplementation;\nvoid (*PlatformSpecificRestoreJumpBuffer)() = PlatformSpecificRestoreJumpBufferImplementation;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/ Time in millis\n\nstatic long TimeInMillisImplementation()\n{\n#ifdef CPPUTEST_HAVE_GETTIMEOFDAY\n    struct timeval tv;\n    struct timezone tz;\n    gettimeofday(&tv, &tz);\n    return (tv.tv_sec * 1000) + (long)((double)tv.tv_usec * 0.001);\n#else\n    return 0;\n#endif\n}\n\nstatic const char* TimeStringImplementation()\n{\n    time_t theTime = time(NULLPTR);\n    static char dateTime[80];\n    struct tm *tmp = localtime(&theTime);\n    strftime(dateTime, 80, \"%Y-%m-%dT%H:%M:%S\", tmp);\n    return dateTime;\n}\n\nlong (*GetPlatformSpecificTimeInMillis)() = TimeInMillisImplementation;\nconst char* (*GetPlatformSpecificTimeString)() = TimeStringImplementation;\n\nint (*PlatformSpecificVSNprintf)(char *str, size_t size, const char* format, va_list va_args_list) = vsnprintf;\n\nstatic PlatformSpecificFile PlatformSpecificFOpenImplementation(const char* filename, const char* flag)\n{\n   return fopen(filename, flag);\n}\n\nstatic void PlatformSpecificFPutsImplementation(const char* str, PlatformSpecificFile file)\n{\n   fputs(str, (FILE*)file);\n}\n\nstatic void PlatformSpecificFCloseImplementation(PlatformSpecificFile file)\n{\n   fclose((FILE*)file);\n}\n\nstatic void PlatformSpecificFlushImplementation()\n{\n  fflush(stdout);\n}\n\nPlatformSpecificFile (*PlatformSpecificFOpen)(const char*, const char*) = PlatformSpecificFOpenImplementation;\nvoid (*PlatformSpecificFPuts)(const char*, PlatformSpecificFile) = PlatformSpecificFPutsImplementation;\nvoid (*PlatformSpecificFClose)(PlatformSpecificFile) = PlatformSpecificFCloseImplementation;\n\nint (*PlatformSpecificPutchar)(int) = putchar;\nvoid (*PlatformSpecificFlush)() = PlatformSpecificFlushImplementation;\n\nvoid* (*PlatformSpecificMalloc)(size_t size) = malloc;\nvoid* (*PlatformSpecificRealloc)(void*, size_t) = realloc;\nvoid (*PlatformSpecificFree)(void* memory) = free;\nvoid* (*PlatformSpecificMemCpy)(void*, const void*, size_t) = memcpy;\nvoid* (*PlatformSpecificMemset)(void*, int, size_t) = memset;\n\nstatic int IsNanImplementation(double d)\n{\n    return isnan(d);\n}\n\nstatic int IsInfImplementation(double d)\n{\n    return isinf(d);\n}\n\ndouble (*PlatformSpecificFabs)(double) = fabs;\nvoid (*PlatformSpecificSrand)(unsigned int) = srand;\nint (*PlatformSpecificRand)(void) = rand;\nint (*PlatformSpecificIsNan)(double) = IsNanImplementation;\nint (*PlatformSpecificIsInf)(double) = IsInfImplementation;\nint (*PlatformSpecificAtExit)(void(*func)(void)) = atexit;  \/\/\/ this was undefined before\n\nstatic PlatformSpecificMutex PThreadMutexCreate(void)\n{\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\n    pthread_mutex_t *mutex = new pthread_mutex_t;\n\n    pthread_mutex_init(mutex, NULLPTR);\n    return (PlatformSpecificMutex)mutex;\n#else\n    return NULLPTR;\n#endif\n\n}\n\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\nstatic void PThreadMutexLock(PlatformSpecificMutex mtx)\n{\n    pthread_mutex_lock((pthread_mutex_t *)mtx);\n}\n#else\nstatic void PThreadMutexLock(PlatformSpecificMutex)\n{\n}\n#endif\n\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\nstatic void PThreadMutexUnlock(PlatformSpecificMutex mtx)\n{\n    pthread_mutex_unlock((pthread_mutex_t *)mtx);\n}\n#else\nstatic void PThreadMutexUnlock(PlatformSpecificMutex)\n{\n}\n#endif\n\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\nstatic void PThreadMutexDestroy(PlatformSpecificMutex mtx)\n{\n    pthread_mutex_t *mutex = (pthread_mutex_t *)mtx;\n    pthread_mutex_destroy(mutex);\n    delete mutex;\n}\n#else\nstatic void PThreadMutexDestroy(PlatformSpecificMutex)\n{\n}\n#endif\n\nPlatformSpecificMutex (*PlatformSpecificMutexCreate)(void) = PThreadMutexCreate;\nvoid (*PlatformSpecificMutexLock)(PlatformSpecificMutex) = PThreadMutexLock;\nvoid (*PlatformSpecificMutexUnlock)(PlatformSpecificMutex) = PThreadMutexUnlock;\nvoid (*PlatformSpecificMutexDestroy)(PlatformSpecificMutex) = PThreadMutexDestroy;\n\n}\n<commit_msg>Update UtestPlatform.cpp<commit_after>\/*\n * Copyright (c) 2007, Michael Feathers, James Grenning and Bas Vodde\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 <organization> 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 EARLIER MENTIONED AUTHORS ``AS IS'' AND ANY\n * 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 <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#include <stdlib.h>\n#include \"CppUTest\/TestHarness.h\"\n#undef malloc\n#undef free\n#undef calloc\n#undef realloc\n#undef strdup\n#undef strndup\n\n#ifdef CPPUTEST_HAVE_GETTIMEOFDAY\n#include <sys\/time.h>\n#endif\n#if defined(CPPUTEST_HAVE_FORK) && defined(CPPUTEST_HAVE_WAITPID)\n#include <unistd.h>\n#include <sys\/wait.h>\n#include <errno.h>\n#endif\n\n#include <time.h>\n#include <stdio.h>\n#include <stdarg.h>\n#include <setjmp.h>\n#include <string.h>\n#include <math.h>\n#include <float.h>\n#include <ctype.h>\n#include <signal.h>\n\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\n#include <pthread.h>\n#endif\n\n#include \"CppUTest\/PlatformSpecificFunctions.h\"\n\nstatic jmp_buf test_exit_jmp_buf[10];\nstatic int jmp_buf_index = 0;\n\n\/\/ There is a possibility that a compiler provides fork but not waitpid.\n\/\/ TODO consider using spawn() and cwait()?\n#if !defined(CPPUTEST_HAVE_FORK) || !defined(CPPUTEST_HAVE_WAITPID)\n\nstatic void BorlandPlatformSpecificRunTestInASeperateProcess(UtestShell* shell, TestPlugin*, TestResult* result)\n{\n    result->addFailure(TestFailure(shell, \"-p doesn't work on this platform, as it is lacking fork.\\b\"));\n}\n\nstatic int PlatformSpecificForkImplementation(void)\n{\n    return 0;\n}\n\nstatic int PlatformSpecificWaitPidImplementation(int, int*, int)\n{\n    return 0;\n}\n\n#else\n\nstatic void SetTestFailureByStatusCode(UtestShell* shell, TestResult* result, int status)\n{\n    if (WIFEXITED(status) && WEXITSTATUS(status) != 0) {\n        result->addFailure(TestFailure(shell, \"Failed in separate process\"));\n    } else if (WIFSIGNALED(status)) {\n        SimpleString message(\"Failed in separate process - killed by signal \");\n        message += StringFrom(WTERMSIG(status));\n        result->addFailure(TestFailure(shell, message));\n    } else if (WIFSTOPPED(status)) {\n        result->addFailure(TestFailure(shell, \"Stopped in separate process - continuing\"));\n    }\n}\n\nstatic void BorlandPlatformSpecificRunTestInASeperateProcess(UtestShell* shell, TestPlugin* plugin, TestResult* result)\n{\n    const pid_t syscallError = -1;\n    pid_t cpid;\n    pid_t w;\n    int status = 0;\n\n    cpid = PlatformSpecificFork();\n\n    if (cpid == syscallError) {\n        result->addFailure(TestFailure(shell, \"Call to fork() failed\"));\n        return;\n    }\n\n    if (cpid == 0) {            \/* Code executed by child *\/\n        const size_t initialFailureCount = result->getFailureCount(); \/\/ LCOV_EXCL_LINE\n        shell->runOneTestInCurrentProcess(plugin, *result);        \/\/ LCOV_EXCL_LINE\n        _exit(initialFailureCount < result->getFailureCount());    \/\/ LCOV_EXCL_LINE\n    } else {                    \/* Code executed by parent *\/\n        size_t amountOfRetries = 0;\n        do {\n            w = PlatformSpecificWaitPid(cpid, &status, WUNTRACED);\n            if (w == syscallError) {\n                \/\/ OS X debugger causes EINTR\n                if (EINTR == errno) {\n                  if (amountOfRetries > 30) {\n                    result->addFailure(TestFailure(shell, \"Call to waitpid() failed with EINTR. Tried 30 times and giving up! Sometimes happens in debugger\"));\n                    return;\n                  }\n                  amountOfRetries++;\n                }\n                else {\n                    result->addFailure(TestFailure(shell, \"Call to waitpid() failed\"));\n                    return;\n                }\n            } else {\n                SetTestFailureByStatusCode(shell, result, status);\n                if (WIFSTOPPED(status)) kill(w, SIGCONT);\n            }\n        } while ((w == syscallError) || (!WIFEXITED(status) && !WIFSIGNALED(status)));\n    }\n}\n\nstatic pid_t PlatformSpecificForkImplementation(void)\n{\n    return fork();\n}\n\nstatic pid_t PlatformSpecificWaitPidImplementation(int pid, int* status, int options)\n{\n    return waitpid(pid, status, options);\n}\n\n#endif\n\nTestOutput::WorkingEnvironment PlatformSpecificGetWorkingEnvironment()\n{\n    return TestOutput::eclipse;\n}\n\nvoid (*PlatformSpecificRunTestInASeperateProcess)(UtestShell* shell, TestPlugin* plugin, TestResult* result) =\n        BorlandPlatformSpecificRunTestInASeperateProcess;\nint (*PlatformSpecificFork)(void) = PlatformSpecificForkImplementation;\nint (*PlatformSpecificWaitPid)(int, int*, int) = PlatformSpecificWaitPidImplementation;\n\nextern \"C\" {\n\nstatic int PlatformSpecificSetJmpImplementation(void (*function) (void* data), void* data)\n{\n    if (0 == setjmp(test_exit_jmp_buf[jmp_buf_index])) {\n        jmp_buf_index++;\n        function(data);\n        jmp_buf_index--;\n        return 1;\n    }\n    return 0;\n}\n\nstatic void PlatformSpecificLongJmpImplementation()\n{\n    jmp_buf_index--;\n    longjmp(test_exit_jmp_buf[jmp_buf_index], 1);\n}\n\nstatic void PlatformSpecificRestoreJumpBufferImplementation()\n{\n    jmp_buf_index--;\n}\n\nvoid (*PlatformSpecificLongJmp)() = PlatformSpecificLongJmpImplementation;\nint (*PlatformSpecificSetJmp)(void (*)(void*), void*) = PlatformSpecificSetJmpImplementation;\nvoid (*PlatformSpecificRestoreJumpBuffer)() = PlatformSpecificRestoreJumpBufferImplementation;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/ Time in millis\n\nstatic long TimeInMillisImplementation()\n{\n#ifdef CPPUTEST_HAVE_GETTIMEOFDAY\n    struct timeval tv;\n    struct timezone tz;\n    gettimeofday(&tv, &tz);\n    return (tv.tv_sec * 1000) + (long)((double)tv.tv_usec * 0.001);\n#else\n    return 0;\n#endif\n}\n\nstatic const char* TimeStringImplementation()\n{\n    time_t theTime = time(NULLPTR);\n    static char dateTime[80];\n    struct tm *tmp = localtime(&theTime);\n    strftime(dateTime, 80, \"%Y-%m-%dT%H:%M:%S\", tmp);\n    return dateTime;\n}\n\nlong (*GetPlatformSpecificTimeInMillis)() = TimeInMillisImplementation;\nconst char* (*GetPlatformSpecificTimeString)() = TimeStringImplementation;\n\nint (*PlatformSpecificVSNprintf)(char *str, size_t size, const char* format, va_list va_args_list) = vsnprintf;\n\nstatic PlatformSpecificFile PlatformSpecificFOpenImplementation(const char* filename, const char* flag)\n{\n   return fopen(filename, flag);\n}\n\nstatic void PlatformSpecificFPutsImplementation(const char* str, PlatformSpecificFile file)\n{\n   fputs(str, (FILE*)file);\n}\n\nstatic void PlatformSpecificFCloseImplementation(PlatformSpecificFile file)\n{\n   fclose((FILE*)file);\n}\n\nstatic void PlatformSpecificFlushImplementation()\n{\n  fflush(stdout);\n}\n\nPlatformSpecificFile (*PlatformSpecificFOpen)(const char*, const char*) = PlatformSpecificFOpenImplementation;\nvoid (*PlatformSpecificFPuts)(const char*, PlatformSpecificFile) = PlatformSpecificFPutsImplementation;\nvoid (*PlatformSpecificFClose)(PlatformSpecificFile) = PlatformSpecificFCloseImplementation;\n\nint (*PlatformSpecificPutchar)(int) = putchar;\nvoid (*PlatformSpecificFlush)() = PlatformSpecificFlushImplementation;\n\nvoid* (*PlatformSpecificMalloc)(size_t size) = malloc;\nvoid* (*PlatformSpecificRealloc)(void*, size_t) = realloc;\nvoid (*PlatformSpecificFree)(void* memory) = free;\nvoid* (*PlatformSpecificMemCpy)(void*, const void*, size_t) = memcpy;\nvoid* (*PlatformSpecificMemset)(void*, int, size_t) = memset;\n\nstatic int IsNanImplementation(double d)\n{\n    return _isnan(d);\n}\n\nstatic int IsInfImplementation(double d)\n{\n    return isinf(d);\n}\n\ndouble (*PlatformSpecificFabs)(double) = fabs;\nvoid (*PlatformSpecificSrand)(unsigned int) = srand;\nint (*PlatformSpecificRand)(void) = rand;\nint (*PlatformSpecificIsNan)(double) = IsNanImplementation;\nint (*PlatformSpecificIsInf)(double) = IsInfImplementation;\nint (*PlatformSpecificAtExit)(void(*func)(void)) = atexit;  \/\/\/ this was undefined before\n\nstatic PlatformSpecificMutex PThreadMutexCreate(void)\n{\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\n    pthread_mutex_t *mutex = new pthread_mutex_t;\n\n    pthread_mutex_init(mutex, NULLPTR);\n    return (PlatformSpecificMutex)mutex;\n#else\n    return NULLPTR;\n#endif\n\n}\n\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\nstatic void PThreadMutexLock(PlatformSpecificMutex mtx)\n{\n    pthread_mutex_lock((pthread_mutex_t *)mtx);\n}\n#else\nstatic void PThreadMutexLock(PlatformSpecificMutex)\n{\n}\n#endif\n\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\nstatic void PThreadMutexUnlock(PlatformSpecificMutex mtx)\n{\n    pthread_mutex_unlock((pthread_mutex_t *)mtx);\n}\n#else\nstatic void PThreadMutexUnlock(PlatformSpecificMutex)\n{\n}\n#endif\n\n#ifdef CPPUTEST_HAVE_PTHREAD_MUTEX_LOCK\nstatic void PThreadMutexDestroy(PlatformSpecificMutex mtx)\n{\n    pthread_mutex_t *mutex = (pthread_mutex_t *)mtx;\n    pthread_mutex_destroy(mutex);\n    delete mutex;\n}\n#else\nstatic void PThreadMutexDestroy(PlatformSpecificMutex)\n{\n}\n#endif\n\nPlatformSpecificMutex (*PlatformSpecificMutexCreate)(void) = PThreadMutexCreate;\nvoid (*PlatformSpecificMutexLock)(PlatformSpecificMutex) = PThreadMutexLock;\nvoid (*PlatformSpecificMutexUnlock)(PlatformSpecificMutex) = PThreadMutexUnlock;\nvoid (*PlatformSpecificMutexDestroy)(PlatformSpecificMutex) = PThreadMutexDestroy;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 <primitives\/block.h>\n\n#ifndef NO_GLOBALTOKEN_HARDFORK\n#include <globaltoken\/hardfork.h>\n#else\n#define IsHardForkActivated(nTime) (((nTime) >= (1527811200)) ? true : false)\n#endif\n#include <hash.h>\n#include <tinyformat.h>\n#include <utilstrencodings.h>\n#include <crypto\/common.h>\n#include <crypto\/algos\/hashlib\/multihash.h>\n#include <crypto\/algos\/neoscrypt\/neoscrypt.h>\n#include <crypto\/algos\/scrypt\/scrypt.h>\n#include <crypto\/algos\/yescrypt\/yescrypt.h>\n\n#ifndef NO_GLOBALTOKEN_HARDFORK\nuint256 CBlockHeader::GetHash(const Consensus::Params& params) const\n{\n    int version;\n    if (IsHardForkActivated(nTime, params)) {\n        version = PROTOCOL_VERSION;\n    } else {\n        version = PROTOCOL_VERSION | SERIALIZE_BLOCK_LEGACY;\n    }\n    CHashWriter writer(SER_GETHASH, version);\n    ::Serialize(writer, *this);\n    return writer.GetHash();\n}\n\nuint256 CBlockHeader::GetHash() const\n{\n    const Consensus::Params& consensusParams = Params().GetConsensus();\n    return GetHash(consensusParams);\n}\n#else\nuint256 CBlockHeader::GetHash() const\n{\n    int version;\n    if (IsHardForkActivated(nTime)) {\n        version = PROTOCOL_VERSION;\n    } else {\n        version = PROTOCOL_VERSION | SERIALIZE_BLOCK_LEGACY;\n    }\n    CHashWriter writer(SER_GETHASH, version);\n    ::Serialize(writer, *this);\n    return writer.GetHash();\n}\n#endif\nint CBlockHeader::GetAlgo() const\n{\n\tif (IsHardForkActivated(nTime)) \n\t{\n\t\treturn nAlgo;\n\t}\n\treturn ALGO_SHA256D;\n}\n\nuint256 CBlockHeader::GetPoWHash(int algo) const\n{\n    switch (algo)\n    {\n        case ALGO_SHA256D:\n            return GetHash();\n        case ALGO_SCRYPT:\n        {\n            uint256 thash;\n            scrypt_1024_1_1_256(BEGIN(nVersion), BEGIN(thash));\n            return thash;\n        }\n        case ALGO_X11:\n        {\n            uint32_t default_nonce = (uint32_t)nNonce.GetUint64(0);\n            return HashX11(BEGIN(nVersion), END(default_nonce));\n        }\n        case ALGO_NEOSCRYPT:\n        {\n            unsigned int profile = 0x0;\n            uint256 thash;\n            neoscrypt((unsigned char *) &nVersion, (unsigned char *) &thash, profile);\t\t\t\t\n            return thash;\n        }\n        case ALGO_EQUIHASH:\n            return GetHash();\n        case ALGO_YESCRYPT:\n        {\n            uint256 thash;\n            yescrypt_hash(BEGIN(nVersion), BEGIN(thash));\n            return thash;\n        }\n        case ALGO_HMQ1725:\n        {\n            uint32_t default_nonce = (uint32_t)nNonce.GetUint64(0);\n            return HMQ1725(BEGIN(nVersion), END(default_nonce));\n        }\n    }\n    return GetHash();\n}\n\nstd::string CBlock::ToString() const\n{\n    std::stringstream s;\n    s << strprintf(\"CBlock(hash=%s, ver=0x%08x, powalgo=%u, powalgoname=%s, powhash=%s, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%s, vtx=%u)\\n\",\n        GetHash().ToString(),\n        nVersion,\n        GetAlgo(),\n        GetAlgoName(GetAlgo()),\n        GetPoWHash(GetAlgo()).ToString(),\n        hashPrevBlock.ToString(),\n        hashMerkleRoot.ToString(),\n        nTime, nBits, nNonce.GetHex(),\n        vtx.size());\n    for (const auto& tx : vtx) {\n        s << \"  \" << tx->ToString() << \"\\n\";\n    }\n    return s.str();\n}\n\nstd::string GetAlgoName(int Algo)\n{\n    switch (Algo)\n    {\n        case ALGO_SHA256D:\n            return std::string(\"sha256d\");\n        case ALGO_SCRYPT:\n            return std::string(\"scrypt\");\n        case ALGO_X11:\n            return std::string(\"x11\");\n        case ALGO_NEOSCRYPT:\n            return std::string(\"neoscrypt\");\n        case ALGO_YESCRYPT:\n            return std::string(\"yescrypt\");\n        case ALGO_EQUIHASH:\n            return std::string(\"equihash\");\n\tcase ALGO_HMQ1725:\n            return std::string(\"hmq1725\");\n    }\n    return std::string(\"unknown\");       \n}\n<commit_msg>chainparams.h not included<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 <primitives\/block.h>\n\n#ifndef NO_GLOBALTOKEN_HARDFORK\n#include <globaltoken\/hardfork.h>\n#else\n#define IsHardForkActivated(nTime) (((nTime) >= (1527811200)) ? true : false)\n#endif\n#include <hash.h>\n#include <tinyformat.h>\n#include <utilstrencodings.h>\n#include <chainparams.h>\n#include <crypto\/common.h>\n#include <crypto\/algos\/hashlib\/multihash.h>\n#include <crypto\/algos\/neoscrypt\/neoscrypt.h>\n#include <crypto\/algos\/scrypt\/scrypt.h>\n#include <crypto\/algos\/yescrypt\/yescrypt.h>\n\n#ifndef NO_GLOBALTOKEN_HARDFORK\nuint256 CBlockHeader::GetHash(const Consensus::Params& params) const\n{\n    int version;\n    if (IsHardForkActivated(nTime, params)) {\n        version = PROTOCOL_VERSION;\n    } else {\n        version = PROTOCOL_VERSION | SERIALIZE_BLOCK_LEGACY;\n    }\n    CHashWriter writer(SER_GETHASH, version);\n    ::Serialize(writer, *this);\n    return writer.GetHash();\n}\n\nuint256 CBlockHeader::GetHash() const\n{\n    const Consensus::Params& consensusParams = Params().GetConsensus();\n    return GetHash(consensusParams);\n}\n#else\nuint256 CBlockHeader::GetHash() const\n{\n    int version;\n    if (IsHardForkActivated(nTime)) {\n        version = PROTOCOL_VERSION;\n    } else {\n        version = PROTOCOL_VERSION | SERIALIZE_BLOCK_LEGACY;\n    }\n    CHashWriter writer(SER_GETHASH, version);\n    ::Serialize(writer, *this);\n    return writer.GetHash();\n}\n#endif\nint CBlockHeader::GetAlgo() const\n{\n\tif (IsHardForkActivated(nTime)) \n\t{\n\t\treturn nAlgo;\n\t}\n\treturn ALGO_SHA256D;\n}\n\nuint256 CBlockHeader::GetPoWHash(int algo) const\n{\n    switch (algo)\n    {\n        case ALGO_SHA256D:\n            return GetHash();\n        case ALGO_SCRYPT:\n        {\n            uint256 thash;\n            scrypt_1024_1_1_256(BEGIN(nVersion), BEGIN(thash));\n            return thash;\n        }\n        case ALGO_X11:\n        {\n            uint32_t default_nonce = (uint32_t)nNonce.GetUint64(0);\n            return HashX11(BEGIN(nVersion), END(default_nonce));\n        }\n        case ALGO_NEOSCRYPT:\n        {\n            unsigned int profile = 0x0;\n            uint256 thash;\n            neoscrypt((unsigned char *) &nVersion, (unsigned char *) &thash, profile);\t\t\t\t\n            return thash;\n        }\n        case ALGO_EQUIHASH:\n            return GetHash();\n        case ALGO_YESCRYPT:\n        {\n            uint256 thash;\n            yescrypt_hash(BEGIN(nVersion), BEGIN(thash));\n            return thash;\n        }\n        case ALGO_HMQ1725:\n        {\n            uint32_t default_nonce = (uint32_t)nNonce.GetUint64(0);\n            return HMQ1725(BEGIN(nVersion), END(default_nonce));\n        }\n    }\n    return GetHash();\n}\n\nstd::string CBlock::ToString() const\n{\n    std::stringstream s;\n    s << strprintf(\"CBlock(hash=%s, ver=0x%08x, powalgo=%u, powalgoname=%s, powhash=%s, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%s, vtx=%u)\\n\",\n        GetHash().ToString(),\n        nVersion,\n        GetAlgo(),\n        GetAlgoName(GetAlgo()),\n        GetPoWHash(GetAlgo()).ToString(),\n        hashPrevBlock.ToString(),\n        hashMerkleRoot.ToString(),\n        nTime, nBits, nNonce.GetHex(),\n        vtx.size());\n    for (const auto& tx : vtx) {\n        s << \"  \" << tx->ToString() << \"\\n\";\n    }\n    return s.str();\n}\n\nstd::string GetAlgoName(int Algo)\n{\n    switch (Algo)\n    {\n        case ALGO_SHA256D:\n            return std::string(\"sha256d\");\n        case ALGO_SCRYPT:\n            return std::string(\"scrypt\");\n        case ALGO_X11:\n            return std::string(\"x11\");\n        case ALGO_NEOSCRYPT:\n            return std::string(\"neoscrypt\");\n        case ALGO_YESCRYPT:\n            return std::string(\"yescrypt\");\n        case ALGO_EQUIHASH:\n            return std::string(\"equihash\");\n\tcase ALGO_HMQ1725:\n            return std::string(\"hmq1725\");\n    }\n    return std::string(\"unknown\");       \n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Test.h\"\n#include \"SkRandom.h\"\n#include \"SkRefCnt.h\"\n#include \"SkTSearch.h\"\n#include \"SkTSort.h\"\n#include \"SkUtils.h\"\n\nclass RefClass : public SkRefCnt {\npublic:\n    RefClass(int n) : fN(n) {}\n    int get() const { return fN; }\n\nprivate:\n    int fN;\n};\n\nstatic void test_refptr(skiatest::Reporter* reporter) {\n    RefClass* r0 = new RefClass(0);\n\n    SkRefPtr<RefClass> rc0;\n    REPORTER_ASSERT(reporter, rc0.get() == NULL);\n    REPORTER_ASSERT(reporter, !rc0);\n\n    SkRefPtr<RefClass> rc1;\n    REPORTER_ASSERT(reporter, rc0 == rc1);\n    REPORTER_ASSERT(reporter, rc0.get() != r0);\n\n    rc0 = r0;\n    REPORTER_ASSERT(reporter, rc0);\n    REPORTER_ASSERT(reporter, rc0 != rc1);\n    REPORTER_ASSERT(reporter, rc0.get() == r0);\n\n    rc1 = rc0;\n    REPORTER_ASSERT(reporter, rc1);\n    REPORTER_ASSERT(reporter, rc0 == rc1);\n    REPORTER_ASSERT(reporter, rc0.get() == r0);\n\n    rc0 = NULL;\n    REPORTER_ASSERT(reporter, rc0.get() == NULL);\n    REPORTER_ASSERT(reporter, !rc0);\n    REPORTER_ASSERT(reporter, rc0 != rc1);\n\n    r0->unref();\n}\n\nstatic void test_autounref(skiatest::Reporter* reporter) {\n    RefClass obj(0);\n    REPORTER_ASSERT(reporter, 1 == obj.getRefCnt());\n\n    SkAutoTUnref<RefClass> tmp(&obj);\n    REPORTER_ASSERT(reporter, &obj == tmp.get());\n    REPORTER_ASSERT(reporter, 1 == obj.getRefCnt());\n\n    REPORTER_ASSERT(reporter, &obj == tmp.detach());\n    REPORTER_ASSERT(reporter, 1 == obj.getRefCnt());\n    REPORTER_ASSERT(reporter, NULL == tmp.detach());\n    REPORTER_ASSERT(reporter, NULL == tmp.get());\n\n    obj.ref();\n    REPORTER_ASSERT(reporter, 2 == obj.getRefCnt());\n    {\n        SkAutoTUnref<RefClass> tmp2(&obj);\n    }\n    REPORTER_ASSERT(reporter, 1 == obj.getRefCnt());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define kSEARCH_COUNT   91\n\nstatic void test_search(skiatest::Reporter* reporter) {\n    int         i, array[kSEARCH_COUNT];\n    SkRandom    rand;\n\n    for (i = 0; i < kSEARCH_COUNT; i++) {\n        array[i] = rand.nextS();\n    }\n\n    SkTHeapSort<int>(array, kSEARCH_COUNT);\n    \/\/ make sure we got sorted properly\n    for (i = 1; i < kSEARCH_COUNT; i++) {\n        REPORTER_ASSERT(reporter, array[i-1] <= array[i]);\n    }\n\n    \/\/ make sure we can find all of our values\n    for (i = 0; i < kSEARCH_COUNT; i++) {\n        int index = SkTSearch<int>(array, kSEARCH_COUNT, array[i], sizeof(int));\n        REPORTER_ASSERT(reporter, index == i);\n    }\n\n    \/\/ make sure that random values are either found, or the correct\n    \/\/ insertion index is returned\n    for (i = 0; i < 10000; i++) {\n        int value = rand.nextS();\n        int index = SkTSearch<int>(array, kSEARCH_COUNT, value, sizeof(int));\n\n        if (index >= 0) {\n            REPORTER_ASSERT(reporter,\n                            index < kSEARCH_COUNT && array[index] == value);\n        } else {\n            index = ~index;\n            REPORTER_ASSERT(reporter, index <= kSEARCH_COUNT);\n            if (index < kSEARCH_COUNT) {\n                REPORTER_ASSERT(reporter, value < array[index]);\n                if (index > 0) {\n                    REPORTER_ASSERT(reporter, value > array[index - 1]);\n                }\n            } else {\n                \/\/ we should append the new value\n                REPORTER_ASSERT(reporter, value > array[kSEARCH_COUNT - 1]);\n            }\n        }\n    }\n}\n\nstatic void test_utf16(skiatest::Reporter* reporter) {\n    static const SkUnichar gUni[] = {\n        0x10000, 0x18080, 0x20202, 0xFFFFF, 0x101234\n    };\n\n    uint16_t buf[2];\n\n    for (size_t i = 0; i < SK_ARRAY_COUNT(gUni); i++) {\n        size_t count = SkUTF16_FromUnichar(gUni[i], buf);\n        REPORTER_ASSERT(reporter, count == 2);\n        size_t count2 = SkUTF16_CountUnichars(buf, 2);\n        REPORTER_ASSERT(reporter, count2 == 1);\n        const uint16_t* ptr = buf;\n        SkUnichar c = SkUTF16_NextUnichar(&ptr);\n        REPORTER_ASSERT(reporter, c == gUni[i]);\n        REPORTER_ASSERT(reporter, ptr - buf == 2);\n    }\n}\n\nstatic void TestUTF(skiatest::Reporter* reporter) {\n    static const struct {\n        const char* fUtf8;\n        SkUnichar   fUni;\n    } gTest[] = {\n        { \"a\",                  'a' },\n        { \"\\x7f\",               0x7f },\n        { \"\\xC2\\x80\",           0x80 },\n        { \"\\xC3\\x83\",           (3 << 6) | 3    },\n        { \"\\xDF\\xBF\",           0x7ff },\n        { \"\\xE0\\xA0\\x80\",       0x800 },\n        { \"\\xE0\\xB0\\xB8\",       0xC38 },\n        { \"\\xE3\\x83\\x83\",       (3 << 12) | (3 << 6) | 3    },\n        { \"\\xEF\\xBF\\xBF\",       0xFFFF },\n        { \"\\xF0\\x90\\x80\\x80\",   0x10000 },\n        { \"\\xF3\\x83\\x83\\x83\",   (3 << 18) | (3 << 12) | (3 << 6) | 3    }\n    };\n\n    for (size_t i = 0; i < SK_ARRAY_COUNT(gTest); i++) {\n        const char* p = gTest[i].fUtf8;\n        int         n = SkUTF8_CountUnichars(p);\n        SkUnichar   u0 = SkUTF8_ToUnichar(gTest[i].fUtf8);\n        SkUnichar   u1 = SkUTF8_NextUnichar(&p);\n\n        REPORTER_ASSERT(reporter, n == 1);\n        REPORTER_ASSERT(reporter, u0 == u1);\n        REPORTER_ASSERT(reporter, u0 == gTest[i].fUni);\n        REPORTER_ASSERT(reporter,\n                        p - gTest[i].fUtf8 == (int)strlen(gTest[i].fUtf8));\n    }\n\n    test_utf16(reporter);\n    test_search(reporter);\n    test_refptr(reporter);\n    test_autounref(reporter);\n}\n\n#include \"TestClassDef.h\"\nDEFINE_TESTCLASS(\"Utils\", UtfTestClass, TestUTF)\n<commit_msg>Another comment-only change to test notifications<commit_after>#include \"Test.h\"\n#include \"SkRandom.h\"\n#include \"SkRefCnt.h\"\n#include \"SkTSearch.h\"\n#include \"SkTSort.h\"\n#include \"SkUtils.h\"\n\nclass RefClass : public SkRefCnt {\npublic:\n    RefClass(int n) : fN(n) {}\n    int get() const { return fN; }\n\nprivate:\n    int fN;\n};\n\nstatic void test_refptr(skiatest::Reporter* reporter) {\n    RefClass* r0 = new RefClass(0);\n\n    SkRefPtr<RefClass> rc0;\n    REPORTER_ASSERT(reporter, rc0.get() == NULL);\n    REPORTER_ASSERT(reporter, !rc0);\n\n    SkRefPtr<RefClass> rc1;\n    REPORTER_ASSERT(reporter, rc0 == rc1);\n    REPORTER_ASSERT(reporter, rc0.get() != r0);\n\n    rc0 = r0;\n    REPORTER_ASSERT(reporter, rc0);\n    REPORTER_ASSERT(reporter, rc0 != rc1);\n    REPORTER_ASSERT(reporter, rc0.get() == r0);\n\n    rc1 = rc0;\n    REPORTER_ASSERT(reporter, rc1);\n    REPORTER_ASSERT(reporter, rc0 == rc1);\n    REPORTER_ASSERT(reporter, rc0.get() == r0);\n\n    rc0 = NULL;\n    REPORTER_ASSERT(reporter, rc0.get() == NULL);\n    REPORTER_ASSERT(reporter, !rc0);\n    REPORTER_ASSERT(reporter, rc0 != rc1);\n\n    r0->unref();\n}\n\nstatic void test_autounref(skiatest::Reporter* reporter) {\n    RefClass obj(0);\n    REPORTER_ASSERT(reporter, 1 == obj.getRefCnt());\n\n    SkAutoTUnref<RefClass> tmp(&obj);\n    REPORTER_ASSERT(reporter, &obj == tmp.get());\n    REPORTER_ASSERT(reporter, 1 == obj.getRefCnt());\n\n    REPORTER_ASSERT(reporter, &obj == tmp.detach());\n    REPORTER_ASSERT(reporter, 1 == obj.getRefCnt());\n    REPORTER_ASSERT(reporter, NULL == tmp.detach());\n    REPORTER_ASSERT(reporter, NULL == tmp.get());\n\n    obj.ref();\n    REPORTER_ASSERT(reporter, 2 == obj.getRefCnt());\n    {\n        SkAutoTUnref<RefClass> tmp2(&obj);\n    }\n    REPORTER_ASSERT(reporter, 1 == obj.getRefCnt());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define kSEARCH_COUNT   91\n\nstatic void test_search(skiatest::Reporter* reporter) {\n    int         i, array[kSEARCH_COUNT];\n    SkRandom    rand;\n\n    for (i = 0; i < kSEARCH_COUNT; i++) {\n        array[i] = rand.nextS();\n    }\n\n    SkTHeapSort<int>(array, kSEARCH_COUNT);\n    \/\/ make sure we got sorted properly\n    for (i = 1; i < kSEARCH_COUNT; i++) {\n        REPORTER_ASSERT(reporter, array[i-1] <= array[i]);\n    }\n\n    \/\/ make sure we can find all of our values\n    for (i = 0; i < kSEARCH_COUNT; i++) {\n        int index = SkTSearch<int>(array, kSEARCH_COUNT, array[i], sizeof(int));\n        REPORTER_ASSERT(reporter, index == i);\n    }\n\n    \/\/ make sure that random values are either found, or the correct\n    \/\/ insertion index is returned\n    for (i = 0; i < 10000; i++) {\n        int value = rand.nextS();\n        int index = SkTSearch<int>(array, kSEARCH_COUNT, value, sizeof(int));\n\n        if (index >= 0) {\n            REPORTER_ASSERT(reporter,\n                            index < kSEARCH_COUNT && array[index] == value);\n        } else {\n            index = ~index;\n            REPORTER_ASSERT(reporter, index <= kSEARCH_COUNT);\n            if (index < kSEARCH_COUNT) {\n                REPORTER_ASSERT(reporter, value < array[index]);\n                if (index > 0) {\n                    REPORTER_ASSERT(reporter, value > array[index - 1]);\n                }\n            } else {\n                \/\/ we should append the new value\n                REPORTER_ASSERT(reporter, value > array[kSEARCH_COUNT - 1]);\n            }\n        }\n    }\n}\n\nstatic void test_utf16(skiatest::Reporter* reporter) {\n    static const SkUnichar gUni[] = {\n        0x10000, 0x18080, 0x20202, 0xFFFFF, 0x101234\n    };\n\n    uint16_t buf[2];\n\n    for (size_t i = 0; i < SK_ARRAY_COUNT(gUni); i++) {\n        size_t count = SkUTF16_FromUnichar(gUni[i], buf);\n        REPORTER_ASSERT(reporter, count == 2);\n        size_t count2 = SkUTF16_CountUnichars(buf, 2);\n        REPORTER_ASSERT(reporter, count2 == 1);\n        const uint16_t* ptr = buf;\n        SkUnichar c = SkUTF16_NextUnichar(&ptr);\n        REPORTER_ASSERT(reporter, c == gUni[i]);\n        REPORTER_ASSERT(reporter, ptr - buf == 2);\n    }\n}\n\nstatic void TestUTF(skiatest::Reporter* reporter) {\n    static const struct {\n        const char* fUtf8;\n        SkUnichar   fUni;\n    } gTest[] = {\n        { \"a\",                  'a' },\n        { \"\\x7f\",               0x7f },\n        { \"\\xC2\\x80\",           0x80 },\n        { \"\\xC3\\x83\",           (3 << 6) | 3    },\n        { \"\\xDF\\xBF\",           0x7ff },\n        { \"\\xE0\\xA0\\x80\",       0x800 },\n        { \"\\xE0\\xB0\\xB8\",       0xC38 },\n        { \"\\xE3\\x83\\x83\",       (3 << 12) | (3 << 6) | 3    },\n        { \"\\xEF\\xBF\\xBF\",       0xFFFF },\n        { \"\\xF0\\x90\\x80\\x80\",   0x10000 },\n        { \"\\xF3\\x83\\x83\\x83\",   (3 << 18) | (3 << 12) | (3 << 6) | 3    }\n    };\n\n    for (size_t i = 0; i < SK_ARRAY_COUNT(gTest); i++) {\n        const char* p = gTest[i].fUtf8;\n        int         n = SkUTF8_CountUnichars(p);\n        SkUnichar   u0 = SkUTF8_ToUnichar(gTest[i].fUtf8);\n        SkUnichar   u1 = SkUTF8_NextUnichar(&p);\n\n        REPORTER_ASSERT(reporter, n == 1);\n        REPORTER_ASSERT(reporter, u0 == u1);\n        REPORTER_ASSERT(reporter, u0 == gTest[i].fUni);\n        REPORTER_ASSERT(reporter,\n                        p - gTest[i].fUtf8 == (int)strlen(gTest[i].fUtf8));\n    }\n\n    test_utf16(reporter);\n    test_search(reporter);\n    test_refptr(reporter);\n    test_autounref(reporter);\n}\n\n#include \"TestClassDef.h\"\nDEFINE_TESTCLASS(\"Utils\", UtfTestClass, TestUTF)\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of Ingen.\n * Copyright (C) 2007 Dave 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 \"LV2Node.hpp\"\n#include <iostream>\n#include <cassert>\n#include <float.h>\n#include <stdint.h>\n#include <cmath>\n#include \"InputPort.hpp\"\n#include \"OutputPort.hpp\"\n#include \"Plugin.hpp\"\n#include \"AudioBuffer.hpp\"\n#include \"MidiBuffer.hpp\"\n#include \"OSCBuffer.hpp\"\n\nnamespace Ingen {\n\n\n\/** Partially construct a LV2Node.\n *\n * Object is not usable until instantiate() is called with success.\n * (It _will_ crash!)\n *\/\nLV2Node::LV2Node(const Plugin*      plugin,\n                 const string&      name,\n                 uint32_t           poly,\n                 Patch*             parent,\n                 SampleRate         srate,\n                 size_t             buffer_size)\n: NodeBase(plugin, name, poly, parent, srate, buffer_size),\n  _lv2_plugin(plugin->slv2_plugin()),\n  _instances(NULL)\n{\n\tassert(_lv2_plugin);\n}\n\n\n\/** Instantiate self from LV2 plugin descriptor.\n *\n * Implemented as a seperate function (rather than in the constructor) to\n * allow graceful error-catching of broken plugins.\n * \n * Returns whether or not plugin was successfully instantiated.  If return\n * value is false, this object may not be used.\n *\/\nbool\nLV2Node::instantiate()\n{\n\tuint32_t num_ports = slv2_plugin_get_num_ports(_lv2_plugin);\n\tassert(num_ports > 0);\n\n\t_ports = new Raul::Array<Port*>(num_ports);\n\t\n\t_instances = new SLV2Instance[_poly];\n\t\n\tuint32_t port_buffer_size = 0;\n\t\n\tfor (uint32_t i=0; i < _poly; ++i) {\n\t\t_instances[i] = slv2_plugin_instantiate(_lv2_plugin, _srate, NULL);\n\t\tif (_instances[i] == NULL) {\n\t\t\tcerr << \"Failed to instantiate plugin!\" << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tstring port_name;\n\tstring port_path;\n\t\n\tPort* port = NULL;\n\t\n\tfor (uint32_t j=0; j < num_ports; ++j) {\n\t\tSLV2Port id = slv2_plugin_get_port_by_index(_lv2_plugin, j);\n\n\t\t\/\/ LV2 shortnames are guaranteed to be unique, valid C identifiers\n\t\tport_name = (char*)slv2_port_get_symbol(_lv2_plugin, id);\n\t\n\t\tassert(port_name.find(\"\/\") == string::npos);\n\n\t\tport_path = path() + \"\/\" + port_name;\n\t\t\n\t\tSLV2PortDirection port_direction = slv2_port_get_direction(_lv2_plugin, id);\n\t\tSLV2PortType      port_type      = slv2_port_get_type(_lv2_plugin, id);\n\n\t\t\/\/ FIXME: MIDI\/OSC buffer size?\n\t\tif (port_type != SLV2_PORT_TYPE_CONTROL)\n\t\t\tport_buffer_size = _buffer_size;\n\t\telse\n\t\t\tport_buffer_size = 1;\n\t\t\n\t\tDataType data_type = DataType::UNKNOWN;\n\t\tswitch (port_type) {\n\t\tcase SLV2_PORT_TYPE_CONTROL:\n\t\tcase SLV2_PORT_TYPE_AUDIO:\n\t\t\tdata_type = DataType::FLOAT; break;\n\t\tcase SLV2_PORT_TYPE_MIDI:\n\t\t\tdata_type = DataType::MIDI; break;\n\t\tcase SLV2_PORT_TYPE_OSC:\n\t\t\tdata_type = DataType::OSC;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\n\t\tif (data_type == DataType::UNKNOWN || port_direction == SLV2_PORT_DIRECTION_UNKNOWN) {\n\t\t\tdelete _ports;\n\t\t\t_ports = NULL;\n\t\t\tdelete _instances;\n\t\t\t_instances = NULL;\n\t\t\treturn false;\n\t\t}\n\n\t\tbool is_input = (port_direction == SLV2_PORT_DIRECTION_INPUT);\n\n\t\tif (is_input)\n\t\t\tport = new InputPort(this, port_name, j, _poly, data_type, port_buffer_size);\n\t\telse\n\t\t\tport = new OutputPort(this, port_name, j, _poly, data_type, port_buffer_size);\n\n\t\tif (is_input && port_type == SLV2_PORT_TYPE_CONTROL)\n\t\t\t((AudioBuffer*)port->buffer(0))->set(slv2_port_get_default_value(_lv2_plugin, id), 0);\n\n\t\t_ports->at(j) = port;\n\t}\n\treturn true;\n}\n\n\nLV2Node::~LV2Node()\n{\n\tfor (uint32_t i=0; i < _poly; ++i)\n\t\tslv2_instance_free(_instances[i]);\n\n\tdelete[] _instances;\n}\n\n\nvoid\nLV2Node::activate()\n{\n\tNodeBase::activate();\n\n\tfor (uint32_t i=0; i < _poly; ++i) {\n\t\tfor (unsigned long j=0; j < num_ports(); ++j) {\n\t\t\tPort* const port = _ports->at(j);\n\t\t\tset_port_buffer(i, j, port->buffer(i));\n\t\t\tif (port->type() == DataType::FLOAT && port->buffer_size() == 1) {\n\t\t\t\t((AudioBuffer*)port->buffer(i))->set(\n\t\t\t\t\tslv2_port_get_default_value(_lv2_plugin,\n\t\t\t\t\t\t\tslv2_plugin_get_port_by_index(_lv2_plugin, j)),\n\t\t\t\t\t0);\n\t\t\t} else if (port->type() == DataType::FLOAT) {\n\t\t\t\t((AudioBuffer*)port->buffer(i))->set(0.0f, 0);\n\t\t\t}\n\t\t}\n\t\tslv2_instance_activate(_instances[i]);\n\t}\n}\n\n\nvoid\nLV2Node::deactivate()\n{\n\tNodeBase::deactivate();\n\t\n\tfor (uint32_t i=0; i < _poly; ++i)\n\t\tslv2_instance_deactivate(_instances[i]);\n}\n\n\nvoid\nLV2Node::process(SampleCount nframes, FrameTime start, FrameTime end)\n{\n\tNodeBase::pre_process(nframes, start, end);\n\n\tfor (uint32_t i=0; i < _poly; ++i) \n\t\tslv2_instance_run(_instances[i], nframes);\n\t\n\tNodeBase::post_process(nframes, start, end);\n}\n\n\nvoid\nLV2Node::set_port_buffer(uint32_t voice, uint32_t port_num, Buffer* buf)\n{\n\tassert(voice < _poly);\n\t\n\tif (buf->type() == DataType::FLOAT) {\n\t\tslv2_instance_connect_port(_instances[voice], port_num, ((AudioBuffer*)buf)->data());\n\t} else if (buf->type() == DataType::MIDI) { \n\t\tslv2_instance_connect_port(_instances[voice], port_num, ((MidiBuffer*)buf)->data());\n\t} else if (buf->type() == DataType::OSC) { \n\t\tslv2_instance_connect_port(_instances[voice], port_num, ((OSCBuffer*)buf)->data());\n\t}\n}\n\n\n#if 0\n\/\/ Based on code stolen from jack-rack\nvoid\nLV2Node::get_port_vals(ulong port_index, PortInfo* info)\n{\n\tLV2_Data upper = 0.0f;\n\tLV2_Data lower = 0.0f;\n\tLV2_Data normal = 0.0f;\n\tLV2_PortRangeHintDescriptor hint_descriptor = _descriptor->PortRangeHints[port_index].HintDescriptor;\n\n\t\/* set upper and lower, possibly adjusted to the sample rate *\/\n\tif (LV2_IS_HINT_SAMPLE_RATE(hint_descriptor)) {\n\t\tupper = _descriptor->PortRangeHints[port_index].UpperBound * _srate;\n\t\tlower = _descriptor->PortRangeHints[port_index].LowerBound * _srate;\n\t} else {\n\t\tupper = _descriptor->PortRangeHints[port_index].UpperBound;\n\t\tlower = _descriptor->PortRangeHints[port_index].LowerBound;\n\t}\n\n\tif (LV2_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\/* FLT_EPSILON is defined as the different between 1.0 and the minimum\n\t\t * float greater than 1.0.  So, if lower is < FLT_EPSILON, it will be 1.0\n\t\t * and the logarithmic control will have a base of 1 and thus not change\n\t\t *\/\n\t\tif (lower < FLT_EPSILON) lower = FLT_EPSILON;\n\t}\n\n\n\tif (LV2_IS_HINT_HAS_DEFAULT(hint_descriptor)) {\n\n\t\tif (LV2_IS_HINT_DEFAULT_MINIMUM(hint_descriptor)) {\n\t\t\tnormal = lower;\n\t\t} else if (LV2_IS_HINT_DEFAULT_LOW(hint_descriptor)) {\n\t\t\tif (LV2_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower) * 0.75 + log(upper) * 0.25);\n\t\t\t} else {\n\t\t\t\tnormal = lower * 0.75 + upper * 0.25;\n\t\t\t}\n\t\t} else if (LV2_IS_HINT_DEFAULT_MIDDLE(hint_descriptor)) {\n\t\t\tif (LV2_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower) * 0.5 + log(upper) * 0.5);\n\t\t\t} else {\n\t\t\t\tnormal = lower * 0.5 + upper * 0.5;\n\t\t\t}\n\t\t} else if (LV2_IS_HINT_DEFAULT_HIGH(hint_descriptor)) {\n\t\t\tif (LV2_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower) * 0.25 + log(upper) * 0.75);\n\t\t\t} else {\n\t\t\t\tnormal = lower * 0.25 + upper * 0.75;\n\t\t\t}\n\t\t} else if (LV2_IS_HINT_DEFAULT_MAXIMUM(hint_descriptor)) {\n\t\t\tnormal = upper;\n\t\t} else if (LV2_IS_HINT_DEFAULT_0(hint_descriptor)) {\n\t\t\tnormal = 0.0;\n\t\t} else if (LV2_IS_HINT_DEFAULT_1(hint_descriptor)) {\n\t\t\tnormal = 1.0;\n\t\t} else if (LV2_IS_HINT_DEFAULT_100(hint_descriptor)) {\n\t\t\tnormal = 100.0;\n\t\t} else if (LV2_IS_HINT_DEFAULT_440(hint_descriptor)) {\n\t\t\tnormal = 440.0;\n\t\t}\n\t} else {  \/\/ No default hint\n\t\tif (LV2_IS_HINT_BOUNDED_BELOW(hint_descriptor)) {\n\t\t\tnormal = lower;\n\t\t} else if (LV2_IS_HINT_BOUNDED_ABOVE(hint_descriptor)) {\n\t\t\tnormal = upper;\n\t\t}\n\t}\n\n\tinfo->min_val(lower);\n\tinfo->default_val(normal);\n\tinfo->max_val(upper);\n}\n#endif\n\n\n} \/\/ namespace Ingen\n\n<commit_msg>Update ingen for SLV2 changes. SLV2 0.2.0.<commit_after>\/* This file is part of Ingen.\n * Copyright (C) 2007 Dave 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 \"LV2Node.hpp\"\n#include <iostream>\n#include <cassert>\n#include <float.h>\n#include <stdint.h>\n#include <cmath>\n#include \"InputPort.hpp\"\n#include \"OutputPort.hpp\"\n#include \"Plugin.hpp\"\n#include \"AudioBuffer.hpp\"\n#include \"MidiBuffer.hpp\"\n#include \"OSCBuffer.hpp\"\n\nnamespace Ingen {\n\n\n\/** Partially construct a LV2Node.\n *\n * Object is not usable until instantiate() is called with success.\n * (It _will_ crash!)\n *\/\nLV2Node::LV2Node(const Plugin*      plugin,\n                 const string&      name,\n                 uint32_t           poly,\n                 Patch*             parent,\n                 SampleRate         srate,\n                 size_t             buffer_size)\n: NodeBase(plugin, name, poly, parent, srate, buffer_size),\n  _lv2_plugin(plugin->slv2_plugin()),\n  _instances(NULL)\n{\n\tassert(_lv2_plugin);\n}\n\n\n\/** Instantiate self from LV2 plugin descriptor.\n *\n * Implemented as a seperate function (rather than in the constructor) to\n * allow graceful error-catching of broken plugins.\n * \n * Returns whether or not plugin was successfully instantiated.  If return\n * value is false, this object may not be used.\n *\/\nbool\nLV2Node::instantiate()\n{\n\tuint32_t num_ports = slv2_plugin_get_num_ports(_lv2_plugin);\n\tassert(num_ports > 0);\n\n\t_ports = new Raul::Array<Port*>(num_ports);\n\t\n\t_instances = new SLV2Instance[_poly];\n\t\n\tuint32_t port_buffer_size = 0;\n\t\n\tfor (uint32_t i=0; i < _poly; ++i) {\n\t\t_instances[i] = slv2_plugin_instantiate(_lv2_plugin, _srate, NULL);\n\t\tif (_instances[i] == NULL) {\n\t\t\tcerr << \"Failed to instantiate plugin!\" << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tstring port_name;\n\tstring port_path;\n\t\n\tPort* port = NULL;\n\t\n\tfor (uint32_t j=0; j < num_ports; ++j) {\n\t\tSLV2Port id = slv2_plugin_get_port_by_index(_lv2_plugin, j);\n\n\t\t\/\/ LV2 shortnames are guaranteed to be unique, valid C identifiers\n\t\tport_name = (char*)slv2_port_get_symbol(_lv2_plugin, id);\n\t\n\t\tassert(port_name.find(\"\/\") == string::npos);\n\n\t\tport_path = path() + \"\/\" + port_name;\n\t\t\n\t\tSLV2PortDirection port_direction = slv2_port_get_direction(_lv2_plugin, id);\n\t\tSLV2PortDataType  port_type      = slv2_port_get_data_type(_lv2_plugin, id);\n\n\t\t\/\/ FIXME: MIDI\/OSC buffer size?\n\t\tif (port_type != SLV2_PORT_DATA_TYPE_CONTROL)\n\t\t\tport_buffer_size = _buffer_size;\n\t\telse\n\t\t\tport_buffer_size = 1;\n\t\t\n\t\tDataType data_type = DataType::UNKNOWN;\n\t\tswitch (port_type) {\n\t\tcase SLV2_PORT_DATA_TYPE_CONTROL:\n\t\tcase SLV2_PORT_DATA_TYPE_AUDIO:\n\t\t\tdata_type = DataType::FLOAT; break;\n\t\tcase SLV2_PORT_DATA_TYPE_MIDI:\n\t\t\tdata_type = DataType::MIDI; break;\n\t\tcase SLV2_PORT_DATA_TYPE_OSC:\n\t\t\tdata_type = DataType::OSC;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\n\t\tif (data_type == DataType::UNKNOWN || port_direction == SLV2_PORT_DIRECTION_UNKNOWN) {\n\t\t\tdelete _ports;\n\t\t\t_ports = NULL;\n\t\t\tdelete _instances;\n\t\t\t_instances = NULL;\n\t\t\treturn false;\n\t\t}\n\n\t\tbool is_input = (port_direction == SLV2_PORT_DIRECTION_INPUT);\n\n\t\tif (is_input)\n\t\t\tport = new InputPort(this, port_name, j, _poly, data_type, port_buffer_size);\n\t\telse\n\t\t\tport = new OutputPort(this, port_name, j, _poly, data_type, port_buffer_size);\n\n\t\tif (is_input && port_type == SLV2_PORT_DATA_TYPE_CONTROL)\n\t\t\t((AudioBuffer*)port->buffer(0))->set(slv2_port_get_default_value(_lv2_plugin, id), 0);\n\n\t\t_ports->at(j) = port;\n\t}\n\treturn true;\n}\n\n\nLV2Node::~LV2Node()\n{\n\tfor (uint32_t i=0; i < _poly; ++i)\n\t\tslv2_instance_free(_instances[i]);\n\n\tdelete[] _instances;\n}\n\n\nvoid\nLV2Node::activate()\n{\n\tNodeBase::activate();\n\n\tfor (uint32_t i=0; i < _poly; ++i) {\n\t\tfor (unsigned long j=0; j < num_ports(); ++j) {\n\t\t\tPort* const port = _ports->at(j);\n\t\t\tset_port_buffer(i, j, port->buffer(i));\n\t\t\tif (port->type() == DataType::FLOAT && port->buffer_size() == 1) {\n\t\t\t\t((AudioBuffer*)port->buffer(i))->set(\n\t\t\t\t\tslv2_port_get_default_value(_lv2_plugin,\n\t\t\t\t\t\t\tslv2_plugin_get_port_by_index(_lv2_plugin, j)),\n\t\t\t\t\t0);\n\t\t\t} else if (port->type() == DataType::FLOAT) {\n\t\t\t\t((AudioBuffer*)port->buffer(i))->set(0.0f, 0);\n\t\t\t}\n\t\t}\n\t\tslv2_instance_activate(_instances[i]);\n\t}\n}\n\n\nvoid\nLV2Node::deactivate()\n{\n\tNodeBase::deactivate();\n\t\n\tfor (uint32_t i=0; i < _poly; ++i)\n\t\tslv2_instance_deactivate(_instances[i]);\n}\n\n\nvoid\nLV2Node::process(SampleCount nframes, FrameTime start, FrameTime end)\n{\n\tNodeBase::pre_process(nframes, start, end);\n\n\tfor (uint32_t i=0; i < _poly; ++i) \n\t\tslv2_instance_run(_instances[i], nframes);\n\t\n\tNodeBase::post_process(nframes, start, end);\n}\n\n\nvoid\nLV2Node::set_port_buffer(uint32_t voice, uint32_t port_num, Buffer* buf)\n{\n\tassert(voice < _poly);\n\t\n\tif (buf->type() == DataType::FLOAT) {\n\t\tslv2_instance_connect_port(_instances[voice], port_num, ((AudioBuffer*)buf)->data());\n\t} else if (buf->type() == DataType::MIDI) { \n\t\tslv2_instance_connect_port(_instances[voice], port_num, ((MidiBuffer*)buf)->data());\n\t} else if (buf->type() == DataType::OSC) { \n\t\tslv2_instance_connect_port(_instances[voice], port_num, ((OSCBuffer*)buf)->data());\n\t}\n}\n\n\n#if 0\n\/\/ Based on code stolen from jack-rack\nvoid\nLV2Node::get_port_vals(ulong port_index, PortInfo* info)\n{\n\tLV2_Data upper = 0.0f;\n\tLV2_Data lower = 0.0f;\n\tLV2_Data normal = 0.0f;\n\tLV2_PortRangeHintDescriptor hint_descriptor = _descriptor->PortRangeHints[port_index].HintDescriptor;\n\n\t\/* set upper and lower, possibly adjusted to the sample rate *\/\n\tif (LV2_IS_HINT_SAMPLE_RATE(hint_descriptor)) {\n\t\tupper = _descriptor->PortRangeHints[port_index].UpperBound * _srate;\n\t\tlower = _descriptor->PortRangeHints[port_index].LowerBound * _srate;\n\t} else {\n\t\tupper = _descriptor->PortRangeHints[port_index].UpperBound;\n\t\tlower = _descriptor->PortRangeHints[port_index].LowerBound;\n\t}\n\n\tif (LV2_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\/* FLT_EPSILON is defined as the different between 1.0 and the minimum\n\t\t * float greater than 1.0.  So, if lower is < FLT_EPSILON, it will be 1.0\n\t\t * and the logarithmic control will have a base of 1 and thus not change\n\t\t *\/\n\t\tif (lower < FLT_EPSILON) lower = FLT_EPSILON;\n\t}\n\n\n\tif (LV2_IS_HINT_HAS_DEFAULT(hint_descriptor)) {\n\n\t\tif (LV2_IS_HINT_DEFAULT_MINIMUM(hint_descriptor)) {\n\t\t\tnormal = lower;\n\t\t} else if (LV2_IS_HINT_DEFAULT_LOW(hint_descriptor)) {\n\t\t\tif (LV2_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower) * 0.75 + log(upper) * 0.25);\n\t\t\t} else {\n\t\t\t\tnormal = lower * 0.75 + upper * 0.25;\n\t\t\t}\n\t\t} else if (LV2_IS_HINT_DEFAULT_MIDDLE(hint_descriptor)) {\n\t\t\tif (LV2_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower) * 0.5 + log(upper) * 0.5);\n\t\t\t} else {\n\t\t\t\tnormal = lower * 0.5 + upper * 0.5;\n\t\t\t}\n\t\t} else if (LV2_IS_HINT_DEFAULT_HIGH(hint_descriptor)) {\n\t\t\tif (LV2_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower) * 0.25 + log(upper) * 0.75);\n\t\t\t} else {\n\t\t\t\tnormal = lower * 0.25 + upper * 0.75;\n\t\t\t}\n\t\t} else if (LV2_IS_HINT_DEFAULT_MAXIMUM(hint_descriptor)) {\n\t\t\tnormal = upper;\n\t\t} else if (LV2_IS_HINT_DEFAULT_0(hint_descriptor)) {\n\t\t\tnormal = 0.0;\n\t\t} else if (LV2_IS_HINT_DEFAULT_1(hint_descriptor)) {\n\t\t\tnormal = 1.0;\n\t\t} else if (LV2_IS_HINT_DEFAULT_100(hint_descriptor)) {\n\t\t\tnormal = 100.0;\n\t\t} else if (LV2_IS_HINT_DEFAULT_440(hint_descriptor)) {\n\t\t\tnormal = 440.0;\n\t\t}\n\t} else {  \/\/ No default hint\n\t\tif (LV2_IS_HINT_BOUNDED_BELOW(hint_descriptor)) {\n\t\t\tnormal = lower;\n\t\t} else if (LV2_IS_HINT_BOUNDED_ABOVE(hint_descriptor)) {\n\t\t\tnormal = upper;\n\t\t}\n\t}\n\n\tinfo->min_val(lower);\n\tinfo->default_val(normal);\n\tinfo->max_val(upper);\n}\n#endif\n\n\n} \/\/ namespace Ingen\n\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n** Copyright (c) 2014-2015, Intel Corporation                                **\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** 3. Neither the name of the copyright holder 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** HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,    **\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED  **\n** TO, 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\/* Hans Pabst (Intel Corp.)\n******************************************************************************\/\n#if defined(LIBXSTREAM_EXPORTED) || defined(__LIBXSTREAM)\n#include \"libxstream_workitem.hpp\"\n\n#include <libxstream_begin.h>\n#include <algorithm>\n#include <cstdio>\n#if defined(LIBXSTREAM_STDFEATURES)\n# include <thread>\n# include <atomic>\n#else\n# if defined(__GNUC__)\n#   include <pthread.h>\n# else\n#   include <Windows.h>\n# endif\n#endif\n#include <libxstream_end.h>\n\n\nnamespace libxstream_workitem_internal {\n\nclass scheduler_type {\npublic:\n  typedef libxstream_workqueue::entry_type entry_type;\n\npublic:\n  scheduler_type()\n    : m_global_queue()\n    , m_stream(0)\n#if defined(LIBXSTREAM_STDFEATURES)\n    , m_thread() \/\/ do not start here\n#else\n    , m_thread(0)\n#endif\n  {}\n\n  ~scheduler_type() {\n    if (running()) {\n      \/\/ terminates the background thread\n      entry_type& entry = m_global_queue.allocate_entry();\n      delete entry.dangling();\n      entry = entry_type(&m_global_queue);\n      entry.wait();\n\n#if defined(LIBXSTREAM_STDFEATURES)\n      m_thread.detach();\n#else\n# if defined(__GNUC__)\n      pthread_detach(m_thread);\n# else\n      CloseHandle(m_thread);\n# endif\n#endif\n    }\n  }\n\npublic:\n  bool running() const {\n#if defined(LIBXSTREAM_STDFEATURES)\n    return m_thread.joinable();\n#else\n    return 0 != m_thread;\n#endif\n  }\n\n  void start() {\n    if (!running()) {\n      libxstream_lock *const lock = libxstream_lock_get(this);\n      libxstream_lock_acquire(lock);\n\n      if (!running()) {\n#if defined(LIBXSTREAM_STDFEATURES)\n        std::thread(run, this).swap(m_thread);\n#else\n# if defined(__GNUC__)\n        pthread_create(&m_thread, 0, run, this);\n# else\n        m_thread = CreateThread(0, 0, run, this, 0, 0);\n# endif\n#endif\n      }\n\n      libxstream_lock_release(lock);\n    }\n  }\n\n  entry_type& get() {\n    entry_type* result = &m_global_queue.get();\n\n    if (0 == result->item()) { \/\/ no item in global queue\n      m_stream = libxstream_stream::schedule(m_stream);\n      libxstream_workqueue* queue = m_stream ? m_stream->queue_begin() : 0;\n\n      if (0 != queue) {\n        result = &queue->get();\n\n        \/\/ item in stream-local queue is a wait-item\n        const libxstream_workitem *const item = result->item();\n        if (0 != item && 0 != (LIBXSTREAM_CALL_SYNC & item->flags())) {\n          queue = m_stream->queue_next(); \/\/ next\/other queue\n\n          while (0 != queue) {\n            entry_type& i = queue->get();\n\n            if (0 == i.item()) {\n              queue = m_stream->queue_next();\n            }\n            else {\n              result = &i;\n              queue = 0; \/\/ break\n            }\n          }\n        }\n      }\n    }\n\n    return *result;\n  }\n\n  entry_type& push(libxstream_workitem& workitem) {\n    entry_type& entry = m_global_queue.allocate_entry_mt();\n    entry.push(workitem);\n    return entry;\n  }\n\nprivate:\n#if defined(LIBXSTREAM_STDFEATURES) || defined(__GNUC__)\n  static void* run(void* scheduler)\n#else\n  static DWORD WINAPI run(_In_ LPVOID scheduler)\n#endif\n  {\n    scheduler_type& s = *static_cast<scheduler_type*>(scheduler);\n    bool continue_run = true;\n\n#if defined(LIBXSTREAM_ASYNCHOST) && (201307 <= _OPENMP)\n#   pragma omp parallel\n#   pragma omp master\n#endif\n    for (; continue_run;) {\n      scheduler_type::entry_type* entry = &s.get();\n      bool valid = entry->valid();\n      size_t cycle = 0;\n\n      while (0 == entry->item() && valid) {\n        this_thread_wait(cycle);\n        entry = &s.get();\n        valid = entry->valid();\n      }\n\n      if (valid) {\n        entry->execute();\n#if defined(LIBXSTREAM_ASYNCHOST) && (201307 <= _OPENMP)\n#       pragma omp taskwait\n#endif\n      }\n      else {\n        continue_run = false;\n      }\n\n      entry->pop();\n    }\n\n#if defined(LIBXSTREAM_STDFEATURES) || defined(__GNUC__)\n    return scheduler;\n#else\n    return EXIT_SUCCESS;\n#endif\n  }\n\nprivate:\n  libxstream_workqueue m_global_queue;\n  libxstream_stream* m_stream;\n#if defined(LIBXSTREAM_STDFEATURES)\n  std::thread m_thread;\n#elif defined(__GNUC__)\n  pthread_t m_thread;\n#else\n  HANDLE m_thread;\n#endif\n};\nstatic\/*IPO*\/ scheduler_type scheduler;\n\n} \/\/ namespace libxstream_workitem_internal\n\n\nlibxstream_workitem::libxstream_workitem(libxstream_stream* stream, int flags, size_t argc, const arg_type argv[], const char* name)\n  : m_function(0)\n  , m_stream(stream)\n  , m_flags(flags)\n  , m_thread(this_thread_id())\n#if defined(LIBXSTREAM_DEBUG)\n  , m_name(name)\n#endif\n{\n#if !defined(LIBXSTREAM_DEBUG)\n  libxstream_use_sink(name);\n#endif\n  if (2 == argc && (argv[0].signature() || argv[1].signature())) {\n    const libxstream_argument* signature = 0;\n    if (argv[1].signature()) {\n      m_function = *reinterpret_cast<const libxstream_function*>(argv + 0);\n      signature = static_cast<const libxstream_argument*>(libxstream_get_value(argv[1]).const_pointer);\n    }\n    else {\n      LIBXSTREAM_ASSERT(argv[0].signature());\n      m_function = *reinterpret_cast<const libxstream_function*>(argv + 1);\n      signature = static_cast<const libxstream_argument*>(libxstream_get_value(argv[0]).const_pointer);\n    }\n\n    size_t arity = 0;\n    if (signature) {\n      LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_get_arity(signature, &arity));\n      LIBXSTREAM_PRAGMA_LOOP_COUNT(0, LIBXSTREAM_MAX_NARGS, LIBXSTREAM_MAX_NARGS\/2)\n      for (size_t i = 0; i < arity; ++i) m_signature[i] = signature[i];\n    }\n    LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_construct(m_signature, arity, libxstream_argument::kind_invalid, 0, LIBXSTREAM_TYPE_INVALID, 0, 0));\n  }\n  else {\n    LIBXSTREAM_ASSERT(argc <= (LIBXSTREAM_MAX_NARGS));\n    for (size_t i = 0; i < argc; ++i) m_signature[i] = argv[i];\n    LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_construct(m_signature, argc, libxstream_argument::kind_invalid, 0, LIBXSTREAM_TYPE_INVALID, 0, 0));\n#if defined(LIBXSTREAM_DEBUG)\n    size_t arity = 0;\n    LIBXSTREAM_ASSERT(LIBXSTREAM_ERROR_NONE == libxstream_get_arity(m_signature, &arity) && arity == argc);\n#endif\n  }\n\n  libxstream_workitem_internal::scheduler.start();\n}\n\n\nlibxstream_workitem* libxstream_workitem::clone() const\n{\n  libxstream_workitem *const instance = virtual_clone();\n  LIBXSTREAM_ASSERT(0 != instance);\n  return instance;\n}\n\n\nvoid libxstream_workitem::operator()(libxstream_workqueue::entry_type& entry)\n{\n  virtual_run(entry);\n}\n\n\nlibxstream_workqueue::entry_type& libxstream_enqueue(libxstream_workitem& workitem)\n{\n  return libxstream_workitem_internal::scheduler.push(workitem);\n}\n\n#endif \/\/ defined(LIBXSTREAM_EXPORTED) || defined(__LIBXSTREAM)\n<commit_msg>Implemented terminated-flags in order to avoid resurrecting the background thread in case the queue already terminated.<commit_after>\/******************************************************************************\n** Copyright (c) 2014-2015, Intel Corporation                                **\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** 3. Neither the name of the copyright holder 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** HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,    **\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED  **\n** TO, 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\/* Hans Pabst (Intel Corp.)\n******************************************************************************\/\n#if defined(LIBXSTREAM_EXPORTED) || defined(__LIBXSTREAM)\n#include \"libxstream_workitem.hpp\"\n\n#include <libxstream_begin.h>\n#include <algorithm>\n#include <cstdio>\n#if defined(LIBXSTREAM_STDFEATURES)\n# include <thread>\n# include <atomic>\n#else\n# if defined(__GNUC__)\n#   include <pthread.h>\n# else\n#   include <Windows.h>\n# endif\n#endif\n#include <libxstream_end.h>\n\n\nnamespace libxstream_workitem_internal {\n\nclass scheduler_type {\npublic:\n  typedef libxstream_workqueue::entry_type entry_type;\n\npublic:\n  scheduler_type()\n    : m_global_queue()\n    , m_stream(0)\n#if defined(LIBXSTREAM_STDFEATURES)\n    , m_thread() \/\/ do not start here\n#else\n    , m_thread(0)\n#endif\n    , m_terminated(false)\n  {}\n\n  ~scheduler_type() {\n    if (running()) {\n      \/\/ terminates the background thread\n      entry_type& entry = m_global_queue.allocate_entry();\n      delete entry.dangling();\n      entry = entry_type(&m_global_queue);\n      entry.wait();\n\n      m_terminated = true;\n#if defined(LIBXSTREAM_STDFEATURES)\n      m_thread.detach();\n#else\n# if defined(__GNUC__)\n      pthread_detach(m_thread);\n# else\n      CloseHandle(m_thread);\n# endif\n#endif\n    }\n  }\n\npublic:\n  bool running() const {\n#if defined(LIBXSTREAM_STDFEATURES)\n    return m_thread.joinable();\n#else\n    return 0 != m_thread;\n#endif\n  }\n\n  void start() {\n    if (!m_terminated && !running()) {\n      libxstream_lock *const lock = libxstream_lock_get(this);\n      libxstream_lock_acquire(lock);\n\n      if (!running()) {\n#if defined(LIBXSTREAM_STDFEATURES)\n        std::thread(run, this).swap(m_thread);\n#else\n# if defined(__GNUC__)\n        pthread_create(&m_thread, 0, run, this);\n# else\n        m_thread = CreateThread(0, 0, run, this, 0, 0);\n# endif\n#endif\n      }\n\n      libxstream_lock_release(lock);\n    }\n  }\n\n  entry_type& get() {\n    entry_type* result = &m_global_queue.get();\n\n    if (0 == result->item()) { \/\/ no item in global queue\n      m_stream = libxstream_stream::schedule(m_stream);\n      libxstream_workqueue* queue = m_stream ? m_stream->queue_begin() : 0;\n\n      if (0 != queue) {\n        result = &queue->get();\n\n        \/\/ item in stream-local queue is a wait-item\n        const libxstream_workitem *const item = result->item();\n        if (0 != item && 0 != (LIBXSTREAM_CALL_SYNC & item->flags())) {\n          queue = m_stream->queue_next(); \/\/ next\/other queue\n\n          while (0 != queue) {\n            entry_type& i = queue->get();\n\n            if (0 == i.item()) {\n              queue = m_stream->queue_next();\n            }\n            else {\n              result = &i;\n              queue = 0; \/\/ break\n            }\n          }\n        }\n      }\n    }\n\n    return *result;\n  }\n\n  entry_type& push(libxstream_workitem& workitem) {\n    entry_type& entry = m_global_queue.allocate_entry_mt();\n    entry.push(workitem);\n    return entry;\n  }\n\nprivate:\n#if defined(LIBXSTREAM_STDFEATURES) || defined(__GNUC__)\n  static void* run(void* scheduler)\n#else\n  static DWORD WINAPI run(_In_ LPVOID scheduler)\n#endif\n  {\n    scheduler_type& s = *static_cast<scheduler_type*>(scheduler);\n    bool continue_run = true;\n\n#if defined(LIBXSTREAM_ASYNCHOST) && (201307 <= _OPENMP)\n#   pragma omp parallel\n#   pragma omp master\n#endif\n    for (; continue_run;) {\n      scheduler_type::entry_type* entry = &s.get();\n      bool valid = entry->valid();\n      size_t cycle = 0;\n\n      while (0 == entry->item() && valid) {\n        this_thread_wait(cycle);\n        entry = &s.get();\n        valid = entry->valid();\n      }\n\n      if (valid) {\n        entry->execute();\n#if defined(LIBXSTREAM_ASYNCHOST) && (201307 <= _OPENMP)\n#       pragma omp taskwait\n#endif\n      }\n      else {\n        continue_run = false;\n      }\n\n      entry->pop();\n    }\n\n#if defined(LIBXSTREAM_STDFEATURES) || defined(__GNUC__)\n    return scheduler;\n#else\n    return EXIT_SUCCESS;\n#endif\n  }\n\nprivate:\n  libxstream_workqueue m_global_queue;\n  libxstream_stream* m_stream;\n#if defined(LIBXSTREAM_STDFEATURES)\n  std::thread m_thread;\n#elif defined(__GNUC__)\n  pthread_t m_thread;\n#else\n  HANDLE m_thread;\n#endif\n  bool m_terminated;\n};\nstatic\/*IPO*\/ scheduler_type scheduler;\n\n} \/\/ namespace libxstream_workitem_internal\n\n\nlibxstream_workitem::libxstream_workitem(libxstream_stream* stream, int flags, size_t argc, const arg_type argv[], const char* name)\n  : m_function(0)\n  , m_stream(stream)\n  , m_flags(flags)\n  , m_thread(this_thread_id())\n#if defined(LIBXSTREAM_DEBUG)\n  , m_name(name)\n#endif\n{\n#if !defined(LIBXSTREAM_DEBUG)\n  libxstream_use_sink(name);\n#endif\n  if (2 == argc && (argv[0].signature() || argv[1].signature())) {\n    const libxstream_argument* signature = 0;\n    if (argv[1].signature()) {\n      m_function = *reinterpret_cast<const libxstream_function*>(argv + 0);\n      signature = static_cast<const libxstream_argument*>(libxstream_get_value(argv[1]).const_pointer);\n    }\n    else {\n      LIBXSTREAM_ASSERT(argv[0].signature());\n      m_function = *reinterpret_cast<const libxstream_function*>(argv + 1);\n      signature = static_cast<const libxstream_argument*>(libxstream_get_value(argv[0]).const_pointer);\n    }\n\n    size_t arity = 0;\n    if (signature) {\n      LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_get_arity(signature, &arity));\n      LIBXSTREAM_PRAGMA_LOOP_COUNT(0, LIBXSTREAM_MAX_NARGS, LIBXSTREAM_MAX_NARGS\/2)\n      for (size_t i = 0; i < arity; ++i) m_signature[i] = signature[i];\n    }\n    LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_construct(m_signature, arity, libxstream_argument::kind_invalid, 0, LIBXSTREAM_TYPE_INVALID, 0, 0));\n  }\n  else {\n    LIBXSTREAM_ASSERT(argc <= (LIBXSTREAM_MAX_NARGS));\n    for (size_t i = 0; i < argc; ++i) m_signature[i] = argv[i];\n    LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_construct(m_signature, argc, libxstream_argument::kind_invalid, 0, LIBXSTREAM_TYPE_INVALID, 0, 0));\n#if defined(LIBXSTREAM_DEBUG)\n    size_t arity = 0;\n    LIBXSTREAM_ASSERT(LIBXSTREAM_ERROR_NONE == libxstream_get_arity(m_signature, &arity) && arity == argc);\n#endif\n  }\n\n  libxstream_workitem_internal::scheduler.start();\n}\n\n\nlibxstream_workitem* libxstream_workitem::clone() const\n{\n  libxstream_workitem *const instance = virtual_clone();\n  LIBXSTREAM_ASSERT(0 != instance);\n  return instance;\n}\n\n\nvoid libxstream_workitem::operator()(libxstream_workqueue::entry_type& entry)\n{\n  virtual_run(entry);\n}\n\n\nlibxstream_workqueue::entry_type& libxstream_enqueue(libxstream_workitem& workitem)\n{\n  return libxstream_workitem_internal::scheduler.push(workitem);\n}\n\n#endif \/\/ defined(LIBXSTREAM_EXPORTED) || defined(__LIBXSTREAM)\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2014 stevehalliwell\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\n#include <ResourceManager\/ResourceManager.hpp>\n#include <ResourceManager\/BaseResource.hpp>\n#include <ResourceManager\/LuaParser.hpp>\n#include <string>\nnamespace rm\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Initialise static members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nResourceLookup ResourceManager::resources = {};\nResourceLookup ResourceManager::errorResources = {};\nResourceQueue ResourceManager::loadingQueue = {};\nResourceQueue ResourceManager::unloadQueue = {};\nResourceQueue ResourceManager::reloadQueue = {};\nbool ResourceManager::useNullForErrorRes = true;\n\nLoadCompleteCallback ResourceManager::loadCompleteCallback = nullptr;\n\n\n\nenum class LoadMode\n{\n    Queue,\n    Block,\n};\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Function definitions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\brief ResourceManager unloads this single resource and \n\/\/\/     assigns the mode for the queue.\n\/\/\/\n\/\/\/ \\param name The resource's alias\n\/\/\/\n\/\/\/ \\param mode If the resource hasn't been unloaded yet, mode determines\n\/\/\/     whether it should queue it for unloading or unload it immediately\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ResourceManager::unloadResource(const std::string& name, LoadMode mode)\n{\n    \/\/ Setting a new Resource pointer to append to &name if found\n    ResourcePtr pointer;\n\n    \/\/ Checking if resource exists in resources\n   if (resources.find(name) != resources.end())\n   {\n       \/\/ Assigns a new pointer to the key for the resource \n       pointer = resources.find(name)->second;\n\n       \/\/ If the resource has to be removed immediately\n       if(mode == LoadMode::Block)\n       {\n           \/\/ Change the status of the BaseResource \n           pointer->isLoaded = false;\n           \/\/ Unload the BaseResource\n           pointer->unload;\n       }\n       else\n       {\n           \/\/ Change the status of the BaseResource \n           pointer->isLoaded = false;\n           \/\/ Send to unloadQueue list\n           unloadQueue.push(pointer);\n       }\n    }\n    \n    \/\/ if not return\n    \/\/ is so, check mode\/\/if queue, send to queue\n    \/\/else unload now\n\n    throw(\"Not implemented\");\n    \/\/ Must appropriately set isLoaded in resource\n    return;\n   \n}\n\nvoid ResourceManager::reloadResource(const std::string& name)\n{\n    throw(\"Not implemented\");\n    \/\/ Must appropriately set isLoaded in resource\n}\n\nvoid ResourceManager::initResource(const std::string& path)\n{\n\t\/\/How do you check if a string is a valid file path? Does this even need to be checked?\n\t\/*\n\tif(path is not a valid filepath)\n\t{\n\t\treturn error?\n\t}\n\t*\/\n\t\n\tbool exists = false;\n\t\n\t\/\/Check if resource with file path already exists.\n\tfor(ResourceLookup::iterator iter = resources.begin(); iter != resources.end(); iter++)\n\t{\n\t\tif(resources[iter].second->getFilePath() == path)\n\t\t{\n\t\t\texists = true;\n\t\t}\n\t}\n\t\n\t\/\/If it does not already exist then create and add to resources.\n\tif(!exists)\n\t{\n\t\tResourcePtr res = ResourceFactory::createResource(path, \/*type?*\/);\n\t\tresources.insert({path, res});\n\t\t\n\t\t\/\/return success?\n\t}\n\telse\n\t{\n\t\t\/\/return error (already exists)?\n\t}\n}\n\nvoid ResourceManager::initPack(const std::string& path)\n{\n    \/\/How do you check if a string is a valid file path? Does this even need to be checked?\n\t\/*\n\tif(path is not a valid filepath)\n\t{\n\t\treturn error?\n\t}\n\t*\/\n\t\n\t\/\/Get a list of data from the resource pack lua table\n\tResourceDataList list = LuaParser::parsePack(path);\n\t\n\t\/\/iterate through the list and create a new resource if one does not already exist.\t\n\tfor(ResourceDataList::iterator iter = list.begin(); iter != list.end(); iter++)\n\t{\n\t\t\/\/is this supposed to call initResource()? It seems like initResource() will not set an alias as it only takes a path, whereas this function can set the alias and type returned from the luaparser.\n\t\t\/\/initResource(list[iter].path);\n\t\t\n\t\t\/\/If it does not call initResource()\n\t\tbool exists = false;\n\t\tfor(ResourceLookup::iterator iter2 = resources.begin(); iter2 != resources.end(); iter2++)\n\t\t{\n\t\t\tif(resources[iter2].second->getFilePath() == path)\n\t\t\t{\n\t\t\t\texists = true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(!exists)\n\t\t{\n\t\t\tResourcePtr res = ResourceFactory::createResource(list[iter]->path, list[iter]->type);\n\t\t\tres->SetAlias(list[iter]->alias);\n\t\t\tresources.insert({list[iter]->alias, res});\n\t\t\t\n\t\t\t\/\/return success?\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/return error (already exists)?\n\t\t}\n\t}\n}\n\nvoid ResourceManager::loadPack(const std::string& path, LoadMode mode)\n{\n    throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::unloadPack(const std::string& path, LoadMode mode)\n{\n    throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::reloadPack(const std::string& path)\n{\n    throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::switchPack(const std::string& fromPath, const std::string& toPath)\n{\n    throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::init(bool _useNullForErrorRes)\n{\n    useNullForErrorRes = _useNullForErrorRes;\n\n    if(!useNullForErrorRes)\n    {\n        \/\/ Init default resources\n        \/\/ but we don't have any yet\n    }\n}\n\nvoid ResourceManager::update()\n{\n    loadFromQueue();\n    unloadFromQueue();\n    reloadFromQueue();\n}\n\nvoid ResourceManager::cleanupUnused()\n{\n   for(ResourcePtr r : resources)\n   {\n      if(r.unique()) \n      {\n          r->setIsLoaded(false);\n          r->unload();\n      }\n   }\n}\n\n}\n\nbool ResourceManager::isLoading()\n{\n    return getNumToLoad() > 0;\n}\n\nsize_t ResourceManager::getNumToLoad()\n{\n    return loadingQueue.size();\n}\n\nResourceList ResourceManager::listAll()\n{\n    throw(\"Not implemented\");\n    return ResourceList();\n}\n\nsize_t ResourceManager::getMemUsage()\n{\n    throw(\"Not implemented\");\n\n}\n\nsize_t ResourceManager::getNumResources()\n{\n    return resources.size();\n}\n\nvoid ResourceManager::setLoadCompleteCallback(LoadCompleteCallback callback)\n{\n    loadCompleteCallback = callback;\n}\n\nvoid ResourceManager::loadFromQueue()\n{\n    throw(\"Not implemented\");\n    \/\/ Must appropriately set isLoaded in resource\n\n    \/\/ bail if queue empty\n    \/\/ load\n    \/\/ pop\n    \/\/ if queue empty call loadCompleteCallback\n}\n\nvoid ResourceManager::unloadFromQueue()\n{\n    throw(\"Not implemented\");\n    \/\/ Must appropriately set isLoaded in resource\n}\n\nvoid ResourceManager::reloadFromQueue()\n{\n    throw(\"Not implemented\");\n    \n}\n\n} \/\/ rm\n<commit_msg>Error fixed in unloadResource<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2014 stevehalliwell\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\n#include <ResourceManager\/ResourceManager.hpp>\n#include <ResourceManager\/BaseResource.hpp>\n#include <ResourceManager\/LuaParser.hpp>\n#include <string>\nnamespace rm\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Initialise static members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nResourceLookup ResourceManager::resources = {};\nResourceLookup ResourceManager::errorResources = {};\nResourceQueue ResourceManager::loadingQueue = {};\nResourceQueue ResourceManager::unloadQueue = {};\nResourceQueue ResourceManager::reloadQueue = {};\nbool ResourceManager::useNullForErrorRes = true;\n\nLoadCompleteCallback ResourceManager::loadCompleteCallback = nullptr;\n\n\n\nenum class LoadMode\n{\n    Queue,\n    Block,\n};\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Function definitions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\brief ResourceManager unloads this single resource and \n\/\/\/     assigns the mode for the queue.\n\/\/\/\n\/\/\/ \\param name The resource's alias\n\/\/\/\n\/\/\/ \\param mode If the resource hasn't been unloaded yet, mode determines\n\/\/\/     whether it should queue it for unloading or unload it immediately\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ResourceManager::unloadResource(const std::string& name, LoadMode mode)\n{\n    \/\/ Setting a new Resource pointer to append to &name if found\n    ResourcePtr pointer;\n\n    \/\/ Checking if resource exists in resources\n   if (resources.find(name) != resources.end())\n   {\n       \/\/ Assigns a new pointer to the key for the resource \n       pointer = resources.find(name)->second;\n\n       \/\/ If the resource has to be removed immediately\n       if(mode == LoadMode::Block)\n       {\n           \/\/ Change the status of the BaseResource \n           pointer->setIsLoaded(false);\n           \/\/ Unload the BaseResource\n           pointer->unload;\n       }\n       else\n       {\n           \/\/ Change the status of the BaseResource \n           pointer->setIsLoaded(false);\n           \/\/ Send to unloadQueue list\n           unloadQueue.push(pointer);\n       }\n    }\n    \n   \n    throw(\"Not implemented\");\n   \n    return;\n   \n}\n\nvoid ResourceManager::reloadResource(const std::string& name)\n{\n    throw(\"Not implemented\");\n    \/\/ Must appropriately set isLoaded in resource\n}\n\nvoid ResourceManager::initResource(const std::string& path)\n{\n\t\/\/How do you check if a string is a valid file path? Does this even need to be checked?\n\t\/*\n\tif(path is not a valid filepath)\n\t{\n\t\treturn error?\n\t}\n\t*\/\n\t\n\tbool exists = false;\n\t\n\t\/\/Check if resource with file path already exists.\n\tfor(ResourceLookup::iterator iter = resources.begin(); iter != resources.end(); iter++)\n\t{\n\t\tif(resources[iter].second->getFilePath() == path)\n\t\t{\n\t\t\texists = true;\n\t\t}\n\t}\n\t\n\t\/\/If it does not already exist then create and add to resources.\n\tif(!exists)\n\t{\n\t\tResourcePtr res = ResourceFactory::createResource(path, \/*type?*\/);\n\t\tresources.insert({path, res});\n\t\t\n\t\t\/\/return success?\n\t}\n\telse\n\t{\n\t\t\/\/return error (already exists)?\n\t}\n}\n\nvoid ResourceManager::initPack(const std::string& path)\n{\n    \/\/How do you check if a string is a valid file path? Does this even need to be checked?\n\t\/*\n\tif(path is not a valid filepath)\n\t{\n\t\treturn error?\n\t}\n\t*\/\n\t\n\t\/\/Get a list of data from the resource pack lua table\n\tResourceDataList list = LuaParser::parsePack(path);\n\t\n\t\/\/iterate through the list and create a new resource if one does not already exist.\t\n\tfor(ResourceDataList::iterator iter = list.begin(); iter != list.end(); iter++)\n\t{\n\t\t\/\/is this supposed to call initResource()? It seems like initResource() will not set an alias as it only takes a path, whereas this function can set the alias and type returned from the luaparser.\n\t\t\/\/initResource(list[iter].path);\n\t\t\n\t\t\/\/If it does not call initResource()\n\t\tbool exists = false;\n\t\tfor(ResourceLookup::iterator iter2 = resources.begin(); iter2 != resources.end(); iter2++)\n\t\t{\n\t\t\tif(resources[iter2].second->getFilePath() == path)\n\t\t\t{\n\t\t\t\texists = true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(!exists)\n\t\t{\n\t\t\tResourcePtr res = ResourceFactory::createResource(list[iter]->path, list[iter]->type);\n\t\t\tres->SetAlias(list[iter]->alias);\n\t\t\tresources.insert({list[iter]->alias, res});\n\t\t\t\n\t\t\t\/\/return success?\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/return error (already exists)?\n\t\t}\n\t}\n}\n\nvoid ResourceManager::loadPack(const std::string& path, LoadMode mode)\n{\n    throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::unloadPack(const std::string& path, LoadMode mode)\n{\n    throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::reloadPack(const std::string& path)\n{\n    throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::switchPack(const std::string& fromPath, const std::string& toPath)\n{\n    throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::init(bool _useNullForErrorRes)\n{\n    useNullForErrorRes = _useNullForErrorRes;\n\n    if(!useNullForErrorRes)\n    {\n        \/\/ Init default resources\n        \/\/ but we don't have any yet\n    }\n}\n\nvoid ResourceManager::update()\n{\n    loadFromQueue();\n    unloadFromQueue();\n    reloadFromQueue();\n}\n\nvoid ResourceManager::cleanupUnused()\n{\n   for(ResourcePtr r : resources)\n   {\n      if(r.unique()) \n      {\n          r->setIsLoaded(false);\n          r->unload();\n      }\n   }\n}\n\n}\n\nbool ResourceManager::isLoading()\n{\n    return getNumToLoad() > 0;\n}\n\nsize_t ResourceManager::getNumToLoad()\n{\n    return loadingQueue.size();\n}\n\nResourceList ResourceManager::listAll()\n{\n    throw(\"Not implemented\");\n    return ResourceList();\n}\n\nsize_t ResourceManager::getMemUsage()\n{\n    throw(\"Not implemented\");\n\n}\n\nsize_t ResourceManager::getNumResources()\n{\n    return resources.size();\n}\n\nvoid ResourceManager::setLoadCompleteCallback(LoadCompleteCallback callback)\n{\n    loadCompleteCallback = callback;\n}\n\nvoid ResourceManager::loadFromQueue()\n{\n    throw(\"Not implemented\");\n    \/\/ Must appropriately set isLoaded in resource\n\n    \/\/ bail if queue empty\n    \/\/ load\n    \/\/ pop\n    \/\/ if queue empty call loadCompleteCallback\n}\n\nvoid ResourceManager::unloadFromQueue()\n{\n    throw(\"Not implemented\");\n    \/\/ Must appropriately set isLoaded in resource\n}\n\nvoid ResourceManager::reloadFromQueue()\n{\n    throw(\"Not implemented\");\n    \n}\n\n} \/\/ rm\n<|endoftext|>"}
{"text":"<commit_before>#include \"SalomeApp_VTKSelector.h\"\n#include \"SalomeApp_DataOwner.h\"\n\n#include \"SVTK_ViewModel.h\"\n#include \"SVTK_Selector.h\"\n#include \"SVTK_ViewWindow.h\"\n#include \"SALOME_Actor.h\"\n\n#include \"SALOME_ListIteratorOfListIO.hxx\"\n\n#include \"utilities.h\"\n\n#ifdef _DEBUG_\nstatic int MYDEBUG = 1;\n#else\nstatic int MYDEBUG = 0;\n#endif\n\nSalomeApp_SVTKDataOwner\n::SalomeApp_SVTKDataOwner( const Handle(SALOME_InteractiveObject)& theIO,\n\t\t\t   const TColStd_IndexedMapOfInteger& theIds,\n\t\t\t   Selection_Mode theMode,\n\t\t\t   SALOME_Actor* theActor):\n  SalomeApp_DataOwner( theIO ),\n  mySelectionMode(theMode),\n  myActor(theActor)\n{\n  myIds = theIds; \/\/ workaround - there is no constructor copy for the container\n}\n\nSalomeApp_SVTKDataOwner\n::~SalomeApp_SVTKDataOwner()\n{\n}\n\nSALOME_Actor* \nSalomeApp_SVTKDataOwner\n::GetActor() const\n{\n  return myActor.GetPointer();\n}\n\n\nSalomeApp_VTKSelector\n::SalomeApp_VTKSelector( SVTK_Viewer* viewer, \n\t\t\t SUIT_SelectionMgr* mgr ): \n  QObject( 0 ),\n  SUIT_Selector( mgr ),\n  myViewer( viewer )\n{\n  if ( myViewer )\n    connect( myViewer, SIGNAL( selectionChanged() ), this, SLOT( onSelectionChanged() ) );\n}\n\nSalomeApp_VTKSelector\n::~SalomeApp_VTKSelector()\n{\n}\n\nSVTK_Viewer* \nSalomeApp_VTKSelector\n::viewer() const\n{\n  return myViewer;\n}\n\nQString\nSalomeApp_VTKSelector\n::type() const\n{ \n  return SVTK_Viewer::Type(); \n}\n\nvoid\nSalomeApp_VTKSelector\n::onSelectionChanged()\n{\n  selectionChanged();\n}\n\nvoid\nSalomeApp_VTKSelector\n::getSelection( SUIT_DataOwnerPtrList& aList ) const\n{\n  if(myViewer){\n    if(SUIT_ViewManager* aViewMgr = myViewer->getViewManager()){\n      if(SVTK_ViewWindow* aView = dynamic_cast<SVTK_ViewWindow*>(aViewMgr->getActiveView())){\n\tif(SVTK_Selector* aSelector = aView->GetSelector()){\n\t  Selection_Mode aMode = aSelector->SelectionMode();\n\t  const SALOME_ListIO& aListIO = aSelector->StoredIObjects();\n\t  SALOME_ListIteratorOfListIO anIter(aListIO);\n\t  for(; anIter.More(); anIter.Next()){\n\t    Handle(SALOME_InteractiveObject) anIO = anIter.Value();\n\t    if(anIO->hasEntry()){\n\t      TColStd_IndexedMapOfInteger anIds;\n\t      aSelector->GetIndex(anIO,anIds);\n\t      SALOME_Actor* anActor = aSelector->GetActor(anIO);\n\t      aList.append(new SalomeApp_SVTKDataOwner(anIO,anIds,aMode,anActor));\n\t      if(MYDEBUG) MESSAGE(\"VTKSelector::getSelection - \"<<anIO->getEntry());\n\t    }\n\t  }\n\t}\n      }\n    }\n  }\n}\n\nvoid \nSalomeApp_VTKSelector\n::setSelection( const SUIT_DataOwnerPtrList& theList )\n{\n  if(myViewer){\n    if(SUIT_ViewManager* aViewMgr = myViewer->getViewManager()){\n      if(SVTK_ViewWindow* aView = dynamic_cast<SVTK_ViewWindow*>(aViewMgr->getActiveView())){\n\tif(SVTK_Selector* aSelector = aView->GetSelector()){\n\t  SALOME_ListIO anAppendList;\n\t  const SALOME_ListIO& aStoredList = aSelector->StoredIObjects();\n\t  SUIT_DataOwnerPtrList::const_iterator anIter = theList.begin();\n\t  for(; anIter != theList.end(); ++anIter){\n\t    const SUIT_DataOwner* aDataOwner = (*anIter).get();\n\t    if(const SalomeApp_SVTKDataOwner* anOwner = dynamic_cast<const SalomeApp_SVTKDataOwner*>(aDataOwner)){\n\t      aSelector->SetSelectionMode(anOwner->GetMode());\n\t      Handle(SALOME_InteractiveObject) anIO = anOwner->IO();\n\t      aSelector->AddIObject(anIO);\n\t      anAppendList.Append(anIO);\n\t      aSelector->AddOrRemoveIndex(anIO,anOwner->GetIds(),false);\n\t      if(MYDEBUG) MESSAGE(\"VTKSelector::setSelection - SVTKDataOwner - \"<<anIO->getEntry());\n\t    }else if(const SalomeApp_DataOwner* anOwner = dynamic_cast<const SalomeApp_DataOwner*>(aDataOwner)){\n\t      Handle(SALOME_InteractiveObject) anIO = \n\t\tnew SALOME_InteractiveObject(anOwner->entry().latin1(),\"\");\n\t      aSelector->AddIObject(anIO);\n\t      anAppendList.Append(anIO);\n\t      if(MYDEBUG) MESSAGE(\"VTKSelector::setSelection - DataOwner - \"<<anIO->getEntry());\n\t    }\n\t  }\n\t  \/\/ To remove IOs, which is not selected.\n\t  QMap< QString, Handle( SALOME_InteractiveObject )> toRemove;\n\t  SALOME_ListIteratorOfListIO anIt( aStoredList );\n\t  for( ; anIt.More(); anIt.Next() )\n\t    if( !anIt.Value().IsNull() )\n\t      toRemove[ anIt.Value()->getEntry() ] = anIt.Value();\n\n\t  anIt = SALOME_ListIteratorOfListIO(anAppendList);\n\t  for( ; anIt.More(); anIt.Next() )\n\t    toRemove.remove( anIt.Value()->getEntry() );\n\n\n\/*\t  SALOME_ListIO aRemoveList;\n\t  SALOME_ListIteratorOfListIO anAppendListIter(anAppendList);\n\t  for(; anAppendListIter.More(); anAppendListIter.Next()){\n\t    Handle(SALOME_InteractiveObject) anIO = anAppendListIter.Value();\n\t    SALOME_ListIteratorOfListIO aStoredListIter(aStoredList);\n\t    for(; aStoredListIter.More(); aStoredListIter.Next()){\n\t      if(anIO->isSame(aStoredListIter.Value())){\n\t\taRemoveList.Append(anIO);\n\t      }\n\t    }\n\t  }\n\t  SALOME_ListIteratorOfListIO aRemoveListIter(aRemoveList);*\/\n\n\t  QMap< QString, Handle( SALOME_InteractiveObject )>::const_iterator RIt = toRemove.begin(),\n\t                                                                     REnd = toRemove.end();\n\t  for( ; RIt!=REnd; RIt++ )\n\t    aSelector->RemoveIObject( RIt.data() );\n\t  \n\t  aView->onSelectionChanged();\n\t}\n      }\n    }\n  }\n}\n<commit_msg>*** empty log message ***<commit_after>#include \"SalomeApp_VTKSelector.h\"\n#include \"SalomeApp_DataOwner.h\"\n\n#include \"SVTK_ViewModel.h\"\n#include \"SVTK_Selector.h\"\n#include \"SVTK_ViewWindow.h\"\n#include \"SALOME_Actor.h\"\n\n#include \"SALOME_ListIteratorOfListIO.hxx\"\n\n#include \"utilities.h\"\n\n#ifdef _DEBUG_\nstatic int MYDEBUG = 1;\n#else\nstatic int MYDEBUG = 0;\n#endif\n\nSalomeApp_SVTKDataOwner\n::SalomeApp_SVTKDataOwner( const Handle(SALOME_InteractiveObject)& theIO,\n\t\t\t   const TColStd_IndexedMapOfInteger& theIds,\n\t\t\t   Selection_Mode theMode,\n\t\t\t   SALOME_Actor* theActor):\n  SalomeApp_DataOwner( theIO ),\n  mySelectionMode(theMode),\n  myActor(theActor)\n{\n  myIds = theIds; \/\/ workaround - there is no constructor copy for the container\n}\n\nSalomeApp_SVTKDataOwner\n::~SalomeApp_SVTKDataOwner()\n{\n}\n\nSALOME_Actor* \nSalomeApp_SVTKDataOwner\n::GetActor() const\n{\n  return myActor.GetPointer();\n}\n\n\nSalomeApp_VTKSelector\n::SalomeApp_VTKSelector( SVTK_Viewer* viewer, \n\t\t\t SUIT_SelectionMgr* mgr ): \n  QObject( 0 ),\n  SUIT_Selector( mgr ),\n  myViewer( viewer )\n{\n  if ( myViewer )\n    connect( myViewer, SIGNAL( selectionChanged() ), this, SLOT( onSelectionChanged() ) );\n}\n\nSalomeApp_VTKSelector\n::~SalomeApp_VTKSelector()\n{\n}\n\nSVTK_Viewer* \nSalomeApp_VTKSelector\n::viewer() const\n{\n  return myViewer;\n}\n\nQString\nSalomeApp_VTKSelector\n::type() const\n{ \n  return SVTK_Viewer::Type(); \n}\n\nvoid\nSalomeApp_VTKSelector\n::onSelectionChanged()\n{\n  selectionChanged();\n}\n\nvoid\nSalomeApp_VTKSelector\n::getSelection( SUIT_DataOwnerPtrList& aList ) const\n{\n  if(myViewer){\n    if(SUIT_ViewManager* aViewMgr = myViewer->getViewManager()){\n      if(SVTK_ViewWindow* aView = dynamic_cast<SVTK_ViewWindow*>(aViewMgr->getActiveView())){\n\tif(SVTK_Selector* aSelector = aView->GetSelector()){\n\t  Selection_Mode aMode = aSelector->SelectionMode();\n\t  const SALOME_ListIO& aListIO = aSelector->StoredIObjects();\n\t  SALOME_ListIteratorOfListIO anIter(aListIO);\n\t  for(; anIter.More(); anIter.Next()){\n\t    Handle(SALOME_InteractiveObject) anIO = anIter.Value();\n\t    if(anIO->hasEntry()){\n\t      TColStd_IndexedMapOfInteger anIds;\n\t      aSelector->GetIndex(anIO,anIds);\n\t      SALOME_Actor* anActor = aSelector->GetActor(anIO);\n\t      aList.append(new SalomeApp_SVTKDataOwner(anIO,anIds,aMode,anActor));\n\t      if(MYDEBUG) MESSAGE(\"VTKSelector::getSelection - \"<<anIO->getEntry());\n\t    }\n\t  }\n\t}\n      }\n    }\n  }\n}\n\nvoid \nSalomeApp_VTKSelector\n::setSelection( const SUIT_DataOwnerPtrList& theList )\n{\n  if(myViewer){\n    if(SUIT_ViewManager* aViewMgr = myViewer->getViewManager()){\n      if(SVTK_ViewWindow* aView = dynamic_cast<SVTK_ViewWindow*>(aViewMgr->getActiveView())){\n\tif(SVTK_Selector* aSelector = aView->GetSelector()){\n\t  SALOME_ListIO anAppendList;\n\t  const SALOME_ListIO& aStoredList = aSelector->StoredIObjects();\n\t  SUIT_DataOwnerPtrList::const_iterator anIter = theList.begin();\n\t  for(; anIter != theList.end(); ++anIter){\n\t    const SUIT_DataOwner* aDataOwner = (*anIter).get();\n\t    if(const SalomeApp_SVTKDataOwner* anOwner = dynamic_cast<const SalomeApp_SVTKDataOwner*>(aDataOwner)){\n\t      aSelector->SetSelectionMode(anOwner->GetMode());\n\t      Handle(SALOME_InteractiveObject) anIO = anOwner->IO();\n\t      aSelector->AddIObject(anIO);\n\t      anAppendList.Append(anIO);\n\t      aSelector->AddOrRemoveIndex(anIO,anOwner->GetIds(),false);\n\t      if(MYDEBUG) MESSAGE(\"VTKSelector::setSelection - SVTKDataOwner - \"<<anIO->getEntry());\n\t    }else if(const SalomeApp_DataOwner* anOwner = dynamic_cast<const SalomeApp_DataOwner*>(aDataOwner)){\n\t      Handle(SALOME_InteractiveObject) anIO = \n\t\tnew SALOME_InteractiveObject(anOwner->entry().latin1(),\"\");\n\t      aSelector->AddIObject(anIO);\n\t      anAppendList.Append(anIO);\n\t      if(MYDEBUG) MESSAGE(\"VTKSelector::setSelection - DataOwner - \"<<anIO->getEntry());\n\t    }\n\t  }\n\t  \/\/ To remove IOs, which is not selected.\n\t  QMap< QString, Handle( SALOME_InteractiveObject )> toRemove;\n\t  SALOME_ListIteratorOfListIO anIt( aStoredList );\n\t  for( ; anIt.More(); anIt.Next() )\n\t    if( !anIt.Value().IsNull() )\n\t      toRemove[ anIt.Value()->getEntry() ] = anIt.Value();\n\n\t  anIt = SALOME_ListIteratorOfListIO(anAppendList);\n\t  for( ; anIt.More(); anIt.Next() )\n\t    toRemove.remove( anIt.Value()->getEntry() );\n\n\t  QMap< QString, Handle( SALOME_InteractiveObject )>::const_iterator RIt = toRemove.begin(),\n\t                                                                     REnd = toRemove.end();\n\t  for( ; RIt!=REnd; RIt++ )\n\t    aSelector->RemoveIObject( RIt.data() );\n\t  \n\t  aView->onSelectionChanged();\n\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-CHROMIUM file.\n\n#include \"browser\/devtools_ui.h\"\n\n#include <string>\n\n#include \"browser\/browser_context.h\"\n\n#include \"base\/memory\/ref_counted_memory.h\"\n#include \"base\/strings\/string_util.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"content\/public\/browser\/devtools_http_handler.h\"\n#include \"content\/public\/browser\/url_data_source.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n\nusing content::WebContents;\n\nnamespace brightray {\n\nnamespace {\n\nconst char kChromeUIDevToolsBundledHost[] = \"devtools\";\n\nstd::string PathWithoutParams(const std::string& path) {\n  return GURL(std::string(\"chrome-devtools:\/\/devtools\/\") + path)\n      .path().substr(1);\n}\n\nstd::string GetMimeTypeForPath(const std::string& path) {\n  std::string filename = PathWithoutParams(path);\n  if (EndsWith(filename, \".html\", false)) {\n    return \"text\/html\";\n  } else if (EndsWith(filename, \".css\", false)) {\n    return \"text\/css\";\n  } else if (EndsWith(filename, \".js\", false)) {\n    return \"application\/javascript\";\n  } else if (EndsWith(filename, \".png\", false)) {\n    return \"image\/png\";\n  } else if (EndsWith(filename, \".gif\", false)) {\n    return \"image\/gif\";\n  } else if (EndsWith(filename, \".svg\", false)) {\n    return \"image\/svg+xml\";\n  } else if (EndsWith(filename, \".manifest\", false)) {\n    return \"text\/cache-manifest\";\n  }\n  return \"text\/html\";\n}\n\nclass BundledDataSource : public content::URLDataSource {\n public:\n  BundledDataSource() {}\n\n  \/\/ content::URLDataSource implementation.\n  std::string GetSource() const override {\n    return kChromeUIDevToolsBundledHost;\n  }\n\n  void StartDataRequest(const std::string& path,\n                        int render_process_id,\n                        int render_view_id,\n                        const GotDataCallback& callback) override {\n    std::string filename = PathWithoutParams(path);\n\n    int resource_id =\n        content::DevToolsHttpHandler::GetFrontendResourceId(filename);\n\n    DLOG_IF(WARNING, resource_id == -1)\n        << \"Unable to find dev tool resource: \" << filename\n        << \". If you compiled with debug_devtools=1, try running with \"\n           \"--debug-devtools.\";\n    const ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n    scoped_refptr<base::RefCountedStaticMemory> bytes(rb.LoadDataResourceBytes(\n        resource_id));\n    callback.Run(bytes.get());\n  }\n\n  std::string GetMimeType(const std::string& path) const override {\n    return GetMimeTypeForPath(path);\n  }\n\n  bool ShouldAddContentSecurityPolicy() const override {\n    return false;\n  }\n\n  bool ShouldDenyXFrameOptions() const override {\n    return false;\n  }\n\n  bool ShouldServeMimeTypeAsContentTypeHeader() const override {\n    return true;\n  }\n\n private:\n  virtual ~BundledDataSource() {}\n  DISALLOW_COPY_AND_ASSIGN(BundledDataSource);\n};\n\n}  \/\/ namespace\n\nDevToolsUI::DevToolsUI(BrowserContext* browser_context, content::WebUI* web_ui)\n    : WebUIController(web_ui) {\n  web_ui->SetBindings(0);\n  content::URLDataSource::Add(browser_context, new BundledDataSource());\n}\n\n}  \/\/ namespace brightray\n<commit_msg>DevToolsHttpHandler::GetFrontendResourceId is removed.<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 \"browser\/devtools_ui.h\"\n\n#include <string>\n\n#include \"browser\/browser_context.h\"\n\n#include \"base\/memory\/ref_counted_memory.h\"\n#include \"base\/strings\/string_util.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"content\/public\/browser\/devtools_frontend_host.h\"\n#include \"content\/public\/browser\/url_data_source.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n\nusing content::WebContents;\n\nnamespace brightray {\n\nnamespace {\n\nconst char kChromeUIDevToolsBundledHost[] = \"devtools\";\n\nstd::string PathWithoutParams(const std::string& path) {\n  return GURL(std::string(\"chrome-devtools:\/\/devtools\/\") + path)\n      .path().substr(1);\n}\n\nstd::string GetMimeTypeForPath(const std::string& path) {\n  std::string filename = PathWithoutParams(path);\n  if (EndsWith(filename, \".html\", false)) {\n    return \"text\/html\";\n  } else if (EndsWith(filename, \".css\", false)) {\n    return \"text\/css\";\n  } else if (EndsWith(filename, \".js\", false)) {\n    return \"application\/javascript\";\n  } else if (EndsWith(filename, \".png\", false)) {\n    return \"image\/png\";\n  } else if (EndsWith(filename, \".gif\", false)) {\n    return \"image\/gif\";\n  } else if (EndsWith(filename, \".svg\", false)) {\n    return \"image\/svg+xml\";\n  } else if (EndsWith(filename, \".manifest\", false)) {\n    return \"text\/cache-manifest\";\n  }\n  return \"text\/html\";\n}\n\nclass BundledDataSource : public content::URLDataSource {\n public:\n  BundledDataSource() {}\n\n  \/\/ content::URLDataSource implementation.\n  std::string GetSource() const override {\n    return kChromeUIDevToolsBundledHost;\n  }\n\n  void StartDataRequest(const std::string& path,\n                        int render_process_id,\n                        int render_view_id,\n                        const GotDataCallback& callback) override {\n    std::string filename = PathWithoutParams(path);\n    base::StringPiece resource =\n      content::DevToolsFrontendHost::GetFrontendResource(filename);\n    scoped_refptr<base::RefCountedStaticMemory> bytes(\n        new base::RefCountedStaticMemory(resource.data(), resource.length()));\n    callback.Run(bytes.get());\n  }\n\n  std::string GetMimeType(const std::string& path) const override {\n    return GetMimeTypeForPath(path);\n  }\n\n  bool ShouldAddContentSecurityPolicy() const override {\n    return false;\n  }\n\n  bool ShouldDenyXFrameOptions() const override {\n    return false;\n  }\n\n  bool ShouldServeMimeTypeAsContentTypeHeader() const override {\n    return true;\n  }\n\n private:\n  virtual ~BundledDataSource() {}\n  DISALLOW_COPY_AND_ASSIGN(BundledDataSource);\n};\n\n}  \/\/ namespace\n\nDevToolsUI::DevToolsUI(BrowserContext* browser_context, content::WebUI* web_ui)\n    : WebUIController(web_ui) {\n  web_ui->SetBindings(0);\n  content::URLDataSource::Add(browser_context, new BundledDataSource());\n}\n\n}  \/\/ namespace brightray\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 Pierre Fourgeaud\n\/\/ Use of this source code is governed by the MIT license that can be\n\/\/ found in the LICENSE file.\n\n#include <bandit\/bandit.h>\n#include \"core\/math\/vector2.h\"\n\nusing namespace bandit;\nusing namespace snowhouse;\nusing namespace CodeHero;\n\ngo_bandit([]() {\n    describe(\"Vector2\", []() {\n        describe(\"Constructor\", []() {\n            it(\"should initialize vector with 0s if no arguments\", [] {\n                Vector2 test;\n\n                AssertThat(test.x(), Equals(0.0f));\n            });\n\n            it(\"should initialize vector with correct x and y if provided\", [] {\n                float x = 1.5f;\n                float y = 1.5f;\n                Vector2 test(x, y);\n\n                AssertThat(test.x(), Equals(x));\n                AssertThat(test.y(), Equals(y));\n            });\n        });\n\n        describe(\"::Length\", [] {\n            it(\"should compute the proper length\", [] {\n                float x = 2.0f;\n                float y = 2.0f;\n                Vector2 test(x, y);\n\n                float res = 2.8284271247461903f;\n                AssertThat(test.Length(), Equals(res));\n            });\n        });\n\n        describe(\"::Normalize\", [] {\n            it(\"should compute the normalized vector\", [] {\n                Vector2 test(1.0f, 1.0f);\n\n                float res = 0.70710678118f;\n                test.Normalize();\n                AssertThat(test.x(), Equals(res));\n                AssertThat(test.y(), Equals(res));\n            });\n        });\n    });\n});<commit_msg>Fix incomplete test<commit_after>\/\/ Copyright (c) 2017 Pierre Fourgeaud\n\/\/ Use of this source code is governed by the MIT license that can be\n\/\/ found in the LICENSE file.\n\n#include <bandit\/bandit.h>\n#include \"core\/math\/vector2.h\"\n\nusing namespace bandit;\nusing namespace snowhouse;\nusing namespace CodeHero;\n\ngo_bandit([]() {\n    describe(\"Vector2\", []() {\n        describe(\"Constructor\", []() {\n            it(\"should initialize vector with 0s if no arguments\", [] {\n                Vector2 test;\n\n                AssertThat(test.x(), Equals(0.0f));\n                AssertThat(test.y(), Equals(0.0f));\n            });\n\n            it(\"should initialize vector with correct x and y if provided\", [] {\n                float x = 1.5f;\n                float y = 1.5f;\n                Vector2 test(x, y);\n\n                AssertThat(test.x(), Equals(x));\n                AssertThat(test.y(), Equals(y));\n            });\n        });\n\n        describe(\"::Length\", [] {\n            it(\"should compute the proper length\", [] {\n                float x = 2.0f;\n                float y = 2.0f;\n                Vector2 test(x, y);\n\n                float res = 2.8284271247461903f;\n                AssertThat(test.Length(), Equals(res));\n            });\n        });\n\n        describe(\"::Normalize\", [] {\n            it(\"should compute the normalized vector\", [] {\n                Vector2 test(1.0f, 1.0f);\n\n                float res = 0.70710678118f;\n                test.Normalize();\n                AssertThat(test.x(), Equals(res));\n                AssertThat(test.y(), Equals(res));\n            });\n        });\n    });\n});<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013 GitHub, 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#include <stdlib.h>\n#include <string.h>\n\n#include \"content\/public\/app\/content_main.h\"\n\nnamespace node {\nint Start(int argc, char *argv[]);\n}\n\n#if defined(OS_WIN)\n\n#include <windows.h>  \/\/ NOLINT\n#include <shellapi.h>  \/\/ NOLINT\n\n#include \"app\/atom_main_delegate.h\"\n#include \"content\/public\/app\/startup_helper_win.h\"\n#include \"sandbox\/win\/src\/sandbox_types.h\"\n\nint APIENTRY wWinMain(HINSTANCE instance, HINSTANCE, wchar_t* cmd, int) {\n  int argc = 0;\n  wchar_t** wargv = ::CommandLineToArgvW(::GetCommandLineW(), &argc);\n  char* node_indicator = getenv(\"ATOM_SHELL_INTERNAL_RUN_AS_NODE\");\n  if (node_indicator != NULL && strcmp(node_indicator, \"1\") == 0)\n    \/\/ Convert argv to to UTF8\n    char** argv = new char*[argc];\n    for (int i = 0; i < argc; i++) {\n      \/\/ Compute the size of the required buffer\n      DWORD size = WideCharToMultiByte(CP_UTF8,\n                                       0,\n                                       wargv[i],\n                                       -1,\n                                       NULL,\n                                       0,\n                                       NULL,\n                                       NULL);\n      if (size == 0) {\n        \/\/ This should never happen.\n        fprintf(stderr, \"Could not convert arguments to utf8.\");\n        exit(1);\n      }\n      \/\/ Do the actual conversion\n      argv[i] = new char[size];\n      DWORD result = WideCharToMultiByte(CP_UTF8,\n                                         0,\n                                         wargv[i],\n                                         -1,\n                                         argv[i],\n                                         size,\n                                         NULL,\n                                         NULL);\n      if (result == 0) {\n        \/\/ This should never happen.\n        fprintf(stderr, \"Could not convert arguments to utf8.\");\n        exit(1);\n      }\n    }\n    \/\/ Now that conversion is done, we can finally start.\n    return node::Start(argc, argv);\n  }\n\n  sandbox::SandboxInterfaceInfo sandbox_info = {0};\n  content::InitializeSandboxInfo(&sandbox_info);\n  atom::AtomMainDelegate delegate;\n  return content::ContentMain(instance, &sandbox_info, &delegate);\n}\n\n#else  \/\/ defined(OS_WIN)\n\n#include \"app\/atom_library_main.h\"\n\nint main(int argc, const char* argv[]) {\n  char* node_indicator = getenv(\"ATOM_SHELL_INTERNAL_RUN_AS_NODE\");\n  if (node_indicator != NULL && strcmp(node_indicator, \"1\") == 0)\n    return node::Start(argc, const_cast<char**>(argv));\n\n  return AtomMain(argc, argv);\n}\n\n#endif\n<commit_msg>Use base::Environment to replace getenv.<commit_after>\/\/ Copyright (c) 2013 GitHub, 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#include <stdlib.h>\n#include <string.h>\n\n#include \"content\/public\/app\/content_main.h\"\n\nnamespace node {\nint Start(int argc, char *argv[]);\n}\n\n#if defined(OS_WIN)\n\n#include <windows.h>  \/\/ NOLINT\n#include <shellapi.h>  \/\/ NOLINT\n\n#include \"app\/atom_main_delegate.h\"\n#include \"base\/environment.h\"\n#include \"content\/public\/app\/startup_helper_win.h\"\n#include \"sandbox\/win\/src\/sandbox_types.h\"\n\nint APIENTRY wWinMain(HINSTANCE instance, HINSTANCE, wchar_t* cmd, int) {\n  int argc = 0;\n  wchar_t** wargv = ::CommandLineToArgvW(::GetCommandLineW(), &argc);\n\n  scoped_ptr<base::Environment> env(base::Environment::Create());\n  std::string node_indicator;\n  if (env->GetVar(\"ATOM_SHELL_INTERNAL_RUN_AS_NODE\", &node_indicator) &&\n      node_indicator == \"1\") {\n    \/\/ Convert argv to to UTF8\n    char** argv = new char*[argc];\n    for (int i = 0; i < argc; i++) {\n      \/\/ Compute the size of the required buffer\n      DWORD size = WideCharToMultiByte(CP_UTF8,\n                                       0,\n                                       wargv[i],\n                                       -1,\n                                       NULL,\n                                       0,\n                                       NULL,\n                                       NULL);\n      if (size == 0) {\n        \/\/ This should never happen.\n        fprintf(stderr, \"Could not convert arguments to utf8.\");\n        exit(1);\n      }\n      \/\/ Do the actual conversion\n      argv[i] = new char[size];\n      DWORD result = WideCharToMultiByte(CP_UTF8,\n                                         0,\n                                         wargv[i],\n                                         -1,\n                                         argv[i],\n                                         size,\n                                         NULL,\n                                         NULL);\n      if (result == 0) {\n        \/\/ This should never happen.\n        fprintf(stderr, \"Could not convert arguments to utf8.\");\n        exit(1);\n      }\n    }\n    \/\/ Now that conversion is done, we can finally start.\n    return node::Start(argc, argv);\n  }\n\n  sandbox::SandboxInterfaceInfo sandbox_info = {0};\n  content::InitializeSandboxInfo(&sandbox_info);\n  atom::AtomMainDelegate delegate;\n  return content::ContentMain(instance, &sandbox_info, &delegate);\n}\n\n#else  \/\/ defined(OS_WIN)\n\n#include \"app\/atom_library_main.h\"\n\nint main(int argc, const char* argv[]) {\n  char* node_indicator = getenv(\"ATOM_SHELL_INTERNAL_RUN_AS_NODE\");\n  if (node_indicator != NULL && strcmp(node_indicator, \"1\") == 0)\n    return node::Start(argc, const_cast<char**>(argv));\n\n  return AtomMain(argc, argv);\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\nint main()\n{\n    std::string number;\n    std::cin >> number;\n    \n    bool isPalindrome = true;\n    \n    int l = number.length();\n    \n    for (int i = 0; i < l; ++i)\n    {\n        int digit = number[i];\n        int digitFromEnd = number[l - i - 1];\n        \n        isPalindrome = (digit == digitFromEnd) && isPalindrome;\n    }\n    \n    std::cout << (isPalindrome ? \"Number is palindrome\" : \"Number is NOT palindrome\") << std::endl;\n}\n<commit_msg>is_palindrome algorithm now stops at first not equal digit<commit_after>#include <iostream>\n\nint main()\n{\n    std::string number;\n    std::cin >> number;\n    \n    bool isPalindrome = true;\n    \n    int l = number.length();\n    \n    for (int i = 0; i < l; ++i)\n    {\n        int digit = number[i];\n        int digitFromEnd = number[l - i - 1];\n        \n        isPalindrome = (digit == digitFromEnd) && isPalindrome;\n\n        if (!isPalindrome)\n            break;\n    }\n    \n    std::cout << (isPalindrome ? \"Number is palindrome\" : \"Number is NOT palindrome\") << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <atomic>\n#include <thread>\n#include <cassert>\nnamespace example_01 {  \/\/ acquire-release and relaxed orederings\n\nstd::atomic<int> data[5];\nstd::atomic<int> sync{0};\n\nvoid thread_1() {\n    data[0].store(42, std::memory_order_relaxed);\n    data[1].store(97, std::memory_order_relaxed);\n    data[2].store(17, std::memory_order_relaxed);\n    data[3].store(-141, std::memory_order_relaxed);\n    data[4].store(2003, std::memory_order_relaxed);\n    sync.store(1, std::memory_order_release);\n}\n\nvoid thread_2() {\n    int expected{1};\n    while (not sync.compare_exchange_strong(expected, 2, std::memory_order_acq_rel))\n        expected = 1;\n}\n\nvoid thread_3() {\n    while (sync.load(std::memory_order_acquire) < 2);\n    assert(42 == data[0].load(std::memory_order_relaxed));\n    assert(97 == data[1].load(std::memory_order_relaxed));\n    assert(17 == data[2].load(std::memory_order_relaxed));\n    assert(-141 == data[3].load(std::memory_order_relaxed));\n    assert(2003 == data[4].load(std::memory_order_relaxed));\n}\n\nvoid run() {\n    std::thread t1{ thread_1 }, t2{ thread_2 }, t3{ thread_3 };\n    t1.join(); t2.join(); t3.join();\n}\n\n} \/\/ example_01\n\n\n#include <iostream>\nint main() {\n    std::cout << \"example_01 => [OK]\"; example_01::run(); std::cout << std::endl << std::endl;\n\n    return 0;\n}\n<commit_msg>[a_williams-cpp_concurrency_in_action-2-ed][05] change the 13-th example<commit_after>#include <atomic>\n#include <thread>\n#include <cassert>\nnamespace example_01 { \/\/ transitive sync with acquire-release ordering\n    \nstd::atomic<int> data[5];\nstd::atomic<int> sync{0};\n    \nvoid thread_1() {\n    data[0].store(42, std::memory_order_relaxed);\n    data[1].store(97, std::memory_order_relaxed);\n    data[2].store(17, std::memory_order_relaxed);\n    data[3].store(-141, std::memory_order_relaxed);\n    data[4].store(2003, std::memory_order_relaxed);\n    sync.store(1, std::memory_order_release);\n}\n    \nvoid thread_2() {\n    int expected{1};\n    while (not sync.compare_exchange_strong(expected, 2, std::memory_order_acq_rel))\n        expected = 1;\n}\n    \nvoid thread_3() {\n    while (sync.load(std::memory_order_acquire) < 2);\n    assert(42 == data[0].load(std::memory_order_relaxed));\n    assert(97 == data[1].load(std::memory_order_relaxed));\n    assert(17 == data[2].load(std::memory_order_relaxed));\n    assert(-141 == data[3].load(std::memory_order_relaxed));\n    assert(2003 == data[4].load(std::memory_order_relaxed));\n}\n    \nvoid run() {\n    std::thread t1{ thread_1 }, t2{ thread_2 }, t3{ thread_3 };\n    t1.join(), t2.join(), t3.join();\n}    \n} \/\/ example_01\n\n#include <iostream>\nint main() {\n    std::cout << \"[ok] - example_01\" << std::endl; example_01::run(); std::cout << std::endl;\n    \n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ FILE:          SpectralInterface.cpp\r\n\/\/ PROJECT:       Micro-Manager\r\n\/\/ SUBSYSTEM:     DeviceAdapters\r\n\/\/-----------------------------------------------------------------------------\r\n\/\/ DESCRIPTION:   Interface for the Spectral LMM5\r\n\/\/\r\n\/\/ COPYRIGHT:     University of California, San Francisco, 2009\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\/\/ AUTHOR:        Nico Stuurman (nico@cmp.ucf.edu), 2\/7\/2008\r\n\/\/\r\n#include \"SpectralLMM5Interface.h\"\r\n#include \"SpectralLMM5.h\"\r\n\r\n#ifdef WIN32\r\n#include <winsock.h>\r\n#else\r\n#include <netinet\/in.h>\r\n#endif\r\n\r\nSpectralLMM5Interface::SpectralLMM5Interface(std::string port, MM::PortType portType) :\r\n   laserLinesDetected_ (false),\r\n   nrLines_ (5),\r\n   readWriteSame_(false)\r\n{\r\n   port_ = port;\r\n   portType_ = portType;\r\n   initialized_ = true;\r\n}\r\n\r\nSpectralLMM5Interface::~SpectralLMM5Interface(){};\r\n\r\n\/*\r\n * The Spectral LMM5 has a silly difference between USB and serial communication:\r\n * Commands can be sent straight to USB.  Commands to the serial port need to converted in some kind of weird ASCI:  The command \"0x1A0xFF0x000x12<CR>\" becomes \"1AFF0012<CR>\".  Presumably, the same weird conversion takes place on the way back.  We handle this translation in this function\r\n *\/\r\nint SpectralLMM5Interface::ExecuteCommand(MM::Device& device, MM::Core& core, unsigned char* buf, unsigned long bufLen, unsigned char* answer, unsigned long answerLen, unsigned long& read) \r\n{\r\n   int ret;\r\n   if (portType_ == MM::SerialPort) \r\n   {\r\n      std::string serialCommand;\r\n      char tmp[3];\r\n      tmp[2] = 0;\r\n      for (unsigned long i=0; i<bufLen; i++) {\r\n         sprintf(tmp, \"%.2x\", buf[i]);\r\n         serialCommand += tmp;\r\n      }\r\n      ret = core.SetSerialCommand(&device, port_.c_str(), serialCommand.c_str(), \"\\r\");\r\n   } else  \/\/ check for USB port\r\n   {\r\n      unsigned char c[2];\r\n      c[0]=0x01;\r\n      c[1]=0x02;\r\n      ret = core.WriteToSerial(&device, port_.c_str(), c, 2);\r\n      \/\/ret = core.WriteToSerial(&device, port_.c_str(), buf, bufLen);\r\n   }\r\n\r\n   if (ret != DEVICE_OK)  \r\n      return ret;\r\n  \r\n   if (portType_ == MM::SerialPort) \r\n   {\r\n      char strAnswer[128];\r\n      read = 0;\r\n      ret = core.GetSerialAnswer(&device, port_.c_str(), 128, strAnswer, \"\\r\");\r\n      if (ret != DEVICE_OK)\r\n         return ret;\r\n      std::ostringstream os;\r\n      os << \"LMM5 answered: \" << strAnswer << \" Port status: \" << ret;\r\n      core.LogMessage(&device, os.str().c_str(), true);\r\n      \/\/ 'translate' back into numbers:\r\n      std::string tmp = strAnswer;\r\n      for (unsigned int i=0; i < tmp.length()\/2; i++) {\r\n         char * end;\r\n         long j = strtol(tmp.substr(i*2,2).c_str(), &end, 16);\r\n         answer[i] = (unsigned char) j;\r\n         \/\/ printf(\"c:%x i:%u j:%ld\\n\", answer[i], i, j);\r\n         read++;\r\n      }\r\n   } else \/\/ TODO: check that we have a USB port\r\n   {\r\n      \/\/ The USB port will attempt to read up to answerLen characters\r\n      ret = core.ReadFromSerial(&device, port_.c_str(), answer, answerLen, read);\r\n      if (ret != DEVICE_OK)\r\n         return ret;\r\n      std::ostringstream os;\r\n      os << \"LMM5 answered: \";\r\n      for (unsigned int i=0; i < read; i++)\r\n         os << std::hex << answer[i];\r\n      os << std::endl;\r\n      core.LogMessage(&device, os.str().c_str(), true);\r\n   }\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::DetectLaserLines(MM::Device& device, MM::Core& core) {\r\n   if (laserLinesDetected_)\r\n      return DEVICE_OK;\r\n   const unsigned long bufLen = 1;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x08;\r\n   const unsigned long answerLen = 11;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   if (read < 8) {\r\n      return ERR_UNEXPECTED_ANSWER;\r\n   }\r\n\r\n   uint16_t* lineP = (uint16_t*) (answer + 1);\r\n   nrLines_ = (read-1)\/2;\r\n   printf(\"NrLines: %d\\n\", nrLines_);\r\n   for (int i=0; i<nrLines_; i++) \r\n   {\r\n      laserLines_[i].lineNr = i;\r\n      laserLines_[i].waveLength = ntohs(*(lineP+i)) \/ 10;\r\n      if (*(lineP+i) == 0) {\r\n         laserLines_[i].present = false;\r\n      } else {\r\n         laserLines_[i].present = true;\r\n         std::ostringstream os;\r\n         os << laserLines_[i].waveLength << \"nm-\" << i + 1;\r\n         laserLines_[i].name = os.str();\r\n      }\r\n      \/\/ printf (\"Line: %d %f %d %s\\n\", i, laserLines_[i].waveLength, laserLines_[i].present, laserLines_[i].name.c_str());\r\n   }\r\n   laserLinesDetected_ = true;\r\n   return DEVICE_OK;\r\n}\r\n\r\n\r\nint SpectralLMM5Interface::SetTransmission(MM::Device& device, MM::Core& core, long laserLine, double transmission) \r\n{\r\n   const unsigned long bufLen = 4;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x04;\r\n   buf[1]=(unsigned char) laserLine;\r\n   int16_t tr = (int16_t) (10*transmission);\r\n   tr = htons(tr);\r\n   memcpy(buf+2, &tr, 2);\r\n   const unsigned long answerLen = 1;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x04)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::GetTransmission(MM::Device& device, MM::Core& core, long laserLine, double& transmission) {\r\n   const unsigned long bufLen = 2;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x05;\r\n   buf[1]= (unsigned char) laserLine;\r\n   const unsigned long answerLen = 3;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   if (read < 3) {\r\n      return ERR_UNEXPECTED_ANSWER;\r\n   }\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x05) {\r\n      return ERR_UNEXPECTED_ANSWER;\r\n   }\r\n\r\n   int16_t tr = 0;\r\n   memcpy(&tr, answer + 1, 2);\r\n   tr = ntohs(tr);\r\n   transmission = tr\/10;\r\n   std::ostringstream os;\r\n   os << \"Transmission for line\" << laserLine << \" is: \" << transmission;\r\n   printf(\"%s tr: %d\\n\", os.str().c_str(), tr);\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::SetShutterState(MM::Device& device, MM::Core& core, int state)\r\n{\r\n   const unsigned long bufLen = 2;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x01;\r\n   buf[1]=(unsigned char) state;\r\n   const unsigned long answerLen = 1;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x01)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::GetShutterState(MM::Device& device, MM::Core& core, int& state)\r\n{\r\n   const unsigned long bufLen = 1;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x02;\r\n   const unsigned long answerLen = 4;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   if (read < 2) {\r\n      return ERR_UNEXPECTED_ANSWER;\r\n   }\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x02)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   state = (int) answer[1];\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::SetExposureConfig(MM::Device& device, MM::Core& core, std::string config) {\r\n   unsigned char* buf;\r\n   int length = (int) config.size()\/2;\r\n   unsigned long bufLen = length +1;\r\n   unsigned long read = 0;\r\n   buf = (unsigned char*) malloc(bufLen);\r\n   buf[0]=0x21;\r\n   for (int i=0; i<length; i++) {\r\n      char * end;\r\n      long j = strtol(config.substr(i*2,2).c_str(), &end, 16);\r\n      buf[i+1] = (unsigned char) j;\r\n   }\r\n\r\n   const unsigned long answerLen = 1;\r\n   unsigned char answer[answerLen];\r\n   printf (\"Set Exposure confign \\n\");\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x21)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::GetExposureConfig(MM::Device& device, MM::Core& core, std::string& config)\r\n{\r\n   const unsigned long bufLen = 1;\r\n   unsigned char buf[bufLen];\r\n   if (readWriteSame_)\r\n      buf[0]=0x021;\r\n   else\r\n      buf[0]=0x027;\r\n   const unsigned long answerLen = 70;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   printf (\"Detecting Exposure Config: \\n\");\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n \r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x27)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   config = \"\";\r\n   for (unsigned int i=1; i < read; i++)\r\n      config += buf[i];\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\n\r\nint SpectralLMM5Interface::SetTriggerOutConfig(MM::Device& device, MM::Core& core, unsigned char * config) \r\n{\r\n   const unsigned long bufLen = 5;\r\n   unsigned char buf[bufLen];\r\n   unsigned long read = 0;\r\n   buf[0]=0x23;\r\n   memcpy(buf + 1, config, 4);\r\n\r\n   const unsigned long answerLen = 10;\/\/1; Why does 1 cause a runtime exception? 'Stack around the variable \"answer\" was corrupted.'\r\n   unsigned char answer[answerLen];\r\n   printf (\"Set Trigger Out \\n\");\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x23)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::GetTriggerOutConfig(MM::Device& device, MM::Core& core, unsigned char * config)\r\n{\r\n   const unsigned long bufLen = 1;\r\n   unsigned char buf[bufLen];\r\n   if (readWriteSame_)\r\n      buf[0]=0x023;\r\n   else\r\n      buf[0]=0x026;\r\n   const unsigned long answerLen = 10;\/\/6;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   printf (\"Detecting Trigger out Config: \\n\");\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n \r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x23)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   memcpy(config, answer + 1, 4);\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\n\r\n<commit_msg>Made Spectral adapter work with HID ports<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ FILE:          SpectralInterface.cpp\r\n\/\/ PROJECT:       Micro-Manager\r\n\/\/ SUBSYSTEM:     DeviceAdapters\r\n\/\/-----------------------------------------------------------------------------\r\n\/\/ DESCRIPTION:   Interface for the Spectral LMM5\r\n\/\/\r\n\/\/ COPYRIGHT:     University of California, San Francisco, 2009\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\/\/ AUTHOR:        Nico Stuurman (nico@cmp.ucf.edu), 2\/7\/2008\r\n\/\/\r\n#include \"SpectralLMM5Interface.h\"\r\n#include \"SpectralLMM5.h\"\r\n\r\n#ifdef WIN32\r\n#include <winsock.h>\r\n#else\r\n#include <netinet\/in.h>\r\n#endif\r\n\r\nSpectralLMM5Interface::SpectralLMM5Interface(std::string port, MM::PortType portType) :\r\n   laserLinesDetected_ (false),\r\n   nrLines_ (5),\r\n   readWriteSame_(false)\r\n{\r\n   port_ = port;\r\n   portType_ = portType;\r\n   initialized_ = true;\r\n}\r\n\r\nSpectralLMM5Interface::~SpectralLMM5Interface(){};\r\n\r\n\/*\r\n * The Spectral LMM5 has a silly difference between USB and serial communication:\r\n * Commands can be sent straight to USB.  Commands to the serial port need to converted in some kind of weird ASCI:  The command \"0x1A0xFF0x000x12<CR>\" becomes \"1AFF0012<CR>\".  Presumably, the same weird conversion takes place on the way back.  We handle this translation in this function\r\n *\/\r\nint SpectralLMM5Interface::ExecuteCommand(MM::Device& device, MM::Core& core, unsigned char* buf, unsigned long bufLen, unsigned char* answer, unsigned long answerLen, unsigned long& read) \r\n{\r\n   int ret;\r\n   if (portType_ == MM::SerialPort) \r\n   {\r\n      std::string serialCommand;\r\n      char tmp[3];\r\n      tmp[2] = 0;\r\n      for (unsigned long i=0; i<bufLen; i++) {\r\n         sprintf(tmp, \"%.2x\", buf[i]);\r\n         serialCommand += tmp;\r\n      }\r\n      ret = core.SetSerialCommand(&device, port_.c_str(), serialCommand.c_str(), \"\\r\");\r\n   } else  \/\/ check for USB port\r\n   {\r\n      ret = core.WriteToSerial(&device, port_.c_str(), buf, bufLen);\r\n   }\r\n\r\n   if (ret != DEVICE_OK)  \r\n      return ret;\r\n  \r\n   if (portType_ == MM::SerialPort) \r\n   {\r\n      char strAnswer[128];\r\n      read = 0;\r\n      ret = core.GetSerialAnswer(&device, port_.c_str(), 128, strAnswer, \"\\r\");\r\n      if (ret != DEVICE_OK)\r\n         return ret;\r\n      \r\n      std::ostringstream os;\r\n      os << \"LMM5 answered: \" << strAnswer << \" Port status: \" << ret;\r\n      core.LogMessage(&device, os.str().c_str(), true);\r\n   \r\n      \/\/ 'translate' back into numbers:\r\n      std::string tmp = strAnswer;\r\n      for (unsigned int i=0; i < tmp.length()\/2; i++) {\r\n         char * end;\r\n         long j = strtol(tmp.substr(i*2,2).c_str(), &end, 16);\r\n         answer[i] = (unsigned char) j;\r\n         read++;\r\n      }\r\n   } else if (portType_ == MM::HIDPort) \r\n   {\r\n      \/\/ The USB port will attempt to read up to answerLen characters\r\n      ret = core.ReadFromSerial(&device, port_.c_str(), answer, answerLen, read);\r\n      if (ret != DEVICE_OK)\r\n         return ret;\r\n\r\n      \/* \r\n       \/\/ Uncomment for debugging (although port should give the same info)\r\n      std::ostringstream os;\r\n      os << \"LMM5 answered: \" << std::hex << std::setfill('0');\r\n      for (unsigned int i=0; i < read; i++)\r\n         os << std::setw(2) << (unsigned int) answer[i] << \" \";\r\n      core.LogMessage(&device, os.str().c_str(), true);\r\n      *\/\r\n   }\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::DetectLaserLines(MM::Device& device, MM::Core& core) {\r\n   if (laserLinesDetected_)\r\n      return DEVICE_OK;\r\n   const unsigned long bufLen = 1;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x08;\r\n   const unsigned long answerLen = 11;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   if (read < 8) {\r\n      return ERR_UNEXPECTED_ANSWER;\r\n   }\r\n\r\n   uint16_t* lineP = (uint16_t*) (answer + 1);\r\n   nrLines_ = (read-1)\/2;\r\n   printf(\"NrLines: %d\\n\", nrLines_);\r\n   for (int i=0; i<nrLines_; i++) \r\n   {\r\n      laserLines_[i].lineNr = i;\r\n      laserLines_[i].waveLength = ntohs(*(lineP+i)) \/ 10;\r\n      if (*(lineP+i) == 0) {\r\n         laserLines_[i].present = false;\r\n      } else {\r\n         laserLines_[i].present = true;\r\n         std::ostringstream os;\r\n         os << laserLines_[i].waveLength << \"nm-\" << i + 1;\r\n         laserLines_[i].name = os.str();\r\n      }\r\n      \/\/ printf (\"Line: %d %f %d %s\\n\", i, laserLines_[i].waveLength, laserLines_[i].present, laserLines_[i].name.c_str());\r\n   }\r\n   laserLinesDetected_ = true;\r\n   return DEVICE_OK;\r\n}\r\n\r\n\r\nint SpectralLMM5Interface::SetTransmission(MM::Device& device, MM::Core& core, long laserLine, double transmission) \r\n{\r\n   const unsigned long bufLen = 4;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x04;\r\n   buf[1]=(unsigned char) laserLine;\r\n   int16_t tr = (int16_t) (10*transmission);\r\n   tr = htons(tr);\r\n   memcpy(buf+2, &tr, 2);\r\n   const unsigned long answerLen = 1;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x04)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::GetTransmission(MM::Device& device, MM::Core& core, long laserLine, double& transmission) {\r\n   const unsigned long bufLen = 2;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x05;\r\n   buf[1]= (unsigned char) laserLine;\r\n   const unsigned long answerLen = 3;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   if (read < 3) {\r\n      return ERR_UNEXPECTED_ANSWER;\r\n   }\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x05) {\r\n      return ERR_UNEXPECTED_ANSWER;\r\n   }\r\n\r\n   int16_t tr = 0;\r\n   memcpy(&tr, answer + 1, 2);\r\n   tr = ntohs(tr);\r\n   transmission = tr\/10;\r\n   std::ostringstream os;\r\n   os << \"Transmission for line\" << laserLine << \" is: \" << transmission;\r\n   printf(\"%s tr: %d\\n\", os.str().c_str(), tr);\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::SetShutterState(MM::Device& device, MM::Core& core, int state)\r\n{\r\n   const unsigned long bufLen = 2;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x01;\r\n   buf[1]=(unsigned char) state;\r\n   const unsigned long answerLen = 1;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x01)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::GetShutterState(MM::Device& device, MM::Core& core, int& state)\r\n{\r\n   const unsigned long bufLen = 1;\r\n   unsigned char buf[bufLen];\r\n   buf[0]=0x02;\r\n   const unsigned long answerLen = 4;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   if (read < 2) {\r\n      return ERR_UNEXPECTED_ANSWER;\r\n   }\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x02)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   state = (int) answer[1];\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::SetExposureConfig(MM::Device& device, MM::Core& core, std::string config) {\r\n   unsigned char* buf;\r\n   int length = (int) config.size()\/2;\r\n   unsigned long bufLen = length +1;\r\n   unsigned long read = 0;\r\n   buf = (unsigned char*) malloc(bufLen);\r\n   buf[0]=0x21;\r\n   for (int i=0; i<length; i++) {\r\n      char * end;\r\n      long j = strtol(config.substr(i*2,2).c_str(), &end, 16);\r\n      buf[i+1] = (unsigned char) j;\r\n   }\r\n\r\n   const unsigned long answerLen = 1;\r\n   unsigned char answer[answerLen];\r\n   printf (\"Set Exposure confign \\n\");\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x21)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::GetExposureConfig(MM::Device& device, MM::Core& core, std::string& config)\r\n{\r\n   const unsigned long bufLen = 1;\r\n   unsigned char buf[bufLen];\r\n   if (readWriteSame_)\r\n      buf[0]=0x021;\r\n   else\r\n      buf[0]=0x027;\r\n   const unsigned long answerLen = 70;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   printf (\"Detecting Exposure Config: \\n\");\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n \r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x27)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   config = \"\";\r\n   for (unsigned int i=1; i < read; i++)\r\n      config += buf[i];\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\n\r\nint SpectralLMM5Interface::SetTriggerOutConfig(MM::Device& device, MM::Core& core, unsigned char * config) \r\n{\r\n   const unsigned long bufLen = 5;\r\n   unsigned char buf[bufLen];\r\n   unsigned long read = 0;\r\n   buf[0]=0x23;\r\n   memcpy(buf + 1, config, 4);\r\n\r\n   const unsigned long answerLen = 10;\/\/1; Why does 1 cause a runtime exception? 'Stack around the variable \"answer\" was corrupted.'\r\n   unsigned char answer[answerLen];\r\n   printf (\"Set Trigger Out \\n\");\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n\r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x23)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\nint SpectralLMM5Interface::GetTriggerOutConfig(MM::Device& device, MM::Core& core, unsigned char * config)\r\n{\r\n   const unsigned long bufLen = 1;\r\n   unsigned char buf[bufLen];\r\n   if (readWriteSame_)\r\n      buf[0]=0x023;\r\n   else\r\n      buf[0]=0x026;\r\n   const unsigned long answerLen = 10;\/\/6;\r\n   unsigned char answer[answerLen];\r\n   unsigned long read;\r\n   printf (\"Detecting Trigger out Config: \\n\");\r\n   int ret = ExecuteCommand(device, core, buf, bufLen, answer, answerLen, read);\r\n   if (ret != DEVICE_OK)\r\n      return ret;\r\n \r\n   \/\/ See if the controller acknowledged our command\r\n   if (answer[0] != 0x23)\r\n      return ERR_UNEXPECTED_ANSWER;\r\n\r\n   memcpy(config, answer + 1, 4);\r\n\r\n   return DEVICE_OK;\r\n}\r\n\r\n\r\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\/planning.h\"\n\n#include <algorithm>\n#include <vector>\n\n#include \"google\/protobuf\/repeated_field.h\"\n\n#include \"modules\/common\/adapters\/adapter_manager.h\"\n#include \"modules\/common\/time\/time.h\"\n#include \"modules\/common\/vehicle_state\/vehicle_state_provider.h\"\n#include \"modules\/map\/hdmap\/hdmap_util.h\"\n#include \"modules\/planning\/common\/planning_gflags.h\"\n#include \"modules\/planning\/common\/trajectory\/trajectory_stitcher.h\"\n#include \"modules\/planning\/planner\/em\/em_planner.h\"\n#include \"modules\/planning\/planner\/rtk\/rtk_replay_planner.h\"\n#include \"modules\/planning\/reference_line\/reference_line_provider.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing apollo::common::ErrorCode;\nusing apollo::common::Status;\nusing apollo::common::TrajectoryPoint;\nusing apollo::common::VehicleStateProvider;\nusing apollo::common::VehicleState;\nusing apollo::common::adapter::AdapterManager;\nusing apollo::common::time::Clock;\n\nstd::string Planning::Name() const { return \"planning\"; }\n\nvoid Planning::RegisterPlanners() {\n  planner_factory_.Register(\n      PlanningConfig::RTK, []() -> Planner* { return new RTKReplayPlanner(); });\n  planner_factory_.Register(PlanningConfig::EM,\n                            []() -> Planner* { return new EMPlanner(); });\n}\n\nStatus Planning::InitFrame(const uint32_t sequence_num,\n                           const TrajectoryPoint& planning_start_point,\n                           const VehicleState& vehicle_state) {\n  frame_.reset(new Frame(sequence_num, planning_start_point, vehicle_state));\n  if (FLAGS_enable_prediction && !AdapterManager::GetPrediction()->Empty()) {\n    const auto& prediction =\n        AdapterManager::GetPrediction()->GetLatestObserved();\n    frame_->SetPrediction(prediction);\n    ADEBUG << \"Get prediction: \" << prediction.DebugString();\n  }\n  auto status = frame_->Init();\n  if (!status.ok()) {\n    AERROR << \"failed to init frame\";\n    return Status(ErrorCode::PLANNING_ERROR, \"init frame failed\");\n  }\n  return Status::OK();\n}\n\nStatus Planning::Init() {\n  hdmap_ = apollo::hdmap::HDMapUtil::BaseMapPtr();\n  CHECK(hdmap_) << \"Failed to load map file:\" << apollo::hdmap::BaseMapFile();\n\n  CHECK(apollo::common::util::GetProtoFromFile(FLAGS_planning_config_file,\n                                               &config_))\n      << \"failed to load planning config file \" << FLAGS_planning_config_file;\n  if (!AdapterManager::Initialized()) {\n    AdapterManager::Init(FLAGS_planning_adapter_config_filename);\n  }\n  if (AdapterManager::GetLocalization() == nullptr) {\n    std::string error_msg(\"Localization is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (AdapterManager::GetChassis() == nullptr) {\n    std::string error_msg(\"Chassis is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (AdapterManager::GetRoutingResponse() == nullptr) {\n    std::string error_msg(\"RoutingResponse is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (AdapterManager::GetRoutingRequest() == nullptr) {\n    std::string error_msg(\"RoutingRequest is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (FLAGS_enable_prediction && AdapterManager::GetPrediction() == nullptr) {\n    std::string error_msg(\"Prediction is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (FLAGS_enable_traffic_light &&\n      AdapterManager::GetTrafficLightDetection() == nullptr) {\n    std::string error_msg(\"Traffic Light Detection is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  ReferenceLineProvider::instance()->Init(\n      hdmap_, config_.qp_spline_reference_line_smoother_config());\n\n  RegisterPlanners();\n  planner_ = planner_factory_.CreateObject(config_.planner_type());\n  if (!planner_) {\n    return Status(\n        ErrorCode::PLANNING_ERROR,\n        \"planning is not initialized with config : \" + config_.DebugString());\n  }\n\n  return planner_->Init(config_);\n}\n\nbool Planning::IsVehicleStateValid(const VehicleState& vehicle_state) {\n  if (std::isnan(vehicle_state.x()) || std::isnan(vehicle_state.y()) ||\n      std::isnan(vehicle_state.z()) || std::isnan(vehicle_state.heading()) ||\n      std::isnan(vehicle_state.kappa()) ||\n      std::isnan(vehicle_state.linear_velocity()) ||\n      std::isnan(vehicle_state.linear_acceleration())) {\n    return false;\n  }\n  return true;\n}\n\nStatus Planning::Start() {\n  timer_ = AdapterManager::CreateTimer(\n      ros::Duration(1.0 \/ FLAGS_planning_loop_rate), &Planning::OnTimer, this);\n  ReferenceLineProvider::instance()->Start();\n  AINFO << \"Planning started\";\n  return Status::OK();\n}\n\nvoid Planning::OnTimer(const ros::TimerEvent&) { RunOnce(); }\n\nvoid Planning::PublishPlanningPb(ADCTrajectory* trajectory_pb,\n                                 double timestamp) {\n  trajectory_pb->mutable_header()->set_timestamp_sec(timestamp);\n  \/\/ TODO(all): integrate reverse gear\n  trajectory_pb->set_gear(canbus::Chassis::GEAR_DRIVE);\n  if (AdapterManager::GetRoutingResponse() &&\n      !AdapterManager::GetRoutingResponse()->Empty()) {\n    trajectory_pb->mutable_routing_header()->CopyFrom(\n        AdapterManager::GetRoutingResponse()->GetLatestObserved().header());\n  }\n\n  \/\/ NOTICE:\n  \/\/ Since we are using the time at each cycle beginning as timestamp, the\n  \/\/ relative time of each trajectory point should be modified so that we can\n  \/\/ use the current timestamp in header.\n\n  \/\/ auto* trajectory_points = trajectory_pb.mutable_trajectory_point();\n  if (!FLAGS_planning_test_mode) {\n    const double dt = timestamp - Clock::NowInSecond();\n    for (auto& p : *trajectory_pb->mutable_trajectory_point()) {\n      p.set_relative_time(p.relative_time() + dt);\n    }\n  }\n  Publish(trajectory_pb);\n}\n\nvoid Planning::RunOnce() {\n  const double start_timestamp = Clock::NowInSecond();\n\n  \/\/ snapshot all coming data\n  AdapterManager::Observe();\n\n  ADCTrajectory not_ready_pb;\n  auto* not_ready = not_ready_pb.mutable_decision()\n                        ->mutable_main_decision()\n                        ->mutable_not_ready();\n  if (AdapterManager::GetLocalization()->Empty()) {\n    not_ready->set_reason(\"localization not ready\");\n  } else if (AdapterManager::GetChassis()->Empty()) {\n    not_ready->set_reason(\"chassis not ready\");\n  } else if (AdapterManager::GetRoutingResponse()->Empty()) {\n    not_ready->set_reason(\"routing not ready\");\n  }\n  if (not_ready->has_reason()) {\n    AERROR << not_ready->reason() << \"; skip the planning cycle.\";\n    PublishPlanningPb(&not_ready_pb, start_timestamp);\n    return;\n  }\n\n  \/\/ localization\n  const auto& localization =\n      AdapterManager::GetLocalization()->GetLatestObserved();\n  ADEBUG << \"Get localization:\" << localization.DebugString();\n\n  \/\/ chassis\n  const auto& chassis = AdapterManager::GetChassis()->GetLatestObserved();\n  ADEBUG << \"Get chassis:\" << chassis.DebugString();\n\n  Status status =\n      VehicleStateProvider::instance()->Update(localization, chassis);\n  VehicleState vehicle_state =\n      VehicleStateProvider::instance()->vehicle_state();\n\n  \/\/ estimate (x, y) at current timestamp\n  if (FLAGS_estimate_current_vehicle_state) {\n    auto future_xy = VehicleStateProvider::instance()->EstimateFuturePosition(\n        start_timestamp - vehicle_state.timestamp());\n    vehicle_state.set_x(future_xy.x());\n    vehicle_state.set_y(future_xy.y());\n    vehicle_state.set_timestamp(start_timestamp);\n  }\n\n  if (!status.ok() || !IsVehicleStateValid(vehicle_state)) {\n    AERROR << \"Update VehicleStateProvider failed.\";\n    not_ready->set_reason(\"Update VehicleStateProvider failed.\");\n    status.Save(not_ready_pb.mutable_header()->mutable_status());\n    PublishPlanningPb(&not_ready_pb, start_timestamp);\n    return;\n  }\n\n  \/\/ Update reference line provider\n  if (!ReferenceLineProvider::instance()->UpdateRoutingResponse(\n          AdapterManager::GetRoutingResponse()->GetLatestObserved())) {\n    AERROR << \"Failed to update routing in reference line provider\";\n    return;\n  }\n  ReferenceLineProvider::instance()->UpdateVehicleState(vehicle_state);\n\n  if (FLAGS_enable_prediction && AdapterManager::GetPrediction()->Empty()) {\n    not_ready->set_reason(\"prediction not ready\");\n    AERROR << not_ready->reason() << \"; skip the planning cycle.\";\n    PublishPlanningPb(&not_ready_pb, start_timestamp);\n    return;\n  }\n\n  const double planning_cycle_time = 1.0 \/ FLAGS_planning_loop_rate;\n  bool is_replan = false;\n  const auto stitching_trajectory =\n      TrajectoryStitcher::ComputeStitchingTrajectory(\n          vehicle_state, start_timestamp, planning_cycle_time,\n          last_publishable_trajectory_.get(), &is_replan);\n\n  const uint32_t frame_num = AdapterManager::GetPlanning()->GetSeqNum() + 1;\n  status = InitFrame(frame_num, stitching_trajectory.back(), vehicle_state);\n  ADCTrajectory trajectory_pb;\n  if (FLAGS_enable_record_debug) {\n    frame_->RecordInputDebug(trajectory_pb.mutable_debug());\n  }\n  trajectory_pb.mutable_latency_stats()->set_init_frame_time_ms(\n      Clock::NowInSecond() - start_timestamp);\n  if (!status.ok()) {\n    AERROR << \"Init frame failed\";\n    if (FLAGS_publish_estop) {\n      ADCTrajectory estop;\n      estop.mutable_estop();\n      status.Save(estop.mutable_header()->mutable_status());\n      PublishPlanningPb(&estop, start_timestamp);\n    }\n    if (frame_) {\n      auto seq_num = frame_->SequenceNum();\n      FrameHistory::instance()->Add(seq_num, std::move(frame_));\n    }\n    return;\n  }\n\n  status = Plan(start_timestamp, stitching_trajectory, &trajectory_pb);\n\n  const auto time_diff_ms = (Clock::NowInSecond() - start_timestamp) * 1000;\n  ADEBUG << \"total planning time spend: \" << time_diff_ms << \" ms.\";\n\n  trajectory_pb.mutable_latency_stats()->set_total_time_ms(time_diff_ms);\n  ADEBUG << \"Planning latency: \" << trajectory_pb.latency_stats().DebugString();\n\n  if (!status.ok()) {\n    status.Save(trajectory_pb.mutable_header()->mutable_status());\n    AERROR << \"Planning failed:\" << status.ToString();\n    if (FLAGS_publish_estop) {\n      AERROR << \"Planning failed and set estop\";\n      trajectory_pb.mutable_estop();\n    }\n  }\n\n  trajectory_pb.set_is_replan(is_replan);\n  PublishPlanningPb(&trajectory_pb, start_timestamp);\n  ADEBUG << \"Planning pb:\" << trajectory_pb.header().DebugString();\n\n  if (frame_) {\n    auto seq_num = frame_->SequenceNum();\n    FrameHistory::instance()->Add(seq_num, std::move(frame_));\n  }\n}\n\nvoid Planning::Stop() {\n  AERROR << \"Planning Stop is called\";\n  ReferenceLineProvider::instance()->Stop();\n  last_publishable_trajectory_.reset(nullptr);\n  frame_.reset(nullptr);\n  planner_.reset(nullptr);\n}\n\nvoid Planning::SetLastPublishableTrajectory(\n    const ADCTrajectory& adc_trajectory) {\n  last_publishable_trajectory_.reset(new PublishableTrajectory(adc_trajectory));\n}\n\nStatus Planning::Plan(const double current_time_stamp,\n                      const std::vector<TrajectoryPoint>& stitching_trajectory,\n                      ADCTrajectory* trajectory_pb) {\n  auto* ptr_debug = trajectory_pb->mutable_debug();\n  if (FLAGS_enable_record_debug) {\n    ptr_debug->mutable_planning_data()->mutable_init_point()->CopyFrom(\n        stitching_trajectory.back());\n  }\n  auto status = Status::OK();\n  for (auto& reference_line_info : frame_->reference_line_info()) {\n    status = planner_->Plan(stitching_trajectory.back(), frame_.get(),\n                            &reference_line_info);\n    if (status == Status::OK()) {\n      if (FLAGS_prioritize_change_lane && reference_line_info.IsDrivable() &&\n          reference_line_info.IsChangeLanePath()) {\n        ADEBUG << \"Found change lane line, skip other reference line\";\n        break;\n      }\n    } else {\n      AERROR << \"planner failed to make a driving plan for: \"\n             << reference_line_info.Lanes().Id();\n    }\n  }\n  const auto* best_reference_line = frame_->FindDriveReferenceLineInfo();\n  if (!best_reference_line) {\n    std::string msg(\n        \"planner failed to make a driving plan because NO valid reference line \"\n        \"info.\");\n    AERROR << msg;\n    if (last_publishable_trajectory_) {\n      last_publishable_trajectory_->Clear();\n    }\n    return Status(ErrorCode::PLANNING_ERROR, msg);\n  }\n  ptr_debug->MergeFrom(best_reference_line->debug());\n  trajectory_pb->mutable_latency_stats()->MergeFrom(\n      best_reference_line->latency_stats());\n\n  best_reference_line->ExportDecision(trajectory_pb->mutable_decision());\n\n  \/\/ Add debug information.\n  if (FLAGS_enable_record_debug) {\n    auto* reference_line = ptr_debug->mutable_planning_data()->add_path();\n    reference_line->set_name(\"planning_reference_line\");\n    const auto& reference_points =\n        best_reference_line->reference_line().reference_points();\n    for (const auto& reference_point : reference_points) {\n      auto* path_point = reference_line->add_path_point();\n      path_point->set_x(reference_point.x());\n      path_point->set_y(reference_point.y());\n      path_point->set_theta(reference_point.heading());\n      path_point->set_kappa(reference_point.kappa());\n      path_point->set_dkappa(reference_point.dkappa());\n    }\n  }\n\n  last_publishable_trajectory_.reset(new PublishableTrajectory(\n      current_time_stamp, best_reference_line->trajectory()));\n\n  ADEBUG << \"current_time_stamp: \" << std::to_string(current_time_stamp);\n\n  last_publishable_trajectory_->PrependTrajectoryPoints(\n      stitching_trajectory.begin(), stitching_trajectory.end() - 1);\n\n  for (size_t i = 0; i < last_publishable_trajectory_->NumOfPoints(); ++i) {\n    if (last_publishable_trajectory_->TrajectoryPointAt(i).relative_time() >\n        FLAGS_trajectory_time_high_density_period) {\n      break;\n    }\n    ADEBUG << last_publishable_trajectory_->TrajectoryPointAt(i)\n                  .ShortDebugString();\n  }\n\n  last_publishable_trajectory_->PopulateTrajectoryProtobuf(trajectory_pb);\n\n  return status;\n}\n\n}  \/\/ namespace planning\n}  \/\/ namespace apollo\n<commit_msg>Planning: only estimate current vehicle state if the time difference is small. (#1410)<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\/planning.h\"\n\n#include <algorithm>\n#include <vector>\n\n#include \"google\/protobuf\/repeated_field.h\"\n\n#include \"modules\/common\/adapters\/adapter_manager.h\"\n#include \"modules\/common\/time\/time.h\"\n#include \"modules\/common\/vehicle_state\/vehicle_state_provider.h\"\n#include \"modules\/map\/hdmap\/hdmap_util.h\"\n#include \"modules\/planning\/common\/planning_gflags.h\"\n#include \"modules\/planning\/common\/trajectory\/trajectory_stitcher.h\"\n#include \"modules\/planning\/planner\/em\/em_planner.h\"\n#include \"modules\/planning\/planner\/rtk\/rtk_replay_planner.h\"\n#include \"modules\/planning\/reference_line\/reference_line_provider.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing apollo::common::ErrorCode;\nusing apollo::common::Status;\nusing apollo::common::TrajectoryPoint;\nusing apollo::common::VehicleStateProvider;\nusing apollo::common::VehicleState;\nusing apollo::common::adapter::AdapterManager;\nusing apollo::common::time::Clock;\n\nstd::string Planning::Name() const { return \"planning\"; }\n\nvoid Planning::RegisterPlanners() {\n  planner_factory_.Register(\n      PlanningConfig::RTK, []() -> Planner* { return new RTKReplayPlanner(); });\n  planner_factory_.Register(PlanningConfig::EM,\n                            []() -> Planner* { return new EMPlanner(); });\n}\n\nStatus Planning::InitFrame(const uint32_t sequence_num,\n                           const TrajectoryPoint& planning_start_point,\n                           const VehicleState& vehicle_state) {\n  frame_.reset(new Frame(sequence_num, planning_start_point, vehicle_state));\n  if (FLAGS_enable_prediction && !AdapterManager::GetPrediction()->Empty()) {\n    const auto& prediction =\n        AdapterManager::GetPrediction()->GetLatestObserved();\n    frame_->SetPrediction(prediction);\n    ADEBUG << \"Get prediction: \" << prediction.DebugString();\n  }\n  auto status = frame_->Init();\n  if (!status.ok()) {\n    AERROR << \"failed to init frame\";\n    return Status(ErrorCode::PLANNING_ERROR, \"init frame failed\");\n  }\n  return Status::OK();\n}\n\nStatus Planning::Init() {\n  hdmap_ = apollo::hdmap::HDMapUtil::BaseMapPtr();\n  CHECK(hdmap_) << \"Failed to load map file:\" << apollo::hdmap::BaseMapFile();\n\n  CHECK(apollo::common::util::GetProtoFromFile(FLAGS_planning_config_file,\n                                               &config_))\n      << \"failed to load planning config file \" << FLAGS_planning_config_file;\n  if (!AdapterManager::Initialized()) {\n    AdapterManager::Init(FLAGS_planning_adapter_config_filename);\n  }\n  if (AdapterManager::GetLocalization() == nullptr) {\n    std::string error_msg(\"Localization is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (AdapterManager::GetChassis() == nullptr) {\n    std::string error_msg(\"Chassis is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (AdapterManager::GetRoutingResponse() == nullptr) {\n    std::string error_msg(\"RoutingResponse is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (AdapterManager::GetRoutingRequest() == nullptr) {\n    std::string error_msg(\"RoutingRequest is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (FLAGS_enable_prediction && AdapterManager::GetPrediction() == nullptr) {\n    std::string error_msg(\"Prediction is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  if (FLAGS_enable_traffic_light &&\n      AdapterManager::GetTrafficLightDetection() == nullptr) {\n    std::string error_msg(\"Traffic Light Detection is not registered\");\n    AERROR << error_msg;\n    return Status(ErrorCode::PLANNING_ERROR, error_msg);\n  }\n  ReferenceLineProvider::instance()->Init(\n      hdmap_, config_.qp_spline_reference_line_smoother_config());\n\n  RegisterPlanners();\n  planner_ = planner_factory_.CreateObject(config_.planner_type());\n  if (!planner_) {\n    return Status(\n        ErrorCode::PLANNING_ERROR,\n        \"planning is not initialized with config : \" + config_.DebugString());\n  }\n\n  return planner_->Init(config_);\n}\n\nbool Planning::IsVehicleStateValid(const VehicleState& vehicle_state) {\n  if (std::isnan(vehicle_state.x()) || std::isnan(vehicle_state.y()) ||\n      std::isnan(vehicle_state.z()) || std::isnan(vehicle_state.heading()) ||\n      std::isnan(vehicle_state.kappa()) ||\n      std::isnan(vehicle_state.linear_velocity()) ||\n      std::isnan(vehicle_state.linear_acceleration())) {\n    return false;\n  }\n  return true;\n}\n\nStatus Planning::Start() {\n  timer_ = AdapterManager::CreateTimer(\n      ros::Duration(1.0 \/ FLAGS_planning_loop_rate), &Planning::OnTimer, this);\n  ReferenceLineProvider::instance()->Start();\n  AINFO << \"Planning started\";\n  return Status::OK();\n}\n\nvoid Planning::OnTimer(const ros::TimerEvent&) { RunOnce(); }\n\nvoid Planning::PublishPlanningPb(ADCTrajectory* trajectory_pb,\n                                 double timestamp) {\n  trajectory_pb->mutable_header()->set_timestamp_sec(timestamp);\n  \/\/ TODO(all): integrate reverse gear\n  trajectory_pb->set_gear(canbus::Chassis::GEAR_DRIVE);\n  if (AdapterManager::GetRoutingResponse() &&\n      !AdapterManager::GetRoutingResponse()->Empty()) {\n    trajectory_pb->mutable_routing_header()->CopyFrom(\n        AdapterManager::GetRoutingResponse()->GetLatestObserved().header());\n  }\n\n  \/\/ NOTICE:\n  \/\/ Since we are using the time at each cycle beginning as timestamp, the\n  \/\/ relative time of each trajectory point should be modified so that we can\n  \/\/ use the current timestamp in header.\n\n  \/\/ auto* trajectory_points = trajectory_pb.mutable_trajectory_point();\n  if (!FLAGS_planning_test_mode) {\n    const double dt = timestamp - Clock::NowInSecond();\n    for (auto& p : *trajectory_pb->mutable_trajectory_point()) {\n      p.set_relative_time(p.relative_time() + dt);\n    }\n  }\n  Publish(trajectory_pb);\n}\n\nvoid Planning::RunOnce() {\n  const double start_timestamp = Clock::NowInSecond();\n\n  \/\/ snapshot all coming data\n  AdapterManager::Observe();\n\n  ADCTrajectory not_ready_pb;\n  auto* not_ready = not_ready_pb.mutable_decision()\n                        ->mutable_main_decision()\n                        ->mutable_not_ready();\n  if (AdapterManager::GetLocalization()->Empty()) {\n    not_ready->set_reason(\"localization not ready\");\n  } else if (AdapterManager::GetChassis()->Empty()) {\n    not_ready->set_reason(\"chassis not ready\");\n  } else if (AdapterManager::GetRoutingResponse()->Empty()) {\n    not_ready->set_reason(\"routing not ready\");\n  }\n  if (not_ready->has_reason()) {\n    AERROR << not_ready->reason() << \"; skip the planning cycle.\";\n    PublishPlanningPb(&not_ready_pb, start_timestamp);\n    return;\n  }\n\n  \/\/ localization\n  const auto& localization =\n      AdapterManager::GetLocalization()->GetLatestObserved();\n  ADEBUG << \"Get localization:\" << localization.DebugString();\n\n  \/\/ chassis\n  const auto& chassis = AdapterManager::GetChassis()->GetLatestObserved();\n  ADEBUG << \"Get chassis:\" << chassis.DebugString();\n\n  Status status =\n      VehicleStateProvider::instance()->Update(localization, chassis);\n  VehicleState vehicle_state =\n      VehicleStateProvider::instance()->vehicle_state();\n\n  \/\/ estimate (x, y) at current timestamp\n  \/\/ This estimate is only valid if the current time and vehicle state timestamp\n  \/\/ differs only a small amount (20ms). When the different is too large, the\n  \/\/ estimation is invalid.\n  DCHECK_GT(start_timestamp, vehicle_state.timestamp());\n  if (FLAGS_estimate_current_vehicle_state &&\n      start_timestamp - vehicle_state.timestamp() < 0.020) {\n    auto future_xy = VehicleStateProvider::instance()->EstimateFuturePosition(\n        start_timestamp - vehicle_state.timestamp());\n    vehicle_state.set_x(future_xy.x());\n    vehicle_state.set_y(future_xy.y());\n    vehicle_state.set_timestamp(start_timestamp);\n  }\n\n  if (!status.ok() || !IsVehicleStateValid(vehicle_state)) {\n    AERROR << \"Update VehicleStateProvider failed.\";\n    not_ready->set_reason(\"Update VehicleStateProvider failed.\");\n    status.Save(not_ready_pb.mutable_header()->mutable_status());\n    PublishPlanningPb(&not_ready_pb, start_timestamp);\n    return;\n  }\n\n  \/\/ Update reference line provider\n  if (!ReferenceLineProvider::instance()->UpdateRoutingResponse(\n          AdapterManager::GetRoutingResponse()->GetLatestObserved())) {\n    AERROR << \"Failed to update routing in reference line provider\";\n    return;\n  }\n  ReferenceLineProvider::instance()->UpdateVehicleState(vehicle_state);\n\n  if (FLAGS_enable_prediction && AdapterManager::GetPrediction()->Empty()) {\n    not_ready->set_reason(\"prediction not ready\");\n    AERROR << not_ready->reason() << \"; skip the planning cycle.\";\n    PublishPlanningPb(&not_ready_pb, start_timestamp);\n    return;\n  }\n\n  const double planning_cycle_time = 1.0 \/ FLAGS_planning_loop_rate;\n  bool is_replan = false;\n  const auto stitching_trajectory =\n      TrajectoryStitcher::ComputeStitchingTrajectory(\n          vehicle_state, start_timestamp, planning_cycle_time,\n          last_publishable_trajectory_.get(), &is_replan);\n\n  const uint32_t frame_num = AdapterManager::GetPlanning()->GetSeqNum() + 1;\n  status = InitFrame(frame_num, stitching_trajectory.back(), vehicle_state);\n  ADCTrajectory trajectory_pb;\n  if (FLAGS_enable_record_debug) {\n    frame_->RecordInputDebug(trajectory_pb.mutable_debug());\n  }\n  trajectory_pb.mutable_latency_stats()->set_init_frame_time_ms(\n      Clock::NowInSecond() - start_timestamp);\n  if (!status.ok()) {\n    AERROR << \"Init frame failed\";\n    if (FLAGS_publish_estop) {\n      ADCTrajectory estop;\n      estop.mutable_estop();\n      status.Save(estop.mutable_header()->mutable_status());\n      PublishPlanningPb(&estop, start_timestamp);\n    }\n    if (frame_) {\n      auto seq_num = frame_->SequenceNum();\n      FrameHistory::instance()->Add(seq_num, std::move(frame_));\n    }\n    return;\n  }\n\n  status = Plan(start_timestamp, stitching_trajectory, &trajectory_pb);\n\n  const auto time_diff_ms = (Clock::NowInSecond() - start_timestamp) * 1000;\n  ADEBUG << \"total planning time spend: \" << time_diff_ms << \" ms.\";\n\n  trajectory_pb.mutable_latency_stats()->set_total_time_ms(time_diff_ms);\n  ADEBUG << \"Planning latency: \" << trajectory_pb.latency_stats().DebugString();\n\n  if (!status.ok()) {\n    status.Save(trajectory_pb.mutable_header()->mutable_status());\n    AERROR << \"Planning failed:\" << status.ToString();\n    if (FLAGS_publish_estop) {\n      AERROR << \"Planning failed and set estop\";\n      trajectory_pb.mutable_estop();\n    }\n  }\n\n  trajectory_pb.set_is_replan(is_replan);\n  PublishPlanningPb(&trajectory_pb, start_timestamp);\n  ADEBUG << \"Planning pb:\" << trajectory_pb.header().DebugString();\n\n  if (frame_) {\n    auto seq_num = frame_->SequenceNum();\n    FrameHistory::instance()->Add(seq_num, std::move(frame_));\n  }\n}\n\nvoid Planning::Stop() {\n  AERROR << \"Planning Stop is called\";\n  ReferenceLineProvider::instance()->Stop();\n  last_publishable_trajectory_.reset(nullptr);\n  frame_.reset(nullptr);\n  planner_.reset(nullptr);\n}\n\nvoid Planning::SetLastPublishableTrajectory(\n    const ADCTrajectory& adc_trajectory) {\n  last_publishable_trajectory_.reset(new PublishableTrajectory(adc_trajectory));\n}\n\nStatus Planning::Plan(const double current_time_stamp,\n                      const std::vector<TrajectoryPoint>& stitching_trajectory,\n                      ADCTrajectory* trajectory_pb) {\n  auto* ptr_debug = trajectory_pb->mutable_debug();\n  if (FLAGS_enable_record_debug) {\n    ptr_debug->mutable_planning_data()->mutable_init_point()->CopyFrom(\n        stitching_trajectory.back());\n  }\n  auto status = Status::OK();\n  for (auto& reference_line_info : frame_->reference_line_info()) {\n    status = planner_->Plan(stitching_trajectory.back(), frame_.get(),\n                            &reference_line_info);\n    if (status == Status::OK()) {\n      if (FLAGS_prioritize_change_lane && reference_line_info.IsDrivable() &&\n          reference_line_info.IsChangeLanePath()) {\n        ADEBUG << \"Found change lane line, skip other reference line\";\n        break;\n      }\n    } else {\n      AERROR << \"planner failed to make a driving plan for: \"\n             << reference_line_info.Lanes().Id();\n    }\n  }\n  const auto* best_reference_line = frame_->FindDriveReferenceLineInfo();\n  if (!best_reference_line) {\n    std::string msg(\n        \"planner failed to make a driving plan because NO valid reference line \"\n        \"info.\");\n    AERROR << msg;\n    if (last_publishable_trajectory_) {\n      last_publishable_trajectory_->Clear();\n    }\n    return Status(ErrorCode::PLANNING_ERROR, msg);\n  }\n  ptr_debug->MergeFrom(best_reference_line->debug());\n  trajectory_pb->mutable_latency_stats()->MergeFrom(\n      best_reference_line->latency_stats());\n\n  best_reference_line->ExportDecision(trajectory_pb->mutable_decision());\n\n  \/\/ Add debug information.\n  if (FLAGS_enable_record_debug) {\n    auto* reference_line = ptr_debug->mutable_planning_data()->add_path();\n    reference_line->set_name(\"planning_reference_line\");\n    const auto& reference_points =\n        best_reference_line->reference_line().reference_points();\n    for (const auto& reference_point : reference_points) {\n      auto* path_point = reference_line->add_path_point();\n      path_point->set_x(reference_point.x());\n      path_point->set_y(reference_point.y());\n      path_point->set_theta(reference_point.heading());\n      path_point->set_kappa(reference_point.kappa());\n      path_point->set_dkappa(reference_point.dkappa());\n    }\n  }\n\n  last_publishable_trajectory_.reset(new PublishableTrajectory(\n      current_time_stamp, best_reference_line->trajectory()));\n\n  ADEBUG << \"current_time_stamp: \" << std::to_string(current_time_stamp);\n\n  last_publishable_trajectory_->PrependTrajectoryPoints(\n      stitching_trajectory.begin(), stitching_trajectory.end() - 1);\n\n  for (size_t i = 0; i < last_publishable_trajectory_->NumOfPoints(); ++i) {\n    if (last_publishable_trajectory_->TrajectoryPointAt(i).relative_time() >\n        FLAGS_trajectory_time_high_density_period) {\n      break;\n    }\n    ADEBUG << last_publishable_trajectory_->TrajectoryPointAt(i)\n                  .ShortDebugString();\n  }\n\n  last_publishable_trajectory_->PopulateTrajectoryProtobuf(trajectory_pb);\n\n  return status;\n}\n\n}  \/\/ namespace planning\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015 Vladimir Ivan\n\n\/*\n - Designer will publish:\n http:\/\/docs.ros.org\/indigo\/api\/trajectory_msgs\/html\/msg\/JointTrajectory.html\n - Designer will receive: (with root link as 0,0,0)\n http:\/\/docs.ros.org\/indigo\/api\/sensor_msgs\/html\/msg\/JointState.html\n *\/\n#include <cstdlib>\n#include <string>\n#include <ros\/ros.h>\n#include <lcm\/lcm-cpp.hpp>\n\n#include \"lcmtypes\/drc\/robot_plan_t.hpp\"\n#include \"lcmtypes\/drc\/plan_control_t.hpp\"\n#include \"lcmtypes\/drc\/affordance_collection_t.hpp\"\n#include \"lcmtypes\/drc\/robot_state_t.hpp\"\n#include \"lcmtypes\/drc\/exotica_planner_request_t.hpp\"\n#include \"lcmtypes\/drc\/map_octree_t.hpp\"\n#include <trajectory_msgs\/JointTrajectory.h>\n#include <ipab_msgs\/PlannerRequest.h>\n#include <octomap_msgs\/Octomap.h>\n#include <std_srvs\/Empty.h>\n#include <std_msgs\/String.h>\n\nclass LCM2ROS\n{\npublic:\n  LCM2ROS(boost::shared_ptr<lcm::LCM> &lcm_in, ros::NodeHandle &nh_in);\n  ~LCM2ROS()\n  {\n  }\n\nprivate:\n  boost::shared_ptr<lcm::LCM> lcm_;\n  ros::NodeHandle nh_;\n\n  ros::Publisher planner_request_pub_;\n  ros::Publisher ik_request_pub_;\n  ros::Publisher octomap_pub_;\n\n  void plannerRequestHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                             const drc::exotica_planner_request_t* msg);\n  void ikRequestHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                        const drc::exotica_planner_request_t* msg);\n  void octreeHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                        const drc::map_octree_t* msg);\n};\n\nLCM2ROS::LCM2ROS(boost::shared_ptr<lcm::LCM> &lcm_in, ros::NodeHandle &nh_in) : lcm_(lcm_in), nh_(nh_in)\n{\n  lcm_->subscribe(\"PLANNER_REQUEST\", &LCM2ROS::plannerRequestHandler, this);\n  planner_request_pub_ = nh_.advertise<ipab_msgs::PlannerRequest>(\"\/exotica\/planner_request\", 10);\n\n  lcm_->subscribe(\"IK_REQUEST\", &LCM2ROS::ikRequestHandler, this);\n  ik_request_pub_ = nh_.advertise<ipab_msgs::PlannerRequest>(\"\/exotica\/ik_request\", 10);\n\n  lcm_->subscribe(\"MAP_OCTREE\", &LCM2ROS::octreeHandler, this);\n  octomap_pub_ = nh_.advertise<octomap_msgs::Octomap>(\"\/octomap_binary\", 1);\n}\n\nvoid translatePlannerRequest(const drc::exotica_planner_request_t* msg, ipab_msgs::PlannerRequest& m)\n{\n  m.header.stamp = ros::Time().fromSec(msg->utime * 1E-6);\n  m.poses = msg->poses;\n  m.constraints = msg->constraints;\n  m.affordances = msg->affordances;\n  m.seed_pose = msg->seed_pose;\n  m.nominal_pose = msg->nominal_pose;\n  m.end_pose = msg->end_pose;\n  m.joint_names = msg->joint_names;\n  m.options = msg->options;\n}\n\nvoid LCM2ROS::plannerRequestHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                                    const drc::exotica_planner_request_t* msg)\n{\n  ROS_ERROR(\"LCM2ROS got PLANNER_REQUEST\");\n  ipab_msgs::PlannerRequest m;\n  translatePlannerRequest(msg, m);\n  planner_request_pub_.publish(m);\n}\n\nvoid LCM2ROS::ikRequestHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                               const drc::exotica_planner_request_t* msg)\n{\n  ROS_ERROR(\"LCM2ROS got IK_REQUEST\");\n  ipab_msgs::PlannerRequest m;\n  translatePlannerRequest(msg, m);\n  ik_request_pub_.publish(m);\n}\n\nvoid LCM2ROS::octreeHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                               const drc::map_octree_t* msg)\n{\n  octomap_msgs::Octomap m;\n  m.header.frame_id = \"\/world_frame\";\n  m.header.stamp = ros::Time().fromSec(msg->utime * 1E-6);\n\n  \/\/ hard coded because the incoming message has no resolution\n  \/\/ A better solution might be to also check the view_id if there are\n  \/\/ multiple octrees being published\n  m.id = \"OcTree\";\n  m.resolution = 0.01;\n  m.binary = true;\n  m.data.resize(msg->num_bytes);\n  memcpy(&m.data[0], msg->data.data(), msg->num_bytes);\n\n  octomap_pub_.publish(m);\n}\n\nint main(int argc, char** argv)\n{\n  ros::init(argc, argv, \"lcm2ros\", ros::init_options::NoSigintHandler);\n  boost::shared_ptr<lcm::LCM> lcm(new lcm::LCM);\n  if (!lcm->good())\n  {\n    std::cerr << \"ERROR: lcm is not good()\" << std::endl;\n  }\n  ros::NodeHandle nh;\n\n  LCM2ROS handlerObject(lcm, nh);\n  ROS_INFO_STREAM(\"lcm2ros translator ready\");\n  ROS_ERROR_STREAM(\"LCM2ROS Translator Ready\");\n\n  while (0 == lcm->handle())\n  {\n  }\n\n  return 0;\n}\n<commit_msg>debug output<commit_after>\/\/ Copyright 2015 Vladimir Ivan\n\n\/*\n - Designer will publish:\n http:\/\/docs.ros.org\/indigo\/api\/trajectory_msgs\/html\/msg\/JointTrajectory.html\n - Designer will receive: (with root link as 0,0,0)\n http:\/\/docs.ros.org\/indigo\/api\/sensor_msgs\/html\/msg\/JointState.html\n *\/\n#include <cstdlib>\n#include <string>\n#include <ros\/ros.h>\n#include <lcm\/lcm-cpp.hpp>\n\n#include \"lcmtypes\/drc\/robot_plan_t.hpp\"\n#include \"lcmtypes\/drc\/plan_control_t.hpp\"\n#include \"lcmtypes\/drc\/affordance_collection_t.hpp\"\n#include \"lcmtypes\/drc\/robot_state_t.hpp\"\n#include \"lcmtypes\/drc\/exotica_planner_request_t.hpp\"\n#include \"lcmtypes\/drc\/map_octree_t.hpp\"\n#include <trajectory_msgs\/JointTrajectory.h>\n#include <ipab_msgs\/PlannerRequest.h>\n#include <octomap_msgs\/Octomap.h>\n#include <std_srvs\/Empty.h>\n#include <std_msgs\/String.h>\n\nclass LCM2ROS\n{\npublic:\n  LCM2ROS(boost::shared_ptr<lcm::LCM> &lcm_in, ros::NodeHandle &nh_in);\n  ~LCM2ROS()\n  {\n  }\n\nprivate:\n  boost::shared_ptr<lcm::LCM> lcm_;\n  ros::NodeHandle nh_;\n\n  ros::Publisher planner_request_pub_;\n  ros::Publisher ik_request_pub_;\n  ros::Publisher octomap_pub_;\n\n  void plannerRequestHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                             const drc::exotica_planner_request_t* msg);\n  void ikRequestHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                        const drc::exotica_planner_request_t* msg);\n  void octreeHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                        const drc::map_octree_t* msg);\n};\n\nLCM2ROS::LCM2ROS(boost::shared_ptr<lcm::LCM> &lcm_in, ros::NodeHandle &nh_in) : lcm_(lcm_in), nh_(nh_in)\n{\n  lcm_->subscribe(\"PLANNER_REQUEST\", &LCM2ROS::plannerRequestHandler, this);\n  planner_request_pub_ = nh_.advertise<ipab_msgs::PlannerRequest>(\"\/exotica\/planner_request\", 10);\n\n  lcm_->subscribe(\"IK_REQUEST\", &LCM2ROS::ikRequestHandler, this);\n  ik_request_pub_ = nh_.advertise<ipab_msgs::PlannerRequest>(\"\/exotica\/ik_request\", 10);\n\n  lcm_->subscribe(\"MAP_OCTREE\", &LCM2ROS::octreeHandler, this);\n  octomap_pub_ = nh_.advertise<octomap_msgs::Octomap>(\"\/octomap_binary\", 1);\n}\n\nvoid translatePlannerRequest(const drc::exotica_planner_request_t* msg, ipab_msgs::PlannerRequest& m)\n{\n  m.header.stamp = ros::Time().fromSec(msg->utime * 1E-6);\n  m.poses = msg->poses;\n  m.constraints = msg->constraints;\n  m.affordances = msg->affordances;\n  m.seed_pose = msg->seed_pose;\n  m.nominal_pose = msg->nominal_pose;\n  m.end_pose = msg->end_pose;\n  m.joint_names = msg->joint_names;\n  m.options = msg->options;\n}\n\nvoid LCM2ROS::plannerRequestHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                                    const drc::exotica_planner_request_t* msg)\n{\n  ROS_ERROR(\"LCM2ROS got PLANNER_REQUEST\");\n  ipab_msgs::PlannerRequest m;\n  translatePlannerRequest(msg, m);\n  planner_request_pub_.publish(m);\n}\n\nvoid LCM2ROS::ikRequestHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                               const drc::exotica_planner_request_t* msg)\n{\n  ROS_ERROR(\"LCM2ROS got IK_REQUEST\");\n  ipab_msgs::PlannerRequest m;\n  translatePlannerRequest(msg, m);\n  ik_request_pub_.publish(m);\n}\n\nvoid LCM2ROS::octreeHandler(const lcm::ReceiveBuffer* rbuf, const std::string &channel,\n                               const drc::map_octree_t* msg)\n{\n  octomap_msgs::Octomap m;\n  m.header.frame_id = \"\/world_frame\";\n  m.header.stamp = ros::Time().fromSec(msg->utime * 1E-6);\n\n  \/\/ hard coded because the incoming message has no resolution\n  \/\/ A better solution might be to also check the view_id if there are\n  \/\/ multiple octrees being published\n  m.id = \"OcTree\";\n  m.resolution = 0.01;\n  m.binary = true;\n  m.data.resize(msg->num_bytes);\n  memcpy(&m.data[0], msg->data.data(), msg->num_bytes);\n\n  octomap_pub_.publish(m);\n  ROS_ERROR(\"Publishing OCTOMAP\");\n}\n\nint main(int argc, char** argv)\n{\n  ros::init(argc, argv, \"lcm2ros\", ros::init_options::NoSigintHandler);\n  boost::shared_ptr<lcm::LCM> lcm(new lcm::LCM);\n  if (!lcm->good())\n  {\n    std::cerr << \"ERROR: lcm is not good()\" << std::endl;\n  }\n  ros::NodeHandle nh;\n\n  LCM2ROS handlerObject(lcm, nh);\n  ROS_INFO_STREAM(\"lcm2ros translator ready\");\n  ROS_ERROR_STREAM(\"LCM2ROS Translator Ready\");\n\n  while (0 == lcm->handle())\n  {\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: sfxhelp.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: pb $ $Date: 2000-12-07 18:04:54 $\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 \"sfxhelp.hxx\"\n\n#pragma hdrstop\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XFRAME_HPP_\n#include <com\/sun\/star\/frame\/XFrame.hpp>\n#endif\n#ifndef _UNOTOOLS_PROCESSFACTORY_HXX\n#include <comphelper\/processfactory.hxx>\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 _COM_SUN_STAR_FRAME_XTASK_HPP_\n#include <com\/sun\/star\/frame\/XTask.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XTASKSSUPPLIER_HPP_\n#include <com\/sun\/star\/frame\/XTasksSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XURLTRANSFORMER_HPP_\n#include <com\/sun\/star\/util\/XURLTransformer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCH_HPP_\n#include <com\/sun\/star\/frame\/XDispatch.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.hpp>\n#endif\n#include <com\/sun\/star\/frame\/FrameSearchFlag.hpp>\n#include <toolkit\/helper\/vclunohelper.hxx>\n\n#include \"sfxsids.hrc\"\n#include \"app.hxx\"\n#include \"viewfrm.hxx\"\n#include \"msgpool.hxx\"\n#include \"newhelp.hxx\"\n#include \"objsh.hxx\"\n#include \"docfac.hxx\"\n#include \"sfxresid.hxx\"\n#include \"app.hrc\"\n\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::frame;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::util;\n\nSfxHelp_Impl::SfxHelp_Impl()\n{\n}\n\nSfxHelp_Impl::~SfxHelp_Impl()\n{\n}\n\nString SfxHelp_Impl::GetHelpModuleName( ULONG nHelpId )\n{\n    String aModuleName;\n    SfxViewFrame *pViewFrame = SfxViewFrame::Current();\n    if ( pViewFrame )\n    {\n        \/\/ Wenn es ein Slot ist, kann es sein, da\\s internes InPlace vorliegt\n        \/\/ und eine Container-SlotId gefragt ist\n        if (nHelpId >= (ULONG) SID_SFX_START && nHelpId <= (ULONG) SHRT_MAX)\n        {\n            if ( pViewFrame->GetParentViewFrame_Impl() )\n            {\n                \/\/ Ist es ein ContainerSlot ?\n                const SfxSlot* pSlot = SFX_APP()->GetSlotPool(pViewFrame).GetSlot( (USHORT) nHelpId );\n                if ( !pSlot || pSlot->IsMode( SFX_SLOT_CONTAINER ) )\n                    pViewFrame = pViewFrame->GetParentViewFrame_Impl();\n            }\n        }\n\n        if( pViewFrame->GetObjectShell() )\n            aModuleName = String::CreateFromAscii( pViewFrame->GetObjectShell()->GetFactory().GetShortName() );\n    }\n\n    return aModuleName;\n}\n\nBOOL SfxHelp_Impl::Start( ULONG nHelpId )\n{\n    Reference < XTasksSupplier > xDesktop( ::comphelper::getProcessServiceFactory()->createInstance(\n                DEFINE_CONST_UNICODE(\"com.sun.star.frame.Desktop\") ), UNO_QUERY );\n\n    Reference < XTask > xActiveTask = xDesktop->getActiveTask();\n    if ( !xActiveTask.is() )\n        return FALSE;\n\n    \/\/ build up the help URL\n    String aHelpModuleName = GetHelpModuleName( nHelpId );\n    String aHelpURL(String::CreateFromAscii(\"vnd.sun.star.help:\/\/\") );\n    aHelpURL += aHelpModuleName;\n    aHelpURL += String( DEFINE_CONST_UNICODE(\"\/start\") );\n\/\/! aHelpURL += '\/';\n\/\/! aHelpURL += String::CreateFromInt32( nHelpId );\n\n    \/\/ try to find the help frame\n    Reference < XDispatchProvider > xFrame(\n        xActiveTask->findFrame( ::rtl::OUString::createFromAscii( \"OFFICE_HELP\" ),\n        FrameSearchFlag::GLOBAL ), UNO_QUERY );\n    ::com::sun::star::util::URL aURL;\n    aURL.Complete = aHelpURL;\n    Reference < XURLTransformer > xTrans( ::comphelper::getProcessServiceFactory()->createInstance(\n            DEFINE_CONST_UNICODE(\"com.sun.star.util.URLTransformer\" )), UNO_QUERY );\n    xTrans->parseStrict( aURL );\n\n    Sequence < PropertyValue > aProps;\n    sal_Int32 nFlag = FrameSearchFlag::GLOBAL;\n    if ( aTicket.Len() )\n    {\n        \/\/ if there is a ticket, we are inside a plugin, so a request including the URL must be posted\n        if ( !xFrame.is() )\n            \/\/ must be created on dispatch\n            nFlag |= FrameSearchFlag::CREATE;\n    }\n    else\n    {\n        \/\/ otherwise the URL can be dispatched to the help frame\n        if ( !xFrame.is() )\n        {\n            Reference < XFrame > xTask = xActiveTask->findFrame( DEFINE_CONST_UNICODE( \"_blank\" ), 0 );\n            xFrame = Reference < XDispatchProvider >( xTask, UNO_QUERY );\n            Window* pWin = VCLUnoHelper::GetWindow( xTask->getContainerWindow() );\n            pWin->SetText( String( SfxResId( STR_HELP_WINDOW_TITLE ) ) );\n            SfxHelpWindow_Impl* pHlpWin = new SfxHelpWindow_Impl( xTask, pWin, WB_DOCKBORDER );\n            pHlpWin->Show();\n            Reference< ::com::sun::star::awt::XWindow > xWindow = VCLUnoHelper::GetInterface( pHlpWin );\n            xWindow->setPosSize( 50, 50, 300, 200, ::com::sun::star::awt::PosSize::SIZE );\n            if ( !xTask->setComponent( xWindow, Reference < XController >() ) )\n                return FALSE;\n            else\n            {\n                pHlpWin->setContainerWindow( xTask->getContainerWindow() );\n                pHlpWin->SetFactory( aHelpModuleName );\n                xTask->getContainerWindow()->setVisible( sal_True );\n            }\n        }\n    }\n\n    Reference < XDispatch > xDispatch = xFrame->queryDispatch( aURL,\n                            DEFINE_CONST_UNICODE(\"OFFICE_HELP\"), FrameSearchFlag::ALL );\n    if ( xDispatch.is() )\n    {\n        xDispatch->dispatch( aURL, aProps );\n    }\n\n    return TRUE;\n}\n\n\/*-----------------22.11.2000 10:59-----------------\n * old code\nBOOL SfxHelp_Impl::ImplStart( ULONG nHelpId, BOOL bCheckHelpFile, BOOL bChangeHelpFile, BOOL bHelpAgent )\n{\n    static BOOL bInHelpRequest = FALSE;\n    if ( bInHelpRequest || !nHelpId || ( nHelpId == SID_EXTENDEDHELP ) )\n    {\n        if ( bInHelpRequest )\n            Sound::Beep();\n        return FALSE;\n    }\n\n\n    if ( Help::IsRightHelp() )\n    {\n        if( ImplGetHelpMode() & HELPTEXTMODE_NOHELPAGENT )\n            return FALSE;\n\n        if ( ( nHelpId == HELP_INDEX ) || !CheckHelpFile( TRUE ) )\n            return FALSE;\n\n        bInHelpRequest = TRUE;\n        SetCurrentHelpFile( nHelpId );\n        StartHelpPI( nHelpId, FALSE, FALSE );\n        bInHelpRequest = FALSE;\n        return TRUE;\n    }\n\n    bInHelpRequest = TRUE;\n\n    if( ImplGetHelpMode() & HELPTEXTMODE_NOCONTEXTHELP )\n    {\n        if( nHelpId < 20000 || nHelpId > 20006 )\n            nHelpId = HELP_INDEX;\n    }\n\n    if ( bChangeHelpFile )\n        SetCurrentHelpFile( nHelpId );\n\n    BOOL bDone = FALSE;\n    if ( !bCheckHelpFile || CheckHelpFile( TRUE ) )\n    {\n        SfxViewFrame* pFrame = SfxViewFrame::Current();\n        if ( !bHelpAgent || ( nHelpId == HELP_INDEX ) )\n\/\/              !Application::IsInModalMode() &&\n\/\/              Application::GetAppWindow()->IsEnabled() &&\n\/\/              !SearchFocusWindowParent() &&   \/\/ kein Dialog aktiv\n\/\/              ( !pFrame || !pFrame->GetObjectShell()->IsInModalMode() ) )\n        {\n            SfxHelpViewShell* pViewShell = GetHelpViewShell( TRUE );\n            if ( pViewShell )\n                bDone = pViewShell->ShowHelp( GetHelpFile(), nHelpId );\n        }\n        else\n        {\n            StartHelpPI( nHelpId, TRUE, FALSE );\n            SfxHelpPI* pHelpPI= SFX_APP()->GetHelpPI();\n            if ( pHelpPI )\n            {\n                if ( !pHelpPI->IsFloatingMode() )\n                {\n                    pHelpPI->SetFloatingMode( TRUE );\n                    bForcedFloatingPI = TRUE;\n                }\n                if ( pHelpPI->GetFloatingWindow() )\n                    pHelpPI->GetFloatingWindow()->ToTop();\n                CheckPIPosition();\n                bDone = TRUE;\n            }\n        }\n    }\n    bInHelpRequest = FALSE;\n    return bDone;\n    return FALSE;\n}\n*\/\n\nstruct HelpFileInfo;\nclass SfxHelp\n{\npublic:\n    static  BOOL            ShowHelp( ULONG nId, BOOL bShowInHelpAgent, const char* pFileName = 0, BOOL bQuiet = FALSE );\n    static  BOOL            ShowHelp( const String& rKeyword, BOOL bShowInHelpAgent, const char* pFileName = 0 );\n    static  void            ShowHint( ULONG nId );\n    static  void            SetCustomHelpFile( const String& rName );\n    static  USHORT          GetHelpFileInfoCount();\n    static  HelpFileInfo*   GetHelpFileInfo( USHORT n );\n};\n\nBOOL SfxHelp::ShowHelp( ULONG nId, BOOL bShowInHelpAgent, const char* pFileName, BOOL bQuiet )\n{\n    return FALSE;\n}\n\nBOOL SfxHelp::ShowHelp( const String& rKeyword, BOOL bShowInHelpAgent, const char* pFileName )\n{\n    return FALSE;\n}\n\nvoid SfxHelp::ShowHint( ULONG nId )\n{\n}\n\nvoid SfxHelp::SetCustomHelpFile( const String& rName )\n{\n}\n\nUSHORT SfxHelp::GetHelpFileInfoCount()\n{\n    return 0;\n}\n\nHelpFileInfo* SfxHelp::GetHelpFileInfo( USHORT n )\n{\n    return NULL;\n}\n\nclass SfxHelpPI\n{\npublic:\n    void            LoadTopic( const String& rFileName, ULONG nId );\n    void            LoadTopic( ULONG nId );\n    void            LoadTopic( const String& rKeyword );\n    void            ResetTopic();\n    BOOL            Close();\n\/\/    BOOL            IsConstructed() const { return ( pHelpPI != 0 ); }\n    String          GetExtraInfo() const;\n\/\/    HelpPI*         GetHelpPI() const { return pHelpPI; }\n\/\/    virtual void    FillInfo( SfxChildWinInfo& ) const;\n    void            SetTip( ULONG nId );\n    void            SetTipText( const String& rText );\n\/\/    BOOL            IsInShowMe() const { return bInShowMe; }\n\/\/    BOOL            IsTopicJustRequested() const { return aTopicJustRequestedTimer.IsActive(); }\n\/\/    void            SetTopicJustRequested( BOOL bOn ) { if( bOn )\n\/\/                                                            aTopicJustRequestedTimer.Start();\n\/\/                                                        else\n\/\/                                                            aTopicJustRequestedTimer.Stop(); }\n};\n\nvoid SfxHelpPI::LoadTopic( const String& rFileName, ULONG nId ) {}\nvoid SfxHelpPI::LoadTopic( ULONG nId ) {}\nvoid SfxHelpPI::LoadTopic( const String& rKeyword ) {}\nvoid SfxHelpPI::ResetTopic() {}\n\/\/    BOOL            IsConstructed() const { return ( pHelpPI != 0 ); }\n\/\/    HelpPI*         GetHelpPI() const { return pHelpPI; }\n\/\/    virtual void    FillInfo( SfxChildWinInfo& ) const;\nvoid SfxHelpPI::SetTip( ULONG nId ) {}\nvoid SfxHelpPI::SetTipText( const String& rText ) {}\n\nclass SfxHelpPIWrapper\n{\npublic:\n    static USHORT GetChildWindowId();\n};\n\nUSHORT SfxHelpPIWrapper::GetChildWindowId()\n{\n    return 0;\n}\n\nclass SfxHelpTipsWrapper\n{\npublic:\n    static USHORT GetChildWindowId();\n};\n\nUSHORT SfxHelpTipsWrapper::GetChildWindowId()\n{\n    return 0;\n}\n<commit_msg>fix: #81307# 0 == nHelpId starts the help-start-page<commit_after>\/*************************************************************************\n *\n *  $RCSfile: sfxhelp.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: pb $ $Date: 2000-12-08 10:18:04 $\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 \"sfxhelp.hxx\"\n\n#pragma hdrstop\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XFRAME_HPP_\n#include <com\/sun\/star\/frame\/XFrame.hpp>\n#endif\n#ifndef _UNOTOOLS_PROCESSFACTORY_HXX\n#include <comphelper\/processfactory.hxx>\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 _COM_SUN_STAR_FRAME_XTASK_HPP_\n#include <com\/sun\/star\/frame\/XTask.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XTASKSSUPPLIER_HPP_\n#include <com\/sun\/star\/frame\/XTasksSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XURLTRANSFORMER_HPP_\n#include <com\/sun\/star\/util\/XURLTransformer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCH_HPP_\n#include <com\/sun\/star\/frame\/XDispatch.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.hpp>\n#endif\n#include <com\/sun\/star\/frame\/FrameSearchFlag.hpp>\n#include <toolkit\/helper\/vclunohelper.hxx>\n\n#include \"sfxsids.hrc\"\n#include \"app.hxx\"\n#include \"viewfrm.hxx\"\n#include \"msgpool.hxx\"\n#include \"newhelp.hxx\"\n#include \"objsh.hxx\"\n#include \"docfac.hxx\"\n#include \"sfxresid.hxx\"\n#include \"app.hrc\"\n\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::frame;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::util;\n\nSfxHelp_Impl::SfxHelp_Impl()\n{\n}\n\nSfxHelp_Impl::~SfxHelp_Impl()\n{\n}\n\nString SfxHelp_Impl::GetHelpModuleName( ULONG nHelpId )\n{\n    String aModuleName;\n    SfxViewFrame *pViewFrame = SfxViewFrame::Current();\n    if ( pViewFrame )\n    {\n        \/\/ Wenn es ein Slot ist, kann es sein, da\\s internes InPlace vorliegt\n        \/\/ und eine Container-SlotId gefragt ist\n        if (nHelpId >= (ULONG) SID_SFX_START && nHelpId <= (ULONG) SHRT_MAX)\n        {\n            if ( pViewFrame->GetParentViewFrame_Impl() )\n            {\n                \/\/ Ist es ein ContainerSlot ?\n                const SfxSlot* pSlot = SFX_APP()->GetSlotPool(pViewFrame).GetSlot( (USHORT) nHelpId );\n                if ( !pSlot || pSlot->IsMode( SFX_SLOT_CONTAINER ) )\n                    pViewFrame = pViewFrame->GetParentViewFrame_Impl();\n            }\n        }\n\n        if( pViewFrame->GetObjectShell() )\n            aModuleName = String::CreateFromAscii( pViewFrame->GetObjectShell()->GetFactory().GetShortName() );\n    }\n\n    return aModuleName;\n}\n\nBOOL SfxHelp_Impl::Start( ULONG nHelpId )\n{\n    Reference < XTasksSupplier > xDesktop( ::comphelper::getProcessServiceFactory()->createInstance(\n                DEFINE_CONST_UNICODE(\"com.sun.star.frame.Desktop\") ), UNO_QUERY );\n\n    Reference < XTask > xActiveTask = xDesktop->getActiveTask();\n    if ( !xActiveTask.is() )\n        return FALSE;\n\n    \/\/ build up the help URL\n    String aHelpModuleName = GetHelpModuleName( nHelpId );\n    String aHelpURL(String::CreateFromAscii(\"vnd.sun.star.help:\/\/\") );\n    aHelpURL += aHelpModuleName;\n    if ( !nHelpId )\n        aHelpURL += String( DEFINE_CONST_UNICODE(\"\/start\") );\n    else\n    {\n        aHelpURL += '\/';\n        aHelpURL += String::CreateFromInt32( nHelpId );\n    }\n\n    \/\/ try to find the help frame\n    Reference < XDispatchProvider > xFrame(\n        xActiveTask->findFrame( ::rtl::OUString::createFromAscii( \"OFFICE_HELP\" ),\n        FrameSearchFlag::GLOBAL ), UNO_QUERY );\n    ::com::sun::star::util::URL aURL;\n    aURL.Complete = aHelpURL;\n    Reference < XURLTransformer > xTrans( ::comphelper::getProcessServiceFactory()->createInstance(\n            DEFINE_CONST_UNICODE(\"com.sun.star.util.URLTransformer\" )), UNO_QUERY );\n    xTrans->parseStrict( aURL );\n\n    Sequence < PropertyValue > aProps;\n    sal_Int32 nFlag = FrameSearchFlag::GLOBAL;\n    if ( aTicket.Len() )\n    {\n        \/\/ if there is a ticket, we are inside a plugin, so a request including the URL must be posted\n        if ( !xFrame.is() )\n            \/\/ must be created on dispatch\n            nFlag |= FrameSearchFlag::CREATE;\n    }\n    else\n    {\n        \/\/ otherwise the URL can be dispatched to the help frame\n        if ( !xFrame.is() )\n        {\n            Reference < XFrame > xTask = xActiveTask->findFrame( DEFINE_CONST_UNICODE( \"_blank\" ), 0 );\n            xFrame = Reference < XDispatchProvider >( xTask, UNO_QUERY );\n            Window* pWin = VCLUnoHelper::GetWindow( xTask->getContainerWindow() );\n            pWin->SetText( String( SfxResId( STR_HELP_WINDOW_TITLE ) ) );\n            SfxHelpWindow_Impl* pHlpWin = new SfxHelpWindow_Impl( xTask, pWin, WB_DOCKBORDER );\n            pHlpWin->Show();\n            Reference< ::com::sun::star::awt::XWindow > xWindow = VCLUnoHelper::GetInterface( pHlpWin );\n            xWindow->setPosSize( 50, 50, 300, 200, ::com::sun::star::awt::PosSize::SIZE );\n            if ( !xTask->setComponent( xWindow, Reference < XController >() ) )\n                return FALSE;\n            else\n            {\n                pHlpWin->setContainerWindow( xTask->getContainerWindow() );\n                pHlpWin->SetFactory( aHelpModuleName );\n                xTask->getContainerWindow()->setVisible( sal_True );\n            }\n        }\n    }\n\n    Reference < XDispatch > xDispatch = xFrame->queryDispatch( aURL,\n                            DEFINE_CONST_UNICODE(\"OFFICE_HELP\"), FrameSearchFlag::ALL );\n    if ( xDispatch.is() )\n    {\n        xDispatch->dispatch( aURL, aProps );\n    }\n\n    return TRUE;\n}\n\n\/*-----------------22.11.2000 10:59-----------------\n * old code\nBOOL SfxHelp_Impl::ImplStart( ULONG nHelpId, BOOL bCheckHelpFile, BOOL bChangeHelpFile, BOOL bHelpAgent )\n{\n    static BOOL bInHelpRequest = FALSE;\n    if ( bInHelpRequest || !nHelpId || ( nHelpId == SID_EXTENDEDHELP ) )\n    {\n        if ( bInHelpRequest )\n            Sound::Beep();\n        return FALSE;\n    }\n\n\n    if ( Help::IsRightHelp() )\n    {\n        if( ImplGetHelpMode() & HELPTEXTMODE_NOHELPAGENT )\n            return FALSE;\n\n        if ( ( nHelpId == HELP_INDEX ) || !CheckHelpFile( TRUE ) )\n            return FALSE;\n\n        bInHelpRequest = TRUE;\n        SetCurrentHelpFile( nHelpId );\n        StartHelpPI( nHelpId, FALSE, FALSE );\n        bInHelpRequest = FALSE;\n        return TRUE;\n    }\n\n    bInHelpRequest = TRUE;\n\n    if( ImplGetHelpMode() & HELPTEXTMODE_NOCONTEXTHELP )\n    {\n        if( nHelpId < 20000 || nHelpId > 20006 )\n            nHelpId = HELP_INDEX;\n    }\n\n    if ( bChangeHelpFile )\n        SetCurrentHelpFile( nHelpId );\n\n    BOOL bDone = FALSE;\n    if ( !bCheckHelpFile || CheckHelpFile( TRUE ) )\n    {\n        SfxViewFrame* pFrame = SfxViewFrame::Current();\n        if ( !bHelpAgent || ( nHelpId == HELP_INDEX ) )\n\/\/              !Application::IsInModalMode() &&\n\/\/              Application::GetAppWindow()->IsEnabled() &&\n\/\/              !SearchFocusWindowParent() &&   \/\/ kein Dialog aktiv\n\/\/              ( !pFrame || !pFrame->GetObjectShell()->IsInModalMode() ) )\n        {\n            SfxHelpViewShell* pViewShell = GetHelpViewShell( TRUE );\n            if ( pViewShell )\n                bDone = pViewShell->ShowHelp( GetHelpFile(), nHelpId );\n        }\n        else\n        {\n            StartHelpPI( nHelpId, TRUE, FALSE );\n            SfxHelpPI* pHelpPI= SFX_APP()->GetHelpPI();\n            if ( pHelpPI )\n            {\n                if ( !pHelpPI->IsFloatingMode() )\n                {\n                    pHelpPI->SetFloatingMode( TRUE );\n                    bForcedFloatingPI = TRUE;\n                }\n                if ( pHelpPI->GetFloatingWindow() )\n                    pHelpPI->GetFloatingWindow()->ToTop();\n                CheckPIPosition();\n                bDone = TRUE;\n            }\n        }\n    }\n    bInHelpRequest = FALSE;\n    return bDone;\n    return FALSE;\n}\n*\/\n\nstruct HelpFileInfo;\nclass SfxHelp\n{\npublic:\n    static  BOOL            ShowHelp( ULONG nId, BOOL bShowInHelpAgent, const char* pFileName = 0, BOOL bQuiet = FALSE );\n    static  BOOL            ShowHelp( const String& rKeyword, BOOL bShowInHelpAgent, const char* pFileName = 0 );\n    static  void            ShowHint( ULONG nId );\n    static  void            SetCustomHelpFile( const String& rName );\n    static  USHORT          GetHelpFileInfoCount();\n    static  HelpFileInfo*   GetHelpFileInfo( USHORT n );\n};\n\nBOOL SfxHelp::ShowHelp( ULONG nId, BOOL bShowInHelpAgent, const char* pFileName, BOOL bQuiet )\n{\n    return FALSE;\n}\n\nBOOL SfxHelp::ShowHelp( const String& rKeyword, BOOL bShowInHelpAgent, const char* pFileName )\n{\n    return FALSE;\n}\n\nvoid SfxHelp::ShowHint( ULONG nId )\n{\n}\n\nvoid SfxHelp::SetCustomHelpFile( const String& rName )\n{\n}\n\nUSHORT SfxHelp::GetHelpFileInfoCount()\n{\n    return 0;\n}\n\nHelpFileInfo* SfxHelp::GetHelpFileInfo( USHORT n )\n{\n    return NULL;\n}\n\nclass SfxHelpPI\n{\npublic:\n    void            LoadTopic( const String& rFileName, ULONG nId );\n    void            LoadTopic( ULONG nId );\n    void            LoadTopic( const String& rKeyword );\n    void            ResetTopic();\n    BOOL            Close();\n\/\/    BOOL            IsConstructed() const { return ( pHelpPI != 0 ); }\n    String          GetExtraInfo() const;\n\/\/    HelpPI*         GetHelpPI() const { return pHelpPI; }\n\/\/    virtual void    FillInfo( SfxChildWinInfo& ) const;\n    void            SetTip( ULONG nId );\n    void            SetTipText( const String& rText );\n\/\/    BOOL            IsInShowMe() const { return bInShowMe; }\n\/\/    BOOL            IsTopicJustRequested() const { return aTopicJustRequestedTimer.IsActive(); }\n\/\/    void            SetTopicJustRequested( BOOL bOn ) { if( bOn )\n\/\/                                                            aTopicJustRequestedTimer.Start();\n\/\/                                                        else\n\/\/                                                            aTopicJustRequestedTimer.Stop(); }\n};\n\nvoid SfxHelpPI::LoadTopic( const String& rFileName, ULONG nId ) {}\nvoid SfxHelpPI::LoadTopic( ULONG nId ) {}\nvoid SfxHelpPI::LoadTopic( const String& rKeyword ) {}\nvoid SfxHelpPI::ResetTopic() {}\n\/\/    BOOL            IsConstructed() const { return ( pHelpPI != 0 ); }\n\/\/    HelpPI*         GetHelpPI() const { return pHelpPI; }\n\/\/    virtual void    FillInfo( SfxChildWinInfo& ) const;\nvoid SfxHelpPI::SetTip( ULONG nId ) {}\nvoid SfxHelpPI::SetTipText( const String& rText ) {}\n\nclass SfxHelpPIWrapper\n{\npublic:\n    static USHORT GetChildWindowId();\n};\n\nUSHORT SfxHelpPIWrapper::GetChildWindowId()\n{\n    return 0;\n}\n\nclass SfxHelpTipsWrapper\n{\npublic:\n    static USHORT GetChildWindowId();\n};\n\nUSHORT SfxHelpTipsWrapper::GetChildWindowId()\n{\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"tinfra\/json.h\" \/\/ we test this\n#include \"tinfra\/test.h\"\n\nSUITE(tinfra) {\n\nusing tinfra::variant;\n\nconst char* json_sample1 = \n    \"[ { \\\"name\\\": \\\"Moby Dick\\\",\"\n    \"    \\\"author\\\": \\\"Verne\\\" },\"\n    \"  { \\\"name\\\": \\\"Solaris\\\",\"\n    \"    \\\"author\\\": \\\"Lem\\\"} ]\";\nTEST(json_sample1)\n{\n    tinfra::variant r = tinfra::json_parse(json_sample1);\n\n    CHECK(r.is_array());\n    CHECK(r[0].is_dict());\n    CHECK(r[1].is_dict());\n\n    std::string  written = tinfra::json_write(r);\n    tinfra::variant reparsed = tinfra::json_parse(written);\n\n    CHECK( reparsed == r );\n}\n\nTEST(json_integer_basic)\n{\n    using tinfra::variant;\n    using tinfra::json_parse;\n    CHECK_EQUAL(variant(0), json_parse(\"0\"));\n    CHECK_EQUAL(variant(-1), json_parse(\"-1\"));\n    CHECK_EQUAL(variant(256), json_parse(\"256\"));\n    CHECK_EQUAL(variant(-2147483648), json_parse(\"-2147483648\"));\n    CHECK_EQUAL(variant(2147483647), json_parse(\"2147483647\"));\n    \n    CHECK_EQUAL(variant(-2147483648), json_parse(\"-2147483648\"));\n    CHECK_EQUAL(variant(2147483647), json_parse(\"2147483647\"));\n    \/\/CHECK_EQUAL(variant(-9223372036854775807), json_parse(\"-9223372036854775807\"));\n    \/\/CHECK_EQUAL(variant(9223372036854775807), json_parse(\"9223372036854775807\"));\n}\n\nTEST(json_string_basic)\n{\n    using tinfra::variant;\n    using tinfra::json_parse;\n    CHECK_EQUAL(variant(\"\"), json_parse(\"\\\"\\\"\"));\n    CHECK_EQUAL(variant(\"foo\"), json_parse(\"\\\"foo\\\"\"));\n    CHECK_EQUAL(variant(\"foo\\\\\\\"bar\\\"\"), json_parse(\"\\\"foo\\\\\\\\\\\\\\\"bar\\\\\\\"\\\"\"));\n    CHECK_EQUAL(variant(\"foo\\r\\nbar\\t\\b\"), json_parse(\"\\\"foo\\\\r\\\\nbar\\\\t\\\\b\\\"\"));\n}\n\nTEST(json_string_errors)\n{\n    using tinfra::json_parse;\n    \n    CHECK_THROW( json_parse(\"\\\"fooo\"), std::runtime_error);   \/\/ not finished string\n    CHECK_THROW( json_parse(\"\\\"fooo\\\\\"), std::runtime_error); \/\/ stray at end of not finished string\n    CHECK_THROW( json_parse(\"\\\"fooo\\\\\\\"\"), std::runtime_error); \/\/ not finished again\n    CHECK_THROW( json_parse(\"\\\"foo\\\\X\"), std::runtime_error); \/\/ unkown escape character\n}\nTEST(json_parse_errors)\n{\n    using tinfra::json_parse;\n    \n    CHECK_THROW( json_parse(\"{\"), std::runtime_error); \/\/ not finished\n    CHECK_THROW( json_parse(\"{ XXX: 12 }\"), std::runtime_error); \/\/ expecting string\n    CHECK_THROW( json_parse(\"{ \\\"YYY\\\" 12 }\"), std::runtime_error); \/\/ expecting colon\n}\n} \/\/ end suite tinfra\n<commit_msg>json_test: test more<commit_after>\n#include \"tinfra\/json.h\" \/\/ we test this\n#include \"tinfra\/test.h\"\n\nSUITE(tinfra) {\n\nusing tinfra::variant;\n\nconst char* json_sample1 = \n    \"[ { \\\"name\\\": \\\"Moby Dick\\\",\"\n    \"    \\\"author\\\": \\\"Verne\\\" },\"\n    \"  { \\\"name\\\": \\\"Solaris\\\",\"\n    \"    \\\"author\\\": \\\"Lem\\\"} ]\";\nTEST(json_sample1)\n{\n    tinfra::variant r = tinfra::json_parse(json_sample1);\n\n    CHECK(r.is_array());\n    CHECK(r[0].is_dict());\n    CHECK(r[1].is_dict());\n\n    CHECK_EQUAL(\"Moby Dick\", r[0][\"name\"]);\n    CHECK_EQUAL(\"Verne\", r[0][\"author\"]);\n\n    CHECK_EQUAL(\"Solaris\", r[1][\"name\"]);\n    CHECK_EQUAL(\"Lem\", r[1][\"author\"]);\n\n    std::string  written = tinfra::json_write(r);\n    tinfra::variant reparsed = tinfra::json_parse(written);\n\n    CHECK( reparsed == r );\n}\n\nTEST(json_integer_basic)\n{\n    using tinfra::variant;\n    using tinfra::json_parse;\n    CHECK_EQUAL(variant(0), json_parse(\"0\"));\n    CHECK_EQUAL(variant(-1), json_parse(\"-1\"));\n    CHECK_EQUAL(variant(256), json_parse(\"256\"));\n    CHECK_EQUAL(variant(-2147483648), json_parse(\"-2147483648\"));\n    CHECK_EQUAL(variant(2147483647), json_parse(\"2147483647\"));\n    \n    CHECK_EQUAL(variant(-2147483648), json_parse(\"-2147483648\"));\n    CHECK_EQUAL(variant(2147483647), json_parse(\"2147483647\"));\n    \/\/CHECK_EQUAL(variant(-9223372036854775807), json_parse(\"-9223372036854775807\"));\n    \/\/CHECK_EQUAL(variant(9223372036854775807), json_parse(\"9223372036854775807\"));\n}\n\nTEST(json_string_basic)\n{\n    using tinfra::variant;\n    using tinfra::json_parse;\n    CHECK_EQUAL(variant(\"\"), json_parse(\"\\\"\\\"\"));\n    CHECK_EQUAL(variant(\"foo\"), json_parse(\"\\\"foo\\\"\"));\n    CHECK_EQUAL(variant(\"foo\\\\\\\"bar\\\"\"), json_parse(\"\\\"foo\\\\\\\\\\\\\\\"bar\\\\\\\"\\\"\"));\n    CHECK_EQUAL(variant(\"foo\\r\\nbar\\t\\b\"), json_parse(\"\\\"foo\\\\r\\\\nbar\\\\t\\\\b\\\"\"));\n}\n\nTEST(json_string_errors)\n{\n    using tinfra::json_parse;\n    \n    CHECK_THROW( json_parse(\"\\\"fooo\"), std::runtime_error);   \/\/ not finished string\n    CHECK_THROW( json_parse(\"\\\"fooo\\\\\"), std::runtime_error); \/\/ stray at end of not finished string\n    CHECK_THROW( json_parse(\"\\\"fooo\\\\\\\"\"), std::runtime_error); \/\/ not finished again\n    CHECK_THROW( json_parse(\"\\\"foo\\\\X\"), std::runtime_error); \/\/ unkown escape character\n}\nTEST(json_parse_errors)\n{\n    using tinfra::json_parse;\n    \n    CHECK_THROW( json_parse(\"{\"), std::runtime_error); \/\/ not finished\n    CHECK_THROW( json_parse(\"{ XXX: 12 }\"), std::runtime_error); \/\/ expecting string\n    CHECK_THROW( json_parse(\"{ \\\"YYY\\\" 12 }\"), std::runtime_error); \/\/ expecting colon\n}\n} \/\/ end suite tinfra\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\/login\/rounded_rect_painter.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/chromeos\/login\/helper.h\"\n#include \"third_party\/skia\/include\/effects\/SkBlurMaskFilter.h\"\n#include \"third_party\/skia\/include\/effects\/SkGradientShader.h\"\n#include \"ui\/gfx\/canvas.h\"\n#include \"ui\/gfx\/skia_util.h\"\n#include \"ui\/views\/border.h\"\n#include \"ui\/views\/painter.h\"\n\nnamespace chromeos {\n\nnamespace {\n\nconst SkColor kScreenTopColor = SkColorSetRGB(250, 251, 251);\nconst SkColor kScreenBottomColor = SkColorSetRGB(204, 209, 212);\nconst SkColor kScreenShadowColor = SkColorSetARGB(64, 34, 54, 115);\nconst int kScreenShadow = 10;\n\nvoid DrawRoundedRect(gfx::Canvas* canvas,\n                     const SkRect& rect,\n                     int corner_radius,\n                     SkColor top_color,\n                     SkColor bottom_color) {\n  SkPath path;\n  path.addRoundRect(rect,\n                    SkIntToScalar(corner_radius), SkIntToScalar(corner_radius));\n  SkPaint paint;\n  paint.setStyle(SkPaint::kFill_Style);\n  paint.setFlags(SkPaint::kAntiAlias_Flag);\n  if (top_color != bottom_color) {\n    SkPoint p[2];\n    p[0].set(SkIntToScalar(rect.left()), SkIntToScalar(rect.top()));\n    p[1].set(SkIntToScalar(rect.left()), SkIntToScalar(rect.bottom()));\n    SkColor colors[2] = { top_color, bottom_color };\n    SkShader* s = SkGradientShader::CreateLinear(p, colors, NULL, 2,\n        SkShader::kClamp_TileMode, NULL);\n    paint.setShader(s);\n    \/\/ Need to unref shader, otherwise never deleted.\n    s->unref();\n  } else {\n    paint.setColor(top_color);\n  }\n\n  canvas->DrawPath(path, paint);\n}\n\nvoid DrawRoundedRectShadow(gfx::Canvas* canvas,\n                           const SkRect& rect,\n                           int corner_radius,\n                           int shadow,\n                           SkColor color) {\n  SkPaint paint;\n  paint.setFlags(SkPaint::kAntiAlias_Flag);\n  paint.setStyle(SkPaint::kFill_Style);\n  paint.setColor(color);\n  SkMaskFilter* filter = SkBlurMaskFilter::Create(\n      shadow \/ 2, SkBlurMaskFilter::kNormal_BlurStyle);\n  paint.setMaskFilter(filter)->unref();\n  SkRect inset_rect(rect);\n  inset_rect.inset(SkIntToScalar(shadow \/ 2), SkIntToScalar(shadow \/ 2));\n  canvas->sk_canvas()->drawRoundRect(\n      inset_rect,\n      SkIntToScalar(corner_radius), SkIntToScalar(corner_radius),\n      paint);\n  paint.setMaskFilter(NULL);\n}\n\nvoid DrawRectWithBorder(gfx::Canvas* canvas,\n                        const gfx::Size& size,\n                        const BorderDefinition* const border) {\n  SkRect rect(gfx::RectToSkRect(gfx::Rect(size)));\n  if (border->padding > 0) {\n    SkPaint paint;\n    paint.setColor(border->padding_color);\n    canvas->sk_canvas()->drawRect(rect, paint);\n    rect.inset(SkIntToScalar(border->padding), SkIntToScalar(border->padding));\n  }\n  if (border->shadow > 0) {\n    DrawRoundedRectShadow(canvas, rect, border->corner_radius, border->shadow,\n                          border->shadow_color);\n    rect.inset(SkIntToScalar(border->shadow), SkIntToScalar(border->shadow));\n    rect.offset(0, SkIntToScalar(-border->shadow \/ 3));\n  }\n  DrawRoundedRect(canvas, rect, border->corner_radius, border->top_color,\n                  border->bottom_color);\n}\n\n\/\/ This Painter can be used to draw a background consistent cross all login\n\/\/ screens. It draws a rect with padding, shadow and rounded corners.\nclass RoundedRectPainter : public views::Painter {\n public:\n  explicit RoundedRectPainter(const BorderDefinition* const border)\n      : border_(border) {\n  }\n\n  \/\/ Overridden from views::Painter:\n  virtual void Paint(gfx::Canvas* canvas, const gfx::Size& size) OVERRIDE {\n    DrawRectWithBorder(canvas, size, border_);\n  }\n\n private:\n  const BorderDefinition* const border_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedRectPainter);\n};\n\n\/\/ This border can be used to draw shadow and rounded corners across all\n\/\/ login screens.\nclass RoundedRectBorder : public views::Border {\n public:\n  explicit RoundedRectBorder(const BorderDefinition* const border)\n      : border_(border) {\n  }\n\n  virtual void Paint(const views::View& view, gfx::Canvas* canvas) const;\n  virtual void GetInsets(gfx::Insets* insets) const;\n\n private:\n  const BorderDefinition* const border_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedRectBorder);\n};\n\nvoid RoundedRectBorder::Paint(const views::View& view,\n                              gfx::Canvas* canvas) const {\n  \/\/ Don't paint anything. RoundedRectBorder is used to provide insets only.\n}\n\nvoid RoundedRectBorder::GetInsets(gfx::Insets* insets) const {\n  DCHECK(insets);\n  int shadow = border_->shadow;\n  int inset = border_->corner_radius \/ 2 + border_->padding + shadow;\n  insets->Set(inset - shadow \/ 3, inset, inset + shadow \/ 3, inset);\n}\n\n\/\/ Simple solid round background.\nclass RoundedBackground : public views::Background {\n public:\n  RoundedBackground(int corner_radius,\n                    int stroke_width,\n                    const SkColor& background_color,\n                    const SkColor& stroke_color)\n      : corner_radius_(corner_radius),\n        stroke_width_(stroke_width),\n        stroke_color_(stroke_color) {\n    SetNativeControlColor(background_color);\n  }\n\n  virtual void Paint(gfx::Canvas* canvas, views::View* view) const {\n    SkRect rect;\n    rect.iset(0, 0, view->width(), view->height());\n    SkPath path;\n    path.addRoundRect(rect,\n                      SkIntToScalar(corner_radius_),\n                      SkIntToScalar(corner_radius_));\n    \/\/ Draw interior.\n    SkPaint paint;\n    paint.setStyle(SkPaint::kFill_Style);\n    paint.setFlags(SkPaint::kAntiAlias_Flag);\n    paint.setColor(get_color());\n    canvas->DrawPath(path, paint);\n    \/\/ Redraw boundary region with correspoinding color.\n    paint.setStyle(SkPaint::kStroke_Style);\n    paint.setStrokeWidth(SkIntToScalar(stroke_width_));\n    paint.setColor(stroke_color_);\n    canvas->DrawPath(path, paint);\n  }\n\n private:\n  int corner_radius_;\n  int stroke_width_;\n  SkColor stroke_color_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedBackground);\n};\n\n}  \/\/ namespace\n\n\/\/ static\nconst BorderDefinition BorderDefinition::kScreenBorder = {\n  0,\n  SK_ColorBLACK,\n  kScreenShadow,\n  kScreenShadowColor,\n  login::kScreenCornerRadius,\n  kScreenTopColor,\n  kScreenBottomColor\n};\n\nconst BorderDefinition BorderDefinition::kUserBorder = {\n  0,\n  SK_ColorBLACK,\n  0,\n  kScreenShadowColor,\n  login::kUserCornerRadius,\n  kScreenTopColor,\n  kScreenBottomColor\n};\n\nviews::Painter* CreateWizardPainter(const BorderDefinition* const border) {\n  return new RoundedRectPainter(border);\n}\n\nviews::Border* CreateWizardBorder(const BorderDefinition* const border) {\n  return new RoundedRectBorder(border);\n}\n\nviews::Background* CreateRoundedBackground(int corner_radius,\n                                           int stroke_width,\n                                           SkColor background_color,\n                                           SkColor stroke_color) {\n  return new RoundedBackground(\n      corner_radius, stroke_width, background_color, stroke_color);\n}\n\n}  \/\/ namespace chromeos\n<commit_msg>chromeos: Do not pass SkColor by const-reference as it's defined as POD(integer).<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\/login\/rounded_rect_painter.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/chromeos\/login\/helper.h\"\n#include \"third_party\/skia\/include\/effects\/SkBlurMaskFilter.h\"\n#include \"third_party\/skia\/include\/effects\/SkGradientShader.h\"\n#include \"ui\/gfx\/canvas.h\"\n#include \"ui\/gfx\/skia_util.h\"\n#include \"ui\/views\/border.h\"\n#include \"ui\/views\/painter.h\"\n\nnamespace chromeos {\n\nnamespace {\n\nconst SkColor kScreenTopColor = SkColorSetRGB(250, 251, 251);\nconst SkColor kScreenBottomColor = SkColorSetRGB(204, 209, 212);\nconst SkColor kScreenShadowColor = SkColorSetARGB(64, 34, 54, 115);\nconst int kScreenShadow = 10;\n\nvoid DrawRoundedRect(gfx::Canvas* canvas,\n                     const SkRect& rect,\n                     int corner_radius,\n                     SkColor top_color,\n                     SkColor bottom_color) {\n  SkPath path;\n  path.addRoundRect(rect,\n                    SkIntToScalar(corner_radius), SkIntToScalar(corner_radius));\n  SkPaint paint;\n  paint.setStyle(SkPaint::kFill_Style);\n  paint.setFlags(SkPaint::kAntiAlias_Flag);\n  if (top_color != bottom_color) {\n    SkPoint p[2];\n    p[0].set(SkIntToScalar(rect.left()), SkIntToScalar(rect.top()));\n    p[1].set(SkIntToScalar(rect.left()), SkIntToScalar(rect.bottom()));\n    SkColor colors[2] = { top_color, bottom_color };\n    SkShader* s = SkGradientShader::CreateLinear(p, colors, NULL, 2,\n        SkShader::kClamp_TileMode, NULL);\n    paint.setShader(s);\n    \/\/ Need to unref shader, otherwise never deleted.\n    s->unref();\n  } else {\n    paint.setColor(top_color);\n  }\n\n  canvas->DrawPath(path, paint);\n}\n\nvoid DrawRoundedRectShadow(gfx::Canvas* canvas,\n                           const SkRect& rect,\n                           int corner_radius,\n                           int shadow,\n                           SkColor color) {\n  SkPaint paint;\n  paint.setFlags(SkPaint::kAntiAlias_Flag);\n  paint.setStyle(SkPaint::kFill_Style);\n  paint.setColor(color);\n  SkMaskFilter* filter = SkBlurMaskFilter::Create(\n      shadow \/ 2, SkBlurMaskFilter::kNormal_BlurStyle);\n  paint.setMaskFilter(filter)->unref();\n  SkRect inset_rect(rect);\n  inset_rect.inset(SkIntToScalar(shadow \/ 2), SkIntToScalar(shadow \/ 2));\n  canvas->sk_canvas()->drawRoundRect(\n      inset_rect,\n      SkIntToScalar(corner_radius), SkIntToScalar(corner_radius),\n      paint);\n  paint.setMaskFilter(NULL);\n}\n\nvoid DrawRectWithBorder(gfx::Canvas* canvas,\n                        const gfx::Size& size,\n                        const BorderDefinition* const border) {\n  SkRect rect(gfx::RectToSkRect(gfx::Rect(size)));\n  if (border->padding > 0) {\n    SkPaint paint;\n    paint.setColor(border->padding_color);\n    canvas->sk_canvas()->drawRect(rect, paint);\n    rect.inset(SkIntToScalar(border->padding), SkIntToScalar(border->padding));\n  }\n  if (border->shadow > 0) {\n    DrawRoundedRectShadow(canvas, rect, border->corner_radius, border->shadow,\n                          border->shadow_color);\n    rect.inset(SkIntToScalar(border->shadow), SkIntToScalar(border->shadow));\n    rect.offset(0, SkIntToScalar(-border->shadow \/ 3));\n  }\n  DrawRoundedRect(canvas, rect, border->corner_radius, border->top_color,\n                  border->bottom_color);\n}\n\n\/\/ This Painter can be used to draw a background consistent cross all login\n\/\/ screens. It draws a rect with padding, shadow and rounded corners.\nclass RoundedRectPainter : public views::Painter {\n public:\n  explicit RoundedRectPainter(const BorderDefinition* const border)\n      : border_(border) {\n  }\n\n  \/\/ Overridden from views::Painter:\n  virtual void Paint(gfx::Canvas* canvas, const gfx::Size& size) OVERRIDE {\n    DrawRectWithBorder(canvas, size, border_);\n  }\n\n private:\n  const BorderDefinition* const border_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedRectPainter);\n};\n\n\/\/ This border can be used to draw shadow and rounded corners across all\n\/\/ login screens.\nclass RoundedRectBorder : public views::Border {\n public:\n  explicit RoundedRectBorder(const BorderDefinition* const border)\n      : border_(border) {\n  }\n\n  virtual void Paint(const views::View& view, gfx::Canvas* canvas) const;\n  virtual void GetInsets(gfx::Insets* insets) const;\n\n private:\n  const BorderDefinition* const border_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedRectBorder);\n};\n\nvoid RoundedRectBorder::Paint(const views::View& view,\n                              gfx::Canvas* canvas) const {\n  \/\/ Don't paint anything. RoundedRectBorder is used to provide insets only.\n}\n\nvoid RoundedRectBorder::GetInsets(gfx::Insets* insets) const {\n  DCHECK(insets);\n  int shadow = border_->shadow;\n  int inset = border_->corner_radius \/ 2 + border_->padding + shadow;\n  insets->Set(inset - shadow \/ 3, inset, inset + shadow \/ 3, inset);\n}\n\n\/\/ Simple solid round background.\nclass RoundedBackground : public views::Background {\n public:\n  RoundedBackground(int corner_radius,\n                    int stroke_width,\n                    SkColor background_color,\n                    SkColor stroke_color)\n      : corner_radius_(corner_radius),\n        stroke_width_(stroke_width),\n        stroke_color_(stroke_color) {\n    SetNativeControlColor(background_color);\n  }\n\n  virtual void Paint(gfx::Canvas* canvas, views::View* view) const {\n    SkRect rect;\n    rect.iset(0, 0, view->width(), view->height());\n    SkPath path;\n    path.addRoundRect(rect,\n                      SkIntToScalar(corner_radius_),\n                      SkIntToScalar(corner_radius_));\n    \/\/ Draw interior.\n    SkPaint paint;\n    paint.setStyle(SkPaint::kFill_Style);\n    paint.setFlags(SkPaint::kAntiAlias_Flag);\n    paint.setColor(get_color());\n    canvas->DrawPath(path, paint);\n    \/\/ Redraw boundary region with correspoinding color.\n    paint.setStyle(SkPaint::kStroke_Style);\n    paint.setStrokeWidth(SkIntToScalar(stroke_width_));\n    paint.setColor(stroke_color_);\n    canvas->DrawPath(path, paint);\n  }\n\n private:\n  int corner_radius_;\n  int stroke_width_;\n  SkColor stroke_color_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedBackground);\n};\n\n}  \/\/ namespace\n\n\/\/ static\nconst BorderDefinition BorderDefinition::kScreenBorder = {\n  0,\n  SK_ColorBLACK,\n  kScreenShadow,\n  kScreenShadowColor,\n  login::kScreenCornerRadius,\n  kScreenTopColor,\n  kScreenBottomColor\n};\n\nconst BorderDefinition BorderDefinition::kUserBorder = {\n  0,\n  SK_ColorBLACK,\n  0,\n  kScreenShadowColor,\n  login::kUserCornerRadius,\n  kScreenTopColor,\n  kScreenBottomColor\n};\n\nviews::Painter* CreateWizardPainter(const BorderDefinition* const border) {\n  return new RoundedRectPainter(border);\n}\n\nviews::Border* CreateWizardBorder(const BorderDefinition* const border) {\n  return new RoundedRectBorder(border);\n}\n\nviews::Background* CreateRoundedBackground(int corner_radius,\n                                           int stroke_width,\n                                           SkColor background_color,\n                                           SkColor stroke_color) {\n  return new RoundedBackground(\n      corner_radius, stroke_width, background_color, stroke_color);\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\/history\/web_history_service_factory.h\"\n\n#include \"base\/command_line.h\"\n#include \"chrome\/browser\/content_settings\/cookie_settings.h\"\n#include \"chrome\/browser\/history\/web_history_service.h\"\n#include \"chrome\/browser\/signin\/token_service_factory.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_factory.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"components\/browser_context_keyed_service\/browser_context_dependency_manager.h\"\n\nnamespace {\n\/\/ Returns true if the user is signed in and full history sync is enabled,\n\/\/ and false otherwise.\nbool IsHistorySyncEnabled(Profile* profile) {\n  if (!CommandLine::ForCurrentProcess()->HasSwitch(\n          switches::kHistoryDisableFullHistorySync)) {\n    ProfileSyncService* sync =\n        ProfileSyncServiceFactory::GetInstance()->GetForProfile(profile);\n    return sync &&\n        sync->sync_initialized() &&\n        sync->GetActiveDataTypes().Has(syncer::HISTORY_DELETE_DIRECTIVES);\n  }\n  return false;\n}\n\n}  \/\/ namespace\n\n\/\/ static\nWebHistoryServiceFactory* WebHistoryServiceFactory::GetInstance() {\n  return Singleton<WebHistoryServiceFactory>::get();\n}\n\n\/\/ static\nhistory::WebHistoryService* WebHistoryServiceFactory::GetForProfile(\n      Profile* profile) {\n  if (IsHistorySyncEnabled(profile)) {\n    return static_cast<history::WebHistoryService*>(\n        GetInstance()->GetServiceForBrowserContext(profile, true));\n  }\n  return NULL;\n}\n\nBrowserContextKeyedService* WebHistoryServiceFactory::BuildServiceInstanceFor(\n    content::BrowserContext* context) const {\n  Profile* profile = static_cast<Profile*>(context);\n\n  \/\/ Ensure that the service is not instantiated or used if the user is not\n  \/\/ signed into sync, or if web history is not enabled.\n  return IsHistorySyncEnabled(profile) ?\n      new history::WebHistoryService(profile) : NULL;\n}\n\nWebHistoryServiceFactory::WebHistoryServiceFactory()\n    : BrowserContextKeyedServiceFactory(\n        \"WebHistoryServiceFactory\",\n        BrowserContextDependencyManager::GetInstance()) {\n  DependsOn(TokenServiceFactory::GetInstance());\n  DependsOn(CookieSettings::Factory::GetInstance());\n}\n\nWebHistoryServiceFactory::~WebHistoryServiceFactory() {\n}\n<commit_msg>Cleanup: web history does not depend on TokenService, it depends on ProfileOAuth2TokenService.<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\/history\/web_history_service_factory.h\"\n\n#include \"base\/command_line.h\"\n#include \"chrome\/browser\/content_settings\/cookie_settings.h\"\n#include \"chrome\/browser\/history\/web_history_service.h\"\n#include \"chrome\/browser\/signin\/profile_oauth2_token_service_factory.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_factory.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"components\/browser_context_keyed_service\/browser_context_dependency_manager.h\"\n\nnamespace {\n\/\/ Returns true if the user is signed in and full history sync is enabled,\n\/\/ and false otherwise.\nbool IsHistorySyncEnabled(Profile* profile) {\n  if (!CommandLine::ForCurrentProcess()->HasSwitch(\n          switches::kHistoryDisableFullHistorySync)) {\n    ProfileSyncService* sync =\n        ProfileSyncServiceFactory::GetInstance()->GetForProfile(profile);\n    return sync &&\n        sync->sync_initialized() &&\n        sync->GetActiveDataTypes().Has(syncer::HISTORY_DELETE_DIRECTIVES);\n  }\n  return false;\n}\n\n}  \/\/ namespace\n\n\/\/ static\nWebHistoryServiceFactory* WebHistoryServiceFactory::GetInstance() {\n  return Singleton<WebHistoryServiceFactory>::get();\n}\n\n\/\/ static\nhistory::WebHistoryService* WebHistoryServiceFactory::GetForProfile(\n      Profile* profile) {\n  if (IsHistorySyncEnabled(profile)) {\n    return static_cast<history::WebHistoryService*>(\n        GetInstance()->GetServiceForBrowserContext(profile, true));\n  }\n  return NULL;\n}\n\nBrowserContextKeyedService* WebHistoryServiceFactory::BuildServiceInstanceFor(\n    content::BrowserContext* context) const {\n  Profile* profile = static_cast<Profile*>(context);\n\n  \/\/ Ensure that the service is not instantiated or used if the user is not\n  \/\/ signed into sync, or if web history is not enabled.\n  return IsHistorySyncEnabled(profile) ?\n      new history::WebHistoryService(profile) : NULL;\n}\n\nWebHistoryServiceFactory::WebHistoryServiceFactory()\n    : BrowserContextKeyedServiceFactory(\n        \"WebHistoryServiceFactory\",\n        BrowserContextDependencyManager::GetInstance()) {\n  DependsOn(CookieSettings::Factory::GetInstance());\n  DependsOn(ProfileOAuth2TokenServiceFactory::GetInstance());\n}\n\nWebHistoryServiceFactory::~WebHistoryServiceFactory() {\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * File:   Class.cpp\n * Author: tjoppen\n * \n * Created on February 14, 2010, 4:20 PM\n *\/\n\n#include \"Class.h\"\n#include <sstream>\n#include <stdexcept>\n#include <iostream>\n#include <boost\/shared_ptr.hpp>\n\nusing namespace std;\n\nClass::Class(FullName name, ClassType type) : name(name), type(type), \n        base(NULL), isBasic(false), isDocument(false), hasBase(false) {\n}\n\nClass::Class(FullName name, ClassType type, FullName baseType) : name(name),\n        type(type), base(NULL), isBasic(false), isDocument(false),\n        hasBase(true), baseType(baseType) {\n}\n\nClass::~Class() {\n}\n\nvoid Class::addMember(string name, Member memberInfo) {\n    if(members.find(name) != members.end())\n        throw runtime_error(\"Member \" + name + \" defined more than once in \" + this->name.second);\n\n    cout << this->name.second << \" got \" << memberInfo.type.first << \":\" << memberInfo.type.second << \" \" << name << \". Occurance: \";\n\n    if(memberInfo.maxOccurs == UNBOUNDED) {\n        cout << \"at least \" << memberInfo.minOccurs;\n    } else if(memberInfo.minOccurs == memberInfo.maxOccurs) {\n        cout << \"exactly \" << memberInfo.minOccurs;\n    } else {\n        cout << \"between \" << memberInfo.minOccurs << \"-\" << memberInfo.maxOccurs;\n    }\n\n    cout << endl;\n\n    members[name] = memberInfo;\n}\n\n\/**\n * Default implementation of generateAppender()\n *\/\nstring Class::generateAppender() const {\n    ostringstream oss;\n    \n    for(std::map<std::string, Member>::const_iterator it = members.begin(); it != members.end(); it++) {\n        string name = it->first;\n        string setterName = it->first;\n        string nodeName = name + \"Node\";\n\n        if(it->second.isArray()) {\n            setterName = \"(*it)\";\n            oss << \"for(\" << it->second.getType() << \"::const_iterator it = \" << name << \".begin(); it != \" << name << \".end(); it++) {\" << endl;\n        } else if(!it->second.isRequired()) {\n            \/\/insert a non-null check\n            oss << \"if(\" << name << \") {\" << endl;\n        }\n\n        oss << \"DOMElement *\" << nodeName << \" = node->getOwnerDocument()->createElement(X(\\\"\" << name << \"\\\"));\" << endl;\n        oss << it->second.cl->generateNodeSetter(setterName, nodeName) << endl;\n        oss << \"node->appendChild(\" << nodeName << \");\" << endl;\n\n        if(it->second.isArray() || !it->second.isRequired())\n            oss << \"}\" << endl;\n\n        oss << endl;\n    }\n\n    return oss.str();\n}\n\/\/systemet?\nstring Class::generateNodeSetter(string memberName, string nodeName) const {\n    return memberName + \"->appendChildren(\" + nodeName + \");\";\n}\n\nstring Class::generateParser() const {\n    return \"\";\n}\n\nstring Class::generateMemberSetter(string memberName, string nodeName) const {\n    return memberName + \"->parseNode(\" + nodeName + \");\";\n}\n\nstring Class::getClassname() const {\n    return name.second;\n}\n\nstring Class::getClassType() const {\n    if(isBasic)\n        return getClassname();\n    else\n        return \"boost::shared_ptr<\" + name.second + \">\";\n}\n\nstring Class::getBaseClassname() const {\n    return hasBase ? base->getClassname() : \"james::XMLObject\";\n}\n\nstring Class::getBaseHeader() const {\n    return hasBase ? base->getClassname() + \".h\" : \"XMLObject.h\";\n}\n\nvoid Class::writeImplementation(ostream& os) const {\n    \/\/cout << \"writeImplementation()\" << endl;\n    ClassName className = name.second;\n\n    os << \"#include <sstream>\" << endl;\n    os << \"#include <xercesc\/dom\/DOMDocument.hpp>\" << endl;\n    os << \"#include <xercesc\/dom\/DOMElement.hpp>\" << endl;\n    os << \"#include \\\"XercesString.h\\\"\" << endl;\n    os << \"#include \\\"\" << className << \".h\\\"\" << endl;\n\n    \/\/include headers of all non-basic member types that aren't us\n    for(map<string, Member>::const_iterator it = members.begin(); it != members.end(); it++)\n        if(!it->second.cl->isBasic && it->second.cl != this)\n            os << \"#include \\\"\" << it->second.cl->name.second << \".h\\\"\" << endl;\n\n    os << \"using namespace std;\" << endl;\n    os << \"using namespace xercesc;\" << endl;\n\n    \/\/constructor\n    os << className << \"::\" << className << \"() : \" << getBaseClassname() << \"() {\";\n    \n    \/\/give all basic optional members a default value of zero\n    for(map<string, Member>::const_iterator it = members.begin(); it != members.end(); it++)\n        if(!it->second.isArray() && !it->second.isRequired() && it->second.cl->isBasic)\n            os << it->first << \" = 0;\" << endl;\n\n    os << \"}\" << endl << endl;\n\n    \/\/method implementation\n    if(isDocument) {\n        os << \"std::string \" << className << \"::getName() const {\" << endl;\n        os << \"return \\\"\" << className << \"\\\";\" << endl;\n        os << \"}\" << endl;\n    } else {\n        os << \"void \" << className << \"::appendChildren(xercesc::DOMNode *node) const {\" << endl;\n        \n        \/\/call base appender\n        if(hasBase)\n            os << base->name.second << \"::appendChildren(node);\" << endl;\n\n        os << generateAppender() << endl;\n        os << \"}\" << endl << endl;\n\n        os << \"void \" << className << \"::parseNode(xercesc::DOMNode *node) {\" << endl;\n        os << generateParser() << endl;\n        os << \"}\" << endl << endl;\n    }\n}\n\nvoid Class::writeHeader(ostream& os) const {\n    ClassName className = name.second;\n\n    os << \"#ifndef _\" << className << \"_H\" << endl;\n    os << \"#define _\" << className << \"_H\" << endl;\n\n    os << \"#include <vector>\" << endl;\n    os << \"#include <boost\/shared_ptr.hpp>\" << endl;\n    os << \"#include \\\"\" << getBaseHeader() << \"\\\"\" << endl;\n\n    if(isDocument)\n        os << \"#include \\\"XMLDocument.h\\\"\" << endl;\n\n    \/\/non-basic member class prototypes\n    for(map<string, Member>::const_iterator it = members.begin(); it != members.end(); it++)\n        if(!it->second.cl->isBasic)\n            os << \"class \" << it->second.cl->getClassname() << \";\" << endl;\n\n    os << \"class \" << className << \" : public \" << getBaseClassname();\n    \n    if(isDocument)\n        os << \", public james::XMLDocument\" << endl;\n\n    os << \" {\" << endl;\n    os << \"public:\" << endl;\n\n    os << className << \"();\" << endl;\n\n    \/\/prototypes\n    if(isDocument)\n        os << \"std::string getName() const;\" << endl;\n    else {\n        os << \"void appendChildren(xercesc::DOMNode *node) const;\" << endl;\n        os << \"void parseNode(xercesc::DOMNode *node);\" << endl;\n    }\n    \n    \/\/members\n    for(map<string, Member>::const_iterator it = members.begin(); it != members.end(); it++) {\n        os << it->second.getType() << \" \" << it->first << \";\" << endl;\n    }\n\n    os << \"};\" << endl;\n\n    os << \"#endif \/\/_\" << className << \"_H\" << endl;\n}\n\nbool Class::Member::isArray() const {\n    return maxOccurs > 1 || maxOccurs == UNBOUNDED;\n}\n\nbool Class::Member::isRequired() const {\n    return minOccurs >= 1;\n}\n\nstring Class::Member::getType() const {\n    \/\/vector if array, regular member otherwise\n    if(isArray()) {\n        return \"std::vector<\" + cl->getClassType() + \" >\";\n    } else\n        return cl->getClassType();\n}\n<commit_msg>Basic node parsing generated. Needs check for NULL shared_ptr and such.<commit_after>\/* \n * File:   Class.cpp\n * Author: tjoppen\n * \n * Created on February 14, 2010, 4:20 PM\n *\/\n\n#include \"Class.h\"\n#include <sstream>\n#include <stdexcept>\n#include <iostream>\n#include <boost\/shared_ptr.hpp>\n\nusing namespace std;\n\nClass::Class(FullName name, ClassType type) : name(name), type(type), \n        base(NULL), isBasic(false), isDocument(false), hasBase(false) {\n}\n\nClass::Class(FullName name, ClassType type, FullName baseType) : name(name),\n        type(type), base(NULL), isBasic(false), isDocument(false),\n        hasBase(true), baseType(baseType) {\n}\n\nClass::~Class() {\n}\n\nvoid Class::addMember(string name, Member memberInfo) {\n    if(members.find(name) != members.end())\n        throw runtime_error(\"Member \" + name + \" defined more than once in \" + this->name.second);\n\n    cout << this->name.second << \" got \" << memberInfo.type.first << \":\" << memberInfo.type.second << \" \" << name << \". Occurance: \";\n\n    if(memberInfo.maxOccurs == UNBOUNDED) {\n        cout << \"at least \" << memberInfo.minOccurs;\n    } else if(memberInfo.minOccurs == memberInfo.maxOccurs) {\n        cout << \"exactly \" << memberInfo.minOccurs;\n    } else {\n        cout << \"between \" << memberInfo.minOccurs << \"-\" << memberInfo.maxOccurs;\n    }\n\n    cout << endl;\n\n    members[name] = memberInfo;\n}\n\n\/**\n * Default implementation of generateAppender()\n *\/\nstring Class::generateAppender() const {\n    ostringstream oss;\n    \n    for(std::map<std::string, Member>::const_iterator it = members.begin(); it != members.end(); it++) {\n        string name = it->first;\n        string setterName = it->first;\n        string nodeName = name + \"Node\";\n\n        if(it->second.isArray()) {\n            setterName = \"(*it)\";\n            oss << \"for(\" << it->second.getType() << \"::const_iterator it = \" << name << \".begin(); it != \" << name << \".end(); it++) {\" << endl;\n        } else if(!it->second.isRequired()) {\n            \/\/insert a non-null check\n            oss << \"if(\" << name << \") {\" << endl;\n        } else {\n            \/\/required member - check for its existance\n        }\n\n        oss << \"DOMElement *\" << nodeName << \" = node->getOwnerDocument()->createElement(X(\\\"\" << name << \"\\\"));\" << endl;\n        oss << it->second.cl->generateNodeSetter(setterName, nodeName) << endl;\n        oss << \"node->appendChild(\" << nodeName << \");\" << endl;\n\n        if(it->second.isArray() || !it->second.isRequired())\n            oss << \"}\" << endl;\n\n        oss << endl;\n    }\n\n    return oss.str();\n}\n\/\/systemet?\nstring Class::generateNodeSetter(string memberName, string nodeName) const {\n    return memberName + \"->appendChildren(\" + nodeName + \");\";\n}\n\nstring Class::generateParser() const {\n    ostringstream oss;\n\n    oss << \"for(DOMNode *child = node->getFirstChild(); child; child = child->getNextSibling()) {\" << endl;\n    oss << \"if(!child->getLocalName()) continue;\" << endl;\n    oss << \"XercesString name(child->getLocalName());\" << endl;\n\n    \/\/TODO: replace this with a map<pair<string, DOMNode::ElementType>, void(*)(DOMNode*)> thing?\n    \/\/in other words, lookin up parsing function pointers in a map should be faster then all these string comparisons\n    for(std::map<std::string, Member>::const_iterator it = members.begin(); it != members.end(); it++) {\n        oss << \"if(name == \\\"\" << it->first << \"\\\" && child->getNodeType() == DOMNode::\" << (it->second.isAttribute ? \"ATTRIBUTE_NODE\" : \"ELEMENT_NODE\") << \") {\" << endl;\n\n        string memberName = it->first;\n        if(it->second.isArray()) {\n            oss << it->second.cl->getClassType() << \" temp;\" << endl;\n            memberName = \"temp\";\n        }\n\n        oss << it->second.cl->generateMemberSetter(memberName, \"child\");\n\n        oss << \"}\" << endl;\n    }\n\n    oss << \"}\" << endl;\n\n    return oss.str();\n}\n\nstring Class::generateMemberSetter(string memberName, string nodeName) const {\n    ostringstream oss;\n\n    \/\/TODO: add check & allocation for shared_ptr if non-basic\n    \n    oss << memberName << \"->parseNode(\" << nodeName << \");\" << endl;\n\n    return oss.str();\n}\n\nstring Class::getClassname() const {\n    return name.second;\n}\n\nstring Class::getClassType() const {\n    if(isBasic)\n        return getClassname();\n    else\n        return \"boost::shared_ptr<\" + name.second + \">\";\n}\n\nstring Class::getBaseClassname() const {\n    return hasBase ? base->getClassname() : \"james::XMLObject\";\n}\n\nstring Class::getBaseHeader() const {\n    return hasBase ? base->getClassname() + \".h\" : \"XMLObject.h\";\n}\n\nvoid Class::writeImplementation(ostream& os) const {\n    \/\/cout << \"writeImplementation()\" << endl;\n    ClassName className = name.second;\n\n    os << \"#include <sstream>\" << endl;\n    os << \"#include <xercesc\/dom\/DOMDocument.hpp>\" << endl;\n    os << \"#include <xercesc\/dom\/DOMElement.hpp>\" << endl;\n    os << \"#include \\\"XercesString.h\\\"\" << endl;\n    os << \"#include \\\"\" << className << \".h\\\"\" << endl;\n\n    \/\/include headers of all non-basic member types that aren't us\n    for(map<string, Member>::const_iterator it = members.begin(); it != members.end(); it++)\n        if(!it->second.cl->isBasic && it->second.cl != this)\n            os << \"#include \\\"\" << it->second.cl->name.second << \".h\\\"\" << endl;\n\n    os << \"using namespace std;\" << endl;\n    os << \"using namespace xercesc;\" << endl;\n\n    \/\/constructor\n    os << className << \"::\" << className << \"() : \" << getBaseClassname() << \"() {\";\n    \n    \/\/give all basic optional members a default value of zero\n    for(map<string, Member>::const_iterator it = members.begin(); it != members.end(); it++)\n        if(!it->second.isArray() && !it->second.isRequired() && it->second.cl->isBasic)\n            os << it->first << \" = 0;\" << endl;\n\n    os << \"}\" << endl << endl;\n\n    \/\/method implementation\n    if(isDocument) {\n        os << \"std::string \" << className << \"::getName() const {\" << endl;\n        os << \"return \\\"\" << className << \"\\\";\" << endl;\n        os << \"}\" << endl;\n    } else {\n        os << \"void \" << className << \"::appendChildren(xercesc::DOMNode *node) const {\" << endl;\n        \n        \/\/call base appender\n        if(hasBase)\n            os << base->name.second << \"::appendChildren(node);\" << endl;\n\n        os << generateAppender() << endl;\n        os << \"}\" << endl << endl;\n\n        os << \"void \" << className << \"::parseNode(xercesc::DOMNode *node) {\" << endl;\n        os << generateParser() << endl;\n        os << \"}\" << endl << endl;\n    }\n}\n\nvoid Class::writeHeader(ostream& os) const {\n    ClassName className = name.second;\n\n    os << \"#ifndef _\" << className << \"_H\" << endl;\n    os << \"#define _\" << className << \"_H\" << endl;\n\n    os << \"#include <vector>\" << endl;\n    os << \"#include <boost\/shared_ptr.hpp>\" << endl;\n    os << \"#include \\\"\" << getBaseHeader() << \"\\\"\" << endl;\n\n    if(isDocument)\n        os << \"#include \\\"XMLDocument.h\\\"\" << endl;\n\n    \/\/non-basic member class prototypes\n    for(map<string, Member>::const_iterator it = members.begin(); it != members.end(); it++)\n        if(!it->second.cl->isBasic)\n            os << \"class \" << it->second.cl->getClassname() << \";\" << endl;\n\n    os << \"class \" << className << \" : public \" << getBaseClassname();\n    \n    if(isDocument)\n        os << \", public james::XMLDocument\" << endl;\n\n    os << \" {\" << endl;\n    os << \"public:\" << endl;\n\n    os << className << \"();\" << endl;\n\n    \/\/prototypes\n    if(isDocument)\n        os << \"std::string getName() const;\" << endl;\n    else {\n        os << \"void appendChildren(xercesc::DOMNode *node) const;\" << endl;\n        os << \"void parseNode(xercesc::DOMNode *node);\" << endl;\n    }\n    \n    \/\/members\n    for(map<string, Member>::const_iterator it = members.begin(); it != members.end(); it++) {\n        os << it->second.getType() << \" \" << it->first << \";\" << endl;\n    }\n\n    os << \"};\" << endl;\n\n    os << \"#endif \/\/_\" << className << \"_H\" << endl;\n}\n\nbool Class::Member::isArray() const {\n    return maxOccurs > 1 || maxOccurs == UNBOUNDED;\n}\n\nbool Class::Member::isRequired() const {\n    return minOccurs >= 1;\n}\n\nstring Class::Member::getType() const {\n    \/\/vector if array, regular member otherwise\n    if(isArray()) {\n        return \"std::vector<\" + cl->getClassType() + \" >\";\n    } else\n        return cl->getClassType();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n#include \"Math\/SVector.h\"\n#include \"Math\/SMatrix.h\"\n\n#include <iostream>\n#include <vector>\n\nusing namespace ROOT::Math;\n\nusing std::cout;\nusing std::endl;\n\n\n\/\/#define TEST_STATIC_CHECK  \/\/ for testing compiler failures (static check)\n\n#define XXX\n\nint test1() { \n\n  SVector<float,3> x(4,5,6);\n  SVector<float,2> y(2.0,3.0);\n  cout << \"x: \" << x << endl;\n  cout << \"y: \" << y << endl;\n\n  float yy1=2.; float yy2 = 3;\n  SVector<float,2> y2(yy1,yy2);\n  \n  \n  SMatrix<float,4,3> A;\n  SMatrix<float,2,2> B;\n  \n  A.Place_in_row(y, 1, 1);\n  A.Place_in_col(x + 2, 1, 0);\n  A.Place_at(B , 2, 1);\n  cout << \"A: \" << endl << A << endl;\n  \n#ifdef TEST_STATIC_CHECK\n  \/\/ create a vector of size 2 from 3 arguments\n  SVector<float, 2> v(1,2,3);\n#endif\n  \n  \/\/ test STL interface\n  \n  \/\/double p[2] = {1,2};\n  double m[4] = {1,2,3,4};\n  \n  \/\/SVector<float, 2> sp(p,2);\n  SMatrix<float, 2,2> sm(m,4);\n\n  \/\/cout << \"sp: \" << endl << sp << endl;\n  cout << \"sm: \" << endl << sm << endl;\n\n  \/\/std::vector<float> vp(sp.begin(), sp.end() );\n  std::vector<float> vm(sm.begin(), sm.end() );\n\n  \/\/SVector<float, 2> sp2(vp.begin(),vp.end());\n  \/\/SVector<float, 2> sp2(vp.begin(),vp.size());\n  SMatrix<float, 2,2> sm2(vm.begin(),vm.end());\n\n  \/\/if ( sp2 != sp) { cout << \"Test STL interface for SVector failed\" << endl; return -1; }\n  if ( sm2 != sm) { cout << \"Test STL interface for SMatrix failed\" << endl; return -1; }\n    \n  return 0;\n    \n}\n\nint test2() { \n#ifdef XXX\n  SMatrix<double,3> A;\n  A(0,0) = A(1,0) = 1;\n  A(0,1) = 3;\n  A(1,1) = A(2,2) = 2;\n  cout << \"A: \" << endl << A << endl;\n\n  SVector<double,3> x = A.Row(0);\n  cout << \"x: \" << x << endl;\n\n  SVector<double,3> y = A.Col(1);\n  cout << \"y: \" << y << endl;\n\n  return 0;\n#endif\n}\n\nint test3() { \n#ifdef XXX\n  SMatrix<double,3> A;\n  A(0,0) = A(0,1) = A(1,0) = 1;\n  A(1,1) = A(2,2) = 2;\n\n  SMatrix<double,3> B = A; \/\/ save A in B\n  cout << \"A: \" << endl << A << endl;\n\n  double det = 0.;\n  A.Sdet(det);\n  cout << \"Determinant: \" << det << endl;\n  \/\/ WARNING: A has changed!!\n  cout << \"A again: \" << endl << A << endl;\n\n  A.Sinvert();\n  cout << \"A^-1: \" << endl << A << endl;\n\n  \/\/ check if this is really the inverse:\n  cout << \"A^-1 * B: \" << endl << A * B << endl;\n\n  return 0;\n#endif\n}\n\nint test4() { \n#ifdef XXX\n  SMatrix<double,3> A;\n  A(0,0) = A(0,1) = A(1,0) = 1;\n  A(1,1) = A(2,2) = 2;\n  cout << \" A: \" << endl << A << endl;\n\n  SVector<double,3> x(1,2,3);\n  cout << \"x: \" << x << endl;\n\n  \/\/ we add 1 to each component of x and A\n  cout << \" (x+1)^T * (A+1) * (x+1): \" << Product(x+1,A+1) << endl;\n\n  return 0;\n#endif\n}\n\nint test5() { \n#ifdef XXX\n  SMatrix<float,4,3> A;\n  A(0,0) = A(0,1) = A(1,1) = A(2,2) = 4.;\n  A(2,3) = 1.;\n  cout << \"A: \" << endl << A << endl;\n  SVector<float,4> x(1,2,3,4);\n  cout << \" x: \" << x << endl;\n  SVector<float,3> a(1,2,3);\n  cout << \" a: \" << a << endl;\n  SVector<float,4> y = x + A * a;\n  \/\/    SVector<float,4> y = A * a;\n  cout << \" y: \" << y << endl;\n\n  SVector<float,3> b = (x+1) * (A+1);\n  cout << \" b: \" << b << endl;\n\n  return 0;\n#endif\n}\n\nint test6() { \n#ifdef XXX\n  SMatrix<float,4,2> A;\n  A(0,0) = A(0,1) = A(1,1) = A(2,0) = A(3,1) = 4.;\n  cout << \"A: \" << endl << A << endl;\n  \n  SMatrix<float,2,3> S;\n  S(0,0) = S(0,1) = S(1,1) = S(0,2) = 1.;\n  cout << \" S: \" << endl << S << endl;\n  \n  SMatrix<float,4,3> C = A * S;\n  cout << \" C: \" << endl << C << endl;\n  \n  return 0;\n#endif\n}\n\nint test7() { \n#ifdef XXX\n  SVector<float,3>    xv(4,4,4);\n  SVector<float,3>    yv(5,5,5);\n  SVector<float,2>    zv(64,64);\n  SMatrix<float,2,3>  x; \n  x.Place_in_row(xv,0,0);\n  x.Place_in_row(xv,1,0);\n  SMatrix<float,2,3>  y;  \n  y.Place_in_row(yv,0,0);\n  y.Place_in_row(yv,1,0);\n  SMatrix<float,2,3>  z;\n  z.Place_in_col(zv,0,0);\n  z.Place_in_col(zv,0,1);\n  z.Place_in_col(zv,0,2);\n\n  \/\/ element wise multiplication\n  cout << \"x * y: \" << endl << times(x, -y) << endl;\n\n  x += z - y;\n  cout << \"x += z - y: \" << endl << x << endl;\n\n  \/\/ element wise square root\n  cout << \"sqrt(z): \" << endl << sqrt(z) << endl;\n\n  \/\/ element wise multiplication with constant\n  cout << \"2 * y: \" << endl << 2 * y << endl;\n\n  \/\/ a more complex expression\n  cout << \"fabs(-z + 3*x): \" << endl << fabs(-z + 3*x) << endl;\n\n  return 0;\n#endif\n}\n\nint test8() { \n#ifdef XXX\n  SMatrix<float,2,3> A;\n  SVector<float,3>    av1(5.,15.,5.);\n  SVector<float,3>    av2(15.,5.,15.);\n  A.Place_in_row(av1,0,0);\n  A.Place_in_row(av2,1,0);\n  \n  cout << \"A: \" << endl << A << endl;\n\n  SVector<float,3>    x(1,2,3);\n  SVector<float,3>    y(4,5,6);\n\n  cout << \"dot(x,y): \" << Dot(x,y) << endl;\n\n  cout << \"mag(x): \" << Mag(x) << endl;\n\n  cout << \"cross(x,y): \" << Cross(x,y) << endl;\n\n  cout << \"unit(x): \" << Unit(x) << endl;\n\n  SVector<float,3>    z(4,16,64);\n  cout << \"x + y: \" << x+y << endl;\n\n  cout << \"x * y: \" << x * -y << endl;\n  x += z - y;\n  cout << \"x += z - y: \" << x << endl;\n\n  \/\/ element wise square root\n  cout << \"sqrt(z): \" << sqrt(z) << endl;\n\n  \/\/ element wise multiplication with constant\n  cout << \"2 * y: \" << 2 * y << endl;\n\n  \/\/ a more complex expression\n  cout << \"fabs(-z + 3*x): \" << fabs(-z + 3*x) << endl;\n\n  SVector<float,4> a;\n  SVector<float,2> b(1,2);\n  a.Place_at(b,2);\n  cout << \"a: \" << a << endl;\n#endif\n\n\n  return 0;\n}\n\n\n\n\n#define TEST(N)                                                                 \\\n  itest = N;                                                                    \\\n  if (test##N() == 0) std::cout << \" Test \" << itest << \"  OK \" << std::endl;   \\\n  else  {std::cout << \" Test \" << itest << \"  Failed \" << std::endl;             \\\n  return -1;}  \n\n\n\nint main(void) {\n\n  int itest;\n  TEST(1);\n  TEST(2);\n  TEST(3);\n  TEST(4);\n  TEST(5);\n  TEST(6);\n  TEST(7);\n  TEST(8);\n\n  return 0;\n}\n<commit_msg>remove a warning in the test<commit_after>#include <cmath>\n#include \"Math\/SVector.h\"\n#include \"Math\/SMatrix.h\"\n\n#include <iostream>\n#include <vector>\n\nusing namespace ROOT::Math;\n\nusing std::cout;\nusing std::endl;\n\n\n\/\/#define TEST_STATIC_CHECK  \/\/ for testing compiler failures (static check)\n\n#define XXX\n\nint test1() { \n\n  SVector<float,3> x(4,5,6);\n  SVector<float,2> y(2.0,3.0);\n  cout << \"x: \" << x << endl;\n  cout << \"y: \" << y << endl;\n\n\/\/   float yy1=2.; float yy2 = 3;\n\/\/   SVector<float,2> y2(yy1,yy2);\n  \n  \n  SMatrix<float,4,3> A;\n  SMatrix<float,2,2> B;\n  \n  A.Place_in_row(y, 1, 1);\n  A.Place_in_col(x + 2, 1, 0);\n  A.Place_at(B , 2, 1);\n  cout << \"A: \" << endl << A << endl;\n  \n#ifdef TEST_STATIC_CHECK\n  \/\/ create a vector of size 2 from 3 arguments\n  SVector<float, 2> v(1,2,3);\n#endif\n  \n  \/\/ test STL interface\n  \n  \/\/double p[2] = {1,2};\n  double m[4] = {1,2,3,4};\n  \n  \/\/SVector<float, 2> sp(p,2);\n  SMatrix<float, 2,2> sm(m,4);\n\n  \/\/cout << \"sp: \" << endl << sp << endl;\n  cout << \"sm: \" << endl << sm << endl;\n\n  \/\/std::vector<float> vp(sp.begin(), sp.end() );\n  std::vector<float> vm(sm.begin(), sm.end() );\n\n  \/\/SVector<float, 2> sp2(vp.begin(),vp.end());\n  \/\/SVector<float, 2> sp2(vp.begin(),vp.size());\n  SMatrix<float, 2,2> sm2(vm.begin(),vm.end());\n\n  \/\/if ( sp2 != sp) { cout << \"Test STL interface for SVector failed\" << endl; return -1; }\n  if ( sm2 != sm) { cout << \"Test STL interface for SMatrix failed\" << endl; return -1; }\n    \n  return 0;\n    \n}\n\nint test2() { \n#ifdef XXX\n  SMatrix<double,3> A;\n  A(0,0) = A(1,0) = 1;\n  A(0,1) = 3;\n  A(1,1) = A(2,2) = 2;\n  cout << \"A: \" << endl << A << endl;\n\n  SVector<double,3> x = A.Row(0);\n  cout << \"x: \" << x << endl;\n\n  SVector<double,3> y = A.Col(1);\n  cout << \"y: \" << y << endl;\n\n  return 0;\n#endif\n}\n\nint test3() { \n#ifdef XXX\n  SMatrix<double,3> A;\n  A(0,0) = A(0,1) = A(1,0) = 1;\n  A(1,1) = A(2,2) = 2;\n\n  SMatrix<double,3> B = A; \/\/ save A in B\n  cout << \"A: \" << endl << A << endl;\n\n  double det = 0.;\n  A.Sdet(det);\n  cout << \"Determinant: \" << det << endl;\n  \/\/ WARNING: A has changed!!\n  cout << \"A again: \" << endl << A << endl;\n\n  A.Sinvert();\n  cout << \"A^-1: \" << endl << A << endl;\n\n  \/\/ check if this is really the inverse:\n  cout << \"A^-1 * B: \" << endl << A * B << endl;\n\n  return 0;\n#endif\n}\n\nint test4() { \n#ifdef XXX\n  SMatrix<double,3> A;\n  A(0,0) = A(0,1) = A(1,0) = 1;\n  A(1,1) = A(2,2) = 2;\n  cout << \" A: \" << endl << A << endl;\n\n  SVector<double,3> x(1,2,3);\n  cout << \"x: \" << x << endl;\n\n  \/\/ we add 1 to each component of x and A\n  cout << \" (x+1)^T * (A+1) * (x+1): \" << Product(x+1,A+1) << endl;\n\n  return 0;\n#endif\n}\n\nint test5() { \n#ifdef XXX\n  SMatrix<float,4,3> A;\n  A(0,0) = A(0,1) = A(1,1) = A(2,2) = 4.;\n  A(2,3) = 1.;\n  cout << \"A: \" << endl << A << endl;\n  SVector<float,4> x(1,2,3,4);\n  cout << \" x: \" << x << endl;\n  SVector<float,3> a(1,2,3);\n  cout << \" a: \" << a << endl;\n  SVector<float,4> y = x + A * a;\n  \/\/    SVector<float,4> y = A * a;\n  cout << \" y: \" << y << endl;\n\n  SVector<float,3> b = (x+1) * (A+1);\n  cout << \" b: \" << b << endl;\n\n  return 0;\n#endif\n}\n\nint test6() { \n#ifdef XXX\n  SMatrix<float,4,2> A;\n  A(0,0) = A(0,1) = A(1,1) = A(2,0) = A(3,1) = 4.;\n  cout << \"A: \" << endl << A << endl;\n  \n  SMatrix<float,2,3> S;\n  S(0,0) = S(0,1) = S(1,1) = S(0,2) = 1.;\n  cout << \" S: \" << endl << S << endl;\n  \n  SMatrix<float,4,3> C = A * S;\n  cout << \" C: \" << endl << C << endl;\n  \n  return 0;\n#endif\n}\n\nint test7() { \n#ifdef XXX\n  SVector<float,3>    xv(4,4,4);\n  SVector<float,3>    yv(5,5,5);\n  SVector<float,2>    zv(64,64);\n  SMatrix<float,2,3>  x; \n  x.Place_in_row(xv,0,0);\n  x.Place_in_row(xv,1,0);\n  SMatrix<float,2,3>  y;  \n  y.Place_in_row(yv,0,0);\n  y.Place_in_row(yv,1,0);\n  SMatrix<float,2,3>  z;\n  z.Place_in_col(zv,0,0);\n  z.Place_in_col(zv,0,1);\n  z.Place_in_col(zv,0,2);\n\n  \/\/ element wise multiplication\n  cout << \"x * y: \" << endl << times(x, -y) << endl;\n\n  x += z - y;\n  cout << \"x += z - y: \" << endl << x << endl;\n\n  \/\/ element wise square root\n  cout << \"sqrt(z): \" << endl << sqrt(z) << endl;\n\n  \/\/ element wise multiplication with constant\n  cout << \"2 * y: \" << endl << 2 * y << endl;\n\n  \/\/ a more complex expression\n  cout << \"fabs(-z + 3*x): \" << endl << fabs(-z + 3*x) << endl;\n\n  return 0;\n#endif\n}\n\nint test8() { \n#ifdef XXX\n  SMatrix<float,2,3> A;\n  SVector<float,3>    av1(5.,15.,5.);\n  SVector<float,3>    av2(15.,5.,15.);\n  A.Place_in_row(av1,0,0);\n  A.Place_in_row(av2,1,0);\n  \n  cout << \"A: \" << endl << A << endl;\n\n  SVector<float,3>    x(1,2,3);\n  SVector<float,3>    y(4,5,6);\n\n  cout << \"dot(x,y): \" << Dot(x,y) << endl;\n\n  cout << \"mag(x): \" << Mag(x) << endl;\n\n  cout << \"cross(x,y): \" << Cross(x,y) << endl;\n\n  cout << \"unit(x): \" << Unit(x) << endl;\n\n  SVector<float,3>    z(4,16,64);\n  cout << \"x + y: \" << x+y << endl;\n\n  cout << \"x * y: \" << x * -y << endl;\n  x += z - y;\n  cout << \"x += z - y: \" << x << endl;\n\n  \/\/ element wise square root\n  cout << \"sqrt(z): \" << sqrt(z) << endl;\n\n  \/\/ element wise multiplication with constant\n  cout << \"2 * y: \" << 2 * y << endl;\n\n  \/\/ a more complex expression\n  cout << \"fabs(-z + 3*x): \" << fabs(-z + 3*x) << endl;\n\n  SVector<float,4> a;\n  SVector<float,2> b(1,2);\n  a.Place_at(b,2);\n  cout << \"a: \" << a << endl;\n#endif\n\n\n  return 0;\n}\n\n\n\n\n#define TEST(N)                                                                 \\\n  itest = N;                                                                    \\\n  if (test##N() == 0) std::cout << \" Test \" << itest << \"  OK \" << std::endl;   \\\n  else  {std::cout << \" Test \" << itest << \"  Failed \" << std::endl;             \\\n  return -1;}  \n\n\n\nint main(void) {\n\n  int itest;\n  TEST(1);\n  TEST(2);\n  TEST(3);\n  TEST(4);\n  TEST(5);\n  TEST(6);\n  TEST(7);\n  TEST(8);\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file DescriptorMatcher_.cpp\n * @brief mex interface for DescriptorMatcher\n * @author Kota Yamaguchi\n * @date 2012\n *\/\n#include \"mexopencv.hpp\"\nusing namespace std;\nusing namespace cv;\n\n#if CV_MINOR_VERSION >= 2\n\/\/ Persistent objects\n\n\/\/\/ Last object id to allocate\nint last_id = 0;\n\/\/\/ Object container\nmap<int,Ptr<DescriptorMatcher> > obj_;\n#endif\n\n\/**\n * Main entry called from Matlab\n * @param nlhs number of left-hand-side arguments\n * @param plhs pointers to mxArrays in the left-hand-side\n * @param nrhs number of right-hand-side arguments\n * @param prhs pointers to mxArrays in the right-hand-side\n *\/\nvoid mexFunction( int nlhs, mxArray *plhs[],\n                  int nrhs, const mxArray *prhs[] )\n{\n#if CV_MINOR_VERSION >= 2\n\tif (nrhs<1 || nlhs>1)\n        mexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \n\t\/\/ Determine argument format between constructor or (id,method,...)\n\tvector<MxArray> rhs(prhs,prhs+nrhs);\n\tint id = 0;\n\tstring method;\n\tif (rhs[0].isChar() && nrhs==1) {\n\t\t\/\/ Constructor is called. Create a new object from argument\n\t\tstring descriptorMatcherType(rhs[0].toString());\n\t\tobj_[++last_id] = DescriptorMatcher::create(descriptorMatcherType);\n\t\tplhs[0] = MxArray(last_id);\n\t\treturn;\n\t}\n\telse if (rhs[0].isNumeric() && rhs[0].numel()==1 && nrhs>1) {\n\t\tid = rhs[0].toInt();\n\t\tmethod = rhs[1].toString();\n\t}\n\telse\n        mexErrMsgIdAndTxt(\"mexopencv:error\",\"Invalid arguments\");\n\t\n\t\/\/ Big operation switch\n\tPtr<DescriptorMatcher> obj = obj_[id];\n    if (method == \"delete\") {\n    \tif (nrhs!=2 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tobj_.erase(id);\n    }\n    else if (method == \"type\") {\n    \tif (nrhs!=2)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tplhs[0] = MxArray(string(typeid(*obj).name()));\n    }\n    else if (method == \"add\") {\n    \tif (nrhs!=3 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tvector<Mat> descriptors(rhs[2].toVector<Mat>());\n    \tobj->add(descriptors);\n    }\n    else if (method == \"getTrainDescriptors\") {\n    \tif (nrhs!=2)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tplhs[0] = MxArray(obj->getTrainDescriptors());\n    }\n    else if (method == \"clear\") {\n    \tif (nrhs!=2 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tobj->clear();\n    }\n    else if (method == \"empty\") {\n    \tif (nrhs!=2 || nlhs!=1)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tplhs[0] = MxArray(obj->empty());\n    }\n    else if (method == \"isMaskSupported\") {\n    \tif (nrhs!=2)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tplhs[0] = MxArray(obj->isMaskSupported());\n    }\n    else if (method == \"train\") {\n    \tif (nrhs!=2 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tobj->train();\n    }\n    else if (method == \"match\") {\n    \tif (nrhs<3)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tMat queryDescriptors(rhs[2].toMat());\n        vector<DMatch> matches;\n    \tif (rhs[3].isNumeric()) { \/\/ First format\n\t\t\tMat trainDescriptors(rhs[3].toMat());\n\t\t\tMat mask;\n\t\t\tfor (int i=4; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmask = rhs[i+1].toMat(CV_8U);\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->match(queryDescriptors, trainDescriptors, matches, mask);\n\t\t}\n\t\telse { \/\/ Second format\n\t\t\tvector<Mat> masks;\n\t\t\tfor (int i=3; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmasks = rhs[i+1].toVector<Mat>();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->match(queryDescriptors, matches, masks);\n    \t}\n    \tplhs[0] = MxArray(matches);\n    }\n    else if (method == \"knnMatch\") {\n    \tif (nrhs<4)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tMat queryDescriptors(rhs[2].toMat());\n        vector<vector<DMatch> > matches;\n        if (rhs[3].isNumeric()) { \/\/ First format\n        \tMat trainDescriptors(rhs[3].toMat());\n\t\t\tint k = rhs[4].toInt();\n\t\t\tMat mask;\n\t\t\tbool compactResult=false;\n\t\t\tfor (int i=5; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmask = rhs[i+1].toMat(CV_8U);\n\t\t\t\telse if (key==\"CompactResult\")\n\t\t\t\t\tcompactResult = rhs[i+1].toBool();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->knnMatch(queryDescriptors, trainDescriptors, matches, k, mask,\n\t\t\t\tcompactResult);\n\t\t}\n\t\telse { \/\/ Second format\n\t\t\tint k = rhs[3].toInt();\n\t\t\tvector<Mat> masks;\n\t\t\tbool compactResult=false;\n\t\t\tfor (int i=4; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmasks = rhs[i+1].toVector<Mat>();\n\t\t\t\telse if (key==\"CompactResult\")\n\t\t\t\t\tcompactResult = rhs[i+1].toBool();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->knnMatch(queryDescriptors, matches, k, masks, compactResult);\n\t\t}\n    \tplhs[0] = MxArray(matches);\n    }\n    else if (method == \"radiusMatch\") {\n    \tif (nrhs<4)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tMat queryDescriptors(rhs[2].toMat());\n        vector<vector<DMatch> > matches;\n        if (rhs[3].isNumeric()) { \/\/ First format\n        \tMat trainDescriptors(rhs[3].toMat());\n\t\t\tfloat maxDistance = rhs[4].toDouble();\n\t\t\tMat mask;\n\t\t\tbool compactResult=false;\n\t\t\tfor (int i=5; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmask = rhs[i+1].toMat(CV_8U);\n\t\t\t\telse if (key==\"CompactResult\")\n\t\t\t\t\tcompactResult = rhs[i+1].toBool();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->radiusMatch(queryDescriptors, trainDescriptors, matches, \n\t\t\t\tmaxDistance, mask, compactResult);\n\t\t}\n\t\telse { \/\/ Second format\n\t\t\tfloat maxDistance = rhs[3].toDouble();\n\t\t\tvector<Mat> masks;\n\t\t\tbool compactResult=false;\n\t\t\tfor (int i=4; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmasks = rhs[i+1].toVector<Mat>();\n\t\t\t\telse if (key==\"CompactResult\")\n\t\t\t\t\tcompactResult = rhs[i+1].toBool();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->radiusMatch(queryDescriptors, matches, maxDistance, masks, compactResult);\n\t\t}\n    \tplhs[0] = MxArray(matches);\n    }\n    else if (method == \"read\") {\n    \tif (nrhs!=3 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tFileStorage fs(rhs[2].toString(),FileStorage::READ);\n    \tobj->read(fs.root());\n    }\n    else if (method == \"write\") {\n    \tif (nrhs!=3 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tFileStorage fs(rhs[2].toString(),FileStorage::WRITE);\n    \tobj->write(fs);\n    }\n    else\n\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized operation\");\n#else\n\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"DescriptorExtractor not supported in this version\");\n#endif\n}\n<commit_msg>Fixed a bug in DescriptorMatcher<commit_after>\/**\n * @file DescriptorMatcher_.cpp\n * @brief mex interface for DescriptorMatcher\n * @author Kota Yamaguchi\n * @date 2012\n *\/\n#include \"mexopencv.hpp\"\nusing namespace std;\nusing namespace cv;\n\n#if CV_MINOR_VERSION >= 2\n\/\/ Persistent objects\n\n\/\/\/ Last object id to allocate\nint last_id = 0;\n\/\/\/ Object container\nmap<int,Ptr<DescriptorMatcher> > obj_;\n#endif\n\n\/**\n * Main entry called from Matlab\n * @param nlhs number of left-hand-side arguments\n * @param plhs pointers to mxArrays in the left-hand-side\n * @param nrhs number of right-hand-side arguments\n * @param prhs pointers to mxArrays in the right-hand-side\n *\/\nvoid mexFunction( int nlhs, mxArray *plhs[],\n                  int nrhs, const mxArray *prhs[] )\n{\n#if CV_MINOR_VERSION >= 2\n\tif (nrhs<1 || nlhs>1)\n        mexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \n\t\/\/ Determine argument format between constructor or (id,method,...)\n\tvector<MxArray> rhs(prhs,prhs+nrhs);\n\tint id = 0;\n\tstring method;\n\tif (rhs[0].isChar() && nrhs==1) {\n\t\t\/\/ Constructor is called. Create a new object from argument\n\t\tstring descriptorMatcherType(rhs[0].toString());\n\t\tobj_[++last_id] = DescriptorMatcher::create(descriptorMatcherType);\n\t\tplhs[0] = MxArray(last_id);\n\t\treturn;\n\t}\n\telse if (rhs[0].isNumeric() && rhs[0].numel()==1 && nrhs>1) {\n\t\tid = rhs[0].toInt();\n\t\tmethod = rhs[1].toString();\n\t}\n\telse\n        mexErrMsgIdAndTxt(\"mexopencv:error\",\"Invalid arguments\");\n\t\n\t\/\/ Big operation switch\n\tPtr<DescriptorMatcher> obj = obj_[id];\n    if (method == \"delete\") {\n    \tif (nrhs!=2 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tobj_.erase(id);\n    }\n    else if (method == \"type\") {\n    \tif (nrhs!=2)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tplhs[0] = MxArray(string(typeid(*obj).name()));\n    }\n    else if (method == \"add\") {\n    \tif (nrhs!=3 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tvector<Mat> descriptors(rhs[2].toVector<Mat>());\n    \tobj->add(descriptors);\n    }\n    else if (method == \"getTrainDescriptors\") {\n    \tif (nrhs!=2)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tplhs[0] = MxArray(obj->getTrainDescriptors());\n    }\n    else if (method == \"clear\") {\n    \tif (nrhs!=2 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tobj->clear();\n    }\n    else if (method == \"empty\") {\n    \tif (nrhs!=2 || nlhs!=1)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tplhs[0] = MxArray(obj->empty());\n    }\n    else if (method == \"isMaskSupported\") {\n    \tif (nrhs!=2)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tplhs[0] = MxArray(obj->isMaskSupported());\n    }\n    else if (method == \"train\") {\n    \tif (nrhs!=2 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tobj->train();\n    }\n    else if (method == \"match\") {\n    \tif (nrhs<3)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tMat queryDescriptors(rhs[2].toMat(CV_32F));\n        vector<DMatch> matches;\n    \tif (rhs[3].isNumeric()) { \/\/ First format\n\t\t\tMat trainDescriptors(rhs[3].toMat(CV_32F));\n\t\t\tMat mask;\n\t\t\tfor (int i=4; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmask = rhs[i+1].toMat(CV_8U);\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->match(queryDescriptors, trainDescriptors, matches, mask);\n\t\t}\n\t\telse { \/\/ Second format\n\t\t\tvector<Mat> masks;\n\t\t\tfor (int i=3; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmasks = rhs[i+1].toVector<Mat>();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->match(queryDescriptors, matches, masks);\n    \t}\n    \tplhs[0] = MxArray(matches);\n    }\n    else if (method == \"knnMatch\") {\n    \tif (nrhs<4)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tMat queryDescriptors(rhs[2].toMat(CV_32F));\n        vector<vector<DMatch> > matches;\n        if (rhs[3].isNumeric()) { \/\/ First format\n        \tMat trainDescriptors(rhs[3].toMat(CV_32F));\n\t\t\tint k = rhs[4].toInt();\n\t\t\tMat mask;\n\t\t\tbool compactResult=false;\n\t\t\tfor (int i=5; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmask = rhs[i+1].toMat(CV_8U);\n\t\t\t\telse if (key==\"CompactResult\")\n\t\t\t\t\tcompactResult = rhs[i+1].toBool();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->knnMatch(queryDescriptors, trainDescriptors, matches, k, mask,\n\t\t\t\tcompactResult);\n\t\t}\n\t\telse { \/\/ Second format\n\t\t\tint k = rhs[3].toInt();\n\t\t\tvector<Mat> masks;\n\t\t\tbool compactResult=false;\n\t\t\tfor (int i=4; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmasks = rhs[i+1].toVector<Mat>();\n\t\t\t\telse if (key==\"CompactResult\")\n\t\t\t\t\tcompactResult = rhs[i+1].toBool();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->knnMatch(queryDescriptors, matches, k, masks, compactResult);\n\t\t}\n    \tplhs[0] = MxArray(matches);\n    }\n    else if (method == \"radiusMatch\") {\n    \tif (nrhs<4)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Output not assigned\");\n    \tMat queryDescriptors(rhs[2].toMat(CV_32F));\n        vector<vector<DMatch> > matches;\n        if (rhs[3].isNumeric()) { \/\/ First format\n        \tMat trainDescriptors(rhs[3].toMat(CV_32F));\n\t\t\tfloat maxDistance = rhs[4].toDouble();\n\t\t\tMat mask;\n\t\t\tbool compactResult=false;\n\t\t\tfor (int i=5; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmask = rhs[i+1].toMat(CV_8U);\n\t\t\t\telse if (key==\"CompactResult\")\n\t\t\t\t\tcompactResult = rhs[i+1].toBool();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->radiusMatch(queryDescriptors, trainDescriptors, matches, \n\t\t\t\tmaxDistance, mask, compactResult);\n\t\t}\n\t\telse { \/\/ Second format\n\t\t\tfloat maxDistance = rhs[3].toDouble();\n\t\t\tvector<Mat> masks;\n\t\t\tbool compactResult=false;\n\t\t\tfor (int i=4; i<nrhs; i+=2) {\n\t\t\t\tstring key(rhs[i].toString());\n\t\t\t\tif (key==\"Mask\")\n\t\t\t\t\tmasks = rhs[i+1].toVector<Mat>();\n\t\t\t\telse if (key==\"CompactResult\")\n\t\t\t\t\tcompactResult = rhs[i+1].toBool();\n\t\t\t\telse\n\t\t\t\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized option\");\n\t\t\t}\n\t\t\tobj->radiusMatch(queryDescriptors, matches, maxDistance, masks, compactResult);\n\t\t}\n    \tplhs[0] = MxArray(matches);\n    }\n    else if (method == \"read\") {\n    \tif (nrhs!=3 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tFileStorage fs(rhs[2].toString(),FileStorage::READ);\n    \tobj->read(fs.root());\n    }\n    else if (method == \"write\") {\n    \tif (nrhs!=3 || nlhs!=0)\n    \t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \tFileStorage fs(rhs[2].toString(),FileStorage::WRITE);\n    \tobj->write(fs);\n    }\n    else\n\t\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"Unrecognized operation\");\n#else\n\tmexErrMsgIdAndTxt(\"mexopencv:error\",\"DescriptorExtractor not supported in this version\");\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <tests\/Base.hh>\n\n#include <fstream>\n#include <iostream>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <cmath>\n\n#include <aleph\/geometry\/CoverTree.hh>\n\nusing namespace aleph::geometry;\n\ntemplate <class T> struct SimpleMetric\n{\n  T operator()( T a, T b )\n  {\n    return std::abs( a - b );\n  }\n};\n\ntemplate <class T> void testSimple()\n{\n  ALEPH_TEST_BEGIN( \"Simple\" );\n\n  CoverTree<T,\n            SimpleMetric<T> > ct;\n\n  ct.insert( 7 );\n  ct.insert( 13 );\n  ct.insert( 10 );\n  ct.insert( 8 );\n  ct.insert( 9 );\n  ct.insert( 11 );\n  ct.insert( 12 );\n\n  ct.print( std::cerr );\n\n  ALEPH_ASSERT_THROW( ct.checkLevelInvariant() );\n  ALEPH_ASSERT_THROW( ct.checkCoveringInvariant() );\n  ALEPH_ASSERT_THROW( ct.checkSeparatingInvariant() );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class T> void testSimplePermutations()\n{\n  ALEPH_TEST_BEGIN( \"Simple (using permutations)\" );\n\n  std::vector<T> data = {7,8,9,10,11,12,13};\n\n  do\n  {\n    CoverTree<T,\n              SimpleMetric<T> > ct;\n\n    \/\/ Debug output ----------------------------------------------------\n\n    std::cerr << \"Permutation: \";\n\n    for( auto&& x : data )\n      std::cerr << x << \" \";\n\n    std::cerr << \"\\n\";\n\n    \/\/ Check validity of tree ------------------------------------------\n\n    for( auto&& x : data )\n      ct.insert( x );\n\n    ALEPH_ASSERT_THROW( ct.checkLevelInvariant() );\n    ALEPH_ASSERT_THROW( ct.checkCoveringInvariant() );\n    ALEPH_ASSERT_THROW( ct.checkSeparatingInvariant() );\n  }\n  while( std::next_permutation( data.begin(), data.end() ) );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class T> struct Point\n{\n  T x;\n  T y;\n\n  bool operator<( const Point& other ) const noexcept\n  {\n    if( x == other.x )\n      return y < other.y;\n    else\n      return x < other.x;\n  }\n};\n\ntemplate <class T> std::ostream& operator<<( std::ostream& o, const Point<T>& p )\n{\n  o << p.x << \" \" << p.y;\n  return o;\n}\n\ntemplate <class T> struct EuclideanMetric\n{\n  T operator()( Point<T> a, Point<T> b )\n  {\n    return std::sqrt( std::pow( a.x - b.x, T(2) ) + std::pow( a.y - b.y, T(2) ) );\n  }\n};\n\ntemplate <class T> bool contains( const Point<T>& centre, const Point<T>& p, T r )\n{\n  EuclideanMetric<T> metric;\n  return metric( centre, p ) <= r;\n}\n\ntemplate <class T> T distance( const Point<T>& centre, const Point<T>& p )\n{\n  EuclideanMetric<T> metric;\n  return metric( centre, p );\n}\n\ntemplate <class T> void test2D()\n{\n  ALEPH_TEST_BEGIN( \"2D\" );\n\n  using Point     = Point<T>;\n  using Metric    = EuclideanMetric<T>;\n  using CoverTree = CoverTree<Point, Metric>;\n\n  CoverTree ct;\n\n  std::ifstream in( CMAKE_SOURCE_DIR + std::string( \"\/tests\/input\/Cover_tree_simple.txt\" ) );\n  ALEPH_ASSERT_THROW( in );\n\n  std::vector<Point> points;\n\n  std::string line;\n  while( std::getline( in, line ) )\n  {\n    std::stringstream converter( line );\n\n    T x = T();\n    T y = T();\n\n    converter >> x\n              >> y;\n\n    ALEPH_ASSERT_THROW( not converter.fail() );\n\n    points.push_back( {x,y} );\n  }\n\n  ALEPH_ASSERT_EQUAL( points.size(), 15 );\n\n  for( auto&& p : points )\n    ct.insert( p );\n\n  ALEPH_ASSERT_THROW( ct.isValid() );\n\n  auto&& nodesByLevel = ct.getNodesByLevel();\n\n  \/\/ Determine radii, i.e. *level* of the original data set. Afterwards,\n  \/\/ using the corresponding point as the centre, we can check how often\n  \/\/ certain points are being covered.\n\n  std::map<Point, unsigned > covered;\n  std::multimap<Point, long> levels;\n  std::multimap<Point, T   > distances;\n\n  for( auto&& pair : nodesByLevel )\n  {\n    auto&& level  = pair.first;\n    auto&& centre = pair.second;\n\n    for( auto&& p : points )\n    {\n      \/\/ TODO: fix radius\/level calculation; is this an implementation\n      \/\/ detail of the tree?\n      if( contains( centre, p, T( std::pow( T(2), level ) ) ) )\n      {\n        covered[p] += 1;\n        levels.insert( std::make_pair( p, level ) );\n        distances.insert( std::make_pair( p, distance( centre, p ) ) );\n      }\n    }\n  }\n\n  std::cerr << \"# Cover counter\\n\";\n\n  for( auto&& pair : covered )\n    std::cerr << pair.first << \": \" << pair.second << \"\\n\";\n\n  std::cerr << \"# Levels counter\\n\";\n\n  for( auto&& p : points )\n  {\n    std::cerr << p << \": \";\n\n    auto range = levels.equal_range( p );\n    for( auto it = range.first; it != range.second; ++it )\n     std::cerr << it->second << \" \";\n\n    std::cerr << \"\\n\";\n  }\n\n  std::cerr << \"# Distances counter\\n\";\n\n  for( auto&& p : points )\n  {\n    std::cerr << p << \": \";\n\n    auto range = distances.equal_range( p );\n    for( auto it = range.first; it != range.second; ++it )\n     std::cerr << it->second << \" \";\n\n    std::cerr << \"\\n\";\n  }\n\n  std::cerr << \"# Basic cover distance density\\n\";\n\n  for( auto&& p : points )\n  {\n    std::cerr << p << \": \";\n\n    auto range      = distances.equal_range( p );\n    double distance = 0.0;\n\n    for( auto it = range.first; it != range.second; ++it )\n      distance += it->second;\n\n    distance \/= static_cast<T>( std::distance( range.first, range.second ) );\n\n    std::cerr << distance << \"\\n\";\n  }\n\n  \/\/ DEBUG: output of cover radii --------------------------------------\n\n  {\n    std::ofstream out( \"\/tmp\/C.txt\" );\n\n    for( auto&& pair : nodesByLevel )\n    {\n      auto&& level  = pair.first;\n      auto&& centre = pair.second;\n      auto r        = std::pow( T(2), level );\n\n      out << centre << \" \" << r << \"\\n\";\n    }\n  }\n\n  \/\/ DEBUG: output of edges --------------------------------------------\n\n  {\n    std::set< std::pair<Point, Point> > edges;\n\n    for( auto&& pair : nodesByLevel )\n    {\n      auto&& level  = pair.first;\n      auto&& centre = pair.second;\n\n      for( auto&& p : points )\n      {\n        \/\/ TODO: fix radius\/level calculation; is this an implementation\n        \/\/ detail of the tree?\n        if( contains( centre, p, T( std::pow( T(2), level ) ) ) )\n        {\n          \/\/ Induce basic ordering of edges in order to make it easier\n          \/\/ to print them later on.\n          if( centre < p )\n            edges.insert( std::make_pair( centre, p ) );\n          else\n            edges.insert( std::make_pair( p, centre ) );\n        }\n      }\n    }\n\n    std::ofstream out( \"\/tmp\/E.txt\" );\n\n    for( auto&& edge : edges )\n    {\n      out << edge.first  << \"\\n\"\n          << edge.second << \"\\n\\n\";\n    }\n  }\n\n  ALEPH_ASSERT_EQUAL( nodesByLevel.size(), points.size() );\n  ALEPH_TEST_END();\n}\n\nint main( int, char** )\n{\n  testSimple<double>();\n  testSimple<float> ();\n\n  testSimplePermutations<double>();\n  testSimplePermutations<float> ();\n\n  test2D<double>();\n  test2D<float> ();\n}\n<commit_msg>Added simple edge filtering criterion<commit_after>#include <tests\/Base.hh>\n\n#include <fstream>\n#include <iostream>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <cmath>\n\n#include <aleph\/geometry\/CoverTree.hh>\n\nusing namespace aleph::geometry;\n\ntemplate <class T> struct SimpleMetric\n{\n  T operator()( T a, T b )\n  {\n    return std::abs( a - b );\n  }\n};\n\ntemplate <class T> void testSimple()\n{\n  ALEPH_TEST_BEGIN( \"Simple\" );\n\n  CoverTree<T,\n            SimpleMetric<T> > ct;\n\n  ct.insert( 7 );\n  ct.insert( 13 );\n  ct.insert( 10 );\n  ct.insert( 8 );\n  ct.insert( 9 );\n  ct.insert( 11 );\n  ct.insert( 12 );\n\n  ct.print( std::cerr );\n\n  ALEPH_ASSERT_THROW( ct.checkLevelInvariant() );\n  ALEPH_ASSERT_THROW( ct.checkCoveringInvariant() );\n  ALEPH_ASSERT_THROW( ct.checkSeparatingInvariant() );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class T> void testSimplePermutations()\n{\n  ALEPH_TEST_BEGIN( \"Simple (using permutations)\" );\n\n  std::vector<T> data = {7,8,9,10,11,12,13};\n\n  do\n  {\n    CoverTree<T,\n              SimpleMetric<T> > ct;\n\n    \/\/ Debug output ----------------------------------------------------\n\n    std::cerr << \"Permutation: \";\n\n    for( auto&& x : data )\n      std::cerr << x << \" \";\n\n    std::cerr << \"\\n\";\n\n    \/\/ Check validity of tree ------------------------------------------\n\n    for( auto&& x : data )\n      ct.insert( x );\n\n    ALEPH_ASSERT_THROW( ct.checkLevelInvariant() );\n    ALEPH_ASSERT_THROW( ct.checkCoveringInvariant() );\n    ALEPH_ASSERT_THROW( ct.checkSeparatingInvariant() );\n  }\n  while( std::next_permutation( data.begin(), data.end() ) );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class T> struct Point\n{\n  T x;\n  T y;\n\n  bool operator<( const Point& other ) const noexcept\n  {\n    if( x == other.x )\n      return y < other.y;\n    else\n      return x < other.x;\n  }\n};\n\ntemplate <class T> std::ostream& operator<<( std::ostream& o, const Point<T>& p )\n{\n  o << p.x << \" \" << p.y;\n  return o;\n}\n\ntemplate <class T> struct EuclideanMetric\n{\n  T operator()( Point<T> a, Point<T> b )\n  {\n    return std::sqrt( std::pow( a.x - b.x, T(2) ) + std::pow( a.y - b.y, T(2) ) );\n  }\n};\n\ntemplate <class T> bool contains( const Point<T>& centre, const Point<T>& p, T r )\n{\n  EuclideanMetric<T> metric;\n  return metric( centre, p ) <= r;\n}\n\ntemplate <class T> T distance( const Point<T>& centre, const Point<T>& p )\n{\n  EuclideanMetric<T> metric;\n  return metric( centre, p );\n}\n\ntemplate <class T> void test2D()\n{\n  ALEPH_TEST_BEGIN( \"2D\" );\n\n  using Point     = Point<T>;\n  using Metric    = EuclideanMetric<T>;\n  using CoverTree = CoverTree<Point, Metric>;\n\n  CoverTree ct;\n\n  std::ifstream in( CMAKE_SOURCE_DIR + std::string( \"\/tests\/input\/Cover_tree_simple.txt\" ) );\n  ALEPH_ASSERT_THROW( in );\n\n  std::vector<Point> points;\n\n  std::string line;\n  while( std::getline( in, line ) )\n  {\n    std::stringstream converter( line );\n\n    T x = T();\n    T y = T();\n\n    converter >> x\n              >> y;\n\n    ALEPH_ASSERT_THROW( not converter.fail() );\n\n    points.push_back( {x,y} );\n  }\n\n  ALEPH_ASSERT_EQUAL( points.size(), 15 );\n\n  for( auto&& p : points )\n    ct.insert( p );\n\n  ALEPH_ASSERT_THROW( ct.isValid() );\n\n  auto&& nodesByLevel = ct.getNodesByLevel();\n\n  \/\/ Determine radii, i.e. *level* of the original data set. Afterwards,\n  \/\/ using the corresponding point as the centre, we can check how often\n  \/\/ certain points are being covered.\n\n  std::map<Point, unsigned > covered;\n  std::multimap<Point, long> levels;\n  std::multimap<Point, T   > distances;\n\n  for( auto&& pair : nodesByLevel )\n  {\n    auto&& level  = pair.first;\n    auto&& centre = pair.second;\n\n    for( auto&& p : points )\n    {\n      \/\/ TODO: fix radius\/level calculation; is this an implementation\n      \/\/ detail of the tree?\n      if( contains( centre, p, T( std::pow( T(2), level ) ) ) )\n      {\n        covered[p] += 1;\n        levels.insert( std::make_pair( p, level ) );\n        distances.insert( std::make_pair( p, distance( centre, p ) ) );\n      }\n    }\n  }\n\n  std::cerr << \"# Cover counter\\n\";\n\n  for( auto&& pair : covered )\n    std::cerr << pair.first << \": \" << pair.second << \"\\n\";\n\n  std::cerr << \"# Levels counter\\n\";\n\n  for( auto&& p : points )\n  {\n    std::cerr << p << \": \";\n\n    auto range = levels.equal_range( p );\n    for( auto it = range.first; it != range.second; ++it )\n     std::cerr << it->second << \" \";\n\n    std::cerr << \"\\n\";\n  }\n\n  std::cerr << \"# Distances counter\\n\";\n\n  for( auto&& p : points )\n  {\n    std::cerr << p << \": \";\n\n    auto range = distances.equal_range( p );\n    for( auto it = range.first; it != range.second; ++it )\n     std::cerr << it->second << \" \";\n\n    std::cerr << \"\\n\";\n  }\n\n  std::cerr << \"# Basic cover distance density\\n\";\n\n  for( auto&& p : points )\n  {\n    std::cerr << p << \": \";\n\n    auto range      = distances.equal_range( p );\n    double distance = 0.0;\n\n    for( auto it = range.first; it != range.second; ++it )\n      distance += it->second;\n\n    distance \/= static_cast<T>( std::distance( range.first, range.second ) );\n\n    std::cerr << distance << \"\\n\";\n  }\n\n  \/\/ DEBUG: output of cover radii --------------------------------------\n\n  {\n    std::ofstream out( \"\/tmp\/C.txt\" );\n\n    for( auto&& pair : nodesByLevel )\n    {\n      auto&& level  = pair.first;\n      auto&& centre = pair.second;\n      auto r        = std::pow( T(2), level );\n\n      out << centre << \" \" << r << \"\\n\";\n    }\n  }\n\n  \/\/ DEBUG: output of edges --------------------------------------------\n\n  {\n    std::set< std::pair<Point, Point> > edges;\n\n    for( auto&& pair : nodesByLevel )\n    {\n      auto&& level  = pair.first;\n      auto&& centre = pair.second;\n\n      for( auto&& p : points )\n      {\n        \/\/ TODO: fix radius\/level calculation; is this an implementation\n        \/\/ detail of the tree?\n        if( contains( centre, p, T( std::pow( T(2), level ) ) ) )\n        {\n          \/\/ Induce basic ordering of edges in order to make it easier\n          \/\/ to print them later on.\n          if( centre < p )\n            edges.insert( std::make_pair( centre, p ) );\n          else\n            edges.insert( std::make_pair( p, centre ) );\n        }\n      }\n    }\n\n    std::ofstream out( \"\/tmp\/E.txt\" );\n\n    for( auto&& edge : edges )\n    {\n      out << edge.first  << \"\\n\"\n          << edge.second << \"\\n\\n\";\n    }\n\n    std::cerr << \"# Cover tree\\n\";\n\n    ct.print( std::cerr );\n\n    std::set< std::pair<Point, Point> > filteredEdges;\n\n    auto&& nodesToLevel = ct.nodesToLevel();\n    for( auto&& edge : edges )\n    {\n      auto&& source = edge.first;                 \/\/ source node\n      auto&& upper  = nodesToLevel.at( source );  \/\/ source level\n      auto&& target = edge.second;                \/\/ target node\n      auto&& lower  = nodesToLevel.at( target );  \/\/ target level\n\n      auto d       = distance( source, target );\n      auto d_lower = std::pow( T(2), lower );\n      auto d_upper = std::pow( T(2), upper );\n\n      std::cerr << edge.first << \" -- \" << edge.second << \":\\n\";\n\n      if( d <= d_lower && d <= d_upper )\n        filteredEdges.insert( edge );\n      else if( d <= d_lower && d > d_upper )\n      {\n        \/\/ Only one criterion holds\n      }\n      else if( d <= d_upper && d > d_lower )\n      {\n        \/\/ Ditto.\n      }\n      else\n        throw std::runtime_error( \"This should never happen\" );\n    }\n\n    out.close();\n    out.open( \"\/tmp\/F.txt\" );\n\n    for( auto&& edge : filteredEdges )\n    {\n      out << edge.first  << \"\\n\"\n          << edge.second << \"\\n\\n\";\n    }\n  }\n\n  ALEPH_ASSERT_EQUAL( nodesByLevel.size(), points.size() );\n  ALEPH_TEST_END();\n}\n\nint main( int, char** )\n{\n  testSimple<double>();\n  testSimple<float> ();\n\n  testSimplePermutations<double>();\n  testSimplePermutations<float> ();\n\n  test2D<double>();\n  test2D<float> ();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"atcommandframe.h\"\n#include <QDebug>\n\n\/**\n * @brief ATCommandFrame's constructor\n * @param parent\n *\/\nATCommandFrame::ATCommandFrame(QObject *parent) :\n    DigiMeshFrame(parent)\n{\n    setFrameType(DigiMeshFrame::ATCommandFrame);\n    setFrameId(0x01);\n}\n\n\/**\n * @brief Sets the AT Command\n * @param command\n *\/\nvoid ATCommandFrame::setCommand(const ATCommand command) {\n    int cmdMSB = (command>>8) & 0xFF;\n    int cmdLSB = command & 0xFF;\n    m_command.clear();\n    m_command.append(cmdMSB);\n    m_command.append(cmdLSB);\n}\n\n\/**\n * @brief Sets the AT Command from the given QString\n * @param command\n *\/\nvoid ATCommandFrame::setCommand(const QString &command) {\n    m_command.clear();\n    m_command.append(command.at(0));\n    m_command.append(command.at(1));\n}\n\n\/**\n * @brief Sets command's parameter\n * @param param\n *\/\nvoid ATCommandFrame::setParameter(const QByteArray &param) {\n    m_parameter.clear();\n    m_parameter.append(param);\n}\n\n\/**\n * @brief Returns the AT Command\n * @return the AT Command\n *\/\nQByteArray ATCommandFrame::command() const {\n    return m_command;\n}\n\n\/**\n * @brief Returns the command's parameter\n * @return the command's parameter\n *\/\nQByteArray ATCommandFrame::parameter() const {\n    return m_parameter;\n}\n\nvoid ATCommandFrame::assemblePacket() {\n    m_packet.clear();\n    m_packet.append(frameType());\n    m_packet.append(frameId());\n    m_packet.append(command());\n    m_packet.append(parameter());\n    setLength(m_packet.size());\n    createChecksum(m_packet);\n    m_packet.append(checksum());\n    m_packet.insert(0, startDelimiter());\n    m_packet.insert(1, (length()>>8)&0xFF);\n    m_packet.insert(2, length()&0xFF);\n}\n\nvoid ATCommandFrame::clear()\n{\n    DigiMeshFrame::clear();\n    m_command.clear();\n    m_parameter.clear();\n}\n\n\/**\n * @brief Returns the given ATCommandFrame::ATCommand into QString\n * @param command the ATCommand to be converted into QString\n * @return the given ATCommand into QString\n *\/\nQString ATCommandFrame::atCommandToString(const ATCommand command)\n{\n    QString at(atCommandToByteArray(command));\n    return at;\n}\n\n\/**\n * @brief Returns the given ATCommandFrame::ATCommand into QByteArray\n * @param command the ATCommand to be converted into QByteArray\n * @return the given ATCommand into QByteArray\n *\/\nQByteArray ATCommandFrame::atCommandToByteArray(const ATCommand command)\n{\n    QByteArray at;\n    at.append((command>>8)&0xFF);\n    at.append(command&0xFF);\n    return at;\n}\n\n\/**\n * @brief Returns the ATCommandFrame::ATCommand corresponding to the given QByteArray\n * @param command\n * @return the ATCommandFrame::ATCommand corresponding to the given QByteArray.\n *\/\nATCommandFrame::ATCommand ATCommandFrame::atCommandFromByteArray(const QByteArray &command)\n{\n    ATCommandFrame::ATCommand at;\n    at = (ATCommandFrame::ATCommand) ( ( (command.at(0)&0xFF)<<8) + command.at(1) );\n\n    return at;\n}\n<commit_msg>Improved ATCommandFrame::clear<commit_after>#include \"atcommandframe.h\"\n#include <QDebug>\n\n\/**\n * @brief ATCommandFrame's constructor\n * @param parent\n *\/\nATCommandFrame::ATCommandFrame(QObject *parent) :\n    DigiMeshFrame(parent)\n{\n    setFrameType(DigiMeshFrame::ATCommandFrame);\n    setFrameId(0x01);\n}\n\n\/**\n * @brief Sets the AT Command\n * @param command\n *\/\nvoid ATCommandFrame::setCommand(const ATCommand command) {\n    int cmdMSB = (command>>8) & 0xFF;\n    int cmdLSB = command & 0xFF;\n    m_command.clear();\n    m_command.append(cmdMSB);\n    m_command.append(cmdLSB);\n}\n\n\/**\n * @brief Sets the AT Command from the given QString\n * @param command\n *\/\nvoid ATCommandFrame::setCommand(const QString &command) {\n    m_command.clear();\n    m_command.append(command.at(0));\n    m_command.append(command.at(1));\n}\n\n\/**\n * @brief Sets command's parameter\n * @param param\n *\/\nvoid ATCommandFrame::setParameter(const QByteArray &param) {\n    m_parameter.clear();\n    m_parameter.append(param);\n}\n\n\/**\n * @brief Returns the AT Command\n * @return the AT Command\n *\/\nQByteArray ATCommandFrame::command() const {\n    return m_command;\n}\n\n\/**\n * @brief Returns the command's parameter\n * @return the command's parameter\n *\/\nQByteArray ATCommandFrame::parameter() const {\n    return m_parameter;\n}\n\nvoid ATCommandFrame::assemblePacket() {\n    m_packet.clear();\n    m_packet.append(frameType());\n    m_packet.append(frameId());\n    m_packet.append(command());\n    m_packet.append(parameter());\n    setLength(m_packet.size());\n    createChecksum(m_packet);\n    m_packet.append(checksum());\n    m_packet.insert(0, startDelimiter());\n    m_packet.insert(1, (length()>>8)&0xFF);\n    m_packet.insert(2, length()&0xFF);\n}\n\nvoid ATCommandFrame::clear()\n{\n    DigiMeshFrame::clear();\n    m_command.clear();\n    m_parameter.clear();\n    setFrameType(DigiMeshFrame::ATCommandFrame);\n    setFrameId(0x01);\n}\n\n\/**\n * @brief Returns the given ATCommandFrame::ATCommand into QString\n * @param command the ATCommand to be converted into QString\n * @return the given ATCommand into QString\n *\/\nQString ATCommandFrame::atCommandToString(const ATCommand command)\n{\n    QString at(atCommandToByteArray(command));\n    return at;\n}\n\n\/**\n * @brief Returns the given ATCommandFrame::ATCommand into QByteArray\n * @param command the ATCommand to be converted into QByteArray\n * @return the given ATCommand into QByteArray\n *\/\nQByteArray ATCommandFrame::atCommandToByteArray(const ATCommand command)\n{\n    QByteArray at;\n    at.append((command>>8)&0xFF);\n    at.append(command&0xFF);\n    return at;\n}\n\n\/**\n * @brief Returns the ATCommandFrame::ATCommand corresponding to the given QByteArray\n * @param command\n * @return the ATCommandFrame::ATCommand corresponding to the given QByteArray.\n *\/\nATCommandFrame::ATCommand ATCommandFrame::atCommandFromByteArray(const QByteArray &command)\n{\n    ATCommandFrame::ATCommand at;\n    at = (ATCommandFrame::ATCommand) ( ( (command.at(0)&0xFF)<<8) + command.at(1) );\n\n    return at;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2012 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\/\/ C++ includes\n\n\/\/ Local includes\n#include \"libmesh\/quadrature.h\"\n\nnamespace libMesh\n{\n\nvoid QBase::init(const ElemType t,\n                 unsigned int p)\n{\n  \/\/ check to see if we have already\n  \/\/ done the work for this quadrature rule\n  if (t == _type && p == _p_level)\n    return;\n  else\n    {\n      _type = t;\n      _p_level = p;\n    }\n\n\n\n  switch(_dim)\n    {\n    case 0:\n      this->init_0D(_type,_p_level);\n\n      return;\n\n    case 1:\n      this->init_1D(_type,_p_level);\n\n      return;\n\n    case 2:\n      this->init_2D(_type,_p_level);\n\n      return;\n\n    case 3:\n      this->init_3D(_type,_p_level);\n\n      return;\n\n    default:\n      libmesh_error();\n    }\n}\n\n\n\nvoid QBase::init_0D(const ElemType,\n                    unsigned int)\n{\n  _points.resize(1);\n  _weights.resize(1);\n  _points[0] = Point(0.);\n  _weights[0] = 1.0;\n}\n\n\n\nvoid QBase::scale(std::pair<Real, Real> old_range,\n\t\t  std::pair<Real, Real> new_range)\n{\n  \/\/ Make sure we are in 1D\n  libmesh_assert_equal_to (_dim, 1);\n\n  \/\/ Make sure that we have sane ranges\n  libmesh_assert_greater (new_range.second, new_range.first);\n  libmesh_assert_greater (old_range.second, old_range.first);\n\n  \/\/ Make sure there are some points\n  libmesh_assert_greater (_points.size(), 0);\n\n  \/\/ We're mapping from old_range -> new_range\n  for (unsigned int i=0; i<_points.size(); i++)\n    {\n      _points[i](0) =\n\t(_points[i](0) - old_range.first) *\n\t(new_range.second - new_range.first) \/\n\t(old_range.second - old_range.first) +\n\tnew_range.first;\n    }\n\n  \/\/ Compute the scale factor and scale the weights\n  const Real scfact = (new_range.second - new_range.first) \/\n                      (old_range.second - old_range.first);\n\n  for (unsigned int i=0; i<_points.size(); i++)\n    _weights[i] *= scfact;\n}\n\n\n\n\nvoid QBase::tensor_product_quad(const QBase& q1D)\n{\n\n  const unsigned int n_points = q1D.n_points();\n\n  _points.resize(n_points * n_points);\n\n  _weights.resize(n_points * n_points);\n\n  unsigned int qp=0;\n\n  for (unsigned int j=0; j<n_points; j++)\n    for (unsigned int i=0; i<n_points; i++)\n      {\n\t_points[qp](0) = q1D.qp(i)(0);\n\t_points[qp](1) = q1D.qp(j)(0);\n\n\t_weights[qp] = q1D.w(i)*q1D.w(j);\n\n\tqp++;\n      }\n}\n\n\n\n\n\nvoid QBase::tensor_product_hex(const QBase& q1D)\n{\n  const unsigned int n_points = q1D.n_points();\n\n  _points.resize(n_points * n_points * n_points);\n\n  _weights.resize(n_points * n_points * n_points);\n\n  unsigned int qp=0;\n\n  for (unsigned int k=0; k<n_points; k++)\n    for (unsigned int j=0; j<n_points; j++)\n      for (unsigned int i=0; i<n_points; i++)\n\t{\n\t  _points[qp](0) = q1D.qp(i)(0);\n\t  _points[qp](1) = q1D.qp(j)(0);\n\t  _points[qp](2) = q1D.qp(k)(0);\n\n\t  _weights[qp] = q1D.w(i) * q1D.w(j) * q1D.w(k);\n\n\t  qp++;\n\t}\n}\n\n\n\n\nvoid QBase::tensor_product_prism(const QBase& q1D, const QBase& q2D)\n{\n  const unsigned int n_points1D = q1D.n_points();\n  const unsigned int n_points2D = q2D.n_points();\n\n  _points.resize  (n_points1D * n_points2D);\n  _weights.resize (n_points1D * n_points2D);\n\n  unsigned int qp=0;\n\n  for (unsigned int j=0; j<n_points1D; j++)\n    for (unsigned int i=0; i<n_points2D; i++)\n      {\n\t_points[qp](0) = q2D.qp(i)(0);\n\t_points[qp](1) = q2D.qp(i)(1);\n\t_points[qp](2) = q1D.qp(j)(0);\n\n\t_weights[qp] = q2D.w(i) * q1D.w(j);\n\n\tqp++;\n      }\n\n}\n\n\n\n\nstd::ostream& operator << (std::ostream& os, const QBase& q)\n{\n  q.print_info(os);\n  return os;\n}\n\n} \/\/ namespace libMesh\n<commit_msg>Changes in quadrature.C for -Wshadow.<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2012 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\/\/ C++ includes\n\n\/\/ Local includes\n#include \"libmesh\/quadrature.h\"\n\nnamespace libMesh\n{\n\nvoid QBase::init(const ElemType t,\n                 unsigned int p)\n{\n  \/\/ check to see if we have already\n  \/\/ done the work for this quadrature rule\n  if (t == _type && p == _p_level)\n    return;\n  else\n    {\n      _type = t;\n      _p_level = p;\n    }\n\n\n\n  switch(_dim)\n    {\n    case 0:\n      this->init_0D(_type,_p_level);\n\n      return;\n\n    case 1:\n      this->init_1D(_type,_p_level);\n\n      return;\n\n    case 2:\n      this->init_2D(_type,_p_level);\n\n      return;\n\n    case 3:\n      this->init_3D(_type,_p_level);\n\n      return;\n\n    default:\n      libmesh_error();\n    }\n}\n\n\n\nvoid QBase::init_0D(const ElemType,\n                    unsigned int)\n{\n  _points.resize(1);\n  _weights.resize(1);\n  _points[0] = Point(0.);\n  _weights[0] = 1.0;\n}\n\n\n\nvoid QBase::scale(std::pair<Real, Real> old_range,\n\t\t  std::pair<Real, Real> new_range)\n{\n  \/\/ Make sure we are in 1D\n  libmesh_assert_equal_to (_dim, 1);\n\n  \/\/ Make sure that we have sane ranges\n  libmesh_assert_greater (new_range.second, new_range.first);\n  libmesh_assert_greater (old_range.second, old_range.first);\n\n  \/\/ Make sure there are some points\n  libmesh_assert_greater (_points.size(), 0);\n\n  \/\/ We're mapping from old_range -> new_range\n  for (unsigned int i=0; i<_points.size(); i++)\n    {\n      _points[i](0) =\n\t(_points[i](0) - old_range.first) *\n\t(new_range.second - new_range.first) \/\n\t(old_range.second - old_range.first) +\n\tnew_range.first;\n    }\n\n  \/\/ Compute the scale factor and scale the weights\n  const Real scfact = (new_range.second - new_range.first) \/\n                      (old_range.second - old_range.first);\n\n  for (unsigned int i=0; i<_points.size(); i++)\n    _weights[i] *= scfact;\n}\n\n\n\n\nvoid QBase::tensor_product_quad(const QBase& q1D)\n{\n\n  const unsigned int np = q1D.n_points();\n\n  _points.resize(np * np);\n\n  _weights.resize(np * np);\n\n  unsigned int q=0;\n\n  for (unsigned int j=0; j<np; j++)\n    for (unsigned int i=0; i<np; i++)\n      {\n\t_points[q](0) = q1D.qp(i)(0);\n\t_points[q](1) = q1D.qp(j)(0);\n\n\t_weights[q] = q1D.w(i)*q1D.w(j);\n\n\tq++;\n      }\n}\n\n\n\n\n\nvoid QBase::tensor_product_hex(const QBase& q1D)\n{\n  const unsigned int np = q1D.n_points();\n\n  _points.resize(np * np * np);\n\n  _weights.resize(np * np * np);\n\n  unsigned int q=0;\n\n  for (unsigned int k=0; k<np; k++)\n    for (unsigned int j=0; j<np; j++)\n      for (unsigned int i=0; i<np; i++)\n\t{\n\t  _points[q](0) = q1D.qp(i)(0);\n\t  _points[q](1) = q1D.qp(j)(0);\n\t  _points[q](2) = q1D.qp(k)(0);\n\n\t  _weights[q] = q1D.w(i) * q1D.w(j) * q1D.w(k);\n\n\t  q++;\n\t}\n}\n\n\n\n\nvoid QBase::tensor_product_prism(const QBase& q1D, const QBase& q2D)\n{\n  const unsigned int n_points1D = q1D.n_points();\n  const unsigned int n_points2D = q2D.n_points();\n\n  _points.resize  (n_points1D * n_points2D);\n  _weights.resize (n_points1D * n_points2D);\n\n  unsigned int q=0;\n\n  for (unsigned int j=0; j<n_points1D; j++)\n    for (unsigned int i=0; i<n_points2D; i++)\n      {\n\t_points[q](0) = q2D.qp(i)(0);\n\t_points[q](1) = q2D.qp(i)(1);\n\t_points[q](2) = q1D.qp(j)(0);\n\n\t_weights[q] = q2D.w(i) * q1D.w(j);\n\n\tq++;\n      }\n\n}\n\n\n\n\nstd::ostream& operator << (std::ostream& os, const QBase& q)\n{\n  q.print_info(os);\n  return os;\n}\n\n} \/\/ namespace libMesh\n<|endoftext|>"}
{"text":"<commit_before>\/** @file Observer.cpp\n * This file includes the high gain observer implementations for the two tank system with the water level of tank 2\n * as measurement value.\n *\/\n#include \"Observer.h\"\n\nstd::vector<double> HighGainObserver::compute(const double &dhT2,\n                                              const double &dUa) {\n\n    double dSgnT = sign(this->dOut[0] - this->dOut[1]);\n    double dAbsT = fabs(this->dOut[0] - this->dOut[1]);\n    double dError = this->dOut[1] - dhT2;\n\n    this->dOut[0] += this->dSampleTime * (-(this->dAS1 \/ this->dAT * dSgnT * sqrt(2 * M_G * dAbsT)) +\n                                           this->dK \/ this->dAT * dUa +\n                                           this->dGain[0] * dError);\n    this->dOut[1] += this->dSampleTime * (this->dAS1 \/ this->dAT * dSgnT * sqrt(2 * M_G * dAbsT) -\n                                          this->dAS2 \/ this->dAT * sqrt(2 * M_G * this->dOut[1]) +\n                                          this->dGain[1] * dError);\n\n    if (this->dOut[0] <= 0) {\n        this->dOut[0] = 0;\n    }\n    if (this->dOut[1] <= 0) {\n        this->dOut[1] = 0\n    }\n\n    std::vector<double> dOut(std::begin(this->dOut), std::end(this->dOut));\n    return dOut;\n}\n<commit_msg>Fix introduced error in cpp file<commit_after>\/** @file Observer.cpp\n * This file includes the high gain observer implementations for the two tank system with the water level of tank 2\n * as measurement value.\n *\/\n#include \"Observer.h\"\n\nstd::vector<double> HighGainObserver::compute(const double &dhT2,\n                                              const double &dUa) {\n\n    double dSgnT = sign(this->dOut[0] - this->dOut[1]);\n    double dAbsT = fabs(this->dOut[0] - this->dOut[1]);\n    double dError = this->dOut[1] - dhT2;\n\n    this->dOut[0] += this->dSampleTime * (-(this->dAS1 \/ this->dAT * dSgnT * sqrt(2 * M_G * dAbsT)) +\n                                           this->dK \/ this->dAT * dUa +\n                                           this->dGain[0] * dError);\n    this->dOut[1] += this->dSampleTime * (this->dAS1 \/ this->dAT * dSgnT * sqrt(2 * M_G * dAbsT) -\n                                          this->dAS2 \/ this->dAT * sqrt(2 * M_G * this->dOut[1]) +\n                                          this->dGain[1] * dError);\n\n    if (this->dOut[0] <= 0) {\n        this->dOut[0] = 0;\n    }\n    if (this->dOut[1] <= 0) {\n        this->dOut[1] = 0;\n    }\n\n    std::vector<double> dOut(std::begin(this->dOut), std::end(this->dOut));\n    return dOut;\n}\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\/pyext\/unknown_fields.h>\n\n#include <Python.h>\n#include <set>\n#include <memory>\n\n#include <google\/protobuf\/message.h>\n#include <google\/protobuf\/pyext\/message.h>\n#include <google\/protobuf\/pyext\/scoped_pyobject_ptr.h>\n#include <google\/protobuf\/unknown_field_set.h>\n#include <google\/protobuf\/wire_format_lite.h>\n\nnamespace google {\nnamespace protobuf {\nnamespace python {\n\nnamespace unknown_fields {\n\nstatic Py_ssize_t Len(PyObject* pself) {\n  PyUnknownFields* self =\n      reinterpret_cast<PyUnknownFields*>(pself);\n  if (self->fields == NULL) {\n    PyErr_Format(PyExc_ValueError,\n                 \"UnknownFields does not exist. \"\n                 \"The parent message might be cleared.\");\n    return -1;\n  }\n  return self->fields->field_count();\n}\n\nvoid Clear(PyUnknownFields* self) {\n  for (std::set<PyUnknownFields*>::iterator it =\n           self->sub_unknown_fields.begin();\n       it != self->sub_unknown_fields.end(); it++) {\n    Clear(*it);\n  }\n  self->fields = NULL;\n  self->sub_unknown_fields.clear();\n}\n\nPyObject* NewPyUnknownFieldRef(PyUnknownFields* parent,\n                               Py_ssize_t index);\n\nstatic PyObject* Item(PyObject* pself, Py_ssize_t index) {\n  PyUnknownFields* self =\n      reinterpret_cast<PyUnknownFields*>(pself);\n  if (self->fields == NULL) {\n    PyErr_Format(PyExc_ValueError,\n                 \"UnknownFields does not exist. \"\n                 \"The parent message might be cleared.\");\n    return NULL;\n  }\n  Py_ssize_t total_size = self->fields->field_count();\n  if (index < 0) {\n    index = total_size + index;\n  }\n  if (index < 0 || index >= total_size) {\n    PyErr_Format(PyExc_IndexError,\n                 \"index (%zd) out of range\",\n                 index);\n    return NULL;\n  }\n\n  return unknown_fields::NewPyUnknownFieldRef(self, index);\n}\n\nPyObject* NewPyUnknownFields(CMessage* c_message) {\n  PyUnknownFields* self = reinterpret_cast<PyUnknownFields*>(\n      PyType_GenericAlloc(&PyUnknownFields_Type, 0));\n  if (self == NULL) {\n    return NULL;\n  }\n  \/\/ Call \"placement new\" to initialize PyUnknownFields.\n  new (self) PyUnknownFields;\n\n  Py_INCREF(c_message);\n  self->parent = reinterpret_cast<PyObject*>(c_message);\n  Message* message = c_message->message;\n  const Reflection* reflection = message->GetReflection();\n  self->fields = &reflection->GetUnknownFields(*message);\n\n  return reinterpret_cast<PyObject*>(self);\n}\n\nPyObject* NewPyUnknownFieldRef(PyUnknownFields* parent,\n                               Py_ssize_t index) {\n  PyUnknownFieldRef* self = reinterpret_cast<PyUnknownFieldRef*>(\n      PyType_GenericAlloc(&PyUnknownFieldRef_Type, 0));\n  if (self == NULL) {\n    return NULL;\n  }\n\n  Py_INCREF(parent);\n  self->parent = parent;\n  self->index = index;\n\n  return reinterpret_cast<PyObject*>(self);\n}\n\nstatic void Dealloc(PyObject* pself) {\n  PyUnknownFields* self =\n      reinterpret_cast<PyUnknownFields*>(pself);\n  if (PyObject_TypeCheck(self->parent, &PyUnknownFields_Type)) {\n    reinterpret_cast<PyUnknownFields*>(\n        self->parent)->sub_unknown_fields.erase(self);\n  } else {\n    reinterpret_cast<CMessage*>(self->parent)->unknown_field_set = nullptr;\n  }\n  Py_CLEAR(self->parent);\n  self->~PyUnknownFields();\n  Py_TYPE(pself)->tp_free(pself);\n}\n\nstatic PySequenceMethods SqMethods = {\n  Len,        \/* sq_length *\/\n  0,          \/* sq_concat *\/\n  0,          \/* sq_repeat *\/\n  Item,       \/* sq_item *\/\n  0,          \/* sq_slice *\/\n  0,          \/* sq_ass_item *\/\n};\n\n}  \/\/ namespace unknown_fields\n\nPyTypeObject PyUnknownFields_Type = {\n  PyVarObject_HEAD_INIT(&PyType_Type, 0)\n  FULL_MODULE_NAME \".PyUnknownFields\",  \/\/ tp_name\n  sizeof(PyUnknownFields),             \/\/ tp_basicsize\n  0,                                   \/\/  tp_itemsize\n  unknown_fields::Dealloc,             \/\/  tp_dealloc\n  0,                                   \/\/  tp_print\n  0,                                   \/\/  tp_getattr\n  0,                                   \/\/  tp_setattr\n  0,                                   \/\/  tp_compare\n  0,                                   \/\/  tp_repr\n  0,                                   \/\/  tp_as_number\n  &unknown_fields::SqMethods,          \/\/  tp_as_sequence\n  0,                                   \/\/  tp_as_mapping\n  PyObject_HashNotImplemented,         \/\/  tp_hash\n  0,                                   \/\/  tp_call\n  0,                                   \/\/  tp_str\n  0,                                   \/\/  tp_getattro\n  0,                                   \/\/  tp_setattro\n  0,                                   \/\/  tp_as_buffer\n  Py_TPFLAGS_DEFAULT,                  \/\/  tp_flags\n  \"unknown field set\",                 \/\/  tp_doc\n  0,                                   \/\/  tp_traverse\n  0,                                   \/\/  tp_clear\n  0,                                   \/\/  tp_richcompare\n  0,                                   \/\/  tp_weaklistoffset\n  0,                                   \/\/  tp_iter\n  0,                                   \/\/  tp_iternext\n  0,                                   \/\/  tp_methods\n  0,                                   \/\/  tp_members\n  0,                                   \/\/  tp_getset\n  0,                                   \/\/  tp_base\n  0,                                   \/\/  tp_dict\n  0,                                   \/\/  tp_descr_get\n  0,                                   \/\/  tp_descr_set\n  0,                                   \/\/  tp_dictoffset\n  0,                                   \/\/  tp_init\n};\n\nnamespace unknown_field {\nstatic PyObject* PyUnknownFields_FromUnknownFieldSet(\n    PyUnknownFields* parent, const UnknownFieldSet& fields) {\n  PyUnknownFields* self = reinterpret_cast<PyUnknownFields*>(\n      PyType_GenericAlloc(&PyUnknownFields_Type, 0));\n  if (self == NULL) {\n    return NULL;\n  }\n  \/\/ Call \"placement new\" to initialize PyUnknownFields.\n  new (self) PyUnknownFields;\n\n  Py_INCREF(parent);\n  self->parent = reinterpret_cast<PyObject*>(parent);\n  self->fields = &fields;\n  parent->sub_unknown_fields.emplace(self);\n\n  return reinterpret_cast<PyObject*>(self);\n}\n\nconst UnknownField* GetUnknownField(PyUnknownFieldRef* self) {\n  const UnknownFieldSet* fields = self->parent->fields;\n  if (fields == NULL) {\n    PyErr_Format(PyExc_ValueError,\n                 \"UnknownField does not exist. \"\n                 \"The parent message might be cleared.\");\n    return NULL;\n  }\n  ssize_t total_size = fields->field_count();\n  if (self->index >= total_size) {\n    PyErr_Format(PyExc_ValueError,\n                 \"UnknownField does not exist. \"\n                 \"The parent message might be cleared.\");\n    return NULL;\n  }\n  return &fields->field(self->index);\n}\n\nstatic PyObject* GetFieldNumber(PyUnknownFieldRef* self, void *closure) {\n  const UnknownField* unknown_field = GetUnknownField(self);\n  if (unknown_field == NULL) {\n    return NULL;\n  }\n  return PyLong_FromLong(unknown_field->number());\n}\n\nusing internal::WireFormatLite;\nstatic PyObject* GetWireType(PyUnknownFieldRef* self, void *closure) {\n  const UnknownField* unknown_field = GetUnknownField(self);\n  if (unknown_field == NULL) {\n    return NULL;\n  }\n\n  \/\/ Assign a default value to suppress may-uninitialized warnings (errors\n  \/\/ when built in some places).\n  WireFormatLite::WireType wire_type = WireFormatLite::WIRETYPE_VARINT;\n  switch (unknown_field->type()) {\n    case UnknownField::TYPE_VARINT:\n      wire_type = WireFormatLite::WIRETYPE_VARINT;\n      break;\n    case UnknownField::TYPE_FIXED32:\n      wire_type = WireFormatLite::WIRETYPE_FIXED32;\n      break;\n    case UnknownField::TYPE_FIXED64:\n      wire_type = WireFormatLite::WIRETYPE_FIXED64;\n      break;\n    case UnknownField::TYPE_LENGTH_DELIMITED:\n      wire_type = WireFormatLite::WIRETYPE_LENGTH_DELIMITED;\n      break;\n    case UnknownField::TYPE_GROUP:\n      wire_type = WireFormatLite::WIRETYPE_START_GROUP;\n      break;\n  }\n  return PyLong_FromLong(wire_type);\n}\n\nstatic PyObject* GetData(PyUnknownFieldRef* self, void *closure) {\n  const UnknownField* field = GetUnknownField(self);\n  if (field == NULL) {\n    return NULL;\n  }\n  PyObject* data = NULL;\n  switch (field->type()) {\n    case UnknownField::TYPE_VARINT:\n      data = PyLong_FromLong(field->varint());\n      break;\n    case UnknownField::TYPE_FIXED32:\n      data = PyLong_FromLong(field->fixed32());\n      break;\n    case UnknownField::TYPE_FIXED64:\n      data = PyLong_FromLong(field->fixed64());\n      break;\n    case UnknownField::TYPE_LENGTH_DELIMITED:\n      data = PyBytes_FromStringAndSize(field->length_delimited().data(),\n                                       field->GetLengthDelimitedSize());\n      break;\n    case UnknownField::TYPE_GROUP:\n      data = PyUnknownFields_FromUnknownFieldSet(\n          self->parent, field->group());\n      break;\n  }\n  return data;\n}\n\nstatic void Dealloc(PyObject* pself) {\n  PyUnknownFieldRef* self =\n      reinterpret_cast<PyUnknownFieldRef*>(pself);\n  Py_CLEAR(self->parent);\n}\n\nstatic PyGetSetDef Getters[] = {\n  {\"field_number\", (getter)GetFieldNumber, NULL},\n  {\"wire_type\", (getter)GetWireType, NULL},\n  {\"data\", (getter)GetData, NULL},\n  {NULL}\n};\n\n}  \/\/ namespace unknown_field\n\nPyTypeObject PyUnknownFieldRef_Type = {\n  PyVarObject_HEAD_INIT(&PyType_Type, 0)\n  FULL_MODULE_NAME \".PyUnknownFieldRef\",  \/\/ tp_name\n  sizeof(PyUnknownFieldRef),           \/\/  tp_basicsize\n  0,                                   \/\/  tp_itemsize\n  unknown_field::Dealloc,              \/\/  tp_dealloc\n  0,                                   \/\/  tp_print\n  0,                                   \/\/  tp_getattr\n  0,                                   \/\/  tp_setattr\n  0,                                   \/\/  tp_compare\n  0,                                   \/\/  tp_repr\n  0,                                   \/\/  tp_as_number\n  0,                                   \/\/  tp_as_sequence\n  0,                                   \/\/  tp_as_mapping\n  PyObject_HashNotImplemented,         \/\/  tp_hash\n  0,                                   \/\/  tp_call\n  0,                                   \/\/  tp_str\n  0,                                   \/\/  tp_getattro\n  0,                                   \/\/  tp_setattro\n  0,                                   \/\/  tp_as_buffer\n  Py_TPFLAGS_DEFAULT,                  \/\/  tp_flags\n  \"unknown field\",                     \/\/  tp_doc\n  0,                                   \/\/  tp_traverse\n  0,                                   \/\/  tp_clear\n  0,                                   \/\/  tp_richcompare\n  0,                                   \/\/  tp_weaklistoffset\n  0,                                   \/\/  tp_iter\n  0,                                   \/\/  tp_iternext\n  0,                                   \/\/  tp_methods\n  0,                                   \/\/  tp_members\n  unknown_field::Getters,              \/\/  tp_getset\n  0,                                   \/\/  tp_base\n  0,                                   \/\/  tp_dict\n  0,                                   \/\/  tp_descr_get\n  0,                                   \/\/  tp_descr_set\n  0,                                   \/\/  tp_dictoffset\n  0,                                   \/\/  tp_init\n};\n\n\n}  \/\/ namespace python\n}  \/\/ namespace protobuf\n}  \/\/ namespace google\n<commit_msg>Prevent integer overflow for unknown fields<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\/pyext\/unknown_fields.h>\n\n#include <Python.h>\n#include <set>\n#include <memory>\n\n#include <google\/protobuf\/message.h>\n#include <google\/protobuf\/pyext\/message.h>\n#include <google\/protobuf\/pyext\/scoped_pyobject_ptr.h>\n#include <google\/protobuf\/unknown_field_set.h>\n#include <google\/protobuf\/wire_format_lite.h>\n\nnamespace google {\nnamespace protobuf {\nnamespace python {\n\nnamespace unknown_fields {\n\nstatic Py_ssize_t Len(PyObject* pself) {\n  PyUnknownFields* self =\n      reinterpret_cast<PyUnknownFields*>(pself);\n  if (self->fields == NULL) {\n    PyErr_Format(PyExc_ValueError,\n                 \"UnknownFields does not exist. \"\n                 \"The parent message might be cleared.\");\n    return -1;\n  }\n  return self->fields->field_count();\n}\n\nvoid Clear(PyUnknownFields* self) {\n  for (std::set<PyUnknownFields*>::iterator it =\n           self->sub_unknown_fields.begin();\n       it != self->sub_unknown_fields.end(); it++) {\n    Clear(*it);\n  }\n  self->fields = NULL;\n  self->sub_unknown_fields.clear();\n}\n\nPyObject* NewPyUnknownFieldRef(PyUnknownFields* parent,\n                               Py_ssize_t index);\n\nstatic PyObject* Item(PyObject* pself, Py_ssize_t index) {\n  PyUnknownFields* self =\n      reinterpret_cast<PyUnknownFields*>(pself);\n  if (self->fields == NULL) {\n    PyErr_Format(PyExc_ValueError,\n                 \"UnknownFields does not exist. \"\n                 \"The parent message might be cleared.\");\n    return NULL;\n  }\n  Py_ssize_t total_size = self->fields->field_count();\n  if (index < 0) {\n    index = total_size + index;\n  }\n  if (index < 0 || index >= total_size) {\n    PyErr_Format(PyExc_IndexError,\n                 \"index (%zd) out of range\",\n                 index);\n    return NULL;\n  }\n\n  return unknown_fields::NewPyUnknownFieldRef(self, index);\n}\n\nPyObject* NewPyUnknownFields(CMessage* c_message) {\n  PyUnknownFields* self = reinterpret_cast<PyUnknownFields*>(\n      PyType_GenericAlloc(&PyUnknownFields_Type, 0));\n  if (self == NULL) {\n    return NULL;\n  }\n  \/\/ Call \"placement new\" to initialize PyUnknownFields.\n  new (self) PyUnknownFields;\n\n  Py_INCREF(c_message);\n  self->parent = reinterpret_cast<PyObject*>(c_message);\n  Message* message = c_message->message;\n  const Reflection* reflection = message->GetReflection();\n  self->fields = &reflection->GetUnknownFields(*message);\n\n  return reinterpret_cast<PyObject*>(self);\n}\n\nPyObject* NewPyUnknownFieldRef(PyUnknownFields* parent,\n                               Py_ssize_t index) {\n  PyUnknownFieldRef* self = reinterpret_cast<PyUnknownFieldRef*>(\n      PyType_GenericAlloc(&PyUnknownFieldRef_Type, 0));\n  if (self == NULL) {\n    return NULL;\n  }\n\n  Py_INCREF(parent);\n  self->parent = parent;\n  self->index = index;\n\n  return reinterpret_cast<PyObject*>(self);\n}\n\nstatic void Dealloc(PyObject* pself) {\n  PyUnknownFields* self =\n      reinterpret_cast<PyUnknownFields*>(pself);\n  if (PyObject_TypeCheck(self->parent, &PyUnknownFields_Type)) {\n    reinterpret_cast<PyUnknownFields*>(\n        self->parent)->sub_unknown_fields.erase(self);\n  } else {\n    reinterpret_cast<CMessage*>(self->parent)->unknown_field_set = nullptr;\n  }\n  Py_CLEAR(self->parent);\n  self->~PyUnknownFields();\n  Py_TYPE(pself)->tp_free(pself);\n}\n\nstatic PySequenceMethods SqMethods = {\n  Len,        \/* sq_length *\/\n  0,          \/* sq_concat *\/\n  0,          \/* sq_repeat *\/\n  Item,       \/* sq_item *\/\n  0,          \/* sq_slice *\/\n  0,          \/* sq_ass_item *\/\n};\n\n}  \/\/ namespace unknown_fields\n\nPyTypeObject PyUnknownFields_Type = {\n  PyVarObject_HEAD_INIT(&PyType_Type, 0)\n  FULL_MODULE_NAME \".PyUnknownFields\",  \/\/ tp_name\n  sizeof(PyUnknownFields),             \/\/ tp_basicsize\n  0,                                   \/\/  tp_itemsize\n  unknown_fields::Dealloc,             \/\/  tp_dealloc\n  0,                                   \/\/  tp_print\n  0,                                   \/\/  tp_getattr\n  0,                                   \/\/  tp_setattr\n  0,                                   \/\/  tp_compare\n  0,                                   \/\/  tp_repr\n  0,                                   \/\/  tp_as_number\n  &unknown_fields::SqMethods,          \/\/  tp_as_sequence\n  0,                                   \/\/  tp_as_mapping\n  PyObject_HashNotImplemented,         \/\/  tp_hash\n  0,                                   \/\/  tp_call\n  0,                                   \/\/  tp_str\n  0,                                   \/\/  tp_getattro\n  0,                                   \/\/  tp_setattro\n  0,                                   \/\/  tp_as_buffer\n  Py_TPFLAGS_DEFAULT,                  \/\/  tp_flags\n  \"unknown field set\",                 \/\/  tp_doc\n  0,                                   \/\/  tp_traverse\n  0,                                   \/\/  tp_clear\n  0,                                   \/\/  tp_richcompare\n  0,                                   \/\/  tp_weaklistoffset\n  0,                                   \/\/  tp_iter\n  0,                                   \/\/  tp_iternext\n  0,                                   \/\/  tp_methods\n  0,                                   \/\/  tp_members\n  0,                                   \/\/  tp_getset\n  0,                                   \/\/  tp_base\n  0,                                   \/\/  tp_dict\n  0,                                   \/\/  tp_descr_get\n  0,                                   \/\/  tp_descr_set\n  0,                                   \/\/  tp_dictoffset\n  0,                                   \/\/  tp_init\n};\n\nnamespace unknown_field {\nstatic PyObject* PyUnknownFields_FromUnknownFieldSet(\n    PyUnknownFields* parent, const UnknownFieldSet& fields) {\n  PyUnknownFields* self = reinterpret_cast<PyUnknownFields*>(\n      PyType_GenericAlloc(&PyUnknownFields_Type, 0));\n  if (self == NULL) {\n    return NULL;\n  }\n  \/\/ Call \"placement new\" to initialize PyUnknownFields.\n  new (self) PyUnknownFields;\n\n  Py_INCREF(parent);\n  self->parent = reinterpret_cast<PyObject*>(parent);\n  self->fields = &fields;\n  parent->sub_unknown_fields.emplace(self);\n\n  return reinterpret_cast<PyObject*>(self);\n}\n\nconst UnknownField* GetUnknownField(PyUnknownFieldRef* self) {\n  const UnknownFieldSet* fields = self->parent->fields;\n  if (fields == NULL) {\n    PyErr_Format(PyExc_ValueError,\n                 \"UnknownField does not exist. \"\n                 \"The parent message might be cleared.\");\n    return NULL;\n  }\n  ssize_t total_size = fields->field_count();\n  if (self->index >= total_size) {\n    PyErr_Format(PyExc_ValueError,\n                 \"UnknownField does not exist. \"\n                 \"The parent message might be cleared.\");\n    return NULL;\n  }\n  return &fields->field(self->index);\n}\n\nstatic PyObject* GetFieldNumber(PyUnknownFieldRef* self, void *closure) {\n  const UnknownField* unknown_field = GetUnknownField(self);\n  if (unknown_field == NULL) {\n    return NULL;\n  }\n  return PyLong_FromLong(unknown_field->number());\n}\n\nusing internal::WireFormatLite;\nstatic PyObject* GetWireType(PyUnknownFieldRef* self, void *closure) {\n  const UnknownField* unknown_field = GetUnknownField(self);\n  if (unknown_field == NULL) {\n    return NULL;\n  }\n\n  \/\/ Assign a default value to suppress may-uninitialized warnings (errors\n  \/\/ when built in some places).\n  WireFormatLite::WireType wire_type = WireFormatLite::WIRETYPE_VARINT;\n  switch (unknown_field->type()) {\n    case UnknownField::TYPE_VARINT:\n      wire_type = WireFormatLite::WIRETYPE_VARINT;\n      break;\n    case UnknownField::TYPE_FIXED32:\n      wire_type = WireFormatLite::WIRETYPE_FIXED32;\n      break;\n    case UnknownField::TYPE_FIXED64:\n      wire_type = WireFormatLite::WIRETYPE_FIXED64;\n      break;\n    case UnknownField::TYPE_LENGTH_DELIMITED:\n      wire_type = WireFormatLite::WIRETYPE_LENGTH_DELIMITED;\n      break;\n    case UnknownField::TYPE_GROUP:\n      wire_type = WireFormatLite::WIRETYPE_START_GROUP;\n      break;\n  }\n  return PyLong_FromLong(wire_type);\n}\n\nstatic PyObject* GetData(PyUnknownFieldRef* self, void *closure) {\n  const UnknownField* field = GetUnknownField(self);\n  if (field == NULL) {\n    return NULL;\n  }\n  PyObject* data = NULL;\n  switch (field->type()) {\n    case UnknownField::TYPE_VARINT:\n      data = PyLong_FromUnsignedLongLong(field->varint());\n      break;\n    case UnknownField::TYPE_FIXED32:\n      data = PyLong_FromUnsignedLong(field->fixed32());\n      break;\n    case UnknownField::TYPE_FIXED64:\n      data = PyLong_FromUnsignedLongLong(field->fixed64());\n      break;\n    case UnknownField::TYPE_LENGTH_DELIMITED:\n      data = PyBytes_FromStringAndSize(field->length_delimited().data(),\n                                       field->GetLengthDelimitedSize());\n      break;\n    case UnknownField::TYPE_GROUP:\n      data = PyUnknownFields_FromUnknownFieldSet(\n          self->parent, field->group());\n      break;\n  }\n  return data;\n}\n\nstatic void Dealloc(PyObject* pself) {\n  PyUnknownFieldRef* self =\n      reinterpret_cast<PyUnknownFieldRef*>(pself);\n  Py_CLEAR(self->parent);\n}\n\nstatic PyGetSetDef Getters[] = {\n  {\"field_number\", (getter)GetFieldNumber, NULL},\n  {\"wire_type\", (getter)GetWireType, NULL},\n  {\"data\", (getter)GetData, NULL},\n  {NULL}\n};\n\n}  \/\/ namespace unknown_field\n\nPyTypeObject PyUnknownFieldRef_Type = {\n  PyVarObject_HEAD_INIT(&PyType_Type, 0)\n  FULL_MODULE_NAME \".PyUnknownFieldRef\",  \/\/ tp_name\n  sizeof(PyUnknownFieldRef),           \/\/  tp_basicsize\n  0,                                   \/\/  tp_itemsize\n  unknown_field::Dealloc,              \/\/  tp_dealloc\n  0,                                   \/\/  tp_print\n  0,                                   \/\/  tp_getattr\n  0,                                   \/\/  tp_setattr\n  0,                                   \/\/  tp_compare\n  0,                                   \/\/  tp_repr\n  0,                                   \/\/  tp_as_number\n  0,                                   \/\/  tp_as_sequence\n  0,                                   \/\/  tp_as_mapping\n  PyObject_HashNotImplemented,         \/\/  tp_hash\n  0,                                   \/\/  tp_call\n  0,                                   \/\/  tp_str\n  0,                                   \/\/  tp_getattro\n  0,                                   \/\/  tp_setattro\n  0,                                   \/\/  tp_as_buffer\n  Py_TPFLAGS_DEFAULT,                  \/\/  tp_flags\n  \"unknown field\",                     \/\/  tp_doc\n  0,                                   \/\/  tp_traverse\n  0,                                   \/\/  tp_clear\n  0,                                   \/\/  tp_richcompare\n  0,                                   \/\/  tp_weaklistoffset\n  0,                                   \/\/  tp_iter\n  0,                                   \/\/  tp_iternext\n  0,                                   \/\/  tp_methods\n  0,                                   \/\/  tp_members\n  unknown_field::Getters,              \/\/  tp_getset\n  0,                                   \/\/  tp_base\n  0,                                   \/\/  tp_dict\n  0,                                   \/\/  tp_descr_get\n  0,                                   \/\/  tp_descr_set\n  0,                                   \/\/  tp_dictoffset\n  0,                                   \/\/  tp_init\n};\n\n\n}  \/\/ namespace python\n}  \/\/ namespace protobuf\n}  \/\/ namespace google\n<|endoftext|>"}
{"text":"<commit_before>\/* ========================================================================= *\n * File: memory_notification.cpp\n *\n * This file is part of Memory Notification Library (libmemnotifyqt)\n *\n * Copyright (C) 2010 Nokia Corporation. All rights reserved.\n *\n * Contacts: Leonid Moiseichuk <leonid.moiseichuk@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n * ========================================================================= *\/\n\n\/* ========================================================================= *\n* Includes.\n* ========================================================================= *\/\n\n#include <sys\/types.h>\n#include <aio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <QSettings>\n#include <memnotify\/watcher_builder.hpp>\n#include <memnotify\/memory_notification.hpp>\n\nBEGIN_MEMNOTIFY_NAMESPACE\n\n\/* ========================================================================= *\n* Class MemoryNotification.\n* ========================================================================= *\/\n\nstatic MemoryNotification*  MemoryNotification :: ourMemoryNotification = NULL;\n\n\nbool MemoryNotification :: setup(const char* pathSpecification)\n{\n  const bool wasEnabled = myEnabled;\n\n  \/* We should disable functionality if it is enabled *\/\n  if (myEnabled && !disable())\n    return false;\n\n  \/* If no files pointed the default file should be loaded *\/\n  if ( !(pathSpecification && *pathSpecification) )\n    pathSpecification = \"default\";\n\n  \/* if we have some watchers in list - they must be removed *\/\n  clearWatchers();\n\n  const QStringList files = QString(pathSpecification).split(\":\", QString::SkipEmptyParts);\n\n  foreach(QString file, files)\n  {\n    const QSettings   config(file, QSettings::IniFormat);\n    \/* array with names of thresholds *\/\n    const QStringList tholds(config.childGroups());\n    \/* array with data to create watchers *\/\n    const QStringList data(config.allKeys());\n\n    \/* Now trying to build the watchers, one by one *\/\n    foreach(QString thold, tholds)\n    {\n      Watcher* newcomer = WatcherBuilder::build(data, thold);\n      Q_ASSERT(NULL != newcomer);\n#if MEMNOTIFY_DUMP\n      Q_ASSERT(true == newcomer->valid());\n#endif\n      if ( newcomer )\n        myWatchers.append(newcomer);\n    } \/* for each thold *\/\n  } \/* for each file *\/\n\n  \/* As a result we must have at least one watcher created *\/\n  if ( myWatchers.isEmpty() )\n    return false;\n\n  \/* We should enable functionality back if it was enabled *\/\n  return (!wasEnabled || enable());\n} \/* setup *\/\n\nbool MemoryNotification :: poll()\n{\n  \/* FIXME: QThread-based solution for epoll expected. AIO doesn't work as necessary *\/\n  return false;\n} \/* poll *\/\n\nuint MemoryNotification :: query(int* fds, uint size)\n{\n  uint index = 0;\n  if (myEnabled && fd && myWatchers->count() <= (int)size)\n  {\n    foreach(const Watcher* watcher, myWatchers)\n    {\n      const int handler = (watcher ? watcher->handler() : -1);\n      if ( handler < 0 )\n        return 0;\n      fds[index++] = handler;\n    }\n  }\n\n  return index;\n} \/* query *\/\n\nbool MemoryNotification :: process(const int* fds, uint counter)\n{\n  \/* we should be enabled *\/\n  if ( !myEnable )\n    return false;\n\n  \/* Check the parameters *\/\n  if ( !fd )\n    return false;\n\n  if ( !counter )\n    return true;\n\n  \/* result of processing, should be true if all watchers handled OK *\/\n  bool result = true;\n  QList<Watcher*> updated;\n\n  \/* And now handling the all incoming events *\/\n  for (uint ifd = 0; ifd < counter; ifd++)\n  {\n    const int fd = fds[ifd];\n\n    \/* First - we should find the watcher *\/\n    foreach(Watcher* cursor, myWatchers)\n    {\n      Q_ASSERT(NULL != watcher);\n      if (watcher && fd == watcher->handler())\n      {\n        const bool oldState = watcher->state();\n        if ( watcher->process() )\n        {\n          if (oldState != watcher->state())\n            updated.append(watcher);\n        }\n        else\n        {\n          \/* we are failed with processing but we must continue until the end *\/\n          result = false;\n        }\n      }\n    } \/* scan for watcher *\/\n  } \/* for each file descriptor *\/\n\n  \/* Now we have list of updated watchers -> sending the notifications *\/\n  foreach(const Watcher* watcher, updated)\n  {\n    Q_ASSERT(NULL != watcher);\n    const QString& name  = watcher->name();\n    const bool     state = watcher->state();\n\n    \/* if necessary - notify callbacks *\/\n    if (myObservers.count() > 0)\n    {\n      foreach(OBSERVER observer, myObservers)\n      {\n        Q_ASSERT(NULL != observer);\n        if ( observer )\n          observer(name, state);\n      }\n    }\n\n    \/* if necessary - notify subscribers *\/\n    if (mySignalCounter > 0)\n      emit notified(name, state);\n  } \/* for each updated *\/\n\n  return result;\n} \/* process *\/\n\nbool MemoryNotification :: enable()\n{\n  if ( myEnabled )\n    return false;\n\n  if (0 == mySignalCounter && myObservers.isEmpty())\n    return false;\n\n  if ( myWatchers.isEmpty() )\n    return false;\n\n  \/* disable watchers one by one *\/\n  int enabled_counter = 0;\n  foreach(Watcher* watcher, myWatchers)\n  {\n    if (watcher && watcher->enable())\n    {\n      \/* item successfully enabled *\/\n      enabled_counter++;\n    }\n  }\n\n  \/* set common enabled flag on only if we have all items enabled *\/\n  myEnabled = (myWatchers->count() == enabled_counter);\n\n  \/* function done if no items enabled *\/\n  return (myEnabled);\n} \/* enable *\/\n\nbool MemoryNotification :: disable()\n{\n  if ( !myEnabled )\n    return false;\n\n  \/* disable watchers one by one *\/\n  int disabled_counter = 0;\n  foreach(Watcher* watcher, myWatchers)\n  {\n    if (watcher && watcher->disable())\n    {\n      \/* item successfully disabled *\/\n      disabled_counter++;\n    }\n  }\n\n  \/* set common enabled flag off only if we have all items disabled *\/\n  myEnabled = (myWatchers->count() != disabled_counter);\n\n  \/* function done if no items enabled *\/\n  return (! myEnabled);\n} \/* disable *\/\n\nbool MemoryNotification :: valid() const\n{\n  \/* first, we must have subscribed items *\/\n  if (0 == mySignalCounter && myObservers.isEmpty())\n    return false;\n\n  \/* we must have sources for signal generation *\/\n  if ( myWatchers.isEmpty() )\n    return false;\n\n  \/* All observers must be non-null *\/\n  if ( myObservers.indexOf(NULL) >= 0 )\n    return false;\n\n  \/* All watchers must be non-null, valid and maybe enabled *\/\n  foreach(const Watcher* watcher, myWatchers)\n  {\n    if (watcher && watcher->valid() && watcher->enabled() == myEnabled)\n    {\n      \/* check the next item *\/\n      continue;\n    }\n    return false;\n  }\n\n  return true;\n} \/* valid *\/\n\nvoid MemoryNotification :: clearWatchers()\n{\n  if (myWatchers.count() > 0)\n  {\n    foreach (Watcher* watcher, myWatchers)\n    {\n      if (watcher)\n        delete watcher;\n    }\n    myWatchers.clear();\n  }\n} \/* clearWatchers *\/\n\nvoid MemoryNotification :: dump()\n{\n#if MEMNOTIFY_DUMP\n  printf (\"MemoryNotification %08x {\\n\", (uint)this);\n\nZZZ\n  printf (\"}\\n\");\n#endif \/* if MEMNOTIFY_DUMP *\/\n}\n\nEND_MEMOTIFY_NAMESPACE\n\n\/* =================[ end of file memnotify\/memory_notification.cpp ]========================= *\/\n<commit_msg>added MemoryNotification::dump<commit_after>\/* ========================================================================= *\n * File: memory_notification.cpp\n *\n * This file is part of Memory Notification Library (libmemnotifyqt)\n *\n * Copyright (C) 2010 Nokia Corporation. All rights reserved.\n *\n * Contacts: Leonid Moiseichuk <leonid.moiseichuk@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n * ========================================================================= *\/\n\n\/* ========================================================================= *\n* Includes.\n* ========================================================================= *\/\n\n#include <sys\/types.h>\n#include <aio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <QSettings>\n#include <memnotify\/watcher_builder.hpp>\n#include <memnotify\/memory_notification.hpp>\n\nBEGIN_MEMNOTIFY_NAMESPACE\n\n\/* ========================================================================= *\n* Class MemoryNotification.\n* ========================================================================= *\/\n\nstatic MemoryNotification*  MemoryNotification :: ourMemoryNotification = NULL;\n\n\nbool MemoryNotification :: setup(const char* pathSpecification)\n{\n  const bool wasEnabled = myEnabled;\n\n  \/* We should disable functionality if it is enabled *\/\n  if (myEnabled && !disable())\n    return false;\n\n  \/* If no files pointed the default file should be loaded *\/\n  if ( !(pathSpecification && *pathSpecification) )\n    pathSpecification = \"default\";\n\n  \/* if we have some watchers in list - they must be removed *\/\n  clearWatchers();\n\n  const QStringList files = QString(pathSpecification).split(\":\", QString::SkipEmptyParts);\n\n  foreach(QString file, files)\n  {\n    const QSettings   config(file, QSettings::IniFormat);\n    \/* array with names of thresholds *\/\n    const QStringList tholds(config.childGroups());\n    \/* array with data to create watchers *\/\n    const QStringList data(config.allKeys());\n\n    \/* Now trying to build the watchers, one by one *\/\n    foreach(QString thold, tholds)\n    {\n      Watcher* newcomer = WatcherBuilder::build(data, thold);\n      Q_ASSERT(NULL != newcomer);\n#if MEMNOTIFY_DUMP\n      Q_ASSERT(true == newcomer->valid());\n#endif\n      if ( newcomer )\n        myWatchers.append(newcomer);\n    } \/* for each thold *\/\n  } \/* for each file *\/\n\n  \/* As a result we must have at least one watcher created *\/\n  if ( myWatchers.isEmpty() )\n    return false;\n\n  \/* We should enable functionality back if it was enabled *\/\n  return (!wasEnabled || enable());\n} \/* setup *\/\n\nbool MemoryNotification :: poll()\n{\n  \/* FIXME: QThread-based solution for epoll expected. AIO doesn't work as necessary *\/\n  return false;\n} \/* poll *\/\n\nuint MemoryNotification :: query(int* fds, uint size)\n{\n  uint index = 0;\n  if (myEnabled && fd && myWatchers->count() <= (int)size)\n  {\n    foreach(const Watcher* watcher, myWatchers)\n    {\n      const int handler = (watcher ? watcher->handler() : -1);\n      if ( handler < 0 )\n        return 0;\n      fds[index++] = handler;\n    }\n  }\n\n  return index;\n} \/* query *\/\n\nbool MemoryNotification :: process(const int* fds, uint counter)\n{\n  \/* we should be enabled *\/\n  if ( !myEnable )\n    return false;\n\n  \/* Check the parameters *\/\n  if ( !fd )\n    return false;\n\n  if ( !counter )\n    return true;\n\n  \/* result of processing, should be true if all watchers handled OK *\/\n  bool result = true;\n  QList<Watcher*> updated;\n\n  \/* And now handling the all incoming events *\/\n  for (uint ifd = 0; ifd < counter; ifd++)\n  {\n    const int fd = fds[ifd];\n\n    \/* First - we should find the watcher *\/\n    foreach(Watcher* cursor, myWatchers)\n    {\n      Q_ASSERT(NULL != watcher);\n      if (watcher && fd == watcher->handler())\n      {\n        const bool oldState = watcher->state();\n        if ( watcher->process() )\n        {\n          if (oldState != watcher->state())\n            updated.append(watcher);\n        }\n        else\n        {\n          \/* we are failed with processing but we must continue until the end *\/\n          result = false;\n        }\n      }\n    } \/* scan for watcher *\/\n  } \/* for each file descriptor *\/\n\n  \/* Now we have list of updated watchers -> sending the notifications *\/\n  foreach(const Watcher* watcher, updated)\n  {\n    Q_ASSERT(NULL != watcher);\n    const QString& name  = watcher->name();\n    const bool     state = watcher->state();\n\n    \/* if necessary - notify callbacks *\/\n    if (myObservers.count() > 0)\n    {\n      foreach(OBSERVER observer, myObservers)\n      {\n        Q_ASSERT(NULL != observer);\n        if ( observer )\n          observer(name, state);\n      }\n    }\n\n    \/* if necessary - notify subscribers *\/\n    if (mySignalCounter > 0)\n      emit notified(name, state);\n  } \/* for each updated *\/\n\n  return result;\n} \/* process *\/\n\nbool MemoryNotification :: enable()\n{\n  if ( myEnabled )\n    return false;\n\n  if (0 == mySignalCounter && myObservers.isEmpty())\n    return false;\n\n  if ( myWatchers.isEmpty() )\n    return false;\n\n  \/* disable watchers one by one *\/\n  int enabled_counter = 0;\n  foreach(Watcher* watcher, myWatchers)\n  {\n    if (watcher && watcher->enable())\n    {\n      \/* item successfully enabled *\/\n      enabled_counter++;\n    }\n  }\n\n  \/* set common enabled flag on only if we have all items enabled *\/\n  myEnabled = (myWatchers->count() == enabled_counter);\n\n  \/* function done if no items enabled *\/\n  return (myEnabled);\n} \/* enable *\/\n\nbool MemoryNotification :: disable()\n{\n  if ( !myEnabled )\n    return false;\n\n  \/* disable watchers one by one *\/\n  int disabled_counter = 0;\n  foreach(Watcher* watcher, myWatchers)\n  {\n    if (watcher && watcher->disable())\n    {\n      \/* item successfully disabled *\/\n      disabled_counter++;\n    }\n  }\n\n  \/* set common enabled flag off only if we have all items disabled *\/\n  myEnabled = (myWatchers->count() != disabled_counter);\n\n  \/* function done if no items enabled *\/\n  return (! myEnabled);\n} \/* disable *\/\n\nbool MemoryNotification :: valid() const\n{\n  \/* first, we must have subscribed items *\/\n  if (0 == mySignalCounter && myObservers.isEmpty())\n    return false;\n\n  \/* we must have sources for signal generation *\/\n  if ( myWatchers.isEmpty() )\n    return false;\n\n  \/* All observers must be non-null *\/\n  if ( myObservers.indexOf(NULL) >= 0 )\n    return false;\n\n  \/* All watchers must be non-null, valid and maybe enabled *\/\n  foreach(const Watcher* watcher, myWatchers)\n  {\n    if (watcher && watcher->valid() && watcher->enabled() == myEnabled)\n    {\n      \/* check the next item *\/\n      continue;\n    }\n    return false;\n  }\n\n  return true;\n} \/* valid *\/\n\nvoid MemoryNotification :: clearWatchers()\n{\n  if (myWatchers.count() > 0)\n  {\n    foreach (Watcher* watcher, myWatchers)\n    {\n      if (watcher)\n        delete watcher;\n    }\n    myWatchers.clear();\n  }\n} \/* clearWatchers *\/\n\nvoid MemoryNotification :: dump()\n{\n#if MEMNOTIFY_DUMP\n  printf (\"MemoryNotification %08x {\\n\", (uint)this);\n  printf (\"  outMemoryNotification %08x signal counter %u enabled %d poll thread %08x\\n\",\n          (uint)ourMemoryNotification, mySignalCounter, myEnabled, (uint)myThread\n      );\n\n  printf (\"  observers %d {\\n\", myObservers.count());\n  for (const OBSERVER observer, myObservers)\n  {\n    printf (\"\\t%08x\\n\", (uint)observer);\n  }\n  printf (\"  }\\n\");\n\n  printf (\"  watchers %d {\\n\", myWatchers.count());\n  for (const Watchers watcher, myWatchers)\n  {\n    printf (\"\\t%08x \", (uint)watcher);\n    if (watcher)\n      watcher->dump();\n    else\n      printf (\"\\n\");\n  }\n  printf (\"  }\\n\");\n\n  if ( myThread )\n    ((const PollThread*)myThread)->dump();\n\n  printf (\"}\\n\");\n#endif \/* if MEMNOTIFY_DUMP *\/\n}\n\nEND_MEMOTIFY_NAMESPACE\n\n\/* =================[ end of file memnotify\/memory_notification.cpp ]========================= *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n\n#ifdef EXECUTOR\n#define AUTOMATIC_CONVERSIONS\n#include <QuickDraw.h>\n#include <CQuickDraw.h>\n#include <MemoryMgr.h>\n\nusing namespace Executor;\nextern QDGlobals qd;\n\n#define PTR(x) (&guestref(x))\n\n    \/\/ FIXME: Executor still defines Pattern as an array, rather than an array wrapped in a struct\n#define PATREF(pat) (pat)\n#else\n#include <Quickdraw.h>\n#include <QDOffscreen.h>\n\n#define PTR(x) (&x)\n#define PATREF(pat) (&(pat))\n#endif\n\nstruct OffscreenPort\n{\n    GrafPort port;\n    Rect r;\n\n    OffscreenPort(int height = 2, int width = 2)\n    {\n        OpenPort(&port);\n\n        short rowBytes = (width + 31) \/ 31 * 4;\n        port.portBits.rowBytes = rowBytes;\n        port.portBits.baseAddr = NewPtrClear(rowBytes * height);\n        SetRect(&r, 0,0,width,height);\n        port.portBits.bounds = r;\n\n        set();\n    }\n\n    ~OffscreenPort()\n    {\n        ClosePort(&port);\n    }\n\n    void set()\n    {\n        SetPort(&port);\n    }\n\n    uint8_t data(int row, int offset)\n    {\n        return port.portBits.baseAddr[row * port.portBits.rowBytes + offset];\n    }\n};\n\nstruct OffscreenWorld\n{\n    GWorldPtr world = nullptr;\n    Rect r;\n    \n    OffscreenWorld(int depth, int height = 2, int width = 2)\n    {\n        SetRect(&r,0,0,2,2);\n        NewGWorld(PTR(world), depth, &r, nullptr, nullptr, 0);\n        LockPixels(world->portPixMap);\n        set();\n    }\n\n    ~OffscreenWorld()\n    {\n        if((GrafPtr)world == qd.thePort)\n            SetGDevice(GetMainDevice());\n        DisposeGWorld(world);\n    }\n\n    void set()\n    {\n        SetGWorld(world, nullptr);\n    }\n\n    uint8_t data(int row, int offset)\n    {\n        Ptr baseAddr = (*world->portPixMap)->baseAddr;\n        uint8_t *data = (uint8_t*)baseAddr;\n        short rowBytes = (*world->portPixMap)->rowBytes;\n        rowBytes &= 0x3FFF;\n\n        return data[row * rowBytes + offset];\n    }\n\n    uint16_t data16(int row, int offset)\n    {\n        return data(row, offset*2) * 256 + data(row, offset*2+1);\n    }\n    uint32_t data32(int row, int offset)\n    {\n        return data16(row, offset*2) * 65536 + data16(row, offset*2+1);\n    }\n};\n\n\nTEST(QuickDraw, BWLine1)\n{\n    OffscreenPort port;\n\n    EraseRect(&port.r);\n    MoveTo(0,0);\n    LineTo(2,2);\n\n    EXPECT_EQ(0x80, port.data(0,0));\n    EXPECT_EQ(0x40, port.data(1,0));\n}\n\nTEST(QuickDraw, GWorld8)\n{\n    OffscreenWorld world(8);\n\n    EraseRect(&world.r);\n    MoveTo(0,0);\n    LineTo(2,2);\n    \n    EXPECT_EQ(255, world.data(0,0));\n    EXPECT_EQ(0, world.data(0,1));\n    EXPECT_EQ(0, world.data(1,0));\n    EXPECT_EQ(255, world.data(1,1));\n}\n\nTEST(QuickDraw, GWorld16)\n{\n    OffscreenWorld world(16);\n\n    EraseRect(&world.r);\n    MoveTo(0,0);\n    LineTo(2,2);\n    \n    EXPECT_EQ(0, world.data16(0,0));\n    EXPECT_EQ(0x7FFF, world.data16(0,1));\n}\n\nTEST(QuickDraw, GWorld32)\n{\n    OffscreenWorld world(32);\n\n    EraseRect(&world.r);\n    MoveTo(0,0);\n    LineTo(2,2);\n    \n    EXPECT_EQ(0, world.data32(0,0));\n    EXPECT_EQ(0x00FFFFFF, world.data32(0,1));\n}\n\nTEST(QuickDraw, BasicQDColorBW)\n{\n    OffscreenPort port;\n\n    FillRect(&port.r, PATREF(qd.gray));\n    EXPECT_EQ(0x80, port.data(0,0));\n    EXPECT_EQ(0x40, port.data(1,0));\n    \n    ForeColor(whiteColor);\n    BackColor(redColor);\n    FillRect(&port.r, PATREF(qd.gray));\n\n    EXPECT_EQ(0x40, port.data(0,0));\n    EXPECT_EQ(0x80, port.data(1,0));\n\n    EXPECT_EQ(whiteColor, port.port.fgColor);\n    EXPECT_EQ(redColor, port.port.bkColor);\n}\n\nTEST(QuickDraw, BasicQDColor32)\n{\n    OffscreenWorld world(32);\n\n\n    FillRect(&world.r, PATREF(qd.gray));\n    EXPECT_EQ(0x00000000, world.data32(0,0));\n    EXPECT_EQ(0x00FFFFFF, world.data32(0,1));\n    EXPECT_EQ(0x00FFFFFF, world.data32(1,0));\n    EXPECT_EQ(0x00000000, world.data32(1,1));\n    \n    ForeColor(whiteColor);\n    BackColor(redColor);\n\n    const uint32_t rgbRed = 0xDD0806;\n\n    EXPECT_EQ(0x00FFFFFF, world.world->fgColor);\n    EXPECT_EQ(rgbRed, world.world->bkColor);\n\n    FillRect(&world.r, PATREF(qd.gray));\n\n    EXPECT_EQ(0x00FFFFFF, world.data32(0,0));\n    EXPECT_EQ(rgbRed, world.data32(0,1));\n    EXPECT_EQ(rgbRed, world.data32(1,0));\n    EXPECT_EQ(0x00FFFFFF, world.data32(1,1));\n} \n\nTEST(QuickDraw, GrayPattern32)\n{\n    OffscreenWorld world(32);\n\n    FillRect(&world.r, PATREF(qd.gray));\n    EXPECT_EQ(0x00000000, world.data32(0,0));\n    EXPECT_EQ(0x00FFFFFF, world.data32(0,1));\n    EXPECT_EQ(0x00FFFFFF, world.data32(1,0));\n    EXPECT_EQ(0x00000000, world.data32(1,1));\n}\n\nTEST(QuickDraw, GrayPattern8)\n{\n    OffscreenWorld world(8);\n\n    FillRect(&world.r, PATREF(qd.gray));\n    EXPECT_EQ(0xFF, world.data(0,0));\n    EXPECT_EQ(0x00, world.data(0,1));\n    EXPECT_EQ(0x00, world.data(1,0));\n    EXPECT_EQ(0xFF, world.data(1,1));\n}\n\nTEST(QuickDraw, GrayPattern1)\n{\n    OffscreenPort port;\n\n    FillRect(&port.r, PATREF(qd.gray));\n    EXPECT_EQ(0x80, port.data(0,0));\n    EXPECT_EQ(0x40, port.data(1,0));\n}\n\nTEST(QuickDraw, BlackPattern32)\n{\n    OffscreenWorld world(32);\n\n    FillRect(&world.r, PATREF(qd.black));\n    EXPECT_EQ(0x00000000, world.data32(0,0));\n    EXPECT_EQ(0x00000000, world.data32(0,1));\n    EXPECT_EQ(0x00000000, world.data32(1,0));\n    EXPECT_EQ(0x00000000, world.data32(1,1));\n}\n<commit_msg>more quickdraw tests<commit_after>#include \"gtest\/gtest.h\"\n\n#ifdef EXECUTOR\n#define AUTOMATIC_CONVERSIONS\n#include <QuickDraw.h>\n#include <CQuickDraw.h>\n#include <MemoryMgr.h>\n\nusing namespace Executor;\nextern QDGlobals qd;\n\n#define PTR(x) (&guestref(x))\n\n    \/\/ FIXME: Executor still defines Pattern as an array, rather than an array wrapped in a struct\n#define PATREF(pat) (pat)\n#else\n#include <Quickdraw.h>\n#include <QDOffscreen.h>\n\n#define PTR(x) (&x)\n#define PATREF(pat) (&(pat))\n#endif\n\nstruct OffscreenPort\n{\n    GrafPort port;\n    Rect r;\n\n    OffscreenPort(int height = 2, int width = 2)\n    {\n        OpenPort(&port);\n\n        short rowBytes = (width + 31) \/ 31 * 4;\n        port.portBits.rowBytes = rowBytes;\n        port.portBits.baseAddr = NewPtrClear(rowBytes * height);\n        SetRect(&r, 0,0,width,height);\n        port.portBits.bounds = r;\n\n        set();\n    }\n\n    ~OffscreenPort()\n    {\n        ClosePort(&port);\n    }\n\n    void set()\n    {\n        SetPort(&port);\n    }\n\n    uint8_t& data(int row, int offset)\n    {\n        return reinterpret_cast<uint8_t&>(\n            port.portBits.baseAddr[row * port.portBits.rowBytes + offset]);\n    }\n};\n\nstruct OffscreenWorld\n{\n    GWorldPtr world = nullptr;\n    Rect r;\n    \n    OffscreenWorld(int depth, int height = 2, int width = 2)\n    {\n        SetRect(&r,0,0,2,2);\n        NewGWorld(PTR(world), depth, &r, nullptr, nullptr, 0);\n        LockPixels(world->portPixMap);\n        set();\n    }\n\n    ~OffscreenWorld()\n    {\n        if((GrafPtr)world == qd.thePort)\n            SetGDevice(GetMainDevice());\n        DisposeGWorld(world);\n    }\n\n    void set()\n    {\n        SetGWorld(world, nullptr);\n    }\n\n    uint8_t& data(int row, int offset)\n    {\n        Ptr baseAddr = (*world->portPixMap)->baseAddr;\n        uint8_t *data = (uint8_t*)baseAddr;\n        short rowBytes = (*world->portPixMap)->rowBytes;\n        rowBytes &= 0x3FFF;\n\n        return data[row * rowBytes + offset];\n    }\n\n    uint16_t data16(int row, int offset)\n    {\n        return data(row, offset*2) * 256 + data(row, offset*2+1);\n    }\n    uint32_t data32(int row, int offset)\n    {\n        return data16(row, offset*2) * 65536 + data16(row, offset*2+1);\n    }\n};\n\n\nTEST(QuickDraw, BWLine1)\n{\n    OffscreenPort port;\n\n    EraseRect(&port.r);\n    MoveTo(0,0);\n    LineTo(2,2);\n\n    EXPECT_EQ(0x80, port.data(0,0));\n    EXPECT_EQ(0x40, port.data(1,0));\n}\n\nTEST(QuickDraw, GWorld8)\n{\n    OffscreenWorld world(8);\n\n    EraseRect(&world.r);\n    MoveTo(0,0);\n    LineTo(2,2);\n    \n    EXPECT_EQ(255, world.data(0,0));\n    EXPECT_EQ(0, world.data(0,1));\n    EXPECT_EQ(0, world.data(1,0));\n    EXPECT_EQ(255, world.data(1,1));\n}\n\nTEST(QuickDraw, GWorld16)\n{\n    OffscreenWorld world(16);\n\n    EraseRect(&world.r);\n    MoveTo(0,0);\n    LineTo(2,2);\n    \n    EXPECT_EQ(0, world.data16(0,0));\n    EXPECT_EQ(0x7FFF, world.data16(0,1));\n}\n\nTEST(QuickDraw, GWorld32)\n{\n    OffscreenWorld world(32);\n\n    EraseRect(&world.r);\n    MoveTo(0,0);\n    LineTo(2,2);\n    \n    EXPECT_EQ(0, world.data32(0,0));\n    EXPECT_EQ(0x00FFFFFF, world.data32(0,1));\n}\n\nTEST(QuickDraw, BasicQDColorBW)\n{\n    OffscreenPort port;\n\n    FillRect(&port.r, PATREF(qd.gray));\n    EXPECT_EQ(0x80, port.data(0,0));\n    EXPECT_EQ(0x40, port.data(1,0));\n    \n    ForeColor(whiteColor);\n    BackColor(redColor);\n    FillRect(&port.r, PATREF(qd.gray));\n\n    EXPECT_EQ(0x40, port.data(0,0));\n    EXPECT_EQ(0x80, port.data(1,0));\n\n    EXPECT_EQ(whiteColor, port.port.fgColor);\n    EXPECT_EQ(redColor, port.port.bkColor);\n}\n\nTEST(QuickDraw, BasicQDColor32)\n{\n    OffscreenWorld world(32);\n\n\n    FillRect(&world.r, PATREF(qd.gray));\n    EXPECT_EQ(0x00000000, world.data32(0,0));\n    EXPECT_EQ(0x00FFFFFF, world.data32(0,1));\n    EXPECT_EQ(0x00FFFFFF, world.data32(1,0));\n    EXPECT_EQ(0x00000000, world.data32(1,1));\n    \n    ForeColor(whiteColor);\n    BackColor(redColor);\n\n    const uint32_t rgbRed = 0xDD0806;\n\n    EXPECT_EQ(0x00FFFFFF, world.world->fgColor);\n    EXPECT_EQ(rgbRed, world.world->bkColor);\n\n    FillRect(&world.r, PATREF(qd.gray));\n\n    EXPECT_EQ(0x00FFFFFF, world.data32(0,0));\n    EXPECT_EQ(rgbRed, world.data32(0,1));\n    EXPECT_EQ(rgbRed, world.data32(1,0));\n    EXPECT_EQ(0x00FFFFFF, world.data32(1,1));\n} \n\nTEST(QuickDraw, GrayPattern32)\n{\n    OffscreenWorld world(32);\n\n    FillRect(&world.r, PATREF(qd.gray));\n    EXPECT_EQ(0x00000000, world.data32(0,0));\n    EXPECT_EQ(0x00FFFFFF, world.data32(0,1));\n    EXPECT_EQ(0x00FFFFFF, world.data32(1,0));\n    EXPECT_EQ(0x00000000, world.data32(1,1));\n}\n\nTEST(QuickDraw, GrayPattern8)\n{\n    OffscreenWorld world(8);\n\n    FillRect(&world.r, PATREF(qd.gray));\n    EXPECT_EQ(0xFF, world.data(0,0));\n    EXPECT_EQ(0x00, world.data(0,1));\n    EXPECT_EQ(0x00, world.data(1,0));\n    EXPECT_EQ(0xFF, world.data(1,1));\n}\n\nTEST(QuickDraw, GrayPattern1)\n{\n    OffscreenPort port;\n\n    FillRect(&port.r, PATREF(qd.gray));\n    EXPECT_EQ(0x80, port.data(0,0));\n    EXPECT_EQ(0x40, port.data(1,0));\n}\n\nTEST(QuickDraw, BlackPattern32)\n{\n    OffscreenWorld world(32);\n\n    FillRect(&world.r, PATREF(qd.black));\n    EXPECT_EQ(0x00000000, world.data32(0,0));\n    EXPECT_EQ(0x00000000, world.data32(0,1));\n    EXPECT_EQ(0x00000000, world.data32(1,0));\n    EXPECT_EQ(0x00000000, world.data32(1,1));\n}\n\nTEST(QuickDraw, CopyBit8)\n{\n    OffscreenWorld world1(8);\n\n    world1.data(0,0) = 1;\n    world1.data(0,1) = 2;\n    world1.data(1,0) = 3;\n    world1.data(1,1) = 4;\n    OffscreenWorld world2(8);\n    EraseRect(&world2.r);\n\n    RgnHandle rgn1 = NewRgn();\n    SetRectRgn(rgn1, 0,0,2,1);\n    RgnHandle rgn2 = NewRgn();\n    SetRectRgn(rgn2, 0,0,1,2);\n    UnionRgn(rgn1, rgn2, rgn1);\n    DisposeRgn(rgn2);\n\n    CopyBits(\n        &GrafPtr(world1.world)->portBits,\n        &GrafPtr(world2.world)->portBits,\n        &world1.r, &world2.r, srcCopy, rgn1);\n\n    DisposeRgn(rgn1);\n\n    EXPECT_EQ(1, world2.data(0,0));\n    EXPECT_EQ(2, world2.data(0,1));\n    EXPECT_EQ(3, world2.data(1,0));\n    EXPECT_EQ(0, world2.data(1,1));\n}\n\nTEST(QuickDraw, CopyBit32)\n{\n    OffscreenWorld world1(32);\n\n    world1.data(0,3) = 1;\n    world1.data(0,7) = 2;\n    world1.data(1,3) = 3;\n    world1.data(1,7) = 4;\n    OffscreenWorld world2(32);\n    EraseRect(&world2.r);\n\n    RgnHandle rgn1 = NewRgn();\n    SetRectRgn(rgn1, 0,0,2,1);\n    RgnHandle rgn2 = NewRgn();\n    SetRectRgn(rgn2, 0,0,1,2);\n    UnionRgn(rgn1, rgn2, rgn1);\n    DisposeRgn(rgn2);\n\n    CopyBits(\n        &GrafPtr(world1.world)->portBits,\n        &GrafPtr(world2.world)->portBits,\n        &world1.r, &world2.r, srcCopy, rgn1);\n\n    DisposeRgn(rgn1);\n\n    EXPECT_EQ(1, world2.data(0,3));\n    EXPECT_EQ(2, world2.data(0,7));\n    EXPECT_EQ(3, world2.data(1,3));\n    EXPECT_EQ(255, world2.data(1,7));\n}\n\nTEST(QuickDraw, CopyMask8)\n{\n    OffscreenPort mask;\n\n    mask.data(0,0) = 0xC0;\n    mask.data(1,0) = 0x80;\n    \n    OffscreenWorld world1(8);\n\n    world1.data(0,0) = 1;\n    world1.data(0,1) = 2;\n    world1.data(1,0) = 3;\n    world1.data(1,1) = 4;\n    OffscreenWorld world2(8);\n    EraseRect(&world2.r);\n\n    CopyMask(\n        &GrafPtr(world1.world)->portBits,\n        &mask.port.portBits,\n        &GrafPtr(world2.world)->portBits,\n        &world1.r, &mask.r, &world2.r);\n\n\n    EXPECT_EQ(1, world2.data(0,0));\n    EXPECT_EQ(2, world2.data(0,1));\n    EXPECT_EQ(3, world2.data(1,0));\n    EXPECT_EQ(0, world2.data(1,1));\n}\n\nTEST(QuickDraw, CopyMask32)\n{\n    OffscreenPort mask;\n\n    mask.data(0,0) = 0xC0;\n    mask.data(1,0) = 0x80;\n    \n    OffscreenWorld world1(32);\n\n    world1.data(0,3) = 1;\n    world1.data(0,7) = 2;\n    world1.data(1,3) = 3;\n    world1.data(1,7) = 4;\n    OffscreenWorld world2(32);\n    EraseRect(&world2.r);\n\n    CopyMask(\n        &GrafPtr(world1.world)->portBits,\n        &mask.port.portBits,\n        &GrafPtr(world2.world)->portBits,\n        &world1.r, &mask.r, &world2.r);\n\n\n    EXPECT_EQ(1, world2.data(0,3));\n    EXPECT_EQ(2, world2.data(0,7));\n    EXPECT_EQ(3, world2.data(1,3));\n    EXPECT_EQ(255, world2.data(1,7));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QDBusVariant>\n#include <QsLog.h>\n#include <QTimer>\n#include <velib\/qt\/v_busitem.h>\n#include <velib\/qt\/v_busitems.h>\n#include \"v_bus_node.h\"\n#include \"dbus_bridge.h\"\n\nQ_DECLARE_METATYPE(QList<int>)\n\nDBusBridge::DBusBridge(QObject *parent) :\n\tQObject(parent),\n\tmServiceRegistered(false),\n\tmUpdateBusy(false),\n\tmUpdateTimer(0)\n{\n}\n\nDBusBridge::DBusBridge(const QString &serviceName, QObject *parent):\n\tQObject(parent),\n\tmServiceName(serviceName),\n\tmServiceRegistered(false),\n\tmUpdateBusy(false),\n\tmUpdateTimer(0)\n{\n}\n\nDBusBridge::~DBusBridge()\n{\n\tif (!mServiceRegistered)\n\t\treturn;\n\tQLOG_INFO() << \"Unregistering service\" << mServiceName;\n\tQDBusConnection connection = VBusItems::getConnection(mServiceName);\n\tif (!connection.unregisterService(mServiceName)) {\n\t\tQLOG_FATAL() << \"UnregisterService failed\";\n\t}\n}\n\nvoid DBusBridge::setUpdateInterval(int interval)\n{\n\tif (interval <= 0) {\n\t\tif (mUpdateTimer != 0) {\n\t\t\tdelete mUpdateTimer;\n\t\t\tmUpdateTimer = 0;\n\t\t}\n\t\treturn;\n\t}\n\tif (mUpdateTimer == 0) {\n\t\tmUpdateTimer = new QTimer(this);\n\t\tconnect(mUpdateTimer, SIGNAL(timeout()), this, SLOT(onUpdateTimer()));\n\t}\n\tmUpdateTimer->setInterval(interval);\n\tmUpdateTimer->start();\n}\n\nvoid DBusBridge::produce(QObject *src, const char *property,\n\t\t\t\t\t\t const QString &path, const QString &unit,\n\t\t\t\t\t\t int precision)\n{\n\tVBusItem *vbi = new VBusItem(this);\n\tQVariant value = src->property(property);\n\ttoDBus(path, value);\n\tif (!value.isValid())\n\t\tvalue = QVariant::fromValue(QList<int>());\n\tconnectItem(vbi, src, property, path);\n\tQDBusConnection connection = VBusItems::getConnection(mServiceName);\n\tvbi->produce(connection, path, \"?\", value, unit, precision);\n\taddVBusNodes(path, vbi);\n}\n\nvoid DBusBridge::produce(const QString &path, const QVariant &value,\n\t\t\t\t\t\t const QString &unit, int precision)\n{\n\tVBusItem *vbi = new VBusItem(this);\n\tconnectItem(vbi, 0, 0, path);\n\tQDBusConnection connection = VBusItems::getConnection(mServiceName);\n\tvbi->produce(connection, path, \"\", value, unit, precision);\n\taddVBusNodes(path, vbi);\n}\n\nvoid DBusBridge::consume(const QString &service, QObject *src,\n\t\t\t\t\t\t const char *property, const QString &path)\n{\n\tQDBusConnection &connection = VBusItems::getConnection();\n\tVBusItem *vbi = new VBusItem(this);\n\tconnectItem(vbi, src, property, path);\n\tvbi->consume(connection, service, path);\n\tvbi->getValue(); \/\/ force value retrieval\n}\n\nvoid DBusBridge::consume(const QString &service, QObject *src,\n\t\t\t\t\t\t const char *property, const QVariant &defaultValue,\n\t\t\t\t\t\t const QString &path)\n{\n\taddSetting(path, defaultValue, QVariant(0), QVariant(0));\n\tconsume(service, src, property, path);\n}\n\nvoid DBusBridge::consume(const QString &service, QObject *src,\n\t\t\t\t\t\t const char *property, double defaultValue,\n\t\t\t\t\t\t double minValue, double maxValue, const QString &path)\n{\n\taddSetting(path, QVariant(defaultValue), QVariant(minValue), QVariant(maxValue));\n\tconsume(service, src, property, path);\n}\n\nQString DBusBridge::serviceName() const\n{\n\treturn mServiceName;\n}\n\nvoid DBusBridge::setServiceName(const QString &sn)\n{\n\tmServiceName = sn;\n}\n\nvoid DBusBridge::registerService()\n{\n\tif (mServiceRegistered) {\n\t\tQLOG_ERROR() << \"Service already registered\";\n\t\treturn;\n\t}\n\tQLOG_INFO() << \"Registering service\" << mServiceName;\n\tQDBusConnection connection = VBusItems::getConnection(mServiceName);\n\tif (connection.registerService(mServiceName))\n\t\tmServiceRegistered = true;\n\telse\n\t\tQLOG_FATAL() << \"RegisterService failed\";\n}\n\nbool DBusBridge::toDBus(const QString &, QVariant &)\n{\n\treturn true;\n}\n\nbool DBusBridge::fromDBus(const QString &, QVariant &)\n{\n\treturn true;\n}\n\nbool DBusBridge::addSetting(const QString &path,\n\t\t\t\t\t\t\tconst QVariant &defaultValue,\n\t\t\t\t\t\t\tconst QVariant &minValue,\n\t\t\t\t\t\t\tconst QVariant &maxValue)\n{\n\tif (!path.startsWith(\"\/Settings\"))\n\t\treturn false;\n\tint groupStart = path.indexOf('\/', 1);\n\tif (groupStart == -1)\n\t\treturn false;\n\tint nameStart = path.lastIndexOf('\/');\n\tif (nameStart <= groupStart)\n\t\treturn false;\n\tQChar type;\n\tswitch (defaultValue.type()) {\n\tcase QVariant::Int:\n\t\ttype = 'i';\n\t\tbreak;\n\tcase QVariant::Double:\n\t\ttype = 'f';\n\t\tbreak;\n\tcase QVariant::String:\n\t\ttype = 's';\n\t\tbreak;\n\tdefault:\n\t\treturn false;\n\t}\n\tQString group = path.mid(groupStart + 1, nameStart - groupStart - 1);\n\tQString name = path.mid(nameStart + 1);\n\tQDBusConnection &connection = VBusItems::getConnection();\n\tQDBusMessage m = QDBusMessage::createMethodCall(\n\t\t\t\t\t\t \"com.victronenergy.settings\",\n\t\t\t\t\t\t \"\/Settings\",\n\t\t\t\t\t\t \"com.victronenergy.Settings\",\n\t\t\t\t\t\t \"AddSetting\")\n\t\t\t\t\t << group\n\t\t\t\t\t << name\n\t\t\t\t\t << QVariant::fromValue(QDBusVariant(defaultValue))\n\t\t\t\t\t << QString(type)\n\t\t\t\t\t << QVariant::fromValue(QDBusVariant(minValue))\n\t\t\t\t\t << QVariant::fromValue(QDBusVariant(maxValue));\n\tQDBusMessage reply = connection.call(m);\n\treturn reply.type() == QDBusMessage::ReplyMessage;\n}\n\nvoid DBusBridge::onPropertyChanged()\n{\n\tQObject *src = sender();\n\tint signalIndex = senderSignalIndex();\n\tconst QMetaObject *mo = src->metaObject();\n\tfor (int i=0; i<mo->propertyCount(); ++i) {\n\t\tQMetaProperty mp = mo->property(i);\n\t\tif (mp.hasNotifySignal() && mp.notifySignalIndex() == signalIndex) {\n\t\t\tfor (QList<BusItemBridge>::iterator it = mBusItems.begin();\n\t\t\t\t it != mBusItems.end();\n\t\t\t\t ++it) {\n\t\t\t\tif (it->src == src &&\n\t\t\t\t\tit->property.isValid() &&\n\t\t\t\t\tstrcmp(it->property.name(), mp.name()) == 0) {\n\t\t\t\t\tif (mUpdateTimer == 0)\n\t\t\t\t\t\tpublishValue(*it);\n\t\t\t\t\telse\n\t\t\t\t\t\tit->changed\t= true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid DBusBridge::onVBusItemChanged()\n{\n\tif (mUpdateBusy)\n\t\treturn;\n\tbool checkInit = false;\n\tfor (QList<BusItemBridge>::iterator it = mBusItems.begin();\n\t\t it != mBusItems.end();\n\t\t ++it) {\n\t\tif (it->item == sender()) {\n\t\t\tif (it->src == 0) {\n\t\t\t\tQLOG_WARN() << \"Value changed on D-Bus could not be stored in QT-property\";\n\t\t\t} else if (it->property.isValid()) {\n\t\t\t\tQVariant value = it->item->getValue();\n\t\t\t\tif (value.canConvert<QList<int> >()) {\n\t\t\t\t\tQList<int> l = value.value<QList<int> >();\n\t\t\t\t\tif (l.isEmpty())\n\t\t\t\t\t\tvalue = QVariant();\n\t\t\t\t}\n\t\t\t\tif (fromDBus(it->path, value))\n\t\t\t\t\tit->src->setProperty(it->property.name(), value);\n\t\t\t}\n\t\t\tif (!it->initialized) {\n\t\t\t\tit->initialized = true;\n\t\t\t\tcheckInit = true;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (checkInit) {\n\t\tforeach (BusItemBridge bib, mBusItems) {\n\t\t\tif (!bib.initialized) {\n\t\t\t\tcheckInit = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkInit)\n\t\t\temit initialized();\n\t}\n}\n\nvoid DBusBridge::onUpdateTimer()\n{\n\tfor (QList<BusItemBridge>::iterator it = mBusItems.begin();\n\t\t it != mBusItems.end();\n\t\t ++it) {\n\t\tif (it->changed) {\n\t\t\tpublishValue(*it);\n\t\t\tit->changed = false;\n\t\t}\n\t}\n}\n\nvoid DBusBridge::connectItem(VBusItem *busItem, QObject *src,\n\t\t\t\t\t\t\t const char *property, const QString &path)\n{\n\tBusItemBridge bib;\n\tbib.item = busItem;\n\tbib.src = src;\n\tbib.path = path;\n\tbib.initialized = false;\n\tbib.changed = false;\n\tif (src == 0) {\n\t\tif (property != 0) {\n\t\t\tQLOG_ERROR() << \"Property specified (\" << property\n\t\t\t\t\t\t << \"), but source omitted in DBusBridge. Path was\"\n\t\t\t\t\t\t << path;\n\t\t}\n\t} else {\n\t\tif (property == 0) {\n\t\t\tQLOG_ERROR() << \"Source specified, but property omitted in\"\n\t\t\t\t\t\t << \"DBusBridge. Path was\"\n\t\t\t\t\t\t << path;\n\t\t} else {\n\t\t\tconst QMetaObject *mo = src->metaObject();\n\t\t\tint i = mo->indexOfProperty(property);\n\t\t\tif (i == -1) {\n\t\t\t\tQLOG_ERROR() << \"DBusBridge could not find property\" << property\n\t\t\t\t\t\t\t << \"Path was\" << path;\n\t\t\t} else {\n\t\t\t\tQMetaProperty mp = mo->property(i);\n\t\t\t\tif (mp.hasNotifySignal()) {\n\t\t\t\t\tQMetaMethod signal = mp.notifySignal();\n\t\t\t\t\tint index = metaObject()->indexOfSlot(\"onPropertyChanged()\");\n\t\t\t\t\tQMetaMethod slot = metaObject()->method(index);\n\t\t\t\t\tconnect(src, signal, this, slot);\n\t\t\t\t}\n\t\t\t\tbib.property = mp;\n\t\t\t}\n\t\t}\n\t}\n\tmBusItems.push_back(bib);\n\tconnect(busItem, SIGNAL(valueChanged()), this, SLOT(onVBusItemChanged()));\n}\n\nvoid DBusBridge::addVBusNodes(const QString &path, VBusItem *vbi)\n{\n\tif (mServiceRoot.isNull()) {\n\t\tQDBusConnection connection = VBusItems::getConnection(serviceName());\n\t\tmServiceRoot = new VBusNode(connection, \"\/\", this);\n\t}\n\tmServiceRoot->addChild(path, vbi);\n}\n\nvoid DBusBridge::publishValue(DBusBridge::BusItemBridge &item)\n{\n\tQVariant value = item.src->property(item.property.name());\n\tif (!toDBus(item.path, value))\n\t\treturn;\n\tif (!value.isValid())\n\t\tvalue = QVariant::fromValue(QList<int>());\n\tmUpdateBusy = true;\n\titem.item->setValue(value);\n\tmUpdateBusy = false;\n}\n<commit_msg>Improved performance of DBusBridge<commit_after>#include <QDBusVariant>\n#include <QsLog.h>\n#include <QTimer>\n#include <velib\/qt\/v_busitem.h>\n#include <velib\/qt\/v_busitems.h>\n#include \"v_bus_node.h\"\n#include \"dbus_bridge.h\"\n\nQ_DECLARE_METATYPE(QList<int>)\n\nDBusBridge::DBusBridge(QObject *parent) :\n\tQObject(parent),\n\tmServiceRegistered(false),\n\tmUpdateBusy(false),\n\tmUpdateTimer(0)\n{\n}\n\nDBusBridge::DBusBridge(const QString &serviceName, QObject *parent):\n\tQObject(parent),\n\tmServiceName(serviceName),\n\tmServiceRegistered(false),\n\tmUpdateBusy(false),\n\tmUpdateTimer(0)\n{\n}\n\nDBusBridge::~DBusBridge()\n{\n\tif (!mServiceRegistered)\n\t\treturn;\n\tQLOG_INFO() << \"Unregistering service\" << mServiceName;\n\tQDBusConnection connection = VBusItems::getConnection(mServiceName);\n\tif (!connection.unregisterService(mServiceName)) {\n\t\tQLOG_FATAL() << \"UnregisterService failed\";\n\t}\n}\n\nvoid DBusBridge::setUpdateInterval(int interval)\n{\n\tif (interval <= 0) {\n\t\tif (mUpdateTimer != 0) {\n\t\t\tdelete mUpdateTimer;\n\t\t\tmUpdateTimer = 0;\n\t\t}\n\t\treturn;\n\t}\n\tif (mUpdateTimer == 0) {\n\t\tmUpdateTimer = new QTimer(this);\n\t\tconnect(mUpdateTimer, SIGNAL(timeout()), this, SLOT(onUpdateTimer()));\n\t}\n\tmUpdateTimer->setInterval(interval);\n\tmUpdateTimer->start();\n}\n\nvoid DBusBridge::produce(QObject *src, const char *property,\n\t\t\t\t\t\t const QString &path, const QString &unit,\n\t\t\t\t\t\t int precision)\n{\n\tVBusItem *vbi = new VBusItem(this);\n\tQVariant value = src->property(property);\n\ttoDBus(path, value);\n\tif (!value.isValid())\n\t\tvalue = QVariant::fromValue(QList<int>());\n\tconnectItem(vbi, src, property, path);\n\tQDBusConnection connection = VBusItems::getConnection(mServiceName);\n\tvbi->produce(connection, path, \"?\", value, unit, precision);\n\taddVBusNodes(path, vbi);\n}\n\nvoid DBusBridge::produce(const QString &path, const QVariant &value,\n\t\t\t\t\t\t const QString &unit, int precision)\n{\n\tVBusItem *vbi = new VBusItem(this);\n\tconnectItem(vbi, 0, 0, path);\n\tQDBusConnection connection = VBusItems::getConnection(mServiceName);\n\tvbi->produce(connection, path, \"\", value, unit, precision);\n\taddVBusNodes(path, vbi);\n}\n\nvoid DBusBridge::consume(const QString &service, QObject *src,\n\t\t\t\t\t\t const char *property, const QString &path)\n{\n\tQDBusConnection &connection = VBusItems::getConnection();\n\tVBusItem *vbi = new VBusItem(this);\n\tconnectItem(vbi, src, property, path);\n\tvbi->consume(connection, service, path);\n\tvbi->getValue(); \/\/ force value retrieval\n}\n\nvoid DBusBridge::consume(const QString &service, QObject *src,\n\t\t\t\t\t\t const char *property, const QVariant &defaultValue,\n\t\t\t\t\t\t const QString &path)\n{\n\taddSetting(path, defaultValue, QVariant(0), QVariant(0));\n\tconsume(service, src, property, path);\n}\n\nvoid DBusBridge::consume(const QString &service, QObject *src,\n\t\t\t\t\t\t const char *property, double defaultValue,\n\t\t\t\t\t\t double minValue, double maxValue, const QString &path)\n{\n\taddSetting(path, QVariant(defaultValue), QVariant(minValue), QVariant(maxValue));\n\tconsume(service, src, property, path);\n}\n\nQString DBusBridge::serviceName() const\n{\n\treturn mServiceName;\n}\n\nvoid DBusBridge::setServiceName(const QString &sn)\n{\n\tmServiceName = sn;\n}\n\nvoid DBusBridge::registerService()\n{\n\tif (mServiceRegistered) {\n\t\tQLOG_ERROR() << \"Service already registered\";\n\t\treturn;\n\t}\n\tQLOG_INFO() << \"Registering service\" << mServiceName;\n\tQDBusConnection connection = VBusItems::getConnection(mServiceName);\n\tif (connection.registerService(mServiceName))\n\t\tmServiceRegistered = true;\n\telse\n\t\tQLOG_FATAL() << \"RegisterService failed\";\n}\n\nbool DBusBridge::toDBus(const QString &, QVariant &)\n{\n\treturn true;\n}\n\nbool DBusBridge::fromDBus(const QString &, QVariant &)\n{\n\treturn true;\n}\n\nbool DBusBridge::addSetting(const QString &path,\n\t\t\t\t\t\t\tconst QVariant &defaultValue,\n\t\t\t\t\t\t\tconst QVariant &minValue,\n\t\t\t\t\t\t\tconst QVariant &maxValue)\n{\n\tif (!path.startsWith(\"\/Settings\"))\n\t\treturn false;\n\tint groupStart = path.indexOf('\/', 1);\n\tif (groupStart == -1)\n\t\treturn false;\n\tint nameStart = path.lastIndexOf('\/');\n\tif (nameStart <= groupStart)\n\t\treturn false;\n\tQChar type;\n\tswitch (defaultValue.type()) {\n\tcase QVariant::Int:\n\t\ttype = 'i';\n\t\tbreak;\n\tcase QVariant::Double:\n\t\ttype = 'f';\n\t\tbreak;\n\tcase QVariant::String:\n\t\ttype = 's';\n\t\tbreak;\n\tdefault:\n\t\treturn false;\n\t}\n\tQString group = path.mid(groupStart + 1, nameStart - groupStart - 1);\n\tQString name = path.mid(nameStart + 1);\n\tQDBusConnection &connection = VBusItems::getConnection();\n\tQDBusMessage m = QDBusMessage::createMethodCall(\n\t\t\t\t\t\t \"com.victronenergy.settings\",\n\t\t\t\t\t\t \"\/Settings\",\n\t\t\t\t\t\t \"com.victronenergy.Settings\",\n\t\t\t\t\t\t \"AddSetting\")\n\t\t\t\t\t << group\n\t\t\t\t\t << name\n\t\t\t\t\t << QVariant::fromValue(QDBusVariant(defaultValue))\n\t\t\t\t\t << QString(type)\n\t\t\t\t\t << QVariant::fromValue(QDBusVariant(minValue))\n\t\t\t\t\t << QVariant::fromValue(QDBusVariant(maxValue));\n\tQDBusMessage reply = connection.call(m);\n\treturn reply.type() == QDBusMessage::ReplyMessage;\n}\n\nvoid DBusBridge::onPropertyChanged()\n{\n\tQObject *src = sender();\n\tint signalIndex = senderSignalIndex();\n\tfor (QList<BusItemBridge>::iterator it = mBusItems.begin(); it != mBusItems.end(); ++it) {\n\t\tif (it->src == src && it->property.isValid() &&\n\t\t\t\tit->property.notifySignalIndex() == signalIndex) {\n\t\t\tif (mUpdateTimer == 0)\n\t\t\t\tpublishValue(*it);\n\t\t\telse\n\t\t\t\tit->changed = true;\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid DBusBridge::onVBusItemChanged()\n{\n\tif (mUpdateBusy)\n\t\treturn;\n\tbool checkInit = false;\n\tfor (QList<BusItemBridge>::iterator it = mBusItems.begin();\n\t\t it != mBusItems.end();\n\t\t ++it) {\n\t\tif (it->item == sender()) {\n\t\t\tif (it->src == 0) {\n\t\t\t\tQLOG_WARN() << \"Value changed on D-Bus could not be stored in QT-property\";\n\t\t\t} else if (it->property.isValid()) {\n\t\t\t\tQVariant value = it->item->getValue();\n\t\t\t\tif (value.canConvert<QList<int> >()) {\n\t\t\t\t\tQList<int> l = value.value<QList<int> >();\n\t\t\t\t\tif (l.isEmpty())\n\t\t\t\t\t\tvalue = QVariant();\n\t\t\t\t}\n\t\t\t\tif (fromDBus(it->path, value))\n\t\t\t\t\tit->src->setProperty(it->property.name(), value);\n\t\t\t}\n\t\t\tif (!it->initialized) {\n\t\t\t\tit->initialized = true;\n\t\t\t\tcheckInit = true;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (checkInit) {\n\t\tforeach (BusItemBridge bib, mBusItems) {\n\t\t\tif (!bib.initialized) {\n\t\t\t\tcheckInit = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkInit)\n\t\t\temit initialized();\n\t}\n}\n\nvoid DBusBridge::onUpdateTimer()\n{\n\tfor (QList<BusItemBridge>::iterator it = mBusItems.begin(); it != mBusItems.end(); ++it) {\n\t\tif (it->changed) {\n\t\t\tpublishValue(*it);\n\t\t\tit->changed = false;\n\t\t}\n\t}\n}\n\nvoid DBusBridge::connectItem(VBusItem *busItem, QObject *src,\n\t\t\t\t\t\t\t const char *property, const QString &path)\n{\n\tBusItemBridge bib;\n\tbib.item = busItem;\n\tbib.src = src;\n\tbib.path = path;\n\tbib.initialized = false;\n\tbib.changed = false;\n\tif (src == 0) {\n\t\tif (property != 0) {\n\t\t\tQLOG_ERROR() << \"Property specified (\" << property\n\t\t\t\t\t\t << \"), but source omitted in DBusBridge. Path was\"\n\t\t\t\t\t\t << path;\n\t\t}\n\t} else {\n\t\tif (property == 0) {\n\t\t\tQLOG_ERROR() << \"Source specified, but property omitted in\"\n\t\t\t\t\t\t << \"DBusBridge. Path was\"\n\t\t\t\t\t\t << path;\n\t\t} else {\n\t\t\tconst QMetaObject *mo = src->metaObject();\n\t\t\tint i = mo->indexOfProperty(property);\n\t\t\tif (i == -1) {\n\t\t\t\tQLOG_ERROR() << \"DBusBridge could not find property\" << property\n\t\t\t\t\t\t\t << \"Path was\" << path;\n\t\t\t} else {\n\t\t\t\tQMetaProperty mp = mo->property(i);\n\t\t\t\tif (mp.hasNotifySignal()) {\n\t\t\t\t\tQMetaMethod signal = mp.notifySignal();\n\t\t\t\t\tint index = metaObject()->indexOfSlot(\"onPropertyChanged()\");\n\t\t\t\t\tQMetaMethod slot = metaObject()->method(index);\n\t\t\t\t\tconnect(src, signal, this, slot);\n\t\t\t\t}\n\t\t\t\tbib.property = mp;\n\t\t\t}\n\t\t}\n\t}\n\tmBusItems.push_back(bib);\n\tconnect(busItem, SIGNAL(valueChanged()), this, SLOT(onVBusItemChanged()));\n}\n\nvoid DBusBridge::addVBusNodes(const QString &path, VBusItem *vbi)\n{\n\tif (mServiceRoot.isNull()) {\n\t\tQDBusConnection connection = VBusItems::getConnection(serviceName());\n\t\tmServiceRoot = new VBusNode(connection, \"\/\", this);\n\t}\n\tmServiceRoot->addChild(path, vbi);\n}\n\nvoid DBusBridge::publishValue(DBusBridge::BusItemBridge &item)\n{\n\tQVariant value = item.src->property(item.property.name());\n\tif (!toDBus(item.path, value))\n\t\treturn;\n\tif (!value.isValid())\n\t\tvalue = QVariant::fromValue(QList<int>());\n\tmUpdateBusy = true;\n\titem.item->setValue(value);\n\tmUpdateBusy = false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: hfi_siservice.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2004-07-12 15:29:23 $\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 ADC_DISPLAY_HFI_SISERVICE_HXX\n#define ADC_DISPLAY_HFI_SISERVICE_HXX\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include \"hi_factory.hxx\"\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n#include <ary\/idl\/i_comrela.hxx>\n\nclass HF_NaviSubRow;\nclass HF_SubTitleTable;\n\nclass HF_IdlSglIfcService : public HtmlFactory_Idl\n{\n  public:\n                        HF_IdlSglIfcService(\n                            Environment &       io_rEnv,\n                            Xml::Element &      o_rOut );\n    virtual             ~HF_IdlSglIfcService();\n\n    void                Produce_byData(\n                           const client &       i_ce ) const;\n   private:\n    DYN HF_NaviSubRow & make_Navibar(\n                            const client &      i_ce ) const;\n\n    void                produce_MemberDetails(\n                            HF_SubTitleTable &  o_table,\n                            const client &      i_ce ) const;\n};\n\n\n\n\/\/ IMPLEMENTATION\n\nextern const String\n    C_sCePrefix_Service;\n\n\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.24); FILE MERGED 2005\/09\/05 13:11:06 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: hfi_siservice.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 17:46: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#ifndef ADC_DISPLAY_HFI_SISERVICE_HXX\n#define ADC_DISPLAY_HFI_SISERVICE_HXX\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include \"hi_factory.hxx\"\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n#include <ary\/idl\/i_comrela.hxx>\n\nclass HF_NaviSubRow;\nclass HF_SubTitleTable;\n\nclass HF_IdlSglIfcService : public HtmlFactory_Idl\n{\n  public:\n                        HF_IdlSglIfcService(\n                            Environment &       io_rEnv,\n                            Xml::Element &      o_rOut );\n    virtual             ~HF_IdlSglIfcService();\n\n    void                Produce_byData(\n                           const client &       i_ce ) const;\n   private:\n    DYN HF_NaviSubRow & make_Navibar(\n                            const client &      i_ce ) const;\n\n    void                produce_MemberDetails(\n                            HF_SubTitleTable &  o_table,\n                            const client &      i_ce ) const;\n};\n\n\n\n\/\/ IMPLEMENTATION\n\nextern const String\n    C_sCePrefix_Service;\n\n\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <map>\n#include <algebra\/matrix.h>\n#include <algebra\/vector.h>\n#include <algebra\/qs_matrix.h>\n#include <algebra\/sparse_matrix.h>\n\nusing namespace std;\nusing namespace MathTL;\n\nint main()\n{\n  cout << \"Constructing a quasi-stationary matrix...\" << endl;\n  \n  Matrix<double> one(3, 2, \"1 2 3 4 5 6\");\n  Matrix<double> two(4, 1, \"-4 -3 -2 -1\");\n  Vector<double> b1(3, \"3 4 5\");\n  Vector<double> b2(3, \"5 6 -7\");\n\n  QuasiStationaryMatrix<double> Q(3, 17, 9, one, two, b1, b2, 2, 1);\n  cout << \"Q=\" << endl << Q;\n\n\/\/   Q.set_level(4);\n\/\/   cout << \"Q on next higher level:\" << endl << Q;\n\n  SparseMatrix<double> S;\n  Q.to_sparse(S);\n  cout << \"Q as a sparse matrix:\" << endl << S;\n\n  Vector<double> x(Q.column_dimension());\n  x[4] = x[5] = 1;\n  Vector<double> Qx(Q.row_dimension());\n  Q.apply(x, Qx);\n  cout << \"Q applied to x=\" << x << \" yields Qx=\" << Qx << endl;\n\n  Vector<double> y(Q.row_dimension());\n  y[11] = y[12] = 1;\n  Vector<double> Qty(Q.column_dimension());\n  Q.apply_transposed(y, Qty);\n  cout << \"Q^T applied to y=\" << y << \" yields Q^Ty=\" << Qty << endl;\n\n  x.resize(Q.column_dimension()+2);\n  x[5] = x[6] = 1;\n  Qx.resize(Q.row_dimension()+2);\n  Q.apply(x, Qx, 1, 2);\n  cout << \"Q applied to the part of x=\" << x << \" from index 1,\" << endl\n       << \"written into Qx from index 2 on yields Qx=\" << Qx << endl;\n\n  y.resize(Q.row_dimension()+3);\n  y[14] = y[15] = 1;\n  Qty.resize(Q.column_dimension()+1);\n  Q.apply_transposed(y, Qty, 3, 1);\n  cout << \"Q^T applied to the part of y=\" << y << \" from index 3,\" << endl\n       << \"written into Qty from index 1 on yields Qty=\" << Qty << endl;\n\n  std::map<unsigned int, double> xsparse, Qxsparse;\n  xsparse[6] = 1;\n\/\/   xsparse[Q.column_dimension()-1] = 1;\n  unsigned int xoffset = 1;\n  unsigned int Qxoffset = 0;\n  Q.apply(xsparse, Qxsparse, xoffset, Qxoffset);\n  cout << \"entries of a sparse vector x:\" << endl;\n  for (std::map<unsigned int, double>::const_iterator it(xsparse.begin());\n       it != xsparse.end(); ++it)\n    cout << \"x[\" << it->first << \"]=\" << it->second << endl;\n  cout << \"Q applied to the part of x from index \" << xoffset\n       << \", written into Qx from index \" << Qxoffset << \" yields Qx=\" << endl;\n  for (std::map<unsigned int, double>::const_iterator it(Qxsparse.begin());\n       it != Qxsparse.end(); ++it)\n    cout << \"Qx[\" << it->first << \"]=\" << it->second << endl;\n\n  std::map<unsigned int, double> ysparse, Qtysparse;\n\/\/   ysparse[9] = 1;\n  ysparse[Q.row_dimension()-2] = 1;\n  unsigned int yoffset = 0;\n  unsigned int Qtyoffset = 0;\n  Q.apply_transposed(ysparse, Qtysparse, yoffset, Qtyoffset);\n  cout << \"entries of a sparse vector y:\" << endl;\n  for (std::map<unsigned int, double>::const_iterator it(ysparse.begin());\n       it != ysparse.end(); ++it)\n    cout << \"y[\" << it->first << \"]=\" << it->second << endl;\n  cout << \"Q^T applied to the part of y from index \" << yoffset\n       << \", written into Qty from index \" << Qtyoffset << \" yields Qty=\" << endl;\n  for (std::map<unsigned int, double>::const_iterator it(Qtysparse.begin());\n       it != Qtysparse.end(); ++it)\n    cout << \"Qty[\" << it->first << \"]=\" << it->second << endl;\n  \n  return 0;\n}\n<commit_msg>minor change<commit_after>#include <iostream>\n#include <map>\n#include <algebra\/matrix.h>\n#include <algebra\/vector.h>\n#include <algebra\/qs_matrix.h>\n#include <algebra\/sparse_matrix.h>\n\nusing namespace std;\nusing namespace MathTL;\n\nint main()\n{\n  cout << \"Constructing a quasi-stationary matrix...\" << endl;\n  \n  Matrix<double> one(3, 2, \"1 2 3 4 5 6\");\n  Matrix<double> two(4, 1, \"-4 -3 -2 -1\");\n  Vector<double> b1(3, \"3 4 5\");\n  Vector<double> b2(3, \"5 6 -7\");\n\n  QuasiStationaryMatrix<double> Q(3, 17, 9, one, two, b1, b2, 2, 1);\n  cout << \"Q=\" << endl << Q;\n\n\/\/   Q.set_level(4);\n\/\/   cout << \"Q on next higher level:\" << endl << Q;\n\n  SparseMatrix<double> S;\n  Q.to_sparse(S);\n  cout << \"Q as a sparse matrix:\" << endl << S;\n\n  Vector<double> x(Q.column_dimension());\n  x[4] = x[5] = 1;\n  Vector<double> Qx(Q.row_dimension());\n  Q.apply(x, Qx);\n  cout << \"Q applied to x=\" << x << \" yields Qx=\" << Qx << endl;\n\n  Vector<double> y(Q.row_dimension());\n  y[11] = y[12] = 1;\n  Vector<double> Qty(Q.column_dimension());\n  Q.apply_transposed(y, Qty);\n  cout << \"Q^T applied to y=\" << y << \" yields Q^Ty=\" << Qty << endl;\n\n  x.resize(Q.column_dimension()+2);\n  x[5] = x[6] = 1;\n  Qx.resize(Q.row_dimension()+2);\n  Q.apply(x, Qx, 1, 2);\n  cout << \"Q applied to the part of x=\" << x << \" from index 1,\" << endl\n       << \"written into Qx from index 2 on yields Qx=\" << Qx << endl;\n\n  y.resize(Q.row_dimension()+3);\n  y[14] = y[15] = 1;\n  Qty.resize(Q.column_dimension()+1);\n  Q.apply_transposed(y, Qty, 3, 1);\n  cout << \"Q^T applied to the part of y=\" << y << \" from index 3,\" << endl\n       << \"written into Qty from index 1 on yields Qty=\" << Qty << endl;\n\n  std::map<unsigned int, double> xsparse, Qxsparse;\n  xsparse[6] = 1;\n\/\/   xsparse[Q.column_dimension()-1] = 1;\n  unsigned int xoffset = 1;\n  unsigned int Qxoffset = 0;\n  Q.apply(xsparse, Qxsparse, xoffset, Qxoffset);\n  cout << \"entries of a sparse vector x:\" << endl;\n  for (std::map<unsigned int, double>::const_iterator it(xsparse.begin());\n       it != xsparse.end(); ++it)\n    cout << \"x[\" << it->first << \"]=\" << it->second << endl;\n  cout << \"Q applied to the part of x from index \" << xoffset\n       << \", written into Qx from index \" << Qxoffset << \" yields Qx=\" << endl;\n  for (std::map<unsigned int, double>::const_iterator it(Qxsparse.begin());\n       it != Qxsparse.end(); ++it)\n    cout << \"Qx[\" << it->first << \"]=\" << it->second << endl;\n\n  std::map<size_t, double> ysparse, Qtysparse;\n\/\/   ysparse[9] = 1;\n  ysparse[Q.row_dimension()-2] = 1;\n  unsigned int yoffset = 0;\n  unsigned int Qtyoffset = 0;\n  Q.apply_transposed(ysparse, Qtysparse, yoffset, Qtyoffset);\n  cout << \"entries of a sparse vector y:\" << endl;\n  for (std::map<unsigned int, double>::const_iterator it(ysparse.begin());\n       it != ysparse.end(); ++it)\n    cout << \"y[\" << it->first << \"]=\" << it->second << endl;\n  cout << \"Q^T applied to the part of y from index \" << yoffset\n       << \", written into Qty from index \" << Qtyoffset << \" yields Qty=\" << endl;\n  for (std::map<unsigned int, double>::const_iterator it(Qtysparse.begin());\n       it != Qtysparse.end(); ++it)\n    cout << \"Qty[\" << it->first << \"]=\" << it->second << endl;\n  \n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: filelist.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 07:38: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#include<tools\/list.hxx>\n#include<tools\/stream.hxx>\n#include<tools\/string.hxx>\n#include<tools\/rtti.hxx>\n#include<exchange.hxx>\n#include<filelist.hxx>\n#pragma hdrstop\n\n#ifndef _OSL_THREAD_H_\n#include <osl\/thread.h>\n#endif\n\nTYPEINIT1_AUTOFACTORY( FileList, SvDataCopyStream );\n\n\/\/ String-Liste zum Speichern der Namen deklarieren\nDECLARE_LIST( FileStringList, String* );\n\n\n\/*************************************************************************\n|*\n|*    FileList - Ctor\/Dtor\n|*\n\\*************************************************************************\/\n\nFileList::FileList()\n{\n    pStrList = new FileStringList();\n}\n\nFileList::~FileList()\n{\n    ClearAll();\n}\n\nvoid FileList::ClearAll( void )\n{\n    \/\/ Strings in der Liste loeschen\n    ULONG nCount = pStrList->Count();\n    for( ULONG i = 0 ; i < nCount ; i++ )\n        delete pStrList->GetObject( i );\n\n    \/\/ Liste loeschen\n    delete pStrList;\n}\n\n\/*************************************************************************\n|*\n|*    FileList - Zuweisungsoperator\n|*\n\\*************************************************************************\/\n\nFileList& FileList::operator=( const FileList& rFileList )\n{\n    \/\/ Liste duplizieren\n    *pStrList = *rFileList.pStrList;\n\n    \/\/ Strings in der Liste kopieren\n    ULONG nCount = pStrList->Count();\n    for( ULONG i = 0 ; i < nCount ; i++ )\n        pStrList->Replace( new String( *rFileList.pStrList->GetObject( i ) ), i );\n\n    return *this;\n}\n\n\/*************************************************************************\n|*\n|*    FileList::GetFormatName()\n|*\n\\*************************************************************************\/\n\nULONG FileList::GetFormat()\n{\n    return FORMAT_FILE_LIST;\n}\n\n\/******************************************************************************\n|*\n|*  virtuelle SvData-Methoden\n|*\n\\******************************************************************************\/\n\nvoid FileList::Load( SvStream& rIStm )\n{\n    rIStm >> *this;\n}\n\nvoid FileList::Save( SvStream& rOStm )\n{\n    rOStm << *this;\n}\n\nvoid FileList::Assign( const SvDataCopyStream& rCopyStream )\n{\n    *this = (const FileList&)rCopyStream;\n}\n\n\/******************************************************************************\n|*\n|*  Stream-Operatoren\n|*\n\\******************************************************************************\/\n\n\/*\n * NOTE: to correctly handle this Protocol with Unicode, native Win32 must be called:\n * e.g. DropQueryFile\n *\/\n\nSvStream& operator<<( SvStream& rOStm, const FileList& rFileList )\n{\n    OSL_ENSURE(false, \"Not implemented!\");\n    return rOStm;\n}\n\n\/* #i28176#\n   The Windows clipboard bridge now provides a double '\\0'\n   terminated list of file names for format SOT_FORMAT_FILE_LIST\n   instead of the original Windows Sv_DROPFILES structure. All strings\n   in this list are UTF16 strings. Shell link files will be already\n   resolved by the Windows clipboard bridge.*\/\nSvStream& operator>>( SvStream& rIStm, FileList& rFileList )\n{\n    rFileList.ClearAll();\n    rFileList.pStrList = new FileStringList();\n\n    String aStr;\n    sal_uInt16 c;\n\n    while (!rIStm.IsEof())\n    {\n        aStr.Erase();\n\n        \/\/ read first character of filepath; c==0 > reach end of stream\n        rIStm >> c;\n        if (!c)\n            break;\n\n        \/\/ read string till c==0\n        while (c && !rIStm.IsEof())\n        {\n            aStr += (sal_Unicode)c;\n            rIStm >> c;\n        }\n\n        \/\/ append the filepath\n        rFileList.AppendFile(aStr);\n    }\n    return rIStm;\n}\n\n\/******************************************************************************\n|*\n|*  Liste fuellen\/abfragen\n|*\n\\******************************************************************************\/\n\nvoid FileList::AppendFile( const String& rStr )\n{\n    pStrList->Insert( new String( rStr ) , pStrList->Count() );\n}\n\nString FileList::GetFile( ULONG i ) const\n{\n    String aStr;\n    if( i < pStrList->Count() )\n        aStr = *pStrList->GetObject( i );\n    return aStr;\n}\n\nULONG FileList::Count( void ) const\n{\n    return pStrList->Count();\n}\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.7.8); FILE MERGED 2005\/10\/28 16:15:26 pl 1.7.8.2: #i55991# removed warnings for solaris platform 2005\/10\/21 16:25:06 pl 1.7.8.1: #i55991# removed warnings for linux platform<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: filelist.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 05:52: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<tools\/list.hxx>\n#include<tools\/stream.hxx>\n#include<tools\/string.hxx>\n#include<tools\/rtti.hxx>\n#include<exchange.hxx>\n#include<filelist.hxx>\n\n#ifndef _OSL_THREAD_H_\n#include <osl\/thread.h>\n#endif\n\nTYPEINIT1_AUTOFACTORY( FileList, SvDataCopyStream );\n\n\/\/ String-Liste zum Speichern der Namen deklarieren\nDECLARE_LIST( FileStringList, String* )\n\n\n\/*************************************************************************\n|*\n|*    FileList - Ctor\/Dtor\n|*\n\\*************************************************************************\/\n\nFileList::FileList()\n{\n    pStrList = new FileStringList();\n}\n\nFileList::~FileList()\n{\n    ClearAll();\n}\n\nvoid FileList::ClearAll( void )\n{\n    \/\/ Strings in der Liste loeschen\n    ULONG nCount = pStrList->Count();\n    for( ULONG i = 0 ; i < nCount ; i++ )\n        delete pStrList->GetObject( i );\n\n    \/\/ Liste loeschen\n    delete pStrList;\n}\n\n\/*************************************************************************\n|*\n|*    FileList - Zuweisungsoperator\n|*\n\\*************************************************************************\/\n\nFileList& FileList::operator=( const FileList& rFileList )\n{\n    \/\/ Liste duplizieren\n    *pStrList = *rFileList.pStrList;\n\n    \/\/ Strings in der Liste kopieren\n    ULONG nCount = pStrList->Count();\n    for( ULONG i = 0 ; i < nCount ; i++ )\n        pStrList->Replace( new String( *rFileList.pStrList->GetObject( i ) ), i );\n\n    return *this;\n}\n\n\/*************************************************************************\n|*\n|*    FileList::GetFormatName()\n|*\n\\*************************************************************************\/\n\nULONG FileList::GetFormat()\n{\n    return FORMAT_FILE_LIST;\n}\n\n\/******************************************************************************\n|*\n|*  virtuelle SvData-Methoden\n|*\n\\******************************************************************************\/\n\nvoid FileList::Load( SvStream& rIStm )\n{\n    rIStm >> *this;\n}\n\nvoid FileList::Save( SvStream& rOStm )\n{\n    rOStm << *this;\n}\n\nvoid FileList::Assign( const SvDataCopyStream& rCopyStream )\n{\n    *this = (const FileList&)rCopyStream;\n}\n\n\/******************************************************************************\n|*\n|*  Stream-Operatoren\n|*\n\\******************************************************************************\/\n\n\/*\n * NOTE: to correctly handle this Protocol with Unicode, native Win32 must be called:\n * e.g. DropQueryFile\n *\/\n\nSvStream& operator<<( SvStream& rOStm, const FileList& \/*rFileList*\/ )\n{\n    OSL_ENSURE(false, \"Not implemented!\");\n    return rOStm;\n}\n\n\/* #i28176#\n   The Windows clipboard bridge now provides a double '\\0'\n   terminated list of file names for format SOT_FORMAT_FILE_LIST\n   instead of the original Windows Sv_DROPFILES structure. All strings\n   in this list are UTF16 strings. Shell link files will be already\n   resolved by the Windows clipboard bridge.*\/\nSvStream& operator>>( SvStream& rIStm, FileList& rFileList )\n{\n    rFileList.ClearAll();\n    rFileList.pStrList = new FileStringList();\n\n    String aStr;\n    sal_uInt16 c;\n\n    while (!rIStm.IsEof())\n    {\n        aStr.Erase();\n\n        \/\/ read first character of filepath; c==0 > reach end of stream\n        rIStm >> c;\n        if (!c)\n            break;\n\n        \/\/ read string till c==0\n        while (c && !rIStm.IsEof())\n        {\n            aStr += (sal_Unicode)c;\n            rIStm >> c;\n        }\n\n        \/\/ append the filepath\n        rFileList.AppendFile(aStr);\n    }\n    return rIStm;\n}\n\n\/******************************************************************************\n|*\n|*  Liste fuellen\/abfragen\n|*\n\\******************************************************************************\/\n\nvoid FileList::AppendFile( const String& rStr )\n{\n    pStrList->Insert( new String( rStr ) , pStrList->Count() );\n}\n\nString FileList::GetFile( ULONG i ) const\n{\n    String aStr;\n    if( i < pStrList->Count() )\n        aStr = *pStrList->GetObject( i );\n    return aStr;\n}\n\nULONG FileList::Count( void ) const\n{\n    return pStrList->Count();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * MLPLM.cpp\n *\n *  Created on: 20.11.2013\n *      Author: cls\n *\/\n\n#include \"PLM.h\"\n#include <omp.h>\n#include \"..\/coarsening\/ParallelPartitionCoarsening.h\"\n#include \"..\/coarsening\/ClusteringProjector.h\"\n#include \"..\/auxiliary\/Log.h\"\n#include \"..\/auxiliary\/Timer.h\"\n#include \"..\/auxiliary\/SignalHandling.h\"\n\n\n#include <sstream>\n\nnamespace NetworKit {\n\nPLM::PLM(const Graph& G, bool refine, double gamma, std::string par, count maxIter, bool turbo, bool recurse) : CommunityDetectionAlgorithm(G), parallelism(par), refine(refine), gamma(gamma), maxIter(maxIter), turbo(turbo), recurse(recurse) {\n\n}\n\nPLM::PLM(const Graph& G, const PLM& other) : CommunityDetectionAlgorithm(G), parallelism(other.parallelism), refine(other.refine), gamma(other.gamma), maxIter(other.maxIter), turbo(other.turbo), recurse(other.recurse) {\n\n}\n\nvoid PLM::run() {\n\tAux::SignalHandler handler;\n\tDEBUG(\"calling run method on \" , G.toString());\n\n\tcount z = G.upperNodeIdBound();\n\n\n\t\/\/ init communities to singletons\n\tPartition zeta(z);\n\tzeta.allToSingletons();\n\tindex o = zeta.upperBound();\n\n\t\/\/ init graph-dependent temporaries\n\tstd::vector<double> volNode(z, 0.0);\n\t\/\/ $\\omega(E)$\n\tedgeweight total = G.totalEdgeWeight();\n\tDEBUG(\"total edge weight: \" , total);\n\tedgeweight divisor = (2 * total * total); \/\/ needed in modularity calculation\n\n\tG.parallelForNodes([&](node u) { \/\/ calculate and store volume of each node\n\t\tvolNode[u] += G.weightedDegree(u);\n\t\tvolNode[u] += G.weight(u, u); \/\/ consider self-loop twice\n\t\t\/\/ TRACE(\"init volNode[\" , u , \"] to \" , volNode[u]);\n\t});\n\n\t\/\/ init community-dependent temporaries\n\tstd::vector<double> volCommunity(o, 0.0);\n\tzeta.parallelForEntries([&](node u, index C) { \t\/\/ set volume for all communities\n\t\tif (C != none)\n\t\t\tvolCommunity[C] = volNode[u];\n\t});\n\n\t\/\/ first move phase\n\tbool moved = false; \/\/ indicates whether any node has been moved in the last pass\n\tbool change = false; \/\/ indicates whether the communities have changed at all\n\n\t\/\/ stores the affinity for each neighboring community (index), one vector per thread\n\tstd::vector<std::vector<edgeweight> > turboAffinity;\n\t\/\/ stores the list of neighboring communities, one vector per thread\n\tstd::vector<std::vector<index> > neigh_comm;\n\n\n\tif (turbo) {\n\t\tif (this->parallelism != \"none\" && this->parallelism != \"none randomized\") { \/\/ initialize arrays for all threads only when actually needed\n\t\t\tturboAffinity.resize(omp_get_max_threads());\n\t\t\tneigh_comm.resize(omp_get_max_threads());\n\t\t\tfor (auto &it : turboAffinity) {\n\t\t\t\t\/\/ resize to maximum community id\n\t\t\t\tit.resize(zeta.upperBound());\n\t\t\t}\n\t\t\tfor (auto &it : neigh_comm) {\n\t\t\t\t\/\/ resize to maximum size so no further memory allocation is needed\n\t\t\t\tit.resize(G.upperNodeIdBound());\n\t\t\t}\n\t\t} else { \/\/ initialize array only for first thread\n\t\t\tturboAffinity.emplace_back(zeta.upperBound());\n\t\t\tneigh_comm.emplace_back(G.upperNodeIdBound());\n\t\t}\n\t}\n\n\t\/\/ try to improve modularity by moving a node to neighboring clusters\n\tauto tryMove = [&](node u) {\n\t\t\/\/ TRACE(\"trying to move node \" , u);\n\t\tindex tid = omp_get_thread_num();\n\n\t\t\/\/ collect edge weight to neighbor clusters\n\t\tstd::map<index, edgeweight> affinity;\n\t\t\/\/ only for turbo mode, stores the number of neighbors\n\t\tindex numNeighbors = 0;\n\n\t\tif (turbo) {\n\t\t\tG.forNeighborsOf(u, [&](node v) {\n\t\t\t\tturboAffinity[tid][zeta[v]] = -1; \/\/ set all to -1 so we can see when we get to it the first time\n\t\t\t});\n\t\t\tturboAffinity[tid][zeta[u]] = 0;\n\t\t\tG.forNeighborsOf(u, [&](node v, edgeweight weight) {\n\t\t\t\tif (u != v) {\n\t\t\t\t\tindex C = zeta[v];\n\t\t\t\t\tif (turboAffinity[tid][C] == -1) {\n\t\t\t\t\t\t\/\/ found the neighbor for the first time, initialize to 0 and add to list of neighboring communities\n\t\t\t\t\t\tturboAffinity[tid][C] = 0;\n\t\t\t\t\t\tneigh_comm[tid][numNeighbors++] = C;\n\t\t\t\t\t}\n\t\t\t\t\tturboAffinity[tid][C] += weight;\n\t\t\t\t}\n\t\t\t});\n\t\t} else {\n\t\t\tG.forNeighborsOf(u, [&](node v, edgeweight weight) {\n\t\t\t\tif (u != v) {\n\t\t\t\t\tindex C = zeta[v];\n\t\t\t\t\taffinity[C] += weight;\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\n\n\t\t\/\/ sub-functions\n\n\t\t\/\/ $\\vol(C \\ {x})$ - volume of cluster C excluding node x\n\t\tauto volCommunityMinusNode = [&](index C, node x) {\n\t\t\tdouble volC = 0.0;\n\t\t\tdouble volN = 0.0;\n\t\t\tvolC = volCommunity[C];\n\t\t\tif (zeta[x] == C) {\n\t\t\t\tvolN = volNode[x];\n\t\t\t\treturn volC - volN;\n\t\t\t} else {\n\t\t\t\treturn volC;\n\t\t\t}\n\t\t};\n\n\t\t\/\/ \/\/ $\\omega(u | C \\ u)$\n\t\t\/\/ auto omegaCut = [&](node u, index C) {\n\t\t\/\/ \treturn affinity[C];\n\t\t\/\/ };\n\n\t\tauto modGain = [&](node u, index C, index D, edgeweight affinityC, edgeweight affinityD) {\n\t\t\tdouble volN = 0.0;\n\t\t\tvolN = volNode[u];\n\t\t\tdouble delta = (affinityD - affinityC) \/ total + this->gamma * ((volCommunityMinusNode(C, u) - volCommunityMinusNode(D, u)) * volN) \/ divisor;\n\t\t\t\/\/TRACE(\"(\" , affinity[D] , \" - \" , affinity[C] , \") \/ \" , total , \" + \" , this->gamma , \" * ((\" , volCommunityMinusNode(C, u) , \" - \" , volCommunityMinusNode(D, u) , \") *\" , volN , \") \/ 2 * \" , (total * total));\n\t\t\treturn delta;\n\t\t};\n\n\t\tindex best = none;\n\t\tindex C = none;\n\t\tindex D = none;\n\t\tdouble deltaBest = -1;\n\n\t\tC = zeta[u];\n\n\t\tif (turbo) {\n\t\t\tedgeweight affinityC = turboAffinity[tid][C];\n\n\t\t\tfor (index i = 0; i < numNeighbors; ++i) {\n\t\t\t\tD = neigh_comm[tid][i];\n\n\t\t\t\tif (D != C) { \/\/ consider only nodes in other clusters (and implicitly only nodes other than u)\n\t\t\t\t\tdouble delta = modGain(u, C, D, affinityC, turboAffinity[tid][D]);\n\n\t\t\t\t\t\/\/ TRACE(\"mod gain: \" , delta);\n\t\t\t\t\tif (delta > deltaBest) {\n\t\t\t\t\t\tdeltaBest = delta;\n\t\t\t\t\t\tbest = D;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tedgeweight affinityC = affinity[C];\n\n\/\/\t\t\tTRACE(\"Processing neighborhood of node \" , u , \", which is in cluster \" , C);\n\t\t\tfor (auto it : affinity) {\n\t\t\t\tD = it.first;\n\t\t\t\tif (D != C) { \/\/ consider only nodes in other clusters (and implicitly only nodes other than u)\n\t\t\t\t\tdouble delta = modGain(u, C, D, affinityC, it.second);\n\t\t\t\t\t\/\/ TRACE(\"mod gain: \" , delta);\n\t\t\t\t\tif (delta > deltaBest) {\n\t\t\t\t\t\tdeltaBest = delta;\n\t\t\t\t\t\tbest = D;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ TRACE(\"deltaBest=\" , deltaBest);\n\t\tif (deltaBest > 0) { \/\/ if modularity improvement possible\n\t\t\tassert (best != C && best != none);\/\/ do not \"move\" to original cluster\n\n\t\t\tzeta[u] = best; \/\/ move to best cluster\n\t\t\t\/\/ TRACE(\"node \" , u , \" moved\");\n\n\t\t\t\/\/ mod update\n\t\t\tdouble volN = 0.0;\n\t\t\tvolN = volNode[u];\n\t\t\t\/\/ update the volume of the two clusters\n\t\t\t#pragma omp atomic update\n\t\t\tvolCommunity[C] -= volN;\n\t\t\t#pragma omp atomic update\n\t\t\tvolCommunity[best] += volN;\n\n\t\t\tmoved = true; \/\/ change to clustering has been made\n\n\t\t} else {\n\t\t\t\/\/ TRACE(\"node \" , u , \" not moved\");\n\t\t}\n\t};\n\n\t\/\/ performs node moves\n\tauto movePhase = [&](){\n\t\tcount iter = 0;\n\t\tdo {\n\t\t\tmoved = false;\n\t\t\t\/\/ apply node movement according to parallelization strategy\n\t\t\tif (this->parallelism == \"none\") {\n\t\t\t\tG.forNodes(tryMove);\n\t\t\t} else if (this->parallelism == \"simple\") {\n\t\t\t\tG.parallelForNodes(tryMove);\n\t\t\t} else if (this->parallelism == \"balanced\") {\n\t\t\t\tG.balancedParallelForNodes(tryMove);\n\t\t\t} else if (this->parallelism == \"none randomized\") {\n\t\t\t\tG.forNodesInRandomOrder(tryMove);\n\t\t\t} else {\n\t\t\t\tERROR(\"unknown parallelization strategy: \" , this->parallelism);\n\t\t\t\tthrow std::runtime_error(\"unknown parallelization strategy\");\n\t\t\t}\n\t\t\tif (moved) change = true;\n\n\t\t\tif (iter == maxIter) {\n\t\t\t\tWARN(\"move phase aborted after \", maxIter, \" iterations\");\n\t\t\t}\n\t\t\titer += 1;\n\t\t} while (moved && (iter <= maxIter) && handler.isRunning());\n\t\tDEBUG(\"iterations in move phase: \", iter);\n\t};\n\thandler.assureRunning();\n\t\/\/ first move phase\n\tAux::Timer timer;\n\ttimer.start();\n\t\/\/\n\tmovePhase();\n\t\/\/\n\ttimer.stop();\n\ttiming[\"move\"].push_back(timer.elapsedMilliseconds());\n\thandler.assureRunning();\n\tif (recurse && change) {\n\t\tINFO(\"nodes moved, so begin coarsening and recursive call\");\n\n\t\ttimer.start();\n\t\t\/\/\n\t\tstd::pair<Graph, std::vector<node>> coarsened = coarsen(G, zeta);\t\/\/ coarsen graph according to communitites\n\t\t\/\/\n\t\ttimer.stop();\n\t\ttiming[\"coarsen\"].push_back(timer.elapsedMilliseconds());\n\n\t\tPLM onCoarsened(coarsened.first, this->refine, this->gamma, this->parallelism, this->maxIter, this->turbo);\n\t\tonCoarsened.run();\n\t\tPartition zetaCoarse = onCoarsened.getPartition();\n\n\t\t\/\/ get timings\n\t\tauto tim = onCoarsened.getTiming();\n\t\tfor (count t : tim[\"move\"]) {\n\t\t\ttiming[\"move\"].push_back(t);\n\t\t}\n\t\tfor (count t : tim[\"coarsen\"]) {\n\t\t\ttiming[\"coarsen\"].push_back(t);\n\t\t}\n\t\tfor (count t : tim[\"refine\"]) {\n\t\t\ttiming[\"refine\"].push_back(t);\n\t\t}\n\n\n\t\tINFO(\"coarse graph has \", coarsened.first.numberOfNodes(), \" nodes and \", coarsened.first.numberOfEdges(), \" edges\");\n\t\tzeta = prolong(coarsened.first, zetaCoarse, G, coarsened.second); \/\/ unpack communities in coarse graph onto fine graph\n\t\t\/\/ refinement phase\n\t\tif (refine) {\n\t\t\tDEBUG(\"refinement phase\");\n\t\t\t\/\/ reinit community-dependent temporaries\n\t\t\to = zeta.upperBound();\n\t\t\tvolCommunity.clear();\n\t\t\tvolCommunity.resize(o, 0.0);\n\t\t\tzeta.parallelForEntries([&](node u, index C) { \t\/\/ set volume for all communities\n\t\t\t\tif (C != none) {\n\t\t\t\t\tedgeweight volN = volNode[u];\n\t\t\t\t\t#pragma omp atomic update\n\t\t\t\t\tvolCommunity[C] += volN;\n\t\t\t\t}\n\t\t\t});\n\t\t\t\/\/ second move phase\n\t\t\ttimer.start();\n\t\t\t\/\/\n\t\t\tmovePhase();\n\t\t\t\/\/\n\t\t\ttimer.stop();\n\t\t\ttiming[\"refine\"].push_back(timer.elapsedMilliseconds());\n\n\t\t}\n\t}\n\tresult = std::move(zeta);\n\thasRun = true;\n}\n\nstd::string NetworKit::PLM::toString() const {\n\tstd::stringstream stream;\n\tstream << \"PLM(\";\n\tstream << parallelism;\n\tif (refine) {\n\t\tstream << \",\" << \"refine\";\n\t}\n\tstream << \",\" << \"pc\";\n\tif (turbo) {\n\t\tstream << \",\" << \"turbo\";\n\t}\n\tif (!recurse) {\n\t\tstream << \",\" << \"non-recursive\";\n\t}\n\tstream << \")\";\n\n\treturn stream.str();\n}\n\nstd::pair<Graph, std::vector<node> > PLM::coarsen(const Graph& G, const Partition& zeta) {\n\tParallelPartitionCoarsening parCoarsening(G, zeta);\n\tparCoarsening.run();\n\treturn {parCoarsening.getCoarseGraph(),parCoarsening.getFineToCoarseNodeMapping()};\n}\n\nPartition PLM::prolong(const Graph& Gcoarse, const Partition& zetaCoarse, const Graph& Gfine, std::vector<node> nodeToMetaNode) {\n\tPartition zetaFine(Gfine.upperNodeIdBound());\n\tzetaFine.setUpperBound(zetaCoarse.upperBound());\n\n\tGfine.forNodes([&](node v) {\n\t\tnode mv = nodeToMetaNode[v];\n\t\tindex cv = zetaCoarse[mv];\n\t\tzetaFine[v] = cv;\n\t});\n\n\n\treturn zetaFine;\n}\n\n\n\nstd::map<std::string, std::vector<count> > PLM::getTiming() {\n\treturn timing;\n}\n\n} \/* namespace NetworKit *\/\n<commit_msg>PLM: use less memory when the maximum degree is small<commit_after>\/*\n * MLPLM.cpp\n *\n *  Created on: 20.11.2013\n *      Author: cls\n *\/\n\n#include \"PLM.h\"\n#include <omp.h>\n#include \"..\/coarsening\/ParallelPartitionCoarsening.h\"\n#include \"..\/coarsening\/ClusteringProjector.h\"\n#include \"..\/auxiliary\/Log.h\"\n#include \"..\/auxiliary\/Timer.h\"\n#include \"..\/auxiliary\/SignalHandling.h\"\n\n\n#include <sstream>\n\nnamespace NetworKit {\n\nPLM::PLM(const Graph& G, bool refine, double gamma, std::string par, count maxIter, bool turbo, bool recurse) : CommunityDetectionAlgorithm(G), parallelism(par), refine(refine), gamma(gamma), maxIter(maxIter), turbo(turbo), recurse(recurse) {\n\n}\n\nPLM::PLM(const Graph& G, const PLM& other) : CommunityDetectionAlgorithm(G), parallelism(other.parallelism), refine(other.refine), gamma(other.gamma), maxIter(other.maxIter), turbo(other.turbo), recurse(other.recurse) {\n\n}\n\nvoid PLM::run() {\n\tAux::SignalHandler handler;\n\tDEBUG(\"calling run method on \" , G.toString());\n\n\tcount z = G.upperNodeIdBound();\n\n\n\t\/\/ init communities to singletons\n\tPartition zeta(z);\n\tzeta.allToSingletons();\n\tindex o = zeta.upperBound();\n\n\t\/\/ init graph-dependent temporaries\n\tstd::vector<double> volNode(z, 0.0);\n\t\/\/ $\\omega(E)$\n\tedgeweight total = G.totalEdgeWeight();\n\tDEBUG(\"total edge weight: \" , total);\n\tedgeweight divisor = (2 * total * total); \/\/ needed in modularity calculation\n\n\tG.parallelForNodes([&](node u) { \/\/ calculate and store volume of each node\n\t\tvolNode[u] += G.weightedDegree(u);\n\t\tvolNode[u] += G.weight(u, u); \/\/ consider self-loop twice\n\t\t\/\/ TRACE(\"init volNode[\" , u , \"] to \" , volNode[u]);\n\t});\n\n\t\/\/ init community-dependent temporaries\n\tstd::vector<double> volCommunity(o, 0.0);\n\tzeta.parallelForEntries([&](node u, index C) { \t\/\/ set volume for all communities\n\t\tif (C != none)\n\t\t\tvolCommunity[C] = volNode[u];\n\t});\n\n\t\/\/ first move phase\n\tbool moved = false; \/\/ indicates whether any node has been moved in the last pass\n\tbool change = false; \/\/ indicates whether the communities have changed at all\n\n\t\/\/ stores the affinity for each neighboring community (index), one vector per thread\n\tstd::vector<std::vector<edgeweight> > turboAffinity;\n\t\/\/ stores the list of neighboring communities, one vector per thread\n\tstd::vector<std::vector<index> > neigh_comm;\n\n\n\tif (turbo) {\n\t\tif (this->parallelism != \"none\" && this->parallelism != \"none randomized\") { \/\/ initialize arrays for all threads only when actually needed\n\t\t\tturboAffinity.resize(omp_get_max_threads());\n\t\t\tneigh_comm.resize(omp_get_max_threads());\n\t\t\tfor (auto &it : turboAffinity) {\n\t\t\t\t\/\/ resize to maximum community id\n\t\t\t\tit.resize(zeta.upperBound());\n\t\t\t}\n\t\t} else { \/\/ initialize array only for first thread\n\t\t\tturboAffinity.emplace_back(zeta.upperBound());\n\t\t\tneigh_comm.emplace_back();\n\t\t}\n\t}\n\n\t\/\/ try to improve modularity by moving a node to neighboring clusters\n\tauto tryMove = [&](node u) {\n\t\t\/\/ TRACE(\"trying to move node \" , u);\n\t\tindex tid = omp_get_thread_num();\n\n\t\t\/\/ collect edge weight to neighbor clusters\n\t\tstd::map<index, edgeweight> affinity;\n\n\t\tif (turbo) {\n\t\t\tneigh_comm[tid].clear();\n\t\t\tG.forNeighborsOf(u, [&](node v) {\n\t\t\t\tturboAffinity[tid][zeta[v]] = -1; \/\/ set all to -1 so we can see when we get to it the first time\n\t\t\t});\n\t\t\tturboAffinity[tid][zeta[u]] = 0;\n\t\t\tG.forNeighborsOf(u, [&](node v, edgeweight weight) {\n\t\t\t\tif (u != v) {\n\t\t\t\t\tindex C = zeta[v];\n\t\t\t\t\tif (turboAffinity[tid][C] == -1) {\n\t\t\t\t\t\t\/\/ found the neighbor for the first time, initialize to 0 and add to list of neighboring communities\n\t\t\t\t\t\tturboAffinity[tid][C] = 0;\n\t\t\t\t\t\tneigh_comm[tid].push_back(C);\n\t\t\t\t\t}\n\t\t\t\t\tturboAffinity[tid][C] += weight;\n\t\t\t\t}\n\t\t\t});\n\t\t} else {\n\t\t\tG.forNeighborsOf(u, [&](node v, edgeweight weight) {\n\t\t\t\tif (u != v) {\n\t\t\t\t\tindex C = zeta[v];\n\t\t\t\t\taffinity[C] += weight;\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\n\n\t\t\/\/ sub-functions\n\n\t\t\/\/ $\\vol(C \\ {x})$ - volume of cluster C excluding node x\n\t\tauto volCommunityMinusNode = [&](index C, node x) {\n\t\t\tdouble volC = 0.0;\n\t\t\tdouble volN = 0.0;\n\t\t\tvolC = volCommunity[C];\n\t\t\tif (zeta[x] == C) {\n\t\t\t\tvolN = volNode[x];\n\t\t\t\treturn volC - volN;\n\t\t\t} else {\n\t\t\t\treturn volC;\n\t\t\t}\n\t\t};\n\n\t\t\/\/ \/\/ $\\omega(u | C \\ u)$\n\t\t\/\/ auto omegaCut = [&](node u, index C) {\n\t\t\/\/ \treturn affinity[C];\n\t\t\/\/ };\n\n\t\tauto modGain = [&](node u, index C, index D, edgeweight affinityC, edgeweight affinityD) {\n\t\t\tdouble volN = 0.0;\n\t\t\tvolN = volNode[u];\n\t\t\tdouble delta = (affinityD - affinityC) \/ total + this->gamma * ((volCommunityMinusNode(C, u) - volCommunityMinusNode(D, u)) * volN) \/ divisor;\n\t\t\t\/\/TRACE(\"(\" , affinity[D] , \" - \" , affinity[C] , \") \/ \" , total , \" + \" , this->gamma , \" * ((\" , volCommunityMinusNode(C, u) , \" - \" , volCommunityMinusNode(D, u) , \") *\" , volN , \") \/ 2 * \" , (total * total));\n\t\t\treturn delta;\n\t\t};\n\n\t\tindex best = none;\n\t\tindex C = none;\n\t\tdouble deltaBest = -1;\n\n\t\tC = zeta[u];\n\n\t\tif (turbo) {\n\t\t\tedgeweight affinityC = turboAffinity[tid][C];\n\n\t\t\tfor (index D : neigh_comm[tid]) {\n\t\t\t\tif (D != C) { \/\/ consider only nodes in other clusters (and implicitly only nodes other than u)\n\t\t\t\t\tdouble delta = modGain(u, C, D, affinityC, turboAffinity[tid][D]);\n\n\t\t\t\t\t\/\/ TRACE(\"mod gain: \" , delta);\n\t\t\t\t\tif (delta > deltaBest) {\n\t\t\t\t\t\tdeltaBest = delta;\n\t\t\t\t\t\tbest = D;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tedgeweight affinityC = affinity[C];\n\n\/\/\t\t\tTRACE(\"Processing neighborhood of node \" , u , \", which is in cluster \" , C);\n\t\t\tfor (auto it : affinity) {\n\t\t\t\tindex D = it.first;\n\t\t\t\tif (D != C) { \/\/ consider only nodes in other clusters (and implicitly only nodes other than u)\n\t\t\t\t\tdouble delta = modGain(u, C, D, affinityC, it.second);\n\t\t\t\t\t\/\/ TRACE(\"mod gain: \" , delta);\n\t\t\t\t\tif (delta > deltaBest) {\n\t\t\t\t\t\tdeltaBest = delta;\n\t\t\t\t\t\tbest = D;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ TRACE(\"deltaBest=\" , deltaBest);\n\t\tif (deltaBest > 0) { \/\/ if modularity improvement possible\n\t\t\tassert (best != C && best != none);\/\/ do not \"move\" to original cluster\n\n\t\t\tzeta[u] = best; \/\/ move to best cluster\n\t\t\t\/\/ TRACE(\"node \" , u , \" moved\");\n\n\t\t\t\/\/ mod update\n\t\t\tdouble volN = 0.0;\n\t\t\tvolN = volNode[u];\n\t\t\t\/\/ update the volume of the two clusters\n\t\t\t#pragma omp atomic update\n\t\t\tvolCommunity[C] -= volN;\n\t\t\t#pragma omp atomic update\n\t\t\tvolCommunity[best] += volN;\n\n\t\t\tmoved = true; \/\/ change to clustering has been made\n\n\t\t} else {\n\t\t\t\/\/ TRACE(\"node \" , u , \" not moved\");\n\t\t}\n\t};\n\n\t\/\/ performs node moves\n\tauto movePhase = [&](){\n\t\tcount iter = 0;\n\t\tdo {\n\t\t\tmoved = false;\n\t\t\t\/\/ apply node movement according to parallelization strategy\n\t\t\tif (this->parallelism == \"none\") {\n\t\t\t\tG.forNodes(tryMove);\n\t\t\t} else if (this->parallelism == \"simple\") {\n\t\t\t\tG.parallelForNodes(tryMove);\n\t\t\t} else if (this->parallelism == \"balanced\") {\n\t\t\t\tG.balancedParallelForNodes(tryMove);\n\t\t\t} else if (this->parallelism == \"none randomized\") {\n\t\t\t\tG.forNodesInRandomOrder(tryMove);\n\t\t\t} else {\n\t\t\t\tERROR(\"unknown parallelization strategy: \" , this->parallelism);\n\t\t\t\tthrow std::runtime_error(\"unknown parallelization strategy\");\n\t\t\t}\n\t\t\tif (moved) change = true;\n\n\t\t\tif (iter == maxIter) {\n\t\t\t\tWARN(\"move phase aborted after \", maxIter, \" iterations\");\n\t\t\t}\n\t\t\titer += 1;\n\t\t} while (moved && (iter <= maxIter) && handler.isRunning());\n\t\tDEBUG(\"iterations in move phase: \", iter);\n\t};\n\thandler.assureRunning();\n\t\/\/ first move phase\n\tAux::Timer timer;\n\ttimer.start();\n\t\/\/\n\tmovePhase();\n\t\/\/\n\ttimer.stop();\n\ttiming[\"move\"].push_back(timer.elapsedMilliseconds());\n\thandler.assureRunning();\n\tif (recurse && change) {\n\t\tINFO(\"nodes moved, so begin coarsening and recursive call\");\n\n\t\ttimer.start();\n\t\t\/\/\n\t\tstd::pair<Graph, std::vector<node>> coarsened = coarsen(G, zeta);\t\/\/ coarsen graph according to communitites\n\t\t\/\/\n\t\ttimer.stop();\n\t\ttiming[\"coarsen\"].push_back(timer.elapsedMilliseconds());\n\n\t\tPLM onCoarsened(coarsened.first, this->refine, this->gamma, this->parallelism, this->maxIter, this->turbo);\n\t\tonCoarsened.run();\n\t\tPartition zetaCoarse = onCoarsened.getPartition();\n\n\t\t\/\/ get timings\n\t\tauto tim = onCoarsened.getTiming();\n\t\tfor (count t : tim[\"move\"]) {\n\t\t\ttiming[\"move\"].push_back(t);\n\t\t}\n\t\tfor (count t : tim[\"coarsen\"]) {\n\t\t\ttiming[\"coarsen\"].push_back(t);\n\t\t}\n\t\tfor (count t : tim[\"refine\"]) {\n\t\t\ttiming[\"refine\"].push_back(t);\n\t\t}\n\n\n\t\tINFO(\"coarse graph has \", coarsened.first.numberOfNodes(), \" nodes and \", coarsened.first.numberOfEdges(), \" edges\");\n\t\tzeta = prolong(coarsened.first, zetaCoarse, G, coarsened.second); \/\/ unpack communities in coarse graph onto fine graph\n\t\t\/\/ refinement phase\n\t\tif (refine) {\n\t\t\tDEBUG(\"refinement phase\");\n\t\t\t\/\/ reinit community-dependent temporaries\n\t\t\to = zeta.upperBound();\n\t\t\tvolCommunity.clear();\n\t\t\tvolCommunity.resize(o, 0.0);\n\t\t\tzeta.parallelForEntries([&](node u, index C) { \t\/\/ set volume for all communities\n\t\t\t\tif (C != none) {\n\t\t\t\t\tedgeweight volN = volNode[u];\n\t\t\t\t\t#pragma omp atomic update\n\t\t\t\t\tvolCommunity[C] += volN;\n\t\t\t\t}\n\t\t\t});\n\t\t\t\/\/ second move phase\n\t\t\ttimer.start();\n\t\t\t\/\/\n\t\t\tmovePhase();\n\t\t\t\/\/\n\t\t\ttimer.stop();\n\t\t\ttiming[\"refine\"].push_back(timer.elapsedMilliseconds());\n\n\t\t}\n\t}\n\tresult = std::move(zeta);\n\thasRun = true;\n}\n\nstd::string NetworKit::PLM::toString() const {\n\tstd::stringstream stream;\n\tstream << \"PLM(\";\n\tstream << parallelism;\n\tif (refine) {\n\t\tstream << \",\" << \"refine\";\n\t}\n\tstream << \",\" << \"pc\";\n\tif (turbo) {\n\t\tstream << \",\" << \"turbo\";\n\t}\n\tif (!recurse) {\n\t\tstream << \",\" << \"non-recursive\";\n\t}\n\tstream << \")\";\n\n\treturn stream.str();\n}\n\nstd::pair<Graph, std::vector<node> > PLM::coarsen(const Graph& G, const Partition& zeta) {\n\tParallelPartitionCoarsening parCoarsening(G, zeta);\n\tparCoarsening.run();\n\treturn {parCoarsening.getCoarseGraph(),parCoarsening.getFineToCoarseNodeMapping()};\n}\n\nPartition PLM::prolong(const Graph& Gcoarse, const Partition& zetaCoarse, const Graph& Gfine, std::vector<node> nodeToMetaNode) {\n\tPartition zetaFine(Gfine.upperNodeIdBound());\n\tzetaFine.setUpperBound(zetaCoarse.upperBound());\n\n\tGfine.forNodes([&](node v) {\n\t\tnode mv = nodeToMetaNode[v];\n\t\tindex cv = zetaCoarse[mv];\n\t\tzetaFine[v] = cv;\n\t});\n\n\n\treturn zetaFine;\n}\n\n\n\nstd::map<std::string, std::vector<count> > PLM::getTiming() {\n\treturn timing;\n}\n\n} \/* namespace NetworKit *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: hi_linkhelper.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: vg $ $Date: 2003-07-02 13:49: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\n#include <precomp.h>\n#include \"hi_linkhelper.hxx\"\n\n\n\/\/ NOT FULLY DEFINED SERVICES\n#include <ary\/idl\/i_module.hxx>\n\n\n\n\nconst ary::idl::Module *\nLinkHelper::Search_CurModule() const\n{\n    return Search_Module( rEnv.CurPosition().RelatedNode() );\n}\n\nconst ary::idl::Module *\nLinkHelper::Search_Module( output::Node & i_node ) const\n{\n    static StringVector aNames_;\n\n    output::Node::relative_id\n        nId = i_node.RelatedNameRoom();\n    if (nId == 0)\n    {\n        csv::erase_container(aNames_);\n        i_node.Get_Chain(aNames_);\n        const ary::idl::Module *  pModule =\n            rEnv.Data().Search_Module(aNames_);\n        if ( pModule == 0 )\n            return 0;\n        nId = static_cast<output::Node::relative_id>(pModule->Id());\n        rEnv.CurPosition().RelatedNode().Set_RelatedNameRoom(nId);\n    }\n\n    return & rEnv.Data().Find_Module( ary::idl::Ce_id(nId) );\n}\n\nLinkHelper::OutPosition\nLinkHelper::PositionOf_Ce(const CE & i_ce) const\n{\n    static StringVector aModule_;\n    csv::erase_container(aModule_);\n    String sCe;\n    String sMember;\n    rEnv.Data().Get_CeText(aModule_, sCe, sMember, i_ce);\n    output::Node &\n        rNode = rEnv.OutputTree().RootNode().Provide_Child(aModule_);\n    return OutPosition(rNode,sCe);\n}\n\n\nnamespace\n{\n    const String C_sXrefsSuffix(\"-xref\");\n}\n\n\nLinkHelper::OutPosition\nLinkHelper::PositionOf_CurXRefs( const String & i_ceName ) const\n{\n    return OutPosition( rEnv.CurPosition(),\n                        StreamLock(100)() << i_ceName\n                                              << C_sXrefsSuffix\n                                              << \".html\"\n                                              << c_str );\n}\n\nconst String &\nLinkHelper::XrefsSuffix() const\n{\n    return C_sXrefsSuffix;\n}\n\n\nString\nnameChainLinker( const char * )\n{\n    static const String\n        sModuleFileName_( output::ModuleFileName() );\n    return sModuleFileName_;\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.98); FILE MERGED 2005\/09\/05 13:11:10 rt 1.2.98.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hi_linkhelper.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 17:52: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\n#include <precomp.h>\n#include \"hi_linkhelper.hxx\"\n\n\n\/\/ NOT FULLY DEFINED SERVICES\n#include <ary\/idl\/i_module.hxx>\n\n\n\n\nconst ary::idl::Module *\nLinkHelper::Search_CurModule() const\n{\n    return Search_Module( rEnv.CurPosition().RelatedNode() );\n}\n\nconst ary::idl::Module *\nLinkHelper::Search_Module( output::Node & i_node ) const\n{\n    static StringVector aNames_;\n\n    output::Node::relative_id\n        nId = i_node.RelatedNameRoom();\n    if (nId == 0)\n    {\n        csv::erase_container(aNames_);\n        i_node.Get_Chain(aNames_);\n        const ary::idl::Module *  pModule =\n            rEnv.Data().Search_Module(aNames_);\n        if ( pModule == 0 )\n            return 0;\n        nId = static_cast<output::Node::relative_id>(pModule->Id());\n        rEnv.CurPosition().RelatedNode().Set_RelatedNameRoom(nId);\n    }\n\n    return & rEnv.Data().Find_Module( ary::idl::Ce_id(nId) );\n}\n\nLinkHelper::OutPosition\nLinkHelper::PositionOf_Ce(const CE & i_ce) const\n{\n    static StringVector aModule_;\n    csv::erase_container(aModule_);\n    String sCe;\n    String sMember;\n    rEnv.Data().Get_CeText(aModule_, sCe, sMember, i_ce);\n    output::Node &\n        rNode = rEnv.OutputTree().RootNode().Provide_Child(aModule_);\n    return OutPosition(rNode,sCe);\n}\n\n\nnamespace\n{\n    const String C_sXrefsSuffix(\"-xref\");\n}\n\n\nLinkHelper::OutPosition\nLinkHelper::PositionOf_CurXRefs( const String & i_ceName ) const\n{\n    return OutPosition( rEnv.CurPosition(),\n                        StreamLock(100)() << i_ceName\n                                              << C_sXrefsSuffix\n                                              << \".html\"\n                                              << c_str );\n}\n\nconst String &\nLinkHelper::XrefsSuffix() const\n{\n    return C_sXrefsSuffix;\n}\n\n\nString\nnameChainLinker( const char * )\n{\n    static const String\n        sModuleFileName_( output::ModuleFileName() );\n    return sModuleFileName_;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"RobotCamera.h\"\n\n\nRobotCamera::RobotCamera(GLint viewWidth, GLint viewHeight, GLfloat viewNearPlane, GLfloat viewFarPlane)\n{\n\tCamera::initialize(viewWidth, viewHeight, viewNearPlane, viewFarPlane);\n\thasRobot = false;\n\t\/\/camera location\n\n\tlocX = 0.0f;\n\tlocY = 0.0f;\n\tlocZ = 0.0f;\n\tlookAt[0] = 0.0f;\n\tlookAt[1] = 0.0f;\n\tlookAt[2] = 0.0f;\n\tfovy = DEFAULT_FOVY;\n\trobot = NULL;\n\n}\n\nvoid RobotCamera::view(){\n\tif(hasRobot){\n\t\tglMatrixMode(GL_PROJECTION); \/\/why?\n\t\tglLoadIdentity();\n\t\tgluPerspective(fovy,viewWidth\/viewHeight, viewNearPlane, viewFarPlane);\n\t\tgluLookAt(locX, locY, locZ,lookAt[0], lookAt[1], lookAt[2],0,1,0);\n\t\t\/\/updateFog();\n\t}\n}\n\nvoid RobotCamera::updateFog()\n{\n        GLfloat flowLight[] = {0.5, 0.5, 0.5, 1};\n        glEnable(GL_FOG);\n        glFogfv(GL_FOG_COLOR, flowLight);\n        glFogf(GL_FOG_START, locZ);\n        glFogf(GL_FOG_END, locZ + 10);\n        glFogf(GL_FOG_DENSITY, 0.4f);\n        glFogi(GL_FOG_MODE, GL_LINEAR);\n}\n\n\/\/----------------------------------------------------------------\n\/\/\t\t\t\t\t\t\tORIENTATION\n\/\/----------------------------------------------------------------\nvoid RobotCamera::moveCameraForwards(bool negateTheValue){\n\tif(robot != NULL){\n\t\t\trobot->incrementPitchAngle(!negateTheValue);\n\t}\n}\n\nvoid RobotCamera::modifyYaw(bool negateTheValue, int x, int y){\n\tif(robot != NULL){\n\t\t\trobot->incrementYawAngle(!negateTheValue);\n\t}\n}\n\nvoid RobotCamera::moveCameraStrafe(bool negateTheValue){\n\tif(robot != NULL){\n\t\t\trobot->incrementSpinDegrees(negateTheValue);\n\t}\n}\n\nvoid RobotCamera::resetCameraAngle(){\n\tif(robot != NULL){\n\t\trobot->resetOrientation();\n\t}\n}\n\n\/\/----------------------------------------------------------------\n\/\/\t\t\t\t\t\t\tLIGHTING\n\/\/----------------------------------------------------------------\n\nvoid RobotCamera::toggleLight()\n{\n\trobot->toggleLight();\n}\n\n\/\/----------------------------------------------------------------\n\/\/\t\t\tROBOT ATTACHMENT AND SYNCHRONIZATION\n\/\/----------------------------------------------------------------\n\/\/ FUTURE IDEAS: Eventually to to prepare for deleting robots (ie. detach)\n\nvoid RobotCamera::attachToRobot(Robot* r){\n\tif(r != NULL){\n\t\trobot = r;\n\t\thasRobot = true;\n\t\trobot->attachToCamera(this);\n\t\tsynchEyePosition();\n\t\tsynchLookAtPosition();\n\t}\n}\n\nvoid RobotCamera::synchEyePosition(){\n\tlocX = robot->getEyeX();\n\tlocY = robot->getEyeY();\n\tlocZ = robot->getEyeZ();\n}\n\nvoid RobotCamera::synchLookAtPosition(){\n\tGLfloat* i = robot->getLookAt();\n\tlookAt[0] = i[0];\n\tlookAt[1] = i[1];\n\tlookAt[2] = i[2];\n\tdelete [] i;\n}\n\nvoid RobotCamera::update(){\n\tsynchEyePosition();\n\tsynchLookAtPosition();\n}\n\n\n<commit_msg>fixed the see through the walls bug in deathmatch<commit_after>#include \"RobotCamera.h\"\n\n\nRobotCamera::RobotCamera(GLint viewWidth, GLint viewHeight, GLfloat viewNearPlane, GLfloat viewFarPlane)\n{\n\tCamera::initialize(viewWidth, viewHeight, viewNearPlane, viewFarPlane);\n\thasRobot = false;\n\t\/\/camera location\n\n\tlocX = 0.0f;\n\tlocY = 0.0f;\n\tlocZ = 0.0f;\n\tlookAt[0] = 0.0f;\n\tlookAt[1] = 0.0f;\n\tlookAt[2] = 0.0f;\n\tfovy = DEFAULT_FOVY;\n\trobot = NULL;\n\n}\n\nvoid RobotCamera::view(){\n\tif(hasRobot){\n\t\tglMatrixMode(GL_PROJECTION); \/\/why?\n\t\tglLoadIdentity();\n\t\tgluPerspective(fovy,viewWidth\/viewHeight, 0.1, viewFarPlane);\n\t\tgluLookAt(locX, locY, locZ,lookAt[0], lookAt[1], lookAt[2],0,1,0);\n\t\t\/\/updateFog();\n\t}\n}\n\nvoid RobotCamera::updateFog()\n{\n        GLfloat flowLight[] = {0.5, 0.5, 0.5, 1};\n        glEnable(GL_FOG);\n        glFogfv(GL_FOG_COLOR, flowLight);\n        glFogf(GL_FOG_START, locZ);\n        glFogf(GL_FOG_END, locZ + 10);\n        glFogf(GL_FOG_DENSITY, 0.4f);\n        glFogi(GL_FOG_MODE, GL_LINEAR);\n}\n\n\/\/----------------------------------------------------------------\n\/\/\t\t\t\t\t\t\tORIENTATION\n\/\/----------------------------------------------------------------\nvoid RobotCamera::moveCameraForwards(bool negateTheValue){\n\tif(robot != NULL){\n\t\t\trobot->incrementPitchAngle(!negateTheValue);\n\t}\n}\n\nvoid RobotCamera::modifyYaw(bool negateTheValue, int x, int y){\n\tif(robot != NULL){\n\t\t\trobot->incrementYawAngle(!negateTheValue);\n\t}\n}\n\nvoid RobotCamera::moveCameraStrafe(bool negateTheValue){\n\tif(robot != NULL){\n\t\t\trobot->incrementSpinDegrees(negateTheValue);\n\t}\n}\n\nvoid RobotCamera::resetCameraAngle(){\n\tif(robot != NULL){\n\t\trobot->resetOrientation();\n\t}\n}\n\n\/\/----------------------------------------------------------------\n\/\/\t\t\t\t\t\t\tLIGHTING\n\/\/----------------------------------------------------------------\n\nvoid RobotCamera::toggleLight()\n{\n\trobot->toggleLight();\n}\n\n\/\/----------------------------------------------------------------\n\/\/\t\t\tROBOT ATTACHMENT AND SYNCHRONIZATION\n\/\/----------------------------------------------------------------\n\/\/ FUTURE IDEAS: Eventually to to prepare for deleting robots (ie. detach)\n\nvoid RobotCamera::attachToRobot(Robot* r){\n\tif(r != NULL){\n\t\trobot = r;\n\t\thasRobot = true;\n\t\trobot->attachToCamera(this);\n\t\tsynchEyePosition();\n\t\tsynchLookAtPosition();\n\t}\n}\n\nvoid RobotCamera::synchEyePosition(){\n\tlocX = robot->getEyeX();\n\tlocY = robot->getEyeY();\n\tlocZ = robot->getEyeZ();\n}\n\nvoid RobotCamera::synchLookAtPosition(){\n\tGLfloat* i = robot->getLookAt();\n\tlookAt[0] = i[0];\n\tlookAt[1] = i[1];\n\tlookAt[2] = i[2];\n\tdelete [] i;\n}\n\nvoid RobotCamera::update(){\n\tsynchEyePosition();\n\tsynchLookAtPosition();\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- ThreadList.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#include <stdlib.h>\n\n#include <algorithm>\n\n#include \"lldb\/Target\/ThreadList.h\"\n#include \"lldb\/Target\/Thread.h\"\n#include \"lldb\/Target\/ThreadPlan.h\"\n#include \"lldb\/Target\/Process.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\n\nThreadList::ThreadList (Process *process) :\n    m_process (process),\n    m_stop_id (0),\n    m_threads(),\n    m_threads_mutex (Mutex::eMutexTypeRecursive),\n    m_current_tid (LLDB_INVALID_THREAD_ID)\n{\n}\n\nThreadList::ThreadList (const ThreadList &rhs) :\n    m_process (),\n    m_stop_id (),\n    m_threads (),\n    m_threads_mutex (Mutex::eMutexTypeRecursive),\n    m_current_tid ()\n{\n    \/\/ Use the assignment operator since it uses the mutex\n    *this = rhs;\n}\n\nconst ThreadList&\nThreadList::operator = (const ThreadList& rhs)\n{\n    if (this != &rhs)\n    {\n        \/\/ Lock both mutexes to make sure neither side changes anyone on us\n        \/\/ while the assignement occurs\n        Mutex::Locker locker_lhs(m_threads_mutex);\n        Mutex::Locker locker_rhs(rhs.m_threads_mutex);\n        m_process = rhs.m_process;\n        m_stop_id = rhs.m_stop_id;\n        m_threads = rhs.m_threads;\n        m_current_tid = rhs.m_current_tid;\n    }\n    return *this;\n}\n\n\nThreadList::~ThreadList()\n{\n}\n\n\nuint32_t\nThreadList::GetStopID () const\n{\n    return m_stop_id;\n}\n\nvoid\nThreadList::SetStopID (uint32_t stop_id)\n{\n    m_stop_id = stop_id;\n}\n\n\nvoid\nThreadList::AddThread (ThreadSP &thread_sp)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    m_threads.push_back(thread_sp);\n}\n\nuint32_t\nThreadList::GetSize (bool can_update)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    if (can_update)\n        m_process->UpdateThreadListIfNeeded();\n    return m_threads.size();\n}\n\nThreadSP\nThreadList::GetThreadAtIndex (uint32_t idx, bool can_update)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    if (can_update)\n        m_process->UpdateThreadListIfNeeded();\n\n    ThreadSP thread_sp;\n    if (idx < m_threads.size())\n        thread_sp = m_threads[idx];\n    return thread_sp;\n}\n\nThreadSP\nThreadList::FindThreadByID (lldb::tid_t tid, bool can_update)\n{\n    Mutex::Locker locker(m_threads_mutex);\n\n    if (can_update)\n        m_process->UpdateThreadListIfNeeded();\n\n    ThreadSP thread_sp;\n    uint32_t idx = 0;\n    const uint32_t num_threads = m_threads.size();\n    for (idx = 0; idx < num_threads; ++idx)\n    {\n        if (m_threads[idx]->GetID() == tid)\n        {\n            thread_sp = m_threads[idx];\n            break;\n        }\n    }\n    return thread_sp;\n}\n\nThreadSP\nThreadList::GetThreadSPForThreadPtr (Thread *thread_ptr)\n{\n    ThreadSP thread_sp;\n    if (thread_ptr)\n    {\n        Mutex::Locker locker(m_threads_mutex);\n\n        uint32_t idx = 0;\n        const uint32_t num_threads = m_threads.size();\n        for (idx = 0; idx < num_threads; ++idx)\n        {\n            if (m_threads[idx].get() == thread_ptr)\n            {\n                thread_sp = m_threads[idx];\n                break;\n            }\n        }\n    }\n    return thread_sp;\n}\n\n\n\nThreadSP\nThreadList::FindThreadByIndexID (uint32_t index_id, bool can_update)\n{\n    Mutex::Locker locker(m_threads_mutex);\n\n    if (can_update)\n        m_process->UpdateThreadListIfNeeded();\n\n    ThreadSP thread_sp;\n    const uint32_t num_threads = m_threads.size();\n    for (uint32_t idx = 0; idx < num_threads; ++idx)\n    {\n        if (m_threads[idx]->GetIndexID() == index_id)\n        {\n            thread_sp = m_threads[idx];\n            break;\n        }\n    }\n    return thread_sp;\n}\n\nbool\nThreadList::ShouldStop (Event *event_ptr)\n{\n    Mutex::Locker locker(m_threads_mutex);\n\n    \/\/ Running events should never stop, obviously...\n\n\n    bool should_stop = false;    \n    m_process->UpdateThreadListIfNeeded();\n\n    collection::iterator pos, end = m_threads.end();\n\n    \/\/ Run through the threads and ask whether we should stop.  Don't ask\n    \/\/ suspended threads, however, it makes more sense for them to preserve their\n    \/\/ state across the times the process runs but they don't get a chance to.\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        ThreadSP thread_sp(*pos);\n        if ((thread_sp->GetResumeState () != eStateSuspended) && (thread_sp->ThreadStoppedForAReason()))\n        {\n            should_stop |=  thread_sp->ShouldStop(event_ptr);\n        }\n    }\n\n    if (should_stop)\n    {\n        for (pos = m_threads.begin(); pos != end; ++pos)\n        {\n            ThreadSP thread_sp(*pos);\n            thread_sp->WillStop ();\n        }\n    }\n\n    return should_stop;\n}\n\nVote\nThreadList::ShouldReportStop (Event *event_ptr)\n{\n    Vote result = eVoteNoOpinion;\n    m_process->UpdateThreadListIfNeeded();\n    collection::iterator pos, end = m_threads.end();\n\n    \/\/ Run through the threads and ask whether we should report this event.\n    \/\/ For stopping, a YES vote wins over everything.  A NO vote wins over NO opinion.\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        ThreadSP thread_sp(*pos);\n        if (thread_sp->ThreadStoppedForAReason() && (thread_sp->GetResumeState () != eStateSuspended))\n        {\n            switch (thread_sp->ShouldReportStop (event_ptr))\n            {\n                case eVoteNoOpinion:\n                    continue;\n                case eVoteYes:\n                    result = eVoteYes;\n                    break;\n                case eVoteNo:\n                    if (result == eVoteNoOpinion)\n                        result = eVoteNo;\n                    break;\n            }\n        }\n    }\n    return result;\n}\n\nVote\nThreadList::ShouldReportRun (Event *event_ptr)\n{\n    Vote result = eVoteNoOpinion;\n    m_process->UpdateThreadListIfNeeded();\n    collection::iterator pos, end = m_threads.end();\n\n    \/\/ Run through the threads and ask whether we should report this event.\n    \/\/ The rule is NO vote wins over everything, a YES vote wins over no opinion.\n\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        ThreadSP thread_sp(*pos);\n        if (thread_sp->GetResumeState () != eStateSuspended)\n\n        switch (thread_sp->ShouldReportRun (event_ptr))\n        {\n            case eVoteNoOpinion:\n                continue;\n            case eVoteYes:\n                if (result == eVoteNoOpinion)\n                    result = eVoteYes;\n                break;\n            case eVoteNo:\n                result = eVoteNo;\n                break;\n        }\n    }\n    return result;\n}\n\nvoid\nThreadList::Clear()\n{\n    m_stop_id = 0;\n    m_threads.clear();\n    m_current_tid = LLDB_INVALID_THREAD_ID;\n}\n\nvoid\nThreadList::RefreshStateAfterStop ()\n{\n    Mutex::Locker locker(m_threads_mutex);\n\n    m_process->UpdateThreadListIfNeeded();\n\n    collection::iterator pos, end = m_threads.end();\n    for (pos = m_threads.begin(); pos != end; ++pos)\n        (*pos)->RefreshStateAfterStop ();\n}\n\nvoid\nThreadList::DiscardThreadPlans ()\n{\n    \/\/ You don't need to update the thread list here, because only threads\n    \/\/ that you currently know about have any thread plans.\n    Mutex::Locker locker(m_threads_mutex);\n\n    collection::iterator pos, end = m_threads.end();\n    for (pos = m_threads.begin(); pos != end; ++pos)\n        (*pos)->DiscardThreadPlans (true);\n\n}\n\nbool\nThreadList::WillResume ()\n{\n    \/\/ Run through the threads and perform their momentary actions.\n    \/\/ But we only do this for threads that are running, user suspended\n    \/\/ threads stay where they are.\n    bool success = true;\n\n    Mutex::Locker locker(m_threads_mutex);\n    m_process->UpdateThreadListIfNeeded();\n\n    collection::iterator pos, end = m_threads.end();\n    \n    \/\/ Give all the threads a last chance to set up their state before we\n    \/\/ negotiate who is actually going to get a chance to run...\n\n    for (pos = m_threads.begin(); pos != end; ++pos)\n        (*pos)->SetupForResume ();\n    \n    \/\/ Now go through the threads and see if any thread wants to run just itself.\n    \/\/ if so then pick one and run it.\n    ThreadList run_me_only_list (m_process);\n    \n    run_me_only_list.SetStopID(m_process->GetStopID());\n\n    ThreadSP immediate_thread_sp;\n    bool run_only_current_thread = false;\n\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        ThreadSP thread_sp(*pos);\n        if (thread_sp->GetCurrentPlan()->IsImmediate())\n        {\n            \/\/ We first do all the immediate plans, so if we find one, set\n            \/\/ immediate_thread_sp and break out, and we'll pick it up first thing\n            \/\/ when we're negotiating which threads get to run.\n            immediate_thread_sp = thread_sp;\n            break;\n        }\n        else if (thread_sp->GetResumeState() != eStateSuspended &&\n                 thread_sp->GetCurrentPlan()->StopOthers())\n        {\n            \/\/ You can't say \"stop others\" and also want yourself to be suspended.\n            assert (thread_sp->GetCurrentPlan()->RunState() != eStateSuspended);\n\n            if (thread_sp == GetCurrentThread())\n            {\n                run_only_current_thread = true;\n                run_me_only_list.Clear();\n                run_me_only_list.AddThread (thread_sp);\n                break;\n            }\n\n            run_me_only_list.AddThread (thread_sp);\n        }\n\n    }\n\n    if (immediate_thread_sp)\n    {\n        for (pos = m_threads.begin(); pos != end; ++pos)\n        {\n            ThreadSP thread_sp(*pos);\n            if (thread_sp.get() == immediate_thread_sp.get())\n                thread_sp->WillResume(thread_sp->GetCurrentPlan()->RunState());\n            else\n                thread_sp->WillResume (eStateSuspended);\n        }\n    }\n    else if (run_me_only_list.GetSize (false) == 0)\n    {\n        \/\/ Everybody runs as they wish:\n        for (pos = m_threads.begin(); pos != end; ++pos)\n        {\n            ThreadSP thread_sp(*pos);\n            thread_sp->WillResume(thread_sp->GetCurrentPlan()->RunState());\n        }\n    }\n    else\n    {\n        ThreadSP thread_to_run;\n\n        if (run_only_current_thread)\n        {\n            thread_to_run = GetCurrentThread();\n        }\n        else if (run_me_only_list.GetSize (false) == 1)\n        {\n            thread_to_run = run_me_only_list.GetThreadAtIndex (0);\n        }\n        else\n        {\n            int random_thread = (int)\n                    ((run_me_only_list.GetSize (false) * (double) rand ()) \/ (RAND_MAX + 1.0));\n            thread_to_run = run_me_only_list.GetThreadAtIndex (random_thread);\n        }\n\n        for (pos = m_threads.begin(); pos != end; ++pos)\n        {\n            ThreadSP thread_sp(*pos);\n            if (thread_sp == thread_to_run)\n                thread_sp->WillResume(thread_sp->GetCurrentPlan()->RunState());\n            else\n                thread_sp->WillResume (eStateSuspended);\n        }\n    }\n\n    return success;\n}\n\nvoid\nThreadList::DidResume ()\n{\n    collection::iterator pos, end = m_threads.end();\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        \/\/ Don't clear out threads that aren't going to get a chance to run, rather\n        \/\/ leave their state for the next time around.\n        ThreadSP thread_sp(*pos);\n        if (thread_sp->GetResumeState() != eStateSuspended)\n            thread_sp->DidResume ();\n    }\n}\n\nThreadSP\nThreadList::GetCurrentThread ()\n{\n    Mutex::Locker locker(m_threads_mutex);\n    return FindThreadByID(m_current_tid);\n}\n\nbool\nThreadList::SetCurrentThreadByID (lldb::tid_t tid)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    if  (FindThreadByID(tid).get())\n        m_current_tid = tid;\n    else\n        m_current_tid = LLDB_INVALID_THREAD_ID;\n\n    return m_current_tid != LLDB_INVALID_THREAD_ID;\n}\n\nbool\nThreadList::SetCurrentThreadByIndexID (uint32_t index_id)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    ThreadSP thread_sp (FindThreadByIndexID(index_id));\n    if  (thread_sp.get())\n        m_current_tid = thread_sp->GetID();\n    else\n        m_current_tid = LLDB_INVALID_THREAD_ID;\n\n    return m_current_tid != LLDB_INVALID_THREAD_ID;\n}\n\n<commit_msg>Don't call PrepareForResume on threads that aren't going to get a chance to run this time around.<commit_after>\/\/===-- ThreadList.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#include <stdlib.h>\n\n#include <algorithm>\n\n#include \"lldb\/Target\/ThreadList.h\"\n#include \"lldb\/Target\/Thread.h\"\n#include \"lldb\/Target\/ThreadPlan.h\"\n#include \"lldb\/Target\/Process.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\n\nThreadList::ThreadList (Process *process) :\n    m_process (process),\n    m_stop_id (0),\n    m_threads(),\n    m_threads_mutex (Mutex::eMutexTypeRecursive),\n    m_current_tid (LLDB_INVALID_THREAD_ID)\n{\n}\n\nThreadList::ThreadList (const ThreadList &rhs) :\n    m_process (),\n    m_stop_id (),\n    m_threads (),\n    m_threads_mutex (Mutex::eMutexTypeRecursive),\n    m_current_tid ()\n{\n    \/\/ Use the assignment operator since it uses the mutex\n    *this = rhs;\n}\n\nconst ThreadList&\nThreadList::operator = (const ThreadList& rhs)\n{\n    if (this != &rhs)\n    {\n        \/\/ Lock both mutexes to make sure neither side changes anyone on us\n        \/\/ while the assignement occurs\n        Mutex::Locker locker_lhs(m_threads_mutex);\n        Mutex::Locker locker_rhs(rhs.m_threads_mutex);\n        m_process = rhs.m_process;\n        m_stop_id = rhs.m_stop_id;\n        m_threads = rhs.m_threads;\n        m_current_tid = rhs.m_current_tid;\n    }\n    return *this;\n}\n\n\nThreadList::~ThreadList()\n{\n}\n\n\nuint32_t\nThreadList::GetStopID () const\n{\n    return m_stop_id;\n}\n\nvoid\nThreadList::SetStopID (uint32_t stop_id)\n{\n    m_stop_id = stop_id;\n}\n\n\nvoid\nThreadList::AddThread (ThreadSP &thread_sp)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    m_threads.push_back(thread_sp);\n}\n\nuint32_t\nThreadList::GetSize (bool can_update)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    if (can_update)\n        m_process->UpdateThreadListIfNeeded();\n    return m_threads.size();\n}\n\nThreadSP\nThreadList::GetThreadAtIndex (uint32_t idx, bool can_update)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    if (can_update)\n        m_process->UpdateThreadListIfNeeded();\n\n    ThreadSP thread_sp;\n    if (idx < m_threads.size())\n        thread_sp = m_threads[idx];\n    return thread_sp;\n}\n\nThreadSP\nThreadList::FindThreadByID (lldb::tid_t tid, bool can_update)\n{\n    Mutex::Locker locker(m_threads_mutex);\n\n    if (can_update)\n        m_process->UpdateThreadListIfNeeded();\n\n    ThreadSP thread_sp;\n    uint32_t idx = 0;\n    const uint32_t num_threads = m_threads.size();\n    for (idx = 0; idx < num_threads; ++idx)\n    {\n        if (m_threads[idx]->GetID() == tid)\n        {\n            thread_sp = m_threads[idx];\n            break;\n        }\n    }\n    return thread_sp;\n}\n\nThreadSP\nThreadList::GetThreadSPForThreadPtr (Thread *thread_ptr)\n{\n    ThreadSP thread_sp;\n    if (thread_ptr)\n    {\n        Mutex::Locker locker(m_threads_mutex);\n\n        uint32_t idx = 0;\n        const uint32_t num_threads = m_threads.size();\n        for (idx = 0; idx < num_threads; ++idx)\n        {\n            if (m_threads[idx].get() == thread_ptr)\n            {\n                thread_sp = m_threads[idx];\n                break;\n            }\n        }\n    }\n    return thread_sp;\n}\n\n\n\nThreadSP\nThreadList::FindThreadByIndexID (uint32_t index_id, bool can_update)\n{\n    Mutex::Locker locker(m_threads_mutex);\n\n    if (can_update)\n        m_process->UpdateThreadListIfNeeded();\n\n    ThreadSP thread_sp;\n    const uint32_t num_threads = m_threads.size();\n    for (uint32_t idx = 0; idx < num_threads; ++idx)\n    {\n        if (m_threads[idx]->GetIndexID() == index_id)\n        {\n            thread_sp = m_threads[idx];\n            break;\n        }\n    }\n    return thread_sp;\n}\n\nbool\nThreadList::ShouldStop (Event *event_ptr)\n{\n    Mutex::Locker locker(m_threads_mutex);\n\n    \/\/ Running events should never stop, obviously...\n\n\n    bool should_stop = false;    \n    m_process->UpdateThreadListIfNeeded();\n\n    collection::iterator pos, end = m_threads.end();\n\n    \/\/ Run through the threads and ask whether we should stop.  Don't ask\n    \/\/ suspended threads, however, it makes more sense for them to preserve their\n    \/\/ state across the times the process runs but they don't get a chance to.\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        ThreadSP thread_sp(*pos);\n        if ((thread_sp->GetResumeState () != eStateSuspended) && (thread_sp->ThreadStoppedForAReason()))\n        {\n            should_stop |=  thread_sp->ShouldStop(event_ptr);\n        }\n    }\n\n    if (should_stop)\n    {\n        for (pos = m_threads.begin(); pos != end; ++pos)\n        {\n            ThreadSP thread_sp(*pos);\n            thread_sp->WillStop ();\n        }\n    }\n\n    return should_stop;\n}\n\nVote\nThreadList::ShouldReportStop (Event *event_ptr)\n{\n    Vote result = eVoteNoOpinion;\n    m_process->UpdateThreadListIfNeeded();\n    collection::iterator pos, end = m_threads.end();\n\n    \/\/ Run through the threads and ask whether we should report this event.\n    \/\/ For stopping, a YES vote wins over everything.  A NO vote wins over NO opinion.\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        ThreadSP thread_sp(*pos);\n        if (thread_sp->ThreadStoppedForAReason() && (thread_sp->GetResumeState () != eStateSuspended))\n        {\n            switch (thread_sp->ShouldReportStop (event_ptr))\n            {\n                case eVoteNoOpinion:\n                    continue;\n                case eVoteYes:\n                    result = eVoteYes;\n                    break;\n                case eVoteNo:\n                    if (result == eVoteNoOpinion)\n                        result = eVoteNo;\n                    break;\n            }\n        }\n    }\n    return result;\n}\n\nVote\nThreadList::ShouldReportRun (Event *event_ptr)\n{\n    Vote result = eVoteNoOpinion;\n    m_process->UpdateThreadListIfNeeded();\n    collection::iterator pos, end = m_threads.end();\n\n    \/\/ Run through the threads and ask whether we should report this event.\n    \/\/ The rule is NO vote wins over everything, a YES vote wins over no opinion.\n\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        ThreadSP thread_sp(*pos);\n        if (thread_sp->GetResumeState () != eStateSuspended)\n\n        switch (thread_sp->ShouldReportRun (event_ptr))\n        {\n            case eVoteNoOpinion:\n                continue;\n            case eVoteYes:\n                if (result == eVoteNoOpinion)\n                    result = eVoteYes;\n                break;\n            case eVoteNo:\n                result = eVoteNo;\n                break;\n        }\n    }\n    return result;\n}\n\nvoid\nThreadList::Clear()\n{\n    m_stop_id = 0;\n    m_threads.clear();\n    m_current_tid = LLDB_INVALID_THREAD_ID;\n}\n\nvoid\nThreadList::RefreshStateAfterStop ()\n{\n    Mutex::Locker locker(m_threads_mutex);\n\n    m_process->UpdateThreadListIfNeeded();\n\n    collection::iterator pos, end = m_threads.end();\n    for (pos = m_threads.begin(); pos != end; ++pos)\n        (*pos)->RefreshStateAfterStop ();\n}\n\nvoid\nThreadList::DiscardThreadPlans ()\n{\n    \/\/ You don't need to update the thread list here, because only threads\n    \/\/ that you currently know about have any thread plans.\n    Mutex::Locker locker(m_threads_mutex);\n\n    collection::iterator pos, end = m_threads.end();\n    for (pos = m_threads.begin(); pos != end; ++pos)\n        (*pos)->DiscardThreadPlans (true);\n\n}\n\nbool\nThreadList::WillResume ()\n{\n    \/\/ Run through the threads and perform their momentary actions.\n    \/\/ But we only do this for threads that are running, user suspended\n    \/\/ threads stay where they are.\n    bool success = true;\n\n    Mutex::Locker locker(m_threads_mutex);\n    m_process->UpdateThreadListIfNeeded();\n\n    collection::iterator pos, end = m_threads.end();\n\n    \/\/ See if any thread wants to run stopping others.  If it does, then we won't\n    \/\/ setup the other threads for resume, since they aren't going to get a chance\n    \/\/ to run.  This is necessary because the SetupForResume might add \"StopOthers\"\n    \/\/ plans which would then get to be part of the who-gets-to-run negotiation, but\n    \/\/ they're coming in after the fact, and the threads that are already set up should\n    \/\/ take priority.\n    \n    bool wants_solo_run = false;\n    \n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        if ((*pos)->GetResumeState() != eStateSuspended &&\n                 (*pos)->GetCurrentPlan()->StopOthers())\n        {\n            wants_solo_run = true;\n            break;\n        }\n    }   \n\n    \n    \/\/ Give all the threads that are likely to run a last chance to set up their state before we\n    \/\/ negotiate who is actually going to get a chance to run...\n    \/\/ Don't set to resume suspended threads, and if any thread wanted to stop others, only\n    \/\/ call setup on the threads that request StopOthers...\n    \n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        if ((*pos)->GetResumeState() != eStateSuspended\n            && (!wants_solo_run || (*pos)->GetCurrentPlan()->StopOthers()))\n        {\n            (*pos)->SetupForResume ();\n        }\n    }\n\n    \/\/ Now go through the threads and see if any thread wants to run just itself.\n    \/\/ if so then pick one and run it.\n    \n    ThreadList run_me_only_list (m_process);\n    \n    run_me_only_list.SetStopID(m_process->GetStopID());\n\n    ThreadSP immediate_thread_sp;\n    bool run_only_current_thread = false;\n\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        ThreadSP thread_sp(*pos);\n        if (thread_sp->GetCurrentPlan()->IsImmediate())\n        {\n            \/\/ We first do all the immediate plans, so if we find one, set\n            \/\/ immediate_thread_sp and break out, and we'll pick it up first thing\n            \/\/ when we're negotiating which threads get to run.\n            immediate_thread_sp = thread_sp;\n            break;\n        }\n        else if (thread_sp->GetResumeState() != eStateSuspended &&\n                 thread_sp->GetCurrentPlan()->StopOthers())\n        {\n            \/\/ You can't say \"stop others\" and also want yourself to be suspended.\n            assert (thread_sp->GetCurrentPlan()->RunState() != eStateSuspended);\n\n            if (thread_sp == GetCurrentThread())\n            {\n                run_only_current_thread = true;\n                run_me_only_list.Clear();\n                run_me_only_list.AddThread (thread_sp);\n                break;\n            }\n\n            run_me_only_list.AddThread (thread_sp);\n        }\n\n    }\n\n    if (immediate_thread_sp)\n    {\n        for (pos = m_threads.begin(); pos != end; ++pos)\n        {\n            ThreadSP thread_sp(*pos);\n            if (thread_sp.get() == immediate_thread_sp.get())\n                thread_sp->WillResume(thread_sp->GetCurrentPlan()->RunState());\n            else\n                thread_sp->WillResume (eStateSuspended);\n        }\n    }\n    else if (run_me_only_list.GetSize (false) == 0)\n    {\n        \/\/ Everybody runs as they wish:\n        for (pos = m_threads.begin(); pos != end; ++pos)\n        {\n            ThreadSP thread_sp(*pos);\n            thread_sp->WillResume(thread_sp->GetCurrentPlan()->RunState());\n        }\n    }\n    else\n    {\n        ThreadSP thread_to_run;\n\n        if (run_only_current_thread)\n        {\n            thread_to_run = GetCurrentThread();\n        }\n        else if (run_me_only_list.GetSize (false) == 1)\n        {\n            thread_to_run = run_me_only_list.GetThreadAtIndex (0);\n        }\n        else\n        {\n            int random_thread = (int)\n                    ((run_me_only_list.GetSize (false) * (double) rand ()) \/ (RAND_MAX + 1.0));\n            thread_to_run = run_me_only_list.GetThreadAtIndex (random_thread);\n        }\n\n        for (pos = m_threads.begin(); pos != end; ++pos)\n        {\n            ThreadSP thread_sp(*pos);\n            if (thread_sp == thread_to_run)\n                thread_sp->WillResume(thread_sp->GetCurrentPlan()->RunState());\n            else\n                thread_sp->WillResume (eStateSuspended);\n        }\n    }\n\n    return success;\n}\n\nvoid\nThreadList::DidResume ()\n{\n    collection::iterator pos, end = m_threads.end();\n    for (pos = m_threads.begin(); pos != end; ++pos)\n    {\n        \/\/ Don't clear out threads that aren't going to get a chance to run, rather\n        \/\/ leave their state for the next time around.\n        ThreadSP thread_sp(*pos);\n        if (thread_sp->GetResumeState() != eStateSuspended)\n            thread_sp->DidResume ();\n    }\n}\n\nThreadSP\nThreadList::GetCurrentThread ()\n{\n    Mutex::Locker locker(m_threads_mutex);\n    return FindThreadByID(m_current_tid);\n}\n\nbool\nThreadList::SetCurrentThreadByID (lldb::tid_t tid)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    if  (FindThreadByID(tid).get())\n        m_current_tid = tid;\n    else\n        m_current_tid = LLDB_INVALID_THREAD_ID;\n\n    return m_current_tid != LLDB_INVALID_THREAD_ID;\n}\n\nbool\nThreadList::SetCurrentThreadByIndexID (uint32_t index_id)\n{\n    Mutex::Locker locker(m_threads_mutex);\n    ThreadSP thread_sp (FindThreadByIndexID(index_id));\n    if  (thread_sp.get())\n        m_current_tid = thread_sp->GetID();\n    else\n        m_current_tid = LLDB_INVALID_THREAD_ID;\n\n    return m_current_tid != LLDB_INVALID_THREAD_ID;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \tLoop.cpp\n * \n * \tImplementation of the event loop\n * \n * \t@copyright 2014 Copernica BV\n *\/\n\n\/**\n *  Dependencies\n *\/\n#include <iostream>\n#include \"loop.h\"\n#include \"timeoutwatcher.h\"\n#include \"intervalwatcher.h\"\n#include \"readwatcher.h\"\n#include \"writewatcher.h\"\n#include \"synchronizewatcher.h\"\n\n\/**\n * Set up namespace\n *\/\nnamespace ReactPhp {\n\n\/**\n * Function which is called the moment a file descriptor becomes readable\n * @param\tfd\t\tThe file descriptor\n * @param\tcallback\tFunction that is called when the file descriptor is readable\n * @return\tobject\t\tReadWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onReadable(Php::Parameters &parameters)\n{\n\t\/\/ the filedescriptor and the callback function\n\tint fd = parameters[0];\n\tPhp::Value callback = parameters[1];\n\t\n\t\/\/call the Loop::onReadable function\n\tauto reader = _loop.onReadable(fd, [callback]() {\n\t\t\n\t\t\/\/call the PHP callback\n\t\tcallback();\n\t});\n\t\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\ReadWatcher\", new ReadWatcher(reader));\n}\n\n\/**\n * Function which is called the moment a file descriptor becomes writable\n * @param\tfd\t\tThe file descriptor\n * @param\tcallback\tFunction that is called when the file descriptor is readable\n * @return\tobject\t\tWriteWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onWritable(Php::Parameters &parameters)\n{\n\t\/\/ the filedescriptor and the callback function\n\tint fd = parameters[0];\n\tPhp::Value callback = parameters[1];\n\t\n\t\/\/call the Loop::onReadable function\n\tauto writer = _loop.onWritable(fd, [callback]() {\n\t\t\n\t\t\/\/call the PHP callback\n\t\tcallback();\n\t});\n\t\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\WriteWatcher\", new WriteWatcher(writer));\n}\n\n\/**\n * Register a synchronize function\n * @param\tcallback\tFunction that is called when the file descriptor is readable\n * @return\tobject\t\tSynchronizeWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onSynchronize(Php::Parameters &parameters)\n{\n\t\/\/ the callback function\n\tPhp::Value callback = parameters[0];\n\t\n\t\/\/call the Loop::onReadable function\n\tauto synchronizer = _loop.onSynchronize([callback]() {\n\t\t\n\t\t\/\/call the PHP callback\n\t\tcallback();\n\t});\n\t\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\SynchronizeWatcher\", new SynchronizeWatcher(synchronizer));\n}\n\n\/**\n *  Run a timeout after a while\n *  @param\ttimeout\t\tNumber of seconds (as a float) to wait for the timer to be called\n *  @param\tcallback\tFunction that is called when timer expires\n *  @return\tobject\t\tTimeoutWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onTimeout(Php::Parameters &parameters)\n{\n\t\/\/ the timeout, and the callback function\n\tReact::Timestamp timeout = parameters[0];\n\tPhp::Value callback = parameters[1];\n\t\n\t\/\/ call the Loop::onTimeout function\n\tauto timer = _loop.onTimeout(timeout, [callback]() {\n\t\t\n\t\t\/\/ call the PHP callback\n\t\tcallback();\n\t});\n\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\TimeoutWatcher\", new TimeoutWatcher(timer));\n}\n\n\/**\n *  Call a callback with a certain interval\n *  @param\tinterval\tNumber of seconds for each iteration\n *  @param\tcallback\tFunction that is called every timeout seconds\n *  @return\tobject\t\tIntervalWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onInterval(Php::Parameters &parameters)\n{\n\t\/\/ the interval, and the callback function\n\tReact::Timestamp interval = parameters[0];\n\tPhp::Value callback = parameters[1];\n\t\n\t\/\/ call the Loop::onInterval function\n\tauto watcher = _loop.onInterval(interval, interval, [callback]() {\n\t\t\n\t\t\/\/ call the PHP callback\n\t\tcallback();\n\t});\n\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\IntervalWatcher\", new IntervalWatcher(watcher));\n}\n\n\/**\n *  End of namespace\n *\/\n}\n\n<commit_msg>Event Loop implementation<commit_after>\/**\n *  Loop.cpp\n * \n *  Implementation of the event loop\n * \n *  @copyright 2014 Copernica BV\n *\/\n\n\/**\n *  Dependencies\n *\/\n#include <iostream>\n#include \"loop.h\"\n#include \"timeoutwatcher.h\"\n#include \"intervalwatcher.h\"\n#include \"readwatcher.h\"\n#include \"writewatcher.h\"\n#include \"synchronizewatcher.h\"\n\n\/**\n *  Set up namespace\n *\/\nnamespace ReactPhp {\n\n\/**\n * Function which is called the moment a file descriptor becomes readable\n * @param\tfd\t\tThe file descriptor\n * @param\tcallback\tFunction that is called when the file descriptor is readable\n * @return\tobject\t\tReadWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onReadable(Php::Parameters &parameters)\n{\n\t\/\/ the filedescriptor and the callback function\n\tint fd = parameters[0];\n\tPhp::Value callback = parameters[1];\n\t\n\t\/\/call the Loop::onReadable function\n\tauto reader = _loop.onReadable(fd, [callback]() {\n\t\t\n\t\t\/\/call the PHP callback\n\t\tcallback();\n\t});\n\t\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\ReadWatcher\", new ReadWatcher(reader));\n}\n\n\/**\n * Function which is called the moment a file descriptor becomes writable\n * @param\tfd\t\tThe file descriptor\n * @param\tcallback\tFunction that is called when the file descriptor is readable\n * @return\tobject\t\tWriteWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onWritable(Php::Parameters &parameters)\n{\n\t\/\/ the filedescriptor and the callback function\n\tint fd = parameters[0];\n\tPhp::Value callback = parameters[1];\n\t\n\t\/\/call the Loop::onReadable function\n\tauto writer = _loop.onWritable(fd, [callback]() {\n\t\t\n\t\t\/\/call the PHP callback\n\t\tcallback();\n\t});\n\t\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\WriteWatcher\", new WriteWatcher(writer));\n}\n\n\/**\n *  Register a synchronize function\n *  @param\tcallback\tFunction that is called when the file descriptor is readable\n *  @return\tobject\t\tSynchronizeWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onSynchronize(Php::Parameters &parameters)\n{\n\t\/\/ the callback function\n\tPhp::Value callback = parameters[0];\n\t\n\t\/\/call the Loop::onReadable function\n\tauto synchronizer = _loop.onSynchronize([callback]() {\n\t\t\n\t\t\/\/call the PHP callback\n\t\tcallback();\n\t});\n\t\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\SynchronizeWatcher\", new SynchronizeWatcher(synchronizer));\n}\n\n\/**\n *  Run a timeout after a while\n *  @param\ttimeout\t\tNumber of seconds (as a float) to wait for the timer to be called\n *  @param\tcallback\tFunction that is called when timer expires\n *  @return\tobject\t\tTimeoutWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onTimeout(Php::Parameters &parameters)\n{\n\t\/\/ the timeout, and the callback function\n\tReact::Timestamp timeout = parameters[0];\n\tPhp::Value callback = parameters[1];\n\t\n\t\/\/ call the Loop::onTimeout function\n\tauto timer = _loop.onTimeout(timeout, [callback]() {\n\t\t\n\t\t\/\/ call the PHP callback\n\t\tcallback();\n\t});\n\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\TimeoutWatcher\", new TimeoutWatcher(timer));\n}\n\n\/**\n *  Call a callback with a certain interval\n *  @param\tinterval\tNumber of seconds for each iteration\n *  @param\tcallback\tFunction that is called every timeout seconds\n *  @return\tobject\t\tIntervalWatcher object that can be used for cancelling the timer\n *\/\nPhp::Value Loop::onInterval(Php::Parameters &parameters)\n{\n\t\/\/ the interval, and the callback function\n\tReact::Timestamp interval = parameters[0];\n\tPhp::Value callback = parameters[1];\n\t\n\t\/\/ call the Loop::onInterval function\n\tauto watcher = _loop.onInterval(interval, interval, [callback]() {\n\t\t\n\t\t\/\/ call the PHP callback\n\t\tcallback();\n\t});\n\n\t\/\/ create a new PHP object, and return that\n\treturn Php::Object(\"Async\\\\IntervalWatcher\", new IntervalWatcher(watcher));\n}\n\n\/**\n *  End of namespace\n *\/\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: message.C,v 1.23 2004\/09\/14 13:43:15 amoll Exp $\n\n#include <BALL\/VIEW\/KERNEL\/message.h>\n#include <BALL\/COMMON\/rtti.h>\n\nusing namespace std;\n\nnamespace BALL\n{\n\tnamespace VIEW\n\t{\n\nMessage::Message()\n\tthrow()\n\t: connection_object_(0),\n\t\tdeletable_(true)\n{\n}\n\nMessage::Message(const Message& message)\n\tthrow()\n\t: connection_object_(message.connection_object_),\n\t\tdeletable_(message.deletable_)\n{\n}\n\nMessage::~Message()\n\tthrow()\n{\n}\n\nCompositeMessage::CompositeMessage()\n\tthrow()\n\t: Message(),\n\t\ttype_(UNDEFINED),\n\t\tcomposite_(0),\n\t\tcomposite_name_(),\n\t\tupdate_representations_(true)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new CompositeMessage \" << type_ << std::endl;\t\t\n\t#endif\n}\n\nCompositeMessage::CompositeMessage(const Composite& composite, CompositeMessageType type, bool update_representations)\n\tthrow()\n\t: Message(),\n\t\ttype_(type),\n\t\tcomposite_((Composite*)&composite),\n\t\tcomposite_name_(),\n\t\tupdate_representations_(update_representations)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new CompositeMessage \" << type_ << std::endl;\t\t\n\t#endif\n}\n\nCompositeMessage::CompositeMessage(const CompositeMessage& message)\n\tthrow()\n\t: Message(message),\n\t\ttype_(message.type_),\n\t\tcomposite_(message.composite_),\n\t\tcomposite_name_(message.composite_name_),\n\t\tupdate_representations_(message.update_representations_)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new CompositeMessage \" << type_ << std::endl;\t\t\n\t#endif\n}\n\nCompositeMessage::~CompositeMessage()\n\tthrow()\n{\n}\n\nSceneMessage::SceneMessage(SceneMessageType type)\n\tthrow()\n\t: Message(),\n\t\ttype_(type),\n\t\tstage_()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new SceneMessage\" << std::endl;\t\t\n\t#endif\n}\n\nSceneMessage::SceneMessage(const SceneMessage& message)\n\tthrow()\n\t: Message(message),\n\t\ttype_(message.type_),\n\t\tstage_(message.stage_)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new SceneMessage\" << type_ << std::endl;\t\t\n\t#endif\n}\n\nSceneMessage::~SceneMessage()\n\tthrow()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"Destructing object \" << (void *)this \n\t\t\t\t\t\t\t\t<< \" of class \" << RTTI::getName<SceneMessage>() << endl;\n\t#endif \n}\n\nvoid SceneMessage::setType(SceneMessageType type)\n\tthrow() \n{ \n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"SceneMessage::setType \" << type << std::endl;\n\t#endif \n\n\ttype_ = type;\n}\n\n\nGenericSelectionMessage::GenericSelectionMessage()\n\tthrow()\n\t: Message(),\n\t\tselection_()\n{\n}\n\nGenericSelectionMessage::GenericSelectionMessage(const GenericSelectionMessage& message)\n\tthrow()\n\t: Message(message),\n\t\tselection_(message.selection_)\n{\n}\n\nGenericSelectionMessage::~GenericSelectionMessage()\n\tthrow()\n{\n}\n\n\nGeometricObjectSelectionMessage::GeometricObjectSelectionMessage()\n\tthrow()\n\t: Message()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new GeometricObjectSelectionMessage\" << std::endl;\t\t\n\t#endif\n}\n\nGeometricObjectSelectionMessage::~GeometricObjectSelectionMessage()\n\tthrow()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"Destructing object \" << (void *)this \n\t\t\t\t\t\t\t\t<< \" of class \" << RTTI::getName<GeometricObjectSelectionMessage>() << endl;\n\t#endif \n}\n\nControlSelectionMessage::ControlSelectionMessage()\n\tthrow()\n\t: GenericSelectionMessage()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new ControlSelectionMessage\" << std::endl;\n\t#endif\n}\n\nNewSelectionMessage::NewSelectionMessage() \n\tthrow()\n\t: Message(),\n\t\topen_(false)\n{ \n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new NewSelectionMessage\" << std::endl;\n\t#endif\n}\n\nRepresentationMessage::RepresentationMessage()\n\tthrow()\n\t: representation_(0),\n\t\ttype_(UNDEFINED)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RepresentationMessage\" << std::endl;\t\t\n\t#endif\n}\n\nRepresentationMessage::RepresentationMessage(Representation& rep, RepresentationMessageType type)\n\tthrow()\n\t: representation_(&rep),\n\t\ttype_(type)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RepresentationMessage\" << std::endl;\t\t\n\t#endif\n}\n\nvoid RepresentationMessage::setType(RepresentationMessageType type)\n\tthrow() \n{ \n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"RepresentationMessage::setType \" << type << std::endl;\n\t#endif \n\n\ttype_ = type;\n}\n\nMolecularTaskMessage::MolecularTaskMessage(MolecularTaskMessageType type)\n\tthrow()\n\t: type_(type)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new MolecularTaskMessage\" << std::endl;\n\t#endif \n}\n\nvoid MolecularTaskMessage::setType(MolecularTaskMessageType type)\n\tthrow() \n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"MolecularTaskMessage::setType \" << type << std::endl;\n\t#endif \n\n\ttype_ = type;\n}\n\n\nNewTrajectoryMessage::NewTrajectoryMessage()\n\tthrow()\n\t: CompositeMessage(),\n\t\tfile_(0)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new NewTrajectoryMessage\" << std::endl;\t\t\n\t#endif\n}\n\n\/\/ ================ Regular Data Messages ===========================\nRegularDataMessage::RegularDataMessage()\n\tthrow()\n\t: CompositeMessage()\n{\n\tsetType((CompositeMessageType)UNDEFINED);\n}\n\n\nRegularData1DMessage::RegularData1DMessage(RegularDataMessageType type) \n\tthrow()\n\t: RegularDataMessage(),\n\t\tdata_(0)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RegularData1DMessage\" << std::endl;\t\t\n\t#endif\n\tsetType((CompositeMessageType)type);\n}\n\nRegularData2DMessage::RegularData2DMessage(RegularDataMessageType type) \n\tthrow()\n\t: RegularDataMessage(),\n\t\tdata_(0)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RegularData2DMessage\" << std::endl;\t\t\n\t#endif\n\tsetType((CompositeMessageType)type);\n}\n\n\nRegularData3DMessage::RegularData3DMessage(RegularDataMessageType type) \n\tthrow()\n\t: RegularDataMessage(),\n\t\tdata_(0)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RegularData3DMessage\" << std::endl;\t\t\n\t#endif\n\tsetType((CompositeMessageType)type);\n}\n\n\nCreateRepresentationMessage::CreateRepresentationMessage()\n\tthrow() \n\t: Message(), \n\t\tcomposites_(),\n\t\tmodel_type_(MODEL_UNKNOWN),\n\t\tcoloring_method_(COLORING_UNKNOWN)\n{\n}\n\nCreateRepresentationMessage::CreateRepresentationMessage(const List<Composite*>& composites, \n\t\tModelType model_type, ColoringMethod coloring_method)\n \tthrow() \n\t: Message(),\n\t\tcomposites_(composites), \n\t\tmodel_type_(model_type),\n\t\tcoloring_method_(coloring_method)\n{\n}\n\nTransformationMessage::TransformationMessage()\n\tthrow()\n\t: Message(),\n\t\tmatrix_()\n{\n}\n\nTransformationMessage::TransformationMessage(const Matrix4x4& m)\n\tthrow()\n\t: Message(),\n\t\tmatrix_(m)\n{\n}\n\n#\tifdef BALL_NO_INLINE_FUNCTIONS\n#\t\tinclude <BALL\/VIEW\/KERNEL\/message.iC>\n#\tendif \n\n} } \/\/ namespaces\n<commit_msg>no message<commit_after>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: message.C,v 1.24 2004\/11\/13 10:09:12 amoll Exp $\n\n#include <BALL\/VIEW\/KERNEL\/message.h>\n#include <BALL\/COMMON\/rtti.h>\n\nusing namespace std;\n\n\/\/ #define BALL_VIEW_DEBUG\n\nnamespace BALL\n{\n\tnamespace VIEW\n\t{\n\nMessage::Message()\n\tthrow()\n\t: connection_object_(0),\n\t\tdeletable_(true)\n{\n}\n\nMessage::Message(const Message& message)\n\tthrow()\n\t: connection_object_(message.connection_object_),\n\t\tdeletable_(message.deletable_)\n{\n}\n\nMessage::~Message()\n\tthrow()\n{\n}\n\nCompositeMessage::CompositeMessage()\n\tthrow()\n\t: Message(),\n\t\ttype_(UNDEFINED),\n\t\tcomposite_(0),\n\t\tcomposite_name_(),\n\t\tupdate_representations_(true)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new CompositeMessage \" << type_ << std::endl;\t\t\n\t#endif\n}\n\nCompositeMessage::CompositeMessage(const Composite& composite, CompositeMessageType type, bool update_representations)\n\tthrow()\n\t: Message(),\n\t\ttype_(type),\n\t\tcomposite_((Composite*)&composite),\n\t\tcomposite_name_(),\n\t\tupdate_representations_(update_representations)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new CompositeMessage \" << type_ << std::endl;\t\t\n\t#endif\n}\n\nCompositeMessage::CompositeMessage(const CompositeMessage& message)\n\tthrow()\n\t: Message(message),\n\t\ttype_(message.type_),\n\t\tcomposite_(message.composite_),\n\t\tcomposite_name_(message.composite_name_),\n\t\tupdate_representations_(message.update_representations_)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new CompositeMessage \" << type_ << std::endl;\t\t\n\t#endif\n}\n\nCompositeMessage::~CompositeMessage()\n\tthrow()\n{\n}\n\nSceneMessage::SceneMessage(SceneMessageType type)\n\tthrow()\n\t: Message(),\n\t\ttype_(type),\n\t\tstage_()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new SceneMessage\" << std::endl;\t\t\n\t#endif\n}\n\nSceneMessage::SceneMessage(const SceneMessage& message)\n\tthrow()\n\t: Message(message),\n\t\ttype_(message.type_),\n\t\tstage_(message.stage_)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new SceneMessage\" << type_ << std::endl;\t\t\n\t#endif\n}\n\nSceneMessage::~SceneMessage()\n\tthrow()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"Destructing object \" << (void *)this \n\t\t\t\t\t\t\t\t<< \" of class \" << RTTI::getName<SceneMessage>() << endl;\n\t#endif \n}\n\nvoid SceneMessage::setType(SceneMessageType type)\n\tthrow() \n{ \n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"SceneMessage::setType \" << type << std::endl;\n\t#endif \n\n\ttype_ = type;\n}\n\n\nGenericSelectionMessage::GenericSelectionMessage()\n\tthrow()\n\t: Message(),\n\t\tselection_()\n{\n}\n\nGenericSelectionMessage::GenericSelectionMessage(const GenericSelectionMessage& message)\n\tthrow()\n\t: Message(message),\n\t\tselection_(message.selection_)\n{\n}\n\nGenericSelectionMessage::~GenericSelectionMessage()\n\tthrow()\n{\n}\n\n\nGeometricObjectSelectionMessage::GeometricObjectSelectionMessage()\n\tthrow()\n\t: Message()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new GeometricObjectSelectionMessage\" << std::endl;\t\t\n\t#endif\n}\n\nGeometricObjectSelectionMessage::~GeometricObjectSelectionMessage()\n\tthrow()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"Destructing object \" << (void *)this \n\t\t\t\t\t\t\t\t<< \" of class \" << RTTI::getName<GeometricObjectSelectionMessage>() << endl;\n\t#endif \n}\n\nControlSelectionMessage::ControlSelectionMessage()\n\tthrow()\n\t: GenericSelectionMessage()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new ControlSelectionMessage\" << std::endl;\n\t#endif\n}\n\nNewSelectionMessage::NewSelectionMessage() \n\tthrow()\n\t: Message(),\n\t\topen_(false)\n{ \n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new NewSelectionMessage\" << std::endl;\n\t#endif\n}\n\nRepresentationMessage::RepresentationMessage()\n\tthrow()\n\t: representation_(0),\n\t\ttype_(UNDEFINED)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RepresentationMessage\" << std::endl;\t\t\n\t#endif\n}\n\nRepresentationMessage::RepresentationMessage(Representation& rep, RepresentationMessageType type)\n\tthrow()\n\t: representation_(&rep),\n\t\ttype_(type)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RepresentationMessage\" << std::endl;\t\t\n\t#endif\n}\n\nvoid RepresentationMessage::setType(RepresentationMessageType type)\n\tthrow() \n{ \n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"RepresentationMessage::setType \" << type << std::endl;\n\t#endif \n\n\ttype_ = type;\n}\n\nMolecularTaskMessage::MolecularTaskMessage(MolecularTaskMessageType type)\n\tthrow()\n\t: type_(type)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new MolecularTaskMessage\" << std::endl;\n\t#endif \n}\n\nvoid MolecularTaskMessage::setType(MolecularTaskMessageType type)\n\tthrow() \n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"MolecularTaskMessage::setType \" << type << std::endl;\n\t#endif \n\n\ttype_ = type;\n}\n\n\nNewTrajectoryMessage::NewTrajectoryMessage()\n\tthrow()\n\t: CompositeMessage(),\n\t\tfile_(0)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new NewTrajectoryMessage\" << std::endl;\t\t\n\t#endif\n}\n\n\/\/ ================ Regular Data Messages ===========================\nRegularDataMessage::RegularDataMessage()\n\tthrow()\n\t: CompositeMessage()\n{\n\tsetType((CompositeMessageType)UNDEFINED);\n}\n\n\nRegularData1DMessage::RegularData1DMessage(RegularDataMessageType type) \n\tthrow()\n\t: RegularDataMessage(),\n\t\tdata_(0)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RegularData1DMessage\" << std::endl;\t\t\n\t#endif\n\tsetType((CompositeMessageType)type);\n}\n\nRegularData2DMessage::RegularData2DMessage(RegularDataMessageType type) \n\tthrow()\n\t: RegularDataMessage(),\n\t\tdata_(0)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RegularData2DMessage\" << std::endl;\t\t\n\t#endif\n\tsetType((CompositeMessageType)type);\n}\n\n\nRegularData3DMessage::RegularData3DMessage(RegularDataMessageType type) \n\tthrow()\n\t: RegularDataMessage(),\n\t\tdata_(0)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new RegularData3DMessage\" << std::endl;\t\t\n\t#endif\n\tsetType((CompositeMessageType)type);\n}\n\n\nCreateRepresentationMessage::CreateRepresentationMessage()\n\tthrow() \n\t: Message(), \n\t\tcomposites_(),\n\t\tmodel_type_(MODEL_UNKNOWN),\n\t\tcoloring_method_(COLORING_UNKNOWN)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new CreateRepresentationMessage\" << std::endl;\t\t\n\t#endif\n}\n\nCreateRepresentationMessage::CreateRepresentationMessage(const List<Composite*>& composites, \n\t\tModelType model_type, ColoringMethod coloring_method)\n \tthrow() \n\t: Message(),\n\t\tcomposites_(composites), \n\t\tmodel_type_(model_type),\n\t\tcoloring_method_(coloring_method)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new CreateRepresentationMessage\" << std::endl;\t\t\n\t#endif\n}\n\nTransformationMessage::TransformationMessage()\n\tthrow()\n\t: Message(),\n\t\tmatrix_()\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new TransformationMessage\" << std::endl;\t\t\n\t#endif\n}\n\nTransformationMessage::TransformationMessage(const Matrix4x4& m)\n\tthrow()\n\t: Message(),\n\t\tmatrix_(m)\n{\n\t#ifdef BALL_VIEW_DEBUG\n\t\tLog.error() << \"new TransformationMessage\" << std::endl;\t\t\n\t#endif\n}\n\n#\tifdef BALL_NO_INLINE_FUNCTIONS\n#\t\tinclude <BALL\/VIEW\/KERNEL\/message.iC>\n#\tendif \n\n} } \/\/ namespaces\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2020 The TensorFlow Runtime 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\/\/===- event_manager_test.cc ------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ Unit test for GPU EventManager\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"tfrt\/gpu\/event_manager.h\"\n\n#include <math.h>\n\n#include <cstring>\n#include <ostream>\n\n#include \"benchmark\/benchmark.h\"\n#include \"gtest\/gtest.h\"\n#include \"tfrt\/cpp_tests\/error_util.h\"\n#include \"tfrt\/gpu\/stream\/stream_wrapper.h\"\n#include \"tfrt\/support\/latch.h\"\n#include \"tfrt\/support\/logging.h\"\n#include \"tfrt\/support\/thread_annotations.h\"\n\nnamespace tfrt {\nnamespace gpu {\nnamespace stream {\n\nstruct StreamAndBuffers {\n  StreamAndBuffers(CurrentContext current, size_t size) : size(size) {\n    TFRT_ASSIGN_OR_DIE(stream, StreamCreate(current, StreamFlags::DEFAULT));\n    TFRT_ASSIGN_OR_DIE(gpu_buf, MemAlloc(current, size));\n    TFRT_ASSIGN_OR_DIE(host_buf_src,\n                       MemHostAlloc(current, size, MemHostAllocFlags::DEFAULT));\n    TFRT_ASSIGN_OR_DIE(host_buf_dst,\n                       MemHostAlloc(current, size, MemHostAllocFlags::DEFAULT));\n    std::memset(host_buf_src.get().raw(), 'z', size);\n    std::memset(host_buf_dst.get().raw(), 0, size);\n  }\n\n  void H2D(CurrentContext current, Event event) {\n    EXPECT_TRUE(\n        IsSuccess(MemcpyAsync(current, \/*dst=*\/gpu_buf.get(),\n                              \/*src=*\/host_buf_src.get(), size, stream.get())));\n    EXPECT_TRUE(IsSuccess(EventRecord(event, stream.get())));\n  }\n\n  void D2H(CurrentContext current, Event event) {\n    EXPECT_TRUE(\n        IsSuccess(MemcpyAsync(current, \/*dst=*\/host_buf_dst.get(),\n                              \/*src=*\/gpu_buf.get(), size, stream.get())));\n    EXPECT_TRUE(IsSuccess(EventRecord(event, stream.get())));\n  }\n\n  void CheckBuffersEqual() {\n    EXPECT_EQ(0, std::memcmp(host_buf_dst.get().raw(), host_buf_src.get().raw(),\n                             size));\n  }\n\n  void ResetHostBuffers() {\n    std::memset(host_buf_src.get().raw(), 'z', size);\n    std::memset(host_buf_dst.get().raw(), 0, size);\n  }\n\n  size_t size;\n  OwningStream stream;\n  DeviceMemory<void> gpu_buf;\n  HostMemory<void> host_buf_src;\n  HostMemory<void> host_buf_dst;\n};\n\nclass EventManagerTest : public ::testing::Test {\n protected:\n  EventManagerTest() : platform_(Platform::CUDA) {}\n  void SetUp() override {\n    ASSERT_TRUE(IsSuccess(Init(platform_)));\n    TFRT_ASSERT_AND_ASSIGN(auto count, DeviceGetCount(platform_));\n    ASSERT_GT(count, 0);\n    TFRT_ASSERT_AND_ASSIGN(auto device, DeviceGet(platform_, 0));\n    TFRT_ASSERT_AND_ASSIGN(context_, DevicePrimaryCtxRetain(device));\n  }\n\n  \/\/ Use 32 MB for copies so that they usually don't complete immediately.\n  const size_t kBufferSize = 32 << 20;\n\n  Platform platform_;\n  OwningContext context_;\n};\n\nTEST_F(EventManagerTest, TestOneStreamOneEvent) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb.H2D(current, event.get());\n  sb.D2H(current, event.get());\n\n  latch latch(1);\n  manager.Synchronize(event.get(), sb.stream.get(),\n                      [&latch, &sb](llvm::Error error) {\n                        sb.CheckBuffersEqual();\n                        latch.count_down();\n                      });\n  latch.wait();\n}\n\nTEST_F(EventManagerTest, TestOneStreamTwoEvents) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event1,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event2,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb.H2D(current, event1.get());\n  sb.D2H(current, event2.get());\n\n  latch latch(2);\n  manager.Synchronize(event1.get(), sb.stream.get(),\n                      [&latch](llvm::Error error) { latch.count_down(); });\n  manager.Synchronize(event2.get(), sb.stream.get(),\n                      [&latch, &sb](llvm::Error error) {\n                        sb.CheckBuffersEqual();\n                        latch.count_down();\n                      });\n  latch.wait();\n}\n\nTEST_F(EventManagerTest, TestOneStreamTwoEventsOneByOne) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb(current, kBufferSize);\n  {\n    TFRT_ASSERT_AND_ASSIGN(OwningEvent event,\n                           EventCreate(current, EventFlags::DISABLE_TIMING));\n\n    sb.H2D(current, event.get());\n    sb.D2H(current, event.get());\n\n    latch latch(1);\n    manager.Synchronize(event.get(), sb.stream.get(),\n                        [&latch, &sb](llvm::Error error) {\n                          sb.CheckBuffersEqual();\n                          latch.count_down();\n                        });\n    latch.wait();\n  }\n  {\n    sb.ResetHostBuffers();\n    TFRT_ASSERT_AND_ASSIGN(OwningEvent event,\n                           EventCreate(current, EventFlags::DISABLE_TIMING));\n\n    sb.H2D(current, event.get());\n    sb.D2H(current, event.get());\n\n    latch latch(1);\n    manager.Synchronize(event.get(), sb.stream.get(),\n                        [&latch, &sb](llvm::Error error) {\n                          sb.CheckBuffersEqual();\n                          latch.count_down();\n                        });\n    latch.wait();\n  }\n}\n\nTEST_F(EventManagerTest, TestTwoStreamsTwoEvents) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb1(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event1,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  StreamAndBuffers sb2(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event2,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb1.H2D(current, event1.get());\n  sb2.H2D(current, event2.get());\n  sb1.D2H(current, event1.get());\n  sb2.D2H(current, event2.get());\n\n  latch latch(2);\n  manager.Synchronize(event1.get(), sb1.stream.get(),\n                      [&latch, &sb1](llvm::Error error) {\n                        sb1.CheckBuffersEqual();\n                        latch.count_down();\n                      });\n  manager.Synchronize(event2.get(), sb2.stream.get(),\n                      [&latch, &sb2](llvm::Error error) {\n                        sb2.CheckBuffersEqual();\n                        latch.count_down();\n                      });\n  latch.wait();\n}\n\nTEST_F(EventManagerTest, TestStealing) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb1(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event1,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb1.H2D(current, event1.get());\n  sb1.D2H(current, event1.get());\n\n  latch latch1(1);\n  manager.Synchronize(event1.get(), sb1.stream.get(),\n                      [&latch1, &sb1](llvm::Error error) {\n                        sb1.CheckBuffersEqual();\n                        latch1.count_down();\n                      });\n  latch1.wait();\n\n  \/\/ stream in sb1 should be idle now. Synchronizing event with stream in\n  \/\/ sb2 should now steal the thread.\n\n  StreamAndBuffers sb2(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event2,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb2.H2D(current, event2.get());\n  sb2.D2H(current, event2.get());\n\n  latch latch2(1);\n  manager.Synchronize(event2.get(), sb2.stream.get(),\n                      [&latch2, &sb2](llvm::Error error) {\n                        sb2.CheckBuffersEqual();\n                        latch2.count_down();\n                      });\n  latch2.wait();\n}\n\nTEST_F(EventManagerTest, TestCallSynchronizeFromOnReached) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb1(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event1,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  StreamAndBuffers sb2(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event2,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb1.H2D(current, event1.get());\n  sb1.D2H(current, event1.get());\n  sb2.H2D(current, event2.get());\n  sb2.D2H(current, event2.get());\n\n  latch latch(2);\n  manager.Synchronize(\n      event1.get(), sb1.stream.get(),\n      [&latch, &sb1, &manager, &event2, &sb2](llvm::Error error) {\n        sb1.CheckBuffersEqual();\n        latch.count_down();\n        manager.Synchronize(event2.get(), sb2.stream.get(),\n                            [&latch, &sb2](llvm::Error error) {\n                              sb2.CheckBuffersEqual();\n                              latch.count_down();\n                            });\n      });\n  latch.wait();\n}\n\nvoid BM_EventEnqueue(benchmark::State& state) {\n  Platform platform(Platform::CUDA);\n  ASSERT_TRUE(IsSuccess(Init(platform)));\n  TFRT_ASSERT_AND_ASSIGN(auto count, DeviceGetCount(platform));\n  ASSERT_GT(count, 0);\n  TFRT_ASSERT_AND_ASSIGN(auto device, DeviceGet(platform, 0));\n  TFRT_ASSERT_AND_ASSIGN(auto context, DevicePrimaryCtxRetain(device));\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb(current, \/*size=*\/4);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  {\n    latch latch(1);\n    manager.Synchronize(event.get(), sb.stream.get(),\n                        [&latch](llvm::Error error) { latch.count_down(); });\n    latch.wait();\n  }\n  for (auto _ : state) {\n    manager.Synchronize(event.get(), sb.stream.get(), [](llvm::Error error) {\n      TFRT_LOG_IF(FATAL, error.success())\n          << \"Hit an error in calback: \" << error;\n    });\n  }\n  {\n    latch latch(1);\n    manager.Synchronize(event.get(), sb.stream.get(),\n                        [&latch](llvm::Error error) { latch.count_down(); });\n    latch.wait();\n  }\n}\nBENCHMARK(BM_EventEnqueue);\n\n}  \/\/ namespace stream\n}  \/\/ namespace gpu\n}  \/\/ namespace tfrt\n<commit_msg>Add non-trivial benchmark to event_manager_test.<commit_after>\/\/ Copyright 2020 The TensorFlow Runtime 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\/\/===- event_manager_test.cc ------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ Unit test for GPU EventManager\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"tfrt\/gpu\/event_manager.h\"\n\n#include <math.h>\n\n#include <cstring>\n#include <ostream>\n\n#include \"benchmark\/benchmark.h\"\n#include \"gtest\/gtest.h\"\n#include \"tfrt\/cpp_tests\/error_util.h\"\n#include \"tfrt\/gpu\/stream\/stream_wrapper.h\"\n#include \"tfrt\/support\/latch.h\"\n#include \"tfrt\/support\/logging.h\"\n#include \"tfrt\/support\/thread_annotations.h\"\n\nnamespace tfrt {\nnamespace gpu {\nnamespace stream {\n\nstruct StreamAndBuffers {\n  StreamAndBuffers(CurrentContext current, size_t size) : size(size) {\n    TFRT_ASSIGN_OR_DIE(stream, StreamCreate(current, StreamFlags::DEFAULT));\n    TFRT_ASSIGN_OR_DIE(gpu_buf, MemAlloc(current, size));\n    TFRT_ASSIGN_OR_DIE(host_buf_src,\n                       MemHostAlloc(current, size, MemHostAllocFlags::DEFAULT));\n    TFRT_ASSIGN_OR_DIE(host_buf_dst,\n                       MemHostAlloc(current, size, MemHostAllocFlags::DEFAULT));\n    std::memset(host_buf_src.get().raw(), 'z', size);\n    std::memset(host_buf_dst.get().raw(), 0, size);\n  }\n\n  void H2D(CurrentContext current, Event event) {\n    EXPECT_TRUE(\n        IsSuccess(MemcpyAsync(current, \/*dst=*\/gpu_buf.get(),\n                              \/*src=*\/host_buf_src.get(), size, stream.get())));\n    EXPECT_TRUE(IsSuccess(EventRecord(event, stream.get())));\n  }\n\n  void D2H(CurrentContext current, Event event) {\n    EXPECT_TRUE(\n        IsSuccess(MemcpyAsync(current, \/*dst=*\/host_buf_dst.get(),\n                              \/*src=*\/gpu_buf.get(), size, stream.get())));\n    EXPECT_TRUE(IsSuccess(EventRecord(event, stream.get())));\n  }\n\n  void CheckBuffersEqual() {\n    EXPECT_EQ(0, std::memcmp(host_buf_dst.get().raw(), host_buf_src.get().raw(),\n                             size));\n  }\n\n  void ResetHostBuffers() {\n    std::memset(host_buf_src.get().raw(), 'z', size);\n    std::memset(host_buf_dst.get().raw(), 0, size);\n  }\n\n  size_t size;\n  OwningStream stream;\n  DeviceMemory<void> gpu_buf;\n  HostMemory<void> host_buf_src;\n  HostMemory<void> host_buf_dst;\n};\n\nclass EventManagerTest : public ::testing::Test {\n protected:\n  EventManagerTest() : platform_(Platform::CUDA) {}\n  void SetUp() override {\n    ASSERT_TRUE(IsSuccess(Init(platform_)));\n    TFRT_ASSERT_AND_ASSIGN(auto count, DeviceGetCount(platform_));\n    ASSERT_GT(count, 0);\n    TFRT_ASSERT_AND_ASSIGN(auto device, DeviceGet(platform_, 0));\n    TFRT_ASSERT_AND_ASSIGN(context_, DevicePrimaryCtxRetain(device));\n  }\n\n  \/\/ Use 32 MB for copies so that they usually don't complete immediately.\n  const size_t kBufferSize = 32 << 20;\n\n  Platform platform_;\n  OwningContext context_;\n};\n\nTEST_F(EventManagerTest, TestOneStreamOneEvent) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb.H2D(current, event.get());\n  sb.D2H(current, event.get());\n\n  latch latch(1);\n  manager.Synchronize(event.get(), sb.stream.get(),\n                      [&latch, &sb](llvm::Error error) {\n                        sb.CheckBuffersEqual();\n                        latch.count_down();\n                      });\n  latch.wait();\n}\n\nTEST_F(EventManagerTest, TestOneStreamTwoEvents) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event1,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event2,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb.H2D(current, event1.get());\n  sb.D2H(current, event2.get());\n\n  latch latch(2);\n  manager.Synchronize(event1.get(), sb.stream.get(),\n                      [&latch](llvm::Error error) { latch.count_down(); });\n  manager.Synchronize(event2.get(), sb.stream.get(),\n                      [&latch, &sb](llvm::Error error) {\n                        sb.CheckBuffersEqual();\n                        latch.count_down();\n                      });\n  latch.wait();\n}\n\nTEST_F(EventManagerTest, TestOneStreamTwoEventsOneByOne) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb(current, kBufferSize);\n  {\n    TFRT_ASSERT_AND_ASSIGN(OwningEvent event,\n                           EventCreate(current, EventFlags::DISABLE_TIMING));\n\n    sb.H2D(current, event.get());\n    sb.D2H(current, event.get());\n\n    latch latch(1);\n    manager.Synchronize(event.get(), sb.stream.get(),\n                        [&latch, &sb](llvm::Error error) {\n                          sb.CheckBuffersEqual();\n                          latch.count_down();\n                        });\n    latch.wait();\n  }\n  {\n    sb.ResetHostBuffers();\n    TFRT_ASSERT_AND_ASSIGN(OwningEvent event,\n                           EventCreate(current, EventFlags::DISABLE_TIMING));\n\n    sb.H2D(current, event.get());\n    sb.D2H(current, event.get());\n\n    latch latch(1);\n    manager.Synchronize(event.get(), sb.stream.get(),\n                        [&latch, &sb](llvm::Error error) {\n                          sb.CheckBuffersEqual();\n                          latch.count_down();\n                        });\n    latch.wait();\n  }\n}\n\nTEST_F(EventManagerTest, TestTwoStreamsTwoEvents) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb1(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event1,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  StreamAndBuffers sb2(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event2,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb1.H2D(current, event1.get());\n  sb2.H2D(current, event2.get());\n  sb1.D2H(current, event1.get());\n  sb2.D2H(current, event2.get());\n\n  latch latch(2);\n  manager.Synchronize(event1.get(), sb1.stream.get(),\n                      [&latch, &sb1](llvm::Error error) {\n                        sb1.CheckBuffersEqual();\n                        latch.count_down();\n                      });\n  manager.Synchronize(event2.get(), sb2.stream.get(),\n                      [&latch, &sb2](llvm::Error error) {\n                        sb2.CheckBuffersEqual();\n                        latch.count_down();\n                      });\n  latch.wait();\n}\n\nTEST_F(EventManagerTest, TestStealing) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb1(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event1,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb1.H2D(current, event1.get());\n  sb1.D2H(current, event1.get());\n\n  latch latch1(1);\n  manager.Synchronize(event1.get(), sb1.stream.get(),\n                      [&latch1, &sb1](llvm::Error error) {\n                        sb1.CheckBuffersEqual();\n                        latch1.count_down();\n                      });\n  latch1.wait();\n\n  \/\/ stream in sb1 should be idle now. Synchronizing event with stream in\n  \/\/ sb2 should now steal the thread.\n\n  StreamAndBuffers sb2(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event2,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb2.H2D(current, event2.get());\n  sb2.D2H(current, event2.get());\n\n  latch latch2(1);\n  manager.Synchronize(event2.get(), sb2.stream.get(),\n                      [&latch2, &sb2](llvm::Error error) {\n                        sb2.CheckBuffersEqual();\n                        latch2.count_down();\n                      });\n  latch2.wait();\n}\n\nTEST_F(EventManagerTest, TestCallSynchronizeFromOnReached) {\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context_.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb1(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event1,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  StreamAndBuffers sb2(current, kBufferSize);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event2,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  sb1.H2D(current, event1.get());\n  sb1.D2H(current, event1.get());\n  sb2.H2D(current, event2.get());\n  sb2.D2H(current, event2.get());\n\n  latch latch(2);\n  manager.Synchronize(\n      event1.get(), sb1.stream.get(),\n      [&latch, &sb1, &manager, &event2, &sb2](llvm::Error error) {\n        sb1.CheckBuffersEqual();\n        latch.count_down();\n        manager.Synchronize(event2.get(), sb2.stream.get(),\n                            [&latch, &sb2](llvm::Error error) {\n                              sb2.CheckBuffersEqual();\n                              latch.count_down();\n                            });\n      });\n  latch.wait();\n}\n\nvoid BM_EventEnqueue(benchmark::State& state) {\n  Platform platform(Platform::CUDA);\n  ASSERT_TRUE(IsSuccess(Init(platform)));\n  TFRT_ASSERT_AND_ASSIGN(auto count, DeviceGetCount(platform));\n  ASSERT_GT(count, 0);\n  TFRT_ASSERT_AND_ASSIGN(auto device, DeviceGet(platform, 0));\n  TFRT_ASSERT_AND_ASSIGN(auto context, DevicePrimaryCtxRetain(device));\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context.get()));\n\n  EventManager manager;\n\n  StreamAndBuffers sb(current, \/*size=*\/4);\n  TFRT_ASSERT_AND_ASSIGN(OwningEvent event,\n                         EventCreate(current, EventFlags::DISABLE_TIMING));\n\n  {\n    latch latch(1);\n    manager.Synchronize(event.get(), sb.stream.get(),\n                        [&latch](llvm::Error error) { latch.count_down(); });\n    latch.wait();\n  }\n  for (auto _ : state) {\n    manager.Synchronize(event.get(), sb.stream.get(), [](llvm::Error error) {\n      TFRT_LOG_IF(FATAL, error.success())\n          << \"Hit an error in calback: \" << error;\n    });\n  }\n  {\n    latch latch(1);\n    manager.Synchronize(event.get(), sb.stream.get(),\n                        [&latch](llvm::Error error) { latch.count_down(); });\n    latch.wait();\n  }\n}\n\nvoid BM_ManyThreadsManyStreams(benchmark::State& state) {\n  Platform platform(Platform::CUDA);\n  ASSERT_TRUE(IsSuccess(Init(platform)));\n  TFRT_ASSERT_AND_ASSIGN(auto count, DeviceGetCount(platform));\n  ASSERT_GT(count, 0);\n  TFRT_ASSERT_AND_ASSIGN(auto device, DeviceGet(platform, 0));\n  TFRT_ASSERT_AND_ASSIGN(auto context, DevicePrimaryCtxRetain(device));\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context.get()));\n\n  const int thread_count = state.range(0);\n  const size_t size = state.range(1);\n  EventManager manager;\n\n  std::vector<StreamAndBuffers> sb;\n  sb.reserve(thread_count);\n  for (int i = 0; i < thread_count; ++i) {\n    sb.emplace_back(current, size);\n  }\n  std::vector<OwningEvent> events(thread_count);\n  std::generate(events.begin(), events.end(), [&] {\n    return std::move(*EventCreate(current, EventFlags::DISABLE_TIMING));\n  });\n\n  for (auto _ : state) {\n    latch latch(thread_count);\n    for (int i = 0; i < thread_count; ++i) {\n      sb[i].H2D(current, events[i].get());\n    }\n    for (int i = 0; i < thread_count; ++i) {\n      manager.Synchronize(events[i].get(), sb[i].stream.get(),\n                          [&latch](llvm::Error error) { latch.count_down(); });\n    }\n    latch.wait();\n  }\n}\n\nvoid BM_MultipleEventsPerStream(benchmark::State& state) {\n  Platform platform(Platform::CUDA);\n  ASSERT_TRUE(IsSuccess(Init(platform)));\n  TFRT_ASSERT_AND_ASSIGN(auto count, DeviceGetCount(platform));\n  ASSERT_GT(count, 0);\n  TFRT_ASSERT_AND_ASSIGN(auto device, DeviceGet(platform, 0));\n  TFRT_ASSERT_AND_ASSIGN(auto context, DevicePrimaryCtxRetain(device));\n  TFRT_ASSERT_AND_ASSIGN(auto current, CtxSetCurrent(context.get()));\n\n  const int thread_count = state.range(0);\n  const int events_per_stream = state.range(1);\n  EventManager manager;\n\n  std::vector<StreamAndBuffers> sb;\n  sb.reserve(thread_count);\n  for (int i = 0; i < thread_count; ++i) {\n    sb.emplace_back(current, \/*size=*\/8192);\n  }\n\n  std::vector<OwningEvent> events(thread_count * events_per_stream);\n  std::generate(events.begin(), events.end(), [&] {\n    return std::move(*EventCreate(current, EventFlags::DISABLE_TIMING));\n  });\n\n  for (auto _ : state) {\n    latch latch(thread_count * events_per_stream);\n    for (int j = 0; j < events_per_stream; ++j) {\n      for (int i = 0; i < thread_count; ++i) {\n        sb[i].H2D(current, events[i * events_per_stream + j].get());\n      }\n    }\n    for (int i = 0; i < thread_count; ++i) {\n      for (int j = 0; j < events_per_stream; ++j) {\n        manager.Synchronize(\n            events[i * events_per_stream + j].get(), sb[i].stream.get(),\n            [&latch](llvm::Error error) { latch.count_down(); });\n      }\n    }\n    latch.wait();\n  }\n}\n\nBENCHMARK(BM_EventEnqueue);\nBENCHMARK(BM_ManyThreadsManyStreams)->RangePair(1, 32, 4, 32 << 20);\nBENCHMARK(BM_MultipleEventsPerStream)->RangePair(1, 32, 2, 32);\n\n}  \/\/ namespace stream\n}  \/\/ namespace gpu\n}  \/\/ namespace tfrt\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MLT_MODELS_PIPELINE_HPP\n#define MLT_MODELS_PIPELINE_HPP\n\n#include <Eigen\/Core>\n\n#include \"transformers\/transformer_mixin.hpp\"\n\nnamespace mlt {\nnamespace models {\n\n\t\/\/ Forward declaration\n\ttemplate <class... Ts>\n\tclass Pipeline {\n\t};\n\nnamespace internal {\n\ttemplate<size_t _Index, class _Pipline>\n\tstruct sub_pipeline_element;\n\n\ttemplate<size_t _Index>\n\tstruct sub_pipeline_element<_Index, Pipeline<> >\n\t{\n\t\tstatic_assert(std::_Always_false<std::integral_constant<size_t, _Index> >::value, \"pipeline index out of bounds\");\n\t};\n\n\ttemplate<class _This, class... _Rest>\n\tstruct sub_pipeline_element<0, Pipeline<_This, _Rest...> >\n\t{\n\t\ttypedef _This model_type;\n\t\ttypedef Pipeline<_This, _Rest...> type;\n\t};\n\n\ttemplate<size_t _Index, class _This, class... _Rest>\n\tstruct sub_pipeline_element<_Index, Pipeline<_This, _Rest...> >\n\t\t: public sub_pipeline_element<_Index - 1, Pipeline<_Rest...> >\n\t{};\n\n\ttemplate<size_t _Index, class _Pipline>\n\tstruct sub_pipeline_element<_Index, const _Pipline>\n\t\t: public sub_pipeline_element<_Index, _Pipline>\n\t{\n\t\ttypedef typename std::add_const<typename sub_pipeline_element<_Index, _Pipline>::model_type>::type model_type;\n\t\ttypedef typename std::add_const<typename sub_pipeline_element<_Index, _Pipline>::type>::type type;\n\t};\n\n\ttemplate<size_t _Index, class _Pipline>\n\tstruct sub_pipeline_element<_Index, volatile _Pipline> : public sub_pipeline_element<_Index, _Pipline>\n\t{\n\t\ttypedef typename std::add_volatile<typename sub_pipeline_element<_Index, _Pipline>::model_type>::type model_type;\n\t\ttypedef typename std::add_volatile<typename sub_pipeline_element<_Index, _Pipline>::type>::type type;\n\t};\n\n\ttemplate<size_t _Index, class _Pipline>\n\tstruct sub_pipeline_element<_Index, const volatile _Pipline> : public sub_pipeline_element<_Index, _Pipline>\n\t{\n\t\ttypedef typename std::add_cv<typename sub_pipeline_element<_Index, _Pipline>::model_type>::type model_type;\n\t\ttypedef typename std::add_cv<typename sub_pipeline_element<_Index, _Pipline>::type>::type type;\n\t};\n}\n\ttemplate<>\n\tclass Pipeline<> {\n\t\tPipeline() = delete;\n\t};\n\n\ttemplate <class T>\n\tclass Pipeline<T> : public T {\n\tpublic:\n\t\texplicit Pipeline(T& estimator) : T(estimator) {}\n\n\t\ttemplate<size_t _Index>\n\t\tusing pipeline_model_t = typename internal::sub_pipeline_element<_Index, Pipeline<T>>::model_type;\n\n\t\ttemplate<size_t _Index>\n\t\tusing sub_pipeline_t = typename internal::sub_pipeline_element<_Index, Pipeline<T>>::type;\n\n\t\tT& top_estimator() { return *this; }\n\n\t\ttemplate<size_t Index>\n\t\tinline sub_pipeline_t<Index>& get()\n\t\t{\n\t\t\treturn static_cast<sub_pipeline_t<Index>&>(*this);\n\t\t}\n\n\t\ttemplate<size_t Index>\n\t\tinline typename pipeline_model_t<Index>& get_model()\n\t\t{\n\t\t\treturn static_cast<sub_pipeline_t<Index>&>(*this).top_estimator();\n\t\t}\n\n\tprotected:\n\t\t\n\t};\n\n\ttemplate <class T, class... Ts>\n\tclass Pipeline<T, Ts...> : protected Pipeline<Ts...>, public transformers::TransformerMixin<Pipeline<T, Ts...>> {\n\tpublic:\n\t\texplicit Pipeline(T& estimator, Ts & ... following) : Pipeline<Ts...>(following...), _estimator(estimator) {}\n\n\t\ttemplate<size_t _Index>\n\t\tusing pipeline_model_t = typename internal::sub_pipeline_element<_Index, Pipeline<T, Ts...>>::model_type;\n\n\t\ttemplate<size_t _Index>\n\t\tusing sub_pipeline_t = typename internal::sub_pipeline_element<_Index, Pipeline<T, Ts...>>::type;\n\n\t\tPipeline<T, Ts...>& fit(const Eigen::MatrixXd& input, bool cold_start = true)\n\t\t{\n\t\t\tsub_pipeline_t<1>::fit(_estimator.fit_transform(input, cold_start), cold_start);\n\t\t\treturn *this;\n\t\t}\n\n\t\tPipeline<T, Ts...>& fit(const Eigen::MatrixXd& input, const Eigen::MatrixXd& target, bool cold_start = true)\n\t\t{\n\t\t\tsub_pipeline_t<1>::fit(_estimator.fit_transform(input, target, cold_start), target, cold_start);\n\t\t\treturn *this;\n\t\t}\n\n\t\tPipeline<T, Ts...>& fit(const Eigen::MatrixXd& input, const Eigen::MatrixXi& classes, bool cold_start = true)\n\t\t{\n\t\t\tsub_pipeline_t<1>::fit(_estimator.fit_transform(input, classes, cold_start), classes, cold_start);\n\t\t\treturn *this;\n\t\t}\n\n\t\tEigen::MatrixXd transform(const Eigen::MatrixXd& input) const\n\t\t{\n\t\t\treturn sub_pipeline_t<1>::transform(_estimator.transform(input));\n\t\t}\n\n\t\tEigen::MatrixXi classify(const Eigen::MatrixXd& input) const\n\t\t{\n\t\t\treturn sub_pipeline_t<1>::classify(_estimator.transform(input));\n\t\t}\n\n\t\tEigen::MatrixXd predict(const Eigen::MatrixXd& input) const\n\t\t{\n\t\t\treturn sub_pipeline_t<1>::predict(_estimator.transform(input));\n\t\t}\n\n\t\tEigen::MatrixXi cluster(const Eigen::MatrixXd& input) const\n\t\t{\n\t\t\treturn sub_pipeline_t<1>::cluster(_estimator.transform(input));\n\t\t}\n\n\t\tT& top_estimator() { return _estimator; }\n\n\t\ttemplate<size_t Index>\n\t\tinline sub_pipeline_t<Index>& get()\n\t\t{\n\t\t\treturn static_cast<sub_pipeline_t<Index>&>(*this);\n\t\t}\n\n\t\ttemplate<size_t Index>\n\t\tinline typename pipeline_model_t<Index>& get_model()\n\t\t{\n\t\t\treturn static_cast<sub_pipeline_t<Index>&>(*this).top_estimator();\n\t\t}\n\tprotected:\n\t\tT& _estimator;\n\t};\n\n\ttemplate <class... Ts>\n\tPipeline<Ts...> create_pipeline(Ts & ... models) {\n\t\treturn Pipeline<Ts...>(models...);\n\t}\n}\n}\n#endif<commit_msg>Added score to pipeline and fixed Matrix References<commit_after>#ifndef MLT_MODELS_PIPELINE_HPP\n#define MLT_MODELS_PIPELINE_HPP\n\n#include <Eigen\/Core>\n\n#include \"transformers\/transformer_mixin.hpp\"\n\nnamespace mlt {\nnamespace models {\n\n\t\/\/ Forward declaration\n\ttemplate <class... Ts>\n\tclass Pipeline {\n\t};\n\nnamespace internal {\n\ttemplate<size_t _Index, class _Pipline>\n\tstruct sub_pipeline_element;\n\n\ttemplate<size_t _Index>\n\tstruct sub_pipeline_element<_Index, Pipeline<> >\n\t{\n\t\tstatic_assert(std::_Always_false<std::integral_constant<size_t, _Index> >::value, \"pipeline index out of bounds\");\n\t};\n\n\ttemplate<class _This, class... _Rest>\n\tstruct sub_pipeline_element<0, Pipeline<_This, _Rest...> >\n\t{\n\t\ttypedef _This model_type;\n\t\ttypedef Pipeline<_This, _Rest...> type;\n\t};\n\n\ttemplate<size_t _Index, class _This, class... _Rest>\n\tstruct sub_pipeline_element<_Index, Pipeline<_This, _Rest...> >\n\t\t: public sub_pipeline_element<_Index - 1, Pipeline<_Rest...> >\n\t{};\n\n\ttemplate<size_t _Index, class _Pipline>\n\tstruct sub_pipeline_element<_Index, const _Pipline>\n\t\t: public sub_pipeline_element<_Index, _Pipline>\n\t{\n\t\ttypedef typename std::add_const<typename sub_pipeline_element<_Index, _Pipline>::model_type>::type model_type;\n\t\ttypedef typename std::add_const<typename sub_pipeline_element<_Index, _Pipline>::type>::type type;\n\t};\n\n\ttemplate<size_t _Index, class _Pipline>\n\tstruct sub_pipeline_element<_Index, volatile _Pipline> : public sub_pipeline_element<_Index, _Pipline>\n\t{\n\t\ttypedef typename std::add_volatile<typename sub_pipeline_element<_Index, _Pipline>::model_type>::type model_type;\n\t\ttypedef typename std::add_volatile<typename sub_pipeline_element<_Index, _Pipline>::type>::type type;\n\t};\n\n\ttemplate<size_t _Index, class _Pipline>\n\tstruct sub_pipeline_element<_Index, const volatile _Pipline> : public sub_pipeline_element<_Index, _Pipline>\n\t{\n\t\ttypedef typename std::add_cv<typename sub_pipeline_element<_Index, _Pipline>::model_type>::type model_type;\n\t\ttypedef typename std::add_cv<typename sub_pipeline_element<_Index, _Pipline>::type>::type type;\n\t};\n}\n\ttemplate<>\n\tclass Pipeline<> {\n\t\tPipeline() = delete;\n\t};\n\n\ttemplate <class T>\n\tclass Pipeline<T> : public T {\n\tpublic:\n\t\texplicit Pipeline(T& estimator) : T(estimator) {}\n\n\t\ttemplate<size_t _Index>\n\t\tusing pipeline_model_t = typename internal::sub_pipeline_element<_Index, Pipeline<T>>::model_type;\n\n\t\ttemplate<size_t _Index>\n\t\tusing sub_pipeline_t = typename internal::sub_pipeline_element<_Index, Pipeline<T>>::type;\n\n\t\tT& top_estimator() { return *this; }\n\n\t\ttemplate<size_t Index>\n\t\tinline sub_pipeline_t<Index>& get()\n\t\t{\n\t\t\treturn static_cast<sub_pipeline_t<Index>&>(*this);\n\t\t}\n\n\t\ttemplate<size_t Index>\n\t\tinline typename pipeline_model_t<Index>& get_model()\n\t\t{\n\t\t\treturn static_cast<sub_pipeline_t<Index>&>(*this).top_estimator();\n\t\t}\n\n\tprotected:\n\t\t\n\t};\n\n\ttemplate <class T, class... Ts>\n\tclass Pipeline<T, Ts...> : protected Pipeline<Ts...> {\n\tpublic:\n\t\texplicit Pipeline(T& estimator, Ts & ... following) : Pipeline<Ts...>(following...), _estimator(estimator) {}\n\n\t\ttemplate<size_t _Index>\n\t\tusing pipeline_model_t = typename internal::sub_pipeline_element<_Index, Pipeline<T, Ts...>>::model_type;\n\n\t\ttemplate<size_t _Index>\n\t\tusing sub_pipeline_t = typename internal::sub_pipeline_element<_Index, Pipeline<T, Ts...>>::type;\n\n\t\tPipeline<T, Ts...>& fit(const Eigen::Ref<const Eigen::MatrixXd>& input, bool cold_start = true)\n\t\t{\n\t\t\tsub_pipeline_t<1>::fit(_estimator.fit_transform(input, cold_start), cold_start);\n\t\t\treturn *this;\n\t\t}\n\n\t\tPipeline<T, Ts...>& fit(const Eigen::Ref<const Eigen::MatrixXd>& input, const Eigen::Ref<const Eigen::MatrixXd>& target, bool cold_start = true)\n\t\t{\n\t\t\tsub_pipeline_t<1>::fit(_estimator.fit_transform(input, target, cold_start), target, cold_start);\n\t\t\treturn *this;\n\t\t}\n\n\t\tPipeline<T, Ts...>& fit(const Eigen::Ref<const Eigen::MatrixXd>& input, const Eigen::Ref<const Eigen::VectorXi>& classes, bool cold_start = true)\n\t\t{\n\t\t\tsub_pipeline_t<1>::fit(_estimator.fit_transform(input, classes, cold_start), classes, cold_start);\n\t\t\treturn *this;\n\t\t}\n\n\t\tEigen::MatrixXd transform(const Eigen::MatrixXd& input) const\n\t\t{\n\t\t\treturn sub_pipeline_t<1>::transform(_estimator.transform(input));\n\t\t}\n\n\t\tEigen::MatrixXi classify(const Eigen::MatrixXd& input) const\n\t\t{\n\t\t\treturn sub_pipeline_t<1>::classify(_estimator.transform(input));\n\t\t}\n\n\t\tEigen::MatrixXd predict(const Eigen::MatrixXd& input) const\n\t\t{\n\t\t\treturn sub_pipeline_t<1>::predict(_estimator.transform(input));\n\t\t}\n\n\t\tEigen::MatrixXi cluster(const Eigen::MatrixXd& input) const\n\t\t{\n\t\t\treturn sub_pipeline_t<1>::cluster(_estimator.transform(input));\n\t\t}\n\n\t\tdouble score(const Eigen::Ref<const Eigen::MatrixXd>& input, const Eigen::Ref<const Eigen::MatrixXd>& target) const {\n\t\t\treturn sub_pipeline_t<1>::score(_estimator.transform(input), target);\n\t\t}\n\n\t\tdouble score(const Eigen::Ref<const Eigen::MatrixXd>& input, const Eigen::Ref<const Eigen::VectorXi>& classes) const {\n\t\t\treturn sub_pipeline_t<1>::score(_estimator.transform(input), classes);\n\t\t}\n\n\t\tT& top_estimator() { return _estimator; }\n\n\t\ttemplate<size_t Index>\n\t\tinline sub_pipeline_t<Index>& get()\n\t\t{\n\t\t\treturn static_cast<sub_pipeline_t<Index>&>(*this);\n\t\t}\n\n\t\ttemplate<size_t Index>\n\t\tinline typename pipeline_model_t<Index>& get_model()\n\t\t{\n\t\t\treturn static_cast<sub_pipeline_t<Index>&>(*this).top_estimator();\n\t\t}\n\tprotected:\n\t\tT& _estimator;\n\t};\n\n\ttemplate <class... Ts>\n\tPipeline<Ts...> create_pipeline(Ts & ... models) {\n\t\treturn Pipeline<Ts...>(models...);\n\t}\n}\n}\n#endif<|endoftext|>"}
{"text":"<commit_before>#include \"mini_ion.h\"\n#include \"mini_mman.h\"\n#include \"android_ioctl.h\"\n#include \"scoped_mutex_lock.h\"\n#include \"printer.h\"\n\nnamespace Halide { namespace Runtime { namespace Internal { namespace Ion {\n\ntypedef int ion_user_handle_t;\n\n\/\/ Ion data structures.\nstruct ion_allocation_data {\n    size_t len;\n    size_t align;\n    unsigned int heap_id_mask;\n    unsigned int flags;\n    ion_user_handle_t handle;\n};\n\nstruct ion_fd_data {\n    ion_user_handle_t handle;\n    int fd;\n};\n\nstruct ion_handle_data {\n    ion_user_handle_t handle;\n};\n\n#define ION_IOC_MAGIC  'I'\n#define ION_IOC_ALLOC  _IOWR(ION_IOC_MAGIC, 0, struct ion_allocation_data)\n#define ION_IOC_FREE   _IOWR(ION_IOC_MAGIC, 1, struct ion_handle_data)\n#define ION_IOC_MAP    _IOWR(ION_IOC_MAGIC, 2, struct ion_fd_data)\n\n\/\/ A ion fd defined in this module with weak linkage\nWEAK int dev_ion_fd = -1;\nWEAK halide_mutex thread_lock = { { 0 } };\n\n\/\/ The default implementation of halide_hexagon_get_descriptor uses the global\n\/\/ pointers above, and serializes access with a spin lock.\n\/\/ Overriding implementations of get_descriptor must implement the following\n\/\/ behavior:\n\/\/ - halide_hexagon_get_descriptor should always store a valid file descriptor to\n\/\/   \/dev\/ion in fd, or return an error code.\nextern \"C\" WEAK int halide_ion_get_descriptor(void *user_context, int *fd, bool create = true) {\n    \/\/ TODO: Should we use a more \"assertive\" assert? these asserts do\n    \/\/ not block execution on failure.\n    halide_assert(user_context, fd != NULL);\n\n    ScopedMutexLock lock(&thread_lock);\n\n    \/\/ If the context has not been initialized, initialize it now.\n    if (dev_ion_fd == -1 && create) {\n        debug(user_context) << \"    open \/dev\/ion -> \";\n        dev_ion_fd = open(\"\/dev\/ion\", O_RDONLY, 0);\n        debug(user_context) << \"        \" << dev_ion_fd << \"\\n\";\n        if (dev_ion_fd == -1) {\n            error(user_context) << \"Failed to open \/dev\/ion.\\n\";\n        }\n    }\n\n    *fd = dev_ion_fd;\n    if (dev_ion_fd == -1) {\n        return -1;\n    } else {\n        return 0;\n    }\n}\n\nWEAK ion_user_handle_t ion_alloc(int ion_fd, size_t len, size_t align, unsigned int heap_id_mask, unsigned int flags) {\n    ion_allocation_data alloc;\n    alloc.len = len;\n    alloc.align = align;\n    alloc.heap_id_mask = heap_id_mask;\n    alloc.flags = flags;\n    if (ioctl(ion_fd, ION_IOC_ALLOC, &alloc) < 0) {\n        return -1;\n    }\n    return alloc.handle;\n}\n\nWEAK void ion_free(int ion_fd, ion_user_handle_t ion_handle) {\n    if(ioctl(ion_fd, ION_IOC_FREE, &ion_handle) < 0) {\n        \/\/ warn?\n    }\n}\n\nWEAK int ion_map(int ion_fd, ion_user_handle_t ion_handle) {\n    ion_fd_data map;\n    map.handle = ion_handle;\n    if (ioctl(ion_fd, ION_IOC_MAP, &map) < 0) {\n        return -1;\n    }\n    return map.fd;\n}\n\nstruct allocation_record {\n    int dev_ion;\n    ion_user_handle_t handle;\n    int fd;\n    void *mapped;\n    size_t size;\n};\n\n\/\/ Allocate an ION buffer, and map it, returning the mapped pointer.\nWEAK void *ion_alloc(void *user_context, size_t len, int heap_id) {\n    int dev_ion = -1;\n    int result = halide_ion_get_descriptor(user_context, &dev_ion);\n    if (result != 0) return NULL;\n\n    const size_t align = 4096;\n\n    \/\/ Allocate enough space to hold information about the allocation prior to the pointer we return.\n    ion_user_handle_t ion_h = ion_alloc(dev_ion, len + align, align, 1 << heap_id, 0);\n\n    int buf_fd = ion_map(dev_ion, ion_h);\n\n    debug(user_context) << \"    mmap map_size=\" << (uint64_t)len << \" Read Write Shared fd=\" << buf_fd << \" -> \";\n    void *mem = mmap(NULL, len, MapProtocol::Read | MapProtocol::Write, MapFlags::Shared, buf_fd, 0);\n    if (mem == MAP_FAILED) {\n        ion_free(dev_ion, ion_h);\n        debug(user_context) << \"        MAP_FAILED\\n\";\n        error(user_context) << \"mmap failed\\n\";\n        return NULL;\n    } else {\n        debug(user_context) << \"        \" << mem << \"\\n\";\n    }\n\n    \/\/ Store a record of the ION allocation data before the pointer we return.\n    allocation_record rec = { dev_ion, ion_h, buf_fd, mem, len };\n    mem = reinterpret_cast<char *>(mem) + align;\n    memcpy(reinterpret_cast<allocation_record *>(mem) - 1, &rec, sizeof(rec));\n    return mem;\n}\n\n\/\/ Free a previously allocated ION buffer.\nWEAK void ion_free(void *user_context, void *ion) {\n    if (!ion) return;\n    allocation_record *rec = reinterpret_cast<allocation_record *>(ion) - 1;\n    munmap(rec->mapped, rec->size);\n\n    ion_free(rec->dev_ion, rec->handle);\n}\n\n}}}}  \/\/ namespace Halide::Runtime::Internal::Ion\n<commit_msg>Fix bad memory access to ION buffers of unaligned size.<commit_after>#include \"mini_ion.h\"\n#include \"mini_mman.h\"\n#include \"android_ioctl.h\"\n#include \"scoped_mutex_lock.h\"\n#include \"printer.h\"\n\nnamespace Halide { namespace Runtime { namespace Internal { namespace Ion {\n\ntypedef int ion_user_handle_t;\n\n\/\/ Ion data structures.\nstruct ion_allocation_data {\n    size_t len;\n    size_t align;\n    unsigned int heap_id_mask;\n    unsigned int flags;\n    ion_user_handle_t handle;\n};\n\nstruct ion_fd_data {\n    ion_user_handle_t handle;\n    int fd;\n};\n\nstruct ion_handle_data {\n    ion_user_handle_t handle;\n};\n\n#define ION_IOC_MAGIC  'I'\n#define ION_IOC_ALLOC  _IOWR(ION_IOC_MAGIC, 0, struct ion_allocation_data)\n#define ION_IOC_FREE   _IOWR(ION_IOC_MAGIC, 1, struct ion_handle_data)\n#define ION_IOC_MAP    _IOWR(ION_IOC_MAGIC, 2, struct ion_fd_data)\n\n\/\/ A ion fd defined in this module with weak linkage\nWEAK int dev_ion_fd = -1;\nWEAK halide_mutex thread_lock = { { 0 } };\n\n\/\/ The default implementation of halide_hexagon_get_descriptor uses the global\n\/\/ pointers above, and serializes access with a spin lock.\n\/\/ Overriding implementations of get_descriptor must implement the following\n\/\/ behavior:\n\/\/ - halide_hexagon_get_descriptor should always store a valid file descriptor to\n\/\/   \/dev\/ion in fd, or return an error code.\nextern \"C\" WEAK int halide_ion_get_descriptor(void *user_context, int *fd, bool create = true) {\n    \/\/ TODO: Should we use a more \"assertive\" assert? these asserts do\n    \/\/ not block execution on failure.\n    halide_assert(user_context, fd != NULL);\n\n    ScopedMutexLock lock(&thread_lock);\n\n    \/\/ If the context has not been initialized, initialize it now.\n    if (dev_ion_fd == -1 && create) {\n        debug(user_context) << \"    open \/dev\/ion -> \";\n        dev_ion_fd = open(\"\/dev\/ion\", O_RDONLY, 0);\n        debug(user_context) << \"        \" << dev_ion_fd << \"\\n\";\n        if (dev_ion_fd == -1) {\n            error(user_context) << \"Failed to open \/dev\/ion.\\n\";\n        }\n    }\n\n    *fd = dev_ion_fd;\n    if (dev_ion_fd == -1) {\n        return -1;\n    } else {\n        return 0;\n    }\n}\n\nWEAK ion_user_handle_t ion_alloc(int ion_fd, size_t len, size_t align, unsigned int heap_id_mask, unsigned int flags) {\n    ion_allocation_data alloc;\n    alloc.len = len;\n    alloc.align = align;\n    alloc.heap_id_mask = heap_id_mask;\n    alloc.flags = flags;\n    if (ioctl(ion_fd, ION_IOC_ALLOC, &alloc) < 0) {\n        return -1;\n    }\n    return alloc.handle;\n}\n\nWEAK void ion_free(int ion_fd, ion_user_handle_t ion_handle) {\n    if(ioctl(ion_fd, ION_IOC_FREE, &ion_handle) < 0) {\n        \/\/ warn?\n    }\n}\n\nWEAK int ion_map(int ion_fd, ion_user_handle_t ion_handle) {\n    ion_fd_data map;\n    map.handle = ion_handle;\n    if (ioctl(ion_fd, ION_IOC_MAP, &map) < 0) {\n        return -1;\n    }\n    return map.fd;\n}\n\nstruct allocation_record {\n    int dev_ion;\n    ion_user_handle_t handle;\n    int fd;\n    void *mapped;\n    size_t size;\n};\n\n\/\/ Allocate an ION buffer, and map it, returning the mapped pointer.\nWEAK void *ion_alloc(void *user_context, size_t len, int heap_id) {\n    int dev_ion = -1;\n    int result = halide_ion_get_descriptor(user_context, &dev_ion);\n    if (result != 0) return NULL;\n\n    const size_t align = 4096;\n\n    \/\/ Align the allocation size.\n    len = (len + align - 1) & ~(align - 1);\n\n    \/\/ Allocate enough space to hold information about the allocation prior to the pointer we return.\n    len += align;\n\n    ion_user_handle_t ion_h = ion_alloc(dev_ion, len, align, 1 << heap_id, 0);\n\n    int buf_fd = ion_map(dev_ion, ion_h);\n\n    debug(user_context) << \"    mmap map_size=\" << (uint64_t)len << \" Read Write Shared fd=\" << buf_fd << \" -> \";\n    void *mem = mmap(NULL, len, MapProtocol::Read | MapProtocol::Write, MapFlags::Shared, buf_fd, 0);\n    if (mem == MAP_FAILED) {\n        ion_free(dev_ion, ion_h);\n        debug(user_context) << \"        MAP_FAILED\\n\";\n        error(user_context) << \"mmap failed\\n\";\n        return NULL;\n    } else {\n        debug(user_context) << \"        \" << mem << \"\\n\";\n    }\n\n    \/\/ Store a record of the ION allocation data before the pointer we return.\n    allocation_record rec = { dev_ion, ion_h, buf_fd, mem, len };\n    mem = reinterpret_cast<char *>(mem) + align;\n    memcpy(reinterpret_cast<allocation_record *>(mem) - 1, &rec, sizeof(rec));\n    return mem;\n}\n\n\/\/ Free a previously allocated ION buffer.\nWEAK void ion_free(void *user_context, void *ion) {\n    if (!ion) return;\n    allocation_record *rec = reinterpret_cast<allocation_record *>(ion) - 1;\n    munmap(rec->mapped, rec->size);\n\n    ion_free(rec->dev_ion, rec->handle);\n}\n\n}}}}  \/\/ namespace Halide::Runtime::Internal::Ion\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\/*\n * Copyright (C) 2015 Cloudius Systems, Ltd.\n *\/\n\n#pragma once\n\n#include <chrono>\n#include <functional>\n\n#include \"core\/shared_ptr.hh\"\n#include \"core\/reactor.hh\"\n#include \"core\/future.hh\"\n\ntemplate <typename Clock = steady_clock_type, typename Rep, typename Period>\nfuture<> sleep(std::chrono::duration<Rep, Period> dur) {\n    struct sleeper {\n        promise<> done;\n        timer<Clock> tmr;\n        sleeper(std::chrono::duration<Rep, Period> dur)\n            : tmr([this] { done.set_value(); })\n        {\n            tmr.arm(dur);\n        }\n    };\n    sleeper *s = new sleeper(dur);\n    future<> fut = s->done.get_future();\n    return fut.then([s] { delete s; });\n}\n<commit_msg>sleep: document<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\/*\n * Copyright (C) 2015 Cloudius Systems, Ltd.\n *\/\n\n#pragma once\n\n#include <chrono>\n#include <functional>\n\n#include \"core\/shared_ptr.hh\"\n#include \"core\/reactor.hh\"\n#include \"core\/future.hh\"\n\n\n\/\/\/ \\file\n\n\/\/\/ Returns a future which completes after a specified time has elapsed.\n\/\/\/\n\/\/\/ \\param dur minimum amount of time before the returned future becomes\n\/\/\/            ready.\n\/\/\/ \\return A \\ref future which becomes ready when the sleep duration elapses.\ntemplate <typename Clock = steady_clock_type, typename Rep, typename Period>\nfuture<> sleep(std::chrono::duration<Rep, Period> dur) {\n    struct sleeper {\n        promise<> done;\n        timer<Clock> tmr;\n        sleeper(std::chrono::duration<Rep, Period> dur)\n            : tmr([this] { done.set_value(); })\n        {\n            tmr.arm(dur);\n        }\n    };\n    sleeper *s = new sleeper(dur);\n    future<> fut = s->done.get_future();\n    return fut.then([s] { delete s; });\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/\/ =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=--=-=-=-=-=--=-=-=-=-=-\n\/\/\/ river\n\/\/\/ Copyright (c) 2014, Tony Di Croce\n\/\/\/ All rights reserved.\n\/\/\/\n\/\/\/ Redistribution and use in source and binary forms, with or without modification, are permitted\n\/\/\/ provided that the following conditions are met:\n\/\/\/\n\/\/\/ 1. Redistributions of source code must retain the above copyright notice, this list of conditions and\n\/\/\/    the following disclaimer.\n\/\/\/ 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions\n\/\/\/    and the following disclaimer in the documentation and\/or other materials provided with the\n\/\/\/    distribution.\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\n\/\/\/ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/\/ LIMITED TO, 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, STRICT LIABILITY, OR\n\/\/\/ TORT (INCLUDING 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\/\/\/ The views and conclusions contained in the software and documentation are those of the authors and\n\/\/\/ should not be interpreted as representing official policies, either expressed or implied, of the cppkit\n\/\/\/ Project.\n\/\/\/ =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=--=-=-=-=-=--=-=-=-=-=-\n\n#include \"river\/client_connection.h\"\n\nusing namespace river;\nusing namespace cppkit;\nusing namespace std;\n\nclient_connection::client_connection( const cppkit::ck_string& serverIP, int port ) :\n    _serverIP( serverIP ),\n    _serverPort( port ),\n    _sok( new ck_socket ),\n    _sequence( 0 ),\n    _sessionID(),\n    _recvTimeoutMillis( 5000 )\n{\n}\n\nclient_connection::~client_connection() throw()\n{\n}\n\nbool client_connection::connect( int timeoutMillis )\n{\n    return _sok->query_connect( _serverIP, _serverPort, timeoutMillis );\n}\n\nvoid client_connection::disconnect()\n{\n    _sequence = 0;\n    _sessionID = \"\";\n    _sok->close();\n}\n\nvoid client_connection::write_request( shared_ptr<client_request> request )\n{\n    _sequence++;\n\n    request->set_server_ip( _serverIP );\n    request->set_server_port( _serverPort );\n\n    request->set_header( \"CSeq\", ck_string::from_int( _sequence ) );\n\n    if( _sessionID.length() > 0 )\n        request->set_header( \"Session\", _sessionID );\n\n    request->write_request( _sok );\n}\n\nshared_ptr<client_response> client_connection::read_response()\n{\n    shared_ptr<client_response> response = make_shared<client_response>();\n\n    response->read_response( _sok );\n\n    ck_string value;\n    if( response->get_header( \"Session\", value ) )\n    {\n        if( _sessionID.empty() )\n            _sessionID = value.substr( 0, value.find(';') ); \/\/ If no ';' found, entire string is taken.\n    }\n\n    return response;\n}\n\ncppkit::ck_string client_connection::get_session_id() const\n{\n    return _sessionID;\n}\n\nvoid client_connection::set_session_id( const cppkit::ck_string& sessionID )\n{\n    _sessionID = sessionID;\n}\n\nbool client_connection::receive_interleaved_packet( uint8_t& channel, std::shared_ptr<cppkit::ck_memory> buffer )\n{\n    buffer->clear();\n\n    uint8_t dollarSign = 0;\n    uint16_t length = 0;\n    uint16_t maxIterations = 10000;\n\n    while( maxIterations > 0 )\n    {\n        maxIterations--;\n\n        size_t bytesRead = _sok->recv( &dollarSign, 1, _recvTimeoutMillis );\n\n        if( bytesRead == 0 )\n            return false;\n\n        if( dollarSign != 36 )\n        {\n            CK_LOG_WARNING( \"client_connection [%s] invalid token: %d\", _serverIP.c_str(), dollarSign );\n            continue;\n        }\n\n        bytesRead = _sok->recv( &channel, 1, _recvTimeoutMillis );\n\n        if( bytesRead == 0 )\n            return false;\n\n        if( channel > 2 )\n        {\n            CK_LOG_WARNING( \"client_connections [%s] invalid channel: %d\", _serverIP.c_str(), channel );\n            continue;\n        }\n\n        uint16_t sizeShort;\n        bytesRead = _sok->recv( &sizeShort, 2, _recvTimeoutMillis );\n\n        if( bytesRead == 0 )\n            return false;\n\n        length = ck_ntohs( sizeShort );\n\n        \/\/Interleaved appears to use the same RTP packets as UDP - given that,the max packet size of UDP would be 1500 bytes,\n        \/\/we really shouldn't see anything greater than 1600\n        if( length > 1600 || length == 0 )\n        {\n            CK_LOG_WARNING( \"client_connection [%s] invalid size: %d\", _serverIP.c_str(), length );\n            continue;\n        }\n\n        bytesRead = _sok->recv( buffer->extend_data( length ).get_ptr(), length, _recvTimeoutMillis );\n\n        if( bytesRead == 0 )\n            return false;\n\n        return true;\n    }\n\n    CK_LOG_ERROR(\"client_connection [%s] Unable to sync with stream.\", _serverIP.c_str() );\n\n    return false;\n}\n<commit_msg>Added include<commit_after>\n\/\/\/ =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=--=-=-=-=-=--=-=-=-=-=-\n\/\/\/ river\n\/\/\/ Copyright (c) 2014, Tony Di Croce\n\/\/\/ All rights reserved.\n\/\/\/\n\/\/\/ Redistribution and use in source and binary forms, with or without modification, are permitted\n\/\/\/ provided that the following conditions are met:\n\/\/\/\n\/\/\/ 1. Redistributions of source code must retain the above copyright notice, this list of conditions and\n\/\/\/    the following disclaimer.\n\/\/\/ 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions\n\/\/\/    and the following disclaimer in the documentation and\/or other materials provided with the\n\/\/\/    distribution.\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\n\/\/\/ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/\/ LIMITED TO, 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, STRICT LIABILITY, OR\n\/\/\/ TORT (INCLUDING 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\/\/\/ The views and conclusions contained in the software and documentation are those of the authors and\n\/\/\/ should not be interpreted as representing official policies, either expressed or implied, of the cppkit\n\/\/\/ Project.\n\/\/\/ =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=--=-=-=-=-=--=-=-=-=-=-\n\n#include \"river\/client_connection.h\"\n#include \"cppkit\/ck_socket.h\"\n\nusing namespace river;\nusing namespace cppkit;\nusing namespace std;\n\nclient_connection::client_connection( const cppkit::ck_string& serverIP, int port ) :\n    _serverIP( serverIP ),\n    _serverPort( port ),\n    _sok( new ck_socket ),\n    _sequence( 0 ),\n    _sessionID(),\n    _recvTimeoutMillis( 5000 )\n{\n}\n\nclient_connection::~client_connection() throw()\n{\n}\n\nbool client_connection::connect( int timeoutMillis )\n{\n    return _sok->query_connect( _serverIP, _serverPort, timeoutMillis );\n}\n\nvoid client_connection::disconnect()\n{\n    _sequence = 0;\n    _sessionID = \"\";\n    _sok->close();\n}\n\nvoid client_connection::write_request( shared_ptr<client_request> request )\n{\n    _sequence++;\n\n    request->set_server_ip( _serverIP );\n    request->set_server_port( _serverPort );\n\n    request->set_header( \"CSeq\", ck_string::from_int( _sequence ) );\n\n    if( _sessionID.length() > 0 )\n        request->set_header( \"Session\", _sessionID );\n\n    request->write_request( _sok );\n}\n\nshared_ptr<client_response> client_connection::read_response()\n{\n    shared_ptr<client_response> response = make_shared<client_response>();\n\n    response->read_response( _sok );\n\n    ck_string value;\n    if( response->get_header( \"Session\", value ) )\n    {\n        if( _sessionID.empty() )\n            _sessionID = value.substr( 0, value.find(';') ); \/\/ If no ';' found, entire string is taken.\n    }\n\n    return response;\n}\n\ncppkit::ck_string client_connection::get_session_id() const\n{\n    return _sessionID;\n}\n\nvoid client_connection::set_session_id( const cppkit::ck_string& sessionID )\n{\n    _sessionID = sessionID;\n}\n\nbool client_connection::receive_interleaved_packet( uint8_t& channel, std::shared_ptr<cppkit::ck_memory> buffer )\n{\n    buffer->clear();\n\n    uint8_t dollarSign = 0;\n    uint16_t length = 0;\n    uint16_t maxIterations = 10000;\n\n    while( maxIterations > 0 )\n    {\n        maxIterations--;\n\n        size_t bytesRead = _sok->recv( &dollarSign, 1, _recvTimeoutMillis );\n\n        if( bytesRead == 0 )\n            return false;\n\n        if( dollarSign != 36 )\n        {\n            CK_LOG_WARNING( \"client_connection [%s] invalid token: %d\", _serverIP.c_str(), dollarSign );\n            continue;\n        }\n\n        bytesRead = _sok->recv( &channel, 1, _recvTimeoutMillis );\n\n        if( bytesRead == 0 )\n            return false;\n\n        if( channel > 2 )\n        {\n            CK_LOG_WARNING( \"client_connections [%s] invalid channel: %d\", _serverIP.c_str(), channel );\n            continue;\n        }\n\n        uint16_t sizeShort;\n        bytesRead = _sok->recv( &sizeShort, 2, _recvTimeoutMillis );\n\n        if( bytesRead == 0 )\n            return false;\n\n        length = ck_ntohs( sizeShort );\n\n        \/\/Interleaved appears to use the same RTP packets as UDP - given that,the max packet size of UDP would be 1500 bytes,\n        \/\/we really shouldn't see anything greater than 1600\n        if( length > 1600 || length == 0 )\n        {\n            CK_LOG_WARNING( \"client_connection [%s] invalid size: %d\", _serverIP.c_str(), length );\n            continue;\n        }\n\n        bytesRead = _sok->recv( buffer->extend_data( length ).get_ptr(), length, _recvTimeoutMillis );\n\n        if( bytesRead == 0 )\n            return false;\n\n        return true;\n    }\n\n    CK_LOG_ERROR(\"client_connection [%s] Unable to sync with stream.\", _serverIP.c_str() );\n\n    return false;\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\tisl_ctx *ctx = isl_ctx_alloc();\n\tIRProgram pgm(\"program0\");\n\tIRFunction fct(\"function0\", &pgm);\n\n\t\/\/ Declare the computations.  Each computation has: (1) a Halide expression,\n\t\/\/ (2) an isl set representing its iteration space and (3) is attached to a\n\t\/\/ function.\n\tComputation computation0(ctx, Halide::Expr(3), \"{S0[i,j]: 0<=i<=1000 and 0<=j<=1000}\", &fct);\n\tComputation computation1(ctx, Halide::Expr(5), \"{S1[i,j]: 0<=i<=1023 and 0<=j<=1023}\", &fct);\n\/\/\tComputation computation2(ctx, Halide::Expr(7), \"{S2[i,j]: 0<=i<=1023 and 0<=j<=1023}\", &fct);\n\n\t\/\/ Create memory buffers, then map the computations to those buffers.\n\tHalide::Buffer buf(Halide::Int(32), 10, 10, 0, 0, NULL, \"buf\");\n\tfct.buffers_list.insert(std::pair<std::string, Halide::Buffer *>(buf.name(), &buf));\n\tHalide::Argument buffer_arg(\"buf\", Halide::Argument::OutputBuffer, Halide::Int(32), 2);\n\tstd::vector<Halide::Argument> args(1);\n\targs[0] = buffer_arg;\n\n\tcomputation0.SetAccess(\"{S0[i,j]->buf[i, j]}\");\n\tcomputation1.SetAccess(\"{S1[i,j]->buf[0, 0]}\");\n\/\/\tcomputation2.SetAccess(\"{S2[i,j]->buf[0, 0]}\");\n\n\n\t\/\/ Set the schedule of each computation.\n\tcomputation0.Tile(0,1,32,32);\n\tcomputation1.Schedule(\"{S1[i,j]->[1,i1,j1,i2,j3,j4]: i1=floor(i\/32) and j1=floor(j\/32) and i2=i and j3=floor(j\/4) and j4=j%4 and 0<=i<=1023 and 0<=j<=1023}\");\n\/*\tcomputation2.Split(0, 32);\n\tcomputation2.Split(2, 32);\n\tcomputation2.Interchange(1, 2);*\/\n\tpgm.tag_parallel_dimension(\"S0\", 1);\n\/\/\tpgm.tag_vector_dimension(\"S1\", 5);\n\n\tisl_union_map *schedule_map = pgm.get_schedule_map();\n\n\t\/\/ Create time space IR\n\tisl_union_set *time_space_representaion =\n\t\tcoli_create_time_space_representation(isl_union_set_copy(pgm.get_iteration_spaces()), isl_union_map_copy(schedule_map));\n\n\t\/\/ Generate code\n\tisl_ast_build *ast_build = isl_ast_build_alloc(ctx);\n\tisl_options_set_ast_build_atomic_upper_bound(ctx, 1);\n\tast_build = isl_ast_build_set_after_each_for(ast_build, &for_halide_code_generator_after_for, NULL);\n\tast_build = isl_ast_build_set_at_each_domain(ast_build, &stmt_halide_code_generator, NULL);\n\tisl_ast_node *program = isl_ast_build_node_from_schedule_map(ast_build, isl_union_map_copy(schedule_map));\n\tisl_ast_build_free(ast_build);\n\n\tif (DEBUG)\n\t\tisl_ast_node_dump_c_code(ctx, program);\n\n\tstd::vector<std::string> generated_stmts, iterators;\n\tHalide::Internal::Stmt halide_pgm = generate_Halide_stmt_from_isl_node(pgm, program, 0, generated_stmts, iterators);\n\n\t\/\/ Dump IRs\n\tpgm.dump_ISIR();\n\tpgm.dump_schedule();\n\tIF_DEBUG(coli_str_dump(\"\\n\\nTime Space IR:\\n\")); IF_DEBUG(isl_union_set_dump(time_space_representaion)); IF_DEBUG(coli_str_dump(\"\\n\\n\"));\n\thalide_IR_dump(halide_pgm);\n\n\n\tHalide::Target target;\n\ttarget.os = Halide::Target::OSX;\n\ttarget.arch = Halide::Target::X86;\n\ttarget.bits = 64;\n\tstd::vector<Halide::Target::Feature> x86_features;\n\tx86_features.push_back(Halide::Target::AVX);\n\tx86_features.push_back(Halide::Target::SSE41);\n\ttarget.set_features(x86_features);\n\n\n\n\tHalide::Module::Module m(\"test1\", target);\n\tm.append(Halide::Internal::LoweredFunc(\"test1\", args, halide_pgm, Halide::Internal::LoweredFunc::External));\n\n\tHalide::compile_module_to_object(m, \"LLVM_generated_code.o\");\n\n\treturn 0;\n}\n<commit_msg>Fix the probem of type of halide expressions<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\tisl_ctx *ctx = isl_ctx_alloc();\n\tIRProgram pgm(\"program0\");\n\tIRFunction fct(\"function0\", &pgm);\n\n\t\/\/ Declare the computations.  Each computation has: (1) a Halide expression,\n\t\/\/ (2) an isl set representing its iteration space and (3) is attached to a\n\t\/\/ function.\n\tComputation computation0(ctx, Halide::Expr((uint8_t) 3), \"{S0[i,j]: 0<=i<=1000 and 0<=j<=1000}\", &fct);\n\tComputation computation1(ctx, Halide::Expr((uint8_t) 5), \"{S1[i,j]: 0<=i<=1023 and 0<=j<=1023}\", &fct);\n\tComputation computation2(ctx, Halide::Expr((uint8_t) 7), \"{S2[i,j]: 0<=i<=1023 and 0<=j<=1023}\", &fct);\n\n\t\/\/ Create memory buffers, then map the computations to those buffers.\n\tHalide::Buffer buf(Halide::Int(8), 10, 10, 0, 0, NULL, \"buf\");\n\tfct.buffers_list.insert(std::pair<std::string, Halide::Buffer *>(buf.name(), &buf));\n\tHalide::Argument buffer_arg(\"buf\", Halide::Argument::OutputBuffer, Halide::Int(8), 2);\n\tstd::vector<Halide::Argument> args(1);\n\targs[0] = buffer_arg;\n\n\tcomputation0.SetAccess(\"{S0[i,j]->buf[i, j]}\");\n\tcomputation1.SetAccess(\"{S1[i,j]->buf[0, 3]}\");\n\tcomputation2.SetAccess(\"{S2[i,j]->buf[0, 0]}\");\n\n\n\t\/\/ Set the schedule of each computation.\n\tcomputation0.Tile(0,1,32,32);\n\tcomputation1.Schedule(\"{S1[i,j]->[2,i1,j1,i2,j3,j4]: i1=floor(i\/32) and j1=floor(j\/32) and i2=i and j3=floor(j\/4) and j4=j%4 and 0<=i<=1023 and 0<=j<=1023}\");\n\tcomputation2.Split(0, 32);\n\tcomputation2.Split(2, 32);\n\tcomputation2.Interchange(1, 2);\n\tpgm.tag_parallel_dimension(\"S0\", 1);\n\/\/\tpgm.tag_vector_dimension(\"S1\", 5);\n\n\tisl_union_map *schedule_map = pgm.get_schedule_map();\n\n\t\/\/ Create time space IR\n\tisl_union_set *time_space_representaion =\n\t\tcoli_create_time_space_representation(isl_union_set_copy(pgm.get_iteration_spaces()), isl_union_map_copy(schedule_map));\n\n\t\/\/ Generate code\n\tisl_ast_build *ast_build = isl_ast_build_alloc(ctx);\n\tisl_options_set_ast_build_atomic_upper_bound(ctx, 1);\n\tast_build = isl_ast_build_set_after_each_for(ast_build, &for_halide_code_generator_after_for, NULL);\n\tast_build = isl_ast_build_set_at_each_domain(ast_build, &stmt_halide_code_generator, NULL);\n\tisl_ast_node *program = isl_ast_build_node_from_schedule_map(ast_build, isl_union_map_copy(schedule_map));\n\tisl_ast_build_free(ast_build);\n\n\tif (DEBUG)\n\t\tisl_ast_node_dump_c_code(ctx, program);\n\n\tstd::vector<std::string> generated_stmts, iterators;\n\tHalide::Internal::Stmt halide_pgm = generate_Halide_stmt_from_isl_node(pgm, program, 0, generated_stmts, iterators);\n\n\t\/\/ Dump IRs\n\tpgm.dump_ISIR();\n\tpgm.dump_schedule();\n\tIF_DEBUG(coli_str_dump(\"\\n\\nTime Space IR:\\n\")); IF_DEBUG(isl_union_set_dump(time_space_representaion)); IF_DEBUG(coli_str_dump(\"\\n\\n\"));\n\thalide_IR_dump(halide_pgm);\n\n\n\tHalide::Target target;\n\ttarget.os = Halide::Target::OSX;\n\ttarget.arch = Halide::Target::X86;\n\ttarget.bits = 64;\n\tstd::vector<Halide::Target::Feature> x86_features;\n\tx86_features.push_back(Halide::Target::AVX);\n\tx86_features.push_back(Halide::Target::SSE41);\n\ttarget.set_features(x86_features);\n\n\n\n\tHalide::Module::Module m(\"test1\", target);\n\tm.append(Halide::Internal::LoweredFunc(\"test1\", args, halide_pgm, Halide::Internal::LoweredFunc::External));\n\n\tHalide::compile_module_to_object(m, \"LLVM_generated_code.o\");\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012 Steinwurf ApS\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 Steinwurf ApS 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 Steinwurf ApS 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#ifndef SAK_OBJECT_REGISTRY_HPP\n#define SAK_OBJECT_REGISTRY_HPP\n\n#include <map>\n\n#include <boost\/function.hpp>\n\n#include \"object_factory_impl.hpp\"\n\nnamespace sak\n{\n\n    \/\/\/ Object registry used to store factories to construct objects of\n    \/\/\/ the registered types.\n    class object_registry\n    {\n    private:\n\n        \/\/\/ The map associating an object id to an object factory\n        typedef std::map<object_id, boost::shared_ptr<object_factory> >\n            factory_map;\n\n        \/\/\/ The map associating an object id to an object factory\n        typedef std::map<object_id, boost::shared_ptr<object> >\n            object_map;\n\n    public:\n\n        \/\/\/ Constructor of the factory registry\n        object_registry()\n            { }\n\n        \/\/\/ @return a factory stored in the registry\n        template<class Factory>\n        boost::shared_ptr<Factory> get_factory()\n            {\n                auto factory_id = *get_object_id<Factory>();\n                auto factory = find(m_lookup_by_factory_id, factory_id);\n\n                assert(factory);\n\n                typedef object_factory_impl<Factory> factory_type;\n\n                auto factory_impl =\n                    boost::dynamic_pointer_cast<factory_type>(factory);\n\n                assert(factory_impl);\n                assert(factory_impl->m_factory);\n                return factory_impl->m_factory;\n            }\n\n        \/\/\/ Registers an object factory with the object registry\n        \/\/\/ Once a factory has been registered objects can be created\n        template<class Factory, class Object>\n        void set_factory()\n            {\n                auto factory_id = *get_object_id<Factory>();\n                auto object_id  = *get_object_id<Object>();\n\n                \/\/ Did you forget to make the id function in the class Factory?\n                assert(factory_id.m_id != object::id()->m_id);\n\n                \/\/ Did you forget to make the id function in the class Object?\n                assert(object_id.m_id != object::id()->m_id);\n\n                auto factory =\n                    boost::make_shared< object_factory_impl<Factory> >();\n\n                m_lookup_by_factory_id[factory_id] = factory;\n                m_lookup_by_object_id[object_id] = factory;\n            }\n\n        \/\/\/ Registers an object factory function with the object registry\n        \/\/\/ Once a factory function has been registered objects can be created\n        template<class Object>\n        void set_factory(const boost::function<boost::shared_ptr<Object>(\n                             object_registry &)> &function)\n            {\n                auto object_id = *get_object_id<Object>();\n\n                \/\/ Did you forget to make the id function in the class Object?\n                assert(object_id.m_id != object::id()->m_id);\n\n                auto factory =\n                    boost::make_shared< object_factory_function<Object> >(function);\n\n                m_lookup_by_object_id[object_id] = factory;\n            }\n\n        \/\/\/ Registers an object factory with the object registry. This methods\n        \/\/\/ can be used for factories with a non-standard build function.\n        \/\/\/ Users can call the get function and invoke the custom build function\n        template<class Object>\n        void set_object()\n            {\n                auto object_id = *get_object_id<Object>();\n\n                \/\/ Did you forget to make the id function in the class Factory?\n                assert(object_id.m_id != object::id()->m_id);\n\n                auto object = boost::make_shared<Object>();\n\n                m_lookup_by_shared_object_id[object_id] = object;\n            }\n\n        \/\/\/ @return a factory stored in the registry\n        template<class Object>\n        boost::shared_ptr<Object> get_object()\n            {\n                auto object_id = *get_object_id<Object>();\n                auto object = find(m_lookup_by_shared_object_id, object_id);\n\n                assert(object);\n                return boost::dynamic_pointer_cast<Object>(object);\n            }\n\n        \/\/\/ Clears all registered factories\n        void clear_factories()\n            {\n                m_lookup_by_factory_id.clear();\n                m_lookup_by_object_id.clear();\n            }\n\n        \/\/\/ @return an object created using the registered factories\n        template<class Object>\n        boost::shared_ptr<Object> build()\n            {\n                assert(has_object_id(m_lookup_by_object_id, *get_object_id<Object>() ));\n\n                auto factory = find(m_lookup_by_object_id, *get_object_id<Object>() );\n\n                assert(factory);\n\n                auto object = factory->build(*this);\n\n                return boost::dynamic_pointer_cast<Object>(object);\n            }\n\n    private:\n\n        \/\/\/ Checks if an object id is registered in a specific category\n        template<class Map>\n        bool has_object_id(const Map &map, const object_id &id) const\n            {\n                return map.find(id) != map.end();\n            }\n\n        \/*template<class Object>\n        object_id get_object_id() const\n            {\n                return *Object::id();\n            }*\/\n\n        \/\/\/ Finds and returns an object factory in the given map with a\n        \/\/\/ \"compatible\" object_id.\n        boost::shared_ptr<object_factory>\n        find(const factory_map &map, const object_id &id) const\n            {\n                assert(has_object_id(map,id));\n                return map.at(id);\n            }\n\n\n        \/\/\/ Finds and returns an object factory in the given map with a\n        \/\/\/ \"compatible\" object_id.\n        boost::shared_ptr<object>\n        find(const object_map &map, const object_id &id) const\n            {\n                assert(has_object_id(map,id));\n                return map.at(id);\n            }\n\n    private:\n\n        \/\/\/ Map allowing a factory to be found based on an object's object id\n        factory_map m_lookup_by_object_id;\n\n        \/\/\/ Map allowing a shared object to be found based on an object's object id\n        object_map m_lookup_by_shared_object_id;\n\n        \/\/\/ Map allowing a factory to be found based on a factory's object id\n        factory_map m_lookup_by_factory_id;\n\n    };\n\n    \/\/\/ Template must be specialized by all object classes used with the object registry\n    template<class Object> object_id* get_object_id();\n}\n\n#endif\n\n<commit_msg>template moved in front of registry<commit_after>\/\/ Copyright (c) 2012 Steinwurf ApS\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 Steinwurf ApS 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 Steinwurf ApS 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#ifndef SAK_OBJECT_REGISTRY_HPP\n#define SAK_OBJECT_REGISTRY_HPP\n\n#include <map>\n\n#include <boost\/function.hpp>\n\n#include \"object_factory_impl.hpp\"\n\nnamespace sak\n{\n\t\/\/\/ Template must be specialized by all object classes used with the object registry\n    template<class Object> object_id* get_object_id();\n\n    \/\/\/ Object registry used to store factories to construct objects of\n    \/\/\/ the registered types.\n    class object_registry\n    {\n    private:\n\n        \/\/\/ The map associating an object id to an object factory\n        typedef std::map<object_id, boost::shared_ptr<object_factory> >\n            factory_map;\n\n        \/\/\/ The map associating an object id to an object factory\n        typedef std::map<object_id, boost::shared_ptr<object> >\n            object_map;\n\n    public:\n\n        \/\/\/ Constructor of the factory registry\n        object_registry()\n            { }\n\n        \/\/\/ @return a factory stored in the registry\n        template<class Factory>\n        boost::shared_ptr<Factory> get_factory()\n            {\n                auto factory_id = *get_object_id<Factory>();\n                auto factory = find(m_lookup_by_factory_id, factory_id);\n\n                assert(factory);\n\n                typedef object_factory_impl<Factory> factory_type;\n\n                auto factory_impl =\n                    boost::dynamic_pointer_cast<factory_type>(factory);\n\n                assert(factory_impl);\n                assert(factory_impl->m_factory);\n                return factory_impl->m_factory;\n            }\n\n        \/\/\/ Registers an object factory with the object registry\n        \/\/\/ Once a factory has been registered objects can be created\n        template<class Factory, class Object>\n        void set_factory()\n            {\n                auto factory_id = *get_object_id<Factory>();\n                auto object_id  = *get_object_id<Object>();\n\n                \/\/ Did you forget to make the id function in the class Factory?\n                assert(factory_id.m_id != object::id()->m_id);\n\n                \/\/ Did you forget to make the id function in the class Object?\n                assert(object_id.m_id != object::id()->m_id);\n\n                auto factory =\n                    boost::make_shared< object_factory_impl<Factory> >();\n\n                m_lookup_by_factory_id[factory_id] = factory;\n                m_lookup_by_object_id[object_id] = factory;\n            }\n\n        \/\/\/ Registers an object factory function with the object registry\n        \/\/\/ Once a factory function has been registered objects can be created\n        template<class Object>\n        void set_factory(const boost::function<boost::shared_ptr<Object>(\n                             object_registry &)> &function)\n            {\n                auto object_id = *get_object_id<Object>();\n\n                \/\/ Did you forget to make the id function in the class Object?\n                assert(object_id.m_id != object::id()->m_id);\n\n                auto factory =\n                    boost::make_shared< object_factory_function<Object> >(function);\n\n                m_lookup_by_object_id[object_id] = factory;\n            }\n\n        \/\/\/ Registers an object factory with the object registry. This methods\n        \/\/\/ can be used for factories with a non-standard build function.\n        \/\/\/ Users can call the get function and invoke the custom build function\n        template<class Object>\n        void set_object()\n            {\n                auto object_id = *get_object_id<Object>();\n\n                \/\/ Did you forget to make the id function in the class Factory?\n                assert(object_id.m_id != object::id()->m_id);\n\n                auto object = boost::make_shared<Object>();\n\n                m_lookup_by_shared_object_id[object_id] = object;\n            }\n\n        \/\/\/ @return a factory stored in the registry\n        template<class Object>\n        boost::shared_ptr<Object> get_object()\n            {\n                auto object_id = *get_object_id<Object>();\n                auto object = find(m_lookup_by_shared_object_id, object_id);\n\n                assert(object);\n                return boost::dynamic_pointer_cast<Object>(object);\n            }\n\n        \/\/\/ Clears all registered factories\n        void clear_factories()\n            {\n                m_lookup_by_factory_id.clear();\n                m_lookup_by_object_id.clear();\n            }\n\n        \/\/\/ @return an object created using the registered factories\n        template<class Object>\n        boost::shared_ptr<Object> build()\n            {\n                assert(has_object_id(m_lookup_by_object_id, *get_object_id<Object>() ));\n\n                auto factory = find(m_lookup_by_object_id, *get_object_id<Object>() );\n\n                assert(factory);\n\n                auto object = factory->build(*this);\n\n                return boost::dynamic_pointer_cast<Object>(object);\n            }\n\n    private:\n\n        \/\/\/ Checks if an object id is registered in a specific category\n        template<class Map>\n        bool has_object_id(const Map &map, const object_id &id) const\n            {\n                return map.find(id) != map.end();\n            }\n\n        \/*template<class Object>\n        object_id get_object_id() const\n            {\n                return *Object::id();\n            }*\/\n\n        \/\/\/ Finds and returns an object factory in the given map with a\n        \/\/\/ \"compatible\" object_id.\n        boost::shared_ptr<object_factory>\n        find(const factory_map &map, const object_id &id) const\n            {\n                assert(has_object_id(map,id));\n                return map.at(id);\n            }\n\n\n        \/\/\/ Finds and returns an object factory in the given map with a\n        \/\/\/ \"compatible\" object_id.\n        boost::shared_ptr<object>\n        find(const object_map &map, const object_id &id) const\n            {\n                assert(has_object_id(map,id));\n                return map.at(id);\n            }\n\n    private:\n\n        \/\/\/ Map allowing a factory to be found based on an object's object id\n        factory_map m_lookup_by_object_id;\n\n        \/\/\/ Map allowing a shared object to be found based on an object's object id\n        object_map m_lookup_by_shared_object_id;\n\n        \/\/\/ Map allowing a factory to be found based on a factory's object id\n        factory_map m_lookup_by_factory_id;\n\n    };\n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include <Arduino.h>\n#include <HX711.h>\n\nHX711::HX711(byte dout, byte pd_sck, byte gain) {\n\tPD_SCK \t= pd_sck;\n\tDOUT \t= dout;\n\t\n\tpinMode(PD_SCK, OUTPUT);\n\tpinMode(DOUT, INPUT);\n\n\tset_gain(gain);\n}\n\nHX711::~HX711() {\n\n}\n\nbool HX711::is_ready() {\n\treturn digitalRead(DOUT) == LOW;\n}\n\nvoid HX711::set_gain(byte gain) {\n\tswitch (gain) {\n\t\tcase 128:\t\t\/\/ channel A, gain factor 128\n\t\t\tGAIN = 1;\n\t\t\tbreak;\n\t\tcase 64:\t\t\/\/ channel A, gain factor 64\n\t\t\tGAIN = 3;\n\t\t\tbreak;\n\t\tcase 32:\t\t\/\/ channel B, gain factor 32\n\t\t\tGAIN = 2;\n\t\t\tbreak;\n\t}\n\n\tdigitalWrite(PD_SCK, LOW);\n\tread();\n}\n\nlong HX711::read() {\n\t\/\/ wait for the chip to become ready\n\twhile (!is_ready());\n\n\tbyte data[3];\n\n\t\/\/ pulse the clock pin 24 times to read the data\n\tfor (byte j = 3; j--;) {\n\t\tfor (char i = 8; i--;) {\n\t\t\tdigitalWrite(PD_SCK, HIGH);\n\t\t\tbitWrite(data[j], i, digitalRead(DOUT));\n\t\t\tdigitalWrite(PD_SCK, LOW);\n\t\t}\n\t}\n\n\t\/\/ set the channel and the gain factor for the next reading using the clock pin\n\tfor (int i = 0; i < GAIN; i++) {\n\t\tdigitalWrite(PD_SCK, HIGH);\n\t\tdigitalWrite(PD_SCK, LOW);\n\t}\n\n\tdata[2] ^= 0x80;\n\n\treturn ((uint32_t) data[2] << 16) | ((uint32_t) data[1] << 8) | (uint32_t) data[0];\n}\n\nlong HX711::read_average(byte times) {\n\tlong sum = 0;\n\tfor (byte i = 0; i < times; i++) {\n\t\tsum += read();\n\t}\n\treturn sum \/ times;\n}\n\ndouble HX711::get_value(byte times) {\n\treturn read_average(times) - OFFSET;\n}\n\nfloat HX711::get_units(byte times) {\n\treturn get_value(times) \/ SCALE;\n}\n\nvoid HX711::tare(byte times) {\n\tdouble sum = read_average(times);\n\tset_offset(sum);\n}\n\nvoid HX711::set_scale(float scale) {\n\tSCALE = scale;\n}\n\nvoid HX711::set_offset(long offset) {\n\tOFFSET = offset;\n}\n\nvoid HX711::power_down() {\n\tdigitalWrite(PD_SCK, LOW);\n\tdigitalWrite(PD_SCK, HIGH);\t\n}\n\nvoid HX711::power_up() {\n\tdigitalWrite(PD_SCK, LOW);\t\n}<commit_msg>Unroll loop for performance and use Wiring API `shiftIn()`<commit_after>#include <Arduino.h>\n#include <HX711.h>\n\nHX711::HX711(byte dout, byte pd_sck, byte gain) {\n\tPD_SCK \t= pd_sck;\n\tDOUT \t= dout;\n\t\n\tpinMode(PD_SCK, OUTPUT);\n\tpinMode(DOUT, INPUT);\n\n\tset_gain(gain);\n}\n\nHX711::~HX711() {\n\n}\n\nbool HX711::is_ready() {\n\treturn digitalRead(DOUT) == LOW;\n}\n\nvoid HX711::set_gain(byte gain) {\n\tswitch (gain) {\n\t\tcase 128:\t\t\/\/ channel A, gain factor 128\n\t\t\tGAIN = 1;\n\t\t\tbreak;\n\t\tcase 64:\t\t\/\/ channel A, gain factor 64\n\t\t\tGAIN = 3;\n\t\t\tbreak;\n\t\tcase 32:\t\t\/\/ channel B, gain factor 32\n\t\t\tGAIN = 2;\n\t\t\tbreak;\n\t}\n\n\tdigitalWrite(PD_SCK, LOW);\n\tread();\n}\n\nlong HX711::read() {\n\t\/\/ wait for the chip to become ready\n\twhile (!is_ready());\n\n\tbyte data[3];\n\n\t\/\/ pulse the clock pin 24 times to read the data\n    data[2] = shiftIn(DOUT, PD_SCK, MSBFIRST);\n    data[1] = shiftIn(DOUT, PD_SCK, MSBFIRST);\n    data[0] = shiftIn(DOUT, PD_SCK, MSBFIRST);\n\n\t\/\/ set the channel and the gain factor for the next reading using the clock pin\n\tfor (int i = 0; i < GAIN; i++) {\n\t\tdigitalWrite(PD_SCK, HIGH);\n\t\tdigitalWrite(PD_SCK, LOW);\n\t}\n\n\tdata[2] ^= 0x80;\n\n\treturn ((uint32_t) data[2] << 16) | ((uint32_t) data[1] << 8) | (uint32_t) data[0];\n}\n\nlong HX711::read_average(byte times) {\n\tlong sum = 0;\n\tfor (byte i = 0; i < times; i++) {\n\t\tsum += read();\n\t}\n\treturn sum \/ times;\n}\n\ndouble HX711::get_value(byte times) {\n\treturn read_average(times) - OFFSET;\n}\n\nfloat HX711::get_units(byte times) {\n\treturn get_value(times) \/ SCALE;\n}\n\nvoid HX711::tare(byte times) {\n\tdouble sum = read_average(times);\n\tset_offset(sum);\n}\n\nvoid HX711::set_scale(float scale) {\n\tSCALE = scale;\n}\n\nvoid HX711::set_offset(long offset) {\n\tOFFSET = offset;\n}\n\nvoid HX711::power_down() {\n\tdigitalWrite(PD_SCK, LOW);\n\tdigitalWrite(PD_SCK, HIGH);\t\n}\n\nvoid HX711::power_up() {\n\tdigitalWrite(PD_SCK, LOW);\t\n}<|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\n#include \"winsock2.h\"\n\n\n#include <objbase.h>\n#include <initguid.h>\n#include <connmgr.h>\n#include <wininet.h>\n\n#include \"http\/GPRSConnection.h\"\n#include \"base\/Log.h\"\n\n\n\/*\n* Method to test if connection is alive. If no one is found, it tries to establish\n* default connection.\n*\/\n\nBOOL EstablishConnection() {\n\n    HANDLE  phWebConnection = NULL;\n\n    \/\/ First we check if we might have a connection\n    DWORD  pdwStatus = 0;\n    LOG.debug(\"Establish connection: test internet connection status...\");\n    ConnMgrConnectionStatus(phWebConnection, &pdwStatus);\n\n    if (pdwStatus == CONNMGR_STATUS_CONNECTED) {\n        LOG.info(\"Already connected\");\n        \/\/We are already connected!\n        return TRUE;\n    } \n#if _WIN32_WCE > 0x500     \n    else if (pdwStatus == CONNMGR_STATUS_PHONEOFF) {\n        LOG.info(\"phone off\");\n        \/\/We are already connected!\n        return FALSE;\n    }\n#endif\n    else {\n        LOG.debug(\"Not connected: try to connect...\");\n        \/\/We are not connected, so lets try:\n        \/\/The CONNECTIONINFO is the structure that\n        \/\/tells Connection Manager how we want\n        \/\/to connect\n\n        CONNMGR_CONNECTIONINFO sConInfo;\n        memset(&sConInfo,0, sizeof(CONNMGR_CONNECTIONINFO));\n        sConInfo.cbSize = sizeof(CONNMGR_CONNECTIONINFO);\n        \/\/ We want to use the \"guidDestNet\" parameter\n        sConInfo.dwParams = CONNMGR_PARAM_GUIDDESTNET;\n        \/\/ This is the highest data priority.\n        sConInfo.dwPriority = CONNMGR_PRIORITY_USERINTERACTIVE;\n        \/\/ sConInfo.dwFlags = 0;\n        sConInfo.dwFlags=CONNMGR_FLAG_PROXY_HTTP;\n        \/\/ Lets be nice and share the connection with\n        \/\/ other applications\n        sConInfo.bExclusive = FALSE;\n        sConInfo.bDisabled = FALSE;\n        sConInfo.guidDestNet = IID_DestNetInternet;\n        LOG.debug(\"Try to establish connection...\");\n        if (ConnMgrEstablishConnection(&sConInfo,&phWebConnection) == S_OK) {\n            LOG.debug(\"Start internet connection process...\");\n            \/\/We start successfully process!\n            for (unsigned int k = 0; k < 6; k++) {\n                ConnMgrConnectionStatus(phWebConnection,&pdwStatus);\n\n                if (pdwStatus == CONNMGR_STATUS_CONNECTED) {\n                    LOG.info(\"Internet connection succesfully completed.\");\n                    return TRUE;\n\n                }\n                else {\n                    if (pdwStatus == CONNMGR_STATUS_CONNECTIONCANCELED || pdwStatus == CONNMGR_STATUS_WAITINGCONNECTIONABORT) {\n                        LOG.debug(\"Internet connection not succeded.\");\n                        return FALSE;\n\n                    }\n                    Sleep(2000);\n\n                    ConnMgrConnectionStatus(phWebConnection,&pdwStatus);\n                    if (pdwStatus == CONNMGR_STATUS_WAITINGCONNECTION) {\n                        \/\/ it is possible to do something...\n                    }\n\n                    if (pdwStatus == CONNMGR_STATUS_CONNECTIONCANCELED || pdwStatus == CONNMGR_STATUS_WAITINGCONNECTIONABORT) {\n                        LOG.debug(\"Internet connection not succeded\");\n                        return FALSE;\n                    }\n                }\n            }\n            LOG.debug(\"Internet connection not succeded after connection process\");\n            return FALSE;\n        }\n        else {\n            \/\/Connection failed!\n            LOG.info(\"Internet connection failed.\");\n            return FALSE;\n\n        }\n\n    }\n\n}\n<commit_msg>just changed some logging<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\n#include \"winsock2.h\"\n\n\n#include <objbase.h>\n#include <initguid.h>\n#include <connmgr.h>\n#include <wininet.h>\n\n#include \"http\/GPRSConnection.h\"\n#include \"base\/Log.h\"\n\n\n\/*\n* Method to test if connection is alive. If no one is found, it tries to establish\n* default connection.\n*\/\n\nBOOL EstablishConnection() {\n\n    HANDLE  phWebConnection = NULL;\n\n    \/\/ First we check if we might have a connection\n    DWORD  pdwStatus = 0;\n    LOG.debug(\"Establish connection: test internet connection status...\");\n    ConnMgrConnectionStatus(phWebConnection, &pdwStatus);\n\n    if (pdwStatus == CONNMGR_STATUS_CONNECTED) {\n        LOG.info(\"Already connected\");\n        \/\/We are already connected!\n        return TRUE;\n    } \n#if _WIN32_WCE > 0x500     \n    else if (pdwStatus == CONNMGR_STATUS_PHONEOFF) {\n        LOG.info(\"phone off\");\n        \/\/We are already connected!\n        return FALSE;\n    }\n#endif\n    else {\n        LOG.debug(\"Not connected (status = 0x%02x): try to connect...\", pdwStatus);\n        \/\/We are not connected, so lets try:\n        \/\/The CONNECTIONINFO is the structure that\n        \/\/tells Connection Manager how we want\n        \/\/to connect\n\n        CONNMGR_CONNECTIONINFO sConInfo;\n        memset(&sConInfo,0, sizeof(CONNMGR_CONNECTIONINFO));\n        sConInfo.cbSize = sizeof(CONNMGR_CONNECTIONINFO);\n        \/\/ We want to use the \"guidDestNet\" parameter\n        sConInfo.dwParams = CONNMGR_PARAM_GUIDDESTNET;\n        \/\/ This is the highest data priority.\n        sConInfo.dwPriority = CONNMGR_PRIORITY_USERINTERACTIVE;\n        \/\/ sConInfo.dwFlags = 0;\n        sConInfo.dwFlags=CONNMGR_FLAG_PROXY_HTTP;\n        \/\/ Lets be nice and share the connection with\n        \/\/ other applications\n        sConInfo.bExclusive = FALSE;\n        sConInfo.bDisabled = FALSE;\n        sConInfo.guidDestNet = IID_DestNetInternet;\n        LOG.debug(\"Try to establish connection...\");\n        if (ConnMgrEstablishConnection(&sConInfo,&phWebConnection) == S_OK) {\n            LOG.debug(\"Start internet connection process...\");\n            \/\/We start successfully process!\n            for (unsigned int k = 0; k < 6; k++) {\n                ConnMgrConnectionStatus(phWebConnection,&pdwStatus);\n\n                if (pdwStatus == CONNMGR_STATUS_CONNECTED) {\n                    LOG.info(\"Internet connection succesfully completed.\");\n                    return TRUE;\n\n                }\n                else {\n                    if (pdwStatus == CONNMGR_STATUS_CONNECTIONCANCELED || pdwStatus == CONNMGR_STATUS_WAITINGCONNECTIONABORT) {\n                        LOG.debug(\"Internet connection not succeded.\");\n                        return FALSE;\n\n                    }\n                    Sleep(2000);\n\n                    ConnMgrConnectionStatus(phWebConnection,&pdwStatus);\n                    if (pdwStatus == CONNMGR_STATUS_WAITINGCONNECTION) {\n                        \/\/ it is possible to do something...\n                    }\n\n                    if (pdwStatus == CONNMGR_STATUS_CONNECTIONCANCELED || pdwStatus == CONNMGR_STATUS_WAITINGCONNECTIONABORT) {\n                        LOG.debug(\"Internet connection not succeded\");\n                        return FALSE;\n                    }\n                }\n            }\n            LOG.debug(\"Internet connection not succeded after connection process\");\n            return FALSE;\n        }\n        else {\n            \/\/Connection failed!\n            LOG.info(\"Internet connection failed.\");\n            return FALSE;\n\n        }\n\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (C) 2005-2011, 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 \"mumble_pch.hpp\"\n\n#include \"VersionCheck.h\"\n\n#include \"Global.h\"\n#include \"MainWindow.h\"\n#include \"WebFetch.h\"\n\nVersionCheck::VersionCheck(bool autocheck, QObject *p, bool focus) : QObject(p) {\n\tbSilent = autocheck;\n\n\tQUrl url;\n\turl.setPath(focus ? QLatin1String(\"\/v1\/banner\") : QLatin1String(\"\/v1\/version-check\"));\n\n\tQList<QPair<QString, QString> > queryItems;\n\tqueryItems << qMakePair(QString::fromLatin1(\"ver\"), QString::fromLatin1(QUrl::toPercentEncoding(QLatin1String(MUMBLE_RELEASE))));\n#if defined(Q_OS_WIN)\n# if defined(Q_OS_WIN64)\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"WinX64\"));\n# else\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"Win32\"));\n# endif\n#elif defined(Q_OS_MAC)\n# if defined(USE_MAC_UNIVERSAL)\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"MacOSX-Universal\"));\n# else\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"MacOSX\"));\n# endif\n#else\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"Unix\"));\n#endif\n\tif (! g.s.bUsage)\n\t\tqueryItems << qMakePair(QString::fromLatin1(\"nousage\"), QString::fromLatin1(\"1\"));\n\tif (autocheck)\n\t\tqueryItems << qMakePair(QString::fromLatin1(\"auto\"), QString::fromLatin1(\"1\"));\n\n\tqueryItems << qMakePair(QString::fromLatin1(\"locale\"), g.s.qsLanguage.isEmpty() ? QLocale::system().name() : g.s.qsLanguage);\n\n\tQFile f(qApp->applicationFilePath());\n\tif (! f.open(QIODevice::ReadOnly)) {\n\t\tqWarning(\"VersionCheck: Failed to open binary\");\n\t} else {\n\t\tQByteArray a = f.readAll();\n\t\tif (a.size() < 1) {\n\t\t\tqWarning(\"VersionCheck: suspiciously small binary\");\n\t\t} else {\n\t\t\tQCryptographicHash qch(QCryptographicHash::Sha1);\n\t\t\tqch.addData(a);\n\t\t\tqueryItems << qMakePair(QString::fromLatin1(\"sha1\"), QString::fromLatin1(qch.result().toHex()));\n\t\t}\n\t}\n\n#if QT_VERSION >= 0x050000\n\tQUrlQuery query;\n\tquery.setQueryItems(queryItems);\n\turl.setQuery(query);\n#else\n\tfor (int i = 0; i < queryItems.size(); i++) {\n\t\tconst QPair<QString, QString> &queryPair = queryItems.at(i);\n\t\turl.addQueryItem(queryPair.first, queryPair.second);\n\t}\n#endif\n\tWebFetch::fetch(QLatin1String(\"update\"), url, this, SLOT(fetched(QByteArray,QUrl)));\n}\n\nvoid VersionCheck::fetched(QByteArray a, QUrl url) {\n\tif (! a.isNull()) {\n\t\tif (! a.isEmpty()) {\n#ifdef SNAPSHOT_BUILD\n\t\t\tif (url.path() == QLatin1String(\"\/v1\/banner\")) {\n\t\t\t\tg.mw->msgBox(QString::fromUtf8(a));\n\t\t\t} else if (url.path() == QLatin1String(\"\/v1\/version-check\")) {\n#ifndef Q_OS_WIN\n\t\t\t\tg.mw->msgBox(QString::fromUtf8(a));\n#else\n\t\t\t\tQDomDocument qdd;\n\t\t\t\tqdd.setContent(a);\n\n\t\t\t\tQDomElement elem = qdd.firstChildElement(QLatin1String(\"p\"));\n\t\t\t\telem = elem.firstChildElement(QLatin1String(\"a\"));\n\n\t\t\t\tQUrl fetch = QUrl(elem.attribute(QLatin1String(\"href\")));\n\t\t\t\tfetch.setHost(QString());\n\t\t\t\tfetch.setScheme(QString());\n\t\t\t\tif (! fetch.isValid()) {\n\t\t\t\t\tg.mw->msgBox(QString::fromUtf8(a));\n\t\t\t\t} else {\n\t\t\t\t\tQString filename = g.qdBasePath.absoluteFilePath(QLatin1String(\"Snapshots\/\") + QFileInfo(fetch.path()).fileName());\n\n\t\t\t\t\tQFile qf(filename);\n\t\t\t\t\tif (qf.exists()) {\n\t\t\t\t\t\tstd::wstring native = QDir::toNativeSeparators(filename).toStdWString();\n\n\t\t\t\t\t\tWINTRUST_FILE_INFO file;\n\t\t\t\t\t\tZeroMemory(&file, sizeof(file));\n\t\t\t\t\t\tfile.cbStruct = sizeof(file);\n\t\t\t\t\t\tfile.pcwszFilePath = native.c_str();\n\n\t\t\t\t\t\tWINTRUST_DATA data;\n\t\t\t\t\t\tZeroMemory(&data, sizeof(data));\n\t\t\t\t\t\tdata.cbStruct = sizeof(data);\n\t\t\t\t\t\tdata.dwUIChoice = WTD_UI_NONE;\n\t\t\t\t\t\tdata.fdwRevocationChecks = WTD_REVOKE_NONE;\n\t\t\t\t\t\tdata.dwUnionChoice = WTD_CHOICE_FILE;\n\t\t\t\t\t\tdata.pFile = &file;\n\t\t\t\t\t\tdata.dwProvFlags = WTD_SAFER_FLAG | WTD_USE_DEFAULT_OSVER_CHECK | WTD_LIFETIME_SIGNING_FLAG;\n\t\t\t\t\t\tdata.dwUIContext = WTD_UICONTEXT_INSTALL;\n\n\t\t\t\t\t\tstatic GUID guid = WINTRUST_ACTION_GENERIC_VERIFY_V2;\n\n\t\t\t\t\t\tLONG ts = WinVerifyTrust(0, &guid , &data);\n\n\t\t\t\t\t\tif (ts == 0) {\n\t\t\t\t\t\t\tif (QMessageBox::question(g.mw,\n\t\t\t\t\t\t\t                          tr(\"Upgrade Mumble\"),\n\t\t\t\t\t\t\t                          tr(\"A new version of Mumble has been detected and automatically downloaded. It is recommended that you either upgrade to this version, or downgrade to the latest stable release. Do you want to launch the installer now?\"),\n\t\t\t\t\t\t\t                          QMessageBox::Yes | QMessageBox::No, QMessageBox::Yes) == QMessageBox::Yes) {\n\t\t\t\t\t\t\t\tSHELLEXECUTEINFOW execinfo;\n\t\t\t\t\t\t\t\tstd::wstring filenative = filename.toStdWString();\n\t\t\t\t\t\t\t\tstd::wstring dirnative = QDir::toNativeSeparators(QDir::tempPath()).toStdWString();\n\t\t\t\t\t\t\t\tZeroMemory(&execinfo, sizeof(execinfo));\n\t\t\t\t\t\t\t\texecinfo.cbSize = sizeof(execinfo);\n\t\t\t\t\t\t\t\texecinfo.lpFile = filenative.c_str();\n\t\t\t\t\t\t\t\texecinfo.lpDirectory = dirnative.c_str();\n\t\t\t\t\t\t\t\texecinfo.nShow = SW_NORMAL;\n\n\t\t\t\t\t\t\t\tif (ShellExecuteExW(&execinfo)) {\n\t\t\t\t\t\t\t\t\tg.mw->bSuppressAskOnQuit = true;\n\t\t\t\t\t\t\t\t\tqApp->closeAllWindows();\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tg.mw->msgBox(tr(\"Failed to launch snapshot installer.\"));\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tg.mw->msgBox(tr(\"Corrupt download of new version detected. Automatically removed.\"));\n\t\t\t\t\t\t\tqf.remove();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Delete all but the N most recent snapshots\n\t\t\t\t\t\tsize_t numberOfSnapshotsToKeep = 1;\n\n\t\t\t\t\t\tQDir snapdir(g.qdBasePath.absolutePath() + QLatin1String(\"\/Snapshots\/\"),\n\t\t\t\t\t\t             QString(),\n\t\t\t\t\t\t             QDir::Name,\n\t\t\t\t\t\t             QDir::Files);\n\n\t\t\t\t\t\tforeach(const QFileInfo fileInfo, snapdir.entryInfoList(QStringList(), QDir::NoFilter, QDir::Time)) {\n\t\t\t\t\t\t\tif (numberOfSnapshotsToKeep) {\n\t\t\t\t\t\t\t\t--numberOfSnapshotsToKeep;\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tqWarning() << \"Purging old snapshot\" << fileInfo.fileName();\n\t\t\t\t\t\t\tQFile file(fileInfo.absoluteFilePath());\n\t\t\t\t\t\t\tfile.remove();\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tg.mw->msgBox(tr(\"Downloading new snapshot from %1 to %2\").arg(Qt::escape(fetch.toString()), Qt::escape(filename)));\n\t\t\t\t\t\tWebFetch::fetch(fetch, this, SLOT(fetched(QByteArray,QUrl)));\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tQString filename = g.qdBasePath.absoluteFilePath(QLatin1String(\"Snapshots\/\") + QFileInfo(url.path()).fileName());\n\n\t\t\t\tQFile qf(filename);\n\t\t\t\tif (qf.open(QIODevice::WriteOnly)) {\n\t\t\t\t\tqf.write(a);\n\t\t\t\t\tqf.close();\n\t\t\t\t\tnew VersionCheck(true, g.mw);\n\t\t\t\t} else {\n\t\t\t\t\tg.mw->msgBox(tr(\"Failed to write new version to disk.\"));\n\t\t\t\t}\n#endif\n\t\t\t}\n#else\n\t\t\tQ_UNUSED(url);\n\t\t\tg.mw->msgBox(QString::fromUtf8(a));\n#endif\n\t\t}\n\t} else if (bSilent) {\n\t\tg.mw->msgBox(tr(\"Mumble failed to retrieve version information from the central server.\"));\n\t}\n\n\tdeleteLater();\n}\n<commit_msg>VersionCheck: use updated WebFetch::fetch() for snapshot downloads.<commit_after>\/* Copyright (C) 2005-2011, 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 \"mumble_pch.hpp\"\n\n#include \"VersionCheck.h\"\n\n#include \"Global.h\"\n#include \"MainWindow.h\"\n#include \"WebFetch.h\"\n\nVersionCheck::VersionCheck(bool autocheck, QObject *p, bool focus) : QObject(p) {\n\tbSilent = autocheck;\n\n\tQUrl url;\n\turl.setPath(focus ? QLatin1String(\"\/v1\/banner\") : QLatin1String(\"\/v1\/version-check\"));\n\n\tQList<QPair<QString, QString> > queryItems;\n\tqueryItems << qMakePair(QString::fromLatin1(\"ver\"), QString::fromLatin1(QUrl::toPercentEncoding(QLatin1String(MUMBLE_RELEASE))));\n#if defined(Q_OS_WIN)\n# if defined(Q_OS_WIN64)\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"WinX64\"));\n# else\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"Win32\"));\n# endif\n#elif defined(Q_OS_MAC)\n# if defined(USE_MAC_UNIVERSAL)\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"MacOSX-Universal\"));\n# else\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"MacOSX\"));\n# endif\n#else\n\tqueryItems << qMakePair(QString::fromLatin1(\"os\"), QString::fromLatin1(\"Unix\"));\n#endif\n\tif (! g.s.bUsage)\n\t\tqueryItems << qMakePair(QString::fromLatin1(\"nousage\"), QString::fromLatin1(\"1\"));\n\tif (autocheck)\n\t\tqueryItems << qMakePair(QString::fromLatin1(\"auto\"), QString::fromLatin1(\"1\"));\n\n\tqueryItems << qMakePair(QString::fromLatin1(\"locale\"), g.s.qsLanguage.isEmpty() ? QLocale::system().name() : g.s.qsLanguage);\n\n\tQFile f(qApp->applicationFilePath());\n\tif (! f.open(QIODevice::ReadOnly)) {\n\t\tqWarning(\"VersionCheck: Failed to open binary\");\n\t} else {\n\t\tQByteArray a = f.readAll();\n\t\tif (a.size() < 1) {\n\t\t\tqWarning(\"VersionCheck: suspiciously small binary\");\n\t\t} else {\n\t\t\tQCryptographicHash qch(QCryptographicHash::Sha1);\n\t\t\tqch.addData(a);\n\t\t\tqueryItems << qMakePair(QString::fromLatin1(\"sha1\"), QString::fromLatin1(qch.result().toHex()));\n\t\t}\n\t}\n\n#if QT_VERSION >= 0x050000\n\tQUrlQuery query;\n\tquery.setQueryItems(queryItems);\n\turl.setQuery(query);\n#else\n\tfor (int i = 0; i < queryItems.size(); i++) {\n\t\tconst QPair<QString, QString> &queryPair = queryItems.at(i);\n\t\turl.addQueryItem(queryPair.first, queryPair.second);\n\t}\n#endif\n\tWebFetch::fetch(QLatin1String(\"update\"), url, this, SLOT(fetched(QByteArray,QUrl)));\n}\n\nvoid VersionCheck::fetched(QByteArray a, QUrl url) {\n\tif (! a.isNull()) {\n\t\tif (! a.isEmpty()) {\n#ifdef SNAPSHOT_BUILD\n\t\t\tif (url.path() == QLatin1String(\"\/v1\/banner\")) {\n\t\t\t\tg.mw->msgBox(QString::fromUtf8(a));\n\t\t\t} else if (url.path() == QLatin1String(\"\/v1\/version-check\")) {\n#ifndef Q_OS_WIN\n\t\t\t\tg.mw->msgBox(QString::fromUtf8(a));\n#else\n\t\t\t\tQDomDocument qdd;\n\t\t\t\tqdd.setContent(a);\n\n\t\t\t\tQDomElement elem = qdd.firstChildElement(QLatin1String(\"p\"));\n\t\t\t\telem = elem.firstChildElement(QLatin1String(\"a\"));\n\n\t\t\t\tQUrl fetch = QUrl(elem.attribute(QLatin1String(\"href\")));\n\t\t\t\tfetch.setHost(QString());\n\t\t\t\tfetch.setScheme(QString());\n\t\t\t\tif (! fetch.isValid()) {\n\t\t\t\t\tg.mw->msgBox(QString::fromUtf8(a));\n\t\t\t\t} else {\n\t\t\t\t\tQString filename = g.qdBasePath.absoluteFilePath(QLatin1String(\"Snapshots\/\") + QFileInfo(fetch.path()).fileName());\n\n\t\t\t\t\tQFile qf(filename);\n\t\t\t\t\tif (qf.exists()) {\n\t\t\t\t\t\tstd::wstring native = QDir::toNativeSeparators(filename).toStdWString();\n\n\t\t\t\t\t\tWINTRUST_FILE_INFO file;\n\t\t\t\t\t\tZeroMemory(&file, sizeof(file));\n\t\t\t\t\t\tfile.cbStruct = sizeof(file);\n\t\t\t\t\t\tfile.pcwszFilePath = native.c_str();\n\n\t\t\t\t\t\tWINTRUST_DATA data;\n\t\t\t\t\t\tZeroMemory(&data, sizeof(data));\n\t\t\t\t\t\tdata.cbStruct = sizeof(data);\n\t\t\t\t\t\tdata.dwUIChoice = WTD_UI_NONE;\n\t\t\t\t\t\tdata.fdwRevocationChecks = WTD_REVOKE_NONE;\n\t\t\t\t\t\tdata.dwUnionChoice = WTD_CHOICE_FILE;\n\t\t\t\t\t\tdata.pFile = &file;\n\t\t\t\t\t\tdata.dwProvFlags = WTD_SAFER_FLAG | WTD_USE_DEFAULT_OSVER_CHECK | WTD_LIFETIME_SIGNING_FLAG;\n\t\t\t\t\t\tdata.dwUIContext = WTD_UICONTEXT_INSTALL;\n\n\t\t\t\t\t\tstatic GUID guid = WINTRUST_ACTION_GENERIC_VERIFY_V2;\n\n\t\t\t\t\t\tLONG ts = WinVerifyTrust(0, &guid , &data);\n\n\t\t\t\t\t\tif (ts == 0) {\n\t\t\t\t\t\t\tif (QMessageBox::question(g.mw,\n\t\t\t\t\t\t\t                          tr(\"Upgrade Mumble\"),\n\t\t\t\t\t\t\t                          tr(\"A new version of Mumble has been detected and automatically downloaded. It is recommended that you either upgrade to this version, or downgrade to the latest stable release. Do you want to launch the installer now?\"),\n\t\t\t\t\t\t\t                          QMessageBox::Yes | QMessageBox::No, QMessageBox::Yes) == QMessageBox::Yes) {\n\t\t\t\t\t\t\t\tSHELLEXECUTEINFOW execinfo;\n\t\t\t\t\t\t\t\tstd::wstring filenative = filename.toStdWString();\n\t\t\t\t\t\t\t\tstd::wstring dirnative = QDir::toNativeSeparators(QDir::tempPath()).toStdWString();\n\t\t\t\t\t\t\t\tZeroMemory(&execinfo, sizeof(execinfo));\n\t\t\t\t\t\t\t\texecinfo.cbSize = sizeof(execinfo);\n\t\t\t\t\t\t\t\texecinfo.lpFile = filenative.c_str();\n\t\t\t\t\t\t\t\texecinfo.lpDirectory = dirnative.c_str();\n\t\t\t\t\t\t\t\texecinfo.nShow = SW_NORMAL;\n\n\t\t\t\t\t\t\t\tif (ShellExecuteExW(&execinfo)) {\n\t\t\t\t\t\t\t\t\tg.mw->bSuppressAskOnQuit = true;\n\t\t\t\t\t\t\t\t\tqApp->closeAllWindows();\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tg.mw->msgBox(tr(\"Failed to launch snapshot installer.\"));\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tg.mw->msgBox(tr(\"Corrupt download of new version detected. Automatically removed.\"));\n\t\t\t\t\t\t\tqf.remove();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Delete all but the N most recent snapshots\n\t\t\t\t\t\tsize_t numberOfSnapshotsToKeep = 1;\n\n\t\t\t\t\t\tQDir snapdir(g.qdBasePath.absolutePath() + QLatin1String(\"\/Snapshots\/\"),\n\t\t\t\t\t\t             QString(),\n\t\t\t\t\t\t             QDir::Name,\n\t\t\t\t\t\t             QDir::Files);\n\n\t\t\t\t\t\tforeach(const QFileInfo fileInfo, snapdir.entryInfoList(QStringList(), QDir::NoFilter, QDir::Time)) {\n\t\t\t\t\t\t\tif (numberOfSnapshotsToKeep) {\n\t\t\t\t\t\t\t\t--numberOfSnapshotsToKeep;\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tqWarning() << \"Purging old snapshot\" << fileInfo.fileName();\n\t\t\t\t\t\t\tQFile file(fileInfo.absoluteFilePath());\n\t\t\t\t\t\t\tfile.remove();\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tg.mw->msgBox(tr(\"Downloading new snapshot from %1 to %2\").arg(Qt::escape(fetch.toString()), Qt::escape(filename)));\n\t\t\t\t\t\tWebFetch::fetch(QLatin1String(\"dl\"), fetch, this, SLOT(fetched(QByteArray,QUrl)));\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tQString filename = g.qdBasePath.absoluteFilePath(QLatin1String(\"Snapshots\/\") + QFileInfo(url.path()).fileName());\n\n\t\t\t\tQFile qf(filename);\n\t\t\t\tif (qf.open(QIODevice::WriteOnly)) {\n\t\t\t\t\tqf.write(a);\n\t\t\t\t\tqf.close();\n\t\t\t\t\tnew VersionCheck(true, g.mw);\n\t\t\t\t} else {\n\t\t\t\t\tg.mw->msgBox(tr(\"Failed to write new version to disk.\"));\n\t\t\t\t}\n#endif\n\t\t\t}\n#else\n\t\t\tQ_UNUSED(url);\n\t\t\tg.mw->msgBox(QString::fromUtf8(a));\n#endif\n\t\t}\n\t} else if (bSilent) {\n\t\tg.mw->msgBox(tr(\"Mumble failed to retrieve version information from the central server.\"));\n\t}\n\n\tdeleteLater();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Image.h\"\n\nnamespace hm\n{\n\tImage::Image()\n\t{\n\t\t\n\t}\n\n\tImage::Image(std::string filename, SDL_Renderer* renderer)\n\t{\n\t\tloadImage(filename, renderer);\n\t}\n\n\tvoid Image::loadImage(std::string filename, SDL_Renderer* renderer)\n\t{\n\t\t\/\/ Unload a previous image.\n\t\tif(texture != nullptr)\n\t\t{\n\t\t\tSDL_DestroyTexture(texture);\n\t\t\ttexture = nullptr;\n\t\t}\n\n\t\tSDL_Surface* surface = IMG_Load(filename.c_str());\n\t\t\n\t\t\/\/ Check if it was loaded.\n\t\tif(surface == NULL)\n\t\t{\n\t\t\tstd::cout << \"Could not open \" << filename << std::endl;\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t\/\/ Color key surface\n\t\tUint32 key = SDL_MapRGB(surface->format, 0xFF, 0x00, 0xFF);\n\t\tSDL_SetColorKey(surface, SDL_TRUE, key);\n\t\t\n\t\t\/\/ Convert to texture.\n\t\ttexture = SDL_CreateTextureFromSurface(renderer, surface);\n\t\tSDL_FreeSurface(surface);\n\t\tsurface = nullptr;\n\t\t\n\t\t\/\/ Get dimensions.\n\t\tSDL_QueryTexture(texture, nullptr, nullptr, &info.w, &info.h);\n\n\t\treturn;\n\t}\n\n\tvoid Image::setColorKey(Uint8 r, Uint8 g, Uint8 b)\n\t{\n\t\tcolor_key = { r, g, b, 0 };\n\t\treturn;\n\t}\n}\n<commit_msg>Make it more obvious that a file name should follow.<commit_after>#include \"Image.h\"\n\nnamespace hm\n{\n\tImage::Image()\n\t{\n\t\t\n\t}\n\n\tImage::Image(std::string filename, SDL_Renderer* renderer)\n\t{\n\t\tloadImage(filename, renderer);\n\t}\n\n\tvoid Image::loadImage(std::string filename, SDL_Renderer* renderer)\n\t{\n\t\t\/\/ Unload a previous image.\n\t\tif(texture != nullptr)\n\t\t{\n\t\t\tSDL_DestroyTexture(texture);\n\t\t\ttexture = nullptr;\n\t\t}\n\n\t\tSDL_Surface* surface = IMG_Load(filename.c_str());\n\t\t\n\t\t\/\/ Check if it was loaded.\n\t\tif(surface == NULL)\n\t\t{\n\t\t\tstd::cout << \"Could not open image: \" << filename << std::endl;\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t\/\/ Color key surface\n\t\tUint32 key = SDL_MapRGB(surface->format, 0xFF, 0x00, 0xFF);\n\t\tSDL_SetColorKey(surface, SDL_TRUE, key);\n\t\t\n\t\t\/\/ Convert to texture.\n\t\ttexture = SDL_CreateTextureFromSurface(renderer, surface);\n\t\tSDL_FreeSurface(surface);\n\t\tsurface = nullptr;\n\t\t\n\t\t\/\/ Get dimensions.\n\t\tSDL_QueryTexture(texture, nullptr, nullptr, &info.w, &info.h);\n\n\t\treturn;\n\t}\n\n\tvoid Image::setColorKey(Uint8 r, Uint8 g, Uint8 b)\n\t{\n\t\tcolor_key = { r, g, b, 0 };\n\t\treturn;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2011 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 \"passive_aggressive_2.hpp\"\n\n#include <algorithm>\n#include <string>\n\nusing std::string;\n\nnamespace jubatus {\nnamespace classifier {\n\npassive_aggressive_2::passive_aggressive_2(storage::storage_base* storage)\n    : classifier_base(storage) {\n}\n\npassive_aggressive_2::passive_aggressive_2(\n    const classifier_config& config,\n    storage::storage_base* storage)\n    : classifier_base(storage) {\n}\n\nvoid passive_aggressive_2::train(const sfv_t& sfv, const string& label) {\n  string incorrect_label;\n  float margin = calc_margin(sfv, label, incorrect_label);\n  float loss = 1.f + margin;\n\n  if (loss < 0.f) {\n    return;\n  }\n  float sfv_norm = squared_norm(sfv);\n  if (sfv_norm == 0.f) {\n    return;\n  }\n  update_weight(\n      sfv, loss \/ (2 * sfv_norm + 1 \/ (2 * config.C)), label, incorrect_label);\n}\n\nstring passive_aggressive_2::name() const {\n  return string(\"passive_aggressive_2\");\n}\n\n}  \/\/ namespace classifier\n}  \/\/ namespace jubatus\n<commit_msg>fix passive_aggressive_2 to use config<commit_after>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2011 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 \"passive_aggressive_2.hpp\"\n\n#include <algorithm>\n#include <string>\n\nusing std::string;\n\nnamespace jubatus {\nnamespace classifier {\n\npassive_aggressive_2::passive_aggressive_2(storage::storage_base* storage)\n    : classifier_base(storage) {\n}\n\npassive_aggressive_2::passive_aggressive_2(\n    const classifier_config& config,\n    storage::storage_base* storage)\n    : classifier_base(storage),\n      config(config) {\n}\n\nvoid passive_aggressive_2::train(const sfv_t& sfv, const string& label) {\n  string incorrect_label;\n  float margin = calc_margin(sfv, label, incorrect_label);\n  float loss = 1.f + margin;\n\n  if (loss < 0.f) {\n    return;\n  }\n  float sfv_norm = squared_norm(sfv);\n  if (sfv_norm == 0.f) {\n    return;\n  }\n  update_weight(\n      sfv, loss \/ (2 * sfv_norm + 1 \/ (2 * config.C)), label, incorrect_label);\n}\n\nstring passive_aggressive_2::name() const {\n  return string(\"passive_aggressive_2\");\n}\n\n}  \/\/ namespace classifier\n}  \/\/ namespace jubatus\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * TTBlue Signal Crossfader Object\n * Copyright © 2008, Timothy 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#include \"TTCrossfade.h\"\n\n\nTTCrossfade::TTCrossfade(TTUInt8 newMaxNumChannels)\n\t: TTAudioObject(\"audio.crossfade\", newMaxNumChannels), attrShape((TTSymbol&)kTTSymEmpty), attrMode((TTSymbol&)kTTSymEmpty)\n{\n\tregisterAttribute(TT(\"position\"),\tkTypeFloat64,\t&attrPosition);\n\tregisterAttribute(TT(\"shape\"),\t\tkTypeSymbol,\t&attrShape,\t\t(TTGetterMethod)NULL, (TTSetterMethod)&TTCrossfade::setShape);\n\tregisterAttribute(TT(\"mode\"),\t\tkTypeSymbol,\t&attrMode,\t\t(TTGetterMethod)NULL, (TTSetterMethod)&TTCrossfade::setMode);\n\n\t\/\/ Set Defaults (the attribute setters will set the process method for us)...\n\tsetAttributeValue(TT(\"position\"),\t0.5);\n\tsetAttributeValue(TT(\"shape\"),\t\tTT(\"equalPower\"));\n\tsetAttributeValue(TT(\"mode\"),\t\tTT(\"lookup\"));\n}\n\n\nTTCrossfade::~TTCrossfade()\n{\n\t;\n}\n\n\nTTErr TTCrossfade::setShape(const TTValue& newValue)\n{\n\tattrShape = newValue;\n\treturn setProcessPointers();\n}\n\n\nTTErr TTCrossfade::setMode(const TTValue& newValue)\n{\n\tattrMode = newValue;\n\treturn setProcessPointers();\n}\n\n\nTTErr TTCrossfade::setProcessPointers()\n{\n\tTTErr\terr =kTTErrNone;\n\t\n\tif(attrShape == TT(\"equalPower\") && attrMode == TT(\"lookup\")){\n\t\terr |= setProcessWithSidechain((TTProcessWithSidechainMethod)&TTCrossfade::processLookupUsingSidechain);\n\t\terr |= setProcess((TTProcessMethod)&TTCrossfade::processLookup);\n\t}\n\telse if(attrShape == TT(\"equalPower\") && attrMode == TT(\"calculate\")){\n\t\terr |= setProcessWithSidechain((TTProcessWithSidechainMethod)&TTCrossfade::processCalcUsingSidechain);\n\t\terr |= setProcess((TTProcessMethod)&TTCrossfade::processCalc);\n\t}\n\telse{\n\t\terr |= setProcessWithSidechain((TTProcessWithSidechainMethod)&TTCrossfade::processLinearUsingSidechain);\n\t\terr |= setProcess((TTProcessMethod)&TTCrossfade::processLinear);\n\t}\n\treturn err;\n}\n\n\n#if 0\n#pragma mark -\n#pragma mark Interleaved Process Methods\n#endif\n\nTTErr TTCrossfade::processLinear(TTAudioSignal& in, TTAudioSignal& out)\n{\n\tshort\t\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tshort\t\t\tnumchannels = out.getNumChannels();\n\tshort\t\t\tchannel;\n\t\n\tif(in.getNumChannels() != out.getNumChannels()*2)\n\t\treturn kTTErrGeneric;\n\n\tfor(channel=0; channel<numchannels; channel++){\n\t\tinSampleA = in.sampleVectors[channel];\n\t\tinSampleB = in.sampleVectors[numchannels+channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in.getVectorSize();\n\t\t\n\t\twhile(vs--)\n\t\t\t*outSample++ = (*inSampleB++ * attrPosition) + (*inSampleA++ * (1.0 - attrPosition));\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr TTCrossfade::processLookup(TTAudioSignal& in, TTAudioSignal& out)\n{\n\tshort\t\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tshort\t\t\tnumchannels = out.getNumChannels();\n\tshort\t\t\tchannel;\n\tint\t\t\t\tindex;\n\t\n\tif(in.getNumChannels() != out.getNumChannels()*2)\n\t\treturn kTTErrGeneric;\n\n\tfor(channel=0; channel<numchannels; channel++){\n\t\tinSampleA = in.sampleVectors[channel];\n\t\tinSampleB = in.sampleVectors[numchannels+channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in.getVectorSize();\n\t\t\n\t\twhile(vs--){\n\t\t\tindex = (int)(attrPosition * 511.0);\n\t\t\t*outSample++ = (*inSampleB++ * kTTLookupEqualPower[511 - index]) + (*inSampleA++ * kTTLookupEqualPower[index]);\n\t\t}\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr TTCrossfade::processCalc(TTAudioSignal& in, TTAudioSignal& out)\n{\n\tshort\t\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tshort\t\t\tnumchannels = out.getNumChannels();\n\tshort\t\t\tchannel;\n\t\n\tif(in.getNumChannels() != out.getNumChannels()*2)\n\t\treturn kTTErrGeneric;\n\n\tfor(channel=0; channel<numchannels; channel++){\n\t\tinSampleA = in.sampleVectors[channel];\n\t\tinSampleB = in.sampleVectors[numchannels+channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in.getVectorSize();\n\t\t\n\t\twhile(vs--)\n\t\t\t*outSample++ = (*inSampleB++ * (sin(attrPosition * 1.5707963))) + (*inSampleA++ * (sin((1 - attrPosition) * 1.5707963)));\n\t}\n\treturn kTTErrNone;\n}\n\n\n\n#if 0\n#pragma mark -\n#pragma mark Sidechain Process Methods\n#endif\n\nTTErr TTCrossfade::processLinearUsingSidechain(TTAudioSignal& in1, TTAudioSignal& in2, TTAudioSignal& out, TTAudioSignal&)\n{\n\tTTUInt16\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tTTUInt8\t\t\tnumChannels = TTAudioSignal::getMinChannelCount(in1, in2, out);;\n\tTTUInt8\t\t\tchannel;\n\t\n\tfor(channel=0; channel<numChannels; channel++){\n\t\tinSampleA = in1.sampleVectors[channel];\n\t\tinSampleB = in2.sampleVectors[channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in1.getVectorSize();\n\t\t\n\t\twhile(vs--)\n\t\t\t*outSample++ = (*inSampleB++ * attrPosition) + (*inSampleA++ * (1.0 - attrPosition));\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr TTCrossfade::processLookupUsingSidechain(TTAudioSignal& in1, TTAudioSignal& in2, TTAudioSignal& out, TTAudioSignal&)\n{\n\tTTUInt16\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tTTUInt8\t\t\tnumChannels = TTAudioSignal::getMinChannelCount(in1, in2, out);;\n\tTTUInt8\t\t\tchannel;\n\tint\t\t\t\tindex;\n\n\tfor(channel=0; channel<numChannels; channel++){\n\t\tinSampleA = in1.sampleVectors[channel];\n\t\tinSampleB = in2.sampleVectors[channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in1.getVectorSize();\n\t\t\n\t\twhile(vs--){\n\t\t\tindex = (int)(attrPosition * 511.0);\n\t\t\t*outSample++ = (*inSampleB++ * kTTLookupEqualPower[511 - index]) + (*inSampleA++ * kTTLookupEqualPower[index]);\n\t\t}\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr TTCrossfade::processCalcUsingSidechain(TTAudioSignal& in1, TTAudioSignal& in2, TTAudioSignal& out, TTAudioSignal&)\n{\n\tTTUInt16\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tTTUInt8\t\t\tnumChannels = TTAudioSignal::getMinChannelCount(in1, in2, out);;\n\tTTUInt8\t\t\tchannel;\n\n\tfor(channel=0; channel<numChannels; channel++){\n\t\tinSampleA = in1.sampleVectors[channel];\n\t\tinSampleB = in2.sampleVectors[channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in1.getVectorSize();\n\t\t\n\t\twhile(vs--)\n\t\t\t*outSample++ = (*inSampleB++ * (sin(attrPosition * 1.5707963))) + (*inSampleA++ * (sin((1 - attrPosition) * 1.5707963)));\n\t}\n\treturn kTTErrNone;\n}\n\n<commit_msg>some initial work to try and handle cases of crossfading between signals with differing numbers of channels<commit_after>\/* \n * TTBlue Signal Crossfader Object\n * Copyright © 2008, Timothy 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#include \"TTCrossfade.h\"\n\n\nstatic bool zeroed = false;\nstatic TTSampleValue zeroVector1[2048]; \/\/TODO: make this dynamically sized\nstatic TTSampleValue zeroVector2[2048]; \/\/TODO: make this dynamically sized\nstatic TTSampleValue zeroVector3[2048]; \/\/TODO: make this dynamically sized\n\n\nTTCrossfade::TTCrossfade(TTUInt8 newMaxNumChannels)\n\t: TTAudioObject(\"audio.crossfade\", newMaxNumChannels), attrShape(*kTTSymEmpty), attrMode(*kTTSymEmpty)\n{\n\tregisterAttribute(TT(\"position\"),\tkTypeFloat64,\t&attrPosition);\n\tregisterAttribute(TT(\"shape\"),\t\tkTypeSymbol,\t&attrShape,\t\t(TTGetterMethod)NULL, (TTSetterMethod)&TTCrossfade::setShape);\n\tregisterAttribute(TT(\"mode\"),\t\tkTypeSymbol,\t&attrMode,\t\t(TTGetterMethod)NULL, (TTSetterMethod)&TTCrossfade::setMode);\n\n\tif(!zeroed){\n\t\tmemset(zeroVector1, 0, sizeof(TTSampleValue) * 2048);\n\t\tmemset(zeroVector2, 0, sizeof(TTSampleValue) * 2048);\n\t\tmemset(zeroVector3, 0, sizeof(TTSampleValue) * 2048);\n\t}\n\t\n\t\/\/ Set Defaults (the attribute setters will set the process method for us)...\n\tsetAttributeValue(TT(\"position\"),\t0.5);\n\tsetAttributeValue(TT(\"shape\"),\t\tTT(\"equalPower\"));\n\tsetAttributeValue(TT(\"mode\"),\t\tTT(\"lookup\"));\n}\n\n\nTTCrossfade::~TTCrossfade()\n{\n\t;\n}\n\n\nTTErr TTCrossfade::setShape(const TTValue& newValue)\n{\n\tattrShape = newValue;\n\treturn setProcessPointers();\n}\n\n\nTTErr TTCrossfade::setMode(const TTValue& newValue)\n{\n\tattrMode = newValue;\n\treturn setProcessPointers();\n}\n\n\nTTErr TTCrossfade::setProcessPointers()\n{\n\tTTErr\terr =kTTErrNone;\n\t\n\tif(attrShape == TT(\"equalPower\") && attrMode == TT(\"lookup\")){\n\t\terr |= setProcessWithSidechain((TTProcessWithSidechainMethod)&TTCrossfade::processLookupUsingSidechain);\n\t\terr |= setProcess((TTProcessMethod)&TTCrossfade::processLookup);\n\t}\n\telse if(attrShape == TT(\"equalPower\") && attrMode == TT(\"calculate\")){\n\t\terr |= setProcessWithSidechain((TTProcessWithSidechainMethod)&TTCrossfade::processCalcUsingSidechain);\n\t\terr |= setProcess((TTProcessMethod)&TTCrossfade::processCalc);\n\t}\n\telse{\n\t\terr |= setProcessWithSidechain((TTProcessWithSidechainMethod)&TTCrossfade::processLinearUsingSidechain);\n\t\terr |= setProcess((TTProcessMethod)&TTCrossfade::processLinear);\n\t}\n\treturn err;\n}\n\n\n#if 0\n#pragma mark -\n#pragma mark Interleaved Process Methods\n#endif\n\nTTErr TTCrossfade::processLinear(TTAudioSignal& in, TTAudioSignal& out)\n{\n\tshort\t\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tshort\t\t\tnumchannels = out.getNumChannels();\n\tshort\t\t\tchannel;\n\t\n\tif(in.getNumChannels() != out.getNumChannels()*2)\n\t\treturn kTTErrGeneric;\n\n\tfor(channel=0; channel<numchannels; channel++){\n\t\tinSampleA = in.sampleVectors[channel];\n\t\tinSampleB = in.sampleVectors[numchannels+channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in.getVectorSize();\n\t\t\n\t\twhile(vs--)\n\t\t\t*outSample++ = (*inSampleB++ * attrPosition) + (*inSampleA++ * (1.0 - attrPosition));\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr TTCrossfade::processLookup(TTAudioSignal& in, TTAudioSignal& out)\n{\n\tshort\t\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tshort\t\t\tnumchannels = out.getNumChannels();\n\tshort\t\t\tchannel;\n\tint\t\t\t\tindex;\n\t\n\tif(in.getNumChannels() != out.getNumChannels()*2)\n\t\treturn kTTErrGeneric;\n\n\tfor(channel=0; channel<numchannels; channel++){\n\t\tinSampleA = in.sampleVectors[channel];\n\t\tinSampleB = in.sampleVectors[numchannels+channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in.getVectorSize();\n\t\t\n\t\twhile(vs--){\n\t\t\tindex = (int)(attrPosition * 511.0);\n\t\t\t*outSample++ = (*inSampleB++ * kTTLookupEqualPower[511 - index]) + (*inSampleA++ * kTTLookupEqualPower[index]);\n\t\t}\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr TTCrossfade::processCalc(TTAudioSignal& in, TTAudioSignal& out)\n{\n\tshort\t\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tshort\t\t\tnumchannels = out.getNumChannels();\n\tshort\t\t\tchannel;\n\t\n\tif(in.getNumChannels() != out.getNumChannels()*2)\n\t\treturn kTTErrGeneric;\n\n\tfor(channel=0; channel<numchannels; channel++){\n\t\tinSampleA = in.sampleVectors[channel];\n\t\tinSampleB = in.sampleVectors[numchannels+channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in.getVectorSize();\n\t\t\n\t\twhile(vs--)\n\t\t\t*outSample++ = (*inSampleB++ * (sin(attrPosition * 1.5707963))) + (*inSampleA++ * (sin((1 - attrPosition) * 1.5707963)));\n\t}\n\treturn kTTErrNone;\n}\n\n\n\n#if 0\n#pragma mark -\n#pragma mark Sidechain Process Methods\n#endif\n\nTTErr TTCrossfade::processLinearUsingSidechain(TTAudioSignal& in1, TTAudioSignal& in2, TTAudioSignal& out, TTAudioSignal&)\n{\n\tTTUInt16\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tTTUInt8\t\t\tnumChannels = TTAudioSignal::getMaxChannelCount(in1, in2, out);;\n\tTTUInt8\t\t\tchannel;\n\t\n\tfor(channel=0; channel<numChannels; channel++){\n\/\/\t\tinSampleA = in1.sampleVectors[channel];\n\/\/\t\tinSampleB = in2.sampleVectors[channel];\n\/\/\t\toutSample = out.sampleVectors[channel];\n\t\tif(channel < in1.getNumChannels())\n\t\t\tinSampleA = in1.sampleVectors[channel];\n\t\telse\n\t\t\tinSampleA = zeroVector1;\n\t\t\n\t\tif(channel < in2.getNumChannels())\n\t\t\tinSampleB = in2.sampleVectors[channel];\n\t\telse\n\t\t\tinSampleB = zeroVector2;\n\t\t\n\t\tif(channel < out.getNumChannels())\n\t\t\toutSample = out.sampleVectors[channel];\n\t\telse\n\t\t\toutSample = zeroVector3;\t\t\n\t\t\n\t\tvs = in1.getVectorSize();\n\t\t\n\t\twhile(vs--)\n\t\t\t*outSample++ = (*inSampleB++ * attrPosition) + (*inSampleA++ * (1.0 - attrPosition));\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr TTCrossfade::processLookupUsingSidechain(TTAudioSignal& in1, TTAudioSignal& in2, TTAudioSignal& out, TTAudioSignal&)\n{\n\tTTUInt16\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tTTUInt8\t\t\tnumChannels = TTAudioSignal::getMaxChannelCount(in1, in2, out);;\n\tTTUInt8\t\t\tchannel;\n\tint\t\t\t\tindex;\n\n\tfor(channel=0; channel<numChannels; channel++){\n\t\tif(channel < in1.getNumChannels())\n\t\t\tinSampleA = in1.sampleVectors[channel];\n\t\telse\n\t\t\tinSampleA = zeroVector1;\n\t\t\t\n\t\tif(channel < in2.getNumChannels())\n\t\t\tinSampleB = in2.sampleVectors[channel];\n\t\telse\n\t\t\tinSampleB = zeroVector2;\n\n\t\tif(channel < out.getNumChannels())\n\t\t\toutSample = out.sampleVectors[channel];\n\t\telse\n\t\t\toutSample = zeroVector3;\n\n\t\tvs = in1.getVectorSize();\n\t\t\n\t\twhile(vs--){\n\t\t\tindex = (int)(attrPosition * 511.0);\n\t\t\t*outSample++ = (*inSampleB++ * kTTLookupEqualPower[511 - index]) + (*inSampleA++ * kTTLookupEqualPower[index]);\n\t\t}\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr TTCrossfade::processCalcUsingSidechain(TTAudioSignal& in1, TTAudioSignal& in2, TTAudioSignal& out, TTAudioSignal&)\n{\n\tTTUInt16\t\tvs;\n\tTTSampleValue\t*inSampleA,\n\t\t\t\t\t*inSampleB,\n\t\t\t\t\t*outSample;\n\tTTUInt8\t\t\tnumChannels = TTAudioSignal::getMinChannelCount(in1, in2, out);;\n\tTTUInt8\t\t\tchannel;\n\n\tfor(channel=0; channel<numChannels; channel++){\n\t\tinSampleA = in1.sampleVectors[channel];\n\t\tinSampleB = in2.sampleVectors[channel];\n\t\toutSample = out.sampleVectors[channel];\n\t\tvs = in1.getVectorSize();\n\t\t\n\t\twhile(vs--)\n\t\t\t*outSample++ = (*inSampleB++ * (sin(attrPosition * 1.5707963))) + (*inSampleA++ * (sin((1 - attrPosition) * 1.5707963)));\n\t}\n\treturn kTTErrNone;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*-\n * Copyright (c) 2008 Michael Marner <michael@20papercups.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\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 AUTHOR AND CONTRIBUTORS ``AS IS'' AND\n * 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 AUTHOR 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\n * OR SERVICES; 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\n\n\/\/ include system headers\n#include <stdlib.h>\n#include <string.h>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n\/\/ include openGL headers\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <GL\/glut.h>\n\n#include <wcl\/camera\/CameraException.h>\n#include <wcl\/camera\/VirtualCamera.h>\n#include <wcl\/camera\/CameraFactory.h>\n\n#define WIDTH 640\n\nusing namespace std;\nusing namespace wcl;\n\nCamera *cam;\nunsigned char* data;\n\nvoid usage()\n{\n    printf(\"Usage: camera [devicenode]\\n\"\n\t   \"\\n\"\n\t   \"eg: camera \/dev\/video0\\n\"\n\t   \"\\n\"\n\t   \"If no device node is given the first available camera is used. If no physical camera exists, the virtual camera is used\\n\"\n\t  );\n}\n\n\n\/**\n * Initialise OpenGL\n *\/\nGLvoid init()\n{\n\tglShadeModel(GL_SMOOTH);\n\tglClearColor(0,0,0,0);\n\tglEnable(GL_DEPTH_TEST);\n\tglDepthFunc(GL_LEQUAL);\n\n\tdata = new unsigned char[cam->getFormatBufferSize(Camera::RGB8)];\n\n\t\/\/ create a texture for the image...\n\tglTexImage2D(GL_TEXTURE_2D,             \/\/target\n\t\t\t\t 0,                         \/\/level of detail\n\t\t\t\t 3,                         \/\/colour components\n\t\t\t\t cam->getActiveConfiguration().width,     \/\/width\n\t\t\t\t cam->getActiveConfiguration().height,    \/\/height\n\t\t\t\t 0,                         \/\/border\n\t\t\t\t GL_RGB,                    \/\/image format\n\t\t\t\t GL_UNSIGNED_BYTE,\n\t\t\t\t data);\n\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\tglTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_DECAL);\n\n\tglEnable(GL_TEXTURE_2D);\n\n\tglMatrixMode(GL_PROJECTION);\n\tgluOrtho2D(0,1,0,1);\n\tglMatrixMode(GL_MODELVIEW);\n}\n\n\n\/**\n * Constantly fetch a new image from the camera to display\n *\/\nGLvoid idle()\n{\n\tglutPostRedisplay();\n}\n\n\n\/**\n * Display Loop.\n *\/\nGLvoid display()\n{\n\tglClear(GL_DEPTH_BUFFER_BIT | GL_COLOR_BUFFER_BIT);\n\n\tconst unsigned char* frame = cam->getFrame(Camera::RGB8);\n\tglTexSubImage2D(GL_TEXTURE_2D,\n\t                0,\n\t\t\t\t\t0,\n\t\t\t\t\t0,\n\t\t\t\t\tcam->getActiveConfiguration().width,\n\t\t\t\t\tcam->getActiveConfiguration().height,\n\t\t\t\t\tGL_RGB,\n\t\t\t\t\tGL_UNSIGNED_BYTE,\n\t\t\t\t\tframe);\n\n\tglMatrixMode(GL_MODELVIEW);\n\n\tglLoadIdentity();\n\t\tglColor3f(1,0,0);\n\t\tglBegin(GL_QUADS);\n\n\t\tglTexCoord2f(0,1);\n\t\tglVertex2f(0,0);\n\n\t\tglTexCoord2f(1,1);\n\t\tglVertex2f(1,0);\n\n\t\tglTexCoord2f(1,0);\n\t\tglVertex2f(1,1);\n\n\t\tglTexCoord2f(0,0);\n\t\tglVertex2f(0,1);\n\tglEnd();\n\n\tglFlush();\n\tglutSwapBuffers();\n\n\t\/\/ print out any opengl errors to the console\n\tGLenum error = glGetError();\n\tif (error != GL_NO_ERROR)\n\t{\n\t\tcout << gluErrorString(error) << endl;\n\t}\n}\n\n\n\/**\n * This doesn't do what it is supposed to do!\n *\/\nGLvoid reshape(int width, int height)\n{\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tgluOrtho2D(0,1,0,1);\n\tglMatrixMode(GL_MODELVIEW);\n\tglViewport(0,0, (GLsizei)width, (GLsizei)height);\n}\n\nvoid keyboard(unsigned char key, int w, int h)\n{\n    if(key==27)\n\texit(EXIT_SUCCESS);\n}\n\nint main(int argc, char** argv)\n{\n    if(argc >=  2 &&\n       (strcmp(argv[1],\"--help\") == 0 ||\n        strcmp(argv[1],\"-h\" ) == 0)){\n\tusage();\n\treturn 1;\n    }\n\n    try {\n\n\tif( argc == 2 ){\n\t    cout << \"Attempting to use Camera specified:\" << argv[1] <<endl;\n\t    cam = CameraFactory::getCamera(argv[1], CameraFactory::ALL);\n\t} else {\n\t    cout << \"No Camera Specified, using CameraFactory to find the first camera...\" << endl;\n\t    std::vector<Camera *> cameras = CameraFactory::getCameras(CameraFactory::ALL);\n\t    CameraFactory::printDetails(false);\n\n\t    if( cameras.size() == 0 ){\n\t\tcout << \"No physical camera's found, using virtual camera\" << endl;\n\t\tcam = new VirtualCamera();\n\t    } else {\n\t\tcam = CameraFactory::getCamera(CameraFactory::ALL);\n\t    }\n\t}\n\tif (cam == NULL ){\n\t    std::cout << \"No usable cameras found\" << std::endl;\n\t    exit(0);\n\t}\n\n\t\/*\n\t * Print out camera details\n\t *\/\n\tcam->printDetails();\n\n\tcout << \"Setting Camera to a width of \" << WIDTH << \" pixels\" << endl;\n\n\tCamera::Configuration c;\n\tc.width = WIDTH;\n\tcam->setConfiguration(cam->findConfiguration(c));\n\n\t\/\/Set power frequency compensation to 50 Hz\n\t\/\/this is noncritical so don't stop the program if it fails\n\ttry {\n\tcam->setControlValue(Camera::POWER_FREQUENCY, 1);\n\t}catch(CameraException &e){}\n\n\t\/\/ Create GLUT window\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB | GLUT_DEPTH);\n\tglutInitWindowSize(cam->getActiveConfiguration().width, cam->getActiveConfiguration().height);\n\tglutCreateWindow(argv[0]);\n\n\tinit();\n\n\t\/\/ register callbacks\n\tglutDisplayFunc(display);\n\tglutReshapeFunc(reshape);\n\tglutKeyboardFunc(keyboard);\n\tglutIdleFunc(idle);\n\n\t\/\/ GO!\n\tglutMainLoop();\n\n\tcout << \"Deleting Cam\" << endl;\n\n\tcam->shutdown();\n\tdelete cam;\n\n    }\n    catch (Exception &e)\n    {\n\tcout << \"Exception Occured: \" << e.what() << endl;\n    }\n\n    return 0;\n}\n\n<commit_msg>example: Add the ability to list what cameras exist via -l<commit_after>\/*-\n * Copyright (c) 2008 Michael Marner <michael@20papercups.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\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 AUTHOR AND CONTRIBUTORS ``AS IS'' AND\n * 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 AUTHOR 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\n * OR SERVICES; 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\n\n\/\/ include system headers\n#include <stdlib.h>\n#include <string.h>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n\/\/ include openGL headers\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <GL\/glut.h>\n\n#include <wcl\/camera\/CameraException.h>\n#include <wcl\/camera\/VirtualCamera.h>\n#include <wcl\/camera\/CameraFactory.h>\n\n#define WIDTH 640\n\nusing namespace std;\nusing namespace wcl;\n\nCamera *cam;\nunsigned char* data;\n\nvoid usage()\n{\n    printf(\"Usage: camera [-l|-h|devicenode]\\n\"\n\t   \"\\n\"\n\t   \"eg: camera \/dev\/video0\\n\"\n\t   \"\\n\"\n\t   \"Options:\\n\"\n\t   \"\\n\"\n\t   \"-h = List this help\\n\"\n\t   \"-l = List available cameras then exit\\n\"\n\t   \"If no device node is given the first available camera is used. If no physical camera exists, the virtual camera is used\\n\"\n\t  );\n}\n\n\n\/**\n * Initialise OpenGL\n *\/\nGLvoid init()\n{\n\tglShadeModel(GL_SMOOTH);\n\tglClearColor(0,0,0,0);\n\tglEnable(GL_DEPTH_TEST);\n\tglDepthFunc(GL_LEQUAL);\n\n\tdata = new unsigned char[cam->getFormatBufferSize(Camera::RGB8)];\n\n\t\/\/ create a texture for the image...\n\tglTexImage2D(GL_TEXTURE_2D,             \/\/target\n\t\t\t\t 0,                         \/\/level of detail\n\t\t\t\t 3,                         \/\/colour components\n\t\t\t\t cam->getActiveConfiguration().width,     \/\/width\n\t\t\t\t cam->getActiveConfiguration().height,    \/\/height\n\t\t\t\t 0,                         \/\/border\n\t\t\t\t GL_RGB,                    \/\/image format\n\t\t\t\t GL_UNSIGNED_BYTE,\n\t\t\t\t data);\n\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\tglTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_DECAL);\n\n\tglEnable(GL_TEXTURE_2D);\n\n\tglMatrixMode(GL_PROJECTION);\n\tgluOrtho2D(0,1,0,1);\n\tglMatrixMode(GL_MODELVIEW);\n}\n\n\n\/**\n * Constantly fetch a new image from the camera to display\n *\/\nGLvoid idle()\n{\n\tglutPostRedisplay();\n}\n\n\n\/**\n * Display Loop.\n *\/\nGLvoid display()\n{\n\tglClear(GL_DEPTH_BUFFER_BIT | GL_COLOR_BUFFER_BIT);\n\n\tconst unsigned char* frame = cam->getFrame(Camera::RGB8);\n\tglTexSubImage2D(GL_TEXTURE_2D,\n\t                0,\n\t\t\t\t\t0,\n\t\t\t\t\t0,\n\t\t\t\t\tcam->getActiveConfiguration().width,\n\t\t\t\t\tcam->getActiveConfiguration().height,\n\t\t\t\t\tGL_RGB,\n\t\t\t\t\tGL_UNSIGNED_BYTE,\n\t\t\t\t\tframe);\n\n\tglMatrixMode(GL_MODELVIEW);\n\n\tglLoadIdentity();\n\t\tglColor3f(1,0,0);\n\t\tglBegin(GL_QUADS);\n\n\t\tglTexCoord2f(0,1);\n\t\tglVertex2f(0,0);\n\n\t\tglTexCoord2f(1,1);\n\t\tglVertex2f(1,0);\n\n\t\tglTexCoord2f(1,0);\n\t\tglVertex2f(1,1);\n\n\t\tglTexCoord2f(0,0);\n\t\tglVertex2f(0,1);\n\tglEnd();\n\n\tglFlush();\n\tglutSwapBuffers();\n\n\t\/\/ print out any opengl errors to the console\n\tGLenum error = glGetError();\n\tif (error != GL_NO_ERROR)\n\t{\n\t\tcout << gluErrorString(error) << endl;\n\t}\n}\n\n\n\/**\n * This doesn't do what it is supposed to do!\n *\/\nGLvoid reshape(int width, int height)\n{\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tgluOrtho2D(0,1,0,1);\n\tglMatrixMode(GL_MODELVIEW);\n\tglViewport(0,0, (GLsizei)width, (GLsizei)height);\n}\n\nvoid keyboard(unsigned char key, int w, int h)\n{\n    if(key==27)\n\texit(EXIT_SUCCESS);\n}\n\nvoid listCameras()\n{\n    cout << \"Searching for Cameras...\" << endl;\n    std::vector<Camera *> cameras = CameraFactory::getCameras(CameraFactory::ALL);\n    CameraFactory::printDetails(false);\n}\n\nint main(int argc, char** argv)\n{\n    if(argc >= 2){\n       if( strcmp(argv[1],\"--help\") == 0 || strcmp(argv[1],\"-h\" ) == 0){\n\tusage();\n\treturn 1;\n       }\n       if( strcmp(argv[1],\"-l\") == 0){\n\t   listCameras();\n\t   return 1;\n       }\n    }\n\n    try {\n\n\tif( argc == 2 ){\n\t    cout << \"Attempting to use Camera specified:\" << argv[1] <<endl;\n\t    cam = CameraFactory::getCamera(argv[1], CameraFactory::ALL);\n\t} else {\n\t    cout << \"No Camera Specified, using CameraFactory to find the first camera...\" << endl;\n\t    cout << \"Searching for Cameras...\" << endl;\n\t    std::vector<Camera *> cameras = CameraFactory::getCameras(CameraFactory::ALL);\n\t    CameraFactory::printDetails(false);\n\n\t    if( cameras.size() == 0 ){\n\t\tcout << \"No physical camera's found, using virtual camera\" << endl;\n\t\tcam = new VirtualCamera();\n\t    } else {\n\t\tcam = CameraFactory::getCamera(CameraFactory::ALL);\n\t    }\n\t}\n\tif (cam == NULL ){\n\t    std::cout << \"No usable cameras found\" << std::endl;\n\t    exit(0);\n\t}\n\n\t\/*\n\t * Print out camera details\n\t *\/\n\tcam->printDetails();\n\n\tcout << \"Setting Camera to a width of \" << WIDTH << \" pixels\" << endl;\n\n\tCamera::Configuration c;\n\tc.width = WIDTH;\n\tcam->setConfiguration(cam->findConfiguration(c));\n\n\t\/\/Set power frequency compensation to 50 Hz\n\t\/\/this is noncritical so don't stop the program if it fails\n\ttry {\n\tcam->setControlValue(Camera::POWER_FREQUENCY, 1);\n\t}catch(CameraException &e){}\n\n\t\/\/ Create GLUT window\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB | GLUT_DEPTH);\n\tglutInitWindowSize(cam->getActiveConfiguration().width, cam->getActiveConfiguration().height);\n\tglutCreateWindow(argv[0]);\n\n\tinit();\n\n\t\/\/ register callbacks\n\tglutDisplayFunc(display);\n\tglutReshapeFunc(reshape);\n\tglutKeyboardFunc(keyboard);\n\tglutIdleFunc(idle);\n\n\t\/\/ GO!\n\tglutMainLoop();\n\n\tcout << \"Deleting Cam\" << endl;\n\n\tcam->shutdown();\n\tdelete cam;\n\n    }\n    catch (Exception &e)\n    {\n\tcout << \"Exception Occured: \" << e.what() << endl;\n    }\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\r\n#include <crcpp\/crcpp.h>\r\n\r\n\r\n\/\/ Reflect the entire namespace and implement each class\r\ncrcpp_reflect(TestClassImpl)\r\nnamespace TestClassImpl\r\n{\r\n\tclass A\r\n\t{\r\n\tpublic:\r\n\t\tA()\r\n\t\t{\r\n\t\t\tx = 1;\r\n\t\t\ty = 2;\r\n\t\t\tz = 3;\r\n\t\t}\r\n\r\n\t\tint x, y, z;\r\n\t};\r\n\r\n\tstruct B\r\n\t{\r\n\t\tB()\r\n\t\t{\r\n\t\t\ta = 1.5f;\r\n\t\t\tb = 2.5f;\r\n\t\t\tc = 3.5f;\r\n\t\t}\r\n\r\n\t\tfloat a, b, c;\r\n\t};\r\n}\r\n\r\ncrcpp_impl_class(TestClassImpl::A, A)\r\ncrcpp_impl_class(TestClassImpl::B, B)\r\n\r\n\r\nvoid TestConstructorDestructor(crcpp::Database& db)\r\n{\r\n\tconst crcpp::Class* ca = crcpp_get_type(db, TestClassImpl::A)->AsClass();\r\n\tconst crcpp::Class* cb = crcpp_get_type(db, TestClassImpl::B)->AsClass();\r\n\r\n\tTestClassImpl::A* a = (TestClassImpl::A*)new char[sizeof(TestClassImpl::A)];\r\n\tTestClassImpl::B* b = (TestClassImpl::B*)new char[sizeof(TestClassImpl::B)];\r\n\r\n\ttypedef void (*ClassImplFunc)(void*);\r\n\tClassImplFunc cona = (ClassImplFunc)ca->constructor->address;\r\n\tClassImplFunc conb = (ClassImplFunc)cb->constructor->address;\r\n\tClassImplFunc desa = (ClassImplFunc)ca->destructor->address;\r\n\tClassImplFunc desb = (ClassImplFunc)cb->destructor->address;\r\n\r\n\tcona(a);\r\n\tconb(b);\r\n\r\n\tdesa(a);\r\n\tdesb(b);\r\n\t\r\n\tdelete [] (char*) a;\r\n\tdelete [] (char*) b;\r\n}<commit_msg>Interesting concept... getting too close to a function library, though.<commit_after>\r\n#include <crcpp\/crcpp.h>\r\n\r\n\r\n\/\/ Reflect the entire namespace and implement each class\r\ncrcpp_reflect(TestClassImpl)\r\nnamespace TestClassImpl\r\n{\r\n\tclass A\r\n\t{\r\n\tpublic:\r\n\t\tA()\r\n\t\t{\r\n\t\t\tx = 1;\r\n\t\t\ty = 2;\r\n\t\t\tz = 3;\r\n\t\t}\r\n\r\n\t\tint x, y, z;\r\n\t};\r\n\r\n\tstruct B\r\n\t{\r\n\t\tB()\r\n\t\t{\r\n\t\t\ta = 1.5f;\r\n\t\t\tb = 2.5f;\r\n\t\t\tc = 3.5f;\r\n\t\t}\r\n\r\n\t\tfloat a, b, c;\r\n\t};\r\n}\r\n\r\ncrcpp_impl_class(TestClassImpl::A, A)\r\ncrcpp_impl_class(TestClassImpl::B, B)\r\n\r\n\r\ntemplate <typename A0> void Call(const crcpp::Function* function, A0 a0)\r\n{\r\n\ttypedef void (*CallFunc)(A0);\r\n\tCallFunc call_func = (CallFunc)function->address;\r\n\tcall_func(a0);\r\n}\r\n\r\n\r\nvoid TestConstructorDestructor(crcpp::Database& db)\r\n{\r\n\tconst crcpp::Class* ca = crcpp_get_type(db, TestClassImpl::A)->AsClass();\r\n\tconst crcpp::Class* cb = crcpp_get_type(db, TestClassImpl::B)->AsClass();\r\n\r\n\tTestClassImpl::A* a = (TestClassImpl::A*)new char[sizeof(TestClassImpl::A)];\r\n\tTestClassImpl::B* b = (TestClassImpl::B*)new char[sizeof(TestClassImpl::B)];\r\n\r\n\tCall(ca->constructor, a);\r\n\tCall(cb->constructor, b);\r\n\r\n\tCall(ca->destructor, a);\r\n\tCall(cb->destructor, b);\r\n\t\r\n\tdelete [] (char*) a;\r\n\tdelete [] (char*) b;\r\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * This source file is part of EasyPaint.\n *\n * Copyright (c) 2012 EasyPaint <https:\/\/github.com\/Gr1N\/EasyPaint>\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 included\n * 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 \"paintinstruments.h\"\n#include \"imagearea.h\"\n#include \"easypaintenums.h\"\n#include \"datasingleton.h\"\n\n#include <QtGui\/QPainter>\n#include <QtGui\/QLabel>\n#include <math.h>\n\nPaintInstruments::PaintInstruments(ImageArea *pImageArea, QObject *parent) :\n    QObject(parent)\n{\n    mPImageArea = pImageArea;\n}\n\nPaintInstruments::~PaintInstruments()\n{\n\n}\n\nvoid PaintInstruments::line(bool isSecondColor, bool isLastic)\n{\n    QPainter painter(mPImageArea->getImage());\n    if(isLastic)\n    {\n        painter.setPen(QPen(Qt::white, DataSingleton::Instance()->getPenSize(),\n                            Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    }\n    else\n    {\n        if(isSecondColor)\n        {\n            painter.setPen(QPen(DataSingleton::Instance()->getSecondColor(),\n                                DataSingleton::Instance()->getPenSize(),\n                                Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n        }\n        else\n        {\n            painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                                DataSingleton::Instance()->getPenSize(),\n                                Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n        }\n    }\n\n    if(mStartPoint != mEndPoint)\n    {\n        painter.drawLine(mStartPoint, mEndPoint);\n    }\n    if(DataSingleton::Instance()->getInstrument() == PEN && mStartPoint == mEndPoint)\n    {\n        if(DataSingleton::Instance()->getPenSize() > 1)\n        {\n            painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                                round(DataSingleton::Instance()->getPenSize() \/ 2),\n                                Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n            painter.drawRect(QRect(mStartPoint, mEndPoint));\n        }\n        else\n        {\n            painter.drawPoint(mStartPoint);\n        }\n    }\n    mPImageArea->setEdited(true);\n\/\/    int rad(DataSingleton::Instance()->getPenSize() + round(sqrt((mStartPoint.x() - mEndPoint.x()) *\n\/\/                                                                 (mStartPoint.x() - mEndPoint.x()) +\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()) *\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()))));\n\/\/    mPImageArea->update(QRect(mStartPoint, mEndPoint).normalized().adjusted(-rad, -rad, +rad, +rad));\n    painter.end();\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::pipette(bool isSecondColor)\n{\n    bool inArea(true);\n    if(mStartPoint.x() < 0 || mStartPoint.y() < 0\n            || mStartPoint.x() > mPImageArea->getImage()->width()\n            || mStartPoint.y() > mPImageArea->getImage()->height())\n        inArea = false;\n\n    if(inArea && isSecondColor)\n    {\n        QRgb pixel(mPImageArea->getImage()->pixel(mStartPoint));\n        QColor getColor(pixel);\n        DataSingleton::Instance()->setSecondColor(getColor);\n    }\n    if(inArea)\n    {\n        QRgb pixel(mPImageArea->getImage()->pixel(mStartPoint));\n        QColor getColor(pixel);\n        DataSingleton::Instance()->setFirstColor(getColor);\n    }\n}\n\nvoid PaintInstruments::rect(bool isSecondColor)\n{\n    QPainter painter(mPImageArea->getImage());\n    painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                        DataSingleton::Instance()->getPenSize(),\n                        Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    if(isSecondColor)\n    {\n        painter.setBrush(QBrush(DataSingleton::Instance()->getSecondColor()));\n    }\n    if(mStartPoint != mEndPoint)\n    {\n        painter.drawRect(QRect(mStartPoint, mEndPoint));\n    }\n    mPImageArea->setEdited(true);\n\/\/    int rad(DataSingleton::Instance()->getPenSize() + round(sqrt((mStartPoint.x() - mEndPoint.x()) *\n\/\/                                                                 (mStartPoint.x() - mEndPoint.x()) +\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()) *\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()))));\n\/\/    mPImageArea->update(QRect(mStartPoint, mEndPoint).normalized().adjusted(-rad, -rad, +rad, +rad));\n    painter.end();\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::ellipse(bool isSecondColor)\n{\n    QPainter painter(mPImageArea->getImage());\n    painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                        DataSingleton::Instance()->getPenSize(),\n                        Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    if(isSecondColor)\n    {\n        painter.setBrush(QBrush(DataSingleton::Instance()->getSecondColor()));\n    }\n    if(mStartPoint != mEndPoint)\n    {\n        painter.drawEllipse(QRect(mStartPoint, mEndPoint));\n    }\n    mPImageArea->setEdited(true);\n\/\/    int rad(DataSingleton::Instance()->getPenSize() + round(sqrt((mStartPoint.x() - mEndPoint.x()) *\n\/\/                                                                 (mStartPoint.x() - mEndPoint.x()) +\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()) *\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()))));\n\/\/    mPImageArea->update(QRect(mStartPoint, mEndPoint).normalized().adjusted(-rad, -rad, +rad, +rad));\n    painter.end();\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::spray(bool isSecondColor)\n{\n    QPainter painter(mPImageArea->getImage());\n    if(isSecondColor)\n    {\n        painter.setPen(QPen(DataSingleton::Instance()->getSecondColor(),\n                            sqrt(DataSingleton::Instance()->getPenSize()),\n                            Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    }\n    else\n    {\n        painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                            sqrt(DataSingleton::Instance()->getPenSize()),\n                            Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    }\n\n    for(int i(0); i < 10; i++)\n    {\n        int x = qrand() %\n                ((7 + 1) + 7) * sqrt(DataSingleton::Instance()->getPenSize()) -\n                7 * sqrt(DataSingleton::Instance()->getPenSize());\n        int y = qrand() %\n                ((7 + 1) + 7) * sqrt(DataSingleton::Instance()->getPenSize()) -\n                7 * sqrt(DataSingleton::Instance()->getPenSize());\n        painter.drawLine(mEndPoint.x() + x,\n                         mEndPoint.y() + y,\n                         mEndPoint.x() + x + 1,\n                         mEndPoint.y() + y + 1);\n    }\n    mPImageArea->setEdited(true);\n    painter.end();\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::fill(bool isSecondColor)\n{\n    QColor switchColor;\n    if(!isSecondColor)\n    {\n        switchColor = DataSingleton::Instance()->getFirstColor();\n    }\n    else\n    {\n        switchColor = DataSingleton::Instance()->getSecondColor();\n    }\n\n    QRgb pixel(mPImageArea->getImage()->pixel(mStartPoint));\n    QColor oldColor(pixel);\n\n    if(switchColor != oldColor)\n    {\n        fillRecurs(mStartPoint.x(), mStartPoint.y(),\n                       switchColor, oldColor,\n                       *mPImageArea->getImage());\n    }\n\n    mPImageArea->setEdited(true);\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::fillRecurs(int x, int y, QColor switchColor, QColor oldColor, QImage &tempImage)\n{\n    int temp_x(x), left_x(0);\n    while(1)\n    {\n        QRgb pixsel(tempImage.pixel(temp_x, y));\n        QColor currentColor;\n        currentColor.setRgb(pixsel);\n        if(currentColor != oldColor)\n            break;\n        pixsel = switchColor.rgb();\n        tempImage.setPixel(temp_x, y, pixsel);\n        if(temp_x > 0)\n        {\n            temp_x--;\n            left_x = temp_x;\n        }\n        else\n            break;\n    }\n\n    int right_x(0);\n    temp_x = x + 1;\n    while(1)\n    {\n        QRgb pixsel(tempImage.pixel(temp_x, y));\n        QColor currentColor;\n        currentColor.setRgb(pixsel);\n        if(currentColor != oldColor)\n            break;\n        pixsel = switchColor.rgb();\n        tempImage.setPixel(temp_x, y, pixsel);\n        if(temp_x < tempImage.width() - 1)\n        {\n            temp_x++;\n            right_x = temp_x;\n        }\n        else\n            break;\n    }\n\n    for(int x_(left_x+1); x_ < right_x; x_++)\n    {\n        if(y < 1)\n            break;\n        if(right_x > tempImage.width())\n            break;\n        QRgb pixsel(tempImage.pixel(x_, y-1));\n        QColor currentColor;\n        currentColor.setRgb(pixsel);\n        if(currentColor == oldColor && currentColor != switchColor)\n            fillRecurs(x_, y-1, switchColor, oldColor, tempImage);\n    }\n    for(int x_(left_x+1); x_ < right_x; x_++)\n    {\n        if(y >= tempImage.height() - 1)\n            break;\n        if(right_x > tempImage.width())\n            break;\n        QRgb pixsel(tempImage.pixel(x_, y+1));\n        QColor currentColor;\n        currentColor.setRgb(pixsel);\n        if(currentColor == oldColor && currentColor != switchColor)\n            fillRecurs(x_, y+1, switchColor, oldColor, tempImage);\n    }\n}\n<commit_msg>Changed spray mechanism<commit_after>\/*\n * This source file is part of EasyPaint.\n *\n * Copyright (c) 2012 EasyPaint <https:\/\/github.com\/Gr1N\/EasyPaint>\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 included\n * 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 \"paintinstruments.h\"\n#include \"imagearea.h\"\n#include \"easypaintenums.h\"\n#include \"datasingleton.h\"\n\n#include <QtGui\/QPainter>\n#include <QtGui\/QLabel>\n#include <math.h>\n\nPaintInstruments::PaintInstruments(ImageArea *pImageArea, QObject *parent) :\n    QObject(parent)\n{\n    mPImageArea = pImageArea;\n}\n\nPaintInstruments::~PaintInstruments()\n{\n\n}\n\nvoid PaintInstruments::line(bool isSecondColor, bool isLastic)\n{\n    QPainter painter(mPImageArea->getImage());\n    if(isLastic)\n    {\n        painter.setPen(QPen(Qt::white, DataSingleton::Instance()->getPenSize(),\n                            Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    }\n    else\n    {\n        if(isSecondColor)\n        {\n            painter.setPen(QPen(DataSingleton::Instance()->getSecondColor(),\n                                DataSingleton::Instance()->getPenSize(),\n                                Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n        }\n        else\n        {\n            painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                                DataSingleton::Instance()->getPenSize(),\n                                Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n        }\n    }\n\n    if(mStartPoint != mEndPoint)\n    {\n        painter.drawLine(mStartPoint, mEndPoint);\n    }\n    if(DataSingleton::Instance()->getInstrument() == PEN && mStartPoint == mEndPoint)\n    {\n        if(DataSingleton::Instance()->getPenSize() > 1)\n        {\n            painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                                round(DataSingleton::Instance()->getPenSize() \/ 2),\n                                Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n            painter.drawRect(QRect(mStartPoint, mEndPoint));\n        }\n        else\n        {\n            painter.drawPoint(mStartPoint);\n        }\n    }\n    mPImageArea->setEdited(true);\n\/\/    int rad(DataSingleton::Instance()->getPenSize() + round(sqrt((mStartPoint.x() - mEndPoint.x()) *\n\/\/                                                                 (mStartPoint.x() - mEndPoint.x()) +\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()) *\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()))));\n\/\/    mPImageArea->update(QRect(mStartPoint, mEndPoint).normalized().adjusted(-rad, -rad, +rad, +rad));\n    painter.end();\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::pipette(bool isSecondColor)\n{\n    bool inArea(true);\n    if(mStartPoint.x() < 0 || mStartPoint.y() < 0\n            || mStartPoint.x() > mPImageArea->getImage()->width()\n            || mStartPoint.y() > mPImageArea->getImage()->height())\n        inArea = false;\n\n    if(inArea && isSecondColor)\n    {\n        QRgb pixel(mPImageArea->getImage()->pixel(mStartPoint));\n        QColor getColor(pixel);\n        DataSingleton::Instance()->setSecondColor(getColor);\n    }\n    if(inArea)\n    {\n        QRgb pixel(mPImageArea->getImage()->pixel(mStartPoint));\n        QColor getColor(pixel);\n        DataSingleton::Instance()->setFirstColor(getColor);\n    }\n}\n\nvoid PaintInstruments::rect(bool isSecondColor)\n{\n    QPainter painter(mPImageArea->getImage());\n    painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                        DataSingleton::Instance()->getPenSize(),\n                        Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    if(isSecondColor)\n    {\n        painter.setBrush(QBrush(DataSingleton::Instance()->getSecondColor()));\n    }\n    if(mStartPoint != mEndPoint)\n    {\n        painter.drawRect(QRect(mStartPoint, mEndPoint));\n    }\n    mPImageArea->setEdited(true);\n\/\/    int rad(DataSingleton::Instance()->getPenSize() + round(sqrt((mStartPoint.x() - mEndPoint.x()) *\n\/\/                                                                 (mStartPoint.x() - mEndPoint.x()) +\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()) *\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()))));\n\/\/    mPImageArea->update(QRect(mStartPoint, mEndPoint).normalized().adjusted(-rad, -rad, +rad, +rad));\n    painter.end();\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::ellipse(bool isSecondColor)\n{\n    QPainter painter(mPImageArea->getImage());\n    painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                        DataSingleton::Instance()->getPenSize(),\n                        Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    if(isSecondColor)\n    {\n        painter.setBrush(QBrush(DataSingleton::Instance()->getSecondColor()));\n    }\n    if(mStartPoint != mEndPoint)\n    {\n        painter.drawEllipse(QRect(mStartPoint, mEndPoint));\n    }\n    mPImageArea->setEdited(true);\n\/\/    int rad(DataSingleton::Instance()->getPenSize() + round(sqrt((mStartPoint.x() - mEndPoint.x()) *\n\/\/                                                                 (mStartPoint.x() - mEndPoint.x()) +\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()) *\n\/\/                                                                 (mStartPoint.y() - mEndPoint.y()))));\n\/\/    mPImageArea->update(QRect(mStartPoint, mEndPoint).normalized().adjusted(-rad, -rad, +rad, +rad));\n    painter.end();\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::spray(bool isSecondColor)\n{\n    QPainter painter(mPImageArea->getImage());\n    if(isSecondColor)\n    {\n        painter.setPen(QPen(DataSingleton::Instance()->getSecondColor(),\n                            sqrt(DataSingleton::Instance()->getPenSize()),\n                            Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    }\n    else\n    {\n        painter.setPen(QPen(DataSingleton::Instance()->getFirstColor(),\n                            sqrt(DataSingleton::Instance()->getPenSize()),\n                            Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin));\n    }\n\n    int x, y;\n    for(int i(0); i < 12; i++)\n    {\n        switch(i) {\n        case 0: case 1: case 2: case 3:\n            x = (qrand() % 5 - 2)\n                    * sqrt(DataSingleton::Instance()->getPenSize());\n            y = (qrand() % 5 - 2)\n                    * sqrt(DataSingleton::Instance()->getPenSize());\n            break;\n        case 4: case 5: case 6: case 7:\n            x = (qrand() % 10 - 4)\n                    * sqrt(DataSingleton::Instance()->getPenSize());\n            y = (qrand() % 10 - 4)\n                    * sqrt(DataSingleton::Instance()->getPenSize());\n            break;\n        case 8: case 9: case 10: case 11:\n            x = (qrand() % 15 - 7)\n                    * sqrt(DataSingleton::Instance()->getPenSize());\n            y = (qrand() % 15 - 7)\n                    * sqrt(DataSingleton::Instance()->getPenSize());\n            break;\n        }\n        painter.drawPoint(mEndPoint.x() + x,\n                         mEndPoint.y() + y);\n    }\n    mPImageArea->setEdited(true);\n    painter.end();\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::fill(bool isSecondColor)\n{\n    QColor switchColor;\n    if(!isSecondColor)\n    {\n        switchColor = DataSingleton::Instance()->getFirstColor();\n    }\n    else\n    {\n        switchColor = DataSingleton::Instance()->getSecondColor();\n    }\n\n    QRgb pixel(mPImageArea->getImage()->pixel(mStartPoint));\n    QColor oldColor(pixel);\n\n    if(switchColor != oldColor)\n    {\n        fillRecurs(mStartPoint.x(), mStartPoint.y(),\n                       switchColor, oldColor,\n                       *mPImageArea->getImage());\n    }\n\n    mPImageArea->setEdited(true);\n    mPImageArea->update();\n}\n\nvoid PaintInstruments::fillRecurs(int x, int y, QColor switchColor, QColor oldColor, QImage &tempImage)\n{\n    int temp_x(x), left_x(0);\n    while(1)\n    {\n        QRgb pixsel(tempImage.pixel(temp_x, y));\n        QColor currentColor;\n        currentColor.setRgb(pixsel);\n        if(currentColor != oldColor)\n            break;\n        pixsel = switchColor.rgb();\n        tempImage.setPixel(temp_x, y, pixsel);\n        if(temp_x > 0)\n        {\n            temp_x--;\n            left_x = temp_x;\n        }\n        else\n            break;\n    }\n\n    int right_x(0);\n    temp_x = x + 1;\n    while(1)\n    {\n        QRgb pixsel(tempImage.pixel(temp_x, y));\n        QColor currentColor;\n        currentColor.setRgb(pixsel);\n        if(currentColor != oldColor)\n            break;\n        pixsel = switchColor.rgb();\n        tempImage.setPixel(temp_x, y, pixsel);\n        if(temp_x < tempImage.width() - 1)\n        {\n            temp_x++;\n            right_x = temp_x;\n        }\n        else\n            break;\n    }\n\n    for(int x_(left_x+1); x_ < right_x; x_++)\n    {\n        if(y < 1)\n            break;\n        if(right_x > tempImage.width())\n            break;\n        QRgb pixsel(tempImage.pixel(x_, y-1));\n        QColor currentColor;\n        currentColor.setRgb(pixsel);\n        if(currentColor == oldColor && currentColor != switchColor)\n            fillRecurs(x_, y-1, switchColor, oldColor, tempImage);\n    }\n    for(int x_(left_x+1); x_ < right_x; x_++)\n    {\n        if(y >= tempImage.height() - 1)\n            break;\n        if(right_x > tempImage.width())\n            break;\n        QRgb pixsel(tempImage.pixel(x_, y+1));\n        QColor currentColor;\n        currentColor.setRgb(pixsel);\n        if(currentColor == oldColor && currentColor != switchColor)\n            fillRecurs(x_, y+1, switchColor, oldColor, tempImage);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ModelEditor.hpp\"\n\n#include <Engine\/Geometry\/Model.hpp>\n#include \"..\/FileSelector.hpp\"\n#include <functional>\n#include <Engine\/Hymn.hpp>\n#include <Engine\/Util\/FileSystem.hpp>\n#include <imgui.h>\n#include \"Util\/AssetMetaData.hpp\"\n#include <Utility\/Log.hpp>\n#include \"..\/..\/Resources.hpp\"\n#include <Engine\/Manager\/Managers.hpp>\n#include <Engine\/Manager\/ResourceManager.hpp>\n#include <Engine\/Entity\/Entity.hpp>\n#include <Engine\/Component\/Mesh.hpp>\n\nusing namespace GUI;\n\nModelEditor::ModelEditor() {\n    name[0] = '\\0';\n}\n\nvoid ModelEditor::Show() {\n    if (ImGui::Begin((\"Model: \" + model->name + \"###\" + std::to_string(reinterpret_cast<uintptr_t>(model))).c_str(), &visible, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_ShowBorders)) {\n        if (ImGui::InputText(\"Name\", name, 128, ImGuiInputTextFlags_EnterReturnsTrue)) {\n            model->name = name;\n\n            \/\/ Rename all the files.\n            if (FileSystem::FileExists((destination + \".fbx\").c_str())) {\n                FileSystem::Rename(destination + \".fbx\", std::string(name) + \".fbx\");\n\n                if (FileSystem::FileExists((destination + \".asset\").c_str()))\n                    FileSystem::Rename(destination + \".asset\", std::string(name) + \".asset\");\n\n                if (FileSystem::FileExists((destination + \".asset.meta\").c_str()))\n                    FileSystem::Rename(destination + \".asset.meta\", std::string(name) + \".asset.meta\");\n\n                destination = Hymn().GetPath() + FileSystem::DELIMITER + \"Models\" + FileSystem::DELIMITER + name;\n            }\n        }\n\n        if (ImGui::Button(\"Open model\")) {\n            \/\/ Currently only fbx is tested.\n            fileSelector.AddExtensions(\"fbx\");\n\n            \/\/ Set the initial path to the models directory.\n            fileSelector.SetInitialPath((Hymn().GetPath() + FileSystem::DELIMITER + \"Models\").c_str());\n            fileSelector.SetFileSelectedCallback(std::bind(&ModelEditor::FileSelected, this, std::placeholders::_1));\n            fileSelector.SetVisible(true);\n        }\n\n        if (hasSourceFile) {\n            ImGui::Text(\"Mesh Data\");\n            ImGui::Checkbox(\"Uniform Scaling\", &uniformScaling);\n\n            if (uniformScaling) {\n                float uniScale = scale.x;\n                ImGui::DragFloat(\"Scale\", &uniScale, 0.01f);\n                scale = glm::vec3(uniScale);\n            } else\n                ImGui::DragFloat3(\"Scale\", &scale[0], 0.01f);\n            \n            ImGui::Checkbox(\"Triangulate\", &triangulate);\n            ImGui::Checkbox(\"Import Normals\", &importNormals);\n            ImGui::Checkbox(\"Import Tangents\", &importTangents);\n            ImGui::Checkbox(\"Import Textures\", &importTextures);\n            ImGui::Checkbox(\"Flip UVs\", &flipUVs);\n            ImGui::Checkbox(\"Create scene\", &createScene);\n\n            std::string button = isImported ? \"Re-import\" : \"Import\";\n\n            if (ImGui::Button(button.c_str())) {\n                AssetConverter::Materials materials;\n                \n                \/\/ Convert to .asset format.\n                AssetConverter asset;\n                asset.Convert(source.c_str(), (destination + \".asset\").c_str(), scale, triangulate, importNormals, importTangents, flipUVs, importTextures, materials);\n                model->Load(destination.c_str());\n                msgString = asset.Success() ? \"Success\\n\" : asset.GetErrorString();\n                isImported = true;\n\n                \/\/ Generate meta data.\n                AssetMetaData::MeshImportData* importData = new AssetMetaData::MeshImportData;\n                importData->triangulate = triangulate;\n                importData->importNormals = importNormals;\n                importData->importTangents = importTangents;\n                AssetMetaData::GenerateMetaData((destination + \".asset.meta\").c_str(), importData);\n                \n                \/\/ Import textures.\n                if (importTextures) {\n                    LoadTexture(materials.albedo, \"Albedo\");\n                    LoadTexture(materials.normal, \"Normal\");\n                    LoadTexture(materials.roughness, \"Roughness\");\n                    LoadTexture(materials.metallic, \"Metallic\");\n                }\n\n                delete importData;\n                \n                \/\/ Create scene containing an entity with the model and textures.\n                if (createScene) {\n                    \/\/ Create resource.\n                    ResourceList::Resource resource;\n                    resource.type = ResourceList::Resource::SCENE;\n                    resource.scene = model->name + \"Scene\";\n                    folder->resources.push_back(resource);\n                    \n                    \/\/ Create and save scene.\n                    World* world = new World();\n                    world->CreateRoot();\n                    Entity* entity = world->GetRoot()->AddChild(model->name);\n                    \n                    Component::Mesh* mesh = entity->AddComponent<Component::Mesh>();\n                    mesh->geometry = model;\n                    \n                    world->Save(Hymn().GetPath() + \"\/\" + model->path + model->name + \"Scene.json\");\n                    \n                    \/\/ Cleanup.\n                    mesh->geometry = nullptr;\n                    mesh->Kill();\n                    delete world;\n                }\n            }\n\n            if (isImported)\n                ImGui::Text(msgString.c_str());\n        }\n    }\n    ImGui::End();\n\n    if (fileSelector.IsVisible())\n        fileSelector.Show();\n}\n\nconst Geometry::Model* ModelEditor::GetModel() const {\n    return model;\n}\n\nvoid ModelEditor::SetModel(ResourceList::ResourceFolder* folder, Geometry::Model* model) {\n    this->folder = folder;\n    this->model = model;\n\n    strcpy(name, model->name.c_str());\n\n    destination = Hymn().GetPath() + \"\/\" + model->path + name;\n\n    RefreshImportSettings();\n}\n\nbool ModelEditor::IsVisible() const {\n    return visible;\n}\n\nvoid ModelEditor::SetVisible(bool visible) {\n    this->visible = visible;\n}\n\nvoid ModelEditor::FileSelected(const std::string& file) {\n    std::string name = FileSystem::GetName(file).c_str();\n\n    \/\/ Checking so that the file isn't imported twice.\n    \/\/\/ @todo Overwrite option?\n    \/\/\/ @todo Reimplement this.\n    \/*for (int i = 0; i < Resources().models.size(); ++i) {\n        if (Resources().models[i]->name == name) {\n            Log() << \"File \" << name << \" is already added to project.\\n\";\n            isImported = false;\n            hasSourceFile = false;\n            return;\n        }\n    }*\/\n\n    source = file;\n\n    \/\/ Rename the model to the name of the source file.\n    strcpy(this->name, name.c_str());\n    model->name = this->name;\n\n    destination = Hymn().GetPath() + \"\/\" + model->path + name;\n\n    \/\/ Check if source file is in proper directory, otherwise, copy it.\n    if (!FileSystem::FileExists((destination + \".\" + FileSystem::GetExtension(source)).c_str()))\n        FileSystem::Copy(source.c_str(), (destination + \".\" + FileSystem::GetExtension(source)).c_str());\n\n    hasSourceFile = true;\n\n    RefreshImportSettings();\n}\n\nvoid ModelEditor::RefreshImportSettings() {\n    \/\/ Check if the source file exist, currently only .fbx is supported.\n    if (!FileSystem::FileExists((destination + \".fbx\").c_str())) {\n        hasSourceFile = false;\n        isImported = false;\n        return;\n    }\n\n    \/\/ Check if meta file already exists. If it does import the metadata.\n    std::string filePath(destination + \".asset.meta\");\n    if (FileSystem::FileExists(filePath.c_str())) {\n        AssetMetaData::MeshImportData * importData = AssetMetaData::GetMetaData(filePath.c_str());\n        triangulate = importData->triangulate;\n        importNormals = importData->importNormals;\n        importTangents = importData->importTangents;\n\n        delete importData;\n        isImported = true;\n    } else {\n        isImported = false;\n    }\n}\n\nvoid ModelEditor::LoadTexture(const std::string& path, const std::string& name) {\n    if (!path.empty()) {\n        std::string textureName = model->name + name;\n        std::string src = FileSystem::GetDirectory(source) + path;\n        std::string dest = model->path + textureName;\n        \n        \/\/ Copy file.\n        FileSystem::Copy(src.c_str(), (Hymn().GetPath() + \"\/\" + dest + \".png\").c_str());\n        \n        \/\/ Add texture asset.\n        ResourceList::Resource resource;\n        resource.type = ResourceList::Resource::TEXTURE;\n        resource.texture = Managers().resourceManager->CreateTextureAsset(dest);\n        folder->resources.push_back(resource);\n    }\n}\n<commit_msg>Add material to component<commit_after>#include \"ModelEditor.hpp\"\n\n#include <Engine\/Geometry\/Model.hpp>\n#include \"..\/FileSelector.hpp\"\n#include <functional>\n#include <Engine\/Hymn.hpp>\n#include <Engine\/Util\/FileSystem.hpp>\n#include <imgui.h>\n#include \"Util\/AssetMetaData.hpp\"\n#include <Utility\/Log.hpp>\n#include \"..\/..\/Resources.hpp\"\n#include <Engine\/Manager\/Managers.hpp>\n#include <Engine\/Manager\/ResourceManager.hpp>\n#include <Engine\/Entity\/Entity.hpp>\n#include <Engine\/Component\/Mesh.hpp>\n#include <Engine\/Component\/Material.hpp>\n\nusing namespace GUI;\n\nModelEditor::ModelEditor() {\n    name[0] = '\\0';\n}\n\nvoid ModelEditor::Show() {\n    if (ImGui::Begin((\"Model: \" + model->name + \"###\" + std::to_string(reinterpret_cast<uintptr_t>(model))).c_str(), &visible, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_ShowBorders)) {\n        if (ImGui::InputText(\"Name\", name, 128, ImGuiInputTextFlags_EnterReturnsTrue)) {\n            model->name = name;\n\n            \/\/ Rename all the files.\n            if (FileSystem::FileExists((destination + \".fbx\").c_str())) {\n                FileSystem::Rename(destination + \".fbx\", std::string(name) + \".fbx\");\n\n                if (FileSystem::FileExists((destination + \".asset\").c_str()))\n                    FileSystem::Rename(destination + \".asset\", std::string(name) + \".asset\");\n\n                if (FileSystem::FileExists((destination + \".asset.meta\").c_str()))\n                    FileSystem::Rename(destination + \".asset.meta\", std::string(name) + \".asset.meta\");\n\n                destination = Hymn().GetPath() + FileSystem::DELIMITER + \"Models\" + FileSystem::DELIMITER + name;\n            }\n        }\n\n        if (ImGui::Button(\"Open model\")) {\n            \/\/ Currently only fbx is tested.\n            fileSelector.AddExtensions(\"fbx\");\n\n            \/\/ Set the initial path to the models directory.\n            fileSelector.SetInitialPath((Hymn().GetPath() + FileSystem::DELIMITER + \"Models\").c_str());\n            fileSelector.SetFileSelectedCallback(std::bind(&ModelEditor::FileSelected, this, std::placeholders::_1));\n            fileSelector.SetVisible(true);\n        }\n\n        if (hasSourceFile) {\n            ImGui::Text(\"Mesh Data\");\n            ImGui::Checkbox(\"Uniform Scaling\", &uniformScaling);\n\n            if (uniformScaling) {\n                float uniScale = scale.x;\n                ImGui::DragFloat(\"Scale\", &uniScale, 0.01f);\n                scale = glm::vec3(uniScale);\n            } else\n                ImGui::DragFloat3(\"Scale\", &scale[0], 0.01f);\n            \n            ImGui::Checkbox(\"Triangulate\", &triangulate);\n            ImGui::Checkbox(\"Import Normals\", &importNormals);\n            ImGui::Checkbox(\"Import Tangents\", &importTangents);\n            ImGui::Checkbox(\"Import Textures\", &importTextures);\n            ImGui::Checkbox(\"Flip UVs\", &flipUVs);\n            ImGui::Checkbox(\"Create scene\", &createScene);\n\n            std::string button = isImported ? \"Re-import\" : \"Import\";\n\n            if (ImGui::Button(button.c_str())) {\n                AssetConverter::Materials materials;\n                \n                \/\/ Convert to .asset format.\n                AssetConverter asset;\n                asset.Convert(source.c_str(), (destination + \".asset\").c_str(), scale, triangulate, importNormals, importTangents, flipUVs, importTextures, materials);\n                model->Load(destination.c_str());\n                msgString = asset.Success() ? \"Success\\n\" : asset.GetErrorString();\n                isImported = true;\n\n                \/\/ Generate meta data.\n                AssetMetaData::MeshImportData* importData = new AssetMetaData::MeshImportData;\n                importData->triangulate = triangulate;\n                importData->importNormals = importNormals;\n                importData->importTangents = importTangents;\n                AssetMetaData::GenerateMetaData((destination + \".asset.meta\").c_str(), importData);\n                \n                \/\/ Import textures.\n                if (importTextures) {\n                    LoadTexture(materials.albedo, \"Albedo\");\n                    LoadTexture(materials.normal, \"Normal\");\n                    LoadTexture(materials.roughness, \"Roughness\");\n                    LoadTexture(materials.metallic, \"Metallic\");\n                }\n\n                delete importData;\n                \n                \/\/ Create scene containing an entity with the model and textures.\n                if (createScene) {\n                    \/\/ Create resource.\n                    ResourceList::Resource resource;\n                    resource.type = ResourceList::Resource::SCENE;\n                    resource.scene = model->name + \"Scene\";\n                    folder->resources.push_back(resource);\n                    \n                    \/\/ Create and save scene.\n                    World* world = new World();\n                    world->CreateRoot();\n                    Entity* entity = world->GetRoot()->AddChild(model->name);\n                    \n                    Component::Mesh* mesh = entity->AddComponent<Component::Mesh>();\n                    mesh->geometry = model;\n                    \n                    Component::Material* material = entity->AddComponent<Component::Material>();\n                    \n                    world->Save(Hymn().GetPath() + \"\/\" + model->path + model->name + \"Scene.json\");\n                    \n                    \/\/ Cleanup.\n                    mesh->geometry = nullptr;\n                    mesh->Kill();\n                    material->Kill();\n                    delete world;\n                }\n            }\n\n            if (isImported)\n                ImGui::Text(msgString.c_str());\n        }\n    }\n    ImGui::End();\n\n    if (fileSelector.IsVisible())\n        fileSelector.Show();\n}\n\nconst Geometry::Model* ModelEditor::GetModel() const {\n    return model;\n}\n\nvoid ModelEditor::SetModel(ResourceList::ResourceFolder* folder, Geometry::Model* model) {\n    this->folder = folder;\n    this->model = model;\n\n    strcpy(name, model->name.c_str());\n\n    destination = Hymn().GetPath() + \"\/\" + model->path + name;\n\n    RefreshImportSettings();\n}\n\nbool ModelEditor::IsVisible() const {\n    return visible;\n}\n\nvoid ModelEditor::SetVisible(bool visible) {\n    this->visible = visible;\n}\n\nvoid ModelEditor::FileSelected(const std::string& file) {\n    std::string name = FileSystem::GetName(file).c_str();\n\n    \/\/ Checking so that the file isn't imported twice.\n    \/\/\/ @todo Overwrite option?\n    \/\/\/ @todo Reimplement this.\n    \/*for (int i = 0; i < Resources().models.size(); ++i) {\n        if (Resources().models[i]->name == name) {\n            Log() << \"File \" << name << \" is already added to project.\\n\";\n            isImported = false;\n            hasSourceFile = false;\n            return;\n        }\n    }*\/\n\n    source = file;\n\n    \/\/ Rename the model to the name of the source file.\n    strcpy(this->name, name.c_str());\n    model->name = this->name;\n\n    destination = Hymn().GetPath() + \"\/\" + model->path + name;\n\n    \/\/ Check if source file is in proper directory, otherwise, copy it.\n    if (!FileSystem::FileExists((destination + \".\" + FileSystem::GetExtension(source)).c_str()))\n        FileSystem::Copy(source.c_str(), (destination + \".\" + FileSystem::GetExtension(source)).c_str());\n\n    hasSourceFile = true;\n\n    RefreshImportSettings();\n}\n\nvoid ModelEditor::RefreshImportSettings() {\n    \/\/ Check if the source file exist, currently only .fbx is supported.\n    if (!FileSystem::FileExists((destination + \".fbx\").c_str())) {\n        hasSourceFile = false;\n        isImported = false;\n        return;\n    }\n\n    \/\/ Check if meta file already exists. If it does import the metadata.\n    std::string filePath(destination + \".asset.meta\");\n    if (FileSystem::FileExists(filePath.c_str())) {\n        AssetMetaData::MeshImportData * importData = AssetMetaData::GetMetaData(filePath.c_str());\n        triangulate = importData->triangulate;\n        importNormals = importData->importNormals;\n        importTangents = importData->importTangents;\n\n        delete importData;\n        isImported = true;\n    } else {\n        isImported = false;\n    }\n}\n\nvoid ModelEditor::LoadTexture(const std::string& path, const std::string& name) {\n    if (!path.empty()) {\n        std::string textureName = model->name + name;\n        std::string src = FileSystem::GetDirectory(source) + path;\n        std::string dest = model->path + textureName;\n        \n        \/\/ Copy file.\n        FileSystem::Copy(src.c_str(), (Hymn().GetPath() + \"\/\" + dest + \".png\").c_str());\n        \n        \/\/ Add texture asset.\n        ResourceList::Resource resource;\n        resource.type = ResourceList::Resource::TEXTURE;\n        resource.texture = Managers().resourceManager->CreateTextureAsset(dest);\n        folder->resources.push_back(resource);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * COPYRIGHT:        See LICENSE in the top level directory\n * PROJECT:          HPCsim\n * FILE:             HPCsim\/main.cpp\n * PURPOSE:          Main simulation file\n * PROGRAMMER:       Pierre Schweitzer (pierre@reactos.org)\n *\/\n\n#include <iostream>\n#include <unistd.h>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <getopt.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <dlfcn.h>\n#include <cassert>\n\n#include \"TThreadsFactory.h\"\n#include \"RngStream.h\"\n#include \"simulation.h\"\n\n#define PATH_MAX 0x1000\n\n#define DEFAULT_NAME {'H', 'P', 'C', 's', 'i', 'm', '.', 'o', 'u', 't', '\\0'}\n\nstruct TSimulationAddresses\n{\n    TSimulationInit fSimulationInit;\n    TRunInit fRunInit;\n    TEventInit fEventInit;\n    TEventRun fEventRun;\n    TEventClear fEventClear;\n    TRunClear fRunClear;\n    TSimulationUnload fSimulationUnload;\n};\n\n#ifdef USE_PILOT_THREAD\nstruct TPilotJobContext\n{\n    unsigned long fEvents;\n    void * fSimulationContext;\n};\n#endif\n\nstatic pthread_mutex_t gPipeLock;\nstatic int gPipe[2];\nstatic TResult gNullResult;\nstatic TSimulationAddresses gSimulation;\n\n#define LoadAndSetSimulationFunction(name)                      \\\n    gSimulation.f##name = (T##name)dlsym(simulationLib, #name); \\\n    if (gSimulation.f##name == 0) {                             \\\n        std::cerr << \"Failed loading \" << #name << std::endl;   \\\n        goto end;                                               \\\n    }\n\n\/* Exported *\/\ndouble RandU01(void * context)\n{\n    RngStream * rand = reinterpret_cast<RngStream *>(context);\n\n    return rand->RandU01();\n}\n\n\/* Exported *\/\nvoid QueueResult(TResult * result, void * context)\n{\n    RngStream * rand = reinterpret_cast<RngStream *>(context);\n\n    \/* Set our ID first, and send to write thread *\/\n    memcpy(result->fId, rand->GetDigest(), sizeof(TResult::fId));\n    pthread_mutex_lock(&gPipeLock);\n    write(gPipe[1], result, sizeof(TResult));\n    pthread_mutex_unlock(&gPipeLock);\n}\n\nstatic void * SimulationLoop(void * Arg)\n{\n#ifdef USE_PILOT_THREAD\n    TPilotJobContext * context = reinterpret_cast<TPilotJobContext *>(Arg);\n    void * simulationContext = context->fSimulationContext;\n\n    for (unsigned long event = 0; event < context->fEvents; ++event)\n#else\n    void * simulationContext = reinterpret_cast<void *>(Arg);\n#endif\n    {\n        void * eventContext;\n        RngStream rand;\n\n        \/* Init the event *\/\n        if (gSimulation.fEventInit(simulationContext, &rand, &eventContext) < 0)\n        {\n#ifdef USE_PILOT_THREAD\n            continue;\n#else\n            sem_post(TThreadsFactory::GetInstance()->GetInitLock());\n            return 0;\n#endif\n        }\n\n        \/* Release init lock *\/\n        sem_post(TThreadsFactory::GetInstance()->GetInitLock());\n\n        \/* Call the simulation *\/\n        gSimulation.fEventRun(simulationContext, eventContext);\n\n#ifdef USE_PILOT_THREAD\n        sem_wait(TThreadsFactory::GetInstance()->GetInitLock());\n#endif\n\n        \/* Notify end of event *\/\n        gSimulation.fEventClear(simulationContext, eventContext);\n    }\n\n#ifdef USE_PILOT_THREAD\n    sem_post(TThreadsFactory::GetInstance()->GetInitLock());\n#endif\n\n    return 0;\n}\n\nstatic void * WriteResults(void * Arg)\n{\n    TResult result;\n    char * outputFile = reinterpret_cast<char *>(Arg);\n    int outFD;\n\n    \/* Open the output file *\/\n    outFD = open(outputFile, O_CREAT | O_WRONLY | O_TRUNC, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n    assert(outFD != -1);\n\n    \/* Read the incoming event *\/\n    while (read(gPipe[0], &result, sizeof(TResult)) > 0)\n    {\n        \/* End signal => stop dealing with data *\/\n        if (memcmp(&result, &gNullResult, sizeof(TResult)) == 0)\n            break;\n\n        \/* Write the event to the output file *\/\n        write(outFD, &result, sizeof(TResult));\n    }\n\n    close(outFD);\n\n    return 0;\n}\n\nstatic void PrintUsage(char * name)\n{\n    std::cerr << \"Usage: \" << name << \" --simulation|-s name.so [--threads|-t X --first|-f X --events|-e X --output|-o name]\" << std::endl;\n    std::cerr << \"\\t- Simulation: path of the shared library containing the simulation\" << std::endl;\n    std::cerr << \"\\t- Threads: amount of threads to use for computing (min 1). Beware an extra thread will be used for results writing\" << std::endl;\n    std::cerr << \"\\t- First: start the event loop at this event\" << std::endl;\n    std::cerr << \"\\t- Events: number of events to compute\" << std::endl;\n    std::cerr << \"\\t- Output: name of the output file to write\" << std::endl;\n}\n\nint main(int argc, char * argv[])\n{\n    int option;\n    unsigned int nThreads = 1;\n    unsigned long nEvents = 100;\n    unsigned long firstEvent = 0;\n    char outputFile[PATH_MAX] = DEFAULT_NAME;\n    char simulationFile[PATH_MAX] = \"\";\n    pthread_t writingThread;\n    void * ret;\n    void * simulationLib;\n    void * simulationContext;\n#ifdef USE_PILOT_THREAD\n    unsigned long eventsPerThread = 0;\n    unsigned long padding = 0;\n    TPilotJobContext * contexts = 0;\n    TPilotJobContext * context = 0;\n#endif\n\n    \/* Parse arguments *\/\n    while (true)\n    {\n        static struct option long_options[] =\n        {\n            {\"threads\", required_argument, 0, 't'},\n            {\"events\", required_argument, 0, 'e'},\n            {\"output\", required_argument, 0, 'o'},\n            {\"first\", required_argument, 0, 'f'},\n            {\"simulation\", required_argument, 0, 's'},\n            {0, 0, 0, 0}\n        };\n\n        int option_index = 0;\n        option = getopt_long(argc, argv, \"e:t:o:f:s:\", long_options, &option_index);\n        if (option == -1)\n            break;\n\n        switch (option)\n        {\n            static bool written = false;\n\n            case 't':\n                nThreads = strtoul(optarg, 0, 10);\n                break;\n\n            case 'e':\n                nEvents = strtoul(optarg, 0, 10);\n                break;\n\n            case 'o':\n                strncpy(outputFile, optarg, PATH_MAX - 1);\n                outputFile[PATH_MAX - 1] = '\\0';\n                break;\n\n            case 'f':\n                firstEvent = strtoul(optarg, 0, 10);\n                break;\n\n            case 's':\n                strncpy(simulationFile, optarg, PATH_MAX - 1);\n                simulationFile[PATH_MAX - 1] = '\\0';\n                break;\n\n            case '?':\n                if (!written)\n                {\n                    PrintUsage(argv[0]);\n                    written = true;\n                }\n                break;\n        }\n    }\n\n    if (simulationFile[0] == '\\0')\n    {\n        PrintUsage(argv[0]);\n        return 0;\n    }\n\n    \/* Open the simulation worker *\/\n    simulationLib = dlopen(simulationFile, RTLD_NOW | RTLD_LOCAL);\n    if (simulationLib == 0)\n    {\n        std::cerr << \"Failed loading \" << simulationLib << std::endl;\n        return 0;\n    }\n\n    \/* Load its functions *\/\n    LoadAndSetSimulationFunction(SimulationInit);\n    LoadAndSetSimulationFunction(RunInit);\n    LoadAndSetSimulationFunction(EventInit);\n    LoadAndSetSimulationFunction(EventRun);\n    LoadAndSetSimulationFunction(EventClear);\n    LoadAndSetSimulationFunction(RunClear);\n    LoadAndSetSimulationFunction(SimulationUnload);\n\n    \/* Init the simulation *\/\n    if (gSimulation.fSimulationInit(nThreads, nEvents, firstEvent, &simulationContext) < 0)\n    {\n        goto end;\n    }\n\n    \/* Advance in the generator *\/\n    for (unsigned long i = 0; i < firstEvent; ++i)\n    {\n        RngStream rand;\n    }\n\n    \/* Initialize our pipe lock *\/\n    pthread_mutex_init(&gPipeLock, 0);\n    \/* Start our threads factory *\/\n    TThreadsFactory::GetInstance()->SetMaxThreads(nThreads);\n    \/* Init our null event *\/\n    memset(&gNullResult, 0, sizeof(TResult));\n\n    \/* Open the communication pipe *\/\n    if (pipe(gPipe) == -1)\n    {\n        goto end2;\n    }\n\n    \/* Start our background writing thread *\/\n    if (pthread_create(&writingThread, 0, WriteResults, outputFile) != 0)\n    {\n        goto end3;\n    }\n\n    \/* Initialize the run *\/\n    if (gSimulation.fRunInit(simulationContext) < 0)\n    {\n        goto end4;\n    }\n\n#ifndef USE_PILOT_THREAD\n    \/* Hot loop, the simulation happens here *\/\n    for (unsigned long event = 0; event < nEvents; ++event)\n    {\n        TThreadsFactory::GetInstance()->CreateThread(SimulationLoop, simulationContext);\n    }\n#else\n    \/* Alloc once, use multipe times - reduce overhead *\/\n    contexts = new TPilotJobContext[nThreads];\n\n    \/* Compute number of events required per thread *\/\n    eventsPerThread = nEvents \/ nThreads;\n    \/* Compute number of threads where we have to +1 number of events to get exact amount *\/\n    padding = nEvents % nThreads;\n    \/* Start at first event *\/\n    context = contexts;\n\n    for (unsigned long thread = 0; thread < nThreads; ++thread)\n    {\n        context->fSimulationContext = simulationContext;\n        context->fEvents = eventsPerThread + ((thread < padding) ? 1 : 0);\n        TThreadsFactory::GetInstance()->CreateThread(simulationContext, context);\n\n        ++context;\n    }\n#endif\n\n    \/* Wait for all the propagations to finish *\/\n    TThreadsFactory::GetInstance()->WaitForAllThreads();\n\n#ifdef USE_PILOT_THREAD\n    delete contexts;\n#endif\n\n    \/* Signal end of run *\/\n    gSimulation.fRunClear(simulationContext);\n\nend4:\n    \/* Send the end signal to writer *\/\n    write(gPipe[1], &gNullResult, sizeof(TResult));\n\n    \/* Wait for the end of the writer *\/\n    pthread_join(writingThread, &ret);\n\nend3:\n    close(gPipe[0]);\n    close(gPipe[1]);\nend2:\n    pthread_mutex_destroy(&gPipeLock);\n    gSimulation.fSimulationUnload(simulationContext);\nend:\n    dlclose(simulationLib);\n    return 0;\n}\n<commit_msg>Add some error messages<commit_after>\/*\n * COPYRIGHT:        See LICENSE in the top level directory\n * PROJECT:          HPCsim\n * FILE:             HPCsim\/main.cpp\n * PURPOSE:          Main simulation file\n * PROGRAMMER:       Pierre Schweitzer (pierre@reactos.org)\n *\/\n\n#include <iostream>\n#include <unistd.h>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <getopt.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <dlfcn.h>\n#include <cassert>\n\n#include \"TThreadsFactory.h\"\n#include \"RngStream.h\"\n#include \"simulation.h\"\n\n#define PATH_MAX 0x1000\n\n#define DEFAULT_NAME {'H', 'P', 'C', 's', 'i', 'm', '.', 'o', 'u', 't', '\\0'}\n\nstruct TSimulationAddresses\n{\n    TSimulationInit fSimulationInit;\n    TRunInit fRunInit;\n    TEventInit fEventInit;\n    TEventRun fEventRun;\n    TEventClear fEventClear;\n    TRunClear fRunClear;\n    TSimulationUnload fSimulationUnload;\n};\n\n#ifdef USE_PILOT_THREAD\nstruct TPilotJobContext\n{\n    unsigned long fEvents;\n    void * fSimulationContext;\n};\n#endif\n\nstatic pthread_mutex_t gPipeLock;\nstatic int gPipe[2];\nstatic TResult gNullResult;\nstatic TSimulationAddresses gSimulation;\n\n#define LoadAndSetSimulationFunction(name)                      \\\n    gSimulation.f##name = (T##name)dlsym(simulationLib, #name); \\\n    if (gSimulation.f##name == 0) {                             \\\n        std::cerr << \"Failed loading \" << #name << std::endl;   \\\n        goto end;                                               \\\n    }\n\n\/* Exported *\/\ndouble RandU01(void * context)\n{\n    RngStream * rand = reinterpret_cast<RngStream *>(context);\n\n    return rand->RandU01();\n}\n\n\/* Exported *\/\nvoid QueueResult(TResult * result, void * context)\n{\n    RngStream * rand = reinterpret_cast<RngStream *>(context);\n\n    \/* Set our ID first, and send to write thread *\/\n    memcpy(result->fId, rand->GetDigest(), sizeof(TResult::fId));\n    pthread_mutex_lock(&gPipeLock);\n    write(gPipe[1], result, sizeof(TResult));\n    pthread_mutex_unlock(&gPipeLock);\n}\n\nstatic void * SimulationLoop(void * Arg)\n{\n#ifdef USE_PILOT_THREAD\n    TPilotJobContext * context = reinterpret_cast<TPilotJobContext *>(Arg);\n    void * simulationContext = context->fSimulationContext;\n\n    for (unsigned long event = 0; event < context->fEvents; ++event)\n#else\n    void * simulationContext = reinterpret_cast<void *>(Arg);\n#endif\n    {\n        void * eventContext;\n        RngStream rand;\n\n        \/* Init the event *\/\n        if (gSimulation.fEventInit(simulationContext, &rand, &eventContext) < 0)\n        {\n#ifdef USE_PILOT_THREAD\n            continue;\n#else\n            sem_post(TThreadsFactory::GetInstance()->GetInitLock());\n            return 0;\n#endif\n        }\n\n        \/* Release init lock *\/\n        sem_post(TThreadsFactory::GetInstance()->GetInitLock());\n\n        \/* Call the simulation *\/\n        gSimulation.fEventRun(simulationContext, eventContext);\n\n#ifdef USE_PILOT_THREAD\n        sem_wait(TThreadsFactory::GetInstance()->GetInitLock());\n#endif\n\n        \/* Notify end of event *\/\n        gSimulation.fEventClear(simulationContext, eventContext);\n    }\n\n#ifdef USE_PILOT_THREAD\n    sem_post(TThreadsFactory::GetInstance()->GetInitLock());\n#endif\n\n    return 0;\n}\n\nstatic void * WriteResults(void * Arg)\n{\n    TResult result;\n    char * outputFile = reinterpret_cast<char *>(Arg);\n    int outFD;\n\n    \/* Open the output file *\/\n    outFD = open(outputFile, O_CREAT | O_WRONLY | O_TRUNC, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n    assert(outFD != -1);\n\n    \/* Read the incoming event *\/\n    while (read(gPipe[0], &result, sizeof(TResult)) > 0)\n    {\n        \/* End signal => stop dealing with data *\/\n        if (memcmp(&result, &gNullResult, sizeof(TResult)) == 0)\n            break;\n\n        \/* Write the event to the output file *\/\n        write(outFD, &result, sizeof(TResult));\n    }\n\n    close(outFD);\n\n    return 0;\n}\n\nstatic void PrintUsage(char * name)\n{\n    std::cerr << \"Usage: \" << name << \" --simulation|-s name.so [--threads|-t X --first|-f X --events|-e X --output|-o name]\" << std::endl;\n    std::cerr << \"\\t- Simulation: path of the shared library containing the simulation\" << std::endl;\n    std::cerr << \"\\t- Threads: amount of threads to use for computing (min 1). Beware an extra thread will be used for results writing\" << std::endl;\n    std::cerr << \"\\t- First: start the event loop at this event\" << std::endl;\n    std::cerr << \"\\t- Events: number of events to compute\" << std::endl;\n    std::cerr << \"\\t- Output: name of the output file to write\" << std::endl;\n}\n\nint main(int argc, char * argv[])\n{\n    int option;\n    unsigned int nThreads = 1;\n    unsigned long nEvents = 100;\n    unsigned long firstEvent = 0;\n    char outputFile[PATH_MAX] = DEFAULT_NAME;\n    char simulationFile[PATH_MAX] = \"\";\n    pthread_t writingThread;\n    void * ret;\n    void * simulationLib;\n    void * simulationContext;\n#ifdef USE_PILOT_THREAD\n    unsigned long eventsPerThread = 0;\n    unsigned long padding = 0;\n    TPilotJobContext * contexts = 0;\n    TPilotJobContext * context = 0;\n#endif\n\n    \/* Parse arguments *\/\n    while (true)\n    {\n        static struct option long_options[] =\n        {\n            {\"threads\", required_argument, 0, 't'},\n            {\"events\", required_argument, 0, 'e'},\n            {\"output\", required_argument, 0, 'o'},\n            {\"first\", required_argument, 0, 'f'},\n            {\"simulation\", required_argument, 0, 's'},\n            {0, 0, 0, 0}\n        };\n\n        int option_index = 0;\n        option = getopt_long(argc, argv, \"e:t:o:f:s:\", long_options, &option_index);\n        if (option == -1)\n            break;\n\n        switch (option)\n        {\n            static bool written = false;\n\n            case 't':\n                nThreads = strtoul(optarg, 0, 10);\n                break;\n\n            case 'e':\n                nEvents = strtoul(optarg, 0, 10);\n                break;\n\n            case 'o':\n                strncpy(outputFile, optarg, PATH_MAX - 1);\n                outputFile[PATH_MAX - 1] = '\\0';\n                break;\n\n            case 'f':\n                firstEvent = strtoul(optarg, 0, 10);\n                break;\n\n            case 's':\n                strncpy(simulationFile, optarg, PATH_MAX - 1);\n                simulationFile[PATH_MAX - 1] = '\\0';\n                break;\n\n            case '?':\n                if (!written)\n                {\n                    PrintUsage(argv[0]);\n                    written = true;\n                }\n                break;\n        }\n    }\n\n    if (simulationFile[0] == '\\0')\n    {\n        PrintUsage(argv[0]);\n        return 0;\n    }\n\n    \/* Open the simulation worker *\/\n    simulationLib = dlopen(simulationFile, RTLD_NOW | RTLD_LOCAL);\n    if (simulationLib == 0)\n    {\n        std::cerr << \"Failed loading \" << simulationLib << std::endl;\n        return 0;\n    }\n\n    \/* Load its functions *\/\n    LoadAndSetSimulationFunction(SimulationInit);\n    LoadAndSetSimulationFunction(RunInit);\n    LoadAndSetSimulationFunction(EventInit);\n    LoadAndSetSimulationFunction(EventRun);\n    LoadAndSetSimulationFunction(EventClear);\n    LoadAndSetSimulationFunction(RunClear);\n    LoadAndSetSimulationFunction(SimulationUnload);\n\n    \/* Init the simulation *\/\n    if (gSimulation.fSimulationInit(nThreads, nEvents, firstEvent, &simulationContext) < 0)\n    {\n        std::cerr << \"Failed initializing library\" << std::endl;\n        goto end;\n    }\n\n    \/* Advance in the generator *\/\n    for (unsigned long i = 0; i < firstEvent; ++i)\n    {\n        RngStream rand;\n    }\n\n    \/* Initialize our pipe lock *\/\n    pthread_mutex_init(&gPipeLock, 0);\n    \/* Start our threads factory *\/\n    TThreadsFactory::GetInstance()->SetMaxThreads(nThreads);\n    \/* Init our null event *\/\n    memset(&gNullResult, 0, sizeof(TResult));\n\n    \/* Open the communication pipe *\/\n    if (pipe(gPipe) == -1)\n    {\n        std::cerr << \"Failed creating pipes\" << std::endl;\n        goto end2;\n    }\n\n    \/* Start our background writing thread *\/\n    if (pthread_create(&writingThread, 0, WriteResults, outputFile) != 0)\n    {\n        std::cerr << \"Failed creating writing thread\" << std::endl;\n        goto end3;\n    }\n\n    \/* Initialize the run *\/\n    if (gSimulation.fRunInit(simulationContext) < 0)\n    {\n        std::cerr << \"Failed initializing run\" << std::endl;\n        goto end4;\n    }\n\n#ifndef USE_PILOT_THREAD\n    \/* Hot loop, the simulation happens here *\/\n    for (unsigned long event = 0; event < nEvents; ++event)\n    {\n        TThreadsFactory::GetInstance()->CreateThread(SimulationLoop, simulationContext);\n    }\n#else\n    \/* Alloc once, use multipe times - reduce overhead *\/\n    contexts = new TPilotJobContext[nThreads];\n\n    \/* Compute number of events required per thread *\/\n    eventsPerThread = nEvents \/ nThreads;\n    \/* Compute number of threads where we have to +1 number of events to get exact amount *\/\n    padding = nEvents % nThreads;\n    \/* Start at first event *\/\n    context = contexts;\n\n    for (unsigned long thread = 0; thread < nThreads; ++thread)\n    {\n        context->fSimulationContext = simulationContext;\n        context->fEvents = eventsPerThread + ((thread < padding) ? 1 : 0);\n        TThreadsFactory::GetInstance()->CreateThread(simulationContext, context);\n\n        ++context;\n    }\n#endif\n\n    \/* Wait for all the propagations to finish *\/\n    TThreadsFactory::GetInstance()->WaitForAllThreads();\n\n#ifdef USE_PILOT_THREAD\n    delete contexts;\n#endif\n\n    \/* Signal end of run *\/\n    gSimulation.fRunClear(simulationContext);\n\nend4:\n    \/* Send the end signal to writer *\/\n    write(gPipe[1], &gNullResult, sizeof(TResult));\n\n    \/* Wait for the end of the writer *\/\n    pthread_join(writingThread, &ret);\n\nend3:\n    close(gPipe[0]);\n    close(gPipe[1]);\nend2:\n    pthread_mutex_destroy(&gPipeLock);\n    gSimulation.fSimulationUnload(simulationContext);\nend:\n    dlclose(simulationLib);\n    return 0;\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 \"remoting\/host\/pairing_registry_delegate_win.h\"\n\n#include \"base\/json\/json_string_value_serializer.h\"\n#include \"base\/logging.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"base\/win\/registry.h\"\n\nnamespace remoting {\n\nnamespace {\n\n\/\/ Duplicates a registry key handle (returned by RegCreateXxx\/RegOpenXxx).\n\/\/ The returned handle cannot be inherited and has the same permissions as\n\/\/ the source one.\nbool DuplicateKeyHandle(HKEY source, base::win::RegKey* dest) {\n  HANDLE handle;\n  if (!DuplicateHandle(GetCurrentProcess(),\n                       source,\n                       GetCurrentProcess(),\n                       &handle,\n                       0,\n                       FALSE,\n                       DUPLICATE_SAME_ACCESS)) {\n    PLOG(ERROR) << \"Failed to duplicate a registry key handle\";\n    return false;\n  }\n\n  dest->Set(reinterpret_cast<HKEY>(handle));\n  return true;\n}\n\n\/\/ Reads value |value_name| from |key| as a JSON string and returns it as\n\/\/ |base::Value|.\nscoped_ptr<base::DictionaryValue> ReadValue(const base::win::RegKey& key,\n                                            const wchar_t* value_name) {\n  \/\/ presubmit: allow wstring\n  std::wstring value_json;\n  LONG result = key.ReadValue(value_name, &value_json);\n  if (result != ERROR_SUCCESS) {\n    SetLastError(result);\n    PLOG(ERROR) << \"Cannot read value '\" << value_name << \"'\";\n    return scoped_ptr<base::DictionaryValue>();\n  }\n\n  \/\/ Parse the value.\n  std::string value_json_utf8 = WideToUTF8(value_json);\n  JSONStringValueSerializer serializer(&value_json_utf8);\n  int error_code;\n  std::string error_message;\n  scoped_ptr<base::Value> value(serializer.Deserialize(&error_code,\n                                                       &error_message));\n  if (!value) {\n    LOG(ERROR) << \"Failed to parse '\" << value_name << \"': \" << error_message\n               << \" (\" << error_code << \").\";\n    return scoped_ptr<base::DictionaryValue>();\n  }\n\n  if (value->GetType() != base::Value::TYPE_DICTIONARY) {\n    LOG(ERROR) << \"Failed to parse '\" << value_name << \"': not a dictionary.\";\n    return scoped_ptr<base::DictionaryValue>();\n  }\n\n  return scoped_ptr<base::DictionaryValue>(\n      static_cast<base::DictionaryValue*>(value.release()));\n}\n\n\/\/ Serializes |value| into a JSON string and writes it as value |value_name|\n\/\/ under |key|.\nbool WriteValue(base::win::RegKey& key,\n                const wchar_t* value_name,\n                scoped_ptr<base::DictionaryValue> value) {\n  std::string value_json_utf8;\n  JSONStringValueSerializer serializer(&value_json_utf8);\n  if (!serializer.Serialize(*value)) {\n    LOG(ERROR) << \"Failed to serialize '\" << value_name << \"'\";\n    return false;\n  }\n\n  \/\/ presubmit: allow wstring\n  std::wstring value_json = UTF8ToWide(value_json_utf8);\n  LONG result = key.WriteValue(value_name,\n                               UTF8ToWide(value_json_utf8).c_str());\n  if (result != ERROR_SUCCESS) {\n    SetLastError(result);\n    PLOG(ERROR) << \"Cannot write value '\" << value_name << \"'\";\n    return false;\n  }\n\n  return true;\n}\n\n}  \/\/ namespace\n\nusing protocol::PairingRegistry;\n\nPairingRegistryDelegateWin::PairingRegistryDelegateWin() {\n}\n\nPairingRegistryDelegateWin::~PairingRegistryDelegateWin() {\n}\n\nbool PairingRegistryDelegateWin::SetRootKeys(HKEY privileged,\n                                             HKEY unprivileged) {\n  DCHECK(!privileged_.Valid());\n  DCHECK(!unprivileged_.Valid());\n  DCHECK(unprivileged);\n\n  if (!DuplicateKeyHandle(unprivileged, &unprivileged_))\n    return false;\n\n  if (privileged) {\n    if (!DuplicateKeyHandle(privileged, &privileged_))\n      return false;\n  }\n\n  return true;\n}\n\nscoped_ptr<base::ListValue> PairingRegistryDelegateWin::LoadAll() {\n  scoped_ptr<base::ListValue> pairings(new base::ListValue());\n\n  \/\/ Enumerate and parse all values under the unprivileged key.\n  DWORD count = unprivileged_.GetValueCount();\n  for (DWORD index = 0; index < count; ++index) {\n    \/\/ presubmit: allow wstring\n    std::wstring value_name;\n    LONG result = unprivileged_.GetValueNameAt(index, &value_name);\n    if (result != ERROR_SUCCESS) {\n      SetLastError(result);\n      PLOG(ERROR) << \"Cannot get the name of value \" << index;\n      continue;\n    }\n\n    PairingRegistry::Pairing pairing = Load(WideToUTF8(value_name));\n    if (pairing.is_valid())\n      pairings->Append(pairing.ToValue().release());\n  }\n\n  return pairings.Pass();\n}\n\nbool PairingRegistryDelegateWin::DeleteAll() {\n  if (!privileged_.Valid()) {\n    LOG(ERROR) << \"Cannot delete pairings: the delegate is read-only.\";\n    return false;\n  }\n\n  bool success = true;\n  DWORD count = unprivileged_.GetValueCount();\n  while (count > 0) {\n    \/\/ presubmit: allow wstring\n    std::wstring value_name;\n    LONG result = unprivileged_.GetValueNameAt(0, &value_name);\n    if (result == ERROR_SUCCESS)\n      result = unprivileged_.DeleteValue(value_name.c_str());\n\n    success = success && (result == ERROR_SUCCESS);\n    count = unprivileged_.GetValueCount();\n  }\n\n  return success;\n}\n\nPairingRegistry::Pairing PairingRegistryDelegateWin::Load(\n    const std::string& client_id) {\n  \/\/ presubmit: allow wstring\n  std::wstring value_name = UTF8ToWide(client_id);\n\n  \/\/ Read unprivileged fields first.\n  scoped_ptr<base::DictionaryValue> pairing = ReadValue(unprivileged_,\n                                                        value_name.c_str());\n  if (!pairing)\n    return PairingRegistry::Pairing();\n\n  \/\/ Read the shared secret.\n  if (privileged_.Valid()) {\n    scoped_ptr<base::DictionaryValue> secret = ReadValue(privileged_,\n                                                         value_name.c_str());\n    if (!secret)\n      return PairingRegistry::Pairing();\n\n    \/\/ Merge the two dictionaries.\n    pairing->MergeDictionary(secret.get());\n  }\n\n  return PairingRegistry::Pairing::CreateFromValue(*pairing);\n}\n\nbool PairingRegistryDelegateWin::Save(const PairingRegistry::Pairing& pairing) {\n  if (!privileged_.Valid()) {\n    LOG(ERROR) << \"Cannot save pairing entry '\" << pairing.client_id()\n                << \"': the delegate is read-only.\";\n    return false;\n  }\n\n  \/\/ Convert pairing to JSON.\n  scoped_ptr<base::DictionaryValue> pairing_json = pairing.ToValue();\n\n  \/\/ Extract the shared secret to a separate dictionary.\n  scoped_ptr<base::Value> secret_key;\n  CHECK(pairing_json->Remove(PairingRegistry::kSharedSecretKey, &secret_key));\n  scoped_ptr<base::DictionaryValue> secret_json(new base::DictionaryValue());\n  secret_json->Set(PairingRegistry::kSharedSecretKey, secret_key.release());\n\n  \/\/ presubmit: allow wstring\n  std::wstring value_name = UTF8ToWide(pairing.client_id());\n\n  \/\/ Write pairing to the registry.\n  if (!WriteValue(privileged_, value_name.c_str(), secret_json.Pass()) ||\n      !WriteValue(unprivileged_, value_name.c_str(), pairing_json.Pass())) {\n    return false;\n  }\n\n  return true;\n}\n\nbool PairingRegistryDelegateWin::Delete(const std::string& client_id) {\n  if (!privileged_.Valid()) {\n    LOG(ERROR) << \"Cannot delete pairing entry '\" << client_id\n                << \"': the delegate is read-only.\";\n    return false;\n  }\n\n  \/\/ presubmit: allow wstring\n  std::wstring value_name = UTF8ToWide(client_id);\n  LONG result = privileged_.DeleteValue(value_name.c_str());\n  if (result != ERROR_SUCCESS &&\n      result != ERROR_FILE_NOT_FOUND &&\n      result != ERROR_PATH_NOT_FOUND) {\n    SetLastError(result);\n    PLOG(ERROR) << \"Cannot delete pairing entry '\" << client_id << \"'\";\n    return false;\n  }\n\n  result = unprivileged_.DeleteValue(value_name.c_str());\n  if (result != ERROR_SUCCESS &&\n      result != ERROR_FILE_NOT_FOUND &&\n      result != ERROR_PATH_NOT_FOUND) {\n    SetLastError(result);\n    PLOG(ERROR) << \"Cannot delete pairing entry '\" << client_id << \"'\";\n    return false;\n  }\n\n  return true;\n}\n\nscoped_ptr<PairingRegistry::Delegate> CreatePairingRegistryDelegate() {\n  return scoped_ptr<PairingRegistry::Delegate>();\n}\n\n}  \/\/ namespace remoting\n<commit_msg>Fix unused variable declaration.<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 \"remoting\/host\/pairing_registry_delegate_win.h\"\n\n#include \"base\/json\/json_string_value_serializer.h\"\n#include \"base\/logging.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"base\/win\/registry.h\"\n\nnamespace remoting {\n\nnamespace {\n\n\/\/ Duplicates a registry key handle (returned by RegCreateXxx\/RegOpenXxx).\n\/\/ The returned handle cannot be inherited and has the same permissions as\n\/\/ the source one.\nbool DuplicateKeyHandle(HKEY source, base::win::RegKey* dest) {\n  HANDLE handle;\n  if (!DuplicateHandle(GetCurrentProcess(),\n                       source,\n                       GetCurrentProcess(),\n                       &handle,\n                       0,\n                       FALSE,\n                       DUPLICATE_SAME_ACCESS)) {\n    PLOG(ERROR) << \"Failed to duplicate a registry key handle\";\n    return false;\n  }\n\n  dest->Set(reinterpret_cast<HKEY>(handle));\n  return true;\n}\n\n\/\/ Reads value |value_name| from |key| as a JSON string and returns it as\n\/\/ |base::Value|.\nscoped_ptr<base::DictionaryValue> ReadValue(const base::win::RegKey& key,\n                                            const wchar_t* value_name) {\n  \/\/ presubmit: allow wstring\n  std::wstring value_json;\n  LONG result = key.ReadValue(value_name, &value_json);\n  if (result != ERROR_SUCCESS) {\n    SetLastError(result);\n    PLOG(ERROR) << \"Cannot read value '\" << value_name << \"'\";\n    return scoped_ptr<base::DictionaryValue>();\n  }\n\n  \/\/ Parse the value.\n  std::string value_json_utf8 = WideToUTF8(value_json);\n  JSONStringValueSerializer serializer(&value_json_utf8);\n  int error_code;\n  std::string error_message;\n  scoped_ptr<base::Value> value(serializer.Deserialize(&error_code,\n                                                       &error_message));\n  if (!value) {\n    LOG(ERROR) << \"Failed to parse '\" << value_name << \"': \" << error_message\n               << \" (\" << error_code << \").\";\n    return scoped_ptr<base::DictionaryValue>();\n  }\n\n  if (value->GetType() != base::Value::TYPE_DICTIONARY) {\n    LOG(ERROR) << \"Failed to parse '\" << value_name << \"': not a dictionary.\";\n    return scoped_ptr<base::DictionaryValue>();\n  }\n\n  return scoped_ptr<base::DictionaryValue>(\n      static_cast<base::DictionaryValue*>(value.release()));\n}\n\n\/\/ Serializes |value| into a JSON string and writes it as value |value_name|\n\/\/ under |key|.\nbool WriteValue(base::win::RegKey& key,\n                const wchar_t* value_name,\n                scoped_ptr<base::DictionaryValue> value) {\n  std::string value_json_utf8;\n  JSONStringValueSerializer serializer(&value_json_utf8);\n  if (!serializer.Serialize(*value)) {\n    LOG(ERROR) << \"Failed to serialize '\" << value_name << \"'\";\n    return false;\n  }\n\n  \/\/ presubmit: allow wstring\n  std::wstring value_json = UTF8ToWide(value_json_utf8);\n  LONG result = key.WriteValue(value_name, value_json.c_str());\n  if (result != ERROR_SUCCESS) {\n    SetLastError(result);\n    PLOG(ERROR) << \"Cannot write value '\" << value_name << \"'\";\n    return false;\n  }\n\n  return true;\n}\n\n}  \/\/ namespace\n\nusing protocol::PairingRegistry;\n\nPairingRegistryDelegateWin::PairingRegistryDelegateWin() {\n}\n\nPairingRegistryDelegateWin::~PairingRegistryDelegateWin() {\n}\n\nbool PairingRegistryDelegateWin::SetRootKeys(HKEY privileged,\n                                             HKEY unprivileged) {\n  DCHECK(!privileged_.Valid());\n  DCHECK(!unprivileged_.Valid());\n  DCHECK(unprivileged);\n\n  if (!DuplicateKeyHandle(unprivileged, &unprivileged_))\n    return false;\n\n  if (privileged) {\n    if (!DuplicateKeyHandle(privileged, &privileged_))\n      return false;\n  }\n\n  return true;\n}\n\nscoped_ptr<base::ListValue> PairingRegistryDelegateWin::LoadAll() {\n  scoped_ptr<base::ListValue> pairings(new base::ListValue());\n\n  \/\/ Enumerate and parse all values under the unprivileged key.\n  DWORD count = unprivileged_.GetValueCount();\n  for (DWORD index = 0; index < count; ++index) {\n    \/\/ presubmit: allow wstring\n    std::wstring value_name;\n    LONG result = unprivileged_.GetValueNameAt(index, &value_name);\n    if (result != ERROR_SUCCESS) {\n      SetLastError(result);\n      PLOG(ERROR) << \"Cannot get the name of value \" << index;\n      continue;\n    }\n\n    PairingRegistry::Pairing pairing = Load(WideToUTF8(value_name));\n    if (pairing.is_valid())\n      pairings->Append(pairing.ToValue().release());\n  }\n\n  return pairings.Pass();\n}\n\nbool PairingRegistryDelegateWin::DeleteAll() {\n  if (!privileged_.Valid()) {\n    LOG(ERROR) << \"Cannot delete pairings: the delegate is read-only.\";\n    return false;\n  }\n\n  bool success = true;\n  DWORD count = unprivileged_.GetValueCount();\n  while (count > 0) {\n    \/\/ presubmit: allow wstring\n    std::wstring value_name;\n    LONG result = unprivileged_.GetValueNameAt(0, &value_name);\n    if (result == ERROR_SUCCESS)\n      result = unprivileged_.DeleteValue(value_name.c_str());\n\n    success = success && (result == ERROR_SUCCESS);\n    count = unprivileged_.GetValueCount();\n  }\n\n  return success;\n}\n\nPairingRegistry::Pairing PairingRegistryDelegateWin::Load(\n    const std::string& client_id) {\n  \/\/ presubmit: allow wstring\n  std::wstring value_name = UTF8ToWide(client_id);\n\n  \/\/ Read unprivileged fields first.\n  scoped_ptr<base::DictionaryValue> pairing = ReadValue(unprivileged_,\n                                                        value_name.c_str());\n  if (!pairing)\n    return PairingRegistry::Pairing();\n\n  \/\/ Read the shared secret.\n  if (privileged_.Valid()) {\n    scoped_ptr<base::DictionaryValue> secret = ReadValue(privileged_,\n                                                         value_name.c_str());\n    if (!secret)\n      return PairingRegistry::Pairing();\n\n    \/\/ Merge the two dictionaries.\n    pairing->MergeDictionary(secret.get());\n  }\n\n  return PairingRegistry::Pairing::CreateFromValue(*pairing);\n}\n\nbool PairingRegistryDelegateWin::Save(const PairingRegistry::Pairing& pairing) {\n  if (!privileged_.Valid()) {\n    LOG(ERROR) << \"Cannot save pairing entry '\" << pairing.client_id()\n                << \"': the delegate is read-only.\";\n    return false;\n  }\n\n  \/\/ Convert pairing to JSON.\n  scoped_ptr<base::DictionaryValue> pairing_json = pairing.ToValue();\n\n  \/\/ Extract the shared secret to a separate dictionary.\n  scoped_ptr<base::Value> secret_key;\n  CHECK(pairing_json->Remove(PairingRegistry::kSharedSecretKey, &secret_key));\n  scoped_ptr<base::DictionaryValue> secret_json(new base::DictionaryValue());\n  secret_json->Set(PairingRegistry::kSharedSecretKey, secret_key.release());\n\n  \/\/ presubmit: allow wstring\n  std::wstring value_name = UTF8ToWide(pairing.client_id());\n\n  \/\/ Write pairing to the registry.\n  if (!WriteValue(privileged_, value_name.c_str(), secret_json.Pass()) ||\n      !WriteValue(unprivileged_, value_name.c_str(), pairing_json.Pass())) {\n    return false;\n  }\n\n  return true;\n}\n\nbool PairingRegistryDelegateWin::Delete(const std::string& client_id) {\n  if (!privileged_.Valid()) {\n    LOG(ERROR) << \"Cannot delete pairing entry '\" << client_id\n                << \"': the delegate is read-only.\";\n    return false;\n  }\n\n  \/\/ presubmit: allow wstring\n  std::wstring value_name = UTF8ToWide(client_id);\n  LONG result = privileged_.DeleteValue(value_name.c_str());\n  if (result != ERROR_SUCCESS &&\n      result != ERROR_FILE_NOT_FOUND &&\n      result != ERROR_PATH_NOT_FOUND) {\n    SetLastError(result);\n    PLOG(ERROR) << \"Cannot delete pairing entry '\" << client_id << \"'\";\n    return false;\n  }\n\n  result = unprivileged_.DeleteValue(value_name.c_str());\n  if (result != ERROR_SUCCESS &&\n      result != ERROR_FILE_NOT_FOUND &&\n      result != ERROR_PATH_NOT_FOUND) {\n    SetLastError(result);\n    PLOG(ERROR) << \"Cannot delete pairing entry '\" << client_id << \"'\";\n    return false;\n  }\n\n  return true;\n}\n\nscoped_ptr<PairingRegistry::Delegate> CreatePairingRegistryDelegate() {\n  return scoped_ptr<PairingRegistry::Delegate>();\n}\n\n}  \/\/ namespace remoting\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"Level.h\"\n#include \"GameSystem.h\"\n#include <fstream>\n#include <sstream>\n#include <mmsystem.h>\n\nLevel::Level() {\n}\n\n\nvoid Level::load(string fileName, Player &player) {\n\n\t_fileName = fileName;\n\n\t\/\/loads the level\n\tifstream file;\n\n\tfile.open(fileName);\n\tif (file.fail()) {\n\t\tperror(fileName.c_str());\n\t\tsystem(\"pause\");\n\t\texit(1);\n\t}\n\n\tstring line;\n\n\twhile (getline(file, line)) {\n\t\t_levelData.push_back(line);\n\t}\n\n\tfile.close();\n\n\t\/\/process the level\n\n\tchar tile;\n\n\tfor (int i = 0; i < _levelData.size(); i++) {\n\t\tfor (int j = 0; j < _levelData[i].size(); j++) {\n\t\t\ttile = _levelData[i][j];\n\n\t\t\tswitch (tile) {\n\n\t\t\tcase '@': \/\/player\n\t\t\t\tplayer.setPosition(j, i);\n\t\t\t\tbreak;\n\t\t\tcase 'g': \/\/goblin\n\t\t\t\t_enemies.push_back(Enemy(\"Goblin\", tile, 1, 3, 1, 100, 10, 5));\n\t\t\t\t_enemies.back().setPosition(j, i);\n\t\t\t\tbreak;\n\t\t\tcase 'O': \/\/ogre\n\t\t\t\t_enemies.push_back(Enemy(\"Ogre\", tile, 5, 20, 50, 50, 100, 10));\n\t\t\t\t_enemies.back().setPosition(j, i);\n\t\t\t\tbreak;\n\t\t\tcase 'D': \/\/dragon\n\t\t\t\t_enemies.push_back(Enemy(\"Dragon\", tile, 100, 500, 1000, 1000, 1000, 20));\n\t\t\t\t_enemies.back().setPosition(j, i);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t}\n\n}\n\n\nvoid Level::print() {\n\t\n\tcls();\n\n\tfor (int i = 0; i < _levelData.size(); i++) {\n\t\tfor (int j = 0; j < _levelData[i].size(); j++) {\n\n\t\t\tswitch (_levelData[i][j]) {\n\t\t\tcase '&': \/\/flame\n\t\t\t\tsetColor(consoleColor(0, 6));\n\t\t\t\tbreak;\n\t\t\tcase '0': \/\/door\n\t\t\tcase '1':\n\t\t\tcase '2':\n\t\t\tcase '3':\n\t\t\tcase '4':\n\t\t\tcase '5':\n\t\t\tcase '6':\n\t\t\tcase '7':\n\t\t\tcase '8':\n\t\t\tcase '9':\n\t\t\t\tsetColor(consoleColor(0, 3));\n\t\t\t\tbreak;\n\t\t\tcase '@': \/\/player\n\t\t\t\tsetColor(consoleColor(0, 9));\n\t\t\t\tbreak;\n\t\t\tcase 'g': \/\/goblin\n\t\t\t\tsetColor(consoleColor(0, 12));\n\t\t\t\tbreak;\n\t\t\tcase 'O': \/\/ogre\n\t\t\t\tsetColor(consoleColor(0, 14));\n\t\t\t\tbreak;\n\t\t\tcase 'D': \/\/dragon\n\t\t\t\tsetColor(consoleColor(0, 4));\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tsetColor(consoleColor(0, 7));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tprintf(\"%c\", _levelData[i][j]);\n\n\t\t}\n\t\t\n\t\tprintf(\"\\n\");\n\n\t}\n\n\tprintf(\"\\n\");\n\n\t\/\/cls();\n\n\n}\n\nvoid Level::movePlayer(char input, Player &player) {\n\n\tint playerX;\n\tint playerY;\n\tplayer.getPosition(playerX, playerY);\n\n\tswitch (input) {\n\n\tcase 'w': \/\/up\n\tcase 'W':\n\t\tprocessPlayerMove(player, playerX, playerY - 1);\n\t\tbreak;\n\tcase 's': \/\/down\n\tcase 'S':\n\t\tprocessPlayerMove(player, playerX, playerY + 1);\n\t\tbreak;\n\tcase 'a': \/\/left\n\tcase 'A':\n\t\tprocessPlayerMove(player, playerX - 1, playerY);\n\t\tbreak;\n\tcase 'd': \/\/right\n\tcase 'D':\n\t\tprocessPlayerMove(player, playerX + 1, playerY);\n\t\tbreak;\n\tdefault:\n\t\tprintf(\"Invalid input.\\n\");\n\t\tsystem(\"pause\");\n\t\tbreak;\n\t}\n\n}\n\nvoid Level::updateEnemies(Player & player) {\n\n\tchar aiMove;\n\tint playerX;\n\tint playerY;\n\tint enemyX;\n\tint enemyY;\n\tplayer.getPosition(playerX, playerY);\n\t\n\n\tfor (int i = 0; i < _enemies.size(); i++) {\n\t\tchar aiMove = _enemies[i].getMove(playerX, playerY);\n\n\t\t_enemies[i].getPosition(enemyX, enemyY);\n\n\t\tswitch (aiMove) {\n\n\t\tcase 'w': \/\/up\n\t\t\n\t\t\tprocessEnemyMove(player, i, enemyX, enemyY - 1);\n\t\t\tbreak;\n\t\tcase 's': \/\/down\n\t\t\n\t\t\tprocessEnemyMove(player, i, enemyX, enemyY + 1);\n\t\t\tbreak;\n\t\tcase 'a': \/\/left\n\t\t\n\t\t\tprocessEnemyMove(player, i, enemyX - 1, enemyY);\n\t\t\tbreak;\n\t\tcase 'd': \/\/right\n\t\t\n\t\t\tprocessEnemyMove(player, i, enemyX + 1, enemyY);\n\t\t\tbreak;\n\t\t\n\t\t}\n\t}\n\n}\n\n\nvoid Level::processPlayerMove(Player &player, int targetX, int targetY) {\n\t\n\t\n\tint playerX, playerY;\n\tplayer.getPosition(playerX, playerY);\n\n\tchar moveTile = getTile(targetX, targetY);\n\n\tswitch (moveTile) {\n\tcase ' ':\n\t\tplayer.setPosition(targetX, targetY);\n\t\tsetTile(playerX, playerY, ' ');\n\t\tsetTile(targetX, targetY, '@');\n\t\tbreak;\n\tcase '&':\n\tcase '|':\n\tcase '+':\n\tcase '-':\n\tcase '#':\n\t\tbreak;\n\tcase '0': \/\/door\n\tcase '1':\n\tcase '2':\n\tcase '3':\n\tcase '4': {\n\t\/\/case '5':\n\t\/\/case '6':\n\t\/\/case '7':\n\t\/\/case '8':\n\t\/\/case '9': {\n\t\t\n\t\t_levelData.clear();\n\t\t_enemies.clear();\n\t\tstringstream ss;\n\t\tss << \"level\" << moveTile << \".map\";\n\t\t\n\n\t\tload(ss.str(), player);\n\t\tbreak;\n\t}\n\tdefault:\n\t\tbattleEnemy(player, targetX, targetY);\n\t\tbreak;\n\t}\n\n}\n\nvoid Level::processEnemyMove(Player &player, int enemyIndex, int targetX, int targetY) {\n\n\tint playerX, playerY;\n\tint enemyX, enemyY;\n\tplayer.getPosition(playerX, playerY);\n\t_enemies[enemyIndex].getPosition(enemyX, enemyY);\n\n\tchar moveTile = getTile(targetX, targetY);\n\n\tswitch (moveTile) {\n\tcase ' ':\n\t\t_enemies[enemyIndex].setPosition(targetX, targetY);\n\t\tsetTile(enemyX, enemyY, ' ');\n\t\tsetTile(targetX, targetY, _enemies[enemyIndex].getTile());\n\t\tbreak;\n\tcase '&':\n\tcase '|':\n\tcase '+':\n\tcase '-':\n\tcase '#':\n\t\tbreak;\n\tcase '0': \/\/door\n\tcase '1':\n\tcase '2':\n\tcase '3':\n\tcase '4':\n\t\/\/case '5':\n\t\/\/case '6':\n\t\/\/case '7':\n\t\/\/case '8':\n\t\/\/case '9': \n\t\tbreak;\n\tcase '@':\n\t\tbattleEnemy(player, enemyX, enemyY);\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n}\n\nvoid Level::battleEnemy(Player & player, int targetX, int targetY) {\n\n\tint enemyX;\n\tint enemyY; \n\tint playerX;\n\tint playerY;\n\tint attackRoll;\n\tint attackResult;\n\n\tplayer.getPosition(playerX, playerY);\n\n\tfor (int i = 0; i < _enemies.size(); i++) {\n\t\t_enemies[i].getPosition(enemyX, enemyY);\n\t\tif (targetX == enemyX && targetY == enemyY) {\n\t\t\t\/\/battle\n\t\t\tattackRoll = player.attack();\n\t\t\t\/\/printf(\"\\nPlayer attacked %s with a roll of %d\\n\", _enemies[i].getName().c_str(), attackRoll);\n\t\t\tattackResult = _enemies[i].takeDamage(attackRoll);\n\n\t\t\tif (attackResult != 0) {\n\n\t\t\t\tsetTile(targetX, targetY, ' ');\n\t\t\t\tprint();\n\t\t\t\tPlaySound(TEXT(\"beep.wav\"), NULL, SND_FILENAME);\n\t\t\t\t\/\/printf(\"\\n%s died\\n\", _enemies[i].getName().c_str());\n\n\t\t\t\t\/\/remove enemy\n\t\t\t\t_enemies[i] = _enemies.back();\n\t\t\t\t_enemies.pop_back();\n\t\t\t\ti--;\n\n\t\t\t\tplayer.addExperience(attackResult);\n\t\t\t\tsystem(\"pause\");\n\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tattackRoll = _enemies[i].attack();\n\t\t\t\/\/printf(\"\\n%s attacked player with a roll of %d\\n\", _enemies[i].getName().c_str(), attackRoll);\n\t\t\tattackResult = player.takeDamage(attackRoll);\n\n\t\t\tif (attackResult != 0) {\n\t\t\t\tsetTile(playerX, playerY, 'x');\n\t\t\t\tprint();\n\t\t\t\tprintf(\"You died\\n\");\n\t\t\t\tsystem(\"pause\");\n\t\t\t\tplayer.addExperience(attackResult);\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tsystem(\"pause\");\n\t\t\treturn;\n\t\t}\n\t}\n\n}\n\nchar Level::getTile(int x, int y) {\n\n\treturn _levelData[y][x];\n\n}\n\nvoid Level::setTile(int x, int y, char tile) {\n\n\t_levelData[y][x] = tile;\n\n}\n\n\nLevel::~Level() {\n}\n<commit_msg>Fixed some visual bugs<commit_after>#include \"stdafx.h\"\n#include \"Level.h\"\n#include \"GameSystem.h\"\n#include <fstream>\n#include <sstream>\n#include <mmsystem.h>\n\nLevel::Level() {\n}\n\n\nvoid Level::load(string fileName, Player &player) {\n\n\t_fileName = fileName;\n\n\t\/\/loads the level\n\tifstream file;\n\n\tfile.open(fileName);\n\tif (file.fail()) {\n\t\tperror(fileName.c_str());\n\t\tsystem(\"pause\");\n\t\texit(1);\n\t}\n\n\tstring line;\n\n\twhile (getline(file, line)) {\n\t\t_levelData.push_back(line);\n\t}\n\n\tfile.close();\n\n\t\/\/process the level\n\n\tchar tile;\n\n\tfor (int i = 0; i < _levelData.size(); i++) {\n\t\tfor (int j = 0; j < _levelData[i].size(); j++) {\n\t\t\ttile = _levelData[i][j];\n\n\t\t\tswitch (tile) {\n\n\t\t\tcase '@': \/\/player\n\t\t\t\tplayer.setPosition(j, i);\n\t\t\t\tbreak;\n\t\t\tcase 'g': \/\/goblin\n\t\t\t\t_enemies.push_back(Enemy(\"Goblin\", tile, 1, 3, 1, 100, 10, 5));\n\t\t\t\t_enemies.back().setPosition(j, i);\n\t\t\t\tbreak;\n\t\t\tcase 'O': \/\/ogre\n\t\t\t\t_enemies.push_back(Enemy(\"Ogre\", tile, 5, 20, 50, 50, 100, 10));\n\t\t\t\t_enemies.back().setPosition(j, i);\n\t\t\t\tbreak;\n\t\t\tcase 'D': \/\/dragon\n\t\t\t\t_enemies.push_back(Enemy(\"Dragon\", tile, 100, 500, 1000, 1000, 1000, 20));\n\t\t\t\t_enemies.back().setPosition(j, i);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t}\n\n}\n\n\nvoid Level::print() {\n\t\n\tcls();\n\n\tfor (int i = 0; i < _levelData.size(); i++) {\n\t\tfor (int j = 0; j < _levelData[i].size(); j++) {\n\n\t\t\tswitch (_levelData[i][j]) {\n\t\t\tcase '&': \/\/flame\n\t\t\t\tsetColor(consoleColor(0, 6));\n\t\t\t\tbreak;\n\t\t\tcase '0': \/\/door\n\t\t\tcase '1':\n\t\t\tcase '2':\n\t\t\tcase '3':\n\t\t\tcase '4':\n\t\t\tcase '5':\n\t\t\tcase '6':\n\t\t\tcase '7':\n\t\t\tcase '8':\n\t\t\tcase '9':\n\t\t\t\tsetColor(consoleColor(0, 3));\n\t\t\t\tbreak;\n\t\t\tcase '@': \/\/player\n\t\t\t\tsetColor(consoleColor(0, 9));\n\t\t\t\tbreak;\n\t\t\tcase 'g': \/\/goblin\n\t\t\t\tsetColor(consoleColor(0, 12));\n\t\t\t\tbreak;\n\t\t\tcase 'O': \/\/ogre\n\t\t\t\tsetColor(consoleColor(0, 14));\n\t\t\t\tbreak;\n\t\t\tcase 'D': \/\/dragon\n\t\t\t\tsetColor(consoleColor(0, 4));\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tsetColor(consoleColor(0, 7));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tprintf(\"%c\", _levelData[i][j]);\n\n\t\t}\n\t\t\n\t\tprintf(\"\\n\");\n\n\t}\n\n\tprintf(\"\\n\");\n\n\t\/\/cls();\n\n\n}\n\nvoid Level::movePlayer(char input, Player &player) {\n\n\tint playerX;\n\tint playerY;\n\tplayer.getPosition(playerX, playerY);\n\n\tswitch (input) {\n\n\tcase 'w': \/\/up\n\tcase 'W':\n\t\tprocessPlayerMove(player, playerX, playerY - 1);\n\t\tbreak;\n\tcase 's': \/\/down\n\tcase 'S':\n\t\tprocessPlayerMove(player, playerX, playerY + 1);\n\t\tbreak;\n\tcase 'a': \/\/left\n\tcase 'A':\n\t\tprocessPlayerMove(player, playerX - 1, playerY);\n\t\tbreak;\n\tcase 'd': \/\/right\n\tcase 'D':\n\t\tprocessPlayerMove(player, playerX + 1, playerY);\n\t\tbreak;\n\tdefault:\n\t\t\/\/printf(\"Invalid input.\\n\");\n\t\t\/\/system(\"pause\");\n\t\tbreak;\n\t}\n\n}\n\nvoid Level::updateEnemies(Player & player) {\n\n\tchar aiMove;\n\tint playerX;\n\tint playerY;\n\tint enemyX;\n\tint enemyY;\n\tplayer.getPosition(playerX, playerY);\n\t\n\n\tfor (int i = 0; i < _enemies.size(); i++) {\n\t\tchar aiMove = _enemies[i].getMove(playerX, playerY);\n\n\t\t_enemies[i].getPosition(enemyX, enemyY);\n\n\t\tswitch (aiMove) {\n\n\t\tcase 'w': \/\/up\n\t\t\n\t\t\tprocessEnemyMove(player, i, enemyX, enemyY - 1);\n\t\t\tbreak;\n\t\tcase 's': \/\/down\n\t\t\n\t\t\tprocessEnemyMove(player, i, enemyX, enemyY + 1);\n\t\t\tbreak;\n\t\tcase 'a': \/\/left\n\t\t\n\t\t\tprocessEnemyMove(player, i, enemyX - 1, enemyY);\n\t\t\tbreak;\n\t\tcase 'd': \/\/right\n\t\t\n\t\t\tprocessEnemyMove(player, i, enemyX + 1, enemyY);\n\t\t\tbreak;\n\t\t\n\t\t}\n\t}\n\n}\n\n\nvoid Level::processPlayerMove(Player &player, int targetX, int targetY) {\n\t\n\t\n\tint playerX, playerY;\n\tplayer.getPosition(playerX, playerY);\n\n\tchar moveTile = getTile(targetX, targetY);\n\n\tswitch (moveTile) {\n\tcase ' ':\n\t\tplayer.setPosition(targetX, targetY);\n\t\tsetTile(playerX, playerY, ' ');\n\t\tsetTile(targetX, targetY, '@');\n\t\tbreak;\n\tcase '&':\n\tcase '|':\n\tcase '+':\n\tcase '-':\n\tcase '#':\n\t\tbreak;\n\tcase '0': \/\/door\n\tcase '1':\n\tcase '2':\n\tcase '3':\n\tcase '4': {\n\t\/\/case '5':\n\t\/\/case '6':\n\t\/\/case '7':\n\t\/\/case '8':\n\t\/\/case '9': {\n\t\t\n\t\t_levelData.clear();\n\t\t_enemies.clear();\n\t\tstringstream ss;\n\t\tss << \"Maps\\\\level\" << moveTile << \".map\";\n\t\t\n\n\t\tload(ss.str(), player);\n\t\tbreak;\n\t}\n\tdefault:\n\t\tbattleEnemy(player, targetX, targetY);\n\t\tbreak;\n\t}\n\n}\n\nvoid Level::processEnemyMove(Player &player, int enemyIndex, int targetX, int targetY) {\n\n\tint playerX, playerY;\n\tint enemyX, enemyY;\n\tplayer.getPosition(playerX, playerY);\n\t_enemies[enemyIndex].getPosition(enemyX, enemyY);\n\n\tchar moveTile = getTile(targetX, targetY);\n\n\tswitch (moveTile) {\n\tcase ' ':\n\t\t_enemies[enemyIndex].setPosition(targetX, targetY);\n\t\tsetTile(enemyX, enemyY, ' ');\n\t\tsetTile(targetX, targetY, _enemies[enemyIndex].getTile());\n\t\tbreak;\n\tcase '&':\n\tcase '|':\n\tcase '+':\n\tcase '-':\n\tcase '#':\n\t\tbreak;\n\tcase '0': \/\/door\n\tcase '1':\n\tcase '2':\n\tcase '3':\n\tcase '4':\n\t\/\/case '5':\n\t\/\/case '6':\n\t\/\/case '7':\n\t\/\/case '8':\n\t\/\/case '9': \n\t\tbreak;\n\tcase '@':\n\t\tbattleEnemy(player, enemyX, enemyY);\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n}\n\nvoid Level::battleEnemy(Player & player, int targetX, int targetY) {\n\n\tint enemyX;\n\tint enemyY; \n\tint playerX;\n\tint playerY;\n\tint attackRoll;\n\tint attackResult;\n\n\tplayer.getPosition(playerX, playerY);\n\n\tfor (int i = 0; i < _enemies.size(); i++) {\n\t\t_enemies[i].getPosition(enemyX, enemyY);\n\t\tif (targetX == enemyX && targetY == enemyY) {\n\t\t\t\/\/battle\n\t\t\tattackRoll = player.attack();\n\t\t\t\/\/printf(\"\\nPlayer attacked %s with a roll of %d\\n\", _enemies[i].getName().c_str(), attackRoll);\n\t\t\tattackResult = _enemies[i].takeDamage(attackRoll);\n\n\t\t\tif (attackResult != 0) {\n\n\t\t\t\tsetTile(targetX, targetY, ' ');\n\t\t\t\tprint();\n\n\t\t\t\t#ifdef WIN32\n\t\t\t\t\tPlaySound(TEXT(\"Sounds\\\\beep.wav\"), NULL, SND_FILENAME);\n\t\t\t\t#endif\n\t\t\t\t\/\/printf(\"\\n%s died\\n\", _enemies[i].getName().c_str());\n\n\t\t\t\t\/\/remove enemy\n\t\t\t\t_enemies[i] = _enemies.back();\n\t\t\t\t_enemies.pop_back();\n\t\t\t\ti--;\n\n\t\t\t\tplayer.addExperience(attackResult);\n\t\t\t\t\/\/system(\"pause\");\n\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tattackRoll = _enemies[i].attack();\n\t\t\t\/\/printf(\"\\n%s attacked player with a roll of %d\\n\", _enemies[i].getName().c_str(), attackRoll);\n\t\t\tattackResult = player.takeDamage(attackRoll);\n\n\t\t\tif (attackResult != 0) {\n\t\t\t\tsetTile(playerX, playerY, 'x');\n\t\t\t\tprint();\n\t\t\t\t\/\/printf(\"You died\\n\");\n\t\t\t\t\/\/system(\"pause\");\n\t\t\t\tplayer.addExperience(attackResult);\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t\/\/system(\"pause\");\n\t\t\treturn;\n\t\t}\n\t}\n\n}\n\nchar Level::getTile(int x, int y) {\n\n\treturn _levelData[y][x];\n\n}\n\nvoid Level::setTile(int x, int y, char tile) {\n\n\t_levelData[y][x] = tile;\n\n}\n\n\nLevel::~Level() {\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/element.h\"\n#include \"gtest\/gtest.h\"\n#include \"..\/document.h\"\n#include <sstream>\n#include <string>\n#include <iostream>\n#include <array>\n#include <vector>\n#include <set>\n#include \"..\/json\/jsonscanner.h\"\n\nTEST(JSONConvert, FromString)\n{\n  std::string key=\"asdf\", value=\"asdf2\";\n  bson::Document d(\"{\\\"\" + key + \"\\\":\\\"\" + value + \"\\\"}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(value, d[key].data<std::string>());\n}\n\nTEST(JSONConvert, FromInt)\n{\n  std::string key=\"asdf\", value=\"42\";\n  int ival = 42;\n  bson::Document d(\"{\\\"\" + key + \"\\\":\" + value + \"}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(ival, d[key].data<long>());\n}\n\nTEST(JSONConvert, FromDouble)\n{\n  std::string key=\"asdf\", value=\"3.14000\";\n  double dval = 3.14000;\n  bson::Document d(\"{\\\"\" + key + \"\\\":\" + value + \"}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(dval, d[key].data<double>());\n}\n\nTEST(JSONConvert, FromNull)\n{\n  std::string key = \"asdf\";\n  bson::Document d(\"{\\\"\" + key + \"\\\": null }\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(bson::NIL, d[key].get_type());\n}\n\nTEST(JSONConvert, FromArr)\n{\n  std::string key = \"asdf\";\n  bson::Document d(\"{\\\"\" + key + \"\\\": [0, 1, 2, 3, 4, 5, 6.2] }\");\n  ASSERT_EQ(1, d.field_names().size());\n  for (int i=0; i<6; i++)\n    ASSERT_EQ(i, d[key].data<bson::array>()[i].data<long>());\n  ASSERT_EQ(6.2, d[key].data<bson::array>()[6].data<double>());\n}\n\nTEST(JSONConvert, FromBool)\n{\n  std::string key = \"asdf\";\n  bson::Document d(\"{\\\"\" + key + \"\\\": true }\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_TRUE(d[key].data<bool>());\n  d.from_json(\"{\\\"\" + key + \"\\\": false }\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_FALSE(d[key].data<bool>()); \n}\n\nTEST(JSONConvert, InvalidJSON)\n{\n  const std::string MESG (\"Invalid json token: a\");\n  bson::Document d;\n  ASSERT_THROW(d.from_json(\"asdf\"), bson::invalid_token);\n  try\n  {\n    d.from_json(\"asdf\");\n  }\n  catch (bson::invalid_token e)\n  {\n    std::string emesg(e.what());\n    ASSERT_EQ(MESG, emesg);\n  }\n}\n\nTEST(JSONConvert, EmptyObject)\n{\n  bson::Document d(\"{}\");\n  ASSERT_EQ(0, d.field_names().size());\n}\n\nTEST(JSONConvert, EmptyArray)\n{\n  bson::Document d(\"{\\\"asdf\\\": []}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(0, d[\"asdf\"].data<bson::array>().size());\n}\n\nTEST(JSONConvert, NestedObject)\n{\n  bson::Document d(\"{\\\"asdf\\\": {}}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(0, d[\"asdf\"].data<bson::Document>().field_names().size());\n}\n\nTEST(JSONConvert, MultiField)\n{\n  bson::Document d(\"{\\\"a\\\": 1, \\\"b\\\": 3.14000}\");\n  ASSERT_EQ(2, d.field_names().size());\n  ASSERT_EQ(1, d[\"a\"].data<long>());\n  ASSERT_EQ(3.14000, d[\"b\"].data<double>());\n}\n\nTEST(JSONConvert, MalformedJSONErrorTextCleanup)\n{\n  ASSERT_THROW(bson::Document d(\"\\\"asdf\\\"\"), bson::malformed_json);\n}\n\nTEST(JSONConvert, MalformedJSONErrorVectorCleanup)\n{\n  ASSERT_THROW(bson::Document d(\"{\\\"a\\\": [123, 3.14, \\\"asdf\\\"}]}\"), bson::malformed_json);\n}\n\nTEST(JSONConvert, MalformedJSONErrorObjectCleanup)\n{\n  ASSERT_THROW(bson::Document d(\"{\\\"a\\\": {}\"), bson::malformed_json);\n}<commit_msg>change the test to avoid valgrind memory errors on ubuntu (hopefully)<commit_after>#include \"..\/element.h\"\n#include \"gtest\/gtest.h\"\n#include \"..\/document.h\"\n#include <sstream>\n#include <string>\n#include <iostream>\n#include <array>\n#include <vector>\n#include <set>\n#include \"..\/json\/jsonscanner.h\"\n\nTEST(JSONConvert, FromString)\n{\n  std::string key=\"asdf\", value=\"asdf2\";\n  bson::Document d(\"{\\\"\" + key + \"\\\":\\\"\" + value + \"\\\"}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(value, d[key].data<std::string>());\n}\n\nTEST(JSONConvert, FromInt)\n{\n  std::string key=\"asdf\", value=\"42\";\n  int ival = 42;\n  bson::Document d(\"{\\\"\" + key + \"\\\":\" + value + \"}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(ival, d[key].data<long>());\n}\n\nTEST(JSONConvert, FromDouble)\n{\n  std::string key=\"asdf\", value=\"3.14000\";\n  double dval = 3.14000;\n  bson::Document d(\"{\\\"\" + key + \"\\\":\" + value + \"}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(dval, d[key].data<double>());\n}\n\nTEST(JSONConvert, FromNull)\n{\n  std::string key = \"asdf\";\n  bson::Document d(\"{\\\"\" + key + \"\\\": null }\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(bson::NIL, d[key].get_type());\n}\n\nTEST(JSONConvert, FromArr)\n{\n  std::string key = \"asdf\";\n  bson::Document d(\"{\\\"\" + key + \"\\\": [0, 1, 2, 3, 4, 5, 6.2] }\");\n  ASSERT_EQ(1, d.field_names().size());\n  for (int i=0; i<6; i++)\n    ASSERT_EQ(i, d[key].data<bson::array>()[i].data<long>());\n  ASSERT_EQ(6.2, d[key].data<bson::array>()[6].data<double>());\n}\n\nTEST(JSONConvert, FromBool)\n{\n  std::string key = \"asdf\";\n  bson::Document d(\"{\\\"\" + key + \"\\\": true }\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_TRUE(d[key].data<bool>());\n  d.from_json(\"{\\\"\" + key + \"\\\": false }\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_FALSE(d[key].data<bool>()); \n}\n\nTEST(JSONConvert, InvalidJSON)\n{\n  const char MESG[]= \"Invalid json token: a\";\n  bson::Document d;\n  ASSERT_THROW(d.from_json(\"asdf\"), bson::invalid_token);\n  try\n  {\n    d.from_json(\"asdf\");\n  }\n  catch (bson::invalid_token e)\n  {\n    ASSERT_STREQ(MESG, e.what());\n  }\n}\n\nTEST(JSONConvert, EmptyObject)\n{\n  bson::Document d(\"{}\");\n  ASSERT_EQ(0, d.field_names().size());\n}\n\nTEST(JSONConvert, EmptyArray)\n{\n  bson::Document d(\"{\\\"asdf\\\": []}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(0, d[\"asdf\"].data<bson::array>().size());\n}\n\nTEST(JSONConvert, NestedObject)\n{\n  bson::Document d(\"{\\\"asdf\\\": {}}\");\n  ASSERT_EQ(1, d.field_names().size());\n  ASSERT_EQ(0, d[\"asdf\"].data<bson::Document>().field_names().size());\n}\n\nTEST(JSONConvert, MultiField)\n{\n  bson::Document d(\"{\\\"a\\\": 1, \\\"b\\\": 3.14000}\");\n  ASSERT_EQ(2, d.field_names().size());\n  ASSERT_EQ(1, d[\"a\"].data<long>());\n  ASSERT_EQ(3.14000, d[\"b\"].data<double>());\n}\n\nTEST(JSONConvert, MalformedJSONErrorTextCleanup)\n{\n  ASSERT_THROW(bson::Document d(\"\\\"asdf\\\"\"), bson::malformed_json);\n}\n\nTEST(JSONConvert, MalformedJSONErrorVectorCleanup)\n{\n  ASSERT_THROW(bson::Document d(\"{\\\"a\\\": [123, 3.14, \\\"asdf\\\"}]}\"), bson::malformed_json);\n}\n\nTEST(JSONConvert, MalformedJSONErrorObjectCleanup)\n{\n  ASSERT_THROW(bson::Document d(\"{\\\"a\\\": {}\"), bson::malformed_json);\n}<|endoftext|>"}
{"text":"<commit_before>#include \"ovpCBoxAlgorithmCSPSpatialFilterTrainer.h\"\n\n#include <system\/Memory.h>\n\n#include <complex>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <map>\n#include <math.h>\n#include <iostream>\n\n#include <itpp\/base\/algebra\/eigen.h>\n#include <itpp\/base\/algebra\/inv.h>\n#include <itpp\/base\/converters.h>\n#include <itpp\/stat\/misc_stat.h>\n\nusing namespace OpenViBE;\nusing namespace OpenViBE::Kernel;\nusing namespace OpenViBE::Plugins;\n\nusing namespace OpenViBEPlugins;\nusing namespace OpenViBEPlugins::SignalProcessingGpl;\n\nusing namespace itpp;\n\n\/\/ Taken from http:\/\/techlogbook.wordpress.com\/2009\/08\/12\/adding-generalized-eigenvalue-functions-to-it\n\/\/            http:\/\/techlogbook.wordpress.com\/2009\/08\/12\/calling-lapack-functions-from-c-codes\n\/\/            http:\/\/sourceforge.net\/projects\/itpp\/forums\/forum\/115656\/topic\/3363490?message=7557038\n\/\/\n\/\/ http:\/\/icl.cs.utk.edu\/projectsfiles\/f2j\/javadoc\/org\/netlib\/lapack\/DSYGV.html\n\/\/ http:\/\/www.lassp.cornell.edu\/sethna\/GeneDynamics\/NetworkCodeDocumentation\/lapack_8h.html#a17\n\nnamespace\n{\n\textern \"C\"\n\t{\n\t\t\/\/ This symbol comes from LAPACK\n\/*\n\t\tvoid zggev_(char *jobvl, char *jobvr, int *n, std::complex<double> *a,\n\t\t\tint *lda, std::complex<double> *b, int *ldb, std::complex<double> *alpha,\n\t\t\tstd::complex<double> *beta, std::complex<double> *vl,\n\t\t\tint *ldvl, std::complex<double> *vr, int *ldvr,\n\t\t\tstd::complex<double> *work, int *lwork, double *rwork, int *info);\n*\/\n\t\tint dsygv_(int* itype, char* jobz, char* uplo, int* n, double* a,\n\t\t\tint* lda, double* b, int* ldb, double* w, double* work, int* lwork, int* info);\n\t}\n};\n\nnamespace itppextcsp\n{\n\titpp::mat convert(const IMatrix& rMatrix)\n\t{\n\t\titpp::mat l_oResult(\n\t\t\trMatrix.getDimensionSize(1),\n\t\t\trMatrix.getDimensionSize(0));\n\t\tSystem::Memory::copy(l_oResult._data(), rMatrix.getBuffer(), rMatrix.getBufferElementCount()*sizeof(float64));\n\t\treturn l_oResult.transpose();\n\t}\n\n\titpp::mat cov(const itpp::mat inputMat)\n\t{\n\t\titpp::mat l_oResult(inputMat.rows(),inputMat.rows());\n\t\titpp::mat centeredMat(inputMat.rows(),inputMat.rows());\n\t\tcenteredMat = itpp::repmat(itpp::sum(inputMat,2), 1, inputMat.cols(), false);\n\t\tcenteredMat = centeredMat \/ ((double)inputMat.cols());\n\t\tcenteredMat = inputMat-centeredMat;\n\t\tl_oResult = centeredMat*centeredMat.transpose();\n\t\tl_oResult = l_oResult \/ ((double)(inputMat.cols()-1));\n\t\tl_oResult = l_oResult \/ itpp::trace(l_oResult);\n\t\treturn l_oResult;\n\t}\n}\n\nboolean CBoxAlgorithmCSPSpatialFilterTrainer::initialize(void)\n{\n\tm_pStimulationDecoder=&this->getAlgorithmManager().getAlgorithm(this->getAlgorithmManager().createAlgorithm(OVP_GD_ClassId_Algorithm_StimulationStreamDecoder));\n\tm_pStimulationDecoder->initialize();\n\n\tm_pSignalDecoderCondition1=&this->getAlgorithmManager().getAlgorithm(this->getAlgorithmManager().createAlgorithm(OVP_GD_ClassId_Algorithm_SignalStreamDecoder));\n\tm_pSignalDecoderCondition1->initialize();\n\n\tm_pSignalDecoderCondition2=&this->getAlgorithmManager().getAlgorithm(this->getAlgorithmManager().createAlgorithm(OVP_GD_ClassId_Algorithm_SignalStreamDecoder));\n\tm_pSignalDecoderCondition2->initialize();\n\n\tm_ui64StimulationIdentifier=FSettingValueAutoCast(*this->getBoxAlgorithmContext(), 0);\n\tm_sSpatialFilterConfigurationFilename=FSettingValueAutoCast(*this->getBoxAlgorithmContext(), 1);\n\tm_ui64FilterDimension=FSettingValueAutoCast(*this->getBoxAlgorithmContext(), 2);\n\n\treturn true;\n}\n\nboolean CBoxAlgorithmCSPSpatialFilterTrainer::uninitialize(void)\n{\n\tm_pSignalDecoderCondition1->uninitialize();\n\tm_pSignalDecoderCondition2->uninitialize();\n\tm_pStimulationDecoder->uninitialize();\n\n\tthis->getAlgorithmManager().releaseAlgorithm(*m_pSignalDecoderCondition1);\n\tthis->getAlgorithmManager().releaseAlgorithm(*m_pSignalDecoderCondition2);\n\tthis->getAlgorithmManager().releaseAlgorithm(*m_pStimulationDecoder);\n\n\tm_pSignalDecoderCondition1=NULL;\n\tm_pSignalDecoderCondition2=NULL;\n\tm_pStimulationDecoder=NULL;\n\n\treturn true;\n}\n\nboolean CBoxAlgorithmCSPSpatialFilterTrainer::processInput(uint32 ui32InputIndex)\n{\n\tgetBoxAlgorithmContext()->markAlgorithmAsReadyToProcess();\n\treturn true;\n}\n\nboolean CBoxAlgorithmCSPSpatialFilterTrainer::process(void)\n{\n\tIBoxIO& l_rDynamicBoxContext=this->getDynamicBoxContext();\n\n\tboolean l_bShouldTrain=false;\n\tuint32 i, j, k;\n\n\tfor(i=0; i<l_rDynamicBoxContext.getInputChunkCount(0); i++)\n\t{\n\t\tTParameterHandler < const IMemoryBuffer* > ip_pMemoryBuffer(m_pStimulationDecoder->getInputParameter(OVP_GD_Algorithm_StimulationStreamDecoder_InputParameterId_MemoryBufferToDecode));\n\t\tip_pMemoryBuffer=l_rDynamicBoxContext.getInputChunk(0, i);\n\t\tm_pStimulationDecoder->process();\n\t\tif(m_pStimulationDecoder->isOutputTriggerActive(OVP_GD_Algorithm_StimulationStreamDecoder_OutputTriggerId_ReceivedHeader))\n\t\t{\n\t\t}\n\t\tif(m_pStimulationDecoder->isOutputTriggerActive(OVP_GD_Algorithm_StimulationStreamDecoder_OutputTriggerId_ReceivedBuffer))\n\t\t{\n\t\t\tTParameterHandler < IStimulationSet* > op_pStimulationSet(m_pStimulationDecoder->getOutputParameter(OVP_GD_Algorithm_StimulationStreamDecoder_OutputParameterId_StimulationSet));\n\t\t\tfor(j=0; j<op_pStimulationSet->getStimulationCount(); j++)\n\t\t\t{\n\t\t\t\tl_bShouldTrain |= (op_pStimulationSet->getStimulationIdentifier(j)==m_ui64StimulationIdentifier);\n\t\t\t}\n\t\t}\n\t\tif(m_pStimulationDecoder->isOutputTriggerActive(OVP_GD_Algorithm_StimulationStreamDecoder_OutputTriggerId_ReceivedEnd))\n\t\t{\n\t\t}\n\t\tl_rDynamicBoxContext.markInputAsDeprecated(0, i);\n\t}\n\n\tif(l_bShouldTrain)\n\t{\n\t\tthis->getLogManager() << LogLevel_Info << \"Received train stimulation - be patient\\n\";\n\n\t\tthis->getLogManager() << LogLevel_Trace << \"Decoding motor signal 1...\\n\";\n\n\t\titpp::mat l_oCovarianceMatrixCondition1;\n\t\tint l_iNumberOfCondition1Trials = 0;\n\t\tfor(i=0; i<l_rDynamicBoxContext.getInputChunkCount(1); i++)\n\t\t{\n\t\t\tTParameterHandler<const IMemoryBuffer*> ip_pMemoryBuffer(m_pSignalDecoderCondition1->getInputParameter(OVP_GD_Algorithm_SignalStreamDecoder_InputParameterId_MemoryBufferToDecode));\n\t\t\tip_pMemoryBuffer=l_rDynamicBoxContext.getInputChunk(1, i);\n\t\t\tm_pSignalDecoderCondition1->process();\n\t\t\tif(m_pSignalDecoderCondition1->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedHeader))\n\t\t\t{\n\t\t\t\tTParameterHandler<IMatrix*> ip_pMatrix(m_pSignalDecoderCondition1->getOutputParameter(OVP_GD_Algorithm_SignalStreamDecoder_OutputParameterId_Matrix));\n\t\t\t\tl_oCovarianceMatrixCondition1(ip_pMatrix->getDimensionSize(0),ip_pMatrix->getDimensionSize(0));\n\t\t\t}\n\t\t\tif(m_pSignalDecoderCondition1->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedBuffer))\n\t\t\t{\n\t\t\t\tTParameterHandler<IMatrix*> ip_pMatrix(m_pSignalDecoderCondition1->getOutputParameter(OVP_GD_Algorithm_SignalStreamDecoder_OutputParameterId_Matrix));\n\t\t\t\titpp::mat l_oMatrix=itppextcsp::convert(*ip_pMatrix);\n\t\t\t\tl_oCovarianceMatrixCondition1 += itppextcsp::cov(l_oMatrix);\n\t\t\t\tl_iNumberOfCondition1Trials++;\n\t\t\t}\n\t\t\tif(m_pSignalDecoderCondition1->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedEnd))\n\t\t\t{\n\t\t\t}\n\t\t\tl_rDynamicBoxContext.markInputAsDeprecated(1, i);\n\t\t}\n\t\tl_oCovarianceMatrixCondition1 = l_oCovarianceMatrixCondition1\/ ((double)l_iNumberOfCondition1Trials);\n\t\tthis->getLogManager() << LogLevel_Debug << \"Number of trials for condition 1: \" << l_iNumberOfCondition1Trials << \"\\n\";\n\n\t\tthis->getLogManager() << LogLevel_Trace << \"Decoding motor signal 2...\\n\";\n\n\t\titpp::mat l_oCovarianceMatrixCondition2;\n\t\tint l_iNumberOfCondition2Trials = 0;\n\t\tfor(i=0; i<l_rDynamicBoxContext.getInputChunkCount(2); i++)\n\t\t{\n\t\t\tTParameterHandler<const IMemoryBuffer*> ip_pMemoryBuffer(m_pSignalDecoderCondition2->getInputParameter(OVP_GD_Algorithm_SignalStreamDecoder_InputParameterId_MemoryBufferToDecode));\n\t\t\tip_pMemoryBuffer=l_rDynamicBoxContext.getInputChunk(2, i);\n\t\t\tm_pSignalDecoderCondition2->process();\n\t\t\tif(m_pSignalDecoderCondition2->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedHeader))\n\t\t\t{\n\t\t\t\tTParameterHandler<IMatrix*> ip_pMatrix(m_pSignalDecoderCondition2->getOutputParameter(OVP_GD_Algorithm_SignalStreamDecoder_OutputParameterId_Matrix));\n\t\t\t\tl_oCovarianceMatrixCondition2(ip_pMatrix->getDimensionSize(0),ip_pMatrix->getDimensionSize(0));\n\t\t\t}\n\t\t\tif(m_pSignalDecoderCondition2->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedBuffer))\n\t\t\t{\n\t\t\t\tTParameterHandler<IMatrix*> ip_pMatrix(m_pSignalDecoderCondition2->getOutputParameter(OVP_GD_Algorithm_SignalStreamDecoder_OutputParameterId_Matrix));\n\t\t\t\titpp::mat l_oMatrix=itppextcsp::convert(*ip_pMatrix);\n\t\t\t\tl_oCovarianceMatrixCondition2 += itppextcsp::cov(l_oMatrix);\n\t\t\t\tl_iNumberOfCondition2Trials++;\n\t\t\t}\n\t\t\tif(m_pSignalDecoderCondition2->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedEnd))\n\t\t\t{\n\t\t\t}\n\t\t\tl_rDynamicBoxContext.markInputAsDeprecated(2, i);\n\t\t}\n\t\tl_oCovarianceMatrixCondition2 = l_oCovarianceMatrixCondition2\/ ((double)l_iNumberOfCondition2Trials);\n\t\tthis->getLogManager() << LogLevel_Debug << \"Number of trials for condition 2: \" << l_iNumberOfCondition2Trials << \"\\n\";\n\n\t\tif(l_iNumberOfCondition1Trials==0 || l_iNumberOfCondition2Trials==0)\n\t\t{\n\t\t\tthis->getLogManager() << LogLevel_Error << \"No signal received... Can't continue\\n\";\n\t\t\treturn true;\n\t\t}\n\n\t\tthis->getLogManager() << LogLevel_Trace << \"Computing eigen vector decomposition...\\n\";\n\n\t\titpp::cmat l_oEigenVector;\n\t\titpp::cvec l_oEigenValue;\n\t\tuint32 l_ui32ChannelCount= l_oCovarianceMatrixCondition1.rows();\n\t\t\n\t\tif(itpp::eig(itpp::inv(l_oCovarianceMatrixCondition2)*l_oCovarianceMatrixCondition1, l_oEigenValue, l_oEigenVector))\n\t\t{\n\t\t\tstd::map < double, itpp::vec > l_vEigenVector;\n\t\t\tfor(i=0; i<l_ui32ChannelCount; i++)\n\t\t\t{\n\t\t\t\titpp::cvec l_oVector=l_oEigenVector.get_col(i);\n\t\t\t\tl_vEigenVector[itpp::real(l_oEigenValue)[i]]=itpp::real(l_oVector);\n\t\t\t}\n\n\t\t\tFILE* l_pFile=::fopen(m_sSpatialFilterConfigurationFilename.toASCIIString(), \"wb\");\n\t\t\tif(!l_pFile)\n\t\t\t{\n\t\t\t\tthis->getLogManager() << LogLevel_Error << \"The file [\" << m_sSpatialFilterConfigurationFilename << \"] could not be opened for writing...\";\n\t\t\t\treturn false;\n\t\t\t}\n\n\n\t\t\tstd::map < double, itpp::vec >::const_iterator it_forward;\n\t\t\t::fprintf(l_pFile, \"<OpenViBE-SettingsOverride>\\n\");\n\t\t\t::fprintf(l_pFile, \"\\t<SettingValue>\");\n\t\t\tthis->getLogManager() << LogLevel_Debug << \"lowest eigenvalues: \" << \"\\n\";\n\t\t\tfor(it_forward=l_vEigenVector.begin(), i=0; it_forward!=l_vEigenVector.end() && i< ::ceil(m_ui64FilterDimension\/2.0); it_forward++, i++)\n\t\t\t{\n\t\t\t\tthis->getLogManager() << LogLevel_Debug << it_forward->first << \", \";\n\t\t\t\tfor(j=0; j<l_ui32ChannelCount; j++)\n\t\t\t\t{\n\t\t\t\t\t::fprintf(l_pFile, \"%e \", it_forward->second[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis->getLogManager() << LogLevel_Debug << \"\\n\";\n\n\t\t\tstd::map < double, itpp::vec >::const_reverse_iterator it_backward;\n\t\t\tthis->getLogManager() << LogLevel_Debug << \"highest eigenvalues: \" << \"\\n\";\n\t\t\tfor(it_backward=l_vEigenVector.rbegin(), i=0; it_backward!=l_vEigenVector.rend() && i< ::floor(m_ui64FilterDimension\/2.0); it_backward++, i++)\n\t\t\t{\n\t\t\t\tthis->getLogManager() << LogLevel_Debug << it_backward->first << \", \";\n\t\t\t\tfor(j=0; j<l_ui32ChannelCount; j++)\n\t\t\t\t{\n\t\t\t\t\t::fprintf(l_pFile, \"%e \", it_backward->second[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis->getLogManager() << LogLevel_Debug << \"\\n\";\n\t\t\t::fprintf(l_pFile, \"<\/SettingValue>\\n\");\n\t\t\t::fprintf(l_pFile, \"\\t<SettingValue>%d<\/SettingValue>\\n\", uint32(m_ui64FilterDimension));\n\t\t\t::fprintf(l_pFile, \"\\t<SettingValue>%d<\/SettingValue>\\n\", l_ui32ChannelCount);\n\t\t\t::fprintf(l_pFile, \"<\/OpenViBE-SettingsOverride>\\n\");\n\t\t\t::fclose(l_pFile);\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis->getLogManager() << LogLevel_ImportantWarning << \"Eigen vector decomposition failed...\\n\";\n\t\t\treturn true;\n\t\t}\n\n\t\tthis->getLogManager() << LogLevel_Info << \"CSP Spatial filter trained successfully.\\n\";\n\t}\n\n\treturn true;\n}\n<commit_msg>OpenViBE-plugins-signal-processing-gpl *ovpCBoxAlgorithmCSPSpatialFilterTrainer.cpp : fixed an error message (missing '\\n' at the end).<commit_after>#include \"ovpCBoxAlgorithmCSPSpatialFilterTrainer.h\"\n\n#include <system\/Memory.h>\n\n#include <complex>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <map>\n#include <math.h>\n#include <iostream>\n\n#include <itpp\/base\/algebra\/eigen.h>\n#include <itpp\/base\/algebra\/inv.h>\n#include <itpp\/base\/converters.h>\n#include <itpp\/stat\/misc_stat.h>\n\nusing namespace OpenViBE;\nusing namespace OpenViBE::Kernel;\nusing namespace OpenViBE::Plugins;\n\nusing namespace OpenViBEPlugins;\nusing namespace OpenViBEPlugins::SignalProcessingGpl;\n\nusing namespace itpp;\n\n\/\/ Taken from http:\/\/techlogbook.wordpress.com\/2009\/08\/12\/adding-generalized-eigenvalue-functions-to-it\n\/\/            http:\/\/techlogbook.wordpress.com\/2009\/08\/12\/calling-lapack-functions-from-c-codes\n\/\/            http:\/\/sourceforge.net\/projects\/itpp\/forums\/forum\/115656\/topic\/3363490?message=7557038\n\/\/\n\/\/ http:\/\/icl.cs.utk.edu\/projectsfiles\/f2j\/javadoc\/org\/netlib\/lapack\/DSYGV.html\n\/\/ http:\/\/www.lassp.cornell.edu\/sethna\/GeneDynamics\/NetworkCodeDocumentation\/lapack_8h.html#a17\n\nnamespace\n{\n\textern \"C\"\n\t{\n\t\t\/\/ This symbol comes from LAPACK\n\/*\n\t\tvoid zggev_(char *jobvl, char *jobvr, int *n, std::complex<double> *a,\n\t\t\tint *lda, std::complex<double> *b, int *ldb, std::complex<double> *alpha,\n\t\t\tstd::complex<double> *beta, std::complex<double> *vl,\n\t\t\tint *ldvl, std::complex<double> *vr, int *ldvr,\n\t\t\tstd::complex<double> *work, int *lwork, double *rwork, int *info);\n*\/\n\t\tint dsygv_(int* itype, char* jobz, char* uplo, int* n, double* a,\n\t\t\tint* lda, double* b, int* ldb, double* w, double* work, int* lwork, int* info);\n\t}\n};\n\nnamespace itppextcsp\n{\n\titpp::mat convert(const IMatrix& rMatrix)\n\t{\n\t\titpp::mat l_oResult(\n\t\t\trMatrix.getDimensionSize(1),\n\t\t\trMatrix.getDimensionSize(0));\n\t\tSystem::Memory::copy(l_oResult._data(), rMatrix.getBuffer(), rMatrix.getBufferElementCount()*sizeof(float64));\n\t\treturn l_oResult.transpose();\n\t}\n\n\titpp::mat cov(const itpp::mat inputMat)\n\t{\n\t\titpp::mat l_oResult(inputMat.rows(),inputMat.rows());\n\t\titpp::mat centeredMat(inputMat.rows(),inputMat.rows());\n\t\tcenteredMat = itpp::repmat(itpp::sum(inputMat,2), 1, inputMat.cols(), false);\n\t\tcenteredMat = centeredMat \/ ((double)inputMat.cols());\n\t\tcenteredMat = inputMat-centeredMat;\n\t\tl_oResult = centeredMat*centeredMat.transpose();\n\t\tl_oResult = l_oResult \/ ((double)(inputMat.cols()-1));\n\t\tl_oResult = l_oResult \/ itpp::trace(l_oResult);\n\t\treturn l_oResult;\n\t}\n}\n\nboolean CBoxAlgorithmCSPSpatialFilterTrainer::initialize(void)\n{\n\tm_pStimulationDecoder=&this->getAlgorithmManager().getAlgorithm(this->getAlgorithmManager().createAlgorithm(OVP_GD_ClassId_Algorithm_StimulationStreamDecoder));\n\tm_pStimulationDecoder->initialize();\n\n\tm_pSignalDecoderCondition1=&this->getAlgorithmManager().getAlgorithm(this->getAlgorithmManager().createAlgorithm(OVP_GD_ClassId_Algorithm_SignalStreamDecoder));\n\tm_pSignalDecoderCondition1->initialize();\n\n\tm_pSignalDecoderCondition2=&this->getAlgorithmManager().getAlgorithm(this->getAlgorithmManager().createAlgorithm(OVP_GD_ClassId_Algorithm_SignalStreamDecoder));\n\tm_pSignalDecoderCondition2->initialize();\n\n\tm_ui64StimulationIdentifier=FSettingValueAutoCast(*this->getBoxAlgorithmContext(), 0);\n\tm_sSpatialFilterConfigurationFilename=FSettingValueAutoCast(*this->getBoxAlgorithmContext(), 1);\n\tm_ui64FilterDimension=FSettingValueAutoCast(*this->getBoxAlgorithmContext(), 2);\n\n\treturn true;\n}\n\nboolean CBoxAlgorithmCSPSpatialFilterTrainer::uninitialize(void)\n{\n\tm_pSignalDecoderCondition1->uninitialize();\n\tm_pSignalDecoderCondition2->uninitialize();\n\tm_pStimulationDecoder->uninitialize();\n\n\tthis->getAlgorithmManager().releaseAlgorithm(*m_pSignalDecoderCondition1);\n\tthis->getAlgorithmManager().releaseAlgorithm(*m_pSignalDecoderCondition2);\n\tthis->getAlgorithmManager().releaseAlgorithm(*m_pStimulationDecoder);\n\n\tm_pSignalDecoderCondition1=NULL;\n\tm_pSignalDecoderCondition2=NULL;\n\tm_pStimulationDecoder=NULL;\n\n\treturn true;\n}\n\nboolean CBoxAlgorithmCSPSpatialFilterTrainer::processInput(uint32 ui32InputIndex)\n{\n\tgetBoxAlgorithmContext()->markAlgorithmAsReadyToProcess();\n\treturn true;\n}\n\nboolean CBoxAlgorithmCSPSpatialFilterTrainer::process(void)\n{\n\tIBoxIO& l_rDynamicBoxContext=this->getDynamicBoxContext();\n\n\tboolean l_bShouldTrain=false;\n\tuint32 i, j, k;\n\n\tfor(i=0; i<l_rDynamicBoxContext.getInputChunkCount(0); i++)\n\t{\n\t\tTParameterHandler < const IMemoryBuffer* > ip_pMemoryBuffer(m_pStimulationDecoder->getInputParameter(OVP_GD_Algorithm_StimulationStreamDecoder_InputParameterId_MemoryBufferToDecode));\n\t\tip_pMemoryBuffer=l_rDynamicBoxContext.getInputChunk(0, i);\n\t\tm_pStimulationDecoder->process();\n\t\tif(m_pStimulationDecoder->isOutputTriggerActive(OVP_GD_Algorithm_StimulationStreamDecoder_OutputTriggerId_ReceivedHeader))\n\t\t{\n\t\t}\n\t\tif(m_pStimulationDecoder->isOutputTriggerActive(OVP_GD_Algorithm_StimulationStreamDecoder_OutputTriggerId_ReceivedBuffer))\n\t\t{\n\t\t\tTParameterHandler < IStimulationSet* > op_pStimulationSet(m_pStimulationDecoder->getOutputParameter(OVP_GD_Algorithm_StimulationStreamDecoder_OutputParameterId_StimulationSet));\n\t\t\tfor(j=0; j<op_pStimulationSet->getStimulationCount(); j++)\n\t\t\t{\n\t\t\t\tl_bShouldTrain |= (op_pStimulationSet->getStimulationIdentifier(j)==m_ui64StimulationIdentifier);\n\t\t\t}\n\t\t}\n\t\tif(m_pStimulationDecoder->isOutputTriggerActive(OVP_GD_Algorithm_StimulationStreamDecoder_OutputTriggerId_ReceivedEnd))\n\t\t{\n\t\t}\n\t\tl_rDynamicBoxContext.markInputAsDeprecated(0, i);\n\t}\n\n\tif(l_bShouldTrain)\n\t{\n\t\tthis->getLogManager() << LogLevel_Info << \"Received train stimulation - be patient\\n\";\n\n\t\tthis->getLogManager() << LogLevel_Trace << \"Decoding motor signal 1...\\n\";\n\n\t\titpp::mat l_oCovarianceMatrixCondition1;\n\t\tint l_iNumberOfCondition1Trials = 0;\n\t\tfor(i=0; i<l_rDynamicBoxContext.getInputChunkCount(1); i++)\n\t\t{\n\t\t\tTParameterHandler<const IMemoryBuffer*> ip_pMemoryBuffer(m_pSignalDecoderCondition1->getInputParameter(OVP_GD_Algorithm_SignalStreamDecoder_InputParameterId_MemoryBufferToDecode));\n\t\t\tip_pMemoryBuffer=l_rDynamicBoxContext.getInputChunk(1, i);\n\t\t\tm_pSignalDecoderCondition1->process();\n\t\t\tif(m_pSignalDecoderCondition1->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedHeader))\n\t\t\t{\n\t\t\t\tTParameterHandler<IMatrix*> ip_pMatrix(m_pSignalDecoderCondition1->getOutputParameter(OVP_GD_Algorithm_SignalStreamDecoder_OutputParameterId_Matrix));\n\t\t\t\tl_oCovarianceMatrixCondition1(ip_pMatrix->getDimensionSize(0),ip_pMatrix->getDimensionSize(0));\n\t\t\t}\n\t\t\tif(m_pSignalDecoderCondition1->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedBuffer))\n\t\t\t{\n\t\t\t\tTParameterHandler<IMatrix*> ip_pMatrix(m_pSignalDecoderCondition1->getOutputParameter(OVP_GD_Algorithm_SignalStreamDecoder_OutputParameterId_Matrix));\n\t\t\t\titpp::mat l_oMatrix=itppextcsp::convert(*ip_pMatrix);\n\t\t\t\tl_oCovarianceMatrixCondition1 += itppextcsp::cov(l_oMatrix);\n\t\t\t\tl_iNumberOfCondition1Trials++;\n\t\t\t}\n\t\t\tif(m_pSignalDecoderCondition1->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedEnd))\n\t\t\t{\n\t\t\t}\n\t\t\tl_rDynamicBoxContext.markInputAsDeprecated(1, i);\n\t\t}\n\t\tl_oCovarianceMatrixCondition1 = l_oCovarianceMatrixCondition1\/ ((double)l_iNumberOfCondition1Trials);\n\t\tthis->getLogManager() << LogLevel_Debug << \"Number of trials for condition 1: \" << l_iNumberOfCondition1Trials << \"\\n\";\n\n\t\tthis->getLogManager() << LogLevel_Trace << \"Decoding motor signal 2...\\n\";\n\n\t\titpp::mat l_oCovarianceMatrixCondition2;\n\t\tint l_iNumberOfCondition2Trials = 0;\n\t\tfor(i=0; i<l_rDynamicBoxContext.getInputChunkCount(2); i++)\n\t\t{\n\t\t\tTParameterHandler<const IMemoryBuffer*> ip_pMemoryBuffer(m_pSignalDecoderCondition2->getInputParameter(OVP_GD_Algorithm_SignalStreamDecoder_InputParameterId_MemoryBufferToDecode));\n\t\t\tip_pMemoryBuffer=l_rDynamicBoxContext.getInputChunk(2, i);\n\t\t\tm_pSignalDecoderCondition2->process();\n\t\t\tif(m_pSignalDecoderCondition2->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedHeader))\n\t\t\t{\n\t\t\t\tTParameterHandler<IMatrix*> ip_pMatrix(m_pSignalDecoderCondition2->getOutputParameter(OVP_GD_Algorithm_SignalStreamDecoder_OutputParameterId_Matrix));\n\t\t\t\tl_oCovarianceMatrixCondition2(ip_pMatrix->getDimensionSize(0),ip_pMatrix->getDimensionSize(0));\n\t\t\t}\n\t\t\tif(m_pSignalDecoderCondition2->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedBuffer))\n\t\t\t{\n\t\t\t\tTParameterHandler<IMatrix*> ip_pMatrix(m_pSignalDecoderCondition2->getOutputParameter(OVP_GD_Algorithm_SignalStreamDecoder_OutputParameterId_Matrix));\n\t\t\t\titpp::mat l_oMatrix=itppextcsp::convert(*ip_pMatrix);\n\t\t\t\tl_oCovarianceMatrixCondition2 += itppextcsp::cov(l_oMatrix);\n\t\t\t\tl_iNumberOfCondition2Trials++;\n\t\t\t}\n\t\t\tif(m_pSignalDecoderCondition2->isOutputTriggerActive(OVP_GD_Algorithm_SignalStreamDecoder_OutputTriggerId_ReceivedEnd))\n\t\t\t{\n\t\t\t}\n\t\t\tl_rDynamicBoxContext.markInputAsDeprecated(2, i);\n\t\t}\n\t\tl_oCovarianceMatrixCondition2 = l_oCovarianceMatrixCondition2\/ ((double)l_iNumberOfCondition2Trials);\n\t\tthis->getLogManager() << LogLevel_Debug << \"Number of trials for condition 2: \" << l_iNumberOfCondition2Trials << \"\\n\";\n\n\t\tif(l_iNumberOfCondition1Trials==0 || l_iNumberOfCondition2Trials==0)\n\t\t{\n\t\t\tthis->getLogManager() << LogLevel_Error << \"No signal received... Can't continue\\n\";\n\t\t\treturn true;\n\t\t}\n\n\t\tthis->getLogManager() << LogLevel_Trace << \"Computing eigen vector decomposition...\\n\";\n\n\t\titpp::cmat l_oEigenVector;\n\t\titpp::cvec l_oEigenValue;\n\t\tuint32 l_ui32ChannelCount= l_oCovarianceMatrixCondition1.rows();\n\t\t\n\t\tif(itpp::eig(itpp::inv(l_oCovarianceMatrixCondition2)*l_oCovarianceMatrixCondition1, l_oEigenValue, l_oEigenVector))\n\t\t{\n\t\t\tstd::map < double, itpp::vec > l_vEigenVector;\n\t\t\tfor(i=0; i<l_ui32ChannelCount; i++)\n\t\t\t{\n\t\t\t\titpp::cvec l_oVector=l_oEigenVector.get_col(i);\n\t\t\t\tl_vEigenVector[itpp::real(l_oEigenValue)[i]]=itpp::real(l_oVector);\n\t\t\t}\n\n\t\t\tFILE* l_pFile=::fopen(m_sSpatialFilterConfigurationFilename.toASCIIString(), \"wb\");\n\t\t\tif(!l_pFile)\n\t\t\t{\n\t\t\t\tthis->getLogManager() << LogLevel_Error << \"The file [\" << m_sSpatialFilterConfigurationFilename << \"] could not be opened for writing...\\n\";\n\t\t\t\treturn false;\n\t\t\t}\n\n\n\t\t\tstd::map < double, itpp::vec >::const_iterator it_forward;\n\t\t\t::fprintf(l_pFile, \"<OpenViBE-SettingsOverride>\\n\");\n\t\t\t::fprintf(l_pFile, \"\\t<SettingValue>\");\n\t\t\tthis->getLogManager() << LogLevel_Debug << \"lowest eigenvalues: \" << \"\\n\";\n\t\t\tfor(it_forward=l_vEigenVector.begin(), i=0; it_forward!=l_vEigenVector.end() && i< ::ceil(m_ui64FilterDimension\/2.0); it_forward++, i++)\n\t\t\t{\n\t\t\t\tthis->getLogManager() << LogLevel_Debug << it_forward->first << \", \";\n\t\t\t\tfor(j=0; j<l_ui32ChannelCount; j++)\n\t\t\t\t{\n\t\t\t\t\t::fprintf(l_pFile, \"%e \", it_forward->second[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis->getLogManager() << LogLevel_Debug << \"\\n\";\n\n\t\t\tstd::map < double, itpp::vec >::const_reverse_iterator it_backward;\n\t\t\tthis->getLogManager() << LogLevel_Debug << \"highest eigenvalues: \" << \"\\n\";\n\t\t\tfor(it_backward=l_vEigenVector.rbegin(), i=0; it_backward!=l_vEigenVector.rend() && i< ::floor(m_ui64FilterDimension\/2.0); it_backward++, i++)\n\t\t\t{\n\t\t\t\tthis->getLogManager() << LogLevel_Debug << it_backward->first << \", \";\n\t\t\t\tfor(j=0; j<l_ui32ChannelCount; j++)\n\t\t\t\t{\n\t\t\t\t\t::fprintf(l_pFile, \"%e \", it_backward->second[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis->getLogManager() << LogLevel_Debug << \"\\n\";\n\t\t\t::fprintf(l_pFile, \"<\/SettingValue>\\n\");\n\t\t\t::fprintf(l_pFile, \"\\t<SettingValue>%d<\/SettingValue>\\n\", uint32(m_ui64FilterDimension));\n\t\t\t::fprintf(l_pFile, \"\\t<SettingValue>%d<\/SettingValue>\\n\", l_ui32ChannelCount);\n\t\t\t::fprintf(l_pFile, \"<\/OpenViBE-SettingsOverride>\\n\");\n\t\t\t::fclose(l_pFile);\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis->getLogManager() << LogLevel_ImportantWarning << \"Eigen vector decomposition failed...\\n\";\n\t\t\treturn true;\n\t\t}\n\n\t\tthis->getLogManager() << LogLevel_Info << \"CSP Spatial filter trained successfully.\\n\";\n\t}\n\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko, Jean-Francois Doyon\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\/\/$Id$\n\n#include <boost\/python.hpp>\n#include <mapnik\/raster_symbolizer.hpp>\n\nvoid export_raster_symbolizer()\n{\n    using namespace boost::python;\n    using mapnik::raster_symbolizer;\n\n    class_<raster_symbolizer>(\"RasterSymbolizer\",\n\t\t\t\t    init<>(\"Default ctor\"))\n    \n    .add_property(\"mode\",\n            make_function(&raster_symbolizer::get_mode,return_value_policy<copy_const_reference>()),\n            &raster_symbolizer::set_mode,\n            \"Get\/Set merging mode.\\n\"\n            \"Possible values are:\\n\"\n            \"normal, grain_merge, grain_merge2, multiply,\\n\"\n            \"multiply2, divide, divide2, screen, and hard_light\\n\"\n            \"\\n\"\n            \"Usage:\\n\"\n            \"\\n\"\n            \">>> from mapnik import RasterSymbolizer\\n\"\n            \">>> r = RasterSymbolizer()\\n\"\n            \">>> r.mode = 'grain_merge2'\\n\"\n            )\n            \n    .add_property(\"scaling\",\n            make_function(&raster_symbolizer::get_scaling,return_value_policy<copy_const_reference>()),\n            &raster_symbolizer::set_scaling,\n            \"Get\/Set scaling algorithm.\\n\"\n            \"Possible values are:\\n\"\n            \"fast, bilinear, and bilinear8\\n\"\n            \"\\n\"\n            \"Usage:\\n\"\n            \"\\n\"\n            \">>> from mapnik import RasterSymbolizer\\n\"\n            \">>> r = RasterSymbolizer()\\n\"\n            \">>> r.scaling = 'bilinear8'\\n\"\n            )\n            \n    .add_property(\"opacity\",\n            &raster_symbolizer::get_opacity,\n            &raster_symbolizer::set_opacity,\n            \"Get\/Set opacity.\\n\"\n            \"\\n\"\n            \"Usage:\\n\"\n            \"\\n\"\n            \">>> from mapnik import RasterSymbolizer\\n\"\n            \">>> r = RasterSymbolizer()\\n\"\n            \">>> r.opacity = .5\\n\"\n            )\n\t;    \n}\n<commit_msg>+add pickle support for raster_symbolizer - see #345<commit_after>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko, Jean-Francois Doyon\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\/\/$Id$\n\n#include <boost\/python.hpp>\n#include <mapnik\/raster_symbolizer.hpp>\n\nusing mapnik::raster_symbolizer;\n\nstruct raster_symbolizer_pickle_suite : boost::python::pickle_suite\n{\n   \/*\n   static boost::python::tuple\n   getinitargs(const raster_symbolizer& r)\n   {\n      return boost::python::make_tuple();  \n   }\n   *\/\n\n   static  boost::python::tuple\n   getstate(const raster_symbolizer& r)\n   {\n        return boost::python::make_tuple(r.get_mode(),r.get_scaling(),r.get_opacity());\n   }\n\n   static void\n   setstate (raster_symbolizer& r, boost::python::tuple state)\n   {\n        using namespace boost::python;\n        if (len(state) != 3)\n        {\n            PyErr_SetObject(PyExc_ValueError,\n                         (\"expected 3-item tuple in call to __setstate__; got %s\"\n                          % state).ptr()\n            );\n            throw_error_already_set();\n        }\n                \n        r.set_mode(extract<std::string>(state[0]));\n        r.set_scaling(extract<std::string>(state[1]));\n        r.set_opacity(extract<float>(state[2]));\n   }\n\n};\n\nvoid export_raster_symbolizer()\n{\n    using namespace boost::python;\n\n    class_<raster_symbolizer>(\"RasterSymbolizer\",\n\t\t\t\t    init<>(\"Default ctor\"))\n\t\t\t\t    \n    .def_pickle(raster_symbolizer_pickle_suite())\n    \n    .add_property(\"mode\",\n            make_function(&raster_symbolizer::get_mode,return_value_policy<copy_const_reference>()),\n            &raster_symbolizer::set_mode,\n            \"Get\/Set merging mode.\\n\"\n            \"Possible values are:\\n\"\n            \"normal, grain_merge, grain_merge2, multiply,\\n\"\n            \"multiply2, divide, divide2, screen, and hard_light\\n\"\n            \"\\n\"\n            \"Usage:\\n\"\n            \"\\n\"\n            \">>> from mapnik import RasterSymbolizer\\n\"\n            \">>> r = RasterSymbolizer()\\n\"\n            \">>> r.mode = 'grain_merge2'\\n\"\n            )\n            \n    .add_property(\"scaling\",\n            make_function(&raster_symbolizer::get_scaling,return_value_policy<copy_const_reference>()),\n            &raster_symbolizer::set_scaling,\n            \"Get\/Set scaling algorithm.\\n\"\n            \"Possible values are:\\n\"\n            \"fast, bilinear, and bilinear8\\n\"\n            \"\\n\"\n            \"Usage:\\n\"\n            \"\\n\"\n            \">>> from mapnik import RasterSymbolizer\\n\"\n            \">>> r = RasterSymbolizer()\\n\"\n            \">>> r.scaling = 'bilinear8'\\n\"\n            )\n            \n    .add_property(\"opacity\",\n            &raster_symbolizer::get_opacity,\n            &raster_symbolizer::set_opacity,\n            \"Get\/Set opacity.\\n\"\n            \"\\n\"\n            \"Usage:\\n\"\n            \"\\n\"\n            \">>> from mapnik import RasterSymbolizer\\n\"\n            \">>> r = RasterSymbolizer()\\n\"\n            \">>> r.opacity = .5\\n\"\n            )\n\t;    \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*ckwg +5\n * Copyright 2011 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 <python\/helpers\/numpy_memory_chunk.h>\n#include <python\/helpers\/python_wrap_vil_smart_ptr.h>\n\n#include <vistk\/python\/any_conversion\/prototypes.h>\n#include <vistk\/python\/any_conversion\/registration.h>\n\n#include <boost\/python\/converter\/registry.hpp>\n#include <boost\/python\/def.hpp>\n#include <boost\/python\/class.hpp>\n#include <boost\/python\/module.hpp>\n#include <boost\/python\/object.hpp>\n\n#include <vil\/vil_image_view.h>\n#include <vil\/vil_memory_chunk.h>\n\n#include <numpy\/ndarrayobject.h>\n#include <numpy\/ndarraytypes.h>\n\n\/**\n * \\file vil.cxx\n *\n * \\brief Python bindings for \\link vil_image_view\\endlink.\n *\/\n\nusing namespace boost::python;\n\ntemplate <typename T>\nstatic NPY_TYPES python_pixel_type();\n\ntemplate <typename T>\nclass vil_image_converter\n{\n  public:\n    typedef T image_t;\n    typedef typename image_t::pixel_type pixel_t;\n\n    vil_image_converter()\n    {\n      boost::python::converter::registry::push_back(\n        &convertible,\n        &construct,\n        boost::python::type_id<image_t>());\n    }\n    ~vil_image_converter()\n    {\n    }\n\n    static void* convertible(PyObject* obj)\n    {\n      if (obj == Py_None)\n      {\n        return NULL;\n      }\n\n      if (PyArray_Check(obj))\n      {\n        PyArrayObject* const arr = reinterpret_cast<PyArrayObject*>(obj);\n        int const ndim = PyArray_NDIM(arr);\n\n        if (ndim != 3)\n        {\n          return NULL;\n        }\n\n        NPY_TYPES const expected_type = python_pixel_type<pixel_t>();\n        int const type = PyArray_TYPE(arr);\n\n        if (type != expected_type)\n        {\n          return NULL;\n        }\n\n        return obj;\n      }\n\n      return NULL;\n    }\n\n    static PyObject* convert(image_t const& img)\n    {\n      NPY_TYPES const arr_type = python_pixel_type<pixel_t>();\n      int const nd = 3;\n      npy_intp* const dims = PyDimMem_NEW(nd);\n      npy_intp* const strides = PyDimMem_NEW(nd);\n      bool const contig = img.is_contiguous();\n\n      dims[0] = img.ni();\n      dims[1] = img.nj();\n      dims[2] = img.nplanes();\n\n      strides[0] = img.istep();\n      strides[1] = img.jstep();\n      strides[2] = img.planestep();\n\n      int flags = 0;\n\n      if (contig)\n      {\n        if (img.planestep() == 1)\n        {\n          flags |= NPY_CONTIGUOUS;\n        }\n        else if (img.istep() == 1)\n        {\n          flags |= NPY_FORTRAN;\n        }\n      }\n\n      flags |= NPY_WRITEABLE;\n      flags |= NPY_NOTSWAPPED;\n\n      uintptr_t const mem = reinterpret_cast<uintptr_t>(img.top_left_ptr());\n\n      if (!(mem % sizeof(T)))\n      {\n        flags |= NPY_ALIGNED;\n      }\n\n      PyObject* obj = Py_None;\n\n      if (img.memory_chunk())\n      {\n        object bp_obj = object(img.memory_chunk());\n        obj = bp_obj.ptr();\n      }\n      else\n      {\n        \/\/\/ \\todo Log that vil doesn't own this memory...there be dragon's here.\n        Py_INCREF(obj);\n      }\n\n      PyObject* const arr = PyArray_New(&PyArray_Type, nd, dims, arr_type, strides, reinterpret_cast<void*>(mem), 0, flags, obj);\n\n      return arr;\n    }\n\n    static void construct(PyObject* obj, boost::python::converter::rvalue_from_python_stage1_data* data)\n    {\n      void* storage = reinterpret_cast<boost::python::converter::rvalue_from_python_storage<image_t>*>(data)->storage.bytes;\n\n      PyArrayObject* const arr = reinterpret_cast<PyArrayObject*>(obj);\n      npy_intp const* const dims = PyArray_DIMS(arr);\n      npy_intp const* const strides = PyArray_STRIDES(arr);\n      void* const mem = PyArray_DATA(arr);\n\n      vil_memory_chunk_sptr chunk = new numpy_memory_chunk(arr);\n\n      new (storage) image_t(chunk, reinterpret_cast<pixel_t*>(mem),\n                            dims[0], dims[1], dims[2],\n                            strides[0], strides[1], strides[2]);\n      data->convertible = storage;\n    }\n};\n\ntemplate <typename T>\nvoid register_vil_image_converter();\n\nBOOST_PYTHON_MODULE(vil)\n{\n  import_array();\n\n  \/\/ Expose vil_memory_chunk to Python. This is treated as opaque because Python\n  \/\/ shouldn't be messing with such things, but it allows us to have numpy\n  \/\/ arrays hold a reference to the memory chunk that is being used when\n  \/\/ converting a vil_image_view into a NumPy array.\n  class_<vil_memory_chunk, vil_memory_chunk_sptr, boost::noncopyable>(\"_VilMemoryChunk\"\n    , \"<internal>\"\n    , no_init);\n\n  register_vil_image_converter<vil_image_view<bool> >();\n  register_vil_image_converter<vil_image_view<uint8_t> >();\n  register_vil_image_converter<vil_image_view<float> >();\n  register_vil_image_converter<vil_image_view<double> >();\n\n  vistk::python::register_type<vil_image_view<bool> >(10);\n  vistk::python::register_type<vil_image_view<uint8_t> >(10);\n  vistk::python::register_type<vil_image_view<float> >(10);\n  vistk::python::register_type<vil_image_view<double> >(10);\n}\n\ntemplate <>\nNPY_TYPES\npython_pixel_type<bool>()\n{\n  return NPY_BOOL;\n}\n\ntemplate <>\nNPY_TYPES\npython_pixel_type<uint8_t>()\n{\n  return NPY_UBYTE;\n}\n\ntemplate <>\nNPY_TYPES\npython_pixel_type<float>()\n{\n  return NPY_FLOAT;\n}\n\ntemplate <>\nNPY_TYPES\npython_pixel_type<double>()\n{\n  return NPY_DOUBLE;\n}\n\ntemplate <typename T>\nvoid\nregister_vil_image_converter()\n{\n  typedef vil_image_converter<T> converter_t;\n  typedef typename converter_t::image_t image_t;\n\n  boost::python::to_python_converter<image_t, converter_t>();\n  converter_t();\n}\n<commit_msg>Clean up headers<commit_after>\/*ckwg +5\n * Copyright 2011 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 <python\/helpers\/numpy_memory_chunk.h>\n#include <python\/helpers\/python_wrap_vil_smart_ptr.h>\n\n#include <vistk\/python\/any_conversion\/prototypes.h>\n#include <vistk\/python\/any_conversion\/registration.h>\n\n#include <boost\/python\/converter\/registry.hpp>\n#include <boost\/python\/def.hpp>\n#include <boost\/python\/class.hpp>\n#include <boost\/python\/module.hpp>\n#include <boost\/python\/object.hpp>\n#include <boost\/cstdint.hpp>\n\n#include <vil\/vil_image_view.h>\n#include <vil\/vil_memory_chunk.h>\n\n#include <Python.h>\n\n#include <numpy\/arrayobject.h>\n\n\/**\n * \\file vil.cxx\n *\n * \\brief Python bindings for \\link vil_image_view\\endlink.\n *\/\n\nusing namespace boost::python;\n\ntemplate <typename T>\nstatic NPY_TYPES python_pixel_type();\n\ntemplate <typename T>\nclass vil_image_converter\n{\n  public:\n    typedef T image_t;\n    typedef typename image_t::pixel_type pixel_t;\n\n    vil_image_converter()\n    {\n      boost::python::converter::registry::push_back(\n        &convertible,\n        &construct,\n        boost::python::type_id<image_t>());\n    }\n    ~vil_image_converter()\n    {\n    }\n\n    static void* convertible(PyObject* obj)\n    {\n      if (obj == Py_None)\n      {\n        return NULL;\n      }\n\n      if (PyArray_Check(obj))\n      {\n        PyArrayObject* const arr = reinterpret_cast<PyArrayObject*>(obj);\n        int const ndim = PyArray_NDIM(arr);\n\n        if (ndim != 3)\n        {\n          return NULL;\n        }\n\n        NPY_TYPES const expected_type = python_pixel_type<pixel_t>();\n        int const type = PyArray_TYPE(arr);\n\n        if (type != expected_type)\n        {\n          return NULL;\n        }\n\n        return obj;\n      }\n\n      return NULL;\n    }\n\n    static PyObject* convert(image_t const& img)\n    {\n      NPY_TYPES const arr_type = python_pixel_type<pixel_t>();\n      int const nd = 3;\n      npy_intp* const dims = PyDimMem_NEW(nd);\n      npy_intp* const strides = PyDimMem_NEW(nd);\n      bool const contig = img.is_contiguous();\n\n      dims[0] = img.ni();\n      dims[1] = img.nj();\n      dims[2] = img.nplanes();\n\n      strides[0] = img.istep();\n      strides[1] = img.jstep();\n      strides[2] = img.planestep();\n\n      int flags = 0;\n\n      if (contig)\n      {\n        if (img.planestep() == 1)\n        {\n          flags |= NPY_CONTIGUOUS;\n        }\n        else if (img.istep() == 1)\n        {\n          flags |= NPY_FORTRAN;\n        }\n      }\n\n      flags |= NPY_WRITEABLE;\n      flags |= NPY_NOTSWAPPED;\n\n      uintptr_t const mem = reinterpret_cast<uintptr_t>(img.top_left_ptr());\n\n      if (!(mem % sizeof(T)))\n      {\n        flags |= NPY_ALIGNED;\n      }\n\n      PyObject* obj = Py_None;\n\n      if (img.memory_chunk())\n      {\n        object bp_obj = object(img.memory_chunk());\n        obj = bp_obj.ptr();\n      }\n      else\n      {\n        \/\/\/ \\todo Log that vil doesn't own this memory...there be dragon's here.\n        Py_INCREF(obj);\n      }\n\n      PyObject* const arr = PyArray_New(&PyArray_Type, nd, dims, arr_type, strides, reinterpret_cast<void*>(mem), 0, flags, obj);\n\n      return arr;\n    }\n\n    static void construct(PyObject* obj, boost::python::converter::rvalue_from_python_stage1_data* data)\n    {\n      void* storage = reinterpret_cast<boost::python::converter::rvalue_from_python_storage<image_t>*>(data)->storage.bytes;\n\n      PyArrayObject* const arr = reinterpret_cast<PyArrayObject*>(obj);\n      npy_intp const* const dims = PyArray_DIMS(arr);\n      npy_intp const* const strides = PyArray_STRIDES(arr);\n      void* const mem = PyArray_DATA(arr);\n\n      vil_memory_chunk_sptr chunk = new numpy_memory_chunk(arr);\n\n      new (storage) image_t(chunk, reinterpret_cast<pixel_t*>(mem),\n                            dims[0], dims[1], dims[2],\n                            strides[0], strides[1], strides[2]);\n      data->convertible = storage;\n    }\n};\n\ntemplate <typename T>\nvoid register_vil_image_converter();\n\nBOOST_PYTHON_MODULE(vil)\n{\n  import_array();\n\n  \/\/ Expose vil_memory_chunk to Python. This is treated as opaque because Python\n  \/\/ shouldn't be messing with such things, but it allows us to have numpy\n  \/\/ arrays hold a reference to the memory chunk that is being used when\n  \/\/ converting a vil_image_view into a NumPy array.\n  class_<vil_memory_chunk, vil_memory_chunk_sptr, boost::noncopyable>(\"_VilMemoryChunk\"\n    , \"<internal>\"\n    , no_init);\n\n  register_vil_image_converter<vil_image_view<bool> >();\n  register_vil_image_converter<vil_image_view<uint8_t> >();\n  register_vil_image_converter<vil_image_view<float> >();\n  register_vil_image_converter<vil_image_view<double> >();\n\n  vistk::python::register_type<vil_image_view<bool> >(10);\n  vistk::python::register_type<vil_image_view<uint8_t> >(10);\n  vistk::python::register_type<vil_image_view<float> >(10);\n  vistk::python::register_type<vil_image_view<double> >(10);\n}\n\ntemplate <>\nNPY_TYPES\npython_pixel_type<bool>()\n{\n  return NPY_BOOL;\n}\n\ntemplate <>\nNPY_TYPES\npython_pixel_type<uint8_t>()\n{\n  return NPY_UBYTE;\n}\n\ntemplate <>\nNPY_TYPES\npython_pixel_type<float>()\n{\n  return NPY_FLOAT;\n}\n\ntemplate <>\nNPY_TYPES\npython_pixel_type<double>()\n{\n  return NPY_DOUBLE;\n}\n\ntemplate <typename T>\nvoid\nregister_vil_image_converter()\n{\n  typedef vil_image_converter<T> converter_t;\n  typedef typename converter_t::image_t image_t;\n\n  boost::python::to_python_converter<image_t, converter_t>();\n  converter_t();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"optionsdialog.h\"\n#include \"optionsmodel.h\"\n#include \"bitcoinamountfield.h\"\n#include \"monitoreddatamapper.h\"\n#include \"guiutil.h\"\n#include \"bitcoinunits.h\"\n#include \"qvaluecombobox.h\"\n\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n#include <QPushButton>\n#include <QListWidget>\n#include <QStackedWidget>\n\n#include <QCheckBox>\n#include <QLabel>\n#include <QLineEdit>\n#include <QIntValidator>\n#include <QDoubleValidator>\n#include <QRegExpValidator>\n#include <QDialogButtonBox>\n\n\/* First page of options *\/\nclass MainOptionsPage : public QWidget\n{\n    Q_OBJECT\npublic:\n    explicit MainOptionsPage(QWidget *parent=0);\n\n    void setMapper(MonitoredDataMapper *mapper);\nprivate:\n    QCheckBox *bitcoin_at_startup;\n#ifndef Q_WS_MAC\n    QCheckBox *minimize_to_tray;\n#endif\n    QCheckBox *map_port_upnp;\n#ifndef Q_WS_MAC\n    QCheckBox *minimize_on_close;\n#endif\n    QCheckBox *connect_socks4;\n    QCheckBox *detach_database;\n    QLineEdit *proxy_ip;\n    QLineEdit *proxy_port;\n    BitcoinAmountField *fee_edit;\n\nsignals:\n\npublic slots:\n\n};\n\nclass DisplayOptionsPage : public QWidget\n{\n    Q_OBJECT\npublic:\n    explicit DisplayOptionsPage(QWidget *parent=0);\n\n    void setMapper(MonitoredDataMapper *mapper);\nprivate:\n    QValueComboBox *unit;\n    QCheckBox *display_addresses;\nsignals:\n\npublic slots:\n\n};\n\n#include \"optionsdialog.moc\"\n\nOptionsDialog::OptionsDialog(QWidget *parent):\n    QDialog(parent), contents_widget(0), pages_widget(0),\n    model(0), main_page(0), display_page(0)\n{\n    contents_widget = new QListWidget();\n    contents_widget->setMaximumWidth(128);\n\n    pages_widget = new QStackedWidget();\n    pages_widget->setMinimumWidth(300);\n\n    QListWidgetItem *item_main = new QListWidgetItem(tr(\"Main\"));\n    contents_widget->addItem(item_main);\n    main_page = new MainOptionsPage(this);\n    pages_widget->addWidget(main_page);\n\n    QListWidgetItem *item_display = new QListWidgetItem(tr(\"Display\"));\n    contents_widget->addItem(item_display);\n    display_page = new DisplayOptionsPage(this);\n    pages_widget->addWidget(display_page);\n\n    contents_widget->setCurrentRow(0);\n\n    QHBoxLayout *main_layout = new QHBoxLayout();\n    main_layout->addWidget(contents_widget);\n    main_layout->addWidget(pages_widget, 1);\n\n    QVBoxLayout *layout = new QVBoxLayout();\n    layout->addLayout(main_layout);\n\n    QDialogButtonBox *buttonbox = new QDialogButtonBox();\n    buttonbox->setStandardButtons(QDialogButtonBox::Apply|QDialogButtonBox::Ok|QDialogButtonBox::Cancel);\n    apply_button = buttonbox->button(QDialogButtonBox::Apply);\n    layout->addWidget(buttonbox);\n\n    setLayout(layout);\n    setWindowTitle(tr(\"Options\"));\n\n    \/* Widget-to-option mapper *\/\n    mapper = new MonitoredDataMapper(this);\n    mapper->setSubmitPolicy(QDataWidgetMapper::ManualSubmit);\n    mapper->setOrientation(Qt::Vertical);\n    \/* enable apply button when data modified *\/\n    connect(mapper, SIGNAL(viewModified()), this, SLOT(enableApply()));\n    \/* disable apply button when new data loaded *\/\n    connect(mapper, SIGNAL(currentIndexChanged(int)), this, SLOT(disableApply()));\n\n    \/* Event bindings *\/\n    connect(contents_widget, SIGNAL(currentRowChanged(int)), this, SLOT(changePage(int)));\n    connect(buttonbox->button(QDialogButtonBox::Ok), SIGNAL(clicked()), this, SLOT(okClicked()));\n    connect(buttonbox->button(QDialogButtonBox::Cancel), SIGNAL(clicked()), this, SLOT(cancelClicked()));\n    connect(buttonbox->button(QDialogButtonBox::Apply), SIGNAL(clicked()), this, SLOT(applyClicked()));\n}\n\nvoid OptionsDialog::setModel(OptionsModel *model)\n{\n    this->model = model;\n\n    mapper->setModel(model);\n    main_page->setMapper(mapper);\n    display_page->setMapper(mapper);\n\n    mapper->toFirst();\n}\n\nvoid OptionsDialog::changePage(int index)\n{\n    pages_widget->setCurrentIndex(index);\n}\n\nvoid OptionsDialog::okClicked()\n{\n    mapper->submit();\n    accept();\n}\n\nvoid OptionsDialog::cancelClicked()\n{\n    reject();\n}\n\nvoid OptionsDialog::applyClicked()\n{\n    mapper->submit();\n    apply_button->setEnabled(false);\n}\n\nvoid OptionsDialog::enableApply()\n{\n    apply_button->setEnabled(true);\n}\n\nvoid OptionsDialog::disableApply()\n{\n    apply_button->setEnabled(false);\n}\n\nMainOptionsPage::MainOptionsPage(QWidget *parent):\n        QWidget(parent)\n{\n    QVBoxLayout *layout = new QVBoxLayout();\n\n    bitcoin_at_startup = new QCheckBox(tr(\"&Start Bitcoin on window system startup\"));\n    bitcoin_at_startup->setToolTip(tr(\"Automatically start Bitcoin after the computer is turned on\"));\n    layout->addWidget(bitcoin_at_startup);\n\n#ifndef Q_WS_MAC\n    minimize_to_tray = new QCheckBox(tr(\"&Minimize to the tray instead of the taskbar\"));\n    minimize_to_tray->setToolTip(tr(\"Show only a tray icon after minimizing the window\"));\n    layout->addWidget(minimize_to_tray);\n\n    minimize_on_close = new QCheckBox(tr(\"M&inimize on close\"));\n    minimize_on_close->setToolTip(tr(\"Minimize instead of exit the application when the window is closed. When this option is enabled, the application will be closed only after selecting Quit in the menu.\"));\n    layout->addWidget(minimize_on_close);\n#endif\n\n    map_port_upnp = new QCheckBox(tr(\"Map port using &UPnP\"));\n    map_port_upnp->setToolTip(tr(\"Automatically open the Bitcoin client port on the router. This only works when your router supports UPnP and it is enabled.\"));\n    layout->addWidget(map_port_upnp);\n\n    connect_socks4 = new QCheckBox(tr(\"&Connect through SOCKS4 proxy:\"));\n    connect_socks4->setToolTip(tr(\"Connect to the Bitcon network through a SOCKS4 proxy (e.g. when connecting through Tor)\"));\n    layout->addWidget(connect_socks4);\n\n    QHBoxLayout *proxy_hbox = new QHBoxLayout();\n    proxy_hbox->addSpacing(18);\n    QLabel *proxy_ip_label = new QLabel(tr(\"Proxy &IP: \"));\n    proxy_hbox->addWidget(proxy_ip_label);\n    proxy_ip = new QLineEdit();\n    proxy_ip->setMaximumWidth(140);\n    proxy_ip->setEnabled(false);\n    proxy_ip->setValidator(new QRegExpValidator(QRegExp(\"[0-9]{1,3}\\\\.[0-9]{1,3}\\\\.[0-9]{1,3}\\\\.[0-9]{1,3}\"), this));\n    proxy_ip->setToolTip(tr(\"IP address of the proxy (e.g. 127.0.0.1)\"));\n    proxy_ip_label->setBuddy(proxy_ip);\n    proxy_hbox->addWidget(proxy_ip);\n    QLabel *proxy_port_label = new QLabel(tr(\"&Port: \"));\n    proxy_hbox->addWidget(proxy_port_label);\n    proxy_port = new QLineEdit();\n    proxy_port->setMaximumWidth(55);\n    proxy_port->setValidator(new QIntValidator(0, 65535, this));\n    proxy_port->setEnabled(false);\n    proxy_port->setToolTip(tr(\"Port of the proxy (e.g. 1234)\"));\n    proxy_port_label->setBuddy(proxy_port);\n    proxy_hbox->addWidget(proxy_port);\n    proxy_hbox->addStretch(1);\n\n    layout->addLayout(proxy_hbox);\n    QLabel *fee_help = new QLabel(tr(\"Optional transaction fee per kB that helps make sure your transactions are processed quickly.  Most transactions are 1 kB.  Fee 0.01 recommended.\"));\n    fee_help->setWordWrap(true);\n    layout->addWidget(fee_help);\n\n    QHBoxLayout *fee_hbox = new QHBoxLayout();\n    fee_hbox->addSpacing(18);\n    QLabel *fee_label = new QLabel(tr(\"Pay transaction &fee\"));\n    fee_hbox->addWidget(fee_label);\n    fee_edit = new BitcoinAmountField();\n\n    fee_label->setBuddy(fee_edit);\n    fee_hbox->addWidget(fee_edit);\n    fee_hbox->addStretch(1);\n\n    layout->addLayout(fee_hbox);\n\n    detach_database = new QCheckBox(tr(\"Detach databases at shutdown\"));\n    detach_database->setToolTip(tr(\"Detach block and address databases at shutdown. This means they can be moved to another data directory, but it slows down shutdown. The wallet is always detached.\"));\n    layout->addWidget(detach_database);\n\n    layout->addStretch(1); \/\/ Extra space at bottom\n\n    setLayout(layout);\n\n    connect(connect_socks4, SIGNAL(toggled(bool)), proxy_ip, SLOT(setEnabled(bool)));\n    connect(connect_socks4, SIGNAL(toggled(bool)), proxy_port, SLOT(setEnabled(bool)));\n\n#ifndef USE_UPNP\n    map_port_upnp->setDisabled(true);\n#endif\n}\n\nvoid MainOptionsPage::setMapper(MonitoredDataMapper *mapper)\n{\n    \/\/ Map model to widgets\n    mapper->addMapping(bitcoin_at_startup, OptionsModel::StartAtStartup);\n#ifndef Q_WS_MAC\n    mapper->addMapping(minimize_to_tray, OptionsModel::MinimizeToTray);\n#endif\n    mapper->addMapping(map_port_upnp, OptionsModel::MapPortUPnP);\n#ifndef Q_WS_MAC\n    mapper->addMapping(minimize_on_close, OptionsModel::MinimizeOnClose);\n#endif\n    mapper->addMapping(connect_socks4, OptionsModel::ConnectSOCKS4);\n    mapper->addMapping(proxy_ip, OptionsModel::ProxyIP);\n    mapper->addMapping(proxy_port, OptionsModel::ProxyPort);\n    mapper->addMapping(fee_edit, OptionsModel::Fee);\n    mapper->addMapping(detach_database, OptionsModel::DetachDatabases);\n}\n\nDisplayOptionsPage::DisplayOptionsPage(QWidget *parent):\n        QWidget(parent)\n{\n    QVBoxLayout *layout = new QVBoxLayout();\n\n    QHBoxLayout *unit_hbox = new QHBoxLayout();\n    unit_hbox->addSpacing(18);\n    QLabel *unit_label = new QLabel(tr(\"&Unit to show amounts in: \"));\n    unit_hbox->addWidget(unit_label);\n    unit = new QValueComboBox(this);\n    unit->setModel(new BitcoinUnits(this));\n    unit->setToolTip(tr(\"Choose the default subdivision unit to show in the interface, and when sending coins\"));\n\n    unit_label->setBuddy(unit);\n    unit_hbox->addWidget(unit);\n\n    layout->addLayout(unit_hbox);\n\n    display_addresses = new QCheckBox(tr(\"&Display addresses in transaction list\"), this);\n    display_addresses->setToolTip(tr(\"Whether to show Bitcoin addresses in the transaction list\"));\n    layout->addWidget(display_addresses);\n\n    layout->addStretch();\n\n    setLayout(layout);\n}\n\nvoid DisplayOptionsPage::setMapper(MonitoredDataMapper *mapper)\n{\n    mapper->addMapping(unit, OptionsModel::DisplayUnit);\n    mapper->addMapping(display_addresses, OptionsModel::DisplayAddresses);\n}\n<commit_msg>remove 2 ugly spaces from a string used in translations<commit_after>#include \"optionsdialog.h\"\n#include \"optionsmodel.h\"\n#include \"bitcoinamountfield.h\"\n#include \"monitoreddatamapper.h\"\n#include \"guiutil.h\"\n#include \"bitcoinunits.h\"\n#include \"qvaluecombobox.h\"\n\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n#include <QPushButton>\n#include <QListWidget>\n#include <QStackedWidget>\n\n#include <QCheckBox>\n#include <QLabel>\n#include <QLineEdit>\n#include <QIntValidator>\n#include <QDoubleValidator>\n#include <QRegExpValidator>\n#include <QDialogButtonBox>\n\n\/* First page of options *\/\nclass MainOptionsPage : public QWidget\n{\n    Q_OBJECT\npublic:\n    explicit MainOptionsPage(QWidget *parent=0);\n\n    void setMapper(MonitoredDataMapper *mapper);\nprivate:\n    QCheckBox *bitcoin_at_startup;\n#ifndef Q_WS_MAC\n    QCheckBox *minimize_to_tray;\n#endif\n    QCheckBox *map_port_upnp;\n#ifndef Q_WS_MAC\n    QCheckBox *minimize_on_close;\n#endif\n    QCheckBox *connect_socks4;\n    QCheckBox *detach_database;\n    QLineEdit *proxy_ip;\n    QLineEdit *proxy_port;\n    BitcoinAmountField *fee_edit;\n\nsignals:\n\npublic slots:\n\n};\n\nclass DisplayOptionsPage : public QWidget\n{\n    Q_OBJECT\npublic:\n    explicit DisplayOptionsPage(QWidget *parent=0);\n\n    void setMapper(MonitoredDataMapper *mapper);\nprivate:\n    QValueComboBox *unit;\n    QCheckBox *display_addresses;\nsignals:\n\npublic slots:\n\n};\n\n#include \"optionsdialog.moc\"\n\nOptionsDialog::OptionsDialog(QWidget *parent):\n    QDialog(parent), contents_widget(0), pages_widget(0),\n    model(0), main_page(0), display_page(0)\n{\n    contents_widget = new QListWidget();\n    contents_widget->setMaximumWidth(128);\n\n    pages_widget = new QStackedWidget();\n    pages_widget->setMinimumWidth(300);\n\n    QListWidgetItem *item_main = new QListWidgetItem(tr(\"Main\"));\n    contents_widget->addItem(item_main);\n    main_page = new MainOptionsPage(this);\n    pages_widget->addWidget(main_page);\n\n    QListWidgetItem *item_display = new QListWidgetItem(tr(\"Display\"));\n    contents_widget->addItem(item_display);\n    display_page = new DisplayOptionsPage(this);\n    pages_widget->addWidget(display_page);\n\n    contents_widget->setCurrentRow(0);\n\n    QHBoxLayout *main_layout = new QHBoxLayout();\n    main_layout->addWidget(contents_widget);\n    main_layout->addWidget(pages_widget, 1);\n\n    QVBoxLayout *layout = new QVBoxLayout();\n    layout->addLayout(main_layout);\n\n    QDialogButtonBox *buttonbox = new QDialogButtonBox();\n    buttonbox->setStandardButtons(QDialogButtonBox::Apply|QDialogButtonBox::Ok|QDialogButtonBox::Cancel);\n    apply_button = buttonbox->button(QDialogButtonBox::Apply);\n    layout->addWidget(buttonbox);\n\n    setLayout(layout);\n    setWindowTitle(tr(\"Options\"));\n\n    \/* Widget-to-option mapper *\/\n    mapper = new MonitoredDataMapper(this);\n    mapper->setSubmitPolicy(QDataWidgetMapper::ManualSubmit);\n    mapper->setOrientation(Qt::Vertical);\n    \/* enable apply button when data modified *\/\n    connect(mapper, SIGNAL(viewModified()), this, SLOT(enableApply()));\n    \/* disable apply button when new data loaded *\/\n    connect(mapper, SIGNAL(currentIndexChanged(int)), this, SLOT(disableApply()));\n\n    \/* Event bindings *\/\n    connect(contents_widget, SIGNAL(currentRowChanged(int)), this, SLOT(changePage(int)));\n    connect(buttonbox->button(QDialogButtonBox::Ok), SIGNAL(clicked()), this, SLOT(okClicked()));\n    connect(buttonbox->button(QDialogButtonBox::Cancel), SIGNAL(clicked()), this, SLOT(cancelClicked()));\n    connect(buttonbox->button(QDialogButtonBox::Apply), SIGNAL(clicked()), this, SLOT(applyClicked()));\n}\n\nvoid OptionsDialog::setModel(OptionsModel *model)\n{\n    this->model = model;\n\n    mapper->setModel(model);\n    main_page->setMapper(mapper);\n    display_page->setMapper(mapper);\n\n    mapper->toFirst();\n}\n\nvoid OptionsDialog::changePage(int index)\n{\n    pages_widget->setCurrentIndex(index);\n}\n\nvoid OptionsDialog::okClicked()\n{\n    mapper->submit();\n    accept();\n}\n\nvoid OptionsDialog::cancelClicked()\n{\n    reject();\n}\n\nvoid OptionsDialog::applyClicked()\n{\n    mapper->submit();\n    apply_button->setEnabled(false);\n}\n\nvoid OptionsDialog::enableApply()\n{\n    apply_button->setEnabled(true);\n}\n\nvoid OptionsDialog::disableApply()\n{\n    apply_button->setEnabled(false);\n}\n\nMainOptionsPage::MainOptionsPage(QWidget *parent):\n        QWidget(parent)\n{\n    QVBoxLayout *layout = new QVBoxLayout();\n\n    bitcoin_at_startup = new QCheckBox(tr(\"&Start Bitcoin on window system startup\"));\n    bitcoin_at_startup->setToolTip(tr(\"Automatically start Bitcoin after the computer is turned on\"));\n    layout->addWidget(bitcoin_at_startup);\n\n#ifndef Q_WS_MAC\n    minimize_to_tray = new QCheckBox(tr(\"&Minimize to the tray instead of the taskbar\"));\n    minimize_to_tray->setToolTip(tr(\"Show only a tray icon after minimizing the window\"));\n    layout->addWidget(minimize_to_tray);\n\n    minimize_on_close = new QCheckBox(tr(\"M&inimize on close\"));\n    minimize_on_close->setToolTip(tr(\"Minimize instead of exit the application when the window is closed. When this option is enabled, the application will be closed only after selecting Quit in the menu.\"));\n    layout->addWidget(minimize_on_close);\n#endif\n\n    map_port_upnp = new QCheckBox(tr(\"Map port using &UPnP\"));\n    map_port_upnp->setToolTip(tr(\"Automatically open the Bitcoin client port on the router. This only works when your router supports UPnP and it is enabled.\"));\n    layout->addWidget(map_port_upnp);\n\n    connect_socks4 = new QCheckBox(tr(\"&Connect through SOCKS4 proxy:\"));\n    connect_socks4->setToolTip(tr(\"Connect to the Bitcon network through a SOCKS4 proxy (e.g. when connecting through Tor)\"));\n    layout->addWidget(connect_socks4);\n\n    QHBoxLayout *proxy_hbox = new QHBoxLayout();\n    proxy_hbox->addSpacing(18);\n    QLabel *proxy_ip_label = new QLabel(tr(\"Proxy &IP: \"));\n    proxy_hbox->addWidget(proxy_ip_label);\n    proxy_ip = new QLineEdit();\n    proxy_ip->setMaximumWidth(140);\n    proxy_ip->setEnabled(false);\n    proxy_ip->setValidator(new QRegExpValidator(QRegExp(\"[0-9]{1,3}\\\\.[0-9]{1,3}\\\\.[0-9]{1,3}\\\\.[0-9]{1,3}\"), this));\n    proxy_ip->setToolTip(tr(\"IP address of the proxy (e.g. 127.0.0.1)\"));\n    proxy_ip_label->setBuddy(proxy_ip);\n    proxy_hbox->addWidget(proxy_ip);\n    QLabel *proxy_port_label = new QLabel(tr(\"&Port: \"));\n    proxy_hbox->addWidget(proxy_port_label);\n    proxy_port = new QLineEdit();\n    proxy_port->setMaximumWidth(55);\n    proxy_port->setValidator(new QIntValidator(0, 65535, this));\n    proxy_port->setEnabled(false);\n    proxy_port->setToolTip(tr(\"Port of the proxy (e.g. 1234)\"));\n    proxy_port_label->setBuddy(proxy_port);\n    proxy_hbox->addWidget(proxy_port);\n    proxy_hbox->addStretch(1);\n\n    layout->addLayout(proxy_hbox);\n    QLabel *fee_help = new QLabel(tr(\"Optional transaction fee per kB that helps make sure your transactions are processed quickly. Most transactions are 1 kB. Fee 0.01 recommended.\"));\n    fee_help->setWordWrap(true);\n    layout->addWidget(fee_help);\n\n    QHBoxLayout *fee_hbox = new QHBoxLayout();\n    fee_hbox->addSpacing(18);\n    QLabel *fee_label = new QLabel(tr(\"Pay transaction &fee\"));\n    fee_hbox->addWidget(fee_label);\n    fee_edit = new BitcoinAmountField();\n\n    fee_label->setBuddy(fee_edit);\n    fee_hbox->addWidget(fee_edit);\n    fee_hbox->addStretch(1);\n\n    layout->addLayout(fee_hbox);\n\n    detach_database = new QCheckBox(tr(\"Detach databases at shutdown\"));\n    detach_database->setToolTip(tr(\"Detach block and address databases at shutdown. This means they can be moved to another data directory, but it slows down shutdown. The wallet is always detached.\"));\n    layout->addWidget(detach_database);\n\n    layout->addStretch(1); \/\/ Extra space at bottom\n\n    setLayout(layout);\n\n    connect(connect_socks4, SIGNAL(toggled(bool)), proxy_ip, SLOT(setEnabled(bool)));\n    connect(connect_socks4, SIGNAL(toggled(bool)), proxy_port, SLOT(setEnabled(bool)));\n\n#ifndef USE_UPNP\n    map_port_upnp->setDisabled(true);\n#endif\n}\n\nvoid MainOptionsPage::setMapper(MonitoredDataMapper *mapper)\n{\n    \/\/ Map model to widgets\n    mapper->addMapping(bitcoin_at_startup, OptionsModel::StartAtStartup);\n#ifndef Q_WS_MAC\n    mapper->addMapping(minimize_to_tray, OptionsModel::MinimizeToTray);\n#endif\n    mapper->addMapping(map_port_upnp, OptionsModel::MapPortUPnP);\n#ifndef Q_WS_MAC\n    mapper->addMapping(minimize_on_close, OptionsModel::MinimizeOnClose);\n#endif\n    mapper->addMapping(connect_socks4, OptionsModel::ConnectSOCKS4);\n    mapper->addMapping(proxy_ip, OptionsModel::ProxyIP);\n    mapper->addMapping(proxy_port, OptionsModel::ProxyPort);\n    mapper->addMapping(fee_edit, OptionsModel::Fee);\n    mapper->addMapping(detach_database, OptionsModel::DetachDatabases);\n}\n\nDisplayOptionsPage::DisplayOptionsPage(QWidget *parent):\n        QWidget(parent)\n{\n    QVBoxLayout *layout = new QVBoxLayout();\n\n    QHBoxLayout *unit_hbox = new QHBoxLayout();\n    unit_hbox->addSpacing(18);\n    QLabel *unit_label = new QLabel(tr(\"&Unit to show amounts in: \"));\n    unit_hbox->addWidget(unit_label);\n    unit = new QValueComboBox(this);\n    unit->setModel(new BitcoinUnits(this));\n    unit->setToolTip(tr(\"Choose the default subdivision unit to show in the interface, and when sending coins\"));\n\n    unit_label->setBuddy(unit);\n    unit_hbox->addWidget(unit);\n\n    layout->addLayout(unit_hbox);\n\n    display_addresses = new QCheckBox(tr(\"&Display addresses in transaction list\"), this);\n    display_addresses->setToolTip(tr(\"Whether to show Bitcoin addresses in the transaction list\"));\n    layout->addWidget(display_addresses);\n\n    layout->addStretch();\n\n    setLayout(layout);\n}\n\nvoid DisplayOptionsPage::setMapper(MonitoredDataMapper *mapper)\n{\n    mapper->addMapping(unit, OptionsModel::DisplayUnit);\n    mapper->addMapping(display_addresses, OptionsModel::DisplayAddresses);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef RDB_PROTOCOL_VAL_HPP_\n#define RDB_PROTOCOL_VAL_HPP_\n\n#include <string>\n#include <utility>\n\n#include \"rdb_protocol\/datum.hpp\"\n#include \"rdb_protocol\/datum_stream.hpp\"\n#include \"rdb_protocol\/func.hpp\"\n#include \"rdb_protocol\/ql2.pb.h\"\n#include \"rdb_protocol\/stream.hpp\"\n\nnamespace ql {\nclass env_t;\nclass val_t;\nclass term_t;\n\nclass table_t : public ptr_baggable_t, public pb_rcheckable_t {\npublic:\n    table_t(env_t *_env, uuid_u db_id, const std::string &name,\n            bool use_outdated, const pb_rcheckable_t *src);\n    datum_stream_t *as_datum_stream();\n    const std::string &get_pkey();\n    const datum_t *get_row(const datum_t *pval);\n    datum_t *env_add_ptr(datum_t *d);\n\n    \/\/ A wrapper around `do_replace` that does error handling correctly.\n    \/\/ TODO: Use a variadic template so we can get rid of\n    \/\/ `_so_the_template_matches` above?\n    template<class T>\n    const datum_t *replace(const datum_t *d, T t, bool b) {\n        rcheck(!use_outdated, \"Cannot perform write operations on outdated tables.\");\n        try {\n            return do_replace(d, t, b);\n        } catch (const any_ql_exc_t &e) {\n            datum_t *datum = env_add_ptr(new datum_t(datum_t::R_OBJECT));\n            std::string err = e.what();\n            \/\/ TODO why is this bool (which is marked as MUST USE not used?)\n            \/\/ T0D0NE: the bool is true if there's a conflict when inserting the\n            \/\/ key, but since we just created an empty object above conflicts\n            \/\/ are impossible here.  If you want to harden this against future\n            \/\/ changes, you could store the bool and `r_sanity_check` that it's\n            \/\/ false.\n            UNUSED bool key_in_object =\n                datum->add(\"first_error\", env_add_ptr(new datum_t(err)))\n                || datum->add(\"errors\", env_add_ptr(new datum_t(1L)));\n            return datum;\n        }\n    }\nprivate:\n    const datum_t *do_replace(const datum_t *orig, const map_wire_func_t &mwf,\n                             bool _so_the_template_matches = false);\n    const datum_t *do_replace(const datum_t *orig, func_t *f, bool nondet_ok);\n    const datum_t *do_replace(const datum_t *orig, const datum_t *d, bool upsert);\n\n    env_t *env;\n    bool use_outdated;\n    std::string pkey;\n    scoped_ptr_t<namespace_repo_t<rdb_protocol_t>::access_t> access;\n};\n\n\nenum function_shortcut_t {\n    NO_SHORTCUT = 0,\n    IDENTITY_SHORTCUT = 1,\n};\n\n\/\/ A value is anything RQL can pass around -- a datum, a sequence, a function, a\n\/\/ selection, whatever.\nclass val_t : public ptr_baggable_t, public pb_rcheckable_t {\npublic:\n    \/\/ This type is intentionally opaque.  It is almost always an error to\n    \/\/ compare two `val_t` types rather than testing whether one is convertible\n    \/\/ to another.\n    class type_t {\n        friend class val_t;\n        friend void run(Query2 *q, scoped_ptr_t<env_t> *env_ptr,\n                        Response2 *res, stream_cache2_t *stream_cache2);\n    public:\n        enum raw_type_t {\n            DB               = 1, \/\/ db\n            TABLE            = 2, \/\/ table\n            SELECTION        = 3, \/\/ table, sequence\n            SEQUENCE         = 4, \/\/ sequence\n            SINGLE_SELECTION = 5, \/\/ table, datum (object)\n            DATUM            = 6, \/\/ datum\n            FUNC             = 7  \/\/ func\n        };\n        type_t(raw_type_t _raw_type); \/\/ NOLINT\n        bool is_convertible(type_t rhs) const;\n    private:\n        friend class coerce_term_t;\n        friend class typeof_term_t;\n        const char *name() const;\n        raw_type_t raw_type;\n    };\n    type_t get_type() const;\n\n    val_t(const datum_t *_datum, const term_t *_parent, env_t *_env);\n    val_t(const datum_t *_datum, table_t *_table, const term_t *_parent, env_t *_env);\n    val_t(datum_stream_t *_sequence, const term_t *_parent, env_t *_env);\n    val_t(table_t *_table, const term_t *_parent, env_t *_env);\n    val_t(table_t *_table, datum_stream_t *_sequence,\n          const term_t *_parent, env_t *_env);\n    val_t(uuid_u _db, const term_t *_parent, env_t *_env);\n    val_t(func_t *_func, const term_t *_parent, env_t *_env);\n\n    uuid_u as_db();\n    table_t *as_table();\n    std::pair<table_t *, datum_stream_t *> as_selection();\n    datum_stream_t *as_seq();\n    std::pair<table_t *, const datum_t *> as_single_selection();\n    \/\/ See func.hpp for an explanation of shortcut functions.\n    func_t *as_func(function_shortcut_t shortcut = NO_SHORTCUT);\n\n    const datum_t *as_datum(); \/\/ prefer the 4 below\n    bool as_bool();\n    double as_num();\n    template<class T>\n    T as_int() {\n        int64_t i = as_int();\n        T t = static_cast<T>(i);\n        rcheck(static_cast<int64_t>(t) == i,\n               strprintf(\"Integer too large: %\" PRIi64, i));\n        return t;\n    }\n    int64_t as_int();\n    const std::string &as_str();\n\n    std::string print() {\n        if (get_type().is_convertible(type_t::DATUM)) {\n            return as_datum()->print();\n        } else {\n            \/\/ TODO: Do something smarter here?\n            return strprintf(\"OPAQUE VAL %s\", get_type().name());\n        }\n    }\n\nprivate:\n    void rcheck_literal_type(type_t::raw_type_t expected_raw_type);\n\n    const term_t *parent;\n    env_t *env;\n\n    type_t type;\n    uuid_u db;\n    table_t *table;\n    datum_stream_t *sequence;\n    const datum_t *datum;\n    func_t *func;\n\n    DISABLE_COPYING(val_t);\n};\n\n} \/\/namespace ql\n#endif \/\/ RDB_PROTOCOL_VAL_HPP_\n<commit_msg>VALUE is better than VAL<commit_after>#ifndef RDB_PROTOCOL_VAL_HPP_\n#define RDB_PROTOCOL_VAL_HPP_\n\n#include <string>\n#include <utility>\n\n#include \"rdb_protocol\/datum.hpp\"\n#include \"rdb_protocol\/datum_stream.hpp\"\n#include \"rdb_protocol\/func.hpp\"\n#include \"rdb_protocol\/ql2.pb.h\"\n#include \"rdb_protocol\/stream.hpp\"\n\nnamespace ql {\nclass env_t;\nclass val_t;\nclass term_t;\n\nclass table_t : public ptr_baggable_t, public pb_rcheckable_t {\npublic:\n    table_t(env_t *_env, uuid_u db_id, const std::string &name,\n            bool use_outdated, const pb_rcheckable_t *src);\n    datum_stream_t *as_datum_stream();\n    const std::string &get_pkey();\n    const datum_t *get_row(const datum_t *pval);\n    datum_t *env_add_ptr(datum_t *d);\n\n    \/\/ A wrapper around `do_replace` that does error handling correctly.\n    \/\/ TODO: Use a variadic template so we can get rid of\n    \/\/ `_so_the_template_matches` above?\n    template<class T>\n    const datum_t *replace(const datum_t *d, T t, bool b) {\n        rcheck(!use_outdated, \"Cannot perform write operations on outdated tables.\");\n        try {\n            return do_replace(d, t, b);\n        } catch (const any_ql_exc_t &e) {\n            datum_t *datum = env_add_ptr(new datum_t(datum_t::R_OBJECT));\n            std::string err = e.what();\n            \/\/ TODO why is this bool (which is marked as MUST USE not used?)\n            \/\/ T0D0NE: the bool is true if there's a conflict when inserting the\n            \/\/ key, but since we just created an empty object above conflicts\n            \/\/ are impossible here.  If you want to harden this against future\n            \/\/ changes, you could store the bool and `r_sanity_check` that it's\n            \/\/ false.\n            UNUSED bool key_in_object =\n                datum->add(\"first_error\", env_add_ptr(new datum_t(err)))\n                || datum->add(\"errors\", env_add_ptr(new datum_t(1L)));\n            return datum;\n        }\n    }\nprivate:\n    const datum_t *do_replace(const datum_t *orig, const map_wire_func_t &mwf,\n                             bool _so_the_template_matches = false);\n    const datum_t *do_replace(const datum_t *orig, func_t *f, bool nondet_ok);\n    const datum_t *do_replace(const datum_t *orig, const datum_t *d, bool upsert);\n\n    env_t *env;\n    bool use_outdated;\n    std::string pkey;\n    scoped_ptr_t<namespace_repo_t<rdb_protocol_t>::access_t> access;\n};\n\n\nenum function_shortcut_t {\n    NO_SHORTCUT = 0,\n    IDENTITY_SHORTCUT = 1,\n};\n\n\/\/ A value is anything RQL can pass around -- a datum, a sequence, a function, a\n\/\/ selection, whatever.\nclass val_t : public ptr_baggable_t, public pb_rcheckable_t {\npublic:\n    \/\/ This type is intentionally opaque.  It is almost always an error to\n    \/\/ compare two `val_t` types rather than testing whether one is convertible\n    \/\/ to another.\n    class type_t {\n        friend class val_t;\n        friend void run(Query2 *q, scoped_ptr_t<env_t> *env_ptr,\n                        Response2 *res, stream_cache2_t *stream_cache2);\n    public:\n        enum raw_type_t {\n            DB               = 1, \/\/ db\n            TABLE            = 2, \/\/ table\n            SELECTION        = 3, \/\/ table, sequence\n            SEQUENCE         = 4, \/\/ sequence\n            SINGLE_SELECTION = 5, \/\/ table, datum (object)\n            DATUM            = 6, \/\/ datum\n            FUNC             = 7  \/\/ func\n        };\n        type_t(raw_type_t _raw_type); \/\/ NOLINT\n        bool is_convertible(type_t rhs) const;\n    private:\n        friend class coerce_term_t;\n        friend class typeof_term_t;\n        const char *name() const;\n        raw_type_t raw_type;\n    };\n    type_t get_type() const;\n\n    val_t(const datum_t *_datum, const term_t *_parent, env_t *_env);\n    val_t(const datum_t *_datum, table_t *_table, const term_t *_parent, env_t *_env);\n    val_t(datum_stream_t *_sequence, const term_t *_parent, env_t *_env);\n    val_t(table_t *_table, const term_t *_parent, env_t *_env);\n    val_t(table_t *_table, datum_stream_t *_sequence,\n          const term_t *_parent, env_t *_env);\n    val_t(uuid_u _db, const term_t *_parent, env_t *_env);\n    val_t(func_t *_func, const term_t *_parent, env_t *_env);\n\n    uuid_u as_db();\n    table_t *as_table();\n    std::pair<table_t *, datum_stream_t *> as_selection();\n    datum_stream_t *as_seq();\n    std::pair<table_t *, const datum_t *> as_single_selection();\n    \/\/ See func.hpp for an explanation of shortcut functions.\n    func_t *as_func(function_shortcut_t shortcut = NO_SHORTCUT);\n\n    const datum_t *as_datum(); \/\/ prefer the 4 below\n    bool as_bool();\n    double as_num();\n    template<class T>\n    T as_int() {\n        int64_t i = as_int();\n        T t = static_cast<T>(i);\n        rcheck(static_cast<int64_t>(t) == i,\n               strprintf(\"Integer too large: %\" PRIi64, i));\n        return t;\n    }\n    int64_t as_int();\n    const std::string &as_str();\n\n    std::string print() {\n        if (get_type().is_convertible(type_t::DATUM)) {\n            return as_datum()->print();\n        } else {\n            \/\/ TODO: Do something smarter here?\n            return strprintf(\"OPAQUE VALUE %s\", get_type().name());\n        }\n    }\n\nprivate:\n    void rcheck_literal_type(type_t::raw_type_t expected_raw_type);\n\n    const term_t *parent;\n    env_t *env;\n\n    type_t type;\n    uuid_u db;\n    table_t *table;\n    datum_stream_t *sequence;\n    const datum_t *datum;\n    func_t *func;\n\n    DISABLE_COPYING(val_t);\n};\n\n} \/\/namespace ql\n#endif \/\/ RDB_PROTOCOL_VAL_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2012 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 *     * 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 \"core\/dom\/shadow\/ElementShadow.h\"\n\n#include \"core\/dom\/ContainerNodeAlgorithms.h\"\n#include \"core\/dom\/ElementTraversal.h\"\n#include \"core\/dom\/NodeTraversal.h\"\n#include \"core\/dom\/shadow\/ContentDistribution.h\"\n#include \"core\/dom\/shadow\/InsertionPoint.h\"\n#include \"core\/dom\/shadow\/ShadowRoot.h\"\n#include \"core\/html\/shadow\/HTMLContentElement.h\"\n#include \"core\/html\/shadow\/HTMLShadowElement.h\"\n\nnamespace WebCore {\n\nclass DistributionPool {\npublic:\n    explicit DistributionPool(const ContainerNode*);\n    ~DistributionPool();\n    void distributeTo(InsertionPoint*, ElementShadow*);\n\nprivate:\n    void populateChildren(const ContainerNode*);\n    void detachNonDistributedNodes();\n    Vector<Node*> m_nodes;\n    Vector<bool> m_distributed;\n};\n\ninline DistributionPool::DistributionPool(const ContainerNode* parent)\n{\n    if (parent)\n        populateChildren(parent);\n}\n\ninline void DistributionPool::populateChildren(const ContainerNode* parent)\n{\n    m_nodes.reserveInitialCapacity(32);\n    for (Node* child = parent->firstChild(); child; child = child->nextSibling()) {\n        if (isActiveInsertionPoint(child)) {\n            InsertionPoint* insertionPoint = toInsertionPoint(child);\n            if (insertionPoint->hasDistribution()) {\n                for (size_t i = 0; i < insertionPoint->size(); ++i)\n                    m_nodes.append(insertionPoint->at(i));\n            } else {\n                \/\/ Fallback elements.\n                for (Node* fallbackNode = insertionPoint->firstChild(); fallbackNode; fallbackNode = fallbackNode->nextSibling())\n                    m_nodes.append(fallbackNode);\n            }\n        } else {\n            m_nodes.append(child);\n        }\n    }\n    m_distributed.resize(m_nodes.size());\n    m_distributed.fill(false);\n}\n\nvoid DistributionPool::distributeTo(InsertionPoint* insertionPoint, ElementShadow* elementShadow)\n{\n    ContentDistribution distribution;\n\n    for (size_t i = 0; i < m_nodes.size(); ++i) {\n        if (m_distributed[i])\n            continue;\n\n        if (isHTMLContentElement(insertionPoint) && !toHTMLContentElement(insertionPoint)->canSelectNode(m_nodes, i))\n            continue;\n\n        Node* node = m_nodes[i];\n        distribution.append(node);\n        elementShadow->didDistributeNode(node, insertionPoint);\n        m_distributed[i] = true;\n    }\n\n    insertionPoint->setDistribution(distribution);\n}\n\ninline DistributionPool::~DistributionPool()\n{\n    detachNonDistributedNodes();\n}\n\ninline void DistributionPool::detachNonDistributedNodes()\n{\n    for (size_t i = 0; i < m_nodes.size(); ++i) {\n        if (m_distributed[i])\n            continue;\n        if (m_nodes[i]->renderer())\n            m_nodes[i]->lazyReattachIfAttached();\n    }\n}\n\nPassOwnPtr<ElementShadow> ElementShadow::create()\n{\n    return adoptPtr(new ElementShadow());\n}\n\nElementShadow::ElementShadow()\n    : m_needsDistributionRecalc(false)\n    , m_applyAuthorStyles(false)\n    , m_needsSelectFeatureSet(false)\n{\n}\n\nElementShadow::~ElementShadow()\n{\n    removeAllShadowRoots();\n}\n\nShadowRoot* ElementShadow::addShadowRoot(Element& shadowHost, ShadowRoot::ShadowRootType type)\n{\n    RefPtr<ShadowRoot> shadowRoot = ShadowRoot::create(&shadowHost.document(), type);\n\n    shadowRoot->setParentOrShadowHostNode(&shadowHost);\n    shadowRoot->setParentTreeScope(&shadowHost.treeScope());\n    m_shadowRoots.push(shadowRoot.get());\n    ChildNodeInsertionNotifier(shadowHost).notify(*shadowRoot);\n    setNeedsDistributionRecalc();\n    shadowHost.lazyReattachIfAttached();\n\n    \/\/ addShadowRoot() affects apply-author-styles. However, we know that the youngest shadow root has not had any children yet.\n    \/\/ The youngest shadow root's apply-author-styles is default (false). So we can just set m_applyAuthorStyles false.\n    m_applyAuthorStyles = false;\n\n    shadowHost.didAddShadowRoot(*shadowRoot);\n    InspectorInstrumentation::didPushShadowRoot(&shadowHost, shadowRoot.get());\n\n    return shadowRoot.get();\n}\n\nvoid ElementShadow::removeAllShadowRoots()\n{\n    \/\/ Dont protect this ref count.\n    Element* shadowHost = host();\n    ASSERT(shadowHost);\n\n    while (RefPtr<ShadowRoot> oldRoot = m_shadowRoots.head()) {\n        InspectorInstrumentation::willPopShadowRoot(shadowHost, oldRoot.get());\n        shadowHost->document().removeFocusedElementOfSubtree(oldRoot.get());\n        m_shadowRoots.removeHead();\n        oldRoot->setParentOrShadowHostNode(0);\n        oldRoot->setParentTreeScope(&shadowHost->document());\n        oldRoot->setPrev(0);\n        oldRoot->setNext(0);\n        ChildNodeRemovalNotifier(*shadowHost).notify(*oldRoot);\n    }\n}\n\nvoid ElementShadow::attach(const Node::AttachContext& context)\n{\n    Node::AttachContext childrenContext(context);\n    childrenContext.resolvedStyle = 0;\n\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        if (root->needsAttach())\n            root->attach(childrenContext);\n    }\n}\n\nvoid ElementShadow::detach(const Node::AttachContext& context)\n{\n    Node::AttachContext childrenContext(context);\n    childrenContext.resolvedStyle = 0;\n\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        if (root->confusingAndOftenMisusedAttached())\n            root->detach(childrenContext);\n    }\n}\n\nvoid ElementShadow::removeAllEventListeners()\n{\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        for (Node* node = root; node; node = NodeTraversal::next(node))\n            node->removeAllEventListeners();\n    }\n}\n\nvoid ElementShadow::setNeedsDistributionRecalc()\n{\n    if (m_needsDistributionRecalc)\n        return;\n    m_needsDistributionRecalc = true;\n    host()->markAncestorsWithChildNeedsDistributionRecalc();\n    clearDistribution();\n}\n\nbool ElementShadow::didAffectApplyAuthorStyles()\n{\n    bool applyAuthorStyles = resolveApplyAuthorStyles();\n\n    if (m_applyAuthorStyles == applyAuthorStyles)\n        return false;\n\n    m_applyAuthorStyles = applyAuthorStyles;\n    return true;\n}\n\nbool ElementShadow::containsActiveStyles() const\n{\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        if (root->hasScopedHTMLStyleChild())\n            return true;\n        if (!root->containsShadowElements())\n            return false;\n    }\n    return false;\n}\n\nbool ElementShadow::resolveApplyAuthorStyles() const\n{\n    for (const ShadowRoot* shadowRoot = youngestShadowRoot(); shadowRoot; shadowRoot = shadowRoot->olderShadowRoot()) {\n        if (shadowRoot->applyAuthorStyles())\n            return true;\n        if (!shadowRoot->containsShadowElements())\n            break;\n    }\n    return false;\n}\n\nInsertionPoint* ElementShadow::findInsertionPointFor(const Node* key) const\n{\n    return m_nodeToInsertionPoint.get(key);\n}\n\nvoid ElementShadow::distribute()\n{\n    DistributionPool pool(host());\n    host()->setNeedsStyleRecalc();\n\n    Vector<HTMLShadowElement*, 32> activeShadowInsertionPoints;\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        HTMLShadowElement* firstActiveShadowInsertionPoint = 0;\n\n        const Vector<RefPtr<InsertionPoint> >& insertionPoints = root->childInsertionPoints();\n        for (size_t i = 0; i < insertionPoints.size(); ++i) {\n            InsertionPoint* point = insertionPoints[i].get();\n            if (!point->isActive())\n                continue;\n\n            if (isHTMLShadowElement(point)) {\n                if (!firstActiveShadowInsertionPoint)\n                    firstActiveShadowInsertionPoint = toHTMLShadowElement(point);\n            } else {\n                pool.distributeTo(point, this);\n                if (ElementShadow* shadow = shadowOfParentForDistribution(point))\n                    shadow->setNeedsDistributionRecalc();\n            }\n        }\n\n        if (firstActiveShadowInsertionPoint)\n            activeShadowInsertionPoints.append(firstActiveShadowInsertionPoint);\n    }\n\n    for (size_t i = activeShadowInsertionPoints.size(); i > 0; --i) {\n        HTMLShadowElement* shadowElement = activeShadowInsertionPoints[i - 1];\n        ShadowRoot* root = shadowElement->containingShadowRoot();\n        ASSERT(root);\n        if (root->olderShadowRoot() && root->olderShadowRoot()->type() == root->type()) {\n            \/\/ Only allow reprojecting older shadow roots between the same type to\n            \/\/ disallow reprojecting UA elements into author shadows.\n            distributeNodeChildrenTo(shadowElement, root->olderShadowRoot());\n            root->olderShadowRoot()->setInsertionPoint(shadowElement);\n        } else if (!root->olderShadowRoot()) {\n            \/\/ There's assumed to always be a UA shadow that selects all nodes.\n            \/\/ We don't actually add it, instead we just distribute the pool to the\n            \/\/ <shadow> in the oldest shadow root.\n            pool.distributeTo(shadowElement, this);\n        }\n        if (ElementShadow* shadow = shadowOfParentForDistribution(shadowElement))\n            shadow->setNeedsDistributionRecalc();\n    }\n}\n\nvoid ElementShadow::didDistributeNode(const Node* node, InsertionPoint* insertionPoint)\n{\n    m_nodeToInsertionPoint.add(node, insertionPoint);\n}\n\nvoid ElementShadow::distributeNodeChildrenTo(InsertionPoint* insertionPoint, ContainerNode* containerNode)\n{\n    DistributionPool pool(containerNode);\n    pool.distributeTo(insertionPoint, this);\n}\n\nconst SelectRuleFeatureSet& ElementShadow::ensureSelectFeatureSet()\n{\n    if (!m_needsSelectFeatureSet)\n        return m_selectFeatures;\n\n    m_selectFeatures.clear();\n    for (ShadowRoot* root = oldestShadowRoot(); root; root = root->youngerShadowRoot())\n        collectSelectFeatureSetFrom(root);\n    m_needsSelectFeatureSet = false;\n    return m_selectFeatures;\n}\n\nvoid ElementShadow::collectSelectFeatureSetFrom(ShadowRoot* root)\n{\n    if (!root->containsShadowRoots() && !root->containsContentElements())\n        return;\n\n    for (Element* element = ElementTraversal::firstWithin(root); element; element = ElementTraversal::next(element, root)) {\n        if (ElementShadow* shadow = element->shadow())\n            m_selectFeatures.add(shadow->ensureSelectFeatureSet());\n        if (!isHTMLContentElement(element))\n            continue;\n        const CSSSelectorList& list = toHTMLContentElement(element)->selectorList();\n        for (const CSSSelector* selector = list.first(); selector; selector = CSSSelectorList::next(selector)) {\n            for (const CSSSelector* component = selector; component; component = component->tagHistory())\n                m_selectFeatures.collectFeaturesFromSelector(component);\n        }\n    }\n}\n\nvoid ElementShadow::didAffectSelector(AffectedSelectorMask mask)\n{\n    if (ensureSelectFeatureSet().hasSelectorFor(mask))\n        setNeedsDistributionRecalc();\n}\n\nvoid ElementShadow::willAffectSelector()\n{\n    for (ElementShadow* shadow = this; shadow; shadow = shadow->containingShadow()) {\n        if (shadow->needsSelectFeatureSet())\n            break;\n        shadow->setNeedsSelectFeatureSet();\n    }\n    setNeedsDistributionRecalc();\n}\n\nvoid ElementShadow::clearDistribution()\n{\n    m_nodeToInsertionPoint.clear();\n\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot())\n        root->setInsertionPoint(0);\n}\n\n} \/\/ namespace\n<commit_msg>ElementShadow::detach does need to check confusingAndOftenMisusedAttached()<commit_after>\/*\n * Copyright (C) 2012 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 *     * 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 \"core\/dom\/shadow\/ElementShadow.h\"\n\n#include \"core\/dom\/ContainerNodeAlgorithms.h\"\n#include \"core\/dom\/ElementTraversal.h\"\n#include \"core\/dom\/NodeTraversal.h\"\n#include \"core\/dom\/shadow\/ContentDistribution.h\"\n#include \"core\/dom\/shadow\/InsertionPoint.h\"\n#include \"core\/dom\/shadow\/ShadowRoot.h\"\n#include \"core\/html\/shadow\/HTMLContentElement.h\"\n#include \"core\/html\/shadow\/HTMLShadowElement.h\"\n\nnamespace WebCore {\n\nclass DistributionPool {\npublic:\n    explicit DistributionPool(const ContainerNode*);\n    ~DistributionPool();\n    void distributeTo(InsertionPoint*, ElementShadow*);\n\nprivate:\n    void populateChildren(const ContainerNode*);\n    void detachNonDistributedNodes();\n    Vector<Node*> m_nodes;\n    Vector<bool> m_distributed;\n};\n\ninline DistributionPool::DistributionPool(const ContainerNode* parent)\n{\n    if (parent)\n        populateChildren(parent);\n}\n\ninline void DistributionPool::populateChildren(const ContainerNode* parent)\n{\n    m_nodes.reserveInitialCapacity(32);\n    for (Node* child = parent->firstChild(); child; child = child->nextSibling()) {\n        if (isActiveInsertionPoint(child)) {\n            InsertionPoint* insertionPoint = toInsertionPoint(child);\n            if (insertionPoint->hasDistribution()) {\n                for (size_t i = 0; i < insertionPoint->size(); ++i)\n                    m_nodes.append(insertionPoint->at(i));\n            } else {\n                \/\/ Fallback elements.\n                for (Node* fallbackNode = insertionPoint->firstChild(); fallbackNode; fallbackNode = fallbackNode->nextSibling())\n                    m_nodes.append(fallbackNode);\n            }\n        } else {\n            m_nodes.append(child);\n        }\n    }\n    m_distributed.resize(m_nodes.size());\n    m_distributed.fill(false);\n}\n\nvoid DistributionPool::distributeTo(InsertionPoint* insertionPoint, ElementShadow* elementShadow)\n{\n    ContentDistribution distribution;\n\n    for (size_t i = 0; i < m_nodes.size(); ++i) {\n        if (m_distributed[i])\n            continue;\n\n        if (isHTMLContentElement(insertionPoint) && !toHTMLContentElement(insertionPoint)->canSelectNode(m_nodes, i))\n            continue;\n\n        Node* node = m_nodes[i];\n        distribution.append(node);\n        elementShadow->didDistributeNode(node, insertionPoint);\n        m_distributed[i] = true;\n    }\n\n    insertionPoint->setDistribution(distribution);\n}\n\ninline DistributionPool::~DistributionPool()\n{\n    detachNonDistributedNodes();\n}\n\ninline void DistributionPool::detachNonDistributedNodes()\n{\n    for (size_t i = 0; i < m_nodes.size(); ++i) {\n        if (m_distributed[i])\n            continue;\n        if (m_nodes[i]->renderer())\n            m_nodes[i]->lazyReattachIfAttached();\n    }\n}\n\nPassOwnPtr<ElementShadow> ElementShadow::create()\n{\n    return adoptPtr(new ElementShadow());\n}\n\nElementShadow::ElementShadow()\n    : m_needsDistributionRecalc(false)\n    , m_applyAuthorStyles(false)\n    , m_needsSelectFeatureSet(false)\n{\n}\n\nElementShadow::~ElementShadow()\n{\n    removeAllShadowRoots();\n}\n\nShadowRoot* ElementShadow::addShadowRoot(Element& shadowHost, ShadowRoot::ShadowRootType type)\n{\n    RefPtr<ShadowRoot> shadowRoot = ShadowRoot::create(&shadowHost.document(), type);\n\n    shadowRoot->setParentOrShadowHostNode(&shadowHost);\n    shadowRoot->setParentTreeScope(&shadowHost.treeScope());\n    m_shadowRoots.push(shadowRoot.get());\n    ChildNodeInsertionNotifier(shadowHost).notify(*shadowRoot);\n    setNeedsDistributionRecalc();\n    shadowHost.lazyReattachIfAttached();\n\n    \/\/ addShadowRoot() affects apply-author-styles. However, we know that the youngest shadow root has not had any children yet.\n    \/\/ The youngest shadow root's apply-author-styles is default (false). So we can just set m_applyAuthorStyles false.\n    m_applyAuthorStyles = false;\n\n    shadowHost.didAddShadowRoot(*shadowRoot);\n    InspectorInstrumentation::didPushShadowRoot(&shadowHost, shadowRoot.get());\n\n    return shadowRoot.get();\n}\n\nvoid ElementShadow::removeAllShadowRoots()\n{\n    \/\/ Dont protect this ref count.\n    Element* shadowHost = host();\n    ASSERT(shadowHost);\n\n    while (RefPtr<ShadowRoot> oldRoot = m_shadowRoots.head()) {\n        InspectorInstrumentation::willPopShadowRoot(shadowHost, oldRoot.get());\n        shadowHost->document().removeFocusedElementOfSubtree(oldRoot.get());\n        m_shadowRoots.removeHead();\n        oldRoot->setParentOrShadowHostNode(0);\n        oldRoot->setParentTreeScope(&shadowHost->document());\n        oldRoot->setPrev(0);\n        oldRoot->setNext(0);\n        ChildNodeRemovalNotifier(*shadowHost).notify(*oldRoot);\n    }\n}\n\nvoid ElementShadow::attach(const Node::AttachContext& context)\n{\n    Node::AttachContext childrenContext(context);\n    childrenContext.resolvedStyle = 0;\n\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        if (root->needsAttach())\n            root->attach(childrenContext);\n    }\n}\n\nvoid ElementShadow::detach(const Node::AttachContext& context)\n{\n    Node::AttachContext childrenContext(context);\n    childrenContext.resolvedStyle = 0;\n\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot())\n        root->detach(childrenContext);\n}\n\nvoid ElementShadow::removeAllEventListeners()\n{\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        for (Node* node = root; node; node = NodeTraversal::next(node))\n            node->removeAllEventListeners();\n    }\n}\n\nvoid ElementShadow::setNeedsDistributionRecalc()\n{\n    if (m_needsDistributionRecalc)\n        return;\n    m_needsDistributionRecalc = true;\n    host()->markAncestorsWithChildNeedsDistributionRecalc();\n    clearDistribution();\n}\n\nbool ElementShadow::didAffectApplyAuthorStyles()\n{\n    bool applyAuthorStyles = resolveApplyAuthorStyles();\n\n    if (m_applyAuthorStyles == applyAuthorStyles)\n        return false;\n\n    m_applyAuthorStyles = applyAuthorStyles;\n    return true;\n}\n\nbool ElementShadow::containsActiveStyles() const\n{\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        if (root->hasScopedHTMLStyleChild())\n            return true;\n        if (!root->containsShadowElements())\n            return false;\n    }\n    return false;\n}\n\nbool ElementShadow::resolveApplyAuthorStyles() const\n{\n    for (const ShadowRoot* shadowRoot = youngestShadowRoot(); shadowRoot; shadowRoot = shadowRoot->olderShadowRoot()) {\n        if (shadowRoot->applyAuthorStyles())\n            return true;\n        if (!shadowRoot->containsShadowElements())\n            break;\n    }\n    return false;\n}\n\nInsertionPoint* ElementShadow::findInsertionPointFor(const Node* key) const\n{\n    return m_nodeToInsertionPoint.get(key);\n}\n\nvoid ElementShadow::distribute()\n{\n    DistributionPool pool(host());\n    host()->setNeedsStyleRecalc();\n\n    Vector<HTMLShadowElement*, 32> activeShadowInsertionPoints;\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {\n        HTMLShadowElement* firstActiveShadowInsertionPoint = 0;\n\n        const Vector<RefPtr<InsertionPoint> >& insertionPoints = root->childInsertionPoints();\n        for (size_t i = 0; i < insertionPoints.size(); ++i) {\n            InsertionPoint* point = insertionPoints[i].get();\n            if (!point->isActive())\n                continue;\n\n            if (isHTMLShadowElement(point)) {\n                if (!firstActiveShadowInsertionPoint)\n                    firstActiveShadowInsertionPoint = toHTMLShadowElement(point);\n            } else {\n                pool.distributeTo(point, this);\n                if (ElementShadow* shadow = shadowOfParentForDistribution(point))\n                    shadow->setNeedsDistributionRecalc();\n            }\n        }\n\n        if (firstActiveShadowInsertionPoint)\n            activeShadowInsertionPoints.append(firstActiveShadowInsertionPoint);\n    }\n\n    for (size_t i = activeShadowInsertionPoints.size(); i > 0; --i) {\n        HTMLShadowElement* shadowElement = activeShadowInsertionPoints[i - 1];\n        ShadowRoot* root = shadowElement->containingShadowRoot();\n        ASSERT(root);\n        if (root->olderShadowRoot() && root->olderShadowRoot()->type() == root->type()) {\n            \/\/ Only allow reprojecting older shadow roots between the same type to\n            \/\/ disallow reprojecting UA elements into author shadows.\n            distributeNodeChildrenTo(shadowElement, root->olderShadowRoot());\n            root->olderShadowRoot()->setInsertionPoint(shadowElement);\n        } else if (!root->olderShadowRoot()) {\n            \/\/ There's assumed to always be a UA shadow that selects all nodes.\n            \/\/ We don't actually add it, instead we just distribute the pool to the\n            \/\/ <shadow> in the oldest shadow root.\n            pool.distributeTo(shadowElement, this);\n        }\n        if (ElementShadow* shadow = shadowOfParentForDistribution(shadowElement))\n            shadow->setNeedsDistributionRecalc();\n    }\n}\n\nvoid ElementShadow::didDistributeNode(const Node* node, InsertionPoint* insertionPoint)\n{\n    m_nodeToInsertionPoint.add(node, insertionPoint);\n}\n\nvoid ElementShadow::distributeNodeChildrenTo(InsertionPoint* insertionPoint, ContainerNode* containerNode)\n{\n    DistributionPool pool(containerNode);\n    pool.distributeTo(insertionPoint, this);\n}\n\nconst SelectRuleFeatureSet& ElementShadow::ensureSelectFeatureSet()\n{\n    if (!m_needsSelectFeatureSet)\n        return m_selectFeatures;\n\n    m_selectFeatures.clear();\n    for (ShadowRoot* root = oldestShadowRoot(); root; root = root->youngerShadowRoot())\n        collectSelectFeatureSetFrom(root);\n    m_needsSelectFeatureSet = false;\n    return m_selectFeatures;\n}\n\nvoid ElementShadow::collectSelectFeatureSetFrom(ShadowRoot* root)\n{\n    if (!root->containsShadowRoots() && !root->containsContentElements())\n        return;\n\n    for (Element* element = ElementTraversal::firstWithin(root); element; element = ElementTraversal::next(element, root)) {\n        if (ElementShadow* shadow = element->shadow())\n            m_selectFeatures.add(shadow->ensureSelectFeatureSet());\n        if (!isHTMLContentElement(element))\n            continue;\n        const CSSSelectorList& list = toHTMLContentElement(element)->selectorList();\n        for (const CSSSelector* selector = list.first(); selector; selector = CSSSelectorList::next(selector)) {\n            for (const CSSSelector* component = selector; component; component = component->tagHistory())\n                m_selectFeatures.collectFeaturesFromSelector(component);\n        }\n    }\n}\n\nvoid ElementShadow::didAffectSelector(AffectedSelectorMask mask)\n{\n    if (ensureSelectFeatureSet().hasSelectorFor(mask))\n        setNeedsDistributionRecalc();\n}\n\nvoid ElementShadow::willAffectSelector()\n{\n    for (ElementShadow* shadow = this; shadow; shadow = shadow->containingShadow()) {\n        if (shadow->needsSelectFeatureSet())\n            break;\n        shadow->setNeedsSelectFeatureSet();\n    }\n    setNeedsDistributionRecalc();\n}\n\nvoid ElementShadow::clearDistribution()\n{\n    m_nodeToInsertionPoint.clear();\n\n    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot())\n        root->setInsertionPoint(0);\n}\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\n OpenLieroX\n \n hide and seek gamemode\n \n created 2009-02-09\n code under LGPL\n *\/\n\n#include <iostream>\n#include \"CHideAndSeek.h\"\n#include \"CWorm.h\"\n#include \"Options.h\"\n#include \"Consts.h\"\n#include \"CServer.h\"\n#include \"CClient.h\"\n#include \"CServerConnection.h\"\n#include \"CServerNetEngine.h\"\n#include \"CMap.h\"\n#include \"LieroX.h\"\n\nconst char * CHideAndSeek::GAMEMODE_NAME = \"Hide and Seek\";\n\nCHideAndSeek::CHideAndSeek(GameServer* server, CWorm* worms)\n{\n\tcServer = server;\n\tcWorms = worms;\n}\n\nCHideAndSeek::~CHideAndSeek()\n{\n}\n\nvoid CHideAndSeek::PrepareGame()\n{\n\tfGameStart = tLX->fCurTime;\n\tGenerateTimes();\n\tif(tLXOptions->tGameInfo.fTimeLimit > 0)\n\t\tfGameLength = tLXOptions->tGameInfo.fTimeLimit * 60;\n\tfor(int i = 0; i < MAX_WORMS; i++) {\n\t\tfLastAlert[i] = 0;\n\t\t\/\/ TODO: Maybe we need bVisible[i] = false and no hiding because it is done in CHideAndSeek::Spawn\n\t\tbVisible[i] = true; \/\/ So we can hide\n\t\tHide(&cWorms[i], false);\n\t\tfWarmupTime[i] = tLX->fCurTime - fGameStart + (float)tLXOptions->tGameInfo.features[FT_HS_HideTime];\n\t\t\/*\n\t\t\/\/ Set all the lives to 0\n\t\tcWorms[i].setLives(0);\n\t\tfor(int j = 0; j < MAX_WORMS; j++)\n\t\t\tif(i != j && cWorms[j].isUsed())\n\t\t\t\tcWorms[j].getClient()->getNetEngine()->SendWormScore(&cWorms[i]);\n\t\t*\/\n\t}\n}\n\nvoid CHideAndSeek::PrepareWorm(CWorm* worm)\n{\n\tstd::string teamhint[2];\n\tif (networkTexts->sHiderMessage != \"<none>\")\n\t\treplace(networkTexts->sHiderMessage, \"<time>\", itoa((int)fGameLength), teamhint[0]);\n\tif (networkTexts->sSeekerMessage != \"<none>\")\n\t\treplace(networkTexts->sSeekerMessage, \"<time>\", itoa((int)fGameLength), teamhint[1]);\n\n\t\/\/ Gameplay hints\n\tworm->getClient()->getNetEngine()->SendText(teamhint[worm->getTeam()], TXT_NORMAL);\n}\n\nbool CHideAndSeek::Spawn(CWorm* worm, CVec pos)\n{\n\tpos = cServer->FindSpot();\n\tworm->Spawn(pos);\n\tbVisible[worm->getID()] = false;\n\t\/\/ Worms only spawn visible to their own team\n\tfor(int i = 0; i < MAX_WORMS; i++)  {\n\t\tif(cWorms[i].isUsed() && cWorms[i].getTeam() == worm->getTeam())\n\t\t\tcWorms[i].getClient()->getNetEngine()->SendSpawnWorm(worm, pos);\n\t\telse if(cWorms[i].isUsed())\n\t\t\tcWorms[i].getClient()->getNetEngine()->SendHideWorm(worm);\n\t}\n\tfWarmupTime[worm->getID()] = tLX->fCurTime - fGameStart + (float)tLXOptions->tGameInfo.features[FT_HS_HideTime];\n\treturn false;\n}\n\nvoid CHideAndSeek::Kill(CWorm* victim, CWorm* killer)\n{\n\tif(killer->getTeam() == SEEKER && killer != victim) {\n\t\tif (networkTexts->sCaughtMessage != \"<none>\")  {\n\t\t\tstd::string msg;\n\t\t\treplace(networkTexts->sCaughtMessage, \"<seeker>\", killer->getName(), msg);\n\t\t\treplace(msg, \"<hider>\", victim->getName(), msg);\n\t\t\tcServer->SendGlobalText(msg, TXT_NORMAL);\n\t\t}\n\t\tkiller->AddKill();\n\t}\n\tvictim->Kill();\n\tbVisible[victim->getID()] = false;\n}\n\nbool CHideAndSeek::Shoot(CWorm* worm)\n{\n\treturn false;\n}\n\nvoid CHideAndSeek::Drop(CWorm* worm)\n{\n}\n\nvoid CHideAndSeek::Simulate()\n{\n\tfloat GameTime = tLX->fCurTime - fGameStart;\n\t\/\/ Game time up\n\tif(GameTime > fGameLength) {\n\t\tfor(int i = 0; i < MAX_WORMS; i++)\n\t\t\tif(cWorms[i].isUsed() && cWorms[i].getLives() != WRM_OUT) {\n\t\t\t\tif(cWorms[i].getTeam() == SEEKER)\n\t\t\t\t\tcServer->killWorm(i, i, cWorms[i].getLives() + 1);\n\t\t\t\telse\n\t\t\t\t\tShow(&cWorms[i], false); \/\/ People often want to see where the hiders were\n\t\t\t}\n\t\treturn;\n\t}\n\t\/\/ Hiders have some time free from being caught and seen\n\tif(GameTime < (float)tLXOptions->tGameInfo.features[FT_HS_HideTime])\n\t\treturn;\n\t\/\/ Check if any of the worms can see eachother\n\tint i, j;\n\tfor(i = 0; i < MAX_WORMS; i++) \n\t{\n\t\tif( !cWorms[i].isUsed() || cWorms[i].getLives() == WRM_OUT || !cWorms[i].getAlive() )\n\t\t\tcontinue;\n\t\t\/\/ Hide the worm if the alert time is up\n\t\tif(fLastAlert[i] + (float)tLXOptions->tGameInfo.features[FT_HS_AlertTime] < GameTime)\n\t\t\tHide(&cWorms[i]);\n\t\tfor(j = 0; j < MAX_WORMS; j++) \n\t\t{\n\t\t\tif( !cWorms[j].isUsed() || cWorms[j].getLives() == WRM_OUT || !cWorms[j].getAlive() )\n\t\t\t\tcontinue;\n\t\t\tif(cWorms[j].getTeam() == cWorms[i].getTeam())\n\t\t\t\tcontinue;\n\t\t\tif( fWarmupTime[j] > GameTime )\n\t\t\t\tcontinue;\n\n\t\t\tif(CanSee(&cWorms[i], &cWorms[j]))\n\t\t\t\tShow(&cWorms[j]);\n\t\t\t\/\/ Catch the hiders if they are within 10 pixels\n\t\t\tif(cWorms[i].getTeam() == SEEKER && cWorms[j].getTeam() == HIDER)\n\t\t\t\tif((cWorms[i].getPos() - cWorms[j].getPos()).GetLength() < 10)\n\t\t\t\t{\n\t\t\t\t\tint type;\n\t\t\t\t\tfloat length;\n\t\t\t\t\tcWorms[i].traceLine(cWorms[j].getPos(), &length, &type, 1);\n\t\t\t\t\tif( type & PX_EMPTY )\t\/\/ Do not touch through thin wall\n\t\t\t\t\t\tcServer->killWorm(cWorms[j].getID(), cWorms[i].getID(), 0);\n\t\t\t\t}\n\t\t}\n\t}\n}\n\nbool CHideAndSeek::CheckGameOver()\n{\n\tif(CGameMode::CheckGameOver()) return true;\n\n\tint worms[2] = { 0, 0 };\n\tint winners = -1;\n\tstatic const std::string teamname[2] = { \"hiding\", \"seeking\" };\n\n\tfor(int i = 0; i < MAX_WORMS; i++)\n\t\tif(cWorms[i].isUsed() && cWorms[i].getLives() != WRM_OUT)\n\t\t\tworms[cWorms[i].getTeam()]++;\n\tif(worms[0] == 0)\n\t\twinners = SEEKER;\n\telse if(worms[1] == 0)\n\t\twinners = HIDER;\n\tif(winners != -1) {\n\t\tif(networkTexts->sTeamHasWon != \"<none>\")\n\t\t\tcServer->SendGlobalText((replacemax(networkTexts->sTeamHasWon, \"<team>\",\n\t\t\t\tteamname[winners], 1)), TXT_NORMAL);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint CHideAndSeek::GameType()\n{\n\treturn GMT_TEAMS;\n}\n\nint CHideAndSeek::GameTeams()\n{\n\treturn 2;\n}\n\nint CHideAndSeek::Winner()\n{\n\t\/\/ TODO: nobody is the winner?\n\treturn -1;\n}\n\nbool CHideAndSeek::NeedUpdate(CServerConnection* cl, CWorm* worm)\n{\n\t\/\/ Clients don't recieve dirt updates without getting a full update\n\t\/\/ No worms, but we don't want the client to see nothing\n\tif(cl->getNumWorms() == 0)\n\t\treturn true;\n\n\t\/\/ Different teams, and invisible so no need I think\n\tif(cl->getWorm(0)->getTeam() != worm->getTeam() && !bVisible[worm->getID()] && !worm->getWormState()->bCarve)\n\t\treturn false;\n\n\treturn true;\n}\n\nvoid CHideAndSeek::Show(CWorm* worm, bool message)\n{\n\tfLastAlert[worm->getID()] = tLX->fCurTime - fGameStart;\n\tif(bVisible[worm->getID()])\n\t\treturn;\n\tbVisible[worm->getID()] = true;\n\n\tif(worm->getTeam() == HIDER && message)  {\n\t\tif (networkTexts->sHiderVisible != \"<none>\")\n\t\t\tworm->getClient()->getNetEngine()->SendText(networkTexts->sHiderVisible, TXT_NORMAL);\n\t}\n\t\/\/ Seekers will know they are seen with this here. This reduces the effectiveness of 'wall-vision'\n\t\/*else {\n\t\tif (networkTexts->sSeekerVisible != \"<none>\")\n\t\t\tworm->getClient()->getNetEngine()->SendText(networkTexts->sSeekerVisible, TXT_NORMAL);\n\t}*\/\n\n\tfor(int i = 0; i < MAX_WORMS; i++) {\n\t\tif(!cWorms[i].isUsed() || cWorms[i].getTeam() == worm->getTeam())\n\t\t\tcontinue;\n\t\tcWorms[i].getClient()->getNetEngine()->SendHideWorm(worm, true);\n\t\tif (networkTexts->sVisibleMessage != \"<none>\" && message)  {\n\t\t\tstd::string msg;\n\t\t\treplace(networkTexts->sVisibleMessage, \"<player>\", worm->getName(), msg);\n\t\t\tcWorms[i].getClient()->getNetEngine()->SendText(msg, TXT_NORMAL);\n\t\t}\n\t}\n}\n\nvoid CHideAndSeek::Hide(CWorm* worm, bool message)\n{\n\tif(!bVisible[worm->getID()])\n\t\treturn;\n\tbVisible[worm->getID()] = false;\n\n\t\/\/ Removed message for seekers because it is confusing since they don't get the \"you are visible\" one\n\tif(networkTexts->sYouAreHidden != \"<none>\" && message && worm->getTeam() == HIDER)\n\t\tworm->getClient()->getNetEngine()->SendText(networkTexts->sYouAreHidden, TXT_NORMAL);\n\tfor(int i = 0; i < MAX_WORMS; i++) {\n\t\tif(!cWorms[i].isUsed() || cWorms[i].getTeam() == worm->getTeam())\n\t\t\tcontinue;\n\t\tcWorms[i].getClient()->getNetEngine()->SendHideWorm(worm);\n\t\tif(networkTexts->sHiddenMessage != \"<none>\" && message) {\n\t\t\tstd::string msg;\n\t\t\treplace(networkTexts->sHiddenMessage, \"<player>\", worm->getName(), msg);\n\t\t\tcWorms[i].getClient()->getNetEngine()->SendText(msg, TXT_NORMAL);\n\t\t}\n\t}\n}\n\nbool CHideAndSeek::CanSee(CWorm* worm1, CWorm* worm2)\n{\n\tCVec dist;\n\tdist = worm1->getPos() - worm2->getPos();\n\tif(worm1->getTeam() == SEEKER)\n\t{\n\t\tif( dist.GetLength() < (int)tLXOptions->tGameInfo.features[FT_HS_SeekerVisionRangeThroughWalls] )\n\t\t\treturn true;\n\t\tif( dist.GetLength() < (int)tLXOptions->tGameInfo.features[FT_HS_SeekerVisionRange] )\n\t\t{\n\t\t\tint type;\n\t\t\tfloat length;\n\t\t\tworm1->traceLine(worm2->getPos(), &length, &type, 1);\n\t\t\tif( !( type & PX_EMPTY ) )\n\t\t\t\treturn false;\n\t\t\t\t\n\t\t\tfloat angle = worm1->getAngle();\n\t\t\tif(worm1->getDirection() == DIR_LEFT)\n\t\t\t\tangle = 180.0f - angle;\n\t\t\t\t\n\t\t\twhile( angle > 180.0f )\t\/\/ Normalize it between 180 and -180\n\t\t\t\tangle -= 360.0f;\n\t\t\t\n\t\t\tfloat wormAngle = VectorAngle( worm2->getPos(), worm1->getPos() ) * 180.0f \/ PI;\n\t\t\t\n\t\t\tfloat angleDiff = angle - wormAngle;\n\t\t\t\n\t\t\twhile( angleDiff > 180.0f ) \/\/ Normalize it\n\t\t\t\tangleDiff -= 360.0f;\n\t\t\twhile( angleDiff < -180.0f )\n\t\t\t\tangleDiff += 360.0f;\n\t\t\t\n\t\t\treturn (int)fabs(angleDiff*2.0f) < (int)tLXOptions->tGameInfo.features[FT_HS_SeekerVisionAngle];\n\t\t}\n\t\treturn false;\n\t}\n\telse \n\t{\n\t\tif( dist.GetLength() < (int)tLXOptions->tGameInfo.features[FT_HS_HiderVisionRangeThroughWalls] )\n\t\t\treturn true;\n\t\tif( dist.GetLength() < (int)tLXOptions->tGameInfo.features[FT_HS_HiderVisionRange] )\n\t\t{\n\t\t\tint type;\n\t\t\tfloat length;\n\t\t\tworm1->traceLine(worm2->getPos(), &length, &type, 1);\n\t\t\tif(type & PX_EMPTY)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n}\n\nvoid CHideAndSeek::GenerateTimes()\n{\n\tCMap* cMap = cServer->getMap();\n\tint volume = cMap->GetWidth() * cMap->GetHeight();\n\tenum { SMALL = 1, MEDIUM, LARGE, XLARGE } size;\n\t\/\/ Decide on the level size\n\tif(volume < 500 * 400)\n\t\tsize = SMALL;\n\telse if(volume < 700 * 600)\n\t\tsize = MEDIUM;\n\telse if(volume < 900 * 800)\n\t\tsize = LARGE;\n\telse\n\t\tsize = XLARGE;\n\t\/\/ Calculate the ratio of hiders to seekers\n\tfloat ratio = 1.0f;\n\tint worms[2] = { 0, 0 };\n\tfor(int i = 0; i < MAX_WORMS; i++)\n\t\tif(cWorms[i].isUsed())\n\t\t\tworms[cWorms[i].getTeam()]++;\n\tif(worms[0] != 0 && worms[1] != 0)\n\t\tratio = (float)worms[0] \/ worms[1];\n\n\t\/\/ TODO: Is this actually any good? \n\tfGameLength = (45 * size * ratio);\n}\n\n<commit_msg>Fixed MSVC warning<commit_after>\/*\n OpenLieroX\n \n hide and seek gamemode\n \n created 2009-02-09\n code under LGPL\n *\/\n\n#include <iostream>\n#include \"CHideAndSeek.h\"\n#include \"CWorm.h\"\n#include \"Options.h\"\n#include \"Consts.h\"\n#include \"CServer.h\"\n#include \"CClient.h\"\n#include \"CServerConnection.h\"\n#include \"CServerNetEngine.h\"\n#include \"CMap.h\"\n#include \"LieroX.h\"\n\nconst char * CHideAndSeek::GAMEMODE_NAME = \"Hide and Seek\";\n\nCHideAndSeek::CHideAndSeek(GameServer* server, CWorm* worms)\n{\n\tcServer = server;\n\tcWorms = worms;\n}\n\nCHideAndSeek::~CHideAndSeek()\n{\n}\n\nvoid CHideAndSeek::PrepareGame()\n{\n\tfGameStart = tLX->fCurTime;\n\tGenerateTimes();\n\tif(tLXOptions->tGameInfo.fTimeLimit > 0)\n\t\tfGameLength = tLXOptions->tGameInfo.fTimeLimit * 60;\n\tfor(int i = 0; i < MAX_WORMS; i++) {\n\t\tfLastAlert[i] = 0;\n\t\t\/\/ TODO: Maybe we need bVisible[i] = false and no hiding because it is done in CHideAndSeek::Spawn\n\t\tbVisible[i] = true; \/\/ So we can hide\n\t\tHide(&cWorms[i], false);\n\t\tfWarmupTime[i] = tLX->fCurTime - fGameStart + (float)tLXOptions->tGameInfo.features[FT_HS_HideTime];\n\t\t\/*\n\t\t\/\/ Set all the lives to 0\n\t\tcWorms[i].setLives(0);\n\t\tfor(int j = 0; j < MAX_WORMS; j++)\n\t\t\tif(i != j && cWorms[j].isUsed())\n\t\t\t\tcWorms[j].getClient()->getNetEngine()->SendWormScore(&cWorms[i]);\n\t\t*\/\n\t}\n}\n\nvoid CHideAndSeek::PrepareWorm(CWorm* worm)\n{\n\tstd::string teamhint[2];\n\tif (networkTexts->sHiderMessage != \"<none>\")\n\t\treplace(networkTexts->sHiderMessage, \"<time>\", itoa((int)fGameLength), teamhint[0]);\n\tif (networkTexts->sSeekerMessage != \"<none>\")\n\t\treplace(networkTexts->sSeekerMessage, \"<time>\", itoa((int)fGameLength), teamhint[1]);\n\n\t\/\/ Gameplay hints\n\tworm->getClient()->getNetEngine()->SendText(teamhint[worm->getTeam()], TXT_NORMAL);\n}\n\nbool CHideAndSeek::Spawn(CWorm* worm, CVec pos)\n{\n\tpos = cServer->FindSpot();\n\tworm->Spawn(pos);\n\tbVisible[worm->getID()] = false;\n\t\/\/ Worms only spawn visible to their own team\n\tfor(int i = 0; i < MAX_WORMS; i++)  {\n\t\tif(cWorms[i].isUsed() && cWorms[i].getTeam() == worm->getTeam())\n\t\t\tcWorms[i].getClient()->getNetEngine()->SendSpawnWorm(worm, pos);\n\t\telse if(cWorms[i].isUsed())\n\t\t\tcWorms[i].getClient()->getNetEngine()->SendHideWorm(worm);\n\t}\n\tfWarmupTime[worm->getID()] = tLX->fCurTime - fGameStart + (float)tLXOptions->tGameInfo.features[FT_HS_HideTime];\n\treturn false;\n}\n\nvoid CHideAndSeek::Kill(CWorm* victim, CWorm* killer)\n{\n\tif(killer->getTeam() == SEEKER && killer != victim) {\n\t\tif (networkTexts->sCaughtMessage != \"<none>\")  {\n\t\t\tstd::string msg;\n\t\t\treplace(networkTexts->sCaughtMessage, \"<seeker>\", killer->getName(), msg);\n\t\t\treplace(msg, \"<hider>\", victim->getName(), msg);\n\t\t\tcServer->SendGlobalText(msg, TXT_NORMAL);\n\t\t}\n\t\tkiller->AddKill();\n\t}\n\tvictim->Kill();\n\tbVisible[victim->getID()] = false;\n}\n\nbool CHideAndSeek::Shoot(CWorm* worm)\n{\n\treturn false;\n}\n\nvoid CHideAndSeek::Drop(CWorm* worm)\n{\n}\n\nvoid CHideAndSeek::Simulate()\n{\n\tfloat GameTime = tLX->fCurTime - fGameStart;\n\t\/\/ Game time up\n\tif(GameTime > fGameLength) {\n\t\tfor(int i = 0; i < MAX_WORMS; i++)\n\t\t\tif(cWorms[i].isUsed() && cWorms[i].getLives() != WRM_OUT) {\n\t\t\t\tif(cWorms[i].getTeam() == SEEKER)\n\t\t\t\t\tcServer->killWorm(i, i, cWorms[i].getLives() + 1);\n\t\t\t\telse\n\t\t\t\t\tShow(&cWorms[i], false); \/\/ People often want to see where the hiders were\n\t\t\t}\n\t\treturn;\n\t}\n\t\/\/ Hiders have some time free from being caught and seen\n\tif(GameTime < (float)tLXOptions->tGameInfo.features[FT_HS_HideTime])\n\t\treturn;\n\t\/\/ Check if any of the worms can see eachother\n\tint i, j;\n\tfor(i = 0; i < MAX_WORMS; i++) \n\t{\n\t\tif( !cWorms[i].isUsed() || cWorms[i].getLives() == WRM_OUT || !cWorms[i].getAlive() )\n\t\t\tcontinue;\n\t\t\/\/ Hide the worm if the alert time is up\n\t\tif(fLastAlert[i] + (float)tLXOptions->tGameInfo.features[FT_HS_AlertTime] < GameTime)\n\t\t\tHide(&cWorms[i]);\n\t\tfor(j = 0; j < MAX_WORMS; j++) \n\t\t{\n\t\t\tif( !cWorms[j].isUsed() || cWorms[j].getLives() == WRM_OUT || !cWorms[j].getAlive() )\n\t\t\t\tcontinue;\n\t\t\tif(cWorms[j].getTeam() == cWorms[i].getTeam())\n\t\t\t\tcontinue;\n\t\t\tif( fWarmupTime[j] > GameTime )\n\t\t\t\tcontinue;\n\n\t\t\tif(CanSee(&cWorms[i], &cWorms[j]))\n\t\t\t\tShow(&cWorms[j]);\n\t\t\t\/\/ Catch the hiders if they are within 10 pixels\n\t\t\tif(cWorms[i].getTeam() == SEEKER && cWorms[j].getTeam() == HIDER)\n\t\t\t\tif((cWorms[i].getPos() - cWorms[j].getPos()).GetLength() < 10)\n\t\t\t\t{\n\t\t\t\t\tint type;\n\t\t\t\t\tfloat length;\n\t\t\t\t\tcWorms[i].traceLine(cWorms[j].getPos(), &length, &type, 1);\n\t\t\t\t\tif( type & PX_EMPTY )\t\/\/ Do not touch through thin wall\n\t\t\t\t\t\tcServer->killWorm(cWorms[j].getID(), cWorms[i].getID(), 0);\n\t\t\t\t}\n\t\t}\n\t}\n}\n\nbool CHideAndSeek::CheckGameOver()\n{\n\tif(CGameMode::CheckGameOver()) return true;\n\n\tint worms[2] = { 0, 0 };\n\tint winners = -1;\n\tstatic const std::string teamname[2] = { \"hiding\", \"seeking\" };\n\n\tfor(int i = 0; i < MAX_WORMS; i++)\n\t\tif(cWorms[i].isUsed() && cWorms[i].getLives() != WRM_OUT)\n\t\t\tworms[cWorms[i].getTeam()]++;\n\tif(worms[0] == 0)\n\t\twinners = SEEKER;\n\telse if(worms[1] == 0)\n\t\twinners = HIDER;\n\tif(winners != -1) {\n\t\tif(networkTexts->sTeamHasWon != \"<none>\")\n\t\t\tcServer->SendGlobalText((replacemax(networkTexts->sTeamHasWon, \"<team>\",\n\t\t\t\tteamname[winners], 1)), TXT_NORMAL);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint CHideAndSeek::GameType()\n{\n\treturn GMT_TEAMS;\n}\n\nint CHideAndSeek::GameTeams()\n{\n\treturn 2;\n}\n\nint CHideAndSeek::Winner()\n{\n\t\/\/ TODO: nobody is the winner?\n\treturn -1;\n}\n\nbool CHideAndSeek::NeedUpdate(CServerConnection* cl, CWorm* worm)\n{\n\t\/\/ Clients don't recieve dirt updates without getting a full update\n\t\/\/ No worms, but we don't want the client to see nothing\n\tif(cl->getNumWorms() == 0)\n\t\treturn true;\n\n\t\/\/ Different teams, and invisible so no need I think\n\tif(cl->getWorm(0)->getTeam() != worm->getTeam() && !bVisible[worm->getID()] && !worm->getWormState()->bCarve)\n\t\treturn false;\n\n\treturn true;\n}\n\nvoid CHideAndSeek::Show(CWorm* worm, bool message)\n{\n\tfLastAlert[worm->getID()] = tLX->fCurTime - fGameStart;\n\tif(bVisible[worm->getID()])\n\t\treturn;\n\tbVisible[worm->getID()] = true;\n\n\tif(worm->getTeam() == HIDER && message)  {\n\t\tif (networkTexts->sHiderVisible != \"<none>\")\n\t\t\tworm->getClient()->getNetEngine()->SendText(networkTexts->sHiderVisible, TXT_NORMAL);\n\t}\n\t\/\/ Seekers will know they are seen with this here. This reduces the effectiveness of 'wall-vision'\n\t\/*else {\n\t\tif (networkTexts->sSeekerVisible != \"<none>\")\n\t\t\tworm->getClient()->getNetEngine()->SendText(networkTexts->sSeekerVisible, TXT_NORMAL);\n\t}*\/\n\n\tfor(int i = 0; i < MAX_WORMS; i++) {\n\t\tif(!cWorms[i].isUsed() || cWorms[i].getTeam() == worm->getTeam())\n\t\t\tcontinue;\n\t\tcWorms[i].getClient()->getNetEngine()->SendHideWorm(worm, true);\n\t\tif (networkTexts->sVisibleMessage != \"<none>\" && message)  {\n\t\t\tstd::string msg;\n\t\t\treplace(networkTexts->sVisibleMessage, \"<player>\", worm->getName(), msg);\n\t\t\tcWorms[i].getClient()->getNetEngine()->SendText(msg, TXT_NORMAL);\n\t\t}\n\t}\n}\n\nvoid CHideAndSeek::Hide(CWorm* worm, bool message)\n{\n\tif(!bVisible[worm->getID()])\n\t\treturn;\n\tbVisible[worm->getID()] = false;\n\n\t\/\/ Removed message for seekers because it is confusing since they don't get the \"you are visible\" one\n\tif(networkTexts->sYouAreHidden != \"<none>\" && message && worm->getTeam() == HIDER)\n\t\tworm->getClient()->getNetEngine()->SendText(networkTexts->sYouAreHidden, TXT_NORMAL);\n\tfor(int i = 0; i < MAX_WORMS; i++) {\n\t\tif(!cWorms[i].isUsed() || cWorms[i].getTeam() == worm->getTeam())\n\t\t\tcontinue;\n\t\tcWorms[i].getClient()->getNetEngine()->SendHideWorm(worm);\n\t\tif(networkTexts->sHiddenMessage != \"<none>\" && message) {\n\t\t\tstd::string msg;\n\t\t\treplace(networkTexts->sHiddenMessage, \"<player>\", worm->getName(), msg);\n\t\t\tcWorms[i].getClient()->getNetEngine()->SendText(msg, TXT_NORMAL);\n\t\t}\n\t}\n}\n\nbool CHideAndSeek::CanSee(CWorm* worm1, CWorm* worm2)\n{\n\tCVec dist;\n\tdist = worm1->getPos() - worm2->getPos();\n\tif(worm1->getTeam() == SEEKER)\n\t{\n\t\tif( dist.GetLength() < (int)tLXOptions->tGameInfo.features[FT_HS_SeekerVisionRangeThroughWalls] )\n\t\t\treturn true;\n\t\tif( dist.GetLength() < (int)tLXOptions->tGameInfo.features[FT_HS_SeekerVisionRange] )\n\t\t{\n\t\t\tint type;\n\t\t\tfloat length;\n\t\t\tworm1->traceLine(worm2->getPos(), &length, &type, 1);\n\t\t\tif( !( type & PX_EMPTY ) )\n\t\t\t\treturn false;\n\t\t\t\t\n\t\t\tfloat angle = worm1->getAngle();\n\t\t\tif(worm1->getDirection() == DIR_LEFT)\n\t\t\t\tangle = 180.0f - angle;\n\t\t\t\t\n\t\t\twhile( angle > 180.0f )\t\/\/ Normalize it between 180 and -180\n\t\t\t\tangle -= 360.0f;\n\t\t\t\n\t\t\tfloat wormAngle = VectorAngle( worm2->getPos(), worm1->getPos() ) * 180.0f \/ (float)PI;\n\t\t\t\n\t\t\tfloat angleDiff = angle - wormAngle;\n\t\t\t\n\t\t\twhile( angleDiff > 180.0f ) \/\/ Normalize it\n\t\t\t\tangleDiff -= 360.0f;\n\t\t\twhile( angleDiff < -180.0f )\n\t\t\t\tangleDiff += 360.0f;\n\t\t\t\n\t\t\treturn (int)fabs(angleDiff*2.0f) < (int)tLXOptions->tGameInfo.features[FT_HS_SeekerVisionAngle];\n\t\t}\n\t\treturn false;\n\t}\n\telse \n\t{\n\t\tif( dist.GetLength() < (int)tLXOptions->tGameInfo.features[FT_HS_HiderVisionRangeThroughWalls] )\n\t\t\treturn true;\n\t\tif( dist.GetLength() < (int)tLXOptions->tGameInfo.features[FT_HS_HiderVisionRange] )\n\t\t{\n\t\t\tint type;\n\t\t\tfloat length;\n\t\t\tworm1->traceLine(worm2->getPos(), &length, &type, 1);\n\t\t\tif(type & PX_EMPTY)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n}\n\nvoid CHideAndSeek::GenerateTimes()\n{\n\tCMap* cMap = cServer->getMap();\n\tint volume = cMap->GetWidth() * cMap->GetHeight();\n\tenum { SMALL = 1, MEDIUM, LARGE, XLARGE } size;\n\t\/\/ Decide on the level size\n\tif(volume < 500 * 400)\n\t\tsize = SMALL;\n\telse if(volume < 700 * 600)\n\t\tsize = MEDIUM;\n\telse if(volume < 900 * 800)\n\t\tsize = LARGE;\n\telse\n\t\tsize = XLARGE;\n\t\/\/ Calculate the ratio of hiders to seekers\n\tfloat ratio = 1.0f;\n\tint worms[2] = { 0, 0 };\n\tfor(int i = 0; i < MAX_WORMS; i++)\n\t\tif(cWorms[i].isUsed())\n\t\t\tworms[cWorms[i].getTeam()]++;\n\tif(worms[0] != 0 && worms[1] != 0)\n\t\tratio = (float)worms[0] \/ worms[1];\n\n\t\/\/ TODO: Is this actually any good? \n\tfGameLength = (45 * size * ratio);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015-2018 Dubalu LLC. 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#include \"binary_server.h\"\n\n#ifdef XAPIAND_CLUSTERING\n\n#include <errno.h>                          \/\/ for errno\n#include <sysexits.h>                       \/\/ for EX_SOFTWARE\n\n#include \"binary.h\"                         \/\/ for Binary\n#include \"binary_client.h\"                  \/\/ for BinaryClient\n#include \"cassert.h\"                        \/\/ for ASSERT\n#include \"endpoint.h\"                       \/\/ for Endpoints\n#include \"error.hh\"                         \/\/ for error:name, error::description\n#include \"fs.hh\"                            \/\/ for exists\n#include \"ignore_unused.h\"                  \/\/ for ignore_unused\n#include \"manager.h\"                        \/\/ for XapiandManager::manager\n#include \"readable_revents.hh\"              \/\/ for readable_revents\n#include \"repr.hh\"                          \/\/ for repr\n#include \"tcp.h\"                            \/\/ for TCP::socket\n\n\n\/\/ #undef L_DEBUG\n\/\/ #define L_DEBUG L_GREY\n\/\/ #undef L_CALL\n\/\/ #define L_CALL L_STACKED_DIM_GREY\n\/\/ #undef L_EV\n\/\/ #define L_EV L_MEDIUM_PURPLE\n\n\nBinaryServer::BinaryServer(const std::shared_ptr<Worker>& parent_, ev::loop_ref* ev_loop_, unsigned int ev_flags_, const std::shared_ptr<Binary>& binary)\n\t: BaseServer<BinaryServer>(parent_, ev_loop_, ev_flags_, binary->port, \"Binary\", TCP_TCP_NODELAY | TCP_SO_REUSEPORT),\n\t  binary(binary),\n\t  process_tasks_async(*ev_loop)\n{\n\tprocess_tasks_async.set<BinaryServer, &BinaryServer::process_tasks_async_cb>(this);\n\tprocess_tasks_async.start();\n\tL_EV(\"Start binary's async signal event\");\n}\n\n\nBinaryServer::~BinaryServer()\n{\n\tWorker::deinit();\n}\n\n\nvoid\nBinaryServer::start_impl()\n{\n\tL_CALL(\"BinaryServer::start_impl()\");\n\n\tWorker::start_impl();\n\n#if defined(__linux) || defined(__linux__) || defined(linux) || defined(SO_REUSEPORT_LB)\n\t\/\/ In Linux, accept(2) on sockets using SO_REUSEPORT do a load balancing\n\t\/\/ of the incoming clients. It's not the case in other systems; FreeBSD is\n\t\/\/ adding SO_REUSEPORT_LB for that.\n\tbinary->close(true);\n\tbind(1);\n\tio.start(sock, ev::READ);\n\tL_EV(\"Start binary's server accept event (sock=%d)\", sock);\n#else\n\tio.start(binary->sock, ev::READ);\n\tL_EV(\"Start binary's server accept event (sock=%d)\", binary->sock);\n#endif\n}\n\n\nvoid\nBinaryServer::process_tasks()\n{\n\tL_CALL(\"BinaryServer::process_tasks()\");\n\n\tprocess_tasks_async.send();\n}\n\n\nvoid\nBinaryServer::process_tasks_async_cb(ev::async&, int revents)\n{\n\tL_CALL(\"BinaryServer::process_tasks_async_cb(<watcher>, 0x%x (%s))\", revents, readable_revents(revents));\n\n\tL_EV_BEGIN(\"BinaryServer::process_tasks_async_cb:BEGIN\");\n\tL_EV_END(\"BinaryServer::process_tasks_async_cb:END\");\n\n\tignore_unused(revents);\n\n\twhile (binary->tasks.call(share_this<BinaryServer>())) {};\n}\n\n\nint\nBinaryServer::accept()\n{\n\tL_CALL(\"BinaryServer::accept()\");\n\n\tif (sock != -1) {\n\t\t\/\/ If using SO_REUSEPORT for load balancing, this->sock\n\t\t\/\/ will be opened and binary->sock will not.\n\t\treturn TCP::accept();\n\t}\n\treturn binary->accept();\n}\n\n\nvoid\nBinaryServer::io_accept_cb(ev::io& watcher, int revents)\n{\n\tL_CALL(\"BinaryServer::io_accept_cb(<watcher>, 0x%x (%s)) {sock:%d}\", revents, readable_revents(revents), watcher.fd);\n\n\tL_EV_BEGIN(\"BinaryServer::io_accept_cb:BEGIN\");\n\tL_EV_END(\"BinaryServer::io_accept_cb:END\");\n\n\tignore_unused(watcher);\n\tASSERT(sock == -1 || sock == watcher.fd);\n\n\tL_DEBUG_HOOK(\"BinaryServer::io_accept_cb\", \"BinaryServer::io_accept_cb(<watcher>, 0x%x (%s)) {sock:%d}\", revents, readable_revents(revents), watcher.fd);\n\n\tif (EV_ERROR & revents) {\n\t\tL_EV(\"ERROR: got invalid binary event {sock:%d}: %s\", watcher.fd, error::name(errno), errno, error::description(errno));\n\t\treturn;\n\t}\n\n\tint client_sock = accept();\n\tif (client_sock == -1) {\n\t\tif (!io::ignored_errno(errno, true, true, false)) {\n\t\t\tL_ERR(\"ERROR: accept binary error {sock:%d}: %s (%d): %s\", watcher.fd, error::name(errno), errno, error::description(errno));\n\t\t}\n\t} else {\n\t\tauto client = Worker::make_shared<BinaryClient>(share_this<BinaryServer>(), ev_loop, ev_flags, client_sock, active_timeout, idle_timeout);\n\t\tif (!client->init_remote()) {\n\t\t\tclient->destroy();\n\t\t}\n\t}\n}\n\n\nvoid\nBinaryServer::trigger_replication(const Endpoint& src_endpoint, const Endpoint& dst_endpoint, bool cluster_database)\n{\n\tif (src_endpoint.is_local()) {\n\t\tASSERT(!cluster_database);\n\t\treturn;\n\t}\n\n\tbool replicated = false;\n\n\tif (src_endpoint.path == \".\") {\n\t\t\/\/ Cluster database is always updated\n\t\treplicated = true;\n\t}\n\n\tif (!replicated && exists(std::string(src_endpoint.path) + \"\/iamglass\")) {\n\t\t\/\/ If database is already there, its also always updated\n\t\treplicated = true;\n\t}\n\n\tif (!replicated) {\n\t\t\/\/ Otherwise, check if the local node resolves as replicator\n\t\tauto local_node = Node::local_node();\n\t\tauto nodes = XapiandManager::manager->resolve_index_nodes(src_endpoint.path);\n\t\tfor (const auto& node : nodes) {\n\t\t\tif (Node::is_equal(node, local_node)) {\n\t\t\t\treplicated = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!replicated) {\n\t\tASSERT(!cluster_database);\n\t\treturn;\n\t}\n\n\tint client_sock = TCP::socket();\n\tif (client_sock < 0) {\n\t\tif (cluster_database) {\n\t\t\tL_CRIT(\"Cannot replicate cluster database\");\n\t\t\tsig_exit(-EX_SOFTWARE);\n\t\t}\n\t\treturn;\n\t}\n\n\tauto client = Worker::make_shared<BinaryClient>(share_this<BinaryServer>(), ev_loop, ev_flags, client_sock, active_timeout, idle_timeout, cluster_database);\n\n\tif (!client->init_replication(src_endpoint, dst_endpoint)) {\n\t\tclient->destroy();\n\t\treturn;\n\t}\n\n\tL_INFO(\"Database %s being synchronized from %s...\", repr(src_endpoint.to_string()), src_endpoint.node_name);\n}\n\n#endif \/* XAPIAND_CLUSTERING *\/\n<commit_msg>BinaryServer: Colorized \"Synchronizing database\" message<commit_after>\/*\n * Copyright (C) 2015-2018 Dubalu LLC. 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#include \"binary_server.h\"\n\n#ifdef XAPIAND_CLUSTERING\n\n#include <errno.h>                          \/\/ for errno\n#include <sysexits.h>                       \/\/ for EX_SOFTWARE\n\n#include \"binary.h\"                         \/\/ for Binary\n#include \"binary_client.h\"                  \/\/ for BinaryClient\n#include \"cassert.h\"                        \/\/ for ASSERT\n#include \"endpoint.h\"                       \/\/ for Endpoints\n#include \"error.hh\"                         \/\/ for error:name, error::description\n#include \"fs.hh\"                            \/\/ for exists\n#include \"ignore_unused.h\"                  \/\/ for ignore_unused\n#include \"manager.h\"                        \/\/ for XapiandManager::manager\n#include \"readable_revents.hh\"              \/\/ for readable_revents\n#include \"repr.hh\"                          \/\/ for repr\n#include \"tcp.h\"                            \/\/ for TCP::socket\n\n\n\/\/ #undef L_DEBUG\n\/\/ #define L_DEBUG L_GREY\n\/\/ #undef L_CALL\n\/\/ #define L_CALL L_STACKED_DIM_GREY\n\/\/ #undef L_EV\n\/\/ #define L_EV L_MEDIUM_PURPLE\n\n\nBinaryServer::BinaryServer(const std::shared_ptr<Worker>& parent_, ev::loop_ref* ev_loop_, unsigned int ev_flags_, const std::shared_ptr<Binary>& binary)\n\t: BaseServer<BinaryServer>(parent_, ev_loop_, ev_flags_, binary->port, \"Binary\", TCP_TCP_NODELAY | TCP_SO_REUSEPORT),\n\t  binary(binary),\n\t  process_tasks_async(*ev_loop)\n{\n\tprocess_tasks_async.set<BinaryServer, &BinaryServer::process_tasks_async_cb>(this);\n\tprocess_tasks_async.start();\n\tL_EV(\"Start binary's async signal event\");\n}\n\n\nBinaryServer::~BinaryServer()\n{\n\tWorker::deinit();\n}\n\n\nvoid\nBinaryServer::start_impl()\n{\n\tL_CALL(\"BinaryServer::start_impl()\");\n\n\tWorker::start_impl();\n\n#if defined(__linux) || defined(__linux__) || defined(linux) || defined(SO_REUSEPORT_LB)\n\t\/\/ In Linux, accept(2) on sockets using SO_REUSEPORT do a load balancing\n\t\/\/ of the incoming clients. It's not the case in other systems; FreeBSD is\n\t\/\/ adding SO_REUSEPORT_LB for that.\n\tbinary->close(true);\n\tbind(1);\n\tio.start(sock, ev::READ);\n\tL_EV(\"Start binary's server accept event (sock=%d)\", sock);\n#else\n\tio.start(binary->sock, ev::READ);\n\tL_EV(\"Start binary's server accept event (sock=%d)\", binary->sock);\n#endif\n}\n\n\nvoid\nBinaryServer::process_tasks()\n{\n\tL_CALL(\"BinaryServer::process_tasks()\");\n\n\tprocess_tasks_async.send();\n}\n\n\nvoid\nBinaryServer::process_tasks_async_cb(ev::async&, int revents)\n{\n\tL_CALL(\"BinaryServer::process_tasks_async_cb(<watcher>, 0x%x (%s))\", revents, readable_revents(revents));\n\n\tL_EV_BEGIN(\"BinaryServer::process_tasks_async_cb:BEGIN\");\n\tL_EV_END(\"BinaryServer::process_tasks_async_cb:END\");\n\n\tignore_unused(revents);\n\n\twhile (binary->tasks.call(share_this<BinaryServer>())) {};\n}\n\n\nint\nBinaryServer::accept()\n{\n\tL_CALL(\"BinaryServer::accept()\");\n\n\tif (sock != -1) {\n\t\t\/\/ If using SO_REUSEPORT for load balancing, this->sock\n\t\t\/\/ will be opened and binary->sock will not.\n\t\treturn TCP::accept();\n\t}\n\treturn binary->accept();\n}\n\n\nvoid\nBinaryServer::io_accept_cb(ev::io& watcher, int revents)\n{\n\tL_CALL(\"BinaryServer::io_accept_cb(<watcher>, 0x%x (%s)) {sock:%d}\", revents, readable_revents(revents), watcher.fd);\n\n\tL_EV_BEGIN(\"BinaryServer::io_accept_cb:BEGIN\");\n\tL_EV_END(\"BinaryServer::io_accept_cb:END\");\n\n\tignore_unused(watcher);\n\tASSERT(sock == -1 || sock == watcher.fd);\n\n\tL_DEBUG_HOOK(\"BinaryServer::io_accept_cb\", \"BinaryServer::io_accept_cb(<watcher>, 0x%x (%s)) {sock:%d}\", revents, readable_revents(revents), watcher.fd);\n\n\tif (EV_ERROR & revents) {\n\t\tL_EV(\"ERROR: got invalid binary event {sock:%d}: %s\", watcher.fd, error::name(errno), errno, error::description(errno));\n\t\treturn;\n\t}\n\n\tint client_sock = accept();\n\tif (client_sock == -1) {\n\t\tif (!io::ignored_errno(errno, true, true, false)) {\n\t\t\tL_ERR(\"ERROR: accept binary error {sock:%d}: %s (%d): %s\", watcher.fd, error::name(errno), errno, error::description(errno));\n\t\t}\n\t} else {\n\t\tauto client = Worker::make_shared<BinaryClient>(share_this<BinaryServer>(), ev_loop, ev_flags, client_sock, active_timeout, idle_timeout);\n\t\tif (!client->init_remote()) {\n\t\t\tclient->destroy();\n\t\t}\n\t}\n}\n\n\nvoid\nBinaryServer::trigger_replication(const Endpoint& src_endpoint, const Endpoint& dst_endpoint, bool cluster_database)\n{\n\tif (src_endpoint.is_local()) {\n\t\tASSERT(!cluster_database);\n\t\treturn;\n\t}\n\n\tbool replicated = false;\n\n\tif (src_endpoint.path == \".\") {\n\t\t\/\/ Cluster database is always updated\n\t\treplicated = true;\n\t}\n\n\tif (!replicated && exists(std::string(src_endpoint.path) + \"\/iamglass\")) {\n\t\t\/\/ If database is already there, its also always updated\n\t\treplicated = true;\n\t}\n\n\tif (!replicated) {\n\t\t\/\/ Otherwise, check if the local node resolves as replicator\n\t\tauto local_node = Node::local_node();\n\t\tauto nodes = XapiandManager::manager->resolve_index_nodes(src_endpoint.path);\n\t\tfor (const auto& node : nodes) {\n\t\t\tif (Node::is_equal(node, local_node)) {\n\t\t\t\treplicated = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!replicated) {\n\t\tASSERT(!cluster_database);\n\t\treturn;\n\t}\n\n\tint client_sock = TCP::socket();\n\tif (client_sock < 0) {\n\t\tif (cluster_database) {\n\t\t\tL_CRIT(\"Cannot replicate cluster database\");\n\t\t\tsig_exit(-EX_SOFTWARE);\n\t\t}\n\t\treturn;\n\t}\n\n\tauto client = Worker::make_shared<BinaryClient>(share_this<BinaryServer>(), ev_loop, ev_flags, client_sock, active_timeout, idle_timeout, cluster_database);\n\n\tif (!client->init_replication(src_endpoint, dst_endpoint)) {\n\t\tclient->destroy();\n\t\treturn;\n\t}\n\n\tL_INFO(\"Database %s being synchronized from %s%s\" + INFO_COL + \"...\", repr(src_endpoint.to_string()), src_endpoint.node.col().ansi(), src_endpoint.node.name());\n}\n\n#endif \/* XAPIAND_CLUSTERING *\/\n<|endoftext|>"}
{"text":"<commit_before>\/** \\copyright\n * Copyright (c) 2015, 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 SimpleStack.cxx\n *\n * A complete OpenLCB stack for use in straightforward OpenLCB nodes.\n *\n * @author Balazs Racz\n * @date 18 Mar 2015\n *\/\n\n#if defined(__linux__) || defined(__MACH__)\n#include <termios.h> \/* tc* functions *\/\n#endif\n\n#include \"nmranet\/SimpleStack.hxx\"\n#include \"nmranet\/SimpleNodeInfo.hxx\"\n\nnamespace nmranet\n{\n\nSimpleCanStack::SimpleCanStack(const nmranet::NodeID node_id)\n    : node_(&ifCan_, node_id)\n{\n    AddAliasAllocator(node_id, &ifCan_);\n}\n\nvoid SimpleCanStack::start_stack()\n{\n    \/\/ Opens the eeprom file and sends configuration update commands to all\n    \/\/ listeners.\n    configUpdateFlow_.init(CONFIG_FILENAME);\n\n    \/\/ Bootstraps the alias allocation process.\n    ifCan_.alias_allocator()->send(ifCan_.alias_allocator()->alloc());\n\n    \/\/ Adds memory spaces.\n    if (config_enable_all_memory_space() == CONSTANT_TRUE)\n    {\n        auto *space = new ReadOnlyMemoryBlock(nullptr, 0xFFFFFFFFUL);\n        memoryConfigHandler_.registry()->insert(\n            nullptr, MemoryConfigDefs::SPACE_ALL_MEMORY, space);\n        additionalComponents_.emplace_back(space);\n    }\n    {\n        auto *space = new ReadOnlyMemoryBlock(\n            reinterpret_cast<const uint8_t *>(&SNIP_STATIC_DATA),\n            sizeof(SNIP_STATIC_DATA));\n        memoryConfigHandler_.registry()->insert(\n            &node_, MemoryConfigDefs::SPACE_ACDI_SYS, space);\n        additionalComponents_.emplace_back(space);\n    }\n    {\n        auto *space = new FileMemorySpace(SNIP_DYNAMIC_FILENAME,\n                                          sizeof(SimpleNodeDynamicValues));\n        memoryConfigHandler_.registry()->insert(\n            &node_, MemoryConfigDefs::SPACE_ACDI_USR, space);\n        additionalComponents_.emplace_back(space);\n    }\n    {\n        auto *space = new ReadOnlyMemoryBlock(\n            reinterpret_cast<const uint8_t *>(&CDI_DATA),\n            CDI_SIZE);\n        memoryConfigHandler_.registry()->insert(\n            &node_, MemoryConfigDefs::SPACE_CDI, space);\n        additionalComponents_.emplace_back(space);\n    }\n}\n\nvoid SimpleCanStack::add_gridconnect_port(const char* path, Notifiable* on_exit) {\n  int fd = ::open(path, O_RDWR);\n  HASSERT(fd >= 0);\n  LOG(INFO, \"Adding device %s as fd %d\", path, fd);\n  create_gc_port_for_can_hub(&canHub0_, fd, on_exit);\n}\n\n#if defined(__linux__) || defined(__MACH__)\nvoid SimpleCanStack::add_gridconnect_tty(const char* device, Notifiable* on_exit) {\n  int fd = ::open(device, O_RDWR);\n  HASSERT(fd >= 0);\n  LOG(INFO, \"Adding device %s as fd %d\", device, fd);\n  create_gc_port_for_can_hub(&canHub0_, fd, on_exit);\n\n  HASSERT(!tcflush(fd, TCIOFLUSH));\n  struct termios settings;\n  HASSERT(!tcgetattr(fd, &settings));\n  cfmakeraw(&settings);\n  HASSERT(!tcsetattr(fd, TCSANOW, &settings));\n}\n#endif\nextern Pool *const __attribute__((__weak__)) g_incoming_datagram_allocator =\n    mainBufferPool;\n\nextern const char *const __attribute__((__weak__)) CONFIG_FILENAME = nullptr;\n\nextern const char __attribute__((weak)) CDI_DATA[] = \nR\"cdi(<?xml version=\"1.0\"?>\n<cdi xmlns:xsi=\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\" xsi:noNamespaceSchemaLocation=\"http:\/\/openlcb.org\/schema\/cdi\/1\/1\/cdi.xsd\">\n<identification\/>\n<acdi\/>\n<segment origin='0' space='252'>\n <group>\n <name>Manufacturer Information<\/name>\n <description>Manufacturer-provided fixed node description<\/description>\n <int size='1'>\n <name>Version<\/name>\n <\/int>\n <string size='41'>\n <name>Manufacturer Name<\/name>\n <\/string>\n <string size='41'>\n <name>Node Type<\/name>\n <\/string>\n <string size='21'>\n <name>Hardware Version<\/name>\n <\/string>\n <string size='21'>\n <name>Software Version<\/name>\n <\/string>\n <\/group>\n<\/segment>\n<segment origin='0' space='251'>\n <group>\n <name>User Identification<\/name>\n <description>Lets the user add his own description<\/description>\n <int size='1'>\n <name>Version<\/name>\n <\/int>\n <string size='63'>\n <name>Node Name<\/name>\n <\/string>\n <string size='64'>\n <name>Node Description<\/name>\n <\/string>\n <\/group>\n<\/segment>\n<\/cdi>\n)cdi\";\nextern const size_t __attribute__((weak)) CDI_SIZE = sizeof(CDI_DATA);\n\n\n} \/\/ namespace nmranet\n<commit_msg>Adds weak definition for the configuration filename symbol to be used when there is no config eeprom present.<commit_after>\/** \\copyright\n * Copyright (c) 2015, 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 SimpleStack.cxx\n *\n * A complete OpenLCB stack for use in straightforward OpenLCB nodes.\n *\n * @author Balazs Racz\n * @date 18 Mar 2015\n *\/\n\n#if defined(__linux__) || defined(__MACH__)\n#include <termios.h> \/* tc* functions *\/\n#endif\n\n#include \"nmranet\/SimpleStack.hxx\"\n#include \"nmranet\/SimpleNodeInfo.hxx\"\n\nnamespace nmranet\n{\n\nSimpleCanStack::SimpleCanStack(const nmranet::NodeID node_id)\n    : node_(&ifCan_, node_id)\n{\n    AddAliasAllocator(node_id, &ifCan_);\n}\n\nvoid SimpleCanStack::start_stack()\n{\n    \/\/ Opens the eeprom file and sends configuration update commands to all\n    \/\/ listeners.\n    configUpdateFlow_.init(CONFIG_FILENAME);\n\n    \/\/ Bootstraps the alias allocation process.\n    ifCan_.alias_allocator()->send(ifCan_.alias_allocator()->alloc());\n\n    \/\/ Adds memory spaces.\n    if (config_enable_all_memory_space() == CONSTANT_TRUE)\n    {\n        auto *space = new ReadOnlyMemoryBlock(nullptr, 0xFFFFFFFFUL);\n        memoryConfigHandler_.registry()->insert(\n            nullptr, MemoryConfigDefs::SPACE_ALL_MEMORY, space);\n        additionalComponents_.emplace_back(space);\n    }\n    {\n        auto *space = new ReadOnlyMemoryBlock(\n            reinterpret_cast<const uint8_t *>(&SNIP_STATIC_DATA),\n            sizeof(SNIP_STATIC_DATA));\n        memoryConfigHandler_.registry()->insert(\n            &node_, MemoryConfigDefs::SPACE_ACDI_SYS, space);\n        additionalComponents_.emplace_back(space);\n    }\n    {\n        auto *space = new FileMemorySpace(SNIP_DYNAMIC_FILENAME,\n                                          sizeof(SimpleNodeDynamicValues));\n        memoryConfigHandler_.registry()->insert(\n            &node_, MemoryConfigDefs::SPACE_ACDI_USR, space);\n        additionalComponents_.emplace_back(space);\n    }\n    {\n        auto *space = new ReadOnlyMemoryBlock(\n            reinterpret_cast<const uint8_t *>(&CDI_DATA),\n            CDI_SIZE);\n        memoryConfigHandler_.registry()->insert(\n            &node_, MemoryConfigDefs::SPACE_CDI, space);\n        additionalComponents_.emplace_back(space);\n    }\n}\n\nvoid SimpleCanStack::add_gridconnect_port(const char* path, Notifiable* on_exit) {\n  int fd = ::open(path, O_RDWR);\n  HASSERT(fd >= 0);\n  LOG(INFO, \"Adding device %s as fd %d\", path, fd);\n  create_gc_port_for_can_hub(&canHub0_, fd, on_exit);\n}\n\n#if defined(__linux__) || defined(__MACH__)\nvoid SimpleCanStack::add_gridconnect_tty(const char* device, Notifiable* on_exit) {\n  int fd = ::open(device, O_RDWR);\n  HASSERT(fd >= 0);\n  LOG(INFO, \"Adding device %s as fd %d\", device, fd);\n  create_gc_port_for_can_hub(&canHub0_, fd, on_exit);\n\n  HASSERT(!tcflush(fd, TCIOFLUSH));\n  struct termios settings;\n  HASSERT(!tcgetattr(fd, &settings));\n  cfmakeraw(&settings);\n  HASSERT(!tcsetattr(fd, TCSANOW, &settings));\n}\n#endif\nextern Pool *const __attribute__((__weak__)) g_incoming_datagram_allocator =\n    mainBufferPool;\n\nextern const char __attribute__((weak)) CDI_DATA[] = \nR\"cdi(<?xml version=\"1.0\"?>\n<cdi xmlns:xsi=\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\" xsi:noNamespaceSchemaLocation=\"http:\/\/openlcb.org\/schema\/cdi\/1\/1\/cdi.xsd\">\n<identification\/>\n<acdi\/>\n<segment origin='0' space='252'>\n <group>\n <name>Manufacturer Information<\/name>\n <description>Manufacturer-provided fixed node description<\/description>\n <int size='1'>\n <name>Version<\/name>\n <\/int>\n <string size='41'>\n <name>Manufacturer Name<\/name>\n <\/string>\n <string size='41'>\n <name>Node Type<\/name>\n <\/string>\n <string size='21'>\n <name>Hardware Version<\/name>\n <\/string>\n <string size='21'>\n <name>Software Version<\/name>\n <\/string>\n <\/group>\n<\/segment>\n<segment origin='0' space='251'>\n <group>\n <name>User Identification<\/name>\n <description>Lets the user add his own description<\/description>\n <int size='1'>\n <name>Version<\/name>\n <\/int>\n <string size='63'>\n <name>Node Name<\/name>\n <\/string>\n <string size='64'>\n <name>Node Description<\/name>\n <\/string>\n <\/group>\n<\/segment>\n<\/cdi>\n)cdi\";\nextern const size_t __attribute__((weak)) CDI_SIZE = sizeof(CDI_DATA);\n\n\n} \/\/ namespace nmranet\n<|endoftext|>"}
{"text":"<commit_before>#include \"server\/httplistener.h\"\n#include \"common\/config.h\"\n\n#include <Poco\/Net\/HTTPServer.h>\n#include <Poco\/Exception.h>\n\n\n\/*\n * http:\/\/www.codeproject.com\/Articles\/252827\/Learning-Poco-A-simple-HTTP-server\n *\/\n\nusing namespace Batyr;\n\n\nHttpListener::HttpListener(Configuration::Ptr _configuration)\n    :   BaseListener(_configuration), \n        logger(Poco::Logger::get(\"HttpListener\")),\n        isRunning(false)\n{\n    \/\/ prepare the server parameters and let them be managed by\n    \/\/ a smart pointer\n    auto serverParams = new Poco::Net::HTTPServerParams;\n    serverParams->setMaxThreads( SERVER_HTTP_THREADS );\n    serverParamsPtr.assign(serverParams);\n    \n    \/\/ set up the network socket\n    try {\n        socket.bind( configuration->getHttpPort() );\n        socket.listen();\n    }\n    catch (Poco::Exception& e) {\n        poco_error(logger, e.message());\n        e.rethrow();\n    }\n\n    \/\/ will get destroyed with by the poco httpserver\n    auto handlerFactory = new Batyr::HTTPRequestHandlerFactory(configuration);\n    handlerFactoryPtr.assign(handlerFactory);\n\n    server.reset(new Poco::Net::HTTPServer(handlerFactoryPtr, socket, serverParamsPtr));\n}\n\nHttpListener::~HttpListener() \n{\n    stop();\n}\n\nvoid\nHttpListener::run()\n{\n    poco_debug(logger, \"Starting http listener\");\n    if (!isRunning) {\n\n        \/\/ set the joblist\n        handlerFactoryPtr->setJobs(jobs);\n\n        server->start();\n        isRunning = true;\n    }\n}\n\n\nvoid\nHttpListener::stop()\n{\n    poco_debug(logger, \"Stopping http listener\");\n    if (isRunning) {\n        server->stop();\n        isRunning = false;\n    }\n}\n<commit_msg>closing http socket on shutdown<commit_after>#include \"server\/httplistener.h\"\n#include \"common\/config.h\"\n\n#include <Poco\/Net\/HTTPServer.h>\n#include <Poco\/Exception.h>\n\n\n\/*\n * http:\/\/www.codeproject.com\/Articles\/252827\/Learning-Poco-A-simple-HTTP-server\n *\/\n\nusing namespace Batyr;\n\n\nHttpListener::HttpListener(Configuration::Ptr _configuration)\n    :   BaseListener(_configuration), \n        logger(Poco::Logger::get(\"HttpListener\")),\n        isRunning(false)\n{\n    \/\/ prepare the server parameters and let them be managed by\n    \/\/ a smart pointer\n    auto serverParams = new Poco::Net::HTTPServerParams;\n    serverParams->setMaxThreads( SERVER_HTTP_THREADS );\n    serverParamsPtr.assign(serverParams);\n    \n    \/\/ set up the network socket\n    try {\n        socket.bind( configuration->getHttpPort() );\n        socket.listen();\n    }\n    catch (Poco::Exception& e) {\n        poco_error(logger, e.message());\n        e.rethrow();\n    }\n\n    \/\/ will get destroyed with by the poco httpserver\n    auto handlerFactory = new Batyr::HTTPRequestHandlerFactory(configuration);\n    handlerFactoryPtr.assign(handlerFactory);\n\n    server.reset(new Poco::Net::HTTPServer(handlerFactoryPtr, socket, serverParamsPtr));\n}\n\nHttpListener::~HttpListener() \n{\n    stop();\n    socket.close();\n}\n\nvoid\nHttpListener::run()\n{\n    poco_debug(logger, \"Starting http listener\");\n    if (!isRunning) {\n\n        \/\/ set the joblist\n        handlerFactoryPtr->setJobs(jobs);\n\n        server->start();\n        isRunning = true;\n    }\n}\n\n\nvoid\nHttpListener::stop()\n{\n    poco_debug(logger, \"Stopping http listener\");\n    if (isRunning) {\n        server->stop();\n        isRunning = false;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright 2015-2016, 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\n#include <string.h>\n\n#include <node.h>\n#include <nan.h>\n#include \"grpc\/grpc.h\"\n#include \"grpc\/byte_buffer_reader.h\"\n#include \"grpc\/support\/slice.h\"\n\n#include \"byte_buffer.h\"\n\nnamespace grpc {\nnamespace node {\n\n\nusing v8::Context;\nusing v8::Function;\nusing v8::Local;\nusing v8::Object;\nusing v8::Number;\nusing v8::Value;\n\ngrpc_byte_buffer *BufferToByteBuffer(Local<Value> buffer) {\n  Nan::HandleScope scope;\n  int length = ::node::Buffer::Length(buffer);\n  char *data = ::node::Buffer::Data(buffer);\n  gpr_slice slice = gpr_slice_malloc(length);\n  memcpy(GPR_SLICE_START_PTR(slice), data, length);\n  grpc_byte_buffer *byte_buffer(grpc_raw_byte_buffer_create(&slice, 1));\n  gpr_slice_unref(slice);\n  return byte_buffer;\n}\n\nLocal<Value> ByteBufferToBuffer(grpc_byte_buffer *buffer) {\n  Nan::EscapableHandleScope scope;\n  if (buffer == NULL) {\n    return scope.Escape(Nan::Null());\n  }\n  size_t length = grpc_byte_buffer_length(buffer);\n  char *result = new char[length];\n  size_t offset = 0;\n  grpc_byte_buffer_reader reader;\n  grpc_byte_buffer_reader_init(&reader, buffer);\n  gpr_slice next;\n  while (grpc_byte_buffer_reader_next(&reader, &next) != 0) {\n    memcpy(result + offset, GPR_SLICE_START_PTR(next), GPR_SLICE_LENGTH(next));\n    offset += GPR_SLICE_LENGTH(next);\n    gpr_slice_unref(next);\n  }\n  return scope.Escape(MakeFastBuffer(\n      Nan::NewBuffer(result, length).ToLocalChecked()));\n}\n\nLocal<Value> MakeFastBuffer(Local<Value> slowBuffer) {\n  Nan::EscapableHandleScope scope;\n  Local<Object> globalObj = Nan::GetCurrentContext()->Global();\n  Local<Function> bufferConstructor = Local<Function>::Cast(\n      globalObj->Get(Nan::New(\"Buffer\").ToLocalChecked()));\n  Local<Value> consArgs[3] = {\n    slowBuffer,\n    Nan::New<Number>(::node::Buffer::Length(slowBuffer)),\n    Nan::New<Number>(0)\n  };\n  Local<Object> fastBuffer = bufferConstructor->NewInstance(3, consArgs);\n  return scope.Escape(fastBuffer);\n}\n}  \/\/ namespace node\n}  \/\/ namespace grpc\n<commit_msg>Pass delete[] explicitely to Nan::NewBuffer.<commit_after>\/*\n *\n * Copyright 2015-2016, 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\n#include <string.h>\n\n#include <node.h>\n#include <nan.h>\n#include \"grpc\/grpc.h\"\n#include \"grpc\/byte_buffer_reader.h\"\n#include \"grpc\/support\/slice.h\"\n\n#include \"byte_buffer.h\"\n\nnamespace grpc {\nnamespace node {\n\n\nusing v8::Context;\nusing v8::Function;\nusing v8::Local;\nusing v8::Object;\nusing v8::Number;\nusing v8::Value;\n\ngrpc_byte_buffer *BufferToByteBuffer(Local<Value> buffer) {\n  Nan::HandleScope scope;\n  int length = ::node::Buffer::Length(buffer);\n  char *data = ::node::Buffer::Data(buffer);\n  gpr_slice slice = gpr_slice_malloc(length);\n  memcpy(GPR_SLICE_START_PTR(slice), data, length);\n  grpc_byte_buffer *byte_buffer(grpc_raw_byte_buffer_create(&slice, 1));\n  gpr_slice_unref(slice);\n  return byte_buffer;\n}\n\nnamespace {\nvoid delete_buffer(char *data, void *hint) { delete[] data; }\n}\n\nLocal<Value> ByteBufferToBuffer(grpc_byte_buffer *buffer) {\n  Nan::EscapableHandleScope scope;\n  if (buffer == NULL) {\n    return scope.Escape(Nan::Null());\n  }\n  size_t length = grpc_byte_buffer_length(buffer);\n  char *result = new char[length];\n  size_t offset = 0;\n  grpc_byte_buffer_reader reader;\n  grpc_byte_buffer_reader_init(&reader, buffer);\n  gpr_slice next;\n  while (grpc_byte_buffer_reader_next(&reader, &next) != 0) {\n    memcpy(result + offset, GPR_SLICE_START_PTR(next), GPR_SLICE_LENGTH(next));\n    offset += GPR_SLICE_LENGTH(next);\n    gpr_slice_unref(next);\n  }\n  return scope.Escape(MakeFastBuffer(\n      Nan::NewBuffer(result, length, delete_buffer, NULL).ToLocalChecked()));\n}\n\nLocal<Value> MakeFastBuffer(Local<Value> slowBuffer) {\n  Nan::EscapableHandleScope scope;\n  Local<Object> globalObj = Nan::GetCurrentContext()->Global();\n  Local<Function> bufferConstructor = Local<Function>::Cast(\n      globalObj->Get(Nan::New(\"Buffer\").ToLocalChecked()));\n  Local<Value> consArgs[3] = {\n    slowBuffer,\n    Nan::New<Number>(::node::Buffer::Length(slowBuffer)),\n    Nan::New<Number>(0)\n  };\n  Local<Object> fastBuffer = bufferConstructor->NewInstance(3, consArgs);\n  return scope.Escape(fastBuffer);\n}\n}  \/\/ namespace node\n}  \/\/ namespace grpc\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KAddressBook.\n    Copyright (c) 2002 Mike Pilone <mpilone@slac.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; 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 <QLayout>\n#include <kvbox.h>\n\/\/Added by qt3to4:\n#include <QPixmap>\n#include <QVBoxLayout>\n\n#include <kconfig.h>\n#include <kdebug.h>\n#include <kglobal.h>\n#include <kiconloader.h>\n#include <klocale.h>\n#include <kpagewidget.h>\n#include <ktoolinvocation.h>\n\n#include \"viewconfigurefieldspage.h\"\n#include \"viewconfigurefilterpage.h\"\n#include \"viewmanager.h\"\n\n#include \"viewconfigurewidget.h\"\n\nViewConfigureWidget::ViewConfigureWidget( KABC::AddressBook *ab, QWidget *parent )\n  : KAB::ConfigureWidget( ab, parent )\n{\n  QVBoxLayout *topLayout = new QVBoxLayout( this );\n\n  mMainWidget = new KPageWidget( this );\n  mMainWidget->setFaceType( KPageView::List );\n  topLayout->addWidget( mMainWidget );\n\n  \/\/ Add the first page, the attributes\n  KVBox *page = addPage( i18n( \"Fields\" ), QString(),\n                         KIconLoader::global()->loadIcon( \"view_detailed\",\n                         K3Icon::Panel ) );\n\n  \/\/ Add the select fields page\n  mFieldsPage = new ViewConfigureFieldsPage( addressBook(), page );\n\n  \/\/ Add the second page, the filter selection\n  page = addPage( i18n( \"Default Filter\" ), QString(),\n                  KIconLoader::global()->loadIcon( \"filter\",\n                  K3Icon::Panel ) );\n\n  mFilterPage = new ViewConfigureFilterPage( page );\n}\n\nViewConfigureWidget::~ViewConfigureWidget()\n{\n}\n\nvoid ViewConfigureWidget::restoreSettings( KConfig *config )\n{\n  mFieldsPage->restoreSettings( config );\n  mFilterPage->restoreSettings( config );\n}\n\nvoid ViewConfigureWidget::saveSettings( KConfig *config )\n{\n  mFieldsPage->saveSettings( config );\n  mFilterPage->saveSettings( config );\n}\n\nKVBox *ViewConfigureWidget::addPage( const QString &item, const QString &header,\n                                   const QPixmap &pixmap )\n{\n  KVBox *page = new KVBox( mMainWidget );\n#ifdef __GNUC__\n#warning What about the page icon and page header?\n#endif\n  mMainWidget->addPage( page, item );\n  return page;\n}\n\nViewConfigureDialog::ViewConfigureDialog( ViewConfigureWidget *wdg, const QString &viewName,\n                                          QWidget *parent, const char *name )\n  : KDialog( parent ), mConfigWidget( wdg )\n{\n  setCaption( i18n( \"Modify View: \" ) + viewName );\n  setButtons( Help | Ok | Cancel );\n  setDefaultButton( Ok );\n  showButtonSeparator( true );\n\n  setMainWidget( mConfigWidget );\n  connect(this,SIGNAL(helpClicked()),this,SLOT(slotHelp()));\n  resize( 600, 300 );\n}\n\nViewConfigureDialog::~ViewConfigureDialog()\n{\n}\n\nvoid ViewConfigureDialog::restoreSettings( KConfig *config )\n{\n  mConfigWidget->restoreSettings( config );\n}\n\nvoid ViewConfigureDialog::saveSettings( KConfig *config )\n{\n  mConfigWidget->saveSettings( config );\n}\n\nvoid ViewConfigureDialog::slotHelp()\n{\n  KToolInvocation::invokeHelp( \"using-views\" );\n}\n\n#include \"viewconfigurewidget.moc\"\n<commit_msg>Port++<commit_after>\/*\n    This file is part of KAddressBook.\n    Copyright (c) 2002 Mike Pilone <mpilone@slac.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; 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 <QLayout>\n#include <kvbox.h>\n\/\/Added by qt3to4:\n#include <QPixmap>\n#include <QVBoxLayout>\n\n#include <kconfig.h>\n#include <kdebug.h>\n#include <kglobal.h>\n#include <kiconloader.h>\n#include <klocale.h>\n#include <kpagewidget.h>\n#include <ktoolinvocation.h>\n\n#include \"viewconfigurefieldspage.h\"\n#include \"viewconfigurefilterpage.h\"\n#include \"viewmanager.h\"\n\n#include \"viewconfigurewidget.h\"\n\nViewConfigureWidget::ViewConfigureWidget( KABC::AddressBook *ab, QWidget *parent )\n  : KAB::ConfigureWidget( ab, parent )\n{\n  QVBoxLayout *topLayout = new QVBoxLayout( this );\n\n  mMainWidget = new KPageWidget( this );\n  mMainWidget->setFaceType( KPageView::List );\n  topLayout->addWidget( mMainWidget );\n\n  \/\/ Add the first page, the attributes\n  KVBox *page = addPage( i18n( \"Fields\" ), QString(),\n                         KIconLoader::global()->loadIcon( \"view_detailed\",\n                         K3Icon::Panel ) );\n\n  \/\/ Add the select fields page\n  mFieldsPage = new ViewConfigureFieldsPage( addressBook(), page );\n\n  \/\/ Add the second page, the filter selection\n  page = addPage( i18n( \"Default Filter\" ), QString(),\n                  KIconLoader::global()->loadIcon( \"filter\",\n                  K3Icon::Panel ) );\n\n  mFilterPage = new ViewConfigureFilterPage( page );\n}\n\nViewConfigureWidget::~ViewConfigureWidget()\n{\n}\n\nvoid ViewConfigureWidget::restoreSettings( KConfig *config )\n{\n  mFieldsPage->restoreSettings( config );\n  mFilterPage->restoreSettings( config );\n}\n\nvoid ViewConfigureWidget::saveSettings( KConfig *config )\n{\n  mFieldsPage->saveSettings( config );\n  mFilterPage->saveSettings( config );\n}\n\nKVBox *ViewConfigureWidget::addPage( const QString &item, const QString &header,\n                                   const QPixmap &pixmap )\n{\n  KVBox *page = new KVBox( mMainWidget );\n  KPageWidgetItem*itemPage=mMainWidget->addPage( page, item );\n  itemPage->setHeader(header);\n  itemPage->setIcon(KIcon(pixmap));\n  return page;\n}\n\nViewConfigureDialog::ViewConfigureDialog( ViewConfigureWidget *wdg, const QString &viewName,\n                                          QWidget *parent, const char *name )\n  : KDialog( parent ), mConfigWidget( wdg )\n{\n  setCaption( i18n( \"Modify View: \" ) + viewName );\n  setButtons( Help | Ok | Cancel );\n  setDefaultButton( Ok );\n  showButtonSeparator( true );\n\n  setMainWidget( mConfigWidget );\n  connect(this,SIGNAL(helpClicked()),this,SLOT(slotHelp()));\n  resize( 600, 300 );\n}\n\nViewConfigureDialog::~ViewConfigureDialog()\n{\n}\n\nvoid ViewConfigureDialog::restoreSettings( KConfig *config )\n{\n  mConfigWidget->restoreSettings( config );\n}\n\nvoid ViewConfigureDialog::saveSettings( KConfig *config )\n{\n  mConfigWidget->saveSettings( config );\n}\n\nvoid ViewConfigureDialog::slotHelp()\n{\n  KToolInvocation::invokeHelp( \"using-views\" );\n}\n\n#include \"viewconfigurewidget.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @file\n\/\/\/ @author uentity\n\/\/\/ @date 23.04.2019\n\/\/\/ @brief BS kernel Python subsystem impl\n\/\/\/ @copyright\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,\n\/\/\/ You can obtain one at https:\/\/mozilla.org\/MPL\/2.0\/\n\n#include <bs\/python\/common.h>\n#include <bs\/log.h>\n#include <bs\/kernel\/errors.h>\n\n#include \"kimpl.h\"\n#include \"python_subsyst_impl.h\"\n#include \"plugins_subsyst.h\"\n\n#include <functional>\n\n#define WITH_KMOD \\\n[[maybe_unused]] auto res = pykmod(this).map([&](auto kmod_ptr) { \\\n[[maybe_unused]] auto& kmod = *kmod_ptr;\n\n#define END_WITH });\n\n#define RETURN_WITH END_WITH return res.value();\n\n#define RETURN_WITH_FAIL(err_val) END_WITH return res.value_or(err_val);\n\nNAMESPACE_BEGIN(blue_sky::kernel::detail)\nusing namespace blue_sky::detail;\nnamespace py = pybind11;\n\nNAMESPACE_BEGIN()\n\nauto pykmod(const python_subsyst* v) -> result_or_err<pybind11::module*> {\n\tif(v) if(auto kmod = v->py_kmod())\n\t\treturn { static_cast<pybind11::module*>(kmod) };\n\treturn tl::unexpected{Error::BadPymod};\n}\n\nstd::string extract_root_name(const std::string& full_name) {\n\tusing namespace std;\n\n\t\/\/extract user-friendly lib name from full name\n\tstring pyl_name = full_name;\n\t\/\/cut path\n\tstring::size_type pos = pyl_name.rfind('\/');\n\tif(pos != string::npos) pyl_name = pyl_name.substr(pos + 1, string::npos);\n\tpos = pyl_name.rfind('\\\\');\n\tif(pos != string::npos) pyl_name = pyl_name.substr(pos + 1, string::npos);\n\t\/\/cut extension\n\tpyl_name = pyl_name.substr(0, pyl_name.find('.'));\n\t\/\/cut \"lib\" prefix if exists\n\tif(pyl_name.compare(0, 3, string(\"lib\")) == 0)\n\t\tpyl_name = pyl_name.substr(3, string::npos);\n\n\treturn pyl_name;\n}\n\nconstexpr auto sp_obj_hash = std::hash<sp_obj>{};\n\nNAMESPACE_END()\n\npython_subsyst_impl::python_subsyst_impl(void* kmod_ptr) {\n\tsetup_py_kmod(kmod_ptr);\n}\n\nauto python_subsyst_impl::py_kmod() const -> void* { return kmod_; }\n\nauto python_subsyst_impl::setup_py_kmod(void* kmod_ptr) -> void {\n\tif(kmod_ptr) {\n\t\tkmod_ = kmod_ptr;\n\t\tauto& kmod = *static_cast<pybind11::module*>(kmod_);\n\n\t\tauto& kpd = plugins_subsyst::kernel_pd();\n\t\tkmod.doc() = kpd.description;\n\t\tkpd.py_namespace = PyModule_GetName(kmod.ptr());\n\t}\n}\n\nauto python_subsyst_impl::py_init_plugin(\n\tconst blue_sky::detail::lib_descriptor& lib, plugin_descriptor& p_descr\n) -> result_or_err<std::string> {\n\treturn pykmod(this).and_then([&](auto kmod_ptr) -> result_or_err<std::string> {\n\t\tbs_init_py_fn init_py_fn;\n\t\tlib.load_sym(\"bs_init_py_subsystem\", init_py_fn);\n\t\tif(!init_py_fn) return tl::make_unexpected(error{p_descr.name, kernel::Error::PythonDisabled});\n\n\t\tif(p_descr.py_namespace.empty())\n\t\t\tp_descr.py_namespace = extract_root_name(lib.fname_);\n\n\t\t\/\/ create submodule\n\t\tauto plugin_mod = kmod_ptr->def_submodule(p_descr.py_namespace.c_str(), p_descr.description.c_str());\n\t\t\/\/ invoke init function\n\t\tinit_py_fn(&plugin_mod);\n\n\t\treturn plugins_subsyst::kernel_pd().py_namespace + '.' + p_descr.py_namespace;\n\t});\n}\n\nauto python_subsyst_impl::py_add_error_closure() -> void {\nWITH_KMOD\n\tauto err_class = (pybind11::class_<std::error_code>)kmod.attr(\"error_code\");\n\tpybind11::init([](int ec) {\n\t\treturn std::error_code(static_cast<Error>(ec));\n\t}).execute(err_class);\nEND_WITH\n}\n\nauto python_subsyst_impl::register_adapter(std::string obj_type_id, adapter_fn f) -> void {\n\tif(f)\n\t\tadapters_.insert_or_assign(std::move(obj_type_id), std::move(f));\n\telse {\n\t\tauto pa = adapters_.find(obj_type_id);\n\t\tif(pa != adapters_.end())\n\t\t\tadapters_.erase(pa);\n\t}\n}\n\nauto python_subsyst_impl::register_default_adapter(adapter_fn f) -> void {\n\tdef_adapter_ = std::move(f);\n}\n\nauto python_subsyst_impl::clear_adapters() -> void {\n\tadapters_.clear();\n\tdef_adapter_ = nullptr;\n}\n\nauto python_subsyst_impl::adapted_types() const -> std::vector<std::string> {\n\tstd::vector<std::string> res(adapters_.size());\n\tstd::transform(\n\t\tadapters_.begin(), adapters_.end(), res.begin(),\n\t\t[](const auto& A){ return A.first; }\n\t);\n\tif(def_adapter_) res.push_back(\"*\");\n\treturn res;\n}\n\nauto python_subsyst_impl::adapt(sp_obj source) -> py::object {\n\tif(!source) return py::none();\n\t\/\/ check if adpater already created for given object\n\tauto cached_A = acache_.find(sp_obj_hash(source));\n\tif(cached_A != acache_.end())\n\t\treturn cached_A->second;\n\t\/\/ adapt or passthrough\n\tauto pf = adapters_.find(source->type_id());\n\tauto&& obj = std::move(source);\n\tauto A = pf != adapters_.end() ?\n\t\tpf->second(obj) :\n\t\t( def_adapter_ ? def_adapter_(obj) : py::cast(obj) );\n\t\/\/ cache adapter instance\n\tacache_[sp_obj_hash(source)] = A;\n\treturn A;\n}\n\nauto python_subsyst_impl::drop_adapted_cache(const sp_obj& obj) -> std::size_t {\n\tstd::size_t res = 0;\n\tif(!obj) {\n\t\tres = acache_.size();\n\t\tacache_.clear();\n\t}\n\telse {\n\t\tauto cached_A = acache_.find(sp_obj_hash(obj));\n\t\tif(cached_A != acache_.end()) {\n\t\t\tacache_.erase(cached_A);\n\t\t\tres = 1;\n\t\t}\n\t}\n\treturn res;\n}\n\nauto python_subsyst_impl::self() -> python_subsyst_impl& {\n\t\/\/ [NOTE] unconditional cast, because if self() is called, then instance MUST be self for sure\n\treturn static_cast<python_subsyst_impl&>(singleton<python_subsyst>::Instance());\n}\n\nNAMESPACE_END(blue_sky::kernel::detail)\n<commit_msg>kernel\/python: null-init kernel kmod ptr with when not in Py environment<commit_after>\/\/\/ @file\n\/\/\/ @author uentity\n\/\/\/ @date 23.04.2019\n\/\/\/ @brief BS kernel Python subsystem impl\n\/\/\/ @copyright\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,\n\/\/\/ You can obtain one at https:\/\/mozilla.org\/MPL\/2.0\/\n\n#include <bs\/python\/common.h>\n#include <bs\/log.h>\n#include <bs\/kernel\/errors.h>\n\n#include \"kimpl.h\"\n#include \"python_subsyst_impl.h\"\n#include \"plugins_subsyst.h\"\n\n#include <functional>\n\n#define WITH_KMOD \\\n[[maybe_unused]] auto res = pykmod(this).map([&](auto kmod_ptr) { \\\n[[maybe_unused]] auto& kmod = *kmod_ptr;\n\n#define END_WITH });\n\n#define RETURN_WITH END_WITH return res.value();\n\n#define RETURN_WITH_FAIL(err_val) END_WITH return res.value_or(err_val);\n\nNAMESPACE_BEGIN(blue_sky::kernel::detail)\nusing namespace blue_sky::detail;\nnamespace py = pybind11;\n\nNAMESPACE_BEGIN()\n\nauto pykmod(const python_subsyst* v) -> result_or_err<pybind11::module*> {\n\tif(v) if(auto kmod = v->py_kmod())\n\t\treturn { static_cast<pybind11::module*>(kmod) };\n\treturn tl::unexpected{Error::BadPymod};\n}\n\nstd::string extract_root_name(const std::string& full_name) {\n\tusing namespace std;\n\n\t\/\/extract user-friendly lib name from full name\n\tstring pyl_name = full_name;\n\t\/\/cut path\n\tstring::size_type pos = pyl_name.rfind('\/');\n\tif(pos != string::npos) pyl_name = pyl_name.substr(pos + 1, string::npos);\n\tpos = pyl_name.rfind('\\\\');\n\tif(pos != string::npos) pyl_name = pyl_name.substr(pos + 1, string::npos);\n\t\/\/cut extension\n\tpyl_name = pyl_name.substr(0, pyl_name.find('.'));\n\t\/\/cut \"lib\" prefix if exists\n\tif(pyl_name.compare(0, 3, string(\"lib\")) == 0)\n\t\tpyl_name = pyl_name.substr(3, string::npos);\n\n\treturn pyl_name;\n}\n\nconstexpr auto sp_obj_hash = std::hash<sp_obj>{};\n\nNAMESPACE_END()\n\npython_subsyst_impl::python_subsyst_impl(void* kmod_ptr)\n\t: kmod_(nullptr)\n{\n\tsetup_py_kmod(kmod_ptr);\n}\n\nauto python_subsyst_impl::py_kmod() const -> void* { return kmod_; }\n\nauto python_subsyst_impl::setup_py_kmod(void* kmod_ptr) -> void {\n\tif(kmod_ptr) {\n\t\tkmod_ = kmod_ptr;\n\t\tauto& kmod = *static_cast<pybind11::module*>(kmod_);\n\n\t\tauto& kpd = plugins_subsyst::kernel_pd();\n\t\tkmod.doc() = kpd.description;\n\t\tkpd.py_namespace = PyModule_GetName(kmod.ptr());\n\t}\n}\n\nauto python_subsyst_impl::py_init_plugin(\n\tconst blue_sky::detail::lib_descriptor& lib, plugin_descriptor& p_descr\n) -> result_or_err<std::string> {\n\treturn pykmod(this).and_then([&](auto kmod_ptr) -> result_or_err<std::string> {\n\t\tbs_init_py_fn init_py_fn;\n\t\tlib.load_sym(\"bs_init_py_subsystem\", init_py_fn);\n\t\tif(!init_py_fn) return tl::make_unexpected(error{p_descr.name, kernel::Error::PythonDisabled});\n\n\t\tif(p_descr.py_namespace.empty())\n\t\t\tp_descr.py_namespace = extract_root_name(lib.fname_);\n\n\t\t\/\/ create submodule\n\t\tauto plugin_mod = kmod_ptr->def_submodule(p_descr.py_namespace.c_str(), p_descr.description.c_str());\n\t\t\/\/ invoke init function\n\t\tinit_py_fn(&plugin_mod);\n\n\t\treturn plugins_subsyst::kernel_pd().py_namespace + '.' + p_descr.py_namespace;\n\t});\n}\n\nauto python_subsyst_impl::py_add_error_closure() -> void {\nWITH_KMOD\n\tauto err_class = (pybind11::class_<std::error_code>)kmod.attr(\"error_code\");\n\tpybind11::init([](int ec) {\n\t\treturn std::error_code(static_cast<Error>(ec));\n\t}).execute(err_class);\nEND_WITH\n}\n\nauto python_subsyst_impl::register_adapter(std::string obj_type_id, adapter_fn f) -> void {\n\tif(f)\n\t\tadapters_.insert_or_assign(std::move(obj_type_id), std::move(f));\n\telse {\n\t\tauto pa = adapters_.find(obj_type_id);\n\t\tif(pa != adapters_.end())\n\t\t\tadapters_.erase(pa);\n\t}\n}\n\nauto python_subsyst_impl::register_default_adapter(adapter_fn f) -> void {\n\tdef_adapter_ = std::move(f);\n}\n\nauto python_subsyst_impl::clear_adapters() -> void {\n\tadapters_.clear();\n\tdef_adapter_ = nullptr;\n}\n\nauto python_subsyst_impl::adapted_types() const -> std::vector<std::string> {\n\tstd::vector<std::string> res(adapters_.size());\n\tstd::transform(\n\t\tadapters_.begin(), adapters_.end(), res.begin(),\n\t\t[](const auto& A){ return A.first; }\n\t);\n\tif(def_adapter_) res.push_back(\"*\");\n\treturn res;\n}\n\nauto python_subsyst_impl::adapt(sp_obj source) -> py::object {\n\tif(!source) return py::none();\n\t\/\/ check if adpater already created for given object\n\tauto cached_A = acache_.find(sp_obj_hash(source));\n\tif(cached_A != acache_.end())\n\t\treturn cached_A->second;\n\t\/\/ adapt or passthrough\n\tauto pf = adapters_.find(source->type_id());\n\tauto&& obj = std::move(source);\n\tauto A = pf != adapters_.end() ?\n\t\tpf->second(obj) :\n\t\t( def_adapter_ ? def_adapter_(obj) : py::cast(obj) );\n\t\/\/ cache adapter instance\n\tacache_[sp_obj_hash(source)] = A;\n\treturn A;\n}\n\nauto python_subsyst_impl::drop_adapted_cache(const sp_obj& obj) -> std::size_t {\n\tstd::size_t res = 0;\n\tif(!obj) {\n\t\tres = acache_.size();\n\t\tacache_.clear();\n\t}\n\telse {\n\t\tauto cached_A = acache_.find(sp_obj_hash(obj));\n\t\tif(cached_A != acache_.end()) {\n\t\t\tacache_.erase(cached_A);\n\t\t\tres = 1;\n\t\t}\n\t}\n\treturn res;\n}\n\nauto python_subsyst_impl::self() -> python_subsyst_impl& {\n\t\/\/ [NOTE] unconditional cast, because if self() is called, then instance MUST be self for sure\n\treturn static_cast<python_subsyst_impl&>(singleton<python_subsyst>::Instance());\n}\n\nNAMESPACE_END(blue_sky::kernel::detail)\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ optimizer.cpp\n\/\/\n\/\/ Identification: src\/optimizer\/optimizer.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <memory>\n\n#include \"optimizer\/optimizer.h\"\n\n#include \"catalog\/column_catalog.h\"\n#include \"catalog\/manager.h\"\n#include \"catalog\/table_catalog.h\"\n\n#include \"optimizer\/binding.h\"\n#include \"optimizer\/cost_and_stats_calculator.h\"\n#include \"optimizer\/operator_visitor.h\"\n#include \"optimizer\/properties.h\"\n#include \"optimizer\/property_enforcer.h\"\n#include \"optimizer\/query_to_operator_transformer.h\"\n#include \"optimizer\/input_column_deriver.h\"\n#include \"optimizer\/plan_generator.h\"\n#include \"optimizer\/rule.h\"\n#include \"optimizer\/rule_impls.h\"\n#include \"optimizer\/optimizer_task_pool.h\"\n#include \"optimizer\/optimize_context.h\"\n#include \"parser\/create_statement.h\"\n\n#include \"planner\/analyze_plan.h\"\n#include \"planner\/create_plan.h\"\n#include \"planner\/drop_plan.h\"\n#include \"planner\/order_by_plan.h\"\n#include \"planner\/populate_index_plan.h\"\n#include \"planner\/projection_plan.h\"\n#include \"planner\/seq_scan_plan.h\"\n\n#include \"storage\/data_table.h\"\n\n#include \"binder\/bind_node_visitor.h\"\n\nusing std::vector;\nusing std::unordered_map;\nusing std::shared_ptr;\nusing std::unique_ptr;\nusing std::move;\nusing std::pair;\nusing std::make_shared;\n\nnamespace peloton {\nnamespace optimizer {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Optimizer\n\/\/===--------------------------------------------------------------------===\/\/\nOptimizer::Optimizer() {}\n\nvoid Optimizer::OptimizeLoop(int root_group_id,\n                             std::shared_ptr<PropertySet> required_props) {\n  std::shared_ptr<OptimizeContext> root_context =\n      std::make_shared<OptimizeContext>(&metadata_, required_props);\n  auto task_stack = std::unique_ptr<OptimizerTaskStack>(new OptimizerTaskStack());\n  metadata_.SetTaskPool(task_stack.get());\n\n  \/\/ Head group expression with the root group as its only child.\n  \/\/ This object is only used for simplified the logics for the rewrite phase\n  \/\/ std::vector<GroupID> head_child_groups = {root_group_id};\n  \/\/ std::shared_ptr<GroupExpression> head_gexpr =\n  \/\/     std::make_shared<GroupExpression>(Operator(), head_child_groups);\n\n  \/\/ Perform optimization after the rewrite\n  task_stack->Push(new OptimizeGroup(metadata_.memo.GetGroupByID(root_group_id),\n                                     root_context));\n  \/\/ Perform rewrite first\n  \/\/ task_stack->Push(new RewriteExpression(head_gexpr.get(), 0, root_context));\n  task_stack->Push(new TopDownRewrite(root_group_id, root_context,\n                                      RewriteRuleSetName::PREDICATE_PUSH_DOWN));\n\n  \/\/ TODO: Add timer for early stop\n  while (!task_stack->Empty()) {\n    auto task = task_stack->Pop();\n    task->execute();\n  }\n}\n\nshared_ptr<planner::AbstractPlan> Optimizer::BuildPelotonPlanTree(\n    const unique_ptr<parser::SQLStatementList> &parse_tree_list,\n    const std::string default_database_name, concurrency::TransactionContext *txn) {\n  \/\/ Base Case\n  if (parse_tree_list->GetStatements().size() == 0) return nullptr;\n\n  unique_ptr<planner::AbstractPlan> child_plan = nullptr;\n\n  auto parse_tree = parse_tree_list->GetStatements().at(0).get();\n\n  \/\/ Run binder\n  auto bind_node_visitor =\n      make_shared<binder::BindNodeVisitor>(txn, default_database_name);\n  bind_node_visitor->BindNameToNode(parse_tree);\n\n  \/\/ Handle ddl statement\n  bool is_ddl_stmt;\n  auto ddl_plan = HandleDDLStatement(parse_tree, is_ddl_stmt, txn);\n  if (is_ddl_stmt) {\n    return move(ddl_plan);\n  }\n\n  \/\/ Generate initial operator tree from query tree\n  shared_ptr<GroupExpression> gexpr = InsertQueryTree(parse_tree, txn);\n  GroupID root_id = gexpr->GetGroupID();\n  \/\/ Get the physical properties the final plan must output\n  auto query_info = GetQueryInfo(parse_tree);\n\n  OptimizeLoop(root_id, query_info.physical_props);\n\n  try {\n    auto best_plan = ChooseBestPlan(root_id, query_info.physical_props,\n                                    query_info.output_exprs);\n    if (best_plan == nullptr) return nullptr;\n    \/\/ Reset memo after finishing the optimization\n    Reset();\n    \/\/  return shared_ptr<planner::AbstractPlan>(best_plan.release());\n    return move(best_plan);\n  } catch (Exception &e) {\n    Reset();\n    throw e;\n  }\n}\n\nvoid Optimizer::Reset() { metadata_ = OptimizerMetadata(); }\n\nunique_ptr<planner::AbstractPlan> Optimizer::HandleDDLStatement(\n    parser::SQLStatement *tree, bool &is_ddl_stmt,\n    concurrency::TransactionContext *txn) {\n  unique_ptr<planner::AbstractPlan> ddl_plan = nullptr;\n  is_ddl_stmt = true;\n  auto stmt_type = tree->GetType();\n  switch (stmt_type) {\n    case StatementType::DROP: {\n      LOG_TRACE(\"Adding Drop plan...\");\n      unique_ptr<planner::AbstractPlan> drop_plan(\n          new planner::DropPlan((parser::DropStatement *)tree));\n      ddl_plan = move(drop_plan);\n      break;\n    }\n\n    case StatementType::CREATE: {\n      LOG_TRACE(\"Adding Create plan...\");\n\n      \/\/ This is adapted from the simple optimizer\n      auto create_plan =\n          new planner::CreatePlan((parser::CreateStatement *)tree);\n      std::unique_ptr<planner::AbstractPlan> child_CreatePlan(create_plan);\n      ddl_plan = move(child_CreatePlan);\n\n      if (create_plan->GetCreateType() == peloton::CreateType::INDEX) {\n        auto create_stmt = (parser::CreateStatement *)tree;\n        auto target_table = catalog::Catalog::GetInstance()->GetTableWithName(\n            create_stmt->GetDatabaseName(), create_stmt->GetTableName(), txn);\n        std::vector<oid_t> column_ids;\n        \/\/ use catalog object instead of schema to acquire metadata\n        auto table_object = catalog::Catalog::GetInstance()->GetTableObject(\n            create_stmt->GetDatabaseName(), create_stmt->GetTableName(), txn);\n        for (auto column_name : create_plan->GetIndexAttributes()) {\n          auto column_object = table_object->GetColumnObject(column_name);\n          \/\/ Check if column is missing\n          if (column_object == nullptr)\n            throw CatalogException(\n                \"Some columns are missing when create index \" +\n                std::string(create_stmt->index_name));\n          oid_t col_pos = column_object->GetColumnId();\n          column_ids.push_back(col_pos);\n        }\n        \/\/ Create a plan to retrieve data\n        std::unique_ptr<planner::SeqScanPlan> child_SeqScanPlan(\n            new planner::SeqScanPlan(target_table, nullptr, column_ids, false));\n\n        child_SeqScanPlan->AddChild(std::move(ddl_plan));\n        ddl_plan = std::move(child_SeqScanPlan);\n        \/\/ Create a plan to add data to index\n        std::unique_ptr<planner::AbstractPlan> child_PopulateIndexPlan(\n            new planner::PopulateIndexPlan(target_table, column_ids));\n        child_PopulateIndexPlan->AddChild(std::move(ddl_plan));\n        create_plan->SetKeyAttrs(column_ids);\n        ddl_plan = std::move(child_PopulateIndexPlan);\n      }\n      break;\n    }\n    case StatementType::TRANSACTION: {\n      break;\n    }\n    case StatementType::ANALYZE: {\n      LOG_TRACE(\"Adding Analyze plan...\");\n      unique_ptr<planner::AbstractPlan> analyze_plan(new planner::AnalyzePlan(\n          static_cast<parser::AnalyzeStatement *>(tree), txn));\n      ddl_plan = move(analyze_plan);\n      break;\n    }\n    case StatementType::COPY: {\n      LOG_TRACE(\"Adding Copy plan...\");\n      parser::CopyStatement *copy_parse_tree =\n          static_cast<parser::CopyStatement *>(tree);\n      ddl_plan = util::CreateCopyPlan(copy_parse_tree);\n      break;\n    }\n    default:\n      is_ddl_stmt = false;\n  }\n  return ddl_plan;\n}\n\nshared_ptr<GroupExpression> Optimizer::InsertQueryTree(\n    parser::SQLStatement *tree, concurrency::TransactionContext *txn) {\n  QueryToOperatorTransformer converter(txn);\n  shared_ptr<OperatorExpression> initial =\n      converter.ConvertToOpExpression(tree);\n  shared_ptr<GroupExpression> gexpr;\n  metadata_.RecordTransformedExpression(initial, gexpr);\n  return gexpr;\n}\n\nQueryInfo Optimizer::GetQueryInfo(parser::SQLStatement *tree) {\n  auto GetQueryInfoHelper =\n      [](std::vector<unique_ptr<expression::AbstractExpression>> &select_list,\n         std::unique_ptr<parser::OrderDescription> &order_info,\n         std::vector<expression::AbstractExpression *> &output_exprs,\n         std::shared_ptr<PropertySet> &physical_props) {\n        \/\/ Extract output column\n        for (auto &expr : select_list) output_exprs.push_back(expr.get());\n\n        \/\/ Extract sort property\n        if (order_info != nullptr) {\n          std::vector<expression::AbstractExpression *> sort_exprs;\n          std::vector<bool> sort_ascending;\n          for (auto &expr : order_info->exprs) {\n            sort_exprs.push_back(expr.get());\n          }\n          for (auto &type : order_info->types) {\n            sort_ascending.push_back(type == parser::kOrderAsc);\n          }\n          if (!sort_exprs.empty())\n            physical_props->AddProperty(\n                std::make_shared<PropertySort>(sort_exprs, sort_ascending));\n        }\n      };\n\n  std::vector<expression::AbstractExpression *> output_exprs;\n  std::shared_ptr<PropertySet> physical_props = std::make_shared<PropertySet>();\n  switch (tree->GetType()) {\n    case StatementType::SELECT: {\n      auto select = reinterpret_cast<parser::SelectStatement *>(tree);\n      GetQueryInfoHelper(select->select_list, select->order, output_exprs,\n                         physical_props);\n      break;\n    }\n    case StatementType::INSERT: {\n      auto insert = reinterpret_cast<parser::InsertStatement *>(tree);\n      if (insert->select != nullptr)\n        GetQueryInfoHelper(insert->select->select_list, insert->select->order,\n                           output_exprs, physical_props);\n      break;\n    }\n    default:\n      ;\n  }\n\n  return QueryInfo(output_exprs, physical_props);\n}\n\nunique_ptr<planner::AbstractPlan> Optimizer::ChooseBestPlan(\n    GroupID id, std::shared_ptr<PropertySet> required_props,\n    std::vector<expression::AbstractExpression *> required_cols) {\n  Group *group = metadata_.memo.GetGroupByID(id);\n  LOG_TRACE(\"Choosing with property : %s\", required_props->ToString().c_str());\n  auto gexpr = group->GetBestExpression(required_props);\n\n  LOG_TRACE(\"Choosing best plan for group %d with op %s\", gexpr->GetGroupID(),\n            gexpr->Op().name().c_str());\n\n  vector<GroupID> child_groups = gexpr->GetChildGroupIDs();\n  auto required_input_props = gexpr->GetInputProperties(required_props);\n  PL_ASSERT(required_input_props.size() == child_groups.size());\n  \/\/ Firstly derive input\/output columns\n  InputColumnDeriver deriver;\n  auto output_input_cols_pair = deriver.DeriveInputColumns(\n      gexpr, required_props, required_cols, &metadata_.memo);\n  auto &output_cols = output_input_cols_pair.first;\n  auto &input_cols = output_input_cols_pair.second;\n  PL_ASSERT(input_cols.size() == required_input_props.size());\n\n  \/\/ Derive chidren plans first because they are useful in the derivation of\n  \/\/ root plan. Also keep propagate expression to column offset mapping\n  vector<unique_ptr<planner::AbstractPlan>> children_plans;\n  vector<ExprMap> children_expr_map;\n  for (size_t i = 0; i < child_groups.size(); ++i) {\n    ExprMap child_expr_map;\n    for (unsigned offset = 0; offset < input_cols[i].size(); ++offset) {\n      PL_ASSERT(input_cols[i][offset] != nullptr);\n      child_expr_map[input_cols[i][offset]] = offset;\n    }\n    auto child_plan =\n        ChooseBestPlan(child_groups[i], required_input_props[i], input_cols[i]);\n    children_expr_map.push_back(move(child_expr_map));\n    PL_ASSERT(child_plan != nullptr);\n    children_plans.push_back(move(child_plan));\n  }\n\n  \/\/ Derive root plan\n  shared_ptr<OperatorExpression> op =\n      make_shared<OperatorExpression>(gexpr->Op());\n\n  PlanGenerator generator;\n  auto plan = generator.ConvertOpExpression(op, required_props, required_cols,\n                                            output_cols, children_plans,\n                                            children_expr_map);\n\n  LOG_TRACE(\"Finish Choosing best plan for group %d\", id);\n  return plan;\n}\n}  \/\/ namespace optimizer\n}  \/\/ namespace peloton\n<commit_msg>Remove unused code<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ optimizer.cpp\n\/\/\n\/\/ Identification: src\/optimizer\/optimizer.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <memory>\n\n#include \"optimizer\/optimizer.h\"\n\n#include \"catalog\/column_catalog.h\"\n#include \"catalog\/manager.h\"\n#include \"catalog\/table_catalog.h\"\n\n#include \"optimizer\/binding.h\"\n#include \"optimizer\/cost_and_stats_calculator.h\"\n#include \"optimizer\/operator_visitor.h\"\n#include \"optimizer\/properties.h\"\n#include \"optimizer\/property_enforcer.h\"\n#include \"optimizer\/query_to_operator_transformer.h\"\n#include \"optimizer\/input_column_deriver.h\"\n#include \"optimizer\/plan_generator.h\"\n#include \"optimizer\/rule.h\"\n#include \"optimizer\/rule_impls.h\"\n#include \"optimizer\/optimizer_task_pool.h\"\n#include \"optimizer\/optimize_context.h\"\n#include \"parser\/create_statement.h\"\n\n#include \"planner\/analyze_plan.h\"\n#include \"planner\/create_plan.h\"\n#include \"planner\/drop_plan.h\"\n#include \"planner\/order_by_plan.h\"\n#include \"planner\/populate_index_plan.h\"\n#include \"planner\/projection_plan.h\"\n#include \"planner\/seq_scan_plan.h\"\n\n#include \"storage\/data_table.h\"\n\n#include \"binder\/bind_node_visitor.h\"\n\nusing std::vector;\nusing std::unordered_map;\nusing std::shared_ptr;\nusing std::unique_ptr;\nusing std::move;\nusing std::pair;\nusing std::make_shared;\n\nnamespace peloton {\nnamespace optimizer {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Optimizer\n\/\/===--------------------------------------------------------------------===\/\/\nOptimizer::Optimizer() {}\n\nvoid Optimizer::OptimizeLoop(int root_group_id,\n                             std::shared_ptr<PropertySet> required_props) {\n  std::shared_ptr<OptimizeContext> root_context =\n      std::make_shared<OptimizeContext>(&metadata_, required_props);\n  auto task_stack = std::unique_ptr<OptimizerTaskStack>(new OptimizerTaskStack());\n  metadata_.SetTaskPool(task_stack.get());\n\n  \/\/ Head group expression with the root group as its only child.\n  \/\/ This object is only used for simplified the logics for the rewrite phase\n\n  \/\/ Perform optimization after the rewrite\n  task_stack->Push(new OptimizeGroup(metadata_.memo.GetGroupByID(root_group_id),\n                                     root_context));\n  \/\/ Perform rewrite first\n  \/\/ task_stack->Push(new RewriteExpression(head_gexpr.get(), 0, root_context));\n  task_stack->Push(new TopDownRewrite(root_group_id, root_context,\n                                      RewriteRuleSetName::PREDICATE_PUSH_DOWN));\n\n  \/\/ TODO: Add timer for early stop\n  while (!task_stack->Empty()) {\n    auto task = task_stack->Pop();\n    task->execute();\n  }\n}\n\nshared_ptr<planner::AbstractPlan> Optimizer::BuildPelotonPlanTree(\n    const unique_ptr<parser::SQLStatementList> &parse_tree_list,\n    const std::string default_database_name, concurrency::TransactionContext *txn) {\n  \/\/ Base Case\n  if (parse_tree_list->GetStatements().size() == 0) return nullptr;\n\n  unique_ptr<planner::AbstractPlan> child_plan = nullptr;\n\n  auto parse_tree = parse_tree_list->GetStatements().at(0).get();\n\n  \/\/ Run binder\n  auto bind_node_visitor =\n      make_shared<binder::BindNodeVisitor>(txn, default_database_name);\n  bind_node_visitor->BindNameToNode(parse_tree);\n\n  \/\/ Handle ddl statement\n  bool is_ddl_stmt;\n  auto ddl_plan = HandleDDLStatement(parse_tree, is_ddl_stmt, txn);\n  if (is_ddl_stmt) {\n    return move(ddl_plan);\n  }\n\n  \/\/ Generate initial operator tree from query tree\n  shared_ptr<GroupExpression> gexpr = InsertQueryTree(parse_tree, txn);\n  GroupID root_id = gexpr->GetGroupID();\n  \/\/ Get the physical properties the final plan must output\n  auto query_info = GetQueryInfo(parse_tree);\n\n  OptimizeLoop(root_id, query_info.physical_props);\n\n  try {\n    auto best_plan = ChooseBestPlan(root_id, query_info.physical_props,\n                                    query_info.output_exprs);\n    if (best_plan == nullptr) return nullptr;\n    \/\/ Reset memo after finishing the optimization\n    Reset();\n    \/\/  return shared_ptr<planner::AbstractPlan>(best_plan.release());\n    return move(best_plan);\n  } catch (Exception &e) {\n    Reset();\n    throw e;\n  }\n}\n\nvoid Optimizer::Reset() { metadata_ = OptimizerMetadata(); }\n\nunique_ptr<planner::AbstractPlan> Optimizer::HandleDDLStatement(\n    parser::SQLStatement *tree, bool &is_ddl_stmt,\n    concurrency::TransactionContext *txn) {\n  unique_ptr<planner::AbstractPlan> ddl_plan = nullptr;\n  is_ddl_stmt = true;\n  auto stmt_type = tree->GetType();\n  switch (stmt_type) {\n    case StatementType::DROP: {\n      LOG_TRACE(\"Adding Drop plan...\");\n      unique_ptr<planner::AbstractPlan> drop_plan(\n          new planner::DropPlan((parser::DropStatement *)tree));\n      ddl_plan = move(drop_plan);\n      break;\n    }\n\n    case StatementType::CREATE: {\n      LOG_TRACE(\"Adding Create plan...\");\n\n      \/\/ This is adapted from the simple optimizer\n      auto create_plan =\n          new planner::CreatePlan((parser::CreateStatement *)tree);\n      std::unique_ptr<planner::AbstractPlan> child_CreatePlan(create_plan);\n      ddl_plan = move(child_CreatePlan);\n\n      if (create_plan->GetCreateType() == peloton::CreateType::INDEX) {\n        auto create_stmt = (parser::CreateStatement *)tree;\n        auto target_table = catalog::Catalog::GetInstance()->GetTableWithName(\n            create_stmt->GetDatabaseName(), create_stmt->GetTableName(), txn);\n        std::vector<oid_t> column_ids;\n        \/\/ use catalog object instead of schema to acquire metadata\n        auto table_object = catalog::Catalog::GetInstance()->GetTableObject(\n            create_stmt->GetDatabaseName(), create_stmt->GetTableName(), txn);\n        for (auto column_name : create_plan->GetIndexAttributes()) {\n          auto column_object = table_object->GetColumnObject(column_name);\n          \/\/ Check if column is missing\n          if (column_object == nullptr)\n            throw CatalogException(\n                \"Some columns are missing when create index \" +\n                std::string(create_stmt->index_name));\n          oid_t col_pos = column_object->GetColumnId();\n          column_ids.push_back(col_pos);\n        }\n        \/\/ Create a plan to retrieve data\n        std::unique_ptr<planner::SeqScanPlan> child_SeqScanPlan(\n            new planner::SeqScanPlan(target_table, nullptr, column_ids, false));\n\n        child_SeqScanPlan->AddChild(std::move(ddl_plan));\n        ddl_plan = std::move(child_SeqScanPlan);\n        \/\/ Create a plan to add data to index\n        std::unique_ptr<planner::AbstractPlan> child_PopulateIndexPlan(\n            new planner::PopulateIndexPlan(target_table, column_ids));\n        child_PopulateIndexPlan->AddChild(std::move(ddl_plan));\n        create_plan->SetKeyAttrs(column_ids);\n        ddl_plan = std::move(child_PopulateIndexPlan);\n      }\n      break;\n    }\n    case StatementType::TRANSACTION: {\n      break;\n    }\n    case StatementType::ANALYZE: {\n      LOG_TRACE(\"Adding Analyze plan...\");\n      unique_ptr<planner::AbstractPlan> analyze_plan(new planner::AnalyzePlan(\n          static_cast<parser::AnalyzeStatement *>(tree), txn));\n      ddl_plan = move(analyze_plan);\n      break;\n    }\n    case StatementType::COPY: {\n      LOG_TRACE(\"Adding Copy plan...\");\n      parser::CopyStatement *copy_parse_tree =\n          static_cast<parser::CopyStatement *>(tree);\n      ddl_plan = util::CreateCopyPlan(copy_parse_tree);\n      break;\n    }\n    default:\n      is_ddl_stmt = false;\n  }\n  return ddl_plan;\n}\n\nshared_ptr<GroupExpression> Optimizer::InsertQueryTree(\n    parser::SQLStatement *tree, concurrency::TransactionContext *txn) {\n  QueryToOperatorTransformer converter(txn);\n  shared_ptr<OperatorExpression> initial =\n      converter.ConvertToOpExpression(tree);\n  shared_ptr<GroupExpression> gexpr;\n  metadata_.RecordTransformedExpression(initial, gexpr);\n  return gexpr;\n}\n\nQueryInfo Optimizer::GetQueryInfo(parser::SQLStatement *tree) {\n  auto GetQueryInfoHelper =\n      [](std::vector<unique_ptr<expression::AbstractExpression>> &select_list,\n         std::unique_ptr<parser::OrderDescription> &order_info,\n         std::vector<expression::AbstractExpression *> &output_exprs,\n         std::shared_ptr<PropertySet> &physical_props) {\n        \/\/ Extract output column\n        for (auto &expr : select_list) output_exprs.push_back(expr.get());\n\n        \/\/ Extract sort property\n        if (order_info != nullptr) {\n          std::vector<expression::AbstractExpression *> sort_exprs;\n          std::vector<bool> sort_ascending;\n          for (auto &expr : order_info->exprs) {\n            sort_exprs.push_back(expr.get());\n          }\n          for (auto &type : order_info->types) {\n            sort_ascending.push_back(type == parser::kOrderAsc);\n          }\n          if (!sort_exprs.empty())\n            physical_props->AddProperty(\n                std::make_shared<PropertySort>(sort_exprs, sort_ascending));\n        }\n      };\n\n  std::vector<expression::AbstractExpression *> output_exprs;\n  std::shared_ptr<PropertySet> physical_props = std::make_shared<PropertySet>();\n  switch (tree->GetType()) {\n    case StatementType::SELECT: {\n      auto select = reinterpret_cast<parser::SelectStatement *>(tree);\n      GetQueryInfoHelper(select->select_list, select->order, output_exprs,\n                         physical_props);\n      break;\n    }\n    case StatementType::INSERT: {\n      auto insert = reinterpret_cast<parser::InsertStatement *>(tree);\n      if (insert->select != nullptr)\n        GetQueryInfoHelper(insert->select->select_list, insert->select->order,\n                           output_exprs, physical_props);\n      break;\n    }\n    default:\n      ;\n  }\n\n  return QueryInfo(output_exprs, physical_props);\n}\n\nunique_ptr<planner::AbstractPlan> Optimizer::ChooseBestPlan(\n    GroupID id, std::shared_ptr<PropertySet> required_props,\n    std::vector<expression::AbstractExpression *> required_cols) {\n  Group *group = metadata_.memo.GetGroupByID(id);\n  LOG_TRACE(\"Choosing with property : %s\", required_props->ToString().c_str());\n  auto gexpr = group->GetBestExpression(required_props);\n\n  LOG_TRACE(\"Choosing best plan for group %d with op %s\", gexpr->GetGroupID(),\n            gexpr->Op().name().c_str());\n\n  vector<GroupID> child_groups = gexpr->GetChildGroupIDs();\n  auto required_input_props = gexpr->GetInputProperties(required_props);\n  PL_ASSERT(required_input_props.size() == child_groups.size());\n  \/\/ Firstly derive input\/output columns\n  InputColumnDeriver deriver;\n  auto output_input_cols_pair = deriver.DeriveInputColumns(\n      gexpr, required_props, required_cols, &metadata_.memo);\n  auto &output_cols = output_input_cols_pair.first;\n  auto &input_cols = output_input_cols_pair.second;\n  PL_ASSERT(input_cols.size() == required_input_props.size());\n\n  \/\/ Derive chidren plans first because they are useful in the derivation of\n  \/\/ root plan. Also keep propagate expression to column offset mapping\n  vector<unique_ptr<planner::AbstractPlan>> children_plans;\n  vector<ExprMap> children_expr_map;\n  for (size_t i = 0; i < child_groups.size(); ++i) {\n    ExprMap child_expr_map;\n    for (unsigned offset = 0; offset < input_cols[i].size(); ++offset) {\n      PL_ASSERT(input_cols[i][offset] != nullptr);\n      child_expr_map[input_cols[i][offset]] = offset;\n    }\n    auto child_plan =\n        ChooseBestPlan(child_groups[i], required_input_props[i], input_cols[i]);\n    children_expr_map.push_back(move(child_expr_map));\n    PL_ASSERT(child_plan != nullptr);\n    children_plans.push_back(move(child_plan));\n  }\n\n  \/\/ Derive root plan\n  shared_ptr<OperatorExpression> op =\n      make_shared<OperatorExpression>(gexpr->Op());\n\n  PlanGenerator generator;\n  auto plan = generator.ConvertOpExpression(op, required_props, required_cols,\n                                            output_cols, children_plans,\n                                            children_expr_map);\n\n  LOG_TRACE(\"Finish Choosing best plan for group %d\", id);\n  return plan;\n}\n}  \/\/ namespace optimizer\n}  \/\/ namespace peloton\n<|endoftext|>"}
{"text":"<commit_before>\/** \\copyright\n * Copyright (c) 2012, Stuart W Baker\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 HwInit.cxx\n * This file represents the hardware initialization for the TI Tiva MCU.\n *\n * @author Stuart W. Baker\n * @date 5 January 2013\n *\/\n\n#include <new>\n#include <cstdint>\n\n#include \"inc\/hw_types.h\"\n#include \"inc\/hw_memmap.h\"\n#include \"inc\/hw_ints.h\"\n#include \"driverlib\/rom.h\"\n#include \"driverlib\/rom_map.h\"\n#include \"driverlib\/sysctl.h\"\n#include \"driverlib\/gpio.h\"\n#include \"driverlib\/timer.h\"\n#include \"driverlib\/interrupt.h\"\n#include \"driverlib\/pin_map.h\"\n#include \"os\/OS.hxx\"\n#include \"TivaDev.hxx\"\n#include \"TivaDCC.hxx\"\n#include \"TivaEEPROMEmulation.hxx\"\n\nstruct Debug {\n  \/\/ High between start_cutout and end_cutout from the TivaRailcom driver.\n  typedef DummyPin RailcomDriverCutout;\n  \/\/ Flips every time an uart byte is received error.\n  typedef DummyPin RailcomError;\n  \/\/ Flips every time an 'E0' byte is received in the railcom driver.\n  typedef DummyPin RailcomE0;\n  \/\/ Sets to 1 if we have seen any data from the railcom uart.\n  typedef DummyPin RailcomAnyData;\n  \/\/ Flips for every byte from the railcom uart.\n  typedef DummyPin RailcomDataReceived;\n  \/\/ Flipped for every packet that is sent from the railcom layer to the\n  \/\/ application.\n  typedef DummyPin RailcomPackets;\n};\n#include \"TivaRailcom.hxx\"\n\n\/** override stdin *\/\nconst char *STDIN_DEVICE = \"\/dev\/ser0\";\n\n\/** override stdout *\/\nconst char *STDOUT_DEVICE = \"\/dev\/ser0\";\n\n\/** override stderr *\/\nconst char *STDERR_DEVICE = \"\/dev\/ser0\";\n\n\/** USB Device CDC serial driver instance *\/\nstatic TivaCdc cdc0(\"\/dev\/serUSB0\", INT_RESOLVE(INT_USB0_, 0));\n\n\/** UART 0 serial driver instance *\/\nstatic TivaUart uart0(\"\/dev\/ser0\", UART0_BASE, INT_RESOLVE(INT_UART0_, 0));\n\n\/** CAN 0 CAN driver instance *\/\nstatic TivaCan can0(\"\/dev\/can0\", CAN0_BASE, INT_RESOLVE(INT_CAN0_, 0));\n\nextern const uint16_t __eeprom_start[];\nconst uint16_t* const TivaEEPROMEmulation::raw = __eeprom_start;\nextern const uint16_t __eeprom_end[];\nconst size_t TivaEEPROMEmulation::FLASH_SIZE = __eeprom_end - __eeprom_start;\n\nstatic TivaEEPROMEmulation eeprom(\"\/dev\/eeprom\", 256);\n\n#define ONE_BIT_HALF_PERIOD  4480\n#define ZERO_BIT_HALF_PERIOD 8000\n#define STARTUP_DELAY_CYCLES 2\n#define DEADBAND_ADJUST      80\n\n#define DECL_PIN(NAME, PORT, NUM)                \\\n  static const auto NAME##_PERIPH = SYSCTL_PERIPH_GPIO##PORT; \\\n  static const auto NAME##_BASE = GPIO_PORT##PORT##_BASE; \\\n  static const auto NAME##_PIN = GPIO_PIN_##NUM\n\n\nstruct RailcomDefs\n{\n    static const uint32_t CHANNEL_COUNT = 1;\n    static const uint32_t UART_PERIPH[CHANNEL_COUNT];\n    static const uint32_t UART_BASE[CHANNEL_COUNT];\n    \/\/ Make sure there are enough entries here for all the channels times a few\n    \/\/ DCC packets.\n    static const uint32_t Q_SIZE = 6;\n\n    static const auto OS_INTERRUPT = INT_UART1;\n\n    GPIO_HWPIN(CH1, GpioHwPin, B, 0, U1RX);\n\n    static void hw_init() {\n         CH1_Pin::hw_init();\n    }\n\n    static void set_input() {\n        CH1_Pin::set_input();\n    }\n\n    static void set_hw() {\n        CH1_Pin::set_hw();\n    }\n\n    \/** @returns a bitmask telling which pins are active. Bit 0 will be set if\n     * channel 0 is active (drawing current).*\/\n    static uint8_t sample() {\n        uint8_t ret = 0;\n        if (!CH1_Pin::get()) ret |= 1;\n        return ret;\n    }\n};\n\nconst uint32_t RailcomDefs::UART_BASE[] = {UART1_BASE};\nconst uint32_t RailcomDefs::UART_PERIPH[] = {SYSCTL_PERIPH_UART1};\n\nstatic TivaRailcomDriver<RailcomDefs> railcom_driver(\"\/dev\/railcom\");\n\nstruct DccHwDefs {\n  \/\/\/ base address of a capture compare pwm timer pair\n  static const unsigned long CCP_BASE = TIMER0_BASE;\n  \/\/\/ an otherwise unused interrupt number (could be that of the capture compare pwm timer)\n  static const unsigned long OS_INTERRUPT = INT_TIMER0A;\n  \/\/\/ base address of an interval timer\n  static const unsigned long INTERVAL_BASE = TIMER1_BASE;\n  \/\/\/ interrupt number of the interval timer\n  static const unsigned long INTERVAL_INTERRUPT = INT_TIMER1A;\n\n  \/** These timer blocks will be synchronized once per packet, when the\n   *  deadband delay is set up. *\/\n  static const auto TIMER_SYNC = TIMER_0A_SYNC | TIMER_0B_SYNC | TIMER_1A_SYNC | TIMER_1B_SYNC;\n\n  \/\/ Peripherals to enable at boot.\n  static const auto CCP_PERIPH = SYSCTL_PERIPH_TIMER1;\n  static const auto INTERVAL_PERIPH = SYSCTL_PERIPH_TIMER0;\n  static const auto PIN_H_GPIO_PERIPH = SYSCTL_PERIPH_GPIOB;\n  static const auto PIN_L_GPIO_PERIPH = SYSCTL_PERIPH_GPIOB;\n\n  static const auto PIN_H_GPIO_CONFIG = GPIO_PB6_T0CCP0;\n  static const auto PIN_L_GPIO_CONFIG = GPIO_PB7_T0CCP1;\n\n  static const auto PIN_H_GPIO_BASE = GPIO_PORTB_BASE;\n  static const auto PIN_L_GPIO_BASE = GPIO_PORTB_BASE;\n\n  static const auto PIN_H_GPIO_PIN = GPIO_PIN_6;\n  static const auto PIN_L_GPIO_PIN = GPIO_PIN_7;\n\n  \/** Defines whether the high driver pin is inverted or not. A non-inverted\n   *  (value==false) pin will be driven high during the first half of the DCC\n   *  bit (minus H_DEADBAND_DELAY_NSEC at the end), and low during the second\n   *  half.  A non-inverted pin will be driven low as safe setting at\n   *  startup. *\/\n  static const bool PIN_H_INVERT = false;\n\n  \/** Defines whether the drive-low pin is inverted or not. A non-inverted pin\n   *  (value==false) will be driven high during the second half of the DCC bit\n   *  (minus L_DEADBAND_DELAY_NSEC), and low during the first half.  A\n   *  non-inverted pin will be driven low as safe setting at startup. *\/\n  static const bool PIN_L_INVERT = false;\n  \n  \/** @returns the number of preamble bits to send exclusive of end of packet\n   *  '1' bit *\/\n  static int dcc_preamble_count() { return 16; }\n\n  static void flip_led() {}\n\n  \/** the time (in nanoseconds) to wait between turning off the low driver and\n   * turning on the high driver. *\/\n  static const int H_DEADBAND_DELAY_NSEC = 250;\n  \/** the time (in nanoseconds) to wait between turning off the high driver and\n   * turning on the low driver. *\/\n  static const int L_DEADBAND_DELAY_NSEC = 250;\n\n  \/** @returns true to produce the RailCom cutout, else false *\/\n  static bool railcom_cutout() { return false; }\n\n  \/** number of outgoing messages we can queue *\/\n  static const size_t Q_SIZE = 4;\n\n\n  \/\/ Pins defined for railcom\n  \/\/DECL_PIN(RAILCOM_TRIGGER, B, 4);\n  DECL_PIN(RAILCOM_TRIGGER, D, 6);\n  static const auto RAILCOM_TRIGGER_INVERT = true;\n\n  static const auto RAILCOM_UART_BASE = UART1_BASE;\n  static const auto RAILCOM_UART_PERIPH = SYSCTL_PERIPH_UART1;\n  DECL_PIN(RAILCOM_UARTPIN, B, 0);\n  static const auto RAILCOM_UARTPIN_CONFIG = GPIO_PB0_U1RX;\n};\n\n\nstatic TivaDCC<DccHwDefs> tivaDCC(\"\/dev\/mainline\", &railcom_driver);\n\nextern \"C\" {\n\/** Blink LED *\/\nuint32_t blinker_pattern = 0;\nstatic uint32_t rest_pattern = 0;\n\nvoid dcc_generator_init(void);\n\nvoid hw_set_to_safe(void)\n{\n    tivaDCC.disable_output();\n}\n\nvoid resetblink(uint32_t pattern)\n{\n    blinker_pattern = pattern;\n    \/* make a timer event trigger immediately *\/\n}\n\nvoid setblink(uint32_t pattern)\n{\n    resetblink(pattern);\n}\n\nvoid timer5a_interrupt_handler(void)\n{\n    \/\/\n    \/\/ Clear the timer interrupt.\n    \/\/\n    MAP_TimerIntClear(TIMER5_BASE, TIMER_TIMA_TIMEOUT);\n    \/\/ Set output LED.\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_1,\n                     (rest_pattern & 1) ? GPIO_PIN_1 : 0);\n    \/\/ Shift and maybe reset pattern.\n    rest_pattern >>= 1;\n    if (!rest_pattern)\n        rest_pattern = blinker_pattern;\n}\n\nvoid uart1_interrupt_handler(void)\n{\n  railcom_driver.os_interrupt_handler();\n}\n\nvoid diewith(uint32_t pattern)\n{\n    vPortClearInterruptMask(0x20);\n    asm(\"cpsie i\\n\");\n\n    resetblink(pattern);\n    while (1)\n        ;\n}\n\n\n\/** Initialize the processor hardware.\n *\/\nvoid hw_preinit(void)\n{\n    \/* Globally disables interrupts until the FreeRTOS scheduler is up. *\/\n    asm(\"cpsid i\\n\");\n\n    \/* Setup the system clock. *\/\n    MAP_SysCtlClockSet(SYSCTL_SYSDIV_2_5 | SYSCTL_USE_PLL | SYSCTL_OSC_MAIN |\n                       SYSCTL_XTAL_16MHZ);\n\n    \/* Red LED pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOF);\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_1, GPIO_PIN_1);\n    MAP_GPIOPinTypeGPIOOutput(GPIO_PORTF_BASE, GPIO_PIN_1);\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_1, GPIO_PIN_1);\n\n    \/* Blinker timer initialization. *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_TIMER5);\n    MAP_TimerConfigure(TIMER5_BASE, TIMER_CFG_PERIODIC);\n    MAP_TimerLoadSet(TIMER5_BASE, TIMER_A, MAP_SysCtlClockGet() \/ 8);\n    MAP_IntEnable(INT_TIMER5A);\n\n    \/* This interrupt should hit even during kernel operations. *\/\n    MAP_IntPrioritySet(INT_TIMER5A, 0);\n    MAP_TimerIntEnable(TIMER5_BASE, TIMER_TIMA_TIMEOUT);\n    MAP_TimerEnable(TIMER5_BASE, TIMER_A);\n\n    \/* UART0 pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOA);\n    MAP_GPIOPinConfigure(GPIO_PA0_U0RX);\n    MAP_GPIOPinConfigure(GPIO_PA1_U0TX);\n    MAP_GPIOPinTypeUART(GPIO_PORTA_BASE, GPIO_PIN_0 | GPIO_PIN_1);\n\n    \/* USB0 pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOD);\n    MAP_GPIOPinTypeUSBAnalog(GPIO_PORTD_BASE, GPIO_PIN_5 | GPIO_PIN_4);\n\n    \/* CAN pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOE);\n    MAP_GPIOPinConfigure(GPIO_PE4_CAN0RX);\n    MAP_GPIOPinConfigure(GPIO_PE5_CAN0TX);\n    MAP_GPIOPinTypeCAN(GPIO_PORTE_BASE, GPIO_PIN_4 | GPIO_PIN_5);\n\n    \/* Blue LED pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOF);\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_2, GPIO_PIN_2);\n    MAP_GPIOPinTypeGPIOOutput(GPIO_PORTF_BASE, GPIO_PIN_2);\n\n    \/* Green LED pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOF);\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_3, GPIO_PIN_3);\n    MAP_GPIOPinTypeGPIOOutput(GPIO_PORTF_BASE, GPIO_PIN_3);\n\n    \/* USB interrupt priority *\/\n    MAP_IntPrioritySet(INT_USB0, 0xff); \/\/ USB interrupt low priority\n\n    \/* Initialize the DCC Timers and GPIO outputs *\/\n    tivaDCC.hw_init();\n}\n\n\/** Timer interrupt for DCC packet handling.\n *\/\nvoid timer1a_interrupt_handler(void)\n{\n    tivaDCC.interrupt_handler();\n}\n\n}\n<commit_msg>Adds an optional delay into the boot process to catch potential crashes in the debugger before they occur.<commit_after>\/** \\copyright\n * Copyright (c) 2012, Stuart W Baker\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 HwInit.cxx\n * This file represents the hardware initialization for the TI Tiva MCU.\n *\n * @author Stuart W. Baker\n * @date 5 January 2013\n *\/\n\n#include <new>\n#include <cstdint>\n\n#include \"inc\/hw_types.h\"\n#include \"inc\/hw_memmap.h\"\n#include \"inc\/hw_ints.h\"\n#include \"driverlib\/rom.h\"\n#include \"driverlib\/rom_map.h\"\n#include \"driverlib\/sysctl.h\"\n#include \"driverlib\/gpio.h\"\n#include \"driverlib\/timer.h\"\n#include \"driverlib\/interrupt.h\"\n#include \"driverlib\/pin_map.h\"\n#include \"os\/OS.hxx\"\n#include \"TivaDev.hxx\"\n#include \"TivaDCC.hxx\"\n#include \"TivaEEPROMEmulation.hxx\"\n\nstruct Debug {\n  \/\/ High between start_cutout and end_cutout from the TivaRailcom driver.\n  typedef DummyPin RailcomDriverCutout;\n  \/\/ Flips every time an uart byte is received error.\n  typedef DummyPin RailcomError;\n  \/\/ Flips every time an 'E0' byte is received in the railcom driver.\n  typedef DummyPin RailcomE0;\n  \/\/ Sets to 1 if we have seen any data from the railcom uart.\n  typedef DummyPin RailcomAnyData;\n  \/\/ Flips for every byte from the railcom uart.\n  typedef DummyPin RailcomDataReceived;\n  \/\/ Flipped for every packet that is sent from the railcom layer to the\n  \/\/ application.\n  typedef DummyPin RailcomPackets;\n};\n#include \"TivaRailcom.hxx\"\n#include \"TivaGPIO.hxx\"\n\nGPIO_PIN(SW1, GpioInputPU, F, 4);\n\n\/** override stdin *\/\nconst char *STDIN_DEVICE = \"\/dev\/ser0\";\n\n\/** override stdout *\/\nconst char *STDOUT_DEVICE = \"\/dev\/ser0\";\n\n\/** override stderr *\/\nconst char *STDERR_DEVICE = \"\/dev\/ser0\";\n\n\/** USB Device CDC serial driver instance *\/\nstatic TivaCdc cdc0(\"\/dev\/serUSB0\", INT_RESOLVE(INT_USB0_, 0));\n\n\/** UART 0 serial driver instance *\/\nstatic TivaUart uart0(\"\/dev\/ser0\", UART0_BASE, INT_RESOLVE(INT_UART0_, 0));\n\n\/** CAN 0 CAN driver instance *\/\nstatic TivaCan can0(\"\/dev\/can0\", CAN0_BASE, INT_RESOLVE(INT_CAN0_, 0));\n\nextern const uint16_t __eeprom_start[];\nconst uint16_t* const TivaEEPROMEmulation::raw = __eeprom_start;\nextern const uint16_t __eeprom_end[];\nconst size_t TivaEEPROMEmulation::FLASH_SIZE = __eeprom_end - __eeprom_start;\n\nstatic TivaEEPROMEmulation eeprom(\"\/dev\/eeprom\", 256);\n\n#define ONE_BIT_HALF_PERIOD  4480\n#define ZERO_BIT_HALF_PERIOD 8000\n#define STARTUP_DELAY_CYCLES 2\n#define DEADBAND_ADJUST      80\n\n#define DECL_PIN(NAME, PORT, NUM)                \\\n  static const auto NAME##_PERIPH = SYSCTL_PERIPH_GPIO##PORT; \\\n  static const auto NAME##_BASE = GPIO_PORT##PORT##_BASE; \\\n  static const auto NAME##_PIN = GPIO_PIN_##NUM\n\n\nstruct RailcomDefs\n{\n    static const uint32_t CHANNEL_COUNT = 1;\n    static const uint32_t UART_PERIPH[CHANNEL_COUNT];\n    static const uint32_t UART_BASE[CHANNEL_COUNT];\n    \/\/ Make sure there are enough entries here for all the channels times a few\n    \/\/ DCC packets.\n    static const uint32_t Q_SIZE = 6;\n\n    static const auto OS_INTERRUPT = INT_UART1;\n\n    GPIO_HWPIN(CH1, GpioHwPin, B, 0, U1RX);\n\n    static void hw_init() {\n         CH1_Pin::hw_init();\n    }\n\n    static void set_input() {\n        CH1_Pin::set_input();\n    }\n\n    static void set_hw() {\n        CH1_Pin::set_hw();\n    }\n\n    \/** @returns a bitmask telling which pins are active. Bit 0 will be set if\n     * channel 0 is active (drawing current).*\/\n    static uint8_t sample() {\n        uint8_t ret = 0;\n        if (!CH1_Pin::get()) ret |= 1;\n        return ret;\n    }\n};\n\nconst uint32_t RailcomDefs::UART_BASE[] = {UART1_BASE};\nconst uint32_t RailcomDefs::UART_PERIPH[] = {SYSCTL_PERIPH_UART1};\n\nstatic TivaRailcomDriver<RailcomDefs> railcom_driver(\"\/dev\/railcom\");\n\nstruct DccHwDefs {\n  \/\/\/ base address of a capture compare pwm timer pair\n  static const unsigned long CCP_BASE = TIMER0_BASE;\n  \/\/\/ an otherwise unused interrupt number (could be that of the capture compare pwm timer)\n  static const unsigned long OS_INTERRUPT = INT_TIMER0A;\n  \/\/\/ base address of an interval timer\n  static const unsigned long INTERVAL_BASE = TIMER1_BASE;\n  \/\/\/ interrupt number of the interval timer\n  static const unsigned long INTERVAL_INTERRUPT = INT_TIMER1A;\n\n  \/** These timer blocks will be synchronized once per packet, when the\n   *  deadband delay is set up. *\/\n  static const auto TIMER_SYNC = TIMER_0A_SYNC | TIMER_0B_SYNC | TIMER_1A_SYNC | TIMER_1B_SYNC;\n\n  \/\/ Peripherals to enable at boot.\n  static const auto CCP_PERIPH = SYSCTL_PERIPH_TIMER1;\n  static const auto INTERVAL_PERIPH = SYSCTL_PERIPH_TIMER0;\n  static const auto PIN_H_GPIO_PERIPH = SYSCTL_PERIPH_GPIOB;\n  static const auto PIN_L_GPIO_PERIPH = SYSCTL_PERIPH_GPIOB;\n\n  static const auto PIN_H_GPIO_CONFIG = GPIO_PB6_T0CCP0;\n  static const auto PIN_L_GPIO_CONFIG = GPIO_PB7_T0CCP1;\n\n  static const auto PIN_H_GPIO_BASE = GPIO_PORTB_BASE;\n  static const auto PIN_L_GPIO_BASE = GPIO_PORTB_BASE;\n\n  static const auto PIN_H_GPIO_PIN = GPIO_PIN_6;\n  static const auto PIN_L_GPIO_PIN = GPIO_PIN_7;\n\n  \/** Defines whether the high driver pin is inverted or not. A non-inverted\n   *  (value==false) pin will be driven high during the first half of the DCC\n   *  bit (minus H_DEADBAND_DELAY_NSEC at the end), and low during the second\n   *  half.  A non-inverted pin will be driven low as safe setting at\n   *  startup. *\/\n  static const bool PIN_H_INVERT = false;\n\n  \/** Defines whether the drive-low pin is inverted or not. A non-inverted pin\n   *  (value==false) will be driven high during the second half of the DCC bit\n   *  (minus L_DEADBAND_DELAY_NSEC), and low during the first half.  A\n   *  non-inverted pin will be driven low as safe setting at startup. *\/\n  static const bool PIN_L_INVERT = false;\n  \n  \/** @returns the number of preamble bits to send exclusive of end of packet\n   *  '1' bit *\/\n  static int dcc_preamble_count() { return 16; }\n\n  static void flip_led() {}\n\n  \/** the time (in nanoseconds) to wait between turning off the low driver and\n   * turning on the high driver. *\/\n  static const int H_DEADBAND_DELAY_NSEC = 250;\n  \/** the time (in nanoseconds) to wait between turning off the high driver and\n   * turning on the low driver. *\/\n  static const int L_DEADBAND_DELAY_NSEC = 250;\n\n  \/** @returns true to produce the RailCom cutout, else false *\/\n  static bool railcom_cutout() { return false; }\n\n  \/** number of outgoing messages we can queue *\/\n  static const size_t Q_SIZE = 4;\n\n\n  \/\/ Pins defined for railcom\n  \/\/DECL_PIN(RAILCOM_TRIGGER, B, 4);\n  DECL_PIN(RAILCOM_TRIGGER, D, 6);\n  static const auto RAILCOM_TRIGGER_INVERT = true;\n\n  static const auto RAILCOM_UART_BASE = UART1_BASE;\n  static const auto RAILCOM_UART_PERIPH = SYSCTL_PERIPH_UART1;\n  DECL_PIN(RAILCOM_UARTPIN, B, 0);\n  static const auto RAILCOM_UARTPIN_CONFIG = GPIO_PB0_U1RX;\n};\n\n\nstatic TivaDCC<DccHwDefs> tivaDCC(\"\/dev\/mainline\", &railcom_driver);\n\nextern \"C\" {\n\/** Blink LED *\/\nuint32_t blinker_pattern = 0;\nstatic volatile uint32_t rest_pattern = 0;\n\nvoid dcc_generator_init(void);\n\nvoid hw_set_to_safe(void)\n{\n    tivaDCC.disable_output();\n}\n\nvoid resetblink(uint32_t pattern)\n{\n    blinker_pattern = pattern;\n    \/* make a timer event trigger immediately *\/\n}\n\nvoid setblink(uint32_t pattern)\n{\n    resetblink(pattern);\n}\n\nvoid timer5a_interrupt_handler(void)\n{\n    \/\/\n    \/\/ Clear the timer interrupt.\n    \/\/\n    MAP_TimerIntClear(TIMER5_BASE, TIMER_TIMA_TIMEOUT);\n    \/\/ Set output LED.\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_1,\n                     (rest_pattern & 1) ? GPIO_PIN_1 : 0);\n    \/\/ Shift and maybe reset pattern.\n    rest_pattern >>= 1;\n    if (!rest_pattern)\n        rest_pattern = blinker_pattern;\n}\n\nvoid uart1_interrupt_handler(void)\n{\n  railcom_driver.os_interrupt_handler();\n}\n\nvoid diewith(uint32_t pattern)\n{\n    vPortClearInterruptMask(0x20);\n    asm(\"cpsie i\\n\");\n\n    resetblink(pattern);\n    while (1)\n        ;\n}\n\n\n\/** Initialize the processor hardware.\n *\/\nvoid hw_preinit(void)\n{\n    \/* Globally disables interrupts until the FreeRTOS scheduler is up. *\/\n    asm(\"cpsid i\\n\");\n\n    \/* Setup the system clock. *\/\n    MAP_SysCtlClockSet(SYSCTL_SYSDIV_2_5 | SYSCTL_USE_PLL | SYSCTL_OSC_MAIN |\n                       SYSCTL_XTAL_16MHZ);\n\n    \/* Red LED pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOF);\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_1, GPIO_PIN_1);\n    MAP_GPIOPinTypeGPIOOutput(GPIO_PORTF_BASE, GPIO_PIN_1);\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_1, GPIO_PIN_1);\n\n    \/* Blinker timer initialization. *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_TIMER5);\n    MAP_TimerConfigure(TIMER5_BASE, TIMER_CFG_PERIODIC);\n    MAP_TimerLoadSet(TIMER5_BASE, TIMER_A, MAP_SysCtlClockGet() \/ 8);\n    MAP_IntEnable(INT_TIMER5A);\n\n    \/* This interrupt should hit even during kernel operations. *\/\n    MAP_IntPrioritySet(INT_TIMER5A, 0);\n    MAP_TimerIntEnable(TIMER5_BASE, TIMER_TIMA_TIMEOUT);\n    MAP_TimerEnable(TIMER5_BASE, TIMER_A);\n\n    \/* UART0 pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOA);\n    MAP_GPIOPinConfigure(GPIO_PA0_U0RX);\n    MAP_GPIOPinConfigure(GPIO_PA1_U0TX);\n    MAP_GPIOPinTypeUART(GPIO_PORTA_BASE, GPIO_PIN_0 | GPIO_PIN_1);\n\n    \/* USB0 pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOD);\n    MAP_GPIOPinTypeUSBAnalog(GPIO_PORTD_BASE, GPIO_PIN_5 | GPIO_PIN_4);\n\n    \/* CAN pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOE);\n    MAP_GPIOPinConfigure(GPIO_PE4_CAN0RX);\n    MAP_GPIOPinConfigure(GPIO_PE5_CAN0TX);\n    MAP_GPIOPinTypeCAN(GPIO_PORTE_BASE, GPIO_PIN_4 | GPIO_PIN_5);\n\n    \/* Blue LED pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOF);\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_2, GPIO_PIN_2);\n    MAP_GPIOPinTypeGPIOOutput(GPIO_PORTF_BASE, GPIO_PIN_2);\n\n    \/* Green LED pin initialization *\/\n    MAP_SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOF);\n    MAP_GPIOPinWrite(GPIO_PORTF_BASE, GPIO_PIN_3, GPIO_PIN_3);\n    MAP_GPIOPinTypeGPIOOutput(GPIO_PORTF_BASE, GPIO_PIN_3);\n\n    \/* USB interrupt priority *\/\n    MAP_IntPrioritySet(INT_USB0, 0xff); \/\/ USB interrupt low priority\n\n    \/* Initialize the DCC Timers and GPIO outputs *\/\n    tivaDCC.hw_init();\n\n    SW1_Pin::hw_init();\n    \/* Checks the SW1 pin at boot time in case we want to allow for a debugger\n     * to connect. *\/\n    asm volatile (\"cpsie i\\n\");\n    do {\n      if (!SW1_Pin::get()) {\n        blinker_pattern = 0xAAAA;\n      } else {\n        blinker_pattern = 0;\n      }\n    } while (blinker_pattern || rest_pattern);\n    asm volatile (\"cpsid i\\n\");\n}\n\n\/** Timer interrupt for DCC packet handling.\n *\/\nvoid timer1a_interrupt_handler(void)\n{\n    tivaDCC.interrupt_handler();\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ transaction_context.cpp\n\/\/\n\/\/ Identification: src\/concurrency\/transaction_context.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"concurrency\/transaction_context.h\"\n\n#include <sstream>\n\n#include \"common\/logger.h\"\n#include \"common\/macros.h\"\n#include \"common\/platform.h\"\n#include \"trigger\/trigger.h\"\n\n#include <chrono>\n#include <iomanip>\n#include <thread>\n\nnamespace peloton {\nnamespace concurrency {\n\n\/*\n * TransactionContext state transition:\n *                r           r\/ro            u\/r\/ro\n *              +--<--+     +---<--+        +---<--+\n *           r  |     |     |      |        |      |     d\n *  (init)-->-- +-> Read  --+-> Read Own ---+--> Update ---> Delete (final)\n *                    |   ro             u  |\n *                    |                     |\n *                    +----->--------->-----+\n *                              u\n *              r\/ro\/u\n *            +---<---+\n *         i  |       |     d\n *  (init)-->-+---> Insert ---> Ins_Del (final)\n *\n *    r : read\n *    ro: read_own\n *    u : update\n *    d : delete\n *    i : insert\n *\/\n\nTransactionContext::TransactionContext(const size_t thread_id,\n                                       const IsolationLevelType isolation,\n                                       const cid_t &read_id) {\n  Init(thread_id, isolation, read_id);\n}\n\nTransactionContext::TransactionContext(const size_t thread_id,\n                                       const IsolationLevelType isolation,\n                                       const cid_t &read_id,\n                                       const cid_t &commit_id) {\n  Init(thread_id, isolation, read_id, commit_id);\n}\n\nvoid TransactionContext::Init(const size_t thread_id,\n                              const IsolationLevelType isolation,\n                              const cid_t &read_id, const cid_t &commit_id) {\n  read_id_ = read_id;\n\n  \/\/ commit id can be set at a transaction's commit phase.\n  commit_id_ = commit_id;\n\n  \/\/ set txn_id to commit_id.\n  txn_id_ = commit_id_;\n\n  epoch_id_ = read_id_ >> 32;\n\n  thread_id_ = thread_id;\n\n  is_written_ = false;\n\n  isolation_level_ = isolation;\n\n  gc_set_ = std::make_shared<GCSet>();\n  gc_object_set_ = std::make_shared<GCObjectSet>();\n\n  on_commit_triggers_.reset();\n}\n\nRWType TransactionContext::GetRWType(const ItemPointer &location) {\n  const auto rw_set_it = rw_set_.find(location);\n  if (rw_set_it != rw_set_.end()) {\n    return rw_set_it->second;\n  }\n  return RWType::INVALID;\n}\n\nvoid TransactionContext::RecordRead(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end() ||\n                 (rw_set_[location] != RWType::DELETE &&\n                  rw_set_[location] != RWType::INS_DEL));\n  auto rw_set_it = rw_set_.find(location);\n  if (rw_set_it != rw_set_.end()) {\n    return;\n  }\n  rw_set_[location] = RWType::READ;\n}\n\nvoid TransactionContext::RecordReadOwn(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end() ||\n                 (rw_set_[location] != RWType::DELETE &&\n                  rw_set_[location] != RWType::INS_DEL));\n  rw_set_[location] = RWType::READ_OWN;\n}\n\nvoid TransactionContext::RecordUpdate(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end() ||\n                 (rw_set_[location] != RWType::DELETE &&\n                  rw_set_[location] != RWType::INS_DEL));\n  auto rw_set_it = rw_set_.find(location);\n  if (rw_set_it != rw_set_.end() && (rw_set_it->second == RWType::READ ||\n                                  rw_set_it->second == RWType::READ_OWN)) {\n    rw_set_it->second = RWType::UPDATE;\n    is_written_ = true;\n  }\n  PELOTON_ASSERT(is_written_);\n}\n\nvoid TransactionContext::RecordInsert(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end());\n  rw_set_[location] = RWType::INSERT;\n  is_written_ = true;\n}\n\nbool TransactionContext::RecordDelete(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end() ||\n                 (rw_set_[location] != RWType::DELETE &&\n                  rw_set_[location] != RWType::INS_DEL));\n  auto rw_set_it = rw_set_.find(location);\n  if (rw_set_it != rw_set_.end() && rw_set_it->second == RWType::INSERT) {\n    PELOTON_ASSERT(is_written_);\n    rw_set_it->second = RWType::INS_DEL;\n    return true;\n  } else {\n    rw_set_[location] = RWType::DELETE;\n    is_written_ = true;\n    return false;\n  }\n}\n\nconst std::string TransactionContext::GetInfo() const {\n  std::ostringstream os;\n\n  os << \" Txn :: @\" << this << \" ID : \" << std::setw(4) << txn_id_\n     << \" Read ID : \" << std::setw(4) << read_id_\n     << \" Commit ID : \" << std::setw(4) << commit_id_\n     << \" Result : \" << result_;\n\n  return os.str();\n}\n\nvoid TransactionContext::AddOnCommitTrigger(\n    trigger::TriggerData &trigger_data) {\n  if (on_commit_triggers_ == nullptr) {\n    on_commit_triggers_.reset(new trigger::TriggerSet());\n  }\n  on_commit_triggers_->push_back(trigger_data);\n}\n\nvoid TransactionContext::ExecOnCommitTriggers() {\n  if (on_commit_triggers_ != nullptr) {\n    on_commit_triggers_->ExecTriggers();\n  }\n}\n\n}  \/\/ namespace concurrency\n}  \/\/ namespace peloton\n<commit_msg>Formatting.<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ transaction_context.cpp\n\/\/\n\/\/ Identification: src\/concurrency\/transaction_context.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"concurrency\/transaction_context.h\"\n\n#include <sstream>\n\n#include \"common\/logger.h\"\n#include \"common\/macros.h\"\n#include \"common\/platform.h\"\n#include \"trigger\/trigger.h\"\n\n#include <chrono>\n#include <iomanip>\n#include <thread>\n\nnamespace peloton {\nnamespace concurrency {\n\n\/*\n * TransactionContext state transition:\n *                r           r\/ro            u\/r\/ro\n *              +--<--+     +---<--+        +---<--+\n *           r  |     |     |      |        |      |     d\n *  (init)-->-- +-> Read  --+-> Read Own ---+--> Update ---> Delete (final)\n *                    |   ro             u  |\n *                    |                     |\n *                    +----->--------->-----+\n *                              u\n *              r\/ro\/u\n *            +---<---+\n *         i  |       |     d\n *  (init)-->-+---> Insert ---> Ins_Del (final)\n *\n *    r : read\n *    ro: read_own\n *    u : update\n *    d : delete\n *    i : insert\n *\/\n\nTransactionContext::TransactionContext(const size_t thread_id,\n                                       const IsolationLevelType isolation,\n                                       const cid_t &read_id) {\n  Init(thread_id, isolation, read_id);\n}\n\nTransactionContext::TransactionContext(const size_t thread_id,\n                                       const IsolationLevelType isolation,\n                                       const cid_t &read_id,\n                                       const cid_t &commit_id) {\n  Init(thread_id, isolation, read_id, commit_id);\n}\n\nvoid TransactionContext::Init(const size_t thread_id,\n                              const IsolationLevelType isolation,\n                              const cid_t &read_id, const cid_t &commit_id) {\n  read_id_ = read_id;\n\n  \/\/ commit id can be set at a transaction's commit phase.\n  commit_id_ = commit_id;\n\n  \/\/ set txn_id to commit_id.\n  txn_id_ = commit_id_;\n\n  epoch_id_ = read_id_ >> 32;\n\n  thread_id_ = thread_id;\n\n  is_written_ = false;\n\n  isolation_level_ = isolation;\n\n  gc_set_ = std::make_shared<GCSet>();\n  gc_object_set_ = std::make_shared<GCObjectSet>();\n\n  on_commit_triggers_.reset();\n}\n\nRWType TransactionContext::GetRWType(const ItemPointer &location) {\n  const auto rw_set_it = rw_set_.find(location);\n  if (rw_set_it != rw_set_.end()) {\n    return rw_set_it->second;\n  }\n  return RWType::INVALID;\n}\n\nvoid TransactionContext::RecordRead(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end() ||\n                 (rw_set_[location] != RWType::DELETE &&\n                  rw_set_[location] != RWType::INS_DEL));\n  auto rw_set_it = rw_set_.find(location);\n  if (rw_set_it != rw_set_.end()) {\n    return;\n  }\n  rw_set_[location] = RWType::READ;\n}\n\nvoid TransactionContext::RecordReadOwn(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end() ||\n                 (rw_set_[location] != RWType::DELETE &&\n                  rw_set_[location] != RWType::INS_DEL));\n  rw_set_[location] = RWType::READ_OWN;\n}\n\nvoid TransactionContext::RecordUpdate(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end() ||\n                 (rw_set_[location] != RWType::DELETE &&\n                  rw_set_[location] != RWType::INS_DEL));\n  auto rw_set_it = rw_set_.find(location);\n  if (rw_set_it != rw_set_.end() && (rw_set_it->second == RWType::READ ||\n                                     rw_set_it->second == RWType::READ_OWN)) {\n    rw_set_it->second = RWType::UPDATE;\n    is_written_ = true;\n  }\n  PELOTON_ASSERT(is_written_);\n}\n\nvoid TransactionContext::RecordInsert(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end());\n  rw_set_[location] = RWType::INSERT;\n  is_written_ = true;\n}\n\nbool TransactionContext::RecordDelete(const ItemPointer &location) {\n  PELOTON_ASSERT(rw_set_.find(location) == rw_set_.end() ||\n                 (rw_set_[location] != RWType::DELETE &&\n                  rw_set_[location] != RWType::INS_DEL));\n  auto rw_set_it = rw_set_.find(location);\n  if (rw_set_it != rw_set_.end() && rw_set_it->second == RWType::INSERT) {\n    PELOTON_ASSERT(is_written_);\n    rw_set_it->second = RWType::INS_DEL;\n    return true;\n  } else {\n    rw_set_[location] = RWType::DELETE;\n    is_written_ = true;\n    return false;\n  }\n}\n\nconst std::string TransactionContext::GetInfo() const {\n  std::ostringstream os;\n\n  os << \" Txn :: @\" << this << \" ID : \" << std::setw(4) << txn_id_\n     << \" Read ID : \" << std::setw(4) << read_id_\n     << \" Commit ID : \" << std::setw(4) << commit_id_\n     << \" Result : \" << result_;\n\n  return os.str();\n}\n\nvoid TransactionContext::AddOnCommitTrigger(\n    trigger::TriggerData &trigger_data) {\n  if (on_commit_triggers_ == nullptr) {\n    on_commit_triggers_.reset(new trigger::TriggerSet());\n  }\n  on_commit_triggers_->push_back(trigger_data);\n}\n\nvoid TransactionContext::ExecOnCommitTriggers() {\n  if (on_commit_triggers_ != nullptr) {\n    on_commit_triggers_->ExecTriggers();\n  }\n}\n\n}  \/\/ namespace concurrency\n}  \/\/ namespace peloton\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (C) 2004 The glibmm Development Team\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\n * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n *\/\n\n#include <glibmm.h>\n#include <iomanip>\n#include <iostream>\n\n\nclass ExampleOptionGroup : public Glib::OptionGroup\n{ \npublic:\n  ExampleOptionGroup();\n\n  virtual bool on_pre_parse(Glib::OptionContext& context, Glib::OptionGroup& group);\n  virtual bool on_post_parse(Glib::OptionContext& context, Glib::OptionGroup& group);\n  virtual void on_error(Glib::OptionContext& context, Glib::OptionGroup& group);\n\n  bool on_option_arg_string(const Glib::ustring& option_name,\n    const Glib::ustring& value, bool has_value);\n  bool on_option_arg_filename(const Glib::ustring& option_name,\n    const std::string& value, bool has_value);\n\n  \/\/These members should live as long as the OptionGroup to which they are added, \n  \/\/and as long as the OptionContext to which that OptionGroup is added.\n  int m_arg_foo;\n  std::string m_arg_filename;\n  Glib::ustring m_arg_goo;\n  bool m_arg_boolean;\n  Glib::OptionGroup::vecustrings m_arg_list;\n  Glib::OptionGroup::vecustrings m_remaining_list;\n  Glib::ustring m_arg_x_string;\n  std::string m_arg_x_filename;\n};\n\nExampleOptionGroup::ExampleOptionGroup()\n: Glib::OptionGroup(\"example_group\", \"description of example group\", \"help description of example group\"),\n  m_arg_foo(0), m_arg_boolean(false)\n{\n  Glib::OptionEntry entry1;\n  entry1.set_long_name(\"foo\");\n  entry1.set_short_name('f');\n  entry1.set_description(\"The Foo\");\n  add_entry(entry1, m_arg_foo);\n      \n  Glib::OptionEntry entry2;\n  entry2.set_long_name(\"file\");\n  entry2.set_short_name('F');\n  entry2.set_description(\"The Filename\");\n  add_entry_filename(entry2, m_arg_filename);\n \n  Glib::OptionEntry entry3;\n  entry3.set_long_name(\"goo\");\n  entry3.set_short_name('g');\n  entry3.set_description(\"The Goo\");\n  m_arg_goo = \"default-goo-value\"; \/\/We can choose a default to be used if the user doesn't specify this option.\n  add_entry(entry3, m_arg_goo);\n  \n  Glib::OptionEntry entry4;\n  entry4.set_long_name(\"activate_something\");\n  entry4.set_description(\"Activate something\");\n  add_entry(entry4, m_arg_boolean);\n  \n  Glib::OptionEntry entry5;\n  entry5.set_long_name(\"list\");\n  entry5.set_short_name('l');\n  entry5.set_description(\"A List\");\n  add_entry(entry5, m_arg_list);\n\n  Glib::OptionEntry entry6;\n  entry6.set_long_name(\"x-string\");\n  entry6.set_short_name('x');\n  entry6.set_description(\"A string with custom parsing\");\n  entry6.set_flags(Glib::OptionEntry::FLAG_OPTIONAL_ARG);\n  m_arg_x_string = \"not specified\";\n  add_entry(entry6, sigc::mem_fun(*this, &ExampleOptionGroup::on_option_arg_string));\n\n  Glib::OptionEntry entry7;\n  entry7.set_long_name(\"x-filename\");\n  entry7.set_short_name('X');\n  entry7.set_description(\"A filename with custom parsing\");\n  entry7.set_flags(Glib::OptionEntry::FLAG_OPTIONAL_ARG);\n  m_arg_x_filename = \"not specified\";\n  add_entry_filename(entry7, sigc::mem_fun(*this, &ExampleOptionGroup::on_option_arg_filename));\n\n  Glib::OptionEntry entry_remaining;\n  entry_remaining.set_long_name(G_OPTION_REMAINING);\n  entry_remaining.set_arg_description(G_OPTION_REMAINING);\n\n  add_entry(entry_remaining, m_remaining_list);\n}\n\nbool ExampleOptionGroup::on_pre_parse(Glib::OptionContext& \/* context *\/, Glib::OptionGroup& \/* group *\/)\n{\n  \/\/This is called before the m_arg_* instances are given their values.\n  \/\/ You do not need to override this method. This is just here to show you how,\n  \/\/ in case you want to do any extra processing.\n  std::cout << \"on_pre_parse called\" << std::endl;\n  return true;\n}\n\nbool ExampleOptionGroup::on_post_parse(Glib::OptionContext& \/* context *\/, Glib::OptionGroup& \/* group *\/)\n{\n  \/\/This is called after the m_arg_* instances are given their values.\n  \/\/ You do not need to override this method. This is just here to show you how,\n  \/\/ in case you want to do any extra processing.\n  std::cout << \"on_post_parse called\" << std::endl;\n  return true;\n}\n\nvoid ExampleOptionGroup::on_error(Glib::OptionContext& \/* context *\/, Glib::OptionGroup& \/* group *\/)\n{\n  std::cout << \"on_error called\" << std::endl;\n}\n\nbool ExampleOptionGroup::on_option_arg_string(const Glib::ustring& option_name,\n    const Glib::ustring& value, bool has_value)\n{\n  if(option_name != \"-x\" && option_name != \"--x-string\")\n  {\n    m_arg_x_string = \"on_option_arg_string called with unexpected option_name: \" + option_name;\n    throw Glib::OptionError(Glib::OptionError::UNKNOWN_OPTION, m_arg_x_string);\n  }\n\n  if(!has_value)\n  {\n    m_arg_x_string = \"no value\";\n    return true;\n  }\n\n  if(value.empty())\n  {\n    m_arg_x_string = \"empty string\";\n    return true;\n  }\n\n  m_arg_x_string = value;\n  if(value == \"error\")\n  {\n    throw Glib::OptionError(Glib::OptionError::BAD_VALUE,\n      \"on_option_arg_string called with value = \" + m_arg_x_string);\n  }\n  return value != \"false\";\n}\n\nbool ExampleOptionGroup::on_option_arg_filename(const Glib::ustring& option_name,\n    const std::string& value, bool has_value)\n{\n  if(option_name != \"-X\" && option_name != \"--x-filename\")\n  {\n    m_arg_x_filename = \"on_option_arg_filename called with unexpected option_name: \" + option_name;\n    throw Glib::OptionError(Glib::OptionError::UNKNOWN_OPTION, m_arg_x_filename);\n  }\n\n  if(!has_value)\n  {\n    m_arg_x_filename = \"no value\";\n    return true;\n  }\n\n  if(value.empty())\n  {\n    m_arg_x_filename = \"empty string\";\n    return true;\n  }\n\n  m_arg_x_filename = value;\n  if(value == \"error\")\n  {\n    throw Glib::OptionError(Glib::OptionError::BAD_VALUE,\n      \"on_option_arg_filename called with value = \" + m_arg_x_filename);\n  }\n  return value != \"false\";\n}\n\n\nint main(int argc, char** argv)\n{\n  \/\/This example should be executed like so:\n  \/\/.\/example --foo=1 --bar=2 --goo=abc\n  \/\/.\/example --help\n  \n  Glib::init();\n\n  \/\/Set up the current locale.\n  setlocale(LC_ALL, \"\");\n\n  Glib::OptionContext context;\n  \n  ExampleOptionGroup group;\n  context.set_main_group(group);\n  \n  try\n  {\n    context.parse(argc, argv);\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cout << \"Exception: \" << ex.what() << std::endl;\n  }\n\n  std::cout << \"parsed values: \" << std::endl <<\n    \"  foo = \" << group.m_arg_foo << std::endl << \n    \"  filename = \" << group.m_arg_filename << std::endl <<\n    \"  activate_something = \" << (group.m_arg_boolean ? \"enabled\" : \"disabled\") << std::endl <<\n    \"  goo = \" << group.m_arg_goo << std::endl <<\n    \"  x-string = \" << group.m_arg_x_string << std::endl <<\n    \"  x-filename = \" << group.m_arg_x_filename << std::endl;\n    \n  \/\/This one shows the results of multiple instance of the same option, such as --list=1 --list=a --list=b\n  std::cout << \"  list = \";\n  for(Glib::OptionGroup::vecustrings::const_iterator iter = group.m_arg_list.begin(); iter != group.m_arg_list.end(); ++iter)\n  {\n    std::cout << *iter << \", \";\n  }\n  std::cout << std::endl;\n\n  \/\/This one shows the remaining arguments on the command line, which had no name= form:\n  std::cout << \"  remaining = \";\n  for(Glib::OptionGroup::vecustrings::const_iterator iter = group.m_remaining_list.begin(); iter != group.m_remaining_list.end(); ++iter)\n  {\n    std::cout << *iter << \", \";\n  }\n  std::cout << std::endl;\n \n  return 0;\n}\n\n<commit_msg>Options example: For the remaining arg(s), remove description.<commit_after>\/* Copyright (C) 2004 The glibmm Development Team\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\n * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n *\/\n\n#include <glibmm.h>\n#include <iomanip>\n#include <iostream>\n\n\nclass ExampleOptionGroup : public Glib::OptionGroup\n{ \npublic:\n  ExampleOptionGroup();\n\n  virtual bool on_pre_parse(Glib::OptionContext& context, Glib::OptionGroup& group);\n  virtual bool on_post_parse(Glib::OptionContext& context, Glib::OptionGroup& group);\n  virtual void on_error(Glib::OptionContext& context, Glib::OptionGroup& group);\n\n  bool on_option_arg_string(const Glib::ustring& option_name,\n    const Glib::ustring& value, bool has_value);\n  bool on_option_arg_filename(const Glib::ustring& option_name,\n    const std::string& value, bool has_value);\n\n  \/\/These members should live as long as the OptionGroup to which they are added, \n  \/\/and as long as the OptionContext to which that OptionGroup is added.\n  int m_arg_foo;\n  std::string m_arg_filename;\n  Glib::ustring m_arg_goo;\n  bool m_arg_boolean;\n  Glib::OptionGroup::vecustrings m_arg_list;\n  Glib::OptionGroup::vecustrings m_remaining_list;\n  Glib::ustring m_arg_x_string;\n  std::string m_arg_x_filename;\n};\n\nExampleOptionGroup::ExampleOptionGroup()\n: Glib::OptionGroup(\"example_group\", \"description of example group\", \"help description of example group\"),\n  m_arg_foo(0), m_arg_boolean(false)\n{\n  Glib::OptionEntry entry1;\n  entry1.set_long_name(\"foo\");\n  entry1.set_short_name('f');\n  entry1.set_description(\"The Foo\");\n  add_entry(entry1, m_arg_foo);\n      \n  Glib::OptionEntry entry2;\n  entry2.set_long_name(\"file\");\n  entry2.set_short_name('F');\n  entry2.set_description(\"The Filename\");\n  add_entry_filename(entry2, m_arg_filename);\n \n  Glib::OptionEntry entry3;\n  entry3.set_long_name(\"goo\");\n  entry3.set_short_name('g');\n  entry3.set_description(\"The Goo\");\n  m_arg_goo = \"default-goo-value\"; \/\/We can choose a default to be used if the user doesn't specify this option.\n  add_entry(entry3, m_arg_goo);\n  \n  Glib::OptionEntry entry4;\n  entry4.set_long_name(\"activate_something\");\n  entry4.set_description(\"Activate something\");\n  add_entry(entry4, m_arg_boolean);\n  \n  Glib::OptionEntry entry5;\n  entry5.set_long_name(\"list\");\n  entry5.set_short_name('l');\n  entry5.set_description(\"A List\");\n  add_entry(entry5, m_arg_list);\n\n  Glib::OptionEntry entry6;\n  entry6.set_long_name(\"x-string\");\n  entry6.set_short_name('x');\n  entry6.set_description(\"A string with custom parsing\");\n  entry6.set_flags(Glib::OptionEntry::FLAG_OPTIONAL_ARG);\n  m_arg_x_string = \"not specified\";\n  add_entry(entry6, sigc::mem_fun(*this, &ExampleOptionGroup::on_option_arg_string));\n\n  Glib::OptionEntry entry7;\n  entry7.set_long_name(\"x-filename\");\n  entry7.set_short_name('X');\n  entry7.set_description(\"A filename with custom parsing\");\n  entry7.set_flags(Glib::OptionEntry::FLAG_OPTIONAL_ARG);\n  m_arg_x_filename = \"not specified\";\n  add_entry_filename(entry7, sigc::mem_fun(*this, &ExampleOptionGroup::on_option_arg_filename));\n\n  Glib::OptionEntry entry_remaining;\n  entry_remaining.set_long_name(G_OPTION_REMAINING);\n\n  add_entry(entry_remaining, m_remaining_list);\n}\n\nbool ExampleOptionGroup::on_pre_parse(Glib::OptionContext& \/* context *\/, Glib::OptionGroup& \/* group *\/)\n{\n  \/\/This is called before the m_arg_* instances are given their values.\n  \/\/ You do not need to override this method. This is just here to show you how,\n  \/\/ in case you want to do any extra processing.\n  std::cout << \"on_pre_parse called\" << std::endl;\n  return true;\n}\n\nbool ExampleOptionGroup::on_post_parse(Glib::OptionContext& \/* context *\/, Glib::OptionGroup& \/* group *\/)\n{\n  \/\/This is called after the m_arg_* instances are given their values.\n  \/\/ You do not need to override this method. This is just here to show you how,\n  \/\/ in case you want to do any extra processing.\n  std::cout << \"on_post_parse called\" << std::endl;\n  return true;\n}\n\nvoid ExampleOptionGroup::on_error(Glib::OptionContext& \/* context *\/, Glib::OptionGroup& \/* group *\/)\n{\n  std::cout << \"on_error called\" << std::endl;\n}\n\nbool ExampleOptionGroup::on_option_arg_string(const Glib::ustring& option_name,\n    const Glib::ustring& value, bool has_value)\n{\n  if(option_name != \"-x\" && option_name != \"--x-string\")\n  {\n    m_arg_x_string = \"on_option_arg_string called with unexpected option_name: \" + option_name;\n    throw Glib::OptionError(Glib::OptionError::UNKNOWN_OPTION, m_arg_x_string);\n  }\n\n  if(!has_value)\n  {\n    m_arg_x_string = \"no value\";\n    return true;\n  }\n\n  if(value.empty())\n  {\n    m_arg_x_string = \"empty string\";\n    return true;\n  }\n\n  m_arg_x_string = value;\n  if(value == \"error\")\n  {\n    throw Glib::OptionError(Glib::OptionError::BAD_VALUE,\n      \"on_option_arg_string called with value = \" + m_arg_x_string);\n  }\n  return value != \"false\";\n}\n\nbool ExampleOptionGroup::on_option_arg_filename(const Glib::ustring& option_name,\n    const std::string& value, bool has_value)\n{\n  if(option_name != \"-X\" && option_name != \"--x-filename\")\n  {\n    m_arg_x_filename = \"on_option_arg_filename called with unexpected option_name: \" + option_name;\n    throw Glib::OptionError(Glib::OptionError::UNKNOWN_OPTION, m_arg_x_filename);\n  }\n\n  if(!has_value)\n  {\n    m_arg_x_filename = \"no value\";\n    return true;\n  }\n\n  if(value.empty())\n  {\n    m_arg_x_filename = \"empty string\";\n    return true;\n  }\n\n  m_arg_x_filename = value;\n  if(value == \"error\")\n  {\n    throw Glib::OptionError(Glib::OptionError::BAD_VALUE,\n      \"on_option_arg_filename called with value = \" + m_arg_x_filename);\n  }\n  return value != \"false\";\n}\n\n\nint main(int argc, char** argv)\n{\n  \/\/This example should be executed like so:\n  \/\/.\/example --foo=1 --bar=2 --goo=abc\n  \/\/.\/example --help\n  \n  Glib::init();\n\n  \/\/Set up the current locale.\n  setlocale(LC_ALL, \"\");\n\n  Glib::OptionContext context;\n  \n  ExampleOptionGroup group;\n  context.set_main_group(group);\n  \n  try\n  {\n    context.parse(argc, argv);\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cout << \"Exception: \" << ex.what() << std::endl;\n  }\n\n  std::cout << \"parsed values: \" << std::endl <<\n    \"  foo = \" << group.m_arg_foo << std::endl << \n    \"  filename = \" << group.m_arg_filename << std::endl <<\n    \"  activate_something = \" << (group.m_arg_boolean ? \"enabled\" : \"disabled\") << std::endl <<\n    \"  goo = \" << group.m_arg_goo << std::endl <<\n    \"  x-string = \" << group.m_arg_x_string << std::endl <<\n    \"  x-filename = \" << group.m_arg_x_filename << std::endl;\n    \n  \/\/This one shows the results of multiple instance of the same option, such as --list=1 --list=a --list=b\n  std::cout << \"  list = \";\n  for(Glib::OptionGroup::vecustrings::const_iterator iter = group.m_arg_list.begin(); iter != group.m_arg_list.end(); ++iter)\n  {\n    std::cout << *iter << \", \";\n  }\n  std::cout << std::endl;\n\n  \/\/This one shows the remaining arguments on the command line, which had no name= form:\n  std::cout << \"  remaining = \";\n  for(Glib::OptionGroup::vecustrings::const_iterator iter = group.m_remaining_list.begin(); iter != group.m_remaining_list.end(); ++iter)\n  {\n    std::cout << *iter << \", \";\n  }\n  std::cout << std::endl;\n \n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*===========================================================================*\\\n *                                                                           *\n *                               OpenMesh                                    *\n *      Copyright (C) 2001-2010 by Computer Graphics Group, RWTH Aachen      *\n *                           www.openmesh.org                                *\n *                                                                           *\n *---------------------------------------------------------------------------* \n *  This file is part of OpenMesh.                                           *\n *                                                                           *\n *  OpenMesh is free software: you can redistribute it and\/or modify         * \n *  it under the terms of the GNU Lesser 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 with the              *\n *  following exceptions:                                                    *\n *                                                                           *\n *  If other files instantiate templates or use macros                       *\n *  or inline functions from this file, or you compile this file and         *\n *  link it with other files to produce an executable, this file does        *\n *  not by itself cause the resulting executable to be covered by the        *\n *  GNU Lesser General Public License. This exception does not however       *\n *  invalidate any other reasons why the executable file might be            *\n *  covered by the GNU Lesser General Public License.                        *\n *                                                                           *\n *  OpenMesh is distributed in the hope that it 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 LesserGeneral Public          *\n *  License along with OpenMesh.  If not,                                    *\n *  see <http:\/\/www.gnu.org\/licenses\/>.                                      *\n *                                                                           *\n\\*===========================================================================*\/ \n\n\/*===========================================================================*\\\n *                                                                           *             \n *   $Revision$                                                         *\n *   $Date$                   *\n *                                                                           *\n\\*===========================================================================*\/\n\n#include <iostream>\n\n#include <OpenMesh\/Core\/IO\/MeshIO.hh>\n#include <OpenMesh\/Core\/Mesh\/PolyMesh_ArrayKernelT.hh>\n          \n#include <OpenMesh\/Tools\/Dualizer\/meshDualT.hh>\n\ntypedef OpenMesh::PolyMesh_ArrayKernelT<>  MyMesh;\n\n\nint main(int argc, char **argv)\n{\n    MyMesh mesh;\n\n    \/\/ read mesh from argv[1]\n    if ( !OpenMesh::IO::read_mesh(mesh, argv[1]) )\n    {\n        std::cerr << \"Cannot read mesh from file\" << argv[1] << std::endl;\n        return 1;\n    }\n\n    MyMesh *dual = OpenMesh::Util::MeshDual(mesh);\n\n    \/\/ write mesh to output.obj\n    if ( !OpenMesh::IO::write_mesh(*dual, \"output.obj\") )\n    {\n        std::cerr << \"Cannot write mesh to file 'output.obj'\" << std::endl;\n        return 1;\n    }\n    \n    delete dual;\n\n    return 0;\n}\n<commit_msg>Dont crash on wrong command line options<commit_after>\/*===========================================================================*\\\n *                                                                           *\n *                               OpenMesh                                    *\n *      Copyright (C) 2001-2010 by Computer Graphics Group, RWTH Aachen      *\n *                           www.openmesh.org                                *\n *                                                                           *\n *---------------------------------------------------------------------------* \n *  This file is part of OpenMesh.                                           *\n *                                                                           *\n *  OpenMesh is free software: you can redistribute it and\/or modify         * \n *  it under the terms of the GNU Lesser 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 with the              *\n *  following exceptions:                                                    *\n *                                                                           *\n *  If other files instantiate templates or use macros                       *\n *  or inline functions from this file, or you compile this file and         *\n *  link it with other files to produce an executable, this file does        *\n *  not by itself cause the resulting executable to be covered by the        *\n *  GNU Lesser General Public License. This exception does not however       *\n *  invalidate any other reasons why the executable file might be            *\n *  covered by the GNU Lesser General Public License.                        *\n *                                                                           *\n *  OpenMesh is distributed in the hope that it 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 LesserGeneral Public          *\n *  License along with OpenMesh.  If not,                                    *\n *  see <http:\/\/www.gnu.org\/licenses\/>.                                      *\n *                                                                           *\n\\*===========================================================================*\/ \n\n\/*===========================================================================*\\\n *                                                                           *             \n *   $Revision$                                                         *\n *   $Date$                   *\n *                                                                           *\n\\*===========================================================================*\/\n\n#include <iostream>\n\n#include <OpenMesh\/Core\/IO\/MeshIO.hh>\n#include <OpenMesh\/Core\/Mesh\/PolyMesh_ArrayKernelT.hh>\n          \n#include <OpenMesh\/Tools\/Dualizer\/meshDualT.hh>\n\ntypedef OpenMesh::PolyMesh_ArrayKernelT<>  MyMesh;\n\n\nint main(int argc, char **argv)\n{\n    MyMesh mesh;\n\n    if ( argc != 2 ) {\n        std::cerr << \"Please specify input filename only!\" << std::endl;\n        return 1;\n    }\n\n    \/\/ read mesh from argv[1]\n    if ( !OpenMesh::IO::read_mesh(mesh, argv[1]) )\n    {\n        std::cerr << \"Cannot read mesh from file\" << argv[1] << std::endl;\n        return 1;\n    }\n\n    MyMesh *dual = OpenMesh::Util::MeshDual(mesh);\n\n    \/\/ write mesh to output.obj\n    if ( !OpenMesh::IO::write_mesh(*dual, \"output.obj\") )\n    {\n        std::cerr << \"Cannot write mesh to file 'output.obj'\" << std::endl;\n        return 1;\n    }\n    \n    delete dual;\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"docker_proc.h\"\n\nDockerProc::DockerProc( ClassAd * jobAd ) : VanillaProc( jobAd ) {\n\t\/\/ Extract the name of the desired Docker image from jobAd\n\t\/\/ Ask Docker which cgroup it's going to use?\n\t\/\/ Steal code from os_proc::StartJob() to do the stdio mangling\n\t\/\/ ...\n\n\t\/\/ We can run 'docker pull' to verify that it can find the image\n\t\/\/ before we run 'docker run' to actually start it.  In fact, if\n\t\/\/ we feel like being clever, we could have the startd use config\n\t\/\/ to do the pull before we run a docker job at all, and advertise\n\t\/\/ which ones we will know will work...\n\n\t\/\/ To see currently-installed images, run 'docker images'.\n\n\t\/\/ If we supply a name to 'docker run', we can use 'docker ps' to\n\t\/\/ link the name to the (short) container ID.  We can then pass that\n\t\/\/ to 'docker inspect' to get the (long) container ID, among other\n\t\/\/ interesting bits.  The (long) container ID will let use grovel\n\t\/\/ around in \/sys\/fs\/cgroup if we need to (for usage information?).\n\n\t\/\/ The 'docker run' command hangs around for the duration of the\n\t\/\/ instance, which means we can probably hand its PID off to UserProc\n\t\/\/ and\/or OSProc like we hand off the VM GAHP's PID.\n\n\t\/\/ We should be able to leverage the procd for usage-gathering if\n\t\/\/ we're clever -- assuming the (long) container ID suffices for\n\t\/\/ its cgroup magic.\n\n\t\/\/ We should run with '-v \/path\/to\/sandbox:\/inner-path\/to\/sandbox'.\n\t\/\/ .. and the IWD should probably be \/inter-path\/to\/sandbox.  Use '-w'.\n\n\t\/\/ TODO for laterz: figure out this self-hosting magic.\n}\n\nDockerProc::~DockerProc() { }\n\nint DockerProc::StartJob() {\n\treturn VanillaProc::StartJob();\n}\n\nbool DockerProc::JobReaper( int pid, int status ) {\n\treturn VanillaProc::JobReaper( pid, status );\n}\n\nbool DockerProc::JobExit() {\n\treturn VanillaProc::JobExit();\n}\n\nvoid DockerProc::Suspend() {\n\tVanillaProc::Suspend();\n}\n\nvoid DockerProc::Continue() {\n\tVanillaProc::Continue();\n}\n\nbool DockerProc::Remove() {\n\treturn VanillaProc::Remove();\n}\n\nbool DockerProc::Hold() {\n\treturn VanillaProc::Hold();\n}\n\nbool DockerProc::ShutdownGraceful() {\n\treturn VanillaProc::ShutdownGraceful();\n}\n\nbool DockerProc::ShutdownFast() {\n\treturn VanillaProc::ShutdownFast();\n}\n\nbool DockerProc::PublishUpdateAd( ClassAd * jobAd ) {\n\treturn VanillaProc::PublishUpdateAd( jobAd );\n}\n\nvoid DockerProc::PublishToEnv( Env * env ) {\n\treturn VanillaProc::PublishToEnv( env );\n}\n<commit_msg>More impl notes.<commit_after>#include \"docker_proc.h\"\n\nDockerProc::DockerProc( ClassAd * jobAd ) : VanillaProc( jobAd ) {\n\t\/\/ Extract the name of the desired Docker image from jobAd\n\t\/\/ Ask Docker which cgroup it's going to use?\n\t\/\/ Steal code from os_proc::StartJob() to do the stdio mangling\n\t\/\/ ...\n\n\t\/\/ We can run 'docker pull' to verify that it can find the image\n\t\/\/ before we run 'docker run' to actually start it.  In fact, if\n\t\/\/ we feel like being clever, we could have the startd use config\n\t\/\/ to do the pull before we run a docker job at all, and advertise\n\t\/\/ which ones we will know will work...\n\n\t\/\/ To see currently-installed images, run 'docker images'.\n\n\t\/\/ If we supply a name to 'docker run', we can use 'docker ps' to\n\t\/\/ link the name to the (short) container ID.  We can then pass that\n\t\/\/ to 'docker inspect' to get the (long) container ID, among other\n\t\/\/ interesting bits.  The (long) container ID will let use grovel\n\t\/\/ around in \/sys\/fs\/cgroup if we need to (for usage information?).\n\n\t\/\/ The 'docker run' command hangs around for the duration of the\n\t\/\/ instance, which means we can probably hand its PID off to UserProc\n\t\/\/ and\/or OSProc like we hand off the VM GAHP's PID.\n\n\t\/\/ We should be able to leverage the procd for usage-gathering if\n\t\/\/ we're clever -- assuming the (long) container ID suffices for\n\t\/\/ its cgroup magic.\n\n\t\/\/ We should run with '-v \/path\/to\/sandbox:\/inner-path\/to\/sandbox'.\n\t\/\/ .. and the IWD should probably be \/inter-path\/to\/sandbox.  Use '-w'.\n\n\t\/\/ TODO for laterz: figure out this self-hosting magic.  (We want to\n\t\/\/ supply images via file transfer.)\n\n\t\/\/ TODO for laterz: can we configure Docker to drop its overlay filesystem\n\t\/\/ backing store(s) into the sandbox?  Even if so, we may still want to do\n\t\/\/ a 'docker ps -a' on startup and nuke anything with our special name prefix\n\t\/\/ in case we didn't get a change to 'docker stop' and 'docker rm' them\n\t\/\/ before the machine went down or we crashed or whatever.\n}\n\nDockerProc::~DockerProc() { }\n\nint DockerProc::StartJob() {\n\treturn VanillaProc::StartJob();\n}\n\nbool DockerProc::JobReaper( int pid, int status ) {\n\treturn VanillaProc::JobReaper( pid, status );\n}\n\nbool DockerProc::JobExit() {\n\treturn VanillaProc::JobExit();\n}\n\nvoid DockerProc::Suspend() {\n\tVanillaProc::Suspend();\n}\n\nvoid DockerProc::Continue() {\n\tVanillaProc::Continue();\n}\n\nbool DockerProc::Remove() {\n\treturn VanillaProc::Remove();\n}\n\nbool DockerProc::Hold() {\n\treturn VanillaProc::Hold();\n}\n\nbool DockerProc::ShutdownGraceful() {\n\treturn VanillaProc::ShutdownGraceful();\n}\n\nbool DockerProc::ShutdownFast() {\n\treturn VanillaProc::ShutdownFast();\n}\n\nbool DockerProc::PublishUpdateAd( ClassAd * jobAd ) {\n\treturn VanillaProc::PublishUpdateAd( jobAd );\n}\n\nvoid DockerProc::PublishToEnv( Env * env ) {\n\treturn VanillaProc::PublishToEnv( env );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* oxygenwindowmanager.cpp\n* pass some window mouse press\/release\/move event actions to window manager\n* -------------------\n*\n* Copyright (c) 2010 Cédric Bellegarde <gnumdk@gmail.com>\n* Copyright (c) 2010 Hugo Pereira Da Costa <hugo@oxygen-icons.org>\n*\n* Largely inspired from Qtcurve style\n* Copyright (C) Craig Drummond, 2003 - 2010 craig.p.drummond@gmail.com\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 \"oxygenwindowmanager.h\"\n#include \"oxygengtkutils.h\"\n#include \"oxygenstyle.h\"\n#include \"config.h\"\n\n#include <gdk\/gdkx.h>\n\nnamespace Oxygen\n{\n\n\n    \/\/_________________________________________________\n    WindowManager::WindowManager( void ):\n        _mode( Full ),\n        _drag( false ),\n        _dragDistance( 4 ),\n        _dragDelay( 500 ),\n        _widget( 0L ),\n        _x(-1),\n        _y(-1)\n    {}\n\n    \/\/_________________________________________________\n    WindowManager::~WindowManager( void )\n    {\n        _map.disconnectAll();\n        _map.clear();\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::registerWidget( GtkWidget* widget )\n    {\n\n        if( _map.contains( widget ) ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::WindowManager::registerWidget - \" << widget << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\" << std::endl;\n        #endif\n\n        \/\/ Force widget to listen to relevant events\n        gtk_widget_add_events( widget,\n            GDK_BUTTON_RELEASE_MASK |\n            GDK_BUTTON_PRESS_MASK   |\n            GDK_LEAVE_NOTIFY_MASK   |\n            GDK_BUTTON1_MOTION_MASK );\n\n        \/\/ allocate new Data object\n        Data& data( _map.registerWidget( widget ) );\n\n        \/\/ connect signals\n        if( _mode != Disabled ) connect( widget, data );\n\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::unregisterWidget( GtkWidget* widget )\n    {\n        if( !_map.contains( widget ) ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::WindowManager::unregisterWidget - \" << widget << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\" << std::endl;\n        #endif\n\n        _map.value( widget ).disconnect( widget );\n        _map.erase( widget );\n\n        if( _widget == widget )\n        {\n            _widget = 0L;\n            _x = -1;\n            _y = -1;\n            _drag = false;\n        }\n\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::setMode( WindowManager::Mode mode )\n    {\n        if( mode == _mode ) return;\n\n        \/\/ connect\/disconnect all data in map, based on new and old mode\n        if( mode == Disabled ) { _map.disconnectAll(); }\n        else if( _mode == Disabled )\n        {\n            DataMap<Data>::Map& map( _map.map() );\n            for( DataMap<Data>::Map::iterator iter = map.begin(); iter != map.end(); iter++ )\n            { connect( iter->first, iter->second ); }\n        }\n\n        \/\/ assign new mode\n        _mode = mode;\n\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmStyleSet( GtkWidget* widget, GtkStyle* , gpointer data )\n    {\n        static_cast<WindowManager*>(data)->unregisterWidget( widget );\n        return false;\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmDestroy( GtkWidget* widget, gpointer data )\n    {\n        static_cast<WindowManager*>(data)->unregisterWidget( widget );\n        return false;\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmButtonPress(GtkWidget *widget, GdkEventButton* event, gpointer data )\n    {\n\n        if( event->type == GDK_BUTTON_PRESS && event->button == 1 )\n        {\n\n            return static_cast<WindowManager*>(data)->isWindowDragWidget( widget, event );\n\n        } else return false;\n\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmButtonRelease(GtkWidget *widget, GdkEventButton*, gpointer data )\n    { return static_cast<WindowManager*>( data )->finishDrag( widget ); }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmLeave(GtkWidget *widget, GdkEventCrossing*, gpointer data )\n    { return static_cast<WindowManager*>( data )->finishDrag( widget ); }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmMotion( GtkWidget *widget, GdkEventMotion* event, gpointer data )\n    { return static_cast<WindowManager*>(data)->startDrag( widget, event ); }\n\n    \/\/_________________________________________________________________\n    gboolean WindowManager::startDelayedDrag( gpointer data )\n    {\n        static_cast<WindowManager*>( data )->startDrag();\n        return FALSE;\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::isWindowDragWidget( GtkWidget* widget, GdkEventButton* event )\n    {\n        if( _mode == Disabled ) return false;\n        else if( (!_drag) && withinWidget(widget, event ) && useEvent( widget, event ) )\n        {\n\n            \/\/ store widget and event position\n            _widget = widget;\n            _x = int(event->x_root);\n            _y = int(event->y_root);\n\n            \/\/ start timer\n            if( _timer.isRunning() ) _timer.stop();\n            _timer.start( _dragDelay, (GSourceFunc)startDelayedDrag, this );\n\n            \/\/ enable drag and accept\n            _drag = true;\n            return true;\n\n        } else return false;\n    }\n\n    \/\/_________________________________________________________________\n    bool WindowManager::startDrag( GtkWidget* widget, GdkEventMotion* event )\n    {\n\n        \/\/ make sure drag is enabled\n        if( !_drag ) return false;\n\n        \/\/ check displacement with respect to drag start\n        const int distance( abs( _x - int(event->x_root) ) + abs( _y - int(event->y_root) ) );\n\n        if( distance > 0 && _timer.isRunning() ) _timer.stop();\n        if( distance < _dragDistance ) return false;\n\n        \/\/ start drag from current position\n        return startDrag( widget, int(event->x_root), int(event->y_root) );\n\n    }\n\n    \/\/_________________________________________________________________\n    bool WindowManager::startDrag( GtkWidget* widget, int x, int y )\n    {\n        \/\/ create xevent and send.\n        XEvent     xev;\n        GtkWindow  *topLevel = GTK_WINDOW( gtk_widget_get_toplevel( widget ) );\n        GdkWindow  *window = gtk_widget_get_window( GTK_WIDGET( topLevel ) );\n        GdkDisplay *display = gtk_widget_get_display( GTK_WIDGET( topLevel ) );\n        GdkWindow  *root = gdk_screen_get_root_window( gtk_window_get_screen( topLevel ) );\n\n        xev.xclient.type = ClientMessage;\n        xev.xclient.message_type = gdk_x11_get_xatom_by_name_for_display(display, \"_NET_WM_MOVERESIZE\");\n        xev.xclient.display = GDK_DISPLAY_XDISPLAY(display);\n        xev.xclient.window = GDK_WINDOW_XID(window);\n        xev.xclient.format = 32;\n        xev.xclient.data.l[0] = x;\n        xev.xclient.data.l[1] = y;\n        xev.xclient.data.l[2] = 8; \/\/ NET::Move\n        xev.xclient.data.l[3] = Button1;\n        xev.xclient.data.l[4] = 0;\n        XUngrabPointer(GDK_DISPLAY_XDISPLAY(display), CurrentTime);\n\n        XSendEvent(\n            GDK_DISPLAY_XDISPLAY(display),\n            GDK_WINDOW_XID(root),\n            False,\n            SubstructureRedirectMask | SubstructureNotifyMask,\n            &xev);\n\n        \/\/ force a release as some widgets miss it...\n        wmButtonRelease( widget, 0L, this );\n        return true;\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::finishDrag( GtkWidget* widget )\n    {\n\n        _widget = 0L;\n        _x = -1;\n        _y = -1;\n\n        if( _drag )\n        {\n\n            gtk_grab_remove(widget);\n            gdk_pointer_ungrab( CurrentTime );\n            _drag = false;\n            return true;\n\n        } else return false;\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::withinWidget( GtkWidget* widget, GdkEventButton* event ) const\n    {\n\n        GdkWindow *window( gtk_widget_get_parent_window( widget ) );\n\n        \/\/ Some widgets aren't realized (GeditWindow for exemple) ...\n        if( !window ) return true;\n\n        GtkAllocation allocation;\n        #if GTK_CHECK_VERSION(2, 18, 0)\n        gtk_widget_get_allocation( widget, &allocation );\n        #else\n        allocation = widget->allocation;\n        #endif\n\n        \/\/ Need to get absolute coordinates\n        int nx(0);\n        int ny(0);\n        gdk_window_get_origin(window, &nx, &ny );\n        allocation.x += nx;\n        allocation.y += ny;\n\n        return Gtk::gdk_rectangle_contains( &allocation, int(event->x_root), int(event->y_root) );\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::useEvent( GtkWidget* widget, GdkEventButton* event ) const\n    {\n\n        \/\/ check against mode\n        if( _mode == Disabled ) return false;\n        if( _mode == Minimal && !( GTK_IS_TOOLBAR( widget ) || GTK_IS_MENU_BAR( widget ) ) ) return false;\n\n        \/\/ always accept if widget is not a container\n        if( !GTK_IS_CONTAINER( widget ) ) return true;\n\n        \/\/ if widget is a notebook, accept if there is no hovered tab\n        if( GTK_IS_NOTEBOOK( widget ) )\n        {\n            return\n                Style::instance().animations().tabWidgetEngine().contains( widget ) &&\n                Style::instance().animations().tabWidgetEngine().hoveredTab( widget ) == -1;\n        }\n\n        return childrenUseEvent( widget, event );\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::childrenUseEvent( GtkWidget* widget, GdkEventButton* event ) const\n    {\n        \/\/ accept, by default\n        bool usable = true;\n\n        \/\/ get children and check\n        GList *children = gtk_container_get_children( GTK_CONTAINER( widget ) );\n        for( GList *child = g_list_first( children ); child && usable ; child = g_list_next( child ) )\n        {\n\n            \/\/ cast child to GtkWidget\n            if( !GTK_IS_WIDGET( child->data ) ) continue;\n            GtkWidget* childWidget( GTK_WIDGET( child->data ) );\n\n            \/\/ check widget state and type\n            if( gtk_widget_get_state( childWidget ) == GTK_STATE_PRELIGHT ) {\n\n                \/\/ if widget is prelight, we don't need to check where event happen,\n                \/\/ any prelight widget indicate we can't do a move\n                usable = false;\n\n            } else if( !GTK_IS_NOTEBOOK ( childWidget ) && event && withinWidget( childWidget, event ) ) {\n\n                GdkWindow *window = gtk_widget_get_window( childWidget );\n                if( window && gdk_window_is_visible ( window ) )\n                {\n\n                    \/\/ TODO: one could probably check here whether widget is enabled or not,\n                    \/\/ and accept if widget is disabled.\n\n                    if( gtk_widget_get_events ( childWidget ) & GDK_BUTTON_PRESS_MASK )\n                    {\n\n                        \/\/ widget listening to press event\n                        usable = false;\n\n                    } else if(\n                        GTK_IS_MENU_ITEM( childWidget ) ||\n                        GTK_IS_SCROLLED_WINDOW( childWidget ) )\n                    {\n                        \/\/ deal with menu item, GtkMenuItem only listen to\n                        \/\/ GDK_BUTTON_PRESS_MASK when state == GTK_STATE_PRELIGHT\n                        \/\/ so previous check are invalids :(\n                        \/\/\n                        \/\/ same for ScrolledWindow, they do not send motion events\n                        \/\/ to parents so not usable\n                        usable = false;\n\n                    }\n                }\n            }\n\n            \/\/ if child is a container and event has been accepted so far, also check it, recursively\n            if( usable && GTK_IS_CONTAINER( childWidget ) )\n            { usable = childrenUseEvent( childWidget, event ); }\n\n        }\n\n        \/\/ free list\n        if( children ) g_list_free( children );\n\n        return usable;\n    }\n\n    \/\/________________________________________________________________________________\n    void WindowManager::connect( GtkWidget* widget, WindowManager::Data& data )\n    {\n        data._destroyId.connect( G_OBJECT( widget ), \"destroy\", G_CALLBACK( wmDestroy ), this );\n        data._styleId.connect( G_OBJECT( widget ), \"style-set\", G_CALLBACK( wmStyleSet ), this );\n\n        data._pressId.connect( G_OBJECT( widget ), \"button-press-event\", G_CALLBACK( wmButtonPress ), this );\n        data._releaseId.connect( G_OBJECT( widget ), \"button-release-event\", G_CALLBACK( wmButtonRelease ), this );\n        data._leaveId.connect( G_OBJECT( widget ), \"leave-notify-event\", G_CALLBACK( wmLeave ), this );\n        data._motionId.connect( G_OBJECT( widget ), \"motion-notify-event\", G_CALLBACK( wmMotion ), this );\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::Data::disconnect( GtkWidget* )\n    {\n\n        _leaveId.disconnect();\n        _destroyId.disconnect();\n        _pressId.disconnect();\n        _releaseId.disconnect();\n        _motionId.disconnect();\n        _styleId.disconnect();\n\n    }\n\n}\n<commit_msg>- use gtk_widget_get_window() as opposed to get_parent_window() - check that mousePress event is indeed in widget (needed for widgets that grab the pointer)<commit_after>\/*\n* oxygenwindowmanager.cpp\n* pass some window mouse press\/release\/move event actions to window manager\n* -------------------\n*\n* Copyright (c) 2010 Cédric Bellegarde <gnumdk@gmail.com>\n* Copyright (c) 2010 Hugo Pereira Da Costa <hugo@oxygen-icons.org>\n*\n* Largely inspired from Qtcurve style\n* Copyright (C) Craig Drummond, 2003 - 2010 craig.p.drummond@gmail.com\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 \"oxygenwindowmanager.h\"\n#include \"oxygengtkutils.h\"\n#include \"oxygenstyle.h\"\n#include \"config.h\"\n\n#include <gdk\/gdkx.h>\n\nnamespace Oxygen\n{\n\n\n    \/\/_________________________________________________\n    WindowManager::WindowManager( void ):\n        _mode( Full ),\n        _drag( false ),\n        _dragDistance( 4 ),\n        _dragDelay( 500 ),\n        _widget( 0L ),\n        _x(-1),\n        _y(-1)\n    {}\n\n    \/\/_________________________________________________\n    WindowManager::~WindowManager( void )\n    {\n        _map.disconnectAll();\n        _map.clear();\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::registerWidget( GtkWidget* widget )\n    {\n\n        if( _map.contains( widget ) ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::WindowManager::registerWidget - \" << widget << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\" << std::endl;\n        #endif\n\n        \/\/ Force widget to listen to relevant events\n        gtk_widget_add_events( widget,\n            GDK_BUTTON_RELEASE_MASK |\n            GDK_BUTTON_PRESS_MASK   |\n            GDK_LEAVE_NOTIFY_MASK   |\n            GDK_BUTTON1_MOTION_MASK );\n\n        \/\/ allocate new Data object\n        Data& data( _map.registerWidget( widget ) );\n\n        \/\/ connect signals\n        if( _mode != Disabled ) connect( widget, data );\n\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::unregisterWidget( GtkWidget* widget )\n    {\n        if( !_map.contains( widget ) ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::WindowManager::unregisterWidget - \" << widget << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\" << std::endl;\n        #endif\n\n        _map.value( widget ).disconnect( widget );\n        _map.erase( widget );\n\n        if( _widget == widget )\n        {\n            _widget = 0L;\n            _x = -1;\n            _y = -1;\n            _drag = false;\n        }\n\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::setMode( WindowManager::Mode mode )\n    {\n        if( mode == _mode ) return;\n\n        \/\/ connect\/disconnect all data in map, based on new and old mode\n        if( mode == Disabled ) { _map.disconnectAll(); }\n        else if( _mode == Disabled )\n        {\n            DataMap<Data>::Map& map( _map.map() );\n            for( DataMap<Data>::Map::iterator iter = map.begin(); iter != map.end(); iter++ )\n            { connect( iter->first, iter->second ); }\n        }\n\n        \/\/ assign new mode\n        _mode = mode;\n\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmStyleSet( GtkWidget* widget, GtkStyle* , gpointer data )\n    {\n        static_cast<WindowManager*>(data)->unregisterWidget( widget );\n        return false;\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmDestroy( GtkWidget* widget, gpointer data )\n    {\n        static_cast<WindowManager*>(data)->unregisterWidget( widget );\n        return false;\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmButtonPress(GtkWidget *widget, GdkEventButton* event, gpointer data )\n    {\n\n        if( event->type == GDK_BUTTON_PRESS && event->button == Gtk::LeftButton )\n        {\n\n            #if OXYGEN_DEBUG\n            std::cout << \"Oxygen::WindowManager::wmButtonPress - \"\n                << widget\n                << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\"\n                << \" \" << gtk_widget_get_name( widget )\n                << std::endl;\n            #endif\n\n            return static_cast<WindowManager*>(data)->isWindowDragWidget( widget, event );\n\n        } else return false;\n\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmButtonRelease(GtkWidget *widget, GdkEventButton*, gpointer data )\n    { return static_cast<WindowManager*>( data )->finishDrag( widget ); }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmLeave(GtkWidget *widget, GdkEventCrossing*, gpointer data )\n    { return static_cast<WindowManager*>( data )->finishDrag( widget ); }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmMotion( GtkWidget *widget, GdkEventMotion* event, gpointer data )\n    { return static_cast<WindowManager*>(data)->startDrag( widget, event ); }\n\n    \/\/_________________________________________________________________\n    gboolean WindowManager::startDelayedDrag( gpointer data )\n    {\n        static_cast<WindowManager*>( data )->startDrag();\n        return FALSE;\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::isWindowDragWidget( GtkWidget* widget, GdkEventButton* event )\n    {\n        if( _mode == Disabled ) return false;\n        else if( (!_drag) && withinWidget(widget, event ) && useEvent( widget, event ) )\n        {\n\n            \/\/ store widget and event position\n            _widget = widget;\n            _x = int(event->x_root);\n            _y = int(event->y_root);\n\n            \/\/ start timer\n            if( _timer.isRunning() ) _timer.stop();\n            _timer.start( _dragDelay, (GSourceFunc)startDelayedDrag, this );\n\n            \/\/ enable drag and accept\n            _drag = true;\n            return true;\n\n        } else return false;\n    }\n\n    \/\/_________________________________________________________________\n    bool WindowManager::startDrag( GtkWidget* widget, GdkEventMotion* event )\n    {\n\n        \/\/ make sure drag is enabled\n        if( !_drag ) return false;\n\n        \/\/ check displacement with respect to drag start\n        const int distance( abs( _x - int(event->x_root) ) + abs( _y - int(event->y_root) ) );\n\n        if( distance > 0 && _timer.isRunning() ) _timer.stop();\n        if( distance < _dragDistance ) return false;\n\n        \/\/ start drag from current position\n        return startDrag( widget, int(event->x_root), int(event->y_root) );\n\n    }\n\n    \/\/_________________________________________________________________\n    bool WindowManager::startDrag( GtkWidget* widget, int x, int y )\n    {\n        \/\/ create xevent and send.\n        XEvent     xev;\n        GtkWindow  *topLevel = GTK_WINDOW( gtk_widget_get_toplevel( widget ) );\n        GdkWindow  *window = gtk_widget_get_window( GTK_WIDGET( topLevel ) );\n        GdkDisplay *display = gtk_widget_get_display( GTK_WIDGET( topLevel ) );\n        GdkWindow  *root = gdk_screen_get_root_window( gtk_window_get_screen( topLevel ) );\n\n        xev.xclient.type = ClientMessage;\n        xev.xclient.message_type = gdk_x11_get_xatom_by_name_for_display(display, \"_NET_WM_MOVERESIZE\");\n        xev.xclient.display = GDK_DISPLAY_XDISPLAY(display);\n        xev.xclient.window = GDK_WINDOW_XID(window);\n        xev.xclient.format = 32;\n        xev.xclient.data.l[0] = x;\n        xev.xclient.data.l[1] = y;\n        xev.xclient.data.l[2] = 8; \/\/ NET::Move\n        xev.xclient.data.l[3] = Button1;\n        xev.xclient.data.l[4] = 0;\n        XUngrabPointer(GDK_DISPLAY_XDISPLAY(display), CurrentTime);\n\n        XSendEvent(\n            GDK_DISPLAY_XDISPLAY(display),\n            GDK_WINDOW_XID(root),\n            False,\n            SubstructureRedirectMask | SubstructureNotifyMask,\n            &xev);\n\n        \/\/ force a release as some widgets miss it...\n        wmButtonRelease( widget, 0L, this );\n        return true;\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::finishDrag( GtkWidget* widget )\n    {\n\n        _widget = 0L;\n        _x = -1;\n        _y = -1;\n\n        if( _drag )\n        {\n\n            gtk_grab_remove(widget);\n            gdk_pointer_ungrab( CurrentTime );\n            _drag = false;\n            return true;\n\n        } else return false;\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::withinWidget( GtkWidget* widget, GdkEventButton* event ) const\n    {\n\n        \/\/ get widget window\n        GdkWindow *window( gtk_widget_get_window( widget ) );\n\n        \/\/ Some widgets aren't realized (GeditWindow for exemple) ...\n        if( !window ) return true;\n\n        GtkAllocation allocation;\n        #if GTK_CHECK_VERSION(2, 18, 0)\n        gtk_widget_get_allocation( widget, &allocation );\n        #else\n        allocation = widget->allocation;\n        #endif\n\n        \/\/ Need to get absolute coordinates\n        int nx(0);\n        int ny(0);\n        gdk_window_get_origin(window, &nx, &ny );\n        allocation.x += nx;\n        allocation.y += ny;\n\n        return Gtk::gdk_rectangle_contains( &allocation, int(event->x_root), int(event->y_root) );\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::useEvent( GtkWidget* widget, GdkEventButton* event ) const\n    {\n\n        \/\/ check against mode\n        if( _mode == Disabled ) return false;\n        if( _mode == Minimal && !( GTK_IS_TOOLBAR( widget ) || GTK_IS_MENU_BAR( widget ) ) ) return false;\n\n        \/\/ check that button press is inside widget\n        if( !withinWidget( widget, event ) ) return false;\n\n        \/\/ always accept if widget is not a container\n        if( !GTK_IS_CONTAINER( widget ) ) return true;\n\n        \/\/ if widget is a notebook, accept if there is no hovered tab\n        if( GTK_IS_NOTEBOOK( widget ) )\n        {\n            return\n                Style::instance().animations().tabWidgetEngine().contains( widget ) &&\n                Style::instance().animations().tabWidgetEngine().hoveredTab( widget ) == -1;\n        }\n\n        return childrenUseEvent( widget, event );\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::childrenUseEvent( GtkWidget* widget, GdkEventButton* event ) const\n    {\n        \/\/ accept, by default\n        bool usable = true;\n\n        \/\/ get children and check\n        GList *children = gtk_container_get_children( GTK_CONTAINER( widget ) );\n        for( GList *child = g_list_first( children ); child && usable ; child = g_list_next( child ) )\n        {\n\n            \/\/ cast child to GtkWidget\n            if( !GTK_IS_WIDGET( child->data ) ) continue;\n            GtkWidget* childWidget( GTK_WIDGET( child->data ) );\n\n            \/\/ check widget state and type\n            if( gtk_widget_get_state( childWidget ) == GTK_STATE_PRELIGHT ) {\n\n                \/\/ if widget is prelight, we don't need to check where event happen,\n                \/\/ any prelight widget indicate we can't do a move\n                usable = false;\n\n            } else if( !GTK_IS_NOTEBOOK ( childWidget ) && event && withinWidget( childWidget, event ) ) {\n\n                GdkWindow *window = gtk_widget_get_window( childWidget );\n                if( window && gdk_window_is_visible ( window ) )\n                {\n\n                    \/\/ TODO: one could probably check here whether widget is enabled or not,\n                    \/\/ and accept if widget is disabled.\n\n                    if( gtk_widget_get_events ( childWidget ) & GDK_BUTTON_PRESS_MASK )\n                    {\n\n                        \/\/ widget listening to press event\n                        usable = false;\n\n                    } else if(\n                        GTK_IS_MENU_ITEM( childWidget ) ||\n                        GTK_IS_SCROLLED_WINDOW( childWidget ) )\n                    {\n                        \/\/ deal with menu item, GtkMenuItem only listen to\n                        \/\/ GDK_BUTTON_PRESS_MASK when state == GTK_STATE_PRELIGHT\n                        \/\/ so previous check are invalids :(\n                        \/\/\n                        \/\/ same for ScrolledWindow, they do not send motion events\n                        \/\/ to parents so not usable\n                        usable = false;\n\n                    }\n                }\n            }\n\n            \/\/ if child is a container and event has been accepted so far, also check it, recursively\n            if( usable && GTK_IS_CONTAINER( childWidget ) )\n            { usable = childrenUseEvent( childWidget, event ); }\n\n        }\n\n        \/\/ free list\n        if( children ) g_list_free( children );\n\n        return usable;\n    }\n\n    \/\/________________________________________________________________________________\n    void WindowManager::connect( GtkWidget* widget, WindowManager::Data& data )\n    {\n        data._destroyId.connect( G_OBJECT( widget ), \"destroy\", G_CALLBACK( wmDestroy ), this );\n        data._styleId.connect( G_OBJECT( widget ), \"style-set\", G_CALLBACK( wmStyleSet ), this );\n\n        data._pressId.connect( G_OBJECT( widget ), \"button-press-event\", G_CALLBACK( wmButtonPress ), this );\n        data._releaseId.connect( G_OBJECT( widget ), \"button-release-event\", G_CALLBACK( wmButtonRelease ), this );\n        data._leaveId.connect( G_OBJECT( widget ), \"leave-notify-event\", G_CALLBACK( wmLeave ), this );\n        data._motionId.connect( G_OBJECT( widget ), \"motion-notify-event\", G_CALLBACK( wmMotion ), this );\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::Data::disconnect( GtkWidget* )\n    {\n\n        _leaveId.disconnect();\n        _destroyId.disconnect();\n        _pressId.disconnect();\n        _releaseId.disconnect();\n        _motionId.disconnect();\n        _styleId.disconnect();\n\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* oxygenwindowmanager.cpp\n* pass some window mouse press\/release\/move event actions to window manager\n* -------------------\n*\n* Copyright (c) 2010 Cédric Bellegarde <gnumdk@gmail.com>\n* Copyright (c) 2010 Hugo Pereira Da Costa <hugo@oxygen-icons.org>\n*\n* Largely inspired from Qtcurve style\n* Copyright (C) Craig Drummond, 2003 - 2010 craig.p.drummond@gmail.com\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 \"oxygenwindowmanager.h\"\n#include \"oxygenstyle.h\"\n#include \"config.h\"\n\n#include <gdk\/gdkx.h>\n\nnamespace Oxygen\n{\n\n\n    \/\/_________________________________________________\n    WindowManager::WindowManager( void ):\n        _mode( Full ),\n        _drag( false ),\n        _dragDistance( 4 ),\n        _dragDelay( 500 ),\n        _widget( 0L ),\n        _x(-1),\n        _y(-1)\n    { initializeBlackList(); }\n\n    \/\/_________________________________________________\n    WindowManager::~WindowManager( void )\n    {\n        _map.disconnectAll();\n        _map.clear();\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::registerWidget( GtkWidget* widget )\n    {\n\n        if( _map.contains( widget ) ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::WindowManager::registerWidget - \" << widget << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\" << std::endl;\n        #endif\n\n        \/\/ Force widget to listen to relevant events\n        gtk_widget_add_events( widget,\n            GDK_BUTTON_RELEASE_MASK |\n            GDK_BUTTON_PRESS_MASK   |\n            GDK_LEAVE_NOTIFY_MASK   |\n            GDK_BUTTON1_MOTION_MASK );\n\n        \/\/ allocate new Data object\n        Data& data( _map.registerWidget( widget ) );\n\n        \/\/ connect signals\n        if( _mode != Disabled ) connect( widget, data );\n\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::unregisterWidget( GtkWidget* widget )\n    {\n        if( !_map.contains( widget ) ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::WindowManager::unregisterWidget - \" << widget << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\" << std::endl;\n        #endif\n\n        _map.value( widget ).disconnect( widget );\n        _map.erase( widget );\n\n        if( _widget == widget )\n        {\n            _widget = 0L;\n            _x = -1;\n            _y = -1;\n            _drag = false;\n        }\n\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::setMode( WindowManager::Mode mode )\n    {\n        if( mode == _mode ) return;\n\n        \/\/ connect\/disconnect all data in map, based on new and old mode\n        if( mode == Disabled ) { _map.disconnectAll(); }\n        else if( _mode == Disabled )\n        {\n            DataMap<Data>::Map& map( _map.map() );\n            for( DataMap<Data>::Map::iterator iter = map.begin(); iter != map.end(); iter++ )\n            { connect( iter->first, iter->second ); }\n        }\n\n        \/\/ assign new mode\n        _mode = mode;\n\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmStyleSet( GtkWidget* widget, GtkStyle* , gpointer data )\n    {\n        static_cast<WindowManager*>(data)->unregisterWidget( widget );\n        return false;\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmDestroy( GtkWidget* widget, gpointer data )\n    {\n        static_cast<WindowManager*>(data)->unregisterWidget( widget );\n        return false;\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmButtonPress(GtkWidget *widget, GdkEventButton* event, gpointer data )\n    {\n\n        if( event->type == GDK_BUTTON_PRESS && event->button == Gtk::LeftButton )\n        {\n\n            #if OXYGEN_DEBUG\n            std::cout << \"Oxygen::WindowManager::wmButtonPress - \"\n                << widget\n                << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\"\n                << \" \" << gtk_widget_get_name( widget )\n                << std::endl;\n            #endif\n\n            return static_cast<WindowManager*>(data)->isWindowDragWidget( widget, event );\n\n        } else return false;\n\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmButtonRelease(GtkWidget *widget, GdkEventButton*, gpointer data )\n    { return static_cast<WindowManager*>( data )->finishDrag( widget ); }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmLeave(GtkWidget *widget, GdkEventCrossing*, gpointer data )\n    { return static_cast<WindowManager*>( data )->finishDrag( widget ); }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmMotion( GtkWidget *widget, GdkEventMotion* event, gpointer data )\n    { return static_cast<WindowManager*>(data)->startDrag( widget, event ); }\n\n    \/\/_________________________________________________________________\n    gboolean WindowManager::startDelayedDrag( gpointer data )\n    {\n        static_cast<WindowManager*>( data )->startDrag();\n        return FALSE;\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::isWindowDragWidget( GtkWidget* widget, GdkEventButton* event )\n    {\n        if( _mode == Disabled ) return false;\n        else if( (!_drag) && withinWidget(widget, event ) && useEvent( widget, event ) )\n        {\n\n            \/\/ store widget and event position\n            _widget = widget;\n            _x = int(event->x_root);\n            _y = int(event->y_root);\n\n            \/\/ start timer\n            if( _timer.isRunning() ) _timer.stop();\n            _timer.start( _dragDelay, (GSourceFunc)startDelayedDrag, this );\n\n            \/\/ enable drag and accept\n            _drag = true;\n            return true;\n\n        } else return false;\n    }\n\n    \/\/_________________________________________________________________\n    bool WindowManager::startDrag( GtkWidget* widget, GdkEventMotion* event )\n    {\n\n        \/\/ make sure drag is enabled\n        if( !_drag ) return false;\n\n        \/\/ check displacement with respect to drag start\n        const int distance( abs( _x - int(event->x_root) ) + abs( _y - int(event->y_root) ) );\n\n        if( distance > 0 && _timer.isRunning() ) _timer.stop();\n        if( distance < _dragDistance ) return false;\n\n        \/\/ start drag from current position\n        return startDrag( widget, int(event->x_root), int(event->y_root) );\n\n    }\n\n    \/\/_________________________________________________________________\n    bool WindowManager::startDrag( GtkWidget* widget, int x, int y )\n    {\n        \/\/ create xevent and send.\n        XEvent     xev;\n        GtkWindow  *topLevel = GTK_WINDOW( gtk_widget_get_toplevel( widget ) );\n        GdkWindow  *window = gtk_widget_get_window( GTK_WIDGET( topLevel ) );\n        GdkDisplay *display = gtk_widget_get_display( GTK_WIDGET( topLevel ) );\n        GdkWindow  *root = gdk_screen_get_root_window( gtk_window_get_screen( topLevel ) );\n\n        xev.xclient.type = ClientMessage;\n        xev.xclient.message_type = gdk_x11_get_xatom_by_name_for_display(display, \"_NET_WM_MOVERESIZE\");\n        xev.xclient.display = GDK_DISPLAY_XDISPLAY(display);\n        xev.xclient.window = GDK_WINDOW_XID(window);\n        xev.xclient.format = 32;\n        xev.xclient.data.l[0] = x;\n        xev.xclient.data.l[1] = y;\n        xev.xclient.data.l[2] = 8; \/\/ NET::Move\n        xev.xclient.data.l[3] = Button1;\n        xev.xclient.data.l[4] = 0;\n        XUngrabPointer(GDK_DISPLAY_XDISPLAY(display), CurrentTime);\n\n        XSendEvent(\n            GDK_DISPLAY_XDISPLAY(display),\n            GDK_WINDOW_XID(root),\n            False,\n            SubstructureRedirectMask | SubstructureNotifyMask,\n            &xev);\n\n        \/\/ force a release as some widgets miss it...\n        wmButtonRelease( widget, 0L, this );\n        return true;\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::finishDrag( GtkWidget* widget )\n    {\n\n        _widget = 0L;\n        _x = -1;\n        _y = -1;\n\n        if( _drag )\n        {\n\n            gtk_grab_remove(widget);\n            gdk_pointer_ungrab( CurrentTime );\n            _drag = false;\n            return true;\n\n        } else return false;\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::withinWidget( GtkWidget* widget, GdkEventButton* event ) const\n    {\n\n        \/\/ get widget window\n        GdkWindow *window( gtk_widget_get_parent_window( widget ) );\n\n        \/\/ Some widgets aren't realized (GeditWindow for exemple) ...\n        if( !window ) return true;\n\n        GtkAllocation allocation;\n        #if GTK_CHECK_VERSION(2, 18, 0)\n        gtk_widget_get_allocation( widget, &allocation );\n        #else\n        allocation = widget->allocation;\n        #endif\n\n        \/\/ Need to get absolute coordinates\n        int nx(0);\n        int ny(0);\n        gdk_window_get_origin(window, &nx, &ny );\n        allocation.x += nx;\n        allocation.y += ny;\n\n        return Gtk::gdk_rectangle_contains( &allocation, int(event->x_root), int(event->y_root) );\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::useEvent( GtkWidget* widget, GdkEventButton* event ) const\n    {\n\n        \/\/ check against mode\n        if( _mode == Disabled ) return false;\n        if( _mode == Minimal && !( GTK_IS_TOOLBAR( widget ) || GTK_IS_MENU_BAR( widget ) ) ) return false;\n\n        \/\/ always accept if widget is not a container\n        if( !GTK_IS_CONTAINER( widget ) ) return true;\n\n        \/\/ if widget is a notebook, accept if there is no hovered tab\n        if( GTK_IS_NOTEBOOK( widget ) )\n        {\n            return\n                Style::instance().animations().tabWidgetEngine().contains( widget ) &&\n                Style::instance().animations().tabWidgetEngine().hoveredTab( widget ) == -1;\n        }\n\n        return childrenUseEvent( widget, event, false );\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::childrenUseEvent( GtkWidget* widget, GdkEventButton* event, bool inNoteBook ) const\n    {\n        \/\/ accept, by default\n        bool usable = true;\n\n        \/\/ get children and check\n        GList *children = gtk_container_get_children( GTK_CONTAINER( widget ) );\n        for( GList *child = g_list_first( children ); child && usable ; child = g_list_next( child ) )\n        {\n\n            \/\/ cast child to GtkWidget\n            if( !GTK_IS_WIDGET( child->data ) ) continue;\n            GtkWidget* childWidget( GTK_WIDGET( child->data ) );\n\n            \/\/ check widget state and type\n            if( gtk_widget_get_state( childWidget ) == GTK_STATE_PRELIGHT ) {\n\n                \/\/ if widget is prelight, we don't need to check where event happen,\n                \/\/ any prelight widget indicate we can't do a move\n                usable = false;\n\n            } else if( GTK_IS_NOTEBOOK( childWidget ) ) {\n\n                inNoteBook = true;\n\n            } else if( event && withinWidget( childWidget, event ) ) {\n\n                #if OXYGEN_DEBUG\n                std::cout << \"Oxygen::WindowManager::childrenUseEvent - \"\n                    << widget\n                    << \"(\" << G_OBJECT_TYPE_NAME( childWidget ) << \")\"\n                    << \" \" << gtk_widget_get_name( childWidget )\n                    << std::endl;\n                #endif\n\n                GdkWindow *window = gtk_widget_get_window( childWidget );\n                if( window && gdk_window_is_visible ( window ) )\n                {\n\n                    \/\/ check against black-list\n                    if( widgetIsBlackListed( childWidget ) )\n                    {\n\n                        usable = false;\n\n                    } else if( gtk_widget_get_events ( childWidget ) & (GDK_BUTTON_PRESS_MASK|GDK_BUTTON_RELEASE_MASK) ) {\n\n                        \/\/ widget listening to press event\n                        usable = false;\n\n                    } else if( GTK_IS_MENU_ITEM( childWidget ) ) {\n\n                        \/\/ deal with menu item, GtkMenuItem only listen to\n                        \/\/ GDK_BUTTON_PRESS_MASK when state == GTK_STATE_PRELIGHT\n                        \/\/ so previous check are invalids :(\n                        usable = false;\n\n                    } else if( GTK_IS_SCROLLED_WINDOW( childWidget ) && ( !inNoteBook || gtk_widget_is_focus( childWidget ) ) ) {\n\n                        \/\/ Scrolled do not send release events\n                        \/\/ to parents so not usable\n                        usable = false;\n\n                    }\n                }\n            }\n\n            \/\/ if child is a container and event has been accepted so far, also check it, recursively\n            if( usable && GTK_IS_CONTAINER( childWidget ) )\n            { usable = childrenUseEvent( childWidget, event, inNoteBook); }\n\n        }\n\n        \/\/ free list\n        if( children ) g_list_free( children );\n\n        return usable;\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::initializeBlackList( void )\n    {\n        \/\/ clear list\n        _blackList.clear();\n        _blackList.push_back( \"GtkPizza\" );\n        _blackList.push_back( \"GladeDesignLayout\" );\n    }\n\n    \/\/________________________________________________________________________________\n    void WindowManager::connect( GtkWidget* widget, WindowManager::Data& data )\n    {\n        data._destroyId.connect( G_OBJECT( widget ), \"destroy\", G_CALLBACK( wmDestroy ), this );\n        data._styleId.connect( G_OBJECT( widget ), \"style-set\", G_CALLBACK( wmStyleSet ), this );\n\n        data._pressId.connect( G_OBJECT( widget ), \"button-press-event\", G_CALLBACK( wmButtonPress ), this );\n        data._releaseId.connect( G_OBJECT( widget ), \"button-release-event\", G_CALLBACK( wmButtonRelease ), this );\n        data._leaveId.connect( G_OBJECT( widget ), \"leave-notify-event\", G_CALLBACK( wmLeave ), this );\n        data._motionId.connect( G_OBJECT( widget ), \"motion-notify-event\", G_CALLBACK( wmMotion ), this );\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::Data::disconnect( GtkWidget* )\n    {\n\n        _leaveId.disconnect();\n        _destroyId.disconnect();\n        _pressId.disconnect();\n        _releaseId.disconnect();\n        _motionId.disconnect();\n        _styleId.disconnect();\n\n    }\n\n}\n<commit_msg>Move can't happen in an sensitive button<commit_after>\/*\n* oxygenwindowmanager.cpp\n* pass some window mouse press\/release\/move event actions to window manager\n* -------------------\n*\n* Copyright (c) 2010 Cédric Bellegarde <gnumdk@gmail.com>\n* Copyright (c) 2010 Hugo Pereira Da Costa <hugo@oxygen-icons.org>\n*\n* Largely inspired from Qtcurve style\n* Copyright (C) Craig Drummond, 2003 - 2010 craig.p.drummond@gmail.com\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 \"oxygenwindowmanager.h\"\n#include \"oxygenstyle.h\"\n#include \"config.h\"\n\n#include <gdk\/gdkx.h>\n\nnamespace Oxygen\n{\n\n\n    \/\/_________________________________________________\n    WindowManager::WindowManager( void ):\n        _mode( Full ),\n        _drag( false ),\n        _dragDistance( 4 ),\n        _dragDelay( 500 ),\n        _widget( 0L ),\n        _x(-1),\n        _y(-1)\n    { initializeBlackList(); }\n\n    \/\/_________________________________________________\n    WindowManager::~WindowManager( void )\n    {\n        _map.disconnectAll();\n        _map.clear();\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::registerWidget( GtkWidget* widget )\n    {\n\n        if( _map.contains( widget ) ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::WindowManager::registerWidget - \" << widget << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\" << std::endl;\n        #endif\n\n        \/\/ Force widget to listen to relevant events\n        gtk_widget_add_events( widget,\n            GDK_BUTTON_RELEASE_MASK |\n            GDK_BUTTON_PRESS_MASK   |\n            GDK_LEAVE_NOTIFY_MASK   |\n            GDK_BUTTON1_MOTION_MASK );\n\n        \/\/ allocate new Data object\n        Data& data( _map.registerWidget( widget ) );\n\n        \/\/ connect signals\n        if( _mode != Disabled ) connect( widget, data );\n\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::unregisterWidget( GtkWidget* widget )\n    {\n        if( !_map.contains( widget ) ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::WindowManager::unregisterWidget - \" << widget << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\" << std::endl;\n        #endif\n\n        _map.value( widget ).disconnect( widget );\n        _map.erase( widget );\n\n        if( _widget == widget )\n        {\n            _widget = 0L;\n            _x = -1;\n            _y = -1;\n            _drag = false;\n        }\n\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::setMode( WindowManager::Mode mode )\n    {\n        if( mode == _mode ) return;\n\n        \/\/ connect\/disconnect all data in map, based on new and old mode\n        if( mode == Disabled ) { _map.disconnectAll(); }\n        else if( _mode == Disabled )\n        {\n            DataMap<Data>::Map& map( _map.map() );\n            for( DataMap<Data>::Map::iterator iter = map.begin(); iter != map.end(); iter++ )\n            { connect( iter->first, iter->second ); }\n        }\n\n        \/\/ assign new mode\n        _mode = mode;\n\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmStyleSet( GtkWidget* widget, GtkStyle* , gpointer data )\n    {\n        static_cast<WindowManager*>(data)->unregisterWidget( widget );\n        return false;\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmDestroy( GtkWidget* widget, gpointer data )\n    {\n        static_cast<WindowManager*>(data)->unregisterWidget( widget );\n        return false;\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmButtonPress(GtkWidget *widget, GdkEventButton* event, gpointer data )\n    {\n\n        if( event->type == GDK_BUTTON_PRESS && event->button == Gtk::LeftButton )\n        {\n\n            #if OXYGEN_DEBUG\n            std::cout << \"Oxygen::WindowManager::wmButtonPress - \"\n                << widget\n                << \"(\" << G_OBJECT_TYPE_NAME( widget ) << \")\"\n                << \" \" << gtk_widget_get_name( widget )\n                << std::endl;\n            #endif\n\n            return static_cast<WindowManager*>(data)->isWindowDragWidget( widget, event );\n\n        } else return false;\n\n    }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmButtonRelease(GtkWidget *widget, GdkEventButton*, gpointer data )\n    { return static_cast<WindowManager*>( data )->finishDrag( widget ); }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmLeave(GtkWidget *widget, GdkEventCrossing*, gpointer data )\n    { return static_cast<WindowManager*>( data )->finishDrag( widget ); }\n\n    \/\/_________________________________________________\n    gboolean WindowManager::wmMotion( GtkWidget *widget, GdkEventMotion* event, gpointer data )\n    { return static_cast<WindowManager*>(data)->startDrag( widget, event ); }\n\n    \/\/_________________________________________________________________\n    gboolean WindowManager::startDelayedDrag( gpointer data )\n    {\n        static_cast<WindowManager*>( data )->startDrag();\n        return FALSE;\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::isWindowDragWidget( GtkWidget* widget, GdkEventButton* event )\n    {\n        if( _mode == Disabled ) return false;\n        else if( (!_drag) && withinWidget(widget, event ) && useEvent( widget, event ) )\n        {\n\n            \/\/ store widget and event position\n            _widget = widget;\n            _x = int(event->x_root);\n            _y = int(event->y_root);\n\n            \/\/ start timer\n            if( _timer.isRunning() ) _timer.stop();\n            _timer.start( _dragDelay, (GSourceFunc)startDelayedDrag, this );\n\n            \/\/ enable drag and accept\n            _drag = true;\n            return true;\n\n        } else return false;\n    }\n\n    \/\/_________________________________________________________________\n    bool WindowManager::startDrag( GtkWidget* widget, GdkEventMotion* event )\n    {\n\n        \/\/ make sure drag is enabled\n        if( !_drag ) return false;\n\n        \/\/ check displacement with respect to drag start\n        const int distance( abs( _x - int(event->x_root) ) + abs( _y - int(event->y_root) ) );\n\n        if( distance > 0 && _timer.isRunning() ) _timer.stop();\n        if( distance < _dragDistance ) return false;\n\n        \/\/ start drag from current position\n        return startDrag( widget, int(event->x_root), int(event->y_root) );\n\n    }\n\n    \/\/_________________________________________________________________\n    bool WindowManager::startDrag( GtkWidget* widget, int x, int y )\n    {\n        \/\/ create xevent and send.\n        XEvent     xev;\n        GtkWindow  *topLevel = GTK_WINDOW( gtk_widget_get_toplevel( widget ) );\n        GdkWindow  *window = gtk_widget_get_window( GTK_WIDGET( topLevel ) );\n        GdkDisplay *display = gtk_widget_get_display( GTK_WIDGET( topLevel ) );\n        GdkWindow  *root = gdk_screen_get_root_window( gtk_window_get_screen( topLevel ) );\n\n        xev.xclient.type = ClientMessage;\n        xev.xclient.message_type = gdk_x11_get_xatom_by_name_for_display(display, \"_NET_WM_MOVERESIZE\");\n        xev.xclient.display = GDK_DISPLAY_XDISPLAY(display);\n        xev.xclient.window = GDK_WINDOW_XID(window);\n        xev.xclient.format = 32;\n        xev.xclient.data.l[0] = x;\n        xev.xclient.data.l[1] = y;\n        xev.xclient.data.l[2] = 8; \/\/ NET::Move\n        xev.xclient.data.l[3] = Button1;\n        xev.xclient.data.l[4] = 0;\n        XUngrabPointer(GDK_DISPLAY_XDISPLAY(display), CurrentTime);\n\n        XSendEvent(\n            GDK_DISPLAY_XDISPLAY(display),\n            GDK_WINDOW_XID(root),\n            False,\n            SubstructureRedirectMask | SubstructureNotifyMask,\n            &xev);\n\n        \/\/ force a release as some widgets miss it...\n        wmButtonRelease( widget, 0L, this );\n        return true;\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::finishDrag( GtkWidget* widget )\n    {\n\n        _widget = 0L;\n        _x = -1;\n        _y = -1;\n\n        if( _drag )\n        {\n\n            gtk_grab_remove(widget);\n            gdk_pointer_ungrab( CurrentTime );\n            _drag = false;\n            return true;\n\n        } else return false;\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::withinWidget( GtkWidget* widget, GdkEventButton* event ) const\n    {\n\n        \/\/ get widget window\n        GdkWindow *window( gtk_widget_get_parent_window( widget ) );\n\n        \/\/ Some widgets aren't realized (GeditWindow for exemple) ...\n        if( !window ) return true;\n\n        GtkAllocation allocation;\n        #if GTK_CHECK_VERSION(2, 18, 0)\n        gtk_widget_get_allocation( widget, &allocation );\n        #else\n        allocation = widget->allocation;\n        #endif\n\n        \/\/ Need to get absolute coordinates\n        int nx(0);\n        int ny(0);\n        gdk_window_get_origin(window, &nx, &ny );\n        allocation.x += nx;\n        allocation.y += ny;\n\n        return Gtk::gdk_rectangle_contains( &allocation, int(event->x_root), int(event->y_root) );\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::useEvent( GtkWidget* widget, GdkEventButton* event ) const\n    {\n\n        \/\/ check against mode\n        if( _mode == Disabled ) return false;\n        if( _mode == Minimal && !( GTK_IS_TOOLBAR( widget ) || GTK_IS_MENU_BAR( widget ) ) ) return false;\n\n        \/\/ always accept if widget is not a container\n        if( !GTK_IS_CONTAINER( widget ) ) return true;\n\n        \/\/ if widget is a notebook, accept if there is no hovered tab\n        if( GTK_IS_NOTEBOOK( widget ) )\n        {\n            return\n                Style::instance().animations().tabWidgetEngine().contains( widget ) &&\n                Style::instance().animations().tabWidgetEngine().hoveredTab( widget ) == -1;\n        }\n\n        return childrenUseEvent( widget, event, false );\n\n    }\n\n    \/\/_________________________________________________\n    bool WindowManager::childrenUseEvent( GtkWidget* widget, GdkEventButton* event, bool inNoteBook ) const\n    {\n        \/\/ accept, by default\n        bool usable = true;\n\n        \/\/ get children and check\n        GList *children = gtk_container_get_children( GTK_CONTAINER( widget ) );\n        for( GList *child = g_list_first( children ); child && usable ; child = g_list_next( child ) )\n        {\n\n            \/\/ cast child to GtkWidget\n            if( !GTK_IS_WIDGET( child->data ) ) continue;\n            GtkWidget* childWidget( GTK_WIDGET( child->data ) );\n\n            \/\/ check widget state and type\n            if( gtk_widget_get_state( childWidget ) == GTK_STATE_PRELIGHT ) {\n\n                \/\/ if widget is prelight, we don't need to check where event happen,\n                \/\/ any prelight widget indicate we can't do a move\n                usable = false;\n\n            } else if( GTK_IS_BUTTON( childWidget ) &&  gtk_widget_get_state( childWidget ) != GTK_STATE_INSENSITIVE ) {\n                \n                usable = false;\n            \n            } else if( GTK_IS_NOTEBOOK( childWidget ) ) {\n\n                inNoteBook = true;\n\n            } else if( event && withinWidget( childWidget, event ) ) {\n\n                #if OXYGEN_DEBUG\n                std::cout << \"Oxygen::WindowManager::childrenUseEvent - \"\n                    << widget\n                    << \"(\" << G_OBJECT_TYPE_NAME( childWidget ) << \")\"\n                    << \" \" << gtk_widget_get_name( childWidget )\n                    << std::endl;\n                #endif\n\n                GdkWindow *window = gtk_widget_get_window( childWidget );\n                if( window && gdk_window_is_visible ( window ) )\n                {\n\n                    \/\/ check against black-list\n                    if( widgetIsBlackListed( childWidget ) )\n                    {\n\n                        usable = false;\n\n                    } else if( gtk_widget_get_events ( childWidget ) & (GDK_BUTTON_PRESS_MASK|GDK_BUTTON_RELEASE_MASK) ) {\n\n                        \/\/ widget listening to press event\n                        usable = false;\n\n                    } else if( GTK_IS_MENU_ITEM( childWidget ) ) {\n\n                        \/\/ deal with menu item, GtkMenuItem only listen to\n                        \/\/ GDK_BUTTON_PRESS_MASK when state == GTK_STATE_PRELIGHT\n                        \/\/ so previous check are invalids :(\n                        usable = false;\n\n                    } else if( GTK_IS_SCROLLED_WINDOW( childWidget ) && ( !inNoteBook || gtk_widget_is_focus( childWidget ) ) ) {\n\n                        \/\/ Scrolled do not send release events\n                        \/\/ to parents so not usable\n                        usable = false;\n\n                    }\n                }\n            }\n\n            \/\/ if child is a container and event has been accepted so far, also check it, recursively\n            if( usable && GTK_IS_CONTAINER( childWidget ) )\n            { usable = childrenUseEvent( childWidget, event, inNoteBook); }\n\n        }\n\n        \/\/ free list\n        if( children ) g_list_free( children );\n\n        return usable;\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::initializeBlackList( void )\n    {\n        \/\/ clear list\n        _blackList.clear();\n        _blackList.push_back( \"GtkPizza\" );\n        _blackList.push_back( \"GladeDesignLayout\" );\n    }\n\n    \/\/________________________________________________________________________________\n    void WindowManager::connect( GtkWidget* widget, WindowManager::Data& data )\n    {\n        data._destroyId.connect( G_OBJECT( widget ), \"destroy\", G_CALLBACK( wmDestroy ), this );\n        data._styleId.connect( G_OBJECT( widget ), \"style-set\", G_CALLBACK( wmStyleSet ), this );\n\n        data._pressId.connect( G_OBJECT( widget ), \"button-press-event\", G_CALLBACK( wmButtonPress ), this );\n        data._releaseId.connect( G_OBJECT( widget ), \"button-release-event\", G_CALLBACK( wmButtonRelease ), this );\n        data._leaveId.connect( G_OBJECT( widget ), \"leave-notify-event\", G_CALLBACK( wmLeave ), this );\n        data._motionId.connect( G_OBJECT( widget ), \"motion-notify-event\", G_CALLBACK( wmMotion ), this );\n    }\n\n    \/\/_________________________________________________\n    void WindowManager::Data::disconnect( GtkWidget* )\n    {\n\n        _leaveId.disconnect();\n        _destroyId.disconnect();\n        _pressId.disconnect();\n        _releaseId.disconnect();\n        _motionId.disconnect();\n        _styleId.disconnect();\n\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ .SECTION Thanks\n\/\/ This test was implemented by Philippe Pebay, Kitware SAS 2012\n\n#include \"vtkDataObjectCollection.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkMath.h\"\n#include \"vtkMultiBlockDataSet.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkTable.h\"\n#include \"vtkTimerLog.h\"\n#include \"vtkAutoCorrelativeStatistics.h\"\n\n\/\/=============================================================================\nint TestAutoCorrelativeStatistics( int, char *[] )\n{\n  int testStatus = 0;\n\n  \/\/ ************** Test with 3 columns of input data **************\n\n  \/\/ Input data\n  double mingledData[] =\n    {\n      46,\n      45,\n      47,\n      49,\n      46,\n      47,\n      46,\n      46,\n      47,\n      46,\n      47,\n      49,\n      49,\n      49,\n      47,\n      45,\n      50,\n      50,\n      46,\n      46,\n      51,\n      50,\n      48,\n      48,\n      52,\n      54,\n      48,\n      47,\n      52,\n      52,\n      49,\n      49,\n      53,\n      54,\n      50,\n      50,\n      53,\n      54,\n      50,\n      52,\n      53,\n      53,\n      50,\n      51,\n      54,\n      54,\n      49,\n      49,\n      52,\n      52,\n      50,\n      51,\n      52,\n      52,\n      49,\n      47,\n      48,\n      48,\n      48,\n      50,\n      46,\n      48,\n      47,\n      47,\n    };\n\n  \/\/ Test with entire data set\n  int nVals1 = 32;\n\n  vtkDoubleArray* dataset1Arr = vtkDoubleArray::New();\n  dataset1Arr->SetNumberOfComponents( 1 );\n  dataset1Arr->SetName( \"Metric 0\" );\n\n  vtkDoubleArray* dataset2Arr = vtkDoubleArray::New();\n  dataset2Arr->SetNumberOfComponents( 1 );\n  dataset2Arr->SetName( \"Metric 1\" );\n\n  vtkDoubleArray* dataset3Arr = vtkDoubleArray::New();\n  dataset3Arr->SetNumberOfComponents( 1 );\n  dataset3Arr->SetName( \"Metric 2\" );\n\n  for ( int i = 0; i < nVals1; ++ i )\n    {\n    int ti = i << 1;\n    dataset1Arr->InsertNextValue( mingledData[ti] );\n    dataset2Arr->InsertNextValue( mingledData[ti + 1] );\n    dataset3Arr->InsertNextValue( -1. );\n    }\n\n  vtkTable* datasetTable1 = vtkTable::New();\n  datasetTable1->AddColumn( dataset1Arr );\n  dataset1Arr->Delete();\n  datasetTable1->AddColumn( dataset2Arr );\n  dataset2Arr->Delete();\n  datasetTable1->AddColumn( dataset3Arr );\n  dataset3Arr->Delete();\n\n  \/\/ Pairs of interest\n  int nMetrics = 3;\n  vtkStdString columns[] =\n    {\n      \"Metric 1\",\n      \"Metric 2\",\n      \"Metric 0\"\n    };\n\n  \/\/ Reference values\n  \/\/ Means for metrics 0, 1, and 2, respectively\n  double means1[] = { 49.21875 , 49.5, -1. };\n\n  \/\/ Standard deviations for metrics 0, 1, and 2, respectively\n  double vars1[] = { 5.9828629, 7.548397, 0. };\n\n  \/\/ Set autocorrelative statistics algorithm and its input data port\n  vtkAutoCorrelativeStatistics* as1 = vtkAutoCorrelativeStatistics::New();\n\n  \/\/ First verify that absence of input does not cause trouble\n  cout << \"\\n## Verifying that absence of input does not cause trouble... \";\n  as1->Update();\n  cout << \"done.\\n\";\n\n  \/\/ Prepare first test with data\n  as1->SetInputData( vtkStatisticsAlgorithm::INPUT_DATA, datasetTable1 );\n  datasetTable1->Delete();\n\n  \/\/ Select Columns of Interest\n  for ( int i = 0; i< nMetrics; ++ i )\n    {\n    as1->AddColumn( columns[i] );\n    }\n\n  \/\/ Test Learn, and Derive options\n  as1->SetLearnOption( true );\n  as1->SetDeriveOption( true );\n  as1->SetAssessOption( false );\n  as1->SetTestOption( false );\n  as1->Update();\n\n  \/\/ Get output data and meta tables\n  vtkTable* outputData1 = as1->GetOutput( vtkStatisticsAlgorithm::OUTPUT_DATA );\n  vtkMultiBlockDataSet* outputMetaAS1 = vtkMultiBlockDataSet::SafeDownCast( as1->GetOutputDataObject( vtkStatisticsAlgorithm::OUTPUT_MODEL ) );\n  vtkTable* outputPrimary1 = vtkTable::SafeDownCast( outputMetaAS1->GetBlock( 0 ) );\n  vtkTable* outputDerived1 = vtkTable::SafeDownCast( outputMetaAS1->GetBlock( 1 ) );\n  vtkTable* outputTest1 = as1->GetOutput( vtkStatisticsAlgorithm::OUTPUT_TEST );\n\n  cout << \"\\n## Calculated the following primary statistics for first data set:\\n\";\n  for ( vtkIdType r = 0; r < outputPrimary1->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < outputPrimary1->GetNumberOfColumns(); ++ i )\n      {\n      cout << outputPrimary1->GetColumnName( i )\n           << \"=\"\n           << outputPrimary1->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n\n    \/\/ Verify some of the calculated primary statistics\n    if ( fabs ( outputPrimary1->GetValueByName( r, \"Mean Xs\" ).ToDouble() - means1[r] ) > 1.e-6 )\n      {\n      vtkGenericWarningMacro(\"Incorrect mean\");\n      testStatus = 1;\n      }\n    cout << \"\\n\";\n    }\n\n  cout << \"\\n## Calculated the following derived statistics for first data set:\\n\";\n  for ( vtkIdType r = 0; r < outputDerived1->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < outputDerived1->GetNumberOfColumns(); ++ i )\n      {\n      cout << outputDerived1->GetColumnName( i )\n           << \"=\"\n           << outputDerived1->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n\n    \/\/ Verify some of the calculated derived statistics\n    if ( fabs ( outputDerived1->GetValueByName( r, \"Variance Xs\" ).ToDouble() - vars1[r] ) > 1.e-5 )\n      {\n      vtkGenericWarningMacro(\"Incorrect variance\");\n      testStatus = 1;\n      }\n    cout << \"\\n\";\n    }\n\n  \/\/ Clean up\n  as1->Delete();\n\n  \/\/ ************** Pseudo-random sample to inspect auto-correlation properties *********\n  int nVals = 10000;\n\n  vtkDoubleArray* datasetNormal = vtkDoubleArray::New();\n  datasetNormal->SetNumberOfComponents( 1 );\n  datasetNormal->SetName( \"Standard Normal\" );\n\n  vtkDoubleArray* datasetUniform = vtkDoubleArray::New();\n  datasetUniform->SetNumberOfComponents( 1 );\n  datasetUniform->SetName( \"Standard Uniform\" );\n\n  vtkDoubleArray* datasetLogNormal = vtkDoubleArray::New();\n  datasetLogNormal->SetNumberOfComponents( 1 );\n  datasetLogNormal->SetName( \"Standard Log-Normal\" );\n\n  vtkDoubleArray* datasetExponential = vtkDoubleArray::New();\n  datasetExponential->SetNumberOfComponents( 1 );\n  datasetExponential->SetName( \"Standard Exponential\" );\n\n  vtkDoubleArray* datasetLaplace = vtkDoubleArray::New();\n  datasetLaplace->SetNumberOfComponents( 1 );\n  datasetLaplace->SetName( \"Standard Laplace\" );\n\n  \/\/ Seed random number generator\n  vtkMath::RandomSeed( static_cast<int>( vtkTimerLog::GetUniversalTime() ) );\n\n  for ( int i = 0; i < nVals; ++ i )\n    {\n    datasetNormal->InsertNextValue( vtkMath::Gaussian() );\n    datasetUniform->InsertNextValue( vtkMath::Random() );\n    datasetLogNormal->InsertNextValue( exp( vtkMath::Gaussian() ) );\n    datasetExponential->InsertNextValue( -log ( vtkMath::Random() ) );\n    double u = vtkMath::Random() - .5;\n    datasetLaplace->InsertNextValue( ( u < 0. ? 1. : -1. ) * log ( 1. - 2. * fabs( u ) ) );\n    }\n\n  vtkTable* gaussianTable = vtkTable::New();\n  gaussianTable->AddColumn( datasetNormal );\n  datasetNormal->Delete();\n  gaussianTable->AddColumn( datasetUniform );\n  datasetUniform->Delete();\n  gaussianTable->AddColumn( datasetLogNormal );\n  datasetLogNormal->Delete();\n  gaussianTable->AddColumn( datasetExponential );\n  datasetExponential->Delete();\n  gaussianTable->AddColumn( datasetLaplace );\n  datasetLaplace->Delete();\n\n  \/\/ Set autocorrelative statistics algorithm and its input data port\n  vtkAutoCorrelativeStatistics* as2 = vtkAutoCorrelativeStatistics::New();\n  as2->SetInputData( vtkStatisticsAlgorithm::INPUT_DATA, gaussianTable );\n  gaussianTable->Delete();\n\n  \/\/ Select Column of Interest\n  as2->AddColumn( \"Standard Normal\" );\n  as2->AddColumn( \"Standard Uniform\" );\n  as2->AddColumn( \"Standard Log-Normal\" );\n  as2->AddColumn( \"Standard Exponential\" );\n  as2->AddColumn( \"Standard Laplace\" );\n\n  \/\/ Test Learn, and Derive options\n  as2->SetLearnOption( true );\n  as2->SetDeriveOption( true );\n  as2->SetTestOption( false );\n  as2->SetAssessOption( false );\n  as2->SetAutoCorrelationOffset( 1 );\n  as2->Update();\n\n  \/\/ Get output data and meta tables\n  vtkMultiBlockDataSet* outputMetaAS2 = vtkMultiBlockDataSet::SafeDownCast( as2->GetOutputDataObject( vtkStatisticsAlgorithm::OUTPUT_MODEL ) );\n  vtkTable* outputPrimary4 = vtkTable::SafeDownCast( outputMetaAS2->GetBlock( 0 ) );\n  vtkTable* outputDerived4 = vtkTable::SafeDownCast( outputMetaAS2->GetBlock( 1 ) );\n  vtkTable* outputTest4 = as2->GetOutput( vtkStatisticsAlgorithm::OUTPUT_TEST );\n\n  cout << \"\\n## Calculated the following primary statistics for pseudo-random variables (n=\"\n       << nVals\n       << \"):\\n\";\n  for ( vtkIdType r = 0; r < outputPrimary4->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < outputPrimary4->GetNumberOfColumns(); ++ i )\n      {\n      cout << outputPrimary4->GetColumnName( i )\n           << \"=\"\n           << outputPrimary4->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n\n    cout << \"\\n\";\n    }\n\n  cout << \"\\n## Calculated the following derived statistics for pseudo-random variables (n=\"\n       << nVals\n       << \"):\\n\";\n  for ( vtkIdType r = 0; r < outputDerived4->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < outputDerived4->GetNumberOfColumns(); ++ i )\n      {\n      cout << outputDerived4->GetColumnName( i )\n           << \"=\"\n           << outputDerived4->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n\n    cout << \"\\n\";\n    }\n\n  \/\/ Clean up\n  as2->Delete();\n\n  return testStatus;\n}\n<commit_msg>Removed forgotten unused variables from test<commit_after>\/\/ .SECTION Thanks\n\/\/ This test was implemented by Philippe Pebay, Kitware SAS 2012\n\n#include \"vtkDataObjectCollection.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkMath.h\"\n#include \"vtkMultiBlockDataSet.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkTable.h\"\n#include \"vtkTimerLog.h\"\n#include \"vtkAutoCorrelativeStatistics.h\"\n\n\/\/=============================================================================\nint TestAutoCorrelativeStatistics( int, char *[] )\n{\n  int testStatus = 0;\n\n  \/\/ ************** Test with 3 columns of input data **************\n\n  \/\/ Input data\n  double mingledData[] =\n    {\n      46,\n      45,\n      47,\n      49,\n      46,\n      47,\n      46,\n      46,\n      47,\n      46,\n      47,\n      49,\n      49,\n      49,\n      47,\n      45,\n      50,\n      50,\n      46,\n      46,\n      51,\n      50,\n      48,\n      48,\n      52,\n      54,\n      48,\n      47,\n      52,\n      52,\n      49,\n      49,\n      53,\n      54,\n      50,\n      50,\n      53,\n      54,\n      50,\n      52,\n      53,\n      53,\n      50,\n      51,\n      54,\n      54,\n      49,\n      49,\n      52,\n      52,\n      50,\n      51,\n      52,\n      52,\n      49,\n      47,\n      48,\n      48,\n      48,\n      50,\n      46,\n      48,\n      47,\n      47,\n    };\n\n  \/\/ Test with entire data set\n  int nVals1 = 32;\n\n  vtkDoubleArray* dataset1Arr = vtkDoubleArray::New();\n  dataset1Arr->SetNumberOfComponents( 1 );\n  dataset1Arr->SetName( \"Metric 0\" );\n\n  vtkDoubleArray* dataset2Arr = vtkDoubleArray::New();\n  dataset2Arr->SetNumberOfComponents( 1 );\n  dataset2Arr->SetName( \"Metric 1\" );\n\n  vtkDoubleArray* dataset3Arr = vtkDoubleArray::New();\n  dataset3Arr->SetNumberOfComponents( 1 );\n  dataset3Arr->SetName( \"Metric 2\" );\n\n  for ( int i = 0; i < nVals1; ++ i )\n    {\n    int ti = i << 1;\n    dataset1Arr->InsertNextValue( mingledData[ti] );\n    dataset2Arr->InsertNextValue( mingledData[ti + 1] );\n    dataset3Arr->InsertNextValue( -1. );\n    }\n\n  vtkTable* datasetTable1 = vtkTable::New();\n  datasetTable1->AddColumn( dataset1Arr );\n  dataset1Arr->Delete();\n  datasetTable1->AddColumn( dataset2Arr );\n  dataset2Arr->Delete();\n  datasetTable1->AddColumn( dataset3Arr );\n  dataset3Arr->Delete();\n\n  \/\/ Pairs of interest\n  int nMetrics = 3;\n  vtkStdString columns[] =\n    {\n      \"Metric 1\",\n      \"Metric 2\",\n      \"Metric 0\"\n    };\n\n  \/\/ Reference values\n  \/\/ Means for metrics 0, 1, and 2, respectively\n  double means1[] = { 49.21875 , 49.5, -1. };\n\n  \/\/ Standard deviations for metrics 0, 1, and 2, respectively\n  double vars1[] = { 5.9828629, 7.548397, 0. };\n\n  \/\/ Set autocorrelative statistics algorithm and its input data port\n  vtkAutoCorrelativeStatistics* as1 = vtkAutoCorrelativeStatistics::New();\n\n  \/\/ First verify that absence of input does not cause trouble\n  cout << \"\\n## Verifying that absence of input does not cause trouble... \";\n  as1->Update();\n  cout << \"done.\\n\";\n\n  \/\/ Prepare first test with data\n  as1->SetInputData( vtkStatisticsAlgorithm::INPUT_DATA, datasetTable1 );\n  datasetTable1->Delete();\n\n  \/\/ Select Columns of Interest\n  for ( int i = 0; i< nMetrics; ++ i )\n    {\n    as1->AddColumn( columns[i] );\n    }\n\n  \/\/ Test Learn, and Derive options\n  as1->SetLearnOption( true );\n  as1->SetDeriveOption( true );\n  as1->SetAssessOption( false );\n  as1->SetTestOption( false );\n  as1->Update();\n\n  \/\/ Get output data and meta tables\n  vtkMultiBlockDataSet* outputMetaAS1 = vtkMultiBlockDataSet::SafeDownCast( as1->GetOutputDataObject( vtkStatisticsAlgorithm::OUTPUT_MODEL ) );\n  vtkTable* outputPrimary1 = vtkTable::SafeDownCast( outputMetaAS1->GetBlock( 0 ) );\n  vtkTable* outputDerived1 = vtkTable::SafeDownCast( outputMetaAS1->GetBlock( 1 ) );\n\n  cout << \"\\n## Calculated the following primary statistics for first data set:\\n\";\n  for ( vtkIdType r = 0; r < outputPrimary1->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < outputPrimary1->GetNumberOfColumns(); ++ i )\n      {\n      cout << outputPrimary1->GetColumnName( i )\n           << \"=\"\n           << outputPrimary1->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n\n    \/\/ Verify some of the calculated primary statistics\n    if ( fabs ( outputPrimary1->GetValueByName( r, \"Mean Xs\" ).ToDouble() - means1[r] ) > 1.e-6 )\n      {\n      vtkGenericWarningMacro(\"Incorrect mean\");\n      testStatus = 1;\n      }\n    cout << \"\\n\";\n    }\n\n  cout << \"\\n## Calculated the following derived statistics for first data set:\\n\";\n  for ( vtkIdType r = 0; r < outputDerived1->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < outputDerived1->GetNumberOfColumns(); ++ i )\n      {\n      cout << outputDerived1->GetColumnName( i )\n           << \"=\"\n           << outputDerived1->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n\n    \/\/ Verify some of the calculated derived statistics\n    if ( fabs ( outputDerived1->GetValueByName( r, \"Variance Xs\" ).ToDouble() - vars1[r] ) > 1.e-5 )\n      {\n      vtkGenericWarningMacro(\"Incorrect variance\");\n      testStatus = 1;\n      }\n    cout << \"\\n\";\n    }\n\n  \/\/ Clean up\n  as1->Delete();\n\n  \/\/ ************** Pseudo-random sample to inspect auto-correlation properties *********\n  int nVals = 10000;\n\n  vtkDoubleArray* datasetNormal = vtkDoubleArray::New();\n  datasetNormal->SetNumberOfComponents( 1 );\n  datasetNormal->SetName( \"Standard Normal\" );\n\n  vtkDoubleArray* datasetUniform = vtkDoubleArray::New();\n  datasetUniform->SetNumberOfComponents( 1 );\n  datasetUniform->SetName( \"Standard Uniform\" );\n\n  vtkDoubleArray* datasetLogNormal = vtkDoubleArray::New();\n  datasetLogNormal->SetNumberOfComponents( 1 );\n  datasetLogNormal->SetName( \"Standard Log-Normal\" );\n\n  vtkDoubleArray* datasetExponential = vtkDoubleArray::New();\n  datasetExponential->SetNumberOfComponents( 1 );\n  datasetExponential->SetName( \"Standard Exponential\" );\n\n  vtkDoubleArray* datasetLaplace = vtkDoubleArray::New();\n  datasetLaplace->SetNumberOfComponents( 1 );\n  datasetLaplace->SetName( \"Standard Laplace\" );\n\n  \/\/ Seed random number generator\n  vtkMath::RandomSeed( static_cast<int>( vtkTimerLog::GetUniversalTime() ) );\n\n  for ( int i = 0; i < nVals; ++ i )\n    {\n    datasetNormal->InsertNextValue( vtkMath::Gaussian() );\n    datasetUniform->InsertNextValue( vtkMath::Random() );\n    datasetLogNormal->InsertNextValue( exp( vtkMath::Gaussian() ) );\n    datasetExponential->InsertNextValue( -log ( vtkMath::Random() ) );\n    double u = vtkMath::Random() - .5;\n    datasetLaplace->InsertNextValue( ( u < 0. ? 1. : -1. ) * log ( 1. - 2. * fabs( u ) ) );\n    }\n\n  vtkTable* gaussianTable = vtkTable::New();\n  gaussianTable->AddColumn( datasetNormal );\n  datasetNormal->Delete();\n  gaussianTable->AddColumn( datasetUniform );\n  datasetUniform->Delete();\n  gaussianTable->AddColumn( datasetLogNormal );\n  datasetLogNormal->Delete();\n  gaussianTable->AddColumn( datasetExponential );\n  datasetExponential->Delete();\n  gaussianTable->AddColumn( datasetLaplace );\n  datasetLaplace->Delete();\n\n  \/\/ Set autocorrelative statistics algorithm and its input data port\n  vtkAutoCorrelativeStatistics* as2 = vtkAutoCorrelativeStatistics::New();\n  as2->SetInputData( vtkStatisticsAlgorithm::INPUT_DATA, gaussianTable );\n  gaussianTable->Delete();\n\n  \/\/ Select Column of Interest\n  as2->AddColumn( \"Standard Normal\" );\n  as2->AddColumn( \"Standard Uniform\" );\n  as2->AddColumn( \"Standard Log-Normal\" );\n  as2->AddColumn( \"Standard Exponential\" );\n  as2->AddColumn( \"Standard Laplace\" );\n\n  \/\/ Test Learn, and Derive options\n  as2->SetLearnOption( true );\n  as2->SetDeriveOption( true );\n  as2->SetTestOption( false );\n  as2->SetAssessOption( false );\n  as2->SetAutoCorrelationOffset( 1 );\n  as2->Update();\n\n  \/\/ Get output data and meta tables\n  vtkMultiBlockDataSet* outputMetaAS2 = vtkMultiBlockDataSet::SafeDownCast( as2->GetOutputDataObject( vtkStatisticsAlgorithm::OUTPUT_MODEL ) );\n  vtkTable* outputPrimary4 = vtkTable::SafeDownCast( outputMetaAS2->GetBlock( 0 ) );\n  vtkTable* outputDerived4 = vtkTable::SafeDownCast( outputMetaAS2->GetBlock( 1 ) );\n\n  cout << \"\\n## Calculated the following primary statistics for pseudo-random variables (n=\"\n       << nVals\n       << \"):\\n\";\n  for ( vtkIdType r = 0; r < outputPrimary4->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < outputPrimary4->GetNumberOfColumns(); ++ i )\n      {\n      cout << outputPrimary4->GetColumnName( i )\n           << \"=\"\n           << outputPrimary4->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n\n    cout << \"\\n\";\n    }\n\n  cout << \"\\n## Calculated the following derived statistics for pseudo-random variables (n=\"\n       << nVals\n       << \"):\\n\";\n  for ( vtkIdType r = 0; r < outputDerived4->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < outputDerived4->GetNumberOfColumns(); ++ i )\n      {\n      cout << outputDerived4->GetColumnName( i )\n           << \"=\"\n           << outputDerived4->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n\n    cout << \"\\n\";\n    }\n\n  \/\/ Clean up\n  as2->Delete();\n\n  return testStatus;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * FlexEnumParam.cpp\r\n *\r\n * Copyright (C) 2017 by Universitaet Stuttgart (VIS). \r\n * Alle Rechte vorbehalten.\r\n *\/\r\n\r\n#include \"stdafx.h\"\r\n#include \"mmcore\/param\/FlexEnumParam.h\"\r\n#include \"vislib\/IllegalStateException.h\"\r\n#include \"vislib\/StringConverter.h\"\r\n#include \"vislib\/UTF8Encoder.h\"\r\n#include <set>\r\n\r\nusing namespace megamol::core::param;\r\n\r\n\r\n\/*\r\n * FlexEnumParam::FlexEnumParam\r\n *\/\r\nFlexEnumParam::FlexEnumParam(const std::string& initVal)\r\n        : AbstractParam(), val(initVal), values() {\r\n    \/\/ intentionally empty\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::~FlexEnumParam\r\n *\/\r\nFlexEnumParam::~FlexEnumParam(void) {\r\n    \/\/ intentionally empty\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::ClearTypePairs\r\n *\/\r\nvoid megamol::core::param::FlexEnumParam::ClearValues(void) {\r\n    this->SetHash(this->GetHash() + 1);\r\n    this->values.clear();\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::Definition\r\n *\/\r\nvoid FlexEnumParam::Definition(vislib::RawStorage& outDef) const {\r\n    vislib::StringA utf8;\r\n    unsigned int s = 6;\r\n    unsigned int c = 0;\r\n    for (auto &v : this->values) {\r\n        s += v.length() + 1; \/\/terminating zero\r\n    }\r\n    s += sizeof(unsigned int);\r\n\r\n    outDef.AssertSize(s);\r\n    memcpy(outDef.AsAt<char>(0), \"MMFENU\", 6);\r\n    s = 6 + sizeof(unsigned int);\r\n    std::set<std::string> sorted(this->values.begin(), this->values.end());\r\n    for (auto &v: sorted) {\r\n        unsigned int strsize = v.length() + 1;\r\n        memcpy(outDef.AsAt<char>(s), v.c_str(), strsize);\r\n        s += strsize;\r\n        c++;\r\n    }\r\n    *outDef.AsAt<unsigned int>(6) = c;\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::ParseValue\r\n *\/\r\nbool FlexEnumParam::ParseValue(const vislib::TString& v) {\r\n    try {\r\n        this->SetValue(T2A(v));\r\n        \/\/auto iter = this->values.find(std::string(T2A(v)));\r\n        \/\/if (iter == this->values.end()) {\r\n        \/\/    return false;\r\n        \/\/} else {\r\n        \/\/    this->SetValue(*iter);\r\n        \/\/    return true;\r\n        \/\/}\r\n    } catch(...) {\r\n    }\r\n    return false;\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::AddValue\r\n *\/\r\nFlexEnumParam* FlexEnumParam::AddValue(const std::string& name) {\r\n    auto iter = this->values.find(name);\r\n    if (iter == this->values.end()) {\r\n        this->SetHash(this->GetHash() + 1);\r\n        this->values.insert(name);\r\n    }\r\n    return this;\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::SetValue\r\n *\/\r\nvoid FlexEnumParam::SetValue(const std::string& v, bool setDirty) {\r\n    if (this->val != v) {\r\n        this->val = v;\r\n        if (setDirty) this->setDirty();\r\n    }\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::ValueString\r\n *\/\r\nvislib::TString FlexEnumParam::ValueString(void) const {\r\n    return A2T(val.c_str());\r\n}\r\n<commit_msg>Fixed Linux issue.<commit_after>\/*\r\n * FlexEnumParam.cpp\r\n *\r\n * Copyright (C) 2017 by Universitaet Stuttgart (VIS). \r\n * Alle Rechte vorbehalten.\r\n *\/\r\n\r\n#include \"stdafx.h\"\r\n#include \"mmcore\/param\/FlexEnumParam.h\"\r\n#include \"vislib\/IllegalStateException.h\"\r\n#include \"vislib\/StringConverter.h\"\r\n#include \"vislib\/UTF8Encoder.h\"\r\n#include <set>\r\n\r\nusing namespace megamol::core::param;\r\n\r\n\r\n\/*\r\n * FlexEnumParam::FlexEnumParam\r\n *\/\r\nFlexEnumParam::FlexEnumParam(const std::string& initVal)\r\n        : AbstractParam(), val(initVal), values() {\r\n    \/\/ intentionally empty\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::~FlexEnumParam\r\n *\/\r\nFlexEnumParam::~FlexEnumParam(void) {\r\n    \/\/ intentionally empty\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::ClearTypePairs\r\n *\/\r\nvoid megamol::core::param::FlexEnumParam::ClearValues(void) {\r\n    this->SetHash(this->GetHash() + 1);\r\n    this->values.clear();\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::Definition\r\n *\/\r\nvoid FlexEnumParam::Definition(vislib::RawStorage& outDef) const {\r\n    vislib::StringA utf8;\r\n    unsigned int s = 6;\r\n    unsigned int c = 0;\r\n    for (auto &v : this->values) {\r\n        s += v.length() + 1; \/\/terminating zero\r\n    }\r\n    s += sizeof(unsigned int);\r\n\r\n    outDef.AssertSize(s);\r\n    memcpy(outDef.AsAt<char>(0), \"MMFENU\", 6);\r\n    s = 6 + sizeof(unsigned int);\r\n    std::set<std::string> sorted(this->values.begin(), this->values.end());\r\n    for (auto &v: sorted) {\r\n        unsigned int strsize = v.length() + 1;\r\n        memcpy(outDef.AsAt<char>(s), v.c_str(), strsize);\r\n        s += strsize;\r\n        c++;\r\n    }\r\n    *outDef.AsAt<unsigned int>(6) = c;\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::ParseValue\r\n *\/\r\nbool FlexEnumParam::ParseValue(const vislib::TString& v) {\r\n    try {\r\n        this->SetValue(std::string(T2A(v)));\r\n        \/\/auto iter = this->values.find(std::string(T2A(v)));\r\n        \/\/if (iter == this->values.end()) {\r\n        \/\/    return false;\r\n        \/\/} else {\r\n        \/\/    this->SetValue(*iter);\r\n        \/\/    return true;\r\n        \/\/}\r\n    } catch(...) {\r\n    }\r\n    return false;\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::AddValue\r\n *\/\r\nFlexEnumParam* FlexEnumParam::AddValue(const std::string& name) {\r\n    auto iter = this->values.find(name);\r\n    if (iter == this->values.end()) {\r\n        this->SetHash(this->GetHash() + 1);\r\n        this->values.insert(name);\r\n    }\r\n    return this;\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::SetValue\r\n *\/\r\nvoid FlexEnumParam::SetValue(const std::string& v, bool setDirty) {\r\n    if (this->val != v) {\r\n        this->val = v;\r\n        if (setDirty) this->setDirty();\r\n    }\r\n}\r\n\r\n\r\n\/*\r\n * FlexEnumParam::ValueString\r\n *\/\r\nvislib::TString FlexEnumParam::ValueString(void) const {\r\n    return A2T(val.c_str());\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"diff_system.h\"\n#include \"equation_systems.h\"\n#include \"linear_solver.h\"\n#include \"newton_solver.h\"\n#include \"numeric_vector.h\"\n#include \"sparse_matrix.h\"\n\n\nNewtonSolver::NewtonSolver (sys_type& s) :\n  Parent(s), linear_solver(LinearSolver<Number>::build())\n{\n}\n\n\n\nNewtonSolver::~NewtonSolver ()\n{\n}\n\n\n\nvoid NewtonSolver::solve()\n{\n\/\/ The number of steps and the stopping criterion\n\/\/ for the nonlinear iterations.\nconst unsigned int max_nonlinear_steps = 100;\nconst unsigned int max_linear_iterations = 10000;\n\n\/\/ Stopping criteria for nonlinear iterations\nconst Real nonlinear_abs_step_tolerance = 1.e-9;\nconst Real nonlinear_rel_step_tolerance = 1.e-9;\nconst Real nonlinear_abs_res_tolerance = 1.e-9;\nconst Real nonlinear_rel_res_tolerance = 1.e-9;\n\/\/ Maximum amount by which to reduce Newton steps\nconst Real minsteplength = 0.1;\n\/\/ Initial linear solver tolerance in main nonlinear solver\nconst Real linear_tolerance = 1.e-3;\n\/\/ Amount by which nonlinear residual should exceed linear solver\n\/\/ tolerance\nconst Real relative_tolerance = 1.e-3;\n\/\/ We'll shut up eventually...\nconst bool verbose_convergence_chatter = true;\n\n\n  EquationSystems equation_systems = _system.get_equation_systems();\n\n  equation_systems.parameters.set<unsigned int>\n                   (\"linear solver maximum iterations\") =\n                   max_linear_iterations;\n\n  NumericVector<Number> &solution = *(_system.solution);\n  NumericVector<Number> &newton_iterate =\n    _system.get_vector(\"_nonlinear_solution\");\n  NumericVector<Number> &rhs = *(_system.rhs);\n\n  SparseMatrix<Number> &matrix = *(_system.matrix);\n\n  \/\/ Now we begin the nonlinear loop\n  newton_iterate.zero();\n  newton_iterate.close();\n\n  \/\/ Prepare to take incomplete steps\n  Real last_residual, first_residual;\n\n  \/\/ Set starting linear tolerance\n  Real current_linear_tolerance = linear_tolerance;\n\n  for (unsigned int l=0; l<max_nonlinear_steps; ++l)\n    {\n      _system.assembly(true, true);\n      rhs.close();\n      Real current_residual = rhs.l2_norm();\n      if (!l)\n        first_residual = current_residual;\n      last_residual = current_residual;\nstd::cout << \"Nonlinear Residual: \" << current_residual << std::endl;\n\n      \/\/ Make sure our linear tolerance is low enough\n      if (current_linear_tolerance > current_residual * relative_tolerance)\n        {\n          current_linear_tolerance = current_residual * relative_tolerance;\n          equation_systems.parameters.set<Real> \n            (\"linear solver tolerance\") = current_linear_tolerance;\n        }\n\n      \/\/ At this point newton_iterate is the current guess, and\n      \/\/ solution is now about to become the NEGATIVE of the next\n      \/\/ Newton step\n\nstd::cout << \"Linear solve starting\" << std::endl;\n\n      \/\/ Solve the linear system.  Two cases:\n      const std::pair<unsigned int, Real> rval =\n        (_system.have_matrix(\"Preconditioner\")) ?\n      \/\/ 1.) User-supplied preconditioner\n        linear_solver->solve (matrix, _system.get_matrix(\"Preconditioner\"),\n                              solution, rhs, current_linear_tolerance,\n                              max_linear_iterations) :\n      \/\/ 2.) Use system matrix for the preconditioner\n        linear_solver->solve (matrix, solution, rhs,\n                              current_linear_tolerance, \n                              max_linear_iterations);\n\nstd::cout << \"Linear solve converged, step \" << rval.first\n          << \", residual \" << rval.second\n          << \", tolerance \" << current_linear_tolerance << std::endl;\n\n      \/\/ Compute the l2 norm of the nonlinear update\n      Real norm_delta = solution.l2_norm();\n\nstd::cout << \"Taking full Newton step\" << std::endl;\n          \/\/ Take a full Newton step\n      newton_iterate.add (-1., solution);\n      newton_iterate.close();\n\n      \/\/ Check residual with full Newton step\n      Real steplength = 1.;\n      _system.assembly(true, false);\n\n      \/\/ backtrack if necessary\n      rhs.close()\n      current_residual = rhs.l2_norm();\n      while (current_residual > last_residual)\n        {\n          \/\/ Reduce step size to 1\/2, 1\/4, etc.\n          steplength \/= 2.;\n          norm_delta \/= 2.;\nstd::cout << \"Shrinking Newton step to \" << steplength << std::endl;\n              newton_iterate.add (steplength, solution);\n              newton_iterate.close();\n\n          \/\/ Check residual with fractional Newton step\n          std::cout << \"          Checking \" << std::flush;\n          _system.assembly (true, false);\n          current_residual = rhs.l2_norm();\n\n          if (steplength\/2. < minsteplength && \n              current_residual > last_residual)\n            {\nstd::cout << \"Inexact Newton step FAILED at step \" << l << std::endl;\n\n              error();\n            }\n        }\n\n      \/\/ Compute the l2 norm of the whole solution\n      const Real norm_total = newton_iterate.l2_norm();\n\n      \/\/ Print out information for the \n      \/\/ nonlinear iterations.\n      std::cout << \"    Nonlinear step: |du|\/|u| = \"\n                << norm_delta \/ norm_total\n                << \", |du| = \"\n                << norm_delta\n                << std::endl;\n\n      \/\/ We haven't converged unless we pass a convergence test\n      bool has_converged = false;\n\n      \/\/ Is our absolute residual low enough?\n      if (current_residual < nonlinear_abs_res_tolerance)\n        {\n          std::cout << \"  Nonlinear solver converged, step \"\n                    << l\n                    << \", residual \"\n                    << current_residual\n                    << std::endl;\n          has_converged = true;\n        }\n      else if (verbose_convergence_chatter)\n        {\n          std::cout << \"  Nonlinear solver current_residual \"\n                    << current_residual\n                    << \" > \"\n                    << (nonlinear_abs_res_tolerance)\n                    << std::endl;\n        }\n\n      \/\/ Is our relative residual low enough?\n      if ((current_residual \/ first_residual) < nonlinear_rel_res_tolerance)\n        {\n          std::cout << \"  Nonlinear solver converged, step \"\n                    << l\n                    << \", residual reduction \"\n                    << current_residual \/ first_residual\n                    << std::endl;\n          has_converged = true;\n        }\n      else if (verbose_convergence_chatter)\n        {\n          std::cout << \"  Nonlinear solver current\/first residual \"\n                    << (current_residual \/ first_residual)\n                    << \" > \"\n                    << nonlinear_rel_res_tolerance\n                    << std::endl;\n        }\n\n      \/\/ Is our absolute Newton step size small enough?\n      if (l != 0 && (norm_delta \/ steplength <\n          nonlinear_abs_step_tolerance))\n        {\n          std::cout << \"  Nonlinear solver converged, step \"\n                    << l\n                    << \", absolute step size \"\n                    << norm_delta \/ steplength\n                    << std::endl;\n          has_converged = true;\n        }\n\n      \/\/ Is our relative Newton step size small enough?\n      if (l != 0 && (norm_delta \/ steplength \/ norm_total <\n          nonlinear_rel_step_tolerance))\n        {\n          std::cout << \"  Nonlinear solver converged, step \"\n                    << l\n                    << \", relative step size \"\n                    << (norm_delta \/ steplength \/ norm_total)\n                    << std::endl;\n          has_converged = true;\n        }\n\n      \/\/ Terminate the solution iteration if the difference between\n      \/\/ this iteration and the last is sufficiently small.\n      if (has_converged)\n        {\n          break;\n        }\n      if (l >= max_nonlinear_steps - 1)\n        {\n          std::cout << \"  Nonlinear solver DIVERGED at step \"\n                    << l\n                    << std::endl;\n          error();\n          continue;\n        }\n    } \/\/ end nonlinear loop\n}\n<commit_msg>Typo fix<commit_after>\n#include \"diff_system.h\"\n#include \"equation_systems.h\"\n#include \"linear_solver.h\"\n#include \"newton_solver.h\"\n#include \"numeric_vector.h\"\n#include \"sparse_matrix.h\"\n\n\nNewtonSolver::NewtonSolver (sys_type& s) :\n  Parent(s), linear_solver(LinearSolver<Number>::build())\n{\n}\n\n\n\nNewtonSolver::~NewtonSolver ()\n{\n}\n\n\n\nvoid NewtonSolver::solve()\n{\n\/\/ The number of steps and the stopping criterion\n\/\/ for the nonlinear iterations.\nconst unsigned int max_nonlinear_steps = 100;\nconst unsigned int max_linear_iterations = 10000;\n\n\/\/ Stopping criteria for nonlinear iterations\nconst Real nonlinear_abs_step_tolerance = 1.e-9;\nconst Real nonlinear_rel_step_tolerance = 1.e-9;\nconst Real nonlinear_abs_res_tolerance = 1.e-9;\nconst Real nonlinear_rel_res_tolerance = 1.e-9;\n\/\/ Maximum amount by which to reduce Newton steps\nconst Real minsteplength = 0.1;\n\/\/ Initial linear solver tolerance in main nonlinear solver\nconst Real linear_tolerance = 1.e-3;\n\/\/ Amount by which nonlinear residual should exceed linear solver\n\/\/ tolerance\nconst Real relative_tolerance = 1.e-3;\n\/\/ We'll shut up eventually...\nconst bool verbose_convergence_chatter = true;\n\n\n  EquationSystems equation_systems = _system.get_equation_systems();\n\n  equation_systems.parameters.set<unsigned int>\n                   (\"linear solver maximum iterations\") =\n                   max_linear_iterations;\n\n  NumericVector<Number> &solution = *(_system.solution);\n  NumericVector<Number> &newton_iterate =\n    _system.get_vector(\"_nonlinear_solution\");\n  NumericVector<Number> &rhs = *(_system.rhs);\n\n  SparseMatrix<Number> &matrix = *(_system.matrix);\n\n  \/\/ Now we begin the nonlinear loop\n  newton_iterate.zero();\n  newton_iterate.close();\n\n  \/\/ Prepare to take incomplete steps\n  Real last_residual, first_residual;\n\n  \/\/ Set starting linear tolerance\n  Real current_linear_tolerance = linear_tolerance;\n\n  for (unsigned int l=0; l<max_nonlinear_steps; ++l)\n    {\n      _system.assembly(true, true);\n      rhs.close();\n      Real current_residual = rhs.l2_norm();\n      if (!l)\n        first_residual = current_residual;\n      last_residual = current_residual;\nstd::cout << \"Nonlinear Residual: \" << current_residual << std::endl;\n\n      \/\/ Make sure our linear tolerance is low enough\n      if (current_linear_tolerance > current_residual * relative_tolerance)\n        {\n          current_linear_tolerance = current_residual * relative_tolerance;\n          equation_systems.parameters.set<Real> \n            (\"linear solver tolerance\") = current_linear_tolerance;\n        }\n\n      \/\/ At this point newton_iterate is the current guess, and\n      \/\/ solution is now about to become the NEGATIVE of the next\n      \/\/ Newton step\n\nstd::cout << \"Linear solve starting\" << std::endl;\n\n      \/\/ Solve the linear system.  Two cases:\n      const std::pair<unsigned int, Real> rval =\n        (_system.have_matrix(\"Preconditioner\")) ?\n      \/\/ 1.) User-supplied preconditioner\n        linear_solver->solve (matrix, _system.get_matrix(\"Preconditioner\"),\n                              solution, rhs, current_linear_tolerance,\n                              max_linear_iterations) :\n      \/\/ 2.) Use system matrix for the preconditioner\n        linear_solver->solve (matrix, solution, rhs,\n                              current_linear_tolerance, \n                              max_linear_iterations);\n\nstd::cout << \"Linear solve converged, step \" << rval.first\n          << \", residual \" << rval.second\n          << \", tolerance \" << current_linear_tolerance << std::endl;\n\n      \/\/ Compute the l2 norm of the nonlinear update\n      Real norm_delta = solution.l2_norm();\n\nstd::cout << \"Taking full Newton step\" << std::endl;\n          \/\/ Take a full Newton step\n      newton_iterate.add (-1., solution);\n      newton_iterate.close();\n\n      \/\/ Check residual with full Newton step\n      Real steplength = 1.;\n      _system.assembly(true, false);\n\n      \/\/ backtrack if necessary\n      rhs.close();\n      current_residual = rhs.l2_norm();\n      while (current_residual > last_residual)\n        {\n          \/\/ Reduce step size to 1\/2, 1\/4, etc.\n          steplength \/= 2.;\n          norm_delta \/= 2.;\nstd::cout << \"Shrinking Newton step to \" << steplength << std::endl;\n              newton_iterate.add (steplength, solution);\n              newton_iterate.close();\n\n          \/\/ Check residual with fractional Newton step\n          std::cout << \"          Checking \" << std::flush;\n          _system.assembly (true, false);\n          current_residual = rhs.l2_norm();\n\n          if (steplength\/2. < minsteplength && \n              current_residual > last_residual)\n            {\nstd::cout << \"Inexact Newton step FAILED at step \" << l << std::endl;\n\n              error();\n            }\n        }\n\n      \/\/ Compute the l2 norm of the whole solution\n      const Real norm_total = newton_iterate.l2_norm();\n\n      \/\/ Print out information for the \n      \/\/ nonlinear iterations.\n      std::cout << \"    Nonlinear step: |du|\/|u| = \"\n                << norm_delta \/ norm_total\n                << \", |du| = \"\n                << norm_delta\n                << std::endl;\n\n      \/\/ We haven't converged unless we pass a convergence test\n      bool has_converged = false;\n\n      \/\/ Is our absolute residual low enough?\n      if (current_residual < nonlinear_abs_res_tolerance)\n        {\n          std::cout << \"  Nonlinear solver converged, step \"\n                    << l\n                    << \", residual \"\n                    << current_residual\n                    << std::endl;\n          has_converged = true;\n        }\n      else if (verbose_convergence_chatter)\n        {\n          std::cout << \"  Nonlinear solver current_residual \"\n                    << current_residual\n                    << \" > \"\n                    << (nonlinear_abs_res_tolerance)\n                    << std::endl;\n        }\n\n      \/\/ Is our relative residual low enough?\n      if ((current_residual \/ first_residual) < nonlinear_rel_res_tolerance)\n        {\n          std::cout << \"  Nonlinear solver converged, step \"\n                    << l\n                    << \", residual reduction \"\n                    << current_residual \/ first_residual\n                    << std::endl;\n          has_converged = true;\n        }\n      else if (verbose_convergence_chatter)\n        {\n          std::cout << \"  Nonlinear solver current\/first residual \"\n                    << (current_residual \/ first_residual)\n                    << \" > \"\n                    << nonlinear_rel_res_tolerance\n                    << std::endl;\n        }\n\n      \/\/ Is our absolute Newton step size small enough?\n      if (l != 0 && (norm_delta \/ steplength <\n          nonlinear_abs_step_tolerance))\n        {\n          std::cout << \"  Nonlinear solver converged, step \"\n                    << l\n                    << \", absolute step size \"\n                    << norm_delta \/ steplength\n                    << std::endl;\n          has_converged = true;\n        }\n\n      \/\/ Is our relative Newton step size small enough?\n      if (l != 0 && (norm_delta \/ steplength \/ norm_total <\n          nonlinear_rel_step_tolerance))\n        {\n          std::cout << \"  Nonlinear solver converged, step \"\n                    << l\n                    << \", relative step size \"\n                    << (norm_delta \/ steplength \/ norm_total)\n                    << std::endl;\n          has_converged = true;\n        }\n\n      \/\/ Terminate the solution iteration if the difference between\n      \/\/ this iteration and the last is sufficiently small.\n      if (has_converged)\n        {\n          break;\n        }\n      if (l >= max_nonlinear_steps - 1)\n        {\n          std::cout << \"  Nonlinear solver DIVERGED at step \"\n                    << l\n                    << std::endl;\n          error();\n          continue;\n        }\n    } \/\/ end nonlinear loop\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of TelepathyQt\n *\n * @copyright Copyright (C) 2009-2011 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * @license LGPL 2.1\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 <TelepathyQt\/Debug>\n#include <TelepathyQt\/Types>\n\n#include <QDebug>\n#include <QtGui>\n\n#include \"roster-window.h\"\n\nint main(int argc, char **argv)\n{\n    QApplication app(argc, argv);\n\n    if (argc < 2) {\n        qDebug() << \"usage:\" << argv[0] << \"<account name, as in mc-tool list>\";\n        return 1;\n    }\n\n    Tp::registerTypes();\n    Tp::enableDebug(true);\n    Tp::enableWarnings(true);\n\n    QString accountPath = QLatin1String(argv[1]);\n    RosterWindow w(accountPath);\n    w.show();\n\n    return app.exec();\n}\n<commit_msg>roster example: Include QApplication header as it's not part of QtGui in Qt5.<commit_after>\/**\n * This file is part of TelepathyQt\n *\n * @copyright Copyright (C) 2009-2011 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * @license LGPL 2.1\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 <TelepathyQt\/Debug>\n#include <TelepathyQt\/Types>\n\n#include <QApplication>\n#include <QDebug>\n#include <QtGui>\n\n#include \"roster-window.h\"\n\nint main(int argc, char **argv)\n{\n    QApplication app(argc, argv);\n\n    if (argc < 2) {\n        qDebug() << \"usage:\" << argv[0] << \"<account name, as in mc-tool list>\";\n        return 1;\n    }\n\n    Tp::registerTypes();\n    Tp::enableDebug(true);\n    Tp::enableWarnings(true);\n\n    QString accountPath = QLatin1String(argv[1]);\n    RosterWindow w(accountPath);\n    w.show();\n\n    return app.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (c), Microsoft Open Technologies, Inc.\n* 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 met:\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* 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\n#include \"Win32_StackTrace.h\"\n#include \"Win32_RedisLog.h\"\n#include <DbgHelp.h>\n#include <signal.h>\n#include <stdio.h>\n\nstatic HANDLE process;\nstatic IMAGEHLP_SYMBOL64* pSymbol = (IMAGEHLP_SYMBOL64*) malloc(sizeof(IMAGEHLP_SYMBOL64) + MAX_PATH*sizeof(TCHAR));\nstatic IMAGEHLP_LINE64 line;\nstatic BOOLEAN processingException = FALSE;\nstatic CHAR modulePath[MAX_PATH];\nstatic BOOL symbolsInitialized = FALSE;\n\nstatic const char* exceptionDescription(const DWORD& code)\n{\n    switch (code) {\n    case EXCEPTION_ACCESS_VIOLATION:         return \"EXCEPTION_ACCESS_VIOLATION\";\n    case EXCEPTION_ARRAY_BOUNDS_EXCEEDED:    return \"EXCEPTION_ARRAY_BOUNDS_EXCEEDED\";\n    case EXCEPTION_BREAKPOINT:               return \"EXCEPTION_BREAKPOINT\";\n    case EXCEPTION_DATATYPE_MISALIGNMENT:    return \"EXCEPTION_DATATYPE_MISALIGNMENT\";\n    case EXCEPTION_FLT_DENORMAL_OPERAND:     return \"EXCEPTION_FLT_DENORMAL_OPERAND\";\n    case EXCEPTION_FLT_DIVIDE_BY_ZERO:       return \"EXCEPTION_FLT_DIVIDE_BY_ZERO\";\n    case EXCEPTION_FLT_INEXACT_RESULT:       return \"EXCEPTION_FLT_INEXACT_RESULT\";\n    case EXCEPTION_FLT_INVALID_OPERATION:    return \"EXCEPTION_FLT_INVALID_OPERATION\";\n    case EXCEPTION_FLT_OVERFLOW:             return \"EXCEPTION_FLT_OVERFLOW\";\n    case EXCEPTION_FLT_STACK_CHECK:          return \"EXCEPTION_FLT_STACK_CHECK\";\n    case EXCEPTION_FLT_UNDERFLOW:            return \"EXCEPTION_FLT_UNDERFLOW\";\n    case EXCEPTION_ILLEGAL_INSTRUCTION:      return \"EXCEPTION_ILLEGAL_INSTRUCTION\";\n    case EXCEPTION_IN_PAGE_ERROR:            return \"EXCEPTION_IN_PAGE_ERROR\";\n    case EXCEPTION_INT_DIVIDE_BY_ZERO:       return \"EXCEPTION_INT_DIVIDE_BY_ZERO\";\n    case EXCEPTION_INT_OVERFLOW:             return \"EXCEPTION_INT_OVERFLOW\";\n    case EXCEPTION_INVALID_DISPOSITION:      return \"EXCEPTION_INVALID_DISPOSITION\";\n    case EXCEPTION_NONCONTINUABLE_EXCEPTION: return \"EXCEPTION_NONCONTINUABLE_EXCEPTION\";\n    case EXCEPTION_PRIV_INSTRUCTION:         return \"EXCEPTION_PRIV_INSTRUCTION\";\n    case EXCEPTION_SINGLE_STEP:              return \"EXCEPTION_SINGLE_STEP\";\n    case EXCEPTION_STACK_OVERFLOW:           return \"EXCEPTION_STACK_OVERFLOW\";\n    default: return \"UNKNOWN EXCEPTION\";\n    }\n}\n\n\/* Returns the index of the last backslash in the file path *\/\nint GetFilenameStart(CHAR* path) {\n    int pos = 0;\n    int found = 0;\n    if (path != NULL) {\n        while (path[pos] != '\\0' && pos < MAX_PATH) {\n            if (path[pos] == '\\\\') {\n                found = pos + 1;\n            }\n            ++pos;\n        }\n    }\n\n    return found;\n}\n\n#ifdef _WIN64\nvoid LogStackTrace() {\n    BOOL            result;\n    HANDLE          thread;\n    CONTEXT         context;\n    STACKFRAME64    stack;\n    ULONG           frame;\n    DWORD64         dw64Displacement;\n    DWORD           dwDisplacement;\n\n    memset(&stack, 0, sizeof(STACKFRAME64));\n    memset(pSymbol, '\\0', sizeof(*pSymbol) + MAX_PATH);\n    memset(&modulePath[0], '\\0', sizeof(modulePath));\n    line.LineNumber = 0;\n\n    RtlCaptureContext(&context);\n    process = GetCurrentProcess();\n    thread = GetCurrentThread();\n    dw64Displacement = 0;\n    stack.AddrPC.Offset = context.Rip;\n    stack.AddrPC.Mode = AddrModeFlat;\n    stack.AddrStack.Offset = context.Rsp;\n    stack.AddrStack.Mode = AddrModeFlat;\n    stack.AddrFrame.Offset = context.Rbp;\n    stack.AddrFrame.Mode = AddrModeFlat;\n\n    for (frame = 0;; frame++){\n        result = StackWalk64(\n            IMAGE_FILE_MACHINE_AMD64,\n            process,\n            thread,\n            &stack,\n            &context,\n            NULL,\n            SymFunctionTableAccess64,\n            SymGetModuleBase64,\n            NULL\n            );\n\n        pSymbol->MaxNameLength = MAX_PATH;\n        pSymbol->SizeOfStruct = sizeof(IMAGEHLP_SYMBOL64);\n\n        SymGetSymFromAddr64(process, stack.AddrPC.Offset, &dw64Displacement, pSymbol);\n        SymGetLineFromAddr64(process, stack.AddrPC.Offset, &dwDisplacement, &line);\n\n        DWORD64 moduleBase = SymGetModuleBase64(process, stack.AddrPC.Offset);\n        if (moduleBase)\n        {\n            GetModuleFileNameA((HINSTANCE) moduleBase, modulePath, MAX_PATH);\n        }\n\n        redisLog(REDIS_WARNING | REDIS_LOG_RAW, \"%s!%s(%s:%d)(0x%08LX, 0x%08LX, 0x%08LX, 0x%08LX)\\n\",\n            &modulePath[GetFilenameStart(modulePath)],\n            pSymbol->Name,\n            line.FileName,\n            line.LineNumber,\n            stack.Params[0],\n            stack.Params[1],\n            stack.Params[2],\n            stack.Params[3]\n            );\n\n        if (!result) {\n            break;\n        }\n    }\n}\n#else\nvoid LogStackTrace() {}\n#endif\n\nvoid StackTraceInfo() {\n    if (symbolsInitialized) {\n        redisLog(REDIS_WARNING, \"--- STACK TRACE\");\n        LogStackTrace();\n    }\n}\n\nvoid ServerInfo() {\n    redisLog(REDIS_WARNING, \"--- INFO OUTPUT\");\n    \/\/ Call antirez routine to log the info output\n    redisLogRaw(REDIS_WARNING | REDIS_LOG_RAW, genRedisInfoString(\"all\"));\n}\n\nvoid BugReportEnd(){\n    redisLogRaw(REDIS_WARNING,\n        \"\\n=== REDIS BUG REPORT END. Make sure to include from START to END. ===\\n\\n\"\n        \"       Please report the crash by opening an issue on github:\\n\\n\"\n        \"           http:\/\/github.com\/MSOpenTech\/redis\/issues\\n\\n\"\n        \"  Suspect RAM error? Use redis-server --test-memory to verify it.\\n\\n\"\n        );\n}\n\nLONG WINAPI UnhandledExceptiontHandler(PEXCEPTION_POINTERS info) {\n    if (!processingException) {\n        processingException = true;\n        if (info->ExceptionRecord == NULL || info->ExceptionRecord->ExceptionCode == NULL) {\n            redisLog(REDIS_WARNING, \"Unhandled Exception: code not available\");\n            return EXCEPTION_CONTINUE_SEARCH;\n        }\n\n        const char* exDescription = exceptionDescription(info->ExceptionRecord->ExceptionCode);\n        \/\/ If it's an application exception don't process it\n        if (strcmp(exDescription, \"UNKNOWN EXCEPTION\") == 0) {\n            return EXCEPTION_CONTINUE_SEARCH;\n        }\n\n        \/\/ Call antirez routine to log the start of the bug report (for asserts in antirez code, the start has already been logged)\n        bugReportStart();\n        redisLog(REDIS_WARNING, \"--- %s\", exDescription);\n        StackTraceInfo();\n        ServerInfo();\n        BugReportEnd();\n        processingException = false;\n    }\n    return EXCEPTION_CONTINUE_SEARCH;\n}\n\n\/* Handler to trap dlmalloc abort calls *\/\nextern \"C\" void AbortHandler(int signal_number) {\n    bugReportStart();\n    redisLog(REDIS_WARNING, \"--- ABORT WAS CALLED\");\n    StackTraceInfo();\n    BugReportEnd();\n}\n\nvoid InitSymbols() {\n    \/\/ Symbols preloading, it's required to print the stacktrace when an OOM exception is raised\n    SymSetOptions(SYMOPT_LOAD_LINES | SYMOPT_UNDNAME );\n\n    line.SizeOfStruct = sizeof(IMAGEHLP_LINE64);\n    symbolsInitialized = SymInitialize(process, NULL, TRUE);\n    if (!symbolsInitialized) {\n        DWORD error = GetLastError();\n        redisLog(REDIS_WARNING, \"Failed to initialize process symbols, error: %d\", error);\n    }\n}\n\nvoid StackTraceInit(void) {\n    process = GetCurrentProcess();\n    InitSymbols();\n    SetUnhandledExceptionFilter(UnhandledExceptiontHandler);\n    signal(SIGABRT, &AbortHandler);\n}\n<commit_msg>Cleaned up the UnhandledExceptiontHandler() code.<commit_after>\/*\n* Copyright (c), Microsoft Open Technologies, Inc.\n* 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 met:\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* 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\n#include \"Win32_StackTrace.h\"\n#include \"Win32_RedisLog.h\"\n#include <DbgHelp.h>\n#include <signal.h>\n#include <stdio.h>\n\nstatic IMAGEHLP_SYMBOL64* pSymbol = (IMAGEHLP_SYMBOL64*) malloc(sizeof(IMAGEHLP_SYMBOL64) + MAX_PATH*sizeof(TCHAR));\nstatic IMAGEHLP_LINE64 line;\nstatic BOOLEAN processingException = FALSE;\nstatic CHAR modulePath[MAX_PATH];\nstatic BOOL symbolsInitialized = FALSE;\n\nstatic const char* exceptionDescription(const DWORD& code)\n{\n    switch (code) {\n    case EXCEPTION_ACCESS_VIOLATION:         return \"EXCEPTION_ACCESS_VIOLATION\";\n    case EXCEPTION_ARRAY_BOUNDS_EXCEEDED:    return \"EXCEPTION_ARRAY_BOUNDS_EXCEEDED\";\n    case EXCEPTION_BREAKPOINT:               return \"EXCEPTION_BREAKPOINT\";\n    case EXCEPTION_DATATYPE_MISALIGNMENT:    return \"EXCEPTION_DATATYPE_MISALIGNMENT\";\n    case EXCEPTION_FLT_DENORMAL_OPERAND:     return \"EXCEPTION_FLT_DENORMAL_OPERAND\";\n    case EXCEPTION_FLT_DIVIDE_BY_ZERO:       return \"EXCEPTION_FLT_DIVIDE_BY_ZERO\";\n    case EXCEPTION_FLT_INEXACT_RESULT:       return \"EXCEPTION_FLT_INEXACT_RESULT\";\n    case EXCEPTION_FLT_INVALID_OPERATION:    return \"EXCEPTION_FLT_INVALID_OPERATION\";\n    case EXCEPTION_FLT_OVERFLOW:             return \"EXCEPTION_FLT_OVERFLOW\";\n    case EXCEPTION_FLT_STACK_CHECK:          return \"EXCEPTION_FLT_STACK_CHECK\";\n    case EXCEPTION_FLT_UNDERFLOW:            return \"EXCEPTION_FLT_UNDERFLOW\";\n    case EXCEPTION_ILLEGAL_INSTRUCTION:      return \"EXCEPTION_ILLEGAL_INSTRUCTION\";\n    case EXCEPTION_IN_PAGE_ERROR:            return \"EXCEPTION_IN_PAGE_ERROR\";\n    case EXCEPTION_INT_DIVIDE_BY_ZERO:       return \"EXCEPTION_INT_DIVIDE_BY_ZERO\";\n    case EXCEPTION_INT_OVERFLOW:             return \"EXCEPTION_INT_OVERFLOW\";\n    case EXCEPTION_INVALID_DISPOSITION:      return \"EXCEPTION_INVALID_DISPOSITION\";\n    case EXCEPTION_NONCONTINUABLE_EXCEPTION: return \"EXCEPTION_NONCONTINUABLE_EXCEPTION\";\n    case EXCEPTION_PRIV_INSTRUCTION:         return \"EXCEPTION_PRIV_INSTRUCTION\";\n    case EXCEPTION_SINGLE_STEP:              return \"EXCEPTION_SINGLE_STEP\";\n    case EXCEPTION_STACK_OVERFLOW:           return \"EXCEPTION_STACK_OVERFLOW\";\n    default: return \"UNKNOWN EXCEPTION\";\n    }\n}\n\n\/* Returns the index of the last backslash in the file path *\/\nint GetFilenameStart(CHAR* path) {\n    int pos = 0;\n    int found = 0;\n    if (path != NULL) {\n        while (path[pos] != '\\0' && pos < MAX_PATH) {\n            if (path[pos] == '\\\\') {\n                found = pos + 1;\n            }\n            ++pos;\n        }\n    }\n\n    return found;\n}\n\n#ifdef _WIN64\nvoid LogStackTrace() {\n    BOOL            result;\n    HANDLE          thread;\n    HANDLE          process;\n    CONTEXT         context;\n    STACKFRAME64    stack;\n    ULONG           frame;\n    DWORD64         dw64Displacement;\n    DWORD           dwDisplacement;\n\n    memset(&stack, 0, sizeof(STACKFRAME64));\n    memset(pSymbol, '\\0', sizeof(*pSymbol) + MAX_PATH);\n    memset(&modulePath[0], '\\0', sizeof(modulePath));\n    line.LineNumber = 0;\n\n    RtlCaptureContext(&context);\n    process = GetCurrentProcess();\n    thread = GetCurrentThread();\n    dw64Displacement = 0;\n    stack.AddrPC.Offset = context.Rip;\n    stack.AddrPC.Mode = AddrModeFlat;\n    stack.AddrStack.Offset = context.Rsp;\n    stack.AddrStack.Mode = AddrModeFlat;\n    stack.AddrFrame.Offset = context.Rbp;\n    stack.AddrFrame.Mode = AddrModeFlat;\n\n    for (frame = 0;; frame++){\n        result = StackWalk64(\n            IMAGE_FILE_MACHINE_AMD64,\n            process,\n            thread,\n            &stack,\n            &context,\n            NULL,\n            SymFunctionTableAccess64,\n            SymGetModuleBase64,\n            NULL\n            );\n\n        pSymbol->MaxNameLength = MAX_PATH;\n        pSymbol->SizeOfStruct = sizeof(IMAGEHLP_SYMBOL64);\n\n        SymGetSymFromAddr64(process, stack.AddrPC.Offset, &dw64Displacement, pSymbol);\n        SymGetLineFromAddr64(process, stack.AddrPC.Offset, &dwDisplacement, &line);\n\n        DWORD64 moduleBase = SymGetModuleBase64(process, stack.AddrPC.Offset);\n        if (moduleBase)\n        {\n            GetModuleFileNameA((HINSTANCE) moduleBase, modulePath, MAX_PATH);\n        }\n\n        redisLog(REDIS_WARNING | REDIS_LOG_RAW, \"%s!%s(%s:%d)(0x%08LX, 0x%08LX, 0x%08LX, 0x%08LX)\\n\",\n            &modulePath[GetFilenameStart(modulePath)],\n            pSymbol->Name,\n            line.FileName,\n            line.LineNumber,\n            stack.Params[0],\n            stack.Params[1],\n            stack.Params[2],\n            stack.Params[3]\n            );\n\n        if (!result) {\n            break;\n        }\n    }\n}\n#else\nvoid LogStackTrace() {}\n#endif\n\nvoid StackTraceInfo() {\n    if (symbolsInitialized) {\n        redisLog(REDIS_WARNING, \"--- STACK TRACE\");\n        LogStackTrace();\n    }\n}\n\nvoid ServerInfo() {\n    redisLog(REDIS_WARNING, \"--- INFO OUTPUT\");\n    \/\/ Call antirez routine to log the info output\n    redisLogRaw(REDIS_WARNING | REDIS_LOG_RAW, genRedisInfoString(\"all\"));\n}\n\nvoid BugReportEnd(){\n    redisLogRaw(REDIS_WARNING,\n        \"\\n=== REDIS BUG REPORT END. Make sure to include from START to END. ===\\n\\n\"\n        \"       Please report the crash by opening an issue on github:\\n\\n\"\n        \"           http:\/\/github.com\/MSOpenTech\/redis\/issues\\n\\n\"\n        \"  Suspect RAM error? Use redis-server --test-memory to verify it.\\n\\n\"\n        );\n}\n\nLONG WINAPI UnhandledExceptiontHandler(PEXCEPTION_POINTERS info) {\n    if (!processingException) {\n        const char* exDescription = \"Exception code not available\";\n        processingException = true;\n        if (info->ExceptionRecord != NULL && info->ExceptionRecord->ExceptionCode != NULL) {\n            exDescription = exceptionDescription(info->ExceptionRecord->ExceptionCode);\n            \/\/ If it's an application exception don't process it, here we don't want to catch\n            \/\/ exceptions like the one thrown by the code that processes the command arguments\n            if (strcmp(exDescription, \"UNKNOWN EXCEPTION\") == 0) {\n                return EXCEPTION_CONTINUE_SEARCH;\n            }\n        }\n\n        \/\/ Call antirez routine to log the start of the bug report\n        bugReportStart();\n        redisLog(REDIS_WARNING, \"--- %s\", exDescription);\n        StackTraceInfo();\n        ServerInfo();\n        BugReportEnd();\n        processingException = false;\n    }\n    return EXCEPTION_CONTINUE_SEARCH;\n}\n\n\/* Handler to trap abort() calls *\/\nextern \"C\" void AbortHandler(int signal_number) {\n    bugReportStart();\n    redisLog(REDIS_WARNING, \"--- ABORT\");\n    StackTraceInfo();\n    BugReportEnd();\n}\n\nvoid InitSymbols() {\n    \/\/ Preload symbols so they will be available in case of out-of-memory exception\n    SymSetOptions(SYMOPT_LOAD_LINES | SYMOPT_UNDNAME);\n    line.SizeOfStruct = sizeof(IMAGEHLP_LINE64);\n    HANDLE process = GetCurrentProcess();\n    symbolsInitialized = SymInitialize(process, NULL, TRUE);\n    if (!symbolsInitialized) {\n        DWORD error = GetLastError();\n        redisLog(REDIS_WARNING, \"Failed to initialize process symbols, error: %d\", error);\n    }\n}\n\nvoid StackTraceInit(void) {\n    InitSymbols();\n    \/\/ Global handler for unhandled exceptions\n    SetUnhandledExceptionFilter(UnhandledExceptiontHandler);\n    \/\/ Handler for abort()\n    signal(SIGABRT, &AbortHandler);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *   C++ Examples - a collection of C++ examples intended to serve as a tutorial\n *   Copyright (C) 2011 Alejandro Cabrera\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 <iostream>\n\nstruct Base {\n  Base() {\n    cout << \"Base\\n\";\n  }\n\n  void f(const char x) {\n    cout << \"Base::f()\\n\";\n  }\n};\n\nstruct Derived : Base {\n  Derived() {\n    cout << \"Derived\\n\";\n  }\n  \n  using B::f;\n  void f(const int x) {\n    cout << \"Derived::f\\n\";\n  }\n};\n\nint main()\n{\n  Base b;\n  Derived d;\n\n  b.f(1);\n  d.f(2);\n\n  return 0;\n}\n<commit_msg>Fixed compile error in inheriting_constructor.<commit_after>\/**\n *   C++ Examples - a collection of C++ examples intended to serve as a tutorial\n *   Copyright (C) 2011 Alejandro Cabrera\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 <iostream>\nusing namespace std;\n\nstruct Base {\n  Base() {\n    cout << \"Base\\n\";\n  }\n\n  void f(const char x) {\n    cout << \"Base::f()\\n\";\n  }\n};\n\nstruct Derived : Base {\n  Derived() {\n    cout << \"Derived\\n\";\n  }\n  \n  using B::f;\n  void f(const int x) {\n    cout << \"Derived::f\\n\";\n  }\n};\n\nint main()\n{\n  Base b;\n  Derived d;\n\n  b.f(1);\n  d.f(2);\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Algorithm.hpp\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\n#ifndef CORE_ALGORITHM_HPP\n#define CORE_ALGORITHM_HPP\n\n#include <vector>\n#include <algorithm>\n\n#include <boost\/type_traits.hpp>\n\n#include <core\/type_traits\/TypeTraits.hpp>\n\nnamespace rstudio {\nnamespace core {\nnamespace algorithm {\n\ntemplate<typename InputIterator, typename OutputIterator, typename Predicate>\nOutputIterator copy_if(InputIterator begin,\n                       InputIterator end,\n                       OutputIterator destBegin,\n                       Predicate p)\n{\n   while (begin != end)\n   {\n      if (p(*begin))\n        *destBegin++ = *begin;\n      ++begin;\n   }\n   return destBegin;\n}\n\ntemplate<typename InputIterator,\n         typename OutputIterator,\n         typename Predicate,\n         typename UnaryOperator>\nOutputIterator copy_transformed_if(InputIterator begin,\n                                   InputIterator end,\n                                   OutputIterator destBegin,\n                                   Predicate p,\n                                   UnaryOperator op)\n{\n   while (begin != end)\n   {\n      if (p(*begin))\n        *destBegin++ = op(*begin);\n      ++begin;\n   }\n   return destBegin;\n}\n\nnamespace detail {\n\ntemplate <typename Container, typename ValueType>\ntypename boost::enable_if_c< type_traits::has_key_type<Container>::value, bool >::type\ncontains(const Container& container, const ValueType& value, boost::true_type)\n{\n   return container.count(value);\n}\n\ntemplate <typename Container, typename ValueType>\ntypename boost::disable_if_c< type_traits::has_key_type<Container>::value, bool >::type\ncontains(const Container& container, const ValueType& value, boost::false_type)\n{\n   return std::find(container.begin(), container.end(), value) != container.end();\n}\n\n} \/\/ namespace detail\n\ntemplate <typename Container, typename ValueType>\nbool contains(const Container& container, const ValueType& value)\n{\n   return detail::contains(\n            container,\n            value,\n            type_traits::has_key_type<Container>());\n}\n\n\/* Wrappers for the erase-remove idiom *\/\ntemplate <typename Container, typename ValueType>\nvoid discard(Container& container, const ValueType& value)\n{\n   container.erase(std::remove(container.begin(), container.end(), value), container.end());\n}\n\ntemplate <typename Container, typename Predicate>\nvoid discard_if(Container& container, Predicate predicate)\n{\n   container.erase(std::remove_if(container.begin(), container.end(), predicate), container.end());\n}\n\ntemplate <typename Container, typename ValueType>\nContainer without(Container& container, const ValueType& value)\n{\n   container.erase(std::remove(container.begin(), container.end(), value), container.end());\n}\n\ntemplate <typename Container, typename Predicate>\nContainer without_if(Container& container, Predicate predicate)\n{\n   container.erase(std::remove_if(container.begin(), container.end(), predicate), container.end());\n}\n\ntemplate <typename T>\nstd::vector<T> seq(T length)\n{\n   std::vector<T> result;\n   result.reserve(length);\n   for (std::size_t i = 0; i < length; ++i)\n      result.push_back(i);\n   return result;\n}\n\ntemplate <typename AssociativeContainer,\n          typename KeyType,\n          typename MappedType>\nbool get(const AssociativeContainer& container,\n         const KeyType& key,\n         MappedType** ppValue)\n{\n   if (!container.count(key))\n      return false;\n   \n   *ppValue = &(const_cast<AssociativeContainer&>(container)[key]);\n   return true;\n}\n\n} \/\/ namespace algorithm\n} \/\/ namespace core\n} \/\/ namespace rstudio\n\n\n#endif \/\/ CORE_ALGORITHM_HPP\n<commit_msg>insertion wrappers<commit_after>\/*\n * Algorithm.hpp\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\n#ifndef CORE_ALGORITHM_HPP\n#define CORE_ALGORITHM_HPP\n\n#include <vector>\n#include <algorithm>\n\n#include <boost\/type_traits.hpp>\n\n#include <core\/type_traits\/TypeTraits.hpp>\n\nnamespace rstudio {\nnamespace core {\nnamespace algorithm {\n\ntemplate<typename InputIterator, typename OutputIterator, typename Predicate>\nOutputIterator copy_if(InputIterator begin,\n                       InputIterator end,\n                       OutputIterator destBegin,\n                       Predicate p)\n{\n   while (begin != end)\n   {\n      if (p(*begin))\n        *destBegin++ = *begin;\n      ++begin;\n   }\n   return destBegin;\n}\n\ntemplate<typename InputIterator,\n         typename OutputIterator,\n         typename Predicate,\n         typename UnaryOperator>\nOutputIterator copy_transformed_if(InputIterator begin,\n                                   InputIterator end,\n                                   OutputIterator destBegin,\n                                   Predicate p,\n                                   UnaryOperator op)\n{\n   while (begin != end)\n   {\n      if (p(*begin))\n        *destBegin++ = op(*begin);\n      ++begin;\n   }\n   return destBegin;\n}\n\nnamespace detail {\n\ntemplate <typename Container, typename ValueType>\ntypename boost::enable_if_c< type_traits::has_key_type<Container>::value, bool >::type\ncontains(const Container& container, const ValueType& value, boost::true_type)\n{\n   return container.count(value);\n}\n\ntemplate <typename Container, typename ValueType>\ntypename boost::disable_if_c< type_traits::has_key_type<Container>::value, bool >::type\ncontains(const Container& container, const ValueType& value, boost::false_type)\n{\n   return std::find(container.begin(), container.end(), value) != container.end();\n}\n\n} \/\/ namespace detail\n\ntemplate <typename Container, typename ValueType>\nbool contains(const Container& container, const ValueType& value)\n{\n   return detail::contains(\n            container,\n            value,\n            type_traits::has_key_type<Container>());\n}\n\nnamespace detail {\n\ntemplate <typename Container, typename ValueType>\ntypename boost::enable_if_c<type_traits::has_key_type<Container>::value, void>::type\ninsert(Container& container, const ValueType& value, boost::true_type)\n{\n   container.insert(value);\n}\n\ntemplate <typename Container, typename ValueType>\ntypename boost::disable_if_c<type_traits::has_key_type<Container>::value, void>::type\ninsert(Container& container, const ValueType& value, boost::false_type)\n{\n   container.push_back(value);\n}\n\n} \/\/ namespace detail\n\ntemplate <typename Container, typename ValueType>\nvoid insert(Container& container, const ValueType& value)\n{\n   detail::insert(container, value, type_traits::has_key_type<Container>());\n}\n\nnamespace detail {\n\ntemplate <typename Container, typename Iterator>\ntypename boost::enable_if_c<type_traits::has_key_type<Container>::value, void>::type\ninsert(Container& container, Iterator begin, Iterator end, boost::true_type)\n{\n   container.insert(begin, end);\n}\n\ntemplate <typename Container, typename Iterator>\ntypename boost::disable_if_c<type_traits::has_key_type<Container>::value, void>::type\ninsert(Container& container, Iterator begin, Iterator end, boost::false_type)\n{\n   container.insert(container.end(), begin, end);\n}\n\n} \/\/ namespace detail\n\ntemplate <typename Container, typename Iterator>\nvoid insert(Container& container, Iterator begin, Iterator end)\n{\n   detail::insert(container, begin, end,\n                  type_traits::has_key_type<Container>());\n}\n\n\/* Wrappers for the erase-remove idiom *\/\ntemplate <typename Container, typename ValueType>\nvoid discard(Container& container, const ValueType& value)\n{\n   container.erase(std::remove(container.begin(), container.end(), value), container.end());\n}\n\ntemplate <typename Container, typename Predicate>\nvoid discard_if(Container& container, Predicate predicate)\n{\n   container.erase(std::remove_if(container.begin(), container.end(), predicate), container.end());\n}\n\ntemplate <typename Container, typename ValueType>\nContainer without(Container& container, const ValueType& value)\n{\n   container.erase(std::remove(container.begin(), container.end(), value), container.end());\n}\n\ntemplate <typename Container, typename Predicate>\nContainer without_if(Container& container, Predicate predicate)\n{\n   container.erase(std::remove_if(container.begin(), container.end(), predicate), container.end());\n}\n\ntemplate <typename T>\nstd::vector<T> seq(T length)\n{\n   std::vector<T> result;\n   result.reserve(length);\n   for (std::size_t i = 0; i < length; ++i)\n      result.push_back(i);\n   return result;\n}\n\ntemplate <typename AssociativeContainer,\n          typename KeyType,\n          typename MappedType>\nbool get(const AssociativeContainer& container,\n         const KeyType& key,\n         MappedType** ppValue)\n{\n   if (!container.count(key))\n      return false;\n   \n   *ppValue = &(const_cast<AssociativeContainer&>(container)[key]);\n   return true;\n}\n\n} \/\/ namespace algorithm\n} \/\/ namespace core\n} \/\/ namespace rstudio\n\n\n#endif \/\/ CORE_ALGORITHM_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * RTokenizerTests.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#define RSTUDIO_ENABLE_DEBUG_MACROS\n\n#include <core\/r_util\/RTokenizer.hpp>\n\n#include <iostream>\n\n#include <boost\/foreach.hpp>\n\n#include <tests\/TestThat.hpp>\n\nnamespace rstudio {\nnamespace core {\nnamespace r_util {\n\nnamespace {\n\nclass Verifier\n{\npublic:\n   Verifier(wchar_t defaultTokenType,\n            const std::wstring& prefix,\n            const std::wstring& suffix)\n      : defaultTokenType_(defaultTokenType),\n        prefix_(prefix),\n        suffix_(suffix)\n   {\n   }\n\n   void verify(const std::wstring& value)\n   {\n      verify(defaultTokenType_, value) ;\n   }\n\n   void verify(wchar_t tokenType, const std::wstring& value)\n   {\n\n      RTokenizer rt(prefix_ + value + suffix_) ;\n      RToken t ;\n      while ((t = rt.nextToken()))\n      {\n         if (t.offset() == prefix_.length())\n         {\n            if (tokenType != t.type())\n            {\n               std::wcerr << value << L\" : \" << t.content() << std::endl;\n            }\n            expect_true(tokenType == t.type());\n            expect_true(value.length() == t.length());\n            expect_true(value == t.content());\n            return ;\n         }\n      }\n\n   }\n\n   void verify(const std::deque<std::wstring>& values)\n   {\n      verify(defaultTokenType_, values);\n   }\n\n   void verify(int tokenType, const std::deque<std::wstring>& values)\n   {\n      BOOST_FOREACH(const std::wstring& value, values)\n         verify(tokenType, value);\n   }\n\nprivate:\n   const wchar_t defaultTokenType_ ;\n   const std::wstring prefix_ ;\n   const std::wstring suffix_ ;\n\n};\n\n\nvoid testVoid()\n{\n   RTokenizer rt(L\"\") ;\n   expect_true(!rt.nextToken());\n}\n\nvoid testSimple()\n{\n   Verifier v(RToken::ERR, L\" \", L\" \") ;\n   v.verify(RToken::LPAREN, L\"(\") ;\n   v.verify(RToken::RPAREN, L\")\") ;\n   v.verify(RToken::LBRACKET, L\"[\") ;\n   v.verify(RToken::RBRACKET, L\"]\") ;\n   v.verify(RToken::LBRACE, L\"{\") ;\n   v.verify(RToken::RBRACE, L\"}\") ;\n   v.verify(RToken::COMMA, L\",\") ;\n   v.verify(RToken::SEMI, L\";\") ;\n}\n\nvoid testError()\n{\n   Verifier v(RToken::ERR, L\" \", L\" \") ;\n}\n\nvoid testComment()\n{\n   Verifier v(RToken::COMMENT, L\" \", L\"\\n\") ;\n   v.verify(L\"#\");\n   v.verify(L\"# foo #\");\n\n   Verifier v2(RToken::COMMENT, L\" \", L\"\\r\\n\") ;\n   v2.verify(L\"#\");\n   v2.verify(L\"# foo #\");\n}\n\n\nvoid testNumbers()\n{\n   Verifier v(RToken::NUMBER, L\" \", L\" \") ;\n   v.verify(L\"1\");\n   v.verify(L\"10\");\n   v.verify(L\"0.1\");\n   v.verify(L\".2\");\n   v.verify(L\"1e-7\");\n   v.verify(L\"1.2e+7\");\n   v.verify(L\"2e\");\n   v.verify(L\"3e+\");\n   v.verify(L\"0x\");\n   v.verify(L\"0x0\");\n   v.verify(L\"0xDEADBEEF\");\n   v.verify(L\"0xcafebad\");\n   v.verify(L\"1L\");\n   v.verify(L\"0x10L\");\n   v.verify(L\"1000000L\");\n   v.verify(L\"1e6L\");\n   v.verify(L\"1.1L\");\n   v.verify(L\"1e-3L\");\n   v.verify(L\"2i\");\n   v.verify(L\"4.1i\");\n   v.verify(L\"1e-2i\");\n}\n\n\nvoid testOperators()\n{\n   Verifier v(RToken::OPER, L\" \", L\" \") ;\n   v.verify(L\"+\");\n   v.verify(L\"-\");\n   v.verify(L\"*\");\n   v.verify(L\"\/\");\n   v.verify(L\"^\");\n   v.verify(L\">\");\n   v.verify(L\">=\");\n   v.verify(L\"<\");\n   v.verify(L\"<=\");\n   v.verify(L\"==\");\n   v.verify(L\"!=\");\n   v.verify(L\"!\");\n   v.verify(L\"&\");\n   v.verify(L\"|\");\n   v.verify(L\"~\");\n   v.verify(L\"->\");\n   v.verify(L\"<-\");\n   v.verify(L\"$\");\n   v.verify(L\":\");\n   v.verify(L\"=\");\n}\n\nvoid testUOperators()\n{\n   Verifier v(RToken::UOPER, L\" \", L\" \") ;\n   v.verify(L\"%%\");\n   v.verify(L\"%test test%\");\n}\n\nvoid testStrings()\n{\n   Verifier v(RToken::STRING, L\" \", L\" \") ;\n   v.verify(L\"\\\"test\\\"\") ;\n   v.verify(L\"\\\" '$\\t\\r\\n\\\\\\\"\\\"\") ;\n   v.verify(L\"\\\"\\\"\") ;\n   v.verify(L\"''\") ;\n   v.verify(L\"'\\\"'\") ;\n   v.verify(L\"'\\\\\\\"'\") ;\n   v.verify(L\"'\\n'\") ;\n   v.verify(L\"'foo bar \\\\U654'\") ;\n}\n\nvoid testIdentifiers()\n{\n   Verifier v(RToken::ID, L\" \", L\" \") ;\n   v.verify(L\".\");\n   v.verify(L\"...\");\n   v.verify(L\"..1\");\n   v.verify(L\"..2\");\n   v.verify(L\"foo\");\n   v.verify(L\"FOO\");\n   v.verify(L\"f1\");\n   v.verify(L\"a_b\");\n   v.verify(L\"ab_\");\n   v.verify(L\"`foo`\");\n   v.verify(L\"`$@!$@#$`\");\n   v.verify(L\"`a\\n\\\"'b`\");\n\n   v.verify(L\"\\x00C1\" L\"qc1\");\n   v.verify(L\"\\x00C1\" L\"qc1\" L\"\\x00C1\");\n}\n\nvoid testWhitespace()\n{\n   Verifier v(RToken::WHITESPACE, L\"a\", L\"z\") ;\n   v.verify(L\" \");\n   v.verify(L\"      \");\n   v.verify(L\"\\t\\n\");\n   v.verify(L\"\\x00A0\") ;\n   v.verify(L\"  \\x3000  \") ;\n   v.verify(L\" \\x00A0\\t\\x3000\\r  \") ;\n}\n\n\n} \/\/ anonymous namespace\n\n\ncontext(\"RTokenizer\")\n{\n   test_that(\"We tokenize various strings correctly\")\n   {\n      testVoid();\n      testComment();\n      testSimple();\n      testError();\n      testNumbers();\n      testOperators();\n      testUOperators();\n      testStrings();\n      testIdentifiers();\n      testWhitespace();\n   }\n   \n   test_that(\"Comments are tokenized without a trailing newline\")\n   {\n      RTokens rTokens(L\"## this is a comment\\n1\");\n      expect_true(rTokens.size() == 3);\n      expect_true(rTokens.at(0).isType(RToken::COMMENT));\n      expect_true(rTokens.at(1).isType(RToken::WHITESPACE));\n      expect_true(rTokens.at(1).contentEquals(L\"\\n\"));\n      expect_true(rTokens.at(2).isType(RToken::NUMBER));\n   }\n   \n   test_that(\"'**' is properly tokenized as a single operator\")\n   {\n      RTokens rTokens(L\"1 ** 2\");\n      expect_true(rTokens.size() == 5);\n      expect_true(rTokens.at(0).isType(RToken::NUMBER));\n      expect_true(rTokens.at(1).isType(RToken::WHITESPACE));\n      expect_true(rTokens.at(2).isType(RToken::OPER));\n      expect_true(rTokens.at(2).contentEquals(L\"**\"));\n   }\n}\n\n} \/\/ namespace r_util\n} \/\/ namespace core \n} \/\/ namespace rstudio\n\n\n<commit_msg>add some more tokenizer tests for C++ side<commit_after>\/*\n * RTokenizerTests.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#define RSTUDIO_ENABLE_DEBUG_MACROS\n\n#include <core\/r_util\/RTokenizer.hpp>\n\n#include <iostream>\n\n#include <boost\/foreach.hpp>\n\n#include <tests\/TestThat.hpp>\n\nnamespace rstudio {\nnamespace core {\nnamespace r_util {\n\nnamespace {\n\nclass Verifier\n{\npublic:\n   Verifier(wchar_t defaultTokenType,\n            const std::wstring& prefix,\n            const std::wstring& suffix)\n      : defaultTokenType_(defaultTokenType),\n        prefix_(prefix),\n        suffix_(suffix)\n   {\n   }\n\n   void verify(const std::wstring& value)\n   {\n      verify(defaultTokenType_, value) ;\n   }\n\n   void verify(wchar_t tokenType, const std::wstring& value)\n   {\n\n      RTokenizer rt(prefix_ + value + suffix_) ;\n      RToken t ;\n      while ((t = rt.nextToken()))\n      {\n         if (t.offset() == prefix_.length())\n         {\n            if (tokenType != t.type())\n            {\n               std::wcerr << value << L\" : \" << t.content() << std::endl;\n            }\n            expect_true(tokenType == t.type());\n            expect_true(value.length() == t.length());\n            expect_true(value == t.content());\n            return ;\n         }\n      }\n\n   }\n\n   void verify(const std::deque<std::wstring>& values)\n   {\n      verify(defaultTokenType_, values);\n   }\n\n   void verify(int tokenType, const std::deque<std::wstring>& values)\n   {\n      BOOST_FOREACH(const std::wstring& value, values)\n         verify(tokenType, value);\n   }\n\nprivate:\n   const wchar_t defaultTokenType_ ;\n   const std::wstring prefix_ ;\n   const std::wstring suffix_ ;\n\n};\n\n\nvoid testVoid()\n{\n   RTokenizer rt(L\"\") ;\n   expect_true(!rt.nextToken());\n}\n\nvoid testSimple()\n{\n   Verifier v(RToken::ERR, L\" \", L\" \") ;\n   v.verify(RToken::LPAREN, L\"(\") ;\n   v.verify(RToken::RPAREN, L\")\") ;\n   v.verify(RToken::LBRACKET, L\"[\") ;\n   v.verify(RToken::RBRACKET, L\"]\") ;\n   v.verify(RToken::LBRACE, L\"{\") ;\n   v.verify(RToken::RBRACE, L\"}\") ;\n   v.verify(RToken::COMMA, L\",\") ;\n   v.verify(RToken::SEMI, L\";\") ;\n}\n\nvoid testError()\n{\n   Verifier v(RToken::ERR, L\" \", L\" \") ;\n}\n\nvoid testComment()\n{\n   Verifier v(RToken::COMMENT, L\" \", L\"\\n\") ;\n   v.verify(L\"#\");\n   v.verify(L\"# foo #\");\n\n   Verifier v2(RToken::COMMENT, L\" \", L\"\\r\\n\") ;\n   v2.verify(L\"#\");\n   v2.verify(L\"# foo #\");\n}\n\n\nvoid testNumbers()\n{\n   Verifier v(RToken::NUMBER, L\" \", L\" \") ;\n   v.verify(L\"1\");\n   v.verify(L\"10\");\n   v.verify(L\"0.1\");\n   v.verify(L\"1.\");\n   v.verify(L\".2\");\n   v.verify(L\"1e-7\");\n   v.verify(L\"1.2e+7\");\n   v.verify(L\"2e\");\n   v.verify(L\"3e+\");\n   v.verify(L\"0x\");\n   v.verify(L\"0x0\");\n   v.verify(L\"0xDEADBEEF\");\n   v.verify(L\"0xcafebad\");\n   v.verify(L\"1L\");\n   v.verify(L\"0x10L\");\n   v.verify(L\"1000000L\");\n   v.verify(L\"1e6L\");\n   v.verify(L\"1.1L\");\n   v.verify(L\"1e-3L\");\n   v.verify(L\"2i\");\n   v.verify(L\"4.1i\");\n   v.verify(L\"1e-2i\");\n}\n\n\nvoid testOperators()\n{\n   Verifier v(RToken::OPER, L\" \", L\" \") ;\n   v.verify(L\"+\");\n   v.verify(L\"-\");\n   v.verify(L\"*\");\n   v.verify(L\"\/\");\n   v.verify(L\"^\");\n   v.verify(L\">\");\n   v.verify(L\">=\");\n   v.verify(L\"<\");\n   v.verify(L\"<=\");\n   v.verify(L\"==\");\n   v.verify(L\"!=\");\n   v.verify(L\"!\");\n   v.verify(L\"&\");\n   v.verify(L\"|\");\n   v.verify(L\"~\");\n   v.verify(L\"->\");\n   v.verify(L\"<-\");\n   v.verify(L\"->>\");\n   v.verify(L\"<<-\");\n   v.verify(L\"$\");\n   v.verify(L\":\");\n   v.verify(L\"=\");\n   v.verify(L\":=\");\n}\n\nvoid testUOperators()\n{\n   Verifier v(RToken::UOPER, L\" \", L\" \") ;\n   v.verify(L\"%%\");\n   v.verify(L\"%test test%\");\n}\n\nvoid testStrings()\n{\n   Verifier v(RToken::STRING, L\" \", L\" \") ;\n   v.verify(L\"\\\"test\\\"\") ;\n   v.verify(L\"\\\" '$\\t\\r\\n\\\\\\\"\\\"\") ;\n   v.verify(L\"\\\"\\\"\") ;\n   v.verify(L\"''\") ;\n   v.verify(L\"'\\\"'\") ;\n   v.verify(L\"'\\\\\\\"'\") ;\n   v.verify(L\"'\\n'\") ;\n   v.verify(L\"'foo bar \\\\U654'\") ;\n}\n\nvoid testIdentifiers()\n{\n   Verifier v(RToken::ID, L\" \", L\" \") ;\n   v.verify(L\".\");\n   v.verify(L\"...\");\n   v.verify(L\"..1\");\n   v.verify(L\"..2\");\n   v.verify(L\"foo\");\n   v.verify(L\"FOO\");\n   v.verify(L\"f1\");\n   v.verify(L\"a_b\");\n   v.verify(L\"ab_\");\n   v.verify(L\"`foo`\");\n   v.verify(L\"`$@!$@#$`\");\n   v.verify(L\"`a\\n\\\"'b`\");\n\n   v.verify(L\"\\x00C1\" L\"qc1\");\n   v.verify(L\"\\x00C1\" L\"qc1\" L\"\\x00C1\");\n}\n\nvoid testWhitespace()\n{\n   Verifier v(RToken::WHITESPACE, L\"a\", L\"z\") ;\n   v.verify(L\" \");\n   v.verify(L\"      \");\n   v.verify(L\"\\t\\n\");\n   v.verify(L\"\\x00A0\") ;\n   v.verify(L\"  \\x3000  \") ;\n   v.verify(L\" \\x00A0\\t\\x3000\\r  \") ;\n}\n\n\n} \/\/ anonymous namespace\n\n\ncontext(\"RTokenizer\")\n{\n   test_that(\"We tokenize various strings correctly\")\n   {\n      testVoid();\n      testComment();\n      testSimple();\n      testError();\n      testNumbers();\n      testOperators();\n      testUOperators();\n      testStrings();\n      testIdentifiers();\n      testWhitespace();\n   }\n   \n   test_that(\"Comments are tokenized without a trailing newline\")\n   {\n      RTokens rTokens(L\"## this is a comment\\n1\");\n      expect_true(rTokens.size() == 3);\n      expect_true(rTokens.at(0).isType(RToken::COMMENT));\n      expect_true(rTokens.at(1).isType(RToken::WHITESPACE));\n      expect_true(rTokens.at(1).contentEquals(L\"\\n\"));\n      expect_true(rTokens.at(2).isType(RToken::NUMBER));\n   }\n   \n   test_that(\"'**' is properly tokenized as a single operator\")\n   {\n      RTokens rTokens(L\"1 ** 2\");\n      expect_true(rTokens.size() == 5);\n      expect_true(rTokens.at(0).isType(RToken::NUMBER));\n      expect_true(rTokens.at(1).isType(RToken::WHITESPACE));\n      expect_true(rTokens.at(2).isType(RToken::OPER));\n      expect_true(rTokens.at(2).contentEquals(L\"**\"));\n   }\n}\n\n} \/\/ namespace r_util\n} \/\/ namespace core \n} \/\/ namespace rstudio\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkTransformTest.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\n#include <iostream>\n\n#include \"itkTransform.h\"\n#include \"itkMatrix.h\"\n\n   \n\nint main()\n{\n\n\n  typedef  itk::Matrix<double,3,3>   MatrixType;\n  typedef  itk::Vector<double,3>     VectorType;\n  typedef  itk::Point<double,3>      ParametersType;\n  typedef  itk::Matrix<double,3,3>   JacobianType;\n\n  typedef  itk::Transform<double,3,3,ParametersType,JacobianType> TransformType;\n\n  TransformType::Pointer transform = TransformType::New();\n    \n\n\n}\n<commit_msg>FIX: return was missing<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkTransformTest.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\n#include <iostream>\n\n#include \"itkTransform.h\"\n#include \"itkMatrix.h\"\n\n   \n\nint main()\n{\n\n\n  typedef  itk::Matrix<double,3,3>   MatrixType;\n  typedef  itk::Vector<double,3>     VectorType;\n  typedef  itk::Point<double,3>      ParametersType;\n  typedef  itk::Matrix<double,3,3>   JacobianType;\n\n  typedef  itk::Transform<double,3,3,ParametersType,JacobianType> TransformType;\n\n  TransformType::Pointer transform = TransformType::New();\n    \n\n  return EXIT_SUCCESS\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2015-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 \"ParserWorker.h\"\n#include \"Parser.h\"\n#include \"Media.h\"\n#include \"Folder.h\"\n\nnamespace medialibrary\n{\nnamespace parser\n{\n\nWorker::Worker()\n    : m_parserCb( nullptr )\n    , m_stopParser( false )\n    , m_paused( false )\n    , m_idle( true )\n{\n}\n\nvoid Worker::start()\n{\n    \/\/ This function is called from a locked context.\n\n    \/\/ Ensure we don't start multiple times.\n    assert( m_thread.joinable() == false );\n    m_thread = compat::Thread{ &Worker::mainloop, this };\n}\n\nvoid Worker::pause()\n{\n    std::lock_guard<compat::Mutex> lock( m_lock );\n    m_paused = true;\n}\n\nvoid Worker::resume()\n{\n    std::lock_guard<compat::Mutex> lock( m_lock );\n    m_paused = false;\n    m_cond.notify_all();\n}\n\nvoid Worker::signalStop()\n{\n    if ( m_thread.joinable() )\n    {\n        std::lock_guard<compat::Mutex> lock( m_lock );\n        m_cond.notify_all();\n        m_stopParser = true;\n    }\n    m_service->stop();\n}\n\nvoid Worker::stop()\n{\n    if ( m_thread.joinable() == true )\n        m_thread.join();\n}\n\nvoid Worker::parse( std::shared_ptr<Task> t )\n{\n    \/\/ Avoid flickering from idle\/not idle when not many tasks are running.\n    \/\/ The thread calling parse for the next parser step might not have\n    \/\/ something left to do and would turn idle, potentially causing all\n    \/\/ services to be idle for a very short time, until this parser\n    \/\/ thread awakes\/starts, causing the global parser idle state to be\n    \/\/ restored back to false.\n    \/\/ Since we are queuing a task, we already know that this thread is\n    \/\/ not idle\n    setIdle( false );\n\n    \/\/ Even if no threads appear to be started, we need to lock this in case\n    \/\/ we're currently doing a stop\/start\n    {\n        std::lock_guard<compat::Mutex> lock( m_lock );\n        if ( m_thread.get_id() == compat::Thread::id{} )\n        {\n            m_tasks.push( std::move( t ) );\n            start();\n            return;\n        }\n        m_tasks.push( std::move( t ) );\n    }\n    m_cond.notify_all();\n}\n\nbool Worker::initialize( MediaLibrary* ml, IParserCb* parserCb,\n                               std::shared_ptr<IParserService> service )\n{\n    m_ml = ml;\n    m_service = std::move( service );\n    m_parserCb = parserCb;\n    \/\/ Run the service specific initializer\n    return m_service->initialize( ml );\n}\n\nbool Worker::isIdle() const\n{\n    return m_idle;\n}\n\nvoid Worker::flush()\n{\n    std::unique_lock<compat::Mutex> lock( m_lock );\n    assert( m_paused == true || m_thread.get_id() == compat::Thread::id{} );\n    m_idleCond.wait( lock, [this]() {\n        return m_idle == true;\n    });\n    while ( m_tasks.empty() == false )\n        m_tasks.pop();\n    m_service->onFlushing();\n}\n\nvoid Worker::restart()\n{\n    m_service->onRestarted();\n}\n\nvoid Worker::mainloop()\n{\n    \/\/ It would be unsafe to call name() at the end of this function, since\n    \/\/ we might stop the thread during ParserService destruction. This implies\n    \/\/ that the underlying service has been deleted already.\n    std::string serviceName = m_service->name();\n    LOG_INFO(\"Entering ParserService [\", serviceName, \"] thread\");\n    setIdle( false );\n\n    while ( true )\n    {\n        std::shared_ptr<Task> task;\n        {\n            std::unique_lock<compat::Mutex> lock( m_lock );\n            if ( m_stopParser == true )\n                break;\n            if ( m_tasks.empty() == true || m_paused == true )\n            {\n                LOG_DEBUG( \"Halting ParserService [\", serviceName, \"] mainloop\" );\n                setIdle( true );\n                m_idleCond.notify_all();\n                m_cond.wait( lock, [this]() {\n                    return ( m_tasks.empty() == false && m_paused == false )\n                            || m_stopParser == true;\n                });\n                LOG_DEBUG( \"Resuming ParserService [\", serviceName, \"] mainloop\" );\n                \/\/ We might have been woken up because the parser is being destroyed\n                if ( m_stopParser  == true )\n                    break;\n                setIdle( false );\n            }\n            \/\/ Otherwise it's safe to assume we have at least one element.\n            LOG_DEBUG('[', serviceName, \"] has \", m_tasks.size(), \" tasks remaining\" );\n            task = std::move( m_tasks.front() );\n            m_tasks.pop();\n        }\n        \/\/ Special case to restore uncompleted tasks from a parser thread\n        if ( task == nullptr )\n        {\n            restoreTasks();\n            continue;\n        }\n        if ( task->isStepCompleted( m_service->targetedStep() ) == true )\n        {\n            LOG_DEBUG( \"Skipping completed task [\", serviceName, \"] on \", task->mrl() );\n            m_parserCb->done( std::move( task ), Status::Success );\n            continue;\n        }\n        Status status;\n        try\n        {\n            LOG_DEBUG( \"Executing \", serviceName, \" task on \", task->mrl() );\n            auto chrono = std::chrono::steady_clock::now();\n            auto file = std::static_pointer_cast<File>( task->file() );\n            auto media = std::static_pointer_cast<Media>( task->media() );\n\n            if ( file != nullptr && file->isRemovable() )\n            {\n                auto folder = Folder::fetch( m_ml, file->folderId() );\n                if ( folder->isPresent() == false )\n                {\n                    LOG_DEBUG( \"Postponing parsing of \", file->rawMrl(),\n                              \" until the device containing it gets mounted back\" );\n                    m_parserCb->done( std::move( task ), Status::TemporaryUnavailable );\n                    continue;\n                }\n            }\n            task->startParserStep();\n            status = m_service->run( *task );\n            auto duration = std::chrono::steady_clock::now() - chrono;\n            LOG_DEBUG( \"Done executing \", serviceName, \" task on \", task->mrl(), \" in \",\n                       std::chrono::duration_cast<std::chrono::milliseconds>( duration ).count(),\n                       \"ms. Result: \",\n                       static_cast<std::underlying_type_t<parser::Status>>( status ) );\n        }\n        catch ( const fs::DeviceRemovedException& )\n        {\n            LOG_ERROR( \"Parsing of \", task->mrl(), \" was interrupted \"\n                       \"due to its containing device being unmounted\" );\n            status = Status::TemporaryUnavailable;\n        }\n        catch ( const std::exception& ex )\n        {\n            LOG_ERROR( \"Caught an exception during \", task->mrl(), \" [\", serviceName, \"] parsing: \", ex.what() );\n            status = Status::Fatal;\n        }\n        if ( handleServiceResult( *task, status ) == false )\n            status = Status::Fatal;\n        m_parserCb->done( std::move( task ), status );\n    }\n    LOG_INFO(\"Exiting ParserService [\", serviceName, \"] thread\");\n    setIdle( true );\n}\n\nvoid Worker::setIdle(bool isIdle)\n{\n    \/\/ Calling the idleChanged callback will trigger a call to isIdle, so set the value before\n    \/\/ invoking it, otherwise we have an incoherent state.\n    if ( m_idle != isIdle )\n    {\n        m_idle = isIdle;\n        m_parserCb->onIdleChanged( isIdle );\n    }\n}\n\nbool Worker::handleServiceResult( Task& task, Status status )\n{\n    if ( status == Status::Success )\n    {\n        task.markStepCompleted( m_service->targetedStep() );\n        \/\/ We don't want to save the extraction step in database, as restarting a\n        \/\/ task with extraction completed but analysis uncompleted wouldn't run\n        \/\/ the extraction again, causing the analysis to run with no info.\n        if ( m_service->targetedStep() != Step::MetadataExtraction )\n            return task.saveParserStep();\n        \/\/ We don't want to reset the entire retry count, as we would be stuck in\n        \/\/ a \"loop\" in case the metadata analysis fails (we'd always reset the retry\n        \/\/ count to zero, then fail, then run the extraction again, reset the retry,\n        \/\/ fail the analysis, and so on.\n        \/\/ We can't not increment the retry count for metadata extraction, since\n        \/\/ in case a file makes (lib)VLC crash, we would always try again, and\n        \/\/ therefor we would keep on crashing.\n        \/\/ However we don't want to just increment the retry count, since it\n        \/\/ would reach the maximum value too quickly (extraction would set retry\n        \/\/ count to 1, analysis to 2, and in case of failure, next run would set\n        \/\/ it over 3, while we only tried 2 times. Instead we just decrement it\n        \/\/ when the extraction step succeeds\n        return task.decrementRetryCount();\n    }\n    else if ( status == Status::Completed )\n    {\n        task.markStepCompleted( Step::Completed );\n        return task.saveParserStep();\n    }\n    else if ( status == Status::Discarded )\n    {\n        return Task::destroy( m_ml, task.id() );\n    }\n    return true;\n}\n\nvoid Worker::restoreTasks()\n{\n    auto tasks = Task::fetchUncompleted( m_ml );\n    if ( tasks.size() > 0 )\n        LOG_INFO( \"Resuming parsing on \", tasks.size(), \" tasks\" );\n    else\n        LOG_DEBUG( \"No task to resume.\" );\n    for ( auto& t : tasks )\n    {\n        {\n            std::lock_guard<compat::Mutex> lock( m_lock );\n            if ( m_stopParser == true )\n                break;\n        }\n\n        if ( t->restoreLinkedEntities() == false )\n            continue;\n        m_parserCb->parse( std::move( t ) );\n    }\n}\n\n}\n}\n<commit_msg>ParserWorker: Minor simplification<commit_after>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2015-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 \"ParserWorker.h\"\n#include \"Parser.h\"\n#include \"Media.h\"\n#include \"Folder.h\"\n\nnamespace medialibrary\n{\nnamespace parser\n{\n\nWorker::Worker()\n    : m_parserCb( nullptr )\n    , m_stopParser( false )\n    , m_paused( false )\n    , m_idle( true )\n{\n}\n\nvoid Worker::start()\n{\n    \/\/ This function is called from a locked context.\n\n    \/\/ Ensure we don't start multiple times.\n    assert( m_thread.joinable() == false );\n    m_thread = compat::Thread{ &Worker::mainloop, this };\n}\n\nvoid Worker::pause()\n{\n    std::lock_guard<compat::Mutex> lock( m_lock );\n    m_paused = true;\n}\n\nvoid Worker::resume()\n{\n    std::lock_guard<compat::Mutex> lock( m_lock );\n    m_paused = false;\n    m_cond.notify_all();\n}\n\nvoid Worker::signalStop()\n{\n    if ( m_thread.joinable() )\n    {\n        std::lock_guard<compat::Mutex> lock( m_lock );\n        m_cond.notify_all();\n        m_stopParser = true;\n    }\n    m_service->stop();\n}\n\nvoid Worker::stop()\n{\n    if ( m_thread.joinable() == true )\n        m_thread.join();\n}\n\nvoid Worker::parse( std::shared_ptr<Task> t )\n{\n    \/\/ Avoid flickering from idle\/not idle when not many tasks are running.\n    \/\/ The thread calling parse for the next parser step might not have\n    \/\/ something left to do and would turn idle, potentially causing all\n    \/\/ services to be idle for a very short time, until this parser\n    \/\/ thread awakes\/starts, causing the global parser idle state to be\n    \/\/ restored back to false.\n    \/\/ Since we are queuing a task, we already know that this thread is\n    \/\/ not idle\n    setIdle( false );\n\n    \/\/ Even if no threads appear to be started, we need to lock this in case\n    \/\/ we're currently doing a stop\/start\n    {\n        std::lock_guard<compat::Mutex> lock( m_lock );\n        m_tasks.push( std::move( t ) );\n        if ( m_thread.get_id() == compat::Thread::id{} )\n        {\n            start();\n            return;\n        }\n    }\n    m_cond.notify_all();\n}\n\nbool Worker::initialize( MediaLibrary* ml, IParserCb* parserCb,\n                               std::shared_ptr<IParserService> service )\n{\n    m_ml = ml;\n    m_service = std::move( service );\n    m_parserCb = parserCb;\n    \/\/ Run the service specific initializer\n    return m_service->initialize( ml );\n}\n\nbool Worker::isIdle() const\n{\n    return m_idle;\n}\n\nvoid Worker::flush()\n{\n    std::unique_lock<compat::Mutex> lock( m_lock );\n    assert( m_paused == true || m_thread.get_id() == compat::Thread::id{} );\n    m_idleCond.wait( lock, [this]() {\n        return m_idle == true;\n    });\n    while ( m_tasks.empty() == false )\n        m_tasks.pop();\n    m_service->onFlushing();\n}\n\nvoid Worker::restart()\n{\n    m_service->onRestarted();\n}\n\nvoid Worker::mainloop()\n{\n    \/\/ It would be unsafe to call name() at the end of this function, since\n    \/\/ we might stop the thread during ParserService destruction. This implies\n    \/\/ that the underlying service has been deleted already.\n    std::string serviceName = m_service->name();\n    LOG_INFO(\"Entering ParserService [\", serviceName, \"] thread\");\n    setIdle( false );\n\n    while ( true )\n    {\n        std::shared_ptr<Task> task;\n        {\n            std::unique_lock<compat::Mutex> lock( m_lock );\n            if ( m_stopParser == true )\n                break;\n            if ( m_tasks.empty() == true || m_paused == true )\n            {\n                LOG_DEBUG( \"Halting ParserService [\", serviceName, \"] mainloop\" );\n                setIdle( true );\n                m_idleCond.notify_all();\n                m_cond.wait( lock, [this]() {\n                    return ( m_tasks.empty() == false && m_paused == false )\n                            || m_stopParser == true;\n                });\n                LOG_DEBUG( \"Resuming ParserService [\", serviceName, \"] mainloop\" );\n                \/\/ We might have been woken up because the parser is being destroyed\n                if ( m_stopParser  == true )\n                    break;\n                setIdle( false );\n            }\n            \/\/ Otherwise it's safe to assume we have at least one element.\n            LOG_DEBUG('[', serviceName, \"] has \", m_tasks.size(), \" tasks remaining\" );\n            task = std::move( m_tasks.front() );\n            m_tasks.pop();\n        }\n        \/\/ Special case to restore uncompleted tasks from a parser thread\n        if ( task == nullptr )\n        {\n            restoreTasks();\n            continue;\n        }\n        if ( task->isStepCompleted( m_service->targetedStep() ) == true )\n        {\n            LOG_DEBUG( \"Skipping completed task [\", serviceName, \"] on \", task->mrl() );\n            m_parserCb->done( std::move( task ), Status::Success );\n            continue;\n        }\n        Status status;\n        try\n        {\n            LOG_DEBUG( \"Executing \", serviceName, \" task on \", task->mrl() );\n            auto chrono = std::chrono::steady_clock::now();\n            auto file = std::static_pointer_cast<File>( task->file() );\n            auto media = std::static_pointer_cast<Media>( task->media() );\n\n            if ( file != nullptr && file->isRemovable() )\n            {\n                auto folder = Folder::fetch( m_ml, file->folderId() );\n                if ( folder->isPresent() == false )\n                {\n                    LOG_DEBUG( \"Postponing parsing of \", file->rawMrl(),\n                              \" until the device containing it gets mounted back\" );\n                    m_parserCb->done( std::move( task ), Status::TemporaryUnavailable );\n                    continue;\n                }\n            }\n            task->startParserStep();\n            status = m_service->run( *task );\n            auto duration = std::chrono::steady_clock::now() - chrono;\n            LOG_DEBUG( \"Done executing \", serviceName, \" task on \", task->mrl(), \" in \",\n                       std::chrono::duration_cast<std::chrono::milliseconds>( duration ).count(),\n                       \"ms. Result: \",\n                       static_cast<std::underlying_type_t<parser::Status>>( status ) );\n        }\n        catch ( const fs::DeviceRemovedException& )\n        {\n            LOG_ERROR( \"Parsing of \", task->mrl(), \" was interrupted \"\n                       \"due to its containing device being unmounted\" );\n            status = Status::TemporaryUnavailable;\n        }\n        catch ( const std::exception& ex )\n        {\n            LOG_ERROR( \"Caught an exception during \", task->mrl(), \" [\", serviceName, \"] parsing: \", ex.what() );\n            status = Status::Fatal;\n        }\n        if ( handleServiceResult( *task, status ) == false )\n            status = Status::Fatal;\n        m_parserCb->done( std::move( task ), status );\n    }\n    LOG_INFO(\"Exiting ParserService [\", serviceName, \"] thread\");\n    setIdle( true );\n}\n\nvoid Worker::setIdle(bool isIdle)\n{\n    \/\/ Calling the idleChanged callback will trigger a call to isIdle, so set the value before\n    \/\/ invoking it, otherwise we have an incoherent state.\n    if ( m_idle != isIdle )\n    {\n        m_idle = isIdle;\n        m_parserCb->onIdleChanged( isIdle );\n    }\n}\n\nbool Worker::handleServiceResult( Task& task, Status status )\n{\n    if ( status == Status::Success )\n    {\n        task.markStepCompleted( m_service->targetedStep() );\n        \/\/ We don't want to save the extraction step in database, as restarting a\n        \/\/ task with extraction completed but analysis uncompleted wouldn't run\n        \/\/ the extraction again, causing the analysis to run with no info.\n        if ( m_service->targetedStep() != Step::MetadataExtraction )\n            return task.saveParserStep();\n        \/\/ We don't want to reset the entire retry count, as we would be stuck in\n        \/\/ a \"loop\" in case the metadata analysis fails (we'd always reset the retry\n        \/\/ count to zero, then fail, then run the extraction again, reset the retry,\n        \/\/ fail the analysis, and so on.\n        \/\/ We can't not increment the retry count for metadata extraction, since\n        \/\/ in case a file makes (lib)VLC crash, we would always try again, and\n        \/\/ therefor we would keep on crashing.\n        \/\/ However we don't want to just increment the retry count, since it\n        \/\/ would reach the maximum value too quickly (extraction would set retry\n        \/\/ count to 1, analysis to 2, and in case of failure, next run would set\n        \/\/ it over 3, while we only tried 2 times. Instead we just decrement it\n        \/\/ when the extraction step succeeds\n        return task.decrementRetryCount();\n    }\n    else if ( status == Status::Completed )\n    {\n        task.markStepCompleted( Step::Completed );\n        return task.saveParserStep();\n    }\n    else if ( status == Status::Discarded )\n    {\n        return Task::destroy( m_ml, task.id() );\n    }\n    return true;\n}\n\nvoid Worker::restoreTasks()\n{\n    auto tasks = Task::fetchUncompleted( m_ml );\n    if ( tasks.size() > 0 )\n        LOG_INFO( \"Resuming parsing on \", tasks.size(), \" tasks\" );\n    else\n        LOG_DEBUG( \"No task to resume.\" );\n    for ( auto& t : tasks )\n    {\n        {\n            std::lock_guard<compat::Mutex> lock( m_lock );\n            if ( m_stopParser == true )\n                break;\n        }\n\n        if ( t->restoreLinkedEntities() == false )\n            continue;\n        m_parserCb->parse( std::move( t ) );\n    }\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * SessionData.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#include \"SessionData.hpp\"\n\n#include <string>\n#include <vector>\n#include <sstream>\n\n#include <boost\/bind.hpp>\n#include <boost\/format.hpp>\n\n#include <core\/Log.hpp>\n#include <core\/Error.hpp>\n#include <core\/Exec.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/StringUtils.hpp>\n\n#define R_INTERNAL_FUNCTIONS\n#include <r\/RInternal.hpp>\n#include <r\/RSexp.hpp>\n#include <r\/RExec.hpp>\n#include <r\/RJson.hpp>\n#include <r\/ROptions.hpp>\n#include <r\/RFunctionHook.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n\n#include \"SessionContentUrls.hpp\"\n\nusing namespace core;\n\nnamespace session {\nnamespace modules { \nnamespace data {\n\nnamespace {   \n     \n   \nSEXP dataEntryHook(SEXP call, SEXP op, SEXP args, SEXP rho)\n{\n   \/\/ dataentry(data, modes)\n   \/\/ see in_RX11_dataentry in modules\/X11\/dataentry.c for X11 impl\n   \/\/ see Raqua_dataentry in modules\/aqua\/dataentry.c for aqua impl\n   \/\/ see do_dataentry in gnuwin32\/dataentry.c for win32 impl\n   r::function_hook::checkArity(op, args, call);\n   \n   \/\/ currently not supported\n   r::exec::errorCall(call, \"Editing of matrix and data.frame objects is not \"\n                            \"currently supported in RStudio\");\n   \n   \n   \/\/ NOTE: see implementation of dataViewerHook below for how to \n   \/\/ properly merge exception\/error strategies for the runtime\n   \/\/ context of a hook\n   \n   return R_NilValue;\n}\n\nvoid appendTag(std::string* pHTML,\n               const std::string& text,\n               const std::string& tag,\n               const std::string& className = std::string())\n{\n   std::string classAttrib;\n   if (!className.empty())\n      classAttrib = \" class=\\\"\" + className + \"\\\"\";\n\n   boost::format fmt(\"<%1%%2%>%3%<\/%1%>\");\n   pHTML->append(boost::str(fmt % tag %\n                                  classAttrib %\n                                  string_utils::textToHtml(text)));\n}\n\nvoid appendTD(std::string* pHTML,\n              const std::string& text,\n              const std::string& className = std::string())\n{\n   appendTag(pHTML, text, \"td\", className);\n}\n\nvoid appendTH(std::string* pHTML, const std::string& text)\n{\n   appendTag(pHTML, text, \"th\");\n}\n\nSEXP dataViewerHook(SEXP call, SEXP op, SEXP args, SEXP rho)\n{\n   \/\/ dataviewer(x, title)\n   \/\/ (see in_R_X11_dataviewer in modules\/X11\/dataentry.c for X11 impl)\n   r::function_hook::checkArity(op, args, call);\n      \n   try\n   {\n      \/\/ validate title\n      SEXP titleSEXP = CADR(args);\n      if (!Rf_isString(titleSEXP) || Rf_length(titleSEXP) != 1)\n         throw r::exec::RErrorException(\"invalid title argument\");\n           \n      \/\/ validate data\n      SEXP dataSEXP = CAR(args);\n      if (TYPEOF(dataSEXP) != VECSXP)\n         throw r::exec::RErrorException(\"invalid data argument (not a list)\");\n      \n      \/\/ validate names (View ensures that length(names) == length(data))\n      SEXP namesSEXP = Rf_getAttrib(dataSEXP, R_NamesSymbol);\n      if (TYPEOF(namesSEXP) != STRSXP || \n          Rf_length(namesSEXP) != Rf_length(dataSEXP))\n      {\n         throw r::exec::RErrorException(\n                              \"invalid data argument (names not specified)\");\n      }\n\n      \/\/ extract title and column names\n      std::string title = r::sexp::asString(titleSEXP);\n      std::vector<std::string> columnNames;\n      Error error = r::sexp::extract(namesSEXP, &columnNames);\n      if (error)\n         throw r::exec::RErrorException(\"invalid names: \" +\n                                        error.code().message());\n\n      \/\/ get column lenghts and then calculate # of rows based on the maximum #\n      \/\/ of elements in single column (technically R can pass columns which have\n      \/\/ a disparate # of rows to this method)\n      int columnCount = r::sexp::length(dataSEXP);\n      int rowCount = 0;\n      std::vector<int> columnLengths;\n      for (int i=0; i<columnCount; i++)\n      {\n          \/\/ get the column and record its length (updating rowCount)\n          SEXP columnSEXP = VECTOR_ELT(dataSEXP, i);\n          int columnLength = r::sexp::length(columnSEXP);\n          columnLengths.push_back(columnLength);\n          rowCount = std::max(columnLength, rowCount);\n\n          \/\/ validate data type (R converts all inbound vectors to REAL or STR)\n          if (TYPEOF(columnSEXP) != REALSXP && TYPEOF(columnSEXP) != STRSXP)\n          {\n             throw r::exec::RErrorException(\"Unexpected type for column: \"\n                                            + r::sexp::typeAsString(columnSEXP));\n          }\n      }\n\n      \/\/ calculate rows to display\n      const int kMaxRows = 1000;\n      int displayedRows = std::min(rowCount, kMaxRows);\n\n      \/\/ format the data for presentation\n      r::sexp::Protect rProtect;\n      SEXP formattedDataSEXP = Rf_allocVector(VECSXP, columnCount);\n      rProtect.add(formattedDataSEXP);\n      for (int i=0; i<columnCount; i++)\n      {\n         SEXP columnSEXP = VECTOR_ELT(dataSEXP, i);\n         SEXP formattedColumnSEXP;\n         r::exec::RFunction formatFx(\".rs.formatDataColumn\");\n         formatFx.addParam(columnSEXP);\n         formatFx.addParam(displayedRows);\n         Error error = formatFx.call(&formattedColumnSEXP, &rProtect);\n         if (error)\n            throw r::exec::RErrorException(error.summary());\n         SET_VECTOR_ELT(formattedDataSEXP, i, formattedColumnSEXP);\n       }\n\n      \/\/ write html header\n      boost::format headerFmt(\n         \"<html>\\n\"\n         \"  <head>\\n\"\n         \"     <title>%1%<\/title>\\n\"\n         \"     <meta charset=\\\"utf-8\\\"\/>\\n\"\n         \"     <link rel=\\\"stylesheet\\\" type=\\\"text\/css\\\" href=\\\"..\/css\/data.css\\\"\/>\\n\"\n         \"  <\/head>\\n\"\n         \"  <body>\\n\");\n      std::string html = boost::str(headerFmt % title);\n\n      \/\/ output begin table & header\n      html += \"<table>\\n\";\n      html += \"<thead><tr>\\n\";\n      html += \"<td id=\\\"origin\\\">&nbsp;<\/td>\"; \/\/ above row numbers\n      std::for_each(columnNames.begin(),\n                    columnNames.end(),\n                    boost::bind(appendTH, &html, _1));\n      html += \"\\n<\/tr><\/thead>\\n\";\n\n      html += \"<tbody>\\n\";\n      \/\/ output rows\n      for (int row=0; row<displayedRows; row++)\n      {\n         html += \"<tr>\\n\";\n\n         \/\/ row number\n         appendTD(&html, boost::lexical_cast<std::string>(row+1), \"rn\");\n\n         \/\/ output a data element from each column where this row is available\n         for (int col=0; col<Rf_length(formattedDataSEXP); col++)\n         {\n            if (columnLengths[col] > row)\n            {\n               SEXP columnSEXP = VECTOR_ELT(formattedDataSEXP, col);\n               SEXP stringSEXP = STRING_ELT(columnSEXP, row);\n               if (stringSEXP != NA_STRING && r::sexp::length(stringSEXP) > 0)\n               {\n                  std::string text(Rf_translateChar(stringSEXP));\n                  appendTD(&html, text);\n               }\n               else\n               {\n                  html += \"<td>&nbsp;<\/td>\";\n               }\n            }\n         }\n\n         html += \"\\n<\/tr>\\n\";\n      }\n      html += \"<\/tbody>\\n\";\n\n      \/\/ append table footer\n      html += \"\\n<\/table>\\n\";\n\n      \/\/ append document footer\n      html += \"<\/body><\/html>\\n\";\n\n      \/\/ fire show data event\n      json::Object dataItem;\n      dataItem[\"title\"] = title;\n      dataItem[\"totalObservations\"] = rowCount;\n      dataItem[\"displayedObservations\"] = displayedRows;\n      dataItem[\"variables\"] = columnCount;\n      dataItem[\"contentUrl\"] = content_urls::provision(title, html, \".htm\");\n      ClientEvent event(client_events::kShowData, dataItem);\n      module_context::enqueClientEvent(event);\n\n      \/\/ done\n      return R_NilValue;\n   }\n   catch(r::exec::RErrorException& e)\n   {\n      r::exec::errorCall(call, e.message());\n   }\n   CATCH_UNEXPECTED_EXCEPTION\n   \n   \/\/ keep compiler happy\n   return R_NilValue;\n}\n  \n\n} \/\/ anonymous namespace\n   \nError initialize()\n{\n   using boost::bind;\n   using namespace r::function_hook ;\n   using namespace session::module_context;\n   ExecBlock initBlock ;\n   initBlock.addFunctions()\n      (bind(registerReplaceHook, \"dataentry\", dataEntryHook, (CCODE*)NULL))\n      (bind(registerReplaceHook, \"dataviewer\", dataViewerHook,(CCODE*)NULL))\n      (bind(sourceModuleRFile, \"SessionData.R\"));\n   \n   return initBlock.execute();\n}\n\n\n} \/\/ namespace data\n} \/\/ namespace modules\n} \/\/ namesapce session\n\n<commit_msg>clip viewed datasets at 100 columns so the client DOM doesn't get overwhelmed by massive numbers of columns<commit_after>\/*\n * SessionData.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#include \"SessionData.hpp\"\n\n#include <string>\n#include <vector>\n#include <sstream>\n\n#include <boost\/bind.hpp>\n#include <boost\/format.hpp>\n\n#include <core\/Log.hpp>\n#include <core\/Error.hpp>\n#include <core\/Exec.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/StringUtils.hpp>\n\n#define R_INTERNAL_FUNCTIONS\n#include <r\/RInternal.hpp>\n#include <r\/RSexp.hpp>\n#include <r\/RExec.hpp>\n#include <r\/RJson.hpp>\n#include <r\/ROptions.hpp>\n#include <r\/RFunctionHook.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n\n#include \"SessionContentUrls.hpp\"\n\nusing namespace core;\n\nnamespace session {\nnamespace modules { \nnamespace data {\n\nnamespace {   \n     \n   \nSEXP dataEntryHook(SEXP call, SEXP op, SEXP args, SEXP rho)\n{\n   \/\/ dataentry(data, modes)\n   \/\/ see in_RX11_dataentry in modules\/X11\/dataentry.c for X11 impl\n   \/\/ see Raqua_dataentry in modules\/aqua\/dataentry.c for aqua impl\n   \/\/ see do_dataentry in gnuwin32\/dataentry.c for win32 impl\n   r::function_hook::checkArity(op, args, call);\n   \n   \/\/ currently not supported\n   r::exec::errorCall(call, \"Editing of matrix and data.frame objects is not \"\n                            \"currently supported in RStudio\");\n   \n   \n   \/\/ NOTE: see implementation of dataViewerHook below for how to \n   \/\/ properly merge exception\/error strategies for the runtime\n   \/\/ context of a hook\n   \n   return R_NilValue;\n}\n\nvoid appendTag(std::string* pHTML,\n               const std::string& text,\n               const std::string& tag,\n               const std::string& className = std::string())\n{\n   std::string classAttrib;\n   if (!className.empty())\n      classAttrib = \" class=\\\"\" + className + \"\\\"\";\n\n   boost::format fmt(\"<%1%%2%>%3%<\/%1%>\");\n   pHTML->append(boost::str(fmt % tag %\n                                  classAttrib %\n                                  string_utils::textToHtml(text)));\n}\n\nvoid appendTD(std::string* pHTML,\n              const std::string& text,\n              const std::string& className = std::string())\n{\n   appendTag(pHTML, text, \"td\", className);\n}\n\nvoid appendTH(std::string* pHTML, const std::string& text)\n{\n   appendTag(pHTML, text, \"th\");\n}\n\nSEXP dataViewerHook(SEXP call, SEXP op, SEXP args, SEXP rho)\n{\n   \/\/ dataviewer(x, title)\n   \/\/ (see in_R_X11_dataviewer in modules\/X11\/dataentry.c for X11 impl)\n   r::function_hook::checkArity(op, args, call);\n      \n   try\n   {\n      \/\/ validate title\n      SEXP titleSEXP = CADR(args);\n      if (!Rf_isString(titleSEXP) || Rf_length(titleSEXP) != 1)\n         throw r::exec::RErrorException(\"invalid title argument\");\n           \n      \/\/ validate data\n      SEXP dataSEXP = CAR(args);\n      if (TYPEOF(dataSEXP) != VECSXP)\n         throw r::exec::RErrorException(\"invalid data argument (not a list)\");\n      \n      \/\/ validate names (View ensures that length(names) == length(data))\n      SEXP namesSEXP = Rf_getAttrib(dataSEXP, R_NamesSymbol);\n      if (TYPEOF(namesSEXP) != STRSXP || \n          Rf_length(namesSEXP) != Rf_length(dataSEXP))\n      {\n         throw r::exec::RErrorException(\n                              \"invalid data argument (names not specified)\");\n      }\n\n      \/\/ get column count\n      int columnCount = r::sexp::length(dataSEXP);\n\n      \/\/ calculate columns to display\n      const int kMaxColumns = 100;\n      int displayedColumns = std::min(columnCount, kMaxColumns);\n\n      \/\/ extract title and column names\n      std::string title = r::sexp::asString(titleSEXP);\n      std::vector<std::string> columnNames;\n      Error error = r::sexp::extract(namesSEXP, &columnNames);\n      if (error)\n         throw r::exec::RErrorException(\"invalid names: \" +\n                                        error.code().message());\n\n      \/\/ truncate columns names to displayedColumns\n      columnNames.resize(displayedColumns);\n\n      \/\/ get column lenghts and then calculate # of rows based on the maximum #\n      \/\/ of elements in single column (technically R can pass columns which have\n      \/\/ a disparate # of rows to this method)\n      int rowCount = 0;\n      std::vector<int> columnLengths;\n      for (int i=0; i<displayedColumns; i++)\n      {\n          \/\/ get the column and record its length (updating rowCount)\n          SEXP columnSEXP = VECTOR_ELT(dataSEXP, i);\n          int columnLength = r::sexp::length(columnSEXP);\n          columnLengths.push_back(columnLength);\n          rowCount = std::max(columnLength, rowCount);\n\n          \/\/ validate data type (R converts all inbound vectors to REAL or STR)\n          if (TYPEOF(columnSEXP) != REALSXP && TYPEOF(columnSEXP) != STRSXP)\n          {\n             throw r::exec::RErrorException(\"Unexpected type for column: \"\n                                            + r::sexp::typeAsString(columnSEXP));\n          }\n      }\n\n      \/\/ calculate rows to display\n      const int kMaxRows = 1000;\n      int displayedRows = std::min(rowCount, kMaxRows);\n\n      \/\/ format the data for presentation\n      r::sexp::Protect rProtect;\n      SEXP formattedDataSEXP = Rf_allocVector(VECSXP, displayedColumns);\n      rProtect.add(formattedDataSEXP);\n      for (int i=0; i<displayedColumns; i++)\n      {\n         SEXP columnSEXP = VECTOR_ELT(dataSEXP, i);\n         SEXP formattedColumnSEXP;\n         r::exec::RFunction formatFx(\".rs.formatDataColumn\");\n         formatFx.addParam(columnSEXP);\n         formatFx.addParam(displayedRows);\n         Error error = formatFx.call(&formattedColumnSEXP, &rProtect);\n         if (error)\n            throw r::exec::RErrorException(error.summary());\n         SET_VECTOR_ELT(formattedDataSEXP, i, formattedColumnSEXP);\n       }\n\n      \/\/ write html header\n      boost::format headerFmt(\n         \"<html>\\n\"\n         \"  <head>\\n\"\n         \"     <title>%1%<\/title>\\n\"\n         \"     <meta charset=\\\"utf-8\\\"\/>\\n\"\n         \"     <link rel=\\\"stylesheet\\\" type=\\\"text\/css\\\" href=\\\"..\/css\/data.css\\\"\/>\\n\"\n         \"  <\/head>\\n\"\n         \"  <body>\\n\");\n      std::string html = boost::str(headerFmt % title);\n\n      \/\/ output begin table & header\n      html += \"<table>\\n\";\n      html += \"<thead><tr>\\n\";\n      html += \"<td id=\\\"origin\\\">&nbsp;<\/td>\"; \/\/ above row numbers\n      std::for_each(columnNames.begin(),\n                    columnNames.end(),\n                    boost::bind(appendTH, &html, _1));\n      html += \"\\n<\/tr><\/thead>\\n\";\n\n      html += \"<tbody>\\n\";\n      \/\/ output rows\n      for (int row=0; row<displayedRows; row++)\n      {\n         html += \"<tr>\\n\";\n\n         \/\/ row number\n         appendTD(&html, boost::lexical_cast<std::string>(row+1), \"rn\");\n\n         \/\/ output a data element from each column where this row is available\n         for (int col=0; col<Rf_length(formattedDataSEXP); col++)\n         {\n            if (columnLengths[col] > row)\n            {\n               SEXP columnSEXP = VECTOR_ELT(formattedDataSEXP, col);\n               SEXP stringSEXP = STRING_ELT(columnSEXP, row);\n               if (stringSEXP != NA_STRING && r::sexp::length(stringSEXP) > 0)\n               {\n                  std::string text(Rf_translateChar(stringSEXP));\n                  appendTD(&html, text);\n               }\n               else\n               {\n                  html += \"<td>&nbsp;<\/td>\";\n               }\n            }\n         }\n\n         html += \"\\n<\/tr>\\n\";\n      }\n      html += \"<\/tbody>\\n\";\n\n      \/\/ append table footer\n      html += \"\\n<\/table>\\n\";\n\n      \/\/ append document footer\n      html += \"<\/body><\/html>\\n\";\n\n      \/\/ fire show data event\n      json::Object dataItem;\n      dataItem[\"title\"] = title;\n      dataItem[\"totalObservations\"] = rowCount;\n      dataItem[\"displayedObservations\"] = displayedRows;\n      dataItem[\"variables\"] = columnCount;\n      dataItem[\"displayedVariables\"] = displayedColumns;\n      dataItem[\"contentUrl\"] = content_urls::provision(title, html, \".htm\");\n      ClientEvent event(client_events::kShowData, dataItem);\n      module_context::enqueClientEvent(event);\n\n      \/\/ done\n      return R_NilValue;\n   }\n   catch(r::exec::RErrorException& e)\n   {\n      r::exec::errorCall(call, e.message());\n   }\n   CATCH_UNEXPECTED_EXCEPTION\n   \n   \/\/ keep compiler happy\n   return R_NilValue;\n}\n  \n\n} \/\/ anonymous namespace\n   \nError initialize()\n{\n   using boost::bind;\n   using namespace r::function_hook ;\n   using namespace session::module_context;\n   ExecBlock initBlock ;\n   initBlock.addFunctions()\n      (bind(registerReplaceHook, \"dataentry\", dataEntryHook, (CCODE*)NULL))\n      (bind(registerReplaceHook, \"dataviewer\", dataViewerHook,(CCODE*)NULL))\n      (bind(sourceModuleRFile, \"SessionData.R\"));\n   \n   return initBlock.execute();\n}\n\n\n} \/\/ namespace data\n} \/\/ namespace modules\n} \/\/ namesapce session\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014, University of Freiburg,\n\/\/ Chair of Algorithms and Data Structures.\n\/\/ Author: Björn Buchhold (buchhold@informatik.uni-freiburg.de)\n\n#include \".\/SparqlParser.h\"\n#include \".\/ParseException.h\"\n#include \"..\/util\/StringUtils.h\"\n\n\/\/ _____________________________________________________________________________\nParsedQuery SparqlParser::parse(const string& query) {\n  ParsedQuery result;\n\n  \/\/ Split prologue\n  size_t i = query.find(\"SELECT\");\n  if (i == string::npos) {\n    throw ParseException(\"Missing keyword \\\"SELECT\\\", \"\n        \"currently only select queries are supported.\");\n  }\n\n  size_t j = query.find(\"WHERE\");\n  if (j == string::npos) {\n    throw ParseException(\"Missing keyword \\\"WHERE\\\", \"\n        \"currently only select queries are supported.\");\n  }\n\n  if (i >= j) {\n    throw ParseException(\"Keyword \\\"WHERE\\\" \"\n        \"found after keyword \\\"SELECT\\\". Invalid query.\");\n  }\n\n  parsePrologue(ad_utility::strip(query.substr(0, i), \" \\n\\t\"), result);\n  parseSelect(ad_utility::strip(query.substr(i, j - (i + 1)), \" \\n\\t\"), result);\n  parseWhere(ad_utility::strip(query.substr(j), \" \\n\\t\"), result);\n\n  return result;\n}\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::parsePrologue(string str, ParsedQuery& query) {\n  if (str.find(\"BASE\") != string::npos) {\n    throw ParseException(\"Bases are not supported, yet.\");\n  }\n\n  if (str.find(\"BASE\") != string::npos) {\n    throw ParseException(\"Bases are not supported, yet.\");\n  }\n\n  size_t i = str.find(\"PREFIX\");\n  while (i != string::npos) {\n    size_t j = str.find(\"PREFIX\", i + 1);\n    addPrefix(str.substr(i, j - i), query);\n    i = j;\n  }\n}\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::addPrefix(const string& str, ParsedQuery& query) {\n  auto parts = ad_utility::split(ad_utility::strip(str, ' '), ' ');\n  if (parts.size() != 3) {\n    throw ParseException(string(\"Invalid PREFIX statement: \") + str);\n  }\n  string uri = ad_utility::strip(parts[2], \" \\t\\n\");\n  if (uri.size() == 0 || uri[0] != '<' || uri[uri.size() - 1] != '>') {\n    throw ParseException(string(\"Invalid URI in PREFIX: \") + uri);\n  }\n  SparqlPrefix p{ad_utility::strip(parts[1], \" :\\t\\n\"), uri};\n  query._prefixes.emplace_back(p);\n};\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::parseSelect(const string& str, ParsedQuery& query) {\n  assert(ad_utility::startsWith(str, \"SELECT\"));\n  auto vars = ad_utility::split(str, ' ');\n  for (size_t i = 1; i < vars.size(); ++i) {\n    if (ad_utility::startsWith(vars[i], \"?\")) {\n      query._selectedVariables.push_back(vars[i]);\n    } else {\n      throw ParseException(string(\"Invalid variable in select clause: \\\"\") +\n          vars[i] + \"\\\"\");\n    }\n  }\n}\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::parseWhere(const string& str, ParsedQuery& query) {\n  size_t i = str.find('{');\n  size_t j = str.find('}', i);\n  if (i == string::npos) {\n    throw ParseException(\"Need curly braces in where clause.\");\n  }\n  string inner = ad_utility::strip(str.substr(i + 1, j - i - 1), \"\\n\\t \");\n\n  \/\/ Split where clauses. Cannot simply split at dots, because they may occur\n  \/\/ in URIs.\n  vector<string> clauses;\n  size_t start = 0;\n  bool insideUri = false;\n  while (start < inner.size()) {\n    size_t k = start;\n    while (k < inner.size()) {\n      if (!insideUri) {\n        if (inner[k] == '.') {\n          clauses.emplace_back(inner.substr(start, k - start));\n          break;\n        }\n        if (inner[k] == '<') {insideUri = true;}\n      } else {\n        if (inner[k] == '>') {insideUri = false;}\n      }\n      ++k;\n    }\n    if (k == inner.size()) {clauses.emplace_back(inner.substr(start));}\n    start = k + 1;\n  }\n  for (const string& clause: clauses) {\n    string c = ad_utility::strip(clause, ' ');\n    if (c.size() > 0) {\n      addWhereTriple(c, query);\n    }\n  }\n}\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::addWhereTriple(const string& str, ParsedQuery& query) {\n  auto spo = ad_utility::split(str, ' ');\n  if (spo.size() != 3) {\n    throw ParseException(string(\"Invalid triple, expected format: \\\"s p o\\\". \"\n        \"Triple was: \") + str);\n  }\n  query._whereClauseTriples.emplace_back(SparqlTriple{spo[0], spo[1], spo[2]});\n}\n<commit_msg>Fixed another problem with separator chars in queries<commit_after>\/\/ Copyright 2014, University of Freiburg,\n\/\/ Chair of Algorithms and Data Structures.\n\/\/ Author: Björn Buchhold (buchhold@informatik.uni-freiburg.de)\n\n#include <bits\/algorithmfwd.h>\n#include \".\/SparqlParser.h\"\n#include \".\/ParseException.h\"\n#include \"..\/util\/StringUtils.h\"\n\n\/\/ _____________________________________________________________________________\nParsedQuery SparqlParser::parse(const string& query) {\n  ParsedQuery result;\n\n  \/\/ Split prologue\n  size_t i = query.find(\"SELECT\");\n  if (i == string::npos) {\n    throw ParseException(\"Missing keyword \\\"SELECT\\\", \"\n        \"currently only select queries are supported.\");\n  }\n\n  size_t j = query.find(\"WHERE\");\n  if (j == string::npos) {\n    throw ParseException(\"Missing keyword \\\"WHERE\\\", \"\n        \"currently only select queries are supported.\");\n  }\n\n  if (i >= j) {\n    throw ParseException(\"Keyword \\\"WHERE\\\" \"\n        \"found after keyword \\\"SELECT\\\". Invalid query.\");\n  }\n\n  parsePrologue(ad_utility::strip(query.substr(0, i), \" \\n\\t\"), result);\n  parseSelect(ad_utility::strip(query.substr(i, j - (i + 1)), \" \\n\\t\"), result);\n  parseWhere(ad_utility::strip(query.substr(j), \" \\n\\t\"), result);\n\n  return result;\n}\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::parsePrologue(string str, ParsedQuery& query) {\n  if (str.find(\"BASE\") != string::npos) {\n    throw ParseException(\"Bases are not supported, yet.\");\n  }\n\n  if (str.find(\"BASE\") != string::npos) {\n    throw ParseException(\"Bases are not supported, yet.\");\n  }\n\n  size_t i = str.find(\"PREFIX\");\n  while (i != string::npos) {\n    size_t j = str.find(\"PREFIX\", i + 1);\n    addPrefix(str.substr(i, j - i), query);\n    i = j;\n  }\n}\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::addPrefix(const string& str, ParsedQuery& query) {\n  auto parts = ad_utility::split(ad_utility::strip(str, ' '), ' ');\n  if (parts.size() != 3) {\n    throw ParseException(string(\"Invalid PREFIX statement: \") + str);\n  }\n  string uri = ad_utility::strip(parts[2], \" \\t\\n\");\n  if (uri.size() == 0 || uri[0] != '<' || uri[uri.size() - 1] != '>') {\n    throw ParseException(string(\"Invalid URI in PREFIX: \") + uri);\n  }\n  SparqlPrefix p{ad_utility::strip(parts[1], \" :\\t\\n\"), uri};\n  query._prefixes.emplace_back(p);\n};\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::parseSelect(const string& str, ParsedQuery& query) {\n  assert(ad_utility::startsWith(str, \"SELECT\"));\n  auto vars = ad_utility::split(str, ' ');\n  for (size_t i = 1; i < vars.size(); ++i) {\n    if (ad_utility::startsWith(vars[i], \"?\")) {\n      query._selectedVariables.push_back(vars[i]);\n    } else {\n      throw ParseException(string(\"Invalid variable in select clause: \\\"\") +\n          vars[i] + \"\\\"\");\n    }\n  }\n}\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::parseWhere(const string& str, ParsedQuery& query) {\n  size_t i = str.find('{');\n  size_t j = str.find('}', i);\n  if (i == string::npos) {\n    throw ParseException(\"Need curly braces in where clause.\");\n  }\n  string inner = ad_utility::strip(str.substr(i + 1, j - i - 1), \"\\n\\t \");\n\n  \/\/ Split where clauses. Cannot simply split at dots, because they may occur\n  \/\/ in URIs.\n  vector<string> clauses;\n  size_t start = 0;\n  bool insideUri = false;\n  while (start < inner.size()) {\n    size_t k = start;\n    while (k < inner.size()) {\n      if (!insideUri) {\n        if (inner[k] == '.') {\n          clauses.emplace_back(inner.substr(start, k - start));\n          break;\n        }\n        if (inner[k] == '<') {insideUri = true;}\n      } else {\n        if (inner[k] == '>') {insideUri = false;}\n      }\n      ++k;\n    }\n    if (k == inner.size()) {clauses.emplace_back(inner.substr(start));}\n    start = k + 1;\n  }\n  for (const string& clause: clauses) {\n    string c = ad_utility::strip(clause, ' ');\n    if (c.size() > 0) {\n      addWhereTriple(c, query);\n    }\n  }\n}\n\n\/\/ _____________________________________________________________________________\nvoid SparqlParser::addWhereTriple(const string& str, ParsedQuery& query) {\n  auto spo = ad_utility::split(str, ' ');\n  if (spo.size() != 3) {\n    throw ParseException(string(\"Invalid triple, expected format: \\\"s p o\\\". \"\n        \"Triple was: \") + str);\n  }\n  query._whereClauseTriples.emplace_back(SparqlTriple{\n      ad_utility::strip(spo[0], \"\\n\\t \"),\n      ad_utility::strip(spo[1], \"\\n\\t \"),\n      ad_utility::strip(spo[2], \"\\n\\t \")\n  });\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 \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/run_loop.h\"\n#include \"base\/thread_task_runner_handle.h\"\n#include \"base\/trace_event\/memory_dump_manager.h\"\n#include \"base\/trace_event\/memory_dump_provider.h\"\n#include \"base\/trace_event\/memory_dump_request_args.h\"\n#include \"content\/public\/browser\/tracing_controller.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"content\/public\/test\/content_browser_test.h\"\n#include \"content\/public\/test\/content_browser_test_utils.h\"\n#include \"content\/shell\/browser\/shell.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n\nusing base::trace_event::MemoryDumpArgs;\nusing base::trace_event::MemoryDumpManager;\nusing base::trace_event::MemoryDumpType;\nusing base::trace_event::ProcessMemoryDump;\nusing testing::_;\nusing testing::Return;\n\nnamespace content {\n\n\/\/ A mock dump provider, used to check that dump requests actually end up\n\/\/ creating memory dumps.\nclass MockDumpProvider : public base::trace_event::MemoryDumpProvider {\n public:\n  MOCK_METHOD2(OnMemoryDump, bool(const MemoryDumpArgs& args,\n                                  ProcessMemoryDump* pmd));\n};\n\nclass MemoryTracingTest : public ContentBrowserTest {\n public:\n  void DoRequestGlobalDump(const base::trace_event::MemoryDumpCallback& cb) {\n    MemoryDumpArgs dump_args = { MemoryDumpArgs::LevelOfDetail::HIGH };\n    MemoryDumpManager::GetInstance()->RequestGlobalDump(\n        MemoryDumpType::EXPLICITLY_TRIGGERED, dump_args, cb);\n  }\n\n  \/\/ Used as callback argument for MemoryDumpManager::RequestGlobalDump():\n  void OnGlobalMemoryDumpDone(\n      scoped_refptr<base::SingleThreadTaskRunner> task_runner,\n      base::Closure closure,\n      uint64 dump_guid,\n      bool success) {\n    \/\/ Make sure we run the RunLoop closure on the same thread that originated\n    \/\/ the run loop (which is the IN_PROC_BROWSER_TEST_F main thread).\n    if (!task_runner->RunsTasksOnCurrentThread()) {\n      task_runner->PostTask(\n          FROM_HERE, base::Bind(&MemoryTracingTest::OnGlobalMemoryDumpDone,\n                                base::Unretained(this), task_runner, closure,\n                                dump_guid, success));\n      return;\n    }\n    ++callback_call_count_;\n    last_callback_dump_guid_ = dump_guid;\n    last_callback_success_ = success;\n    closure.Run();\n  }\n\n protected:\n  void SetUp() override {\n    callback_call_count_ = 0;\n    last_callback_dump_guid_ = 0;\n    last_callback_success_ = false;\n    MemoryDumpManager::GetInstance()->Initialize();\n    mock_dump_provider_.reset(new MockDumpProvider());\n    MemoryDumpManager::GetInstance()->RegisterDumpProvider(\n        mock_dump_provider_.get());\n    \/\/ TODO(primiano): This should be done via TraceConfig.\n    \/\/ See https:\/\/goo.gl\/5Hj3o0.\n    MemoryDumpManager::GetInstance()->DisablePeriodicDumpsForTesting();\n    ContentBrowserTest::SetUp();\n  }\n\n  void TearDown() override {\n    MemoryDumpManager::GetInstance()->UnregisterDumpProvider(\n        mock_dump_provider_.get());\n    mock_dump_provider_.reset();\n    ContentBrowserTest::TearDown();\n  }\n\n  void EnableMemoryTracing() {\n    base::RunLoop run_loop;\n    std::string category_filter = MemoryDumpManager::kTraceCategoryForTesting;\n    base::trace_event::TraceConfig trace_config(category_filter, \"\");\n    bool success = TracingController::GetInstance()->EnableRecording(\n      trace_config, run_loop.QuitClosure());\n    EXPECT_TRUE(success);\n    run_loop.Run();\n  }\n\n  void DisableTracing() {\n    bool success = TracingController::GetInstance()->DisableRecording(NULL);\n    EXPECT_TRUE(success);\n    base::RunLoop().RunUntilIdle();\n  }\n\n  void RequestGlobalDumpAndWait(bool from_renderer_thread) {\n    base::RunLoop run_loop;\n    base::trace_event::MemoryDumpCallback callback = base::Bind(\n        &MemoryTracingTest::OnGlobalMemoryDumpDone, base::Unretained(this),\n        base::ThreadTaskRunnerHandle::Get(), run_loop.QuitClosure());\n    if (from_renderer_thread) {\n      PostTaskToInProcessRendererAndWait(\n          base::Bind(&MemoryTracingTest::DoRequestGlobalDump,\n                     base::Unretained(this), callback));\n    } else {\n      DoRequestGlobalDump(callback);\n    }\n    run_loop.Run();\n  }\n\n  void Navigate(Shell* shell) {\n    NavigateToURL(shell, GetTestUrl(\"\", \"title.html\"));\n  }\n\n  base::Closure on_memory_dump_complete_closure_;\n  scoped_ptr<MockDumpProvider> mock_dump_provider_;\n  uint32 callback_call_count_;\n  uint64 last_callback_dump_guid_;\n  bool last_callback_success_;\n};\n\nclass SingleProcessMemoryTracingTest : public MemoryTracingTest {\n public:\n  SingleProcessMemoryTracingTest() {}\n\n  void SetUpCommandLine(base::CommandLine* command_line) override {\n    command_line->AppendSwitch(switches::kSingleProcess);\n  }\n};\n\n\/\/ Checks that a memory dump initiated from a the main browser thread ends up in\n\/\/ a single dump even in single process mode.\nIN_PROC_BROWSER_TEST_F(SingleProcessMemoryTracingTest,\n                       BrowserInitiatedSingleDump) {\n  Navigate(shell());\n\n  EXPECT_CALL(*mock_dump_provider_, OnMemoryDump(_,_)).WillOnce(Return(true));\n\n  EnableMemoryTracing();\n  RequestGlobalDumpAndWait(false \/* from_renderer_thread *\/);\n  EXPECT_EQ(1u, callback_call_count_);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n  DisableTracing();\n}\n\n\/\/ Checks that a memory dump initiated from a renderer thread ends up in a\n\/\/ single dump even in single process mode.\nIN_PROC_BROWSER_TEST_F(SingleProcessMemoryTracingTest,\n                       RendererInitiatedSingleDump) {\n  Navigate(shell());\n\n  EXPECT_CALL(*mock_dump_provider_, OnMemoryDump(_,_)).WillOnce(Return(true));\n\n  EnableMemoryTracing();\n  RequestGlobalDumpAndWait(true \/* from_renderer_thread *\/);\n  EXPECT_EQ(1u, callback_call_count_);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n  DisableTracing();\n}\n\nIN_PROC_BROWSER_TEST_F(SingleProcessMemoryTracingTest, ManyInterleavedDumps) {\n  Navigate(shell());\n\n  EXPECT_CALL(*mock_dump_provider_, OnMemoryDump(_,_))\n      .Times(4)\n      .WillRepeatedly(Return(true));\n\n  EnableMemoryTracing();\n\n  RequestGlobalDumpAndWait(true \/* from_renderer_thread *\/);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n\n  RequestGlobalDumpAndWait(false \/* from_renderer_thread *\/);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n\n  RequestGlobalDumpAndWait(false \/* from_renderer_thread *\/);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n\n  RequestGlobalDumpAndWait(true \/* from_renderer_thread *\/);\n  EXPECT_EQ(4u, callback_call_count_);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n\n  DisableTracing();\n}\n\n\/\/ Checks that a memory dump initiated from a the main browser thread ends up in\n\/\/ a successful dump.\nIN_PROC_BROWSER_TEST_F(MemoryTracingTest, BrowserInitiatedDump) {\n  Navigate(shell());\n\n  EXPECT_CALL(*mock_dump_provider_, OnMemoryDump(_,_)).WillOnce(Return(true));\n\n  EnableMemoryTracing();\n  RequestGlobalDumpAndWait(false \/* from_renderer_thread *\/);\n  EXPECT_EQ(1u, callback_call_count_);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n  DisableTracing();\n}\n\n}  \/\/ namespace content\n<commit_msg>Disable flaky SingleProcessMemoryTracingTest tests.<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\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/run_loop.h\"\n#include \"base\/thread_task_runner_handle.h\"\n#include \"base\/trace_event\/memory_dump_manager.h\"\n#include \"base\/trace_event\/memory_dump_provider.h\"\n#include \"base\/trace_event\/memory_dump_request_args.h\"\n#include \"content\/public\/browser\/tracing_controller.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"content\/public\/test\/content_browser_test.h\"\n#include \"content\/public\/test\/content_browser_test_utils.h\"\n#include \"content\/shell\/browser\/shell.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n\nusing base::trace_event::MemoryDumpArgs;\nusing base::trace_event::MemoryDumpManager;\nusing base::trace_event::MemoryDumpType;\nusing base::trace_event::ProcessMemoryDump;\nusing testing::_;\nusing testing::Return;\n\nnamespace content {\n\n\/\/ A mock dump provider, used to check that dump requests actually end up\n\/\/ creating memory dumps.\nclass MockDumpProvider : public base::trace_event::MemoryDumpProvider {\n public:\n  MOCK_METHOD2(OnMemoryDump, bool(const MemoryDumpArgs& args,\n                                  ProcessMemoryDump* pmd));\n};\n\nclass MemoryTracingTest : public ContentBrowserTest {\n public:\n  void DoRequestGlobalDump(const base::trace_event::MemoryDumpCallback& cb) {\n    MemoryDumpArgs dump_args = { MemoryDumpArgs::LevelOfDetail::HIGH };\n    MemoryDumpManager::GetInstance()->RequestGlobalDump(\n        MemoryDumpType::EXPLICITLY_TRIGGERED, dump_args, cb);\n  }\n\n  \/\/ Used as callback argument for MemoryDumpManager::RequestGlobalDump():\n  void OnGlobalMemoryDumpDone(\n      scoped_refptr<base::SingleThreadTaskRunner> task_runner,\n      base::Closure closure,\n      uint64 dump_guid,\n      bool success) {\n    \/\/ Make sure we run the RunLoop closure on the same thread that originated\n    \/\/ the run loop (which is the IN_PROC_BROWSER_TEST_F main thread).\n    if (!task_runner->RunsTasksOnCurrentThread()) {\n      task_runner->PostTask(\n          FROM_HERE, base::Bind(&MemoryTracingTest::OnGlobalMemoryDumpDone,\n                                base::Unretained(this), task_runner, closure,\n                                dump_guid, success));\n      return;\n    }\n    ++callback_call_count_;\n    last_callback_dump_guid_ = dump_guid;\n    last_callback_success_ = success;\n    closure.Run();\n  }\n\n protected:\n  void SetUp() override {\n    callback_call_count_ = 0;\n    last_callback_dump_guid_ = 0;\n    last_callback_success_ = false;\n    MemoryDumpManager::GetInstance()->Initialize();\n    mock_dump_provider_.reset(new MockDumpProvider());\n    MemoryDumpManager::GetInstance()->RegisterDumpProvider(\n        mock_dump_provider_.get());\n    \/\/ TODO(primiano): This should be done via TraceConfig.\n    \/\/ See https:\/\/goo.gl\/5Hj3o0.\n    MemoryDumpManager::GetInstance()->DisablePeriodicDumpsForTesting();\n    ContentBrowserTest::SetUp();\n  }\n\n  void TearDown() override {\n    MemoryDumpManager::GetInstance()->UnregisterDumpProvider(\n        mock_dump_provider_.get());\n    mock_dump_provider_.reset();\n    ContentBrowserTest::TearDown();\n  }\n\n  void EnableMemoryTracing() {\n    base::RunLoop run_loop;\n    std::string category_filter = MemoryDumpManager::kTraceCategoryForTesting;\n    base::trace_event::TraceConfig trace_config(category_filter, \"\");\n    bool success = TracingController::GetInstance()->EnableRecording(\n      trace_config, run_loop.QuitClosure());\n    EXPECT_TRUE(success);\n    run_loop.Run();\n  }\n\n  void DisableTracing() {\n    bool success = TracingController::GetInstance()->DisableRecording(NULL);\n    EXPECT_TRUE(success);\n    base::RunLoop().RunUntilIdle();\n  }\n\n  void RequestGlobalDumpAndWait(bool from_renderer_thread) {\n    base::RunLoop run_loop;\n    base::trace_event::MemoryDumpCallback callback = base::Bind(\n        &MemoryTracingTest::OnGlobalMemoryDumpDone, base::Unretained(this),\n        base::ThreadTaskRunnerHandle::Get(), run_loop.QuitClosure());\n    if (from_renderer_thread) {\n      PostTaskToInProcessRendererAndWait(\n          base::Bind(&MemoryTracingTest::DoRequestGlobalDump,\n                     base::Unretained(this), callback));\n    } else {\n      DoRequestGlobalDump(callback);\n    }\n    run_loop.Run();\n  }\n\n  void Navigate(Shell* shell) {\n    NavigateToURL(shell, GetTestUrl(\"\", \"title.html\"));\n  }\n\n  base::Closure on_memory_dump_complete_closure_;\n  scoped_ptr<MockDumpProvider> mock_dump_provider_;\n  uint32 callback_call_count_;\n  uint64 last_callback_dump_guid_;\n  bool last_callback_success_;\n};\n\nclass SingleProcessMemoryTracingTest : public MemoryTracingTest {\n public:\n  SingleProcessMemoryTracingTest() {}\n\n  void SetUpCommandLine(base::CommandLine* command_line) override {\n    command_line->AppendSwitch(switches::kSingleProcess);\n  }\n};\n\n\/\/ This test is flaky on Mac. See crbug.com\/522009.\n#if defined(OS_MACOSX)\n#define MAYBE_BrowserInitiatedSingleDump DISABLED_BrowserInitiatedSingleDump\n#else\n#define MAYBE_BrowserInitiatedSingleDump BrowserInitiatedSingleDump\n#endif\n\/\/ Checks that a memory dump initiated from a the main browser thread ends up in\n\/\/ a single dump even in single process mode.\nIN_PROC_BROWSER_TEST_F(SingleProcessMemoryTracingTest,\n                       MAYBE_BrowserInitiatedSingleDump) {\n  Navigate(shell());\n\n  EXPECT_CALL(*mock_dump_provider_, OnMemoryDump(_,_)).WillOnce(Return(true));\n\n  EnableMemoryTracing();\n  RequestGlobalDumpAndWait(false \/* from_renderer_thread *\/);\n  EXPECT_EQ(1u, callback_call_count_);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n  DisableTracing();\n}\n\n\/\/ Checks that a memory dump initiated from a renderer thread ends up in a\n\/\/ single dump even in single process mode.\nIN_PROC_BROWSER_TEST_F(SingleProcessMemoryTracingTest,\n                       RendererInitiatedSingleDump) {\n  Navigate(shell());\n\n  EXPECT_CALL(*mock_dump_provider_, OnMemoryDump(_,_)).WillOnce(Return(true));\n\n  EnableMemoryTracing();\n  RequestGlobalDumpAndWait(true \/* from_renderer_thread *\/);\n  EXPECT_EQ(1u, callback_call_count_);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n  DisableTracing();\n}\n\n\/\/ This test is flaky on Mac. See crbug.com\/522009.\n#if defined(OS_MACOSX)\n#define MAYBE_ManyInterleavedDumps DISABLED_ManyInterleavedDumps\n#else\n#define MAYBE_ManyInterleavedDumps ManyInterleavedDumps\n#endif\nIN_PROC_BROWSER_TEST_F(SingleProcessMemoryTracingTest,\n                       MAYBE_ManyInterleavedDumps) {\n  Navigate(shell());\n\n  EXPECT_CALL(*mock_dump_provider_, OnMemoryDump(_,_))\n      .Times(4)\n      .WillRepeatedly(Return(true));\n\n  EnableMemoryTracing();\n\n  RequestGlobalDumpAndWait(true \/* from_renderer_thread *\/);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n\n  RequestGlobalDumpAndWait(false \/* from_renderer_thread *\/);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n\n  RequestGlobalDumpAndWait(false \/* from_renderer_thread *\/);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n\n  RequestGlobalDumpAndWait(true \/* from_renderer_thread *\/);\n  EXPECT_EQ(4u, callback_call_count_);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n\n  DisableTracing();\n}\n\n\/\/ Checks that a memory dump initiated from a the main browser thread ends up in\n\/\/ a successful dump.\nIN_PROC_BROWSER_TEST_F(MemoryTracingTest, BrowserInitiatedDump) {\n  Navigate(shell());\n\n  EXPECT_CALL(*mock_dump_provider_, OnMemoryDump(_,_)).WillOnce(Return(true));\n\n  EnableMemoryTracing();\n  RequestGlobalDumpAndWait(false \/* from_renderer_thread *\/);\n  EXPECT_EQ(1u, callback_call_count_);\n  EXPECT_NE(0u, last_callback_dump_guid_);\n  EXPECT_TRUE(last_callback_success_);\n  DisableTracing();\n}\n\n}  \/\/ namespace content\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2018 Google LLC.\n\/\/ Use of this source code is governed by a BSD-style license that can be found in the LICENSE file.\n\n#include \"src\/pdf\/SkPDFSubsetFont.h\"\n\n#if defined(SK_USING_THIRD_PARTY_ICU)\n#include \"SkLoadICU.h\"\n#endif\n\n#if defined(SK_PDF_USE_HARFBUZZ_SUBSET)\n\n#include \"include\/private\/SkTemplates.h\"\n#include \"include\/private\/SkTo.h\"\n#include \"src\/utils\/SkCallableTraits.h\"\n\n#include \"hb.h\"\n#include \"hb-subset.h\"\n\ntemplate <class T, void(*P)(T*)> using resource =\n    std::unique_ptr<T, SkFunctionWrapper<skstd::remove_pointer_t<decltype(P)>, P>>;\nusing HBBlob = resource<hb_blob_t, &hb_blob_destroy>;\nusing HBFace = resource<hb_face_t, &hb_face_destroy>;\nusing HBSubsetInput = resource<hb_subset_input_t, &hb_subset_input_destroy>;\nusing HBSet = resource<hb_set_t, &hb_set_destroy>;\n\nstatic HBBlob to_blob(sk_sp<SkData> data) {\n    using blob_size_t = SkCallableTraits<decltype(hb_blob_create)>::argument<1>::type;\n    if (!SkTFitsIn<blob_size_t>(data->size())) {\n        return nullptr;\n    }\n    const char* blobData = static_cast<const char*>(data->data());\n    blob_size_t blobSize = SkTo<blob_size_t>(data->size());\n    return HBBlob(hb_blob_create(blobData, blobSize,\n                                 HB_MEMORY_MODE_READONLY,\n                                 data.release(), [](void* p){ ((SkData*)p)->unref(); }));\n}\n\nstatic sk_sp<SkData> to_data(HBBlob blob) {\n    if (!blob) {\n        return nullptr;\n    }\n    unsigned int length;\n    const char* data = hb_blob_get_data(blob.get(), &length);\n    if (!data || !length) {\n        return nullptr;\n    }\n    return SkData::MakeWithProc(data, SkToSizeT(length),\n                                [](const void*, void* ctx) { hb_blob_destroy((hb_blob_t*)ctx); },\n                                blob.release());\n}\n\nstatic sk_sp<SkData> subset_harfbuzz(sk_sp<SkData> fontData,\n                                     const SkPDFGlyphUse& glyphUsage,\n                                     int ttcIndex) {\n#if defined(SK_USING_THIRD_PARTY_ICU)\n    if (!SkLoadICU()) {\n        return nullptr;\n    }\n#endif\n    if (!fontData) {\n        return nullptr;\n    }\n    HBFace face(hb_face_create(to_blob(std::move(fontData)).get(), ttcIndex));\n    SkASSERT(face);\n\n    HBSubsetInput input(hb_subset_input_create_or_fail());\n    SkASSERT(input);\n    if (!face || !input) {\n        return nullptr;\n    }\n    hb_set_t* glyphs = hb_subset_input_glyph_set(input.get());\n    glyphUsage.getSetValues([&glyphs](unsigned gid) { hb_set_add(glyphs, gid);});\n\n    hb_subset_input_set_retain_gids(input.get(), true);\n    hb_subset_input_set_drop_hints(input.get(), true);\n    HBFace subset(hb_subset(face.get(), input.get()));\n    HBBlob result(hb_face_reference_blob(subset.get()));\n    return to_data(std::move(result));\n}\n\n#endif  \/\/ defined(SK_PDF_USE_HARFBUZZ_SUBSET)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if defined(SK_PDF_USE_SFNTLY)\n\n#include \"sample\/chromium\/font_subsetter.h\"\n#include <vector>\n\nstatic sk_sp<SkData> subset_sfntly(sk_sp<SkData> fontData,\n                                   const SkPDFGlyphUse& glyphUsage,\n                                   const char* fontName,\n                                   int ttcIndex) {\n#if defined(SK_USING_THIRD_PARTY_ICU)\n    if (!SkLoadICU()) {\n        return nullptr;\n    }\n#endif\n    \/\/ Generate glyph id array in format needed by sfntly.\n    \/\/ TODO(halcanary): sfntly should take a more compact format.\n    std::vector<unsigned> subset;\n    glyphUsage.getSetValues([&subset](unsigned v) { subset.push_back(v); });\n\n    unsigned char* subsetFont{nullptr};\n#if defined(SK_BUILD_FOR_GOOGLE3)\n    \/\/ TODO(halcanary): update SK_BUILD_FOR_GOOGLE3 to newest version of Sfntly.\n    (void)ttcIndex;\n    int subsetFontSize = SfntlyWrapper::SubsetFont(fontName,\n                                                   fontData->bytes(),\n                                                   fontData->size(),\n                                                   subset.data(),\n                                                   subset.size(),\n                                                   &subsetFont);\n#else  \/\/ defined(SK_BUILD_FOR_GOOGLE3)\n    (void)fontName;\n    int subsetFontSize = SfntlyWrapper::SubsetFont(ttcIndex,\n                                                   fontData->bytes(),\n                                                   fontData->size(),\n                                                   subset.data(),\n                                                   subset.size(),\n                                                   &subsetFont);\n#endif  \/\/ defined(SK_BUILD_FOR_GOOGLE3)\n    SkASSERT(subsetFontSize > 0 || subsetFont == nullptr);\n    if (subsetFontSize < 1 || subsetFont == nullptr) {\n        return nullptr;\n    }\n    return SkData::MakeWithProc(subsetFont, subsetFontSize,\n                                [](const void* p, void*) { delete[] (unsigned char*)p; },\n                                nullptr);\n}\n\n#endif  \/\/ defined(SK_PDF_USE_SFNTLY)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if defined(SK_PDF_USE_SFNTLY) && defined(SK_PDF_USE_HARFBUZZ_SUBSET)\n\nsk_sp<SkData> SkPDFSubsetFont(sk_sp<SkData> fontData,\n                              const SkPDFGlyphUse& glyphUsage,\n                              SkPDF::Metadata::Subsetter subsetter,\n                              const char* fontName,\n                              int ttcIndex) {\n    switch (subsetter) {\n        case SkPDF::Metadata::kHarfbuzz_Subsetter:\n            return subset_harfbuzz(std::move(fontData), glyphUsage, ttcIndex);\n        case SkPDF::Metadata::kSfntly_Subsetter:\n            return subset_sfntly(std::move(fontData), glyphUsage, fontName, ttcIndex);\n    }\n    return nullptr;\n}\n\n#elif defined(SK_PDF_USE_SFNTLY)\n\nsk_sp<SkData> SkPDFSubsetFont(sk_sp<SkData> fontData,\n                              const SkPDFGlyphUse& glyphUsage,\n                              SkPDF::Metadata::Subsetter,\n                              const char* fontName,\n                              int ttcIndex) {\n    return subset_sfntly(std::move(fontData), glyphUsage, fontName, ttcIndex);\n}\n\n#elif defined(SK_PDF_USE_HARFBUZZ_SUBSET)\n\nsk_sp<SkData> SkPDFSubsetFont(sk_sp<SkData> fontData,\n                              const SkPDFGlyphUse& glyphUsage,\n                              SkPDF::Metadata::Subsetter,\n                              const char*,\n                              int ttcIndex) {\n    return subset_harfbuzz(std::move(fontData), glyphUsage, ttcIndex);\n}\n\n#else\n\nsk_sp<SkData> SkPDFSubsetFont(sk_sp<SkData>, const SkPDFGlyphUse&, SkPDF::Metadata::Subsetter,\n                              const char*, int) {\n    return nullptr;\n}\n#endif  \/\/ defined(SK_PDF_USE_SFNTLY)\n\n<commit_msg>Retain hints when subsetting for PDF.<commit_after>\/\/ Copyright 2018 Google LLC.\n\/\/ Use of this source code is governed by a BSD-style license that can be found in the LICENSE file.\n\n#include \"src\/pdf\/SkPDFSubsetFont.h\"\n\n#if defined(SK_USING_THIRD_PARTY_ICU)\n#include \"SkLoadICU.h\"\n#endif\n\n#if defined(SK_PDF_USE_HARFBUZZ_SUBSET)\n\n#include \"include\/private\/SkTemplates.h\"\n#include \"include\/private\/SkTo.h\"\n#include \"src\/utils\/SkCallableTraits.h\"\n\n#include \"hb.h\"\n#include \"hb-subset.h\"\n\ntemplate <class T, void(*P)(T*)> using resource =\n    std::unique_ptr<T, SkFunctionWrapper<skstd::remove_pointer_t<decltype(P)>, P>>;\nusing HBBlob = resource<hb_blob_t, &hb_blob_destroy>;\nusing HBFace = resource<hb_face_t, &hb_face_destroy>;\nusing HBSubsetInput = resource<hb_subset_input_t, &hb_subset_input_destroy>;\nusing HBSet = resource<hb_set_t, &hb_set_destroy>;\n\nstatic HBBlob to_blob(sk_sp<SkData> data) {\n    using blob_size_t = SkCallableTraits<decltype(hb_blob_create)>::argument<1>::type;\n    if (!SkTFitsIn<blob_size_t>(data->size())) {\n        return nullptr;\n    }\n    const char* blobData = static_cast<const char*>(data->data());\n    blob_size_t blobSize = SkTo<blob_size_t>(data->size());\n    return HBBlob(hb_blob_create(blobData, blobSize,\n                                 HB_MEMORY_MODE_READONLY,\n                                 data.release(), [](void* p){ ((SkData*)p)->unref(); }));\n}\n\nstatic sk_sp<SkData> to_data(HBBlob blob) {\n    if (!blob) {\n        return nullptr;\n    }\n    unsigned int length;\n    const char* data = hb_blob_get_data(blob.get(), &length);\n    if (!data || !length) {\n        return nullptr;\n    }\n    return SkData::MakeWithProc(data, SkToSizeT(length),\n                                [](const void*, void* ctx) { hb_blob_destroy((hb_blob_t*)ctx); },\n                                blob.release());\n}\n\nstatic sk_sp<SkData> subset_harfbuzz(sk_sp<SkData> fontData,\n                                     const SkPDFGlyphUse& glyphUsage,\n                                     int ttcIndex) {\n#if defined(SK_USING_THIRD_PARTY_ICU)\n    if (!SkLoadICU()) {\n        return nullptr;\n    }\n#endif\n    if (!fontData) {\n        return nullptr;\n    }\n    HBFace face(hb_face_create(to_blob(std::move(fontData)).get(), ttcIndex));\n    SkASSERT(face);\n\n    HBSubsetInput input(hb_subset_input_create_or_fail());\n    SkASSERT(input);\n    if (!face || !input) {\n        return nullptr;\n    }\n    hb_set_t* glyphs = hb_subset_input_glyph_set(input.get());\n    glyphUsage.getSetValues([&glyphs](unsigned gid) { hb_set_add(glyphs, gid);});\n\n    hb_subset_input_set_retain_gids(input.get(), true);\n    \/\/ TODO: When possible, check if a font is 'tricky' with FT_IS_TRICKY.\n    \/\/ If it isn't known if a font is 'tricky', retain the hints.\n    hb_subset_input_set_drop_hints(input.get(), false);\n    HBFace subset(hb_subset(face.get(), input.get()));\n    HBBlob result(hb_face_reference_blob(subset.get()));\n    return to_data(std::move(result));\n}\n\n#endif  \/\/ defined(SK_PDF_USE_HARFBUZZ_SUBSET)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if defined(SK_PDF_USE_SFNTLY)\n\n#include \"sample\/chromium\/font_subsetter.h\"\n#include <vector>\n\nstatic sk_sp<SkData> subset_sfntly(sk_sp<SkData> fontData,\n                                   const SkPDFGlyphUse& glyphUsage,\n                                   const char* fontName,\n                                   int ttcIndex) {\n#if defined(SK_USING_THIRD_PARTY_ICU)\n    if (!SkLoadICU()) {\n        return nullptr;\n    }\n#endif\n    \/\/ Generate glyph id array in format needed by sfntly.\n    \/\/ TODO(halcanary): sfntly should take a more compact format.\n    std::vector<unsigned> subset;\n    glyphUsage.getSetValues([&subset](unsigned v) { subset.push_back(v); });\n\n    unsigned char* subsetFont{nullptr};\n#if defined(SK_BUILD_FOR_GOOGLE3)\n    \/\/ TODO(halcanary): update SK_BUILD_FOR_GOOGLE3 to newest version of Sfntly.\n    (void)ttcIndex;\n    int subsetFontSize = SfntlyWrapper::SubsetFont(fontName,\n                                                   fontData->bytes(),\n                                                   fontData->size(),\n                                                   subset.data(),\n                                                   subset.size(),\n                                                   &subsetFont);\n#else  \/\/ defined(SK_BUILD_FOR_GOOGLE3)\n    (void)fontName;\n    int subsetFontSize = SfntlyWrapper::SubsetFont(ttcIndex,\n                                                   fontData->bytes(),\n                                                   fontData->size(),\n                                                   subset.data(),\n                                                   subset.size(),\n                                                   &subsetFont);\n#endif  \/\/ defined(SK_BUILD_FOR_GOOGLE3)\n    SkASSERT(subsetFontSize > 0 || subsetFont == nullptr);\n    if (subsetFontSize < 1 || subsetFont == nullptr) {\n        return nullptr;\n    }\n    return SkData::MakeWithProc(subsetFont, subsetFontSize,\n                                [](const void* p, void*) { delete[] (unsigned char*)p; },\n                                nullptr);\n}\n\n#endif  \/\/ defined(SK_PDF_USE_SFNTLY)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if defined(SK_PDF_USE_SFNTLY) && defined(SK_PDF_USE_HARFBUZZ_SUBSET)\n\nsk_sp<SkData> SkPDFSubsetFont(sk_sp<SkData> fontData,\n                              const SkPDFGlyphUse& glyphUsage,\n                              SkPDF::Metadata::Subsetter subsetter,\n                              const char* fontName,\n                              int ttcIndex) {\n    switch (subsetter) {\n        case SkPDF::Metadata::kHarfbuzz_Subsetter:\n            return subset_harfbuzz(std::move(fontData), glyphUsage, ttcIndex);\n        case SkPDF::Metadata::kSfntly_Subsetter:\n            return subset_sfntly(std::move(fontData), glyphUsage, fontName, ttcIndex);\n    }\n    return nullptr;\n}\n\n#elif defined(SK_PDF_USE_SFNTLY)\n\nsk_sp<SkData> SkPDFSubsetFont(sk_sp<SkData> fontData,\n                              const SkPDFGlyphUse& glyphUsage,\n                              SkPDF::Metadata::Subsetter,\n                              const char* fontName,\n                              int ttcIndex) {\n    return subset_sfntly(std::move(fontData), glyphUsage, fontName, ttcIndex);\n}\n\n#elif defined(SK_PDF_USE_HARFBUZZ_SUBSET)\n\nsk_sp<SkData> SkPDFSubsetFont(sk_sp<SkData> fontData,\n                              const SkPDFGlyphUse& glyphUsage,\n                              SkPDF::Metadata::Subsetter,\n                              const char*,\n                              int ttcIndex) {\n    return subset_harfbuzz(std::move(fontData), glyphUsage, ttcIndex);\n}\n\n#else\n\nsk_sp<SkData> SkPDFSubsetFont(sk_sp<SkData>, const SkPDFGlyphUse&, SkPDF::Metadata::Subsetter,\n                              const char*, int) {\n    return nullptr;\n}\n#endif  \/\/ defined(SK_PDF_USE_SFNTLY)\n\n<|endoftext|>"}
{"text":"<commit_before>#ifdef WIN32\n#include <windows.h>\n#include <XGetopt.h>\n#else\n#include <unistd.h>\n#endif\n#include <stdint.h>\n#include <iostream>\n#include <vector>\n#include <regex>\n#include <codecvt>\n#include <Directory.h>\n#include <Counter.h>\n#include <File.h>\n\nint32_t main(int32_t argc, char *argv[ ])\n{\n    std::wstring regex = L\".*\\\\.(cc|cpp|h)\";\n    std::wstring dir = L\".\";\n    std::wstring textFileDir = L\"\";\n\n    int32_t c;\n\n    std::wstring_convert<std::codecvt_utf8_utf16<wchar_t>> converter;\n\n    while ((c = getopt(argc, argv, \"e:d:t:h\")) != EOF)\n        if(c == 'e')\n            regex = converter.from_bytes(optarg);\n        else if(c == 'd')\n            dir = converter.from_bytes(optarg);\n        else if(c == 't')\n            textFileDir = converter.from_bytes(optarg);\n        else if(c == '?' || c == 'h'){\n            std::cout << \"usage: countLines [-e regexp] [-d directory] [-t text]\" << std::endl;\n            std::cout << \" -e: file regular expression pattern\" << std::endl;\n            std::cout << \" -d: root processing directory\" << std::endl;\n            std::cout << \" -t: text file dir. This text will be placed at the beginning of each\" << std::endl;\n            std::cout << \"     file that matches regular expression\" << std::endl;\n        }\n\n    Counter::Counter counter;\n\n    try{\n\n        std::string text;\n\n        if(textFileDir != L\"\"){\n            File::Data data = File::Read(textFileDir);\n            std::for_each(data.begin(), data.end(), [&text](File::Data::value_type Value){text += Value;});\n        }\n\n        counter.Init(regex, dir, text);\n        counter.Process();\n\n    }catch(const std::regex_error &err){\n        std::cout << \"regex syntax error \" << err.what();\n        return 1;\n    }catch(const Exception &err){\n        std::wcout << L\"processing error \" << err.What();\n        return 1;\n    }\n\n    std::cout << \"lines count \" << counter.GetLinesCount() << std::endl;\n    return 0;\n}<commit_msg>close #2<commit_after>#ifdef WIN32\n#include <windows.h>\n#include <XGetopt.h>\n#else\n#include <unistd.h>\n#endif\n#include <stdint.h>\n#include <iostream>\n#include <vector>\n#include <regex>\n#include <codecvt>\n#include <Directory.h>\n#include <Counter.h>\n#include <File.h>\n\nstatic void PrintUsage()\n{\n    std::cout << \"usage: countLines [-e regexp] [-d directory] [-t text]\" << std::endl;\n    std::cout << \" -e: file regular expression pattern\" << std::endl;\n    std::cout << \" -d: root processing directory\" << std::endl;\n    std::cout << \" -t: text file dir. This text will be placed at the beginning of each\" << std::endl;\n    std::cout << \"     file that matches regular expression\" << std::endl;\n\n    exit(0);\n}\n\nint32_t main(int32_t argc, char *argv[ ])\n{\n    std::wstring regex = L\".*\\\\.(cc|cpp|h)\";\n    std::wstring dir = L\".\";\n    std::wstring textFileDir = L\"\";\n\n    int32_t c;\n\n    std::wstring_convert<std::codecvt_utf8_utf16<wchar_t>> converter;\n\n    while ((c = getopt(argc, argv, \"e:d:t:h\")) != EOF)\n        if(c == 'e')\n            regex = converter.from_bytes(optarg);\n        else if(c == 'd')\n            dir = converter.from_bytes(optarg);\n        else if(c == 't')\n            textFileDir = converter.from_bytes(optarg);\n        else if(c == '?' || c == 'h')\n            PrintUsage();\n        else {\n            std::cout << \"invalid option \" << c << std::endl;\n            PrintUsage();    \n        }\n\n    Counter::Counter counter;\n\n    try{\n\n        std::string text;\n\n        if(textFileDir != L\"\"){\n            File::Data data = File::Read(textFileDir);\n            std::for_each(data.begin(), data.end(), [&text](File::Data::value_type Value){text += Value;});\n        }\n\n        counter.Init(regex, dir, text);\n        counter.Process();\n\n    }catch(const std::regex_error &err){\n        std::cout << \"regex syntax error \" << err.what();\n        return 1;\n    }catch(const Exception &err){\n        std::wcout << L\"processing error \" << err.What();\n        return 1;\n    }\n\n    std::cout << \"lines count \" << counter.GetLinesCount() << std::endl;\n    return 0;\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\/shell\/renderer\/test_runner\/MockSpellCheck.h\"\n\n#include \"content\/shell\/renderer\/test_runner\/TestCommon.h\"\n#include \"third_party\/WebKit\/public\/platform\/WebCString.h\"\n\nusing namespace blink;\nusing namespace std;\n\nnamespace WebTestRunner {\n\nnamespace {\n\nvoid append(WebVector<WebString>* data, const WebString& item)\n{\n    WebVector<WebString> result(data->size() + 1);\n    for (size_t i = 0; i < data->size(); ++i)\n        result[i] = (*data)[i];\n    result[data->size()] = item;\n    data->swap(result);\n}\n\n}\n\nMockSpellCheck::MockSpellCheck()\n    : m_initialized(false) { }\n\nMockSpellCheck::~MockSpellCheck() { }\n\nbool MockSpellCheck::spellCheckWord(const WebString& text, int* misspelledOffset, int* misspelledLength)\n{\n    BLINK_ASSERT(misspelledOffset);\n    BLINK_ASSERT(misspelledLength);\n\n    \/\/ Initialize this spellchecker.\n    initializeIfNeeded();\n\n    \/\/ Reset the result values as our spellchecker does.\n    *misspelledOffset = 0;\n    *misspelledLength = 0;\n\n    \/\/ Convert to a base::string16 because we store base::string16 instances in\n    \/\/ m_misspelledWords and WebString has no find().\n    base::string16 stringText = text;\n    int skippedLength = 0;\n\n    while (!stringText.empty()) {\n        \/\/ Extract the first possible English word from the given string.\n        \/\/ The given string may include non-ASCII characters or numbers. So, we\n        \/\/ should filter out such characters before start looking up our\n        \/\/ misspelled-word table.\n        \/\/ (This is a simple version of our SpellCheckWordIterator class.)\n        \/\/ If the given string doesn't include any ASCII characters, we can treat the\n        \/\/ string as valid one.\n        base::string16::iterator firstChar = find_if(stringText.begin(), stringText.end(), isASCIIAlpha);\n        if (firstChar == stringText.end())\n            return true;\n        int wordOffset = distance(stringText.begin(), firstChar);\n        int maxWordLength = static_cast<int>(stringText.length()) - wordOffset;\n        int wordLength;\n        base::string16 word;\n\n        \/\/ Look up our misspelled-word table to check if the extracted word is a\n        \/\/ known misspelled word, and return the offset and the length of the\n        \/\/ extracted word if this word is a known misspelled word.\n        \/\/ (See the comment in MockSpellCheck::initializeIfNeeded() why we use a\n        \/\/ misspelled-word table.)\n        for (size_t i = 0; i < m_misspelledWords.size(); ++i) {\n            wordLength = static_cast<int>(m_misspelledWords.at(i).length()) > maxWordLength ? maxWordLength : static_cast<int>(m_misspelledWords.at(i).length());\n            word = stringText.substr(wordOffset, wordLength);\n            if (word == m_misspelledWords.at(i) && (static_cast<int>(stringText.length()) == wordOffset + wordLength || isNotASCIIAlpha(stringText[wordOffset + wordLength]))) {\n                *misspelledOffset = wordOffset + skippedLength;\n                *misspelledLength = wordLength;\n                break;\n            }\n        }\n\n        if (*misspelledLength > 0)\n            break;\n\n        base::string16::iterator lastChar = find_if(stringText.begin() + wordOffset, stringText.end(), isNotASCIIAlpha);\n        if (lastChar == stringText.end())\n            wordLength = static_cast<int>(stringText.length()) - wordOffset;\n        else\n            wordLength = distance(firstChar, lastChar);\n\n        BLINK_ASSERT(0 < wordOffset + wordLength);\n        stringText = stringText.substr(wordOffset + wordLength);\n        skippedLength += wordOffset + wordLength;\n    }\n\n    return false;\n}\n\nbool MockSpellCheck::hasInCache(const WebString& word)\n{\n    return word == WebString::fromUTF8(\"Spell wellcome. Is it broken?\") || word == WebString::fromUTF8(\"Spell wellcome.\\x007F\");\n}\n\nbool MockSpellCheck::isMultiWordMisspelling(const WebString& text, vector<WebTextCheckingResult>* results)\n{\n    if (text == WebString::fromUTF8(\"Helllo wordl.\")) {\n        results->push_back(WebTextCheckingResult(WebTextDecorationTypeSpelling, 0, 6, WebString(\"Hello\")));\n        results->push_back(WebTextCheckingResult(WebTextDecorationTypeSpelling, 7, 5, WebString(\"world\")));\n        return true;\n    }\n    return false;\n}\n\nvoid MockSpellCheck::fillSuggestionList(const WebString& word, WebVector<WebString>* suggestions)\n{\n    if (word == WebString::fromUTF8(\"wellcome\"))\n        append(suggestions, WebString::fromUTF8(\"welcome\"));\n    else if (word == WebString::fromUTF8(\"upper case\"))\n        append(suggestions, WebString::fromUTF8(\"uppercase\"));\n    else if (word == WebString::fromUTF8(\"Helllo\"))\n        append(suggestions, WebString::fromUTF8(\"Hello\"));\n    else if (word == WebString::fromUTF8(\"wordl\"))\n        append(suggestions, WebString::fromUTF8(\"world\"));\n}\n\nbool MockSpellCheck::initializeIfNeeded()\n{\n    \/\/ Exit if we have already initialized this object.\n    if (m_initialized)\n        return false;\n\n    \/\/ Create a table that consists of misspelled words used in WebKit layout\n    \/\/ tests.\n    \/\/ Since WebKit layout tests don't have so many misspelled words as\n    \/\/ well-spelled words, it is easier to compare the given word with misspelled\n    \/\/ ones than to compare with well-spelled ones.\n    static const char* misspelledWords[] = {\n        \/\/ These words are known misspelled words in webkit tests.\n        \/\/ If there are other misspelled words in webkit tests, please add them in\n        \/\/ this array.\n        \"foo\",\n        \"Foo\",\n        \"baz\",\n        \"fo\",\n        \"LibertyF\",\n        \"chello\",\n        \"xxxtestxxx\",\n        \"XXxxx\",\n        \"Textx\",\n        \"blockquoted\",\n        \"asd\",\n        \"Lorem\",\n        \"Nunc\",\n        \"Curabitur\",\n        \"eu\",\n        \"adlj\",\n        \"adaasj\",\n        \"sdklj\",\n        \"jlkds\",\n        \"jsaada\",\n        \"jlda\",\n        \"zz\",\n        \"contentEditable\",\n        \/\/ The following words are used by unit tests.\n        \"ifmmp\",\n        \"qwertyuiopasd\",\n        \"qwertyuiopasdf\",\n        \"upper case\",\n        \"wellcome\"\n    };\n\n    m_misspelledWords.clear();\n    for (size_t i = 0; i < arraysize(misspelledWords); ++i)\n        m_misspelledWords.push_back(base::string16(misspelledWords[i], misspelledWords[i] + strlen(misspelledWords[i])));\n\n    \/\/ Mark as initialized to prevent this object from being initialized twice\n    \/\/ or more.\n    m_initialized = true;\n\n    \/\/ Since this MockSpellCheck class doesn't download dictionaries, this\n    \/\/ function always returns false.\n    return false;\n}\n\n}\n<commit_msg>Fix typo in MockSpellCheck::misspelledWords<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\/shell\/renderer\/test_runner\/MockSpellCheck.h\"\n\n#include \"content\/shell\/renderer\/test_runner\/TestCommon.h\"\n#include \"third_party\/WebKit\/public\/platform\/WebCString.h\"\n\nusing namespace blink;\nusing namespace std;\n\nnamespace WebTestRunner {\n\nnamespace {\n\nvoid append(WebVector<WebString>* data, const WebString& item)\n{\n    WebVector<WebString> result(data->size() + 1);\n    for (size_t i = 0; i < data->size(); ++i)\n        result[i] = (*data)[i];\n    result[data->size()] = item;\n    data->swap(result);\n}\n\n}\n\nMockSpellCheck::MockSpellCheck()\n    : m_initialized(false) { }\n\nMockSpellCheck::~MockSpellCheck() { }\n\nbool MockSpellCheck::spellCheckWord(const WebString& text, int* misspelledOffset, int* misspelledLength)\n{\n    BLINK_ASSERT(misspelledOffset);\n    BLINK_ASSERT(misspelledLength);\n\n    \/\/ Initialize this spellchecker.\n    initializeIfNeeded();\n\n    \/\/ Reset the result values as our spellchecker does.\n    *misspelledOffset = 0;\n    *misspelledLength = 0;\n\n    \/\/ Convert to a base::string16 because we store base::string16 instances in\n    \/\/ m_misspelledWords and WebString has no find().\n    base::string16 stringText = text;\n    int skippedLength = 0;\n\n    while (!stringText.empty()) {\n        \/\/ Extract the first possible English word from the given string.\n        \/\/ The given string may include non-ASCII characters or numbers. So, we\n        \/\/ should filter out such characters before start looking up our\n        \/\/ misspelled-word table.\n        \/\/ (This is a simple version of our SpellCheckWordIterator class.)\n        \/\/ If the given string doesn't include any ASCII characters, we can treat the\n        \/\/ string as valid one.\n        base::string16::iterator firstChar = find_if(stringText.begin(), stringText.end(), isASCIIAlpha);\n        if (firstChar == stringText.end())\n            return true;\n        int wordOffset = distance(stringText.begin(), firstChar);\n        int maxWordLength = static_cast<int>(stringText.length()) - wordOffset;\n        int wordLength;\n        base::string16 word;\n\n        \/\/ Look up our misspelled-word table to check if the extracted word is a\n        \/\/ known misspelled word, and return the offset and the length of the\n        \/\/ extracted word if this word is a known misspelled word.\n        \/\/ (See the comment in MockSpellCheck::initializeIfNeeded() why we use a\n        \/\/ misspelled-word table.)\n        for (size_t i = 0; i < m_misspelledWords.size(); ++i) {\n            wordLength = static_cast<int>(m_misspelledWords.at(i).length()) > maxWordLength ? maxWordLength : static_cast<int>(m_misspelledWords.at(i).length());\n            word = stringText.substr(wordOffset, wordLength);\n            if (word == m_misspelledWords.at(i) && (static_cast<int>(stringText.length()) == wordOffset + wordLength || isNotASCIIAlpha(stringText[wordOffset + wordLength]))) {\n                *misspelledOffset = wordOffset + skippedLength;\n                *misspelledLength = wordLength;\n                break;\n            }\n        }\n\n        if (*misspelledLength > 0)\n            break;\n\n        base::string16::iterator lastChar = find_if(stringText.begin() + wordOffset, stringText.end(), isNotASCIIAlpha);\n        if (lastChar == stringText.end())\n            wordLength = static_cast<int>(stringText.length()) - wordOffset;\n        else\n            wordLength = distance(firstChar, lastChar);\n\n        BLINK_ASSERT(0 < wordOffset + wordLength);\n        stringText = stringText.substr(wordOffset + wordLength);\n        skippedLength += wordOffset + wordLength;\n    }\n\n    return false;\n}\n\nbool MockSpellCheck::hasInCache(const WebString& word)\n{\n    return word == WebString::fromUTF8(\"Spell wellcome. Is it broken?\") || word == WebString::fromUTF8(\"Spell wellcome.\\x007F\");\n}\n\nbool MockSpellCheck::isMultiWordMisspelling(const WebString& text, vector<WebTextCheckingResult>* results)\n{\n    if (text == WebString::fromUTF8(\"Helllo wordl.\")) {\n        results->push_back(WebTextCheckingResult(WebTextDecorationTypeSpelling, 0, 6, WebString(\"Hello\")));\n        results->push_back(WebTextCheckingResult(WebTextDecorationTypeSpelling, 7, 5, WebString(\"world\")));\n        return true;\n    }\n    return false;\n}\n\nvoid MockSpellCheck::fillSuggestionList(const WebString& word, WebVector<WebString>* suggestions)\n{\n    if (word == WebString::fromUTF8(\"wellcome\"))\n        append(suggestions, WebString::fromUTF8(\"welcome\"));\n    else if (word == WebString::fromUTF8(\"upper case\"))\n        append(suggestions, WebString::fromUTF8(\"uppercase\"));\n    else if (word == WebString::fromUTF8(\"Helllo\"))\n        append(suggestions, WebString::fromUTF8(\"Hello\"));\n    else if (word == WebString::fromUTF8(\"wordl\"))\n        append(suggestions, WebString::fromUTF8(\"world\"));\n}\n\nbool MockSpellCheck::initializeIfNeeded()\n{\n    \/\/ Exit if we have already initialized this object.\n    if (m_initialized)\n        return false;\n\n    \/\/ Create a table that consists of misspelled words used in WebKit layout\n    \/\/ tests.\n    \/\/ Since WebKit layout tests don't have so many misspelled words as\n    \/\/ well-spelled words, it is easier to compare the given word with misspelled\n    \/\/ ones than to compare with well-spelled ones.\n    static const char* misspelledWords[] = {\n        \/\/ These words are known misspelled words in webkit tests.\n        \/\/ If there are other misspelled words in webkit tests, please add them in\n        \/\/ this array.\n        \"foo\",\n        \"Foo\",\n        \"baz\",\n        \"fo\",\n        \"LibertyF\",\n        \"chello\",\n        \"xxxtestxxx\",\n        \"XXxxx\",\n        \"Textx\",\n        \"blockquoted\",\n        \"asdf\",\n        \"Lorem\",\n        \"Nunc\",\n        \"Curabitur\",\n        \"eu\",\n        \"adlj\",\n        \"adaasj\",\n        \"sdklj\",\n        \"jlkds\",\n        \"jsaada\",\n        \"jlda\",\n        \"zz\",\n        \"contentEditable\",\n        \/\/ The following words are used by unit tests.\n        \"ifmmp\",\n        \"qwertyuiopasd\",\n        \"qwertyuiopasdf\",\n        \"upper case\",\n        \"wellcome\"\n    };\n\n    m_misspelledWords.clear();\n    for (size_t i = 0; i < arraysize(misspelledWords); ++i)\n        m_misspelledWords.push_back(base::string16(misspelledWords[i], misspelledWords[i] + strlen(misspelledWords[i])));\n\n    \/\/ Mark as initialized to prevent this object from being initialized twice\n    \/\/ or more.\n    m_initialized = true;\n\n    \/\/ Since this MockSpellCheck class doesn't download dictionaries, this\n    \/\/ function always returns false.\n    return false;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Plugging custom error codes into std::error_code etc. machinery example\n\n#include \"custom_error_code_bits\/the_game.h\"\n#include <iostream>\n#include <string>\n\nvoid log_bad_status_codes( std::error_code ec )\n{\n  if ( ec )\n  {\n    std::clog << ec << \" \" << ec.message() << \"\\n\";\n  }\n}\n\nint main()\n{\n  auto & engine{ the_game::get_appengine() };\n\n  \/\/ Should fail as setting renderer supporting invalid dimension range\n  std::unique_ptr<the_game::renderer> rend{new the_game::oops_renderer};\n  log_bad_status_codes( engine.take_renderer( std::move(rend) ) );\n\n  \/\/ Should fail as no renderer successfully set to draw board\n  log_bad_status_codes( engine.update_game_board() );\n\n  \/\/ OK - nothing to report, this renderer is fine and dandy\n  rend.reset( new the_game::fine_renderer );\n  log_bad_status_codes( engine.take_renderer(std::move(rend)) );\n\n  \/\/ OK - now have renderer to render board updates\n  log_bad_status_codes( engine.update_game_board() );\n}\n<commit_msg>Whitspace change<commit_after>\/\/ Plugging custom error codes into std::error_code etc. machinery example\n\n#include \"custom_error_code_bits\/the_game.h\"\n#include <system_error>\n#include <iostream>\n#include <string>\n\nvoid log_bad_status_codes( std::error_code ec )\n{\n  if ( ec )\n  {\n    std::clog << ec << \" \" << ec.message() << \"\\n\";\n  }\n}\n\nint main()\n{\n  auto & engine{ the_game::get_appengine() };\n\n  \/\/ Should fail as setting renderer supporting invalid dimension range\n  std::unique_ptr<the_game::renderer> rend{new the_game::oops_renderer};\n  log_bad_status_codes( engine.take_renderer( std::move(rend) ) );\n\n  \/\/ Should fail as no renderer successfully set to draw board\n  log_bad_status_codes( engine.update_game_board() );\n\n  \/\/ OK - nothing to report, this renderer is fine and dandy\n  rend.reset( new the_game::fine_renderer );\n  log_bad_status_codes( engine.take_renderer( std::move(rend)) );\n\n  \/\/ OK - now have renderer to render board updates\n  log_bad_status_codes( engine.update_game_board() );\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Add a defined(OS_LINUX) guard for the include of tcmalloc's profiler.h<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>fix core from a federated query and null msg20<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n *\n * @brief\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\/\n\n#include \"ccode.hpp\"\n\n\n#include <kdb.hpp>\n#include <kdblogger.h>\n\nusing namespace ckdb;\nusing CppKey = kdb::Key;\nusing CppKeySet = kdb::KeySet;\n\nnamespace\n{\n\n\/**\n * @brief Cast a character to an unsigned character.\n *\n * @param character This parameter specifies the character this function casts to an unsigned value.\n *\n * @return A unsigned character corresponding to the given argument\n *\/\ninline constexpr unsigned char operator\"\" _uc (char character) noexcept\n{\n\treturn static_cast<unsigned char> (character);\n}\n\n\/**\n * @brief This function maps hex characters to integer numbers.\n *\n * @pre The specified character has to be between\n *\n *      - `'0'`–`'9'`,\n *      - `'a'`-`'f'`, or\n *      - `'A'`-`'F'`\n *\n *     .\n *\n * @param character This argument specifies the (hexadecimal) character this function converts.\n *\n * @return An integer number between `0` and `15` if the precondition is valid or `0` otherwise\n *\/\ninline int elektraHexcodeConvFromHex (char character)\n{\n\tif (character >= '0' && character <= '9') return character - '0';\n\tif (character >= 'a' && character <= 'f') return character - 'a' + 10;\n\tif (character >= 'A' && character <= 'F') return character - 'A' + 10;\n\n\treturn 0; \/* Unknown escape char *\/\n}\n\n\/**\n * @brief This function returns a key set containing the contract of this plugin.\n *\n * @return A contract describing the functionality of this plugin.\n *\/\ninline KeySet * contract (void)\n{\n\treturn ksNew (30, keyNew (\"system\/elektra\/modules\/ccode\", KEY_VALUE, \"ccode plugin waits for your orders\", KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\", KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\/open\", KEY_FUNC, elektraCcodeOpen, KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\/close\", KEY_FUNC, elektraCcodeClose, KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\/get\", KEY_FUNC, elektraCcodeGet, KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\/set\", KEY_FUNC, elektraCcodeSet, KEY_END),\n#include \"readme_ccode.c\"\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/infos\/version\", KEY_VALUE, PLUGINVERSION, KEY_END), KS_END);\n}\n\n\/**\n * @brief Retrieve the mapping data and initialize the buffer if it is empty.\n *\n * @return The mapping data stored by this plugin.\n *\/\nCCodeData * retrieveMapping (Plugin * handle)\n{\n\tCCodeData * const mapping = static_cast<CCodeData *> (elektraPluginGetData (handle));\n\tif (!mapping->buffer)\n\t{\n\t\tmapping->bufferSize = 1000;\n\t\tmapping->buffer = new unsigned char[mapping->bufferSize];\n\t}\n\treturn mapping;\n}\n\n\/**\n * @brief This function sets default values for the encoding and decoding character mapping.\n *\n * @param mapping This parameter stores the encoding and decoding table this function fills with default values.\n *\/\nvoid setDefaultConfig (CCodeData * const mapping)\n{\n\tunsigned char pairs[][2] = { { '\\b'_uc, 'b'_uc }, { '\\t'_uc, 't'_uc }, { '\\n'_uc, 'n'_uc },  { '\\v'_uc, 'v'_uc },\n\t\t\t\t     { '\\f'_uc, 'f'_uc }, { '\\r'_uc, 'r'_uc }, { '\\\\'_uc, '\\\\'_uc }, { '\\''_uc, '\\''_uc },\n\t\t\t\t     { '\\\"'_uc, '\"'_uc }, { '\\0'_uc, '0'_uc } };\n\n\tfor (size_t pair = 0; pair < sizeof (pairs) \/ sizeof (pairs[0]); pair++)\n\t{\n\t\tunsigned char character = pairs[pair][0];\n\t\tunsigned char replacement = pairs[pair][1];\n\n\t\tmapping->encode[character] = replacement;\n\t\tmapping->decode[replacement] = character;\n\t}\n}\n\n\/**\n * @brief This function sets values for the encoding and decoding character mapping.\n *\n * @param mapping This parameter stores the encoding and decoding table this function fills with the values specified in `config`.\n * @param config This key set stores the character mappings this function stores inside `mappings`.\n * @param root This key stores the root key for the character mapping stored in `config`.\n *\/\nvoid readConfig (CCodeData * const mapping, KeySet * const config, Key const * const root)\n{\n\tKey const * key = 0;\n\twhile ((key = ksNext (config)) != 0)\n\t{\n\t\t\/* Ignore keys that are not directly below the config root key or have an incorrect size *\/\n\t\tif (keyRel (root, key) != 1 || keyGetBaseNameSize (key) != 3 || keyGetValueSize (key) != 3) continue;\n\n\t\tint character = elektraHexcodeConvFromHex (keyBaseName (key)[1]);\n\t\tcharacter += elektraHexcodeConvFromHex (keyBaseName (key)[0]) * 16;\n\n\t\tint replacement = elektraHexcodeConvFromHex (keyString (key)[1]);\n\t\treplacement += elektraHexcodeConvFromHex (keyString (key)[0]) * 16;\n\n\t\t\/* Hexencode this character! *\/\n\t\tmapping->encode[character & 255] = replacement;\n\t\tmapping->decode[replacement & 255] = character;\n\t}\n}\n\n\/**\n * @brief This function replaces escaped characters in a string with unescaped characters.\n *\n * The function stores the unescaped result in `mapping->buffer`.\n *\n * @pre The variable `mapping->buffer` needs to be as large as `size`.\n *\n * @param value This string stores the string this function decodes.\n * @param size This number specifies the size of `value` including the trailing `'\\0'` character.\n * @param mapping This variable stores the buffer and the character mapping this function uses to decode `value`.\n *\n * @return The size of the decoded string including the trailing `'\\0'` character\n *\/\nsize_t decode (char const * const value, size_t const size, CCodeData * mapping)\n{\n\tsize_t out = 0;\n\tfor (size_t in = 0; in < size - 1; ++in)\n\t{\n\t\tunsigned char character = value[in];\n\n\t\tif (character == mapping->escape)\n\t\t{\n\t\t\t++in; \/* Advance twice *\/\n\t\t\tcharacter = value[in];\n\n\t\t\tmapping->buffer[out] = mapping->decode[character & 255];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmapping->buffer[out] = character;\n\t\t}\n\t\t++out; \/* Only one char is written *\/\n\t}\n\n\tmapping->buffer[out] = 0; \/\/ null termination for keyString()\n\treturn out + 1;\n}\n\n\/**\n * @brief This function replaces unescaped characters in a string with escaped characters.\n *\n * The function stores the escaped result value in `mapping->buffer`.\n *\n * @pre The variable `mapping->buffer` needs to be twice as large as size.\n *\n * @param value This variable stores the string this function escapes.\n * @param size This number specifies the size of `value` including the trailing `'\\0'` character.\n * @param mapping This variable stores the buffer and the character mapping this function uses to encode `value`.\n *\n * @return The size of the encoded string including the trailing `'\\0'` character\n *\/\nsize_t encode (char const * const value, size_t const size, CCodeData * mapping)\n{\n\tsize_t out = 0;\n\tfor (size_t in = 0; in < size - 1; ++in)\n\t{\n\t\tunsigned char character = value[in];\n\n\t\tif (mapping->encode[character])\n\t\t{\n\t\t\tmapping->buffer[out + 1] = mapping->encode[character];\n\t\t\t\/\/ Escape char\n\t\t\tmapping->buffer[out] = mapping->escape;\n\t\t\tout += 2;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ just copy one character\n\t\t\tmapping->buffer[out] = value[in];\n\t\t\t\/\/ advance out cursor\n\t\t\tout++;\n\t\t}\n\t}\n\n\tmapping->buffer[out] = 0; \/\/ null termination for keyString()\n\treturn out + 1;\n}\n\n} \/\/ end namespace\n\nextern \"C\" {\n\n\/**\n * @brief This function replaces escaped character in a key value with unescaped characters.\n *\n * The function stores the unescaped result value both in `mapping->buffer` and the given key.\n *\n * @pre The variable `mapping->buffer` needs to be as large as the key value’s size.\n *\n * @param key This key holds the value this function decodes.\n * @param mapping This variable stores the buffer and the character mapping this function uses to decode the value of the given key.\n *\/\nvoid elektraCcodeDecode (Key * key, CCodeData * mapping)\n{\n\tconst char * value = static_cast<const char *> (keyValue (key));\n\tif (!value) return;\n\n\tkeySetRaw (key, mapping->buffer, decode (value, keyGetValueSize (key), mapping));\n}\n\n\/**\n * @brief This function replaces unescaped character in a key value with escaped characters.\n *\n * The function stores the escaped result value both in `mapping->buffer` and the given key.\n *\n * @pre The variable `mapping->buffer` needs to be twice as large as the key value’s size.\n *\n * @param key This key stores the value this function escapes.\n * @param mapping This variable stores the buffer and the character mapping this function uses to encode the value of the given key.\n *\/\nvoid elektraCcodeEncode (Key * key, CCodeData * mapping)\n{\n\tconst char * value = static_cast<const char *> (keyValue (key));\n\tif (!value) return;\n\n\tkeySetRaw (key, mapping->buffer, encode (value, keyGetValueSize (key), mapping));\n}\n\n\/\/ ====================\n\/\/ = Plugin Interface =\n\/\/ ====================\n\n\/** @see elektraDocOpen *\/\nint elektraCcodeOpen (Plugin * handle, Key * key ELEKTRA_UNUSED)\n{\n\tCCodeData * const mapping = new CCodeData ();\n\n\t\/* Store for later use...*\/\n\telektraPluginSetData (handle, mapping);\n\n\tKeySet * const config = elektraPluginGetConfig (handle);\n\n\tKey const * const escape = ksLookupByName (config, \"\/escape\", 0);\n\tmapping->escape = '\\\\';\n\tif (escape && keyGetBaseNameSize (escape) && keyGetValueSize (escape) == 3)\n\t{\n\t\tint escapeChar = elektraHexcodeConvFromHex (keyString (escape)[1]);\n\t\tescapeChar += elektraHexcodeConvFromHex (keyString (escape)[0]) * 16;\n\n\t\tmapping->escape = escapeChar & 255;\n\t}\n\tELEKTRA_LOG_DEBUG (\"Use “%c” as escape character\", mapping->escape);\n\n\tKey const * const root = ksLookupByName (config, \"\/chars\", 0);\n\n\tif (root)\n\t{\n\t\treadConfig (mapping, config, root);\n\t}\n\telse\n\t{\n\t\tsetDefaultConfig (mapping);\n\t}\n\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocClose *\/\nint elektraCcodeClose (Plugin * handle, Key * key ELEKTRA_UNUSED)\n{\n\tCCodeData * const mapping = static_cast<CCodeData *> (elektraPluginGetData (handle));\n\n\tdelete[](mapping->buffer);\n\tdelete (mapping);\n\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocGet *\/\nint elektraCcodeGet (Plugin * handle, KeySet * returned, Key * parentKey)\n{\n\tif (!strcmp (keyName (parentKey), \"system\/elektra\/modules\/ccode\"))\n\t{\n\t\tKeySet * const pluginConfig = contract ();\n\t\tksAppend (returned, pluginConfig);\n\t\tksDel (pluginConfig);\n\t\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n\t}\n\n\tCCodeData * const mapping = retrieveMapping (handle);\n\n\tKey * key;\n\tksRewind (returned);\n\twhile ((key = ksNext (returned)) != 0)\n\t{\n\t\tsize_t const size = keyGetValueSize (key);\n\t\tif (size > mapping->bufferSize)\n\t\t{\n\t\t\tmapping->bufferSize = size;\n\t\t\tmapping->buffer = new unsigned char[mapping->bufferSize];\n\t\t}\n\n\t\telektraCcodeDecode (key, mapping);\n\t}\n\n\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n}\n\n\/** @see elektraDocSet *\/\nint elektraCcodeSet (Plugin * handle, KeySet * returned, Key * parentKey ELEKTRA_UNUSED)\n{\n\tCCodeData * const mapping = retrieveMapping (handle);\n\n\tCppKeySet keys{ returned };\n\tfor (auto key : keys)\n\t{\n\t\tsize_t const size = key.getBinarySize () * 2;\n\t\tif (size > mapping->bufferSize)\n\t\t{\n\t\t\tmapping->bufferSize = size;\n\t\t\tmapping->buffer = new unsigned char[mapping->bufferSize];\n\t\t}\n\n\t\telektraCcodeEncode (*key, mapping);\n\t}\n\n\tkeys.release ();\n\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n}\n\nPlugin * ELEKTRA_PLUGIN_EXPORT (ccode)\n{\n\t\/\/ clang-format off\n\treturn elektraPluginExport(\"ccode\",\n\t\tELEKTRA_PLUGIN_OPEN,\t&elektraCcodeOpen,\n\t\tELEKTRA_PLUGIN_CLOSE,\t&elektraCcodeClose,\n\t\tELEKTRA_PLUGIN_GET,\t&elektraCcodeGet,\n\t\tELEKTRA_PLUGIN_SET,\t&elektraCcodeSet,\n\t\tELEKTRA_PLUGIN_END);\n}\n\n} \/\/ end extern \"C\"\n<commit_msg>CCode: Fix minor spelling mistakes in comments<commit_after>\/**\n * @file\n *\n * @brief\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\/\n\n#include \"ccode.hpp\"\n\n\n#include <kdb.hpp>\n#include <kdblogger.h>\n\nusing namespace ckdb;\nusing CppKey = kdb::Key;\nusing CppKeySet = kdb::KeySet;\n\nnamespace\n{\n\n\/**\n * @brief Cast a character to an unsigned character.\n *\n * @param character This parameter specifies the character this function casts to an unsigned value.\n *\n * @return A unsigned character corresponding to the given argument\n *\/\ninline constexpr unsigned char operator\"\" _uc (char character) noexcept\n{\n\treturn static_cast<unsigned char> (character);\n}\n\n\/**\n * @brief This function maps hex characters to integer numbers.\n *\n * @pre The specified character has to be between\n *\n *      - `'0'`–`'9'`,\n *      - `'a'`-`'f'`, or\n *      - `'A'`-`'F'`\n *\n *     .\n *\n * @param character This argument specifies the (hexadecimal) character this function converts.\n *\n * @return An integer number between `0` and `15` if the precondition is valid or `0` otherwise\n *\/\ninline int elektraHexcodeConvFromHex (char character)\n{\n\tif (character >= '0' && character <= '9') return character - '0';\n\tif (character >= 'a' && character <= 'f') return character - 'a' + 10;\n\tif (character >= 'A' && character <= 'F') return character - 'A' + 10;\n\n\treturn 0; \/* Unknown escape char *\/\n}\n\n\/**\n * @brief This function returns a key set containing the contract of this plugin.\n *\n * @return A contract describing the functionality of this plugin.\n *\/\ninline KeySet * contract (void)\n{\n\treturn ksNew (30, keyNew (\"system\/elektra\/modules\/ccode\", KEY_VALUE, \"ccode plugin waits for your orders\", KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\", KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\/open\", KEY_FUNC, elektraCcodeOpen, KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\/close\", KEY_FUNC, elektraCcodeClose, KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\/get\", KEY_FUNC, elektraCcodeGet, KEY_END),\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/exports\/set\", KEY_FUNC, elektraCcodeSet, KEY_END),\n#include \"readme_ccode.c\"\n\t\t      keyNew (\"system\/elektra\/modules\/ccode\/infos\/version\", KEY_VALUE, PLUGINVERSION, KEY_END), KS_END);\n}\n\n\/**\n * @brief Retrieve the mapping data and initialize the buffer if it is empty.\n *\n * @return The mapping data stored by this plugin.\n *\/\nCCodeData * retrieveMapping (Plugin * handle)\n{\n\tCCodeData * const mapping = static_cast<CCodeData *> (elektraPluginGetData (handle));\n\tif (!mapping->buffer)\n\t{\n\t\tmapping->bufferSize = 1000;\n\t\tmapping->buffer = new unsigned char[mapping->bufferSize];\n\t}\n\treturn mapping;\n}\n\n\/**\n * @brief This function sets default values for the encoding and decoding character mapping.\n *\n * @param mapping This parameter stores the encoding and decoding table this function fills with default values.\n *\/\nvoid setDefaultConfig (CCodeData * const mapping)\n{\n\tunsigned char pairs[][2] = { { '\\b'_uc, 'b'_uc }, { '\\t'_uc, 't'_uc }, { '\\n'_uc, 'n'_uc },  { '\\v'_uc, 'v'_uc },\n\t\t\t\t     { '\\f'_uc, 'f'_uc }, { '\\r'_uc, 'r'_uc }, { '\\\\'_uc, '\\\\'_uc }, { '\\''_uc, '\\''_uc },\n\t\t\t\t     { '\\\"'_uc, '\"'_uc }, { '\\0'_uc, '0'_uc } };\n\n\tfor (size_t pair = 0; pair < sizeof (pairs) \/ sizeof (pairs[0]); pair++)\n\t{\n\t\tunsigned char character = pairs[pair][0];\n\t\tunsigned char replacement = pairs[pair][1];\n\n\t\tmapping->encode[character] = replacement;\n\t\tmapping->decode[replacement] = character;\n\t}\n}\n\n\/**\n * @brief This function sets values for the encoding and decoding character mapping.\n *\n * @param mapping This parameter stores the encoding and decoding table this function fills with the values specified in `config`.\n * @param config This key set stores the character mappings this function stores inside `mappings`.\n * @param root This key stores the root key for the character mapping stored in `config`.\n *\/\nvoid readConfig (CCodeData * const mapping, KeySet * const config, Key const * const root)\n{\n\tKey const * key = 0;\n\twhile ((key = ksNext (config)) != 0)\n\t{\n\t\t\/* Ignore keys that are not directly below the config root key or have an incorrect size *\/\n\t\tif (keyRel (root, key) != 1 || keyGetBaseNameSize (key) != 3 || keyGetValueSize (key) != 3) continue;\n\n\t\tint character = elektraHexcodeConvFromHex (keyBaseName (key)[1]);\n\t\tcharacter += elektraHexcodeConvFromHex (keyBaseName (key)[0]) * 16;\n\n\t\tint replacement = elektraHexcodeConvFromHex (keyString (key)[1]);\n\t\treplacement += elektraHexcodeConvFromHex (keyString (key)[0]) * 16;\n\n\t\t\/* Hexencode this character! *\/\n\t\tmapping->encode[character & 255] = replacement;\n\t\tmapping->decode[replacement & 255] = character;\n\t}\n}\n\n\/**\n * @brief This function replaces escaped characters in a string with unescaped characters.\n *\n * The function stores the unescaped result in `mapping->buffer`.\n *\n * @pre The variable `mapping->buffer` needs to be as large as `size`.\n *\n * @param value This string stores the string this function decodes.\n * @param size This number specifies the size of `value` including the trailing `'\\0'` character.\n * @param mapping This variable stores the buffer and the character mapping this function uses to decode `value`.\n *\n * @return The size of the decoded string including the trailing `'\\0'` character\n *\/\nsize_t decode (char const * const value, size_t const size, CCodeData * mapping)\n{\n\tsize_t out = 0;\n\tfor (size_t in = 0; in < size - 1; ++in)\n\t{\n\t\tunsigned char character = value[in];\n\n\t\tif (character == mapping->escape)\n\t\t{\n\t\t\t++in; \/* Advance twice *\/\n\t\t\tcharacter = value[in];\n\n\t\t\tmapping->buffer[out] = mapping->decode[character & 255];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmapping->buffer[out] = character;\n\t\t}\n\t\t++out; \/* Only one char is written *\/\n\t}\n\n\tmapping->buffer[out] = 0; \/\/ null termination for keyString()\n\treturn out + 1;\n}\n\n\/**\n * @brief This function replaces unescaped characters in a string with escaped characters.\n *\n * The function stores the escaped result value in `mapping->buffer`.\n *\n * @pre The variable `mapping->buffer` needs to be twice as large as size.\n *\n * @param value This variable stores the string this function escapes.\n * @param size This number specifies the size of `value` including the trailing `'\\0'` character.\n * @param mapping This variable stores the buffer and the character mapping this function uses to encode `value`.\n *\n * @return The size of the encoded string including the trailing `'\\0'` character\n *\/\nsize_t encode (char const * const value, size_t const size, CCodeData * mapping)\n{\n\tsize_t out = 0;\n\tfor (size_t in = 0; in < size - 1; ++in)\n\t{\n\t\tunsigned char character = value[in];\n\n\t\tif (mapping->encode[character])\n\t\t{\n\t\t\tmapping->buffer[out + 1] = mapping->encode[character];\n\t\t\t\/\/ Escape char\n\t\t\tmapping->buffer[out] = mapping->escape;\n\t\t\tout += 2;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ just copy one character\n\t\t\tmapping->buffer[out] = value[in];\n\t\t\t\/\/ advance out cursor\n\t\t\tout++;\n\t\t}\n\t}\n\n\tmapping->buffer[out] = 0; \/\/ null termination for keyString()\n\treturn out + 1;\n}\n\n} \/\/ end namespace\n\nextern \"C\" {\n\n\/**\n * @brief This function replaces escaped characters in a key value with unescaped characters.\n *\n * The function stores the unescaped result value both in `mapping->buffer` and the given key.\n *\n * @pre The variable `mapping->buffer` needs to be as large as the key value’s size.\n *\n * @param key This key holds the value this function decodes.\n * @param mapping This variable stores the buffer and the character mapping this function uses to decode the value of the given key.\n *\/\nvoid elektraCcodeDecode (Key * key, CCodeData * mapping)\n{\n\tconst char * value = static_cast<const char *> (keyValue (key));\n\tif (!value) return;\n\n\tkeySetRaw (key, mapping->buffer, decode (value, keyGetValueSize (key), mapping));\n}\n\n\/**\n * @brief This function replaces unescaped characters in a key value with escaped characters.\n *\n * The function stores the escaped result value both in `mapping->buffer` and the given key.\n *\n * @pre The variable `mapping->buffer` needs to be twice as large as the key value’s size.\n *\n * @param key This key stores the value this function escapes.\n * @param mapping This variable stores the buffer and the character mapping this function uses to encode the value of the given key.\n *\/\nvoid elektraCcodeEncode (Key * key, CCodeData * mapping)\n{\n\tconst char * value = static_cast<const char *> (keyValue (key));\n\tif (!value) return;\n\n\tkeySetRaw (key, mapping->buffer, encode (value, keyGetValueSize (key), mapping));\n}\n\n\/\/ ====================\n\/\/ = Plugin Interface =\n\/\/ ====================\n\n\/** @see elektraDocOpen *\/\nint elektraCcodeOpen (Plugin * handle, Key * key ELEKTRA_UNUSED)\n{\n\tCCodeData * const mapping = new CCodeData ();\n\n\t\/* Store for later use...*\/\n\telektraPluginSetData (handle, mapping);\n\n\tKeySet * const config = elektraPluginGetConfig (handle);\n\n\tKey const * const escape = ksLookupByName (config, \"\/escape\", 0);\n\tmapping->escape = '\\\\';\n\tif (escape && keyGetBaseNameSize (escape) && keyGetValueSize (escape) == 3)\n\t{\n\t\tint escapeChar = elektraHexcodeConvFromHex (keyString (escape)[1]);\n\t\tescapeChar += elektraHexcodeConvFromHex (keyString (escape)[0]) * 16;\n\n\t\tmapping->escape = escapeChar & 255;\n\t}\n\tELEKTRA_LOG_DEBUG (\"Use “%c” as escape character\", mapping->escape);\n\n\tKey const * const root = ksLookupByName (config, \"\/chars\", 0);\n\n\tif (root)\n\t{\n\t\treadConfig (mapping, config, root);\n\t}\n\telse\n\t{\n\t\tsetDefaultConfig (mapping);\n\t}\n\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocClose *\/\nint elektraCcodeClose (Plugin * handle, Key * key ELEKTRA_UNUSED)\n{\n\tCCodeData * const mapping = static_cast<CCodeData *> (elektraPluginGetData (handle));\n\n\tdelete[](mapping->buffer);\n\tdelete (mapping);\n\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocGet *\/\nint elektraCcodeGet (Plugin * handle, KeySet * returned, Key * parentKey)\n{\n\tif (!strcmp (keyName (parentKey), \"system\/elektra\/modules\/ccode\"))\n\t{\n\t\tKeySet * const pluginConfig = contract ();\n\t\tksAppend (returned, pluginConfig);\n\t\tksDel (pluginConfig);\n\t\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n\t}\n\n\tCCodeData * const mapping = retrieveMapping (handle);\n\n\tKey * key;\n\tksRewind (returned);\n\twhile ((key = ksNext (returned)) != 0)\n\t{\n\t\tsize_t const size = keyGetValueSize (key);\n\t\tif (size > mapping->bufferSize)\n\t\t{\n\t\t\tmapping->bufferSize = size;\n\t\t\tmapping->buffer = new unsigned char[mapping->bufferSize];\n\t\t}\n\n\t\telektraCcodeDecode (key, mapping);\n\t}\n\n\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n}\n\n\/** @see elektraDocSet *\/\nint elektraCcodeSet (Plugin * handle, KeySet * returned, Key * parentKey ELEKTRA_UNUSED)\n{\n\tCCodeData * const mapping = retrieveMapping (handle);\n\n\tCppKeySet keys{ returned };\n\tfor (auto key : keys)\n\t{\n\t\tsize_t const size = key.getBinarySize () * 2;\n\t\tif (size > mapping->bufferSize)\n\t\t{\n\t\t\tmapping->bufferSize = size;\n\t\t\tmapping->buffer = new unsigned char[mapping->bufferSize];\n\t\t}\n\n\t\telektraCcodeEncode (*key, mapping);\n\t}\n\n\tkeys.release ();\n\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n}\n\nPlugin * ELEKTRA_PLUGIN_EXPORT (ccode)\n{\n\t\/\/ clang-format off\n\treturn elektraPluginExport(\"ccode\",\n\t\tELEKTRA_PLUGIN_OPEN,\t&elektraCcodeOpen,\n\t\tELEKTRA_PLUGIN_CLOSE,\t&elektraCcodeClose,\n\t\tELEKTRA_PLUGIN_GET,\t&elektraCcodeGet,\n\t\tELEKTRA_PLUGIN_SET,\t&elektraCcodeSet,\n\t\tELEKTRA_PLUGIN_END);\n}\n\n} \/\/ end extern \"C\"\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#pragma once\n\n#include \"db\/consistency_level_type.hh\"\n#include \"db\/write_type.hh\"\n#include <stdexcept>\n#include <seastar\/core\/sstring.hh>\n#include <seastar\/core\/print.hh>\n#include \"bytes.hh\"\n\nnamespace exceptions {\n\nenum class exception_code : int32_t {\n    SERVER_ERROR    = 0x0000,\n    PROTOCOL_ERROR  = 0x000A,\n\n    BAD_CREDENTIALS = 0x0100,\n\n    \/\/ 1xx: problem during request execution\n    UNAVAILABLE     = 0x1000,\n    OVERLOADED      = 0x1001,\n    IS_BOOTSTRAPPING= 0x1002,\n    TRUNCATE_ERROR  = 0x1003,\n    WRITE_TIMEOUT   = 0x1100,\n    WRITE_FAILURE   = 0x1500,\n    READ_TIMEOUT    = 0x1200,\n    READ_FAILURE    = 0x1300,\n\n    \/\/ 2xx: problem validating the request\n    SYNTAX_ERROR    = 0x2000,\n    UNAUTHORIZED    = 0x2100,\n    INVALID         = 0x2200,\n    CONFIG_ERROR    = 0x2300,\n    ALREADY_EXISTS  = 0x2400,\n    UNPREPARED      = 0x2500\n};\n\nclass cassandra_exception : public std::exception {\nprivate:\n    exception_code _code;\n    sstring _msg;\nprotected:\n    template<typename... Args>\n    static inline sstring prepare_message(const char* fmt, Args&&... args) noexcept {\n        try {\n            return sprint(fmt, std::forward<Args>(args)...);\n        } catch (...) {\n            return sstring();\n        }\n    }\npublic:\n    cassandra_exception(exception_code code, sstring msg) noexcept\n        : _code(code)\n        , _msg(std::move(msg))\n    { }\n    virtual const char* what() const noexcept override { return _msg.begin(); }\n    exception_code code() const { return _code; }\n    sstring get_message() const { return what(); }\n};\n\nclass protocol_exception : public cassandra_exception {\npublic:\n    protocol_exception(sstring msg) noexcept\n        : exceptions::cassandra_exception{exceptions::exception_code::PROTOCOL_ERROR, std::move(msg)}\n    { }\n};\n\nstruct unavailable_exception : cassandra_exception {\n    db::consistency_level consistency;\n    int32_t required;\n    int32_t alive;\n\n\n    unavailable_exception(sstring msg, db::consistency_level cl, int32_t required, int32_t alive) noexcept\n        : exceptions::cassandra_exception(exceptions::exception_code::UNAVAILABLE, std::move(msg))\n        , consistency(cl)\n        , required(required)\n        , alive(alive)\n    {}\n\n    unavailable_exception(db::consistency_level cl, int32_t required, int32_t alive) noexcept\n        : unavailable_exception(prepare_message(\"Cannot achieve consistency level for cl %s. Requires %ld, alive %ld\", cl, required, alive),\n                cl, required, alive)\n    {}\n};\n\nclass request_execution_exception : public cassandra_exception {\npublic:\n    request_execution_exception(exception_code code, sstring msg) noexcept\n        : cassandra_exception(code, std::move(msg))\n    { }\n};\n\nclass truncate_exception : public request_execution_exception\n{\npublic:\n    truncate_exception(std::exception_ptr ep);\n};\n\nclass request_timeout_exception : public cassandra_exception {\npublic:\n    db::consistency_level consistency;\n    int32_t received;\n    int32_t block_for;\n\n    request_timeout_exception(exception_code code, const sstring& ks, const sstring& cf, db::consistency_level consistency, int32_t received, int32_t block_for) noexcept\n        : cassandra_exception{code, prepare_message(\"Operation timed out for %s.%s - received only %d responses from %d CL=%s.\", ks, cf, received, block_for, consistency)}\n        , consistency{consistency}\n        , received{received}\n        , block_for{block_for}\n    { }\n};\n\nclass read_timeout_exception : public request_timeout_exception {\npublic:\n    bool data_present;\n\n    read_timeout_exception(const sstring& ks, const sstring& cf, db::consistency_level consistency, int32_t received, int32_t block_for, bool data_present) noexcept\n        : request_timeout_exception{exception_code::READ_TIMEOUT, ks, cf, consistency, received, block_for}\n        , data_present{data_present}\n    { }\n};\n\nstruct mutation_write_timeout_exception : public request_timeout_exception {\n    db::write_type type;\n    mutation_write_timeout_exception(const sstring& ks, const sstring& cf, db::consistency_level consistency, int32_t received, int32_t block_for, db::write_type type) noexcept :\n        request_timeout_exception(exception_code::WRITE_TIMEOUT, ks, cf, consistency, received, block_for)\n        , type{std::move(type)}\n    { }\n};\n\nclass request_failure_exception : public cassandra_exception {\npublic:\n    db::consistency_level consistency;\n    int32_t received;\n    int32_t failures;\n    int32_t block_for;\n\nprotected:\n    request_failure_exception(exception_code code, const sstring& ks, const sstring& cf, db::consistency_level consistency_, int32_t received_, int32_t failures_, int32_t block_for_) noexcept\n        : cassandra_exception{code, prepare_message(\"Operation failed for %s.%s - received %d responses and %d failures from %d CL=%s.\", ks, cf, received_, failures_, block_for_, consistency_)}\n        , consistency{consistency_}\n        , received{received_}\n        , failures{failures_}\n        , block_for{block_for_}\n    {}\n};\n\nstruct mutation_write_failure_exception : public request_failure_exception {\n    db::write_type type;\n    mutation_write_failure_exception(const sstring& ks, const sstring& cf, db::consistency_level consistency_, int32_t received_, int32_t failures_, int32_t block_for_, db::write_type type_) noexcept :\n        request_failure_exception(exception_code::WRITE_FAILURE, ks, cf, consistency_, received_, failures_, block_for_)\n        , type{std::move(type_)}\n    { }\n};\n\nstruct read_failure_exception : public request_failure_exception {\n    bool data_present;\n\n    read_failure_exception(const sstring& ks, const sstring& cf, db::consistency_level consistency_, int32_t received_, int32_t failures_, int32_t block_for_, bool data_present_) noexcept\n        : request_failure_exception{exception_code::READ_FAILURE, ks, cf, consistency_, received_, failures_, block_for_}\n        , data_present{data_present_}\n    { }\n};\n\nstruct overloaded_exception : public cassandra_exception {\n    overloaded_exception(size_t c) noexcept :\n        cassandra_exception(exception_code::OVERLOADED, prepare_message(\"Too many in flight hints: %lu\", c)) {}\n};\n\nclass request_validation_exception : public cassandra_exception {\npublic:\n    using cassandra_exception::cassandra_exception;\n};\n\nclass invalidated_prepared_usage_attempt_exception : public exceptions::request_validation_exception {\npublic:\n    invalidated_prepared_usage_attempt_exception() : request_validation_exception{exception_code::UNPREPARED, \"Attempt to execute the invalidated prepared statement.\"} {}\n};\n\nclass unauthorized_exception: public request_validation_exception {\npublic:\n    unauthorized_exception(sstring msg) noexcept\n                    : request_validation_exception(exception_code::UNAUTHORIZED,\n                                    std::move(msg)) {\n    }\n};\n\nclass authentication_exception: public request_validation_exception {\npublic:\n    authentication_exception(sstring msg) noexcept\n                    : request_validation_exception(exception_code::BAD_CREDENTIALS,\n                                    std::move(msg)) {\n    }\n};\n\nclass invalid_request_exception : public request_validation_exception {\npublic:\n    invalid_request_exception(sstring cause) noexcept\n        : request_validation_exception(exception_code::INVALID, std::move(cause))\n    { }\n};\n\nclass keyspace_not_defined_exception : public invalid_request_exception {\npublic:\n    keyspace_not_defined_exception(std::string cause) noexcept\n        : invalid_request_exception(std::move(cause))\n    { }\n};\n\nclass prepared_query_not_found_exception : public request_validation_exception {\npublic:\n    bytes id;\n\n    prepared_query_not_found_exception(bytes id) noexcept\n        : request_validation_exception{exception_code::UNPREPARED, prepare_message(\"No prepared statement with ID %s found.\", id)}\n        , id{id}\n    { }\n};\n\nclass syntax_exception : public request_validation_exception {\npublic:\n    syntax_exception(sstring msg) noexcept\n        : request_validation_exception(exception_code::SYNTAX_ERROR, std::move(msg))\n    { }\n};\n\nclass configuration_exception : public request_validation_exception {\npublic:\n    configuration_exception(sstring msg) noexcept\n        : request_validation_exception{exception_code::CONFIG_ERROR, std::move(msg)}\n    { }\n\n    configuration_exception(exception_code code, sstring msg) noexcept\n        : request_validation_exception{code, std::move(msg)}\n    { }\n};\n\nclass already_exists_exception : public configuration_exception {\npublic:\n    const sstring ks_name;\n    const sstring cf_name;\nprivate:\n    already_exists_exception(sstring ks_name_, sstring cf_name_, sstring msg)\n        : configuration_exception{exception_code::ALREADY_EXISTS, msg}\n        , ks_name{ks_name_}\n        , cf_name{cf_name_}\n    { }\npublic:\n    already_exists_exception(sstring ks_name_, sstring cf_name_)\n        : already_exists_exception{ks_name_, cf_name_, format(\"Cannot add already existing table \\\"{}\\\" to keyspace \\\"{}\\\"\", cf_name_, ks_name_)}\n    { }\n\n    already_exists_exception(sstring ks_name_)\n        : already_exists_exception{ks_name_, \"\", format(\"Cannot add existing keyspace \\\"{}\\\"\", ks_name_)}\n    { }\n};\n\nclass recognition_exception : public std::runtime_error {\npublic:\n    recognition_exception(const std::string& msg) : std::runtime_error(msg) {};\n};\n\nclass unsupported_operation_exception : public std::runtime_error {\npublic:\n    unsupported_operation_exception() : std::runtime_error(\"unsupported operation\") {}\n    unsupported_operation_exception(const sstring& msg) : std::runtime_error(\"unsupported operation: \" + msg) {}\n};\n\n}\n<commit_msg>exceptions: define additional cassandra CQL exceptions codes<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 \"db\/consistency_level_type.hh\"\n#include \"db\/write_type.hh\"\n#include <stdexcept>\n#include <seastar\/core\/sstring.hh>\n#include <seastar\/core\/print.hh>\n#include \"bytes.hh\"\n\nnamespace exceptions {\n\nenum class exception_code : int32_t {\n    SERVER_ERROR    = 0x0000,\n    PROTOCOL_ERROR  = 0x000A,\n\n    BAD_CREDENTIALS = 0x0100,\n\n    \/\/ 1xx: problem during request execution\n    UNAVAILABLE     = 0x1000,\n    OVERLOADED      = 0x1001,\n    IS_BOOTSTRAPPING= 0x1002,\n    TRUNCATE_ERROR  = 0x1003,\n    WRITE_TIMEOUT   = 0x1100,\n    WRITE_FAILURE   = 0x1500,\n    READ_TIMEOUT    = 0x1200,\n    READ_FAILURE    = 0x1300,\n    FUNCTION_FAILURE= 0x1400,\n    CDC_WRITE_FAILURE = 0x1600,\n\n    \/\/ 2xx: problem validating the request\n    SYNTAX_ERROR    = 0x2000,\n    UNAUTHORIZED    = 0x2100,\n    INVALID         = 0x2200,\n    CONFIG_ERROR    = 0x2300,\n    ALREADY_EXISTS  = 0x2400,\n    UNPREPARED      = 0x2500\n};\n\nclass cassandra_exception : public std::exception {\nprivate:\n    exception_code _code;\n    sstring _msg;\nprotected:\n    template<typename... Args>\n    static inline sstring prepare_message(const char* fmt, Args&&... args) noexcept {\n        try {\n            return sprint(fmt, std::forward<Args>(args)...);\n        } catch (...) {\n            return sstring();\n        }\n    }\npublic:\n    cassandra_exception(exception_code code, sstring msg) noexcept\n        : _code(code)\n        , _msg(std::move(msg))\n    { }\n    virtual const char* what() const noexcept override { return _msg.begin(); }\n    exception_code code() const { return _code; }\n    sstring get_message() const { return what(); }\n};\n\nclass protocol_exception : public cassandra_exception {\npublic:\n    protocol_exception(sstring msg) noexcept\n        : exceptions::cassandra_exception{exceptions::exception_code::PROTOCOL_ERROR, std::move(msg)}\n    { }\n};\n\nstruct unavailable_exception : cassandra_exception {\n    db::consistency_level consistency;\n    int32_t required;\n    int32_t alive;\n\n\n    unavailable_exception(sstring msg, db::consistency_level cl, int32_t required, int32_t alive) noexcept\n        : exceptions::cassandra_exception(exceptions::exception_code::UNAVAILABLE, std::move(msg))\n        , consistency(cl)\n        , required(required)\n        , alive(alive)\n    {}\n\n    unavailable_exception(db::consistency_level cl, int32_t required, int32_t alive) noexcept\n        : unavailable_exception(prepare_message(\"Cannot achieve consistency level for cl %s. Requires %ld, alive %ld\", cl, required, alive),\n                cl, required, alive)\n    {}\n};\n\nclass request_execution_exception : public cassandra_exception {\npublic:\n    request_execution_exception(exception_code code, sstring msg) noexcept\n        : cassandra_exception(code, std::move(msg))\n    { }\n};\n\nclass truncate_exception : public request_execution_exception\n{\npublic:\n    truncate_exception(std::exception_ptr ep);\n};\n\nclass request_timeout_exception : public cassandra_exception {\npublic:\n    db::consistency_level consistency;\n    int32_t received;\n    int32_t block_for;\n\n    request_timeout_exception(exception_code code, const sstring& ks, const sstring& cf, db::consistency_level consistency, int32_t received, int32_t block_for) noexcept\n        : cassandra_exception{code, prepare_message(\"Operation timed out for %s.%s - received only %d responses from %d CL=%s.\", ks, cf, received, block_for, consistency)}\n        , consistency{consistency}\n        , received{received}\n        , block_for{block_for}\n    { }\n};\n\nclass read_timeout_exception : public request_timeout_exception {\npublic:\n    bool data_present;\n\n    read_timeout_exception(const sstring& ks, const sstring& cf, db::consistency_level consistency, int32_t received, int32_t block_for, bool data_present) noexcept\n        : request_timeout_exception{exception_code::READ_TIMEOUT, ks, cf, consistency, received, block_for}\n        , data_present{data_present}\n    { }\n};\n\nstruct mutation_write_timeout_exception : public request_timeout_exception {\n    db::write_type type;\n    mutation_write_timeout_exception(const sstring& ks, const sstring& cf, db::consistency_level consistency, int32_t received, int32_t block_for, db::write_type type) noexcept :\n        request_timeout_exception(exception_code::WRITE_TIMEOUT, ks, cf, consistency, received, block_for)\n        , type{std::move(type)}\n    { }\n};\n\nclass request_failure_exception : public cassandra_exception {\npublic:\n    db::consistency_level consistency;\n    int32_t received;\n    int32_t failures;\n    int32_t block_for;\n\nprotected:\n    request_failure_exception(exception_code code, const sstring& ks, const sstring& cf, db::consistency_level consistency_, int32_t received_, int32_t failures_, int32_t block_for_) noexcept\n        : cassandra_exception{code, prepare_message(\"Operation failed for %s.%s - received %d responses and %d failures from %d CL=%s.\", ks, cf, received_, failures_, block_for_, consistency_)}\n        , consistency{consistency_}\n        , received{received_}\n        , failures{failures_}\n        , block_for{block_for_}\n    {}\n};\n\nstruct mutation_write_failure_exception : public request_failure_exception {\n    db::write_type type;\n    mutation_write_failure_exception(const sstring& ks, const sstring& cf, db::consistency_level consistency_, int32_t received_, int32_t failures_, int32_t block_for_, db::write_type type_) noexcept :\n        request_failure_exception(exception_code::WRITE_FAILURE, ks, cf, consistency_, received_, failures_, block_for_)\n        , type{std::move(type_)}\n    { }\n};\n\nstruct read_failure_exception : public request_failure_exception {\n    bool data_present;\n\n    read_failure_exception(const sstring& ks, const sstring& cf, db::consistency_level consistency_, int32_t received_, int32_t failures_, int32_t block_for_, bool data_present_) noexcept\n        : request_failure_exception{exception_code::READ_FAILURE, ks, cf, consistency_, received_, failures_, block_for_}\n        , data_present{data_present_}\n    { }\n};\n\nstruct overloaded_exception : public cassandra_exception {\n    overloaded_exception(size_t c) noexcept :\n        cassandra_exception(exception_code::OVERLOADED, prepare_message(\"Too many in flight hints: %lu\", c)) {}\n};\n\nclass request_validation_exception : public cassandra_exception {\npublic:\n    using cassandra_exception::cassandra_exception;\n};\n\nclass invalidated_prepared_usage_attempt_exception : public exceptions::request_validation_exception {\npublic:\n    invalidated_prepared_usage_attempt_exception() : request_validation_exception{exception_code::UNPREPARED, \"Attempt to execute the invalidated prepared statement.\"} {}\n};\n\nclass unauthorized_exception: public request_validation_exception {\npublic:\n    unauthorized_exception(sstring msg) noexcept\n                    : request_validation_exception(exception_code::UNAUTHORIZED,\n                                    std::move(msg)) {\n    }\n};\n\nclass authentication_exception: public request_validation_exception {\npublic:\n    authentication_exception(sstring msg) noexcept\n                    : request_validation_exception(exception_code::BAD_CREDENTIALS,\n                                    std::move(msg)) {\n    }\n};\n\nclass invalid_request_exception : public request_validation_exception {\npublic:\n    invalid_request_exception(sstring cause) noexcept\n        : request_validation_exception(exception_code::INVALID, std::move(cause))\n    { }\n};\n\nclass keyspace_not_defined_exception : public invalid_request_exception {\npublic:\n    keyspace_not_defined_exception(std::string cause) noexcept\n        : invalid_request_exception(std::move(cause))\n    { }\n};\n\nclass prepared_query_not_found_exception : public request_validation_exception {\npublic:\n    bytes id;\n\n    prepared_query_not_found_exception(bytes id) noexcept\n        : request_validation_exception{exception_code::UNPREPARED, prepare_message(\"No prepared statement with ID %s found.\", id)}\n        , id{id}\n    { }\n};\n\nclass syntax_exception : public request_validation_exception {\npublic:\n    syntax_exception(sstring msg) noexcept\n        : request_validation_exception(exception_code::SYNTAX_ERROR, std::move(msg))\n    { }\n};\n\nclass configuration_exception : public request_validation_exception {\npublic:\n    configuration_exception(sstring msg) noexcept\n        : request_validation_exception{exception_code::CONFIG_ERROR, std::move(msg)}\n    { }\n\n    configuration_exception(exception_code code, sstring msg) noexcept\n        : request_validation_exception{code, std::move(msg)}\n    { }\n};\n\nclass already_exists_exception : public configuration_exception {\npublic:\n    const sstring ks_name;\n    const sstring cf_name;\nprivate:\n    already_exists_exception(sstring ks_name_, sstring cf_name_, sstring msg)\n        : configuration_exception{exception_code::ALREADY_EXISTS, msg}\n        , ks_name{ks_name_}\n        , cf_name{cf_name_}\n    { }\npublic:\n    already_exists_exception(sstring ks_name_, sstring cf_name_)\n        : already_exists_exception{ks_name_, cf_name_, format(\"Cannot add already existing table \\\"{}\\\" to keyspace \\\"{}\\\"\", cf_name_, ks_name_)}\n    { }\n\n    already_exists_exception(sstring ks_name_)\n        : already_exists_exception{ks_name_, \"\", format(\"Cannot add existing keyspace \\\"{}\\\"\", ks_name_)}\n    { }\n};\n\nclass recognition_exception : public std::runtime_error {\npublic:\n    recognition_exception(const std::string& msg) : std::runtime_error(msg) {};\n};\n\nclass unsupported_operation_exception : public std::runtime_error {\npublic:\n    unsupported_operation_exception() : std::runtime_error(\"unsupported operation\") {}\n    unsupported_operation_exception(const sstring& msg) : std::runtime_error(\"unsupported operation: \" + msg) {}\n};\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n *\n * @brief Source for yanlr plugin\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\n *\/\n\n#include \"yanlr.hpp\"\n#include \"YAMLLexer.h\"\n#include \"YAMLParser.h\"\n#include \"antlr4-runtime.h\"\n\n#include <kdbhelper.h>\n\nusing namespace ckdb;\nusing namespace antlr;\nusing namespace antlr4;\n\nextern \"C\" {\n\nint elektraYanlrGet (Plugin * handle ELEKTRA_UNUSED, KeySet * returned, Key * parentKey)\n{\n\tif (!elektraStrCmp (keyName (parentKey), \"system\/elektra\/modules\/yanlr\"))\n\t{\n\t\tKeySet * contract =\n\t\t\tksNew (30, keyNew (\"system\/elektra\/modules\/yanlr\", KEY_VALUE, \"yanlr plugin waits for your orders\", KEY_END),\n\t\t\t       keyNew (\"system\/elektra\/modules\/yanlr\/exports\", KEY_END),\n\t\t\t       keyNew (\"system\/elektra\/modules\/yanlr\/exports\/get\", KEY_FUNC, elektraYanlrGet, KEY_END),\n\t\t\t       keyNew (\"system\/elektra\/modules\/yanlr\/exports\/set\", KEY_FUNC, elektraYanlrSet, KEY_END),\n#include ELEKTRA_README (yanlr)\n\t\t\t       keyNew (\"system\/elektra\/modules\/yanlr\/infos\/version\", KEY_VALUE, PLUGINVERSION, KEY_END), KS_END);\n\t\tksAppend (returned, contract);\n\t\tksDel (contract);\n\n\t\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n\t}\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\nint elektraYanlrSet (Plugin * handle ELEKTRA_UNUSED, KeySet * returned ELEKTRA_UNUSED, Key * parentKey ELEKTRA_UNUSED)\n{\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\nPlugin * ELEKTRA_PLUGIN_EXPORT (yanlr)\n{\n\treturn elektraPluginExport (\"yanlr\", ELEKTRA_PLUGIN_GET, &elektraYanlrGet, ELEKTRA_PLUGIN_SET, &elektraYanlrSet,\n\t\t\t\t    ELEKTRA_PLUGIN_END);\n}\n\n} \/\/ end extern \"C\"\n<commit_msg>Yan LR: Add comment banners<commit_after>\/**\n * @file\n *\n * @brief Source for yanlr plugin\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\n *\/\n\n#include \"yanlr.hpp\"\n#include \"YAMLLexer.h\"\n#include \"YAMLParser.h\"\n#include \"antlr4-runtime.h\"\n\n#include <kdbhelper.h>\n\nusing namespace ckdb;\nusing namespace antlr;\nusing namespace antlr4;\n\nextern \"C\" {\n\n\/\/ ====================\n\/\/ = Plugin Interface =\n\/\/ ====================\n\n\/** @see elektraDocGet *\/\nint elektraYanlrGet (Plugin * handle ELEKTRA_UNUSED, KeySet * returned, Key * parentKey)\n{\n\tif (!elektraStrCmp (keyName (parentKey), \"system\/elektra\/modules\/yanlr\"))\n\t{\n\t\tKeySet * contract =\n\t\t\tksNew (30, keyNew (\"system\/elektra\/modules\/yanlr\", KEY_VALUE, \"yanlr plugin waits for your orders\", KEY_END),\n\t\t\t       keyNew (\"system\/elektra\/modules\/yanlr\/exports\", KEY_END),\n\t\t\t       keyNew (\"system\/elektra\/modules\/yanlr\/exports\/get\", KEY_FUNC, elektraYanlrGet, KEY_END),\n\t\t\t       keyNew (\"system\/elektra\/modules\/yanlr\/exports\/set\", KEY_FUNC, elektraYanlrSet, KEY_END),\n#include ELEKTRA_README (yanlr)\n\t\t\t       keyNew (\"system\/elektra\/modules\/yanlr\/infos\/version\", KEY_VALUE, PLUGINVERSION, KEY_END), KS_END);\n\t\tksAppend (returned, contract);\n\t\tksDel (contract);\n\n\t\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n\t}\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocSet *\/\nint elektraYanlrSet (Plugin * handle ELEKTRA_UNUSED, KeySet * returned ELEKTRA_UNUSED, Key * parentKey ELEKTRA_UNUSED)\n{\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\nPlugin * ELEKTRA_PLUGIN_EXPORT (yanlr)\n{\n\treturn elektraPluginExport (\"yanlr\", ELEKTRA_PLUGIN_GET, &elektraYanlrGet, ELEKTRA_PLUGIN_SET, &elektraYanlrSet,\n\t\t\t\t    ELEKTRA_PLUGIN_END);\n}\n\n} \/\/ end extern \"C\"\n<|endoftext|>"}
{"text":"<commit_before>\/** \n * @file py_sql_well.cpp\n * @brief python wraper for well fracture storage\n * @author Oleg Borschuk\n * @version \n * @date 2011-07-29\n *\/\n\n#include \"py_sql_well.h\"\n#include \"sql_well.h\"\n#include \"bs_serialize.h\"\n\nusing namespace boost::python;\n#ifdef BSPY_EXPORTING_PLUGIN\n\nnamespace blue_sky {\nnamespace python {\n  void py_export_compdat_ident();\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/! export matrices to python\n  void py_export_sql_well ()\n  {\n    using namespace boost::python;\n\n    base_exporter <well_pool_iface, py_sql_well_exporter>::export_class (\"well_pool_iface\");\n\n    class_exporter <sql_well, well_pool_iface, py_sql_well_exporter>::export_class (\"sql_well\");\n\n    py_export_compdat_ident();\n\n    def(\"serialize_to_str\", &blue_sky::serialize_to_str< well_pool_iface >);\n    def(\"serialize_from_str\", &blue_sky::serialize_from_str< well_pool_iface >);\n\n    \/\/ register implicit conversion to interface\n    implicitly_convertible<\n      smart_ptr< sql_well >,\n      smart_ptr< well_pool_iface >\n    >();\n  }\n\n}\t\/\/ namespace python\n}\t\/\/ namespace blue_sky\n#endif \/\/ #ifdef BSPY_EXPORTING_PLUGIN\n<commit_msg>SQW: add helper serialize_to_str_fname that accepts proj path & fname<commit_after>\/** \n * @file py_sql_well.cpp\n * @brief python wraper for well fracture storage\n * @author Oleg Borschuk\n * @version \n * @date 2011-07-29\n *\/\n\n#include \"py_sql_well.h\"\n#include \"sql_well.h\"\n#include \"bs_serialize.h\"\n#include \"bs_prop_base.h\"\n\nusing namespace boost::python;\n#ifdef BSPY_EXPORTING_PLUGIN\n\nnamespace blue_sky {\nnamespace python {\n  void py_export_compdat_ident();\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ helper function to write well_pool to given fname\n  std::string serialize_to_str_fname(\n      smart_ptr< well_pool_iface > wp,\n      const std::string& prj_path,\n      const std::string& prj_name\n  ) {\n    \/\/ save project path for serialization code\n    kernel::idx_dt_ptr p_dt = BS_KERNEL.pert_idx_dt(BS_KERNEL.find_type(\"hdm\").td_);\n    \/\/std::string well_pool_filename = prj_name + \"_well_pool.db\";\n    p_dt->insert< std::string >(prj_path);\n    \/\/ and project name\n    p_dt->insert< std::string >(prj_name);\n\n    \/\/ invoke serializetion\n    std::string res = serialize_to_str< well_pool_iface >(wp);\n    \/\/ clear table\n    p_dt->clear< std::string >();\n\n    return res;\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/! export matrices to python\n  void py_export_sql_well ()\n  {\n    using namespace boost::python;\n\n    base_exporter <well_pool_iface, py_sql_well_exporter>::export_class (\"well_pool_iface\");\n\n    class_exporter <sql_well, well_pool_iface, py_sql_well_exporter>::export_class (\"sql_well\");\n\n    py_export_compdat_ident();\n\n    def(\"serialize_to_str\", &blue_sky::serialize_to_str< well_pool_iface >);\n    def(\"serialize_from_str\", &blue_sky::serialize_from_str< well_pool_iface >);\n    def(\"serialize_to_str_fname\", &serialize_to_str_fname);\n\n    \/\/ register implicit conversion to interface\n    implicitly_convertible<\n      smart_ptr< sql_well >,\n      smart_ptr< well_pool_iface >\n    >();\n  }\n\n}\t\/\/ namespace python\n}\t\/\/ namespace blue_sky\n#endif \/\/ #ifdef BSPY_EXPORTING_PLUGIN\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file   popcount.cpp\n\/\/\/ @brief  Fast algorithm to count the number of 1 bits in an array\n\/\/\/         using only integer operations.\n\/\/\/\n\/\/\/ Copyright (C) 2017 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 <stdint.h>\n\nnamespace {\n\n\/\/\/ This uses fewer arithmetic operations than any other known\n\/\/\/ implementation on machines with fast multiplication.\n\/\/\/ It uses 12 arithmetic operations, one of which is a multiply.\n\/\/\/ http:\/\/en.wikipedia.org\/wiki\/Hamming_weight#Efficient_implementation\n\/\/\/\nuint64_t popcount64c(uint64_t x)\n{\n  const uint64_t m1 = 0x5555555555555555ull;\n  const uint64_t m2 = 0x3333333333333333ull;\n  const uint64_t m4 = 0x0F0F0F0F0F0F0F0Full;\n  const uint64_t h01 = 0x0101010101010101ull;\n\n  x -= (x >> 1) & m1;\n  x = (x & m2) + ((x >> 2) & m2);\n  x = (x + (x >> 4)) & m4;\n  return (x * h01) >> 56;\n}\n\n\/\/\/ Carry-save adder (CSA).\n\/\/\/ @see Chapter 5 in \"Hacker's Delight\".\n\/\/\/\nvoid CSA(uint64_t& h, uint64_t& l, uint64_t a, uint64_t b, uint64_t c)\n{\n  uint64_t u = a ^ b; \n  h = (a & b) | (u & c);\n  l = u ^ c;\n}\n\n} \/\/ namespace\n\nnamespace primesieve {\n\n\/\/\/ Harley-Seal popcount (4th iteration).\n\/\/\/ The Harley-Seal popcount algorithm is one of the fastest algorithms\n\/\/\/ for counting 1 bits in an array using only integer operations.\n\/\/\/ This implementation uses only 5.69 instructions per 64-bit word.\n\/\/\/ @see Chapter 5 in \"Hacker's Delight\" 2nd edition.\n\/\/\/\nuint64_t popcount(const uint64_t* array, uint64_t size)\n{\n  uint64_t total = 0;\n  uint64_t ones = 0, twos = 0, fours = 0, eights = 0, sixteens = 0;\n  uint64_t twosA, twosB, foursA, foursB, eightsA, eightsB;\n  uint64_t limit = size - size % 16;\n  uint64_t i = 0;\n\n  for(; i < limit; i += 16)\n  {\n    CSA(twosA, ones, ones, array[i+0], array[i+1]);\n    CSA(twosB, ones, ones, array[i+2], array[i+3]);\n    CSA(foursA, twos, twos, twosA, twosB);\n    CSA(twosA, ones, ones, array[i+4], array[i+5]);\n    CSA(twosB, ones, ones, array[i+6], array[i+7]);\n    CSA(foursB, twos, twos, twosA, twosB);\n    CSA(eightsA,fours, fours, foursA, foursB);\n    CSA(twosA, ones, ones, array[i+8], array[i+9]);\n    CSA(twosB, ones, ones, array[i+10], array[i+11]);\n    CSA(foursA, twos, twos, twosA, twosB);\n    CSA(twosA, ones, ones, array[i+12], array[i+13]);\n    CSA(twosB, ones, ones, array[i+14], array[i+15]);\n    CSA(foursB, twos, twos, twosA, twosB);\n    CSA(eightsB, fours, fours, foursA, foursB);\n    CSA(sixteens, eights, eights, eightsA, eightsB);\n\n    total += popcount64c(sixteens);\n  }\n\n  total *= 16;\n  total += 8 * popcount64c(eights);\n  total += 4 * popcount64c(fours);\n  total += 2 * popcount64c(twos);\n  total += 1 * popcount64c(ones);\n\n  for(; i < size; i++)\n    total += popcount64c(array[i]);\n\n  return total;\n}\n\n} \/\/ namespace\n<commit_msg>Rename popcount64c() to popcount64()<commit_after>\/\/\/\n\/\/\/ @file   popcount.cpp\n\/\/\/ @brief  Fast algorithm to count the number of 1 bits in an array\n\/\/\/         using only integer operations.\n\/\/\/\n\/\/\/ Copyright (C) 2017 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 <stdint.h>\n\nnamespace {\n\n\/\/\/ This uses fewer arithmetic operations than any other known\n\/\/\/ implementation on machines with fast multiplication.\n\/\/\/ It uses 12 arithmetic operations, one of which is a multiply.\n\/\/\/ http:\/\/en.wikipedia.org\/wiki\/Hamming_weight#Efficient_implementation\n\/\/\/\nuint64_t popcount64(uint64_t x)\n{\n  const uint64_t m1 = 0x5555555555555555ull;\n  const uint64_t m2 = 0x3333333333333333ull;\n  const uint64_t m4 = 0x0F0F0F0F0F0F0F0Full;\n  const uint64_t h01 = 0x0101010101010101ull;\n\n  x -= (x >> 1) & m1;\n  x = (x & m2) + ((x >> 2) & m2);\n  x = (x + (x >> 4)) & m4;\n  return (x * h01) >> 56;\n}\n\n\/\/\/ Carry-save adder (CSA).\n\/\/\/ @see Chapter 5 in \"Hacker's Delight\".\n\/\/\/\nvoid CSA(uint64_t& h, uint64_t& l, uint64_t a, uint64_t b, uint64_t c)\n{\n  uint64_t u = a ^ b; \n  h = (a & b) | (u & c);\n  l = u ^ c;\n}\n\n} \/\/ namespace\n\nnamespace primesieve {\n\n\/\/\/ Harley-Seal popcount (4th iteration).\n\/\/\/ The Harley-Seal popcount algorithm is one of the fastest algorithms\n\/\/\/ for counting 1 bits in an array using only integer operations.\n\/\/\/ This implementation uses only 5.69 instructions per 64-bit word.\n\/\/\/ @see Chapter 5 in \"Hacker's Delight\" 2nd edition.\n\/\/\/\nuint64_t popcount(const uint64_t* array, uint64_t size)\n{\n  uint64_t total = 0;\n  uint64_t ones = 0, twos = 0, fours = 0, eights = 0, sixteens = 0;\n  uint64_t twosA, twosB, foursA, foursB, eightsA, eightsB;\n  uint64_t limit = size - size % 16;\n  uint64_t i = 0;\n\n  for(; i < limit; i += 16)\n  {\n    CSA(twosA, ones, ones, array[i+0], array[i+1]);\n    CSA(twosB, ones, ones, array[i+2], array[i+3]);\n    CSA(foursA, twos, twos, twosA, twosB);\n    CSA(twosA, ones, ones, array[i+4], array[i+5]);\n    CSA(twosB, ones, ones, array[i+6], array[i+7]);\n    CSA(foursB, twos, twos, twosA, twosB);\n    CSA(eightsA,fours, fours, foursA, foursB);\n    CSA(twosA, ones, ones, array[i+8], array[i+9]);\n    CSA(twosB, ones, ones, array[i+10], array[i+11]);\n    CSA(foursA, twos, twos, twosA, twosB);\n    CSA(twosA, ones, ones, array[i+12], array[i+13]);\n    CSA(twosB, ones, ones, array[i+14], array[i+15]);\n    CSA(foursB, twos, twos, twosA, twosB);\n    CSA(eightsB, fours, fours, foursA, foursB);\n    CSA(sixteens, eights, eights, eightsA, eightsB);\n\n    total += popcount64(sixteens);\n  }\n\n  total *= 16;\n  total += 8 * popcount64(eights);\n  total += 4 * popcount64(fours);\n  total += 2 * popcount64(twos);\n  total += 1 * popcount64(ones);\n\n  for(; i < size; i++)\n    total += popcount64(array[i]);\n\n  return total;\n}\n\n} \/\/ namespace\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\/gfx\/canvas.h\"\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\";\nconst int kCompactNavbarSpaceHeight = 3;\n\nclass Spacer : public views::View {\n  SkBitmap* background_;\n public:\n  explicit Spacer(SkBitmap* bitmap) : background_(bitmap) {}\n\n  void Paint(gfx::Canvas* canvas) {\n    canvas->TileImageInt(*background_, 0, 0, width(), height());\n  }\n};\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    SkBitmap* theme_toolbar = theme_provider->GetBitmapNamed(IDR_THEME_TOOLBAR);\n    spacer_ = new Spacer(theme_toolbar);\n    browser_view()->AddChildView(spacer_);\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 void Layout(const gfx::Rect& bounds,\n                      gfx::Rect* tabstrip_bounds,\n                      int* bottom) {\n    if (browser_view()->IsTabStripVisible()) {\n      *bottom = bounds.bottom();\n    } else {\n      *bottom = 0;\n    }\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      tabstrip_bounds->SetRect(bounds.x(), bounds.y(),\n                               bounds.width(), bounds.height());\n      return;\n    } else {\n      main_menu_->SetVisible(true);\n      compact_navigation_bar_->SetVisible(compact_navigation_bar_enabled_);\n      status_area_->SetVisible(true);\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\n    \/\/ TODO(oshima): Use 0 for x position for now as this is\n    \/\/ sufficient for chromeos where the window is always\n    \/\/ maximized. The correct value is\n    \/\/ OpaqueBrowserFrameView::NonClientBorderThickness() and we will\n    \/\/ consider exposing it once we settle on the UI.\n    main_menu_->SetBounds(0, 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();\n    int width = bounds.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      spacer_->SetVisible(true);\n      spacer_->SetBounds(0, *bottom, browser_view()->width(),\n                         kCompactNavbarSpaceHeight);\n      *bottom += kCompactNavbarSpaceHeight;\n    } else {\n      spacer_->SetVisible(false);\n    }\n    width = std::max(0, width);  \/\/ In case there is no space left.\n    tabstrip_bounds->SetRect(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  virtual int GetMainMenuWidth() const {\n    return main_menu_->GetPreferredSize().width();\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  \/\/ A spacer under the tap strip used when the compact navigation bar\n  \/\/ is active.\n  Spacer* spacer_;\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 void Layout(const gfx::Rect& bounds,\n                      gfx::Rect* tabstrip_bounds,\n                      int* bottom) {\n    *bottom = 0;\n    tabstrip_bounds->SetRect(0, 0, 0, 0);\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  virtual int GetMainMenuWidth() const {\n    return 0;\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  if (browser_view->browser()->type() & Browser::TYPE_POPUP)\n    return new PopupExtender(browser_view);\n  else\n    return new NormalExtender(browser_view);\n}\n<commit_msg>Reverting workaround for focus issue in WidgetGtk.<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\/gfx\/canvas.h\"\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\";\nconst int kCompactNavbarSpaceHeight = 3;\n\nclass Spacer : public views::View {\n  SkBitmap* background_;\n public:\n  explicit Spacer(SkBitmap* bitmap) : background_(bitmap) {}\n\n  void Paint(gfx::Canvas* canvas) {\n    canvas->TileImageInt(*background_, 0, 0, width(), height());\n  }\n};\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    SkBitmap* theme_toolbar = theme_provider->GetBitmapNamed(IDR_THEME_TOOLBAR);\n    spacer_ = new Spacer(theme_toolbar);\n    browser_view()->AddChildView(spacer_);\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 void Layout(const gfx::Rect& bounds,\n                      gfx::Rect* tabstrip_bounds,\n                      int* bottom) {\n    if (browser_view()->IsTabStripVisible()) {\n      *bottom = bounds.bottom();\n    } else {\n      *bottom = 0;\n    }\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      tabstrip_bounds->SetRect(bounds.x(), bounds.y(),\n                               bounds.width(), bounds.height());\n      return;\n    } else {\n      main_menu_->SetVisible(true);\n      compact_navigation_bar_->SetVisible(compact_navigation_bar_enabled_);\n      status_area_->SetVisible(true);\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\n    \/\/ TODO(oshima): Use 0 for x position for now as this is\n    \/\/ sufficient for chromeos where the window is always\n    \/\/ maximized. The correct value is\n    \/\/ OpaqueBrowserFrameView::NonClientBorderThickness() and we will\n    \/\/ consider exposing it once we settle on the UI.\n    main_menu_->SetBounds(0, 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();\n    int width = bounds.width() - status_size.width();\n\n    if (compact_navigation_bar_->IsVisible()) {\n      gfx::Size cnb_bounds = compact_navigation_bar_->GetPreferredSize();\n      compact_navigation_bar_->SetBounds(curx, bounds.y(),\n                                         cnb_bounds.width(),\n                                         bounds.height());\n      curx += cnb_bounds.width();\n      width -= cnb_bounds.width();\n\n      spacer_->SetVisible(true);\n      spacer_->SetBounds(0, *bottom, browser_view()->width(),\n                         kCompactNavbarSpaceHeight);\n      *bottom += kCompactNavbarSpaceHeight;\n    } else {\n      spacer_->SetVisible(false);\n    }\n    width = std::max(0, width);  \/\/ In case there is no space left.\n    tabstrip_bounds->SetRect(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  virtual int GetMainMenuWidth() const {\n    return main_menu_->GetPreferredSize().width();\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  \/\/ A spacer under the tap strip used when the compact navigation bar\n  \/\/ is active.\n  Spacer* spacer_;\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 void Layout(const gfx::Rect& bounds,\n                      gfx::Rect* tabstrip_bounds,\n                      int* bottom) {\n    *bottom = 0;\n    tabstrip_bounds->SetRect(0, 0, 0, 0);\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  virtual int GetMainMenuWidth() const {\n    return 0;\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  if (browser_view->browser()->type() & Browser::TYPE_POPUP)\n    return new PopupExtender(browser_view);\n  else\n    return new NormalExtender(browser_view);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2012 Denis Shienkov <scapig@yandex.ru>\n** Copyright (C) 2012 Laszlo Papp <lpapp@kde.org>\n** Copyright (C) 2012 Andre Hartmann <aha_1980@gmx.de>\n** Contact: http:\/\/www.qt-project.org\/\n**\n** This file is part of the QtSerialPort 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 \"serialport_win_p.h\"\n\n#include <QtCore\/qelapsedtimer.h>\n\n#include <QtCore\/qthread.h>\n#include <QtCore\/qtimer.h>\n\nQT_BEGIN_NAMESPACE_SERIALPORT\n\nclass SerialPortPrivate;\n\nclass CommEventNotifier : public QThread\n{\n    Q_OBJECT\nsignals:\n    void eventMask(quint32 mask);\n\npublic:\n    CommEventNotifier(DWORD mask, SerialPortPrivate *d, QObject *parent)\n        : QThread(parent), dptr(d), running(true) {\n        connect(this, SIGNAL(eventMask(quint32)), this, SLOT(processNotification(quint32)));\n        ::SetCommMask(dptr->descriptor, mask);\n    }\n\n    virtual ~CommEventNotifier() {\n        running = false;\n        ::SetCommMask(dptr->descriptor, 0);\n        wait();\n    }\n\nprotected:\n    virtual void run() {\n        DWORD mask = 0;\n        while (running) {\n            if (::WaitCommEvent(dptr->descriptor, &mask, 0) != 0) {\n                \/\/ Wait until complete the operation changes the port settings,\n                \/\/ see updateDcb().\n                dptr->settingsChangeMutex.lock();\n                dptr->settingsChangeMutex.unlock();\n                emit eventMask(quint32(mask));\n            }\n        }\n    }\n\nprivate slots:\n    void processNotification(quint32 eventMask) {\n        if (EV_ERR & eventMask)\n            dptr->processIoErrors();\n        if (EV_RXCHAR &eventMask)\n            dptr->notifyRead();\n        if (EV_TXEMPTY & eventMask)\n            dptr->notifyWrite();\n    }\n\nprivate:\n    SerialPortPrivate *dptr;\n    mutable bool running;\n};\n\nclass WaitCommEventBreaker : public QThread\n{\n    Q_OBJECT\npublic:\n    WaitCommEventBreaker(HANDLE descriptor, int timeout, QObject *parent = 0)\n        : QThread(parent), descriptor(descriptor), timeout(timeout), worked(false) {\n        start();\n    }\n\n    virtual ~WaitCommEventBreaker() {\n        stop();\n        wait();\n    }\n\n    void stop() {\n        exit(0);\n    }\n\n    bool isWorked() const {\n        return worked;\n    }\n\nprotected:\n    void run() {\n        QTimer timer;\n        QObject::connect(&timer, SIGNAL(timeout()), this, SLOT(processTimeout()), Qt::DirectConnection);\n        timer.start(timeout);\n        exec();\n        worked = true;\n    }\n\nprivate slots:\n    void processTimeout() {\n        ::SetCommMask(descriptor, 0);\n        stop();\n    }\n\nprivate:\n    HANDLE descriptor;\n    int timeout;\n    mutable bool worked;\n};\n\nSerialPortPrivate::SerialPortPrivate(SerialPort *q)\n    : SerialPortPrivateData(q)\n    , descriptor(INVALID_HANDLE_VALUE)\n    , flagErrorFromCommEvent(0)\n    , eventNotifier(0)\n{\n}\n\nbool SerialPortPrivate::open(QIODevice::OpenMode mode)\n{\n    DWORD desiredAccess = 0;\n    DWORD eventMask = EV_ERR;\n\n    if (mode & QIODevice::ReadOnly) {\n        desiredAccess |= GENERIC_READ;\n        eventMask |= EV_RXCHAR;\n    }\n    if (mode & QIODevice::WriteOnly) {\n        desiredAccess |= GENERIC_WRITE;\n        eventMask |= EV_TXEMPTY;\n    }\n\n    descriptor = ::CreateFile(reinterpret_cast<const wchar_t*>(systemLocation.utf16()),\n                              desiredAccess, 0, 0, OPEN_EXISTING, 0, 0);\n\n    if (descriptor == INVALID_HANDLE_VALUE) {\n        portError = decodeSystemError();\n        return false;\n    }\n\n    if (::GetCommState(descriptor, &restoredDcb) == 0) {\n        portError = decodeSystemError();\n        return false;\n    }\n\n    currentDcb = restoredDcb;\n    currentDcb.fBinary = true;\n    currentDcb.fInX = false;\n    currentDcb.fOutX = false;\n    currentDcb.fAbortOnError = false;\n    currentDcb.fNull = false;\n    currentDcb.fErrorChar = false;\n\n    if (!updateDcb())\n        return false;\n\n    if (::GetCommTimeouts(descriptor, &restoredCommTimeouts) == 0) {\n        portError = decodeSystemError();\n        return false;\n    }\n\n    ::memset(&currentCommTimeouts, 0, sizeof(currentCommTimeouts));\n    currentCommTimeouts.ReadIntervalTimeout = MAXDWORD;\n\n    if (!updateCommTimeouts())\n        return false;\n\n    eventNotifier = new QtAddOn::SerialPort::CommEventNotifier(eventMask, this, q_ptr);\n    eventNotifier->start();\n\n    detectDefaultSettings();\n    return true;\n}\n\nvoid SerialPortPrivate::close()\n{\n    if (eventNotifier) {\n        eventNotifier->deleteLater();\n        eventNotifier = 0;\n    }\n\n    if (restoreSettingsOnClose) {\n        ::SetCommState(descriptor, &restoredDcb);\n        ::SetCommTimeouts(descriptor, &restoredCommTimeouts);\n    }\n\n    ::CloseHandle(descriptor);\n    descriptor = INVALID_HANDLE_VALUE;\n}\n\nqint64 SerialPortPrivate::readFromBuffer(char *data, qint64 maxSize)\n{\n    if (readBuffer.isEmpty())\n        return 0;\n\n    if (maxSize == 1) {\n        *data = readBuffer.getChar();\n        return 1;\n    }\n\n    const qint64 bytesToRead = qMin(qint64(readBuffer.size()), maxSize);\n    qint64 readSoFar = 0;\n    while (readSoFar < bytesToRead) {\n        const char *ptr = readBuffer.readPointer();\n        const int bytesToReadFromThisBlock = qMin(int(bytesToRead - readSoFar),\n                                                  readBuffer.nextDataBlockSize());\n        ::memcpy(data + readSoFar, ptr, bytesToReadFromThisBlock);\n        readSoFar += bytesToReadFromThisBlock;\n        readBuffer.free(bytesToReadFromThisBlock);\n    }\n\n    return readSoFar;\n}\n\nqint64 SerialPortPrivate::writeToBuffer(const char *data, qint64 maxSize)\n{\n    char *ptr = writeBuffer.reserve(maxSize);\n    if (maxSize == 1)\n        *ptr = *data;\n    else\n        ::memcpy(ptr, data, maxSize);\n\n    return maxSize;\n}\n\nbool SerialPortPrivate::waitForReadyRead(int msec)\n{\n    if (!readBuffer.isEmpty())\n        return true;\n\n    QElapsedTimer stopWatch;\n\n    stopWatch.start();\n\n    forever {\n        bool readyToRead = false;\n        bool readyToWrite = false;\n        bool timedOut = false;\n        if (!waitForReadOrWrite(&readyToRead, &readyToWrite,\n                                true, !writeBuffer.isEmpty(),\n                                timeoutValue(msec, stopWatch.elapsed()),\n                                &timedOut)) {\n            return false;\n        }\n        if (readyToRead) {\n            if (notifyRead())\n                return true;\n        }\n        if (readyToWrite)\n            notifyWrite();\n    }\n    return false;\n}\n\nbool SerialPortPrivate::waitForBytesWritten(int msec)\n{\n    if (writeBuffer.isEmpty())\n        return false;\n\n    QElapsedTimer stopWatch;\n\n    stopWatch.start();\n\n    forever {\n        bool readyToRead = false;\n        bool readyToWrite = false;\n        bool timedOut = false;\n        if (!waitForReadOrWrite(&readyToRead, &readyToWrite,\n                                true, !writeBuffer.isEmpty(),\n                                timeoutValue(msec, stopWatch.elapsed()),\n                                &timedOut)) {\n            return false;\n        }\n        if (readyToRead) {\n            if (!notifyRead())\n                return false;\n        }\n        if (readyToWrite) {\n            if (notifyWrite())\n                return true;\n        }\n    }\n    return false;\n}\n\nbool SerialPortPrivate::notifyRead()\n{\n    DWORD bytesToRead = (policy == SerialPort::IgnorePolicy) ? ReadChunkSize : 1;\n\n    if (readBufferMaxSize && bytesToRead > (readBufferMaxSize - readBuffer.size())) {\n        bytesToRead = readBufferMaxSize - readBuffer.size();\n        if (bytesToRead == 0) {\n            \/\/ Buffer is full. User must read data from the buffer\n            \/\/ before we can read more from the port.\n            return false;\n        }\n    }\n\n    char *ptr = readBuffer.reserve(bytesToRead);\n\n    DWORD readBytes = 0;\n    bool sucessResult = ::ReadFile(descriptor, ptr, bytesToRead, &readBytes, 0);\n\n    if (!sucessResult) {\n        readBuffer.truncate(bytesToRead);\n        return false;\n    }\n\n    readBuffer.truncate(readBytes);\n\n    \/\/ Process emulate policy.\n    if (flagErrorFromCommEvent) {\n        flagErrorFromCommEvent = false;\n\n        switch (policy) {\n        case SerialPort::SkipPolicy:\n            readBuffer.getChar();\n            return true;\n        case SerialPort::PassZeroPolicy:\n            readBuffer.getChar();\n            readBuffer.putChar('\\0');\n            break;\n        case SerialPort::StopReceivingPolicy:\n            \/\/ FIXME: Maybe need disable read notifier?\n            break;\n        default:\n            break;\n        }\n    }\n\n    if (readBytes > 0)\n        emit q_ptr->readyRead();\n\n    return true;\n}\n\nbool SerialPortPrivate::notifyWrite()\n{\n    const DWORD nextSize = qMin(writeBuffer.nextDataBlockSize(), int(WriteChunkSize));\n    const char *ptr = writeBuffer.readPointer();\n\n    DWORD bytesWritten = 0;\n    bool sucessResult = ::WriteFile(descriptor, ptr, nextSize, &bytesWritten, 0);\n    if (!sucessResult)\n        return false;\n\n    if (sucessResult)\n        writeBuffer.free(bytesWritten);\n\n    if (bytesWritten > 0)\n        emit q_ptr->bytesWritten(bytesWritten);\n\n    return true;\n}\n\nbool SerialPortPrivate::waitForReadOrWrite(bool *selectForRead, bool *selectForWrite,\n                                           bool checkRead, bool checkWrite,\n                                           int msecs, bool *timedOut)\n{\n    \/\/ FIXME: Here the situation is not properly handled with zero timeout:\n    \/\/ breaker can work out before you call a method WaitCommEvent()\n    \/\/ and so it will loop forever!\n    WaitCommEventBreaker breaker(descriptor, qMax(msecs, 0));\n    ::WaitCommEvent(descriptor, &eventMask, 0);\n    breaker.stop();\n\n    if (breaker.isWorked())\n        *timedOut = true;\n\n    if (!breaker.isWorked()) {\n        if (checkRead) {\n            Q_ASSERT(selectForRead);\n            *selectForRead = eventMask & EV_RXCHAR;\n        }\n        if (checkWrite) {\n            Q_ASSERT(selectForWrite);\n            *selectForWrite = eventMask & EV_TXEMPTY;\n        }\n\n        return true;\n    }\n\n    return false;\n}\n\nbool SerialPortPrivate::updateDcb()\n{\n    QMutexLocker locker(&settingsChangeMutex);\n\n    DWORD eventMask = 0;\n    \/\/ Save the event mask\n    if (::GetCommMask(descriptor, &eventMask) == 0)\n        return false;\n\n    \/\/ Break event notifier from WaitCommEvent\n    ::SetCommMask(descriptor, 0);\n    \/\/ Change parameters\n    bool ret = (::SetCommState(descriptor, &currentDcb) != 0);\n    if (!ret)\n        portError = decodeSystemError();\n    \/\/ Restore the event mask\n    ::SetCommMask(descriptor, eventMask);\n\n    return ret;\n}\n\nbool SerialPortPrivate::updateCommTimeouts()\n{\n    if (::SetCommTimeouts(descriptor, &currentCommTimeouts) == 0) {\n        portError = decodeSystemError();\n        return false;\n    }\n    return true;\n}\n\nstatic const QLatin1String defaultPathPostfix(\":\");\n\nQString SerialPortPrivate::portNameToSystemLocation(const QString &port)\n{\n    QString ret = port;\n    if (!ret.contains(defaultPathPostfix))\n        ret.append(defaultPathPostfix);\n    return ret;\n}\n\nQString SerialPortPrivate::portNameFromSystemLocation(const QString &location)\n{\n    QString ret = location;\n    if (ret.contains(defaultPathPostfix))\n        ret.remove(defaultPathPostfix);\n    return ret;\n}\n\n#include \"serialport_wince.moc\"\n\nQT_END_NAMESPACE_SERIALPORT\n<commit_msg>Eliminate the unnecessary variable and condition check<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2012 Denis Shienkov <scapig@yandex.ru>\n** Copyright (C) 2012 Laszlo Papp <lpapp@kde.org>\n** Copyright (C) 2012 Andre Hartmann <aha_1980@gmx.de>\n** Contact: http:\/\/www.qt-project.org\/\n**\n** This file is part of the QtSerialPort 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 \"serialport_win_p.h\"\n\n#include <QtCore\/qelapsedtimer.h>\n\n#include <QtCore\/qthread.h>\n#include <QtCore\/qtimer.h>\n\nQT_BEGIN_NAMESPACE_SERIALPORT\n\nclass SerialPortPrivate;\n\nclass CommEventNotifier : public QThread\n{\n    Q_OBJECT\nsignals:\n    void eventMask(quint32 mask);\n\npublic:\n    CommEventNotifier(DWORD mask, SerialPortPrivate *d, QObject *parent)\n        : QThread(parent), dptr(d), running(true) {\n        connect(this, SIGNAL(eventMask(quint32)), this, SLOT(processNotification(quint32)));\n        ::SetCommMask(dptr->descriptor, mask);\n    }\n\n    virtual ~CommEventNotifier() {\n        running = false;\n        ::SetCommMask(dptr->descriptor, 0);\n        wait();\n    }\n\nprotected:\n    virtual void run() {\n        DWORD mask = 0;\n        while (running) {\n            if (::WaitCommEvent(dptr->descriptor, &mask, 0) != 0) {\n                \/\/ Wait until complete the operation changes the port settings,\n                \/\/ see updateDcb().\n                dptr->settingsChangeMutex.lock();\n                dptr->settingsChangeMutex.unlock();\n                emit eventMask(quint32(mask));\n            }\n        }\n    }\n\nprivate slots:\n    void processNotification(quint32 eventMask) {\n        if (EV_ERR & eventMask)\n            dptr->processIoErrors();\n        if (EV_RXCHAR &eventMask)\n            dptr->notifyRead();\n        if (EV_TXEMPTY & eventMask)\n            dptr->notifyWrite();\n    }\n\nprivate:\n    SerialPortPrivate *dptr;\n    mutable bool running;\n};\n\nclass WaitCommEventBreaker : public QThread\n{\n    Q_OBJECT\npublic:\n    WaitCommEventBreaker(HANDLE descriptor, int timeout, QObject *parent = 0)\n        : QThread(parent), descriptor(descriptor), timeout(timeout), worked(false) {\n        start();\n    }\n\n    virtual ~WaitCommEventBreaker() {\n        stop();\n        wait();\n    }\n\n    void stop() {\n        exit(0);\n    }\n\n    bool isWorked() const {\n        return worked;\n    }\n\nprotected:\n    void run() {\n        QTimer timer;\n        QObject::connect(&timer, SIGNAL(timeout()), this, SLOT(processTimeout()), Qt::DirectConnection);\n        timer.start(timeout);\n        exec();\n        worked = true;\n    }\n\nprivate slots:\n    void processTimeout() {\n        ::SetCommMask(descriptor, 0);\n        stop();\n    }\n\nprivate:\n    HANDLE descriptor;\n    int timeout;\n    mutable bool worked;\n};\n\nSerialPortPrivate::SerialPortPrivate(SerialPort *q)\n    : SerialPortPrivateData(q)\n    , descriptor(INVALID_HANDLE_VALUE)\n    , flagErrorFromCommEvent(0)\n    , eventNotifier(0)\n{\n}\n\nbool SerialPortPrivate::open(QIODevice::OpenMode mode)\n{\n    DWORD desiredAccess = 0;\n    DWORD eventMask = EV_ERR;\n\n    if (mode & QIODevice::ReadOnly) {\n        desiredAccess |= GENERIC_READ;\n        eventMask |= EV_RXCHAR;\n    }\n    if (mode & QIODevice::WriteOnly) {\n        desiredAccess |= GENERIC_WRITE;\n        eventMask |= EV_TXEMPTY;\n    }\n\n    descriptor = ::CreateFile(reinterpret_cast<const wchar_t*>(systemLocation.utf16()),\n                              desiredAccess, 0, 0, OPEN_EXISTING, 0, 0);\n\n    if (descriptor == INVALID_HANDLE_VALUE) {\n        portError = decodeSystemError();\n        return false;\n    }\n\n    if (::GetCommState(descriptor, &restoredDcb) == 0) {\n        portError = decodeSystemError();\n        return false;\n    }\n\n    currentDcb = restoredDcb;\n    currentDcb.fBinary = true;\n    currentDcb.fInX = false;\n    currentDcb.fOutX = false;\n    currentDcb.fAbortOnError = false;\n    currentDcb.fNull = false;\n    currentDcb.fErrorChar = false;\n\n    if (!updateDcb())\n        return false;\n\n    if (::GetCommTimeouts(descriptor, &restoredCommTimeouts) == 0) {\n        portError = decodeSystemError();\n        return false;\n    }\n\n    ::memset(&currentCommTimeouts, 0, sizeof(currentCommTimeouts));\n    currentCommTimeouts.ReadIntervalTimeout = MAXDWORD;\n\n    if (!updateCommTimeouts())\n        return false;\n\n    eventNotifier = new QtAddOn::SerialPort::CommEventNotifier(eventMask, this, q_ptr);\n    eventNotifier->start();\n\n    detectDefaultSettings();\n    return true;\n}\n\nvoid SerialPortPrivate::close()\n{\n    if (eventNotifier) {\n        eventNotifier->deleteLater();\n        eventNotifier = 0;\n    }\n\n    if (restoreSettingsOnClose) {\n        ::SetCommState(descriptor, &restoredDcb);\n        ::SetCommTimeouts(descriptor, &restoredCommTimeouts);\n    }\n\n    ::CloseHandle(descriptor);\n    descriptor = INVALID_HANDLE_VALUE;\n}\n\nqint64 SerialPortPrivate::readFromBuffer(char *data, qint64 maxSize)\n{\n    if (readBuffer.isEmpty())\n        return 0;\n\n    if (maxSize == 1) {\n        *data = readBuffer.getChar();\n        return 1;\n    }\n\n    const qint64 bytesToRead = qMin(qint64(readBuffer.size()), maxSize);\n    qint64 readSoFar = 0;\n    while (readSoFar < bytesToRead) {\n        const char *ptr = readBuffer.readPointer();\n        const int bytesToReadFromThisBlock = qMin(int(bytesToRead - readSoFar),\n                                                  readBuffer.nextDataBlockSize());\n        ::memcpy(data + readSoFar, ptr, bytesToReadFromThisBlock);\n        readSoFar += bytesToReadFromThisBlock;\n        readBuffer.free(bytesToReadFromThisBlock);\n    }\n\n    return readSoFar;\n}\n\nqint64 SerialPortPrivate::writeToBuffer(const char *data, qint64 maxSize)\n{\n    char *ptr = writeBuffer.reserve(maxSize);\n    if (maxSize == 1)\n        *ptr = *data;\n    else\n        ::memcpy(ptr, data, maxSize);\n\n    return maxSize;\n}\n\nbool SerialPortPrivate::waitForReadyRead(int msec)\n{\n    if (!readBuffer.isEmpty())\n        return true;\n\n    QElapsedTimer stopWatch;\n\n    stopWatch.start();\n\n    forever {\n        bool readyToRead = false;\n        bool readyToWrite = false;\n        bool timedOut = false;\n        if (!waitForReadOrWrite(&readyToRead, &readyToWrite,\n                                true, !writeBuffer.isEmpty(),\n                                timeoutValue(msec, stopWatch.elapsed()),\n                                &timedOut)) {\n            return false;\n        }\n        if (readyToRead) {\n            if (notifyRead())\n                return true;\n        }\n        if (readyToWrite)\n            notifyWrite();\n    }\n    return false;\n}\n\nbool SerialPortPrivate::waitForBytesWritten(int msec)\n{\n    if (writeBuffer.isEmpty())\n        return false;\n\n    QElapsedTimer stopWatch;\n\n    stopWatch.start();\n\n    forever {\n        bool readyToRead = false;\n        bool readyToWrite = false;\n        bool timedOut = false;\n        if (!waitForReadOrWrite(&readyToRead, &readyToWrite,\n                                true, !writeBuffer.isEmpty(),\n                                timeoutValue(msec, stopWatch.elapsed()),\n                                &timedOut)) {\n            return false;\n        }\n        if (readyToRead) {\n            if (!notifyRead())\n                return false;\n        }\n        if (readyToWrite) {\n            if (notifyWrite())\n                return true;\n        }\n    }\n    return false;\n}\n\nbool SerialPortPrivate::notifyRead()\n{\n    DWORD bytesToRead = (policy == SerialPort::IgnorePolicy) ? ReadChunkSize : 1;\n\n    if (readBufferMaxSize && bytesToRead > (readBufferMaxSize - readBuffer.size())) {\n        bytesToRead = readBufferMaxSize - readBuffer.size();\n        if (bytesToRead == 0) {\n            \/\/ Buffer is full. User must read data from the buffer\n            \/\/ before we can read more from the port.\n            return false;\n        }\n    }\n\n    char *ptr = readBuffer.reserve(bytesToRead);\n\n    DWORD readBytes = 0;\n    bool sucessResult = ::ReadFile(descriptor, ptr, bytesToRead, &readBytes, 0);\n\n    if (!sucessResult) {\n        readBuffer.truncate(bytesToRead);\n        return false;\n    }\n\n    readBuffer.truncate(readBytes);\n\n    \/\/ Process emulate policy.\n    if (flagErrorFromCommEvent) {\n        flagErrorFromCommEvent = false;\n\n        switch (policy) {\n        case SerialPort::SkipPolicy:\n            readBuffer.getChar();\n            return true;\n        case SerialPort::PassZeroPolicy:\n            readBuffer.getChar();\n            readBuffer.putChar('\\0');\n            break;\n        case SerialPort::StopReceivingPolicy:\n            \/\/ FIXME: Maybe need disable read notifier?\n            break;\n        default:\n            break;\n        }\n    }\n\n    if (readBytes > 0)\n        emit q_ptr->readyRead();\n\n    return true;\n}\n\nbool SerialPortPrivate::notifyWrite()\n{\n    const DWORD nextSize = qMin(writeBuffer.nextDataBlockSize(), int(WriteChunkSize));\n    const char *ptr = writeBuffer.readPointer();\n\n    DWORD bytesWritten = 0;\n    if (::WriteFile(descriptor, ptr, nextSize, &bytesWritten, 0) == 0)\n        return false;\n\n    writeBuffer.free(bytesWritten);\n\n    if (bytesWritten > 0)\n        emit q_ptr->bytesWritten(bytesWritten);\n\n    return true;\n}\n\nbool SerialPortPrivate::waitForReadOrWrite(bool *selectForRead, bool *selectForWrite,\n                                           bool checkRead, bool checkWrite,\n                                           int msecs, bool *timedOut)\n{\n    \/\/ FIXME: Here the situation is not properly handled with zero timeout:\n    \/\/ breaker can work out before you call a method WaitCommEvent()\n    \/\/ and so it will loop forever!\n    WaitCommEventBreaker breaker(descriptor, qMax(msecs, 0));\n    ::WaitCommEvent(descriptor, &eventMask, 0);\n    breaker.stop();\n\n    if (breaker.isWorked())\n        *timedOut = true;\n\n    if (!breaker.isWorked()) {\n        if (checkRead) {\n            Q_ASSERT(selectForRead);\n            *selectForRead = eventMask & EV_RXCHAR;\n        }\n        if (checkWrite) {\n            Q_ASSERT(selectForWrite);\n            *selectForWrite = eventMask & EV_TXEMPTY;\n        }\n\n        return true;\n    }\n\n    return false;\n}\n\nbool SerialPortPrivate::updateDcb()\n{\n    QMutexLocker locker(&settingsChangeMutex);\n\n    DWORD eventMask = 0;\n    \/\/ Save the event mask\n    if (::GetCommMask(descriptor, &eventMask) == 0)\n        return false;\n\n    \/\/ Break event notifier from WaitCommEvent\n    ::SetCommMask(descriptor, 0);\n    \/\/ Change parameters\n    bool ret = (::SetCommState(descriptor, &currentDcb) != 0);\n    if (!ret)\n        portError = decodeSystemError();\n    \/\/ Restore the event mask\n    ::SetCommMask(descriptor, eventMask);\n\n    return ret;\n}\n\nbool SerialPortPrivate::updateCommTimeouts()\n{\n    if (::SetCommTimeouts(descriptor, &currentCommTimeouts) == 0) {\n        portError = decodeSystemError();\n        return false;\n    }\n    return true;\n}\n\nstatic const QLatin1String defaultPathPostfix(\":\");\n\nQString SerialPortPrivate::portNameToSystemLocation(const QString &port)\n{\n    QString ret = port;\n    if (!ret.contains(defaultPathPostfix))\n        ret.append(defaultPathPostfix);\n    return ret;\n}\n\nQString SerialPortPrivate::portNameFromSystemLocation(const QString &location)\n{\n    QString ret = location;\n    if (ret.contains(defaultPathPostfix))\n        ret.remove(defaultPathPostfix);\n    return ret;\n}\n\n#include \"serialport_wince.moc\"\n\nQT_END_NAMESPACE_SERIALPORT\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\/cros\/burn_library.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/observer_list.h\"\n#include \"chrome\/browser\/chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chrome\/browser\/chromeos\/dbus\/image_burner_client.h\"\n#include \"chrome\/browser\/chromeos\/disks\/disk_mount_manager.h\"\n#include \"chrome\/common\/zip.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n\nusing content::BrowserThread;\n\nnamespace chromeos {\n\nnamespace {\n\n\/\/ Unzips |source_zip_file| and calls |callback| with the filename of\n\/\/ the unzipped image.\nvoid UnzipImage(\n    const FilePath& source_zip_file,\n    const std::string& image_name,\n    base::Callback<void(const std::string& source_image_file)> callback) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::FILE));\n\n  std::string source_image_file;\n  if (zip::Unzip(source_zip_file, source_zip_file.DirName())) {\n    source_image_file =\n        source_zip_file.DirName().Append(image_name).value();\n  }\n  BrowserThread::PostTask(\n      BrowserThread::UI, FROM_HERE, base::Bind(callback, source_image_file));\n}\n\nclass BurnLibraryImpl : public BurnLibrary {\n public:\n  BurnLibraryImpl();\n  virtual ~BurnLibraryImpl();\n\n  \/\/ BurnLibrary implementation.\n  virtual void AddObserver(Observer* observer) OVERRIDE;\n  virtual void RemoveObserver(Observer* observer) OVERRIDE;\n  virtual void DoBurn(const FilePath& source_path,\n                      const std::string& image_name,\n                      const FilePath& target_file_path,\n                      const FilePath& target_device_path) OVERRIDE;\n  virtual void CancelBurnImage() OVERRIDE;\n\n  void OnImageUnzipped(const std::string& source_image_file);\n\n private:\n  void Init();\n  void BurnImage();\n  static void DevicesUnmountedCallback(void* object, bool success);\n  void UpdateBurnStatus(const ImageBurnStatus& status, BurnEvent evt);\n  void OnBurnFinished(const std::string& target_path,\n                      bool success,\n                      const std::string& error);\n  void OnBurnProgressUpdate(const std::string& target_path,\n                            int64 num_bytes_burnt,\n                            int64 total_size);\n  void OnBurnImageFail();\n\n  base::WeakPtrFactory<BurnLibraryImpl> weak_ptr_factory_;\n\n  ObserverList<BurnLibrary::Observer> observers_;\n\n  std::string source_image_file_;\n  std::string target_file_path_;\n  std::string target_device_path_;\n\n  bool unzipping_;\n  bool cancelled_;\n  bool burning_;\n  bool block_burn_signals_;\n\n  DISALLOW_COPY_AND_ASSIGN(BurnLibraryImpl);\n};\n\nBurnLibraryImpl::BurnLibraryImpl()\n    : weak_ptr_factory_(this),\n      unzipping_(false),\n      cancelled_(false),\n      burning_(false),\n      block_burn_signals_(false) {\n}\n\nBurnLibraryImpl::~BurnLibraryImpl() {\n  DBusThreadManager::Get()->GetImageBurnerClient()->ResetEventHandlers();\n}\n\nvoid BurnLibraryImpl::Init() {\n  DBusThreadManager::Get()->GetImageBurnerClient()->SetEventHandlers(\n      base::Bind(&BurnLibraryImpl::OnBurnFinished,\n                 weak_ptr_factory_.GetWeakPtr()),\n      base::Bind(&BurnLibraryImpl::OnBurnProgressUpdate,\n                 weak_ptr_factory_.GetWeakPtr()));\n}\n\nvoid BurnLibraryImpl::AddObserver(Observer* observer) {\n  observers_.AddObserver(observer);\n  if (unzipping_ && !cancelled_)\n    UpdateBurnStatus(ImageBurnStatus(), UNZIP_STARTED);\n}\n\nvoid BurnLibraryImpl::RemoveObserver(Observer* observer) {\n  observers_.RemoveObserver(observer);\n}\n\nvoid BurnLibraryImpl::CancelBurnImage() {\n  \/\/ At the moment, we cannot really stop uzipping or burning. Instead we\n  \/\/ prevent events from being send to listeners.\n  if (burning_)\n    block_burn_signals_ = true;\n  cancelled_ = true;\n}\n\nvoid BurnLibraryImpl::DoBurn(const FilePath& source_path,\n    const std::string& image_name,\n    const FilePath& target_file_path,\n    const FilePath& target_device_path) {\n  if (unzipping_) {\n    \/\/ We have unzip in progress, maybe it was \"cancelled\" before and did not\n    \/\/ finish yet. In that case, let's pretend cancel did not happen.\n    cancelled_ = false;\n    UpdateBurnStatus(ImageBurnStatus(), UNZIP_STARTED);\n    return;\n  }\n\n  source_image_file_.clear();\n  target_file_path_ = target_file_path.value();\n  target_device_path_ = target_device_path.value();\n\n  unzipping_ = true;\n  cancelled_ = false;\n  UpdateBurnStatus(ImageBurnStatus(), UNZIP_STARTED);\n\n  BrowserThread::PostTask(\n      BrowserThread::FILE,\n      FROM_HERE,\n      base::Bind(UnzipImage,\n                 source_path,\n                 image_name,\n                 base::Bind(&BurnLibraryImpl::OnImageUnzipped,\n                            weak_ptr_factory_.GetWeakPtr())));\n}\n\nvoid BurnLibraryImpl::OnImageUnzipped(const std::string& source_image_file) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  source_image_file_ = source_image_file;\n\n  bool success = !source_image_file_.empty();\n  UpdateBurnStatus(ImageBurnStatus(), (success ? UNZIP_COMPLETE : UNZIP_FAIL));\n\n  unzipping_ = false;\n  if (cancelled_) {\n    cancelled_ = false;\n    return;\n  }\n\n  if (!success)\n    return;\n\n  burning_ = true;\n\n  chromeos::disks::DiskMountManager::GetInstance()->\n      UnmountDeviceRecursive(target_device_path_,\n                             &BurnLibraryImpl::DevicesUnmountedCallback,\n                             this);\n}\n\nvoid BurnLibraryImpl::OnBurnFinished(const std::string& target_path,\n                                     bool success,\n                                     const std::string& error) {\n  UpdateBurnStatus(ImageBurnStatus(0, 0), success ? BURN_SUCCESS : BURN_FAIL);\n}\n\nvoid BurnLibraryImpl::OnBurnProgressUpdate(const std::string& target_path,\n                                           int64 amount_burnt,\n                                           int64 total_size) {\n  UpdateBurnStatus(ImageBurnStatus(amount_burnt, total_size), BURN_UPDATE);\n}\n\nvoid BurnLibraryImpl::OnBurnImageFail() {\n  UpdateBurnStatus(ImageBurnStatus(0, 0), BURN_FAIL);\n}\n\nvoid BurnLibraryImpl::DevicesUnmountedCallback(void* object, bool success) {\n  DCHECK(object);\n  BurnLibraryImpl* self = static_cast<BurnLibraryImpl*>(object);\n  if (success) {\n    self->BurnImage();\n  } else {\n    self->UpdateBurnStatus(ImageBurnStatus(0, 0), BURN_FAIL);\n  }\n}\n\nvoid BurnLibraryImpl::BurnImage() {\n  DBusThreadManager::Get()->GetImageBurnerClient()->BurnImage(\n      source_image_file_,\n      target_file_path_,\n      base::Bind(&BurnLibraryImpl::OnBurnImageFail,\n                 weak_ptr_factory_.GetWeakPtr()));\n}\n\nvoid BurnLibraryImpl::UpdateBurnStatus(const ImageBurnStatus& status,\n                                       BurnEvent evt) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n  if (cancelled_)\n    return;\n\n  if (evt == BURN_FAIL || evt == BURN_SUCCESS) {\n    burning_ = false;\n    if (block_burn_signals_) {\n      block_burn_signals_ = false;\n      return;\n    }\n  }\n\n  if (block_burn_signals_ && evt == BURN_UPDATE)\n    return;\n\n  FOR_EACH_OBSERVER(Observer, observers_,\n      BurnProgressUpdated(this, evt, status));\n}\n\nclass BurnLibraryStubImpl : public BurnLibrary {\n public:\n  BurnLibraryStubImpl() {}\n  virtual ~BurnLibraryStubImpl() {}\n\n  \/\/ BurnLibrary overrides.\n  virtual void Init() OVERRIDE {}\n  virtual void AddObserver(Observer* observer) OVERRIDE {}\n  virtual void RemoveObserver(Observer* observer) OVERRIDE {}\n  virtual void DoBurn(const FilePath& source_path,\n                      const std::string& image_name,\n                      const FilePath& target_file_path,\n                      const FilePath& target_device_path) OVERRIDE {\n  }\n  virtual void CancelBurnImage() OVERRIDE {}\n\n  DISALLOW_COPY_AND_ASSIGN(BurnLibraryStubImpl);\n};\n\n}  \/\/ namespace\n\n\/\/ static\nBurnLibrary* BurnLibrary::GetImpl(bool stub) {\n  BurnLibrary* impl;\n  if (stub)\n    impl = new BurnLibraryStubImpl();\n  else\n    impl = new BurnLibraryImpl();\n  impl->Init();\n  return impl;\n}\n\n}  \/\/ namespace chromeos\n<commit_msg>Use WorkerPool for unzipping recovery image to avoid blocking FILE thread for long time.<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\/cros\/burn_library.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/location.h\"\n#include \"base\/memory\/ref_counted_memory.h\"\n#include \"base\/observer_list.h\"\n#include \"base\/threading\/worker_pool.h\"\n#include \"chrome\/browser\/chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chrome\/browser\/chromeos\/dbus\/image_burner_client.h\"\n#include \"chrome\/browser\/chromeos\/disks\/disk_mount_manager.h\"\n#include \"chrome\/common\/zip.h\"\n\nnamespace chromeos {\n\nnamespace {\n\n\/\/ Unzips |source_zip_file| and sets the filename of the unzipped image to\n\/\/ |source_image_file|.\nvoid UnzipImage(const FilePath& source_zip_file,\n                const std::string& image_name,\n                scoped_refptr<base::RefCountedString> source_image_file) {\n  if (zip::Unzip(source_zip_file, source_zip_file.DirName())) {\n    source_image_file->data() =\n        source_zip_file.DirName().Append(image_name).value();\n  }\n}\n\nclass BurnLibraryImpl : public BurnLibrary {\n public:\n  BurnLibraryImpl();\n  virtual ~BurnLibraryImpl();\n\n  \/\/ BurnLibrary implementation.\n  virtual void AddObserver(Observer* observer) OVERRIDE;\n  virtual void RemoveObserver(Observer* observer) OVERRIDE;\n  virtual void DoBurn(const FilePath& source_path,\n                      const std::string& image_name,\n                      const FilePath& target_file_path,\n                      const FilePath& target_device_path) OVERRIDE;\n  virtual void CancelBurnImage() OVERRIDE;\n\n  void OnImageUnzipped(scoped_refptr<base::RefCountedString> source_image_file);\n\n private:\n  void Init();\n  void BurnImage();\n  static void DevicesUnmountedCallback(void* object, bool success);\n  void UpdateBurnStatus(const ImageBurnStatus& status, BurnEvent evt);\n  void OnBurnFinished(const std::string& target_path,\n                      bool success,\n                      const std::string& error);\n  void OnBurnProgressUpdate(const std::string& target_path,\n                            int64 num_bytes_burnt,\n                            int64 total_size);\n  void OnBurnImageFail();\n\n  base::WeakPtrFactory<BurnLibraryImpl> weak_ptr_factory_;\n\n  ObserverList<BurnLibrary::Observer> observers_;\n\n  std::string source_image_file_;\n  std::string target_file_path_;\n  std::string target_device_path_;\n\n  bool unzipping_;\n  bool cancelled_;\n  bool burning_;\n  bool block_burn_signals_;\n\n  DISALLOW_COPY_AND_ASSIGN(BurnLibraryImpl);\n};\n\nBurnLibraryImpl::BurnLibraryImpl()\n    : weak_ptr_factory_(this),\n      unzipping_(false),\n      cancelled_(false),\n      burning_(false),\n      block_burn_signals_(false) {\n}\n\nBurnLibraryImpl::~BurnLibraryImpl() {\n  DBusThreadManager::Get()->GetImageBurnerClient()->ResetEventHandlers();\n}\n\nvoid BurnLibraryImpl::Init() {\n  DBusThreadManager::Get()->GetImageBurnerClient()->SetEventHandlers(\n      base::Bind(&BurnLibraryImpl::OnBurnFinished,\n                 weak_ptr_factory_.GetWeakPtr()),\n      base::Bind(&BurnLibraryImpl::OnBurnProgressUpdate,\n                 weak_ptr_factory_.GetWeakPtr()));\n}\n\nvoid BurnLibraryImpl::AddObserver(Observer* observer) {\n  observers_.AddObserver(observer);\n  if (unzipping_ && !cancelled_)\n    UpdateBurnStatus(ImageBurnStatus(), UNZIP_STARTED);\n}\n\nvoid BurnLibraryImpl::RemoveObserver(Observer* observer) {\n  observers_.RemoveObserver(observer);\n}\n\nvoid BurnLibraryImpl::CancelBurnImage() {\n  \/\/ At the moment, we cannot really stop uzipping or burning. Instead we\n  \/\/ prevent events from being send to listeners.\n  if (burning_)\n    block_burn_signals_ = true;\n  cancelled_ = true;\n}\n\nvoid BurnLibraryImpl::DoBurn(const FilePath& source_path,\n    const std::string& image_name,\n    const FilePath& target_file_path,\n    const FilePath& target_device_path) {\n  if (unzipping_) {\n    \/\/ We have unzip in progress, maybe it was \"cancelled\" before and did not\n    \/\/ finish yet. In that case, let's pretend cancel did not happen.\n    cancelled_ = false;\n    UpdateBurnStatus(ImageBurnStatus(), UNZIP_STARTED);\n    return;\n  }\n\n  source_image_file_.clear();\n  target_file_path_ = target_file_path.value();\n  target_device_path_ = target_device_path.value();\n\n  unzipping_ = true;\n  cancelled_ = false;\n  UpdateBurnStatus(ImageBurnStatus(), UNZIP_STARTED);\n\n  const bool task_is_slow = true;\n  scoped_refptr<base::RefCountedString> result(new base::RefCountedString);\n  base::WorkerPool::PostTaskAndReply(\n      FROM_HERE,\n      base::Bind(UnzipImage, source_path, image_name, result),\n      base::Bind(&BurnLibraryImpl::OnImageUnzipped,\n                 weak_ptr_factory_.GetWeakPtr(),\n                 result),\n      task_is_slow);\n}\n\nvoid BurnLibraryImpl::OnImageUnzipped(\n    scoped_refptr<base::RefCountedString> source_image_file) {\n  source_image_file_ = source_image_file->data();\n\n  bool success = !source_image_file_.empty();\n  UpdateBurnStatus(ImageBurnStatus(), (success ? UNZIP_COMPLETE : UNZIP_FAIL));\n\n  unzipping_ = false;\n  if (cancelled_) {\n    cancelled_ = false;\n    return;\n  }\n\n  if (!success)\n    return;\n\n  burning_ = true;\n\n  chromeos::disks::DiskMountManager::GetInstance()->\n      UnmountDeviceRecursive(target_device_path_,\n                             &BurnLibraryImpl::DevicesUnmountedCallback,\n                             this);\n}\n\nvoid BurnLibraryImpl::OnBurnFinished(const std::string& target_path,\n                                     bool success,\n                                     const std::string& error) {\n  UpdateBurnStatus(ImageBurnStatus(0, 0), success ? BURN_SUCCESS : BURN_FAIL);\n}\n\nvoid BurnLibraryImpl::OnBurnProgressUpdate(const std::string& target_path,\n                                           int64 amount_burnt,\n                                           int64 total_size) {\n  UpdateBurnStatus(ImageBurnStatus(amount_burnt, total_size), BURN_UPDATE);\n}\n\nvoid BurnLibraryImpl::OnBurnImageFail() {\n  UpdateBurnStatus(ImageBurnStatus(0, 0), BURN_FAIL);\n}\n\nvoid BurnLibraryImpl::DevicesUnmountedCallback(void* object, bool success) {\n  DCHECK(object);\n  BurnLibraryImpl* self = static_cast<BurnLibraryImpl*>(object);\n  if (success) {\n    self->BurnImage();\n  } else {\n    self->UpdateBurnStatus(ImageBurnStatus(0, 0), BURN_FAIL);\n  }\n}\n\nvoid BurnLibraryImpl::BurnImage() {\n  DBusThreadManager::Get()->GetImageBurnerClient()->BurnImage(\n      source_image_file_,\n      target_file_path_,\n      base::Bind(&BurnLibraryImpl::OnBurnImageFail,\n                 weak_ptr_factory_.GetWeakPtr()));\n}\n\nvoid BurnLibraryImpl::UpdateBurnStatus(const ImageBurnStatus& status,\n                                       BurnEvent evt) {\n  if (cancelled_)\n    return;\n\n  if (evt == BURN_FAIL || evt == BURN_SUCCESS) {\n    burning_ = false;\n    if (block_burn_signals_) {\n      block_burn_signals_ = false;\n      return;\n    }\n  }\n\n  if (block_burn_signals_ && evt == BURN_UPDATE)\n    return;\n\n  FOR_EACH_OBSERVER(Observer, observers_,\n      BurnProgressUpdated(this, evt, status));\n}\n\nclass BurnLibraryStubImpl : public BurnLibrary {\n public:\n  BurnLibraryStubImpl() {}\n  virtual ~BurnLibraryStubImpl() {}\n\n  \/\/ BurnLibrary overrides.\n  virtual void Init() OVERRIDE {}\n  virtual void AddObserver(Observer* observer) OVERRIDE {}\n  virtual void RemoveObserver(Observer* observer) OVERRIDE {}\n  virtual void DoBurn(const FilePath& source_path,\n                      const std::string& image_name,\n                      const FilePath& target_file_path,\n                      const FilePath& target_device_path) OVERRIDE {\n  }\n  virtual void CancelBurnImage() OVERRIDE {}\n\n  DISALLOW_COPY_AND_ASSIGN(BurnLibraryStubImpl);\n};\n\n}  \/\/ namespace\n\n\/\/ static\nBurnLibrary* BurnLibrary::GetImpl(bool stub) {\n  BurnLibrary* impl;\n  if (stub)\n    impl = new BurnLibraryStubImpl();\n  else\n    impl = new BurnLibraryImpl();\n  impl->Init();\n  return impl;\n}\n\n}  \/\/ namespace chromeos\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  This file is part of Ingen.\n  Copyright 2007-2012 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 Affero General Public License as published by the Free\n  Software Foundation, either version 3 of the License, or any later 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 FOR\n  A PARTICULAR PURPOSE.  See the GNU Affero General Public License for details.\n\n  You should have received a copy of the GNU Affero General Public License\n  along with Ingen.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cstdlib>\n#include <cassert>\n\n#include \"ingen\/Patch.hpp\"\n\n#include \"AudioBuffer.hpp\"\n#include \"BufferFactory.hpp\"\n#include \"EdgeImpl.hpp\"\n#include \"Engine.hpp\"\n#include \"InputPort.hpp\"\n#include \"NodeImpl.hpp\"\n#include \"Notification.hpp\"\n#include \"OutputPort.hpp\"\n#include \"ProcessContext.hpp\"\n#include \"ThreadManager.hpp\"\n#include \"ingen\/shared\/URIs.hpp\"\n#include \"mix.hpp\"\n#include \"util.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\nnamespace Server {\n\nInputPort::InputPort(BufferFactory&      bufs,\n                     NodeImpl*           parent,\n                     const Raul::Symbol& symbol,\n                     uint32_t            index,\n                     uint32_t            poly,\n                     PortType            type,\n                     LV2_URID            buffer_type,\n                     const Raul::Atom&   value,\n                     size_t              buffer_size)\n\t: PortImpl(bufs, parent, symbol, index, poly, type, buffer_type, value, buffer_size)\n\t, _num_edges(0)\n{\n\tconst Ingen::Shared::URIs& uris = bufs.uris();\n\n\tif (!dynamic_cast<Patch*>(parent))\n\t\tadd_property(uris.rdf_type, uris.lv2_InputPort);\n\n\t\/\/ Set default control range\n\tif (type == PortType::CONTROL || type == PortType::CV) {\n\t\tset_property(uris.lv2_minimum, bufs.forge().make(0.0f));\n\t\tset_property(uris.lv2_maximum, bufs.forge().make(1.0f));\n\t}\n}\n\nbool\nInputPort::apply_poly(ProcessContext& context, Raul::Maid& maid, uint32_t poly)\n{\n\tbool ret = PortImpl::apply_poly(context, maid, poly);\n\tif (!ret)\n\t\tpoly = 1;\n\n\tassert(_buffers->size() >= poly);\n\n\treturn true;\n}\n\n\/** Set @a buffers to the buffers to be used for this port.\n * @return true iff buffers are locally owned by the port\n *\/\nbool\nInputPort::get_buffers(Context&                context,\n                       BufferFactory&          bufs,\n                       Raul::Array<BufferRef>* buffers,\n                       uint32_t                poly) const\n{\n\tconst bool is_process_context = bufs.engine().is_process_context(context);\n\tsize_t num_edges = is_process_context ? _edges.size() : _num_edges;\n\n\tif (is_a(PortType::AUDIO) && num_edges == 0) {\n\t\t\/\/ Audio input with no edges, use shared zero buffer\n\t\tfor (uint32_t v = 0; v < poly; ++v)\n\t\t\tbuffers->at(v) = bufs.silent_buffer();\n\t\treturn false;\n\n\t} else if (num_edges == 1) {\n\t\tif (is_process_context) {\n\t\t\tif (!_edges.front().must_mix() &&\n\t\t\t    !_edges.front().must_queue()) {\n\t\t\t\t\/\/ Single non-mixing connection, use buffers directly\n\t\t\t\tfor (uint32_t v = 0; v < poly; ++v)\n\t\t\t\t\tbuffers->at(v) = _edges.front().buffer(v);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Otherwise, allocate local buffers\n\tfor (uint32_t v = 0; v < poly; ++v) {\n\t\tbuffers->at(v) = _bufs.get(context, buffer_type(), _buffer_size);\n\t\tbuffers->at(v)->clear();\n\t}\n\treturn true;\n}\n\n\/** Add a edge.  Realtime safe.\n *\n * The buffer of this port will be set directly to the edge's buffer\n * if there is only one edge, since no copying\/mixing needs to take place.\n *\n * Note that setup_buffers must be called after this before the change\n * will audibly take effect.\n *\/\nvoid\nInputPort::add_edge(ProcessContext& context, EdgeImpl* c)\n{\n\t_edges.push_front(*c);\n\t_broadcast = true;\t\/\/ Broadcast value\/activity of connected input\n}\n\n\/** Remove a edge.  Realtime safe.\n *\n * Note that setup_buffers must be called after this before the change\n * will audibly take effect.\n *\/\nEdgeImpl*\nInputPort::remove_edge(ProcessContext& context, const OutputPort* tail)\n{\n\tEdgeImpl* edge = NULL;\n\tfor (Edges::iterator i = _edges.begin(); i != _edges.end(); ++i) {\n\t\tif (i->tail() == tail) {\n\t\t\tedge = &*i;\n\t\t\t_edges.erase(i);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (!edge) {\n\t\tRaul::error << \"[InputPort::remove_edge] Edge not found!\"\n\t\t            << std::endl;\n\t\treturn NULL;\n\t}\n\n\t\/\/ Turn off broadcasting if we're no longer connected\n\tif (_edges.empty()) {\n\t\tif (is_a(PortType::AUDIO)) {\n\t\t\t\/\/ Send an update peak of 0.0 to reset to silence\n\t\t\tconst Notification note = Notification::make(\n\t\t\t\tNotification::PORT_ACTIVITY, context.start(), this,\n\t\t\t\tcontext.engine().world()->forge().make(0.0f));\n\t\t\tcontext.event_sink().write(sizeof(note), &note);\n\t\t}\n\t\t_broadcast = false;\n\t}\n\n\treturn edge;\n}\n\n\/** Prepare buffer for access, mixing if necessary.  Realtime safe.\n *\/\nvoid\nInputPort::pre_process(Context& context)\n{\n\t\/\/ If value has been set (e.g. events pushed) by the user, don't smash it\n\tif (_set_by_user)\n\t\treturn;\n\n\tif (_edges.empty()) {\n\t\tfor (uint32_t v = 0; v < _poly; ++v) {\n\t\t\tbuffer(v)->prepare_read(context);\n\t\t}\n\t} else if (direct_connect()) {\n\t\tfor (uint32_t v = 0; v < _poly; ++v) {\n\t\t\t_buffers->at(v) = _edges.front().buffer(v);\n\t\t\t_buffers->at(v)->prepare_read(context);\n\t\t}\n\t} else {\n\t\tuint32_t max_num_srcs = 0;\n\t\tfor (Edges::const_iterator e = _edges.begin(); e != _edges.end(); ++e) {\n\t\t\tmax_num_srcs += e->tail()->poly();\n\t\t}\n\n\t\tBuffer* srcs[max_num_srcs];\n\t\tfor (uint32_t v = 0; v < _poly; ++v) {\n\t\t\tuint32_t num_srcs = 0;\n\t\t\tfor (Edges::iterator e = _edges.begin(); e != _edges.end(); ++e) {\n\t\t\t\te->get_sources(context, v, srcs, max_num_srcs, num_srcs);\n\t\t\t}\n\n\t\t\tmix(context, bufs().uris(), buffer(v).get(), srcs, num_srcs);\n\t\t\tbuffer(v)->prepare_read(context);\n\t\t}\n\t}\n\n\tif (_broadcast)\n\t\tbroadcast_value(context, false);\n}\n\nvoid\nInputPort::post_process(Context& context)\n{\n\tif (_set_by_user) {\n\t\tif (_buffer_type == _bufs.uris().atom_Sequence) {\n\t\t\t\/\/ Clear events received via a SetPortValue\n\t\t\tfor (uint32_t v = 0; v < _poly; ++v) {\n\t\t\t\tbuffer(v)->clear();\n\t\t\t}\n\t\t}\n\t\t_set_by_user = false;\n\t}\n}\n\nbool\nInputPort::direct_connect() const\n{\n\treturn _edges.size() == 1\n\t\t&& !_edges.front().must_mix()\n\t\t&& !_edges.front().must_queue();\n}\n\n} \/\/ namespace Server\n} \/\/ namespace Ingen\n\n<commit_msg>Avoid possibly creating a variable length array of size 0.<commit_after>\/*\n  This file is part of Ingen.\n  Copyright 2007-2012 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 Affero General Public License as published by the Free\n  Software Foundation, either version 3 of the License, or any later 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 FOR\n  A PARTICULAR PURPOSE.  See the GNU Affero General Public License for details.\n\n  You should have received a copy of the GNU Affero General Public License\n  along with Ingen.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cstdlib>\n#include <cassert>\n\n#include \"ingen\/Patch.hpp\"\n\n#include \"AudioBuffer.hpp\"\n#include \"BufferFactory.hpp\"\n#include \"EdgeImpl.hpp\"\n#include \"Engine.hpp\"\n#include \"InputPort.hpp\"\n#include \"NodeImpl.hpp\"\n#include \"Notification.hpp\"\n#include \"OutputPort.hpp\"\n#include \"ProcessContext.hpp\"\n#include \"ThreadManager.hpp\"\n#include \"ingen\/shared\/URIs.hpp\"\n#include \"mix.hpp\"\n#include \"util.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\nnamespace Server {\n\nInputPort::InputPort(BufferFactory&      bufs,\n                     NodeImpl*           parent,\n                     const Raul::Symbol& symbol,\n                     uint32_t            index,\n                     uint32_t            poly,\n                     PortType            type,\n                     LV2_URID            buffer_type,\n                     const Raul::Atom&   value,\n                     size_t              buffer_size)\n\t: PortImpl(bufs, parent, symbol, index, poly, type, buffer_type, value, buffer_size)\n\t, _num_edges(0)\n{\n\tconst Ingen::Shared::URIs& uris = bufs.uris();\n\n\tif (!dynamic_cast<Patch*>(parent))\n\t\tadd_property(uris.rdf_type, uris.lv2_InputPort);\n\n\t\/\/ Set default control range\n\tif (type == PortType::CONTROL || type == PortType::CV) {\n\t\tset_property(uris.lv2_minimum, bufs.forge().make(0.0f));\n\t\tset_property(uris.lv2_maximum, bufs.forge().make(1.0f));\n\t}\n}\n\nbool\nInputPort::apply_poly(ProcessContext& context, Raul::Maid& maid, uint32_t poly)\n{\n\tbool ret = PortImpl::apply_poly(context, maid, poly);\n\tif (!ret)\n\t\tpoly = 1;\n\n\tassert(_buffers->size() >= poly);\n\n\treturn true;\n}\n\n\/** Set @a buffers to the buffers to be used for this port.\n * @return true iff buffers are locally owned by the port\n *\/\nbool\nInputPort::get_buffers(Context&                context,\n                       BufferFactory&          bufs,\n                       Raul::Array<BufferRef>* buffers,\n                       uint32_t                poly) const\n{\n\tconst bool is_process_context = bufs.engine().is_process_context(context);\n\tsize_t num_edges = is_process_context ? _edges.size() : _num_edges;\n\n\tif (is_a(PortType::AUDIO) && num_edges == 0) {\n\t\t\/\/ Audio input with no edges, use shared zero buffer\n\t\tfor (uint32_t v = 0; v < poly; ++v)\n\t\t\tbuffers->at(v) = bufs.silent_buffer();\n\t\treturn false;\n\n\t} else if (num_edges == 1) {\n\t\tif (is_process_context) {\n\t\t\tif (!_edges.front().must_mix() &&\n\t\t\t    !_edges.front().must_queue()) {\n\t\t\t\t\/\/ Single non-mixing connection, use buffers directly\n\t\t\t\tfor (uint32_t v = 0; v < poly; ++v)\n\t\t\t\t\tbuffers->at(v) = _edges.front().buffer(v);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Otherwise, allocate local buffers\n\tfor (uint32_t v = 0; v < poly; ++v) {\n\t\tbuffers->at(v) = _bufs.get(context, buffer_type(), _buffer_size);\n\t\tbuffers->at(v)->clear();\n\t}\n\treturn true;\n}\n\n\/** Add a edge.  Realtime safe.\n *\n * The buffer of this port will be set directly to the edge's buffer\n * if there is only one edge, since no copying\/mixing needs to take place.\n *\n * Note that setup_buffers must be called after this before the change\n * will audibly take effect.\n *\/\nvoid\nInputPort::add_edge(ProcessContext& context, EdgeImpl* c)\n{\n\t_edges.push_front(*c);\n\t_broadcast = true;\t\/\/ Broadcast value\/activity of connected input\n}\n\n\/** Remove a edge.  Realtime safe.\n *\n * Note that setup_buffers must be called after this before the change\n * will audibly take effect.\n *\/\nEdgeImpl*\nInputPort::remove_edge(ProcessContext& context, const OutputPort* tail)\n{\n\tEdgeImpl* edge = NULL;\n\tfor (Edges::iterator i = _edges.begin(); i != _edges.end(); ++i) {\n\t\tif (i->tail() == tail) {\n\t\t\tedge = &*i;\n\t\t\t_edges.erase(i);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (!edge) {\n\t\tRaul::error << \"[InputPort::remove_edge] Edge not found!\"\n\t\t            << std::endl;\n\t\treturn NULL;\n\t}\n\n\t\/\/ Turn off broadcasting if we're no longer connected\n\tif (_edges.empty()) {\n\t\tif (is_a(PortType::AUDIO)) {\n\t\t\t\/\/ Send an update peak of 0.0 to reset to silence\n\t\t\tconst Notification note = Notification::make(\n\t\t\t\tNotification::PORT_ACTIVITY, context.start(), this,\n\t\t\t\tcontext.engine().world()->forge().make(0.0f));\n\t\t\tcontext.event_sink().write(sizeof(note), &note);\n\t\t}\n\t\t_broadcast = false;\n\t}\n\n\treturn edge;\n}\n\n\/** Prepare buffer for access, mixing if necessary.  Realtime safe.\n *\/\nvoid\nInputPort::pre_process(Context& context)\n{\n\t\/\/ If value has been set (e.g. events pushed) by the user, don't smash it\n\tif (_set_by_user)\n\t\treturn;\n\n\tif (_edges.empty()) {\n\t\tfor (uint32_t v = 0; v < _poly; ++v) {\n\t\t\tbuffer(v)->prepare_read(context);\n\t\t}\n\t} else if (direct_connect()) {\n\t\tfor (uint32_t v = 0; v < _poly; ++v) {\n\t\t\t_buffers->at(v) = _edges.front().buffer(v);\n\t\t\t_buffers->at(v)->prepare_read(context);\n\t\t}\n\t} else {\n\t\tuint32_t max_num_srcs = 1;\n\t\tfor (Edges::const_iterator e = _edges.begin(); e != _edges.end(); ++e) {\n\t\t\tmax_num_srcs += e->tail()->poly();\n\t\t}\n\n\t\tBuffer* srcs[max_num_srcs];\n\t\tfor (uint32_t v = 0; v < _poly; ++v) {\n\t\t\tuint32_t num_srcs = 0;\n\t\t\tfor (Edges::iterator e = _edges.begin(); e != _edges.end(); ++e) {\n\t\t\t\te->get_sources(context, v, srcs, max_num_srcs, num_srcs);\n\t\t\t}\n\n\t\t\tmix(context, bufs().uris(), buffer(v).get(), srcs, num_srcs);\n\t\t\tbuffer(v)->prepare_read(context);\n\t\t}\n\t}\n\n\tif (_broadcast)\n\t\tbroadcast_value(context, false);\n}\n\nvoid\nInputPort::post_process(Context& context)\n{\n\tif (_set_by_user) {\n\t\tif (_buffer_type == _bufs.uris().atom_Sequence) {\n\t\t\t\/\/ Clear events received via a SetPortValue\n\t\t\tfor (uint32_t v = 0; v < _poly; ++v) {\n\t\t\t\tbuffer(v)->clear();\n\t\t\t}\n\t\t}\n\t\t_set_by_user = false;\n\t}\n}\n\nbool\nInputPort::direct_connect() const\n{\n\treturn _edges.size() == 1\n\t\t&& !_edges.front().must_mix()\n\t\t&& !_edges.front().must_queue();\n}\n\n} \/\/ namespace Server\n} \/\/ namespace Ingen\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>[App] [skip ci] - Fix python new references leaking<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n  This file is part of Ingen.\n  Copyright 2007-2015 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 Affero General Public License as published by the Free\n  Software Foundation, either version 3 of the License, or any later 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 FOR\n  A PARTICULAR PURPOSE.  See the GNU Affero General Public License for details.\n\n  You should have received a copy of the GNU Affero General Public License\n  along with Ingen.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n\n#include \"ingen\/Log.hpp\"\n#include \"ingen\/URIs.hpp\"\n#include \"lv2\/lv2plug.in\/ns\/ext\/presets\/presets.h\"\n\n#include \"Driver.hpp\"\n#include \"Engine.hpp\"\n#include \"LV2Block.hpp\"\n#include \"LV2Plugin.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\nnamespace Server {\n\nLV2Plugin::LV2Plugin(World* world, const LilvPlugin* lplugin)\n\t: PluginImpl(world->uris(),\n\t             world->uris().lv2_Plugin.urid,\n\t             Raul::URI(lilv_node_as_uri(lilv_plugin_get_uri(lplugin))))\n\t, _world(world)\n\t, _lilv_plugin(lplugin)\n{\n\tset_property(_uris.rdf_type, _uris.lv2_Plugin);\n\n\tupdate_properties();\n}\n\nvoid\nLV2Plugin::update_properties()\n{\n\tLilvNode* minor = lilv_world_get(_world->lilv_world(),\n\t                                 lilv_plugin_get_uri(_lilv_plugin),\n\t                                 _uris.lv2_minorVersion,\n\t                                 NULL);\n\tLilvNode* micro = lilv_world_get(_world->lilv_world(),\n\t                                 lilv_plugin_get_uri(_lilv_plugin),\n\t                                 _uris.lv2_minorVersion,\n\t                                 NULL);\n\n\tif (lilv_node_is_int(minor) && lilv_node_is_int(micro)) {\n\t\tset_property(_uris.lv2_minorVersion,\n\t\t             _world->forge().make(lilv_node_as_int(minor)));\n\t\tset_property(_uris.lv2_microVersion,\n\t\t             _world->forge().make(lilv_node_as_int(micro)));\n\t}\n\n\tlilv_node_free(minor);\n\tlilv_node_free(micro);\n}\n\nconst Raul::Symbol\nLV2Plugin::symbol() const\n{\n\tstring working = uri();\n\tif (working.back() == '\/')\n\t\tworking = working.substr(0, working.length() - 1);\n\n\twhile (working.length() > 0) {\n\t\tsize_t last_slash = working.find_last_of(\"\/\");\n\t\tconst string symbol = working.substr(last_slash+1);\n\t\tif ( (symbol[0] >= 'a' && symbol[0] <= 'z')\n\t\t     || (symbol[0] >= 'A' && symbol[0] <= 'Z') )\n\t\t\treturn Raul::Symbol::symbolify(symbol);\n\t\telse\n\t\t\tworking = working.substr(0, last_slash);\n\t}\n\n\treturn Raul::Symbol(\"lv2_symbol\");\n}\n\nBlockImpl*\nLV2Plugin::instantiate(BufferFactory&      bufs,\n                       const Raul::Symbol& symbol,\n                       bool                polyphonic,\n                       GraphImpl*          parent,\n                       Engine&             engine)\n{\n\tLV2Block* b = new LV2Block(\n\t\tthis, symbol, polyphonic, parent, engine.driver()->sample_rate());\n\n\tif (!b->instantiate(bufs)) {\n\t\tdelete b;\n\t\treturn NULL;\n\t} else {\n\t\treturn b;\n\t}\n}\n\nvoid\nLV2Plugin::load_presets()\n{\n\tconst URIs& uris    = _world->uris();\n\tLilvWorld*  lworld  = _world->lilv_world();\n\tLilvNodes*  presets = lilv_plugin_get_related(_lilv_plugin, uris.pset_Preset);\n\n\tif (presets) {\n\t\tLILV_FOREACH(nodes, i, presets) {\n\t\t\tconst LilvNode* preset = lilv_nodes_get(presets, i);\n\t\t\tlilv_world_load_resource(lworld, preset);\n\n\t\t\tLilvNodes* labels = lilv_world_find_nodes(\n\t\t\t\tlworld, preset, uris.rdfs_label, NULL);\n\t\t\tif (labels) {\n\t\t\t\tconst LilvNode* label = lilv_nodes_get_first(labels);\n\n\t\t\t\t_presets.insert(\n\t\t\t\t\tstd::make_pair(Raul::URI(lilv_node_as_uri(preset)),\n\t\t\t\t\t               lilv_node_as_string(label)));\n\n\t\t\t\tlilv_nodes_free(labels);\n\t\t\t} else {\n\t\t\t\t_world->log().error(\n\t\t\t\t\tfmt(\"Preset <%1%> has no rdfs:label\\n\")\n\t\t\t\t\t% lilv_node_as_string(lilv_nodes_get(presets, i)));\n\t\t\t}\n\t\t}\n\n\t\tlilv_nodes_free(presets);\n\t}\n\n\tPluginImpl::load_presets();\n}\n\n} \/\/ namespace Server\n} \/\/ namespace Ingen\n<commit_msg>Fix plugin versioning<commit_after>\/*\n  This file is part of Ingen.\n  Copyright 2007-2015 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 Affero General Public License as published by the Free\n  Software Foundation, either version 3 of the License, or any later 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 FOR\n  A PARTICULAR PURPOSE.  See the GNU Affero General Public License for details.\n\n  You should have received a copy of the GNU Affero General Public License\n  along with Ingen.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n\n#include \"ingen\/Log.hpp\"\n#include \"ingen\/URIs.hpp\"\n#include \"lv2\/lv2plug.in\/ns\/ext\/presets\/presets.h\"\n\n#include \"Driver.hpp\"\n#include \"Engine.hpp\"\n#include \"LV2Block.hpp\"\n#include \"LV2Plugin.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\nnamespace Server {\n\nLV2Plugin::LV2Plugin(World* world, const LilvPlugin* lplugin)\n\t: PluginImpl(world->uris(),\n\t             world->uris().lv2_Plugin.urid,\n\t             Raul::URI(lilv_node_as_uri(lilv_plugin_get_uri(lplugin))))\n\t, _world(world)\n\t, _lilv_plugin(lplugin)\n{\n\tset_property(_uris.rdf_type, _uris.lv2_Plugin);\n\n\tupdate_properties();\n}\n\nvoid\nLV2Plugin::update_properties()\n{\n\tLilvNode* minor = lilv_world_get(_world->lilv_world(),\n\t                                 lilv_plugin_get_uri(_lilv_plugin),\n\t                                 _uris.lv2_minorVersion,\n\t                                 NULL);\n\tLilvNode* micro = lilv_world_get(_world->lilv_world(),\n\t                                 lilv_plugin_get_uri(_lilv_plugin),\n\t                                 _uris.lv2_microVersion,\n\t                                 NULL);\n\n\tif (lilv_node_is_int(minor) && lilv_node_is_int(micro)) {\n\t\tset_property(_uris.lv2_minorVersion,\n\t\t             _world->forge().make(lilv_node_as_int(minor)));\n\t\tset_property(_uris.lv2_microVersion,\n\t\t             _world->forge().make(lilv_node_as_int(micro)));\n\t}\n\n\tlilv_node_free(minor);\n\tlilv_node_free(micro);\n}\n\nconst Raul::Symbol\nLV2Plugin::symbol() const\n{\n\tstring working = uri();\n\tif (working.back() == '\/')\n\t\tworking = working.substr(0, working.length() - 1);\n\n\twhile (working.length() > 0) {\n\t\tsize_t last_slash = working.find_last_of(\"\/\");\n\t\tconst string symbol = working.substr(last_slash+1);\n\t\tif ( (symbol[0] >= 'a' && symbol[0] <= 'z')\n\t\t     || (symbol[0] >= 'A' && symbol[0] <= 'Z') )\n\t\t\treturn Raul::Symbol::symbolify(symbol);\n\t\telse\n\t\t\tworking = working.substr(0, last_slash);\n\t}\n\n\treturn Raul::Symbol(\"lv2_symbol\");\n}\n\nBlockImpl*\nLV2Plugin::instantiate(BufferFactory&      bufs,\n                       const Raul::Symbol& symbol,\n                       bool                polyphonic,\n                       GraphImpl*          parent,\n                       Engine&             engine)\n{\n\tLV2Block* b = new LV2Block(\n\t\tthis, symbol, polyphonic, parent, engine.driver()->sample_rate());\n\n\tif (!b->instantiate(bufs)) {\n\t\tdelete b;\n\t\treturn NULL;\n\t} else {\n\t\treturn b;\n\t}\n}\n\nvoid\nLV2Plugin::load_presets()\n{\n\tconst URIs& uris    = _world->uris();\n\tLilvWorld*  lworld  = _world->lilv_world();\n\tLilvNodes*  presets = lilv_plugin_get_related(_lilv_plugin, uris.pset_Preset);\n\n\tif (presets) {\n\t\tLILV_FOREACH(nodes, i, presets) {\n\t\t\tconst LilvNode* preset = lilv_nodes_get(presets, i);\n\t\t\tlilv_world_load_resource(lworld, preset);\n\n\t\t\tLilvNodes* labels = lilv_world_find_nodes(\n\t\t\t\tlworld, preset, uris.rdfs_label, NULL);\n\t\t\tif (labels) {\n\t\t\t\tconst LilvNode* label = lilv_nodes_get_first(labels);\n\n\t\t\t\t_presets.insert(\n\t\t\t\t\tstd::make_pair(Raul::URI(lilv_node_as_uri(preset)),\n\t\t\t\t\t               lilv_node_as_string(label)));\n\n\t\t\t\tlilv_nodes_free(labels);\n\t\t\t} else {\n\t\t\t\t_world->log().error(\n\t\t\t\t\tfmt(\"Preset <%1%> has no rdfs:label\\n\")\n\t\t\t\t\t% lilv_node_as_string(lilv_nodes_get(presets, i)));\n\t\t\t}\n\t\t}\n\n\t\tlilv_nodes_free(presets);\n\t}\n\n\tPluginImpl::load_presets();\n}\n\n} \/\/ namespace Server\n} \/\/ namespace Ingen\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Manasij Mukherjee  <manasij7479@gmail.com>\n\/\/ author:  Vassil Vassilev <vvasilev@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 \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"clang\/Sema\/Sema.h\"\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/InterpreterCallbacks.h\"\n#include \"cling\/Interpreter\/AutoloadCallback.h\"\n#include \"cling\/Interpreter\/Transaction.h\"\n\n\nusing namespace clang;\n\nnamespace cling {\n\n  void AutoloadCallback::report(clang::SourceLocation l,std::string name,std::string header) {\n    Sema& sema= m_Interpreter->getSema();\n\n    unsigned id\n      = sema.getDiagnostics().getCustomDiagID (DiagnosticsEngine::Level::Warning,\n                                                 \"Note: '%0' can be found in %1\");\n\/*    unsigned idn \/\/TODO: To be enabled after we have a way to get the full path\n      = sema.getDiagnostics().getCustomDiagID(DiagnosticsEngine::Level::Note,\n                                                \"Type : %0 , Full Path: %1\")*\/;\n\n    sema.Diags.Report(l, id) << name << header;\n\n  }\n\n  bool AutoloadCallback::LookupObject (TagDecl *t) {\n    if (t->hasAttr<AnnotateAttr>())\n      report(t->getLocation(),t->getNameAsString(),t->getAttr<AnnotateAttr>()->getAnnotation());\n    return false;\n  }\n\n  class DefaultArgVisitor: public RecursiveASTVisitor<DefaultArgVisitor> {\n  private:\n    bool m_IsStoringState;\n    AutoloadCallback::FwdDeclsMap* m_Map;\n    clang::Preprocessor* m_PP;\n  private:\n    void InsertIntoAutoloadingState (Decl* decl, std::string annotation) {\n\n      assert(annotation != \"\" && \"Empty annotation!\");\n      assert(m_PP);\n\n      const FileEntry* FE = 0;\n      SourceLocation fileNameLoc;\n      bool isAngled = false;\n      const DirectoryLookup* LookupFrom = 0;\n      const DirectoryLookup* CurDir = 0;\n\n      FE = m_PP->LookupFile(fileNameLoc, annotation, isAngled, LookupFrom,\n                            CurDir, \/*SearchPath*\/0, \/*RelativePath*\/ 0,\n                            \/*suggestedModule*\/0, \/*SkipCache*\/false,\n                            \/*OpenFile*\/ false, \/*CacheFail*\/ false);\n\n      assert(FE && \"Must have a valid FileEntry\");\n\n      if (m_Map->find(FE) == m_Map->end())\n        (*m_Map)[FE] = std::vector<Decl*>();\n\n      (*m_Map)[FE].push_back(decl);\n    }\n\n  public:\n    DefaultArgVisitor() : m_IsStoringState(false), m_Map(0) {}\n    void RemoveDefaultArgsOf(Decl* D) {\n      \/\/D = D->getMostRecentDecl();\n      TraverseDecl(D);\n      \/\/while ((D = D->getPreviousDecl()))\n      \/\/  TraverseDecl(D);\n    }\n\n    void TrackDefaultArgStateOf(Decl* D, AutoloadCallback::FwdDeclsMap& map,\n                                Preprocessor& PP) {\n      m_IsStoringState = true;\n      m_Map = &map;\n      m_PP = &PP;\n      TraverseDecl(D);\n      m_PP = 0;\n      m_Map = 0;\n      m_IsStoringState = false;\n    }\n\n    bool shouldVisitTemplateInstantiations() { return true; }\n    bool TraverseTemplateTypeParmDecl(TemplateTypeParmDecl* D) {\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool VisitDecl(Decl* D) {\n      if (m_IsStoringState)\n        return true;\n\n      if (!D->hasAttr<AnnotateAttr>())\n        return false;\n\n      AnnotateAttr* attr = D->getAttr<AnnotateAttr>();\n      if (!attr)\n        return true;\n\n      switch (D->getKind()) {\n      default:\n        InsertIntoAutoloadingState(D, attr->getAnnotation());\n        break;\n      case Decl::Enum:\n        \/\/ EnumDecls have extra information 2 chars after the filename used\n        \/\/ for extra fixups.\n        InsertIntoAutoloadingState(D, attr->getAnnotation().drop_back(2));\n        break;\n      }\n\n      return true;\n    }\n\n    bool TraverseTemplateDecl(TemplateDecl* D) {\n      if (!D->getTemplatedDecl()->hasAttr<AnnotateAttr>())\n        return false;\n      for(auto P: D->getTemplateParameters()->asArray())\n        TraverseDecl(P);\n      return true;\n    }\n\n    bool TraverseNonTypeTemplateParmDecl(NonTypeTemplateParmDecl* D) {\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool TraverseParmVarDecl(ParmVarDecl* D) {\n      if (D->hasDefaultArg())\n        D->setDefaultArg(nullptr);\n      return true;\n    }\n  };\n\n  void AutoloadCallback::InclusionDirective(clang::SourceLocation HashLoc,\n                          const clang::Token &IncludeTok,\n                          llvm::StringRef FileName,\n                          bool IsAngled,\n                          clang::CharSourceRange FilenameRange,\n                          const clang::FileEntry *File,\n                          llvm::StringRef SearchPath,\n                          llvm::StringRef RelativePath,\n                          const clang::Module *Imported) {\n    assert(File && \"Must have a valid File\");\n\n    auto found = m_Map.find(File);\n    if (found == m_Map.end())\n     return; \/\/ nothing to do, file not referred in any annotation\n\n    DefaultArgVisitor defaultArgsCleaner;\n    for (auto D : found->second) {\n      defaultArgsCleaner.RemoveDefaultArgsOf(D);\n    }\n    \/\/ Don't need to keep track of cleaned up decls from file.\n    m_Map.erase(found);\n  }\n\n  AutoloadCallback::AutoloadCallback(Interpreter* interp) :\n    InterpreterCallbacks(interp,true,false,true), m_Interpreter(interp){\n\/\/#ifdef _POSIX_C_SOURCE\n\/\/      \/\/Workaround for differnt expansion of macros to typedefs\n\/\/      m_Interpreter->parse(\"#include <sys\/types.h>\");\n\/\/#endif\n  }\n\n  AutoloadCallback::~AutoloadCallback() {\n  }\n\n  void AutoloadCallback::TransactionCommitted(const Transaction &T) {\n    if (T.decls_begin() == T.decls_end())\n      return;\n    if (T.decls_begin()->m_DGR.isNull())\n      return;\n\n    if (const NamedDecl* ND = dyn_cast<NamedDecl>(*T.decls_begin()->m_DGR.begin()))\n      if (ND->getIdentifier() && ND->getName().equals(\"__Cling_Autoloading_Map\")) {\n        DefaultArgVisitor defaultArgsStateCollector;\n        Preprocessor& PP = m_Interpreter->getCI()->getPreprocessor();\n        for (Transaction::const_iterator I = T.decls_begin(), E = T.decls_end();\n             I != E; ++I) {\n          Transaction::DelayCallInfo DCI = *I;\n\n          \/\/ if (DCI.m_Call != Transaction::kCCIHandleTopLevelDecl)\n          \/\/   continue;\n          if (DCI.m_DGR.isNull())\n            continue;\n\n          for (DeclGroupRef::iterator J = DCI.m_DGR.begin(),\n                 JE = DCI.m_DGR.end(); J != JE; ++J) {\n            defaultArgsStateCollector.TrackDefaultArgStateOf(*J, m_Map, PP);\n          }\n        }\n      }\n  }\n\n} \/\/end namespace cling\n<commit_msg>Use the correct condition.<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Manasij Mukherjee  <manasij7479@gmail.com>\n\/\/ author:  Vassil Vassilev <vvasilev@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 \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"clang\/Sema\/Sema.h\"\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/InterpreterCallbacks.h\"\n#include \"cling\/Interpreter\/AutoloadCallback.h\"\n#include \"cling\/Interpreter\/Transaction.h\"\n\n\nusing namespace clang;\n\nnamespace cling {\n\n  void AutoloadCallback::report(clang::SourceLocation l,std::string name,std::string header) {\n    Sema& sema= m_Interpreter->getSema();\n\n    unsigned id\n      = sema.getDiagnostics().getCustomDiagID (DiagnosticsEngine::Level::Warning,\n                                                 \"Note: '%0' can be found in %1\");\n\/*    unsigned idn \/\/TODO: To be enabled after we have a way to get the full path\n      = sema.getDiagnostics().getCustomDiagID(DiagnosticsEngine::Level::Note,\n                                                \"Type : %0 , Full Path: %1\")*\/;\n\n    sema.Diags.Report(l, id) << name << header;\n\n  }\n\n  bool AutoloadCallback::LookupObject (TagDecl *t) {\n    if (t->hasAttr<AnnotateAttr>())\n      report(t->getLocation(),t->getNameAsString(),t->getAttr<AnnotateAttr>()->getAnnotation());\n    return false;\n  }\n\n  class DefaultArgVisitor: public RecursiveASTVisitor<DefaultArgVisitor> {\n  private:\n    bool m_IsStoringState;\n    AutoloadCallback::FwdDeclsMap* m_Map;\n    clang::Preprocessor* m_PP;\n  private:\n    void InsertIntoAutoloadingState (Decl* decl, std::string annotation) {\n\n      assert(annotation != \"\" && \"Empty annotation!\");\n      assert(m_PP);\n\n      const FileEntry* FE = 0;\n      SourceLocation fileNameLoc;\n      bool isAngled = false;\n      const DirectoryLookup* LookupFrom = 0;\n      const DirectoryLookup* CurDir = 0;\n\n      FE = m_PP->LookupFile(fileNameLoc, annotation, isAngled, LookupFrom,\n                            CurDir, \/*SearchPath*\/0, \/*RelativePath*\/ 0,\n                            \/*suggestedModule*\/0, \/*SkipCache*\/false,\n                            \/*OpenFile*\/ false, \/*CacheFail*\/ false);\n\n      assert(FE && \"Must have a valid FileEntry\");\n\n      if (m_Map->find(FE) == m_Map->end())\n        (*m_Map)[FE] = std::vector<Decl*>();\n\n      (*m_Map)[FE].push_back(decl);\n    }\n\n  public:\n    DefaultArgVisitor() : m_IsStoringState(false), m_Map(0) {}\n    void RemoveDefaultArgsOf(Decl* D) {\n      \/\/D = D->getMostRecentDecl();\n      TraverseDecl(D);\n      \/\/while ((D = D->getPreviousDecl()))\n      \/\/  TraverseDecl(D);\n    }\n\n    void TrackDefaultArgStateOf(Decl* D, AutoloadCallback::FwdDeclsMap& map,\n                                Preprocessor& PP) {\n      m_IsStoringState = true;\n      m_Map = &map;\n      m_PP = &PP;\n      TraverseDecl(D);\n      m_PP = 0;\n      m_Map = 0;\n      m_IsStoringState = false;\n    }\n\n    bool shouldVisitTemplateInstantiations() { return true; }\n    bool TraverseTemplateTypeParmDecl(TemplateTypeParmDecl* D) {\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool VisitDecl(Decl* D) {\n      if (!m_IsStoringState)\n        return true;\n\n      if (!D->hasAttr<AnnotateAttr>())\n        return false;\n\n      AnnotateAttr* attr = D->getAttr<AnnotateAttr>();\n      if (!attr)\n        return true;\n\n      switch (D->getKind()) {\n      default:\n        InsertIntoAutoloadingState(D, attr->getAnnotation());\n        break;\n      case Decl::Enum:\n        \/\/ EnumDecls have extra information 2 chars after the filename used\n        \/\/ for extra fixups.\n        InsertIntoAutoloadingState(D, attr->getAnnotation().drop_back(2));\n        break;\n      }\n\n      return true;\n    }\n\n    bool TraverseTemplateDecl(TemplateDecl* D) {\n      if (!D->getTemplatedDecl()->hasAttr<AnnotateAttr>())\n        return false;\n      for(auto P: D->getTemplateParameters()->asArray())\n        TraverseDecl(P);\n      return true;\n    }\n\n    bool TraverseNonTypeTemplateParmDecl(NonTypeTemplateParmDecl* D) {\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool TraverseParmVarDecl(ParmVarDecl* D) {\n      if (D->hasDefaultArg())\n        D->setDefaultArg(nullptr);\n      return true;\n    }\n  };\n\n  void AutoloadCallback::InclusionDirective(clang::SourceLocation HashLoc,\n                          const clang::Token &IncludeTok,\n                          llvm::StringRef FileName,\n                          bool IsAngled,\n                          clang::CharSourceRange FilenameRange,\n                          const clang::FileEntry *File,\n                          llvm::StringRef SearchPath,\n                          llvm::StringRef RelativePath,\n                          const clang::Module *Imported) {\n    assert(File && \"Must have a valid File\");\n\n    auto found = m_Map.find(File);\n    if (found == m_Map.end())\n     return; \/\/ nothing to do, file not referred in any annotation\n\n    DefaultArgVisitor defaultArgsCleaner;\n    for (auto D : found->second) {\n      defaultArgsCleaner.RemoveDefaultArgsOf(D);\n    }\n    \/\/ Don't need to keep track of cleaned up decls from file.\n    m_Map.erase(found);\n  }\n\n  AutoloadCallback::AutoloadCallback(Interpreter* interp) :\n    InterpreterCallbacks(interp,true,false,true), m_Interpreter(interp){\n\/\/#ifdef _POSIX_C_SOURCE\n\/\/      \/\/Workaround for differnt expansion of macros to typedefs\n\/\/      m_Interpreter->parse(\"#include <sys\/types.h>\");\n\/\/#endif\n  }\n\n  AutoloadCallback::~AutoloadCallback() {\n  }\n\n  void AutoloadCallback::TransactionCommitted(const Transaction &T) {\n    if (T.decls_begin() == T.decls_end())\n      return;\n    if (T.decls_begin()->m_DGR.isNull())\n      return;\n\n    if (const NamedDecl* ND = dyn_cast<NamedDecl>(*T.decls_begin()->m_DGR.begin()))\n      if (ND->getIdentifier() && ND->getName().equals(\"__Cling_Autoloading_Map\")) {\n        DefaultArgVisitor defaultArgsStateCollector;\n        Preprocessor& PP = m_Interpreter->getCI()->getPreprocessor();\n        for (Transaction::const_iterator I = T.decls_begin(), E = T.decls_end();\n             I != E; ++I) {\n          Transaction::DelayCallInfo DCI = *I;\n\n          \/\/ if (DCI.m_Call != Transaction::kCCIHandleTopLevelDecl)\n          \/\/   continue;\n          if (DCI.m_DGR.isNull())\n            continue;\n\n          for (DeclGroupRef::iterator J = DCI.m_DGR.begin(),\n                 JE = DCI.m_DGR.end(); J != JE; ++J) {\n            defaultArgsStateCollector.TrackDefaultArgStateOf(*J, m_Map, PP);\n          }\n        }\n      }\n  }\n\n} \/\/end namespace cling\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Manasij Mukherjee  <manasij7479@gmail.com>\n\/\/ author:  Vassil Vassilev <vvasilev@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 \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"clang\/Sema\/Sema.h\"\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/ASTContext.h\" \/\/ for operator new[](unsigned long, ASTCtx..)\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/AST\/DeclVisitor.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/InterpreterCallbacks.h\"\n#include \"cling\/Interpreter\/AutoloadCallback.h\"\n#include \"cling\/Interpreter\/Transaction.h\"\n\nnamespace {\n  static const char annoTag[] = \"$clingAutoload$\";\n  static const size_t lenAnnoTag = sizeof(annoTag) - 1;\n}\n\nusing namespace clang;\n\nnamespace cling {\n\n  void AutoloadCallback::report(clang::SourceLocation l, llvm::StringRef name,\n                                llvm::StringRef header) {\n    Sema& sema= m_Interpreter->getSema();\n\n    unsigned id\n      = sema.getDiagnostics().getCustomDiagID (DiagnosticsEngine::Level::Warning,\n                                                 \"Note: '%0' can be found in %1\");\n\/*    unsigned idn \/\/TODO: To be enabled after we have a way to get the full path\n      = sema.getDiagnostics().getCustomDiagID(DiagnosticsEngine::Level::Note,\n                                                \"Type : %0 , Full Path: %1\")*\/;\n\n    if (header.startswith(llvm::StringRef(annoTag, lenAnnoTag)))\n      sema.Diags.Report(l, id) << name << header.drop_front(lenAnnoTag);\n\n  }\n\n  bool AutoloadCallback::LookupObject (TagDecl *t) {\n    if (m_ShowSuggestions && t->hasAttr<AnnotateAttr>())\n      report(t->getLocation(),t->getNameAsString(),t->getAttr<AnnotateAttr>()->getAnnotation());\n    return false;\n  }\n\n  class AutoloadingVisitor: public RecursiveASTVisitor<AutoloadingVisitor> {\n  private:\n    \/\/\/\\brief Flag determining the visitor's actions. If tru, register autoload\n    \/\/\/ entries, i.e. remember the connection between filename to declaration\n    \/\/\/ that needs to be updated on #include of the filename.\n    \/\/\/ If false, react on an #include by adjusting the forward decls, e.g. by\n    \/\/\/ removing the default tremplate arguments (that will now be provided by\n    \/\/\/ the definition read from the include) and by removing enum declarations\n    \/\/\/ that would otherwise be duplicates.\n    bool m_IsStoringState;\n    AutoloadCallback::FwdDeclsMap* m_Map;\n    clang::Preprocessor* m_PP;\n    const clang::FileEntry* m_PrevFE;\n    std::string m_PrevFileName;\n  private:\n    void InsertIntoAutoloadingState (Decl* decl, llvm::StringRef annotation) {\n\n      assert(!annotation.empty() && \"Empty annotation!\");\n      if (!annotation.startswith(llvm::StringRef(annoTag, lenAnnoTag))) {\n        \/\/ not an autoload annotation.\n        return;\n      }\n\n      assert(m_PP);\n\n      const FileEntry* FE = 0;\n      SourceLocation fileNameLoc;\n      bool isAngled = false;\n      const DirectoryLookup* LookupFrom = 0;\n      const DirectoryLookup* CurDir = 0;\n      llvm::StringRef FileName = annotation.drop_front(lenAnnoTag);\n      if (FileName.equals(m_PrevFileName))\n        FE = m_PrevFE;\n      else {\n        FE = m_PP->LookupFile(fileNameLoc, FileName, isAngled,\n                              LookupFrom, CurDir, \/*SearchPath*\/0,\n                              \/*RelativePath*\/ 0, \/*suggestedModule*\/0,\n                              \/*SkipCache*\/ false, \/*OpenFile*\/ false,\n                              \/*CacheFail*\/ true);\n        m_PrevFE = FE;\n        m_PrevFileName = FileName;\n      }\n\n      assert(FE && \"Must have a valid FileEntry\");\n      if (FE) {\n        auto& Vec = (*m_Map)[FE];\n        Vec.push_back(decl);\n      }\n    }\n\n  public:\n    AutoloadingVisitor():\n      m_IsStoringState(false), m_Map(0), m_PP(0), m_PrevFE(0) {}\n    void RemoveDefaultArgsOf(Decl* D) {\n      \/\/D = D->getMostRecentDecl();\n      TraverseDecl(D);\n      \/\/while ((D = D->getPreviousDecl()))\n      \/\/  TraverseDecl(D);\n    }\n\n    void TrackDefaultArgStateOf(Decl* D, AutoloadCallback::FwdDeclsMap& map,\n                                Preprocessor& PP) {\n      m_IsStoringState = true;\n      m_Map = &map;\n      m_PP = &PP;\n      TraverseDecl(D);\n      m_PP = 0;\n      m_Map = 0;\n      m_IsStoringState = false;\n    }\n\n    bool shouldVisitTemplateInstantiations() { return true; }\n\n    bool VisitDecl(Decl* D) {\n      if (!m_IsStoringState)\n        return true;\n\n      if (!D->hasAttr<AnnotateAttr>())\n        return true;\n\n      AnnotateAttr* attr = D->getAttr<AnnotateAttr>();\n      if (!attr)\n        return true;\n\n      switch (D->getKind()) {\n      default:\n        InsertIntoAutoloadingState(D, attr->getAnnotation());\n        break;\n      case Decl::Enum:\n        \/\/ EnumDecls have extra information 2 chars after the filename used\n        \/\/ for extra fixups.\n          EnumDecl* ED = cast<EnumDecl>(D);\n          if (ED->isFixed()) {\n            StringRef str = ED->getAttr<AnnotateAttr>()->getAnnotation();\n            char ch = str.back();\n\/\/            str.drop_back(2);\n            ED->getAttr<AnnotateAttr>()->setAnnotation(ED->getASTContext(), str);\n            struct EnumDeclDerived: public EnumDecl {\n              static void setFixed(EnumDecl* ED, bool value = true) {\n                ((EnumDeclDerived*)ED)->IsFixed = value;\n              }\n            };\n\n            if (ch != '1')\n              EnumDeclDerived::setFixed(ED, false);\n          }\n        InsertIntoAutoloadingState(D, attr->getAnnotation().drop_back(2));\n        break;\n      }\n\n      return true;\n    }\n\n    bool VisitCXXRecordDecl(CXXRecordDecl* D) {\n      if (!D->hasAttr<AnnotateAttr>())\n        return true;\n\n      VisitDecl(D);\n\n      if (ClassTemplateDecl* TmplD = D->getDescribedClassTemplate())\n        return VisitTemplateDecl(TmplD);\n      return true;\n    }\n\n    bool VisitTemplateTypeParmDecl(TemplateTypeParmDecl* D) {\n      VisitDecl(D);\n\n      if (m_IsStoringState)\n        return true;\n\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool VisitTemplateDecl(TemplateDecl* D) {\n      if (D->getTemplatedDecl() &&\n          !D->getTemplatedDecl()->hasAttr<AnnotateAttr>())\n        return true;\n\n      VisitDecl(D);\n\n      for(auto P: D->getTemplateParameters()->asArray())\n        TraverseDecl(P);\n      return true;\n    }\n\n    bool VisitTemplateTemplateParmDecl(TemplateTemplateParmDecl* D) {\n      VisitDecl(D);\n\n      if (m_IsStoringState)\n        return true;\n\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool VisitNonTypeTemplateParmDecl(NonTypeTemplateParmDecl* D) {\n      VisitDecl(D);\n\n      if (m_IsStoringState)\n        return true;\n\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool VisitParmVarDecl(ParmVarDecl* D) {\n      VisitDecl(D);\n\n      if (m_IsStoringState)\n        return true;\n\n      if (D->hasDefaultArg())\n        D->setDefaultArg(nullptr);\n      return true;\n    }\n  };\n\n  void AutoloadCallback::InclusionDirective(clang::SourceLocation HashLoc,\n                          const clang::Token &IncludeTok,\n                          llvm::StringRef FileName,\n                          bool IsAngled,\n                          clang::CharSourceRange FilenameRange,\n                          const clang::FileEntry *File,\n                          llvm::StringRef SearchPath,\n                          llvm::StringRef RelativePath,\n                          const clang::Module *Imported) {\n    \/\/ If File is 0 this means that the #included file doesn't exist.\n    if (!File)\n      return;\n\n    auto found = m_Map.find(File);\n    if (found == m_Map.end())\n     return; \/\/ nothing to do, file not referred in any annotation\n\n    AutoloadingVisitor defaultArgsCleaner;\n    for (auto D : found->second) {\n      defaultArgsCleaner.RemoveDefaultArgsOf(D);\n    }\n    \/\/ Don't need to keep track of cleaned up decls from file.\n    m_Map.erase(found);\n  }\n\n  AutoloadCallback::~AutoloadCallback() {\n  }\n\n  void AutoloadCallback::TransactionCommitted(const Transaction &T) {\n    if (T.decls_begin() == T.decls_end())\n      return;\n    if (T.decls_begin()->m_DGR.isNull())\n      return;\n\n    if (const NamedDecl* ND = dyn_cast<NamedDecl>(*T.decls_begin()->m_DGR.begin()))\n      if (ND->getIdentifier() && ND->getName().equals(\"__Cling_Autoloading_Map\")) {\n        AutoloadingVisitor defaultArgsStateCollector;\n        Preprocessor& PP = m_Interpreter->getCI()->getPreprocessor();\n        for (Transaction::const_iterator I = T.decls_begin(), E = T.decls_end();\n             I != E; ++I) {\n          Transaction::DelayCallInfo DCI = *I;\n\n          \/\/ if (DCI.m_Call != Transaction::kCCIHandleTopLevelDecl)\n          \/\/   continue;\n          if (DCI.m_DGR.isNull())\n            continue;\n\n          if (const NamedDecl* ND = dyn_cast<NamedDecl>(*T.decls_begin()->m_DGR.begin()))\n            if (ND->getIdentifier()\n                && ND->getName().equals(\"__Cling_Autoloading_Map\")) {\n\n              for (Transaction::const_iterator I = T.decls_begin(),\n                     E = T.decls_end(); I != E; ++I) {\n                Transaction::DelayCallInfo DCI = *I;\n                for (DeclGroupRef::iterator J = DCI.m_DGR.begin(),\n                       JE = DCI.m_DGR.end(); J != JE; ++J) {\n                    defaultArgsStateCollector.TrackDefaultArgStateOf(*J, m_Map, PP);\n                }\n              }\n            }\n\n        }\n      }\n  }\n\n} \/\/end namespace cling\n<commit_msg>Keep default args once there is a template definition (ROOT-7037).<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Manasij Mukherjee  <manasij7479@gmail.com>\n\/\/ author:  Vassil Vassilev <vvasilev@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 \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"clang\/Sema\/Sema.h\"\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/ASTContext.h\" \/\/ for operator new[](unsigned long, ASTCtx..)\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/AST\/DeclVisitor.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/InterpreterCallbacks.h\"\n#include \"cling\/Interpreter\/AutoloadCallback.h\"\n#include \"cling\/Interpreter\/Transaction.h\"\n\nnamespace {\n  static const char annoTag[] = \"$clingAutoload$\";\n  static const size_t lenAnnoTag = sizeof(annoTag) - 1;\n}\n\nusing namespace clang;\n\nnamespace cling {\n\n  void AutoloadCallback::report(clang::SourceLocation l, llvm::StringRef name,\n                                llvm::StringRef header) {\n    Sema& sema= m_Interpreter->getSema();\n\n    unsigned id\n      = sema.getDiagnostics().getCustomDiagID (DiagnosticsEngine::Level::Warning,\n                                                 \"Note: '%0' can be found in %1\");\n\/*    unsigned idn \/\/TODO: To be enabled after we have a way to get the full path\n      = sema.getDiagnostics().getCustomDiagID(DiagnosticsEngine::Level::Note,\n                                                \"Type : %0 , Full Path: %1\")*\/;\n\n    if (header.startswith(llvm::StringRef(annoTag, lenAnnoTag)))\n      sema.Diags.Report(l, id) << name << header.drop_front(lenAnnoTag);\n\n  }\n\n  bool AutoloadCallback::LookupObject (TagDecl *t) {\n    if (m_ShowSuggestions && t->hasAttr<AnnotateAttr>())\n      report(t->getLocation(),t->getNameAsString(),t->getAttr<AnnotateAttr>()->getAnnotation());\n    return false;\n  }\n\n  class AutoloadingVisitor: public RecursiveASTVisitor<AutoloadingVisitor> {\n  private:\n    \/\/\/\\brief Flag determining the visitor's actions. If tru, register autoload\n    \/\/\/ entries, i.e. remember the connection between filename to declaration\n    \/\/\/ that needs to be updated on #include of the filename.\n    \/\/\/ If false, react on an #include by adjusting the forward decls, e.g. by\n    \/\/\/ removing the default tremplate arguments (that will now be provided by\n    \/\/\/ the definition read from the include) and by removing enum declarations\n    \/\/\/ that would otherwise be duplicates.\n    bool m_IsStoringState;\n    AutoloadCallback::FwdDeclsMap* m_Map;\n    clang::Preprocessor* m_PP;\n    const clang::FileEntry* m_PrevFE;\n    std::string m_PrevFileName;\n  private:\n    void InsertIntoAutoloadingState (Decl* decl, llvm::StringRef annotation) {\n\n      assert(!annotation.empty() && \"Empty annotation!\");\n      if (!annotation.startswith(llvm::StringRef(annoTag, lenAnnoTag))) {\n        \/\/ not an autoload annotation.\n        return;\n      }\n\n      assert(m_PP);\n\n      const FileEntry* FE = 0;\n      SourceLocation fileNameLoc;\n      bool isAngled = false;\n      const DirectoryLookup* LookupFrom = 0;\n      const DirectoryLookup* CurDir = 0;\n      llvm::StringRef FileName = annotation.drop_front(lenAnnoTag);\n      if (FileName.equals(m_PrevFileName))\n        FE = m_PrevFE;\n      else {\n        FE = m_PP->LookupFile(fileNameLoc, FileName, isAngled,\n                              LookupFrom, CurDir, \/*SearchPath*\/0,\n                              \/*RelativePath*\/ 0, \/*suggestedModule*\/0,\n                              \/*SkipCache*\/ false, \/*OpenFile*\/ false,\n                              \/*CacheFail*\/ true);\n        m_PrevFE = FE;\n        m_PrevFileName = FileName;\n      }\n\n      assert(FE && \"Must have a valid FileEntry\");\n      if (FE) {\n        auto& Vec = (*m_Map)[FE];\n        Vec.push_back(decl);\n      }\n    }\n\n  public:\n    AutoloadingVisitor():\n      m_IsStoringState(false), m_Map(0), m_PP(0), m_PrevFE(0) {}\n    void RemoveDefaultArgsOf(Decl* D) {\n      \/\/D = D->getMostRecentDecl();\n      TraverseDecl(D);\n      \/\/while ((D = D->getPreviousDecl()))\n      \/\/  TraverseDecl(D);\n    }\n\n    void TrackDefaultArgStateOf(Decl* D, AutoloadCallback::FwdDeclsMap& map,\n                                Preprocessor& PP) {\n      m_IsStoringState = true;\n      m_Map = &map;\n      m_PP = &PP;\n      TraverseDecl(D);\n      m_PP = 0;\n      m_Map = 0;\n      m_IsStoringState = false;\n    }\n\n    bool shouldVisitTemplateInstantiations() { return true; }\n\n    bool VisitDecl(Decl* D) {\n      if (!m_IsStoringState)\n        return true;\n\n      if (!D->hasAttr<AnnotateAttr>())\n        return true;\n\n      AnnotateAttr* attr = D->getAttr<AnnotateAttr>();\n      if (!attr)\n        return true;\n\n      switch (D->getKind()) {\n      default:\n        InsertIntoAutoloadingState(D, attr->getAnnotation());\n        break;\n      case Decl::Enum:\n        \/\/ EnumDecls have extra information 2 chars after the filename used\n        \/\/ for extra fixups.\n          EnumDecl* ED = cast<EnumDecl>(D);\n          if (ED->isFixed()) {\n            StringRef str = ED->getAttr<AnnotateAttr>()->getAnnotation();\n            char ch = str.back();\n\/\/            str.drop_back(2);\n            ED->getAttr<AnnotateAttr>()->setAnnotation(ED->getASTContext(), str);\n            struct EnumDeclDerived: public EnumDecl {\n              static void setFixed(EnumDecl* ED, bool value = true) {\n                ((EnumDeclDerived*)ED)->IsFixed = value;\n              }\n            };\n\n            if (ch != '1')\n              EnumDeclDerived::setFixed(ED, false);\n          }\n        InsertIntoAutoloadingState(D, attr->getAnnotation().drop_back(2));\n        break;\n      }\n\n      return true;\n    }\n\n    bool VisitCXXRecordDecl(CXXRecordDecl* D) {\n      if (!D->hasAttr<AnnotateAttr>())\n        return true;\n\n      VisitDecl(D);\n\n      if (ClassTemplateDecl* TmplD = D->getDescribedClassTemplate())\n        return VisitTemplateDecl(TmplD);\n      return true;\n    }\n\n    bool VisitTemplateTypeParmDecl(TemplateTypeParmDecl* D) {\n      VisitDecl(D);\n\n      if (m_IsStoringState)\n        return true;\n\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool VisitTemplateDecl(TemplateDecl* D) {\n      if (D->getTemplatedDecl() &&\n          !D->getTemplatedDecl()->hasAttr<AnnotateAttr>())\n        return true;\n\n      VisitDecl(D);\n\n      \/\/ If we have a definition we might be about to re-#include the\n      \/\/ same header containing definition that was #included previously,\n      \/\/ i.e. we might have multiple fwd decls for the same template.\n      \/\/ DO NOT remove the defaults here; the definition needs to keep it.\n      \/\/ (ROOT-7037)\n      if (ClassTemplateDecl* CTD = dyn_cast<ClassTemplateDecl>(D))\n        if (CXXRecordDecl* TemplatedD = CTD->getTemplatedDecl())\n          if (TemplatedD->getDefinition())\n            return true;\n\n      for(auto P: D->getTemplateParameters()->asArray())\n        TraverseDecl(P);\n      return true;\n    }\n\n    bool VisitTemplateTemplateParmDecl(TemplateTemplateParmDecl* D) {\n      VisitDecl(D);\n\n      if (m_IsStoringState)\n        return true;\n\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool VisitNonTypeTemplateParmDecl(NonTypeTemplateParmDecl* D) {\n      VisitDecl(D);\n\n      if (m_IsStoringState)\n        return true;\n\n      if (D->hasDefaultArgument())\n        D->removeDefaultArgument();\n      return true;\n    }\n\n    bool VisitParmVarDecl(ParmVarDecl* D) {\n      VisitDecl(D);\n\n      if (m_IsStoringState)\n        return true;\n\n      if (D->hasDefaultArg())\n        D->setDefaultArg(nullptr);\n      return true;\n    }\n  };\n\n  void AutoloadCallback::InclusionDirective(clang::SourceLocation HashLoc,\n                          const clang::Token &IncludeTok,\n                          llvm::StringRef FileName,\n                          bool IsAngled,\n                          clang::CharSourceRange FilenameRange,\n                          const clang::FileEntry *File,\n                          llvm::StringRef SearchPath,\n                          llvm::StringRef RelativePath,\n                          const clang::Module *Imported) {\n    \/\/ If File is 0 this means that the #included file doesn't exist.\n    if (!File)\n      return;\n\n    auto found = m_Map.find(File);\n    if (found == m_Map.end())\n     return; \/\/ nothing to do, file not referred in any annotation\n\n    AutoloadingVisitor defaultArgsCleaner;\n    for (auto D : found->second) {\n      defaultArgsCleaner.RemoveDefaultArgsOf(D);\n    }\n    \/\/ Don't need to keep track of cleaned up decls from file.\n    m_Map.erase(found);\n  }\n\n  AutoloadCallback::~AutoloadCallback() {\n  }\n\n  void AutoloadCallback::TransactionCommitted(const Transaction &T) {\n    if (T.decls_begin() == T.decls_end())\n      return;\n    if (T.decls_begin()->m_DGR.isNull())\n      return;\n\n    if (const NamedDecl* ND = dyn_cast<NamedDecl>(*T.decls_begin()->m_DGR.begin()))\n      if (ND->getIdentifier() && ND->getName().equals(\"__Cling_Autoloading_Map\")) {\n        AutoloadingVisitor defaultArgsStateCollector;\n        Preprocessor& PP = m_Interpreter->getCI()->getPreprocessor();\n        for (Transaction::const_iterator I = T.decls_begin(), E = T.decls_end();\n             I != E; ++I) {\n          Transaction::DelayCallInfo DCI = *I;\n\n          \/\/ if (DCI.m_Call != Transaction::kCCIHandleTopLevelDecl)\n          \/\/   continue;\n          if (DCI.m_DGR.isNull())\n            continue;\n\n          if (const NamedDecl* ND = dyn_cast<NamedDecl>(*T.decls_begin()->m_DGR.begin()))\n            if (ND->getIdentifier()\n                && ND->getName().equals(\"__Cling_Autoloading_Map\")) {\n\n              for (Transaction::const_iterator I = T.decls_begin(),\n                     E = T.decls_end(); I != E; ++I) {\n                Transaction::DelayCallInfo DCI = *I;\n                for (DeclGroupRef::iterator J = DCI.m_DGR.begin(),\n                       JE = DCI.m_DGR.end(); J != JE; ++J) {\n                    defaultArgsStateCollector.TrackDefaultArgStateOf(*J, m_Map, PP);\n                }\n              }\n            }\n\n        }\n      }\n  }\n\n} \/\/end namespace cling\n<|endoftext|>"}
{"text":"<commit_before>#include \"Rectify.h\"\nusing namespace std;\nusing namespace cv;\nRectify::Rectify(matPair inputPair)\n{\n    RectPair.left = inputPair.left;\n    RectPair.right = inputPair.right;\n    qDebug()<<\"finding local maxima\";\n    RectPair = LocalMaxima(RectPair);\n    qDebug()<<\"removing borders\";\n    RectPair = BorderRemoveal(RectPair);\n    qDebug()<<\"gradiant frame\";\n    RectPair = GradiantFrame(RectPair);\n    int top = 0;\n    int bottom = 0;\n    int left = 0;\n    int right = 0;\n    qDebug()<<\"contour crop diff\";\n    contourCropDiff(RectPair,left,top,right,bottom);\n    top = 0;\n    bottom = 0;\n    left = 0;\n    right = 0;\n    qDebug()<<\"contour crop gray\";\n    contourCropGray(RectPair,left,top,right,bottom);\n}\n\nmatPair Rectify::getCroppedPair()\n{\n    return RectPair;\n}\n\nmatPair Rectify::GradiantFrame(matPair images)\n{\n    matPair grayImages;\n    \/\/ convert image to grayscale\n    cvtColor(images.left, grayImages.left, CV_BGR2GRAY);\n    cvtColor(images.right, grayImages.right, CV_BGR2GRAY);\n    int heightSize = 350;\n    float heightScale = images.left.size().height\/(float)heightSize;\n\n    if(images.left.size().height>heightSize)\n    {\n          qDebug()<<\"------------------------------------------\\n\\n\\n\\n\\n\"<<\"image height was\"<<images.left.size().height<<\"so we scaled it and\"<<\"the scale factor is\"<<heightScale;\n          grayImages.left = ScaleImage(grayImages.left,heightSize, true);\n          grayImages.right = ScaleImage(grayImages.right,heightSize, true);\n    }\n    else\n    {\n            qDebug()<<\"--------------------------------------\\n\\n\\n\\n\\ndidnt scale the image since it was too smal\\n\\n\\n\\n--------------------------------------\";\n            heightScale = 1;\n    }\n    shiftInfo info = gradiantShiftAndDistortion(grayImages);\n\n    int finalDx = 0;\n    int finalDy = info.dy*heightScale;\n    images.left = cropImage(images.left,finalDx,finalDy);\n    images.right = cropImage(images.right,finalDx,finalDy);\n    return images;\n}\n\nmatPair Rectify::LocalMaxima(matPair images)\n{\n    int histogramSize = 121; \/\/Keep this an odd number or stuff might fail.\n    double histogramScaleX;\n    double histogramScaleY;\n\n\n    Vec4i facesROI = findROI(images.left);\n    qDebug()<<\"\\n\\n\\n\\n\\n\\n\\n----------------------------------------------------------------\\n\"<<\"Image size is \"<<images.left.size().width<<\"x\"<<images.left.size().height<<\"\\n\"<<\"Found faces in the box with corners (\"<<facesROI[0]<<\",\"<<facesROI[1]<<\") and (\"<<facesROI[2]<<\",\"<<facesROI[3]<<\")\"<<\"\\n\\n\\n\\n\\n\\n\\n----------------------------------------------------------------\\n\";\n\n    int numberOfSquares;\/\/Note that this is really the squareroot of the number of squares.\n                              \/\/Also since we dont want to select the squares in the border\n                              \/\/numberOfSquares need to be greater than 2.\n                              \/\/we will gather our data in a histogram object to see where the maxima are.\n    \/\/These 2 are really the number of squares our big square is composed of.\n    int maxX;\n    int maxY;\n    int squareWidth;\n    int squareHeight;\n    \/\/the faces roi has width or height 0 so its empty\n    if (facesROI[2] == 0 || facesROI[3] == 0)\n    {\n            numberOfSquares = 10;\n            maxX = 1;\n            maxY = 2;\n            squareWidth = 7;\n            squareHeight = 6;\n    }\n    else\n    {\n            numberOfSquares = 100;\n            maxX = (facesROI[0]*numberOfSquares)\/images.left.size().width;\n            maxY = (facesROI[1]*numberOfSquares)\/images.left.size().height;\n            squareWidth = (facesROI[2]*numberOfSquares)\/images.left.size().width;\n            squareHeight = (facesROI[3]*numberOfSquares)\/images.left.size().height;\n    }\n    \/\/creates a blank histogram that is 121X121 big\n    histogram *hist = new histogram(histogramSize, histogramSize);\n\n    qDebug()<<\"We are useing (x,y): (\"<<maxX<<\",\"<<maxY<<\")\";\n    for(int res = 50; res < 60; res++)\n    {\n         \/\/ Now we search for the local maxima of the image scaled to a resolution of res.\n         matPair scaledImages;\n         \/\/scale left and right images\n         scaledImages.left = ScaleImage(images.left,res, true);\n         scaledImages.right = ScaleImage(images.right,res, true);\n\n         \/\/returns a vector with the local maxima (peaks) of the input images.\n         \/\/A local peak is a data sample that is either larger than\n         \/\/its two neighboring samples or is equal to Inf.\n         \/\/Non-Inf signal endpoints are excluded. If a peak is flat,\n         \/\/the function returns only the point with the lowest index.\n         vector<Vec2i> pointsVector = findLocalMaxima(scaledImages.left,scaledImages.right,-scaledImages.left.size().width\/10,(scaledImages.left.size().width*2)\/3,-scaledImages.left.size().height\/5,scaledImages.left.size().height\/5,\n                                      0.75,0.125,0,(maxY*scaledImages.right.size().height)\/numberOfSquares,scaledImages.left.size().width-1,((maxX+squareWidth)*scaledImages.right.size().width)\/numberOfSquares,\n                                      scaledImages.left.size().height-1,((maxY+squareHeight)*scaledImages.right.size().height)\/numberOfSquares,0,(maxX*scaledImages.right.size().width)\/numberOfSquares,15);\n         histogramScaleX = histogramSize\/(double)((2*scaledImages.left.size().width)-1);\n         histogramScaleY = histogramSize\/(double)((2*scaledImages.right.size().height)-1);\n\n         \/\/adds points from pointsVector into the histogram\n         while(pointsVector.size() != 0)\n         {\n               hist->add(pointsVector.back()[0]*histogramScaleX+(histogramSize\/2), pointsVector.back()[1]*histogramScaleY+(histogramSize\/2));\n               pointsVector.pop_back();\n         }\n    }\n    if(hist->numberOfElements() == 0)\n    {\n          return images;\n    }\n    histogramScaleX = histogramSize\/(double)((2*images.left.size().width)-1);\n    histogramScaleY = histogramSize\/(double)((2*images.left.size().height)-1);\n\n    int dy = hist->getHighestColumn();\n\n    \/\/get the middle value of the collum dy\n    int dx = hist->getMedianOfColumn(dy);\n    \/\/get the middle value of the row dx\n    dy = hist->getMedianOfRow(dx);\n    qDebug()<<\"Median value:(x,y): (\"<<dx<<\",\"<<dy<<\")\";\n    dx = (dx-(histogramSize\/2))\/histogramScaleX;\n    dy = (dy-(histogramSize\/2))\/histogramScaleY;\n\n    qDebug()<<\"Shift by\"<<dx<<dy;\n    qDebug()<<hist->toString();\n\n    \/\/crops the images based on dx and dy\n    images.left = cropImage(images.left,dx,-dy);\n    images.right = cropImage(images.right,-dx,dy);\n\n    return images;\n}\n\nvoid Rectify::contourCropDiff(matPair images, int &left, int &top, int &right, int &bottom)\n{\n        top = 0;\n        bottom = 0;\n        left = 0;\n        right = 0;\n        Mat diff = getThresholdedDiff(images);\n        vector<vector<Point> > contours;\n        vector<Vec4i> hierarchy;\n        findContours(diff, contours,hierarchy, CV_RETR_TREE, CV_CHAIN_APPROX_SIMPLE, Point(0,0));\n        for (int i = 0; i< contours.size();i++)\n        {\n                if(contourArea(contours[i]) > diff.cols*diff.rows*0.02)\n                {\n                        Mat mask = Mat::zeros(diff.size(), CV_8UC1);\n                        drawContours(mask,contours,i,Scalar(255),CV_FILLED);\n                        int contourLeft = 0;\n                        int contourRight = 0;\n                        if(isVerticalRectangle(contours[i], mask, &contourLeft, &contourRight))\n                        {\n                                left = max(left, contourLeft);\n                                right = max(right, contourRight);\n                        }\n                }\n        }\n        return;\n}\n\n\n\/\/left, top, right and bottom contain the cropping info for the images.\nvoid Rectify::contourCropGray(matPair images, int &left, int &top, int &right, int &bottom)\n{\n        top = 0;\n        bottom = 0;\n        left = 0;\n        right = 0;\n\n        vector<vector<Point> > contoursL;\n        vector<vector<Point> > contoursR;\n        vector<Vec4i> hierarchyL;\n        vector<Vec4i> hierarchyR;\n        Mat grayThresholdL = thresholdGrayToWhite(images.left);\n        Mat grayThresholdR = thresholdGrayToWhite(images.right);\n        findContours(grayThresholdL, contoursL,hierarchyL, CV_RETR_TREE, CV_CHAIN_APPROX_SIMPLE, Point(0,0));\n        findContours(grayThresholdR, contoursR,hierarchyR, CV_RETR_TREE, CV_CHAIN_APPROX_SIMPLE, Point(0,0));\n\n                for (int i = 0; i< contoursL.size();i++)\n                {\n                        int areaL = contourArea(contoursL[i]);\n                        if (contourArea(contoursL[i]) > 0.02*images.left.cols*images.left.rows)\n                        {\n                                vector<Point> convex_hull;\n                                convexHull(contoursL[i], convex_hull);\n                                int convexHullArea = contourArea(convex_hull);\n                                Rect contourRect = boundingRect(contoursL[i]);\n                                bool isConvex = areaL\/(double)convexHullArea > 0.75;\n                                bool isAtTop = contourRect.y < 0.05*images.left.rows;\n                                bool isAtBottom = contourRect.y+contourRect.height > 0.95*images.left.rows;\n                                bool isShortAndWide = contourRect.width > 2*contourRect.height;\n                                if(isConvex && (isAtTop || isAtBottom) && isShortAndWide)\n                                {\n                                        if(isAtTop)\n                                        {\n                                                top = max(top, contourRect.y+contourRect.height);\n                                        }\n                                        else\n                                        {\n                                                bottom = max(bottom, images.left.rows-contourRect.y);\n                                        }\n                                }\n                        }\n                }\n                for (int i = 0; i< contoursR.size();i++)\n                {\n                        int areaR = contourArea(contoursR[i]);\n                        if (contourArea(contoursR[i]) > 0.02*images.right.cols*images.right.rows)\n                        {\n                                vector<Point> convex_hull;\n                                convexHull(contoursR[i], convex_hull);\n                                int convexHullArea = contourArea(convex_hull);\n                                Rect contourRect = boundingRect(contoursR[i]);\n                                bool isConvex = areaR\/(double)convexHullArea > 0.75;\n                                bool isAtTop = contourRect.y < 0.05*images.right.rows;\n                                bool isAtBottom = contourRect.y+contourRect.height > 0.95*images.right.rows;\n                                bool isShortAndWide = contourRect.width > 2*contourRect.height;\n                                if(isConvex && (isAtTop || isAtBottom) && isShortAndWide)\n                                {\n                                        if(isAtTop)\n                                        {\n                                                top = max(top, contourRect.y+contourRect.height);\n                                        }\n                                        else\n                                        {\n                                                bottom = max(bottom, images.right.rows-contourRect.y);\n                                        }\n                                }\n                        }\n\n                }\n    RectPair.left = cropImageBorders(images.left,0,right,0,left);\n    RectPair.right = cropImageBorders(images.right,0,right,0,left);\n\n}\n<commit_msg>even more commenting<commit_after>#include \"Rectify.h\"\nusing namespace std;\nusing namespace cv;\nRectify::Rectify(matPair inputPair)\n{\n    RectPair.left = inputPair.left;\n    RectPair.right = inputPair.right;\n    qDebug()<<\"finding local maxima\";\n    RectPair = LocalMaxima(RectPair);\n    qDebug()<<\"removing borders\";\n    RectPair = BorderRemoveal(RectPair);\n    qDebug()<<\"gradiant frame\";\n    RectPair = GradiantFrame(RectPair);\n    int top = 0;\n    int bottom = 0;\n    int left = 0;\n    int right = 0;\n    qDebug()<<\"contour crop diff\";\n    contourCropDiff(RectPair,left,top,right,bottom);\n    top = 0;\n    bottom = 0;\n    left = 0;\n    right = 0;\n    qDebug()<<\"contour crop gray\";\n    contourCropGray(RectPair,left,top,right,bottom);\n}\n\nmatPair Rectify::getCroppedPair()\n{\n    return RectPair;\n}\n\nmatPair Rectify::GradiantFrame(matPair images)\n{\n    matPair grayImages;\n    \/\/ convert image to grayscale\n    cvtColor(images.left, grayImages.left, CV_BGR2GRAY);\n    cvtColor(images.right, grayImages.right, CV_BGR2GRAY);\n    int heightSize = 350;\n    float heightScale = images.left.size().height\/(float)heightSize;\n\n    if(images.left.size().height>heightSize)\n    {\n          qDebug()<<\"------------------------------------------\\n\\n\\n\\n\\n\"<<\"image height was\"<<images.left.size().height<<\"so we scaled it and\"<<\"the scale factor is\"<<heightScale;\n          grayImages.left = ScaleImage(grayImages.left,heightSize, true);\n          grayImages.right = ScaleImage(grayImages.right,heightSize, true);\n    }\n    else\n    {\n            qDebug()<<\"--------------------------------------\\n\\n\\n\\n\\ndidnt scale the image since it was too smal\\n\\n\\n\\n--------------------------------------\";\n            heightScale = 1;\n    }\n    shiftInfo info = gradiantShiftAndDistortion(grayImages);\n\n    int finalDx = 0;\n    int finalDy = info.dy*heightScale;\n    images.left = cropImage(images.left,finalDx,finalDy);\n    images.right = cropImage(images.right,finalDx,finalDy);\n    return images;\n}\n\nmatPair Rectify::LocalMaxima(matPair images)\n{\n    int histogramSize = 121; \/\/Keep this an odd number or stuff might fail.\n    double histogramScaleX;\n    double histogramScaleY;\n\n\n    Vec4i facesROI = findROI(images.left);\n    qDebug()<<\"\\n\\n\\n\\n\\n\\n\\n----------------------------------------------------------------\\n\"<<\"Image size is \"<<images.left.size().width<<\"x\"<<images.left.size().height<<\"\\n\"<<\"Found faces in the box with corners (\"<<facesROI[0]<<\",\"<<facesROI[1]<<\") and (\"<<facesROI[2]<<\",\"<<facesROI[3]<<\")\"<<\"\\n\\n\\n\\n\\n\\n\\n----------------------------------------------------------------\\n\";\n\n    int numberOfSquares;\/\/Note that this is really the squareroot of the number of squares.\n                              \/\/Also since we dont want to select the squares in the border\n                              \/\/numberOfSquares need to be greater than 2.\n                              \/\/we will gather our data in a histogram object to see where the maxima are.\n    \/\/These 2 are really the number of squares our big square is composed of.\n    int maxX;\n    int maxY;\n    int squareWidth;\n    int squareHeight;\n    \/\/the faces roi has width or height 0 so its empty\n    if (facesROI[2] == 0 || facesROI[3] == 0)\n    {\n            numberOfSquares = 10;\n            maxX = 1;\n            maxY = 2;\n            squareWidth = 7;\n            squareHeight = 6;\n    }\n    else\n    {\n            numberOfSquares = 100;\n            maxX = (facesROI[0]*numberOfSquares)\/images.left.size().width;\n            maxY = (facesROI[1]*numberOfSquares)\/images.left.size().height;\n            squareWidth = (facesROI[2]*numberOfSquares)\/images.left.size().width;\n            squareHeight = (facesROI[3]*numberOfSquares)\/images.left.size().height;\n    }\n    \/\/creates a blank histogram that is 121X121 big\n    histogram *hist = new histogram(histogramSize, histogramSize);\n\n    qDebug()<<\"We are useing (x,y): (\"<<maxX<<\",\"<<maxY<<\")\";\n    for(int res = 50; res < 60; res++)\n    {\n         \/\/ Now we search for the local maxima of the image scaled to a resolution of res.\n         matPair scaledImages;\n         \/\/scale left and right images\n         scaledImages.left = ScaleImage(images.left,res, true);\n         scaledImages.right = ScaleImage(images.right,res, true);\n\n         \/\/returns a vector with the local maxima (peaks) of the input images.\n         \/\/A local peak is a data sample that is either larger than\n         \/\/its two neighboring samples or is equal to Inf.\n         \/\/Non-Inf signal endpoints are excluded. If a peak is flat,\n         \/\/the function returns only the point with the lowest index.\n         vector<Vec2i> pointsVector = findLocalMaxima(scaledImages.left,scaledImages.right,-scaledImages.left.size().width\/10,(scaledImages.left.size().width*2)\/3,-scaledImages.left.size().height\/5,scaledImages.left.size().height\/5,\n                                      0.75,0.125,0,(maxY*scaledImages.right.size().height)\/numberOfSquares,scaledImages.left.size().width-1,((maxX+squareWidth)*scaledImages.right.size().width)\/numberOfSquares,\n                                      scaledImages.left.size().height-1,((maxY+squareHeight)*scaledImages.right.size().height)\/numberOfSquares,0,(maxX*scaledImages.right.size().width)\/numberOfSquares,15);\n         histogramScaleX = histogramSize\/(double)((2*scaledImages.left.size().width)-1);\n         histogramScaleY = histogramSize\/(double)((2*scaledImages.right.size().height)-1);\n\n         \/\/adds points from pointsVector into the histogram\n         while(pointsVector.size() != 0)\n         {\n               hist->add(pointsVector.back()[0]*histogramScaleX+(histogramSize\/2), pointsVector.back()[1]*histogramScaleY+(histogramSize\/2));\n               pointsVector.pop_back();\n         }\n    }\n    \/\/if there are no elements in the histogram it returns the image as it is\n    if(hist->numberOfElements() == 0)\n    {\n          return images;\n    }\n    histogramScaleX = histogramSize\/(double)((2*images.left.size().width)-1);\n    histogramScaleY = histogramSize\/(double)((2*images.left.size().height)-1);\n\n    \/\/get the highest column\n    int dy = hist->getHighestColumn();\n\n    \/\/get the middle value of the column dy\n    int dx = hist->getMedianOfColumn(dy);\n    \/\/get the middle value of the row dx\n    dy = hist->getMedianOfRow(dx);\n    qDebug()<<\"Median value:(x,y): (\"<<dx<<\",\"<<dy<<\")\";\n    dx = (dx-(histogramSize\/2))\/histogramScaleX;\n    dy = (dy-(histogramSize\/2))\/histogramScaleY;\n\n    qDebug()<<\"Shift by\"<<dx<<dy;\n    qDebug()<<hist->toString();\n\n    \/\/crops the images based on dx and dy\n    images.left = cropImage(images.left,dx,-dy);\n    images.right = cropImage(images.right,-dx,dy);\n\n    return images;\n}\n\nvoid Rectify::contourCropDiff(matPair images, int &left, int &top, int &right, int &bottom)\n{\n        top = 0;\n        bottom = 0;\n        left = 0;\n        right = 0;\n        Mat diff = getThresholdedDiff(images);\n        vector<vector<Point> > contours;\n        vector<Vec4i> hierarchy;\n        \/\/finds shapes in the image\n\n        \/\/CV_RETR_LIST retrieves all of the contours without establishing any hierarchical relationships.\n        \/\/CV_CHAIN_APPROX_SIMPLE compresses horizontal, vertical, and diagonal segments\n        \/\/and leaves only their end points. For example, an up-right rectangular contour is encoded with 4 points.\n        \/\/CV_RETR_TREE retrieves all of the contours and reconstructs a full hierarchy of nested contours.\n        findContours(diff, contours,hierarchy, CV_RETR_TREE, CV_CHAIN_APPROX_SIMPLE, Point(0,0));\n\n        for (int i = 0; i< contours.size();i++)\n        {\n                \/\/checks if the calculateed contour area is bigger than diff.cols*diff.rows*0.02\n                if(contourArea(contours[i]) > diff.cols*diff.rows*0.02)\n                {\n                        Mat mask = Mat::zeros(diff.size(), CV_8UC1);\n                        \/\/Draws contours outlines or filled contours.\n                        drawContours(mask,contours,i,Scalar(255),CV_FILLED);\n                        int contourLeft = 0;\n                        int contourRight = 0;\n                        if(isVerticalRectangle(contours[i], mask, &contourLeft, &contourRight))\n                        {\n                                left = max(left, contourLeft);\n                                right = max(right, contourRight);\n                        }\n                }\n        }\n        return;\n}\n\n\n\/\/left, top, right and bottom contain the cropping info for the images.\nvoid Rectify::contourCropGray(matPair images, int &left, int &top, int &right, int &bottom)\n{\n        top = 0;\n        bottom = 0;\n        left = 0;\n        right = 0;\n        \/\/shapes and seperate areas in left image\n        vector<vector<Point> > contoursL;\n        \/\/shapes and seperate areas in right image\n        vector<vector<Point> > contoursR;\n\n        \/\/vectors, containing information about the left amd right image topology.\n        \/\/It has as many elements as the number of contours.\n        \/\/For each i-th contour contours[i] , the elements hierarchy[i][0] ,\n        \/\/hiearchy[i][1] , hiearchy[i][2] , and hiearchy[i][3] are set to\n        \/\/0-based indices in contours of the next and previous contours\n        \/\/at the same hierarchical level, the first child contour and the parent\n        \/\/contour, respectively. If for the contour i there are no next,\n        \/\/previous, parent, or nested contours, the corresponding elements of\n        \/\/hierarchy[i] will be negative\n        vector<Vec4i> hierarchyL;\n        vector<Vec4i> hierarchyR;\n\n        \/\/replaces all pixels in the input image with luminance greater than set threshold with the value for white (white)\n        Mat grayThresholdL = thresholdGrayToWhite(images.left);\n        Mat grayThresholdR = thresholdGrayToWhite(images.right);\n        \/\/finds shapes in the image\n\n        \/\/CV_RETR_LIST retrieves all of the contours without establishing any hierarchical relationships.\n        \/\/CV_CHAIN_APPROX_SIMPLE compresses horizontal, vertical, and diagonal segments\n        \/\/and leaves only their end points. For example, an up-right rectangular contour is encoded with 4 points.\n        \/\/CV_RETR_TREE retrieves all of the contours and reconstructs a full hierarchy of nested contours.\n        findContours(grayThresholdL, contoursL,hierarchyL, CV_RETR_TREE, CV_CHAIN_APPROX_SIMPLE, Point(0,0));\n        \/\/finds shapes in the image\n\n        \/\/CV_RETR_LIST retrieves all of the contours without establishing any hierarchical relationships.\n        \/\/CV_CHAIN_APPROX_SIMPLE compresses horizontal, vertical, and diagonal segments\n        \/\/and leaves only their end points. For example, an up-right rectangular contour is encoded with 4 points.\n        \/\/CV_RETR_TREE retrieves all of the contours and reconstructs a full hierarchy of nested contours.\n        findContours(grayThresholdR, contoursR,hierarchyR, CV_RETR_TREE, CV_CHAIN_APPROX_SIMPLE, Point(0,0));\n\n                for (int i = 0; i< contoursL.size();i++)\n                {\n                        int areaL = contourArea(contoursL[i]);\n                        if (contourArea(contoursL[i]) > 0.02*images.left.cols*images.left.rows)\n                        {\n                                vector<Point> convex_hull;\n                                convexHull(contoursL[i], convex_hull);\n                                int convexHullArea = contourArea(convex_hull);\n                                Rect contourRect = boundingRect(contoursL[i]);\n                                bool isConvex = areaL\/(double)convexHullArea > 0.75;\n                                bool isAtTop = contourRect.y < 0.05*images.left.rows;\n                                bool isAtBottom = contourRect.y+contourRect.height > 0.95*images.left.rows;\n                                bool isShortAndWide = contourRect.width > 2*contourRect.height;\n                                if(isConvex && (isAtTop || isAtBottom) && isShortAndWide)\n                                {\n                                        if(isAtTop)\n                                        {\n                                                top = max(top, contourRect.y+contourRect.height);\n                                        }\n                                        else\n                                        {\n                                                bottom = max(bottom, images.left.rows-contourRect.y);\n                                        }\n                                }\n                        }\n                }\n                for (int i = 0; i< contoursR.size();i++)\n                {\n                        \/\/Calculates a contour area.\n                        int areaR = contourArea(contoursR[i]);\n                        if (contourArea(contoursR[i]) > 0.02*images.right.cols*images.right.rows)\n                        {\n                                vector<Point> convex_hull;\n                                \/\/The functions find the convex hull of a 2D point set\n                                \/\/using the Sklansky’s algorithm that has O(N logN)\n                                \/\/complexity in the current implementation.\n                                convexHull(contoursR[i], convex_hull);\n                                \/\/Calculates a contour area.\n                                int convexHullArea = contourArea(convex_hull);\n                                \/\/Calculates the up-right bounding rectangle of a point set.\n                                Rect contourRect = boundingRect(contoursR[i]);\n                                bool isConvex = areaR\/(double)convexHullArea > 0.75;\n                                bool isAtTop = contourRect.y < 0.05*images.right.rows;\n                                bool isAtBottom = contourRect.y+contourRect.height > 0.95*images.right.rows;\n                                bool isShortAndWide = contourRect.width > 2*contourRect.height;\n                                if(isConvex && (isAtTop || isAtBottom) && isShortAndWide)\n                                {\n                                        if(isAtTop)\n                                        {\n                                                top = max(top, contourRect.y+contourRect.height);\n                                        }\n                                        else\n                                        {\n                                                bottom = max(bottom, images.right.rows-contourRect.y);\n                                        }\n                                }\n                        }\n\n                }\n    \/\/crops image pair\n    RectPair.left = cropImageBorders(images.left,0,right,0,left);\n    RectPair.right = cropImageBorders(images.right,0,right,0,left);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QCoreApplication>\n#include <QObject>\n#include <QTcpServer>\n#include <QTcpSocket>\n#include <QHostAddress>\n#include <QStringBuilder>\n#include <QVector>\n#include <functional>\n\n#include \"request.hpp\"\n#include \"response.hpp\"\n#include \"context.hpp\"\n\n\/\/!\n\/\/! \\brief The HttpServer class\n\/\/! Http (unsecure) server class\n\/\/!\nclass HttpServer : public QObject\n{\n    Q_OBJECT\n\npublic:\n    HttpServer(QObject *parent = NULL);\n    ~HttpServer();\n\n    bool compose(quint64 port, QHostAddress address = QHostAddress::Any);\n\nprivate:\n    QTcpServer m_tcp_server;\n    quint64 m_port;\n    QHostAddress m_address;\n    QObject *m_parent;\n};\n\ninline HttpServer::HttpServer(QObject *parent)\n{\n    m_parent = parent;\n};\n\ninline HttpServer::~HttpServer()\n{\n\n};\n\ninline bool HttpServer::compose(quint64 port, QHostAddress address)\n{\n    m_port = port;\n    m_address = address;\n\n    if (!m_tcp_server.listen(address, port)) {\n        qDebug() << \"failed to start listening\";\n        return false;\n    }\n\n    connect(&m_tcp_server, &QTcpServer::newConnection, [this] {\n        qDebug() << \"client connected\";\n\n        \/\/ TODO: create ctx (need parent's ref here?)\n    });\n\n    return true;\n};\n\n\/\/!\n\/\/! \\brief The Recurse class\n\/\/! main class of the app\n\/\/!\nclass Recurse : public QObject\n{\n    Q_OBJECT\n\n    using void_f = std::function<void()>;\n    using void_ff = std::function<void(void_f prev)>;\n    using next_prev_f = std::function<void(Context &ctx, void_ff next, void_f prev)>;\n    using next_f = std::function<void(Context &ctx, void_f next)>;\n    using final_f =  std::function<void(Context &ctx)>;\n\npublic:\n    Recurse(int & argc, char ** argv, QObject *parent = NULL);\n    ~Recurse();\n\n    bool listen(quint64 port, QHostAddress address = QHostAddress::Any);\n    bool listen(HttpServer *server);\n    void tester();\n\nprivate:\n    QCoreApplication app;\n    HttpServer *http;\n};\n\ninline Recurse::Recurse(int & argc, char ** argv, QObject *parent) : app(argc, argv)\n{\n    Q_UNUSED(parent);\n};\n\ninline Recurse::~Recurse()\n{\n    delete http;\n};\n\n\/\/!\n\/\/! \\brief Recurse::listen\n\/\/! listen for tcp requests\n\/\/!\n\/\/! \\param port tcp server port\n\/\/! \\param address tcp server listening address\n\/\/!\n\/\/! \\return true on success\n\/\/!\ninline bool Recurse::listen(quint64 port, QHostAddress address)\n{\n    http = new HttpServer(this);\n    http->compose(port, address);\n\n    return app.exec();\n};\n\n\/\/!\n\/\/! \\brief Recurse::listen\n\/\/! listen for tcp requests\n\/\/!\n\/\/! overloaded function\n\/\/!\n\/\/! \\param server pointer to the HttpServer instance\n\/\/!\n\/\/! \\return true on success\n\/\/!\ninline bool Recurse::listen(HttpServer *server)\n{\n    http = server;\n\n    return app.exec();\n};\n\n\ninline void Recurse::tester()\n{\n    qDebug() << \"test function\";\n};\n<commit_msg>add signal 'createContext' and its corresponding slot and connect Recurse to it<commit_after>#include <QCoreApplication>\n#include <QObject>\n#include <QTcpServer>\n#include <QTcpSocket>\n#include <QHostAddress>\n#include <QStringBuilder>\n#include <QVector>\n#include <functional>\n\n#include \"request.hpp\"\n#include \"response.hpp\"\n#include \"context.hpp\"\n\n\/\/!\n\/\/! \\brief The HttpServer class\n\/\/! Http (unsecure) server class\n\/\/!\nclass HttpServer : public QObject\n{\n    Q_OBJECT\n\npublic:\n    HttpServer(QObject *parent = NULL);\n    ~HttpServer();\n\n    bool compose(quint64 port, QHostAddress address = QHostAddress::Any);\n\nprivate:\n    QTcpServer m_tcp_server;\n    quint64 m_port;\n    QHostAddress m_address;\n    QObject *m_parent;\n\nsignals:\n    void createContext();\n};\n\ninline HttpServer::HttpServer(QObject *parent)\n{\n    m_parent = parent;\n};\n\ninline HttpServer::~HttpServer()\n{\n\n};\n\ninline bool HttpServer::compose(quint64 port, QHostAddress address)\n{\n    m_port = port;\n    m_address = address;\n\n    if (!m_tcp_server.listen(address, port)) {\n        qDebug() << \"failed to start listening\";\n        return false;\n    }\n\n    connect(&m_tcp_server, &QTcpServer::newConnection, [this] {\n        qDebug() << \"client connected\";\n\n        emit createContext();\n        \/\/ TODO: create ctx (need parent's ref here?)\n    });\n\n    return true;\n};\n\n\/\/!\n\/\/! \\brief The Recurse class\n\/\/! main class of the app\n\/\/!\nclass Recurse : public QObject\n{\n    Q_OBJECT\n\n    using void_f = std::function<void()>;\n    using void_ff = std::function<void(void_f prev)>;\n    using next_prev_f = std::function<void(Context &ctx, void_ff next, void_f prev)>;\n    using next_f = std::function<void(Context &ctx, void_f next)>;\n    using final_f =  std::function<void(Context &ctx)>;\n\npublic:\n    Recurse(int & argc, char ** argv, QObject *parent = NULL);\n    ~Recurse();\n\n    bool listen(quint64 port, QHostAddress address = QHostAddress::Any);\n    bool listen(HttpServer *server);\n\npublic slots:\n    bool createContext();\n\nprivate:\n    QCoreApplication app;\n    HttpServer *http;\n};\n\ninline Recurse::Recurse(int & argc, char ** argv, QObject *parent) : app(argc, argv)\n{\n    Q_UNUSED(parent);\n};\n\ninline Recurse::~Recurse()\n{\n    delete http;\n};\n\n\/\/!\n\/\/! \\brief Recurse::createContext\n\/\/! creates new recurse context for a tcp session\n\/\/!\n\/\/! \\return true on success\n\/\/!\ninline bool Recurse::createContext()\n{\n    qDebug() << \"creating new context\";\n    return true;\n};\n\n\/\/!\n\/\/! \\brief Recurse::listen\n\/\/! listen for tcp requests\n\/\/!\n\/\/! \\param port tcp server port\n\/\/! \\param address tcp server listening address\n\/\/!\n\/\/! \\return true on success\n\/\/!\ninline bool Recurse::listen(quint64 port, QHostAddress address)\n{\n    \/\/ set HttpServer instance, send reference to this object and prepare http connection\n    http = new HttpServer(this);\n    http->compose(port, address);\n\n    \/\/ connect HttpServer signal 'createContext' to this class' 'createContext' slot\n    connect(http, &HttpServer::createContext, this, &Recurse::createContext);\n    return app.exec();\n};\n\n\/\/!\n\/\/! \\brief Recurse::listen\n\/\/! listen for tcp requests\n\/\/!\n\/\/! overloaded function\n\/\/!\n\/\/! \\param server pointer to the HttpServer instance\n\/\/!\n\/\/! \\return true on success\n\/\/!\ninline bool Recurse::listen(HttpServer *server)\n{\n    http = server;\n\n    \/\/ connect HttpServer signal 'createContext' to this class' 'createContext' slot\n    connect(http, &HttpServer::createContext, this, &Recurse::createContext);\n    return app.exec();\n};\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012, Cloudera, inc.\n\n#include <utility>\n\n#include \"tablet\/deltafile.h\"\n#include \"tablet\/deltamemstore.h\"\n#include \"util\/hexdump.h\"\n#include \"util\/status.h\"\n\nnamespace kudu { namespace tablet {\n\nstruct EncodedKeySlice : public Slice {\npublic:\n  explicit EncodedKeySlice(uint32_t row_idx) :\n    Slice(reinterpret_cast<const char *>(&buf_int_),\n          sizeof(uint32_t)),\n    buf_int_(htonl(row_idx))\n  {\n  }\n\nprivate:\n  uint32_t buf_int_;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DeltaMemStore implementation\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDeltaMemStore::DeltaMemStore(const Schema &schema) :\n  schema_(schema),\n  arena_(8*1024, 1*1024*1024)\n{\n}\n\n\nvoid DeltaMemStore::Update(uint32_t row_idx,\n                           const RowDelta &update) {\n  EncodedKeySlice key(row_idx);\n\n  btree::PreparedMutation<btree::BTreeTraits> mutation(key);\n  mutation.Prepare(&tree_);\n  if (mutation.exists()) {\n    \/\/ This row was already updated - just merge the new updates\n    \/\/ in with the old.\n    Slice cur_val = mutation.current_mutable_value();\n\n    RowDelta cur_delta = DecodeDelta(&cur_val);\n    cur_delta.MergeUpdatesFrom(schema_, update, &arena_);\n  } else {\n    \/\/ This row hasn't been updated. Create a new delta for it.\n    \/\/ Copy the update into the arena.\n    \/\/ TODO: no need to copy the update - just need to copy the\n    \/\/ referred-to data!\n    RowDelta copied = update.CopyToArena(schema_, &arena_);\n    Slice new_val(reinterpret_cast<char *>(&copied), sizeof(copied));\n    CHECK(mutation.Insert(new_val));\n  }\n}\n\n\nStatus DeltaMemStore::ApplyUpdates(\n  size_t col_idx, uint32_t start_row,\n  ColumnBlock *dst) const\n{\n  DCHECK_EQ(schema_.column(col_idx).type_info().type(),\n            dst->type_info().type());\n\n  scoped_ptr<DMSTreeIter> iter(tree_.NewIterator());\n\n  EncodedKeySlice start_key(start_row);\n\n  bool exact;\n  if (!iter->SeekAtOrAfter(start_key, &exact)) {\n    \/\/ No updates matching this row or higher\n    return Status::OK();\n  }\n\n  while (iter->IsValid()) {\n    Slice key, val;\n    iter->GetCurrentEntry(&key, &val);\n    uint32_t decoded_key = DecodeKey(key);\n    DCHECK_GE(decoded_key, start_row);\n    if (decoded_key > start_row + dst->size()) {\n      break;\n    }\n\n    uint32_t rel_idx = decoded_key - start_row;\n\n    RowDelta delta = DecodeDelta(&val);\n    delta.ApplyColumnUpdate(schema_, col_idx,\n                            dst->cell_ptr(rel_idx));\n    iter->Next();\n  }\n\n  return Status::OK();\n}\n\nStatus DeltaMemStore::FlushToFile(DeltaFileWriter *dfw) const {\n  scoped_ptr<DMSTreeIter> iter(tree_.NewIterator());\n  iter->SeekToStart();\n  while (iter->IsValid()) {\n    Slice key, val;\n    iter->GetCurrentEntry(&key, &val);\n    uint32_t row_idx = DecodeKey(key);\n    RowDelta delta = DecodeDelta(&val);\n    dfw->AppendDelta(row_idx, delta);\n    iter->Next();\n  }\n  return Status::OK();\n}\n\nuint32_t DeltaMemStore::DecodeKey(const Slice &key) const {\n  DCHECK_EQ(sizeof(uint32_t), key.size());\n  return ntohl(*reinterpret_cast<const uint32_t *>(key.data()));\n}\n\nRowDelta DeltaMemStore::DecodeDelta(Slice *val) const {\n  DCHECK_EQ(sizeof(RowDelta), val->size());\n  return *reinterpret_cast<RowDelta *>(val->mutable_data());\n}\n\n\n\n} \/\/ namespace tablet\n} \/\/ namespace kudu\n<commit_msg>deltamemstore: fix an off-by-one in calculating application of deltas<commit_after>\/\/ Copyright (c) 2012, Cloudera, inc.\n\n#include <utility>\n\n#include \"tablet\/deltafile.h\"\n#include \"tablet\/deltamemstore.h\"\n#include \"util\/hexdump.h\"\n#include \"util\/status.h\"\n\nnamespace kudu { namespace tablet {\n\nstruct EncodedKeySlice : public Slice {\npublic:\n  explicit EncodedKeySlice(uint32_t row_idx) :\n    Slice(reinterpret_cast<const char *>(&buf_int_),\n          sizeof(uint32_t)),\n    buf_int_(htonl(row_idx))\n  {\n  }\n\nprivate:\n  uint32_t buf_int_;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DeltaMemStore implementation\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDeltaMemStore::DeltaMemStore(const Schema &schema) :\n  schema_(schema),\n  arena_(8*1024, 1*1024*1024)\n{\n}\n\n\nvoid DeltaMemStore::Update(uint32_t row_idx,\n                           const RowDelta &update) {\n  EncodedKeySlice key(row_idx);\n\n  btree::PreparedMutation<btree::BTreeTraits> mutation(key);\n  mutation.Prepare(&tree_);\n  if (mutation.exists()) {\n    \/\/ This row was already updated - just merge the new updates\n    \/\/ in with the old.\n    Slice cur_val = mutation.current_mutable_value();\n\n    RowDelta cur_delta = DecodeDelta(&cur_val);\n    cur_delta.MergeUpdatesFrom(schema_, update, &arena_);\n  } else {\n    \/\/ This row hasn't been updated. Create a new delta for it.\n    \/\/ Copy the update into the arena.\n    \/\/ TODO: no need to copy the update - just need to copy the\n    \/\/ referred-to data!\n    RowDelta copied = update.CopyToArena(schema_, &arena_);\n    Slice new_val(reinterpret_cast<char *>(&copied), sizeof(copied));\n    CHECK(mutation.Insert(new_val));\n  }\n}\n\n\nStatus DeltaMemStore::ApplyUpdates(\n  size_t col_idx, uint32_t start_row,\n  ColumnBlock *dst) const\n{\n  DCHECK_EQ(schema_.column(col_idx).type_info().type(),\n            dst->type_info().type());\n\n  scoped_ptr<DMSTreeIter> iter(tree_.NewIterator());\n\n  EncodedKeySlice start_key(start_row);\n\n  bool exact;\n  if (!iter->SeekAtOrAfter(start_key, &exact)) {\n    \/\/ No updates matching this row or higher\n    return Status::OK();\n  }\n\n  while (iter->IsValid()) {\n    Slice key, val;\n    iter->GetCurrentEntry(&key, &val);\n    uint32_t decoded_key = DecodeKey(key);\n    DCHECK_GE(decoded_key, start_row);\n    if (decoded_key >= start_row + dst->size()) {\n      break;\n    }\n\n    uint32_t rel_idx = decoded_key - start_row;\n\n    RowDelta delta = DecodeDelta(&val);\n    delta.ApplyColumnUpdate(schema_, col_idx,\n                            dst->cell_ptr(rel_idx));\n    iter->Next();\n  }\n\n  return Status::OK();\n}\n\nStatus DeltaMemStore::FlushToFile(DeltaFileWriter *dfw) const {\n  scoped_ptr<DMSTreeIter> iter(tree_.NewIterator());\n  iter->SeekToStart();\n  while (iter->IsValid()) {\n    Slice key, val;\n    iter->GetCurrentEntry(&key, &val);\n    uint32_t row_idx = DecodeKey(key);\n    RowDelta delta = DecodeDelta(&val);\n    dfw->AppendDelta(row_idx, delta);\n    iter->Next();\n  }\n  return Status::OK();\n}\n\nuint32_t DeltaMemStore::DecodeKey(const Slice &key) const {\n  DCHECK_EQ(sizeof(uint32_t), key.size());\n  return ntohl(*reinterpret_cast<const uint32_t *>(key.data()));\n}\n\nRowDelta DeltaMemStore::DecodeDelta(Slice *val) const {\n  DCHECK_EQ(sizeof(RowDelta), val->size());\n  return *reinterpret_cast<RowDelta *>(val->mutable_data());\n}\n\n\n\n} \/\/ namespace tablet\n} \/\/ namespace kudu\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This is core\/vnl\/algo\/vnl_lsqr.cxx\n#ifdef VCL_NEEDS_PRAGMA_INTERFACE\n#pragma implementation\n#endif\n\/\/\n\/\/ vnl_lsqr\n\/\/ Author: David Capel\n\/\/ Created: July 2000\n\/\/\n\/\/-----------------------------------------------------------------------------\n\n#include \"vnl_lsqr.h\"\n#include <vcl_vector.h>\n#include <vcl_iostream.h>\n#include <vnl\/vnl_vector_ref.h>\n\n#include <vnl\/algo\/vnl_netlib.h> \/\/ lsqr_()\n\n#include \"lsqrBase.h\"\n\nclass lsqrVNL : public lsqrBase\n{\npublic:\n\n  lsqrVNL()\n    {\n    this->ls_ = NULL;\n    }\n\n  virtual ~lsqrVNL()\n    {\n    }\n\n  \/**\n   * computes y = y + A*x without altering x,\n   * where A is a matrix of dimensions A[m][n].\n   * The size of the vector x is n.\n   * The size of the vector y is m.\n   *\/\n  void Aprod1(unsigned int m, unsigned int n, const double * x, double * y ) const\n    {\n    vnl_vector_ref<double> x_ref(n, const_cast<double*>(x) );\n    vnl_vector_ref<double> y_ref(m,y);\n\n    vnl_vector_ref<double> tmp(m,rw);\n    this->ls_->multiply(x_ref, tmp);\n    y_ref += tmp;\n    }\n \n\n  \/**\n   * computes x = x + A'*y without altering y,\n   * where A is a matrix of dimensions A[m][n].\n   * The size of the vector x is n.\n   * The size of the vector y is m.\n   *\/\n  void Aprod2(unsigned int m, unsigned int n, double * x, const double * y ) const\n    {\n    vnl_vector_ref<double> x_ref(n,x);\n    vnl_vector_ref<double> y_ref(m, const_cast<double*>( y ) );\n\n    vnl_vector_ref<double> tmp(n,rw);\n    this->ls_->transpose_multiply(y_ref, tmp);\n    x_ref += tmp;\n    }\n  \n  \/** Set the linear system to be solved A*x = b. *\/\n  void SetLinearSystem( vnl_linear_system * inls )\n    {\n    this->ls_ = inls;\n    }\n\n  void SetWorkingSpace( double * inrw )\n    {\n    this->rw = inrw;\n    }\n\nprivate:\n\n  vnl_linear_system * ls_;\n  \n  double * rw;\n};\n\n\nvnl_lsqr::~vnl_lsqr()\n{\n}\n\n\/\/ Requires number_of_residuals() of workspace in rw.\nint vnl_lsqr::aprod_(long* mode, long* m, long* n, double* x, double* y, long* \/*leniw*\/, long* \/*lenrw*\/, long* \/*iw*\/, double* rw, void* userdata)\n{\n  \/\/\n  \/\/ THIS CODE IS DEPRECATED\n  \/\/ THE FUNCTIONALITY HAS BEEN MOVED TO THE lsqrVNL class above.\n  \/\/ THE FUNCTIONS IS CONSERVED HERE ONLY FOR BACKWARD COMPATIBILITY.\n  \/\/\n  vnl_lsqr* self = static_cast<vnl_lsqr*>(userdata);\n\n  \/\/  If MODE = 1, compute  y = y + A*x.\n  \/\/  If MODE = 2, compute  x = x + A(transpose)*y.\n\n  vnl_vector_ref<double> x_ref(*n,x);\n  vnl_vector_ref<double> y_ref(*m,y);\n\n  if (*mode == 1) {\n    vnl_vector_ref<double> tmp(*m,rw);\n    self->ls_->multiply(x_ref, tmp);\n    y_ref += tmp;\n  }\n  else {\n    vnl_vector_ref<double> tmp(*n,rw);\n    self->ls_->transpose_multiply(y_ref, tmp);\n    x_ref += tmp;\n  }\n\n  return 0;\n}\n\nint vnl_lsqr::minimize(vnl_vector<double>& result)\n{\n  long m = ls_->get_number_of_residuals();\n  long n = ls_->get_number_of_unknowns();\n  double damp = 0;\n  long leniw = 1;\n  long* iw = 0;\n  long lenrw = m;\n#ifdef __GNUC__\n  double rw[m];\n  double v[n];\n  double w[n];\n  double se[n];\n#else\n  vcl_vector<double> rw(m);\n  vcl_vector<double> v(n);\n  vcl_vector<double> w(n);\n  vcl_vector<double> se(n);\n#endif\n  double atol = 0;\n  double btol = 0;\n  double conlim = 0;\n  long nout = -1;\n  double anorm, acond, rnorm, arnorm, xnorm;\n\n  vnl_vector<double> rhs(m);\n  ls_->get_rhs(rhs);\n\n  lsqrVNL solver;\n\n  solver.SetDamp( damp );\n  solver.SetLinearSystem( this->ls_ );\n  solver.SetWorkingSpace( &rw[0] );\n  solver.SetMaximumNumberOfIterations( max_iter_ );\n  solver.SetStandardErrorEstimates( &se[0] );\n  solver.SetToleranceA( atol );\n  solver.SetToleranceB( btol );\n\n  solver.Solve( m, n, rhs.data_block(), result.data_block() );\n\n#ifdef THIS_CODE_IS_DISABLED_BECAUSE_THE_LSQR_CODE_FROM_NETLIB_WAS_COPYRIGHTED_BY_ACM\n  v3p_netlib_lsqr_(\n        &m, &n, aprod_, &damp, &leniw, &lenrw, iw, &rw[0],\n        rhs.data_block(), &v[0], &w[0], result.data_block(), &se[0],\n        &atol, &btol, &conlim, &max_iter_, &nout, &return_code_,\n        &num_iter_, &anorm, &acond, &rnorm, &arnorm, &xnorm,\n        this);\n#endif\n\n  resid_norm_estimate_ = solver.GetFinalEstimateOfNormRbar();\n  result_norm_estimate_ = solver.GetFinalEstimateOfNormOfX();\n  A_condition_estimate_ = solver.GetConditionNumberEstimateOfAbar();\n  return_code_ = solver.GetStoppingReason();\n  num_iter_ = solver.GetNumberOfIterationsPerformed();\n  anorm = solver.GetFrobeniusNormEstimateOfAbar();\n  arnorm = solver.GetFinalEstimateOfNormOfResiduals();\n\n#if 0\n  vcl_cerr << \"A Fro norm estimate      = \" << anorm << vcl_endl\n           << \"A condition estimate     = \" << acond << vcl_endl\n           << \"Residual norm estimate   = \" << rnorm << vcl_endl\n           << \"A'(Ax - b) norm estimate = \" << arnorm << vcl_endl\n           << \"x norm estimate          = \" << xnorm << vcl_endl;\n#endif\n\n  \/\/ We should return the return code, as translate_return_code is public and\n  \/\/ it is very misleading that the return code from this function can't be fed\n  \/\/ into translate_return_code. (Brian Amberg)\n  return return_code_;\n}\n\nvoid vnl_lsqr::diagnose_outcome(vcl_ostream& os) const\n{\n  translate_return_code(os, return_code_);\n  os << __FILE__ \" : residual norm estimate = \" << resid_norm_estimate_ << vcl_endl\n     << __FILE__ \" : result norm estimate   = \" << result_norm_estimate_ << vcl_endl\n     << __FILE__ \" : condition no. estimate = \" << A_condition_estimate_ << vcl_endl\n     << __FILE__ \" : iterations             = \" << num_iter_ << vcl_endl;\n}\n\nvoid vnl_lsqr::translate_return_code(vcl_ostream& os, int rc)\n{\n  const char* vnl_lsqr_reasons[] = {\n   \"x = 0  is the exact solution. No iterations were performed.\",\n   \"The equations A*x = b are probably compatible.  \"\n       \"Norm(A*x - b) is sufficiently small, given the \"\n       \"values of ATOL and BTOL.\",\n   \"The system A*x = b is probably not compatible.  \"\n       \"A least-squares solution has been obtained that is \"\n       \"sufficiently accurate, given the value of ATOL.\",\n   \"An estimate of cond(Abar) has exceeded CONLIM.  \"\n       \"The system A*x = b appears to be ill-conditioned.  \"\n       \"Otherwise, there could be an error in subroutine APROD.\",\n   \"The equations A*x = b are probably compatible.  \"\n       \"Norm(A*x - b) is as small as seems reasonable on this machine.\",\n   \"The system A*x = b is probably not compatible.  A least-squares \"\n       \"solution has been obtained that is as accurate as seems \"\n       \"reasonable on this machine.\",\n   \"Cond(Abar) seems to be so large that there is no point in doing further \"\n       \"iterations, given the precision of this machine. \"\n       \"There could be an error in subroutine APROD.\",\n   \"The iteration limit ITNLIM was reached.\"\n  };\n\n  if\n    (rc < 0 || rc > 7) os << __FILE__ \" : Illegal return code : \" << rc << vcl_endl;\n  else\n    os << __FILE__ \" : \" << vnl_lsqr_reasons[rc] << vcl_endl;\n}\n<commit_msg>COMP: Moving unused variables inside #ifdef that disables the call to lsqr       function.<commit_after>\/\/ This is core\/vnl\/algo\/vnl_lsqr.cxx\n#ifdef VCL_NEEDS_PRAGMA_INTERFACE\n#pragma implementation\n#endif\n\/\/\n\/\/ vnl_lsqr\n\/\/ Author: David Capel\n\/\/ Created: July 2000\n\/\/\n\/\/-----------------------------------------------------------------------------\n\n#include \"vnl_lsqr.h\"\n#include <vcl_vector.h>\n#include <vcl_iostream.h>\n#include <vnl\/vnl_vector_ref.h>\n\n#include <vnl\/algo\/vnl_netlib.h> \/\/ lsqr_()\n\n#include \"lsqrBase.h\"\n\nclass lsqrVNL : public lsqrBase\n{\npublic:\n\n  lsqrVNL()\n    {\n    this->ls_ = NULL;\n    }\n\n  virtual ~lsqrVNL()\n    {\n    }\n\n  \/**\n   * computes y = y + A*x without altering x,\n   * where A is a matrix of dimensions A[m][n].\n   * The size of the vector x is n.\n   * The size of the vector y is m.\n   *\/\n  void Aprod1(unsigned int m, unsigned int n, const double * x, double * y ) const\n    {\n    vnl_vector_ref<double> x_ref(n, const_cast<double*>(x) );\n    vnl_vector_ref<double> y_ref(m,y);\n\n    vnl_vector_ref<double> tmp(m,rw);\n    this->ls_->multiply(x_ref, tmp);\n    y_ref += tmp;\n    }\n \n\n  \/**\n   * computes x = x + A'*y without altering y,\n   * where A is a matrix of dimensions A[m][n].\n   * The size of the vector x is n.\n   * The size of the vector y is m.\n   *\/\n  void Aprod2(unsigned int m, unsigned int n, double * x, const double * y ) const\n    {\n    vnl_vector_ref<double> x_ref(n,x);\n    vnl_vector_ref<double> y_ref(m, const_cast<double*>( y ) );\n\n    vnl_vector_ref<double> tmp(n,rw);\n    this->ls_->transpose_multiply(y_ref, tmp);\n    x_ref += tmp;\n    }\n  \n  \/** Set the linear system to be solved A*x = b. *\/\n  void SetLinearSystem( vnl_linear_system * inls )\n    {\n    this->ls_ = inls;\n    }\n\n  void SetWorkingSpace( double * inrw )\n    {\n    this->rw = inrw;\n    }\n\nprivate:\n\n  vnl_linear_system * ls_;\n  \n  double * rw;\n};\n\n\nvnl_lsqr::~vnl_lsqr()\n{\n}\n\n\/\/ Requires number_of_residuals() of workspace in rw.\nint vnl_lsqr::aprod_(long* mode, long* m, long* n, double* x, double* y, long* \/*leniw*\/, long* \/*lenrw*\/, long* \/*iw*\/, double* rw, void* userdata)\n{\n  \/\/\n  \/\/ THIS CODE IS DEPRECATED\n  \/\/ THE FUNCTIONALITY HAS BEEN MOVED TO THE lsqrVNL class above.\n  \/\/ THE FUNCTIONS IS CONSERVED HERE ONLY FOR BACKWARD COMPATIBILITY.\n  \/\/\n  vnl_lsqr* self = static_cast<vnl_lsqr*>(userdata);\n\n  \/\/  If MODE = 1, compute  y = y + A*x.\n  \/\/  If MODE = 2, compute  x = x + A(transpose)*y.\n\n  vnl_vector_ref<double> x_ref(*n,x);\n  vnl_vector_ref<double> y_ref(*m,y);\n\n  if (*mode == 1) {\n    vnl_vector_ref<double> tmp(*m,rw);\n    self->ls_->multiply(x_ref, tmp);\n    y_ref += tmp;\n  }\n  else {\n    vnl_vector_ref<double> tmp(*n,rw);\n    self->ls_->transpose_multiply(y_ref, tmp);\n    x_ref += tmp;\n  }\n\n  return 0;\n}\n\nint vnl_lsqr::minimize(vnl_vector<double>& result)\n{\n  long m = ls_->get_number_of_residuals();\n  long n = ls_->get_number_of_unknowns();\n  double damp = 0;\n  long leniw = 1;\n  long* iw = 0;\n  long lenrw = m;\n#ifdef __GNUC__\n  double rw[m];\n  double v[n];\n  double w[n];\n  double se[n];\n#else\n  vcl_vector<double> rw(m);\n  vcl_vector<double> v(n);\n  vcl_vector<double> w(n);\n  vcl_vector<double> se(n);\n#endif\n  double atol = 0;\n  double btol = 0;\n  double conlim = 0;\n  long nout = -1;\n  double anorm, arnorm;\n\n  vnl_vector<double> rhs(m);\n  ls_->get_rhs(rhs);\n\n  lsqrVNL solver;\n\n  solver.SetDamp( damp );\n  solver.SetLinearSystem( this->ls_ );\n  solver.SetWorkingSpace( &rw[0] );\n  solver.SetMaximumNumberOfIterations( max_iter_ );\n  solver.SetStandardErrorEstimates( &se[0] );\n  solver.SetToleranceA( atol );\n  solver.SetToleranceB( btol );\n\n  solver.Solve( m, n, rhs.data_block(), result.data_block() );\n\n#ifdef THIS_CODE_IS_DISABLED_BECAUSE_THE_LSQR_CODE_FROM_NETLIB_WAS_COPYRIGHTED_BY_ACM\n  double acond, rnorm, xnorm;\n  v3p_netlib_lsqr_(\n        &m, &n, aprod_, &damp, &leniw, &lenrw, iw, &rw[0],\n        rhs.data_block(), &v[0], &w[0], result.data_block(), &se[0],\n        &atol, &btol, &conlim, &max_iter_, &nout, &return_code_,\n        &num_iter_, &anorm, &acond, &rnorm, &arnorm, &xnorm,\n        this);\n#endif\n\n  resid_norm_estimate_ = solver.GetFinalEstimateOfNormRbar();\n  result_norm_estimate_ = solver.GetFinalEstimateOfNormOfX();\n  A_condition_estimate_ = solver.GetConditionNumberEstimateOfAbar();\n  return_code_ = solver.GetStoppingReason();\n  num_iter_ = solver.GetNumberOfIterationsPerformed();\n  anorm = solver.GetFrobeniusNormEstimateOfAbar();\n  arnorm = solver.GetFinalEstimateOfNormOfResiduals();\n\n#if 0\n  vcl_cerr << \"A Fro norm estimate      = \" << anorm << vcl_endl\n           << \"A condition estimate     = \" << acond << vcl_endl\n           << \"Residual norm estimate   = \" << rnorm << vcl_endl\n           << \"A'(Ax - b) norm estimate = \" << arnorm << vcl_endl\n           << \"x norm estimate          = \" << xnorm << vcl_endl;\n#endif\n\n  \/\/ We should return the return code, as translate_return_code is public and\n  \/\/ it is very misleading that the return code from this function can't be fed\n  \/\/ into translate_return_code. (Brian Amberg)\n  return return_code_;\n}\n\nvoid vnl_lsqr::diagnose_outcome(vcl_ostream& os) const\n{\n  translate_return_code(os, return_code_);\n  os << __FILE__ \" : residual norm estimate = \" << resid_norm_estimate_ << vcl_endl\n     << __FILE__ \" : result norm estimate   = \" << result_norm_estimate_ << vcl_endl\n     << __FILE__ \" : condition no. estimate = \" << A_condition_estimate_ << vcl_endl\n     << __FILE__ \" : iterations             = \" << num_iter_ << vcl_endl;\n}\n\nvoid vnl_lsqr::translate_return_code(vcl_ostream& os, int rc)\n{\n  const char* vnl_lsqr_reasons[] = {\n   \"x = 0  is the exact solution. No iterations were performed.\",\n   \"The equations A*x = b are probably compatible.  \"\n       \"Norm(A*x - b) is sufficiently small, given the \"\n       \"values of ATOL and BTOL.\",\n   \"The system A*x = b is probably not compatible.  \"\n       \"A least-squares solution has been obtained that is \"\n       \"sufficiently accurate, given the value of ATOL.\",\n   \"An estimate of cond(Abar) has exceeded CONLIM.  \"\n       \"The system A*x = b appears to be ill-conditioned.  \"\n       \"Otherwise, there could be an error in subroutine APROD.\",\n   \"The equations A*x = b are probably compatible.  \"\n       \"Norm(A*x - b) is as small as seems reasonable on this machine.\",\n   \"The system A*x = b is probably not compatible.  A least-squares \"\n       \"solution has been obtained that is as accurate as seems \"\n       \"reasonable on this machine.\",\n   \"Cond(Abar) seems to be so large that there is no point in doing further \"\n       \"iterations, given the precision of this machine. \"\n       \"There could be an error in subroutine APROD.\",\n   \"The iteration limit ITNLIM was reached.\"\n  };\n\n  if\n    (rc < 0 || rc > 7) os << __FILE__ \" : Illegal return code : \" << rc << vcl_endl;\n  else\n    os << __FILE__ \" : \" << vnl_lsqr_reasons[rc] << vcl_endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Dogee.cpp : ̨Ӧóڵ㡣\n\/\/\n#ifdef _WIN32\n#include \"stdafx.h\"\n#endif\n\n#include <stdio.h>\n#include <iostream>\n\n#include \"DogeeMacro.h\"\n#include <stdint.h>\n#include <assert.h>\n#include \"Dogee.h\"\nnamespace Dogee\n{\n\t\/\/test code\n\n\tuint64_t data[4096 * 32];\n\n\ttemplate <class Dest, class Source>\n\tinline Dest bit_cast(const Source& source) {\n\t\tstatic_assert(sizeof(Dest) <= sizeof(Source), \"Error: sizeof(Dest) > sizeof(Source)\");\n\t\tDest dest;\n\t\tmemcpy(&dest, &source, sizeof(dest));\n\t\treturn dest;\n\t}\n\n\n\n\ttypedef uint32_t ObjectKey;\n\ttypedef uint32_t FieldKey;\n\ttypedef uint64_t LongKey;\n\tclass DObject\n\t{\n\tprotected:\n\t\tstatic const int _LAST_ = 0;\n\tprivate:\n\t\tObjectKey object_id;\n\tpublic:\n\t\t\/\/test code\n\t\tObjectKey GetObjectId()\n\t\t{\n\t\t\treturn object_id;\n\t\t}\n\n\t\tDObject(ObjectKey obj_id)\n\t\t{\n\t\t\tobject_id = obj_id;\n\t\t\t\/\/last_field_id = ((LongKey)obj_id)<<32;\n\t\t\t\/\/last_field_id = (LongKey)(data + obj_id * 10);\n\t\t}\n\n\t\t\/*\t\tDObject(DObject& x)\n\t\t\t\t{\n\t\t\t\tobject_id=x.object_id;\n\t\t\t\t}*\/\n\n\t};\n\tthread_local DObject* lastobject = nullptr;\n\n\n\ttemplate<class T> class Reference;\n\ttemplate<typename T> class Array;\n\n\ttemplate <typename T>\n\tclass DSMInterface\n\t{\n\tpublic:\n\t\tstatic T get_value(ObjectKey obj_id, FieldKey field_id)\n\t\t{\n\t\t\tT ret = *(T*)(data + obj_id * 10 + field_id);\n\t\t\treturn ret;\n\t\t}\n\n\n\t\tstatic void set_value(ObjectKey obj_id, FieldKey field_id, T val)\n\t\t{\n\t\t\t*(T*)(data + obj_id * 10 + field_id) = val;\n\t\t}\n\n\t};\n\n\ttemplate <typename T>\n\tclass DSMInterface < Reference<T> >\n\t{\n\tpublic:\n\t\tstatic Reference<T> get_value(ObjectKey obj_id, FieldKey field_id)\n\t\t{\n\t\t\tObjectKey key = *(ObjectKey*)(data + obj_id * 10 + field_id);\n\t\t\tReference<T> ret(key);\n\t\t\treturn ret;\n\t\t}\n\n\t\tstatic void set_value(ObjectKey obj_id, FieldKey field_id, Reference<T> val)\n\t\t{\n\t\t\t*(ObjectKey*)(data + obj_id * 10 + field_id) = val->GetObjectId();\n\t\t}\n\n\t};\n\n\ttemplate <typename T>\n\tclass DSMInterface < Array<T> >\n\t{\n\tpublic:\n\t\tstatic Array<T> get_value(ObjectKey obj_id, FieldKey field_id)\n\t\t{\n\t\t\tObjectKey key = *(ObjectKey*)(data + obj_id * 10 + field_id);\n\t\t\tArray<T> ret(key);\n\t\t\treturn ret;\n\t\t}\n\n\t\tstatic void set_value(ObjectKey obj_id, FieldKey field_id, Array<T> val)\n\t\t{\n\t\t\t*(ObjectKey*)(data + obj_id * 10 + field_id) = val.GetObjectId();\n\t\t}\n\n\t};\n\n\n\ttemplate<typename T> class ArrayElement\n\t{\n\t\tObjectKey ok;\n\t\tFieldKey fk;\n\tpublic:\n\n\t\t\/\/copy \n\t\tArrayElement<T>& operator=(ArrayElement<T>& x)\n\t\t{\n\t\t\tset(x.get());\n\t\t\treturn *this;\n\t\t}\n\n\t\tT get()\n\t\t{\n\t\t\treturn DSMInterface<T>::get_value(ok, fk);\n\t\t}\n\n\t\tvoid set(T& x)\n\t\t{\n\t\t\tDSMInterface<T>::set_value(ok, fk, x);\n\t\t}\n\t\t\/\/read\n\t\toperator T()\n\t\t{\n\t\t\treturn get();\n\t\t}\n\n\t\tT operator->()\n\t\t{\n\t\t\treturn get();\n\t\t}\n\n\t\t\/\/write\n\t\tT operator=(T x)\n\t\t{\n\t\t\tset(x);\n\t\t\treturn x;\n\t\t}\n\n\n\t\tArrayElement(ObjectKey o_key, FieldKey f_key) : ok(o_key), fk(f_key)\n\t\t{\n\t\t}\n\n\t};\n\n\n\ttemplate<typename T, FieldKey FieldId> class Value\n\t{\n\n\tprivate:\n\t\t\/\/copy functions are forbidden, you should copy the value like \"a->val = b->val +0\"\n\t\ttemplate<typename T2, FieldKey FieldId2>Value<T, FieldId>& operator=(Value<T2, FieldId2>& x);\n\t\tValue<T, FieldId>& operator=(Value<T, FieldId>& x);\n\tpublic:\n\t\tint GetFieldId()\n\t\t{\n\t\t\treturn FieldId;\n\t\t}\n\n\t\t\/\/read\n\t\toperator T() const\n\t\t{\n\t\t\tassert(lastobject != nullptr);\/\/ \"You should use a Reference<T> to access the member\"\n\t\t\tT ret = DSMInterface<T>::get_value(lastobject->GetObjectId(), FieldId);\n#ifdef DOGEE_DBG\n\t\t\tlastobject = nullptr;\n#endif\n\t\t\treturn ret;\n\t\t}\n\n\t\tT operator->()\n\t\t{\n\t\t\tassert(lastobject != nullptr);\/\/ \"You should use a Reference<T> to access the member\"\n\t\t\tT ret = DSMInterface<T>::get_value(lastobject->GetObjectId(), FieldId);\n#ifdef DOGEE_DBG\n\t\t\tlastobject = nullptr;\n#endif\n\t\t\treturn ret;\n\t\t}\n\n\/*\t\t<T> operator[](int k)\n\t\t{\n\t\t\treturn *(T*)nullptr;\n\t\t}*\/\n\n\t\t\/\/write\n\t\tValue<T, FieldId>& operator=(T x)\n\t\t{\n\t\t\tassert(lastobject != nullptr);\/\/ \"You should use a Reference<T> to access the member\"\n\t\t\tDSMInterface<T>::set_value(lastobject->GetObjectId(), FieldId, x);\n#ifdef DOGEE_DBG\n\t\t\tlastobject = nullptr;\n#endif\n\t\t\treturn *this;\n\t\t}\n\t\t\/\/operator const   T() { return this->b_; }\n\t\t\/\/operator T&() { return this->b_; }\n\t\t\/*\t\tValue(T x)\n\t\t\t\t{\n\t\t\t\tthis->operator=(x);\n\t\t\t\t}*\/\n\n\t\tValue()\n\t\t{\n\t\t}\n\n\t};\n\n\/*\ttemplate<typename T, FieldKey FieldId> \n\tArrayElement<T> Value<Array<T>, FieldId>::operator[](int k)\n\t{\n\t\t\tassert(lastobject != nullptr);\/\/ \"You should use a Reference<T> to access the member\"\n\t\t\tT ret = DSMInterface<T>::get_value(lastobject->GetObjectId(), FieldId);\n#ifdef DOGEE_DBG\n\t\t\tlastobject = nullptr;\n#endif\n\t\t\treturn ret.ArrayAccess(k);\n\t}*\/\n\n\n\n\ttemplate<typename T> class Array\n\t{\n\tprivate:\n\t\tObjectKey object_id;\n\tpublic:\n\t\t\/\/test code\n\t\tObjectKey GetObjectId()\n\t\t{\n\t\t\treturn object_id;\n\t\t}\n\t\tArray(ObjectKey obj_id)\n\t\t{\n\t\t\tobject_id = obj_id;\n\t\t}\n\n\t\tArrayElement<T> ArrayAccess(int k)\n\t\t{\n\t\t\tFieldKey key = k;\n\t\t\treturn ArrayElement<T>(object_id, key);\n\t\t}\n\n\t\tArrayElement<T> operator[](int k)\n\t\t{\n\t\t\treturn ArrayAccess(k);\n\t\t}\n\t};\n\n\n\ttemplate<class T> class Reference\n\t{\n\tprivate:\n\t\tT obj;\n\tpublic:\n\t\tT* operator->()\n\t\t{\n\t\t\tlastobject = (DObject*)&obj;\n\t\t\treturn &obj;\n\t\t}\n\n\t\tReference(ObjectKey key) :obj(key){}\n\n\t\tReference(T& k) :obj(k){}\n\t};\n\n\t\/\/test code\n\tObjectKey objid;\n\ttemplate<class T> class Alloc\n\t{\n\tprivate:\n\t\t\/\/test code\n\n\t\tstatic ObjectKey AllocObjectId()\n\t\t{\n\t\t\treturn objid++;\n\t\t}\n\tpublic:\n\t\tstatic Array<T>  newarray()\n\t\t{\n\t\t\treturn Array<T>(AllocObjectId());\n\t\t}\n\n\t\tstatic Reference<T>  tnew()\n\t\t{\n\t\t\tT ret(AllocObjectId());\n\t\t\treturn Reference<T>(ret);\n\t\t}\n\n\t\ttemplate<typename P1>\n\t\tstatic Reference<T>  tnew(P1 p1)\n\t\t{\n\t\t\tT ret(AllocObjectId(), p1);\n\t\t\treturn Reference<T>(ret);\n\t\t}\n\n\t\ttemplate<typename P1, typename P2>\n\t\tstatic Reference<T>  tnew(P1 p1, P2 p2)\n\t\t{\n\t\t\tT ret(AllocObjectId(), p1, p2);\n\t\t\treturn Reference<T>(ret);\n\t\t}\n\t\t\/*\n\t\ttemplate<typename P1, typename P2, typename P3>\n\t\tT*  tnew(P1 p1, P2 p2, P3 p3)\n\t\t{\n\t\treturn new (alloc()) T(p1, p2, p3);\n\t\t}\n\n\t\ttemplate<typename P1, typename P2, typename P3, typename P4>\n\t\tT*  tnew(P1 p1, P2 p2, P3 p3, P4 p4)\n\t\t{\n\t\treturn new (alloc()) T(p1, p2, p3, p4);\n\t\t}\n\n\t\ttemplate<typename P1, typename P2, typename P3, typename P4, typename P5>\n\t\tT*  tnew(P1 p1, P2 p2, P3 p3, P4 p4, P5 p5)\n\t\t{\n\t\treturn new (alloc()) T(p1, p2, p3, p4, p5);\n\t\t}*\/\n\t};\n\n\ttemplate <class T> inline T* ReferenceObject(T* obj)\n\t{\n\t\tlastobject = (DObject*)obj;\n\t\treturn obj;\n\t}\n}\nusing namespace Dogee;\n\nclass clsa : public DObject\n{\n\tDefBegin(DObject);\npublic:\n\tDef(int, i);\n\tDef(Array<float>, arr);\n\tDef(Reference<clsa>, next);\n\tDefEnd();\n\tclsa(ObjectKey obj_id) : DObject(obj_id)\n\t{}\n\t\n\n};\n\n\n\n\ntemplate<typename T> void aaa(T* dummy)\n{\n\tstd::cout << \"Normal\" << std::endl;\n}\ntemplate<> void aaa(int * dummy)\n{\n\tstd::cout << \"Int\" << std::endl;\n}\nint main(int argc, char* argv[])\n{\n\/*\tDogee::DInt i = 10;\n\tint b = 0;\n\ti = i + 1;\n\tDogee::DInt j = 220;\n\ti = j;\n\tReference<clsa> aaa(123);\n\tstd::cout<<*aaa;\n\tclsa obj(0);\n\tobj.i = 1;\n\tobj.j = 2.3;\n\tobj.k = 4.5;\n\tstd::cout << sizeof(clsa) << std::endl << sizeof(DObject) << std::endl << sizeof(Value<int>) << std::endl;*\/\n\tauto ptr = Dogee::Alloc<clsa>::tnew();\n\tptr->arr = Dogee::Alloc<float>::newarray();\n\tArray<float> arr = ptr->arr;\n\tarr[0] = arr[0] + 1;\n\t\/\/std::cout << ptr->i << std::endl << ptr->j << std::endl << ptr->k << std::endl;\n\t\/\/ptr->next = ptr;\n\t\/\/ptr->next->next->i = 1;\n\t\/\/Reference<clsa> ptr2=ptr->next;\n\tstd::cout << arr[0] << std::endl;\n\n\treturn 0;\n}\n\n<commit_msg>add operator [] for Value<Array><commit_after>\/\/ Dogee.cpp : ̨Ӧóڵ㡣\n\/\/\n#ifdef _WIN32\n#include \"stdafx.h\"\n#endif\n\n#include <stdio.h>\n#include <iostream>\n\n#include \"DogeeMacro.h\"\n#include <stdint.h>\n#include <assert.h>\n#include \"Dogee.h\"\n\nnamespace Dogee\n{\n\t\/\/test code\n\n\tuint64_t data[4096 * 32];\n\n\ttemplate <class Dest, class Source>\n\tinline Dest bit_cast(const Source& source) {\n\t\tstatic_assert(sizeof(Dest) <= sizeof(Source), \"Error: sizeof(Dest) > sizeof(Source)\");\n\t\tDest dest;\n\t\tmemcpy(&dest, &source, sizeof(dest));\n\t\treturn dest;\n\t}\n\n\n\n\ttypedef uint32_t ObjectKey;\n\ttypedef uint32_t FieldKey;\n\ttypedef uint64_t LongKey;\n\tclass DObject\n\t{\n\tprotected:\n\t\tstatic const int _LAST_ = 0;\n\tprivate:\n\t\tObjectKey object_id;\n\tpublic:\n\t\t\/\/test code\n\t\tObjectKey GetObjectId()\n\t\t{\n\t\t\treturn object_id;\n\t\t}\n\n\t\tDObject(ObjectKey obj_id)\n\t\t{\n\t\t\tobject_id = obj_id;\n\t\t\t\/\/last_field_id = ((LongKey)obj_id)<<32;\n\t\t\t\/\/last_field_id = (LongKey)(data + obj_id * 10);\n\t\t}\n\n\t\t\/*\t\tDObject(DObject& x)\n\t\t\t\t{\n\t\t\t\tobject_id=x.object_id;\n\t\t\t\t}*\/\n\n\t};\n\tthread_local DObject* lastobject = nullptr;\n\n\n\ttemplate<class T> class Reference;\n\ttemplate<typename T> class Array;\n\n\ttemplate <typename T>\n\tclass DSMInterface\n\t{\n\tpublic:\n\t\tstatic T get_value(ObjectKey obj_id, FieldKey field_id)\n\t\t{\n\t\t\tT ret = *(T*)(data + obj_id * 10 + field_id);\n\t\t\treturn ret;\n\t\t}\n\n\n\t\tstatic void set_value(ObjectKey obj_id, FieldKey field_id, T val)\n\t\t{\n\t\t\t*(T*)(data + obj_id * 10 + field_id) = val;\n\t\t}\n\n\t};\n\n\ttemplate <typename T>\n\tclass DSMInterface < Reference<T> >\n\t{\n\tpublic:\n\t\tstatic Reference<T> get_value(ObjectKey obj_id, FieldKey field_id)\n\t\t{\n\t\t\tObjectKey key = *(ObjectKey*)(data + obj_id * 10 + field_id);\n\t\t\tReference<T> ret(key);\n\t\t\treturn ret;\n\t\t}\n\n\t\tstatic void set_value(ObjectKey obj_id, FieldKey field_id, Reference<T> val)\n\t\t{\n\t\t\t*(ObjectKey*)(data + obj_id * 10 + field_id) = val->GetObjectId();\n\t\t}\n\n\t};\n\n\ttemplate <typename T>\n\tclass DSMInterface < Array<T> >\n\t{\n\tpublic:\n\t\tstatic Array<T> get_value(ObjectKey obj_id, FieldKey field_id)\n\t\t{\n\t\t\tObjectKey key = *(ObjectKey*)(data + obj_id * 10 + field_id);\n\t\t\tArray<T> ret(key);\n\t\t\treturn ret;\n\t\t}\n\n\t\tstatic void set_value(ObjectKey obj_id, FieldKey field_id, Array<T> val)\n\t\t{\n\t\t\t*(ObjectKey*)(data + obj_id * 10 + field_id) = val.GetObjectId();\n\t\t}\n\n\t};\n\n\n\ttemplate<typename T> class ArrayElement\n\t{\n\t\tObjectKey ok;\n\t\tFieldKey fk;\n\tpublic:\n\n\t\t\/\/copy \n\t\tArrayElement<T>& operator=(ArrayElement<T>& x)\n\t\t{\n\t\t\tset(x.get());\n\t\t\treturn *this;\n\t\t}\n\n\t\tT get()\n\t\t{\n\t\t\treturn DSMInterface<T>::get_value(ok, fk);\n\t\t}\n\n\t\tvoid set(T& x)\n\t\t{\n\t\t\tDSMInterface<T>::set_value(ok, fk, x);\n\t\t}\n\t\t\/\/read\n\t\toperator T()\n\t\t{\n\t\t\treturn get();\n\t\t}\n\n\t\tT operator->()\n\t\t{\n\t\t\treturn get();\n\t\t}\n\n\t\t\/\/write\n\t\tT operator=(T x)\n\t\t{\n\t\t\tset(x);\n\t\t\treturn x;\n\t\t}\n\n\n\t\tArrayElement(ObjectKey o_key, FieldKey f_key) : ok(o_key), fk(f_key)\n\t\t{\n\t\t}\n\n\t};\n\n\n\t\/\/template<typename T> T dummy(T);\n\t\/\/template<typename T> ArrayElement<T> dummy(Array<T>);\n\ttemplate<typename T, FieldKey FieldId> class Value\n\t{\n\tprivate:\n\n\t\t\/\/copy functions are forbidden, you should copy the value like \"a->val = b->val +0\"\n\t\ttemplate<typename T2, FieldKey FieldId2>Value<T, FieldId>& operator=(Value<T2, FieldId2>& x);\n\t\tValue<T, FieldId>& operator=(Value<T, FieldId>& x);\n\tpublic:\n\t\tint GetFieldId()\n\t\t{\n\t\t\treturn FieldId;\n\t\t}\n\n\n\t\tT get()\n\t\t{\n\t\t\tassert(lastobject != nullptr);\/\/ \"You should use a Reference<T> to access the member\"\n\t\t\tT ret = DSMInterface<T>::get_value(lastobject->GetObjectId(), FieldId);\n#ifdef DOGEE_DBG\n\t\t\tlastobject = nullptr;\n#endif\n\t\t\treturn ret;\n\t\t}\n\t\t\/\/read\n\t\toperator T()\n\t\t{\n\t\t\treturn get();\n\t\t}\n\n\t\tT operator->()\n\t\t{\n\t\t\treturn get();\n\t\t}\n\n\n\t\t\/\/write\n\t\tValue<T, FieldId>& operator=(T x)\n\t\t{\n\t\t\tassert(lastobject != nullptr);\/\/ \"You should use a Reference<T> to access the member\"\n\t\t\tDSMInterface<T>::set_value(lastobject->GetObjectId(), FieldId, x);\n#ifdef DOGEE_DBG\n\t\t\tlastobject = nullptr;\n#endif\n\t\t\treturn *this;\n\t\t}\n\t\tValue()\n\t\t{\n\t\t}\n\n\t};\n\n\t\/\/a dirty bypass for Value<Array<T>, FieldId>, just to add \"operator[]\" \n\ttemplate<typename T, FieldKey FieldId> class Value<Array<T>, FieldId>\n\t{\n\tprivate:\n\n\t\t\/\/copy functions are forbidden, you should copy the value like \"a->val = b->val +0\"\n\t\ttemplate<typename T2, FieldKey FieldId2>Value<Array<T>, FieldId>& operator=(Value<T2, FieldId2>& x);\n\t\tValue<Array<T>, FieldId>& operator=(Value<Array<T>, FieldId>& x);\n\tpublic:\n\t\tint GetFieldId()\n\t\t{\n\t\t\treturn FieldId;\n\t\t}\n\n\n\t\tArray<T> get()\n\t\t{\n\t\t\tassert(lastobject != nullptr);\/\/ \"You should use a Reference<T> to access the member\"\n\t\t\tArray<T> ret = DSMInterface<Array<T>>::get_value(lastobject->GetObjectId(), FieldId);\n#ifdef DOGEE_DBG\n\t\t\tlastobject = nullptr;\n#endif\n\t\t\treturn ret;\n\t\t}\n\t\t\/\/read\n\t\toperator Array<T>()\n\t\t{\n\t\t\treturn get();\n\t\t}\n\t\tArrayElement<T> operator[](int k)\n\t\t{\n\t\t\tArray<T> ret = get();\n\t\t\treturn ret.ArrayAccess(k);\n\t\t}\n\t\t\/\/write\n\t\tValue<Array<T>, FieldId>& operator=(Array<T> x)\n\t\t{\n\t\t\tassert(lastobject != nullptr);\/\/ \"You should use a Reference<T> to access the member\"\n\t\t\tDSMInterface<Array<T>>::set_value(lastobject->GetObjectId(), FieldId, x);\n#ifdef DOGEE_DBG\n\t\t\tlastobject = nullptr;\n#endif\n\t\t\treturn *this;\n\t\t}\n\t\tValue()\n\t\t{\n\t\t}\n\n\t};\n\n\n\n\ttemplate<typename T> class Array\n\t{\n\tprivate:\n\t\tObjectKey object_id;\n\tpublic:\n\t\t\/\/test code\n\t\tObjectKey GetObjectId()\n\t\t{\n\t\t\treturn object_id;\n\t\t}\n\t\tArray(ObjectKey obj_id)\n\t\t{\n\t\t\tobject_id = obj_id;\n\t\t}\n\n\t\tArrayElement<T> ArrayAccess(int k)\n\t\t{\n\t\t\tFieldKey key = k;\n\t\t\treturn ArrayElement<T>(object_id, key);\n\t\t}\n\n\t\tArrayElement<T> operator[](int k)\n\t\t{\n\t\t\treturn ArrayAccess(k);\n\t\t}\n\t};\n\n\n\ttemplate<class T> class Reference\n\t{\n\tprivate:\n\t\tT obj;\n\tpublic:\n\t\tT* operator->()\n\t\t{\n\t\t\tlastobject = (DObject*)&obj;\n\t\t\treturn &obj;\n\t\t}\n\n\t\tReference(ObjectKey key) :obj(key){}\n\n\t\tReference(T& k) :obj(k){}\n\t};\n\n\t\/\/test code\n\tObjectKey objid;\n\ttemplate<class T> class Alloc\n\t{\n\tprivate:\n\t\t\/\/test code\n\n\t\tstatic ObjectKey AllocObjectId()\n\t\t{\n\t\t\treturn objid++;\n\t\t}\n\tpublic:\n\t\tstatic Array<T>  newarray()\n\t\t{\n\t\t\treturn Array<T>(AllocObjectId());\n\t\t}\n\n\t\tstatic Reference<T>  tnew()\n\t\t{\n\t\t\tT ret(AllocObjectId());\n\t\t\treturn Reference<T>(ret);\n\t\t}\n\n\t\ttemplate<typename P1>\n\t\tstatic Reference<T>  tnew(P1 p1)\n\t\t{\n\t\t\tT ret(AllocObjectId(), p1);\n\t\t\treturn Reference<T>(ret);\n\t\t}\n\n\t\ttemplate<typename P1, typename P2>\n\t\tstatic Reference<T>  tnew(P1 p1, P2 p2)\n\t\t{\n\t\t\tT ret(AllocObjectId(), p1, p2);\n\t\t\treturn Reference<T>(ret);\n\t\t}\n\t\t\/*\n\t\ttemplate<typename P1, typename P2, typename P3>\n\t\tT*  tnew(P1 p1, P2 p2, P3 p3)\n\t\t{\n\t\treturn new (alloc()) T(p1, p2, p3);\n\t\t}\n\n\t\ttemplate<typename P1, typename P2, typename P3, typename P4>\n\t\tT*  tnew(P1 p1, P2 p2, P3 p3, P4 p4)\n\t\t{\n\t\treturn new (alloc()) T(p1, p2, p3, p4);\n\t\t}\n\n\t\ttemplate<typename P1, typename P2, typename P3, typename P4, typename P5>\n\t\tT*  tnew(P1 p1, P2 p2, P3 p3, P4 p4, P5 p5)\n\t\t{\n\t\treturn new (alloc()) T(p1, p2, p3, p4, p5);\n\t\t}*\/\n\t};\n\n\ttemplate <class T> inline T* ReferenceObject(T* obj)\n\t{\n\t\tlastobject = (DObject*)obj;\n\t\treturn obj;\n\t}\n}\nusing namespace Dogee;\n\nclass clsa : public DObject\n{\n\tDefBegin(DObject);\npublic:\n\tDef(int, i);\n\tDef(Array<float>, arr);\n\tDef(Array<Reference<clsa>>, next);\n\tDefEnd();\n\tclsa(ObjectKey obj_id) : DObject(obj_id)\n\t{}\n\t\n\n};\n\n\n\n\ntemplate<typename T> void aaa(T* dummy)\n{\n\tstd::cout << \"Normal\" << std::endl;\n}\ntemplate<> void aaa(int * dummy)\n{\n\tstd::cout << \"Int\" << std::endl;\n}\nint main(int argc, char* argv[])\n{\n\/*\tDogee::DInt i = 10;\n\tint b = 0;\n\ti = i + 1;\n\tDogee::DInt j = 220;\n\ti = j;\n\tReference<clsa> aaa(123);\n\tstd::cout<<*aaa;\n\tclsa obj(0);\n\tobj.i = 1;\n\tobj.j = 2.3;\n\tobj.k = 4.5;\n\tstd::cout << sizeof(clsa) << std::endl << sizeof(DObject) << std::endl << sizeof(Value<int>) << std::endl;*\/\n\tauto ptr = Dogee::Alloc<clsa>::tnew();\n\tptr->arr = Dogee::Alloc<float>::newarray();\n\tptr->next = Dogee::Alloc<Reference<clsa>>::newarray();\n\tptr->next[0] = ptr;\n\tptr->next[0]->i = 123;\n\tptr->arr[0] = 133;\n\tptr->arr[0]=ptr->arr[0] + 1;\n\tstd::cout << ptr->arr[0] << std::endl << ptr->i;\n\t\/\/std::cout << ptr->i << std::endl << ptr->j << std::endl << ptr->k << std::endl;\n\t\/\/ptr->next = ptr;\n\t\/\/ptr->next->next->i = 1;\n\t\/\/Reference<clsa> ptr2=ptr->next;\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2016 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\/**\n * @file spektrum_rc.cpp\n *\n * This is a driver for a Spektrum satellite receiver connected to a Snapdragon\n * on the serial port. By default port J15 (next to USB) is used.\n *\/\n\n#include <px4_tasks.h>\n#include <px4_posix.h>\n\n#include <lib\/rc\/dsm.h>\n#include <drivers\/drv_rc_input.h>\n#include <drivers\/drv_hrt.h>\n\n#include <uORB\/uORB.h>\n#include <uORB\/topics\/input_rc.h>\n\n\/\/ Snapdraogon: use J15 (next to USB)\n#define SPEKTRUM_UART_DEVICE_PATH \"\/dev\/tty-1\"\n\n#define UNUSED(x) (void)(x)\n\nextern \"C\" { __EXPORT int spektrum_rc_main(int argc, char *argv[]); }\n\n\nnamespace spektrum_rc\n{\n\nvolatile bool _task_should_exit = false;\nstatic bool _is_running = false;\nstatic px4_task_t _task_handle = -1;\n\nint start();\nint stop();\nint info();\nvoid usage();\nvoid task_main(int argc, char *argv[]);\n\nvoid fill_input_rc(uint16_t raw_rc_count, uint16_t raw_rc_values[input_rc_s::RC_INPUT_MAX_CHANNELS],\n\t\t   hrt_abstime now, bool frame_drop, bool failsafe, unsigned frame_drops, int rssi,\n\t\t   input_rc_s &input_rc);\n\nvoid task_main(int argc, char *argv[])\n{\n\tint uart_fd = dsm_init(SPEKTRUM_UART_DEVICE_PATH);\n\n\tif (uart_fd < 1) {\n\t\tPX4_ERR(\"dsm init failed\");\n\t\treturn;\n\t}\n\n\torb_advert_t rc_pub = nullptr;\n\n\t\/\/ Use a buffer size of the double of the minimum, just to be safe.\n\tuint8_t rx_buf[2 * DSM_BUFFER_SIZE];\n\n\t\/\/ Set up poll topic\n\tpx4_pollfd_struct_t fds[1];\n\tfds[0].fd     = uart_fd;\n\tfds[0].events = POLLIN;\n\n\t_is_running = true;\n\n\t\/\/ Main loop\n\twhile (!_task_should_exit) {\n\n\t\tint pret = px4_poll(&fds[0], (sizeof(fds) \/ sizeof(fds[0])), 10);\n\n\t\t\/* Timed out, do a periodic check for _task_should_exit. *\/\n\t\tif (pret == 0) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (pret < 0) {\n\t\t\tPX4_WARN(\"poll error %d, %d\", pret, errno);\n\t\t\t\/* sleep a bit before next try *\/\n\t\t\tusleep(100000);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!(fds[0].revents & POLLIN)) {\n\t\t\t\/\/ There is only one fd in poll, so this should be impossible.\n\t\t\tPX4_WARN(\"poll bit not set\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tint newbytes = ::read(uart_fd, &rx_buf[0], sizeof(rx_buf));\n\n\t\tif (newbytes < 0) {\n\t\t\tPX4_WARN(\"read failed\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (newbytes == 0) {\n\t\t\tPX4_WARN(\"read nothing\");\n\t\t\tcontinue;\n\t\t}\n\n\n\t\tconst hrt_abstime now = hrt_absolute_time();\n\n\t\tbool dsm_11_bit;\n\t\tunsigned frame_drops;\n\t\tuint16_t raw_rc_values[input_rc_s::RC_INPUT_MAX_CHANNELS];\n\t\tuint16_t raw_rc_count;\n\n\t\t\/\/ parse new data\n\t\tbool rc_updated = dsm_parse(now, rx_buf, newbytes, &raw_rc_values[0], &raw_rc_count,\n\t\t\t\t\t    &dsm_11_bit, &frame_drops, input_rc_s::RC_INPUT_MAX_CHANNELS);\n\t\tUNUSED(dsm_11_bit);\n\n\t\tif (rc_updated) {\n\n\t\t\tinput_rc_s input_rc = {};\n\n\t\t\t\/\/ We don't know RSSI.\n\t\t\tconst int rssi = -1;\n\n\t\t\tfill_input_rc(raw_rc_count, raw_rc_values, now, false, false, frame_drops, rssi,\n\t\t\t\t      input_rc);\n\n\t\t\tif (rc_pub == nullptr) {\n\t\t\t\trc_pub = orb_advertise(ORB_ID(input_rc), &input_rc);\n\n\t\t\t} else {\n\t\t\t\torb_publish(ORB_ID(input_rc), rc_pub, &input_rc);\n\t\t\t}\n\t\t}\n\t}\n\n\torb_unadvertise(rc_pub);\n\tdsm_deinit();\n\n\t_is_running = false;\n}\n\nvoid fill_input_rc(uint16_t raw_rc_count, uint16_t raw_rc_values[input_rc_s::RC_INPUT_MAX_CHANNELS],\n\t\t   hrt_abstime now, bool frame_drop, bool failsafe, unsigned frame_drops, int rssi,\n\t\t   input_rc_s &input_rc)\n{\n\tinput_rc.input_source = input_rc_s::RC_INPUT_SOURCE_QURT;\n\n\tinput_rc.channel_count = raw_rc_count;\n\n\tif (input_rc.channel_count > input_rc_s::RC_INPUT_MAX_CHANNELS) {\n\t\tinput_rc.channel_count = input_rc_s::RC_INPUT_MAX_CHANNELS;\n\t}\n\n\tunsigned valid_chans = 0;\n\n\tfor (unsigned i = 0; i < input_rc.channel_count; ++i) {\n\t\tinput_rc.values[i] = raw_rc_values[i];\n\n\t\tif (raw_rc_values[i] != UINT16_MAX) {\n\t\t\tvalid_chans++;\n\t\t}\n\t}\n\n\tinput_rc.timestamp = now;\n\tinput_rc.timestamp_last_signal = input_rc.timestamp;\n\tinput_rc.rc_ppm_frame_length = 0;\n\n\t\/* fake rssi if no value was provided *\/\n\tif (rssi == -1) {\n\n\t\tinput_rc.rssi = 255;\n\n\t} else {\n\t\tinput_rc.rssi = rssi;\n\t}\n\n\tif (valid_chans == 0) {\n\t\tinput_rc.rssi = 0;\n\t}\n\n\tinput_rc.rc_failsafe = failsafe;\n\tinput_rc.rc_lost = (valid_chans == 0);\n\tinput_rc.rc_lost_frame_count = frame_drops;\n\tinput_rc.rc_total_frame_count = 0;\n}\n\nint start()\n{\n\tif (_is_running) {\n\t\tPX4_WARN(\"already running\");\n\t\treturn -1;\n\t}\n\n\tASSERT(_task_handle == -1);\n\n\t_task_should_exit = false;\n\n\t_task_handle = px4_task_spawn_cmd(\"spektrum_rc_main\",\n\t\t\t\t\t  SCHED_DEFAULT,\n\t\t\t\t\t  SCHED_PRIORITY_DEFAULT,\n\t\t\t\t\t  2000,\n\t\t\t\t\t  (px4_main_t)&task_main,\n\t\t\t\t\t  nullptr);\n\n\tif (_task_handle < 0) {\n\t\tPX4_ERR(\"task start failed\");\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n\nint stop()\n{\n\tif (!_is_running) {\n\t\tPX4_WARN(\"not running\");\n\t\treturn -1;\n\t}\n\n\t_task_should_exit = true;\n\n\twhile (_is_running) {\n\t\tusleep(200000);\n\t\tPX4_INFO(\".\");\n\t}\n\n\t_task_handle = -1;\n\treturn 0;\n}\n\nint info()\n{\n\tPX4_INFO(\"running: %s\", _is_running ? \"yes\" : \"no\");\n\n\treturn 0;\n}\n\nvoid\nusage()\n{\n\tPX4_INFO(\"Usage: spektrum_rc {start|info|stop}\");\n}\n\n} \/\/ namespace spektrum_rc\n\n\nint spektrum_rc_main(int argc, char *argv[])\n{\n\tint myoptind = 1;\n\n\tif (argc <= 1) {\n\t\tspektrum_rc::usage();\n\t\treturn 1;\n\t}\n\n\tconst char *verb = argv[myoptind];\n\n\n\tif (!strcmp(verb, \"start\")) {\n\t\treturn spektrum_rc::start();\n\t}\n\n\telse if (!strcmp(verb, \"stop\")) {\n\t\treturn spektrum_rc::stop();\n\t}\n\n\telse if (!strcmp(verb, \"info\")) {\n\t\treturn spektrum_rc::info();\n\t}\n\n\telse {\n\t\tspektrum_rc::usage();\n\t\treturn 1;\n\t}\n}\n<commit_msg>spektrum_rc: raise poll timeout to 50ms\/20Hz<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2016 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\/**\n * @file spektrum_rc.cpp\n *\n * This is a driver for a Spektrum satellite receiver connected to a Snapdragon\n * on the serial port. By default port J15 (next to USB) is used.\n *\/\n\n#include <px4_tasks.h>\n#include <px4_posix.h>\n\n#include <lib\/rc\/dsm.h>\n#include <drivers\/drv_rc_input.h>\n#include <drivers\/drv_hrt.h>\n\n#include <uORB\/uORB.h>\n#include <uORB\/topics\/input_rc.h>\n\n\/\/ Snapdraogon: use J15 (next to USB)\n#define SPEKTRUM_UART_DEVICE_PATH \"\/dev\/tty-1\"\n\n#define UNUSED(x) (void)(x)\n\nextern \"C\" { __EXPORT int spektrum_rc_main(int argc, char *argv[]); }\n\n\nnamespace spektrum_rc\n{\n\nvolatile bool _task_should_exit = false;\nstatic bool _is_running = false;\nstatic px4_task_t _task_handle = -1;\n\nint start();\nint stop();\nint info();\nvoid usage();\nvoid task_main(int argc, char *argv[]);\n\nvoid fill_input_rc(uint16_t raw_rc_count, uint16_t raw_rc_values[input_rc_s::RC_INPUT_MAX_CHANNELS],\n\t\t   hrt_abstime now, bool frame_drop, bool failsafe, unsigned frame_drops, int rssi,\n\t\t   input_rc_s &input_rc);\n\nvoid task_main(int argc, char *argv[])\n{\n\tint uart_fd = dsm_init(SPEKTRUM_UART_DEVICE_PATH);\n\n\tif (uart_fd < 1) {\n\t\tPX4_ERR(\"dsm init failed\");\n\t\treturn;\n\t}\n\n\torb_advert_t rc_pub = nullptr;\n\n\t\/\/ Use a buffer size of the double of the minimum, just to be safe.\n\tuint8_t rx_buf[2 * DSM_BUFFER_SIZE];\n\n\t\/\/ Set up poll topic\n\tpx4_pollfd_struct_t fds[1];\n\tfds[0].fd     = uart_fd;\n\tfds[0].events = POLLIN;\n\n\t_is_running = true;\n\n\t\/\/ Main loop\n\twhile (!_task_should_exit) {\n\n\t\tint pret = px4_poll(&fds[0], (sizeof(fds) \/ sizeof(fds[0])), 50);\n\n\t\t\/* Timed out, do a periodic check for _task_should_exit. *\/\n\t\tif (pret == 0) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (pret < 0) {\n\t\t\tPX4_WARN(\"poll error %d, %d\", pret, errno);\n\t\t\t\/* sleep a bit before next try *\/\n\t\t\tusleep(100000);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!(fds[0].revents & POLLIN)) {\n\t\t\t\/\/ There is only one fd in poll, so this should be impossible.\n\t\t\tPX4_WARN(\"poll bit not set\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tint newbytes = ::read(uart_fd, &rx_buf[0], sizeof(rx_buf));\n\n\t\tif (newbytes < 0) {\n\t\t\tPX4_WARN(\"read failed\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (newbytes == 0) {\n\t\t\tPX4_WARN(\"read nothing\");\n\t\t\tcontinue;\n\t\t}\n\n\n\t\tconst hrt_abstime now = hrt_absolute_time();\n\n\t\tbool dsm_11_bit;\n\t\tunsigned frame_drops;\n\t\tuint16_t raw_rc_values[input_rc_s::RC_INPUT_MAX_CHANNELS];\n\t\tuint16_t raw_rc_count;\n\n\t\t\/\/ parse new data\n\t\tbool rc_updated = dsm_parse(now, rx_buf, newbytes, &raw_rc_values[0], &raw_rc_count,\n\t\t\t\t\t    &dsm_11_bit, &frame_drops, input_rc_s::RC_INPUT_MAX_CHANNELS);\n\t\tUNUSED(dsm_11_bit);\n\n\t\tif (rc_updated) {\n\n\t\t\tinput_rc_s input_rc = {};\n\n\t\t\t\/\/ We don't know RSSI.\n\t\t\tconst int rssi = -1;\n\n\t\t\tfill_input_rc(raw_rc_count, raw_rc_values, now, false, false, frame_drops, rssi,\n\t\t\t\t      input_rc);\n\n\t\t\tif (rc_pub == nullptr) {\n\t\t\t\trc_pub = orb_advertise(ORB_ID(input_rc), &input_rc);\n\n\t\t\t} else {\n\t\t\t\torb_publish(ORB_ID(input_rc), rc_pub, &input_rc);\n\t\t\t}\n\t\t}\n\t}\n\n\torb_unadvertise(rc_pub);\n\tdsm_deinit();\n\n\t_is_running = false;\n}\n\nvoid fill_input_rc(uint16_t raw_rc_count, uint16_t raw_rc_values[input_rc_s::RC_INPUT_MAX_CHANNELS],\n\t\t   hrt_abstime now, bool frame_drop, bool failsafe, unsigned frame_drops, int rssi,\n\t\t   input_rc_s &input_rc)\n{\n\tinput_rc.input_source = input_rc_s::RC_INPUT_SOURCE_QURT;\n\n\tinput_rc.channel_count = raw_rc_count;\n\n\tif (input_rc.channel_count > input_rc_s::RC_INPUT_MAX_CHANNELS) {\n\t\tinput_rc.channel_count = input_rc_s::RC_INPUT_MAX_CHANNELS;\n\t}\n\n\tunsigned valid_chans = 0;\n\n\tfor (unsigned i = 0; i < input_rc.channel_count; ++i) {\n\t\tinput_rc.values[i] = raw_rc_values[i];\n\n\t\tif (raw_rc_values[i] != UINT16_MAX) {\n\t\t\tvalid_chans++;\n\t\t}\n\t}\n\n\tinput_rc.timestamp = now;\n\tinput_rc.timestamp_last_signal = input_rc.timestamp;\n\tinput_rc.rc_ppm_frame_length = 0;\n\n\t\/* fake rssi if no value was provided *\/\n\tif (rssi == -1) {\n\n\t\tinput_rc.rssi = 255;\n\n\t} else {\n\t\tinput_rc.rssi = rssi;\n\t}\n\n\tif (valid_chans == 0) {\n\t\tinput_rc.rssi = 0;\n\t}\n\n\tinput_rc.rc_failsafe = failsafe;\n\tinput_rc.rc_lost = (valid_chans == 0);\n\tinput_rc.rc_lost_frame_count = frame_drops;\n\tinput_rc.rc_total_frame_count = 0;\n}\n\nint start()\n{\n\tif (_is_running) {\n\t\tPX4_WARN(\"already running\");\n\t\treturn -1;\n\t}\n\n\tASSERT(_task_handle == -1);\n\n\t_task_should_exit = false;\n\n\t_task_handle = px4_task_spawn_cmd(\"spektrum_rc_main\",\n\t\t\t\t\t  SCHED_DEFAULT,\n\t\t\t\t\t  SCHED_PRIORITY_DEFAULT,\n\t\t\t\t\t  2000,\n\t\t\t\t\t  (px4_main_t)&task_main,\n\t\t\t\t\t  nullptr);\n\n\tif (_task_handle < 0) {\n\t\tPX4_ERR(\"task start failed\");\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n\nint stop()\n{\n\tif (!_is_running) {\n\t\tPX4_WARN(\"not running\");\n\t\treturn -1;\n\t}\n\n\t_task_should_exit = true;\n\n\twhile (_is_running) {\n\t\tusleep(200000);\n\t\tPX4_INFO(\".\");\n\t}\n\n\t_task_handle = -1;\n\treturn 0;\n}\n\nint info()\n{\n\tPX4_INFO(\"running: %s\", _is_running ? \"yes\" : \"no\");\n\n\treturn 0;\n}\n\nvoid\nusage()\n{\n\tPX4_INFO(\"Usage: spektrum_rc {start|info|stop}\");\n}\n\n} \/\/ namespace spektrum_rc\n\n\nint spektrum_rc_main(int argc, char *argv[])\n{\n\tint myoptind = 1;\n\n\tif (argc <= 1) {\n\t\tspektrum_rc::usage();\n\t\treturn 1;\n\t}\n\n\tconst char *verb = argv[myoptind];\n\n\n\tif (!strcmp(verb, \"start\")) {\n\t\treturn spektrum_rc::start();\n\t}\n\n\telse if (!strcmp(verb, \"stop\")) {\n\t\treturn spektrum_rc::stop();\n\t}\n\n\telse if (!strcmp(verb, \"info\")) {\n\t\treturn spektrum_rc::info();\n\t}\n\n\telse {\n\t\tspektrum_rc::usage();\n\t\treturn 1;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#define WIN32_LEAN_AND_MEAN\n#define STRICT\n#define _ATL_NO_AUTOMATIC_NAMESPACE\n#define _CRTDBG_MAP_ALLOC\n#include <windows.h>\n#include <atlbase.h>\n#include <pathcch.h>\n#include <shlwapi.h>\n#include <winioctl.h>\n#include <algorithm>\n#include <clocale>\n#include <cstdio>\n#include <memory>\n#include <crtdbg.h>\n#pragma comment(lib, \"pathcch\")\n#pragma comment(lib, \"shlwapi\")\n#pragma comment(lib, \"user32\")\n\n#pragma region\nstatic_assert( FIELD_OFFSET( FSCTL_GET_INTEGRITY_INFORMATION_BUFFER, ChecksumAlgorithm )\n\t\t\t== FIELD_OFFSET( FSCTL_SET_INTEGRITY_INFORMATION_BUFFER, ChecksumAlgorithm ), \"\" );\nstatic_assert( RTL_SIZEOF_THROUGH_FIELD( FSCTL_GET_INTEGRITY_INFORMATION_BUFFER, ChecksumAlgorithm )\n\t\t\t== RTL_SIZEOF_THROUGH_FIELD( FSCTL_SET_INTEGRITY_INFORMATION_BUFFER, ChecksumAlgorithm ), \"\" );\nstatic_assert( FIELD_OFFSET( FSCTL_GET_INTEGRITY_INFORMATION_BUFFER, Reserved )\n\t\t\t== FIELD_OFFSET( FSCTL_SET_INTEGRITY_INFORMATION_BUFFER, Reserved ), \"\" );\nstatic_assert( RTL_SIZEOF_THROUGH_FIELD( FSCTL_GET_INTEGRITY_INFORMATION_BUFFER, Reserved )\n\t\t\t== RTL_SIZEOF_THROUGH_FIELD( FSCTL_SET_INTEGRITY_INFORMATION_BUFFER, Reserved ), \"\" );\nstatic_assert( FIELD_OFFSET( FSCTL_GET_INTEGRITY_INFORMATION_BUFFER, Flags )\n\t\t\t== FIELD_OFFSET( FSCTL_SET_INTEGRITY_INFORMATION_BUFFER, Flags ), \"\" );\nstatic_assert( RTL_SIZEOF_THROUGH_FIELD( FSCTL_GET_INTEGRITY_INFORMATION_BUFFER, Flags )\n\t\t\t== RTL_SIZEOF_THROUGH_FIELD( FSCTL_SET_INTEGRITY_INFORMATION_BUFFER, Flags ), \"\" );\n#pragma endregion\n\nstd::unique_ptr<WCHAR[]> GetWindowsError( ULONG error_code = GetLastError() )\n{\n\tauto msg = std::make_unique<WCHAR[]>( USHRT_MAX );\n\tif( FormatMessageW( FORMAT_MESSAGE_FROM_SYSTEM, nullptr, error_code, 0, msg.get(), USHRT_MAX, nullptr ) )\n\t{\n\t\treturn msg;\n\t}\n\treturn nullptr;\n}\nvoid PrintWindowsError( ULONG error_code = GetLastError() )\n{\n\tif( auto error_msg = GetWindowsError( error_code ) )\n\t{\n\t\tfprintf( stderr, \"%ls\\n\", error_msg.get() );\n\t}\n}\n_Success_( return == true )\nbool reflink( _In_z_ PCWSTR oldpath, _In_z_ PCWSTR newpath )\n{\n\t_ASSERTE( oldpath != nullptr && newpath != nullptr );\n\tATL::CHandle source{ CreateFileW( oldpath, GENERIC_READ, FILE_SHARE_READ, nullptr, OPEN_EXISTING, 0, nullptr ) };\n\tif( source == INVALID_HANDLE_VALUE )\n\t{\n\t\tsource.Detach();\n\t\treturn false;\n\t}\n\n\tULONG fs_flags;\n\tif( !GetVolumeInformationByHandleW( source, nullptr, 0, nullptr, nullptr, &fs_flags, nullptr, 0 ) )\n\t{\n\t\treturn false;\n\t}\n\tif( !( fs_flags & FILE_SUPPORTS_BLOCK_REFCOUNTING ) )\n\t{\n\t\tSetLastError( ERROR_NOT_CAPABLE );\n\t\treturn false;\n\t}\n\n\tFILE_STANDARD_INFO file_standard;\n\tif( !GetFileInformationByHandleEx( source, FileStandardInfo, &file_standard, sizeof file_standard ) )\n\t{\n\t\treturn false;\n\t}\n\tFILE_BASIC_INFO file_basic;\n\tif( !GetFileInformationByHandleEx( source, FileBasicInfo, &file_basic, sizeof file_basic ) )\n\t{\n\t\treturn false;\n\t}\n\tULONG dummy;\n\tunion{\n\t\tFSCTL_GET_INTEGRITY_INFORMATION_BUFFER get_integrity;\n\t\tFSCTL_SET_INTEGRITY_INFORMATION_BUFFER set_integrity;\n\t};\n\tif( !DeviceIoControl( source, FSCTL_GET_INTEGRITY_INFORMATION, nullptr, 0, &get_integrity, sizeof get_integrity, &dummy, nullptr ) )\n\t{\n\t\treturn false;\n\t}\n\n#ifdef _DEBUG\n\tATL::CHandle destination{ CreateFileW( newpath, GENERIC_READ | GENERIC_WRITE | DELETE, 0, nullptr, CREATE_ALWAYS, 0, source ) };\n#else\n\tATL::CHandle destination{ CreateFileW( newpath, GENERIC_READ | GENERIC_WRITE | DELETE, 0, nullptr, CREATE_NEW, 0, source ) };\n#endif\n\tif( destination == INVALID_HANDLE_VALUE )\n\t{\n\t\tdestination.Detach();\n\t\treturn false;\n\t}\n\tFILE_DISPOSITION_INFO dispose = { TRUE };\n\tif( !SetFileInformationByHandle( destination, FileDispositionInfo, &dispose, sizeof dispose ) )\n\t{\n\t\treturn false;\n\t}\n\n\tif( file_basic.FileAttributes & FILE_ATTRIBUTE_SPARSE_FILE )\n\t{\n\t\tif( !DeviceIoControl( destination, FSCTL_SET_SPARSE, nullptr, 0, nullptr, 0, &dummy, nullptr ) )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\tif( !DeviceIoControl( destination, FSCTL_SET_INTEGRITY_INFORMATION, &set_integrity, sizeof set_integrity, nullptr, 0, nullptr, nullptr ) )\n\t{\n\t\treturn false;\n\t}\n\tFILE_END_OF_FILE_INFO end_of_file = { file_standard.EndOfFile };\n\tif( !SetFileInformationByHandle( destination, FileEndOfFileInfo, &end_of_file, sizeof end_of_file ) )\n\t{\n\t\treturn false;\n\t}\n\n\tconst ULONG split_threshold = 0UL - get_integrity.ClusterSizeInBytes;\n\n\tDUPLICATE_EXTENTS_DATA dup_extent = { source };\n\tfor( LONG64 offset = 0, remain = file_standard.AllocationSize.QuadPart; remain > 0; offset += split_threshold, remain -= split_threshold )\n\t{\n\t\tdup_extent.SourceFileOffset.QuadPart = dup_extent.TargetFileOffset.QuadPart = offset;\n\t\tdup_extent.ByteCount.QuadPart = std::min<LONG64>( split_threshold, remain );\n\t\t_ASSERTE( dup_extent.ByteCount.HighPart == 0 );\n\t\t_RPT3( _CRT_WARN, \"r=%llx\\no=%llx\\nb=%llx\\n\\n\", remain, dup_extent.SourceFileOffset.QuadPart, dup_extent.ByteCount.QuadPart );\n\t\tif( !DeviceIoControl( destination, FSCTL_DUPLICATE_EXTENTS_TO_FILE, &dup_extent, sizeof dup_extent, nullptr, 0, &dummy, nullptr ) )\n\t\t{\n\t\t\t_CrtDbgBreak();\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tFILETIME atime = { file_basic.LastAccessTime.LowPart, ULONG( file_basic.LastAccessTime.HighPart ) };\n\tFILETIME mtime = { file_basic.LastWriteTime.LowPart, ULONG( file_basic.LastWriteTime.HighPart ) };\n\tSetFileTime( destination, nullptr, &atime, &mtime );\n\tdispose.DeleteFile = FALSE;\n\treturn SetFileInformationByHandle( destination, FileDispositionInfo, &dispose, sizeof dispose ) != 0;\n}\nint __cdecl wmain( int argc, PWSTR argv[] )\n{\n\t_CrtSetDbgFlag( _CrtSetDbgFlag( _CRTDBG_REPORT_FLAG ) | _CRTDBG_LEAK_CHECK_DF );\n\t_CrtSetReportFile( _CRT_WARN, _CRTDBG_FILE_STDERR );\n\t_CrtSetReportMode( _CRT_WARN, _CRTDBG_MODE_DEBUG | _CRTDBG_MODE_FILE );\n\tsetlocale( LC_ALL, \"\" );\n\n\tif( argc != 3 )\n\t{\n\t\tfprintf(\n\t\t\tstderr,\n\t\t\t\"Copy file without actual data write.\\n\"\n\t\t\t\"\\n\"\n\t\t\t\"%ls source destination\\n\"\n\t\t\t\"\\n\"\n\t\t\t\"source       Specifies a file to copy.\\n\"\n\t\t\t\"             source must have placed on the ReFS volume.\\n\"\n\t\t\t\"destination  Specifies new file name.\\n\"\n\t\t\t\"             destination must have placed on the same volume as source.\\n\",\n\t\t\tPathFindFileNameW( argv[0] )\n\t\t\t);\n\t\treturn EXIT_FAILURE;\n\t}\n\tauto source = std::make_unique<WCHAR[]>( PATHCCH_MAX_CCH );\n\tauto destination = std::make_unique<WCHAR[]>( PATHCCH_MAX_CCH );\n\tif( FAILED( PathCchCanonicalizeEx( source.get(), PATHCCH_MAX_CCH, argv[1], PATHCCH_ALLOW_LONG_PATHS ) )\n\t\t|| FAILED( PathCchCanonicalizeEx( destination.get(), PATHCCH_MAX_CCH, argv[2], PATHCCH_ALLOW_LONG_PATHS ) ) )\n\t{\n\t\tPrintWindowsError();\n\t\treturn EXIT_FAILURE;\n\t}\n\tif( !reflink( source.get(), destination.get() ) )\n\t{\n\t\tPrintWindowsError();\n\t\treturn EXIT_FAILURE;\n\t}\n}<commit_msg>Minor change<commit_after>#define WIN32_LEAN_AND_MEAN\n#define STRICT\n#define _ATL_NO_AUTOMATIC_NAMESPACE\n#define _CRTDBG_MAP_ALLOC\n#include <windows.h>\n#include <atlbase.h>\n#include <pathcch.h>\n#include <shlwapi.h>\n#include <winioctl.h>\n#include <algorithm>\n#include <clocale>\n#include <cstdio>\n#include <memory>\n#include <crtdbg.h>\n#pragma comment(lib, \"pathcch\")\n#pragma comment(lib, \"shlwapi\")\n#pragma comment(lib, \"user32\")\n\nstd::unique_ptr<WCHAR[]> GetWindowsError( ULONG error_code = GetLastError() )\n{\n\tauto msg = std::make_unique<WCHAR[]>( USHRT_MAX );\n\tif( FormatMessageW( FORMAT_MESSAGE_FROM_SYSTEM, nullptr, error_code, 0, msg.get(), USHRT_MAX, nullptr ) )\n\t{\n\t\treturn msg;\n\t}\n\treturn nullptr;\n}\nvoid PrintWindowsError( ULONG error_code = GetLastError() )\n{\n\tif( auto error_msg = GetWindowsError( error_code ) )\n\t{\n\t\tfprintf( stderr, \"%ls\\n\", error_msg.get() );\n\t}\n}\n_Success_( return == true )\nbool reflink( _In_z_ PCWSTR oldpath, _In_z_ PCWSTR newpath )\n{\n\t_ASSERTE( oldpath != nullptr && newpath != nullptr );\n\tATL::CHandle source{ CreateFileW( oldpath, GENERIC_READ, FILE_SHARE_READ, nullptr, OPEN_EXISTING, 0, nullptr ) };\n\tif( source == INVALID_HANDLE_VALUE )\n\t{\n\t\tsource.Detach();\n\t\treturn false;\n\t}\n\n\tULONG fs_flags;\n\tif( !GetVolumeInformationByHandleW( source, nullptr, 0, nullptr, nullptr, &fs_flags, nullptr, 0 ) )\n\t{\n\t\treturn false;\n\t}\n\tif( !( fs_flags & FILE_SUPPORTS_BLOCK_REFCOUNTING ) )\n\t{\n\t\tSetLastError( ERROR_NOT_CAPABLE );\n\t\treturn false;\n\t}\n\n\tFILE_STANDARD_INFO file_standard;\n\tif( !GetFileInformationByHandleEx( source, FileStandardInfo, &file_standard, sizeof file_standard ) )\n\t{\n\t\treturn false;\n\t}\n\tFILE_BASIC_INFO file_basic;\n\tif( !GetFileInformationByHandleEx( source, FileBasicInfo, &file_basic, sizeof file_basic ) )\n\t{\n\t\treturn false;\n\t}\n\tULONG dummy;\n\tFSCTL_GET_INTEGRITY_INFORMATION_BUFFER get_integrity;\n\tif( !DeviceIoControl( source, FSCTL_GET_INTEGRITY_INFORMATION, nullptr, 0, &get_integrity, sizeof get_integrity, &dummy, nullptr ) )\n\t{\n\t\treturn false;\n\t}\n\n#ifdef _DEBUG\n\tATL::CHandle destination{ CreateFileW( newpath, GENERIC_READ | GENERIC_WRITE | DELETE, 0, nullptr, CREATE_ALWAYS, 0, source ) };\n#else\n\tATL::CHandle destination{ CreateFileW( newpath, GENERIC_READ | GENERIC_WRITE | DELETE, 0, nullptr, CREATE_NEW, 0, source ) };\n#endif\n\tif( destination == INVALID_HANDLE_VALUE )\n\t{\n\t\tdestination.Detach();\n\t\treturn false;\n\t}\n\tFILE_DISPOSITION_INFO dispose = { TRUE };\n\tif( !SetFileInformationByHandle( destination, FileDispositionInfo, &dispose, sizeof dispose ) )\n\t{\n\t\treturn false;\n\t}\n\n\tif( file_basic.FileAttributes & FILE_ATTRIBUTE_SPARSE_FILE )\n\t{\n\t\tif( !DeviceIoControl( destination, FSCTL_SET_SPARSE, nullptr, 0, nullptr, 0, &dummy, nullptr ) )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\tFSCTL_SET_INTEGRITY_INFORMATION_BUFFER set_integrity = { get_integrity.ChecksumAlgorithm, get_integrity.Reserved, get_integrity.Flags };\n\tif( !DeviceIoControl( destination, FSCTL_SET_INTEGRITY_INFORMATION, &set_integrity, sizeof set_integrity, nullptr, 0, nullptr, nullptr ) )\n\t{\n\t\treturn false;\n\t}\n\tFILE_END_OF_FILE_INFO end_of_file = { file_standard.EndOfFile };\n\tif( !SetFileInformationByHandle( destination, FileEndOfFileInfo, &end_of_file, sizeof end_of_file ) )\n\t{\n\t\treturn false;\n\t}\n\n\tconst ULONG split_threshold = 0UL - get_integrity.ClusterSizeInBytes;\n\n\tDUPLICATE_EXTENTS_DATA dup_extent = { source };\n\tfor( LONG64 offset = 0, remain = file_standard.AllocationSize.QuadPart; remain > 0; offset += split_threshold, remain -= split_threshold )\n\t{\n\t\tdup_extent.SourceFileOffset.QuadPart = dup_extent.TargetFileOffset.QuadPart = offset;\n\t\tdup_extent.ByteCount.QuadPart = std::min<LONG64>( split_threshold, remain );\n\t\t_ASSERTE( dup_extent.ByteCount.HighPart == 0 );\n\t\t_RPT3( _CRT_WARN, \"r=%llx\\no=%llx\\nb=%llx\\n\\n\", remain, dup_extent.SourceFileOffset.QuadPart, dup_extent.ByteCount.QuadPart );\n\t\tif( !DeviceIoControl( destination, FSCTL_DUPLICATE_EXTENTS_TO_FILE, &dup_extent, sizeof dup_extent, nullptr, 0, &dummy, nullptr ) )\n\t\t{\n\t\t\t_CrtDbgBreak();\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tFILETIME atime = { file_basic.LastAccessTime.LowPart, ULONG( file_basic.LastAccessTime.HighPart ) };\n\tFILETIME mtime = { file_basic.LastWriteTime.LowPart, ULONG( file_basic.LastWriteTime.HighPart ) };\n\tSetFileTime( destination, nullptr, &atime, &mtime );\n\tdispose.DeleteFile = FALSE;\n\treturn SetFileInformationByHandle( destination, FileDispositionInfo, &dispose, sizeof dispose ) != 0;\n}\nint __cdecl wmain( int argc, PWSTR argv[] )\n{\n\t_CrtSetDbgFlag( _CrtSetDbgFlag( _CRTDBG_REPORT_FLAG ) | _CRTDBG_LEAK_CHECK_DF );\n\t_CrtSetReportFile( _CRT_WARN, _CRTDBG_FILE_STDERR );\n\t_CrtSetReportMode( _CRT_WARN, _CRTDBG_MODE_DEBUG | _CRTDBG_MODE_FILE );\n\tsetlocale( LC_ALL, \"\" );\n\n\tif( argc != 3 )\n\t{\n\t\tfprintf(\n\t\t\tstderr,\n\t\t\t\"Copy file without actual data write.\\n\"\n\t\t\t\"\\n\"\n\t\t\t\"%ls source destination\\n\"\n\t\t\t\"\\n\"\n\t\t\t\"source       Specifies a file to copy.\\n\"\n\t\t\t\"             source must have placed on the ReFS volume.\\n\"\n\t\t\t\"destination  Specifies new file name.\\n\"\n\t\t\t\"             destination must have placed on the same volume as source.\\n\",\n\t\t\tPathFindFileNameW( argv[0] )\n\t\t\t);\n\t\treturn EXIT_FAILURE;\n\t}\n\tauto source = std::make_unique<WCHAR[]>( PATHCCH_MAX_CCH );\n\tauto destination = std::make_unique<WCHAR[]>( PATHCCH_MAX_CCH );\n\tif( FAILED( PathCchCanonicalizeEx( source.get(), PATHCCH_MAX_CCH, argv[1], PATHCCH_ALLOW_LONG_PATHS ) )\n\t\t|| FAILED( PathCchCanonicalizeEx( destination.get(), PATHCCH_MAX_CCH, argv[2], PATHCCH_ALLOW_LONG_PATHS ) ) )\n\t{\n\t\tPrintWindowsError();\n\t\treturn EXIT_FAILURE;\n\t}\n\tif( !reflink( source.get(), destination.get() ) )\n\t{\n\t\tPrintWindowsError();\n\t\treturn EXIT_FAILURE;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>#include \"bvsd.h\"\n\n\/** Main function, creates interactive loop. *\/\nint main(const int argc, const char** argv)\n{\n\tsignal(SIGINT, mainSignal);\n\tsignal(SIGSEGV, mainSignal);\n\tsignal(SIGALRM, mainSignal);\n\n\tbvs = new BVS::BVS(argc, argv, &shutdownFunction);\n\n\tLOG(2, \"loading modules!\");\n\tbvs->loadModules();\n\n\tLOG(2, \"connecting modules!\");\n\tbvs->connectAllModules();\n\n\tLOG(2, \"starting!\");\n\tbvs->start(bvs->config.getValue<bool>(\"BVSD.interactive\", true));\n\n\tbvs->run();\n\n\tstd::string input;\n\twhile (true)\n\t{\n\t\tstd::getline(std::cin, input);\n\t\tif (std::cin.eof()) input = \"q\";\n\n\t\tif (input == \"r\" || input == \"run\" || input == \"c\" || input == \"continue\")\n\t\t{\n\t\t\tLOG(2, \"RUN!!!\");\n\t\t\tbvs->run();\n\t\t}\n\t\telse if (input.empty() || input == \"s\" || input == \"step\")\n\t\t{\n\t\t\tLOG(2, \"STEP!!!\");\n\t\t\tbvs->step();\n\t\t}\n\t\telse if (input == \"p\" || input == \"pause\")\n\t\t{\n\t\t\tLOG(2, \"PAUSING!!!\");\n\t\t\tbvs->pause();\n\t\t}\n\t\telse if (input.substr(0,2) == \"hs\" || input.substr(0, 7) == \"hotswap\")\n\t\t{\n\t\t\tsize_t delimiter = input.find_first_of(\" \");\n\t\t\tinput.erase(0, delimiter+1);\n\t\t\tif (input.empty() || delimiter==std::string::npos) std::cout << \"ERROR: no module ID given!\" << std::endl;\n\t\t\telse bvs->hotSwap(input);\n\t\t}\n\t\telse if (input == \"q\" || input == \"quit\")\n\t\t{\n\t\t\tLOG(2, \"quitting...\");\n\t\t\tbvs->quit();\n\t\t\tLOG(2, \"finished!\");\n\t\t\tbreak;\n\t\t}\n\t\telse if (input == \"h\" || input == \"help\")\n\t\t{\n\t\t\tstd::cout << \"usage:\" << std::endl;\n\t\t\tstd::cout << \"   r|run            run system until paused\" << std::endl;\n\t\t\tstd::cout << \"   c|continue       same as run\" << std::endl;\n\t\t\tstd::cout << \"   s|step           advance system by one step\" << std::endl;\n\t\t\tstd::cout << \"   p|pause          pause(stop) system\" << std::endl;\n\t\t\tstd::cout << \"   hs|hotswap <arg> HotSwap(TM) <moduleID>\" << std::endl;\n\t\t\tstd::cout << \"   q|quit           shutdown system and quit\" << std::endl;\n\t\t\tstd::cout << \"   h|help           show help\" << std::endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::cout << \">>> unknown command: \" << input << std::endl << \">>> for help press 'h<enter>'!\" << std::endl;\n\t\t}\n\t}\n\n\tdelete bvs;\n\n\treturn 0;\n}\n\n\n\nvoid mainSignal(int sig)\n{\n\tswitch (sig)\n\t{\n\t\tcase SIGINT:\n\t\t\tLOG(2, \"Caught 'Ctrl-C', quitting!\");\n\t\t\tbreak;\n\t\tcase SIGSEGV:\n\t\t\tLOG(2, \"Caught segmentation fault...!\");\n\t\t\tvoid *msgs[100];\n\t\t\tsize_t size;\n\t\t\tsize = backtrace(msgs, 100);\n\t\t\tfprintf(stderr, \"\\n\\n\\nCaught signal %d (%s)!\\n\\n\", sig, strsignal(sig));\n\t\t\tchar** messages;\n\t\t\tmessages = backtrace_symbols(msgs, size);\n\t\t\tfor (size_t i=2; i < size && messages != NULL; ++i)\n\t\t\t\tfprintf(stderr, \"[bt]: (%lu) %s\\n\", i-2, messages[i]);\n\t\t\tfree(messages);\n\t\t\tbreak;\n\t\tcase SIGALRM:\n\t\t\tLOG(2, \"Shutdown requested, quitting!\");\n\t\t\tbreak;\n\t}\n\n\tif (sig==SIGSEGV)\n\t{\n\t\tsignal(SIGSEGV, SIG_DFL);\n\t\traise(SIGSEGV);\n\t}\n\telse\n\t{\n\t\tbvs->quit();\n\t\tdelete bvs;\n\t\texit(EXIT_FAILURE);\n\t}\n}\n\n\n\nvoid shutdownFunction()\n{\n\tLOG(1,\"daemon exit caused by bvs shutdown request!\");\n\tbvs->quit();\n\talarm(1); \/\/ SIGALRM after 1 second so all framework\/module threads have a chance to quit\n}\n\n<commit_msg>daemon: fix (non-)interactive mode<commit_after>#include \"bvsd.h\"\n\n\/** Main function, creates interactive loop. *\/\nint main(const int argc, const char** argv)\n{\n\tsignal(SIGINT, mainSignal);\n\tsignal(SIGSEGV, mainSignal);\n\tsignal(SIGALRM, mainSignal);\n\n\tbvs = new BVS::BVS(argc, argv, &shutdownFunction);\n\n\tLOG(2, \"loading modules!\");\n\tbvs->loadModules();\n\n\tLOG(2, \"connecting modules!\");\n\tbvs->connectAllModules();\n\n\tLOG(2, \"starting!\");\n\tif (bvs->config.getValue<bool>(\"BVSD.interactive\", true)) {\n\t\tbvs->start();\n\t\tbvs->run();\n\t\tstd::string input;\n\t\twhile (true)\n\t\t{\n\t\t\tstd::getline(std::cin, input);\n\t\t\tif (std::cin.eof()) input = \"q\";\n\n\t\t\tif (input == \"r\" || input == \"run\" || input == \"c\" || input == \"continue\")\n\t\t\t{\n\t\t\t\tLOG(2, \"RUN!!!\");\n\t\t\t\tbvs->run();\n\t\t\t}\n\t\t\telse if (input.empty() || input == \"s\" || input == \"step\")\n\t\t\t{\n\t\t\t\tLOG(2, \"STEP!!!\");\n\t\t\t\tbvs->step();\n\t\t\t}\n\t\t\telse if (input == \"p\" || input == \"pause\")\n\t\t\t{\n\t\t\t\tLOG(2, \"PAUSING!!!\");\n\t\t\t\tbvs->pause();\n\t\t\t}\n\t\t\telse if (input.substr(0,2) == \"hs\" || input.substr(0, 7) == \"hotswap\")\n\t\t\t{\n\t\t\t\tsize_t delimiter = input.find_first_of(\" \");\n\t\t\t\tinput.erase(0, delimiter+1);\n\t\t\t\tif (input.empty() || delimiter==std::string::npos) std::cout << \"ERROR: no module ID given!\" << std::endl;\n\t\t\t\telse bvs->hotSwap(input);\n\t\t\t}\n\t\t\telse if (input == \"q\" || input == \"quit\")\n\t\t\t{\n\t\t\t\tLOG(2, \"quitting...\");\n\t\t\t\tbvs->quit();\n\t\t\t\tLOG(2, \"finished!\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (input == \"h\" || input == \"help\")\n\t\t\t{\n\t\t\t\tstd::cout << \"usage:\" << std::endl;\n\t\t\t\tstd::cout << \"   r|run            run system until paused\" << std::endl;\n\t\t\t\tstd::cout << \"   c|continue       same as run\" << std::endl;\n\t\t\t\tstd::cout << \"   s|step           advance system by one step\" << std::endl;\n\t\t\t\tstd::cout << \"   p|pause          pause(stop) system\" << std::endl;\n\t\t\t\tstd::cout << \"   hs|hotswap <arg> HotSwap(TM) <moduleID>\" << std::endl;\n\t\t\t\tstd::cout << \"   q|quit           shutdown system and quit\" << std::endl;\n\t\t\t\tstd::cout << \"   h|help           show help\" << std::endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstd::cout << \">>> unknown command: \" << input << std::endl << \">>> for help press 'h<enter>'!\" << std::endl;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tbvs->start(false);\n\t\tbvs->run();\n\t}\n\n\tdelete bvs;\n\n\treturn 0;\n}\n\n\n\nvoid mainSignal(int sig)\n{\n\tswitch (sig)\n\t{\n\t\tcase SIGINT:\n\t\t\tLOG(2, \"Caught 'Ctrl-C', quitting!\");\n\t\t\tbreak;\n\t\tcase SIGSEGV:\n\t\t\tLOG(2, \"Caught segmentation fault...!\");\n\t\t\tvoid *msgs[100];\n\t\t\tsize_t size;\n\t\t\tsize = backtrace(msgs, 100);\n\t\t\tfprintf(stderr, \"\\n\\n\\nCaught signal %d (%s)!\\n\\n\", sig, strsignal(sig));\n\t\t\tchar** messages;\n\t\t\tmessages = backtrace_symbols(msgs, size);\n\t\t\tfor (size_t i=2; i < size && messages != NULL; ++i)\n\t\t\t\tfprintf(stderr, \"[bt]: (%lu) %s\\n\", i-2, messages[i]);\n\t\t\tfree(messages);\n\t\t\tbreak;\n\t\tcase SIGALRM:\n\t\t\tLOG(2, \"Shutdown requested, quitting!\");\n\t\t\tbreak;\n\t}\n\n\tif (sig==SIGSEGV)\n\t{\n\t\tsignal(SIGSEGV, SIG_DFL);\n\t\traise(SIGSEGV);\n\t}\n\telse\n\t{\n\t\tbvs->quit();\n\t\tdelete bvs;\n\t\texit(EXIT_FAILURE);\n\t}\n}\n\n\n\nvoid shutdownFunction()\n{\n\tLOG(1,\"daemon exit caused by bvs shutdown request!\");\n\tbvs->quit();\n\talarm(1); \/\/ SIGALRM after 1 second so all framework\/module threads have a chance to quit\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2012 VoltDB Inc.\n *\n * VoltDB 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 * VoltDB is distributed in the hope that it 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 VoltDB.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"indexcountexecutor.h\"\n\n#include \"common\/debuglog.h\"\n#include \"common\/common.h\"\n#include \"common\/tabletuple.h\"\n#include \"common\/FatalException.hpp\"\n#include \"expressions\/abstractexpression.h\"\n#include \"expressions\/expressionutil.h\"\n#include \"plannodes\/indexcountnode.h\"\n#include \"storage\/table.h\"\n#include \"storage\/tableiterator.h\"\n#include \"storage\/tablefactory.h\"\n#include \"storage\/temptable.h\"\n#include \"storage\/persistenttable.h\"\n\nusing namespace voltdb;\n\nbool IndexCountExecutor::p_init(AbstractPlanNode *abstractNode,\n                                TempTableLimits* limits)\n{\n    VOLT_DEBUG(\"init IndexCount Executor\");\n\n    m_node = dynamic_cast<IndexCountPlanNode*>(abstractNode);\n    assert(m_node);\n    assert(m_node->getTargetTable());\n    assert(m_node->getPredicate() == NULL);\n\n    \/\/ Create output table based on output schema from the plan\n    TupleSchema* schema = m_node->generateTupleSchema(false);\n    int column_count = static_cast<int>(m_node->getOutputSchema().size());\n    assert(column_count == 1);\n\n    std::string* column_names = new std::string[column_count];\n    column_names[0] = m_node->getOutputSchema()[0]->getColumnName();\n\n    m_node->setOutputTable(TableFactory::getTempTable(m_node->databaseId(),\n                                                      m_node->getTargetTable()->name(),\n                                                      schema,\n                                                      column_names,\n                                                      limits));\n    delete[] column_names;\n\n    \/\/\n    \/\/ Make sure that we have search keys and that they're not null\n    \/\/\n    m_numOfSearchkeys = (int)m_node->getSearchKeyExpressions().size();\n    m_searchKeyBeforeSubstituteArrayPtr =\n        boost::shared_array<AbstractExpression*>\n    (new AbstractExpression*[m_numOfSearchkeys]);\n    m_searchKeyBeforeSubstituteArray = m_searchKeyBeforeSubstituteArrayPtr.get();\n    m_needsSubstituteSearchKeyPtr =\n        boost::shared_array<bool>(new bool[m_numOfSearchkeys]);\n    m_needsSubstituteSearchKey = m_needsSubstituteSearchKeyPtr.get();\n\n    for (int ctr = 0; ctr < m_numOfSearchkeys; ctr++)\n    {\n        if (m_node->getSearchKeyExpressions()[ctr] == NULL)\n        {\n            VOLT_ERROR(\"The search key expression at position '%d' is NULL for\"\n                \" PlanNode '%s'\", ctr, m_node->debug().c_str());\n            return false;\n        }\n        m_needsSubstituteSearchKeyPtr[ctr] =\n            m_node->getSearchKeyExpressions()[ctr]->hasParameter();\n        m_searchKeyBeforeSubstituteArrayPtr[ctr] =\n            m_node->getSearchKeyExpressions()[ctr];\n    }\n\n    m_numOfEndkeys = (int)m_node->getEndKeyExpressions().size();\n    if (m_numOfEndkeys != 0) {\n        m_endKeyBeforeSubstituteArrayPtr =\n            boost::shared_array<AbstractExpression*> (new AbstractExpression*[m_numOfEndkeys]);\n        m_endKeyBeforeSubstituteArray = m_endKeyBeforeSubstituteArrayPtr.get();\n        m_needsSubstituteEndKeyPtr =\n            boost::shared_array<bool>(new bool[m_numOfEndkeys]);\n        m_needsSubstituteEndKey = m_needsSubstituteEndKeyPtr.get();\n        for (int ctr = 0; ctr < m_numOfEndkeys; ctr++)\n        {\n            if (m_node->getEndKeyExpressions()[ctr] == NULL) {\n                VOLT_ERROR(\"The end key expression at position '%d' is NULL for\"\n                    \" PlanNode '%s'\", ctr, m_node->debug().c_str());\n                return false;\n            }\n            m_needsSubstituteEndKeyPtr[ctr] =\n                m_node->getEndKeyExpressions()[ctr]->hasParameter();\n            m_endKeyBeforeSubstituteArrayPtr[ctr] =\n                m_node->getEndKeyExpressions()[ctr];\n        }\n    }\n\n    \/\/\n    \/\/ Initialize local variables\n    \/\/\n\n    \/\/output table should be temptable\n    m_outputTable = static_cast<TempTable*>(m_node->getOutputTable());\n    \/\/target table should be persistenttable\n    m_targetTable = static_cast<PersistentTable*>(m_node->getTargetTable());\n    m_numOfColumns = static_cast<int>(m_outputTable->columnCount());\n\n    assert(m_numOfColumns == 1);\n    \/\/\n    \/\/ Grab the Index from our inner table\n    \/\/ We'll throw an error if the index is missing\n    \/\/\n    m_index = m_targetTable->index(m_node->getTargetIndexName());\n    assert (m_index != NULL);\n\n    \/\/ This index should have a true countable flag\n    assert(m_index->is_countable_index_);\n\n    m_searchKey = TableTuple(m_index->getKeySchema());\n    m_searchKeyBackingStore = new char[m_index->getKeySchema()->tupleLength()];\n    m_searchKey.moveNoHeader(m_searchKeyBackingStore);\n    if (m_numOfEndkeys != 0) {\n        m_endKey = TableTuple(m_index->getKeySchema());\n        m_endKeyBackingStore = new char[m_index->getKeySchema()->tupleLength()];\n        m_endKey.moveNoHeader(m_endKeyBackingStore);\n    }\n\n    \/\/ Miscellanous Information\n    m_lookupType = m_node->getLookupType();\n    if (m_numOfEndkeys != 0) {\n        m_endType = m_node->getEndType();\n    }\n\n    \/\/ Need to move GTE to find (x,_) when doing a partial covering search.\n    \/\/ the planner sometimes lies in this case: index_lookup_type_eq is incorrect.\n    \/\/ Index_lookup_type_gte is necessary. Make the change here.\n    if (m_lookupType == INDEX_LOOKUP_TYPE_EQ &&\n        m_searchKey.getSchema()->columnCount() > m_numOfSearchkeys)\n    {\n        VOLT_TRACE(\"Setting lookup type to GTE for partial covering key.\");\n        m_lookupType = INDEX_LOOKUP_TYPE_GTE;\n    }\n\n    return true;\n}\n\nbool IndexCountExecutor::p_execute(const NValueArray &params)\n{\n    assert(m_node);\n    assert(m_node == dynamic_cast<IndexCountPlanNode*>(m_abstractNode));\n    assert(m_outputTable);\n    assert(m_outputTable == static_cast<TempTable*>(m_node->getOutputTable()));\n    assert(m_targetTable);\n    assert(m_targetTable == m_node->getTargetTable());\n    VOLT_DEBUG(\"IndexCount: %s.%s\\n\", m_targetTable->name().c_str(),\n               m_index->getName().c_str());\n\n    int activeNumOfSearchKeys = m_numOfSearchkeys;\n    IndexLookupType localLookupType = m_lookupType;\n    bool searchKeyUnderflow = false, endKeyOverflow = false;\n    \/\/ Overflow cases that can return early without accessing the index need this\n    \/\/ default 0 count as their result.\n    TableTuple& tmptup = m_outputTable->tempTuple();\n    tmptup.setNValue(0, ValueFactory::getBigIntValue( 0 ));\n    TableTuple m_dummy;\n\n    \/\/\n    \/\/ SEARCH KEY\n    \/\/\n    m_searchKey.setAllNulls();\n    VOLT_DEBUG(\"<Index Count>Initial (all null) search key: '%s'\", m_searchKey.debugNoHeader().c_str());\n    for (int ctr = 0; ctr < activeNumOfSearchKeys; ctr++) {\n        if (m_needsSubstituteSearchKey[ctr]) {\n            m_searchKeyBeforeSubstituteArray[ctr]->substitute(params);\n        }\n        NValue candidateValue = m_searchKeyBeforeSubstituteArray[ctr]->eval(&m_dummy, NULL);\n        try {\n            m_searchKey.setNValue(ctr, candidateValue);\n        }\n        catch (SQLException e) {\n            \/\/ This next bit of logic handles underflow and overflow while\n            \/\/ setting up the search keys.\n            \/\/ e.g. TINYINT > 200 or INT <= 6000000000\n\n            \/\/ re-throw if not an overflow or underflow\n            \/\/ currently, it's expected to always be an overflow or underflow\n            if ((e.getInternalFlags() & (SQLException::TYPE_OVERFLOW | SQLException::TYPE_UNDERFLOW)) == 0) {\n                throw e;\n            }\n\n            \/\/ handle the case where this is a comparison, rather than equality match\n            \/\/ comparison is the only place where the executor might return matching tuples\n            \/\/ e.g. TINYINT < 1000 should return all values\n\n            if ((localLookupType != INDEX_LOOKUP_TYPE_EQ) &&\n                (ctr == (activeNumOfSearchKeys - 1))) {\n                assert (localLookupType == INDEX_LOOKUP_TYPE_GT || localLookupType == INDEX_LOOKUP_TYPE_GTE);\n\n                if (e.getInternalFlags() & SQLException::TYPE_OVERFLOW) {\n                    m_outputTable->insertTuple(tmptup);\n                    return true;\n                } else if (e.getInternalFlags() & SQLException::TYPE_UNDERFLOW) {\n                    searchKeyUnderflow = true;\n                    break;\n                } else {\n                    throw e;\n                }\n            }\n            \/\/ if a EQ comparision is out of range, then return no tuples\n            else {\n                m_outputTable->insertTuple(tmptup);\n                return true;\n            }\n            break;\n        }\n    }\n    assert(activeNumOfSearchKeys > 0);\n    VOLT_TRACE(\"Search key after substitutions: '%s'\", m_searchKey.debugNoHeader().c_str());\n\n    if (m_numOfEndkeys != 0) {\n        \/\/\n        \/\/ END KEY\n        \/\/\n        m_endKey.setAllNulls();\n        VOLT_DEBUG(\"Initial (all null) end key: '%s'\", m_endKey.debugNoHeader().c_str());\n        for (int ctr = 0; ctr < m_numOfEndkeys; ctr++) {\n            if (m_needsSubstituteEndKey[ctr]) {\n                m_endKeyBeforeSubstituteArray[ctr]->substitute(params);\n            }\n            NValue endKeyValue = m_endKeyBeforeSubstituteArray[ctr]->eval(&m_dummy, NULL);\n            try {\n                m_endKey.setNValue(ctr, endKeyValue);\n            }\n            catch (SQLException e) {\n                \/\/ This next bit of logic handles underflow and overflow while\n                \/\/ setting up the search keys.\n                \/\/ e.g. TINYINT > 200 or INT <= 6000000000\n\n                \/\/ re-throw if not an overflow or underflow\n                \/\/ currently, it's expected to always be an overflow or underflow\n                if ((e.getInternalFlags() & (SQLException::TYPE_OVERFLOW | SQLException::TYPE_UNDERFLOW)) == 0) {\n                    throw e;\n                }\n\n                if (ctr == (m_numOfEndkeys - 1)) {\n                    assert (m_endType == INDEX_LOOKUP_TYPE_LT || m_endType == INDEX_LOOKUP_TYPE_LTE);\n                    if (e.getInternalFlags() & SQLException::TYPE_UNDERFLOW) {\n                        m_outputTable->insertTuple(tmptup);\n                        return true;\n                    } else if (e.getInternalFlags() & SQLException::TYPE_OVERFLOW) {\n                        endKeyOverflow = true;\n                        const ValueType type = m_endKey.getSchema()->columnType(ctr);\n                        NValue tmpEndKeyValue = ValueFactory::getBigIntValue(getMaxTypeValue(type));\n                        m_endKey.setNValue(ctr, tmpEndKeyValue);\n\n                        VOLT_DEBUG(\"<Index count> end key out of range, MAX value: %ld...\\n\", (long)getMaxTypeValue(type));\n                        break;\n                    } else {\n                        throw e;\n                    }\n                }\n                \/\/ if a EQ comparision is out of range, then return no tuples\n                else {\n                    m_outputTable->insertTuple(tmptup);\n                    return true;\n                }\n                break;\n            }\n        }\n        \/\/assert((activeNumOfEndKeys == 0) || (m_endKey.getSchema()->columnCount() > 0));\n        VOLT_TRACE(\"End key after substitutions: '%s'\", m_endKey.debugNoHeader().c_str());\n    }\n\n    \/\/\n    \/\/ POST EXPRESSION\n    \/\/\n    assert (m_node->getPredicate() == NULL);\n\n    assert (m_index);\n    assert (m_index == m_targetTable->index(m_node->getTargetIndexName()));\n    assert (m_index->is_countable_index_);\n\n    \/\/ An index count has two cases: unique and non-unique\n    int64_t rkStart = 0, rkEnd = 0, rkRes = 0;\n    int leftIncluded = 0, rightIncluded = 0;\n\n    \/\/ Deal with multi-map\n    VOLT_DEBUG(\"INDEX_LOOKUP_TYPE(%d) m_numSearchkeys(%d) key:%s\",\n               localLookupType, activeNumOfSearchKeys, m_searchKey.debugNoHeader().c_str());\n    if (searchKeyUnderflow == false) {\n        if (localLookupType == INDEX_LOOKUP_TYPE_GT) {\n            rkStart = m_index->getCounterLET(&m_searchKey, true);\n        } else if (localLookupType == INDEX_LOOKUP_TYPE_GTE) {\n            if (m_index->hasKey(&m_searchKey)) {\n                leftIncluded = 1;\n                rkStart = m_index->getCounterLET(&m_searchKey, false);\n            } else {\n                rkStart = m_index->getCounterLET(&m_searchKey, true);\n            }\n            if (m_searchKey.getSchema()->columnCount() > activeNumOfSearchKeys) {\n                \/\/ search key is not complete:\n                \/\/ like: SELECT count(*) from T2 WHERE USERNAME ='XIN' AND POINTS < ?\n                \/\/ like: SELECT count(*) from T2 WHERE POINTS < ?\n                \/\/ but it actually finds the previous rank. (If m_searchKey is null, find 0 rank)\n                \/\/ Add 1 back.\n                rkStart++;\n                leftIncluded = 1;\n            }\n        } else {\n            return false;\n        }\n    }\n    if (m_numOfEndkeys != 0) {\n        if (endKeyOverflow) {\n            rkEnd = m_index->getCounterGET(&m_endKey, true);\n        } else {\n            IndexLookupType localEndType = m_endType;\n            if (localEndType == INDEX_LOOKUP_TYPE_LT) {\n                rkEnd = m_index->getCounterGET(&m_endKey, false);\n            } else if (localEndType == INDEX_LOOKUP_TYPE_LTE) {\n                if (m_index->hasKey(&m_endKey)) {\n                    rkEnd = m_index->getCounterGET(&m_endKey, true);\n                    rightIncluded = 1;\n                } else\n                    rkEnd = m_index->getCounterGET(&m_endKey, false);\n            } else {\n                return false;\n            }\n        }\n    } else {\n        rkEnd = m_index->getSize();\n        rightIncluded = 1;\n    }\n    rkRes = rkEnd - rkStart - 1 + leftIncluded + rightIncluded;\n    VOLT_DEBUG(\"Index Count ANSWER %ld = %ld - %ld - 1 + %d + %d\\n\", (long)rkRes, (long)rkEnd, (long)rkStart, leftIncluded, rightIncluded);\n    tmptup.setNValue(0, ValueFactory::getBigIntValue( rkRes ));\n    m_outputTable->insertTuple(tmptup);\n\n    VOLT_DEBUG (\"Index Count :\\n %s\", m_outputTable->debug().c_str());\n    return true;\n}\n\nIndexCountExecutor::~IndexCountExecutor() {\n    delete [] m_searchKeyBackingStore;\n    if (m_numOfEndkeys != 0)\n        delete [] m_endKeyBackingStore;\n}\n<commit_msg>Use the public method other than the protected variable<commit_after>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2012 VoltDB Inc.\n *\n * VoltDB 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 * VoltDB is distributed in the hope that it 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 VoltDB.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"indexcountexecutor.h\"\n\n#include \"common\/debuglog.h\"\n#include \"common\/common.h\"\n#include \"common\/tabletuple.h\"\n#include \"common\/FatalException.hpp\"\n#include \"expressions\/abstractexpression.h\"\n#include \"expressions\/expressionutil.h\"\n#include \"plannodes\/indexcountnode.h\"\n#include \"storage\/table.h\"\n#include \"storage\/tableiterator.h\"\n#include \"storage\/tablefactory.h\"\n#include \"storage\/temptable.h\"\n#include \"storage\/persistenttable.h\"\n\nusing namespace voltdb;\n\nbool IndexCountExecutor::p_init(AbstractPlanNode *abstractNode,\n                                TempTableLimits* limits)\n{\n    VOLT_DEBUG(\"init IndexCount Executor\");\n\n    m_node = dynamic_cast<IndexCountPlanNode*>(abstractNode);\n    assert(m_node);\n    assert(m_node->getTargetTable());\n    assert(m_node->getPredicate() == NULL);\n\n    \/\/ Create output table based on output schema from the plan\n    TupleSchema* schema = m_node->generateTupleSchema(false);\n    int column_count = static_cast<int>(m_node->getOutputSchema().size());\n    assert(column_count == 1);\n\n    std::string* column_names = new std::string[column_count];\n    column_names[0] = m_node->getOutputSchema()[0]->getColumnName();\n\n    m_node->setOutputTable(TableFactory::getTempTable(m_node->databaseId(),\n                                                      m_node->getTargetTable()->name(),\n                                                      schema,\n                                                      column_names,\n                                                      limits));\n    delete[] column_names;\n\n    \/\/\n    \/\/ Make sure that we have search keys and that they're not null\n    \/\/\n    m_numOfSearchkeys = (int)m_node->getSearchKeyExpressions().size();\n    m_searchKeyBeforeSubstituteArrayPtr =\n        boost::shared_array<AbstractExpression*>\n    (new AbstractExpression*[m_numOfSearchkeys]);\n    m_searchKeyBeforeSubstituteArray = m_searchKeyBeforeSubstituteArrayPtr.get();\n    m_needsSubstituteSearchKeyPtr =\n        boost::shared_array<bool>(new bool[m_numOfSearchkeys]);\n    m_needsSubstituteSearchKey = m_needsSubstituteSearchKeyPtr.get();\n\n    for (int ctr = 0; ctr < m_numOfSearchkeys; ctr++)\n    {\n        if (m_node->getSearchKeyExpressions()[ctr] == NULL)\n        {\n            VOLT_ERROR(\"The search key expression at position '%d' is NULL for\"\n                \" PlanNode '%s'\", ctr, m_node->debug().c_str());\n            return false;\n        }\n        m_needsSubstituteSearchKeyPtr[ctr] =\n            m_node->getSearchKeyExpressions()[ctr]->hasParameter();\n        m_searchKeyBeforeSubstituteArrayPtr[ctr] =\n            m_node->getSearchKeyExpressions()[ctr];\n    }\n\n    m_numOfEndkeys = (int)m_node->getEndKeyExpressions().size();\n    if (m_numOfEndkeys != 0) {\n        m_endKeyBeforeSubstituteArrayPtr =\n            boost::shared_array<AbstractExpression*> (new AbstractExpression*[m_numOfEndkeys]);\n        m_endKeyBeforeSubstituteArray = m_endKeyBeforeSubstituteArrayPtr.get();\n        m_needsSubstituteEndKeyPtr =\n            boost::shared_array<bool>(new bool[m_numOfEndkeys]);\n        m_needsSubstituteEndKey = m_needsSubstituteEndKeyPtr.get();\n        for (int ctr = 0; ctr < m_numOfEndkeys; ctr++)\n        {\n            if (m_node->getEndKeyExpressions()[ctr] == NULL) {\n                VOLT_ERROR(\"The end key expression at position '%d' is NULL for\"\n                    \" PlanNode '%s'\", ctr, m_node->debug().c_str());\n                return false;\n            }\n            m_needsSubstituteEndKeyPtr[ctr] =\n                m_node->getEndKeyExpressions()[ctr]->hasParameter();\n            m_endKeyBeforeSubstituteArrayPtr[ctr] =\n                m_node->getEndKeyExpressions()[ctr];\n        }\n    }\n\n    \/\/\n    \/\/ Initialize local variables\n    \/\/\n\n    \/\/output table should be temptable\n    m_outputTable = static_cast<TempTable*>(m_node->getOutputTable());\n    \/\/target table should be persistenttable\n    m_targetTable = static_cast<PersistentTable*>(m_node->getTargetTable());\n    m_numOfColumns = static_cast<int>(m_outputTable->columnCount());\n\n    assert(m_numOfColumns == 1);\n    \/\/\n    \/\/ Grab the Index from our inner table\n    \/\/ We'll throw an error if the index is missing\n    \/\/\n    m_index = m_targetTable->index(m_node->getTargetIndexName());\n    assert (m_index != NULL);\n\n    \/\/ This index should have a true countable flag\n    assert(m_index->isCountableIndex());\n\n    m_searchKey = TableTuple(m_index->getKeySchema());\n    m_searchKeyBackingStore = new char[m_index->getKeySchema()->tupleLength()];\n    m_searchKey.moveNoHeader(m_searchKeyBackingStore);\n    if (m_numOfEndkeys != 0) {\n        m_endKey = TableTuple(m_index->getKeySchema());\n        m_endKeyBackingStore = new char[m_index->getKeySchema()->tupleLength()];\n        m_endKey.moveNoHeader(m_endKeyBackingStore);\n    }\n\n    \/\/ Miscellanous Information\n    m_lookupType = m_node->getLookupType();\n    if (m_numOfEndkeys != 0) {\n        m_endType = m_node->getEndType();\n    }\n\n    \/\/ Need to move GTE to find (x,_) when doing a partial covering search.\n    \/\/ the planner sometimes lies in this case: index_lookup_type_eq is incorrect.\n    \/\/ Index_lookup_type_gte is necessary. Make the change here.\n    if (m_lookupType == INDEX_LOOKUP_TYPE_EQ &&\n        m_searchKey.getSchema()->columnCount() > m_numOfSearchkeys)\n    {\n        VOLT_TRACE(\"Setting lookup type to GTE for partial covering key.\");\n        m_lookupType = INDEX_LOOKUP_TYPE_GTE;\n    }\n\n    return true;\n}\n\nbool IndexCountExecutor::p_execute(const NValueArray &params)\n{\n    assert(m_node);\n    assert(m_node == dynamic_cast<IndexCountPlanNode*>(m_abstractNode));\n    assert(m_outputTable);\n    assert(m_outputTable == static_cast<TempTable*>(m_node->getOutputTable()));\n    assert(m_targetTable);\n    assert(m_targetTable == m_node->getTargetTable());\n    VOLT_DEBUG(\"IndexCount: %s.%s\\n\", m_targetTable->name().c_str(),\n               m_index->getName().c_str());\n\n    int activeNumOfSearchKeys = m_numOfSearchkeys;\n    IndexLookupType localLookupType = m_lookupType;\n    bool searchKeyUnderflow = false, endKeyOverflow = false;\n    \/\/ Overflow cases that can return early without accessing the index need this\n    \/\/ default 0 count as their result.\n    TableTuple& tmptup = m_outputTable->tempTuple();\n    tmptup.setNValue(0, ValueFactory::getBigIntValue( 0 ));\n    TableTuple m_dummy;\n\n    \/\/\n    \/\/ SEARCH KEY\n    \/\/\n    m_searchKey.setAllNulls();\n    VOLT_DEBUG(\"<Index Count>Initial (all null) search key: '%s'\", m_searchKey.debugNoHeader().c_str());\n    for (int ctr = 0; ctr < activeNumOfSearchKeys; ctr++) {\n        if (m_needsSubstituteSearchKey[ctr]) {\n            m_searchKeyBeforeSubstituteArray[ctr]->substitute(params);\n        }\n        NValue candidateValue = m_searchKeyBeforeSubstituteArray[ctr]->eval(&m_dummy, NULL);\n        try {\n            m_searchKey.setNValue(ctr, candidateValue);\n        }\n        catch (SQLException e) {\n            \/\/ This next bit of logic handles underflow and overflow while\n            \/\/ setting up the search keys.\n            \/\/ e.g. TINYINT > 200 or INT <= 6000000000\n\n            \/\/ re-throw if not an overflow or underflow\n            \/\/ currently, it's expected to always be an overflow or underflow\n            if ((e.getInternalFlags() & (SQLException::TYPE_OVERFLOW | SQLException::TYPE_UNDERFLOW)) == 0) {\n                throw e;\n            }\n\n            \/\/ handle the case where this is a comparison, rather than equality match\n            \/\/ comparison is the only place where the executor might return matching tuples\n            \/\/ e.g. TINYINT < 1000 should return all values\n\n            if ((localLookupType != INDEX_LOOKUP_TYPE_EQ) &&\n                (ctr == (activeNumOfSearchKeys - 1))) {\n                assert (localLookupType == INDEX_LOOKUP_TYPE_GT || localLookupType == INDEX_LOOKUP_TYPE_GTE);\n\n                if (e.getInternalFlags() & SQLException::TYPE_OVERFLOW) {\n                    m_outputTable->insertTuple(tmptup);\n                    return true;\n                } else if (e.getInternalFlags() & SQLException::TYPE_UNDERFLOW) {\n                    searchKeyUnderflow = true;\n                    break;\n                } else {\n                    throw e;\n                }\n            }\n            \/\/ if a EQ comparision is out of range, then return no tuples\n            else {\n                m_outputTable->insertTuple(tmptup);\n                return true;\n            }\n            break;\n        }\n    }\n    assert(activeNumOfSearchKeys > 0);\n    VOLT_TRACE(\"Search key after substitutions: '%s'\", m_searchKey.debugNoHeader().c_str());\n\n    if (m_numOfEndkeys != 0) {\n        \/\/\n        \/\/ END KEY\n        \/\/\n        m_endKey.setAllNulls();\n        VOLT_DEBUG(\"Initial (all null) end key: '%s'\", m_endKey.debugNoHeader().c_str());\n        for (int ctr = 0; ctr < m_numOfEndkeys; ctr++) {\n            if (m_needsSubstituteEndKey[ctr]) {\n                m_endKeyBeforeSubstituteArray[ctr]->substitute(params);\n            }\n            NValue endKeyValue = m_endKeyBeforeSubstituteArray[ctr]->eval(&m_dummy, NULL);\n            try {\n                m_endKey.setNValue(ctr, endKeyValue);\n            }\n            catch (SQLException e) {\n                \/\/ This next bit of logic handles underflow and overflow while\n                \/\/ setting up the search keys.\n                \/\/ e.g. TINYINT > 200 or INT <= 6000000000\n\n                \/\/ re-throw if not an overflow or underflow\n                \/\/ currently, it's expected to always be an overflow or underflow\n                if ((e.getInternalFlags() & (SQLException::TYPE_OVERFLOW | SQLException::TYPE_UNDERFLOW)) == 0) {\n                    throw e;\n                }\n\n                if (ctr == (m_numOfEndkeys - 1)) {\n                    assert (m_endType == INDEX_LOOKUP_TYPE_LT || m_endType == INDEX_LOOKUP_TYPE_LTE);\n                    if (e.getInternalFlags() & SQLException::TYPE_UNDERFLOW) {\n                        m_outputTable->insertTuple(tmptup);\n                        return true;\n                    } else if (e.getInternalFlags() & SQLException::TYPE_OVERFLOW) {\n                        endKeyOverflow = true;\n                        const ValueType type = m_endKey.getSchema()->columnType(ctr);\n                        NValue tmpEndKeyValue = ValueFactory::getBigIntValue(getMaxTypeValue(type));\n                        m_endKey.setNValue(ctr, tmpEndKeyValue);\n\n                        VOLT_DEBUG(\"<Index count> end key out of range, MAX value: %ld...\\n\", (long)getMaxTypeValue(type));\n                        break;\n                    } else {\n                        throw e;\n                    }\n                }\n                \/\/ if a EQ comparision is out of range, then return no tuples\n                else {\n                    m_outputTable->insertTuple(tmptup);\n                    return true;\n                }\n                break;\n            }\n        }\n        \/\/assert((activeNumOfEndKeys == 0) || (m_endKey.getSchema()->columnCount() > 0));\n        VOLT_TRACE(\"End key after substitutions: '%s'\", m_endKey.debugNoHeader().c_str());\n    }\n\n    \/\/\n    \/\/ POST EXPRESSION\n    \/\/\n    assert (m_node->getPredicate() == NULL);\n\n    assert (m_index);\n    assert (m_index == m_targetTable->index(m_node->getTargetIndexName()));\n    assert (m_index->isCountableIndex());\n\n    \/\/ An index count has two cases: unique and non-unique\n    int64_t rkStart = 0, rkEnd = 0, rkRes = 0;\n    int leftIncluded = 0, rightIncluded = 0;\n\n    \/\/ Deal with multi-map\n    VOLT_DEBUG(\"INDEX_LOOKUP_TYPE(%d) m_numSearchkeys(%d) key:%s\",\n               localLookupType, activeNumOfSearchKeys, m_searchKey.debugNoHeader().c_str());\n    if (searchKeyUnderflow == false) {\n        if (localLookupType == INDEX_LOOKUP_TYPE_GT) {\n            rkStart = m_index->getCounterLET(&m_searchKey, true);\n        } else if (localLookupType == INDEX_LOOKUP_TYPE_GTE) {\n            if (m_index->hasKey(&m_searchKey)) {\n                leftIncluded = 1;\n                rkStart = m_index->getCounterLET(&m_searchKey, false);\n            } else {\n                rkStart = m_index->getCounterLET(&m_searchKey, true);\n            }\n            if (m_searchKey.getSchema()->columnCount() > activeNumOfSearchKeys) {\n                \/\/ search key is not complete:\n                \/\/ like: SELECT count(*) from T2 WHERE USERNAME ='XIN' AND POINTS < ?\n                \/\/ like: SELECT count(*) from T2 WHERE POINTS < ?\n                \/\/ but it actually finds the previous rank. (If m_searchKey is null, find 0 rank)\n                \/\/ Add 1 back.\n                rkStart++;\n                leftIncluded = 1;\n            }\n        } else {\n            return false;\n        }\n    }\n    if (m_numOfEndkeys != 0) {\n        if (endKeyOverflow) {\n            rkEnd = m_index->getCounterGET(&m_endKey, true);\n        } else {\n            IndexLookupType localEndType = m_endType;\n            if (localEndType == INDEX_LOOKUP_TYPE_LT) {\n                rkEnd = m_index->getCounterGET(&m_endKey, false);\n            } else if (localEndType == INDEX_LOOKUP_TYPE_LTE) {\n                if (m_index->hasKey(&m_endKey)) {\n                    rkEnd = m_index->getCounterGET(&m_endKey, true);\n                    rightIncluded = 1;\n                } else\n                    rkEnd = m_index->getCounterGET(&m_endKey, false);\n            } else {\n                return false;\n            }\n        }\n    } else {\n        rkEnd = m_index->getSize();\n        rightIncluded = 1;\n    }\n    rkRes = rkEnd - rkStart - 1 + leftIncluded + rightIncluded;\n    VOLT_DEBUG(\"Index Count ANSWER %ld = %ld - %ld - 1 + %d + %d\\n\", (long)rkRes, (long)rkEnd, (long)rkStart, leftIncluded, rightIncluded);\n    tmptup.setNValue(0, ValueFactory::getBigIntValue( rkRes ));\n    m_outputTable->insertTuple(tmptup);\n\n    VOLT_DEBUG (\"Index Count :\\n %s\", m_outputTable->debug().c_str());\n    return true;\n}\n\nIndexCountExecutor::~IndexCountExecutor() {\n    delete [] m_searchKeyBackingStore;\n    if (m_numOfEndkeys != 0)\n        delete [] m_endKeyBackingStore;\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 2015 Cloudius Systems\n *\n * Modified by Cloudius Systems\n *\/\n\n#ifndef CQL3_LISTS_HH\n#define CQL3_LISTS_HH\n\n#include \"cql3\/abstract_marker.hh\"\n#include \"to_string.hh\"\n#include \"utils\/UUID_gen.hh\"\n#include \"operation.hh\"\n\nnamespace cql3 {\n\n#if 0\npackage org.apache.cassandra.cql3;\n\nimport java.nio.ByteBuffer;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.concurrent.atomic.AtomicReference;\n\nimport org.apache.cassandra.config.ColumnDefinition;\nimport org.apache.cassandra.db.Cell;\nimport org.apache.cassandra.db.ColumnFamily;\nimport org.apache.cassandra.db.composites.CellName;\nimport org.apache.cassandra.db.composites.Composite;\nimport org.apache.cassandra.db.marshal.Int32Type;\nimport org.apache.cassandra.db.marshal.ListType;\nimport org.apache.cassandra.exceptions.InvalidRequestException;\nimport org.apache.cassandra.serializers.CollectionSerializer;\nimport org.apache.cassandra.serializers.MarshalException;\nimport org.apache.cassandra.transport.Server;\nimport org.apache.cassandra.utils.ByteBufferUtil;\nimport org.apache.cassandra.utils.FBUtilities;\nimport org.apache.cassandra.utils.UUIDGen;\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\n#endif\n\n\/**\n * Static helper methods and classes for lists.\n *\/\nclass lists {\n    lists() = delete;\npublic:\n    static shared_ptr<column_specification> index_spec_of(shared_ptr<column_specification> column);\n    static shared_ptr<column_specification> value_spec_of(shared_ptr<column_specification> column);\n\n    class literal : public term::raw {\n        const std::vector<shared_ptr<term::raw>> _elements;\n    public:\n        explicit literal(std::vector<shared_ptr<term::raw>> elements)\n            : _elements(std::move(elements)) {\n        }\n        shared_ptr<term> prepare(database& db, const sstring& keyspace, shared_ptr<column_specification> receiver);\n    private:\n        void validate_assignable_to(database& db, const sstring keyspace, shared_ptr<column_specification> receiver);\n    public:\n        virtual assignment_testable::test_result test_assignment(database& db, const sstring& keyspace, shared_ptr<column_specification> receiver) override;\n        virtual sstring to_string() const override;\n    };\n\n    class value : public multi_item_terminal, collection_terminal {\n        std::vector<bytes_opt> _elements;\n    public:\n        explicit value(std::vector<bytes_opt> elements)\n            : _elements(std::move(elements)) {\n        }\n        static value from_serialized(bytes_view v, shared_ptr<list_type_impl> type, serialization_format sf);\n        virtual bytes_opt get(const query_options& options) override;\n        virtual bytes get_with_protocol_version(serialization_format sf) override;\n        bool equals(shared_ptr<list_type_impl> lt, const value& v);\n        virtual std::vector<bytes_opt> get_elements() override;\n        virtual sstring to_string() const;\n        friend class lists;\n    };\n    \/**\n     * Basically similar to a Value, but with some non-pure function (that need\n     * to be evaluated at execution time) in it.\n     *\n     * Note: this would also work for a list with bind markers, but we don't support\n     * that because 1) it's not excessively useful and 2) we wouldn't have a good\n     * column name to return in the ColumnSpecification for those markers (not a\n     * blocker per-se but we don't bother due to 1)).\n     *\/\n    class delayed_value : public non_terminal {\n        std::vector<shared_ptr<term>> _elements;\n    public:\n        explicit delayed_value(std::vector<shared_ptr<term>> elements)\n                : _elements(std::move(elements)) {\n        }\n        virtual bool contains_bind_marker() const override;\n        virtual void collect_marker_specification(shared_ptr<variable_specifications> bound_names);\n        virtual shared_ptr<terminal> bind(const query_options& options) override;\n    };\n\n    \/**\n     * A marker for List values and IN relations\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#if 0\n        protected Marker(int bindIndex, ColumnSpecification receiver)\n        {\n            super(bindIndex, receiver);\n            assert receiver.type instanceof ListType;\n        }\n#endif\n        virtual ::shared_ptr<terminal> bind(const query_options& options) override;\n#if 0\n        public Value bind(QueryOptions options) throws InvalidRequestException\n        {\n            ByteBuffer value = options.getValues().get(bindIndex);\n            return value == null ? null : Value.fromSerialized(value, (ListType)receiver.type, options.getProtocolVersion());\n        }\n#endif\n    };\n#if 0\n    \/*\n     * For prepend, we need to be able to generate unique but decreasing time\n     * UUID, which is a bit challenging. To do that, given a time in milliseconds,\n     * we adds a number representing the 100-nanoseconds precision and make sure\n     * that within the same millisecond, that number is always decreasing. We\n     * do rely on the fact that the user will only provide decreasing\n     * milliseconds timestamp for that purpose.\n     *\/\n    private static class PrecisionTime\n    {\n        \/\/ Our reference time (1 jan 2010, 00:00:00) in milliseconds.\n        private static final long REFERENCE_TIME = 1262304000000L;\n        private static final AtomicReference<PrecisionTime> last = new AtomicReference<PrecisionTime>(new PrecisionTime(Long.MAX_VALUE, 0));\n\n        public final long millis;\n        public final int nanos;\n\n        PrecisionTime(long millis, int nanos)\n        {\n            this.millis = millis;\n            this.nanos = nanos;\n        }\n\n        static PrecisionTime getNext(long millis)\n        {\n            while (true)\n            {\n                PrecisionTime current = last.get();\n\n                assert millis <= current.millis;\n                PrecisionTime next = millis < current.millis\n                    ? new PrecisionTime(millis, 9999)\n                    : new PrecisionTime(millis, Math.max(0, current.nanos - 1));\n\n                if (last.compareAndSet(current, next))\n                    return next;\n            }\n        }\n    }\n#endif\n\n    class setter : public operation {\n    public:\n        setter(const column_definition& column, shared_ptr<term> t)\n                : operation(column, std::move(t)) {\n        }\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n    };\n\n    class setter_by_index : public operation {\n        shared_ptr<term> _idx;\n    public:\n        setter_by_index(const column_definition& column, shared_ptr<term> idx, shared_ptr<term> t)\n            : operation(column, std::move(t)), _idx(std::move(idx)) {\n        }\n        virtual bool requires_read() override;\n        virtual void collect_marker_specification(shared_ptr<variable_specifications> bound_names);\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n    };\n\n    class appender : public operation {\n    public:\n        using operation::operation;\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n    };\n\n    static void do_append(shared_ptr<term> t,\n            mutation& m,\n            const exploded_clustering_prefix& prefix,\n            const column_definition& column,\n            const update_parameters& params,\n            tombstone ts = {});\n\n#if 0\n    public static class Prepender extends Operation\n    {\n        public Prepender(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            assert column.type.isMultiCell() : \"Attempted to prepend to a frozen list\";\n            Term.Terminal value = t.bind(params.options);\n            if (value == null)\n                return;\n\n            assert value instanceof Lists.Value;\n            long time = PrecisionTime.REFERENCE_TIME - (System.currentTimeMillis() - PrecisionTime.REFERENCE_TIME);\n\n            List<ByteBuffer> toAdd = ((Lists.Value)value).elements;\n            for (int i = 0; i < toAdd.size(); i++)\n            {\n                PrecisionTime pt = PrecisionTime.getNext(time);\n                ByteBuffer uuid = ByteBuffer.wrap(UUIDGen.getTimeUUIDBytes(pt.millis, pt.nanos));\n                cf.addColumn(params.makeColumn(cf.getComparator().create(prefix, column, uuid), toAdd.get(i)));\n            }\n        }\n    }\n#endif\n\n    class discarder : public operation {\n    public:\n        discarder(const column_definition& column, shared_ptr<term> t)\n                : operation(column, std::move(t)) {\n        }\n        virtual bool requires_read() override;\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n    };\n\n    class discarder_by_index : public operation {\n    public:\n        discarder_by_index(const column_definition& column, shared_ptr<term> idx)\n                : operation(column, std::move(idx)) {\n        }\n        virtual bool requires_read() override;\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params);\n    };\n};\n\n}\n\n#endif\n<commit_msg>cql3: remove gunk from lists.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_LISTS_HH\n#define CQL3_LISTS_HH\n\n#include \"cql3\/abstract_marker.hh\"\n#include \"to_string.hh\"\n#include \"utils\/UUID_gen.hh\"\n#include \"operation.hh\"\n\nnamespace cql3 {\n\n\/**\n * Static helper methods and classes for lists.\n *\/\nclass lists {\n    lists() = delete;\npublic:\n    static shared_ptr<column_specification> index_spec_of(shared_ptr<column_specification> column);\n    static shared_ptr<column_specification> value_spec_of(shared_ptr<column_specification> column);\n\n    class literal : public term::raw {\n        const std::vector<shared_ptr<term::raw>> _elements;\n    public:\n        explicit literal(std::vector<shared_ptr<term::raw>> elements)\n            : _elements(std::move(elements)) {\n        }\n        shared_ptr<term> prepare(database& db, const sstring& keyspace, shared_ptr<column_specification> receiver);\n    private:\n        void validate_assignable_to(database& db, const sstring keyspace, shared_ptr<column_specification> receiver);\n    public:\n        virtual assignment_testable::test_result test_assignment(database& db, const sstring& keyspace, shared_ptr<column_specification> receiver) override;\n        virtual sstring to_string() const override;\n    };\n\n    class value : public multi_item_terminal, collection_terminal {\n        std::vector<bytes_opt> _elements;\n    public:\n        explicit value(std::vector<bytes_opt> elements)\n            : _elements(std::move(elements)) {\n        }\n        static value from_serialized(bytes_view v, shared_ptr<list_type_impl> type, serialization_format sf);\n        virtual bytes_opt get(const query_options& options) override;\n        virtual bytes get_with_protocol_version(serialization_format sf) override;\n        bool equals(shared_ptr<list_type_impl> lt, const value& v);\n        virtual std::vector<bytes_opt> get_elements() override;\n        virtual sstring to_string() const;\n        friend class lists;\n    };\n    \/**\n     * Basically similar to a Value, but with some non-pure function (that need\n     * to be evaluated at execution time) in it.\n     *\n     * Note: this would also work for a list with bind markers, but we don't support\n     * that because 1) it's not excessively useful and 2) we wouldn't have a good\n     * column name to return in the ColumnSpecification for those markers (not a\n     * blocker per-se but we don't bother due to 1)).\n     *\/\n    class delayed_value : public non_terminal {\n        std::vector<shared_ptr<term>> _elements;\n    public:\n        explicit delayed_value(std::vector<shared_ptr<term>> elements)\n                : _elements(std::move(elements)) {\n        }\n        virtual bool contains_bind_marker() const override;\n        virtual void collect_marker_specification(shared_ptr<variable_specifications> bound_names);\n        virtual shared_ptr<terminal> bind(const query_options& options) override;\n    };\n\n    \/**\n     * A marker for List values and IN relations\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#if 0\n        protected Marker(int bindIndex, ColumnSpecification receiver)\n        {\n            super(bindIndex, receiver);\n            assert receiver.type instanceof ListType;\n        }\n#endif\n        virtual ::shared_ptr<terminal> bind(const query_options& options) override;\n#if 0\n        public Value bind(QueryOptions options) throws InvalidRequestException\n        {\n            ByteBuffer value = options.getValues().get(bindIndex);\n            return value == null ? null : Value.fromSerialized(value, (ListType)receiver.type, options.getProtocolVersion());\n        }\n#endif\n    };\n#if 0\n    \/*\n     * For prepend, we need to be able to generate unique but decreasing time\n     * UUID, which is a bit challenging. To do that, given a time in milliseconds,\n     * we adds a number representing the 100-nanoseconds precision and make sure\n     * that within the same millisecond, that number is always decreasing. We\n     * do rely on the fact that the user will only provide decreasing\n     * milliseconds timestamp for that purpose.\n     *\/\n    private static class PrecisionTime\n    {\n        \/\/ Our reference time (1 jan 2010, 00:00:00) in milliseconds.\n        private static final long REFERENCE_TIME = 1262304000000L;\n        private static final AtomicReference<PrecisionTime> last = new AtomicReference<PrecisionTime>(new PrecisionTime(Long.MAX_VALUE, 0));\n\n        public final long millis;\n        public final int nanos;\n\n        PrecisionTime(long millis, int nanos)\n        {\n            this.millis = millis;\n            this.nanos = nanos;\n        }\n\n        static PrecisionTime getNext(long millis)\n        {\n            while (true)\n            {\n                PrecisionTime current = last.get();\n\n                assert millis <= current.millis;\n                PrecisionTime next = millis < current.millis\n                    ? new PrecisionTime(millis, 9999)\n                    : new PrecisionTime(millis, Math.max(0, current.nanos - 1));\n\n                if (last.compareAndSet(current, next))\n                    return next;\n            }\n        }\n    }\n#endif\n\n    class setter : public operation {\n    public:\n        setter(const column_definition& column, shared_ptr<term> t)\n                : operation(column, std::move(t)) {\n        }\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n    };\n\n    class setter_by_index : public operation {\n        shared_ptr<term> _idx;\n    public:\n        setter_by_index(const column_definition& column, shared_ptr<term> idx, shared_ptr<term> t)\n            : operation(column, std::move(t)), _idx(std::move(idx)) {\n        }\n        virtual bool requires_read() override;\n        virtual void collect_marker_specification(shared_ptr<variable_specifications> bound_names);\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n    };\n\n    class appender : public operation {\n    public:\n        using operation::operation;\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n    };\n\n    static void do_append(shared_ptr<term> t,\n            mutation& m,\n            const exploded_clustering_prefix& prefix,\n            const column_definition& column,\n            const update_parameters& params,\n            tombstone ts = {});\n\n#if 0\n    public static class Prepender extends Operation\n    {\n        public Prepender(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            assert column.type.isMultiCell() : \"Attempted to prepend to a frozen list\";\n            Term.Terminal value = t.bind(params.options);\n            if (value == null)\n                return;\n\n            assert value instanceof Lists.Value;\n            long time = PrecisionTime.REFERENCE_TIME - (System.currentTimeMillis() - PrecisionTime.REFERENCE_TIME);\n\n            List<ByteBuffer> toAdd = ((Lists.Value)value).elements;\n            for (int i = 0; i < toAdd.size(); i++)\n            {\n                PrecisionTime pt = PrecisionTime.getNext(time);\n                ByteBuffer uuid = ByteBuffer.wrap(UUIDGen.getTimeUUIDBytes(pt.millis, pt.nanos));\n                cf.addColumn(params.makeColumn(cf.getComparator().create(prefix, column, uuid), toAdd.get(i)));\n            }\n        }\n    }\n#endif\n\n    class discarder : public operation {\n    public:\n        discarder(const column_definition& column, shared_ptr<term> t)\n                : operation(column, std::move(t)) {\n        }\n        virtual bool requires_read() override;\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n    };\n\n    class discarder_by_index : public operation {\n    public:\n        discarder_by_index(const column_definition& column, shared_ptr<term> idx)\n                : operation(column, std::move(idx)) {\n        }\n        virtual bool requires_read() override;\n        virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params);\n    };\n};\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2012.  All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Containers_Bag_inl_\n#define _Stroika_Foundation_Containers_Bag_inl_\n\n#include    \"..\/Debug\/Assertions.h\"\n\n#include    \"Concrete\/Bag_Array.h\"  \/\/ needed for default constructor\n\n\n\nnamespace   Stroika {\n    namespace   Foundation {\n        namespace   Containers {\n\n            \/\/ class Bag<T>\n            template    <typename T>\n            inline  Bag<T>::Bag (const Bag<T>& bag)\n                : Iterable<T> (bag)\n            {\n            }\n            template    <typename T>\n            inline  Bag<T>::Bag (typename Bag<T>::_IRep* rep)\n                : Iterable<T> (Memory::SharedByValue<Iterable<T>::_IRep> (rep))\n            {\n                RequireNotNull (rep);\n            }\n            template    <typename T>\n            Bag<T>::Bag ()\n                : Iterable<T> (Concrete::Bag_Array<T> ())\n            {\n            }\n            template    <typename T>\n            Bag<T>::Bag (const T* start, const T* end)\n                : Iterable<T> (Concrete::Bag_Array<T> (start, end))\n            {\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator= (const Bag<T>& rhs)\n            {\n                (void)::Iterable<T>::operator= (rhs);\n                return (*this);\n            }\n            template    <typename T>\n            inline  bool    Bag<T>::Contains (T item) const\n            {\n                return (_GetRep ().Contains (item));\n            }\n            template    <typename T>\n            inline  void    Bag<T>::RemoveAll ()\n            {\n                _GetRep ().RemoveAll ();\n            }\n            template    <typename T>\n            inline  void    Bag<T>::Compact ()\n            {\n                _GetRep ().Compact ();\n            }\n            template    <typename T>\n            inline  Iterator<T> Bag<T>::MakeIterator () const\n            {\n                Iterator<T> it (const_cast<Bag<T> *> (this)->_GetRep ().MakeIterator ());\n                ++it;\n                return it;\n            }\n            template    <typename T>\n            inline  Iterator<T>    Bag<T>::begin () const\n            {\n                return MakeIterator ();\n            }\n            template    <typename T>\n            inline  Iterator<T>    Bag<T>::end () const\n            {\n                return (Iterator<T>::GetSentinal ());\n            }\n            template    <typename T>\n            inline  typename Bag<T>::Mutator    Bag<T>::begin ()\n            {\n                return MakeMutator ();\n            }\n            template    <typename T>\n            inline  typename Bag<T>::Mutator    Bag<T>::end ()\n            {\n                return (Bag<T>::Mutator (nullptr));\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator+= (T item)\n            {\n                Add (item);\n                return (*this);\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator+= (const Bag<T>& items)\n            {\n                Add (items);\n                return (*this);\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator-= (T item)\n            {\n                Remove (item);\n                return (*this);\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator-= (const Bag<T>& items)\n            {\n                Remove (items);\n                return (*this);\n            }\n            template    <typename T>\n            inline   typename   Bag<T>::Mutator  Bag<T>::MakeMutator ()\n            {\n                Bag<T>::Mutator it = Bag<T>::Mutator (_GetRep ().MakeBagMutator ());\n                ++it;\n                return it;\n            }\n            template    <typename T>\n            inline  void    Bag<T>::Add (T item)\n            {\n                _GetRep ().Add (item);\n                Ensure (not IsEmpty ());\n            }\n            template    <typename T>\n            void  Bag<T>::Add (const Bag<T>& items)\n            {\n                if (this == &items) {\n                    \/\/ Copy - so we don't update this while we are copying from it...\n                    Bag<T>  copiedItems =   items;\n                    For (it, copiedItems) {\n                        _GetRep ().Add (it.Current ());\n                    }\n                }\n                else {\n                    For (it, items) {\n                        _GetRep ().Add (it.Current ());\n                    }\n                }\n            }\n            template    <typename T>\n            void  Bag<T>::Add (const T* begin, const T* end)\n            {\n                for (const T* i = begin; i != end; i++) {\n                    Add (*i);\n                }\n            }\n            template    <typename T>\n            inline  void  Bag<T>::Remove (T item)\n            {\n                _GetRep ().Remove (item);\n            }\n            template    <typename T>\n            void  Bag<T>::Remove (const Bag<T>& items)\n            {\n                if (&_GetRep () == &items._GetRep ()) {\n                    RemoveAll ();\n                }\n                else {\n                    For (it, items) {\n                        _GetRep ().Remove (it.Current ());\n                    }\n                }\n            }\n            template    <typename T>\n            size_t    Bag<T>::TallyOf (T item) const\n            {\n                size_t count = 0;\n                For (it, (*this)) {\n                    if (it.Current () == item) {\n                        count++;\n                    }\n                }\n                return (count);\n            }\n\n\n\n\n\n            \/*\n             ********************************************************************************\n             ************************************ operators *********************************\n             ********************************************************************************\n             *\/\n            template    <typename T>\n            bool  operator== (const Bag<T>& lhs, const Bag<T>& rhs)\n            {\n                if (&lhs._GetRep () == &rhs._GetRep ()) {\n                    return (true);\n                }\n                if (lhs.GetLength () != rhs.GetLength ()) {\n                    return (false);\n                }\n\n                \/\/ n^2 algorithm!!!\n                For (it, lhs) {\n                    if (lhs.TallyOf (it.Current ()) != rhs.TallyOf (it.Current ())) {\n                        return (false);\n                    }\n                }\n                return (true);\n            }\n            template    <typename T>\n            Bag<T>    operator+ (const Bag<T>& lhs, const Bag<T>& rhs)\n            {\n                Bag<T>  temp    = lhs;\n                temp += rhs;\n                return (temp);\n            }\n            template    <typename T>\n            Bag<T>    operator- (const Bag<T>& lhs, const Bag<T>& rhs)\n            {\n                Bag<T>  temp    = lhs;\n                temp -= rhs;\n                return (temp);\n            }\n            template    <typename T>\n            inline  bool    operator!= (const Bag<T>& lhs, const Bag<T>& rhs)\n            {\n                return (not operator== (lhs, rhs));\n            }\n\n\n\n            \/\/ class Bag<T>::_IMutatorRep<T>\n            template    <typename T>\n            inline  Bag<T>::_IMutatorRep::_IMutatorRep () :\n                Iterator<T>::Rep ()\n            {\n            }\n\n\n            \/\/ class Bag<T>::Mutator\n            template    <typename T>\n            inline  Bag<T>::Mutator::Mutator (typename Bag<T>::_IMutatorRep* it) :\n                Iterator<T> (it)\n            {\n            }\n            template    <typename T>\n            inline  typename    Bag<T>::_IMutatorRep* Bag<T>::Mutator::GetMutatorRep_ ()\n            {\n                \/*\n                 * Because of the way we construct Mutators, it is guaranteed that\n                 * this cast is safe. We could have kept an extra var of the right\n                 * static type, but this would have been a waste of time and memory.\n                 *\/\n                return &(dynamic_cast<_IMutatorRep&> (*this->fIterator));\n            }\n            template    <typename T>\n            inline  void    Bag<T>::Mutator::RemoveCurrent ()\n            {\n                GetMutatorRep_ ()->RemoveCurrent ();\n            }\n            template    <typename T>\n            inline  void    Bag<T>::Mutator::UpdateCurrent (T newValue)\n            {\n                GetMutatorRep_ ()->UpdateCurrent (newValue);\n            }\n\n\n\n\n\n            \/\/ class _IRep<T>\n            template    <typename T>\n            inline  Bag<T>::_IRep::_IRep ()\n            {\n            }\n            template    <typename T>\n            inline  Bag<T>::_IRep::~_IRep ()\n            {\n            }\n            template    <typename T>\n            inline  const typename  Bag<T>::_IRep&    Bag<T>::_GetRep () const\n            {\n                \/\/ Unsure - MAY need to use dynamic_cast here - but I think static cast performs better, so try...\n                EnsureNotNull (dynamic_cast<const Bag<T>::_IRep*> (&Iterable<T>::_GetRep ()));\n                return *static_cast<const Bag<T>::_IRep*> (&Iterable<T>::_GetRep ());\n            }\n            template    <typename T>\n            inline  typename    Bag<T>::_IRep&  Bag<T>::_GetRep ()\n            {\n                \/\/ Unsure - MAY need to use dynamic_cast here - but I think static cast performs better, so try...\n                EnsureNotNull (dynamic_cast<Bag<T>::_IRep*> (&Iterable<T>::_GetRep ()));\n                return *static_cast<Bag<T>::_IRep*> (&Iterable<T>::_GetRep ());\n            }\n\n\n        }\n    }\n}\n\n#endif \/* _Stroika_Foundation_Containers_Bag_inl_ *\/\n<commit_msg>small fixes to Bag<T> \/ Interable<T> integration caught by gcc<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2012.  All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Containers_Bag_inl_\n#define _Stroika_Foundation_Containers_Bag_inl_\n\n#include    \"..\/Debug\/Assertions.h\"\n\n#include    \"Concrete\/Bag_Array.h\"  \/\/ needed for default constructor\n\n\n\nnamespace   Stroika {\n    namespace   Foundation {\n        namespace   Containers {\n\n            \/\/ class Bag<T>\n            template    <typename T>\n            inline  Bag<T>::Bag (const Bag<T>& bag)\n                : Iterable<T> (bag)\n            {\n            }\n            template    <typename T>\n            inline  Bag<T>::Bag (typename Bag<T>::_IRep* rep)\n                : Iterable<T> (_SharedByValueRepType (rep))\n            {\n                RequireNotNull (rep);\n            }\n            template    <typename T>\n            Bag<T>::Bag ()\n                : Iterable<T> (Concrete::Bag_Array<T> ())\n            {\n            }\n            template    <typename T>\n            Bag<T>::Bag (const T* start, const T* end)\n                : Iterable<T> (Concrete::Bag_Array<T> (start, end))\n            {\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator= (const Bag<T>& rhs)\n            {\n                (void)Iterable<T>::operator= (rhs);\n                return (*this);\n            }\n            template    <typename T>\n            inline  bool    Bag<T>::Contains (T item) const\n            {\n                return (_GetRep ().Contains (item));\n            }\n            template    <typename T>\n            inline  void    Bag<T>::RemoveAll ()\n            {\n                _GetRep ().RemoveAll ();\n            }\n            template    <typename T>\n            inline  void    Bag<T>::Compact ()\n            {\n                _GetRep ().Compact ();\n            }\n            template    <typename T>\n            inline  Iterator<T> Bag<T>::MakeIterator () const\n            {\n                Iterator<T> it (const_cast<Bag<T> *> (this)->_GetRep ().MakeIterator ());\n                ++it;\n                return it;\n            }\n            template    <typename T>\n            inline  Iterator<T>    Bag<T>::begin () const\n            {\n                return MakeIterator ();\n            }\n            template    <typename T>\n            inline  Iterator<T>    Bag<T>::end () const\n            {\n                return (Iterator<T>::GetSentinal ());\n            }\n            template    <typename T>\n            inline  typename Bag<T>::Mutator    Bag<T>::begin ()\n            {\n                return MakeMutator ();\n            }\n            template    <typename T>\n            inline  typename Bag<T>::Mutator    Bag<T>::end ()\n            {\n                return (Bag<T>::Mutator (nullptr));\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator+= (T item)\n            {\n                Add (item);\n                return (*this);\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator+= (const Bag<T>& items)\n            {\n                Add (items);\n                return (*this);\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator-= (T item)\n            {\n                Remove (item);\n                return (*this);\n            }\n            template    <typename T>\n            inline  Bag<T>& Bag<T>::operator-= (const Bag<T>& items)\n            {\n                Remove (items);\n                return (*this);\n            }\n            template    <typename T>\n            inline   typename   Bag<T>::Mutator  Bag<T>::MakeMutator ()\n            {\n                Bag<T>::Mutator it = Bag<T>::Mutator (_GetRep ().MakeBagMutator ());\n                ++it;\n                return it;\n            }\n            template    <typename T>\n            inline  void    Bag<T>::Add (T item)\n            {\n                _GetRep ().Add (item);\n                Ensure (not this->IsEmpty ());\n            }\n            template    <typename T>\n            void  Bag<T>::Add (const Bag<T>& items)\n            {\n                if (this == &items) {\n                    \/\/ Copy - so we don't update this while we are copying from it...\n                    Bag<T>  copiedItems =   items;\n                    For (it, copiedItems) {\n                        _GetRep ().Add (it.Current ());\n                    }\n                }\n                else {\n                    For (it, items) {\n                        _GetRep ().Add (it.Current ());\n                    }\n                }\n            }\n            template    <typename T>\n            void  Bag<T>::Add (const T* begin, const T* end)\n            {\n                for (const T* i = begin; i != end; i++) {\n                    Add (*i);\n                }\n            }\n            template    <typename T>\n            inline  void  Bag<T>::Remove (T item)\n            {\n                _GetRep ().Remove (item);\n            }\n            template    <typename T>\n            void  Bag<T>::Remove (const Bag<T>& items)\n            {\n                if (&_GetRep () == &items._GetRep ()) {\n                    RemoveAll ();\n                }\n                else {\n                    For (it, items) {\n                        _GetRep ().Remove (it.Current ());\n                    }\n                }\n            }\n            template    <typename T>\n            size_t    Bag<T>::TallyOf (T item) const\n            {\n                size_t count = 0;\n                For (it, (*this)) {\n                    if (it.Current () == item) {\n                        count++;\n                    }\n                }\n                return (count);\n            }\n\n\n\n\n\n            \/*\n             ********************************************************************************\n             ************************************ operators *********************************\n             ********************************************************************************\n             *\/\n            template    <typename T>\n            bool  operator== (const Bag<T>& lhs, const Bag<T>& rhs)\n            {\n                if (&lhs._GetRep () == &rhs._GetRep ()) {\n                    return (true);\n                }\n                if (lhs.GetLength () != rhs.GetLength ()) {\n                    return (false);\n                }\n\n                \/\/ n^2 algorithm!!!\n                For (it, lhs) {\n                    if (lhs.TallyOf (it.Current ()) != rhs.TallyOf (it.Current ())) {\n                        return (false);\n                    }\n                }\n                return (true);\n            }\n            template    <typename T>\n            Bag<T>    operator+ (const Bag<T>& lhs, const Bag<T>& rhs)\n            {\n                Bag<T>  temp    = lhs;\n                temp += rhs;\n                return (temp);\n            }\n            template    <typename T>\n            Bag<T>    operator- (const Bag<T>& lhs, const Bag<T>& rhs)\n            {\n                Bag<T>  temp    = lhs;\n                temp -= rhs;\n                return (temp);\n            }\n            template    <typename T>\n            inline  bool    operator!= (const Bag<T>& lhs, const Bag<T>& rhs)\n            {\n                return (not operator== (lhs, rhs));\n            }\n\n\n\n            \/\/ class Bag<T>::_IMutatorRep<T>\n            template    <typename T>\n            inline  Bag<T>::_IMutatorRep::_IMutatorRep () :\n                Iterator<T>::Rep ()\n            {\n            }\n\n\n            \/\/ class Bag<T>::Mutator\n            template    <typename T>\n            inline  Bag<T>::Mutator::Mutator (typename Bag<T>::_IMutatorRep* it) :\n                Iterator<T> (it)\n            {\n            }\n            template    <typename T>\n            inline  typename    Bag<T>::_IMutatorRep* Bag<T>::Mutator::GetMutatorRep_ ()\n            {\n                \/*\n                 * Because of the way we construct Mutators, it is guaranteed that\n                 * this cast is safe. We could have kept an extra var of the right\n                 * static type, but this would have been a waste of time and memory.\n                 *\/\n                return &(dynamic_cast<_IMutatorRep&> (*this->fIterator));\n            }\n            template    <typename T>\n            inline  void    Bag<T>::Mutator::RemoveCurrent ()\n            {\n                GetMutatorRep_ ()->RemoveCurrent ();\n            }\n            template    <typename T>\n            inline  void    Bag<T>::Mutator::UpdateCurrent (T newValue)\n            {\n                GetMutatorRep_ ()->UpdateCurrent (newValue);\n            }\n\n\n\n\n\n            \/\/ class _IRep<T>\n            template    <typename T>\n            inline  Bag<T>::_IRep::_IRep ()\n            {\n            }\n            template    <typename T>\n            inline  Bag<T>::_IRep::~_IRep ()\n            {\n            }\n            template    <typename T>\n            inline  const typename  Bag<T>::_IRep&    Bag<T>::_GetRep () const\n            {\n                \/\/ Unsure - MAY need to use dynamic_cast here - but I think static cast performs better, so try...\n                EnsureNotNull (dynamic_cast<const Bag<T>::_IRep*> (&Iterable<T>::_GetRep ()));\n                return *static_cast<const Bag<T>::_IRep*> (&Iterable<T>::_GetRep ());\n            }\n            template    <typename T>\n            inline  typename    Bag<T>::_IRep&  Bag<T>::_GetRep ()\n            {\n                \/\/ Unsure - MAY need to use dynamic_cast here - but I think static cast performs better, so try...\n                EnsureNotNull (dynamic_cast<Bag<T>::_IRep*> (&Iterable<T>::_GetRep ()));\n                return *static_cast<Bag<T>::_IRep*> (&Iterable<T>::_GetRep ());\n            }\n\n\n        }\n    }\n}\n\n#endif \/* _Stroika_Foundation_Containers_Bag_inl_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2013.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#if     qPlatform_POSIX\n#include    <string>\n#include    <unistd.h>\n#include    <sys\/ptrace.h>\n#include    <signal.h>\n#include    <cstdio>\n#elif   qPlatform_Windows\n#include    <Windows.h>\n#endif\n#include    \"..\/Math\/Common.h\"\n\n#include    \"Debugger.h\"\n\nusing   namespace   Stroika::Foundation;\n\nvoid    Debug::DropIntoDebuggerIfPresent ()\n{\n#if     qPlatform_Windows\n    if (::IsDebuggerPresent ()) {\n        ::DebugBreak ();\n    }\n#elif   qPlatform_POSIX\n#if     0\n    \/\/ not sure this is right, but its close...\n    if (ptrace (PTRACE_TRACEME, 0, NULL, 0) == -1) {\n        raise (SIGTRAP);\n    }\n#elif   1\n    \/\/ BAD, but least bad, way I know...\n    char pathBuf[1024];\n    sprintf(pathBuf, \"\/proc\/%d\/exe\", ::getppid ());\n    char dataBuf[1024];\n    ssize_t n   =   :: readlink (pathBuf, dataBuf, sizeof (dataBuf) - 1);\n    n = Math::PinInRange<size_t> (0, sizeof (dataBuf) - 1, static_cast<size_t> (n));\n    dataBuf[n] = '\\0';\n    if (string (dataBuf).find (\"gdb\") != -1) {\n        ::raise (SIGTRAP);\n    }\n#else\n    \/\/ NYI\n#endif\n#else\n    \/\/ not sure (yet) how to tell if being debugged...\n    \/\/abort ();\n#endif\n}\n<commit_msg>fixed regression in clean toDebug::DropIntoDebuggerIfPresent () - use of PinInRnage()<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2013.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#if     qPlatform_POSIX\n#include    <string>\n#include    <unistd.h>\n#include    <sys\/ptrace.h>\n#include    <signal.h>\n#include    <cstdio>\n#elif   qPlatform_Windows\n#include    <Windows.h>\n#endif\n#include    \"..\/Math\/Common.h\"\n\n#include    \"Debugger.h\"\n\nusing   namespace   Stroika::Foundation;\n\nvoid    Debug::DropIntoDebuggerIfPresent ()\n{\n#if     qPlatform_Windows\n    if (::IsDebuggerPresent ()) {\n        ::DebugBreak ();\n    }\n#elif   qPlatform_POSIX\n#if     0\n    \/\/ not sure this is right, but its close...\n    if (ptrace (PTRACE_TRACEME, 0, NULL, 0) == -1) {\n        raise (SIGTRAP);\n    }\n#elif   1\n    \/\/ BAD, but least bad, way I know...\n    char pathBuf[1024];\n    sprintf(pathBuf, \"\/proc\/%d\/exe\", ::getppid ());\n    char dataBuf[1024];\n    ssize_t n   =   :: readlink (pathBuf, dataBuf, sizeof (dataBuf) - 1);\n    n = Math::PinInRange<size_t> (static_cast<size_t> (n), 0, sizeof (dataBuf) - 1);\n    dataBuf[n] = '\\0';\n    if (string (dataBuf).find (\"gdb\") != -1) {\n        ::raise (SIGTRAP);\n    }\n#else\n    \/\/ NYI\n#endif\n#else\n    \/\/ not sure (yet) how to tell if being debugged...\n    \/\/abort ();\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=============================================================================\n\/\/ ■ global.hpp\n\/\/-----------------------------------------------------------------------------\n\/\/   VMDE通用C++头文件。\n\/\/=============================================================================\n\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n\n#include <ruby.h>\n\n#include <cstdlib>\n#include <cstdio>\n#include <stdexcept>\n#include <string>\n\n#include <ctime>\n\n#ifndef _INCLUDE_ENGINE_H\n#define _INCLUDE_ENGINE_H\n\n#define GAME_NAME \"VM \/ 76\"\n#define DBG_HEAD \"VM DBG [C][VMDrawEngine]\"\n#define RB_F_R VALUE(*)(ANYARGS) \/\/ Ruby Function Return Type\n\n\/\/ PY Deal For MICR0$0FT Windoges ()\n\/\/ Becuase it;s Windoges, I jsut dno't want to use CORERCT ENGRISh &忠闻吔屎炉此\n#ifdef __MINGW32__\n#include <windows.h>\n#define DLLEXPORT __declspec(dllexport)\n#else\n#define DLLEXPORT\n#endif\n\n\/\/ Global\ntypedef struct _VMDE_State_t {\n\tbool freeze;\n} VMDE_State_t;\n\ntypedef struct _VMDE_t {\n\tVMDE_State_t* States;\n\tlong frame_count;\n\tlong millisecond;\n\tint fps;\n} VMDE_t;\n\nextern VMDE_t* VMDE;\nextern GLFWwindow* window;\nextern VALUE Global_module;\nextern VALUE GResPic;\n\n\/\/ ruby_connection.cpp\nVALUE warp_load_pic(VALUE self, VALUE path);\nVALUE wrap_init_engine(VALUE self, VALUE w, VALUE h);\nVALUE warp_main_draw_loop();\nVALUE warp_main_get_frame_count();\nVALUE warp_main_get_fps();\n\n\/\/ init.cpp\nint init_engine(int w, int h);\nvoid init_RClass();\nvoid init_RModule();\n\n\/\/ main.cpp\nvoid glfw_error_callback(int error, const char* description);\nvoid main_draw_loop();\n\n\/\/ resources.cpp\nint load_img(char* p);\n\n#endif\n<commit_msg>日常黑Windows<commit_after>\/\/=============================================================================\n\/\/ ■ global.hpp\n\/\/-----------------------------------------------------------------------------\n\/\/   VMDE通用C++头文件。\n\/\/=============================================================================\n\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n\n#include <ruby.h>\n\n#include <cstdlib>\n#include <cstdio>\n#include <stdexcept>\n#include <string>\n\n#include <ctime>\n\n#ifndef _INCLUDE_ENGINE_H\n#define _INCLUDE_ENGINE_H\n\n#define GAME_NAME \"VM \/ 76\"\n#define DBG_HEAD \"VM DBG [C][VMDrawEngine]\"\n#define RB_F_R VALUE(*)(ANYARGS) \/\/ Ruby Function Return Type\n\n\/\/ PY Deal For ＭICR0$○F┬ Ｗindoges (ᴚ)\n\/\/ Becuase it;s Windoges, I jsut dno't want to use CORERCT ENGRISh &忠闻吔屎炉此\n#ifdef __MINGW32__\n#include <windows.h>\n#define DLLEXPORT __declspec(dllexport)\n#else\n#define DLLEXPORT\n#endif\n\n\/\/ Global\ntypedef struct _VMDE_State_t {\n\tbool freeze;\n} VMDE_State_t;\n\ntypedef struct _VMDE_t {\n\tVMDE_State_t* States;\n\tlong frame_count;\n\tlong millisecond;\n\tint fps;\n} VMDE_t;\n\nextern VMDE_t* VMDE;\nextern GLFWwindow* window;\nextern VALUE Global_module;\nextern VALUE GResPic;\n\n\/\/ ruby_connection.cpp\nVALUE warp_load_pic(VALUE self, VALUE path);\nVALUE wrap_init_engine(VALUE self, VALUE w, VALUE h);\nVALUE warp_main_draw_loop();\nVALUE warp_main_get_frame_count();\nVALUE warp_main_get_fps();\n\n\/\/ init.cpp\nint init_engine(int w, int h);\nvoid init_RClass();\nvoid init_RModule();\n\n\/\/ main.cpp\nvoid glfw_error_callback(int error, const char* description);\nvoid main_draw_loop();\n\n\/\/ resources.cpp\nint load_img(char* p);\n\n#endif\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 \"mitkCESTImageNormalizationFilter.h\"\n\n#include <mitkCustomTagParser.h>\n#include <mitkImage.h>\n#include <mitkImageAccessByItk.h>\n#include <mitkImageCast.h>\n\n#include <boost\/algorithm\/string.hpp>\n\nmitk::CESTImageNormalizationFilter::CESTImageNormalizationFilter()\n{\n}\n\nmitk::CESTImageNormalizationFilter::~CESTImageNormalizationFilter()\n{\n}\n\nvoid mitk::CESTImageNormalizationFilter::GenerateData()\n{\n  mitk::Image::ConstPointer inputImage = this->GetInput(0);\n  if ((inputImage->GetDimension() != 4))\n  {\n    mitkThrow() << \"mitk::CESTImageNormalizationFilter:GenerateData works only with 4D images, sorry.\";\n    return;\n  }\n\n  auto resultMitkImage = this->GetOutput();\n  AccessFixedDimensionByItk(inputImage, NormalizeTimeSteps, 4);\n\n  auto originalTimeGeometry = this->GetInput()->GetTimeGeometry();\n  auto resultTimeGeometry = mitk::ProportionalTimeGeometry::New();\n\n  unsigned int numberOfNonM0s = m_NonM0Indices.size();\n  resultTimeGeometry->Expand(numberOfNonM0s);\n\n  for (unsigned int index = 0; index < numberOfNonM0s; ++index)\n  {\n    resultTimeGeometry->SetTimeStepGeometry(originalTimeGeometry->GetGeometryCloneForTimeStep(m_NonM0Indices.at(index)), index);\n  }\n  resultMitkImage->SetTimeGeometry(resultTimeGeometry);\n\n  resultMitkImage->SetPropertyList(this->GetInput()->GetPropertyList()->Clone());\n  resultMitkImage->GetPropertyList()->SetStringProperty(mitk::CustomTagParser::m_OffsetsPropertyName.c_str(), m_RealOffsets.c_str());\n  \/\/ remove uids\n  resultMitkImage->GetPropertyList()->DeleteProperty(\"DICOM.0008.0018\");\n  resultMitkImage->GetPropertyList()->DeleteProperty(\"DICOM.0020.000D\");\n  resultMitkImage->GetPropertyList()->DeleteProperty(\"DICOM.0020.000E\");\n\n}\n\ntemplate <typename TPixel, unsigned int VImageDimension>\nvoid mitk::CESTImageNormalizationFilter::NormalizeTimeSteps(const itk::Image<TPixel, VImageDimension>* image)\n{\n  typedef itk::Image<TPixel, VImageDimension> ImageType;\n  typedef itk::Image<double, VImageDimension> OutputImageType;\n\n  std::string offsets = \"\";\n  this->GetInput()->GetPropertyList()->GetStringProperty(mitk::CustomTagParser::m_OffsetsPropertyName.c_str(), offsets);\n\n  std::vector<std::string> parts;\n  boost::split(parts, offsets, boost::is_any_of(\" \"));\n\n  \/\/ determine normalization images\n  std::vector<unsigned int> mZeroIndices;\n  std::stringstream offsetsWithoutM0;\n  m_NonM0Indices.clear();\n  for (unsigned int index = 0; index < parts.size(); ++index)\n  {\n    if ((std::stod(parts.at(index)) < -299) || (std::stod(parts.at(index)) > 299))\n    {\n      mZeroIndices.push_back(index);\n    }\n    else\n    {\n      offsetsWithoutM0 << parts.at(index) << \" \";\n      m_NonM0Indices.push_back(index);\n    }\n  }\n\n\n  auto resultImage = OutputImageType::New();\n  typename ImageType::RegionType targetEntireRegion = image->GetLargestPossibleRegion();\n  targetEntireRegion.SetSize(3, m_NonM0Indices.size());\n  resultImage->SetRegions(targetEntireRegion);\n  resultImage->Allocate();\n  resultImage->FillBuffer(0);\n\n  unsigned int numberOfTimesteps = image->GetLargestPossibleRegion().GetSize(3);\n\n  typename ImageType::RegionType lowerMZeroRegion = image->GetLargestPossibleRegion();\n  lowerMZeroRegion.SetSize(3, 1);\n  typename ImageType::RegionType upperMZeroRegion = image->GetLargestPossibleRegion();\n  upperMZeroRegion.SetSize(3, 1);\n  typename ImageType::RegionType sourceRegion = image->GetLargestPossibleRegion();\n  sourceRegion.SetSize(3, 1);\n  typename OutputImageType::RegionType targetRegion = resultImage->GetLargestPossibleRegion();\n  targetRegion.SetSize(3, 1);\n  unsigned int targetTimestep = 0;\n  for (unsigned int sourceTimestep = 0; sourceTimestep < numberOfTimesteps; ++sourceTimestep)\n  {\n    unsigned int lowerMZeroIndex = mZeroIndices[0];\n    unsigned int upperMZeroIndex = mZeroIndices[0];\n    for (unsigned int loop = 0; loop < mZeroIndices.size(); ++loop)\n    {\n      if (mZeroIndices[loop] <= sourceTimestep)\n      {\n        lowerMZeroIndex = mZeroIndices[loop];\n      }\n      if (mZeroIndices[loop] > sourceTimestep)\n      {\n        upperMZeroIndex = mZeroIndices[loop];\n        break;\n      }\n    }\n    bool isMZero = (lowerMZeroIndex == sourceTimestep);\n\n    double weight = 0.0;\n    if (lowerMZeroIndex == upperMZeroIndex)\n    {\n      weight = 1.0;\n    }\n    else\n    {\n      weight = 1.0 - double(sourceTimestep - lowerMZeroIndex) \/ double(upperMZeroIndex - lowerMZeroIndex);\n    }\n\n\n    if (isMZero)\n    {\n      \/\/do nothing\n    }\n    else\n    {\n      lowerMZeroRegion.SetIndex(3, lowerMZeroIndex);\n      upperMZeroRegion.SetIndex(3, upperMZeroIndex);\n      sourceRegion.SetIndex(3, sourceTimestep);\n      targetRegion.SetIndex(3, targetTimestep);\n\n      itk::ImageRegionConstIterator<ImageType> lowerMZeroIterator(image, lowerMZeroRegion);\n      itk::ImageRegionConstIterator<ImageType> upperMZeroIterator(image, upperMZeroRegion);\n      itk::ImageRegionConstIterator<ImageType> sourceIterator(image, sourceRegion);\n      itk::ImageRegionIterator<OutputImageType> targetIterator(resultImage.GetPointer(), targetRegion);\n\n      while (!sourceIterator.IsAtEnd())\n      {\n        double normalizationFactor = weight * lowerMZeroIterator.Get() + (1.0 - weight) * upperMZeroIterator.Get();\n        if (mitk::Equal(normalizationFactor, 0))\n        {\n          targetIterator.Set(0);\n        }\n        else\n        {\n          targetIterator.Set(double(sourceIterator.Get()) \/ normalizationFactor);\n        }\n\n        ++lowerMZeroIterator;\n        ++upperMZeroIterator;\n        ++sourceIterator;\n        ++targetIterator;\n      }\n      ++targetTimestep;\n    }\n  }\n\n  \/\/ get  Pointer to output image\n  mitk::Image::Pointer resultMitkImage = this->GetOutput();\n  \/\/ write into output image\n  mitk::CastToMitkImage<OutputImageType>(resultImage, resultMitkImage);\n\n  m_RealOffsets = offsetsWithoutM0.str();\n}\n\nvoid mitk::CESTImageNormalizationFilter::GenerateOutputInformation()\n{\n  mitk::Image::ConstPointer input = this->GetInput();\n  mitk::Image::Pointer output = this->GetOutput();\n\n  itkDebugMacro(<< \"GenerateOutputInformation()\");\n}\n<commit_msg>Use C locale for normalizing<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 \"mitkCESTImageNormalizationFilter.h\"\n\n#include <mitkCustomTagParser.h>\n#include <mitkImage.h>\n#include <mitkImageAccessByItk.h>\n#include <mitkImageCast.h>\n#include <mitkLocaleSwitch.h>\n\n#include <boost\/algorithm\/string.hpp>\n\nmitk::CESTImageNormalizationFilter::CESTImageNormalizationFilter()\n{\n}\n\nmitk::CESTImageNormalizationFilter::~CESTImageNormalizationFilter()\n{\n}\n\nvoid mitk::CESTImageNormalizationFilter::GenerateData()\n{\n  mitk::Image::ConstPointer inputImage = this->GetInput(0);\n  if ((inputImage->GetDimension() != 4))\n  {\n    mitkThrow() << \"mitk::CESTImageNormalizationFilter:GenerateData works only with 4D images, sorry.\";\n    return;\n  }\n\n  auto resultMitkImage = this->GetOutput();\n  AccessFixedDimensionByItk(inputImage, NormalizeTimeSteps, 4);\n\n  auto originalTimeGeometry = this->GetInput()->GetTimeGeometry();\n  auto resultTimeGeometry = mitk::ProportionalTimeGeometry::New();\n\n  unsigned int numberOfNonM0s = m_NonM0Indices.size();\n  resultTimeGeometry->Expand(numberOfNonM0s);\n\n  for (unsigned int index = 0; index < numberOfNonM0s; ++index)\n  {\n    resultTimeGeometry->SetTimeStepGeometry(originalTimeGeometry->GetGeometryCloneForTimeStep(m_NonM0Indices.at(index)), index);\n  }\n  resultMitkImage->SetTimeGeometry(resultTimeGeometry);\n\n  resultMitkImage->SetPropertyList(this->GetInput()->GetPropertyList()->Clone());\n  resultMitkImage->GetPropertyList()->SetStringProperty(mitk::CustomTagParser::m_OffsetsPropertyName.c_str(), m_RealOffsets.c_str());\n  \/\/ remove uids\n  resultMitkImage->GetPropertyList()->DeleteProperty(\"DICOM.0008.0018\");\n  resultMitkImage->GetPropertyList()->DeleteProperty(\"DICOM.0020.000D\");\n  resultMitkImage->GetPropertyList()->DeleteProperty(\"DICOM.0020.000E\");\n\n}\n\ntemplate <typename TPixel, unsigned int VImageDimension>\nvoid mitk::CESTImageNormalizationFilter::NormalizeTimeSteps(const itk::Image<TPixel, VImageDimension>* image)\n{\n  mitk::LocaleSwitch localeSwitch(\"C\");\n  typedef itk::Image<TPixel, VImageDimension> ImageType;\n  typedef itk::Image<double, VImageDimension> OutputImageType;\n\n  std::string offsets = \"\";\n  this->GetInput()->GetPropertyList()->GetStringProperty(mitk::CustomTagParser::m_OffsetsPropertyName.c_str(), offsets);\n\n  std::vector<std::string> parts;\n  boost::split(parts, offsets, boost::is_any_of(\" \"));\n\n  \/\/ determine normalization images\n  std::vector<unsigned int> mZeroIndices;\n  std::stringstream offsetsWithoutM0;\n  m_NonM0Indices.clear();\n  for (unsigned int index = 0; index < parts.size(); ++index)\n  {\n    if ((std::stod(parts.at(index)) < -299) || (std::stod(parts.at(index)) > 299))\n    {\n      mZeroIndices.push_back(index);\n    }\n    else\n    {\n      offsetsWithoutM0 << parts.at(index) << \" \";\n      m_NonM0Indices.push_back(index);\n    }\n  }\n\n\n  auto resultImage = OutputImageType::New();\n  typename ImageType::RegionType targetEntireRegion = image->GetLargestPossibleRegion();\n  targetEntireRegion.SetSize(3, m_NonM0Indices.size());\n  resultImage->SetRegions(targetEntireRegion);\n  resultImage->Allocate();\n  resultImage->FillBuffer(0);\n\n  unsigned int numberOfTimesteps = image->GetLargestPossibleRegion().GetSize(3);\n\n  typename ImageType::RegionType lowerMZeroRegion = image->GetLargestPossibleRegion();\n  lowerMZeroRegion.SetSize(3, 1);\n  typename ImageType::RegionType upperMZeroRegion = image->GetLargestPossibleRegion();\n  upperMZeroRegion.SetSize(3, 1);\n  typename ImageType::RegionType sourceRegion = image->GetLargestPossibleRegion();\n  sourceRegion.SetSize(3, 1);\n  typename OutputImageType::RegionType targetRegion = resultImage->GetLargestPossibleRegion();\n  targetRegion.SetSize(3, 1);\n  unsigned int targetTimestep = 0;\n  for (unsigned int sourceTimestep = 0; sourceTimestep < numberOfTimesteps; ++sourceTimestep)\n  {\n    unsigned int lowerMZeroIndex = mZeroIndices[0];\n    unsigned int upperMZeroIndex = mZeroIndices[0];\n    for (unsigned int loop = 0; loop < mZeroIndices.size(); ++loop)\n    {\n      if (mZeroIndices[loop] <= sourceTimestep)\n      {\n        lowerMZeroIndex = mZeroIndices[loop];\n      }\n      if (mZeroIndices[loop] > sourceTimestep)\n      {\n        upperMZeroIndex = mZeroIndices[loop];\n        break;\n      }\n    }\n    bool isMZero = (lowerMZeroIndex == sourceTimestep);\n\n    double weight = 0.0;\n    if (lowerMZeroIndex == upperMZeroIndex)\n    {\n      weight = 1.0;\n    }\n    else\n    {\n      weight = 1.0 - double(sourceTimestep - lowerMZeroIndex) \/ double(upperMZeroIndex - lowerMZeroIndex);\n    }\n\n\n    if (isMZero)\n    {\n      \/\/do nothing\n    }\n    else\n    {\n      lowerMZeroRegion.SetIndex(3, lowerMZeroIndex);\n      upperMZeroRegion.SetIndex(3, upperMZeroIndex);\n      sourceRegion.SetIndex(3, sourceTimestep);\n      targetRegion.SetIndex(3, targetTimestep);\n\n      itk::ImageRegionConstIterator<ImageType> lowerMZeroIterator(image, lowerMZeroRegion);\n      itk::ImageRegionConstIterator<ImageType> upperMZeroIterator(image, upperMZeroRegion);\n      itk::ImageRegionConstIterator<ImageType> sourceIterator(image, sourceRegion);\n      itk::ImageRegionIterator<OutputImageType> targetIterator(resultImage.GetPointer(), targetRegion);\n\n      while (!sourceIterator.IsAtEnd())\n      {\n        double normalizationFactor = weight * lowerMZeroIterator.Get() + (1.0 - weight) * upperMZeroIterator.Get();\n        if (mitk::Equal(normalizationFactor, 0))\n        {\n          targetIterator.Set(0);\n        }\n        else\n        {\n          targetIterator.Set(double(sourceIterator.Get()) \/ normalizationFactor);\n        }\n\n        ++lowerMZeroIterator;\n        ++upperMZeroIterator;\n        ++sourceIterator;\n        ++targetIterator;\n      }\n      ++targetTimestep;\n    }\n  }\n\n  \/\/ get  Pointer to output image\n  mitk::Image::Pointer resultMitkImage = this->GetOutput();\n  \/\/ write into output image\n  mitk::CastToMitkImage<OutputImageType>(resultImage, resultMitkImage);\n\n  m_RealOffsets = offsetsWithoutM0.str();\n}\n\nvoid mitk::CESTImageNormalizationFilter::GenerateOutputInformation()\n{\n  mitk::Image::ConstPointer input = this->GetInput();\n  mitk::Image::Pointer output = this->GetOutput();\n\n  itkDebugMacro(<< \"GenerateOutputInformation()\");\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 \"QmitkPythonVariableStackTableModel.h\"\n#include <QMimeData>\n#include <usModuleContext.h>\n#include <mitkDataNode.h>\n#include <usGetModuleContext.h>\n#include <QStringList>\n#include <QMessageBox>\n\nconst QString QmitkPythonVariableStackTableModel::MITK_IMAGE_VAR_NAME = \"mitkImage\";\nconst QString QmitkPythonVariableStackTableModel::MITK_SURFACE_VAR_NAME = \"mitkSurface\";\n\nQmitkPythonVariableStackTableModel::QmitkPythonVariableStackTableModel(QObject *parent)\n    :QAbstractTableModel(parent)\n{\n    us::ModuleContext* context = us::GetModuleContext();\n    m_PythonServiceRef = context->GetServiceReference<mitk::IPythonService>();\n    m_PythonService = context->GetService<mitk::IPythonService>(m_PythonServiceRef);\n    m_PythonService->AddPythonCommandObserver( this );\n}\n\nQmitkPythonVariableStackTableModel::~QmitkPythonVariableStackTableModel()\n{\n  us::ModuleContext* context = us::GetModuleContext();\n  context->UngetService( m_PythonServiceRef );\n  m_PythonService->RemovePythonCommandObserver( this );\n}\n\nbool QmitkPythonVariableStackTableModel::dropMimeData ( const QMimeData * data, Qt::DropAction action, int row, int column, const QModelIndex & parent )\n{\n    \/\/ Early exit, returning true, but not actually doing anything (ignoring data).\n    if (action == Qt::IgnoreAction)\n        return true;\n\n    \/\/ Note, we are returning true if we handled it, and false otherwise\n    bool returnValue = false;\n\n    if(data->hasFormat(\"application\/x-mitk-datanodes\"))\n    {\n        MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"dropped MITK DataNode\";\n        returnValue = true;\n\n        QString arg = QString(data->data(\"application\/x-mitk-datanodes\").data());\n        QStringList listOfDataNodeAddressPointers = arg.split(\",\");\n\n        QStringList::iterator slIter;\n        int i = 0;\n        int j = 0;\n        for (slIter = listOfDataNodeAddressPointers.begin();\n             slIter != listOfDataNodeAddressPointers.end();\n             slIter++)\n        {\n          long val = (*slIter).toLong();\n          mitk::DataNode* node = static_cast<mitk::DataNode *>((void*)val);\n          mitk::Image* mitkImage = dynamic_cast<mitk::Image*>(node->GetData());\n          MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"mitkImage is not null \" << (mitkImage != 0? \"true\": \"false\");\n\n          if( mitkImage )\n          {\n            QString varName = MITK_IMAGE_VAR_NAME;\n            if( i > 0 )\n              varName = QString(\"%1%2\").arg(MITK_IMAGE_VAR_NAME).arg(i);\n            MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"varName\" << varName.toStdString();\n\n            bool exportAsCvImage = mitkImage->GetDimension() == 2 && m_PythonService->IsOpenCvPythonWrappingAvailable();\n\n            if( exportAsCvImage )\n            {\n              int ret = QMessageBox::question(NULL, \"Export option\",\n                \"2D image detected. Export as OpenCV image to Python instead of an ITK image?\",\n                                              QMessageBox::Yes | QMessageBox::No, QMessageBox::No);\n\n              exportAsCvImage = ret == QMessageBox::Yes;\n              if(exportAsCvImage)\n              {\n                m_PythonService->CopyToPythonAsCvImage( mitkImage, MITK_IMAGE_VAR_NAME.toStdString() );\n                ++i;\n              }\n            }\n            if( !exportAsCvImage )\n            {\n              if( m_PythonService->IsItkPythonWrappingAvailable() )\n              {\n                m_PythonService->CopyToPythonAsItkImage( mitkImage, MITK_IMAGE_VAR_NAME.toStdString() );\n                ++i;\n              }\n              else\n              {\n                MITK_ERROR << \"ITK Python wrapping not available. Skipping export for image \" << node->GetName();\n              }\n            }\n          }\n          else\n          {\n            mitk::Surface* surface = dynamic_cast<mitk::Surface*>(node->GetData());\n            MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"found surface\";\n\n            if( surface )\n            {\n              QString varName = MITK_SURFACE_VAR_NAME;\n              MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"varName\" << varName.toStdString();\n\n              if( j > 0 )\n                varName = QString(\"%1%2\").arg(MITK_SURFACE_VAR_NAME).arg(j);\n              MITK_DEBUG(\"varName\") << \"varName\" << varName.toStdString();\n\n              if( m_PythonService->IsVtkPythonWrappingAvailable() )\n              {\n                m_PythonService->CopyToPythonAsVtkPolyData( surface, MITK_SURFACE_VAR_NAME.toStdString() );\n                ++j;\n              }\n              else\n              {\n                MITK_ERROR << \"VTK Python wrapping not available. Skipping export for surface \" << node->GetName();\n              }\n            }\n          }\n        }\n    }\n    return returnValue;\n}\n\nQVariant QmitkPythonVariableStackTableModel::headerData(int section, Qt::Orientation orientation,\n                                                        int role) const\n{\n    QVariant headerData;\n\n    \/\/ show only horizontal header\n    if ( role == Qt::DisplayRole )\n    {\n        if( orientation == Qt::Horizontal )\n        {\n            \/\/ first column: \"Attribute\"\n            if(section == 0)\n                headerData = \"Attribute\";\n            else if(section == 1)\n                headerData = \"Type\";\n            else if(section == 2)\n                headerData = \"Value\";\n        }\n    }\n\n    return headerData;\n}\n\nQt::ItemFlags QmitkPythonVariableStackTableModel::flags(const QModelIndex &index) const\n{\n    Qt::ItemFlags flags = QAbstractItemModel::flags(index);\n\n    if(index.isValid())\n        return Qt::ItemIsDragEnabled | Qt::ItemIsDropEnabled | flags;\n    else\n        return Qt::ItemIsDropEnabled | flags;\n}\n\nint QmitkPythonVariableStackTableModel::rowCount(const QModelIndex &) const\n{\n    return m_VariableStack.size();\n}\n\nint QmitkPythonVariableStackTableModel::columnCount(const QModelIndex &) const\n{\n    return 3;\n}\n\nQVariant QmitkPythonVariableStackTableModel::data(const QModelIndex &index, int role) const\n{\n    if (index.isValid() && !m_VariableStack.empty())\n    {\n        if(role == Qt::DisplayRole)\n        {\n            mitk::PythonVariable item = m_VariableStack.at(index.row());\n            if(index.column() == 0)\n              return QString::fromStdString(item.m_Name);\n            if(index.column() == 1)\n                return QString::fromStdString(item.m_Type);\n            if(index.column() == 2)\n                return QString::fromStdString(item.m_Value);\n        }\n    }\n    return QVariant();\n}\n\nQStringList QmitkPythonVariableStackTableModel::mimeTypes() const\n{\n    return QAbstractTableModel::mimeTypes();\n    QStringList types;\n    types << \"application\/x-mitk-datanodes\";\n    types << \"application\/x-qabstractitemmodeldatalist\";\n    return types;\n}\n\nQt::DropActions QmitkPythonVariableStackTableModel::supportedDropActions() const\n{\n    return Qt::CopyAction | Qt::MoveAction;\n}\n\nvoid QmitkPythonVariableStackTableModel::CommandExecuted(const std::string& pythonCommand)\n{\n  MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"command was executed \" << pythonCommand;\n    m_VariableStack = m_PythonService->GetVariableStack();\n    QAbstractTableModel::reset();\n}\n\nstd::vector<mitk::PythonVariable> QmitkPythonVariableStackTableModel::GetVariableStack() const\n{\n    return m_VariableStack;\n}\n<commit_msg>adding nodes with names other than mitkSurface to python<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 \"QmitkPythonVariableStackTableModel.h\"\n#include <QMimeData>\n#include <usModuleContext.h>\n#include <mitkDataNode.h>\n#include <usGetModuleContext.h>\n#include <QStringList>\n#include <QMessageBox>\n\nconst QString QmitkPythonVariableStackTableModel::MITK_IMAGE_VAR_NAME = \"mitkImage\";\nconst QString QmitkPythonVariableStackTableModel::MITK_SURFACE_VAR_NAME = \"mitkSurface\";\n\nQmitkPythonVariableStackTableModel::QmitkPythonVariableStackTableModel(QObject *parent)\n    :QAbstractTableModel(parent)\n{\n    us::ModuleContext* context = us::GetModuleContext();\n    m_PythonServiceRef = context->GetServiceReference<mitk::IPythonService>();\n    m_PythonService = context->GetService<mitk::IPythonService>(m_PythonServiceRef);\n    m_PythonService->AddPythonCommandObserver( this );\n}\n\nQmitkPythonVariableStackTableModel::~QmitkPythonVariableStackTableModel()\n{\n  us::ModuleContext* context = us::GetModuleContext();\n  context->UngetService( m_PythonServiceRef );\n  m_PythonService->RemovePythonCommandObserver( this );\n}\n\nbool QmitkPythonVariableStackTableModel::dropMimeData ( const QMimeData * data, Qt::DropAction action, int row, int column, const QModelIndex & parent )\n{\n    \/\/ Early exit, returning true, but not actually doing anything (ignoring data).\n    if (action == Qt::IgnoreAction)\n        return true;\n\n    \/\/ Note, we are returning true if we handled it, and false otherwise\n    bool returnValue = false;\n\n    if(data->hasFormat(\"application\/x-mitk-datanodes\"))\n    {\n        MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"dropped MITK DataNode\";\n        returnValue = true;\n\n        QString arg = QString(data->data(\"application\/x-mitk-datanodes\").data());\n        QStringList listOfDataNodeAddressPointers = arg.split(\",\");\n\n        QStringList::iterator slIter;\n        int i = 0;\n        int j = 0;\n        for (slIter = listOfDataNodeAddressPointers.begin();\n             slIter != listOfDataNodeAddressPointers.end();\n             slIter++)\n        {\n          long val = (*slIter).toLong();\n          mitk::DataNode* node = static_cast<mitk::DataNode *>((void*)val);\n          mitk::Image* mitkImage = dynamic_cast<mitk::Image*>(node->GetData());\n          MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"mitkImage is not null \" << (mitkImage != 0? \"true\": \"false\");\n\n          if( mitkImage )\n          {\n            QString varName = MITK_IMAGE_VAR_NAME;\n            if( i > 0 )\n              varName = QString(\"%1%2\").arg(MITK_IMAGE_VAR_NAME).arg(i);\n            MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"varName\" << varName.toStdString();\n\n            bool exportAsCvImage = mitkImage->GetDimension() == 2 && m_PythonService->IsOpenCvPythonWrappingAvailable();\n\n            if( exportAsCvImage )\n            {\n              int ret = QMessageBox::question(NULL, \"Export option\",\n                \"2D image detected. Export as OpenCV image to Python instead of an ITK image?\",\n                                              QMessageBox::Yes | QMessageBox::No, QMessageBox::No);\n\n              exportAsCvImage = ret == QMessageBox::Yes;\n              if(exportAsCvImage)\n              {\n                m_PythonService->CopyToPythonAsCvImage( mitkImage, MITK_IMAGE_VAR_NAME.toStdString() );\n                ++i;\n              }\n            }\n            if( !exportAsCvImage )\n            {\n              if( m_PythonService->IsItkPythonWrappingAvailable() )\n              {\n                m_PythonService->CopyToPythonAsItkImage( mitkImage, MITK_IMAGE_VAR_NAME.toStdString() );\n                ++i;\n              }\n              else\n              {\n                MITK_ERROR << \"ITK Python wrapping not available. Skipping export for image \" << node->GetName();\n              }\n            }\n          }\n          else\n          {\n            mitk::Surface* surface = dynamic_cast<mitk::Surface*>(node->GetData());\n            MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"found surface\";\n\n            if( surface )\n            {\n              MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"varName\" << node->GetName();\n\n              if( m_PythonService->IsVtkPythonWrappingAvailable() )\n              {\n                m_PythonService->CopyToPythonAsVtkPolyData( surface, node->GetName() );\n              }\n              else\n              {\n                MITK_ERROR << \"VTK Python wrapping not available. Skipping export for surface \" << node->GetName();\n              }\n            }\n          }\n        }\n    }\n    return returnValue;\n}\n\nQVariant QmitkPythonVariableStackTableModel::headerData(int section, Qt::Orientation orientation,\n                                                        int role) const\n{\n    QVariant headerData;\n\n    \/\/ show only horizontal header\n    if ( role == Qt::DisplayRole )\n    {\n        if( orientation == Qt::Horizontal )\n        {\n            \/\/ first column: \"Attribute\"\n            if(section == 0)\n                headerData = \"Attribute\";\n            else if(section == 1)\n                headerData = \"Type\";\n            else if(section == 2)\n                headerData = \"Value\";\n        }\n    }\n\n    return headerData;\n}\n\nQt::ItemFlags QmitkPythonVariableStackTableModel::flags(const QModelIndex &index) const\n{\n    Qt::ItemFlags flags = QAbstractItemModel::flags(index);\n\n    if(index.isValid())\n        return Qt::ItemIsDragEnabled | Qt::ItemIsDropEnabled | flags;\n    else\n        return Qt::ItemIsDropEnabled | flags;\n}\n\nint QmitkPythonVariableStackTableModel::rowCount(const QModelIndex &) const\n{\n    return m_VariableStack.size();\n}\n\nint QmitkPythonVariableStackTableModel::columnCount(const QModelIndex &) const\n{\n    return 3;\n}\n\nQVariant QmitkPythonVariableStackTableModel::data(const QModelIndex &index, int role) const\n{\n    if (index.isValid() && !m_VariableStack.empty())\n    {\n        if(role == Qt::DisplayRole)\n        {\n            mitk::PythonVariable item = m_VariableStack.at(index.row());\n            if(index.column() == 0)\n              return QString::fromStdString(item.m_Name);\n            if(index.column() == 1)\n                return QString::fromStdString(item.m_Type);\n            if(index.column() == 2)\n                return QString::fromStdString(item.m_Value);\n        }\n    }\n    return QVariant();\n}\n\nQStringList QmitkPythonVariableStackTableModel::mimeTypes() const\n{\n    return QAbstractTableModel::mimeTypes();\n    QStringList types;\n    types << \"application\/x-mitk-datanodes\";\n    types << \"application\/x-qabstractitemmodeldatalist\";\n    return types;\n}\n\nQt::DropActions QmitkPythonVariableStackTableModel::supportedDropActions() const\n{\n    return Qt::CopyAction | Qt::MoveAction;\n}\n\nvoid QmitkPythonVariableStackTableModel::CommandExecuted(const std::string& pythonCommand)\n{\n  MITK_DEBUG(\"QmitkPythonVariableStackTableModel\") << \"command was executed \" << pythonCommand;\n    m_VariableStack = m_PythonService->GetVariableStack();\n    QAbstractTableModel::reset();\n}\n\nstd::vector<mitk::PythonVariable> QmitkPythonVariableStackTableModel::GetVariableStack() const\n{\n    return m_VariableStack;\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#include <mitkTestingMacros.h>\n#include <mitkContourModel.h>\n\n\n\/\/Add a vertex to the contour and see if size changed\nstatic void TestAddVertex()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D point;\n  point[0] = point[1] = point[2] = 0;\n\n  contour->AddVertex(point);\n\n  MITK_TEST_CONDITION(contour->GetNumberOfVertices() > 0, \"Add a Vertex, size increased\");\n\n}\n\n\n\n\/\/select a vertex by index. successful if the selected vertex member of the contour is no longer set to null\nstatic void TestSelectVertexAtIndex()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D point;\n  point[0] = point[1] = point[2] = 0;\n\n  contour->AddVertex(point);\n\n  contour->SelectVertexAt(0);\n\n  MITK_TEST_CONDITION(contour->GetSelectedVertex() != NULL, \"Vertex was selected at index\");\n}\n\n\n\n\/\/select a vertex by worldposition. successful if the selected vertex member of the contour is no longer set to null\nstatic void TestSelectVertexAtWorldposition()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D point;\n  point[0] = point[1] = point[2] = 0;\n\n  contour->AddVertex(point);\n\n  \/\/same point is used here so the epsilon can be chosen very small\n  contour->SelectVertexAt(point, 0.01);\n\n  MITK_TEST_CONDITION(contour->GetSelectedVertex() != NULL, \"Vertex was selected at index\");\n}\n\n\n\n\/\/move a vertex by a translation vector\nstatic void TestMoveSelectedVertex()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D point;\n  point[0] = point[1] = point[2] = 0;\n\n  contour->AddVertex(point);\n\n  \/\/same point is used here so the epsilon can be chosen very small\n  contour->SelectVertexAt(point, 0.01);\n\n  mitk::Vector3D v;\n  v[0] = 1;\n  v[1] = 3;\n  v[2] = -1;\n\n  contour->MoveSelectedVertex(v);\n\n  const mitk::ContourModel::VertexType* vertex = contour->GetSelectedVertex();\n\n  bool correctlyMoved = false;\n\n  correctlyMoved = (*(vertex->Coordinates))[0] == (v[0]) &&\n                   (*(vertex->Coordinates))[1] == (v[1]) &&\n                   (*(vertex->Coordinates))[2] == (v[2]);\n\n  MITK_TEST_CONDITION(correctlyMoved, \"Vertex has been moved\");\n}\n\n\n\nint mitkContourModelTest(int argc, char* argv[])\n{\n  MITK_TEST_BEGIN(\"mitkContourModelTest\")\n\n    TestAddVertex();\n  TestSelectVertexAtIndex();\n  TestSelectVertexAtWorldposition();\n  MITK_TEST_END()\n}<commit_msg>test methods for contourModel<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#include <mitkTestingMacros.h>\n#include <mitkContourModel.h>\n\n\n\/\/Add a vertex to the contour and see if size changed\nstatic void TestAddVertex()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n  MITK_TEST_CONDITION(contour->GetNumberOfVertices() > 0, \"Add a Vertex, size increased\");\n\n}\n\n\n\n\/\/select a vertex by index. successful if the selected vertex member of the contour is no longer set to null\nstatic void TestSelectVertexAtIndex()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n  contour->SelectVertexAt(0);\n\n  MITK_TEST_CONDITION(contour->GetSelectedVertex() != NULL, \"Vertex was selected at index\");\n}\n\n\n\n\/\/select a vertex by worldposition. successful if the selected vertex member of the contour is no longer set to null\nstatic void TestSelectVertexAtWorldposition()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n  \/\/same point is used here so the epsilon can be chosen very small\n  contour->SelectVertexAt(p, 0.01);\n\n  MITK_TEST_CONDITION(contour->GetSelectedVertex() != NULL, \"Vertex was selected at index\");\n}\n\n\n\n\/\/move a vertex by a translation vector\nstatic void TestMoveSelectedVertex()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n  \/\/same point is used here so the epsilon can be chosen very small\n  contour->SelectVertexAt(p, 0.01);\n\n  mitk::Vector3D v;\n  v[0] = 1;\n  v[1] = 3;\n  v[2] = -1;\n\n  contour->MoveSelectedVertex(v);\n\n  const mitk::ContourModel::VertexType* vertex = contour->GetSelectedVertex();\n\n  bool correctlyMoved = false;\n\n  correctlyMoved = (vertex->Coordinates)[0] == (v[0]) &&\n                   (vertex->Coordinates)[1] == (v[1]) &&\n                   (vertex->Coordinates)[2] == (v[2]);\n\n  MITK_TEST_CONDITION(correctlyMoved, \"Vertex has been moved\");\n}\n\n\n\n\/\/test to move the whole contour\nstatic void TestMoveContour()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n\n  mitk::Point3D p2;\n  p2[0] = p2[1] = p2[2] = 0;\n\n  contour->AddVertex(p2);\n\n\n  mitk::Vector3D v;\n  v[0] = 1;\n  v[1] = 3;\n  v[2] = -1;\n\n  contour->MoveContour(v);\n\n  mitk::ContourModel::VertexIterator it = contour->IteratorBegin();\n  mitk::ContourModel::VertexIterator end = contour->IteratorEnd();\n\n  bool correctlyMoved = false;\n\n  while(it != end)\n  {\n\n    correctlyMoved &= (*it)->Coordinates[0] == (v[0]) &&\n      (*it)->Coordinates[1] == (v[1]) &&\n      (*it)->Coordinates[2] == (v[2]);\n  }\n\n  MITK_TEST_CONDITION(correctlyMoved, \"Contour has been moved\");\n}\n\n\n\n\/\/remove a vertex by index\nstatic void TestRemoveVertexAtIndex()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n  contour->RemoveVertexAt(0);\n\n  MITK_TEST_CONDITION(contour->GetNumberOfVertices() == 0, \"removed vertex\");\n}\n\n\n\n\/\/remove a vertex by position\nstatic void TestRemoveVertexAtWorldPosition()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n  contour->RemoveVertexAt(p, 0.01);\n\n  MITK_TEST_CONDITION(contour->GetNumberOfVertices() == 0, \"removed vertex\");\n}\n\n\n\n\/\/check closeable contour\nstatic void TestIsclosed()\n{\n    mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n\n  mitk::Point3D p2;\n  p2[0] = p2[1] = p2[2] = 1;\n\n  contour->AddVertex(p2);\n\n  contour->Close();\n\n  MITK_TEST_CONDITION(contour->IsClosed(), \"close contour\");\n}\n\n\n\n\/\/test concatenating two contours\nstatic void TestConcatenate()\n{\n  mitk::ContourModel::Pointer contour = mitk::ContourModel::New();\n\n  mitk::Point3D p;\n  p[0] = p[1] = p[2] = 0;\n\n  contour->AddVertex(p);\n\n\n  mitk::Point3D p2;\n  p2[0] = p2[1] = p2[2] = 1;\n\n  contour->AddVertex(p2);\n\n\n  mitk::ContourModel::Pointer contour2 = mitk::ContourModel::New();\n\n  mitk::Point3D p3;\n  p3[0] = -2;\n  p3[1] = 10;\n  p3[2] = 0;\n\n  contour2->AddVertex(p3);\n\n\n  mitk::Point3D p4;\n  p4[0] = -3;\n  p4[1] = 6;\n  p4[2] = -5;\n\n  contour2->AddVertex(p4);\n\n  contour->Concatenate(contour2);\n\n  MITK_TEST_CONDITION(contour->GetNumberOfVertices() == 4, \"two contours were concatenated\");\n}\n\n\n\n\nint mitkContourModelTest(int argc, char* argv[])\n{\n  MITK_TEST_BEGIN(\"mitkContourModelTest\")\n\n    TestAddVertex();\n  TestSelectVertexAtIndex();\n  TestSelectVertexAtWorldposition();\n  TestMoveSelectedVertex();\n  TestRemoveVertexAtIndex();\n  TestRemoveVertexAtWorldPosition();\n  TestIsclosed();\n  TestConcatenate();\n\n  MITK_TEST_END()\n}<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\nProgram:   Visualization Toolkit\n\nCopyright (c) Ken Martin, Will Schroeder, Bill Lorensen\nAll rights reserved.\nSee Copyright.txt or http:\/\/www.kitware.com\/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 notice for more information.\n\n=========================================================================*\/\n#include \"vtkLCMGLProp.h\"\n\n#include <vtkObjectFactory.h>\n#include <vtkSmartPointer.h>\n#include <vtkActor.h>\n\n#include <vtkOpenGL.h>\n\n#include <lcmtypes\/bot_lcmgl\/data_t.hpp>\n#include <bot_lcmgl_render\/lcmgl_decode.h>\n\n\n\/\/----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkLCMGLProp);\n\n\nclass vtkLCMGLProp::vtkInternal {\npublic:\n  vtkInternal()\n    {\n      this->GLData.datalen = 0;\n    }\n\n  bot_lcmgl::data_t GLData;\n\n  std::vector<vtkSmartPointer<vtkActor> > Actors;\n};\n\n\/\/----------------------------------------------------------------------------\nvtkLCMGLProp::vtkLCMGLProp()\n{\n  this->Internal = new vtkInternal;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkLCMGLProp::~vtkLCMGLProp()\n{\n  delete this->Internal;\n}\n\n\/\/----------------------------------------------------------------------------\ndouble* vtkLCMGLProp::GetBounds()\n{\n  static double bounds[6] = {-5, 5, -5, 5, -5, 5};\n  return bounds;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkLCMGLProp::UpdateGLData(const char* messageData)\n{\n  int status = this->Internal->GLData.decode(messageData, 0, 1e6);\n  if (!status)\n    {\n    this->Internal->GLData.name = std::string();\n    this->Internal->GLData.datalen = 0;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkLCMGLProp::ReleaseGraphicsResources(vtkWindow *w)\n{\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    this->Internal->Actors[i]->ReleaseGraphicsResources(w);\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkLCMGLProp::RenderOpaqueGeometry(vtkViewport *v)\n{\n  if (this->Internal->GLData.datalen)\n    {\n    glPushMatrix();\n    glPushAttrib(GL_ENABLE_BIT);\n    glDisable(GL_LIGHTING);\n\n    bot_lcmgl_decode(&this->Internal->GLData.data.front(), this->Internal->GLData.datalen);\n\n    glPopAttrib ();\n    glPopMatrix();\n    return 1;\n    }\n\n  int count=0;\n\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    count += this->Internal->Actors[i]->RenderOpaqueGeometry(v);\n    }\n\n  return count;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkLCMGLProp::RenderOverlay(vtkViewport *v)\n{\n  int count=0;\n\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    count += this->Internal->Actors[i]->RenderOverlay(v);\n    }\n\n  return count;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkLCMGLProp::RenderTranslucentPolygonalGeometry(vtkViewport *v)\n{\n  int count=0;\n\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    count += this->Internal->Actors[i]->RenderTranslucentPolygonalGeometry(v);\n    }\n\n  return count;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkLCMGLProp::HasTranslucentPolygonalGeometry()\n{\n  int result = 0;\n\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    result |= this->Internal->Actors[i]->HasTranslucentPolygonalGeometry();\n    }\n\n  return result;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkLCMGLProp::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n<commit_msg>add more setup to the GL state machine before calling into lcmgl<commit_after>\/*=========================================================================\n\nProgram:   Visualization Toolkit\n\nCopyright (c) Ken Martin, Will Schroeder, Bill Lorensen\nAll rights reserved.\nSee Copyright.txt or http:\/\/www.kitware.com\/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 notice for more information.\n\n=========================================================================*\/\n#include \"vtkLCMGLProp.h\"\n\n#include <vtkObjectFactory.h>\n#include <vtkSmartPointer.h>\n#include <vtkActor.h>\n\n#include <vtkOpenGL.h>\n\n#include <lcmtypes\/bot_lcmgl\/data_t.hpp>\n#include <bot_lcmgl_render\/lcmgl_decode.h>\n\n\n\/\/----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkLCMGLProp);\n\n\nclass vtkLCMGLProp::vtkInternal {\npublic:\n  vtkInternal()\n    {\n      this->GLData.datalen = 0;\n    }\n\n  bot_lcmgl::data_t GLData;\n\n  std::vector<vtkSmartPointer<vtkActor> > Actors;\n};\n\n\/\/----------------------------------------------------------------------------\nvtkLCMGLProp::vtkLCMGLProp()\n{\n  this->Internal = new vtkInternal;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkLCMGLProp::~vtkLCMGLProp()\n{\n  delete this->Internal;\n}\n\n\/\/----------------------------------------------------------------------------\ndouble* vtkLCMGLProp::GetBounds()\n{\n  static double bounds[6] = {-5, 5, -5, 5, -5, 5};\n  return bounds;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkLCMGLProp::UpdateGLData(const char* messageData)\n{\n  int status = this->Internal->GLData.decode(messageData, 0, 1e6);\n  if (!status)\n    {\n    this->Internal->GLData.name = std::string();\n    this->Internal->GLData.datalen = 0;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkLCMGLProp::ReleaseGraphicsResources(vtkWindow *w)\n{\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    this->Internal->Actors[i]->ReleaseGraphicsResources(w);\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkLCMGLProp::RenderOpaqueGeometry(vtkViewport *v)\n{\n  if (this->Internal->GLData.datalen)\n    {\n    glPushMatrix();\n    glPushAttrib(GL_ENABLE_BIT | GL_POINT_BIT | GL_POLYGON_STIPPLE_BIT |\n                 GL_POLYGON_BIT | GL_LINE_BIT | GL_FOG_BIT | GL_LIGHTING_BIT);\n\n\n    \/\/ The goal here is to setup the GL state machine to match what the\n    \/\/ default libbot viewer uses.  At this point, the VTK graphichs\n    \/\/ engine may be in some unknown state due to whatever has already been\n    \/\/ drawn.  In order to set the GL state machine to match libbot, I have\n    \/\/ reviewed code in:\n    \/\/   my_draw() of bot_lcmgl_render\/lcmgl_decode.c\n    \/\/   render_scene() of bot_vis\/viewer.c\n\n\n    \/\/ reset lighting and color flags\n    glDisable(GL_LIGHTING);\n    glDisable(GL_COLOR_MATERIAL);\n    glDisable(GL_LIGHT0);\n    glDisable(GL_LIGHT1);\n    glDisable(GL_LIGHT2);\n    glDisable(GL_LIGHT3);\n    glDisable(GL_LIGHT4);\n    glDisable(GL_LIGHT5);\n    glDisable(GL_LIGHT6);\n\n    \/\/ reset lighting model\n    float light_model_ambient[] = {0.2, 0.2, 0.2, 1.0};\n    glLightModelfv(GL_LIGHT_MODEL_AMBIENT, light_model_ambient);\n\n    \/\/ reset GL_LIGHT0\n    float light0_amb[] = { 0.0, 0.0, 0.0, 1 };\n    float light0_dif[] = { 1, 1, 1, 1 };\n    float light0_spe[] = { .5, .5, .5, 1 };\n    float light0_pos[] = { 100, 100, 100, 0 };\n    float spot_exp[] = {0.0};\n    float spot_cutoff[] = {180.0};\n    float att0[] = {0.0};\n    float att1[] = {1.0};\n    glLightfv (GL_LIGHT0, GL_AMBIENT, light0_amb);\n    glLightfv (GL_LIGHT0, GL_DIFFUSE, light0_dif);\n    glLightfv (GL_LIGHT0, GL_SPECULAR, light0_spe);\n    glLightfv (GL_LIGHT0, GL_SPOT_EXPONENT, spot_exp);\n    glLightfv (GL_LIGHT0, GL_SPOT_CUTOFF, spot_cutoff);\n    glLightfv (GL_LIGHT0, GL_CONSTANT_ATTENUATION, att1);\n    glLightfv (GL_LIGHT0, GL_LINEAR_ATTENUATION, att1);\n    glLightfv (GL_LIGHT0, GL_QUADRATIC_ATTENUATION, att1);\n\n    \/\/ don't set the light position, use the position that VTK has already set\n    \/\/glLightfv (GL_LIGHT0, GL_POSITION, light0_pos);\n\n    \/\/ enable GL_LIGHT0\n    glEnable (GL_LIGHT0);\n\n    \/\/ this makes the rendering prettier for lines and points\n    if (1)\n    {\n      glEnable(GL_LINE_STIPPLE);\n      glEnable(GL_LINE_SMOOTH);\n      glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\n      glEnable(GL_POINT_SMOOTH);\n      glHint(GL_POINT_SMOOTH_HINT, GL_NICEST);\n    }\n\n    \/\/ enable transparency, copied from my_draw() of bot_lcmgl_render\/lcmgl_decode.c\n    glEnable(GL_BLEND);\n    glEnable(GL_DEPTH_TEST);\n\n    \/\/ invoke lcmgl rendering\n    bot_lcmgl_decode(&this->Internal->GLData.data.front(), this->Internal->GLData.datalen);\n\n    glPopAttrib ();\n    glPopMatrix();\n    return 1;\n    }\n\n  int count=0;\n\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    count += this->Internal->Actors[i]->RenderOpaqueGeometry(v);\n    }\n\n  return count;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkLCMGLProp::RenderOverlay(vtkViewport *v)\n{\n  int count=0;\n\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    count += this->Internal->Actors[i]->RenderOverlay(v);\n    }\n\n  return count;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkLCMGLProp::RenderTranslucentPolygonalGeometry(vtkViewport *v)\n{\n  int count=0;\n\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    count += this->Internal->Actors[i]->RenderTranslucentPolygonalGeometry(v);\n    }\n\n  return count;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkLCMGLProp::HasTranslucentPolygonalGeometry()\n{\n  int result = 0;\n\n  for (size_t i = 0; i < this->Internal->Actors.size(); ++i)\n    {\n    result |= this->Internal->Actors[i]->HasTranslucentPolygonalGeometry();\n    }\n\n  return result;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkLCMGLProp::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"product_price_trend.h\"\n\n#include <common\/Utilities.h>\n#include <log-manager\/PriceHistory.h>\n#include <document-manager\/DocumentManager.h>\n\n#include <am\/range\/AmIterator.h>\n#include <libcassandra\/util_functions.h>\n#include <glog\/logging.h>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/filesystem.hpp>\n#include <algorithm>\n\nusing namespace std;\nusing namespace libcassandra;\nusing izenelib::util::UString;\n\nnamespace sf1r\n{\n\nProductPriceTrend::ProductPriceTrend(\n        const boost::shared_ptr<DocumentManager>& document_manager,\n        const CassandraStorageConfig& cassandraConfig,\n        const string& data_dir,\n        const vector<string>& group_prop_vec,\n        const vector<uint32_t>& time_int_vec)\n    : document_manager_(document_manager)\n    , cassandraConfig_(cassandraConfig)\n    , data_dir_(data_dir)\n    , group_prop_vec_(group_prop_vec)\n    , time_int_vec_(time_int_vec)\n    , enable_tpc_(!group_prop_vec_.empty() && !time_int_vec_.empty())\n{\n}\n\nProductPriceTrend::~ProductPriceTrend()\n{\n    for (TPCStorage::iterator it = tpc_storage_.begin();\n            it != tpc_storage_.end(); ++it)\n    {\n        for (uint32_t i = 0; i < time_int_vec_.size(); i++)\n            delete it->second[i];\n    }\n}\n\nbool ProductPriceTrend::Init()\n{\n    if (!cassandraConfig_.enable)\n        return false;\n\n    price_history_.reset(new PriceHistory(cassandraConfig_.keyspace));\n    price_history_->createColumnFamily();\n\n    if (!price_history_->is_enabled)\n        return false;\n\n    for (vector<string>::const_iterator it = group_prop_vec_.begin();\n            it != group_prop_vec_.end(); ++it)\n    {\n        vector<TPCBTree *>& prop_tpc = tpc_storage_[*it];\n        for (uint32_t i = 0; i < time_int_vec_.size(); i++)\n        {\n            string db_path = data_dir_ + \"\/\" + *it + \".\" + boost::lexical_cast<string>(time_int_vec_[i]) + \".tpc\";\n            prop_tpc.push_back(new TPCBTree(db_path));\n            if (!prop_tpc.back()->open())\n            {\n                boost::filesystem::remove_all(db_path);\n                prop_tpc.back()->open();\n            }\n        }\n    }\n    price_history_buffer_.reserve(2000);\n\n    return true;\n}\n\nbool ProductPriceTrend::Insert(\n        const string& docid,\n        const ProductPrice& price,\n        time_t timestamp)\n{\n    price_history_buffer_.push_back(PriceHistoryRow(docid));\n    price_history_buffer_.back().insert(timestamp, price);\n\n    if (IsBufferFull_())\n    {\n        return Flush();\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::Update(\n        const string& docid,\n        const ProductPrice& price,\n        time_t timestamp,\n        map<string, string>& group_prop_map)\n{\n    price_history_buffer_.push_back(PriceHistoryRow(docid));\n    price_history_buffer_.back().insert(timestamp, price);\n\n    if (enable_tpc_ && !group_prop_map.empty() && price.value.first > 0)\n    {\n        PropItemType& prop_item = prop_map_[docid];\n        prop_item.first = price.value.first;\n        prop_item.second.swap(group_prop_map);\n    }\n\n    if (IsBufferFull_())\n    {\n        return Flush();\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::IsBufferFull_()\n{\n    return price_history_buffer_.size() >= 2000;\n}\n\nbool ProductPriceTrend::Flush()\n{\n    bool ret = true;\n    time_t now = Utilities::createTimeStamp();\n\n    if (!prop_map_.empty())\n    {\n        for (uint32_t i = 0; i < time_int_vec_.size(); i++)\n        {\n            if (!UpdateTPC_(i, now))\n                ret = false;\n        }\n\n        prop_map_.clear();\n    }\n\n    if (!price_history_->updateMultiRow(price_history_buffer_))\n        ret = false;\n\n    price_history_buffer_.clear();\n\n    return ret;\n}\n\nbool ProductPriceTrend::CronJob()\n{\n    if (!enable_tpc_) return true;\n\n    \/\/TODO\n    return true;\n}\n\nbool ProductPriceTrend::UpdateTPC_(uint32_t time_int, time_t timestamp)\n{\n    vector<string> key_list;\n    Utilities::getKeyList(key_list, prop_map_);\n    if (timestamp == -1)\n        timestamp = Utilities::createTimeStamp();\n    timestamp -= 86400000000LL * time_int_vec_[time_int];\n\n    vector<PriceHistoryRow> row_list;\n    if (!price_history_->getMultiSlice(row_list, key_list, serializeLong(timestamp), \"\", 1))\n        return false;\n\n    map<string, map<string, TPCQueue> > tpc_cache;\n    for (uint32_t i = 0; i < row_list.size(); i++)\n    {\n        const PropItemType& prop_item = prop_map_.find(row_list[i].getDocId())->second;\n        const pair<time_t, ProductPrice>& price_record = *(row_list[i].getPriceHistory().begin());\n        const ProductPriceType& old_price = price_record.second.value.first;\n        float price_cut = old_price == 0 ? 0 : 1 - prop_item.first \/ old_price;\n\n        for (map<string, string>::const_iterator it = prop_item.second.begin();\n                it != prop_item.second.end(); ++it)\n        {\n            TPCQueue& tpc_queue = tpc_cache[it->first][it->second];\n            if (tpc_queue.empty())\n            {\n                tpc_queue.reserve(1000);\n                tpc_storage_[it->first][time_int]->get(it->second, tpc_queue);\n            }\n\n            if (tpc_queue.size() < 1000)\n            {\n                tpc_queue.push_back(make_pair(price_cut, row_list[i].getDocId()));\n                push_heap(tpc_queue.begin(), tpc_queue.end(), rel_ops::operator> <TPCQueue::value_type>);\n            }\n            else if (price_cut > tpc_queue[0].first)\n            {\n                pop_heap(tpc_queue.begin(), tpc_queue.end(), rel_ops::operator> <TPCQueue::value_type>);\n                tpc_queue.back().first = price_cut;\n                tpc_queue.back().second = row_list[i].getDocId();\n                push_heap(tpc_queue.begin(), tpc_queue.end(), rel_ops::operator> <TPCQueue::value_type>);\n            }\n        }\n    }\n\n    for (map<string, map<string, TPCQueue> >::const_iterator it = tpc_cache.begin();\n            it != tpc_cache.end(); ++it)\n    {\n        TPCBTree* tpc_btree = tpc_storage_[it->first][time_int];\n        for (map<string, TPCQueue>::const_iterator mit = it->second.begin();\n                mit != it->second.end(); ++mit)\n        {\n            tpc_btree->update(mit->first, mit->second);\n        }\n        tpc_btree->flush();\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::GetMultiPriceHistory(\n        PriceHistoryList& history_list,\n        const vector<string>& docid_list,\n        time_t from_tt,\n        time_t to_tt,\n        string& error_msg)\n{\n    string from_str(from_tt == -1 ? \"\" : serializeLong(from_tt));\n    string to_str(to_tt == -1 ? \"\" : serializeLong(to_tt));\n\n    vector<PriceHistoryRow> row_list;\n    if (!price_history_->getMultiSlice(row_list, docid_list, from_str, to_str))\n    {\n        error_msg = \"Failed retrieving price histories from Cassandra\";\n        return false;\n    }\n\n    history_list.reserve(history_list.size() + row_list.size());\n    for (vector<PriceHistoryRow>::const_iterator it = row_list.begin();\n            it != row_list.end(); ++it)\n    {\n        const PriceHistory::PriceHistoryType& price_history = it->getPriceHistory();\n        PriceHistoryItem history_item;\n        history_item.reserve(price_history.size());\n        for (PriceHistory::PriceHistoryType::const_iterator hit = price_history.begin();\n                hit != price_history.end(); ++hit)\n        {\n            history_item.push_back(make_pair(string(), hit->second.value));\n            history_item.back().first = boost::posix_time::to_iso_string(\n                    boost::posix_time::from_time_t(hit->first \/ 1000000 - timezone)\n                    + boost::posix_time::microseconds(hit->first % 1000000));\n        }\n        history_list.push_back(make_pair(it->getDocId(), PriceHistoryItem()));\n        history_list.back().second.swap(history_item);\n    }\n\n    if (history_list.empty())\n    {\n        error_msg = \"Have not got any valid docid\";\n        return false;\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::GetMultiPriceRange(\n        PriceRangeList& range_list,\n        const vector<string>& docid_list,\n        time_t from_tt,\n        time_t to_tt,\n        string& error_msg)\n{\n    string from_str(from_tt == -1 ? \"\" : serializeLong(from_tt));\n    string to_str(to_tt == -1 ? \"\" : serializeLong(to_tt));\n\n    vector<PriceHistoryRow> row_list;\n    if (!price_history_->getMultiSlice(row_list, docid_list, from_str, to_str))\n    {\n        error_msg = \"Failed retrieving price histories from Cassandra\";\n        return false;\n    }\n\n    range_list.reserve(range_list.size() + row_list.size());\n    for (vector<PriceHistoryRow>::const_iterator it = row_list.begin();\n            it != row_list.end(); ++it)\n    {\n        const PriceHistory::PriceHistoryType& price_history = it->getPriceHistory();\n        ProductPrice range_item;\n        for (PriceHistory::PriceHistoryType::const_iterator hit = price_history.begin();\n                hit != price_history.end(); ++hit)\n        {\n            range_item += hit->second;\n        }\n        range_list.push_back(make_pair(it->getDocId(), range_item.value));\n    }\n\n    if (range_list.empty())\n    {\n        error_msg = \"Have not got any valid docid\";\n        return false;\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::GetTopPriceCutList(\n        TPCQueue& tpc_queue,\n        const string& prop_name,\n        const string& prop_value,\n        uint32_t days,\n        uint32_t count,\n        string& error_msg)\n{\n    if (!enable_tpc_)\n    {\n        error_msg = \"Top price-cut list is not enabled for this collection.\";\n        return false;\n    }\n\n    TPCStorage::const_iterator tpc_it = tpc_storage_.find(prop_name);\n    if (tpc_it == tpc_storage_.end())\n    {\n        error_msg = \"Don't find data for this property name: \" + prop_name;\n        return false;\n    }\n\n    uint32_t time_int = 0;\n    while (days > time_int_vec_[time_int++] && time_int < time_int_vec_.size() - 1);\n    if (!tpc_it->second[time_int]->get(prop_value, tpc_queue))\n    {\n        error_msg = \"Don't find price-cut record for this property value: \" + prop_value;\n        return false;\n    }\n\n    sort_heap(tpc_queue.begin(), tpc_queue.end(), rel_ops::operator><TPCQueue::value_type>);\n    if (tpc_queue.size() > count)\n        tpc_queue.resize(count);\n\n    return true;\n}\n\nbool ProductPriceTrend::MigratePriceHistory(\n        const string& new_keyspace,\n        const string& old_prefix,\n        const string& new_prefix,\n        uint32_t start,\n        string& error_msg)\n{\n    if (new_keyspace == cassandraConfig_.keyspace)\n        return true;\n\n    vector<string> docid_list;\n    docid_list.reserve(1000);\n    boost::shared_ptr<PriceHistory> new_price_history(new PriceHistory(new_keyspace));\n    new_price_history->createColumnFamily();\n\n    uint32_t count = 0;\n    for (uint32_t i = start; i <= document_manager_->getMaxDocId(); i++)\n    {\n        Document doc;\n        document_manager_->getDocument(i, doc);\n        Document::property_const_iterator kit = doc.findProperty(\"DOCID\");\n        if (kit == doc.propertyEnd())\n            continue;\n\n        const UString& key = kit->second.get<UString>();\n        docid_list.push_back(string());\n        key.convertString(docid_list.back(), UString::UTF_8);\n        if (!old_prefix.empty())\n        {\n            docid_list.back() = old_prefix + \"_\" + docid_list.back();\n        }\n\n        if (docid_list.size() == 1000)\n        {\n            vector<PriceHistoryRow> row_list;\n            if (!price_history_->getMultiSlice(row_list, docid_list))\n            {\n                error_msg = \"Can't get price history from Cassandra.\";\n                return false;\n            }\n\n            if (!old_prefix.empty())\n            {\n                std::size_t len = old_prefix.length() + 1;\n                if (!new_prefix.empty())\n                {\n                    for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                            it != row_list.end(); ++it)\n                    {\n                        it->setDocId(new_prefix + \"_\" + it->getDocId().substr(len));\n                    }\n                }\n                else\n                {\n                    for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                            it != row_list.end(); ++it)\n                    {\n                        it->setDocId(it->getDocId().substr(len));\n                    }\n                }\n            }\n            else if (!new_prefix.empty())\n            {\n                for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                        it != row_list.end(); ++it)\n                {\n                    it->setDocId(new_prefix + \"_\" + it->getDocId());\n                }\n            }\n\n            if (!new_price_history->updateMultiRow(row_list))\n            {\n                error_msg = \"Can't update price history to Cassandra.\";\n                return false;\n            }\n            docid_list.clear();\n        }\n\n        if (++count % 100000 == 0)\n        {\n            LOG(INFO) << \"Migrating price history: \" << count;\n        }\n    }\n\n    if (!docid_list.empty())\n    {\n        vector<PriceHistoryRow> row_list;\n        if (!price_history_->getMultiSlice(row_list, docid_list))\n        {\n            error_msg = \"Can't get price history from Cassandra.\";\n            return false;\n        }\n\n        if (!old_prefix.empty())\n        {\n            std::size_t len = old_prefix.length() + 1;\n            if (!new_prefix.empty())\n            {\n                for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                        it != row_list.end(); ++it)\n                {\n                    it->setDocId(new_prefix + \"_\" + it->getDocId().substr(len));\n                }\n            }\n            else\n            {\n                for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                        it != row_list.end(); ++it)\n                {\n                    it->setDocId(it->getDocId().substr(len));\n                }\n            }\n        }\n        else if (!new_prefix.empty())\n        {\n            for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                    it != row_list.end(); ++it)\n            {\n                it->setDocId(new_prefix + \"_\" + it->getDocId());\n            }\n        }\n        if (!new_price_history->updateMultiRow(row_list))\n        {\n            error_msg = \"Can't update price history to Cassandra.\";\n            return false;\n        }\n    }\n    LOG(INFO) << \"Successfully migrated price history for \" << count << \" products.\";\n\n    return true;\n}\n\n}\n<commit_msg>tiny fix<commit_after>#include \"product_price_trend.h\"\n\n#include <common\/Utilities.h>\n#include <log-manager\/PriceHistory.h>\n#include <document-manager\/DocumentManager.h>\n\n#include <am\/range\/AmIterator.h>\n#include <libcassandra\/util_functions.h>\n#include <glog\/logging.h>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/filesystem.hpp>\n#include <algorithm>\n\nusing namespace std;\nusing namespace libcassandra;\nusing izenelib::util::UString;\n\nnamespace sf1r\n{\n\nProductPriceTrend::ProductPriceTrend(\n        const boost::shared_ptr<DocumentManager>& document_manager,\n        const CassandraStorageConfig& cassandraConfig,\n        const string& data_dir,\n        const vector<string>& group_prop_vec,\n        const vector<uint32_t>& time_int_vec)\n    : document_manager_(document_manager)\n    , cassandraConfig_(cassandraConfig)\n    , data_dir_(data_dir)\n    , group_prop_vec_(group_prop_vec)\n    , time_int_vec_(time_int_vec)\n    , enable_tpc_(!group_prop_vec_.empty() && !time_int_vec_.empty())\n{\n}\n\nProductPriceTrend::~ProductPriceTrend()\n{\n    for (TPCStorage::iterator it = tpc_storage_.begin();\n            it != tpc_storage_.end(); ++it)\n    {\n        for (uint32_t i = 0; i < time_int_vec_.size(); i++)\n            delete it->second[i];\n    }\n}\n\nbool ProductPriceTrend::Init()\n{\n    if (!cassandraConfig_.enable)\n        return false;\n\n    price_history_.reset(new PriceHistory(cassandraConfig_.keyspace));\n    price_history_->createColumnFamily();\n\n    if (!price_history_->is_enabled)\n        return false;\n\n    for (vector<string>::const_iterator it = group_prop_vec_.begin();\n            it != group_prop_vec_.end(); ++it)\n    {\n        vector<TPCBTree *>& prop_tpc = tpc_storage_[*it];\n        for (uint32_t i = 0; i < time_int_vec_.size(); i++)\n        {\n            string db_path = data_dir_ + \"\/\" + *it + \".\" + boost::lexical_cast<string>(time_int_vec_[i]) + \".tpc\";\n            prop_tpc.push_back(new TPCBTree(db_path));\n            if (!prop_tpc.back()->open())\n            {\n                boost::filesystem::remove_all(db_path);\n                prop_tpc.back()->open();\n            }\n        }\n    }\n    price_history_buffer_.reserve(2000);\n\n    return true;\n}\n\nbool ProductPriceTrend::Insert(\n        const string& docid,\n        const ProductPrice& price,\n        time_t timestamp)\n{\n    price_history_buffer_.push_back(PriceHistoryRow(docid));\n    price_history_buffer_.back().insert(timestamp, price);\n\n    if (IsBufferFull_())\n    {\n        return Flush();\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::Update(\n        const string& docid,\n        const ProductPrice& price,\n        time_t timestamp,\n        map<string, string>& group_prop_map)\n{\n    price_history_buffer_.push_back(PriceHistoryRow(docid));\n    price_history_buffer_.back().insert(timestamp, price);\n\n    if (enable_tpc_ && !group_prop_map.empty() && price.value.first > 0)\n    {\n        PropItemType& prop_item = prop_map_[docid];\n        prop_item.first = price.value.first;\n        prop_item.second.swap(group_prop_map);\n    }\n\n    if (IsBufferFull_())\n    {\n        return Flush();\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::IsBufferFull_()\n{\n    return price_history_buffer_.size() >= 2000;\n}\n\nbool ProductPriceTrend::Flush()\n{\n    bool ret = true;\n    time_t now = Utilities::createTimeStamp();\n\n    if (!prop_map_.empty())\n    {\n        for (uint32_t i = 0; i < time_int_vec_.size(); i++)\n        {\n            if (!UpdateTPC_(i, now))\n                ret = false;\n        }\n\n        PropMapType().swap(prop_map_);\n    }\n\n    if (!price_history_->updateMultiRow(price_history_buffer_))\n        ret = false;\n\n    price_history_buffer_.clear();\n\n    return ret;\n}\n\nbool ProductPriceTrend::CronJob()\n{\n    if (!enable_tpc_) return true;\n\n    \/\/TODO\n    return true;\n}\n\nbool ProductPriceTrend::UpdateTPC_(uint32_t time_int, time_t timestamp)\n{\n    vector<string> key_list;\n    Utilities::getKeyList(key_list, prop_map_);\n    if (timestamp == -1)\n        timestamp = Utilities::createTimeStamp();\n    timestamp -= 86400000000LL * time_int_vec_[time_int];\n\n    vector<PriceHistoryRow> row_list;\n    if (!price_history_->getMultiSlice(row_list, key_list, serializeLong(timestamp), \"\", 1))\n        return false;\n\n    map<string, map<string, TPCQueue> > tpc_cache;\n    for (uint32_t i = 0; i < row_list.size(); i++)\n    {\n        const PropItemType& prop_item = prop_map_.find(row_list[i].getDocId())->second;\n        const pair<time_t, ProductPrice>& price_record = *(row_list[i].getPriceHistory().begin());\n        const ProductPriceType& old_price = price_record.second.value.first;\n        float price_cut = old_price == 0 ? 0 : 1 - prop_item.first \/ old_price;\n\n        for (map<string, string>::const_iterator it = prop_item.second.begin();\n                it != prop_item.second.end(); ++it)\n        {\n            TPCQueue& tpc_queue = tpc_cache[it->first][it->second];\n            if (tpc_queue.empty())\n            {\n                tpc_queue.reserve(1000);\n                tpc_storage_[it->first][time_int]->get(it->second, tpc_queue);\n            }\n\n            if (tpc_queue.size() < 1000)\n            {\n                tpc_queue.push_back(make_pair(price_cut, row_list[i].getDocId()));\n                push_heap(tpc_queue.begin(), tpc_queue.end(), rel_ops::operator> <TPCQueue::value_type>);\n            }\n            else if (price_cut > tpc_queue[0].first)\n            {\n                pop_heap(tpc_queue.begin(), tpc_queue.end(), rel_ops::operator> <TPCQueue::value_type>);\n                tpc_queue.back().first = price_cut;\n                tpc_queue.back().second = row_list[i].getDocId();\n                push_heap(tpc_queue.begin(), tpc_queue.end(), rel_ops::operator> <TPCQueue::value_type>);\n            }\n        }\n    }\n\n    for (map<string, map<string, TPCQueue> >::const_iterator it = tpc_cache.begin();\n            it != tpc_cache.end(); ++it)\n    {\n        TPCBTree* tpc_btree = tpc_storage_[it->first][time_int];\n        for (map<string, TPCQueue>::const_iterator mit = it->second.begin();\n                mit != it->second.end(); ++mit)\n        {\n            tpc_btree->update(mit->first, mit->second);\n        }\n        tpc_btree->flush();\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::GetMultiPriceHistory(\n        PriceHistoryList& history_list,\n        const vector<string>& docid_list,\n        time_t from_tt,\n        time_t to_tt,\n        string& error_msg)\n{\n    string from_str(from_tt == -1 ? \"\" : serializeLong(from_tt));\n    string to_str(to_tt == -1 ? \"\" : serializeLong(to_tt));\n\n    vector<PriceHistoryRow> row_list;\n    if (!price_history_->getMultiSlice(row_list, docid_list, from_str, to_str))\n    {\n        error_msg = \"Failed retrieving price histories from Cassandra\";\n        return false;\n    }\n\n    history_list.reserve(history_list.size() + row_list.size());\n    for (vector<PriceHistoryRow>::const_iterator it = row_list.begin();\n            it != row_list.end(); ++it)\n    {\n        const PriceHistory::PriceHistoryType& price_history = it->getPriceHistory();\n        PriceHistoryItem history_item;\n        history_item.reserve(price_history.size());\n        for (PriceHistory::PriceHistoryType::const_iterator hit = price_history.begin();\n                hit != price_history.end(); ++hit)\n        {\n            history_item.push_back(make_pair(string(), hit->second.value));\n            history_item.back().first = boost::posix_time::to_iso_string(\n                    boost::posix_time::from_time_t(hit->first \/ 1000000 - timezone)\n                    + boost::posix_time::microseconds(hit->first % 1000000));\n        }\n        history_list.push_back(make_pair(it->getDocId(), PriceHistoryItem()));\n        history_list.back().second.swap(history_item);\n    }\n\n    if (history_list.empty())\n    {\n        error_msg = \"Have not got any valid docid\";\n        return false;\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::GetMultiPriceRange(\n        PriceRangeList& range_list,\n        const vector<string>& docid_list,\n        time_t from_tt,\n        time_t to_tt,\n        string& error_msg)\n{\n    string from_str(from_tt == -1 ? \"\" : serializeLong(from_tt));\n    string to_str(to_tt == -1 ? \"\" : serializeLong(to_tt));\n\n    vector<PriceHistoryRow> row_list;\n    if (!price_history_->getMultiSlice(row_list, docid_list, from_str, to_str))\n    {\n        error_msg = \"Failed retrieving price histories from Cassandra\";\n        return false;\n    }\n\n    range_list.reserve(range_list.size() + row_list.size());\n    for (vector<PriceHistoryRow>::const_iterator it = row_list.begin();\n            it != row_list.end(); ++it)\n    {\n        const PriceHistory::PriceHistoryType& price_history = it->getPriceHistory();\n        ProductPrice range_item;\n        for (PriceHistory::PriceHistoryType::const_iterator hit = price_history.begin();\n                hit != price_history.end(); ++hit)\n        {\n            range_item += hit->second;\n        }\n        range_list.push_back(make_pair(it->getDocId(), range_item.value));\n    }\n\n    if (range_list.empty())\n    {\n        error_msg = \"Have not got any valid docid\";\n        return false;\n    }\n\n    return true;\n}\n\nbool ProductPriceTrend::GetTopPriceCutList(\n        TPCQueue& tpc_queue,\n        const string& prop_name,\n        const string& prop_value,\n        uint32_t days,\n        uint32_t count,\n        string& error_msg)\n{\n    if (!enable_tpc_)\n    {\n        error_msg = \"Top price-cut list is not enabled for this collection.\";\n        return false;\n    }\n\n    TPCStorage::const_iterator tpc_it = tpc_storage_.find(prop_name);\n    if (tpc_it == tpc_storage_.end())\n    {\n        error_msg = \"Don't find data for this property name: \" + prop_name;\n        return false;\n    }\n\n    uint32_t time_int = 0;\n    while (days > time_int_vec_[time_int++] && time_int < time_int_vec_.size() - 1);\n    if (!tpc_it->second[time_int]->get(prop_value, tpc_queue))\n    {\n        error_msg = \"Don't find price-cut record for this property value: \" + prop_value;\n        return false;\n    }\n\n    sort_heap(tpc_queue.begin(), tpc_queue.end(), rel_ops::operator><TPCQueue::value_type>);\n    if (tpc_queue.size() > count)\n        tpc_queue.resize(count);\n\n    return true;\n}\n\nbool ProductPriceTrend::MigratePriceHistory(\n        const string& new_keyspace,\n        const string& old_prefix,\n        const string& new_prefix,\n        uint32_t start,\n        string& error_msg)\n{\n    if (new_keyspace == cassandraConfig_.keyspace)\n        return true;\n\n    vector<string> docid_list;\n    docid_list.reserve(1000);\n    boost::shared_ptr<PriceHistory> new_price_history(new PriceHistory(new_keyspace));\n    new_price_history->createColumnFamily();\n\n    uint32_t count = 0;\n    for (uint32_t i = start; i <= document_manager_->getMaxDocId(); i++)\n    {\n        Document doc;\n        document_manager_->getDocument(i, doc);\n        Document::property_const_iterator kit = doc.findProperty(\"DOCID\");\n        if (kit == doc.propertyEnd())\n            continue;\n\n        const UString& key = kit->second.get<UString>();\n        docid_list.push_back(string());\n        key.convertString(docid_list.back(), UString::UTF_8);\n        if (!old_prefix.empty())\n        {\n            docid_list.back() = old_prefix + \"_\" + docid_list.back();\n        }\n\n        if (docid_list.size() == 1000)\n        {\n            vector<PriceHistoryRow> row_list;\n            if (!price_history_->getMultiSlice(row_list, docid_list))\n            {\n                error_msg = \"Can't get price history from Cassandra.\";\n                return false;\n            }\n\n            if (!old_prefix.empty())\n            {\n                std::size_t len = old_prefix.length() + 1;\n                if (!new_prefix.empty())\n                {\n                    for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                            it != row_list.end(); ++it)\n                    {\n                        it->setDocId(new_prefix + \"_\" + it->getDocId().substr(len));\n                    }\n                }\n                else\n                {\n                    for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                            it != row_list.end(); ++it)\n                    {\n                        it->setDocId(it->getDocId().substr(len));\n                    }\n                }\n            }\n            else if (!new_prefix.empty())\n            {\n                for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                        it != row_list.end(); ++it)\n                {\n                    it->setDocId(new_prefix + \"_\" + it->getDocId());\n                }\n            }\n\n            if (!new_price_history->updateMultiRow(row_list))\n            {\n                error_msg = \"Can't update price history to Cassandra.\";\n                return false;\n            }\n            docid_list.clear();\n        }\n\n        if (++count % 100000 == 0)\n        {\n            LOG(INFO) << \"Migrating price history: \" << count;\n        }\n    }\n\n    if (!docid_list.empty())\n    {\n        vector<PriceHistoryRow> row_list;\n        if (!price_history_->getMultiSlice(row_list, docid_list))\n        {\n            error_msg = \"Can't get price history from Cassandra.\";\n            return false;\n        }\n\n        if (!old_prefix.empty())\n        {\n            std::size_t len = old_prefix.length() + 1;\n            if (!new_prefix.empty())\n            {\n                for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                        it != row_list.end(); ++it)\n                {\n                    it->setDocId(new_prefix + \"_\" + it->getDocId().substr(len));\n                }\n            }\n            else\n            {\n                for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                        it != row_list.end(); ++it)\n                {\n                    it->setDocId(it->getDocId().substr(len));\n                }\n            }\n        }\n        else if (!new_prefix.empty())\n        {\n            for (vector<PriceHistoryRow>::iterator it = row_list.begin();\n                    it != row_list.end(); ++it)\n            {\n                it->setDocId(new_prefix + \"_\" + it->getDocId());\n            }\n        }\n        if (!new_price_history->updateMultiRow(row_list))\n        {\n            error_msg = \"Can't update price history to Cassandra.\";\n            return false;\n        }\n    }\n    LOG(INFO) << \"Successfully migrated price history for \" << count << \" products.\";\n\n    return true;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"tests-base.hpp\"\r\n\r\n#include \"utf8rewind.h\"\r\n\r\nextern \"C\" {\r\n\t#include \"..\/internal\/database.h\"\r\n};\r\n\r\n#include \"helpers-strings.hpp\"\r\n\r\nTEST(Utf8IsNormalizedDecompose, BasicLatinSingle)\r\n{\r\n\t\/*\r\n\t\tU+0053\r\n\t\t     Y\r\n\t\t     0\r\n\t*\/\r\n\r\n\tconst char* i = \"S\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE, &o));\r\n\tEXPECT_EQ(1, o);\r\n}\r\n\r\nTEST(Utf8IsNormalizedDecompose, BasicLatinMultiple)\r\n{\r\n\t\/*\r\n\t\tU+0050 U+006F U+006E U+0079\r\n\t\t     Y      Y      Y      Y\r\n\t\t     0      0      0      0\r\n\t*\/\r\n\r\n\tconst char* i = \"Pony\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE, &o));\r\n\tEXPECT_EQ(4, o);\r\n}\r\n\r\nTEST(Utf8IsNormalizedDecompose, BasicLatinCompatibility)\r\n{\r\n\t\/*\r\n\t\tU+0061 U+0072 U+0063 U+0068\r\n\t\t     Y      Y      Y      Y\r\n\t\t     0      0      0      0\r\n\t*\/\r\n\r\n\tconst char* i = \"arch\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE | UTF8_NORMALIZE_COMPATIBILITY, &o));\r\n\tEXPECT_EQ(4, o);\r\n}<commit_msg>suite-utf8-isnormalized-decompose: Added tests for multi-byte YES results.<commit_after>#include \"tests-base.hpp\"\r\n\r\n#include \"utf8rewind.h\"\r\n\r\nextern \"C\" {\r\n\t#include \"..\/internal\/database.h\"\r\n};\r\n\r\n#include \"helpers-strings.hpp\"\r\n\r\nTEST(Utf8IsNormalizedDecompose, BasicLatinSingle)\r\n{\r\n\t\/*\r\n\t\tU+0053\r\n\t\t     Y\r\n\t\t     0\r\n\t*\/\r\n\r\n\tconst char* i = \"S\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE, &o));\r\n\tEXPECT_EQ(1, o);\r\n}\r\n\r\nTEST(Utf8IsNormalizedDecompose, BasicLatinMultiple)\r\n{\r\n\t\/*\r\n\t\tU+0050 U+006F U+006E U+0079\r\n\t\t     Y      Y      Y      Y\r\n\t\t     0      0      0      0\r\n\t*\/\r\n\r\n\tconst char* i = \"Pony\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE, &o));\r\n\tEXPECT_EQ(4, o);\r\n}\r\n\r\nTEST(Utf8IsNormalizedDecompose, BasicLatinCompatibility)\r\n{\r\n\t\/*\r\n\t\tU+0061 U+0072 U+0063 U+0068\r\n\t\t     Y      Y      Y      Y\r\n\t\t     0      0      0      0\r\n\t*\/\r\n\r\n\tconst char* i = \"arch\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE | UTF8_NORMALIZE_COMPATIBILITY, &o));\r\n\tEXPECT_EQ(4, o);\r\n}\r\n\r\nTEST(Utf8IsNormalizedDecompose, MultiByteYesSingle)\r\n{\r\n\t\/*\r\n\t\tU+2205\r\n\t\t     Y\r\n\t\t     0\r\n\t*\/\r\n\r\n\tconst char* i = \"\\xE2\\x88\\x85\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE, &o));\r\n\tEXPECT_EQ(3, o);\r\n}\r\n\r\nTEST(Utf8IsNormalizedDecompose, MultiByteYesMultiple)\r\n{\r\n\t\/*\r\n\t\tU+21A9 U+225D U+21F0 U+0338\r\n\t\t     Y      Y      Y      Y\r\n\t\t     0      0      0      0\r\n\t*\/\r\n\r\n\tconst char* i = \"\\xE2\\x86\\xA9\\xE2\\x89\\x9D\\xE2\\x87\\xB0\\xCC\\xB8\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE, &o));\r\n\tEXPECT_EQ(11, o);\r\n}\r\n\r\nTEST(Utf8IsNormalizedDecompose, MultiByteYesUnordered)\r\n{\r\n\t\/*\r\n\t\tU+031A U+0F35 U+0328\r\n\t\t     Y      Y      Y\r\n\t\t   232    220    202\r\n\t*\/\r\n\r\n\tconst char* i = \"\\xCC\\x9A\\xE0\\xBC\\xB5\\xCC\\xA8\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_NO, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE, &o));\r\n\tEXPECT_EQ(7, o);\r\n}\r\n\r\nTEST(Utf8IsNormalizedDecompose, MultiByteYesCompatibility)\r\n{\r\n\t\/*\r\n\t\tU+027B U+05C0 U+07EB\r\n\t\t     Y      Y      Y\r\n\t\t     0      0    230\r\n\t*\/\r\n\r\n\tconst char* i = \"\\xC9\\xBB\\xD7\\x80\\xDF\\xAB\";\r\n\tsize_t is = strlen(i);\r\n\tsize_t o = 0;\r\n\r\n\tEXPECT_EQ(UTF8_NORMALIZATION_RESULT_YES, utf8isnormalized(i, is, UTF8_NORMALIZE_DECOMPOSE | UTF8_NORMALIZE_COMPATIBILITY, &o));\r\n\tEXPECT_EQ(6, o);\r\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Source position file\n * \n * This file is part of the \"XieXie-Compiler\" (Copyright (c) 2013 by Lukas Hermanns)\n * See \"LICENSE.txt\" for license information.\n *\/\n\n#include \"SourcePosition.h\"\n#include \"StringModifier.h\"\n\n\nnamespace SyntaxAnalyzer\n{\n\n\nconst SourcePosition SourcePosition::ignore;\n\nSourcePosition::SourcePosition(unsigned int row, unsigned int column) :\n    row_   ( row    ),\n    column_( column )\n{\n}\n\nstd::string SourcePosition::ToString() const\n{\n    return ToStr(row_) + \":\" + ToStr(column_);\n}\n\nvoid SourcePosition::IncRow()\n{\n    ++row_;\n    column_ = 0;\n}\nvoid SourcePosition::IncColumn()\n{\n    ++column_;\n}\n\nbool SourcePosition::IsValid() const\n{\n    return row_ > 0 && column_ > 0;\n}\n\nvoid SourcePosition::Reset()\n{\n    row_ = column_ = 0;\n}\n\n\n} \/\/ \/namespace SyntaxAnalyzer\n\n\n\n\/\/ ================================================================================<commit_msg>- Added adjustment to 'SourcePosition::ToString' column value for LL(k = 1) parser.<commit_after>\/*\n * Source position file\n * \n * This file is part of the \"XieXie-Compiler\" (Copyright (c) 2013 by Lukas Hermanns)\n * See \"LICENSE.txt\" for license information.\n *\/\n\n#include \"SourcePosition.h\"\n#include \"StringModifier.h\"\n\n\nnamespace SyntaxAnalyzer\n{\n\n\nconst SourcePosition SourcePosition::ignore;\n\nSourcePosition::SourcePosition(unsigned int row, unsigned int column) :\n    row_   ( row    ),\n    column_( column )\n{\n}\n\nstd::string SourcePosition::ToString() const\n{\n    return ToStr(row_) + \":\" + ToStr(column_ > 0 ? column_ - 1 : 0);\n}\n\nvoid SourcePosition::IncRow()\n{\n    ++row_;\n    column_ = 0;\n}\n\nvoid SourcePosition::IncColumn()\n{\n    ++column_;\n}\n\nbool SourcePosition::IsValid() const\n{\n    return row_ > 0 && column_ > 0;\n}\n\nvoid SourcePosition::Reset()\n{\n    row_ = column_ = 0;\n}\n\n\n} \/\/ \/namespace SyntaxAnalyzer\n\n\n\n\/\/ ================================================================================<|endoftext|>"}
{"text":"<commit_before>#include \"MQTTWrapper.h\"\n\nMQTTWrapper::MQTTWrapper(std::string id, std::string host, int port) : \n    mosqpp::mosquittopp(id.c_str(), false), host(host), port(port) {}\n\nvoid MQTTWrapper::begin(void) {\n    mosqpp::lib_init();\n    printf(\"Connecting to MQTT\\n\");\n    this->connect(this->host.c_str(), this->port, 60 \/* keepalive *\/);\n    this->subscribe(nullptr, \"\/sensornet\/in\/#\");\n}\n\nvoid MQTTWrapper::end(void) {\n    mosqpp::lib_cleanup();\n}\n\nvoid MQTTWrapper::loop(void) {\n  mosqpp::mosquittopp::loop();\n}\n\nvoid MQTTWrapper::send_message(std::string subject, std::string body) {\n    this->publish(nullptr, subject.c_str(), body.length(), body.c_str(), 0); \n}\n\nvoid MQTTWrapper::set_on_message_callback(on_msg_cb cb) {\n    this->cb = cb;\n}\n\nvoid MQTTWrapper::on_disconnect(int mid) {\n    printf(\"Disconnecting from MQTT\\n\");\n    this->end();\n    sleep(15);\n    this->begin();\n}\n\nvoid MQTTWrapper::on_message(const struct mosquitto_message *message) {\n    auto subject = std::string(message->topic);\n    auto body = std::string(reinterpret_cast<char *>(message->payload));\n    this->cb(subject, body);\n}\n<commit_msg>Use empty string if MQTT payload is empty<commit_after>#include \"MQTTWrapper.h\"\n\nMQTTWrapper::MQTTWrapper(std::string id, std::string host, int port) : \n    mosqpp::mosquittopp(id.c_str(), false), host(host), port(port) {}\n\nvoid MQTTWrapper::begin(void) {\n    mosqpp::lib_init();\n    printf(\"Connecting to MQTT\\n\");\n    this->connect(this->host.c_str(), this->port, 60 \/* keepalive *\/);\n    this->subscribe(nullptr, \"\/sensornet\/in\/#\");\n}\n\nvoid MQTTWrapper::end(void) {\n    mosqpp::lib_cleanup();\n}\n\nvoid MQTTWrapper::loop(void) {\n  mosqpp::mosquittopp::loop();\n}\n\nvoid MQTTWrapper::send_message(std::string subject, std::string body) {\n    this->publish(nullptr, subject.c_str(), body.length(), body.c_str(), 0); \n}\n\nvoid MQTTWrapper::set_on_message_callback(on_msg_cb cb) {\n    this->cb = cb;\n}\n\nvoid MQTTWrapper::on_disconnect(int mid) {\n    printf(\"Disconnecting from MQTT\\n\");\n    this->end();\n    sleep(15);\n    this->begin();\n}\n\nvoid MQTTWrapper::on_message(const struct mosquitto_message *message) {\n    auto subject = std::string(message->topic);\n    auto body = message->payloadlen > 0 ? \n        std::string(reinterpret_cast<char *>(message->payload)) : std::string(\"\");\n    this->cb(subject, body);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2019 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\/module_invocation.h\"\n\n#include \"absl\/memory\/memory.h\"\n#include \"asylo\/util\/logging.h\"\n#include \"oak\/common\/policy.h\"\n#include \"oak\/proto\/grpc_encap.pb.h\"\n#include \"oak\/proto\/policy.pb.h\"\n#include \"oak\/server\/channel.h\"\n\nnamespace oak {\n\nnamespace {\n\n\/\/ Copy the data from a gRPC ByteBuffer into a Message.\nstd::unique_ptr<Message> Unwrap(const grpc::ByteBuffer& buffer) {\n  std::vector<::grpc::Slice> slices;\n  grpc::Status status = buffer.Dump(&slices);\n  if (!status.ok()) {\n    LOG(QFATAL) << \"Could not unwrap buffer\";\n  }\n  auto msg = absl::make_unique<Message>();\n  for (const auto& slice : slices) {\n    msg->data.insert(msg->data.end(), slice.begin(), slice.end());\n  }\n  return msg;\n}\n\n}  \/\/ namespace\n\nvoid ModuleInvocation::Start() {\n  auto callback = new std::function<void(bool)>(\n      std::bind(&ModuleInvocation::ReadRequest, this, std::placeholders::_1));\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" Start: request service->RequestCall => ReadRequest\";\n  service_->RequestCall(&context_, &stream_, queue_, queue_, callback);\n}\n\nvoid ModuleInvocation::ReadRequest(bool ok) {\n  if (!ok) {\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" ReadRequest: not OK, terminating\";\n    delete this;\n    return;\n  }\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" ReadRequest: request stream->Read => ProcessRequest\";\n  auto callback = new std::function<void(bool)>(\n      std::bind(&ModuleInvocation::ProcessRequest, this, std::placeholders::_1));\n  stream_.Read(&request_, callback);\n\n  \/\/ Now that processing of this request has started, start watching out for the\n  \/\/ next request.\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" start next invocation\";\n  auto next_invocation = new ModuleInvocation(service_, queue_, grpc_node_);\n  next_invocation->Start();\n}\n\nvoid ModuleInvocation::ProcessRequest(bool ok) {\n  if (!ok) {\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" ProcessRequest: not OK, terminating\";\n    delete this;\n    return;\n  }\n  std::unique_ptr<Message> request_msg = Unwrap(request_);\n\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" ProcessRequest: handling gRPC call: \" << context_.method();\n  for (auto entry : context_.client_metadata()) {\n    auto key = entry.first;\n    auto value = entry.second;\n    \/\/ Redact authorization bearer tokens.\n    if (key == kOakAuthorizationBearerTokenGrpcMetadataKey) {\n      value = \"<redacted>\";\n    }\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" gRPC client metadata: [\" << key << \"] -> [\"\n              << value << \"]\";\n  }\n\n  \/\/ Build an encapsulation of the gRPC request invocation and put it in a Message.\n  oak::GrpcRequest grpc_request;\n  grpc_request.set_method_name(context_.method());\n  google::protobuf::Any* any = new google::protobuf::Any();\n  any->set_value(request_msg->data.data(), request_msg->data.size());\n  grpc_request.set_allocated_req_msg(any);\n  grpc_request.set_last(true);\n\n  std::unique_ptr<Message> req_msg = absl::make_unique<Message>();\n  size_t serialized_size = grpc_request.ByteSizeLong();\n  req_msg->data.resize(serialized_size);\n  grpc_request.SerializeToArray(req_msg->data.data(), req_msg->data.size());\n  {\n    auto range = context_.client_metadata().equal_range(kOakPolicyGrpcMetadataKey);\n    for (auto entry = range.first; entry != range.second; ++entry) {\n      std::string policy_base64(entry->second.data(), entry->second.size());\n      oak::policy::Label policy = DeserializePolicy(policy_base64);\n      \/\/ TODO(https:\/\/github.com\/project-oak\/oak\/issues\/306): Note that at the moment policies may\n      \/\/ refer to authentication bearer tokens, which if logged in this way may be reused by\n      \/\/ unauthorized parties. For now we are fine with this, eventually bearer tokens will be\n      \/\/ removed and replaced by public key assertions, in which case it will always be safe to log\n      \/\/ policies.\n      LOG(INFO) << \"invocation#\" << stream_id_ << \" Oak policy: \" << policy.DebugString();\n      req_msg->label = policy;\n    }\n  }\n  {\n    \/\/ TODO: Provide capability to declassify data for any authorization token provided.\n    auto range =\n        context_.client_metadata().equal_range(kOakAuthorizationBearerTokenGrpcMetadataKey);\n    for (auto entry = range.first; entry != range.second; ++entry) {\n      \/\/ Redact authorization bearer tokens.\n      LOG(INFO) << \"invocation#\" << stream_id_ << \" Oak Authorization Token: <redacted>\";\n    }\n  }\n\n  \/\/ Create a pair of channels for communication corresponding to this\n  \/\/ particular method invocation, one for sending in requests, and one for\n  \/\/ receiving responses.\n  MessageChannel::ChannelHalves req_halves = MessageChannel::Create();\n  req_half_ = std::move(req_halves.write);\n  MessageChannel::ChannelHalves rsp_halves = MessageChannel::Create();\n  rsp_half_ = std::move(rsp_halves.read);\n\n  \/\/ Build a notification message that just holds references to these two\n  \/\/ newly-created channels.\n  std::unique_ptr<Message> notify_msg = absl::make_unique<Message>();\n  notify_msg->channels.push_back(absl::make_unique<ChannelHalf>(std::move(req_halves.read)));\n  notify_msg->channels.push_back(absl::make_unique<ChannelHalf>(std::move(rsp_halves.write)));\n\n  \/\/ Write the request message to the just-created request channel.\n  req_half_->Write(std::move(req_msg));\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" ProcessRequest: Wrote encapsulated request to new gRPC request channel\";\n\n  \/\/ Write the notification message to the gRPC input channel, which the runtime\n  \/\/ connected to the Node.\n  MessageChannelWriteHalf* notify_half = grpc_node_->BorrowWriteChannel();\n  notify_half->Write(std::move(notify_msg));\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" ProcessRequest: Wrote notification request to gRPC input channel\";\n\n  \/\/ Move straight onto sending first response.\n  SendResponse(true);\n}\n\nvoid ModuleInvocation::SendResponse(bool ok) {\n  if (!ok) {\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: not OK, terminating\";\n    delete this;\n    return;\n  }\n\n  \/\/ Do the work of sending a response in a separate thread, because we may\n  \/\/ need to block (to wait for a streaming server response) and don't want\n  \/\/ to hold up the main completion queue thread.\n  std::thread other([this] { BlockingSendResponse(); });\n  other.detach();\n}\n\nvoid ModuleInvocation::BlockingSendResponse() {\n  ReadResult rsp_result;\n  \/\/ Block until we can read a single queued GrpcResponse message (in serialized form) from the\n  \/\/ gRPC output channel.\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: do blocking-read on grpc channel\";\n  rsp_result = rsp_half_->BlockingRead(INT_MAX, INT_MAX);\n  if (rsp_result.required_size > 0) {\n    LOG(ERROR) << \"invocation#\" << stream_id_\n               << \" SendResponse: Message size too large: \" << rsp_result.required_size;\n    FinishAndCleanUp(grpc::Status(grpc::StatusCode::INTERNAL, \"Message size too large\"));\n    return;\n  }\n\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: Read encapsulated message of size \"\n            << rsp_result.msg->data.size() << \" from gRPC output channel\";\n  oak::GrpcResponse grpc_response;\n  if (!grpc_response.ParseFromString(\n          std::string(rsp_result.msg->data.data(), rsp_result.msg->data.size()))) {\n    LOG(ERROR) << \"invocation#\" << stream_id_\n               << \" SendResponse: failed to parse encapsulated message\";\n    FinishAndCleanUp(grpc::Status(grpc::StatusCode::INTERNAL, \"Message failed to parse\"));\n    return;\n  }\n  \/\/ Any channel references included with the message will be dropped.\n\n  const grpc::string& inner_msg = grpc_response.rsp_msg().value();\n  grpc::Slice slice(inner_msg.data(), inner_msg.size());\n  grpc::ByteBuffer bb(&slice, \/*nslices=*\/1);\n\n  grpc::WriteOptions options;\n  if (!grpc_response.last()) {\n    \/\/ More response data is expected, so queue up another SendResponse action.\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: Non-final inner response of size \"\n              << inner_msg.size() << \", request stream->Write => SendResponse\";\n    auto callback = new std::function<void(bool)>(\n        std::bind(&ModuleInvocation::SendResponse, this, std::placeholders::_1));\n    stream_.Write(bb, options, callback);\n  } else if (!grpc_response.has_rsp_msg()) {\n    \/\/ Final iteration but no response, just Finish.\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: Final inner response empty\";\n    FinishAndCleanUp(::grpc::Status::OK);\n  } else {\n    \/\/ Final response, so WriteAndFinish.\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: Final inner response of size \"\n              << inner_msg.size() << \", request stream->WriteAndFinish => CleanUp\";\n    options.set_last_message();\n    auto callback = new std::function<void(bool)>(\n        std::bind(&ModuleInvocation::CleanUp, this, std::placeholders::_1));\n    stream_.WriteAndFinish(bb, options, ::grpc::Status::OK, callback);\n  }\n}\n\nvoid ModuleInvocation::CleanUp(bool \/*ok*\/) {\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" CleanUp: delete self\";\n  delete this;\n}\n\nvoid ModuleInvocation::FinishAndCleanUp(const grpc::Status& status) {\n  \/\/ Finish the current invocation (which triggers self-destruction).\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" FinishAndCleanUp: request stream->Finish => CleanUp\";\n  auto callback = new std::function<void(bool)>(\n      std::bind(&ModuleInvocation::CleanUp, this, std::placeholders::_1));\n  stream_.Finish(status, callback);\n}\n\n}  \/\/ namespace oak\n<commit_msg>runtime: pass gRPC response error status through<commit_after>\/*\n * Copyright 2019 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\/module_invocation.h\"\n\n#include \"absl\/memory\/memory.h\"\n#include \"asylo\/util\/logging.h\"\n#include \"oak\/common\/policy.h\"\n#include \"oak\/proto\/grpc_encap.pb.h\"\n#include \"oak\/proto\/policy.pb.h\"\n#include \"oak\/server\/channel.h\"\n\nnamespace oak {\n\nnamespace {\n\n\/\/ Copy the data from a gRPC ByteBuffer into a Message.\nstd::unique_ptr<Message> Unwrap(const grpc::ByteBuffer& buffer) {\n  std::vector<::grpc::Slice> slices;\n  grpc::Status status = buffer.Dump(&slices);\n  if (!status.ok()) {\n    LOG(QFATAL) << \"Could not unwrap buffer\";\n  }\n  auto msg = absl::make_unique<Message>();\n  for (const auto& slice : slices) {\n    msg->data.insert(msg->data.end(), slice.begin(), slice.end());\n  }\n  return msg;\n}\n\n}  \/\/ namespace\n\nvoid ModuleInvocation::Start() {\n  auto callback = new std::function<void(bool)>(\n      std::bind(&ModuleInvocation::ReadRequest, this, std::placeholders::_1));\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" Start: request service->RequestCall => ReadRequest\";\n  service_->RequestCall(&context_, &stream_, queue_, queue_, callback);\n}\n\nvoid ModuleInvocation::ReadRequest(bool ok) {\n  if (!ok) {\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" ReadRequest: not OK, terminating\";\n    delete this;\n    return;\n  }\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" ReadRequest: request stream->Read => ProcessRequest\";\n  auto callback = new std::function<void(bool)>(\n      std::bind(&ModuleInvocation::ProcessRequest, this, std::placeholders::_1));\n  stream_.Read(&request_, callback);\n\n  \/\/ Now that processing of this request has started, start watching out for the\n  \/\/ next request.\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" start next invocation\";\n  auto next_invocation = new ModuleInvocation(service_, queue_, grpc_node_);\n  next_invocation->Start();\n}\n\nvoid ModuleInvocation::ProcessRequest(bool ok) {\n  if (!ok) {\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" ProcessRequest: not OK, terminating\";\n    delete this;\n    return;\n  }\n  std::unique_ptr<Message> request_msg = Unwrap(request_);\n\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" ProcessRequest: handling gRPC call: \" << context_.method();\n  for (auto entry : context_.client_metadata()) {\n    auto key = entry.first;\n    auto value = entry.second;\n    \/\/ Redact authorization bearer tokens.\n    if (key == kOakAuthorizationBearerTokenGrpcMetadataKey) {\n      value = \"<redacted>\";\n    }\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" gRPC client metadata: [\" << key << \"] -> [\"\n              << value << \"]\";\n  }\n\n  \/\/ Build an encapsulation of the gRPC request invocation and put it in a Message.\n  oak::GrpcRequest grpc_request;\n  grpc_request.set_method_name(context_.method());\n  google::protobuf::Any* any = new google::protobuf::Any();\n  any->set_value(request_msg->data.data(), request_msg->data.size());\n  grpc_request.set_allocated_req_msg(any);\n  grpc_request.set_last(true);\n\n  std::unique_ptr<Message> req_msg = absl::make_unique<Message>();\n  size_t serialized_size = grpc_request.ByteSizeLong();\n  req_msg->data.resize(serialized_size);\n  grpc_request.SerializeToArray(req_msg->data.data(), req_msg->data.size());\n  {\n    auto range = context_.client_metadata().equal_range(kOakPolicyGrpcMetadataKey);\n    for (auto entry = range.first; entry != range.second; ++entry) {\n      std::string policy_base64(entry->second.data(), entry->second.size());\n      oak::policy::Label policy = DeserializePolicy(policy_base64);\n      \/\/ TODO(https:\/\/github.com\/project-oak\/oak\/issues\/306): Note that at the moment policies may\n      \/\/ refer to authentication bearer tokens, which if logged in this way may be reused by\n      \/\/ unauthorized parties. For now we are fine with this, eventually bearer tokens will be\n      \/\/ removed and replaced by public key assertions, in which case it will always be safe to log\n      \/\/ policies.\n      LOG(INFO) << \"invocation#\" << stream_id_ << \" Oak policy: \" << policy.DebugString();\n      req_msg->label = policy;\n    }\n  }\n  {\n    \/\/ TODO: Provide capability to declassify data for any authorization token provided.\n    auto range =\n        context_.client_metadata().equal_range(kOakAuthorizationBearerTokenGrpcMetadataKey);\n    for (auto entry = range.first; entry != range.second; ++entry) {\n      \/\/ Redact authorization bearer tokens.\n      LOG(INFO) << \"invocation#\" << stream_id_ << \" Oak Authorization Token: <redacted>\";\n    }\n  }\n\n  \/\/ Create a pair of channels for communication corresponding to this\n  \/\/ particular method invocation, one for sending in requests, and one for\n  \/\/ receiving responses.\n  MessageChannel::ChannelHalves req_halves = MessageChannel::Create();\n  req_half_ = std::move(req_halves.write);\n  MessageChannel::ChannelHalves rsp_halves = MessageChannel::Create();\n  rsp_half_ = std::move(rsp_halves.read);\n\n  \/\/ Build a notification message that just holds references to these two\n  \/\/ newly-created channels.\n  std::unique_ptr<Message> notify_msg = absl::make_unique<Message>();\n  notify_msg->channels.push_back(absl::make_unique<ChannelHalf>(std::move(req_halves.read)));\n  notify_msg->channels.push_back(absl::make_unique<ChannelHalf>(std::move(rsp_halves.write)));\n\n  \/\/ Write the request message to the just-created request channel.\n  req_half_->Write(std::move(req_msg));\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" ProcessRequest: Wrote encapsulated request to new gRPC request channel\";\n\n  \/\/ Write the notification message to the gRPC input channel, which the runtime\n  \/\/ connected to the Node.\n  MessageChannelWriteHalf* notify_half = grpc_node_->BorrowWriteChannel();\n  notify_half->Write(std::move(notify_msg));\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" ProcessRequest: Wrote notification request to gRPC input channel\";\n\n  \/\/ Move straight onto sending first response.\n  SendResponse(true);\n}\n\nvoid ModuleInvocation::SendResponse(bool ok) {\n  if (!ok) {\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: not OK, terminating\";\n    delete this;\n    return;\n  }\n\n  \/\/ Do the work of sending a response in a separate thread, because we may\n  \/\/ need to block (to wait for a streaming server response) and don't want\n  \/\/ to hold up the main completion queue thread.\n  std::thread other([this] { BlockingSendResponse(); });\n  other.detach();\n}\n\nvoid ModuleInvocation::BlockingSendResponse() {\n  ReadResult rsp_result;\n  \/\/ Block until we can read a single queued GrpcResponse message (in serialized form) from the\n  \/\/ gRPC output channel.\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: do blocking-read on grpc channel\";\n  rsp_result = rsp_half_->BlockingRead(INT_MAX, INT_MAX);\n  if (rsp_result.required_size > 0) {\n    LOG(ERROR) << \"invocation#\" << stream_id_\n               << \" SendResponse: Message size too large: \" << rsp_result.required_size;\n    FinishAndCleanUp(grpc::Status(grpc::StatusCode::INTERNAL, \"Message size too large\"));\n    return;\n  }\n\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: Read encapsulated message of size \"\n            << rsp_result.msg->data.size() << \" from gRPC output channel\";\n  oak::GrpcResponse grpc_response;\n  if (!grpc_response.ParseFromString(\n          std::string(rsp_result.msg->data.data(), rsp_result.msg->data.size()))) {\n    LOG(ERROR) << \"invocation#\" << stream_id_\n               << \" SendResponse: failed to parse encapsulated message\";\n    FinishAndCleanUp(grpc::Status(grpc::StatusCode::INTERNAL, \"Message failed to parse\"));\n    return;\n  }\n  \/\/ Any channel references included with the message will be dropped.\n\n  const grpc::string& inner_msg = grpc_response.rsp_msg().value();\n  grpc::Slice slice(inner_msg.data(), inner_msg.size());\n  grpc::ByteBuffer bb(&slice, \/*nslices=*\/1);\n\n  grpc::WriteOptions options;\n  if (!grpc_response.last()) {\n    \/\/ More response data is expected, so queue up another SendResponse action.\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: Non-final inner response of size \"\n              << inner_msg.size() << \", request stream->Write => SendResponse\";\n    auto callback = new std::function<void(bool)>(\n        std::bind(&ModuleInvocation::SendResponse, this, std::placeholders::_1));\n    stream_.Write(bb, options, callback);\n  } else if (!grpc_response.has_rsp_msg()) {\n    \/\/ Final iteration but no response, just Finish.\n    google::rpc::Status status = grpc_response.status();\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: Final inner response empty, status \"\n              << status.code();\n    FinishAndCleanUp(grpc::Status(static_cast<grpc::StatusCode>(status.code()), status.message()));\n  } else {\n    \/\/ Final response, so WriteAndFinish.\n    LOG(INFO) << \"invocation#\" << stream_id_ << \" SendResponse: Final inner response of size \"\n              << inner_msg.size() << \", request stream->WriteAndFinish => CleanUp\";\n    options.set_last_message();\n    auto callback = new std::function<void(bool)>(\n        std::bind(&ModuleInvocation::CleanUp, this, std::placeholders::_1));\n    stream_.WriteAndFinish(bb, options, ::grpc::Status::OK, callback);\n  }\n}\n\nvoid ModuleInvocation::CleanUp(bool \/*ok*\/) {\n  LOG(INFO) << \"invocation#\" << stream_id_ << \" CleanUp: delete self\";\n  delete this;\n}\n\nvoid ModuleInvocation::FinishAndCleanUp(const grpc::Status& status) {\n  \/\/ Finish the current invocation (which triggers self-destruction).\n  LOG(INFO) << \"invocation#\" << stream_id_\n            << \" FinishAndCleanUp: request stream->Finish => CleanUp\";\n  auto callback = new std::function<void(bool)>(\n      std::bind(&ModuleInvocation::CleanUp, this, std::placeholders::_1));\n  stream_.Finish(status, callback);\n}\n\n}  \/\/ namespace oak\n<|endoftext|>"}
{"text":"<commit_before>\/* ************************************************************************* *\/\n\/* This file is part of Shard.                                               *\/\n\/*                                                                           *\/\n\/* Shard 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.                                *\/\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 \"shard\/tokenizer\/Tokenizer.hpp\"\n\n\/* ************************************************************************* *\/\n\n\/\/ C++\n#include <algorithm>\n#include <cmath>\n#include <iostream>\n\n\/\/ Shard\n#include \"shard\/StaticArray.hpp\"\n\n\/* ************************************************************************* *\/\n\nnamespace shard {\ninline namespace v1 {\nnamespace tokenizer {\n\n\/* ************************************************************************* *\/\n\nnamespace\n{\n    static const StaticArray<std::pair<String, KeywordType>, KeywordTypeCount> g_keywordMap\n    {{\n    #define KEYWORD(name, str) { str, KeywordType::name },\n    #include \"shard\/tokenizer\/Token.def\"\n    }};\n\n    \/**\n     * @brief returns escaped char value.\n     *\/\n    static char getEscaped(const char value)\n    {\n        switch (value)\n        {\n            case '\"': return '\"';\n            case '\\'': return '\\'';\n            case '?': return '\\?';\n            case '\\\\': return '\\\\';\n            case '0': return '\\0';\n            case 'a': return '\\a';\n            case 'b': return '\\b';\n            case 'f': return '\\f';\n            case 'n': return '\\n';\n            case 'r': return '\\r';\n            case 't': return '\\t';\n            case 'v': return '\\v';\n            default: throw InvalidEscapeSequenceException();\n        }\n    }\n\n    static Token::IntType getNumericValue(char value)\n    {\n        switch (value)\n        {\n            case 'A':\n            case 'B':\n            case 'C':\n            case 'D':\n            case 'E':\n            case 'F': return value - 'A' + 10;\n            case 'a':\n            case 'b':\n            case 'c':\n            case 'd':\n            case 'e':\n            case 'f': return value - 'a' + 10;\n            default: return value - '0';\n        }\n    }\n}\n\n\/* ************************************************************************* *\/\n\nvoid Tokenizer::tokenizeNumber()\n{\n    bool floatFlag = false;\n    int digitSize = 0;\n    \n    const auto readNumber = [&](int base = 10) -> Token::IntType\n    {\n        digitSize = 0;\n        Token::IntType res = 0;\n        if (!isDigit(base))\n        {\n            throw ExpectedNumberException();\n        }\n        do\n        {\n            res = res * base + getNumericValue(m_src.extract());\n            ++digitSize;\n        }\n        while (isDigit(base));\n        return res;\n    };\n\n    if (is('0'))\n    {\n        switch(m_src.getNext())\n        {\n            case 'b':\n            case 'B': m_src.toss(); m_current = Token(readNumber(2)); return;\n            case 'x':\n            case 'X': m_src.toss(); m_current = Token(readNumber(16)); return;\n            case 'o':\n            case 'O': m_src.toss(); m_current = Token(readNumber(8)); return;\n            default: m_src.unget(); break;\n        }\n    }\n\n    Token::IntType base = readNumber();\n    \n    Token::FloatType decimal = 0;\n    if (match('.'))\n    {\n        floatFlag = true;\n        decimal = readNumber();\n        decimal = decimal \/ std::pow(10.0, digitSize);\n    }\n\n    Token::FloatType exp = 1;\n    if (match('e', 'E'))\n    {\n        floatFlag = true;\n        bool negativeExp = false;\n        switch (m_src.get())\n        {\n            case '-': negativeExp = true;\n            case '+': m_src.toss();\n            default: break;\n        }\n        exp = std::pow(10.0, readNumber());\n        exp = negativeExp ? (1 \/ exp) : exp;\n    }\n\n    Token::FloatType value = (static_cast<Token::FloatType>(base) + decimal) * exp;\n\n    m_current = floatFlag ? Token(value) : Token(base);\n}\n\nvoid Tokenizer::tokenizeString()\n{\n    String value;\n\n    while (!match(string_literal_border))\n    {\n        if (empty())\n        {\n            throw StringWithoutEndException();\n        }\n        if (match('\\\\'))\n        {\n            if (empty())\n            {\n                throw StringWithoutEndException();\n            }\n            value += getEscaped(m_src.extract());\n        }\n        else\n        {\n            value += m_src.extract();\n        }\n    }\n    \n    m_current = Token(TokenType::String, value);\n}\n\nvoid Tokenizer::tokenizeChar()\n{\n    Token::CharType value = m_src.extract();\n    if (value >= 0x80)\n    {\n        char additionalBytes;\n        if (value >= 0xF0)\n        {\n            value &= 0x07;\n            additionalBytes = 3;\n        }\n        else if (value >= 0xE0)\n        {\n            value &= 0x0F;\n            additionalBytes = 2;\n        }\n        else if (value >= 0xC0)\n        {\n            value &= 0x1F;\n            additionalBytes = 1;\n        }\n        for (char i = 0; i < additionalBytes; ++i)\n        {\n            value = (value << 6)|(m_src.extract() & 0x3F);\n        }\n    }\n    else\n    {\n        switch (value)\n        {\n            case '\\\\':\n            {\n                if (empty())\n                {\n                    throw CharWithoutEndException();\n                }\n                value = getEscaped(m_src.extract());\n                break;\n            }\n            case char_literal_border:\n            {\n                throw EmptyCharLiteralException();\n            }\n            default: break;\n        }\n    }\n    if (!match(char_literal_border))\n    {\n        throw CharWithoutEndException();\n    }\n    \n    m_current = Token(value);\n}\n\nvoid Tokenizer::tokenizeIdentifier() noexcept\n{\n    String value;\n    \n    do\n    {\n        value += m_src.extract();\n    }\n    while (isIdentifier());\n    auto search = std::find_if(\n        g_keywordMap.begin(), g_keywordMap.end(),\n        [&](const std::pair<String, KeywordType>& test){ return test.first == value; }\n    );\n    if (search != g_keywordMap.end())\n    {\n        m_current = Token(search->second);\n    }\n    else\n    {\n        m_current = Token(value);\n    }\n}\n\nvoid Tokenizer::tokenizeOperator()\n{\n    switch (char local = m_src.extract())\n    {\n        case '.': m_current = Token(TokenType::Period); break;\n        case ',': m_current = Token(TokenType::Comma); break;\n        case ':': m_current = Token(TokenType::Colon); break;\n        case ';': m_current = Token(TokenType::Semicolon); break;\n        case '{': m_current = Token(TokenType::BraceO); break;\n        case '}': m_current = Token(TokenType::BraceC); break;\n        case '[': m_current = Token(TokenType::SquareO); break;\n        case ']': m_current = Token(TokenType::SquareC); break;\n        case '(': m_current = Token(TokenType::ParenO); break;\n        case ')': m_current = Token(TokenType::ParenC); break;\n        case '?': m_current = Token(TokenType::QMark); break;\n        case '~': m_current = Token(TokenType::Tilde); break;\n        case '#': m_current = Token(TokenType::Hash); break;\n        case '\\\\': m_current = Token(TokenType::Backslash); break;\n        case '=':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::EqualEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Equal); break;\n            } break;\n        }\n        case '!':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::EMarkEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::EMark); break;\n            } break;\n        }\n        case '+':\n        {\n            switch (m_src.get())\n            {\n                case '+': m_current = Token(TokenType::PlusPlus); m_src.toss(); break;\n                case '=': m_current = Token(TokenType::PlusEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Plus); break;\n            } break;\n        }\n        case '-':\n        {\n            switch (m_src.get())\n            {\n                case '-': m_current = Token(TokenType::MinusMinus); m_src.toss(); break;\n                case '=': m_current = Token(TokenType::MinusEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Minus); break;\n            } break;\n        }\n        case '*':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::StarEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Star); break;\n            } break;\n        }\n        case '\/':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::SlashEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Slash); break;\n            } break;\n        }\n        case '^':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::CaretEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Caret); break;\n            } break;\n        }\n        case '%': \n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::PercentEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Equal); break;\n            } break;\n        }\n        case '&':\n        {\n            switch (m_src.get())\n            {\n                case '&':\n                {\n                    switch (m_src.getNext())\n                    {\n                        case '=': m_current = Token(TokenType::AmpAmpEqual); m_src.toss(); break;\n                        default: m_current = Token(TokenType::AmpAmp); break;\n                    } break;\n                }\n                case '=': m_current = Token(TokenType::AmpEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Amp); break;\n            } break;\n        }\n        case '|':\n        {\n            switch (m_src.get())\n            {\n                case '|':\n                {\n                    switch (m_src.getNext())\n                    {\n                        case '=': m_current = Token(TokenType::PipePipeEqual); m_src.toss(); break;\n                        default: m_current = Token(TokenType::PipePipe); break;\n                    } break;\n                }\n                case '=': m_current = Token(TokenType::PipeEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Pipe); break;\n            } break;\n        }\n        case '<':\n        {\n            switch (m_src.get())\n            {\n                case '<':\n                {\n                    switch (m_src.getNext())\n                    {\n                        case '=': m_current = Token(TokenType::LessLessEqual); m_src.toss(); break;\n                        default: m_current = Token(TokenType::LessLess); break;\n                    } break;\n                }\n                case '=': m_current = Token(TokenType::LessEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Less); break;\n            } break;\n        }\n        case '>':\n        {\n            switch (m_src.get())\n            {\n                case '>':\n                {\n                    switch (m_src.getNext())\n                    {\n                        case '=': m_current = Token(TokenType::GreaterGreaterEqual); m_src.toss(); break;\n                        default: m_current = Token(TokenType::GreaterGreater); break;\n                    } break;\n                }\n                case '=': m_current = Token(TokenType::GreaterEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Greater); break;\n            } break;\n        }\n        default: throw UnknownOperatorException(local);\n    }\n}\n\nvoid Tokenizer::next()\n{\n    skipWhitespace();\n    skipComments();\n    skipWhitespace();\n\n    if (empty())\n    {\n        m_current = Token(TokenType::End);\n    }\n    else if (match(string_literal_border))\n    {\n        tokenizeString();\n    }\n    else if (match(char_literal_border))\n    {\n        tokenizeChar();\n    }\n    else if (isDigit())\n    {\n        tokenizeNumber();\n    }\n    else if (isIdentifier())\n    {\n        tokenizeIdentifier();\n    }\n    else\n    {\n        tokenizeOperator();\n    }\n}\n\n\/* ************************************************************************* *\/\n\n}\n}\n}\n\n\/* ************************************************************************* *\/\n\n<commit_msg>some preparations for hexadecimal float feature<commit_after>\/* ************************************************************************* *\/\n\/* This file is part of Shard.                                               *\/\n\/*                                                                           *\/\n\/* Shard 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.                                *\/\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 \"shard\/tokenizer\/Tokenizer.hpp\"\n\n\/* ************************************************************************* *\/\n\n\/\/ C++\n#include <algorithm>\n#include <cmath>\n#include <iostream>\n\n\/\/ Shard\n#include \"shard\/StaticArray.hpp\"\n\n\/* ************************************************************************* *\/\n\nnamespace shard {\ninline namespace v1 {\nnamespace tokenizer {\n\n\/* ************************************************************************* *\/\n\nnamespace\n{\n    static const StaticArray<std::pair<String, KeywordType>, KeywordTypeCount> g_keywordMap\n    {{\n    #define KEYWORD(name, str) { str, KeywordType::name },\n    #include \"shard\/tokenizer\/Token.def\"\n    }};\n\n    \/**\n     * @brief returns escaped char value.\n     *\/\n    static char getEscaped(const char value)\n    {\n        switch (value)\n        {\n            case '\"': return '\"';\n            case '\\'': return '\\'';\n            case '?': return '\\?';\n            case '\\\\': return '\\\\';\n            case '0': return '\\0';\n            case 'a': return '\\a';\n            case 'b': return '\\b';\n            case 'f': return '\\f';\n            case 'n': return '\\n';\n            case 'r': return '\\r';\n            case 't': return '\\t';\n            case 'v': return '\\v';\n            default: throw InvalidEscapeSequenceException();\n        }\n    }\n\n    \/**\n     * @brief returns numeric value of character in hexadecimal base.\n     *\/\n    static Token::IntType getNumericValue(char value)\n    {\n        switch (value)\n        {\n            case 'A':\n            case 'B':\n            case 'C':\n            case 'D':\n            case 'E':\n            case 'F': return value - 'A' + 10;\n            case 'a':\n            case 'b':\n            case 'c':\n            case 'd':\n            case 'e':\n            case 'f': return value - 'a' + 10;\n            default: return value - '0';\n        }\n    }\n}\n\n\/* ************************************************************************* *\/\n\nvoid Tokenizer::tokenizeNumber()\n{\n    bool floatFlag = false;\n    int digitSize = 0;\n    int base = 10;\n    \n    const auto readNumber = [&]() -> Token::IntType\n    {\n        digitSize = 0;\n        if (!isDigit(base))\n        {\n            throw ExpectedNumberException();\n        }\n\n        Token::IntType res = 0;\n        do\n        {\n            res = res * base + getNumericValue(m_src.extract());\n            ++digitSize;\n        }\n        while (isDigit(base));\n        return res;\n    };\n\n    Token::IntType integer = readNumber();\n\n    if (integer == 0)\n    {\n        switch(m_src.extract())\n        {\n            case 'x':\n            case 'X': base = 16; m_current = Token(readNumber()); return;\n            case 'o':\n            case 'O': base = 8; m_current = Token(readNumber()); return;\n            case 'b':\n            case 'B': base = 2; m_current = Token(readNumber()); return;\n            default: break;\n        }\n    }\n    \n    Token::FloatType decimal = 0;\n    if (match('.'))\n    {\n        floatFlag = true;\n        decimal = readNumber();\n        decimal = decimal \/ std::pow(10.0, digitSize);\n    }\n\n    Token::FloatType exp = 1;\n    if (match('e', 'E'))\n    {\n        floatFlag = true;\n        bool negativeExp = false;\n        switch (m_src.get())\n        {\n            case '-': negativeExp = true;\n            case '+': m_src.toss();\n            default: break;\n        }\n        exp = std::pow(10.0, readNumber());\n        exp = negativeExp ? (1 \/ exp) : exp;\n    }\n\n    Token::FloatType value = (static_cast<Token::FloatType>(integer) + decimal) * exp;\n\n    m_current = floatFlag ? Token(value) : Token(integer);\n}\n\nvoid Tokenizer::tokenizeString()\n{\n    String value;\n\n    while (!match(string_literal_border))\n    {\n        if (empty())\n        {\n            throw StringWithoutEndException();\n        }\n        if (match('\\\\'))\n        {\n            if (empty())\n            {\n                throw StringWithoutEndException();\n            }\n            value += getEscaped(m_src.extract());\n        }\n        else\n        {\n            value += m_src.extract();\n        }\n    }\n    \n    m_current = Token(TokenType::String, value);\n}\n\nvoid Tokenizer::tokenizeChar()\n{\n    Token::CharType value = m_src.extract();\n    if (value >= 0x80)\n    {\n        char additionalBytes;\n        if (value >= 0xF0)\n        {\n            value &= 0x07;\n            additionalBytes = 3;\n        }\n        else if (value >= 0xE0)\n        {\n            value &= 0x0F;\n            additionalBytes = 2;\n        }\n        else if (value >= 0xC0)\n        {\n            value &= 0x1F;\n            additionalBytes = 1;\n        }\n        for (char i = 0; i < additionalBytes; ++i)\n        {\n            value = (value << 6)|(m_src.extract() & 0x3F);\n        }\n    }\n    else\n    {\n        switch (value)\n        {\n            case '\\\\':\n            {\n                if (empty())\n                {\n                    throw CharWithoutEndException();\n                }\n                value = getEscaped(m_src.extract());\n                break;\n            }\n            case char_literal_border:\n            {\n                throw EmptyCharLiteralException();\n            }\n            default: break;\n        }\n    }\n    if (!match(char_literal_border))\n    {\n        throw CharWithoutEndException();\n    }\n    \n    m_current = Token(value);\n}\n\nvoid Tokenizer::tokenizeIdentifier() noexcept\n{\n    String value;\n    \n    do\n    {\n        value += m_src.extract();\n    }\n    while (isIdentifier());\n    auto search = std::find_if(\n        g_keywordMap.begin(), g_keywordMap.end(),\n        [&](const std::pair<String, KeywordType>& test){ return test.first == value; }\n    );\n    if (search != g_keywordMap.end())\n    {\n        m_current = Token(search->second);\n    }\n    else\n    {\n        m_current = Token(value);\n    }\n}\n\nvoid Tokenizer::tokenizeOperator()\n{\n    switch (char local = m_src.extract())\n    {\n        case '.': m_current = Token(TokenType::Period); break;\n        case ',': m_current = Token(TokenType::Comma); break;\n        case ':': m_current = Token(TokenType::Colon); break;\n        case ';': m_current = Token(TokenType::Semicolon); break;\n        case '{': m_current = Token(TokenType::BraceO); break;\n        case '}': m_current = Token(TokenType::BraceC); break;\n        case '[': m_current = Token(TokenType::SquareO); break;\n        case ']': m_current = Token(TokenType::SquareC); break;\n        case '(': m_current = Token(TokenType::ParenO); break;\n        case ')': m_current = Token(TokenType::ParenC); break;\n        case '?': m_current = Token(TokenType::QMark); break;\n        case '~': m_current = Token(TokenType::Tilde); break;\n        case '#': m_current = Token(TokenType::Hash); break;\n        case '\\\\': m_current = Token(TokenType::Backslash); break;\n        case '=':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::EqualEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Equal); break;\n            } break;\n        }\n        case '!':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::EMarkEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::EMark); break;\n            } break;\n        }\n        case '+':\n        {\n            switch (m_src.get())\n            {\n                case '+': m_current = Token(TokenType::PlusPlus); m_src.toss(); break;\n                case '=': m_current = Token(TokenType::PlusEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Plus); break;\n            } break;\n        }\n        case '-':\n        {\n            switch (m_src.get())\n            {\n                case '-': m_current = Token(TokenType::MinusMinus); m_src.toss(); break;\n                case '=': m_current = Token(TokenType::MinusEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Minus); break;\n            } break;\n        }\n        case '*':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::StarEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Star); break;\n            } break;\n        }\n        case '\/':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::SlashEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Slash); break;\n            } break;\n        }\n        case '^':\n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::CaretEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Caret); break;\n            } break;\n        }\n        case '%': \n        {\n            switch (m_src.get())\n            {\n                case '=': m_current = Token(TokenType::PercentEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Equal); break;\n            } break;\n        }\n        case '&':\n        {\n            switch (m_src.get())\n            {\n                case '&':\n                {\n                    switch (m_src.getNext())\n                    {\n                        case '=': m_current = Token(TokenType::AmpAmpEqual); m_src.toss(); break;\n                        default: m_current = Token(TokenType::AmpAmp); break;\n                    } break;\n                }\n                case '=': m_current = Token(TokenType::AmpEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Amp); break;\n            } break;\n        }\n        case '|':\n        {\n            switch (m_src.get())\n            {\n                case '|':\n                {\n                    switch (m_src.getNext())\n                    {\n                        case '=': m_current = Token(TokenType::PipePipeEqual); m_src.toss(); break;\n                        default: m_current = Token(TokenType::PipePipe); break;\n                    } break;\n                }\n                case '=': m_current = Token(TokenType::PipeEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Pipe); break;\n            } break;\n        }\n        case '<':\n        {\n            switch (m_src.get())\n            {\n                case '<':\n                {\n                    switch (m_src.getNext())\n                    {\n                        case '=': m_current = Token(TokenType::LessLessEqual); m_src.toss(); break;\n                        default: m_current = Token(TokenType::LessLess); break;\n                    } break;\n                }\n                case '=': m_current = Token(TokenType::LessEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Less); break;\n            } break;\n        }\n        case '>':\n        {\n            switch (m_src.get())\n            {\n                case '>':\n                {\n                    switch (m_src.getNext())\n                    {\n                        case '=': m_current = Token(TokenType::GreaterGreaterEqual); m_src.toss(); break;\n                        default: m_current = Token(TokenType::GreaterGreater); break;\n                    } break;\n                }\n                case '=': m_current = Token(TokenType::GreaterEqual); m_src.toss(); break;\n                default: m_current = Token(TokenType::Greater); break;\n            } break;\n        }\n        default: throw UnknownOperatorException(local);\n    }\n}\n\nvoid Tokenizer::next()\n{\n    skipWhitespace();\n    skipComments();\n    skipWhitespace();\n\n    if (empty())\n    {\n        m_current = Token(TokenType::End);\n    }\n    else if (match(string_literal_border))\n    {\n        tokenizeString();\n    }\n    else if (match(char_literal_border))\n    {\n        tokenizeChar();\n    }\n    else if (isDigit())\n    {\n        tokenizeNumber();\n    }\n    else if (isIdentifier())\n    {\n        tokenizeIdentifier();\n    }\n    else\n    {\n        tokenizeOperator();\n    }\n}\n\n\/* ************************************************************************* *\/\n\n}\n}\n}\n\n\/* ************************************************************************* *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/! \\file\n\/*\n**  Copyright (C) - Triton\n**\n**  This program is under the terms of the LGPLv3 License.\n*\/\n\n#include <iostream>\n#include \"snapshot.hpp\"\n\n\n\nnamespace tracer {\n  namespace pintool {\n\n      Snapshot::Snapshot() {\n        this->locked              = true;\n        this->snapshotTaintEngine = nullptr;\n        this->snapshotSymEngine   = nullptr;\n        this->mustBeRestore       = false;\n      }\n\n\n      Snapshot::~Snapshot() {\n      }\n\n\n      \/* Add the modification byte. *\/\n      void Snapshot::addModification(triton::__uint mem, char byte) {\n        if (this->locked == false && this->memory.find(mem) == this->memory.end())\n          this->memory[mem] = byte;\n      }\n\n\n      \/* Enable the snapshot engine. *\/\n      void Snapshot::takeSnapshot(CONTEXT *ctx) {\n        \/* 1 - Unlock the engine *\/\n        this->locked = false;\n\n        \/* 2 - Save current symbolic engine state *\/\n        this->snapshotSymEngine = new triton::engines::symbolic::SymbolicEngine(*triton::api.getSymbolicEngine());\n\n        \/* 3 - Save current taint engine state *\/\n        this->snapshotTaintEngine = new triton::engines::taint::TaintEngine(*triton::api.getTaintEngine());\n\n        \/* 4 - Save current taint engine state *\/\n        this->nodesList = triton::smt2lib::allocatedNodes;\n\n        \/* 5 - Save the Triton CPU state *\/\n        #if defined(__x86_64__) || defined(_M_X64)\n        this->cpu = new triton::arch::x86::x8664Cpu(*reinterpret_cast<triton::arch::x86::x8664Cpu*>(triton::api.getCpu()));\n        #endif\n        #if defined(__i386) || defined(_M_IX86)\n        this->cpu = new triton::arch::x86::x86Cpu(*reinterpret_cast<triton::arch::x86::x86Cpu*>(triton::api.getCpu()));\n        #endif\n\n        \/* 6 - Save Pin registers context *\/\n        PIN_SaveContext(ctx, &this->pinCtx);\n      }\n\n\n      \/* Restore the snapshot. *\/\n      void Snapshot::restoreSnapshot(CONTEXT *ctx) {\n\n        if (this->mustBeRestore == false)\n          return;\n\n        \/* 1 - Restore all memory modification. *\/\n        for(auto i = this->memory.begin(); i != this->memory.end(); ++i){\n          *(reinterpret_cast<char*>(i->first)) = i->second;\n        }\n        this->memory.clear();\n\n        \/* 2 - Delete unused expressions *\/\n        auto currentExpressions     = triton::api.getSymbolicExpressions();\n        auto snapshotExpressions    = this->snapshotSymEngine->getSymbolicExpressions();\n        triton::__uint currentSize  = currentExpressions.size();\n        triton::__uint snapshotSize = snapshotExpressions.size();\n        for (auto i = currentExpressions.begin(); i != currentExpressions.end(); ++i) {\n          if (snapshotExpressions.find(i->first) == snapshotExpressions.end())\n            delete currentExpressions[i->first];\n        }\n\n        \/* 3 - Delete unused variables *\/\n        auto currentSymbolicVars   = triton::api.getSymbolicVariables();\n        auto snapshotSymbolicVars  = this->snapshotSymEngine->getSymbolicVariables();\n        currentSize                = currentSymbolicVars.size();\n        snapshotSize               = snapshotSymbolicVars.size();\n        for (auto i = currentSymbolicVars.begin(); i != currentSymbolicVars.end(); ++i) {\n          if (snapshotSymbolicVars.find(i->first) == snapshotSymbolicVars.end())\n            delete currentSymbolicVars[i->first];\n        }\n\n        \/* 4 - Delete unused AST nodes *\/\n        for (auto i = triton::smt2lib::allocatedNodes.begin(); i != triton::smt2lib::allocatedNodes.end(); ++i) {\n          if (this->nodesList.find(*i) == this->nodesList.end())\n            delete *i;\n        }\n\n        \/* 5 - Restore current symbolic engine state *\/\n        *triton::api.getSymbolicEngine() = *this->snapshotSymEngine;\n\n        \/* 6 - Restore current taint engine state *\/\n        *triton::api.getTaintEngine() = *this->snapshotTaintEngine;\n\n        \/* 7 - Restore current AST node state *\/\n        triton::smt2lib::allocatedNodes = this->nodesList;\n\n        \/* 8 - Restore the Triton CPU state *\/\n        #if defined(__x86_64__) || defined(_M_X64)\n        *reinterpret_cast<triton::arch::x86::x8664Cpu*>(triton::api.getCpu()) = *this->cpu;\n        #endif\n        #if defined(__i386) || defined(_M_IX86)\n        *reinterpret_cast<triton::arch::x86::x86Cpu*>(triton::api.getCpu()) = *this->cpu;\n        #endif\n\n        \/* 9 - Restore Pin registers context *\/\n        PIN_SaveContext(&this->pinCtx, ctx);\n\n        this->mustBeRestore = false;\n        PIN_UnlockClient();\n        PIN_ExecuteAt(ctx);\n      }\n\n\n      \/* Disable the snapshot engine. *\/\n      void Snapshot::disableSnapshot(void) {\n        this->locked = true;\n      }\n\n\n      \/* Reset the snapshot engine.\n       * Clear all backups for a new snapshot. *\/\n      void Snapshot::resetEngine(void) {\n        this->memory.clear();\n\n        delete this->snapshotSymEngine;\n        this->snapshotSymEngine = nullptr;\n\n        delete this->snapshotTaintEngine;\n        this->snapshotTaintEngine = nullptr;\n      }\n\n\n      \/* Check if the snapshot engine is locked. *\/\n      bool Snapshot::isLocked(void) {\n        return this->locked;\n      }\n\n\n      CONTEXT *Snapshot::getCtx(void) {\n        return &this->pinCtx;\n      }\n\n\n      \/* Check if we must restore the snapshot *\/\n      bool Snapshot::mustBeRestored(void) {\n        return this->mustBeRestore;\n      }\n\n\n      \/* Check if we must restore the snapshot *\/\n      void Snapshot::setRestore(bool flag) {\n        this->mustBeRestore = flag;\n      }\n\n  };\n};\n<commit_msg>Add doc<commit_after>\/\/! \\file\n\/*\n**  Copyright (C) - Triton\n**\n**  This program is under the terms of the LGPLv3 License.\n*\/\n\n#include <iostream>\n#include \"snapshot.hpp\"\n\n\n\n\/*! \\page Snapshot_page Snapshot\n    \\brief [**pintool internal**] All information about the snapshot engine.\n\n\\tableofcontents\n\\section snapshot_description Description\n<hr>\n\nThe pintool shipped in this project (see \\ref Tracer_page) allows the user to replay a trace. During the execution, it is possible to\ntake a snapshot of the registers and memory states. Then, at each program point, it is possible to restore the previous snapshot.\n\n<b>Example<\/b>: Imagine a trace with a `LOAD` value, this value is controllable by the user. Then, some operations are applied to this value\nand at the end the value is verified with a constant. At the compare instruction the formula of the operation applied to the value is\nbuilt, by assigning a symbolic variable to the input value, it is possible to solve the formula (if it is satisfiable). So, it will\nbe useful to directly inject the model returned by the solver in memory instead of re-run the program.\n\n<p align=\"center\"><img src=\"http:\/\/triton.quarkslab.com\/files\/triton_snapshot.svg\"\/><\/p>\n\n\nAs taking a snapshot of the full memory is not really possible, the pintool saves all bytes before each modification of the memory (`STORE` access)\nin a map \\f$ \\langle addr, byte \\rangle \\f$.\n\nWhen the snapshot must be restored, all modifications are re-injected in memory like this: \\f$ \\forall (addr, byte \\in map) : *addr \\gets byte \\f$\n\n*\/\n\n\n\nnamespace tracer {\n  namespace pintool {\n\n      Snapshot::Snapshot() {\n        this->locked              = true;\n        this->snapshotTaintEngine = nullptr;\n        this->snapshotSymEngine   = nullptr;\n        this->mustBeRestore       = false;\n      }\n\n\n      Snapshot::~Snapshot() {\n      }\n\n\n      \/* Add the modification byte. *\/\n      void Snapshot::addModification(triton::__uint mem, char byte) {\n        if (this->locked == false && this->memory.find(mem) == this->memory.end())\n          this->memory[mem] = byte;\n      }\n\n\n      \/* Enable the snapshot engine. *\/\n      void Snapshot::takeSnapshot(CONTEXT *ctx) {\n        \/* 1 - Unlock the engine *\/\n        this->locked = false;\n\n        \/* 2 - Save current symbolic engine state *\/\n        this->snapshotSymEngine = new triton::engines::symbolic::SymbolicEngine(*triton::api.getSymbolicEngine());\n\n        \/* 3 - Save current taint engine state *\/\n        this->snapshotTaintEngine = new triton::engines::taint::TaintEngine(*triton::api.getTaintEngine());\n\n        \/* 4 - Save current taint engine state *\/\n        this->nodesList = triton::smt2lib::allocatedNodes;\n\n        \/* 5 - Save the Triton CPU state *\/\n        #if defined(__x86_64__) || defined(_M_X64)\n        this->cpu = new triton::arch::x86::x8664Cpu(*reinterpret_cast<triton::arch::x86::x8664Cpu*>(triton::api.getCpu()));\n        #endif\n        #if defined(__i386) || defined(_M_IX86)\n        this->cpu = new triton::arch::x86::x86Cpu(*reinterpret_cast<triton::arch::x86::x86Cpu*>(triton::api.getCpu()));\n        #endif\n\n        \/* 6 - Save Pin registers context *\/\n        PIN_SaveContext(ctx, &this->pinCtx);\n      }\n\n\n      \/* Restore the snapshot. *\/\n      void Snapshot::restoreSnapshot(CONTEXT *ctx) {\n\n        if (this->mustBeRestore == false)\n          return;\n\n        \/* 1 - Restore all memory modification. *\/\n        for(auto i = this->memory.begin(); i != this->memory.end(); ++i){\n          *(reinterpret_cast<char*>(i->first)) = i->second;\n        }\n        this->memory.clear();\n\n        \/* 2 - Delete unused expressions *\/\n        auto currentExpressions     = triton::api.getSymbolicExpressions();\n        auto snapshotExpressions    = this->snapshotSymEngine->getSymbolicExpressions();\n        triton::__uint currentSize  = currentExpressions.size();\n        triton::__uint snapshotSize = snapshotExpressions.size();\n        for (auto i = currentExpressions.begin(); i != currentExpressions.end(); ++i) {\n          if (snapshotExpressions.find(i->first) == snapshotExpressions.end())\n            delete currentExpressions[i->first];\n        }\n\n        \/* 3 - Delete unused variables *\/\n        auto currentSymbolicVars   = triton::api.getSymbolicVariables();\n        auto snapshotSymbolicVars  = this->snapshotSymEngine->getSymbolicVariables();\n        currentSize                = currentSymbolicVars.size();\n        snapshotSize               = snapshotSymbolicVars.size();\n        for (auto i = currentSymbolicVars.begin(); i != currentSymbolicVars.end(); ++i) {\n          if (snapshotSymbolicVars.find(i->first) == snapshotSymbolicVars.end())\n            delete currentSymbolicVars[i->first];\n        }\n\n        \/* 4 - Delete unused AST nodes *\/\n        for (auto i = triton::smt2lib::allocatedNodes.begin(); i != triton::smt2lib::allocatedNodes.end(); ++i) {\n          if (this->nodesList.find(*i) == this->nodesList.end())\n            delete *i;\n        }\n\n        \/* 5 - Restore current symbolic engine state *\/\n        *triton::api.getSymbolicEngine() = *this->snapshotSymEngine;\n\n        \/* 6 - Restore current taint engine state *\/\n        *triton::api.getTaintEngine() = *this->snapshotTaintEngine;\n\n        \/* 7 - Restore current AST node state *\/\n        triton::smt2lib::allocatedNodes = this->nodesList;\n\n        \/* 8 - Restore the Triton CPU state *\/\n        #if defined(__x86_64__) || defined(_M_X64)\n        *reinterpret_cast<triton::arch::x86::x8664Cpu*>(triton::api.getCpu()) = *this->cpu;\n        #endif\n        #if defined(__i386) || defined(_M_IX86)\n        *reinterpret_cast<triton::arch::x86::x86Cpu*>(triton::api.getCpu()) = *this->cpu;\n        #endif\n\n        \/* 9 - Restore Pin registers context *\/\n        PIN_SaveContext(&this->pinCtx, ctx);\n\n        this->mustBeRestore = false;\n        PIN_UnlockClient();\n        PIN_ExecuteAt(ctx);\n      }\n\n\n      \/* Disable the snapshot engine. *\/\n      void Snapshot::disableSnapshot(void) {\n        this->locked = true;\n      }\n\n\n      \/* Reset the snapshot engine.\n       * Clear all backups for a new snapshot. *\/\n      void Snapshot::resetEngine(void) {\n        this->memory.clear();\n\n        delete this->snapshotSymEngine;\n        this->snapshotSymEngine = nullptr;\n\n        delete this->snapshotTaintEngine;\n        this->snapshotTaintEngine = nullptr;\n      }\n\n\n      \/* Check if the snapshot engine is locked. *\/\n      bool Snapshot::isLocked(void) {\n        return this->locked;\n      }\n\n\n      CONTEXT *Snapshot::getCtx(void) {\n        return &this->pinCtx;\n      }\n\n\n      \/* Check if we must restore the snapshot *\/\n      bool Snapshot::mustBeRestored(void) {\n        return this->mustBeRestore;\n      }\n\n\n      \/* Check if we must restore the snapshot *\/\n      void Snapshot::setRestore(bool flag) {\n        this->mustBeRestore = flag;\n      }\n\n  };\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"qtfirebasemessaging.h\"\n\n#include <QPointer>\n#include <QGuiApplication>\n#include <QQmlParserStatus>\n\n#include <QMutexLocker>\n\n#include <stdint.h>\n#include \"firebase\/app.h\"\n#include \"firebase\/internal\/common.h\"\n#include \"firebase\/messaging.h\"\n#include \"firebase\/util.h\"\n\nnamespace messaging = ::firebase::messaging;\n\nQtFirebaseMessaging *QtFirebaseMessaging::self = nullptr;\n\nQtFirebaseMessaging::QtFirebaseMessaging(QObject* parent)\n    : QObject(parent)\n    , _ready(false)\n    , _hasMissingDependency(false)\n    , _initializing(false)\n    , __QTFIREBASE_ID(QString().asprintf(\"%8p\", static_cast<void*> (this)))\n    , g_listener(new MessageListener(this))\n    , _data()\n    , _token()\n{\n    if(!self) {\n        self = this;\n        qDebug() << self << \"::QtFirebaseMessaging\" << \"singleton\";\n    }\n\n    if(qFirebase->ready()) {\n        \/\/Call init outside of constructor, otherwise signal readyChanged not emited\n        QTimer::singleShot(100, this, &QtFirebaseMessaging::init);\n    } else {\n        connect(qFirebase,&QtFirebase::readyChanged, this, &QtFirebaseMessaging::init);\n        qFirebase->requestInit();\n    }\n\n    connect(qFirebase,&QtFirebase::futureEvent, this, &QtFirebaseMessaging::onFutureEvent);\n}\n\nQtFirebaseMessaging::~QtFirebaseMessaging()\n{\n    if(_ready) {\n        messaging::Terminate();\n    }\n}\n\nvoid QtFirebaseMessaging::classBegin()\n{\n}\n\nvoid QtFirebaseMessaging::componentComplete()\n{\n    \/\/ Connect on componentComplete so the signals are emited in the correct order\n    connect(g_listener, &MessageListener::onMessageReceived, this, &QtFirebaseMessaging::getMessage);\n    connect(g_listener, &MessageListener::onTokenReceived, this, &QtFirebaseMessaging::getToken);\n}\n\nbool QtFirebaseMessaging::checkInstance(const char *function)\n{\n    const bool b = (QtFirebaseMessaging::self != nullptr);\n    if (!b)\n        qWarning(\"QtFirebaseMessaging::%s: Please instantiate the QtFirebaseMessaging object first\", function);\n    return b;\n}\n\nvoid QtFirebaseMessaging::init()\n{\n    if(!qFirebase->ready()) {\n        qDebug() << self << \"::init\" << \"base not ready\";\n        return;\n    }\n\n    if(!_ready && !_initializing) {\n        _initializing = true;\n\n        auto initResult = messaging::Initialize(*qFirebase->firebaseApp(), g_listener);\n        if(firebase::kInitResultFailedMissingDependency == initResult)\n            setHasMissingDependency(true);\n\n        _initializing = false;\n\n        if(firebase::kInitResultSuccess != initResult)\n            return;\n\n        setReady(true);\n#if QTFIREBASE_FIREBASE_VERSION >= QTFIREBASE_FIREBASE_VERSION_CHECK(7, 0, 0)\n#if !defined(Q_OS_DARWIN) \/\/ https:\/\/firebase.google.com\/docs\/cloud-messaging\/ios\/client#method_swizzling_in\n        QPointer<QtFirebaseMessaging> self { this };\n\n        \/\/ firebase::messaging::Listener::OnTokenReceived() may not be called on second app launch\n        auto future = messaging::GetToken();\n        future.OnCompletion([self, future](const firebase::FutureBase &){\n            if(!self)\n                return;\n            if(future.result())\n                self->setToken(QString::fromStdString(*future.result()));\n        });\n#endif\n#endif\n    }\n}\n\nvoid QtFirebaseMessaging::onFutureEvent(const QString &eventId, const firebase::FutureBase &future)\n{\n    if(!eventId.startsWith(__QTFIREBASE_ID))\n        return;\n\n    qDebug() << self << \"::onFutureEvent\" << eventId;\n\n    if(future.status() != firebase::kFutureStatusComplete)\n    {\n        qDebug() << this << \"::onFutureEvent initializing failed.\" << \"ERROR: Action failed with error code and message: \" << future.error() << future.error_message();\n        _initializing = false;\n        return;\n    }\n    qDebug() << this << \"::onFutureEvent initialized ok\";\n    _initializing = false;\n}\n\nvoid QtFirebaseMessaging::getMessage()\n{\n    setData(g_listener->data());\n}\n\nvoid QtFirebaseMessaging::getToken()\n{\n    setToken(g_listener->token());\n}\n\nbool QtFirebaseMessaging::ready()\n{\n    return _ready;\n}\n\nvoid QtFirebaseMessaging::setReady(bool ready)\n{\n    if (_ready != ready) {\n        _ready = ready;\n        emit readyChanged();\n    }\n}\n\nbool QtFirebaseMessaging::hasMissingDependency()\n{\n    return _hasMissingDependency;\n}\n\nvoid QtFirebaseMessaging::setHasMissingDependency(bool hasMissingDependency)\n{\n    if (_hasMissingDependency != hasMissingDependency) {\n        _hasMissingDependency = hasMissingDependency;\n        emit hasMissingDependencyChanged();\n    }\n}\n\nQVariantMap QtFirebaseMessaging::data()\n{\n    return _data;\n}\n\nvoid QtFirebaseMessaging::setData(const QVariantMap &data)\n{\n    if (_data != data) {\n        _data = data;\n        emit dataChanged();\n        emit messageReceived();\n    }\n}\n\nQString QtFirebaseMessaging::token()\n{\n    QMutexLocker lock { &_tokenMutex };\n    return _token;\n}\n\nvoid QtFirebaseMessaging::setToken(const QString &token)\n{\n    QMutexLocker lock { &_tokenMutex };\n    if (_token != token) {\n        _token = token;\n        lock.unlock();\n\n        emit tokenChanged();\n    }\n}\n\nvoid QtFirebaseMessaging::subscribe(const QString &topic)\n{\n    if(!_ready) {\n        qDebug() << this << \"::subscribe native part not ready\";\n        return;\n    }\n\n    \/\/ TODO queue these futures so repeated calls don't get lost\n    auto result = firebase::messaging::Subscribe(topic.toUtf8());\n\n    result.OnCompletion([this, topic](const firebase::FutureBase &completed_future){\n        if(completed_future.error() == firebase::messaging::kErrorNone) {\n            emit subscribed(topic);\n        } else {\n            emit error(completed_future.error(), QString(QString::fromUtf8(completed_future.error_message())));\n        }\n    });\n}\n\nvoid QtFirebaseMessaging::unsubscribe(const QString &topic)\n{\n    if(!_ready) {\n        qDebug() << this << \"::unsubscribe native part not ready\";\n        return;\n    }\n\n    \/\/ TODO queue these futures so repeated calls don't get lost\n    auto result = firebase::messaging::Unsubscribe(topic.toUtf8());\n\n    result.OnCompletion([this, topic](const firebase::FutureBase &completed_future){\n        if(completed_future.error() == firebase::messaging::kErrorNone) {\n            emit unsubscribed(topic);\n        } else {\n            emit error(completed_future.error(), QString(QString::fromUtf8(completed_future.error_message())));\n        }\n    });\n}\n\nMessageListener::MessageListener(QObject* parent)\n    : QObject(parent)\n{\n}\n\nvoid MessageListener::OnMessage(const messaging::Message &message)\n{\n    \/\/ When messages are received by the server, they are placed into an\n    \/\/ internal queue, waiting to be consumed. When ProcessMessages is called,\n    \/\/ this OnMessage function is called once for each queued message.\n\n    QVariantMap data;\n\n    if (message.notification) {\n        if (!message.notification->title.empty()) {\n            const QString key = QStringLiteral(\"nTitle\");\n            const QString value = QString::fromStdString(message.notification->title.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->body.empty()) {\n            const QString key = QStringLiteral(\"nBody\");\n            const QString value = QString::fromStdString(message.notification->body.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->icon.empty()) {\n            const QString key = QStringLiteral(\"nIcon\");\n            const QString value = QString::fromStdString(message.notification->icon.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->tag.empty()) {\n            const QString key = QStringLiteral(\"nTag\");\n            const QString value = QString::fromStdString(message.notification->tag.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->color.empty()) {\n            const QString key = QStringLiteral(\"nColor\");\n            const QString value = QString::fromStdString(message.notification->color.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->sound.empty()) {\n            const QString key = QStringLiteral(\"nSound\");\n            const QString value = QString::fromStdString(message.notification->sound.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->click_action.empty()) {\n            const QString key = QStringLiteral(\"nClickAction\");\n            const QString value = QString::fromStdString(message.notification->click_action.c_str());\n            data.insert(key, value);\n        }\n    }\n\n    if (message.notification_opened) {\n        const QString key = QStringLiteral(\"launchnotification\");\n        data.insert(key, true);\n    }\n\n    for (const auto& field : message.data)\n    {\n        const QString key = QString::fromStdString(field.first);\n        const QString value = QString::fromStdString(field.second);\n\n        data.insert(key, value);\n    }\n\n    setData(data);\n}\n\nvoid MessageListener::OnTokenReceived(const char *token)\n{\n    setToken(QString::fromUtf8(token));\n}\n\nvoid MessageListener::connectNotify(const QMetaMethod &signal)\n{\n    if (signal == QMetaMethod::fromSignal(&MessageListener::onMessageReceived)) {\n        _messageReceivedConnected = true;\n\n        if(_notifyMessageReceived) {\n            emit onMessageReceived();\n            _notifyMessageReceived = false;\n        }\n    }\n\n    if (signal == QMetaMethod::fromSignal(&MessageListener::onTokenReceived)) {\n        _tokenReceivedConnected = true;\n\n        if(_notifyTokenReceived) {\n            emit onTokenReceived();\n            _notifyTokenReceived = false;\n        }\n    }\n}\n\nQVariantMap MessageListener::data()\n{\n    return _data;\n}\n\nvoid MessageListener::setData(const QVariantMap &data)\n{\n    if (_data != data) {\n        _notifyMessageReceived = true;\n        _data = data;\n\n        if(_messageReceivedConnected) {\n            emit onMessageReceived();\n            _notifyMessageReceived = false;\n        }\n    }\n}\n\nQString MessageListener::token()\n{\n    QMutexLocker lock { &_tokenMutex };\n    return _token;\n}\n\nvoid MessageListener::setToken(const QString &token)\n{\n    QMutexLocker lock { &_tokenMutex };\n    if (_token != token) {\n        _token = token;\n        lock.unlock();\n\n        _notifyTokenReceived = true;\n\n        if(_tokenReceivedConnected) {\n            emit onTokenReceived();\n            _notifyTokenReceived = false;\n        }\n    }\n}\n<commit_msg>Messaging: Fix token against Firebase C++ SDK 8.6.0 on Android<commit_after>#include \"qtfirebasemessaging.h\"\n\n#include <QPointer>\n#include <QGuiApplication>\n#include <QQmlParserStatus>\n\n#include <QMutexLocker>\n\n#include <stdint.h>\n#include \"firebase\/app.h\"\n#include \"firebase\/internal\/common.h\"\n#include \"firebase\/messaging.h\"\n#include \"firebase\/util.h\"\n\nnamespace messaging = ::firebase::messaging;\n\nQtFirebaseMessaging *QtFirebaseMessaging::self = nullptr;\n\nQtFirebaseMessaging::QtFirebaseMessaging(QObject* parent)\n    : QObject(parent)\n    , _ready(false)\n    , _hasMissingDependency(false)\n    , _initializing(false)\n    , __QTFIREBASE_ID(QString().asprintf(\"%8p\", static_cast<void*> (this)))\n    , g_listener(new MessageListener(this))\n    , _data()\n    , _token()\n{\n    if(!self) {\n        self = this;\n        qDebug() << self << \"::QtFirebaseMessaging\" << \"singleton\";\n    }\n\n    if(qFirebase->ready()) {\n        \/\/Call init outside of constructor, otherwise signal readyChanged not emited\n        QTimer::singleShot(100, this, &QtFirebaseMessaging::init);\n    } else {\n        connect(qFirebase,&QtFirebase::readyChanged, this, &QtFirebaseMessaging::init);\n        qFirebase->requestInit();\n    }\n\n    connect(qFirebase,&QtFirebase::futureEvent, this, &QtFirebaseMessaging::onFutureEvent);\n}\n\nQtFirebaseMessaging::~QtFirebaseMessaging()\n{\n    if(_ready) {\n        messaging::Terminate();\n    }\n}\n\nvoid QtFirebaseMessaging::classBegin()\n{\n}\n\nvoid QtFirebaseMessaging::componentComplete()\n{\n    \/\/ Connect on componentComplete so the signals are emited in the correct order\n    connect(g_listener, &MessageListener::onMessageReceived, this, &QtFirebaseMessaging::getMessage);\n    connect(g_listener, &MessageListener::onTokenReceived, this, &QtFirebaseMessaging::getToken);\n}\n\nbool QtFirebaseMessaging::checkInstance(const char *function)\n{\n    const bool b = (QtFirebaseMessaging::self != nullptr);\n    if (!b)\n        qWarning(\"QtFirebaseMessaging::%s: Please instantiate the QtFirebaseMessaging object first\", function);\n    return b;\n}\n\nvoid QtFirebaseMessaging::init()\n{\n    if(!qFirebase->ready()) {\n        qDebug() << self << \"::init\" << \"base not ready\";\n        return;\n    }\n\n    if(!_ready && !_initializing) {\n        _initializing = true;\n\n        auto initResult = messaging::Initialize(*qFirebase->firebaseApp(), g_listener);\n        if(firebase::kInitResultFailedMissingDependency == initResult)\n            setHasMissingDependency(true);\n\n        _initializing = false;\n\n        if(firebase::kInitResultSuccess != initResult)\n            return;\n\n        setReady(true);\n#if (QTFIREBASE_FIREBASE_VERSION >= QTFIREBASE_FIREBASE_VERSION_CHECK(7, 0, 0)) && (QTFIREBASE_FIREBASE_VERSION < QTFIREBASE_FIREBASE_VERSION_CHECK(8, 6, 0))\n#if defined(Q_OS_ANDROID) \/\/ https:\/\/github.com\/firebase\/firebase-cpp-sdk\/pull\/667\n        QPointer<QtFirebaseMessaging> self { this };\n\n        \/\/ firebase::messaging::Listener::OnTokenReceived() may not be called on second app launch\n        auto future = messaging::GetToken();\n        future.OnCompletion([self, future](const firebase::FutureBase &){\n            if(!self)\n                return;\n            if(future.result())\n                self->setToken(QString::fromStdString(*future.result()));\n        });\n#endif\n#endif\n    }\n}\n\nvoid QtFirebaseMessaging::onFutureEvent(const QString &eventId, const firebase::FutureBase &future)\n{\n    if(!eventId.startsWith(__QTFIREBASE_ID))\n        return;\n\n    qDebug() << self << \"::onFutureEvent\" << eventId;\n\n    if(future.status() != firebase::kFutureStatusComplete)\n    {\n        qDebug() << this << \"::onFutureEvent initializing failed.\" << \"ERROR: Action failed with error code and message: \" << future.error() << future.error_message();\n        _initializing = false;\n        return;\n    }\n    qDebug() << this << \"::onFutureEvent initialized ok\";\n    _initializing = false;\n}\n\nvoid QtFirebaseMessaging::getMessage()\n{\n    setData(g_listener->data());\n}\n\nvoid QtFirebaseMessaging::getToken()\n{\n    setToken(g_listener->token());\n}\n\nbool QtFirebaseMessaging::ready()\n{\n    return _ready;\n}\n\nvoid QtFirebaseMessaging::setReady(bool ready)\n{\n    if (_ready != ready) {\n        _ready = ready;\n        emit readyChanged();\n    }\n}\n\nbool QtFirebaseMessaging::hasMissingDependency()\n{\n    return _hasMissingDependency;\n}\n\nvoid QtFirebaseMessaging::setHasMissingDependency(bool hasMissingDependency)\n{\n    if (_hasMissingDependency != hasMissingDependency) {\n        _hasMissingDependency = hasMissingDependency;\n        emit hasMissingDependencyChanged();\n    }\n}\n\nQVariantMap QtFirebaseMessaging::data()\n{\n    return _data;\n}\n\nvoid QtFirebaseMessaging::setData(const QVariantMap &data)\n{\n    if (_data != data) {\n        _data = data;\n        emit dataChanged();\n        emit messageReceived();\n    }\n}\n\nQString QtFirebaseMessaging::token()\n{\n    QMutexLocker lock { &_tokenMutex };\n    return _token;\n}\n\nvoid QtFirebaseMessaging::setToken(const QString &token)\n{\n    QMutexLocker lock { &_tokenMutex };\n    if (_token != token) {\n        _token = token;\n        lock.unlock();\n\n        emit tokenChanged();\n    }\n}\n\nvoid QtFirebaseMessaging::subscribe(const QString &topic)\n{\n    if(!_ready) {\n        qDebug() << this << \"::subscribe native part not ready\";\n        return;\n    }\n\n    \/\/ TODO queue these futures so repeated calls don't get lost\n    auto result = firebase::messaging::Subscribe(topic.toUtf8());\n\n    result.OnCompletion([this, topic](const firebase::FutureBase &completed_future){\n        if(completed_future.error() == firebase::messaging::kErrorNone) {\n            emit subscribed(topic);\n        } else {\n            emit error(completed_future.error(), QString(QString::fromUtf8(completed_future.error_message())));\n        }\n    });\n}\n\nvoid QtFirebaseMessaging::unsubscribe(const QString &topic)\n{\n    if(!_ready) {\n        qDebug() << this << \"::unsubscribe native part not ready\";\n        return;\n    }\n\n    \/\/ TODO queue these futures so repeated calls don't get lost\n    auto result = firebase::messaging::Unsubscribe(topic.toUtf8());\n\n    result.OnCompletion([this, topic](const firebase::FutureBase &completed_future){\n        if(completed_future.error() == firebase::messaging::kErrorNone) {\n            emit unsubscribed(topic);\n        } else {\n            emit error(completed_future.error(), QString(QString::fromUtf8(completed_future.error_message())));\n        }\n    });\n}\n\nMessageListener::MessageListener(QObject* parent)\n    : QObject(parent)\n{\n}\n\nvoid MessageListener::OnMessage(const messaging::Message &message)\n{\n    \/\/ When messages are received by the server, they are placed into an\n    \/\/ internal queue, waiting to be consumed. When ProcessMessages is called,\n    \/\/ this OnMessage function is called once for each queued message.\n\n    QVariantMap data;\n\n    if (message.notification) {\n        if (!message.notification->title.empty()) {\n            const QString key = QStringLiteral(\"nTitle\");\n            const QString value = QString::fromStdString(message.notification->title.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->body.empty()) {\n            const QString key = QStringLiteral(\"nBody\");\n            const QString value = QString::fromStdString(message.notification->body.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->icon.empty()) {\n            const QString key = QStringLiteral(\"nIcon\");\n            const QString value = QString::fromStdString(message.notification->icon.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->tag.empty()) {\n            const QString key = QStringLiteral(\"nTag\");\n            const QString value = QString::fromStdString(message.notification->tag.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->color.empty()) {\n            const QString key = QStringLiteral(\"nColor\");\n            const QString value = QString::fromStdString(message.notification->color.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->sound.empty()) {\n            const QString key = QStringLiteral(\"nSound\");\n            const QString value = QString::fromStdString(message.notification->sound.c_str());\n            data.insert(key, value);\n        }\n        if (!message.notification->click_action.empty()) {\n            const QString key = QStringLiteral(\"nClickAction\");\n            const QString value = QString::fromStdString(message.notification->click_action.c_str());\n            data.insert(key, value);\n        }\n    }\n\n    if (message.notification_opened) {\n        const QString key = QStringLiteral(\"launchnotification\");\n        data.insert(key, true);\n    }\n\n    for (const auto& field : message.data)\n    {\n        const QString key = QString::fromStdString(field.first);\n        const QString value = QString::fromStdString(field.second);\n\n        data.insert(key, value);\n    }\n\n    setData(data);\n}\n\nvoid MessageListener::OnTokenReceived(const char *token)\n{\n    setToken(QString::fromUtf8(token));\n}\n\nvoid MessageListener::connectNotify(const QMetaMethod &signal)\n{\n    if (signal == QMetaMethod::fromSignal(&MessageListener::onMessageReceived)) {\n        _messageReceivedConnected = true;\n\n        if(_notifyMessageReceived) {\n            emit onMessageReceived();\n            _notifyMessageReceived = false;\n        }\n    }\n\n    if (signal == QMetaMethod::fromSignal(&MessageListener::onTokenReceived)) {\n        _tokenReceivedConnected = true;\n\n        if(_notifyTokenReceived) {\n            emit onTokenReceived();\n            _notifyTokenReceived = false;\n        }\n    }\n}\n\nQVariantMap MessageListener::data()\n{\n    return _data;\n}\n\nvoid MessageListener::setData(const QVariantMap &data)\n{\n    if (_data != data) {\n        _notifyMessageReceived = true;\n        _data = data;\n\n        if(_messageReceivedConnected) {\n            emit onMessageReceived();\n            _notifyMessageReceived = false;\n        }\n    }\n}\n\nQString MessageListener::token()\n{\n    QMutexLocker lock { &_tokenMutex };\n    return _token;\n}\n\nvoid MessageListener::setToken(const QString &token)\n{\n    QMutexLocker lock { &_tokenMutex };\n    if (_token != token) {\n        _token = token;\n        lock.unlock();\n\n        _notifyTokenReceived = true;\n\n        if(_tokenReceivedConnected) {\n            emit onTokenReceived();\n            _notifyTokenReceived = false;\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=============================================================================\n\n    This file is part of FLINT.\n\n    FLINT 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    FLINT is distributed in the hope that it 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 FLINT; if not, write to the Free Software\n    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA\n\n=============================================================================*\/\n\/******************************************************************************\n\n    Copyright (C) 2013 Tom Bachmann\n\n******************************************************************************\/\n\n#include <sstream>\n\n#include \"flintxx\/vector.h\"\n\n#include \"flintxx\/test\/helpers.h\"\n#include \"flintxx\/test\/myint.h\"\n#include \"fmpz_vecxx.h\"\n\nusing namespace flint;\n\ntemplate<class Vec, class Tuple>\nstruct tuple_has\n    : mp::or_<\n          mp::equal_types<Vec, typename Tuple::head_t>,\n          tuple_has<Vec, typename Tuple::tail_t> > { };\ntemplate<class Vec>\nstruct tuple_has<Vec, empty_tuple> : mp::false_ { };\n\ntemplate<class Vec, class Expr>\nbool has_vector_temporaries(const Expr& e)\n{\n    return tuple_has<Vec*, typename Expr::ev_traits_t::rule_t::temporaries_t>::val;\n}\n\ntemplate<class Vec>\nvoid test(const Vec& original, const char* str = \"(0, 1, 2, 3, 4, 5, 6, 7, 8, 9)\")\n{\n    Vec v(original);\n    Vec w(original);\n    Vec u(original);\n    Vec x(original);\n    for(long i = 0;i < v.size();++i)\n    {\n        v[i] = i;\n        w[i] = WORD(0);\n        u[i] = 2*i;\n        x[i] = 8*i;\n    }\n    tassert(v.to_string() == str);\n    tassert(v == v);\n    tassert(v != w);\n\n    tassert(u == v + v);\n    tassert(v == v + w);\n    tassert(x == ((v + v) + (v + v)) + ((v + v) + (v + v)));\n    tassert((v + w)[0] == v[0] + w[0]);\n\n    if(!mp::equal_types<Vec, fmpz_vecxx>::val)\n        tassert(!has_vector_temporaries<Vec>(\n                    ((v + v) + (v + v)) + ((v + v) + (v + v))));\n}\n\n\/\/ b\/c generic vector has no assignment implementation ...\nvoid\ntest_fmpz_vecxx()\n{\n    fmpz_vecxx a(10), b(10);\n    a[0] = 1;\n    tassert(a != b);\n    a = b;\n    tassert(a == b);\n}\n\nint\nmain()\n{\n    std::cout << \"vector....\";\n\n    typedef make_vector<myint>::type intvec;\n    typedef make_vector_n<myint, 10>::type intvec10;\n\n    test(intvec(10));\n    test(intvec10());\n    test(fmpz_vecxx(10), \"10  0 1 2 3 4 5 6 7 8 9\");\n    test_fmpz_vecxx();\n\n    std::cout << \"PASS\" << std::endl;\n\n    return 0;\n}\n<commit_msg>Another long.<commit_after>\/*=============================================================================\n\n    This file is part of FLINT.\n\n    FLINT 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    FLINT is distributed in the hope that it 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 FLINT; if not, write to the Free Software\n    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA\n\n=============================================================================*\/\n\/******************************************************************************\n\n    Copyright (C) 2013 Tom Bachmann\n\n******************************************************************************\/\n\n#include <sstream>\n\n#include \"flintxx\/vector.h\"\n\n#include \"flintxx\/test\/helpers.h\"\n#include \"flintxx\/test\/myint.h\"\n#include \"fmpz_vecxx.h\"\n\nusing namespace flint;\n\ntemplate<class Vec, class Tuple>\nstruct tuple_has\n    : mp::or_<\n          mp::equal_types<Vec, typename Tuple::head_t>,\n          tuple_has<Vec, typename Tuple::tail_t> > { };\ntemplate<class Vec>\nstruct tuple_has<Vec, empty_tuple> : mp::false_ { };\n\ntemplate<class Vec, class Expr>\nbool has_vector_temporaries(const Expr& e)\n{\n    return tuple_has<Vec*, typename Expr::ev_traits_t::rule_t::temporaries_t>::val;\n}\n\ntemplate<class Vec>\nvoid test(const Vec& original, const char* str = \"(0, 1, 2, 3, 4, 5, 6, 7, 8, 9)\")\n{\n    Vec v(original);\n    Vec w(original);\n    Vec u(original);\n    Vec x(original);\n    for(slong i = 0;i < v.size();++i)\n    {\n        v[i] = i;\n        w[i] = WORD(0);\n        u[i] = 2*i;\n        x[i] = 8*i;\n    }\n    tassert(v.to_string() == str);\n    tassert(v == v);\n    tassert(v != w);\n\n    tassert(u == v + v);\n    tassert(v == v + w);\n    tassert(x == ((v + v) + (v + v)) + ((v + v) + (v + v)));\n    tassert((v + w)[0] == v[0] + w[0]);\n\n    if(!mp::equal_types<Vec, fmpz_vecxx>::val)\n        tassert(!has_vector_temporaries<Vec>(\n                    ((v + v) + (v + v)) + ((v + v) + (v + v))));\n}\n\n\/\/ b\/c generic vector has no assignment implementation ...\nvoid\ntest_fmpz_vecxx()\n{\n    fmpz_vecxx a(10), b(10);\n    a[0] = 1;\n    tassert(a != b);\n    a = b;\n    tassert(a == b);\n}\n\nint\nmain()\n{\n    std::cout << \"vector....\";\n\n    typedef make_vector<myint>::type intvec;\n    typedef make_vector_n<myint, 10>::type intvec10;\n\n    test(intvec(10));\n    test(intvec10());\n    test(fmpz_vecxx(10), \"10  0 1 2 3 4 5 6 7 8 9\");\n    test_fmpz_vecxx();\n\n    std::cout << \"PASS\" << std::endl;\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2016 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 Kaveh Vahedipour\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Job.h\"\n\nstatic std::string const DBServer = \"DBServer\";\n\nusing namespace arangodb::consensus;\n\nbool arangodb::consensus::compareServerLists(Slice plan, Slice current) {\n  if (!plan.isArray() || !current.isArray()) {\n    return false;\n  }\n  std::vector<std::string> planv, currv;\n  for (auto const& srv : VPackArrayIterator(plan)) {\n    if (srv.isString()) {\n      planv.push_back(srv.copyString());\n    }\n  }\n  for (auto const& srv : VPackArrayIterator(current)) {\n    if (srv.isString()) {\n      currv.push_back(srv.copyString());\n    }\n  }\n  bool equalLeader = !planv.empty() && !currv.empty() &&\n                     planv.front() == currv.front();\n  std::sort(planv.begin(), planv.end());\n  std::sort(currv.begin(), currv.end());\n  return equalLeader && currv == planv;\n}\n\nJob::Job(JOB_STATUS status, Node const& snapshot, AgentInterface* agent,\n         std::string const& jobId, std::string const& creator)\n  : _status(status),\n    _snapshot(snapshot),\n    _agent(agent),\n    _jobId(jobId),\n    _creator(creator),\n    _jb(nullptr) {\n}\n\nJob::~Job() {}\n\n\/\/ this will be initialized in the AgencyFeature\nstd::string Job::agencyPrefix = \"\/arango\";\n\nbool Job::finish(\n  std::string const& server, std::string const& shard,\n  bool success, std::string const& reason, query_t const payload) {\n  \n  Builder pending, finished;\n  \n  \/\/ Get todo entry\n  bool started = false;\n  { VPackArrayBuilder guard(&pending);\n    if (_snapshot.exists(pendingPrefix + _jobId).size() == 3) {\n      _snapshot(pendingPrefix + _jobId).toBuilder(pending);\n      started = true;\n    } else if (_snapshot.exists(toDoPrefix + _jobId).size() == 3) {\n      _snapshot(toDoPrefix + _jobId).toBuilder(pending);\n    } else {\n      LOG_TOPIC(DEBUG, Logger::AGENCY)\n        << \"Nothing in pending to finish up for job \" << _jobId;\n      return false;\n    }\n  }\n\n  std::string jobType;\n  try {\n    jobType = pending.slice()[0].get(\"type\").copyString();\n  } catch (std::exception const&) {\n    LOG_TOPIC(WARN, Logger::AGENCY)\n      << \"Failed to obtain type of job \" << _jobId;\n  }\n  \n  \/\/ Prepare pending entry, block toserver\n  { VPackArrayBuilder guard(&finished);\n    VPackObjectBuilder guard2(&finished);\n\n    addPutJobIntoSomewhere(finished, success ? \"Finished\" : \"Failed\",\n                           pending.slice()[0], reason);\n\n    addRemoveJobFromSomewhere(finished, \"ToDo\", _jobId);\n    addRemoveJobFromSomewhere(finished, \"Pending\", _jobId);\n\n    \/\/ Additional payload, which is to be executed in the finish transaction\n    if (payload != nullptr) {\n      Slice slice = payload->slice();\n      TRI_ASSERT(slice.isObject());\n      if (slice.length() > 0) {\n        for (auto const& oper : VPackObjectIterator(slice)) {\n          finished.add(oper.key.copyString(), oper.value);\n        }\n      }\n    }\n\n    \/\/ --- Remove blocks if specified:\n    if (started && !server.empty()) {\n      addReleaseServer(finished, server);\n    }\n    if (started && !shard.empty()) {\n      addReleaseShard(finished, shard);\n    }\n    \n  }  \/\/ close object and array\n\n  write_ret_t res = singleWriteTransaction(_agent, finished);\n  if (res.accepted && res.indices.size() == 1 && res.indices[0]) {\n    LOG_TOPIC(DEBUG, Logger::AGENCY)\n      << \"Successfully finished job \" << jobType << \"(\" << _jobId << \")\";\n    _status = (success ? FINISHED : FAILED);\n    return true;\n  }\n\n  return false;\n}\n\n\n\nstd::string Job::randomIdleGoodAvailableServer(\n  Node const& snap, std::vector<std::string> const& exclude) {\n\n  std::vector<std::string> as = availableServers(snap);\n  std::string ret;\n  auto ex(exclude);\n\n  \/\/ ungood;\n  try {\n    for (auto const& srv : snap(healthPrefix).children()) {\n      if ((*srv.second)(\"Status\").toJson() != \"GOOD\") {\n        ex.push_back(srv.first);\n      }\n    }\n  } catch (...) {}\n  \n  \/\/ blocked;\n  try {\n    for (auto const& srv : snap(blockedServersPrefix).children()) {\n      ex.push_back(srv.first);\n    }\n  } catch (...) {}\n \n\n  \/\/ Remove excluded servers\n  std::sort(std::begin(ex), std::end(ex));\n  as.erase(\n    std::remove_if(\n      std::begin(as),std::end(as),\n      [&](std::string const& s){\n        return std::binary_search(\n          std::begin(ex), std::end(ex), s);}), std::end(as));\n  \n  \/\/ Choose random server from rest\n  if (!as.empty()) {\n    if (as.size() > 1) {\n      std::random_shuffle(as.begin(), as.end());\n    }\n    ret = as.front();\n  }\n\n  return ret;\n  \n}\n\n\nstd::string Job::randomIdleGoodAvailableServer(Node const& snap,\n                                               Slice const& exclude) {\n\n  std::vector<std::string> ev;\n  if (exclude.isArray()) {\n    for (const auto& s : VPackArrayIterator(exclude)) {\n      if (s.isString()) {\n        ev.push_back(s.copyString());\n      }\n    }\n  }\n  return randomIdleGoodAvailableServer(snap,ev);\n\n}\n\n\nstd::vector<std::string> Job::availableServers(Node const& snapshot) {\n\n  std::vector<std::string> ret;\n\n  \/\/ Get servers from plan\n  Node::Children const& dbservers = snapshot(plannedServers).children();\n  for (auto const& srv : dbservers) {\n    ret.push_back(srv.first);\n  }\n  \n  \/\/ Remove cleaned servers from ist\n  try {\n    for (auto const& srv :\n           VPackArrayIterator(snapshot(cleanedPrefix).slice())) {\n      ret.erase(\n        std::remove(ret.begin(), ret.end(), srv.copyString()),\n        ret.end());\n    }\n  } catch (...) {}\n\n  \/\/ Remove failed servers from list\n  try {\n    for (auto const& srv :\n           VPackObjectIterator(snapshot(failedServersPrefix).slice())) {\n      ret.erase(\n        std::remove(ret.begin(), ret.end(), srv.key.copyString()),\n        ret.end());\n    }\n  } catch (...) {}\n  \n  return ret;\n  \n}\n\nstd::vector<Job::shard_t> Job::clones(\n  Node const& snapshot, std::string const& database,\n  std::string const& collection, std::string const& shard) {\n\n  std::vector<shard_t> ret;\n  ret.emplace_back(collection, shard);  \/\/ add (collection, shard) as first item\n\n  try {\n    std::string databasePath = planColPrefix + database,\n      planPath = databasePath + \"\/\" + collection + \"\/shards\";\n\n    auto myshards = snapshot(planPath).children();\n    auto steps = std::distance(myshards.begin(), myshards.find(shard));\n\n    for (const auto& colptr : snapshot(databasePath).children()) { \/\/ collections\n\n      auto const col = *colptr.second;\n      auto const otherCollection = colptr.first;\n\n      try {\n        std::string const& prototype =\n          col(\"distributeShardsLike\").slice().copyString();\n        if (otherCollection != collection && prototype == collection) {\n          auto othershards = col(\"shards\").children();\n          auto opos = othershards.begin();\n          std::advance(opos, steps);\n          auto const& otherShard = opos->first;\n          ret.emplace_back(otherCollection, otherShard);\n        }\n      } catch(...) {}\n      \n    }\n  } catch (...) {\n    ret.clear();\n    ret.emplace_back(collection, shard);\n  }\n  \n  return ret;\n}\n\n\nstd::string Job::findNonblockedCommonHealthyInSyncFollower( \/\/ Which is in \"GOOD\" health\n  Node const& snap, std::string const& db, std::string const& col,\n  std::string const& shrd) {\n\n  auto cs = clones(snap, db, col, shrd);       \/\/ clones\n  auto nclones = cs.size();                    \/\/ #clones\n  std::map<std::string,bool> good;\n\n  for (const auto& i : snap(healthPrefix).children()) {\n    good[i.first] = ((*i.second)(\"Status\").toJson() == \"GOOD\");\n  }\n\n  std::map<std::string,size_t> currentServers;\n  for (const auto& clone : cs) {\n    auto currentShardPath =\n      curColPrefix + db + \"\/\" + clone.collection + \"\/\"\n      + clone.shard + \"\/servers\";\n    auto plannedShardPath =\n      planColPrefix + db + \"\/\" + clone.collection + \"\/shards\/\"\n      + clone.shard;\n    size_t i = 0;\n    for (const auto& server : VPackArrayIterator(snap(currentShardPath).getArray())) {\n      auto id = server.copyString();\n      if (i++ == 0) {\n        \/\/ Skip leader\n        continue;\n      }\n\n      if (!good[id]) {\n        \/\/ Skip unhealthy servers\n        continue;\n      }\n\n      if (snap.has(blockedServersPrefix + id)) {\n        \/\/ server is blocked\n        continue;\n      }\n\n      \/\/ check if it is also part of the plan...because if not the soon to be leader\n      \/\/ will drop the collection\n      bool found = false;\n      for (const auto& plannedServer : VPackArrayIterator(snap(plannedShardPath).getArray())) {\n        if (plannedServer == server) {\n          found = true;\n          continue;\n        }\n      }\n\n      if (!found) {\n        continue;\n      }\n\n      \/\/ increment a counter for this server\n      \/\/ and in case it is applicable for ALL our distributeLikeShards\n      \/\/ finally return it :)\n      if (++currentServers[id] == nclones) {\n        return id;\n      }\n    }\n  }\n  \n  return std::string();\n  \n}\n\nstd::string Job::uuidLookup (std::string const& shortID) {\n  for (auto const& uuid : _snapshot(mapUniqueToShortID).children()) {\n    if ((*uuid.second)(\"ShortName\").getString() == shortID) {\n      return uuid.first;\n    }\n  }\n  return std::string();\n}\n\n\nstd::string Job::id(std::string const& idOrShortName) {\n  std::string id = uuidLookup(idOrShortName);\n  if (!id.empty()) {\n    return id;\n  }\n  return idOrShortName;\n}\n\nbool Job::abortable(Node const& snapshot, std::string const& jobId) {\n\n  if (!snapshot.has(pendingPrefix + jobId)) {\n    return false;\n  }\n  auto const& job = snapshot(pendingPrefix + jobId);\n  if (!job.has(\"type\")) {\n    return false;\n  }\n  auto const& type = job(\"type\").getString();\n\n  if (type == \"failedServer\" || type == \"failedLeader\") {\n    return false;\n  } else if (type == \"addFollower\" || type == \"moveShard\" ||\n             type == \"cleanOutServer\") {\n    return true;\n  }\n\n  \/\/ We should never get here\n  TRI_ASSERT(false);\n  return false;  \n}\n\nvoid Job::doForAllShards(Node const& snapshot,\n\tstd::string& database,\n\tstd::vector<shard_t>& shards,\n  std::function<void(Slice plan, Slice current, std::string& planPath)> worker) {\n\tfor (auto const& collShard : shards) {\n\t\tstd::string shard = collShard.shard;\n\t\tstd::string collection = collShard.collection;\n\n    std::string planPath =\n      planColPrefix + database + \"\/\" + collection + \"\/shards\/\" + shard;\n    std::string curPath = curColPrefix + database + \"\/\" + collection\n                          + \"\/\" + shard + \"\/servers\";\n\n\t\tSlice plan = snapshot(planPath).slice();\n\t\tSlice current = snapshot(curPath).slice();\n\n    worker(plan, current, planPath);\n  }\n}\n\nvoid Job::addIncreasePlanVersion(Builder& trx) {\n  trx.add(VPackValue(planVersion));\n  { VPackObjectBuilder guard(&trx);\n    trx.add(\"op\", VPackValue(\"increment\"));\n  }\n}\n\nvoid Job::addRemoveJobFromSomewhere(Builder& trx, std::string where,\n  std::string jobId) {\n  trx.add(VPackValue(\"\/Target\/\" + where + \"\/\" + jobId));\n  { VPackObjectBuilder guard(&trx);\n    trx.add(\"op\", VPackValue(\"delete\"));\n  }\n}\n\nvoid Job::addPutJobIntoSomewhere(Builder& trx, std::string where, Slice job,\n    std::string reason) {\n  Slice jobIdSlice = job.get(\"jobId\");\n  TRI_ASSERT(jobIdSlice.isString());\n  std::string jobId = jobIdSlice.copyString();\n  trx.add(VPackValue(\"\/Target\/\" + where + \"\/\" + jobId));\n  { VPackObjectBuilder guard(&trx);\n    if (where == \"Pending\") {\n      trx.add(\"timeStarted\",\n        VPackValue(timepointToString(std::chrono::system_clock::now())));\n    } else {\n      trx.add(\"timeFinished\",\n        VPackValue(timepointToString(std::chrono::system_clock::now())));\n    }\n    for (auto const& obj : VPackObjectIterator(job)) {\n      trx.add(obj.key.copyString(), obj.value);\n    }\n    if (!reason.empty()) {\n      trx.add(\"reason\", VPackValue(reason));\n    }\n  }\n}\n\nvoid Job::addPreconditionCollectionStillThere(Builder& pre,\n    std::string database, std::string collection) {\n  std::string planPath\n      = planColPrefix + database + \"\/\" + collection;\n  pre.add(VPackValue(planPath));\n  { VPackObjectBuilder guard(&pre);\n    pre.add(\"oldEmpty\", VPackValue(false));\n  }\n}\n\nvoid Job::addPreconditionServerNotBlocked(Builder& pre, std::string server) {\n\tpre.add(VPackValue(blockedServersPrefix + server));\n\t{ VPackObjectBuilder serverLockEmpty(&pre);\n\t\tpre.add(\"oldEmpty\", VPackValue(true));\n\t}\n}\n\nvoid Job::addPreconditionServerGood(Builder& pre, std::string server) {\n\tpre.add(VPackValue(healthPrefix + server + \"\/Status\"));\n\t{ VPackObjectBuilder serverGood(&pre);\n\t\tpre.add(\"old\", VPackValue(\"GOOD\"));\n\t}\n}\n\nvoid Job::addPreconditionShardNotBlocked(Builder& pre, std::string shard) {\n\tpre.add(VPackValue(blockedShardsPrefix + shard));\n\t{ VPackObjectBuilder shardLockEmpty(&pre);\n\t\tpre.add(\"oldEmpty\", VPackValue(true));\n\t}\n}\n\nvoid Job::addPreconditionUnchanged(Builder& pre,\n    std::string key, Slice value) {\n  pre.add(VPackValue(key));\n  { VPackObjectBuilder guard(&pre);\n    pre.add(\"old\", value);\n  }\n}\n\nvoid Job::addBlockServer(Builder& trx, std::string server, std::string jobId) {\n  trx.add(blockedServersPrefix + server, VPackValue(jobId));\n}\n\nvoid Job::addBlockShard(Builder& trx, std::string shard, std::string jobId) {\n  trx.add(blockedShardsPrefix + shard, VPackValue(jobId));\n}\n\nvoid Job::addReleaseServer(Builder& trx, std::string server) {\n  trx.add(VPackValue(blockedServersPrefix + server));\n  { VPackObjectBuilder guard(&trx);\n    trx.add(\"op\", VPackValue(\"delete\"));\n  }\n}\n\nvoid Job::addReleaseShard(Builder& trx, std::string shard) {\n  trx.add(VPackValue(blockedShardsPrefix + shard));\n  { VPackObjectBuilder guard(&trx);\n    trx.add(\"op\", VPackValue(\"delete\"));\n  }\n}\n\nstd::string Job::checkServerGood(Node const& snapshot,\n                                 std::string const& server) {\n  if (!snapshot.has(healthPrefix + server + \"\/Status\")) {\n    return \"UNCLEAR\";\n  }\n  if (snapshot(healthPrefix + server + \"\/Status\").getString() != \"GOOD\") {\n    return \"UNHEALTHY\";\n  }\n  return \"GOOD\";\n}\n\n<commit_msg>availableServers fixed<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2016 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 Kaveh Vahedipour\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Job.h\"\n\nstatic std::string const DBServer = \"DBServer\";\n\nusing namespace arangodb::consensus;\n\nbool arangodb::consensus::compareServerLists(Slice plan, Slice current) {\n  if (!plan.isArray() || !current.isArray()) {\n    return false;\n  }\n  std::vector<std::string> planv, currv;\n  for (auto const& srv : VPackArrayIterator(plan)) {\n    if (srv.isString()) {\n      planv.push_back(srv.copyString());\n    }\n  }\n  for (auto const& srv : VPackArrayIterator(current)) {\n    if (srv.isString()) {\n      currv.push_back(srv.copyString());\n    }\n  }\n  bool equalLeader = !planv.empty() && !currv.empty() &&\n                     planv.front() == currv.front();\n  std::sort(planv.begin(), planv.end());\n  std::sort(currv.begin(), currv.end());\n  return equalLeader && currv == planv;\n}\n\nJob::Job(JOB_STATUS status, Node const& snapshot, AgentInterface* agent,\n         std::string const& jobId, std::string const& creator)\n  : _status(status),\n    _snapshot(snapshot),\n    _agent(agent),\n    _jobId(jobId),\n    _creator(creator),\n    _jb(nullptr) {\n}\n\nJob::~Job() {}\n\n\/\/ this will be initialized in the AgencyFeature\nstd::string Job::agencyPrefix = \"\/arango\";\n\nbool Job::finish(\n  std::string const& server, std::string const& shard,\n  bool success, std::string const& reason, query_t const payload) {\n  \n  Builder pending, finished;\n  \n  \/\/ Get todo entry\n  bool started = false;\n  { VPackArrayBuilder guard(&pending);\n    if (_snapshot.exists(pendingPrefix + _jobId).size() == 3) {\n      _snapshot(pendingPrefix + _jobId).toBuilder(pending);\n      started = true;\n    } else if (_snapshot.exists(toDoPrefix + _jobId).size() == 3) {\n      _snapshot(toDoPrefix + _jobId).toBuilder(pending);\n    } else {\n      LOG_TOPIC(DEBUG, Logger::AGENCY)\n        << \"Nothing in pending to finish up for job \" << _jobId;\n      return false;\n    }\n  }\n\n  std::string jobType;\n  try {\n    jobType = pending.slice()[0].get(\"type\").copyString();\n  } catch (std::exception const&) {\n    LOG_TOPIC(WARN, Logger::AGENCY)\n      << \"Failed to obtain type of job \" << _jobId;\n  }\n  \n  \/\/ Prepare pending entry, block toserver\n  { VPackArrayBuilder guard(&finished);\n    VPackObjectBuilder guard2(&finished);\n\n    addPutJobIntoSomewhere(finished, success ? \"Finished\" : \"Failed\",\n                           pending.slice()[0], reason);\n\n    addRemoveJobFromSomewhere(finished, \"ToDo\", _jobId);\n    addRemoveJobFromSomewhere(finished, \"Pending\", _jobId);\n\n    \/\/ Additional payload, which is to be executed in the finish transaction\n    if (payload != nullptr) {\n      Slice slice = payload->slice();\n      TRI_ASSERT(slice.isObject());\n      if (slice.length() > 0) {\n        for (auto const& oper : VPackObjectIterator(slice)) {\n          finished.add(oper.key.copyString(), oper.value);\n        }\n      }\n    }\n\n    \/\/ --- Remove blocks if specified:\n    if (started && !server.empty()) {\n      addReleaseServer(finished, server);\n    }\n    if (started && !shard.empty()) {\n      addReleaseShard(finished, shard);\n    }\n    \n  }  \/\/ close object and array\n\n  write_ret_t res = singleWriteTransaction(_agent, finished);\n  if (res.accepted && res.indices.size() == 1 && res.indices[0]) {\n    LOG_TOPIC(DEBUG, Logger::AGENCY)\n      << \"Successfully finished job \" << jobType << \"(\" << _jobId << \")\";\n    _status = (success ? FINISHED : FAILED);\n    return true;\n  }\n\n  return false;\n}\n\n\n\nstd::string Job::randomIdleGoodAvailableServer(\n  Node const& snap, std::vector<std::string> const& exclude) {\n\n  std::vector<std::string> as = availableServers(snap);\n  std::string ret;\n  auto ex(exclude);\n\n  \/\/ ungood;\n  try {\n    for (auto const& srv : snap(healthPrefix).children()) {\n      if ((*srv.second)(\"Status\").toJson() != \"GOOD\") {\n        ex.push_back(srv.first);\n      }\n    }\n  } catch (...) {}\n  \n  \/\/ blocked;\n  try {\n    for (auto const& srv : snap(blockedServersPrefix).children()) {\n      ex.push_back(srv.first);\n    }\n  } catch (...) {}\n \n\n  \/\/ Remove excluded servers\n  std::sort(std::begin(ex), std::end(ex));\n  as.erase(\n    std::remove_if(\n      std::begin(as),std::end(as),\n      [&](std::string const& s){\n        return std::binary_search(\n          std::begin(ex), std::end(ex), s);}), std::end(as));\n  \n  \/\/ Choose random server from rest\n  if (!as.empty()) {\n    if (as.size() > 1) {\n      std::random_shuffle(as.begin(), as.end());\n    }\n    ret = as.front();\n  }\n\n  return ret;\n  \n}\n\n\nstd::string Job::randomIdleGoodAvailableServer(Node const& snap,\n                                               Slice const& exclude) {\n\n  std::vector<std::string> ev;\n  if (exclude.isArray()) {\n    for (const auto& s : VPackArrayIterator(exclude)) {\n      if (s.isString()) {\n        ev.push_back(s.copyString());\n      }\n    }\n  }\n  return randomIdleGoodAvailableServer(snap,ev);\n\n}\n\n\nstd::vector<std::string> Job::availableServers(Node const& snapshot) {\n\n  std::vector<std::string> ret;\n\n  \/\/ Get servers from plan\n  Node::Children const& dbservers = snapshot(plannedServers).children();\n  for (auto const& srv : dbservers) {\n    ret.push_back(srv.first);\n  }\n  \n  \/\/ Remove cleaned servers from ist\n  try {\n    for (auto const& srv :\n           VPackArrayIterator(snapshot(cleanedPrefix).slice())) {\n      ret.erase(\n        std::remove(ret.begin(), ret.end(), srv.copyString()),\n        ret.end());\n    }\n  } catch (...) {}\n\n  \/\/ Remove failed servers from list\n  try {\n    for (auto const& srv : snapshot(failedServersPrefix).children()) {\n      ret.erase(\n        std::remove(ret.begin(), ret.end(), srv.first), ret.end());\n    }\n  } catch (...) {}\n  \n  return ret;\n  \n}\n\nstd::vector<Job::shard_t> Job::clones(\n  Node const& snapshot, std::string const& database,\n  std::string const& collection, std::string const& shard) {\n\n  std::vector<shard_t> ret;\n  ret.emplace_back(collection, shard);  \/\/ add (collection, shard) as first item\n\n  try {\n    std::string databasePath = planColPrefix + database,\n      planPath = databasePath + \"\/\" + collection + \"\/shards\";\n\n    auto myshards = snapshot(planPath).children();\n    auto steps = std::distance(myshards.begin(), myshards.find(shard));\n\n    for (const auto& colptr : snapshot(databasePath).children()) { \/\/ collections\n\n      auto const col = *colptr.second;\n      auto const otherCollection = colptr.first;\n\n      try {\n        std::string const& prototype =\n          col(\"distributeShardsLike\").slice().copyString();\n        if (otherCollection != collection && prototype == collection) {\n          auto othershards = col(\"shards\").children();\n          auto opos = othershards.begin();\n          std::advance(opos, steps);\n          auto const& otherShard = opos->first;\n          ret.emplace_back(otherCollection, otherShard);\n        }\n      } catch(...) {}\n      \n    }\n  } catch (...) {\n    ret.clear();\n    ret.emplace_back(collection, shard);\n  }\n  \n  return ret;\n}\n\n\nstd::string Job::findNonblockedCommonHealthyInSyncFollower( \/\/ Which is in \"GOOD\" health\n  Node const& snap, std::string const& db, std::string const& col,\n  std::string const& shrd) {\n\n  auto cs = clones(snap, db, col, shrd);       \/\/ clones\n  auto nclones = cs.size();                    \/\/ #clones\n  std::map<std::string,bool> good;\n\n  for (const auto& i : snap(healthPrefix).children()) {\n    good[i.first] = ((*i.second)(\"Status\").toJson() == \"GOOD\");\n  }\n\n  std::map<std::string,size_t> currentServers;\n  for (const auto& clone : cs) {\n    auto currentShardPath =\n      curColPrefix + db + \"\/\" + clone.collection + \"\/\"\n      + clone.shard + \"\/servers\";\n    auto plannedShardPath =\n      planColPrefix + db + \"\/\" + clone.collection + \"\/shards\/\"\n      + clone.shard;\n    size_t i = 0;\n    for (const auto& server : VPackArrayIterator(snap(currentShardPath).getArray())) {\n      auto id = server.copyString();\n      if (i++ == 0) {\n        \/\/ Skip leader\n        continue;\n      }\n\n      if (!good[id]) {\n        \/\/ Skip unhealthy servers\n        continue;\n      }\n\n      if (snap.has(blockedServersPrefix + id)) {\n        \/\/ server is blocked\n        continue;\n      }\n\n      \/\/ check if it is also part of the plan...because if not the soon to be leader\n      \/\/ will drop the collection\n      bool found = false;\n      for (const auto& plannedServer : VPackArrayIterator(snap(plannedShardPath).getArray())) {\n        if (plannedServer == server) {\n          found = true;\n          continue;\n        }\n      }\n\n      if (!found) {\n        continue;\n      }\n\n      \/\/ increment a counter for this server\n      \/\/ and in case it is applicable for ALL our distributeLikeShards\n      \/\/ finally return it :)\n      if (++currentServers[id] == nclones) {\n        return id;\n      }\n    }\n  }\n  \n  return std::string();\n  \n}\n\nstd::string Job::uuidLookup (std::string const& shortID) {\n  for (auto const& uuid : _snapshot(mapUniqueToShortID).children()) {\n    if ((*uuid.second)(\"ShortName\").getString() == shortID) {\n      return uuid.first;\n    }\n  }\n  return std::string();\n}\n\n\nstd::string Job::id(std::string const& idOrShortName) {\n  std::string id = uuidLookup(idOrShortName);\n  if (!id.empty()) {\n    return id;\n  }\n  return idOrShortName;\n}\n\nbool Job::abortable(Node const& snapshot, std::string const& jobId) {\n\n  if (!snapshot.has(pendingPrefix + jobId)) {\n    return false;\n  }\n  auto const& job = snapshot(pendingPrefix + jobId);\n  if (!job.has(\"type\")) {\n    return false;\n  }\n  auto const& type = job(\"type\").getString();\n\n  if (type == \"failedServer\" || type == \"failedLeader\") {\n    return false;\n  } else if (type == \"addFollower\" || type == \"moveShard\" ||\n             type == \"cleanOutServer\") {\n    return true;\n  }\n\n  \/\/ We should never get here\n  TRI_ASSERT(false);\n  return false;  \n}\n\nvoid Job::doForAllShards(Node const& snapshot,\n\tstd::string& database,\n\tstd::vector<shard_t>& shards,\n  std::function<void(Slice plan, Slice current, std::string& planPath)> worker) {\n\tfor (auto const& collShard : shards) {\n\t\tstd::string shard = collShard.shard;\n\t\tstd::string collection = collShard.collection;\n\n    std::string planPath =\n      planColPrefix + database + \"\/\" + collection + \"\/shards\/\" + shard;\n    std::string curPath = curColPrefix + database + \"\/\" + collection\n                          + \"\/\" + shard + \"\/servers\";\n\n\t\tSlice plan = snapshot(planPath).slice();\n\t\tSlice current = snapshot(curPath).slice();\n\n    worker(plan, current, planPath);\n  }\n}\n\nvoid Job::addIncreasePlanVersion(Builder& trx) {\n  trx.add(VPackValue(planVersion));\n  { VPackObjectBuilder guard(&trx);\n    trx.add(\"op\", VPackValue(\"increment\"));\n  }\n}\n\nvoid Job::addRemoveJobFromSomewhere(Builder& trx, std::string where,\n  std::string jobId) {\n  trx.add(VPackValue(\"\/Target\/\" + where + \"\/\" + jobId));\n  { VPackObjectBuilder guard(&trx);\n    trx.add(\"op\", VPackValue(\"delete\"));\n  }\n}\n\nvoid Job::addPutJobIntoSomewhere(Builder& trx, std::string where, Slice job,\n    std::string reason) {\n  Slice jobIdSlice = job.get(\"jobId\");\n  TRI_ASSERT(jobIdSlice.isString());\n  std::string jobId = jobIdSlice.copyString();\n  trx.add(VPackValue(\"\/Target\/\" + where + \"\/\" + jobId));\n  { VPackObjectBuilder guard(&trx);\n    if (where == \"Pending\") {\n      trx.add(\"timeStarted\",\n        VPackValue(timepointToString(std::chrono::system_clock::now())));\n    } else {\n      trx.add(\"timeFinished\",\n        VPackValue(timepointToString(std::chrono::system_clock::now())));\n    }\n    for (auto const& obj : VPackObjectIterator(job)) {\n      trx.add(obj.key.copyString(), obj.value);\n    }\n    if (!reason.empty()) {\n      trx.add(\"reason\", VPackValue(reason));\n    }\n  }\n}\n\nvoid Job::addPreconditionCollectionStillThere(Builder& pre,\n    std::string database, std::string collection) {\n  std::string planPath\n      = planColPrefix + database + \"\/\" + collection;\n  pre.add(VPackValue(planPath));\n  { VPackObjectBuilder guard(&pre);\n    pre.add(\"oldEmpty\", VPackValue(false));\n  }\n}\n\nvoid Job::addPreconditionServerNotBlocked(Builder& pre, std::string server) {\n\tpre.add(VPackValue(blockedServersPrefix + server));\n\t{ VPackObjectBuilder serverLockEmpty(&pre);\n\t\tpre.add(\"oldEmpty\", VPackValue(true));\n\t}\n}\n\nvoid Job::addPreconditionServerGood(Builder& pre, std::string server) {\n\tpre.add(VPackValue(healthPrefix + server + \"\/Status\"));\n\t{ VPackObjectBuilder serverGood(&pre);\n\t\tpre.add(\"old\", VPackValue(\"GOOD\"));\n\t}\n}\n\nvoid Job::addPreconditionShardNotBlocked(Builder& pre, std::string shard) {\n\tpre.add(VPackValue(blockedShardsPrefix + shard));\n\t{ VPackObjectBuilder shardLockEmpty(&pre);\n\t\tpre.add(\"oldEmpty\", VPackValue(true));\n\t}\n}\n\nvoid Job::addPreconditionUnchanged(Builder& pre,\n    std::string key, Slice value) {\n  pre.add(VPackValue(key));\n  { VPackObjectBuilder guard(&pre);\n    pre.add(\"old\", value);\n  }\n}\n\nvoid Job::addBlockServer(Builder& trx, std::string server, std::string jobId) {\n  trx.add(blockedServersPrefix + server, VPackValue(jobId));\n}\n\nvoid Job::addBlockShard(Builder& trx, std::string shard, std::string jobId) {\n  trx.add(blockedShardsPrefix + shard, VPackValue(jobId));\n}\n\nvoid Job::addReleaseServer(Builder& trx, std::string server) {\n  trx.add(VPackValue(blockedServersPrefix + server));\n  { VPackObjectBuilder guard(&trx);\n    trx.add(\"op\", VPackValue(\"delete\"));\n  }\n}\n\nvoid Job::addReleaseShard(Builder& trx, std::string shard) {\n  trx.add(VPackValue(blockedShardsPrefix + shard));\n  { VPackObjectBuilder guard(&trx);\n    trx.add(\"op\", VPackValue(\"delete\"));\n  }\n}\n\nstd::string Job::checkServerGood(Node const& snapshot,\n                                 std::string const& server) {\n  if (!snapshot.has(healthPrefix + server + \"\/Status\")) {\n    return \"UNCLEAR\";\n  }\n  if (snapshot(healthPrefix + server + \"\/Status\").getString() != \"GOOD\") {\n    return \"UNHEALTHY\";\n  }\n  return \"GOOD\";\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: excelhandlers.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: kz $ $Date: 2008-03-05 18:59: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#include \"oox\/xls\/excelhandlers.hxx\"\n\nusing ::rtl::OUString;\nusing ::oox::core::FragmentHandler2;\nusing ::oox::core::XmlFilterBase;\n\nnamespace oox {\nnamespace xls {\n\n\/\/ ============================================================================\n\nOoxWorkbookFragmentBase::OoxWorkbookFragmentBase(\n        const WorkbookHelper& rHelper, const OUString& rFragmentPath ) :\n    FragmentHandler2( rHelper.getOoxFilter(), rFragmentPath ),\n    WorkbookHelper( rHelper )\n{\n}\n\n\/\/ ============================================================================\n\nOoxWorksheetFragmentBase::OoxWorksheetFragmentBase( const WorkbookHelper& rHelper,\n        const OUString& rFragmentPath, ISegmentProgressBarRef xProgressBar, WorksheetType eSheetType, sal_Int32 nSheet ) :\n    FragmentHandler2( rHelper.getOoxFilter(), rFragmentPath ),\n    WorksheetHelperRoot( rHelper, xProgressBar, eSheetType, nSheet )\n{\n}\n\nOoxWorksheetFragmentBase::OoxWorksheetFragmentBase(\n        const WorksheetHelper& rHelper, const OUString& rFragmentPath ) :\n    FragmentHandler2( rHelper.getOoxFilter(), rFragmentPath ),\n    WorksheetHelperRoot( rHelper )\n{\n}\n\n\/\/ ============================================================================\n\n} \/\/ namespace xls\n} \/\/ namespace oox\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.6); FILE MERGED 2008\/03\/31 16:21:54 rt 1.2.6.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: excelhandlers.cxx,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#include \"oox\/xls\/excelhandlers.hxx\"\n\nusing ::rtl::OUString;\nusing ::oox::core::FragmentHandler2;\nusing ::oox::core::XmlFilterBase;\n\nnamespace oox {\nnamespace xls {\n\n\/\/ ============================================================================\n\nOoxWorkbookFragmentBase::OoxWorkbookFragmentBase(\n        const WorkbookHelper& rHelper, const OUString& rFragmentPath ) :\n    FragmentHandler2( rHelper.getOoxFilter(), rFragmentPath ),\n    WorkbookHelper( rHelper )\n{\n}\n\n\/\/ ============================================================================\n\nOoxWorksheetFragmentBase::OoxWorksheetFragmentBase( const WorkbookHelper& rHelper,\n        const OUString& rFragmentPath, ISegmentProgressBarRef xProgressBar, WorksheetType eSheetType, sal_Int32 nSheet ) :\n    FragmentHandler2( rHelper.getOoxFilter(), rFragmentPath ),\n    WorksheetHelperRoot( rHelper, xProgressBar, eSheetType, nSheet )\n{\n}\n\nOoxWorksheetFragmentBase::OoxWorksheetFragmentBase(\n        const WorksheetHelper& rHelper, const OUString& rFragmentPath ) :\n    FragmentHandler2( rHelper.getOoxFilter(), rFragmentPath ),\n    WorksheetHelperRoot( rHelper )\n{\n}\n\n\/\/ ============================================================================\n\n} \/\/ namespace xls\n} \/\/ namespace oox\n\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-20T04:04:26\";\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-21T04:03:14).<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-21T04:03:14\";\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>\/*\n * SuRealPMCB.cc\n *\n * Copyright (C) 2014 OpenCog Foundation\n *\n * Author: William Ma <https:\/\/github.com\/williampma>\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 <opencog\/nlp\/types\/atom_types.h>\n\n#include \"SuRealPMCB.h\"\n\n\nusing namespace opencog::nlp;\nusing namespace opencog;\n\n\n\/**\n * The constructor for the PatternMatcherCallback.\n *\n * @param pAS    the corresponding AtomSpace\n * @param vars   the set of nodes that should be treated as variables\n *\/\nSuRealPMCB::SuRealPMCB(AtomSpace* pAS, std::set<Handle> vars) : DefaultPatternMatchCB(pAS), m_vars(vars)\n{\n\n}\n\n\/**\n * Override the variable_match callback.\n *\n * Do the special checking for each variable matches.  Note that variables\n * in SuReal will not just be VariableNode, but any nodes with an actual word\n * (eg. (PredicateNode \"runs\"), (ConceptNode \"dog@1324-12213\"), etc).\n *\n * For each variable and its potential solution, the corresponding WordNode\n * will be located.  Then we following the WordNode to find LgWordCset to get\n * the LG dictionary entries.  If the two words have identical LG entries,\n * then the two words matches.  Just one pair of LG entries need to match even\n * if a word has multiple entries.\n *\n * @param hPat    the variable, a node extracted from the original query\n * @param hSoln   the potential mapping\n * @return        true if solution is rejected, false if accepted\n *\/\nbool SuRealPMCB::variable_match(Handle &hPat, Handle &hSoln)\n{\n    logger().debug(\"[SuReal] In variable_match, looking at %s\", hSoln->toShortString().c_str());\n\n    \/\/ reject if the solution is not of the same type\n    if (hPat->getType() != hSoln->getType())\n        return true;\n\n    \/\/ VariableNode can be matched to any VariableNode, similarly for InterpretationNode\n    if (hPat->getType() == VARIABLE_NODE || hPat->getType() == INTERPRETATION_NODE)\n        return true;\n\n    std::string sPat = _as->getName(hPat);\n    std::string sPatWord = sPat.substr(0, sPat.find_first_of('@'));\n    std::string sSoln = _as->getName(hSoln);\n    std::string sSolnWord = sSoln.substr(0, sSoln.find_first_of('@'));\n\n    \/\/ get the WordNode associated with the word (extracted from \"word@1234\" convention)\n    Handle hPatWordNode = _as->getHandle(WORD_NODE, sPatWord);\n    Handle hSolnWordNode = _as->getHandle(WORD_NODE, sSolnWord);\n\n    \/\/ no WordNode? reject!\n    if (hSolnWordNode == Handle::UNDEFINED)\n        return true;\n\n    \/\/ get the neighbor of each WordNode within LgWordCset\n    HandleSeq qPatSet =_as->getNeighbors(hPatWordNode, false, true, LG_WORD_CSET, false);\n    HandleSeq qSolnSet = _as->getNeighbors(hSolnWordNode, false, true, LG_WORD_CSET, false);\n\n    \/\/ check the HandleSeq to see if there is any pair that is equal (common LG entry)\n    std::sort(qPatSet.begin(), qPatSet.end());\n    std::sort(qSolnSet.begin(), qSolnSet.end());\n\n    HandleSeq qItrsect;\n    std::set_intersection(qPatSet.begin(), qPatSet.end(), qSolnSet.begin(), qSolnSet.end(), std::back_inserter(qItrsect));\n\n    \/\/ if there's no common LG dictionary rules, then the two words do not match\n    if (qItrsect.empty())\n        return true;\n\n    return false;\n}\n\n\/**\n * Override the clause_match callback.\n *\n * Reject a clause match if the matched link is not in a SetLink linked to an\n * InterpretationNode.  The reason of doing it here instead of earlier in\n * link_match() is because it is possible a SetLink is used for other purpose\n * as part of R2L's output.\n *\n * @param pattrn_link_h   the matched clause, extracted from the input SetLink\n * @param grnd_link_h     the corresponding grounding to be checked\n * @return                true if rejected, false if accepted\n *\/\nbool SuRealPMCB::clause_match(Handle &pattrn_link_h, Handle &grnd_link_h)\n{\n    logger().debug(\"[SuReal] In clause_match, looking at %s\", grnd_link_h->toShortString().c_str());\n\n    HandleSeq qISet = _as->getIncoming(grnd_link_h);\n\n    \/\/ keep only SetLink, and check if any of the SetLink has an InterpretationNode as neightbor\n    qISet.erase(std::remove_if(qISet.begin(), qISet.end(), [](Handle& h) { return h->getType() != SET_LINK; }), qISet.end());\n\n    \/\/ helper lambda function to check for linkage to an InterpretationNode, given SetLink\n    auto hasInterpretation = [this](Handle& h)\n    {\n        HandleSeq qN = _as->getNeighbors(h, true, false, REFERENCE_LINK, false);\n        return std::any_of(qN.begin(), qN.end(), [](Handle& hn) { return hn->getType() == INTERPRETATION_NODE; });\n    };\n\n    \/\/ reject match (ie. return true) if there is no InterpretationNode\n    return not std::any_of(qISet.begin(), qISet.end(), hasInterpretation);\n}\n\n\/**\n * Implement the grounding method.\n *\n * Check all matched clauses to see if they are all within the same SetLink\n * linking to the same InterpretationNode.  If so, store the solution and try\n * to find more.\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 SuRealPMCB::grounding(const std::map<Handle, Handle> &var_soln, const std::map<Handle, Handle> &pred_soln)\n{\n    logger().debug(\"[SuReal] grounding a solution\");\n\n    \/\/ helper to get the InterpretationNode\n    auto getInterpretation = [this](const Handle& h)\n    {\n        HandleSeq qISet = _as->getIncoming(h);\n        qISet.erase(std::remove_if(qISet.begin(), qISet.end(), [](Handle& h) { return h->getType() != SET_LINK; }), qISet.end());\n\n        HandleSeq results;\n\n        for (auto& hSetLink : qISet)\n        {\n            HandleSeq qN  = _as->getNeighbors(hSetLink, true, false, REFERENCE_LINK, false);\n            qN.erase(std::remove_if(qN.begin(), qN.end(), [](Handle& h) { return h->getType() != INTERPRETATION_NODE; }), qN.end());\n\n            results.insert(results.end(), qN.begin(), qN.end());\n        }\n\n        return results;\n    };\n\n    HandleSeq qItprNode = getInterpretation(pred_soln.begin()->second);\n    std::sort(qItprNode.begin(), qItprNode.end());\n\n    \/\/ try to find a common InterpretationNode to the solutions\n    for (std::map<Handle, Handle>::const_iterator it = ++pred_soln.begin(); it != pred_soln.end(); ++it)\n    {\n        HandleSeq thisSeq = getInterpretation(it->second);\n        std::sort(thisSeq.begin(), thisSeq.end());\n\n        HandleSeq overlapSeq;\n        std::set_intersection(qItprNode.begin(), qItprNode.end(), thisSeq.begin(), thisSeq.end(), std::back_inserter(overlapSeq));\n\n        qItprNode = overlapSeq;\n    }\n\n    \/\/ no common InterpretationNode, ignore this grounding\n    if (qItprNode.empty())\n        return false;\n\n    \/\/ shrink var_soln to only contain solution for the variables\n    std::map<Handle, Handle> shrinked_soln;\n\n    for (const auto& kv : var_soln)\n    {\n        if (m_vars.count(kv.first) == 0)\n            continue;\n\n        shrinked_soln[kv.first] = kv.second;\n    }\n\n    \/\/ store the solution; all common InterpretationNode are solutions for this\n    \/\/ grounding, so store the solution for each InterpretationNode\n    for (auto n : qItprNode)\n        m_results[n] = shrinked_soln;\n\n    return false;\n}\n\n\/**\n * Implement the perform_search method.\n *\n * Similar to DefaultPatternMatcherCB::perform_search, in which we start search\n * by looking at the thinnest clause with constants.  However, since most clauses\n * for SuReal will have 0 constants, most searches will require looking at all\n * the links.  This implementation improves that by looking at links within a\n * SetLink within a ReferenceLink with a InterpretationNode neightbor, thus\n * limiting the search space.\n *\n * @param pPME       pointer to the PatternMatchEngine\n * @param vars       a set of nodes that are variables\n * @param clauses    the clauses for the query\n * @param negations  the negative clauses\n *\/\nvoid SuRealPMCB::perform_search(PatternMatchEngine* pPME, std::set<Handle>& vars, HandleSeq& clauses, HandleSeq& negations)\n{\n    size_t bestClauseIndex;\n    Handle bestClause, bestSubClause, bestSubNode;\n\n    \/\/ find the thinnest clause with constants\n    bestSubNode = find_thinnest(clauses, bestSubClause, bestClauseIndex);\n\n    if (bestSubNode != Handle::UNDEFINED && !vars.empty())\n    {\n        bestClause = clauses[bestClauseIndex];\n\n        logger().debug(\"[SuReal] Search start node: %s\", bestSubNode->toShortString().c_str());\n        logger().debug(\"[SuReal] Start pred is: %s\", bestSubClause->toShortString().c_str());\n\n        IncomingSet iset = get_incoming_set(bestSubNode);\n\n        for (auto& l : iset)\n        {\n            Handle h(l);\n            logger().debug(\"[SuReal] Loop candidate: %s\", h->toShortString().c_str());\n\n            if (pPME->do_candidate(bestClause, bestSubClause, h))\n                break;\n        }\n\n        return;\n    }\n\n    \/\/ reaching here means no contants, so do some search space reduction here\n    bestClause = clauses[0];\n\n    logger().debug(\"[SuReal] Start pred is: %s\", bestClause->toShortString().c_str());\n\n    \/\/ helper for checking for InterpretationNode\n    auto hasNoInterpretation = [this](Handle& h)\n    {\n        HandleSeq qISet = _as->getIncoming(h);\n        qISet.erase(std::remove_if(qISet.begin(), qISet.end(), [](Handle& hl) { return hl->getType() != SET_LINK; }), qISet.end());\n\n        auto hasNode = [this](Handle& hl)\n        {\n            HandleSeq qN = _as->getNeighbors(hl, true, false, REFERENCE_LINK, false);\n            return std::any_of(qN.begin(), qN.end(), [](Handle& hn) { return hn->getType() == INTERPRETATION_NODE; });\n        };\n\n        return not std::any_of(qISet.begin(), qISet.end(), hasNode);\n    };\n\n    \/\/ keep only links of the same type as bestClause and have linkage to InterpretationNode\n    HandleSeq qCandidate;\n    _as->getHandlesByType(std::back_inserter(qCandidate), bestClause->getType());\n    qCandidate.erase(std::remove_if(qCandidate.begin(), qCandidate.end(), hasNoInterpretation), qCandidate.end());\n\n    for (auto& c : qCandidate)\n    {\n        logger().debug(\"[SuReal] Loop candidate: %s\", c->toShortString().c_str());\n\n        if (pPME->do_candidate(bestClause, bestClause, c))\n            break;\n    }\n}\n\n\/**\n * Override the find_starter method in DefaultPatternMatchCB.\n *\n * Override find_starter so that it will not treat VariableNode variables,\n * but instead compare against the variable list.\n *\n * @param h       same as DefaultPatternMatchCB::find_starter\n * @param depth   same as DefaultPatternMatchCB::find_starter\n * @param start   same as DefaultPatternMatchCB::find_starter\n * @param width   same as DefaultPatternMatchCB::find_starter\n * @return        same as DefaultPatternMatchCB::find_starter but change\n *                the result if is a variable\n *\/\nHandle SuRealPMCB::find_starter(Handle h, size_t& depth, Handle& start, size_t& width)\n{\n    Handle rh = DefaultPatternMatchCB::find_starter(h, depth, start, width);\n\n    \/\/ if the non-VariableNode is actually a variable\n    if (m_vars.count(rh) == 1)\n        return Handle::UNDEFINED;\n\n    return rh;\n}\n\n<commit_msg>Fixed incorrect return value for callback<commit_after>\/*\n * SuRealPMCB.cc\n *\n * Copyright (C) 2014 OpenCog Foundation\n *\n * Author: William Ma <https:\/\/github.com\/williampma>\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 <opencog\/nlp\/types\/atom_types.h>\n\n#include \"SuRealPMCB.h\"\n\n\nusing namespace opencog::nlp;\nusing namespace opencog;\n\n\n\/**\n * The constructor for the PatternMatcherCallback.\n *\n * @param pAS    the corresponding AtomSpace\n * @param vars   the set of nodes that should be treated as variables\n *\/\nSuRealPMCB::SuRealPMCB(AtomSpace* pAS, std::set<Handle> vars) : DefaultPatternMatchCB(pAS), m_vars(vars)\n{\n\n}\n\n\/**\n * Override the variable_match callback.\n *\n * Do the special checking for each variable matches.  Note that variables\n * in SuReal will not just be VariableNode, but any nodes with an actual word\n * (eg. (PredicateNode \"runs\"), (ConceptNode \"dog@1324-12213\"), etc).\n *\n * For each variable and its potential solution, the corresponding WordNode\n * will be located.  Then we following the WordNode to find LgWordCset to get\n * the LG dictionary entries.  If the two words have identical LG entries,\n * then the two words matches.  Just one pair of LG entries need to match even\n * if a word has multiple entries.\n *\n * @param hPat    the variable, a node extracted from the original query\n * @param hSoln   the potential mapping\n * @return        true if solution is rejected, false if accepted\n *\/\nbool SuRealPMCB::variable_match(Handle &hPat, Handle &hSoln)\n{\n    logger().debug(\"[SuReal] In variable_match, looking at %s\", hSoln->toShortString().c_str());\n\n    \/\/ reject if the solution is not of the same type\n    if (hPat->getType() != hSoln->getType())\n        return true;\n\n    \/\/ VariableNode can be matched to any VariableNode, similarly for InterpretationNode\n    if (hPat->getType() == VARIABLE_NODE || hPat->getType() == INTERPRETATION_NODE)\n        return false;\n\n    std::string sPat = _as->getName(hPat);\n    std::string sPatWord = sPat.substr(0, sPat.find_first_of('@'));\n    std::string sSoln = _as->getName(hSoln);\n    std::string sSolnWord = sSoln.substr(0, sSoln.find_first_of('@'));\n\n    \/\/ get the WordNode associated with the word (extracted from \"word@1234\" convention)\n    Handle hPatWordNode = _as->getHandle(WORD_NODE, sPatWord);\n    Handle hSolnWordNode = _as->getHandle(WORD_NODE, sSolnWord);\n\n    \/\/ no WordNode? reject!\n    if (hSolnWordNode == Handle::UNDEFINED)\n        return true;\n\n    \/\/ get the neighbor of each WordNode within LgWordCset\n    HandleSeq qPatSet =_as->getNeighbors(hPatWordNode, false, true, LG_WORD_CSET, false);\n    HandleSeq qSolnSet = _as->getNeighbors(hSolnWordNode, false, true, LG_WORD_CSET, false);\n\n    \/\/ check the HandleSeq to see if there is any pair that is equal (common LG entry)\n    std::sort(qPatSet.begin(), qPatSet.end());\n    std::sort(qSolnSet.begin(), qSolnSet.end());\n\n    HandleSeq qItrsect;\n    std::set_intersection(qPatSet.begin(), qPatSet.end(), qSolnSet.begin(), qSolnSet.end(), std::back_inserter(qItrsect));\n\n    \/\/ if there's no common LG dictionary rules, then the two words do not match\n    if (qItrsect.empty())\n        return true;\n\n    return false;\n}\n\n\/**\n * Override the clause_match callback.\n *\n * Reject a clause match if the matched link is not in a SetLink linked to an\n * InterpretationNode.  The reason of doing it here instead of earlier in\n * link_match() is because it is possible a SetLink is used for other purpose\n * as part of R2L's output.\n *\n * @param pattrn_link_h   the matched clause, extracted from the input SetLink\n * @param grnd_link_h     the corresponding grounding to be checked\n * @return                true if rejected, false if accepted\n *\/\nbool SuRealPMCB::clause_match(Handle &pattrn_link_h, Handle &grnd_link_h)\n{\n    logger().debug(\"[SuReal] In clause_match, looking at %s\", grnd_link_h->toShortString().c_str());\n\n    HandleSeq qISet = _as->getIncoming(grnd_link_h);\n\n    \/\/ keep only SetLink, and check if any of the SetLink has an InterpretationNode as neightbor\n    qISet.erase(std::remove_if(qISet.begin(), qISet.end(), [](Handle& h) { return h->getType() != SET_LINK; }), qISet.end());\n\n    \/\/ helper lambda function to check for linkage to an InterpretationNode, given SetLink\n    auto hasInterpretation = [this](Handle& h)\n    {\n        HandleSeq qN = _as->getNeighbors(h, true, false, REFERENCE_LINK, false);\n        return std::any_of(qN.begin(), qN.end(), [](Handle& hn) { return hn->getType() == INTERPRETATION_NODE; });\n    };\n\n    \/\/ reject match (ie. return true) if there is no InterpretationNode\n    return not std::any_of(qISet.begin(), qISet.end(), hasInterpretation);\n}\n\n\/**\n * Implement the grounding method.\n *\n * Check all matched clauses to see if they are all within the same SetLink\n * linking to the same InterpretationNode.  If so, store the solution and try\n * to find more.\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 SuRealPMCB::grounding(const std::map<Handle, Handle> &var_soln, const std::map<Handle, Handle> &pred_soln)\n{\n    logger().debug(\"[SuReal] grounding a solution\");\n\n    \/\/ helper to get the InterpretationNode\n    auto getInterpretation = [this](const Handle& h)\n    {\n        HandleSeq qISet = _as->getIncoming(h);\n        qISet.erase(std::remove_if(qISet.begin(), qISet.end(), [](Handle& h) { return h->getType() != SET_LINK; }), qISet.end());\n\n        HandleSeq results;\n\n        for (auto& hSetLink : qISet)\n        {\n            HandleSeq qN  = _as->getNeighbors(hSetLink, true, false, REFERENCE_LINK, false);\n            qN.erase(std::remove_if(qN.begin(), qN.end(), [](Handle& h) { return h->getType() != INTERPRETATION_NODE; }), qN.end());\n\n            results.insert(results.end(), qN.begin(), qN.end());\n        }\n\n        return results;\n    };\n\n    HandleSeq qItprNode = getInterpretation(pred_soln.begin()->second);\n    std::sort(qItprNode.begin(), qItprNode.end());\n\n    \/\/ try to find a common InterpretationNode to the solutions\n    for (std::map<Handle, Handle>::const_iterator it = ++pred_soln.begin(); it != pred_soln.end(); ++it)\n    {\n        HandleSeq thisSeq = getInterpretation(it->second);\n        std::sort(thisSeq.begin(), thisSeq.end());\n\n        HandleSeq overlapSeq;\n        std::set_intersection(qItprNode.begin(), qItprNode.end(), thisSeq.begin(), thisSeq.end(), std::back_inserter(overlapSeq));\n\n        qItprNode = overlapSeq;\n    }\n\n    \/\/ no common InterpretationNode, ignore this grounding\n    if (qItprNode.empty())\n        return false;\n\n    \/\/ shrink var_soln to only contain solution for the variables\n    std::map<Handle, Handle> shrinked_soln;\n\n    for (const auto& kv : var_soln)\n    {\n        logger().debug(\"[SuReal] checking grounding for %s\", kv.first->toShortString().c_str());\n\n        if (m_vars.count(kv.first) == 0)\n            continue;\n\n        shrinked_soln[kv.first] = kv.second;\n    }\n\n    \/\/ store the solution; all common InterpretationNode are solutions for this\n    \/\/ grounding, so store the solution for each InterpretationNode\n    for (auto n : qItprNode)\n        m_results[n] = shrinked_soln;\n\n    return false;\n}\n\n\/**\n * Implement the perform_search method.\n *\n * Similar to DefaultPatternMatcherCB::perform_search, in which we start search\n * by looking at the thinnest clause with constants.  However, since most clauses\n * for SuReal will have 0 constants, most searches will require looking at all\n * the links.  This implementation improves that by looking at links within a\n * SetLink within a ReferenceLink with a InterpretationNode neightbor, thus\n * limiting the search space.\n *\n * @param pPME       pointer to the PatternMatchEngine\n * @param vars       a set of nodes that are variables\n * @param clauses    the clauses for the query\n * @param negations  the negative clauses\n *\/\nvoid SuRealPMCB::perform_search(PatternMatchEngine* pPME, std::set<Handle>& vars, HandleSeq& clauses, HandleSeq& negations)\n{\n    size_t bestClauseIndex;\n    Handle bestClause, bestSubClause, bestSubNode;\n\n    \/\/ find the thinnest clause with constants\n    bestSubNode = find_thinnest(clauses, bestSubClause, bestClauseIndex);\n\n    if (bestSubNode != Handle::UNDEFINED && !vars.empty())\n    {\n        bestClause = clauses[bestClauseIndex];\n\n        logger().debug(\"[SuReal] Search start node: %s\", bestSubNode->toShortString().c_str());\n        logger().debug(\"[SuReal] Start pred is: %s\", bestSubClause->toShortString().c_str());\n\n        IncomingSet iset = get_incoming_set(bestSubNode);\n\n        for (auto& l : iset)\n        {\n            Handle h(l);\n            logger().debug(\"[SuReal] Loop candidate: %s\", h->toShortString().c_str());\n\n            if (pPME->do_candidate(bestClause, bestSubClause, h))\n                break;\n        }\n\n        return;\n    }\n\n    \/\/ reaching here means no contants, so do some search space reduction here\n    bestClause = clauses[0];\n\n    logger().debug(\"[SuReal] Start pred is: %s\", bestClause->toShortString().c_str());\n\n    \/\/ helper for checking for InterpretationNode\n    auto hasNoInterpretation = [this](Handle& h)\n    {\n        HandleSeq qISet = _as->getIncoming(h);\n        qISet.erase(std::remove_if(qISet.begin(), qISet.end(), [](Handle& hl) { return hl->getType() != SET_LINK; }), qISet.end());\n\n        auto hasNode = [this](Handle& hl)\n        {\n            HandleSeq qN = _as->getNeighbors(hl, true, false, REFERENCE_LINK, false);\n            return std::any_of(qN.begin(), qN.end(), [](Handle& hn) { return hn->getType() == INTERPRETATION_NODE; });\n        };\n\n        return not std::any_of(qISet.begin(), qISet.end(), hasNode);\n    };\n\n    \/\/ keep only links of the same type as bestClause and have linkage to InterpretationNode\n    HandleSeq qCandidate;\n    _as->getHandlesByType(std::back_inserter(qCandidate), bestClause->getType());\n    qCandidate.erase(std::remove_if(qCandidate.begin(), qCandidate.end(), hasNoInterpretation), qCandidate.end());\n\n    for (auto& c : qCandidate)\n    {\n        logger().debug(\"[SuReal] Loop candidate: %s\", c->toShortString().c_str());\n\n        if (pPME->do_candidate(bestClause, bestClause, c))\n            break;\n    }\n}\n\n\/**\n * Override the find_starter method in DefaultPatternMatchCB.\n *\n * Override find_starter so that it will not treat VariableNode variables,\n * but instead compare against the variable list.\n *\n * @param h       same as DefaultPatternMatchCB::find_starter\n * @param depth   same as DefaultPatternMatchCB::find_starter\n * @param start   same as DefaultPatternMatchCB::find_starter\n * @param width   same as DefaultPatternMatchCB::find_starter\n * @return        same as DefaultPatternMatchCB::find_starter but change\n *                the result if is a variable\n *\/\nHandle SuRealPMCB::find_starter(Handle h, size_t& depth, Handle& start, size_t& width)\n{\n    Handle rh = DefaultPatternMatchCB::find_starter(h, depth, start, width);\n\n    \/\/ if the non-VariableNode is actually a variable\n    if (m_vars.count(rh) == 1)\n        return Handle::UNDEFINED;\n\n    return rh;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef UNITTEST_MOCK_STORE_HPP_\n#define UNITTEST_MOCK_STORE_HPP_\n\n#include \"rdb_protocol\/protocol.hpp\"\n\nnamespace unittest {\n\nclass mock_store_t : public store_view_t<rdb_protocol_t> {\npublic:\n    mock_store_t();\n    ~mock_store_t();\n\n    void new_read_token(object_buffer_t<fifo_enforcer_sink_t::exit_read_t> *token_out);\n    void new_write_token(object_buffer_t<fifo_enforcer_sink_t::exit_write_t> *token_out);\n\n    void do_get_metainfo(order_token_t order_token,\n                         object_buffer_t<fifo_enforcer_sink_t::exit_read_t> *token,\n                         signal_t *interruptor,\n                         metainfo_t *out) THROWS_ONLY(interrupted_exc_t) = 0;\n\n    void set_metainfo(const metainfo_t &new_metainfo,\n                      order_token_t order_token,\n                      object_buffer_t<fifo_enforcer_sink_t::exit_write_t> *token,\n                      signal_t *interruptor) THROWS_ONLY(interrupted_exc_t) = 0;\n\n    void read(\n            DEBUG_ONLY(const metainfo_checker_t<rdb_protocol_t> &metainfo_checker, )\n            const rdb_protocol_t::read_t &read,\n            rdb_protocol_t::read_response_t *response,\n            order_token_t order_token,\n            read_token_pair_t *token,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\n    void write(\n            DEBUG_ONLY(const metainfo_checker_t<rdb_protocol_t> &metainfo_checker, )\n            const metainfo_t& new_metainfo,\n            const rdb_protocol_t::write_t &write,\n            rdb_protocol_t::write_response_t *response,\n            write_durability_t durability,\n            transition_timestamp_t timestamp,\n            order_token_t order_token,\n            write_token_pair_t *token,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\n    bool send_backfill(\n            const region_map_t<rdb_protocol_t, state_timestamp_t> &start_point,\n            send_backfill_callback_t<rdb_protocol_t> *send_backfill_cb,\n            traversal_progress_combiner_t *progress,\n            read_token_pair_t *token,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\n    void receive_backfill(\n            const rdb_protocol_t::backfill_chunk_t &chunk,\n            write_token_pair_t *token,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\n    void reset_data(\n            const rdb_protocol_t::region_t &subregion,\n            const metainfo_t &new_metainfo,\n            write_token_pair_t *token,\n            write_durability_t durability,\n            signal_t *interruptor)\n            THROWS_ONLY(interrupted_exc_t) = 0;\n\nprivate:\n    fifo_enforcer_source_t token_source_;\n    fifo_enforcer_sink_t token_sink_;\n\n    order_sink_t order_sink_;\n\n    rng_t rng_;\n    metainfo_t metainfo_;\n    std::map<store_key_t, std::pair<repli_timestamp_t, counted_t<const ql::datum_t> > > table_;\n\n    DISABLE_COPYING(mock_store_t);\n};\n\n}  \/\/ namespace unittest\n\n#endif  \/\/ UNITTEST_MOCK_STORE_HPP_\n<commit_msg>Removed \"= 0\" on mock_store_t::reset_data.<commit_after>#ifndef UNITTEST_MOCK_STORE_HPP_\n#define UNITTEST_MOCK_STORE_HPP_\n\n#include \"rdb_protocol\/protocol.hpp\"\n\nnamespace unittest {\n\nclass mock_store_t : public store_view_t<rdb_protocol_t> {\npublic:\n    mock_store_t();\n    ~mock_store_t();\n\n    void new_read_token(object_buffer_t<fifo_enforcer_sink_t::exit_read_t> *token_out);\n    void new_write_token(object_buffer_t<fifo_enforcer_sink_t::exit_write_t> *token_out);\n\n    void do_get_metainfo(order_token_t order_token,\n                         object_buffer_t<fifo_enforcer_sink_t::exit_read_t> *token,\n                         signal_t *interruptor,\n                         metainfo_t *out) THROWS_ONLY(interrupted_exc_t) = 0;\n\n    void set_metainfo(const metainfo_t &new_metainfo,\n                      order_token_t order_token,\n                      object_buffer_t<fifo_enforcer_sink_t::exit_write_t> *token,\n                      signal_t *interruptor) THROWS_ONLY(interrupted_exc_t) = 0;\n\n    void read(\n            DEBUG_ONLY(const metainfo_checker_t<rdb_protocol_t> &metainfo_checker, )\n            const rdb_protocol_t::read_t &read,\n            rdb_protocol_t::read_response_t *response,\n            order_token_t order_token,\n            read_token_pair_t *token,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\n    void write(\n            DEBUG_ONLY(const metainfo_checker_t<rdb_protocol_t> &metainfo_checker, )\n            const metainfo_t& new_metainfo,\n            const rdb_protocol_t::write_t &write,\n            rdb_protocol_t::write_response_t *response,\n            write_durability_t durability,\n            transition_timestamp_t timestamp,\n            order_token_t order_token,\n            write_token_pair_t *token,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\n    bool send_backfill(\n            const region_map_t<rdb_protocol_t, state_timestamp_t> &start_point,\n            send_backfill_callback_t<rdb_protocol_t> *send_backfill_cb,\n            traversal_progress_combiner_t *progress,\n            read_token_pair_t *token,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\n    void receive_backfill(\n            const rdb_protocol_t::backfill_chunk_t &chunk,\n            write_token_pair_t *token,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\n    void reset_data(\n            const rdb_protocol_t::region_t &subregion,\n            const metainfo_t &new_metainfo,\n            write_token_pair_t *token,\n            write_durability_t durability,\n            signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t);\n\nprivate:\n    fifo_enforcer_source_t token_source_;\n    fifo_enforcer_sink_t token_sink_;\n\n    order_sink_t order_sink_;\n\n    rng_t rng_;\n    metainfo_t metainfo_;\n    std::map<store_key_t, std::pair<repli_timestamp_t, counted_t<const ql::datum_t> > > table_;\n\n    DISABLE_COPYING(mock_store_t);\n};\n\n}  \/\/ namespace unittest\n\n#endif  \/\/ UNITTEST_MOCK_STORE_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/include\/usr\/pnor\/pnor_reasoncodes.H $                     *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2011,2015                        *\/\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#ifndef __PNOR_REASONCODES_H\n#define __PNOR_REASONCODES_H\n\n#include <hbotcompid.H>\n\nnamespace PNOR\n{\n    enum PNORModuleId\n    {\n        \/\/ pnorrp.C\n        MOD_PNORRP_WAITFORMESSAGE       = 0x01, \/**< PnorRP::waitForMessage *\/\n        MOD_PNORRP_COMPUTEDEVICEADDR    = 0x02, \/**< PnorRP::computeDeviceAddr *\/\n        MOD_PNORRP_GETSECTIONINFO       = 0x03, \/**< PnorRP::getSectionInfo *\/\n        MOD_PNORRP_COMPUTESECTION       = 0x04, \/**< PnorRP::computeSection *\/\n        MOD_PNORRP_INITDAEMON           = 0x05, \/**< PnorRP::initDaemon *\/\n        MOD_PNORRP_READTOC              = 0x06, \/**< PnorRP::readTOC *\/\n        MOD_PNORRP_READFROMDEVICE       = 0x07, \/**< PnorRP::readFromDevice *\/\n        MOD_PNORRP_WRITETODEVICE        = 0x08, \/**< PnorRP::writeToDevice *\/\n        MOD_PNORRP_DIDSTARTUPFAIL       = 0x09, \/**< didStartupFail(rc) *\/\n        MOD_PNORRP_FLUSH                = 0x0A, \/**< mm_remove_pages *\/\n        MOD_PNORRP_FIXECC               = 0x0B, \/**< PnorRP::fixECC *\/\n        MOD_PNORRP_FINDTOC              = 0x0C, \/**< PnorRP::findTOC *\/\n        MOD_PNORRP_GETSIDEINFO          = 0x0D, \/**< PnorRP::getSideInfo *\/\n        MOD_PNORRP_SETSIDEINFO          = 0x0E, \/**< PnorRP::setSideInfo *\/\n\n        \/\/ pnorvalid.C\n        MOD_PNORVALID_MAIN              = 0x0E, \/**< validateAltMaster *\/\n        MOD_PNORVALID_MAGIC             = 0x0F, \/**< validateAltMaster *\/\n\n        \/\/ pnordd.C\n        MOD_PNORDD_VERIFYADDRESSRANGE   = 0x11, \/**< PnorDD::verifyAddressRange *\/\n        MOD_PNORDD_READFLASH            = 0x12, \/**< PnorDD::readFlash *\/\n        MOD_PNORDD_WRITEFLASH           = 0x13, \/**< PnorDD::writeFlash *\/\n        MOD_PNORDD_SFCINIT              = 0x14, \/**< PnorDD::sfcInit *\/\n        MOD_PNORDD_ERASEFLASH           = 0x15, \/**< PnorDD::eraseFlash *\/\n        MOD_PNORDD_CHECKFORERRORS       = 0x16, \/**< PnorDD::checkForErrors *\/\n\n        \/\/ sfc_ibm.C\n        MOD_SFCIBM_VERIFYADDRESSRANGE   = 0x40, \/**< SfcIBM::verifyAddressRange *\/\n        MOD_SFCIBM_READFLASH            = 0x41, \/**< SfcIBM::readFlash *\/\n        MOD_SFCIBM_WRITEFLASH           = 0x42, \/**< SfcIBM::writeFlash *\/\n        MOD_SFCIBM_POLLOPCOMPLETE       = 0x43, \/**< SfcIBM::pollSfcOpComplete *\/\n        MOD_SFCIBM_SFCINIT              = 0x44, \/**< SfcIBM::sfcInit *\/\n        MOD_SFCIBM_ERASEFLASH           = 0x45, \/**< SfcIBM::eraseFlash *\/\n        MOD_SFCIBM_CHECKFORERRORS       = 0x46, \/**< SfcIBM::checkForErrors *\/\n        MOD_SFCIBM_HWRESET              = 0x47, \/**< SfcIBM::hwReset *\/\n\n        \/\/ sfc_fake.C\n        MOD_SFCFAKE_VERIFYADDRESSRANGE  = 0x60, \/**< SfcFake::verifyAddressRange *\/\n        MOD_SFCFAKE_READFLASH           = 0x61, \/**< SfcFake::readFlash *\/\n        MOD_SFCFAKE_WRITEFLASH          = 0x62, \/**< SfcFake::writeFlash *\/\n        MOD_SFCFAKE_ERASEFLASH          = 0x63, \/**< SfcFake::eraseFlash *\/\n        MOD_SFCFAKE_SENDSPICMD          = 0x64, \/**< SfcFake::sendSpiCmd *\/\n\n        \/\/ sfc_ast2400.C\n        MOD_SFCAST2400_ENABLEWRITEMODE  = 0x80, \/**< SfcAST2400::verifyAddressRange *\/\n        MOD_SFCAST2400_READFLASH        = 0x81, \/**< SfcAST2400::readFlash *\/\n        MOD_SFCAST2400_WRITEFLASH       = 0x82, \/**< SfcAST2400::writeFlash *\/\n        MOD_SFCAST2400_POLLOPCOMPLETE   = 0x83, \/**< SfcAST2400::pollSfcOpComplete *\/\n        MOD_SFCAST2400_ERASEFLASH       = 0x84, \/**< SfcAST2400::eraseFlash *\/\n\n        \/\/ nor_micron.C\n        MOD_NORMICRON_MICRONFLAGSTATUS  = 0xA0, \/**< micronFlagStatus *\/\n\n        \/\/rt_pnor.C\n        MOD_RTPNOR_GETSECTIONINFO       = 0xB0, \/**< RtPnor::getSectionInfo*\/\n        MOD_RTPNOR_FLUSH                = 0xB1, \/**< RtPnor::flush *\/\n        MOD_RTPNOR_READFROMDEVICE       = 0xB2, \/**< RtPnor::readFromDevice *\/\n        MOD_RTPNOR_WRITETODEVICE        = 0xB3, \/**< RtPnor::writeToDevice *\/\n\n        \/\/pnor_common.C\n        MOD_PNORCOMMON_PARSETOC        = 0xC0, \/**< PNOR::parseTOC *\/\n    };\n\n    enum PNORReasonCode\n    {\n        RC_INVALID_MESSAGE_TYPE      = PNOR_COMP_ID | 0x01,\n        RC_INVALID_ADDRESS           = PNOR_COMP_ID | 0x02,\n        RC_INVALID_SECTION           = PNOR_COMP_ID | 0x03,\n        RC_EXTERNAL_ERROR            = PNOR_COMP_ID | 0x04,\n        RC_STARTUP_FAIL              = PNOR_COMP_ID | 0x05,\n        RC_INVALID_ASYNC_MESSAGE     = PNOR_COMP_ID | 0x06,\n        RC_UNSUPPORTED_OPERATION     = PNOR_COMP_ID | 0x07,\n        RC_LPC_ERROR                 = PNOR_COMP_ID | 0x08,\n        RC_BAD_STARTUP_RC            = PNOR_COMP_ID | 0x09,\n        \/\/termination_rc\n        RC_UNSUPPORTED_HARDWARE      = PNOR_COMP_ID | 0x0A,\n        RC_MICRON_INCOMPLETE         = PNOR_COMP_ID | 0x0B,\n        \/\/termination_rc\n        RC_PARTITION_TABLE_INVALID   = PNOR_COMP_ID | 0x0C,\n        \/\/termination_rc\n        RC_UNSUPPORTED_MODE          = PNOR_COMP_ID | 0x0D,\n        \/\/termination_rc\n        RC_UNSUPPORTED_SFCRANGE      = PNOR_COMP_ID | 0x0E,\n        \/\/termination_rc\n        RC_ECC_UE                    = PNOR_COMP_ID | 0x0F,\n        RC_ERROR_IN_STATUS_REG       = PNOR_COMP_ID | 0x10,\n        \/\/termination_rc\n        RC_REINITIALIZE_SFC          = PNOR_COMP_ID | 0x11,\n        RC_SFC_ERROR                 = PNOR_COMP_ID | 0x12,\n        \/\/termination_rc\n        RC_PNOR_INIT_FAILURE         = PNOR_COMP_ID | 0x13,\n        RC_CANNOT_ENABLE_WRITES      = PNOR_COMP_ID | 0x14,\n        RC_SFC_TIMEOUT               = PNOR_COMP_ID | 0x15,\n        RC_PNOR_READ_FAILED          = PNOR_COMP_ID | 0x16,\n        RC_PNOR_WRITE_FAILED         = PNOR_COMP_ID | 0x17,\n        RC_CORRUPTED_TOCS            = PNOR_COMP_ID | 0x18,\n        RC_BAD_TOC_HEADER            = PNOR_COMP_ID | 0x19,\n        RC_SECTION_SIZE_IS_BIG       = PNOR_COMP_ID | 0x1A,\n        RC_RTPNOR_INVALID_SECTION    = PNOR_COMP_ID | 0x1B,\n        RC_UNCORRECTABLE_ECC         = PNOR_COMP_ID | 0x1C,\n        RC_SECTION_SIZE_IS_ZERO      = PNOR_COMP_ID | 0x1D,\n        RC_MM_REMOVE_PAGES_FAILED    = PNOR_COMP_ID | 0x1E,\n        RC_PNOR_READ_NOT_SUPPORTED   = PNOR_COMP_ID | 0x1F,\n        RC_PNOR_WRITE_NOT_SUPPORTED  = PNOR_COMP_ID | 0x20,\n        RC_NON_ECC_PROTECTED_SECTION = PNOR_COMP_ID | 0x21,\n        RC_WRITABLE_PERM_FAIL        = PNOR_COMP_ID | 0x22,\n        RC_WRITE_TRACKED_PERM_FAIL   = PNOR_COMP_ID | 0x23,\n        \/\/termination_rc\n        RC_PARTITION_TABLE_NOT_FOUND = PNOR_COMP_ID | 0x24,\n        \/\/termination_rc\n        RC_PARTITION_TABLE_CORRUPTED = PNOR_COMP_ID | 0x25,\n        \/\/termination_rc\n        RC_FINDTOC_FAILED            = PNOR_COMP_ID | 0x26,\n        RC_INVALID_PNOR_SIDE         = PNOR_COMP_ID | 0x27,\n        \/\/termination_rc\n        RC_INVALID_WORKING_TOC       = PNOR_COMP_ID | 0x28,\n        RC_INVALID_TOC               = PNOR_COMP_ID | 0x29,\n        RC_WRONG_SIZE_FROM_READ      = PNOR_COMP_ID | 0x2A,\n    };\n\n    enum UserDetailsTypes\n    {\n        PNOR_UDT_NO_FORMAT           = 0x0,\n        PNOR_UDT_PNORDD_PARAMETERS   = 0x1,\n    };\n};\n\n#endif\n<commit_msg>Add RC for HWSV to correct PNOR corruption<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/include\/usr\/pnor\/pnor_reasoncodes.H $                     *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2011,2015                        *\/\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#ifndef __PNOR_REASONCODES_H\n#define __PNOR_REASONCODES_H\n\n#include <hbotcompid.H>\n\nnamespace PNOR\n{\n    enum PNORModuleId\n    {\n        \/\/ pnorrp.C\n        MOD_PNORRP_WAITFORMESSAGE       = 0x01, \/**< PnorRP::waitForMessage *\/\n        MOD_PNORRP_COMPUTEDEVICEADDR    = 0x02, \/**< PnorRP::computeDeviceAddr *\/\n        MOD_PNORRP_GETSECTIONINFO       = 0x03, \/**< PnorRP::getSectionInfo *\/\n        MOD_PNORRP_COMPUTESECTION       = 0x04, \/**< PnorRP::computeSection *\/\n        MOD_PNORRP_INITDAEMON           = 0x05, \/**< PnorRP::initDaemon *\/\n        MOD_PNORRP_READTOC              = 0x06, \/**< PnorRP::readTOC *\/\n        MOD_PNORRP_READFROMDEVICE       = 0x07, \/**< PnorRP::readFromDevice *\/\n        MOD_PNORRP_WRITETODEVICE        = 0x08, \/**< PnorRP::writeToDevice *\/\n        MOD_PNORRP_DIDSTARTUPFAIL       = 0x09, \/**< didStartupFail(rc) *\/\n        MOD_PNORRP_FLUSH                = 0x0A, \/**< mm_remove_pages *\/\n        MOD_PNORRP_FIXECC               = 0x0B, \/**< PnorRP::fixECC *\/\n        MOD_PNORRP_FINDTOC              = 0x0C, \/**< PnorRP::findTOC *\/\n        MOD_PNORRP_GETSIDEINFO          = 0x0D, \/**< PnorRP::getSideInfo *\/\n        MOD_PNORRP_SETSIDEINFO          = 0x0E, \/**< PnorRP::setSideInfo *\/\n\n        \/\/ pnorvalid.C\n        MOD_PNORVALID_MAIN              = 0x0E, \/**< validateAltMaster *\/\n        MOD_PNORVALID_MAGIC             = 0x0F, \/**< validateAltMaster *\/\n\n        \/\/ pnordd.C\n        MOD_PNORDD_VERIFYADDRESSRANGE   = 0x11, \/**< PnorDD::verifyAddressRange *\/\n        MOD_PNORDD_READFLASH            = 0x12, \/**< PnorDD::readFlash *\/\n        MOD_PNORDD_WRITEFLASH           = 0x13, \/**< PnorDD::writeFlash *\/\n        MOD_PNORDD_SFCINIT              = 0x14, \/**< PnorDD::sfcInit *\/\n        MOD_PNORDD_ERASEFLASH           = 0x15, \/**< PnorDD::eraseFlash *\/\n        MOD_PNORDD_CHECKFORERRORS       = 0x16, \/**< PnorDD::checkForErrors *\/\n\n        \/\/ sfc_ibm.C\n        MOD_SFCIBM_VERIFYADDRESSRANGE   = 0x40, \/**< SfcIBM::verifyAddressRange *\/\n        MOD_SFCIBM_READFLASH            = 0x41, \/**< SfcIBM::readFlash *\/\n        MOD_SFCIBM_WRITEFLASH           = 0x42, \/**< SfcIBM::writeFlash *\/\n        MOD_SFCIBM_POLLOPCOMPLETE       = 0x43, \/**< SfcIBM::pollSfcOpComplete *\/\n        MOD_SFCIBM_SFCINIT              = 0x44, \/**< SfcIBM::sfcInit *\/\n        MOD_SFCIBM_ERASEFLASH           = 0x45, \/**< SfcIBM::eraseFlash *\/\n        MOD_SFCIBM_CHECKFORERRORS       = 0x46, \/**< SfcIBM::checkForErrors *\/\n        MOD_SFCIBM_HWRESET              = 0x47, \/**< SfcIBM::hwReset *\/\n\n        \/\/ sfc_fake.C\n        MOD_SFCFAKE_VERIFYADDRESSRANGE  = 0x60, \/**< SfcFake::verifyAddressRange *\/\n        MOD_SFCFAKE_READFLASH           = 0x61, \/**< SfcFake::readFlash *\/\n        MOD_SFCFAKE_WRITEFLASH          = 0x62, \/**< SfcFake::writeFlash *\/\n        MOD_SFCFAKE_ERASEFLASH          = 0x63, \/**< SfcFake::eraseFlash *\/\n        MOD_SFCFAKE_SENDSPICMD          = 0x64, \/**< SfcFake::sendSpiCmd *\/\n\n        \/\/ sfc_ast2400.C\n        MOD_SFCAST2400_ENABLEWRITEMODE  = 0x80, \/**< SfcAST2400::verifyAddressRange *\/\n        MOD_SFCAST2400_READFLASH        = 0x81, \/**< SfcAST2400::readFlash *\/\n        MOD_SFCAST2400_WRITEFLASH       = 0x82, \/**< SfcAST2400::writeFlash *\/\n        MOD_SFCAST2400_POLLOPCOMPLETE   = 0x83, \/**< SfcAST2400::pollSfcOpComplete *\/\n        MOD_SFCAST2400_ERASEFLASH       = 0x84, \/**< SfcAST2400::eraseFlash *\/\n\n        \/\/ nor_micron.C\n        MOD_NORMICRON_MICRONFLAGSTATUS  = 0xA0, \/**< micronFlagStatus *\/\n\n        \/\/rt_pnor.C\n        MOD_RTPNOR_GETSECTIONINFO       = 0xB0, \/**< RtPnor::getSectionInfo*\/\n        MOD_RTPNOR_FLUSH                = 0xB1, \/**< RtPnor::flush *\/\n        MOD_RTPNOR_READFROMDEVICE       = 0xB2, \/**< RtPnor::readFromDevice *\/\n        MOD_RTPNOR_WRITETODEVICE        = 0xB3, \/**< RtPnor::writeToDevice *\/\n\n        \/\/pnor_common.C\n        MOD_PNORCOMMON_PARSETOC        = 0xC0, \/**< PNOR::parseTOC *\/\n    };\n\n    enum PNORReasonCode\n    {\n        RC_INVALID_MESSAGE_TYPE      = PNOR_COMP_ID | 0x01,\n        RC_INVALID_ADDRESS           = PNOR_COMP_ID | 0x02,\n        RC_INVALID_SECTION           = PNOR_COMP_ID | 0x03,\n        RC_EXTERNAL_ERROR            = PNOR_COMP_ID | 0x04,\n        RC_STARTUP_FAIL              = PNOR_COMP_ID | 0x05,\n        RC_INVALID_ASYNC_MESSAGE     = PNOR_COMP_ID | 0x06,\n        RC_UNSUPPORTED_OPERATION     = PNOR_COMP_ID | 0x07,\n        RC_LPC_ERROR                 = PNOR_COMP_ID | 0x08,\n        RC_BAD_STARTUP_RC            = PNOR_COMP_ID | 0x09,\n        \/\/termination_rc\n        RC_UNSUPPORTED_HARDWARE      = PNOR_COMP_ID | 0x0A,\n        RC_MICRON_INCOMPLETE         = PNOR_COMP_ID | 0x0B,\n        \/\/termination_rc\n        RC_PARTITION_TABLE_INVALID   = PNOR_COMP_ID | 0x0C,\n        \/\/termination_rc\n        RC_UNSUPPORTED_MODE          = PNOR_COMP_ID | 0x0D,\n        \/\/termination_rc\n        RC_UNSUPPORTED_SFCRANGE      = PNOR_COMP_ID | 0x0E,\n        \/\/termination_rc\n        RC_ECC_UE                    = PNOR_COMP_ID | 0x0F,\n        RC_ERROR_IN_STATUS_REG       = PNOR_COMP_ID | 0x10,\n        \/\/termination_rc\n        RC_REINITIALIZE_SFC          = PNOR_COMP_ID | 0x11,\n        RC_SFC_ERROR                 = PNOR_COMP_ID | 0x12,\n        \/\/termination_rc\n        RC_PNOR_INIT_FAILURE         = PNOR_COMP_ID | 0x13,\n        RC_CANNOT_ENABLE_WRITES      = PNOR_COMP_ID | 0x14,\n        RC_SFC_TIMEOUT               = PNOR_COMP_ID | 0x15,\n        RC_PNOR_READ_FAILED          = PNOR_COMP_ID | 0x16,\n        RC_PNOR_WRITE_FAILED         = PNOR_COMP_ID | 0x17,\n        RC_CORRUPTED_TOCS            = PNOR_COMP_ID | 0x18,\n        RC_BAD_TOC_HEADER            = PNOR_COMP_ID | 0x19,\n        RC_SECTION_SIZE_IS_BIG       = PNOR_COMP_ID | 0x1A,\n        RC_RTPNOR_INVALID_SECTION    = PNOR_COMP_ID | 0x1B,\n        RC_UNCORRECTABLE_ECC         = PNOR_COMP_ID | 0x1C,\n        RC_SECTION_SIZE_IS_ZERO      = PNOR_COMP_ID | 0x1D,\n        RC_MM_REMOVE_PAGES_FAILED    = PNOR_COMP_ID | 0x1E,\n        RC_PNOR_READ_NOT_SUPPORTED   = PNOR_COMP_ID | 0x1F,\n        RC_PNOR_WRITE_NOT_SUPPORTED  = PNOR_COMP_ID | 0x20,\n        RC_NON_ECC_PROTECTED_SECTION = PNOR_COMP_ID | 0x21,\n        RC_WRITABLE_PERM_FAIL        = PNOR_COMP_ID | 0x22,\n        RC_WRITE_TRACKED_PERM_FAIL   = PNOR_COMP_ID | 0x23,\n        \/\/termination_rc\n        RC_PARTITION_TABLE_NOT_FOUND = PNOR_COMP_ID | 0x24,\n        \/\/termination_rc\n        RC_PARTITION_TABLE_CORRUPTED = PNOR_COMP_ID | 0x25,\n        \/\/termination_rc\n        RC_FINDTOC_FAILED            = PNOR_COMP_ID | 0x26,\n        RC_INVALID_PNOR_SIDE         = PNOR_COMP_ID | 0x27,\n        \/\/termination_rc\n        RC_INVALID_WORKING_TOC       = PNOR_COMP_ID | 0x28,\n        RC_INVALID_TOC               = PNOR_COMP_ID | 0x29,\n        RC_WRONG_SIZE_FROM_READ      = PNOR_COMP_ID | 0x2A,\n\n        \/\/@fixme-RTC:131607-Temporary value to allow HWSV compile\n        \/\/termination_rc\n        RC_PNOR_CORRUPTION           = PNOR_COMP_ID | 0x99,\n    };\n\n    enum UserDetailsTypes\n    {\n        PNOR_UDT_NO_FORMAT           = 0x0,\n        PNOR_UDT_PNORDD_PARAMETERS   = 0x1,\n    };\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright RIME Developers\n\/\/ Distributed under the BSD License\n\/\/\n\/\/ 2011-11-23 GONG Chen <chen.sst@gmail.com>\n\/\/\n#include <algorithm>\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\/schema.h>\n#include <rime\/switcher.h>\n#include <rime\/gear\/key_binder.h>\n\nusing namespace std::placeholders;\n\nnamespace rime {\n\nenum KeyBindingCondition {\n  kNever,\n  kWhenPaging,     \/\/ user has changed page\n  kWhenHasMenu,    \/\/ at least one candidate\n  kWhenComposing,  \/\/ input string is not empty\n  kAlways,\n};\n\nstatic struct KeyBindingConditionDef {\n  KeyBindingCondition condition;\n  const char* name;\n} condition_definitions[] = {\n  { kWhenPaging,    \"paging\"    },\n  { kWhenHasMenu,   \"has_menu\"  },\n  { kWhenComposing, \"composing\" },\n  { kAlways,        \"always\"    },\n  { kNever,         NULL        }\n};\n\nstatic KeyBindingCondition translate_condition(const string& str) {\n  for (auto* d = condition_definitions; d->name; ++d) {\n    if (str == d->name)\n      return d->condition;\n  }\n  return kNever;\n}\n\nstruct KeyBinding {\n  KeyBindingCondition whence;\n  KeyEvent target;\n  function<void (Engine* engine)> action;\n\n  bool operator< (const KeyBinding& o) const {\n    return whence < o.whence;\n  }\n};\n\nclass KeyBindings : public map<KeyEvent,\n                                    vector<KeyBinding>> {\n public:\n  void LoadBindings(const an<ConfigList>& bindings);\n  void Bind(const KeyEvent& key, const KeyBinding& binding);\n};\n\nstatic void toggle_option(Engine* engine, const string& option) {\n  if (!engine)\n    return;\n  Context* ctx = engine->context();\n  ctx->set_option(option, !ctx->get_option(option));\n}\nstatic void set_option(Engine* engine, const string& option) {\n  if (!engine)\n    return;\n  Context* ctx = engine->context();\n  ctx->set_option(option, 1);\n}\nstatic void unset_option(Engine* engine, const string& option) {\n  if (!engine)\n    return;\n  Context* ctx = engine->context();\n  ctx->set_option(option, 0);\n}\n\nstatic void select_schema(Engine* engine, const string& schema) {\n  if (!engine)\n    return;\n  if (schema == \".next\") {\n    Switcher switcher(engine);\n    switcher.SelectNextSchema();\n  }\n  else {\n    engine->ApplySchema(new Schema(schema));\n  }\n}\n\nvoid KeyBindings::LoadBindings(const an<ConfigList>& bindings) {\n  if (!bindings)\n    return;\n  for (size_t i = 0; i < bindings->size(); ++i) {\n    auto map = As<ConfigMap>(bindings->GetAt(i));\n    if (!map)\n      continue;\n    auto whence = map->GetValue(\"when\");\n    if (!whence)\n      continue;\n    auto pattern = map->GetValue(\"accept\");\n    if (!pattern)\n      continue;\n    KeyBinding binding;\n    binding.whence = translate_condition(whence->str());\n    if (binding.whence == kNever) {\n      continue;\n    }\n    KeyEvent key;\n    if (!key.Parse(pattern->str())) {\n      LOG(WARNING) << \"invalid key binding #\" << i << \".\";\n      continue;\n    }\n    if (auto target = map->GetValue(\"send\")) {\n      if (!binding.target.Parse(target->str())) {\n        LOG(WARNING) << \"invalid key binding #\" << i << \".\";\n        continue;\n      }\n    }\n    else if (auto option = map->GetValue(\"toggle\")) {\n      binding.action = std::bind(&toggle_option, _1, option->str());\n    }\n    else if (auto option = map->GetValue(\"set_option\")) {\n      binding.action = std::bind(&set_option, _1, option->str());\n    }\n    else if (auto option = map->GetValue(\"unset_option\")) {\n      binding.action = std::bind(&unset_option, _1, option->str());\n    }\n    else if (auto schema = map->GetValue(\"select\")) {\n      binding.action = std::bind(&select_schema, _1, schema->str());\n    }\n    else {\n      LOG(WARNING) << \"invalid key binding #\" << i << \".\";\n      continue;\n    }\n    Bind(key, binding);\n  }\n}\n\nvoid KeyBindings::Bind(const KeyEvent& key, const KeyBinding& binding) {\n  auto& vec = (*this)[key];\n  \/\/ insert before existing binding of the same condition\n  auto lb = std::lower_bound(vec.begin(), vec.end(), binding);\n  vec.insert(lb, binding);\n}\n\nKeyBinder::KeyBinder(const Ticket& ticket) : Processor(ticket),\n                                             key_bindings_(new KeyBindings),\n                                             redirecting_(false),\n                                             last_key_(0) {\n  LoadConfig();\n}\n\nclass KeyBindingConditions : public set<KeyBindingCondition> {\n public:\n  explicit KeyBindingConditions(Context* ctx);\n};\n\nKeyBindingConditions::KeyBindingConditions(Context* ctx) {\n  insert(kAlways);\n\n  if (ctx->IsComposing()) {\n    insert(kWhenComposing);\n  }\n\n  if (ctx->HasMenu() && !ctx->get_option(\"ascii_mode\")) {\n    insert(kWhenHasMenu);\n  }\n\n  Composition& comp = ctx->composition();\n  if (!comp.empty() && comp.back().HasTag(\"paging\")) {\n    insert(kWhenPaging);\n  }\n}\n\nProcessResult KeyBinder::ProcessKeyEvent(const KeyEvent& key_event) {\n  if (redirecting_ || !key_bindings_ || key_bindings_->empty())\n    return kNoop;\n  if (ReinterpretPagingKey(key_event))\n    return kNoop;\n  if (key_bindings_->find(key_event) == key_bindings_->end())\n    return kNoop;\n  KeyBindingConditions conditions(engine_->context());\n  for (const KeyBinding& binding : (*key_bindings_)[key_event]) {\n    if (conditions.find(binding.whence) == conditions.end())\n      continue;\n    PerformKeyBinding(binding);\n    return kAccepted;\n  }\n  \/\/ not handled\n  return kNoop;\n}\n\nvoid KeyBinder::PerformKeyBinding(const KeyBinding& binding) {\n  if (binding.action) {\n    binding.action(engine_);\n  }\n  else {\n    redirecting_ = true;\n    engine_->ProcessKey(binding.target);\n    redirecting_ = false;\n  }\n}\n\nvoid KeyBinder::LoadConfig() {\n  if (!engine_)\n    return;\n  Config* config = engine_->schema()->config();\n  if (auto bindings = config->GetList(\"key_binder\/bindings\"))\n    key_bindings_->LoadBindings(bindings);\n}\n\nbool KeyBinder::ReinterpretPagingKey(const KeyEvent& key_event) {\n  if (key_event.release())\n    return false;\n  bool ret = false;\n  int ch = (key_event.modifier() == 0) ? key_event.keycode() : 0;\n  \/\/ reinterpret period key followed by alphabetic keys\n  \/\/ unless period\/comma key has been used multiple times\n  if (ch == '.' && (last_key_ == '.' || last_key_ == ',')) {\n    last_key_ = 0;\n    return ret;\n  }\n  if (last_key_ == '.' && ch >= 'a' && ch <= 'z') {\n    Context* ctx = engine_->context();\n    const string& input(ctx->input());\n    if (!input.empty() && input[input.length() - 1] != '.') {\n      LOG(INFO) << \"reinterpreted key: '\" << last_key_\n                << \"', successor: '\" << (char)ch << \"'\";\n      ctx->PushInput(last_key_);\n      ret = true;\n    }\n  }\n  last_key_ = ch;\n  return ret;\n}\n\n}  \/\/ namespace rime\n<commit_msg>feat(key_binder): bind key to a key sequence Closes #301<commit_after>\/\/\n\/\/ Copyright RIME Developers\n\/\/ Distributed under the BSD License\n\/\/\n\/\/ 2011-11-23 GONG Chen <chen.sst@gmail.com>\n\/\/\n#include <algorithm>\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\/schema.h>\n#include <rime\/switcher.h>\n#include <rime\/gear\/key_binder.h>\n\nusing namespace std::placeholders;\n\nnamespace rime {\n\nenum KeyBindingCondition {\n  kNever,\n  kWhenPaging,     \/\/ user has changed page\n  kWhenHasMenu,    \/\/ at least one candidate\n  kWhenComposing,  \/\/ input string is not empty\n  kAlways,\n};\n\nstatic struct KeyBindingConditionDef {\n  KeyBindingCondition condition;\n  const char* name;\n} condition_definitions[] = {\n  { kWhenPaging,    \"paging\"    },\n  { kWhenHasMenu,   \"has_menu\"  },\n  { kWhenComposing, \"composing\" },\n  { kAlways,        \"always\"    },\n  { kNever,         NULL        }\n};\n\nstatic KeyBindingCondition translate_condition(const string& str) {\n  for (auto* d = condition_definitions; d->name; ++d) {\n    if (str == d->name)\n      return d->condition;\n  }\n  return kNever;\n}\n\nstruct KeyBinding {\n  KeyBindingCondition whence;\n  KeySequence target;\n  function<void (Engine* engine)> action;\n\n  bool operator< (const KeyBinding& o) const {\n    return whence < o.whence;\n  }\n};\n\nclass KeyBindings : public map<KeyEvent,\n                                    vector<KeyBinding>> {\n public:\n  void LoadBindings(const an<ConfigList>& bindings);\n  void Bind(const KeyEvent& key, const KeyBinding& binding);\n};\n\nstatic void toggle_option(Engine* engine, const string& option) {\n  if (!engine)\n    return;\n  Context* ctx = engine->context();\n  ctx->set_option(option, !ctx->get_option(option));\n}\nstatic void set_option(Engine* engine, const string& option) {\n  if (!engine)\n    return;\n  Context* ctx = engine->context();\n  ctx->set_option(option, 1);\n}\nstatic void unset_option(Engine* engine, const string& option) {\n  if (!engine)\n    return;\n  Context* ctx = engine->context();\n  ctx->set_option(option, 0);\n}\n\nstatic void select_schema(Engine* engine, const string& schema) {\n  if (!engine)\n    return;\n  if (schema == \".next\") {\n    Switcher switcher(engine);\n    switcher.SelectNextSchema();\n  }\n  else {\n    engine->ApplySchema(new Schema(schema));\n  }\n}\n\nvoid KeyBindings::LoadBindings(const an<ConfigList>& bindings) {\n  if (!bindings)\n    return;\n  for (size_t i = 0; i < bindings->size(); ++i) {\n    auto map = As<ConfigMap>(bindings->GetAt(i));\n    if (!map)\n      continue;\n    auto whence = map->GetValue(\"when\");\n    if (!whence)\n      continue;\n    auto pattern = map->GetValue(\"accept\");\n    if (!pattern)\n      continue;\n    KeyBinding binding;\n    binding.whence = translate_condition(whence->str());\n    if (binding.whence == kNever) {\n      continue;\n    }\n    KeyEvent key;\n    if (!key.Parse(pattern->str())) {\n      LOG(WARNING) << \"invalid key binding #\" << i << \".\";\n      continue;\n    }\n    if (auto target = map->GetValue(\"send\")) {\n      KeyEvent key;\n      if (key.Parse(target->str())) {\n        binding.target.push_back(std::move(key));\n      } else {\n        LOG(WARNING) << \"invalid key binding #\" << i << \".\";\n        continue;\n      }\n    }\n    else if (auto target = map->GetValue(\"send_sequence\")) {\n      if (!binding.target.Parse(target->str())) {\n        LOG(WARNING) << \"invalid key sequence #\" << i << \".\";\n        continue;\n      }\n    }\n    else if (auto option = map->GetValue(\"toggle\")) {\n      binding.action = std::bind(&toggle_option, _1, option->str());\n    }\n    else if (auto option = map->GetValue(\"set_option\")) {\n      binding.action = std::bind(&set_option, _1, option->str());\n    }\n    else if (auto option = map->GetValue(\"unset_option\")) {\n      binding.action = std::bind(&unset_option, _1, option->str());\n    }\n    else if (auto schema = map->GetValue(\"select\")) {\n      binding.action = std::bind(&select_schema, _1, schema->str());\n    }\n    else {\n      LOG(WARNING) << \"invalid key binding #\" << i << \".\";\n      continue;\n    }\n    Bind(key, binding);\n  }\n}\n\nvoid KeyBindings::Bind(const KeyEvent& key, const KeyBinding& binding) {\n  auto& vec = (*this)[key];\n  \/\/ insert before existing binding of the same condition\n  auto lb = std::lower_bound(vec.begin(), vec.end(), binding);\n  vec.insert(lb, binding);\n}\n\nKeyBinder::KeyBinder(const Ticket& ticket) : Processor(ticket),\n                                             key_bindings_(new KeyBindings),\n                                             redirecting_(false),\n                                             last_key_(0) {\n  LoadConfig();\n}\n\nclass KeyBindingConditions : public set<KeyBindingCondition> {\n public:\n  explicit KeyBindingConditions(Context* ctx);\n};\n\nKeyBindingConditions::KeyBindingConditions(Context* ctx) {\n  insert(kAlways);\n\n  if (ctx->IsComposing()) {\n    insert(kWhenComposing);\n  }\n\n  if (ctx->HasMenu() && !ctx->get_option(\"ascii_mode\")) {\n    insert(kWhenHasMenu);\n  }\n\n  Composition& comp = ctx->composition();\n  if (!comp.empty() && comp.back().HasTag(\"paging\")) {\n    insert(kWhenPaging);\n  }\n}\n\nProcessResult KeyBinder::ProcessKeyEvent(const KeyEvent& key_event) {\n  if (redirecting_ || !key_bindings_ || key_bindings_->empty())\n    return kNoop;\n  if (ReinterpretPagingKey(key_event))\n    return kNoop;\n  if (key_bindings_->find(key_event) == key_bindings_->end())\n    return kNoop;\n  KeyBindingConditions conditions(engine_->context());\n  for (const KeyBinding& binding : (*key_bindings_)[key_event]) {\n    if (conditions.find(binding.whence) == conditions.end())\n      continue;\n    PerformKeyBinding(binding);\n    return kAccepted;\n  }\n  \/\/ not handled\n  return kNoop;\n}\n\nvoid KeyBinder::PerformKeyBinding(const KeyBinding& binding) {\n  if (binding.action) {\n    binding.action(engine_);\n  }\n  else {\n    redirecting_ = true;\n    for (const KeyEvent& key_event : binding.target) {\n      engine_->ProcessKey(key_event);\n    }\n    redirecting_ = false;\n  }\n}\n\nvoid KeyBinder::LoadConfig() {\n  if (!engine_)\n    return;\n  Config* config = engine_->schema()->config();\n  if (auto bindings = config->GetList(\"key_binder\/bindings\"))\n    key_bindings_->LoadBindings(bindings);\n}\n\nbool KeyBinder::ReinterpretPagingKey(const KeyEvent& key_event) {\n  if (key_event.release())\n    return false;\n  bool ret = false;\n  int ch = (key_event.modifier() == 0) ? key_event.keycode() : 0;\n  \/\/ reinterpret period key followed by alphabetic keys\n  \/\/ unless period\/comma key has been used multiple times\n  if (ch == '.' && (last_key_ == '.' || last_key_ == ',')) {\n    last_key_ = 0;\n    return ret;\n  }\n  if (last_key_ == '.' && ch >= 'a' && ch <= 'z') {\n    Context* ctx = engine_->context();\n    const string& input(ctx->input());\n    if (!input.empty() && input[input.length() - 1] != '.') {\n      LOG(INFO) << \"reinterpreted key: '\" << last_key_\n                << \"', successor: '\" << (char)ch << \"'\";\n      ctx->PushInput(last_key_);\n      ret = true;\n    }\n  }\n  last_key_ = ch;\n  return ret;\n}\n\n}  \/\/ namespace rime\n<|endoftext|>"}
{"text":"<commit_before>\ntemplate <typename T> __host__ __device__ Vector2<T>::Vector2() { x = y = 0; }\n\ntemplate <typename T>\n__host__ __device__ Vector2<T>::Vector2(T _x, T _y) : x(_x), y(_y) {}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T>::Vector2(const Point2<T> &p) : x(p.x), y(p.y) {}\n\ntemplate <typename T> __host__ __device__ Vector2<T>::Vector2(T f) {\n  x = y = f;\n}\n\ntemplate <typename T> __host__ __device__ Vector2<T>::Vector2(T *f) {\n  x = f[0];\n  y = f[1];\n}\n\ntemplate <typename T>\n__host__ __device__ T Vector2<T>::operator[](size_t i) const {\n  return (&x)[i];\n}\n\ntemplate <typename T> __host__ __device__ T &Vector2<T>::operator[](size_t i) {\n  return (&x)[i];\n}\n\n\/\/ arithmetic\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::\noperator+(const Vector2<T> &v) const {\n  return Vector2(x + v.x, y + v.y);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> &Vector2<T>::operator+=(const Vector2<T> &v) {\n  x += v.x;\n  y += v.y;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::\noperator-(const Vector2<T> &v) const {\n  return Vector2(x - v.x, y - v.y);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> &Vector2<T>::operator-=(const Vector2<T> &v) {\n  x -= v.x;\n  y -= v.y;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::operator*(T f) const {\n  return Vector2(x * f, y * f);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> &Vector2<T>::operator*=(T f) {\n  x *= f;\n  y *= f;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::operator\/(T f) const {\n  CHECK_FLOAT_EQUAL(f, 0.f);\n  T inv = 1.f \/ f;\n  return Vector2(x * inv, y * inv);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> &Vector2<T>::operator\/=(T f) {\n  CHECK_FLOAT_EQUAL(f, 0.f);\n  T inv = 1.f \/ f;\n  x *= inv;\n  y *= inv;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::operator-() const {\n  return Vector2(-x, -y);\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector2<T>::operator==(const Vector2<T> &v) {\n  return Check::isEqual(x, v.x) && Check::isEqual(y, v.y);\n}\n\ntemplate <typename T> __host__ __device__ T Vector2<T>::length2() const {\n  return x * x + y * y;\n}\n\ntemplate <typename T> __host__ __device__ T Vector2<T>::length() const {\n  return sqrtf(length2());\n}\n\ntemplate <typename T> __host__ __device__ Vector2<T> Vector2<T>::right() const {\n  return Vector2(y, -x);\n}\n\ntemplate <typename T> __host__ __device__ Vector2<T> Vector2<T>::left() const {\n  return Vector2(-y, x);\n}\n\ntemplate <typename T>\n__host__ __device__ std::ostream &operator<<(std::ostream &os,\n                                             const Vector2<T> &v) {\n  os << \"[vector2]\" << v.x << \" \" << v.y << std::endl;\n  return os;\n}\n\ntemplate <typename T> __host__ __device__ Vector3<T>::Vector3() {\n  x = y = z = 0;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T>::Vector3(T _f) : x(_f), y(_f), z(_f) {}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T>::Vector3(T _x, T _y, T _z)\n    : x(_x), y(_y), z(_z) {}\n\ntemplate <typename T> __host__ __device__ Vector3<T>::Vector3(const T *v) {\n  x = v[0];\n  y = v[1];\n  z = v[2];\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T>::Vector3(const Point3<T> &p)\n    : x(p.x), y(p.y), z(p.z) {}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator==(const Vector3<T> &v) const {\n  return Check::isEqual(x, v.x) && Check::isEqual(y, v.y) &&\n         Check::isEqual(z, v.z);\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator<(const Vector3<T> &v) const {\n  if (x < v.x)\n    return true;\n  if (y < v.y)\n    return true;\n  return z < v.z;\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator>(const Vector3<T> &v) const {\n  if (x > v.x)\n    return true;\n  if (y > v.y)\n    return true;\n  return z > v.z;\n}\n\ntemplate <typename T>\n__host__ __device__ T Vector3<T>::operator[](int i) const {\n  return (&x)[i];\n}\n\ntemplate <typename T> __host__ __device__ T &Vector3<T>::operator[](int i) {\n  return (&x)[i];\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector3<T>::xy(int i, int j) const {\n  T a = x;\n  if (i == 1)\n    a = y;\n  else if (i == 2)\n    a = z;\n  T b = y;\n  if (j == 0)\n    b = x;\n  else if (j == 2)\n    b = z;\n  return Vector2<T>(a, b);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator=(const T &v) {\n  x = y = z = v;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::\noperator+(const Vector3<T> &v) const {\n  return Vector3(x + v.x, y + v.y, z + v.z);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator+=(const Vector3<T> &v) {\n  x += v.x;\n  y += v.y;\n  z += v.z;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::\noperator-(const Vector3<T> &v) const {\n  return Vector3(x - v.x, y - v.y, z - v.z);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator-=(const Vector3<T> &v) {\n  x -= v.x;\n  y -= v.y;\n  z -= v.z;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::\noperator*(const Vector3<T> &v) const {\n  return Vector3(x * v.x, y * v.y, z * v.z);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::operator*(T f) const {\n  return Vector3(x * f, y * f, z * f);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator*=(T f) {\n  x *= f;\n  y *= f;\n  z *= f;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::operator\/(T f) const {\n  CHECK_FLOAT_EQUAL(f, 0.f);\n  T inv = 1.f \/ f;\n  return Vector3(x * inv, y * inv, z * inv);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator\/=(T f) {\n  CHECK_FLOAT_EQUAL(f, 0.f);\n  T inv = 1.f \/ f;\n  x *= inv;\n  y *= inv;\n  z *= inv;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator\/=(const Vector3<T> &v) {\n  x \/= v.x;\n  y \/= v.y;\n  z \/= v.z;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::operator-() const {\n  return Vector3(-x, -y, -z);\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator>=(const Vector3<T> &p) const {\n  return x >= p.x && y >= p.y && z >= p.z;\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator<=(const Vector3<T> &p) const {\n  return x <= p.x && y <= p.y && z <= p.z;\n}\n\ntemplate <typename T> __host__ __device__ T Vector3<T>::length2() const {\n  return x * x + y * y + z * z;\n}\n\ntemplate <typename T> __host__ __device__ T Vector3<T>::length() const {\n  return sqrtf(length2());\n}\n\ntemplate <typename T>\n__host__ std::ostream &operator<<(std::ostream &os, const Vector3<T> &v) {\n  os << \"[vector3]\" << v.x << \" \" << v.y << \" \" << v.z << std::endl;\n  return os;\n}\n\ntemplate <typename T>\n__host__ __device__ T dot(const Vector3<T> &a, const Vector3<T> &b) {\n  return a.x * b.x + a.y * b.y + a.z * b.z;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> cross(const Vector3<T> &a, const Vector3<T> &b) {\n  return Vector3<T>((a.y * b.z) - (a.z * b.y), (a.z * b.x) - (a.x * b.z),\n                    (a.x * b.y) - (a.y * b.x));\n}\n\ntemplate <typename T>\n__host__ __device__ T triple(const Vector3<T> &a, const Vector3<T> &b,\n                             const Vector3<T> &c) {\n  return dot(a, cross(b, c));\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> normalize(const Vector3<T> &v) {\n  if (v.length2() == 0.f)\n    return v;\n  return v \/ v.length();\n}<commit_msg>check float equal bug<commit_after>\ntemplate <typename T> __host__ __device__ Vector2<T>::Vector2() { x = y = 0; }\n\ntemplate <typename T>\n__host__ __device__ Vector2<T>::Vector2(T _x, T _y) : x(_x), y(_y) {}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T>::Vector2(const Point2<T> &p) : x(p.x), y(p.y) {}\n\ntemplate <typename T> __host__ __device__ Vector2<T>::Vector2(T f) {\n  x = y = f;\n}\n\ntemplate <typename T> __host__ __device__ Vector2<T>::Vector2(T *f) {\n  x = f[0];\n  y = f[1];\n}\n\ntemplate <typename T>\n__host__ __device__ T Vector2<T>::operator[](size_t i) const {\n  return (&x)[i];\n}\n\ntemplate <typename T> __host__ __device__ T &Vector2<T>::operator[](size_t i) {\n  return (&x)[i];\n}\n\n\/\/ arithmetic\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::\noperator+(const Vector2<T> &v) const {\n  return Vector2(x + v.x, y + v.y);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> &Vector2<T>::operator+=(const Vector2<T> &v) {\n  x += v.x;\n  y += v.y;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::\noperator-(const Vector2<T> &v) const {\n  return Vector2(x - v.x, y - v.y);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> &Vector2<T>::operator-=(const Vector2<T> &v) {\n  x -= v.x;\n  y -= v.y;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::operator*(T f) const {\n  return Vector2(x * f, y * f);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> &Vector2<T>::operator*=(T f) {\n  x *= f;\n  y *= f;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::operator\/(T f) const {\n  Check::isEqual(f, 0.f);\n  T inv = 1.f \/ f;\n  return Vector2(x * inv, y * inv);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> &Vector2<T>::operator\/=(T f) {\n  Check::isEqual(f, 0.f);\n  T inv = 1.f \/ f;\n  x *= inv;\n  y *= inv;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector2<T>::operator-() const {\n  return Vector2(-x, -y);\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector2<T>::operator==(const Vector2<T> &v) {\n  return Check::isEqual(x, v.x) && Check::isEqual(y, v.y);\n}\n\ntemplate <typename T> __host__ __device__ T Vector2<T>::length2() const {\n  return x * x + y * y;\n}\n\ntemplate <typename T> __host__ __device__ T Vector2<T>::length() const {\n  return sqrtf(length2());\n}\n\ntemplate <typename T> __host__ __device__ Vector2<T> Vector2<T>::right() const {\n  return Vector2(y, -x);\n}\n\ntemplate <typename T> __host__ __device__ Vector2<T> Vector2<T>::left() const {\n  return Vector2(-y, x);\n}\n\ntemplate <typename T>\n__host__ __device__ std::ostream &operator<<(std::ostream &os,\n                                             const Vector2<T> &v) {\n  os << \"[vector2]\" << v.x << \" \" << v.y << std::endl;\n  return os;\n}\n\ntemplate <typename T> __host__ __device__ Vector3<T>::Vector3() {\n  x = y = z = 0;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T>::Vector3(T _f) : x(_f), y(_f), z(_f) {}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T>::Vector3(T _x, T _y, T _z)\n    : x(_x), y(_y), z(_z) {}\n\ntemplate <typename T> __host__ __device__ Vector3<T>::Vector3(const T *v) {\n  x = v[0];\n  y = v[1];\n  z = v[2];\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T>::Vector3(const Point3<T> &p)\n    : x(p.x), y(p.y), z(p.z) {}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator==(const Vector3<T> &v) const {\n  return Check::isEqual(x, v.x) && Check::isEqual(y, v.y) &&\n         Check::isEqual(z, v.z);\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator<(const Vector3<T> &v) const {\n  if (x < v.x)\n    return true;\n  if (y < v.y)\n    return true;\n  return z < v.z;\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator>(const Vector3<T> &v) const {\n  if (x > v.x)\n    return true;\n  if (y > v.y)\n    return true;\n  return z > v.z;\n}\n\ntemplate <typename T>\n__host__ __device__ T Vector3<T>::operator[](int i) const {\n  return (&x)[i];\n}\n\ntemplate <typename T> __host__ __device__ T &Vector3<T>::operator[](int i) {\n  return (&x)[i];\n}\n\ntemplate <typename T>\n__host__ __device__ Vector2<T> Vector3<T>::xy(int i, int j) const {\n  T a = x;\n  if (i == 1)\n    a = y;\n  else if (i == 2)\n    a = z;\n  T b = y;\n  if (j == 0)\n    b = x;\n  else if (j == 2)\n    b = z;\n  return Vector2<T>(a, b);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator=(const T &v) {\n  x = y = z = v;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::\noperator+(const Vector3<T> &v) const {\n  return Vector3(x + v.x, y + v.y, z + v.z);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator+=(const Vector3<T> &v) {\n  x += v.x;\n  y += v.y;\n  z += v.z;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::\noperator-(const Vector3<T> &v) const {\n  return Vector3(x - v.x, y - v.y, z - v.z);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator-=(const Vector3<T> &v) {\n  x -= v.x;\n  y -= v.y;\n  z -= v.z;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::\noperator*(const Vector3<T> &v) const {\n  return Vector3(x * v.x, y * v.y, z * v.z);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::operator*(T f) const {\n  return Vector3(x * f, y * f, z * f);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator*=(T f) {\n  x *= f;\n  y *= f;\n  z *= f;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::operator\/(T f) const {\n  Check::isEqual(f, 0.f);\n  T inv = 1.f \/ f;\n  return Vector3(x * inv, y * inv, z * inv);\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator\/=(T f) {\n  Check::isEqual(f, 0.f);\n  T inv = 1.f \/ f;\n  x *= inv;\n  y *= inv;\n  z *= inv;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> &Vector3<T>::operator\/=(const Vector3<T> &v) {\n  x \/= v.x;\n  y \/= v.y;\n  z \/= v.z;\n  return *this;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> Vector3<T>::operator-() const {\n  return Vector3(-x, -y, -z);\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator>=(const Vector3<T> &p) const {\n  return x >= p.x && y >= p.y && z >= p.z;\n}\n\ntemplate <typename T>\n__host__ __device__ bool Vector3<T>::operator<=(const Vector3<T> &p) const {\n  return x <= p.x && y <= p.y && z <= p.z;\n}\n\ntemplate <typename T> __host__ __device__ T Vector3<T>::length2() const {\n  return x * x + y * y + z * z;\n}\n\ntemplate <typename T> __host__ __device__ T Vector3<T>::length() const {\n  return sqrtf(length2());\n}\n\ntemplate <typename T>\n__host__ std::ostream &operator<<(std::ostream &os, const Vector3<T> &v) {\n  os << \"[vector3]\" << v.x << \" \" << v.y << \" \" << v.z << std::endl;\n  return os;\n}\n\ntemplate <typename T>\n__host__ __device__ T dot(const Vector3<T> &a, const Vector3<T> &b) {\n  return a.x * b.x + a.y * b.y + a.z * b.z;\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> cross(const Vector3<T> &a, const Vector3<T> &b) {\n  return Vector3<T>((a.y * b.z) - (a.z * b.y), (a.z * b.x) - (a.x * b.z),\n                    (a.x * b.y) - (a.y * b.x));\n}\n\ntemplate <typename T>\n__host__ __device__ T triple(const Vector3<T> &a, const Vector3<T> &b,\n                             const Vector3<T> &c) {\n  return dot(a, cross(b, c));\n}\n\ntemplate <typename T>\n__host__ __device__ Vector3<T> normalize(const Vector3<T> &v) {\n  if (v.length2() == 0.f)\n    return v;\n  return v \/ v.length();\n}<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file hybrid_height.cpp\n *\n * @date Apr 5, 2013\n * @author peramaki\n *\/\n\n#include \"hybrid_height.h\"\n#include \"plugin_factory.h\"\n#include \"logger_factory.h\"\n#include <boost\/lexical_cast.hpp>\n#include <boost\/thread.hpp>\n\n#define HIMAN_AUXILIARY_INCLUDE\n\n#include \"neons.h\"\n\n#undef HIMAN_AUXILIARY_INCLUDE\n\nusing namespace std;\nusing namespace himan::plugin;\n\nconst string itsName(\"hybrid_height\");\n\nhybrid_height::hybrid_height() : itsFastMode(false)\n{\n\titsClearTextFormula = \"HEIGHT = prevH + (287\/9.81) * (T+prevT)\/2 * log(prevP \/ P)\";\n\titsLogger = logger_factory::Instance()->GetLog(itsName);\n\n}\n\nvoid hybrid_height::Process(std::shared_ptr<const plugin_configuration> conf)\n{\n\tInit(conf);\n\n\tSetParams({param(\"HL-M\", 3, 0, 3, 6)});\n\n\t\/*\n\t * For hybrid height we must go through the levels backwards.\n\t *\/\n\n\titsInfo->LevelOrder(kBottomToTop);\n\n\tshared_ptr<neons> theNeons = dynamic_pointer_cast <neons> (plugin_factory::Instance()->Plugin(\"neons\"));\n\n\titsBottomLevel = boost::lexical_cast<int> (theNeons->ProducerMetaData(itsConfiguration->SourceProducer().Id(), \"last hybrid level number\"));\n\n\titsUseGeopotential = (itsConfiguration->SourceProducer().Id() == 1 || itsConfiguration->SourceProducer().Id() == 199);\n\n\tif (!itsConfiguration->Exists(\"fast_mode\") && itsConfiguration->GetValue(\"fast_mode\") == \"true\")\n\t{\n\t\titsFastMode = true;\n\t}\n\telse if (!itsUseGeopotential)\n\t{\n\t\t\/\/ When doing exact calculation we must do them sequentially starting from\n\t\t\/\/ surface closest to ground because every surface's value is depended\n\t\t\/\/ on the surface below it. Therefore we cannot parallelize the calculation\n\t\t\/\/ on level basis.\n\t\t\n\t\tif (Dimension() != kTimeDimension)\n\t\t{\n\t\t\titsLogger->Info(\"Changing leading_dimension to time\");\n\t\t\tDimension(kTimeDimension);\n\t\t}\n\t}\n\n\tStart();\n\t\n}\n\n\/*\n * Calculate()\n *\n * This function does the actual calculation.\n *\/\n\nvoid hybrid_height::Calculate(shared_ptr<info> myTargetInfo, unsigned short threadIndex)\n{\n\n\tconst param GPParam(\"P-PA\");\n\tconst params PParam= {param(\"P-HPA\"), param(\"P-PA\")};\n\tconst params TParam = { param(\"T-K\"), param(\"TG-K\")};\n\tconst param ZParam(\"Z-M2S2\");\n\t\n\tlevel H2;\/\/(himan::kHeight, 2, \"HEIGHT\");\n\tlevel H0;\/\/(himan::kHeight, 0, \"HEIGHT\");\n\tif ( itsConfiguration->SourceProducer().Id() == 131)\n\t{\n\t\tH2 = level(himan::kGndLayer, 0, \"GROUND\");\n\t\tH0 = level(himan::kGndLayer, 0, \"GNDLAYER\");\n\t}\n\telse\n\t{\n\t\tH2 = level(himan::kHeight, 2, \"HEIGHT\");\n\t\tH0 = level(himan::kHeight, 0, \"HEIGHT\");\n\t}\n\n\tauto myThreadedLogger = logger_factory::Instance()->GetLog(itsName + \"Thread #\" + boost::lexical_cast<string> (threadIndex));\n\n\tforecast_time forecastTime = myTargetInfo->Time();\n\tlevel forecastLevel = myTargetInfo->Level();\n\n\tmyThreadedLogger->Info(\"Calculating time \" + static_cast<string>(*forecastTime.ValidDateTime()) + \" level \" + static_cast<string> (forecastLevel));\n\n\t\/*\n\t\tpitääkö tunnistaa tuottaja?\n\t*\/\n\n\tlevel prevLevel;\n\n\tbool firstLevel = false;\n\t\t\n\tif (itsFastMode || myTargetInfo->Level().Value() == itsBottomLevel)\n\t{\n\t\tfirstLevel = true;\n\t}\n\telse\n\t{\n\t\tprevLevel = level(myTargetInfo->Level());\n\t\tprevLevel.Value(myTargetInfo->Level().Value() + 1);\n\n\t\tprevLevel.Index(prevLevel.Index() + 1);\n\t}\n\n\n\tinfo_t TInfo, PInfo, prevPInfo, prevTInfo, prevHInfo, GPInfo, zeroGPInfo;\n\n\tif (itsUseGeopotential)\n\t{\n\t\tGPInfo = Fetch(forecastTime, forecastLevel, ZParam, false);\n\t\tzeroGPInfo = Fetch(forecastTime, H0, ZParam, false);\n\n\t\tSetAB(myTargetInfo, GPInfo);\n\n\t}\n\telse\n\t{\n\n\t\tif (!firstLevel)\n\t\t{\n\t\t\tprevTInfo = Fetch(forecastTime, prevLevel, TParam, false);\n\t\t\tprevPInfo = Fetch(forecastTime, prevLevel, PParam, false);\n\t\t\tprevHInfo = Fetch(forecastTime, prevLevel, param(\"HL-M\"), false);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprevPInfo = Fetch(forecastTime, H0, GPParam, false);\n\t\t\tprevTInfo = Fetch(forecastTime, H2, TParam, false);\n\t\t}\n\n\t\tPInfo = Fetch(forecastTime, forecastLevel, PParam, false);\n\t\tTInfo = Fetch(forecastTime, forecastLevel, TParam, false);\n\n\t\tassert(PInfo->Grid()->AB() == TInfo->Grid()->AB());\n\n\t\tSetAB(myTargetInfo, TInfo);\n\n\t}\n\n\tif ((itsUseGeopotential && (!GPInfo || !zeroGPInfo)) || (!itsUseGeopotential && (!prevTInfo || !prevPInfo || !prevHInfo || !PInfo || !TInfo)))\n\t{\n\t\tmyThreadedLogger->Warning(\"Skipping step \" + boost::lexical_cast<string> (forecastTime.Step()) + \", level \" + static_cast<string> (forecastLevel));\n\t\treturn;\n\t}\n\t\n\tstring deviceType = \"CPU\";\n\n\tif (itsUseGeopotential)\n\t{\n\t\tGPInfo->ResetLocation();\n\t\tzeroGPInfo->ResetLocation();\n\t}\n\telse\n\t{\n\t\tPInfo->ResetLocation();\n\t\tTInfo->ResetLocation();\n\t\tprevPInfo->ResetLocation();\n\t\tprevTInfo->ResetLocation();\n\t\tprevHInfo->ResetLocation();\n\t}\n\n\tLOCKSTEP(myTargetInfo)\n\t{\n\n\t\tif (itsUseGeopotential)\n\t\t{\n\t\t\tGPInfo->NextLocation();\n\t\t\tdouble GP = GPInfo->Value();\n\n\t\t\tzeroGPInfo->NextLocation();\n\t\t\tdouble zeroGP = zeroGPInfo->Value();\n\t\t\n\t\t\tif (GP == kFloatMissing || zeroGP == kFloatMissing)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tdouble height = (GP - zeroGP) * himan::constants::kIg;\n\t\t\t\n\t\t\tmyTargetInfo->Value(height);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tTInfo->NextLocation();\n\t\t\tdouble T = TInfo->Value();\n\n\t\t\tPInfo->NextLocation();\n\t\t\tdouble P = PInfo->Value();\n\n\t\t\tprevTInfo->NextLocation();\n\t\t\tdouble prevT = prevTInfo->Value();\n\n\t\t\tprevPInfo->NextLocation();\n\t\t\tdouble prevP = prevPInfo->Value();\n\n\t\t\tdouble prevH = kFloatMissing;\n\t\t\t\n\t\t\tif (!firstLevel)\n\t\t\t{\n\n\t\t\t\tprevHInfo->NextLocation();\n\t\t\t\tprevH = prevHInfo->Value();\n\n\t\t\t\tif (prevH == kFloatMissing )\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (prevT == kFloatMissing || prevP == kFloatMissing || T == kFloatMissing || P == kFloatMissing )\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\n\t\t\tif (firstLevel)\n\t\t\t{\n\t\t\t\tprevP \/= 100.f;\n\t\t\t}\n\n\t\t\tdouble Tave = ( T + prevT ) \/ 2;\n\t\t\tdouble deltaZ = (287 \/ 9.81) * Tave * log(prevP \/ P);\n\n\t\t\tdouble totalHeight(0);\n\n\t\t\tif (firstLevel)\n\t\t\t{\n\t\t\t\ttotalHeight = deltaZ;\t\t\n\t\t\t}\n\t\t\telse\n\t\t\t{\t\n\t\t\t\ttotalHeight = prevH + deltaZ;\n\t\t\t}\n\n\t\t\tmyTargetInfo->Value(totalHeight);\n\n\t\t}\n\t}\n\n\tif (!itsFastMode)\n\t{\n\t\tfirstLevel = false;\n\t}\n\n\tmyThreadedLogger->Info(\"[\" + deviceType + \"] Missing values: \" + boost::lexical_cast<string> (myTargetInfo->Data()->MissingCount()) + \"\/\" + boost::lexical_cast<string> (myTargetInfo->Data()->Size()));\n\n}\n<commit_msg>some ec fixes<commit_after>\/**\n * @file hybrid_height.cpp\n *\n * @date Apr 5, 2013\n * @author peramaki\n *\/\n\n#include \"hybrid_height.h\"\n#include \"plugin_factory.h\"\n#include \"logger_factory.h\"\n#include <boost\/lexical_cast.hpp>\n#include <boost\/thread.hpp>\n\n#define HIMAN_AUXILIARY_INCLUDE\n\n#include \"neons.h\"\n\n#undef HIMAN_AUXILIARY_INCLUDE\n\nusing namespace std;\nusing namespace himan::plugin;\n\nconst string itsName(\"hybrid_height\");\n\nhybrid_height::hybrid_height() : itsFastMode(false)\n{\n\titsClearTextFormula = \"HEIGHT = prevH + (287\/9.81) * (T+prevT)\/2 * log(prevP \/ P)\";\n\titsLogger = logger_factory::Instance()->GetLog(itsName);\n\n}\n\nvoid hybrid_height::Process(std::shared_ptr<const plugin_configuration> conf)\n{\n\tInit(conf);\n\n\tSetParams({param(\"HL-M\", 3, 0, 3, 6)});\n\n\t\/*\n\t * For hybrid height we must go through the levels backwards.\n\t *\/\n\n\titsInfo->LevelOrder(kBottomToTop);\n\n\tshared_ptr<neons> theNeons = dynamic_pointer_cast <neons> (plugin_factory::Instance()->Plugin(\"neons\"));\n\n\titsBottomLevel = boost::lexical_cast<int> (theNeons->ProducerMetaData(itsConfiguration->SourceProducer().Id(), \"last hybrid level number\"));\n\n\titsUseGeopotential = (itsConfiguration->SourceProducer().Id() == 1 || itsConfiguration->SourceProducer().Id() == 199);\n\n\tif (!itsConfiguration->Exists(\"fast_mode\") && itsConfiguration->GetValue(\"fast_mode\") == \"true\")\n\t{\n\t\titsFastMode = true;\n\t}\n\telse if (!itsUseGeopotential)\n\t{\n\t\t\/\/ When doing exact calculation we must do them sequentially starting from\n\t\t\/\/ surface closest to ground because every surface's value is depended\n\t\t\/\/ on the surface below it. Therefore we cannot parallelize the calculation\n\t\t\/\/ on level basis.\n\t\t\n\t\tif (Dimension() != kTimeDimension)\n\t\t{\n\t\t\titsLogger->Info(\"Changing leading_dimension to time\");\n\t\t\tDimension(kTimeDimension);\n\t\t}\n\t}\n\n\tStart();\n\t\n}\n\n\/*\n * Calculate()\n *\n * This function does the actual calculation.\n *\/\n\nvoid hybrid_height::Calculate(shared_ptr<info> myTargetInfo, unsigned short threadIndex)\n{\n\n\tconst params GPParam { param(\"PGR-PA\"), param(\"P-PA\") };\n\tconst param PParam(\"P-HPA\");\n\tconst params TParam = { param(\"T-K\"), param(\"TG-K\") };\n\tconst param ZParam(\"Z-M2S2\");\n\t\n\tlevel H2;\/\/(himan::kHeight, 2, \"HEIGHT\");\n\tlevel H0;\/\/(himan::kHeight, 0, \"HEIGHT\");\n\tif ( itsConfiguration->SourceProducer().Id() == 131)\n\t{\n\t\tH2 = level(himan::kGround, 0, \"GROUND\");\n\t\tH0 = level(himan::kGround, 0, \"GROUND\");\n\t}\n\telse\n\t{\n\t\tH2 = level(himan::kHeight, 2, \"HEIGHT\");\n\t\tH0 = level(himan::kHeight, 0, \"HEIGHT\");\n\t}\n\n\tauto myThreadedLogger = logger_factory::Instance()->GetLog(itsName + \"Thread #\" + boost::lexical_cast<string> (threadIndex));\n\n\tforecast_time forecastTime = myTargetInfo->Time();\n\tlevel forecastLevel = myTargetInfo->Level();\n\n\tmyThreadedLogger->Info(\"Calculating time \" + static_cast<string>(*forecastTime.ValidDateTime()) + \" level \" + static_cast<string> (forecastLevel));\n\n\t\/*\n\t\tpitääkö tunnistaa tuottaja?\n\t*\/\n\n\tlevel prevLevel;\n\n\tbool firstLevel = false;\n\t\t\n\tif (itsFastMode || myTargetInfo->Level().Value() == itsBottomLevel)\n\t{\n\t\tfirstLevel = true;\n\t}\n\telse\n\t{\n\t\tprevLevel = level(myTargetInfo->Level());\n\t\tprevLevel.Value(myTargetInfo->Level().Value() + 1);\n\n\t\tprevLevel.Index(prevLevel.Index() + 1);\n\t}\n\n\n\tinfo_t TInfo, PInfo, prevPInfo, prevTInfo, prevHInfo, GPInfo, zeroGPInfo;\n\n\tif (itsUseGeopotential)\n\t{\n\t\tGPInfo = Fetch(forecastTime, forecastLevel, ZParam, false);\n\t\tzeroGPInfo = Fetch(forecastTime, H0, ZParam, false);\n\n\t\tSetAB(myTargetInfo, GPInfo);\n\n\t}\n\telse\n\t{\n\n\t\tif (!firstLevel)\n\t\t{\n\t\t\tprevTInfo = Fetch(forecastTime, prevLevel, TParam, false);\n\t\t\tprevPInfo = Fetch(forecastTime, prevLevel, PParam, false);\n\t\t\tprevHInfo = Fetch(forecastTime, prevLevel, param(\"HL-M\"), false);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprevPInfo = Fetch(forecastTime, H0, GPParam, false);\n\t\t\tprevTInfo = Fetch(forecastTime, H2, TParam, false);\n\t\t}\n\n\t\tPInfo = Fetch(forecastTime, forecastLevel, PParam, false);\n\t\tTInfo = Fetch(forecastTime, forecastLevel, TParam, false);\n\n\t\tassert(PInfo->Grid()->AB() == TInfo->Grid()->AB());\n\n\t\tSetAB(myTargetInfo, TInfo);\n\n\t}\n\n\tif ((itsUseGeopotential && (!GPInfo || !zeroGPInfo)) || (!itsUseGeopotential && (!prevTInfo || !prevPInfo || ( !prevHInfo && !firstLevel ) || !PInfo || !TInfo)))\n\t{\n\t\tmyThreadedLogger->Warning(\"Skipping step \" + boost::lexical_cast<string> (forecastTime.Step()) + \", level \" + static_cast<string> (forecastLevel));\n\t\treturn;\n\t}\n\t\n\tstring deviceType = \"CPU\";\n\n\tif (itsUseGeopotential)\n\t{\n\t\tGPInfo->ResetLocation();\n\t\tzeroGPInfo->ResetLocation();\n\t}\n\telse\n\t{\n\t\tPInfo->ResetLocation();\n\t\tTInfo->ResetLocation();\n\t\tprevPInfo->ResetLocation();\n\t\tprevTInfo->ResetLocation();\n\t\tif (!firstLevel)\n\t\t{\n\t\t\tprevHInfo->ResetLocation();\n\t\t}\n\t}\n\n\tLOCKSTEP(myTargetInfo)\n\t{\n\n\t\tif (itsUseGeopotential)\n\t\t{\n\t\t\tGPInfo->NextLocation();\n\t\t\tdouble GP = GPInfo->Value();\n\n\t\t\tzeroGPInfo->NextLocation();\n\t\t\tdouble zeroGP = zeroGPInfo->Value();\n\t\t\n\t\t\tif (GP == kFloatMissing || zeroGP == kFloatMissing)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tdouble height = (GP - zeroGP) * himan::constants::kIg;\n\t\t\t\n\t\t\tmyTargetInfo->Value(height);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tTInfo->NextLocation();\n\t\t\tdouble T = TInfo->Value();\n\n\t\t\tPInfo->NextLocation();\n\t\t\tdouble P = PInfo->Value();\n\n\t\t\tprevTInfo->NextLocation();\n\t\t\tdouble prevT = prevTInfo->Value();\n\n\t\t\tprevPInfo->NextLocation();\n\t\t\tdouble prevP = prevPInfo->Value();\n\n\t\t\tdouble prevH = kFloatMissing;\n\t\t\t\n\t\t\tif (!firstLevel)\n\t\t\t{\n\n\t\t\t\tprevHInfo->NextLocation();\n\t\t\t\tprevH = prevHInfo->Value();\n\n\t\t\t\tif (prevH == kFloatMissing )\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (prevT == kFloatMissing || prevP == kFloatMissing || T == kFloatMissing || P == kFloatMissing )\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\n\t\t\tif (firstLevel )\/\/&& !itsConfiguration->SourceProducer().Id() == 131)\n\t\t\t{\n\t\t\t\tprevP \/= 100.f;\n\t\t\t}\n\n\t\t\tdouble Tave = ( T + prevT ) \/ 2;\n\t\t\tcout << \"prevP: \";\n\t\t\tcout << prevP << endl;\n\t\t\tcout << \"P: \";\n\t\t\tcout << P << endl;\n\t\t\tdouble deltaZ = (287 \/ 9.81) * Tave * log(prevP \/ P);\n\t\t\tcout << \"D: \";\n\t\t\tcout << deltaZ << endl;\n\t\t\tdouble totalHeight(0);\n\n\t\t\tif (firstLevel)\n\t\t\t{\n\t\t\t\ttotalHeight = deltaZ;\t\t\n\t\t\t}\n\t\t\telse\n\t\t\t{\t\n\t\t\t\ttotalHeight = prevH + deltaZ;\n\t\t\t}\n\n\t\t\tmyTargetInfo->Value(totalHeight);\n\n\t\t}\n\t}\n\n\tif (!itsFastMode)\n\t{\n\t\tfirstLevel = false;\n\t}\n\n\tmyThreadedLogger->Info(\"[\" + deviceType + \"] Missing values: \" + boost::lexical_cast<string> (myTargetInfo->Data()->MissingCount()) + \"\/\" + boost::lexical_cast<string> (myTargetInfo->Data()->Size()));\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QIntValidator>\n#include <QDesktopServices>\n#include \"assettingsview.h\"\n#include \"pathsetting.h\"\n#include \"optionalsetting.h\"\n#include \"ui_assettingsview.h\"\n\nAsSettingsView::AsSettingsView(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::AsSettingsView)\n{\n    ui->setupUi(this);\n    hide();\n}\n\nAsSettingsView::~AsSettingsView()\n{\n    delete ui;\n}\n\nvoid AsSettingsView::init(ISettings* settingsModel)\n{\n    this->settingsModel = settingsModel;\n    ui->parametersLineEdit->setText(settingsModel->launchParameters());\n\n    ui->steamPathSetting->init(\"Steam\", settingsModel->steamPath());\n    connect(ui->steamPathSetting, &PathSetting::textEdited, this, &AsSettingsView::setSteamPath);\n    connect(ui->steamPathSetting, &PathSetting::resetPressed, [=]\n    {\n        settingsModel->resetSteamPath();\n        ui->steamPathSetting->setValue(settingsModel->steamPath());\n    });\n\n    ui->modsPathSetting->init(\"Mod Download\", settingsModel->modDownloadPath());\n    connect(ui->modsPathSetting, &PathSetting::textEdited, this, &AsSettingsView::setModDownloadPath);\n    connect(ui->modsPathSetting, &PathSetting::resetPressed, [=]\n    {\n        settingsModel->resetModDownloadPath();\n        ui->modsPathSetting->setValue(settingsModel->modDownloadPath());\n    });\n\n    ui->teamspeakPathSetting->init(\"TeamSpeak 3\", settingsModel->teamSpeak3Path());\n    connect(ui->teamspeakPathSetting, &PathSetting::textEdited, this, &AsSettingsView::setTeamSpeak3Path);\n    connect(ui->teamspeakPathSetting, &PathSetting::resetPressed, [=]\n    {\n        settingsModel->resetTeamSpeak3Path();\n        ui->teamspeakPathSetting->setValue(settingsModel->teamSpeak3Path());\n    });\n\n    ui->arma3PathSetting->init(\"Arma 3\", settingsModel->arma3Path());\n    connect(ui->arma3PathSetting, &PathSetting::textEdited, this, &AsSettingsView::setArma3Path);\n    connect(ui->arma3PathSetting, &PathSetting::resetPressed, [=] {\n        settingsModel->resetArma3Path();\n        ui->arma3PathSetting->setValue(settingsModel->arma3Path());\n    });\n\n    ui->downloadSetting->init(\"Download limit:\", settingsModel->maxDownload(), settingsModel->maxDownloadEnabled());\n    connect(ui->downloadSetting, &OptionalSetting::checked, [=] (bool ticked)\n    {\n        settingsModel->setMaxDownloadEnabled(ticked);\n    });\n    connect(ui->downloadSetting, &OptionalSetting::valueChanged, [=] (QString newValue)\n    {\n        settingsModel->setMaxDownload(newValue);\n    });\n    ui->uploadSetting->init(\"Upload limit:\", settingsModel->maxUpload(), settingsModel->maxUploadEnabled());\n    connect(ui->uploadSetting, &OptionalSetting::checked, [=] (bool ticked) {\n        settingsModel->setMaxUploadEnabled(ticked);\n    });\n    connect(ui->uploadSetting, &OptionalSetting::valueChanged, [=] (QString newValue)\n    {\n        settingsModel->setMaxUpload(newValue);\n    });\n\n    ui->portLineEdit->setText(settingsModel->port());\n    ui->portLineEdit->setValidator(new QIntValidator(0, 65535, this));\n    ui->deltaPatchingCheckbox->setChecked(settingsModel->deltaPatchingEnabled());\n}\n\nvoid AsSettingsView::setArma3Path(QString path)\n{\n    settingsModel->setArma3Path(path);\n}\n\nvoid AsSettingsView::setSteamPath(QString path)\n{\n    settingsModel->setSteamPath(path);\n}\n\nvoid AsSettingsView::setModDownloadPath(QString path)\n{\n    settingsModel->setModDownloadPath(path);\n}\n\nvoid AsSettingsView::setTeamSpeak3Path(QString path)\n{\n    settingsModel->setTeamSpeak3Path(path);\n}\n\nvoid AsSettingsView::on_parametersLineEdit_editingFinished()\n{\n    settingsModel->setLaunchParameters(ui->parametersLineEdit->text());\n}\n\nvoid AsSettingsView::on_portLineEdit_editingFinished()\n{\n    settingsModel->setPort(ui->portLineEdit->text());\n}\n\nvoid AsSettingsView::on_reportButton_clicked()\n{\n    QDesktopServices::openUrl(QUrl::fromEncoded(\"https:\/\/www.google.fi\"));\n}\n\nvoid AsSettingsView::on_deltaPatchingCheckbox_toggled(const bool checked)\n{\n    settingsModel->setDeltaPatchingEnabled(checked);\n}\n<commit_msg>Report bug fixed<commit_after>#include <QIntValidator>\n#include <QDesktopServices>\n#include \"assettingsview.h\"\n#include \"pathsetting.h\"\n#include \"optionalsetting.h\"\n#include \"ui_assettingsview.h\"\n\nAsSettingsView::AsSettingsView(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::AsSettingsView)\n{\n    ui->setupUi(this);\n    hide();\n}\n\nAsSettingsView::~AsSettingsView()\n{\n    delete ui;\n}\n\nvoid AsSettingsView::init(ISettings* settingsModel)\n{\n    this->settingsModel = settingsModel;\n    ui->parametersLineEdit->setText(settingsModel->launchParameters());\n\n    ui->steamPathSetting->init(\"Steam\", settingsModel->steamPath());\n    connect(ui->steamPathSetting, &PathSetting::textEdited, this, &AsSettingsView::setSteamPath);\n    connect(ui->steamPathSetting, &PathSetting::resetPressed, [=]\n    {\n        settingsModel->resetSteamPath();\n        ui->steamPathSetting->setValue(settingsModel->steamPath());\n    });\n\n    ui->modsPathSetting->init(\"Mod Download\", settingsModel->modDownloadPath());\n    connect(ui->modsPathSetting, &PathSetting::textEdited, this, &AsSettingsView::setModDownloadPath);\n    connect(ui->modsPathSetting, &PathSetting::resetPressed, [=]\n    {\n        settingsModel->resetModDownloadPath();\n        ui->modsPathSetting->setValue(settingsModel->modDownloadPath());\n    });\n\n    ui->teamspeakPathSetting->init(\"TeamSpeak 3\", settingsModel->teamSpeak3Path());\n    connect(ui->teamspeakPathSetting, &PathSetting::textEdited, this, &AsSettingsView::setTeamSpeak3Path);\n    connect(ui->teamspeakPathSetting, &PathSetting::resetPressed, [=]\n    {\n        settingsModel->resetTeamSpeak3Path();\n        ui->teamspeakPathSetting->setValue(settingsModel->teamSpeak3Path());\n    });\n\n    ui->arma3PathSetting->init(\"Arma 3\", settingsModel->arma3Path());\n    connect(ui->arma3PathSetting, &PathSetting::textEdited, this, &AsSettingsView::setArma3Path);\n    connect(ui->arma3PathSetting, &PathSetting::resetPressed, [=] {\n        settingsModel->resetArma3Path();\n        ui->arma3PathSetting->setValue(settingsModel->arma3Path());\n    });\n\n    ui->downloadSetting->init(\"Download limit:\", settingsModel->maxDownload(), settingsModel->maxDownloadEnabled());\n    connect(ui->downloadSetting, &OptionalSetting::checked, [=] (bool ticked)\n    {\n        settingsModel->setMaxDownloadEnabled(ticked);\n    });\n    connect(ui->downloadSetting, &OptionalSetting::valueChanged, [=] (QString newValue)\n    {\n        settingsModel->setMaxDownload(newValue);\n    });\n    ui->uploadSetting->init(\"Upload limit:\", settingsModel->maxUpload(), settingsModel->maxUploadEnabled());\n    connect(ui->uploadSetting, &OptionalSetting::checked, [=] (bool ticked) {\n        settingsModel->setMaxUploadEnabled(ticked);\n    });\n    connect(ui->uploadSetting, &OptionalSetting::valueChanged, [=] (QString newValue)\n    {\n        settingsModel->setMaxUpload(newValue);\n    });\n\n    ui->portLineEdit->setText(settingsModel->port());\n    ui->portLineEdit->setValidator(new QIntValidator(0, 65535, this));\n    ui->deltaPatchingCheckbox->setChecked(settingsModel->deltaPatchingEnabled());\n}\n\nvoid AsSettingsView::setArma3Path(QString path)\n{\n    settingsModel->setArma3Path(path);\n}\n\nvoid AsSettingsView::setSteamPath(QString path)\n{\n    settingsModel->setSteamPath(path);\n}\n\nvoid AsSettingsView::setModDownloadPath(QString path)\n{\n    settingsModel->setModDownloadPath(path);\n}\n\nvoid AsSettingsView::setTeamSpeak3Path(QString path)\n{\n    settingsModel->setTeamSpeak3Path(path);\n}\n\nvoid AsSettingsView::on_parametersLineEdit_editingFinished()\n{\n    settingsModel->setLaunchParameters(ui->parametersLineEdit->text());\n}\n\nvoid AsSettingsView::on_portLineEdit_editingFinished()\n{\n    settingsModel->setPort(ui->portLineEdit->text());\n}\n\nvoid AsSettingsView::on_reportButton_clicked()\n{\n    QDesktopServices::openUrl(QUrl::fromEncoded(\"https:\/\/form.jotformeu.com\/61187638191361\"));\n}\n\nvoid AsSettingsView::on_deltaPatchingCheckbox_toggled(const bool checked)\n{\n    settingsModel->setDeltaPatchingEnabled(checked);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Lexer.h\"\r\n\r\nLexer::Lexer(Allocator *allocator): lexems(allocator)\r\n{\r\n}\r\n\r\nvoid Lexer::Clear(unsigned count)\r\n{\r\n\tif(count)\r\n\t\tlexems.shrink(count);\r\n\telse\r\n\t\tlexems.clear();\r\n}\r\n\r\nvoid Lexer::Lexify(const char* code)\r\n{\r\n\tlexems.reserve(2048);\r\n\r\n\tconst char *lineStart = code;\r\n\tline = 0;\r\n\r\n\tLexemeType lType = lex_none;\r\n\tint lLength = 1;\r\n\r\n\twhile(*code)\r\n\t{\r\n\t\tswitch(*code)\r\n\t\t{\r\n\t\tcase '\\r':\r\n\t\t\tcode++;\r\n\r\n\t\t\tif(*code == '\\n')\r\n\t\t\t\tcode++;\r\n\r\n\t\t\tlineStart = code;\r\n\t\t\tline++;\r\n\r\n\t\t\tcontinue;\r\n\t\tcase '\\n':\r\n\t\t\tcode++;\r\n\r\n\t\t\tlineStart = code;\r\n\t\t\tline++;\r\n\r\n\t\t\tcontinue;\r\n\t\tcase ' ':\r\n\t\tcase '\\t':\r\n\t\t\tcode++;\r\n\t\t\twhile((unsigned char)(code[0] - 1) < ' ' && *code != '\\r' && *code != '\\n')\r\n\t\t\t\tcode++;\r\n\t\t\tcontinue;\r\n\t\tcase '\\\"':\r\n\t\t\tlType = lex_quotedstring;\r\n\t\t\t{\r\n\t\t\t\tconst char *pos = code;\r\n\t\t\t\tpos++;\r\n\t\t\t\twhile(*pos && *pos != '\\\"')\r\n\t\t\t\t\tpos += (pos[0] == '\\\\' && pos[1]) ? 2 : 1;\r\n\t\t\t\tif(*pos)\r\n\t\t\t\t\tpos++;\r\n\t\t\t\tlLength = (int)(pos - code);\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '\\'':\r\n\t\t\tlType = lex_semiquotedchar;\r\n\t\t\t{\r\n\t\t\t\tconst char *pos = code;\r\n\t\t\t\tpos++;\r\n\t\t\t\twhile(*pos && *pos != '\\'')\r\n\t\t\t\t\tpos += (pos[0] == '\\\\' && pos[1]) ? 2 : 1;\r\n\t\t\t\tif(*pos)\r\n\t\t\t\t\tpos++;\r\n\t\t\t\tlLength = (int)(pos - code);\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '.':\r\n\t\t\tlType = lex_point;\r\n\t\t\tbreak;\r\n\t\tcase ',':\r\n\t\t\tlType = lex_comma;\r\n\t\t\tbreak;\r\n\t\tcase '+':\r\n\t\t\tlType = lex_add;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_addset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '+'){\r\n\t\t\t\tlType = lex_inc;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '-':\r\n\t\t\tlType = lex_sub;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_subset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '-'){\r\n\t\t\t\tlType = lex_dec;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '*':\r\n\t\t\tlType = lex_mul;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_mulset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '*'){\r\n\t\t\t\tlType = lex_pow;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t\tif(code[2] == '=')\r\n\t\t\t\t{\r\n\t\t\t\t\tlType = lex_powset;\r\n\t\t\t\t\tlLength = 3;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '\/':\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_divset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '\/'){\r\n\t\t\t\twhile(code[0] != '\\n' && code[0] != '\\0')\r\n\t\t\t\t\tcode++;\r\n\t\t\t\tcontinue;\r\n\t\t\t}else if(code[1] == '*'){\r\n\t\t\t\tcode += 2;\r\n\t\t\t\tunsigned depth = 1;\r\n\t\t\t\twhile(*code && depth)\r\n\t\t\t\t{\r\n\t\t\t\t\tif(code[0] == '*' && code[1] == '\/')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode += 2;\r\n\t\t\t\t\t\tdepth--;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(code[0] == '\/' && code[1] == '*')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode += 2;\r\n\t\t\t\t\t\tdepth++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(code[0] == '\\\"')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\twhile(code[0] && code[0] != '\\\"')\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tif(code[0] == '\\\\' && code[1])\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcode += 2;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\telse if(code[0] == '\\r')\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\t\t\tif(*code == '\\n')\r\n\t\t\t\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\t\t\tlineStart = code;\r\n\t\t\t\t\t\t\t\tline++;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\telse if(code[0] == '\\n')\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\t\t\tlineStart = code;\r\n\t\t\t\t\t\t\t\tline++;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcode += 1;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif(code[0] == '\\\"')\r\n\t\t\t\t\t\t\tcode++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(code[0] == '\\r')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\tif(*code == '\\n')\r\n\t\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\tlineStart = code;\r\n\t\t\t\t\t\tline++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(code[0] == '\\n')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\tlineStart = code;\r\n\t\t\t\t\t\tline++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode++;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tcontinue;\r\n\t\t\t}else{\r\n\t\t\t\tlType = lex_div;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '%':\r\n\t\t\tlType = lex_mod;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_modset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '<':\r\n\t\t\tlType = lex_less;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_lequal;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '<'){\r\n\t\t\t\tlType = lex_shl;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t\tif(code[2] == '=')\r\n\t\t\t\t{\r\n\t\t\t\t\tlType = lex_shlset;\r\n\t\t\t\t\tlLength = 3;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '>':\r\n\t\t\tlType = lex_greater;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_gequal;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '>'){\r\n\t\t\t\tlType = lex_shr;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t\tif(code[2] == '=')\r\n\t\t\t\t{\r\n\t\t\t\t\tlType = lex_shrset;\r\n\t\t\t\t\tlLength = 3;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '=':\r\n\t\t\tlType = lex_set;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_equal;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '!':\r\n\t\t\tlType = lex_lognot;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_nequal;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '@':\r\n\t\t\tlType = lex_at;\r\n\t\t\tbreak;\r\n\t\tcase '~':\r\n\t\t\tlType = lex_bitnot;\r\n\t\t\tbreak;\r\n\t\tcase '&':\r\n\t\t\tlType = lex_bitand;\r\n\t\t\tif(code[1] == '&')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_logand;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '='){\r\n\t\t\t\tlType = lex_andset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '|':\r\n\t\t\tlType = lex_bitor;\r\n\t\t\tif(code[1] == '|')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_logor;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '='){\r\n\t\t\t\tlType = lex_orset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '^':\r\n\t\t\tlType = lex_bitxor;\r\n\t\t\tif(code[1] == '^')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_logxor;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '='){\r\n\t\t\t\tlType = lex_xorset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '(':\r\n\t\t\tlType = lex_oparen;\r\n\t\t\tbreak;\r\n\t\tcase ')':\r\n\t\t\tlType = lex_cparen;\r\n\t\t\tbreak;\r\n\t\tcase '[':\r\n\t\t\tlType = lex_obracket;\r\n\t\t\tbreak;\r\n\t\tcase ']':\r\n\t\t\tlType = lex_cbracket;\r\n\t\t\tbreak;\r\n\t\tcase '{':\r\n\t\t\tlType = lex_ofigure;\r\n\t\t\tbreak;\r\n\t\tcase '}':\r\n\t\t\tlType = lex_cfigure;\r\n\t\t\tbreak;\r\n\t\tcase '?':\r\n\t\t\tlType = lex_questionmark;\r\n\t\t\tbreak;\r\n\t\tcase ':':\r\n\t\t\tlType = lex_colon;\r\n\t\t\tbreak;\r\n\t\tcase ';':\r\n\t\t\tlType = lex_semicolon;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tif(isDigit(*code))\r\n\t\t\t{\r\n\t\t\t\tlType = lex_number;\r\n\r\n\t\t\t\tconst char *pos = code;\r\n\t\t\t\tif(pos[0] == '0' && pos[1] == 'x')\r\n\t\t\t\t{\r\n\t\t\t\t\tpos += 2;\r\n\t\t\t\t\twhile(isDigit(*pos) || ((*pos & ~0x20) >= 'A' && (*pos & ~0x20) <= 'F'))\r\n\t\t\t\t\t\tpos++;\r\n\t\t\t\t}else{\r\n\t\t\t\t\twhile(isDigit(*pos))\r\n\t\t\t\t\t\tpos++;\r\n\t\t\t\t}\r\n\t\t\t\tif(*pos == '.')\r\n\t\t\t\t\tpos++;\r\n\t\t\t\twhile(isDigit(*pos))\r\n\t\t\t\t\tpos++;\r\n\t\t\t\tif(*pos == 'e')\r\n\t\t\t\t{\r\n\t\t\t\t\tpos++;\r\n\t\t\t\t\tif(*pos == '-')\r\n\t\t\t\t\t\tpos++;\r\n\t\t\t\t}\r\n\t\t\t\twhile(isDigit(*pos))\r\n\t\t\t\t\tpos++;\r\n\t\t\t\tlLength = (int)(pos - code);\r\n\t\t\t}else if(chartype_table[(unsigned char)*code] & ct_start_symbol){\r\n\t\t\t\tconst char *pos = code;\r\n\t\t\t\twhile(chartype_table[(unsigned char)*pos] & ct_symbol)\r\n\t\t\t\t\tpos++;\r\n\t\t\t\tlLength = (int)(pos - code);\r\n\r\n\t\t\t\tif(!(chartype_table[(unsigned char)*pos] & ct_symbol))\r\n\t\t\t\t{\r\n\t\t\t\t\tswitch(lLength)\r\n\t\t\t\t\t{\r\n\t\t\t\t\tcase 2:\r\n\t\t\t\t\t\tif(memcmp(code, \"if\", 2) == 0)\r\n\t\t\t\t\t\t\tlType = lex_if;\r\n\t\t\t\t\t\telse if(memcmp(code, \"in\", 2) == 0)\r\n\t\t\t\t\t\t\tlType = lex_in;\r\n\t\t\t\t\t\telse if(memcmp(code, \"do\", 2) == 0)\r\n\t\t\t\t\t\t\tlType = lex_do;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 3:\r\n\t\t\t\t\t\tif(memcmp(code, \"for\", 3) == 0)\r\n\t\t\t\t\t\t\tlType = lex_for;\r\n\t\t\t\t\t\telse if(memcmp(code, \"ref\", 3) == 0)\r\n\t\t\t\t\t\t\tlType = lex_ref;\r\n\t\t\t\t\t\telse if(memcmp(code, \"new\", 3) == 0)\r\n\t\t\t\t\t\t\tlType = lex_new;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 4:\r\n\t\t\t\t\t\tif(memcmp(code, \"case\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_case;\r\n\t\t\t\t\t\telse if(memcmp(code, \"else\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_else;\r\n\t\t\t\t\t\telse if(memcmp(code, \"auto\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_auto;\r\n\t\t\t\t\t\telse if(memcmp(code, \"true\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_true;\r\n\t\t\t\t\t\telse if(memcmp(code, \"enum\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_enum;\r\n\t\t\t\t\t\telse if(memcmp(code, \"with\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_with;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 5:\r\n\t\t\t\t\t\tif(memcmp(code, \"while\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_while;\r\n\t\t\t\t\t\telse if(memcmp(code, \"break\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_break;\r\n\t\t\t\t\t\telse if(memcmp(code, \"class\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_class;\r\n\t\t\t\t\t\telse if(memcmp(code, \"align\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_align;\r\n\t\t\t\t\t\telse if(memcmp(code, \"yield\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_yield;\r\n\t\t\t\t\t\telse if(memcmp(code, \"const\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_const;\r\n\t\t\t\t\t\telse if(memcmp(code, \"false\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_false;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 6:\r\n\t\t\t\t\t\tif(memcmp(code, \"switch\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_switch;\r\n\t\t\t\t\t\telse if(memcmp(code, \"return\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_return;\r\n\t\t\t\t\t\telse if(memcmp(code, \"typeof\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_typeof;\r\n\t\t\t\t\t\telse if(memcmp(code, \"sizeof\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_sizeof;\r\n\t\t\t\t\t\telse if(memcmp(code, \"import\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_import;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 7:\r\n\t\t\t\t\t\tif(memcmp(code, \"noalign\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_noalign;\r\n\t\t\t\t\t\telse if(memcmp(code, \"default\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_default;\r\n\t\t\t\t\t\telse if(memcmp(code, \"typedef\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_typedef;\r\n\t\t\t\t\t\telse if(memcmp(code, \"nullptr\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_nullptr;\r\n\t\t\t\t\t\telse if(memcmp(code, \"generic\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_generic;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 8:\r\n\t\t\t\t\t\tif(memcmp(code, \"continue\", 8) == 0)\r\n\t\t\t\t\t\t\tlType = lex_continue;\r\n\t\t\t\t\t\telse if(memcmp(code, \"operator\", 8) == 0)\r\n\t\t\t\t\t\t\tlType = lex_operator;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 9:\r\n\t\t\t\t\t\tif(memcmp(code, \"coroutine\", 9) == 0)\r\n\t\t\t\t\t\t\tlType = lex_coroutine;\r\n\t\t\t\t\t\telse if(memcmp(code, \"namespace\", 9) == 0)\r\n\t\t\t\t\t\t\tlType = lex_namespace;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 10:\r\n\t\t\t\t\t\tif(memcmp(code, \"extendable\", 10) == 0)\r\n\t\t\t\t\t\t\tlType = lex_extendable;\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(lType == lex_none)\r\n\t\t\t\t\tlType = lex_string;\r\n\t\t\t}\r\n\t\t}\r\n\t\tLexeme lex;\r\n\r\n\t\tlex.type = lType;\r\n\t\tlex.length = lLength;\r\n\r\n\t\tlex.pos = code;\r\n\r\n\t\tlex.line = line;\r\n\t\tlex.column = unsigned(code - lineStart);\r\n\r\n\t\tlexems.push_back(lex);\r\n\r\n\t\tcode += lLength;\r\n\t\tlType = lex_none;\r\n\t\tlLength = 1;\r\n\t}\r\n\r\n\tLexeme lex;\r\n\r\n\tlex.type = lex_none;\r\n\tlex.length = 1;\r\n\r\n\tlex.pos = code;\r\n\r\n\tlex.line = line;\r\n\tlex.column = unsigned(code - lineStart);\r\n\r\n\tlexems.push_back(lex);\r\n}\r\n\r\nvoid Lexer::Append(Lexeme* stream, unsigned count)\r\n{\r\n\tunsigned oldSize = lexems.size();\r\n\tlexems.resize(lexems.size() + count);\r\n\tmemcpy(&lexems.data[oldSize], stream, count * sizeof(Lexeme));\r\n}\r\n\r\nLexeme* Lexer::GetStreamStart()\r\n{\r\n\treturn &lexems[0];\r\n}\r\n\r\nunsigned int Lexer::GetStreamSize()\r\n{\r\n\treturn lexems.size();\r\n}\r\n<commit_msg>Fix for line\/column location tracking after a multi-line string or character literal<commit_after>#include \"Lexer.h\"\r\n\r\nLexer::Lexer(Allocator *allocator): lexems(allocator)\r\n{\r\n}\r\n\r\nvoid Lexer::Clear(unsigned count)\r\n{\r\n\tif(count)\r\n\t\tlexems.shrink(count);\r\n\telse\r\n\t\tlexems.clear();\r\n}\r\n\r\nvoid Lexer::Lexify(const char* code)\r\n{\r\n\tlexems.reserve(2048);\r\n\r\n\tconst char *lineStart = code;\r\n\tline = 0;\r\n\r\n\tLexemeType lType = lex_none;\r\n\tint lLength = 1;\r\n\r\n\twhile(*code)\r\n\t{\r\n\t\tswitch(*code)\r\n\t\t{\r\n\t\tcase '\\r':\r\n\t\t\tcode++;\r\n\r\n\t\t\tif(*code == '\\n')\r\n\t\t\t\tcode++;\r\n\r\n\t\t\tlineStart = code;\r\n\t\t\tline++;\r\n\r\n\t\t\tcontinue;\r\n\t\tcase '\\n':\r\n\t\t\tcode++;\r\n\r\n\t\t\tlineStart = code;\r\n\t\t\tline++;\r\n\r\n\t\t\tcontinue;\r\n\t\tcase ' ':\r\n\t\tcase '\\t':\r\n\t\t\tcode++;\r\n\t\t\twhile((unsigned char)(code[0] - 1) < ' ' && *code != '\\r' && *code != '\\n')\r\n\t\t\t\tcode++;\r\n\t\t\tcontinue;\r\n\t\tcase '\\\"':\r\n\t\t\tlType = lex_quotedstring;\r\n\t\t\t{\r\n\t\t\t\tconst char *pos = code;\r\n\t\t\t\tpos++;\r\n\r\n\t\t\t\twhile(*pos && *pos != '\\\"')\r\n\t\t\t\t{\r\n\t\t\t\t\tif(pos[0] == '\\\\' && pos[1])\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpos += 2;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(pos[0] == '\\r')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpos++;\r\n\r\n\t\t\t\t\t\tif(*pos == '\\n')\r\n\t\t\t\t\t\t\tpos++;\r\n\r\n\t\t\t\t\t\tlineStart = pos;\r\n\t\t\t\t\t\tline++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(pos[0] == '\\n')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpos++;\r\n\r\n\t\t\t\t\t\tlineStart = pos;\r\n\t\t\t\t\t\tline++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpos += 1;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif(*pos)\r\n\t\t\t\t\tpos++;\r\n\r\n\t\t\t\tlLength = (int)(pos - code);\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '\\'':\r\n\t\t\tlType = lex_semiquotedchar;\r\n\t\t\t{\r\n\t\t\t\tconst char *pos = code;\r\n\t\t\t\tpos++;\r\n\r\n\t\t\t\twhile(*pos && *pos != '\\'')\r\n\t\t\t\t{\r\n\t\t\t\t\tif(pos[0] == '\\\\' && pos[1])\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpos += 2;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(pos[0] == '\\r')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpos++;\r\n\r\n\t\t\t\t\t\tif(*pos == '\\n')\r\n\t\t\t\t\t\t\tpos++;\r\n\r\n\t\t\t\t\t\tlineStart = pos;\r\n\t\t\t\t\t\tline++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(pos[0] == '\\n')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpos++;\r\n\r\n\t\t\t\t\t\tlineStart = pos;\r\n\t\t\t\t\t\tline++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpos += 1;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif(*pos)\r\n\t\t\t\t\tpos++;\r\n\r\n\t\t\t\tlLength = (int)(pos - code);\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '.':\r\n\t\t\tlType = lex_point;\r\n\t\t\tbreak;\r\n\t\tcase ',':\r\n\t\t\tlType = lex_comma;\r\n\t\t\tbreak;\r\n\t\tcase '+':\r\n\t\t\tlType = lex_add;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_addset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '+'){\r\n\t\t\t\tlType = lex_inc;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '-':\r\n\t\t\tlType = lex_sub;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_subset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '-'){\r\n\t\t\t\tlType = lex_dec;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '*':\r\n\t\t\tlType = lex_mul;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_mulset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '*'){\r\n\t\t\t\tlType = lex_pow;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t\tif(code[2] == '=')\r\n\t\t\t\t{\r\n\t\t\t\t\tlType = lex_powset;\r\n\t\t\t\t\tlLength = 3;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '\/':\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_divset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '\/'){\r\n\t\t\t\twhile(code[0] != '\\n' && code[0] != '\\0')\r\n\t\t\t\t\tcode++;\r\n\t\t\t\tcontinue;\r\n\t\t\t}else if(code[1] == '*'){\r\n\t\t\t\tcode += 2;\r\n\t\t\t\tunsigned depth = 1;\r\n\t\t\t\twhile(*code && depth)\r\n\t\t\t\t{\r\n\t\t\t\t\tif(code[0] == '*' && code[1] == '\/')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode += 2;\r\n\t\t\t\t\t\tdepth--;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(code[0] == '\/' && code[1] == '*')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode += 2;\r\n\t\t\t\t\t\tdepth++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(code[0] == '\\\"')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\twhile(code[0] && code[0] != '\\\"')\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tif(code[0] == '\\\\' && code[1])\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcode += 2;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\telse if(code[0] == '\\r')\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\t\t\tif(*code == '\\n')\r\n\t\t\t\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\t\t\tlineStart = code;\r\n\t\t\t\t\t\t\t\tline++;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\telse if(code[0] == '\\n')\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\t\t\tlineStart = code;\r\n\t\t\t\t\t\t\t\tline++;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcode += 1;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif(code[0] == '\\\"')\r\n\t\t\t\t\t\t\tcode++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(code[0] == '\\r')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\tif(*code == '\\n')\r\n\t\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\tlineStart = code;\r\n\t\t\t\t\t\tline++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if(code[0] == '\\n')\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode++;\r\n\r\n\t\t\t\t\t\tlineStart = code;\r\n\t\t\t\t\t\tline++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcode++;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tcontinue;\r\n\t\t\t}else{\r\n\t\t\t\tlType = lex_div;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '%':\r\n\t\t\tlType = lex_mod;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_modset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '<':\r\n\t\t\tlType = lex_less;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_lequal;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '<'){\r\n\t\t\t\tlType = lex_shl;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t\tif(code[2] == '=')\r\n\t\t\t\t{\r\n\t\t\t\t\tlType = lex_shlset;\r\n\t\t\t\t\tlLength = 3;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '>':\r\n\t\t\tlType = lex_greater;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_gequal;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '>'){\r\n\t\t\t\tlType = lex_shr;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t\tif(code[2] == '=')\r\n\t\t\t\t{\r\n\t\t\t\t\tlType = lex_shrset;\r\n\t\t\t\t\tlLength = 3;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '=':\r\n\t\t\tlType = lex_set;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_equal;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '!':\r\n\t\t\tlType = lex_lognot;\r\n\t\t\tif(code[1] == '=')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_nequal;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '@':\r\n\t\t\tlType = lex_at;\r\n\t\t\tbreak;\r\n\t\tcase '~':\r\n\t\t\tlType = lex_bitnot;\r\n\t\t\tbreak;\r\n\t\tcase '&':\r\n\t\t\tlType = lex_bitand;\r\n\t\t\tif(code[1] == '&')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_logand;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '='){\r\n\t\t\t\tlType = lex_andset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '|':\r\n\t\t\tlType = lex_bitor;\r\n\t\t\tif(code[1] == '|')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_logor;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '='){\r\n\t\t\t\tlType = lex_orset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '^':\r\n\t\t\tlType = lex_bitxor;\r\n\t\t\tif(code[1] == '^')\r\n\t\t\t{\r\n\t\t\t\tlType = lex_logxor;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}else if(code[1] == '='){\r\n\t\t\t\tlType = lex_xorset;\r\n\t\t\t\tlLength = 2;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase '(':\r\n\t\t\tlType = lex_oparen;\r\n\t\t\tbreak;\r\n\t\tcase ')':\r\n\t\t\tlType = lex_cparen;\r\n\t\t\tbreak;\r\n\t\tcase '[':\r\n\t\t\tlType = lex_obracket;\r\n\t\t\tbreak;\r\n\t\tcase ']':\r\n\t\t\tlType = lex_cbracket;\r\n\t\t\tbreak;\r\n\t\tcase '{':\r\n\t\t\tlType = lex_ofigure;\r\n\t\t\tbreak;\r\n\t\tcase '}':\r\n\t\t\tlType = lex_cfigure;\r\n\t\t\tbreak;\r\n\t\tcase '?':\r\n\t\t\tlType = lex_questionmark;\r\n\t\t\tbreak;\r\n\t\tcase ':':\r\n\t\t\tlType = lex_colon;\r\n\t\t\tbreak;\r\n\t\tcase ';':\r\n\t\t\tlType = lex_semicolon;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tif(isDigit(*code))\r\n\t\t\t{\r\n\t\t\t\tlType = lex_number;\r\n\r\n\t\t\t\tconst char *pos = code;\r\n\t\t\t\tif(pos[0] == '0' && pos[1] == 'x')\r\n\t\t\t\t{\r\n\t\t\t\t\tpos += 2;\r\n\t\t\t\t\twhile(isDigit(*pos) || ((*pos & ~0x20) >= 'A' && (*pos & ~0x20) <= 'F'))\r\n\t\t\t\t\t\tpos++;\r\n\t\t\t\t}else{\r\n\t\t\t\t\twhile(isDigit(*pos))\r\n\t\t\t\t\t\tpos++;\r\n\t\t\t\t}\r\n\t\t\t\tif(*pos == '.')\r\n\t\t\t\t\tpos++;\r\n\t\t\t\twhile(isDigit(*pos))\r\n\t\t\t\t\tpos++;\r\n\t\t\t\tif(*pos == 'e')\r\n\t\t\t\t{\r\n\t\t\t\t\tpos++;\r\n\t\t\t\t\tif(*pos == '-')\r\n\t\t\t\t\t\tpos++;\r\n\t\t\t\t}\r\n\t\t\t\twhile(isDigit(*pos))\r\n\t\t\t\t\tpos++;\r\n\t\t\t\tlLength = (int)(pos - code);\r\n\t\t\t}else if(chartype_table[(unsigned char)*code] & ct_start_symbol){\r\n\t\t\t\tconst char *pos = code;\r\n\t\t\t\twhile(chartype_table[(unsigned char)*pos] & ct_symbol)\r\n\t\t\t\t\tpos++;\r\n\t\t\t\tlLength = (int)(pos - code);\r\n\r\n\t\t\t\tif(!(chartype_table[(unsigned char)*pos] & ct_symbol))\r\n\t\t\t\t{\r\n\t\t\t\t\tswitch(lLength)\r\n\t\t\t\t\t{\r\n\t\t\t\t\tcase 2:\r\n\t\t\t\t\t\tif(memcmp(code, \"if\", 2) == 0)\r\n\t\t\t\t\t\t\tlType = lex_if;\r\n\t\t\t\t\t\telse if(memcmp(code, \"in\", 2) == 0)\r\n\t\t\t\t\t\t\tlType = lex_in;\r\n\t\t\t\t\t\telse if(memcmp(code, \"do\", 2) == 0)\r\n\t\t\t\t\t\t\tlType = lex_do;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 3:\r\n\t\t\t\t\t\tif(memcmp(code, \"for\", 3) == 0)\r\n\t\t\t\t\t\t\tlType = lex_for;\r\n\t\t\t\t\t\telse if(memcmp(code, \"ref\", 3) == 0)\r\n\t\t\t\t\t\t\tlType = lex_ref;\r\n\t\t\t\t\t\telse if(memcmp(code, \"new\", 3) == 0)\r\n\t\t\t\t\t\t\tlType = lex_new;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 4:\r\n\t\t\t\t\t\tif(memcmp(code, \"case\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_case;\r\n\t\t\t\t\t\telse if(memcmp(code, \"else\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_else;\r\n\t\t\t\t\t\telse if(memcmp(code, \"auto\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_auto;\r\n\t\t\t\t\t\telse if(memcmp(code, \"true\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_true;\r\n\t\t\t\t\t\telse if(memcmp(code, \"enum\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_enum;\r\n\t\t\t\t\t\telse if(memcmp(code, \"with\", 4) == 0)\r\n\t\t\t\t\t\t\tlType = lex_with;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 5:\r\n\t\t\t\t\t\tif(memcmp(code, \"while\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_while;\r\n\t\t\t\t\t\telse if(memcmp(code, \"break\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_break;\r\n\t\t\t\t\t\telse if(memcmp(code, \"class\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_class;\r\n\t\t\t\t\t\telse if(memcmp(code, \"align\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_align;\r\n\t\t\t\t\t\telse if(memcmp(code, \"yield\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_yield;\r\n\t\t\t\t\t\telse if(memcmp(code, \"const\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_const;\r\n\t\t\t\t\t\telse if(memcmp(code, \"false\", 5) == 0)\r\n\t\t\t\t\t\t\tlType = lex_false;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 6:\r\n\t\t\t\t\t\tif(memcmp(code, \"switch\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_switch;\r\n\t\t\t\t\t\telse if(memcmp(code, \"return\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_return;\r\n\t\t\t\t\t\telse if(memcmp(code, \"typeof\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_typeof;\r\n\t\t\t\t\t\telse if(memcmp(code, \"sizeof\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_sizeof;\r\n\t\t\t\t\t\telse if(memcmp(code, \"import\", 6) == 0)\r\n\t\t\t\t\t\t\tlType = lex_import;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 7:\r\n\t\t\t\t\t\tif(memcmp(code, \"noalign\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_noalign;\r\n\t\t\t\t\t\telse if(memcmp(code, \"default\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_default;\r\n\t\t\t\t\t\telse if(memcmp(code, \"typedef\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_typedef;\r\n\t\t\t\t\t\telse if(memcmp(code, \"nullptr\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_nullptr;\r\n\t\t\t\t\t\telse if(memcmp(code, \"generic\", 7) == 0)\r\n\t\t\t\t\t\t\tlType = lex_generic;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 8:\r\n\t\t\t\t\t\tif(memcmp(code, \"continue\", 8) == 0)\r\n\t\t\t\t\t\t\tlType = lex_continue;\r\n\t\t\t\t\t\telse if(memcmp(code, \"operator\", 8) == 0)\r\n\t\t\t\t\t\t\tlType = lex_operator;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 9:\r\n\t\t\t\t\t\tif(memcmp(code, \"coroutine\", 9) == 0)\r\n\t\t\t\t\t\t\tlType = lex_coroutine;\r\n\t\t\t\t\t\telse if(memcmp(code, \"namespace\", 9) == 0)\r\n\t\t\t\t\t\t\tlType = lex_namespace;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 10:\r\n\t\t\t\t\t\tif(memcmp(code, \"extendable\", 10) == 0)\r\n\t\t\t\t\t\t\tlType = lex_extendable;\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(lType == lex_none)\r\n\t\t\t\t\tlType = lex_string;\r\n\t\t\t}\r\n\t\t}\r\n\t\tLexeme lex;\r\n\r\n\t\tlex.type = lType;\r\n\t\tlex.length = lLength;\r\n\r\n\t\tlex.pos = code;\r\n\r\n\t\tlex.line = line;\r\n\t\tlex.column = unsigned(code - lineStart);\r\n\r\n\t\tlexems.push_back(lex);\r\n\r\n\t\tcode += lLength;\r\n\t\tlType = lex_none;\r\n\t\tlLength = 1;\r\n\t}\r\n\r\n\tLexeme lex;\r\n\r\n\tlex.type = lex_none;\r\n\tlex.length = 1;\r\n\r\n\tlex.pos = code;\r\n\r\n\tlex.line = line;\r\n\tlex.column = unsigned(code - lineStart);\r\n\r\n\tlexems.push_back(lex);\r\n}\r\n\r\nvoid Lexer::Append(Lexeme* stream, unsigned count)\r\n{\r\n\tunsigned oldSize = lexems.size();\r\n\tlexems.resize(lexems.size() + count);\r\n\tmemcpy(&lexems.data[oldSize], stream, count * sizeof(Lexeme));\r\n}\r\n\r\nLexeme* Lexer::GetStreamStart()\r\n{\r\n\treturn &lexems[0];\r\n}\r\n\r\nunsigned int Lexer::GetStreamSize()\r\n{\r\n\treturn lexems.size();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- Mutex.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\/Host\/Mutex.h\"\n#include \"lldb\/Host\/Host.h\"\n\n#include <string.h>\n#include <stdio.h>\n#include <unistd.h>\n\n#if 0\n\/\/ This logging is way too verbose to enable even for a log channel. \n\/\/ This logging can be enabled by changing the \"#if 0\", but should be\n\/\/ reverted prior to checking in.\n#include <cstdio>\n#define DEBUG_LOG(fmt, ...) printf(fmt, ## __VA_ARGS__)\n#else\n#define DEBUG_LOG(fmt, ...)\n#endif\n\n\/\/ Enable extra mutex error checking\n#ifdef LLDB_CONFIGURATION_DEBUG\n#define ENABLE_MUTEX_ERROR_CHECKING 1\n#endif\n\nusing namespace lldb_private;\n\n\/\/----------------------------------------------------------------------\n\/\/ Default constructor.\n\/\/\n\/\/ This will create a scoped mutex locking object that doesn't have\n\/\/ a mutex to lock. One will need to be provided using the Reset()\n\/\/ method.\n\/\/----------------------------------------------------------------------\nMutex::Locker::Locker () :\n    m_mutex_ptr(NULL)\n{\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Constructor with a Mutex object.\n\/\/\n\/\/ This will create a scoped mutex locking object that extracts the\n\/\/ mutex owned by \"m\" and locks it.\n\/\/----------------------------------------------------------------------\nMutex::Locker::Locker (Mutex& m) :\n    m_mutex_ptr(m.GetMutex())\n{\n    if (m_mutex_ptr)\n        Mutex::Lock (m_mutex_ptr);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Constructor with a Mutex object pointer.\n\/\/\n\/\/ This will create a scoped mutex locking object that extracts the\n\/\/ mutex owned by \"m\" and locks it.\n\/\/----------------------------------------------------------------------\nMutex::Locker::Locker (Mutex* m) :\n    m_mutex_ptr(m ? m->GetMutex() : NULL)\n{\n    if (m_mutex_ptr)\n        Mutex::Lock (m_mutex_ptr);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Constructor with a raw pthread mutex object pointer.\n\/\/\n\/\/ This will create a scoped mutex locking object that locks \"mutex\"\n\/\/----------------------------------------------------------------------\nMutex::Locker::Locker (pthread_mutex_t *mutex_ptr) :\n    m_mutex_ptr(mutex_ptr)\n{\n    if (m_mutex_ptr)\n        Mutex::Lock (m_mutex_ptr);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Destructor\n\/\/\n\/\/ Unlocks any owned mutex object (if it is valid).\n\/\/----------------------------------------------------------------------\nMutex::Locker::~Locker ()\n{\n    Reset();\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Unlock the current mutex in this object (if this owns a valid\n\/\/ mutex) and lock the new \"mutex\" object if it is non-NULL.\n\/\/----------------------------------------------------------------------\nvoid\nMutex::Locker::Reset (pthread_mutex_t *mutex_ptr)\n{\n    \/\/ We already have this mutex locked or both are NULL...\n    if (m_mutex_ptr == mutex_ptr)\n        return;\n\n    if (m_mutex_ptr)\n        Mutex::Unlock (m_mutex_ptr);\n\n    m_mutex_ptr = mutex_ptr;\n    if (m_mutex_ptr)\n        Mutex::Lock (m_mutex_ptr);\n}\n\nbool\nMutex::Locker::TryLock (pthread_mutex_t *mutex_ptr)\n{\n    \/\/ We already have this mutex locked!\n    if (m_mutex_ptr == mutex_ptr)\n        return true;\n\n    Reset ();\n\n    if (mutex_ptr)\n    {\n        if (Mutex::TryLock (mutex_ptr) == 0)\n            m_mutex_ptr = mutex_ptr;\n    }\n    return m_mutex_ptr != NULL;\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Default constructor.\n\/\/\n\/\/ Creates a pthread mutex with no attributes.\n\/\/----------------------------------------------------------------------\nMutex::Mutex () :\n    m_mutex()\n{\n    int err;\n    err = ::pthread_mutex_init (&m_mutex, NULL);\n    assert(err == 0);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Default constructor.\n\/\/\n\/\/ Creates a pthread mutex with \"type\" as the mutex type.\n\/\/----------------------------------------------------------------------\nMutex::Mutex (Mutex::Type type) :\n    m_mutex()\n{\n    int err;\n    ::pthread_mutexattr_t attr;\n    err = ::pthread_mutexattr_init (&attr);\n    assert(err == 0);\n    switch (type)\n    {\n    case eMutexTypeNormal:\n#if ENABLE_MUTEX_ERROR_CHECKING\n        err = ::pthread_mutexattr_settype (&attr, PTHREAD_MUTEX_ERRORCHECK);\n#else\n        err = ::pthread_mutexattr_settype (&attr, PTHREAD_MUTEX_NORMAL);\n#endif\n        break;\n\n    case eMutexTypeRecursive:\n        err = ::pthread_mutexattr_settype (&attr, PTHREAD_MUTEX_RECURSIVE);\n        break;\n\n    default:\n        err = -1;\n        break;\n    }\n    assert(err == 0);\n    err = ::pthread_mutex_init (&m_mutex, &attr);\n    assert(err == 0);\n    err = ::pthread_mutexattr_destroy (&attr);\n    assert(err == 0);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Destructor.\n\/\/\n\/\/ Destroys the mutex owned by this object.\n\/\/----------------------------------------------------------------------\nMutex::~Mutex()\n{\n    int err;\n    err = ::pthread_mutex_destroy (&m_mutex);\n#if ENABLE_MUTEX_ERROR_CHECKING\n    if (err)\n    {\n        Host::SetCrashDescriptionWithFormat (\"%s error: pthread_mutex_destroy() => err = %i (%s)\", __PRETTY_FUNCTION__, err, strerror(err));\n        assert(err == 0);\n    }\n    memset (&m_mutex, '\\xba', sizeof(m_mutex));\n#endif\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Mutex get accessor.\n\/\/----------------------------------------------------------------------\npthread_mutex_t *\nMutex::GetMutex()\n{\n    return &m_mutex;\n}\n\nint\nMutex::Lock (pthread_mutex_t *mutex_ptr)\n{\n    DEBUG_LOG (\"[%4.4x\/%4.4x] pthread_mutex_lock (%p)...\\n\", Host::GetCurrentProcessID(), Host::GetCurrentThreadID(), mutex_ptr);\n    int err = ::pthread_mutex_lock (mutex_ptr);\n#if ENABLE_MUTEX_ERROR_CHECKING\n    if (err)\n    {\n        Host::SetCrashDescriptionWithFormat (\"%s error: pthread_mutex_destroy(%p) => err = %i (%s)\", __PRETTY_FUNCTION__, mutex_ptr, err, strerror(err));\n        assert(err == 0);\n    }\n#endif\n    DEBUG_LOG (\"[%4.4x\/%4.4x] pthread_mutex_lock (%p) => %i\\n\", Host::GetCurrentProcessID(), Host::GetCurrentThreadID(), mutex_ptr, err);\n    return err;\n}\n\nint\nMutex::TryLock (pthread_mutex_t *mutex_ptr)\n{\n    int err = ::pthread_mutex_trylock (mutex_ptr);\n    DEBUG_LOG (\"[%4.4x\/%4.4x] pthread_mutex_trylock (%p) => %i\\n\", Host::GetCurrentProcessID(), Host::GetCurrentThreadID(), mutex_ptr, err);\n    return err;\n}\n\nint\nMutex::Unlock (pthread_mutex_t *mutex_ptr)\n{\n    int err = ::pthread_mutex_unlock (mutex_ptr);\n#if ENABLE_MUTEX_ERROR_CHECKING\n    if (err)\n    {\n        Host::SetCrashDescriptionWithFormat (\"%s error: pthread_mutex_unlock(%p) => err = %i (%s)\", __PRETTY_FUNCTION__, mutex_ptr, err, strerror(err));\n        assert(err == 0);\n    }\n#endif\n    DEBUG_LOG (\"[%4.4x\/%4.4x] pthread_mutex_unlock (%p) => %i\\n\", Host::GetCurrentProcessID(), Host::GetCurrentThreadID(), mutex_ptr, err);\n    return err;\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Locks the mutex owned by this object, if the mutex is already\n\/\/ locked, the calling thread will block until the mutex becomes\n\/\/ available.\n\/\/\n\/\/ RETURNS\n\/\/  The error code from the pthread_mutex_lock() function call.\n\/\/----------------------------------------------------------------------\nint\nMutex::Lock()\n{\n    return Mutex::Lock (&m_mutex);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Attempts to lock the mutex owned by this object without blocking.\n\/\/ If the mutex is already locked, TryLock() will not block waiting\n\/\/ for the mutex, but will return an error condition.\n\/\/\n\/\/ RETURNS\n\/\/  The error code from the pthread_mutex_trylock() function call.\n\/\/----------------------------------------------------------------------\nint\nMutex::TryLock()\n{\n    return Mutex::TryLock (&m_mutex);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ If the current thread holds the lock on the owned mutex, then\n\/\/ Unlock() will unlock the mutex. Calling Unlock() on this object\n\/\/ that the calling thread does not hold will result in undefined\n\/\/ behavior.\n\/\/\n\/\/ RETURNS\n\/\/  The error code from the pthread_mutex_unlock() function call.\n\/\/----------------------------------------------------------------------\nint\nMutex::Unlock()\n{\n    return Mutex::Unlock (&m_mutex);\n}\n<commit_msg>Fix typo.<commit_after>\/\/===-- Mutex.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\/Host\/Mutex.h\"\n#include \"lldb\/Host\/Host.h\"\n\n#include <string.h>\n#include <stdio.h>\n#include <unistd.h>\n\n#if 0\n\/\/ This logging is way too verbose to enable even for a log channel. \n\/\/ This logging can be enabled by changing the \"#if 0\", but should be\n\/\/ reverted prior to checking in.\n#include <cstdio>\n#define DEBUG_LOG(fmt, ...) printf(fmt, ## __VA_ARGS__)\n#else\n#define DEBUG_LOG(fmt, ...)\n#endif\n\n\/\/ Enable extra mutex error checking\n#ifdef LLDB_CONFIGURATION_DEBUG\n#define ENABLE_MUTEX_ERROR_CHECKING 1\n#endif\n\nusing namespace lldb_private;\n\n\/\/----------------------------------------------------------------------\n\/\/ Default constructor.\n\/\/\n\/\/ This will create a scoped mutex locking object that doesn't have\n\/\/ a mutex to lock. One will need to be provided using the Reset()\n\/\/ method.\n\/\/----------------------------------------------------------------------\nMutex::Locker::Locker () :\n    m_mutex_ptr(NULL)\n{\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Constructor with a Mutex object.\n\/\/\n\/\/ This will create a scoped mutex locking object that extracts the\n\/\/ mutex owned by \"m\" and locks it.\n\/\/----------------------------------------------------------------------\nMutex::Locker::Locker (Mutex& m) :\n    m_mutex_ptr(m.GetMutex())\n{\n    if (m_mutex_ptr)\n        Mutex::Lock (m_mutex_ptr);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Constructor with a Mutex object pointer.\n\/\/\n\/\/ This will create a scoped mutex locking object that extracts the\n\/\/ mutex owned by \"m\" and locks it.\n\/\/----------------------------------------------------------------------\nMutex::Locker::Locker (Mutex* m) :\n    m_mutex_ptr(m ? m->GetMutex() : NULL)\n{\n    if (m_mutex_ptr)\n        Mutex::Lock (m_mutex_ptr);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Constructor with a raw pthread mutex object pointer.\n\/\/\n\/\/ This will create a scoped mutex locking object that locks \"mutex\"\n\/\/----------------------------------------------------------------------\nMutex::Locker::Locker (pthread_mutex_t *mutex_ptr) :\n    m_mutex_ptr(mutex_ptr)\n{\n    if (m_mutex_ptr)\n        Mutex::Lock (m_mutex_ptr);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Destructor\n\/\/\n\/\/ Unlocks any owned mutex object (if it is valid).\n\/\/----------------------------------------------------------------------\nMutex::Locker::~Locker ()\n{\n    Reset();\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Unlock the current mutex in this object (if this owns a valid\n\/\/ mutex) and lock the new \"mutex\" object if it is non-NULL.\n\/\/----------------------------------------------------------------------\nvoid\nMutex::Locker::Reset (pthread_mutex_t *mutex_ptr)\n{\n    \/\/ We already have this mutex locked or both are NULL...\n    if (m_mutex_ptr == mutex_ptr)\n        return;\n\n    if (m_mutex_ptr)\n        Mutex::Unlock (m_mutex_ptr);\n\n    m_mutex_ptr = mutex_ptr;\n    if (m_mutex_ptr)\n        Mutex::Lock (m_mutex_ptr);\n}\n\nbool\nMutex::Locker::TryLock (pthread_mutex_t *mutex_ptr)\n{\n    \/\/ We already have this mutex locked!\n    if (m_mutex_ptr == mutex_ptr)\n        return true;\n\n    Reset ();\n\n    if (mutex_ptr)\n    {\n        if (Mutex::TryLock (mutex_ptr) == 0)\n            m_mutex_ptr = mutex_ptr;\n    }\n    return m_mutex_ptr != NULL;\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Default constructor.\n\/\/\n\/\/ Creates a pthread mutex with no attributes.\n\/\/----------------------------------------------------------------------\nMutex::Mutex () :\n    m_mutex()\n{\n    int err;\n    err = ::pthread_mutex_init (&m_mutex, NULL);\n    assert(err == 0);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Default constructor.\n\/\/\n\/\/ Creates a pthread mutex with \"type\" as the mutex type.\n\/\/----------------------------------------------------------------------\nMutex::Mutex (Mutex::Type type) :\n    m_mutex()\n{\n    int err;\n    ::pthread_mutexattr_t attr;\n    err = ::pthread_mutexattr_init (&attr);\n    assert(err == 0);\n    switch (type)\n    {\n    case eMutexTypeNormal:\n#if ENABLE_MUTEX_ERROR_CHECKING\n        err = ::pthread_mutexattr_settype (&attr, PTHREAD_MUTEX_ERRORCHECK);\n#else\n        err = ::pthread_mutexattr_settype (&attr, PTHREAD_MUTEX_NORMAL);\n#endif\n        break;\n\n    case eMutexTypeRecursive:\n        err = ::pthread_mutexattr_settype (&attr, PTHREAD_MUTEX_RECURSIVE);\n        break;\n\n    default:\n        err = -1;\n        break;\n    }\n    assert(err == 0);\n    err = ::pthread_mutex_init (&m_mutex, &attr);\n    assert(err == 0);\n    err = ::pthread_mutexattr_destroy (&attr);\n    assert(err == 0);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Destructor.\n\/\/\n\/\/ Destroys the mutex owned by this object.\n\/\/----------------------------------------------------------------------\nMutex::~Mutex()\n{\n    int err;\n    err = ::pthread_mutex_destroy (&m_mutex);\n#if ENABLE_MUTEX_ERROR_CHECKING\n    if (err)\n    {\n        Host::SetCrashDescriptionWithFormat (\"%s error: pthread_mutex_destroy() => err = %i (%s)\", __PRETTY_FUNCTION__, err, strerror(err));\n        assert(err == 0);\n    }\n    memset (&m_mutex, '\\xba', sizeof(m_mutex));\n#endif\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Mutex get accessor.\n\/\/----------------------------------------------------------------------\npthread_mutex_t *\nMutex::GetMutex()\n{\n    return &m_mutex;\n}\n\nint\nMutex::Lock (pthread_mutex_t *mutex_ptr)\n{\n    DEBUG_LOG (\"[%4.4x\/%4.4x] pthread_mutex_lock (%p)...\\n\", Host::GetCurrentProcessID(), Host::GetCurrentThreadID(), mutex_ptr);\n    int err = ::pthread_mutex_lock (mutex_ptr);\n#if ENABLE_MUTEX_ERROR_CHECKING\n    if (err)\n    {\n        Host::SetCrashDescriptionWithFormat (\"%s error: pthread_mutex_lock(%p) => err = %i (%s)\", __PRETTY_FUNCTION__, mutex_ptr, err, strerror(err));\n        assert(err == 0);\n    }\n#endif\n    DEBUG_LOG (\"[%4.4x\/%4.4x] pthread_mutex_lock (%p) => %i\\n\", Host::GetCurrentProcessID(), Host::GetCurrentThreadID(), mutex_ptr, err);\n    return err;\n}\n\nint\nMutex::TryLock (pthread_mutex_t *mutex_ptr)\n{\n    int err = ::pthread_mutex_trylock (mutex_ptr);\n    DEBUG_LOG (\"[%4.4x\/%4.4x] pthread_mutex_trylock (%p) => %i\\n\", Host::GetCurrentProcessID(), Host::GetCurrentThreadID(), mutex_ptr, err);\n    return err;\n}\n\nint\nMutex::Unlock (pthread_mutex_t *mutex_ptr)\n{\n    int err = ::pthread_mutex_unlock (mutex_ptr);\n#if ENABLE_MUTEX_ERROR_CHECKING\n    if (err)\n    {\n        Host::SetCrashDescriptionWithFormat (\"%s error: pthread_mutex_unlock(%p) => err = %i (%s)\", __PRETTY_FUNCTION__, mutex_ptr, err, strerror(err));\n        assert(err == 0);\n    }\n#endif\n    DEBUG_LOG (\"[%4.4x\/%4.4x] pthread_mutex_unlock (%p) => %i\\n\", Host::GetCurrentProcessID(), Host::GetCurrentThreadID(), mutex_ptr, err);\n    return err;\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Locks the mutex owned by this object, if the mutex is already\n\/\/ locked, the calling thread will block until the mutex becomes\n\/\/ available.\n\/\/\n\/\/ RETURNS\n\/\/  The error code from the pthread_mutex_lock() function call.\n\/\/----------------------------------------------------------------------\nint\nMutex::Lock()\n{\n    return Mutex::Lock (&m_mutex);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Attempts to lock the mutex owned by this object without blocking.\n\/\/ If the mutex is already locked, TryLock() will not block waiting\n\/\/ for the mutex, but will return an error condition.\n\/\/\n\/\/ RETURNS\n\/\/  The error code from the pthread_mutex_trylock() function call.\n\/\/----------------------------------------------------------------------\nint\nMutex::TryLock()\n{\n    return Mutex::TryLock (&m_mutex);\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ If the current thread holds the lock on the owned mutex, then\n\/\/ Unlock() will unlock the mutex. Calling Unlock() on this object\n\/\/ that the calling thread does not hold will result in undefined\n\/\/ behavior.\n\/\/\n\/\/ RETURNS\n\/\/  The error code from the pthread_mutex_unlock() function call.\n\/\/----------------------------------------------------------------------\nint\nMutex::Unlock()\n{\n    return Mutex::Unlock (&m_mutex);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"palabos3D.h\"\n#include \"palabos3D.hh\"\n#include <vector>\n#include <cmath>\n#include <time.h>\n\nusing namespace plb;\nusing namespace plb::descriptors;\nusing namespace std;\n\n\ntypedef double T;\ntypedef Array<T,3> Velocity;\n\/\/#define DESCRIPTOR descriptors::D3Q27Descriptor\n#define DESCRIPTOR MRTD3Q19Descriptor\n typedef MRTdynamics<T,DESCRIPTOR> BackgroundDynamics;\n typedef AnechoicMRTdynamics<T,DESCRIPTOR> AnechoicBackgroundDynamics;\n\n\/\/ ---------------------------------------------\n\/\/ Includes of acoustics resources\n#include \"acoustics\/acoustics3D.h\"\nusing namespace plb_acoustics_3D;\n\/\/ ---------------------------------------------\n\nconst T rho0 = 1;\nconst T drho = rho0\/10;\n\n\/\/ Get current date\/time, format is YYYY-MM-DD.HH:mm:ss\nconst std::string currentDateTime() {\n    time_t     now = time(0);\n    struct tm  tstruct;\n    char       buf[80];\n    tstruct = *localtime(&now);\n    \/\/ Visit http:\/\/en.cppreference.com\/w\/cpp\/chrono\/c\/strftime\n    \/\/ for more information about date\/time format\n    strftime(buf, sizeof(buf), \"%Y-%m-%d.%X\", &tstruct);\n\n    return buf;\n}\n\nvoid writeGifs(MultiBlockLattice3D<T,DESCRIPTOR>& lattice, plint iter){\n    const plint nx = lattice.getNx();\n    const plint ny = lattice.getNy();\n    const plint nz = lattice.getNz();\n\n    const plint imSize = 600;\n    ImageWriter<T> imageWriter(\"leeloo\");\n    \n    Box3D slice(0, nx-1, 0, ny-1, nz\/2, nz\/2);\n    \/\/imageWriter.writeGif(createFileName(\"u\", iT, 6),\n     \/\/*computeDensity(lattice), );\n\n    imageWriter.writeGif( createFileName(\"rho\", iter, 6),\n    *computeDensity(lattice, slice), \n    (T) rho0 - drho\/1000000, (T) rho0 + drho\/1000000, imSize, imSize);\n}\n\nvoid writeVTK(MultiBlockLattice3D<T,DESCRIPTOR>& lattice, plint iter){\n        VtkImageOutput3D<T> vtkOut(createFileName(\"vtk\", iter, 6), 1.);\n        vtkOut.writeData<float>(*computeDensity(lattice), \"density\", 1.);\n        \/\/vtkOut.writeData<3,float>(*computeVelocity(lattice), \"velocity\", 1.);\n}\n\nvoid build_duct(MultiBlockLattice3D<T,DESCRIPTOR>& lattice, plint nx, plint ny,\n    Array<plint,3> position, plint radius, plint length, plint thickness, T omega){\n    length += 4;\n    \/\/ Duct is constructed along the Z direction\n    \/\/plint size_square = 50;\n    plint size_square = 2*radius;\n    plint radius_intern = radius - thickness;\n    for (plint x = position[0] - radius; x < nx\/2 + size_square\/2; ++x){\n        for (plint y = position[1] - radius; y < ny\/2 + size_square\/2; ++y){\n            for (plint z = position[2]; z < length + position[2]; ++z){\n\n                if (radius*radius > (x-nx\/2)*(x-nx\/2) + (y-ny\/2)*(y-ny\/2)){\n                    \/\/pcout << \"passou\" << endl;\n                    DotList3D points_to_aplly_dynamics;\n                    points_to_aplly_dynamics.addDot(Dot3D(x,y,z));\n                    \/\/OnLatticeBoundaryCondition3D<T,DESCRIPTOR> *bc = createLocalBoundaryCondition3D<T,DESCRIPTOR>();\n                    \/\/bc->setVelocityConditionOnBlockBoundaries(lattice, points_to_aplly_dynamics, boundary::freeslip);\n                    defineDynamics(lattice, points_to_aplly_dynamics, new BounceBack<T,DESCRIPTOR>(0));\n                }\n                \/\/ extrude\n                if (radius_intern*radius_intern > (x-nx\/2)*(x-nx\/2) + (y-ny\/2)*(y-ny\/2) && z > position[2] + 2){\n                    \/\/pcout << \"passou\" << endl;\n                    DotList3D points_to_aplly_dynamics;\n                    points_to_aplly_dynamics.addDot(Dot3D(x,y,z));\n                    defineDynamics(lattice, points_to_aplly_dynamics, new BackgroundDynamics(omega));\n                }\n\n            }\n        }\n    }\n\n}\n\nint main(int argc, char **argv){\n    plbInit(&argc, &argv);\n\n    \/\/const plint length_domain = 420;\n    const plint radius = 20;\n    const plint diameter = 2*radius;\n    \/\/const plint length_domain = 150;\n    const plint nx = 12*diameter + 60;\n    const plint ny = 12*diameter + 60;\n    const plint position_duct_z = 30;\n    const plint nz = 9*diameter + 60;\n    const T lattice_speed_sound = 1\/sqrt(3);\n    const T omega = 1.985;\n    const plint maxT = 15000;\n    Array<T,3> u0(0, 0, 0);\n\n    \/\/const plint maxT = 2*120\/lattice_speed_sound;\n    const plint maxT_final_source = maxT - nz*sqrt(3);\n    const T ka_max = 2.5;\n    const T ka_min = 0;\n    const T cs2 = lattice_speed_sound*lattice_speed_sound;\n    clock_t t;\n\n    \/\/ Saving a propery directory\n    std::string fNameOut = currentDateTime() + \"+tmp\";\n    std::string command = \"mkdir -p \" + fNameOut;\n    char to_char_command[1024];\n    strcpy(to_char_command, command.c_str());\n    system(to_char_command);\n    global::directories().setOutputDir(fNameOut+\"\/\");\n\n\n    \/\/ Setting anechoic dynamics like this way\n    MultiBlockLattice3D<T, DESCRIPTOR> lattice(nx, ny, nz,  new AnechoicBackgroundDynamics(omega));\n    defineDynamics(lattice, lattice.getBoundingBox(), new BackgroundDynamics(omega));\n\n    pcout << \"Creation of the lattice. Time max: \" << maxT << endl;\n\n    pcout << getMultiBlockInfo(lattice) << std::endl;\n\n    \/\/ Switch off periodicity.\n    lattice.periodicity().toggleAll(false);\n\n    pcout << \"Initilization of rho and u.\" << endl;\n    initializeAtEquilibrium(lattice, lattice.getBoundingBox(), rho0 , u0);\n\n    \/*plint size_square = 10;\n    Box3D square(\n    35, 35 + size_square,\n    ny\/2 - size_square\/2, ny\/2 + size_square\/2, \n    nz\/2 - size_square\/2, nz\/2 + size_square\/2);\n    defineDynamics(lattice, square, new BounceBack<T,DESCRIPTOR>((T)0));*\/\n\n    \/*(MultiBlockLattice3D<T,DESCRIPTOR>& lattice, plint nx, plint ny,\n    Array<plint,3> position, plint radius, plint length, plint thickness)*\/\n    Array<plint,3> position(nx\/2, ny\/2, position_duct_z);\n    plint length_duct = 3*diameter;\n    plint thickness_duct = 2;\n    build_duct(lattice, nx, ny, position, radius, length_duct, thickness_duct, omega);\n\n    T rhoBar_target = 0;\n    \/\/const T mach_number = 0.2;\n    \/\/const T velocity_flow = mach_number*lattice_speed_sound;\n    Array<T,3> j_target(0, 0, 0);\n    T size_anechoic_buffer = 30;\n    defineAnechoicMRTBoards(nx, ny, nz, lattice, size_anechoic_buffer,\n      omega, j_target, j_target, j_target, j_target, j_target, j_target,\n      rhoBar_target);\n\n    lattice.initialize();\n\n    pcout << std::endl << \"Voxelizing the domain.\" << std::endl;\n\n    pcout << \"Simulation begins\" << endl;\n\n    \/\/ Setting probes\n    plint radius_probe = (radius - 1)\/sqrt(2);\n    \/\/ half size\n    plint position_z_3r = position[2] + length_duct - 3*radius;\n    Box3D surface_probe_3r(nx\/2 - radius_probe\/sqrt(2), \n            nx\/2 + radius_probe\/sqrt(2), \n            ny\/2 - radius_probe\/sqrt(2), \n            ny\/2 + radius_probe\/sqrt(2),\n            position_z_3r, position_z_3r);\n\n    \/\/plint position_z_4r = position[2] + length_duct - 4*radius;\n    plint position_z_boca = position[2] + length_duct;\n    Box3D surface_probe_boca(nx\/2 - radius_probe\/sqrt(2), \n            nx\/2 + radius_probe\/sqrt(2), \n            ny\/2 - radius_probe\/sqrt(2), \n            ny\/2 + radius_probe\/sqrt(2),\n            position_z_boca, position_z_boca);\n\n    std::string pressures_boca_string = fNameOut+\"\/history_pressures_boca.dat\";\n    char to_char_pressures_boca[1024];\n    strcpy(to_char_pressures_boca, pressures_boca_string.c_str());\n    plb_ofstream history_pressures_boca(to_char_pressures_boca);\n\n    std::string velocities_boca_string = fNameOut+\"\/history_velocities_boca.dat\";\n    char to_char_velocities_boca[1024];\n    strcpy(to_char_velocities_boca, velocities_boca_string.c_str());\n    plb_ofstream history_velocities_boca(to_char_velocities_boca);\n\n    std::string pressures_3r_string = fNameOut+\"\/history_pressures_3r.dat\";\n    char to_char_pressures_3r[1024];\n    strcpy(to_char_pressures_3r, pressures_3r_string.c_str());\n    plb_ofstream history_pressures_3r(to_char_pressures_3r);\n\n    std::string velocities_3r_string = fNameOut+\"\/history_velocities_3r.dat\";\n    char to_char_velocities_3r[1024];\n    strcpy(to_char_velocities_3r, velocities_3r_string.c_str());\n    plb_ofstream history_velocities_3r(to_char_velocities_3r);\n    \n    t = clock();\n    std::string AllSimulationInfo_string = fNameOut + \"\/AllSimulationInfo.txt\";\n    char to_char_AllSimulationInfo[1024];\n    strcpy(to_char_AllSimulationInfo, AllSimulationInfo_string.c_str());\n    plb_ofstream AllSimulationInfo(to_char_AllSimulationInfo);\n\n    std::string title = \"\\nSimulacao para testar a questao da inercia.\\n\"; \n    AllSimulationInfo << endl\n    << title << endl\n    << \"Dados da simulação\" << endl\n    << \"Lattice:\" << endl << endl \n    << \"nx: \" << nx << \" ny: \" << ny << \" nz: \" << nz << endl\n    << \" omega: \" << omega << endl << endl\n    << \"Tempos: \" << endl\n    << \"Total Time step: \" << maxT << endl\n    << \"Discretizacao: \" << radius\/thickness_duct << endl\n    << \"Tamanho duto: \" << length_duct << endl\n    << \"Posicao do duto: \" << position[2] << endl;\n\n    for (plint iT=0; iT<maxT; ++iT){\n        \/\/pcout << \" foi 1 \" << iT << endl;\n        if (iT <= maxT_final_source){\n            \/\/drho*sin(2*M_PI*(lattice_speed_sound\/20)*iT);\n            \/\/drho*cos((lattice_speed_sound\/radius)*(ka_max*((maxT-iT)\/maxT)));\n            \n            T initial_frequency = ka_min*lattice_speed_sound\/(2*M_PI*radius);\n            T frequency_max_lattice = ka_max*lattice_speed_sound\/(2*M_PI*radius);\n            T variation_frequency = (frequency_max_lattice - initial_frequency)\/maxT_final_source;\n            T frequency_function = initial_frequency*iT + (variation_frequency*iT*iT)\/2;\n            T phase = 2*M_PI*frequency_function;\n            T chirp_hand = 1. + drho*sin(phase);\n\n            T rho_changing = 1. + drho*sin(2*M_PI*(lattice_speed_sound\/20)*iT);\n            \/\/Box3D impulse(nx\/2, nx\/2, ny\/2, ny\/2, position_z_3r, position_z_3r);\n            plint source_radius = radius - 1;\n            Box3D place_source(position[0] - source_radius\/sqrt(2), \n                position[0] + source_radius\/sqrt(2), \n                position[1] - source_radius\/sqrt(2), \n                position[1] + source_radius\/sqrt(2), \n                position[2] + 3, position[2] + 8);\n            \/\/Box3D impulse(centerLB[0] + 10, centerLB[0] + 10, ny\/2, ny\/2, nz\/2, nz\/2);\n            initializeAtEquilibrium(lattice, place_source, rho_changing, u0);\n        }else{\n            plint source_radius = radius - 1;\n            Box3D place_source(position[0] - source_radius\/sqrt(2), \n                position[0] + source_radius\/sqrt(2), \n                position[1] - source_radius\/sqrt(2), \n                position[1] + source_radius\/sqrt(2), \n                position[2] + 3, position[2] + 8);\n            initializeAtEquilibrium(lattice, place_source, rho0, u0);\n        }\n\n\n        if (iT % 10 == 0 && iT>0) {\n            pcout << \"Iteration \" << iT << endl;\n        }\n\n        if (iT % 1000 == 0) {\n            \/\/writeGifs(lattice,iT);\n            writeVTK(lattice, iT);\n        }\n\n        \/\/ extract values of pressure and velocities\n        history_pressures_3r << setprecision(10) << (computeAverageDensity(lattice, surface_probe_3r) - rho0)*cs2 << endl;\n        history_pressures_boca << setprecision(10) << (computeAverageDensity(lattice, surface_probe_boca) - rho0)*cs2 << endl;\n\n        std::auto_ptr<MultiScalarField3D<T> > velocity_boca(plb::computeVelocityComponent(lattice, surface_probe_boca, 2));\n        history_velocities_boca << setprecision(10) <<\n        computeAverage(*velocity_boca, surface_probe_boca)\/lattice_speed_sound << endl;\n        std::auto_ptr<MultiScalarField3D<T> > velocity_3r(plb::computeVelocityComponent(lattice, surface_probe_3r, 2));\n        history_velocities_boca << setprecision(10) <<\n        computeAverage(*velocity_3r, surface_probe_3r)\/lattice_speed_sound << endl;\n\n        lattice.collideAndStream();\n    }\n\n    t = (clock() - t)\/CLOCKS_PER_SEC;\n    AllSimulationInfo << endl << \"Execution time: \" << t << \" segundos\" << endl << endl;\n\n    pcout << \"End of simulation at iteration \" << endl;\n}\n<commit_msg>Adding correction on chirp<commit_after>#include \"palabos3D.h\"\n#include \"palabos3D.hh\"\n#include <vector>\n#include <cmath>\n#include <time.h>\n\nusing namespace plb;\nusing namespace plb::descriptors;\nusing namespace std;\n\n\ntypedef double T;\ntypedef Array<T,3> Velocity;\n\/\/#define DESCRIPTOR descriptors::D3Q27Descriptor\n#define DESCRIPTOR MRTD3Q19Descriptor\n typedef MRTdynamics<T,DESCRIPTOR> BackgroundDynamics;\n typedef AnechoicMRTdynamics<T,DESCRIPTOR> AnechoicBackgroundDynamics;\n\n\/\/ ---------------------------------------------\n\/\/ Includes of acoustics resources\n#include \"acoustics\/acoustics3D.h\"\nusing namespace plb_acoustics_3D;\n\/\/ ---------------------------------------------\n\nconst T rho0 = 1;\nconst T drho = rho0\/10;\n\n\/\/ Get current date\/time, format is YYYY-MM-DD.HH:mm:ss\nconst std::string currentDateTime() {\n    time_t     now = time(0);\n    struct tm  tstruct;\n    char       buf[80];\n    tstruct = *localtime(&now);\n    \/\/ Visit http:\/\/en.cppreference.com\/w\/cpp\/chrono\/c\/strftime\n    \/\/ for more information about date\/time format\n    strftime(buf, sizeof(buf), \"%Y-%m-%d.%X\", &tstruct);\n\n    return buf;\n}\n\nvoid writeGifs(MultiBlockLattice3D<T,DESCRIPTOR>& lattice, plint iter){\n    const plint nx = lattice.getNx();\n    const plint ny = lattice.getNy();\n    const plint nz = lattice.getNz();\n\n    const plint imSize = 600;\n    ImageWriter<T> imageWriter(\"leeloo\");\n    \n    Box3D slice(0, nx-1, 0, ny-1, nz\/2, nz\/2);\n    \/\/imageWriter.writeGif(createFileName(\"u\", iT, 6),\n     \/\/*computeDensity(lattice), );\n\n    imageWriter.writeGif( createFileName(\"rho\", iter, 6),\n    *computeDensity(lattice, slice), \n    (T) rho0 - drho\/1000000, (T) rho0 + drho\/1000000, imSize, imSize);\n}\n\nvoid writeVTK(MultiBlockLattice3D<T,DESCRIPTOR>& lattice, plint iter){\n        VtkImageOutput3D<T> vtkOut(createFileName(\"vtk\", iter, 6), 1.);\n        vtkOut.writeData<float>(*computeDensity(lattice), \"density\", 1.);\n        \/\/vtkOut.writeData<3,float>(*computeVelocity(lattice), \"velocity\", 1.);\n}\n\nvoid build_duct(MultiBlockLattice3D<T,DESCRIPTOR>& lattice, plint nx, plint ny,\n    Array<plint,3> position, plint radius, plint length, plint thickness, T omega){\n    length += 4;\n    \/\/ Duct is constructed along the Z direction\n    \/\/plint size_square = 50;\n    plint size_square = 2*radius;\n    plint radius_intern = radius - thickness;\n    for (plint x = position[0] - radius; x < nx\/2 + size_square\/2; ++x){\n        for (plint y = position[1] - radius; y < ny\/2 + size_square\/2; ++y){\n            for (plint z = position[2]; z < length + position[2]; ++z){\n\n                if (radius*radius > (x-nx\/2)*(x-nx\/2) + (y-ny\/2)*(y-ny\/2)){\n                    \/\/pcout << \"passou\" << endl;\n                    DotList3D points_to_aplly_dynamics;\n                    points_to_aplly_dynamics.addDot(Dot3D(x,y,z));\n                    \/\/OnLatticeBoundaryCondition3D<T,DESCRIPTOR> *bc = createLocalBoundaryCondition3D<T,DESCRIPTOR>();\n                    \/\/bc->setVelocityConditionOnBlockBoundaries(lattice, points_to_aplly_dynamics, boundary::freeslip);\n                    defineDynamics(lattice, points_to_aplly_dynamics, new BounceBack<T,DESCRIPTOR>(0));\n                }\n                \/\/ extrude\n                if (radius_intern*radius_intern > (x-nx\/2)*(x-nx\/2) + (y-ny\/2)*(y-ny\/2) && z > position[2] + 2){\n                    \/\/pcout << \"passou\" << endl;\n                    DotList3D points_to_aplly_dynamics;\n                    points_to_aplly_dynamics.addDot(Dot3D(x,y,z));\n                    defineDynamics(lattice, points_to_aplly_dynamics, new BackgroundDynamics(omega));\n                }\n\n            }\n        }\n    }\n\n}\n\nint main(int argc, char **argv){\n    plbInit(&argc, &argv);\n\n    \/\/const plint length_domain = 420;\n    const plint radius = 20;\n    const plint diameter = 2*radius;\n    \/\/const plint length_domain = 150;\n    const plint nx = 12*diameter + 60;\n    const plint ny = 12*diameter + 60;\n    const plint position_duct_z = 30;\n    const plint nz = 9*diameter + 60;\n    const T lattice_speed_sound = 1\/sqrt(3);\n    const T omega = 1.985;\n    const plint maxT = 15000;\n    Array<T,3> u0(0, 0, 0);\n\n    \/\/const plint maxT = 2*120\/lattice_speed_sound;\n    const plint maxT_final_source = maxT - nz*sqrt(3);\n    const T ka_max = 2.5;\n    const T ka_min = 0;\n    const T cs2 = lattice_speed_sound*lattice_speed_sound;\n    clock_t t;\n\n    \/\/ Saving a propery directory\n    std::string fNameOut = currentDateTime() + \"+tmp\";\n    std::string command = \"mkdir -p \" + fNameOut;\n    char to_char_command[1024];\n    strcpy(to_char_command, command.c_str());\n    system(to_char_command);\n    global::directories().setOutputDir(fNameOut+\"\/\");\n\n\n    \/\/ Setting anechoic dynamics like this way\n    MultiBlockLattice3D<T, DESCRIPTOR> lattice(nx, ny, nz,  new AnechoicBackgroundDynamics(omega));\n    defineDynamics(lattice, lattice.getBoundingBox(), new BackgroundDynamics(omega));\n\n    pcout << \"Creation of the lattice. Time max: \" << maxT << endl;\n\n    pcout << getMultiBlockInfo(lattice) << std::endl;\n\n    \/\/ Switch off periodicity.\n    lattice.periodicity().toggleAll(false);\n\n    pcout << \"Initilization of rho and u.\" << endl;\n    initializeAtEquilibrium(lattice, lattice.getBoundingBox(), rho0 , u0);\n\n    \/*plint size_square = 10;\n    Box3D square(\n    35, 35 + size_square,\n    ny\/2 - size_square\/2, ny\/2 + size_square\/2, \n    nz\/2 - size_square\/2, nz\/2 + size_square\/2);\n    defineDynamics(lattice, square, new BounceBack<T,DESCRIPTOR>((T)0));*\/\n\n    \/*(MultiBlockLattice3D<T,DESCRIPTOR>& lattice, plint nx, plint ny,\n    Array<plint,3> position, plint radius, plint length, plint thickness)*\/\n    Array<plint,3> position(nx\/2, ny\/2, position_duct_z);\n    plint length_duct = 3*diameter;\n    plint thickness_duct = 2;\n    build_duct(lattice, nx, ny, position, radius, length_duct, thickness_duct, omega);\n\n    T rhoBar_target = 0;\n    \/\/const T mach_number = 0.2;\n    \/\/const T velocity_flow = mach_number*lattice_speed_sound;\n    Array<T,3> j_target(0, 0, 0);\n    T size_anechoic_buffer = 30;\n    defineAnechoicMRTBoards(nx, ny, nz, lattice, size_anechoic_buffer,\n      omega, j_target, j_target, j_target, j_target, j_target, j_target,\n      rhoBar_target);\n\n    lattice.initialize();\n\n    pcout << std::endl << \"Voxelizing the domain.\" << std::endl;\n\n    pcout << \"Simulation begins\" << endl;\n\n    \/\/ Setting probes\n    plint radius_probe = (radius - 1)\/sqrt(2);\n    \/\/ half size\n    plint position_z_3r = position[2] + length_duct - 3*radius;\n    Box3D surface_probe_3r(nx\/2 - radius_probe\/sqrt(2), \n            nx\/2 + radius_probe\/sqrt(2), \n            ny\/2 - radius_probe\/sqrt(2), \n            ny\/2 + radius_probe\/sqrt(2),\n            position_z_3r, position_z_3r);\n\n    \/\/plint position_z_4r = position[2] + length_duct - 4*radius;\n    plint position_z_boca = position[2] + length_duct;\n    Box3D surface_probe_boca(nx\/2 - radius_probe\/sqrt(2), \n            nx\/2 + radius_probe\/sqrt(2), \n            ny\/2 - radius_probe\/sqrt(2), \n            ny\/2 + radius_probe\/sqrt(2),\n            position_z_boca, position_z_boca);\n\n    std::string pressures_boca_string = fNameOut+\"\/history_pressures_boca.dat\";\n    char to_char_pressures_boca[1024];\n    strcpy(to_char_pressures_boca, pressures_boca_string.c_str());\n    plb_ofstream history_pressures_boca(to_char_pressures_boca);\n\n    std::string velocities_boca_string = fNameOut+\"\/history_velocities_boca.dat\";\n    char to_char_velocities_boca[1024];\n    strcpy(to_char_velocities_boca, velocities_boca_string.c_str());\n    plb_ofstream history_velocities_boca(to_char_velocities_boca);\n\n    std::string pressures_3r_string = fNameOut+\"\/history_pressures_3r.dat\";\n    char to_char_pressures_3r[1024];\n    strcpy(to_char_pressures_3r, pressures_3r_string.c_str());\n    plb_ofstream history_pressures_3r(to_char_pressures_3r);\n\n    std::string velocities_3r_string = fNameOut+\"\/history_velocities_3r.dat\";\n    char to_char_velocities_3r[1024];\n    strcpy(to_char_velocities_3r, velocities_3r_string.c_str());\n    plb_ofstream history_velocities_3r(to_char_velocities_3r);\n    \n    t = clock();\n    std::string AllSimulationInfo_string = fNameOut + \"\/AllSimulationInfo.txt\";\n    char to_char_AllSimulationInfo[1024];\n    strcpy(to_char_AllSimulationInfo, AllSimulationInfo_string.c_str());\n    plb_ofstream AllSimulationInfo(to_char_AllSimulationInfo);\n\n    std::string title = \"\\nSimulacao para testar a questao da inercia.\\n\"; \n    AllSimulationInfo << endl\n    << title << endl\n    << \"Dados da simulação\" << endl\n    << \"Lattice:\" << endl << endl \n    << \"nx: \" << nx << \" ny: \" << ny << \" nz: \" << nz << endl\n    << \" omega: \" << omega << endl << endl\n    << \"Tempos: \" << endl\n    << \"Total Time step: \" << maxT << endl\n    << \"Discretizacao: \" << radius\/thickness_duct << endl\n    << \"Tamanho duto: \" << length_duct << endl\n    << \"Posicao do duto: \" << position[2] << endl;\n\n    for (plint iT=0; iT<maxT; ++iT){\n        \/\/pcout << \" foi 1 \" << iT << endl;\n        if (iT <= maxT_final_source){\n            \/\/drho*sin(2*M_PI*(lattice_speed_sound\/20)*iT);\n            \/\/drho*cos((lattice_speed_sound\/radius)*(ka_max*((maxT-iT)\/maxT)));\n            \n            T initial_frequency = ka_min*lattice_speed_sound\/(2*M_PI*radius);\n            T frequency_max_lattice = ka_max*lattice_speed_sound\/(2*M_PI*radius);\n            T variation_frequency = (frequency_max_lattice - initial_frequency)\/maxT_final_source;\n            T frequency_function = initial_frequency*iT + (variation_frequency*iT*iT)\/2;\n            T phase = 2*M_PI*frequency_function;\n            T chirp_hand = 1. + drho*sin(phase);\n\n            \/\/T rho_changing = 1. + drho*sin(2*M_PI*(lattice_speed_sound\/20)*iT);\n            \/\/Box3D impulse(nx\/2, nx\/2, ny\/2, ny\/2, position_z_3r, position_z_3r);\n            plint source_radius = radius - 1;\n            Box3D place_source(position[0] - source_radius\/sqrt(2), \n                position[0] + source_radius\/sqrt(2), \n                position[1] - source_radius\/sqrt(2), \n                position[1] + source_radius\/sqrt(2), \n                position[2] + 3, position[2] + 8);\n            \/\/Box3D impulse(centerLB[0] + 10, centerLB[0] + 10, ny\/2, ny\/2, nz\/2, nz\/2);\n            initializeAtEquilibrium(lattice, place_source, chirp_hand, u0);\n        }else{\n            plint source_radius = radius - 1;\n            Box3D place_source(position[0] - source_radius\/sqrt(2), \n                position[0] + source_radius\/sqrt(2), \n                position[1] - source_radius\/sqrt(2), \n                position[1] + source_radius\/sqrt(2), \n                position[2] + 3, position[2] + 8);\n            initializeAtEquilibrium(lattice, place_source, rho0, u0);\n        }\n\n\n        if (iT % 10 == 0 && iT>0) {\n            pcout << \"Iteration \" << iT << endl;\n        }\n\n        if (iT % 1000 == 0) {\n            \/\/writeGifs(lattice,iT);\n            writeVTK(lattice, iT);\n        }\n\n        \/\/ extract values of pressure and velocities\n        history_pressures_3r << setprecision(10) << (computeAverageDensity(lattice, surface_probe_3r) - rho0)*cs2 << endl;\n        history_pressures_boca << setprecision(10) << (computeAverageDensity(lattice, surface_probe_boca) - rho0)*cs2 << endl;\n\n        std::auto_ptr<MultiScalarField3D<T> > velocity_boca(plb::computeVelocityComponent(lattice, surface_probe_boca, 2));\n        history_velocities_boca << setprecision(10) <<\n        computeAverage(*velocity_boca, surface_probe_boca)\/lattice_speed_sound << endl;\n        std::auto_ptr<MultiScalarField3D<T> > velocity_3r(plb::computeVelocityComponent(lattice, surface_probe_3r, 2));\n        history_velocities_boca << setprecision(10) <<\n        computeAverage(*velocity_3r, surface_probe_3r)\/lattice_speed_sound << endl;\n\n        lattice.collideAndStream();\n    }\n\n    t = (clock() - t)\/CLOCKS_PER_SEC;\n    AllSimulationInfo << endl << \"Execution time: \" << t << \" segundos\" << endl << endl;\n\n    pcout << \"End of simulation at iteration \" << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*** Copyright (c), The Regents of the University of California            ***\n *** For more information please refer to files in the COPYRIGHT directory ***\/\n\/* rsFileOpendir.c - server routine that handles the fileOpendir\n * API\n *\/\n\n\/* script generated code *\/\n#include \"fileOpendir.hpp\"\n#include \"miscServerFunct.hpp\"\n#include \"rsGlobalExtern.hpp\"\n\n\/\/ =-=-=-=-=-=-=-\n#include \"irods_log.hpp\"\n#include \"irods_collection_object.hpp\"\n#include \"irods_resource_backport.hpp\"\n#include \"irods_stacktrace.hpp\"\n\nint\nrsFileOpendir( rsComm_t *rsComm, fileOpendirInp_t *fileOpendirInp ) {\n    rodsServerHost_t *rodsServerHost;\n    int remoteFlag;\n    int fileInx;\n    int status;\n    void *dirPtr = NULL;\n\n    \/\/remoteFlag = resolveHost (&fileOpendirInp->addr, &rodsServerHost);\n    irods::error ret = irods::get_host_for_hier_string( fileOpendirInp->resc_hier_, remoteFlag, rodsServerHost );\n    if ( !ret.ok() ) {\n        irods::log( PASSMSG( \"failed in call to irods::get_host_for_hier_string\", ret ) );\n        return -1;\n    }\n\n    if ( remoteFlag == LOCAL_HOST ) {\n        status = _rsFileOpendir( rsComm, fileOpendirInp, &dirPtr );\n    }\n    else if ( remoteFlag == REMOTE_HOST ) {\n        status = remoteFileOpendir( rsComm, fileOpendirInp, rodsServerHost );\n    }\n    else {\n        if ( remoteFlag < 0 ) {\n            return ( remoteFlag );\n        }\n        else {\n            rodsLog( LOG_NOTICE,\n                     \"rsFileOpendir: resolveHost returned unrecognized value %d\",\n                     remoteFlag );\n            return ( SYS_UNRECOGNIZED_REMOTE_FLAG );\n        }\n    }\n\n    if ( status < 0 ) {\n        return ( status );\n    }\n\n    fileInx = allocAndFillFileDesc( rodsServerHost, fileOpendirInp->objPath, fileOpendirInp->dirName, fileOpendirInp->resc_hier_,\n                                    status, 0 );\n    FileDesc[fileInx].driverDep = dirPtr;\n\n    return ( fileInx );\n}\n\nint\nremoteFileOpendir( rsComm_t *rsComm, fileOpendirInp_t *fileOpendirInp,\n                   rodsServerHost_t *rodsServerHost ) {\n    int fileInx;\n    int status;\n\n    if ( rodsServerHost == NULL ) {\n        rodsLog( LOG_NOTICE,\n                 \"remoteFileOpendir: Invalid rodsServerHost\" );\n        return SYS_INVALID_SERVER_HOST;\n    }\n\n    if ( ( status = svrToSvrConnect( rsComm, rodsServerHost ) ) < 0 ) {\n        return status;\n    }\n\n    fileInx = rcFileOpendir( rodsServerHost->conn, fileOpendirInp );\n\n    if ( fileInx < 0 ) {\n        rodsLog( LOG_NOTICE,\n                 \"remoteFileOpendir: rcFileOpendir failed for %s\",\n                 fileOpendirInp->dirName );\n    }\n\n    return fileInx;\n}\n\n\/\/ =-=-=-=-=-=-=-\n\/\/ _rsFileOpendir - this the local version of rsFileOpendir.\nint _rsFileOpendir(\n    rsComm_t*         _comm,\n    fileOpendirInp_t* _opendir_inp,\n    void**            _dir_ptr ) {\n    \/\/ =-=-=-=-=-=-=-\n    \/\/ FIXME:: XXXX need to check resource permission and vault permission\n    \/\/ when RCAT is available\n\n    \/\/ =-=-=-=-=-=-=-\n    \/\/ make the call to opendir via resource plugin\n    irods::collection_object_ptr coll_obj(\n        new irods::collection_object(\n            _opendir_inp->dirName,\n            _opendir_inp->resc_hier_,\n            0, 0 ) );\n    irods::error opendir_err = fileOpendir( _comm, coll_obj );\n\n    \/\/ =-=-=-=-=-=-=-\n    \/\/ log an error, if any\n    if ( !opendir_err.ok() ) {\n        std::stringstream msg;\n        msg << \"fileOpendir failed for [\";\n        msg << _opendir_inp->dirName;\n        msg << \"]\";\n        irods::error err = PASSMSG( msg.str(), opendir_err );\n        irods::log( err );\n    }\n\n    ( *_dir_ptr ) = coll_obj->directory_pointer(); \/\/ JMC -- TEMPORARY\n\n    return ( opendir_err.code() );\n\n} \/\/ _rsFileOpendir\n\n<commit_msg>[#2212] CID25904:<commit_after>\/*** Copyright (c), The Regents of the University of California            ***\n *** For more information please refer to files in the COPYRIGHT directory ***\/\n\/* rsFileOpendir.c - server routine that handles the fileOpendir\n * API\n *\/\n\n\/* script generated code *\/\n#include \"fileOpendir.hpp\"\n#include \"miscServerFunct.hpp\"\n#include \"rsGlobalExtern.hpp\"\n\n\/\/ =-=-=-=-=-=-=-\n#include \"irods_log.hpp\"\n#include \"irods_collection_object.hpp\"\n#include \"irods_resource_backport.hpp\"\n#include \"irods_stacktrace.hpp\"\n\nint\nrsFileOpendir( rsComm_t *rsComm, fileOpendirInp_t *fileOpendirInp ) {\n    rodsServerHost_t *rodsServerHost;\n    int remoteFlag;\n    int fileInx;\n    int status;\n    void *dirPtr = NULL;\n\n    \/\/remoteFlag = resolveHost (&fileOpendirInp->addr, &rodsServerHost);\n    irods::error ret = irods::get_host_for_hier_string( fileOpendirInp->resc_hier_, remoteFlag, rodsServerHost );\n    if ( !ret.ok() ) {\n        irods::log( PASSMSG( \"failed in call to irods::get_host_for_hier_string\", ret ) );\n        return -1;\n    }\n\n    if ( remoteFlag == LOCAL_HOST ) {\n        status = _rsFileOpendir( rsComm, fileOpendirInp, &dirPtr );\n    }\n    else if ( remoteFlag == REMOTE_HOST ) {\n        status = remoteFileOpendir( rsComm, fileOpendirInp, rodsServerHost );\n    }\n    else {\n        if ( remoteFlag < 0 ) {\n            return ( remoteFlag );\n        }\n        else {\n            rodsLog( LOG_NOTICE,\n                     \"rsFileOpendir: resolveHost returned unrecognized value %d\",\n                     remoteFlag );\n            return ( SYS_UNRECOGNIZED_REMOTE_FLAG );\n        }\n    }\n\n    if ( status < 0 ) {\n        return ( status );\n    }\n\n    fileInx = allocAndFillFileDesc( rodsServerHost, fileOpendirInp->objPath, fileOpendirInp->dirName, fileOpendirInp->resc_hier_,\n                                    status, 0 );\n    if ( fileInx < 0 ) {\n        rodsLog( LOG_NOTICE, \"call to allocAndFileDesc failed with status %ji\", ( intmax_t ) fileInx );\n        return fileInx;\n    }\n    FileDesc[fileInx].driverDep = dirPtr;\n\n    return ( fileInx );\n}\n\nint\nremoteFileOpendir( rsComm_t *rsComm, fileOpendirInp_t *fileOpendirInp,\n                   rodsServerHost_t *rodsServerHost ) {\n    int fileInx;\n    int status;\n\n    if ( rodsServerHost == NULL ) {\n        rodsLog( LOG_NOTICE,\n                 \"remoteFileOpendir: Invalid rodsServerHost\" );\n        return SYS_INVALID_SERVER_HOST;\n    }\n\n    if ( ( status = svrToSvrConnect( rsComm, rodsServerHost ) ) < 0 ) {\n        return status;\n    }\n\n    fileInx = rcFileOpendir( rodsServerHost->conn, fileOpendirInp );\n\n    if ( fileInx < 0 ) {\n        rodsLog( LOG_NOTICE,\n                 \"remoteFileOpendir: rcFileOpendir failed for %s\",\n                 fileOpendirInp->dirName );\n    }\n\n    return fileInx;\n}\n\n\/\/ =-=-=-=-=-=-=-\n\/\/ _rsFileOpendir - this the local version of rsFileOpendir.\nint _rsFileOpendir(\n    rsComm_t*         _comm,\n    fileOpendirInp_t* _opendir_inp,\n    void**            _dir_ptr ) {\n    \/\/ =-=-=-=-=-=-=-\n    \/\/ FIXME:: XXXX need to check resource permission and vault permission\n    \/\/ when RCAT is available\n\n    \/\/ =-=-=-=-=-=-=-\n    \/\/ make the call to opendir via resource plugin\n    irods::collection_object_ptr coll_obj(\n        new irods::collection_object(\n            _opendir_inp->dirName,\n            _opendir_inp->resc_hier_,\n            0, 0 ) );\n    irods::error opendir_err = fileOpendir( _comm, coll_obj );\n\n    \/\/ =-=-=-=-=-=-=-\n    \/\/ log an error, if any\n    if ( !opendir_err.ok() ) {\n        std::stringstream msg;\n        msg << \"fileOpendir failed for [\";\n        msg << _opendir_inp->dirName;\n        msg << \"]\";\n        irods::error err = PASSMSG( msg.str(), opendir_err );\n        irods::log( err );\n    }\n\n    ( *_dir_ptr ) = coll_obj->directory_pointer(); \/\/ JMC -- TEMPORARY\n\n    return ( opendir_err.code() );\n\n} \/\/ _rsFileOpendir\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\ncv::Rect const getRegionOfInterest(cv::Mat const &imgThreshold){\n\tcv::Mat tmp;\n\timgThreshold.copyTo(tmp); \/\/ i don't know why this is necessary :(\n\tcv::Rect boundingRectangle;\n\tstd::vector<std::vector<cv::Point>> contours;\n\tcv::findContours(tmp, contours, CV_RETR_EXTERNAL, CV_CHAIN_APPROX_SIMPLE);\n\tif(contours.size() > 0){ \/\/found something\n\t\tint maxArea = 0;\n\t\tfor(int i = 0; i < contours.size(); i++){\n\t\t\tcv::Rect tmpRect = cv::boundingRect(contours[i]);\n\t\t\tif(tmpRect.area() > maxArea){\n\t\t\t\tboundingRectangle = tmpRect;\n\t\t\t\tmaxArea = tmpRect.area();\n\t\t\t}\n\t\t}\n\t}\n\treturn boundingRectangle;\n}\n\nvoid morphOps(cv::Mat &img, cv::Mat const &structuringElement){\n\t\/\/morphological opening (remove small objects from the foreground)\t\n\tcv::erode(img, img, structuringElement);\n\tcv::dilate(img, img, structuringElement);\n\t\/\/morphological closing (fill small holes in the foreground)\t\n\tcv::dilate(img, img, structuringElement);\n\tcv::erode(img, img, structuringElement);\n}\n\nint main(int argc, char* argv[]){\n\tusing namespace cv;\n\n\tif(argc != 2){\n\t\tstd::cerr << \"usage: .\/track_detection <filename>\" << std::endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/namedWindow(\"Control\", CV_WINDOW_AUTOSIZE);\n\t\/\/int lowH = 0, highH = 179;\n\t\/\/int lowS = 0, highS = 255;\n\t\/\/int lowV = 0, highV = 255;\n\n\t\/\/cvCreateTrackbar(\"LowH\", \"Control\", &lowH, 179);\n\t\/\/cvCreateTrackbar(\"HighH\", \"Control\", &highH, 179);\n\n\t\/\/cvCreateTrackbar(\"LowS\", \"Control\", &lowS, 255);\n\t\/\/cvCreateTrackbar(\"HighS\", \"Control\", &highS, 255);\n\n\t\/\/cvCreateTrackbar(\"LowV\", \"Control\", &lowV, 255);\n\t\/\/cvCreateTrackbar(\"HighV\", \"Control\", &highV, 255);\n\n\tnamedWindow(\"Thresholded Image\", CV_WINDOW_KEEPRATIO);\n\tnamedWindow(\"Orginal\", CV_WINDOW_KEEPRATIO);\n\tnamedWindow(\"Cut\", CV_WINDOW_KEEPRATIO);\n\tMat imgOrginal, imgHSV, imgThresholded, imgCut;\n\tMat se = getStructuringElement(MORPH_ELLIPSE, Size(5, 5));\n\twhile(true){\n\t\timgOrginal = imread(argv[1]);\n\t\tif(!imgOrginal.data){\n\t\t\tstd::cerr << \"could not read img!\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\tcvtColor(imgOrginal, imgHSV, COLOR_BGR2HSV);\n\t\t\/\/inRange(imgHSV, Scalar(lowH, lowS, lowV), Scalar(highH, highS, highV), imgThresholded);\n\t\tinRange(imgHSV, Scalar(0, 0, 0), Scalar(180, 170, 170), imgThresholded);\n\n\t\tmorphOps(imgThresholded, se);\n\t\t\n\t\t\/\/rectangle(imgOrginal, getRegionOfInterest(imgThresholded), cv::Scalar(0, 0, 255), 8);\n\t\timgOrginal(getRegionOfInterest(imgThresholded)).copyTo(imgCut);\n\t\timshow(\"Thresholded Image\", imgThresholded);\n\t\timshow(\"Orginal\", imgOrginal);\n\t\timshow(\"Cut\", imgCut);\n\n\t\tswitch(waitKey(10)){\n\t\t\tcase 27: \/\/ESC\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t\/\/do nothing\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>added tarckbars to control values<commit_after>#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <stdlib.h>\n#include <iostream>\n\nint lowH = 0, highH = 179;\nint lowS = 0, highS = 255;\nint lowV = 0, highV = 255;\n\ncv::Rect const getRegionOfInterest(cv::Mat const &imgThreshold){\n\tcv::Mat tmp;\n\timgThreshold.copyTo(tmp); \/\/ i don't know why this is necessary :(\n\tcv::Rect boundingRectangle;\n\tstd::vector<std::vector<cv::Point>> contours;\n\tcv::findContours(tmp, contours, CV_RETR_EXTERNAL, CV_CHAIN_APPROX_SIMPLE);\n\tif(contours.size() > 0){ \/\/found something\n\t\tint maxArea = 0;\n\t\tfor(unsigned int i = 0; i < contours.size(); i++){\n\t\t\tcv::Rect tmpRect = cv::boundingRect(contours[i]);\n\t\t\tif(tmpRect.area() > maxArea){\n\t\t\t\tboundingRectangle = tmpRect;\n\t\t\t\tmaxArea = tmpRect.area();\n\t\t\t}\n\t\t}\n\t}\n\treturn boundingRectangle;\n}\n\nvoid morphOps(cv::Mat &img, cv::Mat const &structuringElement){\n\t\/\/morphological opening (remove small objects from the foreground)\t\n\tcv::erode(img, img, structuringElement);\n\tcv::dilate(img, img, structuringElement);\n\t\/\/morphological closing (fill small holes in the foreground)\t\n\tcv::dilate(img, img, structuringElement);\n\tcv::erode(img, img, structuringElement);\n}\n\nvoid createControl(){\n\tcvCreateTrackbar(\"LowH\", \"Thresholded Image\", &lowH, 179);\n\tcvCreateTrackbar(\"HighH\", \"Thresholded Image\", &highH, 179);\n\n\tcvCreateTrackbar(\"LowS\", \"Thresholded Image\", &lowS, 255);\n\tcvCreateTrackbar(\"HighS\", \"Thresholded Image\", &highS, 255);\n\n\tcvCreateTrackbar(\"LowV\", \"Thresholded Image\", &lowV, 255);\n\tcvCreateTrackbar(\"HighV\", \"Thresholded Image\", &highV, 255);\n}\n\nint main(int argc, char* argv[]){\n\tusing namespace cv;\n\n\tif(argc != 2){\n\t\tstd::cerr << \"usage: .\/track_detection <filename>\" << std::endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/namedWindow(\"Control\", CV_WINDOW_AUTOSIZE);\n\n\tnamedWindow(\"Thresholded Image\", CV_WINDOW_KEEPRATIO);\n\tnamedWindow(\"Orginal\", CV_WINDOW_KEEPRATIO);\n\tnamedWindow(\"Cut\", CV_WINDOW_KEEPRATIO);\n\tnamedWindow(\"HSV\", CV_WINDOW_KEEPRATIO);\n\tcreateControl();\n\n\tMat imgOrginal, imgHSV, imgThresholded, imgCut;\n\tMat se = getStructuringElement(MORPH_ELLIPSE, Size(5, 5));\n\twhile(true){\n\t\timgOrginal = imread(argv[1]);\n\t\tif(!imgOrginal.data){\n\t\t\tstd::cerr << \"could not read img!\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\tcvtColor(imgOrginal, imgHSV, COLOR_BGR2HSV);\n\t\tinRange(imgHSV, Scalar(lowH, lowS, lowV), Scalar(highH, highS, highV), imgThresholded);\n\t\t\/\/inRange(imgHSV, Scalar(0, 0, 0), Scalar(180, 170, 170), imgThresholded);\n\n\t\tmorphOps(imgThresholded, se);\n\n\t\t\/\/rectangle(imgOrginal, getRegionOfInterest(imgThresholded), cv::Scalar(0, 0, 255), 8);\n\t\timgOrginal(getRegionOfInterest(imgThresholded)).copyTo(imgCut);\n\t\timshow(\"Thresholded Image\", imgThresholded);\n\t\timshow(\"Orginal\", imgOrginal);\n\t\timshow(\"Cut\", imgCut);\n\t\timshow(\"HSV\", imgHSV);\n\n\t\tswitch(waitKey(10)){\n\t\t\tcase 27: \/\/ESC\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t\/\/do nothing\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2013, Numenta, Inc.  Unless you have purchased from\n * Numenta, Inc. a separate commercial 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\n#include <iostream>\n\n#include <nta\/engine\/RegionImpl.hpp>\n#include <nta\/ntypes\/Buffer.hpp>\n#include <nta\/ntypes\/Array.hpp>\n#include <nta\/types\/BasicType.hpp>\n#include <nta\/engine\/Region.hpp>\n#include <nta\/engine\/Spec.hpp>\n#include <nta\/ntypes\/Dimensions.hpp>\n#include <nta\/ntypes\/BundleIO.hpp>\n#include <nta\/os\/FStream.hpp>\n\nnamespace nta\n{\n\nRegionImpl::RegionImpl(Region *region) : \n  region_(region)\n{\n}\n\nRegionImpl::~RegionImpl()\n{\n}\n\n\/\/ convenience method\nconst std::string& RegionImpl::getType() const\n{\n  return region_->getType();\n}\n\nconst std::string& RegionImpl::getName() const\n{ \n  return region_->getName();\n}\n\nconst NodeSet& RegionImpl::getEnabledNodes() const\n{\n  return region_->getEnabledNodes();\n}\n\n\n\/* ------------- Parameter support --------------- *\/\n\/\/ By default, all typed getParameter calls forward to the\n\/\/ untyped getParameter that serializes to a buffer\n\n\/\/ Use macros to implement these methods. \n\/\/ This is similar to a template + explicit instantiation, but\n\/\/ templated methods can't be virtual and thus can't be\n\/\/ overridden by subclasses. \n\n#define getParameterT(Type) \\\nType RegionImpl::getParameter##Type(const std::string& name, Int64 index) \\\n{\\\n  if (! region_->getSpec()->parameters.contains(name))     \\\n    NTA_THROW << \"getParameter\" #Type \": parameter \" << name << \" does not exist in nodespec\"; \\\n  ParameterSpec p = region_->getSpec()->parameters.getByName(name); \\\n  if (p.dataType != NTA_BasicType_ ## Type) \\\n    NTA_THROW << \"getParameter\" #Type \": parameter \" << name << \" is of type \" \\\n              << BasicType::getName(p.dataType) << \" not \" #Type; \\\n  WriteBuffer wb; \\\n  getParameterFromBuffer(name, index, wb); \\\n  ReadBuffer rb(wb.getData(), wb.getSize(), false \/* copy *\/); \\\n  Type val; \\\n  int rc = rb.read(val); \\\n  if (rc != 0)  \\\n  { \\\n    NTA_THROW << \"getParameter\" #Type \" -- failure to get parameter '\"  \\\n              << name << \"' on node of type \" << getType(); \\\n  } \\\n  return val; \\\n}\n\ngetParameterT(Int32);\ngetParameterT(UInt32);\ngetParameterT(Int64);\ngetParameterT(UInt64)\ngetParameterT(Real32);\ngetParameterT(Real64);\n\n\n#define setParameterT(Type) \\\nvoid RegionImpl::setParameter##Type(const std::string& name, Int64 index, Type value) \\\n{ \\\n  WriteBuffer wb; \\\n  wb.write((Type)value); \\\n  ReadBuffer rb(wb.getData(), wb.getSize(), false \/* copy *\/); \\\n  setParameterFromBuffer(name, index, rb); \\\n}\n\nsetParameterT(Int32);\nsetParameterT(UInt32);\nsetParameterT(Int64);\nsetParameterT(UInt64)\nsetParameterT(Real32);\nsetParameterT(Real64);\n\n\/\/ buffer mechanism can't handle Handles. RegionImpl must override these methods. \nHandle RegionImpl::getParameterHandle(const std::string& name, Int64 index)\n{\n  NTA_THROW << \"Unknown parameter '\"  << name << \"' of type Handle.\";\n}\n\nvoid RegionImpl::setParameterHandle(const std::string& name, Int64 index, Handle h)\n{\n  NTA_THROW << \"Unknown parameter '\"  << name << \"' of type Handle.\";\n}  \n\n\n\nvoid RegionImpl::getParameterArray(const std::string& name, Int64 index, Array & array)\n{\n  WriteBuffer wb;\n  getParameterFromBuffer(name, index, wb);\n  ReadBuffer rb(wb.getData(), wb.getSize(), false \/* copy *\/);\n  size_t count = array.getCount();\n  void *buffer = array.getBuffer();\n\n  for (size_t i = 0; i < count; i++)\n  { \n    int rc;\n    switch (array.getType())\n    {\n\n    case NTA_BasicType_Byte:\n      rc = rb.read(((Byte*)buffer)[i]);\n      break;\n    case NTA_BasicType_Int32:\n      rc = rb.read(((Int32*)buffer)[i]);\n      break;\n    case NTA_BasicType_UInt32:\n      rc = rb.read(((UInt32*)buffer)[i]);\n      break;\n    case NTA_BasicType_Int64:\n      rc = rb.read(((Int64*)buffer)[i]);\n      break;\n    case NTA_BasicType_UInt64:\n      rc = rb.read(((UInt64*)buffer)[i]);\n      break;\n    case NTA_BasicType_Real32:\n      rc = rb.read(((Real32*)buffer)[i]);\n      break;\n    case NTA_BasicType_Real64:\n      rc = rb.read(((Real64*)buffer)[i]);\n      break;\n    default:\n      NTA_THROW << \"Unsupported basic type \" << BasicType::getName(array.getType())\n                << \" in getParameterArray for parameter \" << name;\n      break;\n    }\n    \n    if (rc != 0)\n    {\n      NTA_THROW << \"getParameterArray -- failure to get parameter '\"\n                << name << \"' on node of type \" << getType();\n    }\n  }\n  return;\n}\n\n\nvoid RegionImpl::setParameterArray(const std::string& name, Int64 index,const Array & array)\n{\n  WriteBuffer wb;\n  size_t count = array.getCount();\n  void *buffer = array.getBuffer();\n  for (size_t i = 0; i < count; i++)\n  { \n    int rc;\n    switch (array.getType())\n    {\n\n    case NTA_BasicType_Byte:\n      rc = wb.write(((Byte*)buffer)[i]);\n      break;\n    case NTA_BasicType_Int32:\n      rc = wb.write(((Int32*)buffer)[i]);\n      break;\n    case NTA_BasicType_UInt32:\n      rc = wb.write(((UInt32*)buffer)[i]);\n      break;\n    case NTA_BasicType_Int64:\n      rc = wb.write(((Int64*)buffer)[i]);\n      break;\n    case NTA_BasicType_UInt64:\n      rc = wb.write(((UInt64*)buffer)[i]);\n      break;\n    case NTA_BasicType_Real32:\n      rc = wb.write(((Real32*)buffer)[i]);\n      break;\n    case NTA_BasicType_Real64:\n      rc = wb.write(((Real64*)buffer)[i]);\n      break;\n    default:\n      NTA_THROW << \"Unsupported basic type \" << BasicType::getName(array.getType())\n                << \" in setParameterArray for parameter \" << name;\n      break;\n    }\n  }\n\n  if (rc != 0)\n  {\n    NTA_THROW << \"getParameterArray -- failure to get parameter '\"\n              << name << \"' on node of type \" << getType();\n  }\n\n  ReadBuffer rb(wb.getData(), wb.getSize(), false);\n  setParameterFromBuffer(name, index, rb);\n}\n\n\nvoid RegionImpl::setParameterString(const std::string& name, Int64 index, const std::string& s)\n{\n  ReadBuffer rb(s.c_str(), s.size(), false);\n  setParameterFromBuffer(name, index, rb);\n}\n\nstd::string RegionImpl::getParameterString(const std::string& name, Int64 index)\n{\n  WriteBuffer wb;\n  getParameterFromBuffer(name, index, wb);\n  return std::string(wb.getData(), wb.getSize());\n}\n\n\n\/\/ Must be overridden by subclasses\nbool RegionImpl::isParameterShared(const std::string& name)\n{\n  NTA_THROW << \"RegionImpl::isParameterShared was not overridden in node type \" << getType();\n}\n\nvoid RegionImpl::getParameterFromBuffer(const std::string& name, \n                             Int64 index, \n                             IWriteBuffer& value)\n{\n  NTA_THROW << \"RegionImpl::getParameterFromBuffer must be overridden by subclasses\";\n}\n\nvoid RegionImpl::setParameterFromBuffer(const std::string& name, \n                          Int64 index,\n                          IReadBuffer& value)\n{\n  NTA_THROW << \"RegionImpl::setParameterFromBuffer must be overridden by subclasses\";\n}\n\n\n\nsize_t RegionImpl::getParameterArrayCount(const std::string& name, Int64 index)\n{\n  \/\/ Default implementation for RegionImpls with no array parameters\n  \/\/ that have a dynamic length. \n  \/\/std::map<std::string, ParameterSpec*>::iterator i = nodespec_->parameters.find(name);\n  \/\/if (i == nodespec_->parameters.end())\n\n  \n  if (!region_->getSpec()->parameters.contains(name))\n  {\n    NTA_THROW << \"getParameterArrayCount -- no parameter named '\" \n              << name << \"' in node of type \" << getType();\n  }\n  UInt32 count = region_->getSpec()->parameters.getByName(name).count;\n  if (count == 0)\n  {\n    NTA_THROW << \"Internal Error -- unknown element count for \"\n              << \"node type \" << getType() << \". The RegionImpl \"\n              << \"implementation should override this method.\";\n  }\n\n  return count;\n}\n\n\n\/\/ Provide data access for subclasses\n\nconst Input* RegionImpl::getInput(const std::string& name)\n{\n  return region_->getInput(name);\n}\n\nconst Output* RegionImpl::getOutput(const std::string& name)\n{\n  return region_->getOutput(name);\n}\n\nconst Dimensions& RegionImpl::getDimensions()\n{\n  return region_->getDimensions();\n}\n\n}\n\n<commit_msg>move rc check inside for loop<commit_after>\/*\n * ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2013, Numenta, Inc.  Unless you have purchased from\n * Numenta, Inc. a separate commercial 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\n#include <iostream>\n\n#include <nta\/engine\/RegionImpl.hpp>\n#include <nta\/ntypes\/Buffer.hpp>\n#include <nta\/ntypes\/Array.hpp>\n#include <nta\/types\/BasicType.hpp>\n#include <nta\/engine\/Region.hpp>\n#include <nta\/engine\/Spec.hpp>\n#include <nta\/ntypes\/Dimensions.hpp>\n#include <nta\/ntypes\/BundleIO.hpp>\n#include <nta\/os\/FStream.hpp>\n\nnamespace nta\n{\n\nRegionImpl::RegionImpl(Region *region) : \n  region_(region)\n{\n}\n\nRegionImpl::~RegionImpl()\n{\n}\n\n\/\/ convenience method\nconst std::string& RegionImpl::getType() const\n{\n  return region_->getType();\n}\n\nconst std::string& RegionImpl::getName() const\n{ \n  return region_->getName();\n}\n\nconst NodeSet& RegionImpl::getEnabledNodes() const\n{\n  return region_->getEnabledNodes();\n}\n\n\n\/* ------------- Parameter support --------------- *\/\n\/\/ By default, all typed getParameter calls forward to the\n\/\/ untyped getParameter that serializes to a buffer\n\n\/\/ Use macros to implement these methods. \n\/\/ This is similar to a template + explicit instantiation, but\n\/\/ templated methods can't be virtual and thus can't be\n\/\/ overridden by subclasses. \n\n#define getParameterT(Type) \\\nType RegionImpl::getParameter##Type(const std::string& name, Int64 index) \\\n{\\\n  if (! region_->getSpec()->parameters.contains(name))     \\\n    NTA_THROW << \"getParameter\" #Type \": parameter \" << name << \" does not exist in nodespec\"; \\\n  ParameterSpec p = region_->getSpec()->parameters.getByName(name); \\\n  if (p.dataType != NTA_BasicType_ ## Type) \\\n    NTA_THROW << \"getParameter\" #Type \": parameter \" << name << \" is of type \" \\\n              << BasicType::getName(p.dataType) << \" not \" #Type; \\\n  WriteBuffer wb; \\\n  getParameterFromBuffer(name, index, wb); \\\n  ReadBuffer rb(wb.getData(), wb.getSize(), false \/* copy *\/); \\\n  Type val; \\\n  int rc = rb.read(val); \\\n  if (rc != 0)  \\\n  { \\\n    NTA_THROW << \"getParameter\" #Type \" -- failure to get parameter '\"  \\\n              << name << \"' on node of type \" << getType(); \\\n  } \\\n  return val; \\\n}\n\ngetParameterT(Int32);\ngetParameterT(UInt32);\ngetParameterT(Int64);\ngetParameterT(UInt64)\ngetParameterT(Real32);\ngetParameterT(Real64);\n\n\n#define setParameterT(Type) \\\nvoid RegionImpl::setParameter##Type(const std::string& name, Int64 index, Type value) \\\n{ \\\n  WriteBuffer wb; \\\n  wb.write((Type)value); \\\n  ReadBuffer rb(wb.getData(), wb.getSize(), false \/* copy *\/); \\\n  setParameterFromBuffer(name, index, rb); \\\n}\n\nsetParameterT(Int32);\nsetParameterT(UInt32);\nsetParameterT(Int64);\nsetParameterT(UInt64)\nsetParameterT(Real32);\nsetParameterT(Real64);\n\n\/\/ buffer mechanism can't handle Handles. RegionImpl must override these methods. \nHandle RegionImpl::getParameterHandle(const std::string& name, Int64 index)\n{\n  NTA_THROW << \"Unknown parameter '\"  << name << \"' of type Handle.\";\n}\n\nvoid RegionImpl::setParameterHandle(const std::string& name, Int64 index, Handle h)\n{\n  NTA_THROW << \"Unknown parameter '\"  << name << \"' of type Handle.\";\n}  \n\n\n\nvoid RegionImpl::getParameterArray(const std::string& name, Int64 index, Array & array)\n{\n  WriteBuffer wb;\n  getParameterFromBuffer(name, index, wb);\n  ReadBuffer rb(wb.getData(), wb.getSize(), false \/* copy *\/);\n  size_t count = array.getCount();\n  void *buffer = array.getBuffer();\n\n  for (size_t i = 0; i < count; i++)\n  { \n    int rc;\n    switch (array.getType())\n    {\n\n    case NTA_BasicType_Byte:\n      rc = rb.read(((Byte*)buffer)[i]);\n      break;\n    case NTA_BasicType_Int32:\n      rc = rb.read(((Int32*)buffer)[i]);\n      break;\n    case NTA_BasicType_UInt32:\n      rc = rb.read(((UInt32*)buffer)[i]);\n      break;\n    case NTA_BasicType_Int64:\n      rc = rb.read(((Int64*)buffer)[i]);\n      break;\n    case NTA_BasicType_UInt64:\n      rc = rb.read(((UInt64*)buffer)[i]);\n      break;\n    case NTA_BasicType_Real32:\n      rc = rb.read(((Real32*)buffer)[i]);\n      break;\n    case NTA_BasicType_Real64:\n      rc = rb.read(((Real64*)buffer)[i]);\n      break;\n    default:\n      NTA_THROW << \"Unsupported basic type \" << BasicType::getName(array.getType())\n                << \" in getParameterArray for parameter \" << name;\n      break;\n    }\n    \n    if (rc != 0)\n    {\n      NTA_THROW << \"getParameterArray -- failure to get parameter '\"\n                << name << \"' on node of type \" << getType();\n    }\n  }\n  return;\n}\n\n\nvoid RegionImpl::setParameterArray(const std::string& name, Int64 index,const Array & array)\n{\n  WriteBuffer wb;\n  size_t count = array.getCount();\n  void *buffer = array.getBuffer();\n  for (size_t i = 0; i < count; i++)\n  { \n    int rc;\n    switch (array.getType())\n    {\n\n    case NTA_BasicType_Byte:\n      rc = wb.write(((Byte*)buffer)[i]);\n      break;\n    case NTA_BasicType_Int32:\n      rc = wb.write(((Int32*)buffer)[i]);\n      break;\n    case NTA_BasicType_UInt32:\n      rc = wb.write(((UInt32*)buffer)[i]);\n      break;\n    case NTA_BasicType_Int64:\n      rc = wb.write(((Int64*)buffer)[i]);\n      break;\n    case NTA_BasicType_UInt64:\n      rc = wb.write(((UInt64*)buffer)[i]);\n      break;\n    case NTA_BasicType_Real32:\n      rc = wb.write(((Real32*)buffer)[i]);\n      break;\n    case NTA_BasicType_Real64:\n      rc = wb.write(((Real64*)buffer)[i]);\n      break;\n    default:\n      NTA_THROW << \"Unsupported basic type \" << BasicType::getName(array.getType())\n                << \" in setParameterArray for parameter \" << name;\n      break;\n    }\n\n    if (rc != 0)\n    {\n      NTA_THROW << \"getParameterArray -- failure to get parameter '\"\n                << name << \"' on node of type \" << getType();\n    }\n  }\n\n  ReadBuffer rb(wb.getData(), wb.getSize(), false);\n  setParameterFromBuffer(name, index, rb);\n}\n\n\nvoid RegionImpl::setParameterString(const std::string& name, Int64 index, const std::string& s)\n{\n  ReadBuffer rb(s.c_str(), s.size(), false);\n  setParameterFromBuffer(name, index, rb);\n}\n\nstd::string RegionImpl::getParameterString(const std::string& name, Int64 index)\n{\n  WriteBuffer wb;\n  getParameterFromBuffer(name, index, wb);\n  return std::string(wb.getData(), wb.getSize());\n}\n\n\n\/\/ Must be overridden by subclasses\nbool RegionImpl::isParameterShared(const std::string& name)\n{\n  NTA_THROW << \"RegionImpl::isParameterShared was not overridden in node type \" << getType();\n}\n\nvoid RegionImpl::getParameterFromBuffer(const std::string& name, \n                             Int64 index, \n                             IWriteBuffer& value)\n{\n  NTA_THROW << \"RegionImpl::getParameterFromBuffer must be overridden by subclasses\";\n}\n\nvoid RegionImpl::setParameterFromBuffer(const std::string& name, \n                          Int64 index,\n                          IReadBuffer& value)\n{\n  NTA_THROW << \"RegionImpl::setParameterFromBuffer must be overridden by subclasses\";\n}\n\n\n\nsize_t RegionImpl::getParameterArrayCount(const std::string& name, Int64 index)\n{\n  \/\/ Default implementation for RegionImpls with no array parameters\n  \/\/ that have a dynamic length. \n  \/\/std::map<std::string, ParameterSpec*>::iterator i = nodespec_->parameters.find(name);\n  \/\/if (i == nodespec_->parameters.end())\n\n  \n  if (!region_->getSpec()->parameters.contains(name))\n  {\n    NTA_THROW << \"getParameterArrayCount -- no parameter named '\" \n              << name << \"' in node of type \" << getType();\n  }\n  UInt32 count = region_->getSpec()->parameters.getByName(name).count;\n  if (count == 0)\n  {\n    NTA_THROW << \"Internal Error -- unknown element count for \"\n              << \"node type \" << getType() << \". The RegionImpl \"\n              << \"implementation should override this method.\";\n  }\n\n  return count;\n}\n\n\n\/\/ Provide data access for subclasses\n\nconst Input* RegionImpl::getInput(const std::string& name)\n{\n  return region_->getInput(name);\n}\n\nconst Output* RegionImpl::getOutput(const std::string& name)\n{\n  return region_->getOutput(name);\n}\n\nconst Dimensions& RegionImpl::getDimensions()\n{\n  return region_->getDimensions();\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id: ClassTest_test.C,v 1.6 2001\/05\/07 00:10:38 oliver Exp $\n#include <BALL\/CONCEPT\/classTest.h>\n\nusing namespace BALL;\n\nSTART_TEST(ClassTest, \"$Id: ClassTest_test.C,v 1.6 2001\/05\/07 00:10:38 oliver Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\nCHECK(\"CHECK(string)\")\nRESULT\n\nCHECK(\"RESULT\")\nRESULT\n\nCHECK(\"NEW_TMP_FILE(filename)\")\n\tString tmp_filename;\n\tNEW_TMP_FILE(tmp_filename);\n\tTEST::this_test = (tmp_filename != \"\");\nRESULT\n\n\nCHECK(\"PRECISION(a)\")\n\tPRECISION(0.5)\n\tTEST_EQUAL(TEST::precision, 0.5)\nRESULT\n\nCHECK(\"TEST_REAL_EQUAL(a, b)\")\n\tPRECISION(0.011)\n\tTEST_REAL_EQUAL(1.0, 1.01)\n\tTEST_REAL_EQUAL(1.0, 1.0)\n\tTEST_REAL_EQUAL(-1.0, -1.01)\n\tTEST_REAL_EQUAL(-1.01, -1.0)\nRESULT\n\nCHECK(\"TEST_EQUAL(a, b)\")\n\tTEST_EQUAL(1.0, 1.0)\n\tTEST_EQUAL('A', 'A')\nRESULT\n\nCHECK(\"TEST_NOT_EQUAL(a, b)\")\n\tTEST_NOT_EQUAL(0, 1)\n\tTEST_NOT_EQUAL('A', 'B')\nRESULT\n\nCHECK(\"TEST_EXCEPTION(a, b)\")\n\tTEST_EXCEPTION(Exception::NullPointer, throw Exception::NullPointer(__FILE__, __LINE__))\nRESULT\n\nCHECK(\"STATUS(a)\")\n\tSTATUS(\"status message\")\nRESULT\n\nCHECK(\"TEST_FILE(filename, templatename, use_regexps)\")\n\tTEST_FILE(\"data\/class_test_infile.txt\", \"data\/class_test_template.txt\", false)\n\tTEST_FILE(\"data\/class_test_infile.txt\", \"data\/class_test_regexp_template.txt\", true)\nRESULT\n\nCHECK(\"CAPTURE_OUTPUT(level)\/COMPARE_OUTPUT(text)\")\n\tCAPTURE_OUTPUT(123)\n\t\tLog.level(123) << \"TEST123\" << std::endl;\n\t\tLog.level(124) << \"TEST124\" << std::endl;\n\t\tLog.level(122) << \"TEST122\" << std::endl;\n\tCOMPARE_OUTPUT(\"TEST123\\n\")\n\n\tCAPTURE_OUTPUT(123);\n\t\tLog.level(124) << \"TEST124\" << std::endl;\n\tCOMPARE_OUTPUT(\"\")\n\n\tCAPTURE_OUTPUT(124)\n\t\tLog.level(124) << \"TEST124\" << std::endl;\n\tCOMPARE_OUTPUT(\"TEST124\\n\")\nRESULT\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<commit_msg>added: test foir ABORT_IF macro<commit_after>\/\/ $Id: ClassTest_test.C,v 1.7 2001\/12\/07 00:47:07 oliver Exp $\n#include <BALL\/CONCEPT\/classTest.h>\n\nusing namespace BALL;\n\nSTART_TEST(ClassTest, \"$Id: ClassTest_test.C,v 1.7 2001\/12\/07 00:47:07 oliver Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\nCHECK(\"CHECK(string)\")\nRESULT\n\nCHECK(\"RESULT\")\nRESULT\n\nCHECK(\"NEW_TMP_FILE(filename)\")\n\tString tmp_filename;\n\tNEW_TMP_FILE(tmp_filename);\n\tTEST::this_test = (tmp_filename != \"\");\nRESULT\n\n\nCHECK(\"PRECISION(a)\")\n\tPRECISION(0.5)\n\tTEST_EQUAL(TEST::precision, 0.5)\nRESULT\n\nCHECK(\"TEST_REAL_EQUAL(a, b)\")\n\tPRECISION(0.011)\n\tTEST_REAL_EQUAL(1.0, 1.01)\n\tTEST_REAL_EQUAL(1.0, 1.0)\n\tTEST_REAL_EQUAL(-1.0, -1.01)\n\tTEST_REAL_EQUAL(-1.01, -1.0)\nRESULT\n\nCHECK(\"TEST_EQUAL(a, b)\")\n\tTEST_EQUAL(1.0, 1.0)\n\tTEST_EQUAL('A', 'A')\nRESULT\n\nCHECK(\"TEST_NOT_EQUAL(a, b)\")\n\tTEST_NOT_EQUAL(0, 1)\n\tTEST_NOT_EQUAL('A', 'B')\nRESULT\n\nCHECK(\"TEST_EXCEPTION(a, b)\")\n\tTEST_EXCEPTION(Exception::NullPointer, throw Exception::NullPointer(__FILE__, __LINE__))\nRESULT\n\nCHECK(\"STATUS(a)\")\n\tSTATUS(\"status message\")\nRESULT\n\nCHECK(\"TEST_FILE(filename, templatename, use_regexps)\")\n\tTEST_FILE(\"data\/class_test_infile.txt\", \"data\/class_test_template.txt\", false)\n\tTEST_FILE(\"data\/class_test_infile.txt\", \"data\/class_test_regexp_template.txt\", true)\nRESULT\n\nCHECK(\"ABORT_IF(condition)\")\n\tABORT_IF(true)\n\tTEST_EQUAL(1, 0)\nRESULT\n\nCHECK(\"CAPTURE_OUTPUT(level)\/COMPARE_OUTPUT(text)\")\n\tCAPTURE_OUTPUT(123)\n\t\tLog.level(123) << \"TEST123\" << std::endl;\n\t\tLog.level(124) << \"TEST124\" << std::endl;\n\t\tLog.level(122) << \"TEST122\" << std::endl;\n\tCOMPARE_OUTPUT(\"TEST123\\n\")\n\n\tCAPTURE_OUTPUT(123);\n\t\tLog.level(124) << \"TEST124\" << std::endl;\n\tCOMPARE_OUTPUT(\"\")\n\n\tCAPTURE_OUTPUT(124)\n\t\tLog.level(124) << \"TEST124\" << std::endl;\n\tCOMPARE_OUTPUT(\"TEST124\\n\")\nRESULT\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<|endoftext|>"}
{"text":"<commit_before>\/\/ __BEGIN_LICENSE__\n\/\/ Copyright (C) 2006-2009 United States Government as represented by\n\/\/ the Administrator of the National Aeronautics and Space Administration.\n\/\/ All Rights Reserved.\n\/\/ __END_LICENSE__\n\n\n\/\/ boost\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/filesystem\/convenience.hpp>\nnamespace po = boost::program_options;\nnamespace fs = boost::filesystem;\n\n\/\/ standard\n#include <vector>\n#include <iostream>\n\n\/\/ VisionWorkbench\n#include <vw\/Math.h>\n#include <vw\/Camera\/ControlNetwork.h>\n#include <vw\/InterestPoint\/InterestData.h>\n\nusing namespace vw;\nusing namespace vw::ip;\nusing namespace vw::camera;\n\n#if VW_BOOST_VERSION < 103400\nstd::istream& operator>>(std::istream& is, fs::path& p) {\n    std::string s;\n    is >> s;\n    p = s;\n    return is;\n}\n#endif\n\n\/\/ Main Executable\nint main( int argc, char *argv[] ) {\n  std::string cnet_file;\n  std::string image_mean_file;\n  fs::path output_cnet_file;\n  fs::path output_deleted_index_file;\n  ControlNetwork cnet(\"ControlNetwork Editor\");\n  double cutoff_sigma;\n  std::string output_cnet_file_tmp;\n  std::string output_deleted_index_file_tmp;\n  std::string data_dir;\n\n  po::options_description general_options(\"Options\");\n  general_options.add_options()\n    (\"cutoff_sigma,c\", po::value<double>(&cutoff_sigma)->default_value(2),\"This is the highend cutoff sigma.\")\n    (\"output_cnet_file,o\", po::value<std::string>(&output_cnet_file_tmp)->default_value(\"processed.cnet\"), \"Name of processed control network file to write out.\")\n    (\"output_deleted_index_file,o\", po::value<std::string>(&output_deleted_index_file_tmp)->default_value(\"cnet_deleted.txt\"), \"Name of file of indexes to deleted control points to write out.\")\n    (\"data_dir,d\",po::value<std::string>(&data_dir)->default_value(\".\"), \"Name of directory to write output files into.\")\n    (\"help,h\",\"Brings up this.\");\n\n  po::options_description positional_options(\"Positional Options\");\n  positional_options.add_options()\n    (\"cnet\", po::value<std::string>(&cnet_file), \"Control Network\")\n    (\"image-mean\", po::value<std::string>(&image_mean_file), \"Image Mean file\");\n\n  po::positional_options_description positional_options_desc;\n  positional_options_desc.add(\"cnet\", 1);\n  positional_options_desc.add(\"image-mean\",1);\n\n  po::options_description all_options(\"Allowed Options\");\n  all_options.add(general_options).add(positional_options);\n\n  po::variables_map vm;\n  po::store( po::command_line_parser( argc, argv ).options(all_options).positional(positional_options_desc).run(), vm );\n  po::notify( vm );\n\n  std::ostringstream usage;\n  usage << \"Usage: \" << argv[0] << \" [options] <cnet> <image-mean>\\n\\n\";\n  usage << general_options << std::endl;\n\n  if ( vm.count(\"help\") ||\n       !vm.count(\"cnet\") ||\n       !vm.count(\"image-mean\") ) {\n    vw_out() << usage.str() << std::endl;\n    return 1;\n  }\n\n  output_cnet_file = output_cnet_file_tmp;\n  output_deleted_index_file = output_deleted_index_file_tmp;\n\n  \/\/ Loading control network file\n  std::vector<std::string> tokens;\n  boost::split( tokens, cnet_file, boost::is_any_of(\".\") );\n  if ( tokens[tokens.size()-1] == \"net\" ) {\n    cnet.read_isis( cnet_file );\n  } else if ( tokens[tokens.size()-1] == \"cnet\" ) {\n    cnet.read_binary( cnet_file );\n  } else {\n    vw_throw( IOErr() << \"Unknown Control Network file extension, \\\"\"\n                << tokens[tokens.size()-1] << \"\\\".\" );\n  }\n\n  \/\/ Alright loading image mean file\n  std::ifstream f;\n  f.open( image_mean_file.c_str(), std::ios::binary | std::ios::in );\n  unsigned read_cnet_size;\n  f.read((char*)&(read_cnet_size), sizeof(unsigned));\n  if ( read_cnet_size != cnet.size() )\n    vw_throw( IOErr() << \"Image mean file doesn't seem to match Cnet\" );\n  unsigned error_size;\n  std::list<double> image_errors;\n  f.read((char*)&(error_size), sizeof(unsigned));\n\n  for ( uint i = 0; i < error_size; i++ ) {\n    double temp;\n    f.read((char*)&(temp), sizeof(double));\n    image_errors.push_back(temp);\n  }\n\n  \/\/ Collecting statistics\n  double min_image = *(std::min_element(image_errors.begin(),\n                                       image_errors.end()));\n  double max_image = *(std::max_element(image_errors.begin(),\n                                        image_errors.end()));\n  double mean_image=0, stddev_image=0;\n  for( std::list<double>::iterator it = image_errors.begin();\n       it != image_errors.end(); it++ ) {\n    mean_image += (*it);\n    stddev_image += (*it)*(*it);\n  }\n  mean_image \/= error_size;\n  stddev_image \/=  error_size;\n  stddev_image = sqrt( stddev_image - mean_image*mean_image );\n  vw_out() << \"Image min: \" << min_image << \" max: \" << max_image\n            << \" mean: \" << mean_image << \" stddev: \" << stddev_image\n            << std::endl;\n\n  \/\/ Awesome, now clipping based one std_dev\n  int clipping_count = 0;\n  int other_count = 0;\n  int cp_clip_count = 0;\n  std::list<double>::iterator image_error = image_errors.begin();\n  std::vector<bool> deleted(cnet.size(), false);\n  int del_i = 0;\n  for ( unsigned cpi = 0; cpi < cnet.size(); cpi++, del_i++ ) {\n    for ( unsigned cmi = 0; cmi < cnet[cpi].size(); cmi++ ) {\n      if ( image_error == image_errors.end() )\n        vw_throw( IOErr() << \"Internal overflow error\" );\n\n      \/\/ Do clipping\n      if ( *image_error >= mean_image + stddev_image*cutoff_sigma ) {\n        clipping_count++;\n\n        cnet[cpi].delete_measure( cmi );\n        cmi--;\n      } else\n        other_count++;\n\n      image_error++;\n    }\n\n    if ( cnet[cpi].size() < 2 ) {\n      cnet.delete_control_point( cpi );\n      cpi--;\n      cp_clip_count++;\n      deleted[del_i] = true;\n    }\n  }\n  vw_out() << float(clipping_count) * 100.0 \/ float(clipping_count + other_count)\n            << \"% (\" << clipping_count << \") of the control measures removed.\\n\";\n  vw_out() << float(cp_clip_count) * 100.0 \/ float(cp_clip_count+cnet.size())\n            << \"% (\" << cp_clip_count << \") of control points removed.\\n\";\n\n  vw_out() << \"\\nWriting out new control network\\n\";\n  std::string outfile_str = fs::path(data_dir \/ output_cnet_file.branch_path() \/ fs::basename(output_cnet_file)).string();\n  cnet.write_binary(outfile_str);\n\n  vw_out() << \"\\nWriting deleted index file\\n\";\n  std::string delindex_file_str = fs::path(data_dir \/ output_deleted_index_file.branch_path() \/ fs::basename(output_deleted_index_file)).string();\n\n  std::ofstream di_out(delindex_file_str.c_str());\n  for ( uint i = 0; i < deleted.size()-1; i++) \n    di_out << deleted[i] << \" \";\n  di_out << deleted[deleted.size()-1] << \"\\n\";\n  di_out.close();\n}\n<commit_msg>Fix so cnet can actually output new control network<commit_after>\/\/ __BEGIN_LICENSE__\n\/\/ Copyright (C) 2006-2009 United States Government as represented by\n\/\/ the Administrator of the National Aeronautics and Space Administration.\n\/\/ All Rights Reserved.\n\/\/ __END_LICENSE__\n\n\n\/\/ boost\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/filesystem\/convenience.hpp>\nnamespace po = boost::program_options;\nnamespace fs = boost::filesystem;\n\n\/\/ standard\n#include <vector>\n#include <iostream>\n\n\/\/ VisionWorkbench\n#include <vw\/Math.h>\n#include <vw\/Camera\/ControlNetwork.h>\n#include <vw\/InterestPoint\/InterestData.h>\n\nusing namespace vw;\nusing namespace vw::ip;\nusing namespace vw::camera;\n\n#if VW_BOOST_VERSION < 103400\nstd::istream& operator>>(std::istream& is, fs::path& p) {\n    std::string s;\n    is >> s;\n    p = s;\n    return is;\n}\n#endif\n\n\/\/ Main Executable\nint main( int argc, char *argv[] ) {\n  std::string cnet_file;\n  std::string image_mean_file;\n  fs::path output_cnet_file;\n  fs::path output_deleted_index_file;\n  ControlNetwork cnet(\"ControlNetwork Editor\");\n  double cutoff_sigma;\n  std::string output_cnet_file_tmp;\n  std::string output_deleted_index_file_tmp;\n  std::string data_dir;\n\n  po::options_description general_options(\"Options\");\n  general_options.add_options()\n    (\"cutoff_sigma,c\", po::value<double>(&cutoff_sigma)->default_value(2),\"This is the highend cutoff sigma.\")\n    (\"output_cnet_file,o\", po::value<std::string>(&output_cnet_file_tmp)->default_value(\"processed.cnet\"), \"Name of processed control network file to write out.\")\n    (\"output_deleted_index_file,o\", po::value<std::string>(&output_deleted_index_file_tmp)->default_value(\"cnet_deleted.txt\"), \"Name of file of indexes to deleted control points to write out.\")\n    (\"data_dir,d\",po::value<std::string>(&data_dir)->default_value(\".\"), \"Name of directory to write output files into.\")\n    (\"help,h\",\"Brings up this.\");\n\n  po::options_description positional_options(\"Positional Options\");\n  positional_options.add_options()\n    (\"cnet\", po::value<std::string>(&cnet_file), \"Control Network\")\n    (\"image-mean\", po::value<std::string>(&image_mean_file), \"Image Mean file\");\n\n  po::positional_options_description positional_options_desc;\n  positional_options_desc.add(\"cnet\", 1);\n  positional_options_desc.add(\"image-mean\",1);\n\n  po::options_description all_options(\"Allowed Options\");\n  all_options.add(general_options).add(positional_options);\n\n  po::variables_map vm;\n  po::store( po::command_line_parser( argc, argv ).options(all_options).positional(positional_options_desc).run(), vm );\n  po::notify( vm );\n\n  std::ostringstream usage;\n  usage << \"Usage: \" << argv[0] << \" [options] <cnet> <image-mean>\\n\\n\";\n  usage << general_options << std::endl;\n\n  if ( vm.count(\"help\") ||\n       !vm.count(\"cnet\") ||\n       !vm.count(\"image-mean\") ) {\n    vw_out() << usage.str() << std::endl;\n    return 1;\n  }\n\n  output_cnet_file = output_cnet_file_tmp;\n  output_deleted_index_file = output_deleted_index_file_tmp;\n\n  \/\/ Loading control network file\n  std::vector<std::string> tokens;\n  boost::split( tokens, cnet_file, boost::is_any_of(\".\") );\n  if ( tokens[tokens.size()-1] == \"net\" ) {\n    cnet.read_isis( cnet_file );\n  } else if ( tokens[tokens.size()-1] == \"cnet\" ) {\n    cnet.read_binary( cnet_file );\n  } else {\n    vw_throw( IOErr() << \"Unknown Control Network file extension, \\\"\"\n                << tokens[tokens.size()-1] << \"\\\".\" );\n  }\n\n  \/\/ Alright loading image mean file\n  std::ifstream f;\n  f.open( image_mean_file.c_str(), std::ios::binary | std::ios::in );\n  unsigned read_cnet_size;\n  f.read((char*)&(read_cnet_size), sizeof(unsigned));\n  if ( read_cnet_size != cnet.size() )\n    vw_throw( IOErr() << \"Image mean file doesn't seem to match Cnet\" );\n  unsigned error_size;\n  std::list<double> image_errors;\n  f.read((char*)&(error_size), sizeof(unsigned));\n\n  for ( uint i = 0; i < error_size; i++ ) {\n    double temp;\n    f.read((char*)&(temp), sizeof(double));\n    image_errors.push_back(temp);\n  }\n\n  \/\/ Collecting statistics\n  double min_image = *(std::min_element(image_errors.begin(),\n                                       image_errors.end()));\n  double max_image = *(std::max_element(image_errors.begin(),\n                                        image_errors.end()));\n  double mean_image=0, stddev_image=0;\n  for( std::list<double>::iterator it = image_errors.begin();\n       it != image_errors.end(); it++ ) {\n    mean_image += (*it);\n    stddev_image += (*it)*(*it);\n  }\n  mean_image \/= error_size;\n  stddev_image \/=  error_size;\n  stddev_image = sqrt( stddev_image - mean_image*mean_image );\n  vw_out() << \"Image min: \" << min_image << \" max: \" << max_image\n            << \" mean: \" << mean_image << \" stddev: \" << stddev_image\n            << std::endl;\n\n  \/\/ Awesome, now clipping based one std_dev\n  int clipping_count = 0;\n  int other_count = 0;\n  int cp_clip_count = 0;\n  std::list<double>::iterator image_error = image_errors.begin();\n  std::vector<bool> deleted(cnet.size(), false);\n  int del_i = 0;\n  for ( unsigned cpi = 0; cpi < cnet.size(); cpi++, del_i++ ) {\n    for ( unsigned cmi = 0; cmi < cnet[cpi].size(); cmi++ ) {\n      if ( image_error == image_errors.end() )\n        vw_throw( IOErr() << \"Internal overflow error\" );\n\n      \/\/ Do clipping\n      if ( *image_error >= mean_image + stddev_image*cutoff_sigma ) {\n        clipping_count++;\n\n        cnet[cpi].delete_measure( cmi );\n        cmi--;\n      } else\n        other_count++;\n\n      image_error++;\n    }\n\n    if ( cnet[cpi].size() < 2 ) {\n      cnet.delete_control_point( cpi );\n      cpi--;\n      cp_clip_count++;\n      deleted[del_i] = true;\n    }\n  }\n  vw_out() << float(clipping_count) * 100.0 \/ float(clipping_count + other_count)\n            << \"% (\" << clipping_count << \") of the control measures removed.\\n\";\n  vw_out() << float(cp_clip_count) * 100.0 \/ float(cp_clip_count+cnet.size())\n            << \"% (\" << cp_clip_count << \") of control points removed.\\n\";\n\n  vw_out() << \"\\nWriting out new control network\\n\";\n  std::string outfile_str = fs::path(data_dir \/ output_cnet_file ).string();\n  vw_out() << \"\\tfile: \" << outfile_str << \"\\n\";\n  cnet.write_binary(outfile_str);\n\n  vw_out() << \"\\nWriting deleted index file\\n\";\n  std::string delindex_file_str = fs::path(data_dir \/ output_deleted_index_file ).string();\n  vw_out() << \"\\tfile: \" << delindex_file_str << \"\\n\";\n\n  std::ofstream di_out(delindex_file_str.c_str());\n  for ( uint i = 0; i < deleted.size()-1; i++) \n    di_out << deleted[i] << \" \";\n  di_out << deleted[deleted.size()-1] << \"\\n\";\n  di_out.close();\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ARC_STL_WRAPPERS\n#define ARC_STL_WRAPPERS\n\n#include <algorithm>\n\nnamespace arc_std{\n\n    \/**\n     *  Returns the index of element in vector v\n     *   or returns -1 of element is not in v\n     *\/\n    template<typename T>\n    inline int find(const std::vector<T>& v, const T& element)\n    {\n        auto it = std::find(v.begin(), v.end(), element);\n        if(it == v.end())\n        {\n            return -1;\n        }\n        return std::distance(v.begin(), it);\n    }\n}\n\n\n\n\n\n#endif \/\/ARC_STL_WRAPPERS\n<commit_msg>Made  const<commit_after>#ifndef ARC_STL_WRAPPERS\n#define ARC_STL_WRAPPERS\n\n#include <algorithm>\n\nnamespace arc_std{\n\n    \/**\n     *  Returns the index of element in vector v\n     *   or returns -1 of element is not in v\n     *\/\n    template<typename T>\n    inline int find(const std::vector<T>& v, const T& element)\n    {\n        const auto it = std::find(v.begin(), v.end(), element);\n        if(it == v.end())\n        {\n            return -1;\n        }\n        return std::distance(v.begin(), it);\n    }\n}\n\n\n\n\n\n#endif \/\/ARC_STL_WRAPPERS\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ASMITH_SERIALISER_HPP\n#define ASMITH_SERIALISER_HPP\n\n\/\/ Copyright 2017 Adam Smith\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <deque>\n#include <list>\n#include \"serial_value.hpp\"\n\nnamespace as {\n\n\ttemplate<class T, class ENABLE = void>\n\tstruct serialiser {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t);\n\t\tstatic deserialise_t deserialise(const serial_value&);\n\t};\n\n\t\/\/ -- Helper functions\n\n\ttemplate<class T, class ENABLE = void>\n\tstruct string_serialiser {\n\t\ttypedef typename serialiser<T>::serialise_t serialise_t;\n\t\ttypedef typename serialiser<T>::deserialise_t deserialise_t;\n\n\t\tstatic serial_value::string_t serialise(serialise_t);\n\t\tstatic deserialise_t deserialise(const serial_value::string_t&);\n\t};\n\n\t\/\/ -- Helper Specialisations\n\n\ttemplate<class T>\n\tstruct string_serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, uint8_t>::value ||\n\t\tstd::is_same<T, uint16_t>::value ||\n\t\tstd::is_same<T, uint32_t>::value ||\n\t\tstd::is_same<T, uint64_t>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\t\tenum{ CONVERTABLE = 0 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn std::to_string(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn static_cast<T>(std::stoull(aValue));\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct string_serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, int8_t>::value ||\n\t\tstd::is_same<T, int16_t>::value ||\n\t\tstd::is_same<T, int32_t>::value ||\n\t\tstd::is_same<T, int64_t>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn std::to_string(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn static_cast<T>(std::stoll(aValue));\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct string_serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, float>::value ||\n\t\tstd::is_same<T, double>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn std::to_string(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn static_cast<T>(std::stod(aValue));\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct string_serialiser<char, void> {\n\t\ttypedef char serialise_t;\n\t\ttypedef char deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn serial_value::string_t() + aValue;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn aValue[0];\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct string_serialiser<bool, void> {\n\t\ttypedef bool serialise_t;\n\t\ttypedef bool deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn aValue ? \"true\" : \"false\";\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\tif(aValue == \"true\") {\n\t\t\t\treturn true;\n\t\t\t}else if (aValue == \"false\") {\n\t\t\t\treturn false;\n\t\t\t}else {\n\t\t\t\tthrow std::runtime_error(\"as::string_serialiser::deserialise : String cannot be converted to bool\");\n\t\t\t}\n\t\t}\n\t};\n\n\n\ttemplate<>\n\tstruct string_serialiser<serial_value::string_t, void> {\n\t\ttypedef const serial_value::string_t& serialise_t;\n\t\ttypedef const serial_value::string_t& deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn aValue;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn aValue;\n\t\t}\n\t};\n\n\t\/\/ -- Serialiser Specialisations\n\n\ttemplate<>\n\tstruct serialiser<char, void> {\n\t\ttypedef char serialise_t;\n\t\ttypedef char deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn aValue.get_char();\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct serialiser<bool, void> {\n\t\ttypedef bool serialise_t;\n\t\ttypedef bool deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn aValue.get_bool();\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, uint8_t>::value ||\n\t\tstd::is_same<T, uint16_t>::value ||\n\t\tstd::is_same<T, uint32_t>::value ||\n\t\tstd::is_same<T, uint64_t>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn static_cast<deserialise_t>(aValue.get_unsigned());\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, int8_t>::value ||\n\t\tstd::is_same<T, int16_t>::value ||\n\t\tstd::is_same<T, int32_t>::value ||\n\t\tstd::is_same<T, int64_t>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn static_cast<deserialise_t>(aValue.get_signed());\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, float>::value ||\n\t\tstd::is_same<T, double>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn static_cast<deserialise_t>(aValue.get_float());\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct serialiser<std::string, void> {\n\t\ttypedef const std::string& serialise_t;\n\t\ttypedef std::string deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn aValue.get_string();\n\t\t}\n\t};\n\n\t\/\/ -- Container specialisations\n\n\ttemplate<class T>\n\tstruct serialiser<std::vector<T>, void> {\n\t\ttypedef const std::vector<T>& serialise_t;\n\t\ttypedef std::vector<T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::vector<serial_value>& values = tmp.set_array();\n\t\t\tfor(const T& i : aValue) values.push_back(serialiser<T>::serialise(i));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::vector<serial_value>& values = aValue.get_array();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const serial_value& i : values) tmp.push_back(serialiser<T>::deserialise(i));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<std::deque<T>, void> {\n\t\ttypedef const std::deque<T>& serialise_t;\n\t\ttypedef std::vector<T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::vector<serial_value>& values = tmp.set_array();\n\t\t\tfor(const T& i : aValue) values.push_back(serialiser<T>::serialise(i));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::vector<serial_value>& values = aValue.get_array();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const serial_value& i : values) tmp.push_back(serialiser<T>::deserialise(i));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<std::list<T>, void> {\n\t\ttypedef const std::list<T>& serialise_t;\n\t\ttypedef std::list<T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::vector<serial_value>& values = tmp.set_array();\n\t\t\tfor(const T& i : aValue) values.push_back(serialiser<T>::serialise(i));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::vector<serial_value>& values = aValue.get_array();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const serial_value& i : values) tmp.push_back(serialiser<T>::deserialise(i));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<std::map<std::string,T>, void> {\n\t\ttypedef const std::map<std::string,T>& serialise_t;\n\t\ttypedef std::map<std::string,T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::map<serial_value::string_t,serial_value>& values = tmp.set_object();\n\t\t\tfor(const auto& i : aValue) values.emplace(i.first, serialiser<T>::serialise(i.second));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::map<serial_value::string_t, serial_value>& values = aValue.get_object();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const auto& i : values) tmp.emplace(i.first, serialiser<T>::deserialise(i.second));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<std::map<char, T>, void> {\n\t\ttypedef const std::map<char, T>& serialise_t;\n\t\ttypedef std::map<char, T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tserial_value::object_t& values = tmp.set_object();\n\t\t\tfor(const auto& i : aValue) values.emplace(serial_value::string_t() + i.first, serialiser<T>::serialise(i.second));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst serial_value::object_t& values = aValue.get_object();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const auto& i : values) tmp.emplace(i.first[0], serialiser<T>::deserialise(i.second));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class K, class T>\n\tstruct serialiser<std::map<K,T>, typename std::enable_if<\n\t\tstd::is_same<T, uint8_t>::value ||\n\t\tstd::is_same<T, uint16_t>::value ||\n\t\tstd::is_same<T, uint32_t>::value ||\n\t\tstd::is_same<T, uint64_t>::value ||\n\t\tstd::is_same<T, int8_t>::value ||\n\t\tstd::is_same<T, int16_t>::value ||\n\t\tstd::is_same<T, int32_t>::value ||\n\t\tstd::is_same<T, int64_t>::value ||\n\t\tstd::is_same<T, float>::value ||\n\t\tstd::is_same<T, double>::value\n\t>::type> {\n\t\ttypedef const std::map<K,T>& serialise_t;\n\t\ttypedef std::map<K,T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tserial_value::object_t& values = tmp.set_object();\n\t\t\tfor(const auto& i : aValue) values.emplace(std::to_string(i.first), serialiser<T>::serialise(i.second));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst serial_value::object_t& values = aValue.get_object();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const auto& i : values) tmp.emplace(static_cast<K>(std::stod(i.first)), serialiser<T>::deserialise(i.second));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class K, class T>\n\tstruct serialiser<std::map<K,T>, void> {\n\t\ttypedef const std::map<K,T>& serialise_t;\n\t\ttypedef std::map<K,T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::map<serial_value::string_t, serial_value>& parent = tmp.set_object();\n\t\t\tparent.emplace(\"keys\", serial_value());\n\t\t\tparent.emplace(\"values\", serial_value());\n\t\t\tstd::vector<serial_value>& keys = parent.find(\"keys\")->second.set_array();\n\t\t\tstd::vector<serial_value>& values = parent.find(\"values\")->second.set_array();\n\n\t\t\tfor(const auto& i : aValue) {\n\t\t\t\tkeys.push_back(serialiser<K>::serialise(i.first));\n\t\t\t\tvalues.push_back(serialiser<T>::serialise(i.second));\n\t\t\t}\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::vector<serial_value>& keys = aValue[\"keys\"].get_array();\n\t\t\tconst std::vector<serial_value>& values = aValue[\"values\"].get_array();\n\t\t\tconst size_t size = keys.size();\n\t\t\tdeserialise_t tmp;\n\n\t\t\tfor(size_t i = 0; i < size; ++i) {\n\t\t\t\ttmp.emplace(\n\t\t\t\t\tserialiser<K>::deserialise(keys[i]),\n\t\t\t\t\tserialiser<T>::deserialise(values[i])\n\t\t\t\t);\n\t\t\t}\n\n\t\t\treturn tmp;\n\t\t}\n\t};\n}\n\n#endif<commit_msg>Simplified map key serialisation<commit_after>#ifndef ASMITH_SERIALISER_HPP\n#define ASMITH_SERIALISER_HPP\n\n\/\/ Copyright 2017 Adam Smith\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <deque>\n#include <list>\n#include \"serial_value.hpp\"\n\nnamespace as {\n\n\ttemplate<class T, class ENABLE = void>\n\tstruct serialiser {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t);\n\t\tstatic deserialise_t deserialise(const serial_value&);\n\t};\n\n\t\/\/ -- Helper functions\n\n\ttemplate<class T, class ENABLE = void>\n\tstruct string_serialiser {\n\t\ttypedef typename serialiser<T>::serialise_t serialise_t;\n\t\ttypedef typename serialiser<T>::deserialise_t deserialise_t;\n\n\t\tstatic serial_value::string_t serialise(serialise_t);\n\t\tstatic deserialise_t deserialise(const serial_value::string_t&);\n\t};\n\n\t\/\/ -- Helper Specialisations\n\n\ttemplate<class T>\n\tstruct string_serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, uint8_t>::value ||\n\t\tstd::is_same<T, uint16_t>::value ||\n\t\tstd::is_same<T, uint32_t>::value ||\n\t\tstd::is_same<T, uint64_t>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\t\tenum{ CONVERTABLE = 0 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn std::to_string(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn static_cast<T>(std::stoull(aValue));\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct string_serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, int8_t>::value ||\n\t\tstd::is_same<T, int16_t>::value ||\n\t\tstd::is_same<T, int32_t>::value ||\n\t\tstd::is_same<T, int64_t>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn std::to_string(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn static_cast<T>(std::stoll(aValue));\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct string_serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, float>::value ||\n\t\tstd::is_same<T, double>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn std::to_string(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn static_cast<T>(std::stod(aValue));\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct string_serialiser<char, void> {\n\t\ttypedef char serialise_t;\n\t\ttypedef char deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn serial_value::string_t() + aValue;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn aValue[0];\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct string_serialiser<bool, void> {\n\t\ttypedef bool serialise_t;\n\t\ttypedef bool deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn aValue ? \"true\" : \"false\";\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\tif(aValue == \"true\") {\n\t\t\t\treturn true;\n\t\t\t}else if (aValue == \"false\") {\n\t\t\t\treturn false;\n\t\t\t}else {\n\t\t\t\tthrow std::runtime_error(\"as::string_serialiser::deserialise : String cannot be converted to bool\");\n\t\t\t}\n\t\t}\n\t};\n\n\n\ttemplate<>\n\tstruct string_serialiser<serial_value::string_t, void> {\n\t\ttypedef const serial_value::string_t& serialise_t;\n\t\ttypedef const serial_value::string_t& deserialise_t;\n\t\tenum { CONVERTABLE = 1 };\n\n\t\tstatic serial_value::string_t serialise(serialise_t aValue) {\n\t\t\treturn aValue;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value::string_t& aValue) {\n\t\t\treturn aValue;\n\t\t}\n\t};\n\n\t\/\/ -- Serialiser Specialisations\n\n\ttemplate<>\n\tstruct serialiser<char, void> {\n\t\ttypedef char serialise_t;\n\t\ttypedef char deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn aValue.get_char();\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct serialiser<bool, void> {\n\t\ttypedef bool serialise_t;\n\t\ttypedef bool deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn aValue.get_bool();\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, uint8_t>::value ||\n\t\tstd::is_same<T, uint16_t>::value ||\n\t\tstd::is_same<T, uint32_t>::value ||\n\t\tstd::is_same<T, uint64_t>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn static_cast<deserialise_t>(aValue.get_unsigned());\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, int8_t>::value ||\n\t\tstd::is_same<T, int16_t>::value ||\n\t\tstd::is_same<T, int32_t>::value ||\n\t\tstd::is_same<T, int64_t>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn static_cast<deserialise_t>(aValue.get_signed());\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<T, typename std::enable_if<\n\t\tstd::is_same<T, float>::value ||\n\t\tstd::is_same<T, double>::value\n\t>::type> {\n\t\ttypedef T serialise_t;\n\t\ttypedef T deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn static_cast<deserialise_t>(aValue.get_float());\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct serialiser<std::string, void> {\n\t\ttypedef const std::string& serialise_t;\n\t\ttypedef std::string deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\treturn serial_value(aValue);\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\treturn aValue.get_string();\n\t\t}\n\t};\n\n\t\/\/ -- Container specialisations\n\n\ttemplate<class T>\n\tstruct serialiser<std::vector<T>, void> {\n\t\ttypedef const std::vector<T>& serialise_t;\n\t\ttypedef std::vector<T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::vector<serial_value>& values = tmp.set_array();\n\t\t\tfor(const T& i : aValue) values.push_back(serialiser<T>::serialise(i));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::vector<serial_value>& values = aValue.get_array();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const serial_value& i : values) tmp.push_back(serialiser<T>::deserialise(i));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<std::deque<T>, void> {\n\t\ttypedef const std::deque<T>& serialise_t;\n\t\ttypedef std::vector<T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::vector<serial_value>& values = tmp.set_array();\n\t\t\tfor(const T& i : aValue) values.push_back(serialiser<T>::serialise(i));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::vector<serial_value>& values = aValue.get_array();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const serial_value& i : values) tmp.push_back(serialiser<T>::deserialise(i));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class T>\n\tstruct serialiser<std::list<T>, void> {\n\t\ttypedef const std::list<T>& serialise_t;\n\t\ttypedef std::list<T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::vector<serial_value>& values = tmp.set_array();\n\t\t\tfor(const T& i : aValue) values.push_back(serialiser<T>::serialise(i));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::vector<serial_value>& values = aValue.get_array();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const serial_value& i : values) tmp.push_back(serialiser<T>::deserialise(i));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class K, class T>\n\tstruct serialiser<std::map<K,T>, typename std::enable_if<string_serialiser<K>::CONVERTABLE, void>::type> {\n\t\ttypedef const std::map<K,T>& serialise_t;\n\t\ttypedef std::map<K,T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tserial_value::object_t& values = tmp.set_object();\n\t\t\tfor(const auto& i : aValue) values.emplace(string_serialiser<K>::serialise(i.first), serialiser<T>::serialise(i.second));\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst serial_value::object_t& values = aValue.get_object();\n\t\t\tdeserialise_t tmp;\n\t\t\tfor(const auto& i : values) tmp.emplace(string_serialiser<K>::deserialise(i.first), serialiser<T>::deserialise(i.second));\n\t\t\treturn tmp;\n\t\t}\n\t};\n\n\ttemplate<class K, class T>\n\tstruct serialiser<std::map<K,T>, typename std::enable_if<! string_serialiser<K>::CONVERTABLE, void>::type> {\n\t\ttypedef const std::map<K,T>& serialise_t;\n\t\ttypedef std::map<K,T> deserialise_t;\n\n\t\tstatic serial_value serialise(serialise_t aValue) {\n\t\t\tserial_value tmp;\n\t\t\tstd::map<serial_value::string_t, serial_value>& parent = tmp.set_object();\n\t\t\tparent.emplace(\"keys\", serial_value());\n\t\t\tparent.emplace(\"values\", serial_value());\n\t\t\tstd::vector<serial_value>& keys = parent.find(\"keys\")->second.set_array();\n\t\t\tstd::vector<serial_value>& values = parent.find(\"values\")->second.set_array();\n\n\t\t\tfor(const auto& i : aValue) {\n\t\t\t\tkeys.push_back(serialiser<K>::serialise(i.first));\n\t\t\t\tvalues.push_back(serialiser<T>::serialise(i.second));\n\t\t\t}\n\t\t\treturn tmp;\n\t\t}\n\n\t\tstatic deserialise_t deserialise(const serial_value& aValue) {\n\t\t\tconst std::vector<serial_value>& keys = aValue[\"keys\"].get_array();\n\t\t\tconst std::vector<serial_value>& values = aValue[\"values\"].get_array();\n\t\t\tconst size_t size = keys.size();\n\t\t\tdeserialise_t tmp;\n\n\t\t\tfor(size_t i = 0; i < size; ++i) {\n\t\t\t\ttmp.emplace(\n\t\t\t\t\tserialiser<K>::deserialise(keys[i]),\n\t\t\t\t\tserialiser<T>::deserialise(values[i])\n\t\t\t\t);\n\t\t\t}\n\n\t\t\treturn tmp;\n\t\t}\n\t};\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/\/  (C) Copyright Gennadiy Rozental 2001-2002.\n\/\/  (C) Copyright Ullrich Koethe 2001.\n\/\/  Permission to copy, use, modify, sell and distribute this software\n\/\/  is granted provided this copyright notice appears in all copies.\n\/\/  This software is provided \"as is\" without express or implied warranty,\n\/\/  and with no claim as to its suitability for any purpose.\n\n\/\/  See http:\/\/www.boost.org for most recent version including documentation.\n\/\/\n\/\/  File        : $RCSfile$\n\/\/\n\/\/  Version     : $Id$\n\/\/\n\/\/  Description : defines all classes in test_case hierarchy and object generators\n\/\/  for them.\n\/\/ ***************************************************************************\n\n#ifndef BOOST_UNIT_TEST_SUITE_HPP\n#define BOOST_UNIT_TEST_SUITE_HPP\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/unit_test_monitor.hpp>\n#include <boost\/test\/detail\/unit_test_config.hpp>\n#include <boost\/test\/detail\/class_properties.hpp>\n\n\/\/ BOOST\n#include <boost\/shared_ptr.hpp>\n\n\/\/ STL\n#include <string>  \/\/ for std::string\n\n#define BOOST_TEST_CASE( function ) \\\nboost::unit_test_framework::create_test_case((function), #function )\n#define BOOST_CLASS_TEST_CASE( function, tc_instance ) \\\nboost::unit_test_framework::create_test_case((function), #function, tc_instance )\n#define BOOST_PARAM_TEST_CASE( function, begin, end ) \\\nboost::unit_test_framework::create_test_case((function), #function, (begin), (end) )\n#define BOOST_PARAM_CLASS_TEST_CASE( function, tc_instance, begin, end ) \\\nboost::unit_test_framework::create_test_case((function), #function, tc_instance, (begin), (end) )\n#define BOOST_TEST_SUITE( testsuite_name ) \\\n( new boost::unit_test_framework::test_suite( testsuite_name ) )\n\nnamespace boost {\n\nnamespace unit_test_framework {\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************                   test_case                  ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass test_case {\npublic:\n    typedef detail::unit_test_monitor::error_level error_level_type;\n\n    \/\/ Destructor\n    virtual             ~test_case()    {}\n\n    \/\/ number of tests in this test case\n    virtual unit_test_counter size() const;\n\n    \/\/ execute this method to run the test case\n    void                run();\n\n    \/\/ public properties\n    BOOST_READONLY_PROPERTY( int, 2, (test_case,test_suite) )\n                        p_timeout;                  \/\/ timeout for the excecution monitor\n    BOOST_READONLY_PROPERTY( unit_test_counter, 1, (test_suite) )\n                        p_expected_failures;        \/\/ number of aseertions that are expected to fail in this test case\n    BOOST_READONLY_PROPERTY( bool, 0, () )\n                        p_type;                     \/\/ true = test case, false - test suite\n    BOOST_READONLY_PROPERTY( std::string, 0, () )\n                        p_name;                     \/\/ name for this test case\n\n\nprotected:\n    \/\/ protected properties\n    BOOST_READONLY_PROPERTY( bool, 2, (test_case,test_suite) )\n                        p_compound_stage;           \/\/ used to properly manage progress report\n    BOOST_READWRITE_PROPERTY( unit_test_counter )\n                        p_stages_amount;            \/\/ number of stages this test consist of; stage could be another test case\n                                                    \/\/ like with test_suite, another parameterized test for parameterized_test_case\n                                                    \/\/ or 1 stage that reflect single test_case behaviour\n\n    \/\/ access methods\n    void                curr_stage_is_compound();\n\n    \/\/ Constructor\n    explicit            test_case( std::string const&   name_,\n                                   bool                 type_,\n                                   unit_test_counter    stages_number_,\n                                   bool                 monitor_run_    = true );\n\n    \/\/ test case implementation hooks to be called with unit_test_monitor or alone\n    virtual void        do_init()       {}\n    virtual void        do_run()        {}\n    virtual void        do_destroy()    {}\n\nprivate:\n    \/\/ Data members\n    bool                m_monitor_run;              \/\/ true - unit_test_monitor will be user to monitor running\n                                                    \/\/ of implementation function\n    static bool         s_abort_testing;            \/\/ used to flag critical error and try gracefully stop testing\n};\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************              function_test_case              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass function_test_case : public test_case {\npublic:\n    typedef void  (*function_type)();\n\n    \/\/ Constructor\n    function_test_case( function_type f_, std::string const& name_ )\n    : test_case( name_, true, 1 ), m_function( f_ ) {}\n\nprotected:\n    \/\/ test case implementation\n    void                do_run()        { m_function(); }\n\nprivate:\n    \/\/ Data members\n    function_type       m_function;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************                class_test_case               ************** \/\/\n\/\/ ************************************************************************** \/\/\n\ntemplate<class UserTestCase>\nclass class_test_case : public test_case {\npublic:\n    typedef void  (UserTestCase::*function_type)();\n\n    \/\/ Constructor\n    class_test_case( function_type f_, std::string const& name_, boost::shared_ptr<UserTestCase> const& user_test_case_ )\n    : test_case( name_, true, 1 ), m_user_test_case( user_test_case_ ), m_function( f_ ) \n    {}\n\nprivate:\n    \/\/ test case implementation\n    void                do_run()\n    { \n        if( (!!m_user_test_case) && m_function ) \n            ((*m_user_test_case).*m_function)();\n    }\n    void                do_destroy()\n    { \n        m_user_test_case.reset(); \/\/ t ofree the reference to the shared use test case instance\n    }\n\n    \/\/ Data members\n    boost::shared_ptr<UserTestCase> m_user_test_case;\n    function_type       m_function;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************        parametrized_function_test_case       ************** \/\/\n\/\/ ************************************************************************** \/\/\n\ntemplate <typename ParamIterator, typename ParameterType>\nclass parametrized_function_test_case : public test_case {\npublic:\n    typedef void  (*function_type)( ParameterType );\n\n    \/\/ Constructor\n    parametrized_function_test_case( function_type f_, std::string const& name_,\n                                     ParamIterator const& par_begin_, ParamIterator const& par_end_ )\n    : test_case( name_, true, 0 ), m_first_parameter( par_begin_ ), m_last_parameter( par_end_ ), m_function( f_ )\n    {\n       \/\/ the typecasts are here to keep Borland C++ Builder 5 happy, for other compilers they have no effect:\n       p_stages_amount.set( detail::distance( (ParamIterator)par_begin_, (ParamIterator)par_end_ ) );\n    }\n\n    \/\/ test case implementation\n    void                do_init()       { m_curr_parameter = m_first_parameter; }\n    void                do_run()        { m_function( *m_curr_parameter++ ); }\n\nprivate:\n    \/\/ Data members\n    ParamIterator       m_first_parameter;\n    ParamIterator       m_last_parameter;\n    ParamIterator       m_curr_parameter;\n\n    function_type       m_function;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************         parametrized_class_test_case         ************** \/\/\n\/\/ ************************************************************************** \/\/\n\ntemplate <class UserTestCase, class ParamIterator, typename ParameterType>\nclass parametrized_class_test_case : public test_case {\npublic:\n    typedef void  (UserTestCase::*function_type)( ParameterType );\n\n    \/\/ Constructor\n    parametrized_class_test_case( function_type f_, std::string const& name_, boost::shared_ptr<UserTestCase>const & user_test_case_,\n                                  ParamIterator const& par_begin_, ParamIterator const& par_end_ )\n    : test_case( name_, true, 0 ), m_first_parameter( par_begin_ ), m_last_parameter( par_end_ ),\n      m_user_test_case( user_test_case_ ), m_function( f_ )\n    {\n       \/\/ the typecasts are here to keep Borland C++ Builder 5 happy, for other compilers they have no effect:\n       p_stages_amount.set( detail::distance( (ParamIterator)par_begin_, (ParamIterator)par_end_ ) );\n    }\n\n    \/\/ test case implementation\n    void                do_init()       { m_curr_parameter = m_first_parameter; }\n    void                do_run()        { ((*m_user_test_case).*m_function)( *m_curr_parameter++ ); }\n    void                do_destroy()    { m_user_test_case.reset(); }\n\nprivate:\n    \/\/ Data members\n    ParamIterator       m_first_parameter;\n    ParamIterator       m_last_parameter;\n    ParamIterator       m_curr_parameter;\n\n    boost::shared_ptr<UserTestCase> m_user_test_case;\n    function_type       m_function;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************                  test_suite                  ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass test_suite : public test_case {\npublic:\n    \/\/ Constructor\n    explicit test_suite( std::string const& name_ = \"Master\" );\n\n    \/\/ Destructor\n    virtual             ~test_suite();\n\n    \/\/ test case list management\n    void                add( test_case* tc_, unit_test_counter expected_failures_ = 0, int timeout_ = 0 );\n\n    \/\/ access methods\n    unit_test_counter   size() const;\n\n    \/\/ test case implementation\n    void                do_init();\n    void                do_run();\n\nprivate:\n    \/\/ Data members\n    struct Impl;\n    boost::shared_ptr<Impl> m_pimpl;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************               object generators              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nnamespace detail {\n\nstd::string const& normalize_test_case_name( std::string& name_ );\n\n} \/\/ namespace detail\n\n\/\/____________________________________________________________________________\/\/\n\ninline test_case*\ncreate_test_case( void (*fct_)(), std::string name_ )\n{\n    return new function_test_case( fct_, detail::normalize_test_case_name( name_ ) );\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<class UserTestCase>\ninline test_case*\ncreate_test_case( void (UserTestCase::*fct_)(), std::string name_, boost::shared_ptr<UserTestCase> const& user_test_case_ )\n{\n    return new class_test_case<UserTestCase>( fct_, detail::normalize_test_case_name( name_ ), user_test_case_ );\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename ParamIterator, typename ParamType>\ninline test_case*\ncreate_test_case( void (*fct_)( ParamType ), std::string name_, ParamIterator const& par_begin_, ParamIterator const& par_end_ )\n{\n    return new parametrized_function_test_case<ParamIterator,ParamType>(\n        fct_, detail::normalize_test_case_name( name_ ), par_begin_, par_end_ );\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<class UserTestCase, typename ParamIterator, typename ParamType>\ninline test_case*\ncreate_test_case( void (UserTestCase::*fct_)( ParamType ), std::string name_, boost::shared_ptr<UserTestCase> const& user_test_case_,\n                  ParamIterator const& par_begin_, ParamIterator const& par_end_ )\n{\n    return new parametrized_class_test_case<UserTestCase,ParamIterator,ParamType>(\n        fct_, detail::normalize_test_case_name( name_ ), user_test_case_, par_begin_, par_end_ );\n}\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ unit_test_framework\n\n} \/\/ namespace boost\n\n\/\/ ***************************************************************************\n\/\/  Revision History :\n\/\/  \n\/\/  $Log$\n\/\/  Revision 1.13  2003\/02\/13 08:23:08  rogeeff\n\/\/  C strings eliminated\n\/\/  type: virtual method -> property\n\/\/  const added to user test case shared instance reference\n\/\/\n\/\/  Revision 1.12  2002\/12\/08 17:51:04  rogeeff\n\/\/  notion of number of stages is separated from number of test cases, so that\n\/\/  parameterized test case in reported as one test case\n\/\/  fixed bug in both parameterized function\/class test cases with not iterating\n\/\/  parameter iterator if exception occured\n\/\/  switched to use c_string_literal\n\/\/\n\/\/  Revision 1.11  2002\/11\/02 19:31:04  rogeeff\n\/\/  merged into the main trank\n\/\/\n\n\/\/ ***************************************************************************\n\n#endif \/\/ BOOST_UNIT_TEST_SUITE_HPP\n\n<commit_msg>methods has_passed and depend_on introduced to manage dependencies<commit_after>\/\/  (C) Copyright Gennadiy Rozental 2001-2003.\n\/\/  (C) Copyright Ullrich Koethe 2001.\n\/\/  Permission to copy, use, modify, sell and distribute this software\n\/\/  is granted provided this copyright notice appears in all copies.\n\/\/  This software is provided \"as is\" without express or implied warranty,\n\/\/  and with no claim as to its suitability for any purpose.\n\n\/\/  See http:\/\/www.boost.org for most recent version including documentation.\n\/\/\n\/\/  File        : $RCSfile$\n\/\/\n\/\/  Version     : $Revision$\n\/\/\n\/\/  Description : defines all classes in test_case hierarchy and object generators\n\/\/  for them.\n\/\/ ***************************************************************************\n\n#ifndef BOOST_UNIT_TEST_SUITE_HPP\n#define BOOST_UNIT_TEST_SUITE_HPP\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/unit_test_monitor.hpp>\n#include <boost\/test\/detail\/unit_test_config.hpp>\n#include <boost\/test\/detail\/class_properties.hpp>\n\n\/\/ BOOST\n#include <boost\/shared_ptr.hpp>\n\n\/\/ STL\n#include <string>  \/\/ for std::string\n\n\/\/____________________________________________________________________________\/\/\n\n#define BOOST_TEST_CASE( function ) \\\nboost::unit_test_framework::create_test_case((function), #function )\n#define BOOST_CLASS_TEST_CASE( function, tc_instance ) \\\nboost::unit_test_framework::create_test_case((function), #function, tc_instance )\n#define BOOST_PARAM_TEST_CASE( function, begin, end ) \\\nboost::unit_test_framework::create_test_case((function), #function, (begin), (end) )\n#define BOOST_PARAM_CLASS_TEST_CASE( function, tc_instance, begin, end ) \\\nboost::unit_test_framework::create_test_case((function), #function, tc_instance, (begin), (end) )\n#define BOOST_TEST_SUITE( testsuite_name ) \\\n( new boost::unit_test_framework::test_suite( testsuite_name ) )\n\nnamespace boost {\n\nnamespace unit_test_framework {\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************                   test_case                  ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass test_case {\npublic:\n    typedef detail::unit_test_monitor::error_level error_level_type;\n\n    \/\/ post creation configuration\n    void                depends_on( test_case const* rhs );\n\n    \/\/ Destructor\n    virtual             ~test_case()    {}\n\n    \/\/ total number of test cases\n    virtual unit_test_counter size() const;\n\n    \/\/ execute this method to run the test case\n    void                run();\n\n    \/\/ status\n    bool                has_passed() const;\n\n    \/\/ public properties\n    BOOST_READONLY_PROPERTY( int, 2, (test_case,test_suite) )\n                        p_timeout;                  \/\/ timeout for the excecution monitor\n    BOOST_READONLY_PROPERTY( unit_test_counter, 1, (test_suite) )\n                        p_expected_failures;        \/\/ number of assertions that are expected to fail in this test case\n    BOOST_READONLY_PROPERTY( bool, 0, () )\n                        p_type;                     \/\/ true = test case, false - test suite\n    BOOST_READONLY_PROPERTY( std::string, 0, () )\n                        p_name;                     \/\/ name for this test case\n\n\nprotected:\n    \/\/ protected properties\n    BOOST_READONLY_PROPERTY( bool, 2, (test_case,test_suite) )\n                        p_compound_stage;           \/\/ used to properly manage progress report\n    BOOST_READWRITE_PROPERTY( unit_test_counter )\n                        p_stages_amount;            \/\/ number of stages this test consist of; stage could be another test case\n                                                    \/\/ like with test_suite, another parameterized test for parameterized_test_case\n                                                    \/\/ or 1 stage that reflect single test_case behaviour\n\n    \/\/ access methods\n    void                curr_stage_is_compound();\n\n    \/\/ Constructor\n    explicit            test_case( std::string const&   name_,\n                                   bool                 type_,\n                                   unit_test_counter    stages_amount_,\n                                   bool                 monitor_run_    = true );\n\n    \/\/ test case implementation hooks to be called with unit_test_monitor or alone\n    virtual void        do_init()       {}\n    virtual void        do_run()        {}\n    virtual void        do_destroy()    {}\n\nprivate:\n    \/\/ Data members\n    struct Impl;\n    boost::shared_ptr<Impl> m_pimpl;\n};\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************              function_test_case              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass function_test_case : public test_case {\npublic:\n    typedef void  (*function_type)();\n\n    \/\/ Constructor\n    function_test_case( function_type f_, std::string const& name_ )\n    : test_case( name_, true, 1 ), m_function( f_ ) {}\n\nprotected:\n    \/\/ test case implementation\n    void                do_run()        { m_function(); }\n\nprivate:\n    \/\/ Data members\n    function_type       m_function;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************                class_test_case               ************** \/\/\n\/\/ ************************************************************************** \/\/\n\ntemplate<class UserTestCase>\nclass class_test_case : public test_case {\npublic:\n    typedef void  (UserTestCase::*function_type)();\n\n    \/\/ Constructor\n    class_test_case( function_type f_, std::string const& name_, boost::shared_ptr<UserTestCase> const& user_test_case_ )\n    : test_case( name_, true, 1 ), m_user_test_case( user_test_case_ ), m_function( f_ ) \n    {}\n\nprivate:\n    \/\/ test case implementation\n    void                do_run()\n    { \n        if( (!!m_user_test_case) && m_function ) \n            ((*m_user_test_case).*m_function)();\n    }\n    void                do_destroy()\n    { \n        m_user_test_case.reset(); \/\/ t ofree the reference to the shared use test case instance\n    }\n\n    \/\/ Data members\n    boost::shared_ptr<UserTestCase> m_user_test_case;\n    function_type       m_function;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************        parametrized_function_test_case       ************** \/\/\n\/\/ ************************************************************************** \/\/\n\ntemplate <typename ParamIterator, typename ParameterType>\nclass parametrized_function_test_case : public test_case {\npublic:\n    typedef void  (*function_type)( ParameterType );\n\n    \/\/ Constructor\n    parametrized_function_test_case( function_type f_, std::string const& name_,\n                                     ParamIterator const& par_begin_, ParamIterator const& par_end_ )\n    : test_case( name_, true, 0 ), m_first_parameter( par_begin_ ), m_last_parameter( par_end_ ), m_function( f_ )\n    {\n       \/\/ the typecasts are here to keep Borland C++ Builder 5 happy, for other compilers they have no effect:\n       p_stages_amount.set( detail::distance( (ParamIterator)par_begin_, (ParamIterator)par_end_ ) );\n    }\n\n    \/\/ test case implementation\n    void                do_init()       { m_curr_parameter = m_first_parameter; }\n    void                do_run()        { m_function( *m_curr_parameter++ ); }\n\nprivate:\n    \/\/ Data members\n    ParamIterator       m_first_parameter;\n    ParamIterator       m_last_parameter;\n    ParamIterator       m_curr_parameter;\n\n    function_type       m_function;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************         parametrized_class_test_case         ************** \/\/\n\/\/ ************************************************************************** \/\/\n\ntemplate <class UserTestCase, class ParamIterator, typename ParameterType>\nclass parametrized_class_test_case : public test_case {\npublic:\n    typedef void  (UserTestCase::*function_type)( ParameterType );\n\n    \/\/ Constructor\n    parametrized_class_test_case( function_type f_, std::string const& name_, boost::shared_ptr<UserTestCase>const & user_test_case_,\n                                  ParamIterator const& par_begin_, ParamIterator const& par_end_ )\n    : test_case( name_, true, 0 ), m_first_parameter( par_begin_ ), m_last_parameter( par_end_ ),\n      m_user_test_case( user_test_case_ ), m_function( f_ )\n    {\n       \/\/ the typecasts are here to keep Borland C++ Builder 5 happy, for other compilers they have no effect:\n       p_stages_amount.set( detail::distance( (ParamIterator)par_begin_, (ParamIterator)par_end_ ) );\n    }\n\n    \/\/ test case implementation\n    void                do_init()       { m_curr_parameter = m_first_parameter; }\n    void                do_run()        { ((*m_user_test_case).*m_function)( *m_curr_parameter++ ); }\n    void                do_destroy()    { m_user_test_case.reset(); }\n\nprivate:\n    \/\/ Data members\n    ParamIterator       m_first_parameter;\n    ParamIterator       m_last_parameter;\n    ParamIterator       m_curr_parameter;\n\n    boost::shared_ptr<UserTestCase> m_user_test_case;\n    function_type       m_function;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************                  test_suite                  ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass test_suite : public test_case {\npublic:\n    \/\/ Constructor\n    explicit test_suite( std::string const& name_ = \"Master\" );\n\n    \/\/ Destructor\n    virtual             ~test_suite();\n\n    \/\/ test case list management\n    void                add( test_case* tc_, unit_test_counter expected_failures_ = 0, int timeout_ = 0 );\n\n    \/\/ access methods\n    unit_test_counter   size() const;\n\n    \/\/ test case implementation\n    void                do_init();\n    void                do_run();\n\nprivate:\n    \/\/ Data members\n    struct Impl;\n    boost::shared_ptr<Impl> m_pimpl;\n};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************               object generators              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nnamespace detail {\n\nstd::string const& normalize_test_case_name( std::string& name_ );\n\n} \/\/ namespace detail\n\n\/\/____________________________________________________________________________\/\/\n\ninline test_case*\ncreate_test_case( void (*fct_)(), std::string name_ )\n{\n    return new function_test_case( fct_, detail::normalize_test_case_name( name_ ) );\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<class UserTestCase>\ninline test_case*\ncreate_test_case( void (UserTestCase::*fct_)(), std::string name_, boost::shared_ptr<UserTestCase> const& user_test_case_ )\n{\n    return new class_test_case<UserTestCase>( fct_, detail::normalize_test_case_name( name_ ), user_test_case_ );\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename ParamIterator, typename ParamType>\ninline test_case*\ncreate_test_case( void (*fct_)( ParamType ), std::string name_, ParamIterator const& par_begin_, ParamIterator const& par_end_ )\n{\n    return new parametrized_function_test_case<ParamIterator,ParamType>(\n        fct_, detail::normalize_test_case_name( name_ ), par_begin_, par_end_ );\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<class UserTestCase, typename ParamIterator, typename ParamType>\ninline test_case*\ncreate_test_case( void (UserTestCase::*fct_)( ParamType ), std::string name_, boost::shared_ptr<UserTestCase> const& user_test_case_,\n                  ParamIterator const& par_begin_, ParamIterator const& par_end_ )\n{\n    return new parametrized_class_test_case<UserTestCase,ParamIterator,ParamType>(\n        fct_, detail::normalize_test_case_name( name_ ), user_test_case_, par_begin_, par_end_ );\n}\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ unit_test_framework\n\n} \/\/ namespace boost\n\n\/\/ ***************************************************************************\n\/\/  Revision History :\n\/\/  \n\/\/  $Log$\n\/\/  Revision 1.14  2003\/06\/09 09:00:09  rogeeff\n\/\/  methods has_passed and depend_on introduced to manage dependencies\n\/\/\n\n\/\/ ***************************************************************************\n\n#endif \/\/ BOOST_UNIT_TEST_SUITE_HPP\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkScalarRegionBasedLevelSetFunctionTest.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 \"itkScalarRegionBasedLevelSetFunction.h\"\n#include \"itkVector.h\"\n#include \"itkImage.h\"\n#include \"itkTestingMacros.h\"\n\nnamespace itk\n{\n\ntemplate < class TInput, \/\/ LevelSetImageType\n  class TFeature, \/\/ FeatureImageType\n  class TSharedData >\nclass ScalarRegionBasedLevelSetFunctionTestHelper :\n public ScalarRegionBasedLevelSetFunction< TInput, TFeature, TSharedData >\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef ScalarRegionBasedLevelSetFunctionTestHelper                       Self;\n  typedef ScalarRegionBasedLevelSetFunction<TInput,TFeature,TSharedData>    Superclass;\n  typedef SmartPointer<Self>                                                Pointer;\n  typedef SmartPointer<const Self>                                          ConstPointer;\n\n  itkStaticConstMacro(ImageDimension, unsigned int, Superclass::ImageDimension);\n\n  itkNewMacro(Self);\n\n  \/** Run-time type information (and related methods) *\/\n  itkTypeMacro( ScalarRegionBasedLevelSetFunctionTestHelper, ScalarRegionBasedLevelSetFunction );\n\n  typedef typename Superclass::ScalarValueType     ScalarValueType;\n  typedef typename Superclass::FeaturePixelType    FeaturePixelType;\n  typedef typename Superclass::FeatureIndexType    FeatureIndexType;\n\n\n  virtual ScalarValueType ComputeInternalTerm(const FeaturePixelType &,\n    const FeatureIndexType & )\n    {\n    return ScalarValueType( 0 );\n    }\n\n  virtual ScalarValueType ComputeExternalTerm(const FeaturePixelType &,\n    const FeatureIndexType & )\n    {\n    return ScalarValueType( 0 );\n    }\n\n  virtual ScalarValueType ComputeOverlapParameters( const FeatureIndexType& ,\n    ScalarValueType& )\n    {\n    return ScalarValueType( 0 );\n    }\n\n  virtual void ComputeParameters() {}\n\n  virtual void UpdateSharedDataParameters() {}\n\n  virtual void UpdateSharedDataInsideParameters( const unsigned int& ,\n    const bool& , const FeaturePixelType&, const ScalarValueType& ) {}\n\n  virtual void UpdateSharedDataOutsideParameters( const unsigned int& ,\n    const bool& , const FeaturePixelType&, const ScalarValueType& ) {}\n\n\nprotected:\n  ScalarRegionBasedLevelSetFunctionTestHelper() {}\n  ~ScalarRegionBasedLevelSetFunctionTestHelper() {}\n\nprivate:\n  ScalarRegionBasedLevelSetFunctionTestHelper(const Self&); \/\/purposely not implemented\n  void operator=(const Self&); \/\/purposely not implemented\n};\n\ntemplate <unsigned int NDimension>\nclass ScalarRegionBasedLevelSetFunctionSharedDataHelper : public DataObject\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef ScalarRegionBasedLevelSetFunctionSharedDataHelper   Self;\n  typedef DataObject                                          Superclass;\n  typedef SmartPointer<Self>                                  Pointer;\n  typedef SmartPointer<const Self>                            ConstPointer;\n\n  itkNewMacro(Self);\n\n  \/** Run-time type information (and related methods) *\/\n  itkTypeMacro( ScalarRegionBasedLevelSetFunctionSharedDataHelper, DataObject );\n\n  unsigned long       m_FunctionCount;\n\n  typedef Index< NDimension >                 IndexType;\n  typedef std::list< unsigned int >           ListPixelType;\n\n  typedef Image< ListPixelType, NDimension > ImageType;\n  typename ImageType::Pointer   m_NearestNeighborListImage;\n\n  typedef double                              PixelType;\n  typedef Image< PixelType, NDimension >      InputImageType;\n\n  struct SingleData\n    {\n    typename InputImageType::Pointer m_HeavisideFunctionOfLevelSetImage;\n    int m_WeightedNumberOfPixelsInsideLevelSet;\n    int m_WeightedSumOfPixelValuesInsideLevelSet;\n    int m_ForegroundConstantValues;\n\n    int m_WeightedNumberOfPixelsOutsideLevelSet;\n    int m_WeightedSumOfPixelValuesOutsideLevelSet;\n    int m_BackgroundConstantValues;\n\n    IndexType GetFeatureIndex( const IndexType & indx )\n      {\n      return indx;\n      }\n\n    IndexType GetIndex( const IndexType & globalIndex )\n      {\n      return globalIndex;\n      }\n    };\n\n  SingleData* m_LevelSetDataPointerVector[19];\n\n};\n\n}\n\nint itkScalarRegionBasedLevelSetFunctionTest( int, char* [] )\n{\n  const unsigned int Dimension = 3;\n\n  typedef double                                  PixelType;\n  typedef itk::Image< PixelType, Dimension >      ImageType;\n  typedef itk::Image< float, Dimension >          FeatureImageType;\n\n  typedef itk::ScalarRegionBasedLevelSetFunctionSharedDataHelper<Dimension>      DataHelperType;\n\n\n  typedef itk::ScalarRegionBasedLevelSetFunctionTestHelper<\n    ImageType, FeatureImageType, DataHelperType >      RegionBasedLevelSetFunctionType;\n\n  RegionBasedLevelSetFunctionType::Pointer function = RegionBasedLevelSetFunctionType::New();\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>ENH: Changed the API of the methods UpdateSharedDataInsideParameters() and UpdateSharedDataOutsideParameters()<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkScalarRegionBasedLevelSetFunctionTest.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 \"itkScalarRegionBasedLevelSetFunction.h\"\n#include \"itkVector.h\"\n#include \"itkImage.h\"\n#include \"itkTestingMacros.h\"\n\nnamespace itk\n{\n\ntemplate < class TInput, \/\/ LevelSetImageType\n  class TFeature, \/\/ FeatureImageType\n  class TSharedData >\nclass ScalarRegionBasedLevelSetFunctionTestHelper :\n public ScalarRegionBasedLevelSetFunction< TInput, TFeature, TSharedData >\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef ScalarRegionBasedLevelSetFunctionTestHelper                       Self;\n  typedef ScalarRegionBasedLevelSetFunction<TInput,TFeature,TSharedData>    Superclass;\n  typedef SmartPointer<Self>                                                Pointer;\n  typedef SmartPointer<const Self>                                          ConstPointer;\n\n  itkStaticConstMacro(ImageDimension, unsigned int, Superclass::ImageDimension);\n\n  itkNewMacro(Self);\n\n  \/** Run-time type information (and related methods) *\/\n  itkTypeMacro( ScalarRegionBasedLevelSetFunctionTestHelper, ScalarRegionBasedLevelSetFunction );\n\n  typedef typename Superclass::ScalarValueType     ScalarValueType;\n  typedef typename Superclass::FeaturePixelType    FeaturePixelType;\n  typedef typename Superclass::FeatureIndexType    FeatureIndexType;\n\n\n  virtual ScalarValueType ComputeInternalTerm(const FeaturePixelType &,\n    const FeatureIndexType & )\n    {\n    return ScalarValueType( 0 );\n    }\n\n  virtual ScalarValueType ComputeExternalTerm(const FeaturePixelType &,\n    const FeatureIndexType & )\n    {\n    return ScalarValueType( 0 );\n    }\n\n  virtual ScalarValueType ComputeOverlapParameters( const FeatureIndexType& ,\n    ScalarValueType& )\n    {\n    return ScalarValueType( 0 );\n    }\n\n  virtual void ComputeParameters() {}\n\n  virtual void UpdateSharedDataParameters() {}\n\n  virtual void UpdateSharedDataInsideParameters( const unsigned int& ,\n    const FeaturePixelType&, const ScalarValueType& ) {}\n\n  virtual void UpdateSharedDataOutsideParameters( const unsigned int& ,\n    const FeaturePixelType&, const ScalarValueType& ) {}\n\n\nprotected:\n  ScalarRegionBasedLevelSetFunctionTestHelper() {}\n  ~ScalarRegionBasedLevelSetFunctionTestHelper() {}\n\nprivate:\n  ScalarRegionBasedLevelSetFunctionTestHelper(const Self&); \/\/purposely not implemented\n  void operator=(const Self&); \/\/purposely not implemented\n};\n\ntemplate <unsigned int NDimension>\nclass ScalarRegionBasedLevelSetFunctionSharedDataHelper : public DataObject\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef ScalarRegionBasedLevelSetFunctionSharedDataHelper   Self;\n  typedef DataObject                                          Superclass;\n  typedef SmartPointer<Self>                                  Pointer;\n  typedef SmartPointer<const Self>                            ConstPointer;\n\n  itkNewMacro(Self);\n\n  \/** Run-time type information (and related methods) *\/\n  itkTypeMacro( ScalarRegionBasedLevelSetFunctionSharedDataHelper, DataObject );\n\n  unsigned long       m_FunctionCount;\n\n  typedef Index< NDimension >                 IndexType;\n  typedef std::list< unsigned int >           ListPixelType;\n\n  typedef Image< ListPixelType, NDimension > ImageType;\n  typename ImageType::Pointer   m_NearestNeighborListImage;\n\n  typedef double                              PixelType;\n  typedef Image< PixelType, NDimension >      InputImageType;\n\n  struct SingleData\n    {\n    typename InputImageType::Pointer m_HeavisideFunctionOfLevelSetImage;\n    int m_WeightedNumberOfPixelsInsideLevelSet;\n    int m_WeightedSumOfPixelValuesInsideLevelSet;\n    int m_ForegroundConstantValues;\n\n    int m_WeightedNumberOfPixelsOutsideLevelSet;\n    int m_WeightedSumOfPixelValuesOutsideLevelSet;\n    int m_BackgroundConstantValues;\n\n    IndexType GetFeatureIndex( const IndexType & indx )\n      {\n      return indx;\n      }\n\n    IndexType GetIndex( const IndexType & globalIndex )\n      {\n      return globalIndex;\n      }\n    };\n\n  SingleData* m_LevelSetDataPointerVector[19];\n\n};\n\n}\n\nint itkScalarRegionBasedLevelSetFunctionTest( int, char* [] )\n{\n  const unsigned int Dimension = 3;\n\n  typedef double                                  PixelType;\n  typedef itk::Image< PixelType, Dimension >      ImageType;\n  typedef itk::Image< float, Dimension >          FeatureImageType;\n\n  typedef itk::ScalarRegionBasedLevelSetFunctionSharedDataHelper<Dimension>      DataHelperType;\n\n\n  typedef itk::ScalarRegionBasedLevelSetFunctionTestHelper<\n    ImageType, FeatureImageType, DataHelperType >      RegionBasedLevelSetFunctionType;\n\n  RegionBasedLevelSetFunctionType::Pointer function = RegionBasedLevelSetFunctionType::New();\n\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/*\n * Factories for variable names. The key feature of a variable name is\n * that it can be indexed in a datastructure such as patricia trees by\n * providing the method index().\n *\/\n\n#include <crab\/support\/debug.hpp>\n#include <crab\/support\/os.hpp>\n#include <crab\/types\/indexable.hpp>\n\n#include <boost\/optional.hpp>\n#include <boost\/range\/iterator_range.hpp>\n\n#include <functional>\n#include <limits>\n#include <map>\n#include <memory>\n#include <unordered_map>\n#include <vector>\n\nnamespace crab {\n\n\/* T is the template parameter of var_factory_impl::variable_factory *\/\ntemplate <typename T> class variable_name_traits {\npublic:\n  static std::string to_string(T varname);\n};\n\nnamespace var_factory_impl {\n\ntemplate <typename T> class variable_factory;\n\ntemplate <class T> class indexed_varname : public indexable {\n  template <typename Any> friend class variable_factory;\n\n  using this_type = indexed_varname<T>;\n  using variable_factory_t = variable_factory<T>;\n\n  boost::optional<T> m_s;\n  ikos::index_t m_id;\n  \/\/ optional string name associated with m_id if m_s is boost::none\n  std::shared_ptr<std::string> m_name;\n  variable_factory_t *m_vfac;\n\n  indexed_varname() = delete;\n  \/\/ first constructor\n  indexed_varname(ikos::index_t id, variable_factory_t *vfac,\n                  std::string name = \"\")\n      : m_s(boost::none), m_id(id),\n        m_name(name == \"\" ? nullptr : std::make_shared<std::string>(name)),\n        m_vfac(vfac) {}\n  \/\/ second constructor\n  indexed_varname(T s, ikos::index_t id, variable_factory_t *vfac)\n      : m_s(s), m_id(id), m_name(nullptr), m_vfac(vfac) {}\n\n  std::string rename(const std::string &s) const {\n    auto it = m_vfac->get_renaming_map().find(s);\n    if (it != m_vfac->get_renaming_map().end()) {\n      return it->second;\n    } else {\n      return s;\n    }\n  }\n\npublic:\n  indexed_varname(const this_type &is) = default;\n  indexed_varname(this_type &&is) = default;\n  ~indexed_varname() = default;\n  this_type &operator=(const this_type &is) = default;\n  this_type &operator=(this_type &&is) = default;\n\n  virtual ikos::index_t index() const override { return m_id; }\n\n  std::string str() const {\n    if (m_s) {\n      return rename(crab::variable_name_traits<T>::to_string(*m_s));\n    } else if (m_name && (*m_name != \"\")) {\n      return rename(*m_name);\n    } else {\n      \/\/ unlikely prefix\n      return rename(\"@V_\" + std::to_string(m_id));\n    }\n  }\n\n  boost::optional<T> get() const { return m_s; }\n\n  variable_factory_t &get_var_factory() { return *m_vfac; }\n\n  bool operator<(const this_type &s) const { return (m_id < s.m_id); }\n\n  bool operator==(const this_type &s) const { return (m_id == s.m_id); }\n\n  virtual void write(crab_os &o) const override { o << str(); }\n\n  size_t hash() const {\n    std::hash<ikos::index_t> hasher;\n    return hasher(index());\n  }\n  \n  friend crab_os &operator<<(crab_os &o, const this_type &s) {\n    s.write(o);\n    return o;\n  }\n\n};\n\/\/ used by boost::hash_combine (no std::hash_combine in C+11)  \n\/\/template <typename T>\n\/\/inline std::size_t hash_value(const crab::var_factory_impl::indexed_varname<T>&v) {\n\/\/  return v.hash();\n\/\/}  \n} \/\/ end namespace var_factory_impl\n} \/\/ end namespace crab\n\nnamespace std {\ntemplate <typename T> struct hash<crab::var_factory_impl::indexed_varname<T>> {\n  size_t operator()(\n      const typename crab::var_factory_impl::indexed_varname<T> &v) const {\n    return v.hash();\n  }\n};\n} \/\/ end namespace std\n\nnamespace crab {\nnamespace var_factory_impl {\n\n\/\/ This variable factory (it's actually a factory of\n\/\/ indexed_varname's) creates a new indexed_variable associated to an\n\/\/ element of type T if provided. It can also create indexed_varname's\n\/\/ that are not associated to an element of type T. We call them\n\/\/ shadow variables.\n\/\/\n\/\/ The factory uses a counter of type index_t to generate variable\n\/\/ id's that always increases.\ntemplate <class T> class variable_factory {\n  using variable_factory_t = variable_factory<T>;\n  using t_map_t = std::unordered_map<T, indexed_varname<T>>;\n  using shadow_map_t =\n      std::unordered_map<indexed_varname<T>,\n                         std::map<std::string, indexed_varname<T>>>;\n  \/\/ global counter to generate indexes\n  ikos::index_t m_next_id;\n  \/\/ (cached) indexed_varname's associated with a T-instance.\n  t_map_t m_map;\n  \/\/ (non-cached) fresh indexed_varname's.\n  std::vector<indexed_varname<T>> m_shadow_vars;\n  \/\/ (cached) indexed_varname's associated with another indexed_varname.\n  shadow_map_t m_shadow_map;\n  mutable std::unordered_map<std::string, std::string> m_renaming_map;\n\n  ikos::index_t get_and_increment_id(void) {\n    if (m_next_id == std::numeric_limits<ikos::index_t>::max()) {\n      CRAB_ERROR(\"Reached limit of \", std::numeric_limits<ikos::index_t>::max(),\n                 \" variables\");\n    }\n    ikos::index_t res = m_next_id;\n    ++m_next_id;\n    return res;\n  }\n\npublic:\n  using varname_t = indexed_varname<T>;\n\n  variable_factory() : m_next_id(1) {}\n\n  virtual ~variable_factory() = default;\n\n  variable_factory(ikos::index_t start_id) : m_next_id(start_id) {}\n\n  variable_factory(const variable_factory_t &o) = delete;\n\n  variable_factory_t &operator=(const variable_factory_t &o) = delete;\n\n  virtual varname_t operator[](T s) {\n    auto it = m_map.find(s);\n    if (it == m_map.end()) {\n      varname_t iv(s, get_and_increment_id(), this);\n      m_map.insert({s, iv});\n      return iv;\n    } else {\n      return it->second;\n    }\n  }\n\n  \/\/ Generate a fresh indexed_varname's without being associated with\n  \/\/ a particular instance of T.\n  \/\/\n  \/\/ If you are an abstract domain then do not use it unless strictly\n  \/\/ necessary because it can produce an unbounded number of\n  \/\/ indexed_varname objects.\n  virtual varname_t get(std::string name = \"\") {\n    varname_t iv(get_and_increment_id(), this, name);\n    m_shadow_vars.push_back(iv);\n    return iv;\n  }\n\n  \/\/ API for abstract domains\n  \/\/\n  \/\/ Create a fresh indexed_varname associated to var.\n  \/\/ Given the same var and name it always return the same indexed_varname.\n  \/\/ The returned indexed_varname's name is var's name concatenated with name.\n  virtual varname_t get(const varname_t &var, std::string name) {\n    auto it = m_shadow_map.find(var);\n    if (it == m_shadow_map.end()) {\n      varname_t iv(get_and_increment_id(), this, var.str() + name);\n      std::map<std::string, varname_t> named_shadows;\n      named_shadows.insert({name, iv});\n      m_shadow_map.insert({var, named_shadows});\n      return iv;\n    } else {\n      std::map<std::string, varname_t> &named_shadows = it->second;\n      auto nit = named_shadows.find(name);\n      if (nit != named_shadows.end()) {\n        return nit->second;\n      } else {\n        varname_t iv(get_and_increment_id(), this, var.str() + name);\n        named_shadows.insert({name, iv});\n        return iv;\n      }\n    }\n  }\n\n  \/\/ Allow temporary renaming for pretty printing\n  void add_renaming_map(\n      const std::unordered_map<std::string, std::string> &smap) const {\n    clear_renaming_map();\n    m_renaming_map.insert(smap.begin(), smap.end());\n  }\n\n  void clear_renaming_map() const { m_renaming_map.clear(); }\n\n  const std::unordered_map<std::string, std::string> &get_renaming_map() const {\n    return m_renaming_map;\n  }\n\n  \/\/ return all the non-T variables created by the factory.  \n  virtual std::vector<varname_t> get_shadow_vars() const {\n    std::vector<varname_t> out(m_shadow_vars.begin(), m_shadow_vars.end());\n    for (auto &kv_ : m_shadow_map) {\n      for (auto &kv : kv_.second) {\n        out.push_back(varname_t(kv.second));\n      }\n    }\n    return out;\n  }\n};\n\n\/\/! Specialized factory for strings\nclass str_variable_factory : public variable_factory<std::string> {\n  using variable_factory_t = variable_factory<std::string>;\n\npublic:\n  using varname_t = typename variable_factory_t::varname_t;\n\n  str_variable_factory() : variable_factory_t() {}\n};\n\ninline int fresh_colour(int col_x, int col_y) {\n  switch (col_x) {\n  case 0:\n    return col_y == 1 ? 2 : 1;\n  case 1:\n    return col_y == 0 ? 2 : 0;\n  case 2:\n    return col_y == 0 ? 1 : 0;\n  default:\n    CRAB_ERROR(\"Unreachable\");\n  }\n}\n\n\/\/! Three-coloured variable allocation. So the number of variables\n\/\/  is bounded by 3|Tbl|, rather than always increasing.\nclass str_var_alloc_col {\n  static const char **col_prefix;\n\n  \/\/ Ideally, str_var_alloc_col should inherit from\n  \/\/ str_variable_factory.  However, we need public copy constructors\n  \/\/ for str_var_alloc_col. The hack here is to have vfac as a global\n  \/\/ factory that all str_var_alloc_col's share.\n  static str_variable_factory &get_vfac() {\n    static str_variable_factory vfac;\n    return vfac;\n  }\n\npublic:\n  using varname_t = str_variable_factory::varname_t;\n\n  str_var_alloc_col() : colour(0), next_id(0) {}\n\n  str_var_alloc_col(const str_var_alloc_col &o)\n      : colour(o.colour), next_id(o.next_id) {}\n\n  str_var_alloc_col(const str_var_alloc_col &x, const str_var_alloc_col &y)\n      : colour(fresh_colour(x.colour, y.colour)), next_id(0) {\n    assert(colour != x.colour);\n    assert(colour != y.colour);\n  }\n\n  str_var_alloc_col &operator=(const str_var_alloc_col &x) {\n    if (this != &x) {\n      colour = x.colour;\n      next_id = x.next_id;\n    }\n    return *this;\n  }\n\n  str_variable_factory::varname_t next() {\n    std::string v = col_prefix[colour] + std::to_string(next_id++);\n    return get_vfac()[v];\n  }\n\n  void add_renaming_map(\n      const std::unordered_map<std::string, std::string> &smap) const {\n    get_vfac().add_renaming_map(smap);\n  }\n\n  void clear_renaming_map() const { get_vfac().clear_renaming_map(); }\n\nprotected:\n  int colour;\n  ikos::index_t next_id;\n};\n\n\/\/\/\/ The type ikos::index_t cannot be used directly as varname_t. We\n\/\/\/\/ need a wrapper that implements index() function.\n\/\/ \/\/! Specialized factory for integers\n\/\/ class int_variable_factory {\n\/\/ public:\n\/\/   using varname_t = ikos::index_t;\n\/\/   int_variable_factory() {}\n\/\/   int_variable_factory(const int_variable_factory &o) = delete;\n\/\/   int_variable_factory &operator=(const int_variable_factory &o) = delete;\n\/\/   varname_t operator[](ikos::index_t v) { return v; }\n\/\/ };\n\/\/ class int_var_alloc_col {\n\/\/ public:\n\/\/   using varname_t = ikos::index_t;\n\/\/   static int_variable_factory vfac;\n\/\/   int_var_alloc_col() : colour(0), next_id(0) {}\n\/\/   int_var_alloc_col(const int_var_alloc_col &o)\n\/\/       : colour(o.colour), next_id(o.next_id) {}\n\/\/   int_var_alloc_col(const int_var_alloc_col &x, const int_var_alloc_col &y)\n\/\/       : colour(fresh_colour(x.colour, y.colour)), next_id(0) {\n\/\/     assert(colour != x.colour);\n\/\/     assert(colour != y.colour);\n\/\/   }\n\/\/   int_var_alloc_col &operator=(const int_var_alloc_col &x) {\n\/\/     colour = x.colour;\n\/\/     next_id = x.next_id;\n\/\/     return *this;\n\/\/   }\n\/\/   int_variable_factory::varname_t next() {\n\/\/     ikos::index_t id = next_id++;\n\/\/     return 3 * id + colour;\n\/\/   }\n\/\/ protected:\n\/\/   int colour;\n\/\/   ikos::index_t next_id;\n\/\/ };\n\n} \/\/ end namespace var_factory_impl\n} \/\/ end namespace crab\n<commit_msg>fix: expose typedef<commit_after>#pragma once\n\n\/*\n * Factories for variable names. The key feature of a variable name is\n * that it can be indexed in a datastructure such as patricia trees by\n * providing the method index().\n *\/\n\n#include <crab\/support\/debug.hpp>\n#include <crab\/support\/os.hpp>\n#include <crab\/types\/indexable.hpp>\n\n#include <boost\/optional.hpp>\n#include <boost\/range\/iterator_range.hpp>\n\n#include <functional>\n#include <limits>\n#include <map>\n#include <memory>\n#include <unordered_map>\n#include <vector>\n\nnamespace crab {\n\n\/* T is the template parameter of var_factory_impl::variable_factory *\/\ntemplate <typename T> class variable_name_traits {\npublic:\n  static std::string to_string(T varname);\n};\n\nnamespace var_factory_impl {\n\ntemplate <typename T> class variable_factory;\n\ntemplate <class T> class indexed_varname : public indexable {\n  template <typename Any> friend class variable_factory;\npublic:  \n  using variable_factory_t = variable_factory<T>;\n  \nprivate:\n  using this_type = indexed_varname<T>;\n  \n  boost::optional<T> m_s;\n  ikos::index_t m_id;\n  \/\/ optional string name associated with m_id if m_s is boost::none\n  std::shared_ptr<std::string> m_name;\n  variable_factory_t *m_vfac;\n\n  indexed_varname() = delete;\n  \/\/ first constructor\n  indexed_varname(ikos::index_t id, variable_factory_t *vfac,\n                  std::string name = \"\")\n      : m_s(boost::none), m_id(id),\n        m_name(name == \"\" ? nullptr : std::make_shared<std::string>(name)),\n        m_vfac(vfac) {}\n  \/\/ second constructor\n  indexed_varname(T s, ikos::index_t id, variable_factory_t *vfac)\n      : m_s(s), m_id(id), m_name(nullptr), m_vfac(vfac) {}\n\n  std::string rename(const std::string &s) const {\n    auto it = m_vfac->get_renaming_map().find(s);\n    if (it != m_vfac->get_renaming_map().end()) {\n      return it->second;\n    } else {\n      return s;\n    }\n  }\n\npublic:\n  indexed_varname(const this_type &is) = default;\n  indexed_varname(this_type &&is) = default;\n  ~indexed_varname() = default;\n  this_type &operator=(const this_type &is) = default;\n  this_type &operator=(this_type &&is) = default;\n\n  virtual ikos::index_t index() const override { return m_id; }\n\n  std::string str() const {\n    if (m_s) {\n      return rename(crab::variable_name_traits<T>::to_string(*m_s));\n    } else if (m_name && (*m_name != \"\")) {\n      return rename(*m_name);\n    } else {\n      \/\/ unlikely prefix\n      return rename(\"@V_\" + std::to_string(m_id));\n    }\n  }\n\n  boost::optional<T> get() const { return m_s; }\n\n  variable_factory_t &get_var_factory() { return *m_vfac; }\n\n  bool operator<(const this_type &s) const { return (m_id < s.m_id); }\n\n  bool operator==(const this_type &s) const { return (m_id == s.m_id); }\n\n  virtual void write(crab_os &o) const override { o << str(); }\n\n  size_t hash() const {\n    std::hash<ikos::index_t> hasher;\n    return hasher(index());\n  }\n  \n  friend crab_os &operator<<(crab_os &o, const this_type &s) {\n    s.write(o);\n    return o;\n  }\n\n};\n\/\/ used by boost::hash_combine (no std::hash_combine in C+11)  \n\/\/template <typename T>\n\/\/inline std::size_t hash_value(const crab::var_factory_impl::indexed_varname<T>&v) {\n\/\/  return v.hash();\n\/\/}  \n} \/\/ end namespace var_factory_impl\n} \/\/ end namespace crab\n\nnamespace std {\ntemplate <typename T> struct hash<crab::var_factory_impl::indexed_varname<T>> {\n  size_t operator()(\n      const typename crab::var_factory_impl::indexed_varname<T> &v) const {\n    return v.hash();\n  }\n};\n} \/\/ end namespace std\n\nnamespace crab {\nnamespace var_factory_impl {\n\n\/\/ This variable factory (it's actually a factory of\n\/\/ indexed_varname's) creates a new indexed_variable associated to an\n\/\/ element of type T if provided. It can also create indexed_varname's\n\/\/ that are not associated to an element of type T. We call them\n\/\/ shadow variables.\n\/\/\n\/\/ The factory uses a counter of type index_t to generate variable\n\/\/ id's that always increases.\ntemplate <class T> class variable_factory {\n  using variable_factory_t = variable_factory<T>;\n  using t_map_t = std::unordered_map<T, indexed_varname<T>>;\n  using shadow_map_t =\n      std::unordered_map<indexed_varname<T>,\n                         std::map<std::string, indexed_varname<T>>>;\n  \/\/ global counter to generate indexes\n  ikos::index_t m_next_id;\n  \/\/ (cached) indexed_varname's associated with a T-instance.\n  t_map_t m_map;\n  \/\/ (non-cached) fresh indexed_varname's.\n  std::vector<indexed_varname<T>> m_shadow_vars;\n  \/\/ (cached) indexed_varname's associated with another indexed_varname.\n  shadow_map_t m_shadow_map;\n  mutable std::unordered_map<std::string, std::string> m_renaming_map;\n\n  ikos::index_t get_and_increment_id(void) {\n    if (m_next_id == std::numeric_limits<ikos::index_t>::max()) {\n      CRAB_ERROR(\"Reached limit of \", std::numeric_limits<ikos::index_t>::max(),\n                 \" variables\");\n    }\n    ikos::index_t res = m_next_id;\n    ++m_next_id;\n    return res;\n  }\n\npublic:\n  using varname_t = indexed_varname<T>;\n\n  variable_factory() : m_next_id(1) {}\n\n  virtual ~variable_factory() = default;\n\n  variable_factory(ikos::index_t start_id) : m_next_id(start_id) {}\n\n  variable_factory(const variable_factory_t &o) = delete;\n\n  variable_factory_t &operator=(const variable_factory_t &o) = delete;\n\n  virtual varname_t operator[](T s) {\n    auto it = m_map.find(s);\n    if (it == m_map.end()) {\n      varname_t iv(s, get_and_increment_id(), this);\n      m_map.insert({s, iv});\n      return iv;\n    } else {\n      return it->second;\n    }\n  }\n\n  \/\/ Generate a fresh indexed_varname's without being associated with\n  \/\/ a particular instance of T.\n  \/\/\n  \/\/ If you are an abstract domain then do not use it unless strictly\n  \/\/ necessary because it can produce an unbounded number of\n  \/\/ indexed_varname objects.\n  virtual varname_t get(std::string name = \"\") {\n    varname_t iv(get_and_increment_id(), this, name);\n    m_shadow_vars.push_back(iv);\n    return iv;\n  }\n\n  \/\/ API for abstract domains\n  \/\/\n  \/\/ Create a fresh indexed_varname associated to var.\n  \/\/ Given the same var and name it always return the same indexed_varname.\n  \/\/ The returned indexed_varname's name is var's name concatenated with name.\n  virtual varname_t get(const varname_t &var, std::string name) {\n    auto it = m_shadow_map.find(var);\n    if (it == m_shadow_map.end()) {\n      varname_t iv(get_and_increment_id(), this, var.str() + name);\n      std::map<std::string, varname_t> named_shadows;\n      named_shadows.insert({name, iv});\n      m_shadow_map.insert({var, named_shadows});\n      return iv;\n    } else {\n      std::map<std::string, varname_t> &named_shadows = it->second;\n      auto nit = named_shadows.find(name);\n      if (nit != named_shadows.end()) {\n        return nit->second;\n      } else {\n        varname_t iv(get_and_increment_id(), this, var.str() + name);\n        named_shadows.insert({name, iv});\n        return iv;\n      }\n    }\n  }\n\n  \/\/ Allow temporary renaming for pretty printing\n  void add_renaming_map(\n      const std::unordered_map<std::string, std::string> &smap) const {\n    clear_renaming_map();\n    m_renaming_map.insert(smap.begin(), smap.end());\n  }\n\n  void clear_renaming_map() const { m_renaming_map.clear(); }\n\n  const std::unordered_map<std::string, std::string> &get_renaming_map() const {\n    return m_renaming_map;\n  }\n\n  \/\/ return all the non-T variables created by the factory.  \n  virtual std::vector<varname_t> get_shadow_vars() const {\n    std::vector<varname_t> out(m_shadow_vars.begin(), m_shadow_vars.end());\n    for (auto &kv_ : m_shadow_map) {\n      for (auto &kv : kv_.second) {\n        out.push_back(varname_t(kv.second));\n      }\n    }\n    return out;\n  }\n};\n\n\/\/! Specialized factory for strings\nclass str_variable_factory : public variable_factory<std::string> {\n  using variable_factory_t = variable_factory<std::string>;\n\npublic:\n  using varname_t = typename variable_factory_t::varname_t;\n\n  str_variable_factory() : variable_factory_t() {}\n};\n\ninline int fresh_colour(int col_x, int col_y) {\n  switch (col_x) {\n  case 0:\n    return col_y == 1 ? 2 : 1;\n  case 1:\n    return col_y == 0 ? 2 : 0;\n  case 2:\n    return col_y == 0 ? 1 : 0;\n  default:\n    CRAB_ERROR(\"Unreachable\");\n  }\n}\n\n\/\/! Three-coloured variable allocation. So the number of variables\n\/\/  is bounded by 3|Tbl|, rather than always increasing.\nclass str_var_alloc_col {\n  static const char **col_prefix;\n\n  \/\/ Ideally, str_var_alloc_col should inherit from\n  \/\/ str_variable_factory.  However, we need public copy constructors\n  \/\/ for str_var_alloc_col. The hack here is to have vfac as a global\n  \/\/ factory that all str_var_alloc_col's share.\n  static str_variable_factory &get_vfac() {\n    static str_variable_factory vfac;\n    return vfac;\n  }\n\npublic:\n  using varname_t = str_variable_factory::varname_t;\n\n  str_var_alloc_col() : colour(0), next_id(0) {}\n\n  str_var_alloc_col(const str_var_alloc_col &o)\n      : colour(o.colour), next_id(o.next_id) {}\n\n  str_var_alloc_col(const str_var_alloc_col &x, const str_var_alloc_col &y)\n      : colour(fresh_colour(x.colour, y.colour)), next_id(0) {\n    assert(colour != x.colour);\n    assert(colour != y.colour);\n  }\n\n  str_var_alloc_col &operator=(const str_var_alloc_col &x) {\n    if (this != &x) {\n      colour = x.colour;\n      next_id = x.next_id;\n    }\n    return *this;\n  }\n\n  str_variable_factory::varname_t next() {\n    std::string v = col_prefix[colour] + std::to_string(next_id++);\n    return get_vfac()[v];\n  }\n\n  void add_renaming_map(\n      const std::unordered_map<std::string, std::string> &smap) const {\n    get_vfac().add_renaming_map(smap);\n  }\n\n  void clear_renaming_map() const { get_vfac().clear_renaming_map(); }\n\nprotected:\n  int colour;\n  ikos::index_t next_id;\n};\n\n\/\/\/\/ The type ikos::index_t cannot be used directly as varname_t. We\n\/\/\/\/ need a wrapper that implements index() function.\n\/\/ \/\/! Specialized factory for integers\n\/\/ class int_variable_factory {\n\/\/ public:\n\/\/   using varname_t = ikos::index_t;\n\/\/   int_variable_factory() {}\n\/\/   int_variable_factory(const int_variable_factory &o) = delete;\n\/\/   int_variable_factory &operator=(const int_variable_factory &o) = delete;\n\/\/   varname_t operator[](ikos::index_t v) { return v; }\n\/\/ };\n\/\/ class int_var_alloc_col {\n\/\/ public:\n\/\/   using varname_t = ikos::index_t;\n\/\/   static int_variable_factory vfac;\n\/\/   int_var_alloc_col() : colour(0), next_id(0) {}\n\/\/   int_var_alloc_col(const int_var_alloc_col &o)\n\/\/       : colour(o.colour), next_id(o.next_id) {}\n\/\/   int_var_alloc_col(const int_var_alloc_col &x, const int_var_alloc_col &y)\n\/\/       : colour(fresh_colour(x.colour, y.colour)), next_id(0) {\n\/\/     assert(colour != x.colour);\n\/\/     assert(colour != y.colour);\n\/\/   }\n\/\/   int_var_alloc_col &operator=(const int_var_alloc_col &x) {\n\/\/     colour = x.colour;\n\/\/     next_id = x.next_id;\n\/\/     return *this;\n\/\/   }\n\/\/   int_variable_factory::varname_t next() {\n\/\/     ikos::index_t id = next_id++;\n\/\/     return 3 * id + colour;\n\/\/   }\n\/\/ protected:\n\/\/   int colour;\n\/\/   ikos::index_t next_id;\n\/\/ };\n\n} \/\/ end namespace var_factory_impl\n} \/\/ end namespace crab\n<|endoftext|>"}
{"text":"<commit_before>#include <sl.h>\n#include <time.h>\n#include <stdio.h>\n#include <string.h>\n#include <push.h>\n#include <hardware.h>\n\n#include \"rtss.h\"\n\n\nVOID FormatDiskReadWriteRate(\n    UINT32 Value,\n    WCHAR* Buffer\n    );\n\nVOID FormatTime(\n    UINT32 Value,\n    WCHAR* Buffer\n    );\n\ntypedef VOID(*OSD_DYNAMIC_FORMAT)(\n    UINT32 Value,\n    WCHAR* Buffer\n    );\n\n\nOSD_ITEM OsdItems[] = {\n    { OSD_GPU_LOAD, 90, L\"GPU : %i %%\", TRUE},\n    { OSD_GPU_TEMP, 75, L\"GPU : %i C\", TRUE},\n    { OSD_GPU_E_CLK, 0, L\"GPU : %i MHz\", TRUE},\n    { OSD_GPU_M_CLK, 0, L\"GPU : %i MHz\", TRUE},\n    { OSD_GPU_VRAM, 90, L\"VRAM : %i MB\", TRUE},\n    { OSD_GPU_FAN,   0, L\"GPU : %i RPM\", TRUE},\n    { OSD_RAM,      90, L\"RAM : %i MB\", TRUE},\n    { OSD_CPU_SPEED, 0, L\"CPU : %i MHz\", TRUE},\n    { OSD_CPU_LOAD, 95, L\"CPU : %i %%\", TRUE},\n    { OSD_CPU_TEMP, 75, L\"CPU : %i C\", TRUE},\n    { OSD_MCU, 0, L\"CPUm : %i %%\", TRUE},\n    { OSD_MTU, 0, L\"MTU : %i %%\", TRUE},\n    { OSD_DISK_RWRATE, 0, NULL, TRUE, NULL, NULL, FormatDiskReadWriteRate },\n    { OSD_DISK_RESPONSE, 4000, L\"DSK : %i ms\", TRUE},\n    { OSD_TIME, 0, NULL, TRUE, NULL, NULL, FormatTime },\n    { OSD_BUFFERS, 0, L\"Buffers : %i\", TRUE},\n    { OSD_RESOLUTION },\n    { OSD_FPS }\n};\n\n\nVOID GetValues( OSD_ITEM* Item )\n{\n    switch (Item->Flag)\n    {\n    case OSD_GPU_LOAD: \n        Item->Value = hardware.DisplayDevice.Load;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_GPU_TEMP: \n        Item->Value = hardware.DisplayDevice.Temperature;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_GPU_E_CLK:\n        Item->Value = NULL;\n        Item->ValueOverride = hardware.DisplayDevice.EngineClock;\n        break;\n    case OSD_GPU_M_CLK: \n        Item->Value = NULL;\n        Item->ValueOverride = hardware.DisplayDevice.MemoryClock;\n        break;\n    case OSD_GPU_VRAM: \n        Item->Value = hardware.DisplayDevice.FrameBuffer.Load;\n        Item->ValueOverride = hardware.DisplayDevice.FrameBuffer.Used;\n        break;\n    case OSD_GPU_FAN:\n        Item->Value = hardware.DisplayDevice.FanSpeed;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_RAM: \n        Item->Value = hardware.Memory.Load;\n        Item->ValueOverride = hardware.Memory.Used;\n        break;\n    case OSD_CPU_SPEED:\n        Item->Value = hardware.Processor.Speed;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_CPU_LOAD: \n        Item->Value = hardware.Processor.Load;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_CPU_TEMP: \n        Item->Value = hardware.Processor.Temperature;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_MCU: \n        Item->Value = hardware.Processor.MaxCoreUsage;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_MTU: \n        Item->Value = hardware.Processor.MaxThreadUsage;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_DISK_RWRATE: \n        Item->Value = NULL;\n        Item->ValueOverride = hardware.Disk.ReadWriteRate;\n        break;\n    case OSD_DISK_RESPONSE: \n        \/\/Item->Value = hardware.Disk.ResponseTime;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_TIME: \n        Item->Value = NULL;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_BUFFERS: \n        Item->Value = PushSharedMemory->FrameBufferCount;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_FPS:\n        Item->Value = NULL;\n        Item->ValueOverride = NULL;\n        break;\n    }\n}\n\n\nVOID FormatTime( UINT32 Value, WCHAR* Buffer )\n{\n    Push_FormatTime(Buffer);\n}\n\n\nVOID FormatDiskReadWriteRate(\n    UINT32 Value,\n    WCHAR* Buffer\n    )\n{\n    UINT32 rate;\n    WCHAR *format;\n\n    rate = Value;\n\n    format = L\"DSK : %i B\/s\";\n\n    if (rate > 1024)\n    {\n        rate \/= 1024;\/\/kB\/s\n        format = L\"DSK : %i kB\/s\";\n    }\n    if (rate > 1024)\n    {\n        rate \/= 1024;\/\/MB\/s\n        format = L\"DSK : %i MB\/s\";\n    }\n\n    swprintf(\n        Buffer,\n        20,\n        format,\n        rate\n        );\n}\n\n\n\/**\n* Refreshes all on-screen display items.\n*\/\n\nVOID OSD_Refresh()\n{\n    UINT8 items = sizeof(OsdItems) \/ sizeof(OsdItems[0]);\n    UINT8 i;\n\n    PushSharedMemory->NumberOfOsdItems = items;\n\n    \/\/ Loop and draw all on screen display items\n    for (i = 0; i < items; i++)\n    {\n        GetValues(&OsdItems[i]);\n\n        if (!OsdItems[i].Flag \/\/draw if no flag, could be somebody just wants to display stuff on-screen\n            || PushSharedMemory->OSDFlags & OsdItems[i].Flag \/\/if it has a flag, is it set?\n            || (OsdItems[i].Threshold && OsdItems[i].Value > OsdItems[i].Threshold)) \/\/is the item's value > it's threshold?\n        {\n            OsdItems[i].Color = 0xFFFFFF00;\n\n            PushSharedMemory->OSDFlags |= OsdItems[i].Flag;\n\n            \/\/ Check what type of formating user wants\n            if (OsdItems[i].DynamicFormat)\n            {\n                OsdItems[i].DynamicFormat(OsdItems[i].ValueOverride ? OsdItems[i].ValueOverride : 0, OsdItems[i].Text);\n            }\n            else if(OsdItems[i].Format)\n            {\n                swprintf(\n                    OsdItems[i].Text,\n                    20,\n                    OsdItems[i].DisplayFormat,\n                    OsdItems[i].ValueOverride ? OsdItems[i].ValueOverride : OsdItems[i].Value\n                    );\n            }\n\n            wcscat(OsdItems[i].Text, L\"\\n\");\n\n            if (PushSharedMemory->Overloads & OsdItems[i].Flag)\n                OsdItems[i].Color = 0xFFFF0000;\n        }\n    }\n\n    if (PushOverlayInterface == OVERLAY_INTERFACE_PURE)\n        memcpy(PushSharedMemory->OsdItems, OsdItems, sizeof(OsdItems));\n    else if (PushOverlayInterface == OVERLAY_INTERFACE_RTSS)\n        RTSS_Update(OsdItems);\n}<commit_msg>fixed crash when local formatting doesn't happen<commit_after>#include <sl.h>\n#include <time.h>\n#include <stdio.h>\n#include <string.h>\n#include <push.h>\n#include <hardware.h>\n\n#include \"rtss.h\"\n\n\nVOID FormatDiskReadWriteRate(\n    UINT32 Value,\n    WCHAR* Buffer\n    );\n\nVOID FormatTime(\n    UINT32 Value,\n    WCHAR* Buffer\n    );\n\ntypedef VOID(*OSD_DYNAMIC_FORMAT)(\n    UINT32 Value,\n    WCHAR* Buffer\n    );\n\n\nOSD_ITEM OsdItems[] = {\n    { OSD_GPU_LOAD, 90, L\"GPU : %i %%\", TRUE},\n    { OSD_GPU_TEMP, 75, L\"GPU : %i C\", TRUE},\n    { OSD_GPU_E_CLK, 0, L\"GPU : %i MHz\", TRUE},\n    { OSD_GPU_M_CLK, 0, L\"GPU : %i MHz\", TRUE},\n    { OSD_GPU_VRAM, 90, L\"VRAM : %i MB\", TRUE},\n    { OSD_GPU_FAN,   0, L\"GPU : %i RPM\", TRUE},\n    { OSD_RAM,      90, L\"RAM : %i MB\", TRUE},\n    { OSD_CPU_SPEED, 0, L\"CPU : %i MHz\", TRUE},\n    { OSD_CPU_LOAD, 95, L\"CPU : %i %%\", TRUE},\n    { OSD_CPU_TEMP, 75, L\"CPU : %i C\", TRUE},\n    { OSD_MCU, 0, L\"CPUm : %i %%\", TRUE},\n    { OSD_MTU, 0, L\"MTU : %i %%\", TRUE},\n    { OSD_DISK_RWRATE, 0, NULL, TRUE, NULL, NULL, FormatDiskReadWriteRate },\n    { OSD_DISK_RESPONSE, 4000, L\"DSK : %i ms\", TRUE},\n    { OSD_TIME, 0, NULL, TRUE, NULL, NULL, FormatTime },\n    { OSD_BUFFERS, 0, L\"Buffers : %i\", TRUE},\n    { OSD_RESOLUTION },\n    { OSD_FPS }\n};\n\n\nVOID GetValues( OSD_ITEM* Item )\n{\n    switch (Item->Flag)\n    {\n    case OSD_GPU_LOAD: \n        Item->Value = hardware.DisplayDevice.Load;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_GPU_TEMP: \n        Item->Value = hardware.DisplayDevice.Temperature;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_GPU_E_CLK:\n        Item->Value = NULL;\n        Item->ValueOverride = hardware.DisplayDevice.EngineClock;\n        break;\n    case OSD_GPU_M_CLK: \n        Item->Value = NULL;\n        Item->ValueOverride = hardware.DisplayDevice.MemoryClock;\n        break;\n    case OSD_GPU_VRAM: \n        Item->Value = hardware.DisplayDevice.FrameBuffer.Load;\n        Item->ValueOverride = hardware.DisplayDevice.FrameBuffer.Used;\n        break;\n    case OSD_GPU_FAN:\n        Item->Value = hardware.DisplayDevice.FanSpeed;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_RAM: \n        Item->Value = hardware.Memory.Load;\n        Item->ValueOverride = hardware.Memory.Used;\n        break;\n    case OSD_CPU_SPEED:\n        Item->Value = hardware.Processor.Speed;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_CPU_LOAD: \n        Item->Value = hardware.Processor.Load;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_CPU_TEMP: \n        Item->Value = hardware.Processor.Temperature;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_MCU: \n        Item->Value = hardware.Processor.MaxCoreUsage;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_MTU: \n        Item->Value = hardware.Processor.MaxThreadUsage;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_DISK_RWRATE: \n        Item->Value = NULL;\n        Item->ValueOverride = hardware.Disk.ReadWriteRate;\n        break;\n    case OSD_DISK_RESPONSE: \n        \/\/Item->Value = hardware.Disk.ResponseTime;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_TIME: \n        Item->Value = NULL;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_BUFFERS: \n        Item->Value = PushSharedMemory->FrameBufferCount;\n        Item->ValueOverride = NULL;\n        break;\n    case OSD_FPS:\n        Item->Value = NULL;\n        Item->ValueOverride = NULL;\n        break;\n    }\n}\n\n\nVOID FormatTime( UINT32 Value, WCHAR* Buffer )\n{\n    Push_FormatTime(Buffer);\n}\n\n\nVOID FormatDiskReadWriteRate(\n    UINT32 Value,\n    WCHAR* Buffer\n    )\n{\n    UINT32 rate;\n    WCHAR *format;\n\n    rate = Value;\n\n    format = L\"DSK : %i B\/s\";\n\n    if (rate > 1024)\n    {\n        rate \/= 1024;\/\/kB\/s\n        format = L\"DSK : %i kB\/s\";\n    }\n    if (rate > 1024)\n    {\n        rate \/= 1024;\/\/MB\/s\n        format = L\"DSK : %i MB\/s\";\n    }\n\n    swprintf(\n        Buffer,\n        20,\n        format,\n        rate\n        );\n}\n\n\n\/**\n* Refreshes all on-screen display items.\n*\/\n\nVOID OSD_Refresh()\n{\n    UINT8 items = sizeof(OsdItems) \/ sizeof(OsdItems[0]);\n    UINT8 i;\n\n    PushSharedMemory->NumberOfOsdItems = items;\n\n    \/\/ Loop and draw all on screen display items\n    for (i = 0; i < items; i++)\n    {\n        GetValues(&OsdItems[i]);\n\n        if (!OsdItems[i].Flag \/\/draw if no flag, could be somebody just wants to display stuff on-screen\n            || PushSharedMemory->OSDFlags & OsdItems[i].Flag \/\/if it has a flag, is it set?\n            || (OsdItems[i].Threshold && OsdItems[i].Value > OsdItems[i].Threshold)) \/\/is the item's value > it's threshold?\n        {\n            OsdItems[i].Color = 0xFFFFFF00;\n\n            PushSharedMemory->OSDFlags |= OsdItems[i].Flag;\n\n            if (OsdItems[i].Format || OsdItems[i].DynamicFormat)\n            {\n                if (OsdItems[i].DynamicFormat)\n                {\n                    OsdItems[i].DynamicFormat(OsdItems[i].ValueOverride ? OsdItems[i].ValueOverride : 0, OsdItems[i].Text);\n                }\n                else if (OsdItems[i].Format)\n                {\n                    swprintf(\n                        OsdItems[i].Text,\n                        20,\n                        OsdItems[i].DisplayFormat,\n                        OsdItems[i].ValueOverride ? OsdItems[i].ValueOverride : OsdItems[i].Value\n                        );\n                }\n\n                wcscat(OsdItems[i].Text, L\"\\n\");\n            }\n\n            if (PushSharedMemory->Overloads & OsdItems[i].Flag)\n            {\n                OsdItems[i].Color = 0xFFFF0000;\n            } \n        }\n    }\n\n    if (PushOverlayInterface == OVERLAY_INTERFACE_PURE)\n        memcpy(PushSharedMemory->OsdItems, OsdItems, sizeof(OsdItems));\n    else if (PushOverlayInterface == OVERLAY_INTERFACE_RTSS)\n        RTSS_Update(OsdItems);\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#ifndef DBN_CONTRASTIVE_DIVERGENCE_HPP\n#define DBN_CONTRASTIVE_DIVERGENCE_HPP\n\n#include \"assert.hpp\"\n#include \"batch.hpp\"\n\nnamespace dbn {\n\ntemplate<std::size_t K, typename RBM>\nstruct cd_trainer {\n    static_assert(K > 0, \"CD-0 is not a valid training method\");\n\n    typedef RBM rbm_t; \n\n    static constexpr const auto num_hidden = rbm_t::num_hidden;\n    static constexpr const auto num_visible = rbm_t::num_visible;\n\n    static constexpr const std::size_t num_visible_mom = rbm_t::Momentum ? num_visible : 0;\n    static constexpr const std::size_t num_hidden_mom = rbm_t::Momentum ? num_hidden : 0;\n\n    typedef typename rbm_t::weight weight;\n\n    \/\/Gradients\n    fast_matrix<weight, num_visible, num_hidden> w_grad;\n    fast_vector<weight, num_visible> vbias_grad;\n    fast_vector<weight, num_hidden> hbias_grad;\n\n    \/\/Weights and biases for momentum\n    fast_matrix<weight, num_visible_mom, num_hidden_mom> w_inc;\n    fast_vector<weight, num_visible_mom> a_inc;\n    fast_vector<weight, num_hidden_mom> b_inc;\n    \n    template<bool M = rbm_t::Momentum, typename std::enable_if<(!M), bool>::type = false>\n    cd_trainer(){\n        static_assert(!rbm_t::Momentum, \"This constructor should only be used without momentum support\");\n    }\n\n    template<bool M = rbm_t::Momentum, typename std::enable_if<(M), bool>::type = false>\n    cd_trainer() : w_inc(0.0), a_inc(0.0), b_inc(0.0) {\n        static_assert(rbm_t::Momentum, \"This constructor should only be used with momentum support\");\n    }\n\n    template<typename T>\n    double train_batch(const dbn::batch<T>& batch, RBM& rbm){\n        dbn_assert(batch.size() <= static_cast<typename dbn::batch<T>::size_type>(BatchSize), \"Invalid size\");\n        dbn_assert(batch[0].size() == num_visible, \"The size of the training sample must match visible units\");\n\n        \/\/Size of a minibatch\n        auto n_samples = static_cast<weight>(batch.size());\n\n        \/\/Clear the gradients\n        vbias_grad = 0.0;\n        hbias_grad = 0.0;\n        w_grad = 0.0;\n\n        rbm.v1 = 0.0;\n        rbm.h1_a = 0.0;\n        rbm.h1_s = 0.0;\n        rbm.h2_a = 0.0;\n        rbm.h2_s = 0.0;\n        rbm.v2_a = 0.0;\n        rbm.v2_s = 0.0;\n\n        for(auto& items : batch){\n            rbm.v1 = items;\n\n            \/\/First step\n            rbm.activate_hidden(rbm.h1_a, rbm.h1_s, rbm.v1, rbm.v1);\n\n            \/\/CD-1\n            rbm.activate_visible(rbm.h1_a, rbm.h1_s, rbm.v2_a, rbm.v2_s);\n            rbm.activate_hidden(rbm.h2_a, rbm.h2_s, rbm.v2_a, rbm.v2_s);\n\n            \/\/CD-k\n            for(std::size_t k = 1; k < K; ++k){\n                rbm.activate_visible(rbm.h2_a, rbm.h2_s, rbm.v2_a, rbm.v2_s);\n                rbm.activate_hidden(rbm.h2_a, rbm.h2_s, rbm.v2_a, rbm.v2_s);\n            }\n\n            for(size_t i = 0; i < num_visible; ++i){\n                for(size_t j = 0; j < num_hidden; ++j){\n                    w_grad(i, j) += rbm.h1_a(j) * rbm.v1(i) - rbm.h2_a(j) * rbm.v2_a(i);\n                }\n            }\n\n            vbias_grad += rbm.v1 - rbm.v2_a;\n            hbias_grad += rbm.h1_a - rbm.h2_a;\n        }\n\n        \/\/Keep only the mean of the gradients\n        w_grad \/= n_samples;\n        vbias_grad \/= n_samples;\n        hbias_grad \/= n_samples;\n\n        nan_check_3(w_grad, vbias_grad, hbias_grad);\n\n        \/\/Update weights\n        if(rbm_t::Momentum){\n            if(rbm_t::Decay){\n                w_inc = w_inc * rbm.momentum + (w_grad - (rbm.w * rbm.weight_cost)) * rbm.learning_rate;\n            } else {\n                w_inc = w_inc * rbm.momentum + w_grad * rbm.learning_rate;\n            }\n\n            rbm.w += w_inc;\n        } else {\n            if(rbm_t::Decay){\n                rbm.w += (w_grad - (rbm.w * rbm.weight_cost)) * rbm.learning_rate;\n            } else {\n                rbm.w += w_grad * rbm.learning_rate;\n            }\n        }\n\n        \/\/Update visible biases\n        if(rbm_t::Momentum){\n            a_inc = a_inc * rbm.momentum + vbias_grad * rbm.learning_rate;\n            rbm.a += a_inc;\n        } else {\n            rbm.a += vbias_grad * rbm.learning_rate;\n        }\n\n        \/\/Update hidden biases\n        if(rbm_t::Momentum){\n            b_inc = b_inc * rbm.momentum + hbias_grad * rbm.learning_rate;\n            rbm.b += b_inc;\n        } else {\n            rbm.b += hbias_grad * rbm.learning_rate;\n        }\n\n        \/\/Check for NaN\n        nan_check_3(rbm.w, rbm.a, rbm.b);\n\n        \/\/Compute the reconstruction error\n\n        weight error = 0.0;\n        for(size_t i = 0; i < num_visible; ++i){\n            error += vbias_grad(i) * vbias_grad(i);\n        }\n        error = sqrt(error \/ num_visible);\n\n        return error;\n    }\n};\n\n} \/\/end of dbn namespace\n\n#endif<commit_msg>Remove unecessary code<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#ifndef DBN_CONTRASTIVE_DIVERGENCE_HPP\n#define DBN_CONTRASTIVE_DIVERGENCE_HPP\n\n#include \"assert.hpp\"\n#include \"batch.hpp\"\n\nnamespace dbn {\n\ntemplate<std::size_t K, typename RBM>\nstruct cd_trainer {\n    static_assert(K > 0, \"CD-0 is not a valid training method\");\n\n    typedef RBM rbm_t; \n\n    static constexpr const auto num_hidden = rbm_t::num_hidden;\n    static constexpr const auto num_visible = rbm_t::num_visible;\n\n    static constexpr const std::size_t num_visible_mom = rbm_t::Momentum ? num_visible : 0;\n    static constexpr const std::size_t num_hidden_mom = rbm_t::Momentum ? num_hidden : 0;\n\n    typedef typename rbm_t::weight weight;\n\n    \/\/Gradients\n    fast_matrix<weight, num_visible, num_hidden> w_grad;\n    fast_vector<weight, num_visible> vbias_grad;\n    fast_vector<weight, num_hidden> hbias_grad;\n\n    \/\/Weights and biases for momentum\n    fast_matrix<weight, num_visible_mom, num_hidden_mom> w_inc;\n    fast_vector<weight, num_visible_mom> a_inc;\n    fast_vector<weight, num_hidden_mom> b_inc;\n    \n    template<bool M = rbm_t::Momentum, typename std::enable_if<(!M), bool>::type = false>\n    cd_trainer(){\n        static_assert(!rbm_t::Momentum, \"This constructor should only be used without momentum support\");\n    }\n\n    template<bool M = rbm_t::Momentum, typename std::enable_if<(M), bool>::type = false>\n    cd_trainer() : w_inc(0.0), a_inc(0.0), b_inc(0.0) {\n        static_assert(rbm_t::Momentum, \"This constructor should only be used with momentum support\");\n    }\n\n    template<typename T>\n    double train_batch(const dbn::batch<T>& batch, RBM& rbm){\n        dbn_assert(batch.size() <= static_cast<typename dbn::batch<T>::size_type>(BatchSize), \"Invalid size\");\n        dbn_assert(batch[0].size() == num_visible, \"The size of the training sample must match visible units\");\n\n        \/\/Size of a minibatch\n        auto n_samples = static_cast<weight>(batch.size());\n\n        \/\/Clear the gradients\n        vbias_grad = 0.0;\n        hbias_grad = 0.0;\n        w_grad = 0.0;\n\n        for(auto& items : batch){\n            rbm.v1 = items;\n\n            \/\/First step\n            rbm.activate_hidden(rbm.h1_a, rbm.h1_s, rbm.v1, rbm.v1);\n\n            \/\/CD-1\n            rbm.activate_visible(rbm.h1_a, rbm.h1_s, rbm.v2_a, rbm.v2_s);\n            rbm.activate_hidden(rbm.h2_a, rbm.h2_s, rbm.v2_a, rbm.v2_s);\n\n            \/\/CD-k\n            for(std::size_t k = 1; k < K; ++k){\n                rbm.activate_visible(rbm.h2_a, rbm.h2_s, rbm.v2_a, rbm.v2_s);\n                rbm.activate_hidden(rbm.h2_a, rbm.h2_s, rbm.v2_a, rbm.v2_s);\n            }\n\n            for(size_t i = 0; i < num_visible; ++i){\n                for(size_t j = 0; j < num_hidden; ++j){\n                    w_grad(i, j) += rbm.h1_a(j) * rbm.v1(i) - rbm.h2_a(j) * rbm.v2_a(i);\n                }\n            }\n\n            vbias_grad += rbm.v1 - rbm.v2_a;\n            hbias_grad += rbm.h1_a - rbm.h2_a;\n        }\n\n        \/\/Keep only the mean of the gradients\n        w_grad \/= n_samples;\n        vbias_grad \/= n_samples;\n        hbias_grad \/= n_samples;\n\n        nan_check_3(w_grad, vbias_grad, hbias_grad);\n\n        \/\/Update weights\n        if(rbm_t::Momentum){\n            if(rbm_t::Decay){\n                w_inc = w_inc * rbm.momentum + (w_grad - (rbm.w * rbm.weight_cost)) * rbm.learning_rate;\n            } else {\n                w_inc = w_inc * rbm.momentum + w_grad * rbm.learning_rate;\n            }\n\n            rbm.w += w_inc;\n        } else {\n            if(rbm_t::Decay){\n                rbm.w += (w_grad - (rbm.w * rbm.weight_cost)) * rbm.learning_rate;\n            } else {\n                rbm.w += w_grad * rbm.learning_rate;\n            }\n        }\n\n        \/\/Update visible biases\n        if(rbm_t::Momentum){\n            a_inc = a_inc * rbm.momentum + vbias_grad * rbm.learning_rate;\n            rbm.a += a_inc;\n        } else {\n            rbm.a += vbias_grad * rbm.learning_rate;\n        }\n\n        \/\/Update hidden biases\n        if(rbm_t::Momentum){\n            b_inc = b_inc * rbm.momentum + hbias_grad * rbm.learning_rate;\n            rbm.b += b_inc;\n        } else {\n            rbm.b += hbias_grad * rbm.learning_rate;\n        }\n\n        \/\/Check for NaN\n        nan_check_3(rbm.w, rbm.a, rbm.b);\n\n        \/\/Compute the reconstruction error\n\n        weight error = 0.0;\n        for(size_t i = 0; i < num_visible; ++i){\n            error += vbias_grad(i) * vbias_grad(i);\n        }\n        error = sqrt(error \/ num_visible);\n\n        return error;\n    }\n};\n\n} \/\/end of dbn namespace\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by david on 2019-03-09.\n\/\/\n\n\n#include <tools\/nmspc_tools.h>\n#include <state\/class_state_finite.h>\n#include <state\/class_state_infinite.h>\n#include <model\/class_model_factory.h>\n#include <simulation\/class_simulation_status.h>\n#include <simulation\/nmspc_settings.h>\n#include <general\/nmspc_tensor_extra.h>\n#include <general\/nmspc_quantum_mechanics.h>\n#include <stdexcept>\n#include <h5pp\/h5pp.h>\n\nusing Scalar    = std::complex<double>;\n\n\nbool tools::finite::io::internals::make_extendable_dataset(const std::string & prefix_path) {\n    std::string log_string = \"\/log\";  \/\/ A logged dataset is not supposed to be extended, just written once.\n    return prefix_path.find(log_string) == std::string::npos;\n}\n\n\n\n\nvoid tools::finite::io::write_all_state(const class_state_finite &state, h5pp::File & h5ppFile, const std::string & prefix_path) {\n    tools::common::profile::t_hdf.tic();\n    switch(settings::output::storage_level){\n        case StorageLevel::NONE:\n            break;\n        case StorageLevel::LIGHT:\n            write_bond_matrix(state,h5ppFile,prefix_path);\n            break;\n        case StorageLevel::NORMAL:\n            write_bond_matrices(state,h5ppFile,prefix_path);\n            break;\n        case StorageLevel::FULL:\n            write_full_mps(state,h5ppFile,prefix_path);\n            write_full_mpo(state,h5ppFile,prefix_path);\n            break;\n    }\n    h5ppFile.writeDataset(state.get_position()       ,prefix_path + \"\/state\/position\");\n    h5ppFile.writeDataset(state.get_length()         ,prefix_path + \"\/state\/sites\");\n    h5ppFile.writeDataset(settings::model::model_type,prefix_path + \"\/model\/model_type\");\n    tools::common::profile::t_hdf.toc();\n\n}\n\n\nvoid tools::finite::io::write_bond_matrices(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path)\n\/*! Writes down all the \"Lambda\" bond matrices (singular value matrices), so we can obtain the entanglement spectrum easily.\n *\/\n{\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    auto middle = (size_t) (state.get_length() \/ 2);\n    for (size_t i = 0; i < state.get_length(); i++){\n        h5ppFile.writeDataset(state.get_MPS(i).get_L(),prefix_path + \"\/state\/mps\/L_\" + std::to_string(i),extendable);\n        if (i == middle){\n            h5ppFile.writeDataset(state.midchain_bond(), prefix_path + \"\/state\/mps\/L_C\", extendable);\n        }\n    }\n    h5ppFile.writeDataset(state.get_truncation_error(), prefix_path + \"\/state\/truncation_error\",extendable);\n}\n\n\nvoid tools::finite::io::write_bond_matrix(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path)\n\/*! Writes down all the \"Lambda\" bond matrices (singular value matrices), so we can obtain the entanglement spectrum easily.\n *\/\n{\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    auto middle = (size_t) (state.get_length() \/ 2);\n    h5ppFile.writeDataset(state.get_MPS(middle).get_LC(),prefix_path + \"\/state\/mps\/L_C\",extendable);\n    h5ppFile.writeDataset(state.get_truncation_error(middle), prefix_path + \"\/state\/truncation_error\",extendable);\n}\n\nvoid tools::finite::io::write_full_mps(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path)\n\/*!\n * Writes down the full MPS in \"L-G-L-G- LC -G-L-G-L\" notation.\n *\n *\/\n{\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    write_bond_matrices(state,h5ppFile,prefix_path);\n    for (size_t i = 0; i < state.get_length(); i++){\n        h5ppFile.writeDataset(state.get_MPS(i).get_M() ,prefix_path + \"\/state\/mps\/M_\" + std::to_string(i),extendable);\n    }\n}\n\n\n\n\nvoid tools::finite::io::write_full_mpo(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path) {\n    \/\/ Write all the MPO's\n    \/\/ Remember to write tensors in row-major state order because that's what output uses.\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    for (auto site = 0ul; site < state.get_length(); site++){\n        h5ppFile.writeDataset(state.get_MPO(site).MPO(), prefix_path + \"\/state\/mpo\/H_\" + std::to_string(site),extendable);\n        \/\/Write MPO properties as attributes\n        auto values = state.get_MPO(site).get_parameter_values();\n        auto names  = state.get_MPO(site).get_parameter_names();\n        for (size_t i = 0; i < std::min(values.size(), names.size()); i++){\n            h5ppFile.writeAttributeToLink(values[i], names[i],prefix_path + \"\/state\/mpo\/H_\" + std::to_string(site));\n        }\n    }\n}\n\nvoid tools::finite::io::write_model(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path){\n    \/\/ Write down the Hamiltonian metadata as a table\n    \/\/ Remember to write tensors in row-major state order because that's what output uses.\n    if(settings::output::storage_level == StorageLevel::NONE) return;\n    Eigen::MatrixXd hamiltonian_props;\n    for (auto site = 0ul ; site < state.get_length(); site++){\n        auto props = state.get_MPO(site).get_parameter_values();\n        Eigen::ArrayXd  temp_row  = Eigen::Map<Eigen::ArrayXd> (props.data(),props.size());\n        hamiltonian_props.conservativeResize(hamiltonian_props.rows()+1, temp_row.size());\n        hamiltonian_props.bottomRows(1) = temp_row.transpose();\n    }\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    h5ppFile.writeDataset(hamiltonian_props,prefix_path + \"\/model\/Hamiltonian\",extendable);\n    int col = 0;\n    for (auto &name : state.MPO_L.front()->get_parameter_names()){\n        std::string attr_value = name;\n        std::string attr_name  = \"FIELD_\" + std::to_string(col) + \"_NAME\";\n        h5ppFile.writeAttributeToLink(attr_value, attr_name,prefix_path + \"\/model\/Hamiltonian\");\n        col++;\n    }\n}\n\nvoid tools::finite::io::write_all_measurements(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path){\n    state.do_all_measurements();\n    tools::log->trace(\"Writing all measurements...\")\n    tools::common::profile::t_hdf.tic();\n    h5ppFile.writeDataset(state.measurements.length.value()                        , prefix_path + \"\/measurements\/length\");\n    h5ppFile.writeDataset(state.measurements.norm.value()                          , prefix_path + \"\/measurements\/norm\");\n    h5ppFile.writeDataset(state.measurements.bond_dimensions.value()               , prefix_path + \"\/measurements\/bond_dimensions\");\n    h5ppFile.writeDataset(state.measurements.bond_dimension_midchain.value()       , prefix_path + \"\/measurements\/bond_dimension_midchain\");\n    h5ppFile.writeDataset(state.measurements.energy.value()                        , prefix_path + \"\/measurements\/energy\");\n    h5ppFile.writeDataset(state.measurements.energy_per_site.value()               , prefix_path + \"\/measurements\/energy_per_site\");\n    h5ppFile.writeDataset(state.measurements.energy_variance_mpo.value()           , prefix_path + \"\/measurements\/energy_variance_mpo\");\n    h5ppFile.writeDataset(state.measurements.energy_variance_per_site.value()      , prefix_path + \"\/measurements\/energy_variance_per_site\");\n    h5ppFile.writeDataset(state.measurements.entanglement_entropies.value()        , prefix_path + \"\/measurements\/entanglement_entropies\");\n    h5ppFile.writeDataset(state.measurements.entanglement_entropy_midchain.value() , prefix_path + \"\/measurements\/entanglement_entropy_midchain\");\n    h5ppFile.writeDataset(state.measurements.spin_components.value()               , prefix_path + \"\/measurements\/spin_components\");\n    h5ppFile.writeDataset(state.measurements.spin_component_sx.value()             , prefix_path + \"\/measurements\/spin_component_sx\");\n    h5ppFile.writeDataset(state.measurements.spin_component_sy.value()             , prefix_path + \"\/measurements\/spin_component_sy\");\n    h5ppFile.writeDataset(state.measurements.spin_component_sz.value()             , prefix_path + \"\/measurements\/spin_component_sz\");\n    tools::common::profile::t_hdf.toc();\n    tools::log->trace(\"Writing all measurements... OK\")\n\n}\n\n\nvoid tools::finite::io::write_projection_to_closest_parity_sector(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path, std::string parity_sector){\n    if (parity_sector == \"none\") return;\n    auto state_projected = tools::finite::ops::get_projection_to_closest_parity_sector(state, parity_sector);\n    state_projected.unset_measurements();\n    state_projected.do_all_measurements();\n    tools::log->trace(\"Variance of projected state: {:.8f}\", std::log10(tools::finite::measure::energy_variance_per_site(state_projected)));\n    tools::finite::io::write_all_state(state_projected,h5ppFile, prefix_path + \"\/projections\/\" + parity_sector);\n    tools::finite::io::write_all_measurements(state_projected,h5ppFile, prefix_path + \"\/projections\/\" + parity_sector);\n}\n\n\nvoid tools::finite::io::load_from_hdf5(const h5pp::File & h5ppFile, class_state_finite & state, class_simulation_status &sim_status, const std::string & prefix_path){\n    \/\/ Load into state\n    try{\n        sim_status = tools::common::io::load_sim_status_from_hdf5(h5ppFile,prefix_path);\n        state     = load_state_from_hdf5(h5ppFile,prefix_path);\n        state.set_sweeps(sim_status.iteration);\n        tools::finite::debug::check_integrity(state);\n    }catch(std::exception &ex){\n        throw std::runtime_error(\"Failed to load from output: \" + std::string(ex.what()));\n    }\n}\n\nclass_state_finite tools::finite::io::load_state_from_hdf5(const h5pp::File & h5ppFile, const std::string & prefix_path){\n    class_state_finite state;\n    size_t position = 0;\n    size_t sites   = 0;\n    Eigen::Tensor<Scalar,3> G;\n    Eigen::Tensor<Scalar,1> L;\n    Eigen::Tensor<Scalar,4> H;\n    Eigen::MatrixXd Hamiltonian_params;\n    std::string model_type;\n    try{\n        h5ppFile.readDataset(position             , prefix_path + \"\/state\/position\");\n        h5ppFile.readDataset(sites                , prefix_path + \"\/state\/sites\");\n        h5ppFile.readDataset(Hamiltonian_params   , prefix_path + \"\/model\/Hamiltonian\");\n        h5ppFile.readDataset(model_type           , prefix_path + \"\/model\/model_type\");\n    }catch (std::exception &ex){\n        throw std::runtime_error(\"Couldn't read necessary model parameters: \" + std::string(ex.what()));\n    }\n\n    try {\n        for(size_t i = 0; i < sites; i++){\n            h5ppFile.readDataset(G, prefix_path + \"\/state\/mps\/G_\" + std::to_string(i));\n            h5ppFile.readDataset(L, prefix_path + \"\/state\/mps\/L_\" + std::to_string(i));\n            h5ppFile.readDataset(H, prefix_path + \"\/state\/mpo\/H_\" + std::to_string(i));\n            if(i <= (size_t)position ) {\n                if(not state.MPS_L.empty() and state.MPS_L.back().get_chiR() != G.dimension(1)){\n                    throw std::runtime_error(\"Mismatch in adjacent MPS dimensions\");\n                }\n                state.MPS_L.emplace_back(G,L,i);\n                state.MPO_L.emplace_back(class_model_factory::create_mpo(i,model_type,Hamiltonian_params.row(i)));\n            }\n            else{\n                if(not state.MPS_R.empty() and state.MPS_R.back().get_chiR() != G.dimension(1)){\n                    throw std::runtime_error(\"Mismatch in adjacent MPS dimensions\");\n                }\n                state.MPS_R.emplace_back(G,L,i);\n                state.MPO_R.emplace_back(class_model_factory::create_mpo(i,model_type,Hamiltonian_params.row(i)));\n            }\n        }\n        h5ppFile.readDataset(state.midchain_bond()    , prefix_path + \"\/state\/mps\/L_C\");\n        if (state.MPS_L.size() + state.MPS_R.size() != (size_t)sites){\n            throw std::runtime_error(\"Number of sites loaded does not match the number of sites advertised by the output file\");\n        }\n        if (position != state.get_position()){\n            throw std::runtime_error(\"Position loaded does not match the position read from the output file\");\n        }\n\n    }catch (std::exception &ex){\n        throw std::runtime_error(\"Could not read MPS\/MPO tensors from file: \" + std::string(ex.what()));\n    }\n    tools::finite::mps::rebuild_environments(state);\n    return state;\n}\n<commit_msg>Projecting also when stuck<commit_after>\/\/\n\/\/ Created by david on 2019-03-09.\n\/\/\n\n\n#include <tools\/nmspc_tools.h>\n#include <state\/class_state_finite.h>\n#include <state\/class_state_infinite.h>\n#include <model\/class_model_factory.h>\n#include <simulation\/class_simulation_status.h>\n#include <simulation\/nmspc_settings.h>\n#include <general\/nmspc_tensor_extra.h>\n#include <general\/nmspc_quantum_mechanics.h>\n#include <stdexcept>\n#include <h5pp\/h5pp.h>\n\nusing Scalar    = std::complex<double>;\n\n\nbool tools::finite::io::internals::make_extendable_dataset(const std::string & prefix_path) {\n    std::string log_string = \"\/log\";  \/\/ A logged dataset is not supposed to be extended, just written once.\n    return prefix_path.find(log_string) == std::string::npos;\n}\n\n\n\n\nvoid tools::finite::io::write_all_state(const class_state_finite &state, h5pp::File & h5ppFile, const std::string & prefix_path) {\n    tools::common::profile::t_hdf.tic();\n    switch(settings::output::storage_level){\n        case StorageLevel::NONE:\n            break;\n        case StorageLevel::LIGHT:\n            write_bond_matrix(state,h5ppFile,prefix_path);\n            break;\n        case StorageLevel::NORMAL:\n            write_bond_matrices(state,h5ppFile,prefix_path);\n            break;\n        case StorageLevel::FULL:\n            write_full_mps(state,h5ppFile,prefix_path);\n            write_full_mpo(state,h5ppFile,prefix_path);\n            break;\n    }\n    h5ppFile.writeDataset(state.get_position()       ,prefix_path + \"\/state\/position\");\n    h5ppFile.writeDataset(state.get_length()         ,prefix_path + \"\/state\/sites\");\n    h5ppFile.writeDataset(settings::model::model_type,prefix_path + \"\/model\/model_type\");\n    tools::common::profile::t_hdf.toc();\n\n}\n\n\nvoid tools::finite::io::write_bond_matrices(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path)\n\/*! Writes down all the \"Lambda\" bond matrices (singular value matrices), so we can obtain the entanglement spectrum easily.\n *\/\n{\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    auto middle = (size_t) (state.get_length() \/ 2);\n    for (size_t i = 0; i < state.get_length(); i++){\n        h5ppFile.writeDataset(state.get_MPS(i).get_L(),prefix_path + \"\/state\/mps\/L_\" + std::to_string(i),extendable);\n        if (i == middle){\n            h5ppFile.writeDataset(state.midchain_bond(), prefix_path + \"\/state\/mps\/L_C\", extendable);\n        }\n    }\n    h5ppFile.writeDataset(state.get_truncation_error(), prefix_path + \"\/state\/truncation_error\",extendable);\n}\n\n\nvoid tools::finite::io::write_bond_matrix(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path)\n\/*! Writes down all the \"Lambda\" bond matrices (singular value matrices), so we can obtain the entanglement spectrum easily.\n *\/\n{\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    auto middle = (size_t) (state.get_length() \/ 2);\n    h5ppFile.writeDataset(state.get_MPS(middle).get_LC(),prefix_path + \"\/state\/mps\/L_C\",extendable);\n    h5ppFile.writeDataset(state.get_truncation_error(middle), prefix_path + \"\/state\/truncation_error\",extendable);\n}\n\nvoid tools::finite::io::write_full_mps(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path)\n\/*!\n * Writes down the full MPS in \"L-G-L-G- LC -G-L-G-L\" notation.\n *\n *\/\n{\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    write_bond_matrices(state,h5ppFile,prefix_path);\n    for (size_t i = 0; i < state.get_length(); i++){\n        h5ppFile.writeDataset(state.get_MPS(i).get_M() ,prefix_path + \"\/state\/mps\/M_\" + std::to_string(i),extendable);\n    }\n}\n\n\n\n\nvoid tools::finite::io::write_full_mpo(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path) {\n    \/\/ Write all the MPO's\n    \/\/ Remember to write tensors in row-major state order because that's what output uses.\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    for (auto site = 0ul; site < state.get_length(); site++){\n        h5ppFile.writeDataset(state.get_MPO(site).MPO(), prefix_path + \"\/state\/mpo\/H_\" + std::to_string(site),extendable);\n        \/\/Write MPO properties as attributes\n        auto values = state.get_MPO(site).get_parameter_values();\n        auto names  = state.get_MPO(site).get_parameter_names();\n        for (size_t i = 0; i < std::min(values.size(), names.size()); i++){\n            h5ppFile.writeAttributeToLink(values[i], names[i],prefix_path + \"\/state\/mpo\/H_\" + std::to_string(site));\n        }\n    }\n}\n\nvoid tools::finite::io::write_model(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path){\n    \/\/ Write down the Hamiltonian metadata as a table\n    \/\/ Remember to write tensors in row-major state order because that's what output uses.\n    if(settings::output::storage_level == StorageLevel::NONE) return;\n    Eigen::MatrixXd hamiltonian_props;\n    for (auto site = 0ul ; site < state.get_length(); site++){\n        auto props = state.get_MPO(site).get_parameter_values();\n        Eigen::ArrayXd  temp_row  = Eigen::Map<Eigen::ArrayXd> (props.data(),props.size());\n        hamiltonian_props.conservativeResize(hamiltonian_props.rows()+1, temp_row.size());\n        hamiltonian_props.bottomRows(1) = temp_row.transpose();\n    }\n    bool extendable = internals::make_extendable_dataset(prefix_path);\n    h5ppFile.writeDataset(hamiltonian_props,prefix_path + \"\/model\/Hamiltonian\",extendable);\n    int col = 0;\n    for (auto &name : state.MPO_L.front()->get_parameter_names()){\n        std::string attr_value = name;\n        std::string attr_name  = \"FIELD_\" + std::to_string(col) + \"_NAME\";\n        h5ppFile.writeAttributeToLink(attr_value, attr_name,prefix_path + \"\/model\/Hamiltonian\");\n        col++;\n    }\n}\n\nvoid tools::finite::io::write_all_measurements(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path){\n    state.do_all_measurements();\n    tools::log->trace(\"Writing all measurements...\");\n    tools::common::profile::t_hdf.tic();\n    h5ppFile.writeDataset(state.measurements.length.value()                        , prefix_path + \"\/measurements\/length\");\n    h5ppFile.writeDataset(state.measurements.norm.value()                          , prefix_path + \"\/measurements\/norm\");\n    h5ppFile.writeDataset(state.measurements.bond_dimensions.value()               , prefix_path + \"\/measurements\/bond_dimensions\");\n    h5ppFile.writeDataset(state.measurements.bond_dimension_midchain.value()       , prefix_path + \"\/measurements\/bond_dimension_midchain\");\n    h5ppFile.writeDataset(state.measurements.energy.value()                        , prefix_path + \"\/measurements\/energy\");\n    h5ppFile.writeDataset(state.measurements.energy_per_site.value()               , prefix_path + \"\/measurements\/energy_per_site\");\n    h5ppFile.writeDataset(state.measurements.energy_variance_mpo.value()           , prefix_path + \"\/measurements\/energy_variance_mpo\");\n    h5ppFile.writeDataset(state.measurements.energy_variance_per_site.value()      , prefix_path + \"\/measurements\/energy_variance_per_site\");\n    h5ppFile.writeDataset(state.measurements.entanglement_entropies.value()        , prefix_path + \"\/measurements\/entanglement_entropies\");\n    h5ppFile.writeDataset(state.measurements.entanglement_entropy_midchain.value() , prefix_path + \"\/measurements\/entanglement_entropy_midchain\");\n    h5ppFile.writeDataset(state.measurements.spin_components.value()               , prefix_path + \"\/measurements\/spin_components\");\n    h5ppFile.writeDataset(state.measurements.spin_component_sx.value()             , prefix_path + \"\/measurements\/spin_component_sx\");\n    h5ppFile.writeDataset(state.measurements.spin_component_sy.value()             , prefix_path + \"\/measurements\/spin_component_sy\");\n    h5ppFile.writeDataset(state.measurements.spin_component_sz.value()             , prefix_path + \"\/measurements\/spin_component_sz\");\n    tools::common::profile::t_hdf.toc();\n    tools::log->trace(\"Writing all measurements... OK\");\n\n}\n\n\nvoid tools::finite::io::write_projection_to_closest_parity_sector(const class_state_finite & state, h5pp::File & h5ppFile, const std::string & prefix_path, std::string parity_sector){\n    if (parity_sector == \"none\") return;\n    auto state_projected = tools::finite::ops::get_projection_to_closest_parity_sector(state, parity_sector);\n    state_projected.unset_measurements();\n    state_projected.do_all_measurements();\n    tools::log->trace(\"Variance of projected state: {:.8f}\", std::log10(tools::finite::measure::energy_variance_per_site(state_projected)));\n    tools::finite::io::write_all_state(state_projected,h5ppFile, prefix_path + \"\/projections\/\" + parity_sector);\n    tools::finite::io::write_all_measurements(state_projected,h5ppFile, prefix_path + \"\/projections\/\" + parity_sector);\n}\n\n\nvoid tools::finite::io::load_from_hdf5(const h5pp::File & h5ppFile, class_state_finite & state, class_simulation_status &sim_status, const std::string & prefix_path){\n    \/\/ Load into state\n    try{\n        sim_status = tools::common::io::load_sim_status_from_hdf5(h5ppFile,prefix_path);\n        state     = load_state_from_hdf5(h5ppFile,prefix_path);\n        state.set_sweeps(sim_status.iteration);\n        tools::finite::debug::check_integrity(state);\n    }catch(std::exception &ex){\n        throw std::runtime_error(\"Failed to load from output: \" + std::string(ex.what()));\n    }\n}\n\nclass_state_finite tools::finite::io::load_state_from_hdf5(const h5pp::File & h5ppFile, const std::string & prefix_path){\n    class_state_finite state;\n    size_t position = 0;\n    size_t sites   = 0;\n    Eigen::Tensor<Scalar,3> G;\n    Eigen::Tensor<Scalar,1> L;\n    Eigen::Tensor<Scalar,4> H;\n    Eigen::MatrixXd Hamiltonian_params;\n    std::string model_type;\n    try{\n        h5ppFile.readDataset(position             , prefix_path + \"\/state\/position\");\n        h5ppFile.readDataset(sites                , prefix_path + \"\/state\/sites\");\n        h5ppFile.readDataset(Hamiltonian_params   , prefix_path + \"\/model\/Hamiltonian\");\n        h5ppFile.readDataset(model_type           , prefix_path + \"\/model\/model_type\");\n    }catch (std::exception &ex){\n        throw std::runtime_error(\"Couldn't read necessary model parameters: \" + std::string(ex.what()));\n    }\n\n    try {\n        for(size_t i = 0; i < sites; i++){\n            h5ppFile.readDataset(G, prefix_path + \"\/state\/mps\/G_\" + std::to_string(i));\n            h5ppFile.readDataset(L, prefix_path + \"\/state\/mps\/L_\" + std::to_string(i));\n            h5ppFile.readDataset(H, prefix_path + \"\/state\/mpo\/H_\" + std::to_string(i));\n            if(i <= (size_t)position ) {\n                if(not state.MPS_L.empty() and state.MPS_L.back().get_chiR() != G.dimension(1)){\n                    throw std::runtime_error(\"Mismatch in adjacent MPS dimensions\");\n                }\n                state.MPS_L.emplace_back(G,L,i);\n                state.MPO_L.emplace_back(class_model_factory::create_mpo(i,model_type,Hamiltonian_params.row(i)));\n            }\n            else{\n                if(not state.MPS_R.empty() and state.MPS_R.back().get_chiR() != G.dimension(1)){\n                    throw std::runtime_error(\"Mismatch in adjacent MPS dimensions\");\n                }\n                state.MPS_R.emplace_back(G,L,i);\n                state.MPO_R.emplace_back(class_model_factory::create_mpo(i,model_type,Hamiltonian_params.row(i)));\n            }\n        }\n        h5ppFile.readDataset(state.midchain_bond()    , prefix_path + \"\/state\/mps\/L_C\");\n        if (state.MPS_L.size() + state.MPS_R.size() != (size_t)sites){\n            throw std::runtime_error(\"Number of sites loaded does not match the number of sites advertised by the output file\");\n        }\n        if (position != state.get_position()){\n            throw std::runtime_error(\"Position loaded does not match the position read from the output file\");\n        }\n\n    }catch (std::exception &ex){\n        throw std::runtime_error(\"Could not read MPS\/MPO tensors from file: \" + std::string(ex.what()));\n    }\n    tools::finite::mps::rebuild_environments(state);\n    return state;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <Doremi\/Core\/Include\/PlayerSpawnerHandler.hpp>\n#include <Doremi\/Core\/Include\/EventHandler\/Events\/TriggerEvent.hpp>\n#include <Doremi\/Core\/Include\/EntityComponent\/Components\/TransformComponent.hpp>\n#include <DoremiEngine\/Physics\/Include\/PhysicsModule.hpp>\n#include <DoremiEngine\/Physics\/Include\/CharacterControlManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/RigidBodyManager.hpp>\n#include <Doremi\/Core\/Include\/EntityComponent\/EntityHandler.hpp>\n#include <Doremi\/Core\/Include\/EventHandler\/Events\/PlayerRespawnEvent.hpp>\n#include <Doremi\/Core\/Include\/EventHandler\/EventHandler.hpp>\n#include <iostream>\n\nnamespace Doremi\n{\n    namespace Core\n    {\n        PlayerSpawnerHandler* PlayerSpawnerHandler::m_singleton = nullptr;\n\n        PlayerSpawnerHandler* PlayerSpawnerHandler::GetInstance()\n        {\n            if(m_singleton == nullptr)\n            {\n                std::cout << \"Called GetInstance befor StartupPlayerSpawnerHandler was called\" << std::endl;\n            }\n            return m_singleton;\n        }\n\n        void PlayerSpawnerHandler::StartupPlayerSpawnerHandler(const DoremiEngine::Core::SharedContext& p_sharedContext)\n        {\n            if(m_singleton != nullptr)\n            {\n                std::runtime_error(\"StartupPlayerSpawnerHandler was called\");\n            }\n            m_singleton = new PlayerSpawnerHandler(p_sharedContext);\n        }\n\n        PlayerSpawnerHandler::PlayerSpawnerHandler(const DoremiEngine::Core::SharedContext& p_sharedContext) : m_sharedContext(p_sharedContext)\n        {\n            EventHandler::GetInstance()->Subscribe(EventType::Trigger, this);\n        }\n\n        PlayerSpawnerHandler::~PlayerSpawnerHandler() {}\n\n        EntityID PlayerSpawnerHandler::GetCurrentSpawnerEntityID() { return m_currentPlayerSpawner; }\n\n        void PlayerSpawnerHandler::SetCurrentSpawner(EntityID p_entityID) { m_currentPlayerSpawner = p_entityID; }\n\n        void PlayerSpawnerHandler::RespawnPlayer(EntityID p_entityID)\n        {\n            DoremiEngine::Physics::CharacterControlManager& t_characterBodyManager = m_sharedContext.GetPhysicsModule().GetCharacterControlManager();\n            DoremiEngine::Physics::RigidBodyManager& t_rigidBodyManager = m_sharedContext.GetPhysicsModule().GetRigidBodyManager();\n\n            \/\/ Get position and orientation of the trigger..\n            DirectX::XMFLOAT3 t_triggerPosition = t_rigidBodyManager.GetBodyPosition(m_currentPlayerSpawner);\n            DirectX::XMFLOAT4 t_triggerOrientation = t_rigidBodyManager.GetBodyOrientation(m_currentPlayerSpawner);\n\n            \/\/ ..and set it to the players position, orientation\n            t_characterBodyManager.SetPosition(p_entityID, t_triggerPosition);\n\n            \/\/ Since we don't know if this will be called befor sync or not, we set it to the transform as well\n            TransformComponent* t_transComp = GetComponent<TransformComponent>(p_entityID);\n            t_transComp->position = t_triggerPosition;\n            t_transComp->rotation = t_triggerOrientation;\n\n            \/\/ Create event for other purposes\n            PlayerRespawnEvent* t_playerRespawn = new PlayerRespawnEvent(p_entityID, t_triggerPosition, t_triggerOrientation);\n            EventHandler::GetInstance()->BroadcastEvent(t_playerRespawn);\n        }\n\n        void PlayerSpawnerHandler::OnEvent(Event* p_event)\n        {\n            if(p_event->eventType == EventType::Trigger)\n            {\n                TriggerEvent* t_triggEvent = static_cast<TriggerEvent*>(p_event);\n\n                \/\/ If spawn point trigger\n                if(t_triggEvent->triggerType == TriggerType::NewSpawnPointTrigger)\n                {\n                    \/\/ Could get who got the spawner here as well? If we want player specific spawners\n                    m_currentPlayerSpawner = t_triggEvent->triggerEntityID;\n                }\n            }\n        }\n    }\n}<commit_msg>Commented nonfunctional spawnpoint change<commit_after>#include <Doremi\/Core\/Include\/PlayerSpawnerHandler.hpp>\n#include <Doremi\/Core\/Include\/EventHandler\/Events\/TriggerEvent.hpp>\n#include <Doremi\/Core\/Include\/EntityComponent\/Components\/TransformComponent.hpp>\n#include <DoremiEngine\/Physics\/Include\/PhysicsModule.hpp>\n#include <DoremiEngine\/Physics\/Include\/CharacterControlManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/RigidBodyManager.hpp>\n#include <Doremi\/Core\/Include\/EntityComponent\/EntityHandler.hpp>\n#include <Doremi\/Core\/Include\/EventHandler\/Events\/PlayerRespawnEvent.hpp>\n#include <Doremi\/Core\/Include\/EventHandler\/EventHandler.hpp>\n#include <iostream>\n\nnamespace Doremi\n{\n    namespace Core\n    {\n        PlayerSpawnerHandler* PlayerSpawnerHandler::m_singleton = nullptr;\n\n        PlayerSpawnerHandler* PlayerSpawnerHandler::GetInstance()\n        {\n            if(m_singleton == nullptr)\n            {\n                std::cout << \"Called GetInstance befor StartupPlayerSpawnerHandler was called\" << std::endl;\n            }\n            return m_singleton;\n        }\n\n        void PlayerSpawnerHandler::StartupPlayerSpawnerHandler(const DoremiEngine::Core::SharedContext& p_sharedContext)\n        {\n            if(m_singleton != nullptr)\n            {\n                std::runtime_error(\"StartupPlayerSpawnerHandler was called\");\n            }\n            m_singleton = new PlayerSpawnerHandler(p_sharedContext);\n        }\n\n        PlayerSpawnerHandler::PlayerSpawnerHandler(const DoremiEngine::Core::SharedContext& p_sharedContext) : m_sharedContext(p_sharedContext)\n        {\n            EventHandler::GetInstance()->Subscribe(EventType::Trigger, this);\n        }\n\n        PlayerSpawnerHandler::~PlayerSpawnerHandler() {}\n\n        EntityID PlayerSpawnerHandler::GetCurrentSpawnerEntityID() { return m_currentPlayerSpawner; }\n\n        void PlayerSpawnerHandler::SetCurrentSpawner(EntityID p_entityID) { m_currentPlayerSpawner = p_entityID; }\n\n        void PlayerSpawnerHandler::RespawnPlayer(EntityID p_entityID)\n        {\n            DoremiEngine::Physics::CharacterControlManager& t_characterBodyManager = m_sharedContext.GetPhysicsModule().GetCharacterControlManager();\n            DoremiEngine::Physics::RigidBodyManager& t_rigidBodyManager = m_sharedContext.GetPhysicsModule().GetRigidBodyManager();\n\n            \/\/ Get position and orientation of the trigger..\n            DirectX::XMFLOAT3 t_triggerPosition = t_rigidBodyManager.GetBodyPosition(m_currentPlayerSpawner);\n            DirectX::XMFLOAT4 t_triggerOrientation = t_rigidBodyManager.GetBodyOrientation(m_currentPlayerSpawner);\n\n            \/\/ ..and set it to the players position, orientation\n            t_characterBodyManager.SetPosition(p_entityID, t_triggerPosition);\n\n            \/\/ Since we don't know if this will be called befor sync or not, we set it to the transform as well\n            TransformComponent* t_transComp = GetComponent<TransformComponent>(p_entityID);\n            t_transComp->position = t_triggerPosition;\n            t_transComp->rotation = t_triggerOrientation;\n\n            \/\/ Create event for other purposes\n            PlayerRespawnEvent* t_playerRespawn = new PlayerRespawnEvent(p_entityID, t_triggerPosition, t_triggerOrientation);\n            EventHandler::GetInstance()->BroadcastEvent(t_playerRespawn);\n        }\n\n        void PlayerSpawnerHandler::OnEvent(Event* p_event)\n        {\n            \/\/ if(p_event->eventType == EventType::Trigger)\n            \/\/{\n            \/\/    TriggerEvent* t_triggEvent = static_cast<TriggerEvent*>(p_event);\n\n            \/\/    \/\/ If spawn point trigger\n            \/\/    if(t_triggEvent->triggerType == TriggerType::NewSpawnPointTrigger)\n            \/\/    {\n            \/\/        \/\/ Could get who got the spawner here as well? If we want player specific spawners\n            \/\/        m_currentPlayerSpawner = t_triggEvent->triggerEntityID;\n            \/\/    }\n            \/\/}\n        }\n    }\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Host based encapsulated base sweeper.\n *\/\n\n#ifndef _PFASST_ENCAPSULATED_HPP_\n#define _PFASST_ENCAPSULATED_HPP_\n\n#include <vector>\n#include <memory>\n\n#include \"..\/interfaces.hpp\"\n#include \"..\/quadrature.hpp\"\n\nusing namespace std;\n\nnamespace pfasst\n{\n  namespace encap\n  {\n\n    typedef enum EncapType { solution, function } EncapType;\n\n    \/**\n     * basic encapsulation.\n     *\n     * An Encapsulation provides basic functionality of the user data used by PFASST such as\n     * mathematical operation @em axpy \\\\(y=ax+y\\\\) and packing\/unpacking for message passing.\n     * @tparam time time precision\n     *     defaults to pfasst::time_precision\n     *\/\n    template<typename time = time_precision>\n    class Encapsulation\n    {\n      public:\n        \/\/! @{\n        virtual ~Encapsulation() { }\n        \/\/! @}\n\n        \/\/! @{\n        \/\/ required for time-parallel communications\n        virtual void send()\n        {\n          throw NotImplementedYet(\"pfasst\");\n        }\n        virtual void recv()\n        {\n          throw NotImplementedYet(\"pfasst\");\n        }\n        \/\/! @}\n\n        \/\/! @{\n        \/\/ required for host based encap helpers\n        virtual void zero()\n        {\n          throw NotImplementedYet(\"encap\");\n        }\n        virtual void copy(shared_ptr<const Encapsulation<time>>)\n        {\n          throw NotImplementedYet(\"encap\");\n        }\n        \/\/! @}\n\n        \/\/! @{\n        \/**\n         * provides basic mathematical operation \\\\(y+=ax\\\\).\n         *\n         * This is the main mathematical operation applied by PFASST on the data structures.\n         * Here, \\\\(a\\\\) is a time point and \\\\(x\\\\) another data structure (usually of the\n         * same type).\n         *\/\n        virtual void saxpy(time \/*a*\/, shared_ptr<const Encapsulation<time>> \/*x*\/)\n        {\n          throw NotImplementedYet(\"encap\");\n        }\n\n        \/**\n         * defines matrix-vector multiplication for this data type.\n         *\/\n        virtual void mat_apply(vector<shared_ptr<Encapsulation<time>>> dst, time a, matrix<time> mat,\n\t\t\t       vector<shared_ptr<Encapsulation<time>>> src, bool zero = true)\n        {\n          size_t ndst = dst.size();\n          size_t nsrc = src.size();\n\n          if (zero) {\n\t    for (auto elem : dst) { elem->zero(); }\n\t  }\n\n\t  for (size_t n = 0; n < ndst; n++) {\n\t    for (size_t m = 0; m < nsrc; m++) {\n\t      auto s = mat(n, m);\n\t      if (s != 0.0) {\n\t\tdst[n]->saxpy(a*s, src[m]);\n\t      }\n            }\n          }\n        }\n        \/\/! @}\n    };\n\n    template<typename time = time_precision>\n    class EncapFactory\n    {\n      public:\n        virtual shared_ptr<Encapsulation<time>> create(const EncapType) = 0;\n    };\n\n  }\n}\n\n#endif\n<commit_msg>Untabify.<commit_after>\/*\n * Host based encapsulated base sweeper.\n *\/\n\n#ifndef _PFASST_ENCAPSULATED_HPP_\n#define _PFASST_ENCAPSULATED_HPP_\n\n#include <vector>\n#include <memory>\n\n#include \"..\/interfaces.hpp\"\n#include \"..\/quadrature.hpp\"\n\nusing namespace std;\n\nnamespace pfasst\n{\n  namespace encap\n  {\n\n    typedef enum EncapType { solution, function } EncapType;\n\n    \/**\n     * basic encapsulation.\n     *\n     * An Encapsulation provides basic functionality of the user data used by PFASST such as\n     * mathematical operation @em axpy \\\\(y=ax+y\\\\) and packing\/unpacking for message passing.\n     * @tparam time time precision\n     *     defaults to pfasst::time_precision\n     *\/\n    template<typename time = time_precision>\n    class Encapsulation\n    {\n      public:\n        \/\/! @{\n        virtual ~Encapsulation() { }\n        \/\/! @}\n\n        \/\/! @{\n        \/\/ required for time-parallel communications\n        virtual void send()\n        {\n          throw NotImplementedYet(\"pfasst\");\n        }\n        virtual void recv()\n        {\n          throw NotImplementedYet(\"pfasst\");\n        }\n        \/\/! @}\n\n        \/\/! @{\n        \/\/ required for host based encap helpers\n        virtual void zero()\n        {\n          throw NotImplementedYet(\"encap\");\n        }\n        virtual void copy(shared_ptr<const Encapsulation<time>>)\n        {\n          throw NotImplementedYet(\"encap\");\n        }\n        \/\/! @}\n\n        \/\/! @{\n        \/**\n         * provides basic mathematical operation \\\\(y+=ax\\\\).\n         *\n         * This is the main mathematical operation applied by PFASST on the data structures.\n         * Here, \\\\(a\\\\) is a time point and \\\\(x\\\\) another data structure (usually of the\n         * same type).\n         *\/\n        virtual void saxpy(time \/*a*\/, shared_ptr<const Encapsulation<time>> \/*x*\/)\n        {\n          throw NotImplementedYet(\"encap\");\n        }\n\n        \/**\n         * defines matrix-vector multiplication for this data type.\n         *\/\n        virtual void mat_apply(vector<shared_ptr<Encapsulation<time>>> dst, time a, matrix<time> mat,\n                               vector<shared_ptr<Encapsulation<time>>> src, bool zero = true)\n        {\n          size_t ndst = dst.size();\n          size_t nsrc = src.size();\n\n          if (zero) {\n            for (auto elem : dst) { elem->zero(); }\n          }\n\n          for (size_t n = 0; n < ndst; n++) {\n            for (size_t m = 0; m < nsrc; m++) {\n              auto s = mat(n, m);\n              if (s != 0.0) {\n                dst[n]->saxpy(a*s, src[m]);\n              }\n            }\n          }\n        }\n        \/\/! @}\n    };\n\n    template<typename time = time_precision>\n    class EncapFactory\n    {\n      public:\n        virtual shared_ptr<Encapsulation<time>> create(const EncapType) = 0;\n    };\n\n  }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * cookie.hpp\n *\n *  Created on: Aug 26, 2015\n *      Author: zmij\n *\/\n\n#ifndef PUSHKIN_HTTP_COMMON_COOKIE_HPP_\n#define PUSHKIN_HTTP_COMMON_COOKIE_HPP_\n\n#include <string>\n#include <vector>\n\n#include <boost\/date_time.hpp>\n#include <boost\/optional.hpp>\n\n#include <tip\/iri.hpp>\n\nnamespace psst {\nnamespace http {\n\nstruct cookie {\n\tusing host_opt      = ::boost::optional< ::tip::iri::host >;\n\tusing path_opt      = ::boost::optional< ::tip::iri::path >;\n\tusing int_opt       = ::boost::optional< ::std::int32_t >;\n\tusing datetime_type = ::boost::posix_time::ptime;\n\tusing datetime_opt  = ::boost::optional< datetime_type>;\n\n\t::std::string\tname;\n\t::std::string\tvalue;\n\n\tdatetime_opt\texpires;\n\tint_opt\t\t\tmax_age;\n\thost_opt\t\tdomain;\n\tpath_opt\t\tpath;\n\tbool\t\t\tsecure;\n\tbool\t\t\thttp_only;\n};\n\nstruct cookie_name_cmp {\n\tbool\n\toperator()(cookie const& lhs, cookie const& rhs)\n\t{\n\t\treturn lhs.name < rhs.name;\n\t}\n};\n\n\/\/ TODO multiset?\nusing request_cookies = ::std::vector<cookie>;\n\n}  \/\/ namespace http\n}  \/\/ namespace psst\n\n\n#endif \/* PUSHKIN_HTTP_COMMON_COOKIE_HPP_ *\/\n<commit_msg>[build] Fix const compatator warning<commit_after>\/*\n * cookie.hpp\n *\n *  Created on: Aug 26, 2015\n *      Author: zmij\n *\/\n\n#ifndef PUSHKIN_HTTP_COMMON_COOKIE_HPP_\n#define PUSHKIN_HTTP_COMMON_COOKIE_HPP_\n\n#include <string>\n#include <vector>\n\n#include <boost\/date_time.hpp>\n#include <boost\/optional.hpp>\n\n#include <tip\/iri.hpp>\n\nnamespace psst {\nnamespace http {\n\nstruct cookie {\n\tusing host_opt      = ::boost::optional< ::tip::iri::host >;\n\tusing path_opt      = ::boost::optional< ::tip::iri::path >;\n\tusing int_opt       = ::boost::optional< ::std::int32_t >;\n\tusing datetime_type = ::boost::posix_time::ptime;\n\tusing datetime_opt  = ::boost::optional< datetime_type>;\n\n\t::std::string\tname;\n\t::std::string\tvalue;\n\n\tdatetime_opt\texpires;\n\tint_opt\t\t\tmax_age;\n\thost_opt\t\tdomain;\n\tpath_opt\t\tpath;\n\tbool\t\t\tsecure;\n\tbool\t\t\thttp_only;\n};\n\nstruct cookie_name_cmp {\n\tbool\n\toperator()(cookie const& lhs, cookie const& rhs) const\n\t{\n\t\treturn lhs.name < rhs.name;\n\t}\n};\n\n\/\/ TODO multiset?\nusing request_cookies = ::std::vector<cookie>;\n\n}  \/\/ namespace http\n}  \/\/ namespace psst\n\n\n#endif \/* PUSHKIN_HTTP_COMMON_COOKIE_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _INCLUDED_LZW_DEBUG_CODER_HPP_\n#define _INCLUDED_LZW_DEBUG_CODER_HPP_\n\n#include <tudocomp\/Coder.hpp>\n\n#include <tudocomp\/lz78\/trie.h>\n#include <tudocomp\/lz78\/Lz78DecodeBuffer.hpp>\n\n#include <tudocomp\/lzw\/factor.h>\n\nnamespace tudocomp {\n\nnamespace lzw {\n\nusing ::lzw::LzwEntry;\n\n\/**\n * Encodes factors as simple strings.\n *\/\nclass LzwDebugCoder {\nprivate:\n    \/\/ TODO: Change encode_* methods to not take Output& since that inital setup\n    \/\/ rather, have a single init location\n    tudocomp::output::StreamGuard m_out;\n\npublic:\n    inline LzwDebugCoder(Env& env, Output& out)\n        : m_out(out.as_stream())\n    {\n    }\n\n    inline LzwDebugCoder(Env& env, Output& out, size_t len)\n        : m_out(out.as_stream())\n    {\n    }\n\n    inline ~LzwDebugCoder() {\n        (*m_out).flush();\n    }\n\n    inline void encode_sym(uint8_t sym) {\n        throw std::runtime_error(\"encoder does not support encoding raw symbols\");\n    }\n\n    inline void encode_fact(const LzwEntry& entry) {\n        if (entry >= 32u && entry <= 127u) {\n            (*m_out) << \"'\" << char(uint8_t(entry)) << \"',\";\n        } else {\n            (*m_out) << uint64_t(entry) << \",\";\n        }\n    }\n\n    inline static void decode(Input& _inp, Output& _out) {\n        auto iguard = _inp.as_stream();\n        auto oguard = _out.as_stream();\n        auto& inp = *iguard;\n        auto& out = *oguard;\n\n        bool more = true;\n        char c = '?';\n        decode_step([&]() -> LzwEntry {\n            if (!more) {\n                return LzwEntry(-1);\n            }\n\n            LzwEntry v;\n            more &= parse_number_until_other(inp, c, v);\n\n            if (more && c == '\\'') {\n                more &= bool(inp.get(c));\n                v = uint8_t(c);\n                more &= bool(inp.get(c));\n                DCHECK(c == '\\'');\n                more &= bool(inp.get(c));\n            }\n\n            if (more) {\n                DCHECK(c == ',');\n            }\n\n            if (!more) {\n                return LzwEntry(-1);\n            }\n            \/\/std::cout << byte_to_nice_ascii_char(v) << \"\\n\";\n            return v;\n\n        }, out);\n    }\n};\n\n}\n\n}\n\n#endif\n<commit_msg>Fixed missing include<commit_after>#ifndef _INCLUDED_LZW_DEBUG_CODER_HPP_\n#define _INCLUDED_LZW_DEBUG_CODER_HPP_\n\n#include <tudocomp\/Coder.hpp>\n\n#include <tudocomp\/lz78\/trie.h>\n#include <tudocomp\/lz78\/Lz78DecodeBuffer.hpp>\n\n#include <tudocomp\/lzw\/factor.h>\n#include <tudocomp\/lzw\/decode.hpp>\n\nnamespace tudocomp {\n\nnamespace lzw {\n\nusing ::lzw::LzwEntry;\n\n\/**\n * Encodes factors as simple strings.\n *\/\nclass LzwDebugCoder {\nprivate:\n    \/\/ TODO: Change encode_* methods to not take Output& since that inital setup\n    \/\/ rather, have a single init location\n    tudocomp::output::StreamGuard m_out;\n\npublic:\n    inline LzwDebugCoder(Env& env, Output& out)\n        : m_out(out.as_stream())\n    {\n    }\n\n    inline LzwDebugCoder(Env& env, Output& out, size_t len)\n        : m_out(out.as_stream())\n    {\n    }\n\n    inline ~LzwDebugCoder() {\n        (*m_out).flush();\n    }\n\n    inline void encode_sym(uint8_t sym) {\n        throw std::runtime_error(\"encoder does not support encoding raw symbols\");\n    }\n\n    inline void encode_fact(const LzwEntry& entry) {\n        if (entry >= 32u && entry <= 127u) {\n            (*m_out) << \"'\" << char(uint8_t(entry)) << \"',\";\n        } else {\n            (*m_out) << uint64_t(entry) << \",\";\n        }\n    }\n\n    inline static void decode(Input& _inp, Output& _out) {\n        auto iguard = _inp.as_stream();\n        auto oguard = _out.as_stream();\n        auto& inp = *iguard;\n        auto& out = *oguard;\n\n        bool more = true;\n        char c = '?';\n        decode_step([&]() -> LzwEntry {\n            if (!more) {\n                return LzwEntry(-1);\n            }\n\n            LzwEntry v;\n            more &= parse_number_until_other(inp, c, v);\n\n            if (more && c == '\\'') {\n                more &= bool(inp.get(c));\n                v = uint8_t(c);\n                more &= bool(inp.get(c));\n                DCHECK(c == '\\'');\n                more &= bool(inp.get(c));\n            }\n\n            if (more) {\n                DCHECK(c == ',');\n            }\n\n            if (!more) {\n                return LzwEntry(-1);\n            }\n            \/\/std::cout << byte_to_nice_ascii_char(v) << \"\\n\";\n            return v;\n\n        }, out);\n    }\n};\n\n}\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************************************\/\n\/*                                                                      *\/\n\/*     Copyright 2013-2014 by Martin Bidlingmaier and 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#ifndef VIGRA_BLOCKWISE_WATERSHEDS_HXX\n#define VIGRA_BLOCKWISE_WATERSHEDS_HXX\n\n#include \"multi_array.hxx\"\n#include \"multi_gridgraph.hxx\"\n#include \"blockify.hxx\"\n#include \"blockwise_labeling.hxx\"\n#include \"overlapped_blocks.hxx\"\n\n#include <limits>\n\nnamespace vigra\n{\n\nnamespace blockwise_watersheds_detail\n{\n\ntemplate <class DataArray, class DirectionsBlocksIterator>\nvoid prepareBlockwiseWatersheds(const Overlaps<DataArray>& overlaps,\n                                DirectionsBlocksIterator directions_blocks_begin,\n                                NeighborhoodType neighborhood)\n{\n    static const unsigned int N = DataArray::actual_dimension;\n    typedef typename MultiArrayShape<N>::type Shape;\n    typedef typename DirectionsBlocksIterator::value_type DirectionsBlock;\n    Shape shape = overlaps.shape();\n    vigra_assert(shape == directions_blocks_begin.shape(), \"\");\n    \n    MultiCoordinateIterator<N> it(shape);\n    MultiCoordinateIterator<N> end = it.getEndIterator();\n    for( ; it != end; ++it)\n    {\n        DirectionsBlock directions_block = directions_blocks_begin[*it];\n        OverlappingBlock<DataArray> data_block = overlaps[*it];\n        \n        typedef GridGraph<N, undirected_tag> Graph;\n        typedef typename Graph::NodeIt GraphScanner;\n        typedef typename Graph::OutArcIt NeighborIterator;\n        \n        Graph graph(data_block.block.shape(), neighborhood);\n        for(GraphScanner node(graph); node != lemon::INVALID; ++node)\n        {\n            if(within(*node, data_block.inner_bounds))\n            {\n                typedef typename DataArray::value_type Data;\n                Data lowest_neighbor = data_block.block[*node];\n                \n                typedef typename DirectionsBlock::value_type Direction;\n                Direction lowest_neighbor_direction = std::numeric_limits<unsigned short>::max();\n                \n                for(NeighborIterator arc(graph, *node); arc != lemon::INVALID; ++arc)\n                {\n                    Shape neighbor_coordinates = graph.target(*arc);\n                    Data neighbor_data = data_block.block[neighbor_coordinates];\n                    if(neighbor_data < lowest_neighbor)\n                    {\n                        lowest_neighbor = neighbor_data;\n                        lowest_neighbor_direction = arc.neighborIndex();\n                    }\n                }\n                directions_block[*node - data_block.inner_bounds.first] = lowest_neighbor_direction;\n            }\n        }\n    }\n}\n\ntemplate <unsigned int N>\nstruct UnionFindWatershedEquality\n{\n    \/\/ FIXME: this graph object shouldn't be necessary, most functions (and state) of graph are not used\n    \/\/ this probably needs some refactoring in GridGraph\n    GridGraph<N, undirected_tag>* graph;\n\n    template <class Shape>\n    bool operator()(unsigned short u, const unsigned short v, const Shape& diff) const\n    {\n        static const unsigned short plateau_id = std::numeric_limits<unsigned short>::max();\n        return (u == plateau_id && v == plateau_id) ||\n               (u != plateau_id && graph->neighborOffset(u) == diff) ||\n               (v != plateau_id && graph->neighborOffset(graph->oppositeIndex(v)) == diff);\n    }\n\n    struct WithDiffTag\n    {};\n};\n\n} \/\/ namespace blockwise_watersheds_detail\n\ntemplate <unsigned int N, class Data, class S1,\n                          class Label, class S2>\nLabel unionFindWatershedBlockwise(MultiArrayView<N, Data, S1> data,\n                                  MultiArrayView<N, Label, S2> labels,\n                                  NeighborhoodType neighborhood = DirectNeighborhood,\n                                  const typename MultiArrayView<N, Data, S1>::difference_type& block_shape = \n                                          typename MultiArrayView<N, Data, S1>::difference_type(128))\n{\n    using namespace blockwise_watersheds_detail;\n\n    typedef typename MultiArrayView<N, Data, S1>::difference_type Shape;\n    Shape shape = data.shape();\n    vigra_precondition(shape == labels.shape(), \"shapes of data and labels do not match\");\n    \n    MultiArray<N, unsigned short> directions(shape);\n    \n    MultiArray<N, MultiArrayView<N, unsigned short> > directions_blocks = blockify(directions, block_shape);\n\n    Overlaps<MultiArrayView<N, Data, S1> > overlaps(data, block_shape, Shape(1), Shape(1));\n    prepareBlockwiseWatersheds(overlaps, directions_blocks.begin(), neighborhood);\n    GridGraph<N, undirected_tag> graph(data.shape(), neighborhood);\n    UnionFindWatershedEquality<N> equal = {&graph};\n    return labelMultiArrayBlockwise(directions, labels, LabelOptions().neighborhood(neighborhood).blockShape(block_shape), equal);\n}\n\ntemplate <unsigned int N, class Data,\n                          class Label>\nLabel unionFindWatershedBlockwise(const ChunkedArray<N, Data>& data,\n                                  ChunkedArray<N, Label>& labels,\n                                  NeighborhoodType neighborhood,\n                                  ChunkedArray<N, unsigned short>& directions)\n{\n    using namespace blockwise_watersheds_detail;\n    \n    typedef typename ChunkedArray<N, Data>::shape_type Shape;\n    Shape shape = data.shape();\n    vigra_precondition(shape == labels.shape() && shape == directions.shape(), \"shapes of data and labels do not match\");\n    Shape chunk_shape = data.chunkShape();\n    vigra_precondition(chunk_shape == labels.chunkShape() && chunk_shape == directions.chunkShape(), \"chunk shapes do not match\");\n    \n    Overlaps<ChunkedArray<N, Data> > overlaps(data, data.chunkShape(), Shape(1), Shape(1));\n    \n    prepareBlockwiseWatersheds(overlaps, directions.chunk_begin(Shape(0), shape), neighborhood);\n    \n    GridGraph<N, undirected_tag> graph(shape, neighborhood);\n    UnionFindWatershedEquality<N> equal = {&graph};\n    return labelMultiArrayBlockwise(directions, labels, LabelOptions().neighborhood(neighborhood), equal);\n}\n\ntemplate <unsigned int N, class Data,\n                          class Label>\ninline Label \nunionFindWatershedBlockwise(const ChunkedArray<N, Data>& data,\n                                  ChunkedArray<N, Label>& labels,\n                                  NeighborhoodType neighborhood = DirectNeighborhood)\n{\n    ChunkedArrayLazy<N, unsigned short> directions(data.shape(), data.chunkShape());\n    return unionFindWatershedBlockwise(data, labels, neighborhood, directions);\n}\n\n} \/\/ namespace vigra\n\n#endif \/\/ VIGRA_BLOCKWISE_WATERSHEDS_HXX\n<commit_msg>add documentation<commit_after>\/************************************************************************\/\n\/*                                                                      *\/\n\/*     Copyright 2013-2014 by Martin Bidlingmaier and 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#ifndef VIGRA_BLOCKWISE_WATERSHEDS_HXX\n#define VIGRA_BLOCKWISE_WATERSHEDS_HXX\n\n#include \"multi_array.hxx\"\n#include \"multi_gridgraph.hxx\"\n#include \"blockify.hxx\"\n#include \"blockwise_labeling.hxx\"\n#include \"overlapped_blocks.hxx\"\n\n#include <limits>\n\nnamespace vigra\n{\n\n\/** \\addtogroup SeededRegionGrowing\n*\/\n\/\/@{\n\nnamespace blockwise_watersheds_detail\n{\n\ntemplate <class DataArray, class DirectionsBlocksIterator>\nvoid prepareBlockwiseWatersheds(const Overlaps<DataArray>& overlaps,\n                                DirectionsBlocksIterator directions_blocks_begin,\n                                NeighborhoodType neighborhood)\n{\n    static const unsigned int N = DataArray::actual_dimension;\n    typedef typename MultiArrayShape<N>::type Shape;\n    typedef typename DirectionsBlocksIterator::value_type DirectionsBlock;\n    Shape shape = overlaps.shape();\n    vigra_assert(shape == directions_blocks_begin.shape(), \"\");\n    \n    MultiCoordinateIterator<N> it(shape);\n    MultiCoordinateIterator<N> end = it.getEndIterator();\n    for( ; it != end; ++it)\n    {\n        DirectionsBlock directions_block = directions_blocks_begin[*it];\n        OverlappingBlock<DataArray> data_block = overlaps[*it];\n        \n        typedef GridGraph<N, undirected_tag> Graph;\n        typedef typename Graph::NodeIt GraphScanner;\n        typedef typename Graph::OutArcIt NeighborIterator;\n        \n        Graph graph(data_block.block.shape(), neighborhood);\n        for(GraphScanner node(graph); node != lemon::INVALID; ++node)\n        {\n            if(within(*node, data_block.inner_bounds))\n            {\n                typedef typename DataArray::value_type Data;\n                Data lowest_neighbor = data_block.block[*node];\n                \n                typedef typename DirectionsBlock::value_type Direction;\n                Direction lowest_neighbor_direction = std::numeric_limits<unsigned short>::max();\n                \n                for(NeighborIterator arc(graph, *node); arc != lemon::INVALID; ++arc)\n                {\n                    Shape neighbor_coordinates = graph.target(*arc);\n                    Data neighbor_data = data_block.block[neighbor_coordinates];\n                    if(neighbor_data < lowest_neighbor)\n                    {\n                        lowest_neighbor = neighbor_data;\n                        lowest_neighbor_direction = arc.neighborIndex();\n                    }\n                }\n                directions_block[*node - data_block.inner_bounds.first] = lowest_neighbor_direction;\n            }\n        }\n    }\n}\n\ntemplate <unsigned int N>\nstruct UnionFindWatershedEquality\n{\n    \/\/ FIXME: this graph object shouldn't be necessary, most functions (and state) of graph are not used\n    \/\/ this probably needs some refactoring in GridGraph\n    GridGraph<N, undirected_tag>* graph;\n\n    template <class Shape>\n    bool operator()(unsigned short u, const unsigned short v, const Shape& diff) const\n    {\n        static const unsigned short plateau_id = std::numeric_limits<unsigned short>::max();\n        return (u == plateau_id && v == plateau_id) ||\n               (u != plateau_id && graph->neighborOffset(u) == diff) ||\n               (v != plateau_id && graph->neighborOffset(graph->oppositeIndex(v)) == diff);\n    }\n\n    struct WithDiffTag\n    {};\n};\n\n} \/\/ namespace blockwise_watersheds_detail\n\ntemplate <unsigned int N, class Data, class S1,\n                          class Label, class S2>\nLabel unionFindWatershedBlockwise(MultiArrayView<N, Data, S1> data,\n                                  MultiArrayView<N, Label, S2> labels,\n                                  NeighborhoodType neighborhood = DirectNeighborhood,\n                                  const typename MultiArrayView<N, Data, S1>::difference_type& block_shape = \n                                          typename MultiArrayView<N, Data, S1>::difference_type(128))\n{\n    using namespace blockwise_watersheds_detail;\n\n    typedef typename MultiArrayView<N, Data, S1>::difference_type Shape;\n    Shape shape = data.shape();\n    vigra_precondition(shape == labels.shape(), \"shapes of data and labels do not match\");\n    \n    MultiArray<N, unsigned short> directions(shape);\n    \n    MultiArray<N, MultiArrayView<N, unsigned short> > directions_blocks = blockify(directions, block_shape);\n\n    Overlaps<MultiArrayView<N, Data, S1> > overlaps(data, block_shape, Shape(1), Shape(1));\n    prepareBlockwiseWatersheds(overlaps, directions_blocks.begin(), neighborhood);\n    GridGraph<N, undirected_tag> graph(data.shape(), neighborhood);\n    UnionFindWatershedEquality<N> equal = {&graph};\n    return labelMultiArrayBlockwise(directions, labels, LabelOptions().neighborhood(neighborhood).blockShape(block_shape), equal);\n}\n\n\/*************************************************************\/\n\/*                                                           *\/\n\/*                      unionFindWatershedBlockwise          *\/\n\/*                                                           *\/\n\/*************************************************************\/\n\n\/** \\brief Blockise union-find watershed transform for ChunkedArrays.\n    \n    <b> Declaration:<\/b>\n    \n    \\code\n    namespace vigra {\n        \n        template <unsigned int N, class Data, class Label>\n        Label unionFindWatershedBlockwise(const ChunkedArray<N, Data>& data,\n                                          ChunkedArray<N, Label>& labels,\n                                          NeighborhoodType neighborhood = DirectNeighborhood);\n\n        \/\/ provide temporary directions storage\n        template <unsigned int N, class Data, class Label>\n        Label unionFindWatershedBlockwise(const ChunkedArray<N, Data>& data,\n                                          ChunkedArray<N, Label>& labels,\n                                          NeighborhoodType neighborhood,\n                                          ChunkedArray<N, unsigned short>& temporary_storage);\n    \n    }\n    \\endcode\n    \n    The resulting labeling is equivalent to a labeling by \\ref watershedsUnionFind, that is,\n    the components are the same but may have different ids.\n    If \\a temporary_storage is provided, this array is used for intermediate result storage.\n    Otherwise, a newly created \\ref ChunkedArrayLazy is used.\n\n    Return: the number of labels assigned (=largest label, because labels start at one)\n    \n    <b> Usage: <\/b>\n\n    <b>\\#include <\/b> \\<vigra\/blockwise_labeling.hxx\\><br>\n    Namespace: vigra\n\n    \\code\n    Shape3 shape = Shape3(10);\n    Shape3 chunk_shape = Shape3(4);\n    ChunkedArrayLazy<3, int> data(shape, chunk_shape);\n    \/\/ fill data ...\n    \n    ChunkedArrayLazy<3, size_t> labels(shape, chunk_shape);\n    \n    unionFindWatershedBlockwise(data, labels, IndirectNeighborhood);\n    \\endcode\n    *\/\ndoxygen_overloaded_function(template <...> unsigned int unionFindWatershedBlockwise)\n\ntemplate <unsigned int N, class Data, class Label>\nLabel unionFindWatershedBlockwise(const ChunkedArray<N, Data>& data,\n                                  ChunkedArray<N, Label>& labels,\n                                  NeighborhoodType neighborhood,\n                                  ChunkedArray<N, unsigned short>& directions)\n{\n    using namespace blockwise_watersheds_detail;\n    \n    typedef typename ChunkedArray<N, Data>::shape_type Shape;\n    Shape shape = data.shape();\n    vigra_precondition(shape == labels.shape() && shape == directions.shape(), \"shapes of data and labels do not match\");\n    Shape chunk_shape = data.chunkShape();\n    vigra_precondition(chunk_shape == labels.chunkShape() && chunk_shape == directions.chunkShape(), \"chunk shapes do not match\");\n    \n    Overlaps<ChunkedArray<N, Data> > overlaps(data, data.chunkShape(), Shape(1), Shape(1));\n    \n    prepareBlockwiseWatersheds(overlaps, directions.chunk_begin(Shape(0), shape), neighborhood);\n    \n    GridGraph<N, undirected_tag> graph(shape, neighborhood);\n    UnionFindWatershedEquality<N> equal = {&graph};\n    return labelMultiArrayBlockwise(directions, labels, LabelOptions().neighborhood(neighborhood), equal);\n}\n\ntemplate <unsigned int N, class Data,\n                          class Label>\ninline Label \nunionFindWatershedBlockwise(const ChunkedArray<N, Data>& data,\n                                  ChunkedArray<N, Label>& labels,\n                                  NeighborhoodType neighborhood = DirectNeighborhood)\n{\n    ChunkedArrayLazy<N, unsigned short> directions(data.shape(), data.chunkShape());\n    return unionFindWatershedBlockwise(data, labels, neighborhood, directions);\n}\n\n\/\/@}\n\n} \/\/ namespace vigra\n\n#endif \/\/ VIGRA_BLOCKWISE_WATERSHEDS_HXX\n<|endoftext|>"}
{"text":"<commit_before>\/** \n * @file llfloatervoiceeffect.cpp\n * @brief Selection and preview of voice effect.\n *\n * $LicenseInfo:firstyear=2010&license=viewergpl$\n * \n * Copyright (c) 2002-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab.  Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"llfloatervoiceeffect.h\"\n\n#include \"llscrolllistctrl.h\"\n#include \"lltrans.h\"\n#include \"llweb.h\"\n\nLLFloaterVoiceEffect::LLFloaterVoiceEffect(const LLSD& key)\n\t: LLFloater(key)\n{\n\tmCommitCallbackRegistrar.add(\"VoiceEffect.Record\",\tboost::bind(&LLFloaterVoiceEffect::onClickRecord, this));\n\tmCommitCallbackRegistrar.add(\"VoiceEffect.Play\",\tboost::bind(&LLFloaterVoiceEffect::onClickPlay, this));\n\tmCommitCallbackRegistrar.add(\"VoiceEffect.Stop\",\tboost::bind(&LLFloaterVoiceEffect::onClickStop, this));\n\tmCommitCallbackRegistrar.add(\"VoiceEffect.Add\",\t\tboost::bind(&LLFloaterVoiceEffect::onClickAdd, this));\n\/\/\tmCommitCallbackRegistrar.add(\"VoiceEffect.Activate\", boost::bind(&LLFloaterVoiceEffect::onClickActivate, this));\n}\n\n\/\/ virtual\nLLFloaterVoiceEffect::~LLFloaterVoiceEffect()\n{\n\tif(LLVoiceClient::instanceExists())\n\t{\n\t\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\t\tif (effect_interface)\n\t\t{\n\t\t\teffect_interface->removeObserver(this);\n\t\t}\n\t}\n}\n\n\/\/ virtual\nBOOL LLFloaterVoiceEffect::postBuild()\n{\n\tsetDefaultBtn(\"record_btn\");\n\tgetChild<LLButton>(\"record_btn\")->setFocus(true);\n\n\n\tmVoiceEffectList = getChild<LLScrollListCtrl>(\"voice_effect_list\");\n\tif (mVoiceEffectList)\n\t{\n\t\tmVoiceEffectList->setCommitCallback(boost::bind(&LLFloaterVoiceEffect::onClickPlay, this));\n\/\/\t\tmVoiceEffectList->setDoubleClickCallback(boost::bind(&LLFloaterVoiceEffect::onClickActivate, this));\n\t}\n\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->addObserver(this);\n\n\t\t\/\/ Disconnect from the current voice channel ready to record a voice sample for previewing\n\t\teffect_interface->enablePreviewBuffer(true);\n\t}\n\n\trefreshEffectList();\n\tupdateControls();\n\n\treturn TRUE;\n}\n\n\/\/ virtual\nvoid LLFloaterVoiceEffect::onClose(bool app_quitting)\n{\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->enablePreviewBuffer(false);\n\t}\n}\n\nvoid LLFloaterVoiceEffect::refreshEffectList()\n{\n\tif (!mVoiceEffectList)\n\t{\n\t\treturn;\n\t}\n\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (!effect_interface)\n\t{\n\t\tmVoiceEffectList->setEnabled(false);\n\t\treturn;\n\t}\n\n\tLL_DEBUGS(\"Voice\")<< \"Rebuilding voice effect list.\"<< LL_ENDL;\n\n\t\/\/ Preserve selected items and scroll position\n\tS32 scroll_pos = mVoiceEffectList->getScrollPos();\n\tuuid_vec_t selected_items;\n\tstd::vector<LLScrollListItem*> items = mVoiceEffectList->getAllSelected();\n\tfor(std::vector<LLScrollListItem*>::const_iterator it = items.begin(); it != items.end(); it++)\n\t{\n\t\tselected_items.push_back((*it)->getUUID());\n\t}\n\n\tmVoiceEffectList->deleteAllItems();\n\n\t{\n\t\t\/\/ Add the \"No Voice Effect\" entry\n\t\tLLSD element;\n\n\t\telement[\"id\"] = LLUUID::null;\n\t\telement[\"columns\"][0][\"column\"] = \"name\";\n\t\telement[\"columns\"][0][\"value\"] = getString(\"no_voice_effect\");\n\t\telement[\"columns\"][0][\"font\"][\"name\"] = \"SANSSERIF\";\n\t\telement[\"columns\"][0][\"font\"][\"style\"] = \"ITALIC\";\n\n\t\tLLScrollListItem* sl_item = mVoiceEffectList->addElement(element, ADD_BOTTOM);\n\t\t\/\/ *HACK: Copied from llfloatergesture.cpp : [\"font\"][\"style\"] does not affect font style :(\n\t\tif(sl_item)\n\t\t{\n\t\t\t((LLScrollListText*)sl_item->getColumn(0))->setFontStyle(LLFontGL::BOLD);\n\t\t}\n\t}\n\n\tconst voice_effect_list_t& template_list = effect_interface->getVoiceEffectTemplateList();\n\tif (!template_list.empty())\n\t{\n\t\tfor (voice_effect_list_t::const_iterator it = template_list.begin(); it != template_list.end(); ++it)\n\t\t{\n\t\t\tconst LLUUID& effect_id = it->second;\n\t\t\tstd::string effect_name = it->first;\n\n\t\t\tLLSD effect_properties = effect_interface->getVoiceEffectProperties(effect_id);\n\n\t\t\t\/\/ Tag the active effect.\n\t\t\tif (effect_id == LLVoiceClient::instance().getVoiceEffectDefault())\n\t\t\t{\n\t\t\t\teffect_name += \" \" + getString(\"active_voice_effect\");\n\t\t\t}\n\n\t\t\tLLDate expiry_date = effect_properties[\"expiry_date\"].asDate();\n\t\t\tbool is_template_only = effect_properties[\"template_only\"].asBoolean();\n\t\t\tbool is_new = effect_properties[\"is_new\"].asBoolean();\n\n\t\t\tstd::string font_style = \"NORMAL\";\n\t\t\tif (!is_template_only)\n\t\t\t{\n\t\t\t\tfont_style = \"BOLD\";\n\t\t\t}\n\t\t\tLLSD element;\n\t\t\telement[\"id\"] = effect_id;\n\n\t\t\telement[\"columns\"][0][\"column\"] = \"name\";\n\t\t\telement[\"columns\"][0][\"value\"] = effect_name;\n\t\t\telement[\"columns\"][0][\"font\"][\"name\"] = \"SANSSERIF\";\n\t\t\telement[\"columns\"][0][\"font\"][\"style\"] = font_style;\n\n\t\t\telement[\"columns\"][1][\"column\"] = \"new\";\n\t\t\telement[\"columns\"][1][\"value\"] = is_new ? getString(\"new_voice_effect\") : \"\";\n\t\t\telement[\"columns\"][1][\"font\"][\"name\"] = \"SANSSERIF\";\n\t\t\telement[\"columns\"][1][\"font\"][\"style\"] = font_style;\n\n\t\t\telement[\"columns\"][2][\"column\"] = \"expires\";\n\t\t\tif (!is_template_only)\n\t\t\t{\n\t\t\t\telement[\"columns\"][2][\"value\"] = expiry_date;\n\t\t\t}\n\t\t\telse {\n\t\t\t\telement[\"columns\"][2][\"value\"] = \"\";\n\t\t\t}\n\t\t\telement[\"columns\"][2][\"font\"][\"name\"] = \"SANSSERIF\";\n\t\t\telement[\"columns\"][2][\"font\"][\"style\"] = font_style;\n\n\t\t\tLLScrollListItem* sl_item = mVoiceEffectList->addElement(element, ADD_BOTTOM);\n\t\t\t\/\/ *HACK: Copied from llfloatergesture.cpp : [\"font\"][\"style\"] does not affect font style :(\n\t\t\tif(sl_item)\n\t\t\t{\n\t\t\t\tLLFontGL::StyleFlags style = is_template_only ? LLFontGL::NORMAL : LLFontGL::BOLD;\n\t\t\t\t((LLScrollListText*)sl_item->getColumn(0))->setFontStyle(style);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Re-select items that were selected before, and restore the scroll position\n\tfor(uuid_vec_t::iterator it = selected_items.begin(); it != selected_items.end(); it++)\n\t{\n\t\tmVoiceEffectList->selectByID(*it);\n\t}\n\tmVoiceEffectList->setScrollPos(scroll_pos);\n\tmVoiceEffectList->setEnabled(true);\n}\n\nvoid LLFloaterVoiceEffect::updateControls()\n{\n\tbool recording = false;\n\tbool playing = false;\n\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\trecording = effect_interface->isPreviewRecording();\n\t\tplaying = effect_interface->isPreviewPlaying();\n\t}\n\n\tgetChild<LLButton>(\"record_btn\")->setVisible(!recording);\n\tgetChild<LLButton>(\"record_stop_btn\")->setVisible(recording);\n}\n\n\/\/ virtual\nvoid LLFloaterVoiceEffect::onVoiceEffectChanged(bool effect_list_updated)\n{\n\tif (effect_list_updated)\n\t{\n\t\trefreshEffectList();\n\t}\n\tupdateControls();\n}\n\nvoid LLFloaterVoiceEffect::onClickRecord()\n{\n\tLL_DEBUGS(\"Voice\") << \"Record clicked\" << LL_ENDL;\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->recordPreviewBuffer();\n\t}\n\tupdateControls();\n}\n\nvoid LLFloaterVoiceEffect::onClickPlay()\n{\n\tLL_DEBUGS(\"Voice\") << \"Play clicked\" << LL_ENDL;\n\tif (!mVoiceEffectList)\n\t{\n\t\treturn;\n\t}\n\n\tconst LLUUID& effect_id = mVoiceEffectList->getCurrentID();\n\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->playPreviewBuffer(effect_id);\n\t}\n\tupdateControls();\n}\n\nvoid LLFloaterVoiceEffect::onClickStop()\n{\n\tLL_DEBUGS(\"Voice\") << \"Stop clicked\" << LL_ENDL;\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->stopPreviewBuffer();\n\t}\n\tupdateControls();\n}\n\nvoid LLFloaterVoiceEffect::onClickAdd()\n{\n\t\/\/ Open the voice morphing info web page\n\tLLWeb::loadURL(LLTrans::getString(\"voice_morphing_url\"));\n}\n\n\/\/void LLFloaterVoiceEffect::onClickActivate()\n\/\/{\n\/\/\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\/\/\tif (effect_interface && mVoiceEffectList)\n\/\/\t{\n\/\/\t\teffect_interface->setVoiceEffect(mVoiceEffectList->getCurrentID());\n\/\/\t}\n\/\/}\n\n<commit_msg>EXT-7138 WIP More tidying up after the removal of the play button in the voice effect preview.<commit_after>\/** \n * @file llfloatervoiceeffect.cpp\n * @brief Selection and preview of voice effect.\n *\n * $LicenseInfo:firstyear=2010&license=viewergpl$\n * \n * Copyright (c) 2002-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab.  Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"llfloatervoiceeffect.h\"\n\n#include \"llscrolllistctrl.h\"\n#include \"lltrans.h\"\n#include \"llweb.h\"\n\nLLFloaterVoiceEffect::LLFloaterVoiceEffect(const LLSD& key)\n\t: LLFloater(key)\n{\n\tmCommitCallbackRegistrar.add(\"VoiceEffect.Record\",\tboost::bind(&LLFloaterVoiceEffect::onClickRecord, this));\n\tmCommitCallbackRegistrar.add(\"VoiceEffect.Play\",\tboost::bind(&LLFloaterVoiceEffect::onClickPlay, this));\n\tmCommitCallbackRegistrar.add(\"VoiceEffect.Stop\",\tboost::bind(&LLFloaterVoiceEffect::onClickStop, this));\n\tmCommitCallbackRegistrar.add(\"VoiceEffect.Add\",\t\tboost::bind(&LLFloaterVoiceEffect::onClickAdd, this));\n\/\/\tmCommitCallbackRegistrar.add(\"VoiceEffect.Activate\", boost::bind(&LLFloaterVoiceEffect::onClickActivate, this));\n}\n\n\/\/ virtual\nLLFloaterVoiceEffect::~LLFloaterVoiceEffect()\n{\n\tif(LLVoiceClient::instanceExists())\n\t{\n\t\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\t\tif (effect_interface)\n\t\t{\n\t\t\teffect_interface->removeObserver(this);\n\t\t}\n\t}\n}\n\n\/\/ virtual\nBOOL LLFloaterVoiceEffect::postBuild()\n{\n\tsetDefaultBtn(\"record_btn\");\n\tgetChild<LLButton>(\"record_btn\")->setFocus(true);\n\n\n\tmVoiceEffectList = getChild<LLScrollListCtrl>(\"voice_effect_list\");\n\tif (mVoiceEffectList)\n\t{\n\t\tmVoiceEffectList->setCommitCallback(boost::bind(&LLFloaterVoiceEffect::onClickPlay, this));\n\/\/\t\tmVoiceEffectList->setDoubleClickCallback(boost::bind(&LLFloaterVoiceEffect::onClickActivate, this));\n\t}\n\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->addObserver(this);\n\n\t\t\/\/ Disconnect from the current voice channel ready to record a voice sample for previewing\n\t\teffect_interface->enablePreviewBuffer(true);\n\t}\n\n\trefreshEffectList();\n\tupdateControls();\n\n\treturn TRUE;\n}\n\n\/\/ virtual\nvoid LLFloaterVoiceEffect::onClose(bool app_quitting)\n{\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->enablePreviewBuffer(false);\n\t}\n}\n\nvoid LLFloaterVoiceEffect::refreshEffectList()\n{\n\tif (!mVoiceEffectList)\n\t{\n\t\treturn;\n\t}\n\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (!effect_interface)\n\t{\n\t\tmVoiceEffectList->setEnabled(false);\n\t\treturn;\n\t}\n\n\tLL_DEBUGS(\"Voice\")<< \"Rebuilding voice effect list.\"<< LL_ENDL;\n\n\t\/\/ Preserve selected items and scroll position\n\tS32 scroll_pos = mVoiceEffectList->getScrollPos();\n\tuuid_vec_t selected_items;\n\tstd::vector<LLScrollListItem*> items = mVoiceEffectList->getAllSelected();\n\tfor(std::vector<LLScrollListItem*>::const_iterator it = items.begin(); it != items.end(); it++)\n\t{\n\t\tselected_items.push_back((*it)->getUUID());\n\t}\n\n\tmVoiceEffectList->deleteAllItems();\n\n\t{\n\t\t\/\/ Add the \"No Voice Effect\" entry\n\t\tLLSD element;\n\n\t\telement[\"id\"] = LLUUID::null;\n\t\telement[\"columns\"][0][\"column\"] = \"name\";\n\t\telement[\"columns\"][0][\"value\"] = getString(\"no_voice_effect\");\n\t\telement[\"columns\"][0][\"font\"][\"name\"] = \"SANSSERIF\";\n\t\telement[\"columns\"][0][\"font\"][\"style\"] = \"ITALIC\";\n\n\t\tLLScrollListItem* sl_item = mVoiceEffectList->addElement(element, ADD_BOTTOM);\n\t\t\/\/ *HACK: Copied from llfloatergesture.cpp : [\"font\"][\"style\"] does not affect font style :(\n\t\tif(sl_item)\n\t\t{\n\t\t\t((LLScrollListText*)sl_item->getColumn(0))->setFontStyle(LLFontGL::BOLD);\n\t\t}\n\t}\n\n\tconst voice_effect_list_t& template_list = effect_interface->getVoiceEffectTemplateList();\n\tif (!template_list.empty())\n\t{\n\t\tfor (voice_effect_list_t::const_iterator it = template_list.begin(); it != template_list.end(); ++it)\n\t\t{\n\t\t\tconst LLUUID& effect_id = it->second;\n\t\t\tstd::string effect_name = it->first;\n\n\t\t\tLLSD effect_properties = effect_interface->getVoiceEffectProperties(effect_id);\n\n\t\t\t\/\/ Tag the active effect.\n\t\t\tif (effect_id == LLVoiceClient::instance().getVoiceEffectDefault())\n\t\t\t{\n\t\t\t\teffect_name += \" \" + getString(\"active_voice_effect\");\n\t\t\t}\n\n\t\t\tLLDate expiry_date = effect_properties[\"expiry_date\"].asDate();\n\t\t\tbool is_template_only = effect_properties[\"template_only\"].asBoolean();\n\t\t\tbool is_new = effect_properties[\"is_new\"].asBoolean();\n\n\t\t\tstd::string font_style = \"NORMAL\";\n\t\t\tif (!is_template_only)\n\t\t\t{\n\t\t\t\tfont_style = \"BOLD\";\n\t\t\t}\n\t\t\tLLSD element;\n\t\t\telement[\"id\"] = effect_id;\n\n\t\t\telement[\"columns\"][0][\"column\"] = \"name\";\n\t\t\telement[\"columns\"][0][\"value\"] = effect_name;\n\t\t\telement[\"columns\"][0][\"font\"][\"name\"] = \"SANSSERIF\";\n\t\t\telement[\"columns\"][0][\"font\"][\"style\"] = font_style;\n\n\t\t\telement[\"columns\"][1][\"column\"] = \"new\";\n\t\t\telement[\"columns\"][1][\"value\"] = is_new ? getString(\"new_voice_effect\") : \"\";\n\t\t\telement[\"columns\"][1][\"font\"][\"name\"] = \"SANSSERIF\";\n\t\t\telement[\"columns\"][1][\"font\"][\"style\"] = font_style;\n\n\t\t\telement[\"columns\"][2][\"column\"] = \"expires\";\n\t\t\tif (!is_template_only)\n\t\t\t{\n\t\t\t\telement[\"columns\"][2][\"value\"] = expiry_date;\n\t\t\t}\n\t\t\telse {\n\t\t\t\telement[\"columns\"][2][\"value\"] = \"\";\n\t\t\t}\n\t\t\telement[\"columns\"][2][\"font\"][\"name\"] = \"SANSSERIF\";\n\t\t\telement[\"columns\"][2][\"font\"][\"style\"] = font_style;\n\n\t\t\tLLScrollListItem* sl_item = mVoiceEffectList->addElement(element, ADD_BOTTOM);\n\t\t\t\/\/ *HACK: Copied from llfloatergesture.cpp : [\"font\"][\"style\"] does not affect font style :(\n\t\t\tif(sl_item)\n\t\t\t{\n\t\t\t\tLLFontGL::StyleFlags style = is_template_only ? LLFontGL::NORMAL : LLFontGL::BOLD;\n\t\t\t\t((LLScrollListText*)sl_item->getColumn(0))->setFontStyle(style);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Re-select items that were selected before, and restore the scroll position\n\tfor(uuid_vec_t::iterator it = selected_items.begin(); it != selected_items.end(); it++)\n\t{\n\t\tmVoiceEffectList->selectByID(*it);\n\t}\n\tmVoiceEffectList->setScrollPos(scroll_pos);\n\tmVoiceEffectList->setEnabled(true);\n}\n\nvoid LLFloaterVoiceEffect::updateControls()\n{\n\tbool recording = false;\n\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\trecording = effect_interface->isPreviewRecording();\n\t}\n\n\tgetChild<LLButton>(\"record_btn\")->setVisible(!recording);\n\tgetChild<LLButton>(\"record_stop_btn\")->setVisible(recording);\n}\n\n\/\/ virtual\nvoid LLFloaterVoiceEffect::onVoiceEffectChanged(bool effect_list_updated)\n{\n\tif (effect_list_updated)\n\t{\n\t\trefreshEffectList();\n\t}\n\tupdateControls();\n}\n\nvoid LLFloaterVoiceEffect::onClickRecord()\n{\n\tLL_DEBUGS(\"Voice\") << \"Record clicked\" << LL_ENDL;\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->recordPreviewBuffer();\n\t}\n\tupdateControls();\n}\n\nvoid LLFloaterVoiceEffect::onClickPlay()\n{\n\tLL_DEBUGS(\"Voice\") << \"Play clicked\" << LL_ENDL;\n\tif (!mVoiceEffectList)\n\t{\n\t\treturn;\n\t}\n\n\tconst LLUUID& effect_id = mVoiceEffectList->getCurrentID();\n\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->playPreviewBuffer(effect_id);\n\t}\n\tupdateControls();\n}\n\nvoid LLFloaterVoiceEffect::onClickStop()\n{\n\tLL_DEBUGS(\"Voice\") << \"Stop clicked\" << LL_ENDL;\n\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\tif (effect_interface)\n\t{\n\t\teffect_interface->stopPreviewBuffer();\n\t}\n\tupdateControls();\n}\n\nvoid LLFloaterVoiceEffect::onClickAdd()\n{\n\t\/\/ Open the voice morphing info web page\n\tLLWeb::loadURL(LLTrans::getString(\"voice_morphing_url\"));\n}\n\n\/\/void LLFloaterVoiceEffect::onClickActivate()\n\/\/{\n\/\/\tLLVoiceEffectInterface* effect_interface = LLVoiceClient::instance().getVoiceEffectInterface();\n\/\/\tif (effect_interface && mVoiceEffectList)\n\/\/\t{\n\/\/\t\teffect_interface->setVoiceEffect(mVoiceEffectList->getCurrentID());\n\/\/\t}\n\/\/}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"blackhole\/detail\/sink\/asynchronous.hpp\"\n\n#include <cmath>\n#include <condition_variable>\n#include <mutex>\n\nnamespace blackhole {\ninline namespace v1 {\nnamespace experimental {\nnamespace sink {\nnamespace {\n\nauto exp2(std::size_t factor) -> std::size_t {\n    if (factor > 20) {\n        throw std::invalid_argument(\"factor should fit in [0; 20] range\");\n    }\n\n    return static_cast<std::size_t>(std::exp2(factor));\n}\n\n}  \/\/ namespace\n\nclass drop_overflow_policy_t : public overflow_policy_t {\n    typedef overflow_policy_t::action_t action_t;\n\npublic:\n    \/\/\/ Drops on overlow.\n    virtual auto overflow() -> action_t {\n        return action_t::drop;\n    }\n\n    \/\/\/ Does nothing on wakeup.\n    virtual auto wakeup() -> void {}\n};\n\nclass wait_overflow_policy_t : public overflow_policy_t {\n    typedef overflow_policy_t::action_t action_t;\n\n    mutable std::mutex mutex;\n    std::condition_variable cv;\n\npublic:\n    virtual auto overflow() -> action_t {\n        std::unique_lock<std::mutex> lock(mutex);\n        cv.wait(lock);\n        return action_t::retry;\n    }\n\n    virtual auto wakeup() -> void {\n        cv.notify_one();\n    }\n};\n\nasynchronous_t::asynchronous_t(std::unique_ptr<sink_t> wrapped, std::size_t factor) :\n    queue(exp2(factor)),\n    stopped(false),\n    wrapped(std::move(wrapped)),\n    overflow_policy(new wait_overflow_policy_t),\n    thread(std::bind(&asynchronous_t::run, this))\n{}\n\nasynchronous_t::~asynchronous_t() {\n    stopped.store(true);\n    thread.join();\n}\n\nauto asynchronous_t::emit(const record_t& record, const string_view& message) -> void {\n    while (true) {\n        \/\/ TODO: Uncomment.\n        \/\/ switch (filter->filter(record, message)) {\n        \/\/ case filter_t::accept:\n        \/\/ case filter_t::neutral:\n        \/\/     break;\n        \/\/ case filter_t::reject:\n        \/\/     return;\n        \/\/ }\n\n        const auto enqueued = queue.enqueue_with([&](value_type& value) {\n            value = {recordbuf_t(record), message.to_string()};\n        });\n\n        if (enqueued) {\n            \/\/ TODO: underflow_policy->wakeup();\n            return;\n        } else {\n            switch (overflow_policy->overflow()) {\n            case overflow_policy_t::action_t::retry:\n                continue;\n            case overflow_policy_t::action_t::drop:\n                return;\n            }\n        }\n    }\n}\n\nauto asynchronous_t::run() -> void {\n    while (true) {\n        value_type result;\n        const auto dequeued = queue.dequeue_with([&](value_type& value) {\n            result = std::move(value);\n        });\n\n        if (stopped && !dequeued) {\n            return;\n        }\n\n        if (dequeued) {\n            try {\n                wrapped->emit(result.record.into_view(), result.message);\n                overflow_policy->wakeup();\n            } catch (...) {\n                throw;\n                \/\/ TODO: exception_policy->process();\n            }\n        } else {\n            ::usleep(1000);\n            \/\/ TODO: underflow_policy->underflow(); [wait for enqueue, sleep].\n        }\n    }\n}\n\n}  \/\/ namespace sink\n}  \/\/ namespace experimental\n}  \/\/ namespace v1\n}  \/\/ namespace blackhole\n<commit_msg>fix: fixed potential deadlock<commit_after>#include \"blackhole\/detail\/sink\/asynchronous.hpp\"\n\n#include <cmath>\n#include <condition_variable>\n#include <mutex>\n\nnamespace blackhole {\ninline namespace v1 {\nnamespace experimental {\nnamespace sink {\nnamespace {\n\nauto exp2(std::size_t factor) -> std::size_t {\n    if (factor > 20) {\n        throw std::invalid_argument(\"factor should fit in [0; 20] range\");\n    }\n\n    return static_cast<std::size_t>(std::exp2(factor));\n}\n\n}  \/\/ namespace\n\nclass drop_overflow_policy_t : public overflow_policy_t {\n    typedef overflow_policy_t::action_t action_t;\n\npublic:\n    \/\/\/ Drops on overlow.\n    virtual auto overflow() -> action_t {\n        return action_t::drop;\n    }\n\n    \/\/\/ Does nothing on wakeup.\n    virtual auto wakeup() -> void {}\n};\n\nclass wait_overflow_policy_t : public overflow_policy_t {\n    typedef overflow_policy_t::action_t action_t;\n\n    mutable std::mutex mutex;\n    std::condition_variable cv;\n\npublic:\n    virtual auto overflow() -> action_t {\n        std::unique_lock<std::mutex> lock(mutex);\n        cv.wait_for(lock, std::chrono::milliseconds(1));\n        return action_t::retry;\n    }\n\n    virtual auto wakeup() -> void {\n        cv.notify_one();\n    }\n};\n\nasynchronous_t::asynchronous_t(std::unique_ptr<sink_t> wrapped, std::size_t factor) :\n    queue(exp2(factor)),\n    stopped(false),\n    wrapped(std::move(wrapped)),\n    overflow_policy(new wait_overflow_policy_t),\n    thread(std::bind(&asynchronous_t::run, this))\n{}\n\nasynchronous_t::~asynchronous_t() {\n    stopped.store(true);\n    thread.join();\n}\n\nauto asynchronous_t::emit(const record_t& record, const string_view& message) -> void {\n    while (true) {\n        \/\/ TODO: Uncomment.\n        \/\/ switch (filter->filter(record, message)) {\n        \/\/ case filter_t::accept:\n        \/\/ case filter_t::neutral:\n        \/\/     break;\n        \/\/ case filter_t::reject:\n        \/\/     return;\n        \/\/ }\n\n        const auto enqueued = queue.enqueue_with([&](value_type& value) {\n            value = {recordbuf_t(record), message.to_string()};\n        });\n\n        if (enqueued) {\n            \/\/ TODO: underflow_policy->wakeup();\n            return;\n        } else {\n            switch (overflow_policy->overflow()) {\n            case overflow_policy_t::action_t::retry:\n                continue;\n            case overflow_policy_t::action_t::drop:\n                return;\n            }\n        }\n    }\n}\n\nauto asynchronous_t::run() -> void {\n    while (true) {\n        value_type result;\n        const auto dequeued = queue.dequeue_with([&](value_type& value) {\n            result = std::move(value);\n        });\n\n        if (stopped && !dequeued) {\n            return;\n        }\n\n        if (dequeued) {\n            try {\n                wrapped->emit(result.record.into_view(), result.message);\n                overflow_policy->wakeup();\n            } catch (...) {\n                throw;\n                \/\/ TODO: exception_policy->process();\n            }\n        } else {\n            ::usleep(1000);\n            \/\/ TODO: underflow_policy->underflow(); [wait for enqueue, sleep].\n        }\n    }\n}\n\n}  \/\/ namespace sink\n}  \/\/ namespace experimental\n}  \/\/ namespace v1\n}  \/\/ namespace blackhole\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/..\/..\/inc\/slib\/ui\/scroll_view.h\"\n#include \"..\/..\/..\/inc\/slib\/ui\/core.h\"\n\nSLIB_UI_NAMESPACE_BEGIN\n\nSLIB_DEFINE_OBJECT(ScrollView, View)\n\nScrollView::ScrollView()\n{\n\tSLIB_REFERABLE_CONSTRUCTOR\n\n\tsetCreatingNativeWidget(sl_true);\n\tsetCreatingChildInstances(sl_false);\n\tsetBorder(sl_true, UIUpdateMode::Init);\n\n\tm_flagPaging = sl_false;\n\tm_pageWidth = 0;\n\tm_pageHeight = 0;\n\t\n\tsetHorizontalScrolling(sl_true);\n\tsetVerticalScrolling(sl_true);\n}\n\nRef<View> ScrollView::getContentView()\n{\n\treturn m_viewContent;\n}\n\nvoid ScrollView::setContentView(const Ref<slib::View>& view, UIUpdateMode mode)\n{\n\tObjectLocker lock(this);\n\tif (m_viewContent != view) {\n\t\tRef<View> viewOld = m_viewContent;\n\t\tremoveChild(viewOld, UIUpdateMode::NoRedraw);\n\t\tm_viewContent = view;\n\t\tif (view.isNotNull()) {\n\t\t\tview->setParent(this);\n\t\t\tview->setCreatingInstance(sl_true);\n\t\t\tview->setAttachMode(UIAttachMode::NotAttach);\n\t\t\tif (mode == UIUpdateMode::Init) {\n\t\t\t\taddChild(view, UIUpdateMode::Init);\n\t\t\t} else {\n\t\t\t\taddChild(view, UIUpdateMode::NoRedraw);\n\t\t\t}\n\t\t\tView::setContentSize(view->getWidth(), view->getHeight(), UIUpdateMode::NoRedraw);\n\t\t} else {\n\t\t\tView::setContentSize(0, 0, UIUpdateMode::NoRedraw);\n\t\t}\n\t\tif (mode != UIUpdateMode::Init) {\n\t\t\tif (isNativeWidget()) {\n\t\t\t\tif (UI::isUiThread()) {\n\t\t\t\t\t_setContentView_NW(view);\n\t\t\t\t} else {\n\t\t\t\t\tUI::dispatchToUiThread(SLIB_BIND_WEAKREF(void(), ScrollView, _setContentView_NW, this, view));\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tUIPoint pt = View::getScrollPosition();\n\t\t\t\t_scrollTo(pt.x, pt.y, UIUpdateMode::NoRedraw);\n\t\t\t\tif (mode == UIUpdateMode::Redraw) {\n\t\t\t\t\tinvalidate();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid ScrollView::setContentSize(sl_scroll_pos _width, sl_scroll_pos _height, UIUpdateMode mode)\n{\n\tsl_ui_pos width = (sl_ui_pos)(_width);\n\tif (width < 0) {\n\t\twidth = 0;\n\t}\n\tsl_ui_pos height = (sl_ui_pos)(_height);\n\tif (height < 0) {\n\t\theight = 0;\n\t}\n\tObjectLocker lock(this);\n\tRef<View> viewContent = m_viewContent;\n\tif (viewContent.isNotNull()) {\n\t\tif (mode == UIUpdateMode::Init) {\n\t\t\tviewContent->setSize(width, height, UIUpdateMode::Init);\n\t\t} else {\n\t\t\tviewContent->setSize(width, height, UIUpdateMode::NoRedraw);\n\t\t}\n\t}\n\tView::setContentSize(_width, _height, mode);\n\tif (isNativeWidget()) {\n\t\t_refreshContentSize_NW();\n\t}\n}\n\nvoid ScrollView::setContentSize(const ScrollPoint& size, UIUpdateMode mode)\n{\n\tsetContentSize(size.x, size.y, mode);\n}\n\nScrollPoint ScrollView::getScrollPosition()\n{\n\tif (isNativeWidget()) {\n\t\treturn _getScrollPosition_NW();\n\t}\n\treturn View::getScrollPosition();\n}\n\nScrollPoint ScrollView::getScrollRange()\n{\n\tif (isNativeWidget()) {\n\t\treturn _getScrollRange_NW();\n\t}\n\treturn View::getScrollRange();\n}\n\nvoid ScrollView::scrollTo(sl_scroll_pos x, sl_scroll_pos y, UIUpdateMode mode)\n{\n\t_scrollTo(x, y, UIUpdateMode::NoRedraw);\n\tView::scrollTo(x, y, mode);\n}\n\nvoid ScrollView::scrollTo(const ScrollPoint& position, UIUpdateMode mode)\n{\n\tscrollTo(position.x, position.y, mode);\n}\n\nsl_bool ScrollView::isPaging()\n{\n\treturn m_flagPaging;\n}\n\nvoid ScrollView::setPaging(sl_bool flagPaging)\n{\n\tm_flagPaging = flagPaging;\n\t_updatePaging();\n}\n\nsl_ui_len ScrollView::getPageWidth()\n{\n\treturn m_pageWidth;\n}\n\nvoid ScrollView::setPageWidth(sl_ui_len width)\n{\n\tm_pageWidth = width;\n\t_updatePaging();\n}\n\nsl_ui_len ScrollView::getPageHeight()\n{\n\treturn m_pageHeight;\n}\n\nvoid ScrollView::setPageHeight(sl_ui_len height)\n{\n\tm_pageHeight = height;\n\t_updatePaging();\n}\n\nvoid ScrollView::setScrollBarsVisible(sl_bool flagHorizontal, sl_bool flagVertical, UIUpdateMode mode)\n{\n\tView::setScrollBarsVisible(flagHorizontal, flagVertical, mode);\n\t_setScrollBarsVisible_NW(flagHorizontal, flagVertical);\n}\n\nvoid ScrollView::_updatePaging()\n{\n\t_setPaging_NW(m_flagPaging, m_pageWidth, m_pageHeight);\n}\n\nvoid ScrollView::onResize(sl_ui_len width, sl_ui_len height)\n{\n\tif (isNativeWidget()) {\n\t\t_refreshContentSize_NW();\n\t}\n}\n\nvoid ScrollView::onResizeChild(View* child, sl_ui_len width, sl_ui_len height)\n{\n\tif (child == m_viewContent) {\n\t\tView::setContentSize(width, height);\n\t\tif (isNativeWidget()) {\n\t\t\t_refreshContentSize_NW();\n\t\t}\n\t}\n}\n\nvoid ScrollView::onMeasureLayout(sl_bool flagHorizontal, sl_bool flagVertical)\n{\n}\n\nvoid ScrollView::onMakeLayout()\n{\t\n}\n\nvoid ScrollView::_scrollTo(sl_scroll_pos x, sl_scroll_pos y, UIUpdateMode mode)\n{\n\tRef<View> view = m_viewContent;\n\tif (view.isNotNull()) {\n\t\tif (isNativeWidget()) {\n\t\t\t_scrollTo_NW(x, y);\n\t\t} else {\n\t\t\tsl_ui_len w = getWidth();\n\t\t\tsl_ui_len cw = view->getWidth();\n\t\t\tif (cw > w) {\n\t\t\t\tsl_ui_pos rx = cw - w;\n\t\t\t\tif (x > (sl_scroll_pos)rx) {\n\t\t\t\t\tx = rx;\n\t\t\t\t}\n\t\t\t\tif (x < 0) {\n\t\t\t\t\tx = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tx = 0;\n\t\t\t}\n\t\t\tsl_ui_len h = getHeight();\n\t\t\tsl_ui_len ch = view->getHeight();\n\t\t\tif (ch > h) {\n\t\t\t\tsl_ui_pos ry = ch - h;\n\t\t\t\tif (y > (sl_scroll_pos)ry) {\n\t\t\t\t\ty = ry;\n\t\t\t\t}\n\t\t\t\tif (y < 0) {\n\t\t\t\t\ty = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\ty = 0;\n\t\t\t}\n\t\t\tview->setPosition((sl_ui_pos)-x, (sl_ui_pos)-y, mode);\n\t\t}\n\t}\n}\n\nvoid ScrollView::_onScroll_NW(sl_scroll_pos x, sl_scroll_pos y)\n{\n\tView::scrollTo(x, y, UIUpdateMode::NoRedraw);\n}\n\n\n#if !(defined(SLIB_PLATFORM_IS_OSX)) && !(defined(SLIB_PLATFORM_IS_IOS)) && !(defined(SLIB_PLATFORM_IS_WIN32)) && !(defined(SLIB_PLATFORM_IS_ANDROID))\n\nRef<ViewInstance> ScrollView::createNativeWidget(ViewInstance* parent)\n{\n\treturn sl_null;\n}\n\nvoid ScrollView::_refreshContentSize_NW()\n{\n}\n\nvoid ScrollView::_setContentView_NW(const Ref<View>& view)\n{\n}\n\nvoid ScrollView::_scrollTo_NW(sl_scroll_pos x, sl_scroll_pos y)\n{\n}\n\nScrollPoint ScrollView::_getScrollPosition_NW()\n{\n\treturn ScrollPoint::zero();\n}\n\nScrollPoint ScrollView::_getScrollRange_NW()\n{\n\treturn ScrollPoint::zero();\n}\n\nvoid ScrollView::_setBorder_NW(sl_bool flag)\n{\n}\n\nvoid ScrollView::_setBackgroundColor_NW(const Color& color)\n{\n}\n\n#endif\n\n\n#if !(defined(SLIB_PLATFORM_IS_IOS)) && !(defined(SLIB_PLATFORM_IS_ANDROID))\n\nvoid ScrollView::_setPaging_NW(sl_bool flagPaging, sl_ui_len pageWidth, sl_ui_len pageHeight)\n{\n}\n\nvoid ScrollView::_setScrollBarsVisible_NW(sl_bool flagHorizontal, sl_bool flagVertical)\n{\n}\n\n#endif\n\n\nHorizontalScrollView::HorizontalScrollView()\n{\n\tsetHorizontalScrolling(sl_true);\n\tsetVerticalScrolling(sl_false);\n}\n\nVerticalScrollView::VerticalScrollView()\n{\n\tsetHorizontalScrolling(sl_false);\n\tsetVerticalScrolling(sl_true);\n}\n\nSLIB_UI_NAMESPACE_END\n<commit_msg>setMakingLayout in scrollview<commit_after>#include \"..\/..\/..\/inc\/slib\/ui\/scroll_view.h\"\n#include \"..\/..\/..\/inc\/slib\/ui\/core.h\"\n\nSLIB_UI_NAMESPACE_BEGIN\n\nSLIB_DEFINE_OBJECT(ScrollView, View)\n\nScrollView::ScrollView()\n{\n\tSLIB_REFERABLE_CONSTRUCTOR\n\n\tsetCreatingNativeWidget(sl_true);\n\tsetCreatingChildInstances(sl_false);\n    setMakingLayout(sl_true, UIUpdateMode::Init);\n    setBorder(sl_true, UIUpdateMode::Init);\n\n\tm_flagPaging = sl_false;\n\tm_pageWidth = 0;\n\tm_pageHeight = 0;\n\t\n\tsetHorizontalScrolling(sl_true);\n\tsetVerticalScrolling(sl_true);\n    \n}\n\nRef<View> ScrollView::getContentView()\n{\n\treturn m_viewContent;\n}\n\nvoid ScrollView::setContentView(const Ref<slib::View>& view, UIUpdateMode mode)\n{\n\tObjectLocker lock(this);\n\tif (m_viewContent != view) {\n\t\tRef<View> viewOld = m_viewContent;\n\t\tremoveChild(viewOld, UIUpdateMode::NoRedraw);\n\t\tm_viewContent = view;\n\t\tif (view.isNotNull()) {\n\t\t\tview->setParent(this);\n\t\t\tview->setCreatingInstance(sl_true);\n\t\t\tview->setAttachMode(UIAttachMode::NotAttach);\n\t\t\tif (mode == UIUpdateMode::Init) {\n\t\t\t\taddChild(view, UIUpdateMode::Init);\n\t\t\t} else {\n\t\t\t\taddChild(view, UIUpdateMode::NoRedraw);\n\t\t\t}\n\t\t\tView::setContentSize(view->getWidth(), view->getHeight(), UIUpdateMode::NoRedraw);\n\t\t} else {\n\t\t\tView::setContentSize(0, 0, UIUpdateMode::NoRedraw);\n\t\t}\n\t\tif (mode != UIUpdateMode::Init) {\n\t\t\tif (isNativeWidget()) {\n\t\t\t\tif (UI::isUiThread()) {\n\t\t\t\t\t_setContentView_NW(view);\n\t\t\t\t} else {\n\t\t\t\t\tUI::dispatchToUiThread(SLIB_BIND_WEAKREF(void(), ScrollView, _setContentView_NW, this, view));\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tUIPoint pt = View::getScrollPosition();\n\t\t\t\t_scrollTo(pt.x, pt.y, UIUpdateMode::NoRedraw);\n\t\t\t\tif (mode == UIUpdateMode::Redraw) {\n\t\t\t\t\tinvalidate();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid ScrollView::setContentSize(sl_scroll_pos _width, sl_scroll_pos _height, UIUpdateMode mode)\n{\n\tsl_ui_pos width = (sl_ui_pos)(_width);\n\tif (width < 0) {\n\t\twidth = 0;\n\t}\n\tsl_ui_pos height = (sl_ui_pos)(_height);\n\tif (height < 0) {\n\t\theight = 0;\n\t}\n\tObjectLocker lock(this);\n\tRef<View> viewContent = m_viewContent;\n\tif (viewContent.isNotNull()) {\n\t\tif (mode == UIUpdateMode::Init) {\n\t\t\tviewContent->setSize(width, height, UIUpdateMode::Init);\n\t\t} else {\n\t\t\tviewContent->setSize(width, height, UIUpdateMode::NoRedraw);\n\t\t}\n\t}\n\tView::setContentSize(_width, _height, mode);\n\tif (isNativeWidget()) {\n\t\t_refreshContentSize_NW();\n\t}\n}\n\nvoid ScrollView::setContentSize(const ScrollPoint& size, UIUpdateMode mode)\n{\n\tsetContentSize(size.x, size.y, mode);\n}\n\nScrollPoint ScrollView::getScrollPosition()\n{\n\tif (isNativeWidget()) {\n\t\treturn _getScrollPosition_NW();\n\t}\n\treturn View::getScrollPosition();\n}\n\nScrollPoint ScrollView::getScrollRange()\n{\n\tif (isNativeWidget()) {\n\t\treturn _getScrollRange_NW();\n\t}\n\treturn View::getScrollRange();\n}\n\nvoid ScrollView::scrollTo(sl_scroll_pos x, sl_scroll_pos y, UIUpdateMode mode)\n{\n\t_scrollTo(x, y, UIUpdateMode::NoRedraw);\n\tView::scrollTo(x, y, mode);\n}\n\nvoid ScrollView::scrollTo(const ScrollPoint& position, UIUpdateMode mode)\n{\n\tscrollTo(position.x, position.y, mode);\n}\n\nsl_bool ScrollView::isPaging()\n{\n\treturn m_flagPaging;\n}\n\nvoid ScrollView::setPaging(sl_bool flagPaging)\n{\n\tm_flagPaging = flagPaging;\n\t_updatePaging();\n}\n\nsl_ui_len ScrollView::getPageWidth()\n{\n\treturn m_pageWidth;\n}\n\nvoid ScrollView::setPageWidth(sl_ui_len width)\n{\n\tm_pageWidth = width;\n\t_updatePaging();\n}\n\nsl_ui_len ScrollView::getPageHeight()\n{\n\treturn m_pageHeight;\n}\n\nvoid ScrollView::setPageHeight(sl_ui_len height)\n{\n\tm_pageHeight = height;\n\t_updatePaging();\n}\n\nvoid ScrollView::setScrollBarsVisible(sl_bool flagHorizontal, sl_bool flagVertical, UIUpdateMode mode)\n{\n\tView::setScrollBarsVisible(flagHorizontal, flagVertical, mode);\n\t_setScrollBarsVisible_NW(flagHorizontal, flagVertical);\n}\n\nvoid ScrollView::_updatePaging()\n{\n\t_setPaging_NW(m_flagPaging, m_pageWidth, m_pageHeight);\n}\n\nvoid ScrollView::onResize(sl_ui_len width, sl_ui_len height)\n{\n\tif (isNativeWidget()) {\n\t\t_refreshContentSize_NW();\n\t}\n}\n\nvoid ScrollView::onResizeChild(View* child, sl_ui_len width, sl_ui_len height)\n{\n\tif (child == m_viewContent) {\n\t\tView::setContentSize(width, height);\n\t\tif (isNativeWidget()) {\n\t\t\t_refreshContentSize_NW();\n\t\t}\n\t}\n}\n\nvoid ScrollView::onMeasureLayout(sl_bool flagHorizontal, sl_bool flagVertical)\n{\n}\n\nvoid ScrollView::onMakeLayout()\n{\t\n}\n\nvoid ScrollView::_scrollTo(sl_scroll_pos x, sl_scroll_pos y, UIUpdateMode mode)\n{\n\tRef<View> view = m_viewContent;\n\tif (view.isNotNull()) {\n\t\tif (isNativeWidget()) {\n\t\t\t_scrollTo_NW(x, y);\n\t\t} else {\n\t\t\tsl_ui_len w = getWidth();\n\t\t\tsl_ui_len cw = view->getWidth();\n\t\t\tif (cw > w) {\n\t\t\t\tsl_ui_pos rx = cw - w;\n\t\t\t\tif (x > (sl_scroll_pos)rx) {\n\t\t\t\t\tx = rx;\n\t\t\t\t}\n\t\t\t\tif (x < 0) {\n\t\t\t\t\tx = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tx = 0;\n\t\t\t}\n\t\t\tsl_ui_len h = getHeight();\n\t\t\tsl_ui_len ch = view->getHeight();\n\t\t\tif (ch > h) {\n\t\t\t\tsl_ui_pos ry = ch - h;\n\t\t\t\tif (y > (sl_scroll_pos)ry) {\n\t\t\t\t\ty = ry;\n\t\t\t\t}\n\t\t\t\tif (y < 0) {\n\t\t\t\t\ty = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\ty = 0;\n\t\t\t}\n\t\t\tview->setPosition((sl_ui_pos)-x, (sl_ui_pos)-y, mode);\n\t\t}\n\t}\n}\n\nvoid ScrollView::_onScroll_NW(sl_scroll_pos x, sl_scroll_pos y)\n{\n\tView::scrollTo(x, y, UIUpdateMode::NoRedraw);\n}\n\n\n#if !(defined(SLIB_PLATFORM_IS_OSX)) && !(defined(SLIB_PLATFORM_IS_IOS)) && !(defined(SLIB_PLATFORM_IS_WIN32)) && !(defined(SLIB_PLATFORM_IS_ANDROID))\n\nRef<ViewInstance> ScrollView::createNativeWidget(ViewInstance* parent)\n{\n\treturn sl_null;\n}\n\nvoid ScrollView::_refreshContentSize_NW()\n{\n}\n\nvoid ScrollView::_setContentView_NW(const Ref<View>& view)\n{\n}\n\nvoid ScrollView::_scrollTo_NW(sl_scroll_pos x, sl_scroll_pos y)\n{\n}\n\nScrollPoint ScrollView::_getScrollPosition_NW()\n{\n\treturn ScrollPoint::zero();\n}\n\nScrollPoint ScrollView::_getScrollRange_NW()\n{\n\treturn ScrollPoint::zero();\n}\n\nvoid ScrollView::_setBorder_NW(sl_bool flag)\n{\n}\n\nvoid ScrollView::_setBackgroundColor_NW(const Color& color)\n{\n}\n\n#endif\n\n\n#if !(defined(SLIB_PLATFORM_IS_IOS)) && !(defined(SLIB_PLATFORM_IS_ANDROID))\n\nvoid ScrollView::_setPaging_NW(sl_bool flagPaging, sl_ui_len pageWidth, sl_ui_len pageHeight)\n{\n}\n\nvoid ScrollView::_setScrollBarsVisible_NW(sl_bool flagHorizontal, sl_bool flagVertical)\n{\n}\n\n#endif\n\n\nHorizontalScrollView::HorizontalScrollView()\n{\n\tsetHorizontalScrolling(sl_true);\n\tsetVerticalScrolling(sl_false);\n}\n\nVerticalScrollView::VerticalScrollView()\n{\n\tsetHorizontalScrolling(sl_false);\n\tsetVerticalScrolling(sl_true);\n}\n\nSLIB_UI_NAMESPACE_END\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 QtLocation 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#include <qgeopositioninfosource.h>\n#include \"qgeopositioninfosource_p.h\"\n#include \"qgeopositioninfosourcefactory.h\"\n\n#include <QFile>\n#include <QPluginLoader>\n#include <QStringList>\n#include <QJsonObject>\n#include <QCryptographicHash>\n#include <QtCore\/private\/qfactoryloader_p.h>\n#include <QtCore\/private\/qlibrary_p.h>\n\nQT_BEGIN_NAMESPACE\n\n#ifndef QT_NO_LIBRARY\nQ_GLOBAL_STATIC_WITH_ARGS(QFactoryLoader, loader,\n        (\"org.qt-project.qt.position.sourcefactory\/5.0\",\n         QStringLiteral(\"\/position\")))\n#endif\n\n\/*!\n    \\class QGeoPositionInfoSource\n    \\inmodule QtLocation\n    \\ingroup QtLocation-positioning\n    \\since Qt Location 5.0\n\n    \\brief The QGeoPositionInfoSource class is an abstract base class for the distribution of positional updates.\n\n    The static function QGeoPositionInfoSource::createDefaultSource() creates a default\n    position source that is appropriate for the platform, if one is available.\n    Otherwise, QGeoPositionInfoSource will check for available plugins that\n    implement the QGeoPositionInfoSourceFactory interface.\n\n    Users of a QGeoPositionInfoSource subclass can request the current position using\n    requestUpdate(), or start and stop regular position updates using\n    startUpdates() and stopUpdates(). When an update is available,\n    positionUpdated() is emitted. The last known position can be accessed with\n    lastKnownPosition().\n\n    If regular position updates are required, setUpdateInterval() can be used\n    to specify how often these updates should be emitted. If no interval is\n    specified, updates are simply provided whenever they are available.\n    For example:\n\n    \\code\n        \/\/ Emit updates every 10 seconds if available\n        QGeoPositionInfoSource *source = QGeoPositionInfoSource::createDefaultSource(0);\n        if (source)\n            source->setUpdateInterval(10000);\n    \\endcode\n\n    To remove an update interval that was previously set, call\n    setUpdateInterval() with a value of 0.\n\n    Note that the position source may have a minimum value requirement for\n    update intervals, as returned by minimumUpdateInterval().\n\n    \\warning On Windows CE it is not possible to detect if a device is GPS enabled.\n    The default position source on a Windows CE device without GPS support will never provide any position data.\n*\/\n\n\/*!\n    \\enum QGeoPositionInfoSource::PositioningMethod\n    Defines the types of positioning methods.\n\n    \\value SatellitePositioningMethods Satellite-based positioning methods such as GPS or GLONASS.\n    \\value NonSatellitePositioningMethods Other positioning methods such as 3GPP cell identifier or WiFi based positioning.\n    \\value AllPositioningMethods Satellite-based positioning methods as soon as available. Otherwise non-satellite based methods.\n*\/\n\nvoid QGeoPositionInfoSourcePrivate::loadMeta()\n{\n    metaData = plugins().value(providerName);\n}\n\nvoid QGeoPositionInfoSourcePrivate::loadPlugin()\n{\n    int idx = int(metaData.value(QStringLiteral(\"index\")).toDouble());\n    if (idx < 0)\n        return;\n    factory = qobject_cast<QGeoPositionInfoSourceFactory *>(loader()->instance(idx));\n}\n\nQHash<QString, QJsonObject> QGeoPositionInfoSourcePrivate::plugins(bool reload)\n{\n    static QHash<QString, QJsonObject> plugins;\n    static bool alreadyDiscovered = false;\n\n    if (reload == true)\n        alreadyDiscovered = false;\n\n    if (!alreadyDiscovered) {\n        loadPluginMetadata(plugins);\n        alreadyDiscovered = true;\n    }\n    return plugins;\n}\n\nstatic bool pluginComparator(const QJsonObject &p1, const QJsonObject &p2)\n{\n    const QString prio = QStringLiteral(\"Priority\");\n    if (p1.contains(prio) && !p2.contains(prio))\n        return true;\n    if (!p1.contains(prio) && p2.contains(prio))\n        return false;\n    if (p1.value(prio).isDouble() && !p2.value(prio).isDouble())\n        return true;\n    if (!p1.value(prio).isDouble() && p2.value(prio).isDouble())\n        return false;\n    return (p1.value(prio).toDouble() > p2.value(prio).toDouble());\n}\n\nQList<QJsonObject> QGeoPositionInfoSourcePrivate::pluginsSorted()\n{\n    QList<QJsonObject> list = plugins().values();\n    qStableSort(list.begin(), list.end(), pluginComparator);\n    return list;\n}\n\nvoid QGeoPositionInfoSourcePrivate::loadPluginMetadata(QHash<QString, QJsonObject> &plugins)\n{\n    QFactoryLoader *l = loader();\n    QList<QJsonObject> meta = l->metaData();\n    for (int i = 0; i < meta.size(); ++i) {\n        QJsonObject obj = meta.at(i).value(QStringLiteral(\"MetaData\")).toObject();\n        obj.insert(QStringLiteral(\"index\"), i);\n        plugins.insertMulti(obj.value(QStringLiteral(\"Provider\")).toString(), obj);\n    }\n}\n\n\/*!\n    Creates a position source with the specified \\a parent.\n*\/\n\nQGeoPositionInfoSource::QGeoPositionInfoSource(QObject *parent)\n        : QObject(parent),\n        d(new QGeoPositionInfoSourcePrivate)\n{\n    d->interval = 0;\n    d->methods = 0;\n}\n\n\/*!\n    Destroys the position source.\n*\/\nQGeoPositionInfoSource::~QGeoPositionInfoSource()\n{\n    delete d;\n}\n\n\/*!\n    \\property QGeoPositionInfoSource::sourceName\n    \\brief This property holds the unique name of the position source\n           implementation in use.\n\n    This is the same name that can be passed to createSource() in order to\n    create a new instance of a particular position source implementation.\n*\/\nQString QGeoPositionInfoSource::sourceName() const\n{\n    return d->metaData.value(QStringLiteral(\"Provider\")).toString();\n}\n\n\/*!\n    \\property QGeoPositionInfoSource::updateInterval\n    \\brief This property holds the requested interval in milliseconds between each update.\n\n    If the update interval is not set (or is set to 0) the\n    source will provide updates as often as necessary.\n\n    If the update interval is set, the source will provide updates at an\n    interval as close to the requested interval as possible. If the requested\n    interval is less than the minimumUpdateInterval(),\n    the minimum interval is used instead.\n\n    Changes to the update interval will happen as soon as is practical, however the\n    time the change takes may vary between implementations.  Whether or not the elapsed\n    time from the previous interval is counted as part of the new interval is also\n    implementation dependent.\n\n    The default value for this property is 0.\n\n    Note: Subclass implementations must call the base implementation of\n    setUpdateInterval() so that updateInterval() returns the correct value.\n*\/\nvoid QGeoPositionInfoSource::setUpdateInterval(int msec)\n{\n    d->interval = msec;\n}\n\nint QGeoPositionInfoSource::updateInterval() const\n{\n    return d->interval;\n}\n\n\/*!\n    Sets the preferred positioning methods for this source to \\a methods.\n\n    If \\a methods includes a method that is not supported by the source, the\n    unsupported method will be ignored.\n\n    If \\a methods does not include any methods supported by the source, the\n    preferred methods will be set to the set of methods which the source supports.\n\n    \\b {Note:} When reimplementing this method, subclasses must call the\n    base method implementation to ensure preferredPositioningMethods() returns the correct value.\n\n    \\sa supportedPositioningMethods()\n*\/\nvoid QGeoPositionInfoSource::setPreferredPositioningMethods(PositioningMethods methods)\n{\n    d->methods = methods & supportedPositioningMethods();\n    if (d->methods == 0) {\n        d->methods = supportedPositioningMethods();\n    }\n}\n\n\/*!\n    Returns the positioning methods set by setPreferredPositioningMethods().\n*\/\nQGeoPositionInfoSource::PositioningMethods QGeoPositionInfoSource::preferredPositioningMethods() const\n{\n    return d->methods;\n}\n\n\/*!\n    Creates and returns a position source with the given \\a parent that\n    reads from the system's default sources of location data, or the plugin\n    with the highest available priority.\n\n    Returns 0 if the system has no default position source, no valid plugins\n    could be found or the user does not have the permission to access the current position.\n*\/\nQGeoPositionInfoSource *QGeoPositionInfoSource::createDefaultSource(QObject *parent)\n{\n    QGeoPositionInfoSourcePrivate *d = new QGeoPositionInfoSourcePrivate;\n\n    QList<QJsonObject> plugins = QGeoPositionInfoSourcePrivate::pluginsSorted();\n    foreach (const QJsonObject &obj, plugins) {\n        if (obj.value(QStringLiteral(\"Position\")).isBool()\n                && obj.value(QStringLiteral(\"Position\")).toBool()) {\n            d->metaData = obj;\n            d->loadPlugin();\n            QGeoPositionInfoSource *s = d->factory->positionInfoSource(parent);\n            if (s) {\n                s->d->metaData = d->metaData;\n                delete d;\n                return s;\n            }\n        }\n    }\n\n    delete d;\n    return 0;\n}\n\n\n\/*!\n    Creates and returns a position source with the given \\a parent,\n    by loading the plugin named \\a sourceName.\n\n    Returns 0 if the plugin cannot be found.\n*\/\nQGeoPositionInfoSource *QGeoPositionInfoSource::createSource(const QString &sourceName, QObject *parent)\n{\n    QGeoPositionInfoSourcePrivate *d = new QGeoPositionInfoSourcePrivate;\n    QHash<QString, QJsonObject> plugins = QGeoPositionInfoSourcePrivate::plugins();\n    if (plugins.contains(sourceName)) {\n        d->metaData = plugins.value(sourceName);\n        d->loadPlugin();\n        QGeoPositionInfoSource *src = d->factory->positionInfoSource(parent);\n        if (src) {\n            src->d->metaData = d->metaData;\n            delete d;\n            return src;\n        }\n    }\n\n    delete d;\n    return 0;\n}\n\n\n\/*!\n    Returns a list of available source plugins. This includes any default backend\n    plugin for the current platform.\n*\/\nQStringList QGeoPositionInfoSource::availableSources()\n{\n    QStringList plugins;\n    QHash<QString, QJsonObject> meta = QGeoPositionInfoSourcePrivate::plugins();\n    foreach (const QString &name, meta.keys()) {\n        if (meta.value(name).value(QStringLiteral(\"Position\")).isBool()\n                && meta.value(name).value(QStringLiteral(\"Position\")).toBool()) {\n            plugins << name;\n        }\n    }\n\n    return plugins;\n}\n\n\/*!\n    \\fn QGeoPositionInfo QGeoPositionInfoSource::lastKnownPosition(bool fromSatellitePositioningMethodsOnly = false) const = 0;\n\n    Returns an update containing the last known position, or a null update\n    if none is available.\n\n    If \\a fromSatellitePositioningMethodsOnly is true, this returns the last\n    known position received from a satellite positioning method; if none\n    is available, a null update is returned.\n*\/\n\n\/*!\n    \\fn virtual PositioningMethods QGeoPositionInfoSource::supportedPositioningMethods() const = 0;\n\n    Returns the positioning methods available to this source.\n\n    \\sa setPreferredPositioningMethods()\n*\/\n\n\n\/*!\n    \\property QGeoPositionInfoSource::minimumUpdateInterval\n    \\brief This property holds the minimum time (in milliseconds) required to retrieve a position update.\n\n    This is the minimum value accepted by setUpdateInterval() and\n    requestUpdate().\n*\/\n\n\n\/*!\n    \\fn virtual void QGeoPositionInfoSource::startUpdates() = 0;\n\n    Starts emitting updates at regular intervals as specified by setUpdateInterval().\n\n    If setUpdateInterval() has not been called, the source will emit updates\n    as soon as they become available.\n\n    An updateTimout() signal will be emitted if this QGeoPositionInfoSource subclass determines\n    that it will not be able to provide regular updates.  This could happen if a satellite fix is\n    lost or if a hardware error is detected.  Position updates will recommence if the data becomes\n    available later on.  The updateTimout() signal will not be emitted again until after the\n    periodic updates resume.\n*\/\n\n\/*!\n    \\fn virtual void QGeoPositionInfoSource::stopUpdates() = 0;\n\n    Stops emitting updates at regular intervals.\n*\/\n\n\/*!\n    \\fn virtual void QGeoPositionInfoSource::requestUpdate(int timeout = 0);\n\n    Attempts to get the current position and emit positionUpdated() with\n    this information. If the current position cannot be found within the given \\a timeout\n    (in milliseconds) or if \\a timeout is less than the value returned by\n    minimumUpdateInterval(), updateTimeout() is emitted.\n\n    If the timeout is zero, the timeout defaults to a reasonable timeout\n    period as appropriate for the source.\n\n    This does nothing if another update request is in progress. However\n    it can be called even if startUpdates() has already been called and\n    regular updates are in progress.\n\n    If the source uses multiple positioning methods, it tries to get the\n    current position from the most accurate positioning method within the\n    given timeout.\n*\/\n\n\/*!\n     \\fn virtual QGeoPositionInfoSource::Error QGeoPositionInfoSource::error() const;\n\n     Returns the type of error that last occurred.\n\n*\/\n\n\/*!\n    \\fn void QGeoPositionInfoSource::positionUpdated(const QGeoPositionInfo &update);\n\n    If startUpdates() or requestUpdate() is called, this signal is emitted\n    when an update becomes available.\n\n    The \\a update value holds the value of the new update.\n*\/\n\n\/*!\n    \\fn void QGeoPositionInfoSource::updateTimeout();\n\n    If requestUpdate() was called, this signal will be emitted if the current position could not\n    be retrieved within the specified timeout.\n\n    If startUpdates() has been called, this signal will be emitted if this QGeoPositionInfoSource\n    subclass determines that it will not be able to provide further regular updates.  This signal\n    will not be emitted again until after the regular updates resume.\n*\/\n\n\/*!\n    \\fn void QGeoPositionInfoSource::error(QGeoPositionInfoSource::Error positioningError)\n\n    This signal is emitted after an error occurred. The \\a positioningError\n    parameter describes the type of error that occurred.\n\n*\/\n\n\/*!\n    \\enum QGeoPositionInfoSource::Error\n\n    The Error enumeration represents the errors which can occur.\n\n    \\value AccessError The connection setup to the remote positioning backend failed because the\n        application lacked the required privileges.\n    \\value ClosedError  The remote positioning backend closed the connection, which happens for example in case\n        the user is switching location services to off. This object becomes invalid and should be deleted.\n        A call to createDefaultSource() can be used to create a new source later on.\n    \\value UnknownSourceError An unidentified error occurred.\n *\/\n\n#include \"moc_qgeopositioninfosource.cpp\"\n\nQT_END_NAMESPACE\n<commit_msg>Q_GLOBAL_STATIC's use of noexcept makes QStringLiteral not work<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 QtLocation 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#include <qgeopositioninfosource.h>\n#include \"qgeopositioninfosource_p.h\"\n#include \"qgeopositioninfosourcefactory.h\"\n\n#include <QFile>\n#include <QPluginLoader>\n#include <QStringList>\n#include <QJsonObject>\n#include <QCryptographicHash>\n#include <QtCore\/private\/qfactoryloader_p.h>\n#include <QtCore\/private\/qlibrary_p.h>\n\nQT_BEGIN_NAMESPACE\n\n#ifndef QT_NO_LIBRARY\nQ_GLOBAL_STATIC_WITH_ARGS(QFactoryLoader, loader,\n        (\"org.qt-project.qt.position.sourcefactory\/5.0\",\n         QLatin1String(\"\/position\")))\n#endif\n\n\/*!\n    \\class QGeoPositionInfoSource\n    \\inmodule QtLocation\n    \\ingroup QtLocation-positioning\n    \\since Qt Location 5.0\n\n    \\brief The QGeoPositionInfoSource class is an abstract base class for the distribution of positional updates.\n\n    The static function QGeoPositionInfoSource::createDefaultSource() creates a default\n    position source that is appropriate for the platform, if one is available.\n    Otherwise, QGeoPositionInfoSource will check for available plugins that\n    implement the QGeoPositionInfoSourceFactory interface.\n\n    Users of a QGeoPositionInfoSource subclass can request the current position using\n    requestUpdate(), or start and stop regular position updates using\n    startUpdates() and stopUpdates(). When an update is available,\n    positionUpdated() is emitted. The last known position can be accessed with\n    lastKnownPosition().\n\n    If regular position updates are required, setUpdateInterval() can be used\n    to specify how often these updates should be emitted. If no interval is\n    specified, updates are simply provided whenever they are available.\n    For example:\n\n    \\code\n        \/\/ Emit updates every 10 seconds if available\n        QGeoPositionInfoSource *source = QGeoPositionInfoSource::createDefaultSource(0);\n        if (source)\n            source->setUpdateInterval(10000);\n    \\endcode\n\n    To remove an update interval that was previously set, call\n    setUpdateInterval() with a value of 0.\n\n    Note that the position source may have a minimum value requirement for\n    update intervals, as returned by minimumUpdateInterval().\n\n    \\warning On Windows CE it is not possible to detect if a device is GPS enabled.\n    The default position source on a Windows CE device without GPS support will never provide any position data.\n*\/\n\n\/*!\n    \\enum QGeoPositionInfoSource::PositioningMethod\n    Defines the types of positioning methods.\n\n    \\value SatellitePositioningMethods Satellite-based positioning methods such as GPS or GLONASS.\n    \\value NonSatellitePositioningMethods Other positioning methods such as 3GPP cell identifier or WiFi based positioning.\n    \\value AllPositioningMethods Satellite-based positioning methods as soon as available. Otherwise non-satellite based methods.\n*\/\n\nvoid QGeoPositionInfoSourcePrivate::loadMeta()\n{\n    metaData = plugins().value(providerName);\n}\n\nvoid QGeoPositionInfoSourcePrivate::loadPlugin()\n{\n    int idx = int(metaData.value(QStringLiteral(\"index\")).toDouble());\n    if (idx < 0)\n        return;\n    factory = qobject_cast<QGeoPositionInfoSourceFactory *>(loader()->instance(idx));\n}\n\nQHash<QString, QJsonObject> QGeoPositionInfoSourcePrivate::plugins(bool reload)\n{\n    static QHash<QString, QJsonObject> plugins;\n    static bool alreadyDiscovered = false;\n\n    if (reload == true)\n        alreadyDiscovered = false;\n\n    if (!alreadyDiscovered) {\n        loadPluginMetadata(plugins);\n        alreadyDiscovered = true;\n    }\n    return plugins;\n}\n\nstatic bool pluginComparator(const QJsonObject &p1, const QJsonObject &p2)\n{\n    const QString prio = QStringLiteral(\"Priority\");\n    if (p1.contains(prio) && !p2.contains(prio))\n        return true;\n    if (!p1.contains(prio) && p2.contains(prio))\n        return false;\n    if (p1.value(prio).isDouble() && !p2.value(prio).isDouble())\n        return true;\n    if (!p1.value(prio).isDouble() && p2.value(prio).isDouble())\n        return false;\n    return (p1.value(prio).toDouble() > p2.value(prio).toDouble());\n}\n\nQList<QJsonObject> QGeoPositionInfoSourcePrivate::pluginsSorted()\n{\n    QList<QJsonObject> list = plugins().values();\n    qStableSort(list.begin(), list.end(), pluginComparator);\n    return list;\n}\n\nvoid QGeoPositionInfoSourcePrivate::loadPluginMetadata(QHash<QString, QJsonObject> &plugins)\n{\n    QFactoryLoader *l = loader();\n    QList<QJsonObject> meta = l->metaData();\n    for (int i = 0; i < meta.size(); ++i) {\n        QJsonObject obj = meta.at(i).value(QStringLiteral(\"MetaData\")).toObject();\n        obj.insert(QStringLiteral(\"index\"), i);\n        plugins.insertMulti(obj.value(QStringLiteral(\"Provider\")).toString(), obj);\n    }\n}\n\n\/*!\n    Creates a position source with the specified \\a parent.\n*\/\n\nQGeoPositionInfoSource::QGeoPositionInfoSource(QObject *parent)\n        : QObject(parent),\n        d(new QGeoPositionInfoSourcePrivate)\n{\n    d->interval = 0;\n    d->methods = 0;\n}\n\n\/*!\n    Destroys the position source.\n*\/\nQGeoPositionInfoSource::~QGeoPositionInfoSource()\n{\n    delete d;\n}\n\n\/*!\n    \\property QGeoPositionInfoSource::sourceName\n    \\brief This property holds the unique name of the position source\n           implementation in use.\n\n    This is the same name that can be passed to createSource() in order to\n    create a new instance of a particular position source implementation.\n*\/\nQString QGeoPositionInfoSource::sourceName() const\n{\n    return d->metaData.value(QStringLiteral(\"Provider\")).toString();\n}\n\n\/*!\n    \\property QGeoPositionInfoSource::updateInterval\n    \\brief This property holds the requested interval in milliseconds between each update.\n\n    If the update interval is not set (or is set to 0) the\n    source will provide updates as often as necessary.\n\n    If the update interval is set, the source will provide updates at an\n    interval as close to the requested interval as possible. If the requested\n    interval is less than the minimumUpdateInterval(),\n    the minimum interval is used instead.\n\n    Changes to the update interval will happen as soon as is practical, however the\n    time the change takes may vary between implementations.  Whether or not the elapsed\n    time from the previous interval is counted as part of the new interval is also\n    implementation dependent.\n\n    The default value for this property is 0.\n\n    Note: Subclass implementations must call the base implementation of\n    setUpdateInterval() so that updateInterval() returns the correct value.\n*\/\nvoid QGeoPositionInfoSource::setUpdateInterval(int msec)\n{\n    d->interval = msec;\n}\n\nint QGeoPositionInfoSource::updateInterval() const\n{\n    return d->interval;\n}\n\n\/*!\n    Sets the preferred positioning methods for this source to \\a methods.\n\n    If \\a methods includes a method that is not supported by the source, the\n    unsupported method will be ignored.\n\n    If \\a methods does not include any methods supported by the source, the\n    preferred methods will be set to the set of methods which the source supports.\n\n    \\b {Note:} When reimplementing this method, subclasses must call the\n    base method implementation to ensure preferredPositioningMethods() returns the correct value.\n\n    \\sa supportedPositioningMethods()\n*\/\nvoid QGeoPositionInfoSource::setPreferredPositioningMethods(PositioningMethods methods)\n{\n    d->methods = methods & supportedPositioningMethods();\n    if (d->methods == 0) {\n        d->methods = supportedPositioningMethods();\n    }\n}\n\n\/*!\n    Returns the positioning methods set by setPreferredPositioningMethods().\n*\/\nQGeoPositionInfoSource::PositioningMethods QGeoPositionInfoSource::preferredPositioningMethods() const\n{\n    return d->methods;\n}\n\n\/*!\n    Creates and returns a position source with the given \\a parent that\n    reads from the system's default sources of location data, or the plugin\n    with the highest available priority.\n\n    Returns 0 if the system has no default position source, no valid plugins\n    could be found or the user does not have the permission to access the current position.\n*\/\nQGeoPositionInfoSource *QGeoPositionInfoSource::createDefaultSource(QObject *parent)\n{\n    QGeoPositionInfoSourcePrivate *d = new QGeoPositionInfoSourcePrivate;\n\n    QList<QJsonObject> plugins = QGeoPositionInfoSourcePrivate::pluginsSorted();\n    foreach (const QJsonObject &obj, plugins) {\n        if (obj.value(QStringLiteral(\"Position\")).isBool()\n                && obj.value(QStringLiteral(\"Position\")).toBool()) {\n            d->metaData = obj;\n            d->loadPlugin();\n            QGeoPositionInfoSource *s = d->factory->positionInfoSource(parent);\n            if (s) {\n                s->d->metaData = d->metaData;\n                delete d;\n                return s;\n            }\n        }\n    }\n\n    delete d;\n    return 0;\n}\n\n\n\/*!\n    Creates and returns a position source with the given \\a parent,\n    by loading the plugin named \\a sourceName.\n\n    Returns 0 if the plugin cannot be found.\n*\/\nQGeoPositionInfoSource *QGeoPositionInfoSource::createSource(const QString &sourceName, QObject *parent)\n{\n    QGeoPositionInfoSourcePrivate *d = new QGeoPositionInfoSourcePrivate;\n    QHash<QString, QJsonObject> plugins = QGeoPositionInfoSourcePrivate::plugins();\n    if (plugins.contains(sourceName)) {\n        d->metaData = plugins.value(sourceName);\n        d->loadPlugin();\n        QGeoPositionInfoSource *src = d->factory->positionInfoSource(parent);\n        if (src) {\n            src->d->metaData = d->metaData;\n            delete d;\n            return src;\n        }\n    }\n\n    delete d;\n    return 0;\n}\n\n\n\/*!\n    Returns a list of available source plugins. This includes any default backend\n    plugin for the current platform.\n*\/\nQStringList QGeoPositionInfoSource::availableSources()\n{\n    QStringList plugins;\n    QHash<QString, QJsonObject> meta = QGeoPositionInfoSourcePrivate::plugins();\n    foreach (const QString &name, meta.keys()) {\n        if (meta.value(name).value(QStringLiteral(\"Position\")).isBool()\n                && meta.value(name).value(QStringLiteral(\"Position\")).toBool()) {\n            plugins << name;\n        }\n    }\n\n    return plugins;\n}\n\n\/*!\n    \\fn QGeoPositionInfo QGeoPositionInfoSource::lastKnownPosition(bool fromSatellitePositioningMethodsOnly = false) const = 0;\n\n    Returns an update containing the last known position, or a null update\n    if none is available.\n\n    If \\a fromSatellitePositioningMethodsOnly is true, this returns the last\n    known position received from a satellite positioning method; if none\n    is available, a null update is returned.\n*\/\n\n\/*!\n    \\fn virtual PositioningMethods QGeoPositionInfoSource::supportedPositioningMethods() const = 0;\n\n    Returns the positioning methods available to this source.\n\n    \\sa setPreferredPositioningMethods()\n*\/\n\n\n\/*!\n    \\property QGeoPositionInfoSource::minimumUpdateInterval\n    \\brief This property holds the minimum time (in milliseconds) required to retrieve a position update.\n\n    This is the minimum value accepted by setUpdateInterval() and\n    requestUpdate().\n*\/\n\n\n\/*!\n    \\fn virtual void QGeoPositionInfoSource::startUpdates() = 0;\n\n    Starts emitting updates at regular intervals as specified by setUpdateInterval().\n\n    If setUpdateInterval() has not been called, the source will emit updates\n    as soon as they become available.\n\n    An updateTimout() signal will be emitted if this QGeoPositionInfoSource subclass determines\n    that it will not be able to provide regular updates.  This could happen if a satellite fix is\n    lost or if a hardware error is detected.  Position updates will recommence if the data becomes\n    available later on.  The updateTimout() signal will not be emitted again until after the\n    periodic updates resume.\n*\/\n\n\/*!\n    \\fn virtual void QGeoPositionInfoSource::stopUpdates() = 0;\n\n    Stops emitting updates at regular intervals.\n*\/\n\n\/*!\n    \\fn virtual void QGeoPositionInfoSource::requestUpdate(int timeout = 0);\n\n    Attempts to get the current position and emit positionUpdated() with\n    this information. If the current position cannot be found within the given \\a timeout\n    (in milliseconds) or if \\a timeout is less than the value returned by\n    minimumUpdateInterval(), updateTimeout() is emitted.\n\n    If the timeout is zero, the timeout defaults to a reasonable timeout\n    period as appropriate for the source.\n\n    This does nothing if another update request is in progress. However\n    it can be called even if startUpdates() has already been called and\n    regular updates are in progress.\n\n    If the source uses multiple positioning methods, it tries to get the\n    current position from the most accurate positioning method within the\n    given timeout.\n*\/\n\n\/*!\n     \\fn virtual QGeoPositionInfoSource::Error QGeoPositionInfoSource::error() const;\n\n     Returns the type of error that last occurred.\n\n*\/\n\n\/*!\n    \\fn void QGeoPositionInfoSource::positionUpdated(const QGeoPositionInfo &update);\n\n    If startUpdates() or requestUpdate() is called, this signal is emitted\n    when an update becomes available.\n\n    The \\a update value holds the value of the new update.\n*\/\n\n\/*!\n    \\fn void QGeoPositionInfoSource::updateTimeout();\n\n    If requestUpdate() was called, this signal will be emitted if the current position could not\n    be retrieved within the specified timeout.\n\n    If startUpdates() has been called, this signal will be emitted if this QGeoPositionInfoSource\n    subclass determines that it will not be able to provide further regular updates.  This signal\n    will not be emitted again until after the regular updates resume.\n*\/\n\n\/*!\n    \\fn void QGeoPositionInfoSource::error(QGeoPositionInfoSource::Error positioningError)\n\n    This signal is emitted after an error occurred. The \\a positioningError\n    parameter describes the type of error that occurred.\n\n*\/\n\n\/*!\n    \\enum QGeoPositionInfoSource::Error\n\n    The Error enumeration represents the errors which can occur.\n\n    \\value AccessError The connection setup to the remote positioning backend failed because the\n        application lacked the required privileges.\n    \\value ClosedError  The remote positioning backend closed the connection, which happens for example in case\n        the user is switching location services to off. This object becomes invalid and should be deleted.\n        A call to createDefaultSource() can be used to create a new source later on.\n    \\value UnknownSourceError An unidentified error occurred.\n *\/\n\n#include \"moc_qgeopositioninfosource.cpp\"\n\nQT_END_NAMESPACE\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\/\/ Publishes a frozen nav_msgs\/OccupancyGrid map from serialized submaps.\n\n#include <map>\n#include <string>\n\n#include \"cartographer\/io\/proto_stream.h\"\n#include \"cartographer\/io\/proto_stream_deserializer.h\"\n#include \"cartographer\/io\/submap_painter.h\"\n#include \"cartographer\/mapping\/2d\/probability_grid.h\"\n#include \"cartographer\/mapping\/2d\/submap_2d.h\"\n#include \"cartographer\/mapping\/3d\/submap_3d.h\"\n#include \"cartographer\/mapping\/proto\/pose_graph.pb.h\"\n#include \"cartographer\/mapping\/proto\/serialization.pb.h\"\n#include \"cartographer\/mapping\/proto\/submap.pb.h\"\n#include \"cartographer\/mapping\/proto\/trajectory_builder_options.pb.h\"\n#include \"cartographer_ros\/msg_conversion.h\"\n#include \"cartographer_ros\/node_constants.h\"\n#include \"cartographer_ros\/ros_log_sink.h\"\n#include \"cartographer_ros\/ros_map.h\"\n#include \"cartographer_ros\/submap.h\"\n#include \"gflags\/gflags.h\"\n#include \"glog\/logging.h\"\n#include \"nav_msgs\/OccupancyGrid.h\"\n#include \"ros\/ros.h\"\n\nDEFINE_string(pbstream_filename, \"\",\n              \"Filename of a pbstream to draw a map from.\");\nDEFINE_string(map_topic, \"map\", \"Name of the published map topic.\");\nDEFINE_string(map_frame_id, \"map\", \"Frame ID of the published map.\");\nDEFINE_double(resolution, 0.05, \"Resolution of a grid cell in the drawn map.\");\n\nnamespace cartographer_ros {\nnamespace {\n\nvoid Run(const std::string& pbstream_filename, const std::string& map_topic,\n         const std::string& map_frame_id, const double resolution) {\n  ::cartographer::io::ProtoStreamReader reader(pbstream_filename);\n  ::cartographer::io::ProtoStreamDeserializer deserializer(&reader);\n\n  LOG(INFO) << \"Loading submap slices from serialized data.\";\n  std::map<::cartographer::mapping::SubmapId, ::cartographer::io::SubmapSlice>\n      submap_slices;\n  ::cartographer::mapping::proto::SerializedData proto;\n  while (deserializer.ReadNextSerializedData(&proto)) {\n    if (proto.has_submap()) {\n      const auto& submap = proto.submap();\n      const ::cartographer::mapping::SubmapId id{\n          submap.submap_id().trajectory_id(),\n          submap.submap_id().submap_index()};\n      const ::cartographer::transform::Rigid3d global_submap_pose =\n          ::cartographer::transform::ToRigid3(deserializer.pose_graph()\n                                                  .trajectory(id.trajectory_id)\n                                                  .submap(id.submap_index)\n                                                  .pose());\n      FillSubmapSlice(global_submap_pose, submap, &submap_slices[id]);\n    }\n  }\n  CHECK(reader.eof());\n\n  ::ros::NodeHandle node_handle(\"\");\n  ::ros::Publisher pub = node_handle.advertise<nav_msgs::OccupancyGrid>(\n      map_topic, kLatestOnlyPublisherQueueSize, true \/*latched *\/);\n\n  LOG(INFO) << \"Generating combined map image from submap slices.\";\n  const auto painted_slices =\n      ::cartographer::io::PaintSubmapSlices(submap_slices, resolution);\n  std::unique_ptr<nav_msgs::OccupancyGrid> msg_ptr = CreateOccupancyGridMsg(\n      painted_slices, resolution, FLAGS_map_frame_id, ros::Time::now());\n\n  LOG(INFO) << \"Publishing occupancy grid topic \" << map_topic\n            << \" (frame_id: \" << map_frame_id\n            << \", resolution:\" << std::to_string(resolution) << \").\";\n  pub.publish(*msg_ptr);\n  ::ros::spin();\n  ::ros::shutdown();\n}\n\n}  \/\/ namespace\n}  \/\/ namespace cartographer_ros\n\nint main(int argc, char** argv) {\n  FLAGS_alsologtostderr = true;\n  google::InitGoogleLogging(argv[0]);\n  google::ParseCommandLineFlags(&argc, &argv, true);\n\n  CHECK(!FLAGS_pbstream_filename.empty()) << \"-pbstream_filename is missing.\";\n\n  ::ros::init(argc, argv, \"cartographer_pbstream_map_publisher\");\n  ::ros::start();\n\n  cartographer_ros::ScopedRosLogSink ros_log_sink;\n\n  ::cartographer_ros::Run(FLAGS_pbstream_filename, FLAGS_map_topic,\n                          FLAGS_map_frame_id, FLAGS_resolution);\n}\n<commit_msg>Discard proto data in pbstream_map_publisher via RAII. (#912)<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\/\/ Publishes a frozen nav_msgs\/OccupancyGrid map from serialized submaps.\n\n#include <map>\n#include <string>\n\n#include \"cartographer\/io\/proto_stream.h\"\n#include \"cartographer\/io\/proto_stream_deserializer.h\"\n#include \"cartographer\/io\/submap_painter.h\"\n#include \"cartographer\/mapping\/2d\/probability_grid.h\"\n#include \"cartographer\/mapping\/2d\/submap_2d.h\"\n#include \"cartographer\/mapping\/3d\/submap_3d.h\"\n#include \"cartographer\/mapping\/proto\/pose_graph.pb.h\"\n#include \"cartographer\/mapping\/proto\/serialization.pb.h\"\n#include \"cartographer\/mapping\/proto\/submap.pb.h\"\n#include \"cartographer\/mapping\/proto\/trajectory_builder_options.pb.h\"\n#include \"cartographer_ros\/msg_conversion.h\"\n#include \"cartographer_ros\/node_constants.h\"\n#include \"cartographer_ros\/ros_log_sink.h\"\n#include \"cartographer_ros\/ros_map.h\"\n#include \"cartographer_ros\/submap.h\"\n#include \"gflags\/gflags.h\"\n#include \"glog\/logging.h\"\n#include \"nav_msgs\/OccupancyGrid.h\"\n#include \"ros\/ros.h\"\n\nDEFINE_string(pbstream_filename, \"\",\n              \"Filename of a pbstream to draw a map from.\");\nDEFINE_string(map_topic, \"map\", \"Name of the published map topic.\");\nDEFINE_string(map_frame_id, \"map\", \"Frame ID of the published map.\");\nDEFINE_double(resolution, 0.05, \"Resolution of a grid cell in the drawn map.\");\n\nnamespace cartographer_ros {\nnamespace {\n\nstd::unique_ptr<nav_msgs::OccupancyGrid> LoadOccupancyGridMsg(\n    const std::string& pbstream_filename, const double resolution) {\n  ::cartographer::io::ProtoStreamReader reader(pbstream_filename);\n  ::cartographer::io::ProtoStreamDeserializer deserializer(&reader);\n\n  LOG(INFO) << \"Loading submap slices from serialized data.\";\n  std::map<::cartographer::mapping::SubmapId, ::cartographer::io::SubmapSlice>\n      submap_slices;\n  ::cartographer::mapping::proto::SerializedData proto;\n  while (deserializer.ReadNextSerializedData(&proto)) {\n    if (proto.has_submap()) {\n      const auto& submap = proto.submap();\n      const ::cartographer::mapping::SubmapId id{\n          submap.submap_id().trajectory_id(),\n          submap.submap_id().submap_index()};\n      const ::cartographer::transform::Rigid3d global_submap_pose =\n          ::cartographer::transform::ToRigid3(deserializer.pose_graph()\n                                                  .trajectory(id.trajectory_id)\n                                                  .submap(id.submap_index)\n                                                  .pose());\n      FillSubmapSlice(global_submap_pose, submap, &submap_slices[id]);\n    }\n  }\n  CHECK(reader.eof());\n\n  LOG(INFO) << \"Generating combined map image from submap slices.\";\n  const auto painted_slices =\n      ::cartographer::io::PaintSubmapSlices(submap_slices, resolution);\n  return CreateOccupancyGridMsg(painted_slices, resolution, FLAGS_map_frame_id,\n                                ros::Time::now());\n}\n\nvoid Run(const std::string& pbstream_filename, const std::string& map_topic,\n         const std::string& map_frame_id, const double resolution) {\n  std::unique_ptr<nav_msgs::OccupancyGrid> msg_ptr =\n      LoadOccupancyGridMsg(pbstream_filename, resolution);\n\n  ::ros::NodeHandle node_handle(\"\");\n  ::ros::Publisher pub = node_handle.advertise<nav_msgs::OccupancyGrid>(\n      map_topic, kLatestOnlyPublisherQueueSize, true \/*latched *\/);\n\n  LOG(INFO) << \"Publishing occupancy grid topic \" << map_topic\n            << \" (frame_id: \" << map_frame_id\n            << \", resolution:\" << std::to_string(resolution) << \").\";\n  pub.publish(*msg_ptr);\n  ::ros::spin();\n  ::ros::shutdown();\n}\n\n}  \/\/ namespace\n}  \/\/ namespace cartographer_ros\n\nint main(int argc, char** argv) {\n  FLAGS_alsologtostderr = true;\n  google::InitGoogleLogging(argv[0]);\n  google::ParseCommandLineFlags(&argc, &argv, true);\n\n  CHECK(!FLAGS_pbstream_filename.empty()) << \"-pbstream_filename is missing.\";\n\n  ::ros::init(argc, argv, \"cartographer_pbstream_map_publisher\");\n  ::ros::start();\n\n  cartographer_ros::ScopedRosLogSink ros_log_sink;\n\n  ::cartographer_ros::Run(FLAGS_pbstream_filename, FLAGS_map_topic,\n                          FLAGS_map_frame_id, FLAGS_resolution);\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\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/extensions\/extension_icon_manager.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/extensions\/extension_resource.h\"\n#include \"chrome\/common\/json_value_serializer.h\"\n#include \"content\/browser\/browser_thread.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"ui\/gfx\/skia_util.h\"\n\n\/\/ Our test class that takes care of managing the necessary threads for loading\n\/\/ extension icons, and waiting for those loads to happen.\nclass ExtensionIconManagerTest : public testing::Test {\n public:\n  ExtensionIconManagerTest() :\n      unwaited_image_loads_(0),\n      waiting_(false),\n      ui_thread_(BrowserThread::UI, &ui_loop_),\n      file_thread_(BrowserThread::FILE),\n      io_thread_(BrowserThread::IO) {}\n\n  virtual ~ExtensionIconManagerTest() {}\n\n  void ImageLoadObserved() {\n    unwaited_image_loads_++;\n    if (waiting_) {\n      MessageLoop::current()->Quit();\n    }\n  }\n\n  void WaitForImageLoad() {\n    if (unwaited_image_loads_ == 0) {\n      waiting_ = true;\n      MessageLoop::current()->Run();\n      waiting_ = false;\n    }\n    ASSERT_GT(unwaited_image_loads_, 0);\n    unwaited_image_loads_--;\n  }\n\n private:\n  virtual void SetUp() {\n    file_thread_.Start();\n    io_thread_.Start();\n  }\n\n  \/\/ The number of observed image loads that have not been waited for.\n  int unwaited_image_loads_;\n\n  \/\/ Whether we are currently waiting for an image load.\n  bool waiting_;\n\n  MessageLoop ui_loop_;\n  BrowserThread ui_thread_;\n  BrowserThread file_thread_;\n  BrowserThread io_thread_;\n\n  DISALLOW_COPY_AND_ASSIGN(ExtensionIconManagerTest);\n};\n\n\/\/ This is a specialization of ExtensionIconManager, with a special override to\n\/\/ call back to the test when an icon has completed loading.\nclass TestIconManager : public ExtensionIconManager {\n public:\n  explicit TestIconManager(ExtensionIconManagerTest* test) : test_(test) {}\n  virtual ~TestIconManager() {}\n\n  \/\/ Implements the ImageLoadingTracker::Observer interface, and calls through\n  \/\/ to the base class' implementation. Then it lets the test know that an\n  \/\/ image load was observed.\n  virtual void OnImageLoaded(SkBitmap* image, ExtensionResource resource,\n                             int index) {\n    ExtensionIconManager::OnImageLoaded(image, resource, index);\n    test_->ImageLoadObserved();\n  }\n\n private:\n  ExtensionIconManagerTest* test_;\n\n  DISALLOW_COPY_AND_ASSIGN(TestIconManager);\n};\n\n\/\/ Returns the default icon that ExtensionIconManager gives when an extension\n\/\/ doesn't have an icon.\nSkBitmap GetDefaultIcon() {\n  std::string dummy_id;\n  EXPECT_TRUE(Extension::GenerateId(std::string(\"whatever\"), &dummy_id));\n  ExtensionIconManager manager;\n  return manager.GetIcon(dummy_id);\n}\n\n\/\/ Tests loading an icon for an extension, removing it, then re-loading it.\nTEST_F(ExtensionIconManagerTest, LoadRemoveLoad) {\n  SkBitmap default_icon = GetDefaultIcon();\n\n  FilePath test_dir;\n  ASSERT_TRUE(PathService::Get(chrome::DIR_TEST_DATA, &test_dir));\n  FilePath manifest_path = test_dir.AppendASCII(\n      \"extensions\/image_loading_tracker\/app.json\");\n\n  JSONFileValueSerializer serializer(manifest_path);\n  scoped_ptr<DictionaryValue> manifest(\n      static_cast<DictionaryValue*>(serializer.Deserialize(NULL, NULL)));\n  ASSERT_TRUE(manifest.get() != NULL);\n\n  scoped_refptr<Extension> extension(Extension::Create(\n      manifest_path.DirName(), Extension::INVALID, *manifest.get(),\n      false, true, NULL));\n  ASSERT_TRUE(extension.get());\n  TestIconManager icon_manager(this);\n\n  \/\/ Load the icon and grab the bitmap.\n  icon_manager.LoadIcon(extension.get());\n  WaitForImageLoad();\n  SkBitmap first_icon = icon_manager.GetIcon(extension->id());\n  EXPECT_FALSE(gfx::BitmapsAreEqual(first_icon, default_icon));\n\n  \/\/ Remove the icon from the manager.\n  icon_manager.RemoveIcon(extension->id());\n\n  \/\/ Now re-load the icon - we should get the same result bitmap (and not the\n  \/\/ default icon).\n  icon_manager.LoadIcon(extension.get());\n  WaitForImageLoad();\n  SkBitmap second_icon = icon_manager.GetIcon(extension->id());\n  EXPECT_FALSE(gfx::BitmapsAreEqual(second_icon, default_icon));\n\n  EXPECT_TRUE(gfx::BitmapsAreEqual(first_icon, second_icon));\n}\n<commit_msg>Fix clang error after r77740<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\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/extensions\/extension_icon_manager.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/extensions\/extension_resource.h\"\n#include \"chrome\/common\/json_value_serializer.h\"\n#include \"content\/browser\/browser_thread.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"ui\/gfx\/skia_util.h\"\n\n\/\/ Our test class that takes care of managing the necessary threads for loading\n\/\/ extension icons, and waiting for those loads to happen.\nclass ExtensionIconManagerTest : public testing::Test {\n public:\n  ExtensionIconManagerTest() :\n      unwaited_image_loads_(0),\n      waiting_(false),\n      ui_thread_(BrowserThread::UI, &ui_loop_),\n      file_thread_(BrowserThread::FILE),\n      io_thread_(BrowserThread::IO) {}\n\n  virtual ~ExtensionIconManagerTest() {}\n\n  void ImageLoadObserved() {\n    unwaited_image_loads_++;\n    if (waiting_) {\n      MessageLoop::current()->Quit();\n    }\n  }\n\n  void WaitForImageLoad() {\n    if (unwaited_image_loads_ == 0) {\n      waiting_ = true;\n      MessageLoop::current()->Run();\n      waiting_ = false;\n    }\n    ASSERT_GT(unwaited_image_loads_, 0);\n    unwaited_image_loads_--;\n  }\n\n private:\n  virtual void SetUp() {\n    file_thread_.Start();\n    io_thread_.Start();\n  }\n\n  \/\/ The number of observed image loads that have not been waited for.\n  int unwaited_image_loads_;\n\n  \/\/ Whether we are currently waiting for an image load.\n  bool waiting_;\n\n  MessageLoop ui_loop_;\n  BrowserThread ui_thread_;\n  BrowserThread file_thread_;\n  BrowserThread io_thread_;\n\n  DISALLOW_COPY_AND_ASSIGN(ExtensionIconManagerTest);\n};\n\n\/\/ This is a specialization of ExtensionIconManager, with a special override to\n\/\/ call back to the test when an icon has completed loading.\nclass TestIconManager : public ExtensionIconManager {\n public:\n  explicit TestIconManager(ExtensionIconManagerTest* test) : test_(test) {}\n  virtual ~TestIconManager() {}\n\n  \/\/ Implements the ImageLoadingTracker::Observer interface, and calls through\n  \/\/ to the base class' implementation. Then it lets the test know that an\n  \/\/ image load was observed.\n  virtual void OnImageLoaded(SkBitmap* image, const ExtensionResource& resource,\n                             int index) {\n    ExtensionIconManager::OnImageLoaded(image, resource, index);\n    test_->ImageLoadObserved();\n  }\n\n private:\n  ExtensionIconManagerTest* test_;\n\n  DISALLOW_COPY_AND_ASSIGN(TestIconManager);\n};\n\n\/\/ Returns the default icon that ExtensionIconManager gives when an extension\n\/\/ doesn't have an icon.\nSkBitmap GetDefaultIcon() {\n  std::string dummy_id;\n  EXPECT_TRUE(Extension::GenerateId(std::string(\"whatever\"), &dummy_id));\n  ExtensionIconManager manager;\n  return manager.GetIcon(dummy_id);\n}\n\n\/\/ Tests loading an icon for an extension, removing it, then re-loading it.\nTEST_F(ExtensionIconManagerTest, LoadRemoveLoad) {\n  SkBitmap default_icon = GetDefaultIcon();\n\n  FilePath test_dir;\n  ASSERT_TRUE(PathService::Get(chrome::DIR_TEST_DATA, &test_dir));\n  FilePath manifest_path = test_dir.AppendASCII(\n      \"extensions\/image_loading_tracker\/app.json\");\n\n  JSONFileValueSerializer serializer(manifest_path);\n  scoped_ptr<DictionaryValue> manifest(\n      static_cast<DictionaryValue*>(serializer.Deserialize(NULL, NULL)));\n  ASSERT_TRUE(manifest.get() != NULL);\n\n  scoped_refptr<Extension> extension(Extension::Create(\n      manifest_path.DirName(), Extension::INVALID, *manifest.get(),\n      false, true, NULL));\n  ASSERT_TRUE(extension.get());\n  TestIconManager icon_manager(this);\n\n  \/\/ Load the icon and grab the bitmap.\n  icon_manager.LoadIcon(extension.get());\n  WaitForImageLoad();\n  SkBitmap first_icon = icon_manager.GetIcon(extension->id());\n  EXPECT_FALSE(gfx::BitmapsAreEqual(first_icon, default_icon));\n\n  \/\/ Remove the icon from the manager.\n  icon_manager.RemoveIcon(extension->id());\n\n  \/\/ Now re-load the icon - we should get the same result bitmap (and not the\n  \/\/ default icon).\n  icon_manager.LoadIcon(extension.get());\n  WaitForImageLoad();\n  SkBitmap second_icon = icon_manager.GetIcon(extension->id());\n  EXPECT_FALSE(gfx::BitmapsAreEqual(second_icon, default_icon));\n\n  EXPECT_TRUE(gfx::BitmapsAreEqual(first_icon, second_icon));\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\/command_line.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, WebNavigation) {\n  CommandLine::ForCurrentProcess()->AppendSwitch(\n      switches::kEnableExperimentalExtensionApis);\n\n  ASSERT_TRUE(RunExtensionTest(\"webnavigation\/api\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, WebNavigationEvents1) {\n  CommandLine::ForCurrentProcess()->AppendSwitch(\n      switches::kEnableExperimentalExtensionApis);\n\n  ASSERT_TRUE(RunExtensionTest(\"webnavigation\/navigation1\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, WebNavigationEvents2) {\n  CommandLine::ForCurrentProcess()->AppendSwitch(\n      switches::kEnableExperimentalExtensionApis);\n\n  ASSERT_TRUE(RunExtensionTest(\"webnavigation\/navigation2\")) << message_;\n}\n<commit_msg>Disable ExtensionApiTest.WebNavigationEvents1, flakily exceeds test timeout<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\/command_line.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, WebNavigation) {\n  CommandLine::ForCurrentProcess()->AppendSwitch(\n      switches::kEnableExperimentalExtensionApis);\n\n  ASSERT_TRUE(RunExtensionTest(\"webnavigation\/api\")) << message_;\n}\n\n\/\/ Disabled, flakily exceeds timeout, http:\/\/crbug.com\/72165.\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, DISABLED_WebNavigationEvents1) {\n  CommandLine::ForCurrentProcess()->AppendSwitch(\n      switches::kEnableExperimentalExtensionApis);\n\n  ASSERT_TRUE(RunExtensionTest(\"webnavigation\/navigation1\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, WebNavigationEvents2) {\n  CommandLine::ForCurrentProcess()->AppendSwitch(\n      switches::kEnableExperimentalExtensionApis);\n\n  ASSERT_TRUE(RunExtensionTest(\"webnavigation\/navigation2\")) << message_;\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\/accelerator_table.h\"\n\n#include \"base\/basictypes.h\"\n#include \"chrome\/app\/chrome_command_ids.h\"\n#include \"ui\/base\/keycodes\/keyboard_codes.h\"\n\nnamespace browser {\n\n\/\/ NOTE: Keep this list in the same (mostly-alphabetical) order as\n\/\/ the Windows accelerators in ..\/..\/app\/chrome_dll.rc.\n\/\/ Do not use Ctrl-Alt as a shortcut modifier, as it is used by i18n keyboards:\n\/\/ http:\/\/blogs.msdn.com\/b\/oldnewthing\/archive\/2004\/03\/29\/101121.aspx\nconst AcceleratorMapping kAcceleratorMap[] = {\n  \/\/ Keycode                  Shift  Ctrl   Alt    Command ID\n  { ui::VKEY_LEFT,           false, false, true,  IDC_BACK },\n  { ui::VKEY_BACK,           false, false, false, IDC_BACK },\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_F1,             false, false, false, IDC_BACK },\n  { ui::VKEY_OEM_2,          false, true,  true,  IDC_SHOW_KEYBOARD_OVERLAY },\n  { ui::VKEY_OEM_2,          true,  true,  true,  IDC_SHOW_KEYBOARD_OVERLAY },\n#endif\n  { ui::VKEY_D,              false, true,  false, IDC_BOOKMARK_PAGE },\n  { ui::VKEY_D,              true,  true,  false, IDC_BOOKMARK_ALL_TABS },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_DELETE,         true,  true,  false, IDC_CLEAR_BROWSING_DATA },\n#else\n  { ui::VKEY_BACK,           true,  true,  false, IDC_CLEAR_BROWSING_DATA },\n#endif\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F4,             false, true,  false, IDC_CLOSE_TAB },\n#endif\n  { ui::VKEY_W,              false, true,  false, IDC_CLOSE_TAB },\n  { ui::VKEY_W,              true,  true,  false, IDC_CLOSE_WINDOW },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F4,             false, false, true,  IDC_CLOSE_WINDOW },\n#endif\n#if !defined(USE_AURA)\n  { ui::VKEY_Q,              true,  true,  false, IDC_EXIT },\n#endif\n  { ui::VKEY_F,              false, true,  false, IDC_FIND },\n  { ui::VKEY_G,              false, true,  false, IDC_FIND_NEXT },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F3,             false, false, false, IDC_FIND_NEXT },\n#endif\n  { ui::VKEY_G,              true,  true,  false, IDC_FIND_PREVIOUS },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F3,             true,  false, false, IDC_FIND_PREVIOUS },\n#endif\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_S,              true,  false, true,  IDC_FOCUS_CHROMEOS_STATUS },\n#endif\n  { ui::VKEY_D,              false, false, true,  IDC_FOCUS_LOCATION },\n  { ui::VKEY_L,              false, true,  false, IDC_FOCUS_LOCATION },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F10,            false, false, false, IDC_FOCUS_MENU_BAR },\n#endif\n  { ui::VKEY_MENU,           false, false, false, IDC_FOCUS_MENU_BAR },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F6,             false, false, false, IDC_FOCUS_NEXT_PANE },\n#else\n  { ui::VKEY_F2,             false, true,  false, IDC_FOCUS_NEXT_PANE },\n#endif\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F6,             true,  false, false, IDC_FOCUS_PREVIOUS_PANE },\n#else\n  { ui::VKEY_F1,             false, true,  false, IDC_FOCUS_PREVIOUS_PANE },\n#endif\n  { ui::VKEY_K,              false, true,  false, IDC_FOCUS_SEARCH },\n  { ui::VKEY_E,              false, true,  false, IDC_FOCUS_SEARCH },\n  { ui::VKEY_BROWSER_SEARCH, false, false, false, IDC_FOCUS_SEARCH },\n  { ui::VKEY_T,              true,  false, true,  IDC_FOCUS_TOOLBAR },\n  { ui::VKEY_B,              true,  false, true,  IDC_FOCUS_BOOKMARKS },\n  { ui::VKEY_RIGHT,          false, false, true,  IDC_FORWARD },\n  { ui::VKEY_BACK,           true,  false, false, IDC_FORWARD },\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_F2,             false, false, false, IDC_FORWARD },\n#endif\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F11,            false, false, false, IDC_FULLSCREEN },\n#else\n  { ui::VKEY_F4,             false, false, false, IDC_FULLSCREEN },\n#endif\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F1,             false, false, false, IDC_HELP_PAGE },\n#else\n  { ui::VKEY_OEM_2,          false, true,  false, IDC_HELP_PAGE },\n  { ui::VKEY_OEM_2,          true,  true,  false, IDC_HELP_PAGE },\n#endif\n#if defined(OS_CHROMEOS) && !defined(USE_AURA)\n  { ui::VKEY_L,              true,  true,  false, IDC_LOCK_SCREEN },\n#endif\n  { ui::VKEY_I,              true,  true,  false, IDC_DEV_TOOLS },\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_I,              false,  true,  true, IDC_FEEDBACK },\n#endif\n  { ui::VKEY_F12,            false, false, false, IDC_DEV_TOOLS },\n  { ui::VKEY_J,              true,  true,  false, IDC_DEV_TOOLS_CONSOLE },\n  { ui::VKEY_C,              true,  true,  false, IDC_DEV_TOOLS_INSPECT },\n  { ui::VKEY_N,              true,  true,  false, IDC_NEW_INCOGNITO_WINDOW },\n  { ui::VKEY_T,              false, true,  false, IDC_NEW_TAB },\n  { ui::VKEY_N,              false, true,  false, IDC_NEW_WINDOW },\n  { ui::VKEY_O,              false, true,  false, IDC_OPEN_FILE },\n  { ui::VKEY_P,              false, true,  false, IDC_PRINT},\n  { ui::VKEY_P,              true,  true,  false, IDC_ADVANCED_PRINT},\n  { ui::VKEY_R,              false, true,  false, IDC_RELOAD },\n  { ui::VKEY_R,              true,  true,  false, IDC_RELOAD_IGNORING_CACHE },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F5,             false, false, false, IDC_RELOAD },\n  { ui::VKEY_F5,             false, true,  false, IDC_RELOAD_IGNORING_CACHE },\n  { ui::VKEY_F5,             true,  false, false, IDC_RELOAD_IGNORING_CACHE },\n#else\n  { ui::VKEY_F3,             false, false, false, IDC_RELOAD },\n  { ui::VKEY_F3,             false, true,  false, IDC_RELOAD_IGNORING_CACHE },\n  { ui::VKEY_F3,             true,  false, false, IDC_RELOAD_IGNORING_CACHE },\n#endif\n  { ui::VKEY_HOME,           false, false, true,  IDC_HOME },\n  { ui::VKEY_T,              true,  true,  false, IDC_RESTORE_TAB },\n  { ui::VKEY_S,              false, true,  false, IDC_SAVE_PAGE },\n#if defined(OS_CHROMEOS) && defined(USE_AURA)\n  { ui::VKEY_T,              false, true,  true, IDC_NEW_CROSH_TAB },\n#endif\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_M,              false, true,  false, IDC_FILE_MANAGER },\n  { ui::VKEY_LWIN,           false, false, false, IDC_SEARCH },\n#endif\n  { ui::VKEY_9,              false, true,  false, IDC_SELECT_LAST_TAB },\n  { ui::VKEY_NUMPAD9,        false, true,  false, IDC_SELECT_LAST_TAB },\n  { ui::VKEY_TAB,            false, true,  false, IDC_SELECT_NEXT_TAB },\n  { ui::VKEY_NEXT,           false, true,  false, IDC_SELECT_NEXT_TAB },\n  { ui::VKEY_TAB,            true,  true,  false, IDC_SELECT_PREVIOUS_TAB },\n  { ui::VKEY_PRIOR,          false, true,  false, IDC_SELECT_PREVIOUS_TAB },\n  { ui::VKEY_1,              false, true,  false, IDC_SELECT_TAB_0 },\n  { ui::VKEY_NUMPAD1,        false, true,  false, IDC_SELECT_TAB_0 },\n  { ui::VKEY_2,              false, true,  false, IDC_SELECT_TAB_1 },\n  { ui::VKEY_NUMPAD2,        false, true,  false, IDC_SELECT_TAB_1 },\n  { ui::VKEY_3,              false, true,  false, IDC_SELECT_TAB_2 },\n  { ui::VKEY_NUMPAD3,        false, true,  false, IDC_SELECT_TAB_2 },\n  { ui::VKEY_4,              false, true,  false, IDC_SELECT_TAB_3 },\n  { ui::VKEY_NUMPAD4,        false, true,  false, IDC_SELECT_TAB_3 },\n  { ui::VKEY_5,              false, true,  false, IDC_SELECT_TAB_4 },\n  { ui::VKEY_NUMPAD5,        false, true,  false, IDC_SELECT_TAB_4 },\n  { ui::VKEY_6,              false, true,  false, IDC_SELECT_TAB_5 },\n  { ui::VKEY_NUMPAD6,        false, true,  false, IDC_SELECT_TAB_5 },\n  { ui::VKEY_7,              false, true,  false, IDC_SELECT_TAB_6 },\n  { ui::VKEY_NUMPAD7,        false, true,  false, IDC_SELECT_TAB_6 },\n  { ui::VKEY_8,              false, true,  false, IDC_SELECT_TAB_7 },\n  { ui::VKEY_NUMPAD8,        false, true,  false, IDC_SELECT_TAB_7 },\n  { ui::VKEY_B,              true,  true,  false, IDC_SHOW_BOOKMARK_BAR },\n  { ui::VKEY_O,              true,  true,  false, IDC_SHOW_BOOKMARK_MANAGER },\n  { ui::VKEY_J,              false, true,  false, IDC_SHOW_DOWNLOADS },\n  { ui::VKEY_H,              false, true,  false, IDC_SHOW_HISTORY },\n  { ui::VKEY_F,              false, false, true,  IDC_SHOW_APP_MENU},\n  { ui::VKEY_E,              false, false, true,  IDC_SHOW_APP_MENU},\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_M,              true,  true,  false, IDC_SHOW_AVATAR_MENU},\n#endif\n  { ui::VKEY_ESCAPE,         false, false, false, IDC_STOP },\n  { ui::VKEY_ESCAPE,         true,  false, false, IDC_TASK_MANAGER },\n  { ui::VKEY_OEM_PERIOD,     true,  true,  false, IDC_TOGGLE_SPEECH_INPUT },\n  { ui::VKEY_U,              false, true,  false, IDC_VIEW_SOURCE },\n  { ui::VKEY_OEM_MINUS,      false, true,  false, IDC_ZOOM_MINUS },\n  { ui::VKEY_OEM_MINUS,      true,  true,  false, IDC_ZOOM_MINUS },\n  { ui::VKEY_SUBTRACT,       false, true,  false, IDC_ZOOM_MINUS },\n  { ui::VKEY_0,              false, true,  false, IDC_ZOOM_NORMAL },\n  { ui::VKEY_NUMPAD0,        false, true,  false, IDC_ZOOM_NORMAL },\n  { ui::VKEY_OEM_PLUS,       false, true,  false, IDC_ZOOM_PLUS },\n  { ui::VKEY_OEM_PLUS,       true,  true,  false, IDC_ZOOM_PLUS },\n  { ui::VKEY_ADD,            false, true,  false, IDC_ZOOM_PLUS },\n};\n\nconst size_t kAcceleratorMapLength = arraysize(kAcceleratorMap);\n\n}  \/\/ namespace browser\n<commit_msg>Change the shortcut for Feedback. Change the shortcut for Feedback on ChromeOS from Ctrl+Alt+i to Shift+Alt+i.<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\/accelerator_table.h\"\n\n#include \"base\/basictypes.h\"\n#include \"chrome\/app\/chrome_command_ids.h\"\n#include \"ui\/base\/keycodes\/keyboard_codes.h\"\n\nnamespace browser {\n\n\/\/ NOTE: Keep this list in the same (mostly-alphabetical) order as\n\/\/ the Windows accelerators in ..\/..\/app\/chrome_dll.rc.\n\/\/ Do not use Ctrl-Alt as a shortcut modifier, as it is used by i18n keyboards:\n\/\/ http:\/\/blogs.msdn.com\/b\/oldnewthing\/archive\/2004\/03\/29\/101121.aspx\nconst AcceleratorMapping kAcceleratorMap[] = {\n  \/\/ Keycode                  Shift  Ctrl   Alt    Command ID\n  { ui::VKEY_LEFT,           false, false, true,  IDC_BACK },\n  { ui::VKEY_BACK,           false, false, false, IDC_BACK },\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_F1,             false, false, false, IDC_BACK },\n  { ui::VKEY_OEM_2,          false, true,  true,  IDC_SHOW_KEYBOARD_OVERLAY },\n  { ui::VKEY_OEM_2,          true,  true,  true,  IDC_SHOW_KEYBOARD_OVERLAY },\n#endif\n  { ui::VKEY_D,              false, true,  false, IDC_BOOKMARK_PAGE },\n  { ui::VKEY_D,              true,  true,  false, IDC_BOOKMARK_ALL_TABS },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_DELETE,         true,  true,  false, IDC_CLEAR_BROWSING_DATA },\n#else\n  { ui::VKEY_BACK,           true,  true,  false, IDC_CLEAR_BROWSING_DATA },\n#endif\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F4,             false, true,  false, IDC_CLOSE_TAB },\n#endif\n  { ui::VKEY_W,              false, true,  false, IDC_CLOSE_TAB },\n  { ui::VKEY_W,              true,  true,  false, IDC_CLOSE_WINDOW },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F4,             false, false, true,  IDC_CLOSE_WINDOW },\n#endif\n#if !defined(USE_AURA)\n  { ui::VKEY_Q,              true,  true,  false, IDC_EXIT },\n#endif\n  { ui::VKEY_F,              false, true,  false, IDC_FIND },\n  { ui::VKEY_G,              false, true,  false, IDC_FIND_NEXT },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F3,             false, false, false, IDC_FIND_NEXT },\n#endif\n  { ui::VKEY_G,              true,  true,  false, IDC_FIND_PREVIOUS },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F3,             true,  false, false, IDC_FIND_PREVIOUS },\n#endif\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_S,              true,  false, true,  IDC_FOCUS_CHROMEOS_STATUS },\n#endif\n  { ui::VKEY_D,              false, false, true,  IDC_FOCUS_LOCATION },\n  { ui::VKEY_L,              false, true,  false, IDC_FOCUS_LOCATION },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F10,            false, false, false, IDC_FOCUS_MENU_BAR },\n#endif\n  { ui::VKEY_MENU,           false, false, false, IDC_FOCUS_MENU_BAR },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F6,             false, false, false, IDC_FOCUS_NEXT_PANE },\n#else\n  { ui::VKEY_F2,             false, true,  false, IDC_FOCUS_NEXT_PANE },\n#endif\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F6,             true,  false, false, IDC_FOCUS_PREVIOUS_PANE },\n#else\n  { ui::VKEY_F1,             false, true,  false, IDC_FOCUS_PREVIOUS_PANE },\n#endif\n  { ui::VKEY_K,              false, true,  false, IDC_FOCUS_SEARCH },\n  { ui::VKEY_E,              false, true,  false, IDC_FOCUS_SEARCH },\n  { ui::VKEY_BROWSER_SEARCH, false, false, false, IDC_FOCUS_SEARCH },\n  { ui::VKEY_T,              true,  false, true,  IDC_FOCUS_TOOLBAR },\n  { ui::VKEY_B,              true,  false, true,  IDC_FOCUS_BOOKMARKS },\n  { ui::VKEY_RIGHT,          false, false, true,  IDC_FORWARD },\n  { ui::VKEY_BACK,           true,  false, false, IDC_FORWARD },\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_F2,             false, false, false, IDC_FORWARD },\n#endif\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F11,            false, false, false, IDC_FULLSCREEN },\n#else\n  { ui::VKEY_F4,             false, false, false, IDC_FULLSCREEN },\n#endif\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F1,             false, false, false, IDC_HELP_PAGE },\n#else\n  { ui::VKEY_OEM_2,          false, true,  false, IDC_HELP_PAGE },\n  { ui::VKEY_OEM_2,          true,  true,  false, IDC_HELP_PAGE },\n#endif\n#if defined(OS_CHROMEOS) && !defined(USE_AURA)\n  { ui::VKEY_L,              true,  true,  false, IDC_LOCK_SCREEN },\n#endif\n  { ui::VKEY_I,              true,  true,  false, IDC_DEV_TOOLS },\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_I,              true,  false,  true, IDC_FEEDBACK },\n#endif\n  { ui::VKEY_F12,            false, false, false, IDC_DEV_TOOLS },\n  { ui::VKEY_J,              true,  true,  false, IDC_DEV_TOOLS_CONSOLE },\n  { ui::VKEY_C,              true,  true,  false, IDC_DEV_TOOLS_INSPECT },\n  { ui::VKEY_N,              true,  true,  false, IDC_NEW_INCOGNITO_WINDOW },\n  { ui::VKEY_T,              false, true,  false, IDC_NEW_TAB },\n  { ui::VKEY_N,              false, true,  false, IDC_NEW_WINDOW },\n  { ui::VKEY_O,              false, true,  false, IDC_OPEN_FILE },\n  { ui::VKEY_P,              false, true,  false, IDC_PRINT},\n  { ui::VKEY_P,              true,  true,  false, IDC_ADVANCED_PRINT},\n  { ui::VKEY_R,              false, true,  false, IDC_RELOAD },\n  { ui::VKEY_R,              true,  true,  false, IDC_RELOAD_IGNORING_CACHE },\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_F5,             false, false, false, IDC_RELOAD },\n  { ui::VKEY_F5,             false, true,  false, IDC_RELOAD_IGNORING_CACHE },\n  { ui::VKEY_F5,             true,  false, false, IDC_RELOAD_IGNORING_CACHE },\n#else\n  { ui::VKEY_F3,             false, false, false, IDC_RELOAD },\n  { ui::VKEY_F3,             false, true,  false, IDC_RELOAD_IGNORING_CACHE },\n  { ui::VKEY_F3,             true,  false, false, IDC_RELOAD_IGNORING_CACHE },\n#endif\n  { ui::VKEY_HOME,           false, false, true,  IDC_HOME },\n  { ui::VKEY_T,              true,  true,  false, IDC_RESTORE_TAB },\n  { ui::VKEY_S,              false, true,  false, IDC_SAVE_PAGE },\n#if defined(OS_CHROMEOS) && defined(USE_AURA)\n  { ui::VKEY_T,              false, true,  true, IDC_NEW_CROSH_TAB },\n#endif\n#if defined(OS_CHROMEOS)\n  { ui::VKEY_M,              false, true,  false, IDC_FILE_MANAGER },\n  { ui::VKEY_LWIN,           false, false, false, IDC_SEARCH },\n#endif\n  { ui::VKEY_9,              false, true,  false, IDC_SELECT_LAST_TAB },\n  { ui::VKEY_NUMPAD9,        false, true,  false, IDC_SELECT_LAST_TAB },\n  { ui::VKEY_TAB,            false, true,  false, IDC_SELECT_NEXT_TAB },\n  { ui::VKEY_NEXT,           false, true,  false, IDC_SELECT_NEXT_TAB },\n  { ui::VKEY_TAB,            true,  true,  false, IDC_SELECT_PREVIOUS_TAB },\n  { ui::VKEY_PRIOR,          false, true,  false, IDC_SELECT_PREVIOUS_TAB },\n  { ui::VKEY_1,              false, true,  false, IDC_SELECT_TAB_0 },\n  { ui::VKEY_NUMPAD1,        false, true,  false, IDC_SELECT_TAB_0 },\n  { ui::VKEY_2,              false, true,  false, IDC_SELECT_TAB_1 },\n  { ui::VKEY_NUMPAD2,        false, true,  false, IDC_SELECT_TAB_1 },\n  { ui::VKEY_3,              false, true,  false, IDC_SELECT_TAB_2 },\n  { ui::VKEY_NUMPAD3,        false, true,  false, IDC_SELECT_TAB_2 },\n  { ui::VKEY_4,              false, true,  false, IDC_SELECT_TAB_3 },\n  { ui::VKEY_NUMPAD4,        false, true,  false, IDC_SELECT_TAB_3 },\n  { ui::VKEY_5,              false, true,  false, IDC_SELECT_TAB_4 },\n  { ui::VKEY_NUMPAD5,        false, true,  false, IDC_SELECT_TAB_4 },\n  { ui::VKEY_6,              false, true,  false, IDC_SELECT_TAB_5 },\n  { ui::VKEY_NUMPAD6,        false, true,  false, IDC_SELECT_TAB_5 },\n  { ui::VKEY_7,              false, true,  false, IDC_SELECT_TAB_6 },\n  { ui::VKEY_NUMPAD7,        false, true,  false, IDC_SELECT_TAB_6 },\n  { ui::VKEY_8,              false, true,  false, IDC_SELECT_TAB_7 },\n  { ui::VKEY_NUMPAD8,        false, true,  false, IDC_SELECT_TAB_7 },\n  { ui::VKEY_B,              true,  true,  false, IDC_SHOW_BOOKMARK_BAR },\n  { ui::VKEY_O,              true,  true,  false, IDC_SHOW_BOOKMARK_MANAGER },\n  { ui::VKEY_J,              false, true,  false, IDC_SHOW_DOWNLOADS },\n  { ui::VKEY_H,              false, true,  false, IDC_SHOW_HISTORY },\n  { ui::VKEY_F,              false, false, true,  IDC_SHOW_APP_MENU},\n  { ui::VKEY_E,              false, false, true,  IDC_SHOW_APP_MENU},\n#if !defined(OS_CHROMEOS)\n  { ui::VKEY_M,              true,  true,  false, IDC_SHOW_AVATAR_MENU},\n#endif\n  { ui::VKEY_ESCAPE,         false, false, false, IDC_STOP },\n  { ui::VKEY_ESCAPE,         true,  false, false, IDC_TASK_MANAGER },\n  { ui::VKEY_OEM_PERIOD,     true,  true,  false, IDC_TOGGLE_SPEECH_INPUT },\n  { ui::VKEY_U,              false, true,  false, IDC_VIEW_SOURCE },\n  { ui::VKEY_OEM_MINUS,      false, true,  false, IDC_ZOOM_MINUS },\n  { ui::VKEY_OEM_MINUS,      true,  true,  false, IDC_ZOOM_MINUS },\n  { ui::VKEY_SUBTRACT,       false, true,  false, IDC_ZOOM_MINUS },\n  { ui::VKEY_0,              false, true,  false, IDC_ZOOM_NORMAL },\n  { ui::VKEY_NUMPAD0,        false, true,  false, IDC_ZOOM_NORMAL },\n  { ui::VKEY_OEM_PLUS,       false, true,  false, IDC_ZOOM_PLUS },\n  { ui::VKEY_OEM_PLUS,       true,  true,  false, IDC_ZOOM_PLUS },\n  { ui::VKEY_ADD,            false, true,  false, IDC_ZOOM_PLUS },\n};\n\nconst size_t kAcceleratorMapLength = arraysize(kAcceleratorMap);\n\n}  \/\/ namespace browser\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\/bookmark_bubble_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/keyboard_codes.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/app\/chrome_dll_resource.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_editor.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_model.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_utils.h\"\n#include \"chrome\/browser\/metrics\/user_metrics.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/views\/info_bubble.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"gfx\/canvas.h\"\n#include \"gfx\/color_utils.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/event.h\"\n#include \"views\/standard_layout.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/controls\/textfield\/textfield.h\"\n#include \"views\/focus\/focus_manager.h\"\n#include \"views\/window\/client_view.h\"\n#include \"views\/window\/window.h\"\n\nusing views::Combobox;\nusing views::ColumnSet;\nusing views::GridLayout;\nusing views::Label;\nusing views::Link;\nusing views::NativeButton;\nusing views::View;\n\n\/\/ Padding between \"Title:\" and the actual title.\nstatic const int kTitlePadding = 4;\n\n\/\/ Minimum width for the fields - they will push out the size of the bubble if\n\/\/ necessary. This should be big enough so that the field pushes the right side\n\/\/ of the bubble far enough so that the edit button's left edge is to the right\n\/\/ of the field's left edge.\nstatic const int kMinimumFieldSize = 180;\n\n\/\/ Bubble close image.\nstatic SkBitmap* kCloseImage = NULL;\n\n\/\/ Declared in browser_dialogs.h so callers don't have to depend on our header.\n\nnamespace browser {\n\nvoid ShowBookmarkBubbleView(views::Window* parent,\n                            const gfx::Rect& bounds,\n                            InfoBubbleDelegate* delegate,\n                            Profile* profile,\n                            const GURL& url,\n                            bool newly_bookmarked) {\n  BookmarkBubbleView::Show(parent, bounds, delegate, profile, url,\n                           newly_bookmarked);\n}\n\nvoid HideBookmarkBubbleView() {\n  BookmarkBubbleView::Hide();\n}\n\nbool IsBookmarkBubbleViewShowing() {\n  return BookmarkBubbleView::IsShowing();\n}\n\n}  \/\/ namespace browser\n\n\/\/ BookmarkBubbleView ---------------------------------------------------------\n\nBookmarkBubbleView* BookmarkBubbleView::bubble_ = NULL;\n\n\/\/ static\nvoid BookmarkBubbleView::Show(views::Window* parent,\n                              const gfx::Rect& bounds,\n                              InfoBubbleDelegate* delegate,\n                              Profile* profile,\n                              const GURL& url,\n                              bool newly_bookmarked) {\n  if (IsShowing())\n    return;\n\n  bubble_ = new BookmarkBubbleView(delegate, profile, url, newly_bookmarked);\n  InfoBubble* info_bubble =\n      InfoBubble::Show(parent->GetClientView()->GetWidget(), bounds,\n                   BubbleBorder::TOP_LEFT, bubble_, bubble_);\n  bubble_->set_info_bubble(info_bubble);\n  GURL url_ptr(url);\n  NotificationService::current()->Notify(\n      NotificationType::BOOKMARK_BUBBLE_SHOWN,\n      Source<Profile>(profile->GetOriginalProfile()),\n      Details<GURL>(&url_ptr));\n  bubble_->BubbleShown();\n}\n\n\/\/ static\nbool BookmarkBubbleView::IsShowing() {\n  return bubble_ != NULL;\n}\n\nvoid BookmarkBubbleView::Hide() {\n  if (IsShowing())\n    bubble_->Close();\n}\n\nBookmarkBubbleView::~BookmarkBubbleView() {\n  if (apply_edits_) {\n    ApplyEdits();\n  } else if (remove_bookmark_) {\n    BookmarkModel* model = profile_->GetBookmarkModel();\n    const BookmarkNode* node = model->GetMostRecentlyAddedNodeForURL(url_);\n    if (node)\n      model->Remove(node->GetParent(), node->GetParent()->IndexOfChild(node));\n  }\n}\n\nvoid BookmarkBubbleView::DidChangeBounds(const gfx::Rect& previous,\n                                         const gfx::Rect& current) {\n  Layout();\n}\n\nvoid BookmarkBubbleView::BubbleShown() {\n  DCHECK(GetWidget());\n  GetFocusManager()->RegisterAccelerator(\n      views::Accelerator(base::VKEY_RETURN, false, false, false), this);\n\n  title_tf_->RequestFocus();\n  title_tf_->SelectAll();\n}\n\nbool BookmarkBubbleView::AcceleratorPressed(\n    const views::Accelerator& accelerator) {\n  if (accelerator.GetKeyCode() != base::VKEY_RETURN)\n    return false;\n\n  if (edit_button_->HasFocus())\n    HandleButtonPressed(edit_button_);\n  else\n    HandleButtonPressed(close_button_);\n  return true;\n}\n\nvoid BookmarkBubbleView::ViewHierarchyChanged(bool is_add, View* parent,\n                                              View* child) {\n  if (is_add && child == this)\n    Init();\n}\n\nBookmarkBubbleView::BookmarkBubbleView(InfoBubbleDelegate* delegate,\n                                       Profile* profile,\n                                       const GURL& url,\n                                       bool newly_bookmarked)\n    : delegate_(delegate),\n      profile_(profile),\n      url_(url),\n      newly_bookmarked_(newly_bookmarked),\n      parent_model_(\n          profile_->GetBookmarkModel(),\n          profile_->GetBookmarkModel()->GetMostRecentlyAddedNodeForURL(url)),\n      remove_bookmark_(false),\n      apply_edits_(true) {\n}\n\nvoid BookmarkBubbleView::Init() {\n  static SkColor kTitleColor;\n  static bool initialized = false;\n  if (!initialized) {\n    kTitleColor = color_utils::GetReadableColor(SkColorSetRGB(6, 45, 117),\n                                                InfoBubble::kBackgroundColor);\n    kCloseImage = ResourceBundle::GetSharedInstance().GetBitmapNamed(\n      IDR_INFO_BUBBLE_CLOSE);\n\n    initialized = true;\n  }\n\n  remove_link_ = new Link(l10n_util::GetString(\n      IDS_BOOMARK_BUBBLE_REMOVE_BOOKMARK));\n  remove_link_->SetController(this);\n\n  edit_button_ = new NativeButton(\n      this, l10n_util::GetString(IDS_BOOMARK_BUBBLE_OPTIONS));\n\n  close_button_ = new NativeButton(this, l10n_util::GetString(IDS_DONE));\n  close_button_->SetIsDefault(true);\n\n  Label* combobox_label = new Label(\n      l10n_util::GetString(IDS_BOOMARK_BUBBLE_FOLDER_TEXT));\n\n  parent_combobox_ = new Combobox(&parent_model_);\n  parent_combobox_->SetSelectedItem(parent_model_.node_parent_index());\n  parent_combobox_->set_listener(this);\n  parent_combobox_->SetAccessibleName(combobox_label->GetText());\n\n  Label* title_label = new Label(l10n_util::GetString(\n      newly_bookmarked_ ? IDS_BOOMARK_BUBBLE_PAGE_BOOKMARKED :\n                          IDS_BOOMARK_BUBBLE_PAGE_BOOKMARK));\n  title_label->SetFont(\n      ResourceBundle::GetSharedInstance().GetFont(ResourceBundle::MediumFont));\n  title_label->SetColor(kTitleColor);\n\n  GridLayout* layout = new GridLayout(this);\n  SetLayoutManager(layout);\n\n  ColumnSet* cs = layout->AddColumnSet(0);\n\n  \/\/ Top (title) row.\n  cs->AddColumn(GridLayout::CENTER, GridLayout::CENTER, 0, GridLayout::USE_PREF,\n                0, 0);\n  cs->AddPaddingColumn(1, kUnrelatedControlHorizontalSpacing);\n  cs->AddColumn(GridLayout::CENTER, GridLayout::CENTER, 0, GridLayout::USE_PREF,\n                0, 0);\n\n  \/\/ Middle (input field) rows.\n  cs = layout->AddColumnSet(2);\n  cs->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n                GridLayout::USE_PREF, 0, 0);\n  cs->AddPaddingColumn(0, kRelatedControlHorizontalSpacing);\n  cs->AddColumn(GridLayout::FILL, GridLayout::CENTER, 1,\n                GridLayout::USE_PREF, 0, kMinimumFieldSize);\n\n  \/\/ Bottom (buttons) row.\n  cs = layout->AddColumnSet(3);\n  cs->AddPaddingColumn(1, kRelatedControlHorizontalSpacing);\n  cs->AddColumn(GridLayout::LEADING, GridLayout::TRAILING, 0,\n                GridLayout::USE_PREF, 0, 0);\n  \/\/ We subtract 2 to account for the natural button padding, and\n  \/\/ to bring the separation visually in line with the row separation\n  \/\/ height.\n  cs->AddPaddingColumn(0, kRelatedButtonHSpacing - 2);\n  cs->AddColumn(GridLayout::LEADING, GridLayout::TRAILING, 0,\n                GridLayout::USE_PREF, 0, 0);\n\n  layout->StartRow(0, 0);\n  layout->AddView(title_label);\n  layout->AddView(remove_link_);\n\n  layout->AddPaddingRow(0, kRelatedControlSmallVerticalSpacing);\n  layout->StartRow(0, 2);\n  layout->AddView(\n      new Label(l10n_util::GetString(IDS_BOOMARK_BUBBLE_TITLE_TEXT)));\n  title_tf_ = new views::Textfield();\n  title_tf_->SetText(WideToUTF16(GetTitle()));\n  layout->AddView(title_tf_);\n\n  layout->AddPaddingRow(0, kRelatedControlSmallVerticalSpacing);\n\n  layout->StartRow(0, 2);\n  layout->AddView(combobox_label);\n  layout->AddView(parent_combobox_);\n  layout->AddPaddingRow(0, kRelatedControlSmallVerticalSpacing);\n\n  layout->StartRow(0, 3);\n  layout->AddView(edit_button_);\n  layout->AddView(close_button_);\n}\n\nstd::wstring BookmarkBubbleView::GetTitle() {\n  BookmarkModel* bookmark_model= profile_->GetBookmarkModel();\n  const BookmarkNode* node =\n      bookmark_model->GetMostRecentlyAddedNodeForURL(url_);\n  if (node)\n    return node->GetTitle();\n  else\n    NOTREACHED();\n  return std::wstring();\n}\n\nvoid BookmarkBubbleView::ButtonPressed(\n    views::Button* sender, const views::Event& event) {\n  HandleButtonPressed(sender);\n}\n\nvoid BookmarkBubbleView::LinkActivated(Link* source, int event_flags) {\n  DCHECK(source == remove_link_);\n  UserMetrics::RecordAction(UserMetricsAction(\"BookmarkBubble_Unstar\"),\n                            profile_);\n\n  \/\/ Set this so we remove the bookmark after the window closes.\n  remove_bookmark_ = true;\n  apply_edits_ = false;\n\n  info_bubble_->set_fade_away_on_close(true);\n  Close();\n}\n\nvoid BookmarkBubbleView::ItemChanged(Combobox* combobox,\n                                     int prev_index,\n                                     int new_index) {\n  if (new_index + 1 == parent_model_.GetItemCount()) {\n    UserMetrics::RecordAction(\n              UserMetricsAction(\"BookmarkBubble_EditFromCombobox\"), profile_);\n\n    ShowEditor();\n    return;\n  }\n}\n\nvoid BookmarkBubbleView::InfoBubbleClosing(InfoBubble* info_bubble,\n                                           bool closed_by_escape) {\n  if (closed_by_escape) {\n    remove_bookmark_ = newly_bookmarked_;\n    apply_edits_ = false;\n  }\n\n  \/\/ We have to reset |bubble_| here, not in our destructor, because we'll be\n  \/\/ destroyed asynchronously and the shown state will be checked before then.\n  DCHECK(bubble_ == this);\n  bubble_ = NULL;\n\n  if (delegate_)\n    delegate_->InfoBubbleClosing(info_bubble, closed_by_escape);\n  NotificationService::current()->Notify(\n      NotificationType::BOOKMARK_BUBBLE_HIDDEN,\n      Source<Profile>(profile_->GetOriginalProfile()),\n      NotificationService::NoDetails());\n}\n\nbool BookmarkBubbleView::CloseOnEscape() {\n  return delegate_ ? delegate_->CloseOnEscape() : true;\n}\n\nstd::wstring BookmarkBubbleView::accessible_name() {\n  return l10n_util::GetString(IDS_BOOMARK_BUBBLE_ADD_BOOKMARK);\n}\n\nvoid BookmarkBubbleView::Close() {\n  static_cast<InfoBubble*>(GetWidget())->Close();\n}\n\nvoid BookmarkBubbleView::HandleButtonPressed(views::Button* sender) {\n  if (sender == edit_button_) {\n    UserMetrics::RecordAction(UserMetricsAction(\"BookmarkBubble_Edit\"),\n                              profile_);\n    info_bubble_->set_fade_away_on_close(true);\n    ShowEditor();\n  } else {\n    DCHECK(sender == close_button_);\n    info_bubble_->set_fade_away_on_close(true);\n    Close();\n  }\n  \/\/ WARNING: we've most likely been deleted when CloseWindow returns.\n}\n\nvoid BookmarkBubbleView::ShowEditor() {\n  const BookmarkNode* node =\n      profile_->GetBookmarkModel()->GetMostRecentlyAddedNodeForURL(url_);\n\n  \/\/ Commit any edits now.\n  ApplyEdits();\n\n#if defined(OS_WIN)\n  \/\/ Parent the editor to our root ancestor (not the root we're in, as that\n  \/\/ is the info bubble and will close shortly).\n  HWND parent = GetAncestor(GetWidget()->GetNativeView(), GA_ROOTOWNER);\n\n  \/\/ We're about to show the bookmark editor. When the bookmark editor closes\n  \/\/ we want the browser to become active. WidgetWin::Hide() does a hide in\n  \/\/ a such way that activation isn't changed, which means when we close\n  \/\/ Windows gets confused as to who it should give active status to. We\n  \/\/ explicitly hide the bookmark bubble window in such a way that activation\n  \/\/ status changes. That way, when the editor closes, activation is properly\n  \/\/ restored to the browser.\n  ShowWindow(GetWidget()->GetNativeView(), SW_HIDE);\n#else\n  gfx::NativeWindow parent = GTK_WINDOW(\n      static_cast<views::WidgetGtk*>(GetWidget())->GetTransientParent());\n#endif\n\n  \/\/ Even though we just hid the window, we need to invoke Close to schedule\n  \/\/ the delete and all that.\n  Close();\n\n  if (node) {\n    BookmarkEditor::Show(parent, profile_, NULL,\n                         BookmarkEditor::EditDetails(node),\n                         BookmarkEditor::SHOW_TREE);\n  }\n}\n\nvoid BookmarkBubbleView::ApplyEdits() {\n  \/\/ Set this to make sure we don't attempt to apply edits again.\n  apply_edits_ = false;\n\n  BookmarkModel* model = profile_->GetBookmarkModel();\n  const BookmarkNode* node = model->GetMostRecentlyAddedNodeForURL(url_);\n  if (node) {\n    const std::wstring new_title = UTF16ToWide(title_tf_->text());\n    if (new_title != node->GetTitle()) {\n      model->SetTitle(node, new_title);\n      UserMetrics::RecordAction(\n          UserMetricsAction(\"BookmarkBubble_ChangeTitleInBubble\"),\n          profile_);\n    }\n    \/\/ Last index means 'Choose another folder...'\n    if (parent_combobox_->selected_item() <\n        parent_model_.GetItemCount() - 1) {\n      const BookmarkNode* new_parent =\n          parent_model_.GetNodeAt(parent_combobox_->selected_item());\n      if (new_parent != node->GetParent()) {\n        UserMetrics::RecordAction(\n            UserMetricsAction(\"BookmarkBubble_ChangeParent\"), profile_);\n        model->Move(node, new_parent, new_parent->GetChildCount());\n      }\n    }\n  }\n}\n<commit_msg>Makes the bookmark bubble right aligned.<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\/bookmark_bubble_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/keyboard_codes.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/app\/chrome_dll_resource.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_editor.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_model.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_utils.h\"\n#include \"chrome\/browser\/metrics\/user_metrics.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/views\/info_bubble.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"gfx\/canvas.h\"\n#include \"gfx\/color_utils.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/event.h\"\n#include \"views\/standard_layout.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/controls\/textfield\/textfield.h\"\n#include \"views\/focus\/focus_manager.h\"\n#include \"views\/window\/client_view.h\"\n#include \"views\/window\/window.h\"\n\nusing views::Combobox;\nusing views::ColumnSet;\nusing views::GridLayout;\nusing views::Label;\nusing views::Link;\nusing views::NativeButton;\nusing views::View;\n\n\/\/ Padding between \"Title:\" and the actual title.\nstatic const int kTitlePadding = 4;\n\n\/\/ Minimum width for the fields - they will push out the size of the bubble if\n\/\/ necessary. This should be big enough so that the field pushes the right side\n\/\/ of the bubble far enough so that the edit button's left edge is to the right\n\/\/ of the field's left edge.\nstatic const int kMinimumFieldSize = 180;\n\n\/\/ Bubble close image.\nstatic SkBitmap* kCloseImage = NULL;\n\n\/\/ Declared in browser_dialogs.h so callers don't have to depend on our header.\n\nnamespace browser {\n\nvoid ShowBookmarkBubbleView(views::Window* parent,\n                            const gfx::Rect& bounds,\n                            InfoBubbleDelegate* delegate,\n                            Profile* profile,\n                            const GURL& url,\n                            bool newly_bookmarked) {\n  BookmarkBubbleView::Show(parent, bounds, delegate, profile, url,\n                           newly_bookmarked);\n}\n\nvoid HideBookmarkBubbleView() {\n  BookmarkBubbleView::Hide();\n}\n\nbool IsBookmarkBubbleViewShowing() {\n  return BookmarkBubbleView::IsShowing();\n}\n\n}  \/\/ namespace browser\n\n\/\/ BookmarkBubbleView ---------------------------------------------------------\n\nBookmarkBubbleView* BookmarkBubbleView::bubble_ = NULL;\n\n\/\/ static\nvoid BookmarkBubbleView::Show(views::Window* parent,\n                              const gfx::Rect& bounds,\n                              InfoBubbleDelegate* delegate,\n                              Profile* profile,\n                              const GURL& url,\n                              bool newly_bookmarked) {\n  if (IsShowing())\n    return;\n\n  bubble_ = new BookmarkBubbleView(delegate, profile, url, newly_bookmarked);\n  InfoBubble* info_bubble =\n      InfoBubble::Show(parent->GetClientView()->GetWidget(), bounds,\n                   BubbleBorder::TOP_RIGHT, bubble_, bubble_);\n  bubble_->set_info_bubble(info_bubble);\n  GURL url_ptr(url);\n  NotificationService::current()->Notify(\n      NotificationType::BOOKMARK_BUBBLE_SHOWN,\n      Source<Profile>(profile->GetOriginalProfile()),\n      Details<GURL>(&url_ptr));\n  bubble_->BubbleShown();\n}\n\n\/\/ static\nbool BookmarkBubbleView::IsShowing() {\n  return bubble_ != NULL;\n}\n\nvoid BookmarkBubbleView::Hide() {\n  if (IsShowing())\n    bubble_->Close();\n}\n\nBookmarkBubbleView::~BookmarkBubbleView() {\n  if (apply_edits_) {\n    ApplyEdits();\n  } else if (remove_bookmark_) {\n    BookmarkModel* model = profile_->GetBookmarkModel();\n    const BookmarkNode* node = model->GetMostRecentlyAddedNodeForURL(url_);\n    if (node)\n      model->Remove(node->GetParent(), node->GetParent()->IndexOfChild(node));\n  }\n}\n\nvoid BookmarkBubbleView::DidChangeBounds(const gfx::Rect& previous,\n                                         const gfx::Rect& current) {\n  Layout();\n}\n\nvoid BookmarkBubbleView::BubbleShown() {\n  DCHECK(GetWidget());\n  GetFocusManager()->RegisterAccelerator(\n      views::Accelerator(base::VKEY_RETURN, false, false, false), this);\n\n  title_tf_->RequestFocus();\n  title_tf_->SelectAll();\n}\n\nbool BookmarkBubbleView::AcceleratorPressed(\n    const views::Accelerator& accelerator) {\n  if (accelerator.GetKeyCode() != base::VKEY_RETURN)\n    return false;\n\n  if (edit_button_->HasFocus())\n    HandleButtonPressed(edit_button_);\n  else\n    HandleButtonPressed(close_button_);\n  return true;\n}\n\nvoid BookmarkBubbleView::ViewHierarchyChanged(bool is_add, View* parent,\n                                              View* child) {\n  if (is_add && child == this)\n    Init();\n}\n\nBookmarkBubbleView::BookmarkBubbleView(InfoBubbleDelegate* delegate,\n                                       Profile* profile,\n                                       const GURL& url,\n                                       bool newly_bookmarked)\n    : delegate_(delegate),\n      profile_(profile),\n      url_(url),\n      newly_bookmarked_(newly_bookmarked),\n      parent_model_(\n          profile_->GetBookmarkModel(),\n          profile_->GetBookmarkModel()->GetMostRecentlyAddedNodeForURL(url)),\n      remove_bookmark_(false),\n      apply_edits_(true) {\n}\n\nvoid BookmarkBubbleView::Init() {\n  static SkColor kTitleColor;\n  static bool initialized = false;\n  if (!initialized) {\n    kTitleColor = color_utils::GetReadableColor(SkColorSetRGB(6, 45, 117),\n                                                InfoBubble::kBackgroundColor);\n    kCloseImage = ResourceBundle::GetSharedInstance().GetBitmapNamed(\n      IDR_INFO_BUBBLE_CLOSE);\n\n    initialized = true;\n  }\n\n  remove_link_ = new Link(l10n_util::GetString(\n      IDS_BOOMARK_BUBBLE_REMOVE_BOOKMARK));\n  remove_link_->SetController(this);\n\n  edit_button_ = new NativeButton(\n      this, l10n_util::GetString(IDS_BOOMARK_BUBBLE_OPTIONS));\n\n  close_button_ = new NativeButton(this, l10n_util::GetString(IDS_DONE));\n  close_button_->SetIsDefault(true);\n\n  Label* combobox_label = new Label(\n      l10n_util::GetString(IDS_BOOMARK_BUBBLE_FOLDER_TEXT));\n\n  parent_combobox_ = new Combobox(&parent_model_);\n  parent_combobox_->SetSelectedItem(parent_model_.node_parent_index());\n  parent_combobox_->set_listener(this);\n  parent_combobox_->SetAccessibleName(combobox_label->GetText());\n\n  Label* title_label = new Label(l10n_util::GetString(\n      newly_bookmarked_ ? IDS_BOOMARK_BUBBLE_PAGE_BOOKMARKED :\n                          IDS_BOOMARK_BUBBLE_PAGE_BOOKMARK));\n  title_label->SetFont(\n      ResourceBundle::GetSharedInstance().GetFont(ResourceBundle::MediumFont));\n  title_label->SetColor(kTitleColor);\n\n  GridLayout* layout = new GridLayout(this);\n  SetLayoutManager(layout);\n\n  ColumnSet* cs = layout->AddColumnSet(0);\n\n  \/\/ Top (title) row.\n  cs->AddColumn(GridLayout::CENTER, GridLayout::CENTER, 0, GridLayout::USE_PREF,\n                0, 0);\n  cs->AddPaddingColumn(1, kUnrelatedControlHorizontalSpacing);\n  cs->AddColumn(GridLayout::CENTER, GridLayout::CENTER, 0, GridLayout::USE_PREF,\n                0, 0);\n\n  \/\/ Middle (input field) rows.\n  cs = layout->AddColumnSet(2);\n  cs->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n                GridLayout::USE_PREF, 0, 0);\n  cs->AddPaddingColumn(0, kRelatedControlHorizontalSpacing);\n  cs->AddColumn(GridLayout::FILL, GridLayout::CENTER, 1,\n                GridLayout::USE_PREF, 0, kMinimumFieldSize);\n\n  \/\/ Bottom (buttons) row.\n  cs = layout->AddColumnSet(3);\n  cs->AddPaddingColumn(1, kRelatedControlHorizontalSpacing);\n  cs->AddColumn(GridLayout::LEADING, GridLayout::TRAILING, 0,\n                GridLayout::USE_PREF, 0, 0);\n  \/\/ We subtract 2 to account for the natural button padding, and\n  \/\/ to bring the separation visually in line with the row separation\n  \/\/ height.\n  cs->AddPaddingColumn(0, kRelatedButtonHSpacing - 2);\n  cs->AddColumn(GridLayout::LEADING, GridLayout::TRAILING, 0,\n                GridLayout::USE_PREF, 0, 0);\n\n  layout->StartRow(0, 0);\n  layout->AddView(title_label);\n  layout->AddView(remove_link_);\n\n  layout->AddPaddingRow(0, kRelatedControlSmallVerticalSpacing);\n  layout->StartRow(0, 2);\n  layout->AddView(\n      new Label(l10n_util::GetString(IDS_BOOMARK_BUBBLE_TITLE_TEXT)));\n  title_tf_ = new views::Textfield();\n  title_tf_->SetText(WideToUTF16(GetTitle()));\n  layout->AddView(title_tf_);\n\n  layout->AddPaddingRow(0, kRelatedControlSmallVerticalSpacing);\n\n  layout->StartRow(0, 2);\n  layout->AddView(combobox_label);\n  layout->AddView(parent_combobox_);\n  layout->AddPaddingRow(0, kRelatedControlSmallVerticalSpacing);\n\n  layout->StartRow(0, 3);\n  layout->AddView(edit_button_);\n  layout->AddView(close_button_);\n}\n\nstd::wstring BookmarkBubbleView::GetTitle() {\n  BookmarkModel* bookmark_model= profile_->GetBookmarkModel();\n  const BookmarkNode* node =\n      bookmark_model->GetMostRecentlyAddedNodeForURL(url_);\n  if (node)\n    return node->GetTitle();\n  else\n    NOTREACHED();\n  return std::wstring();\n}\n\nvoid BookmarkBubbleView::ButtonPressed(\n    views::Button* sender, const views::Event& event) {\n  HandleButtonPressed(sender);\n}\n\nvoid BookmarkBubbleView::LinkActivated(Link* source, int event_flags) {\n  DCHECK(source == remove_link_);\n  UserMetrics::RecordAction(UserMetricsAction(\"BookmarkBubble_Unstar\"),\n                            profile_);\n\n  \/\/ Set this so we remove the bookmark after the window closes.\n  remove_bookmark_ = true;\n  apply_edits_ = false;\n\n  info_bubble_->set_fade_away_on_close(true);\n  Close();\n}\n\nvoid BookmarkBubbleView::ItemChanged(Combobox* combobox,\n                                     int prev_index,\n                                     int new_index) {\n  if (new_index + 1 == parent_model_.GetItemCount()) {\n    UserMetrics::RecordAction(\n              UserMetricsAction(\"BookmarkBubble_EditFromCombobox\"), profile_);\n\n    ShowEditor();\n    return;\n  }\n}\n\nvoid BookmarkBubbleView::InfoBubbleClosing(InfoBubble* info_bubble,\n                                           bool closed_by_escape) {\n  if (closed_by_escape) {\n    remove_bookmark_ = newly_bookmarked_;\n    apply_edits_ = false;\n  }\n\n  \/\/ We have to reset |bubble_| here, not in our destructor, because we'll be\n  \/\/ destroyed asynchronously and the shown state will be checked before then.\n  DCHECK(bubble_ == this);\n  bubble_ = NULL;\n\n  if (delegate_)\n    delegate_->InfoBubbleClosing(info_bubble, closed_by_escape);\n  NotificationService::current()->Notify(\n      NotificationType::BOOKMARK_BUBBLE_HIDDEN,\n      Source<Profile>(profile_->GetOriginalProfile()),\n      NotificationService::NoDetails());\n}\n\nbool BookmarkBubbleView::CloseOnEscape() {\n  return delegate_ ? delegate_->CloseOnEscape() : true;\n}\n\nstd::wstring BookmarkBubbleView::accessible_name() {\n  return l10n_util::GetString(IDS_BOOMARK_BUBBLE_ADD_BOOKMARK);\n}\n\nvoid BookmarkBubbleView::Close() {\n  static_cast<InfoBubble*>(GetWidget())->Close();\n}\n\nvoid BookmarkBubbleView::HandleButtonPressed(views::Button* sender) {\n  if (sender == edit_button_) {\n    UserMetrics::RecordAction(UserMetricsAction(\"BookmarkBubble_Edit\"),\n                              profile_);\n    info_bubble_->set_fade_away_on_close(true);\n    ShowEditor();\n  } else {\n    DCHECK(sender == close_button_);\n    info_bubble_->set_fade_away_on_close(true);\n    Close();\n  }\n  \/\/ WARNING: we've most likely been deleted when CloseWindow returns.\n}\n\nvoid BookmarkBubbleView::ShowEditor() {\n  const BookmarkNode* node =\n      profile_->GetBookmarkModel()->GetMostRecentlyAddedNodeForURL(url_);\n\n  \/\/ Commit any edits now.\n  ApplyEdits();\n\n#if defined(OS_WIN)\n  \/\/ Parent the editor to our root ancestor (not the root we're in, as that\n  \/\/ is the info bubble and will close shortly).\n  HWND parent = GetAncestor(GetWidget()->GetNativeView(), GA_ROOTOWNER);\n\n  \/\/ We're about to show the bookmark editor. When the bookmark editor closes\n  \/\/ we want the browser to become active. WidgetWin::Hide() does a hide in\n  \/\/ a such way that activation isn't changed, which means when we close\n  \/\/ Windows gets confused as to who it should give active status to. We\n  \/\/ explicitly hide the bookmark bubble window in such a way that activation\n  \/\/ status changes. That way, when the editor closes, activation is properly\n  \/\/ restored to the browser.\n  ShowWindow(GetWidget()->GetNativeView(), SW_HIDE);\n#else\n  gfx::NativeWindow parent = GTK_WINDOW(\n      static_cast<views::WidgetGtk*>(GetWidget())->GetTransientParent());\n#endif\n\n  \/\/ Even though we just hid the window, we need to invoke Close to schedule\n  \/\/ the delete and all that.\n  Close();\n\n  if (node) {\n    BookmarkEditor::Show(parent, profile_, NULL,\n                         BookmarkEditor::EditDetails(node),\n                         BookmarkEditor::SHOW_TREE);\n  }\n}\n\nvoid BookmarkBubbleView::ApplyEdits() {\n  \/\/ Set this to make sure we don't attempt to apply edits again.\n  apply_edits_ = false;\n\n  BookmarkModel* model = profile_->GetBookmarkModel();\n  const BookmarkNode* node = model->GetMostRecentlyAddedNodeForURL(url_);\n  if (node) {\n    const std::wstring new_title = UTF16ToWide(title_tf_->text());\n    if (new_title != node->GetTitle()) {\n      model->SetTitle(node, new_title);\n      UserMetrics::RecordAction(\n          UserMetricsAction(\"BookmarkBubble_ChangeTitleInBubble\"),\n          profile_);\n    }\n    \/\/ Last index means 'Choose another folder...'\n    if (parent_combobox_->selected_item() <\n        parent_model_.GetItemCount() - 1) {\n      const BookmarkNode* new_parent =\n          parent_model_.GetNodeAt(parent_combobox_->selected_item());\n      if (new_parent != node->GetParent()) {\n        UserMetrics::RecordAction(\n            UserMetricsAction(\"BookmarkBubble_ChangeParent\"), profile_);\n        model->Move(node, new_parent, new_parent->GetChildCount());\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 \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/test\/test_timeouts.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"chrome\/test\/perf\/perf_test.h\"\n#include \"chrome\/test\/ui\/javascript_test_util.h\"\n#include \"chrome\/test\/ui\/ui_perf_test.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/base\/net_util.h\"\n\nnamespace {\n\nconst char kRunDromaeo[] = \"run-dromaeo-benchmark\";\n\nclass DromaeoTest : public UIPerfTest {\n public:\n  typedef std::map<std::string, std::string> ResultsMap;\n\n  DromaeoTest() : reference_(false) {\n    dom_automation_enabled_ = true;\n    show_window_ = true;\n  }\n\n  void RunTest(const std::string& suite) {\n    if (!CommandLine::ForCurrentProcess()->HasSwitch(kRunDromaeo))\n      return;\n    FilePath test_path = GetDromaeoDir();\n    std::string query_string = suite + \"&automated\";\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"index.html\"));\n    GURL test_url(content::GetFileUrlWithQuery(test_path, query_string));\n\n    scoped_refptr<TabProxy> tab(GetActiveTab());\n    ASSERT_EQ(AUTOMATION_MSG_NAVIGATION_SUCCESS, tab->NavigateToURL(test_url));\n\n    \/\/ Wait for the test to finish.\n    ASSERT_TRUE(WaitUntilTestCompletes(tab.get(), test_url));\n\n    PrintResults(tab.get());\n  }\n\n protected:\n  bool reference_;  \/\/ True if this is a reference build.\n\n private:\n  \/\/ Return the path to the dromaeo benchmark directory on the local filesystem.\n  FilePath GetDromaeoDir() {\n    FilePath test_dir;\n    PathService::Get(chrome::DIR_TEST_DATA, &test_dir);\n    return test_dir.AppendASCII(\"dromaeo\");\n  }\n\n  bool WaitUntilTestCompletes(TabProxy* tab, const GURL& test_url) {\n    return WaitUntilCookieValue(tab, test_url, \"__done\",\n                                TestTimeouts::large_test_timeout(), \"1\");\n  }\n\n  bool GetScore(TabProxy* tab, std::string* score) {\n    std::wstring score_wide;\n    bool succeeded = tab->ExecuteAndExtractString(L\"\",\n        L\"window.domAutomationController.send(automation.GetScore());\",\n        &score_wide);\n\n    \/\/ Note that we don't use ASSERT_TRUE here (and in some other places) as it\n    \/\/ doesn't work inside a function with a return type other than void.\n    EXPECT_TRUE(succeeded);\n    if (!succeeded)\n      return false;\n\n    score->assign(WideToUTF8(score_wide));\n    return true;\n  }\n\n  bool GetResults(TabProxy* tab, ResultsMap* results) {\n    std::wstring json_wide;\n    bool succeeded = tab->ExecuteAndExtractString(L\"\",\n        L\"window.domAutomationController.send(\"\n        L\"    JSON.stringify(automation.GetResults()));\",\n        &json_wide);\n\n    EXPECT_TRUE(succeeded);\n    if (!succeeded)\n      return false;\n\n    std::string json = WideToUTF8(json_wide);\n    return JsonDictionaryToMap(json, results);\n  }\n\n  void PrintResults(TabProxy* tab) {\n    std::string score;\n    ASSERT_TRUE(GetScore(tab, &score));\n\n    ResultsMap results;\n    ASSERT_TRUE(GetResults(tab, &results));\n\n    std::string trace_name = reference_ ? \"score_ref\" : \"score\";\n    std::string unit_name = \"runs\/s\";\n\n    ResultsMap::const_iterator it = results.begin();\n    \/\/ First result is overall score and thus \"important\".\n    bool important = true;\n    for (; it != results.end(); ++it) {\n      std::string test_name = it->first;\n      for (size_t i = 0; i < test_name.length(); i++)\n        if (!isalnum(test_name[i]))\n          test_name[i] = '_';\n      perf_test::PrintResult(test_name, \"\", trace_name, it->second, unit_name,\n                             important);\n      important = false;  \/\/ All others are not overall scores.\n    }\n  }\n\n  DISALLOW_COPY_AND_ASSIGN(DromaeoTest);\n};\n\nclass DromaeoReferenceTest : public DromaeoTest {\n public:\n  DromaeoReferenceTest() : DromaeoTest() {\n    reference_ = true;\n  }\n\n  void SetUp() {\n    UseReferenceBuild();\n    DromaeoTest::SetUp();\n  }\n};\n\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/134570 - is flaky on Win7 perf bot\n#define MAYBE_DOMCorePerf DISABLED_DOMCorePerf\n#define MAYBE_DOMCoreModifyPerf DISABLED_DOMCoreModifyPerf\n#else\n#define MAYBE_DOMCorePerf DOMCorePerf\n#define MAYBE_DOMCoreModifyPerf DOMCoreModifyPerf\n#endif\nTEST_F(DromaeoTest, MAYBE_DOMCorePerf) {\n  RunTest(\"dom\");\n}\n\nTEST_F(DromaeoTest, DOMCoreAttrPerf) {\n  RunTest(\"dom-attr\");\n}\n\nTEST_F(DromaeoTest, MAYBE_DOMCoreModifyPerf) {\n  RunTest(\"dom-modify\");\n}\n\nTEST_F(DromaeoTest, DOMCoreQueryPerf) {\n  RunTest(\"dom-query\");\n}\n\nTEST_F(DromaeoTest, DOMCoreTraversePerf) {\n  RunTest(\"dom-traverse\");\n}\n\nTEST_F(DromaeoTest, JSLibPerf) {\n  RunTest(\"jslib\");\n}\n\nTEST_F(DromaeoTest, JSLibAttrJqueryPerf) {\n  RunTest(\"jslib-attr-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibAttrPrototypePerf) {\n  RunTest(\"jslib-attr-prototype\");\n}\n\nTEST_F(DromaeoTest, JSLibEventJqueryPerf) {\n  RunTest(\"jslib-event-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibEventPrototypePerf) {\n  RunTest(\"jslib-event-prototype\");\n}\n\nTEST_F(DromaeoTest, JSLibModifyJqueryPerf) {\n  RunTest(\"jslib-modify-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibModifyPrototypePerf) {\n  RunTest(\"jslib-modify-prototype\");\n}\n\nTEST_F(DromaeoTest, JSLibTraverseJqueryPerf) {\n  RunTest(\"jslib-traverse-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibTraversePrototypePerf) {\n  RunTest(\"jslib-traverse-prototype\");\n}\n\nTEST_F(DromaeoTest, JSLibStyleJqueryPerf) {\n  RunTest(\"jslib-style-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibStylePrototypePerf) {\n  RunTest(\"jslib-style-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, MAYBE_DOMCorePerf) {\n  RunTest(\"dom\");\n}\n\nTEST_F(DromaeoReferenceTest, DOMCoreAttrPerf) {\n  RunTest(\"dom-attr\");\n}\n\nTEST_F(DromaeoReferenceTest, DOMCoreModifyPerf) {\n  RunTest(\"dom-modify\");\n}\n\nTEST_F(DromaeoReferenceTest, DOMCoreQueryPerf) {\n  RunTest(\"dom-query\");\n}\n\nTEST_F(DromaeoReferenceTest, DOMCoreTraversePerf) {\n  RunTest(\"dom-traverse\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibPerf) {\n  RunTest(\"jslib\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibAttrJqueryPerf) {\n  RunTest(\"jslib-attr-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibAttrPrototypePerf) {\n  RunTest(\"jslib-attr-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibEventJqueryPerf) {\n  RunTest(\"jslib-event-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibEventPrototypePerf) {\n  RunTest(\"jslib-event-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibModifyJqueryPerf) {\n  RunTest(\"jslib-modify-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibModifyPrototypePerf) {\n  RunTest(\"jslib-modify-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibTraverseJqueryPerf) {\n  RunTest(\"jslib-traverse-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibTraversePrototypePerf) {\n  RunTest(\"jslib-traverse-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibStyleJqueryPerf) {\n  RunTest(\"jslib-style-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibStylePrototypePerf) {\n  RunTest(\"jslib-style-prototype\");\n}\n\n\n}  \/\/ namespace\n<commit_msg>Disabled reference build for Dromeao DOMCore Modify too.<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 \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/test\/test_timeouts.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"chrome\/test\/perf\/perf_test.h\"\n#include \"chrome\/test\/ui\/javascript_test_util.h\"\n#include \"chrome\/test\/ui\/ui_perf_test.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/base\/net_util.h\"\n\nnamespace {\n\nconst char kRunDromaeo[] = \"run-dromaeo-benchmark\";\n\nclass DromaeoTest : public UIPerfTest {\n public:\n  typedef std::map<std::string, std::string> ResultsMap;\n\n  DromaeoTest() : reference_(false) {\n    dom_automation_enabled_ = true;\n    show_window_ = true;\n  }\n\n  void RunTest(const std::string& suite) {\n    if (!CommandLine::ForCurrentProcess()->HasSwitch(kRunDromaeo))\n      return;\n    FilePath test_path = GetDromaeoDir();\n    std::string query_string = suite + \"&automated\";\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"index.html\"));\n    GURL test_url(content::GetFileUrlWithQuery(test_path, query_string));\n\n    scoped_refptr<TabProxy> tab(GetActiveTab());\n    ASSERT_EQ(AUTOMATION_MSG_NAVIGATION_SUCCESS, tab->NavigateToURL(test_url));\n\n    \/\/ Wait for the test to finish.\n    ASSERT_TRUE(WaitUntilTestCompletes(tab.get(), test_url));\n\n    PrintResults(tab.get());\n  }\n\n protected:\n  bool reference_;  \/\/ True if this is a reference build.\n\n private:\n  \/\/ Return the path to the dromaeo benchmark directory on the local filesystem.\n  FilePath GetDromaeoDir() {\n    FilePath test_dir;\n    PathService::Get(chrome::DIR_TEST_DATA, &test_dir);\n    return test_dir.AppendASCII(\"dromaeo\");\n  }\n\n  bool WaitUntilTestCompletes(TabProxy* tab, const GURL& test_url) {\n    return WaitUntilCookieValue(tab, test_url, \"__done\",\n                                TestTimeouts::large_test_timeout(), \"1\");\n  }\n\n  bool GetScore(TabProxy* tab, std::string* score) {\n    std::wstring score_wide;\n    bool succeeded = tab->ExecuteAndExtractString(L\"\",\n        L\"window.domAutomationController.send(automation.GetScore());\",\n        &score_wide);\n\n    \/\/ Note that we don't use ASSERT_TRUE here (and in some other places) as it\n    \/\/ doesn't work inside a function with a return type other than void.\n    EXPECT_TRUE(succeeded);\n    if (!succeeded)\n      return false;\n\n    score->assign(WideToUTF8(score_wide));\n    return true;\n  }\n\n  bool GetResults(TabProxy* tab, ResultsMap* results) {\n    std::wstring json_wide;\n    bool succeeded = tab->ExecuteAndExtractString(L\"\",\n        L\"window.domAutomationController.send(\"\n        L\"    JSON.stringify(automation.GetResults()));\",\n        &json_wide);\n\n    EXPECT_TRUE(succeeded);\n    if (!succeeded)\n      return false;\n\n    std::string json = WideToUTF8(json_wide);\n    return JsonDictionaryToMap(json, results);\n  }\n\n  void PrintResults(TabProxy* tab) {\n    std::string score;\n    ASSERT_TRUE(GetScore(tab, &score));\n\n    ResultsMap results;\n    ASSERT_TRUE(GetResults(tab, &results));\n\n    std::string trace_name = reference_ ? \"score_ref\" : \"score\";\n    std::string unit_name = \"runs\/s\";\n\n    ResultsMap::const_iterator it = results.begin();\n    \/\/ First result is overall score and thus \"important\".\n    bool important = true;\n    for (; it != results.end(); ++it) {\n      std::string test_name = it->first;\n      for (size_t i = 0; i < test_name.length(); i++)\n        if (!isalnum(test_name[i]))\n          test_name[i] = '_';\n      perf_test::PrintResult(test_name, \"\", trace_name, it->second, unit_name,\n                             important);\n      important = false;  \/\/ All others are not overall scores.\n    }\n  }\n\n  DISALLOW_COPY_AND_ASSIGN(DromaeoTest);\n};\n\nclass DromaeoReferenceTest : public DromaeoTest {\n public:\n  DromaeoReferenceTest() : DromaeoTest() {\n    reference_ = true;\n  }\n\n  void SetUp() {\n    UseReferenceBuild();\n    DromaeoTest::SetUp();\n  }\n};\n\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/134570 - is flaky on Win7 perf bot\n#define MAYBE_DOMCorePerf DISABLED_DOMCorePerf\n#define MAYBE_DOMCoreModifyPerf DISABLED_DOMCoreModifyPerf\n#else\n#define MAYBE_DOMCorePerf DOMCorePerf\n#define MAYBE_DOMCoreModifyPerf DOMCoreModifyPerf\n#endif\nTEST_F(DromaeoTest, MAYBE_DOMCorePerf) {\n  RunTest(\"dom\");\n}\n\nTEST_F(DromaeoTest, DOMCoreAttrPerf) {\n  RunTest(\"dom-attr\");\n}\n\nTEST_F(DromaeoTest, MAYBE_DOMCoreModifyPerf) {\n  RunTest(\"dom-modify\");\n}\n\nTEST_F(DromaeoTest, DOMCoreQueryPerf) {\n  RunTest(\"dom-query\");\n}\n\nTEST_F(DromaeoTest, DOMCoreTraversePerf) {\n  RunTest(\"dom-traverse\");\n}\n\nTEST_F(DromaeoTest, JSLibPerf) {\n  RunTest(\"jslib\");\n}\n\nTEST_F(DromaeoTest, JSLibAttrJqueryPerf) {\n  RunTest(\"jslib-attr-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibAttrPrototypePerf) {\n  RunTest(\"jslib-attr-prototype\");\n}\n\nTEST_F(DromaeoTest, JSLibEventJqueryPerf) {\n  RunTest(\"jslib-event-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibEventPrototypePerf) {\n  RunTest(\"jslib-event-prototype\");\n}\n\nTEST_F(DromaeoTest, JSLibModifyJqueryPerf) {\n  RunTest(\"jslib-modify-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibModifyPrototypePerf) {\n  RunTest(\"jslib-modify-prototype\");\n}\n\nTEST_F(DromaeoTest, JSLibTraverseJqueryPerf) {\n  RunTest(\"jslib-traverse-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibTraversePrototypePerf) {\n  RunTest(\"jslib-traverse-prototype\");\n}\n\nTEST_F(DromaeoTest, JSLibStyleJqueryPerf) {\n  RunTest(\"jslib-style-jquery\");\n}\n\nTEST_F(DromaeoTest, JSLibStylePrototypePerf) {\n  RunTest(\"jslib-style-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, MAYBE_DOMCorePerf) {\n  RunTest(\"dom\");\n}\n\nTEST_F(DromaeoReferenceTest, DOMCoreAttrPerf) {\n  RunTest(\"dom-attr\");\n}\n\nTEST_F(DromaeoReferenceTest, MAYBE_DOMCoreModifyPerf) {\n  RunTest(\"dom-modify\");\n}\n\nTEST_F(DromaeoReferenceTest, DOMCoreQueryPerf) {\n  RunTest(\"dom-query\");\n}\n\nTEST_F(DromaeoReferenceTest, DOMCoreTraversePerf) {\n  RunTest(\"dom-traverse\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibPerf) {\n  RunTest(\"jslib\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibAttrJqueryPerf) {\n  RunTest(\"jslib-attr-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibAttrPrototypePerf) {\n  RunTest(\"jslib-attr-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibEventJqueryPerf) {\n  RunTest(\"jslib-event-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibEventPrototypePerf) {\n  RunTest(\"jslib-event-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibModifyJqueryPerf) {\n  RunTest(\"jslib-modify-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibModifyPrototypePerf) {\n  RunTest(\"jslib-modify-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibTraverseJqueryPerf) {\n  RunTest(\"jslib-traverse-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibTraversePrototypePerf) {\n  RunTest(\"jslib-traverse-prototype\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibStyleJqueryPerf) {\n  RunTest(\"jslib-style-jquery\");\n}\n\nTEST_F(DromaeoReferenceTest, JSLibStylePrototypePerf) {\n  RunTest(\"jslib-style-prototype\");\n}\n\n\n}  \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2005, Peter Sommerlad and IFS Institute for Software at HSR Rapperswil, Switzerland\n * All rights reserved.\n *\n * This library\/application is free software; you can redistribute and\/or modify it under the terms of\n * the license that is included with this library\/application in the file license.txt.\n *\/\n\n\/\/--- interface include --------------------------------------------------------\n#include \"AnyBuiltInSortTest.h\"\n\n\/\/--- test modules used --------------------------------------------------------\n#include \"TestSuite.h\"\n\n\/\/--- module under test --------------------------------------------------------\n#include \"Anything.h\"\n\/\/--- standard modules used ----------------------------------------------------\n#include \"Dbg.h\"\n#include \"DiffTimer.h\"\n#include \"StringStream.h\"\n\/\/--- c-modules used -----------------------------------------------------------\n#include <stdlib.h>\n\n\/\/---- AnyBuiltInSortTest ----------------------------------------------------------------\nAnyBuiltInSortTest::AnyBuiltInSortTest(TString name) : TestCase(name)\n{\n\tStartTrace(AnyBuiltInSortTest.Ctor);\n}\n\nAnyBuiltInSortTest::~AnyBuiltInSortTest()\n{\n\tStartTrace(AnyBuiltInSortTest.Dtor);\n}\n\n\/\/ setup for this TestCase\nvoid AnyBuiltInSortTest::setUp ()\n{\n\tStartTrace(AnyBuiltInSortTest.setUp);\n}\n\nvoid AnyBuiltInSortTest::tearDown ()\n{\n\tStartTrace(AnyBuiltInSortTest.tearDown);\n}\nbool AnyBuiltInSortTest::checksorted(const Anything &a, bool shouldfail)\n{\n\tfor (long i = 0; i < a.GetSize() - 1; i++) {\n\t\tconst char *s = a.SlotName(i);\n\t\tconst char *t = a.SlotName(i + 1);\n\t\tif (strcmp(NotNull(s), NotNull(t)) > 0) {\n\t\t\tif (!shouldfail) {\n\t\t\t\tTString msg(\"slots unsorted \");\n\t\t\t\tmsg.Append(s).Append(\" > \").Append(t);\n\t\t\t\tt_assertm(false, msg);\n\t\t\t}\n\t\t\treturn shouldfail;\n\t\t}\n\t}\n\treturn !shouldfail;\n}\nbool AnyBuiltInSortTest::checksortedbyvalue(const Anything &a, bool shouldfail)\n{\n\tfor (long i = 0; i < a.GetSize() - 1; i++) {\n\t\tconst char *s = a[i].AsCharPtr();\n\t\tconst char *t = a[i+1].AsCharPtr();\n\t\tif (strcmp(NotNull(s), NotNull(t)) > 0) {\n\t\t\tif (!shouldfail) {\n\t\t\t\tTString msg(\"slots unsorted \");\n\t\t\t\tmsg.Append(s).Append(\" > \").Append(t);\n\t\t\t\tt_assertm(false, msg);\n\t\t\t}\n\t\t\treturn shouldfail;\n\t\t}\n\t}\n\treturn !shouldfail;\n}\nvoid AnyBuiltInSortTest::SortEmpty()\n{\n\tStartTrace(AnyBuiltInSortTest.SortEmpty);\n\tAnything a;\n\tAnything b(a);\n\tb.SortByKey();\n\tassertAnyEqual(a, b);\n}\n\nvoid AnyBuiltInSortTest::SortOne()\n{\n\tStartTrace(AnyBuiltInSortTest.SortOne);\n\tAnything a(\"foo\");\n\tAnything b(a);\n\tb.SortByKey();\n\tassertAnyEqual(a, b);\n\n}\nvoid AnyBuiltInSortTest::SortTwo()\n{\n\tStartTrace(AnyBuiltInSortTest.SortTwo);\n\tAnything b;\n\tb[\"b\"] = 1;\n\tb[\"a\"] = 2;\n\tassertEqual(1, b[0].AsLong());\n\tassertEqual(2, b[1].AsLong());\n\tb.SortByKey();\n\tt_assert(checksorted(b));\n\tassertEqual(\"a\", b.SlotName(0));\n\tassertEqual(\"b\", b.SlotName(1));\n\tassertEqual(1, b[1].AsLong());\n\tassertEqual(2, b[0].AsLong());\n\tassertEqual(2, b[\"a\"].AsLong());\n\tassertEqual(1, b[\"b\"].AsLong());\n\tb.SortByKey(); \/\/ should be same!\n\tt_assert(checksorted(b));\n\tassertEqual(\"a\", b.SlotName(0));\n\tassertEqual(\"b\", b.SlotName(1));\n\tassertEqual(1, b[1].AsLong());\n\tassertEqual(2, b[0].AsLong());\n\tassertEqual(2, b[\"a\"].AsLong());\n\tassertEqual(1, b[\"b\"].AsLong());\n}\n\nvoid AnyBuiltInSortTest::SortThree()\n{\n\tStartTrace(AnyBuiltInSortTest.SortThree);\n\tAnything b;\n\tb[\"c\"] = 1;\n\tb[\"a\"] = 2;\n\tb[\"b\"] = 3;\n\tassertEqual(1, b[0].AsLong());\n\tassertEqual(2, b[1].AsLong());\n\tassertEqual(3, b[2].AsLong());\n\tb.SortByKey();\n\tt_assert(checksorted(b));\n\tb.SortByKey();\n\tt_assert(checksorted(b));\n\n}\n\nvoid AnyBuiltInSortTest::SortMany()\n{\n\tStartTrace(AnyBuiltInSortTest.SortMany);\n\tAnything a;\n\tAnything b;\n\tconst long size = 1000;\n\tfor (long i = 0; i < size; i++) {\n\t\tlong r = random();\n\t\tString sr;\n\t\tsr << i << \"bar\" << r << \"foo\"; \/\/ needs i to make it unique\n\t\ta[sr] = i;\n\t\tb[sr] = i;\n\t}\n\tassertEqual(size, a.GetSize());\n\tassertEqual(size, b.GetSize());\n\tt_assertm(checksorted(a, true), \"should be random\");\n\tDiffTimer dt;\n\ta.SortByKey();\n\tcerr << \"sorting of \" << size << \" took \" << dt.Diff() << \" ms.\\n\";\n\tt_assertm(checksorted(a), \"should be sorted\");\n\tassertEqual(size, a.GetSize());\n\tfor (long i = 0; i < size; i++) {\n\t\tif (!assertEqualm(i, a[b.SlotName(i)].AsLong(), TString(\"in slot i : \") << i)) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tdt.Reset();\n\ta.SortByKey();\n\tcerr << \"sorting of sorted \" << size << \" took \" << dt.Diff() << \" ms.\\n\";\n\t\/\/ now sort b by using the legacy SlotNameSorter...several orders of magnitude slower.\n\tdt.Reset();\n\tSlotnameSorter::Sort(b);\n\tcerr << \"Slogname sorting of \" << size << \" took \" << dt.Diff() << \" ms.\\n\";\n\tassertAnyEqual(a, b);\n\n}\n\nvoid AnyBuiltInSortTest::SortManyStringValues()\n{\n\tStartTrace(AnyBuiltInSortTest.SortManyStringValues);\n\tAnything a;\n\tAnything b;\n\tconst long size = 1000;\n\tfor (long i = 0; i < size; i++) {\n\t\tlong r = random();\n\t\tString sr;\n\t\tsr << \"bar\" << r << \"foo\"; \/\/ needs i to make it unique\n\t\ta.Append(sr);;\n\t}\n\tassertEqual(size, a.GetSize());\n\tt_assertm(checksortedbyvalue(a, true), \"should be random\");\n\tDiffTimer dt;\n\ta.SortByStringValues();\n\tcerr << \"sorting of \" << size << \" took \" << dt.Diff() << \" ms.\\n\";\n\tt_assertm(checksortedbyvalue(a), \"should be sorted\");\n\tassertEqual(size, a.GetSize());\n}\nvoid AnyBuiltInSortTest::SortIsStable()\n{\n\tStartTrace(AnyBuiltInSortTest.SortIsStable);\n\tAnything a;\n\ta[\"d\"] = 1;\n\ta[\"c\"] = 2;\n\ta[\"a\"] = 3;\n\tfor (long i = 4; i < 10; i++) {\n\t\ta.Append(i);\n\t}\n\tt_assertm(checksorted(a, true), \"should be unsorted\");\n\ta.SortByKey();\n\tfor (long i = 0; i < a.GetSize() - 1; i++)\n\t\tif (!a.SlotName(i) && !a.SlotName(i + 1)) {\n\t\t\tt_assertm(a[i].AsLong() < a[i+1].AsLong(), TString(\"unstable at: \") << i << \":\" << a[i].AsLong() << \" not less than \" << a[i+1].AsLong());\n\t\t}\n\n}\nvoid AnyBuiltInSortTest::testCase()\n{\n\tStartTrace(AnyBuiltInSortTest.testCase);\n\/\/\tt_assertm(false, \"test me!\");\n}\n\/\/ builds up a suite of testcases, add a line for each testmethod\nTest *AnyBuiltInSortTest::suite ()\n{\n\tStartTrace(AnyBuiltInSortTest.suite);\n\tTestSuite *testSuite = new TestSuite;\n\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortEmpty);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortOne);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortTwo);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortThree);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortMany);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortManyStringValues);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortIsStable);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, testCase);\n\n\treturn testSuite;\n}\n<commit_msg>corrected duplicate definition\/usage of variables corrected WIN32 version of random<commit_after>\/*\n * Copyright (c) 2005, Peter Sommerlad and IFS Institute for Software at HSR Rapperswil, Switzerland\n * All rights reserved.\n *\n * This library\/application is free software; you can redistribute and\/or modify it under the terms of\n * the license that is included with this library\/application in the file license.txt.\n *\/\n\n\/\/--- interface include --------------------------------------------------------\n#include \"AnyBuiltInSortTest.h\"\n\n\/\/--- test modules used --------------------------------------------------------\n#include \"TestSuite.h\"\n\n\/\/--- module under test --------------------------------------------------------\n#include \"Anything.h\"\n\/\/--- standard modules used ----------------------------------------------------\n#include \"Dbg.h\"\n#include \"DiffTimer.h\"\n#include \"StringStream.h\"\n\/\/--- c-modules used -----------------------------------------------------------\n#include <stdlib.h>\n\n\/\/---- AnyBuiltInSortTest ----------------------------------------------------------------\nAnyBuiltInSortTest::AnyBuiltInSortTest(TString name) : TestCase(name)\n{\n\tStartTrace(AnyBuiltInSortTest.Ctor);\n}\n\nAnyBuiltInSortTest::~AnyBuiltInSortTest()\n{\n\tStartTrace(AnyBuiltInSortTest.Dtor);\n}\n\n\/\/ setup for this TestCase\nvoid AnyBuiltInSortTest::setUp ()\n{\n\tStartTrace(AnyBuiltInSortTest.setUp);\n}\n\nvoid AnyBuiltInSortTest::tearDown ()\n{\n\tStartTrace(AnyBuiltInSortTest.tearDown);\n}\nbool AnyBuiltInSortTest::checksorted(const Anything &a, bool shouldfail)\n{\n\tfor (long i = 0; i < a.GetSize() - 1; i++) {\n\t\tconst char *s = a.SlotName(i);\n\t\tconst char *t = a.SlotName(i + 1);\n\t\tif (strcmp(NotNull(s), NotNull(t)) > 0) {\n\t\t\tif (!shouldfail) {\n\t\t\t\tTString msg(\"slots unsorted \");\n\t\t\t\tmsg.Append(s).Append(\" > \").Append(t);\n\t\t\t\tt_assertm(false, msg);\n\t\t\t}\n\t\t\treturn shouldfail;\n\t\t}\n\t}\n\treturn !shouldfail;\n}\nbool AnyBuiltInSortTest::checksortedbyvalue(const Anything &a, bool shouldfail)\n{\n\tfor (long i = 0; i < a.GetSize() - 1; i++) {\n\t\tconst char *s = a[i].AsCharPtr();\n\t\tconst char *t = a[i+1].AsCharPtr();\n\t\tif (strcmp(NotNull(s), NotNull(t)) > 0) {\n\t\t\tif (!shouldfail) {\n\t\t\t\tTString msg(\"slots unsorted \");\n\t\t\t\tmsg.Append(s).Append(\" > \").Append(t);\n\t\t\t\tt_assertm(false, msg);\n\t\t\t}\n\t\t\treturn shouldfail;\n\t\t}\n\t}\n\treturn !shouldfail;\n}\nvoid AnyBuiltInSortTest::SortEmpty()\n{\n\tStartTrace(AnyBuiltInSortTest.SortEmpty);\n\tAnything a;\n\tAnything b(a);\n\tb.SortByKey();\n\tassertAnyEqual(a, b);\n}\n\nvoid AnyBuiltInSortTest::SortOne()\n{\n\tStartTrace(AnyBuiltInSortTest.SortOne);\n\tAnything a(\"foo\");\n\tAnything b(a);\n\tb.SortByKey();\n\tassertAnyEqual(a, b);\n\n}\nvoid AnyBuiltInSortTest::SortTwo()\n{\n\tStartTrace(AnyBuiltInSortTest.SortTwo);\n\tAnything b;\n\tb[\"b\"] = 1;\n\tb[\"a\"] = 2;\n\tassertEqual(1, b[0].AsLong());\n\tassertEqual(2, b[1].AsLong());\n\tb.SortByKey();\n\tt_assert(checksorted(b));\n\tassertEqual(\"a\", b.SlotName(0));\n\tassertEqual(\"b\", b.SlotName(1));\n\tassertEqual(1, b[1].AsLong());\n\tassertEqual(2, b[0].AsLong());\n\tassertEqual(2, b[\"a\"].AsLong());\n\tassertEqual(1, b[\"b\"].AsLong());\n\tb.SortByKey(); \/\/ should be same!\n\tt_assert(checksorted(b));\n\tassertEqual(\"a\", b.SlotName(0));\n\tassertEqual(\"b\", b.SlotName(1));\n\tassertEqual(1, b[1].AsLong());\n\tassertEqual(2, b[0].AsLong());\n\tassertEqual(2, b[\"a\"].AsLong());\n\tassertEqual(1, b[\"b\"].AsLong());\n}\n\nvoid AnyBuiltInSortTest::SortThree()\n{\n\tStartTrace(AnyBuiltInSortTest.SortThree);\n\tAnything b;\n\tb[\"c\"] = 1;\n\tb[\"a\"] = 2;\n\tb[\"b\"] = 3;\n\tassertEqual(1, b[0].AsLong());\n\tassertEqual(2, b[1].AsLong());\n\tassertEqual(3, b[2].AsLong());\n\tb.SortByKey();\n\tt_assert(checksorted(b));\n\tb.SortByKey();\n\tt_assert(checksorted(b));\n}\n\nvoid AnyBuiltInSortTest::SortMany()\n{\n\tStartTrace(AnyBuiltInSortTest.SortMany);\n\tAnything a;\n\tAnything b;\n\tconst long size = 1000;\n\tlong i;\n\tfor (i = 0; i < size; i++) {\n#if defined(WIN32)\n\t\tlong r = rand();\n#else\n\t\tlong r = random();\n#endif\n\t\tString sr;\n\t\tsr << i << \"bar\" << r << \"foo\"; \/\/ needs i to make it unique\n\t\ta[sr] = i;\n\t\tb[sr] = i;\n\t}\n\tassertEqual(size, a.GetSize());\n\tassertEqual(size, b.GetSize());\n\tt_assertm(checksorted(a, true), \"should be random\");\n\tDiffTimer dt;\n\ta.SortByKey();\n\tcerr << \"sorting of \" << size << \" took \" << dt.Diff() << \" ms.\\n\";\n\tt_assertm(checksorted(a), \"should be sorted\");\n\tassertEqual(size, a.GetSize());\n\tfor (i = 0; i < size; i++) {\n\t\tif (!assertEqualm(i, a[b.SlotName(i)].AsLong(), TString(\"in slot i : \") << i)) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tdt.Reset();\n\ta.SortByKey();\n\tcerr << \"sorting of sorted \" << size << \" took \" << dt.Diff() << \" ms.\\n\";\n\t\/\/ now sort b by using the legacy SlotNameSorter...several orders of magnitude slower.\n\tdt.Reset();\n\tSlotnameSorter::Sort(b);\n\tcerr << \"Slogname sorting of \" << size << \" took \" << dt.Diff() << \" ms.\\n\";\n\tassertAnyEqual(a, b);\n}\n\nvoid AnyBuiltInSortTest::SortManyStringValues()\n{\n\tStartTrace(AnyBuiltInSortTest.SortManyStringValues);\n\tAnything a;\n\tAnything b;\n\tconst long size = 1000;\n\tfor (long i = 0; i < size; i++) {\n#if defined(WIN32)\n\t\tlong r = rand();\n#else\n\t\tlong r = random();\n#endif\n\t\tString sr;\n\t\tsr << \"bar\" << r << \"foo\"; \/\/ needs i to make it unique\n\t\ta.Append(sr);;\n\t}\n\tassertEqual(size, a.GetSize());\n\tt_assertm(checksortedbyvalue(a, true), \"should be random\");\n\tDiffTimer dt;\n\ta.SortByStringValues();\n\tcerr << \"sorting of \" << size << \" took \" << dt.Diff() << \" ms.\\n\";\n\tt_assertm(checksortedbyvalue(a), \"should be sorted\");\n\tassertEqual(size, a.GetSize());\n}\n\nvoid AnyBuiltInSortTest::SortIsStable()\n{\n\tStartTrace(AnyBuiltInSortTest.SortIsStable);\n\tAnything a;\n\ta[\"d\"] = 1;\n\ta[\"c\"] = 2;\n\ta[\"a\"] = 3;\n\tlong i;\n\tfor (i = 4; i < 10; i++) {\n\t\ta.Append(i);\n\t}\n\tt_assertm(checksorted(a, true), \"should be unsorted\");\n\ta.SortByKey();\n\tfor (i = 0; i < a.GetSize() - 1; i++)\n\t\tif (!a.SlotName(i) && !a.SlotName(i + 1)) {\n\t\t\tt_assertm(a[i].AsLong() < a[i+1].AsLong(), TString(\"unstable at: \") << i << \":\" << a[i].AsLong() << \" not less than \" << a[i+1].AsLong());\n\t\t}\n\n}\nvoid AnyBuiltInSortTest::testCase()\n{\n\tStartTrace(AnyBuiltInSortTest.testCase);\n\/\/\tt_assertm(false, \"test me!\");\n}\n\/\/ builds up a suite of testcases, add a line for each testmethod\nTest *AnyBuiltInSortTest::suite ()\n{\n\tStartTrace(AnyBuiltInSortTest.suite);\n\tTestSuite *testSuite = new TestSuite;\n\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortEmpty);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortOne);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortTwo);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortThree);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortMany);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortManyStringValues);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, SortIsStable);\n\tADD_CASE(testSuite, AnyBuiltInSortTest, testCase);\n\n\treturn testSuite;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\/\n\/*  resource_importer_ogg_vorbis.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 \"resource_importer_ogg_vorbis.h\"\n\n#include \"io\/resource_saver.h\"\n#include \"os\/file_access.h\"\n#include \"scene\/resources\/texture.h\"\n\nString ResourceImporterOGGVorbis::get_importer_name() const {\n\n\treturn \"ogg_vorbis\";\n}\n\nString ResourceImporterOGGVorbis::get_visible_name() const {\n\n\treturn \"OGGVorbis\";\n}\nvoid ResourceImporterOGGVorbis::get_recognized_extensions(List<String> *p_extensions) const {\n\n\tp_extensions->push_back(\"ogg\");\n}\n\nString ResourceImporterOGGVorbis::get_save_extension() const {\n\treturn \"oggstr\";\n}\n\nString ResourceImporterOGGVorbis::get_resource_type() const {\n\n\treturn \"AudioStreamOGGVorbis\";\n}\n\nbool ResourceImporterOGGVorbis::get_option_visibility(const String &p_option, const Map<StringName, Variant> &p_options) const {\n\n\treturn true;\n}\n\nint ResourceImporterOGGVorbis::get_preset_count() const {\n\treturn 0;\n}\nString ResourceImporterOGGVorbis::get_preset_name(int p_idx) const {\n\n\treturn String();\n}\n\nvoid ResourceImporterOGGVorbis::get_import_options(List<ImportOption> *r_options, int p_preset) const {\n\n\tr_options->push_back(ImportOption(PropertyInfo(Variant::BOOL, \"loop\"), true));\n\tr_options->push_back(ImportOption(PropertyInfo(Variant::REAL, \"loop_offset\"), 0));\n}\n\nError ResourceImporterOGGVorbis::import(const String &p_source_file, const String &p_save_path, const Map<StringName, Variant> &p_options, List<String> *r_platform_variants, List<String> *r_gen_files) {\n\n\tbool loop = p_options[\"loop\"];\n\tfloat loop_offset = p_options[\"loop_offset\"];\n\n\tFileAccess *f = FileAccess::open(p_source_file, FileAccess::READ);\n\tif (!f) {\n\t\tERR_FAIL_COND_V(!f, ERR_CANT_OPEN);\n\t}\n\n\tsize_t len = f->get_len();\n\n\tPoolVector<uint8_t> data;\n\tdata.resize(len);\n\tPoolVector<uint8_t>::Write w = data.write();\n\n\tf->get_buffer(w.ptr(), len);\n\n\tmemdelete(f);\n\n\tRef<AudioStreamOGGVorbis> ogg_stream;\n\togg_stream.instance();\n\n\togg_stream->set_data(data);\n\togg_stream->set_loop(loop);\n\togg_stream->set_loop_offset(loop_offset);\n\n\treturn ResourceSaver::save(p_save_path + \".oggstr\", ogg_stream);\n}\n\nResourceImporterOGGVorbis::ResourceImporterOGGVorbis() {\n}\n<commit_msg>Fix silent failure of importing OGG Vorbis files<commit_after>\/*************************************************************************\/\n\/*  resource_importer_ogg_vorbis.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 \"resource_importer_ogg_vorbis.h\"\n\n#include \"io\/resource_saver.h\"\n#include \"os\/file_access.h\"\n#include \"scene\/resources\/texture.h\"\n\nString ResourceImporterOGGVorbis::get_importer_name() const {\n\n\treturn \"ogg_vorbis\";\n}\n\nString ResourceImporterOGGVorbis::get_visible_name() const {\n\n\treturn \"OGGVorbis\";\n}\nvoid ResourceImporterOGGVorbis::get_recognized_extensions(List<String> *p_extensions) const {\n\n\tp_extensions->push_back(\"ogg\");\n}\n\nString ResourceImporterOGGVorbis::get_save_extension() const {\n\treturn \"oggstr\";\n}\n\nString ResourceImporterOGGVorbis::get_resource_type() const {\n\n\treturn \"AudioStreamOGGVorbis\";\n}\n\nbool ResourceImporterOGGVorbis::get_option_visibility(const String &p_option, const Map<StringName, Variant> &p_options) const {\n\n\treturn true;\n}\n\nint ResourceImporterOGGVorbis::get_preset_count() const {\n\treturn 0;\n}\nString ResourceImporterOGGVorbis::get_preset_name(int p_idx) const {\n\n\treturn String();\n}\n\nvoid ResourceImporterOGGVorbis::get_import_options(List<ImportOption> *r_options, int p_preset) const {\n\n\tr_options->push_back(ImportOption(PropertyInfo(Variant::BOOL, \"loop\"), true));\n\tr_options->push_back(ImportOption(PropertyInfo(Variant::REAL, \"loop_offset\"), 0));\n}\n\nError ResourceImporterOGGVorbis::import(const String &p_source_file, const String &p_save_path, const Map<StringName, Variant> &p_options, List<String> *r_platform_variants, List<String> *r_gen_files) {\n\n\tbool loop = p_options[\"loop\"];\n\tfloat loop_offset = p_options[\"loop_offset\"];\n\n\tFileAccess *f = FileAccess::open(p_source_file, FileAccess::READ);\n\tif (!f) {\n\t\tERR_FAIL_COND_V(!f, ERR_CANT_OPEN);\n\t}\n\n\tsize_t len = f->get_len();\n\n\tPoolVector<uint8_t> data;\n\tdata.resize(len);\n\tPoolVector<uint8_t>::Write w = data.write();\n\n\tf->get_buffer(w.ptr(), len);\n\n\tmemdelete(f);\n\n\tRef<AudioStreamOGGVorbis> ogg_stream;\n\togg_stream.instance();\n\n\togg_stream->set_data(data);\n\tERR_FAIL_COND_V(!ogg_stream->get_data().size(), ERR_FILE_CORRUPT);\n\togg_stream->set_loop(loop);\n\togg_stream->set_loop_offset(loop_offset);\n\n\treturn ResourceSaver::save(p_save_path + \".oggstr\", ogg_stream);\n}\n\nResourceImporterOGGVorbis::ResourceImporterOGGVorbis() {\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <StringObserverImpl.h>\n\n\nvoid StringObserverImpl::update()\n{\n   char* cur_value = mSubject->getValue();\n\n   std::cout << \"Current string value is now '\" << cur_value << \"'\\n\";\n   delete cur_value;\n}\n<commit_msg>Use vprDEBUG instead of std::cout to print the current string value.<commit_after>#include <vpr\/Util\/Debug.h>\n#include <StringObserverImpl.h>\n\n\nvoid StringObserverImpl::update()\n{\n   char* cur_value = mSubject->getValue();\n\n   vprDEBUG(vprDBG_ALL, vprDBG_CRITICAL_LVL)\n      << \"Current string value is now '\" << cur_value << \"'\\n\"\n      << vprDEBUG_FLUSH;\n   delete cur_value;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2021-present 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 \"mutation_writer\/partition_based_splitting_writer.hh\"\n\n#include <seastar\/core\/coroutine.hh>\n\nnamespace mutation_writer {\n\nclass partition_based_splitting_mutation_writer {\n    struct bucket {\n        bucket_writer writer;\n        dht::decorated_key last_key;\n        size_t data_size = 0;\n    };\n\nprivate:\n    schema_ptr _schema;\n    reader_permit _permit;\n    reader_consumer _consumer;\n    unsigned _max_buckets;\n    std::vector<bucket> _buckets;\n    bucket* _current_bucket = nullptr;\n\n    future<> write_to_bucket(mutation_fragment&& mf) {\n        _current_bucket->data_size += mf.memory_usage();\n        return _current_bucket->writer.consume(std::move(mf));\n    }\n\n    future<bucket*> create_bucket_for(const dht::decorated_key& key) {\n        if (_buckets.size() < _max_buckets) {\n            co_return &_buckets.emplace_back(bucket{bucket_writer(_schema, _permit, _consumer), key});\n        }\n        auto it = std::max_element(_buckets.begin(), _buckets.end(), [] (const bucket& a, const bucket& b) {\n            return a.data_size < b.data_size;\n        });\n        it->writer.consume_end_of_stream();\n        co_await it->writer.close();\n        *it = bucket{bucket_writer(_schema, _permit, _consumer), key};\n        co_return &*it;\n    }\npublic:\n    partition_based_splitting_mutation_writer(schema_ptr schema, reader_permit permit, reader_consumer consumer, unsigned max_buckets)\n        : _schema(std::move(schema))\n        , _permit(std::move(permit))\n        , _consumer(std::move(consumer))\n        , _max_buckets(max_buckets)\n    {}\n\n    future<> consume(partition_start ps) {\n        if (_buckets.empty()) {\n            _current_bucket = co_await create_bucket_for(ps.key());\n        } else if (dht::ring_position_tri_compare(*_schema, _current_bucket->last_key, ps.key()) < 0) {\n            \/\/ No need to change bucket, just update the last key.\n            _current_bucket->last_key = ps.key();\n        } else {\n            \/\/ Find the first bucket where this partition doesn't cause\n            \/\/ monotonicity violations. Prefer the buckets towards the head of the list.\n            auto it = std::find_if(_buckets.begin(), _buckets.end(), [this, &ps] (const bucket& b) {\n                return dht::ring_position_tri_compare(*_schema, b.last_key, ps.key()) < 0;\n            });\n            if (it == _buckets.end()) {\n                _current_bucket = co_await create_bucket_for(ps.key());\n            } else {\n                _current_bucket = &*it;\n                _current_bucket->last_key = ps.key();\n            }\n        }\n        co_return co_await write_to_bucket(mutation_fragment(*_schema, _permit, std::move(ps)));\n    }\n\n    future<> consume(static_row&& sr) {\n        return write_to_bucket(mutation_fragment(*_schema, _permit, std::move(sr)));\n    }\n\n    future<> consume(clustering_row&& cr) {\n        return write_to_bucket(mutation_fragment(*_schema, _permit, std::move(cr)));\n    }\n\n    future<> consume(range_tombstone&& rt) {\n        return write_to_bucket(mutation_fragment(*_schema, _permit, std::move(rt)));\n    }\n\n    future<> consume(partition_end&& pe) {\n        return write_to_bucket(mutation_fragment(*_schema, _permit, std::move(pe)));\n    }\n\n    void consume_end_of_stream() {\n        for (auto& bucket : _buckets) {\n            bucket.writer.consume_end_of_stream();\n        }\n    }\n    void abort(std::exception_ptr ep) {\n        for (auto& bucket : _buckets) {\n            bucket.writer.abort(ep);\n        }\n    }\n    future<> close() noexcept {\n        return parallel_for_each(_buckets, [] (bucket& bucket) {\n            return bucket.writer.close();\n        });\n    }\n};\n\nfuture<> segregate_by_partition(flat_mutation_reader producer, unsigned max_buckets, reader_consumer consumer) {\n    auto schema = producer.schema();\n    auto permit = producer.permit();\n    return feed_writer(std::move(producer),\n            partition_based_splitting_mutation_writer(std::move(schema), std::move(permit), std::move(consumer), max_buckets));\n}\n\n} \/\/ namespace mutation_writer\n<commit_msg>mutation_writer: partition_based_splitting_writer: erase old bucket if we fail to create replacement<commit_after>\/*\n * Copyright (C) 2021-present 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 \"mutation_writer\/partition_based_splitting_writer.hh\"\n\n#include <seastar\/core\/coroutine.hh>\n\nnamespace mutation_writer {\n\nclass partition_based_splitting_mutation_writer {\n    struct bucket {\n        bucket_writer writer;\n        dht::decorated_key last_key;\n        size_t data_size = 0;\n    };\n\nprivate:\n    schema_ptr _schema;\n    reader_permit _permit;\n    reader_consumer _consumer;\n    unsigned _max_buckets;\n    std::vector<bucket> _buckets;\n    bucket* _current_bucket = nullptr;\n\n    future<> write_to_bucket(mutation_fragment&& mf) {\n        _current_bucket->data_size += mf.memory_usage();\n        return _current_bucket->writer.consume(std::move(mf));\n    }\n\n    future<bucket*> create_bucket_for(const dht::decorated_key& key) {\n        if (_buckets.size() < _max_buckets) {\n            co_return &_buckets.emplace_back(bucket{bucket_writer(_schema, _permit, _consumer), key});\n        }\n        auto it = std::max_element(_buckets.begin(), _buckets.end(), [] (const bucket& a, const bucket& b) {\n            return a.data_size < b.data_size;\n        });\n        it->writer.consume_end_of_stream();\n        co_await it->writer.close();\n        try {\n            *it = bucket{bucket_writer(_schema, _permit, _consumer), key};\n        } catch (...) {\n            _buckets.erase(it);\n            throw;\n        }\n        co_return &*it;\n    }\npublic:\n    partition_based_splitting_mutation_writer(schema_ptr schema, reader_permit permit, reader_consumer consumer, unsigned max_buckets)\n        : _schema(std::move(schema))\n        , _permit(std::move(permit))\n        , _consumer(std::move(consumer))\n        , _max_buckets(max_buckets)\n    {}\n\n    future<> consume(partition_start ps) {\n        if (_buckets.empty()) {\n            _current_bucket = co_await create_bucket_for(ps.key());\n        } else if (dht::ring_position_tri_compare(*_schema, _current_bucket->last_key, ps.key()) < 0) {\n            \/\/ No need to change bucket, just update the last key.\n            _current_bucket->last_key = ps.key();\n        } else {\n            \/\/ Find the first bucket where this partition doesn't cause\n            \/\/ monotonicity violations. Prefer the buckets towards the head of the list.\n            auto it = std::find_if(_buckets.begin(), _buckets.end(), [this, &ps] (const bucket& b) {\n                return dht::ring_position_tri_compare(*_schema, b.last_key, ps.key()) < 0;\n            });\n            if (it == _buckets.end()) {\n                _current_bucket = co_await create_bucket_for(ps.key());\n            } else {\n                _current_bucket = &*it;\n                _current_bucket->last_key = ps.key();\n            }\n        }\n        co_return co_await write_to_bucket(mutation_fragment(*_schema, _permit, std::move(ps)));\n    }\n\n    future<> consume(static_row&& sr) {\n        return write_to_bucket(mutation_fragment(*_schema, _permit, std::move(sr)));\n    }\n\n    future<> consume(clustering_row&& cr) {\n        return write_to_bucket(mutation_fragment(*_schema, _permit, std::move(cr)));\n    }\n\n    future<> consume(range_tombstone&& rt) {\n        return write_to_bucket(mutation_fragment(*_schema, _permit, std::move(rt)));\n    }\n\n    future<> consume(partition_end&& pe) {\n        return write_to_bucket(mutation_fragment(*_schema, _permit, std::move(pe)));\n    }\n\n    void consume_end_of_stream() {\n        for (auto& bucket : _buckets) {\n            bucket.writer.consume_end_of_stream();\n        }\n    }\n    void abort(std::exception_ptr ep) {\n        for (auto& bucket : _buckets) {\n            bucket.writer.abort(ep);\n        }\n    }\n    future<> close() noexcept {\n        return parallel_for_each(_buckets, [] (bucket& bucket) {\n            return bucket.writer.close();\n        });\n    }\n};\n\nfuture<> segregate_by_partition(flat_mutation_reader producer, unsigned max_buckets, reader_consumer consumer) {\n    auto schema = producer.schema();\n    auto permit = producer.permit();\n    return feed_writer(std::move(producer),\n            partition_based_splitting_mutation_writer(std::move(schema), std::move(permit), std::move(consumer), max_buckets));\n}\n\n} \/\/ namespace mutation_writer\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Ylikuutio - A 3D game and simulation engine.\n\/\/\n\/\/ Copyright (C) 2015-2019 Antti Nuortimo.\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 <https:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef PI\n#define PI 3.14159265359f\n#endif\n\n#ifndef GLM_FORCE_RADIANS\n#define GLM_FORCE_RADIANS\n#define DEGREES_TO_RADIANS(x) (x * PI \/ 180.0f)\n#endif\n\n#include \"bmp_heightmap_loader.hpp\"\n#include \"bmp_loader.hpp\"\n#include \"code\/ylikuutio\/geometry\/spherical_terrain_struct.hpp\"\n#include \"code\/ylikuutio\/triangulation\/triangulate_quads_struct.hpp\"\n#include \"code\/ylikuutio\/triangulation\/quad_triangulation.hpp\"\n#include \"code\/ylikuutio\/common\/pi.hpp\"\n\n\/\/ Include GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp> \/\/ glm\n#endif\n\n\/\/ Include standard headers\n#include <cmath>    \/\/ NAN, std::isnan, std::pow\n#include <cstddef>  \/\/ std::size_t\n#include <cstring>  \/\/ std::memcmp, std::strcmp, std::strlen, std::strncmp\n#include <iostream> \/\/ std::cout, std::cin, std::cerr\n#include <memory>   \/\/ std::make_shared, std::shared_ptr\n#include <string>   \/\/ std::string\n#include <vector>   \/\/ std::vector\n\nnamespace yli\n{\n    namespace load\n    {\n        bool load_BMP_terrain(\n                const std::string& filename,\n                std::vector<glm::vec3>& out_vertices,\n                std::vector<glm::vec2>& out_UVs,\n                std::vector<glm::vec3>& out_normals,\n                std::size_t& image_width,\n                std::size_t& image_height,\n                const std::string& color_channel,\n                const std::size_t x_step,\n                const std::size_t z_step,\n                const std::string& triangulation_type,\n                const bool should_ylikuutio_use_real_texture_coordinates)\n        {\n            if (x_step < 1)\n            {\n                std::cerr << \"ERROR: x_step is less than 1.\\n\";\n                return false;\n            }\n\n            if (z_step < 1)\n            {\n                std::cerr << \"ERROR: z_step is less than 1.\\n\";\n                return false;\n            }\n\n            std::size_t image_size;\n\n            std::shared_ptr<std::vector<uint8_t>> image_data = load_BMP_file(filename, image_width, image_height, image_size);\n\n            if (image_width < 2 || image_height < 2)\n            {\n                return false;\n            }\n\n            \/\/ Define terrain size.\n            const std::size_t terrain_size = image_width * image_height;\n\n            const std::size_t line_size_in_bytes = image_size \/ image_height;\n\n            std::vector<float> vertex_data;\n            vertex_data.reserve(terrain_size);\n\n            float* vertex_pointer = &vertex_data[0];\n\n            const char* char_color_channel = color_channel.c_str();\n\n            \/\/ start processing image_data.\n            for (std::size_t z = 0; z < image_height; z++)\n            {\n                const uint8_t* image_pointer = &(*image_data)[0] + z * line_size_in_bytes;\n\n                for (std::size_t x = 0; x < image_width; x++)\n                {\n                    std::size_t y;\n\n                    if (std::strcmp(char_color_channel, \"blue\") == 0)\n                    {\n                        y = static_cast<float>(*image_pointer);       \/\/ y-coordinate is the blue (B) value.\n                    }\n                    else if (std::strcmp(char_color_channel, \"green\") == 0)\n                    {\n                        y = static_cast<float>(*(image_pointer + 1)); \/\/ y-coordinate is the green (G) value.\n                    }\n                    else if (std::strcmp(char_color_channel, \"red\") == 0)\n                    {\n                        y = static_cast<float>(*(image_pointer + 2)); \/\/ y-coordinate is the red (R) value.\n                    }\n\n                    \/\/ y-coordinate is the mean of R, G, & B.\n                    else if ((std::strcmp(char_color_channel, \"mean\") == 0) || (std::strcmp(char_color_channel, \"all\") == 0))\n                    {\n                        y = (static_cast<float>(*image_pointer) + static_cast<float>(*(image_pointer + 1)) + static_cast<float>(*(image_pointer + 2))) \/ 3.0f;\n                    }\n                    else\n                    {\n                        std::cerr << \"ERROR: invalid color channel.\\n\";\n                        return false;\n                    }\n\n                    *vertex_pointer++ = y;\n                    image_pointer += 3; \/\/ R, G, & B.\n                }\n            }\n\n            std::cout << \"color channel in use: \" << color_channel << \"\\n\";\n\n            yli::triangulation::TriangulateQuadsStruct triangulate_quads_struct;\n            triangulate_quads_struct.image_width = image_width;\n            triangulate_quads_struct.image_height = image_height;\n            triangulate_quads_struct.x_step = x_step;\n            triangulate_quads_struct.z_step = z_step;\n            triangulate_quads_struct.triangulation_type = triangulation_type;\n            triangulate_quads_struct.should_ylikuutio_use_real_texture_coordinates = should_ylikuutio_use_real_texture_coordinates;\n\n            return yli::triangulation::triangulate_quads(&vertex_data[0], triangulate_quads_struct, out_vertices, out_UVs, out_normals);\n        }\n    }\n}\n<commit_msg>`yli::load::load_BMP_terrain`: cleaning up code.<commit_after>\/\/ Ylikuutio - A 3D game and simulation engine.\n\/\/\n\/\/ Copyright (C) 2015-2019 Antti Nuortimo.\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 <https:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef PI\n#define PI 3.14159265359f\n#endif\n\n#ifndef GLM_FORCE_RADIANS\n#define GLM_FORCE_RADIANS\n#define DEGREES_TO_RADIANS(x) (x * PI \/ 180.0f)\n#endif\n\n#include \"bmp_heightmap_loader.hpp\"\n#include \"bmp_loader.hpp\"\n#include \"code\/ylikuutio\/geometry\/spherical_terrain_struct.hpp\"\n#include \"code\/ylikuutio\/triangulation\/triangulate_quads_struct.hpp\"\n#include \"code\/ylikuutio\/triangulation\/quad_triangulation.hpp\"\n#include \"code\/ylikuutio\/common\/pi.hpp\"\n\n\/\/ Include GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp> \/\/ glm\n#endif\n\n\/\/ Include standard headers\n#include <cmath>    \/\/ NAN, std::isnan, std::pow\n#include <cstddef>  \/\/ std::size_t\n#include <iostream> \/\/ std::cout, std::cin, std::cerr\n#include <memory>   \/\/ std::make_shared, std::shared_ptr\n#include <string>   \/\/ std::string\n#include <vector>   \/\/ std::vector\n\nnamespace yli\n{\n    namespace load\n    {\n        bool load_BMP_terrain(\n                const std::string& filename,\n                std::vector<glm::vec3>& out_vertices,\n                std::vector<glm::vec2>& out_UVs,\n                std::vector<glm::vec3>& out_normals,\n                std::size_t& image_width,\n                std::size_t& image_height,\n                const std::string& color_channel,\n                const std::size_t x_step,\n                const std::size_t z_step,\n                const std::string& triangulation_type,\n                const bool should_ylikuutio_use_real_texture_coordinates)\n        {\n            if (x_step < 1)\n            {\n                std::cerr << \"ERROR: x_step is less than 1.\\n\";\n                return false;\n            }\n\n            if (z_step < 1)\n            {\n                std::cerr << \"ERROR: z_step is less than 1.\\n\";\n                return false;\n            }\n\n            std::size_t image_size;\n\n            std::shared_ptr<std::vector<uint8_t>> image_data = load_BMP_file(filename, image_width, image_height, image_size);\n\n            if (image_width < 2 || image_height < 2)\n            {\n                return false;\n            }\n\n            \/\/ Define terrain size.\n            const std::size_t terrain_size = image_width * image_height;\n\n            const std::size_t line_size_in_bytes = image_size \/ image_height;\n\n            std::vector<float> vertex_data;\n            vertex_data.reserve(terrain_size);\n\n            float* vertex_pointer = &vertex_data[0];\n\n            \/\/ start processing image_data.\n            for (std::size_t z = 0; z < image_height; z++)\n            {\n                const uint8_t* image_pointer = &(*image_data)[0] + z * line_size_in_bytes;\n\n                for (std::size_t x = 0; x < image_width; x++)\n                {\n                    std::size_t y;\n\n                    if (color_channel == \"blue\")\n                    {\n                        y = static_cast<float>(*image_pointer);       \/\/ y-coordinate is the blue (B) value.\n                    }\n                    else if (color_channel == \"green\")\n                    {\n                        y = static_cast<float>(*(image_pointer + 1)); \/\/ y-coordinate is the green (G) value.\n                    }\n                    else if (color_channel == \"red\")\n                    {\n                        y = static_cast<float>(*(image_pointer + 2)); \/\/ y-coordinate is the red (R) value.\n                    }\n\n                    \/\/ y-coordinate is the mean of R, G, & B.\n                    else if (color_channel == \"mean\" || color_channel == \"all\")\n                    {\n                        y = (static_cast<float>(*image_pointer) + static_cast<float>(*(image_pointer + 1)) + static_cast<float>(*(image_pointer + 2))) \/ 3.0f;\n                    }\n                    else\n                    {\n                        std::cerr << \"ERROR: invalid color channel.\\n\";\n                        return false;\n                    }\n\n                    *vertex_pointer++ = y;\n                    image_pointer += 3; \/\/ R, G, & B.\n                }\n            }\n\n            std::cout << \"color channel in use: \" << color_channel << \"\\n\";\n\n            yli::triangulation::TriangulateQuadsStruct triangulate_quads_struct;\n            triangulate_quads_struct.image_width = image_width;\n            triangulate_quads_struct.image_height = image_height;\n            triangulate_quads_struct.x_step = x_step;\n            triangulate_quads_struct.z_step = z_step;\n            triangulate_quads_struct.triangulation_type = triangulation_type;\n            triangulate_quads_struct.should_ylikuutio_use_real_texture_coordinates = should_ylikuutio_use_real_texture_coordinates;\n\n            return yli::triangulation::triangulate_quads(&vertex_data[0], triangulate_quads_struct, out_vertices, out_UVs, out_normals);\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\r\n#include <WinSock2.h>\r\n#include <thread>\r\n#include <future>\r\n#include <iostream>\r\n\r\nnamespace common {\r\n\r\nclass Copyable {\r\nprotected:\r\n  Copyable() noexcept = default;\r\n  ~Copyable() noexcept = default;\r\n  Copyable(const Copyable&) noexcept = default;\r\n  Copyable(Copyable&&) noexcept = default;\r\n  Copyable& operator=(const Copyable&) noexcept = default;\r\n  Copyable& operator=(Copyable&&) noexcept = default;\r\n};\r\n\r\nclass UnCopyable {\r\n  UnCopyable(const UnCopyable&) noexcept = delete;\r\n  UnCopyable(UnCopyable&&) noexcept = delete;\r\n  UnCopyable& operator=(const UnCopyable&) noexcept = delete;\r\n  UnCopyable& operator=(UnCopyable&&) noexcept = delete;\r\nprotected:\r\n  UnCopyable() noexcept = default;\r\n  ~UnCopyable() noexcept = default;\r\n};\r\n\r\ntemplate <typename T> class Singleton : private UnCopyable {\r\npublic:\r\n  static T& get_instance() noexcept {\r\n    static T _ins;\r\n    return _ins;\r\n  }\r\n};\r\n\r\nclass WSGuarder final : private UnCopyable {\r\npublic:\r\n  WSGuarder() noexcept;\r\n  ~WSGuarder() noexcept;\r\n};\r\n\r\nclass UniqueSocket final : private UnCopyable {\r\n  SOCKET sockfd_{};\r\npublic:\r\n  UniqueSocket(SOCKET fd) noexcept : sockfd_(fd) {}\r\n  ~UniqueSocket() noexcept;\r\n\r\n  inline operator SOCKET() const { return sockfd_; }\r\n  inline operator bool() const { return sockfd_ != INVALID_SOCKET; }\r\n};\r\n\r\ntemplate <typename Fn, typename... Args>\r\ninline auto async(Fn&& fn, Args&&... args) {\r\n  return std::async(std::launch::async, std::forward<Fn>(fn), std::forward<Args>(args)...);\r\n}\r\n\r\n}<commit_msg>:construction: chore(thread-pool): add an easy thread-pool<commit_after>#pragma once\r\n\r\n#include <WinSock2.h>\r\n#include <deque>\r\n#include <functional>\r\n#include <memory>\r\n#include <thread>\r\n#include <future>\r\n#include <condition_variable>\r\n#include <iostream>\r\n\r\nnamespace common {\r\n\r\nclass Copyable {\r\nprotected:\r\n  Copyable() noexcept = default;\r\n  ~Copyable() noexcept = default;\r\n  Copyable(const Copyable&) noexcept = default;\r\n  Copyable(Copyable&&) noexcept = default;\r\n  Copyable& operator=(const Copyable&) noexcept = default;\r\n  Copyable& operator=(Copyable&&) noexcept = default;\r\n};\r\n\r\nclass UnCopyable {\r\n  UnCopyable(const UnCopyable&) noexcept = delete;\r\n  UnCopyable(UnCopyable&&) noexcept = delete;\r\n  UnCopyable& operator=(const UnCopyable&) noexcept = delete;\r\n  UnCopyable& operator=(UnCopyable&&) noexcept = delete;\r\nprotected:\r\n  UnCopyable() noexcept = default;\r\n  ~UnCopyable() noexcept = default;\r\n};\r\n\r\ntemplate <typename T> class Singleton : private UnCopyable {\r\npublic:\r\n  static T& get_instance() noexcept {\r\n    static T _ins;\r\n    return _ins;\r\n  }\r\n};\r\n\r\nclass WSGuarder final : private UnCopyable {\r\npublic:\r\n  WSGuarder() noexcept;\r\n  ~WSGuarder() noexcept;\r\n};\r\n\r\nclass UniqueSocket final : private UnCopyable {\r\n  SOCKET sockfd_{};\r\npublic:\r\n  UniqueSocket(SOCKET fd) noexcept : sockfd_(fd) {}\r\n  ~UniqueSocket() noexcept;\r\n\r\n  inline operator SOCKET() const { return sockfd_; }\r\n  inline operator bool() const { return sockfd_ != INVALID_SOCKET; }\r\n};\r\n\r\ntemplate <typename Fn, typename... Args>\r\ninline auto async(Fn&& fn, Args&&... args) {\r\n  return std::async(std::launch::async, std::forward<Fn>(fn), std::forward<Args>(args)...);\r\n}\r\n\r\nclass ThreadPool final : private UnCopyable {\r\n  using TaskEntity = std::function<void ()>;\r\n  using ThreadEntity = std::unique_ptr<std::thread>;\r\n\r\n  bool running_{true};\r\n  mutable std::mutex mtx_;\r\n  std::condition_variable non_empty_;\r\n  std::vector<ThreadEntity> threads_;\r\n  std::deque<TaskEntity> tasks_;\r\n\r\n  TaskEntity fetch_task() {\r\n    std::unique_lock<std::mutex> guard(mtx_);\r\n    while (tasks_.empty() && running_)\r\n      non_empty_.wait(guard);\r\n\r\n    TaskEntity t;\r\n    if (!tasks_.empty()) {\r\n      t = tasks_.front();\r\n      tasks_.pop_front();\r\n    }\r\n    return t;\r\n  }\r\npublic:\r\n  ThreadPool(int thread_num = 4) noexcept {\r\n    threads_.reserve(thread_num);\r\n    for (int i = 0; i < thread_num; ++i)\r\n      threads_.emplace_back(new std::thread([this] {\r\n          while (running_) {\r\n            auto t = fetch_task();\r\n            if (t)\r\n              t();\r\n          }\r\n        }));\r\n  }\r\n\r\n  ~ThreadPool() noexcept {\r\n    if (running_) {\r\n      {\r\n        std::unique_lock<std::mutex> guard(mtx_);\r\n        running_ = false;\r\n        non_empty_.notify_all();\r\n      }\r\n\r\n      for (auto& t : threads_)\r\n        t->join();\r\n    }\r\n  }\r\n\r\n  template <typename Fn, typename... Args>\r\n  void run_task(Fn&& fn, Args&&... args) {\r\n    if (threads_.empty()) {\r\n      fn(std::forward<Args>(args)...);\r\n    }\r\n    else {\r\n      using ReturnType = typename std::result_of<Fn (Args&&...)>::type;\r\n      auto task = std::make_shared<std::packaged_task<ReturnType ()>>(\r\n        std::bind(std::forward<Fn>(fn), std::forward<Args>(args)...));\r\n\r\n      {\r\n        std::unique_lock<std::mutex> guard(mtx_);\r\n        tasks_.emplace_back([task] { (*task)(); });\r\n      }\r\n      non_empty_.notify_one();\r\n    }\r\n  }\r\n};\r\n\r\n}<|endoftext|>"}
{"text":"<commit_before>#include \"schedulers\/wojtek_throttle_scheduler.h\"\n\n#include <chrono>\n#include <cstdio>\n#include <cmath>\n\n#include \"gflags\/gflags.h\"\n#include \"utils\/stopwatch.h\"\n\nDEFINE_bool(log_schedule, true, \"\");\n\nnamespace {\n  template <typename T> int sgn(T val) {\n    return (T(0) < val) - (val < T(0));\n  }\n}\n\nnamespace schedulers {\n\nusing game::CarState;\n\nconst vector<int> WojtekThrottleScheduler::DEFAULT_GROUPS {1,1,4,2,2,4,1,8,8,4,4,2};\nconst vector<int> WojtekThrottleScheduler::QUICK_GROUPS {1,1,2,2,2,4};\n\nconst vector<double> WojtekThrottleScheduler::values{0.0, 1.0}; \/\/ Values must be increasing\n\nWojtekThrottleScheduler::WojtekThrottleScheduler(const game::Race& race,\n    game::CarTracker& car_tracker, int time_limit, const vector<int>& groups)\n  : race_(race), car_tracker_(car_tracker), \n    groups_(groups),\n    horizon_(std::accumulate(groups.begin(), groups.end(), 0)),\n    best_schedule_(&car_tracker, horizon_),\n    branch_and_bound_(&car_tracker, horizon_, groups_, values), log_file_(\"wojtek_data_log.csv\", std::ofstream::out), time_limit_(time_limit)\n{\n   \/\/Watchout: executing two WojtekThrottleSchedulers in pararell could be risky becase of log file (TODO)\n   log_file_ << \"tick,\" << \"x,\" << \"turbo,\" << \"switch,\" << \"a,\" << \"v,\" << \"dir,\" << \"rad,\" << \"piece_no,\" << \"start_lane,\" << \"end_land,\" << \"schedule_time,\" << \"initial_schedule_safe,\" << \"nodes_visited,\" << \"leafs_visited,\" << \"unsafe_cuts,\" << \"ub_cuts,\" << \"solution_improvements,\" << \"schedule,\" << \"predicted_angles,\" << \"0_throttle_predictions\" << std::endl;\n}\n\nWojtekThrottleScheduler::~WojtekThrottleScheduler() {\n    log_file_.close();\n}\n\nvoid WojtekThrottleScheduler::Schedule(const game::CarState& state, int game_tick) {\n  utils::StopWatch stopwatch;\n\n  \/\/ We want to use the last best_schedule_ if possible. Generally always \n  \/\/ tick_diff should always be 1, but I take extra care if \n  \/\/ (for some unknown reason) this is not the case\n  int tick_diff = game_tick - last_game_tick_;\n  if (1 <= tick_diff && tick_diff <= 4) {\n    for (int i = 0; i < tick_diff; ++i)\n      best_schedule_.ShiftLeftFillSafe(state);\n  } else {\n    \/\/ We will still try to use the old schedule, but, it could be not safe.\n    \/\/ This will be checked subsequently\n  }\n  \/\/ Must do it, because we could have unpredicted turbo\/switches, etc. ahead\n  best_schedule_.UpdateDistance(state); \n\n  \/\/ Initial schedule should be safe normally. Not safe only if future predictions\n  \/\/ have changed\n  initial_schedule_safe_ = best_schedule_.IsSafe(state);\n  if (!initial_schedule_safe_) {\n    best_schedule_.Reset(state);\n  }\n\n  branch_and_bound_.Improve(state, best_schedule_);\n  local_improver_.Improve(state, best_schedule_, 0.1);\n\n  \/\/ Once again, just to be 200% sure check for safety\n  if (!best_schedule_.IsSafe(state)) {\n    \/\/ This should never happen\n    std::cerr << \"Schedule is not safe. This should not happen\" << std::endl;\n    best_schedule_.Reset(state);\n  }\n\n  last_game_tick_ = game_tick;\n  last_schedule_time_ = stopwatch.elapsed();\n  Log(state);\n}\n\n\nvoid WojtekThrottleScheduler::PrintSchedule(const game::CarState& state, const Sched& schedule, int len) {\n  for (int i=0; i<len; ++i)\n    printf(\"%.2f \", schedule[i]);\n  printf(\"\\n\");\n\n  CarState next = state;\n  for (int i=0; i<len; ++i) {\n    next = car_tracker_.Predict(next, game::Command(schedule[i]));\n    printf(\"%.1f \", next.position().angle());\n  }\n  printf(\"\\n\");\n}\n\nvoid WojtekThrottleScheduler::Log(const game::CarState& state) {\n  if (FLAGS_log_schedule) {\n    PrintSchedule(state, best_schedule_, std::min(horizon_, 20));\n  }\n\n  game::Piece piece = race_.track().pieces()[state.position().piece()];\n  log_file_ << last_game_tick_\n            << ',' << throttle()\n            << ',' << state.turbo_state().is_on() \n            << ',' << (int)state.switch_state() \n            << ',' << state.position().angle() \n            << ',' << state.velocity()\n            << ',' << -sgn(piece.angle())\n            << ',' << piece.radius() \n            << ',' << state.position().piece()\n            << ',' << state.position().start_lane()\n            << ',' << state.position().end_lane()\n            << ',' << last_schedule_time_\n            << ',' << initial_schedule_safe_\n            << ',' << branch_and_bound_.stats().nodes_visited\n            << ',' << branch_and_bound_.stats().leafs_visited\n            << ',' << branch_and_bound_.stats().unsafe_cuts\n            << ',' << branch_and_bound_.stats().ub_cuts\n            << ',' << branch_and_bound_.stats().solution_improvements\n            << ',';\n  for (int i = 0; i < best_schedule_.size(); ++i)\n    log_file_ << std::setprecision (2) << best_schedule_[i] << \" \";\n  log_file_ << ',';\n  CarState next = state;\n  for (int i = 0; i < best_schedule_.size(); ++i) {\n    next = car_tracker_.Predict(next, game::Command(best_schedule_[i]));\n    log_file_ << std::setprecision(2) << next.position().angle() << ' ';\n  }\n  log_file_ << ',';\n  next = state;\n  for (int i = 0; i < best_schedule_.size(); ++i) {\n    next = car_tracker_.Predict(next, game::Command(0));\n    log_file_ << std::setprecision(2) << next.position().angle() << ' ';\n  }\n  log_file_ << std::endl;\n  log_file_.flush();\n}\n\n}  \/\/ namespace schedulers\n<commit_msg>Added a quick version of groups with a short horizon. It makes WojtekThrottleScheduler blazingly fast at making decisions, while making it 0.16s slower on an average lap. Could be used for different purposes (like emergency or safety checking in extream situations).<commit_after>#include \"schedulers\/wojtek_throttle_scheduler.h\"\n\n#include <chrono>\n#include <cstdio>\n#include <cmath>\n\n#include \"gflags\/gflags.h\"\n#include \"utils\/stopwatch.h\"\n\nDEFINE_bool(log_schedule, true, \"\");\n\nnamespace {\n  template <typename T> int sgn(T val) {\n    return (T(0) < val) - (val < T(0));\n  }\n}\n\nnamespace schedulers {\n\nusing game::CarState;\n\nconst vector<int> WojtekThrottleScheduler::DEFAULT_GROUPS {1,1,4,2,2,4,1,8,8,4,4,2};\nconst vector<int> WojtekThrottleScheduler::QUICK_GROUPS {1,2,4,4,2};\n\nconst vector<double> WojtekThrottleScheduler::values{0.0, 1.0}; \/\/ Values must be increasing\n\nWojtekThrottleScheduler::WojtekThrottleScheduler(const game::Race& race,\n    game::CarTracker& car_tracker, int time_limit, const vector<int>& groups)\n  : race_(race), car_tracker_(car_tracker), \n    groups_(groups),\n    horizon_(std::accumulate(groups.begin(), groups.end(), 0)),\n    best_schedule_(&car_tracker, horizon_),\n    branch_and_bound_(&car_tracker, horizon_, groups_, values), log_file_(\"wojtek_data_log.csv\", std::ofstream::out), time_limit_(time_limit)\n{\n   \/\/Watchout: executing two WojtekThrottleSchedulers in pararell could be risky becase of log file (TODO)\n   log_file_ << \"tick,\" << \"x,\" << \"turbo,\" << \"switch,\" << \"a,\" << \"v,\" << \"dir,\" << \"rad,\" << \"piece_no,\" << \"start_lane,\" << \"end_land,\" << \"schedule_time,\" << \"initial_schedule_safe,\" << \"nodes_visited,\" << \"leafs_visited,\" << \"unsafe_cuts,\" << \"ub_cuts,\" << \"solution_improvements,\" << \"schedule,\" << \"predicted_angles,\" << \"0_throttle_predictions\" << std::endl;\n}\n\nWojtekThrottleScheduler::~WojtekThrottleScheduler() {\n    log_file_.close();\n}\n\nvoid WojtekThrottleScheduler::Schedule(const game::CarState& state, int game_tick) {\n  utils::StopWatch stopwatch;\n\n  \/\/ We want to use the last best_schedule_ if possible. Generally always \n  \/\/ tick_diff should always be 1, but I take extra care if \n  \/\/ (for some unknown reason) this is not the case\n  int tick_diff = game_tick - last_game_tick_;\n  if (1 <= tick_diff && tick_diff <= 4) {\n    for (int i = 0; i < tick_diff; ++i)\n      best_schedule_.ShiftLeftFillSafe(state);\n  } else {\n    \/\/ We will still try to use the old schedule, but, it could be not safe.\n    \/\/ This will be checked subsequently\n  }\n  \/\/ Must do it, because we could have unpredicted turbo\/switches, etc. ahead\n  best_schedule_.UpdateDistance(state); \n\n  \/\/ Initial schedule should be safe normally. Not safe only if future predictions\n  \/\/ have changed\n  initial_schedule_safe_ = best_schedule_.IsSafe(state);\n  if (!initial_schedule_safe_) {\n    best_schedule_.Reset(state);\n  }\n\n  branch_and_bound_.Improve(state, best_schedule_);\n  local_improver_.Improve(state, best_schedule_, 0.1);\n\n  \/\/ Once again, just to be 200% sure check for safety\n  if (!best_schedule_.IsSafe(state)) {\n    \/\/ This should never happen\n    std::cerr << \"Schedule is not safe. This should not happen\" << std::endl;\n    best_schedule_.Reset(state);\n  }\n\n  last_game_tick_ = game_tick;\n  last_schedule_time_ = stopwatch.elapsed();\n  Log(state);\n}\n\n\nvoid WojtekThrottleScheduler::PrintSchedule(const game::CarState& state, const Sched& schedule, int len) {\n  for (int i=0; i<len; ++i)\n    printf(\"%.2f \", schedule[i]);\n  printf(\"\\n\");\n\n  CarState next = state;\n  for (int i=0; i<len; ++i) {\n    next = car_tracker_.Predict(next, game::Command(schedule[i]));\n    printf(\"%.1f \", next.position().angle());\n  }\n  printf(\"\\n\");\n}\n\nvoid WojtekThrottleScheduler::Log(const game::CarState& state) {\n  if (FLAGS_log_schedule) {\n    PrintSchedule(state, best_schedule_, std::min(horizon_, 20));\n  }\n\n  game::Piece piece = race_.track().pieces()[state.position().piece()];\n  log_file_ << last_game_tick_\n            << ',' << throttle()\n            << ',' << state.turbo_state().is_on() \n            << ',' << (int)state.switch_state() \n            << ',' << state.position().angle() \n            << ',' << state.velocity()\n            << ',' << -sgn(piece.angle())\n            << ',' << piece.radius() \n            << ',' << state.position().piece()\n            << ',' << state.position().start_lane()\n            << ',' << state.position().end_lane()\n            << ',' << last_schedule_time_\n            << ',' << initial_schedule_safe_\n            << ',' << branch_and_bound_.stats().nodes_visited\n            << ',' << branch_and_bound_.stats().leafs_visited\n            << ',' << branch_and_bound_.stats().unsafe_cuts\n            << ',' << branch_and_bound_.stats().ub_cuts\n            << ',' << branch_and_bound_.stats().solution_improvements\n            << ',';\n  for (int i = 0; i < best_schedule_.size(); ++i)\n    log_file_ << std::setprecision (2) << best_schedule_[i] << \" \";\n  log_file_ << ',';\n  CarState next = state;\n  for (int i = 0; i < best_schedule_.size(); ++i) {\n    next = car_tracker_.Predict(next, game::Command(best_schedule_[i]));\n    log_file_ << std::setprecision(2) << next.position().angle() << ' ';\n  }\n  log_file_ << ',';\n  next = state;\n  for (int i = 0; i < best_schedule_.size(); ++i) {\n    next = car_tracker_.Predict(next, game::Command(0));\n    log_file_ << std::setprecision(2) << next.position().angle() << ' ';\n  }\n  log_file_ << std::endl;\n  log_file_.flush();\n}\n\n}  \/\/ namespace schedulers\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: servicefactory.hxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 09:20:52 $\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 _CPPUHELPER_SERVICEFACTORY_HXX_\n#define _CPPUHELPER_SERVICEFACTORY_HXX_\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XMultiComponentFactory.hpp>\n\n\nnamespace cppu\n{\n\n\/** Deprecated.  Use cppuhelper\/bootstrap.hxx functions instead.\n\n    This bootstraps an initial service factory working on a registry. If the first or both\n    parameters contain a value then the service factory is initialized with a simple registry\n    or a nested registry. Otherwise the service factory must be initialized later with a valid\n    registry.\n\n    @param rWriteRegistryFile\n    file name of the simple registry or the first registry file of\n    the nested registry which will be opened with read\/write rights. This\n    file will be created if necessary.\n    @param rReadRegistryFile\n    file name of the second registry file of the nested registry\n    which will be opened with readonly rights.\n    @param bReadOnly\n    flag which specify that the first registry file will be opened with\n    readonly rights. Default is FALSE. If this flag is used the registry\n    will not be created if not exist.\n    @param rBootstrapPath\n    specifies a path where the bootstrap components could be find. If this\n    parameter is an empty string the compoents will be searched in the system\n    path.\n    @deprecated\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > SAL_CALL\ncreateRegistryServiceFactory(\n    const ::rtl::OUString & rWriteRegistryFile,\n    const ::rtl::OUString & rReadRegistryFile,\n    sal_Bool bReadOnly = sal_False,\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( (::com::sun::star::uno::Exception) );\n\n\n\/** Deprecated.  Use cppuhelper\/bootstrap.hxx functions instead.\n\n    This bootstraps an initial service factory working on a registry file.\n\n    @param rRegistryFile\n    file name of the registry to use\/ create; if this is an empty\n    string, the default registry is used instead\n    @param bReadOnly\n    flag which specify that the registry file will be opened with\n    readonly rights. Default is FALSE. If this flag is used the registry\n    will not be created if not exist.\n    @param rBootstrapPath\n    specifies a path where the bootstrap components could be find. If this\n    parameter is an empty string the compoents will be searched in the system\n    path.\n    @deprecated\n*\/\ninline ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > SAL_CALL\ncreateRegistryServiceFactory(\n    const ::rtl::OUString & rRegistryFile,\n    sal_Bool bReadOnly = sal_False,\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( (::com::sun::star::uno::Exception) )\n{\n    return ::cppu::createRegistryServiceFactory(\n        rRegistryFile, ::rtl::OUString(), bReadOnly, rBootstrapPath );\n}\n\n\/** Deprecated.  Use cppuhelper\/bootstrap.hxx functions instead.\n\n    This bootstraps a service factory without initialize a registry.\n\n    @param rBootstrapPath\n    specifies a path where the bootstrap components could be find. If this\n    parameter is an empty string the compoents will be searched in the system\n    path.\n    @deprecated\n*\/\ninline ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > SAL_CALL\ncreateServiceFactory(\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( (::com::sun::star::uno::Exception) )\n{\n    return ::cppu::createRegistryServiceFactory(\n        ::rtl::OUString(), ::rtl::OUString(), sal_False, rBootstrapPath );\n}\n\n} \/\/ end namespace cppu\n\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.140); FILE MERGED 2008\/04\/01 15:10:53 thb 1.8.140.2: #i85898# Stripping all external header guards 2008\/03\/28 15:25:21 rt 1.8.140.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: servicefactory.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 _CPPUHELPER_SERVICEFACTORY_HXX_\n#define _CPPUHELPER_SERVICEFACTORY_HXX_\n\n#include <rtl\/ustring.hxx>\n\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XMultiComponentFactory.hpp>\n\n\nnamespace cppu\n{\n\n\/** Deprecated.  Use cppuhelper\/bootstrap.hxx functions instead.\n\n    This bootstraps an initial service factory working on a registry. If the first or both\n    parameters contain a value then the service factory is initialized with a simple registry\n    or a nested registry. Otherwise the service factory must be initialized later with a valid\n    registry.\n\n    @param rWriteRegistryFile\n    file name of the simple registry or the first registry file of\n    the nested registry which will be opened with read\/write rights. This\n    file will be created if necessary.\n    @param rReadRegistryFile\n    file name of the second registry file of the nested registry\n    which will be opened with readonly rights.\n    @param bReadOnly\n    flag which specify that the first registry file will be opened with\n    readonly rights. Default is FALSE. If this flag is used the registry\n    will not be created if not exist.\n    @param rBootstrapPath\n    specifies a path where the bootstrap components could be find. If this\n    parameter is an empty string the compoents will be searched in the system\n    path.\n    @deprecated\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > SAL_CALL\ncreateRegistryServiceFactory(\n    const ::rtl::OUString & rWriteRegistryFile,\n    const ::rtl::OUString & rReadRegistryFile,\n    sal_Bool bReadOnly = sal_False,\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( (::com::sun::star::uno::Exception) );\n\n\n\/** Deprecated.  Use cppuhelper\/bootstrap.hxx functions instead.\n\n    This bootstraps an initial service factory working on a registry file.\n\n    @param rRegistryFile\n    file name of the registry to use\/ create; if this is an empty\n    string, the default registry is used instead\n    @param bReadOnly\n    flag which specify that the registry file will be opened with\n    readonly rights. Default is FALSE. If this flag is used the registry\n    will not be created if not exist.\n    @param rBootstrapPath\n    specifies a path where the bootstrap components could be find. If this\n    parameter is an empty string the compoents will be searched in the system\n    path.\n    @deprecated\n*\/\ninline ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > SAL_CALL\ncreateRegistryServiceFactory(\n    const ::rtl::OUString & rRegistryFile,\n    sal_Bool bReadOnly = sal_False,\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( (::com::sun::star::uno::Exception) )\n{\n    return ::cppu::createRegistryServiceFactory(\n        rRegistryFile, ::rtl::OUString(), bReadOnly, rBootstrapPath );\n}\n\n\/** Deprecated.  Use cppuhelper\/bootstrap.hxx functions instead.\n\n    This bootstraps a service factory without initialize a registry.\n\n    @param rBootstrapPath\n    specifies a path where the bootstrap components could be find. If this\n    parameter is an empty string the compoents will be searched in the system\n    path.\n    @deprecated\n*\/\ninline ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > SAL_CALL\ncreateServiceFactory(\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( (::com::sun::star::uno::Exception) )\n{\n    return ::cppu::createRegistryServiceFactory(\n        ::rtl::OUString(), ::rtl::OUString(), sal_False, rBootstrapPath );\n}\n\n} \/\/ end namespace cppu\n\n#endif\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 <vespa\/vespalib\/hwaccelrated\/iaccelrated.h>\n#include <vespa\/vespalib\/stllike\/string.h>\n#include <vespa\/vespalib\/stllike\/hash_map.h>\n#include <iostream>\n#include <vector>\n#include <thread>\n\nusing namespace vespalib;\nusing vespalib::hwaccelrated::IAccelrated;\n\nclass Benchmark {\npublic:\n    virtual ~Benchmark() { }\n    virtual void compute(size_t docId) const = 0;\n};\n\nvoid\nrunThread(size_t count, size_t docs, const Benchmark & benchmark, size_t stride)\n{\n    for (size_t i(0); i < count; i++) {\n        for (size_t docId(0); docId < docs; docId++) {\n            benchmark.compute((docId*stride)%docs);\n        }\n    }\n}\n\nvoid\nrunBenchmark(size_t numThreads, size_t count, size_t docs, const Benchmark & benchmark, size_t stride) {\n    std::vector<std::thread> threads;\n    threads.reserve(numThreads);\n    for (size_t i(0); i < numThreads; i++) {\n        threads.emplace_back(runThread, count, docs, benchmark, stride);\n    }\n    for (auto & thread : threads) {\n        thread.join();\n    }\n}\n\ntemplate <typename T>\nclass FullBenchmark : public Benchmark\n{\npublic:\n    FullBenchmark(size_t numDocs, size_t numValue);\n    ~FullBenchmark();\n    void compute(size_t docId) const override {\n        _dp->dotProduct(&_query[0], &_values[docId * _query.size()], _query.size());\n    }\nprivate:\n    std::vector<T> _values;\n    std::vector<T> _query;\n    IAccelrated::UP _dp;\n};\n\ntemplate <typename T>\nFullBenchmark<T>::FullBenchmark(size_t numDocs, size_t numValues)\n    : _values(numDocs*numValues),\n      _query(numValues),\n      _dp(IAccelrated::getAccelrator())\n{\n    for (size_t i(0); i < numDocs; i++) {\n        for (size_t j(0); j < numValues; j++) {\n            _values[i*numValues + j] = j;\n        }\n    }\n    for (size_t j(0); j < numValues; j++) {\n        _query[j] = j;\n    }\n}\n\ntemplate <typename T>\nFullBenchmark<T>::~FullBenchmark() = default;\n\nclass SparseBenchmark : public Benchmark\n{\npublic:\n    SparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues);\n    ~SparseBenchmark();\nprotected:\n    struct P {\n        P(uint32_t key=0, int32_t value=0) :\n            _key(key),\n            _value(value)\n        { }\n        uint32_t _key;\n        int32_t  _value;\n    };\n    size_t _numValues;\n    std::vector<P> _values;\n};\n\nSparseBenchmark::SparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues)\n    : _numValues(numValues),\n      _values(numDocs*numValues)\n{\n    for (size_t i(0); i < numDocs; i++) {\n        for (size_t j(0); j < numValues; j++) {\n            size_t k(numValues < numQueryValues ?  (j*numQueryValues)\/numValues : j);\n            _values[i*numValues + j] = P(k, k);\n        }\n    }\n}\nSparseBenchmark::~SparseBenchmark() = default;\n\nclass UnorderedSparseBenchmark : public SparseBenchmark\n{\nprivate:\n    typedef hash_map<uint32_t, int32_t> map;\npublic:\n    UnorderedSparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues);\n    ~UnorderedSparseBenchmark();\nprivate:\n    void compute(size_t docId) const override {\n        int64_t sum(0);\n        size_t offset(docId*_numValues);\n        const auto e(_query.end());\n        for (size_t i(0); i < _numValues; i++) {\n            auto it = _query.find(_values[offset + i]._key);\n            if (it != e) {\n                sum += static_cast<int64_t>(_values[offset + i]._value) * it->second;\n            }\n        }\n    }\n    map _query;\n};\n\nUnorderedSparseBenchmark::UnorderedSparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues)\n    : SparseBenchmark(numDocs, numValues, numQueryValues)\n{\n    for (size_t j(0); j < numQueryValues; j++) {\n        _query[j] = j;\n    }\n}\nUnorderedSparseBenchmark::~UnorderedSparseBenchmark() = default;\n\nclass OrderedSparseBenchmark : public SparseBenchmark\n{\nprivate:\npublic:\n    OrderedSparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues);\n    ~OrderedSparseBenchmark();\nprivate:\n    void compute(size_t docId) const override {\n        int64_t sum(0);\n        size_t offset(docId*_numValues);\n\n        for (size_t a(0), b(0); a < _query.size() && b < _numValues; b++) {\n            for (; a < _query.size() && (_query[a]._key <= _values[offset + b]._key); a++);\n            if (_query[a]._key == _values[offset + b]._key) {\n                sum += static_cast<int64_t>(_values[offset + b]._value) * _query[a]._value;\n            }\n        }\n    }\n    std::vector<P> _query;\n};\n\nOrderedSparseBenchmark::OrderedSparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues)\n    : SparseBenchmark(numDocs, numValues, numQueryValues),\n      _query(numQueryValues)\n{\n    for (size_t j(0); j < numQueryValues; j++) {\n        size_t k(numValues > numQueryValues ?  j*numValues\/numQueryValues : j);\n        _query[j] = P(k, k);\n    }\n}\nOrderedSparseBenchmark::~OrderedSparseBenchmark() = default;\n\nint main(int argc, char *argv[])\n{\n    size_t numDocs(1);\n    size_t numValues(1000);\n    size_t numQueries(1000000);\n    size_t stride(1);\n    string type(\"full\");\n    if ( argc > 1) {\n        type = argv[1];\n    }\n    if ( argc > 2) {\n        numQueries = strtoul(argv[2], nullptr, 0);\n    }\n    if ( argc > 3) {\n        numDocs = strtoul(argv[3], nullptr, 0);\n    }\n    if ( argc > 4) {\n        numValues = strtoul(argv[4], nullptr, 0);\n    }\n    if (argc > 5) {\n        stride = strtoul(argv[5], nullptr, 0);\n    }\n    size_t numQueryValues = ( argc > 6) : numQueryValues = strtoul(argv[6], nullptr, 0) : numValues;\n    std::cout << \"type = \" << type << std::endl;\n    std::cout << \"numQueries = \" << numQueries << std::endl;\n    std::cout << \"numDocs = \" << numDocs << std::endl;\n    std::cout << \"numValues = \" << numValues << std::endl;\n    std::cout << \"numQueryValues = \" << numQueryValues << std::endl;\n    std::cout << \"stride =\" << stride << std::endl;\n    if (type == \"full\") {\n        FullBenchmark<int32_t> bm(numDocs, numValues);\n        runBenchmark(numQueries, numDocs, bm, stride);\n    } else if (type == \"sparse-ordered\") {\n        OrderedSparseBenchmark bm(numDocs, numValues, numQueryValues);\n        runBenchmark(numQueries, numDocs, bm, stride);\n    } else if (type == \"sparse-unordered\") {\n        UnorderedSparseBenchmark bm(numDocs, numValues, numQueryValues);\n        runBenchmark(numQueries, numDocs, bm, stride);\n    } else {\n        std::cerr << \"type '\" << type << \"' is unknown.\" << std::endl;\n    }\n    \n    return 0;\n}\n\n<commit_msg>Make stride and numThreads work<commit_after>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include <vespa\/vespalib\/hwaccelrated\/iaccelrated.h>\n#include <vespa\/vespalib\/stllike\/string.h>\n#include <vespa\/vespalib\/stllike\/hash_map.h>\n#include <iostream>\n#include <vector>\n#include <thread>\n\nusing namespace vespalib;\nusing vespalib::hwaccelrated::IAccelrated;\n\nclass Benchmark {\npublic:\n    virtual ~Benchmark() { }\n    virtual void compute(size_t docId) const = 0;\n};\n\nvoid\nrunThread(size_t count, size_t docs, const Benchmark * benchmark, size_t stride)\n{\n    for (size_t i(0); i < count; i++) {\n        for (size_t docId(0); docId < docs; docId++) {\n            benchmark->compute((docId*stride)%docs);\n        }\n    }\n}\n\nvoid\nrunBenchmark(size_t numThreads, size_t count, size_t docs, const Benchmark & benchmark, size_t stride) {\n    std::vector<std::thread> threads;\n    threads.reserve(numThreads);\n    for (size_t i(0); i < numThreads; i++) {\n        threads.emplace_back(runThread, count, docs, &benchmark, stride);\n    }\n    for (auto & thread : threads) {\n        thread.join();\n    }\n}\n\ntemplate <typename T>\nclass FullBenchmark : public Benchmark\n{\npublic:\n    FullBenchmark(size_t numDocs, size_t numValue);\n    ~FullBenchmark();\n    void compute(size_t docId) const override {\n        _dp->dotProduct(&_query[0], &_values[docId * _query.size()], _query.size());\n    }\nprivate:\n    std::vector<T> _values;\n    std::vector<T> _query;\n    IAccelrated::UP _dp;\n};\n\ntemplate <typename T>\nFullBenchmark<T>::FullBenchmark(size_t numDocs, size_t numValues)\n    : _values(numDocs*numValues),\n      _query(numValues),\n      _dp(IAccelrated::getAccelrator())\n{\n    for (size_t i(0); i < numDocs; i++) {\n        for (size_t j(0); j < numValues; j++) {\n            _values[i*numValues + j] = j;\n        }\n    }\n    for (size_t j(0); j < numValues; j++) {\n        _query[j] = j;\n    }\n}\n\ntemplate <typename T>\nFullBenchmark<T>::~FullBenchmark() = default;\n\nclass SparseBenchmark : public Benchmark\n{\npublic:\n    SparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues);\n    ~SparseBenchmark();\nprotected:\n    struct P {\n        P(uint32_t key=0, int32_t value=0) :\n            _key(key),\n            _value(value)\n        { }\n        uint32_t _key;\n        int32_t  _value;\n    };\n    size_t _numValues;\n    std::vector<P> _values;\n};\n\nSparseBenchmark::SparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues)\n    : _numValues(numValues),\n      _values(numDocs*numValues)\n{\n    for (size_t i(0); i < numDocs; i++) {\n        for (size_t j(0); j < numValues; j++) {\n            size_t k(numValues < numQueryValues ?  (j*numQueryValues)\/numValues : j);\n            _values[i*numValues + j] = P(k, k);\n        }\n    }\n}\nSparseBenchmark::~SparseBenchmark() = default;\n\nclass UnorderedSparseBenchmark : public SparseBenchmark\n{\nprivate:\n    typedef hash_map<uint32_t, int32_t> map;\npublic:\n    UnorderedSparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues);\n    ~UnorderedSparseBenchmark();\nprivate:\n    void compute(size_t docId) const override {\n        int64_t sum(0);\n        size_t offset(docId*_numValues);\n        const auto e(_query.end());\n        for (size_t i(0); i < _numValues; i++) {\n            auto it = _query.find(_values[offset + i]._key);\n            if (it != e) {\n                sum += static_cast<int64_t>(_values[offset + i]._value) * it->second;\n            }\n        }\n    }\n    map _query;\n};\n\nUnorderedSparseBenchmark::UnorderedSparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues)\n    : SparseBenchmark(numDocs, numValues, numQueryValues)\n{\n    for (size_t j(0); j < numQueryValues; j++) {\n        _query[j] = j;\n    }\n}\nUnorderedSparseBenchmark::~UnorderedSparseBenchmark() = default;\n\nclass OrderedSparseBenchmark : public SparseBenchmark\n{\nprivate:\npublic:\n    OrderedSparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues);\n    ~OrderedSparseBenchmark();\nprivate:\n    void compute(size_t docId) const override {\n        int64_t sum(0);\n        size_t offset(docId*_numValues);\n\n        for (size_t a(0), b(0); a < _query.size() && b < _numValues; b++) {\n            for (; a < _query.size() && (_query[a]._key <= _values[offset + b]._key); a++);\n            if (_query[a]._key == _values[offset + b]._key) {\n                sum += static_cast<int64_t>(_values[offset + b]._value) * _query[a]._value;\n            }\n        }\n    }\n    std::vector<P> _query;\n};\n\nOrderedSparseBenchmark::OrderedSparseBenchmark(size_t numDocs, size_t numValues, size_t numQueryValues)\n    : SparseBenchmark(numDocs, numValues, numQueryValues),\n      _query(numQueryValues)\n{\n    for (size_t j(0); j < numQueryValues; j++) {\n        size_t k(numValues > numQueryValues ?  j*numValues\/numQueryValues : j);\n        _query[j] = P(k, k);\n    }\n}\nOrderedSparseBenchmark::~OrderedSparseBenchmark() = default;\n\nint main(int argc, char *argv[])\n{\n    size_t numThreads(1);\n    size_t numDocs(1);\n    size_t numValues(1000);\n    size_t numQueries(1000000);\n    size_t stride(1);\n    string type(\"full\");\n    if ( argc > 1) {\n        type = argv[1];\n    }\n    if ( argc > 2) {\n        numThreads = strtoul(argv[2], nullptr, 0);\n    }\n    if ( argc > 3) {\n        numQueries = strtoul(argv[3], nullptr, 0);\n    }\n    if ( argc > 4) {\n        numDocs = strtoul(argv[4], nullptr, 0);\n    }\n    if ( argc > 5) {\n        numValues = strtoul(argv[5], nullptr, 0);\n    }\n    if (argc > 6) {\n        stride = strtoul(argv[6], nullptr, 0);\n    }\n    size_t numQueryValues = ( argc > 7) ? strtoul(argv[7], nullptr, 0) : numValues;\n    std::cout << \"type = \" << type << std::endl;\n    std::cout << \"numQueries = \" << numQueries << std::endl;\n    std::cout << \"numDocs = \" << numDocs << std::endl;\n    std::cout << \"numValues = \" << numValues << std::endl;\n    std::cout << \"numQueryValues = \" << numQueryValues << std::endl;\n    std::cout << \"stride =\" << stride << std::endl;\n    if (type == \"full\") {\n        FullBenchmark<float> bm(numDocs, numValues);\n        runBenchmark(numThreads, numQueries, numDocs, bm, stride);\n    } else if (type == \"sparse-ordered\") {\n        OrderedSparseBenchmark bm(numDocs, numValues, numQueryValues);\n        runBenchmark(numThreads, numQueries, numDocs, bm, stride);\n    } else if (type == \"sparse-unordered\") {\n        UnorderedSparseBenchmark bm(numDocs, numValues, numQueryValues);\n        runBenchmark(numThreads, numQueries, numDocs, bm, stride);\n    } else {\n        std::cerr << \"type '\" << type << \"' is unknown.\" << std::endl;\n    }\n    \n    return 0;\n}\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 \"views\/MainView.h\"\n#include \"Scene.h\"\n#include \"Logger\/src\/Timer.h\"\n#include \"cursor\/Cursor.h\"\n#include \"items\/Item.h\"\n\n#include <items\/RootItem.h>\n\nnamespace Visualization {\n\nMainView::MainView(Scene *scene) :\n\tView(scene, nullptr), miniMap(new MiniMap(scene, this)), scaleLevel(SCALING_FACTOR)\n{\n\tsetRenderHint(QPainter::Antialiasing);\n\tsetRenderHint(QPainter::TextAntialiasing);\n\n\tsetTransformationAnchor(QGraphicsView::AnchorUnderMouse);\n\n\tsetMiniMapSize(MINIMAP_DEFAULT_WIDTH, MINIMAP_DEFAULT_HEIGHT);\n}\n\nMainView::~MainView()\n{\n\tSAFE_DELETE(miniMap);\n}\n\nvoid MainView::setMiniMapSize(int width, int height)\n{\n\tif ( miniMap )\n\t{\n\t\tminiMap->resize(width, height);\n\t\tminiMap->sceneRectChanged(scene()->sceneRect());\n\t}\n}\n\nbool MainView::event( QEvent *event )\n{\n\tbool result = false;\n\n\tswitch (event->type())\n\t{\n\t\tcase QEvent::KeyPress :\n\t\t{\n\t\t\tQKeyEvent *k = (QKeyEvent *)event;\n\t\t\tkeyPressEvent(k);\n\t\t\tif (k->key() == Qt::Key_Backtab || k->key() == Qt::Key_Tab ) event->accept();\n\t\t\tresult = true;\n\t\t}\n\t\tbreak;\n\t\tcase QEvent::KeyRelease :\n\t\t{\n\t\t\tQKeyEvent *k = (QKeyEvent *)event;\n\t\t\tkeyReleaseEvent(k);\n\t\t\tif (k->key() == Qt::Key_Backtab || k->key() == Qt::Key_Tab ) event->accept();\n\t\t\tresult = true;\n\t\t}\n\t\tbreak;\n\t\tdefault: result = View::event( event );\n\t\tbreak;\n\t}\n\n\t\/\/ The checks below are necessary to avoid infinite recursion.\n\tif ( event->type() != QEvent::ChildAdded\n\t\t\t&& event->type() != QEvent::ChildRemoved\n\t\t\t&& event->type() != QEvent::ChildPolished) updateInfoLabels();\n\treturn result;\n}\n\nvoid MainView::resizeEvent(QResizeEvent *event)\n{\n\tView::resizeEvent(event);\n\tif ( miniMap )\n\t{\n\t\tminiMap->updatePosition();\n\t\tminiMap->visibleRectChanged();\n\t}\n}\n\nvoid MainView::wheelEvent(QWheelEvent *event)\n{\n\t\/\/ Zoom\n\tif (event->modifiers() == Qt::ControlModifier)\n\t{\n\t\tif ( event->delta() > 0 ) scaleLevel--;\n\t\telse scaleLevel++;\n\n\t\tif ( scaleLevel <= 0 ) scaleLevel = 1;\n\t\tqreal factor = scaleFactor();\n\t\tsetTransform(QTransform::fromScale(factor, factor));\n\n\t\tif ( miniMap ) miniMap->visibleRectChanged();\n\n\t\tscene()->setMainViewScalingFactor(factor);\n\t}\n\t\/\/ Scroll\n\telse if (event->modifiers() == Qt::NoModifier || event->modifiers() == Qt::ShiftModifier)\n\t{\n\t\tauto bar = event->orientation() == Qt::Vertical && event->modifiers() == Qt::NoModifier\n\t\t\t\t? verticalScrollBar() : horizontalScrollBar();\n\n\t\tbar->setValue( bar->value() - event->delta() );\n\t}\n\n\tView::wheelEvent(event);\n}\n\nqreal MainView::scaleFactor() const\n{\n\tif (scaleLevel < SCALING_FACTOR)\n\t\treturn SCALING_FACTOR \/ (qreal) scaleLevel;\n\telse return std::pow(2, SCALING_FACTOR - scaleLevel);\n}\n\nvoid MainView::scrollContentsBy(int dx, int dy)\n{\n\tView::scrollContentsBy(dx, dy);\n\tif ( miniMap ) miniMap->visibleRectChanged();\n}\n\nvoid MainView::keyPressEvent(QKeyEvent *event)\n{\n\tif ( (event->modifiers() & Qt::ControlModifier || event->modifiers() & Qt::ShiftModifier)\n\t\t\t&& event->key() == Qt::Key_Print)\n\t{\n\t\tevent->accept();\n\t\tscene()->setHiddenItemCategories(0);\n\n\t\tQPrinter printer;\n\t\tprinter.setOutputFormat(QPrinter::PdfFormat);\n\t\tprinter.setFullPage(true);\n\t\tprinter.setResolution(300);\n\n\t\tQSvgGenerator svggen;\n\t\tsvggen.setResolution(90);\n\n\t\tbool ownerIgnoresScale = setCursorAndOwnerIgnoreScaleForScreenShot(false, false);\n\n\t\tif (event->modifiers() & Qt::ShiftModifier)\n\t\t{\n\t\t\t\/\/ Print scene\n\t\t\tprinter.setOutputFileName(\"screenshot-scene.pdf\");\n\t\t\tprinter.setPaperSize(scene()->sceneRect().size().toSize(), QPrinter::Point);\n\t\t\tQPainter painter(&printer);\n\t\t\tpainter.setRenderHint(QPainter::Antialiasing);\n\t\t\tscene()->render( &painter );\n\n\t\t\tsvggen.setFileName(\"screenshot-scene.svg\");\n\t\t\tsvggen.setSize(scene()->sceneRect().size().toSize());\n\t\t\tQPainter svgPainter(&svggen);\n\t\t\tsvgPainter.setRenderHint(QPainter::Antialiasing);\n\t\t\tscene()->render(&svgPainter);\n\n\t\t\tQImage image(PNG_SCREENSHOT_SCALE * scene()->sceneRect().size().toSize(), QImage::Format_ARGB32);\n\t\t\timage.fill(Qt::transparent);\n\t\t\tQPainter pmapPainter(&image);\n\t\t\tpmapPainter.setRenderHint(QPainter::Antialiasing);\n\t\t\t\/\/pmapPainter.scale(2,2);\n\t\t\tscene()->render(&pmapPainter);\n\t\t\timage.save(\"screenshot-scene.png\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Print view\n\t\t\tprinter.setOutputFileName(\"screenshot-view.pdf\");\n\t\t\tprinter.setPaperSize(viewport()->rect().size(), QPrinter::Point);\n\t\t\tQPainter painter(&printer);\n\t\t\tpainter.setRenderHint(QPainter::Antialiasing);\n\t\t\trender(&painter);\n\n\t\t\tsvggen.setFileName(\"screenshot-view.svg\");\n\t\t\tsvggen.setSize(viewport()->rect().size());\n\t\t\tQPainter svgPainter(&svggen);\n\t\t\tsvgPainter.setRenderHint(QPainter::Antialiasing);\n\t\t\trender(&svgPainter);\n\n\t\t\tQImage image(PNG_SCREENSHOT_SCALE * viewport()->rect().size(), QImage::Format_ARGB32);\n\t\t\timage.fill(Qt::transparent);\n\t\t\tQPainter pmapPainter(&image);\n\t\t\tpmapPainter.setRenderHint(QPainter::Antialiasing);\n\t\t\trender(&pmapPainter);\n\t\t\timage.save(\"screenshot-view.png\");\n\t\t}\n\n\t\tsetCursorAndOwnerIgnoreScaleForScreenShot(true, ownerIgnoresScale);\n\t}\n\telse if (event->modifiers() == Qt::NoModifier && event->key() == Qt::Key_F11)\n\t{\n\t\tevent->accept();\n\t\tQWidget* window = this;\n\t\twhile (window->parentWidget()) window = window->parentWidget();\n\n\t\tif (window->isFullScreen()) window->showNormal();\n\t\telse window->showFullScreen();\n\t}\n\telse if (event->modifiers() == Qt::NoModifier && event->key() == Qt::Key_F10)\n\t{\n\t\tevent->accept();\n\t\tif (miniMap->width() == MINIMAP_DEFAULT_WIDTH && miniMap->height() ==  MINIMAP_DEFAULT_HEIGHT)\n\t\t\tsetMiniMapSize(width(), height());\n\t\telse setMiniMapSize(MINIMAP_DEFAULT_WIDTH, MINIMAP_DEFAULT_HEIGHT);\n\t}\n\telse if (event->modifiers() == Qt::NoModifier && event->key() == Qt::Key_F9)\n\t{\n\t\tevent->accept();\n\t\tif (miniMap->isVisible()) miniMap->hide();\n\t\telse miniMap->show();\n\t}\n\telse if (event->modifiers() == Qt::NoModifier && event->key() == Qt::Key_F7)\n\t{\n\t\tevent->accept();\n\t\tshowTimers_ = ~showTimers_;\n\t\tupdateInfoLabels();\n\t}\n\telse View::keyPressEvent(event);\n}\n\nvoid MainView::updateInfoLabels()\n{\n\tif (!showTimers_)\n\t{\n\t\tif (!infoLabels_.isEmpty())\n\t\t{\n\t\t\tfor (auto l : infoLabels_) SAFE_DELETE(l);\n\t\t\tinfoLabels_.clear();\n\t\t}\n\t\treturn;\n\t}\n\n\tint labelIndex = 0;\n\tint yPos = 10;\n\n\t\/\/ Add timers\n\tfor (auto name : Logger::Timer::timerNames())\n\t{\n\t\tQLabel* label{};\n\n\t\tif (infoLabels_.size() <= labelIndex)\n\t\t{\n\t\t\tlabel = new QLabel(this);\n\t\t\tlabel->setAttribute(Qt::WA_TransparentForMouseEvents);\n\t\t\tinfoLabels_.append(label);\n\t\t\tlabel->show();\n\t\t\tlabel->setStyleSheet(\"QLabel { color : red; }\");\n\t\t}\n\t\telse label = infoLabels_.at(labelIndex);\n\n\t\t\/\/ Set the position of the label\n\t\tlabel->move(10, yPos);\n\n\t\t\/\/ Construct label text\n\t\tauto info = name + \":  \";\n\t\tfor (auto val : Logger::Timer::timer(name)->values())\n\t\t\tinfo += QString::number(val) + \"  \";\n\n\t\tlabel->setText(info);\n\t\tlabel->adjustSize();\n\n\t\t++labelIndex;\n\t\tyPos+=label->height();\n\t}\n\n\t\/\/ Remove unnecessary labels\n\twhile (labelIndex < infoLabels_.size() )\n\t{\n\t\tSAFE_DELETE(infoLabels_.last());\n\t\tinfoLabels_.removeLast();\n\t}\n}\n\nvoid MainView::paintEvent(QPaintEvent* event)\n{\n\tauto t = Logger::Timer::start(\"Main view paint\");\n\tView::paintEvent(event);\n\tt->tick();\n}\n\nvoid MainView::mouseMoveEvent(QMouseEvent *event)\n{\n\tif (!isPanning_) return View::mouseMoveEvent(event);\n\n\tevent->accept();\n\thorizontalScrollBar()->setValue(horizontalScrollBar()->value() - (event->x() - panStartPos_.x()));\n\tverticalScrollBar()->setValue(verticalScrollBar()->value() - (event->y() - panStartPos_.y()));\n\tpanStartPos_ = event->pos();\n}\n\nvoid MainView::mousePressEvent(QMouseEvent *event)\n{\n\tif (event->modifiers() != Qt::ControlModifier) return View::mousePressEvent(event);\n\n\tevent->accept();\n\tisPanning_ = true;\n\tpanStartPos_ = event->pos();\n\tsetCursor(Qt::ClosedHandCursor);\n}\n\nvoid MainView::mouseReleaseEvent(QMouseEvent *event)\n{\n\tif (!isPanning_) return View::mouseReleaseEvent(event);\n\n\tevent->accept();\n\tsetCursor(Qt::ArrowCursor);\n\tisPanning_ = false;\n}\n\nbool MainView::setCursorAndOwnerIgnoreScaleForScreenShot(bool ignore, bool modifyOwner)\n{\n\tbool ownerIgnoresScale = false;\n\n\tauto cursor = scene()->mainCursor();\n\tif (cursor)\n\t{\n\t\tif ( auto vis = cursor->visualization() ) vis->setFlag(Item::ItemIgnoresTransformations, ignore);\n\t\tauto owner = cursor->owner();\n\t\tif (owner)\n\t\t{\n\t\t\twhile (owner->parent()) owner = owner->parent();\n\t\t\tif (!ignore)\n\t\t\t{\n\t\t\t\townerIgnoresScale = owner->flags() & Item::ItemIgnoresTransformations;\n\t\t\t\tif (ownerIgnoresScale) owner->setFlag(Item::ItemIgnoresTransformations, false);\n\t\t\t}\n\t\t\telse if (modifyOwner) owner->setFlag(Item::ItemIgnoresTransformations, true);\n\t\t}\n\t}\n\n\treturn ownerIgnoresScale;\n}\n\n}\n<commit_msg>Change geometric zoom step to be smaller<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 \"views\/MainView.h\"\n#include \"Scene.h\"\n#include \"Logger\/src\/Timer.h\"\n#include \"cursor\/Cursor.h\"\n#include \"items\/Item.h\"\n\n#include <items\/RootItem.h>\n\nnamespace Visualization {\n\nMainView::MainView(Scene *scene) :\n\tView(scene, nullptr), miniMap(new MiniMap(scene, this)), scaleLevel(SCALING_FACTOR)\n{\n\tsetRenderHint(QPainter::Antialiasing);\n\tsetRenderHint(QPainter::TextAntialiasing);\n\n\tsetTransformationAnchor(QGraphicsView::AnchorUnderMouse);\n\n\tsetMiniMapSize(MINIMAP_DEFAULT_WIDTH, MINIMAP_DEFAULT_HEIGHT);\n}\n\nMainView::~MainView()\n{\n\tSAFE_DELETE(miniMap);\n}\n\nvoid MainView::setMiniMapSize(int width, int height)\n{\n\tif ( miniMap )\n\t{\n\t\tminiMap->resize(width, height);\n\t\tminiMap->sceneRectChanged(scene()->sceneRect());\n\t}\n}\n\nbool MainView::event( QEvent *event )\n{\n\tbool result = false;\n\n\tswitch (event->type())\n\t{\n\t\tcase QEvent::KeyPress :\n\t\t{\n\t\t\tQKeyEvent *k = (QKeyEvent *)event;\n\t\t\tkeyPressEvent(k);\n\t\t\tif (k->key() == Qt::Key_Backtab || k->key() == Qt::Key_Tab ) event->accept();\n\t\t\tresult = true;\n\t\t}\n\t\tbreak;\n\t\tcase QEvent::KeyRelease :\n\t\t{\n\t\t\tQKeyEvent *k = (QKeyEvent *)event;\n\t\t\tkeyReleaseEvent(k);\n\t\t\tif (k->key() == Qt::Key_Backtab || k->key() == Qt::Key_Tab ) event->accept();\n\t\t\tresult = true;\n\t\t}\n\t\tbreak;\n\t\tdefault: result = View::event( event );\n\t\tbreak;\n\t}\n\n\t\/\/ The checks below are necessary to avoid infinite recursion.\n\tif ( event->type() != QEvent::ChildAdded\n\t\t\t&& event->type() != QEvent::ChildRemoved\n\t\t\t&& event->type() != QEvent::ChildPolished) updateInfoLabels();\n\treturn result;\n}\n\nvoid MainView::resizeEvent(QResizeEvent *event)\n{\n\tView::resizeEvent(event);\n\tif ( miniMap )\n\t{\n\t\tminiMap->updatePosition();\n\t\tminiMap->visibleRectChanged();\n\t}\n}\n\nvoid MainView::wheelEvent(QWheelEvent *event)\n{\n\t\/\/ Zoom\n\tif (event->modifiers() == Qt::ControlModifier)\n\t{\n\t\tif ( event->delta() > 0 ) scaleLevel--;\n\t\telse scaleLevel++;\n\n\t\tif ( scaleLevel <= 0 ) scaleLevel = 1;\n\t\tqreal factor = scaleFactor();\n\t\tsetTransform(QTransform::fromScale(factor, factor));\n\n\t\tif ( miniMap ) miniMap->visibleRectChanged();\n\n\t\tscene()->setMainViewScalingFactor(factor);\n\t}\n\t\/\/ Scroll\n\telse if (event->modifiers() == Qt::NoModifier || event->modifiers() == Qt::ShiftModifier)\n\t{\n\t\tauto bar = event->orientation() == Qt::Vertical && event->modifiers() == Qt::NoModifier\n\t\t\t\t? verticalScrollBar() : horizontalScrollBar();\n\n\t\tbar->setValue( bar->value() - event->delta() );\n\t}\n\n\tView::wheelEvent(event);\n}\n\nqreal MainView::scaleFactor() const\n{\n\tif (scaleLevel < SCALING_FACTOR)\n\t\treturn SCALING_FACTOR \/ (qreal) scaleLevel;\n\telse return std::pow(1.1, SCALING_FACTOR - scaleLevel);\n}\n\nvoid MainView::scrollContentsBy(int dx, int dy)\n{\n\tView::scrollContentsBy(dx, dy);\n\tif ( miniMap ) miniMap->visibleRectChanged();\n}\n\nvoid MainView::keyPressEvent(QKeyEvent *event)\n{\n\tif ( (event->modifiers() & Qt::ControlModifier || event->modifiers() & Qt::ShiftModifier)\n\t\t\t&& event->key() == Qt::Key_Print)\n\t{\n\t\tevent->accept();\n\t\tscene()->setHiddenItemCategories(0);\n\n\t\tQPrinter printer;\n\t\tprinter.setOutputFormat(QPrinter::PdfFormat);\n\t\tprinter.setFullPage(true);\n\t\tprinter.setResolution(300);\n\n\t\tQSvgGenerator svggen;\n\t\tsvggen.setResolution(90);\n\n\t\tbool ownerIgnoresScale = setCursorAndOwnerIgnoreScaleForScreenShot(false, false);\n\n\t\tif (event->modifiers() & Qt::ShiftModifier)\n\t\t{\n\t\t\t\/\/ Print scene\n\t\t\tprinter.setOutputFileName(\"screenshot-scene.pdf\");\n\t\t\tprinter.setPaperSize(scene()->sceneRect().size().toSize(), QPrinter::Point);\n\t\t\tQPainter painter(&printer);\n\t\t\tpainter.setRenderHint(QPainter::Antialiasing);\n\t\t\tscene()->render( &painter );\n\n\t\t\tsvggen.setFileName(\"screenshot-scene.svg\");\n\t\t\tsvggen.setSize(scene()->sceneRect().size().toSize());\n\t\t\tQPainter svgPainter(&svggen);\n\t\t\tsvgPainter.setRenderHint(QPainter::Antialiasing);\n\t\t\tscene()->render(&svgPainter);\n\n\t\t\tQImage image(PNG_SCREENSHOT_SCALE * scene()->sceneRect().size().toSize(), QImage::Format_ARGB32);\n\t\t\timage.fill(Qt::transparent);\n\t\t\tQPainter pmapPainter(&image);\n\t\t\tpmapPainter.setRenderHint(QPainter::Antialiasing);\n\t\t\t\/\/pmapPainter.scale(2,2);\n\t\t\tscene()->render(&pmapPainter);\n\t\t\timage.save(\"screenshot-scene.png\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Print view\n\t\t\tprinter.setOutputFileName(\"screenshot-view.pdf\");\n\t\t\tprinter.setPaperSize(viewport()->rect().size(), QPrinter::Point);\n\t\t\tQPainter painter(&printer);\n\t\t\tpainter.setRenderHint(QPainter::Antialiasing);\n\t\t\trender(&painter);\n\n\t\t\tsvggen.setFileName(\"screenshot-view.svg\");\n\t\t\tsvggen.setSize(viewport()->rect().size());\n\t\t\tQPainter svgPainter(&svggen);\n\t\t\tsvgPainter.setRenderHint(QPainter::Antialiasing);\n\t\t\trender(&svgPainter);\n\n\t\t\tQImage image(PNG_SCREENSHOT_SCALE * viewport()->rect().size(), QImage::Format_ARGB32);\n\t\t\timage.fill(Qt::transparent);\n\t\t\tQPainter pmapPainter(&image);\n\t\t\tpmapPainter.setRenderHint(QPainter::Antialiasing);\n\t\t\trender(&pmapPainter);\n\t\t\timage.save(\"screenshot-view.png\");\n\t\t}\n\n\t\tsetCursorAndOwnerIgnoreScaleForScreenShot(true, ownerIgnoresScale);\n\t}\n\telse if (event->modifiers() == Qt::NoModifier && event->key() == Qt::Key_F11)\n\t{\n\t\tevent->accept();\n\t\tQWidget* window = this;\n\t\twhile (window->parentWidget()) window = window->parentWidget();\n\n\t\tif (window->isFullScreen()) window->showNormal();\n\t\telse window->showFullScreen();\n\t}\n\telse if (event->modifiers() == Qt::NoModifier && event->key() == Qt::Key_F10)\n\t{\n\t\tevent->accept();\n\t\tif (miniMap->width() == MINIMAP_DEFAULT_WIDTH && miniMap->height() ==  MINIMAP_DEFAULT_HEIGHT)\n\t\t\tsetMiniMapSize(width(), height());\n\t\telse setMiniMapSize(MINIMAP_DEFAULT_WIDTH, MINIMAP_DEFAULT_HEIGHT);\n\t}\n\telse if (event->modifiers() == Qt::NoModifier && event->key() == Qt::Key_F9)\n\t{\n\t\tevent->accept();\n\t\tif (miniMap->isVisible()) miniMap->hide();\n\t\telse miniMap->show();\n\t}\n\telse if (event->modifiers() == Qt::NoModifier && event->key() == Qt::Key_F7)\n\t{\n\t\tevent->accept();\n\t\tshowTimers_ = ~showTimers_;\n\t\tupdateInfoLabels();\n\t}\n\telse View::keyPressEvent(event);\n}\n\nvoid MainView::updateInfoLabels()\n{\n\tif (!showTimers_)\n\t{\n\t\tif (!infoLabels_.isEmpty())\n\t\t{\n\t\t\tfor (auto l : infoLabels_) SAFE_DELETE(l);\n\t\t\tinfoLabels_.clear();\n\t\t}\n\t\treturn;\n\t}\n\n\tint labelIndex = 0;\n\tint yPos = 10;\n\n\t\/\/ Add timers\n\tfor (auto name : Logger::Timer::timerNames())\n\t{\n\t\tQLabel* label{};\n\n\t\tif (infoLabels_.size() <= labelIndex)\n\t\t{\n\t\t\tlabel = new QLabel(this);\n\t\t\tlabel->setAttribute(Qt::WA_TransparentForMouseEvents);\n\t\t\tinfoLabels_.append(label);\n\t\t\tlabel->show();\n\t\t\tlabel->setStyleSheet(\"QLabel { color : red; }\");\n\t\t}\n\t\telse label = infoLabels_.at(labelIndex);\n\n\t\t\/\/ Set the position of the label\n\t\tlabel->move(10, yPos);\n\n\t\t\/\/ Construct label text\n\t\tauto info = name + \":  \";\n\t\tfor (auto val : Logger::Timer::timer(name)->values())\n\t\t\tinfo += QString::number(val) + \"  \";\n\n\t\tlabel->setText(info);\n\t\tlabel->adjustSize();\n\n\t\t++labelIndex;\n\t\tyPos+=label->height();\n\t}\n\n\t\/\/ Remove unnecessary labels\n\twhile (labelIndex < infoLabels_.size() )\n\t{\n\t\tSAFE_DELETE(infoLabels_.last());\n\t\tinfoLabels_.removeLast();\n\t}\n}\n\nvoid MainView::paintEvent(QPaintEvent* event)\n{\n\tauto t = Logger::Timer::start(\"Main view paint\");\n\tView::paintEvent(event);\n\tt->tick();\n}\n\nvoid MainView::mouseMoveEvent(QMouseEvent *event)\n{\n\tif (!isPanning_) return View::mouseMoveEvent(event);\n\n\tevent->accept();\n\thorizontalScrollBar()->setValue(horizontalScrollBar()->value() - (event->x() - panStartPos_.x()));\n\tverticalScrollBar()->setValue(verticalScrollBar()->value() - (event->y() - panStartPos_.y()));\n\tpanStartPos_ = event->pos();\n}\n\nvoid MainView::mousePressEvent(QMouseEvent *event)\n{\n\tif (event->modifiers() != Qt::ControlModifier) return View::mousePressEvent(event);\n\n\tevent->accept();\n\tisPanning_ = true;\n\tpanStartPos_ = event->pos();\n\tsetCursor(Qt::ClosedHandCursor);\n}\n\nvoid MainView::mouseReleaseEvent(QMouseEvent *event)\n{\n\tif (!isPanning_) return View::mouseReleaseEvent(event);\n\n\tevent->accept();\n\tsetCursor(Qt::ArrowCursor);\n\tisPanning_ = false;\n}\n\nbool MainView::setCursorAndOwnerIgnoreScaleForScreenShot(bool ignore, bool modifyOwner)\n{\n\tbool ownerIgnoresScale = false;\n\n\tauto cursor = scene()->mainCursor();\n\tif (cursor)\n\t{\n\t\tif ( auto vis = cursor->visualization() ) vis->setFlag(Item::ItemIgnoresTransformations, ignore);\n\t\tauto owner = cursor->owner();\n\t\tif (owner)\n\t\t{\n\t\t\twhile (owner->parent()) owner = owner->parent();\n\t\t\tif (!ignore)\n\t\t\t{\n\t\t\t\townerIgnoresScale = owner->flags() & Item::ItemIgnoresTransformations;\n\t\t\t\tif (ownerIgnoresScale) owner->setFlag(Item::ItemIgnoresTransformations, false);\n\t\t\t}\n\t\t\telse if (modifyOwner) owner->setFlag(Item::ItemIgnoresTransformations, true);\n\t\t}\n\t}\n\n\treturn ownerIgnoresScale;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************\/\n\/*             DO NOT MODIFY OR REMOVE THIS HEADER              *\/\n\/*          FALCON - Fracturing And Liquid CONvection           *\/\n\/*                                                              *\/\n\/*       (c) pending 2012 Battelle Energy Alliance, LLC         *\/\n\/*                   ALL RIGHTS RESERVED                        *\/\n\/*                                                              *\/\n\/*          Prepared by Battelle Energy Alliance, LLC           *\/\n\/*            Under Contract No. DE-AC07-05ID14517              *\/\n\/*            With the U. S. Department of Energy               *\/\n\/*                                                              *\/\n\/*            See COPYRIGHT for full restrictions               *\/\n\/****************************************************************\/\n\n#include \"CoupledTemperatureAux.h\"\n#include \"WaterSteamEOS.h\"\n\ntemplate<>\nInputParameters validParams<CoupledTemperatureAux>()\n{\n    InputParameters params = validParams<AuxKernel>();\n    params.addCoupledVar(\"pressure\", \"Use pressure to calculate variable temperature\");\n    params.addCoupledVar(\"enthalpy\", \"Use enthalpy to calculate variable temperature\");\n    params.addParam(\"temperature\", 100., \"Initial value for temperature\");\n    params.addRequiredParam<UserObjectName>(\"water_steam_properties\", \"EOS functions, calculate water and steam properties\");\n    return params;\n}\n\nCoupledTemperatureAux::CoupledTemperatureAux(const std::string & name,\n                                               InputParameters parameters)\n    :AuxKernel(name, parameters),\n    _water_steam_properties(getUserObject<WaterSteamEOS>(\"water_steam_properties\")),\n\n    _pressure(coupledValue(\"pressure\")),\n    _enthalpy(coupledValue(\"enthalpy\")),\n    _input_temperature(getParam<Real>(\"temperature\"))\n{}\n\nReal\nCoupledTemperatureAux::computeValue()\n{\n    Real _temperature = _input_temperature;\n    Real _dummy_var[12];\n    \n    _water_steam_properties.waterAndSteamEquationOfStatePropertiesPH (_enthalpy[_qp], _pressure[_qp], _dummy_var[0] , _temperature, _dummy_var[1], _dummy_var[2], _dummy_var[3], _dummy_var[4], _dummy_var[5], _dummy_var[6], _dummy_var[7], _dummy_var[8], _dummy_var[9], _dummy_var[10], _dummy_var[11]);\n    \n    return _temperature;\n\n}\n\n<commit_msg>Fixing strange file permissions... C files should not have execute bit set.<commit_after>\/****************************************************************\/\n\/*             DO NOT MODIFY OR REMOVE THIS HEADER              *\/\n\/*          FALCON - Fracturing And Liquid CONvection           *\/\n\/*                                                              *\/\n\/*       (c) pending 2012 Battelle Energy Alliance, LLC         *\/\n\/*                   ALL RIGHTS RESERVED                        *\/\n\/*                                                              *\/\n\/*          Prepared by Battelle Energy Alliance, LLC           *\/\n\/*            Under Contract No. DE-AC07-05ID14517              *\/\n\/*            With the U. S. Department of Energy               *\/\n\/*                                                              *\/\n\/*            See COPYRIGHT for full restrictions               *\/\n\/****************************************************************\/\n\n#include \"CoupledTemperatureAux.h\"\n#include \"WaterSteamEOS.h\"\n\ntemplate<>\nInputParameters validParams<CoupledTemperatureAux>()\n{\n    InputParameters params = validParams<AuxKernel>();\n    params.addCoupledVar(\"pressure\", \"Use pressure to calculate variable temperature\");\n    params.addCoupledVar(\"enthalpy\", \"Use enthalpy to calculate variable temperature\");\n    params.addParam(\"temperature\", 100., \"Initial value for temperature\");\n    params.addRequiredParam<UserObjectName>(\"water_steam_properties\", \"EOS functions, calculate water and steam properties\");\n    return params;\n}\n\nCoupledTemperatureAux::CoupledTemperatureAux(const std::string & name,\n                                               InputParameters parameters)\n    :AuxKernel(name, parameters),\n    _water_steam_properties(getUserObject<WaterSteamEOS>(\"water_steam_properties\")),\n\n    _pressure(coupledValue(\"pressure\")),\n    _enthalpy(coupledValue(\"enthalpy\")),\n    _input_temperature(getParam<Real>(\"temperature\"))\n{}\n\nReal\nCoupledTemperatureAux::computeValue()\n{\n    Real _temperature = _input_temperature;\n    Real _dummy_var[12];\n    \n    _water_steam_properties.waterAndSteamEquationOfStatePropertiesPH (_enthalpy[_qp], _pressure[_qp], _dummy_var[0] , _temperature, _dummy_var[1], _dummy_var[2], _dummy_var[3], _dummy_var[4], _dummy_var[5], _dummy_var[6], _dummy_var[7], _dummy_var[8], _dummy_var[9], _dummy_var[10], _dummy_var[11]);\n    \n    return _temperature;\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         PelotonDB\n\/\/\n\/\/ hash_set_op_executor.cpp\n\/\/\n\/\/ Identification: src\/backend\/executor\/hash_set_op_executor.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <utility>\n#include <vector>\n\n#include \"backend\/common\/logger.h\"\n#include \"backend\/common\/value.h\"\n#include \"backend\/executor\/logical_tile.h\"\n#include \"backend\/executor\/hash_executor.h\"\n#include \"backend\/planner\/hash_plan.h\"\n#include \"backend\/expression\/tuple_value_expression.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/**\n * @brief Constructor\n *\/\nHashExecutor::HashExecutor(const planner::AbstractPlan *node,\n                                     ExecutorContext *executor_context)\n    : AbstractExecutor(node, executor_context) {}\n\n\/**\n * @brief Do some basic checks and initialize executor state.\n * @return true on success, false otherwise.\n *\/\nbool HashExecutor::DInit() {\n  assert(children_.size() == 1);\n  return true;\n}\n\nbool HashExecutor::DExecute() {\n  LOG_INFO(\"Hash Executor\");\n\n  if (!done_) {\n    const planner::HashPlan &node = GetPlanNode<planner::HashPlan>();\n\n    while (children_[0]->Execute()) {\n      child_tiles_.emplace_back(children_[0]->GetOutput());\n    }\n\n    if (child_tiles_.size() == 0) return false;\n\n\n    \/* HashKeys should be a vector of TupleValue expr\n     * from which we construct a vector of column ids that represent the\n     * attributes of the underlying table.\n     * The hash table builds on these attributes *\/\n    auto &hashkeys = node.GetHashKeys();\n    for (auto &hashkey : hashkeys) {\n      assert(hashkey->GetExpressionType() == EXPRESSION_TYPE_VALUE_TUPLE);\n      auto tuple_value = reinterpret_cast<const expression::TupleValueExpression *>(hashkey.get());\n      \/\/assert(tuple_value->GetTupleIdx() == 0);\n      column_ids_.push_back(tuple_value->GetColumnId());\n    }\n\n    for (size_t i = 0; i < child_tiles_.size(); i++) {\n      auto tile = child_tiles_[i].get();\n      for (oid_t tuple_id : *tile) {\n        htable_[HashMapType::key_type(tile, tuple_id, &column_ids_)].insert(std::make_pair(i, tuple_id));\n      }\n    }\n\n    done_ = true;\n  }\n\n  DumpHashTable();\n\n  while (result_itr < child_tiles_.size()) {\n    if (child_tiles_[result_itr]->GetTupleCount() == 0) {\n      result_itr++;\n      continue;\n    } else {\n      SetOutput(child_tiles_[result_itr++].release());\n      return true;\n    }\n  }\n  return false;\n}\n\n\nvoid HashExecutor::DumpHashTable() const {\n  assert(done_);\n  for (auto &kv : htable_) {\n    LOG_INFO(\"Key %lu, Num of tuple: %lu\", kv.first.HashCode(), kv.second.size());\n  }\n\n}\n\n} \/* namespace executor *\/\n} \/* namespace peloton *\/\n<commit_msg>Refactored hash and hash join executors<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         PelotonDB\n\/\/\n\/\/ hash_set_op_executor.cpp\n\/\/\n\/\/ Identification: src\/backend\/executor\/hash_set_op_executor.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <utility>\n#include <vector>\n\n#include \"backend\/common\/logger.h\"\n#include \"backend\/common\/value.h\"\n#include \"backend\/executor\/logical_tile.h\"\n#include \"backend\/executor\/hash_executor.h\"\n#include \"backend\/planner\/hash_plan.h\"\n#include \"backend\/expression\/tuple_value_expression.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/**\n * @brief Constructor\n *\/\nHashExecutor::HashExecutor(const planner::AbstractPlan *node,\n                           ExecutorContext *executor_context)\n: AbstractExecutor(node, executor_context) {}\n\n\/**\n * @brief Do some basic checks and initialize executor state.\n * @return true on success, false otherwise.\n *\/\nbool HashExecutor::DInit() {\n  assert(children_.size() == 1);\n\n  \/\/ Initialize executor state\n  done_ = false;\n  result_itr = 0;\n\n  return true;\n}\n\nbool HashExecutor::DExecute() {\n  LOG_INFO(\"Hash Executor\");\n\n  if (!done_) {\n    const planner::HashPlan &node = GetPlanNode<planner::HashPlan>();\n\n    \/\/ First, get all the input logical tiles\n    while (children_[0]->Execute()) {\n      child_tiles_.emplace_back(children_[0]->GetOutput());\n    }\n\n    if (child_tiles_.size() == 0)\n      return false;\n\n    \/* *\n     * HashKeys is a vector of TupleValue expr\n     * from which we construct a vector of column ids that represent the\n     * attributes of the underlying table.\n     * The hash table is built on top of these hash key attributes\n     * *\/\n    auto &hashkeys = node.GetHashKeys();\n\n    \/\/ Construct a logical tile\n    for (auto &hashkey : hashkeys) {\n      assert(hashkey->GetExpressionType() == EXPRESSION_TYPE_VALUE_TUPLE);\n      auto tuple_value = reinterpret_cast<const expression::TupleValueExpression *>(hashkey.get());\n      column_ids_.push_back(tuple_value->GetColumnId());\n    }\n\n    \/\/ Construct the hash table by going over each child logical tile and hashing\n    for (size_t child_tile_itr = 0; child_tile_itr < child_tiles_.size(); child_tile_itr++) {\n      auto tile = child_tiles_[child_tile_itr].get();\n\n      \/\/ Go over all tuples in the logical tile\n      for (oid_t tuple_id : *tile) {\n        \/\/ Key : container tuple with a subset of tuple attributes\n        \/\/ Value : < child_tile offset, tuple offset >\n        htable_[HashMapType::key_type(tile, tuple_id, &column_ids_)].insert(std::make_pair(child_tile_itr, tuple_id));\n      }\n\n    }\n\n    done_ = true;\n  }\n\n  \/\/ Print hash table for debugging\n  DumpHashTable();\n\n  \/\/ Return logical tiles one at a time\n  while (result_itr < child_tiles_.size()) {\n    if (child_tiles_[result_itr]->GetTupleCount() == 0) {\n      result_itr++;\n      continue;\n    } else {\n      SetOutput(child_tiles_[result_itr++].release());\n      return true;\n    }\n  }\n\n  return false;\n}\n\n\nvoid HashExecutor::DumpHashTable() const {\n  assert(done_);\n\n  \/\/ Go over hash table\n  for (auto &kv : htable_) {\n    LOG_INFO(\"Key %lu, Num of tuple: %lu\", kv.first.HashCode(), kv.second.size());\n  }\n\n}\n\n} \/* namespace executor *\/\n} \/* namespace peloton *\/\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"..\/..\/Flare.h\"\n#include \"FlarePlanetaryBox.h\"\n\n\nvoid SFlarePlanetaryBox::Construct(const SFlarePlanetaryBox::FArguments& InArgs)\n{\n\tRadius = 200;\n\tPlanetImage = NULL;\n\tClearChildren();\n\n\t\/\/ Add slots\n\tconst int32 NumSlots = InArgs.Slots.Num();\n\tfor (int32 SlotIndex = 0; SlotIndex < NumSlots; ++SlotIndex)\n\t{\n\t\tChildren.Add(InArgs.Slots[SlotIndex]);\n\t}\n}\n\nvoid SFlarePlanetaryBox::OnArrangeChildren(const FGeometry& AllottedGeometry, FArrangedChildren& ArrangedChildren) const\n{\n\tconst FFlareStyleCatalog& Theme = FFlareStyleSet::GetDefaultTheme();\n\n\tfor (int32 ChildIndex = 0; ChildIndex < Children.Num(); ++ChildIndex)\n\t{\n\t\t\/\/ Get all required data\n\t\tconst SFlarePlanetaryBox::FSlot& CurChild = Children[ChildIndex];\n\t\tconst EVisibility ChildVisibility = CurChild.GetWidget()->GetVisibility();\n\t\tFVector2D WidgetSize = CurChild.GetWidget()->GetDesiredSize();\n\t\tFVector2D Offset = FVector2D::ZeroVector;\n\n\t\t\/\/ Child with index 0 is the main body, index 1 is probably the name but we don't care, others are sectors\n\t\tif (ChildIndex > 0)\n\t\t{\n\t\t\tfloat X, Y;\n\t\t\tfloat Angle = (360 \/ (Children.Num() - 1)) * (ChildIndex - 1) - 90;\n\t\t\tFMath::PolarToCartesian(Radius, FMath::DegreesToRadians(Angle), X, Y);\n\t\t\tOffset = FVector2D(X, Y);\n\n\t\t\tWidgetSize = FVector2D(CurChild.GetWidget()->GetDesiredSize().X, Theme.SectorButtonHeight);\n\t\t}\n\t\t\t\n\t\t\/\/ Arrange the child\n\t\tFVector2D Location = (AllottedGeometry.GetLocalSize() - WidgetSize) \/ 2 + Offset;\n\t\tArrangedChildren.AddWidget(ChildVisibility, AllottedGeometry.MakeChild(\n\t\t\tCurChild.GetWidget(),\n\t\t\tLocation,\n\t\t\tCurChild.GetWidget()->GetDesiredSize()\n\t\t));\n\t}\n}\n\nFVector2D SFlarePlanetaryBox::ComputeDesiredSize(float) const\n{\n\treturn 2.6 * FVector2D(Radius, Radius);\n}\n\nFChildren* SFlarePlanetaryBox::GetChildren()\n{\n\treturn &Children;\n}\n\nint32 SFlarePlanetaryBox::RemoveSlot(const TSharedRef<SWidget>& SlotWidget)\n{\n\tfor (int32 SlotIdx = 0; SlotIdx < Children.Num(); ++SlotIdx)\n\t{\n\t\tif (SlotWidget == Children[SlotIdx].GetWidget())\n\t\t{\n\t\t\tChildren.RemoveAt(SlotIdx);\n\t\t\treturn SlotIdx;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\nvoid SFlarePlanetaryBox::ClearChildren()\n{\n\tChildren.Empty();\n\n\tif (PlanetImage)\n\t{\n\t\tAddSlot()\n\t\t[\n\t\t\tSNew(SImage).Image(PlanetImage)\n\t\t];\n\t}\n}\n<commit_msg>Fix orbital layout<commit_after>\n#include \"..\/..\/Flare.h\"\n#include \"FlarePlanetaryBox.h\"\n\n\nvoid SFlarePlanetaryBox::Construct(const SFlarePlanetaryBox::FArguments& InArgs)\n{\n\tRadius = 200;\n\tPlanetImage = NULL;\n\tClearChildren();\n\n\t\/\/ Add slots\n\tconst int32 NumSlots = InArgs.Slots.Num();\n\tfor (int32 SlotIndex = 0; SlotIndex < NumSlots; ++SlotIndex)\n\t{\n\t\tChildren.Add(InArgs.Slots[SlotIndex]);\n\t}\n}\n\nvoid SFlarePlanetaryBox::OnArrangeChildren(const FGeometry& AllottedGeometry, FArrangedChildren& ArrangedChildren) const\n{\n\tconst FFlareStyleCatalog& Theme = FFlareStyleSet::GetDefaultTheme();\n\n\tfor (int32 ChildIndex = 0; ChildIndex < Children.Num(); ++ChildIndex)\n\t{\n\t\t\/\/ Get all required data\n\t\tconst SFlarePlanetaryBox::FSlot& CurChild = Children[ChildIndex];\n\t\tconst EVisibility ChildVisibility = CurChild.GetWidget()->GetVisibility();\n\t\tFVector2D WidgetSize = CurChild.GetWidget()->GetDesiredSize();\n\t\tFVector2D Offset = FVector2D::ZeroVector;\n\n\t\t\/\/ Child with index 0 is the main body, index 1 is probably the name but we don't care, others are sectors\n\t\tif (ChildIndex > 0)\n\t\t{\n\t\t\tfloat X, Y;\n\t\t\tfloat Angle = (360 \/ (Children.Num() - 1)) * (ChildIndex - 1) - 90;\n\t\t\tFMath::PolarToCartesian(Radius, FMath::DegreesToRadians(Angle), X, Y);\n\t\t\tOffset = FVector2D(X, Y);\n\n\t\t\tWidgetSize = FVector2D(CurChild.GetWidget()->GetDesiredSize().X, Theme.SectorButtonHeight);\n\t\t}\n\t\t\t\n\t\t\/\/ Arrange the child\n\t\tFVector2D Location = (AllottedGeometry.GetLocalSize() - WidgetSize) \/ 2 + Offset;\n\t\tArrangedChildren.AddWidget(ChildVisibility, AllottedGeometry.MakeChild(\n\t\t\tCurChild.GetWidget(),\n\t\t\tLocation,\n\t\t\tCurChild.GetWidget()->GetDesiredSize()\n\t\t));\n\t}\n}\n\nFVector2D SFlarePlanetaryBox::ComputeDesiredSize(float) const\n{\n\treturn FVector2D(2.6 * Radius, 2.8 * Radius);\n}\n\nFChildren* SFlarePlanetaryBox::GetChildren()\n{\n\treturn &Children;\n}\n\nint32 SFlarePlanetaryBox::RemoveSlot(const TSharedRef<SWidget>& SlotWidget)\n{\n\tfor (int32 SlotIdx = 0; SlotIdx < Children.Num(); ++SlotIdx)\n\t{\n\t\tif (SlotWidget == Children[SlotIdx].GetWidget())\n\t\t{\n\t\t\tChildren.RemoveAt(SlotIdx);\n\t\t\treturn SlotIdx;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\nvoid SFlarePlanetaryBox::ClearChildren()\n{\n\tChildren.Empty();\n\n\tif (PlanetImage)\n\t{\n\t\tAddSlot()\n\t\t[\n\t\t\tSNew(SImage).Image(PlanetImage)\n\t\t];\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the Vc library.\n\n    Copyright (C) 2009 Matthias Kretz <kretz@kde.org>\n\n    Vc is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU Lesser 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    Vc 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 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 Vc.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <Vc\/Vc>\n#include \"benchmark.h\"\n#include \"random.h\"\n#include \"..\/cpuid.h\"\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace Vc;\n\ntemplate<typename Vector> class DoCompares\n{\n    enum {\n        Factor2 = 128\n    };\n    public:\n        static void run()\n        {\n            const int Factor = CpuId::L1Data() \/ (sizeof(Vector) * 2); \/\/ half L1\n            Vector *a = new Vector[Factor + 3];\n#ifndef VC_BENCHMARK_NO_MLOCK\n            mlock(a, (Factor + 3) * sizeof(Vector));\n#endif\n            for (int i = 0; i < Factor + 3; ++i) {\n                a[i] = PseudoRandom<Vector>::next();\n            }\n\n#ifdef VC_IMPL_Scalar\n            typedef bool M;\n#else\n            typedef typename Vector::Mask M;\n#endif\n\n            {\n                Benchmark timer(\"operator==\", Vector::Size * Factor * Factor2 * 6.0, \"Op\");\n                while (timer.wantsMoreDataPoints()) {\n                    timer.Start();\n                    for (int j = 0; j < Factor2; ++j) {\n                        for (int i = 0; i < Factor; ++i) {\n                            const M &tmp0 = a[i + 0] == a[i + 1]; keepResults(tmp0);\n                            const M &tmp1 = a[i + 0] == a[i + 2]; keepResults(tmp1);\n                            const M &tmp2 = a[i + 0] == a[i + 3]; keepResults(tmp2);\n                            const M &tmp3 = a[i + 1] == a[i + 2]; keepResults(tmp3);\n                            const M &tmp4 = a[i + 1] == a[i + 3]; keepResults(tmp4);\n                            const M &tmp5 = a[i + 2] == a[i + 3]; keepResults(tmp5);\n                        }\n                    }\n                    timer.Stop();\n                }\n                timer.Print();\n            }\n            {\n                Benchmark timer(\"operator<\", Vector::Size * Factor * Factor2 * 6.0, \"Op\");\n                while (timer.wantsMoreDataPoints()) {\n                    timer.Start();\n                    for (int j = 0; j < Factor2; ++j) {\n                        for (int i = 0; i < Factor; ++i) {\n                            const M &tmp0 = a[i + 0] < a[i + 1]; keepResults(tmp0);\n                            const M &tmp1 = a[i + 0] < a[i + 2]; keepResults(tmp1);\n                            const M &tmp2 = a[i + 0] < a[i + 3]; keepResults(tmp2);\n                            const M &tmp3 = a[i + 1] < a[i + 2]; keepResults(tmp3);\n                            const M &tmp4 = a[i + 1] < a[i + 3]; keepResults(tmp4);\n                            const M &tmp5 = a[i + 2] < a[i + 3]; keepResults(tmp5);\n                        }\n                    }\n                    timer.Stop();\n                }\n                timer.Print();\n            }\n            {\n                Benchmark timer(\"(operator<).isFull()\", Vector::Size * Factor * Factor2 * 6.0, \"Op\");\n                while (timer.wantsMoreDataPoints()) {\n                    timer.Start();\n                    for (int j = 0; j < Factor2; ++j) {\n                        for (int i = 0; i < Factor; ++i) {\n                            if ((a[i + 0] < a[i + 1]).isFull()) asm volatile(\"\");\n                            if ((a[i + 0] < a[i + 2]).isFull()) asm volatile(\"\");\n                            if ((a[i + 0] < a[i + 3]).isFull()) asm volatile(\"\");\n                            if ((a[i + 1] < a[i + 2]).isFull()) asm volatile(\"\");\n                            if ((a[i + 1] < a[i + 3]).isFull()) asm volatile(\"\");\n                            if ((a[i + 2] < a[i + 3]).isFull()) asm volatile(\"\");\n                        }\n                    }\n                    timer.Stop();\n                }\n                timer.Print();\n            }\n            {\n                Benchmark timer(\"!(operator<).isEmpty()\", Vector::Size * Factor * Factor2 * 6.0, \"Op\");\n                while (timer.wantsMoreDataPoints()) {\n                    timer.Start();\n                    for (int j = 0; j < Factor2; ++j) {\n                        for (int i = 0; i < Factor; ++i) {\n                            if (!(a[i + 0] < a[i + 1]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 0] < a[i + 2]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 0] < a[i + 3]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 1] < a[i + 2]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 1] < a[i + 3]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 2] < a[i + 3]).isEmpty()) asm volatile(\"\");\n                        }\n                    }\n                    timer.Stop();\n                }\n                timer.Print();\n            }\n            delete[] a;\n        }\n};\n\nint bmain()\n{\n    Benchmark::addColumn(\"datatype\");\n\n    Benchmark::setColumnData(\"datatype\", \"double_v\");\n    DoCompares<double_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"float_v\");\n    DoCompares<float_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"int_v\");\n    DoCompares<int_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"uint_v\");\n    DoCompares<uint_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"short_v\");\n    DoCompares<short_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"ushort_v\");\n    DoCompares<ushort_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"sfloat_v\");\n    DoCompares<sfloat_v>::run();\n\n    return 0;\n}\n<commit_msg>remove unnecessary ifdef<commit_after>\/*  This file is part of the Vc library.\n\n    Copyright (C) 2009 Matthias Kretz <kretz@kde.org>\n\n    Vc is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU Lesser 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    Vc 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 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 Vc.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <Vc\/Vc>\n#include \"benchmark.h\"\n#include \"random.h\"\n#include \"..\/cpuid.h\"\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace Vc;\n\ntemplate<typename Vector> class DoCompares\n{\n    enum {\n        Factor2 = 128\n    };\n    public:\n        static void run()\n        {\n            const int Factor = CpuId::L1Data() \/ (sizeof(Vector) * 2); \/\/ half L1\n            Vector *a = new Vector[Factor + 3];\n#ifndef VC_BENCHMARK_NO_MLOCK\n            mlock(a, (Factor + 3) * sizeof(Vector));\n#endif\n            for (int i = 0; i < Factor + 3; ++i) {\n                a[i] = PseudoRandom<Vector>::next();\n            }\n\n            typedef typename Vector::Mask M;\n\n            {\n                Benchmark timer(\"operator==\", Vector::Size * Factor * Factor2 * 6.0, \"Op\");\n                while (timer.wantsMoreDataPoints()) {\n                    timer.Start();\n                    for (int j = 0; j < Factor2; ++j) {\n                        for (int i = 0; i < Factor; ++i) {\n                            const M &tmp0 = a[i + 0] == a[i + 1]; keepResults(tmp0);\n                            const M &tmp1 = a[i + 0] == a[i + 2]; keepResults(tmp1);\n                            const M &tmp2 = a[i + 0] == a[i + 3]; keepResults(tmp2);\n                            const M &tmp3 = a[i + 1] == a[i + 2]; keepResults(tmp3);\n                            const M &tmp4 = a[i + 1] == a[i + 3]; keepResults(tmp4);\n                            const M &tmp5 = a[i + 2] == a[i + 3]; keepResults(tmp5);\n                        }\n                    }\n                    timer.Stop();\n                }\n                timer.Print();\n            }\n            {\n                Benchmark timer(\"operator<\", Vector::Size * Factor * Factor2 * 6.0, \"Op\");\n                while (timer.wantsMoreDataPoints()) {\n                    timer.Start();\n                    for (int j = 0; j < Factor2; ++j) {\n                        for (int i = 0; i < Factor; ++i) {\n                            const M &tmp0 = a[i + 0] < a[i + 1]; keepResults(tmp0);\n                            const M &tmp1 = a[i + 0] < a[i + 2]; keepResults(tmp1);\n                            const M &tmp2 = a[i + 0] < a[i + 3]; keepResults(tmp2);\n                            const M &tmp3 = a[i + 1] < a[i + 2]; keepResults(tmp3);\n                            const M &tmp4 = a[i + 1] < a[i + 3]; keepResults(tmp4);\n                            const M &tmp5 = a[i + 2] < a[i + 3]; keepResults(tmp5);\n                        }\n                    }\n                    timer.Stop();\n                }\n                timer.Print();\n            }\n            {\n                Benchmark timer(\"(operator<).isFull()\", Vector::Size * Factor * Factor2 * 6.0, \"Op\");\n                while (timer.wantsMoreDataPoints()) {\n                    timer.Start();\n                    for (int j = 0; j < Factor2; ++j) {\n                        for (int i = 0; i < Factor; ++i) {\n                            if ((a[i + 0] < a[i + 1]).isFull()) asm volatile(\"\");\n                            if ((a[i + 0] < a[i + 2]).isFull()) asm volatile(\"\");\n                            if ((a[i + 0] < a[i + 3]).isFull()) asm volatile(\"\");\n                            if ((a[i + 1] < a[i + 2]).isFull()) asm volatile(\"\");\n                            if ((a[i + 1] < a[i + 3]).isFull()) asm volatile(\"\");\n                            if ((a[i + 2] < a[i + 3]).isFull()) asm volatile(\"\");\n                        }\n                    }\n                    timer.Stop();\n                }\n                timer.Print();\n            }\n            {\n                Benchmark timer(\"!(operator<).isEmpty()\", Vector::Size * Factor * Factor2 * 6.0, \"Op\");\n                while (timer.wantsMoreDataPoints()) {\n                    timer.Start();\n                    for (int j = 0; j < Factor2; ++j) {\n                        for (int i = 0; i < Factor; ++i) {\n                            if (!(a[i + 0] < a[i + 1]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 0] < a[i + 2]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 0] < a[i + 3]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 1] < a[i + 2]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 1] < a[i + 3]).isEmpty()) asm volatile(\"\");\n                            if (!(a[i + 2] < a[i + 3]).isEmpty()) asm volatile(\"\");\n                        }\n                    }\n                    timer.Stop();\n                }\n                timer.Print();\n            }\n            delete[] a;\n        }\n};\n\nint bmain()\n{\n    Benchmark::addColumn(\"datatype\");\n\n    Benchmark::setColumnData(\"datatype\", \"double_v\");\n    DoCompares<double_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"float_v\");\n    DoCompares<float_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"int_v\");\n    DoCompares<int_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"uint_v\");\n    DoCompares<uint_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"short_v\");\n    DoCompares<short_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"ushort_v\");\n    DoCompares<ushort_v>::run();\n    Benchmark::setColumnData(\"datatype\", \"sfloat_v\");\n    DoCompares<sfloat_v>::run();\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2018 The nanoFramework project contributors\n\/\/ Portions Copyright (c) Microsoft Corporation.  All rights reserved.\n\/\/ See LICENSE file in the project root for full license information.\n\/\/\n\n#include \"sys_net_native.h\"\n\n\nstatic const CLR_RT_MethodHandler method_lookup[] =\n{\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    Library_sys_net_native_System_Net_NetworkInformation_Wireless80211Configuration::GetWireless82011ConfigurationCount___STATIC__I4,\n    Library_sys_net_native_System_Net_NetworkInformation_Wireless80211Configuration::GetWireless82011Configuration___STATIC__SystemNetNetworkInformationWireless80211Configuration__I4,\n    Library_sys_net_native_System_Net_NetworkInformation_Wireless80211Configuration::UpdateConfiguration___STATIC__VOID,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::InitializeNetworkInterfaceSettings___VOID,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::UpdateConfiguration___VOID__I4,\n    NULL,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::GetNetworkInterfaceCount___STATIC__I4,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::GetNetworkInterface___STATIC__SystemNetNetworkInformationNetworkInterface__U4,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::IPAddressFromString___STATIC__U4__STRING,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureServerInit___STATIC__I4__I4__I4__SystemSecurityCryptographyX509CertificatesX509Certificate__SZARRAY_SystemSecurityCryptographyX509CertificatesX509Certificate,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureClientInit___STATIC__I4__I4__I4__SystemSecurityCryptographyX509CertificatesX509Certificate__SZARRAY_SystemSecurityCryptographyX509CertificatesX509Certificate,\n    Library_sys_net_native_System_Net_Security_SslNative::UpdateCertificates___STATIC__VOID__I4__SystemSecurityCryptographyX509CertificatesX509Certificate__SZARRAY_SystemSecurityCryptographyX509CertificatesX509Certificate,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureAccept___STATIC__VOID__I4__OBJECT,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureConnect___STATIC__VOID__I4__STRING__OBJECT,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureRead___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureWrite___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureCloseSocket___STATIC__I4__OBJECT,\n    Library_sys_net_native_System_Net_Security_SslNative::ExitSecureContext___STATIC__I4__I4,\n    Library_sys_net_native_System_Net_Security_SslNative::DataAvailable___STATIC__I4__OBJECT,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::socket___STATIC__I4__I4__I4__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::bind___STATIC__VOID__OBJECT__SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::connect___STATIC__VOID__OBJECT__SZARRAY_U1__BOOLEAN,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::send___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::recv___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::close___STATIC__I4__OBJECT,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::listen___STATIC__VOID__OBJECT__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::accept___STATIC__I4__OBJECT,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::getaddrinfo___STATIC__VOID__STRING__BYREF_STRING__BYREF_SZARRAY_SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::shutdown___STATIC__VOID__OBJECT__I4__BYREF_I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::sendto___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4__I4__SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::recvfrom___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4__I4__BYREF_SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::getpeername___STATIC__VOID__OBJECT__BYREF_SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::getsockname___STATIC__VOID__OBJECT__BYREF_SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::getsockopt___STATIC__VOID__OBJECT__I4__I4__SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::setsockopt___STATIC__VOID__OBJECT__I4__I4__SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::poll___STATIC__BOOLEAN__OBJECT__I4__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::ioctl___STATIC__VOID__OBJECT__U4__BYREF_U4,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    Library_sys_net_native_System_Security_Cryptography_X509Certificates_X509Certificate::ParseCertificate___STATIC__VOID__SZARRAY_U1__STRING__BYREF_STRING__BYREF_STRING__BYREF_mscorlibSystemDateTime__BYREF_mscorlibSystemDateTime,\n};\n\nconst CLR_RT_NativeAssemblyData g_CLR_AssemblyNative_System_Net =\n{\n    \"System.Net\", \n    0xC58744CD,\n    method_lookup,\n    { 1, 0, 2, 13 }\n};\n<commit_msg>Update nanoFramework.System.Net version to 1.0.2-preview-021 ***NO_CI***<commit_after>\/\/\n\/\/ Copyright (c) 2018 The nanoFramework project contributors\n\/\/ Portions Copyright (c) Microsoft Corporation.  All rights reserved.\n\/\/ See LICENSE file in the project root for full license information.\n\/\/\n\n#include \"sys_net_native.h\"\n\n\nstatic const CLR_RT_MethodHandler method_lookup[] =\n{\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    Library_sys_net_native_System_Net_NetworkInformation_Wireless80211Configuration::GetWireless82011ConfigurationCount___STATIC__I4,\n    Library_sys_net_native_System_Net_NetworkInformation_Wireless80211Configuration::GetWireless82011Configuration___STATIC__SystemNetNetworkInformationWireless80211Configuration__I4,\n    Library_sys_net_native_System_Net_NetworkInformation_Wireless80211Configuration::UpdateConfiguration___STATIC__VOID,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::InitializeNetworkInterfaceSettings___VOID,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::UpdateConfiguration___VOID__I4,\n    NULL,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::GetNetworkInterfaceCount___STATIC__I4,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::GetNetworkInterface___STATIC__SystemNetNetworkInformationNetworkInterface__U4,\n    Library_sys_net_native_System_Net_NetworkInformation_NetworkInterface::IPAddressFromString___STATIC__U4__STRING,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureServerInit___STATIC__I4__I4__I4__SystemSecurityCryptographyX509CertificatesX509Certificate__SZARRAY_SystemSecurityCryptographyX509CertificatesX509Certificate,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureClientInit___STATIC__I4__I4__I4__SystemSecurityCryptographyX509CertificatesX509Certificate__SZARRAY_SystemSecurityCryptographyX509CertificatesX509Certificate,\n    Library_sys_net_native_System_Net_Security_SslNative::UpdateCertificates___STATIC__VOID__I4__SystemSecurityCryptographyX509CertificatesX509Certificate__SZARRAY_SystemSecurityCryptographyX509CertificatesX509Certificate,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureAccept___STATIC__VOID__I4__OBJECT,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureConnect___STATIC__VOID__I4__STRING__OBJECT,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureRead___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureWrite___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4,\n    Library_sys_net_native_System_Net_Security_SslNative::SecureCloseSocket___STATIC__I4__OBJECT,\n    Library_sys_net_native_System_Net_Security_SslNative::ExitSecureContext___STATIC__I4__I4,\n    Library_sys_net_native_System_Net_Security_SslNative::DataAvailable___STATIC__I4__OBJECT,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::socket___STATIC__I4__I4__I4__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::bind___STATIC__VOID__OBJECT__SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::connect___STATIC__VOID__OBJECT__SZARRAY_U1__BOOLEAN,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::send___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::recv___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::close___STATIC__I4__OBJECT,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::listen___STATIC__VOID__OBJECT__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::accept___STATIC__I4__OBJECT,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::getaddrinfo___STATIC__VOID__STRING__BYREF_STRING__BYREF_SZARRAY_SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::shutdown___STATIC__VOID__OBJECT__I4__BYREF_I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::sendto___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4__I4__SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::recvfrom___STATIC__I4__OBJECT__SZARRAY_U1__I4__I4__I4__I4__BYREF_SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::getpeername___STATIC__VOID__OBJECT__BYREF_SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::getsockname___STATIC__VOID__OBJECT__BYREF_SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::getsockopt___STATIC__VOID__OBJECT__I4__I4__SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::setsockopt___STATIC__VOID__OBJECT__I4__I4__SZARRAY_U1,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::poll___STATIC__BOOLEAN__OBJECT__I4__I4,\n    Library_sys_net_native_System_Net_Sockets_NativeSocket::ioctl___STATIC__VOID__OBJECT__U4__BYREF_U4,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    NULL,\n    Library_sys_net_native_System_Security_Cryptography_X509Certificates_X509Certificate::ParseCertificate___STATIC__VOID__SZARRAY_U1__STRING__BYREF_STRING__BYREF_STRING__BYREF_mscorlibSystemDateTime__BYREF_mscorlibSystemDateTime,\n};\n\nconst CLR_RT_NativeAssemblyData g_CLR_AssemblyNative_System_Net =\n{\n    \"System.Net\", \n    0xC58744CD,\n    method_lookup,\n    { 1, 0, 2, 21 }\n};\n<|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\n#include \"ICUBridgeCollationCompareFunctor.hpp\"\n#include \"ICUBridge.hpp\"\n\n\n\n#include <Include\/XalanAutoPtr.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n#include <unicode\/coll.h>\n\n\n\nconst StylesheetExecutionContextDefault::DefaultCollationCompareFunctor\t\tICUBridgeCollationCompareFunctor::s_defaultFunctor;\n\n\n\nICUBridgeCollationCompareFunctor::ICUBridgeCollationCompareFunctor() :\n\tm_isValid(false),\n\tm_collator(0)\n{\n\tUErrorCode\ttheStatus = U_ZERO_ERROR;\n\n\tm_collator = Collator::createInstance(theStatus);\n\n\tif (theStatus == U_ZERO_ERROR ||\n\t    (theStatus >= U_ERROR_INFO_START && theStatus < U_ERROR_INFO_LIMIT))\n\t{\n\t\tm_isValid = true;\n\t}\n}\n\n\n\nICUBridgeCollationCompareFunctor::~ICUBridgeCollationCompareFunctor()\n{\n\tdelete m_collator;\n}\n\n\n\nint\nICUBridgeCollationCompareFunctor::operator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS) const\n{\n\tUErrorCode\ttheStatus = U_ZERO_ERROR;\n\n\tXalanAutoPtr<Collator>\ttheCollator(Collator::createInstance(theStatus));\n\n\tif (theStatus == U_ZERO_ERROR ||\n\t    (theStatus >= U_ERROR_INFO_START && theStatus < U_ERROR_INFO_LIMIT))\n\t{\n\t\tassert(theCollator.get() != 0);\n\n#if U_SIZEOF_WCHAR_T==2\n\t\treturn theCollator->compare(\n\t\t\t\t\t(wchar_t*)theLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\t(wchar_t*)theRHS,\n\t\t\t\t\tlength(theRHS));\n#else\n\t\treturn theCollator->compare(\n\t\t\t\t\ttheLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\ttheRHS,\n\t\t\t\t\tlength(theRHS));\n#endif\n\t}\n\telse\n\t{\n\t\treturn s_defaultFunctor(theLHS, theRHS);\n\t}\n}\n\n\n\nint\nICUBridgeCollationCompareFunctor::operator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\tconst XalanDOMChar*\t\ttheLocale) const\n{\n\tUErrorCode\ttheStatus = U_ZERO_ERROR;\n\n#if U_SIZEOF_WCHAR_T==2\n\tXalanAutoPtr<Collator>\ttheCollator(Collator::createInstance(Locale(UnicodeString(const theLocale)), theStatus));\n#else\n\tXalanAutoPtr<Collator>\ttheCollator(Collator::createInstance(Locale(UnicodeString(theLocale)), theStatus));\n#endif\n\n\tif (theStatus == U_ZERO_ERROR ||\n\t    (theStatus >= U_ERROR_INFO_START && theStatus < U_ERROR_INFO_LIMIT))\n\t{\n\t\tassert(theCollator.get() != 0);\n\n#if U_SIZEOF_WCHAR_T==2\n\t\treturn theCollator->compare(\n\t\t\t\t\t(const wchar_t*)theLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\t(const wchar_t*)theRHS,\n\t\t\t\t\tlength(theRHS));\n#else\n\t\treturn theCollator->compare(\n\t\t\t\t\ttheLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\ttheRHS,\n\t\t\t\t\tlength(theRHS));\n#endif\n\t}\n\telse\n\t{\n\t\treturn s_defaultFunctor(theLHS, theRHS);\n\t}\n}\n\n\n\nint\nICUBridgeCollationCompareFunctor::operator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS)\n{\n\tif (isValid() == false)\n\t{\n\t\treturn s_defaultFunctor(theLHS, theRHS);\n\t}\n\telse\n\t{\n\t\tassert(m_collator != 0);\n#if U_SIZEOF_WCHAR_T==2\n\t\treturn m_collator->compare(\n\t\t\t\t\t(wchar_t*)theLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\t(wchar_t*)theRHS,\n\t\t\t\t\tlength(theRHS));\n#else\n\t\treturn m_collator->compare(\n\t\t\t\t\ttheLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\ttheRHS,\n\t\t\t\t\tlength(theRHS));\n#endif\n\t}\n}\n<commit_msg>Fixed typo.<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\n#include \"ICUBridgeCollationCompareFunctor.hpp\"\n#include \"ICUBridge.hpp\"\n\n\n\n#include <Include\/XalanAutoPtr.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n#include <unicode\/coll.h>\n\n\n\nconst StylesheetExecutionContextDefault::DefaultCollationCompareFunctor\t\tICUBridgeCollationCompareFunctor::s_defaultFunctor;\n\n\n\nICUBridgeCollationCompareFunctor::ICUBridgeCollationCompareFunctor() :\n\tm_isValid(false),\n\tm_collator(0)\n{\n\tUErrorCode\ttheStatus = U_ZERO_ERROR;\n\n\tm_collator = Collator::createInstance(theStatus);\n\n\tif (theStatus == U_ZERO_ERROR ||\n\t    (theStatus >= U_ERROR_INFO_START && theStatus < U_ERROR_INFO_LIMIT))\n\t{\n\t\tm_isValid = true;\n\t}\n}\n\n\n\nICUBridgeCollationCompareFunctor::~ICUBridgeCollationCompareFunctor()\n{\n\tdelete m_collator;\n}\n\n\n\nint\nICUBridgeCollationCompareFunctor::operator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS) const\n{\n\tUErrorCode\ttheStatus = U_ZERO_ERROR;\n\n\tXalanAutoPtr<Collator>\ttheCollator(Collator::createInstance(theStatus));\n\n\tif (theStatus == U_ZERO_ERROR ||\n\t    (theStatus >= U_ERROR_INFO_START && theStatus < U_ERROR_INFO_LIMIT))\n\t{\n\t\tassert(theCollator.get() != 0);\n\n#if U_SIZEOF_WCHAR_T==2\n\t\treturn theCollator->compare(\n\t\t\t\t\t(wchar_t*)theLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\t(wchar_t*)theRHS,\n\t\t\t\t\tlength(theRHS));\n#else\n\t\treturn theCollator->compare(\n\t\t\t\t\ttheLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\ttheRHS,\n\t\t\t\t\tlength(theRHS));\n#endif\n\t}\n\telse\n\t{\n\t\treturn s_defaultFunctor(theLHS, theRHS);\n\t}\n}\n\n\n\nint\nICUBridgeCollationCompareFunctor::operator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\tconst XalanDOMChar*\t\ttheLocale) const\n{\n\tUErrorCode\ttheStatus = U_ZERO_ERROR;\n\n#if U_SIZEOF_WCHAR_T==2\n\tXalanAutoPtr<Collator>\ttheCollator(Collator::createInstance(Locale(UnicodeString((const wchar_t*)theLocale)), theStatus));\n#else\n\tXalanAutoPtr<Collator>\ttheCollator(Collator::createInstance(Locale(UnicodeString(theLocale)), theStatus));\n#endif\n\n\tif (theStatus == U_ZERO_ERROR ||\n\t    (theStatus >= U_ERROR_INFO_START && theStatus < U_ERROR_INFO_LIMIT))\n\t{\n\t\tassert(theCollator.get() != 0);\n\n#if U_SIZEOF_WCHAR_T==2\n\t\treturn theCollator->compare(\n\t\t\t\t\t(const wchar_t*)theLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\t(const wchar_t*)theRHS,\n\t\t\t\t\tlength(theRHS));\n#else\n\t\treturn theCollator->compare(\n\t\t\t\t\ttheLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\ttheRHS,\n\t\t\t\t\tlength(theRHS));\n#endif\n\t}\n\telse\n\t{\n\t\treturn s_defaultFunctor(theLHS, theRHS);\n\t}\n}\n\n\n\nint\nICUBridgeCollationCompareFunctor::operator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS)\n{\n\tif (isValid() == false)\n\t{\n\t\treturn s_defaultFunctor(theLHS, theRHS);\n\t}\n\telse\n\t{\n\t\tassert(m_collator != 0);\n#if U_SIZEOF_WCHAR_T==2\n\t\treturn m_collator->compare(\n\t\t\t\t\tconst (wchar_t*)theLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\tconst (wchar_t*)theRHS,\n\t\t\t\t\tlength(theRHS));\n#else\n\t\treturn m_collator->compare(\n\t\t\t\t\ttheLHS,\n\t\t\t\t\tlength(theLHS),\n\t\t\t\t\ttheRHS,\n\t\t\t\t\tlength(theRHS));\n#endif\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"LogicController.h\"\n\nLogicController::LogicController() {\n\n  logicState = LOGIC_STATE_INTERRUPT;\n  processState = PROCCESS_STATE_SEARCHING;\n\n  ProcessData();\n\n  control_queue = priority_queue<PrioritizedController>();\n\n}\n\nLogicController::~LogicController() {}\n\nvoid LogicController::Reset() {\n\n  std::cout << \"LogicController.Reset()\" << std::endl;\n  logicState = LOGIC_STATE_INTERRUPT;\n  processState = PROCCESS_STATE_SEARCHING;\n\n  ProcessData();\n\n  control_queue = priority_queue<PrioritizedController>();\n}\n\n\/\/***********************************************************************************************************************\n\/\/This function is called every 1\/10th second by the ROSAdapter\n\/\/The logical flow if the behaviours is controlled here by using a interrupt, haswork, priority queue system.\nResult LogicController::DoWork() {\n  Result result;\n\n  \/\/first a loop runs through all the controllers who have a priority of 0 or above witht he largest number being\n  \/\/most important. A priority of less than 0 is an ignored controller use -1 for standards sake.\n  \/\/if any controller needs and interrupt the logic state is changed to interrupt\n  for(PrioritizedController cntrlr : prioritizedControllers) {\n    if(cntrlr.controller->ShouldInterrupt() && cntrlr.priority >= 0) \n      {\n\tlogicState = LOGIC_STATE_INTERRUPT;\n\t\/\/do not break all shouldInterupts may need calling in order to properly pre-proccess data.\n      }\n  }\n\n  \/\/logic state switch\n  switch(logicState) {\n\n  \/\/when an interrupt has been thorwn or there are no pending control_queue.top().actions logic controller is in this state.\n  case LOGIC_STATE_INTERRUPT: {\n    \/\/Reset the control queue\n    control_queue = priority_queue<PrioritizedController>();\n\n    \/\/check what controllers have work to do all that say yes will be added to the priority queue.\n    for(PrioritizedController cntrlr : prioritizedControllers) {\n      if(cntrlr.controller->HasWork()) {\n        if (cntrlr.priority < 0) {\n          continue;\n        }\n        else {\n          control_queue.push(cntrlr);\n        }\n      }\n    }\n\n    \/\/if no controlers have work report this to ROS Adapter and do nothing.\n    if(control_queue.empty()) {\n      result.type = behavior;\n      result.b = wait;\n      break;\n    }\n    else {\n      \/\/default result state if someone has work this safe gaurds against faulty result types\n      result.b = noChange;\n    }\n\n    \/\/take the top member of the priority queue and run their do work function.\n    result = control_queue.top().controller->DoWork();\n\n    \/\/anaylyze the result that was returned and do state changes accordingly\n    \/\/behavior types are used to indicate behavior changes of some form\n    if(result.type == behavior) {\n\n      \/\/ask for an external reset so the state of the controller is preserved untill after it has returned a result and\n      \/\/gotten a chance to communicate with other controllers\n      if (result.reset) {\n        controllerInterconnect(); \/\/allow controller to communicate state data before it is reset\n        control_queue.top().controller->Reset();\n      }\n\n      \/\/ask for the procces state to change to the next state or loop around to the begining\n      if(result.b == nextProcess) {\n        if (processState == _LAST - 1) {\n          processState = _FIRST;\n        }\n        else {\n          processState = (ProcessState)((int)processState + 1);\n        }\n      }\n      \/\/ask for the procces state to change to the previouse state or loop around to the end\n      else if(result.b == prevProcess) {\n        if (processState == _FIRST) {\n          processState = (ProcessState)((int)_LAST - 1);\n        }\n        else {\n          processState = (ProcessState)((int)processState - 1);\n        }\n      }\n\n      \/\/update the priorites of the controllers based upon the new process state.\n      if (result.b == nextProcess || result.b == prevProcess) {\n        ProcessData();\n        result.b = wait;\n        driveController.Reset(); \/\/it is assumed that the drive controller may be in a bad state if interrupted so reset it\n      }\n      break;\n    }\n\n    \/\/precision driving result types are when a controller wants direct command of the robots actuators\n    \/\/logic controller facilitates the command pass through in the LOGIC_STATE_PRECISION_COMMAND switch case\n    else if(result.type == precisionDriving) {\n\n      logicState = LOGIC_STATE_PRECISION_COMMAND;\n      break;\n\n    }\n\n    \/\/waypoints are also a pass through facilitated command but with a slightly diffrent overhead\n    \/\/they are handled in the LOGIC_STATE_WAITING switch case\n    else if(result.type == waypoint) {\n\n      logicState = LOGIC_STATE_WAITING;\n      driveController.SetResultData(result);\n      \/\/fall through on purpose\n    }\n\n  } \/\/end of interupt case***************************************************************************************\n\n    \/\/this case is primarly when logic controller is waiting for drive controller to reach its last waypoint\n  case LOGIC_STATE_WAITING: {\n    \/\/ask drive controller how to drive\n    \/\/commands to be passed the ROS Adapter as left and right wheel PWM values in the result struct are returned\n    result = driveController.DoWork();\n\n    \/\/when out of waypoints drive controller will through an interrupt however unlike other controllers\n    \/\/drive controller is not on the priority queue so it must be checked here\n    if (result.type == behavior) {\n      if(driveController.ShouldInterrupt()) {\n        logicState = LOGIC_STATE_INTERRUPT;\n      }\n    }\n    break;\n  }\/\/end of waiting case*****************************************************************************************\n\n    \/\/used for precision driving pass through\n  case LOGIC_STATE_PRECISION_COMMAND: {\n\n    \/\/unlike waypoints precision commands change every update tick so we ask the\n    \/\/controller for new commands on every update tick.\n    result = control_queue.top().controller->DoWork();\n\n    \/\/pass the driving commands to the drive controller so it can interpret them\n    driveController.SetResultData(result);\n\n    \/\/the interoreted commands are turned into properinitial_spiral_offset motor commands to be passed the ROS Adapter\n    \/\/as left and right wheel PWM values in the result struct.\n    result = driveController.DoWork();\n    break;\n\n  }\/\/end of precision case****************************************************************************************\n  }\/\/end switch statment******************************************************************************************\n\n   \/\/ bad! causes node to crash\n   \/\/ cout << \"logic state \" << logicState << \" top controller \" << control_queue.top().priority << \" Proccess \" << processState <<endl;\n\n\n  \/\/now using proccess logic allow the controller to communicate data between eachother\n  controllerInterconnect();\n\n  \/\/give the ROSAdapter the final decision on how it should drive\n  return result;\n}\n\nvoid LogicController::UpdateData() {\n\n\n}\n\nvoid LogicController::ProcessData() {\n\n  \/\/this controller priority is used when searching\n  if (processState == PROCCESS_STATE_SEARCHING) {\n    prioritizedControllers = {\n      PrioritizedController{0, (Controller*)(&searchController)},\n      PrioritizedController{10, (Controller*)(&obstacleController)},\n      PrioritizedController{15, (Controller*)(&pickUpController)},\n      PrioritizedController{5, (Controller*)(&range_controller)},\n      PrioritizedController{-1, (Controller*)(&dropOffController)},\n      PrioritizedController{-1, (Controller*)(&manualWaypointController)}\n    };\n  }\n\n  \/\/this priority is used when returning a target to the center collection zone\n  else if (processState  == PROCCESS_STATE_TARGET_PICKEDUP) {\n    prioritizedControllers = {\n    PrioritizedController{-1, (Controller*)(&searchController)},\n    PrioritizedController{15, (Controller*)(&obstacleController)},\n    PrioritizedController{-1, (Controller*)(&pickUpController)},\n    PrioritizedController{10, (Controller*)(&range_controller)},\n    PrioritizedController{1, (Controller*)(&dropOffController)},\n    PrioritizedController{-1, (Controller*)(&manualWaypointController)}\n    };\n  }\n  \/\/this priority is used when returning a target to the center collection zone\n  else if (processState  == PROCCESS_STATE_DROP_OFF)\n  {\n    prioritizedControllers = {\n      PrioritizedController{-1, (Controller*)(&searchController)},\n      PrioritizedController{-1, (Controller*)(&obstacleController)},\n      PrioritizedController{-1, (Controller*)(&pickUpController)},\n      PrioritizedController{10, (Controller*)(&range_controller)},\n      PrioritizedController{1, (Controller*)(&dropOffController)},\n      PrioritizedController{-1, (Controller*)(&manualWaypointController)}\n    };\n  }\n  else if (processState == PROCESS_STATE_MANUAL) {\n    prioritizedControllers = {\n      PrioritizedController{-1, (Controller*)(&searchController)},\n      PrioritizedController{10, (Controller*)(&obstacleController)},\n      PrioritizedController{-1, (Controller*)(&pickUpController)},\n      PrioritizedController{-1, (Controller*)(&range_controller)},\n      PrioritizedController{-1, (Controller*)(&dropOffController)},\n      PrioritizedController{5,  (Controller*)(&manualWaypointController)}\n    };     \n  }\n}\n\nbool LogicController::ShouldInterrupt() {\n  ProcessData();\n\n  return false;\n}\n\nbool LogicController::HasWork() {\n  return false;\n}\n\n\nvoid LogicController::controllerInterconnect() {\n\n  if (processState == PROCCESS_STATE_SEARCHING) {\n\n    \/\/obstacle needs to know if the center ultrasound should be ignored\n    if(pickUpController.GetIgnoreCenter()) {\n      obstacleController.SetIgnoreCenter();\n    }\n\n    \/\/pickup controller annouces it has pickedup a target\n    if(pickUpController.GetTargetHeld()) {\n      dropOffController.SetTargetPickedUp();\n      obstacleController.SetTargetHeld();\n      searchController.SetSuccesfullPickup();\n    }\n  }\n\n  \/\/ask if drop off has released the target from the claws yet\n  if (!dropOffController.HasTarget()) {\n    obstacleController.SetTargetHeldClear();\n  }\n\n  \/\/obstacle controller is running driveController needs to clear its waypoints\n  if(obstacleController.GetShouldClearWaypoints()) {\n    driveController.Reset();\n  }\n\n}\n\n\/\/ Recieves position in the world inertial frame (should rename to SetOdomPositionData)\nvoid LogicController::SetPositionData(Point currentLocation) {\n  searchController.SetCurrentLocation(currentLocation);\n  dropOffController.SetCurrentLocation(currentLocation);\n  obstacleController.SetCurrentLocation(currentLocation);\n  driveController.SetCurrentLocation(currentLocation);\n  manualWaypointController.SetCurrentLocation(currentLocation);\n}\n\n\/\/ Recieves position in the world frame with global data (GPS)\nvoid LogicController::SetMapPositionData(Point currentLocation) {\n  range_controller.setCurrentLocation(currentLocation);\n  \n}\n\nvoid LogicController::SetVelocityData(float linearVelocity, float angularVelocity) {\n  driveController.SetVelocityData(linearVelocity,angularVelocity);\n}\n\nvoid LogicController::SetMapVelocityData(float linearVelocity, float angularVelocity) {\n\n}\n\nvoid LogicController::SetAprilTags(vector<TagPoint> tags) {\n  pickUpController.SetTagData(tags);\n  obstacleController.SetTagData(tags);\n  dropOffController.SetTargetData(tags);\n}\n\nvoid LogicController::SetSonarData(float left, float center, float right) {\n  pickUpController.SetSonarData(center);\n  obstacleController.SetSonarData(left,center,right);\n}\n\n\/\/ Called once by RosAdapter in guarded init\nvoid LogicController::SetCenterLocationOdom(Point centerLocationOdom) {\n  searchController.SetCenterLocation(centerLocationOdom);\n  dropOffController.SetCenterLocation(centerLocationOdom);\n}\n\nvoid LogicController::AddManualWaypoint(Point manualWaypoint)\n{\n  manualWaypointController.AddManualWaypoint(manualWaypoint);\n}\n\nvoid LogicController::setVirtualFenceOn( RangeShape* range )\n{\n  range_controller.setRangeShape(range);\n  range_controller.setEnabled(true);\n}\n\nvoid LogicController::setVirtualFenceOff()\n{\n  range_controller.setEnabled(false);\n}\n\nvoid LogicController::SetCenterLocationMap(Point centerLocationMap) {\n\n}\n\nvoid LogicController::SetCurrentTimeInMilliSecs( long int time )\n{\n  current_time = time;\n  dropOffController.SetCurrentTimeInMilliSecs( time );\n  pickUpController.SetCurrentTimeInMilliSecs( time );\n  obstacleController.SetCurrentTimeInMilliSecs( time );\n}\n\nvoid LogicController::SetModeAuto() {\n  if(processState == PROCESS_STATE_MANUAL) {\n    \/\/ only do something if we are in manual mode\n    this->Reset();\n  }\n}\nvoid LogicController::SetModeManual()\n{\n  if(processState != PROCESS_STATE_MANUAL) {\n    logicState = LOGIC_STATE_INTERRUPT;\n    processState = PROCESS_STATE_MANUAL;\n    ProcessData();\n    control_queue = priority_queue<PrioritizedController>();\n    driveController.Reset();\n  }\n}\n<commit_msg>Removed obstacle avoidance from Manual mode controllers<commit_after>#include \"LogicController.h\"\n\nLogicController::LogicController() {\n\n  logicState = LOGIC_STATE_INTERRUPT;\n  processState = PROCCESS_STATE_SEARCHING;\n\n  ProcessData();\n\n  control_queue = priority_queue<PrioritizedController>();\n\n}\n\nLogicController::~LogicController() {}\n\nvoid LogicController::Reset() {\n\n  std::cout << \"LogicController.Reset()\" << std::endl;\n  logicState = LOGIC_STATE_INTERRUPT;\n  processState = PROCCESS_STATE_SEARCHING;\n\n  ProcessData();\n\n  control_queue = priority_queue<PrioritizedController>();\n}\n\n\/\/***********************************************************************************************************************\n\/\/This function is called every 1\/10th second by the ROSAdapter\n\/\/The logical flow if the behaviours is controlled here by using a interrupt, haswork, priority queue system.\nResult LogicController::DoWork() {\n  Result result;\n\n  \/\/first a loop runs through all the controllers who have a priority of 0 or above witht he largest number being\n  \/\/most important. A priority of less than 0 is an ignored controller use -1 for standards sake.\n  \/\/if any controller needs and interrupt the logic state is changed to interrupt\n  for(PrioritizedController cntrlr : prioritizedControllers) {\n    if(cntrlr.controller->ShouldInterrupt() && cntrlr.priority >= 0) \n      {\n\tlogicState = LOGIC_STATE_INTERRUPT;\n\t\/\/do not break all shouldInterupts may need calling in order to properly pre-proccess data.\n      }\n  }\n\n  \/\/logic state switch\n  switch(logicState) {\n\n  \/\/when an interrupt has been thorwn or there are no pending control_queue.top().actions logic controller is in this state.\n  case LOGIC_STATE_INTERRUPT: {\n    \/\/Reset the control queue\n    control_queue = priority_queue<PrioritizedController>();\n\n    \/\/check what controllers have work to do all that say yes will be added to the priority queue.\n    for(PrioritizedController cntrlr : prioritizedControllers) {\n      if(cntrlr.controller->HasWork()) {\n        if (cntrlr.priority < 0) {\n          continue;\n        }\n        else {\n          control_queue.push(cntrlr);\n        }\n      }\n    }\n\n    \/\/if no controlers have work report this to ROS Adapter and do nothing.\n    if(control_queue.empty()) {\n      result.type = behavior;\n      result.b = wait;\n      break;\n    }\n    else {\n      \/\/default result state if someone has work this safe gaurds against faulty result types\n      result.b = noChange;\n    }\n\n    \/\/take the top member of the priority queue and run their do work function.\n    result = control_queue.top().controller->DoWork();\n\n    \/\/anaylyze the result that was returned and do state changes accordingly\n    \/\/behavior types are used to indicate behavior changes of some form\n    if(result.type == behavior) {\n\n      \/\/ask for an external reset so the state of the controller is preserved untill after it has returned a result and\n      \/\/gotten a chance to communicate with other controllers\n      if (result.reset) {\n        controllerInterconnect(); \/\/allow controller to communicate state data before it is reset\n        control_queue.top().controller->Reset();\n      }\n\n      \/\/ask for the procces state to change to the next state or loop around to the begining\n      if(result.b == nextProcess) {\n        if (processState == _LAST - 1) {\n          processState = _FIRST;\n        }\n        else {\n          processState = (ProcessState)((int)processState + 1);\n        }\n      }\n      \/\/ask for the procces state to change to the previouse state or loop around to the end\n      else if(result.b == prevProcess) {\n        if (processState == _FIRST) {\n          processState = (ProcessState)((int)_LAST - 1);\n        }\n        else {\n          processState = (ProcessState)((int)processState - 1);\n        }\n      }\n\n      \/\/update the priorites of the controllers based upon the new process state.\n      if (result.b == nextProcess || result.b == prevProcess) {\n        ProcessData();\n        result.b = wait;\n        driveController.Reset(); \/\/it is assumed that the drive controller may be in a bad state if interrupted so reset it\n      }\n      break;\n    }\n\n    \/\/precision driving result types are when a controller wants direct command of the robots actuators\n    \/\/logic controller facilitates the command pass through in the LOGIC_STATE_PRECISION_COMMAND switch case\n    else if(result.type == precisionDriving) {\n\n      logicState = LOGIC_STATE_PRECISION_COMMAND;\n      break;\n\n    }\n\n    \/\/waypoints are also a pass through facilitated command but with a slightly diffrent overhead\n    \/\/they are handled in the LOGIC_STATE_WAITING switch case\n    else if(result.type == waypoint) {\n\n      logicState = LOGIC_STATE_WAITING;\n      driveController.SetResultData(result);\n      \/\/fall through on purpose\n    }\n\n  } \/\/end of interupt case***************************************************************************************\n\n    \/\/this case is primarly when logic controller is waiting for drive controller to reach its last waypoint\n  case LOGIC_STATE_WAITING: {\n    \/\/ask drive controller how to drive\n    \/\/commands to be passed the ROS Adapter as left and right wheel PWM values in the result struct are returned\n    result = driveController.DoWork();\n\n    \/\/when out of waypoints drive controller will through an interrupt however unlike other controllers\n    \/\/drive controller is not on the priority queue so it must be checked here\n    if (result.type == behavior) {\n      if(driveController.ShouldInterrupt()) {\n        logicState = LOGIC_STATE_INTERRUPT;\n      }\n    }\n    break;\n  }\/\/end of waiting case*****************************************************************************************\n\n    \/\/used for precision driving pass through\n  case LOGIC_STATE_PRECISION_COMMAND: {\n\n    \/\/unlike waypoints precision commands change every update tick so we ask the\n    \/\/controller for new commands on every update tick.\n    result = control_queue.top().controller->DoWork();\n\n    \/\/pass the driving commands to the drive controller so it can interpret them\n    driveController.SetResultData(result);\n\n    \/\/the interoreted commands are turned into properinitial_spiral_offset motor commands to be passed the ROS Adapter\n    \/\/as left and right wheel PWM values in the result struct.\n    result = driveController.DoWork();\n    break;\n\n  }\/\/end of precision case****************************************************************************************\n  }\/\/end switch statment******************************************************************************************\n\n   \/\/ bad! causes node to crash\n   \/\/ cout << \"logic state \" << logicState << \" top controller \" << control_queue.top().priority << \" Proccess \" << processState <<endl;\n\n\n  \/\/now using proccess logic allow the controller to communicate data between eachother\n  controllerInterconnect();\n\n  \/\/give the ROSAdapter the final decision on how it should drive\n  return result;\n}\n\nvoid LogicController::UpdateData() {\n\n\n}\n\nvoid LogicController::ProcessData() {\n\n  \/\/this controller priority is used when searching\n  if (processState == PROCCESS_STATE_SEARCHING) {\n    prioritizedControllers = {\n      PrioritizedController{0, (Controller*)(&searchController)},\n      PrioritizedController{10, (Controller*)(&obstacleController)},\n      PrioritizedController{15, (Controller*)(&pickUpController)},\n      PrioritizedController{5, (Controller*)(&range_controller)},\n      PrioritizedController{-1, (Controller*)(&dropOffController)},\n      PrioritizedController{-1, (Controller*)(&manualWaypointController)}\n    };\n  }\n\n  \/\/this priority is used when returning a target to the center collection zone\n  else if (processState  == PROCCESS_STATE_TARGET_PICKEDUP) {\n    prioritizedControllers = {\n    PrioritizedController{-1, (Controller*)(&searchController)},\n    PrioritizedController{15, (Controller*)(&obstacleController)},\n    PrioritizedController{-1, (Controller*)(&pickUpController)},\n    PrioritizedController{10, (Controller*)(&range_controller)},\n    PrioritizedController{1, (Controller*)(&dropOffController)},\n    PrioritizedController{-1, (Controller*)(&manualWaypointController)}\n    };\n  }\n  \/\/this priority is used when returning a target to the center collection zone\n  else if (processState  == PROCCESS_STATE_DROP_OFF)\n  {\n    prioritizedControllers = {\n      PrioritizedController{-1, (Controller*)(&searchController)},\n      PrioritizedController{-1, (Controller*)(&obstacleController)},\n      PrioritizedController{-1, (Controller*)(&pickUpController)},\n      PrioritizedController{10, (Controller*)(&range_controller)},\n      PrioritizedController{1, (Controller*)(&dropOffController)},\n      PrioritizedController{-1, (Controller*)(&manualWaypointController)}\n    };\n  }\n  else if (processState == PROCESS_STATE_MANUAL) {\n    prioritizedControllers = {\n      PrioritizedController{-1, (Controller*)(&searchController)},\n      PrioritizedController{-1, (Controller*)(&obstacleController)},\n      PrioritizedController{-1, (Controller*)(&pickUpController)},\n      PrioritizedController{-1, (Controller*)(&range_controller)},\n      PrioritizedController{-1, (Controller*)(&dropOffController)},\n      PrioritizedController{5,  (Controller*)(&manualWaypointController)}\n    };     \n  }\n}\n\nbool LogicController::ShouldInterrupt() {\n  ProcessData();\n\n  return false;\n}\n\nbool LogicController::HasWork() {\n  return false;\n}\n\n\nvoid LogicController::controllerInterconnect() {\n\n  if (processState == PROCCESS_STATE_SEARCHING) {\n\n    \/\/obstacle needs to know if the center ultrasound should be ignored\n    if(pickUpController.GetIgnoreCenter()) {\n      obstacleController.SetIgnoreCenter();\n    }\n\n    \/\/pickup controller annouces it has pickedup a target\n    if(pickUpController.GetTargetHeld()) {\n      dropOffController.SetTargetPickedUp();\n      obstacleController.SetTargetHeld();\n      searchController.SetSuccesfullPickup();\n    }\n  }\n\n  \/\/ask if drop off has released the target from the claws yet\n  if (!dropOffController.HasTarget()) {\n    obstacleController.SetTargetHeldClear();\n  }\n\n  \/\/obstacle controller is running driveController needs to clear its waypoints\n  if(obstacleController.GetShouldClearWaypoints()) {\n    driveController.Reset();\n  }\n\n}\n\n\/\/ Recieves position in the world inertial frame (should rename to SetOdomPositionData)\nvoid LogicController::SetPositionData(Point currentLocation) {\n  searchController.SetCurrentLocation(currentLocation);\n  dropOffController.SetCurrentLocation(currentLocation);\n  obstacleController.SetCurrentLocation(currentLocation);\n  driveController.SetCurrentLocation(currentLocation);\n  manualWaypointController.SetCurrentLocation(currentLocation);\n}\n\n\/\/ Recieves position in the world frame with global data (GPS)\nvoid LogicController::SetMapPositionData(Point currentLocation) {\n  range_controller.setCurrentLocation(currentLocation);\n  \n}\n\nvoid LogicController::SetVelocityData(float linearVelocity, float angularVelocity) {\n  driveController.SetVelocityData(linearVelocity,angularVelocity);\n}\n\nvoid LogicController::SetMapVelocityData(float linearVelocity, float angularVelocity) {\n\n}\n\nvoid LogicController::SetAprilTags(vector<TagPoint> tags) {\n  pickUpController.SetTagData(tags);\n  obstacleController.SetTagData(tags);\n  dropOffController.SetTargetData(tags);\n}\n\nvoid LogicController::SetSonarData(float left, float center, float right) {\n  pickUpController.SetSonarData(center);\n  obstacleController.SetSonarData(left,center,right);\n}\n\n\/\/ Called once by RosAdapter in guarded init\nvoid LogicController::SetCenterLocationOdom(Point centerLocationOdom) {\n  searchController.SetCenterLocation(centerLocationOdom);\n  dropOffController.SetCenterLocation(centerLocationOdom);\n}\n\nvoid LogicController::AddManualWaypoint(Point manualWaypoint)\n{\n  manualWaypointController.AddManualWaypoint(manualWaypoint);\n}\n\nvoid LogicController::setVirtualFenceOn( RangeShape* range )\n{\n  range_controller.setRangeShape(range);\n  range_controller.setEnabled(true);\n}\n\nvoid LogicController::setVirtualFenceOff()\n{\n  range_controller.setEnabled(false);\n}\n\nvoid LogicController::SetCenterLocationMap(Point centerLocationMap) {\n\n}\n\nvoid LogicController::SetCurrentTimeInMilliSecs( long int time )\n{\n  current_time = time;\n  dropOffController.SetCurrentTimeInMilliSecs( time );\n  pickUpController.SetCurrentTimeInMilliSecs( time );\n  obstacleController.SetCurrentTimeInMilliSecs( time );\n}\n\nvoid LogicController::SetModeAuto() {\n  if(processState == PROCESS_STATE_MANUAL) {\n    \/\/ only do something if we are in manual mode\n    this->Reset();\n  }\n}\nvoid LogicController::SetModeManual()\n{\n  if(processState != PROCESS_STATE_MANUAL) {\n    logicState = LOGIC_STATE_INTERRUPT;\n    processState = PROCESS_STATE_MANUAL;\n    ProcessData();\n    control_queue = priority_queue<PrioritizedController>();\n    driveController.Reset();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * jcom.hub - internals\n * manage internal objects that are hosted within the hub for a module\n * By Tim Place, Copyright  2007\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#include \"jcom.hub.h\"\n\n\nclass hubInternalObject {\n\tprivate:\n\tt_object\t*theObject;\n\t\n\tpublic:\n\tmethod\t\taction;\n\t\n\thubInternalObject(char *classname, char *subscribername, char *subscribertype, char *ramptype, char *description)\n\t{\n\t\tt_atom\t\ta[7];\n\t\n\t\ttheObject = NULL;\n\t\tatom_setsym(a+0, gensym(subscribername));\n\t\tatom_setsym(a+1, gensym(\"@type\"));\n\t\tatom_setsym(a+2, gensym(subscribertype));\n\t\tatom_setsym(a+3, gensym(\"@ramp\/drive\"));\n\t\tatom_setsym(a+4, gensym(ramptype));\n\t\tatom_setsym(a+5, gensym(\"@description\"));\n\t\tatom_setsym(a+6, gensym(description));\n\t\tjcom_core_loadextern(gensym(classname), 7, a, &theObject);\n\t}\n\t\n\t~hubInternalObject()\n\t{\n\t\tobject_free(theObject);\n\t}\n};\n\n\nvoid hub_internals_create(t_hub *x)\n{\n\thubInternalObject\t*anObject;\n\n\tx->hash_internals = hashtab_new(0);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"init\",\t\t\t\t\t\t\"msg_none\",\t\t\"none\",\t\"Initialize a module completely to the original state.\");\n\tanObject->action = (method)hub_init;\n\thashtab_store(x->hash_internals, gensym(\"init\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"documentation\/generate\",\t\"msg_none\",\t\t\"none\",\t\"Generate a documentation page for this module and save it to disk.\");\n\tanObject->action = (method)hub_autodoc;\n\thashtab_store(x->hash_internals, gensym(\"documentation\/generate\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"module\/view_internals\",\t\"msg_none\",\t\t\"none\",\t\"Attempts to open the internal algorithm for viewing.  This works for most modules.  Some modules may choose to cloak the algorithms - preventing this message from functioning.\");\n\tanObject->action = (method)hub_module_view_alg;\n\thashtab_store(x->hash_internals, gensym(\"module\/view_internals\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/read\",\t\t\t\t\"msg_symbol\",\t\"none\",\t\"Open an xml-preset file and recall the first preset in that file.  An optional argument defines the file to open.\");\n\tanObject->action = (method)hub_preset_read;\n\thashtab_store(x->hash_internals, gensym(\"preset\/read\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/write\",\t\t\t\t\"msg_symbol\",\t\"none\",\t\"Write an xml-preset file to disk.  An optional argument defines the file to open.\");\n\tanObject->action = (method)hub_preset_write;\n\thashtab_store(x->hash_internals, gensym(\"preset\/write\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/recall\",\t\t\t\"msg_generic\",\t\"none\",\t\"Recall a preset by number - you can also choose presets from the module menu.\");\n\tanObject->action = (method)hub_preset_recall;\n\thashtab_store(x->hash_internals, gensym(\"preset\/recall\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/copy\",\t\t\t\t\"msg_list\",\t\t\"none\",\t\"Create a new preset (2nd argument) by copying the contents of another preset (1st argument)\");\n\tanObject->action = (method)hub_preset_copy;\n\thashtab_store(x->hash_internals, gensym(\"preset\/copy\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/store\",\t\t\t\t\"msg_list\",\t\t\"none\",\t\"Store a preset by number in memory.  All presets present in memory will be written to disk when you send a save_settings message to the module.\");\n\tanObject->action = (method)hub_preset_store;\n\thashtab_store(x->hash_internals, gensym(\"preset\/store\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/storenext\",\t\t\t\"msg_list\",\t\t\"none\",\t\"Store a preset in the next preset slot.  Handy so that you do not need to specify a preset number manually.\");\n\tanObject->action = (method)hub_preset_store_next;\n\thashtab_store(x->hash_internals, gensym(\"preset\/storenext\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/interpolate\",\t\t\"msg_list\",\t\t\"none\",\t\"Interpolate between two named presets (argument 1 and 2) using a ratio (float in the range [0.0, 1.0]) specified as the third argument.\");\n\tanObject->action = (method)hub_preset_interpolate;\n\thashtab_store(x->hash_internals, gensym(\"preset\/interpolate\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/default\",\t\t\t\"msg_none\",\t\t\"none\",\t\"Open the default preset file and recall the first preset in that file.\");\n\tanObject->action = (method)hub_preset_default;\n\thashtab_store(x->hash_internals, gensym(\"preset\/default\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/clear\",\t\t\t\t\"msg_none\",\t\t\"none\",\t\"This is the same preset\/default.\");\n\tanObject->action = (method)hub_preset_default;\n\thashtab_store(x->hash_internals, gensym(\"preset\/clear\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/post\",\t\t\t\t\"msg_none\",\t\t\"none\",\t\"Post all presets to the Max window.\");\n\tanObject->action = (method)hub_presets_dump;\n\thashtab_store(x->hash_internals, gensym(\"preset\/post\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.parameter\",\t\"ui\/freeze\",\t\t\t\t\"msg_toggle\",\t\"none\",\t\"Turn off the updating of user interface elements when parameters change.  This may be done to conserve CPU resources.\");\n\tanObject->action = (method)hub_ui_freeze;\n\thashtab_store(x->hash_internals, gensym(\"ui\/freeze\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"ui\/refresh\",\t\t\t\t\"msg_none\",\t\t\"none\",\t\"Update displayed values for module to reflect current state.\");\n\tanObject->action = (method)hub_ui_refresh;\n\thashtab_store(x->hash_internals, gensym(\"ui\/refresh\"), (t_object*)anObject);\n}\n\n\nvoid hub_internals_destroy(t_hub *x)\n{\n\tlong\t\t\t\ti;\n\tlong\t\t\t\tnumKeys;\n\tt_symbol\t\t\t**keys;\n\thubInternalObject\t*anObject;\n\tt_max_err\t\t\terr;\n\t\n\thashtab_getkeys(x->hash_internals, &numKeys, &keys);\n\tfor(i=0; i<numKeys; i++){\n\t\terr = hashtab_lookup(x->hash_internals, keys[i], (t_object**)&anObject);\n\t\tif(!err)\n\t\t\tdelete anObject;\n\t}\n\thashtab_chuck(x->hash_internals);\n}\n\n\nvoid hub_internals_dispatch(t_hub *x, t_symbol *osc_name, long argc, t_atom *argv)\n{\n\thubInternalObject\t*theObject;\n\tt_max_err\t\t\terr;\n\t\n\terr = hashtab_lookup(x->hash_internals, osc_name, (t_object**)&theObject);\n\tif(!err)\n\t\ttheObject->action(x, osc_name, argc, argv);\n}\n\n<commit_msg>\/preset\/clear now calls the clear method rather than the default method<commit_after>\/* \n * jcom.hub - internals\n * manage internal objects that are hosted within the hub for a module\n * By Tim Place, Copyright  2007\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#include \"jcom.hub.h\"\n\n\nclass hubInternalObject {\n\tprivate:\n\tt_object\t*theObject;\n\t\n\tpublic:\n\tmethod\t\taction;\n\t\n\thubInternalObject(char *classname, char *subscribername, char *subscribertype, char *ramptype, char *description)\n\t{\n\t\tt_atom\t\ta[7];\n\t\n\t\ttheObject = NULL;\n\t\tatom_setsym(a+0, gensym(subscribername));\n\t\tatom_setsym(a+1, gensym(\"@type\"));\n\t\tatom_setsym(a+2, gensym(subscribertype));\n\t\tatom_setsym(a+3, gensym(\"@ramp\/drive\"));\n\t\tatom_setsym(a+4, gensym(ramptype));\n\t\tatom_setsym(a+5, gensym(\"@description\"));\n\t\tatom_setsym(a+6, gensym(description));\n\t\tjcom_core_loadextern(gensym(classname), 7, a, &theObject);\n\t}\n\t\n\t~hubInternalObject()\n\t{\n\t\tobject_free(theObject);\n\t}\n};\n\n\nvoid hub_internals_create(t_hub *x)\n{\n\thubInternalObject\t*anObject;\n\n\tx->hash_internals = hashtab_new(0);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"init\",\t\t\t\t\t\t\"msg_none\",\t\t\"none\",\t\"Initialize a module completely to the original state.\");\n\tanObject->action = (method)hub_init;\n\thashtab_store(x->hash_internals, gensym(\"init\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"documentation\/generate\",\t\"msg_none\",\t\t\"none\",\t\"Generate a documentation page for this module and save it to disk.\");\n\tanObject->action = (method)hub_autodoc;\n\thashtab_store(x->hash_internals, gensym(\"documentation\/generate\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"module\/view_internals\",\t\"msg_none\",\t\t\"none\",\t\"Attempts to open the internal algorithm for viewing.  This works for most modules.  Some modules may choose to cloak the algorithms - preventing this message from functioning.\");\n\tanObject->action = (method)hub_module_view_alg;\n\thashtab_store(x->hash_internals, gensym(\"module\/view_internals\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/read\",\t\t\t\t\"msg_symbol\",\t\"none\",\t\"Open an xml-preset file and recall the first preset in that file.  An optional argument defines the file to open.\");\n\tanObject->action = (method)hub_preset_read;\n\thashtab_store(x->hash_internals, gensym(\"preset\/read\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/write\",\t\t\t\t\"msg_symbol\",\t\"none\",\t\"Write an xml-preset file to disk.  An optional argument defines the file to open.\");\n\tanObject->action = (method)hub_preset_write;\n\thashtab_store(x->hash_internals, gensym(\"preset\/write\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/recall\",\t\t\t\"msg_generic\",\t\"none\",\t\"Recall a preset by number - you can also choose presets from the module menu.\");\n\tanObject->action = (method)hub_preset_recall;\n\thashtab_store(x->hash_internals, gensym(\"preset\/recall\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/copy\",\t\t\t\t\"msg_list\",\t\t\"none\",\t\"Create a new preset (2nd argument) by copying the contents of another preset (1st argument)\");\n\tanObject->action = (method)hub_preset_copy;\n\thashtab_store(x->hash_internals, gensym(\"preset\/copy\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/store\",\t\t\t\t\"msg_list\",\t\t\"none\",\t\"Store a preset by number in memory.  All presets present in memory will be written to disk when you send a save_settings message to the module.\");\n\tanObject->action = (method)hub_preset_store;\n\thashtab_store(x->hash_internals, gensym(\"preset\/store\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/storenext\",\t\t\t\"msg_list\",\t\t\"none\",\t\"Store a preset in the next preset slot.  Handy so that you do not need to specify a preset number manually.\");\n\tanObject->action = (method)hub_preset_store_next;\n\thashtab_store(x->hash_internals, gensym(\"preset\/storenext\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/interpolate\",\t\t\"msg_list\",\t\t\"none\",\t\"Interpolate between two named presets (argument 1 and 2) using a ratio (float in the range [0.0, 1.0]) specified as the third argument.\");\n\tanObject->action = (method)hub_preset_interpolate;\n\thashtab_store(x->hash_internals, gensym(\"preset\/interpolate\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/default\",\t\t\t\"msg_none\",\t\t\"none\",\t\"Open the default preset file and recall the first preset in that file.\");\n\tanObject->action = (method)hub_preset_default;\n\thashtab_store(x->hash_internals, gensym(\"preset\/default\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/clear\",\t\t\t\t\"msg_none\",\t\t\"none\",\t\"This is the same preset\/default.\");\n\tanObject->action = (method)hub_presets_clear;\n\thashtab_store(x->hash_internals, gensym(\"preset\/clear\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"preset\/post\",\t\t\t\t\"msg_none\",\t\t\"none\",\t\"Post all presets to the Max window.\");\n\tanObject->action = (method)hub_presets_dump;\n\thashtab_store(x->hash_internals, gensym(\"preset\/post\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.parameter\",\t\"ui\/freeze\",\t\t\t\t\"msg_toggle\",\t\"none\",\t\"Turn off the updating of user interface elements when parameters change.  This may be done to conserve CPU resources.\");\n\tanObject->action = (method)hub_ui_freeze;\n\thashtab_store(x->hash_internals, gensym(\"ui\/freeze\"), (t_object*)anObject);\n\n\tanObject = new hubInternalObject(\"jcom.message\", \t\"ui\/refresh\",\t\t\t\t\"msg_none\",\t\t\"none\",\t\"Update displayed values for module to reflect current state.\");\n\tanObject->action = (method)hub_ui_refresh;\n\thashtab_store(x->hash_internals, gensym(\"ui\/refresh\"), (t_object*)anObject);\n}\n\n\nvoid hub_internals_destroy(t_hub *x)\n{\n\tlong\t\t\t\ti;\n\tlong\t\t\t\tnumKeys;\n\tt_symbol\t\t\t**keys;\n\thubInternalObject\t*anObject;\n\tt_max_err\t\t\terr;\n\t\n\thashtab_getkeys(x->hash_internals, &numKeys, &keys);\n\tfor(i=0; i<numKeys; i++){\n\t\terr = hashtab_lookup(x->hash_internals, keys[i], (t_object**)&anObject);\n\t\tif(!err)\n\t\t\tdelete anObject;\n\t}\n\thashtab_chuck(x->hash_internals);\n}\n\n\nvoid hub_internals_dispatch(t_hub *x, t_symbol *osc_name, long argc, t_atom *argv)\n{\n\thubInternalObject\t*theObject;\n\tt_max_err\t\t\terr;\n\t\n\terr = hashtab_lookup(x->hash_internals, osc_name, (t_object**)&theObject);\n\tif(!err)\n\t\ttheObject->action(x, osc_name, argc, argv);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/  File: cloud_auth_unittests.cc\n\/\/  Author: Tom Roeder <tmroeder@google.com>\n\/\/\n\/\/  Description: Basic tests for the CloudAuth class.\n\/\/\n\/\/  Copyright (c) 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 <stdlib.h>\n\n#include <fstream>\n\n#include <gtest\/gtest.h>\n#include <glog\/logging.h>\n#include <keyczar\/keyczar.h>\n\n#include \"cloudproxy\/cloud_auth.h\"\n#include \"cloudproxy\/util.h\"\n#include \"tao\/fake_tao.h\"\n#include \"tao\/util.h\"\n\nusing cloudproxy::CloudAuth;\nusing cloudproxy::ACL;\nusing cloudproxy::Action;\nusing cloudproxy::SignedACL;\n\nusing keyczar::Keyczar;\n\nusing std::ofstream;\n\nusing tao::CreateTempPubKey;\nusing tao::ScopedTempDir;\nusing tao::SignData;\n\nclass CloudAuthTest : public ::testing::Test {\n protected:\n  virtual void SetUp() {\n    EXPECT_TRUE(CreateTempPubKey(&temp_dir_, &policy_public_key_))\n      << \"Could not create a public key\";\n\n    \/\/ Set up a simple ACL to query.\n    ACL acl;\n    Action *a1 = acl.add_permissions();\n    a1->set_subject(\"tmroeder\");\n    a1->set_verb(cloudproxy::ADMIN);\n\n    Action *a2 = acl.add_permissions();\n    a2->set_subject(\"jlm\");\n    a2->set_verb(cloudproxy::CREATE);\n    a2->set_object(\"\/files\");\n\n    SignedACL sacl;\n    string *ser = sacl.mutable_serialized_acls();\n    EXPECT_TRUE(acl.SerializeToString(ser)) << \"Could not serialize ACL\";\n\n    string *sig = sacl.mutable_signature();\n    EXPECT_TRUE(SignData(*ser, sig, policy_public_key_.get()))\n      << \"Could not sign the serialized ACL with the policy key\";\n\n    string signed_whitelist_path = *temp_dir_ + string(\"\/signed_whitelist\");\n    ofstream whitelist_file(signed_whitelist_path.c_str(), ofstream::out);\n    ASSERT_TRUE(whitelist_file) << \"Could not open \" << signed_whitelist_path;\n\n    EXPECT_TRUE(sacl.SerializeToOstream(&whitelist_file))\n      << \"Could not write the signed whitelist to a file\";\n\n    whitelist_file.close();\n\n    cloud_auth_.reset(new CloudAuth(signed_whitelist_path,\n                                    policy_public_key_.get()));\n  }\n\n  scoped_ptr<CloudAuth> cloud_auth_;\n  scoped_ptr<Keyczar> policy_public_key_;\n  ScopedTempDir temp_dir_;\n};\n\nTEST_F(CloudAuthTest, AdminTest) {\n  \/\/ Admin privileges should allow tmroeder to perform any operation.\n  EXPECT_TRUE(cloud_auth_->Permitted(\"tmroeder\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Permitted(\"tmroeder\", cloudproxy::DESTROY,\n                                     \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Permitted(\"tmroeder\", cloudproxy::READ, \"\/files_2\"));\n  EXPECT_TRUE(cloud_auth_->Permitted(\"tmroeder\", cloudproxy::WRITE, \"\/asdf\"));\n}\n\nTEST_F(CloudAuthTest, UnknownUserTest) {\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::DESTROY,\n                                     \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::READ, \"\/files_2\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::WRITE, \"\/asdf\"));\n}\n\nTEST_F(CloudAuthTest, LimitedUserTest) {\n  \/\/ A user with limited permissions should only be allowed those permissions.\n  EXPECT_TRUE(cloud_auth_->Permitted(\"jlm\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"jlm\", cloudproxy::DESTROY,\n                                     \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"jlm\", cloudproxy::READ, \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"jlm\", cloudproxy::WRITE, \"\/files\"));\n}\n\nTEST_F(CloudAuthTest, AddPermissionsTest) {\n  \/\/ Permissions can be added to the ACL\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Insert(\"jlm\", cloudproxy::DESTROY, \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Permitted(\"jlm\", cloudproxy::DESTROY, \"\/files\"));\n  \n}\n<commit_msg>Added more tests for CloudAuth<commit_after>\/\/  File: cloud_auth_unittests.cc\n\/\/  Author: Tom Roeder <tmroeder@google.com>\n\/\/\n\/\/  Description: Basic tests for the CloudAuth class.\n\/\/\n\/\/  Copyright (c) 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 <stdlib.h>\n\n#include <fstream>\n\n#include <gtest\/gtest.h>\n#include <glog\/logging.h>\n#include <keyczar\/keyczar.h>\n\n#include \"cloudproxy\/cloud_auth.h\"\n#include \"cloudproxy\/util.h\"\n#include \"tao\/fake_tao.h\"\n#include \"tao\/util.h\"\n\nusing cloudproxy::CloudAuth;\nusing cloudproxy::ACL;\nusing cloudproxy::Action;\nusing cloudproxy::SignedACL;\n\nusing keyczar::Keyczar;\n\nusing std::ofstream;\n\nusing tao::CreateTempPubKey;\nusing tao::ScopedTempDir;\nusing tao::SignData;\n\nclass CloudAuthTest : public ::testing::Test {\n protected:\n  virtual void SetUp() {\n    EXPECT_TRUE(CreateTempPubKey(&temp_dir_, &policy_public_key_))\n      << \"Could not create a public key\";\n\n    \/\/ Set up a simple ACL to query.\n    ACL acl;\n    Action *a1 = acl.add_permissions();\n    a1->set_subject(\"tmroeder\");\n    a1->set_verb(cloudproxy::ADMIN);\n\n    Action *a2 = acl.add_permissions();\n    a2->set_subject(\"jlm\");\n    a2->set_verb(cloudproxy::CREATE);\n    a2->set_object(\"\/files\");\n\n    SignedACL sacl;\n    string *ser = sacl.mutable_serialized_acls();\n    EXPECT_TRUE(acl.SerializeToString(ser)) << \"Could not serialize ACL\";\n\n    string *sig = sacl.mutable_signature();\n    EXPECT_TRUE(SignData(*ser, sig, policy_public_key_.get()))\n      << \"Could not sign the serialized ACL with the policy key\";\n\n    string signed_whitelist_path = *temp_dir_ + string(\"\/signed_whitelist\");\n    ofstream whitelist_file(signed_whitelist_path.c_str(), ofstream::out);\n    ASSERT_TRUE(whitelist_file) << \"Could not open \" << signed_whitelist_path;\n\n    EXPECT_TRUE(sacl.SerializeToOstream(&whitelist_file))\n      << \"Could not write the signed whitelist to a file\";\n\n    whitelist_file.close();\n\n    cloud_auth_.reset(new CloudAuth(signed_whitelist_path,\n                                    policy_public_key_.get()));\n  }\n\n  scoped_ptr<CloudAuth> cloud_auth_;\n  scoped_ptr<Keyczar> policy_public_key_;\n  ScopedTempDir temp_dir_;\n};\n\nTEST_F(CloudAuthTest, AdminTest) {\n  \/\/ Admin privileges should allow tmroeder to perform any operation.\n  EXPECT_TRUE(cloud_auth_->Permitted(\"tmroeder\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Permitted(\"tmroeder\", cloudproxy::DESTROY,\n                                     \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Permitted(\"tmroeder\", cloudproxy::READ, \"\/files_2\"));\n  EXPECT_TRUE(cloud_auth_->Permitted(\"tmroeder\", cloudproxy::WRITE, \"\/asdf\"));\n}\n\nTEST_F(CloudAuthTest, UnknownUserTest) {\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::DESTROY,\n                                     \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::READ, \"\/files_2\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::WRITE, \"\/asdf\"));\n}\n\nTEST_F(CloudAuthTest, LimitedUserTest) {\n  \/\/ A user with limited permissions should only be allowed those permissions.\n  EXPECT_TRUE(cloud_auth_->Permitted(\"jlm\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"jlm\", cloudproxy::DESTROY,\n                                     \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"jlm\", cloudproxy::READ, \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"jlm\", cloudproxy::WRITE, \"\/files\"));\n}\n\nTEST_F(CloudAuthTest, AddPermissionsTest) {\n  \/\/ Permissions can be added to the ACL\n  EXPECT_FALSE(cloud_auth_->Permitted(\"unknown_user\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Insert(\"jlm\", cloudproxy::DESTROY, \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Permitted(\"jlm\", cloudproxy::DESTROY, \"\/files\"));\n}\n\nTEST_F(CloudAuthTest, DeletePermissionsTest) {\n  EXPECT_TRUE(cloud_auth_->Permitted(\"jlm\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_TRUE(cloud_auth_->Delete(\"jlm\", cloudproxy::CREATE, \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Permitted(\"jlm\", cloudproxy::CREATE, \"\/files\"));\n}\n\nTEST_F(CloudAuthTest, DeletePermissionsFailTest) {\n  \/\/ You can't delete permissions that aren't there.\n  EXPECT_FALSE(cloud_auth_->Delete(\"jlm\", cloudproxy::READ, \"\/files\"));\n  EXPECT_FALSE(cloud_auth_->Delete(\"jlm\", cloudproxy::CREATE, \"\/files_2\"));\n  EXPECT_FALSE(cloud_auth_->Delete(\"tmroeder\", cloudproxy::CREATE, \"\/files\"));\n}\n\nTEST_F(CloudAuthTest, SerializeTest) {\n  string serialized_auth;\n  EXPECT_TRUE(cloud_auth_->Serialize(&serialized_auth));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <string.h>\n#include <stdlib.h>\n#include <string>\n#include \"core\/error.h\"\n#include \"core\/package\/load.h\"\n\nusing namespace std;\n\ninline void\nInkWarn_Unknown_Argument(const char *name)\n{\n\tInkWarn_doPrintWarning(\"Ink Packer: Unknown argument \\\"$(name)\\\"\", name);\n\treturn;\n}\n\ninline void\nInkWarn_Excess_Argument(const char *name)\n{\n\tInkWarn_doPrintWarning(\"Ink Packer: Excess argument \\\"$(name)\\\"\", name);\n\treturn;\n}\n\ninline void\nInkErr_No_Lib_Given()\n{\n\tInkErr_doPrintError(\"Ink Packer: No library file given\");\n\treturn;\n}\n\ninline void\nInkErr_No_Dest_Given()\n{\n\tInkErr_doPrintError(\"Ink Packer: No output file given\");\n\treturn;\n}\n\ninline void\nInkErr_Could_Not_Create_File(const char *path)\n{\n\tInkErr_doPrintError(\"Ink Packer: Couldn't create file $(path)\", path);\n\treturn;\n}\n\nenum Instr {\n\tUNKNOWN = 0,\n\tPACKAGE_NAME,\n\tAUTHOR\n};\n\nclass Argument {\npublic:\n\tInstr instr;\n\tchar *arg;\n\n\tArgument(char *origin)\n\t{\n\t\tint i, len = strlen(origin), start;\n\t\tstring instr_str;\n\n\t\tfor (i = 0; i < len && origin[i] == '-'; i++) ;\n\t\tstart = i;\n\n\t\tfor (; i < len; i++) {\n\t\t\tif (origin[i] == '=') {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\targ = NULL;\n\t\tif (i < len) {\n\t\t\tinstr_str = string(origin).substr(start, i - 2);\n\t\t} else {\n\t\t\tinstr_str = string(origin).substr(start);\n\t\t\treturn;\n\t\t}\n\n\t\tif (!strcmp(instr_str.c_str(), \"package-name\")) {\n\t\t\tinstr = PACKAGE_NAME;\n\t\t} else if (!strcmp(instr_str.c_str(), \"author\")) {\n\t\t\tinstr = AUTHOR;\n\t\t} else {\n\t\t\tinstr = UNKNOWN;\n\t\t\tInkWarn_Unknown_Argument(instr_str.c_str());\n\t\t\treturn;\n\t\t}\n\n\t\targ = (char *)malloc(sizeof(char) * (len - i));\n\t\tstrcpy(arg, string(origin).substr(i + 1, len - i - 1).c_str());\n\t}\n\n\t~Argument()\n\t{\n\t\tif (arg)\n\t\t\tfree(arg);\n\t}\n};\n\n#define MAX_ARG_COUNT 1000\n\nint main(int argc, char **argv)\n{\n\tint i, argi = 0;\n\tconst char *so_file = NULL, *pack_name = \"Unknown\", *author = \"Anonymous\";\n\tchar *target = NULL;\n\tArgument *arg[MAX_ARG_COUNT];\n\n\tfor (i = 1; i < argc; i++) {\n\t\tif (argv[i][0] != '-') {\n\t\t\tif (!so_file)\n\t\t\t\tso_file = argv[i];\n\t\t\telse if (!target)\n\t\t\t\ttarget = argv[i];\n\t\t\telse InkWarn_Excess_Argument(argv[i]);\n\t\t} else {\n\t\t\targ[argi++] = new Argument(argv[i]);\n\t\t}\n\t}\n\n\tfor (i = 0; i < argi; i++) {\n\t\tif (arg[i]->instr == PACKAGE_NAME) {\n\t\t\tpack_name = arg[i]->arg;\n\t\t} else if (arg[i]->instr == PACKAGE_NAME) {\n\t\t\tauthor = arg[i]->arg;\n\t\t}\n\t}\n\n\tif (!so_file) {\n\t\tInkErr_No_Lib_Given();\n\t\t\/\/ unreachable\n\t}\n\n\tif (!target) {\n\t\tInkErr_No_Dest_Given();\n\t\t\/\/ unreachable\n\t}\n\n\tFILE *fp;\n\tfp = fopen(target, \"wb\");\n\n\tif (!fp) {\n\t\tInkErr_Could_Not_Create_File(target);\n\t\t\/\/ unreachable\n\t}\n\n\tInk_Package *pack = new Ink_Package(pack_name, author, so_file);\n\tpack->writeTo(fp);\n\tfflush(fp);\n\tfclose(fp);\n\t\n\treturn 0;\n}<commit_msg>090116#09: a little problem in ink packer<commit_after>#include <string.h>\n#include <stdlib.h>\n#include <string>\n#include \"core\/error.h\"\n#include \"core\/package\/load.h\"\n\nusing namespace std;\n\ninline void\nInkWarn_Unknown_Argument(const char *name)\n{\n\tInkWarn_doPrintWarning(\"Ink Packer: Unknown argument \\\"$(name)\\\"\", name);\n\treturn;\n}\n\ninline void\nInkWarn_Excess_Argument(const char *name)\n{\n\tInkWarn_doPrintWarning(\"Ink Packer: Excess argument \\\"$(name)\\\"\", name);\n\treturn;\n}\n\ninline void\nInkErr_No_Lib_Given()\n{\n\tInkErr_doPrintError(\"Ink Packer: No library file given\");\n\treturn;\n}\n\ninline void\nInkErr_No_Dest_Given()\n{\n\tInkErr_doPrintError(\"Ink Packer: No output file given\");\n\treturn;\n}\n\ninline void\nInkErr_Could_Not_Create_File(const char *path)\n{\n\tInkErr_doPrintError(\"Ink Packer: Couldn't create file $(path)\", path);\n\treturn;\n}\n\nenum Instr {\n\tUNKNOWN = 0,\n\tPACKAGE_NAME,\n\tAUTHOR\n};\n\nclass Argument {\npublic:\n\tInstr instr;\n\tchar *arg;\n\n\tArgument(char *origin)\n\t{\n\t\tint i, len = strlen(origin), start;\n\t\tstring instr_str;\n\n\t\tfor (i = 0; i < len && origin[i] == '-'; i++) ;\n\t\tstart = i;\n\n\t\tfor (; i < len; i++) {\n\t\t\tif (origin[i] == '=') {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\targ = NULL;\n\t\tif (i < len) {\n\t\t\tinstr_str = string(origin).substr(start, i - 2);\n\t\t} else {\n\t\t\tinstr_str = string(origin).substr(start);\n\t\t\treturn;\n\t\t}\n\n\t\tif (!strcmp(instr_str.c_str(), \"package-name\")) {\n\t\t\tinstr = PACKAGE_NAME;\n\t\t} else if (!strcmp(instr_str.c_str(), \"author\")) {\n\t\t\tinstr = AUTHOR;\n\t\t} else {\n\t\t\tinstr = UNKNOWN;\n\t\t\tInkWarn_Unknown_Argument(instr_str.c_str());\n\t\t\treturn;\n\t\t}\n\n\t\targ = (char *)malloc(sizeof(char) * (len - i));\n\t\tstrcpy(arg, string(origin).substr(i + 1, len - i - 1).c_str());\n\t}\n\n\t~Argument()\n\t{\n\t\tif (arg)\n\t\t\tfree(arg);\n\t}\n};\n\n#define MAX_ARG_COUNT 1000\n\nint main(int argc, char **argv)\n{\n\tint i, argi = 0;\n\tconst char *so_file = NULL, *pack_name = \"Unknown\", *author = \"Anonymous\";\n\tchar *target = NULL;\n\tArgument *arg[MAX_ARG_COUNT];\n\n\tfor (i = 1; i < argc; i++) {\n\t\tif (argv[i][0] != '-') {\n\t\t\tif (!so_file)\n\t\t\t\tso_file = argv[i];\n\t\t\telse if (!target)\n\t\t\t\ttarget = argv[i];\n\t\t\telse InkWarn_Excess_Argument(argv[i]);\n\t\t} else {\n\t\t\targ[argi++] = new Argument(argv[i]);\n\t\t}\n\t}\n\n\tfor (i = 0; i < argi; i++) {\n\t\tif (arg[i]->instr == PACKAGE_NAME) {\n\t\t\tpack_name = arg[i]->arg;\n\t\t} else if (arg[i]->instr == AUTHOR) {\n\t\t\tauthor = arg[i]->arg;\n\t\t}\n\t}\n\n\tif (!so_file) {\n\t\tInkErr_No_Lib_Given();\n\t\t\/\/ unreachable\n\t}\n\n\tif (!target) {\n\t\tInkErr_No_Dest_Given();\n\t\t\/\/ unreachable\n\t}\n\n\tFILE *fp;\n\tfp = fopen(target, \"wb\");\n\n\tif (!fp) {\n\t\tInkErr_Could_Not_Create_File(target);\n\t\t\/\/ unreachable\n\t}\n\n\tInk_Package *pack = new Ink_Package(pack_name, author, so_file);\n\tpack->writeTo(fp);\n\tfflush(fp);\n\tfclose(fp);\n\t\n\treturn 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Dragable.cpp\n *\n *  Created on: Jan 24, 2015\n *      Author: dawid\n *\/\n\n#include \"Draggable.h\"\n\n#include <cocos2d.h>\n\n#include <component\/touch\/drag\/OnDragEvent.h>\n#include <component\/ComponentManager.h>\n#include <component\/builder\/Flags.h>\n#include <component\/touch\/TouchableEvents.h>\n\nnamespace Dexode\n{\nnamespace Component\n{\n\nvoid Draggable::onTouchBegan(cocos2d::Touch* touch)\n{\n\t_startPosition = getWorkingNode()->getPosition();\n\tif (_onTouchBegan)\n\t{\n\t\tOnDragEvent event;\n\t\tevent.node = getWorkingNode();\n\t\tevent.touch = touch;\n\t\tevent.startPosition = _startPosition;\n\t\t_onTouchBegan(event);\n\t}\n}\n\nvoid Draggable::onTouchMoved(cocos2d::Touch* touch)\n{\n\tif ((_flags & Config::Draggable::MOVING_ONLY_X) != 0)\n\t{\n\t\tgetWorkingNode()->setPositionX(_startPosition.x - (touch->getStartLocation().x - touch->getLocation().x));\n\t}\n\telse\n\t{\n\t\tgetWorkingNode()->setPosition(_startPosition - (touch->getStartLocation() - touch->getLocation()));\n\t}\n\n\tif (_onTouchMoved)\n\t{\n\t\tOnDragEvent event;\n\t\tevent.node = getWorkingNode();\n\t\tevent.touch = touch;\n\t\tevent.startPosition = _startPosition;\n\t\t_onTouchMoved(event);\n\t}\n}\n\nvoid Draggable::onTouchEnded(cocos2d::Touch* touch)\n{\n\tif ((_flags & Config::Draggable::DO_NOT_RESTORE_POSITION_ON_END)\n\t\t!= Config::Draggable::DO_NOT_RESTORE_POSITION_ON_END)\n\t{\n\t\tgetWorkingNode()->setPosition(_startPosition);\n\t}\n\n\tif (_onTouchEnded)\n\t{\n\t\tOnDragEvent event;\n\t\tevent.node = getWorkingNode();\n\t\tevent.touch = touch;\n\t\tevent.startPosition = _startPosition;\n\t\t_onTouchEnded(event);\n\t}\n}\n\nvoid Draggable::setListeners(const OnTouch& onTouchBegan, const OnTouch& onTouchMoved, const OnTouch& onTouchEnded)\n{\n\t_onTouchBegan = onTouchBegan;\n\t_onTouchMoved = onTouchMoved;\n\t_onTouchEnded = onTouchEnded;\n}\n\nvoid Draggable::setFlags(int flags)\n{\n\t_flags = flags;\n}\n\nvoid Draggable::onAttach()\n{\n\tinherited::onAttach();\n\t_collector = listenForTouches(this);\n}\n\nvoid Draggable::onDetach()\n{\n\t_collector.unlistenAll();\n\tinherited::onDetach();\n}\n\n} \/* namespace Component *\/\n} \/* namespace Dexode *\/\n<commit_msg>Fix Draggable<commit_after>\/*\n * Dragable.cpp\n *\n *  Created on: Jan 24, 2015\n *      Author: dawid\n *\/\n\n#include \"Draggable.h\"\n\n#include <cocos2d.h>\n\n#include <component\/touch\/drag\/OnDragEvent.h>\n#include <component\/ComponentManager.h>\n#include <component\/builder\/Flags.h>\n#include <component\/touch\/TouchableEvents.h>\n\nnamespace Dexode\n{\nnamespace Component\n{\n\nvoid Draggable::onTouchBegan(cocos2d::Touch* touch)\n{\n\t_startPosition = getWorkingNode()->getPosition();\n\tif (_onTouchBegan)\n\t{\n\t\tOnDragEvent event;\n\t\tevent.node = getWorkingNode();\n\t\tevent.touch = touch;\n\t\tevent.startPosition = _startPosition;\n\t\t_onTouchBegan(event);\n\t}\n}\n\nvoid Draggable::onTouchMoved(cocos2d::Touch* touch)\n{\n\tif ((_flags & Config::Draggable::MOVING_ONLY_X) != 0)\n\t{\n\t\tgetWorkingNode()->setPositionX(_startPosition.x - (touch->getStartLocation().x - touch->getLocation().x));\n\t}\n\telse\n\t{\n\t\tgetWorkingNode()->setPosition(_startPosition - (touch->getStartLocation() - touch->getLocation()));\n\t}\n\n\tif (_onTouchMoved)\n\t{\n\t\tOnDragEvent event;\n\t\tevent.node = getWorkingNode();\n\t\tevent.touch = touch;\n\t\tevent.startPosition = _startPosition;\n\t\t_onTouchMoved(event);\n\t}\n}\n\nvoid Draggable::onTouchEnded(cocos2d::Touch* touch)\n{\n\tif (_onTouchEnded)\n\t{\n\t\tOnDragEvent event;\n\t\tevent.node = getWorkingNode();\n\t\tevent.touch = touch;\n\t\tevent.startPosition = _startPosition;\n\t\t_onTouchEnded(event);\n\t}\n\n\tif ((_flags & Config::Draggable::DO_NOT_RESTORE_POSITION_ON_END)\n\t\t!= Config::Draggable::DO_NOT_RESTORE_POSITION_ON_END)\n\t{\n\t\tgetWorkingNode()->setPosition(_startPosition);\n\t}\n}\n\nvoid Draggable::setListeners(const OnTouch& onTouchBegan, const OnTouch& onTouchMoved, const OnTouch& onTouchEnded)\n{\n\t_onTouchBegan = onTouchBegan;\n\t_onTouchMoved = onTouchMoved;\n\t_onTouchEnded = onTouchEnded;\n}\n\nvoid Draggable::setFlags(int flags)\n{\n\t_flags = flags;\n}\n\nvoid Draggable::onAttach()\n{\n\tinherited::onAttach();\n\t_collector = listenForTouches(this);\n}\n\nvoid Draggable::onDetach()\n{\n\t_collector.unlistenAll();\n\tinherited::onDetach();\n}\n\n} \/* namespace Component *\/\n} \/* namespace Dexode *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014 Project Vogue. 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 \"elang\/compiler\/testing\/compiler_test.h\"\n\nnamespace elang {\nnamespace compiler {\nnamespace {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ NamespaceAnalyzerTest\n\/\/\nclass NamespaceAnalyzerTest : public testing::CompilerTest {\n protected:\n  NamespaceAnalyzerTest() = default;\n  ~NamespaceAnalyzerTest() override = default;\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(NamespaceAnalyzerTest);\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Alias resolution\n\/\/\nTEST_F(NamespaceAnalyzerTest, AliasBasic) {\n  Prepare(\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 { using C = N1.N2.A; class B : C {} }\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"N1.N2.A\", GetBaseClasses(\"N3.B\"));\n}\n\n\/\/ Same as |AliasBasic|, but order of declaration is different.\nTEST_F(NamespaceAnalyzerTest, AliasLayout) {\n  Prepare(\n      \"namespace N3 { using C = N1.N2.A; class B : C {} }\"\n      \"namespace N1.N2 { class A {} }\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"N1.N2.A\", GetBaseClasses(\"N3.B\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasExtent) {\n  Prepare(\n      \"using R = N1.N2;\"\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 { class B : R.A {} }\"\n      \"namespace N3 { class C : R.A {} }\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"N1.N2.A\", GetBaseClasses(\"N3.B\"));\n  EXPECT_EQ(\"N1.N2.A\", GetBaseClasses(\"N3.C\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasToAlias) {\n  Prepare(\n      \"using R1 = A.B;\"\n      \"class A { class B { class C {} } }\"\n      \"namespace N1 {\"\n      \"  using R2 = R1;\"\n      \"  class D : R2.C {}\"\n      \"}\");\n  ASSERT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"A.B.C\", GetBaseClasses(\"N1.D\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasToAliasDeep) {\n  Prepare(\n      \"using R1 = N1.N2.A.B;\"\n      \"namespace N1 {\"\n      \"  using R2 = R1;\"\n      \"  class D : R2.C {}\"\n      \"  namespace N2 {\"\n      \"     class A { class B { class C {} } }\"\n      \"  }\"\n      \"}\");\n  ASSERT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"N1.N2.A.B.C\", GetBaseClasses(\"N1.D\"));\n}\n\n\/\/ Note: MS C# compiler doesn't report error if alias A isn't used.\nTEST_F(NamespaceAnalyzerTest, AliasErrorAmbiguous) {\n  Prepare(\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 { class A {} }\"\n      \"namespace N3 {\"\n      \"  using A = N1.N2.A;\"\n      \"  class B : A {}\"  \/\/ A can be N1.N2.A or N3.A.\n      \"}\");\n  EXPECT_EQ(\"NameResolution.Name.Ambiguous(103) A\\n\",\n            AnalyzeNamespace());\n}\n\n\/\/ Scope of using alias directive is limited into namespace body.\nTEST_F(NamespaceAnalyzerTest, AliasErrorScope) {\n  Prepare(\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 { using R = N1.N2; }\"\n      \"namespace N3 { class B : R.A {} }\");  \/\/ Error: R unknown\n  EXPECT_EQ(\"NameResolution.Name.NotResolved(88) R\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasErrorScopeHide) {\n  Prepare(\n      \"using R = N1.N2;\"\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 {\"\n      \"  class R {}\"        \/\/ Class R hides alias R in toplevel.\n      \"  class B : R.A {}\"  \/\/ Error: R has no member A.\n      \"}\");\n  EXPECT_EQ(\"NameResolution.Name.NotResolved(86) A\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasErrorScopeResolution) {\n  Prepare(\n      \"namespace N1.N2 {}\"\n      \"namespace N3 {\"\n      \"  using R1 = N1;\"\n      \"  using R2 = N1.N2;\"\n      \"  using R3 = R1.N2;\"  \/\/ Error: R1 is unknown.\n      \"}\");\n  EXPECT_EQ(\"NameResolution.Name.NotResolved(80) R1\\n\",\n            AnalyzeNamespace());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Class resolution\n\/\/\nTEST_F(NamespaceAnalyzerTest, ClassBasic) {\n  Prepare(\"class A : C {} class B : A {} class C {}\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"C\", GetBaseClasses(\"A\"));\n  EXPECT_EQ(\"A\", GetBaseClasses(\"B\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassNested) {\n  Prepare(\"class A { class B {} }\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"System.Object\", GetBaseClasses(\"A\"));\n  EXPECT_EQ(\"System.Object\", GetBaseClasses(\"A.B\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseNotInterface) {\n  Prepare(\n      \"class A : B, C {}\"  \/\/ C must be an interface.\n      \"class B {}\"\n      \"class C {}\");\n  EXPECT_EQ(\"NameResolution.Name.NotInterface(13) C\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseClassIsInterface) {\n  Prepare(\n      \"class A : B, C {}\"\n      \"interface B {}\"\n      \"class C {}\");\n  EXPECT_EQ(\"NameResolution.Name.NotInterface(13) C\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseClassIsStruct) {\n  Prepare(\n      \"class A : B {}\"\n      \"struct B {}\");\n  EXPECT_EQ(\"NameResolution.Name.NeitherClassNorInterface(10) B\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseClassIsNamespace) {\n  Prepare(\"namespace N1 { class A : N1 {} }\");\n  EXPECT_EQ(\"NameResolution.Name.NeitherClassNorInterface(25) N1\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorCircularlyDependency) {\n  Prepare(\n      \"class A : B {}\"\n      \"class B : C {}\"\n      \"class C : A {}\");\n  EXPECT_EQ(\n      \"NameResolution.Name.Cycle(6) A C\\n\"\n      \"NameResolution.Name.Cycle(20) B A\\n\"\n      \"NameResolution.Name.Cycle(34) C B\\n\",\n      AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorCircularlyDependencyNested) {\n  Prepare(\n      \"class A : B.C {}\"     \/\/ A depends on B and C.\n      \"class B : A {\"        \/\/ B depends on A.\n      \"  public class C {}\"  \/\/ C depends on B.\n      \"}\");\n  EXPECT_EQ(\n      \"NameResolution.Name.Cycle(6) A B\\n\"\n      \"NameResolution.Name.Cycle(22) B C\\n\"\n      \"NameResolution.Name.Cycle(44) C A\\n\",\n      AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorNestedDependency) {\n  Prepare(\"class A { class B : A {} }\");\n  EXPECT_EQ(\"NameResolution.Class.Containing(20) A B\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorSelfReference) {\n  Prepare(\"class A : A {}\");\n  EXPECT_EQ(\"NameResolution.Name.Cycle(6) A A\\n\",\n            AnalyzeNamespace());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Predefined types\n\/\/\nTEST_F(NamespaceAnalyzerTest, PredefinedTypes) {\n  Prepare(\"class A {}\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"\", GetBaseClasses(\"System.Object\"));\n  EXPECT_EQ(\"System.Object\", GetBaseClasses(\"System.Value\"));\n  EXPECT_EQ(\"System.Value\", GetBaseClasses(\"System.Bool\"));\n  EXPECT_EQ(\"System.Value\", GetBaseClasses(\"System.Void\"));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace compiler\n}  \/\/ namespace elang\n<commit_msg>elang\/compiler\/analyze: Introduce |struct| and |interface| test case to |NamespaceAnalyzer|.<commit_after>\/\/ Copyright 2014 Project Vogue. 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 \"elang\/compiler\/testing\/compiler_test.h\"\n\nnamespace elang {\nnamespace compiler {\nnamespace {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ NamespaceAnalyzerTest\n\/\/\nclass NamespaceAnalyzerTest : public testing::CompilerTest {\n protected:\n  NamespaceAnalyzerTest() = default;\n  ~NamespaceAnalyzerTest() override = default;\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(NamespaceAnalyzerTest);\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Alias resolution\n\/\/\nTEST_F(NamespaceAnalyzerTest, AliasBasic) {\n  Prepare(\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 { using C = N1.N2.A; class B : C {} }\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"N1.N2.A\", GetBaseClasses(\"N3.B\"));\n}\n\n\/\/ Same as |AliasBasic|, but order of declaration is different.\nTEST_F(NamespaceAnalyzerTest, AliasLayout) {\n  Prepare(\n      \"namespace N3 { using C = N1.N2.A; class B : C {} }\"\n      \"namespace N1.N2 { class A {} }\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"N1.N2.A\", GetBaseClasses(\"N3.B\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasExtent) {\n  Prepare(\n      \"using R = N1.N2;\"\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 { class B : R.A {} }\"\n      \"namespace N3 { class C : R.A {} }\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"N1.N2.A\", GetBaseClasses(\"N3.B\"));\n  EXPECT_EQ(\"N1.N2.A\", GetBaseClasses(\"N3.C\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasToAlias) {\n  Prepare(\n      \"using R1 = A.B;\"\n      \"class A { class B { class C {} } }\"\n      \"namespace N1 {\"\n      \"  using R2 = R1;\"\n      \"  class D : R2.C {}\"\n      \"}\");\n  ASSERT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"A.B.C\", GetBaseClasses(\"N1.D\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasToAliasDeep) {\n  Prepare(\n      \"using R1 = N1.N2.A.B;\"\n      \"namespace N1 {\"\n      \"  using R2 = R1;\"\n      \"  class D : R2.C {}\"\n      \"  namespace N2 {\"\n      \"     class A { class B { class C {} } }\"\n      \"  }\"\n      \"}\");\n  ASSERT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"N1.N2.A.B.C\", GetBaseClasses(\"N1.D\"));\n}\n\n\/\/ Note: MS C# compiler doesn't report error if alias A isn't used.\nTEST_F(NamespaceAnalyzerTest, AliasErrorAmbiguous) {\n  Prepare(\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 { class A {} }\"\n      \"namespace N3 {\"\n      \"  using A = N1.N2.A;\"\n      \"  class B : A {}\"  \/\/ A can be N1.N2.A or N3.A.\n      \"}\");\n  EXPECT_EQ(\"NameResolution.Name.Ambiguous(103) A\\n\", AnalyzeNamespace());\n}\n\n\/\/ Scope of using alias directive is limited into namespace body.\nTEST_F(NamespaceAnalyzerTest, AliasErrorScope) {\n  Prepare(\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 { using R = N1.N2; }\"\n      \"namespace N3 { class B : R.A {} }\");  \/\/ Error: R unknown\n  EXPECT_EQ(\"NameResolution.Name.NotResolved(88) R\\n\", AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasErrorScopeHide) {\n  Prepare(\n      \"using R = N1.N2;\"\n      \"namespace N1.N2 { class A {} }\"\n      \"namespace N3 {\"\n      \"  class R {}\"        \/\/ Class R hides alias R in toplevel.\n      \"  class B : R.A {}\"  \/\/ Error: R has no member A.\n      \"}\");\n  EXPECT_EQ(\"NameResolution.Name.NotResolved(86) A\\n\", AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, AliasErrorScopeResolution) {\n  Prepare(\n      \"namespace N1.N2 {}\"\n      \"namespace N3 {\"\n      \"  using R1 = N1;\"\n      \"  using R2 = N1.N2;\"\n      \"  using R3 = R1.N2;\"  \/\/ Error: R1 is unknown.\n      \"}\");\n  EXPECT_EQ(\"NameResolution.Name.NotResolved(80) R1\\n\", AnalyzeNamespace());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Class resolution\n\/\/\nTEST_F(NamespaceAnalyzerTest, ClassBasic) {\n  Prepare(\"class A : C {} class B : A {} class C {}\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"C\", GetBaseClasses(\"A\"));\n  EXPECT_EQ(\"A\", GetBaseClasses(\"B\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassNested) {\n  Prepare(\"class A { class B {} }\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"System.Object\", GetBaseClasses(\"A\"));\n  EXPECT_EQ(\"System.Object\", GetBaseClasses(\"A.B\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseNotInterface) {\n  Prepare(\n      \"class A : B, C {}\"  \/\/ C must be an interface.\n      \"class B {}\"\n      \"class C {}\");\n  EXPECT_EQ(\"NameResolution.Name.NotInterface(13) C\\n\", AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseStruct) {\n  Prepare(\n      \"class A : S {}\"\n      \"struct S {}\");\n  EXPECT_EQ(\"NameResolution.Name.NeitherClassNorInterface(10) S\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseClassIsInterface) {\n  Prepare(\n      \"class A : B, C {}\"\n      \"interface B {}\"\n      \"class C {}\");\n  EXPECT_EQ(\"NameResolution.Name.NotInterface(13) C\\n\", AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseClassIsStruct) {\n  Prepare(\n      \"class A : B {}\"\n      \"struct B {}\");\n  EXPECT_EQ(\"NameResolution.Name.NeitherClassNorInterface(10) B\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorBaseClassIsNamespace) {\n  Prepare(\"namespace N1 { class A : N1 {} }\");\n  EXPECT_EQ(\"NameResolution.Name.NeitherClassNorInterface(25) N1\\n\",\n            AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorCircularlyDependency) {\n  Prepare(\n      \"class A : B {}\"\n      \"class B : C {}\"\n      \"class C : A {}\");\n  EXPECT_EQ(\n      \"NameResolution.Name.Cycle(6) A C\\n\"\n      \"NameResolution.Name.Cycle(20) B A\\n\"\n      \"NameResolution.Name.Cycle(34) C B\\n\",\n      AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorCircularlyDependencyNested) {\n  Prepare(\n      \"class A : B.C {}\"     \/\/ A depends on B and C.\n      \"class B : A {\"        \/\/ B depends on A.\n      \"  public class C {}\"  \/\/ C depends on B.\n      \"}\");\n  EXPECT_EQ(\n      \"NameResolution.Name.Cycle(6) A B\\n\"\n      \"NameResolution.Name.Cycle(22) B C\\n\"\n      \"NameResolution.Name.Cycle(44) C A\\n\",\n      AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorNestedDependency) {\n  Prepare(\"class A { class B : A {} }\");\n  EXPECT_EQ(\"NameResolution.Class.Containing(20) A B\\n\", AnalyzeNamespace());\n}\n\nTEST_F(NamespaceAnalyzerTest, ClassErrorSelfReference) {\n  Prepare(\"class A : A {}\");\n  EXPECT_EQ(\"NameResolution.Name.Cycle(6) A A\\n\", AnalyzeNamespace());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Interface\n\/\/\nTEST_F(NamespaceAnalyzerTest, InterfaceBasic) {\n  Prepare(\n      \"interface I {}\"\n      \"interface J {}\"\n      \"interface K : I, J {}\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"I, J\", GetBaseClasses(\"K\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, InterfaceErrorBaseClass) {\n  Prepare(\n      \"class A {}\"\n      \"interface I : A {}\");\n  EXPECT_EQ(\"NameResolution.Name.NotInterface(24) A\\n\", AnalyzeNamespace());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Predefined types\n\/\/\nTEST_F(NamespaceAnalyzerTest, PredefinedTypes) {\n  Prepare(\"class A {}\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"\", GetBaseClasses(\"System.Object\"));\n  EXPECT_EQ(\"System.Object\", GetBaseClasses(\"System.Value\"));\n  EXPECT_EQ(\"System.Value\", GetBaseClasses(\"System.Bool\"));\n  EXPECT_EQ(\"System.Value\", GetBaseClasses(\"System.Void\"));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Struct\n\/\/\nTEST_F(NamespaceAnalyzerTest, StructBasic) {\n  Prepare(\n      \"interface I {}\"\n      \"interface J {}\"\n      \"struct S : I, J {}\");\n  EXPECT_EQ(\"\", AnalyzeNamespace());\n  EXPECT_EQ(\"System.Value, I, J\", GetBaseClasses(\"S\"));\n}\n\nTEST_F(NamespaceAnalyzerTest, StructErrorBaseClass) {\n  Prepare(\n      \"class A {}\"\n      \"struct S : A {}\");\n  EXPECT_EQ(\"NameResolution.Name.NotInterface(21) A\\n\", AnalyzeNamespace());\n}\n\n}  \/\/ namespace\n}  \/\/ namespace compiler\n}  \/\/ namespace elang\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file Debugger.cpp\n\n#include \"chi\/Debugger.hpp\"\n\n#include <chi\/Context.hpp>\n#include <chi\/LLVMVersion.hpp>\n#include <chi\/NameMangler.hpp>\n#include <chi\/NodeInstance.hpp>\n#include <chi\/Result.hpp>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/uuid\/uuid_io.hpp>\n\n#if LLVM_VERSION_LESS_EQUAL(3, 9)\n#include <llvm\/Bitcode\/ReaderWriter.h>\n#else\n#include <llvm\/Bitcode\/BitcodeWriter.h>\n#endif\n\n#include <llvm\/Support\/FileSystem.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/IR\/Module.h>\n\n#include <lldb\/API\/SBListener.h>\n#include <lldb\/API\/SBThread.h>\n\n#include <stdlib.h>  \/\/ for setenv\n\nnamespace fs = boost::filesystem;\n\nnamespace chi {\n\nDebugger::Debugger(const char* pathToChig, GraphModule& mod) : mModule{&mod} {\n\/\/ point it to lldb-server\n#if __linux__\n\tauto lldbServerPath = fs::path(pathToChig).parent_path() \/ \"lldb-server\";\n\tsetenv(\"LLDB_DEBUGSERVER_PATH\", lldbServerPath.c_str(), 1);\n#endif\n\n\tlldb::SBDebugger::Initialize();\n\tmDebugger = lldb::SBDebugger::Create();\n\n\t\/\/ set the logger to stderr for testing\n\tmDebugger.SetLoggingCallback(\n\t    [](const char* msg, void* dbg) {\n\t\t    std::cerr << msg;\n\t\t    std::cerr.flush();\n\t\t},\n\t    this);\n\n\tconst char* val[] = {\"api\", nullptr};\n\tmDebugger.EnableLog(\"lldb\", val);\n\n\t\/\/ create target\n\tmTarget = mDebugger.CreateTarget(pathToChig);\n}\n\nDebugger::~Debugger() { lldb::SBDebugger::Terminate(); }\n\nResult Debugger::terminate() {\n\tResult res;\n\n\tif (isAttached()) {\n\t\tauto err = mProcess.Kill();\n\n\t\tif (err.Fail()) {\n\t\t\tres.addEntry(\"EUKN\", \"Failed to terminate process\",\n\t\t\t             {{\"Error Code\", err.GetError()}, {\"Error String\", err.GetCString()}});\n\n\t\t\treturn res;\n\t\t}\n\t}\n\n\treturn res;\n}\n\nResult Debugger::processContinue() {\n\tResult res;\n\n\tif (isAttached()) {\n\t\tauto err = mProcess.Continue();\n\n\t\tif (err.Fail()) {\n\t\t\tres.addEntry(\"EUKN\", \"Failed to continue process\",\n\t\t\t             {{\"Error Code\", err.GetError()}, {\"Error String\", err.GetCString()}});\n\n\t\t\treturn res;\n\t\t}\n\t}\n\n\treturn res;\n}\nResult Debugger::pause() {\n\tResult res;\n\n\tif (isAttached()) {\n\t\tauto err = mProcess.Stop();\n\n\t\tif (err.Fail()) {\n\t\t\tres.addEntry(\"EUKN\", \"Failed to pause process\",\n\t\t\t             {{\"Error Code\", err.GetError()}, {\"Error String\", err.GetCString()}});\n\n\t\t\treturn res;\n\t\t}\n\t}\n\n\treturn res;\n}\n\nResult Debugger::setBreakpoint(NodeInstance& node, lldb::SBBreakpoint* bp) {\n\tResult res;\n\n\tint linenum = lineNumberFromNode(node);\n\n\t\/\/ create the breakpoint\n\tauto breakpoint = mTarget.BreakpointCreateByLocation(\n\t    node.module().sourceFilePath().string().c_str(), linenum);\n\n\t\/\/ make sure that it's good\n\tif (!breakpoint.IsValid()) {\n\t\tres.addEntry(\"EUKN\", \"Could not set breakpoint on node\",\n\t\t             {{\"nodeid\", node.stringId()},\n\t\t              {\"File Name\", node.module().sourceFilePath().string()},\n\t\t              {\"Line  Number\", linenum}});\n\n\t\treturn res;\n\t}\n\n\tmBreakpoints[&node] = breakpoint;\n\n\tif (bp != nullptr) { *bp = breakpoint; }\n\n\tbreakpoint.SetEnabled(true);\n\n\treturn res;\n}\n\nbool Debugger::removeBreakpoint(NodeInstance& node) {\n\tauto iter = mBreakpoints.find(&node);\n\tif (iter == mBreakpoints.end()) { return false; }\n\n\treturn mTarget.BreakpointDelete(iter->second.GetID());\n}\n\nResult Debugger::start(const char** argv, const char** envp,\n                       const boost::filesystem::path& workingDirectory) {\n\tExpects(boost::filesystem::is_directory(workingDirectory));\n\n\tResult res;\n\n\tif (!mTarget.IsValid()) {\n\t\tres.addEntry(\"EUKN\", \"Cannot start a debugger process with an invalid target\", {});\n\t\treturn res;\n\t}\n\n\t\/\/ generate IR\n\tstd::unique_ptr<llvm::Module> mod;\n\t{\n\t\tres = module().context().compileModule(module(), &mod);\n\t\tif (!res) { return res; }\n\t}\n\n\t\/\/ write it to a file\n\tfs::path tmpIRPath;\n\t{\n\t\ttmpIRPath = boost::filesystem::temp_directory_path() \/ fs::unique_path();\n\t\tstd::error_code      ec;  \/\/ TODO: use ec\n\t\tstd::string errorString; \/\/ only for LLVM 3.5\n\t\tllvm::raw_fd_ostream file{tmpIRPath.string().c_str(),\n#if LLVM_VERSION_LESS_EQUAL(3, 5)\n\t\t\terrorString\n#else\n\t\t\tec, \n#endif\n\t\t\tllvm::sys::fs::F_RW};\n\t\tllvm::WriteBitcodeToFile(mod.get(), file);\n\t}\n\n\t\/\/ create args\n\tstd::vector<const char*> args;\n\t{\n\t\targs.push_back(\"interpret\");\n\t\targs.push_back(\"-i\");\n\t\targs.push_back(tmpIRPath.string().c_str());\n\t\targs.push_back(\"-O\");\n\t\targs.push_back(\"0\");\n\n\t\tif (argv != nullptr) {\n\t\t\tfor (; *argv != nullptr; ++argv) { args.push_back(*argv); }\n\t\t}\n\n\t\targs.push_back(nullptr);\n\t}\n\n\t\/\/ start the process\n\t{\n\t\tlldb::SBError    err;\n\t\tlldb::SBListener invalidListener;\n\t\tmProcess =\n\t\t    mTarget.Launch(invalidListener, args.data(), envp, nullptr, nullptr, nullptr,\n\t\t                   workingDirectory.string().c_str(), lldb::eLaunchFlagDebug, false, err);\n\n\t\tif (err.Fail()) {\n\t\t\tres.addEntry(\"EUKN\", \"Failed to launch process\", {{\"Error Message\", err.GetCString()}});\n\t\t}\n\t}\n\n\treturn res;\n}\n\nstd::vector<const NodeInstance*> Debugger::listBreakpoints() const {\n\tstd::vector<const NodeInstance*> ret;\n\tret.reserve(mBreakpoints.size());\n\tfor (const auto& bpts : mBreakpoints) { ret.push_back(bpts.first); }\n\treturn ret;\n}\n\nlldb::SBValue Debugger::inspectNodeOutput(const NodeInstance& inst, size_t id,\n                                          lldb::SBFrame frame) {\n\tExpects(id < inst.outputDataConnections.size());\n\n\t\/\/ if frame isn't valid, use the default\n\tif (!frame.IsValid()) {\n\t\tauto thread = lldbProcess().GetSelectedThread();\n\t\tif (!thread.IsValid()) { return {}; }\n\t\tframe = thread.GetSelectedFrame();\n\t}\n\n\tif (!frame.IsValid()) { return {}; }\n\n\t\/\/ make sure it's in scope\n\tauto func = &nodeFromFrame(frame)->function();\n\tif (func != &inst.function()) { return {}; }\n\n\tauto variableName = inst.stringId() + \"__\" + std::to_string(id);\n\treturn frame.FindVariable(variableName.c_str());\n}\n\nNodeInstance* Debugger::nodeFromFrame(lldb::SBFrame frame) {\n\tusing namespace std::string_literals;\n\n\t\/\/ if frame isn't valid, use the default\n\tif (!frame.IsValid()) {\n\t\tauto thread = lldbProcess().GetSelectedThread();\n\t\tif (!thread.IsValid()) { return {}; }\n\t\tframe = thread.GetSelectedFrame();\n\t}\n\n\tif (!frame.IsValid()) { return {}; }\n\n\tauto mangledFunctionName = frame.GetFunctionName();\n\t\/\/ demangle that\n\tstd::string moduleName, functionName;\n\tstd::tie(moduleName, functionName) = unmangleFunctionName(mangledFunctionName);\n\n\tGraphFunction* func = nullptr;\n\n\tif (mangledFunctionName == \"main\"s) { func = module().functionFromName(\"main\"); }\n\n\tif (func == nullptr) {\n\t\tauto mod = static_cast<GraphModule*>(module().context().moduleByFullName(moduleName));\n\t\tif (!mod) { return nullptr; }\n\t\tfunc = mod->functionFromName(functionName);\n\t}\n\n\tunsigned lineNo = frame.GetLineEntry().GetLine();\n\n\t\/\/ create assoc TODO: cache these\n\tauto assoc = func->module().createLineNumberAssoc();\n\n\tauto nodeIter = assoc.left.find(lineNo);\n\tif (nodeIter == assoc.left.end()) { return nullptr; }\n\n\treturn nodeIter->second;\n}\n\nunsigned lineNumberFromNode(NodeInstance& inst) {\n\t\/\/ TODO: cache these, they're kinda expensive to make\n\tauto lineAssoc      = inst.module().createLineNumberAssoc();\n\tauto lineNumberIter = lineAssoc.right.find(&inst);\n\tif (lineNumberIter == lineAssoc.right.end()) { return -1; }\n\n\treturn lineNumberIter->second;\n}\n\n}  \/\/ namespace chi\n<commit_msg>Add missing comma<commit_after>\/\/\/ \\file Debugger.cpp\n\n#include \"chi\/Debugger.hpp\"\n\n#include <chi\/Context.hpp>\n#include <chi\/LLVMVersion.hpp>\n#include <chi\/NameMangler.hpp>\n#include <chi\/NodeInstance.hpp>\n#include <chi\/Result.hpp>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/uuid\/uuid_io.hpp>\n\n#if LLVM_VERSION_LESS_EQUAL(3, 9)\n#include <llvm\/Bitcode\/ReaderWriter.h>\n#else\n#include <llvm\/Bitcode\/BitcodeWriter.h>\n#endif\n\n#include <llvm\/Support\/FileSystem.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/IR\/Module.h>\n\n#include <lldb\/API\/SBListener.h>\n#include <lldb\/API\/SBThread.h>\n\n#include <stdlib.h>  \/\/ for setenv\n\nnamespace fs = boost::filesystem;\n\nnamespace chi {\n\nDebugger::Debugger(const char* pathToChig, GraphModule& mod) : mModule{&mod} {\n\/\/ point it to lldb-server\n#if __linux__\n\tauto lldbServerPath = fs::path(pathToChig).parent_path() \/ \"lldb-server\";\n\tsetenv(\"LLDB_DEBUGSERVER_PATH\", lldbServerPath.c_str(), 1);\n#endif\n\n\tlldb::SBDebugger::Initialize();\n\tmDebugger = lldb::SBDebugger::Create();\n\n\t\/\/ set the logger to stderr for testing\n\tmDebugger.SetLoggingCallback(\n\t    [](const char* msg, void* dbg) {\n\t\t    std::cerr << msg;\n\t\t    std::cerr.flush();\n\t\t},\n\t    this);\n\n\tconst char* val[] = {\"api\", nullptr};\n\tmDebugger.EnableLog(\"lldb\", val);\n\n\t\/\/ create target\n\tmTarget = mDebugger.CreateTarget(pathToChig);\n}\n\nDebugger::~Debugger() { lldb::SBDebugger::Terminate(); }\n\nResult Debugger::terminate() {\n\tResult res;\n\n\tif (isAttached()) {\n\t\tauto err = mProcess.Kill();\n\n\t\tif (err.Fail()) {\n\t\t\tres.addEntry(\"EUKN\", \"Failed to terminate process\",\n\t\t\t             {{\"Error Code\", err.GetError()}, {\"Error String\", err.GetCString()}});\n\n\t\t\treturn res;\n\t\t}\n\t}\n\n\treturn res;\n}\n\nResult Debugger::processContinue() {\n\tResult res;\n\n\tif (isAttached()) {\n\t\tauto err = mProcess.Continue();\n\n\t\tif (err.Fail()) {\n\t\t\tres.addEntry(\"EUKN\", \"Failed to continue process\",\n\t\t\t             {{\"Error Code\", err.GetError()}, {\"Error String\", err.GetCString()}});\n\n\t\t\treturn res;\n\t\t}\n\t}\n\n\treturn res;\n}\nResult Debugger::pause() {\n\tResult res;\n\n\tif (isAttached()) {\n\t\tauto err = mProcess.Stop();\n\n\t\tif (err.Fail()) {\n\t\t\tres.addEntry(\"EUKN\", \"Failed to pause process\",\n\t\t\t             {{\"Error Code\", err.GetError()}, {\"Error String\", err.GetCString()}});\n\n\t\t\treturn res;\n\t\t}\n\t}\n\n\treturn res;\n}\n\nResult Debugger::setBreakpoint(NodeInstance& node, lldb::SBBreakpoint* bp) {\n\tResult res;\n\n\tint linenum = lineNumberFromNode(node);\n\n\t\/\/ create the breakpoint\n\tauto breakpoint = mTarget.BreakpointCreateByLocation(\n\t    node.module().sourceFilePath().string().c_str(), linenum);\n\n\t\/\/ make sure that it's good\n\tif (!breakpoint.IsValid()) {\n\t\tres.addEntry(\"EUKN\", \"Could not set breakpoint on node\",\n\t\t             {{\"nodeid\", node.stringId()},\n\t\t              {\"File Name\", node.module().sourceFilePath().string()},\n\t\t              {\"Line  Number\", linenum}});\n\n\t\treturn res;\n\t}\n\n\tmBreakpoints[&node] = breakpoint;\n\n\tif (bp != nullptr) { *bp = breakpoint; }\n\n\tbreakpoint.SetEnabled(true);\n\n\treturn res;\n}\n\nbool Debugger::removeBreakpoint(NodeInstance& node) {\n\tauto iter = mBreakpoints.find(&node);\n\tif (iter == mBreakpoints.end()) { return false; }\n\n\treturn mTarget.BreakpointDelete(iter->second.GetID());\n}\n\nResult Debugger::start(const char** argv, const char** envp,\n                       const boost::filesystem::path& workingDirectory) {\n\tExpects(boost::filesystem::is_directory(workingDirectory));\n\n\tResult res;\n\n\tif (!mTarget.IsValid()) {\n\t\tres.addEntry(\"EUKN\", \"Cannot start a debugger process with an invalid target\", {});\n\t\treturn res;\n\t}\n\n\t\/\/ generate IR\n\tstd::unique_ptr<llvm::Module> mod;\n\t{\n\t\tres = module().context().compileModule(module(), &mod);\n\t\tif (!res) { return res; }\n\t}\n\n\t\/\/ write it to a file\n\tfs::path tmpIRPath;\n\t{\n\t\ttmpIRPath = boost::filesystem::temp_directory_path() \/ fs::unique_path();\n\t\tstd::error_code      ec;  \/\/ TODO: use ec\n\t\tstd::string errorString; \/\/ only for LLVM 3.5\n\t\tllvm::raw_fd_ostream file{tmpIRPath.string().c_str(),\n#if LLVM_VERSION_LESS_EQUAL(3, 5)\n\t\t\terrorString,\n#else\n\t\t\tec, \n#endif\n\t\t\tllvm::sys::fs::F_RW};\n\t\tllvm::WriteBitcodeToFile(mod.get(), file);\n\t}\n\n\t\/\/ create args\n\tstd::vector<const char*> args;\n\t{\n\t\targs.push_back(\"interpret\");\n\t\targs.push_back(\"-i\");\n\t\targs.push_back(tmpIRPath.string().c_str());\n\t\targs.push_back(\"-O\");\n\t\targs.push_back(\"0\");\n\n\t\tif (argv != nullptr) {\n\t\t\tfor (; *argv != nullptr; ++argv) { args.push_back(*argv); }\n\t\t}\n\n\t\targs.push_back(nullptr);\n\t}\n\n\t\/\/ start the process\n\t{\n\t\tlldb::SBError    err;\n\t\tlldb::SBListener invalidListener;\n\t\tmProcess =\n\t\t    mTarget.Launch(invalidListener, args.data(), envp, nullptr, nullptr, nullptr,\n\t\t                   workingDirectory.string().c_str(), lldb::eLaunchFlagDebug, false, err);\n\n\t\tif (err.Fail()) {\n\t\t\tres.addEntry(\"EUKN\", \"Failed to launch process\", {{\"Error Message\", err.GetCString()}});\n\t\t}\n\t}\n\n\treturn res;\n}\n\nstd::vector<const NodeInstance*> Debugger::listBreakpoints() const {\n\tstd::vector<const NodeInstance*> ret;\n\tret.reserve(mBreakpoints.size());\n\tfor (const auto& bpts : mBreakpoints) { ret.push_back(bpts.first); }\n\treturn ret;\n}\n\nlldb::SBValue Debugger::inspectNodeOutput(const NodeInstance& inst, size_t id,\n                                          lldb::SBFrame frame) {\n\tExpects(id < inst.outputDataConnections.size());\n\n\t\/\/ if frame isn't valid, use the default\n\tif (!frame.IsValid()) {\n\t\tauto thread = lldbProcess().GetSelectedThread();\n\t\tif (!thread.IsValid()) { return {}; }\n\t\tframe = thread.GetSelectedFrame();\n\t}\n\n\tif (!frame.IsValid()) { return {}; }\n\n\t\/\/ make sure it's in scope\n\tauto func = &nodeFromFrame(frame)->function();\n\tif (func != &inst.function()) { return {}; }\n\n\tauto variableName = inst.stringId() + \"__\" + std::to_string(id);\n\treturn frame.FindVariable(variableName.c_str());\n}\n\nNodeInstance* Debugger::nodeFromFrame(lldb::SBFrame frame) {\n\tusing namespace std::string_literals;\n\n\t\/\/ if frame isn't valid, use the default\n\tif (!frame.IsValid()) {\n\t\tauto thread = lldbProcess().GetSelectedThread();\n\t\tif (!thread.IsValid()) { return {}; }\n\t\tframe = thread.GetSelectedFrame();\n\t}\n\n\tif (!frame.IsValid()) { return {}; }\n\n\tauto mangledFunctionName = frame.GetFunctionName();\n\t\/\/ demangle that\n\tstd::string moduleName, functionName;\n\tstd::tie(moduleName, functionName) = unmangleFunctionName(mangledFunctionName);\n\n\tGraphFunction* func = nullptr;\n\n\tif (mangledFunctionName == \"main\"s) { func = module().functionFromName(\"main\"); }\n\n\tif (func == nullptr) {\n\t\tauto mod = static_cast<GraphModule*>(module().context().moduleByFullName(moduleName));\n\t\tif (!mod) { return nullptr; }\n\t\tfunc = mod->functionFromName(functionName);\n\t}\n\n\tunsigned lineNo = frame.GetLineEntry().GetLine();\n\n\t\/\/ create assoc TODO: cache these\n\tauto assoc = func->module().createLineNumberAssoc();\n\n\tauto nodeIter = assoc.left.find(lineNo);\n\tif (nodeIter == assoc.left.end()) { return nullptr; }\n\n\treturn nodeIter->second;\n}\n\nunsigned lineNumberFromNode(NodeInstance& inst) {\n\t\/\/ TODO: cache these, they're kinda expensive to make\n\tauto lineAssoc      = inst.module().createLineNumberAssoc();\n\tauto lineNumberIter = lineAssoc.right.find(&inst);\n\tif (lineNumberIter == lineAssoc.right.end()) { return -1; }\n\n\treturn lineNumberIter->second;\n}\n\n}  \/\/ namespace chi\n<|endoftext|>"}
{"text":"<commit_before>#include \"process_2d.hpp\"\n\/\/#include \"libcomparator.hpp\"\n\ndouble balance[] = {1.0, 1.0, 1.0};\n\nclass MaskIterateProcess\n{\npublic:\n\tIterateProcessMask<TYPE> iterateProcessMask;\n\t\n\tMaskIterateProcess(cv::Mat image, cv::Mat mask, int compareDistance = 1)\n\t:\n\t\titerateProcessMask\n\t\t(\n\t\t\timage,\n\t\t\tstd::numeric_limits<TYPE>::lowest(),\n\t\t\tstd::numeric_limits<double>::min(),\n\t\t\tstd::numeric_limits<double>::max(),\n\t\t\tbalance,\n\t\t\tcompareDistance,\n\t\t\tmask\n\t\t)\n\t{}\n\t\n\tstd::vector<IndexTransition> calc_transitions_with_mask()\n\t{\n\t\treturn iterateProcessMask.iterate_HV();\n\t}\n\nprivate:\n};\n\nnamespace process2d\n{\n\tint const blurDivisor = 100;\n\n\tcv::Mat calc_canny( cv::Mat image, int blurr = 7, int threshold1 = 80, int threshold2 = 500, int apertureSize = 5 )\n\t{\n\t\tcv::Mat edge;\n\t\tcv::cvtColor( image, edge, CV_BGR2GRAY );\n\t    cv::blur( edge, edge, cv::Size(blurr, blurr) );\n\t    #ifdef VERBOSE\n\t    cv::imshow( \"calc_canny\", edge );\n\t    cv::waitKey(0);\n\t    #endif\n\t    cv::Canny( edge, edge, threshold1, threshold2, apertureSize, true );\n\t    edge.convertTo(edge, CV_8U);\n\t    #ifdef VERBOSE\n\t    cv::imshow( \"calc_canny\", edge );\n\t    cv::waitKey(0);\n\t    #endif\n\t    return edge;\n\t}\n\n\tbool is_subset(cv::Mat cannyImage1D, cv::Mat const cannyImage, double maximumNonSubsetPercentage = 10)\n\t{\n\t\tcv::Mat cannyImage_ = cannyImage.clone();\n\t\tint setSize = cv::countNonZero(cannyImage_);\n\t\t\n\t\tint dilationSize = 10;\n\t\tcv::Mat element = cv::getStructuringElement( cv::MORPH_ELLIPSE,\n                                       cv::Size( 2*dilationSize + 1, 2*dilationSize+1 ),\n                                       cv::Point( dilationSize, dilationSize ) );\n  \t\tcv::morphologyEx( cannyImage_, cannyImage_, cv::MORPH_DILATE, element, cv::Point(-1,-1), 1, cv::BORDER_REFLECT );\n\n  \t\t#ifdef VERBOSE\n  \t\tcv::imshow( \"dilatedCannyImage\", cannyImage_ );\n\t    cv::waitKey(0);\n  \t\t#endif\n\n  \t\tcv::bitwise_xor(cannyImage_, cannyImage1D, cannyImage_);\n  \t\tcv::bitwise_and(cannyImage_, cannyImage1D, cannyImage_);\n  \t\tint numberOfNonSubset = cv::countNonZero(cannyImage_);\n  \t\t\n  \t\t#ifdef VERBOSE\n  \t\tcv::imshow( \"nonSubset\", cannyImage_ );\n\t    cv::waitKey(0);\n  \t\tstd::cout << \"process2d::is_subset::numberOfNonSubset: \" << numberOfNonSubset << \" setSize: \" << setSize << std::endl;\n  \t\t#endif\n\n  \t\treturn 100.0 * numberOfNonSubset \/ setSize < maximumNonSubsetPercentage;\n\t}\n\n\tcv::Mat canny_until_1d_is_subset_of_orginal(cv::Mat const cannyImage, cv::Mat image1D, int blurr, int startThreshold, double thresholdDivisor = 1.3, int ratio = 2)\n\t{\n\t\t#ifdef WITH_TESTS\n\t\tstatic int iteration = 10;\n\t\t--iteration;\n\t\tassert(iteration);\n\t\t#endif\n\n\t\tcv::Mat cannyImage1D = calc_canny(image1D, blurr, startThreshold, startThreshold*ratio);\n\t\tif(is_subset(cannyImage1D, cannyImage))\n\t\t{\n\t\t\tstartThreshold\/=thresholdDivisor;\n\t\t\tcanny_until_1d_is_subset_of_orginal(cannyImage, image1D, blurr, startThreshold);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstartThreshold*=thresholdDivisor;\n\t\t\tcannyImage1D = calc_canny(image1D, blurr, startThreshold, startThreshold*ratio);\n\t\t\treturn cannyImage1D;\n\t\t}\n\t}\n\n\tcv::Mat run_process2d(cv::Mat image, cv::Mat image1D)\n\t{\n\t\tassert( image.rows == image1D.rows && image.cols == image1D.cols );\n\t\t\n\t\tint startThreshold = 5;\n\t\tint startThreshold1D = startThreshold * 10;\n\t\tint blurr = image.cols \/ blurDivisor;\n\t\tcv::Mat cannyImage = calc_canny(image, blurr, startThreshold);\n\t\tcv::Mat cannyImage1D = canny_until_1d_is_subset_of_orginal(cannyImage, image1D, blurr, startThreshold1D);\n\t\t\n\t\tcv::Mat shadowEdges;\n\t\tcv::subtract(cannyImage, cannyImage1D, shadowEdges);\n\t\t#ifdef VERBOSE\n\t    cv::imshow( \"shadowEdges\", shadowEdges );\n\t    cv::waitKey(0);\n\t    #endif\n\n\t\t\/\/auto idTrCluster = test_on_image( path, factor, 3.0, 1 );\n\t\tMaskIterateProcess maskIterateProcess(image, shadowEdges);\n\t\tauto idTr = maskIterateProcess.calc_transitions_with_mask();\n\n    \tFilter filter(image, idTr, 160, 3, 1, 5);\n    \tcv::Mat result = filter.filter_image();\n\n\t\treturn result;\n\t}\n}<commit_msg>2d_nonsubset_20<commit_after>#include \"process_2d.hpp\"\n\/\/#include \"libcomparator.hpp\"\n\ndouble balance[] = {1.0, 1.0, 1.0};\n\nclass MaskIterateProcess\n{\npublic:\n\tIterateProcessMask<TYPE> iterateProcessMask;\n\t\n\tMaskIterateProcess(cv::Mat image, cv::Mat mask, int compareDistance = 1)\n\t:\n\t\titerateProcessMask\n\t\t(\n\t\t\timage,\n\t\t\tstd::numeric_limits<TYPE>::lowest(),\n\t\t\tstd::numeric_limits<double>::min(),\n\t\t\tstd::numeric_limits<double>::max(),\n\t\t\tbalance,\n\t\t\tcompareDistance,\n\t\t\tmask\n\t\t)\n\t{}\n\t\n\tstd::vector<IndexTransition> calc_transitions_with_mask()\n\t{\n\t\treturn iterateProcessMask.iterate_HV();\n\t}\n\nprivate:\n};\n\nnamespace process2d\n{\n\tint const blurDivisor = 100;\n\n\tcv::Mat calc_canny( cv::Mat image, int blurr = 7, int threshold1 = 80, int threshold2 = 500, int apertureSize = 5 )\n\t{\n\t\tcv::Mat edge;\n\t\tcv::cvtColor( image, edge, CV_BGR2GRAY );\n\t    cv::blur( edge, edge, cv::Size(blurr, blurr) );\n\t    #ifdef VERBOSE\n\t    cv::imshow( \"calc_canny\", edge );\n\t    cv::waitKey(0);\n\t    #endif\n\t    cv::Canny( edge, edge, threshold1, threshold2, apertureSize, true );\n\t    edge.convertTo(edge, CV_8U);\n\t    #ifdef VERBOSE\n\t    cv::imshow( \"calc_canny\", edge );\n\t    cv::waitKey(0);\n\t    #endif\n\t    return edge;\n\t}\n\n\tbool is_subset(cv::Mat cannyImage1D, cv::Mat const cannyImage, double maximumNonSubsetPercentage = 20)\n\t{\n\t\tcv::Mat cannyImage_ = cannyImage.clone();\n\t\tint setSize = cv::countNonZero(cannyImage_);\n\t\t\n\t\tint dilationSize = 10;\n\t\tcv::Mat element = cv::getStructuringElement( cv::MORPH_ELLIPSE,\n                                       cv::Size( 2*dilationSize + 1, 2*dilationSize+1 ),\n                                       cv::Point( dilationSize, dilationSize ) );\n  \t\tcv::morphologyEx( cannyImage_, cannyImage_, cv::MORPH_DILATE, element, cv::Point(-1,-1), 1, cv::BORDER_REFLECT );\n\n  \t\t#ifdef VERBOSE\n  \t\tcv::imshow( \"dilatedCannyImage\", cannyImage_ );\n\t    cv::waitKey(0);\n  \t\t#endif\n\n  \t\tcv::bitwise_xor(cannyImage_, cannyImage1D, cannyImage_);\n  \t\tcv::bitwise_and(cannyImage_, cannyImage1D, cannyImage_);\n  \t\tint numberOfNonSubset = cv::countNonZero(cannyImage_);\n  \t\t\n  \t\t#ifdef VERBOSE\n  \t\tcv::imshow( \"nonSubset\", cannyImage_ );\n\t    cv::waitKey(0);\n  \t\tstd::cout << \"process2d::is_subset::numberOfNonSubset: \" << numberOfNonSubset << \" setSize: \" << setSize << std::endl;\n  \t\t#endif\n\n  \t\treturn 100.0 * numberOfNonSubset \/ setSize < maximumNonSubsetPercentage;\n\t}\n\n\tcv::Mat canny_until_1d_is_subset_of_orginal(cv::Mat const cannyImage, cv::Mat image1D, int blurr, int startThreshold, double thresholdDivisor = 1.3, int ratio = 2)\n\t{\n\t\t#ifdef WITH_TESTS\n\t\tstatic int iteration = 10;\n\t\t--iteration;\n\t\tassert(iteration);\n\t\t#endif\n\n\t\tcv::Mat cannyImage1D = calc_canny(image1D, blurr, startThreshold, startThreshold*ratio);\n\t\tif(is_subset(cannyImage1D, cannyImage))\n\t\t{\n\t\t\tstartThreshold\/=thresholdDivisor;\n\t\t\tcanny_until_1d_is_subset_of_orginal(cannyImage, image1D, blurr, startThreshold);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstartThreshold*=thresholdDivisor;\n\t\t\tcannyImage1D = calc_canny(image1D, blurr, startThreshold, startThreshold*ratio);\n\t\t\treturn cannyImage1D;\n\t\t}\n\t}\n\n\tcv::Mat run_process2d(cv::Mat image, cv::Mat image1D)\n\t{\n\t\tassert( image.rows == image1D.rows && image.cols == image1D.cols );\n\t\t\n\t\tint startThreshold = 5;\n\t\tint startThreshold1D = startThreshold * 10;\n\t\tint blurr = image.cols \/ blurDivisor;\n\t\tcv::Mat cannyImage = calc_canny(image, blurr, startThreshold);\n\t\tcv::Mat cannyImage1D = canny_until_1d_is_subset_of_orginal(cannyImage, image1D, blurr, startThreshold1D);\n\t\t\n\t\tcv::Mat shadowEdges;\n\t\tcv::subtract(cannyImage, cannyImage1D, shadowEdges);\n\t\t#ifdef VERBOSE\n\t    cv::imshow( \"shadowEdges\", shadowEdges );\n\t    cv::waitKey(0);\n\t    #endif\n\n\t\t\/\/auto idTrCluster = test_on_image( path, factor, 3.0, 1 );\n\t\tMaskIterateProcess maskIterateProcess(image, shadowEdges);\n\t\tauto idTr = maskIterateProcess.calc_transitions_with_mask();\n\n    \tFilter filter(image, idTr, 160, 3, 1, 5);\n    \tcv::Mat result = filter.filter_image();\n\n\t\treturn result;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n\/* \n   This is some wisdom from Cygnus's web page.  If you just try to use\n   the \"stringify\" operator on a preprocessor directive, you'd get\n   \"PLATFORM\", not \"Intel Linux\" (or whatever the value of PLATFORM\n   is).  That's because the stringify operator is a special case, and\n   the preprocessor isn't allowed to expand things that are passed to\n   it.  However, by defining two layers of macros, you get the right\n   behavior, since the first pass converts:\n\n   xstr(PLATFORM) -> str(Intel Linux)\n\n   and the next pass gives:\n\n   str(Intel Linux) -> \"Intel Linux\"\n\n   This is exactly what we want, so we use it.  -Derek Wright and Jeff\n   Ballard, 12\/2\/99 \n\n   Also, because the NT build system is totally different, we have to\n   define the correct platform string right in here. :( -Derek 12\/3\/99 \n*\/\n\n#define xstr(s) str(s)\n#define str(s) #s\n\n#if defined(WIN32)\n#define PLATFORM INTEL-WINNT50\n#endif\n\n\/* Via configure, one may have specified a particular buildid string to use\n\tin the version string. So honor that request here. *\/\n#if defined(BUILDID)\n#define BUILDIDSTR \" BuildID: \" xstr(BUILDID)\n#else\n#define BUILDIDSTR \"\"\n#endif\n\n\/* Here is the version string - update before a public release *\/\n\/* --- IMPORTANT!  THE FORMAT OF THE VERSION STRING IS VERY STRICT\n   BECAUSE IT IS PARSED AT RUNTIME.  DO NOT ALTER THE FORMAT OR ENTER\n   ANYTHING EXTRA BEFORE THE DATE.  IF YOU WISH TO ADD EXTRA INFORMATION,\n   DO SO _AFTER_ THE BUILDIDSTR AND BEFORE THE TRAILING '$' CHARACTER.\n   EXAMPLES:\n       $CondorVersion: 6.9.5 \" __DATE__ BUILDIDSTR \" WinNTPreview $ [OK]\n\t   $CondorVersion: 6.9.5 WinNTPreview \" __DATE__ BUILDIDSTR \" $ [WRONG!!!]\n   Any questions?  See Todd or Derek.  Note: if you mess it up, DaemonCore\n   will EXCEPT at startup time.  \n*\/\n\nstatic char* CondorVersionString = \"$CondorVersion: 7.2.3 \" __DATE__ BUILDIDSTR \" PRE-RELEASE-UWCS $\";\n\n\/* Here is the platform string.  You don't need to edit this *\/\nstatic char* CondorPlatformString = \"$CondorPlatform: \" xstr(PLATFORM) \" $\";\n\nextern \"C\" {\n\nconst char*\nCondorVersion( void )\n{\n\treturn CondorVersionString;\n}\n\nconst char*\nCondorPlatform( void )\n{\n\treturn CondorPlatformString;\n}\n\n} \/* extern \"C\" *\/\n\n<commit_msg>Fix version string for 7.2.3 release.<commit_after>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n\/* \n   This is some wisdom from Cygnus's web page.  If you just try to use\n   the \"stringify\" operator on a preprocessor directive, you'd get\n   \"PLATFORM\", not \"Intel Linux\" (or whatever the value of PLATFORM\n   is).  That's because the stringify operator is a special case, and\n   the preprocessor isn't allowed to expand things that are passed to\n   it.  However, by defining two layers of macros, you get the right\n   behavior, since the first pass converts:\n\n   xstr(PLATFORM) -> str(Intel Linux)\n\n   and the next pass gives:\n\n   str(Intel Linux) -> \"Intel Linux\"\n\n   This is exactly what we want, so we use it.  -Derek Wright and Jeff\n   Ballard, 12\/2\/99 \n\n   Also, because the NT build system is totally different, we have to\n   define the correct platform string right in here. :( -Derek 12\/3\/99 \n*\/\n\n#define xstr(s) str(s)\n#define str(s) #s\n\n#if defined(WIN32)\n#define PLATFORM INTEL-WINNT50\n#endif\n\n\/* Via configure, one may have specified a particular buildid string to use\n\tin the version string. So honor that request here. *\/\n#if defined(BUILDID)\n#define BUILDIDSTR \" BuildID: \" xstr(BUILDID)\n#else\n#define BUILDIDSTR \"\"\n#endif\n\n\/* Here is the version string - update before a public release *\/\n\/* --- IMPORTANT!  THE FORMAT OF THE VERSION STRING IS VERY STRICT\n   BECAUSE IT IS PARSED AT RUNTIME.  DO NOT ALTER THE FORMAT OR ENTER\n   ANYTHING EXTRA BEFORE THE DATE.  IF YOU WISH TO ADD EXTRA INFORMATION,\n   DO SO _AFTER_ THE BUILDIDSTR AND BEFORE THE TRAILING '$' CHARACTER.\n   EXAMPLES:\n       $CondorVersion: 6.9.5 \" __DATE__ BUILDIDSTR \" WinNTPreview $ [OK]\n\t   $CondorVersion: 6.9.5 WinNTPreview \" __DATE__ BUILDIDSTR \" $ [WRONG!!!]\n   Any questions?  See Todd or Derek.  Note: if you mess it up, DaemonCore\n   will EXCEPT at startup time.  \n*\/\n\nstatic char* CondorVersionString = \"$CondorVersion: 7.2.3 \" __DATE__ BUILDIDSTR \" $\";\n\n\/* Here is the platform string.  You don't need to edit this *\/\nstatic char* CondorPlatformString = \"$CondorPlatform: \" xstr(PLATFORM) \" $\";\n\nextern \"C\" {\n\nconst char*\nCondorVersion( void )\n{\n\treturn CondorVersionString;\n}\n\nconst char*\nCondorPlatform( void )\n{\n\treturn CondorPlatformString;\n}\n\n} \/* extern \"C\" *\/\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 (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 \"msceneeventeater.h\"\n#include \"mscene.h\"\n#include \"mscenemanager.h\"\n\n#include <QEvent>\n#include <QGraphicsScene>\n#include <QGraphicsView>\n#include <QDebug>\n#include <float.h>\n\nMSceneEventEater::MSceneEventEater(QGraphicsItem *parent) :\n        QGraphicsWidget(parent)\n{\n    setFlag(QGraphicsItem::ItemHasNoContents);\n    setFlag(QGraphicsItem::ItemStopsClickFocusPropagation);\n\n    \/\/FLT_MAX is maximal value for single precision floating-point number\n    \/\/We want this item to be on top of everything\n    setZValue(FLT_MAX);\n    setVisible(false);\n}\n\nbool MSceneEventEater::event(QEvent *event)\n{\n    if ((event->type() > QEvent::MouseButtonPress && event->type() < QEvent::MouseMove) ||\n        (event->type() > QEvent::GraphicsSceneMouseMove && event->type() < QEvent::GraphicsSceneWheel) ||\n        (event->type() > QEvent::HoverEnter && event->type() < QEvent::HoverMove)) {\n\n        event->accept();\n        return true;\n    }\n    return false;\n}\n<commit_msg>Fixes: NB#194075 Object menu shown on a wrong page after a page transition.<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 \"msceneeventeater.h\"\n#include \"mscene.h\"\n#include \"mscenemanager.h\"\n\n#include <QEvent>\n#include <QGraphicsScene>\n#include <QGraphicsView>\n#include <QDebug>\n#include <float.h>\n\nMSceneEventEater::MSceneEventEater(QGraphicsItem *parent) :\n        QGraphicsWidget(parent)\n{\n    grabGesture(Qt::TapGesture);\n    grabGesture(Qt::TapAndHoldGesture);\n    grabGesture(Qt::PanGesture);\n    grabGesture(Qt::PinchGesture);\n    grabGesture(Qt::SwipeGesture);\n    setFlag(QGraphicsItem::ItemHasNoContents);\n    setFlag(QGraphicsItem::ItemStopsClickFocusPropagation);\n\n    \/\/FLT_MAX is maximal value for single precision floating-point number\n    \/\/We want this item to be on top of everything\n    setZValue(FLT_MAX);\n    setVisible(false);\n}\n\nbool MSceneEventEater::event(QEvent *event)\n{\n    if ((event->type() > QEvent::MouseButtonPress && event->type() < QEvent::MouseMove) ||\n        (event->type() > QEvent::GraphicsSceneMouseMove && event->type() < QEvent::GraphicsSceneWheel) ||\n        (event->type() > QEvent::HoverEnter && event->type() < QEvent::HoverMove) ||\n        (event->type() == QEvent::Gesture)) {\n\n        event->accept();\n        return true;\n    }\n    return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * DynamicCommunityDetection.cpp\n *\n *  Created on: 10.01.2014\n *      Author: cls\n *\/\n\n#include \"DynamicCommunityDetection.h\"\n\n#include \"DynPLP.h\"\n#include \"DynPLM.h\"\n#include \"..\/dynamics\/DGSStreamParser.h\"\n#include \"..\/dynamics\/GraphUpdater.h\"\n#include \"..\/clustering\/Modularity.h\"\n\nnamespace NetworKit {\n\nDynamicCommunityDetection::DynamicCommunityDetection() {\n\t\/\/ TODO Auto-generated constructor stub\n\n}\n\nvoid DynamicCommunityDetection::run(std::string inputPath, std::string algoName, count interval) {\n\tDEBUG(\"reading full event stream from file\");\n\tDGSStreamParser parser(inputPath, true, 1);\n\tstd::vector<GraphEvent> stream = parser.getStream();\n\tDEBUG(\"setting up graph\");\n\tGraph G;\n\tGraphUpdater gu(G);\n\n\tDEBUG(\"setting up algorithms\");\n\tDynCommunityDetector* algo = NULL;\n\tif (algoName == \"DynPLP\") {\n\t\talgo = new DynPLP();\n\t} else if (algoName == \"DynPLM\") {\n\t\talgo = new DynPLM();\n\t}\n\n\talgo->attachGraph(G);\n\n\t\/\/ slicing stream\n\tauto i = stream.begin();\n\tauto j = i + interval;\n\tif (j > stream.end()) {\n\t\tj = stream.end();\n\t}\n\n\twhile (i < stream.end()) { \/\/ TODO: rest of stream\n\t\tstd::vector<GraphEvent> slice(i, j);\n\t\tDEBUG(\"updating graph\");\n\t\tgu.update(slice);\n\t\tDEBUG(\"number of nodes: \" << G.numberOfNodes());\n\n\t\talgo->process(slice);\n\t\tClustering zeta = algo->retrieve();\n\t\tDEBUG(\"upper community id bound: \" << zeta.upperBound());\n\t\t\/\/ DEBUG(\"zeta at time \" << G.time() << \": \" << Aux::vectorToString(zeta.getVector()));\n\n\t\tModularity mod;\n\t\tINFO(\"modularity at time \" << G.time() << \": \" << mod.getQuality(zeta, G));\n\n\t\t\/\/\n\t\ti = j;\n\t\tj = i + interval;\n\t\tif (j > stream.end()) {\n\t\t\tj = stream.end();\n\t\t}\n\t}\n\n\n\n\n}\n\n} \/* namespace NetworKit *\/\n<commit_msg>event stream now sliced by time steps<commit_after>\/*\n * DynamicCommunityDetection.cpp\n *\n *  Created on: 10.01.2014\n *      Author: cls\n *\/\n\n#include \"DynamicCommunityDetection.h\"\n\n#include \"DynPLP.h\"\n#include \"DynPLM.h\"\n#include \"..\/dynamics\/DGSStreamParser.h\"\n#include \"..\/dynamics\/GraphUpdater.h\"\n#include \"..\/clustering\/Modularity.h\"\n\nnamespace NetworKit {\n\nDynamicCommunityDetection::DynamicCommunityDetection() {\n\t\/\/ TODO Auto-generated constructor stub\n\n}\n\nvoid DynamicCommunityDetection::run(std::string inputPath, std::string algoName, count interval) {\n\tDEBUG(\"reading full event stream from file\");\n\tDGSStreamParser parser(inputPath, true, 1);\n\tstd::vector<GraphEvent> stream = parser.getStream();\n\tDEBUG(\"setting up graph\");\n\tGraph G;\n\tGraphUpdater gu(G);\n\n\tDEBUG(\"setting up algorithms\");\n\tDynCommunityDetector* algo = NULL;\n\tif (algoName == \"DynPLP\") {\n\t\talgo = new DynPLP();\n\t} else if (algoName == \"DynPLM\") {\n\t\talgo = new DynPLM();\n\t}\n\n\talgo->attachGraph(G);\n\n\t\/\/ slicing stream by timesteps\n\tauto i = stream.begin();\n\tauto j = stream.begin();\n\n\n\tauto advance = [&](){\n\t\tcount steps = 0;\n\t\ti = j;\n\t\tfor (; (steps < interval) && (j < stream.end()); ++j) {\n\t\t\tif (j->type == GraphEvent::TIME_STEP) {\n\t\t\t\tsteps++;\n\t\t\t}\n\t\t}\n\t};\n\n\n\n\twhile (j != stream.end()) {\n\t\tadvance(); \/\/ advance iterators\n\t\tstd::vector<GraphEvent> slice(i, j);\n\t\tDEBUG(\"updating graph\");\n\t\tgu.update(slice);\n\t\tDEBUG(\"number of nodes: \" << G.numberOfNodes());\n\n\t\talgo->process(slice);\n\t\tClustering zeta = algo->retrieve();\n\t\tDEBUG(\"upper community id bound: \" << zeta.upperBound());\n\t\t\/\/ DEBUG(\"zeta at time \" << G.time() << \": \" << Aux::vectorToString(zeta.getVector()));\n\n\t\tModularity mod;\n\t\tINFO(\"modularity at time \" << G.time() << \": \" << mod.getQuality(zeta, G));\n\n\t}\n\n\n\n\n}\n\n} \/* namespace NetworKit *\/\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: grammarchecker.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 _LINGUISTIC_GRAMMARCHECKER_HXX_\n#define _LINGUISTIC_GRAMMARCHECKER_HXX_\n\n\n#include <cppuhelper\/implbase4.hxx>\n#include <com\/sun\/star\/linguistic2\/XGrammarChecker.hpp>\n#include <com\/sun\/star\/linguistic2\/XGrammarCheckingResultBroadcaster.hpp>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#include <cppuhelper\/interfacecontainer.h>\n#include <map>\n#include <com\/sun\/star\/linguistic2\/SingleGrammarError.hpp>\n#include <com\/sun\/star\/linguistic2\/XSupportedLocales.hpp>\n\n\nclass GrammarChecker:\n    public cppu::WeakImplHelper4\n    <\n        ::com::sun::star::linguistic2::XGrammarChecker,\n        ::com::sun::star::linguistic2::XGrammarCheckingResultBroadcaster,\n        ::com::sun::star::lang::XComponent,\n        ::com::sun::star::lang::XServiceInfo\n    >\n{\n\/\/    com::sun::star::uno::Reference< uno::XComponentContext > m_xContext;\n    ::cppu::OInterfaceContainerHelper m_aGCListeners;\n    \/\/ disallow use of copy c-tor and assignment operator\n    GrammarChecker( const GrammarChecker & );\n    GrammarChecker & operator = ( const GrammarChecker & );\n\npublic:\n    explicit GrammarChecker( \/* uno::Reference< uno::XComponentContext > const & rXContext *\/ );\n    virtual ~GrammarChecker();\n\n    \/\/sal_Int32 m_Doc;\n\n    \/\/ XSupportedLocales\n    virtual ::sal_Bool SAL_CALL hasLocale( const ::com::sun::star::lang::Locale & aLocale) throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::lang::Locale > SAL_CALL getLocales(  ) throw ( ::com::sun::star::uno::RuntimeException );\n\n    \/\/ XGrammarChecker\n    virtual ::sal_Bool SAL_CALL isSpellChecker( const ::com::sun::star::lang::Locale& aLocale ) throw (::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL startDocument( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL startParagraph( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL endParagraph( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL endDocument( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL doGrammarChecking( ::sal_Int32 nDocId, const ::com::sun::star::uno::Reference< ::com::sun::star::text::XFlatParagraph >& xFlatPara, const ::com::sun::star::lang::Locale& aLocale, ::sal_Int32 nStartOfSentencePos, ::sal_Int32 nSuggestedSentenceEndPos ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Int32 SAL_CALL getEndOfSentencePos( ::sal_Int32 nDocId, const ::rtl::OUString& aFlatParaText, const ::com::sun::star::lang::Locale& aLocale, ::sal_Int32 nStartOfSentencePos ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Int32 SAL_CALL getStartOfSentencePos( ::sal_Int32 nDocId, const ::rtl::OUString& aFlatParaText, const ::com::sun::star::lang::Locale& aLocale ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Bool SAL_CALL requiresPreviousText(  ) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Bool SAL_CALL hasCheckingDialog(  ) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Bool SAL_CALL hasOptionsDialog(  ) throw (::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL runCheckingDialog( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL runOptionsDialog( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n\n\n    \/\/ XGrammarCheckingResultBroadcaster\n    virtual ::sal_Bool SAL_CALL addGrammarCheckingResultListener( const ::com::sun::star::uno::Reference< ::com::sun::star::linguistic2::XGrammarCheckingResultListener >& xLstnr ) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Bool SAL_CALL removeGrammarCheckingResultListener( const ::com::sun::star::uno::Reference< ::com::sun::star::linguistic2::XGrammarCheckingResultListener >& xLstnr ) throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ XComponent\n    virtual void SAL_CALL dispose(  ) throw (::com::sun::star::uno::RuntimeException);\n\n    virtual void SAL_CALL addEventListener( const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XEventListener >& xListener ) throw ( ::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL removeEventListener( const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XEventListener >& xListener ) throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ XServiceInfo\n    virtual ::rtl::OUString SAL_CALL getImplementationName() throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::sal_Bool SAL_CALL supportsService( const ::rtl::OUString& ServiceName ) throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames() throw (::com::sun::star::uno::RuntimeException);\n\n    static inline ::rtl::OUString getImplementationName_Static();\n\n    static ::com::sun::star::uno::Sequence< ::rtl::OUString > getSupportedServiceNames_Static() throw();\n\n    ::com::sun::star::uno::Sequence< ::com::sun::star::linguistic2::SingleGrammarError > GrammarCheckingInDummy(\n        ::sal_Int32 nDocId, const ::rtl::OUString aFlatParaText, const ::com::sun::star::lang::Locale & rLocale,\n        ::sal_Int32 nStartOfSentencePos, ::sal_Int32 nSuggestedSentenceEndPos );\n\n\n    inline ::osl::Mutex & GetMutex()\n    {\n        static osl::Mutex aMutex;\n        return aMutex;\n    }\n};\n\ninline ::rtl::OUString GrammarChecker::getImplementationName_Static()\n{\n    return A2OU( \"com.sun.star.lingu2.GrammarChecker\" );\n}\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS tl55 (1.3.8); FILE MERGED 2008\/06\/25 06:03:52 tl 1.3.8.3: #158047# customer specific extension 2008\/06\/07 15:24:21 tl 1.3.8.2: #i85999# grammar checking framework 2008\/05\/27 11:17:52 tl 1.3.8.1: #i85999# improve grammar checking framework<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: grammarchecker.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 _LINGUISTIC_GRAMMARCHECKER_HXX_\n#define _LINGUISTIC_GRAMMARCHECKER_HXX_\n\n\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#include <com\/sun\/star\/linguistic2\/XGrammarChecker.hpp>\n#include <com\/sun\/star\/linguistic2\/SingleGrammarError.hpp>\n#include <com\/sun\/star\/linguistic2\/XSupportedLocales.hpp>\n\n#include <cppuhelper\/implbase3.hxx>\n#include <cppuhelper\/interfacecontainer.h>\n\n#include <map>\n\n\nclass GrammarChecker:\n    public cppu::WeakImplHelper3\n    <\n        ::com::sun::star::linguistic2::XGrammarChecker,\n        ::com::sun::star::lang::XComponent,\n        ::com::sun::star::lang::XServiceInfo\n    >\n{\n\/\/    com::sun::star::uno::Reference< uno::XComponentContext > m_xContext;\n\n    \/\/ disallow use of copy c-tor and assignment operator\n    GrammarChecker( const GrammarChecker & );\n    GrammarChecker & operator = ( const GrammarChecker & );\n\npublic:\n    explicit GrammarChecker( \/* uno::Reference< uno::XComponentContext > const & rXContext *\/ );\n    virtual ~GrammarChecker();\n\n    \/\/ XSupportedLocales\n    virtual ::sal_Bool SAL_CALL hasLocale( const ::com::sun::star::lang::Locale & aLocale) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::lang::Locale > SAL_CALL getLocales(  ) throw ( ::com::sun::star::uno::RuntimeException );\n\n    \/\/ XGrammarChecker\n    virtual ::sal_Bool SAL_CALL isSpellChecker(  ) throw (::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL startDocument( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL startParagraph( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL endParagraph( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL endDocument( ::sal_Int32 nDocId ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::linguistic2::GrammarCheckingResult SAL_CALL doGrammarChecking( ::sal_Int32 nDocId, const ::rtl::OUString& aText, const ::com::sun::star::lang::Locale& aLocale, ::sal_Int32 nStartOfSentencePos, ::sal_Int32 nSuggestedEndOfSentencePos, const ::com::sun::star::uno::Sequence< ::sal_Int32 >& aLanguagePortions, const ::com::sun::star::uno::Sequence< ::com::sun::star::lang::Locale >& aLanguagePortionsLocales ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Bool SAL_CALL hasOptionsDialog(  ) throw (::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL runOptionsDialog(  ) throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ XComponent\n    virtual void SAL_CALL dispose(  ) throw (::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL addEventListener( const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XEventListener >& xListener ) throw ( ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL removeEventListener( const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XEventListener >& xListener ) throw (::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    static inline ::rtl::OUString getImplementationName_Static();\n    static ::com::sun::star::uno::Sequence< ::rtl::OUString > getSupportedServiceNames_Static() throw();\n\n    ::com::sun::star::uno::Sequence< ::com::sun::star::linguistic2::SingleGrammarError > GrammarCheckingInDummy(\n        ::sal_Int32 nDocId, const ::rtl::OUString &rFlatParaText, const ::com::sun::star::lang::Locale & rLocale,\n        ::sal_Int32 nStartOfSentencePos, ::sal_Int32 nSuggestedSentenceEndPos );\n\n\n    inline ::osl::Mutex & GetMutex()\n    {\n        static osl::Mutex aMutex;\n        return aMutex;\n    }\n};\n\ninline ::rtl::OUString GrammarChecker::getImplementationName_Static()\n{\n    return A2OU( \"com.sun.star.lingu2.GrammarChecker\" );\n}\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015, University of Freiburg,\n\/\/ Chair of Algorithms and Data Structures.\n\/\/ Author: Björn Buchhold (buchhold@informatik.uni-freiburg.de)\n\n#include <sstream>\n\n#include \".\/QueryExecutionTree.h\"\n#include \"TextOperationWithFilter.h\"\n\n\nusing std::string;\n\n\n\/\/ _____________________________________________________________________________\nsize_t TextOperationWithFilter::getResultWidth() const {\n  return 1 + _nofVars + _filterResult->getResultWidth();\n}\n\n\/\/ _____________________________________________________________________________\nTextOperationWithFilter::TextOperationWithFilter(\n    QueryExecutionContext* qec, const string& words, size_t nofVars,\n    std::shared_ptr<QueryExecutionTree> filterResult, size_t filterColumn,\n    size_t textLimit) :\n    Operation(qec), _words(words), _nofVars(nofVars),\n    _filterResult(filterResult),\n    _filterColumn(filterColumn) {\n  setTextLimit(textLimit);\n}\n\n\/\/ _____________________________________________________________________________\nstring TextOperationWithFilter::asString(size_t indent) const {\n  std::ostringstream os;\n  for (size_t i = 0; i < indent; ++i) { os << \" \"; }\n  os << \"TEXT OPERATION WITH FILTER:\" << \" co-occurrence with words: \\\"\" <<\n     _words << \"\\\" and \" << _nofVars << \" variables with textLimit = \" <<\n     _textLimit << \" filtered by\\n\" <<\n     _filterResult->asString(indent) << \"\\n\";\n  for (size_t i = 0; i < indent; ++i) { os << \" \"; }\n  os << \" filtered on column \" << _filterColumn;\n  return os.str();\n}\n\n\/\/ _____________________________________________________________________________\nvoid TextOperationWithFilter::computeResult(ResultTable* result) const {\n  LOG(DEBUG) << \"TextOperationWithFilter result computation...\" << endl;\n  AD_CHECK_GE(_nofVars, 1);\n  result->_nofColumns = 1 + _filterResult->getResultWidth() + _nofVars;\n  if (_filterResult->getResultWidth() == 1) {\n    AD_CHECK_GE(result->_nofColumns, 3);\n    if (result->_nofColumns == 3) {\n      result->_fixedSizeData = new vector<array<Id, 3>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 1>>*>(_filterResult->getResult()._fixedSizeData),\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 3>>*>(result->_fixedSizeData));\n    } else if (result->_nofColumns == 4) {\n      result->_fixedSizeData = new vector<array<Id, 4>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 1>>*>(_filterResult->getResult()._fixedSizeData),\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 4>>*>(result->_fixedSizeData));\n    } else if (result->_nofColumns == 5) {\n      result->_fixedSizeData = new vector<array<Id, 5>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 1>>*>(_filterResult->getResult()._fixedSizeData),\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 5>>*>(result->_fixedSizeData));\n    } else {\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 1>>*>(_filterResult->getResult()._fixedSizeData),\n          _nofVars,\n          _textLimit,\n          result->_varSizeData);\n    }\n  } else if (_filterResult->getResultWidth() == 2) {\n    AD_CHECK_GE(result->_nofColumns, 4);\n    if (result->_nofColumns == 4) {\n      result->_fixedSizeData = new vector<array<Id, 4>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 2>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 4>>*>(result->_fixedSizeData));\n    } else if (result->_nofColumns == 5) {\n      result->_fixedSizeData = new vector<array<Id, 5>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 2>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 5>>*>(result->_fixedSizeData));\n    } else {\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 2>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          result->_varSizeData);\n    }\n  } else if (_filterResult->getResultWidth() == 3) {\n    AD_CHECK_GE(result->_nofColumns, 5);\n    if (result->_nofColumns == 5) {\n      result->_fixedSizeData = new vector<array<Id, 5>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 3>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 5>>*>(result->_fixedSizeData));\n    } else {\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 3>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          result->_varSizeData);\n    }\n  } else if (_filterResult->getResultWidth() == 4) {\n    getExecutionContext()->getIndex().getFilteredECListForWords(\n        _words,\n        *static_cast<vector<array<Id, 4>>*>(_filterResult->getResult()._fixedSizeData),\n        _filterColumn,\n        _nofVars,\n        _textLimit,\n        result->_varSizeData);\n  } else if (_filterResult->getResultWidth() == 5) {\n    getExecutionContext()->getIndex().getFilteredECListForWords(\n        _words,\n        *static_cast<vector<array<Id, 5>>*>(_filterResult->getResult()._fixedSizeData),\n        _filterColumn,\n        _nofVars,\n        _textLimit,\n        result->_varSizeData);\n  } else {\n    getExecutionContext()->getIndex().getFilteredECListForWords(\n        _words,\n        _filterResult->getResult()._varSizeData,\n        _filterColumn,\n        _nofVars,\n        _textLimit,\n        result->_varSizeData);\n  }\n  result->_status = ResultTable::FINISHED;\n  LOG(DEBUG) << \"TextOperationWithFilter result computation done.\" << endl;\n}\n\n\n\/\/ _____________________________________________________________________________\nfloat TextOperationWithFilter::getMultiplicity(size_t col) {\n  if (_multiplicities.size() == 0) {\n    computeMultiplicities();\n  }\n  AD_CHECK_LT(col, _multiplicities.size());\n  return _multiplicities[col];\n}\n\n\/\/ _____________________________________________________________________________\nvoid TextOperationWithFilter::computeMultiplicities() {\n  if (_executionContext) {\n    \/\/ Like without filter\n    vector<float> multiplicitiesNoFilter;\n    for (size_t i = 0;\n         i < getResultWidth() + 1 - _filterResult->getResultWidth(); ++i) {\n      double nofEntitiesSingleVar;\n      if (_executionContext) {\n        nofEntitiesSingleVar =\n            _executionContext->getIndex().getSizeEstimate(_words) *\n            std::min(float(_textLimit),\n                     _executionContext->getIndex().getAverageNofEntityContexts());\n      } else {\n        nofEntitiesSingleVar = 10000 * 0.8;\n      }\n      multiplicitiesNoFilter.emplace_back(\n          pow(nofEntitiesSingleVar, _nofVars - 1));\n    }\n\n    assert(multiplicitiesNoFilter.size() > 2);\n\n    \/\/ Like joins\n    float _leftJcM = multiplicitiesNoFilter[2];\n    float _rightJcM = _filterResult->getMultiplicity(_filterColumn);\n    for (size_t i = 0; i < multiplicitiesNoFilter.size() - 1; ++i) {\n      _multiplicities.emplace_back(multiplicitiesNoFilter[i] * _rightJcM);\n    }\n    for (size_t i = 0; i < _filterResult->getResultWidth(); ++i) {\n      _multiplicities.emplace_back(\n          _filterResult->getMultiplicity(i) * _leftJcM);\n    }\n  } else {\n    for (size_t i = 0; i < getResultWidth(); ++i) {\n      _multiplicities.emplace_back(1);\n    }\n  }\n  assert(_multiplicities.size() == getResultWidth());\n}\n\n\/\/ _____________________________________________________________________________\nsize_t TextOperationWithFilter::getSizeEstimate() {\n  if (_sizeEstimate == std::numeric_limits<size_t>::max()) {\n    if (_executionContext) {\n      \/\/ NEW at 05 Dec 2016:\n      \/\/ Estimate the size of the result like the equivalent text without filter\n      \/\/ plus join.\n      double nofEntitiesSingleVar;\n      if (_executionContext) {\n        nofEntitiesSingleVar =\n            _executionContext->getIndex().getSizeEstimate(_words) *\n            std::min(float(_textLimit),\n                     _executionContext->getIndex().getAverageNofEntityContexts());\n      } else {\n        nofEntitiesSingleVar = 10000 * 0.8;\n      }\n\n      auto estNoFil = static_cast<size_t>(pow(nofEntitiesSingleVar, _nofVars));\n\n      size_t nofDistinctFilter = static_cast<size_t>(\n          _filterResult->getSizeEstimate() \/\n          _filterResult->getMultiplicity(_filterColumn));\n\n      float joinColMultiplicity = getMultiplicity(\n          2 + (_nofVars - 1) + _filterColumn);\n\n      _sizeEstimate = std::max(size_t(1), static_cast<size_t>(\n          _executionContext->getCostFactor(\n              \"JOIN_SIZE_ESTIMATE_CORRECTION_FACTOR\") *\n          joinColMultiplicity *\n          std::min(nofDistinctFilter, estNoFil)));\n    }\n    _sizeEstimate = size_t(10000 * 0.8);\n  }\n  return _sizeEstimate;\n}\n\n\/\/ _____________________________________________________________________________\nsize_t TextOperationWithFilter::getCostEstimate() {\n  if (_filterResult->knownEmptyResult()) {\n    return 0;\n  }\n  if (_executionContext) {\n    return static_cast<size_t>(\n        _executionContext->getCostFactor(\"FILTER_PUNISH\") * (\n            getSizeEstimate() * _nofVars +\n            _filterResult->getSizeEstimate() *\n            _executionContext->getCostFactor(\"HASH_MAP_OPERATION_COST\") +\n            _filterResult->getCostEstimate()));\n  } else {\n    return _filterResult->getSizeEstimate() * 2 +\n           _filterResult->getCostEstimate();\n  }\n}\n<commit_msg>fixed bug (typo with bad consequences) in the size estimate of scans with filter<commit_after>\/\/ Copyright 2015, University of Freiburg,\n\/\/ Chair of Algorithms and Data Structures.\n\/\/ Author: Björn Buchhold (buchhold@informatik.uni-freiburg.de)\n\n#include <sstream>\n\n#include \".\/QueryExecutionTree.h\"\n#include \"TextOperationWithFilter.h\"\n\n\nusing std::string;\n\n\n\/\/ _____________________________________________________________________________\nsize_t TextOperationWithFilter::getResultWidth() const {\n  return 1 + _nofVars + _filterResult->getResultWidth();\n}\n\n\/\/ _____________________________________________________________________________\nTextOperationWithFilter::TextOperationWithFilter(\n    QueryExecutionContext* qec, const string& words, size_t nofVars,\n    std::shared_ptr<QueryExecutionTree> filterResult, size_t filterColumn,\n    size_t textLimit) :\n    Operation(qec), _words(words), _nofVars(nofVars),\n    _filterResult(filterResult),\n    _filterColumn(filterColumn) {\n  setTextLimit(textLimit);\n}\n\n\/\/ _____________________________________________________________________________\nstring TextOperationWithFilter::asString(size_t indent) const {\n  std::ostringstream os;\n  for (size_t i = 0; i < indent; ++i) { os << \" \"; }\n  os << \"TEXT OPERATION WITH FILTER:\" << \" co-occurrence with words: \\\"\" <<\n     _words << \"\\\" and \" << _nofVars << \" variables with textLimit = \" <<\n     _textLimit << \" filtered by\\n\" <<\n     _filterResult->asString(indent) << \"\\n\";\n  for (size_t i = 0; i < indent; ++i) { os << \" \"; }\n  os << \" filtered on column \" << _filterColumn;\n  return os.str();\n}\n\n\/\/ _____________________________________________________________________________\nvoid TextOperationWithFilter::computeResult(ResultTable* result) const {\n  LOG(DEBUG) << \"TextOperationWithFilter result computation...\" << endl;\n  AD_CHECK_GE(_nofVars, 1);\n  result->_nofColumns = 1 + _filterResult->getResultWidth() + _nofVars;\n  if (_filterResult->getResultWidth() == 1) {\n    AD_CHECK_GE(result->_nofColumns, 3);\n    if (result->_nofColumns == 3) {\n      result->_fixedSizeData = new vector<array<Id, 3>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 1>>*>(_filterResult->getResult()._fixedSizeData),\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 3>>*>(result->_fixedSizeData));\n    } else if (result->_nofColumns == 4) {\n      result->_fixedSizeData = new vector<array<Id, 4>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 1>>*>(_filterResult->getResult()._fixedSizeData),\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 4>>*>(result->_fixedSizeData));\n    } else if (result->_nofColumns == 5) {\n      result->_fixedSizeData = new vector<array<Id, 5>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 1>>*>(_filterResult->getResult()._fixedSizeData),\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 5>>*>(result->_fixedSizeData));\n    } else {\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 1>>*>(_filterResult->getResult()._fixedSizeData),\n          _nofVars,\n          _textLimit,\n          result->_varSizeData);\n    }\n  } else if (_filterResult->getResultWidth() == 2) {\n    AD_CHECK_GE(result->_nofColumns, 4);\n    if (result->_nofColumns == 4) {\n      result->_fixedSizeData = new vector<array<Id, 4>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 2>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 4>>*>(result->_fixedSizeData));\n    } else if (result->_nofColumns == 5) {\n      result->_fixedSizeData = new vector<array<Id, 5>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 2>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 5>>*>(result->_fixedSizeData));\n    } else {\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 2>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          result->_varSizeData);\n    }\n  } else if (_filterResult->getResultWidth() == 3) {\n    AD_CHECK_GE(result->_nofColumns, 5);\n    if (result->_nofColumns == 5) {\n      result->_fixedSizeData = new vector<array<Id, 5>>;\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 3>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          *reinterpret_cast<vector<array<Id, 5>>*>(result->_fixedSizeData));\n    } else {\n      getExecutionContext()->getIndex().getFilteredECListForWords(\n          _words,\n          *static_cast<vector<array<Id, 3>>*>(_filterResult->getResult()._fixedSizeData),\n          _filterColumn,\n          _nofVars,\n          _textLimit,\n          result->_varSizeData);\n    }\n  } else if (_filterResult->getResultWidth() == 4) {\n    getExecutionContext()->getIndex().getFilteredECListForWords(\n        _words,\n        *static_cast<vector<array<Id, 4>>*>(_filterResult->getResult()._fixedSizeData),\n        _filterColumn,\n        _nofVars,\n        _textLimit,\n        result->_varSizeData);\n  } else if (_filterResult->getResultWidth() == 5) {\n    getExecutionContext()->getIndex().getFilteredECListForWords(\n        _words,\n        *static_cast<vector<array<Id, 5>>*>(_filterResult->getResult()._fixedSizeData),\n        _filterColumn,\n        _nofVars,\n        _textLimit,\n        result->_varSizeData);\n  } else {\n    getExecutionContext()->getIndex().getFilteredECListForWords(\n        _words,\n        _filterResult->getResult()._varSizeData,\n        _filterColumn,\n        _nofVars,\n        _textLimit,\n        result->_varSizeData);\n  }\n  result->_status = ResultTable::FINISHED;\n  LOG(DEBUG) << \"TextOperationWithFilter result computation done.\" << endl;\n}\n\n\n\/\/ _____________________________________________________________________________\nfloat TextOperationWithFilter::getMultiplicity(size_t col) {\n  if (_multiplicities.size() == 0) {\n    computeMultiplicities();\n  }\n  AD_CHECK_LT(col, _multiplicities.size());\n  return _multiplicities[col];\n}\n\n\/\/ _____________________________________________________________________________\nvoid TextOperationWithFilter::computeMultiplicities() {\n  if (_executionContext) {\n    \/\/ Like without filter\n    vector<float> multiplicitiesNoFilter;\n    for (size_t i = 0;\n         i < getResultWidth() + 1 - _filterResult->getResultWidth(); ++i) {\n      double nofEntitiesSingleVar;\n      if (_executionContext) {\n        nofEntitiesSingleVar =\n            _executionContext->getIndex().getSizeEstimate(_words) *\n            std::min(float(_textLimit),\n                     _executionContext->getIndex().getAverageNofEntityContexts());\n      } else {\n        nofEntitiesSingleVar = 10000 * 0.8;\n      }\n      multiplicitiesNoFilter.emplace_back(\n          pow(nofEntitiesSingleVar, _nofVars - 1));\n    }\n\n    assert(multiplicitiesNoFilter.size() > 2);\n\n    \/\/ Like joins\n    float _leftJcM = multiplicitiesNoFilter[2];\n    float _rightJcM = _filterResult->getMultiplicity(_filterColumn);\n    for (size_t i = 0; i < multiplicitiesNoFilter.size() - 1; ++i) {\n      _multiplicities.emplace_back(multiplicitiesNoFilter[i] * _rightJcM);\n    }\n    for (size_t i = 0; i < _filterResult->getResultWidth(); ++i) {\n      _multiplicities.emplace_back(\n          _filterResult->getMultiplicity(i) * _leftJcM);\n    }\n  } else {\n    for (size_t i = 0; i < getResultWidth(); ++i) {\n      _multiplicities.emplace_back(1);\n    }\n  }\n  assert(_multiplicities.size() == getResultWidth());\n}\n\n\/\/ _____________________________________________________________________________\nsize_t TextOperationWithFilter::getSizeEstimate() {\n  if (_sizeEstimate == std::numeric_limits<size_t>::max()) {\n    if (_executionContext) {\n      \/\/ NEW at 05 Dec 2016:\n      \/\/ Estimate the size of the result like the equivalent text without filter\n      \/\/ plus join.\n      double nofEntitiesSingleVar =\n          _executionContext->getIndex().getSizeEstimate(_words) *\n          std::min(float(_textLimit),\n                   _executionContext->getIndex().getAverageNofEntityContexts());\n\n      auto estNoFil = static_cast<size_t>(pow(nofEntitiesSingleVar, _nofVars));\n\n      size_t nofDistinctFilter = static_cast<size_t>(\n          _filterResult->getSizeEstimate() \/\n          _filterResult->getMultiplicity(_filterColumn));\n\n      float joinColMultiplicity = getMultiplicity(\n          2 + (_nofVars - 1) + _filterColumn);\n\n      _sizeEstimate = std::max(size_t(1), static_cast<size_t>(\n          _executionContext->getCostFactor(\n              \"JOIN_SIZE_ESTIMATE_CORRECTION_FACTOR\") *\n          joinColMultiplicity *\n          std::min(nofDistinctFilter, estNoFil)));\n    } else {\n      _sizeEstimate = size_t(10000 * 0.8);\n    }\n  }\n  return _sizeEstimate;\n}\n\n\/\/ _____________________________________________________________________________\nsize_t TextOperationWithFilter::getCostEstimate() {\n  if (_filterResult->knownEmptyResult()) {\n    return 0;\n  }\n  if (_executionContext) {\n    return static_cast<size_t>(\n        _executionContext->getCostFactor(\"FILTER_PUNISH\") * (\n            getSizeEstimate() * _nofVars +\n            _filterResult->getSizeEstimate() *\n            _executionContext->getCostFactor(\"HASH_MAP_OPERATION_COST\") +\n            _filterResult->getCostEstimate()));\n  } else {\n    return _filterResult->getSizeEstimate() * 2 +\n           _filterResult->getCostEstimate();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>class Solution {\npublic:    \n    \/**\n     * @param A, B: Two string.\n     * @return: the length of the longest common substring.\n     *\/\n    int longestCommonSubstring(string &A, string &B) {\n        \/\/ write your code here\n        int alen=A.size();\n        int blen=B.size();\n        \n        \/\/ dp[i][j] means A[0..i) and B[0,j)'s longest common substring length\n        \/\/ includes the A[i-1] and B[j-1] \n        vector<int> dp(blen+1,0);\n        \n        int res=0;\n        for(int i=1; i<=alen; i++){\n            for(int j=blen; j>=0; j--){\n                if(A[i-1]==B[j-1]){\n                    dp[j]=dp[j-1]+1;\n                }else{\n                    dp[j]=0;\n                }\n                res=max(res,dp[j]);\n            }\n        }\n        \n        return res;\n    }\n};\n\n<commit_msg>Update longestcommonsubstring_.cpp<commit_after>class Solution {\npublic:    \n    \/**\n     * @param A, B: Two string.\n     * @return: the length of the longest common substring.\n     *\/\n    int longestCommonSubstring(string &A, string &B) {\n        \/\/ write your code here\n        int alen=A.size();\n        int blen=B.size();\n        \n        \/\/ dp[i][j] means the length of longest common substring of A[0..i) which must be ended with A[i-1] and B[0..j)'s which must be ended with B[j-1].\n        \/\/ below is using 1-dim dp array \n        vector<int> dp(blen+1,0);\n        \n        int res=0;\n        for(int i=1; i<=alen; i++){\n            for(int j=blen; j>=0; j--){\n                if(A[i-1]==B[j-1]){\n                    dp[j]=dp[j-1]+1;\n                }else{\n                    dp[j]=0;\n                }\n                res=max(res,dp[j]);\n            }\n        }\n        \n        return res;\n    }\n};\n\n<|endoftext|>"}
{"text":"<commit_before>#ifdef _WIN32\n\n#include <assert.h>\n\n#include \"win_fsnotifier.h\"\n\nusing namespace std;\n\n\/\/\n\/\/ WatchPoint\n\/\/\n\nWatchPoint::WatchPoint(Server* server, const u16string& path)\n    : path(path)\n    , status(NOT_LISTENING) {\n    wstring pathW(path.begin(), path.end());\n    HANDLE directoryHandle = CreateFileW(\n        pathW.c_str(),          \/\/ pointer to the file name\n        FILE_LIST_DIRECTORY,    \/\/ access (read\/write) mode\n        CREATE_SHARE,           \/\/ share mode\n        NULL,                   \/\/ security descriptor\n        OPEN_EXISTING,          \/\/ how to create\n        CREATE_FLAGS,           \/\/ file attributes\n        NULL                    \/\/ file with attributes to copy\n    );\n    if (directoryHandle == INVALID_HANDLE_VALUE) {\n        throw FileWatcherException(\"Couldn't add watch\", path, GetLastError());\n    }\n    this->directoryHandle = directoryHandle;\n\n    this->server = server;\n    this->buffer.reserve(EVENT_BUFFER_SIZE);\n    ZeroMemory(&this->overlapped, sizeof(OVERLAPPED));\n    this->overlapped.hEvent = this;\n    listen();\n}\n\nWatchPoint::~WatchPoint() {\n}\n\nvoid WatchPoint::cancel() {\n    if (status == LISTENING) {\n        log_fine(server->getThreadEnv(), \"Cancelling %s\", utf16ToUtf8String(path).c_str());\n        status = CANCELLED;\n        BOOL ret = CancelIo(directoryHandle);\n        if (!ret) {\n            throw FileWatcherException(\"Couldn't cancel I\/O\", path, GetLastError());\n        }\n    }\n}\n\nstatic void CALLBACK handleEventCallback(DWORD errorCode, DWORD bytesTransferred, LPOVERLAPPED overlapped) {\n    WatchPoint* watchPoint = (WatchPoint*) overlapped->hEvent;\n    watchPoint->handleEventsInBuffer(errorCode, bytesTransferred);\n}\n\nvoid WatchPoint::listen() {\n    BOOL success = ReadDirectoryChangesW(\n        directoryHandle,        \/\/ handle to directory\n        &buffer[0],             \/\/ read results buffer\n        EVENT_BUFFER_SIZE,      \/\/ length of buffer\n        TRUE,                   \/\/ include children\n        EVENT_MASK,             \/\/ filter conditions\n        NULL,                   \/\/ bytes returned\n        &overlapped,            \/\/ overlapped buffer\n        &handleEventCallback    \/\/ completion routine\n    );\n    if (success) {\n        status = LISTENING;\n    } else {\n        status = FINISHED;\n        throw FileWatcherException(\"Couldn't start watching\", path, GetLastError());\n    }\n}\n\nvoid WatchPoint::handleEventsInBuffer(DWORD errorCode, DWORD bytesTransferred) {\n    if (errorCode == ERROR_OPERATION_ABORTED) {\n        log_fine(server->getThreadEnv(), \"Finished watching '%s', status = %d\", utf16ToUtf8String(path).c_str(), status);\n        BOOL ret = CloseHandle(directoryHandle);\n        if (!ret) {\n            log_severe(server->getThreadEnv(), \"Couldn't close handle %p for '%ls': %d\", directoryHandle, utf16ToUtf8String(path).c_str(), GetLastError());\n        }\n        status = FINISHED;\n        return;\n    }\n\n    if (status != LISTENING) {\n        log_fine(server->getThreadEnv(), \"Ignoring incoming events for %s as watch-point is not listening (%d bytes, errorCode = %d, status = %d)\",\n            utf16ToUtf8String(path).c_str(), bytesTransferred, errorCode, status);\n        return;\n    }\n    status = NOT_LISTENING;\n    server->handleEvents(this, errorCode, buffer, bytesTransferred);\n}\n\nvoid Server::handleEvents(WatchPoint* watchPoint, DWORD errorCode, const vector<BYTE>& buffer, DWORD bytesTransferred) {\n    JNIEnv* env = getThreadEnv();\n    const u16string& path = watchPoint->path;\n\n    try {\n        if (errorCode != ERROR_SUCCESS) {\n            throw FileWatcherException(\"Error received when handling events\", path, errorCode);\n        }\n\n        if (terminated) {\n            log_fine(env, \"Ignoring incoming events for %s because server is terminating (%d bytes)\",\n                utf16ToUtf8String(path).c_str(), bytesTransferred, watchPoint->status);\n            return;\n        }\n\n        if (bytesTransferred == 0) {\n            \/\/ Got a buffer overflow => current changes lost => send INVALIDATE on root\n            log_info(env, \"Detected overflow for %s\", utf16ToUtf8String(path).c_str());\n            reportChange(env, FILE_EVENT_INVALIDATE, path);\n        } else {\n            int index = 0;\n            for (;;) {\n                FILE_NOTIFY_INFORMATION* current = (FILE_NOTIFY_INFORMATION*) &buffer[index];\n                handleEvent(env, path, current);\n                if (current->NextEntryOffset == 0) {\n                    break;\n                }\n                index += current->NextEntryOffset;\n            }\n        }\n\n        watchPoint->listen();\n    } catch (const exception& ex) {\n        reportError(env, ex);\n    }\n}\n\nbool isAbsoluteLocalPath(const u16string& path) {\n    if (path.length() < 3) {\n        return false;\n    }\n    return ((u'a' <= path[0] && path[0] <= u'z') || (u'A' <= path[0] && path[0] <= u'Z'))\n        && path[1] == u':'\n        && path[2] == u'\\\\';\n}\n\nbool isAbsoluteUncPath(const u16string& path) {\n    if (path.length() < 3) {\n        return false;\n    }\n    return path[0] == u'\\\\' && path[1] == u'\\\\';\n}\n\nbool isLongPath(const u16string& path) {\n    return path.length() >= 4 && path.substr(0, 4) == u\"\\\\\\\\?\\\\\";\n}\n\nbool isUncLongPath(const u16string& path) {\n    return path.length() >= 8 && path.substr(0, 8) == u\"\\\\\\\\?\\\\UNC\\\\\";\n}\n\n\/\/ TODO How can this be done nicer, wihtout both unnecessary copy and in-place mutation?\nvoid convertToLongPathIfNeeded(u16string& path) {\n    \/\/ Technically, this should be MAX_PATH (i.e. 260), except some Win32 API related\n    \/\/ to working with directory paths are actually limited to 240. It is just\n    \/\/ safer\/simpler to cover both cases in one code path.\n    if (path.length() <= 240) {\n        return;\n    }\n\n    \/\/ It is already a long path, nothing to do here\n    if (isLongPath(path)) {\n        return;\n    }\n\n    if (isAbsoluteLocalPath(path)) {\n        \/\/ Format: C:\\... -> \\\\?\\C:\\...\n        path.insert(0, u\"\\\\\\\\?\\\\\");\n    } else if (isAbsoluteUncPath(path)) {\n        \/\/ In this case, we need to skip the first 2 characters:\n        \/\/ Format: \\\\server\\share\\... -> \\\\?\\UNC\\server\\share\\...\n        path.erase(0, 2);\n        path.insert(0, u\"\\\\\\\\?\\\\UNC\\\\\");\n    } else {\n        \/\/ It is some sort of unknown format, don't mess with it\n    }\n}\n\nvoid Server::handleEvent(JNIEnv* env, const u16string& path, FILE_NOTIFY_INFORMATION* info) {\n    wstring changedPathW = wstring(info->FileName, 0, info->FileNameLength \/ sizeof(wchar_t));\n    u16string changedPath(changedPathW.begin(), changedPathW.end());\n    if (!changedPath.empty()) {\n        changedPath.insert(0, 1, u'\\\\');\n    }\n    changedPath.insert(0, path);\n    \/\/ TODO Remove long prefix for path once?\n    if (isLongPath(changedPath)) {\n        if (isUncLongPath(changedPath)) {\n            changedPath.erase(0, 8).insert(0, u\"\\\\\\\\\");\n        } else {\n            changedPath.erase(0, 4);\n        }\n    }\n\n    log_fine(env, \"Change detected: 0x%x '%ls'\", info->Action, changedPathW.c_str());\n\n    jint type;\n    if (info->Action == FILE_ACTION_ADDED || info->Action == FILE_ACTION_RENAMED_NEW_NAME) {\n        type = FILE_EVENT_CREATED;\n    } else if (info->Action == FILE_ACTION_REMOVED || info->Action == FILE_ACTION_RENAMED_OLD_NAME) {\n        type = FILE_EVENT_REMOVED;\n    } else if (info->Action == FILE_ACTION_MODIFIED) {\n        type = FILE_EVENT_MODIFIED;\n    } else {\n        log_warning(env, \"Unknown event 0x%x for %ls\", info->Action, changedPathW.c_str());\n        type = FILE_EVENT_UNKNOWN;\n    }\n\n    reportChange(env, type, changedPath);\n}\n\n\/\/\n\/\/ Server\n\/\/\n\nServer::Server(JNIEnv* env, jobject watcherCallback)\n    : AbstractServer(env, watcherCallback) {\n    startThread();\n    \/\/ TODO Error handling\n    SetThreadPriority(this->watcherThread.native_handle(), THREAD_PRIORITY_ABOVE_NORMAL);\n}\n\nvoid Server::terminate() {\n    log_fine(getThreadEnv(), \"Terminating\", NULL);\n    terminated = true;\n}\n\nServer::~Server() {\n    executeOnThread(shared_ptr<Command>(new TerminateCommand()));\n\n    if (watcherThread.joinable()) {\n        watcherThread.join();\n    }\n}\n\nvoid Server::runLoop(JNIEnv* env, function<void(exception_ptr)> notifyStarted) {\n    notifyStarted(nullptr);\n\n    while (!terminated) {\n        SleepEx(INFINITE, true);\n    }\n\n    \/\/ We have received termination, cancel all watchers\n    log_fine(env, \"Finished with run loop, now cancelling remaining watch points\", NULL);\n    int openWatchPoints = 0;\n    for (auto& it : watchPoints) {\n        auto& watchPoint = it.second;\n        switch (watchPoint.status) {\n            case LISTENING:\n                watchPoint.cancel();\n                openWatchPoints++;\n                break;\n            case CANCELLED:\n                openWatchPoints++;\n                break;\n            default:\n                break;\n        }\n    }\n\n    \/\/ If there are any remaining watchers, wait for them to be terminated\n    if (openWatchPoints == 0) {\n        log_fine(env, \"No watch points were open upon termination\", NULL);\n    } else {\n        log_fine(env, \"Waiting for %d watch points to abort\", openWatchPoints);\n        SleepEx(SERVER_CLOSE_TIMEOUT_IN_MS, true);\n    }\n\n    \/\/ Check if we have any unclosed watchpoints\n    for (auto& it : watchPoints) {\n        auto& watchPoint = it.second;\n        switch (watchPoint.status) {\n            case FINISHED:\n                break;\n            default:\n                log_severe(env, \"Couldn't close watch point %s, status = %d\", utf16ToUtf8String(watchPoint.path).c_str(), watchPoint.status);\n                break;\n        }\n    }\n\n    \/\/ Close all handles\n    log_fine(env, \"Closing handles for %d watch points\", watchPoints.size());\n    watchPoints.clear();\n}\n\nstatic void CALLBACK processCommandsCallback(_In_ ULONG_PTR info) {\n    Server* server = (Server*) info;\n    server->processCommands();\n}\n\nvoid Server::processCommandsOnThread() {\n    QueueUserAPC(processCommandsCallback, watcherThread.native_handle(), (ULONG_PTR) this);\n}\n\nvoid Server::registerPath(const u16string& path) {\n    u16string longPath = path;\n    convertToLongPathIfNeeded(longPath);\n    auto it = watchPoints.find(longPath);\n    if (it != watchPoints.end()) {\n        if (it->second.status != FINISHED) {\n            throw FileWatcherException(\"Already watching path\", path);\n        }\n        watchPoints.erase(it);\n    }\n    watchPoints.emplace(piecewise_construct,\n        forward_as_tuple(longPath),\n        forward_as_tuple(this, longPath));\n}\n\nvoid Server::unregisterPath(const u16string& path) {\n    u16string longPath = path;\n    convertToLongPathIfNeeded(longPath);\n    auto it = watchPoints.find(longPath);\n    if (it == watchPoints.end()) {\n        log_fine(getThreadEnv(), \"Path is not watched: %s\", utf16ToUtf8String(path).c_str());\n        return;\n    }\n    it->second.cancel();\n}\n\n\/\/\n\/\/ JNI calls\n\/\/\n\nJNIEXPORT jobject JNICALL\nJava_net_rubygrapefruit_platform_internal_jni_WindowsFileEventFunctions_startWatcher(JNIEnv* env, jclass target, jobject javaCallback) {\n    return wrapServer(env, [env, javaCallback]() {\n        return new Server(env, javaCallback);\n    });\n}\n\n#endif\n<commit_msg>Polish names and log messages<commit_after>#ifdef _WIN32\n\n#include <assert.h>\n\n#include \"win_fsnotifier.h\"\n\nusing namespace std;\n\n\/\/\n\/\/ WatchPoint\n\/\/\n\nWatchPoint::WatchPoint(Server* server, const u16string& path)\n    : path(path)\n    , status(NOT_LISTENING) {\n    wstring pathW(path.begin(), path.end());\n    HANDLE directoryHandle = CreateFileW(\n        pathW.c_str(),          \/\/ pointer to the file name\n        FILE_LIST_DIRECTORY,    \/\/ access (read\/write) mode\n        CREATE_SHARE,           \/\/ share mode\n        NULL,                   \/\/ security descriptor\n        OPEN_EXISTING,          \/\/ how to create\n        CREATE_FLAGS,           \/\/ file attributes\n        NULL                    \/\/ file with attributes to copy\n    );\n    if (directoryHandle == INVALID_HANDLE_VALUE) {\n        throw FileWatcherException(\"Couldn't add watch\", path, GetLastError());\n    }\n    this->directoryHandle = directoryHandle;\n\n    this->server = server;\n    this->buffer.reserve(EVENT_BUFFER_SIZE);\n    ZeroMemory(&this->overlapped, sizeof(OVERLAPPED));\n    this->overlapped.hEvent = this;\n    listen();\n}\n\nWatchPoint::~WatchPoint() {\n}\n\nvoid WatchPoint::cancel() {\n    if (status == LISTENING) {\n        log_fine(server->getThreadEnv(), \"Cancelling %s\", utf16ToUtf8String(path).c_str());\n        status = CANCELLED;\n        BOOL ret = CancelIo(directoryHandle);\n        if (!ret) {\n            throw FileWatcherException(\"Couldn't cancel I\/O\", path, GetLastError());\n        }\n    }\n}\n\nstatic void CALLBACK handleEventCallback(DWORD errorCode, DWORD bytesTransferred, LPOVERLAPPED overlapped) {\n    WatchPoint* watchPoint = (WatchPoint*) overlapped->hEvent;\n    watchPoint->handleEventsInBuffer(errorCode, bytesTransferred);\n}\n\nvoid WatchPoint::listen() {\n    BOOL success = ReadDirectoryChangesW(\n        directoryHandle,        \/\/ handle to directory\n        &buffer[0],             \/\/ read results buffer\n        EVENT_BUFFER_SIZE,      \/\/ length of buffer\n        TRUE,                   \/\/ include children\n        EVENT_MASK,             \/\/ filter conditions\n        NULL,                   \/\/ bytes returned\n        &overlapped,            \/\/ overlapped buffer\n        &handleEventCallback    \/\/ completion routine\n    );\n    if (success) {\n        status = LISTENING;\n    } else {\n        status = FINISHED;\n        throw FileWatcherException(\"Couldn't start watching\", path, GetLastError());\n    }\n}\n\nvoid WatchPoint::handleEventsInBuffer(DWORD errorCode, DWORD bytesTransferred) {\n    if (errorCode == ERROR_OPERATION_ABORTED) {\n        log_fine(server->getThreadEnv(), \"Finished watching '%s', status = %d\", utf16ToUtf8String(path).c_str(), status);\n        BOOL ret = CloseHandle(directoryHandle);\n        if (!ret) {\n            log_severe(server->getThreadEnv(), \"Couldn't close handle %p for '%ls': %d\", directoryHandle, utf16ToUtf8String(path).c_str(), GetLastError());\n        }\n        status = FINISHED;\n        return;\n    }\n\n    if (status != LISTENING) {\n        log_fine(server->getThreadEnv(), \"Ignoring incoming events for %s as watch-point is not listening (%d bytes, errorCode = %d, status = %d)\",\n            utf16ToUtf8String(path).c_str(), bytesTransferred, errorCode, status);\n        return;\n    }\n    status = NOT_LISTENING;\n    server->handleEvents(this, errorCode, buffer, bytesTransferred);\n}\n\nvoid Server::handleEvents(WatchPoint* watchPoint, DWORD errorCode, const vector<BYTE>& buffer, DWORD bytesTransferred) {\n    JNIEnv* env = getThreadEnv();\n    const u16string& path = watchPoint->path;\n\n    try {\n        if (errorCode != ERROR_SUCCESS) {\n            throw FileWatcherException(\"Error received when handling events\", path, errorCode);\n        }\n\n        if (terminated) {\n            log_fine(env, \"Ignoring incoming events for %s because server is terminating (%d bytes)\",\n                utf16ToUtf8String(path).c_str(), bytesTransferred, watchPoint->status);\n            return;\n        }\n\n        if (bytesTransferred == 0) {\n            \/\/ Got a buffer overflow => current changes lost => send INVALIDATE on root\n            log_info(env, \"Detected overflow for %s\", utf16ToUtf8String(path).c_str());\n            reportChange(env, FILE_EVENT_INVALIDATE, path);\n        } else {\n            int index = 0;\n            for (;;) {\n                FILE_NOTIFY_INFORMATION* current = (FILE_NOTIFY_INFORMATION*) &buffer[index];\n                handleEvent(env, path, current);\n                if (current->NextEntryOffset == 0) {\n                    break;\n                }\n                index += current->NextEntryOffset;\n            }\n        }\n\n        watchPoint->listen();\n    } catch (const exception& ex) {\n        reportError(env, ex);\n    }\n}\n\nbool isAbsoluteLocalPath(const u16string& path) {\n    if (path.length() < 3) {\n        return false;\n    }\n    return ((u'a' <= path[0] && path[0] <= u'z') || (u'A' <= path[0] && path[0] <= u'Z'))\n        && path[1] == u':'\n        && path[2] == u'\\\\';\n}\n\nbool isAbsoluteUncPath(const u16string& path) {\n    if (path.length() < 3) {\n        return false;\n    }\n    return path[0] == u'\\\\' && path[1] == u'\\\\';\n}\n\nbool isLongPath(const u16string& path) {\n    return path.length() >= 4 && path.substr(0, 4) == u\"\\\\\\\\?\\\\\";\n}\n\nbool isUncLongPath(const u16string& path) {\n    return path.length() >= 8 && path.substr(0, 8) == u\"\\\\\\\\?\\\\UNC\\\\\";\n}\n\n\/\/ TODO How can this be done nicer, wihtout both unnecessary copy and in-place mutation?\nvoid convertToLongPathIfNeeded(u16string& path) {\n    \/\/ Technically, this should be MAX_PATH (i.e. 260), except some Win32 API related\n    \/\/ to working with directory paths are actually limited to 240. It is just\n    \/\/ safer\/simpler to cover both cases in one code path.\n    if (path.length() <= 240) {\n        return;\n    }\n\n    \/\/ It is already a long path, nothing to do here\n    if (isLongPath(path)) {\n        return;\n    }\n\n    if (isAbsoluteLocalPath(path)) {\n        \/\/ Format: C:\\... -> \\\\?\\C:\\...\n        path.insert(0, u\"\\\\\\\\?\\\\\");\n    } else if (isAbsoluteUncPath(path)) {\n        \/\/ In this case, we need to skip the first 2 characters:\n        \/\/ Format: \\\\server\\share\\... -> \\\\?\\UNC\\server\\share\\...\n        path.erase(0, 2);\n        path.insert(0, u\"\\\\\\\\?\\\\UNC\\\\\");\n    } else {\n        \/\/ It is some sort of unknown format, don't mess with it\n    }\n}\n\nvoid Server::handleEvent(JNIEnv* env, const u16string& path, FILE_NOTIFY_INFORMATION* info) {\n    wstring changedPathW = wstring(info->FileName, 0, info->FileNameLength \/ sizeof(wchar_t));\n    u16string changedPath(changedPathW.begin(), changedPathW.end());\n    if (!changedPath.empty()) {\n        changedPath.insert(0, 1, u'\\\\');\n    }\n    changedPath.insert(0, path);\n    \/\/ TODO Remove long prefix for path once?\n    if (isLongPath(changedPath)) {\n        if (isUncLongPath(changedPath)) {\n            changedPath.erase(0, 8).insert(0, u\"\\\\\\\\\");\n        } else {\n            changedPath.erase(0, 4);\n        }\n    }\n\n    log_fine(env, \"Change detected: 0x%x '%ls'\", info->Action, changedPathW.c_str());\n\n    jint type;\n    if (info->Action == FILE_ACTION_ADDED || info->Action == FILE_ACTION_RENAMED_NEW_NAME) {\n        type = FILE_EVENT_CREATED;\n    } else if (info->Action == FILE_ACTION_REMOVED || info->Action == FILE_ACTION_RENAMED_OLD_NAME) {\n        type = FILE_EVENT_REMOVED;\n    } else if (info->Action == FILE_ACTION_MODIFIED) {\n        type = FILE_EVENT_MODIFIED;\n    } else {\n        log_warning(env, \"Unknown event 0x%x for %ls\", info->Action, changedPathW.c_str());\n        type = FILE_EVENT_UNKNOWN;\n    }\n\n    reportChange(env, type, changedPath);\n}\n\n\/\/\n\/\/ Server\n\/\/\n\nServer::Server(JNIEnv* env, jobject watcherCallback)\n    : AbstractServer(env, watcherCallback) {\n    startThread();\n    \/\/ TODO Error handling\n    SetThreadPriority(this->watcherThread.native_handle(), THREAD_PRIORITY_ABOVE_NORMAL);\n}\n\nvoid Server::terminate() {\n    log_fine(getThreadEnv(), \"Terminating\", NULL);\n    terminated = true;\n}\n\nServer::~Server() {\n    executeOnThread(shared_ptr<Command>(new TerminateCommand()));\n\n    if (watcherThread.joinable()) {\n        watcherThread.join();\n    }\n}\n\nvoid Server::runLoop(JNIEnv* env, function<void(exception_ptr)> notifyStarted) {\n    notifyStarted(nullptr);\n\n    while (!terminated) {\n        SleepEx(INFINITE, true);\n    }\n\n    \/\/ We have received termination, cancel all watchers\n    log_fine(env, \"Finished with run loop, now cancelling remaining watch points\", NULL);\n    int pendingWatchPoints = 0;\n    for (auto& it : watchPoints) {\n        auto& watchPoint = it.second;\n        switch (watchPoint.status) {\n            case LISTENING:\n                watchPoint.cancel();\n                pendingWatchPoints++;\n                break;\n            case CANCELLED:\n                pendingWatchPoints++;\n                break;\n            default:\n                break;\n        }\n    }\n\n    \/\/ If there are any pending watchers, wait for them to finish\n    if (pendingWatchPoints > 0) {\n        log_fine(env, \"Waiting for %d pending watch points to finish\", pendingWatchPoints);\n        SleepEx(SERVER_CLOSE_TIMEOUT_IN_MS, true);\n    }\n\n    \/\/ Warn about  any unfinished watchpoints\n    for (auto& it : watchPoints) {\n        auto& watchPoint = it.second;\n        switch (watchPoint.status) {\n            case FINISHED:\n                break;\n            default:\n                log_warning(env, \"Watch point %s did not finish before termination timeout, status = %d\",\n                    utf16ToUtf8String(watchPoint.path).c_str(), watchPoint.status);\n                break;\n        }\n    }\n}\n\nstatic void CALLBACK processCommandsCallback(_In_ ULONG_PTR info) {\n    Server* server = (Server*) info;\n    server->processCommands();\n}\n\nvoid Server::processCommandsOnThread() {\n    QueueUserAPC(processCommandsCallback, watcherThread.native_handle(), (ULONG_PTR) this);\n}\n\nvoid Server::registerPath(const u16string& path) {\n    u16string longPath = path;\n    convertToLongPathIfNeeded(longPath);\n    auto it = watchPoints.find(longPath);\n    if (it != watchPoints.end()) {\n        if (it->second.status != FINISHED) {\n            throw FileWatcherException(\"Already watching path\", path);\n        }\n        watchPoints.erase(it);\n    }\n    watchPoints.emplace(piecewise_construct,\n        forward_as_tuple(longPath),\n        forward_as_tuple(this, longPath));\n}\n\nvoid Server::unregisterPath(const u16string& path) {\n    u16string longPath = path;\n    convertToLongPathIfNeeded(longPath);\n    auto it = watchPoints.find(longPath);\n    if (it == watchPoints.end()) {\n        log_fine(getThreadEnv(), \"Path is not watched: %s\", utf16ToUtf8String(path).c_str());\n        return;\n    }\n    it->second.cancel();\n}\n\n\/\/\n\/\/ JNI calls\n\/\/\n\nJNIEXPORT jobject JNICALL\nJava_net_rubygrapefruit_platform_internal_jni_WindowsFileEventFunctions_startWatcher(JNIEnv* env, jclass target, jobject javaCallback) {\n    return wrapServer(env, [env, javaCallback]() {\n        return new Server(env, javaCallback);\n    });\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright © 2010, 2011, 2012 Vladimír Vondruš <mosra@centrum.cz>\n\n    This file is part of Magnum.\n\n    Magnum 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    Magnum is distributed in the hope that it 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*\/\n\n#include \"PluginManager\/PluginManager.h\"\n#include \"Scene.h\"\n#include \"Contexts\/GlutContext.h\"\n#include \"Trade\/AbstractImporter.h\"\n\n#include \"Billboard.h\"\n#include \"ColorCorrectionCamera.h\"\n\n#include \"configure.h\"\n\nusing namespace Corrade::PluginManager;\n\nnamespace Magnum { namespace Examples {\n\nclass FramebufferExample: public Contexts::GlutContext {\n    public:\n        FramebufferExample(int& argc, char** argv): GlutContext(argc, argv, \"Framebuffer example\"), colorCorrectionBuffer(Buffer::Target::Texture) {\n            if(argc != 2) {\n                Debug() << \"Usage:\" << argv[0] << \"image.tga\";\n                exit(0);\n            }\n\n            camera = new ColorCorrectionCamera(&scene);\n\n            \/* Load TGA importer plugin *\/\n            PluginManager<Trade::AbstractImporter> manager(MAGNUM_PLUGINS_IMPORTER_DIR);\n            Trade::AbstractImporter* importer;\n            if(manager.load(\"TgaImporter\") != AbstractPluginManager::LoadOk || !(importer = manager.instance(\"TgaImporter\"))) {\n                Error() << \"Cannot load TgaImporter plugin from\" << manager.pluginDirectory();\n                exit(1);\n            }\n\n            \/* Load the image *\/\n            if(!importer->open(argv[1]) || !importer->image2DCount()) {\n                Error() << \"Cannot open image\" << argv[1];\n                exit(2);\n            }\n\n            \/* Create color correction texture *\/\n            GLfloat texture[1024];\n            for(size_t i = 0; i != 1024; ++i) {\n                GLfloat x = i*2\/1023.0-1;\n                texture[i] = (sin(x*Math::Constants<float>::pi())\/3.7f+x+1)\/2;\n            }\n            colorCorrectionBuffer.setData(sizeof(texture), texture, Buffer::Usage::StaticDraw);\n\n            \/* Add billboard to the scene *\/\n            billboard = new Billboard(importer->image2D(0), &colorCorrectionBuffer, &scene);\n            delete importer;\n        }\n\n    protected:\n        inline void viewportEvent(const Math::Vector2<GLsizei>& size) {\n            camera->setViewport(size);\n        }\n\n        inline void drawEvent() {\n            camera->draw();\n            swapBuffers();\n        }\n\n        void mouseEvent(MouseButton button, MouseState, const Math::Vector2<int>& position) {\n            if(button == MouseButton::WheelUp)\n                billboard->scale(Vector3(5.0f\/4));\n            else if(button == MouseButton::WheelDown)\n                billboard->scale(Vector3(4.0f\/5));\n\n            previous = position;\n            redraw();\n        }\n\n        void mouseMoveEvent(const Math::Vector2<int>& position) {\n            Math::Vector2<int> delta = position-previous;\n            billboard->translate({GLfloat(delta.x())\/camera->viewport().x(),\n                                 -GLfloat(delta.y())\/camera->viewport().y(),\n                                  0});\n            previous = position;\n            redraw();\n        }\n\n    private:\n        Math::Vector2<int> previous;\n        Scene scene;\n        Camera* camera;\n        Billboard* billboard;\n        Buffer colorCorrectionBuffer;\n};\n\n}}\n\nint main(int argc, char** argv) {\n    Magnum::Examples::FramebufferExample e(argc, argv);\n    return e.exec();\n}\n<commit_msg>Fixed float -> double promotion.<commit_after>\/*\n    Copyright © 2010, 2011, 2012 Vladimír Vondruš <mosra@centrum.cz>\n\n    This file is part of Magnum.\n\n    Magnum 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    Magnum is distributed in the hope that it 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*\/\n\n#include \"PluginManager\/PluginManager.h\"\n#include \"Scene.h\"\n#include \"Contexts\/GlutContext.h\"\n#include \"Trade\/AbstractImporter.h\"\n\n#include \"Billboard.h\"\n#include \"ColorCorrectionCamera.h\"\n\n#include \"configure.h\"\n\nusing namespace Corrade::PluginManager;\n\nnamespace Magnum { namespace Examples {\n\nclass FramebufferExample: public Contexts::GlutContext {\n    public:\n        FramebufferExample(int& argc, char** argv): GlutContext(argc, argv, \"Framebuffer example\"), colorCorrectionBuffer(Buffer::Target::Texture) {\n            if(argc != 2) {\n                Debug() << \"Usage:\" << argv[0] << \"image.tga\";\n                exit(0);\n            }\n\n            camera = new ColorCorrectionCamera(&scene);\n\n            \/* Load TGA importer plugin *\/\n            PluginManager<Trade::AbstractImporter> manager(MAGNUM_PLUGINS_IMPORTER_DIR);\n            Trade::AbstractImporter* importer;\n            if(manager.load(\"TgaImporter\") != AbstractPluginManager::LoadOk || !(importer = manager.instance(\"TgaImporter\"))) {\n                Error() << \"Cannot load TgaImporter plugin from\" << manager.pluginDirectory();\n                exit(1);\n            }\n\n            \/* Load the image *\/\n            if(!importer->open(argv[1]) || !importer->image2DCount()) {\n                Error() << \"Cannot open image\" << argv[1];\n                exit(2);\n            }\n\n            \/* Create color correction texture *\/\n            GLfloat texture[1024];\n            for(size_t i = 0; i != 1024; ++i) {\n                GLfloat x = i*2\/1023.0-1;\n                texture[i] = (float(sin(x*Math::Constants<float>::pi()))\/3.7f+x+1)\/2;\n            }\n            colorCorrectionBuffer.setData(sizeof(texture), texture, Buffer::Usage::StaticDraw);\n\n            \/* Add billboard to the scene *\/\n            billboard = new Billboard(importer->image2D(0), &colorCorrectionBuffer, &scene);\n            delete importer;\n        }\n\n    protected:\n        inline void viewportEvent(const Math::Vector2<GLsizei>& size) {\n            camera->setViewport(size);\n        }\n\n        inline void drawEvent() {\n            camera->draw();\n            swapBuffers();\n        }\n\n        void mouseEvent(MouseButton button, MouseState, const Math::Vector2<int>& position) {\n            if(button == MouseButton::WheelUp)\n                billboard->scale(Vector3(5.0f\/4));\n            else if(button == MouseButton::WheelDown)\n                billboard->scale(Vector3(4.0f\/5));\n\n            previous = position;\n            redraw();\n        }\n\n        void mouseMoveEvent(const Math::Vector2<int>& position) {\n            Math::Vector2<int> delta = position-previous;\n            billboard->translate({GLfloat(delta.x())\/camera->viewport().x(),\n                                 -GLfloat(delta.y())\/camera->viewport().y(),\n                                  0});\n            previous = position;\n            redraw();\n        }\n\n    private:\n        Math::Vector2<int> previous;\n        Scene scene;\n        Camera* camera;\n        Billboard* billboard;\n        Buffer colorCorrectionBuffer;\n};\n\n}}\n\nint main(int argc, char** argv) {\n    Magnum::Examples::FramebufferExample e(argc, argv);\n    return e.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _RICE_DECODED_DATA_H_\n#define _RICE_DECODED_DATA_H_\n\n#include <cstdint>\n#include <vector>\n\nnamespace data {\nclass RiceDecodedData {\npublic:\n    const std::vector<int32_t> decodedData;\n    explicit RiceDecodedData(const std::vector<int32_t>&& decodedData) noexcept;\n};\n\nRiceDecodedData::RiceDecodedData(const std::vector<int32_t>&& decodedData) noexcept\n    : decodedData(decodedData)\n{\n}\n}\n\n#endif<commit_msg>Chnages reverted<commit_after>#ifndef _RICE_DECODED_DATA_H_\n#define _RICE_DECODED_DATA_H_\n\n#include <cstdint>\n#include <vector>\n\nnamespace data {\nclass RiceDecodedData {\npublic:\n    const std::vector<int32_t> decodedData;\n    explicit RiceDecodedData(const std::vector<int32_t>&& decodedData) noexcept\n        : decodedData(decodedData)\n    {\n    }\n};\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n medInria\n\n Copyright (c) INRIA 2013. All rights reserved.\n See LICENSE.txt 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.\n\n=========================================================================*\/\n\n#include <QtCore>\n#include <QShortcut>\n\n#include \"medTabbedViewContainers.h\"\n\n#include \"medViewContainer.h\"\n#include \"medCustomViewContainer.h\"\n#include \"medMultiViewContainer.h\"\n#include \"medSingleViewContainer.h\"\n\nclass medTabbedViewContainersPrivate\n{\npublic:\n    QHash<QString, medViewContainer*> containers;\n    QString currentName;\n    QShortcut *closeShortcut;\n    \n    QPushButton *addButton;\n};\n\nmedTabbedViewContainers::medTabbedViewContainers(QWidget *parent) : QTabWidget(parent), d(new medTabbedViewContainersPrivate)\n{\n    this->setTabsClosable(true);\n    this->setMovable(true);\n\n    connect(this,SIGNAL(tabCloseRequested(int)),this,SLOT(deleteContainerClicked(int)));\n    connect(this,SIGNAL(currentChanged(int)),this,SLOT(onCurrentContainerChanged(int)));\n\n    d->addButton = new QPushButton(this);\n    d->addButton->setStyleSheet(\"background-image: url(:medGui\/pixmaps\/plus_button.png);background-position: center;background-repeat: no-repeat;\");\n    d->addButton->setShortcut(Qt::ControlModifier + Qt::Key_T);\n    this->setCornerWidget(d->addButton);\n\n    connect(d->addButton,SIGNAL(clicked()),this,SIGNAL(addTabButtonClicked()));\n    \n    d->closeShortcut = new QShortcut(this);\n    d->closeShortcut->setKey(Qt::ControlModifier + Qt::Key_W);\n    connect(d->closeShortcut,SIGNAL(activated()),this,SLOT(deleteContainerShortcutActivated()));\n}\n\nmedTabbedViewContainers::~medTabbedViewContainers(void)\n{\n    delete d;\n\n    d = NULL;\n}\n\nvoid medTabbedViewContainers::lockTabs()\n{\n    this->setTabsClosable(false);\n    this->setMovable(false);\n    d->addButton->hide();\n}\n\nvoid medTabbedViewContainers::unlockTabs()\n{\n    this->setTabsClosable(true);\n    this->setMovable(true);\n    d->addButton->show();\n}\n\n\/*\nvoid medTabbedViewContainers::addNewTabContainer()\n{\n    \/\/ This slot should disappear, instead the creation signal should be sent to the parent who should call for the creation of a new tab\n    QString name = \"Tab \";\n    name += QString::number(this->count());\n\n    if (!this->container(name))\n    {\n        medViewContainer *new_container = new medMultiViewContainer();\n        addContainer(name, new_container);\n        this->setContainer(name);\n    }\n    else\n        qDebug() << \"Container\" << name << \"already exists in this workspaces\";\n}\n*\/\n\nvoid medTabbedViewContainers::deleteContainerShortcutActivated()\n{\n    int index = this->currentIndex();\n    this->deleteContainerClicked(index);\n}\n\nvoid medTabbedViewContainers::deleteContainerClicked(int index)\n{\n    if (this->count() == 1)\n    {\n        QString name = this->current()->identifier();\n\n        medViewContainer *newTab = NULL;\n        if (name == \"Single\")\n            newTab = new medSingleViewContainer();\n        else if (name == \"Custom\")\n            newTab = new medCustomViewContainer();\n        else if (name == \"Multi\")\n            newTab = new medMultiViewContainer();\n\n        if (newTab != NULL)\n        {\n            this->blockSignals(true);\n            QString tabName = this->tabText(index);\n            this->removeTab(index);\n            this->insertContainer(index,tabName,newTab);\n            this->setCurrentIndex(index);\n            this->blockSignals(false);\n\n            this->onCurrentContainerChanged(index);\n        }\n    }\n    else\n    {\n        d->containers.remove(this->tabText(index));\n        this->removeTab(index);\n    }\n}\n\nvoid medTabbedViewContainers::addContainer(const QString &name, medViewContainer *container)\n{\n    if (!container)\n        return;\n    \n    d->containers[name] = container;\n\n    connect( container, SIGNAL( focused( dtkAbstractView * ) ),\n             this,      SIGNAL( focused( dtkAbstractView * ) ) );\n    connect( container, SIGNAL( imageSet( const medDataIndex & ) ),\n             this,      SIGNAL( imageSet( const medDataIndex & ) ) );\n    connect( container, SIGNAL( viewAdded( dtkAbstractView * ) ),\n             this,      SIGNAL( viewAdded( dtkAbstractView * ) ) );\n    connect( container, SIGNAL( viewRemoved( dtkAbstractView * ) ),\n             this,      SIGNAL( viewRemoved( dtkAbstractView * ) ) );\n\n    if (!this->count())\n        d->currentName = name;\n\n    this->addTab(container, name);\n}\n\nvoid medTabbedViewContainers::insertContainer(int index, const QString &name, medViewContainer *container)\n{\n    if (!container)\n        return;\n\n    d->containers[name] = container;\n\n    connect( container, SIGNAL( focused( dtkAbstractView * ) ),\n             this,      SIGNAL( focused( dtkAbstractView * ) ) );\n    connect( container, SIGNAL( imageSet( const medDataIndex & ) ),\n             this,      SIGNAL( imageSet( const medDataIndex & ) ) );\n\n    connect( container, SIGNAL( viewAdded( dtkAbstractView * ) ),\n             this,      SIGNAL( viewAdded( dtkAbstractView * ) ) );\n    connect( container, SIGNAL( viewRemoved( dtkAbstractView * ) ),\n             this,      SIGNAL( viewRemoved( dtkAbstractView * ) ) );\n\n    if (!this->count())\n        d->currentName = name;\n\n    this->insertTab(index,container, name);\n}\n\nvoid medTabbedViewContainers::changeCurrentContainerName(const QString &name)\n{\n    unsigned int index = this->currentIndex();\n    QString currentName = this->tabText(index);\n    medViewContainer *currentContainer = d->containers[currentName];\n    d->containers.remove(currentName);\n    \n    QString newName = name;\n    if (this->container(newName))\n    {\n        unsigned int i = 1;\n        newName = name + \" \";\n        newName += QString::number(i);\n        while (this->container(newName))\n        {\n            ++i;\n            newName = name + \" \";\n            newName += QString::number(i);\n        }\n    }\n    \n    this->setTabText(index,newName);\n    d->containers[newName] = currentContainer;\n}\n\nvoid medTabbedViewContainers::changeCurrentContainerType(const QString &name)\n{\n    \/\/qDebug() << \"Changing container type to \" << name << \" from \" << this->current()->identifier();\n    \/\/qDebug() << \"Current index is \" << this->currentIndex() << \" and tab name \" << this->tabText(this->currentIndex());\n\n    if ((!this->current()->views().isEmpty()) && (name != this->current()->identifier()))\n    {\n        QMessageBox msgBox ( this );\n        msgBox.setIcon ( QMessageBox::Warning );\n        msgBox.setText(tr(\"Current tab is not empty. Changing tab type will delete current views.\"));\n        msgBox.setInformativeText(tr(\"Are you sure you wish to change tab type?\"));\n        msgBox.setStandardButtons(QMessageBox::Yes | QMessageBox::No);\n        msgBox.setDefaultButton(QMessageBox::No);\n        int reply = msgBox.exec();\n\n        if( reply == QMessageBox::No )\n        {\n            this->onCurrentContainerChanged(this->currentIndex());\n            return;\n        }\n    }\n\n    if (name != this->current()->identifier())\n    {\n        medViewContainer *newTab = NULL;\n        if (name == \"Single\")\n            newTab = new medSingleViewContainer();\n        else if (name == \"Custom\")\n            newTab = new medCustomViewContainer();\n        else if (name == \"Multi\")\n            newTab = new medMultiViewContainer();\n\n        if (newTab != NULL)\n        {\n            this->blockSignals(true);\n            int index = this->currentIndex();\n            QString tabName = this->tabText(index);\n            this->removeTab(index);\n            this->insertContainer(index,tabName,newTab);\n            this->setCurrentIndex(index);\n            this->blockSignals(false);\n\n            this->onCurrentContainerChanged(index);\n        }\n    }\n}\n\nmedViewContainer* medTabbedViewContainers::container(const QString &name) const\n{\n    if (!d->containers.contains(name))\n        return NULL;\n\n    return d->containers[name];\n}\n\nvoid medTabbedViewContainers::hideTabBar()\n{\n    QTabBar *tabBar = this->tabBar();\n    tabBar->hide();\n}\n\nvoid medTabbedViewContainers::setContainer(const QString &name)\n{\n    if (!d->containers.contains(name))\n    {\n        qWarning()<<\"container does not contain any container of name:\" << name;\n        return;\n    }\n\n    d->currentName = name;\n    this->setCurrentWidget(d->containers[name]);\n}\n\nmedViewContainer *medTabbedViewContainers::current(void) const\n{\n    return qobject_cast<medViewContainer*> (currentWidget());\n}\n\nQString medTabbedViewContainers::currentName(void) const\n{\n    return d->currentName;\n}\n\nQList<QString> medTabbedViewContainers::keys()\n{\n    return d->containers.keys();\n}\n\nvoid medTabbedViewContainers::removeContainer(const QString& name)\n{\n    if (d->containers.contains(name))\n    {\n        medViewContainer* container = d->containers[name];\n        \/\/removeWidget(container);\n        container->deleteLater();\n        d->containers.remove(name);\n\n        this->blockSignals(true); \/\/ to prevent emission of currentChanged (int)\n        this->removeTab( this->indexOf(container) );\n        this->blockSignals(false);\n    }\n}\n\nvoid medTabbedViewContainers::onCurrentContainerChanged(int index)\n{\n    QString name = this->tabText(index);\n\n    emit currentChanged(name);\n}\n<commit_msg>Fix reset problems of view properties toolbox when changing tabs<commit_after>\/*=========================================================================\n\n medInria\n\n Copyright (c) INRIA 2013. All rights reserved.\n See LICENSE.txt 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.\n\n=========================================================================*\/\n\n#include <QtCore>\n#include <QShortcut>\n\n#include \"medTabbedViewContainers.h\"\n\n#include \"medViewContainer.h\"\n#include \"medCustomViewContainer.h\"\n#include \"medMultiViewContainer.h\"\n#include \"medSingleViewContainer.h\"\n\nclass medTabbedViewContainersPrivate\n{\npublic:\n    QHash<QString, medViewContainer*> containers;\n    QString currentName;\n    QShortcut *closeShortcut;\n    \n    QPushButton *addButton;\n};\n\nmedTabbedViewContainers::medTabbedViewContainers(QWidget *parent) : QTabWidget(parent), d(new medTabbedViewContainersPrivate)\n{\n    this->setTabsClosable(true);\n    this->setMovable(true);\n\n    connect(this,SIGNAL(tabCloseRequested(int)),this,SLOT(deleteContainerClicked(int)));\n    connect(this,SIGNAL(currentChanged(int)),this,SLOT(onCurrentContainerChanged(int)));\n\n    d->addButton = new QPushButton(this);\n    d->addButton->setStyleSheet(\"background-image: url(:medGui\/pixmaps\/plus_button.png);background-position: center;background-repeat: no-repeat;\");\n    d->addButton->setShortcut(Qt::ControlModifier + Qt::Key_T);\n    this->setCornerWidget(d->addButton);\n\n    connect(d->addButton,SIGNAL(clicked()),this,SIGNAL(addTabButtonClicked()));\n    \n    d->closeShortcut = new QShortcut(this);\n    d->closeShortcut->setKey(Qt::ControlModifier + Qt::Key_W);\n    connect(d->closeShortcut,SIGNAL(activated()),this,SLOT(deleteContainerShortcutActivated()));\n}\n\nmedTabbedViewContainers::~medTabbedViewContainers(void)\n{\n    delete d;\n\n    d = NULL;\n}\n\nvoid medTabbedViewContainers::lockTabs()\n{\n    this->setTabsClosable(false);\n    this->setMovable(false);\n    d->addButton->hide();\n}\n\nvoid medTabbedViewContainers::unlockTabs()\n{\n    this->setTabsClosable(true);\n    this->setMovable(true);\n    d->addButton->show();\n}\n\n\/*\nvoid medTabbedViewContainers::addNewTabContainer()\n{\n    \/\/ This slot should disappear, instead the creation signal should be sent to the parent who should call for the creation of a new tab\n    QString name = \"Tab \";\n    name += QString::number(this->count());\n\n    if (!this->container(name))\n    {\n        medViewContainer *new_container = new medMultiViewContainer();\n        addContainer(name, new_container);\n        this->setContainer(name);\n    }\n    else\n        qDebug() << \"Container\" << name << \"already exists in this workspaces\";\n}\n*\/\n\nvoid medTabbedViewContainers::deleteContainerShortcutActivated()\n{\n    int index = this->currentIndex();\n    this->deleteContainerClicked(index);\n}\n\nvoid medTabbedViewContainers::deleteContainerClicked(int index)\n{\n    if (this->count() == 1)\n    {\n        QString name = this->current()->identifier();\n\n        medViewContainer *newTab = NULL;\n        if (name == \"Single\")\n            newTab = new medSingleViewContainer();\n        else if (name == \"Custom\")\n            newTab = new medCustomViewContainer();\n        else if (name == \"Multi\")\n            newTab = new medMultiViewContainer();\n\n        if (newTab != NULL)\n        {\n            this->blockSignals(true);\n            QString tabName = this->tabText(index);\n            this->removeTab(index);\n            this->insertContainer(index,tabName,newTab);\n            this->setCurrentIndex(index);\n            this->blockSignals(false);\n\n            this->onCurrentContainerChanged(index);\n        }\n    }\n    else\n    {\n        d->containers.remove(this->tabText(index));\n        this->removeTab(index);\n    }\n}\n\nvoid medTabbedViewContainers::addContainer(const QString &name, medViewContainer *container)\n{\n    if (!container)\n        return;\n    \n    d->containers[name] = container;\n\n    connect( container, SIGNAL( focused( dtkAbstractView * ) ),\n             this,      SIGNAL( focused( dtkAbstractView * ) ) );\n    connect( container, SIGNAL( imageSet( const medDataIndex & ) ),\n             this,      SIGNAL( imageSet( const medDataIndex & ) ) );\n    connect( container, SIGNAL( viewAdded( dtkAbstractView * ) ),\n             this,      SIGNAL( viewAdded( dtkAbstractView * ) ) );\n    connect( container, SIGNAL( viewRemoved( dtkAbstractView * ) ),\n             this,      SIGNAL( viewRemoved( dtkAbstractView * ) ) );\n\n    if (!this->count())\n        d->currentName = name;\n\n    this->addTab(container, name);\n    \n    emit focused(NULL);\n}\n\nvoid medTabbedViewContainers::insertContainer(int index, const QString &name, medViewContainer *container)\n{\n    if (!container)\n        return;\n\n    d->containers[name] = container;\n\n    connect( container, SIGNAL( focused( dtkAbstractView * ) ),\n             this,      SIGNAL( focused( dtkAbstractView * ) ) );\n    connect( container, SIGNAL( imageSet( const medDataIndex & ) ),\n             this,      SIGNAL( imageSet( const medDataIndex & ) ) );\n\n    connect( container, SIGNAL( viewAdded( dtkAbstractView * ) ),\n             this,      SIGNAL( viewAdded( dtkAbstractView * ) ) );\n    connect( container, SIGNAL( viewRemoved( dtkAbstractView * ) ),\n             this,      SIGNAL( viewRemoved( dtkAbstractView * ) ) );\n\n    if (!this->count())\n        d->currentName = name;\n\n    this->insertTab(index,container, name);\n}\n\nvoid medTabbedViewContainers::changeCurrentContainerName(const QString &name)\n{\n    unsigned int index = this->currentIndex();\n    QString currentName = this->tabText(index);\n    medViewContainer *currentContainer = d->containers[currentName];\n    d->containers.remove(currentName);\n    \n    QString newName = name;\n    if (this->container(newName))\n    {\n        unsigned int i = 1;\n        newName = name + \" \";\n        newName += QString::number(i);\n        while (this->container(newName))\n        {\n            ++i;\n            newName = name + \" \";\n            newName += QString::number(i);\n        }\n    }\n    \n    this->setTabText(index,newName);\n    d->containers[newName] = currentContainer;\n}\n\nvoid medTabbedViewContainers::changeCurrentContainerType(const QString &name)\n{\n    \/\/qDebug() << \"Changing container type to \" << name << \" from \" << this->current()->identifier();\n    \/\/qDebug() << \"Current index is \" << this->currentIndex() << \" and tab name \" << this->tabText(this->currentIndex());\n\n    if ((!this->current()->views().isEmpty()) && (name != this->current()->identifier()))\n    {\n        QMessageBox msgBox ( this );\n        msgBox.setIcon ( QMessageBox::Warning );\n        msgBox.setText(tr(\"Current tab is not empty. Changing tab type will delete current views.\"));\n        msgBox.setInformativeText(tr(\"Are you sure you wish to change tab type?\"));\n        msgBox.setStandardButtons(QMessageBox::Yes | QMessageBox::No);\n        msgBox.setDefaultButton(QMessageBox::No);\n        int reply = msgBox.exec();\n\n        if( reply == QMessageBox::No )\n        {\n            this->onCurrentContainerChanged(this->currentIndex());\n            return;\n        }\n    }\n\n    if (name != this->current()->identifier())\n    {\n        medViewContainer *newTab = NULL;\n        if (name == \"Single\")\n            newTab = new medSingleViewContainer();\n        else if (name == \"Custom\")\n            newTab = new medCustomViewContainer();\n        else if (name == \"Multi\")\n            newTab = new medMultiViewContainer();\n\n        if (newTab != NULL)\n        {\n            this->blockSignals(true);\n            int index = this->currentIndex();\n            QString tabName = this->tabText(index);\n            this->removeTab(index);\n            this->insertContainer(index,tabName,newTab);\n            this->setCurrentIndex(index);\n            this->blockSignals(false);\n\n            this->onCurrentContainerChanged(index);\n        }\n    }\n}\n\nmedViewContainer* medTabbedViewContainers::container(const QString &name) const\n{\n    if (!d->containers.contains(name))\n        return NULL;\n\n    return d->containers[name];\n}\n\nvoid medTabbedViewContainers::hideTabBar()\n{\n    QTabBar *tabBar = this->tabBar();\n    tabBar->hide();\n}\n\nvoid medTabbedViewContainers::setContainer(const QString &name)\n{\n    if (!d->containers.contains(name))\n    {\n        qWarning()<<\"container does not contain any container of name:\" << name;\n        return;\n    }\n\n    d->currentName = name;\n    this->setCurrentWidget(d->containers[name]);\n}\n\nmedViewContainer *medTabbedViewContainers::current(void) const\n{\n    return qobject_cast<medViewContainer*> (currentWidget());\n}\n\nQString medTabbedViewContainers::currentName(void) const\n{\n    return d->currentName;\n}\n\nQList<QString> medTabbedViewContainers::keys()\n{\n    return d->containers.keys();\n}\n\nvoid medTabbedViewContainers::removeContainer(const QString& name)\n{\n    if (d->containers.contains(name))\n    {\n        medViewContainer* container = d->containers[name];\n        \/\/removeWidget(container);\n        container->deleteLater();\n        d->containers.remove(name);\n\n        this->blockSignals(true); \/\/ to prevent emission of currentChanged (int)\n        this->removeTab( this->indexOf(container) );\n        this->blockSignals(false);\n    }\n}\n\nvoid medTabbedViewContainers::onCurrentContainerChanged(int index)\n{\n    QString name = this->tabText(index);\n\n    emit focused(container(name)->current()->view());\n    emit currentChanged(name);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2004-2020 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#include \"MessageQueue.h\"\n\n#include <algorithm>\n#include <chrono>\n\nusing namespace std::chrono;\nusing namespace musik::core::runtime;\n\nusing LockT = std::unique_lock<std::mutex>;\n\nMessageQueue::MessageQueue() {\n    this->nextMessageTime.store(1);\n}\n\nvoid MessageQueue::WaitAndDispatch(int64_t timeoutMillis) {\n    {\n        LockT lock(this->queueMutex);\n\n        if (this->queue.size()) {\n            auto waitTime = duration_cast<milliseconds>(\n                this->queue.front()->time -\n                system_clock::now().time_since_epoch());\n\n            if (timeoutMillis >= 0) {\n                auto timeoutDuration = milliseconds(timeoutMillis);\n                if (waitTime > timeoutDuration) {\n                    waitTime = timeoutDuration;\n                }\n            }\n\n            if (waitTime.count() > 0) {\n                waitForDispatch.wait_for(lock, waitTime);\n            }\n       }\n        else {\n            if (timeoutMillis >= 0) {\n                waitForDispatch.wait_for(lock, milliseconds(timeoutMillis));\n            }\n            else {\n                waitForDispatch.wait(lock);\n            }\n        }\n    }\n\n    this->Dispatch();\n}\n\nMessageQueue::~MessageQueue() {\n\n}\n\nvoid MessageQueue::Dispatch() {\n    milliseconds now = duration_cast<milliseconds>(\n        system_clock::now().time_since_epoch());\n\n    int64_t nextTime = nextMessageTime.load();\n\n    if (nextTime > now.count() || nextTime < 0) {\n        return; \/* short circuit before any iteration. *\/\n    }\n\n    using Iterator = std::list<EnqueuedMessage*>::iterator;\n\n    {\n        LockT lock(this->queueMutex);\n\n        this->nextMessageTime.store(-1);\n\n        Iterator it = this->queue.begin();\n\n        bool done = false;\n        while (!done && it != this->queue.end()) {\n            \/* messages are time-ordered. pop and dispatch one at a time\n            until we get to a message that should be delivered in the future,\n            or the queue has been exhausted. *\/\n\n            EnqueuedMessage *m = (*it);\n\n            if (now >= m->time) {\n                \/* it's possible the target (receiver) has been unregistered;\n                if that's the case, just discard it. otherwise, add it to the\n                output set to be dispatched outside of the critical section *\/\n                if (this->targets.find((*it)->message->Target()) != this->targets.end()) {\n                    this->dispatch.push_back(m);\n                }\n                it = this->queue.erase(it);\n            }\n            else {\n                done = true;\n            }\n        }\n    }\n\n    \/* dispatch outside of the critical section *\/\n\n    Iterator it = this->dispatch.begin();\n    while (it != this->dispatch.end()) {\n        this->Dispatch((*it)->message);\n        delete *it;\n        it++;\n    }\n\n    this->dispatch.clear();\n\n    if (this->queue.size()) {\n        this->nextMessageTime.store((*this->queue.begin())->time.count());\n    }\n}\n\nvoid MessageQueue::Register(IMessageTarget* target) {\n    LockT lock(this->queueMutex);\n    this->targets.insert(target);\n}\n\nvoid MessageQueue::Unregister(IMessageTarget* target) {\n    bool shouldRemove = false;\n    {\n        LockT lock(this->queueMutex);\n        if (this->targets.find(target) != this->targets.end()) {\n            this->targets.erase(target);\n            shouldRemove = true;\n        }\n    }\n    if (shouldRemove) {\n        this->Remove(target);\n    }\n}\n\nvoid MessageQueue::RegisterForBroadcasts(IMessageTargetPtr target) {\n    LockT lock(this->queueMutex);\n    this->receivers.insert(target);\n}\n\nvoid MessageQueue::UnregisterForBroadcasts(IMessageTarget *target) {\n    LockT lock(this->queueMutex);\n    for (auto it : this->receivers) {\n        auto shared = it.lock();\n        if (shared && shared.get() == target) {\n            this->receivers.erase(it);\n            return;\n        }\n    }\n}\n\nint MessageQueue::Remove(IMessageTarget *target, int type) {\n    LockT lock(this->queueMutex);\n\n    int count = 0;\n    std::list<EnqueuedMessage*>::iterator it = this->queue.begin();\n    while (it != this->queue.end()) {\n        IMessagePtr current = (*it)->message;\n\n        if (current->Target() == target) {\n            if (type == -1 || type == current->Type()) {\n                delete (*it);\n                it = this->queue.erase(it);\n                ++count;\n                continue;\n            }\n        }\n\n        ++it;\n    }\n\n    if (this->queue.size()) {\n        this->nextMessageTime.store((*this->queue.begin())->time.count());\n    }\n\n    return count;\n}\n\nbool MessageQueue::Contains(IMessageTarget *target, int type) {\n    LockT lock(this->queueMutex);\n\n    std::list<EnqueuedMessage*>::iterator it = this->queue.begin();\n    while (it != this->queue.end()) {\n        IMessagePtr current = (*it)->message;\n\n        if (current->Target() == target) {\n            if (type == -1 || type == current->Type()) {\n                return true;\n            }\n        }\n\n        ++it;\n    }\n    return false;\n}\n\nvoid MessageQueue::Broadcast(IMessagePtr message, int64_t delayMs) {\n    LockT lock(this->queueMutex);\n\n    if (message->Target()) {\n        throw new std::runtime_error(\"broadcasts cannot have a target!\");\n    }\n\n    this->Enqueue(message, delayMs);\n}\n\nvoid MessageQueue::Post(IMessagePtr message, int64_t delayMs) {\n    LockT lock(this->queueMutex);\n\n    if (this->targets.find(message->Target()) == this->targets.end()) {\n        return;\n    }\n\n    this->Enqueue(message, delayMs);\n}\n\nvoid MessageQueue::Enqueue(IMessagePtr message, int64_t delayMs) {\n    delayMs = std::max((int64_t) 0, delayMs);\n\n    milliseconds now = duration_cast<milliseconds>(\n        system_clock::now().time_since_epoch());\n\n    EnqueuedMessage *m = new EnqueuedMessage();\n    m->message = message;\n    m->time = now + milliseconds(delayMs);\n\n    \/* the queue is time ordered. start from the front of the queue, and\n    work our way back until we find the correct place to insert the new one *\/\n\n    typedef std::list<EnqueuedMessage*>::iterator Iterator;\n    Iterator curr = this->queue.begin();\n\n    while (curr != this->queue.end()) {\n        if ((*curr)->time <= m->time) {\n            curr++;\n        }\n        else {\n            break;\n        }\n    }\n\n    bool first = (curr == this->queue.begin());\n\n    this->queue.insert(curr, m);\n\n    if (this->queue.size()) {\n        this->nextMessageTime.store((*this->queue.begin())->time.count());\n    }\n\n    if (first) {\n        this->waitForDispatch.notify_all();\n    }\n}\n\nvoid MessageQueue::Debounce(IMessagePtr message, int64_t delayMs) {\n    Remove(message->Target(), message->Type());\n    Post(message, delayMs);\n}\n\nvoid MessageQueue::Dispatch(IMessagePtr message) {\n    if (message->Target()) {\n        message->Target()->ProcessMessage(*message);\n    }\n    else {\n        std::set<IWeakMessageTarget, WeakPtrLess> copy;\n\n        \/* copy to dispatch outside of a lock *\/\n        {\n            LockT lock(this->queueMutex);\n            std::copy(\n                receivers.begin(),\n                receivers.end(),\n                std::inserter(copy, copy.begin()));\n        }\n\n        \/* dispatch *\/\n        bool prune = false;\n        for (auto receiver : copy) {\n            auto shared = receiver.lock();\n            if (shared) {\n                shared->ProcessMessage(*message);\n            }\n            else {\n                prune = true;\n            }\n        }\n\n        if (prune) { \/* at least one of our weak_ptrs is dead. *\/\n            LockT lock(this->queueMutex);\n            auto it = this->receivers.begin();\n            while (it != this->receivers.end()) {\n                if (it->expired()) {\n                    it = this->receivers.erase(it);\n                }\n                else {\n                    ++it;\n                }\n            }\n        }\n    }\n}\n<commit_msg>Fixed MessageQueue broadcast dispatching<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2004-2020 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#include \"MessageQueue.h\"\n\n#include <algorithm>\n#include <chrono>\n\nusing namespace std::chrono;\nusing namespace musik::core::runtime;\n\nusing LockT = std::unique_lock<std::mutex>;\n\nMessageQueue::MessageQueue() {\n    this->nextMessageTime.store(1);\n}\n\nvoid MessageQueue::WaitAndDispatch(int64_t timeoutMillis) {\n    {\n        LockT lock(this->queueMutex);\n\n        if (this->queue.size()) {\n            auto waitTime = duration_cast<milliseconds>(\n                this->queue.front()->time -\n                system_clock::now().time_since_epoch());\n\n            if (timeoutMillis >= 0) {\n                auto timeoutDuration = milliseconds(timeoutMillis);\n                if (waitTime > timeoutDuration) {\n                    waitTime = timeoutDuration;\n                }\n            }\n\n            if (waitTime.count() > 0) {\n                waitForDispatch.wait_for(lock, waitTime);\n            }\n       }\n        else {\n            if (timeoutMillis >= 0) {\n                waitForDispatch.wait_for(lock, milliseconds(timeoutMillis));\n            }\n            else {\n                waitForDispatch.wait(lock);\n            }\n        }\n    }\n\n    this->Dispatch();\n}\n\nMessageQueue::~MessageQueue() {\n\n}\n\nvoid MessageQueue::Dispatch() {\n    milliseconds now = duration_cast<milliseconds>(\n        system_clock::now().time_since_epoch());\n\n    int64_t nextTime = nextMessageTime.load();\n\n    if (nextTime > now.count() || nextTime < 0) {\n        return; \/* short circuit before any iteration. *\/\n    }\n\n    using Iterator = std::list<EnqueuedMessage*>::iterator;\n\n    {\n        LockT lock(this->queueMutex);\n\n        this->nextMessageTime.store(-1);\n\n        Iterator it = this->queue.begin();\n\n        bool done = false;\n        while (!done && it != this->queue.end()) {\n            \/* messages are time-ordered. pop and dispatch one at a time\n            until we get to a message that should be delivered in the future,\n            or the queue has been exhausted. *\/\n\n            EnqueuedMessage *m = (*it);\n\n            if (now >= m->time) {\n                \/* it's possible the target (receiver) has been unregistered;\n                if that's the case, just discard it. otherwise, add it to the\n                output set to be dispatched outside of the critical section *\/\n                auto const target = (*it)->message->Target();\n                if (target == nullptr || this->targets.find(target) != this->targets.end()) {\n                    this->dispatch.push_back(m);\n                }\n                it = this->queue.erase(it);\n            }\n            else {\n                done = true;\n            }\n        }\n    }\n\n    \/* dispatch outside of the critical section *\/\n\n    Iterator it = this->dispatch.begin();\n    while (it != this->dispatch.end()) {\n        this->Dispatch((*it)->message);\n        delete *it;\n        it++;\n    }\n\n    this->dispatch.clear();\n\n    if (this->queue.size()) {\n        this->nextMessageTime.store((*this->queue.begin())->time.count());\n    }\n}\n\nvoid MessageQueue::Register(IMessageTarget* target) {\n    LockT lock(this->queueMutex);\n    this->targets.insert(target);\n}\n\nvoid MessageQueue::Unregister(IMessageTarget* target) {\n    bool shouldRemove = false;\n    {\n        LockT lock(this->queueMutex);\n        if (this->targets.find(target) != this->targets.end()) {\n            this->targets.erase(target);\n            shouldRemove = true;\n        }\n    }\n    if (shouldRemove) {\n        this->Remove(target);\n    }\n}\n\nvoid MessageQueue::RegisterForBroadcasts(IMessageTargetPtr target) {\n    LockT lock(this->queueMutex);\n    this->receivers.insert(target);\n}\n\nvoid MessageQueue::UnregisterForBroadcasts(IMessageTarget *target) {\n    LockT lock(this->queueMutex);\n    for (auto it : this->receivers) {\n        auto shared = it.lock();\n        if (shared && shared.get() == target) {\n            this->receivers.erase(it);\n            return;\n        }\n    }\n}\n\nint MessageQueue::Remove(IMessageTarget *target, int type) {\n    LockT lock(this->queueMutex);\n\n    int count = 0;\n    std::list<EnqueuedMessage*>::iterator it = this->queue.begin();\n    while (it != this->queue.end()) {\n        IMessagePtr current = (*it)->message;\n\n        if (current->Target() == target) {\n            if (type == -1 || type == current->Type()) {\n                delete (*it);\n                it = this->queue.erase(it);\n                ++count;\n                continue;\n            }\n        }\n\n        ++it;\n    }\n\n    if (this->queue.size()) {\n        this->nextMessageTime.store((*this->queue.begin())->time.count());\n    }\n\n    return count;\n}\n\nbool MessageQueue::Contains(IMessageTarget *target, int type) {\n    LockT lock(this->queueMutex);\n\n    std::list<EnqueuedMessage*>::iterator it = this->queue.begin();\n    while (it != this->queue.end()) {\n        IMessagePtr current = (*it)->message;\n\n        if (current->Target() == target) {\n            if (type == -1 || type == current->Type()) {\n                return true;\n            }\n        }\n\n        ++it;\n    }\n    return false;\n}\n\nvoid MessageQueue::Broadcast(IMessagePtr message, int64_t delayMs) {\n    LockT lock(this->queueMutex);\n\n    if (message->Target()) {\n        throw new std::runtime_error(\"broadcasts cannot have a target!\");\n    }\n\n    this->Enqueue(message, delayMs);\n}\n\nvoid MessageQueue::Post(IMessagePtr message, int64_t delayMs) {\n    LockT lock(this->queueMutex);\n\n    if (this->targets.find(message->Target()) == this->targets.end()) {\n        return;\n    }\n\n    this->Enqueue(message, delayMs);\n}\n\nvoid MessageQueue::Enqueue(IMessagePtr message, int64_t delayMs) {\n    delayMs = std::max((int64_t) 0, delayMs);\n\n    milliseconds now = duration_cast<milliseconds>(\n        system_clock::now().time_since_epoch());\n\n    EnqueuedMessage *m = new EnqueuedMessage();\n    m->message = message;\n    m->time = now + milliseconds(delayMs);\n\n    \/* the queue is time ordered. start from the front of the queue, and\n    work our way back until we find the correct place to insert the new one *\/\n\n    typedef std::list<EnqueuedMessage*>::iterator Iterator;\n    Iterator curr = this->queue.begin();\n\n    while (curr != this->queue.end()) {\n        if ((*curr)->time <= m->time) {\n            curr++;\n        }\n        else {\n            break;\n        }\n    }\n\n    bool first = (curr == this->queue.begin());\n\n    this->queue.insert(curr, m);\n\n    if (this->queue.size()) {\n        this->nextMessageTime.store((*this->queue.begin())->time.count());\n    }\n\n    if (first) {\n        this->waitForDispatch.notify_all();\n    }\n}\n\nvoid MessageQueue::Debounce(IMessagePtr message, int64_t delayMs) {\n    Remove(message->Target(), message->Type());\n    Post(message, delayMs);\n}\n\nvoid MessageQueue::Dispatch(IMessagePtr message) {\n    if (message->Target()) {\n        message->Target()->ProcessMessage(*message);\n    }\n    else {\n        std::set<IWeakMessageTarget, WeakPtrLess> copy;\n\n        \/* copy to dispatch outside of a lock *\/\n        {\n            LockT lock(this->queueMutex);\n            std::copy(\n                receivers.begin(),\n                receivers.end(),\n                std::inserter(copy, copy.begin()));\n        }\n\n        \/* dispatch *\/\n        bool prune = false;\n        for (auto receiver : copy) {\n            auto shared = receiver.lock();\n            if (shared) {\n                shared->ProcessMessage(*message);\n            }\n            else {\n                prune = true;\n            }\n        }\n\n        if (prune) { \/* at least one of our weak_ptrs is dead. *\/\n            LockT lock(this->queueMutex);\n            auto it = this->receivers.begin();\n            while (it != this->receivers.end()) {\n                if (it->expired()) {\n                    it = this->receivers.erase(it);\n                }\n                else {\n                    ++it;\n                }\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield\n *\n * This application is open source and may be redistributed and\/or modified\n * freely and without restriction, both in commercial and non commercial\n * applications, as long as this copyright notice is maintained.\n *\n * This application is distributed in the hope 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 *\n*\/\n\n#include <sstream>\n#include <memory>\n\n#include <osg\/Notify>\n#include <osg\/NodeVisitor>\n#include <osgDB\/ReaderWriter>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n#include <osgDB\/ConvertUTF>\n\n#include <OpenThreads\/ScopedLock>\n\n#include \"ReaderWriterDAE.h\"\n#include \"daeReader.h\"\n#include \"daeWriter.h\"\n\n#ifdef WIN32\n#include \"windows.h\"\n#endif\n\n#define SERIALIZER() OpenThreads::ScopedLock<OpenThreads::ReentrantMutex> lock(_serializerMutex)\n\n#if  __cplusplus > 199711L\n    #define smart_ptr std::unique_ptr\n#else\n    #define smart_ptr std::auto_ptr\n#endif\n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(std::istream& fin,\n        const osgDB::ReaderWriter::Options* options) const\n{\n    SERIALIZER();\n\n    bool bOwnDAE = false;\n    DAE* pDAE = NULL;\n\n    \/\/ Process options\n    osgDAE::daeReader::Options pluginOptions;\n    if( options )\n    {\n        pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n        pluginOptions.precisionHint = options->getPrecisionHint();\n\n        std::istringstream iss( options->getOptionString() );\n        std::string opt;\n        while (iss >> opt)\n        {\n            if( opt == \"StrictTransparency\") pluginOptions.strictTransparency = true;\n            else if (opt == \"daeTessellateNone\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_NONE;\n            else if (opt == \"daeTessellatePolygonsAsTriFans\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS_AS_TRIFAN;\n            else if (opt == \"daeTessellatePolygons\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS;\n            else if (opt == \"daeUsePredefinedTextureUnits\") pluginOptions.usePredefinedTextureUnits = true;\n            else if (opt == \"daeUseSequencedTextureUnits\") pluginOptions.usePredefinedTextureUnits = false;\n        }\n    }\n\n    if (NULL == pDAE)\n    {\n        bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n        pDAE = new DAE(NULL,NULL,_specversion);\n#else\n        pDAE = new DAE;\n#endif\n    }\n\n    smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL);        \/\/ Deallocates locally created structure at scope exit\n\n    osgDAE::daeReader daeReader(pDAE, &pluginOptions);\n\n    if ( ! daeReader.convert( fin ) )\n    {\n        OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n        return ReadResult::ERROR_IN_READING_FILE;\n    }\n\n    if ( options )\n    {\n        \/\/ Return the document URI\n        if (options->getPluginData(\"DAE-DocumentURI\"))\n            *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = std::string(\"\/dev\/null\");\n        \/\/ Return some additional information about the document\n        if (options->getPluginData(\"DAE-AssetUnitName\"))\n             *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n        if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n            *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n        if (options->getPluginData(\"DAE-AssetUp_axis\"))\n            *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n    }\n\n    osg::Node* rootNode( daeReader.getRootNode() );\n    return rootNode;\n}\n\n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(const std::string& fname,\n        const osgDB::ReaderWriter::Options* options) const\n{\n    SERIALIZER();\n\n    bool bOwnDAE = false;\n    DAE* pDAE = NULL;\n\n    \/\/ Process options\n    osgDAE::daeReader::Options pluginOptions;\n    if( options )\n    {\n        pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n        pluginOptions.precisionHint = options->getPrecisionHint();\n\n        std::istringstream iss( options->getOptionString() );\n        std::string opt;\n        while (iss >> opt)\n        {\n            if( opt == \"StrictTransparency\") pluginOptions.strictTransparency = true;\n            else if (opt == \"daeTessellateNone\")              pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_NONE;\n            else if (opt == \"daeTessellatePolygonsAsTriFans\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS_AS_TRIFAN;\n            else if (opt == \"daeTessellatePolygons\")          pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS;\n            else if (opt == \"daeUsePredefinedTextureUnits\") pluginOptions.usePredefinedTextureUnits = true;\n            else if (opt == \"daeUseSequencedTextureUnits\")  pluginOptions.usePredefinedTextureUnits = false;\n        }\n    }\n\n\n    std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n    if( ! acceptsExtension(ext) ) return ReadResult::FILE_NOT_HANDLED;\n\n    std::string fileName( osgDB::findDataFile( fname, options ) );\n    if( fileName.empty() ) return ReadResult::FILE_NOT_FOUND;\n\n    OSG_INFO << \"ReaderWriterDAE( \\\"\" << fileName << \"\\\" )\" << std::endl;\n\n    if (NULL == pDAE)\n    {\n        bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n        pDAE = new DAE(NULL,NULL,_specversion);\n#else\n        pDAE = new DAE;\n#endif\n    }\n\n    smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL);        \/\/ Deallocates locally created structure at scope exit\n\n    osgDAE::daeReader daeReader(pDAE, &pluginOptions);\n\n    \/\/ Convert file name to URI\n    std::string fileURI = ConvertFilePathToColladaCompatibleURI(fileName);\n\n    if ( ! daeReader.convert( fileURI ) )\n    {\n        OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n        return ReadResult::ERROR_IN_READING_FILE;\n    }\n\n    if ( options )\n    {\n        \/\/ Return the document URI\n        if (options->getPluginData(\"DAE-DocumentURI\"))\n            *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n        \/\/ Return some additional information about the document\n        if (options->getPluginData(\"DAE-AssetUnitName\"))\n             *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n        if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n            *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n        if (options->getPluginData(\"DAE-AssetUp_axis\"))\n            *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n    }\n\n    osg::Node* rootNode( daeReader.getRootNode() );\n    return rootNode;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nosgDB::ReaderWriter::WriteResult\nReaderWriterDAE::writeNode( const osg::Node& node,\n        const std::string& fname, const osgDB::ReaderWriter::Options* options ) const\n{\n    SERIALIZER();\n\n    bool bOwnDAE = false;\n    DAE* pDAE = NULL;\n\n    std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n    if( ! acceptsExtension(ext) ) return WriteResult::FILE_NOT_HANDLED;\n\n    \/\/ Process options\n    osgDAE::daeWriter::Options pluginOptions;\n    std::string srcDirectory( osgDB::getFilePath(node.getName().empty() ? fname : node.getName()) );        \/\/ Base dir when relativising images paths\n    if( options )\n    {\n        pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n        const std::string & baseDir = options->getPluginStringData(\"baseImageDir\");        \/\/ Rename \"srcModelPath\" (and call getFilePath() on it)?\n        if (!baseDir.empty()) srcDirectory = baseDir;\n\n        const std::string & relativiseImagesPathNbUpDirs = options->getPluginStringData(\"DAE-relativiseImagesPathNbUpDirs\");\n        if (!relativiseImagesPathNbUpDirs.empty()) {\n            std::istringstream iss(relativiseImagesPathNbUpDirs);\n            iss >> pluginOptions.relativiseImagesPathNbUpDirs;\n        }\n\n        \/\/ Sukender's note: I don't know why DAE seems to accept comma-sparated options instead of space-separated options as other ReaderWriters. However, to avoid breaking compatibility, here's a workaround:\n        std::string optString( options->getOptionString() );\n        for(std::string::iterator it=optString.begin(); it!=optString.end(); ++it) {\n            if (*it == ' ') *it = ',';\n        }\n        std::istringstream iss( optString );\n        std::string opt;\n\n        \/\/while (iss >> opt)\n        while( std::getline( iss, opt, ',' ) )\n        {\n            if( opt == \"polygon\") pluginOptions.usePolygons = true;\n            else if (opt == \"GoogleMode\") pluginOptions.googleMode = true;\n            else if (opt == \"NoExtras\") pluginOptions.writeExtras = false;\n            else if (opt == \"daeEarthTex\") pluginOptions.earthTex = true;\n            else if (opt == \"daeZUpAxis\") {}    \/\/ Nothing (old option)\n            else if (opt == \"daeLinkOriginalTexturesNoForce\") { pluginOptions.linkOrignialTextures = true; pluginOptions.forceTexture = false; }\n            else if (opt == \"daeLinkOriginalTexturesForce\")   { pluginOptions.linkOrignialTextures = true; pluginOptions.forceTexture = true; }\n            else if (opt == \"daeNamesUseCodepage\") pluginOptions.namesUseCodepage = true;\n            else if (opt == \"daeRenameIds\") pluginOptions.renameIds = true;\n            else if (!opt.empty())\n            {\n                OSG_NOTICE << std::endl << \"COLLADA dae plugin: unrecognized option \\\"\" << opt <<  std::endl;\n            }\n        }\n    }\n\n    if (NULL == pDAE)\n    {\n        bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n        pDAE = new DAE(NULL,NULL,_specversion);\n#else\n        pDAE = new DAE;\n#endif\n    }\n    smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL);        \/\/ Deallocates locally created structure at scope exit\n\n    \/\/ Convert file name to URI\n    std::string fileURI = ConvertFilePathToColladaCompatibleURI(fname);\n\n    osg::NodeVisitor::TraversalMode traversalMode = pluginOptions.writeExtras ? osg::NodeVisitor::TRAVERSE_ALL_CHILDREN : osg::NodeVisitor::TRAVERSE_ACTIVE_CHILDREN;\n\n    osgDAE::daeWriter daeWriter(pDAE, fileURI, osgDB::getFilePath(fname), srcDirectory, options, traversalMode, &pluginOptions);\n    daeWriter.setRootNode( node );\n    const_cast<osg::Node*>(&node)->accept( daeWriter );\n\n    osgDB::ReaderWriter::WriteResult retVal( WriteResult::ERROR_IN_WRITING_FILE );\n    if ( daeWriter.isSuccess() )\n    {\n        if (pDAE->write(fileURI))\n            retVal = WriteResult::FILE_SAVED;\n    }\n\n    if ( options )\n    {\n        if (!bOwnDAE)\n        {\n            \/\/ Return the document URI used so that users of an external DAE object\n            \/\/ can locate the correct database\n            if (options->getPluginData(\"DAE-DocumentURI\"))\n                *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n        }\n    }\n\n    return retVal;\n}\n\nstatic void replace(std::string & str, const char from, const std::string & to)\n{\n    \/\/ Replace for all occurrences\n    for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos=str.find(from))\n    {\n        str.replace(pos, 1, to);\n    }\n}\n\nstatic void replace(std::string & str, const std::string & from, const std::string & to)\n{\n    \/\/ Replace for all occurrences\n    std::size_t lenFrom = from.size();\n    std::size_t lenTo = to.size();\n    for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos = str.find(from, pos+lenTo))\n    {\n        str.replace(pos, lenFrom, to);\n    }\n}\n\nstd::string ReaderWriterDAE::ConvertFilePathToColladaCompatibleURI(const std::string& FilePath)\n{\n#ifdef OSG_USE_UTF8_FILENAME\n    std::string path( cdom::nativePathToUri( FilePath ) );\n#else\n    std::string path( cdom::nativePathToUri( osgDB::convertStringFromCurrentCodePageToUTF8(FilePath) ) );\n#endif\n\n    \/\/ Unfortunately, cdom::nativePathToUri() does not convert '#' characters to \"%23\" as expected.\n    \/\/ So having \/a\/#b\/c will generate a wrong conversion, as '#' will be misinterpreted as an URI fragment.\n    \/\/ Here are listed all special chars, but only # was found problematic. I (Sukender) tested #{}^~[]`;@=&$ under Windows.\n    \/\/ Uncomment lines if you find issues with some other special characters.\n\n    \/\/replace(path, '%', \"%25\");        \/\/ % at first\n    \/\/replace(path, ' ', \"%20\");\n    replace(path, '#', \"%23\");\n    \/\/replace(path, '<', \"%3C\");\n    \/\/replace(path, '>', \"%3E\");\n    \/\/replace(path, '{', \"%7B\");\n    \/\/replace(path, '}', \"%7D\");\n    \/\/replace(path, '|', \"%7C\");\n    \/\/replace(path, '^', \"%5E\");\n    \/\/replace(path, '~', \"%7E\");\n    \/\/replace(path, '[', \"%5B\");\n    \/\/replace(path, '}', \"%5D\");\n    \/\/replace(path, '`', \"%60\");\n    \/\/replace(path, ';', \"%3B\");\n    \/\/replace(path, '?', \"%3F\");\n    \/\/replace(path, '@', \"%40\");\n    \/\/replace(path, '=', \"%3D\");\n    \/\/replace(path, '&', \"%26\");\n    \/\/replace(path, '$', \"%24\");\n    return path;\n}\n\nstd::string ReaderWriterDAE::ConvertColladaCompatibleURIToFilePath(const std::string& uri)\n{\n    \/\/ Reciprocal of ConvertFilePathToColladaCompatibleURI()\n#ifdef OSG_USE_UTF8_FILENAME\n    std::string path( cdom::uriToNativePath( uri ) );\n#else\n    std::string path( osgDB::convertStringFromCurrentCodePageToUTF8( cdom::uriToNativePath(uri) ) );\n#endif\n    replace(path, \"%23\", \"#\");\n    return path;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Add ourself to the Registry to instantiate the reader\/writer.\n\nREGISTER_OSGPLUGIN(dae, ReaderWriterDAE)\n\n\/\/ vim: set sw=4 ts=8 et ic ai:\n<commit_msg>Update ReaderWriterDAE.cpp<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield\n *\n * This application is open source and may be redistributed and\/or modified\n * freely and without restriction, both in commercial and non commercial\n * applications, as long as this copyright notice is maintained.\n *\n * This application is distributed in the hope 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 *\n*\/\n\n#include <sstream>\n#include <memory>\n\n#include <osg\/Notify>\n#include <osg\/NodeVisitor>\n#include <osgDB\/ReaderWriter>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n#include <osgDB\/ConvertUTF>\n\n#include <OpenThreads\/ScopedLock>\n\n#include \"ReaderWriterDAE.h\"\n#include \"daeReader.h\"\n#include \"daeWriter.h\"\n\n#ifdef WIN32\n#include \"windows.h\"\n#endif\n\n#define SERIALIZER() OpenThreads::ScopedLock<OpenThreads::ReentrantMutex> lock(_serializerMutex)\n\n#if  __cplusplus > 199711L\n    #define smart_ptr std::unique_ptr\n#else\n    #define smart_ptr std::auto_ptr\n#endif\n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(std::istream& fin,\n        const osgDB::ReaderWriter::Options* options) const\n{\n    SERIALIZER();\n\n    bool bOwnDAE = false;\n    DAE* pDAE = NULL;\n\n    \/\/ Process options\n    osgDAE::daeReader::Options pluginOptions;\n    if( options )\n    {\n        pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n        pluginOptions.precisionHint = options->getPrecisionHint();\n\n        std::istringstream iss( options->getOptionString() );\n        std::string opt;\n        while (iss >> opt)\n        {\n            if( opt == \"StrictTransparency\") pluginOptions.strictTransparency = true;\n            else if (opt == \"daeTessellateNone\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_NONE;\n            else if (opt == \"daeTessellatePolygonsAsTriFans\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS_AS_TRIFAN;\n            else if (opt == \"daeTessellatePolygons\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS;\n            else if (opt == \"daeUsePredefinedTextureUnits\") pluginOptions.usePredefinedTextureUnits = true;\n            else if (opt == \"daeUseSequencedTextureUnits\") pluginOptions.usePredefinedTextureUnits = false;\n        }\n    }\n\n    if (NULL == pDAE)\n    {\n        bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n        pDAE = new DAE(NULL,NULL,_specversion);\n#else\n        pDAE = new DAE;\n#endif\n    }\n\n    smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL);        \/\/ Deallocates locally created structure at scope exit\n\n    osgDAE::daeReader daeReader(pDAE, &pluginOptions);\n\n    if ( ! daeReader.convert( fin ) )\n    {\n        OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n        return ReadResult::ERROR_IN_READING_FILE;\n    }\n\n    if ( options )\n    {\n        \/\/ Return the document URI\n        if (options->getPluginData(\"DAE-DocumentURI\"))\n            *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = std::string(\"\/dev\/null\");\n        \/\/ Return some additional information about the document\n        if (options->getPluginData(\"DAE-AssetUnitName\"))\n             *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n        if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n            *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n        if (options->getPluginData(\"DAE-AssetUp_axis\"))\n            *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n    }\n\n    osg::Node* rootNode( daeReader.getRootNode() );\n    return rootNode;\n}\n\n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(const std::string& fname,\n        const osgDB::ReaderWriter::Options* options) const\n{\n    SERIALIZER();\n\n    bool bOwnDAE = false;\n    DAE* pDAE = NULL;\n\n    \/\/ Process options\n    osgDAE::daeReader::Options pluginOptions;\n    if( options )\n    {\n        pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n        pluginOptions.precisionHint = options->getPrecisionHint();\n\n        std::istringstream iss( options->getOptionString() );\n        std::string opt;\n        while (iss >> opt)\n        {\n            if( opt == \"StrictTransparency\") pluginOptions.strictTransparency = true;\n            else if (opt == \"daeTessellateNone\")              pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_NONE;\n            else if (opt == \"daeTessellatePolygonsAsTriFans\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS_AS_TRIFAN;\n            else if (opt == \"daeTessellatePolygons\")          pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS;\n            else if (opt == \"daeUsePredefinedTextureUnits\") pluginOptions.usePredefinedTextureUnits = true;\n            else if (opt == \"daeUseSequencedTextureUnits\")  pluginOptions.usePredefinedTextureUnits = false;\n        }\n    }\n\n\n    std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n    if( ! acceptsExtension(ext) ) return ReadResult::FILE_NOT_HANDLED;\n\n    std::string fileName( osgDB::findDataFile( fname, options ) );\n    if( fileName.empty() ) return ReadResult::FILE_NOT_FOUND;\n    \n    pluginOptions.options = options ? static_cast<Options*>(options->clone(osg::CopyOp::SHALLOW_COPY)) : new Options;\n    pluginOptions.options->getDatabasePathList().push_front(osgDB::getFilePath(fileName));\n\n    OSG_INFO << \"ReaderWriterDAE( \\\"\" << fileName << \"\\\" )\" << std::endl;\n\n    if (NULL == pDAE)\n    {\n        bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n        pDAE = new DAE(NULL,NULL,_specversion);\n#else\n        pDAE = new DAE;\n#endif\n    }\n\n    smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL);        \/\/ Deallocates locally created structure at scope exit\n\n    osgDAE::daeReader daeReader(pDAE, &pluginOptions);\n\n    \/\/ Convert file name to URI\n    std::string fileURI = ConvertFilePathToColladaCompatibleURI(fileName);\n\n    if ( ! daeReader.convert( fileURI ) )\n    {\n        OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n        return ReadResult::ERROR_IN_READING_FILE;\n    }\n\n    if ( options )\n    {\n        \/\/ Return the document URI\n        if (options->getPluginData(\"DAE-DocumentURI\"))\n            *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n        \/\/ Return some additional information about the document\n        if (options->getPluginData(\"DAE-AssetUnitName\"))\n             *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n        if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n            *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n        if (options->getPluginData(\"DAE-AssetUp_axis\"))\n            *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n    }\n\n    osg::Node* rootNode( daeReader.getRootNode() );\n    return rootNode;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nosgDB::ReaderWriter::WriteResult\nReaderWriterDAE::writeNode( const osg::Node& node,\n        const std::string& fname, const osgDB::ReaderWriter::Options* options ) const\n{\n    SERIALIZER();\n\n    bool bOwnDAE = false;\n    DAE* pDAE = NULL;\n\n    std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n    if( ! acceptsExtension(ext) ) return WriteResult::FILE_NOT_HANDLED;\n\n    \/\/ Process options\n    osgDAE::daeWriter::Options pluginOptions;\n    std::string srcDirectory( osgDB::getFilePath(node.getName().empty() ? fname : node.getName()) );        \/\/ Base dir when relativising images paths\n    if( options )\n    {\n        pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n        const std::string & baseDir = options->getPluginStringData(\"baseImageDir\");        \/\/ Rename \"srcModelPath\" (and call getFilePath() on it)?\n        if (!baseDir.empty()) srcDirectory = baseDir;\n\n        const std::string & relativiseImagesPathNbUpDirs = options->getPluginStringData(\"DAE-relativiseImagesPathNbUpDirs\");\n        if (!relativiseImagesPathNbUpDirs.empty()) {\n            std::istringstream iss(relativiseImagesPathNbUpDirs);\n            iss >> pluginOptions.relativiseImagesPathNbUpDirs;\n        }\n\n        \/\/ Sukender's note: I don't know why DAE seems to accept comma-sparated options instead of space-separated options as other ReaderWriters. However, to avoid breaking compatibility, here's a workaround:\n        std::string optString( options->getOptionString() );\n        for(std::string::iterator it=optString.begin(); it!=optString.end(); ++it) {\n            if (*it == ' ') *it = ',';\n        }\n        std::istringstream iss( optString );\n        std::string opt;\n\n        \/\/while (iss >> opt)\n        while( std::getline( iss, opt, ',' ) )\n        {\n            if( opt == \"polygon\") pluginOptions.usePolygons = true;\n            else if (opt == \"GoogleMode\") pluginOptions.googleMode = true;\n            else if (opt == \"NoExtras\") pluginOptions.writeExtras = false;\n            else if (opt == \"daeEarthTex\") pluginOptions.earthTex = true;\n            else if (opt == \"daeZUpAxis\") {}    \/\/ Nothing (old option)\n            else if (opt == \"daeLinkOriginalTexturesNoForce\") { pluginOptions.linkOrignialTextures = true; pluginOptions.forceTexture = false; }\n            else if (opt == \"daeLinkOriginalTexturesForce\")   { pluginOptions.linkOrignialTextures = true; pluginOptions.forceTexture = true; }\n            else if (opt == \"daeNamesUseCodepage\") pluginOptions.namesUseCodepage = true;\n            else if (opt == \"daeRenameIds\") pluginOptions.renameIds = true;\n            else if (!opt.empty())\n            {\n                OSG_NOTICE << std::endl << \"COLLADA dae plugin: unrecognized option \\\"\" << opt <<  std::endl;\n            }\n        }\n    }\n\n    if (NULL == pDAE)\n    {\n        bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n        pDAE = new DAE(NULL,NULL,_specversion);\n#else\n        pDAE = new DAE;\n#endif\n    }\n    smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL);        \/\/ Deallocates locally created structure at scope exit\n\n    \/\/ Convert file name to URI\n    std::string fileURI = ConvertFilePathToColladaCompatibleURI(fname);\n\n    osg::NodeVisitor::TraversalMode traversalMode = pluginOptions.writeExtras ? osg::NodeVisitor::TRAVERSE_ALL_CHILDREN : osg::NodeVisitor::TRAVERSE_ACTIVE_CHILDREN;\n\n    osgDAE::daeWriter daeWriter(pDAE, fileURI, osgDB::getFilePath(fname), srcDirectory, options, traversalMode, &pluginOptions);\n    daeWriter.setRootNode( node );\n    const_cast<osg::Node*>(&node)->accept( daeWriter );\n\n    osgDB::ReaderWriter::WriteResult retVal( WriteResult::ERROR_IN_WRITING_FILE );\n    if ( daeWriter.isSuccess() )\n    {\n        if (pDAE->write(fileURI))\n            retVal = WriteResult::FILE_SAVED;\n    }\n\n    if ( options )\n    {\n        if (!bOwnDAE)\n        {\n            \/\/ Return the document URI used so that users of an external DAE object\n            \/\/ can locate the correct database\n            if (options->getPluginData(\"DAE-DocumentURI\"))\n                *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n        }\n    }\n\n    return retVal;\n}\n\nstatic void replace(std::string & str, const char from, const std::string & to)\n{\n    \/\/ Replace for all occurrences\n    for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos=str.find(from))\n    {\n        str.replace(pos, 1, to);\n    }\n}\n\nstatic void replace(std::string & str, const std::string & from, const std::string & to)\n{\n    \/\/ Replace for all occurrences\n    std::size_t lenFrom = from.size();\n    std::size_t lenTo = to.size();\n    for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos = str.find(from, pos+lenTo))\n    {\n        str.replace(pos, lenFrom, to);\n    }\n}\n\nstd::string ReaderWriterDAE::ConvertFilePathToColladaCompatibleURI(const std::string& FilePath)\n{\n#ifdef OSG_USE_UTF8_FILENAME\n    std::string path( cdom::nativePathToUri( FilePath ) );\n#else\n    std::string path( cdom::nativePathToUri( osgDB::convertStringFromCurrentCodePageToUTF8(FilePath) ) );\n#endif\n\n    \/\/ Unfortunately, cdom::nativePathToUri() does not convert '#' characters to \"%23\" as expected.\n    \/\/ So having \/a\/#b\/c will generate a wrong conversion, as '#' will be misinterpreted as an URI fragment.\n    \/\/ Here are listed all special chars, but only # was found problematic. I (Sukender) tested #{}^~[]`;@=&$ under Windows.\n    \/\/ Uncomment lines if you find issues with some other special characters.\n\n    \/\/replace(path, '%', \"%25\");        \/\/ % at first\n    \/\/replace(path, ' ', \"%20\");\n    replace(path, '#', \"%23\");\n    \/\/replace(path, '<', \"%3C\");\n    \/\/replace(path, '>', \"%3E\");\n    \/\/replace(path, '{', \"%7B\");\n    \/\/replace(path, '}', \"%7D\");\n    \/\/replace(path, '|', \"%7C\");\n    \/\/replace(path, '^', \"%5E\");\n    \/\/replace(path, '~', \"%7E\");\n    \/\/replace(path, '[', \"%5B\");\n    \/\/replace(path, '}', \"%5D\");\n    \/\/replace(path, '`', \"%60\");\n    \/\/replace(path, ';', \"%3B\");\n    \/\/replace(path, '?', \"%3F\");\n    \/\/replace(path, '@', \"%40\");\n    \/\/replace(path, '=', \"%3D\");\n    \/\/replace(path, '&', \"%26\");\n    \/\/replace(path, '$', \"%24\");\n    return path;\n}\n\nstd::string ReaderWriterDAE::ConvertColladaCompatibleURIToFilePath(const std::string& uri)\n{\n    \/\/ Reciprocal of ConvertFilePathToColladaCompatibleURI()\n#ifdef OSG_USE_UTF8_FILENAME\n    std::string path( cdom::uriToNativePath( uri ) );\n#else\n    std::string path( osgDB::convertStringFromCurrentCodePageToUTF8( cdom::uriToNativePath(uri) ) );\n#endif\n    replace(path, \"%23\", \"#\");\n    return path;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Add ourself to the Registry to instantiate the reader\/writer.\n\nREGISTER_OSGPLUGIN(dae, ReaderWriterDAE)\n\n\/\/ vim: set sw=4 ts=8 et ic ai:\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\/GraphicsContext>\n#include <osg\/GraphicsThread>\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_ENUM_REFLECTOR(osg::BarrierOperation::PreBlockOp)\n\tI_EnumLabel(osg::BarrierOperation::NO_OPERATION);\n\tI_EnumLabel(osg::BarrierOperation::GL_FLUSH);\n\tI_EnumLabel(osg::BarrierOperation::GL_FINISH);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::BarrierOperation)\n\tI_BaseType(osg::GraphicsThread::Operation);\n\tI_ConstructorWithDefaults2(IN, int, numThreads, , IN, osg::BarrierOperation::PreBlockOp, op, osg::BarrierOperation::NO_OPERATION);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::Block)\n\tI_VirtualBaseType(osg::Referenced);\n\tI_Constructor0();\n\tI_Method0(void, block);\n\tI_Method0(void, release);\n\tI_Method0(void, reset);\n\tI_Method1(void, set, IN, bool, doRelease);\n\tI_WriteOnlyProperty(bool, );\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::GraphicsThread)\n\tI_BaseType(osg::Referenced);\n\tI_Constructor0();\n\tI_MethodWithDefaults2(void, add, IN, osg::GraphicsThread::Operation *, operation, , IN, bool, waitForCompletion, false);\n\tI_Method0(void, run);\n\tI_Method0(int, cancel);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::GraphicsThread::Operation)\n\tI_VirtualBaseType(osg::Referenced);\n\tI_Constructor2(IN, const std::string &, name, IN, bool, keep);\n\tI_Method1(void, setName, IN, const std::string &, name);\n\tI_Method0(const std::string &, getName);\n\tI_Method1(void, setKeep, IN, bool, keep);\n\tI_Method0(bool, getKeep);\n\tI_Property(bool, Keep);\n\tI_Property(const std::string &, Name);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::ReleaseContext_Block_MakeCurrentOperation)\n\tI_BaseType(osg::GraphicsThread::Operation);\n\tI_BaseType(osg::Block);\n\tI_Constructor0();\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::SwapBuffersOperation)\n\tI_BaseType(osg::GraphicsThread::Operation);\n\tI_Constructor0();\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\/GraphicsContext>\n#include <osg\/GraphicsThread>\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_ENUM_REFLECTOR(osg::BarrierOperation::PreBlockOp)\n\tI_EnumLabel(osg::BarrierOperation::NO_OPERATION);\n\tI_EnumLabel(osg::BarrierOperation::GL_FLUSH);\n\tI_EnumLabel(osg::BarrierOperation::GL_FINISH);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::BarrierOperation)\n\tI_BaseType(osg::GraphicsThread::Operation);\n\tI_ConstructorWithDefaults2(IN, int, numThreads, , IN, osg::BarrierOperation::PreBlockOp, op, osg::BarrierOperation::NO_OPERATION);\n\tI_Method0(void, release);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::Block)\n\tI_VirtualBaseType(osg::Referenced);\n\tI_Constructor0();\n\tI_Method0(void, block);\n\tI_Method0(void, release);\n\tI_Method0(void, reset);\n\tI_Method1(void, set, IN, bool, doRelease);\n\tI_WriteOnlyProperty(bool, );\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::GraphicsThread)\n\tI_BaseType(osg::Referenced);\n\tI_Constructor0();\n\tI_MethodWithDefaults2(void, add, IN, osg::GraphicsThread::Operation *, operation, , IN, bool, waitForCompletion, false);\n\tI_Method1(void, remove, IN, osg::GraphicsThread::Operation *, operation);\n\tI_Method1(void, remove, IN, const std::string &, name);\n\tI_Method0(void, removeAllOperations);\n\tI_Method0(osg::ref_ptr< osg::GraphicsThread::Operation >, getCurrentOperation);\n\tI_Method0(void, run);\n\tI_Method1(void, setDone, IN, bool, done);\n\tI_Method0(bool, getDone);\n\tI_Method0(int, cancel);\n\tI_ReadOnlyProperty(osg::ref_ptr< osg::GraphicsThread::Operation >, CurrentOperation);\n\tI_Property(bool, Done);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::GraphicsThread::Operation)\n\tI_VirtualBaseType(osg::Referenced);\n\tI_Constructor2(IN, const std::string &, name, IN, bool, keep);\n\tI_Method1(void, setName, IN, const std::string &, name);\n\tI_Method0(const std::string &, getName);\n\tI_Method1(void, setKeep, IN, bool, keep);\n\tI_Method0(bool, getKeep);\n\tI_Method0(void, release);\n\tI_Property(bool, Keep);\n\tI_Property(const std::string &, Name);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::ReleaseContext_Block_MakeCurrentOperation)\n\tI_BaseType(osg::GraphicsThread::Operation);\n\tI_BaseType(osg::Block);\n\tI_Constructor0();\n\tI_Method0(void, release);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osg::SwapBuffersOperation)\n\tI_BaseType(osg::GraphicsThread::Operation);\n\tI_Constructor0();\nEND_REFLECTOR\n\nBEGIN_VALUE_REFLECTOR(osg::ref_ptr< osg::GraphicsThread::Operation >)\n\tI_Constructor0();\n\tI_Constructor1(IN, osg::GraphicsThread::Operation *, t);\n\tI_Constructor1(IN, const osg::ref_ptr< osg::GraphicsThread::Operation > &, rp);\n\tI_Method0(bool, valid);\n\tI_Method0(osg::GraphicsThread::Operation *, get);\n\tI_Method0(const osg::GraphicsThread::Operation *, get);\n\tI_Method0(osg::GraphicsThread::Operation *, take);\n\tI_Method0(osg::GraphicsThread::Operation *, release);\n\tI_ReadOnlyProperty(osg::GraphicsThread::Operation *, );\nEND_REFLECTOR\n\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2016 The Qt Company Ltd.\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 \"..\/scanner.h\"\n#include \"cpp_global.h\"\n#include \"Lexer.h\"\n\nusing namespace CPlusPlus;\n\n#include <tools\/qbspluginmanager.h>\n#include <tools\/scannerpluginmanager.h>\n\n#ifdef Q_OS_UNIX\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <sys\/mman.h>\n#include <unistd.h>\n#else\n#include <QtCore\/qfile.h>\n#endif\n\n#include <QtCore\/qbytearray.h>\n#include <QtCore\/qlist.h>\n#include <QtCore\/qstring.h>\n\n#include <cstring>\n#include <memory>\n\nstruct ScanResult\n{\n    char *fileName = nullptr;\n    int size = 0;\n    int flags = 0;\n};\n\nstruct Opaq\n{\n    enum FileType\n    {\n        FT_UNKNOWN, FT_HPP, FT_CPP, FT_C, FT_OBJC, FT_OBJCPP, FT_RC\n    };\n\n    Opaq()\n        :\n#ifdef Q_OS_UNIX\n          fd(0),\n          mapl(0),\n#endif\n          fileContent(nullptr),\n          fileType(FT_UNKNOWN),\n          hasQObjectMacro(false),\n          hasPluginMetaDataMacro(false),\n          currentResultIndex(0)\n    {}\n\n    ~Opaq()\n    {\n#ifdef Q_OS_UNIX\n        if (fileContent)\n            munmap(fileContent, mapl);\n        if (fd)\n            close(fd);\n#endif\n    }\n\n#ifdef Q_OS_WIN\n    QFile file;\n#endif\n#ifdef Q_OS_UNIX\n    int fd;\n    size_t mapl;\n#endif\n\n    QString fileName;\n    char *fileContent;\n    FileType fileType;\n    QList<ScanResult> includedFiles;\n    bool hasQObjectMacro;\n    bool hasPluginMetaDataMacro;\n    int currentResultIndex;\n};\n\nclass TokenComparator\n{\n    const char * const m_fileContent;\npublic:\n    TokenComparator(const char *fileContent)\n        : m_fileContent(fileContent)\n    {\n    }\n\n    bool equals(const Token &tk, const QLatin1String &literal) const\n    {\n        return static_cast<int>(tk.length()) == literal.size()\n                && memcmp(m_fileContent + tk.begin(), literal.data(), literal.size()) == 0;\n    }\n};\n\nstatic void scanCppFile(void *opaq, CPlusPlus::Lexer &yylex, bool scanForFileTags,\n                        bool scanForDependencies)\n{\n    const QLatin1String includeLiteral(\"include\");\n    const QLatin1String importLiteral(\"import\");\n    const QLatin1String defineLiteral(\"define\");\n    const QLatin1String qobjectLiteral(\"Q_OBJECT\");\n    const QLatin1String qgadgetLiteral(\"Q_GADGET\");\n    const QLatin1String qnamespaceLiteral(\"Q_NAMESPACE\");\n    const QLatin1String pluginMetaDataLiteral(\"Q_PLUGIN_METADATA\");\n    const auto opaque = static_cast<Opaq *>(opaq);\n    const TokenComparator tc(opaque->fileContent);\n    Token tk;\n    Token oldTk;\n    ScanResult scanResult;\n\n    yylex(&tk);\n\n    while (tk.isNot(T_EOF_SYMBOL)) {\n        if (tk.newline() && tk.is(T_POUND)) {\n            yylex(&tk);\n\n            if (scanForDependencies && !tk.newline() && tk.is(T_IDENTIFIER)) {\n                if (tc.equals(tk, includeLiteral) || tc.equals(tk, importLiteral))\n                {\n                    yylex.setScanAngleStringLiteralTokens(true);\n                    yylex(&tk);\n                    yylex.setScanAngleStringLiteralTokens(false);\n\n                    if (!tk.newline() && (tk.is(T_STRING_LITERAL) || tk.is(T_ANGLE_STRING_LITERAL))) {\n                        scanResult.size = int(tk.length() - 2);\n                        if (tk.is(T_STRING_LITERAL))\n                            scanResult.flags = SC_LOCAL_INCLUDE_FLAG;\n                        else\n                            scanResult.flags = SC_GLOBAL_INCLUDE_FLAG;\n                        scanResult.fileName = opaque->fileContent + tk.begin() + 1;\n                        opaque->includedFiles.push_back(scanResult);\n                    }\n                }\n            }\n        } else if (tk.is(T_IDENTIFIER)) {\n            if (scanForFileTags) {\n                if (oldTk.is(T_IDENTIFIER) && tc.equals(oldTk, defineLiteral)) {\n                    \/\/ Someone was clever and redefined Q_OBJECT or Q_PLUGIN_METADATA.\n                    \/\/ Example: iplugin.h in Qt Creator.\n                } else {\n                    if (tc.equals(tk, qobjectLiteral) || tc.equals(tk, qgadgetLiteral)  ||\n                        tc.equals(tk, qnamespaceLiteral))\n                    {\n                        opaque->hasQObjectMacro = true;\n                    } else if (tc.equals(tk, pluginMetaDataLiteral))\n                    {\n                        opaque->hasPluginMetaDataMacro = true;\n                    }\n                    if (!scanForDependencies && opaque->hasQObjectMacro\n                        && (opaque->hasPluginMetaDataMacro\n                            || opaque->fileType == Opaq::FT_CPP\n                            || opaque->fileType == Opaq::FT_OBJCPP))\n                        break;\n                }\n            }\n\n        }\n        oldTk = tk;\n        yylex(&tk);\n    }\n}\n\nstatic void *openScanner(const unsigned short *filePath, const char *fileTags, int flags)\n{\n    std::unique_ptr<Opaq> opaque(new Opaq);\n    opaque->fileName = QString::fromUtf16(filePath);\n    const int fileTagsLength = static_cast<int>(std::strlen(fileTags));\n    const QList<QByteArray> &tagList = QByteArray::fromRawData(fileTags, fileTagsLength).split(',');\n    if (tagList.contains(\"hpp\"))\n        opaque->fileType = Opaq::FT_HPP;\n    else if (tagList.contains(\"cpp\"))\n        opaque->fileType = Opaq::FT_CPP;\n    else if (tagList.contains(\"objcpp\"))\n        opaque->fileType = Opaq::FT_OBJCPP;\n    else\n        opaque->fileType = Opaq::FT_UNKNOWN;\n\n    size_t mapl = 0;\n#ifdef Q_OS_UNIX\n    QString filePathS = opaque->fileName;\n\n    opaque->fd = open(qPrintable(filePathS), O_RDONLY);\n    if (opaque->fd == -1) {\n        opaque->fd = 0;\n        return nullptr;\n    }\n\n    struct stat s{};\n    int r = fstat(opaque->fd, &s);\n    if (r != 0)\n        return nullptr;\n    mapl = s.st_size;\n    opaque->mapl = mapl;\n\n    void *vmap = mmap(nullptr, s.st_size, PROT_READ, MAP_PRIVATE, opaque->fd, 0);\n    if (vmap == MAP_FAILED) \/\/ NOLINT(cppcoreguidelines-pro-type-cstyle-cast)\n        return nullptr;\n#else\n    opaque->file.setFileName(opaque->fileName);\n    if (!opaque->file.open(QFile::ReadOnly))\n        return nullptr;\n\n    uchar *vmap = opaque->file.map(0, opaque->file.size());\n    mapl = opaque->file.size();\n#endif\n    if (!vmap)\n        return nullptr;\n\n    opaque->fileContent = reinterpret_cast<char *>(vmap);\n\n    \/\/ Check for UTF-8 Byte Order Mark (BOM). Skip if found.\n    if (mapl >= 3\n            && opaque->fileContent[0] == char(0xef)\n            && opaque->fileContent[1] == char(0xbb)\n            && opaque->fileContent[2] == char(0xbf)) {\n        opaque->fileContent += 3;\n        mapl -= 3;\n    }\n\n    CPlusPlus::Lexer lex(opaque->fileContent, opaque->fileContent + mapl);\n    scanCppFile(opaque.get(), lex, flags & ScanForFileTagsFlag, flags & ScanForDependenciesFlag);\n    return opaque.release();\n}\n\nstatic void closeScanner(void *ptr)\n{\n    const auto opaque = static_cast<Opaq *>(ptr);\n    delete opaque;\n}\n\nstatic const char *next(void *opaq, int *size, int *flags)\n{\n    const auto opaque = static_cast<Opaq*>(opaq);\n    if (opaque->currentResultIndex < opaque->includedFiles.size()) {\n        const ScanResult &result = opaque->includedFiles.at(opaque->currentResultIndex);\n        ++opaque->currentResultIndex;\n        *size = result.size;\n        *flags = result.flags;\n        return result.fileName;\n    }\n    *size = 0;\n    *flags = 0;\n    return nullptr;\n}\n\nstatic const char **additionalFileTags(void *opaq, int *size)\n{\n    static const char *thMocCpp[] = { \"moc_cpp\" };\n    static const char *thMocHpp[] = { \"moc_hpp\" };\n    static const char *thMocPluginHpp[] = { \"moc_hpp_plugin\" };\n    static const char *thMocPluginCpp[] = { \"moc_cpp_plugin\" };\n\n    const auto opaque = static_cast<const Opaq*>(opaq);\n    if (opaque->hasQObjectMacro) {\n        *size = 1;\n        switch (opaque->fileType) {\n        case Opaq::FT_CPP:\n        case Opaq::FT_OBJCPP:\n            return opaque->hasPluginMetaDataMacro ? thMocPluginCpp : thMocCpp;\n        case Opaq::FT_HPP:\n            return opaque->hasPluginMetaDataMacro ? thMocPluginHpp : thMocHpp;\n        default:\n            break;\n        }\n    }\n    *size = 0;\n    return nullptr;\n}\n\nScannerPlugin includeScanner =\n{\n    \"include_scanner\",\n    \"cpp,cpp_pch_src,c,c_pch_src,objcpp,objcpp_pch_src,objc,objc_pch_src,rc\",\n    openScanner,\n    closeScanner,\n    next,\n    additionalFileTags,\n    ScannerUsesCppIncludePaths | ScannerRecursiveDependencies\n};\n\nScannerPlugin *cppScanners[] = { &includeScanner, nullptr };\n\nstatic void QbsCppScannerPluginLoad()\n{\n    qbs::Internal::ScannerPluginManager::instance()->registerPlugins(cppScanners);\n}\n\nstatic void QbsCppScannerPluginUnload()\n{\n}\n\nQBS_REGISTER_STATIC_PLUGIN(extern \"C\" CPPSCANNER_EXPORT, qbs_cpp_scanner,\n                           QbsCppScannerPluginLoad, QbsCppScannerPluginUnload)\n\n<commit_msg>qt6: do not use QString::fromUtf16(ushort*) overload<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2016 The Qt Company Ltd.\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 \"..\/scanner.h\"\n#include \"cpp_global.h\"\n#include \"Lexer.h\"\n\nusing namespace CPlusPlus;\n\n#include <tools\/qbspluginmanager.h>\n#include <tools\/scannerpluginmanager.h>\n\n#ifdef Q_OS_UNIX\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <sys\/mman.h>\n#include <unistd.h>\n#else\n#include <QtCore\/qfile.h>\n#endif\n\n#include <QtCore\/qbytearray.h>\n#include <QtCore\/qlist.h>\n#include <QtCore\/qstring.h>\n\n#include <cstring>\n#include <memory>\n\nstruct ScanResult\n{\n    char *fileName = nullptr;\n    int size = 0;\n    int flags = 0;\n};\n\nstruct Opaq\n{\n    enum FileType\n    {\n        FT_UNKNOWN, FT_HPP, FT_CPP, FT_C, FT_OBJC, FT_OBJCPP, FT_RC\n    };\n\n    Opaq()\n        :\n#ifdef Q_OS_UNIX\n          fd(0),\n          mapl(0),\n#endif\n          fileContent(nullptr),\n          fileType(FT_UNKNOWN),\n          hasQObjectMacro(false),\n          hasPluginMetaDataMacro(false),\n          currentResultIndex(0)\n    {}\n\n    ~Opaq()\n    {\n#ifdef Q_OS_UNIX\n        if (fileContent)\n            munmap(fileContent, mapl);\n        if (fd)\n            close(fd);\n#endif\n    }\n\n#ifdef Q_OS_WIN\n    QFile file;\n#endif\n#ifdef Q_OS_UNIX\n    int fd;\n    size_t mapl;\n#endif\n\n    QString fileName;\n    char *fileContent;\n    FileType fileType;\n    QList<ScanResult> includedFiles;\n    bool hasQObjectMacro;\n    bool hasPluginMetaDataMacro;\n    int currentResultIndex;\n};\n\nclass TokenComparator\n{\n    const char * const m_fileContent;\npublic:\n    TokenComparator(const char *fileContent)\n        : m_fileContent(fileContent)\n    {\n    }\n\n    bool equals(const Token &tk, const QLatin1String &literal) const\n    {\n        return static_cast<int>(tk.length()) == literal.size()\n                && memcmp(m_fileContent + tk.begin(), literal.data(), literal.size()) == 0;\n    }\n};\n\nstatic void scanCppFile(void *opaq, CPlusPlus::Lexer &yylex, bool scanForFileTags,\n                        bool scanForDependencies)\n{\n    const QLatin1String includeLiteral(\"include\");\n    const QLatin1String importLiteral(\"import\");\n    const QLatin1String defineLiteral(\"define\");\n    const QLatin1String qobjectLiteral(\"Q_OBJECT\");\n    const QLatin1String qgadgetLiteral(\"Q_GADGET\");\n    const QLatin1String qnamespaceLiteral(\"Q_NAMESPACE\");\n    const QLatin1String pluginMetaDataLiteral(\"Q_PLUGIN_METADATA\");\n    const auto opaque = static_cast<Opaq *>(opaq);\n    const TokenComparator tc(opaque->fileContent);\n    Token tk;\n    Token oldTk;\n    ScanResult scanResult;\n\n    yylex(&tk);\n\n    while (tk.isNot(T_EOF_SYMBOL)) {\n        if (tk.newline() && tk.is(T_POUND)) {\n            yylex(&tk);\n\n            if (scanForDependencies && !tk.newline() && tk.is(T_IDENTIFIER)) {\n                if (tc.equals(tk, includeLiteral) || tc.equals(tk, importLiteral))\n                {\n                    yylex.setScanAngleStringLiteralTokens(true);\n                    yylex(&tk);\n                    yylex.setScanAngleStringLiteralTokens(false);\n\n                    if (!tk.newline() && (tk.is(T_STRING_LITERAL) || tk.is(T_ANGLE_STRING_LITERAL))) {\n                        scanResult.size = int(tk.length() - 2);\n                        if (tk.is(T_STRING_LITERAL))\n                            scanResult.flags = SC_LOCAL_INCLUDE_FLAG;\n                        else\n                            scanResult.flags = SC_GLOBAL_INCLUDE_FLAG;\n                        scanResult.fileName = opaque->fileContent + tk.begin() + 1;\n                        opaque->includedFiles.push_back(scanResult);\n                    }\n                }\n            }\n        } else if (tk.is(T_IDENTIFIER)) {\n            if (scanForFileTags) {\n                if (oldTk.is(T_IDENTIFIER) && tc.equals(oldTk, defineLiteral)) {\n                    \/\/ Someone was clever and redefined Q_OBJECT or Q_PLUGIN_METADATA.\n                    \/\/ Example: iplugin.h in Qt Creator.\n                } else {\n                    if (tc.equals(tk, qobjectLiteral) || tc.equals(tk, qgadgetLiteral)  ||\n                        tc.equals(tk, qnamespaceLiteral))\n                    {\n                        opaque->hasQObjectMacro = true;\n                    } else if (tc.equals(tk, pluginMetaDataLiteral))\n                    {\n                        opaque->hasPluginMetaDataMacro = true;\n                    }\n                    if (!scanForDependencies && opaque->hasQObjectMacro\n                        && (opaque->hasPluginMetaDataMacro\n                            || opaque->fileType == Opaq::FT_CPP\n                            || opaque->fileType == Opaq::FT_OBJCPP))\n                        break;\n                }\n            }\n\n        }\n        oldTk = tk;\n        yylex(&tk);\n    }\n}\n\nstatic void *openScanner(const unsigned short *filePath, const char *fileTags, int flags)\n{\n    std::unique_ptr<Opaq> opaque(new Opaq);\n    opaque->fileName = QString::fromUtf16(reinterpret_cast<const char16_t *>(filePath));\n    const int fileTagsLength = static_cast<int>(std::strlen(fileTags));\n    const QList<QByteArray> &tagList = QByteArray::fromRawData(fileTags, fileTagsLength).split(',');\n    if (tagList.contains(\"hpp\"))\n        opaque->fileType = Opaq::FT_HPP;\n    else if (tagList.contains(\"cpp\"))\n        opaque->fileType = Opaq::FT_CPP;\n    else if (tagList.contains(\"objcpp\"))\n        opaque->fileType = Opaq::FT_OBJCPP;\n    else\n        opaque->fileType = Opaq::FT_UNKNOWN;\n\n    size_t mapl = 0;\n#ifdef Q_OS_UNIX\n    QString filePathS = opaque->fileName;\n\n    opaque->fd = open(qPrintable(filePathS), O_RDONLY);\n    if (opaque->fd == -1) {\n        opaque->fd = 0;\n        return nullptr;\n    }\n\n    struct stat s{};\n    int r = fstat(opaque->fd, &s);\n    if (r != 0)\n        return nullptr;\n    mapl = s.st_size;\n    opaque->mapl = mapl;\n\n    void *vmap = mmap(nullptr, s.st_size, PROT_READ, MAP_PRIVATE, opaque->fd, 0);\n    if (vmap == MAP_FAILED) \/\/ NOLINT(cppcoreguidelines-pro-type-cstyle-cast)\n        return nullptr;\n#else\n    opaque->file.setFileName(opaque->fileName);\n    if (!opaque->file.open(QFile::ReadOnly))\n        return nullptr;\n\n    uchar *vmap = opaque->file.map(0, opaque->file.size());\n    mapl = opaque->file.size();\n#endif\n    if (!vmap)\n        return nullptr;\n\n    opaque->fileContent = reinterpret_cast<char *>(vmap);\n\n    \/\/ Check for UTF-8 Byte Order Mark (BOM). Skip if found.\n    if (mapl >= 3\n            && opaque->fileContent[0] == char(0xef)\n            && opaque->fileContent[1] == char(0xbb)\n            && opaque->fileContent[2] == char(0xbf)) {\n        opaque->fileContent += 3;\n        mapl -= 3;\n    }\n\n    CPlusPlus::Lexer lex(opaque->fileContent, opaque->fileContent + mapl);\n    scanCppFile(opaque.get(), lex, flags & ScanForFileTagsFlag, flags & ScanForDependenciesFlag);\n    return opaque.release();\n}\n\nstatic void closeScanner(void *ptr)\n{\n    const auto opaque = static_cast<Opaq *>(ptr);\n    delete opaque;\n}\n\nstatic const char *next(void *opaq, int *size, int *flags)\n{\n    const auto opaque = static_cast<Opaq*>(opaq);\n    if (opaque->currentResultIndex < opaque->includedFiles.size()) {\n        const ScanResult &result = opaque->includedFiles.at(opaque->currentResultIndex);\n        ++opaque->currentResultIndex;\n        *size = result.size;\n        *flags = result.flags;\n        return result.fileName;\n    }\n    *size = 0;\n    *flags = 0;\n    return nullptr;\n}\n\nstatic const char **additionalFileTags(void *opaq, int *size)\n{\n    static const char *thMocCpp[] = { \"moc_cpp\" };\n    static const char *thMocHpp[] = { \"moc_hpp\" };\n    static const char *thMocPluginHpp[] = { \"moc_hpp_plugin\" };\n    static const char *thMocPluginCpp[] = { \"moc_cpp_plugin\" };\n\n    const auto opaque = static_cast<const Opaq*>(opaq);\n    if (opaque->hasQObjectMacro) {\n        *size = 1;\n        switch (opaque->fileType) {\n        case Opaq::FT_CPP:\n        case Opaq::FT_OBJCPP:\n            return opaque->hasPluginMetaDataMacro ? thMocPluginCpp : thMocCpp;\n        case Opaq::FT_HPP:\n            return opaque->hasPluginMetaDataMacro ? thMocPluginHpp : thMocHpp;\n        default:\n            break;\n        }\n    }\n    *size = 0;\n    return nullptr;\n}\n\nScannerPlugin includeScanner =\n{\n    \"include_scanner\",\n    \"cpp,cpp_pch_src,c,c_pch_src,objcpp,objcpp_pch_src,objc,objc_pch_src,rc\",\n    openScanner,\n    closeScanner,\n    next,\n    additionalFileTags,\n    ScannerUsesCppIncludePaths | ScannerRecursiveDependencies\n};\n\nScannerPlugin *cppScanners[] = { &includeScanner, nullptr };\n\nstatic void QbsCppScannerPluginLoad()\n{\n    qbs::Internal::ScannerPluginManager::instance()->registerPlugins(cppScanners);\n}\n\nstatic void QbsCppScannerPluginUnload()\n{\n}\n\nQBS_REGISTER_STATIC_PLUGIN(extern \"C\" CPPSCANNER_EXPORT, qbs_cpp_scanner,\n                           QbsCppScannerPluginLoad, QbsCppScannerPluginUnload)\n\n<|endoftext|>"}
{"text":"<commit_before>#define RLUA_REPLACE\n#include \"..\/rlua.h\"\n#if defined(_WIN32)\n#include <binding\/lua_unicode.cpp>\n#include <Windows.h>\n#include <tlhelp32.h>\n#else\n#include <bee\/lua\/binding.h>\n#endif\n#include <bee\/filesystem.h>\n#include <bee\/platform.h>\n#include <signal.h>\n\nnamespace rdebug_utility {\n    static int fs_absolute(lua_State* L) {\n#if defined(_WIN32)\n#define FS_ABSOLUTE(path) fs::absolute(path)\n#else\n#define FS_ABSOLUTE(path) fs::absolute(path).lexically_normal()\n#endif\n        try {\n            auto res = FS_ABSOLUTE(fs::path(bee::lua::tostring<fs::path::string_type>(L, 1))).generic_u8string();\n            lua_pushlstring(L, res.data(), res.size());\n            return 1;\n        } catch (const std::exception& e) {\n            return bee::lua::push_error(L, e);\n        }\n    }\n    static int platform_os(lua_State* L) {\n        lua_pushstring(L, BEE_OS_NAME);\n        return 1;\n    }\n\n    \n#if defined(_WIN32)\n    static void closeWindow() {\n        HANDLE h = CreateToolhelp32Snapshot(TH32CS_SNAPTHREAD, 0);\n        if (h != INVALID_HANDLE_VALUE) {\n            THREADENTRY32 te;\n            te.dwSize = sizeof(te);\n            for (BOOL ok = Thread32First(h, &te); ok; ok = Thread32Next(h, &te)) {\n                if (te.th32OwnerProcessID == GetCurrentProcessId()) {\n                    PostThreadMessageW(te.th32ThreadID, WM_QUIT, 0, 0);\n                }\n            }\n        }\n        CloseHandle(h);\n    }\n    bool isConsoleExe(const wchar_t* exe) {\n        HANDLE hExe = CreateFileW(exe, GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);\n        if (hExe == 0) {\n            return false;\n        }\n        DWORD read;\n        char data[sizeof IMAGE_NT_HEADERS + sizeof IMAGE_DOS_HEADER];\n        SetFilePointer(hExe, 0, NULL, FILE_BEGIN);\n        if (!ReadFile(hExe, data, sizeof IMAGE_DOS_HEADER, &read, NULL)) {\n            CloseHandle(hExe);\n            return false;\n        }\n        SetFilePointer(hExe, ((PIMAGE_DOS_HEADER)data)->e_lfanew, NULL, FILE_BEGIN);\n        if (!ReadFile(hExe, data, sizeof IMAGE_NT_HEADERS, &read, NULL)) {\n            CloseHandle(hExe);\n            return false;\n        }\n        CloseHandle(hExe);\n        return ((PIMAGE_NT_HEADERS)data)->OptionalHeader.Subsystem == IMAGE_SUBSYSTEM_WINDOWS_CUI;\n    }\n    static bool isConsoleProcess() {\n        wchar_t exe[MAX_PATH] = { 0 };\n        GetModuleFileNameW(NULL, exe, MAX_PATH);\n        return isConsoleExe(exe);\n    }\n#endif\n\n    static int closeprocess(lua_State* L) {\n#if defined(_WIN32)\n        closeWindow();\n        if (isConsoleProcess()) {\n            raise(SIGINT);\n        }\n#else\n        raise(SIGINT);\n#endif\n        return 0;\n    }\n}\n\nRLUA_FUNC\nint luaopen_remotedebug_utility(lua_State* L) {\n#if defined(_WIN32)\n    luaopen_bee_unicode(L);\n#else\n    lua_newtable(L);\n#endif\n    luaL_Reg lib[] = {\n        {\"fs_absolute\", rdebug_utility::fs_absolute},\n        {\"platform_os\", rdebug_utility::platform_os},\n        {\"closeprocess\", rdebug_utility::closeprocess},\n        {NULL, NULL}};\n    luaL_setfuncs(L, lib, 0);\n    return 1;\n}\n<commit_msg>修正一个bug<commit_after>#define RLUA_REPLACE\n#include \"..\/rlua.h\"\n#if defined(_WIN32)\n#include <binding\/lua_unicode.cpp>\n#include <Windows.h>\n#include <tlhelp32.h>\n#else\n#include <bee\/lua\/binding.h>\n#endif\n#include <bee\/filesystem.h>\n#include <bee\/platform.h>\n#include <signal.h>\n\nnamespace rdebug_utility {\n    static int fs_absolute(lua_State* L) {\n#if defined(_WIN32)\n#define FS_ABSOLUTE(path) fs::absolute(path)\n#else\n#define FS_ABSOLUTE(path) fs::absolute(path).lexically_normal()\n#endif\n        try {\n            auto res = FS_ABSOLUTE(fs::path(bee::lua::tostring<fs::path::string_type>(L, 1))).generic_u8string();\n            lua_pushlstring(L, res.data(), res.size());\n            return 1;\n        } catch (const std::exception& e) {\n            return bee::lua::push_error(L, e);\n        }\n    }\n    static int platform_os(lua_State* L) {\n        lua_pushstring(L, BEE_OS_NAME);\n        return 1;\n    }\n\n    \n#if defined(_WIN32)\n    static void closeWindow() {\n        HANDLE h = CreateToolhelp32Snapshot(TH32CS_SNAPTHREAD, 0);\n        if (h != INVALID_HANDLE_VALUE) {\n            THREADENTRY32 te;\n            te.dwSize = sizeof(te);\n            for (BOOL ok = Thread32First(h, &te); ok; ok = Thread32Next(h, &te)) {\n                if (te.th32OwnerProcessID == GetCurrentProcessId()) {\n                    PostThreadMessageW(te.th32ThreadID, WM_QUIT, 0, 0);\n                }\n            }\n            CloseHandle(h);\n        }\n    }\n    bool isConsoleExe(const wchar_t* exe) {\n        HANDLE hExe = CreateFileW(exe, GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);\n        if (hExe == 0) {\n            return false;\n        }\n        DWORD read;\n        char data[sizeof IMAGE_NT_HEADERS + sizeof IMAGE_DOS_HEADER];\n        SetFilePointer(hExe, 0, NULL, FILE_BEGIN);\n        if (!ReadFile(hExe, data, sizeof IMAGE_DOS_HEADER, &read, NULL)) {\n            CloseHandle(hExe);\n            return false;\n        }\n        SetFilePointer(hExe, ((PIMAGE_DOS_HEADER)data)->e_lfanew, NULL, FILE_BEGIN);\n        if (!ReadFile(hExe, data, sizeof IMAGE_NT_HEADERS, &read, NULL)) {\n            CloseHandle(hExe);\n            return false;\n        }\n        CloseHandle(hExe);\n        return ((PIMAGE_NT_HEADERS)data)->OptionalHeader.Subsystem == IMAGE_SUBSYSTEM_WINDOWS_CUI;\n    }\n    static bool isConsoleProcess() {\n        wchar_t exe[MAX_PATH] = { 0 };\n        GetModuleFileNameW(NULL, exe, MAX_PATH);\n        return isConsoleExe(exe);\n    }\n#endif\n\n    static int closeprocess(lua_State* L) {\n#if defined(_WIN32)\n        closeWindow();\n        if (isConsoleProcess()) {\n            raise(SIGINT);\n        }\n#else\n        raise(SIGINT);\n#endif\n        return 0;\n    }\n}\n\nRLUA_FUNC\nint luaopen_remotedebug_utility(lua_State* L) {\n#if defined(_WIN32)\n    luaopen_bee_unicode(L);\n#else\n    lua_newtable(L);\n#endif\n    luaL_Reg lib[] = {\n        {\"fs_absolute\", rdebug_utility::fs_absolute},\n        {\"platform_os\", rdebug_utility::platform_os},\n        {\"closeprocess\", rdebug_utility::closeprocess},\n        {NULL, NULL}};\n    luaL_setfuncs(L, lib, 0);\n    return 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __TEST__MODELS__MODEL_TEST_FIXTURE_HPP__\n#define __TEST__MODELS__MODEL_TEST_FIXTURE_HPP__\n\n#include <gtest\/gtest.h>\n#include <test\/models\/utility.hpp>\n#include <stan\/mcmc\/chains.hpp>\n#include <utility>\n#include <boost\/math\/distributions\/students_t.hpp>\n#include <boost\/math\/distributions\/binomial.hpp>\n\n\/** \n * Model_Test_Fixture is a test fixture for google test\n * to aid in running models.\n *\n * Derived classes must define:\n *   static std::vector<std::string> get_model_path()\n *   static bool has_data()\n *   - indicates whether the model has data\n *\/\ntemplate <class Derived>\nclass Model_Test_Fixture : public ::testing::Test {\n  \npublic:\n  static char path_separator;\n  static std::string model_path;\n  static stan::mcmc::chains<> *chains;\n  static size_t num_chains;\n  static std::vector<std::string> command_outputs;\n  static const size_t skip;\n  static size_t iterations;\n\n  \/** \n   * SetUpTestCase() called by google test once\n   * a test case.\n   *\n   * Sets:\n   *  - path_separator: '\\' for Windows, '\/' for all else.\n   *  - base_name:      location of model without \".stan\"\n   *  - chains:         creates a chains object by reading\n   *                    the header of a csv file\n   *\/\n  static void SetUpTestCase() {\n    model_path = convert_model_path(get_model_path());\n\n    iterations = num_iterations();\n\n    chains = create_chains();\n  }\n    \n  \/** \n   * TearDownTestCase() called by google test once\n   * a test case.\n   *\n   * Deletes chains. \n   *\/\n  static void TearDownTestCase() {\n    delete chains;\n  }\n\n  \/** \n   * Returns the csv file for the chain number.\n   * \n   * @param chain the chain number\n   * \n   * @return the file location of the csv file\n   *\/\n  static std::string get_csv_file(size_t chain) {\n    std::stringstream csv_file;\n    csv_file << model_path << \".\" << chain << \".csv\";\n    return csv_file.str();\n  }\n\n  \/** \n   * Returns the command to run in a shell on the OS.\n   * \n   * @param chain the chain number \n   * \n   * @return a string command that can be run from a shell.\n   *\/\n  static std::string get_command(size_t chain) {\n    std::stringstream command;\n    command << model_path;\n    command << \" --samples=\" << get_csv_file(chain);\n    if (has_data()) {\n      command << \" --data=\" << model_path << \".Rdata\";\n    }\n    if (has_init()) {\n      command << \" --init=\" << model_path << \"_init.Rdata\";\n    }\n    command << \" --iter=\" << iterations;\n    command << \" --refresh=\" << iterations;\n    return command.str();\n  }\n\n  \/** \n   * Populates the chains object with data from csv files.\n   *\/\n  static void default_populate_chains() {\n    if (chains->num_kept_samples() == 0U) {\n      for (size_t chain = 0U; chain < num_chains; chain++) {\n        stan::mcmc::add_chain(*chains, chain, get_csv_file(chain), skip);\n      }\n    }\n  }\n\n  static void populate_chains() {\n    Derived::populate_chains();\n  }\n  \n  static void test_gradient() {\n    std::string command = get_command(0U);\n    command += \" --test_grad\";\n    std::string command_output;\n    EXPECT_NO_THROW(command_output = run_command(command))\n      << \"Gradient test failed. \\n\"\n      << \"\\tRan command: \" << command << \"\\n\"\n      << \"\\tCommand output: \" << command_output;\n    \/\/std::cout << \"command_output: \" << command_output << \"\\n\";\n  }\n\n  \/** \n   * Runs the model num_chains times.\n   * Populates the chains object after running the model.\n   *\/\n  static void run_model() {\n    for (size_t chain = 0; chain < num_chains; chain++) {\n      std::string command_output;\n      EXPECT_NO_THROW(command_output = run_command(get_command(chain))) \n        << \"Can not execute command: \" << get_command(chain);\n      command_outputs.push_back(command_output);\n    }\n    populate_chains();\n  }\n    \n  \/** \n   * Creates a chains object.\n   *\n   * Runs the model for 0 iterations to read the\n   * names and dimensions of the parameters.\n   * \n   * @return An initialized chains object.\n   *\/\n  static stan::mcmc::chains<>* create_chains() {\n    std::stringstream command;\n    command << get_command(num_chains)\n\t    << \" --iter=0\";\n    EXPECT_NO_THROW(run_command(command.str())) \n      << \"Can not build header using: \" << command.str();\n      \n    std::vector<std::string> names;\n    std::vector<std::vector<size_t> > dimss;\n    stan::mcmc::read_variables(get_csv_file(num_chains), skip,\n                               names, dimss);\n      \n    return (new stan::mcmc::chains<>(num_chains, names, dimss));\n  }\n\n\n  \/** \n   * Return the path to the model (without the extension) as\n   * a vector.\n   * \n   * @return the path to the model\n   *\/\n  static std::vector<std::string> get_model_path() {\n    return Derived::get_model_path();\n  }\n  \n  \/**\n   * Return true if the model has data.\n   *\n   * @return true if the model has data;\n   *         false otherwise.\n   *\/\n  static bool has_data() {\n    return Derived::has_data();\n  }\n\n  \/**\n   * Return true if the model has an initialization file.\n   *\n   * @return true if the model has an initialization file;\n   *         false otherwise.\n   *\/\n  static bool has_init() {\n    return Derived::has_init();\n  }\n\n  static size_t num_iterations() {\n    return Derived::num_iterations();\n  }\n\n  static std::vector<std::pair<size_t, double> >\n  get_expected_values() {\n    return Derived::get_expected_values();\n  }\n\n};\n  \ntemplate<class Derived> \nstan::mcmc::chains<> *Model_Test_Fixture<Derived>::chains;\n\ntemplate<class Derived>\nsize_t Model_Test_Fixture<Derived>::num_chains = 2;\n\ntemplate<class Derived>\nstd::string Model_Test_Fixture<Derived>::model_path;\n\ntemplate<class Derived>\nstd::vector<std::string> Model_Test_Fixture<Derived>::command_outputs;\n\ntemplate<class Derived>\nconst size_t Model_Test_Fixture<Derived>::skip = 3U;\n\ntemplate<class Derived>\nsize_t Model_Test_Fixture<Derived>::iterations = 2000U;\n\n\nTYPED_TEST_CASE_P(Model_Test_Fixture);\n\nTYPED_TEST_P(Model_Test_Fixture, TestGradient) {\n  TypeParam::test_gradient();\n}\n\nTYPED_TEST_P(Model_Test_Fixture, RunModel) {\n  TypeParam::run_model();\n}\n\nTYPED_TEST_P(Model_Test_Fixture, ChainsTest) {\n  std::vector<std::string> err_message;\n  for (size_t chain = 0; chain < TypeParam::num_chains; chain++) {\n    std::vector<std::pair<std::string, std::string> > options = \n      parse_command_output(TypeParam::command_outputs[chain]);\n    parse_command_output(TypeParam::command_outputs[chain]);\n\n    std::string msg = \"Seed is : \";\n    for (size_t option = 0; option < options.size(); option++) {\n      if (options[option].first == \"seed\")\n        msg += options[option].second;\n    }\n    err_message.push_back(msg);\n  }\n\n  stan::mcmc::chains<> *c = TypeParam::chains;\n  size_t num_chains = c->num_chains();\n  size_t num_params = c->num_params();\n  for (size_t chain = 0; chain < num_chains; chain++) {\n    for (size_t param = 0; param < num_params; param++) {\n      EXPECT_GT(c->variance(chain, param), 0)\n        << \"Chain \" << chain << \", param \" << param\n        << \": variance is 0\" << std::endl\n        << err_message[chain];\n      \/\/ made this 1.2 to fail less often\n      EXPECT_LT(c->split_potential_scale_reduction(param), 1.2) \n\t<< \"Chain \" << chain << \", param \" << param\n        << \": split r hat > 1.2\" << std::endl\n        << err_message[chain];\n    }\n  }\n}\n\n\nTYPED_TEST_P(Model_Test_Fixture, ExpectedValuesTest) {\n  using std::vector;\n  using std::pair;\n  using std::sqrt;\n  using std::fabs;\n  using std::setw;\n\n  using boost::math::students_t;\n  using boost::math::binomial;\n  using boost::math::quantile;\n  \n  vector<pair<size_t, double> > expected_values = TypeParam::get_expected_values();\n  size_t n = expected_values.size();\n  if (n == 0)\n    return;\n\n  stan::mcmc::chains<> *c = TypeParam::chains;\n  double alpha = 0.005;\n  if (n < 3)\n    alpha = 0.001;\n  \n  int failed = 0;\n  std::stringstream err_message;\n  for (size_t i = 0; i < n; i++) {\n    size_t index = expected_values[i].first;\n    double expected_mean = expected_values[i].second;\n\n    double neff = c->effective_sample_size(index);\n    double sample_mean = c->mean(index);\n    double se = c->sd(index) \/ sqrt(neff);\n    double z = quantile(students_t(neff-1.0), 1 - alpha\/2.0);\n\n\n    \/\/ that 2.0 is there to make the test fail less often.\n    if (fabs(expected_mean - sample_mean) > z*se * 2.0) {\n      failed++;\n      \/\/ want the error message to have which, what, how\n      err_message << \"parameter index: \" << index\n                  << \"\\n\\texpected:    \" << setw(10) << expected_mean\n                  << \"\\n\\tsampled:     \" << setw(10) << sample_mean\n\t\t  << \"\\n\\tsd:          \" << setw(10) << c->sd(index)\n                  << \"\\n\\tneff:        \" << setw(10) << neff\n                  << \"\\n\\tsplit R.hat: \" << setw(10) << c->split_potential_scale_reduction(index)\n                  << \"\\n\\tz:           \" << setw(10) << z\n                  << \"\\n\\tse:          \" << setw(10) << se\n                  << \"\\n\\n\\tfabs(diff) > z * se: \" \n                  << fabs(expected_mean - sample_mean) << \" > \" << z*se << \"\\n\\n\";\n    }\n  }\n  \n  if (failed == 0)\n    return;\n\n  double p = 1 - cdf(binomial(n, alpha), failed);\n  \/\/ this test should fail less than 0.1% of the time.\n  \/\/ (if all the parameters are failing independently... ha)\n  if (p < 0.001) {\n    err_message << \"------------------------------------------------------------\\n\";\n    for (size_t chain = 0; chain < TypeParam::num_chains; chain++) {\n      std::vector<std::pair<std::string, std::string> > options = \n        parse_command_output(TypeParam::command_outputs[chain]);\n\n      for (size_t option = 0; option < options.size(); option++) {\n        if (options[option].first == \"seed\")\n          err_message << \"seed: \" << options[option].second << std::endl;\n      }\n    }\n    \n    EXPECT_EQ(0, failed)\n      << \"Failed \" << failed << \" of \" << expected_values.size() << \" comparisons\\n\"\n      << \"p: \" << p << std::endl\n      << \"------------------------------------------------------------\\n\"\n      << err_message.str() << std::endl\n      << \"------------------------------------------------------------\\n\";\n    \n  }\n}\n\nREGISTER_TYPED_TEST_CASE_P(Model_Test_Fixture,\n                           TestGradient,\n                           RunModel,\n                           ChainsTest,\n                           ExpectedValuesTest);\n\n#endif\n<commit_msg>test-models: updated model fixture<commit_after>#ifndef __TEST__MODELS__MODEL_TEST_FIXTURE_HPP__\n#define __TEST__MODELS__MODEL_TEST_FIXTURE_HPP__\n\n#include <gtest\/gtest.h>\n#include <test\/models\/utility.hpp>\n#include <stan\/mcmc\/chains.hpp>\n#include <utility>\n#include <boost\/math\/distributions\/students_t.hpp>\n#include <boost\/math\/distributions\/binomial.hpp>\n\n\/** \n * Model_Test_Fixture is a test fixture for google test\n * to aid in running models.\n *\n * Derived classes must define:\n *   static std::vector<std::string> get_model_path()\n *   static bool has_data()\n *   - indicates whether the model has data\n *\/\ntemplate <class Derived>\nclass Model_Test_Fixture : public ::testing::Test {\n  \npublic:\n  static char path_separator;\n  static std::string model_path;\n  static stan::mcmc::chains<> *chains;\n  static size_t num_chains;\n  static std::vector<std::string> command_outputs;\n  static const size_t skip;\n  static size_t iterations;\n\n  \/** \n   * SetUpTestCase() called by google test once\n   * a test case.\n   *\n   * Sets:\n   *  - path_separator: '\\' for Windows, '\/' for all else.\n   *  - base_name:      location of model without \".stan\"\n   *  - chains:         creates a chains object by reading\n   *                    the header of a csv file\n   *\/\n  static void SetUpTestCase() {\n    model_path = convert_model_path(get_model_path());\n\n    iterations = num_iterations();\n\n    chains = create_chains();\n  }\n    \n  \/** \n   * TearDownTestCase() called by google test once\n   * a test case.\n   *\n   * Deletes chains. \n   *\/\n  static void TearDownTestCase() {\n    delete chains;\n  }\n\n  \/** \n   * Returns the csv file for the chain number.\n   * \n   * @param chain the chain number\n   * \n   * @return the file location of the csv file\n   *\/\n  static std::string get_csv_file(size_t chain) {\n    std::stringstream csv_file;\n    csv_file << model_path << \".\" << chain << \".csv\";\n    return csv_file.str();\n  }\n\n  \/** \n   * Returns the command to run in a shell on the OS.\n   * \n   * @param chain the chain number \n   * \n   * @return a string command that can be run from a shell.\n   *\/\n  static std::string get_command(size_t chain) {\n    std::stringstream command;\n    command << model_path;\n    command << \" --samples=\" << get_csv_file(chain);\n    if (has_data()) {\n      command << \" --data=\" << model_path << \".Rdata\";\n    }\n    if (has_init()) {\n      command << \" --init=\" << model_path << \"_init.Rdata\";\n    }\n    command << \" --iter=\" << iterations;\n    command << \" --refresh=\" << iterations;\n    return command.str();\n  }\n\n  \/** \n   * Populates the chains object with data from csv files.\n   *\/\n  static void default_populate_chains() {\n    if (chains->num_kept_samples() == 0U) {\n      for (size_t chain = 0U; chain < num_chains; chain++) {\n        stan::mcmc::add_chain(*chains, chain, get_csv_file(chain), skip);\n      }\n    }\n  }\n\n  static void populate_chains() {\n    Derived::populate_chains();\n  }\n  \n  static void test_gradient() {\n    std::string command = get_command(0U);\n    command += \" --test_grad\";\n    std::string command_output;\n    EXPECT_NO_THROW(command_output = run_command(command))\n      << \"Gradient test failed. \\n\"\n      << \"\\tRan command: \" << command << \"\\n\"\n      << \"\\tCommand output: \" << command_output;\n    \/\/std::cout << \"command_output: \" << command_output << \"\\n\";\n  }\n\n  \/** \n   * Runs the model num_chains times.\n   * Populates the chains object after running the model.\n   *\/\n  static void run_model() {\n    for (size_t chain = 0; chain < num_chains; chain++) {\n      std::string command_output;\n      EXPECT_NO_THROW(command_output = run_command(get_command(chain))) \n        << \"Can not execute command: \" << get_command(chain);\n      command_outputs.push_back(command_output);\n    }\n    populate_chains();\n  }\n    \n  \/** \n   * Creates a chains object.\n   *\n   * Runs the model for 0 iterations to read the\n   * names and dimensions of the parameters.\n   * \n   * @return An initialized chains object.\n   *\/\n  static stan::mcmc::chains<>* create_chains() {\n    std::stringstream command;\n    command << get_command(num_chains)\n\t    << \" --iter=0\";\n    EXPECT_NO_THROW(run_command(command.str())) \n      << \"Can not build header using: \" << command.str();\n      \n    std::vector<std::string> names;\n    std::vector<std::vector<size_t> > dimss;\n    stan::mcmc::read_variables(get_csv_file(num_chains), skip,\n                               names, dimss);\n      \n    return (new stan::mcmc::chains<>(num_chains, names, dimss));\n  }\n\n\n  \/** \n   * Return the path to the model (without the extension) as\n   * a vector.\n   * \n   * @return the path to the model\n   *\/\n  static std::vector<std::string> get_model_path() {\n    return Derived::get_model_path();\n  }\n  \n  \/**\n   * Return true if the model has data.\n   *\n   * @return true if the model has data;\n   *         false otherwise.\n   *\/\n  static bool has_data() {\n    return Derived::has_data();\n  }\n\n  \/**\n   * Return true if the model has an initialization file.\n   *\n   * @return true if the model has an initialization file;\n   *         false otherwise.\n   *\/\n  static bool has_init() {\n    return Derived::has_init();\n  }\n\n  static size_t num_iterations() {\n    return Derived::num_iterations();\n  }\n\n  static std::vector<std::pair<size_t, double> >\n  get_expected_values() {\n    return Derived::get_expected_values();\n  }\n\n};\n  \ntemplate<class Derived> \nstan::mcmc::chains<> *Model_Test_Fixture<Derived>::chains;\n\ntemplate<class Derived>\nsize_t Model_Test_Fixture<Derived>::num_chains = 2;\n\ntemplate<class Derived>\nstd::string Model_Test_Fixture<Derived>::model_path;\n\ntemplate<class Derived>\nstd::vector<std::string> Model_Test_Fixture<Derived>::command_outputs;\n\ntemplate<class Derived>\nconst size_t Model_Test_Fixture<Derived>::skip = 3U;\n\ntemplate<class Derived>\nsize_t Model_Test_Fixture<Derived>::iterations = 2000U;\n\n\nTYPED_TEST_CASE_P(Model_Test_Fixture);\n\nTYPED_TEST_P(Model_Test_Fixture, TestGradient) {\n  TypeParam::test_gradient();\n}\n\nTYPED_TEST_P(Model_Test_Fixture, RunModel) {\n  TypeParam::run_model();\n}\n\nTYPED_TEST_P(Model_Test_Fixture, ChainsTest) {\n  std::vector<std::string> err_message;\n  for (size_t chain = 0; chain < TypeParam::num_chains; chain++) {\n    std::vector<std::pair<std::string, std::string> > options = \n      parse_command_output(TypeParam::command_outputs[chain]);\n    parse_command_output(TypeParam::command_outputs[chain]);\n\n    std::string msg = \"Seed is : \";\n    for (size_t option = 0; option < options.size(); option++) {\n      if (options[option].first == \"seed\")\n        msg += options[option].second;\n    }\n    err_message.push_back(msg);\n  }\n\n  stan::mcmc::chains<> *c = TypeParam::chains;\n  size_t num_chains = c->num_chains();\n  size_t num_params = c->num_params();\n  for (size_t chain = 0; chain < num_chains; chain++) {\n    for (size_t param = 0; param < num_params; param++) {\n      EXPECT_GT(c->variance(chain, param), 0)\n        << \"Chain \" << chain << \", param \" << param\n        << \": variance is 0\" << std::endl\n        << err_message[chain];\n      \/\/ made this 1.2 to fail less often\n      EXPECT_LT(c->split_potential_scale_reduction(param), 1.2) \n\t<< \"Chain \" << chain << \", param \" << param\n        << \": split r hat > 1.2\" << std::endl\n        << err_message[chain];\n    }\n  }\n}\n\n\nTYPED_TEST_P(Model_Test_Fixture, ExpectedValuesTest) {\n  using std::vector;\n  using std::pair;\n  using std::sqrt;\n  using std::fabs;\n  using std::setw;\n\n  using boost::math::students_t;\n  using boost::math::binomial;\n  using boost::math::quantile;\n  \n  vector<pair<size_t, double> > expected_values = TypeParam::get_expected_values();\n  size_t n = expected_values.size();\n  if (n == 0)\n    return;\n\n  stan::mcmc::chains<> *c = TypeParam::chains;\n  double alpha = 0.005;\n  if (n < 3)\n    alpha = 0.001;\n  \n  int failed = 0;\n  std::stringstream err_message;\n  for (size_t i = 0; i < n; i++) {\n    size_t index = expected_values[i].first;\n    double expected_mean = expected_values[i].second;\n\n    double neff = c->effective_sample_size(index);\n    double sample_mean = c->mean(index);\n    double se = c->sd(index) \/ sqrt(neff);\n    double z = quantile(students_t(neff-1.0), 1 - alpha\/2.0);\n\n\n    \/\/ that 2.0 is there to make the test fail less often.\n    if (fabs(expected_mean - sample_mean) > z*se * 2.0) {\n      failed++;\n      \/\/ want the error message to have which, what, how\n      err_message << \"parameter index: \" << index\n                  << \"\\n\\texpected:    \" << setw(10) << expected_mean\n                  << \"\\n\\tsampled:     \" << setw(10) << sample_mean\n\t\t  << \"\\n\\tsd:          \" << setw(10) << c->sd(index)\n                  << \"\\n\\tneff:        \" << setw(10) << neff\n                  << \"\\n\\tsplit R.hat: \" << setw(10) << c->split_potential_scale_reduction(index)\n                  << \"\\n\\tz:           \" << setw(10) << z\n                  << \"\\n\\tse:          \" << setw(10) << se\n                  << \"\\n\\n\\tfabs(diff) > z * se: \" \n                  << fabs(expected_mean - sample_mean) << \" > \" << z*se << \"\\n\\n\";\n    }\n  }\n  \n  if (failed == 0)\n    return;\n\n  double p = 1 - cdf(binomial(n, alpha), failed);\n  \/\/ this test should fail less than 0.01% of the time.\n  \/\/ (if all the parameters are failing independently... ha)\n  if (p < 0.0001) {\n    err_message << \"------------------------------------------------------------\\n\";\n    for (size_t chain = 0; chain < TypeParam::num_chains; chain++) {\n      std::vector<std::pair<std::string, std::string> > options = \n        parse_command_output(TypeParam::command_outputs[chain]);\n\n      for (size_t option = 0; option < options.size(); option++) {\n        if (options[option].first == \"seed\")\n          err_message << \"seed: \" << options[option].second << std::endl;\n      }\n    }\n    \n    EXPECT_EQ(0, failed)\n      << \"Failed \" << failed << \" of \" << expected_values.size() << \" comparisons\\n\"\n      << \"p: \" << p << std::endl\n      << \"------------------------------------------------------------\\n\"\n      << err_message.str() << std::endl\n      << \"------------------------------------------------------------\\n\";\n    \n  }\n}\n\nREGISTER_TYPED_TEST_CASE_P(Model_Test_Fixture,\n                           TestGradient,\n                           RunModel,\n                           ChainsTest,\n                           ExpectedValuesTest);\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- C++ -*- *\/\n\n\/**\n * @file ASPsolverTest.cpp\n * @author Roman Schindlauer\n * @date Thu Jun 30 12:39:40 2005\n *\n * @brief Testsuite class for testing the ASP solver class.\n *\n *\n *\n *\/\n\n#include \"testsuite\/dlvhex\/ASPsolverTest.h\"\n#include \"dlvhex\/errorHandling.h\"\n#include \"dlvhex\/globals.h\"\n\n\/\/ Registers the fixture into the 'registry'\nCPPUNIT_TEST_SUITE_REGISTRATION(ASPsolverTest);\n\nvoid\nASPsolverTest::setUp()\n{\n    solver = new ASPsolver();\n\n    global::optionNoPredicate = 0;\n}\n\nvoid\nASPsolverTest::tearDown() \n{\n    delete solver;\n}\n\nvoid\nASPsolverTest::testExecution()\n{\n    \/\/\n    \/\/ fatal error:\n    \/\/\n    std::string prg(\"p.q\");\n    CPPUNIT_ASSERT_THROW(solver->callSolver(prg), fatalError);\n    prg = \"p(X):-q.\";\n    CPPUNIT_ASSERT_THROW(solver->callSolver(prg), fatalError);\n    prg = \"p(a,b).p(c).\";\n    CPPUNIT_ASSERT_THROW(solver->callSolver(prg), fatalError);\n\n    \/\/\n    \/\/ TODO: if we parametrize the solver-executable later, test\n    \/\/ also the solver existence!\n    \/\/\n}\n\nvoid\nASPsolverTest::testResult()\n{\n    std::string prg;\n    GAtomSet *as;\n\n    \/\/\n    \/\/ no model\n    \/\/\n    prg = \"-p.p.\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n    \n    \/\/\n    \/\/ empty model\n    \/\/\n    prg = \"p:-q.\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 0);\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n    \n    \/\/\n    \/\/ single model\n    \/\/\n    prg = \"p.q:-p.\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 1);\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n    \n    \/\/\n    \/\/ two models\n    \/\/\n    prg = \"p(X):-not q(X),s(X).q(X):-not p(X),s(X).s(a).\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 1);\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 1);\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n\n    \/\/\n    \/\/ strings\n    \/\/\n    std::string str(\"\\\"quoted string, includes some (nasty) special-characters!+#'*[]{}\\\"\");\n    prg = \"a(\" + str + \") :- b. b.\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 1);\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n    CPPUNIT_ASSERT((*(as->begin())).getArgument(1).getString() == str);\n    \n}\n<commit_msg>fixed error<commit_after>\/* -*- C++ -*- *\/\n\n\/**\n * @file ASPsolverTest.cpp\n * @author Roman Schindlauer\n * @date Thu Jun 30 12:39:40 2005\n *\n * @brief Testsuite class for testing the ASP solver class.\n *\n *\n *\n *\/\n\n#include \"testsuite\/dlvhex\/ASPsolverTest.h\"\n#include \"dlvhex\/errorHandling.h\"\n#include \"dlvhex\/globals.h\"\n\n\/\/ Registers the fixture into the 'registry'\nCPPUNIT_TEST_SUITE_REGISTRATION(ASPsolverTest);\n\nvoid\nASPsolverTest::setUp()\n{\n    solver = new ASPsolver();\n\n    global::optionNoPredicate = 0;\n}\n\nvoid\nASPsolverTest::tearDown() \n{\n    delete solver;\n}\n\nvoid\nASPsolverTest::testExecution()\n{\n    \/\/\n    \/\/ fatal error:\n    \/\/\n    std::string prg(\"p.q\");\n    CPPUNIT_ASSERT_THROW(solver->callSolver(prg), FatalError);\n    prg = \"p(X):-q.\";\n    CPPUNIT_ASSERT_THROW(solver->callSolver(prg), FatalError);\n    prg = \"p(a,b).p(c).\";\n    CPPUNIT_ASSERT_THROW(solver->callSolver(prg), FatalError);\n\n    \/\/\n    \/\/ TODO: if we parametrize the solver-executable later, test\n    \/\/ also the solver existence!\n    \/\/\n}\n\nvoid\nASPsolverTest::testResult()\n{\n    std::string prg;\n    GAtomSet *as;\n\n    \/\/\n    \/\/ no model\n    \/\/\n    prg = \"-p.p.\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n    \n    \/\/\n    \/\/ empty model\n    \/\/\n    prg = \"p:-q.\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 0);\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n    \n    \/\/\n    \/\/ single model\n    \/\/\n    prg = \"p.q:-p.\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 1);\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n    \n    \/\/\n    \/\/ two models\n    \/\/\n    prg = \"p(X):-not q(X),s(X).q(X):-not p(X),s(X).s(a).\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 1);\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 1);\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n\n    \/\/\n    \/\/ strings\n    \/\/\n    std::string str(\"\\\"quoted string, includes some (nasty) special-characters!+#'*[]{}\\\"\");\n    prg = \"a(\" + str + \") :- b. b.\";\n    CPPUNIT_ASSERT_NO_THROW(solver->callSolver(prg));\n    as = solver->getNextAnswerSet();\n    CPPUNIT_ASSERT(as->size() == 1);\n    CPPUNIT_ASSERT(solver->getNextAnswerSet() == NULL);\n    CPPUNIT_ASSERT((*(as->begin())).getArgument(1).getString() == str);\n    \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2017 WebAssembly Community Group participants\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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\/\/ wasm-emscripten-finalize console tool\n\/\/ Performs Emscripten-specific transforms on .wasm files\n\/\/\n\n#include <exception>\n\n#include \"abi\/js.h\"\n#include \"ir\/trapping.h\"\n#include \"support\/colors.h\"\n#include \"support\/debug.h\"\n#include \"support\/file.h\"\n#include \"tool-options.h\"\n#include \"wasm-binary.h\"\n#include \"wasm-emscripten.h\"\n#include \"wasm-io.h\"\n#include \"wasm-validator.h\"\n\n#define DEBUG_TYPE \"emscripten\"\n\nusing namespace cashew;\nusing namespace wasm;\n\nint main(int argc, const char* argv[]) {\n  const uint64_t INVALID_BASE = -1;\n\n  std::string infile;\n  std::string outfile;\n  std::string inputSourceMapFilename;\n  std::string outputSourceMapFilename;\n  std::string outputSourceMapUrl;\n  std::string dataSegmentFile;\n  bool emitBinary = true;\n  bool debugInfo = false;\n  bool DWARF = false;\n  bool sideModule = false;\n  bool legalizeJavaScriptFFI = true;\n  bool bigInt = false;\n  bool checkStackOverflow = false;\n  uint64_t globalBase = INVALID_BASE;\n  bool standaloneWasm = false;\n  \/\/ TODO: remove after https:\/\/github.com\/WebAssembly\/binaryen\/issues\/3043\n  bool minimizeWasmChanges = false;\n  bool noDynCalls = false;\n  bool onlyI64DynCalls = false;\n\n  ToolOptions options(\"wasm-emscripten-finalize\",\n                      \"Performs Emscripten-specific transforms on .wasm files\");\n  options\n    .add(\"--output\",\n         \"-o\",\n         \"Output file\",\n         Options::Arguments::One,\n         [&outfile](Options*, const std::string& argument) {\n           outfile = argument;\n           Colors::setEnabled(false);\n         })\n    .add(\"--debuginfo\",\n         \"-g\",\n         \"Emit names section in wasm binary (or full debuginfo in wast)\",\n         Options::Arguments::Zero,\n         [&debugInfo](Options*, const std::string&) { debugInfo = true; })\n    .add(\"--dwarf\",\n         \"\",\n         \"Update DWARF debug info\",\n         Options::Arguments::Zero,\n         [&DWARF](Options*, const std::string&) { DWARF = true; })\n    .add(\"--emit-text\",\n         \"-S\",\n         \"Emit text instead of binary for the output file. \"\n         \"In this mode if no output file is specified, we write to stdout.\",\n         Options::Arguments::Zero,\n         [&emitBinary](Options*, const std::string&) { emitBinary = false; })\n    .add(\"--global-base\",\n         \"\",\n         \"The address at which static globals were placed\",\n         Options::Arguments::One,\n         [&globalBase](Options*, const std::string& argument) {\n           globalBase = std::stoull(argument);\n         })\n    \/\/ TODO(sbc): Remove this one this argument is no longer passed by\n    \/\/ emscripten. See https:\/\/github.com\/emscripten-core\/emscripten\/issues\/8905\n    .add(\"--initial-stack-pointer\",\n         \"\",\n         \"ignored - will be removed in a future release\",\n         Options::Arguments::One,\n         [](Options*, const std::string& argument) {})\n    .add(\"--side-module\",\n         \"\",\n         \"Input is an emscripten side module\",\n         Options::Arguments::Zero,\n         [&sideModule](Options* o, const std::string& argument) {\n           sideModule = true;\n         })\n    .add(\"--new-pic-abi\",\n         \"\",\n         \"Use new\/llvm PIC abi\",\n         Options::Arguments::Zero,\n         [&](Options* o, const std::string& argument) {})\n    .add(\"--input-source-map\",\n         \"-ism\",\n         \"Consume source map from the specified file\",\n         Options::Arguments::One,\n         [&inputSourceMapFilename](Options* o, const std::string& argument) {\n           inputSourceMapFilename = argument;\n         })\n    .add(\"--no-legalize-javascript-ffi\",\n         \"-nj\",\n         \"Do not fully legalize (i64->i32, \"\n         \"f32->f64) the imports and exports for interfacing with JS\",\n         Options::Arguments::Zero,\n         [&legalizeJavaScriptFFI](Options* o, const std::string&) {\n           legalizeJavaScriptFFI = false;\n         })\n    .add(\"--bigint\",\n         \"-bi\",\n         \"Assume JS will use wasm\/JS BigInt integration, so wasm i64s will \"\n         \"turn into JS BigInts, and there is no need for any legalization at \"\n         \"all (not even minimal legalization of dynCalls)\",\n         Options::Arguments::Zero,\n         [&bigInt](Options* o, const std::string&) { bigInt = true; })\n    .add(\"--output-source-map\",\n         \"-osm\",\n         \"Emit source map to the specified file\",\n         Options::Arguments::One,\n         [&outputSourceMapFilename](Options* o, const std::string& argument) {\n           outputSourceMapFilename = argument;\n         })\n    .add(\"--output-source-map-url\",\n         \"-osu\",\n         \"Emit specified string as source map URL\",\n         Options::Arguments::One,\n         [&outputSourceMapUrl](Options* o, const std::string& argument) {\n           outputSourceMapUrl = argument;\n         })\n    .add(\"--separate-data-segments\",\n         \"\",\n         \"Separate data segments to a file\",\n         Options::Arguments::One,\n         [&dataSegmentFile](Options* o, const std::string& argument) {\n           dataSegmentFile = argument;\n         })\n    .add(\"--check-stack-overflow\",\n         \"\",\n         \"Check for stack overflows every time the stack is extended\",\n         Options::Arguments::Zero,\n         [&checkStackOverflow](Options* o, const std::string&) {\n           checkStackOverflow = true;\n         })\n    .add(\"--standalone-wasm\",\n         \"\",\n         \"Emit a wasm file that does not depend on JS, as much as possible,\"\n         \" using wasi and other standard conventions etc. where possible\",\n         Options::Arguments::Zero,\n         [&standaloneWasm](Options* o, const std::string&) {\n           standaloneWasm = true;\n         })\n    .add(\"--minimize-wasm-changes\",\n         \"\",\n         \"Modify the wasm as little as possible. This is useful during \"\n         \"development as we reduce the number of changes to the wasm, as it \"\n         \"lets emscripten control how much modifications to do.\",\n         Options::Arguments::Zero,\n         [&minimizeWasmChanges](Options* o, const std::string&) {\n           minimizeWasmChanges = true;\n         })\n    .add(\"--no-dyncalls\",\n         \"\",\n         \"\",\n         Options::Arguments::Zero,\n         [&noDynCalls](Options* o, const std::string&) { noDynCalls = true; })\n    .add(\"--dyncalls-i64\",\n         \"\",\n         \"\",\n         Options::Arguments::Zero,\n         [&onlyI64DynCalls](Options* o, const std::string&) {\n           onlyI64DynCalls = true;\n         })\n    .add_positional(\"INFILE\",\n                    Options::Arguments::One,\n                    [&infile](Options* o, const std::string& argument) {\n                      infile = argument;\n                    });\n  options.parse(argc, argv);\n\n  if (infile == \"\") {\n    Fatal() << \"Need to specify an infile\\n\";\n  }\n\n  \/\/ We will write the modified wasm if the user asked us to, either by\n  \/\/ specifying an output file or requesting text output (which goes to stdout\n  \/\/ by default).\n  auto writeOutput = outfile.size() > 0 || !emitBinary;\n\n  Module wasm;\n  ModuleReader reader;\n  \/\/ If we are not writing output then we definitely don't need to read debug\n  \/\/ info, as it does not affect the metadata we will emit. (However, if we\n  \/\/ emit output then definitely load the names section so that we roundtrip\n  \/\/ names properly.)\n  reader.setDebugInfo(writeOutput);\n  reader.setDWARF(DWARF && writeOutput);\n  if (!writeOutput) {\n    \/\/ If we are not writing the output then all we are doing is simple parsing\n    \/\/ of metadata from global parts of the wasm such as imports and exports. In\n    \/\/ that case, it is unnecessary to parse function contents which are the\n    \/\/ great bulk of the work, and we can skip all that.\n    reader.setSkipFunctionBodies(true);\n  }\n  try {\n    reader.read(infile, wasm, inputSourceMapFilename);\n  } catch (ParseException& p) {\n    p.dump(std::cerr);\n    std::cerr << '\\n';\n    Fatal() << \"error in parsing input\";\n  } catch (MapParseException& p) {\n    p.dump(std::cerr);\n    std::cerr << '\\n';\n    Fatal() << \"error in parsing wasm source map\";\n  }\n\n  options.applyFeatures(wasm);\n\n  BYN_TRACE_WITH_TYPE(\"emscripten-dump\", \"Module before:\\n\");\n  BYN_DEBUG_WITH_TYPE(\"emscripten-dump\", std::cerr << &wasm);\n\n  EmscriptenGlueGenerator generator(wasm);\n  generator.standalone = standaloneWasm;\n  generator.sideModule = sideModule;\n  generator.minimizeWasmChanges = minimizeWasmChanges;\n  generator.onlyI64DynCalls = onlyI64DynCalls;\n  generator.noDynCalls = noDynCalls;\n\n  if (!standaloneWasm) {\n    \/\/ This is also not needed in standalone mode since standalone mode uses\n    \/\/ crt1.c to invoke the main and is aware of __main_argc_argv mangling.\n    generator.renameMainArgcArgv();\n  }\n\n  PassRunner passRunner(&wasm, options.passOptions);\n  passRunner.setDebug(options.debug);\n  passRunner.setDebugInfo(debugInfo);\n\n  if (checkStackOverflow) {\n    if (!standaloneWasm) {\n      \/\/ In standalone mode we don't set a handler at all.. which means\n      \/\/ just trap on overflow.\n      passRunner.options.arguments[\"stack-check-handler\"] =\n        \"__handle_stack_overflow\";\n    }\n    passRunner.add(\"stack-check\");\n  }\n\n  if (!noDynCalls && !standaloneWasm) {\n    \/\/ If not standalone wasm then JS is relevant and we need dynCalls.\n    if (onlyI64DynCalls) {\n      passRunner.add(\"generate-i64-dyncalls\");\n    } else {\n      passRunner.add(\"generate-dyncalls\");\n    }\n  }\n\n  \/\/ Legalize the wasm, if BigInts don't make that moot.\n  if (!bigInt) {\n    passRunner.add(ABI::getLegalizationPass(\n      legalizeJavaScriptFFI ? ABI::LegalizationLevel::Full\n                            : ABI::LegalizationLevel::Minimal));\n  }\n\n  \/\/ Strip target features section (its information is in the metadata)\n  passRunner.add(\"strip-target-features\");\n\n  \/\/ If DWARF is unused, strip it out. This avoids us keeping it alive\n  \/\/ until wasm-opt strips it later.\n  if (!DWARF) {\n    passRunner.add(\"strip-dwarf\");\n  }\n\n  passRunner.run();\n\n  if (sideModule) {\n    BYN_TRACE(\"finalizing as side module\\n\");\n    \/\/ The emscripten PIC ABI still expects a function named\n    \/\/ __post_instantiate to be exported by side module.\n    if (auto* e = wasm.getExportOrNull(WASM_CALL_CTORS)) {\n      e->name = \"__post_instantiate\";\n    }\n  }\n\n  BYN_TRACE(\"generated metadata\\n\");\n  \/\/ Substantial changes to the wasm are done, enough to create the metadata.\n  std::string metadata = generator.generateEmscriptenMetadata();\n\n  \/\/ Finally, separate out data segments if relevant (they may have been needed\n  \/\/ for metadata).\n  if (!dataSegmentFile.empty()) {\n    Output memInitFile(dataSegmentFile, Flags::Binary);\n    if (globalBase == INVALID_BASE) {\n      Fatal() << \"globalBase must be set\";\n    }\n    generator.separateDataSegments(&memInitFile, globalBase);\n  }\n\n  BYN_TRACE_WITH_TYPE(\"emscripten-dump\", \"Module after:\\n\");\n  BYN_DEBUG_WITH_TYPE(\"emscripten-dump\", std::cerr << wasm << '\\n');\n\n  if (writeOutput) {\n    Output output(outfile, emitBinary ? Flags::Binary : Flags::Text);\n    ModuleWriter writer;\n    writer.setDebugInfo(debugInfo);\n    \/\/ writer.setSymbolMap(symbolMap);\n    writer.setBinary(emitBinary);\n    if (outputSourceMapFilename.size()) {\n      writer.setSourceMapFilename(outputSourceMapFilename);\n      writer.setSourceMapUrl(outputSourceMapUrl);\n    }\n    writer.write(wasm, output);\n    if (!emitBinary) {\n      output << \"(;\\n\";\n      output << \"--BEGIN METADATA --\\n\" << metadata << \"-- END METADATA --\\n\";\n      output << \";)\\n\";\n    }\n  }\n  \/\/ If we emit text then we emitted the metadata together with that text\n  \/\/ earlier. Otherwise emit it to stdout.\n  if (emitBinary) {\n    std::cout << metadata;\n  }\n  return 0;\n}\n<commit_msg>Revert the effect of #3689 (#3705)<commit_after>\/*\n * Copyright 2017 WebAssembly Community Group participants\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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\/\/ wasm-emscripten-finalize console tool\n\/\/ Performs Emscripten-specific transforms on .wasm files\n\/\/\n\n#include <exception>\n\n#include \"abi\/js.h\"\n#include \"ir\/trapping.h\"\n#include \"support\/colors.h\"\n#include \"support\/debug.h\"\n#include \"support\/file.h\"\n#include \"tool-options.h\"\n#include \"wasm-binary.h\"\n#include \"wasm-emscripten.h\"\n#include \"wasm-io.h\"\n#include \"wasm-validator.h\"\n\n#define DEBUG_TYPE \"emscripten\"\n\nusing namespace cashew;\nusing namespace wasm;\n\nint main(int argc, const char* argv[]) {\n  const uint64_t INVALID_BASE = -1;\n\n  std::string infile;\n  std::string outfile;\n  std::string inputSourceMapFilename;\n  std::string outputSourceMapFilename;\n  std::string outputSourceMapUrl;\n  std::string dataSegmentFile;\n  bool emitBinary = true;\n  bool debugInfo = false;\n  bool DWARF = false;\n  bool sideModule = false;\n  bool legalizeJavaScriptFFI = true;\n  bool bigInt = false;\n  bool checkStackOverflow = false;\n  uint64_t globalBase = INVALID_BASE;\n  bool standaloneWasm = false;\n  \/\/ TODO: remove after https:\/\/github.com\/WebAssembly\/binaryen\/issues\/3043\n  bool minimizeWasmChanges = false;\n  bool noDynCalls = false;\n  bool onlyI64DynCalls = false;\n\n  ToolOptions options(\"wasm-emscripten-finalize\",\n                      \"Performs Emscripten-specific transforms on .wasm files\");\n  options\n    .add(\"--output\",\n         \"-o\",\n         \"Output file\",\n         Options::Arguments::One,\n         [&outfile](Options*, const std::string& argument) {\n           outfile = argument;\n           Colors::setEnabled(false);\n         })\n    .add(\"--debuginfo\",\n         \"-g\",\n         \"Emit names section in wasm binary (or full debuginfo in wast)\",\n         Options::Arguments::Zero,\n         [&debugInfo](Options*, const std::string&) { debugInfo = true; })\n    .add(\"--dwarf\",\n         \"\",\n         \"Update DWARF debug info\",\n         Options::Arguments::Zero,\n         [&DWARF](Options*, const std::string&) { DWARF = true; })\n    .add(\"--emit-text\",\n         \"-S\",\n         \"Emit text instead of binary for the output file. \"\n         \"In this mode if no output file is specified, we write to stdout.\",\n         Options::Arguments::Zero,\n         [&emitBinary](Options*, const std::string&) { emitBinary = false; })\n    .add(\"--global-base\",\n         \"\",\n         \"The address at which static globals were placed\",\n         Options::Arguments::One,\n         [&globalBase](Options*, const std::string& argument) {\n           globalBase = std::stoull(argument);\n         })\n    \/\/ TODO(sbc): Remove this one this argument is no longer passed by\n    \/\/ emscripten. See https:\/\/github.com\/emscripten-core\/emscripten\/issues\/8905\n    .add(\"--initial-stack-pointer\",\n         \"\",\n         \"ignored - will be removed in a future release\",\n         Options::Arguments::One,\n         [](Options*, const std::string& argument) {})\n    .add(\"--side-module\",\n         \"\",\n         \"Input is an emscripten side module\",\n         Options::Arguments::Zero,\n         [&sideModule](Options* o, const std::string& argument) {\n           sideModule = true;\n         })\n    .add(\"--new-pic-abi\",\n         \"\",\n         \"Use new\/llvm PIC abi\",\n         Options::Arguments::Zero,\n         [&](Options* o, const std::string& argument) {})\n    .add(\"--input-source-map\",\n         \"-ism\",\n         \"Consume source map from the specified file\",\n         Options::Arguments::One,\n         [&inputSourceMapFilename](Options* o, const std::string& argument) {\n           inputSourceMapFilename = argument;\n         })\n    .add(\"--no-legalize-javascript-ffi\",\n         \"-nj\",\n         \"Do not fully legalize (i64->i32, \"\n         \"f32->f64) the imports and exports for interfacing with JS\",\n         Options::Arguments::Zero,\n         [&legalizeJavaScriptFFI](Options* o, const std::string&) {\n           legalizeJavaScriptFFI = false;\n         })\n    .add(\"--bigint\",\n         \"-bi\",\n         \"Assume JS will use wasm\/JS BigInt integration, so wasm i64s will \"\n         \"turn into JS BigInts, and there is no need for any legalization at \"\n         \"all (not even minimal legalization of dynCalls)\",\n         Options::Arguments::Zero,\n         [&bigInt](Options* o, const std::string&) { bigInt = true; })\n    .add(\"--output-source-map\",\n         \"-osm\",\n         \"Emit source map to the specified file\",\n         Options::Arguments::One,\n         [&outputSourceMapFilename](Options* o, const std::string& argument) {\n           outputSourceMapFilename = argument;\n         })\n    .add(\"--output-source-map-url\",\n         \"-osu\",\n         \"Emit specified string as source map URL\",\n         Options::Arguments::One,\n         [&outputSourceMapUrl](Options* o, const std::string& argument) {\n           outputSourceMapUrl = argument;\n         })\n    .add(\"--separate-data-segments\",\n         \"\",\n         \"Separate data segments to a file\",\n         Options::Arguments::One,\n         [&dataSegmentFile](Options* o, const std::string& argument) {\n           dataSegmentFile = argument;\n         })\n    .add(\"--check-stack-overflow\",\n         \"\",\n         \"Check for stack overflows every time the stack is extended\",\n         Options::Arguments::Zero,\n         [&checkStackOverflow](Options* o, const std::string&) {\n           checkStackOverflow = true;\n         })\n    .add(\"--standalone-wasm\",\n         \"\",\n         \"Emit a wasm file that does not depend on JS, as much as possible,\"\n         \" using wasi and other standard conventions etc. where possible\",\n         Options::Arguments::Zero,\n         [&standaloneWasm](Options* o, const std::string&) {\n           standaloneWasm = true;\n         })\n    .add(\"--minimize-wasm-changes\",\n         \"\",\n         \"Modify the wasm as little as possible. This is useful during \"\n         \"development as we reduce the number of changes to the wasm, as it \"\n         \"lets emscripten control how much modifications to do.\",\n         Options::Arguments::Zero,\n         [&minimizeWasmChanges](Options* o, const std::string&) {\n           minimizeWasmChanges = true;\n         })\n    .add(\"--no-dyncalls\",\n         \"\",\n         \"\",\n         Options::Arguments::Zero,\n         [&noDynCalls](Options* o, const std::string&) { noDynCalls = true; })\n    .add(\"--dyncalls-i64\",\n         \"\",\n         \"\",\n         Options::Arguments::Zero,\n         [&onlyI64DynCalls](Options* o, const std::string&) {\n           onlyI64DynCalls = true;\n         })\n    .add_positional(\"INFILE\",\n                    Options::Arguments::One,\n                    [&infile](Options* o, const std::string& argument) {\n                      infile = argument;\n                    });\n  options.parse(argc, argv);\n\n  if (infile == \"\") {\n    Fatal() << \"Need to specify an infile\\n\";\n  }\n\n  \/\/ We will write the modified wasm if the user asked us to, either by\n  \/\/ specifying an output file or requesting text output (which goes to stdout\n  \/\/ by default).\n  auto writeOutput = outfile.size() > 0 || !emitBinary;\n\n  Module wasm;\n  ModuleReader reader;\n  \/\/ If we are not writing output then we definitely don't need to read debug\n  \/\/ info, as it does not affect the metadata we will emit. (However, if we\n  \/\/ emit output then definitely load the names section so that we roundtrip\n  \/\/ names properly.)\n  reader.setDebugInfo(writeOutput);\n  reader.setDWARF(DWARF && writeOutput);\n  if (!writeOutput) {\n    \/\/ If we are not writing the output then all we are doing is simple parsing\n    \/\/ of metadata from global parts of the wasm such as imports and exports. In\n    \/\/ that case, it is unnecessary to parse function contents which are the\n    \/\/ great bulk of the work, and we can skip all that. However, the one\n    \/\/ exception is pthreads, which does require scanning the code, and so for\n    \/\/ now we cannot do reader.setSkipFunctionBodies(true); here yet.\n  }\n  try {\n    reader.read(infile, wasm, inputSourceMapFilename);\n  } catch (ParseException& p) {\n    p.dump(std::cerr);\n    std::cerr << '\\n';\n    Fatal() << \"error in parsing input\";\n  } catch (MapParseException& p) {\n    p.dump(std::cerr);\n    std::cerr << '\\n';\n    Fatal() << \"error in parsing wasm source map\";\n  }\n\n  options.applyFeatures(wasm);\n\n  BYN_TRACE_WITH_TYPE(\"emscripten-dump\", \"Module before:\\n\");\n  BYN_DEBUG_WITH_TYPE(\"emscripten-dump\", std::cerr << &wasm);\n\n  EmscriptenGlueGenerator generator(wasm);\n  generator.standalone = standaloneWasm;\n  generator.sideModule = sideModule;\n  generator.minimizeWasmChanges = minimizeWasmChanges;\n  generator.onlyI64DynCalls = onlyI64DynCalls;\n  generator.noDynCalls = noDynCalls;\n\n  if (!standaloneWasm) {\n    \/\/ This is also not needed in standalone mode since standalone mode uses\n    \/\/ crt1.c to invoke the main and is aware of __main_argc_argv mangling.\n    generator.renameMainArgcArgv();\n  }\n\n  PassRunner passRunner(&wasm, options.passOptions);\n  passRunner.setDebug(options.debug);\n  passRunner.setDebugInfo(debugInfo);\n\n  if (checkStackOverflow) {\n    if (!standaloneWasm) {\n      \/\/ In standalone mode we don't set a handler at all.. which means\n      \/\/ just trap on overflow.\n      passRunner.options.arguments[\"stack-check-handler\"] =\n        \"__handle_stack_overflow\";\n    }\n    passRunner.add(\"stack-check\");\n  }\n\n  if (!noDynCalls && !standaloneWasm) {\n    \/\/ If not standalone wasm then JS is relevant and we need dynCalls.\n    if (onlyI64DynCalls) {\n      passRunner.add(\"generate-i64-dyncalls\");\n    } else {\n      passRunner.add(\"generate-dyncalls\");\n    }\n  }\n\n  \/\/ Legalize the wasm, if BigInts don't make that moot.\n  if (!bigInt) {\n    passRunner.add(ABI::getLegalizationPass(\n      legalizeJavaScriptFFI ? ABI::LegalizationLevel::Full\n                            : ABI::LegalizationLevel::Minimal));\n  }\n\n  \/\/ Strip target features section (its information is in the metadata)\n  passRunner.add(\"strip-target-features\");\n\n  \/\/ If DWARF is unused, strip it out. This avoids us keeping it alive\n  \/\/ until wasm-opt strips it later.\n  if (!DWARF) {\n    passRunner.add(\"strip-dwarf\");\n  }\n\n  passRunner.run();\n\n  if (sideModule) {\n    BYN_TRACE(\"finalizing as side module\\n\");\n    \/\/ The emscripten PIC ABI still expects a function named\n    \/\/ __post_instantiate to be exported by side module.\n    if (auto* e = wasm.getExportOrNull(WASM_CALL_CTORS)) {\n      e->name = \"__post_instantiate\";\n    }\n  }\n\n  BYN_TRACE(\"generated metadata\\n\");\n  \/\/ Substantial changes to the wasm are done, enough to create the metadata.\n  std::string metadata = generator.generateEmscriptenMetadata();\n\n  \/\/ Finally, separate out data segments if relevant (they may have been needed\n  \/\/ for metadata).\n  if (!dataSegmentFile.empty()) {\n    Output memInitFile(dataSegmentFile, Flags::Binary);\n    if (globalBase == INVALID_BASE) {\n      Fatal() << \"globalBase must be set\";\n    }\n    generator.separateDataSegments(&memInitFile, globalBase);\n  }\n\n  BYN_TRACE_WITH_TYPE(\"emscripten-dump\", \"Module after:\\n\");\n  BYN_DEBUG_WITH_TYPE(\"emscripten-dump\", std::cerr << wasm << '\\n');\n\n  if (writeOutput) {\n    Output output(outfile, emitBinary ? Flags::Binary : Flags::Text);\n    ModuleWriter writer;\n    writer.setDebugInfo(debugInfo);\n    \/\/ writer.setSymbolMap(symbolMap);\n    writer.setBinary(emitBinary);\n    if (outputSourceMapFilename.size()) {\n      writer.setSourceMapFilename(outputSourceMapFilename);\n      writer.setSourceMapUrl(outputSourceMapUrl);\n    }\n    writer.write(wasm, output);\n    if (!emitBinary) {\n      output << \"(;\\n\";\n      output << \"--BEGIN METADATA --\\n\" << metadata << \"-- END METADATA --\\n\";\n      output << \";)\\n\";\n    }\n  }\n  \/\/ If we emit text then we emitted the metadata together with that text\n  \/\/ earlier. Otherwise emit it to stdout.\n  if (emitBinary) {\n    std::cout << metadata;\n  }\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2017 CodiLime\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 <QSettings>\n#include <QApplication>\n#include <QStandardPaths>\n#include <QFileInfo>\n\n#include \"util\/settings\/connection_client.h\"\n\nnamespace veles {\nnamespace util {\nnamespace settings {\nnamespace connection {\n\nbool default_run_server = true;\nQString localhost(\"127.0.0.1\");\nQString default_database_file(\"veles.vdb\");\nint default_server_port = 3135;\nQString default_default_profile(\"local server\");\nQString current_profile;\n\nvoid setDefaultProfile(QString profile) {\n  QSettings settings;\n  settings.setValue(\"default_profile\", profile);\n}\n\nQString currentProfile() {\n  if (current_profile.isEmpty()) {\n    QSettings settings;\n    current_profile = settings.value(\"default_profile\", default_default_profile).toString();\n  }\n  return current_profile;\n}\n\nvoid setCurrentProfile(QString profile) {\n  current_profile = profile;\n}\n\nvoid removeProfile(QString profile) {\n  QSettings settings;\n  QMap<QString, QVariant> profiles = settings.value(\"profiles\").toMap();\n  profiles.remove(profile);\n  if (profiles.size() == 0) {\n    settings.remove(\"profiles\");\n  } else {\n    settings.setValue(\"profiles\", profiles);\n  }\n  if (profile == currentProfile()) {\n    auto profiles = profileList();\n    if (profiles.empty()) {\n      setCurrentProfile(default_default_profile);\n    } else {\n      setCurrentProfile(profiles[0]);\n    }\n  }\n\n  if (profile == settings.value(\"default_profile\")) {\n    settings.remove(\"default_profile\");\n  }\n}\n\nQStringList profileList() {\n  QSettings settings;\n  QMap<QString, QVariant> default_profiles;\n  default_profiles[default_default_profile] = QSettings::SettingsMap();\n  QMap<QString, QVariant> profiles = settings.value(\"profiles\", default_profiles).toMap();\n  return profiles.keys();\n}\n\nQVariant profileSettings(QString key, QVariant defaultValue) {\n  QSettings settings;\n  QMap<QString, QVariant> profiles = settings.value(\"profiles\", QSettings::SettingsMap()).toMap();\n  QSettings::SettingsMap profile_settings = profiles.value(currentProfile(), QSettings::SettingsMap()).toMap();\n  return profile_settings.value(key, defaultValue);\n}\n\nvoid setProfileSettings(QString key, QVariant value) {\n  QSettings settings;\n  QMap<QString, QVariant> profiles = settings.value(\"profiles\").toMap();\n  QSettings::SettingsMap profile = profiles[currentProfile()].toMap();\n  profile[key] = value;\n  profiles[currentProfile()] = profile;\n  settings.setValue(\"profiles\", profiles);\n}\n\nQString uniqueProfileName(QString prefix) {\n  auto profile_list = profileList();\n  int next_id = 0;\n  QString suffix;\n  while (profile_list.contains(prefix + suffix)) {\n    suffix = \" (\" + QString::number(next_id++) + \")\";\n  }\n  return prefix + suffix;\n}\n\nbool runServerDefault() {\n  return default_run_server;\n}\n\nbool runServer() {\n  return profileSettings(\"conection.run_server\", runServerDefault()).toBool();\n}\n\nvoid setRunServer(bool run_server) {\n  setProfileSettings(\"conection.run_server\", run_server);\n}\n\nQString serverHostDefault() {\n  return localhost;\n}\n\nQString serverHost() {\n  return profileSettings(\"conection.server\", serverHostDefault()).toString();\n}\n\nvoid setServerHost(QString server_host) {\n  setProfileSettings(\"conection.server\", server_host);\n}\n\nint serverPortDefault() {\n  return default_server_port;\n}\n\nint serverPort() {\n  return profileSettings(\"conection.server_port\", serverPortDefault()).toInt();\n}\n\nvoid setServerPort(int server_port) {\n  setProfileSettings(\"conection.server_port\", server_port);\n}\n\nQString clientInterfaceDefault() {\n  return localhost;\n}\n\nQString clientInterface() {\n  return profileSettings(\"conection.client_interface\",\n      clientInterfaceDefault()).toString();\n}\n\nvoid setClientInterface(QString client_interface) {\n  setProfileSettings(\"conection.client_interface\", client_interface);\n}\n\nQString clientName() {\n  return profileSettings(\"conection.client_name\", clientNameDefault()).toString();\n}\n\nQString clientNameDefault() {\n  QString user_name;\n#if defined(Q_OS_LINUX) || defined(Q_OS_MAC)\n  user_name = qgetenv(\"USER\");\n#elif defined(Q_OS_WIN)\n  user_name = qgetenv(\"USERNAME\");\n#else\n    user_name = \"Veles UI\";\n#endif\n\n  if(user_name.length() == 0) {\n    user_name = \"Veles UI\";\n  }\n\n  return user_name;\n}\n\nvoid setClientName(QString client_name) {\n  setProfileSettings(\"conection.client_name\", client_name);\n}\n\nQString connectionKeyDefault() {\n  return QString(\"\");\n}\n\nQString connectionKey() {\n  return profileSettings(\"conection.key\", connectionKeyDefault()).toString();\n}\n\nvoid setConnectionKey(QString connection_key) {\n  QSettings settings;\n  setProfileSettings(\"conection.key\", connection_key);\n}\n\nQString databaseNameDefault() {\n  return QStandardPaths::writableLocation(QStandardPaths::AppLocalDataLocation) + \"\/\" + default_database_file;\n}\n\nQString databaseName() {\n  return profileSettings(\"conection.database\",\n      databaseNameDefault()).toString();\n}\n\nvoid setDatabaseName(QString database_name) {\n  setProfileSettings(\"conection.database\", database_name);\n}\n\nQString serverScriptDefault() {\n  QString server_script;\n#if defined(Q_OS_WIN)\n  server_script = qApp->applicationDirPath() + \"\/..\/veles-server\/srv.py\";\n#elif defined(Q_OS_LINUX)\n  server_script = qApp->applicationDirPath() + \"\/..\/share\/veles-server\/srv.py\";\n#else\n  server_script = qApp->applicationDirPath() + \"\/..\/Resources\/veles-server\/srv.py\";\n#endif\n  QFileInfo check_file(server_script);\n  if (!check_file.exists()) {\n    server_script = qApp->applicationDirPath() + \"\/python\/srv.py\";\n  }\n  return server_script;\n}\n\nQString serverScript() {\n  return profileSettings(\"connection.server_script\",\n      serverScriptDefault()).toString();\n}\n\nvoid setServerScript(QString server_script) {\n  setProfileSettings(\"connection.server_script\", server_script);\n}\n\n}  \/\/ namespace connection\n}  \/\/ namespace settings\n}  \/\/ namespace util\n}  \/\/ namespace veles\n<commit_msg>Display cleaned path to srv.py<commit_after>\/*\n * Copyright 2017 CodiLime\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 <QApplication>\n#include <QDir>\n#include <QSettings>\n#include <QStandardPaths>\n#include <QFileInfo>\n\n#include \"util\/settings\/connection_client.h\"\n\nnamespace veles {\nnamespace util {\nnamespace settings {\nnamespace connection {\n\nbool default_run_server = true;\nQString localhost(\"127.0.0.1\");\nQString default_database_file(\"veles.vdb\");\nint default_server_port = 3135;\nQString default_default_profile(\"local server\");\nQString current_profile;\n\nvoid setDefaultProfile(QString profile) {\n  QSettings settings;\n  settings.setValue(\"default_profile\", profile);\n}\n\nQString currentProfile() {\n  if (current_profile.isEmpty()) {\n    QSettings settings;\n    current_profile = settings.value(\"default_profile\", default_default_profile).toString();\n  }\n  return current_profile;\n}\n\nvoid setCurrentProfile(QString profile) {\n  current_profile = profile;\n}\n\nvoid removeProfile(QString profile) {\n  QSettings settings;\n  QMap<QString, QVariant> profiles = settings.value(\"profiles\").toMap();\n  profiles.remove(profile);\n  if (profiles.size() == 0) {\n    settings.remove(\"profiles\");\n  } else {\n    settings.setValue(\"profiles\", profiles);\n  }\n  if (profile == currentProfile()) {\n    auto profiles = profileList();\n    if (profiles.empty()) {\n      setCurrentProfile(default_default_profile);\n    } else {\n      setCurrentProfile(profiles[0]);\n    }\n  }\n\n  if (profile == settings.value(\"default_profile\")) {\n    settings.remove(\"default_profile\");\n  }\n}\n\nQStringList profileList() {\n  QSettings settings;\n  QMap<QString, QVariant> default_profiles;\n  default_profiles[default_default_profile] = QSettings::SettingsMap();\n  QMap<QString, QVariant> profiles = settings.value(\"profiles\", default_profiles).toMap();\n  return profiles.keys();\n}\n\nQVariant profileSettings(QString key, QVariant defaultValue) {\n  QSettings settings;\n  QMap<QString, QVariant> profiles = settings.value(\"profiles\", QSettings::SettingsMap()).toMap();\n  QSettings::SettingsMap profile_settings = profiles.value(currentProfile(), QSettings::SettingsMap()).toMap();\n  return profile_settings.value(key, defaultValue);\n}\n\nvoid setProfileSettings(QString key, QVariant value) {\n  QSettings settings;\n  QMap<QString, QVariant> profiles = settings.value(\"profiles\").toMap();\n  QSettings::SettingsMap profile = profiles[currentProfile()].toMap();\n  profile[key] = value;\n  profiles[currentProfile()] = profile;\n  settings.setValue(\"profiles\", profiles);\n}\n\nQString uniqueProfileName(QString prefix) {\n  auto profile_list = profileList();\n  int next_id = 0;\n  QString suffix;\n  while (profile_list.contains(prefix + suffix)) {\n    suffix = \" (\" + QString::number(next_id++) + \")\";\n  }\n  return prefix + suffix;\n}\n\nbool runServerDefault() {\n  return default_run_server;\n}\n\nbool runServer() {\n  return profileSettings(\"conection.run_server\", runServerDefault()).toBool();\n}\n\nvoid setRunServer(bool run_server) {\n  setProfileSettings(\"conection.run_server\", run_server);\n}\n\nQString serverHostDefault() {\n  return localhost;\n}\n\nQString serverHost() {\n  return profileSettings(\"conection.server\", serverHostDefault()).toString();\n}\n\nvoid setServerHost(QString server_host) {\n  setProfileSettings(\"conection.server\", server_host);\n}\n\nint serverPortDefault() {\n  return default_server_port;\n}\n\nint serverPort() {\n  return profileSettings(\"conection.server_port\", serverPortDefault()).toInt();\n}\n\nvoid setServerPort(int server_port) {\n  setProfileSettings(\"conection.server_port\", server_port);\n}\n\nQString clientInterfaceDefault() {\n  return localhost;\n}\n\nQString clientInterface() {\n  return profileSettings(\"conection.client_interface\",\n      clientInterfaceDefault()).toString();\n}\n\nvoid setClientInterface(QString client_interface) {\n  setProfileSettings(\"conection.client_interface\", client_interface);\n}\n\nQString clientName() {\n  return profileSettings(\"conection.client_name\", clientNameDefault()).toString();\n}\n\nQString clientNameDefault() {\n  QString user_name;\n#if defined(Q_OS_LINUX) || defined(Q_OS_MAC)\n  user_name = qgetenv(\"USER\");\n#elif defined(Q_OS_WIN)\n  user_name = qgetenv(\"USERNAME\");\n#else\n    user_name = \"Veles UI\";\n#endif\n\n  if(user_name.length() == 0) {\n    user_name = \"Veles UI\";\n  }\n\n  return user_name;\n}\n\nvoid setClientName(QString client_name) {\n  setProfileSettings(\"conection.client_name\", client_name);\n}\n\nQString connectionKeyDefault() {\n  return QString(\"\");\n}\n\nQString connectionKey() {\n  return profileSettings(\"conection.key\", connectionKeyDefault()).toString();\n}\n\nvoid setConnectionKey(QString connection_key) {\n  QSettings settings;\n  setProfileSettings(\"conection.key\", connection_key);\n}\n\nQString databaseNameDefault() {\n  return QStandardPaths::writableLocation(QStandardPaths::AppLocalDataLocation) + \"\/\" + default_database_file;\n}\n\nQString databaseName() {\n  return profileSettings(\"conection.database\",\n      databaseNameDefault()).toString();\n}\n\nvoid setDatabaseName(QString database_name) {\n  setProfileSettings(\"conection.database\", database_name);\n}\n\nQString serverScriptDefault() {\n  QString server_script;\n#if defined(Q_OS_WIN)\n  server_script = qApp->applicationDirPath() + \"\/..\/veles-server\/srv.py\";\n#elif defined(Q_OS_LINUX)\n  server_script = qApp->applicationDirPath() + \"\/..\/share\/veles-server\/srv.py\";\n#elif defined(Q_OS_MAC)\n  server_script = qApp->applicationDirPath() + \"\/..\/Resources\/veles-server\/srv.py\";\n#else\n  #error OS not supported\n#endif\n  QFileInfo check_file(server_script);\n  if (!check_file.exists()) {\n    server_script = qApp->applicationDirPath() + \"\/python\/srv.py\";\n  }\n  return QDir::cleanPath(server_script);\n}\n\nQString serverScript() {\n  return profileSettings(\"connection.server_script\",\n      serverScriptDefault()).toString();\n}\n\nvoid setServerScript(QString server_script) {\n  setProfileSettings(\"connection.server_script\", server_script);\n}\n\n}  \/\/ namespace connection\n}  \/\/ namespace settings\n}  \/\/ namespace util\n}  \/\/ namespace veles\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements.  See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF 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 * $Id$\n *\/\n\n#include <xercesc\/util\/XercesDefs.hpp>\n#include <xercesc\/dom\/DOMException.hpp>\n#include <xercesc\/dom\/DOMNode.hpp>\n\n#include \"DOMDocumentImpl.hpp\"\n#include \"DOMRangeImpl.hpp\"\n#include \"DOMNodeIteratorImpl.hpp\"\n#include \"DOMParentNode.hpp\"\n#include \"DOMCasts.hpp\"\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nDOMParentNode::DOMParentNode(DOMDocument *ownerDoc)\n    : fOwnerDocument(ownerDoc), fFirstChild(0), fChildNodeList(this)\n{    \n}\n\n\/\/ This only makes a shallow copy, cloneChildren must also be called for a\n\/\/ deep clone\nDOMParentNode::DOMParentNode(const DOMParentNode &other)  :\n    fChildNodeList(this)\n{\n    this->fOwnerDocument = other.fOwnerDocument;\n\n    \/\/ Need to break the association w\/ original kids\n    this->fFirstChild = 0;\n}\n\nvoid DOMParentNode::changed()\n{\n    DOMDocumentImpl *doc = (DOMDocumentImpl *)this->getOwnerDocument();\n    doc->changed();\n}\n\n\nint DOMParentNode::changes() const\n{\n    DOMDocumentImpl *doc = (DOMDocumentImpl *)this->getOwnerDocument();\n    return doc->changes();\n}\n\n\nDOMNode * DOMParentNode::appendChild(DOMNode *newChild)\n{\n    return insertBefore(newChild, 0);\n}\n\n\nvoid DOMParentNode::cloneChildren(const DOMNode *other) {\n  \/\/    for (DOMNode *mykid = other.getFirstChild();\n    for (DOMNode *mykid = other->getFirstChild();\n         mykid != 0;\n         mykid = mykid->getNextSibling())\n    {\n        appendChild(mykid->cloneNode(true));\n    }\n}\n\nDOMDocument * DOMParentNode::getOwnerDocument() const {\n    return fOwnerDocument;\n}\n\n\/\/ unlike getOwnerDocument this is not overriden by DocumentImpl to return 0\nDOMDocument * DOMParentNode::getDocument() const {\n    return fOwnerDocument;\n}\n\nvoid DOMParentNode::setOwnerDocument(DOMDocument* doc) {\n    fOwnerDocument = doc;\n}\n\nDOMNodeList *DOMParentNode::getChildNodes() const {\n    const DOMNodeList *ret = &fChildNodeList;\n    return (DOMNodeList *)ret;   \/\/ cast off const.\n}\n\n\nDOMNode * DOMParentNode::getFirstChild() const {\n    return fFirstChild;\n}\n\n\nDOMNode * DOMParentNode::getLastChild() const\n{\n    return lastChild();\n}\n\nDOMNode * DOMParentNode::lastChild() const\n{\n    \/\/ last child is stored as the previous sibling of first child\n    if (fFirstChild == 0) {\n        return 0;\n    }\n\n    DOMChildNode *firstChild = castToChildImpl(fFirstChild);\n    DOMNode *ret = firstChild->previousSibling;\n    return ret;\n}\n\n\n\/\/\n\/\/  revisit.  Is this function used anywhere?  I don't see it.\n\/\/\nvoid DOMParentNode::lastChild(DOMNode *node) {\n    \/\/ store lastChild as previous sibling of first child\n    if (fFirstChild != 0) {\n        DOMChildNode *firstChild = castToChildImpl(fFirstChild);\n        firstChild->previousSibling = node;\n    }\n}\n\n\nbool DOMParentNode::hasChildNodes() const\n{\n    return fFirstChild!=0;\n}\n\n\n\nDOMNode *DOMParentNode::insertBefore(DOMNode *newChild, DOMNode *refChild) {\n    \/\/not really in the specs, but better than nothing\n    if(newChild==NULL)\n        throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0, GetDOMParentNodeMemoryManager);\n\n    DOMNodeImpl *thisNodeImpl = castToNodeImpl(this);\n    if (thisNodeImpl->isReadOnly())\n        throw DOMException(DOMException::NO_MODIFICATION_ALLOWED_ERR, 0, GetDOMParentNodeMemoryManager);\n\n    if (newChild->getOwnerDocument() != fOwnerDocument)\n        throw DOMException(DOMException::WRONG_DOCUMENT_ERR, 0, GetDOMParentNodeMemoryManager);\n\n    \/\/ Prevent cycles in the tree\n    \/\/only need to do this if the node has children\n    if(newChild->hasChildNodes()) {\n        bool treeSafe=true;\n        for(DOMNode *a=castToNode(this)->getParentNode();\n            treeSafe && a!=0;\n            a=a->getParentNode())\n            treeSafe=(newChild!=a);\n        if(!treeSafe)\n            throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0, GetDOMParentNodeMemoryManager);\n    }\n\n    \/\/ refChild must in fact be a child of this node (or 0)\n    if (refChild!=0 && refChild->getParentNode() != castToNode(this))\n        throw DOMException(DOMException::NOT_FOUND_ERR,0, GetDOMParentNodeMemoryManager);\n\n    \/\/ if the new node has to be placed before itself, we don't have to do anything \n    \/\/ (even worse, we would crash if we continue, as we assume they are two distinct nodes)\n    if (refChild!=0 && newChild->isSameNode(refChild))\n        return newChild;\n\n    if (newChild->getNodeType() == DOMNode::DOCUMENT_FRAGMENT_NODE)\n    {\n        \/\/ SLOW BUT SAFE: We could insert the whole subtree without\n        \/\/ juggling so many next\/previous pointers. (Wipe out the\n        \/\/ parent's child-list, patch the parent pointers, set the\n        \/\/ ends of the list.) But we know some subclasses have special-\n        \/\/ case behavior they add to insertBefore(), so we don't risk it.\n        \/\/ This approch also takes fewer bytecodes.\n\n        \/\/ NOTE: If one of the children is not a legal child of this\n        \/\/ node, throw HIERARCHY_REQUEST_ERR before _any_ of the children\n        \/\/ have been transferred. (Alternative behaviors would be to\n        \/\/ reparent up to the first failure point or reparent all those\n        \/\/ which are acceptable to the target node, neither of which is\n        \/\/ as robust. PR-DOM-0818 isn't entirely clear on which it\n        \/\/ recommends?????\n\n        \/\/ No need to check kids for right-document; if they weren't,\n        \/\/ they wouldn't be kids of that DocFrag.\n        for(DOMNode *kid=newChild->getFirstChild(); \/\/ Prescan\n              kid!=0;\n              kid=kid->getNextSibling())\n        {\n            if (!DOMDocumentImpl::isKidOK(castToNode(this), kid))\n              throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0, GetDOMParentNodeMemoryManager);\n        }\n        while(newChild->hasChildNodes())     \/\/ Move\n            insertBefore(newChild->getFirstChild(),refChild);\n    }\n\n    else if (!DOMDocumentImpl::isKidOK(castToNode(this), newChild))\n        throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0, GetDOMParentNodeMemoryManager);\n\n    else\n    {\n        DOMNode *oldparent=newChild->getParentNode();\n        if(oldparent!=0)\n            oldparent->removeChild(newChild);\n\n        \/\/ Attach up\n        castToNodeImpl(newChild)->fOwnerNode = castToNode(this);\n        castToNodeImpl(newChild)->isOwned(true);\n\n        \/\/ Attach before and after\n        \/\/ Note: fFirstChild.previousSibling == lastChild!!\n        if (fFirstChild == 0) {\n            \/\/ this our first and only child\n            fFirstChild = newChild;\n            castToNodeImpl(newChild)->isFirstChild(true);\n            \/\/ castToChildImpl(newChild)->previousSibling = newChild;\n            DOMChildNode *newChild_ci = castToChildImpl(newChild);\n            newChild_ci->previousSibling = newChild;\n        } else {\n            if (refChild == 0) {\n                \/\/ this is an append\n                DOMNode *lastChild = castToChildImpl(fFirstChild)->previousSibling;\n                castToChildImpl(lastChild)->nextSibling = newChild;\n                castToChildImpl(newChild)->previousSibling = lastChild;\n                castToChildImpl(fFirstChild)->previousSibling = newChild;\n            } else {\n                \/\/ this is an insert\n                if (refChild == fFirstChild) {\n                    \/\/ at the head of the list\n                    castToNodeImpl(fFirstChild)->isFirstChild(false);\n                    castToChildImpl(newChild)->nextSibling = fFirstChild;\n                    castToChildImpl(newChild)->previousSibling = castToChildImpl(fFirstChild)->previousSibling;\n                    castToChildImpl(fFirstChild)->previousSibling = newChild;\n                    fFirstChild = newChild;\n                    castToNodeImpl(newChild)->isFirstChild(true);\n                } else {\n                    \/\/ somewhere in the middle\n                    DOMNode *prev = castToChildImpl(refChild)->previousSibling;\n                    castToChildImpl(newChild)->nextSibling = refChild;\n                    castToChildImpl(prev)->nextSibling = newChild;\n                    castToChildImpl(refChild)->previousSibling = newChild;\n                    castToChildImpl(newChild)->previousSibling = prev;\n                }\n            }\n        }\n    }\n\n    changed();\n\n    if (this->getOwnerDocument() != 0) {\n        Ranges* ranges = ((DOMDocumentImpl *)this->getOwnerDocument())->getRanges();\n        if ( ranges != 0) {\n            unsigned int sz = ranges->size();\n            if (sz != 0) {\n                for (unsigned int i =0; i<sz; i++) {\n                    ranges->elementAt(i)->updateRangeForInsertedNode(newChild);\n                }\n            }\n        }\n    }\n\n    return newChild;\n}\n\n\n\nDOMNode *DOMParentNode::removeChild(DOMNode *oldChild)\n{\n    if (castToNodeImpl(this)->isReadOnly())\n        throw DOMException(\n        DOMException::NO_MODIFICATION_ALLOWED_ERR, 0, GetDOMParentNodeMemoryManager);\n\n    if (oldChild == 0 || oldChild->getParentNode() != castToNode(this))\n        throw DOMException(DOMException::NOT_FOUND_ERR, 0, GetDOMParentNodeMemoryManager);\n\n    if (this->getOwnerDocument() !=  0  ) {\n        \/\/notify iterators\n        NodeIterators* nodeIterators = ((DOMDocumentImpl *)this->getOwnerDocument())->getNodeIterators();\n        if (nodeIterators != 0) {\n            unsigned int sz = nodeIterators->size();\n            if (sz != 0) {\n                for (unsigned int i =0; i<sz; i++) {\n                    if (nodeIterators->elementAt(i) != 0)\n                        nodeIterators->elementAt(i)->removeNode(oldChild);\n                }\n            }\n        }\n\n        \/\/fix other ranges for change before deleting the node\n        Ranges* ranges = ((DOMDocumentImpl *)this->getOwnerDocument())->getRanges();\n        if (ranges != 0) {\n            unsigned int sz = ranges->size();\n            if (sz != 0) {\n                for (unsigned int i =0; i<sz; i++) {\n                    if (ranges->elementAt(i) != 0)\n                        ranges->elementAt(i)->updateRangeForDeletedNode(oldChild);\n                }\n            }\n        }\n    }\n\n\n    \/\/ Patch linked list around oldChild\n    \/\/ Note: lastChild == fFirstChild->previousSibling\n    if (oldChild == fFirstChild) {\n        \/\/ removing first child\n        castToNodeImpl(oldChild)->isFirstChild(false);\n        fFirstChild = castToChildImpl(oldChild)->nextSibling;\n        if (fFirstChild != 0) {\n            castToNodeImpl(fFirstChild)->isFirstChild(true);\n            castToChildImpl(fFirstChild)->previousSibling = castToChildImpl(oldChild)->previousSibling;\n        }\n    } else {\n        DOMNode *prev = castToChildImpl(oldChild)->previousSibling;\n        DOMNode *next = castToChildImpl(oldChild)->nextSibling;\n        castToChildImpl(prev)->nextSibling = next;\n        if (next == 0) {\n            \/\/ removing last child\n            castToChildImpl(fFirstChild)->previousSibling = prev;\n        } else {\n            \/\/ removing some other child in the middle\n            castToChildImpl(next)->previousSibling = prev;\n        }\n    }\n\n    \/\/ Remove oldChild's references to tree\n    castToNodeImpl(oldChild)->fOwnerNode = fOwnerDocument;\n    castToNodeImpl(oldChild)->isOwned(false);\n    castToChildImpl(oldChild)->nextSibling = 0;\n    castToChildImpl(oldChild)->previousSibling = 0;\n\n    changed();\n\n    return oldChild;\n}\n\n\nDOMNode *DOMParentNode::replaceChild(DOMNode *newChild, DOMNode *oldChild)\n{\n    insertBefore(newChild, oldChild);\n    \/\/ changed() already done.\n    return removeChild(oldChild);\n}\n\n\nDOMNode * DOMParentNode::appendChildFast(DOMNode *newChild)\n{\n    \/\/ This function makes the following assumptions:\n    \/\/\n    \/\/ - newChild != 0\n    \/\/ - newChild is not read-only\n    \/\/ - newChild is not a document fragment\n    \/\/ - owner documents of this node and newChild are the same\n    \/\/ - appending newChild to this node cannot result in a cycle\n    \/\/ - DOMDocumentImpl::isKidOK (this, newChild) return true (that is,\n    \/\/   appending newChild to this node results in a valid structure)\n    \/\/ - newChild->getParentNode() is 0\n    \/\/ - there are no ranges set for this document\n    \/\/\n\n    \/\/ Attach up\n    castToNodeImpl(newChild)->fOwnerNode = castToNode(this);\n    castToNodeImpl(newChild)->isOwned(true);\n\n    \/\/ Attach before and after\n    \/\/ Note: fFirstChild.previousSibling == lastChild!!\n    if (fFirstChild != 0)\n    {\n        DOMNode *lastChild = castToChildImpl(fFirstChild)->previousSibling;\n        castToChildImpl(lastChild)->nextSibling = newChild;\n        castToChildImpl(newChild)->previousSibling = lastChild;\n        castToChildImpl(fFirstChild)->previousSibling = newChild;\n    }\n    else\n    {\n        \/\/ this our first and only child\n        fFirstChild = newChild;\n        castToNodeImpl(newChild)->isFirstChild(true);\n        \/\/ castToChildImpl(newChild)->previousSibling = newChild;\n        DOMChildNode *newChild_ci = castToChildImpl(newChild);\n        newChild_ci->previousSibling = newChild;\n    }\n\n    changed();\n\n    return newChild;\n}\n\n\n\/\/Introduced in DOM Level 2\n\nvoid DOMParentNode::normalize()\n{\n    DOMNode *kid, *next;\n    for (kid = fFirstChild; kid != 0; kid = next)\n    {\n        next = castToChildImpl(kid)->nextSibling;\n\n        \/\/ If kid and next are both Text nodes (but _not_ CDATASection,\n        \/\/ which is a subclass of Text), they can be merged.\n        if (next != 0 &&\n            kid->getNodeType() == DOMNode::TEXT_NODE   &&\n            next->getNodeType() == DOMNode::TEXT_NODE )\n        {\n            ((DOMTextImpl *) kid)->appendData(((DOMTextImpl *) next)->getData());\n            \/\/ revisit:\n            \/\/   should I release the removed node?\n            \/\/   not released in case user still referencing it externally\n            removeChild(next);\n            next = kid; \/\/ Don't advance; there might be another.\n        }\n\n        \/\/ Otherwise it might be an Element, which is handled recursively\n        else\n            if (kid->getNodeType() == DOMNode::ELEMENT_NODE)\n                kid->normalize();\n    }\n\n    \/\/ changed() will have occurred when the removeChild() was done,\n    \/\/ so does not have to be reissued.\n}\n\n\/\/Introduced in DOM Level 3\n\nbool DOMParentNode::isEqualNode(const DOMNode* arg) const\n{\n    if (arg && castToNodeImpl(this)->isSameNode(arg))\n        return true;\n\n    if (arg && castToNodeImpl(this)->isEqualNode(arg))\n    {\n        DOMNode *kid, *argKid;\n        for (kid = fFirstChild, argKid = arg->getFirstChild();\n             kid != 0 && argKid != 0;\n             kid = kid->getNextSibling(), argKid = argKid->getNextSibling())\n        {\n            if (!kid->isEqualNode(argKid))\n                return false;\n        }\n        return (kid || argKid) ? false : true;\n    }\n    return false;\n}\n\n\n\/\/Non-standard extension\nvoid DOMParentNode::release()\n{\n    DOMNode *kid, *next;\n    for (kid = fFirstChild; kid != 0; kid = next)\n    {\n        next = castToChildImpl(kid)->nextSibling;\n\n        \/\/ set is Owned false before releasing its child\n        castToNodeImpl(kid)->isToBeReleased(true);\n        kid->release();\n    }\n}\n\n\nXERCES_CPP_NAMESPACE_END\n\n<commit_msg>When importing a DOMDocumentFragment, be sure to call the insertBefore function using the virtaul table, or derived classes will not be notified of each added node (i.e. DOMDocument will not store the pointer to the root element)<commit_after>\/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements.  See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF 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 * $Id$\n *\/\n\n#include <xercesc\/util\/XercesDefs.hpp>\n#include <xercesc\/dom\/DOMException.hpp>\n#include <xercesc\/dom\/DOMNode.hpp>\n\n#include \"DOMDocumentImpl.hpp\"\n#include \"DOMRangeImpl.hpp\"\n#include \"DOMNodeIteratorImpl.hpp\"\n#include \"DOMParentNode.hpp\"\n#include \"DOMCasts.hpp\"\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nDOMParentNode::DOMParentNode(DOMDocument *ownerDoc)\n    : fOwnerDocument(ownerDoc), fFirstChild(0), fChildNodeList(this)\n{    \n}\n\n\/\/ This only makes a shallow copy, cloneChildren must also be called for a\n\/\/ deep clone\nDOMParentNode::DOMParentNode(const DOMParentNode &other)  :\n    fChildNodeList(this)\n{\n    this->fOwnerDocument = other.fOwnerDocument;\n\n    \/\/ Need to break the association w\/ original kids\n    this->fFirstChild = 0;\n}\n\nvoid DOMParentNode::changed()\n{\n    DOMDocumentImpl *doc = (DOMDocumentImpl *)this->getOwnerDocument();\n    doc->changed();\n}\n\n\nint DOMParentNode::changes() const\n{\n    DOMDocumentImpl *doc = (DOMDocumentImpl *)this->getOwnerDocument();\n    return doc->changes();\n}\n\n\nDOMNode * DOMParentNode::appendChild(DOMNode *newChild)\n{\n    return insertBefore(newChild, 0);\n}\n\n\nvoid DOMParentNode::cloneChildren(const DOMNode *other) {\n  \/\/    for (DOMNode *mykid = other.getFirstChild();\n    for (DOMNode *mykid = other->getFirstChild();\n         mykid != 0;\n         mykid = mykid->getNextSibling())\n    {\n        appendChild(mykid->cloneNode(true));\n    }\n}\n\nDOMDocument * DOMParentNode::getOwnerDocument() const {\n    return fOwnerDocument;\n}\n\n\/\/ unlike getOwnerDocument this is not overriden by DocumentImpl to return 0\nDOMDocument * DOMParentNode::getDocument() const {\n    return fOwnerDocument;\n}\n\nvoid DOMParentNode::setOwnerDocument(DOMDocument* doc) {\n    fOwnerDocument = doc;\n}\n\nDOMNodeList *DOMParentNode::getChildNodes() const {\n    const DOMNodeList *ret = &fChildNodeList;\n    return (DOMNodeList *)ret;   \/\/ cast off const.\n}\n\n\nDOMNode * DOMParentNode::getFirstChild() const {\n    return fFirstChild;\n}\n\n\nDOMNode * DOMParentNode::getLastChild() const\n{\n    return lastChild();\n}\n\nDOMNode * DOMParentNode::lastChild() const\n{\n    \/\/ last child is stored as the previous sibling of first child\n    if (fFirstChild == 0) {\n        return 0;\n    }\n\n    DOMChildNode *firstChild = castToChildImpl(fFirstChild);\n    DOMNode *ret = firstChild->previousSibling;\n    return ret;\n}\n\n\n\/\/\n\/\/  revisit.  Is this function used anywhere?  I don't see it.\n\/\/\nvoid DOMParentNode::lastChild(DOMNode *node) {\n    \/\/ store lastChild as previous sibling of first child\n    if (fFirstChild != 0) {\n        DOMChildNode *firstChild = castToChildImpl(fFirstChild);\n        firstChild->previousSibling = node;\n    }\n}\n\n\nbool DOMParentNode::hasChildNodes() const\n{\n    return fFirstChild!=0;\n}\n\n\n\nDOMNode *DOMParentNode::insertBefore(DOMNode *newChild, DOMNode *refChild) {\n    \/\/not really in the specs, but better than nothing\n    if(newChild==NULL)\n        throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0, GetDOMParentNodeMemoryManager);\n\n    DOMNodeImpl *thisNodeImpl = castToNodeImpl(this);\n    if (thisNodeImpl->isReadOnly())\n        throw DOMException(DOMException::NO_MODIFICATION_ALLOWED_ERR, 0, GetDOMParentNodeMemoryManager);\n\n    if (newChild->getOwnerDocument() != fOwnerDocument)\n        throw DOMException(DOMException::WRONG_DOCUMENT_ERR, 0, GetDOMParentNodeMemoryManager);\n\n    \/\/ Prevent cycles in the tree\n    \/\/only need to do this if the node has children\n    if(newChild->hasChildNodes()) {\n        bool treeSafe=true;\n        for(DOMNode *a=castToNode(this)->getParentNode();\n            treeSafe && a!=0;\n            a=a->getParentNode())\n            treeSafe=(newChild!=a);\n        if(!treeSafe)\n            throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0, GetDOMParentNodeMemoryManager);\n    }\n\n    \/\/ refChild must in fact be a child of this node (or 0)\n    if (refChild!=0 && refChild->getParentNode() != castToNode(this))\n        throw DOMException(DOMException::NOT_FOUND_ERR,0, GetDOMParentNodeMemoryManager);\n\n    \/\/ if the new node has to be placed before itself, we don't have to do anything \n    \/\/ (even worse, we would crash if we continue, as we assume they are two distinct nodes)\n    if (refChild!=0 && newChild->isSameNode(refChild))\n        return newChild;\n\n    if (newChild->getNodeType() == DOMNode::DOCUMENT_FRAGMENT_NODE)\n    {\n        \/\/ SLOW BUT SAFE: We could insert the whole subtree without\n        \/\/ juggling so many next\/previous pointers. (Wipe out the\n        \/\/ parent's child-list, patch the parent pointers, set the\n        \/\/ ends of the list.) But we know some subclasses have special-\n        \/\/ case behavior they add to insertBefore(), so we don't risk it.\n        \/\/ This approch also takes fewer bytecodes.\n\n        \/\/ NOTE: If one of the children is not a legal child of this\n        \/\/ node, throw HIERARCHY_REQUEST_ERR before _any_ of the children\n        \/\/ have been transferred. (Alternative behaviors would be to\n        \/\/ reparent up to the first failure point or reparent all those\n        \/\/ which are acceptable to the target node, neither of which is\n        \/\/ as robust. PR-DOM-0818 isn't entirely clear on which it\n        \/\/ recommends?????\n\n        \/\/ No need to check kids for right-document; if they weren't,\n        \/\/ they wouldn't be kids of that DocFrag.\n        for(DOMNode *kid=newChild->getFirstChild(); \/\/ Prescan\n              kid!=0;\n              kid=kid->getNextSibling())\n        {\n            if (!DOMDocumentImpl::isKidOK(castToNode(this), kid))\n              throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0, GetDOMParentNodeMemoryManager);\n        }\n        while(newChild->hasChildNodes())     \/\/ Move\n            castToNode(this)->insertBefore(newChild->getFirstChild(),refChild);\n    }\n\n    else if (!DOMDocumentImpl::isKidOK(castToNode(this), newChild))\n        throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0, GetDOMParentNodeMemoryManager);\n\n    else\n    {\n        DOMNode *oldparent=newChild->getParentNode();\n        if(oldparent!=0)\n            oldparent->removeChild(newChild);\n\n        \/\/ Attach up\n        castToNodeImpl(newChild)->fOwnerNode = castToNode(this);\n        castToNodeImpl(newChild)->isOwned(true);\n\n        \/\/ Attach before and after\n        \/\/ Note: fFirstChild.previousSibling == lastChild!!\n        if (fFirstChild == 0) {\n            \/\/ this our first and only child\n            fFirstChild = newChild;\n            castToNodeImpl(newChild)->isFirstChild(true);\n            \/\/ castToChildImpl(newChild)->previousSibling = newChild;\n            DOMChildNode *newChild_ci = castToChildImpl(newChild);\n            newChild_ci->previousSibling = newChild;\n        } else {\n            if (refChild == 0) {\n                \/\/ this is an append\n                DOMNode *lastChild = castToChildImpl(fFirstChild)->previousSibling;\n                castToChildImpl(lastChild)->nextSibling = newChild;\n                castToChildImpl(newChild)->previousSibling = lastChild;\n                castToChildImpl(fFirstChild)->previousSibling = newChild;\n            } else {\n                \/\/ this is an insert\n                if (refChild == fFirstChild) {\n                    \/\/ at the head of the list\n                    castToNodeImpl(fFirstChild)->isFirstChild(false);\n                    castToChildImpl(newChild)->nextSibling = fFirstChild;\n                    castToChildImpl(newChild)->previousSibling = castToChildImpl(fFirstChild)->previousSibling;\n                    castToChildImpl(fFirstChild)->previousSibling = newChild;\n                    fFirstChild = newChild;\n                    castToNodeImpl(newChild)->isFirstChild(true);\n                } else {\n                    \/\/ somewhere in the middle\n                    DOMNode *prev = castToChildImpl(refChild)->previousSibling;\n                    castToChildImpl(newChild)->nextSibling = refChild;\n                    castToChildImpl(prev)->nextSibling = newChild;\n                    castToChildImpl(refChild)->previousSibling = newChild;\n                    castToChildImpl(newChild)->previousSibling = prev;\n                }\n            }\n        }\n    }\n\n    changed();\n\n    if (this->getOwnerDocument() != 0) {\n        Ranges* ranges = ((DOMDocumentImpl *)this->getOwnerDocument())->getRanges();\n        if ( ranges != 0) {\n            unsigned int sz = ranges->size();\n            if (sz != 0) {\n                for (unsigned int i =0; i<sz; i++) {\n                    ranges->elementAt(i)->updateRangeForInsertedNode(newChild);\n                }\n            }\n        }\n    }\n\n    return newChild;\n}\n\n\n\nDOMNode *DOMParentNode::removeChild(DOMNode *oldChild)\n{\n    if (castToNodeImpl(this)->isReadOnly())\n        throw DOMException(\n        DOMException::NO_MODIFICATION_ALLOWED_ERR, 0, GetDOMParentNodeMemoryManager);\n\n    if (oldChild == 0 || oldChild->getParentNode() != castToNode(this))\n        throw DOMException(DOMException::NOT_FOUND_ERR, 0, GetDOMParentNodeMemoryManager);\n\n    if (this->getOwnerDocument() !=  0  ) {\n        \/\/notify iterators\n        NodeIterators* nodeIterators = ((DOMDocumentImpl *)this->getOwnerDocument())->getNodeIterators();\n        if (nodeIterators != 0) {\n            unsigned int sz = nodeIterators->size();\n            if (sz != 0) {\n                for (unsigned int i =0; i<sz; i++) {\n                    if (nodeIterators->elementAt(i) != 0)\n                        nodeIterators->elementAt(i)->removeNode(oldChild);\n                }\n            }\n        }\n\n        \/\/fix other ranges for change before deleting the node\n        Ranges* ranges = ((DOMDocumentImpl *)this->getOwnerDocument())->getRanges();\n        if (ranges != 0) {\n            unsigned int sz = ranges->size();\n            if (sz != 0) {\n                for (unsigned int i =0; i<sz; i++) {\n                    if (ranges->elementAt(i) != 0)\n                        ranges->elementAt(i)->updateRangeForDeletedNode(oldChild);\n                }\n            }\n        }\n    }\n\n\n    \/\/ Patch linked list around oldChild\n    \/\/ Note: lastChild == fFirstChild->previousSibling\n    if (oldChild == fFirstChild) {\n        \/\/ removing first child\n        castToNodeImpl(oldChild)->isFirstChild(false);\n        fFirstChild = castToChildImpl(oldChild)->nextSibling;\n        if (fFirstChild != 0) {\n            castToNodeImpl(fFirstChild)->isFirstChild(true);\n            castToChildImpl(fFirstChild)->previousSibling = castToChildImpl(oldChild)->previousSibling;\n        }\n    } else {\n        DOMNode *prev = castToChildImpl(oldChild)->previousSibling;\n        DOMNode *next = castToChildImpl(oldChild)->nextSibling;\n        castToChildImpl(prev)->nextSibling = next;\n        if (next == 0) {\n            \/\/ removing last child\n            castToChildImpl(fFirstChild)->previousSibling = prev;\n        } else {\n            \/\/ removing some other child in the middle\n            castToChildImpl(next)->previousSibling = prev;\n        }\n    }\n\n    \/\/ Remove oldChild's references to tree\n    castToNodeImpl(oldChild)->fOwnerNode = fOwnerDocument;\n    castToNodeImpl(oldChild)->isOwned(false);\n    castToChildImpl(oldChild)->nextSibling = 0;\n    castToChildImpl(oldChild)->previousSibling = 0;\n\n    changed();\n\n    return oldChild;\n}\n\n\nDOMNode *DOMParentNode::replaceChild(DOMNode *newChild, DOMNode *oldChild)\n{\n    insertBefore(newChild, oldChild);\n    \/\/ changed() already done.\n    return removeChild(oldChild);\n}\n\n\nDOMNode * DOMParentNode::appendChildFast(DOMNode *newChild)\n{\n    \/\/ This function makes the following assumptions:\n    \/\/\n    \/\/ - newChild != 0\n    \/\/ - newChild is not read-only\n    \/\/ - newChild is not a document fragment\n    \/\/ - owner documents of this node and newChild are the same\n    \/\/ - appending newChild to this node cannot result in a cycle\n    \/\/ - DOMDocumentImpl::isKidOK (this, newChild) return true (that is,\n    \/\/   appending newChild to this node results in a valid structure)\n    \/\/ - newChild->getParentNode() is 0\n    \/\/ - there are no ranges set for this document\n    \/\/\n\n    \/\/ Attach up\n    castToNodeImpl(newChild)->fOwnerNode = castToNode(this);\n    castToNodeImpl(newChild)->isOwned(true);\n\n    \/\/ Attach before and after\n    \/\/ Note: fFirstChild.previousSibling == lastChild!!\n    if (fFirstChild != 0)\n    {\n        DOMNode *lastChild = castToChildImpl(fFirstChild)->previousSibling;\n        castToChildImpl(lastChild)->nextSibling = newChild;\n        castToChildImpl(newChild)->previousSibling = lastChild;\n        castToChildImpl(fFirstChild)->previousSibling = newChild;\n    }\n    else\n    {\n        \/\/ this our first and only child\n        fFirstChild = newChild;\n        castToNodeImpl(newChild)->isFirstChild(true);\n        \/\/ castToChildImpl(newChild)->previousSibling = newChild;\n        DOMChildNode *newChild_ci = castToChildImpl(newChild);\n        newChild_ci->previousSibling = newChild;\n    }\n\n    changed();\n\n    return newChild;\n}\n\n\n\/\/Introduced in DOM Level 2\n\nvoid DOMParentNode::normalize()\n{\n    DOMNode *kid, *next;\n    for (kid = fFirstChild; kid != 0; kid = next)\n    {\n        next = castToChildImpl(kid)->nextSibling;\n\n        \/\/ If kid and next are both Text nodes (but _not_ CDATASection,\n        \/\/ which is a subclass of Text), they can be merged.\n        if (next != 0 &&\n            kid->getNodeType() == DOMNode::TEXT_NODE   &&\n            next->getNodeType() == DOMNode::TEXT_NODE )\n        {\n            ((DOMTextImpl *) kid)->appendData(((DOMTextImpl *) next)->getData());\n            \/\/ revisit:\n            \/\/   should I release the removed node?\n            \/\/   not released in case user still referencing it externally\n            removeChild(next);\n            next = kid; \/\/ Don't advance; there might be another.\n        }\n\n        \/\/ Otherwise it might be an Element, which is handled recursively\n        else\n            if (kid->getNodeType() == DOMNode::ELEMENT_NODE)\n                kid->normalize();\n    }\n\n    \/\/ changed() will have occurred when the removeChild() was done,\n    \/\/ so does not have to be reissued.\n}\n\n\/\/Introduced in DOM Level 3\n\nbool DOMParentNode::isEqualNode(const DOMNode* arg) const\n{\n    if (arg && castToNodeImpl(this)->isSameNode(arg))\n        return true;\n\n    if (arg && castToNodeImpl(this)->isEqualNode(arg))\n    {\n        DOMNode *kid, *argKid;\n        for (kid = fFirstChild, argKid = arg->getFirstChild();\n             kid != 0 && argKid != 0;\n             kid = kid->getNextSibling(), argKid = argKid->getNextSibling())\n        {\n            if (!kid->isEqualNode(argKid))\n                return false;\n        }\n        return (kid || argKid) ? false : true;\n    }\n    return false;\n}\n\n\n\/\/Non-standard extension\nvoid DOMParentNode::release()\n{\n    DOMNode *kid, *next;\n    for (kid = fFirstChild; kid != 0; kid = next)\n    {\n        next = castToChildImpl(kid)->nextSibling;\n\n        \/\/ set is Owned false before releasing its child\n        castToNodeImpl(kid)->isToBeReleased(true);\n        kid->release();\n    }\n}\n\n\nXERCES_CPP_NAMESPACE_END\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  libavg - Media Playback Engine. \n\/\/  Copyright (C) 2003-2014 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 \"WrapHelper.h\"\n\n#include \"..\/player\/BoostPython.h\"\n#include \"..\/player\/BitmapManager.h\"\n\n#include \"..\/graphics\/Bitmap.h\"\n#include \"..\/graphics\/BitmapLoader.h\"\n#include \"..\/graphics\/FilterResizeBilinear.h\"\n\n#include \"..\/base\/CubicSpline.h\"\n#include \"..\/base\/GeomHelper.h\"\n\n#include \"..\/glm\/gtx\/vector_angle.hpp\"\n\n#include <vector>\n#include <sstream>\n\nusing namespace boost::python;\nusing namespace std;\nusing namespace avg;\n\nnamespace bp = boost::python;\n\ntemplate<class POINT>\nclass_<POINT> export_point(const string& sName)\n{\n    return class_<POINT>(sName.c_str(), no_init)\n        .def(\"__len__\", &Vec2Helper::len)\n        .def(\"__getitem__\", &Vec2Helper::getItem)\n        .def(\"__str__\", &Vec2Helper::str)\n        .def(\"__repr__\", &Vec2Helper::repr)\n        .def(\"__hash__\", &Vec2Helper::getHash)\n        .def(\"getNormalized\", &Vec2Helper::safeGetNormalized)\n        .def(\"getNorm\", &Vec2Helper::getNorm)\n        .def(\"getRotated\", &getRotated)\n        .def(\"getRotated\", &getRotatedPivot)\n        .def(self == self)\n        .def(self != self)\n        .def(-self)\n        .def(self + self)\n        .def(self - self)\n        .def(float() * self)\n        .def(self * float())\n        .def(self \/ float())\n        .def(\"isInPolygon\", &pointInPolygon)\n        .def(\"getAngle\", &getAngle)\n        .def(\"fromPolar\", &fromPolar)\n        .staticmethod(\"fromPolar\")\n        .def(\"angle\", &Vec2Helper::vecAngle)\n        .staticmethod(\"angle\")\n    ;\n}\n\nstruct Pixel32_to_python_tuple\n{\n    static PyObject* convert (avg::Pixel32 px)\n    {\n        return bp::incref(bp::make_tuple(\n                px.getR(), px.getG(), px.getB(), px.getA()).ptr());\n    }\n};\n\nstatic bp::object Bitmap_getPixels(Bitmap& bitmap, bool bCopyData=true)\n{\n    const unsigned char* pBuffer = bitmap.getPixels();\n    int buffSize = bitmap.getMemNeeded();\n    if (bCopyData) {\n        return bp::object(string((const char*)pBuffer, buffSize));\n    } else {\n#if PY_MAJOR_VERSION < 3\n        PyObject* pyBuffer = PyBuffer_FromReadWriteMemory(\n                const_cast<unsigned char*>(pBuffer), buffSize);\n        PyObject* py_memView = PyMemoryView_FromObject(pyBuffer);\n#else\n        PyObject* py_memView = PyMemoryView_FromMemory(\n                const_cast<char*>(reinterpret_cast<const char*>(pBuffer)),\n                buffSize, PyBUF_READ);\n#endif\n        return bp::object(handle<>(py_memView));\n    }\n}\n\nBOOST_PYTHON_FUNCTION_OVERLOADS(Bitmap_getPixels_overloads, Bitmap_getPixels, \n        1, 2);\n\n\nstatic void Bitmap_setPixels(Bitmap& bitmap, PyObject* exporter)\n{\n    Py_buffer bufferView;\n    if (PyObject_CheckBuffer(exporter)) {\n        PyObject_GetBuffer(exporter, &bufferView, PyBUF_READ);\n    } else {\n        throw Exception(AVG_ERR_INVALID_ARGS,\n               \"Second parameter to Bitmap.setPixels must support the buffer interface.\");\n    }\n    const unsigned char* cxx_buf = reinterpret_cast<unsigned char*>(bufferView.buf);\n    bitmap.setPixels(cxx_buf);\n    PyBuffer_Release(&bufferView);\n}\n\nConstVec2 Bitmap_getSize(Bitmap* This)\n{\n    return (glm::vec2)(This->getSize());\n}\n\nBitmapPtr Bitmap_getResized(BitmapPtr This, const glm::vec2& size)\n{\n    return FilterResizeBilinear(IntPoint(size)).apply(This);\n}\n\nglm::vec2* createPoint()\n{\n    return new glm::vec2(0,0);\n}\n\nBitmapPtr createBitmapFromFile(const UTF8String& sFName)\n{\n    return loadBitmap(sFName);\n}\n\nBitmapPtr createBitmapWithRect(BitmapPtr pBmp,\n        const glm::vec2& tlPos, const glm::vec2& brPos)\n{\n    if (tlPos.x >= brPos.x || tlPos.y >= brPos.y) {\n        throw Exception(AVG_ERR_OUT_OF_RANGE, \n                \"Can't create a bitmap with zero or negative width\/height.\");\n    }\n    IntPoint size = pBmp->getSize();\n    if (tlPos.x < 0 || tlPos.y < 0 || brPos.x > size.x || brPos.y > size.y) {\n        throw Exception(AVG_ERR_OUT_OF_RANGE, \n                \"Attempt to create a subbitmap that doesn't fit into the parent bitmap.\");\n    }\n    IntRect rect = IntRect(IntPoint(tlPos), IntPoint(brPos));\n    return BitmapPtr(new Bitmap(*pBmp, rect));\n}\n\nBOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(loadBitmap_overloads, BitmapManager::loadBitmapPy, \n        2, 3);\n\nvoid export_bitmap()\n{\n    export_point<glm::vec2>(\"Point2D\")\n        .def(\"__init__\", make_constructor(createPoint))\n        .def(init<float, float>())\n        .def(init<const glm::vec2&>())\n        .def(\"__setitem__\", &Vec2Helper::setItem)\n        .add_property(\"x\", &Vec2Helper::getX, &Vec2Helper::setX,\"\")\n        .add_property(\"y\", &Vec2Helper::getY, &Vec2Helper::setY,\"\")\n    ;\n\n    export_point<ConstVec2>(\"ConstPoint2D\")\n        .add_property(\"x\", &Vec2Helper::getX, \"\")\n        .add_property(\"y\", &Vec2Helper::getY, \"\")\n    ;\n\n    implicitly_convertible<ConstVec2, glm::vec2>();\n    implicitly_convertible<glm::vec2, ConstVec2>();\n\n    enum_<PixelFormat>(\"pixelformat\")\n        .value(\"B5G6R5\", B5G6R5)\n        .value(\"B8G8R8\", B8G8R8)\n        .value(\"B8G8R8A8\", B8G8R8A8)\n        .value(\"B8G8R8X8\", B8G8R8X8)\n        .value(\"A8B8G8R8\", A8B8G8R8)\n        .value(\"X8B8G8R8\", X8B8G8R8)\n        .value(\"R5G6B5\", R5G6B5)\n        .value(\"R8G8B8\", R8G8B8)\n        .value(\"R8G8B8A8\", R8G8B8A8)\n        .value(\"R8G8B8X8\", R8G8B8X8)\n        .value(\"A8R8G8B8\", A8R8G8B8)\n        .value(\"X8R8G8B8\", X8R8G8B8)\n        .value(\"I8\", I8)\n        .value(\"I16\", I16)\n        .value(\"A8\", A8)\n        .value(\"YCbCr411\", YCbCr411)\n        .value(\"YCbCr422\", YCbCr422)\n        .value(\"YUYV422\", YUYV422)\n        .value(\"YCbCr420p\", YCbCr420p)\n        .value(\"YCbCrJ420p\", YCbCrJ420p)\n        .value(\"YCbCrA420p\", YCbCrA420p)\n        .value(\"BAYER8\", BAYER8)\n        .value(\"BAYER8_RGGB\", BAYER8_RGGB)\n        .value(\"BAYER8_GBRG\", BAYER8_GBRG)\n        .value(\"BAYER8_GRBG\", BAYER8_GRBG)\n        .value(\"BAYER8_BGGR\", BAYER8_BGGR)\n        .value(\"R32G32B32A32F\", R32G32B32A32F)\n        .value(\"I32F\", I32F)\n        .export_values();\n\n    def(\"getSupportedPixelFormats\", &getSupportedPixelFormats);\n\n    to_python_converter<Pixel32, Pixel32_to_python_tuple>();\n\n    class_<Bitmap, boost::shared_ptr<Bitmap> >(\"Bitmap\", no_init)\n        .def(init<glm::vec2, PixelFormat, UTF8String>())\n        .def(init<Bitmap>())\n        .def(\"__init__\", make_constructor(createBitmapWithRect))\n        .def(\"__init__\", make_constructor(createBitmapFromFile))\n        .def(\"blt\", &Bitmap::blt)\n        .def(\"getResized\", &Bitmap_getResized)\n        .def(\"save\", &Bitmap::save)\n        .def(\"getSize\", &Bitmap_getSize)\n        .def(\"getFormat\", &Bitmap::getPixelFormat)\n        .def(\"getPixels\", &Bitmap_getPixels, Bitmap_getPixels_overloads())\n        .def(\"setPixels\", &Bitmap_setPixels)\n        .def(\"getPixel\", &Bitmap::getPythonPixel)\n        .def(\"subtract\", &Bitmap::subtract)\n        .def(\"getAvg\", &Bitmap::getAvg)\n        .def(\"getChannelAvg\", &Bitmap::getChannelAvg)\n        .def(\"getStdDev\", &Bitmap::getStdDev)\n        .def(\"getName\", &Bitmap::getName, \n                return_value_policy<copy_const_reference>())\n    ;\n    \n    class_<BitmapManager>(\"BitmapManager\", no_init)\n        .def(\"get\", &BitmapManager::get,\n                return_value_policy<reference_existing_object>())\n        .staticmethod(\"get\")\n        .def(\"loadBitmap\", &BitmapManager::loadBitmapPy, loadBitmap_overloads())\n        .def(\"setNumThreads\", &BitmapManager::setNumThreads)\n    ;\n\n    class_<CubicSpline, boost::noncopyable>(\"CubicSpline\", no_init)\n        .def(init<const vector<glm::vec2>&>())\n        .def(init<const vector<glm::vec2>&, bool>())\n        .def(\"interpolate\", &CubicSpline::interpolate)\n    ;\n}\n<commit_msg>Got rid of unnecessary casts; return buffer from Bitmap::getPixels(True).<commit_after>\/\/\n\/\/  libavg - Media Playback Engine. \n\/\/  Copyright (C) 2003-2014 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 \"WrapHelper.h\"\n\n#include \"..\/player\/BoostPython.h\"\n#include \"..\/player\/BitmapManager.h\"\n\n#include \"..\/graphics\/Bitmap.h\"\n#include \"..\/graphics\/BitmapLoader.h\"\n#include \"..\/graphics\/FilterResizeBilinear.h\"\n\n#include \"..\/base\/CubicSpline.h\"\n#include \"..\/base\/GeomHelper.h\"\n\n#include \"..\/glm\/gtx\/vector_angle.hpp\"\n\n#include <vector>\n#include <sstream>\n\nusing namespace boost::python;\nusing namespace std;\nusing namespace avg;\n\nnamespace bp = boost::python;\n\ntemplate<class POINT>\nclass_<POINT> export_point(const string& sName)\n{\n    return class_<POINT>(sName.c_str(), no_init)\n        .def(\"__len__\", &Vec2Helper::len)\n        .def(\"__getitem__\", &Vec2Helper::getItem)\n        .def(\"__str__\", &Vec2Helper::str)\n        .def(\"__repr__\", &Vec2Helper::repr)\n        .def(\"__hash__\", &Vec2Helper::getHash)\n        .def(\"getNormalized\", &Vec2Helper::safeGetNormalized)\n        .def(\"getNorm\", &Vec2Helper::getNorm)\n        .def(\"getRotated\", &getRotated)\n        .def(\"getRotated\", &getRotatedPivot)\n        .def(self == self)\n        .def(self != self)\n        .def(-self)\n        .def(self + self)\n        .def(self - self)\n        .def(float() * self)\n        .def(self * float())\n        .def(self \/ float())\n        .def(\"isInPolygon\", &pointInPolygon)\n        .def(\"getAngle\", &getAngle)\n        .def(\"fromPolar\", &fromPolar)\n        .staticmethod(\"fromPolar\")\n        .def(\"angle\", &Vec2Helper::vecAngle)\n        .staticmethod(\"angle\")\n    ;\n}\n\nstruct Pixel32_to_python_tuple\n{\n    static PyObject* convert (avg::Pixel32 px)\n    {\n        return bp::incref(bp::make_tuple(\n                px.getR(), px.getG(), px.getB(), px.getA()).ptr());\n    }\n};\n\nstatic bp::object Bitmap_getPixels(Bitmap& bitmap, bool bCopyData=true)\n{\n    unsigned char* pBuffer = bitmap.getPixels();\n    int buffSize = bitmap.getMemNeeded();\n    if (bCopyData) {\n        char * pBufCopy = new char[buffSize];\n        memcpy(pBufCopy, pBuffer, buffSize);\n        return bp::object(handle<>(PyBuffer_FromMemory(pBuffer, buffSize)));\n    } else {\n#if PY_MAJOR_VERSION < 3\n        PyObject* pyBuffer = PyBuffer_FromReadWriteMemory(pBuffer, buffSize);\n        PyObject* py_memView = PyMemoryView_FromObject(pyBuffer);\n#else\n        PyObject* py_memView = PyMemoryView_FromMemory((char*)pBuffer,\n                buffSize, PyBUF_READ);\n#endif\n        return bp::object(handle<>(py_memView));\n    }\n}\n\nBOOST_PYTHON_FUNCTION_OVERLOADS(Bitmap_getPixels_overloads, Bitmap_getPixels, \n        1, 2);\n\n\nstatic void Bitmap_setPixels(Bitmap& bitmap, PyObject* exporter)\n{\n    Py_buffer bufferView;\n    if (PyObject_CheckBuffer(exporter)) {\n        PyObject_GetBuffer(exporter, &bufferView, PyBUF_READ);\n    } else {\n        throw Exception(AVG_ERR_INVALID_ARGS,\n               \"Second parameter to Bitmap.setPixels must support the buffer interface.\");\n    }\n    const unsigned char* cxx_buf = reinterpret_cast<unsigned char*>(bufferView.buf);\n    bitmap.setPixels(cxx_buf);\n    PyBuffer_Release(&bufferView);\n}\n\nConstVec2 Bitmap_getSize(Bitmap* This)\n{\n    return (glm::vec2)(This->getSize());\n}\n\nBitmapPtr Bitmap_getResized(BitmapPtr This, const glm::vec2& size)\n{\n    return FilterResizeBilinear(IntPoint(size)).apply(This);\n}\n\nglm::vec2* createPoint()\n{\n    return new glm::vec2(0,0);\n}\n\nBitmapPtr createBitmapFromFile(const UTF8String& sFName)\n{\n    return loadBitmap(sFName);\n}\n\nBitmapPtr createBitmapWithRect(BitmapPtr pBmp,\n        const glm::vec2& tlPos, const glm::vec2& brPos)\n{\n    if (tlPos.x >= brPos.x || tlPos.y >= brPos.y) {\n        throw Exception(AVG_ERR_OUT_OF_RANGE, \n                \"Can't create a bitmap with zero or negative width\/height.\");\n    }\n    IntPoint size = pBmp->getSize();\n    if (tlPos.x < 0 || tlPos.y < 0 || brPos.x > size.x || brPos.y > size.y) {\n        throw Exception(AVG_ERR_OUT_OF_RANGE, \n                \"Attempt to create a subbitmap that doesn't fit into the parent bitmap.\");\n    }\n    IntRect rect = IntRect(IntPoint(tlPos), IntPoint(brPos));\n    return BitmapPtr(new Bitmap(*pBmp, rect));\n}\n\nBOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(loadBitmap_overloads, BitmapManager::loadBitmapPy, \n        2, 3);\n\nvoid export_bitmap()\n{\n    export_point<glm::vec2>(\"Point2D\")\n        .def(\"__init__\", make_constructor(createPoint))\n        .def(init<float, float>())\n        .def(init<const glm::vec2&>())\n        .def(\"__setitem__\", &Vec2Helper::setItem)\n        .add_property(\"x\", &Vec2Helper::getX, &Vec2Helper::setX,\"\")\n        .add_property(\"y\", &Vec2Helper::getY, &Vec2Helper::setY,\"\")\n    ;\n\n    export_point<ConstVec2>(\"ConstPoint2D\")\n        .add_property(\"x\", &Vec2Helper::getX, \"\")\n        .add_property(\"y\", &Vec2Helper::getY, \"\")\n    ;\n\n    implicitly_convertible<ConstVec2, glm::vec2>();\n    implicitly_convertible<glm::vec2, ConstVec2>();\n\n    enum_<PixelFormat>(\"pixelformat\")\n        .value(\"B5G6R5\", B5G6R5)\n        .value(\"B8G8R8\", B8G8R8)\n        .value(\"B8G8R8A8\", B8G8R8A8)\n        .value(\"B8G8R8X8\", B8G8R8X8)\n        .value(\"A8B8G8R8\", A8B8G8R8)\n        .value(\"X8B8G8R8\", X8B8G8R8)\n        .value(\"R5G6B5\", R5G6B5)\n        .value(\"R8G8B8\", R8G8B8)\n        .value(\"R8G8B8A8\", R8G8B8A8)\n        .value(\"R8G8B8X8\", R8G8B8X8)\n        .value(\"A8R8G8B8\", A8R8G8B8)\n        .value(\"X8R8G8B8\", X8R8G8B8)\n        .value(\"I8\", I8)\n        .value(\"I16\", I16)\n        .value(\"A8\", A8)\n        .value(\"YCbCr411\", YCbCr411)\n        .value(\"YCbCr422\", YCbCr422)\n        .value(\"YUYV422\", YUYV422)\n        .value(\"YCbCr420p\", YCbCr420p)\n        .value(\"YCbCrJ420p\", YCbCrJ420p)\n        .value(\"YCbCrA420p\", YCbCrA420p)\n        .value(\"BAYER8\", BAYER8)\n        .value(\"BAYER8_RGGB\", BAYER8_RGGB)\n        .value(\"BAYER8_GBRG\", BAYER8_GBRG)\n        .value(\"BAYER8_GRBG\", BAYER8_GRBG)\n        .value(\"BAYER8_BGGR\", BAYER8_BGGR)\n        .value(\"R32G32B32A32F\", R32G32B32A32F)\n        .value(\"I32F\", I32F)\n        .export_values();\n\n    def(\"getSupportedPixelFormats\", &getSupportedPixelFormats);\n\n    to_python_converter<Pixel32, Pixel32_to_python_tuple>();\n\n    class_<Bitmap, boost::shared_ptr<Bitmap> >(\"Bitmap\", no_init)\n        .def(init<glm::vec2, PixelFormat, UTF8String>())\n        .def(init<Bitmap>())\n        .def(\"__init__\", make_constructor(createBitmapWithRect))\n        .def(\"__init__\", make_constructor(createBitmapFromFile))\n        .def(\"blt\", &Bitmap::blt)\n        .def(\"getResized\", &Bitmap_getResized)\n        .def(\"save\", &Bitmap::save)\n        .def(\"getSize\", &Bitmap_getSize)\n        .def(\"getFormat\", &Bitmap::getPixelFormat)\n        .def(\"getPixels\", &Bitmap_getPixels, Bitmap_getPixels_overloads())\n        .def(\"setPixels\", &Bitmap_setPixels)\n        .def(\"getPixel\", &Bitmap::getPythonPixel)\n        .def(\"subtract\", &Bitmap::subtract)\n        .def(\"getAvg\", &Bitmap::getAvg)\n        .def(\"getChannelAvg\", &Bitmap::getChannelAvg)\n        .def(\"getStdDev\", &Bitmap::getStdDev)\n        .def(\"getName\", &Bitmap::getName, \n                return_value_policy<copy_const_reference>())\n    ;\n    \n    class_<BitmapManager>(\"BitmapManager\", no_init)\n        .def(\"get\", &BitmapManager::get,\n                return_value_policy<reference_existing_object>())\n        .staticmethod(\"get\")\n        .def(\"loadBitmap\", &BitmapManager::loadBitmapPy, loadBitmap_overloads())\n        .def(\"setNumThreads\", &BitmapManager::setNumThreads)\n    ;\n\n    class_<CubicSpline, boost::noncopyable>(\"CubicSpline\", no_init)\n        .def(init<const vector<glm::vec2>&>())\n        .def(init<const vector<glm::vec2>&, bool>())\n        .def(\"interpolate\", &CubicSpline::interpolate)\n    ;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"..\/..\/core\/logs.h\"\n#include \"..\/..\/private\/graphics\/opengl\/glew\/glew.h\"\n#include <iostream>\n#include \"glwindow.h\"\n#include \"texture.h\"\n\nnamespace Yuni\n{\nnamespace UI\n{\n\n\tbool GLWindow::initialize()\n\t{\n\t\t\/\/ Black background\n\t\t::glClearColor(0.0f, 0.0f, 0.0f, 1.0f);\n\t\t\/\/ Depth Buffer setup\n\t\t::glClearDepth(1.0f);\n\t\t\/\/ Enables Depth Testing\n\t\t::glEnable(GL_DEPTH_TEST);\n\t\t\/\/ The type of Depth Testing to do\n\t\t::glDepthFunc(GL_LEQUAL);\n\t\t\/\/ Enable back-face culling\n\t\t::glEnable(GL_CULL_FACE);\n\n\t\t\/\/ Display OpenGL version\n#ifndef NDEBUG\n\t\tYuni::Logs::Logger<> logs;\n\t\tconst uint8* version = ::glGetString(GL_VERSION);\n\t\tlogs.notice() << \"OpenGL \" << (const char*)version;\n#endif\n\n\t\t\/\/ Init GLEW\n\t\tGLenum error = ::glewInit();\n\t\tif (GLEW_OK != error)\n\t\t{\n#ifndef NDEBUG\n\t\t\tlogs.error() << ::glewGetErrorString(error);\n#endif\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Wait for the context to be ready before initializing some GL objects in the main window\n\t\tRenderWindow::initialize();\n\t\tactiveView()->initShaders();\n\n\t\treturn true;\n\t}\n\n\tvoid GLWindow::resize(uint width, uint height)\n\t{\n\t\t\/\/ Prevent A Divide By Zero\n\t\tif (0 == height)\n\t\t\theight = 1;\n\n\t\t\/\/ Reset The Current Viewport\n\t\t::glViewport(0, 0, width, height);\n\n\t\t\/\/ Select the Projection Matrix\n\t\t::glMatrixMode(GL_PROJECTION);\n\t\t\/\/ Reset the Projection Matrix\n\t\t::glLoadIdentity();\n\n\t\t\/\/ Calculate the Aspect Ratio of the window\n\t\t::gluPerspective(60.0f, (GLfloat)width \/ (GLfloat)height, 0.01f, 1000.0f);\n\n\t\t\/\/ Select the Modelview Matrix\n\t\t::glMatrixMode(GL_MODELVIEW);\n\t\t\/\/ Reset the Modelview Matrix\n\t\t::glLoadIdentity();\n\n\t\tRenderWindow::resize(width, height);\n\t}\n\n\n\tvoid GLWindow::drawFullWindowQuad(const Gfx3D::Texture::Ptr& texture) const\n\t{\n\t\tauto textureType = multiSampling() ? GL_TEXTURE_2D_MULTISAMPLE : GL_TEXTURE_2D;\n\t\t::glBindTexture(textureType, texture->id());\n\n\t\t::glPushAttrib(GL_DEPTH_BUFFER_BIT | GL_ENABLE_BIT);\n\t\t::glDisable(GL_DEPTH_TEST);\n\t\t\/\/::glCullFace(GL_FRONT);\n\n\t\t::glMatrixMode(GL_PROJECTION);\n\t\t::glPushMatrix();\n\t\t::glLoadIdentity();\n\t\t::gluOrtho2D(-1.0f, 1.0f, 1.0f, -1.0f);\n\n\t\t::glMatrixMode(GL_MODELVIEW);\n\t\t::glPushMatrix();\n\t\t::glLoadIdentity();\n\n\t\t::glBegin(GL_QUADS);\n\t\t::glTexCoord2f(0.0f, 1.0f);\n\t\t::glVertex2f(-1.0f, -1.0f);\n\t\t::glTexCoord2f(0.0f, 0.0f);\n\t\t::glVertex2f(-1.0f, 1.0f);\n\t\t::glTexCoord2f(1.0f, 0.0f);\n\t\t::glVertex2f(1.0f, 1.0f);\n\t\t::glTexCoord2f(1.0f, 1.0f);\n\t\t::glVertex2f(1.0f, -1.0f);\n\t\t::glEnd();\n\n\t\t\/*\n\t\t\/\/ Texture coordinates are useless when 2D shaders are activated\n\t\t\/\/ but they are used when no post-processing effect is present\n\t\tconst float texCoord[] =\n\t\t\t{\n\t\t\t\t0.0f, 0.0f,\n\t\t\t\t0.0f, 1.0f,\n\t\t\t\t1.0f, 1.0f,\n\t\t\t\t0.0f, 0.0f,\n\t\t\t\t1.0f, 1.0f,\n\t\t\t\t1.0f, 0.0f\n\t\t\t};\n\t\t::glEnableVertexAttribArray(Gfx3D::Vertex<>::vaTextureCoord);\n\t\t::glVertexAttribPointer(Gfx3D::Vertex<>::vaTextureCoord, 2, GL_FLOAT, 0, 0, texCoord);\n\t\t\/\/ Set vertex positions\n\t\tconst float vertices[] =\n\t\t\t{\n\t\t\t\t-1.0f, 1.0f,\n\t\t\t\t-1.0f, -1.0f,\n\t\t\t\t1.0f, -1.0f,\n\t\t\t\t-1.0f, 1.0f,\n\t\t\t\t1.0f, -1.0f,\n\t\t\t\t1.0f, 1.0f\n\t\t\t};\n\t\t::glEnableVertexAttribArray(Gfx3D::Vertex<>::vaPosition);\n\t\t::glVertexAttribPointer(Gfx3D::Vertex<>::vaPosition, 2, GL_FLOAT, 0, 0, vertices);\n\t\t\/\/ Draw\n\t\t::glDrawArrays(GL_TRIANGLES, 0, 6);\n\t\t*\/\n\n\t\t::glMatrixMode(GL_PROJECTION);\n\t\t::glPopMatrix();\n\t\t::glMatrixMode(GL_MODELVIEW);\n\t\t::glPopMatrix();\n\n\t\t::glPopAttrib();\n\t\t\/\/::glCullFace(GL_BACK);\n\n\t\t::glBindTexture(textureType, 0);\n\t}\n\n\n\tvoid GLWindow::clear() const\n\t{\n\t\tpFB.activate();\n\t\t::glClear(GL_COLOR_BUFFER_BIT);\n\t\tpFB.deactivate();\n\t}\n\n\tvoid GLWindow::clear(const Color::RGB<>& color) const\n\t{\n\t\tpFB.activate();\n\t\t::glClearColor(color.red, color.green, color.blue, 1.0f);\n\t\t::glClear(GL_COLOR_BUFFER_BIT);\n\t\tpFB.deactivate();\n\t}\n\n\n\tvoid GLWindow::clearRect(int x, int y, uint width, uint height) const\n\t{\n\t\tpFB.activate();\n\t\t\/\/ We offer coordinates top-left to bottom-right\n\t\t\/\/ but GL coordinates are bottom-left to top-right, so convert Y\n\t\t::glEnable(GL_SCISSOR_TEST);\n\t\t::glScissor(x, pHeight - height - y, width, height);\n\t\t::glClear(GL_COLOR_BUFFER_BIT);\n\t\t::glDisable(GL_SCISSOR_TEST);\n\t\tpFB.deactivate();\n\t}\n\n\n\n} \/\/ namespace UI\n} \/\/ namespace Yuni\n<commit_msg>UI : Temporarily removed back-face culling until a definite foolproof last draw step is found.<commit_after>\n#include \"..\/..\/core\/logs.h\"\n#include \"..\/..\/private\/graphics\/opengl\/glew\/glew.h\"\n#include <iostream>\n#include \"glwindow.h\"\n#include \"texture.h\"\n\nnamespace Yuni\n{\nnamespace UI\n{\n\n\tbool GLWindow::initialize()\n\t{\n\t\t\/\/ Black background\n\t\t::glClearColor(0.0f, 0.0f, 0.0f, 1.0f);\n\t\t\/\/ Depth Buffer setup\n\t\t::glClearDepth(1.0f);\n\t\t\/\/ Enables Depth Testing\n\t\t::glEnable(GL_DEPTH_TEST);\n\t\t\/\/ The type of Depth Testing to do\n\t\t::glDepthFunc(GL_LEQUAL);\n\t\t\/\/ Enable back-face culling\n\t\t\/\/::glEnable(GL_CULL_FACE);\n\n\t\t\/\/ Display OpenGL version\n#ifndef NDEBUG\n\t\tYuni::Logs::Logger<> logs;\n\t\tconst uint8* version = ::glGetString(GL_VERSION);\n\t\tlogs.notice() << \"OpenGL \" << (const char*)version;\n#endif\n\n\t\t\/\/ Init GLEW\n\t\tGLenum error = ::glewInit();\n\t\tif (GLEW_OK != error)\n\t\t{\n#ifndef NDEBUG\n\t\t\tlogs.error() << ::glewGetErrorString(error);\n#endif\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Wait for the context to be ready before initializing some GL objects in the main window\n\t\tRenderWindow::initialize();\n\t\tactiveView()->initShaders();\n\n\t\treturn true;\n\t}\n\n\tvoid GLWindow::resize(uint width, uint height)\n\t{\n\t\t\/\/ Prevent A Divide By Zero\n\t\tif (0 == height)\n\t\t\theight = 1;\n\n\t\t\/\/ Reset The Current Viewport\n\t\t::glViewport(0, 0, width, height);\n\n\t\t\/\/ Select the Projection Matrix\n\t\t::glMatrixMode(GL_PROJECTION);\n\t\t\/\/ Reset the Projection Matrix\n\t\t::glLoadIdentity();\n\n\t\t\/\/ Calculate the Aspect Ratio of the window\n\t\t::gluPerspective(60.0f, (GLfloat)width \/ (GLfloat)height, 0.01f, 1000.0f);\n\n\t\t\/\/ Select the Modelview Matrix\n\t\t::glMatrixMode(GL_MODELVIEW);\n\t\t\/\/ Reset the Modelview Matrix\n\t\t::glLoadIdentity();\n\n\t\tRenderWindow::resize(width, height);\n\t}\n\n\n\tvoid GLWindow::drawFullWindowQuad(const Gfx3D::Texture::Ptr& texture) const\n\t{\n\t\tauto textureType = multiSampling() ? GL_TEXTURE_2D_MULTISAMPLE : GL_TEXTURE_2D;\n\t\t::glBindTexture(textureType, texture->id());\n\n\t\t::glPushAttrib(GL_DEPTH_BUFFER_BIT | GL_ENABLE_BIT);\n\t\t::glDisable(GL_DEPTH_TEST);\n\t\t\/\/::glCullFace(GL_FRONT);\n\n\t\t::glMatrixMode(GL_PROJECTION);\n\t\t::glPushMatrix();\n\t\t::glLoadIdentity();\n\t\t::gluOrtho2D(-1.0f, 1.0f, 1.0f, -1.0f);\n\n\t\t::glMatrixMode(GL_MODELVIEW);\n\t\t::glPushMatrix();\n\t\t::glLoadIdentity();\n\n\t\t::glBegin(GL_QUADS);\n\t\t::glTexCoord2f(0.0f, 1.0f);\n\t\t::glVertex2f(-1.0f, -1.0f);\n\t\t::glTexCoord2f(0.0f, 0.0f);\n\t\t::glVertex2f(-1.0f, 1.0f);\n\t\t::glTexCoord2f(1.0f, 0.0f);\n\t\t::glVertex2f(1.0f, 1.0f);\n\t\t::glTexCoord2f(1.0f, 1.0f);\n\t\t::glVertex2f(1.0f, -1.0f);\n\t\t::glEnd();\n\n\n\t\t\/\/ Texture coordinates are useless when 2D shaders are activated\n\t\t\/\/ but they are used when no post-processing effect is present\n\t\t\/\/ const float texCoord[] =\n\t\t\/\/ \t{\n\t\t\/\/ \t\t0.0f, 1.0f,\n\t\t\/\/ \t\t0.0f, 0.0f,\n\t\t\/\/ \t\t1.0f, 0.0f,\n\t\t\/\/ \t\t0.0f, 1.0f,\n\t\t\/\/ \t\t1.0f, 0.0f,\n\t\t\/\/ \t\t1.0f, 1.0f\n\t\t\/\/ \t};\n\t\t\/\/ ::glEnableVertexAttribArray(Gfx3D::Vertex<>::vaTextureCoord);\n\t\t\/\/ ::glVertexAttribPointer(Gfx3D::Vertex<>::vaTextureCoord, 2, GL_FLOAT, 0, 0, texCoord);\n\t\t\/\/ Set vertex positions\n\t\t\/*const float vertices[] =\n\t\t\t{\n\t\t\t\t-1.0f, 1.0f,\n\t\t\t\t-1.0f, -1.0f,\n\t\t\t\t1.0f, -1.0f,\n\t\t\t\t-1.0f, 1.0f,\n\t\t\t\t1.0f, -1.0f,\n\t\t\t\t1.0f, 1.0f\n\t\t\t};\n\t\t::glEnableVertexAttribArray(Gfx3D::Vertex<>::vaPosition);\n\t\t::glVertexAttribPointer(Gfx3D::Vertex<>::vaPosition, 2, GL_FLOAT, 0, 0, vertices);\n\t\t\/\/ Draw\n\t\t::glDrawArrays(GL_TRIANGLES, 0, 6);\n\n\t\t::glDisableVertexAttribArray(Gfx3D::Vertex<>::vaPosition);\n\t\t::glDisableVertexAttribArray(Gfx3D::Vertex<>::vaTextureCoord);\n\t\t*\/\n\t\t::glMatrixMode(GL_PROJECTION);\n\t\t::glPopMatrix();\n\t\t::glMatrixMode(GL_MODELVIEW);\n\t\t::glPopMatrix();\n\n\t\t::glPopAttrib();\n\t\t\/\/::glCullFace(GL_BACK);\n\n\t\t::glBindTexture(textureType, 0);\n\t}\n\n\n\tvoid GLWindow::clear() const\n\t{\n\t\tpFB.activate();\n\t\t::glClear(GL_COLOR_BUFFER_BIT);\n\t\tpFB.deactivate();\n\t}\n\n\tvoid GLWindow::clear(const Color::RGB<>& color) const\n\t{\n\t\tpFB.activate();\n\t\t::glClearColor(color.red, color.green, color.blue, 1.0f);\n\t\t::glClear(GL_COLOR_BUFFER_BIT);\n\t\tpFB.deactivate();\n\t}\n\n\n\tvoid GLWindow::clearRect(int x, int y, uint width, uint height) const\n\t{\n\t\tpFB.activate();\n\t\t\/\/ We offer coordinates top-left to bottom-right\n\t\t\/\/ but GL coordinates are bottom-left to top-right, so convert Y\n\t\t::glEnable(GL_SCISSOR_TEST);\n\t\t::glScissor(x, pHeight - height - y, width, height);\n\t\t::glClear(GL_COLOR_BUFFER_BIT);\n\t\t::glDisable(GL_SCISSOR_TEST);\n\t\tpFB.deactivate();\n\t}\n\n\n\n} \/\/ namespace UI\n} \/\/ namespace Yuni\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#include <glog\/logging.h>\n\n#include <iostream>\n#include <map>\n\n#include <process\/dispatch.hpp>\n#include <process\/once.hpp>\n#include <process\/process.hpp>\n\n#include <stout\/duration.hpp>\n#include <stout\/fatal.hpp>\n#include <stout\/foreach.hpp>\n#include <stout\/path.hpp>\n#include <stout\/strings.hpp>\n#include <stout\/tuple.hpp>\n\n#include \"zookeeper\/zookeeper.hpp\"\n\nusing process::Future;\nusing process::PID;\nusing process::Process;\nusing process::Promise;\n\nusing std::map;\nusing std::string;\nusing std::vector;\n\nusing tuples::tuple;\n\n\nclass ZooKeeperImpl\n{\npublic:\n  ZooKeeperImpl(ZooKeeper* zk,\n                const string& servers,\n                const Duration& timeout,\n                Watcher* watcher)\n    : servers(servers),\n      zk(zk),\n      watcher(watcher)\n  {\n    if (watcher == NULL) {\n      LOG(FATAL) << \"Cannot instantiate ZooKeeper with NULL watcher\";\n    }\n\n    zh = zookeeper_init(\n        servers.c_str(),\n        event,\n        static_cast<int>(timeout.ms()),\n        NULL,\n        this,\n        0);\n\n    if (zh == NULL) {\n      PLOG(FATAL) << \"Failed to create ZooKeeper, zookeeper_init\";\n    }\n  }\n\n  ~ZooKeeperImpl()\n  {\n    int ret = zookeeper_close(zh);\n    if (ret != ZOK) {\n      LOG(FATAL) << \"Failed to cleanup ZooKeeper, zookeeper_close: \"\n                 << zerror(ret);\n    }\n  }\n\n  Future<int> authenticate(const string& scheme, const string& credentials)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*>* args = new tuple<Promise<int>*>(promise);\n\n    int ret = zoo_add_auth(zh, scheme.c_str(), credentials.data(),\n                           credentials.size(), voidCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> create(const string& path, const string& data,\n                     const ACL_vector& acl, int flags, string* result)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, string*>* args =\n      new tuple<Promise<int>*, string*>(promise, result);\n\n    int ret = zoo_acreate(zh, path.c_str(), data.data(), data.size(), &acl,\n                          flags, stringCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> remove(const string& path, int version)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*>* args = new tuple<Promise<int>*>(promise);\n\n    int ret = zoo_adelete(zh, path.c_str(), version, voidCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> exists(const string& path, bool watch, Stat* stat)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, Stat*>* args =\n      new tuple<Promise<int>*, Stat*>(promise, stat);\n\n    int ret = zoo_aexists(zh, path.c_str(), watch, statCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> get(const string& path, bool watch, string* result, Stat* stat)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, string*, Stat*>* args =\n      new tuple<Promise<int>*, string*, Stat*>(promise, result, stat);\n\n    int ret = zoo_aget(zh, path.c_str(), watch, dataCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> getChildren(const string& path,\n                          bool watch,\n                          vector<string>* results)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, vector<string>*>* args =\n      new tuple<Promise<int>*, vector<string>*>(promise, results);\n\n    int ret = zoo_aget_children(zh, path.c_str(), watch, stringsCompletion,\n                                args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> set(const string& path, const string& data, int version)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, Stat*>* args =\n      new tuple<Promise<int>*, Stat*>(promise, NULL);\n\n    int ret = zoo_aset(zh, path.c_str(), data.data(), data.size(),\n                       version, statCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\nprivate:\n  \/\/ This method is registered as a watcher callback function and is\n  \/\/ invoked by a single ZooKeeper event thread.\n  static void event(\n      zhandle_t* zh,\n      int type,\n      int state,\n      const char* path,\n      void* ctx)\n  {\n    ZooKeeperImpl* impl = static_cast<ZooKeeperImpl*>(ctx);\n    impl->watcher->process(impl->zk, type, state, string(path));\n  }\n\n\n  static void voidCompletion(int ret, const void *data)\n  {\n    const tuple<Promise<int>*>* args =\n      reinterpret_cast<const tuple<Promise<int>*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\n\n  static void stringCompletion(int ret, const char* value, const void* data)\n  {\n    const tuple<Promise<int>*, string*> *args =\n      reinterpret_cast<const tuple<Promise<int>*, string*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n    string* result = tuples::get<1>(*args);\n\n    if (ret == 0) {\n      if (result != NULL) {\n        result->assign(value);\n      }\n    }\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\n\n  static void statCompletion(int ret, const Stat* stat, const void* data)\n  {\n    const tuple<Promise<int>*, Stat*>* args =\n      reinterpret_cast<const tuple<Promise<int>*, Stat*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n    Stat *stat_result = tuples::get<1>(*args);\n\n    if (ret == 0) {\n      if (stat_result != NULL) {\n        *stat_result = *stat;\n      }\n    }\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\n\n  static void dataCompletion(\n      int ret,\n      const char* value,\n      int value_len,\n      const Stat* stat,\n      const void* data)\n  {\n    const tuple<Promise<int>*, string*, Stat*>* args =\n      reinterpret_cast<const tuple<Promise<int>*, string*, Stat*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n    string* result = tuples::get<1>(*args);\n    Stat* stat_result = tuples::get<2>(*args);\n\n    if (ret == 0) {\n      if (result != NULL) {\n        result->assign(value, value_len);\n      }\n\n      if (stat_result != NULL) {\n        *stat_result = *stat;\n      }\n    }\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\n\n  static void stringsCompletion(\n      int ret,\n      const String_vector* values,\n      const void* data)\n  {\n    const tuple<Promise<int>*, vector<string>*>* args =\n      reinterpret_cast<const tuple<Promise<int>*, vector<string>*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n    vector<string>* results = tuples::get<1>(*args);\n\n    if (ret == 0) {\n      if (results != NULL) {\n        for (int i = 0; i < values->count; i++) {\n          results->push_back(values->data[i]);\n        }\n      }\n    }\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\nprivate:\n  friend class ZooKeeper;\n\n  const string servers; \/\/ ZooKeeper host:port pairs.\n\n  ZooKeeper* zk; \/\/ ZooKeeper instance.\n  zhandle_t* zh; \/\/ ZooKeeper connection handle.\n\n  Watcher* watcher; \/\/ Associated Watcher instance.\n};\n\n\nZooKeeper::ZooKeeper(const string& servers,\n                     const Duration& timeout,\n                     Watcher* watcher)\n{\n  impl = new ZooKeeperImpl(this, servers, timeout, watcher);\n}\n\n\nZooKeeper::~ZooKeeper()\n{\n  delete impl;\n}\n\n\nint ZooKeeper::getState()\n{\n  return zoo_state(impl->zh);\n}\n\n\nint64_t ZooKeeper::getSessionId()\n{\n  return zoo_client_id(impl->zh)->client_id;\n}\n\n\nDuration ZooKeeper::getSessionTimeout() const\n{\n  \/\/ ZooKeeper server uses int representation of milliseconds for\n  \/\/ session timeouts.\n  \/\/ See:\n  \/\/ http:\/\/zookeeper.apache.org\/doc\/trunk\/zookeeperProgrammers.html\n  return Milliseconds(zoo_recv_timeout(impl->zh));\n}\n\n\nint ZooKeeper::authenticate(const string& scheme, const string& credentials)\n{\n  return impl->authenticate(scheme, credentials).get();\n}\n\n\nint ZooKeeper::create(\n    const string& path,\n    const string& data,\n    const ACL_vector& acl,\n    int flags,\n    string* result,\n    bool recursive)\n{\n  if (!recursive) {\n    return impl->create(path, data, acl, flags, result).get();\n  }\n\n  \/\/ First check if the path exists.\n  int code = impl->exists(path, false, NULL).get();\n  if (code == ZOK) {\n    return ZNODEEXISTS;\n  }\n\n  \/\/ Now recursively create the parent path.\n  \/\/ NOTE: We don't use 'dirname()' to get the parent path here\n  \/\/ because, it doesn't return the expected path when a path ends\n  \/\/ with \"\/\". For example, to create path \"\/a\/b\/\", we want to\n  \/\/ recursively create \"\/a\/b\", instead of just creating \"\/a\".\n  const string& parent = path.substr(0, path.find_last_of(\"\/\"));\n  if (!parent.empty()) {\n    code = create(parent, \"\", acl, 0, result, true);\n    if (code != ZOK && code != ZNODEEXISTS) {\n      return code;\n    }\n  }\n\n  \/\/ Finally create the path.\n  \/\/ TODO(vinod): Delete any intermediate nodes created if this fails.\n  \/\/ This requires synchronization because the deletion might affect\n  \/\/ other callers (different threads\/processes) acting on this path.\n  return impl->create(path, data, acl, flags, result).get();\n}\n\n\nint ZooKeeper::remove(const string& path, int version)\n{\n  return impl->remove(path, version).get();\n}\n\n\nint ZooKeeper::exists(const string& path, bool watch, Stat* stat)\n{\n  return impl->exists(path, watch, stat).get();\n}\n\n\nint ZooKeeper::get(const string& path, bool watch, string* result, Stat* stat)\n{\n  return impl->get(path, watch, result, stat).get();\n}\n\n\nint ZooKeeper::getChildren(const string& path, bool watch,\n                           vector<string>* results)\n{\n  return impl->getChildren(path, watch, results).get();\n}\n\n\nint ZooKeeper::set(const string& path, const string& data, int version)\n{\n  return impl->set(path, data, version).get();\n}\n\n\nstring ZooKeeper::message(int code) const\n{\n  return string(zerror(code));\n}\n\n\nbool ZooKeeper::retryable(int code)\n{\n  switch (code) {\n    case ZCONNECTIONLOSS:\n    case ZOPERATIONTIMEOUT:\n    case ZSESSIONEXPIRED:\n    case ZSESSIONMOVED:\n      return true;\n\n    case ZOK: \/\/ No need to retry!\n\n    case ZSYSTEMERROR: \/\/ Should not be encountered, here for completeness.\n    case ZRUNTIMEINCONSISTENCY:\n    case ZDATAINCONSISTENCY:\n    case ZMARSHALLINGERROR:\n    case ZUNIMPLEMENTED:\n    case ZBADARGUMENTS:\n    case ZINVALIDSTATE:\n\n    case ZAPIERROR: \/\/ Should not be encountered, here for completeness.\n    case ZNONODE:\n    case ZNOAUTH:\n    case ZBADVERSION:\n    case ZNOCHILDRENFOREPHEMERALS:\n    case ZNODEEXISTS:\n    case ZNOTEMPTY:\n    case ZINVALIDCALLBACK:\n    case ZINVALIDACL:\n    case ZAUTHFAILED:\n    case ZCLOSING:\n    case ZNOTHING: \/\/ Is this used? It's not exposed in the Java API.\n      return false;\n\n    default:\n      LOG(FATAL) << \"Unknown ZooKeeper code: \" << code;\n  }\n}\n<commit_msg>Fixed a compiler warning using UNREACHABLE in zookeeper.cpp.<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#include <glog\/logging.h>\n\n#include <iostream>\n#include <map>\n\n#include <process\/dispatch.hpp>\n#include <process\/once.hpp>\n#include <process\/process.hpp>\n\n#include <stout\/duration.hpp>\n#include <stout\/fatal.hpp>\n#include <stout\/foreach.hpp>\n#include <stout\/path.hpp>\n#include <stout\/strings.hpp>\n#include <stout\/tuple.hpp>\n#include <stout\/unreachable.hpp>\n\n#include \"zookeeper\/zookeeper.hpp\"\n\nusing process::Future;\nusing process::PID;\nusing process::Process;\nusing process::Promise;\n\nusing std::map;\nusing std::string;\nusing std::vector;\n\nusing tuples::tuple;\n\n\nclass ZooKeeperImpl\n{\npublic:\n  ZooKeeperImpl(ZooKeeper* zk,\n                const string& servers,\n                const Duration& timeout,\n                Watcher* watcher)\n    : servers(servers),\n      zk(zk),\n      watcher(watcher)\n  {\n    if (watcher == NULL) {\n      LOG(FATAL) << \"Cannot instantiate ZooKeeper with NULL watcher\";\n    }\n\n    zh = zookeeper_init(\n        servers.c_str(),\n        event,\n        static_cast<int>(timeout.ms()),\n        NULL,\n        this,\n        0);\n\n    if (zh == NULL) {\n      PLOG(FATAL) << \"Failed to create ZooKeeper, zookeeper_init\";\n    }\n  }\n\n  ~ZooKeeperImpl()\n  {\n    int ret = zookeeper_close(zh);\n    if (ret != ZOK) {\n      LOG(FATAL) << \"Failed to cleanup ZooKeeper, zookeeper_close: \"\n                 << zerror(ret);\n    }\n  }\n\n  Future<int> authenticate(const string& scheme, const string& credentials)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*>* args = new tuple<Promise<int>*>(promise);\n\n    int ret = zoo_add_auth(zh, scheme.c_str(), credentials.data(),\n                           credentials.size(), voidCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> create(const string& path, const string& data,\n                     const ACL_vector& acl, int flags, string* result)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, string*>* args =\n      new tuple<Promise<int>*, string*>(promise, result);\n\n    int ret = zoo_acreate(zh, path.c_str(), data.data(), data.size(), &acl,\n                          flags, stringCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> remove(const string& path, int version)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*>* args = new tuple<Promise<int>*>(promise);\n\n    int ret = zoo_adelete(zh, path.c_str(), version, voidCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> exists(const string& path, bool watch, Stat* stat)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, Stat*>* args =\n      new tuple<Promise<int>*, Stat*>(promise, stat);\n\n    int ret = zoo_aexists(zh, path.c_str(), watch, statCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> get(const string& path, bool watch, string* result, Stat* stat)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, string*, Stat*>* args =\n      new tuple<Promise<int>*, string*, Stat*>(promise, result, stat);\n\n    int ret = zoo_aget(zh, path.c_str(), watch, dataCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> getChildren(const string& path,\n                          bool watch,\n                          vector<string>* results)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, vector<string>*>* args =\n      new tuple<Promise<int>*, vector<string>*>(promise, results);\n\n    int ret = zoo_aget_children(zh, path.c_str(), watch, stringsCompletion,\n                                args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\n  Future<int> set(const string& path, const string& data, int version)\n  {\n    Promise<int>* promise = new Promise<int>();\n\n    Future<int> future = promise->future();\n\n    tuple<Promise<int>*, Stat*>* args =\n      new tuple<Promise<int>*, Stat*>(promise, NULL);\n\n    int ret = zoo_aset(zh, path.c_str(), data.data(), data.size(),\n                       version, statCompletion, args);\n\n    if (ret != ZOK) {\n      delete promise;\n      delete args;\n      return ret;\n    }\n\n    return future;\n  }\n\nprivate:\n  \/\/ This method is registered as a watcher callback function and is\n  \/\/ invoked by a single ZooKeeper event thread.\n  static void event(\n      zhandle_t* zh,\n      int type,\n      int state,\n      const char* path,\n      void* ctx)\n  {\n    ZooKeeperImpl* impl = static_cast<ZooKeeperImpl*>(ctx);\n    impl->watcher->process(impl->zk, type, state, string(path));\n  }\n\n\n  static void voidCompletion(int ret, const void *data)\n  {\n    const tuple<Promise<int>*>* args =\n      reinterpret_cast<const tuple<Promise<int>*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\n\n  static void stringCompletion(int ret, const char* value, const void* data)\n  {\n    const tuple<Promise<int>*, string*> *args =\n      reinterpret_cast<const tuple<Promise<int>*, string*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n    string* result = tuples::get<1>(*args);\n\n    if (ret == 0) {\n      if (result != NULL) {\n        result->assign(value);\n      }\n    }\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\n\n  static void statCompletion(int ret, const Stat* stat, const void* data)\n  {\n    const tuple<Promise<int>*, Stat*>* args =\n      reinterpret_cast<const tuple<Promise<int>*, Stat*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n    Stat *stat_result = tuples::get<1>(*args);\n\n    if (ret == 0) {\n      if (stat_result != NULL) {\n        *stat_result = *stat;\n      }\n    }\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\n\n  static void dataCompletion(\n      int ret,\n      const char* value,\n      int value_len,\n      const Stat* stat,\n      const void* data)\n  {\n    const tuple<Promise<int>*, string*, Stat*>* args =\n      reinterpret_cast<const tuple<Promise<int>*, string*, Stat*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n    string* result = tuples::get<1>(*args);\n    Stat* stat_result = tuples::get<2>(*args);\n\n    if (ret == 0) {\n      if (result != NULL) {\n        result->assign(value, value_len);\n      }\n\n      if (stat_result != NULL) {\n        *stat_result = *stat;\n      }\n    }\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\n\n  static void stringsCompletion(\n      int ret,\n      const String_vector* values,\n      const void* data)\n  {\n    const tuple<Promise<int>*, vector<string>*>* args =\n      reinterpret_cast<const tuple<Promise<int>*, vector<string>*>*>(data);\n\n    Promise<int>* promise = tuples::get<0>(*args);\n    vector<string>* results = tuples::get<1>(*args);\n\n    if (ret == 0) {\n      if (results != NULL) {\n        for (int i = 0; i < values->count; i++) {\n          results->push_back(values->data[i]);\n        }\n      }\n    }\n\n    promise->set(ret);\n\n    delete promise;\n    delete args;\n  }\n\nprivate:\n  friend class ZooKeeper;\n\n  const string servers; \/\/ ZooKeeper host:port pairs.\n\n  ZooKeeper* zk; \/\/ ZooKeeper instance.\n  zhandle_t* zh; \/\/ ZooKeeper connection handle.\n\n  Watcher* watcher; \/\/ Associated Watcher instance.\n};\n\n\nZooKeeper::ZooKeeper(const string& servers,\n                     const Duration& timeout,\n                     Watcher* watcher)\n{\n  impl = new ZooKeeperImpl(this, servers, timeout, watcher);\n}\n\n\nZooKeeper::~ZooKeeper()\n{\n  delete impl;\n}\n\n\nint ZooKeeper::getState()\n{\n  return zoo_state(impl->zh);\n}\n\n\nint64_t ZooKeeper::getSessionId()\n{\n  return zoo_client_id(impl->zh)->client_id;\n}\n\n\nDuration ZooKeeper::getSessionTimeout() const\n{\n  \/\/ ZooKeeper server uses int representation of milliseconds for\n  \/\/ session timeouts.\n  \/\/ See:\n  \/\/ http:\/\/zookeeper.apache.org\/doc\/trunk\/zookeeperProgrammers.html\n  return Milliseconds(zoo_recv_timeout(impl->zh));\n}\n\n\nint ZooKeeper::authenticate(const string& scheme, const string& credentials)\n{\n  return impl->authenticate(scheme, credentials).get();\n}\n\n\nint ZooKeeper::create(\n    const string& path,\n    const string& data,\n    const ACL_vector& acl,\n    int flags,\n    string* result,\n    bool recursive)\n{\n  if (!recursive) {\n    return impl->create(path, data, acl, flags, result).get();\n  }\n\n  \/\/ First check if the path exists.\n  int code = impl->exists(path, false, NULL).get();\n  if (code == ZOK) {\n    return ZNODEEXISTS;\n  }\n\n  \/\/ Now recursively create the parent path.\n  \/\/ NOTE: We don't use 'dirname()' to get the parent path here\n  \/\/ because, it doesn't return the expected path when a path ends\n  \/\/ with \"\/\". For example, to create path \"\/a\/b\/\", we want to\n  \/\/ recursively create \"\/a\/b\", instead of just creating \"\/a\".\n  const string& parent = path.substr(0, path.find_last_of(\"\/\"));\n  if (!parent.empty()) {\n    code = create(parent, \"\", acl, 0, result, true);\n    if (code != ZOK && code != ZNODEEXISTS) {\n      return code;\n    }\n  }\n\n  \/\/ Finally create the path.\n  \/\/ TODO(vinod): Delete any intermediate nodes created if this fails.\n  \/\/ This requires synchronization because the deletion might affect\n  \/\/ other callers (different threads\/processes) acting on this path.\n  return impl->create(path, data, acl, flags, result).get();\n}\n\n\nint ZooKeeper::remove(const string& path, int version)\n{\n  return impl->remove(path, version).get();\n}\n\n\nint ZooKeeper::exists(const string& path, bool watch, Stat* stat)\n{\n  return impl->exists(path, watch, stat).get();\n}\n\n\nint ZooKeeper::get(const string& path, bool watch, string* result, Stat* stat)\n{\n  return impl->get(path, watch, result, stat).get();\n}\n\n\nint ZooKeeper::getChildren(const string& path, bool watch,\n                           vector<string>* results)\n{\n  return impl->getChildren(path, watch, results).get();\n}\n\n\nint ZooKeeper::set(const string& path, const string& data, int version)\n{\n  return impl->set(path, data, version).get();\n}\n\n\nstring ZooKeeper::message(int code) const\n{\n  return string(zerror(code));\n}\n\n\nbool ZooKeeper::retryable(int code)\n{\n  switch (code) {\n    case ZCONNECTIONLOSS:\n    case ZOPERATIONTIMEOUT:\n    case ZSESSIONEXPIRED:\n    case ZSESSIONMOVED:\n      return true;\n\n    case ZOK: \/\/ No need to retry!\n\n    case ZSYSTEMERROR: \/\/ Should not be encountered, here for completeness.\n    case ZRUNTIMEINCONSISTENCY:\n    case ZDATAINCONSISTENCY:\n    case ZMARSHALLINGERROR:\n    case ZUNIMPLEMENTED:\n    case ZBADARGUMENTS:\n    case ZINVALIDSTATE:\n\n    case ZAPIERROR: \/\/ Should not be encountered, here for completeness.\n    case ZNONODE:\n    case ZNOAUTH:\n    case ZBADVERSION:\n    case ZNOCHILDRENFOREPHEMERALS:\n    case ZNODEEXISTS:\n    case ZNOTEMPTY:\n    case ZINVALIDCALLBACK:\n    case ZINVALIDACL:\n    case ZAUTHFAILED:\n    case ZCLOSING:\n    case ZNOTHING: \/\/ Is this used? It's not exposed in the Java API.\n      return false;\n\n    default:\n      LOG(FATAL) << \"Unknown ZooKeeper code: \" << code;\n      return UNREACHABLE(); \/\/ Make compiler happy.\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n * BSD 3-Clause License\n *\n * Copyright (c) 2017, mtezych\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 * * 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,\n * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER 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 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,\n * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\n#if defined(__linux__)\n\n    \/\/ [Linux] - alloca (size_t size) -> void*\n    \/\/ ~ http:\/\/man7.org\/linux\/man-pages\/man3\/alloca.3.html\n    #include <alloca.h>\n\n    \/\/ [GCC] - Common Function Attributes\n    \/\/ ~ https:\/\/gcc.gnu.org\/onlinedocs\/gcc\/Common-Function-Attributes.html\n    #define always_inline __attribute__((always_inline)) inline\n\n#elif defined(_WIN32)\n\n    \/\/ [Microsoft CRT] - _alloca (size_t size) -> void*\n    \/\/ ~ https:\/\/docs.microsoft.com\/en-us\/cpp\/c-runtime-library\/reference\/alloca\n    #include <malloc.h>\n\n    \/\/ [Micrsoft Visual C++] - Inline Functions\n    \/\/ ~ https:\/\/docs.microsoft.com\/en-us\/cpp\/cpp\/inline-functions-cpp\n    #define always_inline __forceinline\n\n#else\n\n    #error \"Unsupported platform!\"\n\n#endif\n\n\n#include <cassert>\n\n#include <cstddef>\n\nnamespace cxx\n{\n    \/\/\n    \/\/ The stack_alloc() function only allocates memory.\n    \/\/ It does *not* create C++ objects under rules of the C++ abstract machine.\n    \/\/\n    \/\/ Therefore, client code is required to\n    \/\/ call placement new operator to create a C++ object.\n    \/\/\n    \/\/ ~ https:\/\/groups.google.com\/a\/isocpp.org\/d\/msg\/std-discussion\/rt2ivJnc4hg\/4RKYJeF5CQAJ\n    \/\/\n    template <typename type>\n    always_inline auto stack_alloc (const std::ptrdiff_t size) noexcept -> type*\n    {\n        assert(size > 0);\n\n    #if defined(__linux__)\n\n        return static_cast<type*>(alloca(sizeof(type) * size));\n\n    #elif defined(_WIN32)\n\n        return static_cast<type*>(_alloca(sizeof(type) * size));\n\n    #endif\n    }\n}\n\n\n#include <new>\n\nnamespace cxx\n{\n    template <typename element>\n    class stack_array\n    {\n    private:\n\n        element*       data_;\n        std::ptrdiff_t size_;\n        std::ptrdiff_t capacity_;\n\n    public:\n\n        always_inline stack_array (const std::ptrdiff_t capacity)\n        :\n            data_     { stack_alloc<element>(capacity) },\n            size_     { 0                              },\n            capacity_ { capacity                       }\n        {\n            assert(capacity > 0);\n        }\n\n        auto data () noexcept -> element*\n        {\n            return data_;\n        }\n\n        auto data () const noexcept -> const element*\n        {\n            return data_;\n        }\n\n        auto size () const noexcept -> std::ptrdiff_t\n        {\n            return size_;\n        }\n\n        auto capacity () const noexcept -> std::ptrdiff_t\n        {\n            return capacity_;\n        }\n\n        auto push (const element& value) -> void\n        {\n            new (data_ + size_) element(value);\n\n            ++size_;\n        }\n\n        auto push (element&& value) -> void\n        {\n            new (data_ + size_) element(std::move(value));\n\n            ++size_;\n        }\n\n        auto operator [] (const std::ptrdiff_t index) noexcept -> element&\n        {\n            assert((index >= 0) && (index < size_));\n\n            return data_[index];\n        }\n\n        auto operator [] (const std::ptrdiff_t index) const noexcept -> const element&\n        {\n            assert((index >= 0) && (index < size_));\n\n            return data_[index];\n        }\n    };\n}\n\n\n#include <algorithm>\n\n#include <numeric>\n\nnamespace test\n{\n    auto stack_alloc () -> bool\n    {\n        struct span\n        {\n            int*           data;\n            std::ptrdiff_t size;\n        };\n\n        const auto array = span { cxx::stack_alloc<int>(4096), 4096 };\n\n        for (auto i = 0; i < array.size; ++i)\n        {\n            new (array.data + i) int { 1 };\n        }\n\n        \/\/ std::fill(array.data, array.data + array.size, 1);\n\n        auto sum = std::accumulate(array.data, array.data + array.size, 0);\n\n        return sum == array.size;\n    }\n\n    auto stack_array () -> bool\n    {\n        auto array = cxx::stack_array<int> { 4096 };\n\n        for (auto i = 0; i < array.capacity(); ++i)\n        {\n            array.push(1);\n        }\n\n        \/\/ std::fill(array.data(), array.data() + array.size(), 1);\n\n        auto sum = std::accumulate(array.data(), array.data() + array.size(), 0);\n\n        return sum == array.size();\n    }\n}\n\n\n#include <cstdlib>\n\nauto main () -> int\n{\n    const auto validate = [] (const bool condition)\n    {\n        if (!condition)\n        {\n            std::exit(EXIT_FAILURE);\n        }\n    };\n\n    validate(test::stack_alloc());\n    validate(test::stack_array());\n\n    return EXIT_SUCCESS;\n}\n<commit_msg>Stack Alloc -> Refactored stack_alloc() to return memory_block.<commit_after>\n\/*\n * BSD 3-Clause License\n *\n * Copyright (c) 2017, mtezych\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 * * 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,\n * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER 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 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,\n * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\n#if defined(__linux__)\n\n    \/\/ [Linux] - alloca (size_t size) -> void*\n    \/\/ ~ http:\/\/man7.org\/linux\/man-pages\/man3\/alloca.3.html\n    #include <alloca.h>\n\n    \/\/ [GCC] - Common Function Attributes\n    \/\/ ~ https:\/\/gcc.gnu.org\/onlinedocs\/gcc\/Common-Function-Attributes.html\n    #define always_inline __attribute__((always_inline)) inline\n\n#elif defined(_WIN32)\n\n    \/\/ [Microsoft CRT] - _alloca (size_t size) -> void*\n    \/\/ ~ https:\/\/docs.microsoft.com\/en-us\/cpp\/c-runtime-library\/reference\/alloca\n    #include <malloc.h>\n\n    \/\/ [Micrsoft Visual C++] - Inline Functions\n    \/\/ ~ https:\/\/docs.microsoft.com\/en-us\/cpp\/cpp\/inline-functions-cpp\n    #define always_inline __forceinline\n\n#else\n\n    #error \"Unsupported platform!\"\n\n#endif\n\n\n#include <cassert>\n\n#include <cstddef>\n\nnamespace cxx\n{\n    template <typename type>\n    struct memory_block\n    {\n        type*          addr;\n        std::ptrdiff_t size;\n    };\n\n    \/\/\n    \/\/ The stack_alloc() function only allocates memory.\n    \/\/ It does *not* create C++ objects under rules of the C++ abstract machine.\n    \/\/\n    \/\/ Therefore, client code is required to\n    \/\/ call placement new operator to create a C++ object.\n    \/\/\n    \/\/ ~ https:\/\/groups.google.com\/a\/isocpp.org\/d\/msg\/std-discussion\/rt2ivJnc4hg\/4RKYJeF5CQAJ\n    \/\/\n    template <typename type>\n    always_inline\n    auto stack_alloc (const std::ptrdiff_t count = 1) noexcept -> memory_block<type>\n    {\n        assert(count > 0);\n\n    #if defined(__linux__)\n\n        return { static_cast<type*>( alloca(sizeof(type) * count)), count };\n\n    #elif defined(_WIN32)\n\n        return { static_cast<type*>(_alloca(sizeof(type) * count)), count };\n\n    #endif\n    }\n}\n\n\n#include <new>\n\nnamespace cxx\n{\n    template <typename element>\n    class stack_array\n    {\n    private:\n\n        memory_block<element> storage;\n        std::ptrdiff_t        length;\n\n    public:\n\n        always_inline\n        explicit stack_array (const std::ptrdiff_t capacity)\n        :\n            storage { stack_alloc<element>(capacity) },\n            length  { 0                              }\n        {\n            assert(capacity > 0);\n        }\n\n        ~stack_array () = default;\n\n        stack_array (stack_array&& array)      = delete;\n        stack_array (const stack_array& array) = delete;\n\n        stack_array& operator = (stack_array&& array)      = delete;\n        stack_array& operator = (const stack_array& array) = delete;\n\n        auto data () noexcept -> element*\n        {\n            return storage.addr;\n        }\n\n        auto data () const noexcept -> const element*\n        {\n            return storage.addr;\n        }\n\n        auto size () const noexcept -> std::ptrdiff_t\n        {\n            return length;\n        }\n\n        auto capacity () const noexcept -> std::ptrdiff_t\n        {\n            return storage.size;\n        }\n\n        auto push (const element& value) -> void\n        {\n            assert(length < storage.size);\n\n            new (storage.addr + length) element(value);\n\n            ++length;\n        }\n\n        auto push (element&& value) -> void\n        {\n            assert(length < storage.size);\n\n            new (storage.addr + length) element(std::move(value));\n\n            ++length;\n        }\n\n        auto operator [] (const std::ptrdiff_t index) noexcept -> element&\n        {\n            assert((index >= 0) && (index < length));\n\n            return storage.addr[index];\n        }\n\n        auto operator [] (const std::ptrdiff_t index) const noexcept -> const element&\n        {\n            assert((index >= 0) && (index < length));\n\n            return storage.addr[index];\n        }\n    };\n}\n\n\n#include <algorithm>\n\n#include <numeric>\n\nnamespace test\n{\n    auto stack_alloc () -> bool\n    {\n        const auto array = cxx::stack_alloc<int>(4096);\n\n        for (auto i = 0; i < array.size; ++i)\n        {\n            new (array.addr + i) int { 1 };\n        }\n\n        \/\/ std::fill(array.data, array.data + array.size, 1);\n\n        auto sum = std::accumulate(array.addr, array.addr + array.size, 0);\n\n        return sum == array.size;\n    }\n\n    auto stack_array () -> bool\n    {\n        auto array = cxx::stack_array<int> { 4096 };\n\n        for (auto i = 0; i < array.capacity(); ++i)\n        {\n            array.push(1);\n        }\n\n        \/\/ std::fill(array.data(), array.data() + array.size(), 1);\n\n        auto sum = std::accumulate(array.data(), array.data() + array.size(), 0);\n\n        return sum == array.size();\n    }\n}\n\n\n#include <cstdlib>\n\nauto main () -> int\n{\n    const auto validate = [] (const bool condition)\n    {\n        if (!condition)\n        {\n            std::exit(EXIT_FAILURE);\n        }\n    };\n\n    validate(test::stack_alloc());\n    validate(test::stack_array());\n\n    return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"global_info.h\"\n#include \"sqlext.h\"\n\nconst char* ODBC_DRIVER_NAME = \"Simplic.CDN.ODBC ANSI\";\n\nGlobalInfo* GlobalInfo::_singletonInstance = NULL;\n\nGlobalInfo::GlobalInfo(HINSTANCE hInstance)\n{\n\tm_hInstance = hInstance;\n\tm_info_initialized = false;\n}\n\nGlobalInfo::~GlobalInfo()\n{\n}\n\nvoid GlobalInfo::initializeInfo()\n{\n\tm_info.addField(SQL_DRIVER_NAME, new StringInfoField(\"Simplic.CDN.ODBC.dll\"));\n\tm_info.addField(SQL_DRIVER_ODBC_VER, new StringInfoField(\"03.00\"));\n\n\tm_info.addField(SQL_CURSOR_COMMIT_BEHAVIOR, new FixedSizeInfoField<SQLUSMALLINT>(SQL_CB_CLOSE));\n\tm_info.addField(SQL_CURSOR_ROLLBACK_BEHAVIOR, new FixedSizeInfoField<SQLUSMALLINT>(SQL_CB_CLOSE));\n\tm_info.addField(SQL_GETDATA_EXTENSIONS, new FixedSizeInfoField<SQLUINTEGER>(0));\n\t\n\tm_info.addField(SQL_MAX_CATALOG_NAME_LEN, new FixedSizeInfoField<SQLUSMALLINT>(0));\n\tm_info.addField(SQL_MAX_SCHEMA_NAME_LEN, new FixedSizeInfoField<SQLUSMALLINT>(0));\n\tm_info.addField(SQL_TXN_CAPABLE, new FixedSizeInfoField<SQLUSMALLINT>(0));\n\tm_info.addField(SQL_IDENTIFIER_CASE, new FixedSizeInfoField<SQLUSMALLINT>(SQL_IC_MIXED));\n\tm_info.addField(SQL_SEARCH_PATTERN_ESCAPE, new StringInfoField(\"\"));\n\tm_info.addField(SQL_QUALIFIER_NAME_SEPARATOR, new StringInfoField(\".\"));\n\tm_info.addField(SQL_NON_NULLABLE_COLUMNS, new FixedSizeInfoField<SQLUSMALLINT>(SQL_NNC_NON_NULL));\n\tm_info.addField(SQL_SCROLL_CONCURRENCY, new FixedSizeInfoField<SQLUINTEGER>(0));\n\tm_info.addField(SQL_TXN_ISOLATION_OPTION, new FixedSizeInfoField<SQLUINTEGER>(0));\n\n\tm_info.addField(SQL_DBMS_VER, new StringInfoField(\"00.00.0000\"));\n\tm_info.addField(SQL_DBMS_NAME, new StringInfoField(\"Simplic.CDN.ODBC\"));\n}\n\nvoid GlobalInfo::createSingletonInstance(HINSTANCE hInstance)\n{\n\t_singletonInstance = new GlobalInfo(hInstance); \n\t_singletonInstance->initializeInfo();\n}\n\n\nvoid GlobalInfo::deleteSingletonInstance()\n{\n\tif (_singletonInstance != NULL) delete _singletonInstance;\n}\n\nstd::string GlobalInfo::getDriverPath() const\n{\n\tchar buf[MAX_PATH] = {0};\n\tGetModuleFileNameA(m_hInstance, buf, MAX_PATH);\n\treturn std::string(buf);\n}\n\nOdbcInfoField* GlobalInfo::getInfoField(DbConnection* conn, SQLUSMALLINT type)\n{\n\t\/\/ TODO: Support querying information from the DbConnection, \n\t\/\/ if any is provided to us\n\treturn m_info.getField(type);\n}\n<commit_msg>Set odbc details<commit_after>#include \"stdafx.h\"\n#include \"global_info.h\"\n#include \"sqlext.h\"\n\nconst char* ODBC_DRIVER_NAME = \"Simplic.CDN.ODBC ANSI\";\n\nGlobalInfo* GlobalInfo::_singletonInstance = NULL;\n\nGlobalInfo::GlobalInfo(HINSTANCE hInstance)\n{\n\tm_hInstance = hInstance;\n\tm_info_initialized = false;\n}\n\nGlobalInfo::~GlobalInfo()\n{\n}\n\nvoid GlobalInfo::initializeInfo()\n{\n\tm_info.addField(SQL_DRIVER_NAME, new StringInfoField(\"Simplic.CDN.ODBC.dll\"));\n\tm_info.addField(SQL_DRIVER_ODBC_VER, new StringInfoField(\"03.00\"));\n\n\tm_info.addField(SQL_CURSOR_COMMIT_BEHAVIOR, new FixedSizeInfoField<SQLUSMALLINT>(SQL_CB_CLOSE));\n\tm_info.addField(SQL_CURSOR_ROLLBACK_BEHAVIOR, new FixedSizeInfoField<SQLUSMALLINT>(SQL_CB_CLOSE));\n\tm_info.addField(SQL_GETDATA_EXTENSIONS, new FixedSizeInfoField<SQLUINTEGER>(0));\n\t\n\tm_info.addField(SQL_MAX_CATALOG_NAME_LEN, new FixedSizeInfoField<SQLUSMALLINT>(0));\n\tm_info.addField(SQL_MAX_SCHEMA_NAME_LEN, new FixedSizeInfoField<SQLUSMALLINT>(0));\n\tm_info.addField(SQL_TXN_CAPABLE, new FixedSizeInfoField<SQLUSMALLINT>(0));\n\tm_info.addField(SQL_IDENTIFIER_CASE, new FixedSizeInfoField<SQLUSMALLINT>(SQL_IC_MIXED));\n\tm_info.addField(SQL_SEARCH_PATTERN_ESCAPE, new StringInfoField(\"\"));\n\tm_info.addField(SQL_QUALIFIER_NAME_SEPARATOR, new StringInfoField(\".\"));\n\tm_info.addField(SQL_NON_NULLABLE_COLUMNS, new FixedSizeInfoField<SQLUSMALLINT>(SQL_NNC_NON_NULL));\n\tm_info.addField(SQL_SCROLL_CONCURRENCY, new FixedSizeInfoField<SQLUINTEGER>(0));\n\tm_info.addField(SQL_TXN_ISOLATION_OPTION, new FixedSizeInfoField<SQLUINTEGER>(0));\n\n\tm_info.addField(SQL_DBMS_VER, new StringInfoField(\"00.01.1300\"));\n\tm_info.addField(SQL_DBMS_NAME, new StringInfoField(\"Simplic.CDN\"));\n}\n\nvoid GlobalInfo::createSingletonInstance(HINSTANCE hInstance)\n{\n\t_singletonInstance = new GlobalInfo(hInstance); \n\t_singletonInstance->initializeInfo();\n}\n\n\nvoid GlobalInfo::deleteSingletonInstance()\n{\n\tif (_singletonInstance != NULL) delete _singletonInstance;\n}\n\nstd::string GlobalInfo::getDriverPath() const\n{\n\tchar buf[MAX_PATH] = {0};\n\tGetModuleFileNameA(m_hInstance, buf, MAX_PATH);\n\treturn std::string(buf);\n}\n\nOdbcInfoField* GlobalInfo::getInfoField(DbConnection* conn, SQLUSMALLINT type)\n{\n\t\/\/ TODO: Support querying information from the DbConnection, \n\t\/\/ if any is provided to us\n\treturn m_info.getField(type);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2012 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\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 \"platform\/graphics\/DeferredImageDecoder.h\"\n\n#include \"platform\/graphics\/DecodingImageGenerator.h\"\n#include \"platform\/graphics\/ImageDecodingStore.h\"\n#include \"platform\/graphics\/LazyDecodingPixelRef.h\"\n#include \"third_party\/skia\/include\/core\/SkImageInfo.h\"\n#include \"wtf\/PassOwnPtr.h\"\n\nnamespace WebCore {\n\nnamespace {\n\n\/\/ URI label for a lazily decoded SkPixelRef.\nconst char labelLazyDecoded[] = \"lazy\";\n\n\/\/ URI label for SkDiscardablePixelRef.\nconst char labelDiscardable[] = \"discardable\";\n\n} \/\/ namespace\n\nbool DeferredImageDecoder::s_enabled = false;\nbool DeferredImageDecoder::s_skiaDiscardableMemoryEnabled = false;\n\nDeferredImageDecoder::DeferredImageDecoder(PassOwnPtr<ImageDecoder> actualDecoder)\n    : m_allDataReceived(false)\n    , m_lastDataSize(0)\n    , m_dataChanged(false)\n    , m_actualDecoder(actualDecoder)\n    , m_orientation(DefaultImageOrientation)\n    , m_repetitionCount(cAnimationNone)\n    , m_hasColorProfile(false)\n{\n}\n\nDeferredImageDecoder::~DeferredImageDecoder()\n{\n}\n\nPassOwnPtr<DeferredImageDecoder> DeferredImageDecoder::create(const SharedBuffer& data, ImageSource::AlphaOption alphaOption, ImageSource::GammaAndColorProfileOption gammaAndColorOption)\n{\n    OwnPtr<ImageDecoder> actualDecoder = ImageDecoder::create(data, alphaOption, gammaAndColorOption);\n    return actualDecoder ? adoptPtr(new DeferredImageDecoder(actualDecoder.release())) : nullptr;\n}\n\nPassOwnPtr<DeferredImageDecoder> DeferredImageDecoder::createForTesting(PassOwnPtr<ImageDecoder> decoder)\n{\n    return adoptPtr(new DeferredImageDecoder(decoder));\n}\n\nbool DeferredImageDecoder::isLazyDecoded(const SkBitmap& bitmap)\n{\n    return bitmap.pixelRef()\n        && bitmap.pixelRef()->getURI()\n        && (!memcmp(bitmap.pixelRef()->getURI(), labelLazyDecoded, sizeof(labelLazyDecoded))\n            || !memcmp(bitmap.pixelRef()->getURI(), labelDiscardable, sizeof(labelDiscardable)));\n}\n\nvoid DeferredImageDecoder::setEnabled(bool enabled)\n{\n    s_enabled = enabled;\n    \/\/ FIXME: Remove all non-discardable memory related code now that this is\n    \/\/ used on all platforms.\n    s_skiaDiscardableMemoryEnabled = enabled;\n    if (enabled)\n        ImageDecodingStore::setImageCachingEnabled(false);\n}\n\nbool DeferredImageDecoder::enabled()\n{\n    return s_enabled;\n}\n\nString DeferredImageDecoder::filenameExtension() const\n{\n    return m_actualDecoder ? m_actualDecoder->filenameExtension() : m_filenameExtension;\n}\n\nImageFrame* DeferredImageDecoder::frameBufferAtIndex(size_t index)\n{\n    prepareLazyDecodedFrames();\n    if (index < m_lazyDecodedFrames.size()) {\n        \/\/ ImageFrameGenerator has the latest known alpha state. There will\n        \/\/ be a performance boost if this frame is opaque.\n        m_lazyDecodedFrames[index]->setHasAlpha(m_frameGenerator->hasAlpha(index));\n        return m_lazyDecodedFrames[index].get();\n    }\n    if (m_actualDecoder)\n        return m_actualDecoder->frameBufferAtIndex(index);\n    return 0;\n}\n\nvoid DeferredImageDecoder::setData(SharedBuffer& data, bool allDataReceived)\n{\n    if (m_actualDecoder) {\n        const bool firstData = !m_data;\n        const bool moreData = data.size() > m_lastDataSize;\n        m_dataChanged = firstData || moreData;\n        m_data = RefPtr<SharedBuffer>(data);\n        m_lastDataSize = data.size();\n        m_allDataReceived = allDataReceived;\n        m_actualDecoder->setData(&data, allDataReceived);\n        prepareLazyDecodedFrames();\n    }\n\n    if (m_frameGenerator)\n        m_frameGenerator->setData(&data, allDataReceived);\n}\n\nbool DeferredImageDecoder::isSizeAvailable()\n{\n    \/\/ m_actualDecoder is 0 only if image decoding is deferred and that\n    \/\/ means image header decoded successfully and size is available.\n    return m_actualDecoder ? m_actualDecoder->isSizeAvailable() : true;\n}\n\nbool DeferredImageDecoder::hasColorProfile() const\n{\n    return m_actualDecoder ? m_actualDecoder->hasColorProfile() : m_hasColorProfile;\n}\n\nIntSize DeferredImageDecoder::size() const\n{\n    return m_actualDecoder ? m_actualDecoder->size() : m_size;\n}\n\nIntSize DeferredImageDecoder::frameSizeAtIndex(size_t index) const\n{\n    \/\/ FIXME: LocalFrame size is assumed to be uniform. This might not be true for\n    \/\/ future supported codecs.\n    return m_actualDecoder ? m_actualDecoder->frameSizeAtIndex(index) : m_size;\n}\n\nsize_t DeferredImageDecoder::frameCount()\n{\n    return m_actualDecoder ? m_actualDecoder->frameCount() : m_lazyDecodedFrames.size();\n}\n\nint DeferredImageDecoder::repetitionCount() const\n{\n    return m_actualDecoder ? m_actualDecoder->repetitionCount() : m_repetitionCount;\n}\n\nsize_t DeferredImageDecoder::clearCacheExceptFrame(size_t clearExceptFrame)\n{\n    \/\/ If image decoding is deferred then frame buffer cache is managed by\n    \/\/ the compositor and this call is ignored.\n    return m_actualDecoder ? m_actualDecoder->clearCacheExceptFrame(clearExceptFrame) : 0;\n}\n\nbool DeferredImageDecoder::frameHasAlphaAtIndex(size_t index) const\n{\n    if (m_actualDecoder)\n        return m_actualDecoder->frameHasAlphaAtIndex(index);\n    if (!m_frameGenerator->isMultiFrame())\n        return m_frameGenerator->hasAlpha(index);\n    return true;\n}\n\nbool DeferredImageDecoder::frameIsCompleteAtIndex(size_t index) const\n{\n    if (m_actualDecoder)\n        return m_actualDecoder->frameIsCompleteAtIndex(index);\n    if (index < m_lazyDecodedFrames.size())\n        return m_lazyDecodedFrames[index]->status() == ImageFrame::FrameComplete;\n    return false;\n}\n\nfloat DeferredImageDecoder::frameDurationAtIndex(size_t index) const\n{\n    if (m_actualDecoder)\n        return m_actualDecoder->frameDurationAtIndex(index);\n    if (index < m_lazyDecodedFrames.size())\n        return m_lazyDecodedFrames[index]->duration();\n    return 0;\n}\n\nunsigned DeferredImageDecoder::frameBytesAtIndex(size_t index) const\n{\n    \/\/ If frame decoding is deferred then it is not managed by MemoryCache\n    \/\/ so return 0 here.\n    return m_frameGenerator ? 0 : m_actualDecoder->frameBytesAtIndex(index);\n}\n\nImageOrientation DeferredImageDecoder::orientation() const\n{\n    return m_actualDecoder ? m_actualDecoder->orientation() : m_orientation;\n}\n\nvoid DeferredImageDecoder::activateLazyDecoding()\n{\n    if (m_frameGenerator)\n        return;\n    m_size = m_actualDecoder->size();\n    m_orientation = m_actualDecoder->orientation();\n    m_filenameExtension = m_actualDecoder->filenameExtension();\n    m_hasColorProfile = m_actualDecoder->hasColorProfile();\n    const bool isSingleFrame = m_actualDecoder->repetitionCount() == cAnimationNone || (m_allDataReceived && m_actualDecoder->frameCount() == 1u);\n    m_frameGenerator = ImageFrameGenerator::create(SkISize::Make(m_actualDecoder->decodedSize().width(), m_actualDecoder->decodedSize().height()), m_data, m_allDataReceived, !isSingleFrame);\n}\n\nvoid DeferredImageDecoder::prepareLazyDecodedFrames()\n{\n    if (!s_enabled\n        || !m_actualDecoder\n        || !m_actualDecoder->isSizeAvailable()\n        || m_actualDecoder->filenameExtension() == \"ico\")\n        return;\n\n    activateLazyDecoding();\n\n    const size_t previousSize = m_lazyDecodedFrames.size();\n    m_lazyDecodedFrames.resize(m_actualDecoder->frameCount());\n\n    \/\/ We have encountered a broken image file. Simply bail.\n    if (m_lazyDecodedFrames.size() < previousSize)\n        return;\n\n    for (size_t i = previousSize; i < m_lazyDecodedFrames.size(); ++i) {\n        OwnPtr<ImageFrame> frame(adoptPtr(new ImageFrame()));\n        frame->setSkBitmap(createBitmap(i));\n        frame->setDuration(m_actualDecoder->frameDurationAtIndex(i));\n        frame->setStatus(m_actualDecoder->frameIsCompleteAtIndex(i) ? ImageFrame::FrameComplete : ImageFrame::FramePartial);\n        m_lazyDecodedFrames[i] = frame.release();\n    }\n\n    \/\/ The last lazy decoded frame created from previous call might be\n    \/\/ incomplete so update its state.\n    if (previousSize) {\n        const size_t lastFrame = previousSize - 1;\n        m_lazyDecodedFrames[lastFrame]->setStatus(m_actualDecoder->frameIsCompleteAtIndex(lastFrame) ? ImageFrame::FrameComplete : ImageFrame::FramePartial);\n\n        \/\/ If data has changed then create a new bitmap. This forces\n        \/\/ Skia to decode again.\n        if (m_dataChanged) {\n            m_dataChanged = false;\n            m_lazyDecodedFrames[lastFrame]->setSkBitmap(createBitmap(lastFrame));\n        }\n    }\n\n    if (m_allDataReceived) {\n        m_repetitionCount = m_actualDecoder->repetitionCount();\n        m_actualDecoder.clear();\n        m_data = nullptr;\n    }\n}\n\n\/\/ Creates either a SkBitmap backed by SkDiscardablePixelRef or a SkBitmap using the\n\/\/ legacy LazyDecodingPixelRef.\nSkBitmap DeferredImageDecoder::createBitmap(size_t index)\n{\n    \/\/ This code is temporary until the transition to SkDiscardablePixelRef is complete.\n    if (s_skiaDiscardableMemoryEnabled)\n        return createSkiaDiscardableBitmap(index);\n    return createLazyDecodingBitmap(index);\n}\n\n\/\/ Creates a SkBitmap that is backed by SkDiscardablePixelRef.\nSkBitmap DeferredImageDecoder::createSkiaDiscardableBitmap(size_t index)\n{\n    IntSize decodedSize = m_actualDecoder->decodedSize();\n    ASSERT(decodedSize.width() > 0);\n    ASSERT(decodedSize.height() > 0);\n\n    SkImageInfo info;\n    info.fWidth = decodedSize.width();\n    info.fHeight = decodedSize.height();\n    info.fColorType = kBGRA_8888_SkColorType;\n    info.fAlphaType = kPremul_SkAlphaType;\n\n    SkBitmap bitmap;\n    DecodingImageGenerator* generator = new DecodingImageGenerator(m_frameGenerator, info, index);\n    bool installed = SkInstallDiscardablePixelRef(generator, &bitmap);\n    ASSERT_UNUSED(installed, installed);\n    bitmap.pixelRef()->setURI(labelDiscardable);\n    generator->setGenerationId(bitmap.getGenerationID());\n    return bitmap;\n}\n\nSkBitmap DeferredImageDecoder::createLazyDecodingBitmap(size_t index)\n{\n    IntSize decodedSize = m_actualDecoder->decodedSize();\n    ASSERT(decodedSize.width() > 0);\n    ASSERT(decodedSize.height() > 0);\n\n    SkImageInfo info;\n    info.fWidth = decodedSize.width();\n    info.fHeight = decodedSize.height();\n    info.fColorType = kPMColor_SkColorType;\n    info.fAlphaType = kPremul_SkAlphaType;\n\n    \/\/ Creates a lazily decoded SkPixelRef that references the entire image without scaling.\n    SkBitmap bitmap;\n    bitmap.setConfig(info);\n    bitmap.setPixelRef(new LazyDecodingPixelRef(info, m_frameGenerator, index))->unref();\n\n    \/\/ Use the URI to identify this as a lazily decoded SkPixelRef of type LazyDecodingPixelRef.\n    \/\/ FIXME: It would be more useful to give the actual image URI.\n    bitmap.pixelRef()->setURI(labelLazyDecoded);\n\n    \/\/ Inform the bitmap that we will never change the pixels. This is a performance hint\n    \/\/ subsystems that may try to cache this bitmap (e.g. pictures, pipes, gpu, pdf, etc.)\n    bitmap.setImmutable();\n\n    return bitmap;\n}\n\nbool DeferredImageDecoder::hotSpot(IntPoint& hotSpot) const\n{\n    \/\/ TODO: Implement.\n    return m_actualDecoder ? m_actualDecoder->hotSpot(hotSpot) : false;\n}\n\n} \/\/ namespace WebCore\n<commit_msg>Revert 173540 \"Use skia discardable memory for decoded images on...\"<commit_after>\/*\n * Copyright (C) 2012 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\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 \"platform\/graphics\/DeferredImageDecoder.h\"\n\n#include \"platform\/graphics\/DecodingImageGenerator.h\"\n#include \"platform\/graphics\/ImageDecodingStore.h\"\n#include \"platform\/graphics\/LazyDecodingPixelRef.h\"\n#include \"third_party\/skia\/include\/core\/SkImageInfo.h\"\n#include \"wtf\/PassOwnPtr.h\"\n\nnamespace WebCore {\n\nnamespace {\n\n\/\/ URI label for a lazily decoded SkPixelRef.\nconst char labelLazyDecoded[] = \"lazy\";\n\n\/\/ URI label for SkDiscardablePixelRef.\nconst char labelDiscardable[] = \"discardable\";\n\n} \/\/ namespace\n\nbool DeferredImageDecoder::s_enabled = false;\nbool DeferredImageDecoder::s_skiaDiscardableMemoryEnabled = false;\n\nDeferredImageDecoder::DeferredImageDecoder(PassOwnPtr<ImageDecoder> actualDecoder)\n    : m_allDataReceived(false)\n    , m_lastDataSize(0)\n    , m_dataChanged(false)\n    , m_actualDecoder(actualDecoder)\n    , m_orientation(DefaultImageOrientation)\n    , m_repetitionCount(cAnimationNone)\n    , m_hasColorProfile(false)\n{\n}\n\nDeferredImageDecoder::~DeferredImageDecoder()\n{\n}\n\nPassOwnPtr<DeferredImageDecoder> DeferredImageDecoder::create(const SharedBuffer& data, ImageSource::AlphaOption alphaOption, ImageSource::GammaAndColorProfileOption gammaAndColorOption)\n{\n    OwnPtr<ImageDecoder> actualDecoder = ImageDecoder::create(data, alphaOption, gammaAndColorOption);\n    return actualDecoder ? adoptPtr(new DeferredImageDecoder(actualDecoder.release())) : nullptr;\n}\n\nPassOwnPtr<DeferredImageDecoder> DeferredImageDecoder::createForTesting(PassOwnPtr<ImageDecoder> decoder)\n{\n    return adoptPtr(new DeferredImageDecoder(decoder));\n}\n\nbool DeferredImageDecoder::isLazyDecoded(const SkBitmap& bitmap)\n{\n    return bitmap.pixelRef()\n        && bitmap.pixelRef()->getURI()\n        && (!memcmp(bitmap.pixelRef()->getURI(), labelLazyDecoded, sizeof(labelLazyDecoded))\n            || !memcmp(bitmap.pixelRef()->getURI(), labelDiscardable, sizeof(labelDiscardable)));\n}\n\nvoid DeferredImageDecoder::setEnabled(bool enabled)\n{\n    s_enabled = enabled;\n#if !OS(ANDROID)\n    \/\/ FIXME: This code is temporary to enable discardable memory for\n    \/\/ non-Android platforms. In the future all platforms will be\n    \/\/ the same and we can remove this code.\n    s_skiaDiscardableMemoryEnabled = enabled;\n    if (enabled)\n        ImageDecodingStore::setImageCachingEnabled(false);\n#endif\n}\n\nbool DeferredImageDecoder::enabled()\n{\n    return s_enabled;\n}\n\nString DeferredImageDecoder::filenameExtension() const\n{\n    return m_actualDecoder ? m_actualDecoder->filenameExtension() : m_filenameExtension;\n}\n\nImageFrame* DeferredImageDecoder::frameBufferAtIndex(size_t index)\n{\n    prepareLazyDecodedFrames();\n    if (index < m_lazyDecodedFrames.size()) {\n        \/\/ ImageFrameGenerator has the latest known alpha state. There will\n        \/\/ be a performance boost if this frame is opaque.\n        m_lazyDecodedFrames[index]->setHasAlpha(m_frameGenerator->hasAlpha(index));\n        return m_lazyDecodedFrames[index].get();\n    }\n    if (m_actualDecoder)\n        return m_actualDecoder->frameBufferAtIndex(index);\n    return 0;\n}\n\nvoid DeferredImageDecoder::setData(SharedBuffer& data, bool allDataReceived)\n{\n    if (m_actualDecoder) {\n        const bool firstData = !m_data;\n        const bool moreData = data.size() > m_lastDataSize;\n        m_dataChanged = firstData || moreData;\n        m_data = RefPtr<SharedBuffer>(data);\n        m_lastDataSize = data.size();\n        m_allDataReceived = allDataReceived;\n        m_actualDecoder->setData(&data, allDataReceived);\n        prepareLazyDecodedFrames();\n    }\n\n    if (m_frameGenerator)\n        m_frameGenerator->setData(&data, allDataReceived);\n}\n\nbool DeferredImageDecoder::isSizeAvailable()\n{\n    \/\/ m_actualDecoder is 0 only if image decoding is deferred and that\n    \/\/ means image header decoded successfully and size is available.\n    return m_actualDecoder ? m_actualDecoder->isSizeAvailable() : true;\n}\n\nbool DeferredImageDecoder::hasColorProfile() const\n{\n    return m_actualDecoder ? m_actualDecoder->hasColorProfile() : m_hasColorProfile;\n}\n\nIntSize DeferredImageDecoder::size() const\n{\n    return m_actualDecoder ? m_actualDecoder->size() : m_size;\n}\n\nIntSize DeferredImageDecoder::frameSizeAtIndex(size_t index) const\n{\n    \/\/ FIXME: LocalFrame size is assumed to be uniform. This might not be true for\n    \/\/ future supported codecs.\n    return m_actualDecoder ? m_actualDecoder->frameSizeAtIndex(index) : m_size;\n}\n\nsize_t DeferredImageDecoder::frameCount()\n{\n    return m_actualDecoder ? m_actualDecoder->frameCount() : m_lazyDecodedFrames.size();\n}\n\nint DeferredImageDecoder::repetitionCount() const\n{\n    return m_actualDecoder ? m_actualDecoder->repetitionCount() : m_repetitionCount;\n}\n\nsize_t DeferredImageDecoder::clearCacheExceptFrame(size_t clearExceptFrame)\n{\n    \/\/ If image decoding is deferred then frame buffer cache is managed by\n    \/\/ the compositor and this call is ignored.\n    return m_actualDecoder ? m_actualDecoder->clearCacheExceptFrame(clearExceptFrame) : 0;\n}\n\nbool DeferredImageDecoder::frameHasAlphaAtIndex(size_t index) const\n{\n    if (m_actualDecoder)\n        return m_actualDecoder->frameHasAlphaAtIndex(index);\n    if (!m_frameGenerator->isMultiFrame())\n        return m_frameGenerator->hasAlpha(index);\n    return true;\n}\n\nbool DeferredImageDecoder::frameIsCompleteAtIndex(size_t index) const\n{\n    if (m_actualDecoder)\n        return m_actualDecoder->frameIsCompleteAtIndex(index);\n    if (index < m_lazyDecodedFrames.size())\n        return m_lazyDecodedFrames[index]->status() == ImageFrame::FrameComplete;\n    return false;\n}\n\nfloat DeferredImageDecoder::frameDurationAtIndex(size_t index) const\n{\n    if (m_actualDecoder)\n        return m_actualDecoder->frameDurationAtIndex(index);\n    if (index < m_lazyDecodedFrames.size())\n        return m_lazyDecodedFrames[index]->duration();\n    return 0;\n}\n\nunsigned DeferredImageDecoder::frameBytesAtIndex(size_t index) const\n{\n    \/\/ If frame decoding is deferred then it is not managed by MemoryCache\n    \/\/ so return 0 here.\n    return m_frameGenerator ? 0 : m_actualDecoder->frameBytesAtIndex(index);\n}\n\nImageOrientation DeferredImageDecoder::orientation() const\n{\n    return m_actualDecoder ? m_actualDecoder->orientation() : m_orientation;\n}\n\nvoid DeferredImageDecoder::activateLazyDecoding()\n{\n    if (m_frameGenerator)\n        return;\n    m_size = m_actualDecoder->size();\n    m_orientation = m_actualDecoder->orientation();\n    m_filenameExtension = m_actualDecoder->filenameExtension();\n    m_hasColorProfile = m_actualDecoder->hasColorProfile();\n    const bool isSingleFrame = m_actualDecoder->repetitionCount() == cAnimationNone || (m_allDataReceived && m_actualDecoder->frameCount() == 1u);\n    m_frameGenerator = ImageFrameGenerator::create(SkISize::Make(m_actualDecoder->decodedSize().width(), m_actualDecoder->decodedSize().height()), m_data, m_allDataReceived, !isSingleFrame);\n}\n\nvoid DeferredImageDecoder::prepareLazyDecodedFrames()\n{\n    if (!s_enabled\n        || !m_actualDecoder\n        || !m_actualDecoder->isSizeAvailable()\n        || m_actualDecoder->filenameExtension() == \"ico\")\n        return;\n\n    activateLazyDecoding();\n\n    const size_t previousSize = m_lazyDecodedFrames.size();\n    m_lazyDecodedFrames.resize(m_actualDecoder->frameCount());\n\n    \/\/ We have encountered a broken image file. Simply bail.\n    if (m_lazyDecodedFrames.size() < previousSize)\n        return;\n\n    for (size_t i = previousSize; i < m_lazyDecodedFrames.size(); ++i) {\n        OwnPtr<ImageFrame> frame(adoptPtr(new ImageFrame()));\n        frame->setSkBitmap(createBitmap(i));\n        frame->setDuration(m_actualDecoder->frameDurationAtIndex(i));\n        frame->setStatus(m_actualDecoder->frameIsCompleteAtIndex(i) ? ImageFrame::FrameComplete : ImageFrame::FramePartial);\n        m_lazyDecodedFrames[i] = frame.release();\n    }\n\n    \/\/ The last lazy decoded frame created from previous call might be\n    \/\/ incomplete so update its state.\n    if (previousSize) {\n        const size_t lastFrame = previousSize - 1;\n        m_lazyDecodedFrames[lastFrame]->setStatus(m_actualDecoder->frameIsCompleteAtIndex(lastFrame) ? ImageFrame::FrameComplete : ImageFrame::FramePartial);\n\n        \/\/ If data has changed then create a new bitmap. This forces\n        \/\/ Skia to decode again.\n        if (m_dataChanged) {\n            m_dataChanged = false;\n            m_lazyDecodedFrames[lastFrame]->setSkBitmap(createBitmap(lastFrame));\n        }\n    }\n\n    if (m_allDataReceived) {\n        m_repetitionCount = m_actualDecoder->repetitionCount();\n        m_actualDecoder.clear();\n        m_data = nullptr;\n    }\n}\n\n\/\/ Creates either a SkBitmap backed by SkDiscardablePixelRef or a SkBitmap using the\n\/\/ legacy LazyDecodingPixelRef.\nSkBitmap DeferredImageDecoder::createBitmap(size_t index)\n{\n    \/\/ This code is temporary until the transition to SkDiscardablePixelRef is complete.\n    if (s_skiaDiscardableMemoryEnabled)\n        return createSkiaDiscardableBitmap(index);\n    return createLazyDecodingBitmap(index);\n}\n\n\/\/ Creates a SkBitmap that is backed by SkDiscardablePixelRef.\nSkBitmap DeferredImageDecoder::createSkiaDiscardableBitmap(size_t index)\n{\n    IntSize decodedSize = m_actualDecoder->decodedSize();\n    ASSERT(decodedSize.width() > 0);\n    ASSERT(decodedSize.height() > 0);\n\n    SkImageInfo info;\n    info.fWidth = decodedSize.width();\n    info.fHeight = decodedSize.height();\n    info.fColorType = kBGRA_8888_SkColorType;\n    info.fAlphaType = kPremul_SkAlphaType;\n\n    SkBitmap bitmap;\n    DecodingImageGenerator* generator = new DecodingImageGenerator(m_frameGenerator, info, index);\n    bool installed = SkInstallDiscardablePixelRef(generator, &bitmap);\n    ASSERT_UNUSED(installed, installed);\n    bitmap.pixelRef()->setURI(labelDiscardable);\n    generator->setGenerationId(bitmap.getGenerationID());\n    return bitmap;\n}\n\nSkBitmap DeferredImageDecoder::createLazyDecodingBitmap(size_t index)\n{\n    IntSize decodedSize = m_actualDecoder->decodedSize();\n    ASSERT(decodedSize.width() > 0);\n    ASSERT(decodedSize.height() > 0);\n\n    SkImageInfo info;\n    info.fWidth = decodedSize.width();\n    info.fHeight = decodedSize.height();\n    info.fColorType = kPMColor_SkColorType;\n    info.fAlphaType = kPremul_SkAlphaType;\n\n    \/\/ Creates a lazily decoded SkPixelRef that references the entire image without scaling.\n    SkBitmap bitmap;\n    bitmap.setConfig(info);\n    bitmap.setPixelRef(new LazyDecodingPixelRef(info, m_frameGenerator, index))->unref();\n\n    \/\/ Use the URI to identify this as a lazily decoded SkPixelRef of type LazyDecodingPixelRef.\n    \/\/ FIXME: It would be more useful to give the actual image URI.\n    bitmap.pixelRef()->setURI(labelLazyDecoded);\n\n    \/\/ Inform the bitmap that we will never change the pixels. This is a performance hint\n    \/\/ subsystems that may try to cache this bitmap (e.g. pictures, pipes, gpu, pdf, etc.)\n    bitmap.setImmutable();\n\n    return bitmap;\n}\n\nbool DeferredImageDecoder::hotSpot(IntPoint& hotSpot) const\n{\n    \/\/ TODO: Implement.\n    return m_actualDecoder ? m_actualDecoder->hotSpot(hotSpot) : false;\n}\n\n} \/\/ namespace WebCore\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 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 \"config.h\"\n#include \"platform\/graphics\/GraphicsContextState.h\"\n\n#include \"platform\/graphics\/skia\/SkiaUtils.h\"\n\nnamespace WebCore {\n\nGraphicsContextState::GraphicsContextState()\n    : m_fillColor(Color::black)\n    , m_fillRule(RULE_NONZERO)\n    , m_textDrawingMode(TextModeFill)\n    , m_alpha(256)\n    , m_xferMode(nullptr)\n    , m_compositeOperator(CompositeSourceOver)\n    , m_blendMode(blink::WebBlendModeNormal)\n    , m_interpolationQuality(InterpolationDefault)\n    , m_saveCount(0)\n    , m_shouldAntialias(true)\n    , m_shouldSmoothFonts(true)\n    , m_shouldClampToSourceRect(true)\n{\n    m_strokePaint.setStyle(SkPaint::kStroke_Style);\n    m_strokePaint.setStrokeWidth(SkFloatToScalar(m_strokeData.thickness()));\n    m_strokePaint.setColor(applyAlpha(m_strokeData.color().rgb()));\n    m_strokePaint.setStrokeCap(SkPaint::kDefault_Cap);\n    m_strokePaint.setStrokeJoin(SkPaint::kDefault_Join);\n    m_strokePaint.setStrokeMiter(SkFloatToScalar(m_strokeData.miterLimit()));\n    m_strokePaint.setFilterLevel(WebCoreInterpolationQualityToSkFilterLevel(m_interpolationQuality));\n    m_strokePaint.setAntiAlias(m_shouldAntialias);\n    m_fillPaint.setColor(applyAlpha(m_fillColor.rgb()));\n    m_fillPaint.setFilterLevel(WebCoreInterpolationQualityToSkFilterLevel(m_interpolationQuality));\n    m_fillPaint.setAntiAlias(m_shouldAntialias);\n}\n\nGraphicsContextState::GraphicsContextState(const GraphicsContextState& other)\n    : m_strokePaint(other.m_strokePaint)\n    , m_fillPaint(other.m_fillPaint)\n    , m_strokeData(other.m_strokeData)\n    , m_fillColor(other.m_fillColor)\n    , m_fillRule(other.m_fillRule)\n    , m_fillGradient(other.m_fillGradient)\n    , m_fillPattern(other.m_fillPattern)\n    , m_looper(other.m_looper)\n    , m_textDrawingMode(other.m_textDrawingMode)\n    , m_alpha(other.m_alpha)\n    , m_xferMode(other.m_xferMode)\n    , m_colorFilter(other.m_colorFilter)\n    , m_compositeOperator(other.m_compositeOperator)\n    , m_blendMode(other.m_blendMode)\n    , m_interpolationQuality(other.m_interpolationQuality)\n    , m_saveCount(0)\n    , m_shouldAntialias(other.m_shouldAntialias)\n    , m_shouldSmoothFonts(other.m_shouldSmoothFonts)\n    , m_shouldClampToSourceRect(other.m_shouldClampToSourceRect) { }\n\nvoid GraphicsContextState::copy(const GraphicsContextState& source)\n{\n    new (this) GraphicsContextState(source);\n}\n\nconst SkPaint& GraphicsContextState::strokePaint(int strokedPathLength) const\n{\n    if (m_strokeData.gradient() && m_strokeData.gradient()->shaderChanged())\n        m_strokePaint.setShader(m_strokeData.gradient()->shader());\n    m_strokeData.setupPaintDashPathEffect(&m_strokePaint, strokedPathLength);\n    return m_strokePaint;\n}\n\nconst SkPaint& GraphicsContextState::fillPaint() const\n{\n    if (m_fillGradient && m_fillGradient->shaderChanged())\n        m_fillPaint.setShader(m_fillGradient->shader());\n    return m_fillPaint;\n}\n\nvoid GraphicsContextState::setStrokeStyle(StrokeStyle style)\n{\n    m_strokeData.setStyle(style);\n}\n\nvoid GraphicsContextState::setStrokeThickness(float thickness)\n{\n    m_strokeData.setThickness(thickness);\n    m_strokePaint.setStrokeWidth(SkFloatToScalar(thickness));\n}\n\nvoid GraphicsContextState::setStrokeColor(const Color& color)\n{\n    m_strokeData.clearGradient();\n    m_strokeData.clearPattern();\n    m_strokeData.setColor(color);\n    m_strokePaint.setColor(applyAlpha(color.rgb()));\n    m_strokePaint.setShader(0);\n}\n\nvoid GraphicsContextState::setStrokeGradient(const PassRefPtr<Gradient> gradient)\n{\n    m_strokeData.setColor(Color::black);\n    m_strokeData.clearPattern();\n    m_strokeData.setGradient(gradient);\n    m_strokePaint.setColor(applyAlpha(SK_ColorBLACK));\n    m_strokePaint.setShader(m_strokeData.gradient()->shader());\n}\n\nvoid GraphicsContextState::clearStrokeGradient()\n{\n    m_strokeData.clearGradient();\n    ASSERT(!m_strokeData.pattern());\n    m_strokePaint.setColor(applyAlpha(m_strokeData.color().rgb()));\n}\n\nvoid GraphicsContextState::setStrokePattern(const PassRefPtr<Pattern> pattern)\n{\n    m_strokeData.setColor(Color::black);\n    m_strokeData.clearGradient();\n    m_strokeData.setPattern(pattern);\n    m_strokePaint.setColor(applyAlpha(SK_ColorBLACK));\n    m_strokePaint.setShader(m_strokeData.pattern()->shader());\n}\n\nvoid GraphicsContextState::clearStrokePattern()\n{\n    m_strokeData.clearPattern();\n    ASSERT(!m_strokeData.gradient());\n    m_strokePaint.setColor(applyAlpha(m_strokeData.color().rgb()));\n}\n\nvoid GraphicsContextState::setLineCap(LineCap cap)\n{\n    m_strokeData.setLineCap(cap);\n    m_strokePaint.setStrokeCap((SkPaint::Cap)cap);\n}\n\nvoid GraphicsContextState::setLineJoin(LineJoin join)\n{\n    m_strokeData.setLineJoin(join);\n    m_strokePaint.setStrokeJoin((SkPaint::Join)join);\n}\n\nvoid GraphicsContextState::setMiterLimit(float miterLimit)\n{\n    m_strokeData.setMiterLimit(miterLimit);\n    m_strokePaint.setStrokeMiter(SkFloatToScalar(miterLimit));\n}\n\nvoid GraphicsContextState::setFillColor(const Color& color)\n{\n    m_fillColor = color;\n    m_fillGradient.clear();\n    m_fillPattern.clear();\n    m_fillPaint.setColor(applyAlpha(color.rgb()));\n    m_fillPaint.setShader(0);\n}\n\nvoid GraphicsContextState::setFillGradient(const PassRefPtr<Gradient> gradient)\n{\n    m_fillColor = Color::black;\n    m_fillPattern.clear();\n    m_fillGradient = gradient;\n    m_fillPaint.setColor(applyAlpha(SK_ColorBLACK));\n    m_fillPaint.setShader(m_fillGradient->shader());\n}\n\nvoid GraphicsContextState::clearFillGradient()\n{\n    m_fillGradient.clear();\n    ASSERT(!m_fillPattern);\n    m_fillPaint.setColor(applyAlpha(m_fillColor.rgb()));\n}\n\nvoid GraphicsContextState::setFillPattern(const PassRefPtr<Pattern> pattern)\n{\n    m_fillColor = Color::black;\n    m_fillGradient.clear();\n    m_fillPattern = pattern;\n    m_fillPaint.setColor(applyAlpha(SK_ColorBLACK));\n    m_fillPaint.setShader(m_fillPattern->shader());\n}\n\nvoid GraphicsContextState::clearFillPattern()\n{\n    m_fillPattern.clear();\n    ASSERT(!m_fillGradient);\n    m_fillPaint.setColor(applyAlpha(m_fillColor.rgb()));\n}\n\n\/\/ Shadow. (This will need tweaking if we use draw loopers for other things.)\nvoid GraphicsContextState::setDrawLooper(PassRefPtr<SkDrawLooper> drawLooper)\n{\n    m_looper = drawLooper;\n    m_strokePaint.setLooper(m_looper.get());\n    m_fillPaint.setLooper(m_looper.get());\n}\n\nvoid GraphicsContextState::clearDrawLooper()\n{\n    m_looper.clear();\n    m_strokePaint.setLooper(0);\n    m_fillPaint.setLooper(0);\n}\n\nvoid GraphicsContextState::setAlphaAsFloat(float alpha)\n{\n    if (alpha < 0) {\n        m_alpha = 0;\n    } else {\n        m_alpha = roundf(alpha * 256);\n        if (m_alpha > 256)\n            m_alpha = 256;\n    }\n    m_strokePaint.setColor(applyAlpha(m_strokeData.color().rgb()));\n    m_fillPaint.setColor(applyAlpha(m_fillColor.rgb()));\n}\n\nvoid GraphicsContextState::setLineDash(const DashArray& dashes, float dashOffset)\n{\n    m_strokeData.setLineDash(dashes, dashOffset);\n}\n\nvoid GraphicsContextState::setColorFilter(PassRefPtr<SkColorFilter> colorFilter)\n{\n    m_colorFilter = colorFilter;\n    m_strokePaint.setColorFilter(m_colorFilter.get());\n    m_fillPaint.setColorFilter(m_colorFilter.get());\n}\n\nvoid GraphicsContextState::setCompositeOperation(CompositeOperator compositeOperation, blink::WebBlendMode blendMode)\n{\n    m_compositeOperator = compositeOperation;\n    m_blendMode = blendMode;\n    m_xferMode = WebCoreCompositeToSkiaComposite(compositeOperation, blendMode);\n    m_strokePaint.setXfermode(m_xferMode.get());\n    m_fillPaint.setXfermode(m_xferMode.get());\n}\n\nvoid GraphicsContextState::setInterpolationQuality(InterpolationQuality quality)\n{\n    m_interpolationQuality = quality;\n    m_strokePaint.setFilterLevel(WebCoreInterpolationQualityToSkFilterLevel(quality));\n    m_fillPaint.setFilterLevel(WebCoreInterpolationQualityToSkFilterLevel(quality));\n}\n\nvoid GraphicsContextState::setShouldAntialias(bool shouldAntialias)\n{\n    m_shouldAntialias = shouldAntialias;\n    m_strokePaint.setAntiAlias(shouldAntialias);\n    m_fillPaint.setAntiAlias(shouldAntialias);\n}\n\n\n} \/\/ namespace WebCore\n<commit_msg>Fix memory leak in GraphicsContextState.<commit_after>\/\/ Copyright (c) 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 \"config.h\"\n#include \"platform\/graphics\/GraphicsContextState.h\"\n\n#include \"platform\/graphics\/skia\/SkiaUtils.h\"\n\nnamespace WebCore {\n\nGraphicsContextState::GraphicsContextState()\n    : m_fillColor(Color::black)\n    , m_fillRule(RULE_NONZERO)\n    , m_textDrawingMode(TextModeFill)\n    , m_alpha(256)\n    , m_xferMode(nullptr)\n    , m_compositeOperator(CompositeSourceOver)\n    , m_blendMode(blink::WebBlendModeNormal)\n    , m_interpolationQuality(InterpolationDefault)\n    , m_saveCount(0)\n    , m_shouldAntialias(true)\n    , m_shouldSmoothFonts(true)\n    , m_shouldClampToSourceRect(true)\n{\n    m_strokePaint.setStyle(SkPaint::kStroke_Style);\n    m_strokePaint.setStrokeWidth(SkFloatToScalar(m_strokeData.thickness()));\n    m_strokePaint.setColor(applyAlpha(m_strokeData.color().rgb()));\n    m_strokePaint.setStrokeCap(SkPaint::kDefault_Cap);\n    m_strokePaint.setStrokeJoin(SkPaint::kDefault_Join);\n    m_strokePaint.setStrokeMiter(SkFloatToScalar(m_strokeData.miterLimit()));\n    m_strokePaint.setFilterLevel(WebCoreInterpolationQualityToSkFilterLevel(m_interpolationQuality));\n    m_strokePaint.setAntiAlias(m_shouldAntialias);\n    m_fillPaint.setColor(applyAlpha(m_fillColor.rgb()));\n    m_fillPaint.setFilterLevel(WebCoreInterpolationQualityToSkFilterLevel(m_interpolationQuality));\n    m_fillPaint.setAntiAlias(m_shouldAntialias);\n}\n\nGraphicsContextState::GraphicsContextState(const GraphicsContextState& other)\n    : m_strokePaint(other.m_strokePaint)\n    , m_fillPaint(other.m_fillPaint)\n    , m_strokeData(other.m_strokeData)\n    , m_fillColor(other.m_fillColor)\n    , m_fillRule(other.m_fillRule)\n    , m_fillGradient(other.m_fillGradient)\n    , m_fillPattern(other.m_fillPattern)\n    , m_looper(other.m_looper)\n    , m_textDrawingMode(other.m_textDrawingMode)\n    , m_alpha(other.m_alpha)\n    , m_xferMode(other.m_xferMode)\n    , m_colorFilter(other.m_colorFilter)\n    , m_compositeOperator(other.m_compositeOperator)\n    , m_blendMode(other.m_blendMode)\n    , m_interpolationQuality(other.m_interpolationQuality)\n    , m_saveCount(0)\n    , m_shouldAntialias(other.m_shouldAntialias)\n    , m_shouldSmoothFonts(other.m_shouldSmoothFonts)\n    , m_shouldClampToSourceRect(other.m_shouldClampToSourceRect) { }\n\nvoid GraphicsContextState::copy(const GraphicsContextState& source)\n{\n    this->~GraphicsContextState();\n    new (this) GraphicsContextState(source);\n}\n\nconst SkPaint& GraphicsContextState::strokePaint(int strokedPathLength) const\n{\n    if (m_strokeData.gradient() && m_strokeData.gradient()->shaderChanged())\n        m_strokePaint.setShader(m_strokeData.gradient()->shader());\n    m_strokeData.setupPaintDashPathEffect(&m_strokePaint, strokedPathLength);\n    return m_strokePaint;\n}\n\nconst SkPaint& GraphicsContextState::fillPaint() const\n{\n    if (m_fillGradient && m_fillGradient->shaderChanged())\n        m_fillPaint.setShader(m_fillGradient->shader());\n    return m_fillPaint;\n}\n\nvoid GraphicsContextState::setStrokeStyle(StrokeStyle style)\n{\n    m_strokeData.setStyle(style);\n}\n\nvoid GraphicsContextState::setStrokeThickness(float thickness)\n{\n    m_strokeData.setThickness(thickness);\n    m_strokePaint.setStrokeWidth(SkFloatToScalar(thickness));\n}\n\nvoid GraphicsContextState::setStrokeColor(const Color& color)\n{\n    m_strokeData.clearGradient();\n    m_strokeData.clearPattern();\n    m_strokeData.setColor(color);\n    m_strokePaint.setColor(applyAlpha(color.rgb()));\n    m_strokePaint.setShader(0);\n}\n\nvoid GraphicsContextState::setStrokeGradient(const PassRefPtr<Gradient> gradient)\n{\n    m_strokeData.setColor(Color::black);\n    m_strokeData.clearPattern();\n    m_strokeData.setGradient(gradient);\n    m_strokePaint.setColor(applyAlpha(SK_ColorBLACK));\n    m_strokePaint.setShader(m_strokeData.gradient()->shader());\n}\n\nvoid GraphicsContextState::clearStrokeGradient()\n{\n    m_strokeData.clearGradient();\n    ASSERT(!m_strokeData.pattern());\n    m_strokePaint.setColor(applyAlpha(m_strokeData.color().rgb()));\n}\n\nvoid GraphicsContextState::setStrokePattern(const PassRefPtr<Pattern> pattern)\n{\n    m_strokeData.setColor(Color::black);\n    m_strokeData.clearGradient();\n    m_strokeData.setPattern(pattern);\n    m_strokePaint.setColor(applyAlpha(SK_ColorBLACK));\n    m_strokePaint.setShader(m_strokeData.pattern()->shader());\n}\n\nvoid GraphicsContextState::clearStrokePattern()\n{\n    m_strokeData.clearPattern();\n    ASSERT(!m_strokeData.gradient());\n    m_strokePaint.setColor(applyAlpha(m_strokeData.color().rgb()));\n}\n\nvoid GraphicsContextState::setLineCap(LineCap cap)\n{\n    m_strokeData.setLineCap(cap);\n    m_strokePaint.setStrokeCap((SkPaint::Cap)cap);\n}\n\nvoid GraphicsContextState::setLineJoin(LineJoin join)\n{\n    m_strokeData.setLineJoin(join);\n    m_strokePaint.setStrokeJoin((SkPaint::Join)join);\n}\n\nvoid GraphicsContextState::setMiterLimit(float miterLimit)\n{\n    m_strokeData.setMiterLimit(miterLimit);\n    m_strokePaint.setStrokeMiter(SkFloatToScalar(miterLimit));\n}\n\nvoid GraphicsContextState::setFillColor(const Color& color)\n{\n    m_fillColor = color;\n    m_fillGradient.clear();\n    m_fillPattern.clear();\n    m_fillPaint.setColor(applyAlpha(color.rgb()));\n    m_fillPaint.setShader(0);\n}\n\nvoid GraphicsContextState::setFillGradient(const PassRefPtr<Gradient> gradient)\n{\n    m_fillColor = Color::black;\n    m_fillPattern.clear();\n    m_fillGradient = gradient;\n    m_fillPaint.setColor(applyAlpha(SK_ColorBLACK));\n    m_fillPaint.setShader(m_fillGradient->shader());\n}\n\nvoid GraphicsContextState::clearFillGradient()\n{\n    m_fillGradient.clear();\n    ASSERT(!m_fillPattern);\n    m_fillPaint.setColor(applyAlpha(m_fillColor.rgb()));\n}\n\nvoid GraphicsContextState::setFillPattern(const PassRefPtr<Pattern> pattern)\n{\n    m_fillColor = Color::black;\n    m_fillGradient.clear();\n    m_fillPattern = pattern;\n    m_fillPaint.setColor(applyAlpha(SK_ColorBLACK));\n    m_fillPaint.setShader(m_fillPattern->shader());\n}\n\nvoid GraphicsContextState::clearFillPattern()\n{\n    m_fillPattern.clear();\n    ASSERT(!m_fillGradient);\n    m_fillPaint.setColor(applyAlpha(m_fillColor.rgb()));\n}\n\n\/\/ Shadow. (This will need tweaking if we use draw loopers for other things.)\nvoid GraphicsContextState::setDrawLooper(PassRefPtr<SkDrawLooper> drawLooper)\n{\n    m_looper = drawLooper;\n    m_strokePaint.setLooper(m_looper.get());\n    m_fillPaint.setLooper(m_looper.get());\n}\n\nvoid GraphicsContextState::clearDrawLooper()\n{\n    m_looper.clear();\n    m_strokePaint.setLooper(0);\n    m_fillPaint.setLooper(0);\n}\n\nvoid GraphicsContextState::setAlphaAsFloat(float alpha)\n{\n    if (alpha < 0) {\n        m_alpha = 0;\n    } else {\n        m_alpha = roundf(alpha * 256);\n        if (m_alpha > 256)\n            m_alpha = 256;\n    }\n    m_strokePaint.setColor(applyAlpha(m_strokeData.color().rgb()));\n    m_fillPaint.setColor(applyAlpha(m_fillColor.rgb()));\n}\n\nvoid GraphicsContextState::setLineDash(const DashArray& dashes, float dashOffset)\n{\n    m_strokeData.setLineDash(dashes, dashOffset);\n}\n\nvoid GraphicsContextState::setColorFilter(PassRefPtr<SkColorFilter> colorFilter)\n{\n    m_colorFilter = colorFilter;\n    m_strokePaint.setColorFilter(m_colorFilter.get());\n    m_fillPaint.setColorFilter(m_colorFilter.get());\n}\n\nvoid GraphicsContextState::setCompositeOperation(CompositeOperator compositeOperation, blink::WebBlendMode blendMode)\n{\n    m_compositeOperator = compositeOperation;\n    m_blendMode = blendMode;\n    m_xferMode = WebCoreCompositeToSkiaComposite(compositeOperation, blendMode);\n    m_strokePaint.setXfermode(m_xferMode.get());\n    m_fillPaint.setXfermode(m_xferMode.get());\n}\n\nvoid GraphicsContextState::setInterpolationQuality(InterpolationQuality quality)\n{\n    m_interpolationQuality = quality;\n    m_strokePaint.setFilterLevel(WebCoreInterpolationQualityToSkFilterLevel(quality));\n    m_fillPaint.setFilterLevel(WebCoreInterpolationQualityToSkFilterLevel(quality));\n}\n\nvoid GraphicsContextState::setShouldAntialias(bool shouldAntialias)\n{\n    m_shouldAntialias = shouldAntialias;\n    m_strokePaint.setAntiAlias(shouldAntialias);\n    m_fillPaint.setAntiAlias(shouldAntialias);\n}\n\n\n} \/\/ namespace WebCore\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\/Testing\/VisualTestCommon\/GlutRenderer.h\"\n\n#include <string>\n\nusing SurgSim::Math::Vector3d;\nusing SurgSim::Math::RigidTransform3d;\n\n\nint GlutRenderer::m_width = 1024;\nint GlutRenderer::m_height = 768;\n\nstd::shared_ptr<GlutCamera> GlutRenderer::m_camera = nullptr;\nstd::vector< std::shared_ptr<GlutRenderObject> > GlutRenderer::m_objects =\n\tstd::vector< std::shared_ptr<GlutRenderObject> >();\n\n\nGlutRenderObject::~GlutRenderObject()\n{\n}\n\nvoid GlutSquare::draw()\n{\n\tglEnable(GL_LIGHTING);\n\n\tglPushMatrix();\n\n\tglTranslated(pose.translation().x(), pose.translation().y(), pose.translation().z());\n\tEigen::AngleAxisd angleAxis = Eigen::AngleAxisd(pose.rotation());\n\tglRotated(angleAxis.angle() * 180.0 \/ M_PI, angleAxis.axis().x(), angleAxis.axis().y(), angleAxis.axis().z());\n\n\tVector3d squarePoints[4];\n\tsquarePoints[0] = - (halfSize * planeDirectionX) + (halfSize * planeDirectionY);\n\tsquarePoints[1] =   (halfSize * planeDirectionX) + (halfSize * planeDirectionY);\n\tsquarePoints[2] =   (halfSize * planeDirectionX) - (halfSize * planeDirectionY);\n\tsquarePoints[3] = - (halfSize * planeDirectionX) - (halfSize * planeDirectionY);\n\n\tVector3d normal = (squarePoints[1] - squarePoints[0]).cross(squarePoints[2] - squarePoints[0]);\n\tnormal.normalize();\n\n\tglColor3d(color.x(), color.y(), color.z());\n\tglBegin(GL_QUADS);\n\n\t\/\/ Front side\n\tglNormal3d(normal.x(), normal.y(), normal.z());\n\tfor (int i = 0; i < 4; ++i)\n\t{\n\t\tglVertex3d(squarePoints[i].x(), squarePoints[i].y(), squarePoints[i].z());\n\t}\n\t\/\/ Back side\n\tglNormal3d(- normal.x(), - normal.y(), - normal.z());\n\tfor (int i = 0; i < 4; ++i)\n\t{\n\t\tglVertex3d(squarePoints[3 - i].x(), squarePoints[3 - i].y(), squarePoints[3 - i].z());\n\t}\n\n\tglEnd();\n\n\tglPopMatrix();\n}\n\nvoid GlutAxes::draw()\n{\n\tglDisable(GL_LIGHTING);\n\n\tglPushMatrix();\n\n\tglTranslated(pose.translation().x(), pose.translation().y(), pose.translation().z());\n\tEigen::AngleAxisd angleAxis = Eigen::AngleAxisd(pose.rotation());\n\tglRotated(angleAxis.angle() * 180.0 \/ M_PI, angleAxis.axis().x(), angleAxis.axis().y(), angleAxis.axis().z());\n\n\tVector3d axesPoints[4];\n\taxesPoints[0] = Vector3d(0.0, 0.0, 0.0);\n\taxesPoints[1] = (length * Vector3d(1.0, 0.0, 0.0));\n\taxesPoints[2] = (length * Vector3d(0.0, 1.0, 0.0));\n\taxesPoints[3] = (length * Vector3d(0.0, 0.0, 1.0));\n\n\tglLineWidth(width);\n\n\tglBegin(GL_LINES);\n\tglColor3d(1.0, 0.0, 0.0);\n\tglVertex3d(axesPoints[0].x(), axesPoints[0].y(), axesPoints[0].z());\n\tglVertex3d(axesPoints[1].x(), axesPoints[1].y(), axesPoints[1].z());\n\tglColor3d(0.0, 1.0, 0.0);\n\tglVertex3d(axesPoints[0].x(), axesPoints[0].y(), axesPoints[0].z());\n\tglVertex3d(axesPoints[2].x(), axesPoints[2].y(), axesPoints[2].z());\n\tglColor3d(0.0, 0.0, 1.0);\n\tglVertex3d(axesPoints[0].x(), axesPoints[0].y(), axesPoints[0].z());\n\tglVertex3d(axesPoints[3].x(), axesPoints[3].y(), axesPoints[3].z());\n\tglEnd();\n\n\tglPopMatrix();\n}\n\nvoid GlutSphere::draw()\n{\n\tglEnable(GL_LIGHTING);\n\n\tglPushMatrix();\n\n\tglTranslated(pose.translation().x(), pose.translation().y(), pose.translation().z());\n\tEigen::AngleAxisd angleAxis = Eigen::AngleAxisd(pose.rotation());\n\tglRotated(angleAxis.angle() * 180.0 \/ M_PI, angleAxis.axis().x(), angleAxis.axis().y(), angleAxis.axis().z());\n\n\tglColor3d(color.x(), color.y(), color.z());\n\n\tgluQuadricOrientation(quadratic, GLU_OUTSIDE);\n\tgluSphere(quadratic, radius, 32, 32);\n\n\tglPopMatrix();\n}\n\nvoid GlutGroup::draw()\n{\n\tglPushMatrix();\n\n\tglTranslated(pose.translation().x(), pose.translation().y(), pose.translation().z());\n\tEigen::AngleAxisd angleAxis = Eigen::AngleAxisd(pose.rotation());\n\tglRotated(angleAxis.angle() * 180.0 \/ M_PI, angleAxis.axis().x(), angleAxis.axis().y(), angleAxis.axis().z());\n\n\tfor (auto it = children.cbegin(); it != children.cend(); ++it)\n\t{\n\t\t(*it)->draw();\n\t}\n\n\tglPopMatrix();\n}\n\nvoid GlutRenderer::initialize()\n{\n\tchar* argv[1];\n\tint argc = 1;\n\tstd::string title = \"GlutWindow\";\n\tstd::vector<char> charString(title.size() + 1);\n\tstd::copy(title.begin(), title.end(), charString.begin());\n\targv[0] = &charString[0];\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DEPTH | GLUT_DOUBLE | GLUT_RGBA);\n\tglutInitWindowPosition(100, 100);\n\tglutInitWindowSize(m_width, m_height);\n\tglutCreateWindow(\"Simple GLUT display\");\n\n\tglEnable(GL_COLOR_MATERIAL);\n\tglEnable(GL_CULL_FACE);\n\tglCullFace(GL_BACK);\n\tglEnable(GL_DEPTH_TEST);\n\tglShadeModel(GL_SMOOTH);\n\tglClearColor(0.1f, 0.1f, 0.1f, 1.0f);\n\n\tglutDisplayFunc(display);\n\tglutReshapeFunc(reshape);\n}\nvoid GlutRenderer::display()\n{\n\tglViewport(0, 0, (GLsizei) m_width, (GLsizei) m_height);\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tgluPerspective(m_camera->fovY, static_cast<float>(m_width) \/ m_height, m_camera->zNear, m_camera->zFar);\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\tgluLookAt(m_camera->eye.x(), m_camera->eye.y(), m_camera->eye.z(),\n\t\t\t  m_camera->center.x(), m_camera->center.y(), m_camera->center.z(),\n\t\t\t  m_camera->up.x(), m_camera->up.y(), m_camera->up.z());\n\n\tglEnable(GL_LIGHT0);\n\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tdrawObjects();\n\tglutSwapBuffers();\n\n\tglutPostRedisplay();\n}\n<commit_msg>Check if camera is null before using in GlutRenderer<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\/Testing\/VisualTestCommon\/GlutRenderer.h\"\n\n#include <string>\n\nusing SurgSim::Math::Vector3d;\nusing SurgSim::Math::RigidTransform3d;\n\n\nint GlutRenderer::m_width = 1024;\nint GlutRenderer::m_height = 768;\n\nstd::shared_ptr<GlutCamera> GlutRenderer::m_camera = nullptr;\nstd::vector< std::shared_ptr<GlutRenderObject> > GlutRenderer::m_objects =\n\tstd::vector< std::shared_ptr<GlutRenderObject> >();\n\n\nGlutRenderObject::~GlutRenderObject()\n{\n}\n\nvoid GlutSquare::draw()\n{\n\tglEnable(GL_LIGHTING);\n\n\tglPushMatrix();\n\n\tglTranslated(pose.translation().x(), pose.translation().y(), pose.translation().z());\n\tEigen::AngleAxisd angleAxis = Eigen::AngleAxisd(pose.rotation());\n\tglRotated(angleAxis.angle() * 180.0 \/ M_PI, angleAxis.axis().x(), angleAxis.axis().y(), angleAxis.axis().z());\n\n\tVector3d squarePoints[4];\n\tsquarePoints[0] = - (halfSize * planeDirectionX) + (halfSize * planeDirectionY);\n\tsquarePoints[1] =   (halfSize * planeDirectionX) + (halfSize * planeDirectionY);\n\tsquarePoints[2] =   (halfSize * planeDirectionX) - (halfSize * planeDirectionY);\n\tsquarePoints[3] = - (halfSize * planeDirectionX) - (halfSize * planeDirectionY);\n\n\tVector3d normal = (squarePoints[1] - squarePoints[0]).cross(squarePoints[2] - squarePoints[0]);\n\tnormal.normalize();\n\n\tglColor3d(color.x(), color.y(), color.z());\n\tglBegin(GL_QUADS);\n\n\t\/\/ Front side\n\tglNormal3d(normal.x(), normal.y(), normal.z());\n\tfor (int i = 0; i < 4; ++i)\n\t{\n\t\tglVertex3d(squarePoints[i].x(), squarePoints[i].y(), squarePoints[i].z());\n\t}\n\t\/\/ Back side\n\tglNormal3d(- normal.x(), - normal.y(), - normal.z());\n\tfor (int i = 0; i < 4; ++i)\n\t{\n\t\tglVertex3d(squarePoints[3 - i].x(), squarePoints[3 - i].y(), squarePoints[3 - i].z());\n\t}\n\n\tglEnd();\n\n\tglPopMatrix();\n}\n\nvoid GlutAxes::draw()\n{\n\tglDisable(GL_LIGHTING);\n\n\tglPushMatrix();\n\n\tglTranslated(pose.translation().x(), pose.translation().y(), pose.translation().z());\n\tEigen::AngleAxisd angleAxis = Eigen::AngleAxisd(pose.rotation());\n\tglRotated(angleAxis.angle() * 180.0 \/ M_PI, angleAxis.axis().x(), angleAxis.axis().y(), angleAxis.axis().z());\n\n\tVector3d axesPoints[4];\n\taxesPoints[0] = Vector3d(0.0, 0.0, 0.0);\n\taxesPoints[1] = (length * Vector3d(1.0, 0.0, 0.0));\n\taxesPoints[2] = (length * Vector3d(0.0, 1.0, 0.0));\n\taxesPoints[3] = (length * Vector3d(0.0, 0.0, 1.0));\n\n\tglLineWidth(width);\n\n\tglBegin(GL_LINES);\n\tglColor3d(1.0, 0.0, 0.0);\n\tglVertex3d(axesPoints[0].x(), axesPoints[0].y(), axesPoints[0].z());\n\tglVertex3d(axesPoints[1].x(), axesPoints[1].y(), axesPoints[1].z());\n\tglColor3d(0.0, 1.0, 0.0);\n\tglVertex3d(axesPoints[0].x(), axesPoints[0].y(), axesPoints[0].z());\n\tglVertex3d(axesPoints[2].x(), axesPoints[2].y(), axesPoints[2].z());\n\tglColor3d(0.0, 0.0, 1.0);\n\tglVertex3d(axesPoints[0].x(), axesPoints[0].y(), axesPoints[0].z());\n\tglVertex3d(axesPoints[3].x(), axesPoints[3].y(), axesPoints[3].z());\n\tglEnd();\n\n\tglPopMatrix();\n}\n\nvoid GlutSphere::draw()\n{\n\tglEnable(GL_LIGHTING);\n\n\tglPushMatrix();\n\n\tglTranslated(pose.translation().x(), pose.translation().y(), pose.translation().z());\n\tEigen::AngleAxisd angleAxis = Eigen::AngleAxisd(pose.rotation());\n\tglRotated(angleAxis.angle() * 180.0 \/ M_PI, angleAxis.axis().x(), angleAxis.axis().y(), angleAxis.axis().z());\n\n\tglColor3d(color.x(), color.y(), color.z());\n\n\tgluQuadricOrientation(quadratic, GLU_OUTSIDE);\n\tgluSphere(quadratic, radius, 32, 32);\n\n\tglPopMatrix();\n}\n\nvoid GlutGroup::draw()\n{\n\tglPushMatrix();\n\n\tglTranslated(pose.translation().x(), pose.translation().y(), pose.translation().z());\n\tEigen::AngleAxisd angleAxis = Eigen::AngleAxisd(pose.rotation());\n\tglRotated(angleAxis.angle() * 180.0 \/ M_PI, angleAxis.axis().x(), angleAxis.axis().y(), angleAxis.axis().z());\n\n\tfor (auto it = children.cbegin(); it != children.cend(); ++it)\n\t{\n\t\t(*it)->draw();\n\t}\n\n\tglPopMatrix();\n}\n\nvoid GlutRenderer::initialize()\n{\n\tchar* argv[1];\n\tint argc = 1;\n\tstd::string title = \"GlutWindow\";\n\tstd::vector<char> charString(title.size() + 1);\n\tstd::copy(title.begin(), title.end(), charString.begin());\n\targv[0] = &charString[0];\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DEPTH | GLUT_DOUBLE | GLUT_RGBA);\n\tglutInitWindowPosition(100, 100);\n\tglutInitWindowSize(m_width, m_height);\n\tglutCreateWindow(\"Simple GLUT display\");\n\n\tglEnable(GL_COLOR_MATERIAL);\n\tglEnable(GL_CULL_FACE);\n\tglCullFace(GL_BACK);\n\tglEnable(GL_DEPTH_TEST);\n\tglShadeModel(GL_SMOOTH);\n\tglClearColor(0.1f, 0.1f, 0.1f, 1.0f);\n\n\tglutDisplayFunc(display);\n\tglutReshapeFunc(reshape);\n}\nvoid GlutRenderer::display()\n{\n\tglViewport(0, 0, (GLsizei) m_width, (GLsizei) m_height);\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tif (m_camera)\n\t{\n\t\tgluPerspective(m_camera->fovY, static_cast<float>(m_width) \/ m_height, m_camera->zNear, m_camera->zFar);\n\t}\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\tif (m_camera)\n\t{\n\t\tgluLookAt(m_camera->eye.x(), m_camera->eye.y(), m_camera->eye.z(),\n\t\t\t\t  m_camera->center.x(), m_camera->center.y(), m_camera->center.z(),\n\t\t\t\t  m_camera->up.x(), m_camera->up.y(), m_camera->up.z());\n\t}\n\n\tglEnable(GL_LIGHT0);\n\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tdrawObjects();\n\tglutSwapBuffers();\n\n\tglutPostRedisplay();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"musiclrcfloatphotowidget.h\"\n#include \"musicbackgroundmanager.h\"\n#include \"musicclickedlabel.h\"\n\n#include <qmath.h>\n#include <QTimer>\n#include <QCheckBox>\n#include <QPushButton>\n#include <QButtonGroup>\n\nMusicLrcFloatPhotoWidget::MusicLrcFloatPhotoWidget(QWidget *parent)\n    : MusicFloatAbstractWidget(parent)\n{\n    setObjectName(\"MusicLrcFloatPhotoWidget\");\n    setStyleSheet(QString(\"#MusicLrcFloatPhotoWidget{%1}\").arg(MusicUIObject::MBackgroundStyle08));\n\n    m_filmBGWidget = new QWidget(this);\n    m_filmBGWidget->setGeometry(0, 0, 662, 125);\n    m_filmBGWidget->setStyleSheet(\"background-image:url(':\/lrc\/lb_film_bg');\");\n\n    m_plane1 = new MusicClickedLabel(this);\n    m_plane1->setGeometry(100, 30, PHOTO_WIDTH, PHOTO_HEIGHT);\n    m_plane2 = new MusicClickedLabel(this);\n    m_plane2->setGeometry(280, 30, PHOTO_WIDTH, PHOTO_HEIGHT);\n    m_plane3 = new MusicClickedLabel(this);\n    m_plane3->setGeometry(460, 30, PHOTO_WIDTH, PHOTO_HEIGHT);\n\n    m_radio1 = new QCheckBox(this);\n    m_radio1->setGeometry(190, 75, 20, 20);\n    m_radio1->setStyleSheet(MusicUIObject::MCheckBoxStyle01);\n    m_radio2 = new QCheckBox(this);\n    m_radio2->setGeometry(370, 75, 20, 20);\n    m_radio2->setStyleSheet(MusicUIObject::MCheckBoxStyle01);\n    m_radio3 = new QCheckBox(this);\n    m_radio3->setGeometry(550, 75, 20, 20);\n    m_radio3->setStyleSheet(MusicUIObject::MCheckBoxStyle01);\n\n    m_checkBox = new QCheckBox(tr(\"All\"), this);\n    m_checkBox->setGeometry(15, 130, 100, 20);\n    m_checkBox->setChecked(true);\n    m_checkBox->setStyleSheet(MusicUIObject::MCheckBoxStyle01);\n\n    m_confirmButton = new QPushButton(tr(\"Confirm\"), this);\n    m_confirmButton->setGeometry(500, 130, 70, 20);\n    m_confirmButton->setStyleSheet(MusicUIObject::MPushButtonStyle04);\n    m_confirmButton->setCursor(QCursor(Qt::PointingHandCursor));\n\n    m_previous = new QPushButton(\"<\", this);\n    m_previous->setGeometry(20, 38, 15, 50);\n    m_next = new QPushButton(\">\", this);\n    m_next->setGeometry(625, 38, 15, 50);\n    m_previous->setCursor(QCursor(Qt::PointingHandCursor));\n    m_next->setCursor(QCursor(Qt::PointingHandCursor));\n\n    m_previous->setStyleSheet(MusicUIObject::MBackgroundStyle10 + MusicUIObject::MBorderStyle01);\n    m_next->setStyleSheet(MusicUIObject::MBackgroundStyle10 + MusicUIObject::MBorderStyle01);\n\n    m_currentIndex = 0;\n\n    connect(m_confirmButton, SIGNAL(clicked()), SLOT(confirmButtonClicked()));\n    connect(m_previous, SIGNAL(clicked()), SLOT(photoPrevious()));\n    connect(m_next, SIGNAL(clicked()), SLOT(photoNext()));\n    connect(m_plane1, SIGNAL(clicked()), SLOT(sendUserSelectArtBg1()));\n    connect(m_plane2, SIGNAL(clicked()), SLOT(sendUserSelectArtBg2()));\n    connect(m_plane3, SIGNAL(clicked()), SLOT(sendUserSelectArtBg3()));\n\n    QButtonGroup *radioGroup = new QButtonGroup(this);\n    radioGroup->setExclusive(false);\n    radioGroup->addButton(m_radio1, 0);\n    radioGroup->addButton(m_radio2, 1);\n    radioGroup->addButton(m_radio3, 2);\n    connect(radioGroup, SIGNAL(buttonClicked(int)), SLOT(userSelectCheckBoxChecked(int)));\n    connect(M_BACKGROUND_PTR, SIGNAL(artHasChanged()), SLOT(artHasChanged()));\n    connect(m_checkBox, SIGNAL(clicked(bool)), SLOT(selectAllStateChanged(bool)));\n}\n\nMusicLrcFloatPhotoWidget::~MusicLrcFloatPhotoWidget()\n{\n    delete m_radio1;\n    delete m_radio2;\n    delete m_radio3;\n    delete m_plane1;\n    delete m_plane2;\n    delete m_plane3;\n    delete m_filmBGWidget;\n    delete m_previous;\n    delete m_next;\n    delete m_confirmButton;\n    delete m_checkBox;\n}\n\nQString MusicLrcFloatPhotoWidget::getClassName()\n{\n    return staticMetaObject.className();\n}\n\nvoid MusicLrcFloatPhotoWidget::resizeWindow(int width, int height)\n{\n    m_rectIn = QRect(width\/2, 530 + height, 115, 105);\n    m_rectOut = QRect(width\/2, 330 + height, 662, 180);\n    setGeometry(m_rectOut);\n}\n\nvoid MusicLrcFloatPhotoWidget::show()\n{\n    QWidget::show();\n    animationOut();\n    showPhoto();\n}\n\nvoid MusicLrcFloatPhotoWidget::close()\n{\n    animationIn();\n    QTimer::singleShot(m_animation->duration(), this, SLOT(parentClose()));\n}\n\nvoid MusicLrcFloatPhotoWidget::confirmButtonClicked()\n{\n    QStringList list;\n    foreach(int i, m_selectNum)\n    {\n       list << m_artPath[i];\n    }\n    M_BACKGROUND_PTR->setArtPhotoPaths(list);\n    close();\n}\n\nvoid MusicLrcFloatPhotoWidget::showPhoto() const\n{\n    m_previous->setEnabled(m_currentIndex != 0);\n    int page = ceil(m_artPath.count() *1.0 \/ PHOTO_PERLINE) - 1;\n    m_next->setEnabled(m_currentIndex != (page = page < 0 ? 0 : page) );\n\n    QPixmap nullPix;\n    nullPix.fill(Qt::black);\n    \/\/check show pixmap\n    int indexCheck = m_currentIndex * PHOTO_PERLINE;\n    m_plane1->setPixmap( (indexCheck + 0) < m_artPath.count() ? QPixmap( m_artPath[indexCheck + 0] )\n                                           .scaled(PHOTO_WIDTH, PHOTO_HEIGHT): nullPix );\n    m_plane2->setPixmap( (indexCheck + 1) < m_artPath.count() ? QPixmap( m_artPath[indexCheck + 1] )\n                                           .scaled(PHOTO_WIDTH, PHOTO_HEIGHT): nullPix );\n    m_plane3->setPixmap( (indexCheck + 2) < m_artPath.count() ? QPixmap( m_artPath[indexCheck + 2] )\n                                           .scaled(PHOTO_WIDTH, PHOTO_HEIGHT): nullPix );\n    \/\/check show radio button\n    m_radio1->setChecked( m_selectNum.contains(indexCheck + 0) );\n    m_radio2->setChecked( m_selectNum.contains(indexCheck + 1) );\n    m_radio3->setChecked( m_selectNum.contains(indexCheck + 2) );\n    m_radio1->setVisible( (indexCheck + 0) < m_artPath.count() );\n    m_radio2->setVisible( (indexCheck + 1) < m_artPath.count() );\n    m_radio3->setVisible( (indexCheck + 2) < m_artPath.count() );\n}\n\nvoid MusicLrcFloatPhotoWidget::photoPrevious()\n{\n    if(--m_currentIndex < 0)\n    {\n        m_currentIndex = 0;\n    }\n    showPhoto();\n}\n\nvoid MusicLrcFloatPhotoWidget::artHasChanged()\n{\n    m_selectNum.clear();\n    m_artPath = M_BACKGROUND_PTR->getArtPhotoPaths();\n    for(int i=0; i<m_artPath.count(); ++i)\n    {\n        m_selectNum << i;\n    }\n}\n\nvoid MusicLrcFloatPhotoWidget::photoNext()\n{\n    int page = ceil(m_artPath.count() *1.0 \/ PHOTO_PERLINE) - 1;\n    if( ++m_currentIndex > (page = page < 0 ? 0 : page) )\n    {\n        m_currentIndex = page;\n    }\n    showPhoto();\n}\n\nvoid MusicLrcFloatPhotoWidget::sendUserSelectArtBg1()\n{\n    M_BACKGROUND_PTR->setUserSelectArtIndex(m_currentIndex * PHOTO_PERLINE + 0);\n}\n\nvoid MusicLrcFloatPhotoWidget::sendUserSelectArtBg2()\n{\n    M_BACKGROUND_PTR->setUserSelectArtIndex(m_currentIndex * PHOTO_PERLINE + 1);\n}\n\nvoid MusicLrcFloatPhotoWidget::sendUserSelectArtBg3()\n{\n    M_BACKGROUND_PTR->setUserSelectArtIndex(m_currentIndex * PHOTO_PERLINE + 2);\n}\n\nvoid MusicLrcFloatPhotoWidget::userSelectCheckBoxChecked(int index)\n{\n    bool status = true;\n    switch(index)\n    {\n        case 0: status = m_radio1->isChecked(); break;\n        case 1: status = m_radio2->isChecked(); break;\n        case 2: status = m_radio3->isChecked(); break;\n        default: break;\n    }\n    index = m_currentIndex * PHOTO_PERLINE + index;\n    if(status)\n    {\n        m_selectNum << index;\n    }\n    else\n    {\n        m_selectNum.remove(index);\n    }\n\n    m_checkBox->setChecked(false);\n}\n\nvoid MusicLrcFloatPhotoWidget::selectAllStateChanged(bool state)\n{\n    if(state)\n    {\n        for(int i=0; i<m_artPath.count(); ++i)\n        {\n            m_selectNum << i;\n        }\n        showPhoto();\n    }\n    else\n    {\n        m_radio1->setChecked(false);\n        m_radio2->setChecked(false);\n        m_radio3->setChecked(false);\n        m_selectNum.clear();\n    }\n}\n<commit_msg>Optimized the float photo style[388974]<commit_after>#include \"musiclrcfloatphotowidget.h\"\n#include \"musicbackgroundmanager.h\"\n#include \"musicclickedlabel.h\"\n#include \"musicinlinefloatuiobject.h\"\n\n#include <qmath.h>\n#include <QTimer>\n#include <QCheckBox>\n#include <QPushButton>\n#include <QButtonGroup>\n\nMusicLrcFloatPhotoWidget::MusicLrcFloatPhotoWidget(QWidget *parent)\n    : MusicFloatAbstractWidget(parent)\n{\n    setObjectName(\"MusicLrcFloatPhotoWidget\");\n    setStyleSheet(QString(\"#MusicLrcFloatPhotoWidget{%1}\").arg(MusicUIObject::MBackgroundStyle08));\n\n    m_filmBGWidget = new QWidget(this);\n    m_filmBGWidget->setGeometry(0, 0, 662, 125);\n    m_filmBGWidget->setStyleSheet(\"background-image:url(':\/lrc\/lb_film_bg');\");\n\n    m_plane1 = new MusicClickedLabel(this);\n    m_plane1->setGeometry(100, 30, PHOTO_WIDTH, PHOTO_HEIGHT);\n    m_plane2 = new MusicClickedLabel(this);\n    m_plane2->setGeometry(280, 30, PHOTO_WIDTH, PHOTO_HEIGHT);\n    m_plane3 = new MusicClickedLabel(this);\n    m_plane3->setGeometry(460, 30, PHOTO_WIDTH, PHOTO_HEIGHT);\n\n    m_radio1 = new QCheckBox(this);\n    m_radio1->setGeometry(190, 75, 20, 20);\n    m_radio1->setStyleSheet(MusicUIObject::MCheckBoxStyle01);\n    m_radio2 = new QCheckBox(this);\n    m_radio2->setGeometry(370, 75, 20, 20);\n    m_radio2->setStyleSheet(MusicUIObject::MCheckBoxStyle01);\n    m_radio3 = new QCheckBox(this);\n    m_radio3->setGeometry(550, 75, 20, 20);\n    m_radio3->setStyleSheet(MusicUIObject::MCheckBoxStyle01);\n\n    m_checkBox = new QCheckBox(tr(\"All\"), this);\n    m_checkBox->setGeometry(15, 130, 100, 20);\n    m_checkBox->setChecked(true);\n    m_checkBox->setStyleSheet(MusicUIObject::MCheckBoxStyle01);\n\n    m_confirmButton = new QPushButton(tr(\"Confirm\"), this);\n    m_confirmButton->setGeometry(515, 130, 60, 22);\n    m_confirmButton->setStyleSheet(MusicUIObject::MKGInlineFloatSetting + \\\n                                   MusicUIObject::MPushButtonStyle08);\n    m_confirmButton->setCursor(QCursor(Qt::PointingHandCursor));\n\n    m_previous = new QPushButton(\"<\", this);\n    m_previous->setGeometry(20, 38, 15, 50);\n    m_next = new QPushButton(\">\", this);\n    m_next->setGeometry(625, 38, 15, 50);\n    m_previous->setCursor(QCursor(Qt::PointingHandCursor));\n    m_next->setCursor(QCursor(Qt::PointingHandCursor));\n\n    m_previous->setStyleSheet(MusicUIObject::MBackgroundStyle10 + MusicUIObject::MBorderStyle01);\n    m_next->setStyleSheet(MusicUIObject::MBackgroundStyle10 + MusicUIObject::MBorderStyle01);\n\n    m_currentIndex = 0;\n\n    connect(m_confirmButton, SIGNAL(clicked()), SLOT(confirmButtonClicked()));\n    connect(m_previous, SIGNAL(clicked()), SLOT(photoPrevious()));\n    connect(m_next, SIGNAL(clicked()), SLOT(photoNext()));\n    connect(m_plane1, SIGNAL(clicked()), SLOT(sendUserSelectArtBg1()));\n    connect(m_plane2, SIGNAL(clicked()), SLOT(sendUserSelectArtBg2()));\n    connect(m_plane3, SIGNAL(clicked()), SLOT(sendUserSelectArtBg3()));\n\n    QButtonGroup *radioGroup = new QButtonGroup(this);\n    radioGroup->setExclusive(false);\n    radioGroup->addButton(m_radio1, 0);\n    radioGroup->addButton(m_radio2, 1);\n    radioGroup->addButton(m_radio3, 2);\n    connect(radioGroup, SIGNAL(buttonClicked(int)), SLOT(userSelectCheckBoxChecked(int)));\n    connect(M_BACKGROUND_PTR, SIGNAL(artHasChanged()), SLOT(artHasChanged()));\n    connect(m_checkBox, SIGNAL(clicked(bool)), SLOT(selectAllStateChanged(bool)));\n}\n\nMusicLrcFloatPhotoWidget::~MusicLrcFloatPhotoWidget()\n{\n    delete m_radio1;\n    delete m_radio2;\n    delete m_radio3;\n    delete m_plane1;\n    delete m_plane2;\n    delete m_plane3;\n    delete m_filmBGWidget;\n    delete m_previous;\n    delete m_next;\n    delete m_confirmButton;\n    delete m_checkBox;\n}\n\nQString MusicLrcFloatPhotoWidget::getClassName()\n{\n    return staticMetaObject.className();\n}\n\nvoid MusicLrcFloatPhotoWidget::resizeWindow(int width, int height)\n{\n    m_rectIn = QRect(width\/2, 530 + height, 115, 105);\n    m_rectOut = QRect(width\/2, 330 + height, 662, 180);\n    setGeometry(m_rectOut);\n}\n\nvoid MusicLrcFloatPhotoWidget::show()\n{\n    QWidget::show();\n    animationOut();\n    showPhoto();\n}\n\nvoid MusicLrcFloatPhotoWidget::close()\n{\n    animationIn();\n    QTimer::singleShot(m_animation->duration(), this, SLOT(parentClose()));\n}\n\nvoid MusicLrcFloatPhotoWidget::confirmButtonClicked()\n{\n    QStringList list;\n    foreach(int i, m_selectNum)\n    {\n       list << m_artPath[i];\n    }\n    M_BACKGROUND_PTR->setArtPhotoPaths(list);\n    close();\n}\n\nvoid MusicLrcFloatPhotoWidget::showPhoto() const\n{\n    m_previous->setEnabled(m_currentIndex != 0);\n    int page = ceil(m_artPath.count() *1.0 \/ PHOTO_PERLINE) - 1;\n    m_next->setEnabled(m_currentIndex != (page = page < 0 ? 0 : page) );\n\n    QPixmap nullPix;\n    nullPix.fill(Qt::black);\n    \/\/check show pixmap\n    int indexCheck = m_currentIndex * PHOTO_PERLINE;\n    m_plane1->setPixmap( (indexCheck + 0) < m_artPath.count() ? QPixmap( m_artPath[indexCheck + 0] )\n                                           .scaled(PHOTO_WIDTH, PHOTO_HEIGHT): nullPix );\n    m_plane2->setPixmap( (indexCheck + 1) < m_artPath.count() ? QPixmap( m_artPath[indexCheck + 1] )\n                                           .scaled(PHOTO_WIDTH, PHOTO_HEIGHT): nullPix );\n    m_plane3->setPixmap( (indexCheck + 2) < m_artPath.count() ? QPixmap( m_artPath[indexCheck + 2] )\n                                           .scaled(PHOTO_WIDTH, PHOTO_HEIGHT): nullPix );\n    \/\/check show radio button\n    m_radio1->setChecked( m_selectNum.contains(indexCheck + 0) );\n    m_radio2->setChecked( m_selectNum.contains(indexCheck + 1) );\n    m_radio3->setChecked( m_selectNum.contains(indexCheck + 2) );\n    m_radio1->setVisible( (indexCheck + 0) < m_artPath.count() );\n    m_radio2->setVisible( (indexCheck + 1) < m_artPath.count() );\n    m_radio3->setVisible( (indexCheck + 2) < m_artPath.count() );\n}\n\nvoid MusicLrcFloatPhotoWidget::photoPrevious()\n{\n    if(--m_currentIndex < 0)\n    {\n        m_currentIndex = 0;\n    }\n    showPhoto();\n}\n\nvoid MusicLrcFloatPhotoWidget::artHasChanged()\n{\n    m_selectNum.clear();\n    m_artPath = M_BACKGROUND_PTR->getArtPhotoPaths();\n    for(int i=0; i<m_artPath.count(); ++i)\n    {\n        m_selectNum << i;\n    }\n}\n\nvoid MusicLrcFloatPhotoWidget::photoNext()\n{\n    int page = ceil(m_artPath.count() *1.0 \/ PHOTO_PERLINE) - 1;\n    if( ++m_currentIndex > (page = page < 0 ? 0 : page) )\n    {\n        m_currentIndex = page;\n    }\n    showPhoto();\n}\n\nvoid MusicLrcFloatPhotoWidget::sendUserSelectArtBg1()\n{\n    M_BACKGROUND_PTR->setUserSelectArtIndex(m_currentIndex * PHOTO_PERLINE + 0);\n}\n\nvoid MusicLrcFloatPhotoWidget::sendUserSelectArtBg2()\n{\n    M_BACKGROUND_PTR->setUserSelectArtIndex(m_currentIndex * PHOTO_PERLINE + 1);\n}\n\nvoid MusicLrcFloatPhotoWidget::sendUserSelectArtBg3()\n{\n    M_BACKGROUND_PTR->setUserSelectArtIndex(m_currentIndex * PHOTO_PERLINE + 2);\n}\n\nvoid MusicLrcFloatPhotoWidget::userSelectCheckBoxChecked(int index)\n{\n    bool status = true;\n    switch(index)\n    {\n        case 0: status = m_radio1->isChecked(); break;\n        case 1: status = m_radio2->isChecked(); break;\n        case 2: status = m_radio3->isChecked(); break;\n        default: break;\n    }\n    index = m_currentIndex * PHOTO_PERLINE + index;\n    if(status)\n    {\n        m_selectNum << index;\n    }\n    else\n    {\n        m_selectNum.remove(index);\n    }\n\n    m_checkBox->setChecked(false);\n}\n\nvoid MusicLrcFloatPhotoWidget::selectAllStateChanged(bool state)\n{\n    if(state)\n    {\n        for(int i=0; i<m_artPath.count(); ++i)\n        {\n            m_selectNum << i;\n        }\n        showPhoto();\n    }\n    else\n    {\n        m_radio1->setChecked(false);\n        m_radio2->setChecked(false);\n        m_radio3->setChecked(false);\n        m_selectNum.clear();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"statisticswindow.h\"\n#include \"ui_statisticswindow.h\"\n\n#include <QCloseEvent>\n#include <QDateTime>\n#include <QDebug>\n\nconst int BUFFERSIZE = 65536;\n\n\nStatisticsWindow::StatisticsWindow(QWidget *parent) :\nQDialog(parent),\nStatisticsInterface(),\nui_(new Ui::StatisticsWindow),\n  framerate_(0),\n  videoIndex_(0), \/\/ ringbuffer index\n  videoPackets_(BUFFERSIZE,0), \/\/ ringbuffer\n  audioIndex_(0), \/\/ ringbuffer index\n  audioPackets_(BUFFERSIZE,0), \/\/ ringbuffer\n  sendPacketCount_(0),\n  transferredData_(0),\n  receivePacketCount_(0),\n  receivedData_(0),\n  packetsDropped_(0),\n  lastVideoBitrate_(0),\n  lastAudioBitrate_(0)\n{\n  ui_->setupUi(this);\n  ui_->participantTable->setColumnCount(4); \/\/ more columns can be added later\n  ui_->participantTable->setHorizontalHeaderItem(0, new QTableWidgetItem(QString(\"IP\")));\n  ui_->participantTable->setHorizontalHeaderItem(1, new QTableWidgetItem(QString(\"Port\")));\n  ui_->participantTable->setHorizontalHeaderItem(2, new QTableWidgetItem(QString(\"Audio delay\")));\n  ui_->participantTable->setHorizontalHeaderItem(3, new QTableWidgetItem(QString(\"Video delay\")));\n}\n\nStatisticsWindow::~StatisticsWindow()\n{\n  delete ui_;\n}\n\nvoid StatisticsWindow::closeEvent(QCloseEvent *event)\n{\n  accept();\n}\n\nvoid StatisticsWindow::addNextInterface(StatisticsInterface* next)\n{}\n\nvoid StatisticsWindow::videoInfo(double framerate, QSize resolution)\n{\n  framerate_ = framerate;\n  ui_->framerate_value->setText( QString::number(framerate)+\" fps\");\n  ui_->resolution_value->setText( QString::number(resolution.width()) + \"x\"\n                          + QString::number(resolution.height()));\n}\n\nvoid StatisticsWindow::audioInfo(uint32_t sampleRate, uint16_t channelCount)\n{\n  \/\/ui_->a_framerate_value->setText(QString::number(framerate)+\"fps\");\n  ui_->channels_value->setText(QString::number(channelCount));\n  ui_->sample_rate_value->setText(QString::number(sampleRate) + \" Hz\");\n}\n\nvoid StatisticsWindow::addParticipant(QString ip, QString port)\n{\n  ui_->participantTable->insertRow(ui_->participantTable->rowCount());\n  \/\/ add cells to table\n  ui_->participantTable->setItem(ui_->participantTable->rowCount() -1, 0, new QTableWidgetItem(ip));\n  ui_->participantTable->setItem(ui_->participantTable->rowCount() -1, 1, new QTableWidgetItem(port));\n  ui_->participantTable->setItem(ui_->participantTable->rowCount() -1, 2, new QTableWidgetItem(\"- ms\"));\n  ui_->participantTable->setItem(ui_->participantTable->rowCount() -1, 3, new QTableWidgetItem(\"- ms\"));\n\n  delays_.push_back({0,0});\n\n}\n\nvoid StatisticsWindow::sendDelay(QString type, uint32_t delay)\n{\n  if(type == \"video\" || type == \"Video\")\n  {\n    sendMutex_.lock();\n    ui_->encode_delay_value->setText( QString::number(delay) + \" ms. (not precise)\" );\n    sendMutex_.unlock();\n  }\n  else if(type == \"audio\" || type == \"Audio\")\n  {\n    sendMutex_.lock();\n    ui_->audio_delay_value->setText( QString::number(delay) + \" ms. (not precise)\" );\n    sendMutex_.unlock();\n  }\n}\n\nvoid StatisticsWindow::receiveDelay(uint32_t peer, QString type, int32_t delay)\n{\n  if(type == \"video\" || type == \"Video\")\n  {\n    delays_.at(peer).video = delay;\n    \/\/ui_->participantTable->setItem(peer, 3, new QTableWidgetItem( QString::number(delay) + \" ms\"));\n  }\n  else if(type == \"audio\" || type == \"Audio\")\n  {\n    delays_.at(peer).audio = delay;\n    \/\/ui_->participantTable->setItem(peer, 2, new QTableWidgetItem( QString::number(delay) + \" ms\"));\n  }\n}\n\nvoid StatisticsWindow::addEncodedPacket(QString type, uint16_t size)\n{\n  PacketInfo *packet = new PacketInfo{QDateTime::currentMSecsSinceEpoch(), size};\n\n  if(type == \"video\" || type == \"Video\")\n  {\n    if(videoPackets_[videoIndex_%BUFFERSIZE])\n    {\n      delete videoPackets_.at(videoIndex_%BUFFERSIZE);\n    }\n\n    videoPackets_[videoIndex_%BUFFERSIZE] = packet;\n\n    ++videoIndex_;\n  }\n  else if(type == \"audio\" || type == \"Audio\")\n  {\n    if(audioPackets_[audioIndex_%BUFFERSIZE])\n    {\n      delete audioPackets_.at(audioIndex_%BUFFERSIZE);\n    }\n\n    audioPackets_[audioIndex_%BUFFERSIZE] = packet;\n\n    ++audioIndex_;\n  }\n}\n\nuint32_t StatisticsWindow::bitrate(std::vector<PacketInfo*>& packets, uint32_t index)\n{\n  if(index == 0)\n    return 0;\n\n  uint32_t currentTime = QDateTime::currentMSecsSinceEpoch();\n  uint32_t timeInterval = 0;\n  uint32_t bitrate = 0;\n  uint32_t bitrateInterval = 2000;\n\n  uint32_t i = index - 1;\n\n  PacketInfo* p = packets[i%BUFFERSIZE];\n\n  while(p && timeInterval < bitrateInterval)\n  {\n    bitrate += p->size;\n    if(i != 0)\n      --i;\n    else\n      i = BUFFERSIZE - 1;\n\n    timeInterval = currentTime - p->timestamp;\n    p = packets[i%BUFFERSIZE];\n  }\n\n  \/\/qDebug() << \"Bitrate:\" << bitrate << \"timeInterval:\"  << timeInterval;\n  if(timeInterval)\n    return 8*bitrate\/(timeInterval);\n\n  return 0;\n}\n\nvoid StatisticsWindow::addSendPacket(uint16_t size)\n{\n  sendMutex_.lock();\n  ++sendPacketCount_;\n  transferredData_ += size;\n  sendMutex_.unlock();\n}\n\nvoid StatisticsWindow::addReceivePacket(uint16_t size)\n{\n  receiveMutex_.lock();\n  ++receivePacketCount_;\n  receivedData_ += size;\n  receiveMutex_.unlock();\n}\n\nvoid StatisticsWindow::updateBufferStatus(QString filter, uint16_t buffersize)\n{\n  bufferMutex_.lock();\n  if(buffers_.find(filter) == buffers_.end() || buffers_[filter] != buffersize)\n  {\n    dirtyBuffers_ = true;\n    buffers_[filter] = buffersize;\n  }\n  bufferMutex_.unlock();\n}\n\nvoid StatisticsWindow::packetDropped()\n{\n  ++packetsDropped_;\n}\n\nvoid StatisticsWindow::paintEvent(QPaintEvent *event)\n{\n  if(videoIndex_%15 == 0)\n  {\n    lastVideoBitrate_ = bitrate(videoPackets_, videoIndex_);\n    ui_->video_bitrate_value->setText\n      ( QString::number(lastVideoBitrate_) + \" kbit\/s\" );\n\n    uint index = 0;\n    for(Delays d : delays_)\n    {\n      ui_->participantTable->setItem(index, 2, new QTableWidgetItem( QString::number(d.audio) + \" ms\"));\n      ui_->participantTable->setItem(index, 3, new QTableWidgetItem( QString::number(d.video) + \" ms\"));\n      ++index;\n    }\n  }\n\n  if(audioIndex_%20 == 0)\n  {\n    lastAudioBitrate_ = bitrate(audioPackets_, audioIndex_);\n    ui_->audio_bitrate_value->setText\n      ( QString::number(lastAudioBitrate_) + \" kbit\/s\" );\n  }\n\n  ui_->packets_sent_value->setText( QString::number(sendPacketCount_));\n  ui_->data_sent_value->setText( QString::number(transferredData_));\n  ui_->packets_received_value->setText( QString::number(receivePacketCount_));\n  ui_->data_received_value->setText( QString::number(receivedData_));\n  ui_->packets_skipped_value->setText(QString::number(packetsDropped_));\n\n  if(dirtyBuffers_)\n  {\n    bufferMutex_.lock();\n    ui_->buffer_sizes_value->setText( QString::number(totalBuffers()));\n    dirtyBuffers_ = false;\n    bufferMutex_.unlock();\n  }\n}\n\nuint32_t StatisticsWindow::totalBuffers()\n{\n  uint32_t total = 0;\n  for(auto& it : buffers_)\n  {\n    total += it.second;\n  }\n  return total;\n}\n<commit_msg>Minor text fix.<commit_after>#include \"statisticswindow.h\"\n#include \"ui_statisticswindow.h\"\n\n#include <QCloseEvent>\n#include <QDateTime>\n#include <QDebug>\n\nconst int BUFFERSIZE = 65536;\n\n\nStatisticsWindow::StatisticsWindow(QWidget *parent) :\nQDialog(parent),\nStatisticsInterface(),\nui_(new Ui::StatisticsWindow),\n  framerate_(0),\n  videoIndex_(0), \/\/ ringbuffer index\n  videoPackets_(BUFFERSIZE,0), \/\/ ringbuffer\n  audioIndex_(0), \/\/ ringbuffer index\n  audioPackets_(BUFFERSIZE,0), \/\/ ringbuffer\n  sendPacketCount_(0),\n  transferredData_(0),\n  receivePacketCount_(0),\n  receivedData_(0),\n  packetsDropped_(0),\n  lastVideoBitrate_(0),\n  lastAudioBitrate_(0)\n{\n  ui_->setupUi(this);\n  ui_->participantTable->setColumnCount(4); \/\/ more columns can be added later\n  ui_->participantTable->setHorizontalHeaderItem(0, new QTableWidgetItem(QString(\"IP\")));\n  ui_->participantTable->setHorizontalHeaderItem(1, new QTableWidgetItem(QString(\"Port\")));\n  ui_->participantTable->setHorizontalHeaderItem(2, new QTableWidgetItem(QString(\"Audio delay\")));\n  ui_->participantTable->setHorizontalHeaderItem(3, new QTableWidgetItem(QString(\"Video delay\")));\n}\n\nStatisticsWindow::~StatisticsWindow()\n{\n  delete ui_;\n}\n\nvoid StatisticsWindow::closeEvent(QCloseEvent *event)\n{\n  accept();\n}\n\nvoid StatisticsWindow::addNextInterface(StatisticsInterface* next)\n{}\n\nvoid StatisticsWindow::videoInfo(double framerate, QSize resolution)\n{\n  framerate_ = framerate;\n  ui_->framerate_value->setText( QString::number(framerate)+\" fps\");\n  ui_->resolution_value->setText( QString::number(resolution.width()) + \"x\"\n                          + QString::number(resolution.height()));\n}\n\nvoid StatisticsWindow::audioInfo(uint32_t sampleRate, uint16_t channelCount)\n{\n  \/\/ui_->a_framerate_value->setText(QString::number(framerate)+\"fps\");\n  ui_->channels_value->setText(QString::number(channelCount));\n  ui_->sample_rate_value->setText(QString::number(sampleRate) + \" Hz\");\n}\n\nvoid StatisticsWindow::addParticipant(QString ip, QString port)\n{\n  ui_->participantTable->insertRow(ui_->participantTable->rowCount());\n  \/\/ add cells to table\n  ui_->participantTable->setItem(ui_->participantTable->rowCount() -1, 0, new QTableWidgetItem(ip));\n  ui_->participantTable->setItem(ui_->participantTable->rowCount() -1, 1, new QTableWidgetItem(port));\n  ui_->participantTable->setItem(ui_->participantTable->rowCount() -1, 2, new QTableWidgetItem(\"- ms\"));\n  ui_->participantTable->setItem(ui_->participantTable->rowCount() -1, 3, new QTableWidgetItem(\"- ms\"));\n\n  delays_.push_back({0,0});\n\n}\n\nvoid StatisticsWindow::sendDelay(QString type, uint32_t delay)\n{\n  if(type == \"video\" || type == \"Video\")\n  {\n    sendMutex_.lock();\n    ui_->encode_delay_value->setText( QString::number(delay) + \" ms.\" );\n    sendMutex_.unlock();\n  }\n  else if(type == \"audio\" || type == \"Audio\")\n  {\n    sendMutex_.lock();\n    ui_->audio_delay_value->setText( QString::number(delay) + \" ms.\" );\n    sendMutex_.unlock();\n  }\n}\n\nvoid StatisticsWindow::receiveDelay(uint32_t peer, QString type, int32_t delay)\n{\n  if(type == \"video\" || type == \"Video\")\n  {\n    delays_.at(peer).video = delay;\n    \/\/ui_->participantTable->setItem(peer, 3, new QTableWidgetItem( QString::number(delay) + \" ms\"));\n  }\n  else if(type == \"audio\" || type == \"Audio\")\n  {\n    delays_.at(peer).audio = delay;\n    \/\/ui_->participantTable->setItem(peer, 2, new QTableWidgetItem( QString::number(delay) + \" ms\"));\n  }\n}\n\nvoid StatisticsWindow::addEncodedPacket(QString type, uint16_t size)\n{\n  PacketInfo *packet = new PacketInfo{QDateTime::currentMSecsSinceEpoch(), size};\n\n  if(type == \"video\" || type == \"Video\")\n  {\n    if(videoPackets_[videoIndex_%BUFFERSIZE])\n    {\n      delete videoPackets_.at(videoIndex_%BUFFERSIZE);\n    }\n\n    videoPackets_[videoIndex_%BUFFERSIZE] = packet;\n\n    ++videoIndex_;\n  }\n  else if(type == \"audio\" || type == \"Audio\")\n  {\n    if(audioPackets_[audioIndex_%BUFFERSIZE])\n    {\n      delete audioPackets_.at(audioIndex_%BUFFERSIZE);\n    }\n\n    audioPackets_[audioIndex_%BUFFERSIZE] = packet;\n\n    ++audioIndex_;\n  }\n}\n\nuint32_t StatisticsWindow::bitrate(std::vector<PacketInfo*>& packets, uint32_t index)\n{\n  if(index == 0)\n    return 0;\n\n  uint32_t currentTime = QDateTime::currentMSecsSinceEpoch();\n  uint32_t timeInterval = 0;\n  uint32_t bitrate = 0;\n  uint32_t bitrateInterval = 2000;\n\n  uint32_t i = index - 1;\n\n  PacketInfo* p = packets[i%BUFFERSIZE];\n\n  while(p && timeInterval < bitrateInterval)\n  {\n    bitrate += p->size;\n    if(i != 0)\n      --i;\n    else\n      i = BUFFERSIZE - 1;\n\n    timeInterval = currentTime - p->timestamp;\n    p = packets[i%BUFFERSIZE];\n  }\n\n  \/\/qDebug() << \"Bitrate:\" << bitrate << \"timeInterval:\"  << timeInterval;\n  if(timeInterval)\n    return 8*bitrate\/(timeInterval);\n\n  return 0;\n}\n\nvoid StatisticsWindow::addSendPacket(uint16_t size)\n{\n  sendMutex_.lock();\n  ++sendPacketCount_;\n  transferredData_ += size;\n  sendMutex_.unlock();\n}\n\nvoid StatisticsWindow::addReceivePacket(uint16_t size)\n{\n  receiveMutex_.lock();\n  ++receivePacketCount_;\n  receivedData_ += size;\n  receiveMutex_.unlock();\n}\n\nvoid StatisticsWindow::updateBufferStatus(QString filter, uint16_t buffersize)\n{\n  bufferMutex_.lock();\n  if(buffers_.find(filter) == buffers_.end() || buffers_[filter] != buffersize)\n  {\n    dirtyBuffers_ = true;\n    buffers_[filter] = buffersize;\n  }\n  bufferMutex_.unlock();\n}\n\nvoid StatisticsWindow::packetDropped()\n{\n  ++packetsDropped_;\n}\n\nvoid StatisticsWindow::paintEvent(QPaintEvent *event)\n{\n  if(videoIndex_%15 == 0)\n  {\n    lastVideoBitrate_ = bitrate(videoPackets_, videoIndex_);\n    ui_->video_bitrate_value->setText\n      ( QString::number(lastVideoBitrate_) + \" kbit\/s\" );\n\n    uint index = 0;\n    for(Delays d : delays_)\n    {\n      ui_->participantTable->setItem(index, 2, new QTableWidgetItem( QString::number(d.audio) + \" ms\"));\n      ui_->participantTable->setItem(index, 3, new QTableWidgetItem( QString::number(d.video) + \" ms\"));\n      ++index;\n    }\n  }\n\n  if(audioIndex_%20 == 0)\n  {\n    lastAudioBitrate_ = bitrate(audioPackets_, audioIndex_);\n    ui_->audio_bitrate_value->setText\n      ( QString::number(lastAudioBitrate_) + \" kbit\/s\" );\n  }\n\n  ui_->packets_sent_value->setText( QString::number(sendPacketCount_));\n  ui_->data_sent_value->setText( QString::number(transferredData_));\n  ui_->packets_received_value->setText( QString::number(receivePacketCount_));\n  ui_->data_received_value->setText( QString::number(receivedData_));\n  ui_->packets_skipped_value->setText(QString::number(packetsDropped_));\n\n  if(dirtyBuffers_)\n  {\n    bufferMutex_.lock();\n    ui_->buffer_sizes_value->setText( QString::number(totalBuffers()));\n    dirtyBuffers_ = false;\n    bufferMutex_.unlock();\n  }\n}\n\nuint32_t StatisticsWindow::totalBuffers()\n{\n  uint32_t total = 0;\n  for(auto& it : buffers_)\n  {\n    total += it.second;\n  }\n  return total;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -------------------------------------------------------------------------- *\/\n\/* Copyright 2002-2009, Distributed Systems Architecture Group, Universidad   *\/\n\/* Complutense de Madrid (dsa-research.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 <sqlite3.h>\n\n#include \"Template.h\"\n#include \"template_syntax.h\"\n\n#include <iostream>\n#include <sstream>\n#include <cstring>\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nTemplate::~Template()\n{\n    multimap<string,Attribute *>::iterator  it;\n\n    for ( it = attributes.begin(); it != attributes.end(); it++)\n    {\n        delete it->second;\n    }\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\npthread_mutex_t Template::mutex = PTHREAD_MUTEX_INITIALIZER;\n\nextern \"C\"\n{\n    typedef struct yy_buffer_state * YY_BUFFER_STATE;\n    \n    extern FILE *template_in, *template_out;\n\n    int template_parse(Template * tmpl, char ** errmsg);\n\n    int template_lex_destroy();\n\n    YY_BUFFER_STATE template__scan_string(const char * str);\n\n    void template__delete_buffer(YY_BUFFER_STATE);\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::parse(const char * filename, char **error_msg)\n{\n    int     rc;\n\n    pthread_mutex_lock(&mutex);\n\n    *error_msg = 0;\n\n    template_in = fopen (filename, \"r\");\n\n    if ( template_in == 0 )\n    {\n        goto error_open;\n    }\n\n    rc = template_parse(this,error_msg);\n\n    fclose(template_in);\n\n    template_lex_destroy();\n\n    pthread_mutex_unlock(&mutex);\n\n    return rc;\n\nerror_open:\n    *error_msg = strdup(\"Error opening template file\");\n\n    pthread_mutex_unlock(&mutex);\n\n    return -1;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::parse(const string &parse_str, char **error_msg)\n{\n    YY_BUFFER_STATE     str_buffer = 0;\n    const char *        str;\n    int                 rc;\n\n    pthread_mutex_lock(&mutex);\n\n    *error_msg = 0;\n\n    str = parse_str.c_str();\n\n    str_buffer = template__scan_string(str);\n\n    if (str_buffer == 0)\n    {\n        goto error_yy;\n    }\n\n    rc = template_parse(this,error_msg);\n\n    template__delete_buffer(str_buffer);\n\n    template_lex_destroy();\n\n    pthread_mutex_unlock(&mutex);\n\n    return rc;\n\nerror_yy:\n\n    *error_msg=strdup(\"Error setting scan buffer\");\n\n    pthread_mutex_unlock(&mutex);\n\n    return -1;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid Template::marshall(string &str, const char delim)\n{\n    multimap<string,Attribute *>::iterator  it;\n    string *                                attr;\n\n    for(it=attributes.begin(),str=\"\";it!=attributes.end();it++)\n    {\n        attr = it->second->marshall();\n\n        if ( attr == 0 )\n        {\n            continue;\n        }\n\n        str += it->first + \"=\" + *attr + delim;\n\n        delete attr;\n    }\n}\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid Template::set(Attribute * attr)\n{\n    if ( replace_mode == true )\n    {\n        multimap<string, Attribute *>::iterator         i;\n        pair<multimap<string, Attribute *>::iterator,\n        multimap<string, Attribute *>::iterator>        index;\n\n        index = attributes.equal_range(attr->name());\n\n        for ( i = index.first; i != index.second; i++)\n        {\n            delete i->second;\n        }\n\n        attributes.erase(attr->name());\n    }\n\n    attributes.insert(make_pair(attr->name(),attr));\n};\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::remove(const string& name, vector<Attribute *>& values)\n{\n    multimap<string, Attribute *>::iterator         i;\n    pair<multimap<string, Attribute *>::iterator,\n    multimap<string, Attribute *>::iterator>        index;\n    int                                             j;\n\n    index = attributes.equal_range(name);\n\n    for ( i = index.first,j=0 ; i != index.second ; i++,j++ )\n    {\n        values.push_back(i->second);\n    }\n\n    attributes.erase(index.first,index.second);\n\n    return j;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::get(\n    const string& name,\n    vector<const Attribute*>& values) const\n{\n    multimap<string, Attribute *>::const_iterator       i;\n    pair<multimap<string, Attribute *>::const_iterator,\n    multimap<string, Attribute *>::const_iterator>      index;\n    int                                                 j;\n\n    index = attributes.equal_range(name);\n\n    for ( i = index.first,j=0 ; i != index.second ; i++,j++ )\n    {\n        values.push_back(i->second);\n    }\n\n    return j;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::get(\n    const string& name,\n    vector<Attribute*>& values)\n{\n    multimap<string, Attribute *>::iterator       i;\n    pair<multimap<string, Attribute *>::iterator,\n    multimap<string, Attribute *>::iterator>      index;\n    int                                           j;\n\n    index = attributes.equal_range(name);\n\n    for ( i = index.first,j=0 ; i != index.second ; i++,j++ )\n    {\n        values.push_back(i->second);\n    }\n\n    return j;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid Template::get(\n        string& name,\n        string& value) const\n{\n    vector<const Attribute *>   attrs;\n    const SingleAttribute *     sattr;\n    int                         rc;\n\n    transform (name.begin(),name.end(),name.begin(),(int(*)(int))toupper);\n\n    rc = get(name,attrs);\n\n    if  (rc == 0)\n    {\n        value = \"\";\n        return;\n    }\n\n    sattr = dynamic_cast<const SingleAttribute *>(attrs[0]);\n\n    if ( sattr != 0 )\n    {\n        value = sattr->value();\n    }\n    else\n    {\n        value=\"\";\n    }\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid Template::get(\n        string& name,\n        int&    value) const\n{\n    string sval;\n\n    get(name, sval);\n\n    if ( sval == \"\" )\n    {\n        value = 0;\n        return;\n    }\n\n    istringstream iss(sval);\n\n    iss >> value;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nstring& Template::to_xml(string& xml) const\n{\n    multimap<string,Attribute *>::const_iterator  it;\n    ostringstream                   \t\toss;\n    string *                                s;\n\n    oss << \"<\" << xml_root << \">\";\n\n    for ( it = attributes.begin(); it!=attributes.end(); it++)\n    {\n        s = it->second->to_xml();\n\n        oss << *s;\n\n        delete s;\n    }\n\n    oss << \"<\/\" << xml_root << \">\";\n\n    xml = oss.str();\n\n\treturn xml;\n}\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nstring& Template::to_str(string& str) const\n{\n\tostringstream os;\n    multimap<string,Attribute *>::const_iterator  it;\n    string *                                s;\n\n    for ( it = attributes.begin(); it!=attributes.end(); it++)\n    {\n        s = it->second->marshall(\",\");\n\n        os << endl << \"\\t\" << it->first << separator << *s;\n\n        delete s;\n    }\n\n\tstr = os.str();\n    return str;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nostream& operator << (ostream& os, const Template& t)\n{\n\tstring str;\n\t\n\tos << t.to_str(str);\n\t\n    return os;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\n<commit_msg>Compilation error gcc 4.4<commit_after>\/* -------------------------------------------------------------------------- *\/\n\/* Copyright 2002-2009, Distributed Systems Architecture Group, Universidad   *\/\n\/* Complutense de Madrid (dsa-research.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 <sqlite3.h>\n\n#include \"Template.h\"\n#include \"template_syntax.h\"\n\n#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nTemplate::~Template()\n{\n    multimap<string,Attribute *>::iterator  it;\n\n    for ( it = attributes.begin(); it != attributes.end(); it++)\n    {\n        delete it->second;\n    }\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\npthread_mutex_t Template::mutex = PTHREAD_MUTEX_INITIALIZER;\n\nextern \"C\"\n{\n    typedef struct yy_buffer_state * YY_BUFFER_STATE;\n    \n    extern FILE *template_in, *template_out;\n\n    int template_parse(Template * tmpl, char ** errmsg);\n\n    int template_lex_destroy();\n\n    YY_BUFFER_STATE template__scan_string(const char * str);\n\n    void template__delete_buffer(YY_BUFFER_STATE);\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::parse(const char * filename, char **error_msg)\n{\n    int     rc;\n\n    pthread_mutex_lock(&mutex);\n\n    *error_msg = 0;\n\n    template_in = fopen (filename, \"r\");\n\n    if ( template_in == 0 )\n    {\n        goto error_open;\n    }\n\n    rc = template_parse(this,error_msg);\n\n    fclose(template_in);\n\n    template_lex_destroy();\n\n    pthread_mutex_unlock(&mutex);\n\n    return rc;\n\nerror_open:\n    *error_msg = strdup(\"Error opening template file\");\n\n    pthread_mutex_unlock(&mutex);\n\n    return -1;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::parse(const string &parse_str, char **error_msg)\n{\n    YY_BUFFER_STATE     str_buffer = 0;\n    const char *        str;\n    int                 rc;\n\n    pthread_mutex_lock(&mutex);\n\n    *error_msg = 0;\n\n    str = parse_str.c_str();\n\n    str_buffer = template__scan_string(str);\n\n    if (str_buffer == 0)\n    {\n        goto error_yy;\n    }\n\n    rc = template_parse(this,error_msg);\n\n    template__delete_buffer(str_buffer);\n\n    template_lex_destroy();\n\n    pthread_mutex_unlock(&mutex);\n\n    return rc;\n\nerror_yy:\n\n    *error_msg=strdup(\"Error setting scan buffer\");\n\n    pthread_mutex_unlock(&mutex);\n\n    return -1;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid Template::marshall(string &str, const char delim)\n{\n    multimap<string,Attribute *>::iterator  it;\n    string *                                attr;\n\n    for(it=attributes.begin(),str=\"\";it!=attributes.end();it++)\n    {\n        attr = it->second->marshall();\n\n        if ( attr == 0 )\n        {\n            continue;\n        }\n\n        str += it->first + \"=\" + *attr + delim;\n\n        delete attr;\n    }\n}\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid Template::set(Attribute * attr)\n{\n    if ( replace_mode == true )\n    {\n        multimap<string, Attribute *>::iterator         i;\n        pair<multimap<string, Attribute *>::iterator,\n        multimap<string, Attribute *>::iterator>        index;\n\n        index = attributes.equal_range(attr->name());\n\n        for ( i = index.first; i != index.second; i++)\n        {\n            delete i->second;\n        }\n\n        attributes.erase(attr->name());\n    }\n\n    attributes.insert(make_pair(attr->name(),attr));\n};\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::remove(const string& name, vector<Attribute *>& values)\n{\n    multimap<string, Attribute *>::iterator         i;\n    pair<multimap<string, Attribute *>::iterator,\n    multimap<string, Attribute *>::iterator>        index;\n    int                                             j;\n\n    index = attributes.equal_range(name);\n\n    for ( i = index.first,j=0 ; i != index.second ; i++,j++ )\n    {\n        values.push_back(i->second);\n    }\n\n    attributes.erase(index.first,index.second);\n\n    return j;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::get(\n    const string& name,\n    vector<const Attribute*>& values) const\n{\n    multimap<string, Attribute *>::const_iterator       i;\n    pair<multimap<string, Attribute *>::const_iterator,\n    multimap<string, Attribute *>::const_iterator>      index;\n    int                                                 j;\n\n    index = attributes.equal_range(name);\n\n    for ( i = index.first,j=0 ; i != index.second ; i++,j++ )\n    {\n        values.push_back(i->second);\n    }\n\n    return j;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nint Template::get(\n    const string& name,\n    vector<Attribute*>& values)\n{\n    multimap<string, Attribute *>::iterator       i;\n    pair<multimap<string, Attribute *>::iterator,\n    multimap<string, Attribute *>::iterator>      index;\n    int                                           j;\n\n    index = attributes.equal_range(name);\n\n    for ( i = index.first,j=0 ; i != index.second ; i++,j++ )\n    {\n        values.push_back(i->second);\n    }\n\n    return j;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid Template::get(\n        string& name,\n        string& value) const\n{\n    vector<const Attribute *>   attrs;\n    const SingleAttribute *     sattr;\n    int                         rc;\n\n    transform (name.begin(),name.end(),name.begin(),(int(*)(int))toupper);\n\n    rc = get(name,attrs);\n\n    if  (rc == 0)\n    {\n        value = \"\";\n        return;\n    }\n\n    sattr = dynamic_cast<const SingleAttribute *>(attrs[0]);\n\n    if ( sattr != 0 )\n    {\n        value = sattr->value();\n    }\n    else\n    {\n        value=\"\";\n    }\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid Template::get(\n        string& name,\n        int&    value) const\n{\n    string sval;\n\n    get(name, sval);\n\n    if ( sval == \"\" )\n    {\n        value = 0;\n        return;\n    }\n\n    istringstream iss(sval);\n\n    iss >> value;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nstring& Template::to_xml(string& xml) const\n{\n    multimap<string,Attribute *>::const_iterator  it;\n    ostringstream                   \t\toss;\n    string *                                s;\n\n    oss << \"<\" << xml_root << \">\";\n\n    for ( it = attributes.begin(); it!=attributes.end(); it++)\n    {\n        s = it->second->to_xml();\n\n        oss << *s;\n\n        delete s;\n    }\n\n    oss << \"<\/\" << xml_root << \">\";\n\n    xml = oss.str();\n\n\treturn xml;\n}\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nstring& Template::to_str(string& str) const\n{\n\tostringstream os;\n    multimap<string,Attribute *>::const_iterator  it;\n    string *                                s;\n\n    for ( it = attributes.begin(); it!=attributes.end(); it++)\n    {\n        s = it->second->marshall(\",\");\n\n        os << endl << \"\\t\" << it->first << separator << *s;\n\n        delete s;\n    }\n\n\tstr = os.str();\n    return str;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nostream& operator << (ostream& os, const Template& t)\n{\n\tstring str;\n\t\n\tos << t.to_str(str);\n\t\n    return os;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\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 <chainparams.h>\n#include <compressor.h>\n#include <core_io.h>\n#include <core_memusage.h>\n#include <policy\/policy.h>\n#include <pubkey.h>\n#include <script\/descriptor.h>\n#include <script\/script.h>\n#include <script\/sign.h>\n#include <script\/signingprovider.h>\n#include <script\/standard.h>\n#include <streams.h>\n#include <test\/fuzz\/fuzz.h>\n#include <util\/memory.h>\n\nvoid initialize()\n{\n    \/\/ Fuzzers using pubkey must hold an ECCVerifyHandle.\n    static const auto verify_handle = MakeUnique<ECCVerifyHandle>();\n}\n\nvoid test_one_input(const std::vector<uint8_t>& buffer)\n{\n    const CScript script(buffer.begin(), buffer.end());\n\n    std::vector<unsigned char> compressed;\n    (void)CompressScript(script, compressed);\n\n    CTxDestination address;\n    (void)ExtractDestination(script, address);\n\n    txnouttype type_ret;\n    std::vector<CTxDestination> addresses;\n    int required_ret;\n    (void)ExtractDestinations(script, type_ret, addresses, required_ret);\n\n    (void)GetScriptForWitness(script);\n\n    const FlatSigningProvider signing_provider;\n    (void)InferDescriptor(script, signing_provider);\n\n    (void)IsSegWitOutput(signing_provider, script);\n\n    (void)IsSolvable(signing_provider, script);\n\n    txnouttype which_type;\n    (void)IsStandard(script, which_type);\n\n    (void)RecursiveDynamicUsage(script);\n\n    std::vector<std::vector<unsigned char>> solutions;\n    (void)Solver(script, solutions);\n\n    (void)script.HasValidOps();\n    (void)script.IsPayToScriptHash();\n    (void)script.IsPayToWitnessScriptHash();\n    (void)script.IsPushOnly();\n    (void)script.IsUnspendable();\n    (void)script.GetSigOpCount(\/* fAccurate= *\/ false);\n}\n<commit_msg>tests: Fuzz additional functions in the script fuzzing harness<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 <chainparams.h>\n#include <compressor.h>\n#include <core_io.h>\n#include <core_memusage.h>\n#include <policy\/policy.h>\n#include <pubkey.h>\n#include <script\/descriptor.h>\n#include <script\/script.h>\n#include <script\/sign.h>\n#include <script\/signingprovider.h>\n#include <script\/standard.h>\n#include <streams.h>\n#include <test\/fuzz\/fuzz.h>\n#include <univalue.h>\n#include <util\/memory.h>\n\nvoid initialize()\n{\n    \/\/ Fuzzers using pubkey must hold an ECCVerifyHandle.\n    static const auto verify_handle = MakeUnique<ECCVerifyHandle>();\n\n    SelectParams(CBaseChainParams::REGTEST);\n}\n\nvoid test_one_input(const std::vector<uint8_t>& buffer)\n{\n    const CScript script(buffer.begin(), buffer.end());\n\n    std::vector<unsigned char> compressed;\n    if (CompressScript(script, compressed)) {\n        const unsigned int size = compressed[0];\n        assert(size >= 0 && size <= 5);\n        CScript decompressed_script;\n        const bool ok = DecompressScript(decompressed_script, size, compressed);\n        assert(ok);\n    }\n\n    for (unsigned int size = 0; size < 6; ++size) {\n        std::vector<unsigned char> vch(GetSpecialScriptSize(size), 0x00);\n        vch.insert(vch.end(), buffer.begin(), buffer.end());\n        CScript decompressed_script;\n        (void)DecompressScript(decompressed_script, size, vch);\n    }\n\n    CTxDestination address;\n    (void)ExtractDestination(script, address);\n\n    txnouttype type_ret;\n    std::vector<CTxDestination> addresses;\n    int required_ret;\n    (void)ExtractDestinations(script, type_ret, addresses, required_ret);\n\n    (void)GetScriptForWitness(script);\n\n    const FlatSigningProvider signing_provider;\n    (void)InferDescriptor(script, signing_provider);\n\n    (void)IsSegWitOutput(signing_provider, script);\n\n    (void)IsSolvable(signing_provider, script);\n\n    txnouttype which_type;\n    (void)IsStandard(script, which_type);\n\n    (void)RecursiveDynamicUsage(script);\n\n    std::vector<std::vector<unsigned char>> solutions;\n    (void)Solver(script, solutions);\n\n    (void)script.HasValidOps();\n    (void)script.IsPayToScriptHash();\n    (void)script.IsPayToWitnessScriptHash();\n    (void)script.IsPushOnly();\n    (void)script.IsUnspendable();\n    (void)script.GetSigOpCount(\/* fAccurate= *\/ false);\n\n    (void)FormatScript(script);\n    (void)ScriptToAsmStr(script, false);\n    (void)ScriptToAsmStr(script, true);\n\n    UniValue o1(UniValue::VOBJ);\n    ScriptPubKeyToUniv(script, o1, true);\n    UniValue o2(UniValue::VOBJ);\n    ScriptPubKeyToUniv(script, o2, false);\n    UniValue o3(UniValue::VOBJ);\n    ScriptToUniv(script, o3, true);\n    UniValue o4(UniValue::VOBJ);\n    ScriptToUniv(script, o4, false);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ memory_test.cpp\n#include <counting_allocator.h>\n#include \"test.h\"\n\nTEST(CountingAllocatorConstructorsTest, DefaultConstructor)\n{\n  using namespace StevensDev;\n\n  sgdm::CountingAllocator<int> *a;\n  a = new sgdm::CountingAllocator<int>;\n\n  ASSERT_TRUE(a != 0);\n  ASSERT_TRUE(a->getAllocationCount() == 0);\n  ASSERT_TRUE(a->getReleaseCount() == 0);\n  ASSERT_TRUE(a->getOutstandingCount() == 0);\n}\n\nTEST(CountingAllocatorConstructorsTest, CopyConstructor)\n{\n  using namespace StevensDev;\n\n  sgdm::CountingAllocator<int> *a;\n  sgdm::CountingAllocator<int> *b;\n  a = new sgdm::CountingAllocator<int>;\n  b = a;\n\n  ASSERT_TRUE(b == a);\n}\n\nTEST(CountingAllocatorTrackingTest, AllocationCounting)\n{\n    using namespace StevensDev;\n\n    int *a, *b;\n\n    sgdm::CountingAllocator<int> *alloc;\n    alloc = new sgdm::CountingAllocator<int>;\n\n    a = alloc->get( 4 );\n    b = alloc->get( 4 );\n\n    ASSERT_TRUE( alloc->getAllocationCount() == 2 );\n    ASSERT_TRUE( sgdm::CountingAllocator<int>::getTotalAllocationCount() == 2 );\n\n    alloc->release( a, 1 );\n\n    ASSERT_TRUE( alloc->getReleaseCount() == 1 );\n    ASSERT_TRUE( sgdm::CountingAllocator<int>::getTotalReleaseCount() == 1 );\n    ASSERT_TRUE( alloc->getOutstandingCount() == 1 );\n    ASSERT_TRUE(\n        sgdm::CountingAllocator<int>::getTotalOutstandingCount() == 1 );\n}\n<commit_msg>Add more to the DynamicArrayMemory test<commit_after>\/\/ memory_test.cpp\n#include <counting_allocator.h>\n#include \"test.h\"\n\nTEST(CountingAllocatorConstructorsTest, DefaultConstructor)\n{\n  using namespace StevensDev;\n\n  sgdm::CountingAllocator<int> *a;\n  a = new sgdm::CountingAllocator<int>;\n\n  ASSERT_TRUE(a != 0);\n  ASSERT_TRUE(a->getAllocationCount() == 0);\n  ASSERT_TRUE(a->getReleaseCount() == 0);\n  ASSERT_TRUE(a->getOutstandingCount() == 0);\n}\n\nTEST(CountingAllocatorConstructorsTest, CopyConstructor)\n{\n  using namespace StevensDev;\n\n  sgdm::CountingAllocator<int> *a;\n  sgdm::CountingAllocator<int> *b;\n  a = new sgdm::CountingAllocator<int>;\n  b = a;\n\n  ASSERT_TRUE(b == a);\n}\n\nTEST(CountingAllocatorTrackingTest, AllocationCounting)\n{\n    using namespace StevensDev;\n\n    int *a, *b;\n\n    sgdm::CountingAllocator<int> *alloc;\n    alloc = new sgdm::CountingAllocator<int>;\n\n    a = alloc->get( 4 );\n    b = alloc->get( 4 );\n\n    ASSERT_TRUE( alloc->getAllocationCount() == 2 );\n    ASSERT_TRUE( sgdm::CountingAllocator<int>::getTotalAllocationCount() == 2 );\n\n    alloc->release( a, 1 );\n\n    ASSERT_TRUE( alloc->getReleaseCount() == 1 );\n    ASSERT_TRUE( sgdm::CountingAllocator<int>::getTotalReleaseCount() == 1 );\n    ASSERT_TRUE( alloc->getOutstandingCount() == 1 );\n    ASSERT_TRUE(\n        sgdm::CountingAllocator<int>::getTotalOutstandingCount() == 1 );\n\n    alloc->release( b, 1 );\n    ASSERT_TRUE( alloc->getReleaseCount() == 2 );\n    ASSERT_TRUE( sgdm::CountingAllocator<int>::getTotalReleaseCount() == 2 );\n    ASSERT_TRUE( alloc->getOutstandingCount() == 0 );\n    ASSERT_TRUE(\n        sgdm::CountingAllocator<int>::getTotalOutstandingCount() == 0 );\n}\n<|endoftext|>"}
{"text":"<commit_before>#if (defined(__clang__) || defined(__GNUC__)) && defined(__x86_64__)\n\n#include \"..\/test.h\"\n#include \"taocppjson\/include\/tao\/json.hh\"\n\nstatic void GenStat(Stat& stat, const tao::json::value& v){\n   switch (v.type()) {\n      case tao::json::type::ARRAY:\n         for (auto& element : v.get_array()) {\n            GenStat(stat, element);\n         }\n         stat.arrayCount++;\n         stat.elementCount += v.get_array().size();\n         break;\n\n      case tao::json::type::OBJECT:\n         for (auto& element : v.get_object()) {\n            GenStat(stat, element.second);\n            stat.stringLength += element.first.size();\n         }\n         stat.objectCount++;\n         stat.memberCount += v.get_object().size();\n         stat.stringCount += v.get_object().size();\n         break;\n\n      case tao::json::type::STRING:\n         stat.stringCount++;\n         stat.stringLength += v.get_string().size();\n         break;\n\n      case tao::json::type::SIGNED:\n      case tao::json::type::UNSIGNED:\n      case tao::json::type::DOUBLE:\n         stat.numberCount++;\n         break;\n\n      case tao::json::type::BOOL:\n         if (v.get_bool())\n            stat.trueCount++;\n         else\n            stat.falseCount++;\n         break;\n\n      case tao::json::type::NULL_:\n         stat.nullCount++;\n         break;\n\n      case tao::json::type::POINTER:\n         \/\/ not applicable in this benchmark\n         throw std::runtime_error( \"code should be unreachable\" );\n   }\n}\n\nclass TAOCPPJSONParseResult : public ParseResultBase {\npublic:\n   tao::json::value root;\n};\n\nclass TAOCPPJSONStringResult : public StringResultBase {\npublic:\n   virtual const char* c_str() const { return s.c_str(); }\n\n   std::string s;\n};\nclass TAOCPPJSONTest : public TestBase {\npublic:\n#if TEST_INFO\n   virtual const char* GetName() const { return \"taocpp\/json (C++11)\"; }\n   virtual const char* GetFilename() const { return __FILE__; }\n#endif\n\n#if TEST_PARSE\n   virtual ParseResultBase* Parse(const char* j, size_t length) const {\n      (void)length;\n      TAOCPPJSONParseResult* pr = new TAOCPPJSONParseResult;\n      try {\n         pr->root = tao::json::from_string(j);\n      }\n      catch (...) {\n         delete pr;\n         return 0;\n      }\n      return pr;\n   }\n#endif\n\n#if TEST_STRINGIFY\n   virtual StringResultBase* Stringify(const ParseResultBase* parseResult) const {\n      const TAOCPPJSONParseResult* pr = static_cast<const TAOCPPJSONParseResult*>(parseResult);\n      TAOCPPJSONStringResult* sr = new TAOCPPJSONStringResult;\n      sr->s = to_string(pr->root);\n      return sr;\n   }\n#endif\n\n#if TEST_PRETTIFY\n   virtual StringResultBase* Prettify(const ParseResultBase* parseResult) const {\n      const TAOCPPJSONParseResult* pr = static_cast<const TAOCPPJSONParseResult*>(parseResult);\n      TAOCPPJSONStringResult* sr = new TAOCPPJSONStringResult;\n      sr->s = to_string(pr->root, 4);\n      return sr;\n   }\n#endif\n\n#if TEST_STATISTICS\n   virtual bool Statistics(const ParseResultBase* parseResult, Stat* stat) const {\n      const TAOCPPJSONParseResult* pr = static_cast<const TAOCPPJSONParseResult*>(parseResult);\n      memset(stat, 0, sizeof(Stat));\n      GenStat(*stat, pr->root);\n      return true;\n   }\n#endif\n\n#if TEST_CONFORMANCE\n   virtual bool ParseDouble(const char* j, double* d) const {\n      try {\n         auto root = tao::json::from_string(j);\n         *d = root[0].get_double();\n         return true;\n      }\n      catch (...) {\n      }\n      return false;\n   }\n\n   virtual bool ParseString(const char* j, std::string& s) const {\n      try {\n         auto root = tao::json::from_string(j);\n         s = root[0].get_string();\n         return true;\n      }\n      catch (...) {\n      }\n      return false;\n   }\n#endif\n};\n\nREGISTER_TEST(TAOCPPJSONTest);\n\n#endif\n<commit_msg>Use `length` to avoid copy of input<commit_after>#if (defined(__clang__) || defined(__GNUC__)) && defined(__x86_64__)\n\n#include \"..\/test.h\"\n#include \"taocppjson\/include\/tao\/json.hh\"\n\nstatic void GenStat(Stat& stat, const tao::json::value& v){\n   switch (v.type()) {\n      case tao::json::type::ARRAY:\n         for (auto& element : v.get_array()) {\n            GenStat(stat, element);\n         }\n         stat.arrayCount++;\n         stat.elementCount += v.get_array().size();\n         break;\n\n      case tao::json::type::OBJECT:\n         for (auto& element : v.get_object()) {\n            GenStat(stat, element.second);\n            stat.stringLength += element.first.size();\n         }\n         stat.objectCount++;\n         stat.memberCount += v.get_object().size();\n         stat.stringCount += v.get_object().size();\n         break;\n\n      case tao::json::type::STRING:\n         stat.stringCount++;\n         stat.stringLength += v.get_string().size();\n         break;\n\n      case tao::json::type::SIGNED:\n      case tao::json::type::UNSIGNED:\n      case tao::json::type::DOUBLE:\n         stat.numberCount++;\n         break;\n\n      case tao::json::type::BOOL:\n         if (v.get_bool())\n            stat.trueCount++;\n         else\n            stat.falseCount++;\n         break;\n\n      case tao::json::type::NULL_:\n         stat.nullCount++;\n         break;\n\n      case tao::json::type::POINTER:\n         \/\/ not applicable in this benchmark\n         throw std::runtime_error( \"code should be unreachable\" );\n   }\n}\n\nclass TAOCPPJSONParseResult : public ParseResultBase {\npublic:\n   tao::json::value root;\n};\n\nclass TAOCPPJSONStringResult : public StringResultBase {\npublic:\n   virtual const char* c_str() const { return s.c_str(); }\n\n   std::string s;\n};\nclass TAOCPPJSONTest : public TestBase {\npublic:\n#if TEST_INFO\n   virtual const char* GetName() const { return \"taocpp\/json (C++11)\"; }\n   virtual const char* GetFilename() const { return __FILE__; }\n#endif\n\n#if TEST_PARSE\n   virtual ParseResultBase* Parse(const char* j, size_t length) const {\n      TAOCPPJSONParseResult* pr = new TAOCPPJSONParseResult;\n      try {\n         pr->root = tao::json::from_string(j, length);\n      }\n      catch (...) {\n         delete pr;\n         return 0;\n      }\n      return pr;\n   }\n#endif\n\n#if TEST_STRINGIFY\n   virtual StringResultBase* Stringify(const ParseResultBase* parseResult) const {\n      const TAOCPPJSONParseResult* pr = static_cast<const TAOCPPJSONParseResult*>(parseResult);\n      TAOCPPJSONStringResult* sr = new TAOCPPJSONStringResult;\n      sr->s = to_string(pr->root);\n      return sr;\n   }\n#endif\n\n#if TEST_PRETTIFY\n   virtual StringResultBase* Prettify(const ParseResultBase* parseResult) const {\n      const TAOCPPJSONParseResult* pr = static_cast<const TAOCPPJSONParseResult*>(parseResult);\n      TAOCPPJSONStringResult* sr = new TAOCPPJSONStringResult;\n      sr->s = to_string(pr->root, 4);\n      return sr;\n   }\n#endif\n\n#if TEST_STATISTICS\n   virtual bool Statistics(const ParseResultBase* parseResult, Stat* stat) const {\n      const TAOCPPJSONParseResult* pr = static_cast<const TAOCPPJSONParseResult*>(parseResult);\n      memset(stat, 0, sizeof(Stat));\n      GenStat(*stat, pr->root);\n      return true;\n   }\n#endif\n\n#if TEST_CONFORMANCE\n   virtual bool ParseDouble(const char* j, double* d) const {\n      try {\n         auto root = tao::json::from_string(j);\n         *d = root[0].get_double();\n         return true;\n      }\n      catch (...) {\n      }\n      return false;\n   }\n\n   virtual bool ParseString(const char* j, std::string& s) const {\n      try {\n         auto root = tao::json::from_string(j);\n         s = root[0].get_string();\n         return true;\n      }\n      catch (...) {\n      }\n      return false;\n   }\n#endif\n};\n\nREGISTER_TEST(TAOCPPJSONTest);\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2015 WebAssembly Community Group participants\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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\/\/ A WebAssembly shell, loads a .wast file (WebAssembly in S-Expression format)\n\/\/ and executes it. This provides similar functionality as the reference\n\/\/ interpreter, like assert_* calls, so it can run the spec test suite.\n\/\/\n\n#include <memory>\n\n#include \"pass.h\"\n#include \"shell-interface.h\"\n#include \"support\/command-line.h\"\n#include \"support\/file.h\"\n#include \"wasm-interpreter.h\"\n#include \"wasm-printing.h\"\n#include \"wasm-s-parser.h\"\n#include \"wasm-validator.h\"\n\nusing namespace cashew;\nusing namespace wasm;\n\n\/\/\n\/\/ An invocation into a module\n\/\/\n\nstruct Invocation {\n  ModuleInstance* instance;\n  IString name;\n  LiteralList arguments;\n\n  Invocation(Element& invoke, ModuleInstance* instance, SExpressionWasmBuilder& builder) : instance(instance) {\n    assert(invoke[0]->str() == INVOKE);\n    name = invoke[1]->str();\n    for (size_t j = 2; j < invoke.size(); j++) {\n      Expression* argument = builder.parseExpression(*invoke[j]);\n      arguments.push_back(argument->dynCast<Const>()->value);\n    }\n  }\n\n  Literal invoke() {\n    return instance->callExport(name, arguments);\n  }\n};\n\nstatic void verify_result(Literal a, Literal b) {\n  if (a == b) return;\n  \/\/ accept equal nans if equal in all bits\n  assert(a.type == b.type);\n  if (a.type == f32) {\n    assert(a.reinterpreti32() == b.reinterpreti32());\n  } else if (a.type == f64) {\n    assert(a.reinterpreti64() == b.reinterpreti64());\n  } else {\n    abort();\n  }\n}\n\nstatic void run_asserts(size_t* i, bool* checked, Module* wasm,\n                        Element* root,\n                        std::unique_ptr<SExpressionWasmBuilder>* builder,\n                        Name entry) {\n  std::unique_ptr<ShellExternalInterface> interface;\n  std::unique_ptr<ModuleInstance> instance;\n  if (wasm) {\n    interface = wasm::make_unique<ShellExternalInterface>(); \/\/ prefix make_unique to work around visual studio bugs\n    instance = wasm::make_unique<ModuleInstance>(*wasm, interface.get());\n    if (entry.is()) {\n      Function* function = wasm->getFunction(entry);\n      if (!function) {\n        std::cerr << \"Unknown entry \" << entry << std::endl;\n      } else {\n        LiteralList arguments;\n        for (WasmType param : function->params) {\n          arguments.push_back(Literal(param));\n        }\n        try {\n          instance->callExport(entry, arguments);\n        } catch (ExitException&) {\n        }\n      }\n    }\n  }\n  while (*i < root->size()) {\n    Element& curr = *(*root)[*i];\n    IString id = curr[0]->str();\n    if (id == MODULE) break;\n    *checked = true;\n    Colors::red(std::cerr);\n    std::cerr << *i << '\/' << (root->size() - 1);\n    Colors::green(std::cerr);\n    std::cerr << \" CHECKING: \";\n    Colors::normal(std::cerr);\n    std::cerr << curr;\n    Colors::green(std::cerr);\n    std::cerr << \" [line: \" << curr.line << \"]\\n\";\n    Colors::normal(std::cerr);\n    if (id == ASSERT_INVALID) {\n      \/\/ a module invalidity test\n      Module wasm;\n      bool invalid = false;\n      std::unique_ptr<SExpressionWasmBuilder> builder;\n      try {\n        builder = std::unique_ptr<SExpressionWasmBuilder>(\n          new SExpressionWasmBuilder(wasm, *curr[1])\n        );\n      } catch (const ParseException&) {\n        invalid = true;\n      }\n      if (!invalid) {\n        \/\/ maybe parsed ok, but otherwise incorrect\n        invalid = !WasmValidator().validate(wasm);\n      }\n      assert(invalid);\n    } else if (id == INVOKE) {\n      assert(wasm);\n      Invocation invocation(curr, instance.get(), *builder->get());\n      invocation.invoke();\n    } else {\n      \/\/ an invoke test\n      assert(wasm);\n      bool trapped = false;\n      WASM_UNUSED(trapped);\n      Literal result;\n      try {\n        Invocation invocation(*curr[1], instance.get(), *builder->get());\n        result = invocation.invoke();\n      } catch (const TrapException&) {\n        trapped = true;\n      }\n      if (id == ASSERT_RETURN) {\n        assert(!trapped);\n        if (curr.size() >= 3) {\n          Literal expected = builder->get()\n                                 ->parseExpression(*curr[2])\n                                 ->dynCast<Const>()\n                                 ->value;\n          std::cerr << \"seen \" << result << \", expected \" << expected << '\\n';\n          verify_result(expected, result);\n        } else {\n          Literal expected;\n          std::cerr << \"seen \" << result << \", expected \" << expected << '\\n';\n          verify_result(expected, result);\n        }\n      }\n      if (id == ASSERT_TRAP) assert(trapped);\n    }\n    *i += 1;\n  }\n}\n\n\/\/\n\/\/ main\n\/\/\n\nint main(int argc, const char* argv[]) {\n  Name entry;\n\n  Options options(\"wasm-shell\", \"Execute .wast files\");\n  options\n      .add(\n          \"--entry\", \"-e\", \"call the entry point after parsing the module\",\n          Options::Arguments::One,\n          [&entry](Options*, const std::string& argument) { entry = argument; })\n      .add_positional(\"INFILE\", Options::Arguments::One,\n                      [](Options* o, const std::string& argument) {\n                        o->extra[\"infile\"] = argument;\n                      });\n  options.parse(argc, argv);\n\n  auto input(read_file<std::vector<char>>(options.extra[\"infile\"], Flags::Text, options.debug ? Flags::Debug : Flags::Release));\n\n  bool checked = false;\n\n  try {\n    if (options.debug) std::cerr << \"parsing text to s-expressions...\\n\";\n    SExpressionParser parser(input.data());\n    Element& root = *parser.root;\n\n    \/\/ A .wast may have multiple modules, with some asserts after them\n    size_t i = 0;\n    while (i < root.size()) {\n      Element& curr = *root[i];\n      IString id = curr[0]->str();\n      if (id == MODULE) {\n        if (options.debug) std::cerr << \"parsing s-expressions to wasm...\\n\";\n        Module wasm;\n        std::unique_ptr<SExpressionWasmBuilder> builder;\n        builder = wasm::make_unique<SExpressionWasmBuilder>(wasm, *root[i]);\n        i++;\n        assert(WasmValidator().validate(wasm));\n        run_asserts(&i, &checked, &wasm, &root, &builder, entry);\n      } else {\n        run_asserts(&i, &checked, nullptr, &root, nullptr, entry);\n      }\n    }\n  } catch (ParseException& p) {\n    p.dump(std::cerr);\n    abort();\n  }\n\n  if (checked) {\n    Colors::green(std::cerr);\n    Colors::bold(std::cerr);\n    std::cerr << \"all checks passed.\\n\";\n    Colors::normal(std::cerr);\n  }\n}\n<commit_msg>better printing when assert_invalids fail<commit_after>\/*\n * Copyright 2015 WebAssembly Community Group participants\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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\/\/ A WebAssembly shell, loads a .wast file (WebAssembly in S-Expression format)\n\/\/ and executes it. This provides similar functionality as the reference\n\/\/ interpreter, like assert_* calls, so it can run the spec test suite.\n\/\/\n\n#include <memory>\n\n#include \"pass.h\"\n#include \"shell-interface.h\"\n#include \"support\/command-line.h\"\n#include \"support\/file.h\"\n#include \"wasm-interpreter.h\"\n#include \"wasm-printing.h\"\n#include \"wasm-s-parser.h\"\n#include \"wasm-validator.h\"\n\nusing namespace cashew;\nusing namespace wasm;\n\n\/\/\n\/\/ An invocation into a module\n\/\/\n\nstruct Invocation {\n  ModuleInstance* instance;\n  IString name;\n  LiteralList arguments;\n\n  Invocation(Element& invoke, ModuleInstance* instance, SExpressionWasmBuilder& builder) : instance(instance) {\n    assert(invoke[0]->str() == INVOKE);\n    name = invoke[1]->str();\n    for (size_t j = 2; j < invoke.size(); j++) {\n      Expression* argument = builder.parseExpression(*invoke[j]);\n      arguments.push_back(argument->dynCast<Const>()->value);\n    }\n  }\n\n  Literal invoke() {\n    return instance->callExport(name, arguments);\n  }\n};\n\nstatic void verify_result(Literal a, Literal b) {\n  if (a == b) return;\n  \/\/ accept equal nans if equal in all bits\n  assert(a.type == b.type);\n  if (a.type == f32) {\n    assert(a.reinterpreti32() == b.reinterpreti32());\n  } else if (a.type == f64) {\n    assert(a.reinterpreti64() == b.reinterpreti64());\n  } else {\n    abort();\n  }\n}\n\nstatic void run_asserts(size_t* i, bool* checked, Module* wasm,\n                        Element* root,\n                        std::unique_ptr<SExpressionWasmBuilder>* builder,\n                        Name entry) {\n  std::unique_ptr<ShellExternalInterface> interface;\n  std::unique_ptr<ModuleInstance> instance;\n  if (wasm) {\n    interface = wasm::make_unique<ShellExternalInterface>(); \/\/ prefix make_unique to work around visual studio bugs\n    instance = wasm::make_unique<ModuleInstance>(*wasm, interface.get());\n    if (entry.is()) {\n      Function* function = wasm->getFunction(entry);\n      if (!function) {\n        std::cerr << \"Unknown entry \" << entry << std::endl;\n      } else {\n        LiteralList arguments;\n        for (WasmType param : function->params) {\n          arguments.push_back(Literal(param));\n        }\n        try {\n          instance->callExport(entry, arguments);\n        } catch (ExitException&) {\n        }\n      }\n    }\n  }\n  while (*i < root->size()) {\n    Element& curr = *(*root)[*i];\n    IString id = curr[0]->str();\n    if (id == MODULE) break;\n    *checked = true;\n    Colors::red(std::cerr);\n    std::cerr << *i << '\/' << (root->size() - 1);\n    Colors::green(std::cerr);\n    std::cerr << \" CHECKING: \";\n    Colors::normal(std::cerr);\n    std::cerr << curr;\n    Colors::green(std::cerr);\n    std::cerr << \" [line: \" << curr.line << \"]\\n\";\n    Colors::normal(std::cerr);\n    if (id == ASSERT_INVALID) {\n      \/\/ a module invalidity test\n      Module wasm;\n      bool invalid = false;\n      std::unique_ptr<SExpressionWasmBuilder> builder;\n      try {\n        builder = std::unique_ptr<SExpressionWasmBuilder>(\n          new SExpressionWasmBuilder(wasm, *curr[1])\n        );\n      } catch (const ParseException&) {\n        invalid = true;\n      }\n      if (!invalid) {\n        \/\/ maybe parsed ok, but otherwise incorrect\n        invalid = !WasmValidator().validate(wasm);\n      }\n      if (!invalid) {\n        Colors::red(std::cerr);\n        std::cerr << \"[should have been invalid]\\n\";\n        Colors::normal(std::cerr);\n        std::cerr << &wasm << '\\n';\n        abort();\n      }\n    } else if (id == INVOKE) {\n      assert(wasm);\n      Invocation invocation(curr, instance.get(), *builder->get());\n      invocation.invoke();\n    } else {\n      \/\/ an invoke test\n      assert(wasm);\n      bool trapped = false;\n      WASM_UNUSED(trapped);\n      Literal result;\n      try {\n        Invocation invocation(*curr[1], instance.get(), *builder->get());\n        result = invocation.invoke();\n      } catch (const TrapException&) {\n        trapped = true;\n      }\n      if (id == ASSERT_RETURN) {\n        assert(!trapped);\n        if (curr.size() >= 3) {\n          Literal expected = builder->get()\n                                 ->parseExpression(*curr[2])\n                                 ->dynCast<Const>()\n                                 ->value;\n          std::cerr << \"seen \" << result << \", expected \" << expected << '\\n';\n          verify_result(expected, result);\n        } else {\n          Literal expected;\n          std::cerr << \"seen \" << result << \", expected \" << expected << '\\n';\n          verify_result(expected, result);\n        }\n      }\n      if (id == ASSERT_TRAP) assert(trapped);\n    }\n    *i += 1;\n  }\n}\n\n\/\/\n\/\/ main\n\/\/\n\nint main(int argc, const char* argv[]) {\n  Name entry;\n\n  Options options(\"wasm-shell\", \"Execute .wast files\");\n  options\n      .add(\n          \"--entry\", \"-e\", \"call the entry point after parsing the module\",\n          Options::Arguments::One,\n          [&entry](Options*, const std::string& argument) { entry = argument; })\n      .add_positional(\"INFILE\", Options::Arguments::One,\n                      [](Options* o, const std::string& argument) {\n                        o->extra[\"infile\"] = argument;\n                      });\n  options.parse(argc, argv);\n\n  auto input(read_file<std::vector<char>>(options.extra[\"infile\"], Flags::Text, options.debug ? Flags::Debug : Flags::Release));\n\n  bool checked = false;\n\n  try {\n    if (options.debug) std::cerr << \"parsing text to s-expressions...\\n\";\n    SExpressionParser parser(input.data());\n    Element& root = *parser.root;\n\n    \/\/ A .wast may have multiple modules, with some asserts after them\n    size_t i = 0;\n    while (i < root.size()) {\n      Element& curr = *root[i];\n      IString id = curr[0]->str();\n      if (id == MODULE) {\n        if (options.debug) std::cerr << \"parsing s-expressions to wasm...\\n\";\n        Module wasm;\n        std::unique_ptr<SExpressionWasmBuilder> builder;\n        builder = wasm::make_unique<SExpressionWasmBuilder>(wasm, *root[i]);\n        i++;\n        assert(WasmValidator().validate(wasm));\n        run_asserts(&i, &checked, &wasm, &root, &builder, entry);\n      } else {\n        run_asserts(&i, &checked, nullptr, &root, nullptr, entry);\n      }\n    }\n  } catch (ParseException& p) {\n    p.dump(std::cerr);\n    abort();\n  }\n\n  if (checked) {\n    Colors::green(std::cerr);\n    Colors::bold(std::cerr);\n    std::cerr << \"all checks passed.\\n\";\n    Colors::normal(std::cerr);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkProbeFilter.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\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 \"vtkProbeFilter.h\"\n#include \"vtkObjectFactory.h\"\n\n\n\n\/\/----------------------------------------------------------------------------\nvtkProbeFilter* vtkProbeFilter::New()\n{\n  \/\/ First try to create the object from the vtkObjectFactory\n  vtkObject* ret = vtkObjectFactory::CreateInstance(\"vtkProbeFilter\");\n  if(ret)\n    {\n    return (vtkProbeFilter*)ret;\n    }\n  \/\/ If the factory was unable to create the object, then create it here.\n  return new vtkProbeFilter;\n}\n\n\n\n\n\/\/----------------------------------------------------------------------------\nvtkProbeFilter::vtkProbeFilter()\n{\n  this->SpatialMatch = 0;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkProbeFilter::~vtkProbeFilter()\n{\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::SetSource(vtkDataSet *input)\n{\n  this->vtkProcessObject::SetNthInput(1, input);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkDataSet *vtkProbeFilter::GetSource()\n{\n  if (this->NumberOfInputs < 2)\n    {\n    return NULL;\n    }\n  \n  return (vtkDataSet *)(this->Inputs[1]);\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::Execute()\n{\n  int ptId;\n  float *x, tol2;\n  vtkCell *cell;\n  vtkPointData *pd, *outPD;\n  int numPts, subId;\n  vtkDataSet *source = this->GetSource();\n  vtkDataSet *input = this->GetInput();\n  vtkDataSet *output= this->GetOutput();\n  float pcoords[3], *weights;\n  float fastweights[256];\n\n  vtkDebugMacro(<<\"Probing data\");\n\n  if (source == NULL)\n    {\n    vtkErrorMacro (<< \"Source is NULL.\");\n    return;\n    }\n\n  pd = source->GetPointData();\n  if (pd == NULL)\n    {\n    vtkErrorMacro(<< \"PointData is NULL.\");\n    return;\n    }\n\n  \/\/ lets use a stack allocated array if possible for performance reasons\n  int mcs = source->GetMaxCellSize();\n  if (mcs<=256)\n    {\n    weights = fastweights;\n    }\n  else\n    {\n    weights = new float[mcs];\n    }\n\n  \/\/ First, copy the input to the output as a starting point\n  output->CopyStructure( input );\n\n  numPts = input->GetNumberOfPoints();\n  \/\/\n  \/\/ Allocate storage for output PointData\n  \/\/\n  outPD = output->GetPointData();\n  outPD->InterpolateAllocate(pd);\n  \/\/\n  \/\/ Use tolerance as a function of size of source data\n  \/\/\n  tol2 = source->GetLength();\n  tol2 = tol2*tol2 \/ 1000.0;\n  \/\/\n  \/\/ Loop over all input points, interpolating source data\n  \/\/\n  for (ptId=0; ptId < numPts; ptId++)\n    {\n    \/\/ Get the xyz coordinate of the point in the input dataset\n    x = input->GetPoint(ptId);\n\n    \/\/ Find the cell that contains xyz and get it\n    cell = source->FindAndGetCell(x,NULL,-1,tol2,subId,pcoords,weights);\n    if (cell)\n      {\n      \/\/ Interpolate the point data\n      outPD->InterpolatePoint(pd,ptId,cell->PointIds,weights);\n      }\n    else\n      {\n      outPD->NullPoint(ptId);\n      }\n    }\n  if (mcs>256)\n    {\n    delete [] weights;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::ExecuteInformation()\n{\n  if (this->GetInput() == NULL || this->GetSource() == NULL)\n    {\n    vtkErrorMacro(\"Missing input or source\");\n    return;\n    }\n  this->GetOutput()->SetMaximumNumberOfPieces(\n                        this->GetInput()->GetMaximumNumberOfPieces());\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::ComputeInputUpdateExtents( vtkDataObject *output )\n{\n  vtkDataObject *input = this->GetInput();\n  vtkDataObject *source = this->GetSource();\n  int usePiece = 0;\n  \n  \/\/ What ever happend to CopyUpdateExtent in vtkDataObject?\n  \/\/ Copying both piece and extent could be bad.  Setting the piece\n  \/\/ of a structured data set will affect the extent.\n  if (output->IsA(\"vtkUnstructuredPoints\") || output->IsA(\"vtkPolyData\"))\n    {\n    usePiece = 1;\n    }\n  \n  if ( ! this->SpatialMatch)\n    {\n    source->SetUpdateExtent(0, 1, 0);\n    }\n  else\n    {\n    if (usePiece)\n      {\n      source->SetUpdateExtent(output->GetUpdatePiece(), \n\t\t\t      output->GetUpdateNumberOfPieces(),\n\t\t\t      output->GetUpdateGhostLevel());\n      }\n    else\n      {\n      source->SetUpdateExtent(output->GetUpdateExtent()); \n      }\n    }\n  \n  if (usePiece)\n    {\n    input->SetUpdateExtent(output->GetUpdatePiece(), \n\t\t\t   output->GetUpdateNumberOfPieces(),\n\t\t\t   output->GetUpdateGhostLevel());\n    }\n  else\n    {\n    input->SetUpdateExtent(output->GetUpdateExtent()); \n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkDataSet *source = this->GetSource();\n\n  vtkDataSetToDataSetFilter::PrintSelf(os,indent);\n  os << indent << \"Source: \" << source << \"\\n\";\n  if (this->SpatialMatch)\n    {\n    os << indent << \"SpatialMatchOn\\n\";\n    }\n  else\n    {\n    os << indent << \"SpatialMatchOff\\n\";\n    }\n}\n<commit_msg>Fixed bug: Probe was not executing because it was not setting the whole extent.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkProbeFilter.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\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 \"vtkProbeFilter.h\"\n#include \"vtkObjectFactory.h\"\n\n\n\n\/\/----------------------------------------------------------------------------\nvtkProbeFilter* vtkProbeFilter::New()\n{\n  \/\/ First try to create the object from the vtkObjectFactory\n  vtkObject* ret = vtkObjectFactory::CreateInstance(\"vtkProbeFilter\");\n  if(ret)\n    {\n    return (vtkProbeFilter*)ret;\n    }\n  \/\/ If the factory was unable to create the object, then create it here.\n  return new vtkProbeFilter;\n}\n\n\n\n\n\/\/----------------------------------------------------------------------------\nvtkProbeFilter::vtkProbeFilter()\n{\n  this->SpatialMatch = 0;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkProbeFilter::~vtkProbeFilter()\n{\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::SetSource(vtkDataSet *input)\n{\n  this->vtkProcessObject::SetNthInput(1, input);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkDataSet *vtkProbeFilter::GetSource()\n{\n  if (this->NumberOfInputs < 2)\n    {\n    return NULL;\n    }\n  \n  return (vtkDataSet *)(this->Inputs[1]);\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::Execute()\n{\n  int ptId;\n  float *x, tol2;\n  vtkCell *cell;\n  vtkPointData *pd, *outPD;\n  int numPts, subId;\n  vtkDataSet *source = this->GetSource();\n  vtkDataSet *input = this->GetInput();\n  vtkDataSet *output= this->GetOutput();\n  float pcoords[3], *weights;\n  float fastweights[256];\n\n  vtkDebugMacro(<<\"Probing data\");\n\n  if (source == NULL)\n    {\n    vtkErrorMacro (<< \"Source is NULL.\");\n    return;\n    }\n\n  pd = source->GetPointData();\n  if (pd == NULL)\n    {\n    vtkErrorMacro(<< \"PointData is NULL.\");\n    return;\n    }\n\n  \/\/ lets use a stack allocated array if possible for performance reasons\n  int mcs = source->GetMaxCellSize();\n  if (mcs<=256)\n    {\n    weights = fastweights;\n    }\n  else\n    {\n    weights = new float[mcs];\n    }\n\n  \/\/ First, copy the input to the output as a starting point\n  output->CopyStructure( input );\n\n  numPts = input->GetNumberOfPoints();\n  \/\/\n  \/\/ Allocate storage for output PointData\n  \/\/\n  outPD = output->GetPointData();\n  outPD->InterpolateAllocate(pd);\n  \/\/\n  \/\/ Use tolerance as a function of size of source data\n  \/\/\n  tol2 = source->GetLength();\n  tol2 = tol2*tol2 \/ 1000.0;\n  \/\/\n  \/\/ Loop over all input points, interpolating source data\n  \/\/\n  for (ptId=0; ptId < numPts; ptId++)\n    {\n    \/\/ Get the xyz coordinate of the point in the input dataset\n    x = input->GetPoint(ptId);\n\n    \/\/ Find the cell that contains xyz and get it\n    cell = source->FindAndGetCell(x,NULL,-1,tol2,subId,pcoords,weights);\n    if (cell)\n      {\n      \/\/ Interpolate the point data\n      outPD->InterpolatePoint(pd,ptId,cell->PointIds,weights);\n      }\n    else\n      {\n      outPD->NullPoint(ptId);\n      }\n    }\n  if (mcs>256)\n    {\n    delete [] weights;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::ExecuteInformation()\n{\n  \/\/ Copy whole extent ...\n  this->vtkSource::ExecuteInformation();\n\n  if (this->GetInput() == NULL || this->GetSource() == NULL)\n    {\n    vtkErrorMacro(\"Missing input or source\");\n    return;\n    }\n  this->GetOutput()->SetMaximumNumberOfPieces(\n                        this->GetInput()->GetMaximumNumberOfPieces());\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::ComputeInputUpdateExtents( vtkDataObject *output )\n{\n  vtkDataObject *input = this->GetInput();\n  vtkDataObject *source = this->GetSource();\n  int usePiece = 0;\n  \n  \/\/ What ever happend to CopyUpdateExtent in vtkDataObject?\n  \/\/ Copying both piece and extent could be bad.  Setting the piece\n  \/\/ of a structured data set will affect the extent.\n  if (output->IsA(\"vtkUnstructuredPoints\") || output->IsA(\"vtkPolyData\"))\n    {\n    usePiece = 1;\n    }\n  \n  if ( ! this->SpatialMatch)\n    {\n    source->SetUpdateExtent(0, 1, 0);\n    }\n  else\n    {\n    if (usePiece)\n      {\n      source->SetUpdateExtent(output->GetUpdatePiece(), \n\t\t\t      output->GetUpdateNumberOfPieces(),\n\t\t\t      output->GetUpdateGhostLevel());\n      }\n    else\n      {\n      source->SetUpdateExtent(output->GetUpdateExtent()); \n      }\n    }\n  \n  if (usePiece)\n    {\n    input->SetUpdateExtent(output->GetUpdatePiece(), \n\t\t\t   output->GetUpdateNumberOfPieces(),\n\t\t\t   output->GetUpdateGhostLevel());\n    }\n  else\n    {\n    input->SetUpdateExtent(output->GetUpdateExtent()); \n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkProbeFilter::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkDataSet *source = this->GetSource();\n\n  vtkDataSetToDataSetFilter::PrintSelf(os,indent);\n  os << indent << \"Source: \" << source << \"\\n\";\n  if (this->SpatialMatch)\n    {\n    os << indent << \"SpatialMatchOn\\n\";\n    }\n  else\n    {\n    os << indent << \"SpatialMatchOff\\n\";\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/gui:$Name:  $:$Id: TGButtonGroup.cxx,v 1.6 2001\/04\/11 17:25:41 brun Exp $\n\/\/ Author: Valeriy Onuchin & Fons Rademakers   16\/10\/2000\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\/\/ The TGButtonGroup widget organizes TGButton widgets in a group.      \/\/\n\/\/                                                                      \/\/\n\/\/ A button group widget makes it easier to deal with groups of buttons.\/\/\n\/\/ A button in a button group is associated with a unique identifer.    \/\/\n\/\/ The button group emits a Clicked() signal with this identifier when  \/\/\n\/\/ the button is clicked. Thus, a button group is an ideal solution     \/\/\n\/\/ when you have several similar buttons and want to connect all their  \/\/\n\/\/ Clicked() signals, for example, to one slot.                         \/\/\n\/\/                                                                      \/\/\n\/\/ An exclusive button group switches off all toggle buttons except     \/\/\n\/\/ the one that was clicked. A button group is by default non-exclusive.\/\/\n\/\/ All radio buttons that are inserted, will be mutually exclusive even \/\/\n\/\/ if the button group is non-exclusive.                                \/\/\n\/\/                                                                      \/\/\n\/\/                                                                      \/\/\n\/\/ There are two ways of using a button group:                          \/\/\n\/\/                                                                      \/\/\n\/\/    The button group is a parent widget of a number of buttons,       \/\/\n\/\/    i.e. the button group is the parent argument in the button        \/\/\n\/\/    constructor. The buttons are assigned identifiers 1, 2, 3 etc.    \/\/\n\/\/\/   in the order they are created or you can specify button id in     \/\/\n\/\/    the button constructor. A TGButtonGroup can display a frame and   \/\/\n\/\/    a title because it inherits from TGGroupFrame.                    \/\/\n\/\/                                                                      \/\/\n\/\/ Example:                                                             \/\/\n\/\/                                                                      \/\/\n\/\/    \/\/ vertical frame without border and title                        \/\/\n\/\/    TGVButtonGroup *bg = new TGVButtonGroup(main_frame);              \/\/\n\/\/                                                                      \/\/\n\/\/    \/\/ create text button with id=1                                   \/\/\n\/\/    TGTextButton *button1 = new TGTextButton(bg,\"some text\");         \/\/\n\/\/                                                                      \/\/\n\/\/    \/\/ create another text button with id=2                           \/\/\n\/\/    TGTextButton *button2 = new TGTextButton(bg,\"another text\");      \/\/\n\/\/                                                                      \/\/\n\/\/    \/\/ map all buttons                                                \/\/\n\/\/    bg->Show();                                                       \/\/\n\/\/                                                                      \/\/\n\/\/                                                                      \/\/\n\/\/  ButtonGroup Signals:                                                \/\/\n\/\/                                                                      \/\/\n\/\/    Pressed(Int_t id)  -->  is emitted when a button in the group is  \/\/\n\/\/                            pressed down. The id argument is the      \/\/\n\/\/                            button's identifier.                      \/\/\n\/\/    Released(Int_t id) -->  is emitted when a button in the group is  \/\/\n\/\/                            released. The id argument is the button's \/\/\n\/\/                            identifier.                               \/\/\n\/\/    Clicked(Int_t id)  -->  is emitted when a button in the group is  \/\/\n\/\/                            clicked. The id argument is the button's  \/\/\n\/\/                            identifier.                               \/\/\n\/\/                                                                      \/\/\n\/\/                                                                      \/\/\n\/\/ The TGHButtonGroup widget organizes TGButton widgets in a group      \/\/\n\/\/ with one horizontal row. TGHButtonGroup is a convenience class that  \/\/\n\/\/ offers a thin layer on top of TGButtonGroup. It inherits from        \/\/\n\/\/ TGButtonGroup.                                                       \/\/\n\/\/                                                                      \/\/\n\/\/ The TGVButtonGroup widget organizes TGButton widgets in a group      \/\/\n\/\/ with one vertical column. TGVButtonGroup is a convenience class that \/\/\n\/\/ offers a thin layer on top of TGButtonGroup. It inherits from        \/\/\n\/\/ TGButtonGroup.                                                       \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TGButtonGroup.h\"\n#include \"TGButton.h\"\n#include \"TClass.h\"\n#include \"TGLayout.h\"\n\n\nClassImpQ(TGButtonGroup)\nClassImpQ(TGHButtonGroup)\nClassImpQ(TGVButtonGroup)\n\n\/\/______________________________________________________________________________\nTGButtonGroup::TGButtonGroup(TGWindow *parent,\n                             const TString &title,\n                             UInt_t options,\n                             GContext_t norm,\n                             FontStruct_t font,\n                             ULong_t back) :\n   TGGroupFrame(parent, new TGString(title), options, norm, font, back)\n{\n   \/\/ Constructor. Layout 1 row or 1 column.\n\n   Init();\n   if (options & kVerticalFrame) {\n      SetLayoutManager(new TGVerticalLayout(this));\n   } else {\n      SetLayoutManager(new TGHorizontalLayout(this));\n   }\n\n   fDrawBorder = !title.IsNull();\n}\n\n\/\/______________________________________________________________________________\nTGButtonGroup::TGButtonGroup(TGWindow *parent,\n                             UInt_t r, UInt_t c,\n                             Int_t s, Int_t h,\n                             const TString &title,\n                             GContext_t norm ,\n                             FontStruct_t font ,\n                             ULong_t back) :\n   TGGroupFrame(parent, new TGString(title), 0, norm, font, back)\n{\n   \/\/ Constructor. Layout defined by TGMatrixLayout:\n   \/\/    r = number of rows\n   \/\/    c = number of columns\n   \/\/    s = interval between frames\n   \/\/    h = layout hints\n\n   Init();\n   fDrawBorder = !title.IsNull();\n   SetLayoutManager(new TGMatrixLayout(this,r,c,s,h));\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::Init()\n{\n   \/\/ Default init.\n\n   fMapOfButtons = new TMap();  \/\/ map of button\/id pairs\n   fExclGroup    = kFALSE;\n   fRadioExcl    = kFALSE;\n   fDrawBorder   = kTRUE;\n}\n\n\/\/______________________________________________________________________________\nTGButtonGroup::~TGButtonGroup()\n{\n   \/\/ Destructor, we do not delete the buttons.\n\n   TIter next(fMapOfButtons);\n   register TGButton *item = 0;\n\n   while ((item = (TGButton*)next())) {\n      item->SetGroup(0);\n   }\n\n   SafeDelete(fMapOfButtons);\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetBorderDrawn(Bool_t enable)\n{\n   \/\/ Makes border to be visible\/invisible.\n\n   if (enable != IsBorderDrawn()) {\n      fDrawBorder = enable;\n      ChangedBy(\"SetBorderDrawn\");        \/\/ emit signal\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetExclusive(Bool_t enable)\n{\n   \/\/ Sets the button group to be exclusive if enable is kTRUE,\n   \/\/ or to be non-exclusive if enable is kFALSE.\n   \/\/ An exclusive button group switches off all other toggle buttons when\n   \/\/ one is switched on. This is ideal for groups of radio-buttons\n   \/\/ A non-exclusive group allow many buttons to be switched on at the same\n   \/\/ time. The default setting is kFALSE.\n\n   if (enable != IsExclusive()) {\n      fExclGroup = enable;\n      ChangedBy(\"SetExclusive\");  \/\/ emit signal\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetRadioButtonExclusive(Bool_t enable)\n{\n   \/\/ If enable is kTRUE, this button group will treat radio buttons as\n   \/\/ mutually exclusive, and other buttons according to IsExclusive().\n   \/\/ This function is called automatically whenever a TGRadioButton\n   \/\/ is inserted, so you should normally never have to call it.\n\n   if (enable != IsRadioButtonExclusive()) {\n      fRadioExcl = enable;\n      ChangedBy(\"SetRadioButtonExclusive\"); \/\/ emit signal\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetButton(Int_t id, Bool_t down)\n{\n   \/\/ Sets the button with id to be on\/down, and if this is an\n   \/\/ exclusive group, all other button in the group to be off\/up.\n\n   TGButton *b = Find(id);\n   if (b) b->SetDown(down);\n}\n\n\/\/______________________________________________________________________________\nInt_t TGButtonGroup::Insert(TGButton *button, Int_t id)\n{\n   \/\/ Inserts a button with the identifier id into the button group.\n   \/\/ Returns the button identifier.\n   \/\/\n   \/\/ It is not necessary to manually insert buttons that have this button\n   \/\/ group as their parent widget. An exception is when you want custom\n   \/\/ identifiers instead of the default 1, 2, 3 etc.\n   \/\/\n   \/\/ The button is assigned the identifier id or an automatically\n   \/\/ generated identifier.  It works as follows: If id > 0, this\n   \/\/ identifier is assigned.  If id == -1 (default), the identifier is\n   \/\/ equal to the number of buttons in the group+1.  If id is any other\n   \/\/ negative integer, for instance -2, a unique identifier (negative\n   \/\/ integer <= -2) is generated.\n   \/\/\n   \/\/ Inserting several buttons with id = -1 assigns the identifiers 1,\n   \/\/ 2, 3, etc.\n\n   if (button->fGroup && button->fGroup != this)\n      button->fGroup->Remove(button);\n\n   if (button->fGroup == this) {\n      if (id == -1)\n         return GetId(button);    \/\/ the button is already in group\n      else\n         button->fGroup->Remove(button);  \/\/ want to set a new id\n   }\n\n   button->fGroup = this;\n\n   static int seq_no = -2;\n   int bid;\n\n   if (id < -1)       bid = seq_no--;\n   else if (id == -1) bid = GetCount()+1;\n   else               bid = id;\n\n   fMapOfButtons->Add(button, (TObject*)bid);\n   AddFrame(button);\n\n   SetRadioButtonExclusive(button->IsA()->InheritsFrom(TGRadioButton::Class()));\n\n   Connect(button, \"Pressed()\" , \"TGButtonGroup\", this, \"ReleaseButtons()\");\n   Connect(button, \"Pressed()\" , \"TGButtonGroup\", this, \"ButtonPressed()\");\n   Connect(button, \"Released()\", \"TGButtonGroup\", this, \"ButtonReleased()\");\n   Connect(button, \"Clicked()\" , \"TGButtonGroup\", this, \"ButtonClicked()\");\n\n   return bid;\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::Remove(TGButton *button)\n{\n   \/\/ Removes a button from the button group.\n\n   TGButton *item = (TGButton*) fMapOfButtons->Remove(button);\n   if (item) {\n      button->SetGroup(0);\n      button->Disconnect(this);\n   }\n\n   RemoveFrame(button);\n}\n\n\/\/______________________________________________________________________________\nTGButton *TGButtonGroup::Find(Int_t id) const\n{\n   \/\/ Finds and returns a pointer to the button with the specified\n   \/\/ identifier id. Returns null if the button was not found.\n\n   TIter next(fMapOfButtons);\n   register TGButton *item = 0;\n\n   while ((item = (TGButton*)next())) {\n      if ((Long_t)fMapOfButtons->GetValue(item) == id) break;   \/\/ found\n   }\n\n   return item;\n}\n\n\/\/______________________________________________________________________________\nInt_t TGButtonGroup::GetId(TGButton *button) const\n{\n   \/\/ Finds and returns the id of the button.\n   \/\/ Returns -1 if the button is not a member of this group.\n\n   TAssoc *a = (TAssoc*) fMapOfButtons->FindObject(button);\n   if (a)\n      return (Int_t)Long_t(a->Value());\n   else\n      return -1;\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::ButtonPressed()\n{\n   \/\/ This slot is activated when one of the buttons in the group emits the\n   \/\/ Pressed() signal.\n\n#if 0\n   \/\/ Is here for historical purposes and example. Now this is not needed\n   \/\/ anymore since TGButton has has its own GetSender() method returning\n   \/\/ the TGButton proper.\n\n   \/\/ This is needed since gTQSender points to TQObject part of TGButton\n#ifdef R__RTTI\n   TGButton *btn = dynamic_cast<TGButton*>((TQObject*)gTQSender);\n#else\n   TQObject *oq = (TQObject*)gTQSender;\n   TGButton *btn = (TGButton*)oq->IsA()->DynamicCast(TQObject::Class(), oq, kFALSE);\n#endif\n   if (!btn) {\n      Error(\"ButtonPressed\", \"gTQSender not a TGButton\");\n      return;\n   }\n#else\n      TGButton *btn = (TGButton*)gTQSender;\n#endif\n\n   TAssoc *a = (TAssoc*) fMapOfButtons->FindObject(btn);\n   if (a) {\n      Int_t id = (Int_t)Long_t(a->Value());\n      Pressed(id);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::ButtonReleased()\n{\n   \/\/ This slot is activated when one of the buttons in the group emits the\n   \/\/ Released() signal.\n\n   TGButton *btn = (TGButton*)gTQSender;\n\n   TAssoc *a = (TAssoc*) fMapOfButtons->FindObject(btn);\n   if (a) {\n      Int_t id = (Int_t)Long_t(a->Value());\n      Released(id);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::ButtonClicked()\n{\n   \/\/ This slot is activated when one of the buttons in the group emits the\n   \/\/ Clicked() signal.\n\n   TGButton *btn = (TGButton*)gTQSender;\n\n   TAssoc *a = (TAssoc*) fMapOfButtons->FindObject(btn);\n   if (a) {\n      Int_t id = (Int_t)Long_t(a->Value());\n      Clicked(id);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::ReleaseButtons()\n{\n   \/\/ This slot is activated when one of the buttons in the\n   \/\/ exclusive group emits the Pressed() signal.\n\n   if (!fExclGroup && !fRadioExcl) return;\n\n   TGButton *btn = (TGButton*)gTQSender;\n\n   if (!fExclGroup && !btn->IsA()->InheritsFrom(TGRadioButton::Class()))\n      return;\n\n   TIter next(fMapOfButtons);\n   register TGButton *item = 0;\n\n   while ((item = (TGButton*)next())) {    \/\/ loop over all buttons\n      item->SetDown(btn==item);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::Show()\n{\n   \/\/ Show group of buttons.\n\n   MapSubwindows();\n   Layout();\n   Resize(GetLayoutManager()->GetDefaultSize());\n   MapRaised();\n   fClient->NeedRedraw(this);\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::Hide()\n{\n   \/\/ Hide group of buttons.\n\n   UnmapWindow();\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetTitle(TGString *title)\n{\n   \/\/ Set or change title.\n\n   if (!title) {\n      Error(\"SetTitle\", \"title cannot be 0, try \\\"\\\"\");\n      return;\n   }\n\n   if (strcmp(fText->GetString(), title->GetString())) {\n      SetBorderDrawn(title->GetLength() ? kTRUE : kFALSE);\n      TGGroupFrame::SetTitle(title);\n      ChangedBy(\"SetTitle\");\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetTitle(const char *title)\n{\n   \/\/ Set or change title.\n\n   if (!title) {\n      Error(\"SetTitle\", \"title cannot be 0, try \\\"\\\"\");\n      return;\n   }\n\n   if (strcmp(fText->GetString(), title)) {\n      SetBorderDrawn(title && strlen(title));\n      TGGroupFrame::SetTitle(title);\n      ChangedBy(\"SetTitle\");\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetLayoutHints(TGLayoutHints *l, TGButton *button)\n{\n   \/\/ Set layout hints.\n\n   TGFrameElement *el;\n   TIter next(fList);\n\n   while ((el = (TGFrameElement *)next())) {\n      if ((el->fFrame==(TGFrame*)button) || !button) {\n         el->fLayout = l ? l : fgDefaultHints;\n      }\n   }\n   Layout();\n}\n\n<commit_msg>added extra comment on how buttons are to be added to the button group (no need to call AddFrame() and the use of SetLayoutHints()).<commit_after>\/\/ @(#)root\/gui:$Name:  $:$Id: TGButtonGroup.cxx,v 1.7 2001\/04\/12 08:13:19 rdm Exp $\n\/\/ Author: Valeriy Onuchin & Fons Rademakers   16\/10\/2000\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\/\/ The TGButtonGroup widget organizes TGButton widgets in a group.      \/\/\n\/\/                                                                      \/\/\n\/\/ A button group widget makes it easier to deal with groups of buttons.\/\/\n\/\/ A button in a button group is associated with a unique identifer.    \/\/\n\/\/ The button group emits a Clicked() signal with this identifier when  \/\/\n\/\/ the button is clicked. Thus, a button group is an ideal solution     \/\/\n\/\/ when you have several similar buttons and want to connect all their  \/\/\n\/\/ Clicked() signals, for example, to one slot.                         \/\/\n\/\/                                                                      \/\/\n\/\/ An exclusive button group switches off all toggle buttons except     \/\/\n\/\/ the one that was clicked. A button group is by default non-exclusive.\/\/\n\/\/ All radio buttons that are inserted, will be mutually exclusive even \/\/\n\/\/ if the button group is non-exclusive.                                \/\/\n\/\/                                                                      \/\/\n\/\/                                                                      \/\/\n\/\/ There are two ways of using a button group:                          \/\/\n\/\/                                                                      \/\/\n\/\/    The button group is a parent widget of a number of buttons,       \/\/\n\/\/    i.e. the button group is the parent argument in the button        \/\/\n\/\/    constructor. The buttons are assigned identifiers 1, 2, 3 etc.    \/\/\n\/\/\/   in the order they are created or you can specify button id in     \/\/\n\/\/    the button constructor. A TGButtonGroup can display a frame and   \/\/\n\/\/    a title because it inherits from TGGroupFrame.                    \/\/\n\/\/                                                                      \/\/\n\/\/ Example:                                                             \/\/\n\/\/                                                                      \/\/\n\/\/    \/\/ vertical frame without border and title                        \/\/\n\/\/    TGVButtonGroup *bg = new TGVButtonGroup(main_frame);              \/\/\n\/\/                                                                      \/\/\n\/\/    \/\/ create text button with id=1                                   \/\/\n\/\/    TGTextButton *button1 = new TGTextButton(bg,\"some text\");         \/\/\n\/\/                                                                      \/\/\n\/\/    \/\/ create another text button with id=2                           \/\/\n\/\/    TGTextButton *button2 = new TGTextButton(bg,\"another text\");      \/\/\n\/\/                                                                      \/\/\n\/\/    \/\/ map all buttons                                                \/\/\n\/\/    bg->Show();                                                       \/\/\n\/\/                                                                      \/\/\n\/\/ NOTE: there is no need to call AddFrame() since the buttons are      \/\/\n\/\/ automatically added with a default layout hint to their parent,      \/\/\n\/\/ i.e. the buttongroup. To override the default layout hints use the   \/\/\n\/\/ SetLayoutHints() method.                                             \/\/\n\/\/                                                                      \/\/\n\/\/  ButtonGroup Signals:                                                \/\/\n\/\/                                                                      \/\/\n\/\/    Pressed(Int_t id)  -->  is emitted when a button in the group is  \/\/\n\/\/                            pressed down. The id argument is the      \/\/\n\/\/                            button's identifier.                      \/\/\n\/\/    Released(Int_t id) -->  is emitted when a button in the group is  \/\/\n\/\/                            released. The id argument is the button's \/\/\n\/\/                            identifier.                               \/\/\n\/\/    Clicked(Int_t id)  -->  is emitted when a button in the group is  \/\/\n\/\/                            clicked. The id argument is the button's  \/\/\n\/\/                            identifier.                               \/\/\n\/\/                                                                      \/\/\n\/\/                                                                      \/\/\n\/\/ The TGHButtonGroup widget organizes TGButton widgets in a group      \/\/\n\/\/ with one horizontal row. TGHButtonGroup is a convenience class that  \/\/\n\/\/ offers a thin layer on top of TGButtonGroup. It inherits from        \/\/\n\/\/ TGButtonGroup.                                                       \/\/\n\/\/                                                                      \/\/\n\/\/ The TGVButtonGroup widget organizes TGButton widgets in a group      \/\/\n\/\/ with one vertical column. TGVButtonGroup is a convenience class that \/\/\n\/\/ offers a thin layer on top of TGButtonGroup. It inherits from        \/\/\n\/\/ TGButtonGroup.                                                       \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TGButtonGroup.h\"\n#include \"TGButton.h\"\n#include \"TClass.h\"\n#include \"TGLayout.h\"\n\n\nClassImpQ(TGButtonGroup)\nClassImpQ(TGHButtonGroup)\nClassImpQ(TGVButtonGroup)\n\n\/\/______________________________________________________________________________\nTGButtonGroup::TGButtonGroup(TGWindow *parent,\n                             const TString &title,\n                             UInt_t options,\n                             GContext_t norm,\n                             FontStruct_t font,\n                             ULong_t back) :\n   TGGroupFrame(parent, new TGString(title), options, norm, font, back)\n{\n   \/\/ Constructor. Layout 1 row or 1 column.\n\n   Init();\n   if (options & kVerticalFrame) {\n      SetLayoutManager(new TGVerticalLayout(this));\n   } else {\n      SetLayoutManager(new TGHorizontalLayout(this));\n   }\n\n   fDrawBorder = !title.IsNull();\n}\n\n\/\/______________________________________________________________________________\nTGButtonGroup::TGButtonGroup(TGWindow *parent,\n                             UInt_t r, UInt_t c,\n                             Int_t s, Int_t h,\n                             const TString &title,\n                             GContext_t norm ,\n                             FontStruct_t font ,\n                             ULong_t back) :\n   TGGroupFrame(parent, new TGString(title), 0, norm, font, back)\n{\n   \/\/ Constructor. Layout defined by TGMatrixLayout:\n   \/\/    r = number of rows\n   \/\/    c = number of columns\n   \/\/    s = interval between frames\n   \/\/    h = layout hints\n\n   Init();\n   fDrawBorder = !title.IsNull();\n   SetLayoutManager(new TGMatrixLayout(this,r,c,s,h));\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::Init()\n{\n   \/\/ Default init.\n\n   fMapOfButtons = new TMap();  \/\/ map of button\/id pairs\n   fExclGroup    = kFALSE;\n   fRadioExcl    = kFALSE;\n   fDrawBorder   = kTRUE;\n}\n\n\/\/______________________________________________________________________________\nTGButtonGroup::~TGButtonGroup()\n{\n   \/\/ Destructor, we do not delete the buttons.\n\n   TIter next(fMapOfButtons);\n   register TGButton *item = 0;\n\n   while ((item = (TGButton*)next())) {\n      item->SetGroup(0);\n   }\n\n   SafeDelete(fMapOfButtons);\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetBorderDrawn(Bool_t enable)\n{\n   \/\/ Makes border to be visible\/invisible.\n\n   if (enable != IsBorderDrawn()) {\n      fDrawBorder = enable;\n      ChangedBy(\"SetBorderDrawn\");        \/\/ emit signal\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetExclusive(Bool_t enable)\n{\n   \/\/ Sets the button group to be exclusive if enable is kTRUE,\n   \/\/ or to be non-exclusive if enable is kFALSE.\n   \/\/ An exclusive button group switches off all other toggle buttons when\n   \/\/ one is switched on. This is ideal for groups of radio-buttons\n   \/\/ A non-exclusive group allow many buttons to be switched on at the same\n   \/\/ time. The default setting is kFALSE.\n\n   if (enable != IsExclusive()) {\n      fExclGroup = enable;\n      ChangedBy(\"SetExclusive\");  \/\/ emit signal\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetRadioButtonExclusive(Bool_t enable)\n{\n   \/\/ If enable is kTRUE, this button group will treat radio buttons as\n   \/\/ mutually exclusive, and other buttons according to IsExclusive().\n   \/\/ This function is called automatically whenever a TGRadioButton\n   \/\/ is inserted, so you should normally never have to call it.\n\n   if (enable != IsRadioButtonExclusive()) {\n      fRadioExcl = enable;\n      ChangedBy(\"SetRadioButtonExclusive\"); \/\/ emit signal\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetButton(Int_t id, Bool_t down)\n{\n   \/\/ Sets the button with id to be on\/down, and if this is an\n   \/\/ exclusive group, all other button in the group to be off\/up.\n\n   TGButton *b = Find(id);\n   if (b) b->SetDown(down);\n}\n\n\/\/______________________________________________________________________________\nInt_t TGButtonGroup::Insert(TGButton *button, Int_t id)\n{\n   \/\/ Inserts a button with the identifier id into the button group.\n   \/\/ Returns the button identifier.\n   \/\/\n   \/\/ It is not necessary to manually insert buttons that have this button\n   \/\/ group as their parent widget. An exception is when you want custom\n   \/\/ identifiers instead of the default 1, 2, 3 etc.\n   \/\/\n   \/\/ The button is assigned the identifier id or an automatically\n   \/\/ generated identifier.  It works as follows: If id > 0, this\n   \/\/ identifier is assigned.  If id == -1 (default), the identifier is\n   \/\/ equal to the number of buttons in the group+1.  If id is any other\n   \/\/ negative integer, for instance -2, a unique identifier (negative\n   \/\/ integer <= -2) is generated.\n   \/\/\n   \/\/ Inserting several buttons with id = -1 assigns the identifiers 1,\n   \/\/ 2, 3, etc.\n\n   if (button->fGroup && button->fGroup != this)\n      button->fGroup->Remove(button);\n\n   if (button->fGroup == this) {\n      if (id == -1)\n         return GetId(button);    \/\/ the button is already in group\n      else\n         button->fGroup->Remove(button);  \/\/ want to set a new id\n   }\n\n   button->fGroup = this;\n\n   static int seq_no = -2;\n   int bid;\n\n   if (id < -1)       bid = seq_no--;\n   else if (id == -1) bid = GetCount()+1;\n   else               bid = id;\n\n   fMapOfButtons->Add(button, (TObject*)bid);\n   AddFrame(button);\n\n   SetRadioButtonExclusive(button->IsA()->InheritsFrom(TGRadioButton::Class()));\n\n   Connect(button, \"Pressed()\" , \"TGButtonGroup\", this, \"ReleaseButtons()\");\n   Connect(button, \"Pressed()\" , \"TGButtonGroup\", this, \"ButtonPressed()\");\n   Connect(button, \"Released()\", \"TGButtonGroup\", this, \"ButtonReleased()\");\n   Connect(button, \"Clicked()\" , \"TGButtonGroup\", this, \"ButtonClicked()\");\n\n   return bid;\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::Remove(TGButton *button)\n{\n   \/\/ Removes a button from the button group.\n\n   TGButton *item = (TGButton*) fMapOfButtons->Remove(button);\n   if (item) {\n      button->SetGroup(0);\n      button->Disconnect(this);\n   }\n\n   RemoveFrame(button);\n}\n\n\/\/______________________________________________________________________________\nTGButton *TGButtonGroup::Find(Int_t id) const\n{\n   \/\/ Finds and returns a pointer to the button with the specified\n   \/\/ identifier id. Returns null if the button was not found.\n\n   TIter next(fMapOfButtons);\n   register TGButton *item = 0;\n\n   while ((item = (TGButton*)next())) {\n      if ((Long_t)fMapOfButtons->GetValue(item) == id) break;   \/\/ found\n   }\n\n   return item;\n}\n\n\/\/______________________________________________________________________________\nInt_t TGButtonGroup::GetId(TGButton *button) const\n{\n   \/\/ Finds and returns the id of the button.\n   \/\/ Returns -1 if the button is not a member of this group.\n\n   TAssoc *a = (TAssoc*) fMapOfButtons->FindObject(button);\n   if (a)\n      return (Int_t)Long_t(a->Value());\n   else\n      return -1;\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::ButtonPressed()\n{\n   \/\/ This slot is activated when one of the buttons in the group emits the\n   \/\/ Pressed() signal.\n\n#if 0\n   \/\/ Is here for historical purposes and example. Now this is not needed\n   \/\/ anymore since TGButton has has its own GetSender() method returning\n   \/\/ the TGButton proper.\n\n   \/\/ This is needed since gTQSender points to TQObject part of TGButton\n#ifdef R__RTTI\n   TGButton *btn = dynamic_cast<TGButton*>((TQObject*)gTQSender);\n#else\n   TQObject *oq = (TQObject*)gTQSender;\n   TGButton *btn = (TGButton*)oq->IsA()->DynamicCast(TQObject::Class(), oq, kFALSE);\n#endif\n   if (!btn) {\n      Error(\"ButtonPressed\", \"gTQSender not a TGButton\");\n      return;\n   }\n#else\n      TGButton *btn = (TGButton*)gTQSender;\n#endif\n\n   TAssoc *a = (TAssoc*) fMapOfButtons->FindObject(btn);\n   if (a) {\n      Int_t id = (Int_t)Long_t(a->Value());\n      Pressed(id);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::ButtonReleased()\n{\n   \/\/ This slot is activated when one of the buttons in the group emits the\n   \/\/ Released() signal.\n\n   TGButton *btn = (TGButton*)gTQSender;\n\n   TAssoc *a = (TAssoc*) fMapOfButtons->FindObject(btn);\n   if (a) {\n      Int_t id = (Int_t)Long_t(a->Value());\n      Released(id);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::ButtonClicked()\n{\n   \/\/ This slot is activated when one of the buttons in the group emits the\n   \/\/ Clicked() signal.\n\n   TGButton *btn = (TGButton*)gTQSender;\n\n   TAssoc *a = (TAssoc*) fMapOfButtons->FindObject(btn);\n   if (a) {\n      Int_t id = (Int_t)Long_t(a->Value());\n      Clicked(id);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::ReleaseButtons()\n{\n   \/\/ This slot is activated when one of the buttons in the\n   \/\/ exclusive group emits the Pressed() signal.\n\n   if (!fExclGroup && !fRadioExcl) return;\n\n   TGButton *btn = (TGButton*)gTQSender;\n\n   if (!fExclGroup && !btn->IsA()->InheritsFrom(TGRadioButton::Class()))\n      return;\n\n   TIter next(fMapOfButtons);\n   register TGButton *item = 0;\n\n   while ((item = (TGButton*)next())) {    \/\/ loop over all buttons\n      item->SetDown(btn==item);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::Show()\n{\n   \/\/ Show group of buttons.\n\n   MapSubwindows();\n   Layout();\n   Resize(GetLayoutManager()->GetDefaultSize());\n   MapRaised();\n   fClient->NeedRedraw(this);\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::Hide()\n{\n   \/\/ Hide group of buttons.\n\n   UnmapWindow();\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetTitle(TGString *title)\n{\n   \/\/ Set or change title.\n\n   if (!title) {\n      Error(\"SetTitle\", \"title cannot be 0, try \\\"\\\"\");\n      return;\n   }\n\n   if (strcmp(fText->GetString(), title->GetString())) {\n      SetBorderDrawn(title->GetLength() ? kTRUE : kFALSE);\n      TGGroupFrame::SetTitle(title);\n      ChangedBy(\"SetTitle\");\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetTitle(const char *title)\n{\n   \/\/ Set or change title.\n\n   if (!title) {\n      Error(\"SetTitle\", \"title cannot be 0, try \\\"\\\"\");\n      return;\n   }\n\n   if (strcmp(fText->GetString(), title)) {\n      SetBorderDrawn(title && strlen(title));\n      TGGroupFrame::SetTitle(title);\n      ChangedBy(\"SetTitle\");\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGButtonGroup::SetLayoutHints(TGLayoutHints *l, TGButton *button)\n{\n   \/\/ Set layout hints for the specified button or if button=0 for all\n   \/\/ buttons.\n\n   TGFrameElement *el;\n   TIter next(fList);\n\n   while ((el = (TGFrameElement *)next())) {\n      if ((el->fFrame==(TGFrame*)button) || !button) {\n         el->fLayout = l ? l : fgDefaultHints;\n      }\n   }\n   Layout();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>Bool_t raytracing = kTRUE;\n\n\/\/______________________________________________________________________________\nvoid csgdemo ()\n{\n   gSystem->Load(\"libGeom\");\n   bar = new TControlBar(\"vertical\", \"TGeo composite shapes\",20,20);\n   bar->AddButton(\"How to run  \",\"help()\",\"Instructions \"); \n   bar->AddButton(\"Union \", \"s_union()\", \"A + B \");\n   bar->AddButton(\"Intersection \", \"s_intersection()\",\"A * B \");\n   bar->AddButton(\"Difference \", \"s_difference()\",\"A - B \");\n\t\/\/These two buttons are disabled cause of bugs\n\t\/\/bar->AddButton(\"Complex1 \", \"complex_1()\",\"(A * B) - C\");\n\t\/\/bar->AddButton(\"RAY-TRACE ON\/OFF\",\"raytrace()\",\"Toggle ray-tracing mode\");\n   bar->Show();\n\n   gROOT->SaveContext();\n}\n\n\/\/______________________________________________________________________________\nvoid MakePicture()\n{\n\tgGeoManager->GetGeomPainter()->SetRaytracing(kFALSE);\n\tgPad->Modified();\n\tgPad->Update();\n}\n\n\nvoid s_union()\n{\n   gROOT->GetListOfCanvases()->Delete();\n   TCanvas *c = new TCanvas(\"composite shape\", \"Union boolean operation\", 700, 1000);\n\n   c->Divide(1,2,0,0);\n   c->cd(2);\n   gPad->SetPad(0,0,1,0.4);\n   c->cd(1);\n   gPad->SetPad(0,0.4,1,1);\n   \n   if (gGeoManager) delete gGeoManager;\n   \n   new TGeoManager(\"xtru\", \"poza12\");\n   TGeoMaterial *mat = new TGeoMaterial(\"Al\", 26.98,13,2.7);\n   TGeoMedium *med = new TGeoMedium(\"MED\",1,mat);\n   TGeoVolume *top = gGeoManager->MakeBox(\"TOP\",med,100,100,100);\n   gGeoManager->SetTopVolume(top);\n\n   \/\/ define shape components with names\n   TGeoPgon *pgon = new TGeoPgon(\"pg\",0.,360.,6,2); \n   pgon->DefineSection(0,0,0,20);\n   pgon->DefineSection(1, 30,0,20);\n\n   TGeoSphere *sph = new TGeoSphere(\"sph\", 40., 45., 5., 175., 0., 340.);\n   \/\/ define named geometrical transformations with names\n   TGeoTranslation *tr = new TGeoTranslation(0., 0., 45.);\n   tr->SetName(\"tr\");\n   \/\/ register all used transformations\n   tr->RegisterYourself();\n   \/\/ create the composite shape based on a Boolean expression\n   TGeoCompositeShape *cs = new TGeoCompositeShape(\"mir\", \"sph:tr + pg\");\n\n   TGeoVolume *vol = new TGeoVolume(\"COMP1\",cs);\n   top->AddNode(vol,1);\n   gGeoManager->CloseGeometry();\n   gGeoManager->SetNsegments(100);\n   top->Draw();\n   MakePicture();\n\n   c->cd(2);\n   TPaveText *pt = new TPaveText(0.01,0.01,0.99,0.99);\n   pt->SetLineColor(1);\n   TText *text = pt->AddText(\"TGeoCompositeShape - composite shape class\");\n   text->SetTextColor(2);\n   pt->AddText(\"----- It's an example of boolean union operation : A + B\");\n   pt->AddText(\"----- A == part of sphere (5-175, 0-340), B == pgon\");\n   pt->AddText(\" \");\n   pt->SetAllWith(\"-----\",\"color\",4);\n   pt->SetAllWith(\"-----\",\"font\",72);\n   pt->SetAllWith(\"-----\",\"size\",0.04);\n   pt->SetTextAlign(12);\n   pt->SetTextSize(.044);\n   pt->Draw();\n   c->cd(1);\n}\n\nvoid s_intersection()\n{\n   gROOT->GetListOfCanvases()->Delete();\n   TCanvas *c = new TCanvas(\"composite shape\", \"Intersection boolean operation\", 700, 1000);\n\n   c->Divide(1,2,0,0);\n   c->cd(2);\n   gPad->SetPad(0,0,1,0.4);\n   c->cd(1);\n   gPad->SetPad(0,0.4,1,1);\n   \n   if (gGeoManager) delete gGeoManager;\n   \n   new TGeoManager(\"xtru\", \"poza12\");\n   TGeoMaterial *mat = new TGeoMaterial(\"Al\", 26.98,13,2.7);\n   TGeoMedium *med = new TGeoMedium(\"MED\",1,mat);\n   TGeoVolume *top = gGeoManager->MakeBox(\"TOP\",med,100,100,100);\n   gGeoManager->SetTopVolume(top);\n\n   \/\/ define shape components with names\n   TGeoBBox *box = new TGeoBBox(\"bx\", 40., 40., 40.); \n   TGeoSphere *sph = new TGeoSphere(\"sph\", 40., 45.);\n   \/\/ define named geometrical transformations with names\n   TGeoTranslation *tr = new TGeoTranslation(0., 0., 45.);\n   tr->SetName(\"tr\");\n   \/\/ register all used transformations\n   tr->RegisterYourself();\n   \/\/ create the composite shape based on a Boolean expression\n   TGeoCompositeShape *cs = new TGeoCompositeShape(\"mir\", \"sph:tr * bx\");\n\n   TGeoVolume *vol = new TGeoVolume(\"COMP2\",cs);\n   top->AddNode(vol,1);\n   gGeoManager->CloseGeometry();\n   gGeoManager->SetNsegments(100);\n   top->Draw();\n   MakePicture();\n\n   c->cd(2);\n\n   TPaveText *pt = new TPaveText(0.01,0.01,0.99,0.99);\n\n   pt->SetLineColor(1);\n\n   TText *text = pt->AddText(\"TGeoCompositeShape - composite shape class\");\n\n   text->SetTextColor(2);\n   pt->AddText(\"----- Here is an example of boolean intersection operation : A * B\");\n   pt->AddText(\"----- A == sphere (with inner radius non-zero), B == box\");\n   pt->AddText(\" \");\n   pt->SetAllWith(\"-----\",\"color\",4);\n   pt->SetAllWith(\"-----\",\"font\",72);\n   pt->SetAllWith(\"-----\",\"size\",0.04);\n   pt->SetTextAlign(12);\n   pt->SetTextSize(0.044);\n   pt->Draw();\n   c->cd(1);\n}\n\nvoid s_difference()\n{\n   gROOT->GetListOfCanvases()->Delete();\n   TCanvas *c = new TCanvas(\"composite shape\", \"Difference boolean operation\", 700, 1000);\n\n   c->Divide(1,2,0,0);\n   c->cd(2);\n   gPad->SetPad(0,0,1,0.4);\n   c->cd(1);\n   gPad->SetPad(0,0.4,1,1);\n   \n   if (gGeoManager) delete gGeoManager;\n   \n   new TGeoManager(\"xtru\", \"poza12\");\n   TGeoMaterial *mat = new TGeoMaterial(\"Al\", 26.98,13,2.7);\n   TGeoMedium *med = new TGeoMedium(\"MED\",1,mat);\n   TGeoVolume *top = gGeoManager->MakeBox(\"TOP\",med,100,100,100);\n   gGeoManager->SetTopVolume(top);\n\n   \/\/ define shape components with names\n   TGeoTorus *tor = new TGeoTorus(\"tor\", 45., 15., 20., 45., 145.); \n   TGeoSphere *sph = new TGeoSphere(\"sph\", 20., 45., 0., 180., 0., 270.);\n   \/\/ create the composite shape based on a Boolean expression\n   TGeoCompositeShape *cs = new TGeoCompositeShape(\"mir\", \"sph - tor\");\n\n   TGeoVolume *vol = new TGeoVolume(\"COMP3\",cs);\n   top->AddNode(vol,1);\n   gGeoManager->CloseGeometry();\n   gGeoManager->SetNsegments(60);\n   top->Draw();\n   MakePicture();\n\n   c->cd(2);\n\n   TPaveText *pt = new TPaveText(.01, .01, .99, .99);\n\n   pt->SetLineColor(1);\n\n   TText *text = pt->AddText(\"TGeoCompositeShape - composite shape class\");\n\n   text->SetTextColor(2);\n\n   pt->AddText(\"----- It's an example of boolean difference: A - B\");\n   pt->AddText(\"----- A == part of sphere (0-180, 0-270), B == partial torus (45-145)\");\n   pt->AddText(\" \");\n   pt->SetAllWith(\"-----\",\"color\",4);\n   pt->SetAllWith(\"-----\",\"font\",72);\n   pt->SetAllWith(\"-----\",\"size\",0.04);\n   pt->SetTextAlign(12);\n   pt->SetTextSize(0.044);\n   pt->Draw();\n   c->cd(1);\n}\n\nvoid complex_1()\n{\n   gROOT->GetListOfCanvases()->Delete();\n   TCanvas *c = new TCanvas(\"composite shape\", \"A * B - C\", 700, 1000);\n\n   c->Divide(1,2,0,0);\n   c->cd(2);\n   gPad->SetPad(0,0,1,0.4);\n   c->cd(1);\n   gPad->SetPad(0,0.4,1,1);\n   \n   if (gGeoManager) delete gGeoManager;\n   \n   new TGeoManager(\"xtru\", \"poza12\");\n   TGeoMaterial *mat = new TGeoMaterial(\"Al\", 26.98,13,2.7);\n   TGeoMedium *med = new TGeoMedium(\"MED\",1,mat);\n   TGeoVolume *top = gGeoManager->MakeBox(\"TOP\",med,100,100,100);\n   gGeoManager->SetTopVolume(top);\n\n   \/\/ define shape components with names\n   TGeoBBox *box = new TGeoBBox(\"box\", 20., 20., 20.); \n   TGeoBBox *box1 = new TGeoBBox(\"box1\", 5., 5., 5.); \n   TGeoSphere *sph = new TGeoSphere(\"sph\", 5., 25.);\n   TGeoSphere *sph1 = new TGeoSphere(\"sph1\", 1., 15.);\n   \/\/ create the composite shape based on a Boolean expression\n   TGeoTranslation *tr = new TGeoTranslation(0., 30., 0.);\n   TGeoTranslation *tr1 = new TGeoTranslation(0., 40., 0.);\n   TGeoTranslation *tr2 = new TGeoTranslation(0., 30., 0.);\n   TGeoTranslation *tr3 = new TGeoTranslation(0., 30., 0.);\n   tr->SetName(\"tr\");\n   tr1->SetName(\"tr1\");\n   tr2->SetName(\"tr2\");\n   tr3->SetName(\"tr3\");\n   \/\/ register all used transformations\n   tr->RegisterYourself();\n   tr1->RegisterYourself();\n   tr2->RegisterYourself();\n   tr3->RegisterYourself();\n\n   TGeoCompositeShape *cs = new TGeoCompositeShape(\"mir\", \"(sph * box) + (sph1:tr - box1:tr1)\");\n\n   TGeoVolume *vol = new TGeoVolume(\"COMP4\",cs);\n\/\/   vol->SetLineColor(randomColor());\n   top->AddNode(vol,1);\n   gGeoManager->CloseGeometry();\n   gGeoManager->SetNsegments(80);\n   top->Draw();\n   MakePicture();\n\n   c->cd(2);\n   TPaveText *pt = new TPaveText(0.01,0.01,0.99,0.99);\n   pt->SetLineColor(1);\n   TText *text = pt->AddText(\"TGeoCompositeShape - composite shape class\");\n   text->SetTextColor(2);\n   pt->AddText(\"----- Sphere * box - torus\");\n\n   pt->AddText(\" \");\n   pt->SetAllWith(\"-----\",\"color\",4);\n   pt->SetAllWith(\"-----\",\"font\",72);\n   pt->SetAllWith(\"-----\",\"size\",0.04);\n   pt->SetTextAlign(12);\n   pt->SetTextSize(0.044);\n   pt->Draw();\n   c->cd(1);\n\n}\n\n\/\/______________________________________________________________________________\nvoid AddText(TPaveText *pave, const char *datamember, Double_t value, const char *comment)\n{\n   char line[128];\n   for (Int_t i=0; i<128; i++) line[i] = ' ';\n   memcpy(&line[0], datamember, strlen(datamember));\n   line[10] = '=';\n   char number[20];\n   sprintf(number, \"%5.2f\", value);\n   memcpy(&line[12], number, strlen(number));\n   line[26] = '=';\n   line[27] = '>';\n   sprintf(&line[30], \"%s\",comment);\n   TText *text = pave->AddText(line);\n   text->SetTextAlign(12);\n}\n\n\/\/______________________________________________________________________________\nvoid AddText(TPaveText *pave, const char *datamember, Int_t value, const char *comment)\n{\n   char line[128];\n   for (Int_t i=0; i<128; i++) line[i] = ' ';\n   memcpy(&line[0], datamember, strlen(datamember));\n   line[10] = '=';\n   char number[20];\n   sprintf(number, \"%5i\", value);\n   memcpy(&line[12], number, strlen(number));\n   line[26] = '=';\n   line[27] = '>';\n   sprintf(&line[30], \"%s\",comment);\n   TText *text = pave->AddText(line);\n   text->SetTextAlign(12);\n}\n\n\/\/______________________________________________________________________________\nvoid AddText(TPaveText *pave, TObject *pf, Int_t iaxis)\n{\n   char line[128];\n   TGeoPatternFinder *finder = (TGeoPatternFinder*)pf;\n   if (!pave || !pf) return;\n   for (Int_t i=0; i<128; i++) line[i] = ' ';\n   TGeoVolume *volume = finder->GetVolume();\n   TGeoShape *sh = volume->GetShape();\n   sprintf(line, \"Division of %s on axis %d (%s)\", volume->GetName(), iaxis,sh->GetAxisName(iaxis));\n   TText *text = pave->AddText(line);\n   text->SetTextColor(3);\n   text->SetTextAlign(12);\n   AddText(pave, \"fNdiv\",finder->GetNdiv(),\"number of divisions\");\n   AddText(pave, \"fStart\",finder->GetStart(),\"start divisioning position\");\n   AddText(pave, \"fStep\",finder->GetStep(),\"division step\");\n}\n\n\/\/______________________________________________________________________________\nvoid raytrace() {\n   if (!gGeoManager) return;\n\n   TVirtualGeoPainter *painter = gGeoManager->GetGeomPainter();\n\n   if (!painter) return;\n\n   painter->SetRaytracing(raytracing);\n\n   if (!gPad) return;\n\n   gPad->Modified();\n   gPad->Update();\n}\n\n\/\/______________________________________________________________________________\nvoid help() {\n   \/\/\n  \n   new TCanvas(\"chelp\",\"Help to run demos\",200,10,700,600);\n\n   welcome = new TPaveText(.1,.8,.9,.97);\n   welcome->AddText(\"Welcome to the new geometry package\");\n   welcome->SetTextFont(32);\n   welcome->SetTextColor(4);\n   welcome->SetFillColor(24);\n   welcome->Draw();\n\n   hdemo = new TPaveText(.05,.05,.95,.7);\n   hdemo->SetTextAlign(12);\n   hdemo->SetTextFont(52);\n   hdemo->AddText(\"- Demo for building TGeo compoite shapes\");\n   hdemo->AddText(\" \");\n   hdemo->SetAllWith(\"....\",\"color\",2);\n   hdemo->SetAllWith(\"....\",\"font\",72);\n   hdemo->SetAllWith(\"....\",\"size\",0.03);\n\n   hdemo->Draw();\n}\n\n<commit_msg>From Olivier: -fix a typo<commit_after>Bool_t raytracing = kTRUE;\n\n\/\/______________________________________________________________________________\nvoid csgdemo ()\n{\n   gSystem->Load(\"libGeom\");\n   bar = new TControlBar(\"vertical\", \"TGeo composite shapes\",20,20);\n   bar->AddButton(\"How to run  \",\"help()\",\"Instructions \"); \n   bar->AddButton(\"Union \", \"s_union()\", \"A + B \");\n   bar->AddButton(\"Intersection \", \"s_intersection()\",\"A * B \");\n   bar->AddButton(\"Difference \", \"s_difference()\",\"A - B \");\n\t\/\/These two buttons are disabled cause of bugs\n\t\/\/bar->AddButton(\"Complex1 \", \"complex_1()\",\"(A * B) - C\");\n\t\/\/bar->AddButton(\"RAY-TRACE ON\/OFF\",\"raytrace()\",\"Toggle ray-tracing mode\");\n   bar->Show();\n\n   gROOT->SaveContext();\n}\n\n\/\/______________________________________________________________________________\nvoid MakePicture()\n{\n\tgGeoManager->GetGeomPainter()->SetRaytracing(kFALSE);\n\tgPad->Modified();\n\tgPad->Update();\n}\n\n\nvoid s_union()\n{\n   gROOT->GetListOfCanvases()->Delete();\n   TCanvas *c = new TCanvas(\"composite shape\", \"Union boolean operation\", 700, 1000);\n\n   c->Divide(1,2,0,0);\n   c->cd(2);\n   gPad->SetPad(0,0,1,0.4);\n   c->cd(1);\n   gPad->SetPad(0,0.4,1,1);\n   \n   if (gGeoManager) delete gGeoManager;\n   \n   new TGeoManager(\"xtru\", \"poza12\");\n   TGeoMaterial *mat = new TGeoMaterial(\"Al\", 26.98,13,2.7);\n   TGeoMedium *med = new TGeoMedium(\"MED\",1,mat);\n   TGeoVolume *top = gGeoManager->MakeBox(\"TOP\",med,100,100,100);\n   gGeoManager->SetTopVolume(top);\n\n   \/\/ define shape components with names\n   TGeoPgon *pgon = new TGeoPgon(\"pg\",0.,360.,6,2); \n   pgon->DefineSection(0,0,0,20);\n   pgon->DefineSection(1, 30,0,20);\n\n   TGeoSphere *sph = new TGeoSphere(\"sph\", 40., 45., 5., 175., 0., 340.);\n   \/\/ define named geometrical transformations with names\n   TGeoTranslation *tr = new TGeoTranslation(0., 0., 45.);\n   tr->SetName(\"tr\");\n   \/\/ register all used transformations\n   tr->RegisterYourself();\n   \/\/ create the composite shape based on a Boolean expression\n   TGeoCompositeShape *cs = new TGeoCompositeShape(\"mir\", \"sph:tr + pg\");\n\n   TGeoVolume *vol = new TGeoVolume(\"COMP1\",cs);\n   top->AddNode(vol,1);\n   gGeoManager->CloseGeometry();\n   gGeoManager->SetNsegments(100);\n   top->Draw();\n   MakePicture();\n\n   c->cd(2);\n   TPaveText *pt = new TPaveText(0.01,0.01,0.99,0.99);\n   pt->SetLineColor(1);\n   TText *text = pt->AddText(\"TGeoCompositeShape - composite shape class\");\n   text->SetTextColor(2);\n   pt->AddText(\"----- It's an example of boolean union operation : A + B\");\n   pt->AddText(\"----- A == part of sphere (5-175, 0-340), B == pgon\");\n   pt->AddText(\" \");\n   pt->SetAllWith(\"-----\",\"color\",4);\n   pt->SetAllWith(\"-----\",\"font\",72);\n   pt->SetAllWith(\"-----\",\"size\",0.04);\n   pt->SetTextAlign(12);\n   pt->SetTextSize(.044);\n   pt->Draw();\n   c->cd(1);\n}\n\nvoid s_intersection()\n{\n   gROOT->GetListOfCanvases()->Delete();\n   TCanvas *c = new TCanvas(\"composite shape\", \"Intersection boolean operation\", 700, 1000);\n\n   c->Divide(1,2,0,0);\n   c->cd(2);\n   gPad->SetPad(0,0,1,0.4);\n   c->cd(1);\n   gPad->SetPad(0,0.4,1,1);\n   \n   if (gGeoManager) delete gGeoManager;\n   \n   new TGeoManager(\"xtru\", \"poza12\");\n   TGeoMaterial *mat = new TGeoMaterial(\"Al\", 26.98,13,2.7);\n   TGeoMedium *med = new TGeoMedium(\"MED\",1,mat);\n   TGeoVolume *top = gGeoManager->MakeBox(\"TOP\",med,100,100,100);\n   gGeoManager->SetTopVolume(top);\n\n   \/\/ define shape components with names\n   TGeoBBox *box = new TGeoBBox(\"bx\", 40., 40., 40.); \n   TGeoSphere *sph = new TGeoSphere(\"sph\", 40., 45.);\n   \/\/ define named geometrical transformations with names\n   TGeoTranslation *tr = new TGeoTranslation(0., 0., 45.);\n   tr->SetName(\"tr\");\n   \/\/ register all used transformations\n   tr->RegisterYourself();\n   \/\/ create the composite shape based on a Boolean expression\n   TGeoCompositeShape *cs = new TGeoCompositeShape(\"mir\", \"sph:tr * bx\");\n\n   TGeoVolume *vol = new TGeoVolume(\"COMP2\",cs);\n   top->AddNode(vol,1);\n   gGeoManager->CloseGeometry();\n   gGeoManager->SetNsegments(100);\n   top->Draw();\n   MakePicture();\n\n   c->cd(2);\n\n   TPaveText *pt = new TPaveText(0.01,0.01,0.99,0.99);\n\n   pt->SetLineColor(1);\n\n   TText *text = pt->AddText(\"TGeoCompositeShape - composite shape class\");\n\n   text->SetTextColor(2);\n   pt->AddText(\"----- Here is an example of boolean intersection operation : A * B\");\n   pt->AddText(\"----- A == sphere (with inner radius non-zero), B == box\");\n   pt->AddText(\" \");\n   pt->SetAllWith(\"-----\",\"color\",4);\n   pt->SetAllWith(\"-----\",\"font\",72);\n   pt->SetAllWith(\"-----\",\"size\",0.04);\n   pt->SetTextAlign(12);\n   pt->SetTextSize(0.044);\n   pt->Draw();\n   c->cd(1);\n}\n\nvoid s_difference()\n{\n   gROOT->GetListOfCanvases()->Delete();\n   TCanvas *c = new TCanvas(\"composite shape\", \"Difference boolean operation\", 700, 1000);\n\n   c->Divide(1,2,0,0);\n   c->cd(2);\n   gPad->SetPad(0,0,1,0.4);\n   c->cd(1);\n   gPad->SetPad(0,0.4,1,1);\n   \n   if (gGeoManager) delete gGeoManager;\n   \n   new TGeoManager(\"xtru\", \"poza12\");\n   TGeoMaterial *mat = new TGeoMaterial(\"Al\", 26.98,13,2.7);\n   TGeoMedium *med = new TGeoMedium(\"MED\",1,mat);\n   TGeoVolume *top = gGeoManager->MakeBox(\"TOP\",med,100,100,100);\n   gGeoManager->SetTopVolume(top);\n\n   \/\/ define shape components with names\n   TGeoTorus *tor = new TGeoTorus(\"tor\", 45., 15., 20., 45., 145.); \n   TGeoSphere *sph = new TGeoSphere(\"sph\", 20., 45., 0., 180., 0., 270.);\n   \/\/ create the composite shape based on a Boolean expression\n   TGeoCompositeShape *cs = new TGeoCompositeShape(\"mir\", \"sph - tor\");\n\n   TGeoVolume *vol = new TGeoVolume(\"COMP3\",cs);\n   top->AddNode(vol,1);\n   gGeoManager->CloseGeometry();\n   gGeoManager->SetNsegments(60);\n   top->Draw();\n   MakePicture();\n\n   c->cd(2);\n\n   TPaveText *pt = new TPaveText(.01, .01, .99, .99);\n\n   pt->SetLineColor(1);\n\n   TText *text = pt->AddText(\"TGeoCompositeShape - composite shape class\");\n\n   text->SetTextColor(2);\n\n   pt->AddText(\"----- It's an example of boolean difference: A - B\");\n   pt->AddText(\"----- A == part of sphere (0-180, 0-270), B == partial torus (45-145)\");\n   pt->AddText(\" \");\n   pt->SetAllWith(\"-----\",\"color\",4);\n   pt->SetAllWith(\"-----\",\"font\",72);\n   pt->SetAllWith(\"-----\",\"size\",0.04);\n   pt->SetTextAlign(12);\n   pt->SetTextSize(0.044);\n   pt->Draw();\n   c->cd(1);\n}\n\nvoid complex_1()\n{\n   gROOT->GetListOfCanvases()->Delete();\n   TCanvas *c = new TCanvas(\"composite shape\", \"A * B - C\", 700, 1000);\n\n   c->Divide(1,2,0,0);\n   c->cd(2);\n   gPad->SetPad(0,0,1,0.4);\n   c->cd(1);\n   gPad->SetPad(0,0.4,1,1);\n   \n   if (gGeoManager) delete gGeoManager;\n   \n   new TGeoManager(\"xtru\", \"poza12\");\n   TGeoMaterial *mat = new TGeoMaterial(\"Al\", 26.98,13,2.7);\n   TGeoMedium *med = new TGeoMedium(\"MED\",1,mat);\n   TGeoVolume *top = gGeoManager->MakeBox(\"TOP\",med,100,100,100);\n   gGeoManager->SetTopVolume(top);\n\n   \/\/ define shape components with names\n   TGeoBBox *box = new TGeoBBox(\"box\", 20., 20., 20.); \n   TGeoBBox *box1 = new TGeoBBox(\"box1\", 5., 5., 5.); \n   TGeoSphere *sph = new TGeoSphere(\"sph\", 5., 25.);\n   TGeoSphere *sph1 = new TGeoSphere(\"sph1\", 1., 15.);\n   \/\/ create the composite shape based on a Boolean expression\n   TGeoTranslation *tr = new TGeoTranslation(0., 30., 0.);\n   TGeoTranslation *tr1 = new TGeoTranslation(0., 40., 0.);\n   TGeoTranslation *tr2 = new TGeoTranslation(0., 30., 0.);\n   TGeoTranslation *tr3 = new TGeoTranslation(0., 30., 0.);\n   tr->SetName(\"tr\");\n   tr1->SetName(\"tr1\");\n   tr2->SetName(\"tr2\");\n   tr3->SetName(\"tr3\");\n   \/\/ register all used transformations\n   tr->RegisterYourself();\n   tr1->RegisterYourself();\n   tr2->RegisterYourself();\n   tr3->RegisterYourself();\n\n   TGeoCompositeShape *cs = new TGeoCompositeShape(\"mir\", \"(sph * box) + (sph1:tr - box1:tr1)\");\n\n   TGeoVolume *vol = new TGeoVolume(\"COMP4\",cs);\n\/\/   vol->SetLineColor(randomColor());\n   top->AddNode(vol,1);\n   gGeoManager->CloseGeometry();\n   gGeoManager->SetNsegments(80);\n   top->Draw();\n   MakePicture();\n\n   c->cd(2);\n   TPaveText *pt = new TPaveText(0.01,0.01,0.99,0.99);\n   pt->SetLineColor(1);\n   TText *text = pt->AddText(\"TGeoCompositeShape - composite shape class\");\n   text->SetTextColor(2);\n   pt->AddText(\"----- Sphere * box - torus\");\n\n   pt->AddText(\" \");\n   pt->SetAllWith(\"-----\",\"color\",4);\n   pt->SetAllWith(\"-----\",\"font\",72);\n   pt->SetAllWith(\"-----\",\"size\",0.04);\n   pt->SetTextAlign(12);\n   pt->SetTextSize(0.044);\n   pt->Draw();\n   c->cd(1);\n\n}\n\n\/\/______________________________________________________________________________\nvoid AddText(TPaveText *pave, const char *datamember, Double_t value, const char *comment)\n{\n   char line[128];\n   for (Int_t i=0; i<128; i++) line[i] = ' ';\n   memcpy(&line[0], datamember, strlen(datamember));\n   line[10] = '=';\n   char number[20];\n   sprintf(number, \"%5.2f\", value);\n   memcpy(&line[12], number, strlen(number));\n   line[26] = '=';\n   line[27] = '>';\n   sprintf(&line[30], \"%s\",comment);\n   TText *text = pave->AddText(line);\n   text->SetTextAlign(12);\n}\n\n\/\/______________________________________________________________________________\nvoid AddText(TPaveText *pave, const char *datamember, Int_t value, const char *comment)\n{\n   char line[128];\n   for (Int_t i=0; i<128; i++) line[i] = ' ';\n   memcpy(&line[0], datamember, strlen(datamember));\n   line[10] = '=';\n   char number[20];\n   sprintf(number, \"%5i\", value);\n   memcpy(&line[12], number, strlen(number));\n   line[26] = '=';\n   line[27] = '>';\n   sprintf(&line[30], \"%s\",comment);\n   TText *text = pave->AddText(line);\n   text->SetTextAlign(12);\n}\n\n\/\/______________________________________________________________________________\nvoid AddText(TPaveText *pave, TObject *pf, Int_t iaxis)\n{\n   char line[128];\n   TGeoPatternFinder *finder = (TGeoPatternFinder*)pf;\n   if (!pave || !pf) return;\n   for (Int_t i=0; i<128; i++) line[i] = ' ';\n   TGeoVolume *volume = finder->GetVolume();\n   TGeoShape *sh = volume->GetShape();\n   sprintf(line, \"Division of %s on axis %d (%s)\", volume->GetName(), iaxis,sh->GetAxisName(iaxis));\n   TText *text = pave->AddText(line);\n   text->SetTextColor(3);\n   text->SetTextAlign(12);\n   AddText(pave, \"fNdiv\",finder->GetNdiv(),\"number of divisions\");\n   AddText(pave, \"fStart\",finder->GetStart(),\"start divisioning position\");\n   AddText(pave, \"fStep\",finder->GetStep(),\"division step\");\n}\n\n\/\/______________________________________________________________________________\nvoid raytrace() {\n   if (!gGeoManager) return;\n\n   TVirtualGeoPainter *painter = gGeoManager->GetGeomPainter();\n\n   if (!painter) return;\n\n   painter->SetRaytracing(raytracing);\n\n   if (!gPad) return;\n\n   gPad->Modified();\n   gPad->Update();\n}\n\n\/\/______________________________________________________________________________\nvoid help() {\n   \/\/\n  \n   new TCanvas(\"chelp\",\"Help to run demos\",200,10,700,600);\n\n   welcome = new TPaveText(.1,.8,.9,.97);\n   welcome->AddText(\"Welcome to the new geometry package\");\n   welcome->SetTextFont(32);\n   welcome->SetTextColor(4);\n   welcome->SetFillColor(24);\n   welcome->Draw();\n\n   hdemo = new TPaveText(.05,.05,.95,.7);\n   hdemo->SetTextAlign(12);\n   hdemo->SetTextFont(52);\n   hdemo->AddText(\"- Demo for building TGeo composite shapes\");\n   hdemo->AddText(\" \");\n   hdemo->SetAllWith(\"....\",\"color\",2);\n   hdemo->SetAllWith(\"....\",\"font\",72);\n   hdemo->SetAllWith(\"....\",\"size\",0.03);\n\n   hdemo->Draw();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <cctype>\n#include <chrono>\n#include <list>\n#include <string.h>\n\n#include \"core\/Halite.hpp\"\n\nbool quiet_output = false, ignore_timeout = false; \/\/Need to be passed to the game.\nHalite * my_game; \/\/Is a pointer to avoid problems with assignment, dynamic memory, and default constructors.\n\nint main(int argc, char* args[]) {\n\tsrand(time(NULL)); \/\/For all non-seeded randomness.\n\n\tbool watch_game = false, override_names = false; \/\/Extra parameters. \n\t\n\t\/\/Paramters to start up a game.\n\tbool passed_dimensions = false, passed_seed = false, passed_bot_names = false;\n\tunsigned short mapWidth, mapHeight;\n\tunsigned int seed = (std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now().time_since_epoch()).count() % 4294967295); \/\/Using milliseconds to prevent same maps from coming up due to multiple worker servers.\n\tNetworking networking;\n\tstd::vector<std::string> * names = NULL;\n\n\tstd::list<std::string> sArgs;\n\tfor(int a = 1; a < argc; a++) sArgs.push_back(args[a]);\n\n\tfor(auto a = sArgs.begin(); a != sArgs.end();) {\n\t\tif(*a == \"-d\") {\n\t\t\tpassed_dimensions = true;\n\t\t\ta = sArgs.erase(a);\n\t\t\ttry {\n\t\t\t\tmapWidth = std::stoll(*a);\n\t\t\t\ta = sArgs.erase(a);\n\t\t\t\tmapHeight = std::stoll(*a);\n\t\t\t\ta = sArgs.erase(a);\n\t\t\t}\n\t\t\tcatch(...) {\n\t\t\t\tstd::cout << \"The dimension parameters were either not present or invalid.\" << std::endl;\n\t\t\t\treturn EXIT_FAILURE;\n\t\t\t}\n\t\t}\n\t\tif(*a == \"-w\") {\n\t\t\twatch_game = true;\n\t\t\ta = sArgs.erase(a);\n\t\t}\n\t\telse if(*a == \"-q\") {\n\t\t\tquiet_output = true;\n\t\t\ta = sArgs.erase(a);\n\t\t}\n\t\telse if(*a == \"-o\") {\n\t\t\toverride_names = true;\n\t\t\ta = sArgs.erase(a);\n\t\t}\n\t\telse if(*a == \"-s\") {\n\t\t\tpassed_seed = true;\n\t\t\ta = sArgs.erase(a);\n\t\t\ttry {\n\t\t\t\tseed = std::stoll(*a);\n\t\t\t\ta = sArgs.erase(a);\n\t\t\t}\n\t\t\tcatch(...) {\n\t\t\t\tstd::cout << \"The seed parameter was either not present or invalid.\" << std::endl;\n\t\t\t\treturn EXIT_FAILURE;\n\t\t\t}\n\t\t}\n\t\telse if(*a == \"-t\") {\n\t\t\tignore_timeout = true;\n\t\t\ta = sArgs.erase(a);\n\t\t}\n\t\telse a++;\n\t}\n\n\tif(!passed_dimensions) {\n\t\tstd::string in;\n\t\tstd::cout << \"Please enter the width of the map: \";\n\t\tstd::getline(std::cin, in);\n\t\twhile(true) {\n\t\t\ttry{\n\t\t\t\tmapWidth = std::stoi(in);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcatch(std::exception e) {\n\t\t\t\tstd::cout << \"That isn't a valid input. Please enter a positive integer width of the map: \";\n\t\t\t\tstd::getline(std::cin, in);\n\t\t\t}\n\t\t}\n\t\tstd::cout << \"Please enter the height of the map: \";\n\t\tstd::getline(std::cin, in);\n\t\twhile(true) {\n\t\t\ttry{\n\t\t\t\tmapHeight = std::stoi(in);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcatch(std::exception e) {\n\t\t\t\tstd::cout << \"That isn't a valid input. Please enter a positive integer height of the map: \";\n\t\t\t\tstd::getline(std::cin, in);\n\t\t\t}\n\t\t}\n\t}\n\n\tif(override_names) {\n\t\tif(sArgs.size() < 4 || sArgs.size() % 2 == 0) {\n\t\t\tstd::cout << \"Invalid player parameters (inferred from #) - couldn't start game.\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\ttry {\n\t\t\tnames = new std::vector<std::string>();\n\t\t\twhile(!sArgs.empty()) {\n\t\t\t\tnetworking.startAndConnectBot(sArgs.front());\n\t\t\t\tsArgs.pop_front();\n\t\t\t\tnames->push_back(sArgs.front());\n\t\t\t\tsArgs.pop_front();\n\t\t\t}\n\t\t}\n\t\tcatch(...) {\n\t\t\tstd::cout << \"Invalid player parameters - couldn't start game.\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t}\n\telse {\n\t\tif(sArgs.size() < 2) {\n\t\t\tstd::cout << \"Invalid player parameters (inferred from #) - couldn't start game.\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\ttry {\n\t\t\twhile(!sArgs.empty()) {\n\t\t\t\tstd::cout << sArgs.front() << std::endl;\n\t\t\t\tnetworking.startAndConnectBot(sArgs.front());\n\t\t\t\tsArgs.pop_front();\n\t\t\t}\n\t\t}\n\t\tcatch(...) {\n\t\t\tstd::cout << \"Invalid  playerparameters - couldn't start game.\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t}\n\n\t\/\/Create game. Null parameters will be ignored.\n\tmy_game = new Halite(mapWidth, mapHeight, seed, networking, names);\n\n\tstd::string filename = \"Replays\/\" + std::to_string(std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::high_resolution_clock().now().time_since_epoch()).count()) + \".hlt\";\n\n\tGameStatistics stats = my_game->runGame();\n\n\ttry{\n\t\tmy_game->output(filename);\n\t}\n\tcatch(std::runtime_error & e) {\n\t\tfilename = filename.substr(8);\n\t\tif(!quiet_output) {\n\t\t\tstd::cout << \"Map seed is \" << seed << std::endl << \"Opening a file at \" << filename << std::endl;\n\t\t}\n\t\tmy_game->output(filename);\n\t}\n\n\tstd::string victoryOut;\n\tif(quiet_output) {\n\t\tstd::cout << filename << ' ' << seed << std::endl << stats;\n\t}\n\telse {\n\t\tfor(unsigned int a = 0; a < stats.player_statistics.size(); a++) std::cout << \"Player #\" << stats.player_statistics[a].tag << \", \" << my_game->getName(stats.player_statistics[a].tag) << \", came in rank #\" << stats.player_statistics[a].rank << \"!\\n\";\n\t}\n\n\tdelete my_game;\n\n\tif(watch_game) {\n#ifdef _WIN32\n\t\tstd::string command = \".\\\\visualizer \" + filename;\n#else\n\t\tstd::string command = \".\/visualizer \" + filename;\n#endif\n\t\tsystem(command.c_str());\n\t}\n\n\treturn 0;\n}\n<commit_msg>Fixed override param<commit_after>#include <iostream>\n#include <cctype>\n#include <chrono>\n#include <list>\n#include <string.h>\n\n#include \"core\/Halite.hpp\"\n\nbool quiet_output = false, ignore_timeout = false; \/\/Need to be passed to the game.\nHalite * my_game; \/\/Is a pointer to avoid problems with assignment, dynamic memory, and default constructors.\n\nint main(int argc, char* args[]) {\n\tsrand(time(NULL)); \/\/For all non-seeded randomness.\n\n\tbool watch_game = false, override_names = false; \/\/Extra parameters. \n\t\n\t\/\/Paramters to start up a game.\n\tbool passed_dimensions = false, passed_seed = false, passed_bot_names = false;\n\tunsigned short mapWidth, mapHeight;\n\tunsigned int seed = (std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now().time_since_epoch()).count() % 4294967295); \/\/Using milliseconds to prevent same maps from coming up due to multiple worker servers.\n\tNetworking networking;\n\tstd::vector<std::string> * names = NULL;\n\n\tstd::list<std::string> sArgs;\n\tfor(int a = 1; a < argc; a++) sArgs.push_back(args[a]);\n\n\tfor(auto a = sArgs.begin(); a != sArgs.end();) {\n\t\tif(*a == \"-d\") {\n\t\t\tpassed_dimensions = true;\n\t\t\ta = sArgs.erase(a);\n\t\t\ttry {\n\t\t\t\tmapWidth = std::stoll(*a);\n\t\t\t\ta = sArgs.erase(a);\n\t\t\t\tmapHeight = std::stoll(*a);\n\t\t\t\ta = sArgs.erase(a);\n\t\t\t}\n\t\t\tcatch(...) {\n\t\t\t\tstd::cout << \"The dimension parameters were either not present or invalid.\" << std::endl;\n\t\t\t\treturn EXIT_FAILURE;\n\t\t\t}\n\t\t}\n\t\tif(*a == \"-w\") {\n\t\t\twatch_game = true;\n\t\t\ta = sArgs.erase(a);\n\t\t}\n\t\telse if(*a == \"-q\") {\n\t\t\tquiet_output = true;\n\t\t\ta = sArgs.erase(a);\n\t\t}\n\t\telse if(*a == \"-o\") {\n\t\t\toverride_names = true;\n\t\t\ta = sArgs.erase(a);\n\t\t}\n\t\telse if(*a == \"-s\") {\n\t\t\tpassed_seed = true;\n\t\t\ta = sArgs.erase(a);\n\t\t\ttry {\n\t\t\t\tseed = std::stoll(*a);\n\t\t\t\ta = sArgs.erase(a);\n\t\t\t}\n\t\t\tcatch(...) {\n\t\t\t\tstd::cout << \"The seed parameter was either not present or invalid.\" << std::endl;\n\t\t\t\treturn EXIT_FAILURE;\n\t\t\t}\n\t\t}\n\t\telse if(*a == \"-t\") {\n\t\t\tignore_timeout = true;\n\t\t\ta = sArgs.erase(a);\n\t\t}\n\t\telse a++;\n\t}\n\n\tif(!passed_dimensions) {\n\t\tstd::string in;\n\t\tstd::cout << \"Please enter the width of the map: \";\n\t\tstd::getline(std::cin, in);\n\t\twhile(true) {\n\t\t\ttry{\n\t\t\t\tmapWidth = std::stoi(in);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcatch(std::exception e) {\n\t\t\t\tstd::cout << \"That isn't a valid input. Please enter a positive integer width of the map: \";\n\t\t\t\tstd::getline(std::cin, in);\n\t\t\t}\n\t\t}\n\t\tstd::cout << \"Please enter the height of the map: \";\n\t\tstd::getline(std::cin, in);\n\t\twhile(true) {\n\t\t\ttry{\n\t\t\t\tmapHeight = std::stoi(in);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcatch(std::exception e) {\n\t\t\t\tstd::cout << \"That isn't a valid input. Please enter a positive integer height of the map: \";\n\t\t\t\tstd::getline(std::cin, in);\n\t\t\t}\n\t\t}\n\t}\n\n\tif(override_names) {\n\t\tif(sArgs.size() < 4 || sArgs.size() % 2 != 0) {\n\t\t\tstd::cout << \"Invalid player parameters (inferred from #) - couldn't start game.\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\ttry {\n\t\t\tnames = new std::vector<std::string>();\n\t\t\twhile(!sArgs.empty()) {\n\t\t\t\tnetworking.startAndConnectBot(sArgs.front());\n\t\t\t\tsArgs.pop_front();\n\t\t\t\tnames->push_back(sArgs.front());\n\t\t\t\tsArgs.pop_front();\n\t\t\t}\n\t\t}\n\t\tcatch(...) {\n\t\t\tstd::cout << \"Invalid player parameters - couldn't start game.\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t}\n\telse {\n\t\tif(sArgs.size() < 2) {\n\t\t\tstd::cout << \"Invalid player parameters (inferred from #) - couldn't start game.\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\ttry {\n\t\t\twhile(!sArgs.empty()) {\n\t\t\t\tstd::cout << sArgs.front() << std::endl;\n\t\t\t\tnetworking.startAndConnectBot(sArgs.front());\n\t\t\t\tsArgs.pop_front();\n\t\t\t}\n\t\t}\n\t\tcatch(...) {\n\t\t\tstd::cout << \"Invalid  playerparameters - couldn't start game.\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t}\n\n\t\/\/Create game. Null parameters will be ignored.\n\tmy_game = new Halite(mapWidth, mapHeight, seed, networking, names);\n\n\tstd::string filename = \"Replays\/\" + std::to_string(std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::high_resolution_clock().now().time_since_epoch()).count()) + \".hlt\";\n\n\tGameStatistics stats = my_game->runGame();\n\n\ttry{\n\t\tmy_game->output(filename);\n\t}\n\tcatch(std::runtime_error & e) {\n\t\tfilename = filename.substr(8);\n\t\tif(!quiet_output) {\n\t\t\tstd::cout << \"Map seed is \" << seed << std::endl << \"Opening a file at \" << filename << std::endl;\n\t\t}\n\t\tmy_game->output(filename);\n\t}\n\n\tstd::string victoryOut;\n\tif(quiet_output) {\n\t\tstd::cout << filename << ' ' << seed << std::endl << stats;\n\t}\n\telse {\n\t\tfor(unsigned int a = 0; a < stats.player_statistics.size(); a++) std::cout << \"Player #\" << stats.player_statistics[a].tag << \", \" << my_game->getName(stats.player_statistics[a].tag) << \", came in rank #\" << stats.player_statistics[a].rank << \"!\\n\";\n\t}\n\n\tdelete my_game;\n\n\tif(watch_game) {\n#ifdef _WIN32\n\t\tstd::string command = \".\\\\visualizer \" + filename;\n#else\n\t\tstd::string command = \".\/visualizer \" + filename;\n#endif\n\t\tsystem(command.c_str());\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2009 Nokia Corporation.\n *\n * Contact: Marius Vollmer <marius.vollmer@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n *\n *\/\n\n#include \"assoctree.h\"\n#include <QDebug>\n\n\/\/\/ Dumps a QVariant into a multi-line string for debugging purposes.\nQString AssocTree::dump(int level) const\n{\n    QString s;\n    for (int i = 0; i < level; i++)\n        s += \"  \";\n\n    if (type() == QVariant::String)\n        s += toString() + \"\\n\";\n    else if (type() == QVariant::List) {\n        s += \"[\\n\";\n\n        foreach(QVariant v, toList())\n            s += AssocTree(v).dump(level + 1);\n\n        for (int i = 0; i < level; i++)\n            s += \"  \";\n\n        s += \"]\\n\";\n    }\n\n    return s;\n}\n\n\/\/\/ Returns the name of this association tree.\nQString AssocTree::name() const\n{\n    if (type() == QVariant::String)\n        return toString();\n\n    if (type() != QVariant::List\n        || toList().size() < 1)\n        return QString();\n\n    return toList().at(0).toString();\n}\n\n\/\/\/ Returns the sub-tree with the given name\nAssocTree AssocTree::node(const QString &name) const\n{\n    const QVariant nameVariant(name); \/\/ So we can directly compare...\n\n    if (type() != QVariant::List)\n        return AssocTree();\n\n    foreach(const QVariant &child, toList())\n    {\n        if (child.type() == QVariant::List\n            && child.toList().count() >= 1\n            && child.toList().at(0) == nameVariant)\n            return AssocTree(child);\n    }\n\n    return AssocTree();\n}\n\n\/\/\/ Returns the sub-tree named \\a name2 of the sub-tree named \\a name1 \nAssocTree AssocTree::node(const QString &name1,\n                          const QString &name2) const\n{\n    return node(name1).node(name2);\n}\n\nAssocTree AssocTree::node(const QString &name1,\n                          const QString &name2,\n                          const QString &name3) const\n{\n    return node(name1).node(name2).node(name3);\n}\n\nAssocTree AssocTree::node(const QString &name1,\n                          const QString &name2,\n                          const QString &name3,\n                          const QString &name4) const\n{\n    return node(name1).node(name2).node(name3),node(name4);\n}\n\nAssocTree AssocTree::node(const QString &name1,\n                          const QString &name2,\n                          const QString &name3,\n                          const QString &name4,\n                          const QString &name5) const\n{\n    return node(name1).node(name2).node(name3),node(name4).node(name5);\n}\n\n\/\/\/ Returns the value of this tree.\nQVariant AssocTree::value() const\n{\n    if (type() != QVariant::List)\n        return QVariant();\n\n    if (toList().size() < 2)\n        return QVariant();\n\n    return toList().at(1);\n}\n\n\/\/\/ Returns the value of the sub-tree named name1.\nQVariant AssocTree::value(const QString &name1) const\n{\n    return node(name1).value();\n}\n\nQVariant AssocTree::value(const QString &name1,\n                          const QString &name2) const\n{\n    return node(name1, name2).value();\n}\n\nQVariant AssocTree::value(const QString &name1,\n                          const QString &name2,\n                          const QString &name3) const\n{\n    return node(name1, name2, name3).value();\n}\n\nQVariant AssocTree::value(const QString &name1,\n                          const QString &name2,\n                          const QString &name3,\n                          const QString &name4) const\n{\n    return node(name1, name2, name3, name4).value();\n}\n\nQVariant AssocTree::value(const QString &name1,\n                          const QString &name2,\n                          const QString &name3,\n                          const QString &name4,\n                          const QString &name5) const\n{\n    return node(name1, name2, name3, name4, name5).value();\n}\n\n\/\/\/ Returns a list of all sub-trees.\nconst QVariantList AssocTree::nodes() const\n{\n    if (type() == QVariant::List)\n        return toList().mid(1);\n    else\n        return QVariantList();\n}\n<commit_msg>desktop types: Fixing unintentional commas in assoc tree.<commit_after>\/*\n * Copyright (C) 2009 Nokia Corporation.\n *\n * Contact: Marius Vollmer <marius.vollmer@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n *\n *\/\n\n#include \"assoctree.h\"\n#include <QDebug>\n\n\/\/\/ Dumps a QVariant into a multi-line string for debugging purposes.\nQString AssocTree::dump(int level) const\n{\n    QString s;\n    for (int i = 0; i < level; i++)\n        s += \"  \";\n\n    if (type() == QVariant::String)\n        s += toString() + \"\\n\";\n    else if (type() == QVariant::List) {\n        s += \"[\\n\";\n\n        foreach(QVariant v, toList())\n            s += AssocTree(v).dump(level + 1);\n\n        for (int i = 0; i < level; i++)\n            s += \"  \";\n\n        s += \"]\\n\";\n    }\n\n    return s;\n}\n\n\/\/\/ Returns the name of this association tree.\nQString AssocTree::name() const\n{\n    if (type() == QVariant::String)\n        return toString();\n\n    if (type() != QVariant::List\n        || toList().size() < 1)\n        return QString();\n\n    return toList().at(0).toString();\n}\n\n\/\/\/ Returns the sub-tree with the given name\nAssocTree AssocTree::node(const QString &name) const\n{\n    const QVariant nameVariant(name); \/\/ So we can directly compare...\n\n    if (type() != QVariant::List)\n        return AssocTree();\n\n    foreach(const QVariant &child, toList())\n    {\n        if (child.type() == QVariant::List\n            && child.toList().count() >= 1\n            && child.toList().at(0) == nameVariant)\n            return AssocTree(child);\n    }\n\n    return AssocTree();\n}\n\n\/\/\/ Returns the sub-tree named \\a name2 of the sub-tree named \\a name1 \nAssocTree AssocTree::node(const QString &name1,\n                          const QString &name2) const\n{\n    return node(name1).node(name2);\n}\n\nAssocTree AssocTree::node(const QString &name1,\n                          const QString &name2,\n                          const QString &name3) const\n{\n    return node(name1).node(name2).node(name3);\n}\n\nAssocTree AssocTree::node(const QString &name1,\n                          const QString &name2,\n                          const QString &name3,\n                          const QString &name4) const\n{\n    return node(name1).node(name2).node(name3).node(name4);\n}\n\nAssocTree AssocTree::node(const QString &name1,\n                          const QString &name2,\n                          const QString &name3,\n                          const QString &name4,\n                          const QString &name5) const\n{\n    return node(name1).node(name2).node(name3).node(name4).node(name5);\n}\n\n\/\/\/ Returns the value of this tree.\nQVariant AssocTree::value() const\n{\n    if (type() != QVariant::List)\n        return QVariant();\n\n    if (toList().size() < 2)\n        return QVariant();\n\n    return toList().at(1);\n}\n\n\/\/\/ Returns the value of the sub-tree named name1.\nQVariant AssocTree::value(const QString &name1) const\n{\n    return node(name1).value();\n}\n\nQVariant AssocTree::value(const QString &name1,\n                          const QString &name2) const\n{\n    return node(name1, name2).value();\n}\n\nQVariant AssocTree::value(const QString &name1,\n                          const QString &name2,\n                          const QString &name3) const\n{\n    return node(name1, name2, name3).value();\n}\n\nQVariant AssocTree::value(const QString &name1,\n                          const QString &name2,\n                          const QString &name3,\n                          const QString &name4) const\n{\n    return node(name1, name2, name3, name4).value();\n}\n\nQVariant AssocTree::value(const QString &name1,\n                          const QString &name2,\n                          const QString &name3,\n                          const QString &name4,\n                          const QString &name5) const\n{\n    return node(name1, name2, name3, name4, name5).value();\n}\n\n\/\/\/ Returns a list of all sub-trees.\nconst QVariantList AssocTree::nodes() const\n{\n    if (type() == QVariant::List)\n        return toList().mid(1);\n    else\n        return QVariantList();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015-2018 Cryptonomex, Inc., and contributors.\n *\n * The MIT License\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 <graphene\/chain\/database.hpp>\n#include <graphene\/chain\/proposal_evaluator.hpp>\n#include <graphene\/chain\/proposal_object.hpp>\n#include <graphene\/chain\/hardfork.hpp>\n\nnamespace graphene { namespace chain {\n\n\nstruct proposal_operation_hardfork_visitor\n{\n   typedef void result_type;\n   const fc::time_point_sec &block_time;\n\n   proposal_operation_hardfork_visitor(const fc::time_point_sec t) : block_time(t) {}\n\n   template<typename T>\n   void operator()(const T &v) const {}\n\n   \/\/ hf_620\n   void operator()(const graphene::chain::asset_create_operation &v) const {\n      if (block_time < HARDFORK_CORE_620_TIME) {\n         static const std::locale &loc = std::locale::classic();\n         FC_ASSERT(isalpha(v.symbol.back(), loc), \"Asset ${s} must end with alpha character before hardfork 620\", (\"s\", v.symbol));\n      }\n   }\n   \/\/ hf_199\n   void operator()(const graphene::chain::asset_update_issuer_operation &v) const {\n      if (block_time < HARDFORK_CORE_199_TIME) {\n         FC_ASSERT(false, \"Not allowed until hardfork 199\");\n      }\n   }\n   \/\/ hf_188\n   void operator()(const graphene::chain::asset_claim_pool_operation &v) const {\n      if (block_time < HARDFORK_CORE_188_TIME) {\n         FC_ASSERT(false, \"Not allowed until hardfork 188\");\n      }\n   }\n   \/\/ hf_588\n   \/\/ issue #588\n   \/\/\n   \/\/ As a virtual operation which has no evaluator `asset_settle_cancel_operation`\n   \/\/ originally won't be packed into blocks, yet its loose `validate()` method\n   \/\/ make it able to slip into blocks.\n   \/\/\n   \/\/ We need to forbid this operation being packed into blocks via proposal but\n   \/\/ this will lead to a hardfork (this operation in proposal will denied by new\n   \/\/ node while accept by old node), so a hardfork guard code needed and a\n   \/\/ consensus upgrade over all nodes needed in future. And because the\n   \/\/ `validate()` method not suitable to check database status, so we put the\n   \/\/ code here.\n   \/\/\n   \/\/ After the hardfork, all nodes will deny packing this operation into a block,\n   \/\/ and then we will check whether exists a proposal containing this kind of\n   \/\/ operation, if not exists, we can harden the `validate()` method to deny\n   \/\/ it in a earlier stage.\n   \/\/\n   void operator()(const graphene::chain::asset_settle_cancel_operation &v) const {\n      if (block_time > HARDFORK_CORE_588_TIME) {\n         FC_ASSERT(!\"Virtual operation\");\n      }\n   }\n   \/\/ loop and self visit in proposals\n   void operator()(const graphene::chain::proposal_create_operation &v) const {\n      for (const op_wrapper &op : v.proposed_ops)\n         op.op.visit(*this);\n   }\n};\n\nvoid_result proposal_create_evaluator::do_evaluate(const proposal_create_operation& o)\n{ try {\n   const database& d = db();\n   const auto& global_parameters = d.get_global_properties().parameters;\n\n   FC_ASSERT( o.expiration_time > d.head_block_time(), \"Proposal has already expired on creation.\" );\n   FC_ASSERT( o.expiration_time <= d.head_block_time() + global_parameters.maximum_proposal_lifetime,\n              \"Proposal expiration time is too far in the future.\");\n   FC_ASSERT( !o.review_period_seconds || fc::seconds(*o.review_period_seconds) < (o.expiration_time - d.head_block_time()),\n              \"Proposal review period must be less than its overall lifetime.\" );\n\n   {\n      \/\/ If we're dealing with the committee authority, make sure this transaction has a sufficient review period.\n      flat_set<account_id_type> auths;\n      vector<authority> other;\n      for( auto& op : o.proposed_ops )\n      {\n         operation_get_required_authorities(op.op, auths, auths, other);\n      }\n\n      FC_ASSERT( other.size() == 0 ); \/\/ TODO: what about other??? \n\n      if( auths.find(GRAPHENE_COMMITTEE_ACCOUNT) != auths.end() )\n      {\n         GRAPHENE_ASSERT(\n            o.review_period_seconds.valid(),\n            proposal_create_review_period_required,\n            \"Review period not given, but at least ${min} required\",\n            (\"min\", global_parameters.committee_proposal_review_period)\n         );\n         GRAPHENE_ASSERT(\n            *o.review_period_seconds >= global_parameters.committee_proposal_review_period,\n            proposal_create_review_period_insufficient,\n            \"Review period of ${t} specified, but at least ${min} required\",\n            (\"t\", *o.review_period_seconds)\n            (\"min\", global_parameters.committee_proposal_review_period)\n         );\n      }\n   }\n\n   for( const op_wrapper& op : o.proposed_ops )\n      _proposed_trx.operations.push_back(op.op);\n\n   _proposed_trx.validate();\n\n   \/\/ Calling the proposal hardfork visitor\n   const fc::time_point_sec& block_time = d.head_block_time();\n   proposal_operation_hardfork_visitor vtor(block_time);\n   vtor( o );\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nobject_id_type proposal_create_evaluator::do_apply(const proposal_create_operation& o)\n{ try {\n   database& d = db();\n\n   const proposal_object& proposal = d.create<proposal_object>([&](proposal_object& proposal) {\n      _proposed_trx.expiration = o.expiration_time;\n      proposal.proposed_transaction = _proposed_trx;\n      proposal.expiration_time = o.expiration_time;\n      proposal.proposer = o.fee_paying_account;\n      if( o.review_period_seconds )\n         proposal.review_period_time = o.expiration_time - *o.review_period_seconds;\n\n      \/\/Populate the required approval sets\n      flat_set<account_id_type> required_active;\n      vector<authority> other;\n      \n      \/\/ TODO: consider caching values from evaluate?\n      for( auto& op : _proposed_trx.operations )\n         operation_get_required_authorities(op, required_active, proposal.required_owner_approvals, other);\n\n      \/\/All accounts which must provide both owner and active authority should be omitted from the active authority set;\n      \/\/owner authority approval implies active authority approval.\n      std::set_difference(required_active.begin(), required_active.end(),\n                          proposal.required_owner_approvals.begin(), proposal.required_owner_approvals.end(),\n                          std::inserter(proposal.required_active_approvals, proposal.required_active_approvals.begin()));\n   });\n\n   return proposal.id;\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nvoid_result proposal_update_evaluator::do_evaluate(const proposal_update_operation& o)\n{ try {\n   database& d = db();\n\n   _proposal = &o.proposal(d);\n\n   if( _proposal->review_period_time && d.head_block_time() >= *_proposal->review_period_time )\n      FC_ASSERT( o.active_approvals_to_add.empty() && o.owner_approvals_to_add.empty(),\n                 \"This proposal is in its review period. No new approvals may be added.\" );\n\n   for( account_id_type id : o.active_approvals_to_remove )\n   {\n      FC_ASSERT( _proposal->available_active_approvals.find(id) != _proposal->available_active_approvals.end(),\n                 \"\", (\"id\", id)(\"available\", _proposal->available_active_approvals) );\n   }\n   for( account_id_type id : o.owner_approvals_to_remove )\n   {\n      FC_ASSERT( _proposal->available_owner_approvals.find(id) != _proposal->available_owner_approvals.end(),\n                 \"\", (\"id\", id)(\"available\", _proposal->available_owner_approvals) );\n   }\n\n   \/*  All authority checks happen outside of evaluators\n   if( (d.get_node_properties().skip_flags & database::skip_authority_check) == 0 )\n   {\n      for( const auto& id : o.key_approvals_to_add )\n      {\n         FC_ASSERT( trx_state->signed_by(id) );\n      }\n      for( const auto& id : o.key_approvals_to_remove )\n      {\n         FC_ASSERT( trx_state->signed_by(id) );\n      }\n   }\n   *\/\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nvoid_result proposal_update_evaluator::do_apply(const proposal_update_operation& o)\n{ try {\n   database& d = db();\n\n   \/\/ Potential optimization: if _executed_proposal is true, we can skip the modify step and make push_proposal skip\n   \/\/ signature checks. This isn't done now because I just wrote all the proposals code, and I'm not yet 100% sure the\n   \/\/ required approvals are sufficient to authorize the transaction.\n   d.modify(*_proposal, [&o, &d](proposal_object& p) {\n      p.available_active_approvals.insert(o.active_approvals_to_add.begin(), o.active_approvals_to_add.end());\n      p.available_owner_approvals.insert(o.owner_approvals_to_add.begin(), o.owner_approvals_to_add.end());\n      for( account_id_type id : o.active_approvals_to_remove )\n         p.available_active_approvals.erase(id);\n      for( account_id_type id : o.owner_approvals_to_remove )\n         p.available_owner_approvals.erase(id);\n      for( const auto& id : o.key_approvals_to_add )\n         p.available_key_approvals.insert(id);\n      for( const auto& id : o.key_approvals_to_remove )\n         p.available_key_approvals.erase(id);\n   });\n\n   \/\/ If the proposal has a review period, don't bother attempting to authorize\/execute it.\n   \/\/ Proposals with a review period may never be executed except at their expiration.\n   if( _proposal->review_period_time )\n      return void_result();\n\n   if( _proposal->is_authorized_to_execute(d) )\n   {\n      \/\/ All required approvals are satisfied. Execute!\n      _executed_proposal = true;\n      try {\n         _processed_transaction = d.push_proposal(*_proposal);\n      } catch(fc::exception& e) {\n         wlog(\"Proposed transaction ${id} failed to apply once approved with exception:\\n----\\n${reason}\\n----\\nWill try again when it expires.\",\n              (\"id\", o.proposal)(\"reason\", e.to_detail_string()));\n         _proposal_failed = true;\n      }\n   }\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nvoid_result proposal_delete_evaluator::do_evaluate(const proposal_delete_operation& o)\n{ try {\n   database& d = db();\n\n   _proposal = &o.proposal(d);\n\n   auto required_approvals = o.using_owner_authority? &_proposal->required_owner_approvals\n                                                    : &_proposal->required_active_approvals;\n   FC_ASSERT( required_approvals->find(o.fee_paying_account) != required_approvals->end(),\n              \"Provided authority is not authoritative for this proposal.\",\n              (\"provided\", o.fee_paying_account)(\"required\", *required_approvals));\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nvoid_result proposal_delete_evaluator::do_apply(const proposal_delete_operation& o)\n{ try {\n   db().remove(*_proposal);\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\n\n} } \/\/ graphene::chain\n<commit_msg>move hf visitor to first check of evaluator<commit_after>\/*\n * Copyright (c) 2015-2018 Cryptonomex, Inc., and contributors.\n *\n * The MIT License\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 <graphene\/chain\/database.hpp>\n#include <graphene\/chain\/proposal_evaluator.hpp>\n#include <graphene\/chain\/proposal_object.hpp>\n#include <graphene\/chain\/hardfork.hpp>\n\nnamespace graphene { namespace chain {\n\n\nstruct proposal_operation_hardfork_visitor\n{\n   typedef void result_type;\n   const fc::time_point_sec &block_time;\n\n   proposal_operation_hardfork_visitor(const fc::time_point_sec t) : block_time(t) {}\n\n   template<typename T>\n   void operator()(const T &v) const {}\n\n   \/\/ hf_620\n   void operator()(const graphene::chain::asset_create_operation &v) const {\n      if (block_time < HARDFORK_CORE_620_TIME) {\n         static const std::locale &loc = std::locale::classic();\n         FC_ASSERT(isalpha(v.symbol.back(), loc), \"Asset ${s} must end with alpha character before hardfork 620\", (\"s\", v.symbol));\n      }\n   }\n   \/\/ hf_199\n   void operator()(const graphene::chain::asset_update_issuer_operation &v) const {\n      if (block_time < HARDFORK_CORE_199_TIME) {\n         FC_ASSERT(false, \"Not allowed until hardfork 199\");\n      }\n   }\n   \/\/ hf_188\n   void operator()(const graphene::chain::asset_claim_pool_operation &v) const {\n      if (block_time < HARDFORK_CORE_188_TIME) {\n         FC_ASSERT(false, \"Not allowed until hardfork 188\");\n      }\n   }\n   \/\/ hf_588\n   \/\/ issue #588\n   \/\/\n   \/\/ As a virtual operation which has no evaluator `asset_settle_cancel_operation`\n   \/\/ originally won't be packed into blocks, yet its loose `validate()` method\n   \/\/ make it able to slip into blocks.\n   \/\/\n   \/\/ We need to forbid this operation being packed into blocks via proposal but\n   \/\/ this will lead to a hardfork (this operation in proposal will denied by new\n   \/\/ node while accept by old node), so a hardfork guard code needed and a\n   \/\/ consensus upgrade over all nodes needed in future. And because the\n   \/\/ `validate()` method not suitable to check database status, so we put the\n   \/\/ code here.\n   \/\/\n   \/\/ After the hardfork, all nodes will deny packing this operation into a block,\n   \/\/ and then we will check whether exists a proposal containing this kind of\n   \/\/ operation, if not exists, we can harden the `validate()` method to deny\n   \/\/ it in a earlier stage.\n   \/\/\n   void operator()(const graphene::chain::asset_settle_cancel_operation &v) const {\n      if (block_time > HARDFORK_CORE_588_TIME) {\n         FC_ASSERT(!\"Virtual operation\");\n      }\n   }\n   \/\/ loop and self visit in proposals\n   void operator()(const graphene::chain::proposal_create_operation &v) const {\n      for (const op_wrapper &op : v.proposed_ops)\n         op.op.visit(*this);\n   }\n};\n\nvoid_result proposal_create_evaluator::do_evaluate(const proposal_create_operation& o)\n{ try {\n   const database& d = db();\n\n   \/\/ Calling the proposal hardfork visitor\n   const fc::time_point_sec& block_time = d.head_block_time();\n   proposal_operation_hardfork_visitor vtor(block_time);\n   vtor( o );\n\n   const auto& global_parameters = d.get_global_properties().parameters;\n\n   FC_ASSERT( o.expiration_time > d.head_block_time(), \"Proposal has already expired on creation.\" );\n   FC_ASSERT( o.expiration_time <= d.head_block_time() + global_parameters.maximum_proposal_lifetime,\n              \"Proposal expiration time is too far in the future.\");\n   FC_ASSERT( !o.review_period_seconds || fc::seconds(*o.review_period_seconds) < (o.expiration_time - d.head_block_time()),\n              \"Proposal review period must be less than its overall lifetime.\" );\n\n   {\n      \/\/ If we're dealing with the committee authority, make sure this transaction has a sufficient review period.\n      flat_set<account_id_type> auths;\n      vector<authority> other;\n      for( auto& op : o.proposed_ops )\n      {\n         operation_get_required_authorities(op.op, auths, auths, other);\n      }\n\n      FC_ASSERT( other.size() == 0 ); \/\/ TODO: what about other??? \n\n      if( auths.find(GRAPHENE_COMMITTEE_ACCOUNT) != auths.end() )\n      {\n         GRAPHENE_ASSERT(\n            o.review_period_seconds.valid(),\n            proposal_create_review_period_required,\n            \"Review period not given, but at least ${min} required\",\n            (\"min\", global_parameters.committee_proposal_review_period)\n         );\n         GRAPHENE_ASSERT(\n            *o.review_period_seconds >= global_parameters.committee_proposal_review_period,\n            proposal_create_review_period_insufficient,\n            \"Review period of ${t} specified, but at least ${min} required\",\n            (\"t\", *o.review_period_seconds)\n            (\"min\", global_parameters.committee_proposal_review_period)\n         );\n      }\n   }\n\n   for( const op_wrapper& op : o.proposed_ops )\n      _proposed_trx.operations.push_back(op.op);\n\n   _proposed_trx.validate();\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nobject_id_type proposal_create_evaluator::do_apply(const proposal_create_operation& o)\n{ try {\n   database& d = db();\n\n   const proposal_object& proposal = d.create<proposal_object>([&](proposal_object& proposal) {\n      _proposed_trx.expiration = o.expiration_time;\n      proposal.proposed_transaction = _proposed_trx;\n      proposal.expiration_time = o.expiration_time;\n      proposal.proposer = o.fee_paying_account;\n      if( o.review_period_seconds )\n         proposal.review_period_time = o.expiration_time - *o.review_period_seconds;\n\n      \/\/Populate the required approval sets\n      flat_set<account_id_type> required_active;\n      vector<authority> other;\n      \n      \/\/ TODO: consider caching values from evaluate?\n      for( auto& op : _proposed_trx.operations )\n         operation_get_required_authorities(op, required_active, proposal.required_owner_approvals, other);\n\n      \/\/All accounts which must provide both owner and active authority should be omitted from the active authority set;\n      \/\/owner authority approval implies active authority approval.\n      std::set_difference(required_active.begin(), required_active.end(),\n                          proposal.required_owner_approvals.begin(), proposal.required_owner_approvals.end(),\n                          std::inserter(proposal.required_active_approvals, proposal.required_active_approvals.begin()));\n   });\n\n   return proposal.id;\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nvoid_result proposal_update_evaluator::do_evaluate(const proposal_update_operation& o)\n{ try {\n   database& d = db();\n\n   _proposal = &o.proposal(d);\n\n   if( _proposal->review_period_time && d.head_block_time() >= *_proposal->review_period_time )\n      FC_ASSERT( o.active_approvals_to_add.empty() && o.owner_approvals_to_add.empty(),\n                 \"This proposal is in its review period. No new approvals may be added.\" );\n\n   for( account_id_type id : o.active_approvals_to_remove )\n   {\n      FC_ASSERT( _proposal->available_active_approvals.find(id) != _proposal->available_active_approvals.end(),\n                 \"\", (\"id\", id)(\"available\", _proposal->available_active_approvals) );\n   }\n   for( account_id_type id : o.owner_approvals_to_remove )\n   {\n      FC_ASSERT( _proposal->available_owner_approvals.find(id) != _proposal->available_owner_approvals.end(),\n                 \"\", (\"id\", id)(\"available\", _proposal->available_owner_approvals) );\n   }\n\n   \/*  All authority checks happen outside of evaluators\n   if( (d.get_node_properties().skip_flags & database::skip_authority_check) == 0 )\n   {\n      for( const auto& id : o.key_approvals_to_add )\n      {\n         FC_ASSERT( trx_state->signed_by(id) );\n      }\n      for( const auto& id : o.key_approvals_to_remove )\n      {\n         FC_ASSERT( trx_state->signed_by(id) );\n      }\n   }\n   *\/\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nvoid_result proposal_update_evaluator::do_apply(const proposal_update_operation& o)\n{ try {\n   database& d = db();\n\n   \/\/ Potential optimization: if _executed_proposal is true, we can skip the modify step and make push_proposal skip\n   \/\/ signature checks. This isn't done now because I just wrote all the proposals code, and I'm not yet 100% sure the\n   \/\/ required approvals are sufficient to authorize the transaction.\n   d.modify(*_proposal, [&o, &d](proposal_object& p) {\n      p.available_active_approvals.insert(o.active_approvals_to_add.begin(), o.active_approvals_to_add.end());\n      p.available_owner_approvals.insert(o.owner_approvals_to_add.begin(), o.owner_approvals_to_add.end());\n      for( account_id_type id : o.active_approvals_to_remove )\n         p.available_active_approvals.erase(id);\n      for( account_id_type id : o.owner_approvals_to_remove )\n         p.available_owner_approvals.erase(id);\n      for( const auto& id : o.key_approvals_to_add )\n         p.available_key_approvals.insert(id);\n      for( const auto& id : o.key_approvals_to_remove )\n         p.available_key_approvals.erase(id);\n   });\n\n   \/\/ If the proposal has a review period, don't bother attempting to authorize\/execute it.\n   \/\/ Proposals with a review period may never be executed except at their expiration.\n   if( _proposal->review_period_time )\n      return void_result();\n\n   if( _proposal->is_authorized_to_execute(d) )\n   {\n      \/\/ All required approvals are satisfied. Execute!\n      _executed_proposal = true;\n      try {\n         _processed_transaction = d.push_proposal(*_proposal);\n      } catch(fc::exception& e) {\n         wlog(\"Proposed transaction ${id} failed to apply once approved with exception:\\n----\\n${reason}\\n----\\nWill try again when it expires.\",\n              (\"id\", o.proposal)(\"reason\", e.to_detail_string()));\n         _proposal_failed = true;\n      }\n   }\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nvoid_result proposal_delete_evaluator::do_evaluate(const proposal_delete_operation& o)\n{ try {\n   database& d = db();\n\n   _proposal = &o.proposal(d);\n\n   auto required_approvals = o.using_owner_authority? &_proposal->required_owner_approvals\n                                                    : &_proposal->required_active_approvals;\n   FC_ASSERT( required_approvals->find(o.fee_paying_account) != required_approvals->end(),\n              \"Provided authority is not authoritative for this proposal.\",\n              (\"provided\", o.fee_paying_account)(\"required\", *required_approvals));\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\nvoid_result proposal_delete_evaluator::do_apply(const proposal_delete_operation& o)\n{ try {\n   db().remove(*_proposal);\n\n   return void_result();\n} FC_CAPTURE_AND_RETHROW( (o) ) }\n\n\n} } \/\/ graphene::chain\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n *                    _   _____   __________                                  *\n *                   | | \/ \/ _ | \/ __\/_  __\/     Visibility                   *\n *                   | |\/ \/ __ |_\\ \\  \/ \/          Across                     *\n *                   |___\/_\/ |_\/___\/ \/_\/       Space and Time                 *\n *                                                                            *\n * This file is part of VAST. It is subject to the license terms in the       *\n * LICENSE file found in the top-level directory of this distribution and at  *\n * http:\/\/vast.io\/license. No part of VAST, including this file, may be       *\n * copied, modified, propagated, or distributed except according to the terms *\n * contained in the LICENSE file.                                             *\n ******************************************************************************\/\n\n#include \"vast\/detail\/fill_status_map.hpp\"\n\n#include <caf\/config_value.hpp>\n#include <caf\/downstream_manager.hpp>\n#include <caf\/inbound_path.hpp>\n#include <caf\/outbound_path.hpp>\n#include <caf\/scheduled_actor.hpp>\n#include <caf\/stream_manager.hpp>\n\n#include \"vast\/detail\/algorithms.hpp\"\n\nnamespace vast::detail {\n\nvoid fill_status_map(caf::dictionary<caf::config_value>& xs,\n                     caf::stream_manager& mgr) {\n  \/\/ Manager status.\n  put(xs, \"idle\", mgr.idle());\n  put(xs, \"congested\", mgr.idle());\n  \/\/ Downstream status.\n  auto& out = mgr.out();\n  auto& downstream = put_dictionary(xs, \"downstream\");\n  put(downstream, \"buffered\", out.buffered());\n  put(downstream, \"max-capacity\", out.max_capacity());\n  put(downstream, \"paths\", out.num_paths());\n  put(downstream, \"stalled\", out.stalled());\n  put(downstream, \"clean\", out.stalled());\n  out.for_each_path([&](auto& opath) {\n    auto name = \"slot-\" + std::to_string(opath.slots.sender);\n    auto& slot = put_dictionary(downstream, name);\n    put(slot, \"pending\", opath.pending());\n    put(slot, \"clean\", opath.clean());\n    put(slot, \"closing\", opath.closing);\n    put(slot, \"next-batch-id\", opath.next_batch_id);\n    put(slot, \"open-credit\", opath.open_credit);\n    put(slot, \"desired-batch-size\", opath.desired_batch_size);\n    put(slot, \"max-capacity\", opath.max_capacity);\n  });\n  \/\/ Upstream status.\n  auto& upstream = put_dictionary(xs, \"upstream\");\n  auto& ipaths = mgr.inbound_paths();\n  for (auto ipath : ipaths) {\n    auto name = \"slot-\" + std::to_string(ipath->slots.receiver);\n    auto& slot = put_dictionary(upstream, name);\n    put(slot, \"priority\", to_string(ipath->prio));\n    put(slot, \"assigned-credit\", ipath->assigned_credit);\n    put(slot, \"last-acked-batch-id\", ipath->last_acked_batch_id);\n  }\n}\n\nvoid fill_status_map(caf::dictionary<caf::config_value>& xs,\n                     caf::scheduled_actor* self) {\n  put(xs, \"actor-id\", self->id());\n  put(xs, \"name\", self->name());\n  put(xs, \"mailbox-size\", self->mailbox().size());\n  size_t counter = 0;\n  std::string name;\n  for (auto& mgr : unique_values(self->stream_managers())) {\n    name = \"stream-\";\n    name += std::to_string(counter++);\n    fill_status_map(put_dictionary(xs, name), *mgr);\n  }\n}\n\n} \/\/ namespace vast::detail\n<commit_msg>Fix stream manager status inspection<commit_after>\/******************************************************************************\n *                    _   _____   __________                                  *\n *                   | | \/ \/ _ | \/ __\/_  __\/     Visibility                   *\n *                   | |\/ \/ __ |_\\ \\  \/ \/          Across                     *\n *                   |___\/_\/ |_\/___\/ \/_\/       Space and Time                 *\n *                                                                            *\n * This file is part of VAST. It is subject to the license terms in the       *\n * LICENSE file found in the top-level directory of this distribution and at  *\n * http:\/\/vast.io\/license. No part of VAST, including this file, may be       *\n * copied, modified, propagated, or distributed except according to the terms *\n * contained in the LICENSE file.                                             *\n ******************************************************************************\/\n\n#include \"vast\/detail\/fill_status_map.hpp\"\n\n#include <caf\/config_value.hpp>\n#include <caf\/downstream_manager.hpp>\n#include <caf\/inbound_path.hpp>\n#include <caf\/outbound_path.hpp>\n#include <caf\/scheduled_actor.hpp>\n#include <caf\/stream_manager.hpp>\n\n#include \"vast\/detail\/algorithms.hpp\"\n\nnamespace vast::detail {\n\nvoid fill_status_map(caf::dictionary<caf::config_value>& xs,\n                     caf::stream_manager& mgr) {\n  \/\/ Manager status.\n  put(xs, \"idle\", mgr.idle());\n  put(xs, \"congested\", mgr.congested());\n  \/\/ Downstream status.\n  auto& out = mgr.out();\n  auto& downstream = put_dictionary(xs, \"downstream\");\n  put(downstream, \"buffered\", out.buffered());\n  put(downstream, \"max-capacity\", out.max_capacity());\n  put(downstream, \"paths\", out.num_paths());\n  put(downstream, \"stalled\", out.stalled());\n  put(downstream, \"clean\", out.stalled());\n  out.for_each_path([&](auto& opath) {\n    auto name = \"slot-\" + std::to_string(opath.slots.sender);\n    auto& slot = put_dictionary(downstream, name);\n    put(slot, \"pending\", opath.pending());\n    put(slot, \"clean\", opath.clean());\n    put(slot, \"closing\", opath.closing);\n    put(slot, \"next-batch-id\", opath.next_batch_id);\n    put(slot, \"open-credit\", opath.open_credit);\n    put(slot, \"desired-batch-size\", opath.desired_batch_size);\n    put(slot, \"max-capacity\", opath.max_capacity);\n  });\n  \/\/ Upstream status.\n  auto& upstream = put_dictionary(xs, \"upstream\");\n  auto& ipaths = mgr.inbound_paths();\n  for (auto ipath : ipaths) {\n    auto name = \"slot-\" + std::to_string(ipath->slots.receiver);\n    auto& slot = put_dictionary(upstream, name);\n    put(slot, \"priority\", to_string(ipath->prio));\n    put(slot, \"assigned-credit\", ipath->assigned_credit);\n    put(slot, \"last-acked-batch-id\", ipath->last_acked_batch_id);\n  }\n}\n\nvoid fill_status_map(caf::dictionary<caf::config_value>& xs,\n                     caf::scheduled_actor* self) {\n  put(xs, \"actor-id\", self->id());\n  put(xs, \"name\", self->name());\n  put(xs, \"mailbox-size\", self->mailbox().size());\n  size_t counter = 0;\n  std::string name;\n  for (auto& mgr : unique_values(self->stream_managers())) {\n    name = \"stream-\";\n    name += std::to_string(counter++);\n    fill_status_map(put_dictionary(xs, name), *mgr);\n  }\n}\n\n} \/\/ namespace vast::detail\n<|endoftext|>"}
{"text":"<commit_before>\/**\n    @file Rigidbody.cpp\n    @brief Methods that manages non-passing through elements in game.\n    @copyright LGPL. MIT License.\n*\/\n\n#include \"Components\/Rigidbody.hpp\"\n#include \"Globals\/ComponentTypes.hpp\"\n#include \"Math\/Vector.hpp\"\n\n#include \"Log\/log.hpp\"\n\n\n\/**\n    @brief Initializes RectangleCollider instance.\n    @param[in] GameObject *owner - owns the component.\n    @param[in] C_PHYSICS - physics component.\n*\/\nRigidbody::Rigidbody(GameObject *owner) : Component(owner, C_PHYSICS) {}\n\n\/**\n    @brief Updates the position of a fixed component, based on it velocity.\n*\/\nvoid Rigidbody::FixedComponentUpdate() {\n    \/\/ Check for gravity, and if exists, sets its force on a vector.\n    if (m_gravity) {\n        GetOwner()->AddVelocity(Vector(0, m_gravityForce));\n    }\n    else {\n       \/\/ Do nothing\n    }\n\n    \/\/ Sets the x,y positions in the owner component of the gameobject, according to its velocity.\n    auto velocity  = GetOwner()->GetVelocity();\n    GetOwner()->GetPosition()->m_x += velocity.m_x;\n    GetOwner()->GetPosition()->m_y += velocity.m_y;\n}\n<commit_msg>Applying assertive in Rigidbody.cpp<commit_after>\/**\n    @file Rigidbody.cpp\n    @brief Methods that manages non-passing through elements in game.\n    @copyright LGPL. MIT License.\n*\/\n\n#include \"Components\/Rigidbody.hpp\"\n#include \"Globals\/ComponentTypes.hpp\"\n#include \"Math\/Vector.hpp\"\n\n#include \"Log\/log.hpp\"\n\n#include <cassert>\n\n\n\/**\n    @brief Initializes RectangleCollider instance.\n    @param[in] GameObject *owner - owns the component.\n    @param[in] C_PHYSICS - physics component.\n*\/\nRigidbody::Rigidbody(GameObject *owner) : Component(owner, C_PHYSICS) {\n    assert((owner != NULL) && \"the owner must be equal to NULL\");\n}\n\n\/**\n    @brief Updates the position of a fixed component, based on it velocity.\n*\/\nvoid Rigidbody::FixedComponentUpdate() {\n    \/\/ Check for gravity, and if exists, sets its force on a vector.\n    if (m_gravity) {\n        GetOwner()->AddVelocity(Vector(0, m_gravityForce));\n    }\n    else {\n       \/\/ Do nothing\n    }\n\n    \/\/ Sets the x,y positions in the owner component of the gameobject, according to its velocity.\n    auto velocity  = GetOwner()->GetVelocity();\n    GetOwner()->GetPosition()->m_x += velocity.m_x;\n    GetOwner()->GetPosition()->m_y += velocity.m_y;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __CPP_EVENTS__THREADING__HPP\n#define __CPP_EVENTS__THREADING__HPP\n\nnamespace Cpp {\n\/\/------------------------------------------------------------------------------\nclass Threading\n{\npublic:\n\t\/\/ Implementation-specific\n\tclass ThreadData;\n\t\n\tstatic ThreadData * currentThreadData();\n\t\n\tstatic void constructProcessData();\n\tstatic void destructProcessData();\n\n\tstatic void constructThreadData();\n\tstatic void destructThreadData();\n\n\tclass ProcessInit\n\t{\n\tpublic:\n\t\tProcessInit() { constructProcessData(); }\n\t\t~ProcessInit() { destructProcessData(); }\n\t};\n\n\tclass ThreadInit\n\t{\n\tpublic:\n\t\tThreadInit() { constructThreadData(); }\n\t\t~ThreadInit() { destructThreadData(); }\n\t};\n};\n\/\/------------------------------------------------------------------------------\n} \/\/namespace Cpp\n\n#endif \/\/__CPP_EVENTS__THREADING__HPP<commit_msg>+: Cpp::Threading class documented<commit_after>#ifndef __CPP_EVENTS__THREADING__HPP\n#define __CPP_EVENTS__THREADING__HPP\n\nnamespace Cpp {\n\/\/------------------------------------------------------------------------------\nclass Threading\n{\npublic:\n\t\/\/! \\internal\n\tclass ThreadData;\n\t\n\t\/\/! \\internal\n\tstatic ThreadData * currentThreadData();\n\t\n\t\/\/! Initializes internal data for entire process and the main thread.\n\t\/**\n\t Should be called once before constructing any instance of the library classes in any thread.\n\t Should be called from the main thread before starting any other thread.\n\t \\see destructProcessData(), ProcessInit, constructThreadData()\n\t*\/\n\tstatic void constructProcessData();\n\t\n\t\/\/! Deinitializes internal data for entire process and the main thread.\n\t\/**\n\t Should be called once after destructing all instances of the library classes in all threads.\n\t Should be called from the main thread after finishing all other threads.\n\t \\see constructProcessData(), ProcessInit, destructThreadData()\n\t*\/\n\tstatic void destructProcessData();\n\n\t\/\/! Initializes internal data for the current thread.\n\t\/**\n\t Should be called once for each created thread that constructs any instance of the library classes.\n\t You may omit per-thread initialization for threads that use existing library objects, but does not create new one.\n\t Do not call this function for the main thread.\n\t \\see destructThreadData(), ThreadInit, constructProcessData()\n\t*\/\n\tstatic void constructThreadData();\n\t\n\t\/\/! Deinitializes internal data for the current thread.\n\t\/**\n\t Should be called once for each thread that called constructThreadData().\n\t No more instances of the library classes can be constructed in the current thread after calling this function,\n\t but instances constructed earlier remain valid and can be used in different threads.\n\t Do not call this function for the main thread.\n\t \\see constructThreadData(), ThreadInit, destructProcessData()\n\t*\/\n\tstatic void destructThreadData();\n\n\t\/\/! Convenience RAII wrapper for constructProcessData()\/destructProcessData().\n\t\/**\n\t Create single instance of this class on the stack of the main() function.\n\t This class simply calls constructProcessData() in the constructor and destructProcessData() in the destructor.\n\t This class is non-copyable.\n\t \\see constructProcessData(), destructProcessData()\n\t*\/\n\tclass ProcessInit\n\t{\n\tpublic:\n\t\tProcessInit() { constructProcessData(); }\n\t\t~ProcessInit() { destructProcessData(); }\n\t};\n\n\t\/\/! Convenience exception-safe per-thread library initializer.\n\t\/**\n\t Create single instance of this class on the stack of the created thread.\n\t This class simply calls constructThreadData() in the constructor and destructThreadData() in the destructor.\n\t This class is non-copyable.\n\t \\see constructThreadData(), destructThreadData()\n\t*\/\n\tclass ThreadInit\n\t{\n\tpublic:\n\t\tThreadInit() { constructThreadData(); }\n\t\t~ThreadInit() { destructThreadData(); }\n\t};\n};\n\/\/------------------------------------------------------------------------------\n} \/\/namespace Cpp\n\n#endif \/\/__CPP_EVENTS__THREADING__HPP<|endoftext|>"}
{"text":"<commit_before>#include \"McMaker\/TpcEffFitter.h\"\n#include \"Common.h\"\n\n\/\/ ROOT\n#include \"TGraphAsymmErrors.h\"\n#include \"TFile.h\"\n\n#include \"Logger.h\"\n#include \"Reporter.h\"\n#include \"RooPlotLib.h\"\nusing namespace jdb;\n\n\nvoid TpcEffFitter::initialize(  ){\n\n\tDEBUG( classname(), \"( \" << config.getFilename() << \", \" << nodePath << \" )\" )\n\toutputPath = config.getString( nodePath + \".output:path\", \"\" );\n\t\n\tbook = unique_ptr<HistoBook>( new HistoBook( outputPath + config.getString( nodePath +  \".output.data\", \"TpcEff.root\" ), config, \"\", \"\" ) );\t\n}\n\n\n\nvoid TpcEffFitter::make(){\n\tDEBUG(classname(), \"\")\n\n\tRooPlotLib rpl;\n\n\tgStyle->SetOptFit( 111 );\n\tstring params_file =  config.getString( nodePath + \".output.params\" );\n\tif ( \"\" == params_file ){\n\t\tERROR( classname(), \"Specifiy an output params file for the parameters\" )\n\t\treturn;\n\t}\n\n\tofstream out( params_file.c_str() );\n\n\tout << \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\" << endl;\n\tout << \"<config>\" << endl;\n\n\n\tvector<string> labels = config.getStringVector( nodePath + \".CentralityLabels\" );\n\tvector< int> cbins = config.getIntVector( nodePath + \".CentralityBins\" );\n\tReporter rp( config, nodePath + \"Reporter.\" );\n\n\tdouble minP0Error = config.getDouble( nodePath + \".Systematics:minP0Error\" );\n\n\tDEBUG( \"Starting plc loop\" )\n\tfor ( string plc : Common::species ){\n\t\tif ( \"E\" == plc || \"D\" == plc )\t\/\/ skip Electrons and Deuterons if I've got those in the list\n\t\t\tcontinue;\n\n\t\tfor ( string c : Common::sCharges ){\n\n\t\t\tout << \"\\t<\" << plc << \"_\" << c << \">\" << endl;\n\n\t\t\tstring fnMc = config.getString( nodePath + \".input:url\" ) + \"TpcEff_\" + plc + \"_\" + c + \"_mc\" + \".root\";\n\t\t\tTFile * fmc = new TFile( fnMc.c_str(), \"READ\" );\n\t\t\tstring fnRc = config.getString( nodePath + \".input:url\" ) + \"TpcEff_\" + plc + \"_\" + c + \"_rc\" + \".root\";\n\t\t\tTFile * frc = new TFile( fnRc.c_str(), \"READ\" );\n\n\t\t\tDEBUG( classname(), \"Mc File = \" << fmc );\n\t\t\tDEBUG( classname(), \"Rc File = \" << frc );\n\n\n\t\t\tif ( !fmc->IsOpen() || !frc->IsOpen() )\n\t\t\t\tcontinue;\n\t\t\t\n\n\t\t\t\/\/ build an efficiency for each centrality\n\t\t\tfor ( int b : cbins ){\n\n\t\t\t\tTH1 * hMc = (TH1*)fmc->Get( (\"inclusive\/pt_\" + ts( b ) + \"_\" + c ).c_str() );\n\t\t\t\tTH1 * hRc = (TH1*)frc->Get( (\"inclusive\/pt_\" + ts( b ) + \"_\" + c ).c_str() );\n\n\t\t\t\tINFO( classname(), \"N bins MC = \" << hMc->GetNbinsX() );\n\t\t\t\tINFO( classname(), \"N bins RC = \" << hRc->GetNbinsX() );\n\n\t\t\t\tfor ( int i = 0; i <= hMc->GetNbinsX() + 1; i++ ){\n\t\t\t\t\tif ( hMc->GetBinContent( i ) < hRc->GetBinContent( i ) ){\n\t\t\t\t\t\t\/\/ set to 100%\n\t\t\t\t\t\tif ( i > 5 )\n\t\t\t\t\t\t\thMc->SetBinContent( i, hRc->GetBinContent( i ) );\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\thRc->SetBinContent( i, 0 );\n\t\t\t\t\t\t\thMc->SetBinContent( i, 0 );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\t\n\n\t\t\t\thMc->Sumw2();\n\t\t\t\thRc->Sumw2();\n\n\t\t\t\tTGraphAsymmErrors g;\n\n\t\t\t\tg.SetName( (plc + \"_\" + c + \"_\" + ts(b)).c_str() );\n\t\t\t\tg.BayesDivide( hRc, hMc );\n\n\t\t\t\tINFO( classname(), \"Adding TGraphAsymmErrors to book\" );\n\t\t\t\tbook->add( plc + \"_\" + c + \"_\" + ts(b),  &g );\n\n\t\t\t\t\/\/ do the fit\n\t\t\t\tTF1 * fitFunc = new TF1( \"effFitFunc\", \"[0] * exp( - pow( [1] \/ x, [2] ) )\", 0.0, 5.0 );\n\t\t\t\tfitFunc->SetParameters( .85, 0.05, 5.0, -0.05 );\n\t\t\t\tfitFunc->SetParLimits( 0, 0.5, 1.0 );\n\t\t\t\tfitFunc->SetParLimits( 1, 0.0, 0.5 );\n\t\t\t\tfitFunc->SetParLimits( 2, 0.0, 100000 );\n\n\t\t\t\t\/\/ fist fit shape\n\t\t\t\tTFitResultPtr fitPointer = g.Fit( fitFunc, \"RSWW\" );\n\t\t\t\tfitPointer = g.Fit( fitFunc, \"RS\" );\n\n\t\t\t\t\/\/ ensure that uncertainty on efficiency is at least 2%\n\t\t\t\t\/\/ if ( fitFunc->GetParError( 0 ) < minP0Error ) {\n\t\t\t\t\/\/ \tINFO( classname(), \"P0 uncertainty below threshold (\" << (minP0Error * 100) << \"%\" );\n\t\t\t\t\/\/ \tINFO( classname(), \"Setting P0 error to \" << (minP0Error * 100) << \"%\" );\n\t\t\t\t\/\/ \tfitFunc->SetParError( 0, minP0Error );\n\t\t\t\t\/\/ }\n\n\t\t\t\tINFO( classname(), \"FitPointer = \" << fitPointer );\n\t\t\t\tTGraphErrors * band = Common::choleskyBands( fitPointer, fitFunc, 5000, 200, &rp );\n\n\n\t\t\t\t\n\t\t\t\trp.newPage();\n\t\t\t\trpl.style( &g ).set( \"title\", Common::plc_label( plc, c ) + \" : \" + labels[ b ] + \", 68%CL (Red)\" ).set( \"yr\", 0, 1.1 ).set( \"optfit\", 111 )\n\t\t\t\t\t.set( \"xr\", 0, 4.5 )\n\t\t\t\t\t.set(\"y\", \"Efficiency x Acceptance\").set( \"x\", \"p_{T}^{MC} [GeV\/c]\" ).draw();\n\n\n\t\t\t\tINFO( classname(), \"Stat Box\" );\n\t\t\t\tgStyle->SetStatY( 0.5 );\n\t\t\t\tgStyle->SetStatX( 0.85 );\n\t\t\t\t\n\t\t\t\tfitFunc->SetLineColor( kRed );\n\t\t\t\tfitFunc->Draw(\"same\");\t\n\n\t\t\t\tINFO( classname(), \"Drawing CL band\" );\n\t\t\t\t\n\t\t\t\tband->SetFillColorAlpha( kRed, 0.5 );\n\t\t\t\tband->Draw( \"same e3\" );\n\n\n\t\t\t\trp.savePage();\n\t\t\t\tstring imgName = outputPath + \"\/img\/TpcEff_\" + plc + \"_\" + c + \"_\" +  + \".png\";\n\t\t\t\tINFO( classname(), \"Exporting image to : \" << imgName );\n\t\t\t\trp.saveImage( imgName );\n\n\t\t\t\tINFO( classname(), \"Exporting Params\" );\n\t\t\t\texportParams( b, fitFunc, fitPointer, out );\n\n\t\t\t} \/\/ loop centrality bins\n\n\t\t\tout << \"\\t<\/\" << plc << \"_\" << c << \">\" << endl;\n\n\t\t} \/\/ loop on charge\n\t} \/\/ loop on plc\n\n\tout << \"<\/config>\" << endl;\n\tout.close();\n\n\n}\n\nvoid TpcEffFitter::exportParams( int bin, TF1 * f, TFitResultPtr result, ofstream &out ){\n\tINFO( classname(), \"(bin=\" << bin << \", f=\" << f << \", fPtr=\" << result << \" )\" )\n\tout << \"\\t\\t<TpcEffParams bin=\\\"\" << bin << \"\\\" \";\n\tout << Common::toXml( f, result );\n\tout << \"\/>\" << endl;\n}<commit_msg>fix TpcEff output path for image export<commit_after>#include \"McMaker\/TpcEffFitter.h\"\n#include \"Common.h\"\n\n\/\/ ROOT\n#include \"TGraphAsymmErrors.h\"\n#include \"TFile.h\"\n\n#include \"Logger.h\"\n#include \"Reporter.h\"\n#include \"RooPlotLib.h\"\nusing namespace jdb;\n\n\nvoid TpcEffFitter::initialize(  ){\n\n\tDEBUG( classname(), \"( \" << config.getFilename() << \", \" << nodePath << \" )\" )\n\toutputPath = config.getString( nodePath + \".output:path\", \"\" );\n\t\n\tbook = unique_ptr<HistoBook>( new HistoBook( outputPath + config.getString( nodePath +  \".output.data\", \"TpcEff.root\" ), config, \"\", \"\" ) );\t\n}\n\n\n\nvoid TpcEffFitter::make(){\n\tDEBUG(classname(), \"\")\n\n\tRooPlotLib rpl;\n\n\tgStyle->SetOptFit( 111 );\n\tstring params_file =  config.getString( nodePath + \".output.params\" );\n\tif ( \"\" == params_file ){\n\t\tERROR( classname(), \"Specifiy an output params file for the parameters\" )\n\t\treturn;\n\t}\n\n\tofstream out( params_file.c_str() );\n\n\tout << \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\" << endl;\n\tout << \"<config>\" << endl;\n\n\n\tvector<string> labels = config.getStringVector( nodePath + \".CentralityLabels\" );\n\tvector< int> cbins = config.getIntVector( nodePath + \".CentralityBins\" );\n\tReporter rp( config, nodePath + \"Reporter.\" );\n\n\tdouble minP0Error = config.getDouble( nodePath + \".Systematics:minP0Error\" );\n\n\tDEBUG( \"Starting plc loop\" )\n\tfor ( string plc : Common::species ){\n\t\tif ( \"E\" == plc || \"D\" == plc )\t\/\/ skip Electrons and Deuterons if I've got those in the list\n\t\t\tcontinue;\n\n\t\tfor ( string c : Common::sCharges ){\n\n\t\t\tout << \"\\t<\" << plc << \"_\" << c << \">\" << endl;\n\n\t\t\tstring fnMc = config.getString( nodePath + \".input:url\" ) + \"TpcEff_\" + plc + \"_\" + c + \"_mc\" + \".root\";\n\t\t\tTFile * fmc = new TFile( fnMc.c_str(), \"READ\" );\n\t\t\tstring fnRc = config.getString( nodePath + \".input:url\" ) + \"TpcEff_\" + plc + \"_\" + c + \"_rc\" + \".root\";\n\t\t\tTFile * frc = new TFile( fnRc.c_str(), \"READ\" );\n\n\t\t\tDEBUG( classname(), \"Mc File = \" << fmc );\n\t\t\tDEBUG( classname(), \"Rc File = \" << frc );\n\n\n\t\t\tif ( !fmc->IsOpen() || !frc->IsOpen() )\n\t\t\t\tcontinue;\n\t\t\t\n\n\t\t\t\/\/ build an efficiency for each centrality\n\t\t\tfor ( int b : cbins ){\n\n\t\t\t\tTH1 * hMc = (TH1*)fmc->Get( (\"inclusive\/pt_\" + ts( b ) + \"_\" + c ).c_str() );\n\t\t\t\tTH1 * hRc = (TH1*)frc->Get( (\"inclusive\/pt_\" + ts( b ) + \"_\" + c ).c_str() );\n\n\t\t\t\tINFO( classname(), \"N bins MC = \" << hMc->GetNbinsX() );\n\t\t\t\tINFO( classname(), \"N bins RC = \" << hRc->GetNbinsX() );\n\n\t\t\t\tfor ( int i = 0; i <= hMc->GetNbinsX() + 1; i++ ){\n\t\t\t\t\tif ( hMc->GetBinContent( i ) < hRc->GetBinContent( i ) ){\n\t\t\t\t\t\t\/\/ set to 100%\n\t\t\t\t\t\tif ( i > 5 )\n\t\t\t\t\t\t\thMc->SetBinContent( i, hRc->GetBinContent( i ) );\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\thRc->SetBinContent( i, 0 );\n\t\t\t\t\t\t\thMc->SetBinContent( i, 0 );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\t\n\n\t\t\t\thMc->Sumw2();\n\t\t\t\thRc->Sumw2();\n\n\t\t\t\tTGraphAsymmErrors g;\n\n\t\t\t\tg.SetName( (plc + \"_\" + c + \"_\" + ts(b)).c_str() );\n\t\t\t\tg.BayesDivide( hRc, hMc );\n\n\t\t\t\tINFO( classname(), \"Adding TGraphAsymmErrors to book\" );\n\t\t\t\tbook->add( plc + \"_\" + c + \"_\" + ts(b),  &g );\n\n\t\t\t\t\/\/ do the fit\n\t\t\t\tTF1 * fitFunc = new TF1( \"effFitFunc\", \"[0] * exp( - pow( [1] \/ x, [2] ) )\", 0.0, 5.0 );\n\t\t\t\tfitFunc->SetParameters( .85, 0.05, 5.0, -0.05 );\n\t\t\t\tfitFunc->SetParLimits( 0, 0.5, 1.0 );\n\t\t\t\tfitFunc->SetParLimits( 1, 0.0, 0.5 );\n\t\t\t\tfitFunc->SetParLimits( 2, 0.0, 100000 );\n\n\t\t\t\t\/\/ fist fit shape\n\t\t\t\tTFitResultPtr fitPointer = g.Fit( fitFunc, \"RSWW\" );\n\t\t\t\tfitPointer = g.Fit( fitFunc, \"RS\" );\n\n\t\t\t\t\/\/ ensure that uncertainty on efficiency is at least 2%\n\t\t\t\t\/\/ if ( fitFunc->GetParError( 0 ) < minP0Error ) {\n\t\t\t\t\/\/ \tINFO( classname(), \"P0 uncertainty below threshold (\" << (minP0Error * 100) << \"%\" );\n\t\t\t\t\/\/ \tINFO( classname(), \"Setting P0 error to \" << (minP0Error * 100) << \"%\" );\n\t\t\t\t\/\/ \tfitFunc->SetParError( 0, minP0Error );\n\t\t\t\t\/\/ }\n\n\t\t\t\tINFO( classname(), \"FitPointer = \" << fitPointer );\n\t\t\t\tTGraphErrors * band = Common::choleskyBands( fitPointer, fitFunc, 5000, 200, &rp );\n\n\n\t\t\t\t\n\t\t\t\trp.newPage();\n\t\t\t\trpl.style( &g ).set( \"title\", Common::plc_label( plc, c ) + \" : \" + labels[ b ] + \", 68%CL (Red)\" ).set( \"yr\", 0, 1.1 ).set( \"optfit\", 111 )\n\t\t\t\t\t.set( \"xr\", 0, 4.5 )\n\t\t\t\t\t.set(\"y\", \"Efficiency x Acceptance\").set( \"x\", \"p_{T}^{MC} [GeV\/c]\" ).draw();\n\n\n\t\t\t\tINFO( classname(), \"Stat Box\" );\n\t\t\t\tgStyle->SetStatY( 0.5 );\n\t\t\t\tgStyle->SetStatX( 0.85 );\n\t\t\t\t\n\t\t\t\tfitFunc->SetLineColor( kRed );\n\t\t\t\tfitFunc->Draw(\"same\");\t\n\n\t\t\t\tINFO( classname(), \"Drawing CL band\" );\n\t\t\t\t\n\t\t\t\tband->SetFillColorAlpha( kRed, 0.5 );\n\t\t\t\tband->Draw( \"same e3\" );\n\n\n\t\t\t\trp.savePage();\n\t\t\t\tstring imgName = outputPath + \"img\/TpcEff_\" + plc + \"_\" + c + \"_\" + ts(b) + \".png\";\n\t\t\t\tINFO( classname(), \"Exporting image to : \" << imgName );\n\t\t\t\trp.saveImage( imgName );\n\n\t\t\t\tINFO( classname(), \"Exporting Params\" );\n\t\t\t\texportParams( b, fitFunc, fitPointer, out );\n\n\t\t\t} \/\/ loop centrality bins\n\n\t\t\tout << \"\\t<\/\" << plc << \"_\" << c << \">\" << endl;\n\n\t\t} \/\/ loop on charge\n\t} \/\/ loop on plc\n\n\tout << \"<\/config>\" << endl;\n\tout.close();\n\n\n}\n\nvoid TpcEffFitter::exportParams( int bin, TF1 * f, TFitResultPtr result, ofstream &out ){\n\tINFO( classname(), \"(bin=\" << bin << \", f=\" << f << \", fPtr=\" << result << \" )\" )\n\tout << \"\\t\\t<TpcEffParams bin=\\\"\" << bin << \"\\\" \";\n\tout << Common::toXml( f, result );\n\tout << \"\/>\" << endl;\n}<|endoftext|>"}
{"text":"<commit_before>#include \"Common\/config.h\"\n#include \"Sofa\/Core\/ObjectFactory.h\"\n#include <iostream>\n#include <fstream>\n\nnamespace Sofa\n{\n\nnamespace Components\n{\n\nvoid init()\n{\n    static bool first = true;\n    if (first)\n    {\n        std::cout << \"Sofa Components Initialized\"<<std::endl;\n        Sofa::Core::ObjectFactory::getInstance()->dump();\n        std::ofstream ofile(\"sofa-classes.html\");\n        ofile << \"<html><body>\\n\";\n        Sofa::Core::ObjectFactory::getInstance()->dumpHTML(ofile);\n        ofile << \"<\/body><\/html>\\n\";\n        first = false;\n    }\n}\n\n} \/\/ namespace Components\n\n} \/\/ namespace SOFA\n\n\/\/\/\/\/\/\/\/\/\/ BEGIN CLASS LIST \/\/\/\/\/\/\/\/\/\/\nSOFA_LINK_CLASS(BarycentricLagrangianMultiplierContact)\nSOFA_LINK_CLASS(BarycentricMapping)\nSOFA_LINK_CLASS(BarycentricPenalityContact)\nSOFA_LINK_CLASS(BruteForce)\nSOFA_LINK_CLASS(CGImplicit)\nSOFA_LINK_CLASS(MatrixStatic)\nSOFA_LINK_CLASS(CollisionGroupManagerSofa)\nSOFA_LINK_CLASS(ContactManagerSofa)\nSOFA_LINK_CLASS(ContinuousIntersection)\nSOFA_LINK_CLASS(CoordinateSystem)\nSOFA_LINK_CLASS(Cube)\nSOFA_LINK_CLASS(DiagonalMass)\nSOFA_LINK_CLASS(DiscreteIntersection)\nSOFA_LINK_CLASS(EdgePressureForceField)\nSOFA_LINK_CLASS(EdgeSetTopology)\nSOFA_LINK_CLASS(Euler)\nSOFA_LINK_CLASS(ExternalForceField)\nSOFA_LINK_CLASS(FixedConstraint)\nSOFA_LINK_CLASS(FixedPlaneConstraint)\nSOFA_LINK_CLASS(GNode)\nSOFA_LINK_CLASS(Gravity)\nSOFA_LINK_CLASS(GridTopology)\nSOFA_LINK_CLASS(IdentityMapping)\nSOFA_LINK_CLASS(ImageBMP)\nSOFA_LINK_CLASS(ImagePNG)\nSOFA_LINK_CLASS(ImplicitSurfaceMapping)\nSOFA_LINK_CLASS(InteractionConstraintImpl)\nSOFA_LINK_CLASS(LagrangianMultiplierAttachConstraint)\nSOFA_LINK_CLASS(LagrangianMultiplierContactConstraint)\nSOFA_LINK_CLASS(LagrangianMultiplierFixedConstraint)\nSOFA_LINK_CLASS(LaparoscopicRigidMapping)\nSOFA_LINK_CLASS(LennardJonesForceField)\nSOFA_LINK_CLASS(Line)\nSOFA_LINK_CLASS(MechanicalObject)\nSOFA_LINK_CLASS(MeshOBJ)\nSOFA_LINK_CLASS(MeshSpringForceField)\nSOFA_LINK_CLASS(MeshTopology)\nSOFA_LINK_CLASS(MeshTrian)\nSOFA_LINK_CLASS(MinProximityIntersection)\nSOFA_LINK_CLASS(MultiResSparseGridTopology)\nSOFA_LINK_CLASS(Node)\nSOFA_LINK_CLASS(Object)\nSOFA_LINK_CLASS(OglModel)\nSOFA_LINK_CLASS(OscillatorConstraint)\nSOFA_LINK_CLASS(PenalityContactForceField)\nSOFA_LINK_CLASS(PipelineSofa)\nSOFA_LINK_CLASS(PlaneForceField)\nSOFA_LINK_CLASS(Point)\nSOFA_LINK_CLASS(PointSetTopology)\nSOFA_LINK_CLASS(ProximityIntersection)\nSOFA_LINK_CLASS(Ray)\nSOFA_LINK_CLASS(RayContact)\nSOFA_LINK_CLASS(RegularGridSpringForceField)\nSOFA_LINK_CLASS(RegularGridTopology)\nSOFA_LINK_CLASS(RepulsiveSpringForceField)\nSOFA_LINK_CLASS(RigidMapping)\nSOFA_LINK_CLASS(RungeKutta4)\nSOFA_LINK_CLASS(BoxConstraint)\nSOFA_LINK_CLASS(SparseGridSpringForceField)\nSOFA_LINK_CLASS(Sphere)\nSOFA_LINK_CLASS(SPHFluidForceField)\nSOFA_LINK_CLASS(SPHFluidSurfaceMapping)\nSOFA_LINK_CLASS(SpringForceField)\nSOFA_LINK_CLASS(SpringEdgeDataForceField)\nSOFA_LINK_CLASS(StaticSolver)\nSOFA_LINK_CLASS(StiffSpringForceField)\nSOFA_LINK_CLASS(SurfaceIdentityMapping)\nSOFA_LINK_CLASS(SubsetMapping)\nSOFA_LINK_CLASS(TensorForceField)\nSOFA_LINK_CLASS(TetrahedronFEMForceField)\nSOFA_LINK_CLASS(ThreadSimulation)\nSOFA_LINK_CLASS(Triangle)\nSOFA_LINK_CLASS(TriangleBendingSprings)\nSOFA_LINK_CLASS(TriangleFEMForceField)\nSOFA_LINK_CLASS(TrimmedRegularGridTopology)\nSOFA_LINK_CLASS(UniformMass)\nSOFA_LINK_CLASS(TestDetection)\nSOFA_LINK_CLASS(SphereTreeModel)\nSOFA_LINK_CLASS(SingleSphere)\n\/\/SOFA_LINK_CLASS(VoxelGrid)\nSOFA_LINK_CLASS(WashingMachineForceField)\nSOFA_LINK_CLASS(EdgeRemoveContact)\n<commit_msg>r784\/sofa-dev : FIX compilation<commit_after>#include \"Common\/config.h\"\n#include <iostream>\n\nnamespace Sofa\n{\n\nnamespace Components\n{\n\nvoid init()\n{\n    static bool first = true;\n    if (first)\n    {\n        std::cout << \"Sofa Components Initialized\"<<std::endl;\n        first = false;\n    }\n}\n\n} \/\/ namespace Components\n\n} \/\/ namespace SOFA\n\n\/\/\/\/\/\/\/\/\/\/ BEGIN CLASS LIST \/\/\/\/\/\/\/\/\/\/\nSOFA_LINK_CLASS(BarycentricLagrangianMultiplierContact)\nSOFA_LINK_CLASS(BarycentricMapping)\nSOFA_LINK_CLASS(BarycentricPenalityContact)\nSOFA_LINK_CLASS(BruteForce)\nSOFA_LINK_CLASS(CGImplicit)\nSOFA_LINK_CLASS(MatrixStatic)\nSOFA_LINK_CLASS(CollisionGroupManagerSofa)\nSOFA_LINK_CLASS(ContactManagerSofa)\nSOFA_LINK_CLASS(ContinuousIntersection)\nSOFA_LINK_CLASS(CoordinateSystem)\nSOFA_LINK_CLASS(Cube)\nSOFA_LINK_CLASS(DiagonalMass)\nSOFA_LINK_CLASS(DiscreteIntersection)\nSOFA_LINK_CLASS(EdgePressureForceField)\nSOFA_LINK_CLASS(EdgeSetTopology)\nSOFA_LINK_CLASS(Euler)\nSOFA_LINK_CLASS(ExternalForceField)\nSOFA_LINK_CLASS(FixedConstraint)\nSOFA_LINK_CLASS(FixedPlaneConstraint)\nSOFA_LINK_CLASS(GNode)\nSOFA_LINK_CLASS(Gravity)\nSOFA_LINK_CLASS(GridTopology)\nSOFA_LINK_CLASS(IdentityMapping)\nSOFA_LINK_CLASS(ImageBMP)\nSOFA_LINK_CLASS(ImagePNG)\nSOFA_LINK_CLASS(ImplicitSurfaceMapping)\nSOFA_LINK_CLASS(InteractionConstraintImpl)\nSOFA_LINK_CLASS(LagrangianMultiplierAttachConstraint)\nSOFA_LINK_CLASS(LagrangianMultiplierContactConstraint)\nSOFA_LINK_CLASS(LagrangianMultiplierFixedConstraint)\nSOFA_LINK_CLASS(LaparoscopicRigidMapping)\nSOFA_LINK_CLASS(LennardJonesForceField)\nSOFA_LINK_CLASS(Line)\nSOFA_LINK_CLASS(MechanicalObject)\nSOFA_LINK_CLASS(MeshOBJ)\nSOFA_LINK_CLASS(MeshSpringForceField)\nSOFA_LINK_CLASS(MeshTopology)\nSOFA_LINK_CLASS(MeshTrian)\nSOFA_LINK_CLASS(MinProximityIntersection)\nSOFA_LINK_CLASS(MultiResSparseGridTopology)\nSOFA_LINK_CLASS(Node)\nSOFA_LINK_CLASS(Object)\nSOFA_LINK_CLASS(OglModel)\nSOFA_LINK_CLASS(OscillatorConstraint)\nSOFA_LINK_CLASS(PenalityContactForceField)\nSOFA_LINK_CLASS(PipelineSofa)\nSOFA_LINK_CLASS(PlaneForceField)\nSOFA_LINK_CLASS(Point)\nSOFA_LINK_CLASS(PointSetTopology)\nSOFA_LINK_CLASS(ProximityIntersection)\nSOFA_LINK_CLASS(Ray)\nSOFA_LINK_CLASS(RayContact)\nSOFA_LINK_CLASS(RegularGridSpringForceField)\nSOFA_LINK_CLASS(RegularGridTopology)\nSOFA_LINK_CLASS(RepulsiveSpringForceField)\nSOFA_LINK_CLASS(RigidMapping)\nSOFA_LINK_CLASS(RungeKutta4)\nSOFA_LINK_CLASS(BoxConstraint)\nSOFA_LINK_CLASS(SparseGridSpringForceField)\nSOFA_LINK_CLASS(Sphere)\nSOFA_LINK_CLASS(SPHFluidForceField)\nSOFA_LINK_CLASS(SPHFluidSurfaceMapping)\nSOFA_LINK_CLASS(SpringForceField)\nSOFA_LINK_CLASS(SpringEdgeDataForceField)\nSOFA_LINK_CLASS(StaticSolver)\nSOFA_LINK_CLASS(StiffSpringForceField)\nSOFA_LINK_CLASS(SurfaceIdentityMapping)\nSOFA_LINK_CLASS(SubsetMapping)\nSOFA_LINK_CLASS(TensorForceField)\nSOFA_LINK_CLASS(TetrahedronFEMForceField)\nSOFA_LINK_CLASS(ThreadSimulation)\nSOFA_LINK_CLASS(Triangle)\nSOFA_LINK_CLASS(TriangleBendingSprings)\nSOFA_LINK_CLASS(TriangleFEMForceField)\nSOFA_LINK_CLASS(TrimmedRegularGridTopology)\nSOFA_LINK_CLASS(UniformMass)\nSOFA_LINK_CLASS(TestDetection)\nSOFA_LINK_CLASS(SphereTreeModel)\nSOFA_LINK_CLASS(SingleSphere)\n\/\/SOFA_LINK_CLASS(VoxelGrid)\nSOFA_LINK_CLASS(WashingMachineForceField)\nSOFA_LINK_CLASS(EdgeRemoveContact)\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ FastNBT.cpp\n\n\/\/ Implements the fast NBT parser and writer\n\n#include \"Globals.h\"\n#include \"FastNBT.h\"\n\n\n\n\n\n\/\/ The number of NBT tags that are reserved when an NBT parsing is started. \n\/\/ You can override this by using a cmdline define\n#ifndef NBT_RESERVE_SIZE\n\t#define NBT_RESERVE_SIZE 200\n#endif  \/\/ NBT_RESERVE_SIZE\n\n#ifdef _MSC_VER\n\t\/\/ Dodge a C4127 (conditional expression is constant) for this specific macro usage\n\t#define RETURN_FALSE_IF_FALSE(X) do { if (!X) return false; } while ((false, false))\n#else\n\t#define RETURN_FALSE_IF_FALSE(X) do { if (!X) return false; } while (false)\n#endif\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cParsedNBT:\n\n#define NEEDBYTES(N) \\\n\tif (m_Length - m_Pos < N) \\\n\t{ \\\n\t\treturn false; \\\n\t}\n\n\n\n\n\ncParsedNBT::cParsedNBT(const char * a_Data, int a_Length) :\n\tm_Data(a_Data),\n\tm_Length(a_Length),\n\tm_Pos(0)\n{\n\tm_IsValid = Parse();\n}\n\n\n\n\n\nbool cParsedNBT::Parse(void)\n{\n\tif (m_Length < 3)\n\t{\n\t\t\/\/ Data too short\n\t\treturn false;\n\t}\n\tif (m_Data[0] != TAG_Compound)\n\t{\n\t\t\/\/ The top-level tag must be a Compound\n\t\treturn false;\n\t}\n\t\n\tm_Tags.reserve(NBT_RESERVE_SIZE);\n\t\n\tm_Tags.push_back(cFastNBTTag(TAG_Compound, -1));\n\t\n\tm_Pos = 1;\n\t\n\tRETURN_FALSE_IF_FALSE(ReadString(m_Tags.back().m_NameStart, m_Tags.back().m_NameLength)); \n\tRETURN_FALSE_IF_FALSE(ReadCompound());\n\t\n\treturn true;\n}\n\n\n\n\n\nbool cParsedNBT::ReadString(int & a_StringStart, int & a_StringLen)\n{\n\tNEEDBYTES(2);\n\ta_StringStart = m_Pos + 2;\n\ta_StringLen = GetBEShort(m_Data + m_Pos);\n\tif (a_StringLen < 0)\n\t{\n\t\t\/\/ Invalid string length\n\t\treturn false;\n\t}\n\tm_Pos += 2 + a_StringLen;\n\treturn true;\n}\n\n\n\n\n\nbool cParsedNBT::ReadCompound(void)\n{\n\t\/\/ Reads the latest tag as a compound\n\tint ParentIdx = m_Tags.size() - 1;\n\tint PrevSibling = -1;\n\tfor (;;)\n\t{\n\t\tNEEDBYTES(1);\n\t\teTagType TagType = (eTagType)(m_Data[m_Pos]);\n\t\tm_Pos++;\n\t\tif (TagType == TAG_End)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tm_Tags.push_back(cFastNBTTag(TagType, ParentIdx, PrevSibling));\n\t\tif (PrevSibling >= 0)\n\t\t{\n\t\t\tm_Tags[PrevSibling].m_NextSibling = m_Tags.size() - 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_Tags[ParentIdx].m_FirstChild = m_Tags.size() - 1;\n\t\t}\n\t\tPrevSibling = m_Tags.size() - 1;\n\t\tRETURN_FALSE_IF_FALSE(ReadString(m_Tags.back().m_NameStart, m_Tags.back().m_NameLength));\n\t\tRETURN_FALSE_IF_FALSE(ReadTag());\n\t}  \/\/ while (true)\n\tm_Tags[ParentIdx].m_LastChild = PrevSibling;\n\treturn true;\n}\n\n\n\n\n\nbool cParsedNBT::ReadList(eTagType a_ChildrenType)\n{\n\t\/\/ Reads the latest tag as a list of items of type a_ChildrenType\n\t\n\t\/\/ Read the count:\n\tNEEDBYTES(4);\n\tint Count = GetBEInt(m_Data + m_Pos);\n\tm_Pos += 4;\n\tif (Count < 0)\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Read items:\n\tint ParentIdx = m_Tags.size() - 1;\n\tint PrevSibling = -1;\n\tfor (int i = 0; i < Count; i++)\n\t{\n\t\tm_Tags.push_back(cFastNBTTag(a_ChildrenType, ParentIdx, PrevSibling));\n\t\tif (PrevSibling >= 0)\n\t\t{\n\t\t\tm_Tags[PrevSibling].m_NextSibling = m_Tags.size() - 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_Tags[ParentIdx].m_FirstChild = m_Tags.size() - 1;\n\t\t}\n\t\tPrevSibling = m_Tags.size() - 1;\n\t\tRETURN_FALSE_IF_FALSE(ReadTag());\n\t}  \/\/ for (i)\n\tm_Tags[ParentIdx].m_LastChild = PrevSibling;\n\treturn true;\n}\n\n\n\n\n\n#define CASE_SIMPLE_TAG(TAGTYPE, LEN) \\\n\tcase TAG_##TAGTYPE: \\\n\t{ \\\n\t\tNEEDBYTES(LEN); \\\n\t\tTag.m_DataStart = m_Pos; \\\n\t\tTag.m_DataLength = LEN; \\\n\t\tm_Pos += LEN; \\\n\t\treturn true; \\\n\t}\n\t\nbool cParsedNBT::ReadTag(void)\n{\n\tcFastNBTTag & Tag = m_Tags.back();\n\tswitch (Tag.m_Type)\n\t{\n\t\tCASE_SIMPLE_TAG(Byte,   1)\n\t\tCASE_SIMPLE_TAG(Short,  2)\n\t\tCASE_SIMPLE_TAG(Int,    4)\n\t\tCASE_SIMPLE_TAG(Long,   8)\n\t\tCASE_SIMPLE_TAG(Float,  4)\n\t\tCASE_SIMPLE_TAG(Double, 8)\n\t\t\n\t\tcase TAG_String:\n\t\t{\n\t\t\treturn ReadString(Tag.m_DataStart, Tag.m_DataLength);\n\t\t}\n\t\t\n\t\tcase TAG_ByteArray:\n\t\t{\n\t\t\tNEEDBYTES(4);\n\t\t\tint len = GetBEInt(m_Data + m_Pos);\n\t\t\tm_Pos += 4;\n\t\t\tif (len < 0)\n\t\t\t{\n\t\t\t\t\/\/ Invalid length\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tNEEDBYTES(len);\n\t\t\tTag.m_DataLength = len;\n\t\t\tTag.m_DataStart = m_Pos;\n\t\t\tm_Pos += len;\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tcase TAG_List:\n\t\t{\n\t\t\tNEEDBYTES(1);\n\t\t\teTagType ItemType = (eTagType)m_Data[m_Pos];\n\t\t\tm_Pos++;\n\t\t\tRETURN_FALSE_IF_FALSE(ReadList(ItemType));\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tcase TAG_Compound:\n\t\t{\n\t\t\tRETURN_FALSE_IF_FALSE(ReadCompound());\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tcase TAG_IntArray:\n\t\t{\n\t\t\tNEEDBYTES(4);\n\t\t\tint len = GetBEInt(m_Data + m_Pos);\n\t\t\tm_Pos += 4;\n\t\t\tif (len < 0)\n\t\t\t{\n\t\t\t\t\/\/ Invalid length\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tlen *= 4;\n\t\t\tNEEDBYTES(len);\n\t\t\tTag.m_DataLength = len;\n\t\t\tTag.m_DataStart = m_Pos;\n\t\t\tm_Pos += len;\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tdefault:\n\t\t{\n\t\t\tASSERT(!\"Unhandled NBT tag type\");\n\t\t\treturn false;\n\t\t}\n\t}  \/\/ switch (iType)\n}\n\n#undef CASE_SIMPLE_TAG\n\n\n\n\n\nint cParsedNBT::FindChildByName(int a_Tag, const char * a_Name, size_t a_NameLength) const\n{\n\tif (a_Tag < 0)\n\t{\n\t\treturn -1;\n\t}\n\tif (m_Tags[a_Tag].m_Type != TAG_Compound)\n\t{\n\t\treturn -1;\n\t}\n\t\n\tif (a_NameLength == 0)\n\t{\n\t\ta_NameLength = strlen(a_Name);\n\t}\n\tfor (int Child = m_Tags[a_Tag].m_FirstChild; Child != -1; Child = m_Tags[Child].m_NextSibling)\n\t{\n\t\tif (\n\t\t\t(m_Tags[Child].m_NameLength == (int)a_NameLength) &&\n\t\t\t(memcmp(m_Data + m_Tags[Child].m_NameStart, a_Name, a_NameLength) == 0)\n\t\t)\n\t\t{\n\t\t\treturn Child;\n\t\t}\n\t}  \/\/ for Child - children of a_Tag\n\treturn -1;\n}\n\n\n\n\n\nint cParsedNBT::FindTagByPath(int a_Tag, const AString & a_Path) const\n{\n\tif (a_Tag < 0)\n\t{\n\t\treturn -1;\n\t}\n\tsize_t Begin = 0;\n\tsize_t Length = a_Path.length();\n\tint Tag = a_Tag;\n\tfor (size_t i = 0; i < Length; i++)\n\t{\n\t\tif (a_Path[i] != '\\\\')\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tTag = FindChildByName(Tag, a_Path.c_str() + Begin, i - Begin - 1);\n\t\tif (Tag < 0)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t\tBegin = i + 1;\n\t}  \/\/ for i - a_Path[]\n\t\n\tif (Begin < Length)\n\t{\n\t\tTag = FindChildByName(Tag, a_Path.c_str() + Begin, Length - Begin);\n\t}\n\treturn Tag;\n}\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cFastNBTWriter:\n\ncFastNBTWriter::cFastNBTWriter(const AString & a_RootTagName) :\n\tm_CurrentStack(0)\n{\n\tm_Stack[0].m_Type = TAG_Compound;\n\tm_Result.reserve(100 * 1024);\n\tm_Result.push_back(TAG_Compound);\n\tWriteString(a_RootTagName.data(), a_RootTagName.size());\n}\n\n\n\n\n\nvoid cFastNBTWriter::BeginCompound(const AString & a_Name)\n{\n\tif (m_CurrentStack >= MAX_STACK)\n\t{\n\t\tASSERT(!\"Stack overflow\");\n\t\treturn;\n\t}\n\t\n\tTagCommon(a_Name, TAG_Compound);\n\t\n\t++m_CurrentStack;\n\tm_Stack[m_CurrentStack].m_Type = TAG_Compound;\n}\n\n\n\n\n\nvoid cFastNBTWriter::EndCompound(void)\n{\n\tASSERT(m_CurrentStack > 0);\n\tASSERT(IsStackTopCompound());\n\t\n\tm_Result.push_back(TAG_End);\n\t--m_CurrentStack;\n}\n\n\n\n\n\nvoid cFastNBTWriter::BeginList(const AString & a_Name, eTagType a_ChildrenType)\n{\n\tif (m_CurrentStack >= MAX_STACK)\n\t{\n\t\tASSERT(!\"Stack overflow\");\n\t\treturn;\n\t}\n\t\n\tTagCommon(a_Name, TAG_List);\n\t\t\n\tm_Result.push_back((char)a_ChildrenType);\n\tm_Result.append(4, (char)0);\n\t\n\t++m_CurrentStack;\n\tm_Stack[m_CurrentStack].m_Type     = TAG_List;\n\tm_Stack[m_CurrentStack].m_Pos      = m_Result.size() - 4;\n\tm_Stack[m_CurrentStack].m_Count    = 0;\n\tm_Stack[m_CurrentStack].m_ItemType = a_ChildrenType;\n}\n\n\n\n\n\nvoid cFastNBTWriter::EndList(void)\n{\n\tASSERT(m_CurrentStack > 0);\n\tASSERT(m_Stack[m_CurrentStack].m_Type == TAG_List);\n\t\n\t\/\/ Update the list count:\n\tSetBEInt((char *)(m_Result.c_str() + m_Stack[m_CurrentStack].m_Pos), m_Stack[m_CurrentStack].m_Count);\n\n\t--m_CurrentStack;\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddByte(const AString & a_Name, unsigned char a_Value)\n{\n\tTagCommon(a_Name, TAG_Byte);\n\tm_Result.push_back(a_Value);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddShort(const AString & a_Name, Int16 a_Value)\n{\n\tTagCommon(a_Name, TAG_Short);\n\tInt16 Value = htons(a_Value);\n\tm_Result.append((const char *)&Value, 2);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddInt(const AString & a_Name, Int32 a_Value)\n{\n\tTagCommon(a_Name, TAG_Int);\n\tInt32 Value = htonl(a_Value);\n\tm_Result.append((const char *)&Value, 4);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddLong(const AString & a_Name, Int64 a_Value)\n{\n\tTagCommon(a_Name, TAG_Long);\n\tInt64 Value = HostToNetwork8(&a_Value);\n\tm_Result.append((const char *)&Value, 8);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddFloat(const AString & a_Name, float a_Value)\n{\n\tTagCommon(a_Name, TAG_Float);\n\tInt32 Value = HostToNetwork4(&a_Value);\n\tm_Result.append((const char *)&Value, 4);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddDouble(const AString & a_Name, double a_Value)\n{\n\tTagCommon(a_Name, TAG_Double);\n\tInt64 Value = HostToNetwork8(&a_Value);\n\tm_Result.append((const char *)&Value, 8);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddString(const AString & a_Name, const AString & a_Value)\n{\n\tTagCommon(a_Name, TAG_String);\n\tInt16 len = htons((short)(a_Value.size()));\n\tm_Result.append((const char *)&len, 2);\n\tm_Result.append(a_Value.c_str(), a_Value.size());\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddByteArray(const AString & a_Name, const char * a_Value, size_t a_NumElements)\n{\n\tTagCommon(a_Name, TAG_ByteArray);\n\tInt32 len = htonl(a_NumElements);\n\tm_Result.append((const char *)&len, 4);\n\tm_Result.append(a_Value, a_NumElements);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddIntArray(const AString & a_Name, const int * a_Value, size_t a_NumElements)\n{\n\tTagCommon(a_Name, TAG_IntArray);\n\tInt32 len = htonl(a_NumElements);\n\tm_Result.append((const char *)&len, 4);\n#if defined(ANDROID_NDK)\n\t\/\/ Android has alignment issues - cannot byteswap (htonl) an int that is not 32-bit-aligned, which happens in the regular version\n\tfor (size_t i = 0; i < a_NumElements; i++)\n\t{\n\t\tint Element = htonl(a_Value[i]);\n\t\tm_Result.append((const char *)&Element, 4);\n\t}\n#else\n\tint * Elements = (int *)(m_Result.data() + m_Result.size());\n\tm_Result.append(a_NumElements * 4, (char)0);\n\tfor (size_t i = 0; i < a_NumElements; i++)\n\t{\n\t\tElements[i] = htonl(a_Value[i]);\n\t}\n#endif\n}\n\n\n\n\n\nvoid cFastNBTWriter::Finish(void)\n{\n\tASSERT(m_CurrentStack == 0);\n\tm_Result.push_back(TAG_End);\n}\n\n\n\n\n\nvoid cFastNBTWriter::WriteString(const char * a_Data, short a_Length)\n{\n\tInt16 Len = htons(a_Length);\n\tm_Result.append((const char *)&Len, 2);\n\tm_Result.append(a_Data, a_Length);\n}\n\n\n\n\n<commit_msg>Use string.reserve to avoid the need to do inplace byteswap<commit_after>\n\/\/ FastNBT.cpp\n\n\/\/ Implements the fast NBT parser and writer\n\n#include \"Globals.h\"\n#include \"FastNBT.h\"\n\n\n\n\n\n\/\/ The number of NBT tags that are reserved when an NBT parsing is started. \n\/\/ You can override this by using a cmdline define\n#ifndef NBT_RESERVE_SIZE\n\t#define NBT_RESERVE_SIZE 200\n#endif  \/\/ NBT_RESERVE_SIZE\n\n#ifdef _MSC_VER\n\t\/\/ Dodge a C4127 (conditional expression is constant) for this specific macro usage\n\t#define RETURN_FALSE_IF_FALSE(X) do { if (!X) return false; } while ((false, false))\n#else\n\t#define RETURN_FALSE_IF_FALSE(X) do { if (!X) return false; } while (false)\n#endif\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cParsedNBT:\n\n#define NEEDBYTES(N) \\\n\tif (m_Length - m_Pos < N) \\\n\t{ \\\n\t\treturn false; \\\n\t}\n\n\n\n\n\ncParsedNBT::cParsedNBT(const char * a_Data, int a_Length) :\n\tm_Data(a_Data),\n\tm_Length(a_Length),\n\tm_Pos(0)\n{\n\tm_IsValid = Parse();\n}\n\n\n\n\n\nbool cParsedNBT::Parse(void)\n{\n\tif (m_Length < 3)\n\t{\n\t\t\/\/ Data too short\n\t\treturn false;\n\t}\n\tif (m_Data[0] != TAG_Compound)\n\t{\n\t\t\/\/ The top-level tag must be a Compound\n\t\treturn false;\n\t}\n\t\n\tm_Tags.reserve(NBT_RESERVE_SIZE);\n\t\n\tm_Tags.push_back(cFastNBTTag(TAG_Compound, -1));\n\t\n\tm_Pos = 1;\n\t\n\tRETURN_FALSE_IF_FALSE(ReadString(m_Tags.back().m_NameStart, m_Tags.back().m_NameLength)); \n\tRETURN_FALSE_IF_FALSE(ReadCompound());\n\t\n\treturn true;\n}\n\n\n\n\n\nbool cParsedNBT::ReadString(int & a_StringStart, int & a_StringLen)\n{\n\tNEEDBYTES(2);\n\ta_StringStart = m_Pos + 2;\n\ta_StringLen = GetBEShort(m_Data + m_Pos);\n\tif (a_StringLen < 0)\n\t{\n\t\t\/\/ Invalid string length\n\t\treturn false;\n\t}\n\tm_Pos += 2 + a_StringLen;\n\treturn true;\n}\n\n\n\n\n\nbool cParsedNBT::ReadCompound(void)\n{\n\t\/\/ Reads the latest tag as a compound\n\tint ParentIdx = m_Tags.size() - 1;\n\tint PrevSibling = -1;\n\tfor (;;)\n\t{\n\t\tNEEDBYTES(1);\n\t\teTagType TagType = (eTagType)(m_Data[m_Pos]);\n\t\tm_Pos++;\n\t\tif (TagType == TAG_End)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tm_Tags.push_back(cFastNBTTag(TagType, ParentIdx, PrevSibling));\n\t\tif (PrevSibling >= 0)\n\t\t{\n\t\t\tm_Tags[PrevSibling].m_NextSibling = m_Tags.size() - 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_Tags[ParentIdx].m_FirstChild = m_Tags.size() - 1;\n\t\t}\n\t\tPrevSibling = m_Tags.size() - 1;\n\t\tRETURN_FALSE_IF_FALSE(ReadString(m_Tags.back().m_NameStart, m_Tags.back().m_NameLength));\n\t\tRETURN_FALSE_IF_FALSE(ReadTag());\n\t}  \/\/ while (true)\n\tm_Tags[ParentIdx].m_LastChild = PrevSibling;\n\treturn true;\n}\n\n\n\n\n\nbool cParsedNBT::ReadList(eTagType a_ChildrenType)\n{\n\t\/\/ Reads the latest tag as a list of items of type a_ChildrenType\n\t\n\t\/\/ Read the count:\n\tNEEDBYTES(4);\n\tint Count = GetBEInt(m_Data + m_Pos);\n\tm_Pos += 4;\n\tif (Count < 0)\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Read items:\n\tint ParentIdx = m_Tags.size() - 1;\n\tint PrevSibling = -1;\n\tfor (int i = 0; i < Count; i++)\n\t{\n\t\tm_Tags.push_back(cFastNBTTag(a_ChildrenType, ParentIdx, PrevSibling));\n\t\tif (PrevSibling >= 0)\n\t\t{\n\t\t\tm_Tags[PrevSibling].m_NextSibling = m_Tags.size() - 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_Tags[ParentIdx].m_FirstChild = m_Tags.size() - 1;\n\t\t}\n\t\tPrevSibling = m_Tags.size() - 1;\n\t\tRETURN_FALSE_IF_FALSE(ReadTag());\n\t}  \/\/ for (i)\n\tm_Tags[ParentIdx].m_LastChild = PrevSibling;\n\treturn true;\n}\n\n\n\n\n\n#define CASE_SIMPLE_TAG(TAGTYPE, LEN) \\\n\tcase TAG_##TAGTYPE: \\\n\t{ \\\n\t\tNEEDBYTES(LEN); \\\n\t\tTag.m_DataStart = m_Pos; \\\n\t\tTag.m_DataLength = LEN; \\\n\t\tm_Pos += LEN; \\\n\t\treturn true; \\\n\t}\n\t\nbool cParsedNBT::ReadTag(void)\n{\n\tcFastNBTTag & Tag = m_Tags.back();\n\tswitch (Tag.m_Type)\n\t{\n\t\tCASE_SIMPLE_TAG(Byte,   1)\n\t\tCASE_SIMPLE_TAG(Short,  2)\n\t\tCASE_SIMPLE_TAG(Int,    4)\n\t\tCASE_SIMPLE_TAG(Long,   8)\n\t\tCASE_SIMPLE_TAG(Float,  4)\n\t\tCASE_SIMPLE_TAG(Double, 8)\n\t\t\n\t\tcase TAG_String:\n\t\t{\n\t\t\treturn ReadString(Tag.m_DataStart, Tag.m_DataLength);\n\t\t}\n\t\t\n\t\tcase TAG_ByteArray:\n\t\t{\n\t\t\tNEEDBYTES(4);\n\t\t\tint len = GetBEInt(m_Data + m_Pos);\n\t\t\tm_Pos += 4;\n\t\t\tif (len < 0)\n\t\t\t{\n\t\t\t\t\/\/ Invalid length\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tNEEDBYTES(len);\n\t\t\tTag.m_DataLength = len;\n\t\t\tTag.m_DataStart = m_Pos;\n\t\t\tm_Pos += len;\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tcase TAG_List:\n\t\t{\n\t\t\tNEEDBYTES(1);\n\t\t\teTagType ItemType = (eTagType)m_Data[m_Pos];\n\t\t\tm_Pos++;\n\t\t\tRETURN_FALSE_IF_FALSE(ReadList(ItemType));\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tcase TAG_Compound:\n\t\t{\n\t\t\tRETURN_FALSE_IF_FALSE(ReadCompound());\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tcase TAG_IntArray:\n\t\t{\n\t\t\tNEEDBYTES(4);\n\t\t\tint len = GetBEInt(m_Data + m_Pos);\n\t\t\tm_Pos += 4;\n\t\t\tif (len < 0)\n\t\t\t{\n\t\t\t\t\/\/ Invalid length\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tlen *= 4;\n\t\t\tNEEDBYTES(len);\n\t\t\tTag.m_DataLength = len;\n\t\t\tTag.m_DataStart = m_Pos;\n\t\t\tm_Pos += len;\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tdefault:\n\t\t{\n\t\t\tASSERT(!\"Unhandled NBT tag type\");\n\t\t\treturn false;\n\t\t}\n\t}  \/\/ switch (iType)\n}\n\n#undef CASE_SIMPLE_TAG\n\n\n\n\n\nint cParsedNBT::FindChildByName(int a_Tag, const char * a_Name, size_t a_NameLength) const\n{\n\tif (a_Tag < 0)\n\t{\n\t\treturn -1;\n\t}\n\tif (m_Tags[a_Tag].m_Type != TAG_Compound)\n\t{\n\t\treturn -1;\n\t}\n\t\n\tif (a_NameLength == 0)\n\t{\n\t\ta_NameLength = strlen(a_Name);\n\t}\n\tfor (int Child = m_Tags[a_Tag].m_FirstChild; Child != -1; Child = m_Tags[Child].m_NextSibling)\n\t{\n\t\tif (\n\t\t\t(m_Tags[Child].m_NameLength == (int)a_NameLength) &&\n\t\t\t(memcmp(m_Data + m_Tags[Child].m_NameStart, a_Name, a_NameLength) == 0)\n\t\t)\n\t\t{\n\t\t\treturn Child;\n\t\t}\n\t}  \/\/ for Child - children of a_Tag\n\treturn -1;\n}\n\n\n\n\n\nint cParsedNBT::FindTagByPath(int a_Tag, const AString & a_Path) const\n{\n\tif (a_Tag < 0)\n\t{\n\t\treturn -1;\n\t}\n\tsize_t Begin = 0;\n\tsize_t Length = a_Path.length();\n\tint Tag = a_Tag;\n\tfor (size_t i = 0; i < Length; i++)\n\t{\n\t\tif (a_Path[i] != '\\\\')\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tTag = FindChildByName(Tag, a_Path.c_str() + Begin, i - Begin - 1);\n\t\tif (Tag < 0)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t\tBegin = i + 1;\n\t}  \/\/ for i - a_Path[]\n\t\n\tif (Begin < Length)\n\t{\n\t\tTag = FindChildByName(Tag, a_Path.c_str() + Begin, Length - Begin);\n\t}\n\treturn Tag;\n}\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cFastNBTWriter:\n\ncFastNBTWriter::cFastNBTWriter(const AString & a_RootTagName) :\n\tm_CurrentStack(0)\n{\n\tm_Stack[0].m_Type = TAG_Compound;\n\tm_Result.reserve(100 * 1024);\n\tm_Result.push_back(TAG_Compound);\n\tWriteString(a_RootTagName.data(), a_RootTagName.size());\n}\n\n\n\n\n\nvoid cFastNBTWriter::BeginCompound(const AString & a_Name)\n{\n\tif (m_CurrentStack >= MAX_STACK)\n\t{\n\t\tASSERT(!\"Stack overflow\");\n\t\treturn;\n\t}\n\t\n\tTagCommon(a_Name, TAG_Compound);\n\t\n\t++m_CurrentStack;\n\tm_Stack[m_CurrentStack].m_Type = TAG_Compound;\n}\n\n\n\n\n\nvoid cFastNBTWriter::EndCompound(void)\n{\n\tASSERT(m_CurrentStack > 0);\n\tASSERT(IsStackTopCompound());\n\t\n\tm_Result.push_back(TAG_End);\n\t--m_CurrentStack;\n}\n\n\n\n\n\nvoid cFastNBTWriter::BeginList(const AString & a_Name, eTagType a_ChildrenType)\n{\n\tif (m_CurrentStack >= MAX_STACK)\n\t{\n\t\tASSERT(!\"Stack overflow\");\n\t\treturn;\n\t}\n\t\n\tTagCommon(a_Name, TAG_List);\n\t\t\n\tm_Result.push_back((char)a_ChildrenType);\n\tm_Result.append(4, (char)0);\n\t\n\t++m_CurrentStack;\n\tm_Stack[m_CurrentStack].m_Type     = TAG_List;\n\tm_Stack[m_CurrentStack].m_Pos      = m_Result.size() - 4;\n\tm_Stack[m_CurrentStack].m_Count    = 0;\n\tm_Stack[m_CurrentStack].m_ItemType = a_ChildrenType;\n}\n\n\n\n\n\nvoid cFastNBTWriter::EndList(void)\n{\n\tASSERT(m_CurrentStack > 0);\n\tASSERT(m_Stack[m_CurrentStack].m_Type == TAG_List);\n\t\n\t\/\/ Update the list count:\n\tSetBEInt((char *)(m_Result.c_str() + m_Stack[m_CurrentStack].m_Pos), m_Stack[m_CurrentStack].m_Count);\n\n\t--m_CurrentStack;\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddByte(const AString & a_Name, unsigned char a_Value)\n{\n\tTagCommon(a_Name, TAG_Byte);\n\tm_Result.push_back(a_Value);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddShort(const AString & a_Name, Int16 a_Value)\n{\n\tTagCommon(a_Name, TAG_Short);\n\tInt16 Value = htons(a_Value);\n\tm_Result.append((const char *)&Value, 2);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddInt(const AString & a_Name, Int32 a_Value)\n{\n\tTagCommon(a_Name, TAG_Int);\n\tInt32 Value = htonl(a_Value);\n\tm_Result.append((const char *)&Value, 4);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddLong(const AString & a_Name, Int64 a_Value)\n{\n\tTagCommon(a_Name, TAG_Long);\n\tInt64 Value = HostToNetwork8(&a_Value);\n\tm_Result.append((const char *)&Value, 8);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddFloat(const AString & a_Name, float a_Value)\n{\n\tTagCommon(a_Name, TAG_Float);\n\tInt32 Value = HostToNetwork4(&a_Value);\n\tm_Result.append((const char *)&Value, 4);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddDouble(const AString & a_Name, double a_Value)\n{\n\tTagCommon(a_Name, TAG_Double);\n\tInt64 Value = HostToNetwork8(&a_Value);\n\tm_Result.append((const char *)&Value, 8);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddString(const AString & a_Name, const AString & a_Value)\n{\n\tTagCommon(a_Name, TAG_String);\n\tInt16 len = htons((short)(a_Value.size()));\n\tm_Result.append((const char *)&len, 2);\n\tm_Result.append(a_Value.c_str(), a_Value.size());\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddByteArray(const AString & a_Name, const char * a_Value, size_t a_NumElements)\n{\n\tTagCommon(a_Name, TAG_ByteArray);\n\tInt32 len = htonl(a_NumElements);\n\tm_Result.append((const char *)&len, 4);\n\tm_Result.append(a_Value, a_NumElements);\n}\n\n\n\n\n\nvoid cFastNBTWriter::AddIntArray(const AString & a_Name, const int * a_Value, size_t a_NumElements)\n{\n\tTagCommon(a_Name, TAG_IntArray);\n\tInt32 len = htonl(a_NumElements);\n\tsize_t cap = m_Result.capacity();\n\tsize_t size = m_Result.length();\n\tif ((cap - size) < (4 + a_NumElements * 4))\n\t{\n\t\tm_Result.reserve(size +4 + a_NumElements * 4);\n\t}\n\tm_Result.append((const char *)&len, 4);\n\tfor (size_t i = 0; i < a_NumElements; i++)\n\t{\n\t\tint Element = htonl(a_Value[i]);\n\t\tm_Result.append((const char *)&Element, 4);\n\t}\n}\n\n\n\n\n\nvoid cFastNBTWriter::Finish(void)\n{\n\tASSERT(m_CurrentStack == 0);\n\tm_Result.push_back(TAG_End);\n}\n\n\n\n\n\nvoid cFastNBTWriter::WriteString(const char * a_Data, short a_Length)\n{\n\tInt16 Len = htons(a_Length);\n\tm_Result.append((const char *)&Len, 2);\n\tm_Result.append(a_Data, a_Length);\n}\n\n\n\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 * $ Id: $\n *\n *\/\n\n#include \"XSLTInputSource.hpp\"\n\n\n\n#include <cassert>\n\n\n\n#include <framework\/URLInputSource.hpp>\n#include <util\/BinFileInputStream.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/StdBinInputStream.hpp>\n#include <PlatformSupport\/URISupport.hpp>\n\n\n\nXSLTInputSource::XSLTInputSource() :\n\tInputSource(\"\"),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\n\nXSLTInputSource::XSLTInputSource(const XMLCh*\tsystemId) :\n\tInputSource(systemId),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\nXSLTInputSource::XSLTInputSource(\n\t\t\tconst XMLCh*\tsystemId,\n\t\t\tconst XMLCh*\tpublicId) :\n\tInputSource(systemId, publicId),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\nXSLTInputSource::XSLTInputSource(const char*\tsystemId) :\n\tInputSource(systemId),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\nXSLTInputSource::XSLTInputSource(\n\t\t\tconst char*\t\tsystemId,\n\t\t\tconst char*\t\tpublicId) :\n\tInputSource(systemId,\n\t\t\t\tpublicId),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\nXSLTInputSource::XSLTInputSource(XalanNode*\t\tnode) :\n\tInputSource(\"\"),\n\tm_stream(0),\n\tm_node(node)\n{\n}\n\n\n\n#if defined(XALAN_NO_NAMESPACES)\nXSLTInputSource::XSLTInputSource(istream*\t\tstream) :\n#else\nXSLTInputSource::XSLTInputSource(std::istream*\tstream) :\n#endif\n\tInputSource(\"\"),\n\tm_stream(stream),\n\tm_node(0)\n{\n}\n\n\n\nBinInputStream*\nXSLTInputSource::makeStream() const\n{\n\tBinInputStream*\t\ttheResult = 0;\n\n\tif (m_stream != 0)\n\t{\n\t\ttheResult = new StdBinInputStream(*m_stream);\n\t}\n\telse if (m_node == 0)\n\t{\n#if 1\n\t\tURISupport::URLAutoPtrType\ttheURL = URISupport::getURLFromString(getSystemId());\n\n\t\ttheResult = theURL->makeNewStream();\n#else\n\t\tconst XMLCh* const\ttheSystemID =\n\t\t\tgetSystemId();\n\n\t\tconst unsigned int\ttheColonIndex = indexOf(theSystemID, ':');\n\t\tconst unsigned int\ttheLength = length(theSystemID);\n\n\t\tif (theColonIndex == theLength)\n\t\t{\n\t\t\t\/\/ No ':', so assume it's a file.\n\t\t\ttheResult = new BinFileInputStream(theSystemID);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ It could be a DOS-style file spec...\n\t\t\tconst unsigned int\ttheBackslashIndex = indexOf(theSystemID, '\\\\');\n\n\t\t\tif (theBackslashIndex < theLength && theBackslashIndex == 2)\n\t\t\t{\n\t\t\t\t\/\/ OK, another shot at a file...\n\t\t\t\ttheResult = new BinFileInputStream(theSystemID);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tURLInputSource inputSource(getSystemId());\n\n\t\t\t\ttheResult = inputSource.makeStream();\n\t\t\t}\n\t\t}\n#endif\n\t}\n\n\treturn theResult;\n}\n\n\n\nvoid\nXSLTInputSource::setNode(XalanNode*\t\tnode)\n{\n\tm_node = node;\n}\n\n\n\nXalanNode*\nXSLTInputSource::getNode() const\n{\n\treturn m_node;\n}\n<commit_msg>Fixed default constructor problem.<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 * $ Id: $\n *\n *\/\n\n#include \"XSLTInputSource.hpp\"\n\n\n\n#include <cassert>\n\n\n\n#include <framework\/URLInputSource.hpp>\n#include <util\/BinFileInputStream.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/StdBinInputStream.hpp>\n#include <PlatformSupport\/URISupport.hpp>\n\n\n\nXSLTInputSource::XSLTInputSource() :\n\tInputSource(),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\n\nXSLTInputSource::XSLTInputSource(const XMLCh*\tsystemId) :\n\tInputSource(systemId),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\nXSLTInputSource::XSLTInputSource(\n\t\t\tconst XMLCh*\tsystemId,\n\t\t\tconst XMLCh*\tpublicId) :\n\tInputSource(systemId, publicId),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\nXSLTInputSource::XSLTInputSource(const char*\tsystemId) :\n\tInputSource(systemId),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\nXSLTInputSource::XSLTInputSource(\n\t\t\tconst char*\t\tsystemId,\n\t\t\tconst char*\t\tpublicId) :\n\tInputSource(systemId,\n\t\t\t\tpublicId),\n\tm_stream(0),\n\tm_node(0)\n{\n}\n\n\n\nXSLTInputSource::XSLTInputSource(XalanNode*\t\tnode) :\n\tInputSource(\"\"),\n\tm_stream(0),\n\tm_node(node)\n{\n}\n\n\n\n#if defined(XALAN_NO_NAMESPACES)\nXSLTInputSource::XSLTInputSource(istream*\t\tstream) :\n#else\nXSLTInputSource::XSLTInputSource(std::istream*\tstream) :\n#endif\n\tInputSource(\"\"),\n\tm_stream(stream),\n\tm_node(0)\n{\n}\n\n\n\nBinInputStream*\nXSLTInputSource::makeStream() const\n{\n\tBinInputStream*\t\ttheResult = 0;\n\n\tif (m_stream != 0)\n\t{\n\t\ttheResult = new StdBinInputStream(*m_stream);\n\t}\n\telse if (m_node == 0)\n\t{\n#if 1\n\t\tURISupport::URLAutoPtrType\ttheURL = URISupport::getURLFromString(getSystemId());\n\n\t\ttheResult = theURL->makeNewStream();\n#else\n\t\tconst XMLCh* const\ttheSystemID =\n\t\t\tgetSystemId();\n\n\t\tconst unsigned int\ttheColonIndex = indexOf(theSystemID, ':');\n\t\tconst unsigned int\ttheLength = length(theSystemID);\n\n\t\tif (theColonIndex == theLength)\n\t\t{\n\t\t\t\/\/ No ':', so assume it's a file.\n\t\t\ttheResult = new BinFileInputStream(theSystemID);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ It could be a DOS-style file spec...\n\t\t\tconst unsigned int\ttheBackslashIndex = indexOf(theSystemID, '\\\\');\n\n\t\t\tif (theBackslashIndex < theLength && theBackslashIndex == 2)\n\t\t\t{\n\t\t\t\t\/\/ OK, another shot at a file...\n\t\t\t\ttheResult = new BinFileInputStream(theSystemID);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tURLInputSource inputSource(getSystemId());\n\n\t\t\t\ttheResult = inputSource.makeStream();\n\t\t\t}\n\t\t}\n#endif\n\t}\n\n\treturn theResult;\n}\n\n\n\nvoid\nXSLTInputSource::setNode(XalanNode*\t\tnode)\n{\n\tm_node = node;\n}\n\n\n\nXalanNode*\nXSLTInputSource::getNode() const\n{\n\treturn m_node;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"controller.h\"\n#include \"animation\/animation.h\"\n#include \"engine\/resource_manager.h\"\n#include \"engine\/resource_manager_base.h\"\n\n\nnamespace Lumix\n{\n\n\nstatic const ResourceType ANIMATION_TYPE(\"animation\");\n\n\nnamespace Anim\n{\n\n\nControllerResource::ControllerResource(const Path& path, ResourceManagerBase& resource_manager, IAllocator& allocator)\n\t: Resource(path, resource_manager, allocator)\n\t, m_root(nullptr)\n\t, m_allocator(allocator)\n\t, m_anim_set(allocator)\n{\n}\n\n\nControllerResource::~ControllerResource()\n{\n\tunload();\n}\n\n\nvoid ControllerResource::unload()\n{\n\tLUMIX_DELETE(m_allocator, m_root);\n\tm_root = nullptr;\n\tfor (Animation* anim : m_anim_set)\n\t{\n\t\tif(anim) anim->getResourceManager().unload(*anim);\n\t}\n\tm_anim_set.clear();\n}\n\n\nbool ControllerResource::load(FS::IFile& file)\n{\n\tInputBlob blob(file.getBuffer(), (int)file.size());\n\tdeserialize(blob);\n\treturn true;\n}\n\n\nvoid ControllerResource::setRoot(Component* component)\n{\n\tASSERT(m_root == nullptr);\n\tm_root = component;\n}\n\n\nvoid ControllerResource::deserialize(InputBlob& blob)\n{\n\tComponent::Type type;\n\tblob.read(type);\n\tm_root = createComponent(type, m_allocator);\n\tm_root->deserialize(blob, nullptr);\n\tblob.read(m_input_decl.inputs_count);\n\tfor (int i = 0; i < m_input_decl.inputs_count; ++i)\n\t{\n\t\tauto& input = m_input_decl.inputs[i];\n\t\tblob.readString(input.name, lengthOf(input.name));\n\t\tblob.read(input.type);\n\t\tblob.read(input.offset);\n\t}\n\n\tblob.read(m_input_decl.constants_count);\n\tfor (int i = 0; i < m_input_decl.constants_count; ++i)\n\t{\n\t\tauto& constant = m_input_decl.constants[i];\n\t\tblob.readString(constant.name, lengthOf(constant.name));\n\t\tblob.read(constant.type);\n\t\tswitch (constant.type)\n\t\t{\n\t\t\tcase InputDecl::BOOL: blob.read(constant.b_value); break;\n\t\t\tcase InputDecl::INT: blob.read(constant.i_value); break;\n\t\t\tcase InputDecl::FLOAT: blob.read(constant.f_value); break;\n\t\t\tdefault: ASSERT(false); return;\n\t\t}\n\t}\n\n\tm_anim_set.clear();\n\tint count;\n\tblob.read(count);\n\tauto* manager = m_resource_manager.getOwner().get(ANIMATION_TYPE);\n\tfor (int i = 0; i < count; ++i)\n\t{\n\t\tuint32 key;\n\t\tchar path[MAX_PATH_LENGTH];\n\t\tblob.read(key);\n\t\tblob.readString(path, lengthOf(path));\n\t\tAnimation* anim = path[0] ? (Animation*)manager->load(Path(path)) : nullptr;\n\t\tif(anim) addDependency(*anim);\n\t\tm_anim_set.insert(key, anim);\n\t}\n}\n\n\nvoid ControllerResource::serialize(OutputBlob& blob)\n{\n\tblob.write(m_root->type);\n\tm_root->serialize(blob);\n\tblob.write(m_input_decl.inputs_count);\n\tfor (int i = 0; i < m_input_decl.inputs_count; ++i)\n\t{\n\t\tauto& input = m_input_decl.inputs[i];\n\t\tblob.writeString(input.name);\n\t\tblob.write(input.type);\n\t\tblob.write(input.offset);\n\t}\n\tblob.write(m_input_decl.constants_count);\n\tfor (int i = 0; i < m_input_decl.constants_count; ++i)\n\t{\n\t\tauto& constant = m_input_decl.constants[i];\n\t\tblob.writeString(constant.name);\n\t\tblob.write(constant.type);\n\t\tswitch (constant.type)\n\t\t{\n\t\t\tcase InputDecl::BOOL: blob.write(constant.b_value); break;\n\t\t\tcase InputDecl::INT: blob.write(constant.i_value); break;\n\t\t\tcase InputDecl::FLOAT: blob.write(constant.f_value); break;\n\t\t\tdefault: ASSERT(false); return;\n\t\t}\n\t\t\n\t}\n\tblob.write(m_anim_set.size());\n\tfor (auto iter = m_anim_set.begin(), end = m_anim_set.end(); iter != end; ++iter)\n\t{\n\t\tblob.write(iter.key());\n\t\tblob.writeString(iter.value() ? iter.value()->getPath().c_str() : \"\");\n\t}\n}\n\n\nComponentInstance* ControllerResource::createInstance(IAllocator& allocator)\n{\n\treturn m_root ? m_root->createInstance(allocator) : nullptr;\n}\n\n\n\nResource* ControllerManager::createResource(const Path& path)\n{\n\treturn LUMIX_NEW(m_allocator, ControllerResource)(path, *this, m_allocator);\n}\n\n\nvoid ControllerManager::destroyResource(Resource& resource)\n{\n\tLUMIX_DELETE(m_allocator, (ControllerResource*)&resource);\n}\n\n\n\n} \/\/ namespace Anim\n\n\n} \/\/ namespace Lumix<commit_msg>fixed crash when unloading anim controller<commit_after>#include \"controller.h\"\n#include \"animation\/animation.h\"\n#include \"engine\/resource_manager.h\"\n#include \"engine\/resource_manager_base.h\"\n\n\nnamespace Lumix\n{\n\n\nstatic const ResourceType ANIMATION_TYPE(\"animation\");\n\n\nnamespace Anim\n{\n\n\nControllerResource::ControllerResource(const Path& path, ResourceManagerBase& resource_manager, IAllocator& allocator)\n\t: Resource(path, resource_manager, allocator)\n\t, m_root(nullptr)\n\t, m_allocator(allocator)\n\t, m_anim_set(allocator)\n{\n}\n\n\nControllerResource::~ControllerResource()\n{\n\tunload();\n}\n\n\nvoid ControllerResource::unload()\n{\n\tLUMIX_DELETE(m_allocator, m_root);\n\tm_root = nullptr;\n\tfor (Animation* anim : m_anim_set)\n\t{\n\t\tif (anim)\n\t\t{\n\t\t\tremoveDependency(*anim);\n\t\t\tanim->getResourceManager().unload(*anim);\n\t\t}\n\t}\n\tm_anim_set.clear();\n}\n\n\nbool ControllerResource::load(FS::IFile& file)\n{\n\tInputBlob blob(file.getBuffer(), (int)file.size());\n\tdeserialize(blob);\n\treturn true;\n}\n\n\nvoid ControllerResource::setRoot(Component* component)\n{\n\tASSERT(m_root == nullptr);\n\tm_root = component;\n}\n\n\nvoid ControllerResource::deserialize(InputBlob& blob)\n{\n\tComponent::Type type;\n\tblob.read(type);\n\tm_root = createComponent(type, m_allocator);\n\tm_root->deserialize(blob, nullptr);\n\tblob.read(m_input_decl.inputs_count);\n\tfor (int i = 0; i < m_input_decl.inputs_count; ++i)\n\t{\n\t\tauto& input = m_input_decl.inputs[i];\n\t\tblob.readString(input.name, lengthOf(input.name));\n\t\tblob.read(input.type);\n\t\tblob.read(input.offset);\n\t}\n\n\tblob.read(m_input_decl.constants_count);\n\tfor (int i = 0; i < m_input_decl.constants_count; ++i)\n\t{\n\t\tauto& constant = m_input_decl.constants[i];\n\t\tblob.readString(constant.name, lengthOf(constant.name));\n\t\tblob.read(constant.type);\n\t\tswitch (constant.type)\n\t\t{\n\t\t\tcase InputDecl::BOOL: blob.read(constant.b_value); break;\n\t\t\tcase InputDecl::INT: blob.read(constant.i_value); break;\n\t\t\tcase InputDecl::FLOAT: blob.read(constant.f_value); break;\n\t\t\tdefault: ASSERT(false); return;\n\t\t}\n\t}\n\n\tm_anim_set.clear();\n\tint count;\n\tblob.read(count);\n\tauto* manager = m_resource_manager.getOwner().get(ANIMATION_TYPE);\n\tfor (int i = 0; i < count; ++i)\n\t{\n\t\tuint32 key;\n\t\tchar path[MAX_PATH_LENGTH];\n\t\tblob.read(key);\n\t\tblob.readString(path, lengthOf(path));\n\t\tAnimation* anim = path[0] ? (Animation*)manager->load(Path(path)) : nullptr;\n\t\tif(anim) addDependency(*anim);\n\t\tm_anim_set.insert(key, anim);\n\t}\n}\n\n\nvoid ControllerResource::serialize(OutputBlob& blob)\n{\n\tblob.write(m_root->type);\n\tm_root->serialize(blob);\n\tblob.write(m_input_decl.inputs_count);\n\tfor (int i = 0; i < m_input_decl.inputs_count; ++i)\n\t{\n\t\tauto& input = m_input_decl.inputs[i];\n\t\tblob.writeString(input.name);\n\t\tblob.write(input.type);\n\t\tblob.write(input.offset);\n\t}\n\tblob.write(m_input_decl.constants_count);\n\tfor (int i = 0; i < m_input_decl.constants_count; ++i)\n\t{\n\t\tauto& constant = m_input_decl.constants[i];\n\t\tblob.writeString(constant.name);\n\t\tblob.write(constant.type);\n\t\tswitch (constant.type)\n\t\t{\n\t\t\tcase InputDecl::BOOL: blob.write(constant.b_value); break;\n\t\t\tcase InputDecl::INT: blob.write(constant.i_value); break;\n\t\t\tcase InputDecl::FLOAT: blob.write(constant.f_value); break;\n\t\t\tdefault: ASSERT(false); return;\n\t\t}\n\t\t\n\t}\n\tblob.write(m_anim_set.size());\n\tfor (auto iter = m_anim_set.begin(), end = m_anim_set.end(); iter != end; ++iter)\n\t{\n\t\tblob.write(iter.key());\n\t\tblob.writeString(iter.value() ? iter.value()->getPath().c_str() : \"\");\n\t}\n}\n\n\nComponentInstance* ControllerResource::createInstance(IAllocator& allocator)\n{\n\treturn m_root ? m_root->createInstance(allocator) : nullptr;\n}\n\n\n\nResource* ControllerManager::createResource(const Path& path)\n{\n\treturn LUMIX_NEW(m_allocator, ControllerResource)(path, *this, m_allocator);\n}\n\n\nvoid ControllerManager::destroyResource(Resource& resource)\n{\n\tLUMIX_DELETE(m_allocator, (ControllerResource*)&resource);\n}\n\n\n\n} \/\/ namespace Anim\n\n\n} \/\/ namespace Lumix<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright © 2017 Arm Ltd and Contributors. All rights reserved.\n\/\/ SPDX-License-Identifier: MIT\n\/\/\n#define BOOST_TEST_MODULE UnitTests\n#include <boost\/test\/unit_test.hpp>\n\n#include \"UnitTests.hpp\"\n#include <armnn\/Logging.hpp>\n#include <armnn\/utility\/NumericCast.hpp>\n\nstruct ConfigureLoggingFixture\n{\n    ConfigureLoggingFixture()\n    {\n        ConfigureLoggingTest();\n    }\n};\n\nBOOST_GLOBAL_FIXTURE(ConfigureLoggingFixture);\n\n\/\/ On Windows, duplicate the boost test logging output to the Visual Studio output window using OutputDebugString.\n#if defined(_MSC_VER)\n\n#include <boost\/iostreams\/filtering_stream.hpp>\n#include <boost\/iostreams\/tee.hpp>\n#include <iostream>\n#include <common\/include\/WindowsWrapper.hpp>\n\nusing namespace boost::iostreams;\nusing namespace std;\n\nstruct DebugOutputSink : boost::iostreams::sink\n{\n    std::streamsize write(const char* s, std::streamsize n)\n    {\n        \/\/ The given string is not null-terminated, so we need to copy it.\n        std::string s2(s, armnn::numeric_cast<size_t>(n));\n        OutputDebugString(s2.c_str());\n        return n;\n    }\n};\n\nclass SetupDebugOutput\n{\npublic:\n    SetupDebugOutput()\n    {\n        \/\/ Sends the output to both cout (as standard) and the debug output.\n        m_OutputStream.push(tee(std::cout));\n        m_OutputStream.push(m_DebugOutputSink);\n\n        boost::unit_test::unit_test_log.set_stream(m_OutputStream);\n    }\nprivate:\n    filtering_ostream m_OutputStream;\n    DebugOutputSink m_DebugOutputSink;\n};\n\nBOOST_GLOBAL_FIXTURE(SetupDebugOutput);\n\n#endif \/\/ defined(_MSC_VER)\n\n\nBOOST_AUTO_TEST_SUITE(LoggerSuite)\n\nBOOST_AUTO_TEST_CASE(LoggerTest)\n{\n    std::stringstream ss;\n\n    {\n        struct StreamRedirector\n        {\n        public:\n            StreamRedirector(std::ostream& stream, std::streambuf* newStreamBuffer)\n                : m_Stream(stream)\n                , m_BackupBuffer(m_Stream.rdbuf(newStreamBuffer))\n            {}\n            ~StreamRedirector() { m_Stream.rdbuf(m_BackupBuffer); }\n\n        private:\n            std::ostream& m_Stream;\n            std::streambuf* m_BackupBuffer;\n        };\n\n\n        StreamRedirector redirect(std::cout, ss.rdbuf());\n\n        using namespace armnn;\n        SetLogFilter(LogSeverity::Trace);\n        SetAllLoggingSinks(true, false, false);\n\n\n        ARMNN_LOG(trace) << \"My trace message; \" << -2;\n        ARMNN_LOG(debug) << \"My debug message; \" << -1;\n        ARMNN_LOG(info) << \"My info message; \" << 0;\n        ARMNN_LOG(warning) << \"My warning message; \"  << 1;\n        ARMNN_LOG(error) << \"My error message; \" << 2;\n        ARMNN_LOG(fatal) << \"My fatal message; \"  << 3;\n\n        SetLogFilter(LogSeverity::Fatal);\n\n    }\n\n    BOOST_CHECK(ss.str().find(\"Trace: My trace message; -2\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Debug: My debug message; -1\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Info: My info message; 0\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Warning: My warning message; 1\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Error: My error message; 2\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Fatal: My fatal message; 3\") != std::string::npos);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>IVGCVSW-5964 As part of Boost removal this Windows only code is obsolete.<commit_after>\/\/\n\/\/ Copyright © 2017 Arm Ltd and Contributors. All rights reserved.\n\/\/ SPDX-License-Identifier: MIT\n\/\/\n#define BOOST_TEST_MODULE UnitTests\n#include <boost\/test\/unit_test.hpp>\n\n#include \"UnitTests.hpp\"\n#include <armnn\/Logging.hpp>\n#include <armnn\/utility\/NumericCast.hpp>\n\nstruct ConfigureLoggingFixture\n{\n    ConfigureLoggingFixture()\n    {\n        ConfigureLoggingTest();\n    }\n};\n\nBOOST_GLOBAL_FIXTURE(ConfigureLoggingFixture);\n\nBOOST_AUTO_TEST_SUITE(LoggerSuite)\n\nBOOST_AUTO_TEST_CASE(LoggerTest)\n{\n    std::stringstream ss;\n\n    {\n        struct StreamRedirector\n        {\n        public:\n            StreamRedirector(std::ostream& stream, std::streambuf* newStreamBuffer)\n                : m_Stream(stream)\n                , m_BackupBuffer(m_Stream.rdbuf(newStreamBuffer))\n            {}\n            ~StreamRedirector() { m_Stream.rdbuf(m_BackupBuffer); }\n\n        private:\n            std::ostream& m_Stream;\n            std::streambuf* m_BackupBuffer;\n        };\n\n\n        StreamRedirector redirect(std::cout, ss.rdbuf());\n\n        using namespace armnn;\n        SetLogFilter(LogSeverity::Trace);\n        SetAllLoggingSinks(true, false, false);\n\n\n        ARMNN_LOG(trace) << \"My trace message; \" << -2;\n        ARMNN_LOG(debug) << \"My debug message; \" << -1;\n        ARMNN_LOG(info) << \"My info message; \" << 0;\n        ARMNN_LOG(warning) << \"My warning message; \"  << 1;\n        ARMNN_LOG(error) << \"My error message; \" << 2;\n        ARMNN_LOG(fatal) << \"My fatal message; \"  << 3;\n\n        SetLogFilter(LogSeverity::Fatal);\n\n    }\n\n    BOOST_CHECK(ss.str().find(\"Trace: My trace message; -2\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Debug: My debug message; -1\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Info: My info message; 0\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Warning: My warning message; 1\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Error: My error message; 2\") != std::string::npos);\n    BOOST_CHECK(ss.str().find(\"Fatal: My fatal message; 3\") != std::string::npos);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\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) 2015 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\/Factory\/HardCodedModuleFactory.h>\n#include <Dataflow\/Engine\/Controller\/NetworkEditorController.h>\n#include <sstream>\n#include <map>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n\nusing boost::property_tree::ptree;\nusing boost::property_tree::read_json;\nusing boost::property_tree::write_json;\n\nusing namespace SCIRun;\nusing namespace Testing;\nusing namespace Modules::Factory;\nusing namespace Dataflow::Networks;\nusing namespace ReplacementImpl;\nusing namespace Dataflow::Engine;\nusing namespace Core::Algorithms;\n\n\nTEST(FactoryGeneratorTests, GenerateSomeJsonFromModuleProperties)\n{\n  HardCodedModuleFactory factory;\n\n  auto descMap = factory.getDirectModuleDescriptionLookupMap();\n\n  int i = 0;\n  for (const auto& mod : descMap)\n  {\n    ++i;\n    std::cout << mod.first << \" -> \" << mod.second << std::endl;\n\n    \/\/ Write json.\n    ptree pt;\n    pt.put(\"module.name\", mod.first.module_name_);\n    pt.put(\"module.namespace\", \"<ns>\");\n    pt.put(\"module.status\", mod.second.moduleStatus_);\n    pt.put(\"module.description\", mod.second.moduleInfo_);\n    std::ostringstream buf;\n    write_json(buf, pt, false);\n    std::string json = buf.str(); \/\/ {\"foo\":\"bar\"}\n    std::cout << json << std::endl;\n\n\n\n    if (i > 3)\n      break;\n  }\n\n\n  \/\/FAIL() << \"foo\";\n}\n\nTEST(FactoryGeneratorTests, ReadFullModuleJsonDescription)\n{\n  std::string moduleJson =\n    \"{\\n\"\n    \"\\t\\\"module\\\": {\\n\"\n    \"\\t\\t\\\"name\\\": \\\"CreateLatVol\\\",\\n\"\n    \"\\t\\t\\\"namespace\\\" : \\\"Fields\\\",\\n\"\n    \"\\t\\t\\\"status\\\" : \\\"Ported module\\\",\\n\"\n    \"\\t\\t\\\"description\\\" : \\\"Creates Lattice Volumes\\\",\\n\"\n    \"\\t\\t\\\"header\\\" : \\\"Modules\/Legacy\/Fields\/CreateLatVol.h\\\"\\n\"\n    \"\\t},\\n\"\n    \"\\t\\\"algorithm\\\": {\\n\"\n    \"\\t\\t\\\"name\\\": \\\"CreateLatVolAlgo\\\",\\n\"\n    \"\\t\\t\\\"namespace\\\" : \\\"Fields\\\",\\n\"\n    \"\\t\\t\\\"header\\\" : \\\"Core\/Algorithms\/Legacy\/Fields\/CreateLatVolAlgo.h\\\"\\n\"\n    \"\\t},\\n\"\n    \"\\t\\\"UI\\\" : {\\n\"\n    \"\\t\\t\\\"name\\\": \\\"CreateLatVolDialog\\\",\\n\"\n    \"\\t\\t\\\"header\\\" : \\\"Interface\/Modules\/Fields\/CreateLatVolDialog.h\\\"\\n\"\n    \"\\t}\\n\"\n    \"}\\n\";\n\n  std::cout << moduleJson << std::endl;\n\n\n  ptree modProps;\n  std::istringstream is(moduleJson);\n  read_json(is, modProps);\n\n  EXPECT_EQ(\"CreateLatVol\", modProps.get<std::string>(\"module.name\"));\n  EXPECT_EQ(\"Fields\", modProps.get<std::string>(\"module.namespace\"));\n  EXPECT_EQ(\"Ported module\", modProps.get<std::string>(\"module.status\"));\n  EXPECT_EQ(\"Creates Lattice Volumes\", modProps.get<std::string>(\"module.description\"));\n  EXPECT_EQ(\"Modules\/Legacy\/Fields\/CreateLatVol.h\", modProps.get<std::string>(\"module.header\"));\n\n  EXPECT_EQ(\"CreateLatVolAlgo\", modProps.get<std::string>(\"algorithm.name\"));\n  EXPECT_EQ(\"Fields\", modProps.get<std::string>(\"algorithm.namespace\"));\n  EXPECT_EQ(\"Core\/Algorithms\/Legacy\/Fields\/CreateLatVolAlgo.h\", modProps.get<std::string>(\"algorithm.header\"));\n\n  EXPECT_EQ(\"CreateLatVolDialog\", modProps.get<std::string>(\"UI.name\"));\n  EXPECT_EQ(\"Interface\/Modules\/Fields\/CreateLatVolDialog.h\", modProps.get<std::string>(\"UI.header\"));\n\n  EXPECT_THROW(modProps.get<std::string>(\"UI.namespace\"), std::exception);\n\n  \/\/FAIL() << \"json\";\n}\n<commit_msg>Steps<commit_after>\/*\n   For more information, please see: http:\/\/software.sci.utah.edu\n\n   The MIT License\n\n   Copyright (c) 2015 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\/Factory\/HardCodedModuleFactory.h>\n#include <Dataflow\/Engine\/Controller\/NetworkEditorController.h>\n#include <sstream>\n#include <map>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n\nusing boost::property_tree::ptree;\nusing boost::property_tree::read_json;\nusing boost::property_tree::write_json;\n\nusing namespace SCIRun;\nusing namespace Testing;\nusing namespace Modules::Factory;\nusing namespace Dataflow::Networks;\nusing namespace ReplacementImpl;\nusing namespace Dataflow::Engine;\nusing namespace Core::Algorithms;\n\n\nTEST(FactoryGeneratorTests, GenerateSomeJsonFromModuleProperties)\n{\n  HardCodedModuleFactory factory;\n\n  auto descMap = factory.getDirectModuleDescriptionLookupMap();\n\n  int i = 0;\n  for (const auto& mod : descMap)\n  {\n    ++i;\n    std::cout << mod.first << \" -> \" << mod.second << std::endl;\n\n    \/\/ Write json.\n    ptree pt;\n    pt.put(\"module.name\", mod.first.module_name_);\n    pt.put(\"module.namespace\", \"<ns>\");\n    pt.put(\"module.status\", mod.second.moduleStatus_);\n    pt.put(\"module.description\", mod.second.moduleInfo_);\n    std::ostringstream buf;\n    write_json(buf, pt, false);\n    std::string json = buf.str(); \/\/ {\"foo\":\"bar\"}\n    std::cout << json << std::endl;\n\n\n\n    if (i > 3)\n      break;\n  }\n\n\n  \/\/FAIL() << \"foo\";\n}\n\nTEST(FactoryGeneratorTests, ReadFullModuleJsonDescription)\n{\n  std::string moduleJson =\n    \"{\\n\"\n    \"\\t\\\"module\\\": {\\n\"\n    \"\\t\\t\\\"name\\\": \\\"CreateLatVol\\\",\\n\"\n    \"\\t\\t\\\"namespace\\\" : \\\"Fields\\\",\\n\"\n    \"\\t\\t\\\"status\\\" : \\\"Ported module\\\",\\n\"\n    \"\\t\\t\\\"description\\\" : \\\"Creates Lattice Volumes\\\",\\n\"\n    \"\\t\\t\\\"header\\\" : \\\"Modules\/Legacy\/Fields\/CreateLatVol.h\\\"\\n\"\n    \"\\t},\\n\"\n    \"\\t\\\"algorithm\\\": {\\n\"\n    \"\\t\\t\\\"name\\\": \\\"CreateLatVolAlgo\\\",\\n\"\n    \"\\t\\t\\\"namespace\\\" : \\\"Fields\\\",\\n\"\n    \"\\t\\t\\\"header\\\" : \\\"Core\/Algorithms\/Legacy\/Fields\/CreateLatVolAlgo.h\\\"\\n\"\n    \"\\t},\\n\"\n    \"\\t\\\"UI\\\" : {\\n\"\n    \"\\t\\t\\\"name\\\": \\\"CreateLatVolDialog\\\",\\n\"\n    \"\\t\\t\\\"header\\\" : \\\"Interface\/Modules\/Fields\/CreateLatVolDialog.h\\\"\\n\"\n    \"\\t}\\n\"\n    \"}\\n\";\n\n  std::cout << moduleJson << std::endl;\n\n\n  ptree modProps;\n  std::istringstream is(moduleJson);\n  read_json(is, modProps);\n\n  EXPECT_EQ(\"CreateLatVol\", modProps.get<std::string>(\"module.name\"));\n  EXPECT_EQ(\"Fields\", modProps.get<std::string>(\"module.namespace\"));\n  EXPECT_EQ(\"Ported module\", modProps.get<std::string>(\"module.status\"));\n  EXPECT_EQ(\"Creates Lattice Volumes\", modProps.get<std::string>(\"module.description\"));\n  EXPECT_EQ(\"Modules\/Legacy\/Fields\/CreateLatVol.h\", modProps.get<std::string>(\"module.header\"));\n\n  EXPECT_EQ(\"CreateLatVolAlgo\", modProps.get<std::string>(\"algorithm.name\"));\n  EXPECT_EQ(\"Fields\", modProps.get<std::string>(\"algorithm.namespace\"));\n  EXPECT_EQ(\"Core\/Algorithms\/Legacy\/Fields\/CreateLatVolAlgo.h\", modProps.get<std::string>(\"algorithm.header\"));\n\n  EXPECT_EQ(\"CreateLatVolDialog\", modProps.get<std::string>(\"UI.name\"));\n  EXPECT_EQ(\"Interface\/Modules\/Fields\/CreateLatVolDialog.h\", modProps.get<std::string>(\"UI.header\"));\n\n  EXPECT_THROW(modProps.get<std::string>(\"UI.namespace\"), std::exception);\n\n  \/\/FAIL() << \"json\";\n}\n\n\/*\nSteps:\n1. CMake flag for \"build module list\" is turned on\n2. CMake gets path to .module descriptor files, and passes it to C++ program\n3. C++ program receives path and iterates over all .module files\n4. For each json.module, call read code above and construct a map of structures (worry about lookup efficiency later)\n5. Loop over map of module desc structures and generate code lines\n6. Output of C++ code is ModuleFactory_Generated.cc file with one generated method, to be called by existing C++ factory impl\n7. Once that's working, extend to generate Algo and Dialog factory functions as well\n8. Then start converting old HardCodedModuleFactory lines to new way. Write some python code for this\n*\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n\n#include \"P23.MetaTrader4.Manager.ClrWrapper.h\"\n\nIList<P23::MetaTrader4::Manager::Contracts::BackupInfo^>^ P23::MetaTrader4::Manager::ClrWrapper::BackupInfoUsers(int mode)\n{\n\tint total = 0;\n\tBackupInfo* result = _manager->Manager->BackupInfoUsers(mode, &total);\n\tIList<P23::MetaTrader4::Manager::Contracts::BackupInfo^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::BackupInfo^>(total);\n\tfor (int i = 0; i < total; i++)\t\n\t\toutput->Add(Convert(&result[i]));\n\t\n\t_manager->Manager->MemFree(result);\n\n\treturn output;\n}\n\nIList<P23::MetaTrader4::Manager::Contracts::BackupInfo^>^  P23::MetaTrader4::Manager::ClrWrapper::BackupInfoOrders(int mode)\n{\n\tint total = 0;\n\tBackupInfo* result = _manager->Manager->BackupInfoOrders(mode, &total);\n\tIList<P23::MetaTrader4::Manager::Contracts::BackupInfo^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::BackupInfo^>(total);\n\tfor (int i = 0; i < total; i++)\n\t\toutput->Add(Convert(&result[i]));\n\n\t_manager->Manager->MemFree(result);\n\n\treturn output;\n}\n\nIList<P23::MetaTrader4::Manager::Contracts::UserRecord^>^  P23::MetaTrader4::Manager::ClrWrapper::BackupRequestUsers(String^ file, String^ request)\n{\n\tint total = 0;\n\t\n\tchar* f = Convert(file);\n\tchar* r = Convert(request);\n\tif (f == NULL || r == NULL)\n\t\tthrow gcnew ArgumentException(\"File and request mandatory parameters\");\n\t\n\tUserRecord* result = _manager->Manager->BackupRequestUsers(f, r, &total);\n\tIList<P23::MetaTrader4::Manager::Contracts::UserRecord^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::UserRecord^>(total);\n\tfor (int i = 0; i < total; i++)\n\t\toutput->Add(Convert(&result[i]));\n\n\t_manager->Manager->MemFree(result);\n\tMarshal::FreeHGlobal(IntPtr(f));\n\tMarshal::FreeHGlobal(IntPtr(r));\n\n\treturn output;\n}\n\nIList<P23::MetaTrader4::Manager::Contracts::TradeRecord^>^ P23::MetaTrader4::Manager::ClrWrapper::BackupRequestOrders(String^ file, String^ request)\n{\n\tint total = 0;\n\n\tchar* f = Convert(file);\n\tchar* r = Convert(request);\n\tif (f == NULL || r == NULL)\n\t\tthrow gcnew ArgumentException(\"File and request mandatory parameters\");\n\n\tTradeRecord* result = _manager->Manager->BackupRequestOrders(f, r, &total);\n\tIList<P23::MetaTrader4::Manager::Contracts::TradeRecord^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::TradeRecord^>(total);\n\tfor (int i = 0; i < total; i++)\n\t\toutput->Add(Convert(&result[i]));\n\n\t_manager->Manager->MemFree(result);\n\tMarshal::FreeHGlobal(IntPtr(f));\n\tMarshal::FreeHGlobal(IntPtr(r));\n\n\treturn output;\n}\n\nint P23::MetaTrader4::Manager::ClrWrapper::BackupRestoreUsers(IList<P23::MetaTrader4::Manager::Contracts::UserRecord^>^ users)\n{\n\tint total = 0;\n\n\tUserRecord* u = new UserRecord[users->Count];\n\tfor (int i = 0; i < users->Count; i++)\n\t\tu[i] = *Convert(users[i]);\n\n\tint result = _manager->Manager->BackupRestoreUsers(u, total);\n\t\n\tdelete[] u;\n\n\treturn result;\n}\n\nIList<P23::MetaTrader4::Manager::Contracts::TradeRestoreResult^>^ P23::MetaTrader4::Manager::ClrWrapper::BackupRestoreOrders(IList<P23::MetaTrader4::Manager::Contracts::TradeRecord^>^ trades)\n{\n\tint total = trades->Count;\n\n\tTradeRecord* t = new TradeRecord[total];\n\tfor (int i = 0; i < total; i++)\n\t\tt[i] = *Convert(trades[i]);\n\n\tTradeRestoreResult* result = _manager->Manager->BackupRestoreOrders(t, &total);\n\n\tIList<P23::MetaTrader4::Manager::Contracts::TradeRestoreResult^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::TradeRestoreResult^>(total);\n\tfor (int i = 0; i < total; i++)\n\t\toutput->Add(Convert(&result[i]));\n\n\t_manager->Manager->MemFree(result);\n\tdelete[] t;\n\n\treturn output;\n}<commit_msg>Fixed bug with BackupRestoreUsers<commit_after>#include \"stdafx.h\"\n\n#include \"P23.MetaTrader4.Manager.ClrWrapper.h\"\n\nIList<P23::MetaTrader4::Manager::Contracts::BackupInfo^>^ P23::MetaTrader4::Manager::ClrWrapper::BackupInfoUsers(int mode)\n{\n\tint total = 0;\n\tBackupInfo* result = _manager->Manager->BackupInfoUsers(mode, &total);\n\tIList<P23::MetaTrader4::Manager::Contracts::BackupInfo^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::BackupInfo^>(total);\n\tfor (int i = 0; i < total; i++)\t\n\t\toutput->Add(Convert(&result[i]));\n\t\n\t_manager->Manager->MemFree(result);\n\n\treturn output;\n}\n\nIList<P23::MetaTrader4::Manager::Contracts::BackupInfo^>^  P23::MetaTrader4::Manager::ClrWrapper::BackupInfoOrders(int mode)\n{\n\tint total = 0;\n\tBackupInfo* result = _manager->Manager->BackupInfoOrders(mode, &total);\n\tIList<P23::MetaTrader4::Manager::Contracts::BackupInfo^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::BackupInfo^>(total);\n\tfor (int i = 0; i < total; i++)\n\t\toutput->Add(Convert(&result[i]));\n\n\t_manager->Manager->MemFree(result);\n\n\treturn output;\n}\n\nIList<P23::MetaTrader4::Manager::Contracts::UserRecord^>^  P23::MetaTrader4::Manager::ClrWrapper::BackupRequestUsers(String^ file, String^ request)\n{\n\tint total = 0;\n\t\n\tchar* f = Convert(file);\n\tchar* r = Convert(request);\n\tif (f == NULL || r == NULL)\n\t\tthrow gcnew ArgumentException(\"File and request mandatory parameters\");\n\t\n\tUserRecord* result = _manager->Manager->BackupRequestUsers(f, r, &total);\n\tIList<P23::MetaTrader4::Manager::Contracts::UserRecord^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::UserRecord^>(total);\n\tfor (int i = 0; i < total; i++)\n\t\toutput->Add(Convert(&result[i]));\n\n\t_manager->Manager->MemFree(result);\n\tMarshal::FreeHGlobal(IntPtr(f));\n\tMarshal::FreeHGlobal(IntPtr(r));\n\n\treturn output;\n}\n\nIList<P23::MetaTrader4::Manager::Contracts::TradeRecord^>^ P23::MetaTrader4::Manager::ClrWrapper::BackupRequestOrders(String^ file, String^ request)\n{\n\tint total = 0;\n\n\tchar* f = Convert(file);\n\tchar* r = Convert(request);\n\tif (f == NULL || r == NULL)\n\t\tthrow gcnew ArgumentException(\"File and request mandatory parameters\");\n\n\tTradeRecord* result = _manager->Manager->BackupRequestOrders(f, r, &total);\n\tIList<P23::MetaTrader4::Manager::Contracts::TradeRecord^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::TradeRecord^>(total);\n\tfor (int i = 0; i < total; i++)\n\t\toutput->Add(Convert(&result[i]));\n\n\t_manager->Manager->MemFree(result);\n\tMarshal::FreeHGlobal(IntPtr(f));\n\tMarshal::FreeHGlobal(IntPtr(r));\n\n\treturn output;\n}\n\nint P23::MetaTrader4::Manager::ClrWrapper::BackupRestoreUsers(IList<P23::MetaTrader4::Manager::Contracts::UserRecord^>^ users)\n{\n\tint total = users->Count;\n\n\tUserRecord* u = new UserRecord[total];\n\tfor (int i = 0; i < total; i++)\n\t\tu[i] = *Convert(users[i]);\n\n\tint result = _manager->Manager->BackupRestoreUsers(u, total);\n\t\n\tdelete[] u;\n\n\treturn result;\n}\n\nIList<P23::MetaTrader4::Manager::Contracts::TradeRestoreResult^>^ P23::MetaTrader4::Manager::ClrWrapper::BackupRestoreOrders(IList<P23::MetaTrader4::Manager::Contracts::TradeRecord^>^ trades)\n{\n\tint total = trades->Count;\n\n\tTradeRecord* t = new TradeRecord[total];\n\tfor (int i = 0; i < total; i++)\n\t\tt[i] = *Convert(trades[i]);\n\n\tTradeRestoreResult* result = _manager->Manager->BackupRestoreOrders(t, &total);\n\n\tIList<P23::MetaTrader4::Manager::Contracts::TradeRestoreResult^>^ output = gcnew List<P23::MetaTrader4::Manager::Contracts::TradeRestoreResult^>(total);\n\tfor (int i = 0; i < total; i++)\n\t\toutput->Add(Convert(&result[i]));\n\n\t_manager->Manager->MemFree(result);\n\tdelete[] t;\n\n\treturn output;\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 JPetManager.cpp\n *\/\n\n#include \".\/JPetManager.h\"\n\n#include <cassert>\n#include <string>\n#include <exception>\n\n#include \"..\/JPetLoggerInclude.h\"\n#include \"..\/JPetCommonTools\/JPetCommonTools.h\"\n#include \"..\/DBHandler\/HeaderFiles\/DBHandler.h\"\n#include \"..\/JPetCmdParser\/JPetCmdParser.h\"\n#include \"..\/JPetOptionsGenerator\/JPetOptionsGenerator.h\"\n\n#include <TThread.h>\n\nusing namespace jpet_options_tools;\n\nJPetManager::JPetManager()\n{\n  fTaskGeneratorChain = new TaskGeneratorChain;\n}\n\nJPetManager& JPetManager::getManager()\n{\n  static JPetManager instance;\n  return instance;\n}\n\nbool JPetManager::areThreadsEnabled() const\n{\n  return fThreadsEnabled;\n}\n\nvoid JPetManager::setThreadsEnabled(bool enable)\n{\n  fThreadsEnabled = enable;\n}\n\nbool JPetManager::run(int argc, const char** argv)\n{\n  if (!parseCmdLine(argc, argv)) {\n    ERROR(\"While parsing command line arguments\");\n    return false;\n  }\n  INFO( \"======== Starting processing all tasks: \" + JPetCommonTools::getTimeString() + \" ========\\n\" );\n  std::vector<JPetTaskChainExecutor*> executors;\n  std::vector<TThread*> threads;\n  auto inputDataSeq = 0;\n  \/\/\/ For every input option, new TaskChainExecutor is created, which creates the chain of previously\n  \/\/\/ registered tasks. The inputDataSeq is the identifier of given chain.\n  for (auto opt : fOptions) {\n    JPetTaskChainExecutor* executor = new JPetTaskChainExecutor(fTaskGeneratorChain, inputDataSeq, opt.second);\n    executors.push_back(executor);\n    if (areThreadsEnabled()) {\n      auto thr = executor->run();\n      if (thr) {\n        threads.push_back(thr);\n      } else {\n        ERROR(\"thread pointer is null\");\n      }\n    } else {\n      if (!executor->process()) {\n        ERROR(\"While running process\");\n        return false;\n      }\n    }\n    inputDataSeq++;\n  }\n  if (areThreadsEnabled()) {\n    for (auto thread : threads) {\n      assert(thread);\n      thread->Join();\n    }\n  }\n  for (auto& executor : executors) {\n    if (executor) {\n      delete executor;\n      executor = 0;\n    }\n  }\n  INFO( \"======== Finished processing all tasks: \" + JPetCommonTools::getTimeString() + \" ========\\n\" );\n  return true;\n}\n\nbool JPetManager::parseCmdLine(int argc, const char** argv)\n{\n  try {\n    JPetOptionsGenerator optionsGenerator;\n    JPetCmdParser parser;\n    auto optionsFromCmdLine = parser.parseCmdLineArgs(argc, argv);\n    int numberOfRegisteredTasks = 1;\n    if (fTaskGeneratorChain) {\n      numberOfRegisteredTasks = fTaskGeneratorChain->size();\n    }\n    fOptions  = optionsGenerator.generateOptions(optionsFromCmdLine, numberOfRegisteredTasks);\n  } catch (std::exception& e) {\n    ERROR(e.what());\n    return false;\n  }\n  return true;\n}\n\nJPetManager::~JPetManager()\n{\n  \/\/\/ delete shared caches for paramBanks\n  \/\/\/ @todo I think that should be changed\n  JPetDBParamGetter::clearParamCache();\n}\n\nvoid JPetManager::registerTask(const TaskGenerator& taskGen)\n{\n  assert(fTaskGeneratorChain);\n  fTaskGeneratorChain->push_back(taskGen);\n}\n\nJPetManager::Options JPetManager::getOptions() const\n{\n  return fOptions;\n}\n\n\/**\n * @brief Initialize connection to database if such connection is necessary\n *\n * @param configFilePath path to the config file with database connection details\n *\n * @return true if database connection was required and initialization was called,\n * false if database connection was not required and its initialization was skipped\n *\n * Database connection is only initialized if the user provided the run number\n * (\"-i\" option) and did not provide local database (\"-l\") at the same time.\n *\/\nbool JPetManager::initDBConnection(const char* configFilePath)\n{\n  bool isDBrequired = false;\n\n  if (fOptions.size() > 0) { \/\/ If at least one input file to process.\n    auto optsVect = fOptions.begin()->second;\n    if (optsVect.size() > 0) {\n      auto opt = optsVect.front();\n      if (getRunNumber(opt) >= 0) { \/\/ if run number is not default -1\n        if (!isLocalDB(opt)) { \/\/ unless local DB file was provided\n          isDBrequired = true;\n        }\n      }\n    }\n  }\n  if (isDBrequired) {\n    INFO(\"Attempting to set up connection to the database.\");\n    DB::SERVICES::DBHandler::createDBConnection(configFilePath);\n  } else {\n    INFO(\"Setting connection to database skipped.\");\n  }\n  return isDBrequired;\n}\n<commit_msg>Add lambda to express adding scope module in JPetManager<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 JPetManager.cpp\n *\/\n\n#include \".\/JPetManager.h\"\n\n#include <cassert>\n#include <string>\n#include <exception>\n\n#include \"..\/JPetLoggerInclude.h\"\n#include \"..\/JPetCommonTools\/JPetCommonTools.h\"\n#include \"..\/DBHandler\/HeaderFiles\/DBHandler.h\"\n#include \"..\/JPetCmdParser\/JPetCmdParser.h\"\n#include \"..\/JPetScopeLoader\/JPetScopeLoader.h\"\n#include \"..\/JPetOptionsGenerator\/JPetOptionsGenerator.h\"\n\n#include <TThread.h>\n\nusing namespace jpet_options_tools;\n\nJPetManager::JPetManager()\n{\n  fTaskGeneratorChain = new TaskGeneratorChain;\n}\n\nJPetManager& JPetManager::getManager()\n{\n  static JPetManager instance;\n  return instance;\n}\n\nbool JPetManager::areThreadsEnabled() const\n{\n  return fThreadsEnabled;\n}\n\nvoid JPetManager::setThreadsEnabled(bool enable)\n{\n  fThreadsEnabled = enable;\n}\n\nbool JPetManager::run(int argc, const char** argv)\n{\n  if (!parseCmdLine(argc, argv)) {\n    ERROR(\"While parsing command line arguments\");\n    return false;\n  }\n  INFO( \"======== Starting processing all tasks: \" + JPetCommonTools::getTimeString() + \" ========\\n\" );\n  std::vector<JPetTaskChainExecutor*> executors;\n  std::vector<TThread*> threads;\n  auto inputDataSeq = 0;\n  \/\/\/ For every input option, new TaskChainExecutor is created, which creates the chain of previously\n  \/\/\/ registered tasks. The inputDataSeq is the identifier of given chain.\n  for (auto opt : fOptions) {\n    JPetTaskChainExecutor* executor = new JPetTaskChainExecutor(fTaskGeneratorChain, inputDataSeq, opt.second);\n    executors.push_back(executor);\n    if (areThreadsEnabled()) {\n      auto thr = executor->run();\n      if (thr) {\n        threads.push_back(thr);\n      } else {\n        ERROR(\"thread pointer is null\");\n      }\n    } else {\n      if (!executor->process()) {\n        ERROR(\"While running process\");\n        return false;\n      }\n    }\n    inputDataSeq++;\n  }\n  if (areThreadsEnabled()) {\n    for (auto thread : threads) {\n      assert(thread);\n      thread->Join();\n    }\n  }\n  for (auto& executor : executors) {\n    if (executor) {\n      delete executor;\n      executor = 0;\n    }\n  }\n  INFO( \"======== Finished processing all tasks: \" + JPetCommonTools::getTimeString() + \" ========\\n\" );\n  return true;\n}\n\nbool JPetManager::parseCmdLine(int argc, const char** argv)\n{\n  auto addDefaultTasksFromOptions = [&](const boost::program_options::variables_map & optionsFromCmdLine) {\n    auto it = optionsFromCmdLine.find(\"type\");\n    if (it != optionsFromCmdLine.end()) {\n      if (boost::any_cast<std::string>(it->second.value()) == \"scope\") {\n        auto task = []() {\n          return new JPetScopeLoader(std::unique_ptr<JPetScopeTask>(new JPetScopeTask(\"JPetScopeReader\")));\n        };\n        fTaskGeneratorChain->push_back(task);\n      }\n    }\n  };\n\n  try {\n    JPetOptionsGenerator optionsGenerator;\n    JPetCmdParser parser;\n    auto optionsFromCmdLine = parser.parseCmdLineArgs(argc, argv);\n    addDefaultTasksFromOptions(optionsFromCmdLine); \/\/\/ Currently only scope task can be added.\n    int numberOfRegisteredTasks = 1;\n    if (fTaskGeneratorChain) {\n      numberOfRegisteredTasks = fTaskGeneratorChain->size();\n    }\n    fOptions  = optionsGenerator.generateOptions(optionsFromCmdLine, numberOfRegisteredTasks);\n  } catch (std::exception& e) {\n    ERROR(e.what());\n    return false;\n  }\n  return true;\n}\n\n\/\/\nJPetManager::~JPetManager()\n{\n  \/\/\/ delete shared caches for paramBanks\n  \/\/\/ @todo I think that should be changed\n  JPetDBParamGetter::clearParamCache();\n}\n\nvoid JPetManager::registerTask(const TaskGenerator& taskGen)\n{\n  assert(fTaskGeneratorChain);\n  fTaskGeneratorChain->push_back(taskGen);\n}\n\nJPetManager::Options JPetManager::getOptions() const\n{\n  return fOptions;\n}\n\n\/**\n * @brief Initialize connection to database if such connection is necessary\n *\n * @param configFilePath path to the config file with database connection details\n *\n * @return true if database connection was required and initialization was called,\n * false if database connection was not required and its initialization was skipped\n *\n * Database connection is only initialized if the user provided the run number\n * (\"-i\" option) and did not provide local database (\"-l\") at the same time.\n *\/\nbool JPetManager::initDBConnection(const char* configFilePath)\n{\n  bool isDBrequired = false;\n\n  if (fOptions.size() > 0) { \/\/ If at least one input file to process.\n    auto optsVect = fOptions.begin()->second;\n    if (optsVect.size() > 0) {\n      auto opt = optsVect.front();\n      if (getRunNumber(opt) >= 0) { \/\/ if run number is not default -1\n        if (!isLocalDB(opt)) { \/\/ unless local DB file was provided\n          isDBrequired = true;\n        }\n      }\n    }\n  }\n  if (isDBrequired) {\n    INFO(\"Attempting to set up connection to the database.\");\n    DB::SERVICES::DBHandler::createDBConnection(configFilePath);\n  } else {\n    INFO(\"Setting connection to database skipped.\");\n  }\n  return isDBrequired;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Yojimbo Client\/Server Network Library.\n    \n    Copyright © 2016, The Network Protocol Company, Inc.\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        1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\n        2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer \n           in the documentation and\/or other materials provided with the distribution.\n\n        3. Neither the name of the copyright holder nor the names 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\" 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\n    USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include \"yojimbo_network.h\"\n\n#if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n    #define NOMINMAX\n    #define _WINSOCK_DEPRECATED_NO_WARNINGS\n    #include <winsock2.h>\n    #include <ws2tcpip.h>\n    #include <ws2ipdef.h>\n    #pragma comment( lib, \"WS2_32.lib\" )\n\n    #ifdef SetPort\n    #undef SetPort\n    #endif \/\/ #ifdef SetPort\n\n    #if YOJIMBO_SOCKETS\n    #include <iphlpapi.h>\n    #pragma comment( lib, \"IPHLPAPI.lib\" )\n    #endif \/\/ #if YOJIMBO_SOCKETS\n\n#elif YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_MAC || YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_UNIX\n\n    #include <netdb.h>\n    #include <sys\/types.h>\n    #include <sys\/socket.h>\n    #include <netinet\/in.h>\n    #include <ifaddrs.h>\n    #include <net\/if.h>\n    #include <fcntl.h>\n    #include <netdb.h>\n    #include <arpa\/inet.h>\n    #include <unistd.h>\n    #include <errno.h>\n    \n#endif\n\n#include <memory.h>\n#include <string.h>\n\nnamespace yojimbo\n{\n    static bool s_networkInitialized = false;\n\n    bool InitializeNetwork()     \n    {         \n        assert( !s_networkInitialized );\n\n#if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n        WSADATA WsaData;         \n        const bool result = WSAStartup( MAKEWORD(2,2), &WsaData ) == NO_ERROR;\n#else \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n        const bool result = true;\n#endif \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n        if ( result )\n            s_networkInitialized = result;   \n\n        return result;\n    }\n\n    void ShutdownNetwork()\n    {\n        assert( s_networkInitialized );\n\n#if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n        WSACleanup();\n#endif \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n        s_networkInitialized = false;\n    }\n\n    bool IsNetworkInitialized()\n    {\n        return s_networkInitialized;\n    }\n\n#if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n    #define WORKING_BUFFER_SIZE 15000\n    #define MAX_TRIES 3\n\n    void GetNetworkAddresses( Address * addresses, int & numAddresses, int maxAddresses )\n    {\n        assert( addresses );\n        assert( maxAddresses >= 0 );\n\n        numAddresses = 0;\n\n        DWORD dwRetVal = 0;\n\n        ULONG flags = GAA_FLAG_SKIP_ANYCAST | GAA_FLAG_SKIP_MULTICAST | GAA_FLAG_SKIP_DNS_SERVER | GAA_FLAG_SKIP_FRIENDLY_NAME;\n\n        ULONG family = AF_UNSPEC;\n\n        PIP_ADAPTER_ADDRESSES pAddresses = NULL;\n        ULONG outBufLen = 0;\n        ULONG Iterations = 0;\n\n        PIP_ADAPTER_ADDRESSES pCurrAddresses = NULL;\n        PIP_ADAPTER_UNICAST_ADDRESS pUnicast = NULL;\n\n        outBufLen = WORKING_BUFFER_SIZE;\n\n        do\n        {\n            pAddresses = (IP_ADAPTER_ADDRESSES*) malloc( outBufLen );\n            if ( pAddresses == NULL ) \n                return;\n\n            dwRetVal = GetAdaptersAddresses( family, flags, NULL, pAddresses, &outBufLen );\n\n            if ( dwRetVal == ERROR_BUFFER_OVERFLOW ) \n            {\n                free( pAddresses );\n                pAddresses = NULL;\n            } \n            else \n            {\n                break;\n            }\n\n            Iterations++;\n\n        } while ( ( dwRetVal == ERROR_BUFFER_OVERFLOW ) && ( Iterations < MAX_TRIES ) );\n\n        if ( dwRetVal == NO_ERROR )\n        {\n            pCurrAddresses = pAddresses;\n\n            while ( pCurrAddresses && numAddresses < maxAddresses )\n            {\n                if ( pCurrAddresses->OperStatus != IfOperStatusUp )\n                    goto next;\n\n                pUnicast = pCurrAddresses->FirstUnicastAddress;\n                if (pUnicast != NULL) \n                {\n                    for ( int i = 0; pUnicast != NULL; i++ )\n                    {\n                        Address address( (sockaddr_storage*) pUnicast->Address.lpSockaddr );\n\n                        if ( !address.IsValid() )\n                            goto next_unicast;\n\n                        if ( address.IsLoopback() )\n                            goto next_unicast;\n\n                        if ( address.GetType() == ADDRESS_IPV6 && !address.IsGlobalUnicast() )\n                            goto next_unicast;\n\n                        addresses[numAddresses++] = address;\n\n                        if ( numAddresses >= maxAddresses )\n                            break;\n\n                    next_unicast:\n\n                        pUnicast = pUnicast->Next;\n                    }\n                } \n\n            next:\n\n                pCurrAddresses = pCurrAddresses->Next;\n            }\n        }\n\n        if ( pAddresses)\n        {\n            free( pAddresses );\n        }\n    }\n\n    Address GetFirstNetworkAddress_IPV4()\n    {\n        DWORD dwRetVal = 0;\n\n        ULONG flags = GAA_FLAG_SKIP_ANYCAST | GAA_FLAG_SKIP_MULTICAST | GAA_FLAG_SKIP_DNS_SERVER | GAA_FLAG_SKIP_FRIENDLY_NAME;\n\n        ULONG family = AF_INET;\n\n        PIP_ADAPTER_ADDRESSES pAddresses = NULL;\n        ULONG outBufLen = 0;\n        ULONG Iterations = 0;\n\n        PIP_ADAPTER_ADDRESSES pCurrAddresses = NULL;\n        PIP_ADAPTER_UNICAST_ADDRESS pUnicast = NULL;\n\n        outBufLen = WORKING_BUFFER_SIZE;\n\n        do\n        {\n            pAddresses = (IP_ADAPTER_ADDRESSES*) malloc( outBufLen );\n            if ( pAddresses == NULL ) \n                return Address();\n\n            dwRetVal = GetAdaptersAddresses( family, flags, NULL, pAddresses, &outBufLen );\n\n            if ( dwRetVal == ERROR_BUFFER_OVERFLOW ) \n            {\n                free( pAddresses );\n                pAddresses = NULL;\n            } \n            else \n            {\n                break;\n            }\n\n            Iterations++;\n\n        } while ( ( dwRetVal == ERROR_BUFFER_OVERFLOW ) && ( Iterations < MAX_TRIES ) );\n\n        if ( dwRetVal == NO_ERROR )\n        {\n            pCurrAddresses = pAddresses;\n\n            while ( pCurrAddresses )\n            {\n                if ( pCurrAddresses->OperStatus != IfOperStatusUp )\n                    goto next;\n\n                pUnicast = pCurrAddresses->FirstUnicastAddress;\n                if (pUnicast != NULL) \n                {\n                    for ( int i = 0; pUnicast != NULL; i++ )\n                    {\n                        Address address( (sockaddr_storage*) pUnicast->Address.lpSockaddr );\n\n                        if ( !address.IsValid() )\n                            goto next_unicast;\n\n                        if ( address.IsLoopback() )\n                            goto next_unicast;\n\n                        if ( pAddresses )\n                            free( pAddresses );\n\n                        return address;\n\n                    next_unicast:\n\n                        pUnicast = pUnicast->Next;\n                    }\n                } \n\n            next:\n\n                pCurrAddresses = pCurrAddresses->Next;\n            }\n        }\n\n        if ( pAddresses)\n        {\n            free( pAddresses );\n        }\n\n        return Address();\n    }\n\n    Address GetFirstNetworkAddress_IPV6()\n    {\n        DWORD dwRetVal = 0;\n\n        ULONG flags = GAA_FLAG_SKIP_ANYCAST | GAA_FLAG_SKIP_MULTICAST | GAA_FLAG_SKIP_DNS_SERVER | GAA_FLAG_SKIP_FRIENDLY_NAME;\n\n        ULONG family = AF_INET6;\n\n        PIP_ADAPTER_ADDRESSES pAddresses = NULL;\n        ULONG outBufLen = 0;\n        ULONG Iterations = 0;\n\n        PIP_ADAPTER_ADDRESSES pCurrAddresses = NULL;\n        PIP_ADAPTER_UNICAST_ADDRESS pUnicast = NULL;\n\n        outBufLen = WORKING_BUFFER_SIZE;\n\n        do\n        {\n            pAddresses = (IP_ADAPTER_ADDRESSES*) malloc( outBufLen );\n            if ( pAddresses == NULL ) \n                return Address();\n\n            dwRetVal = GetAdaptersAddresses( family, flags, NULL, pAddresses, &outBufLen );\n\n            if ( dwRetVal == ERROR_BUFFER_OVERFLOW ) \n            {\n                free( pAddresses );\n                pAddresses = NULL;\n            } \n            else \n            {\n                break;\n            }\n\n            Iterations++;\n\n        } while ( ( dwRetVal == ERROR_BUFFER_OVERFLOW ) && ( Iterations < MAX_TRIES ) );\n\n        if ( dwRetVal == NO_ERROR )\n        {\n            pCurrAddresses = pAddresses;\n\n            while ( pCurrAddresses )\n            {\n                if ( pCurrAddresses->OperStatus != IfOperStatusUp )\n                    goto next;\n\n                pUnicast = pCurrAddresses->FirstUnicastAddress;\n                if (pUnicast != NULL) \n                {\n                    for ( int i = 0; pUnicast != NULL; i++ )\n                    {\n                        Address address( (sockaddr_storage*) pUnicast->Address.lpSockaddr );\n\n                        if ( !address.IsValid() )\n                            goto next_unicast;\n\n                        if ( address.IsLoopback() )\n                            goto next_unicast;\n\n                        if ( !address.IsGlobalUnicast() )\n                            goto next_unicast;\n\n                        if ( pAddresses )\n                            free( pAddresses );\n\n                        return address;\n\n                    next_unicast:\n\n                        pUnicast = pUnicast->Next;\n                    }\n                } \n\n            next:\n\n                pCurrAddresses = pCurrAddresses->Next;\n            }\n        }\n\n        if ( pAddresses)\n        {\n            free( pAddresses );\n        }\n\n        return Address();\n    }\n\n#elif YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_MAC || YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_UNIX \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n    void GetNetworkAddresses( Address * addresses, int & numAddresses, int maxAddresses )\n    {\n        assert( addresses );\n        assert( maxAddresses >= 0 );\n\n        struct ifaddrs *ifaddr, *ifa;\n\n        numAddresses = 0;\n\n        if ( getifaddrs( &ifaddr ) == -1 )\n            return;\n\n        for ( ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next )\n        {\n            if ( numAddresses >= maxAddresses )\n                break;\n\n            if ( ifa->ifa_addr == NULL || ( ifa->ifa_addr->sa_family != AF_INET && ifa->ifa_addr->sa_family != AF_INET6 ) ) \n                continue;\n\n            if ( ( ifa->ifa_flags & IFF_RUNNING ) == 0 )\n                continue;\n\n            Address address( (sockaddr_storage*) ifa->ifa_addr );\n            \n            if ( !address.IsValid() )\n                continue;\n\n            if ( address.IsLoopback() )\n                continue;\n\n            if ( address.GetType() == ADDRESS_IPV6 && !address.IsGlobalUnicast() )\n                continue;\n\n            addresses[numAddresses++] = address;\n        }\n\n        freeifaddrs( ifaddr );\n    }\n\n    Address GetFirstNetworkAddress_IPV4()\n    {\n        struct ifaddrs *ifaddr, *ifa;\n\n        if ( getifaddrs( &ifaddr ) == -1 )\n            return Address();\n\n        for ( ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next )\n        {\n            if ( ifa->ifa_addr == NULL || ifa->ifa_addr->sa_family != AF_INET ) \n                continue;\n\n            if ( ( ifa->ifa_flags & IFF_RUNNING ) == 0 )\n                continue;\n\n            Address address( (sockaddr_storage*) ifa->ifa_addr );\n\n            if ( !address.IsValid() )\n                continue;\n\n            if ( address.IsLoopback() )\n                continue;\n\n            assert( address.GetType() == ADDRESS_IPV4 );\n\n            freeifaddrs( ifaddr );\n\n            return address;\n        }\n\n        freeifaddrs( ifaddr );\n\n        return Address();\n    }\n\n    Address GetFirstNetworkAddress_IPV6()\n    {\n        struct ifaddrs *ifaddr, *ifa;\n\n        if ( getifaddrs( &ifaddr ) == -1 )\n            return Address();\n\n        for ( ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next )\n        {\n            if ( ifa->ifa_addr == NULL || ifa->ifa_addr->sa_family != AF_INET6 ) \n                continue;\n\n            if ( ( ifa->ifa_flags & IFF_RUNNING ) == 0 )\n                continue;\n\n            Address address( (sockaddr_storage*) ifa->ifa_addr );\n\n            if ( !address.IsValid() )\n                continue;\n\n            if ( address.IsLoopback() )\n                continue;\n\n            assert( address.GetType() == ADDRESS_IPV6 );\n\n            if ( !address.IsGlobalUnicast() )\n                continue;\n\n            freeifaddrs( ifaddr );\n\n            return address;\n        }\n\n        freeifaddrs( ifaddr );\n\n        return Address();\n    }\n\n#else \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n    void GetNetworkAddresses( Address * \/*addresses*\/, int & numAddresses, int \/*maxAddresses*\/ )\n    {\n        numAddresses = 0;\n    }\n\n    Address GetFirstNetworkAddress_IPV4()\n    {\n        return Address();\n    }\n\n    Address GetFirstNetworkAddress_IPV6()\n    {\n        return Address();\n    }\n\n#endif \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n}\n<commit_msg>tabs to spaces<commit_after>\/*\n    Yojimbo Client\/Server Network Library.\n    \n    Copyright © 2016, The Network Protocol Company, Inc.\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        1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\n        2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer \n           in the documentation and\/or other materials provided with the distribution.\n\n        3. Neither the name of the copyright holder nor the names 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\" 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\n    USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include \"yojimbo_network.h\"\n\n#if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n    #define NOMINMAX\n    #define _WINSOCK_DEPRECATED_NO_WARNINGS\n    #include <winsock2.h>\n    #include <ws2tcpip.h>\n    #include <ws2ipdef.h>\n    #pragma comment( lib, \"WS2_32.lib\" )\n\n    #ifdef SetPort\n    #undef SetPort\n    #endif \/\/ #ifdef SetPort\n\n    #if YOJIMBO_SOCKETS\n    #include <iphlpapi.h>\n    #pragma comment( lib, \"IPHLPAPI.lib\" )\n    #endif \/\/ #if YOJIMBO_SOCKETS\n\n#elif YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_MAC || YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_UNIX\n\n    #include <netdb.h>\n    #include <sys\/types.h>\n    #include <sys\/socket.h>\n    #include <netinet\/in.h>\n    #include <ifaddrs.h>\n    #include <net\/if.h>\n    #include <fcntl.h>\n    #include <netdb.h>\n    #include <arpa\/inet.h>\n    #include <unistd.h>\n    #include <errno.h>\n    \n#endif\n\n#include <memory.h>\n#include <string.h>\n\nnamespace yojimbo\n{\n    static bool s_networkInitialized = false;\n\n    bool InitializeNetwork()     \n    {         \n        assert( !s_networkInitialized );\n\n#if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n        WSADATA WsaData;         \n        const bool result = WSAStartup( MAKEWORD(2,2), &WsaData ) == NO_ERROR;\n#else \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n        const bool result = true;\n#endif \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n        if ( result )\n            s_networkInitialized = result;   \n\n        return result;\n    }\n\n    void ShutdownNetwork()\n    {\n        assert( s_networkInitialized );\n\n#if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n        WSACleanup();\n#endif \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n        s_networkInitialized = false;\n    }\n\n    bool IsNetworkInitialized()\n    {\n        return s_networkInitialized;\n    }\n\n#if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n    #define WORKING_BUFFER_SIZE 15000\n    #define MAX_TRIES 3\n\n    void GetNetworkAddresses( Address * addresses, int & numAddresses, int maxAddresses )\n    {\n        assert( addresses );\n        assert( maxAddresses >= 0 );\n\n        numAddresses = 0;\n\n        DWORD dwRetVal = 0;\n\n        ULONG flags = GAA_FLAG_SKIP_ANYCAST | GAA_FLAG_SKIP_MULTICAST | GAA_FLAG_SKIP_DNS_SERVER | GAA_FLAG_SKIP_FRIENDLY_NAME;\n\n        ULONG family = AF_UNSPEC;\n\n        PIP_ADAPTER_ADDRESSES pAddresses = NULL;\n        ULONG outBufLen = 0;\n        ULONG Iterations = 0;\n\n        PIP_ADAPTER_ADDRESSES pCurrAddresses = NULL;\n        PIP_ADAPTER_UNICAST_ADDRESS pUnicast = NULL;\n\n        outBufLen = WORKING_BUFFER_SIZE;\n\n        do\n        {\n            pAddresses = (IP_ADAPTER_ADDRESSES*) malloc( outBufLen );\n            if ( pAddresses == NULL ) \n                return;\n\n            dwRetVal = GetAdaptersAddresses( family, flags, NULL, pAddresses, &outBufLen );\n\n            if ( dwRetVal == ERROR_BUFFER_OVERFLOW ) \n            {\n                free( pAddresses );\n                pAddresses = NULL;\n            } \n            else \n            {\n                break;\n            }\n\n            Iterations++;\n\n        } while ( ( dwRetVal == ERROR_BUFFER_OVERFLOW ) && ( Iterations < MAX_TRIES ) );\n\n        if ( dwRetVal == NO_ERROR )\n        {\n            pCurrAddresses = pAddresses;\n\n            while ( pCurrAddresses && numAddresses < maxAddresses )\n            {\n                if ( pCurrAddresses->OperStatus != IfOperStatusUp )\n                    goto next;\n\n                pUnicast = pCurrAddresses->FirstUnicastAddress;\n                if (pUnicast != NULL) \n                {\n                    for ( int i = 0; pUnicast != NULL; i++ )\n                    {\n                        Address address( (sockaddr_storage*) pUnicast->Address.lpSockaddr );\n\n                        if ( !address.IsValid() )\n                            goto next_unicast;\n\n                        if ( address.IsLoopback() )\n                            goto next_unicast;\n\n                        if ( address.GetType() == ADDRESS_IPV6 && !address.IsGlobalUnicast() )\n                            goto next_unicast;\n\n                        addresses[numAddresses++] = address;\n\n                        if ( numAddresses >= maxAddresses )\n                            break;\n\n                    next_unicast:\n\n                        pUnicast = pUnicast->Next;\n                    }\n                } \n\n            next:\n\n                pCurrAddresses = pCurrAddresses->Next;\n            }\n        }\n\n        if ( pAddresses)\n        {\n            free( pAddresses );\n        }\n    }\n\n    Address GetFirstNetworkAddress_IPV4()\n    {\n        DWORD dwRetVal = 0;\n\n        ULONG flags = GAA_FLAG_SKIP_ANYCAST | GAA_FLAG_SKIP_MULTICAST | GAA_FLAG_SKIP_DNS_SERVER | GAA_FLAG_SKIP_FRIENDLY_NAME;\n\n        ULONG family = AF_INET;\n\n        PIP_ADAPTER_ADDRESSES pAddresses = NULL;\n        ULONG outBufLen = 0;\n        ULONG Iterations = 0;\n\n        PIP_ADAPTER_ADDRESSES pCurrAddresses = NULL;\n        PIP_ADAPTER_UNICAST_ADDRESS pUnicast = NULL;\n\n        outBufLen = WORKING_BUFFER_SIZE;\n\n        do\n        {\n            pAddresses = (IP_ADAPTER_ADDRESSES*) malloc( outBufLen );\n            if ( pAddresses == NULL ) \n                return Address();\n\n            dwRetVal = GetAdaptersAddresses( family, flags, NULL, pAddresses, &outBufLen );\n\n            if ( dwRetVal == ERROR_BUFFER_OVERFLOW ) \n            {\n                free( pAddresses );\n                pAddresses = NULL;\n            } \n            else \n            {\n                break;\n            }\n\n            Iterations++;\n\n        } while ( ( dwRetVal == ERROR_BUFFER_OVERFLOW ) && ( Iterations < MAX_TRIES ) );\n\n        if ( dwRetVal == NO_ERROR )\n        {\n            pCurrAddresses = pAddresses;\n\n            while ( pCurrAddresses )\n            {\n                if ( pCurrAddresses->OperStatus != IfOperStatusUp )\n                    goto next;\n\n                pUnicast = pCurrAddresses->FirstUnicastAddress;\n                \n                if ( pUnicast != NULL ) \n                {\n                    for ( int i = 0; pUnicast != NULL; i++ )\n                    {\n                        Address address( (sockaddr_storage*) pUnicast->Address.lpSockaddr );\n\n                        if ( !address.IsValid() )\n                            goto next_unicast;\n\n                        if ( address.IsLoopback() )\n                            goto next_unicast;\n\n                        if ( pAddresses )\n                            free( pAddresses );\n\n                        return address;\n\n                    next_unicast:\n\n                        pUnicast = pUnicast->Next;\n                    }\n                } \n\n            next:\n\n                pCurrAddresses = pCurrAddresses->Next;\n            }\n        }\n\n        if ( pAddresses)\n        {\n            free( pAddresses );\n        }\n\n        return Address();\n    }\n\n    Address GetFirstNetworkAddress_IPV6()\n    {\n        DWORD dwRetVal = 0;\n\n        ULONG flags = GAA_FLAG_SKIP_ANYCAST | GAA_FLAG_SKIP_MULTICAST | GAA_FLAG_SKIP_DNS_SERVER | GAA_FLAG_SKIP_FRIENDLY_NAME;\n\n        ULONG family = AF_INET6;\n\n        PIP_ADAPTER_ADDRESSES pAddresses = NULL;\n        ULONG outBufLen = 0;\n        ULONG Iterations = 0;\n\n        PIP_ADAPTER_ADDRESSES pCurrAddresses = NULL;\n        PIP_ADAPTER_UNICAST_ADDRESS pUnicast = NULL;\n\n        outBufLen = WORKING_BUFFER_SIZE;\n\n        do\n        {\n            pAddresses = (IP_ADAPTER_ADDRESSES*) malloc( outBufLen );\n            if ( pAddresses == NULL ) \n                return Address();\n\n            dwRetVal = GetAdaptersAddresses( family, flags, NULL, pAddresses, &outBufLen );\n\n            if ( dwRetVal == ERROR_BUFFER_OVERFLOW ) \n            {\n                free( pAddresses );\n                pAddresses = NULL;\n            } \n            else \n            {\n                break;\n            }\n\n            Iterations++;\n\n        } while ( ( dwRetVal == ERROR_BUFFER_OVERFLOW ) && ( Iterations < MAX_TRIES ) );\n\n        if ( dwRetVal == NO_ERROR )\n        {\n            pCurrAddresses = pAddresses;\n\n            while ( pCurrAddresses )\n            {\n                if ( pCurrAddresses->OperStatus != IfOperStatusUp )\n                    goto next;\n\n                pUnicast = pCurrAddresses->FirstUnicastAddress;\n                if (pUnicast != NULL) \n                {\n                    for ( int i = 0; pUnicast != NULL; i++ )\n                    {\n                        Address address( (sockaddr_storage*) pUnicast->Address.lpSockaddr );\n\n                        if ( !address.IsValid() )\n                            goto next_unicast;\n\n                        if ( address.IsLoopback() )\n                            goto next_unicast;\n\n                        if ( !address.IsGlobalUnicast() )\n                            goto next_unicast;\n\n                        if ( pAddresses )\n                            free( pAddresses );\n\n                        return address;\n\n                    next_unicast:\n\n                        pUnicast = pUnicast->Next;\n                    }\n                } \n\n            next:\n\n                pCurrAddresses = pCurrAddresses->Next;\n            }\n        }\n\n        if ( pAddresses)\n        {\n            free( pAddresses );\n        }\n\n        return Address();\n    }\n\n#elif YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_MAC || YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_UNIX \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n    void GetNetworkAddresses( Address * addresses, int & numAddresses, int maxAddresses )\n    {\n        assert( addresses );\n        assert( maxAddresses >= 0 );\n\n        struct ifaddrs *ifaddr, *ifa;\n\n        numAddresses = 0;\n\n        if ( getifaddrs( &ifaddr ) == -1 )\n            return;\n\n        for ( ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next )\n        {\n            if ( numAddresses >= maxAddresses )\n                break;\n\n            if ( ifa->ifa_addr == NULL || ( ifa->ifa_addr->sa_family != AF_INET && ifa->ifa_addr->sa_family != AF_INET6 ) ) \n                continue;\n\n            if ( ( ifa->ifa_flags & IFF_RUNNING ) == 0 )\n                continue;\n\n            Address address( (sockaddr_storage*) ifa->ifa_addr );\n            \n            if ( !address.IsValid() )\n                continue;\n\n            if ( address.IsLoopback() )\n                continue;\n\n            if ( address.GetType() == ADDRESS_IPV6 && !address.IsGlobalUnicast() )\n                continue;\n\n            addresses[numAddresses++] = address;\n        }\n\n        freeifaddrs( ifaddr );\n    }\n\n    Address GetFirstNetworkAddress_IPV4()\n    {\n        struct ifaddrs *ifaddr, *ifa;\n\n        if ( getifaddrs( &ifaddr ) == -1 )\n            return Address();\n\n        for ( ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next )\n        {\n            if ( ifa->ifa_addr == NULL || ifa->ifa_addr->sa_family != AF_INET ) \n                continue;\n\n            if ( ( ifa->ifa_flags & IFF_RUNNING ) == 0 )\n                continue;\n\n            Address address( (sockaddr_storage*) ifa->ifa_addr );\n\n            if ( !address.IsValid() )\n                continue;\n\n            if ( address.IsLoopback() )\n                continue;\n\n            assert( address.GetType() == ADDRESS_IPV4 );\n\n            freeifaddrs( ifaddr );\n\n            return address;\n        }\n\n        freeifaddrs( ifaddr );\n\n        return Address();\n    }\n\n    Address GetFirstNetworkAddress_IPV6()\n    {\n        struct ifaddrs *ifaddr, *ifa;\n\n        if ( getifaddrs( &ifaddr ) == -1 )\n            return Address();\n\n        for ( ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next )\n        {\n            if ( ifa->ifa_addr == NULL || ifa->ifa_addr->sa_family != AF_INET6 ) \n                continue;\n\n            if ( ( ifa->ifa_flags & IFF_RUNNING ) == 0 )\n                continue;\n\n            Address address( (sockaddr_storage*) ifa->ifa_addr );\n\n            if ( !address.IsValid() )\n                continue;\n\n            if ( address.IsLoopback() )\n                continue;\n\n            assert( address.GetType() == ADDRESS_IPV6 );\n\n            if ( !address.IsGlobalUnicast() )\n                continue;\n\n            freeifaddrs( ifaddr );\n\n            return address;\n        }\n\n        freeifaddrs( ifaddr );\n\n        return Address();\n    }\n\n#else \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n\n    void GetNetworkAddresses( Address * \/*addresses*\/, int & numAddresses, int \/*maxAddresses*\/ )\n    {\n        numAddresses = 0;\n    }\n\n    Address GetFirstNetworkAddress_IPV4()\n    {\n        return Address();\n    }\n\n    Address GetFirstNetworkAddress_IPV6()\n    {\n        return Address();\n    }\n\n#endif \/\/ #if YOJIMBO_PLATFORM == YOJIMBO_PLATFORM_WINDOWS\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 -fsyntax-only -std=c++0x -verify %s\n\nnamespace PR10622 {\n  struct foo {\n    const int first;\n    foo(const foo&) = default;\n  };\n  void find_or_insert(const foo& __obj) {\n    foo x(__obj);\n  }\n}\n<commit_msg>Expand test of C++0x [class.copymove]p15 to make sure we're actually calling the copy constructor of a base\/member from an explicitly-defaulted copy constructor, rather than the default constructor<commit_after>\/\/ RUN: %clang_cc1 -fsyntax-only -std=c++0x -verify %s\n\nnamespace PR10622 {\n  struct foo {\n    const int first;\n    foo(const foo&) = default;\n  };\n  void find_or_insert(const foo& __obj) {\n    foo x(__obj);\n  }\n\n  struct bar : foo {\n    bar(const bar&) = default;\n  };\n  void test_bar(const bar &obj) {\n    bar obj2(obj);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2015-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 \"UnitTests.h\"\n\n#include \"Media.h\"\n#include \"File.h\"\n#include \"common\/NoopCallback.h\"\n#include \"utils\/ModificationsNotifier.h\"\n#include \"compat\/Mutex.h\"\n\nclass MockCallback : public mock::NoopCallback\n{\npublic:\n    MockCallback() : m_nbMedia( 0 ), m_nbTotalMedia( 0 ) {}\nprivate:\n    virtual void onMediaDeleted( std::set<int64_t> batch ) override\n    {\n        std::lock_guard<compat::Mutex> lock( m_lock );\n        m_nbMedia = batch.size();\n        m_nbTotalMedia += batch.size();\n        m_cond.notify_all();\n    }\n\npublic:\n    void resetCount()\n    {\n        m_nbMedia = 0;\n        m_nbTotalMedia = 0;\n    }\n\n    std::unique_lock<compat::Mutex> prepareWait()\n    {\n        std::unique_lock<compat::Mutex> lock{ m_lock };\n        resetCount();\n        return lock;\n    }\n\n    unsigned int waitForNotif( std::unique_lock<compat::Mutex>& preparedLock,\n                               std::chrono::duration<int64_t> timeout, bool& hasTimedout )\n    {\n        hasTimedout = !m_cond.wait_for( preparedLock, timeout, [this]() {\n            return m_nbMedia != 0;\n        });\n\n        return m_nbMedia;\n    }\n\n    uint32_t getNbTotalMediaDeleted()\n    {\n        std::lock_guard<compat::Mutex> lock( m_lock );\n        return m_nbTotalMedia;\n    }\n\nprivate:\n    compat::Mutex m_lock;\n    compat::ConditionVariable m_cond;\n    uint32_t m_nbMedia;\n    uint32_t m_nbTotalMedia;\n};\n\nstruct RemovalNotifierTests : public UnitTests<MockCallback>\n{\n    virtual void InstantiateMediaLibrary( const std::string& dbPath,\n                                          const std::string& mlFolderDir ) override\n    {\n        ml.reset( new MediaLibraryWithNotifier ( dbPath, mlFolderDir ) );\n    }\n};\n\nstatic void DeleteOne( RemovalNotifierTests* T )\n{\n    auto m = std::static_pointer_cast<Media>( T->ml->addMedia( \"media.avi\", IMedia::Type::Video ) );\n    auto lock = T->cbMock->prepareWait();\n    bool hasTimedout;\n    m->removeFile( static_cast<File&>( *m->files()[0] ) );\n    \/\/ This media doesn't have any associated files, and should be removed by a sqlite hook\n    \/\/ The notification will arrive \"late\", as it will need to timeout first\n    auto res = T->cbMock->waitForNotif( lock,\n        std::chrono::duration_cast<std::chrono::seconds>( std::chrono::milliseconds{ 1500 } ),\n        hasTimedout );\n    ASSERT_FALSE( hasTimedout );\n    ASSERT_EQ( 1u, res );\n\n    \/\/ Re-run a notification after the queues have been used before\n    T->cbMock->resetCount();\n\n    m = std::static_pointer_cast<Media>( T->ml->addMedia( \"media.avi\", IMedia::Type::Video ) );\n    m->removeFile( static_cast<File&>( *m->files()[0] ) );\n\n    \/\/ Wait for a notification for 500ms. It shouldn't arrive, and we should timeout\n    res = T->cbMock->waitForNotif( lock,\n        std::chrono::duration_cast<std::chrono::seconds>( std::chrono::milliseconds{ 500 } ),\n        hasTimedout );\n    ASSERT_TRUE( hasTimedout );\n    ASSERT_EQ( 0u, res );\n\n    \/\/ Wait again, now it should arrive.\n    res = T->cbMock->waitForNotif( lock,\n        std::chrono::duration_cast<std::chrono::seconds>( std::chrono::milliseconds{ 1000 } ),\n        hasTimedout );\n    ASSERT_FALSE( hasTimedout );\n    ASSERT_EQ( 1u, res );\n}\n\nstatic void DeleteBatch( RemovalNotifierTests* T )\n{\n    for ( auto i = 0u; i < 10; ++i )\n        T->ml->addMedia( std::string{ \"media\" } + std::to_string( i ) + \".mkv\", IMedia::Type::Video );\n\n    auto lock = T->cbMock->prepareWait();\n    bool hasTimedout;\n\n    for ( auto i = 0u; i < 10; ++i )\n        T->ml->deleteMedia( i + 1 );\n\n    \/\/ This media doesn't have any associated files, and should be removed by a sqlite hook\n    \/\/ The notification will arrive \"late\", as it will need to timeout first\n    uint32_t nbTotalNotified = 0;\n    while ( nbTotalNotified != 10 )\n    {\n        auto nbNotified = T->cbMock->waitForNotif( lock,\n            std::chrono::duration_cast<std::chrono::seconds>( std::chrono::milliseconds{ 1500 } ),\n            hasTimedout );\n        ASSERT_NE( 0u, nbNotified );\n        ASSERT_FALSE( hasTimedout );\n        ASSERT_TRUE( nbNotified != 1 || nbNotified + nbTotalNotified == 10 );\n        nbTotalNotified += nbNotified;\n        T->cbMock->resetCount();\n    }\n    ASSERT_EQ( 10u, nbTotalNotified );\n}\n\nstatic void Flush( RemovalNotifierTests* T )\n{\n    for ( auto i = 0u; i < 10; ++i )\n        T->ml->addMedia( std::string{ \"media\" } + std::to_string( i ) + \".mkv\", IMedia::Type::Video );\n\n    for ( auto i = 0u; i < 10; ++i )\n        T->ml->deleteMedia( i + 1 );\n\n    \/\/ We can't lock here since flush is blocking until the callbacks have been called\n    T->ml->getNotifier()->flush();\n    auto nbMediaSignaled = T->cbMock->getNbTotalMediaDeleted();\n    ASSERT_EQ( 10u, nbMediaSignaled );\n}\n\nint main( int ac, char** av )\n{\n    INIT_TESTS_C( RemovalNotifierTests );\n\n    ADD_TEST( DeleteOne );\n    ADD_TEST( DeleteBatch );\n    ADD_TEST( Flush );\n\n    END_TESTS\n}\n<commit_msg>test: RemovalNotifier: Increase timeout<commit_after>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2015-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 \"UnitTests.h\"\n\n#include \"Media.h\"\n#include \"File.h\"\n#include \"common\/NoopCallback.h\"\n#include \"utils\/ModificationsNotifier.h\"\n#include \"compat\/Mutex.h\"\n\nclass MockCallback : public mock::NoopCallback\n{\npublic:\n    MockCallback() : m_nbMedia( 0 ), m_nbTotalMedia( 0 ) {}\nprivate:\n    virtual void onMediaDeleted( std::set<int64_t> batch ) override\n    {\n        std::lock_guard<compat::Mutex> lock( m_lock );\n        m_nbMedia = batch.size();\n        m_nbTotalMedia += batch.size();\n        m_cond.notify_all();\n    }\n\npublic:\n    void resetCount()\n    {\n        m_nbMedia = 0;\n        m_nbTotalMedia = 0;\n    }\n\n    std::unique_lock<compat::Mutex> prepareWait()\n    {\n        std::unique_lock<compat::Mutex> lock{ m_lock };\n        resetCount();\n        return lock;\n    }\n\n    unsigned int waitForNotif( std::unique_lock<compat::Mutex>& preparedLock,\n                               std::chrono::duration<int64_t> timeout, bool& hasTimedout )\n    {\n        hasTimedout = !m_cond.wait_for( preparedLock, timeout, [this]() {\n            return m_nbMedia != 0;\n        });\n\n        return m_nbMedia;\n    }\n\n    uint32_t getNbTotalMediaDeleted()\n    {\n        std::lock_guard<compat::Mutex> lock( m_lock );\n        return m_nbTotalMedia;\n    }\n\nprivate:\n    compat::Mutex m_lock;\n    compat::ConditionVariable m_cond;\n    uint32_t m_nbMedia;\n    uint32_t m_nbTotalMedia;\n};\n\nstruct RemovalNotifierTests : public UnitTests<MockCallback>\n{\n    virtual void InstantiateMediaLibrary( const std::string& dbPath,\n                                          const std::string& mlFolderDir ) override\n    {\n        ml.reset( new MediaLibraryWithNotifier ( dbPath, mlFolderDir ) );\n    }\n};\n\nstatic void DeleteOne( RemovalNotifierTests* T )\n{\n    auto m = std::static_pointer_cast<Media>( T->ml->addMedia( \"media.avi\", IMedia::Type::Video ) );\n    auto lock = T->cbMock->prepareWait();\n    bool hasTimedout;\n    m->removeFile( static_cast<File&>( *m->files()[0] ) );\n    \/\/ This media doesn't have any associated files, and should be removed by a sqlite hook\n    \/\/ The notification will arrive \"late\", as it will need to timeout first\n    auto res = T->cbMock->waitForNotif( lock,\n        std::chrono::duration_cast<std::chrono::seconds>( std::chrono::milliseconds{ 2000 } ),\n        hasTimedout );\n    ASSERT_FALSE( hasTimedout );\n    ASSERT_EQ( 1u, res );\n\n    \/\/ Re-run a notification after the queues have been used before\n    T->cbMock->resetCount();\n\n    m = std::static_pointer_cast<Media>( T->ml->addMedia( \"media.avi\", IMedia::Type::Video ) );\n    m->removeFile( static_cast<File&>( *m->files()[0] ) );\n\n    \/\/ Wait for a notification for 500ms. It shouldn't arrive, and we should timeout\n    res = T->cbMock->waitForNotif( lock,\n        std::chrono::duration_cast<std::chrono::seconds>( std::chrono::milliseconds{ 500 } ),\n        hasTimedout );\n    ASSERT_TRUE( hasTimedout );\n    ASSERT_EQ( 0u, res );\n\n    \/\/ Wait again, now it should arrive.\n    res = T->cbMock->waitForNotif( lock,\n        std::chrono::duration_cast<std::chrono::seconds>( std::chrono::milliseconds{ 2000 } ),\n        hasTimedout );\n    ASSERT_FALSE( hasTimedout );\n    ASSERT_EQ( 1u, res );\n}\n\nstatic void DeleteBatch( RemovalNotifierTests* T )\n{\n    for ( auto i = 0u; i < 10; ++i )\n        T->ml->addMedia( std::string{ \"media\" } + std::to_string( i ) + \".mkv\", IMedia::Type::Video );\n\n    auto lock = T->cbMock->prepareWait();\n    bool hasTimedout;\n\n    for ( auto i = 0u; i < 10; ++i )\n        T->ml->deleteMedia( i + 1 );\n\n    \/\/ This media doesn't have any associated files, and should be removed by a sqlite hook\n    \/\/ The notification will arrive \"late\", as it will need to timeout first\n    uint32_t nbTotalNotified = 0;\n    while ( nbTotalNotified != 10 )\n    {\n        auto nbNotified = T->cbMock->waitForNotif( lock,\n            std::chrono::duration_cast<std::chrono::seconds>( std::chrono::milliseconds{ 2000 } ),\n            hasTimedout );\n        ASSERT_NE( 0u, nbNotified );\n        ASSERT_FALSE( hasTimedout );\n        ASSERT_TRUE( nbNotified != 1 || nbNotified + nbTotalNotified == 10 );\n        nbTotalNotified += nbNotified;\n        T->cbMock->resetCount();\n    }\n    ASSERT_EQ( 10u, nbTotalNotified );\n}\n\nstatic void Flush( RemovalNotifierTests* T )\n{\n    for ( auto i = 0u; i < 10; ++i )\n        T->ml->addMedia( std::string{ \"media\" } + std::to_string( i ) + \".mkv\", IMedia::Type::Video );\n\n    for ( auto i = 0u; i < 10; ++i )\n        T->ml->deleteMedia( i + 1 );\n\n    \/\/ We can't lock here since flush is blocking until the callbacks have been called\n    T->ml->getNotifier()->flush();\n    auto nbMediaSignaled = T->cbMock->getNbTotalMediaDeleted();\n    ASSERT_EQ( 10u, nbMediaSignaled );\n}\n\nint main( int ac, char** av )\n{\n    INIT_TESTS_C( RemovalNotifierTests );\n\n    ADD_TEST( DeleteOne );\n    ADD_TEST( DeleteBatch );\n    ADD_TEST( Flush );\n\n    END_TESTS\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QQmlApplicationEngine>\n#include <QTest>\n#include <Automator>\n#include <QtConcurrent>\n#include <asyncfuture.h>\n#include <QTimer>\n#include \"example.h\"\n#include \"testfunctions.h\"\n#include \"asyncfutureutils.h\"\n\nusing namespace AsyncFuture;\nusing namespace AsyncFutureUtils;\nusing namespace Test;\n\nstatic QString delayedFakeRead(const QString& fileName) {\n    Q_UNUSED(fileName);\n\n    Automator::wait(100);\n    return \"\";\n}\n\nExample::Example(QObject *parent) : QObject(parent)\n{\n\n    \/\/ This function do nothing but could make Qt Creator Autotests plugin recognize this test\n    auto ref =[=]() {\n        QTest::qExec(this, 0, 0);\n    };\n    Q_UNUSED(ref);\n\n}\n\n\/*\n * 1. Convert a signal from QObject into a QFuture object\n * https:\/\/github.com\/benlau\/asyncfuture\n *\n *\/\n\nvoid Example::example_Timer_timeout()\n{\n    QTimer *timer = new QTimer(this);\n    timer->setInterval(50);\n\n    \/\/ Convert a signal from QObject into QFuture\n    QFuture<void> future = observe(timer,\n                                   &QTimer::timeout).future();\n\n    \/\/ Listen from the future without using QFutureWatcher<T>\n    observe(future).subscribe([]() {\n        \/\/ onCompleted. It is invoked when the observed future is finished successfully\n        qDebug() << \"onCompleted\";\n    },[]() {\n        \/\/ onCanceled\n        qDebug() << \"onCancel\";\n    });\n\n    \/\/ It is chainable. Listen from a timeout signal only once\n\n    observe(timer, &QTimer::timeout).subscribe([=]() { \/*…*\/ });\n\n    timer->start();\n    waitUntil(future);\n}\n\n\/*\n *\n * 2. Combine multiple futures with different type into a single future object\n * https:\/\/github.com\/benlau\/asyncfuture\n *\n *\/\n\nvoid Example::example_combine_multiple_future()\n{\n    auto readImage = [](QString) -> QImage {\n        \/\/ Not a real image reader\n        Automator::wait(50);\n        return QImage();\n    };\n\n    QTimer *timer = new QTimer(this);\n    timer->setInterval(80);\n\n    \/\/ Combine multiple futures with different type into a single future\n    QFuture<QImage> f1 = QtConcurrent::run(readImage, QString(\"image.jpg\"));\n\n    QFuture<void> f2 = observe(timer, &QTimer::timeout).future();\n\n    QFuture<QImage> result = (combine() << f1 << f2).subscribe([=](){\n        \/\/ Read an image but do not return before timeout\n        return f1.result();\n    }).future();\n\n    timer->start();\n\n    QVERIFY(waitUntil(result, 1000));\n\n    timer->deleteLater();\n}\n\nvoid Example::example_worker_context()\n{\n\n    auto readImage = [](QString) -> QImage {\n        \/\/ Not a real image reader\n        Automator::wait(50);\n        return QImage();\n    };\n\n    auto validator = [](QImage image) {\n        return image.isNull();\n    };\n\n    QObject* contextObject = new QObject(this);\n\n    \/\/ Start a thread and process its result in main thread\n\n    QFuture<QImage> reading = QtConcurrent::run(readImage, QString(\"image.jpg\"));\n\n    QFuture<bool> validating = observe(reading).context(contextObject, validator).future();\n\n    \/\/ Read image by a thread, when it is ready, run the validator function\n    \/\/ in the thread of the contextObject(e.g main thread)\n    \/\/ And it return another QFuture to represent the final result.\n\n\n    QVERIFY(waitUntil(validating, 1000));\n\n    QCOMPARE(validating.result(), true);\n\n}\n\nstatic int mapFunc(int value) {\n    return value * value;\n}\n\nvoid Example::example_context_return_future()\n{\n\n    auto reducerFunc = [](QList<int> input ) -> int {\n        return input.size();\n    };\n\n    QList<int> input;\n    for (int i = 0 ; i < 10;i++) {\n        input << i;\n    }\n\n    QObject* contextObject = this;\n\n    QFuture<int> f1 = QtConcurrent::mapped(input, mapFunc);\n\n    \/\/ You may use QFuture as the input argument of your callback function\n    \/\/ It will be set to the observed future object. So that you may obtain\n    \/\/ the value of results()\n    QFuture<int> f2 = observe(f1).context(contextObject, [=](QFuture<int> future) {\n        qDebug() << future.results();\n\n        \/\/ Return another QFuture is possible.\n        return QtConcurrent::run(reducerFunc, future.results());\n    }).future();\n\n    \/\/ f2 is constructed before the QtConcurrent::run statement\n    \/\/ But its value is equal to the result of reducerFunc\n\n    waitUntil(f2);\n\n    QCOMPARE(f2.result(), 10);\n}\n\nvoid Example::example_promise_like()\n{\n    \/\/ Complete \/ cancel a future on your own choice\n    auto d = deferred<bool>();\n\n    observe(d.future()).subscribe([]() {\n        qDebug() << \"onCompleted\";\n    }, []() {\n        qDebug() << \"onCancel\";\n    });\n\n    d.complete(true);\n    d.cancel();\n\n    QCOMPARE(d.future().isFinished(), true);\n    QCOMPARE(d.future().isCanceled(), false);\n\n    QVERIFY(waitUntil(d.future(), 1000));\n}\n\nvoid Example::example_promise_like_complete_future()\n{\n    \/\/ Complete \/ cancel a future according to another future object.\n    auto timeout = []() -> void {\n        Automator::wait(50);\n    };\n\n    auto d = deferred<void>();\n\n    d.complete(QtConcurrent::run(timeout));\n\n    QCOMPARE(d.future().isFinished(), false);\n    QCOMPARE(d.future().isCanceled(), false);\n\n    QVERIFY(waitUntil(d.future(), 1000));\n}\n\n\nvoid Example::example_promise_like_timeout()\n{\n    QTimer* timer = new QTimer(this);\n    timer->setInterval(50);\n\n    auto readFileworker = [](QString fileName) -> QString {\n        Q_UNUSED(fileName);\n        Automator::wait(1000);\n        return \"\";\n    };\n\n    auto read = [=](const QString &fileName) {\n        timer->start();\n\n        auto timeout = observe(timer, &QTimer::timeout).future();\n\n        auto defer = deferred<QString>();\n\n        defer.complete(QtConcurrent::run(readFileworker, fileName));\n        defer.cancel(timeout);\n\n        return defer.future();\n    };\n\n    auto future = read(\"input.txt\");\n\n    bool canceldCalled = false;\n\n    observe(future).subscribe([](QString content) {\n        Q_UNUSED(content);\n        \/\/ onCompleted\n    },[&]() {\n        \/\/ onCanceled due to timeout\n        canceldCalled = true;\n    });\n\n    waitUntil(future);\n    QCOMPARE(canceldCalled, true);\n    timer->deleteLater();\n    Automator::wait(500); \/\/ wait until the read is finished\n}\n\nvoid Example::example_fileactor()\n{\n    \/* FileActor- read data from a file.\n     - If the cache is available, return a QFuture with the content\n     - If cache is missed, check do it have any worker thread is ready, return the future of the threadd\n     - If no thread is found, start a new one\n     *\/\n\n    class FileActor : public QObject {\n    public:\n\n        QFuture<QString> read(QString fileName) {\n            QFuture<QString> future;\n\n            if (cache.contains(fileName)) {\n                \/\/ Cache hit. But it still return a QFuture [finished].\n\n                auto defer = deferred<QString>();\n                defer.complete(*cache.object(fileName));\n                future = defer.future();\n\n            } else if (workers.contains(fileName)) {\n\n                \/\/ If any worker are reading, just return the future\n                future = workers[fileName];\n\n            } else {\n\n                class Session {\n                public:\n                    QString fileName;\n                    QString content;\n                };\n\n                auto loader = [=](QString fileName){\n                    Automator::wait(50);\n\n                    Session session;\n                    session.content = fileName + \"+data\";\n                    session.fileName = fileName;\n\n                    return session;\n                };\n\n                QFuture<Session> worker = QtConcurrent::run(loader, fileName);\n                auto observer = observe(worker).context(this, [=](Session session) {\n\n                    workers.remove(session.fileName);\n                    cache.insert(fileName, new QString(session.content));\n                    return session.content;\n                });\n\n                future = observer.future();\n                workers[fileName] = future;\n            }\n\n            return future;\n        }\n\n        QCache<QString, QString> cache;\n        QMap<QString, QFuture<QString> > workers;\n    };\n\n\n    FileActor actor;\n    QString fileName = \"input.txt\";\n\n    QFuture<QString> future = actor.read(fileName);\n\n    QCOMPARE(future.isFinished(), false);\n    QVERIFY(actor.workers.contains(fileName));\n\n    QVERIFY(waitUntil(future, 1000));\n\n    QCOMPARE(future.isFinished(), true);\n\n    QVERIFY(future.result() == \"input.txt+data\");\n\n    QVERIFY(!actor.workers.contains(fileName));\n\n    \/\/ Read the content again\n    future = actor.read(fileName);\n\n    QVERIFY(future.isFinished());\n    QVERIFY(future.result() == \"input.txt+data\");\n\n    QString content;\n\n    observe(future).subscribe([&](QString result) {\n        content = result;\n    });\n\n    tick();\n\n    QVERIFY(future.result() == content);\n\n}\n\ntemplate <typename T, typename Sequence, typename Functor>\nQFuture<T> mapped(Sequence input, Functor func){\n    auto defer = AsyncFuture::deferred<T>();\n\n    QList<QFuture<T>> futures;\n    auto combinator = AsyncFuture::combine();\n\n    for (int i = 0 ; i < input.size() ; i++) {\n        auto future = QtConcurrent::run(func, input[i]);\n        combinator << future;\n        futures << future;\n    }\n\n    AsyncFuture::observe(combinator.future()).subscribe([=]() mutable {\n        QList<T> res;\n        for (int i = 0 ; i < futures.size(); i++) {\n            res << futures[i].result();\n        }\n        defer.complete(res);\n    });\n\n    return defer.future();\n}\n\n\/\/\/ To simulate a QtConcurrent::mapped\nvoid Example::example_simulate_qtconcurrent_mapped()\n{\n    auto worker = [=](int value) {\n        Automator::wait(10);\n        return value * value;\n    };\n\n    QList<int> input, expected;\n    for (int i = 0; i < 3; i++) {\n        input << i;\n        expected << i * i;\n    }\n\n    QFuture<int> future = mapped<int>(input, worker);\n\n    Test::waitUntil(future);\n\n    QCOMPARE(future.isFinished(), true);\n\n    QList<int> result = future.results();\n\n    QVERIFY(result == expected);\n}\n\nstatic QMutex semaphoreWorkerMutex;\nstatic int semaphoreWorkerRunningCount = 0;\nstatic int semaphoreWorkerFinishedCount = 0;\nstatic QSemaphore internalSemaphore(1);\n\nstatic int semaphoreWorker(int value) {\n    semaphoreWorkerMutex.lock();\n    semaphoreWorkerRunningCount++;\n    semaphoreWorkerMutex.unlock();\n    internalSemaphore.acquire();\n    semaphoreWorkerMutex.lock();\n    semaphoreWorkerFinishedCount++;\n    semaphoreWorkerMutex.unlock();\n    internalSemaphore.release();\n    return value;\n}\n\nvoid Example::example_qtconcurrent_mapped_cancel()\n{\n    \/\/@TODO - It need an improved cancellation token mechanism\n\n    semaphoreWorkerRunningCount = 0;\n    semaphoreWorkerFinishedCount = 0;\n    internalSemaphore.acquire(1);\n\n    int count = QThreadPool::globalInstance()->maxThreadCount() * 2;\n\n    \/\/ The input size should be double than the no. of thread available in QThreadPool\n    QList<int> input;\n\n    for (int i = 0 ;i < count;i++) {\n        input << i;\n    }\n\n    auto cancelToken = deferred<void>();\n\n    auto f1 = timeout(100);\n\n    auto f2 = observe(f1).subscribe([&](){\n        auto future = QtConcurrent::mapped(input, semaphoreWorker);\n        cancelToken.subscribe([](){}, [=]() {\n            auto f = future;\n            f.cancel();\n        });\n\n        return future;\n    }).future();\n\n    observe(f2).subscribe([](){}, [=]() {\n        auto d = cancelToken;\n        d.cancel();\n    });\n\n    await(f1);\n\n    \/\/ Wait until all the thread are blocked;\n    \/\/ QtConcurrent::mapped coult not take QThreadPool as input argument.\n    Automator::wait(1000);\n\n    QVERIFY(semaphoreWorkerRunningCount > 0);\n    QCOMPARE(semaphoreWorkerFinishedCount, 0);\n    int runningCount = semaphoreWorkerRunningCount;\n\n    \/\/ Cancel f2. No more worker should be executed\n    f2.cancel();\n\n    Automator::wait(100);\n\n    internalSemaphore.release();\n\n    QTRY_COMPARE(semaphoreWorkerFinishedCount, runningCount);\n    Automator::wait(100);\n\n    QCOMPARE(semaphoreWorkerRunningCount, runningCount);\n    QCOMPARE(semaphoreWorkerFinishedCount, runningCount);\n\n}\n\ntemplate <typename Functor, typename Token>\nauto cancellationWrapper(Functor functor, Token token) -> std::function<QFuture<void>()> {\n\n    return [=]() mutable -> QFuture<void> {\n        if (token.isCanceled()) {\n            return token;\n        }\n\n        functor();\n        auto defer = deferred<void>();\n        defer.complete();\n        return defer.future();\n    };\n}\n\nvoid Example::example_CancellationToken()\n{\n    Deferred<void> cancellation = deferred<void>();\n\n    QFuture<void> cancellationToken = cancellation.future();\n\n    Deferred<void> start;\n\n    QList<qreal> sequence;\n    QList<qreal> expectedSquence;\n    expectedSquence << 1 << 1.5;\n\n    auto f1 = start.future();\n\n    auto f2 = observe(f1).subscribe(cancellationWrapper([&]() {\n        sequence << 1;\n    }, cancellationToken)).future();\n\n    observe(f2).subscribe([&]() {\n        sequence << 1.5;\n        cancellation.cancel();\n    });\n\n    auto f3 = observe(f2).subscribe(cancellationWrapper([&]() mutable {\n        sequence << 2;\n    },cancellationToken)).future();\n\n    observe(f3).subscribe(cancellationWrapper([&]() {\n        sequence << 3;\n    }, cancellationToken)).future();\n\n    start.complete();\n    Automator::wait(500);\n\n    QCOMPARE(sequence, expectedSquence);\n\n}\n\nvoid Example::example_Combinator_timeout()\n{\n    QFuture<QString> f1 = QtConcurrent::run(delayedFakeRead, QString(\"input1.txt\"));\n\n    QFuture<QString> f2 = QtConcurrent::run(delayedFakeRead, QString(\"input2.txt\"));\n\n    auto combinator = AsyncFuture::combine();\n    combinator << f1 << f2;\n\n    auto defer = deferred<void>();\n\n    defer.complete(combinator.future());\n    defer.cancel(AsyncFutureUtils::timeout(10));\n\n    auto returningFuture = defer.future();\n\n    await(returningFuture);\n\n    QCOMPARE(returningFuture.isCanceled(), true);\n    QCOMPARE(returningFuture.isFinished(), true);\n\n    QCOMPARE(returningFuture.progressMaximum(), 2);\n}\n\n<commit_msg>example mapped<T> - Rewritten to support cancelation<commit_after>#include <QQmlApplicationEngine>\n#include <QTest>\n#include <Automator>\n#include <QtConcurrent>\n#include <asyncfuture.h>\n#include <QTimer>\n#include \"example.h\"\n#include \"testfunctions.h\"\n#include \"asyncfutureutils.h\"\n\nusing namespace AsyncFuture;\nusing namespace AsyncFutureUtils;\nusing namespace Test;\n\nstatic QString delayedFakeRead(const QString& fileName) {\n    Q_UNUSED(fileName);\n\n    Automator::wait(100);\n    return \"\";\n}\n\nExample::Example(QObject *parent) : QObject(parent)\n{\n\n    \/\/ This function do nothing but could make Qt Creator Autotests plugin recognize this test\n    auto ref =[=]() {\n        QTest::qExec(this, 0, 0);\n    };\n    Q_UNUSED(ref);\n\n}\n\n\/*\n * 1. Convert a signal from QObject into a QFuture object\n * https:\/\/github.com\/benlau\/asyncfuture\n *\n *\/\n\nvoid Example::example_Timer_timeout()\n{\n    QTimer *timer = new QTimer(this);\n    timer->setInterval(50);\n\n    \/\/ Convert a signal from QObject into QFuture\n    QFuture<void> future = observe(timer,\n                                   &QTimer::timeout).future();\n\n    \/\/ Listen from the future without using QFutureWatcher<T>\n    observe(future).subscribe([]() {\n        \/\/ onCompleted. It is invoked when the observed future is finished successfully\n        qDebug() << \"onCompleted\";\n    },[]() {\n        \/\/ onCanceled\n        qDebug() << \"onCancel\";\n    });\n\n    \/\/ It is chainable. Listen from a timeout signal only once\n\n    observe(timer, &QTimer::timeout).subscribe([=]() { \/*…*\/ });\n\n    timer->start();\n    waitUntil(future);\n}\n\n\/*\n *\n * 2. Combine multiple futures with different type into a single future object\n * https:\/\/github.com\/benlau\/asyncfuture\n *\n *\/\n\nvoid Example::example_combine_multiple_future()\n{\n    auto readImage = [](QString) -> QImage {\n        \/\/ Not a real image reader\n        Automator::wait(50);\n        return QImage();\n    };\n\n    QTimer *timer = new QTimer(this);\n    timer->setInterval(80);\n\n    \/\/ Combine multiple futures with different type into a single future\n    QFuture<QImage> f1 = QtConcurrent::run(readImage, QString(\"image.jpg\"));\n\n    QFuture<void> f2 = observe(timer, &QTimer::timeout).future();\n\n    QFuture<QImage> result = (combine() << f1 << f2).subscribe([=](){\n        \/\/ Read an image but do not return before timeout\n        return f1.result();\n    }).future();\n\n    timer->start();\n\n    QVERIFY(waitUntil(result, 1000));\n\n    timer->deleteLater();\n}\n\nvoid Example::example_worker_context()\n{\n\n    auto readImage = [](QString) -> QImage {\n        \/\/ Not a real image reader\n        Automator::wait(50);\n        return QImage();\n    };\n\n    auto validator = [](QImage image) {\n        return image.isNull();\n    };\n\n    QObject* contextObject = new QObject(this);\n\n    \/\/ Start a thread and process its result in main thread\n\n    QFuture<QImage> reading = QtConcurrent::run(readImage, QString(\"image.jpg\"));\n\n    QFuture<bool> validating = observe(reading).context(contextObject, validator).future();\n\n    \/\/ Read image by a thread, when it is ready, run the validator function\n    \/\/ in the thread of the contextObject(e.g main thread)\n    \/\/ And it return another QFuture to represent the final result.\n\n\n    QVERIFY(waitUntil(validating, 1000));\n\n    QCOMPARE(validating.result(), true);\n\n}\n\nstatic int mapFunc(int value) {\n    return value * value;\n}\n\nvoid Example::example_context_return_future()\n{\n\n    auto reducerFunc = [](QList<int> input ) -> int {\n        return input.size();\n    };\n\n    QList<int> input;\n    for (int i = 0 ; i < 10;i++) {\n        input << i;\n    }\n\n    QObject* contextObject = this;\n\n    QFuture<int> f1 = QtConcurrent::mapped(input, mapFunc);\n\n    \/\/ You may use QFuture as the input argument of your callback function\n    \/\/ It will be set to the observed future object. So that you may obtain\n    \/\/ the value of results()\n    QFuture<int> f2 = observe(f1).context(contextObject, [=](QFuture<int> future) {\n        qDebug() << future.results();\n\n        \/\/ Return another QFuture is possible.\n        return QtConcurrent::run(reducerFunc, future.results());\n    }).future();\n\n    \/\/ f2 is constructed before the QtConcurrent::run statement\n    \/\/ But its value is equal to the result of reducerFunc\n\n    waitUntil(f2);\n\n    QCOMPARE(f2.result(), 10);\n}\n\nvoid Example::example_promise_like()\n{\n    \/\/ Complete \/ cancel a future on your own choice\n    auto d = deferred<bool>();\n\n    observe(d.future()).subscribe([]() {\n        qDebug() << \"onCompleted\";\n    }, []() {\n        qDebug() << \"onCancel\";\n    });\n\n    d.complete(true);\n    d.cancel();\n\n    QCOMPARE(d.future().isFinished(), true);\n    QCOMPARE(d.future().isCanceled(), false);\n\n    QVERIFY(waitUntil(d.future(), 1000));\n}\n\nvoid Example::example_promise_like_complete_future()\n{\n    \/\/ Complete \/ cancel a future according to another future object.\n    auto timeout = []() -> void {\n        Automator::wait(50);\n    };\n\n    auto d = deferred<void>();\n\n    d.complete(QtConcurrent::run(timeout));\n\n    QCOMPARE(d.future().isFinished(), false);\n    QCOMPARE(d.future().isCanceled(), false);\n\n    QVERIFY(waitUntil(d.future(), 1000));\n}\n\n\nvoid Example::example_promise_like_timeout()\n{\n    QTimer* timer = new QTimer(this);\n    timer->setInterval(50);\n\n    auto readFileworker = [](QString fileName) -> QString {\n        Q_UNUSED(fileName);\n        Automator::wait(1000);\n        return \"\";\n    };\n\n    auto read = [=](const QString &fileName) {\n        timer->start();\n\n        auto timeout = observe(timer, &QTimer::timeout).future();\n\n        auto defer = deferred<QString>();\n\n        defer.complete(QtConcurrent::run(readFileworker, fileName));\n        defer.cancel(timeout);\n\n        return defer.future();\n    };\n\n    auto future = read(\"input.txt\");\n\n    bool canceldCalled = false;\n\n    observe(future).subscribe([](QString content) {\n        Q_UNUSED(content);\n        \/\/ onCompleted\n    },[&]() {\n        \/\/ onCanceled due to timeout\n        canceldCalled = true;\n    });\n\n    waitUntil(future);\n    QCOMPARE(canceldCalled, true);\n    timer->deleteLater();\n    Automator::wait(500); \/\/ wait until the read is finished\n}\n\nvoid Example::example_fileactor()\n{\n    \/* FileActor- read data from a file.\n     - If the cache is available, return a QFuture with the content\n     - If cache is missed, check do it have any worker thread is ready, return the future of the threadd\n     - If no thread is found, start a new one\n     *\/\n\n    class FileActor : public QObject {\n    public:\n\n        QFuture<QString> read(QString fileName) {\n            QFuture<QString> future;\n\n            if (cache.contains(fileName)) {\n                \/\/ Cache hit. But it still return a QFuture [finished].\n\n                auto defer = deferred<QString>();\n                defer.complete(*cache.object(fileName));\n                future = defer.future();\n\n            } else if (workers.contains(fileName)) {\n\n                \/\/ If any worker are reading, just return the future\n                future = workers[fileName];\n\n            } else {\n\n                class Session {\n                public:\n                    QString fileName;\n                    QString content;\n                };\n\n                auto loader = [=](QString fileName){\n                    Automator::wait(50);\n\n                    Session session;\n                    session.content = fileName + \"+data\";\n                    session.fileName = fileName;\n\n                    return session;\n                };\n\n                QFuture<Session> worker = QtConcurrent::run(loader, fileName);\n                auto observer = observe(worker).context(this, [=](Session session) {\n\n                    workers.remove(session.fileName);\n                    cache.insert(fileName, new QString(session.content));\n                    return session.content;\n                });\n\n                future = observer.future();\n                workers[fileName] = future;\n            }\n\n            return future;\n        }\n\n        QCache<QString, QString> cache;\n        QMap<QString, QFuture<QString> > workers;\n    };\n\n\n    FileActor actor;\n    QString fileName = \"input.txt\";\n\n    QFuture<QString> future = actor.read(fileName);\n\n    QCOMPARE(future.isFinished(), false);\n    QVERIFY(actor.workers.contains(fileName));\n\n    QVERIFY(waitUntil(future, 1000));\n\n    QCOMPARE(future.isFinished(), true);\n\n    QVERIFY(future.result() == \"input.txt+data\");\n\n    QVERIFY(!actor.workers.contains(fileName));\n\n    \/\/ Read the content again\n    future = actor.read(fileName);\n\n    QVERIFY(future.isFinished());\n    QVERIFY(future.result() == \"input.txt+data\");\n\n    QString content;\n\n    observe(future).subscribe([&](QString result) {\n        content = result;\n    });\n\n    tick();\n\n    QVERIFY(future.result() == content);\n\n}\n\ntemplate <typename T, typename Sequence, typename Functor>\nQFuture<T> mapped(Sequence input, Functor func){\n    class Context {\n    public:\n        QMutex mutex;\n        Sequence input;\n        QVector<T> output;\n        int finishedCount;\n        int index;\n        std::function<void(int)> worker;\n    };\n    QThreadPool *pool = QThreadPool::globalInstance();\n\n    auto defer = AsyncFuture::deferred<T>();\n\n    \/\/\/ Allow to be canceled by user\n    defer.onCanceled(defer);\n\n    int insertCount = qMin(pool->maxThreadCount(),input.size());\n\n    QSharedPointer<Context> context(new Context());\n    context->input = input;\n    context->index = insertCount;\n    context->finishedCount = 0;\n    context->output = QVector<T>(input.size());\n\n    context->worker = [defer, pool, context, func](int pos) mutable {\n        T res = func(context->input[pos]);\n        \/\/@TODO - update prgress value\n\n        context->mutex.lock();\n        context->output[pos] = res;\n\n        if (!defer.future().isCanceled()) {\n            int index = context->index;\n            if (index < context->input.size()) {\n                QtConcurrent::run(pool, context->worker, index++);\n                context->index = index;\n            }\n\n            context->finishedCount++;\n            if (context->finishedCount >= context->input.size()) {\n                defer.complete(context->output.toList());\n                context->worker = nullptr;\n            }\n        }\n        context->mutex.unlock();\n\n    };\n\n    for (int i = 0 ; i < insertCount ; i++) {\n        QtConcurrent::run(pool, context->worker, i);\n    }\n\n    return defer.future();\n}\n\n\/\/\/ To simulate a QtConcurrent::mapped\nvoid Example::example_simulate_qtconcurrent_mapped()\n{\n    auto worker = [=](int value) {\n        Automator::wait(10);\n        return value * value;\n    };\n\n    QList<int> input, expected;\n    for (int i = 0; i < 20; i++) {\n        input << i;\n        expected << i * i;\n    }\n\n    QFuture<int> future = mapped<int>(input, worker);\n\n    Test::waitUntil(future);\n\n    QCOMPARE(future.isFinished(), true);\n\n    QList<int> result = future.results();\n\n    QVERIFY(result == expected);\n}\n\nstatic QMutex semaphoreWorkerMutex;\nstatic int semaphoreWorkerRunningCount = 0;\nstatic int semaphoreWorkerFinishedCount = 0;\nstatic QSemaphore internalSemaphore(1);\n\nstatic int semaphoreWorker(int value) {\n    semaphoreWorkerMutex.lock();\n    semaphoreWorkerRunningCount++;\n    semaphoreWorkerMutex.unlock();\n    internalSemaphore.acquire();\n    semaphoreWorkerMutex.lock();\n    semaphoreWorkerFinishedCount++;\n    semaphoreWorkerMutex.unlock();\n    internalSemaphore.release();\n    return value;\n}\n\nvoid Example::example_qtconcurrent_mapped_cancel()\n{\n    \/\/@TODO - It need an improved cancellation token mechanism\n\n    semaphoreWorkerRunningCount = 0;\n    semaphoreWorkerFinishedCount = 0;\n    internalSemaphore.acquire(1);\n\n    int count = QThreadPool::globalInstance()->maxThreadCount() * 2;\n\n    \/\/ The input size should be double than the no. of thread available in QThreadPool\n    QList<int> input;\n\n    for (int i = 0 ;i < count;i++) {\n        input << i;\n    }\n\n    auto cancelToken = deferred<void>();\n\n    auto f1 = timeout(100);\n\n    auto f2 = observe(f1).subscribe([&](){\n        auto future = QtConcurrent::mapped(input, semaphoreWorker);\n        cancelToken.onCanceled(future);\n        return future;\n    }).future();\n\n    observe(f2).subscribe([](){}, [=]() {\n        auto d = cancelToken;\n        d.cancel();\n    });\n\n    await(f1);\n\n    \/\/ Wait until all the thread are blocked;\n    \/\/ QtConcurrent::mapped coult not take QThreadPool as input argument.\n    Automator::wait(1000);\n\n    QVERIFY(semaphoreWorkerRunningCount > 0);\n    QCOMPARE(semaphoreWorkerFinishedCount, 0);\n    int runningCount = semaphoreWorkerRunningCount;\n\n    \/\/ Cancel f2. No more worker should be executed\n    f2.cancel();\n\n    Automator::wait(100);\n\n    internalSemaphore.release();\n\n    QTRY_COMPARE(semaphoreWorkerFinishedCount, runningCount);\n    Automator::wait(100);\n\n    QCOMPARE(semaphoreWorkerRunningCount, runningCount);\n    QCOMPARE(semaphoreWorkerFinishedCount, runningCount);\n\n}\n\ntemplate <typename Functor, typename Token>\nauto cancellationWrapper(Functor functor, Token token) -> std::function<QFuture<void>()> {\n\n    return [=]() mutable -> QFuture<void> {\n        if (token.isCanceled()) {\n            return token;\n        }\n\n        functor();\n        auto defer = deferred<void>();\n        defer.complete();\n        return defer.future();\n    };\n}\n\nvoid Example::example_CancellationToken()\n{\n    \/\/@TODO - It is over complicated\n    Deferred<void> cancellation = deferred<void>();\n\n    QFuture<void> cancellationToken = cancellation.future();\n\n    Deferred<void> start;\n\n    QList<qreal> sequence;\n    QList<qreal> expectedSquence;\n    expectedSquence << 1 << 1.5;\n\n    auto f1 = start.future();\n\n    auto f2 = observe(f1).subscribe(cancellationWrapper([&]() {\n        sequence << 1;\n    }, cancellationToken)).future();\n\n    observe(f2).subscribe([&]() {\n        sequence << 1.5;\n        cancellation.cancel();\n    });\n\n    auto f3 = observe(f2).subscribe(cancellationWrapper([&]() mutable {\n        sequence << 2;\n    },cancellationToken)).future();\n\n    observe(f3).subscribe(cancellationWrapper([&]() {\n        sequence << 3;\n    }, cancellationToken)).future();\n\n    start.complete();\n    Automator::wait(500);\n\n    QCOMPARE(sequence, expectedSquence);\n\n}\n\nvoid Example::example_Combinator_timeout()\n{\n    QFuture<QString> f1 = QtConcurrent::run(delayedFakeRead, QString(\"input1.txt\"));\n\n    QFuture<QString> f2 = QtConcurrent::run(delayedFakeRead, QString(\"input2.txt\"));\n\n    auto combinator = AsyncFuture::combine();\n    combinator << f1 << f2;\n\n    auto defer = deferred<void>();\n\n    defer.complete(combinator.future());\n    defer.cancel(AsyncFutureUtils::timeout(10));\n\n    auto returningFuture = defer.future();\n\n    await(returningFuture);\n\n    QCOMPARE(returningFuture.isCanceled(), true);\n    QCOMPARE(returningFuture.isFinished(), true);\n\n    QCOMPARE(returningFuture.progressMaximum(), 2);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- SILOpt.cpp - SIL Optimization Driver ------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2015 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 entry point to the swift app.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/Subsystems.h\"\n#include \"swift\/IRGen\/Options.h\"\n#include \"swift\/AST\/AST.h\"\n#include \"swift\/AST\/ASTVisitor.h\"\n#include \"swift\/AST\/Diagnostics.h\"\n#include \"swift\/Parse\/Lexer.h\"\n#include \"swift\/SIL\/SILModule.h\"\n#include \"swift\/Basic\/DiagnosticConsumer.h\"\n#include \"swift\/Frontend\/Frontend.h\"\n#include \"swift\/Frontend\/PrintingDiagnosticConsumer.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Host.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/system_error.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/ToolOutputFile.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/ADT\/Triple.h\"\nusing namespace swift;\n\nenum class PassKind {\n  AllocBoxPromotion,\n  StackToSSA,\n  DataflowDiagnostics\n};\n\nstatic llvm::cl::opt<bool>\nUseMalloc(\"use-malloc\",\n          llvm::cl::desc(\"allocate internal data structures using malloc \"\n                         \"(for memory debugging)\"));\n\nstatic llvm::cl::opt<std::string>\nInputFilename(llvm::cl::desc(\"input file\"), llvm::cl::init(\"-\"),\n              llvm::cl::Positional);\n\nstatic llvm::cl::opt<std::string>\nOutputFilename(\"o\", llvm::cl::desc(\"output filename\"), llvm::cl::init(\"-\"));\n\nstatic llvm::cl::list<std::string>\nImportPaths(\"I\", llvm::cl::desc(\"add a directory to the import search path\"));\n\nstatic llvm::cl::list<PassKind>\nPasses(llvm::cl::desc(\"Passes:\"),\n       llvm::cl::values(clEnumValN(PassKind::AllocBoxPromotion,\n                                   \"allocbox-promotion\", \"Promote memory\"),\n                        clEnumValN(PassKind::StackToSSA,\n                                   \"stacktossa\", \"alloc_stack to SSA\"),\n                        clEnumValN(PassKind::DataflowDiagnostics,\n                                   \"dataflow-diagnostics\",\n                                   \"Emit SIL diagnostics\"),\n                        clEnumValEnd));\n\nstatic llvm::cl::opt<bool>\nPrintStats(\"print-stats\", llvm::cl::desc(\"Print various statistics\"));\n\n\/\/ This function isn't referenced outside its translation unit, but it\n\/\/ can't use the \"static\" keyword because its address is used for\n\/\/ getMainExecutable (since some platforms don't support taking the\n\/\/ address of main, and some platforms can't implement getMainExecutable\n\/\/ without being given the address of a function in the main executable).\nvoid anchorForGetMainExecutable() {}\n\nint main(int argc, char **argv) {\n  \/\/ Print a stack trace if we signal out.\n  llvm::sys::PrintStackTraceOnErrorSignal();\n  llvm::PrettyStackTraceProgram X(argc, argv);\n  \n  llvm::cl::ParseCommandLineOptions(argc, argv, \"Swift SIL optimizer\\n\");\n\n  if (PrintStats)\n    llvm::EnableStatistics();\n\n  llvm::IntrusiveRefCntPtr<CompilerInvocation> Invocation(\n      new CompilerInvocation());\n\n  Invocation->setMainExecutablePath(\n      llvm::sys::fs::getMainExecutable(argv[0],\n          reinterpret_cast<void *>(&anchorForGetMainExecutable)));\n\n  \/\/ Give the context the list of search paths to use for modules.\n  Invocation->setImportSearchPaths(ImportPaths);\n\n  PrintingDiagnosticConsumer PrintDiags;\n  Invocation->addDiagnosticConsumer(&PrintDiags);\n  Invocation->setModuleName(\"main\");\n  Invocation->setTUKind(TranslationUnit::SIL);\n  CompilerInstance CI(Invocation);\n\n  \/\/ Open the input file.\n  llvm::OwningPtr<llvm::MemoryBuffer> InputFile;\n  if (llvm::error_code Err =\n        llvm::MemoryBuffer::getFileOrSTDIN(InputFilename, InputFile)) {\n    llvm::errs() << \"swift: error opening input file: \" << Err.message()\n                 << '\\n';\n    return 1;\n  }\n\n  \/\/ Transfer ownership of the MemoryBuffer to the SourceMgr.\n  CI.addBufferID(CI.getSourceMgr().AddNewSourceBuffer(InputFile.take(),\n                                                      llvm::SMLoc()));\n  CI.setup();\n  CI.doIt();\n\n  for (auto Pass : Passes) {\n    switch (Pass) {\n    case PassKind::AllocBoxPromotion:\n      performSILAllocBoxPromotion(CI.getSILModule());\n      break;\n    case PassKind::StackToSSA:\n      performSILStackToSSA(CI.getSILModule());\n      break;\n    case PassKind::DataflowDiagnostics:\n      emitSILDataflowDiagnostics(CI.getSILModule());\n      break;\n    }\n  }\n\n  std::string ErrorInfo;\n  llvm::raw_fd_ostream OS(OutputFilename.c_str(), ErrorInfo);\n  if (!ErrorInfo.empty()) {\n    llvm::errs() << \"while opening '\" << OutputFilename << \"': \"\n                 << ErrorInfo << '\\n';\n    return 1;\n  }\n  CI.getSILModule()->print(OS);\n\n  \/\/ Print statistics.\n  if (PrintStats)\n    llvm::PrintStatistics(llvm::errs());\n\n  return CI.getASTContext().hadError();\n}\n<commit_msg>tidy this up.<commit_after>\/\/===-- SILOpt.cpp - SIL Optimization Driver ------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2015 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 entry point.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/Subsystems.h\"\n#include \"swift\/Frontend\/Frontend.h\"\n#include \"swift\/Frontend\/PrintingDiagnosticConsumer.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Signals.h\"\nusing namespace swift;\n\nenum class PassKind {\n  AllocBoxPromotion,\n  StackToSSA,\n  DataflowDiagnostics\n};\n\nstatic llvm::cl::opt<std::string>\nInputFilename(llvm::cl::desc(\"input file\"), llvm::cl::init(\"-\"),\n              llvm::cl::Positional);\n\nstatic llvm::cl::opt<std::string>\nOutputFilename(\"o\", llvm::cl::desc(\"output filename\"), llvm::cl::init(\"-\"));\n\nstatic llvm::cl::list<std::string>\nImportPaths(\"I\", llvm::cl::desc(\"add a directory to the import search path\"));\n\nstatic llvm::cl::list<PassKind>\nPasses(llvm::cl::desc(\"Passes:\"),\n       llvm::cl::values(clEnumValN(PassKind::AllocBoxPromotion,\n                                   \"allocbox-promotion\", \"Promote memory\"),\n                        clEnumValN(PassKind::StackToSSA,\n                                   \"stacktossa\", \"alloc_stack to SSA\"),\n                        clEnumValN(PassKind::DataflowDiagnostics,\n                                   \"dataflow-diagnostics\",\n                                   \"Emit SIL diagnostics\"),\n                        clEnumValEnd));\n\nstatic llvm::cl::opt<bool>\nPrintStats(\"print-stats\", llvm::cl::desc(\"Print various statistics\"));\n\n\/\/ This function isn't referenced outside its translation unit, but it\n\/\/ can't use the \"static\" keyword because its address is used for\n\/\/ getMainExecutable (since some platforms don't support taking the\n\/\/ address of main, and some platforms can't implement getMainExecutable\n\/\/ without being given the address of a function in the main executable).\nvoid anchorForGetMainExecutable() {}\n\nint main(int argc, char **argv) {\n  \/\/ Print a stack trace if we signal out.\n  llvm::sys::PrintStackTraceOnErrorSignal();\n  llvm::PrettyStackTraceProgram X(argc, argv);\n  \n  llvm::cl::ParseCommandLineOptions(argc, argv, \"Swift SIL optimizer\\n\");\n\n  if (PrintStats)\n    llvm::EnableStatistics();\n\n  llvm::IntrusiveRefCntPtr<CompilerInvocation> Invocation(\n      new CompilerInvocation());\n\n  Invocation->setMainExecutablePath(\n      llvm::sys::fs::getMainExecutable(argv[0],\n          reinterpret_cast<void *>(&anchorForGetMainExecutable)));\n\n  \/\/ Give the context the list of search paths to use for modules.\n  Invocation->setImportSearchPaths(ImportPaths);\n\n  PrintingDiagnosticConsumer PrintDiags;\n  Invocation->addDiagnosticConsumer(&PrintDiags);\n  Invocation->setModuleName(\"main\");\n  Invocation->setTUKind(TranslationUnit::SIL);\n  CompilerInstance CI(Invocation);\n\n  \/\/ Open the input file.\n  llvm::OwningPtr<llvm::MemoryBuffer> InputFile;\n  if (llvm::error_code Err =\n        llvm::MemoryBuffer::getFileOrSTDIN(InputFilename, InputFile)) {\n    llvm::errs() << \"swift: error opening input file: \" << Err.message()\n                 << '\\n';\n    return 1;\n  }\n\n  \/\/ Transfer ownership of the MemoryBuffer to the SourceMgr.\n  CI.addBufferID(CI.getSourceMgr().AddNewSourceBuffer(InputFile.take(),\n                                                      llvm::SMLoc()));\n  CI.setup();\n  CI.doIt();\n\n  for (auto Pass : Passes) {\n    switch (Pass) {\n    case PassKind::AllocBoxPromotion:\n      performSILAllocBoxPromotion(CI.getSILModule());\n      break;\n    case PassKind::StackToSSA:\n      performSILStackToSSA(CI.getSILModule());\n      break;\n    case PassKind::DataflowDiagnostics:\n      emitSILDataflowDiagnostics(CI.getSILModule());\n      break;\n    }\n  }\n\n  std::string ErrorInfo;\n  llvm::raw_fd_ostream OS(OutputFilename.c_str(), ErrorInfo);\n  if (!ErrorInfo.empty()) {\n    llvm::errs() << \"while opening '\" << OutputFilename << \"': \"\n                 << ErrorInfo << '\\n';\n    return 1;\n  }\n  CI.getSILModule()->print(OS);\n\n  \/\/ Print statistics.\n  if (PrintStats)\n    llvm::PrintStatistics(llvm::errs());\n\n  return CI.getASTContext().hadError();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2010-2012, AOYAMA Kazuharu\n * All rights reserved.\n *\n * This software may be used and distributed according to the terms of\n * the New BSD License, which is incorporated herein by reference.\n *\/\n\n#include <QtCore>\n#include <QSysInfo>\n#include <TWebApplication>\n#include <TSystemGlobal>\n#include \"servermanager.h\"\n#include \"processinfo.h\"\n\n#ifdef Q_OS_UNIX\n# include <sys\/utsname.h>\n#elsif Q_OS_WIN\n# include <stdlib.h>\n#endif\n\nnamespace TreeFrog {\n\n#ifdef Q_OS_WIN\nextern void WINAPI winServiceMain(DWORD argc, LPTSTR *argv);\n#endif\n\nenum CommandOption {\n    Invalid = 0,\n    EnvironmentSpecified,\n    SocketSpecified,\n    PrintVersion,\n    PrintUsage,\n    DaemonMode,\n    WindowsServiceMode,\n    SendSignal,\n};\n\ntypedef QHash<int, QString> VersionHash;\n\n#ifdef Q_OS_WIN\nQ_GLOBAL_STATIC_WITH_INITIALIZER(VersionHash, winVersion,\n{\n    x->insert(QSysInfo::WV_XP,       \"Windows XP\");\n    x->insert(QSysInfo::WV_2003,     \"Windows Server 2003\");\n    x->insert(QSysInfo::WV_VISTA,    \"Windows Vista or Windows Server 2008\");\n    x->insert(QSysInfo::WV_WINDOWS7, \"Windows 7 or Windows Server 2008 R2\");\n})\n#endif\n\n#ifdef Q_OS_DARWIN\nQ_GLOBAL_STATIC_WITH_INITIALIZER(VersionHash, macVersion,\n{\n    x->insert(QSysInfo::MV_10_3, \"Mac OS X 10.3 Panther\");\n    x->insert(QSysInfo::MV_10_4, \"Mac OS X 10.4 Tiger\");\n    x->insert(QSysInfo::MV_10_5, \"Mac OS X 10.5 Leopard\");\n    x->insert(QSysInfo::MV_10_6, \"Mac OS X 10.6 Snow Leopard\");\n#if QT_VERSION >= 0x040800\n    x->insert(QSysInfo::MV_10_7, \"Mac OS X 10.7 Lion\");\n#endif\n})\n#endif\n\ntypedef QHash<QString, int> OptionHash;\nQ_GLOBAL_STATIC_WITH_INITIALIZER(OptionHash, options,\n{\n    x->insert(\"-e\", EnvironmentSpecified);\n    x->insert(\"-s\", SocketSpecified);\n    x->insert(\"-v\", PrintVersion);\n    x->insert(\"-h\", PrintUsage);\n    x->insert(\"-d\", DaemonMode);\n    x->insert(\"-w\", WindowsServiceMode);\n    x->insert(\"-k\", SendSignal);\n})\n\n\nstatic void usage()\n{\n    char text[] =\n        \"Usage: %1 [-d] [-e environment] [application-directory]\\n\"     \\\n        \"Usage: %1 [-k stop|abort] [application-directory]\\n\"           \\\n        \"Options:\\n\"                                                    \\\n        \"  -d              : run as a daemon process\\n\"                 \\\n        \"  -e environment  : specify an environment of the database settings\\n\" \\\n        \"  -k              : send signal to a manager process\\n\\n\"      \\\n        \"Type '%1 -h' to show this information.\\n\"                      \\\n        \"Type '%1 -v' to show the program version.\";\n    \n    QString cmd = QFileInfo(QCoreApplication::applicationFilePath()).fileName();\n    puts(qPrintable(QString(text).arg(cmd)));\n}\n\n\nstatic bool checkArguments()\n{\n    for (QStringListIterator i(QCoreApplication::arguments()); i.hasNext(); ) {\n        const QString &arg = i.next();\n        if (arg.startsWith('-') && options()->value(arg, Invalid) == Invalid) {\n            fprintf(stderr, \"invalid argument\\n\");\n            return false;\n        }\n    }\n    return true;\n}\n\n\nstatic bool startDaemon()\n{\n    bool success;\n    QStringList args = QCoreApplication::arguments();\n    args.removeAll(\"-d\");\n#ifdef Q_OS_WIN\n    PROCESS_INFORMATION pinfo;\n    STARTUPINFOW startupInfo = { sizeof(STARTUPINFO), 0, 0, 0,\n                                 (ulong)CW_USEDEFAULT, (ulong)CW_USEDEFAULT,\n                                 (ulong)CW_USEDEFAULT, (ulong)CW_USEDEFAULT,\n                                 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\n    };\n    success = CreateProcess(0, (wchar_t*)args.join(\" \").utf16(),\n                            0, 0, FALSE, CREATE_UNICODE_ENVIRONMENT, 0,\n                            (wchar_t*)QDir::currentPath().utf16(),\n                            &startupInfo, &pinfo);\n    if (success) {\n        CloseHandle(pinfo.hThread);\n        CloseHandle(pinfo.hProcess);\n    }\n#else\n    args.removeFirst();  \/\/ Removes the program name\n    success = QProcess::startDetached(QCoreApplication::applicationFilePath(), args, QDir::currentPath());\n#endif\n\n    return success;\n}\n\n\nstatic void writeStartupLog()\n{\n    tSystemInfo(\"TreeFrog Framework version \" TF_VERSION_STR);\n\n    QString qtversion = \"Qt \" QT_VERSION_STR;\n#if defined(Q_OS_WIN)\n    qtversion += QLatin1String(\" \/ \") + winVersion()->value(QSysInfo::WindowsVersion, \"Windows\");\n#elif defined(Q_OS_DARWIN)\n    qtversion += QLatin1String(\" \/ \") + macVersion()->value(QSysInfo::MacintoshVersion, \"Mac OS X\");\n#elif defined(Q_OS_UNIX)\n    struct utsname uts;\n    if (uname(&uts) == 0) {\n        qtversion += QString(\" \/ %1 %2\").arg(uts.sysname).arg(uts.release);\n    }\n#endif\n    tSystemInfo(\"%s\", qtversion.toLatin1().data()); \n}\n\n\nstatic QString pidFilePath()\n{\n    QString base = QFileInfo(QCoreApplication::applicationFilePath()).baseName();\n    return Tf::app()->tmpPath() + base + \".pid\";\n}\n\n\nstatic qint64 readPidFileOfApplication()\n{\n    QFile pidf(pidFilePath());\n    if (pidf.open(QIODevice::ReadOnly)) {\n        qint64 pid = pidf.readLine(100).toLongLong();\n        if (pid > 0) {\n            return pid;\n        }\n    }\n    return -1;\n}\n\n\nstatic qint64 runningApplicationPid()\n{\n    qint64 pid = readPidFileOfApplication();\n    if (pid > 0) {\n        QString name = ProcessInfo(pid).processName().toLower();\n        if (name == \"treefrog\" || name == \"treefrogd\")\n            return pid;\n    }\n    return -1;\n}\n\n\nstatic int killTreeFrogProcess(const QString &cmd)\n{\n    qint64 pid = runningApplicationPid();\n    if (pid < 0) {\n        printf(\"TreeFrog server not running\\n\");\n        return 1;\n    }\n\n    ProcessInfo pi(pid);\n\n    if (cmd == \"stop\") {  \/\/ stop command\n        pi.terminate();\n        if (pi.waitForTerminated()) {\n            printf(\"TreeFrog application servers shutdown completed\\n\");\n        } else {\n            fprintf(stderr, \"TreeFrog application servers shutdown failed\\n\");\n        }\n\n    } else if (cmd == \"abort\") {  \/\/ abort command\n        pi.kill();\n        tSystemInfo(\"Killed TreeFrog manager process  pid:%ld\", (long)pid);\n        ::unlink(pidFilePath().toLatin1().data());\n\n        \/\/ kill all 'tadpole' processes\n#if defined(Q_OS_WIN) && !defined(TF_NO_DEBUG)\n        ProcessInfo::killProcesses(\"tadpoled\");\n#else\n        ProcessInfo::killProcesses(\"tadpole\");\n#endif\n        tSystemInfo(\"Killed TreeFrog application server processes\");\n        printf(\"Killed TreeFrog application server processes\\n\");\n\n    } else if (cmd == \"restart\") {  \/\/ restart command\n        pi.restart();\n        printf(\"Sent a restart request\\n\");\n\n    } else {\n        usage();\n        return 1;\n    }\n    return 0;\n}\n\n\nint managerMain(int argc, char *argv[])\n{\n    TWebApplication app(argc, argv);\n\n    \/\/ Creates the semaphore for system log\n    QSystemSemaphore semaphore(\"TreeFrogSystemLog\", 1, QSystemSemaphore::Create);\n    tSetupSystemLoggers();\n\n#if defined(Q_OS_UNIX)\n    app.watchUnixSignal(SIGTERM);\n    app.watchUnixSignal(SIGINT);\n    app.watchUnixSignal(SIGHUP);\n#elif defined(Q_OS_WIN)\n    app.watchConsoleSignal();\n#endif\n\n    \/\/ Sets codec\n    QTextCodec *codec = QTextCodec::codecForName(\"UTF-8\");\n    QTextCodec::setCodecForLocale(codec);\n    \n    if (!checkArguments()) {\n        return 1;\n    }\n\n    bool daemonMode = false;\n    QString signalCmd;\n\n    QStringList args = QCoreApplication::arguments();\n    args.removeFirst();\n    for (QStringListIterator i(args); i.hasNext(); ) {\n        const QString &arg = i.next();\n        int cmd = options()->value(arg, Invalid);\n        switch (cmd) {\n        case PrintVersion:\n            printf(\"%s version \" TF_VERSION_STR \" (r%d) (built on %s)\\n\", qPrintable(QFileInfo(argv[0]).baseName()), TF_SRC_REVISION, __DATE__);\n            return 0;\n            break;\n\n        case PrintUsage:\n            usage();\n            return 0;\n            break;\n\n        case DaemonMode:\n            daemonMode = true;\n            break;\n\n        case WindowsServiceMode:\n            \/\/ ignore\n            break;\n\n        case SendSignal:\n            signalCmd = i.next(); \/\/ assign a command\n            break;\n\n        default:\n            \/\/ do nothing\n            break;\n        }\n    }\n\n    if (!app.appSettingsFileExists()) {\n        fprintf(stderr, \"INI file not found [%s]\\n\\n\", qPrintable(app.appSettingsFilePath()));\n        return 1;\n    }\n\n    if (!signalCmd.isEmpty()) {\n        return killTreeFrogProcess(signalCmd);\n    }\n\n    \/\/ Check TreeFrog processes are running\n    qint64 pid = runningApplicationPid();\n    if (pid > 0) {\n        fprintf(stderr, \"Already running  pid:%ld\\n\", (long)pid);\n        return 1;\n    }\n\n    if (!app.isValidDatabaseSettings()) {\n        tSystemError(\"Database settings not found  [environment: %s]\", qPrintable(app.databaseEnvironment()));\n        fprintf(stderr, \"database settings not found  [environment: %s]\\n\\n\", qPrintable(app.databaseEnvironment()));\n        usage();\n        return 1;\n    }\n\n    \/\/ Check a port number\n    quint16 listenPort = 0;\n    QString svrname = app.appSettings().value(\"ListenPort\").toString();\n    if (svrname.startsWith(\"unix:\", Qt::CaseInsensitive)) {\n        svrname.remove(0, 5);\n    } else {\n        int port = svrname.toInt();\n        if (port <= 0 || port > USHRT_MAX) {\n            tSystemError(\"Invalid port number: %d\", port);\n            return 1;\n        }\n        listenPort = port;\n        svrname.clear();\n    }\n\n    \/\/ start daemon process\n    if (daemonMode) {\n        if ( !startDaemon() ) {\n            fprintf(stderr, \"Failed to create process\\n\\n\");\n            return 1;\n        }\n        return 0;\n    }\n\n    int ret = 0;\n    QFile pidfile;\n    \n    for (;;) {\n        ServerManager *manager = 0;\n        switch ( app.multiProcessingModule() ) {\n        case TWebApplication::Thread: {\n            manager = new ServerManager(1, 1, 0, &app);\n            break; }\n            \n        case TWebApplication::Prefork: {\n            int max = app.appSettings().value(\"MPM.prefork.MaxServers\").toInt();\n            int min = app.appSettings().value(\"MPM.prefork.MinServers\").toInt();\n            int spare = app.appSettings().value(\"MPM.prefork.SpareServers\").toInt();\n            manager = new ServerManager(max, min, spare, &app);\n            break; }\n            \n        default:\n            tSystemError(\"Invalid MPM specified\");\n            return 1;\n        }\n        \n        \/\/ Startup\n        writeStartupLog();\n        bool started;\n        if (listenPort > 0) {\n            \/\/ TCP\/IP\n            started = manager->start(QHostAddress::Any, listenPort);\n        } else {\n            \/\/ UNIX domain\n            started = manager->start(svrname);\n        }\n        \n        if (!started) {\n            tSystemError(\"TreeFrog application server startup failed\");\n            fprintf(stderr, \"TreeFrog application server startup failed\\n\\n\");\n            return 1;\n        }\n        \n        \/\/ tmp directory\n        QDir tmpDir(app.tmpPath());\n        if (!tmpDir.exists()) {\n            tmpDir.mkpath(\".\");\n        }\n        \n        \/\/ Writes the PID\n        pidfile.setFileName(pidFilePath());\n        if (pidfile.open(QIODevice::WriteOnly | QIODevice::Truncate)) {\n            pid = QCoreApplication::applicationPid();\n            pidfile.write( QString::number(pid).toLatin1() );\n            pidfile.close();\n        } else {\n            tSystemError(\"File open failed: %s\", qPrintable(pidfile.fileName()));\n        }\n        \n        ret = app.exec();\n        tSystemDebug(\"tfmanager returnCode:%d\", ret);\n        manager->stop();\n        \n        if (ret == 1) {  \/\/ means SIGHUP\n            tSystemDebug(\"Restarts TreeFrog application servers\");\n            \/\/continue;\n        } else {\n            break;\n        }\n    }\n    \n    if (!svrname.isEmpty()) {  \/\/ UNIX domain file\n        QFile(svrname).remove();\n    }\n    pidfile.remove();  \/\/ Removes the PID file\n    return 0;\n}\n\n} \/\/ namespace TreeFrog\n\n\nint main(int argc, char *argv[])\n{\n#ifdef Q_OS_WIN\n    for (int i = 1; i < argc; ++i) {\n        if (strcmp(argv[i], \"-w\") == 0) {\n            \/\/ Windows service mode\n            SERVICE_TABLE_ENTRY entry[] = { { (LPTSTR)TEXT(\"\"), TreeFrog::winServiceMain }, { 0, 0 } };\n            StartServiceCtrlDispatcher(entry);\n            return 0;\n        }\n    }\n#endif\n    return TreeFrog::managerMain(argc, argv);\n}\n<commit_msg>Deleted unnecessary codes.<commit_after>\/* Copyright (c) 2010-2012, AOYAMA Kazuharu\n * All rights reserved.\n *\n * This software may be used and distributed according to the terms of\n * the New BSD License, which is incorporated herein by reference.\n *\/\n\n#include <QtCore>\n#include <QSysInfo>\n#include <TWebApplication>\n#include <TSystemGlobal>\n#include \"servermanager.h\"\n#include \"processinfo.h\"\n\n#ifdef Q_OS_UNIX\n# include <sys\/utsname.h>\n#endif\n\nnamespace TreeFrog {\n\n#ifdef Q_OS_WIN\nextern void WINAPI winServiceMain(DWORD argc, LPTSTR *argv);\n#endif\n\nenum CommandOption {\n    Invalid = 0,\n    EnvironmentSpecified,\n    SocketSpecified,\n    PrintVersion,\n    PrintUsage,\n    DaemonMode,\n    WindowsServiceMode,\n    SendSignal,\n};\n\ntypedef QHash<int, QString> VersionHash;\n\n#ifdef Q_OS_WIN\nQ_GLOBAL_STATIC_WITH_INITIALIZER(VersionHash, winVersion,\n{\n    x->insert(QSysInfo::WV_XP,       \"Windows XP\");\n    x->insert(QSysInfo::WV_2003,     \"Windows Server 2003\");\n    x->insert(QSysInfo::WV_VISTA,    \"Windows Vista or Windows Server 2008\");\n    x->insert(QSysInfo::WV_WINDOWS7, \"Windows 7 or Windows Server 2008 R2\");\n})\n#endif\n\n#ifdef Q_OS_DARWIN\nQ_GLOBAL_STATIC_WITH_INITIALIZER(VersionHash, macVersion,\n{\n    x->insert(QSysInfo::MV_10_3, \"Mac OS X 10.3 Panther\");\n    x->insert(QSysInfo::MV_10_4, \"Mac OS X 10.4 Tiger\");\n    x->insert(QSysInfo::MV_10_5, \"Mac OS X 10.5 Leopard\");\n    x->insert(QSysInfo::MV_10_6, \"Mac OS X 10.6 Snow Leopard\");\n#if QT_VERSION >= 0x040800\n    x->insert(QSysInfo::MV_10_7, \"Mac OS X 10.7 Lion\");\n#endif\n})\n#endif\n\ntypedef QHash<QString, int> OptionHash;\nQ_GLOBAL_STATIC_WITH_INITIALIZER(OptionHash, options,\n{\n    x->insert(\"-e\", EnvironmentSpecified);\n    x->insert(\"-s\", SocketSpecified);\n    x->insert(\"-v\", PrintVersion);\n    x->insert(\"-h\", PrintUsage);\n    x->insert(\"-d\", DaemonMode);\n    x->insert(\"-w\", WindowsServiceMode);\n    x->insert(\"-k\", SendSignal);\n})\n\n\nstatic void usage()\n{\n    char text[] =\n        \"Usage: %1 [-d] [-e environment] [application-directory]\\n\"     \\\n        \"Usage: %1 [-k stop|abort] [application-directory]\\n\"           \\\n        \"Options:\\n\"                                                    \\\n        \"  -d              : run as a daemon process\\n\"                 \\\n        \"  -e environment  : specify an environment of the database settings\\n\" \\\n        \"  -k              : send signal to a manager process\\n\\n\"      \\\n        \"Type '%1 -h' to show this information.\\n\"                      \\\n        \"Type '%1 -v' to show the program version.\";\n    \n    QString cmd = QFileInfo(QCoreApplication::applicationFilePath()).fileName();\n    puts(qPrintable(QString(text).arg(cmd)));\n}\n\n\nstatic bool checkArguments()\n{\n    for (QStringListIterator i(QCoreApplication::arguments()); i.hasNext(); ) {\n        const QString &arg = i.next();\n        if (arg.startsWith('-') && options()->value(arg, Invalid) == Invalid) {\n            fprintf(stderr, \"invalid argument\\n\");\n            return false;\n        }\n    }\n    return true;\n}\n\n\nstatic bool startDaemon()\n{\n    bool success;\n    QStringList args = QCoreApplication::arguments();\n    args.removeAll(\"-d\");\n#ifdef Q_OS_WIN\n    PROCESS_INFORMATION pinfo;\n    STARTUPINFOW startupInfo = { sizeof(STARTUPINFO), 0, 0, 0,\n                                 (ulong)CW_USEDEFAULT, (ulong)CW_USEDEFAULT,\n                                 (ulong)CW_USEDEFAULT, (ulong)CW_USEDEFAULT,\n                                 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\n    };\n    success = CreateProcess(0, (wchar_t*)args.join(\" \").utf16(),\n                            0, 0, FALSE, CREATE_UNICODE_ENVIRONMENT, 0,\n                            (wchar_t*)QDir::currentPath().utf16(),\n                            &startupInfo, &pinfo);\n    if (success) {\n        CloseHandle(pinfo.hThread);\n        CloseHandle(pinfo.hProcess);\n    }\n#else\n    args.removeFirst();  \/\/ Removes the program name\n    success = QProcess::startDetached(QCoreApplication::applicationFilePath(), args, QDir::currentPath());\n#endif\n\n    return success;\n}\n\n\nstatic void writeStartupLog()\n{\n    tSystemInfo(\"TreeFrog Framework version \" TF_VERSION_STR);\n\n    QString qtversion = \"Qt \" QT_VERSION_STR;\n#if defined(Q_OS_WIN)\n    qtversion += QLatin1String(\" \/ \") + winVersion()->value(QSysInfo::WindowsVersion, \"Windows\");\n#elif defined(Q_OS_DARWIN)\n    qtversion += QLatin1String(\" \/ \") + macVersion()->value(QSysInfo::MacintoshVersion, \"Mac OS X\");\n#elif defined(Q_OS_UNIX)\n    struct utsname uts;\n    if (uname(&uts) == 0) {\n        qtversion += QString(\" \/ %1 %2\").arg(uts.sysname).arg(uts.release);\n    }\n#endif\n    tSystemInfo(\"%s\", qtversion.toLatin1().data()); \n}\n\n\nstatic QString pidFilePath()\n{\n    QString base = QFileInfo(QCoreApplication::applicationFilePath()).baseName();\n    return Tf::app()->tmpPath() + base + \".pid\";\n}\n\n\nstatic qint64 readPidFileOfApplication()\n{\n    QFile pidf(pidFilePath());\n    if (pidf.open(QIODevice::ReadOnly)) {\n        qint64 pid = pidf.readLine(100).toLongLong();\n        if (pid > 0) {\n            return pid;\n        }\n    }\n    return -1;\n}\n\n\nstatic qint64 runningApplicationPid()\n{\n    qint64 pid = readPidFileOfApplication();\n    if (pid > 0) {\n        QString name = ProcessInfo(pid).processName().toLower();\n        if (name == \"treefrog\" || name == \"treefrogd\")\n            return pid;\n    }\n    return -1;\n}\n\n\nstatic int killTreeFrogProcess(const QString &cmd)\n{\n    qint64 pid = runningApplicationPid();\n    if (pid < 0) {\n        printf(\"TreeFrog server not running\\n\");\n        return 1;\n    }\n\n    ProcessInfo pi(pid);\n\n    if (cmd == \"stop\") {  \/\/ stop command\n        pi.terminate();\n        if (pi.waitForTerminated()) {\n            printf(\"TreeFrog application servers shutdown completed\\n\");\n        } else {\n            fprintf(stderr, \"TreeFrog application servers shutdown failed\\n\");\n        }\n\n    } else if (cmd == \"abort\") {  \/\/ abort command\n        pi.kill();\n        tSystemInfo(\"Killed TreeFrog manager process  pid:%ld\", (long)pid);\n        ::unlink(pidFilePath().toLatin1().data());\n\n        \/\/ kill all 'tadpole' processes\n#if defined(Q_OS_WIN) && !defined(TF_NO_DEBUG)\n        ProcessInfo::killProcesses(\"tadpoled\");\n#else\n        ProcessInfo::killProcesses(\"tadpole\");\n#endif\n        tSystemInfo(\"Killed TreeFrog application server processes\");\n        printf(\"Killed TreeFrog application server processes\\n\");\n\n    } else if (cmd == \"restart\") {  \/\/ restart command\n        pi.restart();\n        printf(\"Sent a restart request\\n\");\n\n    } else {\n        usage();\n        return 1;\n    }\n    return 0;\n}\n\n\nint managerMain(int argc, char *argv[])\n{\n    TWebApplication app(argc, argv);\n\n    \/\/ Creates the semaphore for system log\n    QSystemSemaphore semaphore(\"TreeFrogSystemLog\", 1, QSystemSemaphore::Create);\n    tSetupSystemLoggers();\n\n#if defined(Q_OS_UNIX)\n    app.watchUnixSignal(SIGTERM);\n    app.watchUnixSignal(SIGINT);\n    app.watchUnixSignal(SIGHUP);\n#elif defined(Q_OS_WIN)\n    app.watchConsoleSignal();\n#endif\n\n    \/\/ Sets codec\n    QTextCodec *codec = QTextCodec::codecForName(\"UTF-8\");\n    QTextCodec::setCodecForLocale(codec);\n    \n    if (!checkArguments()) {\n        return 1;\n    }\n\n    bool daemonMode = false;\n    QString signalCmd;\n\n    QStringList args = QCoreApplication::arguments();\n    args.removeFirst();\n    for (QStringListIterator i(args); i.hasNext(); ) {\n        const QString &arg = i.next();\n        int cmd = options()->value(arg, Invalid);\n        switch (cmd) {\n        case PrintVersion:\n            printf(\"%s version \" TF_VERSION_STR \" (r%d) (built on %s)\\n\", qPrintable(QFileInfo(argv[0]).baseName()), TF_SRC_REVISION, __DATE__);\n            return 0;\n            break;\n\n        case PrintUsage:\n            usage();\n            return 0;\n            break;\n\n        case DaemonMode:\n            daemonMode = true;\n            break;\n\n        case WindowsServiceMode:\n            \/\/ ignore\n            break;\n\n        case SendSignal:\n            signalCmd = i.next(); \/\/ assign a command\n            break;\n\n        default:\n            \/\/ do nothing\n            break;\n        }\n    }\n\n    if (!app.appSettingsFileExists()) {\n        fprintf(stderr, \"INI file not found [%s]\\n\\n\", qPrintable(app.appSettingsFilePath()));\n        return 1;\n    }\n\n    if (!signalCmd.isEmpty()) {\n        return killTreeFrogProcess(signalCmd);\n    }\n\n    \/\/ Check TreeFrog processes are running\n    qint64 pid = runningApplicationPid();\n    if (pid > 0) {\n        fprintf(stderr, \"Already running  pid:%ld\\n\", (long)pid);\n        return 1;\n    }\n\n    if (!app.isValidDatabaseSettings()) {\n        tSystemError(\"Database settings not found  [environment: %s]\", qPrintable(app.databaseEnvironment()));\n        fprintf(stderr, \"database settings not found  [environment: %s]\\n\\n\", qPrintable(app.databaseEnvironment()));\n        usage();\n        return 1;\n    }\n\n    \/\/ Check a port number\n    quint16 listenPort = 0;\n    QString svrname = app.appSettings().value(\"ListenPort\").toString();\n    if (svrname.startsWith(\"unix:\", Qt::CaseInsensitive)) {\n        svrname.remove(0, 5);\n    } else {\n        int port = svrname.toInt();\n        if (port <= 0 || port > USHRT_MAX) {\n            tSystemError(\"Invalid port number: %d\", port);\n            return 1;\n        }\n        listenPort = port;\n        svrname.clear();\n    }\n\n    \/\/ start daemon process\n    if (daemonMode) {\n        if ( !startDaemon() ) {\n            fprintf(stderr, \"Failed to create process\\n\\n\");\n            return 1;\n        }\n        return 0;\n    }\n\n    int ret = 0;\n    QFile pidfile;\n    \n    for (;;) {\n        ServerManager *manager = 0;\n        switch ( app.multiProcessingModule() ) {\n        case TWebApplication::Thread: {\n            manager = new ServerManager(1, 1, 0, &app);\n            break; }\n            \n        case TWebApplication::Prefork: {\n            int max = app.appSettings().value(\"MPM.prefork.MaxServers\").toInt();\n            int min = app.appSettings().value(\"MPM.prefork.MinServers\").toInt();\n            int spare = app.appSettings().value(\"MPM.prefork.SpareServers\").toInt();\n            manager = new ServerManager(max, min, spare, &app);\n            break; }\n            \n        default:\n            tSystemError(\"Invalid MPM specified\");\n            return 1;\n        }\n        \n        \/\/ Startup\n        writeStartupLog();\n        bool started;\n        if (listenPort > 0) {\n            \/\/ TCP\/IP\n            started = manager->start(QHostAddress::Any, listenPort);\n        } else {\n            \/\/ UNIX domain\n            started = manager->start(svrname);\n        }\n        \n        if (!started) {\n            tSystemError(\"TreeFrog application server startup failed\");\n            fprintf(stderr, \"TreeFrog application server startup failed\\n\\n\");\n            return 1;\n        }\n        \n        \/\/ tmp directory\n        QDir tmpDir(app.tmpPath());\n        if (!tmpDir.exists()) {\n            tmpDir.mkpath(\".\");\n        }\n        \n        \/\/ Writes the PID\n        pidfile.setFileName(pidFilePath());\n        if (pidfile.open(QIODevice::WriteOnly | QIODevice::Truncate)) {\n            pid = QCoreApplication::applicationPid();\n            pidfile.write( QString::number(pid).toLatin1() );\n            pidfile.close();\n        } else {\n            tSystemError(\"File open failed: %s\", qPrintable(pidfile.fileName()));\n        }\n        \n        ret = app.exec();\n        tSystemDebug(\"tfmanager returnCode:%d\", ret);\n        manager->stop();\n        \n        if (ret == 1) {  \/\/ means SIGHUP\n            tSystemDebug(\"Restarts TreeFrog application servers\");\n            \/\/continue;\n        } else {\n            break;\n        }\n    }\n    \n    if (!svrname.isEmpty()) {  \/\/ UNIX domain file\n        QFile(svrname).remove();\n    }\n    pidfile.remove();  \/\/ Removes the PID file\n    return 0;\n}\n\n} \/\/ namespace TreeFrog\n\n\nint main(int argc, char *argv[])\n{\n#ifdef Q_OS_WIN\n    for (int i = 1; i < argc; ++i) {\n        if (strcmp(argv[i], \"-w\") == 0) {\n            \/\/ Windows service mode\n            SERVICE_TABLE_ENTRY entry[] = { { (LPTSTR)TEXT(\"\"), TreeFrog::winServiceMain }, { 0, 0 } };\n            StartServiceCtrlDispatcher(entry);\n            return 0;\n        }\n    }\n#endif\n    return TreeFrog::managerMain(argc, argv);\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\/google_authenticator.h\"\n\n#include <string>\n#include <vector>\n\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/path_service.h\"\n#include \"base\/sha2.h\"\n#include \"base\/string_util.h\"\n#include \"base\/third_party\/nss\/blapi.h\"\n#include \"base\/third_party\/nss\/sha256.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/browser\/chromeos\/cros\/cryptohome_library.h\"\n#include \"chrome\/browser\/chromeos\/login\/auth_response_handler.h\"\n#include \"chrome\/browser\/chromeos\/login\/authentication_notification_details.h\"\n#include \"chrome\/browser\/chromeos\/login\/login_status_consumer.h\"\n#include \"chrome\/browser\/net\/chrome_url_request_context.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/net\/url_fetcher.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"net\/base\/load_flags.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/url_request\/url_request_status.h\"\n#include \"third_party\/libjingle\/source\/talk\/base\/urlencode.h\"\n\nusing base::Time;\nusing base::TimeDelta;\nusing file_util::GetFileSize;\nusing file_util::PathExists;\nusing file_util::ReadFile;\nusing file_util::ReadFileToString;\n\nnamespace chromeos {\n\n\/\/ static\nconst char GoogleAuthenticator::kCookiePersistence[] = \"true\";\n\/\/ static\nconst char GoogleAuthenticator::kAccountType[] = \"HOSTED_OR_GOOGLE\";\n\/\/ static\nconst char GoogleAuthenticator::kSource[] = \"chromeos\";\n\/\/ static\n\/\/ Service name for Google Contacts API. API is used to get user's image.\nconst char GoogleAuthenticator::kService[] = \"cp\";\n\/\/ static\nconst char GoogleAuthenticator::kFormat[] =\n    \"Email=%s&\"\n    \"Passwd=%s&\"\n    \"PersistentCookie=%s&\"\n    \"accountType=%s&\"\n    \"source=%s&\"\n    \"service=%s\";\n\/\/ static\nconst char GoogleAuthenticator::kFormatCaptcha[] =\n    \"Email=%s&\"\n    \"Passwd=%s&\"\n    \"PersistentCookie=%s&\"\n    \"accountType=%s&\"\n    \"source=%s&\"\n    \"service=%s&\"\n    \"logintoken=%s&\"\n    \"logincaptcha=%s\";\n\/\/ static\nconst char GoogleAuthenticator::kSecondFactor[] = \"Info=InvalidSecondFactor\";\n\n\/\/ static\nconst char GoogleAuthenticator::kSystemSalt[] = \"\/home\/.shadow\/salt\";\n\/\/ static\nconst char GoogleAuthenticator::kOpenSSLMagic[] = \"Salted__\";\n\/\/ static\nconst char GoogleAuthenticator::kLocalaccountFile[] = \"localaccount\";\n\/\/ static\nconst char GoogleAuthenticator::kTmpfsTrigger[] = \"incognito\";\n\n\/\/ static\nconst int GoogleAuthenticator::kClientLoginTimeoutMs = 5000;\n\nconst int kPassHashLen = 32;\n\nGoogleAuthenticator::GoogleAuthenticator(LoginStatusConsumer* consumer)\n    : Authenticator(consumer),\n      fetcher_(NULL),\n      getter_(NULL),\n      checked_for_localaccount_(false),\n      unlock_(false),\n      try_again_(true),\n      fetch_completed_(false) {\n  CHECK(chromeos::CrosLibrary::Get()->EnsureLoaded());\n}\n\nGoogleAuthenticator::~GoogleAuthenticator() {\n  delete fetcher_;\n}\n\n\/\/ static\nURLFetcher* GoogleAuthenticator::CreateClientLoginFetcher(\n    URLRequestContextGetter* getter,\n    const std::string& body,\n    URLFetcher::Delegate* delegate) {\n  URLFetcher* to_return =\n      URLFetcher::Create(0,\n                         GURL(AuthResponseHandler::kClientLoginUrl),\n                         URLFetcher::POST,\n                         delegate);\n  to_return->set_request_context(getter);\n  to_return->set_load_flags(net::LOAD_DO_NOT_SEND_COOKIES);\n  to_return->set_upload_data(\"application\/x-www-form-urlencoded\", body);\n  return to_return;\n}\n\nbool GoogleAuthenticator::AuthenticateToLogin(\n    Profile* profile,\n    const std::string& username,\n    const std::string& password,\n    const std::string& login_token,\n    const std::string& login_captcha) {\n  unlock_ = false;\n  getter_ = profile->GetRequestContext();\n\n  \/\/ TODO(cmasone): be more careful about zeroing memory that stores\n  \/\/ the user's password.\n  if (login_token.empty() || login_captcha.empty()) {\n    request_body_ = StringPrintf(kFormat,\n                                 UrlEncodeString(username).c_str(),\n                                 UrlEncodeString(password).c_str(),\n                                 kCookiePersistence,\n                                 kAccountType,\n                                 kSource,\n                                 kService);\n  } else {\n    request_body_ = StringPrintf(kFormatCaptcha,\n                                 UrlEncodeString(username).c_str(),\n                                 UrlEncodeString(password).c_str(),\n                                 kCookiePersistence,\n                                 kAccountType,\n                                 kSource,\n                                 kService,\n                                 UrlEncodeString(login_token).c_str(),\n                                 UrlEncodeString(login_captcha).c_str());\n  }\n  \/\/ TODO(cmasone): Figure out how to parallelize fetch, username\/password\n  \/\/ processing without impacting testability.\n  username_.assign(Canonicalize(username));\n  StoreHashedPassword(password);\n  TryClientLogin();\n  return true;\n}\n\nbool GoogleAuthenticator::AuthenticateToUnlock(const std::string& username,\n                                               const std::string& password) {\n  username_.assign(Canonicalize(username));\n  StoreHashedPassword(password);\n  unlock_ = true;\n  ChromeThread::PostTask(\n      ChromeThread::UI, FROM_HERE,\n      NewRunnableMethod(this, &GoogleAuthenticator::CheckOffline,\n                        std::string(\"unlock failed\")));\n  return true;\n}\n\nvoid GoogleAuthenticator::LoginOffTheRecord() {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::UI));\n  if (CrosLibrary::Get()->GetCryptohomeLibrary()->Mount(kTmpfsTrigger, \"\")) {\n    AuthenticationNotificationDetails details(true);\n    NotificationService::current()->Notify(\n        NotificationType::LOGIN_AUTHENTICATION,\n        NotificationService::AllSources(),\n        Details<AuthenticationNotificationDetails>(&details));\n    consumer_->OnOffTheRecordLoginSuccess();\n  } else {\n    consumer_->OnLoginFailure(\"Could not mount tmpfs cryptohome\");\n  }\n}\n\nvoid GoogleAuthenticator::OnURLFetchComplete(const URLFetcher* source,\n                                             const GURL& url,\n                                             const URLRequestStatus& status,\n                                             int response_code,\n                                             const ResponseCookies& cookies,\n                                             const std::string& data) {\n  fetch_completed_ = true;\n  if (status.is_success() && response_code == kHttpSuccess) {\n    LOG(INFO) << \"Online login successful!\";\n    ChromeThread::PostTask(\n        ChromeThread::UI, FROM_HERE,\n        NewRunnableMethod(this, &GoogleAuthenticator::OnLoginSuccess, data));\n  } else if (!status.is_success()) {\n    if (status.status() == URLRequestStatus::CANCELED) {\n      if (try_again_) {\n        try_again_ = false;\n        LOG(ERROR) << \"Login attempt canceled!?!?  Trying again.\";\n        TryClientLogin();\n        fetch_completed_ = false;\n        return;\n      }\n      LOG(ERROR) << \"Login attempt canceled again?  Already retried...\";\n    }\n    LOG(WARNING) << \"Could not reach Google Accounts servers: errno \"\n              << status.os_error();\n    \/\/ The fetch failed for network reasons, try offline login.\n    LoadLocalaccount(kLocalaccountFile);\n    ChromeThread::PostTask(\n        ChromeThread::UI, FROM_HERE,\n        NewRunnableMethod(this, &GoogleAuthenticator::CheckOffline,\n                          net::ErrorToString(status.os_error())));\n  } else {\n    if (IsSecondFactorSuccess(data)) {\n      ChromeThread::PostTask(\n          ChromeThread::UI, FROM_HERE,\n          NewRunnableMethod(this,\n                            &GoogleAuthenticator::OnLoginSuccess,\n                            std::string()));\n    } else {\n      \/\/ The fetch succeeded, but ClientLogin said no.\n      LoadLocalaccount(kLocalaccountFile);\n      ChromeThread::PostTask(\n          ChromeThread::UI, FROM_HERE,\n          NewRunnableMethod(this,\n                            &GoogleAuthenticator::CheckLocalaccount,\n                            data));\n    }\n  }\n}\n\nvoid GoogleAuthenticator::OnLoginSuccess(const std::string& data) {\n  \/\/ Send notification of success\n  AuthenticationNotificationDetails details(true);\n  NotificationService::current()->Notify(\n      NotificationType::LOGIN_AUTHENTICATION,\n      NotificationService::AllSources(),\n      Details<AuthenticationNotificationDetails>(&details));\n\n  if (unlock_ ||\n      CrosLibrary::Get()->GetCryptohomeLibrary()->Mount(username_.c_str(),\n                                                        ascii_hash_.c_str())) {\n    consumer_->OnLoginSuccess(username_, data);\n  } else {\n    OnLoginFailure(\"Could not mount cryptohome\");\n  }\n}\n\nvoid GoogleAuthenticator::CheckOffline(const std::string& error) {\n  LOG(INFO) << \"Attempting offline login\";\n  if (CrosLibrary::Get()->GetCryptohomeLibrary()->CheckKey(\n          username_.c_str(),\n          ascii_hash_.c_str())) {\n    \/\/ The fetch didn't succeed, but offline login did.\n    LOG(INFO) << \"Offline login successful!\";\n    OnLoginSuccess(std::string());\n  } else {\n    \/\/ We couldn't hit the network, and offline login failed.\n    GoogleAuthenticator::CheckLocalaccount(error);\n  }\n}\n\nvoid GoogleAuthenticator::CheckLocalaccount(const std::string& error) {\n  if (!localaccount_.empty() && localaccount_ == username_ &&\n      CrosLibrary::Get()->GetCryptohomeLibrary()->Mount(kTmpfsTrigger, \"\")) {\n    LOG(WARNING) << \"Logging in with localaccount: \" << localaccount_;\n    consumer_->OnLoginSuccess(username_, std::string());\n  } else {\n    OnLoginFailure(error);\n  }\n}\n\nvoid GoogleAuthenticator::OnLoginFailure(const std::string& data) {\n  \/\/ Send notification of failure\n  AuthenticationNotificationDetails details(false);\n  NotificationService::current()->Notify(\n      NotificationType::LOGIN_AUTHENTICATION,\n      NotificationService::AllSources(),\n      Details<AuthenticationNotificationDetails>(&details));\n  LOG(WARNING) << \"Login failed: \" << data;\n  \/\/ TODO(cmasone): what can we do to expose these OS\/server-side error strings\n  \/\/ in an internationalizable way?\n  consumer_->OnLoginFailure(data);\n}\n\nvoid GoogleAuthenticator::LoadSystemSalt() {\n  if (!system_salt_.empty())\n    return;\n  system_salt_ = CrosLibrary::Get()->GetCryptohomeLibrary()->GetSystemSalt();\n  CHECK(!system_salt_.empty());\n  CHECK_EQ(system_salt_.size() % 2, 0U);\n}\n\nvoid GoogleAuthenticator::LoadLocalaccount(const std::string& filename) {\n  if (checked_for_localaccount_)\n    return;\n  FilePath localaccount_file;\n  std::string localaccount;\n  if (PathService::Get(base::DIR_EXE, &localaccount_file)) {\n    localaccount_file = localaccount_file.Append(filename);\n    LOG(INFO) << \"looking for localaccount in \" << localaccount_file.value();\n\n    ReadFileToString(localaccount_file, &localaccount);\n    TrimWhitespaceASCII(localaccount, TRIM_TRAILING, &localaccount);\n    LOG(INFO) << \"Loading localaccount: \" << localaccount;\n  } else {\n    LOG(INFO) << \"Assuming no localaccount\";\n  }\n  set_localaccount(localaccount);\n}\n\nvoid GoogleAuthenticator::StoreHashedPassword(const std::string& password) {\n  \/\/ Get salt, ascii encode, update sha with that, then update with ascii\n  \/\/ of password, then end.\n  std::string ascii_salt = SaltAsAscii();\n  unsigned char passhash_buf[kPassHashLen];\n  char ascii_buf[kPassHashLen + 1];\n\n  \/\/ Hash salt and password\n  SHA256Context ctx;\n  SHA256_Begin(&ctx);\n  SHA256_Update(&ctx,\n                reinterpret_cast<const unsigned char*>(ascii_salt.data()),\n                static_cast<unsigned int>(ascii_salt.length()));\n  SHA256_Update(&ctx,\n                reinterpret_cast<const unsigned char*>(password.data()),\n                static_cast<unsigned int>(password.length()));\n  SHA256_End(&ctx,\n             passhash_buf,\n             NULL,\n             static_cast<unsigned int>(sizeof(passhash_buf)));\n\n  std::vector<unsigned char> passhash(passhash_buf,\n                                      passhash_buf + sizeof(passhash_buf));\n  BinaryToHex(passhash,\n              passhash.size() \/ 2,  \/\/ only want top half, at least for now.\n              ascii_buf,\n              sizeof(ascii_buf));\n  ascii_hash_.assign(ascii_buf, sizeof(ascii_buf) - 1);\n}\n\nstd::string GoogleAuthenticator::SaltAsAscii() {\n  LoadSystemSalt();  \/\/ no-op if it's already loaded.\n  unsigned int salt_len = system_salt_.size();\n  char ascii_salt[2 * salt_len + 1];\n  if (GoogleAuthenticator::BinaryToHex(system_salt_,\n                                       salt_len,\n                                       ascii_salt,\n                                       sizeof(ascii_salt))) {\n    return std::string(ascii_salt, sizeof(ascii_salt) - 1);\n  } else {\n    return std::string();\n  }\n}\n\nvoid GoogleAuthenticator::Cancel() {\n  if (!fetch_completed_ && fetcher_) {\n    delete fetcher_;\n    fetcher_ = NULL;\n  }\n  OnLoginFailure(\"Login has timed out; please try again!\");\n}\n\nvoid GoogleAuthenticator::TryClientLogin() {\n  if (fetcher_)\n    delete fetcher_;\n  fetcher_ = CreateClientLoginFetcher(getter_, request_body_, this);\n  fetcher_->Start();\n  ChromeThread::PostDelayedTask(\n      ChromeThread::UI, FROM_HERE,\n      NewRunnableMethod(this,\n                        &GoogleAuthenticator::Cancel), kClientLoginTimeoutMs);\n}\n\n\/\/ static\nbool GoogleAuthenticator::IsSecondFactorSuccess(\n    const std::string& alleged_error) {\n  return alleged_error.find(GoogleAuthenticator::kSecondFactor) !=\n      std::string::npos;\n}\n\n\/\/ static\nbool GoogleAuthenticator::BinaryToHex(const std::vector<unsigned char>& binary,\n                                      const unsigned int binary_len,\n                                      char* hex_string,\n                                      const unsigned int len) {\n  if (len < 2*binary_len)\n    return false;\n  memset(hex_string, 0, len);\n  for (uint i = 0, j = 0; i < binary_len; i++, j+=2)\n    snprintf(hex_string + j, len - j, \"%02x\", binary[i]);\n  return true;\n}\n\n\/\/ static\nstd::string GoogleAuthenticator::Canonicalize(\n    const std::string& email_address) {\n  std::vector<std::string> parts;\n  char at = '@';\n  SplitString(email_address, at, &parts);\n  DCHECK_EQ(parts.size(), 2U) << \"email_address should have only one @\";\n  RemoveChars(parts[0], \".\", &parts[0]);\n  if (parts[0].find('+') != std::string::npos)\n    parts[0].erase(parts[0].find('+'));\n  std::string new_email = StringToLowerASCII(JoinString(parts, at));\n  LOG(INFO) << \"Canonicalized \" << email_address << \" to \" << new_email;\n  return new_email;\n}\n\n}  \/\/ namespace chromeos\n<commit_msg>In case of successful login attempt do nothing in Cancel task. Fixes crash introduced in http:\/\/codereview.chromium.org\/2867012<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\/google_authenticator.h\"\n\n#include <string>\n#include <vector>\n\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/path_service.h\"\n#include \"base\/sha2.h\"\n#include \"base\/string_util.h\"\n#include \"base\/third_party\/nss\/blapi.h\"\n#include \"base\/third_party\/nss\/sha256.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/browser\/chromeos\/cros\/cryptohome_library.h\"\n#include \"chrome\/browser\/chromeos\/login\/auth_response_handler.h\"\n#include \"chrome\/browser\/chromeos\/login\/authentication_notification_details.h\"\n#include \"chrome\/browser\/chromeos\/login\/login_status_consumer.h\"\n#include \"chrome\/browser\/net\/chrome_url_request_context.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/net\/url_fetcher.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"net\/base\/load_flags.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/url_request\/url_request_status.h\"\n#include \"third_party\/libjingle\/source\/talk\/base\/urlencode.h\"\n\nusing base::Time;\nusing base::TimeDelta;\nusing file_util::GetFileSize;\nusing file_util::PathExists;\nusing file_util::ReadFile;\nusing file_util::ReadFileToString;\n\nnamespace chromeos {\n\n\/\/ static\nconst char GoogleAuthenticator::kCookiePersistence[] = \"true\";\n\/\/ static\nconst char GoogleAuthenticator::kAccountType[] = \"HOSTED_OR_GOOGLE\";\n\/\/ static\nconst char GoogleAuthenticator::kSource[] = \"chromeos\";\n\/\/ static\n\/\/ Service name for Google Contacts API. API is used to get user's image.\nconst char GoogleAuthenticator::kService[] = \"cp\";\n\/\/ static\nconst char GoogleAuthenticator::kFormat[] =\n    \"Email=%s&\"\n    \"Passwd=%s&\"\n    \"PersistentCookie=%s&\"\n    \"accountType=%s&\"\n    \"source=%s&\"\n    \"service=%s\";\n\/\/ static\nconst char GoogleAuthenticator::kFormatCaptcha[] =\n    \"Email=%s&\"\n    \"Passwd=%s&\"\n    \"PersistentCookie=%s&\"\n    \"accountType=%s&\"\n    \"source=%s&\"\n    \"service=%s&\"\n    \"logintoken=%s&\"\n    \"logincaptcha=%s\";\n\/\/ static\nconst char GoogleAuthenticator::kSecondFactor[] = \"Info=InvalidSecondFactor\";\n\n\/\/ static\nconst char GoogleAuthenticator::kSystemSalt[] = \"\/home\/.shadow\/salt\";\n\/\/ static\nconst char GoogleAuthenticator::kOpenSSLMagic[] = \"Salted__\";\n\/\/ static\nconst char GoogleAuthenticator::kLocalaccountFile[] = \"localaccount\";\n\/\/ static\nconst char GoogleAuthenticator::kTmpfsTrigger[] = \"incognito\";\n\n\/\/ static\nconst int GoogleAuthenticator::kClientLoginTimeoutMs = 5000;\n\nconst int kPassHashLen = 32;\n\nGoogleAuthenticator::GoogleAuthenticator(LoginStatusConsumer* consumer)\n    : Authenticator(consumer),\n      fetcher_(NULL),\n      getter_(NULL),\n      checked_for_localaccount_(false),\n      unlock_(false),\n      try_again_(true),\n      fetch_completed_(false) {\n  CHECK(chromeos::CrosLibrary::Get()->EnsureLoaded());\n}\n\nGoogleAuthenticator::~GoogleAuthenticator() {\n  delete fetcher_;\n}\n\n\/\/ static\nURLFetcher* GoogleAuthenticator::CreateClientLoginFetcher(\n    URLRequestContextGetter* getter,\n    const std::string& body,\n    URLFetcher::Delegate* delegate) {\n  URLFetcher* to_return =\n      URLFetcher::Create(0,\n                         GURL(AuthResponseHandler::kClientLoginUrl),\n                         URLFetcher::POST,\n                         delegate);\n  to_return->set_request_context(getter);\n  to_return->set_load_flags(net::LOAD_DO_NOT_SEND_COOKIES);\n  to_return->set_upload_data(\"application\/x-www-form-urlencoded\", body);\n  return to_return;\n}\n\nbool GoogleAuthenticator::AuthenticateToLogin(\n    Profile* profile,\n    const std::string& username,\n    const std::string& password,\n    const std::string& login_token,\n    const std::string& login_captcha) {\n  unlock_ = false;\n  getter_ = profile->GetRequestContext();\n\n  \/\/ TODO(cmasone): be more careful about zeroing memory that stores\n  \/\/ the user's password.\n  if (login_token.empty() || login_captcha.empty()) {\n    request_body_ = StringPrintf(kFormat,\n                                 UrlEncodeString(username).c_str(),\n                                 UrlEncodeString(password).c_str(),\n                                 kCookiePersistence,\n                                 kAccountType,\n                                 kSource,\n                                 kService);\n  } else {\n    request_body_ = StringPrintf(kFormatCaptcha,\n                                 UrlEncodeString(username).c_str(),\n                                 UrlEncodeString(password).c_str(),\n                                 kCookiePersistence,\n                                 kAccountType,\n                                 kSource,\n                                 kService,\n                                 UrlEncodeString(login_token).c_str(),\n                                 UrlEncodeString(login_captcha).c_str());\n  }\n  \/\/ TODO(cmasone): Figure out how to parallelize fetch, username\/password\n  \/\/ processing without impacting testability.\n  username_.assign(Canonicalize(username));\n  StoreHashedPassword(password);\n  TryClientLogin();\n  return true;\n}\n\nbool GoogleAuthenticator::AuthenticateToUnlock(const std::string& username,\n                                               const std::string& password) {\n  username_.assign(Canonicalize(username));\n  StoreHashedPassword(password);\n  unlock_ = true;\n  ChromeThread::PostTask(\n      ChromeThread::UI, FROM_HERE,\n      NewRunnableMethod(this, &GoogleAuthenticator::CheckOffline,\n                        std::string(\"unlock failed\")));\n  return true;\n}\n\nvoid GoogleAuthenticator::LoginOffTheRecord() {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::UI));\n  if (CrosLibrary::Get()->GetCryptohomeLibrary()->Mount(kTmpfsTrigger, \"\")) {\n    AuthenticationNotificationDetails details(true);\n    NotificationService::current()->Notify(\n        NotificationType::LOGIN_AUTHENTICATION,\n        NotificationService::AllSources(),\n        Details<AuthenticationNotificationDetails>(&details));\n    consumer_->OnOffTheRecordLoginSuccess();\n  } else {\n    consumer_->OnLoginFailure(\"Could not mount tmpfs cryptohome\");\n  }\n}\n\nvoid GoogleAuthenticator::OnURLFetchComplete(const URLFetcher* source,\n                                             const GURL& url,\n                                             const URLRequestStatus& status,\n                                             int response_code,\n                                             const ResponseCookies& cookies,\n                                             const std::string& data) {\n  fetch_completed_ = true;\n  if (status.is_success() && response_code == kHttpSuccess) {\n    LOG(INFO) << \"Online login successful!\";\n    ChromeThread::PostTask(\n        ChromeThread::UI, FROM_HERE,\n        NewRunnableMethod(this, &GoogleAuthenticator::OnLoginSuccess, data));\n  } else if (!status.is_success()) {\n    if (status.status() == URLRequestStatus::CANCELED) {\n      if (try_again_) {\n        try_again_ = false;\n        LOG(ERROR) << \"Login attempt canceled!?!?  Trying again.\";\n        TryClientLogin();\n        fetch_completed_ = false;\n        return;\n      }\n      LOG(ERROR) << \"Login attempt canceled again?  Already retried...\";\n    }\n    LOG(WARNING) << \"Could not reach Google Accounts servers: errno \"\n              << status.os_error();\n    \/\/ The fetch failed for network reasons, try offline login.\n    LoadLocalaccount(kLocalaccountFile);\n    ChromeThread::PostTask(\n        ChromeThread::UI, FROM_HERE,\n        NewRunnableMethod(this, &GoogleAuthenticator::CheckOffline,\n                          net::ErrorToString(status.os_error())));\n  } else {\n    if (IsSecondFactorSuccess(data)) {\n      ChromeThread::PostTask(\n          ChromeThread::UI, FROM_HERE,\n          NewRunnableMethod(this,\n                            &GoogleAuthenticator::OnLoginSuccess,\n                            std::string()));\n    } else {\n      \/\/ The fetch succeeded, but ClientLogin said no.\n      LoadLocalaccount(kLocalaccountFile);\n      ChromeThread::PostTask(\n          ChromeThread::UI, FROM_HERE,\n          NewRunnableMethod(this,\n                            &GoogleAuthenticator::CheckLocalaccount,\n                            data));\n    }\n  }\n}\n\nvoid GoogleAuthenticator::OnLoginSuccess(const std::string& data) {\n  \/\/ Send notification of success\n  AuthenticationNotificationDetails details(true);\n  NotificationService::current()->Notify(\n      NotificationType::LOGIN_AUTHENTICATION,\n      NotificationService::AllSources(),\n      Details<AuthenticationNotificationDetails>(&details));\n\n  if (unlock_ ||\n      CrosLibrary::Get()->GetCryptohomeLibrary()->Mount(username_.c_str(),\n                                                        ascii_hash_.c_str())) {\n    consumer_->OnLoginSuccess(username_, data);\n  } else {\n    OnLoginFailure(\"Could not mount cryptohome\");\n  }\n}\n\nvoid GoogleAuthenticator::CheckOffline(const std::string& error) {\n  LOG(INFO) << \"Attempting offline login\";\n  if (CrosLibrary::Get()->GetCryptohomeLibrary()->CheckKey(\n          username_.c_str(),\n          ascii_hash_.c_str())) {\n    \/\/ The fetch didn't succeed, but offline login did.\n    LOG(INFO) << \"Offline login successful!\";\n    OnLoginSuccess(std::string());\n  } else {\n    \/\/ We couldn't hit the network, and offline login failed.\n    GoogleAuthenticator::CheckLocalaccount(error);\n  }\n}\n\nvoid GoogleAuthenticator::CheckLocalaccount(const std::string& error) {\n  if (!localaccount_.empty() && localaccount_ == username_ &&\n      CrosLibrary::Get()->GetCryptohomeLibrary()->Mount(kTmpfsTrigger, \"\")) {\n    LOG(WARNING) << \"Logging in with localaccount: \" << localaccount_;\n    consumer_->OnLoginSuccess(username_, std::string());\n  } else {\n    OnLoginFailure(error);\n  }\n}\n\nvoid GoogleAuthenticator::OnLoginFailure(const std::string& data) {\n  \/\/ Send notification of failure\n  AuthenticationNotificationDetails details(false);\n  NotificationService::current()->Notify(\n      NotificationType::LOGIN_AUTHENTICATION,\n      NotificationService::AllSources(),\n      Details<AuthenticationNotificationDetails>(&details));\n  LOG(WARNING) << \"Login failed: \" << data;\n  \/\/ TODO(cmasone): what can we do to expose these OS\/server-side error strings\n  \/\/ in an internationalizable way?\n  consumer_->OnLoginFailure(data);\n}\n\nvoid GoogleAuthenticator::LoadSystemSalt() {\n  if (!system_salt_.empty())\n    return;\n  system_salt_ = CrosLibrary::Get()->GetCryptohomeLibrary()->GetSystemSalt();\n  CHECK(!system_salt_.empty());\n  CHECK_EQ(system_salt_.size() % 2, 0U);\n}\n\nvoid GoogleAuthenticator::LoadLocalaccount(const std::string& filename) {\n  if (checked_for_localaccount_)\n    return;\n  FilePath localaccount_file;\n  std::string localaccount;\n  if (PathService::Get(base::DIR_EXE, &localaccount_file)) {\n    localaccount_file = localaccount_file.Append(filename);\n    LOG(INFO) << \"looking for localaccount in \" << localaccount_file.value();\n\n    ReadFileToString(localaccount_file, &localaccount);\n    TrimWhitespaceASCII(localaccount, TRIM_TRAILING, &localaccount);\n    LOG(INFO) << \"Loading localaccount: \" << localaccount;\n  } else {\n    LOG(INFO) << \"Assuming no localaccount\";\n  }\n  set_localaccount(localaccount);\n}\n\nvoid GoogleAuthenticator::StoreHashedPassword(const std::string& password) {\n  \/\/ Get salt, ascii encode, update sha with that, then update with ascii\n  \/\/ of password, then end.\n  std::string ascii_salt = SaltAsAscii();\n  unsigned char passhash_buf[kPassHashLen];\n  char ascii_buf[kPassHashLen + 1];\n\n  \/\/ Hash salt and password\n  SHA256Context ctx;\n  SHA256_Begin(&ctx);\n  SHA256_Update(&ctx,\n                reinterpret_cast<const unsigned char*>(ascii_salt.data()),\n                static_cast<unsigned int>(ascii_salt.length()));\n  SHA256_Update(&ctx,\n                reinterpret_cast<const unsigned char*>(password.data()),\n                static_cast<unsigned int>(password.length()));\n  SHA256_End(&ctx,\n             passhash_buf,\n             NULL,\n             static_cast<unsigned int>(sizeof(passhash_buf)));\n\n  std::vector<unsigned char> passhash(passhash_buf,\n                                      passhash_buf + sizeof(passhash_buf));\n  BinaryToHex(passhash,\n              passhash.size() \/ 2,  \/\/ only want top half, at least for now.\n              ascii_buf,\n              sizeof(ascii_buf));\n  ascii_hash_.assign(ascii_buf, sizeof(ascii_buf) - 1);\n}\n\nstd::string GoogleAuthenticator::SaltAsAscii() {\n  LoadSystemSalt();  \/\/ no-op if it's already loaded.\n  unsigned int salt_len = system_salt_.size();\n  char ascii_salt[2 * salt_len + 1];\n  if (GoogleAuthenticator::BinaryToHex(system_salt_,\n                                       salt_len,\n                                       ascii_salt,\n                                       sizeof(ascii_salt))) {\n    return std::string(ascii_salt, sizeof(ascii_salt) - 1);\n  } else {\n    return std::string();\n  }\n}\n\nvoid GoogleAuthenticator::Cancel() {\n  if (fetch_completed_)\n   return;\n\n  if (fetcher_) {\n    delete fetcher_;\n    fetcher_ = NULL;\n  }\n  OnLoginFailure(\"Login has timed out; please try again!\");\n}\n\nvoid GoogleAuthenticator::TryClientLogin() {\n  if (fetcher_)\n    delete fetcher_;\n  fetcher_ = CreateClientLoginFetcher(getter_, request_body_, this);\n  fetcher_->Start();\n  ChromeThread::PostDelayedTask(\n      ChromeThread::UI, FROM_HERE,\n      NewRunnableMethod(this,\n                        &GoogleAuthenticator::Cancel), kClientLoginTimeoutMs);\n}\n\n\/\/ static\nbool GoogleAuthenticator::IsSecondFactorSuccess(\n    const std::string& alleged_error) {\n  return alleged_error.find(GoogleAuthenticator::kSecondFactor) !=\n      std::string::npos;\n}\n\n\/\/ static\nbool GoogleAuthenticator::BinaryToHex(const std::vector<unsigned char>& binary,\n                                      const unsigned int binary_len,\n                                      char* hex_string,\n                                      const unsigned int len) {\n  if (len < 2*binary_len)\n    return false;\n  memset(hex_string, 0, len);\n  for (uint i = 0, j = 0; i < binary_len; i++, j+=2)\n    snprintf(hex_string + j, len - j, \"%02x\", binary[i]);\n  return true;\n}\n\n\/\/ static\nstd::string GoogleAuthenticator::Canonicalize(\n    const std::string& email_address) {\n  std::vector<std::string> parts;\n  char at = '@';\n  SplitString(email_address, at, &parts);\n  DCHECK_EQ(parts.size(), 2U) << \"email_address should have only one @\";\n  RemoveChars(parts[0], \".\", &parts[0]);\n  if (parts[0].find('+') != std::string::npos)\n    parts[0].erase(parts[0].find('+'));\n  std::string new_email = StringToLowerASCII(JoinString(parts, at));\n  LOG(INFO) << \"Canonicalized \" << email_address << \" to \" << new_email;\n  return new_email;\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\/login\/rounded_rect_painter.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/chromeos\/login\/helper.h\"\n#include \"third_party\/skia\/include\/effects\/SkBlurMaskFilter.h\"\n#include \"third_party\/skia\/include\/effects\/SkGradientShader.h\"\n#include \"ui\/gfx\/canvas.h\"\n#include \"ui\/gfx\/skia_util.h\"\n#include \"ui\/views\/border.h\"\n#include \"ui\/views\/painter.h\"\n\nnamespace chromeos {\n\nnamespace {\n\nconst SkColor kScreenTopColor = SkColorSetRGB(250, 251, 251);\nconst SkColor kScreenBottomColor = SkColorSetRGB(204, 209, 212);\nconst SkColor kScreenShadowColor = SkColorSetARGB(64, 34, 54, 115);\nconst int kScreenShadow = 10;\n\nvoid DrawRoundedRect(gfx::Canvas* canvas,\n                     const SkRect& rect,\n                     int corner_radius,\n                     SkColor top_color,\n                     SkColor bottom_color) {\n  SkPath path;\n  path.addRoundRect(rect,\n                    SkIntToScalar(corner_radius), SkIntToScalar(corner_radius));\n  SkPaint paint;\n  paint.setStyle(SkPaint::kFill_Style);\n  paint.setFlags(SkPaint::kAntiAlias_Flag);\n  if (top_color != bottom_color) {\n    SkPoint p[2];\n    p[0].set(SkIntToScalar(rect.left()), SkIntToScalar(rect.top()));\n    p[1].set(SkIntToScalar(rect.left()), SkIntToScalar(rect.bottom()));\n    SkColor colors[2] = { top_color, bottom_color };\n    SkShader* s = SkGradientShader::CreateLinear(p, colors, NULL, 2,\n        SkShader::kClamp_TileMode, NULL);\n    paint.setShader(s);\n    \/\/ Need to unref shader, otherwise never deleted.\n    s->unref();\n  } else {\n    paint.setColor(top_color);\n  }\n\n  canvas->DrawPath(path, paint);\n}\n\nvoid DrawRoundedRectShadow(gfx::Canvas* canvas,\n                           const SkRect& rect,\n                           int corner_radius,\n                           int shadow,\n                           SkColor color) {\n  SkPaint paint;\n  paint.setFlags(SkPaint::kAntiAlias_Flag);\n  paint.setStyle(SkPaint::kFill_Style);\n  paint.setColor(color);\n  SkMaskFilter* filter = SkBlurMaskFilter::Create(\n      shadow \/ 2, SkBlurMaskFilter::kNormal_BlurStyle);\n  paint.setMaskFilter(filter)->unref();\n  SkRect inset_rect(rect);\n  inset_rect.inset(SkIntToScalar(shadow \/ 2), SkIntToScalar(shadow \/ 2));\n  canvas->sk_canvas()->drawRoundRect(\n      inset_rect,\n      SkIntToScalar(corner_radius), SkIntToScalar(corner_radius),\n      paint);\n  paint.setMaskFilter(NULL);\n}\n\nvoid DrawRectWithBorder(gfx::Canvas* canvas,\n                        const gfx::Size& size,\n                        const BorderDefinition* const border) {\n  SkRect rect(gfx::RectToSkRect(gfx::Rect(size)));\n  if (border->padding > 0) {\n    SkPaint paint;\n    paint.setColor(border->padding_color);\n    canvas->sk_canvas()->drawRect(rect, paint);\n    rect.inset(SkIntToScalar(border->padding), SkIntToScalar(border->padding));\n  }\n  if (border->shadow > 0) {\n    DrawRoundedRectShadow(canvas, rect, border->corner_radius, border->shadow,\n                          border->shadow_color);\n    rect.inset(SkIntToScalar(border->shadow), SkIntToScalar(border->shadow));\n    rect.offset(0, SkIntToScalar(-border->shadow \/ 3));\n  }\n  DrawRoundedRect(canvas, rect, border->corner_radius, border->top_color,\n                  border->bottom_color);\n}\n\n\/\/ This Painter can be used to draw a background consistent cross all login\n\/\/ screens. It draws a rect with padding, shadow and rounded corners.\nclass RoundedRectPainter : public views::Painter {\n public:\n  explicit RoundedRectPainter(const BorderDefinition* const border)\n      : border_(border) {\n  }\n\n  \/\/ Overridden from views::Painter:\n  virtual void Paint(gfx::Canvas* canvas, const gfx::Size& size) OVERRIDE {\n    DrawRectWithBorder(canvas, size, border_);\n  }\n\n private:\n  const BorderDefinition* const border_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedRectPainter);\n};\n\n\/\/ This border can be used to draw shadow and rounded corners across all\n\/\/ login screens.\nclass RoundedRectBorder : public views::Border {\n public:\n  explicit RoundedRectBorder(const BorderDefinition* const border)\n      : border_(border) {\n  }\n\n  virtual void Paint(const views::View& view, gfx::Canvas* canvas) const;\n  virtual void GetInsets(gfx::Insets* insets) const;\n\n private:\n  const BorderDefinition* const border_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedRectBorder);\n};\n\nvoid RoundedRectBorder::Paint(const views::View& view,\n                              gfx::Canvas* canvas) const {\n  \/\/ Don't paint anything. RoundedRectBorder is used to provide insets only.\n}\n\nvoid RoundedRectBorder::GetInsets(gfx::Insets* insets) const {\n  DCHECK(insets);\n  int shadow = border_->shadow;\n  int inset = border_->corner_radius \/ 2 + border_->padding + shadow;\n  insets->Set(inset - shadow \/ 3, inset, inset + shadow \/ 3, inset);\n}\n\n\/\/ Simple solid round background.\nclass RoundedBackground : public views::Background {\n public:\n  RoundedBackground(int corner_radius,\n                    int stroke_width,\n                    const SkColor& background_color,\n                    const SkColor& stroke_color)\n      : corner_radius_(corner_radius),\n        stroke_width_(stroke_width),\n        stroke_color_(stroke_color) {\n    SetNativeControlColor(background_color);\n  }\n\n  virtual void Paint(gfx::Canvas* canvas, views::View* view) const {\n    SkRect rect;\n    rect.iset(0, 0, view->width(), view->height());\n    SkPath path;\n    path.addRoundRect(rect,\n                      SkIntToScalar(corner_radius_),\n                      SkIntToScalar(corner_radius_));\n    \/\/ Draw interior.\n    SkPaint paint;\n    paint.setStyle(SkPaint::kFill_Style);\n    paint.setFlags(SkPaint::kAntiAlias_Flag);\n    paint.setColor(get_color());\n    canvas->DrawPath(path, paint);\n    \/\/ Redraw boundary region with correspoinding color.\n    paint.setStyle(SkPaint::kStroke_Style);\n    paint.setStrokeWidth(SkIntToScalar(stroke_width_));\n    paint.setColor(stroke_color_);\n    canvas->DrawPath(path, paint);\n  }\n\n private:\n  int corner_radius_;\n  int stroke_width_;\n  SkColor stroke_color_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedBackground);\n};\n\n}  \/\/ namespace\n\n\/\/ static\nconst BorderDefinition BorderDefinition::kScreenBorder = {\n  0,\n  SK_ColorBLACK,\n  kScreenShadow,\n  kScreenShadowColor,\n  login::kScreenCornerRadius,\n  kScreenTopColor,\n  kScreenBottomColor\n};\n\nconst BorderDefinition BorderDefinition::kUserBorder = {\n  0,\n  SK_ColorBLACK,\n  0,\n  kScreenShadowColor,\n  login::kUserCornerRadius,\n  kScreenTopColor,\n  kScreenBottomColor\n};\n\nviews::Painter* CreateWizardPainter(const BorderDefinition* const border) {\n  return new RoundedRectPainter(border);\n}\n\nviews::Border* CreateWizardBorder(const BorderDefinition* const border) {\n  return new RoundedRectBorder(border);\n}\n\nviews::Background* CreateRoundedBackground(int corner_radius,\n                                           int stroke_width,\n                                           SkColor background_color,\n                                           SkColor stroke_color) {\n  return new RoundedBackground(\n      corner_radius, stroke_width, background_color, stroke_color);\n}\n\n}  \/\/ namespace chromeos\n<commit_msg>chromeos: Do not pass SkColor by const-reference as it's defined as POD(integer).<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\/login\/rounded_rect_painter.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/chromeos\/login\/helper.h\"\n#include \"third_party\/skia\/include\/effects\/SkBlurMaskFilter.h\"\n#include \"third_party\/skia\/include\/effects\/SkGradientShader.h\"\n#include \"ui\/gfx\/canvas.h\"\n#include \"ui\/gfx\/skia_util.h\"\n#include \"ui\/views\/border.h\"\n#include \"ui\/views\/painter.h\"\n\nnamespace chromeos {\n\nnamespace {\n\nconst SkColor kScreenTopColor = SkColorSetRGB(250, 251, 251);\nconst SkColor kScreenBottomColor = SkColorSetRGB(204, 209, 212);\nconst SkColor kScreenShadowColor = SkColorSetARGB(64, 34, 54, 115);\nconst int kScreenShadow = 10;\n\nvoid DrawRoundedRect(gfx::Canvas* canvas,\n                     const SkRect& rect,\n                     int corner_radius,\n                     SkColor top_color,\n                     SkColor bottom_color) {\n  SkPath path;\n  path.addRoundRect(rect,\n                    SkIntToScalar(corner_radius), SkIntToScalar(corner_radius));\n  SkPaint paint;\n  paint.setStyle(SkPaint::kFill_Style);\n  paint.setFlags(SkPaint::kAntiAlias_Flag);\n  if (top_color != bottom_color) {\n    SkPoint p[2];\n    p[0].set(SkIntToScalar(rect.left()), SkIntToScalar(rect.top()));\n    p[1].set(SkIntToScalar(rect.left()), SkIntToScalar(rect.bottom()));\n    SkColor colors[2] = { top_color, bottom_color };\n    SkShader* s = SkGradientShader::CreateLinear(p, colors, NULL, 2,\n        SkShader::kClamp_TileMode, NULL);\n    paint.setShader(s);\n    \/\/ Need to unref shader, otherwise never deleted.\n    s->unref();\n  } else {\n    paint.setColor(top_color);\n  }\n\n  canvas->DrawPath(path, paint);\n}\n\nvoid DrawRoundedRectShadow(gfx::Canvas* canvas,\n                           const SkRect& rect,\n                           int corner_radius,\n                           int shadow,\n                           SkColor color) {\n  SkPaint paint;\n  paint.setFlags(SkPaint::kAntiAlias_Flag);\n  paint.setStyle(SkPaint::kFill_Style);\n  paint.setColor(color);\n  SkMaskFilter* filter = SkBlurMaskFilter::Create(\n      shadow \/ 2, SkBlurMaskFilter::kNormal_BlurStyle);\n  paint.setMaskFilter(filter)->unref();\n  SkRect inset_rect(rect);\n  inset_rect.inset(SkIntToScalar(shadow \/ 2), SkIntToScalar(shadow \/ 2));\n  canvas->sk_canvas()->drawRoundRect(\n      inset_rect,\n      SkIntToScalar(corner_radius), SkIntToScalar(corner_radius),\n      paint);\n  paint.setMaskFilter(NULL);\n}\n\nvoid DrawRectWithBorder(gfx::Canvas* canvas,\n                        const gfx::Size& size,\n                        const BorderDefinition* const border) {\n  SkRect rect(gfx::RectToSkRect(gfx::Rect(size)));\n  if (border->padding > 0) {\n    SkPaint paint;\n    paint.setColor(border->padding_color);\n    canvas->sk_canvas()->drawRect(rect, paint);\n    rect.inset(SkIntToScalar(border->padding), SkIntToScalar(border->padding));\n  }\n  if (border->shadow > 0) {\n    DrawRoundedRectShadow(canvas, rect, border->corner_radius, border->shadow,\n                          border->shadow_color);\n    rect.inset(SkIntToScalar(border->shadow), SkIntToScalar(border->shadow));\n    rect.offset(0, SkIntToScalar(-border->shadow \/ 3));\n  }\n  DrawRoundedRect(canvas, rect, border->corner_radius, border->top_color,\n                  border->bottom_color);\n}\n\n\/\/ This Painter can be used to draw a background consistent cross all login\n\/\/ screens. It draws a rect with padding, shadow and rounded corners.\nclass RoundedRectPainter : public views::Painter {\n public:\n  explicit RoundedRectPainter(const BorderDefinition* const border)\n      : border_(border) {\n  }\n\n  \/\/ Overridden from views::Painter:\n  virtual void Paint(gfx::Canvas* canvas, const gfx::Size& size) OVERRIDE {\n    DrawRectWithBorder(canvas, size, border_);\n  }\n\n private:\n  const BorderDefinition* const border_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedRectPainter);\n};\n\n\/\/ This border can be used to draw shadow and rounded corners across all\n\/\/ login screens.\nclass RoundedRectBorder : public views::Border {\n public:\n  explicit RoundedRectBorder(const BorderDefinition* const border)\n      : border_(border) {\n  }\n\n  virtual void Paint(const views::View& view, gfx::Canvas* canvas) const;\n  virtual void GetInsets(gfx::Insets* insets) const;\n\n private:\n  const BorderDefinition* const border_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedRectBorder);\n};\n\nvoid RoundedRectBorder::Paint(const views::View& view,\n                              gfx::Canvas* canvas) const {\n  \/\/ Don't paint anything. RoundedRectBorder is used to provide insets only.\n}\n\nvoid RoundedRectBorder::GetInsets(gfx::Insets* insets) const {\n  DCHECK(insets);\n  int shadow = border_->shadow;\n  int inset = border_->corner_radius \/ 2 + border_->padding + shadow;\n  insets->Set(inset - shadow \/ 3, inset, inset + shadow \/ 3, inset);\n}\n\n\/\/ Simple solid round background.\nclass RoundedBackground : public views::Background {\n public:\n  RoundedBackground(int corner_radius,\n                    int stroke_width,\n                    SkColor background_color,\n                    SkColor stroke_color)\n      : corner_radius_(corner_radius),\n        stroke_width_(stroke_width),\n        stroke_color_(stroke_color) {\n    SetNativeControlColor(background_color);\n  }\n\n  virtual void Paint(gfx::Canvas* canvas, views::View* view) const {\n    SkRect rect;\n    rect.iset(0, 0, view->width(), view->height());\n    SkPath path;\n    path.addRoundRect(rect,\n                      SkIntToScalar(corner_radius_),\n                      SkIntToScalar(corner_radius_));\n    \/\/ Draw interior.\n    SkPaint paint;\n    paint.setStyle(SkPaint::kFill_Style);\n    paint.setFlags(SkPaint::kAntiAlias_Flag);\n    paint.setColor(get_color());\n    canvas->DrawPath(path, paint);\n    \/\/ Redraw boundary region with correspoinding color.\n    paint.setStyle(SkPaint::kStroke_Style);\n    paint.setStrokeWidth(SkIntToScalar(stroke_width_));\n    paint.setColor(stroke_color_);\n    canvas->DrawPath(path, paint);\n  }\n\n private:\n  int corner_radius_;\n  int stroke_width_;\n  SkColor stroke_color_;\n\n  DISALLOW_COPY_AND_ASSIGN(RoundedBackground);\n};\n\n}  \/\/ namespace\n\n\/\/ static\nconst BorderDefinition BorderDefinition::kScreenBorder = {\n  0,\n  SK_ColorBLACK,\n  kScreenShadow,\n  kScreenShadowColor,\n  login::kScreenCornerRadius,\n  kScreenTopColor,\n  kScreenBottomColor\n};\n\nconst BorderDefinition BorderDefinition::kUserBorder = {\n  0,\n  SK_ColorBLACK,\n  0,\n  kScreenShadowColor,\n  login::kUserCornerRadius,\n  kScreenTopColor,\n  kScreenBottomColor\n};\n\nviews::Painter* CreateWizardPainter(const BorderDefinition* const border) {\n  return new RoundedRectPainter(border);\n}\n\nviews::Border* CreateWizardBorder(const BorderDefinition* const border) {\n  return new RoundedRectBorder(border);\n}\n\nviews::Background* CreateRoundedBackground(int corner_radius,\n                                           int stroke_width,\n                                           SkColor background_color,\n                                           SkColor stroke_color) {\n  return new RoundedBackground(\n      corner_radius, stroke_width, background_color, stroke_color);\n}\n\n}  \/\/ namespace chromeos\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2013 by Philip N. Garner\n *\n * See the file COPYING for the licence associated with this software.\n *\n * Author(s):\n *   Phil Garner, October 2013\n *\/\n\n#include <fstream>\n#include <stdexcept>\n#include <var.h>\n\n#include \"expat.h\"\n\n\nnamespace libvar\n{\n    \/**\n     * Class to wrap the expat library and callbacks.\n     *\/\n    class Expat : public varfile\n    {\n    public:\n        Expat();\n        ~Expat();\n        var parse(const char* iFile);\n        void startElementHandler(const XML_Char *iName, const XML_Char **iAtts);\n        void endElementHandler(const XML_Char *iName);\n        void characterDataHandler(const XML_Char *iStr, int iLen);\n        virtual var read(const char* iFile);\n        virtual void write(const char* iFile, var iVar);\n\n    private:\n        var mVar;            \/\/\/< Var to populate during parse\n        var mStack;          \/\/\/< Parse stack\n        XML_Parser mParser;  \/\/\/< The expat parser\n\n        var element();\n    };\n}\n\n\nusing namespace libvar;\n\n\nvoid libvar::factory(varfile** oFile)\n{\n    *oFile = new Expat;\n}\n\n\n\/**\n * In principle this is unnecessary; in practice it's useful to catch\n * errors (of the form \"dude, you forgot to implement...\").\n *\/\nstatic void DefaultHandler(\n    void *iUserData, const XML_Char *iStr, int iLen\n)\n{\n    var str(iLen, iStr);\n    std::cout << \"expat::DefaultHandler: \" << str << std::endl;\n    throw std::runtime_error(\"xmlfile: default handler called\");\n}\n\n\n\/**\n * We don't do anything with the XML declaration, but need to handle\n * it so the the default handler doesn't.\n *\/\nstatic void XmlDeclHandler(\n    void *iUserData,\n    const XML_Char *version,\n    const XML_Char *encoding,\n    int standalone\n)\n{\n    \/\/std::cout << \"xml: \" << version << std::endl;\n}\n\n\nstatic void StartElementHandler(\n    void *iUserData, const XML_Char *iName, const XML_Char **iAtts\n)\n{\n    return ((Expat*)iUserData)->startElementHandler(iName, iAtts);\n}\n\n\nstatic void EndElementHandler(\n    void *iUserData, const XML_Char *iName\n)\n{\n    return ((Expat*)iUserData)->endElementHandler(iName);\n}\n\n\nstatic void CharacterDataHandler(\n    void *iUserData, const XML_Char *iStr, int iLen\n)\n{\n    return ((Expat*)iUserData)->characterDataHandler(iStr, iLen);\n}\n\n\n\/**\n * Parser constructor.  Points the callbacks to the static functions;\n * those functions convert the UserData field into the class pointer\n * and pass the callback to the appropriate method.\n *\/\nExpat::Expat()\n{\n    \/\/ Create the parser\n    mParser = XML_ParserCreate(0);\n\n    \/\/ Set the callbacks to the static functions\n    XML_SetUserData(mParser, this);\n    XML_SetDefaultHandler(mParser, DefaultHandler);\n    XML_SetXmlDeclHandler(mParser, XmlDeclHandler);\n    XML_SetStartElementHandler(mParser, StartElementHandler);\n    XML_SetEndElementHandler(mParser, EndElementHandler);\n    XML_SetCharacterDataHandler(mParser, CharacterDataHandler);\n}\n\n\nExpat::~Expat()\n{\n    XML_ParserFree(mParser);\n}\n\n\nvar Expat::parse(const char* iFile)\n{\n    std::ifstream is(iFile, std::ifstream::in);\n    if (is.fail())\n        throw std::runtime_error(\"xmlfile::read(): Open failed\");\n\n    var f;\n    XML_Status s;\n    while (f.getline(is))\n    {\n        s = XML_Parse(mParser, f.str(), f.size(), 0);\n        if (!s)\n            throw std::runtime_error(\"xmlfile::parse(): Error!\");\n    }\n    s = XML_Parse(mParser, f.str(), 0, 0);\n    if (!s)\n        throw std::runtime_error(\"xmlfile::parse(): Error!\");\n    if (mStack.size() != 0)\n        throw std::runtime_error(\"xmlfile::parse(): Short file?\");\n\n    return mVar;\n}\n\n\nvar Expat::element()\n{\n    static var elem;\n    if (!elem)\n    {\n        var nil;\n        elem[\"name\"] = nil;\n        elem[\"attr\"] = nil;\n        elem[\"data\"] = nil;\n    }\n    return elem.copy();\n}\n\n\nvoid Expat::startElementHandler(const XML_Char *iName, const XML_Char **iAtts)\n{\n    var elem = element();\n    if (mStack)\n        mStack.top()[\"data\"].push(elem);\n    else\n        mVar = elem;\n    mStack.push(elem);\n    elem[\"name\"] = iName;\n    while (*iAtts)\n    {\n        elem[\"attr\"][iAtts[0]] = iAtts[1];\n        iAtts += 2;\n    }\n}\n\n\nvoid Expat::endElementHandler(const XML_Char *iName)\n{\n    if (mStack.top()[\"name\"] != iName)\n        throw std::runtime_error(\"Expat::endElementHandler: malformed xml\");\n    mStack.pop();\n}\n\n\nvoid Expat::characterDataHandler(const XML_Char *iStr, int iLen)\n{\n    var str(iLen, iStr);\n    mStack.top()[\"data\"].push(str);\n}\n\n\nvar Expat::read(const char* iFile)\n{\n    return parse(iFile);\n}\n\nvoid Expat::write(const char* iFile, var iVar)\n{\n}\n<commit_msg>Handle DOS line ends in XML files<commit_after>\/*\n * Copyright 2013 by Philip N. Garner\n *\n * See the file COPYING for the licence associated with this software.\n *\n * Author(s):\n *   Phil Garner, October 2013\n *\/\n\n#include <fstream>\n#include <stdexcept>\n#include <var.h>\n\n#include \"expat.h\"\n\n\nnamespace libvar\n{\n    \/**\n     * Class to wrap the expat library and callbacks.\n     *\/\n    class Expat : public varfile\n    {\n    public:\n        Expat();\n        ~Expat();\n        var parse(const char* iFile);\n        void startElementHandler(const XML_Char *iName, const XML_Char **iAtts);\n        void endElementHandler(const XML_Char *iName);\n        void characterDataHandler(const XML_Char *iStr, int iLen);\n        virtual var read(const char* iFile);\n        virtual void write(const char* iFile, var iVar);\n\n    private:\n        var mVar;            \/\/\/< Var to populate during parse\n        var mStack;          \/\/\/< Parse stack\n        XML_Parser mParser;  \/\/\/< The expat parser\n\n        var element();\n    };\n}\n\n\nusing namespace libvar;\n\n\nvoid libvar::factory(varfile** oFile)\n{\n    *oFile = new Expat;\n}\n\n\n\/**\n * In principle this is unnecessary; in practice it's useful to catch\n * errors (of the form \"dude, you forgot to implement...\").\n *\/\nstatic void DefaultHandler(\n    void *iUserData, const XML_Char *iStr, int iLen\n)\n{\n    \/\/ DOS line ends find their way here.  Why?\n    if ((iLen == 1) && (*iStr == '\\r'))\n        return;\n\n    var str(iLen, iStr);\n    std::cout << \"expat::DefaultHandler: \" << str << std::endl;\n    throw std::runtime_error(\"xmlfile: default handler called\");\n}\n\n\n\/**\n * We don't do anything with the XML declaration, but need to handle\n * it so the the default handler doesn't.\n *\/\nstatic void XmlDeclHandler(\n    void *iUserData,\n    const XML_Char *version,\n    const XML_Char *encoding,\n    int standalone\n)\n{\n    \/\/std::cout << \"xml: \" << version << std::endl;\n}\n\n\nstatic void StartElementHandler(\n    void *iUserData, const XML_Char *iName, const XML_Char **iAtts\n)\n{\n    return ((Expat*)iUserData)->startElementHandler(iName, iAtts);\n}\n\n\nstatic void EndElementHandler(\n    void *iUserData, const XML_Char *iName\n)\n{\n    return ((Expat*)iUserData)->endElementHandler(iName);\n}\n\n\nstatic void CharacterDataHandler(\n    void *iUserData, const XML_Char *iStr, int iLen\n)\n{\n    return ((Expat*)iUserData)->characterDataHandler(iStr, iLen);\n}\n\n\n\/**\n * Parser constructor.  Points the callbacks to the static functions;\n * those functions convert the UserData field into the class pointer\n * and pass the callback to the appropriate method.\n *\/\nExpat::Expat()\n{\n    \/\/ Create the parser\n    mParser = XML_ParserCreate(0);\n\n    \/\/ Set the callbacks to the static functions\n    XML_SetUserData(mParser, this);\n    XML_SetDefaultHandler(mParser, DefaultHandler);\n    XML_SetXmlDeclHandler(mParser, XmlDeclHandler);\n    XML_SetStartElementHandler(mParser, StartElementHandler);\n    XML_SetEndElementHandler(mParser, EndElementHandler);\n    XML_SetCharacterDataHandler(mParser, CharacterDataHandler);\n}\n\n\nExpat::~Expat()\n{\n    XML_ParserFree(mParser);\n}\n\n\nvar Expat::parse(const char* iFile)\n{\n    std::ifstream is(iFile, std::ifstream::in);\n    if (is.fail())\n        throw std::runtime_error(\"xmlfile::read(): Open failed\");\n\n    var f;\n    XML_Status s;\n    while (f.getline(is))\n    {\n        s = XML_Parse(mParser, f.str(), f.size(), 0);\n        if (!s)\n            throw std::runtime_error(\"xmlfile::parse(): Error!\");\n    }\n    s = XML_Parse(mParser, f.str(), 0, 0);\n    if (!s)\n        throw std::runtime_error(\"xmlfile::parse(): Error!\");\n    if (mStack.size() != 0)\n        throw std::runtime_error(\"xmlfile::parse(): Short file?\");\n\n    return mVar;\n}\n\n\nvar Expat::element()\n{\n    static var elem;\n    if (!elem)\n    {\n        var nil;\n        elem[\"name\"] = nil;\n        elem[\"attr\"] = nil;\n        elem[\"data\"] = nil;\n    }\n    return elem.copy();\n}\n\n\nvoid Expat::startElementHandler(const XML_Char *iName, const XML_Char **iAtts)\n{\n    var elem = element();\n    if (mStack)\n        mStack.top()[\"data\"].push(elem);\n    else\n        mVar = elem;\n    mStack.push(elem);\n    elem[\"name\"] = iName;\n    while (*iAtts)\n    {\n        elem[\"attr\"][iAtts[0]] = iAtts[1];\n        iAtts += 2;\n    }\n}\n\n\nvoid Expat::endElementHandler(const XML_Char *iName)\n{\n    if (mStack.top()[\"name\"] != iName)\n        throw std::runtime_error(\"Expat::endElementHandler: malformed xml\");\n    mStack.pop();\n}\n\n\nvoid Expat::characterDataHandler(const XML_Char *iStr, int iLen)\n{\n    var str(iLen, iStr);\n    mStack.top()[\"data\"].push(str);\n}\n\n\nvar Expat::read(const char* iFile)\n{\n    return parse(iFile);\n}\n\nvoid Expat::write(const char* iFile, var iVar)\n{\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ --------------------------------------------------------------------------\n#include <sstream>\n#include <cstdio>\n#include <UniSetTypes.h>\n#include \"PostgreSQLInterface.h\"\n\/\/ --------------------------------------------------------------------------\nusing namespace std;\nusing namespace UniSetTypes;\nusing namespace pqxx;\n\/\/ --------------------------------------------------------------------------\n\nPostgreSQLInterface::PostgreSQLInterface():\n\tlastQ(\"\"),\n\tlastE(\"\"),\n\tlast_inserted_id(0)\n{\n\t\/\/db = make_shared<pqxx::connection>();\n}\n\nPostgreSQLInterface::~PostgreSQLInterface()\n{\n\tclose();\n}\n\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::ping()\n{\n\treturn db && db->is_open();\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::connect( const string& host, const string& user, const string& pswd, const string& dbname)\n{\n\tif( db )\n\t\treturn true;\n\n\tstd::string conninfo = \"dbname=\" + dbname + \" host=\" + host + \" user=\" + user + \" password=\" + pswd;\n\n\ttry\n\t{\n\t\tdb = make_shared<pqxx::connection>(conninfo);\n\t\treturn db->is_open();\n\n\t}\n\tcatch( const std::exception& e )\n\t{\n\t\tcerr << e.what() << std::endl;\n\t}\n\n\treturn false;\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::close()\n{\n\tif( db )\n\t{\n\t\tdb->disconnect();\n\t\tdb.reset();\n\t}\n\n\treturn true;\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::insert( const string& q )\n{\n\tif( !db )\n\t\treturn false;\n\n\ttry\n\t{\n\t\twork w( *(db.get()) );\n\t\tw.exec(q);\n\t\tw.commit();\n\t\treturn true;\n\t}\n\tcatch( const std::exception& e )\n\t{\n\t\t\/\/cerr << e.what() << std::endl;\n\t\tlastE = string(e.what());\n\t}\n\n\treturn false;\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::insertAndSaveRowid( const string& q )\n{\n\tif( !db )\n\t\treturn false;\n\n\tstd::string qplus = q + \" RETURNING id\";\n\n\ttry\n\t{\n\t\twork w( *(db.get()) );\n\t\tpqxx::result res = w.exec(qplus);\n\t\tw.commit();\n\t\tsave_inserted_id(res);\n\t\treturn true;\n\t}\n\tcatch( const std::exception& e )\n\t{\n\t\t\/\/cerr << e.what() << std::endl;\n\t\tlastE = string(e.what());\n\t}\n\n\treturn false;\n}\n\/\/ -----------------------------------------------------------------------------------------\nPostgreSQLResult PostgreSQLInterface::query( const string& q )\n{\n\tif( !db )\n\t\treturn PostgreSQLResult();\n\n\ttry\n\t{\n\t\tnontransaction n(*(db.get()));\n\n\t\t\/* Execute SQL query *\/\n\t\tresult res( n.exec(q) );\n\t\treturn PostgreSQLResult(res);\n\t}\n\tcatch( const std::exception& e )\n\t{\n\t\tlastE = string(e.what());\n\t}\n\n\treturn PostgreSQLResult();\n}\n\/\/ -----------------------------------------------------------------------------------------\nstring PostgreSQLInterface::error()\n{\n\treturn lastE;\n}\n\/\/ -----------------------------------------------------------------------------------------\nconst string PostgreSQLInterface::lastQuery()\n{\n\treturn lastQ;\n}\n\/\/ -----------------------------------------------------------------------------------------\ndouble PostgreSQLInterface::insert_id()\n{\n\treturn last_inserted_id;\n}\n\/\/ -----------------------------------------------------------------------------------------\nvoid PostgreSQLInterface::save_inserted_id( const pqxx::result& res )\n{\n\tif( res.size() > 0 && res[0].size() > 0 )\n\t\tlast_inserted_id = res[0][0].as<int>();\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::isConnection()\n{\n\treturn (db && db->is_open());\n}\n\/\/ -----------------------------------------------------------------------------------------\nint PostgreSQLResult::num_cols( const PostgreSQLResult::iterator& it )\n{\n\treturn it->size();\n}\n\/\/ -----------------------------------------------------------------------------------------\nint PostgreSQLResult::as_int( const PostgreSQLResult::iterator& it, int col )\n{\n\t\/\/    if( col<0 || col >it->size() )\n\t\/\/        return 0;\n\treturn uni_atoi( (*it)[col] );\n}\n\/\/ -----------------------------------------------------------------------------------------\ndouble PostgreSQLResult::as_double( const PostgreSQLResult::iterator& it, int col )\n{\n\treturn atof( ((*it)[col]).c_str() );\n}\n\/\/ -----------------------------------------------------------------------------------------\nstd::string PostgreSQLResult::as_string( const PostgreSQLResult::iterator& it, int col )\n{\n\treturn ((*it)[col]);\n}\n\/\/ -----------------------------------------------------------------------------------------\nint PostgreSQLResult::as_int( const PostgreSQLResult::COL::iterator& it )\n{\n\treturn uni_atoi( (*it) );\n}\n\/\/ -----------------------------------------------------------------------------------------\ndouble PostgreSQLResult::as_double( const PostgreSQLResult::COL::iterator& it )\n{\n\treturn atof( (*it).c_str() );\n}\n\/\/ -----------------------------------------------------------------------------------------\nstd::string PostgreSQLResult::as_string( const PostgreSQLResult::COL::iterator& it )\n{\n\treturn (*it);\n}\n\/\/ -----------------------------------------------------------------------------------------\n#if 0\nPostgreSQLResult::COL PostgreSQLResult::get_col( const PostgreSQLResult::ROW::iterator& it )\n{\n\treturn (*it);\n}\n#endif\n\/\/ -----------------------------------------------------------------------------------------\nPostgreSQLResult::~PostgreSQLResult()\n{\n\n}\n\/\/ -----------------------------------------------------------------------------------------\nPostgreSQLResult::PostgreSQLResult( const pqxx::result& res )\n{\n\tfor( result::const_iterator c = res.begin(); c != res.end(); ++c )\n\t{\n\t\tCOL col;\n\n\t\tfor( auto i = 0; i < c.size(); i++ )\n\t\t\tcol.push_back( c[i].as<string>() );\n\n\t\trow.push_back(col);\n\t}\n}\n\/\/ -----------------------------------------------------------------------------------------\n<commit_msg>minor fix:<commit_after>\/\/ --------------------------------------------------------------------------\n#include <sstream>\n#include <cstdio>\n#include <UniSetTypes.h>\n#include \"PostgreSQLInterface.h\"\n\/\/ --------------------------------------------------------------------------\nusing namespace std;\nusing namespace UniSetTypes;\nusing namespace pqxx;\n\/\/ --------------------------------------------------------------------------\n\nPostgreSQLInterface::PostgreSQLInterface():\n\tlastQ(\"\"),\n\tlastE(\"\"),\n\tlast_inserted_id(0)\n{\n\t\/\/db = make_shared<pqxx::connection>();\n}\n\nPostgreSQLInterface::~PostgreSQLInterface()\n{\n\tclose();\n}\n\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::ping()\n{\n\treturn db && db->is_open();\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::connect( const string& host, const string& user, const string& pswd, const string& dbname)\n{\n\tif( db )\n\t\treturn true;\n\n\tstd::string conninfo = \"dbname=\" + dbname + \" host=\" + host + \" user=\" + user + \" password=\" + pswd;\n\n\ttry\n\t{\n\t\tdb = make_shared<pqxx::connection>(conninfo);\n\t\treturn db->is_open();\n\n\t}\n\tcatch( const std::exception& e )\n\t{\n\t\tcerr << e.what() << std::endl;\n\t}\n\n\treturn false;\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::close()\n{\n\tif( db )\n\t{\n\t\tdb->disconnect();\n\t\tdb.reset();\n\t}\n\n\treturn true;\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::insert( const string& q )\n{\n\tif( !db )\n\t\treturn false;\n\n\ttry\n\t{\n\t\twork w( *(db.get()) );\n\t\tw.exec(q);\n\t\tw.commit();\n\t\treturn true;\n\t}\n\tcatch( const std::exception& e )\n\t{\n\t\t\/\/cerr << e.what() << std::endl;\n\t\tlastE = string(e.what());\n\t}\n\n\treturn false;\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::insertAndSaveRowid( const string& q )\n{\n\tif( !db )\n\t\treturn false;\n\n\tstd::string qplus = q + \" RETURNING id\";\n\n\ttry\n\t{\n\t\twork w( *(db.get()) );\n\t\tpqxx::result res = w.exec(qplus);\n\t\tw.commit();\n\t\tsave_inserted_id(res);\n\t\treturn true;\n\t}\n\tcatch( const std::exception& e )\n\t{\n\t\t\/\/cerr << e.what() << std::endl;\n\t\tlastE = string(e.what());\n\t}\n\n\treturn false;\n}\n\/\/ -----------------------------------------------------------------------------------------\nPostgreSQLResult PostgreSQLInterface::query( const string& q )\n{\n\tif( !db )\n\t\treturn PostgreSQLResult();\n\n\ttry\n\t{\n\t\tnontransaction n(*(db.get()));\n\n\t\t\/* Execute SQL query *\/\n\t\tresult res( n.exec(q) );\n\t\treturn PostgreSQLResult(res);\n\t}\n\tcatch( const std::exception& e )\n\t{\n\t\tlastE = string(e.what());\n\t}\n\n\treturn PostgreSQLResult();\n}\n\/\/ -----------------------------------------------------------------------------------------\nstring PostgreSQLInterface::error()\n{\n\treturn lastE;\n}\n\/\/ -----------------------------------------------------------------------------------------\nconst string PostgreSQLInterface::lastQuery()\n{\n\treturn lastQ;\n}\n\/\/ -----------------------------------------------------------------------------------------\ndouble PostgreSQLInterface::insert_id()\n{\n\treturn last_inserted_id;\n}\n\/\/ -----------------------------------------------------------------------------------------\nvoid PostgreSQLInterface::save_inserted_id( const pqxx::result& res )\n{\n\tif( res.size() > 0 && res[0].size() > 0 )\n\t\tlast_inserted_id = res[0][0].as<int>();\n}\n\/\/ -----------------------------------------------------------------------------------------\nbool PostgreSQLInterface::isConnection()\n{\n\treturn (db && db->is_open());\n}\n\/\/ -----------------------------------------------------------------------------------------\nint PostgreSQLResult::num_cols( const PostgreSQLResult::iterator& it )\n{\n\treturn it->size();\n}\n\/\/ -----------------------------------------------------------------------------------------\nint PostgreSQLResult::as_int( const PostgreSQLResult::iterator& it, int col )\n{\n\t\/\/    if( col<0 || col >it->size() )\n\t\/\/        return 0;\n\treturn uni_atoi( (*it)[col] );\n}\n\/\/ -----------------------------------------------------------------------------------------\ndouble PostgreSQLResult::as_double( const PostgreSQLResult::iterator& it, int col )\n{\n\treturn atof( ((*it)[col]).c_str() );\n}\n\/\/ -----------------------------------------------------------------------------------------\nstd::string PostgreSQLResult::as_string( const PostgreSQLResult::iterator& it, int col )\n{\n\treturn ((*it)[col]);\n}\n\/\/ -----------------------------------------------------------------------------------------\nint PostgreSQLResult::as_int( const PostgreSQLResult::COL::iterator& it )\n{\n\treturn uni_atoi( (*it) );\n}\n\/\/ -----------------------------------------------------------------------------------------\ndouble PostgreSQLResult::as_double( const PostgreSQLResult::COL::iterator& it )\n{\n\treturn atof( (*it).c_str() );\n}\n\/\/ -----------------------------------------------------------------------------------------\nstd::string PostgreSQLResult::as_string( const PostgreSQLResult::COL::iterator& it )\n{\n\treturn (*it);\n}\n\/\/ -----------------------------------------------------------------------------------------\n#if 0\nPostgreSQLResult::COL PostgreSQLResult::get_col( const PostgreSQLResult::ROW::iterator& it )\n{\n\treturn (*it);\n}\n#endif\n\/\/ -----------------------------------------------------------------------------------------\nPostgreSQLResult::~PostgreSQLResult()\n{\n\n}\n\/\/ -----------------------------------------------------------------------------------------\nPostgreSQLResult::PostgreSQLResult( const pqxx::result& res )\n{\n\tfor( result::const_iterator c = res.begin(); c != res.end(); ++c )\n\t{\n\t\tCOL col;\n\n\t\tfor( pqxx::result::tuple::size_type i = 0; i < c.size(); i++ )\n\t\t\tcol.push_back( c[i].as<string>() );\n\n\t\trow.push_back(col);\n\t}\n}\n\/\/ -----------------------------------------------------------------------------------------\n<|endoftext|>"}
{"text":"<commit_before>\/**\n  ******************************************************************************\n  * @file    voodoospark.cpp\n  * @author  Chris Williams\n  * @version V1.0.0\n  * @date    24-January-2014\n  * @brief   Exposes the firmware level API through a TCP Connection intiated\n  *          via the spark cloud service\n  ******************************************************************************\n  Copyright (c) 2014 Chris Williams  All rights reserved.\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#define DEBUG 0\nTCPClient client;\n\n\nbyte reading[20];\nbyte previous[20];\n\n\nServo servos[20];\n\n\nlong SerialSpeed[] = {  600, 1200, 2400, 4800, 9600, 14400, 19200, 28800, 38400, 57600, 115200 };\n\n\nvoid ipArrayFromString(byte ipArray[], String ipString) {\n  int dot1 = ipString.indexOf('.');\n  ipArray[0] = ipString.substring(0, dot1).toInt();\n  int dot2 = ipString.indexOf('.', dot1 + 1);\n  ipArray[1] = ipString.substring(dot1 + 1, dot2).toInt();\n  dot1 = ipString.indexOf('.', dot2 + 1);\n  ipArray[2] = ipString.substring(dot2 + 1, dot1).toInt();\n  ipArray[3] = ipString.substring(dot1 + 1).toInt();\n}\n\nint connectToMyServer(String params) {\n  \/\/parse data\n  int colonIndex = params.indexOf(\":\");\n  String ip = params.substring(0, colonIndex);\n  String port = params.substring(colonIndex+1, params.length());\n  if(DEBUG)\n    Serial.println(\"Attempting to connect to server: \"+ip+\":\"+port);\n\n  byte serverAddress[4];\n  ipArrayFromString(serverAddress, ip);\n  int serverPort = port.toInt();\n  if (client.connect(serverAddress, serverPort)) {\n\n    reset();\n\n    if (DEBUG)\n      Serial.println(\"Connected to server: \"+ip+\":\"+port);\n    return 1; \/\/ successfully connected\n\n  } else {\n    if(DEBUG)\n      Serial.println(\"Unable to connect to server: \"+ip+\":\"+port);\n    return -1; \/\/ failed to connect\n  }\n}\n\nvoid reset() {\n  for (int i = 0; i < 20; i++) {\n    reading[i] = 0;\n    previous[i] = 0;\n  }\n}\n\nvoid send(int action, int pin, int value) {\n  if (previous[pin] != value) {\n    client.write(action);\n    client.write(pin);\n    client.write(value);\n  }\n  previous[pin] = value;\n}\n\nvoid report() {\n  for (int i = 0; i < 20; i++) {\n    if (reading[i]) {\n      int dr = (reading[i] & 1);\n      int ar = (reading[i] & 2);\n\n      if (i < 10 && dr) {\n        send(0x03, i, digitalRead(i));\n      } else {\n        if (dr) {\n          send(0x03, i, digitalRead(i));\n        } else {\n          if (ar) {\n            send(0x04, i, analogRead(i));\n          }\n        }\n      }\n    }\n  }\n}\n\nvoid setup() {\n  Spark.function(\"connect\", connectToMyServer);\n  if (DEBUG)\n    Serial.begin(115200);\n}\n\nvoid loop() {\n  report();\n\n  if (client.connected()) {\n    if (client.available()) {\n      \/\/ parse and execute commands\n\n      int action = client.read();\n      if(DEBUG)\n        Serial.println(\"Action received: \"+('0'+action));\n      int pin, mode, val, type, speed, address, stop, len, i;\n      switch (action) {\n        case 0x00:  \/\/ pinMode\n          pin = client.read();\n          mode = client.read();\n          \/\/mode is modeled after Standard Firmata\n          if (mode == 0x00) {\n            pinMode(pin, INPUT);\n          } else if (mode == 0x02) {\n            pinMode(pin, INPUT_PULLUP);\n          } else if (mode == 0x03) {\n            pinMode(pin, INPUT_PULLDOWN);\n          } else if (mode == 0x01) {\n            pinMode(pin, OUTPUT);\n          }\n          break;\n        case 0x01:  \/\/ digitalWrite\n          pin = client.read();\n          val = client.read();\n          digitalWrite(pin, val);\n          break;\n        case 0x02:  \/\/ analogWrite\n          pin = client.read();\n          val = client.read();\n          analogWrite(pin, val);\n          break;\n        case 0x03:  \/\/ digitalRead\n          pin = client.read();\n          val = digitalRead(pin);\n          client.write(0x03);\n          client.write(pin);\n          client.write(val);\n          break;\n        case 0x04:  \/\/ analogRead\n          pin = client.read();\n          val = analogRead(pin);\n          client.write(0x04);\n          client.write(pin);\n          client.write(val);\n          break;\n        case 0x05: \/\/ set always send bit\n          pin = client.read();\n          val = client.read();\n          reading[pin] = val;\n          break;\n\n      if(DEBUG)\n        Serial.println(\"Action received: \"+('0'+action));\n\n      int pin, mode, val;\n\n\n      \/\/ These are used in the commented code below there are warnings there that need to be resolved\n      \/\/ otherwise spark.io will not compile and flash\n      \/\/ int type, speed, len, i;\n\n      switch (action) {\n        case 0x00:  \/\/ pinMode\n          pin = client.read();\n          mode = client.read();\n          \/\/mode is modeled after Standard Firmata\n          if (mode == 0x00) {\n            pinMode(pin, INPUT);\n          } else if (mode == 0x02) {\n            pinMode(pin, INPUT_PULLUP);\n          } else if (mode == 0x03) {\n            pinMode(pin, INPUT_PULLDOWN);\n          } else if (mode == 0x01) {\n            pinMode(pin, OUTPUT);\n          }\n          break;\n        case 0x01:  \/\/ digitalWrite\n          pin = client.read();\n          val = client.read();\n          digitalWrite(pin, val);\n          break;\n        case 0x02:  \/\/ analogWrite\n          pin = client.read();\n          val = client.read();\n          analogWrite(pin, val);\n          break;\n        case 0x03:  \/\/ digitalRead\n          pin = client.read();\n          val = digitalRead(pin);\n          client.write(0x03);\n          client.write(pin);\n          client.write(val);\n          break;\n        case 0x04:  \/\/ analogRead\n          pin = client.read();\n          val = analogRead(pin);\n          client.write(0x04);\n          client.write(pin);\n          client.write(val);\n          break;\n        case 0x05:\n          pin = client.read();\n          val = client.read();\n          reading[pin] = val;\n          break;\n\n        \/\/ Serial API\n        case 0x10:  \/\/ serial.begin\n           type = client.read();\n           speed = client.read();\n          if (type == 0) {\n            Serial.begin(SerialSpeed[speed]);\n          } else {\n            Serial1.begin(SerialSpeed[speed]);\n          }\n          break;\n        case 0x11:  \/\/ serial.end\n          type = client.read();\n          if (type == 0) {\n            Serial.end();\n          } else {\n            Serial1.end();\n          }\n          break;\n        case 0x12:  \/\/ serial.peek\n          type = client.read();\n          if (type == 0) {\n            val = Serial.peek();\n          } else {\n            val = Serial1.peek();\n          }\n          client.write(0x07);\n          client.write(type);\n          client.write(val);\n          break;\n        case 0x13:  \/\/ serial.available()\n          type = client.read();\n          if (type == 0) {\n            val = Serial.available();\n          } else {\n            val = Serial1.available();\n          }\n          client.write(0x07);\n          client.write(type);\n          client.write(val);\n          break;\n        case 0x14:  \/\/ serial.write\n          type = client.read();\n          len = client.read();\n          for (i = 0; i < len; i++) {\n            if (type ==0) {\n              Serial.write(client.read());\n            } else {\n              Serial1.write(client.read());\n            }\n          }\n          break;\n        case 0x15: \/\/ serial.read\n          type = client.read();\n          if (type == 0) {\n            val = Serial.read();\n          } else {\n            val = Serial1.read();\n          }\n          client.write(0x16);\n          client.write(type);\n          client.write(val);\n          break;\n        case 0x16: \/\/ serial.flush\n          type = client.read();\n          if (type == 0) {\n            Serial.flush();\n          } else {\n            Serial1.flush();\n          }\n          break;\n\n\n        \/\/ SPI API\n        case 0x20:  \/\/ SPI.begin\n          SPI.begin();\n          break;\n        case 0x21:  \/\/ SPI.end\n          SPI.end();\n          break;\n        case 0x22:  \/\/ SPI.setBitOrder\n          type = client.read();\n          SPI.setBitOrder((type ? MSBFIRST : LSBFIRST));\n          break;\n        case 0x23:  \/\/ SPI.setClockDivider\n          val = client.read();\n          if (val == 0) {\n            SPI.setClockDivider(SPI_CLOCK_DIV2);\n          } else if (val == 1) {\n            SPI.setClockDivider(SPI_CLOCK_DIV4);\n          } else if (val == 2) {\n            SPI.setClockDivider(SPI_CLOCK_DIV8);\n          } else if (val == 3) {\n            SPI.setClockDivider(SPI_CLOCK_DIV16);\n          } else if (val == 4) {\n            SPI.setClockDivider(SPI_CLOCK_DIV32);\n          } else if (val == 5) {\n            SPI.setClockDivider(SPI_CLOCK_DIV64);\n          } else if (val == 6) {\n            SPI.setClockDivider(SPI_CLOCK_DIV128);\n          } else if (val == 7) {\n            SPI.setClockDivider(SPI_CLOCK_DIV256);\n          }\n          break;\n\n        case 0x24:  \/\/ SPI.setDataMode\n          val = client.read();\n          if (val == 0) {\n            SPI.setDataMode(SPI_MODE0);\n          } else if (val == 1) {\n            SPI.setDataMode(SPI_MODE1);\n          } else if (val == 2) {\n            SPI.setDataMode(SPI_MODE2);\n          } else if (val == 3) {\n            SPI.setDataMode(SPI_MODE3);\n          }\n          break;\n\n        case 0x25:  \/\/ SPI.transfer\n          val = client.read();\n          val = SPI.transfer(val);\n          client.write(0x24);\n          client.write(val);\n          break;\n\n\n        \/\/ Wire API\n        case 0x30:  \/\/ Wire.begin\n          address = client.read();\n          if (address == 0) {\n            Wire.begin();\n          } else {\n            Wire.begin(address);\n          }\n          break;\n        case 0x31:  \/\/ Wire.requestFrom\n          address = client.read();\n          val = client.read();\n          stop = client.read();\n\n          Wire.requestFrom(address, val, stop);\n          break;\n        case 0x32:  \/\/ Wire.beginTransmission\n          address = client.read();\n          Wire.beginTransmission(address);\n          break;\n        case 0x33:  \/\/ Wire.endTransmission\n          stop = client.read();\n          val = Wire.endTransmission(stop);\n          client.write(0x33);\n          client.write(val);\n          break;\n        case 0x34:  \/\/ Wire.write\n          len = client.read();\n          uint8_t wireData[len];\n          for (i = 0; i< len; i++) {\n            wireData[i] = client.read();\n          }\n          val = Wire.write(wireData, len);\n          client.write(0x34);\n          client.write(val);\n          break;\n        case 0x35:  \/\/ Wire.available\n          val = Wire.available();\n          client.write(0x35);\n          client.write(val);\n          break;\n        case 0x36:  \/\/ Wire.read\n          val = Wire.read();\n          client.write(0x36);\n          client.write(val);\n          break;\n\n\n        case 0x40:\n          pin = client.read();\n          servos[pin].attach(pin);\n          break;\n\n        case 0x41:\n          pin = client.read();\n          val = client.read();\n          servos[pin].write(val);\n          break;\n\n        case 0x42:\n          pin = client.read();\n          val = client.read();\n          servos[pin].writeMicroseconds(val);\n          break;\n\n\n        case 0x43:\n          pin = client.read();\n          val = servos[pin].read();\n          client.write(0x42);\n          client.write(pin);\n          client.write(val);\n\n          break;\n\n\n        case 0x44:\n          pin = client.read();\n          val = servos[pin].attached();\n          client.write(0x44);\n          client.write(pin);\n          client.write(val);\n          break;\n\n        case 0x45:\n          pin = client.read();\n          servos[pin].detach();\n          break;\n\n\n        default: \/\/ noop\n          break;\n        }\n      }\n    }\n  }\n}\n<commit_msg>Fix copy pasta that resulted from a bad merge conflict resolution in 4abb82b1233d3abc9a319dc9714600d0ddd86183<commit_after>\/**\n  ******************************************************************************\n  * @file    voodoospark.cpp\n  * @author  Chris Williams\n  * @version V1.0.0\n  * @date    24-January-2014\n  * @brief   Exposes the firmware level API through a TCP Connection intiated\n  *          via the spark cloud service\n  ******************************************************************************\n  Copyright (c) 2014 Chris Williams  All rights reserved.\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#define DEBUG 0\nTCPClient client;\n\n\nbyte reading[20];\nbyte previous[20];\n\n\nServo servos[20];\n\n\nlong SerialSpeed[] = {  600, 1200, 2400, 4800, 9600, 14400, 19200, 28800, 38400, 57600, 115200 };\n\n\nvoid ipArrayFromString(byte ipArray[], String ipString) {\n  int dot1 = ipString.indexOf('.');\n  ipArray[0] = ipString.substring(0, dot1).toInt();\n  int dot2 = ipString.indexOf('.', dot1 + 1);\n  ipArray[1] = ipString.substring(dot1 + 1, dot2).toInt();\n  dot1 = ipString.indexOf('.', dot2 + 1);\n  ipArray[2] = ipString.substring(dot2 + 1, dot1).toInt();\n  ipArray[3] = ipString.substring(dot1 + 1).toInt();\n}\n\nint connectToMyServer(String params) {\n  \/\/parse data\n  int colonIndex = params.indexOf(\":\");\n  String ip = params.substring(0, colonIndex);\n  String port = params.substring(colonIndex+1, params.length());\n  if(DEBUG)\n    Serial.println(\"Attempting to connect to server: \"+ip+\":\"+port);\n\n  byte serverAddress[4];\n  ipArrayFromString(serverAddress, ip);\n  int serverPort = port.toInt();\n  if (client.connect(serverAddress, serverPort)) {\n\n    reset();\n\n    if (DEBUG)\n      Serial.println(\"Connected to server: \"+ip+\":\"+port);\n    return 1; \/\/ successfully connected\n\n  } else {\n    if(DEBUG)\n      Serial.println(\"Unable to connect to server: \"+ip+\":\"+port);\n    return -1; \/\/ failed to connect\n  }\n}\n\nvoid reset() {\n  for (int i = 0; i < 20; i++) {\n    reading[i] = 0;\n    previous[i] = 0;\n  }\n}\n\nvoid send(int action, int pin, int value) {\n  if (previous[pin] != value) {\n    client.write(action);\n    client.write(pin);\n    client.write(value);\n  }\n  previous[pin] = value;\n}\n\nvoid report() {\n  for (int i = 0; i < 20; i++) {\n    if (reading[i]) {\n      int dr = (reading[i] & 1);\n      int ar = (reading[i] & 2);\n\n      if (i < 10 && dr) {\n        send(0x03, i, digitalRead(i));\n      } else {\n        if (dr) {\n          send(0x03, i, digitalRead(i));\n        } else {\n          if (ar) {\n            send(0x04, i, analogRead(i));\n          }\n        }\n      }\n    }\n  }\n}\n\nvoid setup() {\n  Spark.function(\"connect\", connectToMyServer);\n  if (DEBUG)\n    Serial.begin(115200);\n}\n\nvoid loop() {\n  report();\n\n  if (client.connected()) {\n    if (client.available()) {\n      \/\/ parse and execute commands\n\n      int action = client.read();\n      if(DEBUG)\n        Serial.println(\"Action received: \"+('0'+action));\n      int pin, mode, val, type, speed, address, stop, len, i;\n      switch (action) {\n        case 0x00:  \/\/ pinMode\n          pin = client.read();\n          mode = client.read();\n          \/\/mode is modeled after Standard Firmata\n          if (mode == 0x00) {\n            pinMode(pin, INPUT);\n          } else if (mode == 0x02) {\n            pinMode(pin, INPUT_PULLUP);\n          } else if (mode == 0x03) {\n            pinMode(pin, INPUT_PULLDOWN);\n          } else if (mode == 0x01) {\n            pinMode(pin, OUTPUT);\n          }\n          break;\n        case 0x01:  \/\/ digitalWrite\n          pin = client.read();\n          val = client.read();\n          digitalWrite(pin, val);\n          break;\n        case 0x02:  \/\/ analogWrite\n          pin = client.read();\n          val = client.read();\n          analogWrite(pin, val);\n          break;\n        case 0x03:  \/\/ digitalRead\n          pin = client.read();\n          val = digitalRead(pin);\n          client.write(0x03);\n          client.write(pin);\n          client.write(val);\n          break;\n        case 0x04:  \/\/ analogRead\n          pin = client.read();\n          val = analogRead(pin);\n          client.write(0x04);\n          client.write(pin);\n          client.write(val);\n          break;\n        case 0x05: \/\/ set always send bit\n          pin = client.read();\n          val = client.read();\n          reading[pin] = val;\n          break;\n\n        \/\/ Serial API\n        case 0x10:  \/\/ serial.begin\n           type = client.read();\n           speed = client.read();\n          if (type == 0) {\n            Serial.begin(SerialSpeed[speed]);\n          } else {\n            Serial1.begin(SerialSpeed[speed]);\n          }\n          break;\n        case 0x11:  \/\/ serial.end\n          type = client.read();\n          if (type == 0) {\n            Serial.end();\n          } else {\n            Serial1.end();\n          }\n          break;\n        case 0x12:  \/\/ serial.peek\n          type = client.read();\n          if (type == 0) {\n            val = Serial.peek();\n          } else {\n            val = Serial1.peek();\n          }\n          client.write(0x07);\n          client.write(type);\n          client.write(val);\n          break;\n        case 0x13:  \/\/ serial.available()\n          type = client.read();\n          if (type == 0) {\n            val = Serial.available();\n          } else {\n            val = Serial1.available();\n          }\n          client.write(0x07);\n          client.write(type);\n          client.write(val);\n          break;\n        case 0x14:  \/\/ serial.write\n          type = client.read();\n          len = client.read();\n          for (i = 0; i < len; i++) {\n            if (type ==0) {\n              Serial.write(client.read());\n            } else {\n              Serial1.write(client.read());\n            }\n          }\n          break;\n        case 0x15: \/\/ serial.read\n          type = client.read();\n          if (type == 0) {\n            val = Serial.read();\n          } else {\n            val = Serial1.read();\n          }\n          client.write(0x16);\n          client.write(type);\n          client.write(val);\n          break;\n        case 0x16: \/\/ serial.flush\n          type = client.read();\n          if (type == 0) {\n            Serial.flush();\n          } else {\n            Serial1.flush();\n          }\n          break;\n\n\n        \/\/ SPI API\n        case 0x20:  \/\/ SPI.begin\n          SPI.begin();\n          break;\n        case 0x21:  \/\/ SPI.end\n          SPI.end();\n          break;\n        case 0x22:  \/\/ SPI.setBitOrder\n          type = client.read();\n          SPI.setBitOrder((type ? MSBFIRST : LSBFIRST));\n          break;\n        case 0x23:  \/\/ SPI.setClockDivider\n          val = client.read();\n          if (val == 0) {\n            SPI.setClockDivider(SPI_CLOCK_DIV2);\n          } else if (val == 1) {\n            SPI.setClockDivider(SPI_CLOCK_DIV4);\n          } else if (val == 2) {\n            SPI.setClockDivider(SPI_CLOCK_DIV8);\n          } else if (val == 3) {\n            SPI.setClockDivider(SPI_CLOCK_DIV16);\n          } else if (val == 4) {\n            SPI.setClockDivider(SPI_CLOCK_DIV32);\n          } else if (val == 5) {\n            SPI.setClockDivider(SPI_CLOCK_DIV64);\n          } else if (val == 6) {\n            SPI.setClockDivider(SPI_CLOCK_DIV128);\n          } else if (val == 7) {\n            SPI.setClockDivider(SPI_CLOCK_DIV256);\n          }\n          break;\n\n        case 0x24:  \/\/ SPI.setDataMode\n          val = client.read();\n          if (val == 0) {\n            SPI.setDataMode(SPI_MODE0);\n          } else if (val == 1) {\n            SPI.setDataMode(SPI_MODE1);\n          } else if (val == 2) {\n            SPI.setDataMode(SPI_MODE2);\n          } else if (val == 3) {\n            SPI.setDataMode(SPI_MODE3);\n          }\n          break;\n\n        case 0x25:  \/\/ SPI.transfer\n          val = client.read();\n          val = SPI.transfer(val);\n          client.write(0x24);\n          client.write(val);\n          break;\n\n\n        \/\/ Wire API\n        case 0x30:  \/\/ Wire.begin\n          address = client.read();\n          if (address == 0) {\n            Wire.begin();\n          } else {\n            Wire.begin(address);\n          }\n          break;\n        case 0x31:  \/\/ Wire.requestFrom\n          address = client.read();\n          val = client.read();\n          stop = client.read();\n\n          Wire.requestFrom(address, val, stop);\n          break;\n        case 0x32:  \/\/ Wire.beginTransmission\n          address = client.read();\n          Wire.beginTransmission(address);\n          break;\n        case 0x33:  \/\/ Wire.endTransmission\n          stop = client.read();\n          val = Wire.endTransmission(stop);\n          client.write(0x33);\n          client.write(val);\n          break;\n        case 0x34:  \/\/ Wire.write\n          len = client.read();\n          uint8_t wireData[len];\n          for (i = 0; i< len; i++) {\n            wireData[i] = client.read();\n          }\n          val = Wire.write(wireData, len);\n          client.write(0x34);\n          client.write(val);\n          break;\n        case 0x35:  \/\/ Wire.available\n          val = Wire.available();\n          client.write(0x35);\n          client.write(val);\n          break;\n        case 0x36:  \/\/ Wire.read\n          val = Wire.read();\n          client.write(0x36);\n          client.write(val);\n          break;\n\n\n        case 0x40:\n          pin = client.read();\n          servos[pin].attach(pin);\n          break;\n        case 0x41:\n          pin = client.read();\n          val = client.read();\n          servos[pin].write(val);\n          break;\n        case 0x42:\n          pin = client.read();\n          val = client.read();\n          servos[pin].writeMicroseconds(val);\n          break;\n        case 0x43:\n          pin = client.read();\n          val = servos[pin].read();\n          client.write(0x43);\n          client.write(pin);\n          client.write(val);\n          break;\n        case 0x44:\n          pin = client.read();\n          val = servos[pin].attached();\n          client.write(0x44);\n          client.write(pin);\n          client.write(val);\n          break;\n        case 0x45:\n          pin = client.read();\n          servos[pin].detach();\n          break;\n\n\n        default: \/\/ noop\n          break;\n\n      } \/\/ <-- This is the end of the switch\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"extensions.h\"\n#include \"extensions\/accelerometer.h\"\n#include \"extensions\/debugconsole.h\"\n#include \"extensions\/deviceinfo.h\"\n#include \"extensions\/hash.h\"\n#include \"extensions\/notification.h\"\n\n#ifdef Q_WS_S60\n#include \"extensions\/camera.h\"\n#include \"extensions\/memorywatcher.h\"\n#endif\n\n#include <QWebFrame>\n\n\nExtensions::Extensions(QWebView *webView) :\n    QObject(webView) {\n\n    m_frame = webView->page()->mainFrame();\n    connect(m_frame, SIGNAL(javaScriptWindowObjectCleared()), SLOT(attachExtensions()));\n\n    m_extensions[\"GapAccelerometer\"] = new Accelerometer(this);\n    m_extensions[\"GapDebugConsole\"] = new DebugConsole(this);\n    m_extensions[\"GapDeviceInfo\"] = new DeviceInfo(this);\n    m_extensions[\"GapHash\"] = new Hash(this);\n    m_extensions[\"GapNotification\"] = new Notification(this);\n\n#ifdef Q_WS_S60\n    m_extensions[\"GapCamera\"] = new Camera(this);\n    m_extensions[\"GapMemoryWatcher\"] = new MemoryWatcher(this);\n#endif\n\n    attachExtensions();\n}\n\nvoid Extensions::attachExtensions() {\n\n    foreach (QString name, m_extensions.keys()) {\n        m_frame->addToJavaScriptWindowObject(name, m_extensions[name]);\n    }\n}\n<commit_msg>Add Geolocation to exported APIs.<commit_after>#include \"extensions.h\"\n#include \"extensions\/accelerometer.h\"\n#include \"extensions\/debugconsole.h\"\n#include \"extensions\/deviceinfo.h\"\n#include \"extensions\/geolocation.h\"\n#include \"extensions\/hash.h\"\n#include \"extensions\/notification.h\"\n\n#ifdef Q_WS_S60\n#include \"extensions\/camera.h\"\n#include \"extensions\/memorywatcher.h\"\n#endif\n\n#include <QWebFrame>\n\n\nExtensions::Extensions(QWebView *webView) :\n    QObject(webView) {\n\n    m_frame = webView->page()->mainFrame();\n    connect(m_frame, SIGNAL(javaScriptWindowObjectCleared()), SLOT(attachExtensions()));\n\n    m_extensions[\"GapAccelerometer\"] = new Accelerometer(this);\n    m_extensions[\"GapDebugConsole\"] = new DebugConsole(this);\n    m_extensions[\"GapDeviceInfo\"] = new DeviceInfo(this);\n    m_extensions[\"GapGeolocation\"] = new Geolocation(this);\n    m_extensions[\"GapHash\"] = new Hash(this);\n    m_extensions[\"GapNotification\"] = new Notification(this);\n\n#ifdef Q_WS_S60\n    m_extensions[\"GapCamera\"] = new Camera(this);\n    m_extensions[\"GapMemoryWatcher\"] = new MemoryWatcher(this);\n#endif\n\n    attachExtensions();\n}\n\nvoid Extensions::attachExtensions() {\n\n    foreach (QString name, m_extensions.keys()) {\n        m_frame->addToJavaScriptWindowObject(name, m_extensions[name]);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"opencv2\/opencv.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include<fstream>\n#include<iostream>\nusing namespace std;\nusing namespace cv;\nstruct data\n{\n  int img[20][20];\n} s1;\nint main()\n{\n  int r,s;\n  Point p,q;\n  Mat img=imread(\"5.jpg\",CV_8UC3);\n  GaussianBlur(img, img, Size(3,3), 1, 0, 2);\n  Mat mserOutMask(img.size(),CV_8UC1,Scalar(0));\n  Ptr<MSER> mserExtractor  = MSER::create();\n\n  vector<vector<Point> > mserContours;\n  vector<KeyPoint> mserKeypoint;\n  vector<Rect> mserBbox;\n  mserExtractor->detectRegions(img, mserContours,  mserBbox);\n\n  for (int i=0; i<mserContours.size(); ++i){\n      for (int j=0; j<mserContours[i].size(); ++j){\n        Point p =  mserContours[i][j];\n          \/\/ cout << p.x << \", \" << p.y << endl;\n          mserOutMask.at<uchar>(p.y, p.x) = 255;\n      }\n  }\n  imshow(\"\",mserOutMask);\n  Mat threshold_output;\n    vector<vector<Point> > contours;\n    vector<Vec4i> hierarchy;\n    threshold(mserOutMask, threshold_output, 100, 255, THRESH_BINARY );\n  imshow(\" \",threshold_output);\n    findContours( threshold_output, contours, hierarchy, RETR_TREE, CHAIN_APPROX_SIMPLE, Point(0, 0) );\n    vector<vector<Point> > contours_poly( contours.size() );\n    vector<Rect> boundRect( contours.size() );\n    for( size_t i = 0; i < contours.size(); i++ )\n       { approxPolyDP( Mat(contours[i]), contours_poly[i], 3, true );\n         boundRect[i] = boundingRect( Mat(contours_poly[i]) );\n       }\nofstream f(\"segments.dat\",ios::binary);\nMat m1(20,20,CV_8UC1);\nfor(size_t j=0;j<contours.size();j++)\n{\n\n      cv::Mat crop = img(boundRect[j]);\nresize(crop,m1,m1.size());\nfor(int x=0;x<20;x++)\nfor(int y=0;y<20;y++)\ns1.img[y][x]=m1.at<uchar>(y,x);\nf.write((char*)&s1,sizeof(s1));\n}\nf.close();\n  imshow(\"mser\", img);\nwaitKey(0);\n  return 0;\n}\n<commit_msg>Delete charsegment.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012 Google\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#include <cassert>\n#include <iostream>\n\n#include \"base\/cprintf.hh\"\n#include \"base\/trie.hh\"\n#include \"base\/types.hh\"\n#include \"unittest\/unittest.hh\"\n\nusing UnitTest::setCase;\n\ntypedef Trie<Addr, uint32_t> TestTrie;\n\nint\nmain()\n{\n    \/\/ Create an empty Ptr and verify it's data pointer is NULL.\n    setCase(\"An empty trie.\");\n    TestTrie trie1;\n    trie1.dump(\"Empty\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"A single entry.\");\n    trie1.insert(0x0123456789abcdef, 40, (uint32_t *)(uintptr_t)(1));\n    trie1.dump(\"One entry\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"Two entries, one on the way to the other.\");\n    TestTrie trie2;\n    trie2.insert(0x0123456789abcdef, 40, (uint32_t *)(uintptr_t)(1));\n    trie2.insert(0x0123456789abcdef, 36, (uint32_t *)(uintptr_t)(2));\n    trie2.dump(\"Two entries inline v1\");\n    cprintf(\"\\n\\n\");\n\n    TestTrie trie3;\n    trie3.insert(0x0123456789abcdef, 36, (uint32_t *)(uintptr_t)(2));\n    trie3.insert(0x0123456789abcdef, 40, (uint32_t *)(uintptr_t)(1));\n    trie3.dump(\"Two entries inline v2\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"Two entries on different paths.\");\n    TestTrie trie4;\n    trie4.insert(0x0123456789abcdef, 40, (uint32_t *)(uintptr_t)(2));\n    trie4.insert(0x0123456776543210, 40, (uint32_t *)(uintptr_t)(1));\n    trie4.dump(\"Two split entries\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"Skipping past an entry but not two.\");\n    TestTrie trie5;\n    trie5.insert(0x0123456789000000, 40, (uint32_t *)(uintptr_t)(4));\n    trie5.insert(0x0123000000000000, 40, (uint32_t *)(uintptr_t)(1));\n    trie5.insert(0x0123456780000000, 40, (uint32_t *)(uintptr_t)(3));\n    trie5.insert(0x0123456700000000, 40, (uint32_t *)(uintptr_t)(2));\n    trie5.dump(\"Complex insertion\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"Looking things up.\");\n    EXPECT_EQ((uintptr_t)trie5.lookup(0x0123000000000000), 1);\n    EXPECT_EQ((uintptr_t)trie5.lookup(0x0123456700000000), 2);\n    EXPECT_EQ((uintptr_t)trie5.lookup(0x0123456780000000), 3);\n    EXPECT_EQ((uintptr_t)trie5.lookup(0x0123456789000000), 4);\n\n    setCase(\"Removing entries.\");\n    TestTrie trie6;\n    TestTrie::Handle node1, node2;\n    trie6.insert(0x0123456789000000, 40, (uint32_t *)(uintptr_t)(4));\n    trie6.insert(0x0123000000000000, 40, (uint32_t *)(uintptr_t)(1));\n    trie6.insert(0x0123456780000000, 40, (uint32_t *)(uintptr_t)(3));\n    node1 = trie6.insert(0x0123456700000000, 40, (uint32_t *)(uintptr_t)(2));\n    node2 = trie6.insert(0x0123456700000000, 32, (uint32_t *)(uintptr_t)(10));\n    trie6.dump(\"Fill before removal\");\n    cprintf(\"\\n\\n\");\n\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123000000000000), 1);\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123456700000000), 10);\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123456780000000), 10);\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123456789000000), 10);\n\n    trie6.remove(node2);\n    trie6.dump(\"One node removed\");\n    cprintf(\"\\n\\n\");\n\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123000000000000), 1);\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123456700000000), 2);\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123456780000000), 3);\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123456789000000), 4);\n\n    trie6.remove(node1);\n    trie6.dump(\"Two nodes removed\");\n    cprintf(\"\\n\\n\");\n\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123000000000000), 1);\n    EXPECT_EQ(trie6.lookup(0x0123456700000000), NULL);\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123456780000000), 3);\n    EXPECT_EQ((uintptr_t)trie6.lookup(0x0123456789000000), 4);\n\n    return UnitTest::printResults();\n}\n<commit_msg>tests: Add a ptr helper function trietest.<commit_after>\/*\n * Copyright (c) 2012 Google\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#include <iostream>\n\n#include \"base\/cprintf.hh\"\n#include \"base\/trie.hh\"\n#include \"base\/types.hh\"\n#include \"unittest\/unittest.hh\"\n\nusing UnitTest::setCase;\n\ntypedef Trie<Addr, uint32_t> TestTrie;\n\nnamespace {\n\nstatic inline uint32_t *ptr(uintptr_t val)\n{\n    return (uint32_t *)val;\n}\n\n} \/\/ anonymous namespace\n\nint\nmain()\n{\n    \/\/ Create an empty Ptr and verify it's data pointer is NULL.\n    setCase(\"An empty trie.\");\n    TestTrie trie1;\n    trie1.dump(\"Empty\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"A single entry.\");\n    trie1.insert(0x0123456789abcdef, 40, ptr(1));\n    trie1.dump(\"One entry\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"Two entries, one on the way to the other.\");\n    TestTrie trie2;\n    trie2.insert(0x0123456789abcdef, 40, ptr(1));\n    trie2.insert(0x0123456789abcdef, 36, ptr(2));\n    trie2.dump(\"Two entries inline v1\");\n    cprintf(\"\\n\\n\");\n\n    TestTrie trie3;\n    trie3.insert(0x0123456789abcdef, 36, ptr(2));\n    trie3.insert(0x0123456789abcdef, 40, ptr(1));\n    trie3.dump(\"Two entries inline v2\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"Two entries on different paths.\");\n    TestTrie trie4;\n    trie4.insert(0x0123456789abcdef, 40, ptr(2));\n    trie4.insert(0x0123456776543210, 40, ptr(1));\n    trie4.dump(\"Two split entries\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"Skipping past an entry but not two.\");\n    TestTrie trie5;\n    trie5.insert(0x0123456789000000, 40, ptr(4));\n    trie5.insert(0x0123000000000000, 40, ptr(1));\n    trie5.insert(0x0123456780000000, 40, ptr(3));\n    trie5.insert(0x0123456700000000, 40, ptr(2));\n    trie5.dump(\"Complex insertion\");\n    cprintf(\"\\n\\n\");\n\n    setCase(\"Looking things up.\");\n    EXPECT_EQ(trie5.lookup(0x0123000000000000), ptr(1));\n    EXPECT_EQ(trie5.lookup(0x0123456700000000), ptr(2));\n    EXPECT_EQ(trie5.lookup(0x0123456780000000), ptr(3));\n    EXPECT_EQ(trie5.lookup(0x0123456789000000), ptr(4));\n\n    setCase(\"Removing entries.\");\n    TestTrie trie6;\n    TestTrie::Handle node1, node2;\n    trie6.insert(0x0123456789000000, 40, ptr(4));\n    trie6.insert(0x0123000000000000, 40, ptr(1));\n    trie6.insert(0x0123456780000000, 40, ptr(3));\n    node1 = trie6.insert(0x0123456700000000, 40, ptr(2));\n    node2 = trie6.insert(0x0123456700000000, 32, ptr(10));\n    trie6.dump(\"Fill before removal\");\n    cprintf(\"\\n\\n\");\n\n    EXPECT_EQ(trie6.lookup(0x0123000000000000), ptr(1));\n    EXPECT_EQ(trie6.lookup(0x0123456700000000), ptr(10));\n    EXPECT_EQ(trie6.lookup(0x0123456780000000), ptr(10));\n    EXPECT_EQ(trie6.lookup(0x0123456789000000), ptr(10));\n\n    trie6.remove(node2);\n    trie6.dump(\"One node removed\");\n    cprintf(\"\\n\\n\");\n\n    EXPECT_EQ(trie6.lookup(0x0123000000000000), ptr(1));\n    EXPECT_EQ(trie6.lookup(0x0123456700000000), ptr(2));\n    EXPECT_EQ(trie6.lookup(0x0123456780000000), ptr(3));\n    EXPECT_EQ(trie6.lookup(0x0123456789000000), ptr(4));\n\n    trie6.remove(node1);\n    trie6.dump(\"Two nodes removed\");\n    cprintf(\"\\n\\n\");\n\n    EXPECT_EQ(trie6.lookup(0x0123000000000000), ptr(1));\n    EXPECT_EQ(trie6.lookup(0x0123456700000000), NULL);\n    EXPECT_EQ(trie6.lookup(0x0123456780000000), ptr(3));\n    EXPECT_EQ(trie6.lookup(0x0123456789000000), ptr(4));\n\n    return UnitTest::printResults();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Base.h\"\r\n#include \"Gamepad.h\"\r\n#include \"Game.h\"\r\n#include \"Button.h\"\r\n\r\nnamespace gameplay\r\n{\r\n\r\nstatic std::vector<Gamepad*> __gamepads;\r\n\r\nGamepad::Gamepad(const char* formPath)\r\n    : _id(\"\"), _handle(0), _vendorId(0), _productId(0), _buttonCount(0), _joystickCount(0), _triggerCount(0), _form(NULL)\r\n{\r\n    GP_ASSERT(formPath);\r\n    _form = Form::create(formPath);\r\n    GP_ASSERT(_form);\r\n    _form->setConsumeInputEvents(false);\r\n    _id = _form->getId();\r\n    _vendorString = \"GamePlay\";\r\n    _productString = \"Virtual Gamepad\";\r\n\r\n    for (int i = 0; i < 2; ++i)\r\n    {\r\n        _uiJoysticks[i] = NULL;\r\n    }\r\n\r\n    for (int i = 0; i < 20; ++i)\r\n    {\r\n        _uiButtons[i] = NULL;\r\n    }\r\n\r\n    bindGamepadControls(_form);\r\n}\r\n\r\nGamepad::Gamepad(const char* id, GamepadHandle handle, unsigned int buttonCount, unsigned int joystickCount, unsigned int triggerCount,\r\n                 unsigned int vendorId, unsigned int productId, char* vendorString, char* productString)\r\n    : _id(id), _handle(handle), _vendorId(vendorId), _productId(productId), _vendorString(vendorString), _productString(productString),\r\n      _buttonCount(buttonCount), _joystickCount(joystickCount), _triggerCount(triggerCount), _form(NULL)\r\n{\r\n}\r\n\r\nGamepad::~Gamepad()\r\n{\r\n    if (_form)\r\n    {\r\n        SAFE_RELEASE(_form);\r\n    }\r\n}\r\n\r\nGamepad* Gamepad::add(const char* id, GamepadHandle handle, unsigned int buttonCount, unsigned int joystickCount, unsigned int triggerCount,\r\n    unsigned int vendorId, unsigned int productId, char* vendorString, char* productString)\r\n{\r\n    Gamepad* gamepad = new Gamepad(id, handle, buttonCount, joystickCount, triggerCount, vendorId, productId, vendorString, productString);\r\n\r\n    __gamepads.push_back(gamepad);\r\n    Game::getInstance()->gamepadEvent(CONNECTED_EVENT, gamepad);\r\n    return gamepad;\r\n}\r\n\r\nGamepad* Gamepad::add(const char* formPath)\r\n{\r\n    Gamepad* gamepad = new Gamepad(formPath);\r\n\r\n    __gamepads.push_back(gamepad);\r\n    Game::getInstance()->gamepadEvent(CONNECTED_EVENT, gamepad);\r\n    return gamepad;\r\n}\r\n\r\nvoid Gamepad::remove(GamepadHandle handle)\r\n{\r\n    std::vector<Gamepad*>::iterator it = __gamepads.begin();\r\n    do\r\n    {\r\n        Gamepad* gamepad = *it;\r\n        if (gamepad->_handle == handle)\r\n        {\r\n            Game::getInstance()->gamepadEvent(DISCONNECTED_EVENT, gamepad);\r\n            it = __gamepads.erase(it);\r\n        }\r\n        else\r\n        {\r\n        \tit++;\r\n        }\r\n    } while (it != __gamepads.end());\r\n}\r\n\r\nvoid Gamepad::remove(Gamepad* gamepad)\r\n{\r\n    std::vector<Gamepad*>::iterator it = __gamepads.begin();\r\n    do\r\n    {\r\n        Gamepad* g = *it;\r\n        if (g == gamepad)\r\n        {\r\n            Game::getInstance()->gamepadEvent(DISCONNECTED_EVENT, g);\r\n            it = __gamepads.erase(it);\r\n        }\r\n        else\r\n        {\r\n        \tit++;\r\n        }\r\n    } while (it != __gamepads.end());\r\n}\r\n\r\nvoid Gamepad::bindGamepadControls(Container* container)\r\n{\r\n    std::vector<Control*> controls = container->getControls();\r\n    std::vector<Control*>::iterator itr = controls.begin();\r\n\r\n    for (; itr != controls.end(); itr++)\r\n    {\r\n        Control* control = *itr;\r\n        GP_ASSERT(control);\r\n\r\n        if (control->isContainer())\r\n        {\r\n            bindGamepadControls((Container*) control);\r\n        }\r\n        else if (std::strcmp(\"joystick\", control->getType()) == 0)\r\n        {\r\n            Joystick* joystick = (Joystick*)control;\r\n            _uiJoysticks[joystick->getIndex()] = joystick;\r\n            _joystickCount++;\r\n        }\r\n        else if (std::strcmp(\"button\", control->getType()) == 0)\r\n        {\r\n            Button* button = (Button*)control;\r\n            _uiButtons[button->getDataBinding()] = button;\r\n            _buttonCount++;\r\n        }   \r\n    }\r\n}\r\n\r\nGamepad* Gamepad::getGamepad(GamepadHandle handle)\r\n{\r\n    std::vector<Gamepad*>::const_iterator it;\r\n    for (it = __gamepads.begin(); it != __gamepads.end(); it++)\r\n    {\r\n        Gamepad* gamepad = *it;\r\n        if (!gamepad->isVirtual() && gamepad->_handle == handle)\r\n        {\r\n            return gamepad;\r\n        }\r\n    }\r\n\r\n    return NULL;\r\n}\r\n\r\nstd::vector<Gamepad*>* Gamepad::getGamepads()\r\n{\r\n    return &__gamepads;\r\n}\r\n\r\nGamepad::ButtonMapping Gamepad::getButtonMappingFromString(const char* string)\r\n{\r\n    if (strcmp(string, \"A\") == 0 || strcmp(string, \"BUTTON_A\") == 0)\r\n        return BUTTON_A;\r\n    else if (strcmp(string, \"B\") == 0 || strcmp(string, \"BUTTON_B\") == 0)\r\n        return BUTTON_B;\r\n    else if (strcmp(string, \"C\") == 0 || strcmp(string, \"BUTTON_C\") == 0)\r\n        return BUTTON_C;\r\n    else if (strcmp(string, \"X\") == 0 || strcmp(string, \"BUTTON_X\") == 0)\r\n        return BUTTON_X;\r\n    else if (strcmp(string, \"Y\") == 0 || strcmp(string, \"BUTTON_Y\") == 0)\r\n        return BUTTON_Y;\r\n    else if (strcmp(string, \"Z\") == 0 || strcmp(string, \"BUTTON_Z\") == 0)\r\n        return BUTTON_Z;\r\n    else if (strcmp(string, \"MENU1\") == 0 || strcmp(string, \"BUTTON_MENU1\") == 0)\r\n        return BUTTON_MENU1;\r\n    else if (strcmp(string, \"MENU2\") == 0 || strcmp(string, \"BUTTON_MENU2\") == 0)\r\n        return BUTTON_MENU2;\r\n    else if (strcmp(string, \"MENU3\") == 0 || strcmp(string, \"BUTTON_MENU3\") == 0)\r\n        return BUTTON_MENU3;\r\n    else if (strcmp(string, \"MENU4\") == 0 || strcmp(string, \"BUTTON_MENU4\") == 0)\r\n        return BUTTON_MENU4;\r\n    else if (strcmp(string, \"L1\") == 0 || strcmp(string, \"BUTTON_L1\") == 0)\r\n        return BUTTON_L1;\r\n    else if (strcmp(string, \"L2\") == 0 || strcmp(string, \"BUTTON_L2\") == 0)\r\n        return BUTTON_L2;\r\n    else if (strcmp(string, \"L3\") == 0 || strcmp(string, \"BUTTON_L3\") == 0)\r\n        return BUTTON_L3;\r\n    else if (strcmp(string, \"R1\") == 0 || strcmp(string, \"BUTTON_R1\") == 0)\r\n        return BUTTON_R1;\r\n    else if (strcmp(string, \"R2\") == 0 || strcmp(string, \"BUTTON_R2\") == 0)\r\n        return BUTTON_R2;\r\n    else if (strcmp(string, \"R3\") == 0 || strcmp(string, \"BUTTON_R3\") == 0)\r\n        return BUTTON_R3;\r\n    else if (strcmp(string, \"UP\") == 0 || strcmp(string, \"BUTTON_UP\") == 0)\r\n        return BUTTON_UP;\r\n    else if (strcmp(string, \"DOWN\") == 0 || strcmp(string, \"BUTTON_DOWN\") == 0)\r\n        return BUTTON_DOWN;\r\n    else if (strcmp(string, \"LEFT\") == 0 || strcmp(string, \"BUTTON_LEFT\") == 0)\r\n        return BUTTON_LEFT;\r\n    else if (strcmp(string, \"RIGHT\") == 0 || strcmp(string, \"BUTTON_RIGHT\") == 0)\r\n        return BUTTON_RIGHT;\r\n\r\n    GP_WARN(\"Unknown GamepadButton string.\");\r\n    return BUTTON_A;\r\n}\r\n\r\nconst char* Gamepad::getId() const\r\n{\r\n    return _id.c_str();\r\n}\r\n\r\nconst unsigned int Gamepad::getVendorId() const\r\n{\r\n    return _vendorId;\r\n}\r\n\r\nconst unsigned int Gamepad::getProductId() const\r\n{\r\n    return _productId;\r\n}\r\n\r\nconst char* Gamepad::getVendorString() const\r\n{\r\n    return _vendorString.c_str();\r\n}\r\n\r\nconst char* Gamepad::getProductString() const\r\n{\r\n    return _productString.c_str();\r\n}\r\n\r\nvoid Gamepad::update(float elapsedTime)\r\n{\r\n    if (_form && _form->isEnabled())\r\n    {\r\n        _form->update(elapsedTime);\r\n    }\r\n    else\r\n    {\r\n        Platform::pollGamepadState(this);\r\n    }\r\n}\r\n\r\nvoid Gamepad::draw()\r\n{\r\n    if (_form && _form->isEnabled())\r\n    {\r\n        _form->draw();\r\n    }\r\n}\r\n\r\nunsigned int Gamepad::getButtonCount() const\r\n{\r\n    return _buttonCount;\r\n}\r\n\r\nbool Gamepad::isButtonDown(ButtonMapping mapping) const\r\n{\r\n    if (_form)\r\n    {\r\n        Button* button = _uiButtons[mapping];\r\n        if (button)\r\n        {\r\n            return (button->getState() == Control::ACTIVE);\r\n        }\r\n        else\r\n        {\r\n            return false;\r\n        }\r\n    }\r\n    else if (_buttons & (1 << mapping))\r\n    {\r\n        return true;\r\n    }\r\n\r\n    return false;\r\n}\r\n\r\nunsigned int Gamepad::getJoystickCount() const\r\n{\r\n    return _joystickCount;\r\n}\r\n\r\nvoid Gamepad::getJoystickValues(unsigned int joystickId, Vector2* outValue) const\r\n{\r\n    GP_ASSERT(joystickId < _joystickCount);\r\n\r\n    if (_form)\r\n    {\r\n        Joystick* joystick = _uiJoysticks[joystickId];\r\n        if (joystick)\r\n        {\r\n            const Vector2& value = joystick->getValue();\r\n            outValue->set(value.x, value.y);\r\n        }\r\n        else\r\n        {\r\n            outValue->set(0.0f, 0.0f);\r\n        }\r\n    }\r\n    else\r\n    {\r\n        outValue->set(_joysticks[joystickId]);\r\n    }\r\n}\r\n\r\nunsigned int Gamepad::getTriggerCount() const\r\n{\r\n    return _triggerCount;\r\n}\r\n\r\nfloat Gamepad::getTriggerValue(unsigned int triggerId) const\r\n{\r\n    GP_ASSERT(triggerId < _triggerCount);\r\n\r\n    if (_form)\r\n    {\r\n        \/\/ Triggers are currently not available for virtual gamepads.\r\n        return 0.0f;\r\n    }\r\n    else\r\n    {\r\n        return _triggers[triggerId];\r\n    }\r\n}\r\n\r\nbool Gamepad::isVirtual() const\r\n{\r\n    return _form;\r\n}\r\n\r\nForm* Gamepad::getForm() const\r\n{\r\n    return _form;\r\n}\r\n\r\n}\r\n<commit_msg>Minor fixes to Gamepad and LightTest.<commit_after>#include \"Base.h\"\r\n#include \"Gamepad.h\"\r\n#include \"Game.h\"\r\n#include \"Button.h\"\r\n\r\nnamespace gameplay\r\n{\r\n\r\nstatic std::vector<Gamepad*> __gamepads;\r\n\r\nGamepad::Gamepad(const char* formPath)\r\n    : _id(\"\"), _handle(0), _vendorId(0), _productId(0), _buttonCount(0), _joystickCount(0), _triggerCount(0), _form(NULL)\r\n{\r\n    GP_ASSERT(formPath);\r\n    _form = Form::create(formPath);\r\n    GP_ASSERT(_form);\r\n    _form->setConsumeInputEvents(false);\r\n    _id = _form->getId();\r\n    _vendorString = \"None\";\r\n    _productString = \"Virtual\";\r\n\r\n    for (int i = 0; i < 2; ++i)\r\n    {\r\n        _uiJoysticks[i] = NULL;\r\n    }\r\n\r\n    for (int i = 0; i < 20; ++i)\r\n    {\r\n        _uiButtons[i] = NULL;\r\n    }\r\n\r\n    bindGamepadControls(_form);\r\n}\r\n\r\nGamepad::Gamepad(const char* id, GamepadHandle handle, unsigned int buttonCount, unsigned int joystickCount, unsigned int triggerCount,\r\n                 unsigned int vendorId, unsigned int productId, char* vendorString, char* productString)\r\n    : _id(id), _handle(handle), _vendorId(vendorId), _productId(productId), _vendorString(vendorString), _productString(productString),\r\n      _buttonCount(buttonCount), _joystickCount(joystickCount), _triggerCount(triggerCount), _form(NULL)\r\n{\r\n}\r\n\r\nGamepad::~Gamepad()\r\n{\r\n    if (_form)\r\n    {\r\n        SAFE_RELEASE(_form);\r\n    }\r\n}\r\n\r\nGamepad* Gamepad::add(const char* id, GamepadHandle handle, unsigned int buttonCount, unsigned int joystickCount, unsigned int triggerCount,\r\n    unsigned int vendorId, unsigned int productId, char* vendorString, char* productString)\r\n{\r\n    Gamepad* gamepad = new Gamepad(id, handle, buttonCount, joystickCount, triggerCount, vendorId, productId, vendorString, productString);\r\n\r\n    __gamepads.push_back(gamepad);\r\n    Game::getInstance()->gamepadEvent(CONNECTED_EVENT, gamepad);\r\n    return gamepad;\r\n}\r\n\r\nGamepad* Gamepad::add(const char* formPath)\r\n{\r\n    Gamepad* gamepad = new Gamepad(formPath);\r\n\r\n    __gamepads.push_back(gamepad);\r\n    Game::getInstance()->gamepadEvent(CONNECTED_EVENT, gamepad);\r\n    return gamepad;\r\n}\r\n\r\nvoid Gamepad::remove(GamepadHandle handle)\r\n{\r\n    std::vector<Gamepad*>::iterator it = __gamepads.begin();\r\n    do\r\n    {\r\n        Gamepad* gamepad = *it;\r\n        if (gamepad->_handle == handle)\r\n        {\r\n            Game::getInstance()->gamepadEvent(DISCONNECTED_EVENT, gamepad);\r\n            it = __gamepads.erase(it);\r\n        }\r\n        else\r\n        {\r\n        \tit++;\r\n        }\r\n    } while (it != __gamepads.end());\r\n}\r\n\r\nvoid Gamepad::remove(Gamepad* gamepad)\r\n{\r\n    std::vector<Gamepad*>::iterator it = __gamepads.begin();\r\n    do\r\n    {\r\n        Gamepad* g = *it;\r\n        if (g == gamepad)\r\n        {\r\n            Game::getInstance()->gamepadEvent(DISCONNECTED_EVENT, g);\r\n            it = __gamepads.erase(it);\r\n        }\r\n        else\r\n        {\r\n        \tit++;\r\n        }\r\n    } while (it != __gamepads.end());\r\n}\r\n\r\nvoid Gamepad::bindGamepadControls(Container* container)\r\n{\r\n    std::vector<Control*> controls = container->getControls();\r\n    std::vector<Control*>::iterator itr = controls.begin();\r\n\r\n    for (; itr != controls.end(); itr++)\r\n    {\r\n        Control* control = *itr;\r\n        GP_ASSERT(control);\r\n\r\n        if (control->isContainer())\r\n        {\r\n            bindGamepadControls((Container*) control);\r\n        }\r\n        else if (std::strcmp(\"joystick\", control->getType()) == 0)\r\n        {\r\n            Joystick* joystick = (Joystick*)control;\r\n            _uiJoysticks[joystick->getIndex()] = joystick;\r\n            _joystickCount++;\r\n        }\r\n        else if (std::strcmp(\"button\", control->getType()) == 0)\r\n        {\r\n            Button* button = (Button*)control;\r\n            _uiButtons[button->getDataBinding()] = button;\r\n            _buttonCount++;\r\n        }   \r\n    }\r\n}\r\n\r\nGamepad* Gamepad::getGamepad(GamepadHandle handle)\r\n{\r\n    std::vector<Gamepad*>::const_iterator it;\r\n    for (it = __gamepads.begin(); it != __gamepads.end(); it++)\r\n    {\r\n        Gamepad* gamepad = *it;\r\n        if (!gamepad->isVirtual() && gamepad->_handle == handle)\r\n        {\r\n            return gamepad;\r\n        }\r\n    }\r\n\r\n    return NULL;\r\n}\r\n\r\nstd::vector<Gamepad*>* Gamepad::getGamepads()\r\n{\r\n    return &__gamepads;\r\n}\r\n\r\nGamepad::ButtonMapping Gamepad::getButtonMappingFromString(const char* string)\r\n{\r\n    if (strcmp(string, \"A\") == 0 || strcmp(string, \"BUTTON_A\") == 0)\r\n        return BUTTON_A;\r\n    else if (strcmp(string, \"B\") == 0 || strcmp(string, \"BUTTON_B\") == 0)\r\n        return BUTTON_B;\r\n    else if (strcmp(string, \"C\") == 0 || strcmp(string, \"BUTTON_C\") == 0)\r\n        return BUTTON_C;\r\n    else if (strcmp(string, \"X\") == 0 || strcmp(string, \"BUTTON_X\") == 0)\r\n        return BUTTON_X;\r\n    else if (strcmp(string, \"Y\") == 0 || strcmp(string, \"BUTTON_Y\") == 0)\r\n        return BUTTON_Y;\r\n    else if (strcmp(string, \"Z\") == 0 || strcmp(string, \"BUTTON_Z\") == 0)\r\n        return BUTTON_Z;\r\n    else if (strcmp(string, \"MENU1\") == 0 || strcmp(string, \"BUTTON_MENU1\") == 0)\r\n        return BUTTON_MENU1;\r\n    else if (strcmp(string, \"MENU2\") == 0 || strcmp(string, \"BUTTON_MENU2\") == 0)\r\n        return BUTTON_MENU2;\r\n    else if (strcmp(string, \"MENU3\") == 0 || strcmp(string, \"BUTTON_MENU3\") == 0)\r\n        return BUTTON_MENU3;\r\n    else if (strcmp(string, \"MENU4\") == 0 || strcmp(string, \"BUTTON_MENU4\") == 0)\r\n        return BUTTON_MENU4;\r\n    else if (strcmp(string, \"L1\") == 0 || strcmp(string, \"BUTTON_L1\") == 0)\r\n        return BUTTON_L1;\r\n    else if (strcmp(string, \"L2\") == 0 || strcmp(string, \"BUTTON_L2\") == 0)\r\n        return BUTTON_L2;\r\n    else if (strcmp(string, \"L3\") == 0 || strcmp(string, \"BUTTON_L3\") == 0)\r\n        return BUTTON_L3;\r\n    else if (strcmp(string, \"R1\") == 0 || strcmp(string, \"BUTTON_R1\") == 0)\r\n        return BUTTON_R1;\r\n    else if (strcmp(string, \"R2\") == 0 || strcmp(string, \"BUTTON_R2\") == 0)\r\n        return BUTTON_R2;\r\n    else if (strcmp(string, \"R3\") == 0 || strcmp(string, \"BUTTON_R3\") == 0)\r\n        return BUTTON_R3;\r\n    else if (strcmp(string, \"UP\") == 0 || strcmp(string, \"BUTTON_UP\") == 0)\r\n        return BUTTON_UP;\r\n    else if (strcmp(string, \"DOWN\") == 0 || strcmp(string, \"BUTTON_DOWN\") == 0)\r\n        return BUTTON_DOWN;\r\n    else if (strcmp(string, \"LEFT\") == 0 || strcmp(string, \"BUTTON_LEFT\") == 0)\r\n        return BUTTON_LEFT;\r\n    else if (strcmp(string, \"RIGHT\") == 0 || strcmp(string, \"BUTTON_RIGHT\") == 0)\r\n        return BUTTON_RIGHT;\r\n\r\n    GP_WARN(\"Unknown GamepadButton string.\");\r\n    return BUTTON_A;\r\n}\r\n\r\nconst char* Gamepad::getId() const\r\n{\r\n    return _id.c_str();\r\n}\r\n\r\nconst unsigned int Gamepad::getVendorId() const\r\n{\r\n    return _vendorId;\r\n}\r\n\r\nconst unsigned int Gamepad::getProductId() const\r\n{\r\n    return _productId;\r\n}\r\n\r\nconst char* Gamepad::getVendorString() const\r\n{\r\n    return _vendorString.c_str();\r\n}\r\n\r\nconst char* Gamepad::getProductString() const\r\n{\r\n    return _productString.c_str();\r\n}\r\n\r\nvoid Gamepad::update(float elapsedTime)\r\n{\r\n    if (_form && _form->isEnabled())\r\n    {\r\n        _form->update(elapsedTime);\r\n    }\r\n    else\r\n    {\r\n        Platform::pollGamepadState(this);\r\n    }\r\n}\r\n\r\nvoid Gamepad::draw()\r\n{\r\n    if (_form && _form->isEnabled())\r\n    {\r\n        _form->draw();\r\n    }\r\n}\r\n\r\nunsigned int Gamepad::getButtonCount() const\r\n{\r\n    return _buttonCount;\r\n}\r\n\r\nbool Gamepad::isButtonDown(ButtonMapping mapping) const\r\n{\r\n    if (_form)\r\n    {\r\n        Button* button = _uiButtons[mapping];\r\n        if (button)\r\n        {\r\n            return (button->getState() == Control::ACTIVE);\r\n        }\r\n        else\r\n        {\r\n            return false;\r\n        }\r\n    }\r\n    else if (_buttons & (1 << mapping))\r\n    {\r\n        return true;\r\n    }\r\n\r\n    return false;\r\n}\r\n\r\nunsigned int Gamepad::getJoystickCount() const\r\n{\r\n    return _joystickCount;\r\n}\r\n\r\nvoid Gamepad::getJoystickValues(unsigned int joystickId, Vector2* outValue) const\r\n{\r\n    GP_ASSERT(joystickId < _joystickCount);\r\n\r\n    if (_form)\r\n    {\r\n        Joystick* joystick = _uiJoysticks[joystickId];\r\n        if (joystick)\r\n        {\r\n            const Vector2& value = joystick->getValue();\r\n            outValue->set(value.x, value.y);\r\n        }\r\n        else\r\n        {\r\n            outValue->set(0.0f, 0.0f);\r\n        }\r\n    }\r\n    else\r\n    {\r\n        outValue->set(_joysticks[joystickId]);\r\n    }\r\n}\r\n\r\nunsigned int Gamepad::getTriggerCount() const\r\n{\r\n    return _triggerCount;\r\n}\r\n\r\nfloat Gamepad::getTriggerValue(unsigned int triggerId) const\r\n{\r\n    GP_ASSERT(triggerId < _triggerCount);\r\n\r\n    if (_form)\r\n    {\r\n        \/\/ Triggers are currently not available for virtual gamepads.\r\n        return 0.0f;\r\n    }\r\n    else\r\n    {\r\n        return _triggers[triggerId];\r\n    }\r\n}\r\n\r\nbool Gamepad::isVirtual() const\r\n{\r\n    return _form;\r\n}\r\n\r\nForm* Gamepad::getForm() const\r\n{\r\n    return _form;\r\n}\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n\n#include \"card.hpp\"\n#include \"game.hpp\"\n#include \"input_helper.hpp\"\n\nusing namespace std;\n\nbool check_play_again();\n\nint main() {\n\n  int num_decks = 1;\n  int shuffle_shoe = 15;\n  Game game(num_decks, shuffle_shoe);\n\n  cout << \"Welcome to the game of blackjack!\" << endl;\n\n  bool play_again = true;\n  while(play_again) {\n\n    game.play_new_hand();\n\n    int chips = game.get_player_chip_count();\n    cout << \"You have \" << chips << \" chips\" << endl;\n\n    if (chips > 0)\n      play_again = check_play_again();\n    else {\n      cout << \"You are out of chips.\" << endl;\n      play_again = false;\n    }\n  }\n  cout << \"Thank you for playing!\" << endl;\n  \n  return 0;\n}\n\n\nbool check_play_again() {\n\n  string prompt = \"Would you like to keep playing? (y\/n) \";\n  char play_again = get_y_or_n_from_user(prompt);\n  if (play_again == 'y')\n    return true;\n  else\n    return false;\n}\n<commit_msg>Changed the default number of decks to 3.<commit_after>#include <iostream>\n#include <vector>\n\n#include \"card.hpp\"\n#include \"game.hpp\"\n#include \"input_helper.hpp\"\n\nusing namespace std;\n\nbool check_play_again();\n\nint main() {\n\n  int num_decks = 3;\n  int shuffle_shoe = 15;\n  Game game(num_decks, shuffle_shoe);\n\n  cout << \"Welcome to the game of blackjack!\" << endl;\n\n  bool play_again = true;\n  while(play_again) {\n\n    game.play_new_hand();\n\n    int chips = game.get_player_chip_count();\n    cout << \"You have \" << chips << \" chips\" << endl;\n\n    if (chips > 0)\n      play_again = check_play_again();\n    else {\n      cout << \"You are out of chips.\" << endl;\n      play_again = false;\n    }\n  }\n  cout << \"Thank you for playing!\" << endl;\n  \n  return 0;\n}\n\n\nbool check_play_again() {\n\n  string prompt = \"Would you like to keep playing? (y\/n) \";\n  char play_again = get_y_or_n_from_user(prompt);\n  if (play_again == 'y')\n    return true;\n  else\n    return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n#include <iostream>\n#include <fstream>\n#include <istream>\n#include <exception>\n#include <stdexcept>\n\n#include \"stan\/gm\/ast.hpp\"\n#include \"stan\/gm\/parser.hpp\"\n#include <stan\/gm\/generator.hpp>\n#include <stan\/gm\/grammars\/program_grammar.hpp>\n#include <stan\/gm\/grammars\/whitespace_grammar.hpp>\n#include <stan\/gm\/grammars\/expression_grammar.hpp>\n#include <stan\/gm\/grammars\/statement_grammar.hpp>\n#include <stan\/gm\/grammars\/var_decls_grammar.hpp>\n\n\nbool is_parsable(const std::string& file_name) {\n  stan::gm::program prog;\n  std::ifstream fs(file_name.c_str());\n  bool parsable = stan::gm::parse(0, fs, file_name, prog);\n  return parsable;\n}\n\nTEST(gm_parser,eight_schools) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/misc\/eight_schools\/eight_schools.stan\"));\n}\n\nTEST(gm_parser,bugs_1_kidney) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/kidney\/kidney.stan\"));\n}\n\/*TEST(gm_parser,bugs_1_leuk) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/leuk\/leuk.stan\"));\n  }*\/\n\/*TEST(gm_parser,bugs_1_leukfr) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/leukfr\/leukfr.stan\"));\n}*\/\nTEST(gm_parser,bugs_1_mice) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/mice\/mice.stan\"));\n}\nTEST(gm_parser,bugs_1_oxford) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/oxford\/oxford.stan\"));\n}\nTEST(gm_parser,bugs_1_rats) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/rats\/rats.stan\"));\n}\nTEST(gm_parser,bugs_1_salm) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/salm\/salm.stan\"));\n}\nTEST(gm_parser,bugs_1_seeds) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/seeds\/seeds.stan\"));\n}\nTEST(gm_parser,bugs_1_surgical) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/surgical\/surgical.stan\"));\n}\n\nTEST(gm_parser,bugs_2_beetles_cloglog) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/beetles\/beetles_cloglog.stan\"));\n}\nTEST(gm_parser,bugs_2_beetles_logit) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/beetles\/beetles_logit.stan\"));\n}\nTEST(gm_parser,bugs_2_beetles_probit) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/beetles\/beetles_probit.stan\"));\n}\nTEST(gm_parser,bugs_2_birats) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/birats\/birats.stan\"));\n}\nTEST(gm_parser,bugs_2_dugongs) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/dugongs\/dugongs.stan\"));\n}\nTEST(gm_parser,bugs_2_eyes) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/eyes\/eyes.stan\"));\n}\nTEST(gm_parser,bugs_2_ice) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/ice\/ice.stan\"));\n}\n\/*TEST(gm_parser,bugs_2_stagnant) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/stagnant\/stagnant.stan\"));\n  }*\/\n\nTEST(gm_parser,good_trunc) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_trunc.stan\"));\n}\n\nTEST(gm_parser,good_vec_constraints) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_trunc.stan\"));\n}\n\nTEST(gm_parser,good_const) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_const.stan\"));\n}\n\nTEST(gm_parser,good_matrix_ops) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_matrix_ops.stan\"));\n}\n\nTEST(gm_parser,good_funs) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_funs.stan\"));\n}\n\nTEST(gm_parser,triangle_lp) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/basic_distributions\/triangle.stan\"));\n}\n\nTEST(gm_parser,good_vars) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_vars.stan\"));\n}\n\nTEST(gm_parser,good_intercept_var) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_intercept_var.stan\"));\n}\n\n\nTEST(gm_parser,good_cov) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_cov.stan\"));\n}\n\nTEST(gm_parser,parsable_test_bad1) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad1.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad2) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad2.stan\"),\n               std::invalid_argument);\n}\n\nTEST(gm_parser,parsable_test_bad3) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad3.stan\"),\n               std::invalid_argument);\n}\n\nTEST(gm_parser,parsable_test_bad4) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad4.stan\"),\n               std::invalid_argument);\n}\n\/\/ TEST(gm_parser,parsable_test_bad5) {\n\/\/    EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad5.stan\"),\n\/\/                 std::invalid_argument);\n\/\/ }\n\nTEST(gm_parser,parsable_test_bad6) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad6.stan\"),\n               std::invalid_argument);\n}\n\nTEST(gm_parser,parsable_test_bad7) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad7.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad8) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad8.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad9) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad9.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad10) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad10.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad11) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad11.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad_trunc) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad_trunc1.stan\"),\n               std::invalid_argument);\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad_trunc2.stan\"),\n               std::invalid_argument);\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad_trunc3.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,function_signatures) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures1.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures2.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures3.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures4.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures5.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures6.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures7.stan\"));\n}\n<commit_msg>updating parser test<commit_after>#include <gtest\/gtest.h>\n#include <iostream>\n#include <fstream>\n#include <istream>\n#include <exception>\n#include <stdexcept>\n\n#include \"stan\/gm\/ast.hpp\"\n#include \"stan\/gm\/parser.hpp\"\n#include <stan\/gm\/generator.hpp>\n#include <stan\/gm\/grammars\/program_grammar.hpp>\n#include <stan\/gm\/grammars\/whitespace_grammar.hpp>\n#include <stan\/gm\/grammars\/expression_grammar.hpp>\n#include <stan\/gm\/grammars\/statement_grammar.hpp>\n#include <stan\/gm\/grammars\/var_decls_grammar.hpp>\n\n\nbool is_parsable(const std::string& file_name) {\n  stan::gm::program prog;\n  std::ifstream fs(file_name.c_str());\n  bool parsable = stan::gm::parse(0, fs, file_name, prog);\n  return parsable;\n}\n\nTEST(gm_parser,eight_schools) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/misc\/eight_schools\/eight_schools.stan\"));\n}\n\nTEST(gm_parser,bugs_1_kidney) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/kidney\/kidney.stan\"));\n}\n\/*TEST(gm_parser,bugs_1_leuk) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/leuk\/leuk.stan\"));\n  }*\/\n\/*TEST(gm_parser,bugs_1_leukfr) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/leukfr\/leukfr.stan\"));\n}*\/\nTEST(gm_parser,bugs_1_mice) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/mice\/mice.stan\"));\n}\nTEST(gm_parser,bugs_1_oxford) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/oxford\/oxford.stan\"));\n}\nTEST(gm_parser,bugs_1_rats) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/rats\/rats.stan\"));\n}\nTEST(gm_parser,bugs_1_salm) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/salm\/salm.stan\"));\n}\nTEST(gm_parser,bugs_1_seeds) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/seeds\/seeds.stan\"));\n}\nTEST(gm_parser,bugs_1_surgical) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol1\/surgical\/surgical.stan\"));\n}\n\nTEST(gm_parser,bugs_2_beetles_cloglog) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/beetles\/beetles_cloglog.stan\"));\n}\nTEST(gm_parser,bugs_2_beetles_logit) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/beetles\/beetles_logit.stan\"));\n}\nTEST(gm_parser,bugs_2_beetles_probit) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/beetles\/beetles_probit.stan\"));\n}\nTEST(gm_parser,bugs_2_birats) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/birats\/birats.stan\"));\n}\nTEST(gm_parser,bugs_2_dugongs) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/dugongs\/dugongs.stan\"));\n}\nTEST(gm_parser,bugs_2_eyes) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/eyes\/eyes.stan\"));\n}\nTEST(gm_parser,bugs_2_ice) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/ice\/ice.stan\"));\n}\n\/*TEST(gm_parser,bugs_2_stagnant) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/bugs_examples\/vol2\/stagnant\/stagnant.stan\"));\n  }*\/\n\nTEST(gm_parser,good_trunc) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_trunc.stan\"));\n}\n\nTEST(gm_parser,good_vec_constraints) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_trunc.stan\"));\n}\n\nTEST(gm_parser,good_const) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_const.stan\"));\n}\n\nTEST(gm_parser,good_matrix_ops) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_matrix_ops.stan\"));\n}\n\nTEST(gm_parser,good_funs) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_funs.stan\"));\n}\n\nTEST(gm_parser,triangle_lp) {\n  EXPECT_TRUE(is_parsable(\"src\/models\/basic_distributions\/triangle.stan\"));\n}\n\nTEST(gm_parser,good_vars) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_vars.stan\"));\n}\n\nTEST(gm_parser,good_intercept_var) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_intercept_var.stan\"));\n}\n\n\nTEST(gm_parser,good_cov) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/good_cov.stan\"));\n}\n\nTEST(gm_parser,parsable_test_bad1) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad1.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad2) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad2.stan\"),\n               std::invalid_argument);\n}\n\nTEST(gm_parser,parsable_test_bad3) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad3.stan\"),\n               std::invalid_argument);\n}\n\nTEST(gm_parser,parsable_test_bad4) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad4.stan\"),\n               std::invalid_argument);\n}\n\/\/ TEST(gm_parser,parsable_test_bad5) {\n\/\/    EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad5.stan\"),\n\/\/                 std::invalid_argument);\n\/\/ }\n\nTEST(gm_parser,parsable_test_bad6) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad6.stan\"),\n               std::invalid_argument);\n}\n\nTEST(gm_parser,parsable_test_bad7) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad7.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad8) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad8.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad9) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad9.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad10) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad10.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad11) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad11.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,parsable_test_bad_trunc) {\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad_trunc1.stan\"),\n               std::invalid_argument);\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad_trunc2.stan\"),\n               std::invalid_argument);\n  EXPECT_THROW(is_parsable(\"src\/test\/gm\/model_specs\/bad_trunc3.stan\"),\n               std::invalid_argument);\n}\nTEST(gm_parser,function_signatures) {\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures1.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures6.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures7.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_bernoulli.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_beta.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_beta_binomial.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_binomial.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_categorical.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_cauchy.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_chi_square.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_dirichlet.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_double_exponential.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_exponential.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_gamma.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_hypergeometric.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_inv_chi_square.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_inv_gamma.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_logistic.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_lognormal.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_multinomial.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_neg_binomial.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_normal.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_ordered_logistic.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_pareto.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_poisson.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_scaled_inv_chi_square.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_student_t.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_uniform.stan\"));\n  EXPECT_TRUE(is_parsable(\"src\/test\/gm\/model_specs\/compiled\/function_signatures_weibull.stan\"));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- Mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*-\n\/\/ Copyright 2009 Google Inc. All Rights Reserved.\n\/\/ Author: fikes@google.com (Andrew Fikes)\n\/\/\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 \"config_for_unittests.h\"\n#include \"page_heap.h\"\n#include \"system-alloc.h\"\n#include <stdio.h>\n#include \"base\/logging.h\"\n#include \"common.h\"\n\nDECLARE_int64(tcmalloc_heap_limit_mb);\n\nnamespace {\n\n\/\/ The system will only release memory if the block size is equal or hight than\n\/\/ system page size.\nstatic bool HaveSystemRelease =\n    TCMalloc_SystemRelease(\n      TCMalloc_SystemAlloc(getpagesize(), NULL, 0), getpagesize());\n\nstatic void CheckStats(const tcmalloc::PageHeap* ph,\n                       uint64_t system_pages,\n                       uint64_t free_pages,\n                       uint64_t unmapped_pages) {\n  tcmalloc::PageHeap::Stats stats = ph->stats();\n\n  if (!HaveSystemRelease) {\n    free_pages += unmapped_pages;\n    unmapped_pages = 0;\n  }\n\n  EXPECT_EQ(system_pages, stats.system_bytes >> kPageShift);\n  EXPECT_EQ(free_pages, stats.free_bytes >> kPageShift);\n  EXPECT_EQ(unmapped_pages, stats.unmapped_bytes >> kPageShift);\n}\n\nstatic void TestPageHeap_Stats() {\n  tcmalloc::PageHeap* ph = new tcmalloc::PageHeap();\n\n  \/\/ Empty page heap\n  CheckStats(ph, 0, 0, 0);\n\n  \/\/ Allocate a span 's1'\n  tcmalloc::Span* s1 = ph->New(256);\n  CheckStats(ph, 256, 0, 0);\n\n  \/\/ Split span 's1' into 's1', 's2'.  Delete 's2'\n  tcmalloc::Span* s2 = ph->Split(s1, 128);\n  ph->Delete(s2);\n  CheckStats(ph, 256, 128, 0);\n\n  \/\/ Unmap deleted span 's2'\n  ph->ReleaseAtLeastNPages(1);\n  CheckStats(ph, 256, 0, 128);\n\n  \/\/ Delete span 's1'\n  ph->Delete(s1);\n  CheckStats(ph, 256, 128, 128);\n\n  delete ph;\n}\n\nstatic void TestPageHeap_Limit() {\n  tcmalloc::PageHeap* ph = new tcmalloc::PageHeap();\n\n  CHECK_EQ(kMaxPages, 1 << (20 - kPageShift));\n\n  \/\/ We do not know much is taken from the system for other purposes,\n  \/\/ so we detect the proper limit:\n  {\n    FLAGS_tcmalloc_heap_limit_mb = 1;\n    tcmalloc::Span* s = NULL;\n    while((s = ph->New(kMaxPages)) == NULL) {\n      FLAGS_tcmalloc_heap_limit_mb++;\n    }\n    FLAGS_tcmalloc_heap_limit_mb += 9;\n    ph->Delete(s);\n    \/\/ We are [10, 11) mb from the limit now.\n  }\n\n  \/\/ Test AllocLarge and GrowHeap first:\n  {\n    tcmalloc::Span * spans[10];\n    for (int i=0; i<10; ++i) {\n      spans[i] = ph->New(kMaxPages);\n      EXPECT_NE(spans[i], NULL);\n    }\n    EXPECT_EQ(ph->New(kMaxPages), NULL);\n\n    for (int i=0; i<10; i += 2) {\n      ph->Delete(spans[i]);\n    }\n\n    tcmalloc::Span *defragmented = ph->New(5 * kMaxPages);\n\n    if (HaveSystemRelease) {\n      \/\/ EnsureLimit should release deleted normal spans\n      EXPECT_NE(defragmented, NULL);\n      EXPECT_TRUE(ph->CheckExpensive());\n      ph->Delete(defragmented);\n    }\n    else\n    {\n      EXPECT_EQ(defragmented, NULL);\n      EXPECT_TRUE(ph->CheckExpensive());\n    }\n\n    for (int i=1; i<10; i += 2) {\n      ph->Delete(spans[i]);\n    }\n  }\n\n  \/\/ Once again, testing small lists this time (twice smaller spans):\n  {\n    tcmalloc::Span * spans[20];\n    for (int i=0; i<20; ++i) {\n      spans[i] = ph->New(kMaxPages >> 1);\n      EXPECT_NE(spans[i], NULL);\n    }\n    \/\/ one more half size allocation may be possible:\n    tcmalloc::Span * lastHalf = ph->New(kMaxPages >> 1);\n    EXPECT_EQ(ph->New(kMaxPages >> 1), NULL);\n\n    for (int i=0; i<20; i += 2) {\n      ph->Delete(spans[i]);\n    }\n\n    for(Length len = kMaxPages >> 2; len < 5 * kMaxPages; len = len << 1)\n    {\n      if(len <= kMaxPages >> 1 || HaveSystemRelease) {\n        tcmalloc::Span *s = ph->New(len);\n        EXPECT_NE(s, NULL);\n        ph->Delete(s);\n      }\n    }\n\n    EXPECT_TRUE(ph->CheckExpensive());\n\n    for (int i=1; i<20; i += 2) {\n      ph->Delete(spans[i]);\n    }\n\n    if (lastHalf != NULL) {\n      ph->Delete(lastHalf);\n    }\n  }\n\n  delete ph;\n}\n\n}  \/\/ namespace\n\nint main(int argc, char **argv) {\n  TestPageHeap_Stats();\n  TestPageHeap_Limit();\n  printf(\"PASS\\n\");\n  \/\/ on windows as part of library destructors we call getenv which\n  \/\/ calls malloc which fails due to our exhausted heap limit. It then\n  \/\/ causes fancy stack overflow because log message we're printing\n  \/\/ for failed allocation somehow cause malloc calls too\n  \/\/\n  \/\/ To keep us out of trouble we just drop malloc limit\n  FLAGS_tcmalloc_heap_limit_mb = 0;\n  return 0;\n}\n<commit_msg>Fix page_heap_test flakiness<commit_after>\/\/ -*- Mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*-\n\/\/ Copyright 2009 Google Inc. All Rights Reserved.\n\/\/ Author: fikes@google.com (Andrew Fikes)\n\/\/\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 \"config_for_unittests.h\"\n\n#include <stdio.h>\n\n#include <memory>\n\n#include \"page_heap.h\"\n#include \"system-alloc.h\"\n#include \"base\/logging.h\"\n#include \"common.h\"\n\nDECLARE_int64(tcmalloc_heap_limit_mb);\n\nnamespace {\n\n\/\/ The system will only release memory if the block size is equal or hight than\n\/\/ system page size.\nstatic bool HaveSystemRelease =\n    TCMalloc_SystemRelease(\n      TCMalloc_SystemAlloc(getpagesize(), NULL, 0), getpagesize());\n\nstatic void CheckStats(const tcmalloc::PageHeap* ph,\n                       uint64_t system_pages,\n                       uint64_t free_pages,\n                       uint64_t unmapped_pages) {\n  tcmalloc::PageHeap::Stats stats = ph->stats();\n\n  if (!HaveSystemRelease) {\n    free_pages += unmapped_pages;\n    unmapped_pages = 0;\n  }\n\n  EXPECT_EQ(system_pages, stats.system_bytes >> kPageShift);\n  EXPECT_EQ(free_pages, stats.free_bytes >> kPageShift);\n  EXPECT_EQ(unmapped_pages, stats.unmapped_bytes >> kPageShift);\n}\n\nstatic void TestPageHeap_Stats() {\n  std::unique_ptr<tcmalloc::PageHeap> ph(new tcmalloc::PageHeap());\n\n  \/\/ Empty page heap\n  CheckStats(ph.get(), 0, 0, 0);\n\n  \/\/ Allocate a span 's1'\n  tcmalloc::Span* s1 = ph->New(256);\n  CheckStats(ph.get(), 256, 0, 0);\n\n  \/\/ Split span 's1' into 's1', 's2'.  Delete 's2'\n  tcmalloc::Span* s2 = ph->Split(s1, 128);\n  ph->Delete(s2);\n  CheckStats(ph.get(), 256, 128, 0);\n\n  \/\/ Unmap deleted span 's2'\n  ph->ReleaseAtLeastNPages(1);\n  CheckStats(ph.get(), 256, 0, 128);\n\n  \/\/ Delete span 's1'\n  ph->Delete(s1);\n  CheckStats(ph.get(), 256, 128, 128);\n}\n\n\/\/ The number of kMaxPages-sized Spans we will allocate and free during the\n\/\/ tests.\n\/\/ We will also do twice this many kMaxPages\/2-sized ones.\nstatic constexpr int kNumberMaxPagesSpans = 10;\n\n\/\/ Allocates all the last-level page tables we will need. Doing this before\n\/\/ calculating the base heap usage is necessary, because otherwise if any of\n\/\/ these are allocated during the main test it will throw the heap usage\n\/\/ calculations off and cause the test to fail.\nstatic void AllocateAllPageTables() {\n  \/\/ Make a separate PageHeap from the main test so the test can start without\n  \/\/ any pages in the lists.\n  std::unique_ptr<tcmalloc::PageHeap> ph(new tcmalloc::PageHeap());\n  tcmalloc::Span *spans[kNumberMaxPagesSpans * 2];\n  for (int i = 0; i < kNumberMaxPagesSpans; ++i) {\n    spans[i] = ph->New(kMaxPages);\n    EXPECT_NE(spans[i], NULL);\n  }\n  for (int i = 0; i < kNumberMaxPagesSpans; ++i) {\n    ph->Delete(spans[i]);\n  }\n  for (int i = 0; i < kNumberMaxPagesSpans * 2; ++i) {\n    spans[i] = ph->New(kMaxPages >> 1);\n    EXPECT_NE(spans[i], NULL);\n  }\n  for (int i = 0; i < kNumberMaxPagesSpans * 2; ++i) {\n    ph->Delete(spans[i]);\n  }\n}\n\nstatic void TestPageHeap_Limit() {\n  AllocateAllPageTables();\n\n  std::unique_ptr<tcmalloc::PageHeap> ph(new tcmalloc::PageHeap());\n\n  CHECK_EQ(kMaxPages, 1 << (20 - kPageShift));\n\n  \/\/ We do not know much is taken from the system for other purposes,\n  \/\/ so we detect the proper limit:\n  {\n    FLAGS_tcmalloc_heap_limit_mb = 1;\n    tcmalloc::Span* s = NULL;\n    while((s = ph->New(kMaxPages)) == NULL) {\n      FLAGS_tcmalloc_heap_limit_mb++;\n    }\n    FLAGS_tcmalloc_heap_limit_mb += kNumberMaxPagesSpans - 1;\n    ph->Delete(s);\n    \/\/ We are [10, 11) mb from the limit now.\n  }\n\n  \/\/ Test AllocLarge and GrowHeap first:\n  {\n    tcmalloc::Span * spans[kNumberMaxPagesSpans];\n    for (int i=0; i<kNumberMaxPagesSpans; ++i) {\n      spans[i] = ph->New(kMaxPages);\n      EXPECT_NE(spans[i], NULL);\n    }\n    EXPECT_EQ(ph->New(kMaxPages), NULL);\n\n    for (int i=0; i<kNumberMaxPagesSpans; i += 2) {\n      ph->Delete(spans[i]);\n    }\n\n    tcmalloc::Span *defragmented =\n        ph->New(kNumberMaxPagesSpans \/ 2 * kMaxPages);\n\n    if (HaveSystemRelease) {\n      \/\/ EnsureLimit should release deleted normal spans\n      EXPECT_NE(defragmented, NULL);\n      EXPECT_TRUE(ph->CheckExpensive());\n      ph->Delete(defragmented);\n    }\n    else\n    {\n      EXPECT_EQ(defragmented, NULL);\n      EXPECT_TRUE(ph->CheckExpensive());\n    }\n\n    for (int i=1; i<kNumberMaxPagesSpans; i += 2) {\n      ph->Delete(spans[i]);\n    }\n  }\n\n  \/\/ Once again, testing small lists this time (twice smaller spans):\n  {\n    tcmalloc::Span * spans[kNumberMaxPagesSpans * 2];\n    for (int i=0; i<kNumberMaxPagesSpans * 2; ++i) {\n      spans[i] = ph->New(kMaxPages >> 1);\n      EXPECT_NE(spans[i], NULL);\n    }\n    \/\/ one more half size allocation may be possible:\n    tcmalloc::Span * lastHalf = ph->New(kMaxPages >> 1);\n    EXPECT_EQ(ph->New(kMaxPages >> 1), NULL);\n\n    for (int i=0; i<kNumberMaxPagesSpans * 2; i += 2) {\n      ph->Delete(spans[i]);\n    }\n\n    for (Length len = kMaxPages >> 2;\n         len < kNumberMaxPagesSpans \/ 2 * kMaxPages; len = len << 1) {\n      if(len <= kMaxPages >> 1 || HaveSystemRelease) {\n        tcmalloc::Span *s = ph->New(len);\n        EXPECT_NE(s, NULL);\n        ph->Delete(s);\n      }\n    }\n\n    EXPECT_TRUE(ph->CheckExpensive());\n\n    for (int i=1; i<kNumberMaxPagesSpans * 2; i += 2) {\n      ph->Delete(spans[i]);\n    }\n\n    if (lastHalf != NULL) {\n      ph->Delete(lastHalf);\n    }\n  }\n}\n\n}  \/\/ namespace\n\nint main(int argc, char **argv) {\n  TestPageHeap_Stats();\n  TestPageHeap_Limit();\n  printf(\"PASS\\n\");\n  \/\/ on windows as part of library destructors we call getenv which\n  \/\/ calls malloc which fails due to our exhausted heap limit. It then\n  \/\/ causes fancy stack overflow because log message we're printing\n  \/\/ for failed allocation somehow cause malloc calls too\n  \/\/\n  \/\/ To keep us out of trouble we just drop malloc limit\n  FLAGS_tcmalloc_heap_limit_mb = 0;\n  return 0;\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_processing\/transient\/wpd_tree.h\"\n\n#include <assert.h>\n#include <math.h>\n#include <string.h>\n\n#include \"webrtc\/base\/scoped_ptr.h\"\n#include \"webrtc\/modules\/audio_processing\/transient\/dyadic_decimator.h\"\n#include \"webrtc\/modules\/audio_processing\/transient\/wpd_node.h\"\n\nnamespace webrtc {\n\nWPDTree::WPDTree(size_t data_length, const float* high_pass_coefficients,\n                 const float* low_pass_coefficients, size_t coefficients_length,\n                 int levels)\n    : data_length_(data_length),\n      levels_(levels),\n      num_nodes_((1 << (levels + 1)) - 1) {\n  assert(data_length > (static_cast<size_t>(1) << levels) &&\n         high_pass_coefficients &&\n         low_pass_coefficients &&\n         levels > 0);\n  \/\/ Size is 1 more, so we can use the array as 1-based. nodes_[0] is never\n  \/\/ allocated.\n  nodes_.reset(new rtc::scoped_ptr<WPDNode>[num_nodes_ + 1]);\n\n  \/\/ Create the first node\n  const float kRootCoefficient = 1.f;  \/\/ Identity Coefficient.\n  nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1));\n  \/\/ Variables used to create the rest of the nodes.\n  size_t index = 1;\n  size_t index_left_child = 0;\n  size_t index_right_child = 0;\n\n  int num_nodes_at_curr_level = 0;\n\n  \/\/ Branching each node in each level to create its children. The last level is\n  \/\/ not branched (all the nodes of that level are leaves).\n  for (int current_level = 0; current_level < levels; ++current_level) {\n    num_nodes_at_curr_level = 1 << current_level;\n    for (int i = 0; i < num_nodes_at_curr_level; ++i) {\n      index = (1 << current_level) + i;\n      \/\/ Obtain the index of the current node children.\n      index_left_child = index * 2;\n      index_right_child = index_left_child + 1;\n      nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() \/ 2,\n                                                 low_pass_coefficients,\n                                                 coefficients_length));\n      nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() \/ 2,\n                                                  high_pass_coefficients,\n                                                  coefficients_length));\n    }\n  }\n}\n\nWPDTree::~WPDTree() {}\n\nWPDNode* WPDTree::NodeAt(int level, int index) {\n  const int kNumNodesAtLevel = 1 << level;\n  if (level < 0 || level > levels_ || index < 0 || index >= kNumNodesAtLevel) {\n    return NULL;\n  }\n  return nodes_[(1 << level) + index].get();\n}\n\nint WPDTree::Update(const float* data, size_t data_length) {\n  if (!data || data_length != data_length_) {\n    return -1;\n  }\n\n  \/\/ Update the root node.\n  int update_result = nodes_[1]->set_data(data, data_length);\n  if (update_result != 0) {\n    return -1;\n  }\n\n  \/\/ Variables used to update the rest of the nodes.\n  size_t index = 1;\n  size_t index_left_child = 0;\n  size_t index_right_child = 0;\n\n  int num_nodes_at_curr_level = 0;\n\n  for (int current_level = 0; current_level < levels_; ++current_level) {\n    num_nodes_at_curr_level = 1 << current_level;\n    for (int i = 0; i < num_nodes_at_curr_level; ++i) {\n      index = (1 << current_level) + i;\n      \/\/ Obtain the index of the current node children.\n      index_left_child = index * 2;\n      index_right_child = index_left_child + 1;\n\n      update_result = nodes_[index_left_child]->Update(\n          nodes_[index]->data(), nodes_[index]->length());\n      if (update_result != 0) {\n        return -1;\n      }\n\n      update_result = nodes_[index_right_child]->Update(\n          nodes_[index]->data(), nodes_[index]->length());\n      if (update_result != 0) {\n        return -1;\n      }\n    }\n  }\n\n  return 0;\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Fix negative shift exponent in WPDTree<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_processing\/transient\/wpd_tree.h\"\n\n#include <assert.h>\n#include <math.h>\n#include <string.h>\n\n#include \"webrtc\/base\/scoped_ptr.h\"\n#include \"webrtc\/modules\/audio_processing\/transient\/dyadic_decimator.h\"\n#include \"webrtc\/modules\/audio_processing\/transient\/wpd_node.h\"\n\nnamespace webrtc {\n\nWPDTree::WPDTree(size_t data_length, const float* high_pass_coefficients,\n                 const float* low_pass_coefficients, size_t coefficients_length,\n                 int levels)\n    : data_length_(data_length),\n      levels_(levels),\n      num_nodes_((1 << (levels + 1)) - 1) {\n  assert(data_length > (static_cast<size_t>(1) << levels) &&\n         high_pass_coefficients &&\n         low_pass_coefficients &&\n         levels > 0);\n  \/\/ Size is 1 more, so we can use the array as 1-based. nodes_[0] is never\n  \/\/ allocated.\n  nodes_.reset(new rtc::scoped_ptr<WPDNode>[num_nodes_ + 1]);\n\n  \/\/ Create the first node\n  const float kRootCoefficient = 1.f;  \/\/ Identity Coefficient.\n  nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1));\n  \/\/ Variables used to create the rest of the nodes.\n  size_t index = 1;\n  size_t index_left_child = 0;\n  size_t index_right_child = 0;\n\n  int num_nodes_at_curr_level = 0;\n\n  \/\/ Branching each node in each level to create its children. The last level is\n  \/\/ not branched (all the nodes of that level are leaves).\n  for (int current_level = 0; current_level < levels; ++current_level) {\n    num_nodes_at_curr_level = 1 << current_level;\n    for (int i = 0; i < num_nodes_at_curr_level; ++i) {\n      index = (1 << current_level) + i;\n      \/\/ Obtain the index of the current node children.\n      index_left_child = index * 2;\n      index_right_child = index_left_child + 1;\n      nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() \/ 2,\n                                                 low_pass_coefficients,\n                                                 coefficients_length));\n      nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() \/ 2,\n                                                  high_pass_coefficients,\n                                                  coefficients_length));\n    }\n  }\n}\n\nWPDTree::~WPDTree() {}\n\nWPDNode* WPDTree::NodeAt(int level, int index) {\n  if (level < 0 || level > levels_ || index < 0 || index >= 1 << level) {\n    return NULL;\n  }\n\n  return nodes_[(1 << level) + index].get();\n}\n\nint WPDTree::Update(const float* data, size_t data_length) {\n  if (!data || data_length != data_length_) {\n    return -1;\n  }\n\n  \/\/ Update the root node.\n  int update_result = nodes_[1]->set_data(data, data_length);\n  if (update_result != 0) {\n    return -1;\n  }\n\n  \/\/ Variables used to update the rest of the nodes.\n  size_t index = 1;\n  size_t index_left_child = 0;\n  size_t index_right_child = 0;\n\n  int num_nodes_at_curr_level = 0;\n\n  for (int current_level = 0; current_level < levels_; ++current_level) {\n    num_nodes_at_curr_level = 1 << current_level;\n    for (int i = 0; i < num_nodes_at_curr_level; ++i) {\n      index = (1 << current_level) + i;\n      \/\/ Obtain the index of the current node children.\n      index_left_child = index * 2;\n      index_right_child = index_left_child + 1;\n\n      update_result = nodes_[index_left_child]->Update(\n          nodes_[index]->data(), nodes_[index]->length());\n      if (update_result != 0) {\n        return -1;\n      }\n\n      update_result = nodes_[index_right_child]->Update(\n          nodes_[index]->data(), nodes_[index]->length());\n      if (update_result != 0) {\n        return -1;\n      }\n    }\n  }\n\n  return 0;\n}\n\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  yas_ui_event.cpp\n\/\/\n\n#include \"yas_ui_event.h\"\n#include <unordered_map>\n#include \"yas_observing.h\"\n#include \"yas_ui_types.h\"\n\nusing namespace yas;\n\n#pragma mark - event::impl\n\nstruct ui::event::impl_base : base::impl, manageable_event::impl {\n    virtual std::type_info const &type() const = 0;\n\n    void set_phase(event_phase &&st) override {\n        this->phase = std::move(st);\n    }\n\n    event_phase phase = ui::event_phase::none;\n};\n\ntemplate <typename T>\nstruct ui::event::impl : impl_base {\n    typename T::type value;\n\n    impl() {\n    }\n\n    impl(impl const &) = delete;\n    impl(impl &&) = delete;\n    impl &operator=(impl const &) = delete;\n    impl &operator=(impl &&) = delete;\n\n    ~impl() = default;\n\n    virtual bool is_equal(std::shared_ptr<base::impl> const &rhs) const override {\n        if (auto casted_rhs = std::dynamic_pointer_cast<impl>(rhs)) {\n            auto &type_info = this->type();\n            if (type_info == casted_rhs->type()) {\n                return this->value == casted_rhs->value;\n            }\n        }\n\n        return false;\n    }\n\n    std::type_info const &type() const override {\n        return typeid(T);\n    }\n};\n\n#pragma mark - event\n\nui::event::event(cursor const &) : base(std::make_shared<impl<ui::cursor>>()) {\n}\n\nui::event::event(touch const &) : base(std::make_shared<impl<ui::touch>>()) {\n}\n\nui::event::event(key const &) : base(std::make_shared<impl<ui::key>>()) {\n}\n\nui::event::event(modifier const &) : base(std::make_shared<impl<ui::modifier>>()) {\n}\n\nui::event::event(std::nullptr_t) : base(nullptr) {\n}\n\nui::event::~event() = default;\n\nui::event_phase ui::event::phase() const {\n    return impl_ptr<impl_base>()->phase;\n}\n\nstd::type_info const &ui::event::type_info() const {\n    return impl_ptr<impl_base>()->type();\n}\n\ntemplate <typename T>\ntypename T::type const &ui::event::get() const {\n    if (auto ip = std::dynamic_pointer_cast<impl<T>>(impl_ptr())) {\n        return ip->value;\n    }\n\n    static const typename T::type _default{};\n    return _default;\n}\n\ntemplate ui::cursor::type const &ui::event::get<ui::cursor>() const;\ntemplate ui::touch::type const &ui::event::get<ui::touch>() const;\ntemplate ui::key::type const &ui::event::get<ui::key>() const;\ntemplate ui::modifier::type const &ui::event::get<ui::modifier>() const;\n\nui::manageable_event &ui::event::manageable() {\n    if (!this->_manageable) {\n        this->_manageable = ui::manageable_event{impl_ptr<ui::manageable_event::impl>()};\n    }\n    return this->_manageable;\n}\n\n#pragma mark - event_manager::impl\n\nstruct ui::event_manager::impl : base::impl, event_inputtable::impl {\n    void input_cursor_event(cursor_event &&value) override {\n        ui::event_phase phase;\n\n        if (value.contains_in_window()) {\n            if (this->_cursor_event) {\n                phase = event_phase::changed;\n            } else {\n                phase = event_phase::began;\n                this->_cursor_event = ui::event{cursor_tag};\n            }\n        } else {\n            phase = event_phase::ended;\n        }\n\n        if (this->_cursor_event) {\n            auto manageable_event = this->_cursor_event.manageable();\n            manageable_event.set_phase(phase);\n            manageable_event.set<cursor>(std::move(value));\n\n            this->_sender.send_value({.method = event_manager::method::cursor_changed, .event = this->_cursor_event});\n\n            if (phase == event_phase::ended) {\n                this->_cursor_event = nullptr;\n            }\n        }\n    }\n\n    void input_touch_event(event_phase const phase, touch_event &&value) override {\n        auto const identifer = value.identifier();\n\n        if (phase == event_phase::began) {\n            if (this->_touch_events.count(identifer) > 0) {\n                return;\n            }\n            ui::event event{touch_tag};\n            this->_touch_events.emplace(std::make_pair(identifer, std::move(event)));\n        }\n\n        if (this->_touch_events.count(identifer) > 0) {\n            auto &event = this->_touch_events.at(identifer);\n            auto manageable_event = event.manageable();\n            manageable_event.set_phase(phase);\n            manageable_event.set<touch>(std::move(value));\n\n            this->_sender.send_value({.method = event_manager::method::touch_changed, .event = event});\n\n            if (phase == event_phase::ended || phase == event_phase::canceled) {\n                this->_touch_events.erase(identifer);\n            }\n        }\n    }\n\n    void input_key_event(event_phase const phase, key_event &&value) override {\n        auto const key_code = value.key_code();\n\n        if (phase == event_phase::began) {\n            if (this->_key_events.count(key_code) > 0) {\n                return;\n            }\n            ui::event event{key_tag};\n            this->_key_events.emplace(std::make_pair(key_code, std::move(event)));\n        }\n\n        if (this->_key_events.count(key_code) > 0) {\n            auto &event = this->_key_events.at(key_code);\n            event.manageable().set_phase(phase);\n            event.manageable().set<key>(value);\n\n            this->_sender.send_value({.method = event_manager::method::key_changed, .event = event});\n\n            if (phase == event_phase::ended || phase == event_phase::canceled) {\n                this->_key_events.erase(key_code);\n            }\n        }\n    }\n\n    void input_modifier_event(modifier_flags &&flags, double const timestamp) override {\n        static auto all_flags = {modifier_flags::alpha_shift, modifier_flags::shift,   modifier_flags::control,\n                                 modifier_flags::alternate,   modifier_flags::command, modifier_flags::numeric_pad,\n                                 modifier_flags::help,        modifier_flags::function};\n\n        for (auto const &flag : all_flags) {\n            if (flags & flag) {\n                if (this->_modifier_events.count(flag) == 0) {\n                    ui::event event{modifier_tag};\n                    event.manageable().set<modifier>(ui::modifier_event{flag, timestamp});\n                    event.manageable().set_phase(ui::event_phase::began);\n                    this->_modifier_events.emplace(std::make_pair(flag, std::move(event)));\n\n                    this->_sender.send_value(\n                        {.method = event_manager::method::modifier_changed, .event = this->_modifier_events.at(flag)});\n                }\n            } else {\n                if (this->_modifier_events.count(flag) > 0) {\n                    auto &event = this->_modifier_events.at(flag);\n                    event.manageable().set_phase(ui::event_phase::ended);\n\n                    this->_sender.send_value({.method = event_manager::method::modifier_changed, .event = event});\n\n                    this->_modifier_events.erase(flag);\n                }\n            }\n        }\n    }\n\n    flow::node<event, context, context, false> begin_flow(method const &method) {\n        return this->_sender.begin()\n            .filter([method](context const &context) { return context.method == method; })\n            .map([](ui::event_manager::context const &context) { return context.event; });\n    }\n\n    flow::node<context, context, context, false> begin_flow() {\n        return this->_sender.begin();\n    }\n\n    event _cursor_event{nullptr};\n    std::unordered_map<uintptr_t, event> _touch_events;\n    std::unordered_map<uint16_t, event> _key_events;\n    std::unordered_map<uint32_t, event> _modifier_events;\n\n    flow::receiver<context> _receiver = nullptr;\n    flow::sender<context> _sender;\n};\n\n#pragma mark - manageable_event\n\nui::manageable_event::manageable_event(std::shared_ptr<impl> impl) : protocol(std::move(impl)) {\n}\n\nui::manageable_event::manageable_event(std::nullptr_t) : protocol(nullptr) {\n}\n\ntemplate <typename T>\nvoid ui::manageable_event::set(typename T::type value) {\n    if (auto ip = std::dynamic_pointer_cast<event::impl<T>>(impl_ptr<impl>())) {\n        ip->value = std::move(value);\n    } else {\n        throw \"dynamic_pointer_cast failed\";\n    }\n}\n\ntemplate void ui::manageable_event::set<ui::cursor>(ui::cursor::type);\ntemplate void ui::manageable_event::set<ui::touch>(ui::touch::type);\ntemplate void ui::manageable_event::set<ui::key>(ui::key::type);\ntemplate void ui::manageable_event::set<ui::modifier>(ui::modifier::type);\n\nvoid ui::manageable_event::set_phase(event_phase phase) {\n    impl_ptr<impl>()->set_phase(std::move(phase));\n}\n\n#pragma mark - event_manager\n\nui::event_manager::event_manager() : base(std::make_shared<impl>()) {\n}\n\nui::event_manager::event_manager(std::nullptr_t) : base(nullptr) {\n}\n\nui::event_manager::~event_manager() = default;\n\nflow::node<ui::event, ui::event_manager::context, ui::event_manager::context, false> ui::event_manager::begin_flow(\n    method const &method) const {\n    return impl_ptr<impl>()->begin_flow(method);\n}\n\nflow::node<ui::event_manager::context, ui::event_manager::context, ui::event_manager::context, false>\nui::event_manager::begin_flow() const {\n    return impl_ptr<impl>()->begin_flow();\n}\n\nui::event_inputtable &ui::event_manager::inputtable() {\n    if (!this->_inputtable) {\n        this->_inputtable = ui::event_inputtable{impl_ptr<ui::event_inputtable::impl>()};\n    }\n    return this->_inputtable;\n}\n\n#pragma mark -\n\nstd::string yas::to_string(ui::event const &event) {\n    std::string type = \"unknown\";\n    std::string values;\n\n    if (event.type_info() == typeid(ui::cursor)) {\n        type = \"cursor\";\n        values = to_string(event.get<ui::cursor>());\n    } else if (event.type_info() == typeid(ui::touch)) {\n        type = \"touch\";\n        values = to_string(event.get<ui::touch>());\n    } else if (event.type_info() == typeid(ui::key)) {\n        type = \"key\";\n        values = to_string(event.get<ui::key>());\n    } else if (event.type_info() == typeid(ui::modifier)) {\n        type = \"modifier\";\n        values = to_string(event.get<ui::modifier>());\n    }\n\n    return \"{phase:\" + to_string(event.phase()) + \", type:\" + type + \", values:\" + values + \"}\";\n}\n\nstd::string yas::to_string(ui::event_manager::method const &method) {\n    switch (method) {\n        case ui::event_manager::method::cursor_changed:\n            return \"cursor_changed\";\n        case ui::event_manager::method::touch_changed:\n            return \"touch_changed\";\n        case ui::event_manager::method::key_changed:\n            return \"key_changed\";\n        case ui::event_manager::method::modifier_changed:\n            return \"modifier_changed\";\n    }\n}\n\nstd::ostream &operator<<(std::ostream &os, yas::ui::event const &event) {\n    os << to_string(event);\n    return os;\n}\n\nstd::ostream &operator<<(std::ostream &os, yas::ui::event_manager::method const &method) {\n    os << to_string(method);\n    return os;\n}\n<commit_msg>fix event<commit_after>\/\/\n\/\/  yas_ui_event.cpp\n\/\/\n\n#include \"yas_ui_event.h\"\n#include <unordered_map>\n#include \"yas_ui_types.h\"\n\nusing namespace yas;\n\n#pragma mark - event::impl\n\nstruct ui::event::impl_base : base::impl, manageable_event::impl {\n    virtual std::type_info const &type() const = 0;\n\n    void set_phase(event_phase &&st) override {\n        this->phase = std::move(st);\n    }\n\n    event_phase phase = ui::event_phase::none;\n};\n\ntemplate <typename T>\nstruct ui::event::impl : impl_base {\n    typename T::type value;\n\n    impl() {\n    }\n\n    impl(impl const &) = delete;\n    impl(impl &&) = delete;\n    impl &operator=(impl const &) = delete;\n    impl &operator=(impl &&) = delete;\n\n    ~impl() = default;\n\n    virtual bool is_equal(std::shared_ptr<base::impl> const &rhs) const override {\n        if (auto casted_rhs = std::dynamic_pointer_cast<impl>(rhs)) {\n            auto &type_info = this->type();\n            if (type_info == casted_rhs->type()) {\n                return this->value == casted_rhs->value;\n            }\n        }\n\n        return false;\n    }\n\n    std::type_info const &type() const override {\n        return typeid(T);\n    }\n};\n\n#pragma mark - event\n\nui::event::event(cursor const &) : base(std::make_shared<impl<ui::cursor>>()) {\n}\n\nui::event::event(touch const &) : base(std::make_shared<impl<ui::touch>>()) {\n}\n\nui::event::event(key const &) : base(std::make_shared<impl<ui::key>>()) {\n}\n\nui::event::event(modifier const &) : base(std::make_shared<impl<ui::modifier>>()) {\n}\n\nui::event::event(std::nullptr_t) : base(nullptr) {\n}\n\nui::event::~event() = default;\n\nui::event_phase ui::event::phase() const {\n    return impl_ptr<impl_base>()->phase;\n}\n\nstd::type_info const &ui::event::type_info() const {\n    return impl_ptr<impl_base>()->type();\n}\n\ntemplate <typename T>\ntypename T::type const &ui::event::get() const {\n    if (auto ip = std::dynamic_pointer_cast<impl<T>>(impl_ptr())) {\n        return ip->value;\n    }\n\n    static const typename T::type _default{};\n    return _default;\n}\n\ntemplate ui::cursor::type const &ui::event::get<ui::cursor>() const;\ntemplate ui::touch::type const &ui::event::get<ui::touch>() const;\ntemplate ui::key::type const &ui::event::get<ui::key>() const;\ntemplate ui::modifier::type const &ui::event::get<ui::modifier>() const;\n\nui::manageable_event &ui::event::manageable() {\n    if (!this->_manageable) {\n        this->_manageable = ui::manageable_event{impl_ptr<ui::manageable_event::impl>()};\n    }\n    return this->_manageable;\n}\n\n#pragma mark - event_manager::impl\n\nstruct ui::event_manager::impl : base::impl, event_inputtable::impl {\n    void input_cursor_event(cursor_event &&value) override {\n        ui::event_phase phase;\n\n        if (value.contains_in_window()) {\n            if (this->_cursor_event) {\n                phase = event_phase::changed;\n            } else {\n                phase = event_phase::began;\n                this->_cursor_event = ui::event{cursor_tag};\n            }\n        } else {\n            phase = event_phase::ended;\n        }\n\n        if (this->_cursor_event) {\n            auto manageable_event = this->_cursor_event.manageable();\n            manageable_event.set_phase(phase);\n            manageable_event.set<cursor>(std::move(value));\n\n            this->_sender.send_value({.method = event_manager::method::cursor_changed, .event = this->_cursor_event});\n\n            if (phase == event_phase::ended) {\n                this->_cursor_event = nullptr;\n            }\n        }\n    }\n\n    void input_touch_event(event_phase const phase, touch_event &&value) override {\n        auto const identifer = value.identifier();\n\n        if (phase == event_phase::began) {\n            if (this->_touch_events.count(identifer) > 0) {\n                return;\n            }\n            ui::event event{touch_tag};\n            this->_touch_events.emplace(std::make_pair(identifer, std::move(event)));\n        }\n\n        if (this->_touch_events.count(identifer) > 0) {\n            auto &event = this->_touch_events.at(identifer);\n            auto manageable_event = event.manageable();\n            manageable_event.set_phase(phase);\n            manageable_event.set<touch>(std::move(value));\n\n            this->_sender.send_value({.method = event_manager::method::touch_changed, .event = event});\n\n            if (phase == event_phase::ended || phase == event_phase::canceled) {\n                this->_touch_events.erase(identifer);\n            }\n        }\n    }\n\n    void input_key_event(event_phase const phase, key_event &&value) override {\n        auto const key_code = value.key_code();\n\n        if (phase == event_phase::began) {\n            if (this->_key_events.count(key_code) > 0) {\n                return;\n            }\n            ui::event event{key_tag};\n            this->_key_events.emplace(std::make_pair(key_code, std::move(event)));\n        }\n\n        if (this->_key_events.count(key_code) > 0) {\n            auto &event = this->_key_events.at(key_code);\n            event.manageable().set_phase(phase);\n            event.manageable().set<key>(value);\n\n            this->_sender.send_value({.method = event_manager::method::key_changed, .event = event});\n\n            if (phase == event_phase::ended || phase == event_phase::canceled) {\n                this->_key_events.erase(key_code);\n            }\n        }\n    }\n\n    void input_modifier_event(modifier_flags &&flags, double const timestamp) override {\n        static auto all_flags = {modifier_flags::alpha_shift, modifier_flags::shift,   modifier_flags::control,\n                                 modifier_flags::alternate,   modifier_flags::command, modifier_flags::numeric_pad,\n                                 modifier_flags::help,        modifier_flags::function};\n\n        for (auto const &flag : all_flags) {\n            if (flags & flag) {\n                if (this->_modifier_events.count(flag) == 0) {\n                    ui::event event{modifier_tag};\n                    event.manageable().set<modifier>(ui::modifier_event{flag, timestamp});\n                    event.manageable().set_phase(ui::event_phase::began);\n                    this->_modifier_events.emplace(std::make_pair(flag, std::move(event)));\n\n                    this->_sender.send_value(\n                        {.method = event_manager::method::modifier_changed, .event = this->_modifier_events.at(flag)});\n                }\n            } else {\n                if (this->_modifier_events.count(flag) > 0) {\n                    auto &event = this->_modifier_events.at(flag);\n                    event.manageable().set_phase(ui::event_phase::ended);\n\n                    this->_sender.send_value({.method = event_manager::method::modifier_changed, .event = event});\n\n                    this->_modifier_events.erase(flag);\n                }\n            }\n        }\n    }\n\n    flow::node<event, context, context, false> begin_flow(method const &method) {\n        return this->_sender.begin()\n            .filter([method](context const &context) { return context.method == method; })\n            .map([](ui::event_manager::context const &context) { return context.event; });\n    }\n\n    flow::node<context, context, context, false> begin_flow() {\n        return this->_sender.begin();\n    }\n\n    event _cursor_event{nullptr};\n    std::unordered_map<uintptr_t, event> _touch_events;\n    std::unordered_map<uint16_t, event> _key_events;\n    std::unordered_map<uint32_t, event> _modifier_events;\n\n    flow::receiver<context> _receiver = nullptr;\n    flow::sender<context> _sender;\n};\n\n#pragma mark - manageable_event\n\nui::manageable_event::manageable_event(std::shared_ptr<impl> impl) : protocol(std::move(impl)) {\n}\n\nui::manageable_event::manageable_event(std::nullptr_t) : protocol(nullptr) {\n}\n\ntemplate <typename T>\nvoid ui::manageable_event::set(typename T::type value) {\n    if (auto ip = std::dynamic_pointer_cast<event::impl<T>>(impl_ptr<impl>())) {\n        ip->value = std::move(value);\n    } else {\n        throw \"dynamic_pointer_cast failed\";\n    }\n}\n\ntemplate void ui::manageable_event::set<ui::cursor>(ui::cursor::type);\ntemplate void ui::manageable_event::set<ui::touch>(ui::touch::type);\ntemplate void ui::manageable_event::set<ui::key>(ui::key::type);\ntemplate void ui::manageable_event::set<ui::modifier>(ui::modifier::type);\n\nvoid ui::manageable_event::set_phase(event_phase phase) {\n    impl_ptr<impl>()->set_phase(std::move(phase));\n}\n\n#pragma mark - event_manager\n\nui::event_manager::event_manager() : base(std::make_shared<impl>()) {\n}\n\nui::event_manager::event_manager(std::nullptr_t) : base(nullptr) {\n}\n\nui::event_manager::~event_manager() = default;\n\nflow::node<ui::event, ui::event_manager::context, ui::event_manager::context, false> ui::event_manager::begin_flow(\n    method const &method) const {\n    return impl_ptr<impl>()->begin_flow(method);\n}\n\nflow::node<ui::event_manager::context, ui::event_manager::context, ui::event_manager::context, false>\nui::event_manager::begin_flow() const {\n    return impl_ptr<impl>()->begin_flow();\n}\n\nui::event_inputtable &ui::event_manager::inputtable() {\n    if (!this->_inputtable) {\n        this->_inputtable = ui::event_inputtable{impl_ptr<ui::event_inputtable::impl>()};\n    }\n    return this->_inputtable;\n}\n\n#pragma mark -\n\nstd::string yas::to_string(ui::event const &event) {\n    std::string type = \"unknown\";\n    std::string values;\n\n    if (event.type_info() == typeid(ui::cursor)) {\n        type = \"cursor\";\n        values = to_string(event.get<ui::cursor>());\n    } else if (event.type_info() == typeid(ui::touch)) {\n        type = \"touch\";\n        values = to_string(event.get<ui::touch>());\n    } else if (event.type_info() == typeid(ui::key)) {\n        type = \"key\";\n        values = to_string(event.get<ui::key>());\n    } else if (event.type_info() == typeid(ui::modifier)) {\n        type = \"modifier\";\n        values = to_string(event.get<ui::modifier>());\n    }\n\n    return \"{phase:\" + to_string(event.phase()) + \", type:\" + type + \", values:\" + values + \"}\";\n}\n\nstd::string yas::to_string(ui::event_manager::method const &method) {\n    switch (method) {\n        case ui::event_manager::method::cursor_changed:\n            return \"cursor_changed\";\n        case ui::event_manager::method::touch_changed:\n            return \"touch_changed\";\n        case ui::event_manager::method::key_changed:\n            return \"key_changed\";\n        case ui::event_manager::method::modifier_changed:\n            return \"modifier_changed\";\n    }\n}\n\nstd::ostream &operator<<(std::ostream &os, yas::ui::event const &event) {\n    os << to_string(event);\n    return os;\n}\n\nstd::ostream &operator<<(std::ostream &os, yas::ui::event_manager::method const &method) {\n    os << to_string(method);\n    return os;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 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 \"consensus\/validation.h\"\n#include \"wallet\/feebumper.h\"\n#include \"wallet\/wallet.h\"\n#include \"policy\/policy.h\"\n#include \"policy\/rbf.h\"\n#include \"validation.h\" \/\/for mempool access\n#include \"txmempool.h\"\n#include \"utilmoneystr.h\"\n#include \"util.h\"\n#include \"net.h\"\n\n\/\/ Calculate the size of the transaction assuming all signatures are max size\n\/\/ Use DummySignatureCreator, which inserts 72 byte signatures everywhere.\n\/\/ TODO: re-use this in CWallet::CreateTransaction (right now\n\/\/ CreateTransaction uses the constructed dummy-signed tx to do a priority\n\/\/ calculation, but we should be able to refactor after priority is removed).\n\/\/ NOTE: this requires that all inputs must be in mapWallet (eg the tx should\n\/\/ be IsAllFromMe).\nint64_t CalculateMaximumSignedTxSize(const CWallet *pWallet, const CTransaction &tx)\n{\n    CMutableTransaction txNew(tx);\n    std::vector<std::pair<const CWalletTx *, unsigned int>> vCoins;\n    \/\/ Look up the inputs.  We should have already checked that this transaction\n    \/\/ IsAllFromMe(ISMINE_SPENDABLE), so every input should already be in our\n    \/\/ wallet, with a valid index into the vout array.\n    for (auto& input : tx.vin) {\n        const auto mi = pWallet->mapWallet.find(input.prevout.hash);\n        assert(mi != pWallet->mapWallet.end() && input.prevout.n < mi->second.tx->vout.size());\n        vCoins.emplace_back(std::make_pair(&(mi->second), input.prevout.n));\n    }\n    if (!pWallet->DummySignTx(txNew, vCoins)) {\n        \/\/ This should never happen, because IsAllFromMe(ISMINE_SPENDABLE)\n        \/\/ implies that we can sign for every input.\n        return -1;\n    }\n    return GetVirtualTransactionSize(txNew);\n}\n\nCFeeBumper::CFeeBumper(const CWallet *pWallet, const uint256 txidIn, int newConfirmTarget, bool specifiedConfirmTarget, CAmount totalFee, bool newTxReplaceable)\n    :\n    txid(txidIn),\n    nOldFee(0),\n    nNewFee(0)\n{\n    vErrors.clear();\n    bumpedTxid.SetNull();\n    AssertLockHeld(pWallet->cs_wallet);\n    if (!pWallet->mapWallet.count(txid)) {\n        vErrors.push_back(\"Invalid or non-wallet transaction id\");\n        currentResult = BumpFeeResult::INVALID_ADDRESS_OR_KEY;\n        return;\n    }\n    auto it = pWallet->mapWallet.find(txid);\n    const CWalletTx& wtx = it->second;\n\n    if (pWallet->HasWalletSpend(txid)) {\n        vErrors.push_back(\"Transaction has descendants in the wallet\");\n        currentResult = BumpFeeResult::INVALID_PARAMETER;\n        return;\n    }\n\n    {\n        LOCK(mempool.cs);\n        auto it_mp = mempool.mapTx.find(txid);\n        if (it_mp != mempool.mapTx.end() && it_mp->GetCountWithDescendants() > 1) {\n            vErrors.push_back(\"Transaction has descendants in the mempool\");\n            currentResult = BumpFeeResult::INVALID_PARAMETER;\n            return;\n        }\n    }\n\n    if (wtx.GetDepthInMainChain() != 0) {\n        vErrors.push_back(\"Transaction has been mined, or is conflicted with a mined transaction\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    if (!SignalsOptInRBF(wtx)) {\n        vErrors.push_back(\"Transaction is not BIP 125 replaceable\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    if (wtx.mapValue.count(\"replaced_by_txid\")) {\n        vErrors.push_back(strprintf(\"Cannot bump transaction %s which was already bumped by transaction %s\", txid.ToString(), wtx.mapValue.at(\"replaced_by_txid\")));\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ check that original tx consists entirely of our inputs\n    \/\/ if not, we can't bump the fee, because the wallet has no way of knowing the value of the other inputs (thus the fee)\n    if (!pWallet->IsAllFromMe(wtx, ISMINE_SPENDABLE)) {\n        vErrors.push_back(\"Transaction contains inputs that don't belong to this wallet\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ figure out which output was change\n    \/\/ if there was no change output or multiple change outputs, fail\n    int nOutput = -1;\n    for (size_t i = 0; i < wtx.tx->vout.size(); ++i) {\n        if (pWallet->IsChange(wtx.tx->vout[i])) {\n            if (nOutput != -1) {\n                vErrors.push_back(\"Transaction has multiple change outputs\");\n                currentResult = BumpFeeResult::WALLET_ERROR;\n                return;\n            }\n            nOutput = i;\n        }\n    }\n    if (nOutput == -1) {\n        vErrors.push_back(\"Transaction does not have a change output\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ Calculate the expected size of the new transaction.\n    int64_t txSize = GetVirtualTransactionSize(*(wtx.tx));\n    const int64_t maxNewTxSize = CalculateMaximumSignedTxSize(pWallet, *wtx.tx);\n    if (maxNewTxSize < 0) {\n        vErrors.push_back(\"Transaction contains inputs that cannot be signed\");\n        currentResult = BumpFeeResult::INVALID_ADDRESS_OR_KEY;\n        return;\n    }\n\n    \/\/ calculate the old fee and fee-rate\n    nOldFee = wtx.GetDebit(ISMINE_SPENDABLE) - wtx.tx->GetValueOut();\n    CFeeRate nOldFeeRate(nOldFee, txSize);\n    CFeeRate nNewFeeRate;\n    \/\/ The wallet uses a conservative WALLET_INCREMENTAL_RELAY_FEE value to\n    \/\/ future proof against changes to network wide policy for incremental relay\n    \/\/ fee that our node may not be aware of.\n    CFeeRate walletIncrementalRelayFee = CFeeRate(WALLET_INCREMENTAL_RELAY_FEE);\n    if (::incrementalRelayFee > walletIncrementalRelayFee) {\n        walletIncrementalRelayFee = ::incrementalRelayFee;\n    }\n\n    if (totalFee > 0) {\n        CAmount minTotalFee = nOldFeeRate.GetFee(maxNewTxSize) + ::incrementalRelayFee.GetFee(maxNewTxSize);\n        if (totalFee < minTotalFee) {\n            vErrors.push_back(strprintf(\"Insufficient totalFee, must be at least %s (oldFee %s + incrementalFee %s)\",\n                                                                FormatMoney(minTotalFee), FormatMoney(nOldFeeRate.GetFee(maxNewTxSize)), FormatMoney(::incrementalRelayFee.GetFee(maxNewTxSize))));\n            currentResult = BumpFeeResult::INVALID_PARAMETER;\n            return;\n        }\n        CAmount requiredFee = pWallet->GetRequiredFee(maxNewTxSize);\n        if (totalFee < requiredFee) {\n            vErrors.push_back(strprintf(\"Insufficient totalFee (cannot be less than required fee %s)\",\n                                                                FormatMoney(requiredFee)));\n            currentResult = BumpFeeResult::INVALID_PARAMETER;\n            return;\n        }\n        nNewFee = totalFee;\n        nNewFeeRate = CFeeRate(totalFee, maxNewTxSize);\n    } else {\n        \/\/ if user specified a confirm target then don't consider any global payTxFee\n        if (specifiedConfirmTarget) {\n            nNewFee = pWallet->GetMinimumFee(maxNewTxSize, newConfirmTarget, mempool, CAmount(0));\n        }\n        \/\/ otherwise use the regular wallet logic to select payTxFee or default confirm target\n        else {\n            nNewFee = pWallet->GetMinimumFee(maxNewTxSize, newConfirmTarget, mempool);\n        }\n\n        nNewFeeRate = CFeeRate(nNewFee, maxNewTxSize);\n\n        \/\/ New fee rate must be at least old rate + minimum incremental relay rate\n        \/\/ walletIncrementalRelayFee.GetFeePerK() should be exact, because it's initialized\n        \/\/ in that unit (fee per kb).\n        \/\/ However, nOldFeeRate is a calculated value from the tx fee\/size, so\n        \/\/ add 1 satoshi to the result, because it may have been rounded down.\n        if (nNewFeeRate.GetFeePerK() < nOldFeeRate.GetFeePerK() + 1 + walletIncrementalRelayFee.GetFeePerK()) {\n            nNewFeeRate = CFeeRate(nOldFeeRate.GetFeePerK() + 1 + walletIncrementalRelayFee.GetFeePerK());\n            nNewFee = nNewFeeRate.GetFee(maxNewTxSize);\n        }\n    }\n\n    \/\/ Check that in all cases the new fee doesn't violate maxTxFee\n     if (nNewFee > maxTxFee) {\n         vErrors.push_back(strprintf(\"Specified or calculated fee %s is too high (cannot be higher than maxTxFee %s)\",\n                               FormatMoney(nNewFee), FormatMoney(maxTxFee)));\n         currentResult = BumpFeeResult::WALLET_ERROR;\n         return;\n     }\n\n    \/\/ check that fee rate is higher than mempool's minimum fee\n    \/\/ (no point in bumping fee if we know that the new tx won't be accepted to the mempool)\n    \/\/ This may occur if the user set TotalFee or paytxfee too low, if fallbackfee is too low, or, perhaps,\n    \/\/ in a rare situation where the mempool minimum fee increased significantly since the fee estimation just a\n    \/\/ moment earlier. In this case, we report an error to the user, who may use totalFee to make an adjustment.\n    CFeeRate minMempoolFeeRate = mempool.GetMinFee(GetArg(\"-maxmempool\", DEFAULT_MAX_MEMPOOL_SIZE) * 1000000);\n    if (nNewFeeRate.GetFeePerK() < minMempoolFeeRate.GetFeePerK()) {\n        vErrors.push_back(strprintf(\"New fee rate (%s) is less than the minimum fee rate (%s) to get into the mempool. totalFee value should to be at least %s or settxfee value should be at least %s to add transaction.\", FormatMoney(nNewFeeRate.GetFeePerK()), FormatMoney(minMempoolFeeRate.GetFeePerK()), FormatMoney(minMempoolFeeRate.GetFee(maxNewTxSize)), FormatMoney(minMempoolFeeRate.GetFeePerK())));\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ Now modify the output to increase the fee.\n    \/\/ If the output is not large enough to pay the fee, fail.\n    CAmount nDelta = nNewFee - nOldFee;\n    assert(nDelta > 0);\n    mtx =  *wtx.tx;\n    CTxOut* poutput = &(mtx.vout[nOutput]);\n    if (poutput->nValue < nDelta) {\n        vErrors.push_back(\"Change output is too small to bump the fee\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ If the output would become dust, discard it (converting the dust to fee)\n    poutput->nValue -= nDelta;\n    if (poutput->nValue <= poutput->GetDustThreshold(::dustRelayFee)) {\n        LogPrint(BCLog::RPC, \"Bumping fee and discarding dust output\\n\");\n        nNewFee += poutput->nValue;\n        mtx.vout.erase(mtx.vout.begin() + nOutput);\n    }\n\n    \/\/ Mark new tx not replaceable, if requested.\n    if (!newTxReplaceable) {\n        for (auto& input : mtx.vin) {\n            if (input.nSequence < 0xfffffffe) input.nSequence = 0xfffffffe;\n        }\n    }\n\n    currentResult = BumpFeeResult::OK;\n}\n\nbool CFeeBumper::commit(CWallet *pWallet)\n{\n    AssertLockHeld(pWallet->cs_wallet);\n    vErrors.clear();\n    if (txid.IsNull() || !pWallet->mapWallet.count(txid)) {\n        vErrors.push_back(\"Invalid or non-wallet transaction id\");\n        currentResult = BumpFeeResult::MISC_ERROR;\n    }\n    CWalletTx& oldWtx = pWallet->mapWallet[txid];\n\n    CWalletTx wtxBumped(pWallet, MakeTransactionRef(std::move(mtx)));\n    \/\/ commit\/broadcast the tx\n    CReserveKey reservekey(pWallet);\n    wtxBumped.mapValue = oldWtx.mapValue;\n    wtxBumped.mapValue[\"replaces_txid\"] = oldWtx.GetHash().ToString();\n    wtxBumped.vOrderForm = oldWtx.vOrderForm;\n    wtxBumped.strFromAccount = oldWtx.strFromAccount;\n    wtxBumped.fTimeReceivedIsTxTime = true;\n    wtxBumped.fFromMe = true;\n    CValidationState state;\n    if (!pWallet->CommitTransaction(wtxBumped, reservekey, g_connman.get(), state)) {\n        \/\/ NOTE: CommitTransaction never returns false, so this should never happen.\n        vErrors.push_back(strprintf(\"Error: The transaction was rejected! Reason given: %s\", state.GetRejectReason()));\n        return false;\n    }\n\n    bumpedTxid = wtxBumped.GetHash();\n    if (state.IsInvalid()) {\n        \/\/ This can happen if the mempool rejected the transaction.  Report\n        \/\/ what happened in the \"errors\" response.\n        vErrors.push_back(strprintf(\"Error: The transaction was rejected: %s\", FormatStateMessage(state)));\n    }\n\n    \/\/ mark the original tx as bumped\n    if (!pWallet->MarkReplaced(oldWtx.GetHash(), wtxBumped.GetHash())) {\n        \/\/ TODO: see if JSON-RPC has a standard way of returning a response\n        \/\/ along with an exception. It would be good to return information about\n        \/\/ wtxBumped to the caller even if marking the original transaction\n        \/\/ replaced does not succeed for some reason.\n        vErrors.push_back(\"Error: Created new bumpfee transaction but could not mark the original transaction as replaced.\");\n    }\n    return true;\n}\n\n<commit_msg>Directly abort execution in FeeBumper::commit if wallet or tx is not available<commit_after>\/\/ Copyright (c) 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 \"consensus\/validation.h\"\n#include \"wallet\/feebumper.h\"\n#include \"wallet\/wallet.h\"\n#include \"policy\/policy.h\"\n#include \"policy\/rbf.h\"\n#include \"validation.h\" \/\/for mempool access\n#include \"txmempool.h\"\n#include \"utilmoneystr.h\"\n#include \"util.h\"\n#include \"net.h\"\n\n\/\/ Calculate the size of the transaction assuming all signatures are max size\n\/\/ Use DummySignatureCreator, which inserts 72 byte signatures everywhere.\n\/\/ TODO: re-use this in CWallet::CreateTransaction (right now\n\/\/ CreateTransaction uses the constructed dummy-signed tx to do a priority\n\/\/ calculation, but we should be able to refactor after priority is removed).\n\/\/ NOTE: this requires that all inputs must be in mapWallet (eg the tx should\n\/\/ be IsAllFromMe).\nint64_t CalculateMaximumSignedTxSize(const CWallet *pWallet, const CTransaction &tx)\n{\n    CMutableTransaction txNew(tx);\n    std::vector<std::pair<const CWalletTx *, unsigned int>> vCoins;\n    \/\/ Look up the inputs.  We should have already checked that this transaction\n    \/\/ IsAllFromMe(ISMINE_SPENDABLE), so every input should already be in our\n    \/\/ wallet, with a valid index into the vout array.\n    for (auto& input : tx.vin) {\n        const auto mi = pWallet->mapWallet.find(input.prevout.hash);\n        assert(mi != pWallet->mapWallet.end() && input.prevout.n < mi->second.tx->vout.size());\n        vCoins.emplace_back(std::make_pair(&(mi->second), input.prevout.n));\n    }\n    if (!pWallet->DummySignTx(txNew, vCoins)) {\n        \/\/ This should never happen, because IsAllFromMe(ISMINE_SPENDABLE)\n        \/\/ implies that we can sign for every input.\n        return -1;\n    }\n    return GetVirtualTransactionSize(txNew);\n}\n\nCFeeBumper::CFeeBumper(const CWallet *pWallet, const uint256 txidIn, int newConfirmTarget, bool specifiedConfirmTarget, CAmount totalFee, bool newTxReplaceable)\n    :\n    txid(txidIn),\n    nOldFee(0),\n    nNewFee(0)\n{\n    vErrors.clear();\n    bumpedTxid.SetNull();\n    AssertLockHeld(pWallet->cs_wallet);\n    if (!pWallet->mapWallet.count(txid)) {\n        vErrors.push_back(\"Invalid or non-wallet transaction id\");\n        currentResult = BumpFeeResult::INVALID_ADDRESS_OR_KEY;\n        return;\n    }\n    auto it = pWallet->mapWallet.find(txid);\n    const CWalletTx& wtx = it->second;\n\n    if (pWallet->HasWalletSpend(txid)) {\n        vErrors.push_back(\"Transaction has descendants in the wallet\");\n        currentResult = BumpFeeResult::INVALID_PARAMETER;\n        return;\n    }\n\n    {\n        LOCK(mempool.cs);\n        auto it_mp = mempool.mapTx.find(txid);\n        if (it_mp != mempool.mapTx.end() && it_mp->GetCountWithDescendants() > 1) {\n            vErrors.push_back(\"Transaction has descendants in the mempool\");\n            currentResult = BumpFeeResult::INVALID_PARAMETER;\n            return;\n        }\n    }\n\n    if (wtx.GetDepthInMainChain() != 0) {\n        vErrors.push_back(\"Transaction has been mined, or is conflicted with a mined transaction\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    if (!SignalsOptInRBF(wtx)) {\n        vErrors.push_back(\"Transaction is not BIP 125 replaceable\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    if (wtx.mapValue.count(\"replaced_by_txid\")) {\n        vErrors.push_back(strprintf(\"Cannot bump transaction %s which was already bumped by transaction %s\", txid.ToString(), wtx.mapValue.at(\"replaced_by_txid\")));\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ check that original tx consists entirely of our inputs\n    \/\/ if not, we can't bump the fee, because the wallet has no way of knowing the value of the other inputs (thus the fee)\n    if (!pWallet->IsAllFromMe(wtx, ISMINE_SPENDABLE)) {\n        vErrors.push_back(\"Transaction contains inputs that don't belong to this wallet\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ figure out which output was change\n    \/\/ if there was no change output or multiple change outputs, fail\n    int nOutput = -1;\n    for (size_t i = 0; i < wtx.tx->vout.size(); ++i) {\n        if (pWallet->IsChange(wtx.tx->vout[i])) {\n            if (nOutput != -1) {\n                vErrors.push_back(\"Transaction has multiple change outputs\");\n                currentResult = BumpFeeResult::WALLET_ERROR;\n                return;\n            }\n            nOutput = i;\n        }\n    }\n    if (nOutput == -1) {\n        vErrors.push_back(\"Transaction does not have a change output\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ Calculate the expected size of the new transaction.\n    int64_t txSize = GetVirtualTransactionSize(*(wtx.tx));\n    const int64_t maxNewTxSize = CalculateMaximumSignedTxSize(pWallet, *wtx.tx);\n    if (maxNewTxSize < 0) {\n        vErrors.push_back(\"Transaction contains inputs that cannot be signed\");\n        currentResult = BumpFeeResult::INVALID_ADDRESS_OR_KEY;\n        return;\n    }\n\n    \/\/ calculate the old fee and fee-rate\n    nOldFee = wtx.GetDebit(ISMINE_SPENDABLE) - wtx.tx->GetValueOut();\n    CFeeRate nOldFeeRate(nOldFee, txSize);\n    CFeeRate nNewFeeRate;\n    \/\/ The wallet uses a conservative WALLET_INCREMENTAL_RELAY_FEE value to\n    \/\/ future proof against changes to network wide policy for incremental relay\n    \/\/ fee that our node may not be aware of.\n    CFeeRate walletIncrementalRelayFee = CFeeRate(WALLET_INCREMENTAL_RELAY_FEE);\n    if (::incrementalRelayFee > walletIncrementalRelayFee) {\n        walletIncrementalRelayFee = ::incrementalRelayFee;\n    }\n\n    if (totalFee > 0) {\n        CAmount minTotalFee = nOldFeeRate.GetFee(maxNewTxSize) + ::incrementalRelayFee.GetFee(maxNewTxSize);\n        if (totalFee < minTotalFee) {\n            vErrors.push_back(strprintf(\"Insufficient totalFee, must be at least %s (oldFee %s + incrementalFee %s)\",\n                                                                FormatMoney(minTotalFee), FormatMoney(nOldFeeRate.GetFee(maxNewTxSize)), FormatMoney(::incrementalRelayFee.GetFee(maxNewTxSize))));\n            currentResult = BumpFeeResult::INVALID_PARAMETER;\n            return;\n        }\n        CAmount requiredFee = pWallet->GetRequiredFee(maxNewTxSize);\n        if (totalFee < requiredFee) {\n            vErrors.push_back(strprintf(\"Insufficient totalFee (cannot be less than required fee %s)\",\n                                                                FormatMoney(requiredFee)));\n            currentResult = BumpFeeResult::INVALID_PARAMETER;\n            return;\n        }\n        nNewFee = totalFee;\n        nNewFeeRate = CFeeRate(totalFee, maxNewTxSize);\n    } else {\n        \/\/ if user specified a confirm target then don't consider any global payTxFee\n        if (specifiedConfirmTarget) {\n            nNewFee = pWallet->GetMinimumFee(maxNewTxSize, newConfirmTarget, mempool, CAmount(0));\n        }\n        \/\/ otherwise use the regular wallet logic to select payTxFee or default confirm target\n        else {\n            nNewFee = pWallet->GetMinimumFee(maxNewTxSize, newConfirmTarget, mempool);\n        }\n\n        nNewFeeRate = CFeeRate(nNewFee, maxNewTxSize);\n\n        \/\/ New fee rate must be at least old rate + minimum incremental relay rate\n        \/\/ walletIncrementalRelayFee.GetFeePerK() should be exact, because it's initialized\n        \/\/ in that unit (fee per kb).\n        \/\/ However, nOldFeeRate is a calculated value from the tx fee\/size, so\n        \/\/ add 1 satoshi to the result, because it may have been rounded down.\n        if (nNewFeeRate.GetFeePerK() < nOldFeeRate.GetFeePerK() + 1 + walletIncrementalRelayFee.GetFeePerK()) {\n            nNewFeeRate = CFeeRate(nOldFeeRate.GetFeePerK() + 1 + walletIncrementalRelayFee.GetFeePerK());\n            nNewFee = nNewFeeRate.GetFee(maxNewTxSize);\n        }\n    }\n\n    \/\/ Check that in all cases the new fee doesn't violate maxTxFee\n     if (nNewFee > maxTxFee) {\n         vErrors.push_back(strprintf(\"Specified or calculated fee %s is too high (cannot be higher than maxTxFee %s)\",\n                               FormatMoney(nNewFee), FormatMoney(maxTxFee)));\n         currentResult = BumpFeeResult::WALLET_ERROR;\n         return;\n     }\n\n    \/\/ check that fee rate is higher than mempool's minimum fee\n    \/\/ (no point in bumping fee if we know that the new tx won't be accepted to the mempool)\n    \/\/ This may occur if the user set TotalFee or paytxfee too low, if fallbackfee is too low, or, perhaps,\n    \/\/ in a rare situation where the mempool minimum fee increased significantly since the fee estimation just a\n    \/\/ moment earlier. In this case, we report an error to the user, who may use totalFee to make an adjustment.\n    CFeeRate minMempoolFeeRate = mempool.GetMinFee(GetArg(\"-maxmempool\", DEFAULT_MAX_MEMPOOL_SIZE) * 1000000);\n    if (nNewFeeRate.GetFeePerK() < minMempoolFeeRate.GetFeePerK()) {\n        vErrors.push_back(strprintf(\"New fee rate (%s) is less than the minimum fee rate (%s) to get into the mempool. totalFee value should to be at least %s or settxfee value should be at least %s to add transaction.\", FormatMoney(nNewFeeRate.GetFeePerK()), FormatMoney(minMempoolFeeRate.GetFeePerK()), FormatMoney(minMempoolFeeRate.GetFee(maxNewTxSize)), FormatMoney(minMempoolFeeRate.GetFeePerK())));\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ Now modify the output to increase the fee.\n    \/\/ If the output is not large enough to pay the fee, fail.\n    CAmount nDelta = nNewFee - nOldFee;\n    assert(nDelta > 0);\n    mtx =  *wtx.tx;\n    CTxOut* poutput = &(mtx.vout[nOutput]);\n    if (poutput->nValue < nDelta) {\n        vErrors.push_back(\"Change output is too small to bump the fee\");\n        currentResult = BumpFeeResult::WALLET_ERROR;\n        return;\n    }\n\n    \/\/ If the output would become dust, discard it (converting the dust to fee)\n    poutput->nValue -= nDelta;\n    if (poutput->nValue <= poutput->GetDustThreshold(::dustRelayFee)) {\n        LogPrint(BCLog::RPC, \"Bumping fee and discarding dust output\\n\");\n        nNewFee += poutput->nValue;\n        mtx.vout.erase(mtx.vout.begin() + nOutput);\n    }\n\n    \/\/ Mark new tx not replaceable, if requested.\n    if (!newTxReplaceable) {\n        for (auto& input : mtx.vin) {\n            if (input.nSequence < 0xfffffffe) input.nSequence = 0xfffffffe;\n        }\n    }\n\n    currentResult = BumpFeeResult::OK;\n}\n\nbool CFeeBumper::commit(CWallet *pWallet)\n{\n    AssertLockHeld(pWallet->cs_wallet);\n    vErrors.clear();\n    if (txid.IsNull() || !pWallet->mapWallet.count(txid)) {\n        vErrors.push_back(\"Invalid or non-wallet transaction id\");\n        currentResult = BumpFeeResult::MISC_ERROR;\n        return false;\n    }\n    CWalletTx& oldWtx = pWallet->mapWallet[txid];\n\n    CWalletTx wtxBumped(pWallet, MakeTransactionRef(std::move(mtx)));\n    \/\/ commit\/broadcast the tx\n    CReserveKey reservekey(pWallet);\n    wtxBumped.mapValue = oldWtx.mapValue;\n    wtxBumped.mapValue[\"replaces_txid\"] = oldWtx.GetHash().ToString();\n    wtxBumped.vOrderForm = oldWtx.vOrderForm;\n    wtxBumped.strFromAccount = oldWtx.strFromAccount;\n    wtxBumped.fTimeReceivedIsTxTime = true;\n    wtxBumped.fFromMe = true;\n    CValidationState state;\n    if (!pWallet->CommitTransaction(wtxBumped, reservekey, g_connman.get(), state)) {\n        \/\/ NOTE: CommitTransaction never returns false, so this should never happen.\n        vErrors.push_back(strprintf(\"Error: The transaction was rejected! Reason given: %s\", state.GetRejectReason()));\n        return false;\n    }\n\n    bumpedTxid = wtxBumped.GetHash();\n    if (state.IsInvalid()) {\n        \/\/ This can happen if the mempool rejected the transaction.  Report\n        \/\/ what happened in the \"errors\" response.\n        vErrors.push_back(strprintf(\"Error: The transaction was rejected: %s\", FormatStateMessage(state)));\n    }\n\n    \/\/ mark the original tx as bumped\n    if (!pWallet->MarkReplaced(oldWtx.GetHash(), wtxBumped.GetHash())) {\n        \/\/ TODO: see if JSON-RPC has a standard way of returning a response\n        \/\/ along with an exception. It would be good to return information about\n        \/\/ wtxBumped to the caller even if marking the original transaction\n        \/\/ replaced does not succeed for some reason.\n        vErrors.push_back(\"Error: Created new bumpfee transaction but could not mark the original transaction as replaced.\");\n    }\n    return true;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"codesearch.h\"\n#include \"interface.h\"\n#include \"debug.h\"\n#include \"git_indexer.h\"\n#include \"fs_indexer.h\"\n#include \"interface-impl.h\"\n\n#include <json\/json.h>\n\n#include <gflags\/gflags.h>\n\n#include <re2\/re2.h>\nusing re2::RE2;\nusing std::unique_ptr;\n\nnamespace {\n\njson_object *to_json(const string &str) {\n    return json_object_new_string(str.c_str());\n}\n\njson_object *to_json(const StringPiece &str) {\n    return json_object_new_string_len(str.data(),\n                                      str.size());\n}\n\njson_object *to_json(int i) {\n    return json_object_new_int(i);\n}\n\nstatic json_object *to_json(const indexed_path &path) {\n    json_object *out = json_object_new_object();\n    json_object_object_add(out, \"repo\", to_json(path.tree->repo->name));\n    json_object_object_add(out, \"ref\",  to_json(path.tree->revision));\n    json_object_object_add(out, \"path\", to_json(path.path));\n    return out;\n}\n\njson_object *to_json(const indexed_repo &repo) {\n    json_object *out = json_object_new_object();\n    json_object_object_add(out, \"name\", to_json(repo.name));\n    if (repo.metadata)\n        json_object_object_add(out, \"metadata\", json_object_get(repo.metadata));\n    return out;\n}\n\ntemplate <class T>\njson_object *to_json(vector<T> vec) {\n    json_object *out = json_object_new_array();\n    for (auto it = vec.begin(); it != vec.end(); it++)\n        json_object_array_add(out, to_json(*it));\n    return out;\n}\n\n\njson_object *json_frame(const std::string op, json_object *body) {\n    json_object *frame = json_object_new_object();\n    json_object_object_add(frame, \"opcode\", to_json(op));\n    json_object_object_add(frame, \"body\", body);\n    return frame;\n}\n\njson_object *json_info(const code_searcher *cs) {\n    json_object *obj = json_object_new_object();\n    json_object_object_add(obj, \"repos\", to_json(cs->repos()));\n    json_object_object_add(obj, \"name\", to_json(cs->name()));\n    return obj;\n}\n\nlong timeval_ms (struct timeval tv) {\n    return tv.tv_sec * 1000 + tv.tv_usec \/ 1000;\n}\n\nstruct repo_spec {\n    string path;\n    string name;\n    vector<string> revisions;\n    json_object *metadata;\n};\n\njson_object *get_with_type(json_object *parent, const char *key, json_type type) {\n    json_object *val = json_object_object_get(parent, key);\n    if (val == NULL || json_object_is_type(val, type)) {\n        return val;\n    }\n    die(\"Error: '%s': expected %s, got %s\", key,\n        json_type_to_name(type),\n        json_type_to_name(json_object_get_type(val)));\n    return NULL;\n}\n\nrepo_spec parse_repo_spec(json_object *js) {\n    debug(kDebugUI, \"Parsing: %s\", json_object_to_json_string(js));\n    if (!json_object_is_type(js, json_type_object)) {\n        die(\"repository spec must be an object.\");\n    }\n\n    repo_spec spec;\n    json_object *prop;\n    if ((prop = get_with_type(js, \"path\", json_type_string)))\n        spec.path = json_object_get_string(prop);\n    if ((prop = get_with_type(js, \"name\", json_type_string)))\n        spec.name = json_object_get_string(prop);\n    spec.metadata = json_object_get(get_with_type(js, \"metadata\", json_type_object));\n\n    json_object *js_revs = get_with_type(js, \"revisions\", json_type_array);\n    if (js_revs && json_object_is_type(js_revs, json_type_array)) {\n        for (int i = 0; i < json_object_array_length(js_revs); ++i) {\n            json_object *elt = json_object_array_get_idx(js_revs, i);\n            if (!json_object_is_type(elt, json_type_string))\n                die(\"repository: 'revisions' must be list of strings\");\n            spec.revisions.push_back(json_object_get_string(elt));\n        }\n    }\n\n    return spec;\n}\n\nvoid extract_repo_specs(vector<repo_spec> &out, json_object *js) {\n    switch(json_object_get_type(js)) {\n    case json_type_object:\n        debug(kDebugUI, \"Parsing a single repo\");\n        out.push_back(parse_repo_spec(js));\n        break;\n    case json_type_array:\n        debug(kDebugUI, \"Parsing an array of repos...\");\n        for (int i = 0; i < json_object_array_length(js); ++i) {\n            out.push_back(parse_repo_spec(json_object_array_get_idx(js, i)));\n        }\n        break;\n    default:\n        die(\"unrecognized type for repo spec: %s\",\n            json_object_to_json_string(js));\n        exit(1);\n    }\n}\n\nclass json_interface : public codesearch_interface {\npublic:\n    json_interface(FILE *in, FILE *out) : in_(in), out_(out) { }\n\n    void write_frame(const std::string &opcode, json_object *body) {\n        json_object *frame = json_frame(opcode, body);\n        fprintf(out_, \"%s\\n\", json_object_to_json_string(frame));\n        json_object_put(frame);\n    }\n\n    virtual void print_match(const match_result *m) {\n        json_object *obj = json_object_new_object();\n        json_object *contexts = json_object_new_array();\n        for (auto ctx = m->context.begin();\n             ctx != m->context.end(); ++ctx) {\n            json_object *jctx = json_object_new_object();\n            json_object_object_add(jctx, \"paths\",  to_json(ctx->paths));\n            json_object_object_add(jctx, \"lno\", to_json(ctx->lno));\n            json_object_object_add(jctx, \"context_before\",\n                                   to_json(ctx->context_before));\n            json_object_object_add(jctx, \"context_after\",\n                                   to_json(ctx->context_after));\n            json_object_array_add(contexts, jctx);\n        }\n        json_object_object_add(obj, \"contexts\", contexts);\n        json_object *bounds = json_object_new_array();\n        json_object_array_add(bounds, to_json(m->matchleft));\n        json_object_array_add(bounds, to_json(m->matchright));\n        json_object_object_add(obj, \"bounds\", bounds);\n        json_object_object_add(obj, \"line\", to_json(m->line));\n        write_frame(\"match\", obj);\n    }\n\n    virtual void print_error(const std::string &err) {\n        write_frame(\"error\", to_json(err));\n    }\n\n    virtual void print_prompt(const code_searcher *cs) {\n        write_frame(\"ready\", json_info(cs));\n    }\n\n    virtual bool getline(std::string &input) {\n        return ::getline(input, in_);\n    }\n\n    bool extract_regex(json_object *js, const std::string &key,\n                       const RE2::Options &opts, unique_ptr<RE2> *out) {\n        out->reset(0);\n        json_object *re_js = json_object_object_get(js, key.c_str());\n        if (re_js == NULL)\n            return true;\n\n        if (json_object_get_type(re_js) != json_type_string) {\n            print_error(std::string(\"Expected a JSON object: \") + key);\n            return false;\n        }\n        unique_ptr<RE2> re(new RE2(json_object_get_string(re_js), opts));\n        if (!re->ok()) {\n            print_error(re->error());\n            return false;\n        }\n\n        *out = std::move(re);\n        return true;\n    }\n\n    virtual bool parse_query(const std::string &input,\n                             query *out) {\n        json_object *js = json_tokener_parse(input.c_str());\n        if (is_error(js)) {\n            print_error(\"Parse error: \" +\n                        string(json_tokener_errors[-(unsigned long)js]));\n            return false;\n        }\n        if (json_object_get_type(js) != json_type_object) {\n            print_error(\"Expected a JSON object\");\n            return false;\n        }\n        json_object *q = json_object_object_get(js, \"body\");\n        if (q == NULL || json_object_get_type(q) != json_type_object) {\n            print_error(\"Expected a JSON object\");\n            return false;\n        }\n\n        RE2::Options opts;\n        default_re2_options(opts);\n\n        json_object *fold_case = json_object_object_get(q, \"fold_case\");\n        if (fold_case &&\n            json_object_get_type(fold_case) == json_type_boolean &&\n            json_object_get_boolean(fold_case))\n            opts.set_case_sensitive(false);\n\n        if (!extract_regex(q, \"line\", opts, &out->line_pat))\n            return false;\n        if (out->line_pat.get() == 0) {\n            print_error(\"No regex specified!\");\n            return false;\n        }\n\n        opts.set_case_sensitive(true);\n\n        if (!extract_regex(q, \"file\", opts, &out->file_pat) ||\n            !extract_regex(q, \"repo\", opts, &out->tree_pat)) {\n            return false;\n        }\n\n\n        json_object_put(js);\n\n        return true;\n    }\n\n    virtual void print_stats(timeval elapsed, const match_stats *stats) {\n        json_object *obj = json_object_new_object();\n        json_object_object_add(obj, \"re2_time\", json_object_new_int\n                               (timeval_ms(stats->re2_time)));\n        json_object_object_add(obj, \"git_time\", json_object_new_int\n                               (timeval_ms(stats->git_time)));\n        json_object_object_add(obj, \"sort_time\", json_object_new_int\n                               (timeval_ms(stats->sort_time)));\n        json_object_object_add(obj, \"index_time\", json_object_new_int\n                               (timeval_ms(stats->index_time)));\n        json_object_object_add(obj, \"analyze_time\", json_object_new_int\n                               (timeval_ms(stats->analyze_time)));\n        switch(stats->why) {\n        case kExitNone: break;\n        case kExitMatchLimit:\n            json_object_object_add(obj, \"why\", json_object_new_string(\"limit\"));\n            break;\n        case kExitTimeout:\n            json_object_object_add(obj, \"why\", json_object_new_string(\"timeout\"));\n            break;\n        }\n        write_frame(\"done\", obj);\n    }\n\n    virtual void build_index(code_searcher *cs, const vector<std::string> &argv) {\n        if (argv.size() != 2) {\n            print_error(\"Usage: \" + argv[0] + \" --json [OPTIONS] config.json\");\n            exit(1);\n        }\n        json_object *obj = json_object_from_file(const_cast<char*>(argv[1].c_str()));\n        if (is_error(obj)) {\n            print_error(string(\"Error parsing `\") + argv[1] + string(\"': \") +\n                        string(json_tokener_errors[-(unsigned long)obj]));\n            exit(1);\n        }\n\n        json_object *name = json_object_object_get(obj, \"name\");\n        if (json_object_is_type(name, json_type_string))\n            cs->set_name(json_object_get_string(name));\n\n        string path;\n        json_object *js_paths = json_object_object_get(obj, \"fs_paths\");\n        if (js_paths && json_object_is_type(js_paths, json_type_array)) {\n            for (int i = 0; i < json_object_array_length(js_paths); ++i) {\n                json_object *elt = json_object_array_get_idx(js_paths, i);\n                if (json_object_is_type(elt, json_type_string)) {\n                    path = json_object_get_string(elt);\n                    debug(kDebugUI, \"Walking `%s'...\\n\",\n                        path.c_str());\n                    fs_indexer indexer(cs, path);\n                    indexer.walk(path);\n                    debug(kDebugUI, \"done\\n\");\n                }\n            }\n        }\n\n        vector<repo_spec> repos;\n        json_object *repo_spec = json_object_object_get(obj, \"repositories\");\n        if (repo_spec) {\n            extract_repo_specs(repos, repo_spec);\n            json_object_put(obj);\n\n            for (auto it = repos.begin(); it != repos.end(); ++it) {\n                debug(kDebugUI, \"Walking name=%s, path=%s\",\n                      it->name.c_str(), it->path.c_str());\n                git_indexer indexer(cs, it->path, it->name, it->metadata);\n                for (auto rev = it->revisions.begin();\n                     rev != it->revisions.end(); ++rev) {\n                    debug(kDebugUI, \"  walking %s..\", rev->c_str());\n                    indexer.walk(*rev);\n                }\n            }\n        }\n    }\n\n    virtual void info(const char *msg, ...) {}\n    virtual ~json_interface() {}\n\nprotected:\n    FILE *in_, *out_;\n};\n\n};\n\ncodesearch_interface *make_json_interface(FILE *in, FILE *out) {\n    return new json_interface(in, out);\n}\n<commit_msg>Implement a compat version of json_type_to_name.<commit_after>#include \"codesearch.h\"\n#include \"interface.h\"\n#include \"debug.h\"\n#include \"git_indexer.h\"\n#include \"fs_indexer.h\"\n#include \"interface-impl.h\"\n\n#include <json\/json.h>\n\n#include <gflags\/gflags.h>\n\n#include <re2\/re2.h>\nusing re2::RE2;\nusing std::unique_ptr;\n\nnamespace {\n\njson_object *to_json(const string &str) {\n    return json_object_new_string(str.c_str());\n}\n\njson_object *to_json(const StringPiece &str) {\n    return json_object_new_string_len(str.data(),\n                                      str.size());\n}\n\njson_object *to_json(int i) {\n    return json_object_new_int(i);\n}\n\nstatic json_object *to_json(const indexed_path &path) {\n    json_object *out = json_object_new_object();\n    json_object_object_add(out, \"repo\", to_json(path.tree->repo->name));\n    json_object_object_add(out, \"ref\",  to_json(path.tree->revision));\n    json_object_object_add(out, \"path\", to_json(path.path));\n    return out;\n}\n\njson_object *to_json(const indexed_repo &repo) {\n    json_object *out = json_object_new_object();\n    json_object_object_add(out, \"name\", to_json(repo.name));\n    if (repo.metadata)\n        json_object_object_add(out, \"metadata\", json_object_get(repo.metadata));\n    return out;\n}\n\ntemplate <class T>\njson_object *to_json(vector<T> vec) {\n    json_object *out = json_object_new_array();\n    for (auto it = vec.begin(); it != vec.end(); it++)\n        json_object_array_add(out, to_json(*it));\n    return out;\n}\n\n\njson_object *json_frame(const std::string op, json_object *body) {\n    json_object *frame = json_object_new_object();\n    json_object_object_add(frame, \"opcode\", to_json(op));\n    json_object_object_add(frame, \"body\", body);\n    return frame;\n}\n\njson_object *json_info(const code_searcher *cs) {\n    json_object *obj = json_object_new_object();\n    json_object_object_add(obj, \"repos\", to_json(cs->repos()));\n    json_object_object_add(obj, \"name\", to_json(cs->name()));\n    return obj;\n}\n\nlong timeval_ms (struct timeval tv) {\n    return tv.tv_sec * 1000 + tv.tv_usec \/ 1000;\n}\n\nstruct repo_spec {\n    string path;\n    string name;\n    vector<string> revisions;\n    json_object *metadata;\n};\n\n\n\/\/ Reimplement this for compatibility with old libjson\nconst char *compat_json_type_to_name(enum json_type o_type) {\n    switch (o_type) {\n    case json_type_null:\n        return \"null\";\n    case json_type_boolean:\n        return \"boolean\";\n    case json_type_double:\n        return \"double\";\n    case json_type_int:\n        return \"int\";\n    case json_type_object:\n        return \"object\";\n    case json_type_array:\n        return \"array\";\n    case json_type_string:\n        return \"string\";\n    default:\n        return \"<unknown>\";\n    }\n}\n\njson_object *get_with_type(json_object *parent, const char *key, json_type type) {\n    json_object *val = json_object_object_get(parent, key);\n    if (val == NULL || json_object_is_type(val, type)) {\n        return val;\n    }\n    die(\"Error: '%s': expected %s, got %s\", key,\n        compat_json_type_to_name(type),\n        compat_json_type_to_name(json_object_get_type(val)));\n    return NULL;\n}\n\nrepo_spec parse_repo_spec(json_object *js) {\n    debug(kDebugUI, \"Parsing: %s\", json_object_to_json_string(js));\n    if (!json_object_is_type(js, json_type_object)) {\n        die(\"repository spec must be an object.\");\n    }\n\n    repo_spec spec;\n    json_object *prop;\n    if ((prop = get_with_type(js, \"path\", json_type_string)))\n        spec.path = json_object_get_string(prop);\n    if ((prop = get_with_type(js, \"name\", json_type_string)))\n        spec.name = json_object_get_string(prop);\n    spec.metadata = json_object_get(get_with_type(js, \"metadata\", json_type_object));\n\n    json_object *js_revs = get_with_type(js, \"revisions\", json_type_array);\n    if (js_revs && json_object_is_type(js_revs, json_type_array)) {\n        for (int i = 0; i < json_object_array_length(js_revs); ++i) {\n            json_object *elt = json_object_array_get_idx(js_revs, i);\n            if (!json_object_is_type(elt, json_type_string))\n                die(\"repository: 'revisions' must be list of strings\");\n            spec.revisions.push_back(json_object_get_string(elt));\n        }\n    }\n\n    return spec;\n}\n\nvoid extract_repo_specs(vector<repo_spec> &out, json_object *js) {\n    switch(json_object_get_type(js)) {\n    case json_type_object:\n        debug(kDebugUI, \"Parsing a single repo\");\n        out.push_back(parse_repo_spec(js));\n        break;\n    case json_type_array:\n        debug(kDebugUI, \"Parsing an array of repos...\");\n        for (int i = 0; i < json_object_array_length(js); ++i) {\n            out.push_back(parse_repo_spec(json_object_array_get_idx(js, i)));\n        }\n        break;\n    default:\n        die(\"unrecognized type for repo spec: %s\",\n            json_object_to_json_string(js));\n        exit(1);\n    }\n}\n\nclass json_interface : public codesearch_interface {\npublic:\n    json_interface(FILE *in, FILE *out) : in_(in), out_(out) { }\n\n    void write_frame(const std::string &opcode, json_object *body) {\n        json_object *frame = json_frame(opcode, body);\n        fprintf(out_, \"%s\\n\", json_object_to_json_string(frame));\n        json_object_put(frame);\n    }\n\n    virtual void print_match(const match_result *m) {\n        json_object *obj = json_object_new_object();\n        json_object *contexts = json_object_new_array();\n        for (auto ctx = m->context.begin();\n             ctx != m->context.end(); ++ctx) {\n            json_object *jctx = json_object_new_object();\n            json_object_object_add(jctx, \"paths\",  to_json(ctx->paths));\n            json_object_object_add(jctx, \"lno\", to_json(ctx->lno));\n            json_object_object_add(jctx, \"context_before\",\n                                   to_json(ctx->context_before));\n            json_object_object_add(jctx, \"context_after\",\n                                   to_json(ctx->context_after));\n            json_object_array_add(contexts, jctx);\n        }\n        json_object_object_add(obj, \"contexts\", contexts);\n        json_object *bounds = json_object_new_array();\n        json_object_array_add(bounds, to_json(m->matchleft));\n        json_object_array_add(bounds, to_json(m->matchright));\n        json_object_object_add(obj, \"bounds\", bounds);\n        json_object_object_add(obj, \"line\", to_json(m->line));\n        write_frame(\"match\", obj);\n    }\n\n    virtual void print_error(const std::string &err) {\n        write_frame(\"error\", to_json(err));\n    }\n\n    virtual void print_prompt(const code_searcher *cs) {\n        write_frame(\"ready\", json_info(cs));\n    }\n\n    virtual bool getline(std::string &input) {\n        return ::getline(input, in_);\n    }\n\n    bool extract_regex(json_object *js, const std::string &key,\n                       const RE2::Options &opts, unique_ptr<RE2> *out) {\n        out->reset(0);\n        json_object *re_js = json_object_object_get(js, key.c_str());\n        if (re_js == NULL)\n            return true;\n\n        if (json_object_get_type(re_js) != json_type_string) {\n            print_error(std::string(\"Expected a JSON object: \") + key);\n            return false;\n        }\n        unique_ptr<RE2> re(new RE2(json_object_get_string(re_js), opts));\n        if (!re->ok()) {\n            print_error(re->error());\n            return false;\n        }\n\n        *out = std::move(re);\n        return true;\n    }\n\n    virtual bool parse_query(const std::string &input,\n                             query *out) {\n        json_object *js = json_tokener_parse(input.c_str());\n        if (is_error(js)) {\n            print_error(\"Parse error: \" +\n                        string(json_tokener_errors[-(unsigned long)js]));\n            return false;\n        }\n        if (json_object_get_type(js) != json_type_object) {\n            print_error(\"Expected a JSON object\");\n            return false;\n        }\n        json_object *q = json_object_object_get(js, \"body\");\n        if (q == NULL || json_object_get_type(q) != json_type_object) {\n            print_error(\"Expected a JSON object\");\n            return false;\n        }\n\n        RE2::Options opts;\n        default_re2_options(opts);\n\n        json_object *fold_case = json_object_object_get(q, \"fold_case\");\n        if (fold_case &&\n            json_object_get_type(fold_case) == json_type_boolean &&\n            json_object_get_boolean(fold_case))\n            opts.set_case_sensitive(false);\n\n        if (!extract_regex(q, \"line\", opts, &out->line_pat))\n            return false;\n        if (out->line_pat.get() == 0) {\n            print_error(\"No regex specified!\");\n            return false;\n        }\n\n        opts.set_case_sensitive(true);\n\n        if (!extract_regex(q, \"file\", opts, &out->file_pat) ||\n            !extract_regex(q, \"repo\", opts, &out->tree_pat)) {\n            return false;\n        }\n\n\n        json_object_put(js);\n\n        return true;\n    }\n\n    virtual void print_stats(timeval elapsed, const match_stats *stats) {\n        json_object *obj = json_object_new_object();\n        json_object_object_add(obj, \"re2_time\", json_object_new_int\n                               (timeval_ms(stats->re2_time)));\n        json_object_object_add(obj, \"git_time\", json_object_new_int\n                               (timeval_ms(stats->git_time)));\n        json_object_object_add(obj, \"sort_time\", json_object_new_int\n                               (timeval_ms(stats->sort_time)));\n        json_object_object_add(obj, \"index_time\", json_object_new_int\n                               (timeval_ms(stats->index_time)));\n        json_object_object_add(obj, \"analyze_time\", json_object_new_int\n                               (timeval_ms(stats->analyze_time)));\n        switch(stats->why) {\n        case kExitNone: break;\n        case kExitMatchLimit:\n            json_object_object_add(obj, \"why\", json_object_new_string(\"limit\"));\n            break;\n        case kExitTimeout:\n            json_object_object_add(obj, \"why\", json_object_new_string(\"timeout\"));\n            break;\n        }\n        write_frame(\"done\", obj);\n    }\n\n    virtual void build_index(code_searcher *cs, const vector<std::string> &argv) {\n        if (argv.size() != 2) {\n            print_error(\"Usage: \" + argv[0] + \" --json [OPTIONS] config.json\");\n            exit(1);\n        }\n        json_object *obj = json_object_from_file(const_cast<char*>(argv[1].c_str()));\n        if (is_error(obj)) {\n            print_error(string(\"Error parsing `\") + argv[1] + string(\"': \") +\n                        string(json_tokener_errors[-(unsigned long)obj]));\n            exit(1);\n        }\n\n        json_object *name = json_object_object_get(obj, \"name\");\n        if (json_object_is_type(name, json_type_string))\n            cs->set_name(json_object_get_string(name));\n\n        string path;\n        json_object *js_paths = json_object_object_get(obj, \"fs_paths\");\n        if (js_paths && json_object_is_type(js_paths, json_type_array)) {\n            for (int i = 0; i < json_object_array_length(js_paths); ++i) {\n                json_object *elt = json_object_array_get_idx(js_paths, i);\n                if (json_object_is_type(elt, json_type_string)) {\n                    path = json_object_get_string(elt);\n                    debug(kDebugUI, \"Walking `%s'...\\n\",\n                        path.c_str());\n                    fs_indexer indexer(cs, path);\n                    indexer.walk(path);\n                    debug(kDebugUI, \"done\\n\");\n                }\n            }\n        }\n\n        vector<repo_spec> repos;\n        json_object *repo_spec = json_object_object_get(obj, \"repositories\");\n        if (repo_spec) {\n            extract_repo_specs(repos, repo_spec);\n            json_object_put(obj);\n\n            for (auto it = repos.begin(); it != repos.end(); ++it) {\n                debug(kDebugUI, \"Walking name=%s, path=%s\",\n                      it->name.c_str(), it->path.c_str());\n                git_indexer indexer(cs, it->path, it->name, it->metadata);\n                for (auto rev = it->revisions.begin();\n                     rev != it->revisions.end(); ++rev) {\n                    debug(kDebugUI, \"  walking %s..\", rev->c_str());\n                    indexer.walk(*rev);\n                }\n            }\n        }\n    }\n\n    virtual void info(const char *msg, ...) {}\n    virtual ~json_interface() {}\n\nprotected:\n    FILE *in_, *out_;\n};\n\n};\n\ncodesearch_interface *make_json_interface(FILE *in, FILE *out) {\n    return new json_interface(in, out);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file AquilaFft.cpp\n *\n * A custom implementation of FFT radix-2 algorithm.\n *\n * This file is part of the Aquila DSP library.\n * Aquila is free software, licensed under the MIT\/X11 License. A copy of\n * the license is provided with the library in the LICENSE file.\n *\n * @package Aquila\n * @version 3.0.0-dev\n * @author Zbigniew Siciarz\n * @date 2007-2010\n * @license http:\/\/www.opensource.org\/licenses\/mit-license.php MIT\n * @since 3.0.0\n *\/\n\n#include \"AquilaFft.h\"\n#include <algorithm>\n#include <cmath>\n\nnamespace Aquila\n{\n    \/**\n     * Complex unit.\n     *\/\n    const ComplexType AquilaFft::j(0, 1);\n\n    \/**\n     * Applies the transformation to the signal.\n     *\n     * @param x input signal\n     * @param spectrum output specturm\n     *\/\n    void AquilaFft::fft(double x[], ComplexType spectrum[])\n    {\n        \/\/ bit-reversing the samples - a requirement of radix-2\n        \/\/ instead of reversing in place, put the samples to result array\n        unsigned int a = 1, b = 0, c = 0;\n        std::copy(x, x + N, spectrum);\n        for (b = 1; b < N; ++b)\n        {\n            if (b < a)\n            {\n                spectrum[a - 1] = x[b - 1];\n                spectrum[b - 1] = x[a - 1];\n            }\n            c = N \/ 2;\n            while (c < a)\n            {\n                a -= c;\n                c \/= 2;\n            }\n            a += c;\n        }\n\n        \/\/ FFT calculation using \"butterflies\"\n        \/\/ code ported from Matlab, based on book by Tomasz P. Zieliski\n\n        \/\/ FFT stages count\n        unsigned int numStages = static_cast<unsigned int>(\n                std::log(double(N)) \/ LN_2);\n\n        \/\/ L = 2^k - DFT block length and offset\n        \/\/ M = 2^(k-1) - butterflies per block, butterfly width\n        \/\/ p - butterfly index\n        \/\/ q - block index\n        \/\/ r - index of sample in butterfly\n        \/\/ Wi - starting value of Fourier base coefficient\n        unsigned int L = 0, M = 0, p = 0, q = 0, r = 0;\n        ComplexType Wi(0, 0), Temp(0, 0);\n\n        ComplexType** Wi_cache = getCachedFftWi(numStages);\n\n        \/\/ iterate over the stages\n        for (unsigned int k = 1; k <= numStages; ++k)\n        {\n            L = 1 << k;\n            M = 1 << (k - 1);\n            Wi = Wi_cache[k][0];\n\n            \/\/ iterate over butterflies\n            for (p = 1; p <= M; ++p)\n            {\n                \/\/ iterate over blocks\n                for (q = p; q <= N; q += L)\n                {\n                    r = q + M;\n                    Temp = spectrum[r - 1] * Wi;\n                    spectrum[r - 1] = spectrum[q - 1] - Temp;\n                    spectrum[q - 1] = spectrum[q - 1] + Temp;\n                }\n                Wi = Wi_cache[k][p];\n            }\n        }\n    }\n\n    \/**\n     * Returns a table of Wi (twiddle factors) stored in cache.\n     *\n     * @param numStages the FFT stages count\n     * @return pointer to an array of pointers to arrays of complex numbers\n     *\/\n    ComplexType** AquilaFft::getCachedFftWi(unsigned int numStages)\n    {\n        fftWiCacheKeyType key = numStages;\n        \/\/ cache hit, return immediately\n        if (fftWiCache.find(key) != fftWiCache.end())\n        {\n            return fftWiCache[key];\n        }\n\n        \/\/ nothing in cache, calculate twiddle factors\n        ComplexType** Wi = new ComplexType*[numStages+1];\n        for (unsigned int k = 1; k <= numStages; ++k)\n        {\n            \/\/ L = 2^k - DFT block length and offset\n            \/\/ M = 2^(k-1) - butterflies per block, butterfly width\n            \/\/ W - Fourier base multiplying factor\n            unsigned int L = 1 << k;\n            unsigned int M = 1 << (k-1);\n            ComplexType W = exp((-j) * 2.0 * M_PI \/ double(L));\n            Wi[k] = new ComplexType[M+1];\n            Wi[k][0] = ComplexType(1.0);\n            for (unsigned int p = 1; p <= M; ++p)\n            {\n                Wi[k][p] = Wi[k][p-1] * W;\n            }\n        }\n\n        \/\/ store in cache and return\n        fftWiCache[key] = Wi;\n\n        return Wi;\n    }\n\n    \/**\n     * Clears the twiddle factor cache.\n     *\/\n    void AquilaFft::clearFftWiCache()\n    {\n        fftWiCacheType::const_iterator it;\n        for (it = fftWiCache.begin(); it != fftWiCache.end(); it++)\n        {\n            ComplexType** c = it->second;\n            unsigned int numStages = it->first;\n            for (unsigned int i = 1; i <= numStages; ++i)\n            {\n                delete [] c[i];\n            }\n\n            delete [] c;\n        }\n    }\n}\n<commit_msg>Fixed encoding of the Polish name.<commit_after>\/**\n * @file AquilaFft.cpp\n *\n * A custom implementation of FFT radix-2 algorithm.\n *\n * This file is part of the Aquila DSP library.\n * Aquila is free software, licensed under the MIT\/X11 License. A copy of\n * the license is provided with the library in the LICENSE file.\n *\n * @package Aquila\n * @version 3.0.0-dev\n * @author Zbigniew Siciarz\n * @date 2007-2010\n * @license http:\/\/www.opensource.org\/licenses\/mit-license.php MIT\n * @since 3.0.0\n *\/\n\n#include \"AquilaFft.h\"\n#include <algorithm>\n#include <cmath>\n\nnamespace Aquila\n{\n    \/**\n     * Complex unit.\n     *\/\n    const ComplexType AquilaFft::j(0, 1);\n\n    \/**\n     * Applies the transformation to the signal.\n     *\n     * @param x input signal\n     * @param spectrum output specturm\n     *\/\n    void AquilaFft::fft(double x[], ComplexType spectrum[])\n    {\n        \/\/ bit-reversing the samples - a requirement of radix-2\n        \/\/ instead of reversing in place, put the samples to result array\n        unsigned int a = 1, b = 0, c = 0;\n        std::copy(x, x + N, spectrum);\n        for (b = 1; b < N; ++b)\n        {\n            if (b < a)\n            {\n                spectrum[a - 1] = x[b - 1];\n                spectrum[b - 1] = x[a - 1];\n            }\n            c = N \/ 2;\n            while (c < a)\n            {\n                a -= c;\n                c \/= 2;\n            }\n            a += c;\n        }\n\n        \/\/ FFT calculation using \"butterflies\"\n        \/\/ code ported from Matlab, based on book by Tomasz P. Zieliński\n\n        \/\/ FFT stages count\n        unsigned int numStages = static_cast<unsigned int>(\n                std::log(double(N)) \/ LN_2);\n\n        \/\/ L = 2^k - DFT block length and offset\n        \/\/ M = 2^(k-1) - butterflies per block, butterfly width\n        \/\/ p - butterfly index\n        \/\/ q - block index\n        \/\/ r - index of sample in butterfly\n        \/\/ Wi - starting value of Fourier base coefficient\n        unsigned int L = 0, M = 0, p = 0, q = 0, r = 0;\n        ComplexType Wi(0, 0), Temp(0, 0);\n\n        ComplexType** Wi_cache = getCachedFftWi(numStages);\n\n        \/\/ iterate over the stages\n        for (unsigned int k = 1; k <= numStages; ++k)\n        {\n            L = 1 << k;\n            M = 1 << (k - 1);\n            Wi = Wi_cache[k][0];\n\n            \/\/ iterate over butterflies\n            for (p = 1; p <= M; ++p)\n            {\n                \/\/ iterate over blocks\n                for (q = p; q <= N; q += L)\n                {\n                    r = q + M;\n                    Temp = spectrum[r - 1] * Wi;\n                    spectrum[r - 1] = spectrum[q - 1] - Temp;\n                    spectrum[q - 1] = spectrum[q - 1] + Temp;\n                }\n                Wi = Wi_cache[k][p];\n            }\n        }\n    }\n\n    \/**\n     * Returns a table of Wi (twiddle factors) stored in cache.\n     *\n     * @param numStages the FFT stages count\n     * @return pointer to an array of pointers to arrays of complex numbers\n     *\/\n    ComplexType** AquilaFft::getCachedFftWi(unsigned int numStages)\n    {\n        fftWiCacheKeyType key = numStages;\n        \/\/ cache hit, return immediately\n        if (fftWiCache.find(key) != fftWiCache.end())\n        {\n            return fftWiCache[key];\n        }\n\n        \/\/ nothing in cache, calculate twiddle factors\n        ComplexType** Wi = new ComplexType*[numStages+1];\n        for (unsigned int k = 1; k <= numStages; ++k)\n        {\n            \/\/ L = 2^k - DFT block length and offset\n            \/\/ M = 2^(k-1) - butterflies per block, butterfly width\n            \/\/ W - Fourier base multiplying factor\n            unsigned int L = 1 << k;\n            unsigned int M = 1 << (k-1);\n            ComplexType W = exp((-j) * 2.0 * M_PI \/ double(L));\n            Wi[k] = new ComplexType[M+1];\n            Wi[k][0] = ComplexType(1.0);\n            for (unsigned int p = 1; p <= M; ++p)\n            {\n                Wi[k][p] = Wi[k][p-1] * W;\n            }\n        }\n\n        \/\/ store in cache and return\n        fftWiCache[key] = Wi;\n\n        return Wi;\n    }\n\n    \/**\n     * Clears the twiddle factor cache.\n     *\/\n    void AquilaFft::clearFftWiCache()\n    {\n        fftWiCacheType::const_iterator it;\n        for (it = fftWiCache.begin(); it != fftWiCache.end(); it++)\n        {\n            ComplexType** c = it->second;\n            unsigned int numStages = it->first;\n            for (unsigned int i = 1; i <= numStages; ++i)\n            {\n                delete [] c[i];\n            }\n\n            delete [] c;\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 AUV-IITK\n#include <ros\/ros.h>\n#include <std_msgs\/Float32.h>\n#include <std_msgs\/Float64.h>\n#include <task_commons\/buoyAction.h>\n#include <task_commons\/lineAction.h>\n#include <task_commons\/buoyActionFeedback.h>\n#include <task_commons\/lineActionFeedback.h>\n#include <task_commons\/buoyActionResult.h>\n#include <task_commons\/lineActionResult.h>\n#include <motion_commons\/ForwardAction.h>\n#include <motion_commons\/UpwardAction.h>\n#include <motion_commons\/UpwardActionFeedback.h>\n#include <motion_commons\/ForwardActionFeedback.h>\n#include <motion_commons\/UpwardActionResult.h>\n#include <motion_commons\/ForwardActionResult.h>\n#include <actionlib\/client\/simple_action_client.h>\n#include <actionlib\/client\/terminal_state.h>\n\ntypedef actionlib::SimpleActionClient<task_commons::buoyAction> ClientBuoy;\ntypedef actionlib::SimpleActionClient<task_commons::lineAction> ClientLine;\ntypedef actionlib::SimpleActionClient<motion_commons::UpwardAction> ClientUpward;\ntypedef actionlib::SimpleActionClient<motion_commons::ForwardAction> ClientForward;\n\nClientBuoy *ptrClientBuoy;\nClientLine *ptrClientLine;\nClientUpward *ptrClientUpward;\nClientForward *ptrClientForward;\ntask_commons::buoyGoal goalBuoy;\ntask_commons::lineGoal goalLine;\nmotion_commons::UpwardGoal goalUpward;\nmotion_commons::ForwardGoal goalForward;\n\nros::Publisher pub_upward;\nros::Publisher pub_forward;\n\nbool successBuoy = false;\nbool successLine = false;\nbool successUpward = false;\nbool successDownward = false;\n\nfloat present_depth;\n\nvoid spinThreadBuoy()\n{\n  ClientBuoy &temp = *ptrClientBuoy;\n  temp.waitForResult();\n  successBuoy = (*(temp.getResult())).MotionCompleted;\n  if (successBuoy)\n  {\n    ROS_INFO(\"%s: motion buoy successful\", ros::this_node::getName().c_str());\n  }\n  else\n    ROS_INFO(\"%s: motion buoy unsuccessful\", ros::this_node::getName().c_str());\n}\n\nvoid spinThreadLine()\n{\n  ClientLine &temp = *ptrClientLine;\n  temp.waitForResult();\n  successLine = (*(temp.getResult())).MotionCompleted;\n  if (successLine)\n  {\n    ROS_INFO(\"%s: motion line successful\", ros::this_node::getName().c_str());\n  }\n  else\n    ROS_INFO(\"%s: motion line unsuccessful\", ros::this_node::getName().c_str());\n}\n\nvoid spinThreadUpwardPressure()\n{\n  ClientUpward &temp = *ptrClientUpward;\n  temp.waitForResult();\n  successUpward = (*(temp.getResult())).Result;\n  if (successUpward)\n  {\n    ROS_INFO(\"%s Bot is at desired height.\", ros::this_node::getName().c_str());\n  }\n  else\n  {\n    ROS_INFO(\"%s Bot is not at desired height, something went wrong\", ros::this_node::getName().c_str());\n  }\n}\n\nvoid spinThreadDownwardPressure()\n{\n  ClientUpward &temp = *ptrClientUpward;\n  temp.waitForResult();\n  successDownward = (*(temp.getResult())).Result;\n  if (successDownward)\n  {\n    ROS_INFO(\"%s Bot is at desired height.\", ros::this_node::getName().c_str());\n  }\n  else\n  {\n    ROS_INFO(\"%s Bot is not at desired height, something went wrong\", ros::this_node::getName().c_str());\n  }\n}\n\/\/ never ever put the argument of the callback function anything other then the specified\nvoid buoyCB(task_commons::buoyActionFeedback msg)\n{\n  ROS_INFO(\"%s: x_coord = %f, y_coord = %f, distance = %f\",\n    ros::this_node::getName().c_str(), msg.feedback.x_coord, msg.feedback.y_coord, msg.feedback.distance);\n}\n\nvoid lineCB(task_commons::lineActionFeedback msg)\n{\n  ROS_INFO(\"%s: feedback recieved Angle Remaining = %f, x_coord = %f, y_coord = %f\",\n    ros::this_node::getName().c_str(), msg.feedback.AngleRemaining, msg.feedback.x_coord, msg.feedback.y_coord);\n}\n\nvoid pressureCB(std_msgs::Float64 pressure_sensor_data)\n{\n  present_depth = pressure_sensor_data.data;\n  if (successBuoy)\n    pub_upward.publish(pressure_sensor_data);\n}\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"master\");\n\n  ros::NodeHandle nh;\n  \/\/ here buoy_server is the name of the node of the actionserver.\n  ros::Subscriber sub_buoy = nh.subscribe<task_commons::buoyActionFeedback>(\"\/buoy_server\/feedback\",\n    1000, &buoyCB);\n  ros::Subscriber sub_line = nh.subscribe<task_commons::lineActionFeedback>(\"\/line_server\/feedback\",\n    1000, &lineCB);\n  ros::Subscriber sub_upward = nh.subscribe<std_msgs::Float64>(\"\/varun\/sensors\/pressure_sensor\/depth\",\n    1000, &pressureCB);\n  pub_upward = nh.advertise<std_msgs::Float64>(\"\/varun\/motion\/z_distance\", 1000);\n  pub_forward = nh.advertise<std_msgs::Float64>(\"\/varun\/motion\/x_distance\", 1000);\n\n  ClientBuoy buoyClient(\"buoy_server\");\n  ptrClientBuoy = &buoyClient;\n  ClientLine lineClient(\"line_server\");\n  ptrClientLine = &lineClient;\n  ClientUpward upwardClient(\"upward\");\n  ptrClientUpward = &upwardClient;\n  ClientForward forwardClient(\"forward\");\n  ptrClientForward = &forwardClient;\n\n  ROS_INFO(\"Waiting for action server to start.\");\n  lineClient.waitForServer();\n  buoyClient.waitForServer();\n  upwardClient.waitForServer();\n  forwardClient.waitForServer();\n\n  goalLine.order = true;\n  ROS_INFO(\"Action server started, sending goal to line.\");\n\n  ClientLine &canLine = *ptrClientLine;\n  \/\/ send goal\n  canLine.sendGoal(goalLine);\n  boost::thread spin_thread_line(&spinThreadLine);\n\n  while (!successLine)\n  {\n    ros::spinOnce();\n  }\n\n  goalBuoy.order = true;\n  ROS_INFO(\"Action server started, sending goal to buoy.\");\n\n  ClientBuoy &canBuoy = *ptrClientBuoy;\n  \/\/ send goal\n  canBuoy.sendGoal(goalBuoy);\n  boost::thread spin_thread_buoy(&spinThreadBuoy);\n\n  while (!successBuoy)\n  {\n    ros::spinOnce();\n  }\n\n  goalUpward.Goal = present_depth + 10;\n  goalUpward.loop = 10;\n  ROS_INFO(\"Action server started, sending goal to upward.\");\n\n  ClientUpward &canUpward = *ptrClientUpward;\n  \/\/ send goal\n  canUpward.sendGoal(goalUpward);\n  boost::thread spin_thread_upward(&spinThreadUpwardPressure);\n\n  while (!successUpward)\n  {\n    ros::spinOnce();\n  }\n\n  goalForward.Goal = 0;\n  goalForward.loop = 10;\n  ROS_INFO(\"Action server started, sending goal to forward.\");\n\n  ClientForward &canForward = *ptrClientForward;\n  \/\/ send goal\n  canForward.sendGoal(goalForward);\n\n  std_msgs::Float64 mock_forward;\n  mock_forward.data = 250;\n  pub_forward.publish(mock_forward);\n\n  sleep(3);\n\n  canForward.cancelGoal();\n\n  goalUpward.Goal = present_depth - 13;\n  goalUpward.loop = 10;\n  ROS_INFO(\"Sending goal to upward.\");\n\n  ClientUpward &canDownward = *ptrClientUpward;\n  \/\/ send goal\n  canDownward.sendGoal(goalUpward);\n  boost::thread spin_thread_downward(&spinThreadDownwardPressure);\n\n  while (!successDownward)\n  {\n    ros::spinOnce();\n  }\n\n  ros::spin();\n  return 0;\n}\n<commit_msg>added line2 task<commit_after>\/\/ Copyright 2016 AUV-IITK\n#include <ros\/ros.h>\n#include <std_msgs\/Float32.h>\n#include <std_msgs\/Float64.h>\n#include <task_commons\/buoyAction.h>\n#include <task_commons\/lineAction.h>\n#include <task_commons\/buoyActionFeedback.h>\n#include <task_commons\/lineActionFeedback.h>\n#include <task_commons\/buoyActionResult.h>\n#include <task_commons\/lineActionResult.h>\n#include <motion_commons\/ForwardAction.h>\n#include <motion_commons\/UpwardAction.h>\n#include <motion_commons\/UpwardActionFeedback.h>\n#include <motion_commons\/ForwardActionFeedback.h>\n#include <motion_commons\/UpwardActionResult.h>\n#include <motion_commons\/ForwardActionResult.h>\n#include <actionlib\/client\/simple_action_client.h>\n#include <actionlib\/client\/terminal_state.h>\n\ntypedef actionlib::SimpleActionClient<task_commons::buoyAction> ClientBuoy;\ntypedef actionlib::SimpleActionClient<task_commons::lineAction> ClientLine;\ntypedef actionlib::SimpleActionClient<motion_commons::UpwardAction> ClientUpward;\ntypedef actionlib::SimpleActionClient<motion_commons::ForwardAction> ClientForward;\n\nClientBuoy *ptrClientBuoy;\nClientLine *ptrClientLine;\nClientUpward *ptrClientUpward;\nClientForward *ptrClientForward;\ntask_commons::buoyGoal goalBuoy;\ntask_commons::lineGoal goalLine;\nmotion_commons::UpwardGoal goalUpward;\nmotion_commons::ForwardGoal goalForward;\n\nros::Publisher pub_upward;\nros::Publisher pub_forward;\n\nbool successBuoy = false;\nbool successLine = false;\nbool successUpward = false;\nbool successDownward = false;\n\nfloat present_depth;\n\nvoid spinThreadBuoy()\n{\n  ClientBuoy &temp = *ptrClientBuoy;\n  temp.waitForResult();\n  successBuoy = (*(temp.getResult())).MotionCompleted;\n  if (successBuoy)\n  {\n    ROS_INFO(\"%s: motion buoy successful\", ros::this_node::getName().c_str());\n  }\n  else\n    ROS_INFO(\"%s: motion buoy unsuccessful\", ros::this_node::getName().c_str());\n}\n\nvoid spinThreadLine()\n{\n  ClientLine &temp = *ptrClientLine;\n  temp.waitForResult();\n  successLine = (*(temp.getResult())).MotionCompleted;\n  if (successLine)\n  {\n    ROS_INFO(\"%s: motion line successful\", ros::this_node::getName().c_str());\n  }\n  else\n    ROS_INFO(\"%s: motion line unsuccessful\", ros::this_node::getName().c_str());\n}\n\nvoid spinThreadUpwardPressure()\n{\n  ClientUpward &temp = *ptrClientUpward;\n  temp.waitForResult();\n  successUpward = (*(temp.getResult())).Result;\n  if (successUpward)\n  {\n    ROS_INFO(\"%s Bot is at desired height.\", ros::this_node::getName().c_str());\n  }\n  else\n  {\n    ROS_INFO(\"%s Bot is not at desired height, something went wrong\", ros::this_node::getName().c_str());\n  }\n}\n\nvoid spinThreadDownwardPressure()\n{\n  ClientUpward &temp = *ptrClientUpward;\n  temp.waitForResult();\n  successDownward = (*(temp.getResult())).Result;\n  if (successDownward)\n  {\n    ROS_INFO(\"%s Bot is at desired height.\", ros::this_node::getName().c_str());\n  }\n  else\n  {\n    ROS_INFO(\"%s Bot is not at desired height, something went wrong\", ros::this_node::getName().c_str());\n  }\n}\n\/\/ never ever put the argument of the callback function anything other then the specified\nvoid buoyCB(task_commons::buoyActionFeedback msg)\n{\n  ROS_INFO(\"%s: x_coord = %f, y_coord = %f, distance = %f\",\n    ros::this_node::getName().c_str(), msg.feedback.x_coord, msg.feedback.y_coord, msg.feedback.distance);\n}\n\nvoid lineCB(task_commons::lineActionFeedback msg)\n{\n  ROS_INFO(\"%s: feedback recieved Angle Remaining = %f, x_coord = %f, y_coord = %f\",\n    ros::this_node::getName().c_str(), msg.feedback.AngleRemaining, msg.feedback.x_coord, msg.feedback.y_coord);\n}\n\nvoid pressureCB(std_msgs::Float64 pressure_sensor_data)\n{\n  present_depth = pressure_sensor_data.data;\n  if (successBuoy)\n    pub_upward.publish(pressure_sensor_data);\n}\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"master\");\n\n  ros::NodeHandle nh;\n  \/\/ here buoy_server is the name of the node of the actionserver.\n  ros::Subscriber sub_buoy = nh.subscribe<task_commons::buoyActionFeedback>(\"\/buoy_server\/feedback\",\n    1000, &buoyCB);\n  ros::Subscriber sub_line = nh.subscribe<task_commons::lineActionFeedback>(\"\/line_server\/feedback\",\n    1000, &lineCB);\n  ros::Subscriber sub_upward = nh.subscribe<std_msgs::Float64>(\"\/varun\/sensors\/pressure_sensor\/depth\",\n    1000, &pressureCB);\n  pub_upward = nh.advertise<std_msgs::Float64>(\"\/varun\/motion\/z_distance\", 1000);\n  pub_forward = nh.advertise<std_msgs::Float64>(\"\/varun\/motion\/x_distance\", 1000);\n\n  ClientBuoy buoyClient(\"buoy_server\");\n  ptrClientBuoy = &buoyClient;\n  ClientLine lineClient(\"line_server\");\n  ptrClientLine = &lineClient;\n  ClientUpward upwardClient(\"upward\");\n  ptrClientUpward = &upwardClient;\n  ClientForward forwardClient(\"forward\");\n  ptrClientForward = &forwardClient;\n\n  ROS_INFO(\"Waiting for action server to start.\");\n  lineClient.waitForServer();\n  buoyClient.waitForServer();\n  upwardClient.waitForServer();\n  forwardClient.waitForServer();\n\n  goalLine.order = true;\n  ROS_INFO(\"Action server started, sending goal to line.\");\n\n  ClientLine &canLine = *ptrClientLine;\n  \/\/ send goal\n  canLine.sendGoal(goalLine);\n  boost::thread spin_thread_line(&spinThreadLine);\n\n  while (!successLine)\n  {\n    ros::spinOnce();\n  }\n\n  goalBuoy.order = true;\n  ROS_INFO(\"Action server started, sending goal to buoy.\");\n\n  ClientBuoy &canBuoy = *ptrClientBuoy;\n  \/\/ send goal\n  canBuoy.sendGoal(goalBuoy);\n  boost::thread spin_thread_buoy(&spinThreadBuoy);\n\n  while (!successBuoy)\n  {\n    ros::spinOnce();\n  }\n\n  goalUpward.Goal = present_depth + 10;     \/\/ add param\n  goalUpward.loop = 10;\n  ROS_INFO(\"Action server started, sending goal to upward.\");\n\n  ClientUpward &canUpward = *ptrClientUpward;\n  \/\/ send goal\n  canUpward.sendGoal(goalUpward);\n  boost::thread spin_thread_upward(&spinThreadUpwardPressure);\n\n  while (!successUpward)\n  {\n    ros::spinOnce();\n  }\n\n  goalForward.Goal = 0;\n  goalForward.loop = 10;\n  ROS_INFO(\"Action server started, sending goal to forward.\");\n\n  ClientForward &canForward = *ptrClientForward;\n  \/\/ send goal\n  canForward.sendGoal(goalForward);\n\n  std_msgs::Float64 mock_forward;\n  mock_forward.data = 250;\n  pub_forward.publish(mock_forward);\n\n  sleep(5);                   \/\/ add param\n\n  canForward.cancelGoal();\n\n  goalUpward.Goal = present_depth - 11;         \/\/ add param\n  goalUpward.loop = 10;\n  ROS_INFO(\"Sending goal to upward.\");\n\n  ClientUpward &canDownward = *ptrClientUpward;\n  \/\/ send goal\n  canDownward.sendGoal(goalUpward);\n  boost::thread spin_thread_downward(&spinThreadDownwardPressure);\n\n  while (!successDownward)\n  {\n    ros::spinOnce();\n  }\n\n  successLine = false;\n  goalLine.order = true;\n  ROS_INFO(\"Sending goal to line.\");\n\n  \/\/ send goal\n  canLine.sendGoal(goalLine);\n  boost::thread spin_thread_line2(&spinThreadLine);\n\n  while (!successLine)\n  {\n    ros::spinOnce();\n  }\n  ros::spin();\n  return 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\n#include <vespa\/vespalib\/testkit\/testapp.h>\n#include <vespa\/searchcorespi\/plugin\/factoryloader.h>\n#include <vespa\/vespalib\/util\/exceptions.h>\n\nusing namespace searchcorespi;\n\nnamespace {\nTEST(\"require that plugins can be loaded.\") {\n    FactoryLoader fl;\n    IIndexManagerFactory::UP f = fl.create(\"searchcorespi_tplugin\");\n    ASSERT_TRUE(f.get());\n}\n\nTEST(\"require that non-existent plugin causes failure\") {\n    FactoryLoader fl;\n    EXPECT_EXCEPTION(fl.create(\"no-such-plugin\"),\n                     vespalib::IllegalArgumentException,\n                     \"cannot open shared object file\");\n}\n\nTEST(\"require that missing factory function causes failure\") {\n    FactoryLoader fl;\n    EXPECT_EXCEPTION(fl.create(\"searchcorespi_illegal-plugin\"),\n                     vespalib::IllegalArgumentException,\n                     \"Failed locating symbol 'createIndexManagerFactory'\");\n}\n}  \/\/ namespace\n\nTEST_MAIN() { TEST_RUN_ALL(); }\n<commit_msg>Failure to load shared library gives a different error message on darwin.<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 <vespa\/vespalib\/testkit\/testapp.h>\n#include <vespa\/searchcorespi\/plugin\/factoryloader.h>\n#include <vespa\/vespalib\/util\/exceptions.h>\n\nusing namespace searchcorespi;\n\nnamespace {\nTEST(\"require that plugins can be loaded.\") {\n    FactoryLoader fl;\n    IIndexManagerFactory::UP f = fl.create(\"searchcorespi_tplugin\");\n    ASSERT_TRUE(f.get());\n}\n\nTEST(\"require that non-existent plugin causes failure\") {\n    FactoryLoader fl;\n#ifdef __APPLE__\n    EXPECT_EXCEPTION(fl.create(\"no-such-plugin\"),\n                     vespalib::IllegalArgumentException,\n                     \"image not found\");\n#else\n    EXPECT_EXCEPTION(fl.create(\"no-such-plugin\"),\n                     vespalib::IllegalArgumentException,\n                     \"cannot open shared object file\");\n#endif\n}\n\nTEST(\"require that missing factory function causes failure\") {\n    FactoryLoader fl;\n    EXPECT_EXCEPTION(fl.create(\"searchcorespi_illegal-plugin\"),\n                     vespalib::IllegalArgumentException,\n                     \"Failed locating symbol 'createIndexManagerFactory'\");\n}\n}  \/\/ namespace\n\nTEST_MAIN() { TEST_RUN_ALL(); }\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2014 Cloudius Systems\n *\/\n\n#ifndef UTILS_DATA_INPUT_HH_\n#define UTILS_DATA_INPUT_HH_\n\n#include \"bytes.hh\"\n#include \"net\/byteorder.hh\"\n\nclass data_input {\npublic:\n    data_input(const bytes_view& v)\n            : _view(v) {\n    }\n    data_input(bytes_view&& v)\n            : _view(std::move(v)) {\n    }\n    data_input(const bytes& b)\n            : data_input(bytes_view(b)) {\n    }\n    data_input(const bytes& b, size_t off, size_t n = bytes::npos)\n            : data_input(\n                    bytes_view(b.c_str() + off, std::min(b.size() - off, n))) {\n        if (off > b.size()) {\n            throw std::out_of_range(\"Offset out of range\");\n        }\n    }\n    data_input(data_input&&) = default;\n    data_input(const data_input&) = default;\n\n    size_t avail() const {\n        return _view.size();\n    }\n    bool has_next() const {\n        return !_view.empty();\n    }\n    void ensure(size_t s) const {\n        if (avail() < s) {\n            throw std::out_of_range(\"Buffer underflow\");\n        }\n    }\n    template<typename T> T peek() const;\n    template<typename T> T read();\n\n    bytes_view read_view(size_t len) {\n        bytes_view v(_view.begin(), len);\n        _view.remove_prefix(len);\n        return v;\n    }\n\n    template <typename SizeType>\n    bytes_view read_view_to_blob() {\n        auto len = read<SizeType>();\n        return read_view(len);\n    }\nprivate:\n    template<typename T> size_t ssize(const T &) const;\n    template<typename T>\n    inline std::enable_if_t<std::is_fundamental<T>::value, T> peek_primitive() const {\n        ensure(sizeof(T));\n        T t;\n        std::copy_n(_view.begin(), sizeof(T), reinterpret_cast<char *>(&t));\n        return net::ntoh(t);\n    }\n\n    bytes_view _view;\n};\n\ntemplate<> inline sstring data_input::peek<sstring>() const {\n    auto len = peek<uint16_t>();\n    ensure(sizeof(uint16_t) + len);\n    return sstring(reinterpret_cast<const char*>(_view.data()) + sizeof(uint16_t), len);\n}\ntemplate<> inline size_t data_input::ssize<sstring>(const sstring & s) const {\n    return sizeof(uint16_t) + s.size();\n}\ntemplate<> inline bytes data_input::peek<bytes>() const {\n    auto len = peek<uint32_t>();\n    ensure(sizeof(uint32_t) + len);\n    return bytes(_view.data() + sizeof(uint32_t), len);\n}\ntemplate<> inline size_t data_input::ssize<bytes>(const bytes & s) const {\n    return sizeof(uint32_t) + s.size();\n}\ntemplate<> inline size_t data_input::ssize(const bool &) const {\n    return sizeof(uint8_t);\n}\ntemplate<> inline bool data_input::peek<bool>() const {\n    return peek<uint8_t>() != 0;\n}\ntemplate<typename T>\ninline T data_input::peek() const {\n    return peek_primitive<T>();\n}\ntemplate<typename T> inline T data_input::read() {\n    auto t = peek<T>();\n    _view.remove_prefix(ssize(t));\n    return std::move(t);\n}\ntemplate<typename T> inline size_t data_input::ssize(const T &) const {\n    return sizeof(T);\n}\n\n#endif \/* UTILS_DATA_INPUT_HH_ *\/\n\n<commit_msg>db: add data_input constructors & methods<commit_after>\/*\n * Copyright 2014 Cloudius Systems\n *\/\n\n#ifndef UTILS_DATA_INPUT_HH_\n#define UTILS_DATA_INPUT_HH_\n\n#include \"bytes.hh\"\n#include \"net\/byteorder.hh\"\n\nclass data_input {\npublic:\n    data_input(const bytes_view& v)\n            : _view(v) {\n    }\n    data_input(bytes_view&& v)\n            : _view(std::move(v)) {\n    }\n    data_input(const bytes& b)\n            : data_input(bytes_view(b)) {\n    }\n    data_input(const bytes& b, size_t off, size_t n = bytes::npos)\n            : data_input(\n                    bytes_view(b.c_str() + off, std::min(b.size() - off, n))) {\n        if (off > b.size()) {\n            throw std::out_of_range(\"Offset out of range\");\n        }\n    }\n    template<typename T>\n    data_input(const std::experimental::basic_string_view<T>& view)\n            : data_input(\n                    bytes_view(reinterpret_cast<const int8_t *>(view.data()),\n                            view.size() * sizeof(T))) {\n    }\n    template<typename T>\n    data_input(const temporary_buffer<T>& buf)\n            : data_input(\n                    std::experimental::basic_string_view<T>(buf.get(), buf.size())) {\n    }\n    data_input(data_input&&) = default;\n    data_input(const data_input&) = default;\n\n    size_t avail() const {\n        return _view.size();\n    }\n    bool has_next() const {\n        return !_view.empty();\n    }\n    void ensure(size_t s) const {\n        if (avail() < s) {\n            throw std::out_of_range(\"Buffer underflow\");\n        }\n    }\n    template<typename T> T peek() const;\n    template<typename T> T read();\n\n    bytes_view read_view(size_t len) {\n        bytes_view v(_view.begin(), len);\n        _view.remove_prefix(len);\n        return v;\n    }\n\n    template <typename SizeType>\n    bytes_view read_view_to_blob() {\n        auto len = read<SizeType>();\n        return read_view(len);\n    }\n\n    void skip(size_t s) {\n        ensure(s);\n        _view.remove_prefix(s);\n    }\nprivate:\n    template<typename T> size_t ssize(const T &) const;\n    template<typename T>\n    inline std::enable_if_t<std::is_fundamental<T>::value, T> peek_primitive() const {\n        ensure(sizeof(T));\n        T t;\n        std::copy_n(_view.begin(), sizeof(T), reinterpret_cast<char *>(&t));\n        return net::ntoh(t);\n    }\n\n    bytes_view _view;\n};\n\ntemplate<> inline sstring data_input::peek<sstring>() const {\n    auto len = peek<uint16_t>();\n    ensure(sizeof(uint16_t) + len);\n    return sstring(reinterpret_cast<const char*>(_view.data()) + sizeof(uint16_t), len);\n}\ntemplate<> inline size_t data_input::ssize<sstring>(const sstring & s) const {\n    return sizeof(uint16_t) + s.size();\n}\ntemplate<> inline bytes data_input::peek<bytes>() const {\n    auto len = peek<uint32_t>();\n    ensure(sizeof(uint32_t) + len);\n    return bytes(_view.data() + sizeof(uint32_t), len);\n}\ntemplate<> inline size_t data_input::ssize<bytes>(const bytes & s) const {\n    return sizeof(uint32_t) + s.size();\n}\ntemplate<> inline size_t data_input::ssize(const bool &) const {\n    return sizeof(uint8_t);\n}\ntemplate<> inline bool data_input::peek<bool>() const {\n    return peek<uint8_t>() != 0;\n}\ntemplate<typename T>\ninline T data_input::peek() const {\n    return peek_primitive<T>();\n}\ntemplate<typename T> inline T data_input::read() {\n    auto t = peek<T>();\n    _view.remove_prefix(ssize(t));\n    return std::move(t);\n}\ntemplate<typename T> inline size_t data_input::ssize(const T &) const {\n    return sizeof(T);\n}\n\n#endif \/* UTILS_DATA_INPUT_HH_ *\/\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"vizrenderthread.h\"\n#include \"viz\/vizwidget.h\"\n\nVizRenderThread::VizRenderThread(VizWidget *parent) :\n    QThread(parent),\n    vertexBuffer(QOpenGLBuffer::VertexBuffer),\n    fftBuffer()\n{\n    this->parent = parent;\n    playbackWidget = NULL;\n    vertShader = \".\/shaders\/basic.vert\";\n    fragShader = \".\/shaders\/basic.frag\";\n    rendering = true;\n    needsResize = false;\n    frameCount = 0;\n}\n\nvoid VizRenderThread::resize(int w, int h)\n{\n    this->winWidth = w;\n    this->winHeight = h;\n    needsResize = true;\n}\n\nvoid VizRenderThread::run()\n{\n    parent->makeCurrent();\n    initialize();\n    rendering = true;\n    while(rendering)\n    {\n        if(needsResize)\n            glViewport(0, 0, (GLint)winWidth, (GLint)winHeight);\n\n        \/\/ Clear the buffer with the current clearing color\n        glClear( GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT );\n        \/\/Update the fft buffer\n        updateFFT();\n        updateShaders();\n        \/\/ Draw stuff\n        glDrawArrays(GL_QUADS, 0, 4);\n\n        parent->swapBuffers();\n        ++frameCount;\n        msleep(16);\n    }\n    \/\/Unload every thing for the next time the viz starts\n    fftBuffer.release();\n    vertexBuffer.release();\n    shaderProgram.removeAllShaders();\n    shaderProgram.release();\n}\n\nvoid VizRenderThread::updateShaders()\n{\n    shaderProgram.setUniformValue(\"winSize\", winWidth, winHeight);\n    shaderProgram.setUniformValue(\"time\", frameCount);\n    fftBuffer.write(0, &fftData, FFT_SIZE);\n}\n\nvoid VizRenderThread::updateFFT()\n{\n    if(playbackWidget != NULL)\n        playbackWidget->getFFT(&fftData);\n}\n\nvoid VizRenderThread::stop()\n{\n    rendering = false;\n}\n\nvoid VizRenderThread::initialize()\n{\n    glClearColor(0.0, 0.0, 0.0, 0.0);\n    glEnable(GL_DEPTH_TEST);\n    frameCount = 0;\n\n    \/\/ Prepare a complete shader program...\n    if ( !prepareShaders(vertShader, fragShader) )\n        return;\n    \/\/ Bind the shader program so that we can associate variables from\n    \/\/ our application to the shaders\n    if ( !shaderProgram.bind() )\n    {\n        qWarning() << \"Could not bind shader program to context\";\n        return;\n    }\n\n    \/\/ Make the background quad and bind it to the vertex buffer\n    GLfloat vertices[] = {-1, -1, 0, \/\/bottom left corner\n                          -1,  1, 0, \/\/top left corner\n                           1,  1, 0, \/\/top right corner\n                           1, -1, 0}; \/\/ bottom right corner\n\n    vertexBuffer.create();\n    vertexBuffer.setUsagePattern( QOpenGLBuffer::StaticDraw );\n    if ( !vertexBuffer.bind() )\n    {\n        qWarning() << \"Could not bind vertex buffer to the context\";\n        return;\n    }\n    vertexBuffer.allocate(vertices, 3 * 4 * sizeof( float ));\n    shaderProgram.setAttributeBuffer(\"vertex\", GL_FLOAT, 0, 3);\n    shaderProgram.enableAttributeArray(\"vertex\");\n\n\n    \/\/ Setup the fft buffer\n    fftBuffer.create();\n    fftBuffer.bind(shaderProgram.programId(), \"fftBlock\");\n    fftBuffer.allocate(FFT_SIZE);\n}\n\nbool VizRenderThread::prepareShaders(const QString &vertShaderPath, const QString &fragShaderPath)\n{\n    \/\/ First we load and compile the vertex shader...\n    bool result = shaderProgram.addShaderFromSourceFile(QOpenGLShader::Vertex, vertShaderPath);\n    if ( !result )\n        qWarning() << shaderProgram.log();\n\n    \/\/ ...now the fragment shader...\n    result = shaderProgram.addShaderFromSourceFile(QOpenGLShader::Fragment, fragShaderPath);\n    if ( !result )\n        qWarning() << shaderProgram.log();\n\n    \/\/ ...and finally we link them to resolve any references.\n    result = shaderProgram.link();\n    if ( !result )\n        qWarning() << \"Could not link shader program:\" << shaderProgram.log();\n\n    return result;\n}\n<commit_msg>Fixed stupid opengl warnings<commit_after>#include \"vizrenderthread.h\"\n#include \"viz\/vizwidget.h\"\n\nVizRenderThread::VizRenderThread(VizWidget *parent) :\n    QThread(parent),\n    shaderProgram(this),\n    vertexBuffer(QOpenGLBuffer::VertexBuffer),\n    fftBuffer()\n{\n    this->parent = parent;\n    playbackWidget = NULL;\n    vertShader = \".\/shaders\/basic.vert\";\n    fragShader = \".\/shaders\/basic.frag\";\n    needsResize = false;\n    frameCount = 0;\n}\n\nvoid VizRenderThread::resize(int w, int h)\n{\n    this->winWidth = w;\n    this->winHeight = h;\n    needsResize = true;\n}\n\nvoid VizRenderThread::run()\n{\n    initialize();\n    rendering = true;\n    while(rendering)\n    {\n        parent->makeCurrent();\n        if(needsResize)\n            glViewport(0, 0, (GLint)winWidth, (GLint)winHeight);\n\n        \/\/ Clear the buffer with the current clearing color\n        glClear( GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT );\n        \/\/Update the fft buffer\n        updateFFT();\n        updateShaders();\n        \/\/ Draw stuff\n        glDrawArrays(GL_QUADS, 0, 4);\n\n        parent->swapBuffers();\n        ++frameCount;\n        msleep(16);\n    }\n    \/\/Unload every thing for the next time the viz starts\n    fftBuffer.release();\n    vertexBuffer.release();\n    shaderProgram.removeAllShaders();\n    shaderProgram.release();\n}\n\nvoid VizRenderThread::updateShaders()\n{\n    shaderProgram.setUniformValue(\"winSize\", winWidth, winHeight);\n    shaderProgram.setUniformValue(\"time\", frameCount);\n    fftBuffer.write(0, &fftData, FFT_SIZE);\n}\n\nvoid VizRenderThread::updateFFT()\n{\n    if(playbackWidget != NULL)\n        playbackWidget->getFFT(&fftData);\n}\n\nvoid VizRenderThread::stop()\n{\n    rendering = false;\n}\n\nvoid VizRenderThread::initialize()\n{\n    parent->makeCurrent();\n    glClearColor(0.0, 0.0, 0.0, 0.0);\n    glEnable(GL_DEPTH_TEST);\n    frameCount = 0;\n\n    \/\/ Prepare a complete shader program...\n    if ( !prepareShaders(vertShader, fragShader) )\n        return;\n    \/\/ Bind the shader program so that we can associate variables from\n    \/\/ our application to the shaders\n    if ( !shaderProgram.bind() )\n    {\n        qWarning() << \"Could not bind shader program to context\";\n        return;\n    }\n\n    \/\/ Make the background quad and bind it to the vertex buffer\n    GLfloat vertices[] = {-1, -1, 0, \/\/bottom left corner\n                          -1,  1, 0, \/\/top left corner\n                           1,  1, 0, \/\/top right corner\n                           1, -1, 0}; \/\/ bottom right corner\n\n    vertexBuffer.create();\n    vertexBuffer.setUsagePattern( QOpenGLBuffer::StaticDraw );\n    if ( !vertexBuffer.bind() )\n    {\n        qWarning() << \"Could not bind vertex buffer to the context\";\n        return;\n    }\n    vertexBuffer.allocate(vertices, 3 * 4 * sizeof( float ));\n    shaderProgram.setAttributeBuffer(\"vertex\", GL_FLOAT, 0, 3);\n    shaderProgram.enableAttributeArray(\"vertex\");\n\n\n    \/\/ Setup the fft buffer\n    fftBuffer.create();\n    fftBuffer.bind(shaderProgram.programId(), \"fftBlock\");\n    fftBuffer.allocate(FFT_SIZE);\n}\n\nbool VizRenderThread::prepareShaders(const QString &vertShaderPath, const QString &fragShaderPath)\n{\n    \/\/ First we load and compile the vertex shader...\n    bool result = shaderProgram.addShaderFromSourceFile(QOpenGLShader::Vertex, vertShaderPath);\n    if ( !result )\n        qWarning() << shaderProgram.log();\n\n    \/\/ ...now the fragment shader...\n    result = shaderProgram.addShaderFromSourceFile(QOpenGLShader::Fragment, fragShaderPath);\n    if ( !result )\n        qWarning() << shaderProgram.log();\n\n    \/\/ ...and finally we link them to resolve any references.\n    result = shaderProgram.link();\n    if ( !result )\n        qWarning() << \"Could not link shader program:\" << shaderProgram.log();\n\n    return result;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"setupdialog.h\"\n#include \"debug.h\"\n#include \"ui_setupdialog.h\"\n#include \"utils.h\"\n\n#include <QDateTime>\n#include <QDir>\n#include <QFileDialog>\n#include <QFileInfo>\n#include <QHostInfo>\n#include <QSettings>\n#include <QStandardPaths>\n\nSetupDialog::SetupDialog(QWidget *parent)\n    : QDialog(parent),\n      _ui(new Ui::SetupDialog),\n      _loadingAnimation(\":\/icons\/loading.gif\"),\n      _haveKey(false)\n{\n    _ui->setupUi(this);\n    setWindowFlags((windowFlags() | Qt::CustomizeWindowHint) &\n                   ~Qt::WindowMaximizeButtonHint);\n\n    _ui->loadingIconLabel->setMovie(&_loadingAnimation);\n    _ui->errorLabel->hide();\n    _ui->machineKeyLabel->hide();\n    _ui->machineKeyCombo->hide();\n    _ui->browseKeyButton->hide();\n    _ui->advancedCLIWidget->hide();\n\n    connect(_ui->welcomePageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n    connect(_ui->restorePageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n    connect(_ui->advancedPageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n    connect(_ui->registerPageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n    connect(_ui->donePageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n\n    connect(_ui->wizardStackedWidget, &QStackedWidget::currentChanged, this,\n            &SetupDialog::wizardPageChanged);\n\n    \/\/ Welcome page\n    connect(_ui->welcomePageSkipButton, &QPushButton::clicked,\n            [&]() { commitSettings(true); });\n    connect(_ui->welcomePageProceedButton, &QPushButton::clicked, this,\n            &SetupDialog::setNextPage);\n\n    \/\/ Advanced setup page\n    connect(_ui->advancedCLIButton, &QPushButton::toggled,\n            _ui->advancedCLIWidget, &QWidget::setVisible);\n    connect(_ui->tarsnapPathBrowseButton, &QPushButton::clicked, this,\n            &SetupDialog::showTarsnapPathBrowse);\n    connect(_ui->tarsnapPathLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateAdvancedSetupPage);\n    connect(_ui->tarsnapCacheBrowseButton, &QPushButton::clicked, this,\n            &SetupDialog::showTarsnapCacheBrowse);\n    connect(_ui->tarsnapCacheLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateAdvancedSetupPage);\n    connect(_ui->appDataBrowseButton, &QPushButton::clicked, this,\n            &SetupDialog::showAppDataBrowse);\n    connect(_ui->appDataPathLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateAdvancedSetupPage);\n    connect(_ui->advancedPageProceedButton, &QPushButton::clicked, this,\n            &SetupDialog::setNextPage);\n\n    \/\/ Restore page\n    connect(_ui->restoreNoButton, &QPushButton::clicked, this,\n            &SetupDialog::restoreNo);\n    connect(_ui->restoreYesButton, &QPushButton::clicked, this,\n            &SetupDialog::restoreYes);\n\n    \/\/ Register page\n    connect(_ui->tarsnapUserLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateRegisterPage);\n    connect(_ui->tarsnapPasswordLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateRegisterPage);\n    connect(_ui->machineNameLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateRegisterPage);\n    connect(_ui->machineKeyCombo, &QComboBox::currentTextChanged, this,\n            &SetupDialog::validateRegisterPage);\n    connect(_ui->browseKeyButton, &QPushButton::clicked, this,\n            &SetupDialog::registerHaveKeyBrowse);\n    connect(_ui->registerMachineButton, &QPushButton::clicked, this,\n            &SetupDialog::registerMachine);\n\n    \/\/ Done page\n    connect(_ui->doneButton, &QPushButton::clicked, this,\n            &SetupDialog::commitSettings);\n\n    _appDataDir = QStandardPaths::writableLocation(APPDATA);\n    QDir keysDir(_appDataDir);\n    if(!keysDir.exists())\n        keysDir.mkpath(_appDataDir);\n    _ui->appDataPathLineEdit->setText(_appDataDir);\n\n    _tarsnapCacheDir =\n        QStandardPaths::writableLocation(QStandardPaths::CacheLocation);\n    QDir cacheDir(_tarsnapCacheDir);\n    if(!cacheDir.exists())\n        cacheDir.mkpath(_tarsnapCacheDir);\n    _ui->tarsnapCacheLineEdit->setText(_tarsnapCacheDir);\n\n    _tarsnapDir = Utils::findTarsnapClientInPath(\"\", true);\n    _ui->tarsnapPathLineEdit->setText(_tarsnapDir);\n    _ui->machineNameLineEdit->setText(QHostInfo::localHostName());\n    _ui->wizardStackedWidget->setCurrentWidget(_ui->welcomePage);\n}\n\nSetupDialog::~SetupDialog()\n{\n    delete _ui;\n}\n\nvoid SetupDialog::wizardPageChanged(int)\n{\n    if(_ui->wizardStackedWidget->currentWidget() == _ui->welcomePage)\n    {\n        _ui->welcomePageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Setup wizard\"));\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->advancedPage)\n    {\n        _ui->advancedPageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Command-line utilities\"));\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->restorePage)\n    {\n        _ui->restorePageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Machine key\"));\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->registerPage)\n    {\n        _ui->registerPageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Register with server\"));\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->donePage)\n    {\n        _ui->donePageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Setup complete!\"));\n    }\n}\n\nvoid SetupDialog::skipToPage()\n{\n    if(sender() == _ui->welcomePageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->welcomePage);\n    else if(sender() == _ui->restorePageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->restorePage);\n    else if(sender() == _ui->advancedPageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->advancedPage);\n    else if(sender() == _ui->registerPageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->registerPage);\n    else if(sender() == _ui->donePageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->donePage);\n}\n\nvoid SetupDialog::setNextPage()\n{\n    if(_ui->wizardStackedWidget->currentWidget() == _ui->welcomePage)\n    {\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->advancedPage);\n        _ui->advancedPageRadioButton->setEnabled(true);\n        validateAdvancedSetupPage();\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->advancedPage)\n    {\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->restorePage);\n        _ui->restorePageRadioButton->setEnabled(true);\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->restorePage)\n    {\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->registerPage);\n        _ui->registerPageRadioButton->setEnabled(true);\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->registerPage)\n    {\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->donePage);\n        _ui->donePageRadioButton->setEnabled(true);\n    }\n}\n\nvoid SetupDialog::showTarsnapPathBrowse()\n{\n    QString tarsnapPath =\n        QFileDialog::getExistingDirectory(this, tr(\"Find Tarsnap client\"), \"\");\n    _ui->tarsnapPathLineEdit->setText(tarsnapPath);\n}\n\nvoid SetupDialog::showTarsnapCacheBrowse()\n{\n    QString tarsnapCacheDir =\n        QFileDialog::getExistingDirectory(this, tr(\"Tarsnap cache location\"),\n                                          _tarsnapCacheDir);\n    _ui->tarsnapCacheLineEdit->setText(tarsnapCacheDir);\n}\n\nvoid SetupDialog::showAppDataBrowse()\n{\n    QString appDataDir =\n        QFileDialog::getExistingDirectory(this, tr(\"App data location\"), \"\");\n    _ui->appDataPathLineEdit->setText(appDataDir);\n}\n\nbool SetupDialog::validateAdvancedSetupPage()\n{\n    bool result = false;\n\n    setTarsnapVersion(\"\");\n\n    _tarsnapDir =\n        Utils::findTarsnapClientInPath(_ui->tarsnapPathLineEdit->text(), true);\n    _tarsnapCacheDir =\n        Utils::validateTarsnapCache(_ui->tarsnapCacheLineEdit->text());\n    QFileInfo appDataDir(_ui->appDataPathLineEdit->text());\n    if(appDataDir.exists() && appDataDir.isDir() && appDataDir.isWritable())\n        _appDataDir = _ui->appDataPathLineEdit->text();\n    else\n        _appDataDir.clear();\n\n    if(_tarsnapDir.isEmpty() || _tarsnapCacheDir.isEmpty() ||\n       _appDataDir.isEmpty())\n        result = false;\n    else\n        result = true;\n\n    if(result)\n        emit getTarsnapVersion(_tarsnapDir);\n\n    _ui->advancedPageProceedButton->setEnabled(result);\n\n    return result;\n}\n\nvoid SetupDialog::restoreNo()\n{\n    _haveKey = false;\n    _ui->machineKeyLabel->hide();\n    _ui->machineKeyCombo->hide();\n    _ui->browseKeyButton->hide();\n    _ui->tarsnapUserLabel->show();\n    _ui->tarsnapUserLineEdit->show();\n    _ui->tarsnapPasswordLabel->show();\n    _ui->tarsnapPasswordLineEdit->show();\n    _ui->registerPageInfoLabel->setText(\n        tr(\"Please use your Tarsnap account \"\n           \"credentials to register this machine with the service \"\n           \"and create a local key for this machine.\"));\n    _ui->registerPageInfoLabelAside->setText(\n        tr(\"Don't have an account? Register on \"\n        \"<a href=\\\"http:\/\/tarsnap.com\\\">tarsnap.com<\/a>, \"\n        \"then come back.\"));\n    _ui->errorLabel->clear();\n    setNextPage();\n}\n\nvoid SetupDialog::restoreYes()\n{\n    _haveKey = true;\n    _ui->tarsnapUserLabel->hide();\n    _ui->tarsnapUserLineEdit->hide();\n    _ui->tarsnapPasswordLabel->hide();\n    _ui->tarsnapPasswordLineEdit->hide();\n    _ui->machineKeyLabel->show();\n    _ui->machineKeyCombo->show();\n    _ui->browseKeyButton->show();\n    _ui->registerPageInfoLabel->setText(\n        tr(\"Please use your existing machine key \"\n           \"and choose a machine name. \"));\n    _ui->registerPageInfoLabelAside->setText(\n        tr(\"The registration will also \"\n           \"verify the archive integrity and consistency, \"\n           \"so please be patient.\"));\n    _ui->errorLabel->clear();\n    _ui->machineKeyCombo->clear();\n    foreach(QFileInfo file, Utils::findKeysInPath(_appDataDir))\n        _ui->machineKeyCombo->addItem(file.canonicalFilePath());\n    setNextPage();\n}\n\nvoid SetupDialog::validateRegisterPage()\n{\n    bool result = false;\n    if(_haveKey)\n    {\n        \/\/ user specified key\n        QFileInfo machineKeyFile(_ui->machineKeyCombo->currentText());\n        if(!_ui->machineNameLineEdit->text().isEmpty() &&\n           machineKeyFile.exists() && machineKeyFile.isFile() &&\n           machineKeyFile.isReadable())\n        {\n            result = true;\n        }\n    }\n    else\n    {\n        if(!_ui->tarsnapUserLineEdit->text().isEmpty() &&\n           !_ui->tarsnapPasswordLineEdit->text().isEmpty() &&\n           !_ui->machineNameLineEdit->text().isEmpty())\n        {\n            result = true;\n        }\n    }\n\n    _ui->registerMachineButton->setEnabled(result);\n}\n\nvoid SetupDialog::registerHaveKeyBrowse()\n{\n    QString existingMachineKey =\n        QFileDialog::getOpenFileName(this,\n                                     tr(\"Browse for existing machine key\"));\n    if(!existingMachineKey.isEmpty())\n        _ui->machineKeyCombo->setCurrentText(existingMachineKey);\n}\n\nvoid SetupDialog::registerMachine()\n{\n    _ui->registerMachineButton->setEnabled(false);\n    _ui->errorLabel->clear();\n    if(_haveKey)\n        _tarsnapKeyFile = _ui->machineKeyCombo->currentText();\n    else\n        _tarsnapKeyFile =\n            _appDataDir + QDir::separator() + _ui->machineNameLineEdit->text() +\n            \"-\" + QDateTime::currentDateTime().toString(\"yyyy-MM-dd-HH-mm-ss\") +\n            \".key\";\n\n    DEBUG << \"Registration details >>\\n\" << _tarsnapDir << ::endl\n          << _appDataDir << ::endl\n          << _tarsnapKeyFile << ::endl\n          << _tarsnapCacheDir;\n\n    emit requestRegisterMachine(_ui->tarsnapUserLineEdit->text(),\n                                _ui->tarsnapPasswordLineEdit->text(),\n                                _ui->machineNameLineEdit->text(),\n                                _tarsnapKeyFile, _tarsnapDir, _tarsnapCacheDir);\n}\n\nvoid SetupDialog::registerMachineStatus(TaskStatus status, QString reason)\n{\n    switch(status)\n    {\n    case TaskStatus::Completed:\n        _ui->errorLabel->clear();\n        _ui->doneKeyFileNameLabel->setText(\n                    QString(\"<a href=\\\"%1\\\">%2<\/a>\")\n                           .arg(QUrl::fromLocalFile(_tarsnapKeyFile).toString())\n                           .arg(_tarsnapKeyFile));\n        _ui->doneButton->setEnabled(true);\n        setNextPage();\n        break;\n    case TaskStatus::Failed:\n        _ui->errorLabel->setText(reason);\n        _ui->errorLabel->show();\n        _ui->registerMachineButton->setEnabled(true);\n        resize(sizeHint());\n        break;\n    default:\n        break;\n    }\n}\n\nvoid SetupDialog::updateLoadingAnimation(bool idle)\n{\n    if(idle)\n    {\n        _loadingAnimation.stop();\n        _ui->loadingIconLabel->hide();\n    }\n    else\n    {\n        _loadingAnimation.start();\n        _ui->loadingIconLabel->show();\n    }\n}\n\nvoid SetupDialog::setTarsnapVersion(QString versionString)\n{\n    _tarsnapVersion = versionString;\n    if(_tarsnapVersion.isEmpty())\n    {\n        _ui->clientVersionLabel->setText(\n            tr(\"Tarsnap utilities not found. Visit \"\n               \"<a href=\\\"https:\/\/tarsnap.com\\\">tarsnap.com<\/a> \"\n               \"for help with acquiring them.\"));\n    }\n    else\n    {\n        _ui->clientVersionLabel->setText(tr(\"Tarsnap CLI version \") +\n                                         _tarsnapVersion + tr(\" detected.  ✔\"));\n    }\n}\n\nvoid SetupDialog::commitSettings(bool skipped)\n{\n    QSettings settings;\n\n    DEBUG << \"Settings location is \" << settings.fileName();\n\n    settings.setValue(\"app\/wizard_done\", true);\n\n    if(!skipped)\n    {\n        QSettings settings;\n        settings.setValue(\"app\/app_data\",    _appDataDir);\n        settings.setValue(\"tarsnap\/path\",    _tarsnapDir);\n        settings.setValue(\"tarsnap\/version\", _tarsnapVersion);\n        settings.setValue(\"tarsnap\/cache\",   _tarsnapCacheDir);\n        settings.setValue(\"tarsnap\/key\",     _tarsnapKeyFile);\n        settings.setValue(\"tarsnap\/user\",    _ui->tarsnapUserLineEdit->text());\n        settings.setValue(\"tarsnap\/machine\", _ui->machineNameLineEdit->text());\n    }\n    settings.sync();\n\n    accept();\n}\n<commit_msg>Open residing dir, instead of the key file itself.<commit_after>#include \"setupdialog.h\"\n#include \"debug.h\"\n#include \"ui_setupdialog.h\"\n#include \"utils.h\"\n\n#include <QDateTime>\n#include <QDir>\n#include <QFileDialog>\n#include <QFileInfo>\n#include <QHostInfo>\n#include <QSettings>\n#include <QStandardPaths>\n\nSetupDialog::SetupDialog(QWidget *parent)\n    : QDialog(parent),\n      _ui(new Ui::SetupDialog),\n      _loadingAnimation(\":\/icons\/loading.gif\"),\n      _haveKey(false)\n{\n    _ui->setupUi(this);\n    setWindowFlags((windowFlags() | Qt::CustomizeWindowHint) &\n                   ~Qt::WindowMaximizeButtonHint);\n\n    _ui->loadingIconLabel->setMovie(&_loadingAnimation);\n    _ui->errorLabel->hide();\n    _ui->machineKeyLabel->hide();\n    _ui->machineKeyCombo->hide();\n    _ui->browseKeyButton->hide();\n    _ui->advancedCLIWidget->hide();\n\n    connect(_ui->welcomePageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n    connect(_ui->restorePageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n    connect(_ui->advancedPageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n    connect(_ui->registerPageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n    connect(_ui->donePageRadioButton, &QRadioButton::clicked, this,\n            &SetupDialog::skipToPage);\n\n    connect(_ui->wizardStackedWidget, &QStackedWidget::currentChanged, this,\n            &SetupDialog::wizardPageChanged);\n\n    \/\/ Welcome page\n    connect(_ui->welcomePageSkipButton, &QPushButton::clicked,\n            [&]() { commitSettings(true); });\n    connect(_ui->welcomePageProceedButton, &QPushButton::clicked, this,\n            &SetupDialog::setNextPage);\n\n    \/\/ Advanced setup page\n    connect(_ui->advancedCLIButton, &QPushButton::toggled,\n            _ui->advancedCLIWidget, &QWidget::setVisible);\n    connect(_ui->tarsnapPathBrowseButton, &QPushButton::clicked, this,\n            &SetupDialog::showTarsnapPathBrowse);\n    connect(_ui->tarsnapPathLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateAdvancedSetupPage);\n    connect(_ui->tarsnapCacheBrowseButton, &QPushButton::clicked, this,\n            &SetupDialog::showTarsnapCacheBrowse);\n    connect(_ui->tarsnapCacheLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateAdvancedSetupPage);\n    connect(_ui->appDataBrowseButton, &QPushButton::clicked, this,\n            &SetupDialog::showAppDataBrowse);\n    connect(_ui->appDataPathLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateAdvancedSetupPage);\n    connect(_ui->advancedPageProceedButton, &QPushButton::clicked, this,\n            &SetupDialog::setNextPage);\n\n    \/\/ Restore page\n    connect(_ui->restoreNoButton, &QPushButton::clicked, this,\n            &SetupDialog::restoreNo);\n    connect(_ui->restoreYesButton, &QPushButton::clicked, this,\n            &SetupDialog::restoreYes);\n\n    \/\/ Register page\n    connect(_ui->tarsnapUserLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateRegisterPage);\n    connect(_ui->tarsnapPasswordLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateRegisterPage);\n    connect(_ui->machineNameLineEdit, &QLineEdit::textChanged, this,\n            &SetupDialog::validateRegisterPage);\n    connect(_ui->machineKeyCombo, &QComboBox::currentTextChanged, this,\n            &SetupDialog::validateRegisterPage);\n    connect(_ui->browseKeyButton, &QPushButton::clicked, this,\n            &SetupDialog::registerHaveKeyBrowse);\n    connect(_ui->registerMachineButton, &QPushButton::clicked, this,\n            &SetupDialog::registerMachine);\n\n    \/\/ Done page\n    connect(_ui->doneButton, &QPushButton::clicked, this,\n            &SetupDialog::commitSettings);\n\n    _appDataDir = QStandardPaths::writableLocation(APPDATA);\n    QDir keysDir(_appDataDir);\n    if(!keysDir.exists())\n        keysDir.mkpath(_appDataDir);\n    _ui->appDataPathLineEdit->setText(_appDataDir);\n\n    _tarsnapCacheDir =\n        QStandardPaths::writableLocation(QStandardPaths::CacheLocation);\n    QDir cacheDir(_tarsnapCacheDir);\n    if(!cacheDir.exists())\n        cacheDir.mkpath(_tarsnapCacheDir);\n    _ui->tarsnapCacheLineEdit->setText(_tarsnapCacheDir);\n\n    _tarsnapDir = Utils::findTarsnapClientInPath(\"\", true);\n    _ui->tarsnapPathLineEdit->setText(_tarsnapDir);\n    _ui->machineNameLineEdit->setText(QHostInfo::localHostName());\n    _ui->wizardStackedWidget->setCurrentWidget(_ui->welcomePage);\n}\n\nSetupDialog::~SetupDialog()\n{\n    delete _ui;\n}\n\nvoid SetupDialog::wizardPageChanged(int)\n{\n    if(_ui->wizardStackedWidget->currentWidget() == _ui->welcomePage)\n    {\n        _ui->welcomePageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Setup wizard\"));\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->advancedPage)\n    {\n        _ui->advancedPageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Command-line utilities\"));\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->restorePage)\n    {\n        _ui->restorePageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Machine key\"));\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->registerPage)\n    {\n        _ui->registerPageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Register with server\"));\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->donePage)\n    {\n        _ui->donePageRadioButton->setChecked(true);\n        _ui->titleLabel->setText(tr(\"Setup complete!\"));\n    }\n}\n\nvoid SetupDialog::skipToPage()\n{\n    if(sender() == _ui->welcomePageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->welcomePage);\n    else if(sender() == _ui->restorePageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->restorePage);\n    else if(sender() == _ui->advancedPageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->advancedPage);\n    else if(sender() == _ui->registerPageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->registerPage);\n    else if(sender() == _ui->donePageRadioButton)\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->donePage);\n}\n\nvoid SetupDialog::setNextPage()\n{\n    if(_ui->wizardStackedWidget->currentWidget() == _ui->welcomePage)\n    {\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->advancedPage);\n        _ui->advancedPageRadioButton->setEnabled(true);\n        validateAdvancedSetupPage();\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->advancedPage)\n    {\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->restorePage);\n        _ui->restorePageRadioButton->setEnabled(true);\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->restorePage)\n    {\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->registerPage);\n        _ui->registerPageRadioButton->setEnabled(true);\n    }\n    else if(_ui->wizardStackedWidget->currentWidget() == _ui->registerPage)\n    {\n        _ui->wizardStackedWidget->setCurrentWidget(_ui->donePage);\n        _ui->donePageRadioButton->setEnabled(true);\n    }\n}\n\nvoid SetupDialog::showTarsnapPathBrowse()\n{\n    QString tarsnapPath =\n        QFileDialog::getExistingDirectory(this, tr(\"Find Tarsnap client\"), \"\");\n    _ui->tarsnapPathLineEdit->setText(tarsnapPath);\n}\n\nvoid SetupDialog::showTarsnapCacheBrowse()\n{\n    QString tarsnapCacheDir =\n        QFileDialog::getExistingDirectory(this, tr(\"Tarsnap cache location\"),\n                                          _tarsnapCacheDir);\n    _ui->tarsnapCacheLineEdit->setText(tarsnapCacheDir);\n}\n\nvoid SetupDialog::showAppDataBrowse()\n{\n    QString appDataDir =\n        QFileDialog::getExistingDirectory(this, tr(\"App data location\"), \"\");\n    _ui->appDataPathLineEdit->setText(appDataDir);\n}\n\nbool SetupDialog::validateAdvancedSetupPage()\n{\n    bool result = false;\n\n    setTarsnapVersion(\"\");\n\n    _tarsnapDir =\n        Utils::findTarsnapClientInPath(_ui->tarsnapPathLineEdit->text(), true);\n    _tarsnapCacheDir =\n        Utils::validateTarsnapCache(_ui->tarsnapCacheLineEdit->text());\n    QFileInfo appDataDir(_ui->appDataPathLineEdit->text());\n    if(appDataDir.exists() && appDataDir.isDir() && appDataDir.isWritable())\n        _appDataDir = _ui->appDataPathLineEdit->text();\n    else\n        _appDataDir.clear();\n\n    if(_tarsnapDir.isEmpty() || _tarsnapCacheDir.isEmpty() ||\n       _appDataDir.isEmpty())\n        result = false;\n    else\n        result = true;\n\n    if(result)\n        emit getTarsnapVersion(_tarsnapDir);\n\n    _ui->advancedPageProceedButton->setEnabled(result);\n\n    return result;\n}\n\nvoid SetupDialog::restoreNo()\n{\n    _haveKey = false;\n    _ui->machineKeyLabel->hide();\n    _ui->machineKeyCombo->hide();\n    _ui->browseKeyButton->hide();\n    _ui->tarsnapUserLabel->show();\n    _ui->tarsnapUserLineEdit->show();\n    _ui->tarsnapPasswordLabel->show();\n    _ui->tarsnapPasswordLineEdit->show();\n    _ui->registerPageInfoLabel->setText(\n        tr(\"Please use your Tarsnap account \"\n           \"credentials to register this machine with the service \"\n           \"and create a local key for this machine.\"));\n    _ui->registerPageInfoLabelAside->setText(\n        tr(\"Don't have an account? Register on \"\n        \"<a href=\\\"http:\/\/tarsnap.com\\\">tarsnap.com<\/a>, \"\n        \"then come back.\"));\n    _ui->errorLabel->clear();\n    setNextPage();\n}\n\nvoid SetupDialog::restoreYes()\n{\n    _haveKey = true;\n    _ui->tarsnapUserLabel->hide();\n    _ui->tarsnapUserLineEdit->hide();\n    _ui->tarsnapPasswordLabel->hide();\n    _ui->tarsnapPasswordLineEdit->hide();\n    _ui->machineKeyLabel->show();\n    _ui->machineKeyCombo->show();\n    _ui->browseKeyButton->show();\n    _ui->registerPageInfoLabel->setText(\n        tr(\"Please use your existing machine key \"\n           \"and choose a machine name. \"));\n    _ui->registerPageInfoLabelAside->setText(\n        tr(\"The registration will also \"\n           \"verify the archive integrity and consistency, \"\n           \"so please be patient.\"));\n    _ui->errorLabel->clear();\n    _ui->machineKeyCombo->clear();\n    foreach(QFileInfo file, Utils::findKeysInPath(_appDataDir))\n        _ui->machineKeyCombo->addItem(file.canonicalFilePath());\n    setNextPage();\n}\n\nvoid SetupDialog::validateRegisterPage()\n{\n    bool result = false;\n    if(_haveKey)\n    {\n        \/\/ user specified key\n        QFileInfo machineKeyFile(_ui->machineKeyCombo->currentText());\n        if(!_ui->machineNameLineEdit->text().isEmpty() &&\n           machineKeyFile.exists() && machineKeyFile.isFile() &&\n           machineKeyFile.isReadable())\n        {\n            result = true;\n        }\n    }\n    else\n    {\n        if(!_ui->tarsnapUserLineEdit->text().isEmpty() &&\n           !_ui->tarsnapPasswordLineEdit->text().isEmpty() &&\n           !_ui->machineNameLineEdit->text().isEmpty())\n        {\n            result = true;\n        }\n    }\n\n    _ui->registerMachineButton->setEnabled(result);\n}\n\nvoid SetupDialog::registerHaveKeyBrowse()\n{\n    QString existingMachineKey =\n        QFileDialog::getOpenFileName(this,\n                                     tr(\"Browse for existing machine key\"));\n    if(!existingMachineKey.isEmpty())\n        _ui->machineKeyCombo->setCurrentText(existingMachineKey);\n}\n\nvoid SetupDialog::registerMachine()\n{\n    _ui->registerMachineButton->setEnabled(false);\n    _ui->errorLabel->clear();\n    if(_haveKey)\n        _tarsnapKeyFile = _ui->machineKeyCombo->currentText();\n    else\n        _tarsnapKeyFile =\n            _appDataDir + QDir::separator() + _ui->machineNameLineEdit->text() +\n            \"-\" + QDateTime::currentDateTime().toString(\"yyyy-MM-dd-HH-mm-ss\") +\n            \".key\";\n\n    DEBUG << \"Registration details >>\\n\" << _tarsnapDir << ::endl\n          << _appDataDir << ::endl\n          << _tarsnapKeyFile << ::endl\n          << _tarsnapCacheDir;\n\n    emit requestRegisterMachine(_ui->tarsnapUserLineEdit->text(),\n                                _ui->tarsnapPasswordLineEdit->text(),\n                                _ui->machineNameLineEdit->text(),\n                                _tarsnapKeyFile, _tarsnapDir, _tarsnapCacheDir);\n}\n\nvoid SetupDialog::registerMachineStatus(TaskStatus status, QString reason)\n{\n    switch(status)\n    {\n    case TaskStatus::Completed:\n        _ui->errorLabel->clear();\n        _ui->doneKeyFileNameLabel->setText(\n                    QString(\"<a href=\\\"%1\\\">%2<\/a>\")\n                           .arg(QUrl::fromLocalFile(QFileInfo(_tarsnapKeyFile).absolutePath()).toString())\n                           .arg(_tarsnapKeyFile));\n        _ui->doneButton->setEnabled(true);\n        setNextPage();\n        break;\n    case TaskStatus::Failed:\n        _ui->errorLabel->setText(reason);\n        _ui->errorLabel->show();\n        _ui->registerMachineButton->setEnabled(true);\n        resize(sizeHint());\n        break;\n    default:\n        break;\n    }\n}\n\nvoid SetupDialog::updateLoadingAnimation(bool idle)\n{\n    if(idle)\n    {\n        _loadingAnimation.stop();\n        _ui->loadingIconLabel->hide();\n    }\n    else\n    {\n        _loadingAnimation.start();\n        _ui->loadingIconLabel->show();\n    }\n}\n\nvoid SetupDialog::setTarsnapVersion(QString versionString)\n{\n    _tarsnapVersion = versionString;\n    if(_tarsnapVersion.isEmpty())\n    {\n        _ui->clientVersionLabel->setText(\n            tr(\"Tarsnap utilities not found. Visit \"\n               \"<a href=\\\"https:\/\/tarsnap.com\\\">tarsnap.com<\/a> \"\n               \"for help with acquiring them.\"));\n    }\n    else\n    {\n        _ui->clientVersionLabel->setText(tr(\"Tarsnap CLI version \") +\n                                         _tarsnapVersion + tr(\" detected.  ✔\"));\n    }\n}\n\nvoid SetupDialog::commitSettings(bool skipped)\n{\n    QSettings settings;\n\n    DEBUG << \"Settings location is \" << settings.fileName();\n\n    settings.setValue(\"app\/wizard_done\", true);\n\n    if(!skipped)\n    {\n        QSettings settings;\n        settings.setValue(\"app\/app_data\",    _appDataDir);\n        settings.setValue(\"tarsnap\/path\",    _tarsnapDir);\n        settings.setValue(\"tarsnap\/version\", _tarsnapVersion);\n        settings.setValue(\"tarsnap\/cache\",   _tarsnapCacheDir);\n        settings.setValue(\"tarsnap\/key\",     _tarsnapKeyFile);\n        settings.setValue(\"tarsnap\/user\",    _ui->tarsnapUserLineEdit->text());\n        settings.setValue(\"tarsnap\/machine\", _ui->machineNameLineEdit->text());\n    }\n    settings.sync();\n\n    accept();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file\n * \\brief Mutex class header\n *\n * \\author Copyright (C) 2014-2017 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#ifndef INCLUDE_DISTORTOS_MUTEX_HPP_\n#define INCLUDE_DISTORTOS_MUTEX_HPP_\n\n#include \"distortos\/internal\/synchronization\/MutexControlBlock.hpp\"\n\nnamespace distortos\n{\n\n\/**\n * \\brief Mutex is the basic synchronization primitive\n *\n * Similar to std::mutex - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\n * Similar to POSIX pthread_mutex_t -\n * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/V2_chap02.html#tag_15_09 -> 2.9.3 Thread Mutexes\n *\n * \\ingroup synchronization\n *\/\n\nclass Mutex : private internal::MutexControlBlock\n{\npublic:\n\n\t\/\/\/ mutex protocols\n\tusing Protocol = MutexProtocol;\n\n\t\/\/\/ type used for counting recursive locks\n\tusing RecursiveLocksCount = MutexControlBlock::RecursiveLocksCount;\n\n\t\/\/\/ type of mutex\n\tusing Type = MutexType;\n\n\t\/**\n\t * \\brief Gets the maximum number of recursive locks possible before returning EAGAIN\n\t *\n\t * \\note Actual number of lock() operations possible is getMaxRecursiveLocks() + 1.\n\t *\n\t * \\return maximum number of recursive locks possible before returning EAGAIN\n\t *\/\n\n\tconstexpr static RecursiveLocksCount getMaxRecursiveLocks()\n\t{\n\t\treturn std::numeric_limits<RecursiveLocksCount>::max();\n\t}\n\n\t\/**\n\t * \\brief Mutex's constructor\n\t *\n\t * Similar to std::mutex::mutex() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/mutex\n\t * Similar to pthread_mutex_init() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_init.html\n\t *\n\t * \\param [in] type is the type of mutex, default - Type::normal\n\t * \\param [in] protocol is the mutex protocol, default - Protocol::none\n\t * \\param [in] priorityCeiling is the priority ceiling of mutex, ignored when protocol != Protocol::priorityProtect,\n\t * default - 0\n\t *\/\n\n\tconstexpr explicit Mutex(const Type type = Type::normal, const Protocol protocol = Protocol::none,\n\t\t\tconst uint8_t priorityCeiling = {}) :\n\t\t\t\t\tMutexControlBlock{type, protocol, priorityCeiling}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief Mutex's constructor, overload for \"normal\" type\n\t *\n\t * Similar to std::mutex::mutex() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/mutex\n\t * Similar to pthread_mutex_init() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_init.html\n\t *\n\t * \\param [in] protocol is the mutex protocol\n\t * \\param [in] priorityCeiling is the priority ceiling of mutex, ignored when protocol != Protocol::priorityProtect,\n\t * default - 0\n\t *\/\n\n\tconstexpr explicit Mutex(const Protocol protocol, const uint8_t priorityCeiling = {}) :\n\t\t\tMutex{Type::normal, protocol, priorityCeiling}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief Mutex's destructor\n\t *\n\t * Similar to std::mutex::~mutex() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/~mutex\n\t * Similar to pthread_mutex_destroy() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_destroy.html\n\t *\n\t * It shall be safe to destroy an initialized mutex that is unlocked. Attempting to destroy a locked mutex, or a\n\t * mutex that another thread is attempting to lock, or a mutex that is currently being used by a condition variable\n\t * in another thread, results in undefined behavior.\n\t *\/\n\n\t~Mutex() = default;\n\n\t\/**\n\t * \\brief Locks the mutex.\n\t *\n\t * Similar to std::mutex::lock() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/lock\n\t * Similar to pthread_mutex_lock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_lock.html#\n\t *\n\t * If the mutex is already locked by another thread, the calling thread shall block until the mutex becomes\n\t * available. This function shall return with the mutex in the locked state with the calling thread as its owner. If\n\t * a thread attempts to relock a mutex that it has already locked, deadlock occurs.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t *\/\n\n\tint lock();\n\n\t\/**\n\t * \\brief Tries to lock the mutex.\n\t *\n\t * Similar to std::mutex::try_lock() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/try_lock\n\t * Similar to pthread_mutex_trylock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_lock.html#\n\t *\n\t * This function shall be equivalent to lock(), except that if the mutex is currently locked (by any thread,\n\t * including the current thread), the call shall return immediately.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EBUSY - the mutex could not be acquired because it was already locked;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t *\/\n\n\tint tryLock();\n\n\t\/**\n\t * \\brief Tries to lock the mutex for given duration of time.\n\t *\n\t * Similar to std::timed_mutex::try_lock_for() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/timed_mutex\/try_lock_for\n\t * Similar to pthread_mutex_timedlock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_timedlock.html#\n\t *\n\t * If the mutex is already locked, the calling thread shall block until the mutex becomes available as in lock()\n\t * function. If the mutex cannot be locked without waiting for another thread to unlock the mutex, this wait shall\n\t * be terminated when the specified timeout expires.\n\t *\n\t * Under no circumstance shall the function fail with a timeout if the mutex can be locked immediately. The validity\n\t * of the duration parameter need not be checked if the mutex can be locked immediately.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\param [in] duration is the duration after which the wait will be terminated without locking the mutex\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t * - ETIMEDOUT - the mutex could not be locked before the specified timeout expired;\n\t *\/\n\n\tint tryLockFor(TickClock::duration duration);\n\n\t\/**\n\t * Tries to lock the mutex for given duration of time.\n\t *\n\t * Template variant of tryLockFor(TickClock::duration duration).\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\tparam Rep is type of tick counter\n\t * \\tparam Period is std::ratio type representing the tick period of the clock, seconds\n\t *\n\t * \\param [in] duration is the duration after which the wait will be terminated without locking the mutex\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t * - ETIMEDOUT - the mutex could not be locked before the specified timeout expired;\n\t *\/\n\n\ttemplate<typename Rep, typename Period>\n\tint tryLockFor(const std::chrono::duration<Rep, Period> duration)\n\t{\n\t\treturn tryLockFor(std::chrono::duration_cast<TickClock::duration>(duration));\n\t}\n\n\t\/**\n\t * \\brief Tries to lock the mutex until given time point.\n\t *\n\t * Similar to std::timed_mutex::try_lock_until() -\n\t * http:\/\/en.cppreference.com\/w\/cpp\/thread\/timed_mutex\/try_lock_until\n\t * Similar to pthread_mutex_timedlock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_timedlock.html#\n\t *\n\t * If the mutex is already locked, the calling thread shall block until the mutex becomes available as in lock()\n\t * function. If the mutex cannot be locked without waiting for another thread to unlock the mutex, this wait shall\n\t * be terminated when the specified timeout expires.\n\t *\n\t * Under no circumstance shall the function fail with a timeout if the mutex can be locked immediately. The validity\n\t * of the timePoint parameter need not be checked if the mutex can be locked immediately.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\param [in] timePoint is the time point at which the wait will be terminated without locking the mutex\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t * - ETIMEDOUT - the mutex could not be locked before the specified timeout expired;\n\t *\/\n\n\tint tryLockUntil(TickClock::time_point timePoint);\n\n\t\/**\n\t * \\brief Tries to lock the mutex until given time point.\n\t *\n\t * Template variant of tryLockUntil(TickClock::time_point timePoint).\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\tparam Duration is a std::chrono::duration type used to measure duration\n\t *\n\t * \\param [in] timePoint is the time point at which the wait will be terminated without locking the mutex\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t * - ETIMEDOUT - the mutex could not be locked before the specified timeout expired;\n\t *\/\n\n\ttemplate<typename Duration>\n\tint tryLockUntil(const std::chrono::time_point<TickClock, Duration> timePoint)\n\t{\n\t\treturn tryLockUntil(std::chrono::time_point_cast<TickClock::duration>(timePoint));\n\t}\n\n\t\/**\n\t * \\brief Unlocks the mutex.\n\t *\n\t * Similar to std::mutex::unlock() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/unlock\n\t * Similar to pthread_mutex_unlock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_lock.html#\n\t *\n\t * The mutex must be locked by the current thread, otherwise, the behavior is undefined. If there are threads\n\t * blocked on this mutex, the highest priority waiting thread shall be unblocked, and if there is more than one\n\t * highest priority thread blocked waiting, then the highest priority thread that has been waiting the longest shall\n\t * be unblocked.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\return 0 if the caller successfully unlocked the mutex, error code otherwise:\n\t * - EPERM - the mutex type is errorChecking or recursive, and the current thread does not own the mutex;\n\t *\/\n\n\tint unlock();\n\n\tMutex(const Mutex&) = delete;\n\tMutex(Mutex&&) = default;\n\tconst Mutex& operator=(const Mutex&) = delete;\n\tMutex& operator=(Mutex&&) = delete;\n\nprivate:\n\n\t\/**\n\t * \\brief Internal version of tryLock().\n\t *\n\t * Internal version with no interrupt masking and additional code for errorChecking type (which is not required for\n\t * tryLock()).\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EBUSY - the mutex could not be acquired because it was already locked;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t *\/\n\n\tint tryLockInternal();\n};\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_MUTEX_HPP_\n<commit_msg>Minor comment fix in Mutex.hpp<commit_after>\/**\n * \\file\n * \\brief Mutex class header\n *\n * \\author Copyright (C) 2014-2019 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#ifndef INCLUDE_DISTORTOS_MUTEX_HPP_\n#define INCLUDE_DISTORTOS_MUTEX_HPP_\n\n#include \"distortos\/internal\/synchronization\/MutexControlBlock.hpp\"\n\nnamespace distortos\n{\n\n\/**\n * \\brief Mutex is the basic synchronization primitive\n *\n * Similar to std::mutex - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\n * Similar to POSIX pthread_mutex_t -\n * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/V2_chap02.html#tag_15_09 -> 2.9.3 Thread Mutexes\n *\n * \\ingroup synchronization\n *\/\n\nclass Mutex : private internal::MutexControlBlock\n{\npublic:\n\n\t\/\/\/ mutex protocols\n\tusing Protocol = MutexProtocol;\n\n\t\/\/\/ type used for counting recursive locks\n\tusing RecursiveLocksCount = MutexControlBlock::RecursiveLocksCount;\n\n\t\/\/\/ type of mutex\n\tusing Type = MutexType;\n\n\t\/**\n\t * \\brief Gets the maximum number of recursive locks possible before returning EAGAIN\n\t *\n\t * \\note Actual number of lock() operations possible is getMaxRecursiveLocks() + 1.\n\t *\n\t * \\return maximum number of recursive locks possible before returning EAGAIN\n\t *\/\n\n\tconstexpr static RecursiveLocksCount getMaxRecursiveLocks()\n\t{\n\t\treturn std::numeric_limits<RecursiveLocksCount>::max();\n\t}\n\n\t\/**\n\t * \\brief Mutex's constructor\n\t *\n\t * Similar to std::mutex::mutex() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/mutex\n\t * Similar to pthread_mutex_init() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_init.html\n\t *\n\t * \\param [in] type is the type of mutex, default - Type::normal\n\t * \\param [in] protocol is the mutex protocol, default - Protocol::none\n\t * \\param [in] priorityCeiling is the priority ceiling of mutex, ignored when protocol != Protocol::priorityProtect,\n\t * default - 0\n\t *\/\n\n\tconstexpr explicit Mutex(const Type type = Type::normal, const Protocol protocol = Protocol::none,\n\t\t\tconst uint8_t priorityCeiling = {}) :\n\t\t\t\t\tMutexControlBlock{type, protocol, priorityCeiling}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief Mutex's constructor, overload for \"normal\" type\n\t *\n\t * Similar to std::mutex::mutex() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/mutex\n\t * Similar to pthread_mutex_init() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_init.html\n\t *\n\t * \\param [in] protocol is the mutex protocol\n\t * \\param [in] priorityCeiling is the priority ceiling of mutex, ignored when protocol != Protocol::priorityProtect,\n\t * default - 0\n\t *\/\n\n\tconstexpr explicit Mutex(const Protocol protocol, const uint8_t priorityCeiling = {}) :\n\t\t\tMutex{Type::normal, protocol, priorityCeiling}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief Mutex's destructor\n\t *\n\t * Similar to std::mutex::~mutex() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/~mutex\n\t * Similar to pthread_mutex_destroy() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_destroy.html\n\t *\n\t * It shall be safe to destroy an initialized mutex that is unlocked. Attempting to destroy a locked mutex, or a\n\t * mutex that another thread is attempting to lock, or a mutex that is currently being used by a condition variable\n\t * in another thread, results in undefined behavior.\n\t *\/\n\n\t~Mutex() = default;\n\n\t\/**\n\t * \\brief Locks the mutex.\n\t *\n\t * Similar to std::mutex::lock() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/lock\n\t * Similar to pthread_mutex_lock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_lock.html#\n\t *\n\t * If the mutex is already locked by another thread, the calling thread shall block until the mutex becomes\n\t * available. This function shall return with the mutex in the locked state with the calling thread as its owner. If\n\t * a thread attempts to relock a mutex that it has already locked, deadlock occurs.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t *\/\n\n\tint lock();\n\n\t\/**\n\t * \\brief Tries to lock the mutex.\n\t *\n\t * Similar to std::mutex::try_lock() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/try_lock\n\t * Similar to pthread_mutex_trylock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_lock.html#\n\t *\n\t * This function shall be equivalent to lock(), except that if the mutex is currently locked (by any thread,\n\t * including the current thread), the call shall return immediately.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EBUSY - the mutex could not be acquired because it was already locked;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t *\/\n\n\tint tryLock();\n\n\t\/**\n\t * \\brief Tries to lock the mutex for given duration of time.\n\t *\n\t * Similar to std::timed_mutex::try_lock_for() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/timed_mutex\/try_lock_for\n\t * Similar to pthread_mutex_timedlock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_timedlock.html#\n\t *\n\t * If the mutex is already locked, the calling thread shall block until the mutex becomes available as in lock()\n\t * function. If the mutex cannot be locked without waiting for another thread to unlock the mutex, this wait shall\n\t * be terminated when the specified timeout expires.\n\t *\n\t * Under no circumstance shall the function fail with a timeout if the mutex can be locked immediately. The validity\n\t * of the duration parameter need not be checked if the mutex can be locked immediately.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\param [in] duration is the duration after which the wait will be terminated without locking the mutex\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t * - ETIMEDOUT - the mutex could not be locked before the specified timeout expired;\n\t *\/\n\n\tint tryLockFor(TickClock::duration duration);\n\n\t\/**\n\t * \\brief Tries to lock the mutex for given duration of time.\n\t *\n\t * Template variant of tryLockFor(TickClock::duration duration).\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\tparam Rep is type of tick counter\n\t * \\tparam Period is std::ratio type representing the tick period of the clock, seconds\n\t *\n\t * \\param [in] duration is the duration after which the wait will be terminated without locking the mutex\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t * - ETIMEDOUT - the mutex could not be locked before the specified timeout expired;\n\t *\/\n\n\ttemplate<typename Rep, typename Period>\n\tint tryLockFor(const std::chrono::duration<Rep, Period> duration)\n\t{\n\t\treturn tryLockFor(std::chrono::duration_cast<TickClock::duration>(duration));\n\t}\n\n\t\/**\n\t * \\brief Tries to lock the mutex until given time point.\n\t *\n\t * Similar to std::timed_mutex::try_lock_until() -\n\t * http:\/\/en.cppreference.com\/w\/cpp\/thread\/timed_mutex\/try_lock_until\n\t * Similar to pthread_mutex_timedlock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_timedlock.html#\n\t *\n\t * If the mutex is already locked, the calling thread shall block until the mutex becomes available as in lock()\n\t * function. If the mutex cannot be locked without waiting for another thread to unlock the mutex, this wait shall\n\t * be terminated when the specified timeout expires.\n\t *\n\t * Under no circumstance shall the function fail with a timeout if the mutex can be locked immediately. The validity\n\t * of the timePoint parameter need not be checked if the mutex can be locked immediately.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\param [in] timePoint is the time point at which the wait will be terminated without locking the mutex\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t * - ETIMEDOUT - the mutex could not be locked before the specified timeout expired;\n\t *\/\n\n\tint tryLockUntil(TickClock::time_point timePoint);\n\n\t\/**\n\t * \\brief Tries to lock the mutex until given time point.\n\t *\n\t * Template variant of tryLockUntil(TickClock::time_point timePoint).\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\tparam Duration is a std::chrono::duration type used to measure duration\n\t *\n\t * \\param [in] timePoint is the time point at which the wait will be terminated without locking the mutex\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t * - ETIMEDOUT - the mutex could not be locked before the specified timeout expired;\n\t *\/\n\n\ttemplate<typename Duration>\n\tint tryLockUntil(const std::chrono::time_point<TickClock, Duration> timePoint)\n\t{\n\t\treturn tryLockUntil(std::chrono::time_point_cast<TickClock::duration>(timePoint));\n\t}\n\n\t\/**\n\t * \\brief Unlocks the mutex.\n\t *\n\t * Similar to std::mutex::unlock() - http:\/\/en.cppreference.com\/w\/cpp\/thread\/mutex\/unlock\n\t * Similar to pthread_mutex_unlock() -\n\t * http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_mutex_lock.html#\n\t *\n\t * The mutex must be locked by the current thread, otherwise, the behavior is undefined. If there are threads\n\t * blocked on this mutex, the highest priority waiting thread shall be unblocked, and if there is more than one\n\t * highest priority thread blocked waiting, then the highest priority thread that has been waiting the longest shall\n\t * be unblocked.\n\t *\n\t * \\warning This function must not be called from interrupt context!\n\t *\n\t * \\return 0 if the caller successfully unlocked the mutex, error code otherwise:\n\t * - EPERM - the mutex type is errorChecking or recursive, and the current thread does not own the mutex;\n\t *\/\n\n\tint unlock();\n\n\tMutex(const Mutex&) = delete;\n\tMutex(Mutex&&) = default;\n\tconst Mutex& operator=(const Mutex&) = delete;\n\tMutex& operator=(Mutex&&) = delete;\n\nprivate:\n\n\t\/**\n\t * \\brief Internal version of tryLock().\n\t *\n\t * Internal version with no interrupt masking and additional code for errorChecking type (which is not required for\n\t * tryLock()).\n\t *\n\t * \\return 0 if the caller successfully locked the mutex, error code otherwise:\n\t * - EAGAIN - the mutex could not be acquired because the maximum number of recursive locks for mutex has been\n\t * exceeded;\n\t * - EBUSY - the mutex could not be acquired because it was already locked;\n\t * - EDEADLK - the mutex type is errorChecking and the current thread already owns the mutex;\n\t * - EINVAL - the mutex was created with the protocol attribute having the value priorityProtect and the calling\n\t * thread's priority is higher than the mutex's current priority ceiling;\n\t *\/\n\n\tint tryLockInternal();\n};\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_MUTEX_HPP_\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#ifndef __BH_JITK_STATISTICS_H\n#define __BH_JITK_STATISTICS_H\n\n#include <chrono>\n#include <string>\n#include <ostream>\n#include <sstream>\n\nnamespace bohrium {\nnamespace jitk {\n\nnamespace {\n\/\/ Pretty print the ratio: 'a\/b'\nstd::string pprint_ratio(uint64_t a, uint64_t b) {\n    std::stringstream ss;\n    ss << a << \"\/\" << b << \" (\" << 100.0 * a \/ b << \"%)\";\n    return ss.str();\n}\n}\n\n\/* BaseDB is a database over base arrays. The main feature is getBases(),\n * which always returns the bases in the order they where inserted.\n *\/\nclass Statistics {\n  public:\n    uint64_t num_base_arrays=0;\n    uint64_t num_temp_arrays=0;\n    uint64_t max_memory_usage=0;\n    uint64_t totalwork=0;\n    uint64_t threading_below_threshold=0;\n    uint64_t kernel_cache_lookups=0;\n    uint64_t kernel_cache_misses=0;\n    uint64_t fuser_cache_lookups=0;\n    uint64_t fuser_cache_misses=0;\n    std::chrono::duration<double> time_total_execution{0};\n    std::chrono::duration<double> time_fusion{0};\n    std::chrono::duration<double> time_exec{0};\n    std::chrono::duration<double> time_build{0};\n    std::chrono::duration<double> time_offload{0};\n    std::chrono::time_point<std::chrono::steady_clock> time_started{std::chrono::steady_clock::now()};\n\n    void pprint(std::string backend_name, std::ostream &out) {\n        using namespace std;\n        const chrono::duration<double> wallclock{chrono::steady_clock::now() - time_started};\n\n        out << \"[\" << backend_name << \"] Profiling: \\n\";\n        out << \"\\tFuse Cache Hits:     \" << pprint_ratio(fuser_cache_lookups - fuser_cache_misses, fuser_cache_lookups) << \"\\n\";\n        out << \"\\tKernel Cache Hits    \" << pprint_ratio(kernel_cache_lookups - kernel_cache_misses, kernel_cache_lookups) << \"\\n\";\n        out << \"\\tArray contractions:  \" << pprint_ratio(num_temp_arrays, num_base_arrays) << \"\\n\";\n        out << \"\\tMaximum Memory Usage: \" << max_memory_usage \/ 1024 \/ 1024 << \" MB\\n\";\n        out << \"\\tTotal Work: \" << (double) totalwork << \" operations\\n\";\n        out << \"\\tWork below par-threshold(1000): \" << threading_below_threshold \/ (double)totalwork * 100 << \"%\\n\";\n        out << \"\\tWall clock:  \" << wallclock.count() << \"s\\n\";\n        out << \"\\tFLOPS:  \" << totalwork \/ (double)wallclock.count() << \"s\\n\";\n        out << \"\\tTotal Execution:  \" << time_total_execution.count() << \"s\\n\";\n        out << \"\\t  Fusion:  \" << time_fusion.count() << \"s\\n\";\n        out << \"\\t  Build:   \" << time_build.count() << \"s\\n\";\n        out << \"\\t  Exec:    \" << time_exec.count() << \"s\\n\";\n        out << \"\\t  Offload: \" << time_offload.count() << \"s\\n\";\n        out << endl;\n    }\n\n};\n\n\n} \/\/ jitk\n} \/\/ bohrium\n\n#endif\n<commit_msg>statistics: cleanup<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#ifndef __BH_JITK_STATISTICS_H\n#define __BH_JITK_STATISTICS_H\n\n#include <chrono>\n#include <string>\n#include <ostream>\n#include <sstream>\n\nnamespace bohrium {\nnamespace jitk {\n\nnamespace {\n\/\/ Pretty print the ratio: 'a\/b'\nstd::string pprint_ratio(uint64_t a, uint64_t b) {\n    std::stringstream ss;\n    ss << a << \"\/\" << b << \" (\" << 100.0 * a \/ b << \"%)\";\n    return ss.str();\n}\n}\n\n\/* BaseDB is a database over base arrays. The main feature is getBases(),\n * which always returns the bases in the order they where inserted.\n *\/\nclass Statistics {\n  public:\n    uint64_t num_base_arrays=0;\n    uint64_t num_temp_arrays=0;\n    uint64_t max_memory_usage=0;\n    uint64_t totalwork=0;\n    uint64_t threading_below_threshold=0;\n    uint64_t kernel_cache_lookups=0;\n    uint64_t kernel_cache_misses=0;\n    uint64_t fuser_cache_lookups=0;\n    uint64_t fuser_cache_misses=0;\n    std::chrono::duration<double> time_total_execution{0};\n    std::chrono::duration<double> time_fusion{0};\n    std::chrono::duration<double> time_exec{0};\n    std::chrono::duration<double> time_build{0};\n    std::chrono::duration<double> time_offload{0};\n    std::chrono::time_point<std::chrono::steady_clock> time_started{std::chrono::steady_clock::now()};\n\n    \/\/ Pretty print the recorded statistics into 'out' where 'backend_name' is the name of the caller\n    void pprint(std::string backend_name, std::ostream &out) {\n        using namespace std;\n        const chrono::duration<double> wallclock{chrono::steady_clock::now() - time_started};\n\n        out << \"[\" << backend_name << \"] Profiling: \\n\";\n        out << \"\\tFuse Cache Hits:     \" << pprint_ratio(fuser_cache_lookups - fuser_cache_misses, fuser_cache_lookups) << \"\\n\";\n        out << \"\\tKernel Cache Hits    \" << pprint_ratio(kernel_cache_lookups - kernel_cache_misses, kernel_cache_lookups) << \"\\n\";\n        out << \"\\tArray contractions:  \" << pprint_ratio(num_temp_arrays, num_base_arrays) << \"\\n\";\n        out << \"\\tMaximum Memory Usage: \" << max_memory_usage \/ 1024 \/ 1024 << \" MB\\n\";\n        out << \"\\tTotal Work: \" << (double) totalwork << \" operations\\n\";\n        out << \"\\tWork below par-threshold(1000): \" << threading_below_threshold \/ (double)totalwork * 100 << \"%\\n\";\n        out << \"\\tWall clock:  \" << wallclock.count() << \"s\\n\";\n        out << \"\\tThroughput:  \" << totalwork \/ (double)wallclock.count() << \"AOPS\\n\";\n        out << \"\\tTotal Execution:  \" << time_total_execution.count() << \"s\\n\";\n        out << \"\\t  Fusion:  \" << time_fusion.count() << \"s\\n\";\n        out << \"\\t  Build:   \" << time_build.count() << \"s\\n\";\n        out << \"\\t  Exec:    \" << time_exec.count() << \"s\\n\";\n        out << \"\\t  Offload: \" << time_offload.count() << \"s\\n\";\n        out << endl;\n    }\n};\n\n\n} \/\/ jitk\n} \/\/ bohrium\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef KGR_KANGARU_INCLUDE_KANGARU_TYPE_ID_HPP\n#define KGR_KANGARU_INCLUDE_KANGARU_TYPE_ID_HPP\n\n#include <cstdint>\n\nnamespace kgr {\nnamespace detail {\n\ntemplate<typename>\nstruct index_storage;\n\nstruct override_storage_service;\n\ntemplate<typename>\nstruct is_index_storage : std::false_type {};\n\ntemplate<typename T>\nstruct is_index_storage<index_storage<T>> : std::true_type {};\n\nstruct type_id_data {\n\tenum struct kind_t : std::uint8_t { normal, override_storage, index_storage } kind;\n\t\n\ttemplate<typename T>\n\tstatic constexpr auto kind_for() noexcept -> type_id_data {\n\t\treturn type_id_data{\n\t\t\tstd::is_same<T, override_storage_service>::value\n\t\t\t? kind_t::override_storage\n\t\t\t: is_index_storage<T>::value ? kind_t::index_storage : kind_t::normal\n\t\t};\n\t}\n};\n\n\/*\n * Template class that hold the declaration of the id.\n * \n * We use the pointer of this id as type id.\n *\/\ntemplate<typename T>\nstruct type_id_ptr {\n\tstruct id_t {\n\t\ttype_id_data data;\n\t};\n\n\t\/\/ Having a static data member will ensure us that it has only one address for the whole program.\n\t\/\/ Furthermore, the static data member having different types will ensure it won't get optimized.\n\tstatic constexpr id_t id = id_t{type_id_data::kind_for<T>()};\n};\n\n\/*\n * Definition of the id.\n * \n * Before that, we used the pointer to a function as type_id.\n * \n * However, on some platform, the rule that a pointer to a function\n * always yeild to the same value, no matter the dll or TU was not always respected.\n * \n * Using the pointer of a static data member is more stable.\n *\/\ntemplate<typename T>\nconstexpr typename type_id_ptr<T>::id_t const type_id_ptr<T>::id;\n\ninline constexpr auto type_id_kind(void const* id) -> type_id_data::kind_t {\n\treturn static_cast<type_id_data const*>(id)->kind;\n}\n\n} \/\/ namespace detail\n\n\/*\n * The type of a type id.\n *\/\nusing type_id_t = void const*;\n\n\/*\n * The function that returns the type id.\n * \n * It uses the pointer to the static data member of a class template to achieve this.\n * Altough the value is not predictible, it's stable.\n *\/\ntemplate <typename T>\nconstexpr auto type_id() -> type_id_t {\n\treturn &detail::type_id_ptr<T>::id;\n}\n\n} \/\/ namespace kgr\n\n#endif \/\/ KGR_KANGARU_INCLUDE_KANGARU_TYPE_ID_HPP\n<commit_msg>Added missing include<commit_after>#ifndef KGR_KANGARU_INCLUDE_KANGARU_TYPE_ID_HPP\n#define KGR_KANGARU_INCLUDE_KANGARU_TYPE_ID_HPP\n\n#include <cstdint>\n#include <type_traits>\n\nnamespace kgr {\nnamespace detail {\n\ntemplate<typename>\nstruct index_storage;\n\nstruct override_storage_service;\n\ntemplate<typename>\nstruct is_index_storage : std::false_type {};\n\ntemplate<typename T>\nstruct is_index_storage<index_storage<T>> : std::true_type {};\n\nstruct type_id_data {\n\tenum struct kind_t : std::uint8_t { normal, override_storage, index_storage } kind;\n\t\n\ttemplate<typename T>\n\tstatic constexpr auto kind_for() noexcept -> type_id_data {\n\t\treturn type_id_data{\n\t\t\tstd::is_same<T, override_storage_service>::value\n\t\t\t? kind_t::override_storage\n\t\t\t: is_index_storage<T>::value ? kind_t::index_storage : kind_t::normal\n\t\t};\n\t}\n};\n\n\/*\n * Template class that hold the declaration of the id.\n * \n * We use the pointer of this id as type id.\n *\/\ntemplate<typename T>\nstruct type_id_ptr {\n\tstruct id_t {\n\t\ttype_id_data data;\n\t};\n\n\t\/\/ Having a static data member will ensure us that it has only one address for the whole program.\n\t\/\/ Furthermore, the static data member having different types will ensure it won't get optimized.\n\tstatic constexpr id_t id = id_t{type_id_data::kind_for<T>()};\n};\n\n\/*\n * Definition of the id.\n * \n * Before that, we used the pointer to a function as type_id.\n * \n * However, on some platform, the rule that a pointer to a function\n * always yeild to the same value, no matter the dll or TU was not always respected.\n * \n * Using the pointer of a static data member is more stable.\n *\/\ntemplate<typename T>\nconstexpr typename type_id_ptr<T>::id_t const type_id_ptr<T>::id;\n\ninline constexpr auto type_id_kind(void const* id) -> type_id_data::kind_t {\n\treturn static_cast<type_id_data const*>(id)->kind;\n}\n\n} \/\/ namespace detail\n\n\/*\n * The type of a type id.\n *\/\nusing type_id_t = void const*;\n\n\/*\n * The function that returns the type id.\n * \n * It uses the pointer to the static data member of a class template to achieve this.\n * Altough the value is not predictible, it's stable.\n *\/\ntemplate <typename T>\nconstexpr auto type_id() -> type_id_t {\n\treturn &detail::type_id_ptr<T>::id;\n}\n\n} \/\/ namespace kgr\n\n#endif \/\/ KGR_KANGARU_INCLUDE_KANGARU_TYPE_ID_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) Andrey Pikas\n *\/\n\n#pragma once\n\n#include <memory>\n\n#include <uv.h>\n\n#include <pruv\/list_node.hpp>\n#include <pruv\/process.hpp>\n#include <pruv\/shmem_buffer.hpp>\n#include <pruv\/tcp_con.hpp>\n\nnamespace pruv {\n\nclass dispatcher {\npublic:\n    virtual ~dispatcher();\n    \/\/\/ new_loop, worker_name and worker_args must be valid until stop called.\n    void start(uv_loop_t *new_loop, const char *ip, int port,\n            size_t workers_max, const char *worker_name,\n            const char * const *worker_args) noexcept;\n    void stop() noexcept;\n    \/\/\/ Stop timer.\n    void on_loop_exit() noexcept;\n\nprivate:\n    struct shmem_buffer_node : shmem_buffer, list_node<shmem_buffer_node> {};\n\n    struct worker_process;\n\nprotected:\n    \/\/\/ Buffered tcp connection\n    class tcp_context : private tcp_con, list_node<tcp_context> {\n    protected:\n        \/\/\/ Called before reading new message.\n        \/\/\/ If returns false, connection will be closed.\n        \/\/\/ It can be used for moving to the begin of buffer those part of\n        \/\/\/ message which will be readed with previous message at the same\n        \/\/\/ time (when pipelining used).\n        \/\/\/ It can be used to pass to the worker some headers from\n        \/\/\/ PROXY-protocol for every message, not only at connection start.\n        virtual bool prepare_for_request(shmem_buffer *) noexcept = 0;\n        \/\/\/ Called after reading len bytes into buffer at position s.\n        \/\/\/ If returns false, connection will be closed.\n        virtual bool parse_request(shmem_buffer *buf, size_t len)\n            noexcept = 0;\n        \/\/\/ Called after request parsing.\n        \/\/\/ When this returns non zero length, message of this size will be\n        \/\/\/ passed to the worker and reading from socket will be stopped until\n        \/\/\/ worker finished.\n        virtual size_t request_size() const noexcept = 0;\n        \/\/\/ Returns protocol name for passing to worker.\n        virtual const char * request_protocol() const noexcept = 0;\n        \/\/\/ Called before starting new response message, received from worker.\n        \/\/\/ If returns false, connection will be closed.\n        virtual bool prepare_for_response() noexcept = 0;\n        \/\/\/ Called before sending data currently mapped in the buf.\n        \/\/\/ If returns false, connection will be closed.\n        virtual bool parse_response(shmem_buffer *buf) noexcept = 0;\n        \/\/\/ Called after writing last response chunk.\n        \/\/\/ If returns false, connection will be closed.\n        virtual bool finish_response() noexcept = 0;\n\n    private:\n        friend dispatcher;\n        friend list_node;\n        \/\/\/ Remove connection from any dispatcher's list.\n        \/\/\/ Return used buffers into dispatcher.\n        \/\/\/ Break reference from worker to this connection.\n        void remove_from_dispatcher() noexcept;\n\n        \/\/\/ Buffer for reading last request.\n        shmem_buffer_node *read_buffer = nullptr;\n        \/\/\/ Buffers with responses.\n        list_node<shmem_buffer_node> resp_buffers;\n        \/\/\/ Worker processing last request. On EOF there is no need to stop it,\n        \/\/\/ but its result must be ignored. Stored in connection to break\n        \/\/\/ reference worker->processed_con on EOF received.\n        worker_process *worker = nullptr;\n        uv_write_t write_req;\n        uint64_t timeout;\n        \/\/\/ Number of elements in resp_buffers list.\n        unsigned resp_buffers_num = 0;\n        enum list_id_enum {\n            LIST_IDLE,\n            LIST_READING,\n            LIST_SCHEDULING,\n            LIST_PROCESSING,\n            LIST_WRITING\n        } list_id;\n    };\n\n    \/\/\/ Allocate connection structure.\n    virtual tcp_context * create_connection() noexcept = 0;\n    \/\/\/ Destruct and free connection structure.\n    virtual void free_connection(tcp_context *con) noexcept = 0;\n\nprivate:\n    struct worker_process : public process, list_node<worker_process> {\n        \/\/\/ Connection, which request this worker process now.\n        \/\/\/ On exit connection must be closed.\n        tcp_context *processed_con = nullptr;\n\n        \/\/\/ Buffers with request and response.\n        \/\/\/ When connection closed, but worker still process request, buffers\n        \/\/\/ can't be reused. Therefore buffers owned by worker for processing\n        \/\/\/ time.\n        shmem_buffer_node *in_buf = nullptr;\n        shmem_buffer_node *out_buf = nullptr;\n\n        \/\/\/ io_state used to protect single pipe_buf.\n        \/\/\/ Buffer can be used for reading when IO_READ,\n        \/\/\/ for writing when IO_WRITE, and can't be used when IO_IDLE.\n        \/\/\/ Also it allows not stop polling pipe when worker has no work.\n        enum io_state_type {\n            IO_IDLE,\n            IO_READ,\n            IO_WRITE\n        };\n        io_state_type io_state = IO_IDLE;\n        \/\/\/ Time when current operation must be finished.\n        uint64_t timeout;\n\n        \/\/\/ Buffer for request to worker and for response from it.\n        char pipe_buf[256];\n        \/\/\/ Pointer inside to pipe_buf for reading response by chunks.\n        char *pipe_buf_ptr = pipe_buf;\n        \/\/\/ Request for writing task into worker's pipe.\n        uv_write_t write_req;\n    };\n\n    bool start_server(const char *ip, int port) noexcept;\n    void on_connection(uv_stream_t *server, int status) noexcept;\n    void stop_server() noexcept;\n\n    \/\/\/ Close connections and release its resources.\n    void close_connections(list_node<tcp_context> &list) noexcept;\n\n    \/\/\/ Take one request and one worker and send request into worker.\n    void schedule() noexcept;\n\n    \/\/\/ Spawn worker process and put it into free_workers list.\n    void spawn_worker() noexcept;\n    \/\/\/ Kill worker and stop reading it's pipe. Worker must be in some list.\n    void kill_worker(worker_process *w) noexcept;\n\n    void on_worker_exit(worker_process *w, int64_t exit_code, int signal)\n        noexcept;\n    void on_worker_read(worker_process *w, ssize_t nread, const uv_buf_t *buf)\n        noexcept;\n\n    \/\/\/ Take buffer from cache or create new. Puts buffer into in_use_bufs.\n    shmem_buffer_node * get_buffer(bool for_request) noexcept;\n\n    \/\/\/ Return buffer into cache. Remove buffer from in_use_bufs.\n    void return_buffer(shmem_buffer_node *buf, bool for_request) noexcept;\n\n    \/\/\/ Close shared memory objects and free memory.\n    \/\/\/ Must be called only when there is no references to any buffer\n    \/\/\/ in the buf_list.\n    void close_buffers(list_node<shmem_buffer_node> &buf_list) noexcept;\n\n    \/\/\/ Start reading connection in loop.\n    bool read_connection(tcp_context *con) noexcept;\n    \/\/\/ Prepare buffer for reading data from connection.\n    void read_con_alloc_cb(tcp_context *con, size_t suggested_size,\n            uv_buf_t *buf) noexcept;\n    \/\/\/ Process data readed from connection.\n    void read_con_cb(tcp_context *con, ssize_t nread, const uv_buf_t *buf)\n        noexcept;\n    \/\/\/ Write data from con->resp_buffers to connection by chunks.\n    void write_con(tcp_context *con) noexcept;\n    \/\/\/ Called after writing last chunk of response to connection.\n    \/\/\/ Prepares connection for reading next request.\n    void on_end_write_con(tcp_context *con) noexcept;\n    \/\/\/ Remove connection from current list and push_back to specified.\n    \/\/\/ Update connection timeout.\n    void move_to(tcp_context::list_id_enum dst, tcp_context *con) noexcept;\n\n    bool start_timer() noexcept;\n    void close_timer() noexcept;\n    void on_timer_tick() noexcept;\n    void close_old_connections(list_node<tcp_context> &list) noexcept;\n\n\n    static constexpr unsigned IDLE_TIMEOUT = 30'000;\n    static constexpr unsigned READ_TIMEOUT = 10'000;\n    static constexpr unsigned WRITE_TIMEOUT = 15'000;\n    static constexpr unsigned PROCESSING_TIMEOUT = 10'000;\n    static constexpr unsigned KILL_TIMEOUT = 10'000;\n    static constexpr unsigned TIMER_PERIOD = 5'000;\n    static constexpr unsigned RESPONSES_MAXDEPTH = 10;\n\n    uv_loop_t *loop = nullptr;\n    const char *worker_name = nullptr;\n    const char * const *worker_args = nullptr;\n    size_t workers_cnt = 0;\n    size_t workers_max = 0;\n\n    uv_tcp_t tcp_server;\n    uv_timer_t timer;\n\n    \/\/\/ Connections in this list are inactive.\n    list_node<tcp_context> clients_idle;\n    \/\/\/ Connections in this list are readed.\n    list_node<tcp_context> clients_reading;\n    \/\/\/ Connections with fully read request without worker.\n    \/\/\/ Reading stopped for this connections.\n    list_node<tcp_context> clients_scheduling;\n    \/\/\/ Connections waits response from worker.\n    \/\/\/ Reading stopped for this connections.\n    list_node<tcp_context> clients_processing;\n    \/\/\/ Connections with partially writed response.\n    \/\/\/ If connection readed and writed at the same time, it's in this list,\n    \/\/\/ because writing response is more important, then reading new request\n    \/\/\/ (because responses make buffers queue).\n    \/\/\/ Reading may be stopped (but may not).\n    list_node<tcp_context> clients_writing;\n\n    \/\/\/ Idle workers.\n    list_node<worker_process> free_workers;\n    \/\/\/ Workers serving some request now.\n    list_node<worker_process> in_use_workers;\n    \/\/\/ Workers to which SIGTERM signal is sent.\n    list_node<worker_process> terminated_workers;\n\n    \/\/\/ free buffers for reading request\n    list_node<shmem_buffer_node> req_bufs;\n    \/\/\/ free buffers for writing response\n    list_node<shmem_buffer_node> resp_bufs;\n    \/\/\/ non free buffers\n    list_node<shmem_buffer_node> in_use_bufs;\n};\n\n} \/\/ namespace pruv\n<commit_msg>Virtual destructor.<commit_after>\/*\n * Copyright (C) Andrey Pikas\n *\/\n\n#pragma once\n\n#include <memory>\n\n#include <uv.h>\n\n#include <pruv\/list_node.hpp>\n#include <pruv\/process.hpp>\n#include <pruv\/shmem_buffer.hpp>\n#include <pruv\/tcp_con.hpp>\n\nnamespace pruv {\n\nclass dispatcher {\npublic:\n    virtual ~dispatcher();\n    \/\/\/ new_loop, worker_name and worker_args must be valid until stop called.\n    void start(uv_loop_t *new_loop, const char *ip, int port,\n            size_t workers_max, const char *worker_name,\n            const char * const *worker_args) noexcept;\n    void stop() noexcept;\n    \/\/\/ Stop timer.\n    void on_loop_exit() noexcept;\n\nprivate:\n    struct shmem_buffer_node : shmem_buffer, list_node<shmem_buffer_node> {};\n\n    struct worker_process;\n\nprotected:\n    \/\/\/ Buffered tcp connection\n    class tcp_context : private tcp_con, list_node<tcp_context> {\n    public:\n        virtual ~tcp_context() {}\n    protected:\n        \/\/\/ Called before reading new message.\n        \/\/\/ If returns false, connection will be closed.\n        \/\/\/ It can be used for moving to the begin of buffer those part of\n        \/\/\/ message which will be readed with previous message at the same\n        \/\/\/ time (when pipelining used).\n        \/\/\/ It can be used to pass to the worker some headers from\n        \/\/\/ PROXY-protocol for every message, not only at connection start.\n        virtual bool prepare_for_request(shmem_buffer *) noexcept = 0;\n        \/\/\/ Called after reading len bytes into buffer at position s.\n        \/\/\/ If returns false, connection will be closed.\n        virtual bool parse_request(shmem_buffer *buf, size_t len)\n            noexcept = 0;\n        \/\/\/ Called after request parsing.\n        \/\/\/ When this returns non zero length, message of this size will be\n        \/\/\/ passed to the worker and reading from socket will be stopped until\n        \/\/\/ worker finished.\n        virtual size_t request_size() const noexcept = 0;\n        \/\/\/ Returns protocol name for passing to worker.\n        virtual const char * request_protocol() const noexcept = 0;\n        \/\/\/ Called before starting new response message, received from worker.\n        \/\/\/ If returns false, connection will be closed.\n        virtual bool prepare_for_response() noexcept = 0;\n        \/\/\/ Called before sending data currently mapped in the buf.\n        \/\/\/ If returns false, connection will be closed.\n        virtual bool parse_response(shmem_buffer *buf) noexcept = 0;\n        \/\/\/ Called after writing last response chunk.\n        \/\/\/ If returns false, connection will be closed.\n        virtual bool finish_response() noexcept = 0;\n\n    private:\n        friend dispatcher;\n        friend list_node;\n        \/\/\/ Remove connection from any dispatcher's list.\n        \/\/\/ Return used buffers into dispatcher.\n        \/\/\/ Break reference from worker to this connection.\n        void remove_from_dispatcher() noexcept;\n\n        \/\/\/ Buffer for reading last request.\n        shmem_buffer_node *read_buffer = nullptr;\n        \/\/\/ Buffers with responses.\n        list_node<shmem_buffer_node> resp_buffers;\n        \/\/\/ Worker processing last request. On EOF there is no need to stop it,\n        \/\/\/ but its result must be ignored. Stored in connection to break\n        \/\/\/ reference worker->processed_con on EOF received.\n        worker_process *worker = nullptr;\n        uv_write_t write_req;\n        uint64_t timeout;\n        \/\/\/ Number of elements in resp_buffers list.\n        unsigned resp_buffers_num = 0;\n        enum list_id_enum {\n            LIST_IDLE,\n            LIST_READING,\n            LIST_SCHEDULING,\n            LIST_PROCESSING,\n            LIST_WRITING\n        } list_id;\n    };\n\n    \/\/\/ Allocate connection structure.\n    virtual tcp_context * create_connection() noexcept = 0;\n    \/\/\/ Destruct and free connection structure.\n    virtual void free_connection(tcp_context *con) noexcept = 0;\n\nprivate:\n    struct worker_process : public process, list_node<worker_process> {\n        \/\/\/ Connection, which request this worker process now.\n        \/\/\/ On exit connection must be closed.\n        tcp_context *processed_con = nullptr;\n\n        \/\/\/ Buffers with request and response.\n        \/\/\/ When connection closed, but worker still process request, buffers\n        \/\/\/ can't be reused. Therefore buffers owned by worker for processing\n        \/\/\/ time.\n        shmem_buffer_node *in_buf = nullptr;\n        shmem_buffer_node *out_buf = nullptr;\n\n        \/\/\/ io_state used to protect single pipe_buf.\n        \/\/\/ Buffer can be used for reading when IO_READ,\n        \/\/\/ for writing when IO_WRITE, and can't be used when IO_IDLE.\n        \/\/\/ Also it allows not stop polling pipe when worker has no work.\n        enum io_state_type {\n            IO_IDLE,\n            IO_READ,\n            IO_WRITE\n        };\n        io_state_type io_state = IO_IDLE;\n        \/\/\/ Time when current operation must be finished.\n        uint64_t timeout;\n\n        \/\/\/ Buffer for request to worker and for response from it.\n        char pipe_buf[256];\n        \/\/\/ Pointer inside to pipe_buf for reading response by chunks.\n        char *pipe_buf_ptr = pipe_buf;\n        \/\/\/ Request for writing task into worker's pipe.\n        uv_write_t write_req;\n    };\n\n    bool start_server(const char *ip, int port) noexcept;\n    void on_connection(uv_stream_t *server, int status) noexcept;\n    void stop_server() noexcept;\n\n    \/\/\/ Close connections and release its resources.\n    void close_connections(list_node<tcp_context> &list) noexcept;\n\n    \/\/\/ Take one request and one worker and send request into worker.\n    void schedule() noexcept;\n\n    \/\/\/ Spawn worker process and put it into free_workers list.\n    void spawn_worker() noexcept;\n    \/\/\/ Kill worker and stop reading it's pipe. Worker must be in some list.\n    void kill_worker(worker_process *w) noexcept;\n\n    void on_worker_exit(worker_process *w, int64_t exit_code, int signal)\n        noexcept;\n    void on_worker_read(worker_process *w, ssize_t nread, const uv_buf_t *buf)\n        noexcept;\n\n    \/\/\/ Take buffer from cache or create new. Puts buffer into in_use_bufs.\n    shmem_buffer_node * get_buffer(bool for_request) noexcept;\n\n    \/\/\/ Return buffer into cache. Remove buffer from in_use_bufs.\n    void return_buffer(shmem_buffer_node *buf, bool for_request) noexcept;\n\n    \/\/\/ Close shared memory objects and free memory.\n    \/\/\/ Must be called only when there is no references to any buffer\n    \/\/\/ in the buf_list.\n    void close_buffers(list_node<shmem_buffer_node> &buf_list) noexcept;\n\n    \/\/\/ Start reading connection in loop.\n    bool read_connection(tcp_context *con) noexcept;\n    \/\/\/ Prepare buffer for reading data from connection.\n    void read_con_alloc_cb(tcp_context *con, size_t suggested_size,\n            uv_buf_t *buf) noexcept;\n    \/\/\/ Process data readed from connection.\n    void read_con_cb(tcp_context *con, ssize_t nread, const uv_buf_t *buf)\n        noexcept;\n    \/\/\/ Write data from con->resp_buffers to connection by chunks.\n    void write_con(tcp_context *con) noexcept;\n    \/\/\/ Called after writing last chunk of response to connection.\n    \/\/\/ Prepares connection for reading next request.\n    void on_end_write_con(tcp_context *con) noexcept;\n    \/\/\/ Remove connection from current list and push_back to specified.\n    \/\/\/ Update connection timeout.\n    void move_to(tcp_context::list_id_enum dst, tcp_context *con) noexcept;\n\n    bool start_timer() noexcept;\n    void close_timer() noexcept;\n    void on_timer_tick() noexcept;\n    void close_old_connections(list_node<tcp_context> &list) noexcept;\n\n\n    static constexpr unsigned IDLE_TIMEOUT = 30'000;\n    static constexpr unsigned READ_TIMEOUT = 10'000;\n    static constexpr unsigned WRITE_TIMEOUT = 15'000;\n    static constexpr unsigned PROCESSING_TIMEOUT = 10'000;\n    static constexpr unsigned KILL_TIMEOUT = 10'000;\n    static constexpr unsigned TIMER_PERIOD = 5'000;\n    static constexpr unsigned RESPONSES_MAXDEPTH = 10;\n\n    uv_loop_t *loop = nullptr;\n    const char *worker_name = nullptr;\n    const char * const *worker_args = nullptr;\n    size_t workers_cnt = 0;\n    size_t workers_max = 0;\n\n    uv_tcp_t tcp_server;\n    uv_timer_t timer;\n\n    \/\/\/ Connections in this list are inactive.\n    list_node<tcp_context> clients_idle;\n    \/\/\/ Connections in this list are readed.\n    list_node<tcp_context> clients_reading;\n    \/\/\/ Connections with fully read request without worker.\n    \/\/\/ Reading stopped for this connections.\n    list_node<tcp_context> clients_scheduling;\n    \/\/\/ Connections waits response from worker.\n    \/\/\/ Reading stopped for this connections.\n    list_node<tcp_context> clients_processing;\n    \/\/\/ Connections with partially writed response.\n    \/\/\/ If connection readed and writed at the same time, it's in this list,\n    \/\/\/ because writing response is more important, then reading new request\n    \/\/\/ (because responses make buffers queue).\n    \/\/\/ Reading may be stopped (but may not).\n    list_node<tcp_context> clients_writing;\n\n    \/\/\/ Idle workers.\n    list_node<worker_process> free_workers;\n    \/\/\/ Workers serving some request now.\n    list_node<worker_process> in_use_workers;\n    \/\/\/ Workers to which SIGTERM signal is sent.\n    list_node<worker_process> terminated_workers;\n\n    \/\/\/ free buffers for reading request\n    list_node<shmem_buffer_node> req_bufs;\n    \/\/\/ free buffers for writing response\n    list_node<shmem_buffer_node> resp_bufs;\n    \/\/\/ non free buffers\n    list_node<shmem_buffer_node> in_use_bufs;\n};\n\n} \/\/ namespace pruv\n<|endoftext|>"}
{"text":"<commit_before>\/** \n * @file llnamebox.cpp\n * @brief A text display widget\n *\n * $LicenseInfo:firstyear=2001&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#include \"llviewerprecompiledheaders.h\"\n\n#include \"llnamebox.h\"\n\n#include \"llerror.h\"\n#include \"llfontgl.h\"\n#include \"llui.h\"\n#include \"llviewercontrol.h\"\n#include \"lluuid.h\"\n\n#include \"llcachename.h\"\n\n\/\/ statics\nstd::set<LLNameBox*> LLNameBox::sInstances;\n\nstatic LLDefaultChildRegistry::Register<LLNameBox> r(\"name_box\");\n\n\nLLNameBox::LLNameBox(const Params& p)\n:\tLLTextBox(p)\n{\n\tmNameID = LLUUID::null;\n\tmLink = p.link;\n\tmInitialValue = p.initial_value().asString();\n\tLLNameBox::sInstances.insert(this);\n\tsetText(LLStringUtil::null);\n}\n\nLLNameBox::~LLNameBox()\n{\n\tLLNameBox::sInstances.erase(this);\n}\n\nvoid LLNameBox::setNameID(const LLUUID& name_id, BOOL is_group)\n{\n\tmNameID = name_id;\n\n\tstd::string name;\n\tBOOL got_name = FALSE;\n\n\tif (!is_group)\n\t{\n\t\tgot_name = gCacheName->getFullName(name_id, name);\n\t}\n\telse\n\t{\n\t\tgot_name = gCacheName->getGroupName(name_id, name);\n\t}\n\n\t\/\/ Got the name already? Set it.\n\t\/\/ Otherwise it will be set later in refresh().\n\tif (got_name)\n\t\tsetName(name, is_group);\n\telse\n\t\tsetText(mInitialValue);\n}\n\nvoid LLNameBox::refresh(const LLUUID& id, const std::string& firstname,\n\t\t\t\t\t\tconst std::string& lastname, BOOL is_group)\n{\n\tif (id == mNameID)\n\t{\n\t\tstd::string name;\n\t\tif (!is_group)\n\t\t{\n\t\t\tname = firstname + \" \" + lastname;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tname = firstname;\n\t\t}\n\t\tsetName(name, is_group);\n\t}\n}\n\nvoid LLNameBox::refreshAll(const LLUUID& id, const std::string& firstname,\n\t\t\t\t\t\t   const std::string& lastname, BOOL is_group)\n{\n\tstd::set<LLNameBox*>::iterator it;\n\tfor (it = LLNameBox::sInstances.begin();\n\t\t it != LLNameBox::sInstances.end();\n\t\t ++it)\n\t{\n\t\tLLNameBox* box = *it;\n\t\tbox->refresh(id, firstname, lastname, is_group);\n\t}\n}\n\nvoid LLNameBox::setName(const std::string& name, BOOL is_group)\n{\n\tif (mLink)\n\t{\n\t\tstd::string url;\n\n\t\tif (is_group)\n\t\t\turl = \"[secondlife:\/\/\/app\/group\/\" + LLURI::escape(name) + \"\/about \" + name + \"]\";\n\t\telse\n\t\t\turl = \"[secondlife:\/\/\/app\/agent\/\" + mNameID.asString() + \"\/about \" + name + \"]\";\n\n\t\tsetText(url);\n\t}\n\telse\n\t{\n\t\tsetText(name);\n\t}\n}\n<commit_msg>STORM-215 FIXED Disabled URL highlighting in name_box'es.<commit_after>\/** \n * @file llnamebox.cpp\n * @brief A text display widget\n *\n * $LicenseInfo:firstyear=2001&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#include \"llviewerprecompiledheaders.h\"\n\n#include \"llnamebox.h\"\n\n#include \"llerror.h\"\n#include \"llfontgl.h\"\n#include \"llui.h\"\n#include \"llviewercontrol.h\"\n#include \"lluuid.h\"\n\n#include \"llcachename.h\"\n\n\/\/ statics\nstd::set<LLNameBox*> LLNameBox::sInstances;\n\nstatic LLDefaultChildRegistry::Register<LLNameBox> r(\"name_box\");\n\n\nLLNameBox::LLNameBox(const Params& p)\n:\tLLTextBox(p)\n{\n\tmNameID = LLUUID::null;\n\tmLink = p.link;\n\tmParseHTML = mLink; \/\/ STORM-215\n\tmInitialValue = p.initial_value().asString();\n\tLLNameBox::sInstances.insert(this);\n\tsetText(LLStringUtil::null);\n}\n\nLLNameBox::~LLNameBox()\n{\n\tLLNameBox::sInstances.erase(this);\n}\n\nvoid LLNameBox::setNameID(const LLUUID& name_id, BOOL is_group)\n{\n\tmNameID = name_id;\n\n\tstd::string name;\n\tBOOL got_name = FALSE;\n\n\tif (!is_group)\n\t{\n\t\tgot_name = gCacheName->getFullName(name_id, name);\n\t}\n\telse\n\t{\n\t\tgot_name = gCacheName->getGroupName(name_id, name);\n\t}\n\n\t\/\/ Got the name already? Set it.\n\t\/\/ Otherwise it will be set later in refresh().\n\tif (got_name)\n\t\tsetName(name, is_group);\n\telse\n\t\tsetText(mInitialValue);\n}\n\nvoid LLNameBox::refresh(const LLUUID& id, const std::string& firstname,\n\t\t\t\t\t\tconst std::string& lastname, BOOL is_group)\n{\n\tif (id == mNameID)\n\t{\n\t\tstd::string name;\n\t\tif (!is_group)\n\t\t{\n\t\t\tname = firstname + \" \" + lastname;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tname = firstname;\n\t\t}\n\t\tsetName(name, is_group);\n\t}\n}\n\nvoid LLNameBox::refreshAll(const LLUUID& id, const std::string& firstname,\n\t\t\t\t\t\t   const std::string& lastname, BOOL is_group)\n{\n\tstd::set<LLNameBox*>::iterator it;\n\tfor (it = LLNameBox::sInstances.begin();\n\t\t it != LLNameBox::sInstances.end();\n\t\t ++it)\n\t{\n\t\tLLNameBox* box = *it;\n\t\tbox->refresh(id, firstname, lastname, is_group);\n\t}\n}\n\nvoid LLNameBox::setName(const std::string& name, BOOL is_group)\n{\n\tif (mLink)\n\t{\n\t\tstd::string url;\n\n\t\tif (is_group)\n\t\t\turl = \"[secondlife:\/\/\/app\/group\/\" + mNameID.asString() + \"\/about \" + name + \"]\";\n\t\telse\n\t\t\turl = \"[secondlife:\/\/\/app\/agent\/\" + mNameID.asString() + \"\/about \" + name + \"]\";\n\n\t\tsetText(url);\n\t}\n\telse\n\t{\n\t\tsetText(name);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fix windows build break.<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 \"chrome\/browser\/renderer_host\/sync_resource_handler.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"net\/http\/http_response_headers.h\"\r\n\nSyncResourceHandler::SyncResourceHandler(\n    ResourceDispatcherHost::Receiver* receiver,\n    const GURL& url,\n    IPC::Message* result_message)\n    : read_buffer_(new net::IOBuffer(kReadBufSize)),\n      receiver_(receiver),\n      result_message_(result_message) {\n  result_.final_url = url;\n}\n\nSyncResourceHandler::~SyncResourceHandler() {\n}\n\nbool SyncResourceHandler::OnUploadProgress(int request_id,\n                                           uint64 position,\n                                           uint64 size) {\n  return true;\n}\n\nbool SyncResourceHandler::OnRequestRedirected(int request_id,\n                                              const GURL& new_url,\n                                              ResourceResponse* response,\n                                              bool* defer) {\n  \/\/ TODO(darin): It would be much better if this could live in WebCore, but\n  \/\/ doing so requires API changes at all levels.  Similar code exists in\n  \/\/ WebCore\/platform\/network\/cf\/ResourceHandleCFNet.cpp :-(\n  if (new_url.GetOrigin() != result_.final_url.GetOrigin()) {\n    LOG(ERROR) << \"Cross origin redirect denied\";\n    return false;\n  }\n  result_.final_url = new_url;\n  return true;\n}\n\nbool SyncResourceHandler::OnResponseStarted(int request_id,\n                                            ResourceResponse* response) {\n  \/\/ We don't care about copying the status here.\n  result_.headers = response->response_head.headers;\n  result_.mime_type = response->response_head.mime_type;\n  result_.charset = response->response_head.charset;\n  return true;\n}\n\nbool SyncResourceHandler::OnWillStart(int request_id,\n                                      const GURL& url,\n                                      bool* defer) {\n  return true;\n}\n\nbool SyncResourceHandler::OnWillRead(int request_id, net::IOBuffer** buf,\n                                     int* buf_size, int min_size) {\n  DCHECK(min_size == -1);\n  *buf = read_buffer_.get();\n  \/\/ TODO(willchan): Remove after debugging bug 16371.\n  CHECK(read_buffer_->data());\n  *buf_size = kReadBufSize;\n  return true;\n}\n\nbool SyncResourceHandler::OnReadCompleted(int request_id, int* bytes_read) {\n  if (!*bytes_read)\n    return true;\n  result_.data.append(read_buffer_->data(), *bytes_read);\n  return true;\n}\n\nbool SyncResourceHandler::OnResponseCompleted(\n    int request_id,\n    const URLRequestStatus& status,\n    const std::string& security_info) {\n  result_.status = status;\n\n  ViewHostMsg_SyncLoad::WriteReplyParams(result_message_, result_);\n  receiver_->Send(result_message_);\n  result_message_ = NULL;\n  return true;\n}\n\nvoid SyncResourceHandler::OnRequestClosed() {\n  if (!result_message_)\n    return;\n\n  result_message_->set_reply_error();\n  receiver_->Send(result_message_);\n  receiver_ = NULL;  \/\/ URLRequest is gone, and perhaps also the receiver.\n}\n<commit_msg>Fix a bad line ending in sync_resource_handler.cc.<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\/renderer_host\/sync_resource_handler.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"net\/http\/http_response_headers.h\"\n\nSyncResourceHandler::SyncResourceHandler(\n    ResourceDispatcherHost::Receiver* receiver,\n    const GURL& url,\n    IPC::Message* result_message)\n    : read_buffer_(new net::IOBuffer(kReadBufSize)),\n      receiver_(receiver),\n      result_message_(result_message) {\n  result_.final_url = url;\n}\n\nSyncResourceHandler::~SyncResourceHandler() {\n}\n\nbool SyncResourceHandler::OnUploadProgress(int request_id,\n                                           uint64 position,\n                                           uint64 size) {\n  return true;\n}\n\nbool SyncResourceHandler::OnRequestRedirected(int request_id,\n                                              const GURL& new_url,\n                                              ResourceResponse* response,\n                                              bool* defer) {\n  \/\/ TODO(darin): It would be much better if this could live in WebCore, but\n  \/\/ doing so requires API changes at all levels.  Similar code exists in\n  \/\/ WebCore\/platform\/network\/cf\/ResourceHandleCFNet.cpp :-(\n  if (new_url.GetOrigin() != result_.final_url.GetOrigin()) {\n    LOG(ERROR) << \"Cross origin redirect denied\";\n    return false;\n  }\n  result_.final_url = new_url;\n  return true;\n}\n\nbool SyncResourceHandler::OnResponseStarted(int request_id,\n                                            ResourceResponse* response) {\n  \/\/ We don't care about copying the status here.\n  result_.headers = response->response_head.headers;\n  result_.mime_type = response->response_head.mime_type;\n  result_.charset = response->response_head.charset;\n  return true;\n}\n\nbool SyncResourceHandler::OnWillStart(int request_id,\n                                      const GURL& url,\n                                      bool* defer) {\n  return true;\n}\n\nbool SyncResourceHandler::OnWillRead(int request_id, net::IOBuffer** buf,\n                                     int* buf_size, int min_size) {\n  DCHECK(min_size == -1);\n  *buf = read_buffer_.get();\n  \/\/ TODO(willchan): Remove after debugging bug 16371.\n  CHECK(read_buffer_->data());\n  *buf_size = kReadBufSize;\n  return true;\n}\n\nbool SyncResourceHandler::OnReadCompleted(int request_id, int* bytes_read) {\n  if (!*bytes_read)\n    return true;\n  result_.data.append(read_buffer_->data(), *bytes_read);\n  return true;\n}\n\nbool SyncResourceHandler::OnResponseCompleted(\n    int request_id,\n    const URLRequestStatus& status,\n    const std::string& security_info) {\n  result_.status = status;\n\n  ViewHostMsg_SyncLoad::WriteReplyParams(result_message_, result_);\n  receiver_->Send(result_message_);\n  result_message_ = NULL;\n  return true;\n}\n\nvoid SyncResourceHandler::OnRequestClosed() {\n  if (!result_message_)\n    return;\n\n  result_message_->set_reply_error();\n  receiver_->Send(result_message_);\n  receiver_ = NULL;  \/\/ URLRequest is gone, and perhaps also the receiver.\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: commanddefinition.hxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: fs $ $Date: 2003-07-10 13:02:09 $\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 _DBA_COREDATAACESS_COMMANDDEFINITION_HXX_\n#define _DBA_COREDATAACESS_COMMANDDEFINITION_HXX_\n\n#ifndef _DBA_CORE_COMMANDBASE_HXX_\n#include \"commandbase.hxx\"\n#endif\n#ifndef _DBA_CORE_CONTAINERELEMENT_HXX_\n#include \"containerelement.hxx\"\n#endif\n#ifndef _COMPHELPER_PROPERTYCONTAINER_HXX_\n#include <comphelper\/propertycontainer.hxx>\n#endif\n#ifndef _DBA_CORE_CONFIGURATIONFLUSHABLE_HXX_\n#include \"configurationflushable.hxx\"\n#endif\n#ifndef _DBA_REGHELPER_HXX_\n#include \"dba_reghelper.hxx\"\n#endif\n#ifndef _DBASHARED_APITOOLS_HXX_\n#include \"apitools.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_SDBCX_XRENAME_HPP_\n#include <com\/sun\/star\/sdbcx\/XRename.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XUNOTUNNEL_HPP_\n#include <com\/sun\/star\/lang\/XUnoTunnel.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase3.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n#ifndef _COMPHELPER_BROADCASTHELPER_HXX_\n#include <comphelper\/broadcasthelper.hxx>\n#endif\n\n\/\/........................................................................\nnamespace dbaccess\n{\n\/\/........................................................................\n\n\/\/=========================================================================\n\/\/= OCommandDefinition - a database \"document\" which describes a query\n\/\/=========================================================================\n\ntypedef ::cppu::WeakImplHelper3 <   ::com::sun::star::lang::XUnoTunnel\n                                ,   ::com::sun::star::lang::XServiceInfo\n                                ,   ::com::sun::star::sdbcx::XRename\n                                >   OCommandDefinition_Base;\n\nclass OCommandDefinition    :public OCommandDefinition_Base\n                            ,public OCommandBase\n                            ,public OContainerElement\n                            ,public comphelper::OMutexAndBroadcastHelper\n                            ,public ::comphelper::OPropertyContainer\n                            ,public OConfigurationFlushable\n                            ,public ::comphelper::OPropertyArrayUsageHelper< OCommandDefinition >\n{\nprotected:\n    ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >               m_xContainer;\n\nprotected:\n    ~OCommandDefinition();\n\nprivate:\n    OCommandDefinition();\n\npublic:\n    \/\/ helper class for controlling access privileges\n    class AccessControl\n    {\n        friend class OCommandContainer;\n    private:\n        AccessControl() { }\n    };\n\n    \/\/ --------------------------------------------------------------------\n    \/\/ some kind of default ctor, accessible for selected classes only\n    OCommandDefinition(AccessControl&);\n\n    OCommandDefinition(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContainer,\n            const ::rtl::OUString& _rElementName,\n            const ::utl::OConfigurationTreeRoot& _rConfigRoot\n        );\n\n\/\/ com::sun::star::lang::XTypeProvider\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw (::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw (::com::sun::star::uno::RuntimeException);\n\n\/\/ ::com::sun::star::uno::XInterface\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type& aType ) throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL acquire(  ) throw() { OCommandDefinition_Base::acquire(); }\n    virtual void SAL_CALL release(  ) throw() { OCommandDefinition_Base::release(); }\n\n\/\/ ::com::sun::star::lang::XServiceInfo\n    DECLARE_SERVICE_INFO();\n\n\/\/ ::com::sun::star::lang::XServiceInfo - static methods\n    static ::com::sun::star::uno::Sequence< ::rtl::OUString > getSupportedServiceNames_Static(void) throw( ::com::sun::star::uno::RuntimeException );\n    static ::rtl::OUString getImplementationName_Static(void) throw( ::com::sun::star::uno::RuntimeException );\n    static ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > SAL_CALL\n        Create(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >&);\n\n    \/\/ XRename\n    virtual void SAL_CALL rename( const ::rtl::OUString& newName ) throw (::com::sun::star::sdbc::SQLException, ::com::sun::star::container::ElementExistException, ::com::sun::star::uno::RuntimeException);\n\n\/\/ ::com::sun::star::lang::XUnoTunnel\n    virtual sal_Int64 SAL_CALL getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& aIdentifier ) throw(::com::sun::star::uno::RuntimeException);\n\n\/\/ ::com::sun::star::beans::XPropertySet\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo(  ) throw(::com::sun::star::uno::RuntimeException);\n\n\/\/ OPropertySetHelper\n    virtual ::cppu::IPropertyArrayHelper& SAL_CALL getInfoHelper();\n\n\/\/ OContainerElement\n    virtual void        inserted(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContainer,\n        const ::rtl::OUString& _rElementName,\n        const ::utl::OConfigurationTreeRoot& _rConfigRoot);\n\n    virtual void        removed();\n\n    virtual sal_Bool    isContainerElement() const { return m_aConfigurationNode.isValid(); }\n\nprotected:\n\/\/ OPropertyArrayUsageHelper\n    virtual ::cppu::IPropertyArrayHelper* createArrayHelper( ) const;\n\n\/\/ OConfigurationFlushable\n    void flush_NoBroadcast_NoCommit(  ) throw(::com::sun::star::uno::RuntimeException);\n\n\/\/ initialize the members from the current configuration node\n    void initializeFromConfiguration();\n\nprivate:\n    \/\/ helper\n    void registerProperties();\n};\n\n\/\/........................................................................\n}   \/\/ namespace dbaccess\n\/\/........................................................................\n\n#endif \/\/ _DBA_COREDATAACESS_COMMANDDEFINITION_HXX_\n\n\n<commit_msg>INTEGRATION: CWS insight01 (1.13.22); FILE MERGED 2004\/02\/20 11:32:32 oj 1.13.22.5: #i25414# extend the datadescriptor for database location and connection resource 2004\/02\/12 16:15:24 oj 1.13.22.4: #111075# fix refcount problem 2003\/12\/17 09:46:42 oj 1.13.22.3: #111075# ongoing work 2003\/11\/17 09:39:08 oj 1.13.22.2: #111075# ongoning work 2003\/10\/24 06:27:24 oj 1.13.22.1: #i21643# import filter changes<commit_after>\/*************************************************************************\n *\n *  $RCSfile: commanddefinition.hxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: hr $ $Date: 2004-08-02 15:07: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\n#ifndef _DBA_COREDATAACESS_COMMANDDEFINITION_HXX_\n#define _DBA_COREDATAACESS_COMMANDDEFINITION_HXX_\n\n#ifndef _DBA_CORE_COMMANDBASE_HXX_\n#include \"commandbase.hxx\"\n#endif\n#ifndef _COMPHELPER_PROPERTYCONTAINER_HXX_\n#include <comphelper\/propertycontainer.hxx>\n#endif\n#ifndef _DBA_REGHELPER_HXX_\n#include \"dba_reghelper.hxx\"\n#endif\n#ifndef _DBASHARED_APITOOLS_HXX_\n#include \"apitools.hxx\"\n#endif\n#ifndef _COMPHELPER_UNO3_HXX_\n#include <comphelper\/uno3.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XRENAME_HPP_\n#include <com\/sun\/star\/sdbcx\/XRename.hpp>\n#endif\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n#ifndef _DBA_CORE_DATASETTINGS_HXX_\n#include \"datasettings.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef DBA_CONTENTHELPER_HXX\n#include \"ContentHelper.hxx\"\n#endif\n#ifndef DBA_COREDATAACESS_COMPONENTDEFINITION_HXX\n#include \"ComponentDefinition.hxx\"\n#endif\n\n\n\/\/........................................................................\nnamespace dbaccess\n{\n\/\/........................................................................\n\n\/\/=========================================================================\n\/\/= OCommandDefinition - a database \"document\" which describes a query\n\/\/=========================================================================\n    class OCommandDefinition_Impl : public OComponentDefinition_Impl\n                                  ,public OCommandBase\n    {\n    public:\n    };\ntypedef ::cppu::ImplHelper1 <   ::com::sun::star::sdbcx::XRename\n                                >   OCommandDefinition_Base;\nclass OCommandDefinition;\ntypedef ::comphelper::OPropertyArrayUsageHelper< OCommandDefinition >\n                        OCommandDefinition_PROP;\n\n\nclass OCommandDefinition    :public OComponentDefinition\n                            ,public OCommandDefinition_Base\n                            ,public OCommandDefinition_PROP\n{\nprotected:\n    virtual ~OCommandDefinition();\n\n    OCommandDefinition(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >&\n        ,const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >&   _xParentContainer\n        ,const TContentPtr& _pImpl\n        );\npublic:\n\n    OCommandDefinition(\n             const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContainer\n            ,const ::rtl::OUString& _rElementName\n            ,const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >&\n            ,const TContentPtr& _pImpl\n        );\n\n\/\/ com::sun::star::lang::XTypeProvider\n    DECLARE_TYPEPROVIDER( );\n\n\/\/ ::com::sun::star::uno::XInterface\n    DECLARE_XINTERFACE( )\n\n\/\/ ::com::sun::star::lang::XServiceInfo\n    virtual ::rtl::OUString SAL_CALL getImplementationName(  ) 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\/\/ ::com::sun::star::lang::XServiceInfo - static methods\n    static ::com::sun::star::uno::Sequence< ::rtl::OUString > getSupportedServiceNames_Static(void) throw( ::com::sun::star::uno::RuntimeException );\n    static ::rtl::OUString getImplementationName_Static(void) throw( ::com::sun::star::uno::RuntimeException );\n    static ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > SAL_CALL\n        Create(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >&);\n\n    \/\/ XRename\n    virtual void SAL_CALL rename( const ::rtl::OUString& newName ) throw (::com::sun::star::sdbc::SQLException, ::com::sun::star::container::ElementExistException, ::com::sun::star::uno::RuntimeException);\n\n    \/\/ OPropertySetHelper\n    DECLARE_PROPERTYCONTAINER_DEFAULTS( );\nprivate:\n    \/\/ helper\n    void registerProperties();\n};\n\n\/\/........................................................................\n}   \/\/ namespace dbaccess\n\/\/........................................................................\n\n#endif \/\/ _DBA_COREDATAACESS_COMMANDDEFINITION_HXX_\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <QVector3D>\n#include \"coverage.h\"\n#include \"featurecoverage.h\"\n#include \"feature.h\"\n#include \"geometryhelper.h\"\n#include \"drawers\/attributevisualproperties.h\"\n#include \"drawers\/drawerattributesetterfactory.h\"\n#include \"simplelinesetter.h\"\n\nusing namespace Ilwis;\nusing namespace Geodrawer;\n\nREGISTER_DRAWER_ATTRIBUTE_SETTER(SimpleLineSetter)\n\nSimpleLineSetter::SimpleLineSetter(const IOOptions &options) : BaseSpatialAttributeSetter(options)\n{\n\n}\n\nSimpleLineSetter::~SimpleLineSetter()\n{\n\n}\n\nDrawerAttributeSetter *SimpleLineSetter::create(const IOOptions &options)\n{\n    return new SimpleLineSetter(options);\n\n}\n\nFeatureDrawing SimpleLineSetter::setSpatialAttributes(const Ilwis::SPFeatureI &feature,\n                                               QVector<QVector3D> &vertices,\n                                               QVector<QVector3D> &) const\n{\n    const UPGeometry& geometry = feature->geometry();\n    FeatureDrawing drawing(itLINE);\n    int n = geometry->getNumGeometries();\n    for(int  geom = 0; geom < n; ++geom ){\n        const geos::geom::Geometry *subgeom = geometry->getGeometryN(geom);\n        if (!subgeom)\n            continue;\n        auto *coords = subgeom->getCoordinates();\n        quint32 oldend = vertices.size();\n        drawing._indices.push_back(VertexIndex(oldend, coords->size(), GL_LINE_STRIP, feature->featureid()));\n        vertices.resize(oldend + coords->size());\n\n        Coordinate crd;\n        for(int i = 0; i < coords->size(); ++i){\n            coords->getAt(i, crd);\n            if ( coordinateConversionNeeded()){\n                crd = _targetSystem->coord2coord(_sourceSystem, crd);\n            }\n            vertices[oldend + i] = QVector3D(crd.x, crd.y, crd.z);\n        }\n        delete coords;\n    }\n    return drawing;\n}\n\nvoid SimpleLineSetter::setColorAttributes(const VisualAttribute &attr, const QVariant &value, const QColor &defaultColor, const FeatureDrawing& drawing, std::vector<VertexColor> &colors) const\n{\n    for(int j =0; j < drawing._indices.size(); ++j){\n        if ( value.isValid() && value.toInt() != iUNDEF) {\n            const auto& indices = drawing[j];\n            for(int i =indices._start; i < indices._start + indices._count; ++i){\n                QColor clr = attr.value2color(value);\n                colors.push_back(VertexColor(clr.redF(), clr.greenF(), clr.blueF(), 1.0));\n            }\n        }\n    }\n}\n\n<commit_msg>possibility to overrule the representation color<commit_after>#include <QVector3D>\n#include \"coverage.h\"\n#include \"featurecoverage.h\"\n#include \"feature.h\"\n#include \"geometryhelper.h\"\n#include \"drawers\/attributevisualproperties.h\"\n#include \"drawers\/drawerattributesetterfactory.h\"\n#include \"simplelinesetter.h\"\n\nusing namespace Ilwis;\nusing namespace Geodrawer;\n\nREGISTER_DRAWER_ATTRIBUTE_SETTER(SimpleLineSetter)\n\nSimpleLineSetter::SimpleLineSetter(const IOOptions &options) : BaseSpatialAttributeSetter(options)\n{\n\n}\n\nSimpleLineSetter::~SimpleLineSetter()\n{\n\n}\n\nDrawerAttributeSetter *SimpleLineSetter::create(const IOOptions &options)\n{\n    return new SimpleLineSetter(options);\n\n}\n\nFeatureDrawing SimpleLineSetter::setSpatialAttributes(const Ilwis::SPFeatureI &feature,\n                                               QVector<QVector3D> &vertices,\n                                               QVector<QVector3D> &) const\n{\n    const UPGeometry& geometry = feature->geometry();\n    FeatureDrawing drawing(itLINE);\n    int n = geometry->getNumGeometries();\n    for(int  geom = 0; geom < n; ++geom ){\n        const geos::geom::Geometry *subgeom = geometry->getGeometryN(geom);\n        if (!subgeom)\n            continue;\n        auto *coords = subgeom->getCoordinates();\n        quint32 oldend = vertices.size();\n        drawing._indices.push_back(VertexIndex(oldend, coords->size(), GL_LINE_STRIP, feature->featureid()));\n        vertices.resize(oldend + coords->size());\n\n        Coordinate crd;\n        for(int i = 0; i < coords->size(); ++i){\n            coords->getAt(i, crd);\n            if ( coordinateConversionNeeded()){\n                crd = _targetSystem->coord2coord(_sourceSystem, crd);\n            }\n            vertices[oldend + i] = QVector3D(crd.x, crd.y, crd.z);\n        }\n        delete coords;\n    }\n    return drawing;\n}\n\nvoid SimpleLineSetter::setColorAttributes(const VisualAttribute &attr, const QVariant &value, const QColor &defaultColor, const FeatureDrawing& drawing, std::vector<VertexColor> &colors) const\n{\n    for(int j =0; j < drawing._indices.size(); ++j){\n        if ( value.isValid() && value.toInt() != iUNDEF) {\n            const auto& indices = drawing[j];\n            for(int i =indices._start; i < indices._start + indices._count; ++i){\n                QColor clr = attr.value2color(value);\n                if ( defaultColor.isValid()){\n                   colors.push_back(VertexColor(defaultColor.redF(), defaultColor.greenF(), defaultColor.blueF(), 1.0));\n                }else\n                    colors.push_back(VertexColor(clr.redF(), clr.greenF(), clr.blueF(), 1.0));\n            }\n        }\n    }\n}\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*\/\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#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 rx_buffer_head is the index of the\n\/\/ location to which to write the next incoming character and rx_buffer_tail\n\/\/ is the index of the location from which to read.\n#define RX_BUFFER_SIZE 128\n\nstruct ring_buffer\n{\n  unsigned char buffer[RX_BUFFER_SIZE];\n  int head;\n  int tail;\n};\n\ninline void store_char(unsigned char c, ring_buffer *rx_buffer)\n{\n  int i = (unsigned int)(rx_buffer->head + 1) % RX_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 != rx_buffer->tail) {\n    rx_buffer->buffer[rx_buffer->head] = c;\n    rx_buffer->head = i;\n  }\n}\n\n\/\/ Constructors \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nHardwareSerial::HardwareSerial(\n  ring_buffer *rx_buffer,\n  USART_t     *usart,\n  PORT_t      *port,\n  uint8_t      in_bm,\n  uint8_t      out_bm)\n{\n  this->_rx_buffer = rx_buffer;\n  this->_usart     = usart;\n  this->_port      = port;\n  this->_in_bm     = in_bm;\n  this->_out_bm    = out_bm;\n}\n\n\/\/ Public Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid HardwareSerial::begin(unsigned long baud)\n{\n  uint16_t baud_setting;\n  uint8_t bscale = 0;\n  uint32_t div1k;\n  bool use_u2x;\n\n  \/\/ TODO: Serial. Fix serial double clock.\n  use_u2x = false;\n\n  _port->DIRCLR = _in_bm;  \/\/ input\n  _port->OUTSET = _out_bm; \/\/ set output high\n  _port->DIRSET = _out_bm; \/\/ set to output\n\n  \/\/ Reset flags\n  _usart->CTRLB = 0;\n\n  \/\/ set the baud rate\n  if (baud > (F_CPU\/(use_u2x ? 16 : 32))) return; \/\/ Baudrate is set too high\n\n  div1k = ((F_CPU*(use_u2x ? 128UL : 64UL)) \/ baud) - 1024;\n  while ((div1k < 2096640UL) && (bscale < 7)) {\n    bscale++;\n    div1k <<= 1;\n  }\n\n  baud_setting = div1k >> 10;\n\n  _usart->BAUDCTRLA = baud_setting&0xff;\n  _usart->BAUDCTRLB = (baud_setting>>8) | ((16-bscale) << 4);\n\n  if(use_u2x)\n\t_usart->CTRLB |= USART_CLK2X_bm;\n  \n  \/\/ enable Rx and Tx\n  _usart->CTRLB |= USART_RXEN_bm | USART_TXEN_bm;\n  \/\/ enable interrupt\n  _usart->CTRLA = (_usart->CTRLA & ~USART_RXCINTLVL_gm) | USART_RXCINTLVL_LO_gc;\n\n  \/\/ Char size, parity and stop bits: 8N1\n  _usart->CTRLC = USART_CHSIZE_8BIT_gc | USART_PMODE_DISABLED_gc;\n}\n\nvoid HardwareSerial::begin(unsigned long baud, byte config)\n{\n  begin(baud);\n\n  \/\/ Set char size, parity and stop bits\n  _usart->CTRLC = config;\n}\n\nvoid HardwareSerial::end()\n{\n  \/\/ disable Rx and Tx\n  _usart->CTRLB &= ~(USART_RXEN_bm | USART_TXEN_bm);\n  \/\/ disable interrupt\n  _usart->CTRLA = (_usart->CTRLA & ~USART_RXCINTLVL_gm) | USART_RXCINTLVL_LO_gc;\n}\n\nint HardwareSerial::available(void)\n{\n  return (unsigned int)(RX_BUFFER_SIZE + _rx_buffer->head - _rx_buffer->tail) % RX_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) % RX_BUFFER_SIZE;\n    return c;\n  }\n}\n\nvoid HardwareSerial::flush()\n{\n  \/\/ don't reverse this or there may be problems if the RX interrupt\n  \/\/ occurs after reading the value of rx_buffer_head but before writing\n  \/\/ the value to rx_buffer_tail; the previous value of rx_buffer_head\n  \/\/ may be written to rx_buffer_tail, making it appear as if the buffer\n  \/\/ don't reverse this or there may be problems if the RX interrupt\n  \/\/ occurs after reading the value of rx_buffer_head but before writing\n  \/\/ the value to rx_buffer_tail; the previous value of rx_buffer_head\n  \/\/ may be written to rx_buffer_tail, making it appear as if the buffer\n  \/\/ were full, not empty.\n  _rx_buffer->head = _rx_buffer->tail;\n}\n\nsize_t HardwareSerial::write(uint8_t c)\n{\n  while ( !(_usart->STATUS & USART_DREIF_bm) );\n  _usart->DATA = c;\n  \n  return 1;\n}\n\nvoid HardwareSerial::setIREnabled(bool enable)\n{\n\tif(enable)\n\t{\n\t\t_usart->CTRLC |= USART_CMODE_IRDA_gc;\n\t}\n\telse\n\t{\n\t\t_usart->CTRLC &= ~USART_CMODE_IRDA_gc;\n\t}\n}\n\nHardwareSerial::operator bool() {\n  return true;\n}\n\n#define SERIAL_DEFINE(name, usart_port, port_nr) \\\nring_buffer name##rx_buffer = { { 0 }, 0, 0 }; \\\nISR(USART##usart_port##port_nr##_RXC_vect) \\\n{ \\\n  unsigned char c = USART##usart_port##port_nr.DATA; \\\n  store_char(c, &name##rx_buffer); \\\n} \\\nHardwareSerial name (&name##rx_buffer, &USART##usart_port##port_nr, &PORT##usart_port, (port_nr ? PIN6_bm : PIN2_bm), (port_nr ? PIN7_bm : PIN3_bm));\n\n#include \"serial_init.inc\"\n\n\/\/ Assume that USART always start from C0 and goes up\n\/\/ At this stage we are only interested in the amount of USARTs\n#if defined(USARTC0_RXC_vect)\n  void serialEvent() __attribute__((weak));\n  void serialEvent() {}\n  #define serialEvent_implemented\n#endif\n#if defined(USARTC1_RXC_vect)\n  void serialEvent1() __attribute__((weak));\n  void serialEvent1() {}\n  #define serialEvent1_implemented\n#endif\n#if defined(USARTD0_RXC_vect)\n  void serialEvent2() __attribute__((weak));\n  void serialEvent2() {}\n  #define serialEvent2_implemented\n#endif\n#if defined(USARTD1_RXC_vect)\n  void serialEvent3() __attribute__((weak));\n  void serialEvent3() {}\n  #define serialEvent3_implemented\n#endif\n#if defined(USARTE0_RXC_vect)\n  void serialEvent4() __attribute__((weak));\n  void serialEvent4() {}\n  #define serialEvent4_implemented\n#endif\n#if defined(USARTE1_RXC_vect)\n  void serialEvent5() __attribute__((weak));\n  void serialEvent5() {}\n  #define serialEvent5_implemented\n#endif\n#if defined(USARTF0_RXC_vect)\n  void serialEvent6() __attribute__((weak));\n  void serialEvent6() {}\n  #define serialEvent6_implemented\n#endif\n#if defined(USARTF1_RXC_vect)\n  void serialEvent7() __attribute__((weak));\n  void serialEvent7() {}\n  #define serialEvent7_implemented\n#endif\n\n\nvoid serialEventRun(void)\n{\n#ifdef serialEvent_implemented\n  if (Serial.available()) serialEvent();\n#endif\n#ifdef serialEvent1_implemented\n  if (Serial1.available()) serialEvent1();\n#endif\n#ifdef serialEvent2_implemented\n  if (Serial2.available()) serialEvent2();\n#endif\n#ifdef serialEvent3_implemented\n  if (Serial3.available()) serialEvent3();\n#endif\n#ifdef serialEvent4_implemented\n  if (Serial4.available()) serialEvent4();\n#endif\n#ifdef serialEvent5_implemented\n  if (Serial5.available()) serialEvent5();\n#endif\n#ifdef serialEvent6_implemented\n  if (Serial6.available()) serialEvent6();\n#endif\n#ifdef serialEvent7_implemented\n  if (Serial7.available()) serialEvent7();\n#endif\n}\n<commit_msg>improved performance of HardwareSerial<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*\/\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#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 rx_buffer_head is the index of the\n\/\/ location to which to write the next incoming character and rx_buffer_tail\n\/\/ is the index of the location from which to read.\n#define RX_BUFFER_SIZE 128\n\nstruct ring_buffer\n{\n  unsigned char buffer[RX_BUFFER_SIZE];\n  int head;\n  int tail;\n};\n\ninline void store_char(unsigned char c, ring_buffer *rx_buffer)\n{\n  int i = (unsigned int)(rx_buffer->head + 1) % RX_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 != rx_buffer->tail) {\n    rx_buffer->buffer[rx_buffer->head] = c;\n    rx_buffer->head = i;\n  }\n}\n\n\/\/ Constructors \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nHardwareSerial::HardwareSerial(\n  ring_buffer *rx_buffer,\n  USART_t     *usart,\n  PORT_t      *port,\n  uint8_t      in_bm,\n  uint8_t      out_bm)\n{\n  this->_rx_buffer = rx_buffer;\n  this->_usart     = usart;\n  this->_port      = port;\n  this->_in_bm     = in_bm;\n  this->_out_bm    = out_bm;\n}\n\n\/\/ Public Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid HardwareSerial::begin(unsigned long baud)\n{\n  uint16_t baud_setting;\n  uint8_t bscale = 0;\n  uint32_t div1k;\n  bool use_u2x;\n\n  \/\/ TODO: Serial. Fix serial double clock.\n  use_u2x = false;\n\n  _port->DIRCLR = _in_bm;  \/\/ input\n  _port->OUTSET = _out_bm; \/\/ set output high\n  _port->DIRSET = _out_bm; \/\/ set to output\n\n  \/\/ Reset flags\n  _usart->CTRLB = 0;\n\n  \/\/ set the baud rate\n  if (baud > (F_CPU\/(use_u2x ? 16 : 32))) return; \/\/ Baudrate is set too high\n\n  div1k = ((F_CPU*(use_u2x ? 128UL : 64UL)) \/ baud) - 1024;\n  while ((div1k < 2096640UL) && (bscale < 7)) {\n    bscale++;\n    div1k <<= 1;\n  }\n\n  baud_setting = div1k >> 10;\n\n  _usart->BAUDCTRLA = baud_setting&0xff;\n  _usart->BAUDCTRLB = (baud_setting>>8) | ((16-bscale) << 4);\n\n  if(use_u2x)\n\t_usart->CTRLB |= USART_CLK2X_bm;\n  \n  \/\/ enable Rx and Tx\n  _usart->CTRLB |= USART_RXEN_bm | USART_TXEN_bm;\n  \/\/ enable interrupt\n  _usart->CTRLA = (_usart->CTRLA & ~USART_RXCINTLVL_gm) | USART_RXCINTLVL_LO_gc;\n\n  \/\/ Char size, parity and stop bits: 8N1\n  _usart->CTRLC = USART_CHSIZE_8BIT_gc | USART_PMODE_DISABLED_gc;\n}\n\nvoid HardwareSerial::begin(unsigned long baud, byte config)\n{\n  begin(baud);\n\n  \/\/ Set char size, parity and stop bits\n  _usart->CTRLC = config;\n}\n\nvoid HardwareSerial::end()\n{\n  \/\/ disable Rx and Tx\n  _usart->CTRLB &= ~(USART_RXEN_bm | USART_TXEN_bm);\n  \/\/ disable interrupt\n  _usart->CTRLA = (_usart->CTRLA & ~USART_RXCINTLVL_gm) | USART_RXCINTLVL_LO_gc;\n}\n\nint HardwareSerial::available(void)\n{\n  return (unsigned int)(RX_BUFFER_SIZE + _rx_buffer->head - _rx_buffer->tail) % RX_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) % RX_BUFFER_SIZE;\n    return c;\n  }\n}\n\nvoid HardwareSerial::flush()\n{\n  \/\/ don't reverse this or there may be problems if the RX interrupt\n  \/\/ occurs after reading the value of rx_buffer_head but before writing\n  \/\/ the value to rx_buffer_tail; the previous value of rx_buffer_head\n  \/\/ may be written to rx_buffer_tail, making it appear as if the buffer\n  \/\/ don't reverse this or there may be problems if the RX interrupt\n  \/\/ occurs after reading the value of rx_buffer_head but before writing\n  \/\/ the value to rx_buffer_tail; the previous value of rx_buffer_head\n  \/\/ may be written to rx_buffer_tail, making it appear as if the buffer\n  \/\/ were full, not empty.\n  _rx_buffer->head = _rx_buffer->tail;\n}\n\nsize_t HardwareSerial::write(uint8_t c)\n{\n\t_usart->DATA = c; \t\t\t\t\t\/\/start TX\n\t\n\tif ( !(_usart->STATUS & USART_DREIF_bm) )\n\t\twhile(!(_usart->STATUS & USART_TXCIF_bm)); \t\/\/wait for TX to complete\n\t\t\n\t_usart->STATUS|=USART_TXCIF_bm;\t\t\t\t\/\/clear TX interrupt flag\t\t\n\t\n\treturn 1;\n}\n\nvoid HardwareSerial::setIREnabled(bool enable)\n{\n\tif(enable)\n\t{\n\t\t_usart->CTRLC |= USART_CMODE_IRDA_gc;\n\t}\n\telse\n\t{\n\t\t_usart->CTRLC &= ~USART_CMODE_IRDA_gc;\n\t}\n}\n\nHardwareSerial::operator bool() {\n  return true;\n}\n\n#define SERIAL_DEFINE(name, usart_port, port_nr) \\\nring_buffer name##rx_buffer = { { 0 }, 0, 0 }; \\\nISR(USART##usart_port##port_nr##_RXC_vect) \\\n{ \\\n  unsigned char c = USART##usart_port##port_nr.DATA; \\\n  store_char(c, &name##rx_buffer); \\\n} \\\nHardwareSerial name (&name##rx_buffer, &USART##usart_port##port_nr, &PORT##usart_port, (port_nr ? PIN6_bm : PIN2_bm), (port_nr ? PIN7_bm : PIN3_bm));\n\n#include \"serial_init.inc\"\n\n\/\/ Assume that USART always start from C0 and goes up\n\/\/ At this stage we are only interested in the amount of USARTs\n#if defined(USARTC0_RXC_vect)\n  void serialEvent() __attribute__((weak));\n  void serialEvent() {}\n  #define serialEvent_implemented\n#endif\n#if defined(USARTC1_RXC_vect)\n  void serialEvent1() __attribute__((weak));\n  void serialEvent1() {}\n  #define serialEvent1_implemented\n#endif\n#if defined(USARTD0_RXC_vect)\n  void serialEvent2() __attribute__((weak));\n  void serialEvent2() {}\n  #define serialEvent2_implemented\n#endif\n#if defined(USARTD1_RXC_vect)\n  void serialEvent3() __attribute__((weak));\n  void serialEvent3() {}\n  #define serialEvent3_implemented\n#endif\n#if defined(USARTE0_RXC_vect)\n  void serialEvent4() __attribute__((weak));\n  void serialEvent4() {}\n  #define serialEvent4_implemented\n#endif\n#if defined(USARTE1_RXC_vect)\n  void serialEvent5() __attribute__((weak));\n  void serialEvent5() {}\n  #define serialEvent5_implemented\n#endif\n#if defined(USARTF0_RXC_vect)\n  void serialEvent6() __attribute__((weak));\n  void serialEvent6() {}\n  #define serialEvent6_implemented\n#endif\n#if defined(USARTF1_RXC_vect)\n  void serialEvent7() __attribute__((weak));\n  void serialEvent7() {}\n  #define serialEvent7_implemented\n#endif\n\n\nvoid serialEventRun(void)\n{\n#ifdef serialEvent_implemented\n  if (Serial.available()) serialEvent();\n#endif\n#ifdef serialEvent1_implemented\n  if (Serial1.available()) serialEvent1();\n#endif\n#ifdef serialEvent2_implemented\n  if (Serial2.available()) serialEvent2();\n#endif\n#ifdef serialEvent3_implemented\n  if (Serial3.available()) serialEvent3();\n#endif\n#ifdef serialEvent4_implemented\n  if (Serial4.available()) serialEvent4();\n#endif\n#ifdef serialEvent5_implemented\n  if (Serial5.available()) serialEvent5();\n#endif\n#ifdef serialEvent6_implemented\n  if (Serial6.available()) serialEvent6();\n#endif\n#ifdef serialEvent7_implemented\n  if (Serial7.available()) serialEvent7();\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <algorithm>\n#include <array>\n#include <iostream>\n#include <vector>\n\n#include \"..\/loop\/loop_nest.hpp\"\n#include \"memory_layout_exception.hpp\"\n#include \"tile_iterator.hpp\"\n#include \"tiling_info_dim.hpp\"\n#include \"util.hpp\"\n\nnamespace memory_layout {\n\nnamespace detail {\n\ntemplate <size_t dim, typename T, typename U> \/\/ , size_t... indices\nvoid tile_dim_indices(\n    std::vector<T, U> &tiled, const std::vector<T, U> &org,\n    const std::vector<tiling_info_dim> &tiling_info,\n    std::array<size_t, dim> &tile_index) { \/\/ , std::index_sequence<indices...>\n  \/\/ std::cout << \"tile_index: \";\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/     if (d > 0) {\n  \/\/         std::cout << \", \";\n  \/\/     }\n  \/\/     std::cout << tile_index[d];\n  \/\/ }\n  \/\/ std::cout << std::endl;\n\n  size_t cur_stride = 1;\n  size_t skipped_blocks = 0;\n  for (size_t d = 0; d < dim; d++) {\n    skipped_blocks += tile_index[(dim - 1) - d] * cur_stride;\n    cur_stride *= (tiling_info[(dim - 1) - d].stride \/\n                   tiling_info[(dim - 1) - d].tile_size_dir);\n  }\n\n  \/\/ std::cout << \"skipped blocks: \" << skipped_blocks << std::endl;\n\n  for (size_t d = 0; d < dim; d++) {\n    skipped_blocks *= tiling_info[d].tile_size_dir;\n  }\n\n  \/\/ std::array<size_t, dim> min;\n  \/\/ std::fill_n(min.begin(), dim, 0);\n  \/\/ size_t min[dim];\n  std::array<size_t, dim> min;\n  for (size_t d = 0; d < dim; d++) {\n    min[d] = 0;\n  }\n\n  \/\/ size_t min[] = {(indices,0)...};\n  \/\/ size_t max[] = {(tiling_info[indices].tile_size_dir)...};\n  \/\/ size_t stride[] = {(indices,1)...};\n\n  \/\/ size_t max[dim];\n  std::array<size_t, dim> max;\n  for (size_t d = 0; d < dim; d++) {\n    max[d] = tiling_info[d].tile_size_dir;\n  }\n  \/\/ std::array<size_t, dim> stride;\n  \/\/ std::fill_n(stride.begin(), dim, 1);\n\n  \/\/ size_t stride[dim];\n  std::array<size_t, dim> stride;\n  for (size_t d = 0; d < dim; d++) {\n    stride[d] = 1;\n  }\n\n  \/\/ std::cout << \"skipped cells: \" << skipped_blocks << std::endl;\n\n  \/\/ std::cout << \"min: \";\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/     if (d > 0) {\n  \/\/         std::cout << \", \";\n  \/\/     }\n  \/\/     std::cout << min[d];\n  \/\/ }\n  \/\/ std::cout << std::endl;\n\n  \/\/ std::cout << \"max: \";\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/     if (d > 0) {\n  \/\/         std::cout << \", \";\n  \/\/     }\n  \/\/     std::cout << max[d];\n  \/\/ }\n  \/\/ std::cout << std::endl;\n\n  \/\/ std::cout << \"stride: \";\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/     if (d > 0) {\n  \/\/         std::cout << \", \";\n  \/\/     }\n  \/\/     std::cout << stride[d];\n  \/\/ }\n  \/\/ std::cout << std::endl;\n\n  opttmp::loop::dynamic_loop_nest<dim>(\n      min, max, stride,\n      [&tiled, &org, &tiling_info, &tile_index,\n       skipped_blocks](const std::array<size_t, dim> &inner_index) {\n        \/\/                std::cout << \"inner_index: \";\n        \/\/                for (size_t d = 0; d < dim; d++) {\n        \/\/                    if (d > 0) {\n        \/\/                        std::cout << \", \";\n        \/\/                    }\n        \/\/                    std::cout << inner_index[d];\n        \/\/                }\n        \/\/                std::cout << std::endl;\n\n        size_t inner_flat_index = 0;\n        size_t cur_stride = 1;\n        for (size_t d = 0; d < dim; d++) {\n          inner_flat_index += inner_index[(dim - 1) - d] * cur_stride;\n          cur_stride *= tiling_info[(dim - 1) - d].tile_size_dir;\n        }\n        size_t original_flat_index = 0;\n        cur_stride = 1;\n\n        \/\/ std::cout << \"org index: \";\n        for (size_t d = 0; d < dim; d++) {\n          \/\/ if (d > 0) {\n          \/\/     std::cout << \", \";\n          \/\/ }\n          \/\/ std::cout << (tile_index[(dim - 1) - d] * tiling_info[(dim - 1) -\n          \/\/ d].tile_size_dir + inner_index[(dim - 1) - d]);\n          original_flat_index += (tile_index[(dim - 1) - d] *\n                                      tiling_info[(dim - 1) - d].tile_size_dir +\n                                  inner_index[(dim - 1) - d]) *\n                                 cur_stride;\n          cur_stride *= tiling_info[(dim - 1) - d].stride;\n        }\n        \/\/ std::cout << std::endl;\n        \/\/ std::cout << \"inner flat index: \" << inner_flat_index << std::endl;\n        \/\/ std::cout << \"inner skipped cells: \" << (skipped_blocks +\n        \/\/ inner_flat_index) << std::endl;\n        \/\/ std::cout << \"original flat index: \" << (original_flat_index) <<\n        \/\/ std::endl;\n        tiled[skipped_blocks + inner_flat_index] = org[original_flat_index];\n      });\n}\n\ntemplate <size_t dim, size_t cur_dim, typename T, typename U>\ntypename std::enable_if<cur_dim == dim, void>::type\ntile_dim(std::vector<T, U> &tiled, const std::vector<T, U> &org,\n         const std::vector<tiling_info_dim> &tiling_info,\n         std::array<size_t, dim> &tile_index) {\n  tile_dim_indices<dim, T>(tiled, org, tiling_info,\n                           tile_index); \/\/ , std::make_index_sequence<dim>()\n}\n\ntemplate <size_t dim, size_t cur_dim, typename T, typename U>\ntypename std::enable_if<cur_dim != dim, void>::type\ntile_dim(std::vector<T, U> &tiled, const std::vector<T, U> &org,\n         const std::vector<tiling_info_dim> &tiling_info,\n         std::array<size_t, dim> &partial_tile_index) {\n  const tiling_info_dim &cur_info = tiling_info[cur_dim];\n  for (size_t tile_index_1d = 0;\n       tile_index_1d < cur_info.stride \/ cur_info.tile_size_dir;\n       tile_index_1d += 1) {\n    partial_tile_index[cur_dim] = tile_index_1d;\n    tile_dim<dim, cur_dim + 1>(tiled, org, tiling_info, partial_tile_index);\n  }\n}\n}\n\n\/\/ dimension of matrix, dimension of tiles\ntemplate <size_t dim, typename T, typename U>\nstd::vector<T, U> make_tiled(std::vector<T, U> &org,\n                             const std::vector<tiling_info_dim> &tiling_info) {\n  std::vector<T, U> tiled;\n  tiled.resize(org.size());\n  if (tiling_info.size() != dim) {\n    throw memory_layout_exception(\n        \"tiling_info doesn't match specified dimension\");\n  }\n\n  std::array<size_t, dim> tile_index;\n  detail::tile_dim<dim, 0>(tiled, org, tiling_info, tile_index);\n\n  \/\/ \/\/ min, max index for iterating within tile\n  \/\/ std::array<size_t, dim> min;\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/   min[d] = 0;\n  \/\/ }\n  \/\/ std::array<size_t, dim> max;\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/   max[d] = tiling_info[d].tile_size_dir;\n  \/\/ }\n  \/\/ \/\/ required for dynamic_loop_nest\n  \/\/ std::array<size_t, dim> strides;\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/   strides[d] = 1;\n  \/\/ }\n\n  \/\/ \/\/ number of elements in dim\n  \/\/ std::array<size_t, dim> untiled_strides;\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/   untiled_strides[d] = tiling_info[d].stride;\n  \/\/ }\n\n  \/\/ memory_layout::iterate_tiles<2>(\n  \/\/     tiled, tiling_info, [&org, &untiled_strides, &tiling_info, &min, &max,\n  \/\/                          &strides](auto view) {\n  \/\/       std::array<size_t, dim> &tile_index = view.get_tile_index();\n\n  \/\/       std::array<size_t, dim> index_offset;\n  \/\/       \/\/ std::cout << \"---------next tile---------\" << std::endl;\n  \/\/       for (size_t d = 0; d < dim; d++) {\n  \/\/         index_offset[d] = tile_index[d] * tiling_info[d].tile_size_dir;\n  \/\/         \/\/ std::cout << \"index_offset[\" << d << \"] = \" << index_offset[d]\n  \/\/         <<\n  \/\/         \/\/ std::endl;\n  \/\/       }\n\n  \/\/       opttmp::loop::dynamic_loop_nest<dim>(\n  \/\/           min, max, strides,\n  \/\/           [&view, &org, &tiling_info, &index_offset,\n  \/\/            &untiled_strides](const std::array<size_t, dim> &inner_index) {\n  \/\/             std::array<size_t, dim> outer_index;\n  \/\/             for (size_t d = 0; d < dim; d++) {\n  \/\/               outer_index[d] = inner_index[d] + index_offset[d];\n  \/\/               \/\/ std::cout << \"outer_index[\" << d << \"] = \" <<\n  \/\/               outer_index[d]\n  \/\/               \/\/ << std::endl;\n  \/\/             }\n  \/\/             size_t flat_outer_index =\n  \/\/                 flat_index(outer_index, untiled_strides);\n  \/\/             \/\/ std::cout << \"flat_outer_index: \" << flat_outer_index <<\n  \/\/             \/\/ std::endl;\n  \/\/             \/\/ std::cout << \"view[index_offset] = \" << view[inner_index] <<\n  \/\/             \/\/ std::endl;\n  \/\/             view[inner_index] = org[flat_outer_index];\n  \/\/           });\n\n  \/\/     });\n\n  return tiled;\n}\n\n\/\/ dimension of matrix, dimension of tiles\n\/\/ undo tiling inplace\ntemplate <size_t dim, typename T, typename U>\nstd::vector<T, U> undo_tiling(std::vector<T, U> &tiled,\n                              const std::vector<tiling_info_dim> &tiling_info) {\n  std::vector<T, U> untiled(tiled.size());\n  \/\/ untiled.resize(tiled.size());\n  if (tiling_info.size() != dim) {\n    throw memory_layout_exception(\n        \"tiling_info doesn't match specified dimension\");\n  }\n\n  \/\/ min, max index for iterating within tile\n  std::array<size_t, dim> min;\n  for (size_t d = 0; d < dim; d++) {\n    min[d] = 0;\n  }\n  std::array<size_t, dim> max;\n  for (size_t d = 0; d < dim; d++) {\n    max[d] = tiling_info[d].tile_size_dir;\n  }\n  \/\/ required for dynamic_loop_nest\n  std::array<size_t, dim> strides;\n  for (size_t d = 0; d < dim; d++) {\n    strides[d] = 1;\n  }\n\n  \/\/ number of elements in dim\n  std::array<size_t, dim> untiled_strides;\n  for (size_t d = 0; d < dim; d++) {\n    untiled_strides[d] = tiling_info[d].stride;\n  }\n\n  memory_layout::iterate_tiles<2>(\n      tiled, tiling_info, [&untiled, &untiled_strides, &tiling_info, &min, &max,\n                           &strides](auto view) {\n        std::array<size_t, dim> &tile_index = view.get_tile_index();\n\n        std::array<size_t, dim> index_offset;\n        std::cout << \"---------next tile---------\" << std::endl;\n        for (size_t d = 0; d < dim; d++) {\n          index_offset[d] = tile_index[d] * tiling_info[d].tile_size_dir;\n          std::cout << \"index_offset[\" << d << \"] = \" << index_offset[d]\n                    << std::endl;\n        }\n\n        opttmp::loop::dynamic_loop_nest<dim>(\n            min, max, strides,\n            [&view, &untiled, &tiling_info, &index_offset,\n             &untiled_strides](const std::array<size_t, dim> &inner_index) {\n              std::array<size_t, dim> outer_index;\n              std::cout << \"untiled index \";\n              for (size_t d = 0; d < dim; d++) {\n                outer_index[d] = inner_index[d] + index_offset[d];\n                if (d > 0) {\n                    std::cout << \", \";\n                }\n                std::cout << outer_index[d];\n              }\n              size_t flat_outer_index =\n                  flat_index(outer_index, untiled_strides);\n              std::cout << \" flat_outer_index: \" << flat_outer_index;\n              std::cout << \" view[index_offset] = \" << view[inner_index]\n                        << std::endl;\n              untiled[flat_outer_index] = view[inner_index];\n            });\n\n      });\n  return untiled;\n}\n}\n<commit_msg>some cleanup<commit_after>#pragma once\n\n#include <algorithm>\n#include <array>\n#include <iostream>\n#include <vector>\n\n#include \"..\/loop\/loop_nest.hpp\"\n#include \"memory_layout_exception.hpp\"\n#include \"tile_iterator.hpp\"\n#include \"tiling_info_dim.hpp\"\n#include \"util.hpp\"\n\nnamespace memory_layout {\n\nnamespace detail {\n\ntemplate <size_t dim, typename T, typename U> \/\/ , size_t... indices\nvoid tile_dim_indices(\n    std::vector<T, U> &tiled, const std::vector<T, U> &org,\n    const std::vector<tiling_info_dim> &tiling_info,\n    std::array<size_t, dim> &tile_index) { \/\/ , std::index_sequence<indices...>\n  \/\/ std::cout << \"tile_index: \";\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/     if (d > 0) {\n  \/\/         std::cout << \", \";\n  \/\/     }\n  \/\/     std::cout << tile_index[d];\n  \/\/ }\n  \/\/ std::cout << std::endl;\n\n  size_t cur_stride = 1;\n  size_t skipped_blocks = 0;\n  for (size_t d = 0; d < dim; d++) {\n    skipped_blocks += tile_index[(dim - 1) - d] * cur_stride;\n    cur_stride *= (tiling_info[(dim - 1) - d].stride \/\n                   tiling_info[(dim - 1) - d].tile_size_dir);\n  }\n\n  \/\/ std::cout << \"skipped blocks: \" << skipped_blocks << std::endl;\n\n  for (size_t d = 0; d < dim; d++) {\n    skipped_blocks *= tiling_info[d].tile_size_dir;\n  }\n\n  \/\/ std::array<size_t, dim> min;\n  \/\/ std::fill_n(min.begin(), dim, 0);\n  \/\/ size_t min[dim];\n  std::array<size_t, dim> min;\n  for (size_t d = 0; d < dim; d++) {\n    min[d] = 0;\n  }\n\n  \/\/ size_t min[] = {(indices,0)...};\n  \/\/ size_t max[] = {(tiling_info[indices].tile_size_dir)...};\n  \/\/ size_t stride[] = {(indices,1)...};\n\n  \/\/ size_t max[dim];\n  std::array<size_t, dim> max;\n  for (size_t d = 0; d < dim; d++) {\n    max[d] = tiling_info[d].tile_size_dir;\n  }\n  \/\/ std::array<size_t, dim> stride;\n  \/\/ std::fill_n(stride.begin(), dim, 1);\n\n  \/\/ size_t stride[dim];\n  std::array<size_t, dim> stride;\n  for (size_t d = 0; d < dim; d++) {\n    stride[d] = 1;\n  }\n\n  \/\/ std::cout << \"skipped cells: \" << skipped_blocks << std::endl;\n\n  \/\/ std::cout << \"min: \";\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/     if (d > 0) {\n  \/\/         std::cout << \", \";\n  \/\/     }\n  \/\/     std::cout << min[d];\n  \/\/ }\n  \/\/ std::cout << std::endl;\n\n  \/\/ std::cout << \"max: \";\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/     if (d > 0) {\n  \/\/         std::cout << \", \";\n  \/\/     }\n  \/\/     std::cout << max[d];\n  \/\/ }\n  \/\/ std::cout << std::endl;\n\n  \/\/ std::cout << \"stride: \";\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/     if (d > 0) {\n  \/\/         std::cout << \", \";\n  \/\/     }\n  \/\/     std::cout << stride[d];\n  \/\/ }\n  \/\/ std::cout << std::endl;\n\n  opttmp::loop::dynamic_loop_nest<dim>(\n      min, max, stride,\n      [&tiled, &org, &tiling_info, &tile_index,\n       skipped_blocks](const std::array<size_t, dim> &inner_index) {\n        \/\/                std::cout << \"inner_index: \";\n        \/\/                for (size_t d = 0; d < dim; d++) {\n        \/\/                    if (d > 0) {\n        \/\/                        std::cout << \", \";\n        \/\/                    }\n        \/\/                    std::cout << inner_index[d];\n        \/\/                }\n        \/\/                std::cout << std::endl;\n\n        size_t inner_flat_index = 0;\n        size_t cur_stride = 1;\n        for (size_t d = 0; d < dim; d++) {\n          inner_flat_index += inner_index[(dim - 1) - d] * cur_stride;\n          cur_stride *= tiling_info[(dim - 1) - d].tile_size_dir;\n        }\n        size_t original_flat_index = 0;\n        cur_stride = 1;\n\n        \/\/ std::cout << \"org index: \";\n        for (size_t d = 0; d < dim; d++) {\n          \/\/ if (d > 0) {\n          \/\/     std::cout << \", \";\n          \/\/ }\n          \/\/ std::cout << (tile_index[(dim - 1) - d] * tiling_info[(dim - 1) -\n          \/\/ d].tile_size_dir + inner_index[(dim - 1) - d]);\n          original_flat_index += (tile_index[(dim - 1) - d] *\n                                      tiling_info[(dim - 1) - d].tile_size_dir +\n                                  inner_index[(dim - 1) - d]) *\n                                 cur_stride;\n          cur_stride *= tiling_info[(dim - 1) - d].stride;\n        }\n        \/\/ std::cout << std::endl;\n        \/\/ std::cout << \"inner flat index: \" << inner_flat_index << std::endl;\n        \/\/ std::cout << \"inner skipped cells: \" << (skipped_blocks +\n        \/\/ inner_flat_index) << std::endl;\n        \/\/ std::cout << \"original flat index: \" << (original_flat_index) <<\n        \/\/ std::endl;\n        tiled[skipped_blocks + inner_flat_index] = org[original_flat_index];\n      });\n}\n\ntemplate <size_t dim, size_t cur_dim, typename T, typename U>\ntypename std::enable_if<cur_dim == dim, void>::type\ntile_dim(std::vector<T, U> &tiled, const std::vector<T, U> &org,\n         const std::vector<tiling_info_dim> &tiling_info,\n         std::array<size_t, dim> &tile_index) {\n  tile_dim_indices<dim, T>(tiled, org, tiling_info,\n                           tile_index); \/\/ , std::make_index_sequence<dim>()\n}\n\ntemplate <size_t dim, size_t cur_dim, typename T, typename U>\ntypename std::enable_if<cur_dim != dim, void>::type\ntile_dim(std::vector<T, U> &tiled, const std::vector<T, U> &org,\n         const std::vector<tiling_info_dim> &tiling_info,\n         std::array<size_t, dim> &partial_tile_index) {\n  const tiling_info_dim &cur_info = tiling_info[cur_dim];\n  for (size_t tile_index_1d = 0;\n       tile_index_1d < cur_info.stride \/ cur_info.tile_size_dir;\n       tile_index_1d += 1) {\n    partial_tile_index[cur_dim] = tile_index_1d;\n    tile_dim<dim, cur_dim + 1>(tiled, org, tiling_info, partial_tile_index);\n  }\n}\n}\n\n\/\/ dimension of matrix, dimension of tiles\ntemplate <size_t dim, typename T, typename U>\nstd::vector<T, U> make_tiled(std::vector<T, U> &org,\n                             const std::vector<tiling_info_dim> &tiling_info) {\n  std::vector<T, U> tiled;\n  tiled.resize(org.size());\n  if (tiling_info.size() != dim) {\n    throw memory_layout_exception(\n        \"tiling_info doesn't match specified dimension\");\n  }\n\n  std::array<size_t, dim> tile_index;\n  detail::tile_dim<dim, 0>(tiled, org, tiling_info, tile_index);\n\n  \/\/ \/\/ min, max index for iterating within tile\n  \/\/ std::array<size_t, dim> min;\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/   min[d] = 0;\n  \/\/ }\n  \/\/ std::array<size_t, dim> max;\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/   max[d] = tiling_info[d].tile_size_dir;\n  \/\/ }\n  \/\/ \/\/ required for dynamic_loop_nest\n  \/\/ std::array<size_t, dim> strides;\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/   strides[d] = 1;\n  \/\/ }\n\n  \/\/ \/\/ number of elements in dim\n  \/\/ std::array<size_t, dim> untiled_strides;\n  \/\/ for (size_t d = 0; d < dim; d++) {\n  \/\/   untiled_strides[d] = tiling_info[d].stride;\n  \/\/ }\n\n  \/\/ memory_layout::iterate_tiles<2>(\n  \/\/     tiled, tiling_info, [&org, &untiled_strides, &tiling_info, &min, &max,\n  \/\/                          &strides](auto view) {\n  \/\/       std::array<size_t, dim> &tile_index = view.get_tile_index();\n\n  \/\/       std::array<size_t, dim> index_offset;\n  \/\/       \/\/ std::cout << \"---------next tile---------\" << std::endl;\n  \/\/       for (size_t d = 0; d < dim; d++) {\n  \/\/         index_offset[d] = tile_index[d] * tiling_info[d].tile_size_dir;\n  \/\/         \/\/ std::cout << \"index_offset[\" << d << \"] = \" << index_offset[d]\n  \/\/         <<\n  \/\/         \/\/ std::endl;\n  \/\/       }\n\n  \/\/       opttmp::loop::dynamic_loop_nest<dim>(\n  \/\/           min, max, strides,\n  \/\/           [&view, &org, &tiling_info, &index_offset,\n  \/\/            &untiled_strides](const std::array<size_t, dim> &inner_index) {\n  \/\/             std::array<size_t, dim> outer_index;\n  \/\/             for (size_t d = 0; d < dim; d++) {\n  \/\/               outer_index[d] = inner_index[d] + index_offset[d];\n  \/\/               \/\/ std::cout << \"outer_index[\" << d << \"] = \" <<\n  \/\/               outer_index[d]\n  \/\/               \/\/ << std::endl;\n  \/\/             }\n  \/\/             size_t flat_outer_index =\n  \/\/                 flat_index(outer_index, untiled_strides);\n  \/\/             \/\/ std::cout << \"flat_outer_index: \" << flat_outer_index <<\n  \/\/             \/\/ std::endl;\n  \/\/             \/\/ std::cout << \"view[index_offset] = \" << view[inner_index] <<\n  \/\/             \/\/ std::endl;\n  \/\/             view[inner_index] = org[flat_outer_index];\n  \/\/           });\n\n  \/\/     });\n\n  return tiled;\n}\n\n\/\/ dimension of matrix, dimension of tiles\n\/\/ undo tiling inplace\ntemplate <size_t dim, typename T, typename U>\nstd::vector<T, U> undo_tiling(std::vector<T, U> &tiled,\n                              const std::vector<tiling_info_dim> &tiling_info) {\n  std::vector<T, U> untiled(tiled.size());\n  \/\/ untiled.resize(tiled.size());\n  if (tiling_info.size() != dim) {\n    throw memory_layout_exception(\n        \"tiling_info doesn't match specified dimension\");\n  }\n\n  \/\/ min, max index for iterating within tile\n  std::array<size_t, dim> min;\n  for (size_t d = 0; d < dim; d++) {\n    min[d] = 0;\n  }\n  std::array<size_t, dim> max;\n  for (size_t d = 0; d < dim; d++) {\n    max[d] = tiling_info[d].tile_size_dir;\n  }\n  \/\/ required for dynamic_loop_nest\n  std::array<size_t, dim> strides;\n  for (size_t d = 0; d < dim; d++) {\n    strides[d] = 1;\n  }\n\n  \/\/ number of elements in dim\n  std::array<size_t, dim> untiled_strides;\n  for (size_t d = 0; d < dim; d++) {\n    untiled_strides[d] = tiling_info[d].stride;\n  }\n\n  memory_layout::iterate_tiles<2>(\n      tiled, tiling_info, [&untiled, &untiled_strides, &tiling_info, &min, &max,\n                           &strides](auto view) {\n        std::array<size_t, dim> &tile_index = view.get_tile_index();\n\n        std::array<size_t, dim> index_offset;\n        \/\/ std::cout << \"---------next tile---------\" << std::endl;\n        for (size_t d = 0; d < dim; d++) {\n          index_offset[d] = tile_index[d] * tiling_info[d].tile_size_dir;\n          \/\/ std::cout << \"index_offset[\" << d << \"] = \" << index_offset[d]\n          \/\/           << std::endl;\n        }\n\n        opttmp::loop::dynamic_loop_nest<dim>(\n            min, max, strides,\n            [&view, &untiled, &tiling_info, &index_offset,\n             &untiled_strides](const std::array<size_t, dim> &inner_index) {\n              std::array<size_t, dim> outer_index;\n              \/\/ std::cout << \"untiled index \";\n              for (size_t d = 0; d < dim; d++) {\n                outer_index[d] = inner_index[d] + index_offset[d];\n                \/\/ if (d > 0) {\n                \/\/     std::cout << \", \";\n                \/\/ }\n                \/\/ std::cout << outer_index[d];\n              }\n              size_t flat_outer_index =\n                  flat_index(outer_index, untiled_strides);\n              \/\/ std::cout << \" flat_outer_index: \" << flat_outer_index;\n              \/\/ std::cout << \" view[index_offset] = \" << view[inner_index]\n              \/\/           << std::endl;\n              untiled[flat_outer_index] = view[inner_index];\n            });\n\n      });\n  return untiled;\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <Windows.h>\n#include \"GL\/glew.h\"\n#include \"sys\/FsWindow.h\"\n#include \"util\/FsLog.h\"\n#include \"FsGlobal.h\"\n#include \"scheduler\/FsSchedulerTarget.h\"\n#include \"scheduler\/FsScheduler.h\"\n#include \"sys\/event\/FsTouchDispatcher.h\"\n\n\n\n#define FS_DEFAULT_WINDOW_WIDTH 640 \n#define FS_DEFAULT_WINDOW_HEIGHT 480\n#define FS_DEFAULT_WINDOW_BITS 32\n\nNS_FS_BEGIN\n\nclass PlatformWindow;\nclass EventGraper:public SchedulerTarget\n{\n\tpublic:\n\t\tstatic EventGraper* create(PlatformWindow* win);\n\n\tpublic:\n\t\t\/* inherit SchedulerTarget *\/\n\t\tvirtual void update(int priority,float dt);\n\n\tprotected:\n\t\tEventGraper();\n\tprivate:\n\t\tPlatformWindow* m_window;\n};\n\nEventGraper::EventGraper()\n{\n\tm_window=NULL;\n}\n\nEventGraper* EventGraper::create(PlatformWindow* win)\n{\n\tEventGraper* ret=new EventGraper;\n\tret->m_window=win;\n\treturn ret;\n}\n\nvoid EventGraper::update(int priority,float dt)\n{\n\tMSG msg;\n\twhile(PeekMessage(&msg,NULL,0,0,PM_REMOVE))\n\t{\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessage(&msg);\n\t}\n}\n\nclass PlatformWindow\n{\n\tpublic:\n\t\tHGLRC hrc; \n\t\tHDC hdc;\n\t\tHWND hwnd;\n\t\tHINSTANCE hinstance;\n\t\tEventGraper* m_eventGrap;\n\tprotected:\n\t\tbool initWin();\n\t\tbool initGL();\n\n\tpublic:\n\t\tstatic PlatformWindow* create();\n\t\tPlatformWindow();\n\t\t~PlatformWindow();\n\n};\n\n\nstatic bool pointInView(float x,float y)\n{\n\tif(x>=0&&x<=1.0f)\n\t{\n\t\tif(y>=0&&y<=1.0f)\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\nstatic void transformViewPoint(float* x,float* y)\n{\n\tint width=Global::window()->getWidth();\n\tint height=Global::window()->getHeight();\n\t*x=*x\/width;\n\t*y=*y\/height;\n\t*y=1.0f-*y;\n}\nstatic bool s_mouse_capture=false;\n\n\n\n\nLRESULT s_input_dialog_proc(HWND hDlg, UINT Msg, WPARAM wParam, LPARAM lParam)\n{\n     switch (Msg)\n     {\n     case WM_CLOSE: \n         DestroyWindow(hDlg); \n         return TRUE;\n         break;\n     case WM_DESTROY: \n         PostQuitMessage(0); \n         return TRUE;\n     };\n\t return DefWindowProc(hDlg,Msg,wParam,lParam);\n}\n\n\nLRESULT CALLBACK s_winproc(\n\t\tHWND hwnd,\n\t\tUINT umsg,\n\t\tWPARAM wparam,\n\t\tLPARAM lparam\n\t\t)\n{\n\n\tswitch(umsg)\n\t{\n\t\tcase WM_LBUTTONDOWN:\n\t\t\t{\n\t\t\t\tfloat x=(float)LOWORD(lparam);\n\t\t\t\tfloat y=(float)HIWORD(lparam);\n\t\t\t\ttransformViewPoint(&x,&y);\n\t\t\t\tif(pointInView(x,y))\n\t\t\t\t{\n\t\t\t\t\tTouchPoint p(0,x,y);\n\n\t\t\t\t\tGlobal::touchDispatcher()->dispatchEvent(\n\t\t\t\t\t\t\t\t\t\t\tnew TouchEvent(TouchDispatcher::TOUCHES_BEGIN,1,&p));\n\t\t\t\t\ts_mouse_capture=true;\n\t\t\t\t\tSetCapture(hwnd);\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t\tbreak;\n\t\tcase WM_MOUSEMOVE:\n\t\t\t{\n\t\t\t\tif(wparam==MK_LBUTTON&&s_mouse_capture)\n\t\t\t\t{\n\t\t\t\t\tfloat x=(float)LOWORD(lparam);\n\t\t\t\t\tfloat y=(float)HIWORD(lparam);\n\t\t\t\t\ttransformViewPoint(&x,&y);\n\n\t\t\t\t\tTouchPoint p(0,x,y);\n\n\t\t\t\t\tGlobal::touchDispatcher()->dispatchEvent(\n\t\t\t\t\t\t\t\t\t\t\tnew TouchEvent(TouchDispatcher::TOUCHES_MOVE,1,&p));\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase WM_LBUTTONUP:\n\t\t\t{\n\t\t\t\tif(s_mouse_capture)\n\t\t\t\t{\n\t\t\t\t\tfloat x=(float)LOWORD(lparam);\n\t\t\t\t\tfloat y=(float)HIWORD(lparam);\n\t\t\t\t\ttransformViewPoint(&x,&y);\n\n\t\t\t\t\tTouchPoint p(0,x,y);\n\t\t\t\t\tGlobal::touchDispatcher()->dispatchEvent(\n\t\t\t\t\t\t\t\t\t\t\tnew TouchEvent(TouchDispatcher::TOUCHES_END,1,&p));\n\t\t\t\t\tReleaseCapture();\n\t\t\t\t\ts_mouse_capture=false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase WM_CLOSE:\n\t\t\tGlobal::sysDispatcher()->dispatchEvent(new SysEvent(SysDispatcher::QUIT));\n\t\t\tbreak;\n\n\t\tcase WM_DESTROY:\n\t\t\tGlobal::scheduler()->stop();\n\t\t\tbreak;\n\n\t\tcase WM_KEYDOWN:\n\t\t\tGlobal::keypadDispatcher()->dispatchEvent(new KeypadEvent(wparam,KeypadEvent::KEYPAD_DOWN));\n\t\t\tbreak;\n\n\t\tcase WM_KEYUP:\n\t\t\tGlobal::keypadDispatcher()->dispatchEvent(new KeypadEvent(wparam,KeypadEvent::KEYPAD_UP));\n\t\t\tbreak;\n\n\t\tcase WM_SIZE:\n\t\t\t{\n\t\t\t\tswitch(wparam)\n\t\t\t\t{\n\t\t\t\t\tcase SIZE_RESTORED:\n\t\t\t\t\t\tGlobal::sysDispatcher()->dispatchEvent(new SysEvent(SysDispatcher::FOREGROUND));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase SIZE_MINIMIZED:\n\t\t\t\t\t\tGlobal::sysDispatcher()->dispatchEvent(new SysEvent(SysDispatcher::BACKGROUND));\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tint height = HIWORD( lparam );\n\t\t\t\tint width = LOWORD( lparam );\n\t\t\t\/\/\tFS_TRACE_WARN(\"width=%d,height=%d\",width,height);\n\t\t\t\tRender* render=Global::render();\n\t\t\t\tif(render)\n\t\t\t\t{\n\t\t\t\t\trender->setViewport(0,0,width,height);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\tdefault:\n\t\t\treturn DefWindowProc(hwnd,umsg,wparam,lparam);\n\t}\n\treturn 0;\n}\n\n\n\n\nstatic void SetupPixelFormat(HDC hDC)\n{\n\tint pixelFormat;\n\n\tPIXELFORMATDESCRIPTOR pfd =\n\t{\n\t\tsizeof(PIXELFORMATDESCRIPTOR),  \/\/ size\n\t\t1,                          \/\/ version\n\t\tPFD_SUPPORT_OPENGL |        \/\/ OpenGL window\n\t\tPFD_DRAW_TO_WINDOW |        \/\/ render to window\n\t\tPFD_DOUBLEBUFFER,           \/\/ support double-buffering\n\n\t\tPFD_TYPE_RGBA,              \/\/ color type\n\t\t32,                         \/\/ prefered color depth\n\t\t0, 0, 0, 0, 0, 0,           \/\/ color bits (ignored)\n\t\t0,                          \/\/ no alpha buffer\n\t\t0,                          \/\/ alpha bits (ignored)\n\t\t0,                          \/\/ no accumulation buffer\n\t\t0, 0, 0, 0,                 \/\/ accum bits (ignored)\n\t\t16,                         \/\/ depth buffer\n\t\t0,                          \/\/ no stencil buffer\n\t\t0,                          \/\/ no auxiliary buffers\n\t\tPFD_MAIN_PLANE,             \/\/ main layer\n\t\t0,                          \/\/ reserved\n\t\t0, 0, 0,                    \/\/ no layer, visible, damage masks\n\t};\n\n\tpixelFormat = ChoosePixelFormat(hDC, &pfd);\n\tSetPixelFormat(hDC, pixelFormat, &pfd);\n}\n\n\n\n\n\n\nPlatformWindow* PlatformWindow::create()\n{\n\tPlatformWindow* ret=new PlatformWindow;\n\tif(!ret->initWin())\n\t{\n\t\tdelete ret;\n\t\treturn NULL;\n\t}\n\treturn ret;\n}\nPlatformWindow::~PlatformWindow()\n{\n\tif(hrc)\n\t{\n\t\twglMakeCurrent(NULL,NULL);\n\t\twglDeleteContext(hrc);\n\t}\n\tif(hdc)\n\t{\n\t\tReleaseDC(hwnd,hdc);\n\t}\n\tif(hwnd)\n\t{\n\t\tDestroyWindow(hwnd);\n\t}\n\tUnregisterClass(\"FaerisWindow\",hinstance);\n\tGlobal::scheduler()->remove(m_eventGrap,Scheduler::HIGHEST);\n\tm_eventGrap->decRef();\n}\n\nPlatformWindow::PlatformWindow()\n{\n\thwnd=0;\n\thrc=0;\n\thdc=0;\n\thinstance=0;\n\tm_eventGrap=EventGraper::create(this);\n\tGlobal::scheduler()->add(m_eventGrap,Scheduler::HIGHEST);\n}\n\n\n\nbool PlatformWindow::initWin()\n{\n\n\thinstance=GetModuleHandle(NULL);\n\n\t\/* window class *\/\n\tWNDCLASS wc;\n\twc.style=CS_HREDRAW|CS_VREDRAW|CS_OWNDC;\n\twc.lpfnWndProc=(WNDPROC) s_winproc;\n\twc.cbClsExtra=0;\n\twc.cbWndExtra=0;\n\twc.hInstance=hinstance;\n\twc.hIcon=LoadIcon(NULL,IDI_WINLOGO);\n\twc.hCursor=LoadCursor(NULL,IDC_ARROW);\n\twc.hbrBackground=NULL;\n\twc.lpszMenuName=NULL;\n\twc.lpszClassName=\"FaerisWindow\";\n\tif(!RegisterClass(&wc))\n\t{\n\t\tFS_TRACE_WARN(\"RegisterClass Failed\");\n\t\treturn false;\n\t}\n\n\n\thwnd=CreateWindowEx(\n\t\t\tWS_EX_APPWINDOW|WS_EX_WINDOWEDGE,\n\t\t\t\"FaerisWindow\",\n\t\t\tTEXT(FS_DEFAULT_WINDOW_NAME),\n\t\t\tWS_CAPTION|WS_POPUPWINDOW|WS_MINIMIZEBOX,\n\t\t\t0,0,\n\t\t\tFS_DEFAULT_WINDOW_WIDTH,\n\t\t\tFS_DEFAULT_WINDOW_HEIGHT,\n\t\t\tNULL,\n\t\t\tNULL,\n\t\t\thinstance,\n\t\t\tNULL);\n\tif(!hwnd)\n\t{\n\t\tFS_TRACE_WARN(\"CreateWindow Failed\");\n\t\treturn false;\n\t}\n\tif(!initGL())\n\t{\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool PlatformWindow::initGL()\n{\n\thdc=GetDC(hwnd);\n\tSetupPixelFormat(hdc);\n\thrc=wglCreateContext(hdc);\n\twglMakeCurrent(hdc,hrc);\n\tconst GLubyte* gl_version=glGetString(GL_VERSION);\n\tFsUtil_Log(\"OpenGL Version=%s\",gl_version);\n\tif(atof((char*)gl_version)<1.5)\n\t{\n\t\tchar str_compain[256]={0};\n\t\tsprintf(str_compain,\"OpenGL 1.5 or higher is required(your version is %s), \\\n\t\t\t\tplease upgrade the driver of your video card\",gl_version);\n\t\tFsUtil_Log(\"%s\",str_compain);\n\t\treturn false;\n\t}\n\tGLenum ret=glewInit();\n\tif(ret!=GLEW_OK)\n\t{\n\t\tFsUtil_Log(\"Init Glew Failed %s\",glewGetErrorString(ret));\n\t\treturn false;\n\t}\n\treturn true;\n\n}\n\n\nWindow* Window::create()\n{\n\tPlatformWindow* plt_window=PlatformWindow::create();\n\tif(plt_window==NULL)\n\t{\n\t\treturn NULL;\n\t}\n\tWindow* ret=new Window;\n\tret->m_window=plt_window;\n\treturn ret;\n}\n\nvoid Window::makeCurrent(Render* r)\n{\n\tif(m_window)\n\t{\n\t\twglMakeCurrent(m_window->hdc,m_window->hrc);\n\t}\n\tm_render=r;\n}\n\nvoid Window::loseCurrent(Render* r)\n{\n\tif(m_window)\n\t{\n\t\twglMakeCurrent(NULL,m_window->hrc);\n\t}\n\tm_render=NULL;\n}\n\nvoid Window::swapBuffers()\n{\n\tif(m_window)\n\t{\n\t\t::SwapBuffers(m_window->hdc);\n\t}\n}\n\nvoid Window::setCaption(const char* name)\n{\n\n\tif(m_window)\n\t{\n\t\tSetWindowTextA(m_window->hwnd,name);\n\t\tm_caption=name;\n\t}\n}\n\nvoid Window::setPosition(int x,int y)\n{\n\tif(m_window)\n\t{\n\t\tSetWindowPos(m_window->hwnd, 0, x, y, 0, 0, SWP_NOCOPYBITS | SWP_NOSIZE | SWP_NOOWNERZORDER | SWP_NOZORDER);\n\t}\n}\n\nvoid Window::setSize(uint width,uint height)\n{\n\tif(!m_window)\n\t{\n\t\treturn;\n\t}\n\tRECT w_rect;\n\tRECT c_rect;\n\tGetWindowRect(m_window->hwnd,&w_rect);\n\tGetClientRect(m_window->hwnd,&c_rect);\n\tPOINT diff;\n\tdiff.x=(w_rect.right-w_rect.left)-c_rect.right;\n\tdiff.y=(w_rect.bottom-w_rect.top)-c_rect.bottom;\n\n\tc_rect.right=c_rect.left+width;\n\tc_rect.bottom=c_rect.top+height;\n\n\tAdjustWindowRectEx(&c_rect,\n\t\t\tGetWindowLong(m_window->hwnd,GWL_STYLE),\n\t\t\tFALSE,\n\t\t\tGetWindowLong(m_window->hwnd,GWL_EXSTYLE)\n\t\t\t);\n\n\tSetWindowPos(m_window->hwnd,0,0,0,width+diff.x,height+diff.y,\n\t\t\tSWP_NOCOPYBITS|SWP_NOMOVE|SWP_NOOWNERZORDER|SWP_NOZORDER\n\t\t\t);\n}\n\nvoid Window::show()\n{\n\tif(m_window)\n\t{\n\t\tShowWindow(m_window->hwnd,SW_SHOW);\n\t}\n\n}\n\nvoid Window::hide()\n{\n\tif(m_window)\n\t{\n\t\tShowWindow(m_window->hwnd,SW_HIDE);\n\t}\n}\n\nvoid Window::setStyle(long flags)\n{\n}\n\nvoid Window::setFullScreen(bool full)\n{\n}\n\nint Window::getWidth() \n{\n\tif(m_window)\n\t{\n\t\tRECT rect;\n\t\tGetClientRect(m_window->hwnd,&rect);\n\t\treturn rect.right-rect.left;\n\t}\n\treturn 0;\n}\n\nint Window::getHeight()\n{\n\tif(m_window)\n\t{\n\t\tRECT rect;\n\t\tGetClientRect(m_window->hwnd,&rect);\n\t\treturn rect.bottom-rect.top;\n\t}\n\treturn 0;\n}\n\nint Window::getPosX()\n{\n\tif(m_window)\n\t{\n\t\tRECT w_rect;\n\t\tGetWindowRect(m_window->hwnd,&w_rect);\n\t\treturn w_rect.left;\n\t}\n\treturn 0;\n}\n\nint Window::getPosY() \n{\n\tif(m_window)\n\t{\n\t\tRECT w_rect;\n\t\tGetWindowRect(m_window->hwnd,&w_rect);\n\t\treturn w_rect.top;\n\t}\n\treturn 0;\n}\n\n\nWindow::~Window()\n{\n\tif(m_render)\n\t{\n\t\tm_render->setRenderTarget(NULL);\n\t\tm_render=NULL;\n\t}\n\tdelete m_window;\n\tm_window=NULL;\n\n}\n\n\n\/* input method dialog *\/\n\n\n\n\n\n\nNS_FS_END \n\n\n<commit_msg>@fixbug:wrong touch event coord when mouse move outof window for win32<commit_after>#include <Windows.h>\n#include \"GL\/glew.h\"\n#include \"sys\/FsWindow.h\"\n#include \"util\/FsLog.h\"\n#include \"FsGlobal.h\"\n#include \"scheduler\/FsSchedulerTarget.h\"\n#include \"scheduler\/FsScheduler.h\"\n#include \"sys\/event\/FsTouchDispatcher.h\"\n\n\n\n#define FS_DEFAULT_WINDOW_WIDTH 640 \n#define FS_DEFAULT_WINDOW_HEIGHT 480\n#define FS_DEFAULT_WINDOW_BITS 32\n\nNS_FS_BEGIN\n\nclass PlatformWindow;\nclass EventGraper:public SchedulerTarget\n{\n\tpublic:\n\t\tstatic EventGraper* create(PlatformWindow* win);\n\n\tpublic:\n\t\t\/* inherit SchedulerTarget *\/\n\t\tvirtual void update(int priority,float dt);\n\n\tprotected:\n\t\tEventGraper();\n\tprivate:\n\t\tPlatformWindow* m_window;\n};\n\nEventGraper::EventGraper()\n{\n\tm_window=NULL;\n}\n\nEventGraper* EventGraper::create(PlatformWindow* win)\n{\n\tEventGraper* ret=new EventGraper;\n\tret->m_window=win;\n\treturn ret;\n}\n\nvoid EventGraper::update(int priority,float dt)\n{\n\tMSG msg;\n\twhile(PeekMessage(&msg,NULL,0,0,PM_REMOVE))\n\t{\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessage(&msg);\n\t}\n}\n\nclass PlatformWindow\n{\n\tpublic:\n\t\tHGLRC hrc; \n\t\tHDC hdc;\n\t\tHWND hwnd;\n\t\tHINSTANCE hinstance;\n\t\tEventGraper* m_eventGrap;\n\tprotected:\n\t\tbool initWin();\n\t\tbool initGL();\n\n\tpublic:\n\t\tstatic PlatformWindow* create();\n\t\tPlatformWindow();\n\t\t~PlatformWindow();\n\n};\n\n\nstatic bool pointInView(float x,float y)\n{\n\tif(x>=0&&x<=1.0f)\n\t{\n\t\tif(y>=0&&y<=1.0f)\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\nstatic void transformViewPoint(float* x,float* y)\n{\n\tint width=Global::window()->getWidth();\n\tint height=Global::window()->getHeight();\n\t*x=*x\/width;\n\t*y=*y\/height;\n\t*y=1.0f-*y;\n}\nstatic bool s_mouse_capture=false;\n\n\n\n\nLRESULT s_input_dialog_proc(HWND hDlg, UINT Msg, WPARAM wParam, LPARAM lParam)\n{\n     switch (Msg)\n     {\n     case WM_CLOSE: \n         DestroyWindow(hDlg); \n         return TRUE;\n         break;\n     case WM_DESTROY: \n         PostQuitMessage(0); \n         return TRUE;\n     };\n\t return DefWindowProc(hDlg,Msg,wParam,lParam);\n}\n\n\nLRESULT CALLBACK s_winproc(\n\t\tHWND hwnd,\n\t\tUINT umsg,\n\t\tWPARAM wparam,\n\t\tLPARAM lparam\n\t\t)\n{\n\n\tswitch(umsg)\n\t{\n\t\tcase WM_LBUTTONDOWN:\n\t\t\t{\n\t\t\t\tfloat x=(float)(short)LOWORD(lparam);\n\t\t\t\tfloat y=(float)(short)HIWORD(lparam);\n\t\t\t\ttransformViewPoint(&x,&y);\n\t\t\t\tif(pointInView(x,y))\n\t\t\t\t{\n\t\t\t\t\tTouchPoint p(0,x,y);\n\n\t\t\t\t\tGlobal::touchDispatcher()->dispatchEvent(\n\t\t\t\t\t\t\t\t\t\t\tnew TouchEvent(TouchDispatcher::TOUCHES_BEGIN,1,&p));\n\t\t\t\t\ts_mouse_capture=true;\n\t\t\t\t\tSetCapture(hwnd);\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t\tbreak;\n\t\tcase WM_MOUSEMOVE:\n\t\t\t{\n\t\t\t\tif(wparam==MK_LBUTTON&&s_mouse_capture)\n\t\t\t\t{\n\t\t\t\t\tfloat x=(float)(short)LOWORD(lparam);\n\t\t\t\t\tfloat y=(float)(short)HIWORD(lparam);\n\t\t\t\t\ttransformViewPoint(&x,&y);\n\n\t\t\t\t\tTouchPoint p(0,x,y);\n\n\t\t\t\t\tGlobal::touchDispatcher()->dispatchEvent(\n\t\t\t\t\t\t\t\t\t\t\tnew TouchEvent(TouchDispatcher::TOUCHES_MOVE,1,&p));\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase WM_LBUTTONUP:\n\t\t\t{\n\t\t\t\tif(s_mouse_capture)\n\t\t\t\t{\n\t\t\t\t\tfloat x=(float)(short)LOWORD(lparam);\n\t\t\t\t\tfloat y=(float)(short)HIWORD(lparam);\n\t\t\t\t\ttransformViewPoint(&x,&y);\n\n\t\t\t\t\tTouchPoint p(0,x,y);\n\t\t\t\t\tGlobal::touchDispatcher()->dispatchEvent(\n\t\t\t\t\t\t\t\t\t\t\tnew TouchEvent(TouchDispatcher::TOUCHES_END,1,&p));\n\t\t\t\t\tReleaseCapture();\n\t\t\t\t\ts_mouse_capture=false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase WM_CLOSE:\n\t\t\tGlobal::sysDispatcher()->dispatchEvent(new SysEvent(SysDispatcher::QUIT));\n\t\t\tbreak;\n\n\t\tcase WM_DESTROY:\n\t\t\tGlobal::scheduler()->stop();\n\t\t\tbreak;\n\n\t\tcase WM_KEYDOWN:\n\t\t\tGlobal::keypadDispatcher()->dispatchEvent(new KeypadEvent(wparam,KeypadEvent::KEYPAD_DOWN));\n\t\t\tbreak;\n\n\t\tcase WM_KEYUP:\n\t\t\tGlobal::keypadDispatcher()->dispatchEvent(new KeypadEvent(wparam,KeypadEvent::KEYPAD_UP));\n\t\t\tbreak;\n\n\t\tcase WM_SIZE:\n\t\t\t{\n\t\t\t\tswitch(wparam)\n\t\t\t\t{\n\t\t\t\t\tcase SIZE_RESTORED:\n\t\t\t\t\t\tGlobal::sysDispatcher()->dispatchEvent(new SysEvent(SysDispatcher::FOREGROUND));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase SIZE_MINIMIZED:\n\t\t\t\t\t\tGlobal::sysDispatcher()->dispatchEvent(new SysEvent(SysDispatcher::BACKGROUND));\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tint height = HIWORD( lparam );\n\t\t\t\tint width = LOWORD( lparam );\n\t\t\t\/\/\tFS_TRACE_WARN(\"width=%d,height=%d\",width,height);\n\t\t\t\tRender* render=Global::render();\n\t\t\t\tif(render)\n\t\t\t\t{\n\t\t\t\t\trender->setViewport(0,0,width,height);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\tdefault:\n\t\t\treturn DefWindowProc(hwnd,umsg,wparam,lparam);\n\t}\n\treturn 0;\n}\n\n\n\n\nstatic void SetupPixelFormat(HDC hDC)\n{\n\tint pixelFormat;\n\n\tPIXELFORMATDESCRIPTOR pfd =\n\t{\n\t\tsizeof(PIXELFORMATDESCRIPTOR),  \/\/ size\n\t\t1,                          \/\/ version\n\t\tPFD_SUPPORT_OPENGL |        \/\/ OpenGL window\n\t\tPFD_DRAW_TO_WINDOW |        \/\/ render to window\n\t\tPFD_DOUBLEBUFFER,           \/\/ support double-buffering\n\n\t\tPFD_TYPE_RGBA,              \/\/ color type\n\t\t32,                         \/\/ prefered color depth\n\t\t0, 0, 0, 0, 0, 0,           \/\/ color bits (ignored)\n\t\t0,                          \/\/ no alpha buffer\n\t\t0,                          \/\/ alpha bits (ignored)\n\t\t0,                          \/\/ no accumulation buffer\n\t\t0, 0, 0, 0,                 \/\/ accum bits (ignored)\n\t\t16,                         \/\/ depth buffer\n\t\t0,                          \/\/ no stencil buffer\n\t\t0,                          \/\/ no auxiliary buffers\n\t\tPFD_MAIN_PLANE,             \/\/ main layer\n\t\t0,                          \/\/ reserved\n\t\t0, 0, 0,                    \/\/ no layer, visible, damage masks\n\t};\n\n\tpixelFormat = ChoosePixelFormat(hDC, &pfd);\n\tSetPixelFormat(hDC, pixelFormat, &pfd);\n}\n\n\n\n\n\n\nPlatformWindow* PlatformWindow::create()\n{\n\tPlatformWindow* ret=new PlatformWindow;\n\tif(!ret->initWin())\n\t{\n\t\tdelete ret;\n\t\treturn NULL;\n\t}\n\treturn ret;\n}\nPlatformWindow::~PlatformWindow()\n{\n\tif(hrc)\n\t{\n\t\twglMakeCurrent(NULL,NULL);\n\t\twglDeleteContext(hrc);\n\t}\n\tif(hdc)\n\t{\n\t\tReleaseDC(hwnd,hdc);\n\t}\n\tif(hwnd)\n\t{\n\t\tDestroyWindow(hwnd);\n\t}\n\tUnregisterClass(\"FaerisWindow\",hinstance);\n\tGlobal::scheduler()->remove(m_eventGrap,Scheduler::HIGHEST);\n\tm_eventGrap->decRef();\n}\n\nPlatformWindow::PlatformWindow()\n{\n\thwnd=0;\n\thrc=0;\n\thdc=0;\n\thinstance=0;\n\tm_eventGrap=EventGraper::create(this);\n\tGlobal::scheduler()->add(m_eventGrap,Scheduler::HIGHEST);\n}\n\n\n\nbool PlatformWindow::initWin()\n{\n\n\thinstance=GetModuleHandle(NULL);\n\n\t\/* window class *\/\n\tWNDCLASS wc;\n\twc.style=CS_HREDRAW|CS_VREDRAW|CS_OWNDC;\n\twc.lpfnWndProc=(WNDPROC) s_winproc;\n\twc.cbClsExtra=0;\n\twc.cbWndExtra=0;\n\twc.hInstance=hinstance;\n\twc.hIcon=LoadIcon(NULL,IDI_WINLOGO);\n\twc.hCursor=LoadCursor(NULL,IDC_ARROW);\n\twc.hbrBackground=NULL;\n\twc.lpszMenuName=NULL;\n\twc.lpszClassName=\"FaerisWindow\";\n\tif(!RegisterClass(&wc))\n\t{\n\t\tFS_TRACE_WARN(\"RegisterClass Failed\");\n\t\treturn false;\n\t}\n\n\n\thwnd=CreateWindowEx(\n\t\t\tWS_EX_APPWINDOW|WS_EX_WINDOWEDGE,\n\t\t\t\"FaerisWindow\",\n\t\t\tTEXT(FS_DEFAULT_WINDOW_NAME),\n\t\t\tWS_CAPTION|WS_POPUPWINDOW|WS_MINIMIZEBOX,\n\t\t\t0,0,\n\t\t\tFS_DEFAULT_WINDOW_WIDTH,\n\t\t\tFS_DEFAULT_WINDOW_HEIGHT,\n\t\t\tNULL,\n\t\t\tNULL,\n\t\t\thinstance,\n\t\t\tNULL);\n\tif(!hwnd)\n\t{\n\t\tFS_TRACE_WARN(\"CreateWindow Failed\");\n\t\treturn false;\n\t}\n\tif(!initGL())\n\t{\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool PlatformWindow::initGL()\n{\n\thdc=GetDC(hwnd);\n\tSetupPixelFormat(hdc);\n\thrc=wglCreateContext(hdc);\n\twglMakeCurrent(hdc,hrc);\n\tconst GLubyte* gl_version=glGetString(GL_VERSION);\n\tFsUtil_Log(\"OpenGL Version=%s\",gl_version);\n\tif(atof((char*)gl_version)<1.5)\n\t{\n\t\tchar str_compain[256]={0};\n\t\tsprintf(str_compain,\"OpenGL 1.5 or higher is required(your version is %s), \\\n\t\t\t\tplease upgrade the driver of your video card\",gl_version);\n\t\tFsUtil_Log(\"%s\",str_compain);\n\t\treturn false;\n\t}\n\tGLenum ret=glewInit();\n\tif(ret!=GLEW_OK)\n\t{\n\t\tFsUtil_Log(\"Init Glew Failed %s\",glewGetErrorString(ret));\n\t\treturn false;\n\t}\n\treturn true;\n\n}\n\n\nWindow* Window::create()\n{\n\tPlatformWindow* plt_window=PlatformWindow::create();\n\tif(plt_window==NULL)\n\t{\n\t\treturn NULL;\n\t}\n\tWindow* ret=new Window;\n\tret->m_window=plt_window;\n\treturn ret;\n}\n\nvoid Window::makeCurrent(Render* r)\n{\n\tif(m_window)\n\t{\n\t\twglMakeCurrent(m_window->hdc,m_window->hrc);\n\t}\n\tm_render=r;\n}\n\nvoid Window::loseCurrent(Render* r)\n{\n\tif(m_window)\n\t{\n\t\twglMakeCurrent(NULL,m_window->hrc);\n\t}\n\tm_render=NULL;\n}\n\nvoid Window::swapBuffers()\n{\n\tif(m_window)\n\t{\n\t\t::SwapBuffers(m_window->hdc);\n\t}\n}\n\nvoid Window::setCaption(const char* name)\n{\n\n\tif(m_window)\n\t{\n\t\tSetWindowTextA(m_window->hwnd,name);\n\t\tm_caption=name;\n\t}\n}\n\nvoid Window::setPosition(int x,int y)\n{\n\tif(m_window)\n\t{\n\t\tSetWindowPos(m_window->hwnd, 0, x, y, 0, 0, SWP_NOCOPYBITS | SWP_NOSIZE | SWP_NOOWNERZORDER | SWP_NOZORDER);\n\t}\n}\n\nvoid Window::setSize(uint width,uint height)\n{\n\tif(!m_window)\n\t{\n\t\treturn;\n\t}\n\tRECT w_rect;\n\tRECT c_rect;\n\tGetWindowRect(m_window->hwnd,&w_rect);\n\tGetClientRect(m_window->hwnd,&c_rect);\n\tPOINT diff;\n\tdiff.x=(w_rect.right-w_rect.left)-c_rect.right;\n\tdiff.y=(w_rect.bottom-w_rect.top)-c_rect.bottom;\n\n\tc_rect.right=c_rect.left+width;\n\tc_rect.bottom=c_rect.top+height;\n\n\tAdjustWindowRectEx(&c_rect,\n\t\t\tGetWindowLong(m_window->hwnd,GWL_STYLE),\n\t\t\tFALSE,\n\t\t\tGetWindowLong(m_window->hwnd,GWL_EXSTYLE)\n\t\t\t);\n\n\tSetWindowPos(m_window->hwnd,0,0,0,width+diff.x,height+diff.y,\n\t\t\tSWP_NOCOPYBITS|SWP_NOMOVE|SWP_NOOWNERZORDER|SWP_NOZORDER\n\t\t\t);\n}\n\nvoid Window::show()\n{\n\tif(m_window)\n\t{\n\t\tShowWindow(m_window->hwnd,SW_SHOW);\n\t}\n\n}\n\nvoid Window::hide()\n{\n\tif(m_window)\n\t{\n\t\tShowWindow(m_window->hwnd,SW_HIDE);\n\t}\n}\n\nvoid Window::setStyle(long flags)\n{\n}\n\nvoid Window::setFullScreen(bool full)\n{\n}\n\nint Window::getWidth() \n{\n\tif(m_window)\n\t{\n\t\tRECT rect;\n\t\tGetClientRect(m_window->hwnd,&rect);\n\t\treturn rect.right-rect.left;\n\t}\n\treturn 0;\n}\n\nint Window::getHeight()\n{\n\tif(m_window)\n\t{\n\t\tRECT rect;\n\t\tGetClientRect(m_window->hwnd,&rect);\n\t\treturn rect.bottom-rect.top;\n\t}\n\treturn 0;\n}\n\nint Window::getPosX()\n{\n\tif(m_window)\n\t{\n\t\tRECT w_rect;\n\t\tGetWindowRect(m_window->hwnd,&w_rect);\n\t\treturn w_rect.left;\n\t}\n\treturn 0;\n}\n\nint Window::getPosY() \n{\n\tif(m_window)\n\t{\n\t\tRECT w_rect;\n\t\tGetWindowRect(m_window->hwnd,&w_rect);\n\t\treturn w_rect.top;\n\t}\n\treturn 0;\n}\n\n\nWindow::~Window()\n{\n\tif(m_render)\n\t{\n\t\tm_render->setRenderTarget(NULL);\n\t\tm_render=NULL;\n\t}\n\tdelete m_window;\n\tm_window=NULL;\n\n}\n\n\n\/* input method dialog *\/\n\n\n\n\n\n\nNS_FS_END \n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n#include <set>\n\n#include <llvm\/Config\/llvm-config.h>\n#if ((LLVM_VERSION_MAJOR == 3) && (LLVM_VERSION_MINOR < 5))\n#include <llvm\/Support\/CFG.h>\n#else\n#include <llvm\/IR\/CFG.h>\n#endif\n\n#include <llvm\/IR\/Constant.h>\n#include <llvm\/IR\/Constants.h>\n#include <llvm\/IR\/DataLayout.h>\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/Instruction.h>\n#include <llvm\/IR\/Instructions.h>\n#include <llvm\/IR\/IntrinsicInst.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/Support\/raw_os_ostream.h>\n\n#include <llvm\/IR\/Dominators.h>\n\n#include \"dg\/ADT\/Queue.h\"\n#include \"dg\/llvm\/PointerAnalysis\/PointerGraph.h\"\n\n#include \"llvm\/ForkJoin\/ForkJoin.h\"\n#include \"llvm\/ReadWriteGraph\/LLVMReadWriteGraphBuilder.h\"\n#include \"llvm\/llvm-utils.h\"\n\nnamespace dg {\nnamespace dda {\n\nllvm::raw_ostream &operator<<(llvm::raw_ostream &os, const ValInfo &vi) {\n    using namespace llvm;\n\n    if (const auto *I = dyn_cast<Instruction>(vi.v)) {\n        os << I->getParent()->getParent()->getName();\n        if (auto &DL = I->getDebugLoc()) {\n            os << \" (line \" << DL.getLine() << \", col\" << DL.getCol() << \")\";\n        }\n        os << \" :: \" << *I;\n    } else if (const auto *A = dyn_cast<Argument>(vi.v)) {\n        os << A->getParent()->getParent()->getName() << \":: (arg) \" << *A;\n    } else if (const auto *F = dyn_cast<Function>(vi.v)) {\n        os << \"(func) \" << F->getName();\n    } else {\n        os << *vi.v;\n    }\n\n    return os;\n}\n\n\/\/\/\n\/\/ Map pointers of 'val' to def-sites.\n\/\/ \\param where  location in the program, for debugging\n\/\/ \\param size is the number of bytes used from the memory\nstd::vector<DefSite>\nLLVMReadWriteGraphBuilder::mapPointers(const llvm::Value *where,\n                                       const llvm::Value *val, Offset size) {\n    std::vector<DefSite> result;\n\n    auto psn = PTA->getLLVMPointsToChecked(val);\n    if (!psn.first) {\n        result.emplace_back(UNKNOWN_MEMORY);\n#ifndef NDEBUG\n        llvm::errs() << \"[RWG] warning at: \" << ValInfo(where) << \"\\n\";\n        llvm::errs() << \"No points-to set for: \" << ValInfo(val) << \"\\n\";\n#endif\n        \/\/ don't have points-to information for used pointer\n        return result;\n    }\n\n    if (psn.second.empty()) {\n#ifndef NDEBUG\n        llvm::errs() << \"[RWG] warning at: \" << ValInfo(where) << \"\\n\";\n        llvm::errs() << \"Empty points-to set for: \" << ValInfo(val) << \"\\n\";\n#endif\n        \/\/ this may happen on invalid reads and writes to memory,\n        \/\/ like when you try for example this:\n        \/\/\n        \/\/   int p, q;\n        \/\/   memcpy(p, q, sizeof p);\n        \/\/\n        \/\/ (there should be &p and &q)\n        \/\/ NOTE: maybe this is a bit strong to say unknown memory,\n        \/\/ but better be sound then incorrect\n        result.emplace_back(UNKNOWN_MEMORY);\n        return result;\n    }\n\n    result.reserve(psn.second.size());\n\n    if (psn.second.hasUnknown()) {\n        result.emplace_back(UNKNOWN_MEMORY);\n    }\n\n    for (const auto &ptr : psn.second) {\n        if (llvm::isa<llvm::Function>(ptr.value))\n            continue;\n\n        RWNode *ptrNode = getOperand(ptr.value);\n        if (!ptrNode) {\n            \/\/ keeping such set is faster then printing it all to terminal\n            \/\/ ... and we don't flood the terminal that way\n            static std::set<const llvm::Value *> warned;\n            if (warned.insert(ptr.value).second) {\n                llvm::errs() << \"[RWG] error at \" << ValInfo(where) << \"\\n\";\n                llvm::errs() << \"[RWG] error for \" << ValInfo(val) << \"\\n\";\n                llvm::errs() << \"[RWG] error: Cannot find node for \"\n                             << ValInfo(ptr.value) << \"\\n\";\n            }\n            continue;\n        }\n\n        \/\/ FIXME: we should pass just size to the DefSite ctor, but the old code\n        \/\/ relies on the behavior that when offset is unknown, the length is\n        \/\/ also unknown. So for now, mimic the old code. Remove it once we fix\n        \/\/ the old code.\n        result.emplace_back(ptrNode, ptr.offset,\n                            ptr.offset.isUnknown() ? Offset::UNKNOWN : size);\n    }\n\n    return result;\n}\n\nRWNode *LLVMReadWriteGraphBuilder::getOperand(const llvm::Value *val) {\n    auto *op = getNode(val);\n    if (!op) {\n        \/\/ lazily create allocations as these are targets in defsites\n        \/\/ and may not have been created yet\n        if (llvm::isa<llvm::AllocaInst>(val) ||\n            \/\/ FIXME: check that it is allocation\n            llvm::isa<llvm::CallInst>(val)) {\n            op = buildNode(val).getRepresentant();\n        }\n\n        if (!op) {\n            llvm::errs() << \"[RWG] error: cannot find an operand: \" << *val\n                         << \"\\n\";\n            abort();\n        }\n    }\n    assert(op && \"Do not have an operand\");\n    return op;\n}\n\n} \/\/ namespace dda\n} \/\/ namespace dg\n<commit_msg>rwg: add a missing space in a message<commit_after>#include <cassert>\n#include <set>\n\n#include <llvm\/Config\/llvm-config.h>\n#if ((LLVM_VERSION_MAJOR == 3) && (LLVM_VERSION_MINOR < 5))\n#include <llvm\/Support\/CFG.h>\n#else\n#include <llvm\/IR\/CFG.h>\n#endif\n\n#include <llvm\/IR\/Constant.h>\n#include <llvm\/IR\/Constants.h>\n#include <llvm\/IR\/DataLayout.h>\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/Instruction.h>\n#include <llvm\/IR\/Instructions.h>\n#include <llvm\/IR\/IntrinsicInst.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/Support\/raw_os_ostream.h>\n\n#include <llvm\/IR\/Dominators.h>\n\n#include \"dg\/ADT\/Queue.h\"\n#include \"dg\/llvm\/PointerAnalysis\/PointerGraph.h\"\n\n#include \"llvm\/ForkJoin\/ForkJoin.h\"\n#include \"llvm\/ReadWriteGraph\/LLVMReadWriteGraphBuilder.h\"\n#include \"llvm\/llvm-utils.h\"\n\nnamespace dg {\nnamespace dda {\n\nllvm::raw_ostream &operator<<(llvm::raw_ostream &os, const ValInfo &vi) {\n    using namespace llvm;\n\n    if (const auto *I = dyn_cast<Instruction>(vi.v)) {\n        os << I->getParent()->getParent()->getName();\n        if (auto &DL = I->getDebugLoc()) {\n            os << \" (line \" << DL.getLine() << \", col \" << DL.getCol() << \")\";\n        }\n        os << \" :: \" << *I;\n    } else if (const auto *A = dyn_cast<Argument>(vi.v)) {\n        os << A->getParent()->getParent()->getName() << \":: (arg) \" << *A;\n    } else if (const auto *F = dyn_cast<Function>(vi.v)) {\n        os << \"(func) \" << F->getName();\n    } else {\n        os << *vi.v;\n    }\n\n    return os;\n}\n\n\/\/\/\n\/\/ Map pointers of 'val' to def-sites.\n\/\/ \\param where  location in the program, for debugging\n\/\/ \\param size is the number of bytes used from the memory\nstd::vector<DefSite>\nLLVMReadWriteGraphBuilder::mapPointers(const llvm::Value *where,\n                                       const llvm::Value *val, Offset size) {\n    std::vector<DefSite> result;\n\n    auto psn = PTA->getLLVMPointsToChecked(val);\n    if (!psn.first) {\n        result.emplace_back(UNKNOWN_MEMORY);\n#ifndef NDEBUG\n        llvm::errs() << \"[RWG] warning at: \" << ValInfo(where) << \"\\n\";\n        llvm::errs() << \"No points-to set for: \" << ValInfo(val) << \"\\n\";\n#endif\n        \/\/ don't have points-to information for used pointer\n        return result;\n    }\n\n    if (psn.second.empty()) {\n#ifndef NDEBUG\n        llvm::errs() << \"[RWG] warning at: \" << ValInfo(where) << \"\\n\";\n        llvm::errs() << \"Empty points-to set for: \" << ValInfo(val) << \"\\n\";\n#endif\n        \/\/ this may happen on invalid reads and writes to memory,\n        \/\/ like when you try for example this:\n        \/\/\n        \/\/   int p, q;\n        \/\/   memcpy(p, q, sizeof p);\n        \/\/\n        \/\/ (there should be &p and &q)\n        \/\/ NOTE: maybe this is a bit strong to say unknown memory,\n        \/\/ but better be sound then incorrect\n        result.emplace_back(UNKNOWN_MEMORY);\n        return result;\n    }\n\n    result.reserve(psn.second.size());\n\n    if (psn.second.hasUnknown()) {\n        result.emplace_back(UNKNOWN_MEMORY);\n    }\n\n    for (const auto &ptr : psn.second) {\n        if (llvm::isa<llvm::Function>(ptr.value))\n            continue;\n\n        RWNode *ptrNode = getOperand(ptr.value);\n        if (!ptrNode) {\n            \/\/ keeping such set is faster then printing it all to terminal\n            \/\/ ... and we don't flood the terminal that way\n            static std::set<const llvm::Value *> warned;\n            if (warned.insert(ptr.value).second) {\n                llvm::errs() << \"[RWG] error at \" << ValInfo(where) << \"\\n\";\n                llvm::errs() << \"[RWG] error for \" << ValInfo(val) << \"\\n\";\n                llvm::errs() << \"[RWG] error: Cannot find node for \"\n                             << ValInfo(ptr.value) << \"\\n\";\n            }\n            continue;\n        }\n\n        \/\/ FIXME: we should pass just size to the DefSite ctor, but the old code\n        \/\/ relies on the behavior that when offset is unknown, the length is\n        \/\/ also unknown. So for now, mimic the old code. Remove it once we fix\n        \/\/ the old code.\n        result.emplace_back(ptrNode, ptr.offset,\n                            ptr.offset.isUnknown() ? Offset::UNKNOWN : size);\n    }\n\n    return result;\n}\n\nRWNode *LLVMReadWriteGraphBuilder::getOperand(const llvm::Value *val) {\n    auto *op = getNode(val);\n    if (!op) {\n        \/\/ lazily create allocations as these are targets in defsites\n        \/\/ and may not have been created yet\n        if (llvm::isa<llvm::AllocaInst>(val) ||\n            \/\/ FIXME: check that it is allocation\n            llvm::isa<llvm::CallInst>(val)) {\n            op = buildNode(val).getRepresentant();\n        }\n\n        if (!op) {\n            llvm::errs() << \"[RWG] error: cannot find an operand: \" << *val\n                         << \"\\n\";\n            abort();\n        }\n    }\n    assert(op && \"Do not have an operand\");\n    return op;\n}\n\n} \/\/ namespace dda\n} \/\/ namespace dg\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 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 \"loadcoredialog.h\"\n\n#include \"debuggerconstants.h\"\n#include \"debuggercore.h\"\n#include \"debuggerstartparameters.h\"\n#include \"debuggerdialogs.h\"\n\n#include <coreplugin\/icore.h>\n#include <projectexplorer\/abi.h>\n#include <projectexplorer\/kitchooser.h>\n#include <projectexplorer\/kitinformation.h>\n#include <ssh\/sshconnection.h>\n#include <ssh\/sshremoteprocessrunner.h>\n#include <ssh\/sftpdefs.h>\n#include <ssh\/sftpfilesystemmodel.h>\n#include <utils\/historycompleter.h>\n#include <utils\/pathchooser.h>\n#include <utils\/qtcassert.h>\n\n#include <QCoreApplication>\n#include <QDebug>\n#include <QDir>\n#include <QRegExp>\n#include <QTemporaryFile>\n\n#include <QButtonGroup>\n#include <QComboBox>\n#include <QDialogButtonBox>\n#include <QFileDialog>\n#include <QFormLayout>\n#include <QGridLayout>\n#include <QGroupBox>\n#include <QHeaderView>\n#include <QLineEdit>\n#include <QMessageBox>\n#include <QPushButton>\n#include <QRadioButton>\n#include <QScrollArea>\n#include <QSortFilterProxyModel>\n#include <QStandardItemModel>\n#include <QTableView>\n#include <QTextBrowser>\n#include <QTreeView>\n#include <QVBoxLayout>\n\nusing namespace Core;\nusing namespace ProjectExplorer;\nusing namespace QSsh;\nusing namespace Utils;\n\nnamespace Debugger {\nnamespace Internal {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SelectRemoteFileDialog\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass SelectRemoteFileDialog : public QDialog\n{\n    Q_OBJECT\n\npublic:\n    explicit SelectRemoteFileDialog(QWidget *parent);\n\n    void attachToDevice(Kit *k);\n    QString localFile() const { return m_localFile; }\n    QString remoteFile() const { return m_remoteFile; }\n\nprivate slots:\n    void handleSftpOperationFinished(QSsh::SftpJobId, const QString &error);\n    void handleSftpOperationFailed(const QString &errorMessage);\n    void handleConnectionError(const QString &errorMessage);\n    void handleRemoteError(const QString &errorMessage);\n    void selectFile();\n\nprivate:\n    QSortFilterProxyModel m_model;\n    SftpFileSystemModel m_fileSystemModel;\n    QTreeView *m_fileSystemView;\n    QTextBrowser *m_textBrowser;\n    QDialogButtonBox *m_buttonBox;\n    QString m_localFile;\n    QString m_remoteFile;\n    SftpJobId m_sftpJobId;\n};\n\nSelectRemoteFileDialog::SelectRemoteFileDialog(QWidget *parent)\n    : QDialog(parent)\n{\n    m_model.setSourceModel(&m_fileSystemModel);\n\n    m_fileSystemView = new QTreeView(this);\n    m_fileSystemView->setModel(&m_model);\n    m_fileSystemView->setSortingEnabled(true);\n    m_fileSystemView->setUniformRowHeights(true);\n    m_fileSystemView->setSelectionMode(QAbstractItemView::SingleSelection);\n    m_fileSystemView->setSelectionBehavior(QAbstractItemView::SelectRows);\n    m_fileSystemView->header()->setDefaultSectionSize(100);\n    m_fileSystemView->header()->setStretchLastSection(true);\n\n    m_textBrowser = new QTextBrowser(this);\n    m_textBrowser->setEnabled(false);\n\n    m_buttonBox = new QDialogButtonBox(this);\n    m_buttonBox->setStandardButtons(QDialogButtonBox::Cancel|QDialogButtonBox::Ok);\n    m_buttonBox->button(QDialogButtonBox::Ok)->setDefault(true);\n    m_buttonBox->button(QDialogButtonBox::Ok)->setEnabled(false);\n\n    QVBoxLayout *layout = new QVBoxLayout(this);\n    layout->addWidget(m_fileSystemView);\n    layout->addWidget(m_textBrowser);\n    layout->addWidget(m_buttonBox);\n\n    QObject::connect(m_buttonBox, SIGNAL(rejected()), SLOT(reject()));\n    QObject::connect(m_buttonBox, SIGNAL(accepted()), SLOT(selectFile()));\n\n    connect(&m_fileSystemModel, SIGNAL(sftpOperationFailed(QString)),\n            SLOT(handleSftpOperationFailed(QString)));\n    connect(&m_fileSystemModel, SIGNAL(connectionError(QString)),\n            SLOT(handleConnectionError(QString)));\n}\n\nvoid SelectRemoteFileDialog::attachToDevice(Kit *k)\n{\n    m_buttonBox->button(QDialogButtonBox::Ok)->setEnabled(true);\n    QTC_ASSERT(k, return);\n    IDevice::ConstPtr device = DeviceKitInformation::device(k);\n    QTC_ASSERT(device, return);\n    QSsh::SshConnectionParameters sshParams = device->sshParameters();\n    m_fileSystemModel.setSshConnection(sshParams);\n}\n\nvoid SelectRemoteFileDialog::handleSftpOperationFailed(const QString &errorMessage)\n{\n    m_textBrowser->append(errorMessage);\n    \/\/reject();\n}\n\nvoid SelectRemoteFileDialog::handleConnectionError(const QString &errorMessage)\n{\n    m_textBrowser->append(errorMessage);\n    \/\/reject();\n}\n\nvoid SelectRemoteFileDialog::handleSftpOperationFinished(QSsh::SftpJobId, const QString &error)\n{\n    if (error.isEmpty()) {\n        m_textBrowser->append(tr(\"Download of remote file succeeded.\"));\n        accept();\n    } else {\n        m_textBrowser->append(error);\n        \/\/reject();\n    }\n}\n\nvoid SelectRemoteFileDialog::handleRemoteError(const QString &errorMessage)\n{\n    m_textBrowser->append(errorMessage);\n}\n\nvoid SelectRemoteFileDialog::selectFile()\n{\n    const QModelIndexList indexes =\n            m_fileSystemView->selectionModel()->selectedIndexes();\n    if (indexes.empty())\n        return;\n\n    m_buttonBox->button(QDialogButtonBox::Ok)->setEnabled(false);\n    m_fileSystemView->setEnabled(false);\n\n    connect(&m_fileSystemModel, SIGNAL(sftpOperationFinished(QSsh::SftpJobId,QString)),\n            SLOT(handleSftpOperationFinished(QSsh::SftpJobId,QString)));\n\n    {\n        QTemporaryFile localFile(QDir::tempPath() + QLatin1String(\"\/remotecore-XXXXXX\"));\n        localFile.open();\n        m_localFile = localFile.fileName();\n    }\n\n    QModelIndex idx = indexes.at(0);\n    idx = idx.sibling(idx.row(), 1);\n    m_remoteFile = m_fileSystemModel.data(idx, SftpFileSystemModel::PathRole).toString();\n    m_sftpJobId = m_fileSystemModel.downloadFile(idx, m_localFile);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ AttachCoreDialog\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass AttachCoreDialogPrivate\n{\npublic:\n    KitChooser *kitChooser;\n\n    QSettings *settings;\n\n    PathChooser *localExecFileName;\n    PathChooser *localCoreFileName;\n    QLineEdit *remoteCoreFileName;\n    QPushButton *selectRemoteCoreButton;\n\n    PathChooser *overrideStartScriptFileName;\n\n    QDialogButtonBox *buttonBox;\n};\n\nAttachCoreDialog::AttachCoreDialog(QWidget *parent)\n    : QDialog(parent), d(new AttachCoreDialogPrivate)\n{\n    setWindowTitle(tr(\"Load Core File\"));\n    setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);\n\n    d->settings = ICore::settings();\n\n    d->kitChooser = new DebuggerKitChooser(DebuggerKitChooser::RemoteDebugging, this);\n    d->kitChooser->populate();\n\n    d->selectRemoteCoreButton = new QPushButton(tr(\"Browse...\"), this);\n    d->remoteCoreFileName = new QLineEdit(this);\n    d->remoteCoreFileName->setEnabled(false);\n\n    d->localCoreFileName = new PathChooser(this);\n    d->localCoreFileName->setExpectedKind(PathChooser::File);\n    d->localCoreFileName->setPromptDialogTitle(tr(\"Select Core File\"));\n\n    d->localExecFileName = new PathChooser(this);\n    d->localExecFileName->setExpectedKind(PathChooser::File);\n    d->localExecFileName->setPromptDialogTitle(tr(\"Select Executable\"));\n\n    d->overrideStartScriptFileName = new PathChooser(this);\n    d->overrideStartScriptFileName->setExpectedKind(PathChooser::File);\n    d->overrideStartScriptFileName->setPromptDialogTitle(tr(\"Select Startup Script\"));\n\n    d->buttonBox = new QDialogButtonBox(this);\n    d->buttonBox->setStandardButtons(QDialogButtonBox::Cancel|QDialogButtonBox::Ok);\n    d->buttonBox->button(QDialogButtonBox::Ok)->setDefault(true);\n    d->buttonBox->button(QDialogButtonBox::Ok)->setEnabled(false);\n\n    QHBoxLayout *coreLayout = new QHBoxLayout;\n    coreLayout->addWidget(d->localCoreFileName);\n    coreLayout->addWidget(d->remoteCoreFileName);\n    coreLayout->addWidget(d->selectRemoteCoreButton);\n\n    QFormLayout *formLayout = new QFormLayout;\n    formLayout->setContentsMargins(0, 0, 0, 0);\n    formLayout->setHorizontalSpacing(6);\n    formLayout->setVerticalSpacing(6);\n    formLayout->addRow(tr(\"Kit:\"), d->kitChooser);\n    formLayout->addRow(tr(\"&Executable:\"), d->localExecFileName);\n    formLayout->addRow(tr(\"Core file:\"), coreLayout);\n    formLayout->addRow(tr(\"Override &start script:\"), d->overrideStartScriptFileName);\n\n    QFrame *line = new QFrame(this);\n    line->setFrameShape(QFrame::HLine);\n    line->setFrameShadow(QFrame::Sunken);\n\n    formLayout->addRow(d->buttonBox);\n\n    QVBoxLayout *vboxLayout = new QVBoxLayout(this);\n    vboxLayout->addLayout(formLayout);\n    vboxLayout->addStretch();\n    vboxLayout->addWidget(line);\n    vboxLayout->addWidget(d->buttonBox);\n\n    connect(d->selectRemoteCoreButton, SIGNAL(clicked()), SLOT(selectRemoteCoreFile()));\n    connect(d->remoteCoreFileName, SIGNAL(textChanged(QString)), SLOT(changed()));\n    connect(d->kitChooser, SIGNAL(activated(int)), SLOT(changed()));\n    connect(d->buttonBox, SIGNAL(rejected()), SLOT(reject()));\n    connect(d->buttonBox, SIGNAL(accepted()), SLOT(accept()));\n}\n\nAttachCoreDialog::~AttachCoreDialog()\n{\n    delete d;\n}\n\nbool AttachCoreDialog::isLocal() const\n{\n    Kit *k = d->kitChooser->currentKit();\n    QTC_ASSERT(k, return false);\n    IDevice::ConstPtr device = DeviceKitInformation::device(k);\n    QTC_ASSERT(device, return false);\n    SshConnectionParameters sshParams = device->sshParameters();\n    d->settings->setValue(QLatin1String(\"LastProfile\"),\n        d->kitChooser->currentKitId().toString());\n    return sshParams.host.isEmpty();\n}\n\nvoid AttachCoreDialog::changed()\n{\n    bool isValid = d->kitChooser->currentIndex() >= 0\n            && !localCoreFile().isEmpty();\n    d->buttonBox->button(QDialogButtonBox::Ok)->setEnabled(isValid);\n\n    if (isLocal()) {\n        d->localCoreFileName->setVisible(true);\n        d->remoteCoreFileName->setVisible(false);\n        d->selectRemoteCoreButton->setVisible(false);\n    } else {\n        d->remoteCoreFileName->setVisible(true);\n        d->selectRemoteCoreButton->setVisible(true);\n        d->localCoreFileName->setVisible(false);\n    }\n}\n\nvoid AttachCoreDialog::selectRemoteCoreFile()\n{\n    changed();\n    QTC_ASSERT(!isLocal(), return);\n    SelectRemoteFileDialog dlg(this);\n    dlg.setWindowTitle(tr(\"Select Remote Core File\"));\n    dlg.attachToDevice(d->kitChooser->currentKit());\n    if (dlg.exec() == QDialog::Rejected)\n        return;\n    d->localCoreFileName->setPath(dlg.localFile());\n    d->remoteCoreFileName->setText(dlg.remoteFile());\n    changed();\n}\n\nQString AttachCoreDialog::localCoreFile() const\n{\n    return d->localCoreFileName->path();\n}\n\nQString AttachCoreDialog::localExecutableFile() const\n{\n    return d->localExecFileName->path();\n}\n\nvoid AttachCoreDialog::setLocalExecutableFile(const QString &fileName)\n{\n    d->localExecFileName->setPath(fileName);\n}\n\nvoid AttachCoreDialog::setLocalCoreFile(const QString &fileName)\n{\n    d->localCoreFileName->setPath(fileName);\n}\n\nvoid AttachCoreDialog::setRemoteCoreFile(const QString &fileName)\n{\n    d->remoteCoreFileName->setText(fileName);\n}\n\nQString AttachCoreDialog::remoteCoreFile() const\n{\n    return d->remoteCoreFileName->text();\n}\n\nvoid AttachCoreDialog::setKitId(const Core::Id &id)\n{\n    d->kitChooser->setCurrentKitId(id);\n    changed();\n}\n\nKit *AttachCoreDialog::kit() const\n{\n    return d->kitChooser->currentKit();\n}\n\nQString AttachCoreDialog::overrideStartScript() const\n{\n    return d->overrideStartScriptFileName->path();\n}\n\nvoid AttachCoreDialog::setOverrideStartScript(const QString &scriptName)\n{\n    d->overrideStartScriptFileName->setPath(scriptName);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\n\n#include \"loadcoredialog.moc\"\n<commit_msg>Attach to Core: Correctly enable OK button<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 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 \"loadcoredialog.h\"\n\n#include \"debuggerconstants.h\"\n#include \"debuggercore.h\"\n#include \"debuggerstartparameters.h\"\n#include \"debuggerdialogs.h\"\n\n#include <coreplugin\/icore.h>\n#include <projectexplorer\/abi.h>\n#include <projectexplorer\/kitchooser.h>\n#include <projectexplorer\/kitinformation.h>\n#include <ssh\/sshconnection.h>\n#include <ssh\/sshremoteprocessrunner.h>\n#include <ssh\/sftpdefs.h>\n#include <ssh\/sftpfilesystemmodel.h>\n#include <utils\/historycompleter.h>\n#include <utils\/pathchooser.h>\n#include <utils\/qtcassert.h>\n\n#include <QCoreApplication>\n#include <QDebug>\n#include <QDir>\n#include <QRegExp>\n#include <QTemporaryFile>\n\n#include <QButtonGroup>\n#include <QComboBox>\n#include <QDialogButtonBox>\n#include <QFileDialog>\n#include <QFormLayout>\n#include <QGridLayout>\n#include <QGroupBox>\n#include <QHeaderView>\n#include <QLineEdit>\n#include <QMessageBox>\n#include <QPushButton>\n#include <QRadioButton>\n#include <QScrollArea>\n#include <QSortFilterProxyModel>\n#include <QStandardItemModel>\n#include <QTableView>\n#include <QTextBrowser>\n#include <QTreeView>\n#include <QVBoxLayout>\n\nusing namespace Core;\nusing namespace ProjectExplorer;\nusing namespace QSsh;\nusing namespace Utils;\n\nnamespace Debugger {\nnamespace Internal {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SelectRemoteFileDialog\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass SelectRemoteFileDialog : public QDialog\n{\n    Q_OBJECT\n\npublic:\n    explicit SelectRemoteFileDialog(QWidget *parent);\n\n    void attachToDevice(Kit *k);\n    QString localFile() const { return m_localFile; }\n    QString remoteFile() const { return m_remoteFile; }\n\nprivate slots:\n    void handleSftpOperationFinished(QSsh::SftpJobId, const QString &error);\n    void handleSftpOperationFailed(const QString &errorMessage);\n    void handleConnectionError(const QString &errorMessage);\n    void handleRemoteError(const QString &errorMessage);\n    void selectFile();\n\nprivate:\n    QSortFilterProxyModel m_model;\n    SftpFileSystemModel m_fileSystemModel;\n    QTreeView *m_fileSystemView;\n    QTextBrowser *m_textBrowser;\n    QDialogButtonBox *m_buttonBox;\n    QString m_localFile;\n    QString m_remoteFile;\n    SftpJobId m_sftpJobId;\n};\n\nSelectRemoteFileDialog::SelectRemoteFileDialog(QWidget *parent)\n    : QDialog(parent)\n{\n    m_model.setSourceModel(&m_fileSystemModel);\n\n    m_fileSystemView = new QTreeView(this);\n    m_fileSystemView->setModel(&m_model);\n    m_fileSystemView->setSortingEnabled(true);\n    m_fileSystemView->setUniformRowHeights(true);\n    m_fileSystemView->setSelectionMode(QAbstractItemView::SingleSelection);\n    m_fileSystemView->setSelectionBehavior(QAbstractItemView::SelectRows);\n    m_fileSystemView->header()->setDefaultSectionSize(100);\n    m_fileSystemView->header()->setStretchLastSection(true);\n\n    m_textBrowser = new QTextBrowser(this);\n    m_textBrowser->setEnabled(false);\n\n    m_buttonBox = new QDialogButtonBox(this);\n    m_buttonBox->setStandardButtons(QDialogButtonBox::Cancel|QDialogButtonBox::Ok);\n    m_buttonBox->button(QDialogButtonBox::Ok)->setDefault(true);\n    m_buttonBox->button(QDialogButtonBox::Ok)->setEnabled(false);\n\n    QVBoxLayout *layout = new QVBoxLayout(this);\n    layout->addWidget(m_fileSystemView);\n    layout->addWidget(m_textBrowser);\n    layout->addWidget(m_buttonBox);\n\n    QObject::connect(m_buttonBox, SIGNAL(rejected()), SLOT(reject()));\n    QObject::connect(m_buttonBox, SIGNAL(accepted()), SLOT(selectFile()));\n\n    connect(&m_fileSystemModel, SIGNAL(sftpOperationFailed(QString)),\n            SLOT(handleSftpOperationFailed(QString)));\n    connect(&m_fileSystemModel, SIGNAL(connectionError(QString)),\n            SLOT(handleConnectionError(QString)));\n}\n\nvoid SelectRemoteFileDialog::attachToDevice(Kit *k)\n{\n    m_buttonBox->button(QDialogButtonBox::Ok)->setEnabled(true);\n    QTC_ASSERT(k, return);\n    IDevice::ConstPtr device = DeviceKitInformation::device(k);\n    QTC_ASSERT(device, return);\n    QSsh::SshConnectionParameters sshParams = device->sshParameters();\n    m_fileSystemModel.setSshConnection(sshParams);\n}\n\nvoid SelectRemoteFileDialog::handleSftpOperationFailed(const QString &errorMessage)\n{\n    m_textBrowser->append(errorMessage);\n    \/\/reject();\n}\n\nvoid SelectRemoteFileDialog::handleConnectionError(const QString &errorMessage)\n{\n    m_textBrowser->append(errorMessage);\n    \/\/reject();\n}\n\nvoid SelectRemoteFileDialog::handleSftpOperationFinished(QSsh::SftpJobId, const QString &error)\n{\n    if (error.isEmpty()) {\n        m_textBrowser->append(tr(\"Download of remote file succeeded.\"));\n        accept();\n    } else {\n        m_textBrowser->append(error);\n        \/\/reject();\n    }\n}\n\nvoid SelectRemoteFileDialog::handleRemoteError(const QString &errorMessage)\n{\n    m_textBrowser->append(errorMessage);\n}\n\nvoid SelectRemoteFileDialog::selectFile()\n{\n    const QModelIndexList indexes =\n            m_fileSystemView->selectionModel()->selectedIndexes();\n    if (indexes.empty())\n        return;\n\n    m_buttonBox->button(QDialogButtonBox::Ok)->setEnabled(false);\n    m_fileSystemView->setEnabled(false);\n\n    connect(&m_fileSystemModel, SIGNAL(sftpOperationFinished(QSsh::SftpJobId,QString)),\n            SLOT(handleSftpOperationFinished(QSsh::SftpJobId,QString)));\n\n    {\n        QTemporaryFile localFile(QDir::tempPath() + QLatin1String(\"\/remotecore-XXXXXX\"));\n        localFile.open();\n        m_localFile = localFile.fileName();\n    }\n\n    QModelIndex idx = indexes.at(0);\n    idx = idx.sibling(idx.row(), 1);\n    m_remoteFile = m_fileSystemModel.data(idx, SftpFileSystemModel::PathRole).toString();\n    m_sftpJobId = m_fileSystemModel.downloadFile(idx, m_localFile);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ AttachCoreDialog\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass AttachCoreDialogPrivate\n{\npublic:\n    KitChooser *kitChooser;\n\n    QSettings *settings;\n\n    PathChooser *localExecFileName;\n    PathChooser *localCoreFileName;\n    QLineEdit *remoteCoreFileName;\n    QPushButton *selectRemoteCoreButton;\n\n    PathChooser *overrideStartScriptFileName;\n\n    QDialogButtonBox *buttonBox;\n};\n\nAttachCoreDialog::AttachCoreDialog(QWidget *parent)\n    : QDialog(parent), d(new AttachCoreDialogPrivate)\n{\n    setWindowTitle(tr(\"Load Core File\"));\n    setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);\n\n    d->settings = ICore::settings();\n\n    d->kitChooser = new DebuggerKitChooser(DebuggerKitChooser::RemoteDebugging, this);\n    d->kitChooser->populate();\n\n    d->selectRemoteCoreButton = new QPushButton(tr(\"Browse...\"), this);\n    d->remoteCoreFileName = new QLineEdit(this);\n    d->remoteCoreFileName->setEnabled(false);\n\n    d->localCoreFileName = new PathChooser(this);\n    d->localCoreFileName->setExpectedKind(PathChooser::File);\n    d->localCoreFileName->setPromptDialogTitle(tr(\"Select Core File\"));\n\n    d->localExecFileName = new PathChooser(this);\n    d->localExecFileName->setExpectedKind(PathChooser::File);\n    d->localExecFileName->setPromptDialogTitle(tr(\"Select Executable\"));\n\n    d->overrideStartScriptFileName = new PathChooser(this);\n    d->overrideStartScriptFileName->setExpectedKind(PathChooser::File);\n    d->overrideStartScriptFileName->setPromptDialogTitle(tr(\"Select Startup Script\"));\n\n    d->buttonBox = new QDialogButtonBox(this);\n    d->buttonBox->setStandardButtons(QDialogButtonBox::Cancel|QDialogButtonBox::Ok);\n    d->buttonBox->button(QDialogButtonBox::Ok)->setDefault(true);\n    d->buttonBox->button(QDialogButtonBox::Ok)->setEnabled(false);\n\n    QHBoxLayout *coreLayout = new QHBoxLayout;\n    coreLayout->addWidget(d->localCoreFileName);\n    coreLayout->addWidget(d->remoteCoreFileName);\n    coreLayout->addWidget(d->selectRemoteCoreButton);\n\n    QFormLayout *formLayout = new QFormLayout;\n    formLayout->setContentsMargins(0, 0, 0, 0);\n    formLayout->setHorizontalSpacing(6);\n    formLayout->setVerticalSpacing(6);\n    formLayout->addRow(tr(\"Kit:\"), d->kitChooser);\n    formLayout->addRow(tr(\"&Executable:\"), d->localExecFileName);\n    formLayout->addRow(tr(\"Core file:\"), coreLayout);\n    formLayout->addRow(tr(\"Override &start script:\"), d->overrideStartScriptFileName);\n\n    QFrame *line = new QFrame(this);\n    line->setFrameShape(QFrame::HLine);\n    line->setFrameShadow(QFrame::Sunken);\n\n    formLayout->addRow(d->buttonBox);\n\n    QVBoxLayout *vboxLayout = new QVBoxLayout(this);\n    vboxLayout->addLayout(formLayout);\n    vboxLayout->addStretch();\n    vboxLayout->addWidget(line);\n    vboxLayout->addWidget(d->buttonBox);\n\n    connect(d->selectRemoteCoreButton, SIGNAL(clicked()), SLOT(selectRemoteCoreFile()));\n    connect(d->remoteCoreFileName, SIGNAL(textChanged(QString)), SLOT(changed()));\n    connect(d->localCoreFileName, SIGNAL(changed(QString)), SLOT(changed()));\n    connect(d->kitChooser, SIGNAL(activated(int)), SLOT(changed()));\n    connect(d->buttonBox, SIGNAL(rejected()), SLOT(reject()));\n    connect(d->buttonBox, SIGNAL(accepted()), SLOT(accept()));\n    changed();\n}\n\nAttachCoreDialog::~AttachCoreDialog()\n{\n    delete d;\n}\n\nbool AttachCoreDialog::isLocal() const\n{\n    Kit *k = d->kitChooser->currentKit();\n    QTC_ASSERT(k, return false);\n    IDevice::ConstPtr device = DeviceKitInformation::device(k);\n    QTC_ASSERT(device, return false);\n    SshConnectionParameters sshParams = device->sshParameters();\n    d->settings->setValue(QLatin1String(\"LastProfile\"),\n        d->kitChooser->currentKitId().toString());\n    return sshParams.host.isEmpty();\n}\n\nvoid AttachCoreDialog::changed()\n{\n    bool isValid = d->kitChooser->currentIndex() >= 0;\n\n    if (isLocal()) {\n        d->localCoreFileName->setVisible(true);\n        d->remoteCoreFileName->setVisible(false);\n        d->selectRemoteCoreButton->setVisible(false);\n        isValid &= d->localCoreFileName->isValid();\n    } else {\n        d->remoteCoreFileName->setVisible(true);\n        d->selectRemoteCoreButton->setVisible(true);\n        d->localCoreFileName->setVisible(false);\n        isValid &= !remoteCoreFile().isEmpty();\n    }\n    d->buttonBox->button(QDialogButtonBox::Ok)->setEnabled(isValid);\n}\n\nvoid AttachCoreDialog::selectRemoteCoreFile()\n{\n    changed();\n    QTC_ASSERT(!isLocal(), return);\n    SelectRemoteFileDialog dlg(this);\n    dlg.setWindowTitle(tr(\"Select Remote Core File\"));\n    dlg.attachToDevice(d->kitChooser->currentKit());\n    if (dlg.exec() == QDialog::Rejected)\n        return;\n    d->localCoreFileName->setPath(dlg.localFile());\n    d->remoteCoreFileName->setText(dlg.remoteFile());\n    changed();\n}\n\nQString AttachCoreDialog::localCoreFile() const\n{\n    return d->localCoreFileName->path();\n}\n\nQString AttachCoreDialog::localExecutableFile() const\n{\n    return d->localExecFileName->path();\n}\n\nvoid AttachCoreDialog::setLocalExecutableFile(const QString &fileName)\n{\n    d->localExecFileName->setPath(fileName);\n}\n\nvoid AttachCoreDialog::setLocalCoreFile(const QString &fileName)\n{\n    d->localCoreFileName->setPath(fileName);\n}\n\nvoid AttachCoreDialog::setRemoteCoreFile(const QString &fileName)\n{\n    d->remoteCoreFileName->setText(fileName);\n}\n\nQString AttachCoreDialog::remoteCoreFile() const\n{\n    return d->remoteCoreFileName->text();\n}\n\nvoid AttachCoreDialog::setKitId(const Core::Id &id)\n{\n    d->kitChooser->setCurrentKitId(id);\n    changed();\n}\n\nKit *AttachCoreDialog::kit() const\n{\n    return d->kitChooser->currentKit();\n}\n\nQString AttachCoreDialog::overrideStartScript() const\n{\n    return d->overrideStartScriptFileName->path();\n}\n\nvoid AttachCoreDialog::setOverrideStartScript(const QString &scriptName)\n{\n    d->overrideStartScriptFileName->setPath(scriptName);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\n\n#include \"loadcoredialog.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/==============================================================================\n\/\/ Core utilities\n\/\/==============================================================================\n\n#include \"commonwidget.h\"\n#include \"coreutils.h\"\n\n\/\/==============================================================================\n\n#include <QApplication>\n#include <QDate>\n#include <QDir>\n#include <QFile>\n#include <QFileDialog>\n#include <QFrame>\n#include <QLabel>\n#include <QMessageBox>\n#include <QProcess>\n#include <QResource>\n#include <QSettings>\n#include <QTextEdit>\n#include <QVariant>\n#include <QWidget>\n\n\/\/==============================================================================\n\n#ifdef Q_OS_MAC\n    #include <sys\/sysctl.h>\n#endif\n\n\/\/==============================================================================\n\nnamespace OpenCOR {\nnamespace Core {\n\n\/\/==============================================================================\n\nunsigned long totalPhysicalMemory()\n{\n    \/\/ Retrieve and return in bytes the total amount of physical memory\n    \/\/ available\n\n    unsigned long res = 0;\n\n#if defined(Q_OS_LINUX)\n    res = sysconf(_SC_PHYS_PAGES)*sysconf(_SC_PAGESIZE);\n#elif defined(Q_OS_MAC)\n    int mib[2];\n\n    mib[0] = CTL_HW;\n    mib[1] = HW_MEMSIZE;\n\n    size_t len = sizeof(res);\n\n    sysctl(mib, 2, &res, &len, 0, 0);\n#endif\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQByteArray resourceAsByteArray(const QString &pResource)\n{\n    \/\/ Retrieve a resource as a QByteArray\n\n    QResource resource(pResource);\n\n    if (resource.isValid()) {\n        if (resource.isCompressed())\n            \/\/ The resource is compressed, so uncompress it before returning it\n\n            return qUncompress(reinterpret_cast<const uchar *>(resource.data()),\n                               resource.size());\n        else\n            \/\/ The resource is not compressed, so just return it after doing the\n            \/\/ right conversion\n\n            return QByteArray(reinterpret_cast<const char *>(resource.data()),\n                              resource.size());\n    }\n    else {\n        \/\/ The resource doesn't exist, so...\n\n        return QByteArray();\n    }\n}\n\n\/\/==============================================================================\n\nbool saveResourceAs(const QString &pResource, const QString &pFilename)\n{\n    if (QResource(pResource).isValid()) {\n        \/\/ The resource exists, so write a file with name pFilename and which\n        \/\/ contents is that of the resource which is retrieved as a QByteArray\n\n        QFile file(pFilename);\n\n        if (file.open(QIODevice::ReadWrite)) {\n            QByteArray resource = resourceAsByteArray(pResource);\n            bool res;\n\n            res = file.write(resource) == resource.size();\n\n            file.close();\n\n            \/\/ Remove the newly created file in case not all the resource was\n            \/\/ written to it\n\n            if (!res)\n                file.remove();\n\n            return res;\n        } else {\n            return false;\n        }\n    } else {\n        return false;\n    }\n}\n\n\/\/==============================================================================\n\nvoid * globalInstance(const QString &pObjectName, void *pDefaultGlobalInstance)\n{\n    \/\/ Retrieve the 'global' instance of an object\n    \/\/ Note: initially, the plan was to have a static instance of an object and\n    \/\/       return its address. However, this approach doesn't work on Windows\n    \/\/       and Linux (but does on OS X). Indeed, say that the Core plugin is\n    \/\/       required by two other plugins, then these two plugins won't get the\n    \/\/       same 'copy' of the Core plugin. (It seems like) each 'copy' gets\n    \/\/       its own address space. (This is not the case on OS X, (most likely)\n    \/\/       because of the way applications are bundled on that platform.) To\n    \/\/       address this issue, we keep track of the address of a 'global'\n    \/\/       instance using QSettings. Now, this approach works fine on both\n    \/\/       Windows and Linux, but... not on OS X (!!). (It would seem that)\n    \/\/       there are some read\/write conflicts (when using QSettings). These\n    \/\/       conflicts would normally be addressed using a mutex, but then we\n    \/\/       would be back to the issue of being able to share something between\n    \/\/       different plugins. So, instead, we, on OS X, revert to our original\n    \/\/       plan...\n\n#ifdef Q_OS_MAC\n    Q_UNUSED(pObjectName);\n\n    return (void *) pDefaultGlobalInstance;\n#else\n    QSettings settings(qApp->applicationName());\n    qlonglong globalInstance;\n\n    settings.beginGroup(SettingsGlobal);\n        globalInstance = settings.value(pObjectName, 0).toLongLong();\n\n        if (!globalInstance) {\n            \/\/ There is no 'global' instance associated with the given object,\n            \/\/ so use the object's default 'global' instance we were given\n\n            globalInstance = (qlonglong) pDefaultGlobalInstance;\n\n            settings.setValue(pObjectName, globalInstance);\n        }\n    settings.endGroup();\n\n    \/\/ Return the class's 'global' instance\n\n    return (void *) globalInstance;\n#endif\n}\n\n\/\/==============================================================================\n\nvoid CORE_EXPORT setActiveDirectory(const QString &pDirName)\n{\n    \/\/ Keep track of the active directory\n\n    QSettings settings(qApp->applicationName());\n\n    settings.beginGroup(SettingsGlobal);\n        settings.setValue(SettingsActiveDirectory, pDirName);\n    settings.endGroup();\n}\n\n\/\/==============================================================================\n\nQString CORE_EXPORT activeDirectory()\n{\n    \/\/ Retrieve and return the active directory\n\n    QString res;\n    QSettings settings(qApp->applicationName());\n\n    settings.beginGroup(SettingsGlobal);\n        res = settings.value(SettingsActiveDirectory).toString();\n    settings.endGroup();\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQStringList CORE_EXPORT getOpenFileNames(const QString &pCaption,\n                                         const QString &pFilter)\n{\n    \/\/ Retrieve and return one or several open file names\n\n    QStringList res = QFileDialog::getOpenFileNames(qApp->activeWindow(),\n                                                    pCaption,\n                                                    activeDirectory(),\n                                                    pFilter);\n\n    if (res.count())\n        \/\/ We have retrieve at least one open file name, so we can keep track of\n        \/\/ the folder in which it is\n        \/\/ Note #1: we use the last open file name to determine the folder that\n        \/\/          is to be remembered since on Windows 7, at least, it's\n        \/\/          possible to search for files from within the file dialog\n        \/\/          box, the last open file name should be the one we are\n        \/\/          'interested' in...\n        \/\/ Note #2: this doesn't, unfortunately, address the case where the user\n        \/\/          goes to a directory and then closes the file dialog box\n        \/\/          without selecting any open file name. There might be a way\n        \/\/          to get it to work, but that would involve using the exec()\n        \/\/          method rather than the static getOpenFilesNames() method,\n        \/\/          which would result in a non-native looking file dialog box\n        \/\/          (on Windows 7 at least), so it's not an option\n        \/\/          unfortunately...\n\n        setActiveDirectory(QFileInfo(res[res.count()-1]).path());\n\n    \/\/ Return the open file name(s)\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQString CORE_EXPORT getSaveFileName(const QString &pCaption,\n                                    const QString &pFileName,\n                                    const QString &pFilter)\n{\n    \/\/ Retrieve and return a save file name\n\n    QString res = QDir::toNativeSeparators(QFileDialog::getSaveFileName(qApp->activeWindow(),\n                                                                        pCaption,\n                                                                        pFileName.isEmpty()?\n                                                                            activeDirectory():\n                                                                            QFileInfo(pFileName).canonicalPath(),\n#if defined(Q_OS_WIN) || defined(Q_OS_LINUX)\n                                                                        pFilter, 0,\n#elif defined(Q_OS_MAC)\n\/\/---GRY--- FOR SOME REASONS, OS X \/ Qt DOESN'T LIKE US SPECIFYING SUPPORTED\n\/\/          FILE TYPES...!? (SEE https:\/\/github.com\/opencor\/opencor\/issues\/110)\n                                                                        QString(), 0,\n#else\n    #error Unsupported platform\n#endif\n                                                                        QFileDialog::DontConfirmOverwrite));\n\n    \/\/ Make sure that we got a save file name\n\n    if (!res.isEmpty()) {\n        \/\/ Update our active directory\n\n        QFileInfo resInfo = res;\n\n        setActiveDirectory(resInfo.path());\n\n        \/\/ Check whether the save file already exists\n\n        if (resInfo.exists())\n            \/\/ The save file already exists, so ask whether we want to overwrite\n            \/\/ it\n\n            if (QMessageBox::question(qApp->activeWindow(),\n                                      qApp->applicationName(),\n                                      QObject::tr(\"<strong>%1<\/strong> already exists. Do you want to overwrite it?\").arg(res),\n                                      QMessageBox::Yes|QMessageBox::No,\n                                      QMessageBox::Yes) == QMessageBox::No )\n                \/\/ We don't want to overwrite the save file, so...\n\n                return QString();\n    }\n\n    \/\/ Everything went fine,so return the save file name\n\n    return res;\n}\n\n\/\/==============================================================================\n\nvoid setFocusTo(QWidget *pWidget)\n{\n    \/\/ Give the focus to pWidget, but then revert the focus back to whoever had\n    \/\/ it before, if needed\n\n    if (!pWidget)\n        return;\n\n    QWidget *focusedWidget = qApp->activeWindow()?\n                                 qApp->activeWindow()->focusWidget():\n                                 0;\n\n    pWidget->setFocus();\n\n    if (   focusedWidget\n        && (pWidget->parentWidget() != focusedWidget->parentWidget()))\n        \/\/ The current and previously focused widgets don't share the same\n        \/\/ parent, so revert the focus back to the previously focused widget\n\n        focusedWidget->setFocus();\n}\n\n\/\/==============================================================================\n\nQString nativeCanonicalFileName(const QString &pFileName)\n{\n    \/\/ Return a native and canonical version of the file's name\n\n    return QDir::toNativeSeparators(QFileInfo(pFileName).canonicalFilePath());\n}\n\n\/\/==============================================================================\n\nQFrame * newLineWidget(const bool &pHorizontal, const QColor &pColor,\n                       QWidget *pParent)\n{\n    \/\/ Create and return a 'real' line widget, i.e. one which is 1 pixel wide,\n    \/\/ using a QFrame widget\n\n    QFrame *res = new QFrame(pParent);\n\n    res->setStyleSheet(QString(\"QFrame {\"\n                               \"    border: 1px solid rgb(%1, %2, %3);\"\n                               \"}\").arg(QString::number(pColor.red()),\n                                        QString::number(pColor.green()),\n                                        QString::number(pColor.blue())));\n\n    if (pHorizontal) {\n        res->setSizePolicy(QSizePolicy::Preferred, QSizePolicy::Fixed);\n        res->setFixedHeight(1);\n    } else {\n        res->setSizePolicy(QSizePolicy::Fixed, QSizePolicy::Preferred);\n        res->setFixedWidth(1);\n    }\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQFrame * newLineWidget(const bool &pHorizontal, QWidget *pParent)\n{\n    \/\/ Create and return a 'real' horizontal line widget\n\n    return newLineWidget(pHorizontal, CommonWidget::borderColor(), pParent);\n}\n\n\/\/==============================================================================\n\nQFrame * newLineWidget(const QColor &pColor, QWidget *pParent)\n{\n    \/\/ Create and return a 'real' horizontal line widget\n\n    return newLineWidget(true, pColor, pParent);\n}\n\n\/\/==============================================================================\n\nQFrame * newLineWidget(QWidget *pParent)\n{\n    \/\/ Create and return a 'real' horizontal line widget\n\n    return newLineWidget(true, CommonWidget::borderColor(), pParent);\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, const double &pFontPercentage,\n                  const bool &pBold, const bool &pItalic,\n                  const Qt::Alignment &pAlignment, QWidget *pParent)\n{\n    \/\/ Create and return a label, after having set some of its properties\n\n    QLabel *res = new QLabel(pText, pParent);\n\n    QFont font = res->font();\n\n    font.setBold(pBold);\n    font.setItalic(pItalic);\n    font.setPointSize(pFontPercentage*font.pointSize());\n\n    res->setAlignment(pAlignment);\n    res->setFont(font);\n\n    \/\/ Prevent Qt from associating a context menu with the label (something\n    \/\/ which it does automatically when a label is a link...)\n\n    res->setContextMenuPolicy(Qt::NoContextMenu);\n\n    \/\/ Return our link\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, const double &pFontPercentage,\n                  const bool &pBold, const bool &pItalic, QWidget *pParent)\n{\n    \/\/ Create and return a label\n\n    return newLabel(pText, pFontPercentage, pBold, pItalic,\n                    Qt::AlignLeft|Qt::AlignVCenter, pParent);\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, const double &pFontPercentage,\n                  const bool &pBold, QWidget *pParent)\n{\n    \/\/ Create and return a label\n\n    return newLabel(pText, pFontPercentage, pBold, false,\n                    Qt::AlignLeft|Qt::AlignVCenter, pParent);\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, const double &pFontPercentage,\n                  QWidget *pParent)\n{\n    \/\/ Create and return a label\n\n    return newLabel(pText, pFontPercentage, false, false,\n                    Qt::AlignLeft|Qt::AlignVCenter, pParent);\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, QWidget *pParent)\n{\n    \/\/ Create and return a label\n\n    return newLabel(pText, 1.0, false, false, Qt::AlignLeft|Qt::AlignVCenter,\n                    pParent);\n}\n\n\/\/==============================================================================\n\nQString copyright()\n{\n    \/\/ Return a generic copyright\n\n    return QObject::tr(\"Copyright\")+\" ©2011-\"+QString::number(QDate::currentDate().year());\n}\n\n\/\/==============================================================================\n\n}   \/\/ namespace Core\n}   \/\/ namespace OpenCOR\n\n\/\/==============================================================================\n\/\/ End of file\n\/\/==============================================================================\n<commit_msg>Retrieve the total physical memory available.<commit_after>\/\/==============================================================================\n\/\/ Core utilities\n\/\/==============================================================================\n\n#include \"commonwidget.h\"\n#include \"coreutils.h\"\n\n\/\/==============================================================================\n\n#include <QApplication>\n#include <QDate>\n#include <QDir>\n#include <QFile>\n#include <QFileDialog>\n#include <QFrame>\n#include <QLabel>\n#include <QMessageBox>\n#include <QProcess>\n#include <QResource>\n#include <QSettings>\n#include <QTextEdit>\n#include <QVariant>\n#include <QWidget>\n\n\/\/==============================================================================\n\n#if defined(Q_OS_WIN)\n    #include <Windows.h>\n#elif defined(Q_OS_MAC)\n    #include <sys\/sysctl.h>\n#endif\n\n\/\/==============================================================================\n\nnamespace OpenCOR {\nnamespace Core {\n\n\/\/==============================================================================\n\nunsigned long totalPhysicalMemory()\n{\n    \/\/ Retrieve and return in bytes the total amount of physical memory\n    \/\/ available\n\n    unsigned long res = 0;\n\n#if defined(Q_OS_WIN)\n    MEMORYSTATUSEX memStatus;\n\n    memStatus.dwLength = sizeof(memStatus);\n\n    GlobalMemoryStatusEx(&memStatus);\n\n    res = memStatus.ullTotalPhys;\n#elif defined(Q_OS_LINUX)\n    res = sysconf(_SC_PHYS_PAGES)*sysconf(_SC_PAGESIZE);\n#elif defined(Q_OS_MAC)\n    int mib[2];\n\n    mib[0] = CTL_HW;\n    mib[1] = HW_MEMSIZE;\n\n    size_t len = sizeof(res);\n\n    sysctl(mib, 2, &res, &len, 0, 0);\n#else\n    #error Unsupported platform\n#endif\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQByteArray resourceAsByteArray(const QString &pResource)\n{\n    \/\/ Retrieve a resource as a QByteArray\n\n    QResource resource(pResource);\n\n    if (resource.isValid()) {\n        if (resource.isCompressed())\n            \/\/ The resource is compressed, so uncompress it before returning it\n\n            return qUncompress(reinterpret_cast<const uchar *>(resource.data()),\n                               resource.size());\n        else\n            \/\/ The resource is not compressed, so just return it after doing the\n            \/\/ right conversion\n\n            return QByteArray(reinterpret_cast<const char *>(resource.data()),\n                              resource.size());\n    }\n    else {\n        \/\/ The resource doesn't exist, so...\n\n        return QByteArray();\n    }\n}\n\n\/\/==============================================================================\n\nbool saveResourceAs(const QString &pResource, const QString &pFilename)\n{\n    if (QResource(pResource).isValid()) {\n        \/\/ The resource exists, so write a file with name pFilename and which\n        \/\/ contents is that of the resource which is retrieved as a QByteArray\n\n        QFile file(pFilename);\n\n        if (file.open(QIODevice::ReadWrite)) {\n            QByteArray resource = resourceAsByteArray(pResource);\n            bool res;\n\n            res = file.write(resource) == resource.size();\n\n            file.close();\n\n            \/\/ Remove the newly created file in case not all the resource was\n            \/\/ written to it\n\n            if (!res)\n                file.remove();\n\n            return res;\n        } else {\n            return false;\n        }\n    } else {\n        return false;\n    }\n}\n\n\/\/==============================================================================\n\nvoid * globalInstance(const QString &pObjectName, void *pDefaultGlobalInstance)\n{\n    \/\/ Retrieve the 'global' instance of an object\n    \/\/ Note: initially, the plan was to have a static instance of an object and\n    \/\/       return its address. However, this approach doesn't work on Windows\n    \/\/       and Linux (but does on OS X). Indeed, say that the Core plugin is\n    \/\/       required by two other plugins, then these two plugins won't get the\n    \/\/       same 'copy' of the Core plugin. (It seems like) each 'copy' gets\n    \/\/       its own address space. (This is not the case on OS X, (most likely)\n    \/\/       because of the way applications are bundled on that platform.) To\n    \/\/       address this issue, we keep track of the address of a 'global'\n    \/\/       instance using QSettings. Now, this approach works fine on both\n    \/\/       Windows and Linux, but... not on OS X (!!). (It would seem that)\n    \/\/       there are some read\/write conflicts (when using QSettings). These\n    \/\/       conflicts would normally be addressed using a mutex, but then we\n    \/\/       would be back to the issue of being able to share something between\n    \/\/       different plugins. So, instead, we, on OS X, revert to our original\n    \/\/       plan...\n\n#ifdef Q_OS_MAC\n    Q_UNUSED(pObjectName);\n\n    return (void *) pDefaultGlobalInstance;\n#else\n    QSettings settings(qApp->applicationName());\n    qlonglong globalInstance;\n\n    settings.beginGroup(SettingsGlobal);\n        globalInstance = settings.value(pObjectName, 0).toLongLong();\n\n        if (!globalInstance) {\n            \/\/ There is no 'global' instance associated with the given object,\n            \/\/ so use the object's default 'global' instance we were given\n\n            globalInstance = (qlonglong) pDefaultGlobalInstance;\n\n            settings.setValue(pObjectName, globalInstance);\n        }\n    settings.endGroup();\n\n    \/\/ Return the class's 'global' instance\n\n    return (void *) globalInstance;\n#endif\n}\n\n\/\/==============================================================================\n\nvoid CORE_EXPORT setActiveDirectory(const QString &pDirName)\n{\n    \/\/ Keep track of the active directory\n\n    QSettings settings(qApp->applicationName());\n\n    settings.beginGroup(SettingsGlobal);\n        settings.setValue(SettingsActiveDirectory, pDirName);\n    settings.endGroup();\n}\n\n\/\/==============================================================================\n\nQString CORE_EXPORT activeDirectory()\n{\n    \/\/ Retrieve and return the active directory\n\n    QString res;\n    QSettings settings(qApp->applicationName());\n\n    settings.beginGroup(SettingsGlobal);\n        res = settings.value(SettingsActiveDirectory).toString();\n    settings.endGroup();\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQStringList CORE_EXPORT getOpenFileNames(const QString &pCaption,\n                                         const QString &pFilter)\n{\n    \/\/ Retrieve and return one or several open file names\n\n    QStringList res = QFileDialog::getOpenFileNames(qApp->activeWindow(),\n                                                    pCaption,\n                                                    activeDirectory(),\n                                                    pFilter);\n\n    if (res.count())\n        \/\/ We have retrieve at least one open file name, so we can keep track of\n        \/\/ the folder in which it is\n        \/\/ Note #1: we use the last open file name to determine the folder that\n        \/\/          is to be remembered since on Windows 7, at least, it's\n        \/\/          possible to search for files from within the file dialog\n        \/\/          box, the last open file name should be the one we are\n        \/\/          'interested' in...\n        \/\/ Note #2: this doesn't, unfortunately, address the case where the user\n        \/\/          goes to a directory and then closes the file dialog box\n        \/\/          without selecting any open file name. There might be a way\n        \/\/          to get it to work, but that would involve using the exec()\n        \/\/          method rather than the static getOpenFilesNames() method,\n        \/\/          which would result in a non-native looking file dialog box\n        \/\/          (on Windows 7 at least), so it's not an option\n        \/\/          unfortunately...\n\n        setActiveDirectory(QFileInfo(res[res.count()-1]).path());\n\n    \/\/ Return the open file name(s)\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQString CORE_EXPORT getSaveFileName(const QString &pCaption,\n                                    const QString &pFileName,\n                                    const QString &pFilter)\n{\n    \/\/ Retrieve and return a save file name\n\n    QString res = QDir::toNativeSeparators(QFileDialog::getSaveFileName(qApp->activeWindow(),\n                                                                        pCaption,\n                                                                        pFileName.isEmpty()?\n                                                                            activeDirectory():\n                                                                            QFileInfo(pFileName).canonicalPath(),\n#if defined(Q_OS_WIN) || defined(Q_OS_LINUX)\n                                                                        pFilter, 0,\n#elif defined(Q_OS_MAC)\n\/\/---GRY--- FOR SOME REASONS, OS X \/ Qt DOESN'T LIKE US SPECIFYING SUPPORTED\n\/\/          FILE TYPES...!? (SEE https:\/\/github.com\/opencor\/opencor\/issues\/110)\n                                                                        QString(), 0,\n#else\n    #error Unsupported platform\n#endif\n                                                                        QFileDialog::DontConfirmOverwrite));\n\n    \/\/ Make sure that we got a save file name\n\n    if (!res.isEmpty()) {\n        \/\/ Update our active directory\n\n        QFileInfo resInfo = res;\n\n        setActiveDirectory(resInfo.path());\n\n        \/\/ Check whether the save file already exists\n\n        if (resInfo.exists())\n            \/\/ The save file already exists, so ask whether we want to overwrite\n            \/\/ it\n\n            if (QMessageBox::question(qApp->activeWindow(),\n                                      qApp->applicationName(),\n                                      QObject::tr(\"<strong>%1<\/strong> already exists. Do you want to overwrite it?\").arg(res),\n                                      QMessageBox::Yes|QMessageBox::No,\n                                      QMessageBox::Yes) == QMessageBox::No )\n                \/\/ We don't want to overwrite the save file, so...\n\n                return QString();\n    }\n\n    \/\/ Everything went fine,so return the save file name\n\n    return res;\n}\n\n\/\/==============================================================================\n\nvoid setFocusTo(QWidget *pWidget)\n{\n    \/\/ Give the focus to pWidget, but then revert the focus back to whoever had\n    \/\/ it before, if needed\n\n    if (!pWidget)\n        return;\n\n    QWidget *focusedWidget = qApp->activeWindow()?\n                                 qApp->activeWindow()->focusWidget():\n                                 0;\n\n    pWidget->setFocus();\n\n    if (   focusedWidget\n        && (pWidget->parentWidget() != focusedWidget->parentWidget()))\n        \/\/ The current and previously focused widgets don't share the same\n        \/\/ parent, so revert the focus back to the previously focused widget\n\n        focusedWidget->setFocus();\n}\n\n\/\/==============================================================================\n\nQString nativeCanonicalFileName(const QString &pFileName)\n{\n    \/\/ Return a native and canonical version of the file's name\n\n    return QDir::toNativeSeparators(QFileInfo(pFileName).canonicalFilePath());\n}\n\n\/\/==============================================================================\n\nQFrame * newLineWidget(const bool &pHorizontal, const QColor &pColor,\n                       QWidget *pParent)\n{\n    \/\/ Create and return a 'real' line widget, i.e. one which is 1 pixel wide,\n    \/\/ using a QFrame widget\n\n    QFrame *res = new QFrame(pParent);\n\n    res->setStyleSheet(QString(\"QFrame {\"\n                               \"    border: 1px solid rgb(%1, %2, %3);\"\n                               \"}\").arg(QString::number(pColor.red()),\n                                        QString::number(pColor.green()),\n                                        QString::number(pColor.blue())));\n\n    if (pHorizontal) {\n        res->setSizePolicy(QSizePolicy::Preferred, QSizePolicy::Fixed);\n        res->setFixedHeight(1);\n    } else {\n        res->setSizePolicy(QSizePolicy::Fixed, QSizePolicy::Preferred);\n        res->setFixedWidth(1);\n    }\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQFrame * newLineWidget(const bool &pHorizontal, QWidget *pParent)\n{\n    \/\/ Create and return a 'real' horizontal line widget\n\n    return newLineWidget(pHorizontal, CommonWidget::borderColor(), pParent);\n}\n\n\/\/==============================================================================\n\nQFrame * newLineWidget(const QColor &pColor, QWidget *pParent)\n{\n    \/\/ Create and return a 'real' horizontal line widget\n\n    return newLineWidget(true, pColor, pParent);\n}\n\n\/\/==============================================================================\n\nQFrame * newLineWidget(QWidget *pParent)\n{\n    \/\/ Create and return a 'real' horizontal line widget\n\n    return newLineWidget(true, CommonWidget::borderColor(), pParent);\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, const double &pFontPercentage,\n                  const bool &pBold, const bool &pItalic,\n                  const Qt::Alignment &pAlignment, QWidget *pParent)\n{\n    \/\/ Create and return a label, after having set some of its properties\n\n    QLabel *res = new QLabel(pText, pParent);\n\n    QFont font = res->font();\n\n    font.setBold(pBold);\n    font.setItalic(pItalic);\n    font.setPointSize(pFontPercentage*font.pointSize());\n\n    res->setAlignment(pAlignment);\n    res->setFont(font);\n\n    \/\/ Prevent Qt from associating a context menu with the label (something\n    \/\/ which it does automatically when a label is a link...)\n\n    res->setContextMenuPolicy(Qt::NoContextMenu);\n\n    \/\/ Return our link\n\n    return res;\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, const double &pFontPercentage,\n                  const bool &pBold, const bool &pItalic, QWidget *pParent)\n{\n    \/\/ Create and return a label\n\n    return newLabel(pText, pFontPercentage, pBold, pItalic,\n                    Qt::AlignLeft|Qt::AlignVCenter, pParent);\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, const double &pFontPercentage,\n                  const bool &pBold, QWidget *pParent)\n{\n    \/\/ Create and return a label\n\n    return newLabel(pText, pFontPercentage, pBold, false,\n                    Qt::AlignLeft|Qt::AlignVCenter, pParent);\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, const double &pFontPercentage,\n                  QWidget *pParent)\n{\n    \/\/ Create and return a label\n\n    return newLabel(pText, pFontPercentage, false, false,\n                    Qt::AlignLeft|Qt::AlignVCenter, pParent);\n}\n\n\/\/==============================================================================\n\nQLabel * newLabel(const QString &pText, QWidget *pParent)\n{\n    \/\/ Create and return a label\n\n    return newLabel(pText, 1.0, false, false, Qt::AlignLeft|Qt::AlignVCenter,\n                    pParent);\n}\n\n\/\/==============================================================================\n\nQString copyright()\n{\n    \/\/ Return a generic copyright\n\n    return QObject::tr(\"Copyright\")+\" ©2011-\"+QString::number(QDate::currentDate().year());\n}\n\n\/\/==============================================================================\n\n}   \/\/ namespace Core\n}   \/\/ namespace OpenCOR\n\n\/\/==============================================================================\n\/\/ End of file\n\/\/==============================================================================\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n * Copyright 2016 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_UTIL_INTERPROCESS_CONDVAR\n#define REALM_UTIL_INTERPROCESS_CONDVAR\n\n\n#include <realm\/util\/features.h>\n#include <realm\/util\/thread.hpp>\n#include <realm\/util\/interprocess_mutex.hpp>\n#include <cstdint>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <mutex>\n\n\/\/ Condvar Emulation is required if RobustMutex emulation is enabled\n#if defined(REALM_ROBUST_MUTEX_EMULATION) || defined(_WIN32)\n#define REALM_CONDVAR_EMULATION\n#endif\n\nnamespace realm {\nnamespace util {\n\n\n\/\/\/ Condition variable for use in synchronization monitors.\n\/\/\/ This condition variable uses emulation based on named pipes\n\/\/\/ for the inter-process case, if enabled by REALM_CONDVAR_EMULATION.\n\/\/\/\n\/\/\/ FIXME: This implementation will never release\/delete pipes. This is unlikely\n\/\/\/ to be a problem as long as only a modest number of different database names\n\/\/\/ are in use\n\/\/\/\n\/\/\/ A InterprocessCondVar is always process shared.\nclass InterprocessCondVar {\npublic:\n    InterprocessCondVar();\n    ~InterprocessCondVar() noexcept;\n\n    \/\/ Disable copying. Copying an open file will create a scenario\n    \/\/ where the same file descriptor will be opened once but closed twice.\n    InterprocessCondVar(const InterprocessCondVar&) = delete;\n    InterprocessCondVar& operator=(const InterprocessCondVar&) = delete;\n\n    \/\/\/ To use the InterprocessCondVar, you also must place a structure of type\n    \/\/\/ InterprocessCondVar::SharedPart in memory shared by multiple processes\n    \/\/\/ or in a memory mapped file, and use set_shared_part() to associate\n    \/\/\/ the condition variable with it's shared part. You must initialize\n    \/\/\/ the shared part using InterprocessCondVar::init_shared_part(), but only before\n    \/\/\/ first use and only when you have exclusive access to the shared part.\n\n#ifdef REALM_CONDVAR_EMULATION\n    struct SharedPart {\n#ifdef _WIN32\n        \/\/ See top of .cpp for description of how windows implementation works.\n        std::atomic_int32_t m_max_process_num;\n        bool m_any_waiters; \/\/ guarded by mutex associated with this CondVar.\n\n        static_assert(std::atomic_int32_t::is_always_lock_free);\n#else\n        uint64_t signal_counter;\n        uint64_t wait_counter;\n#endif\n    };\n#else\n    typedef CondVar SharedPart;\n#endif\n\n    \/\/\/ You need to bind the emulation to a SharedPart in shared\/mmapped memory.\n    \/\/\/ The SharedPart is assumed to have been initialized (possibly by another process)\n    \/\/\/ earlier through a call to init_shared_part.\n    void set_shared_part(SharedPart& shared_part, std::string path, std::string condvar_name, std::string tmp_path);\n\n    \/\/\/ Initialize the shared part of a process shared condition variable.\n    \/\/\/ A process shared condition variables may be represented by any number of\n    \/\/\/ InterprocessCondVar instances in any number of different processes,\n    \/\/\/ all sharing a common SharedPart instance, which must be in shared memory.\n    static void init_shared_part(SharedPart& shared_part);\n\n    \/\/\/ Release any system resources allocated for the shared part. This should\n    \/\/\/ be used *only* when you are certain, that nobody is using it.\n    void release_shared_part();\n\n    \/\/\/ Wait for someone to call notify_all() on this condition\n    \/\/\/ variable. The call to wait() may return spuriously, so the caller should\n    \/\/\/ always re-evaluate the condition on which to wait and loop on wait()\n    \/\/\/ if necessary.\n    void wait(InterprocessMutex& m, const struct timespec* tp);\n\n    \/\/\/ While cond() returns false, waits for a call to notify_all(). This is\n    \/\/\/ the preferred overload to use because it correctly handles spurious\n    \/\/\/ wakeups, and avoids some condvar anti-patterns, by pushing callers into\n    \/\/\/ the correct pattern.\n    template <typename Cond>\n    void wait(InterprocessMutex& m, const struct timespec* tp, Cond&& cond)\n    {\n        using clock = std::chrono::system_clock;\n        const auto deadline =\n            tp ? clock::time_point(std::chrono::seconds(tp->tv_sec) + std::chrono::nanoseconds(tp->tv_nsec))\n               : clock::time_point();\n        while (!cond()) {\n            wait(m, tp);\n            if (tp && clock::now() >= deadline)\n                return;\n        }\n    }\n\n    \/\/\/ Wake up every thread that is currently waiting on this condition.\n    \/\/\/ The caller must hold the lock associated with the condvar at the time\n    \/\/\/ of calling notify_all().\n    \/\/\/ In order to avoid missed wakeups in the case of sudden process termination, it is important\n    \/\/\/ to notify the CV *prior* to changing the state that the condition variable is protecting,\n    \/\/\/ within the same mutex hold.\n    void notify_all() noexcept;\n\n    \/\/\/ Cleanup and release system resources if possible.\n    void close() noexcept;\n\nprivate:\n    \/\/ non-zero if a shared part has been registered (always 0 on process local instances)\n    SharedPart* m_shared_part = nullptr;\n\n#ifdef REALM_CONDVAR_EMULATION\n    \/\/ keep the path to allocated system resource so we can remove them again\n    std::string m_resource_path;\n    \/\/ pipe used for emulation. When using a named pipe, m_fd_read is read-write and m_fd_write is unused.\n    \/\/ When using an anonymous pipe (currently only for tvOS) m_fd_read is read-only and m_fd_write is write-only.\n    int m_fd_read = -1;\n    int m_fd_write = -1;\n#endif\n\n#ifdef _WIN32\n    \/\/ A wrapper around HANDLE that auto-closes.\n    struct HandleHolder {\n        HandleHolder() = default;\n        \/*implicit*\/ HandleHolder(HANDLE h)\n            : handle(h)\n        {\n        }\n        ~HandleHolder()\n        {\n            if (handle)\n                REALM_ASSERT_RELEASE(CloseHandle(handle));\n        }\n        HandleHolder(HandleHolder&& other) noexcept\n            : handle(std::exchange(other.handle, {}))\n        {\n        }\n        HandleHolder& operator=(HandleHolder&& other) noexcept\n        {\n            if (handle)\n                REALM_ASSERT_RELEASE(CloseHandle(handle));\n            handle = std::exchange(other.handle, {});\n            return *this;\n        }\n\n        \/*implicit*\/ operator HANDLE() const\n        {\n            return handle;\n        }\n\n        explicit operator bool() const\n        {\n            return bool(handle);\n        }\n\n        HANDLE handle = {};\n    };\n\n    struct Event {\n        void wait(DWORD millis = INFINITE) noexcept;\n        void set() noexcept;\n        void reset() noexcept;\n        HandleHolder handle;\n    };\n\n    struct Mutex {\n        void lock() noexcept;\n        bool try_lock() noexcept;\n        void unlock() noexcept;\n        HandleHolder handle;\n    };\n\n    void update_event_handles();\n    Event open_event(int32_t n);\n    Mutex open_mutex(int32_t n);\n    Mutex open_mutex(std::string name);\n\n    Event& my_event() noexcept\n    {\n        return m_events[m_my_id];\n    }\n\n    int32_t m_my_id = -1;\n    std::vector<Event> m_events;\n\n    \/\/ Held whole time this condvar object lives.\n    Mutex m_my_mutex;\n\n    \/\/ The main algorithm only supports one waiter per process.\n    \/\/ These members exist to extend that to support N waiters per process.\n    \/\/ They are guarded by the mutex associated with this cv.\n    std::condition_variable_any m_waiter_cv;\n    int64_t m_highest_waiter = 0;\n    int64_t m_signaled_waiters = 0;\n    bool m_have_waiter = false;\n\n    std::string m_name_with_path;\n#endif\n};\n\n\n\/\/ Implementation:\n\n\n} \/\/ namespace util\n} \/\/ namespace realm\n\n\n#endif\n<commit_msg>Better usage of std::chrono<commit_after>\/*************************************************************************\n *\n * Copyright 2016 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_UTIL_INTERPROCESS_CONDVAR\n#define REALM_UTIL_INTERPROCESS_CONDVAR\n\n\n#include <realm\/util\/features.h>\n#include <realm\/util\/thread.hpp>\n#include <realm\/util\/interprocess_mutex.hpp>\n#include <cstdint>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <mutex>\n\n\/\/ Condvar Emulation is required if RobustMutex emulation is enabled\n#if defined(REALM_ROBUST_MUTEX_EMULATION) || defined(_WIN32)\n#define REALM_CONDVAR_EMULATION\n#endif\n\nnamespace realm {\nnamespace util {\n\n\n\/\/\/ Condition variable for use in synchronization monitors.\n\/\/\/ This condition variable uses emulation based on named pipes\n\/\/\/ for the inter-process case, if enabled by REALM_CONDVAR_EMULATION.\n\/\/\/\n\/\/\/ FIXME: This implementation will never release\/delete pipes. This is unlikely\n\/\/\/ to be a problem as long as only a modest number of different database names\n\/\/\/ are in use\n\/\/\/\n\/\/\/ A InterprocessCondVar is always process shared.\nclass InterprocessCondVar {\npublic:\n    InterprocessCondVar();\n    ~InterprocessCondVar() noexcept;\n\n    \/\/ Disable copying. Copying an open file will create a scenario\n    \/\/ where the same file descriptor will be opened once but closed twice.\n    InterprocessCondVar(const InterprocessCondVar&) = delete;\n    InterprocessCondVar& operator=(const InterprocessCondVar&) = delete;\n\n    \/\/\/ To use the InterprocessCondVar, you also must place a structure of type\n    \/\/\/ InterprocessCondVar::SharedPart in memory shared by multiple processes\n    \/\/\/ or in a memory mapped file, and use set_shared_part() to associate\n    \/\/\/ the condition variable with it's shared part. You must initialize\n    \/\/\/ the shared part using InterprocessCondVar::init_shared_part(), but only before\n    \/\/\/ first use and only when you have exclusive access to the shared part.\n\n#ifdef REALM_CONDVAR_EMULATION\n    struct SharedPart {\n#ifdef _WIN32\n        \/\/ See top of .cpp for description of how windows implementation works.\n        std::atomic_int32_t m_max_process_num;\n        bool m_any_waiters; \/\/ guarded by mutex associated with this CondVar.\n\n        static_assert(std::atomic_int32_t::is_always_lock_free);\n#else\n        uint64_t signal_counter;\n        uint64_t wait_counter;\n#endif\n    };\n#else\n    typedef CondVar SharedPart;\n#endif\n\n    \/\/\/ You need to bind the emulation to a SharedPart in shared\/mmapped memory.\n    \/\/\/ The SharedPart is assumed to have been initialized (possibly by another process)\n    \/\/\/ earlier through a call to init_shared_part.\n    void set_shared_part(SharedPart& shared_part, std::string path, std::string condvar_name, std::string tmp_path);\n\n    \/\/\/ Initialize the shared part of a process shared condition variable.\n    \/\/\/ A process shared condition variables may be represented by any number of\n    \/\/\/ InterprocessCondVar instances in any number of different processes,\n    \/\/\/ all sharing a common SharedPart instance, which must be in shared memory.\n    static void init_shared_part(SharedPart& shared_part);\n\n    \/\/\/ Release any system resources allocated for the shared part. This should\n    \/\/\/ be used *only* when you are certain, that nobody is using it.\n    void release_shared_part();\n\n    \/\/\/ Wait for someone to call notify_all() on this condition\n    \/\/\/ variable. The call to wait() may return spuriously, so the caller should\n    \/\/\/ always re-evaluate the condition on which to wait and loop on wait()\n    \/\/\/ if necessary.\n    void wait(InterprocessMutex& m, const struct timespec* tp);\n\n    \/\/\/ While cond() returns false, waits for a call to notify_all(). This is\n    \/\/\/ the preferred overload to use because it correctly handles spurious\n    \/\/\/ wakeups, and avoids some condvar anti-patterns, by pushing callers into\n    \/\/\/ the correct pattern.\n    template <typename Cond>\n    void wait(InterprocessMutex& m, const struct timespec* tp, Cond&& cond)\n    {\n        using clock = std::chrono::system_clock;\n        const auto deadline =\n            tp ? clock::time_point::ceil(clock::from_time_t(tp->tv_sec) + std::chrono::nanoseconds(tp->tv_nsec))\n               : clock::time_point();\n        while (!cond()) {\n            wait(m, tp);\n            if (tp && clock::now() >= deadline)\n                return;\n        }\n    }\n\n    \/\/\/ Wake up every thread that is currently waiting on this condition.\n    \/\/\/ The caller must hold the lock associated with the condvar at the time\n    \/\/\/ of calling notify_all().\n    \/\/\/ In order to avoid missed wakeups in the case of sudden process termination, it is important\n    \/\/\/ to notify the CV *prior* to changing the state that the condition variable is protecting,\n    \/\/\/ within the same mutex hold.\n    void notify_all() noexcept;\n\n    \/\/\/ Cleanup and release system resources if possible.\n    void close() noexcept;\n\nprivate:\n    \/\/ non-zero if a shared part has been registered (always 0 on process local instances)\n    SharedPart* m_shared_part = nullptr;\n\n#ifdef REALM_CONDVAR_EMULATION\n    \/\/ keep the path to allocated system resource so we can remove them again\n    std::string m_resource_path;\n    \/\/ pipe used for emulation. When using a named pipe, m_fd_read is read-write and m_fd_write is unused.\n    \/\/ When using an anonymous pipe (currently only for tvOS) m_fd_read is read-only and m_fd_write is write-only.\n    int m_fd_read = -1;\n    int m_fd_write = -1;\n#endif\n\n#ifdef _WIN32\n    \/\/ A wrapper around HANDLE that auto-closes.\n    struct HandleHolder {\n        HandleHolder() = default;\n        \/*implicit*\/ HandleHolder(HANDLE h)\n            : handle(h)\n        {\n        }\n        ~HandleHolder()\n        {\n            if (handle)\n                REALM_ASSERT_RELEASE(CloseHandle(handle));\n        }\n        HandleHolder(HandleHolder&& other) noexcept\n            : handle(std::exchange(other.handle, {}))\n        {\n        }\n        HandleHolder& operator=(HandleHolder&& other) noexcept\n        {\n            if (handle)\n                REALM_ASSERT_RELEASE(CloseHandle(handle));\n            handle = std::exchange(other.handle, {});\n            return *this;\n        }\n\n        \/*implicit*\/ operator HANDLE() const\n        {\n            return handle;\n        }\n\n        explicit operator bool() const\n        {\n            return bool(handle);\n        }\n\n        HANDLE handle = {};\n    };\n\n    struct Event {\n        void wait(DWORD millis = INFINITE) noexcept;\n        void set() noexcept;\n        void reset() noexcept;\n        HandleHolder handle;\n    };\n\n    struct Mutex {\n        void lock() noexcept;\n        bool try_lock() noexcept;\n        void unlock() noexcept;\n        HandleHolder handle;\n    };\n\n    void update_event_handles();\n    Event open_event(int32_t n);\n    Mutex open_mutex(int32_t n);\n    Mutex open_mutex(std::string name);\n\n    Event& my_event() noexcept\n    {\n        return m_events[m_my_id];\n    }\n\n    int32_t m_my_id = -1;\n    std::vector<Event> m_events;\n\n    \/\/ Held whole time this condvar object lives.\n    Mutex m_my_mutex;\n\n    \/\/ The main algorithm only supports one waiter per process.\n    \/\/ These members exist to extend that to support N waiters per process.\n    \/\/ They are guarded by the mutex associated with this cv.\n    std::condition_variable_any m_waiter_cv;\n    int64_t m_highest_waiter = 0;\n    int64_t m_signaled_waiters = 0;\n    bool m_have_waiter = false;\n\n    std::string m_name_with_path;\n#endif\n};\n\n\n\/\/ Implementation:\n\n\n} \/\/ namespace util\n} \/\/ namespace realm\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2016+     AzerothCore <www.azerothcore.org>, released under GNU GPL v2 license: https:\/\/github.com\/azerothcore\/azerothcore-wotlk\/blob\/master\/LICENSE-GPL2\n * Copyright (C) 2008-2016 TrinityCore <http:\/\/www.trinitycore.org\/>\n * Copyright (C) 2005-2009 MaNGOS <http:\/\/getmangos.com\/>\n *\/\n\n#include \"AccountMgr.h\"\n#include \"DatabaseEnv.h\"\n#include \"ObjectAccessor.h\"\n#include \"Player.h\"\n#include \"ScriptMgr.h\"\n#include \"Util.h\"\n#include \"SHA1.h\"\n#include \"WorldSession.h\"\n\nnamespace AccountMgr\n{\n\n    AccountOpResult CreateAccount(std::string username, std::string password)\n    {\n        if (utf8length(username) > MAX_ACCOUNT_STR)\n            return AOR_NAME_TOO_LONG;                           \/\/ username's too long\n\n        if (utf8length(password) > MAX_PASS_STR)\n            return AccountOpResult::AOR_PASS_TOO_LONG;          \/\/ password's too long\n\n        normalizeString(username);\n        normalizeString(password);\n\n        if (GetId(username))\n            return AOR_NAME_ALREDY_EXIST;                       \/\/ username does already exist\n\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_INS_ACCOUNT);\n\n        stmt->setString(0, username);\n        stmt->setString(1, CalculateShaPassHash(username, password));\n        stmt->setInt8(2, uint8(sWorld->getIntConfig(CONFIG_EXPANSION)));\n\n        LoginDatabase.Execute(stmt);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_INS_REALM_CHARACTERS_INIT);\n\n        LoginDatabase.Execute(stmt);\n\n        return AOR_OK;                                          \/\/ everything's fine\n    }\n\n    AccountOpResult DeleteAccount(uint32 accountId)\n    {\n        \/\/ Check if accounts exists\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_SEL_ACCOUNT_BY_ID);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        if (!result)\n            return AOR_NAME_NOT_EXIST;\n\n        \/\/ Obtain accounts characters\n        stmt = CharacterDatabase.GetPreparedStatement(CHAR_SEL_CHARS_BY_ACCOUNT_ID);\n\n        stmt->setUInt32(0, accountId);\n\n        result = CharacterDatabase.Query(stmt);\n\n        if (result)\n        {\n            do\n            {\n                uint32 guidLow = (*result)[0].GetUInt32();\n                uint64 guid = MAKE_NEW_GUID(guidLow, 0, HIGHGUID_PLAYER);\n\n                \/\/ Kick if player is online\n                if (Player* p = ObjectAccessor::FindPlayer(guid))\n                {\n                    WorldSession* s = p->GetSession();\n                    s->KickPlayer(\"Delete account\");            \/\/ mark session to remove at next session list update\n                    s->LogoutPlayer(false);                     \/\/ logout player without waiting next session list update\n                }\n\n                Player::DeleteFromDB(guid, accountId, false, true);       \/\/ no need to update realm characters\n            } while (result->NextRow());\n        }\n\n        \/\/ table realm specific but common for all characters of account for realm\n        stmt = CharacterDatabase.GetPreparedStatement(CHAR_DEL_TUTORIALS);\n        stmt->setUInt32(0, accountId);\n        CharacterDatabase.Execute(stmt);\n\n        stmt = CharacterDatabase.GetPreparedStatement(CHAR_DEL_ACCOUNT_DATA);\n        stmt->setUInt32(0, accountId);\n        CharacterDatabase.Execute(stmt);\n\n        stmt = CharacterDatabase.GetPreparedStatement(CHAR_DEL_CHARACTER_BAN);\n        stmt->setUInt32(0, accountId);\n        CharacterDatabase.Execute(stmt);\n\n        SQLTransaction trans = LoginDatabase.BeginTransaction();\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_DEL_ACCOUNT);\n        stmt->setUInt32(0, accountId);\n        trans->Append(stmt);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_DEL_ACCOUNT_ACCESS);\n        stmt->setUInt32(0, accountId);\n        trans->Append(stmt);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_DEL_REALM_CHARACTERS);\n        stmt->setUInt32(0, accountId);\n        trans->Append(stmt);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_DEL_ACCOUNT_BANNED);\n        stmt->setUInt32(0, accountId);\n        trans->Append(stmt);\n\n        LoginDatabase.CommitTransaction(trans);\n\n        return AOR_OK;\n    }\n\n\n    AccountOpResult ChangeUsername(uint32 accountId, std::string newUsername, std::string newPassword)\n    {\n        \/\/ Check if accounts exists\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_SEL_ACCOUNT_BY_ID);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        if (!result)\n            return AOR_NAME_NOT_EXIST;\n\n        if (utf8length(newUsername) > MAX_ACCOUNT_STR)\n            return AOR_NAME_TOO_LONG;\n\n        if (utf8length(newPassword) > MAX_ACCOUNT_STR)\n            return AOR_PASS_TOO_LONG;\n\n        normalizeString(newUsername);\n        normalizeString(newPassword);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_UPD_USERNAME);\n\n        stmt->setString(0, newUsername);\n        stmt->setString(1, CalculateShaPassHash(newUsername, newPassword));\n        stmt->setUInt32(2, accountId);\n\n        LoginDatabase.Execute(stmt);\n\n        return AOR_OK;\n    }\n\n    AccountOpResult ChangePassword(uint32 accountId, std::string newPassword)\n    {\n        std::string username;\n\n        if (!GetName(accountId, username))\n        {\n            sScriptMgr->OnFailedPasswordChange(accountId);\n            return AOR_NAME_NOT_EXIST;                          \/\/ account doesn't exist\n        }\n\n        if (utf8length(newPassword) > MAX_ACCOUNT_STR)\n        {\n            sScriptMgr->OnFailedEmailChange(accountId);\n            return AOR_PASS_TOO_LONG;\n        }\n\n        normalizeString(username);\n        normalizeString(newPassword);\n\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_UPD_PASSWORD);\n\n        stmt->setString(0, CalculateShaPassHash(username, newPassword));\n        stmt->setUInt32(1, accountId);\n\n        LoginDatabase.Execute(stmt);\n\n        sScriptMgr->OnPasswordChange(accountId);\n        return AOR_OK;\n    }\n\n    uint32 GetId(std::string const& username)\n    {\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_GET_ACCOUNT_ID_BY_USERNAME);\n        stmt->setString(0, username);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        return (result) ? (*result)[0].GetUInt32() : 0;\n    }\n\n    uint32 GetSecurity(uint32 accountId)\n    {\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_GET_ACCOUNT_ACCESS_GMLEVEL);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        return (result) ? (*result)[0].GetUInt8() : uint32(SEC_PLAYER);\n    }\n\n    uint32 GetSecurity(uint32 accountId, int32 realmId)\n    {\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_GET_GMLEVEL_BY_REALMID);\n        stmt->setUInt32(0, accountId);\n        stmt->setInt32(1, realmId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        return (result) ? (*result)[0].GetUInt8() : uint32(SEC_PLAYER);\n    }\n\n    bool GetName(uint32 accountId, std::string& name)\n    {\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_GET_USERNAME_BY_ID);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        if (result)\n        {\n            name = (*result)[0].GetString();\n            return true;\n        }\n\n        return false;\n    }\n\n    bool CheckPassword(uint32 accountId, std::string password)\n    {\n        std::string username;\n\n        if (!GetName(accountId, username))\n            return false;\n\n        normalizeString(username);\n        normalizeString(password);\n\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_SEL_CHECK_PASSWORD);\n        stmt->setUInt32(0, accountId);\n        stmt->setString(1, CalculateShaPassHash(username, password));\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        return (result) ? true : false;\n    }\n\n    uint32 GetCharactersCount(uint32 accountId)\n    {\n        \/\/ check character count\n        PreparedStatement* stmt = CharacterDatabase.GetPreparedStatement(CHAR_SEL_SUM_CHARS);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = CharacterDatabase.Query(stmt);\n\n        return (result) ? (*result)[0].GetUInt64() : 0;\n    }\n\n    bool normalizeString(std::string& utf8String)\n    {\n        wchar_t buffer[MAX_ACCOUNT_STR + 1];\n\n        size_t maxLength = MAX_ACCOUNT_STR;\n        if (!Utf8toWStr(utf8String, buffer, maxLength))\n            return false;\n#ifdef _MSC_VER\n#pragma warning(disable: 4996)\n#endif\n        std::transform(&buffer[0], buffer + maxLength, &buffer[0], wcharToUpperOnlyLatin);\n#ifdef _MSC_VER\n#pragma warning(default: 4996)\n#endif\n\n        return WStrToUtf8(buffer, maxLength, utf8String);\n    }\n\n    std::string CalculateShaPassHash(std::string const& name, std::string const& password)\n    {\n        SHA1Hash sha;\n        sha.Initialize();\n        sha.UpdateData(name);\n        sha.UpdateData(\":\");\n        sha.UpdateData(password);\n        sha.Finalize();\n\n        return ByteArrayToHexStr(sha.GetDigest(), sha.GetLength());\n    }\n\n    bool IsPlayerAccount(uint32 gmlevel)\n    {\n        return gmlevel == SEC_PLAYER;\n    }\n\n    bool IsGMAccount(uint32 gmlevel)\n    {\n        return gmlevel >= SEC_GAMEMASTER && gmlevel <= SEC_CONSOLE;\n    }\n\n    bool IsAdminAccount(uint32 gmlevel)\n    {\n        return gmlevel >= SEC_ADMINISTRATOR && gmlevel <= SEC_CONSOLE;\n    }\n\n    bool IsConsoleAccount(uint32 gmlevel)\n    {\n        return gmlevel == SEC_CONSOLE;\n    }\n\n} \/\/ Namespace AccountMgr\n<commit_msg>feat(Core): Changing max pass size (#1626)<commit_after>\/*\n * Copyright (C) 2016+     AzerothCore <www.azerothcore.org>, released under GNU GPL v2 license: https:\/\/github.com\/azerothcore\/azerothcore-wotlk\/blob\/master\/LICENSE-GPL2\n * Copyright (C) 2008-2016 TrinityCore <http:\/\/www.trinitycore.org\/>\n * Copyright (C) 2005-2009 MaNGOS <http:\/\/getmangos.com\/>\n *\/\n\n#include \"AccountMgr.h\"\n#include \"DatabaseEnv.h\"\n#include \"ObjectAccessor.h\"\n#include \"Player.h\"\n#include \"ScriptMgr.h\"\n#include \"Util.h\"\n#include \"SHA1.h\"\n#include \"WorldSession.h\"\n\nnamespace AccountMgr\n{\n\n    AccountOpResult CreateAccount(std::string username, std::string password)\n    {\n        if (utf8length(username) > MAX_ACCOUNT_STR)\n            return AOR_NAME_TOO_LONG;                           \/\/ username's too long\n\n        if (utf8length(password) > MAX_PASS_STR)\n            return AOR_PASS_TOO_LONG;                           \/\/ password's too long\n\n        normalizeString(username);\n        normalizeString(password);\n\n        if (GetId(username))\n            return AOR_NAME_ALREDY_EXIST;                       \/\/ username does already exist\n\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_INS_ACCOUNT);\n\n        stmt->setString(0, username);\n        stmt->setString(1, CalculateShaPassHash(username, password));\n        stmt->setInt8(2, uint8(sWorld->getIntConfig(CONFIG_EXPANSION)));\n\n        LoginDatabase.Execute(stmt);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_INS_REALM_CHARACTERS_INIT);\n\n        LoginDatabase.Execute(stmt);\n\n        return AOR_OK;                                          \/\/ everything's fine\n    }\n\n    AccountOpResult DeleteAccount(uint32 accountId)\n    {\n        \/\/ Check if accounts exists\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_SEL_ACCOUNT_BY_ID);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        if (!result)\n            return AOR_NAME_NOT_EXIST;\n\n        \/\/ Obtain accounts characters\n        stmt = CharacterDatabase.GetPreparedStatement(CHAR_SEL_CHARS_BY_ACCOUNT_ID);\n\n        stmt->setUInt32(0, accountId);\n\n        result = CharacterDatabase.Query(stmt);\n\n        if (result)\n        {\n            do\n            {\n                uint32 guidLow = (*result)[0].GetUInt32();\n                uint64 guid = MAKE_NEW_GUID(guidLow, 0, HIGHGUID_PLAYER);\n\n                \/\/ Kick if player is online\n                if (Player* p = ObjectAccessor::FindPlayer(guid))\n                {\n                    WorldSession* s = p->GetSession();\n                    s->KickPlayer(\"Delete account\");            \/\/ mark session to remove at next session list update\n                    s->LogoutPlayer(false);                     \/\/ logout player without waiting next session list update\n                }\n\n                Player::DeleteFromDB(guid, accountId, false, true);       \/\/ no need to update realm characters\n            } while (result->NextRow());\n        }\n\n        \/\/ table realm specific but common for all characters of account for realm\n        stmt = CharacterDatabase.GetPreparedStatement(CHAR_DEL_TUTORIALS);\n        stmt->setUInt32(0, accountId);\n        CharacterDatabase.Execute(stmt);\n\n        stmt = CharacterDatabase.GetPreparedStatement(CHAR_DEL_ACCOUNT_DATA);\n        stmt->setUInt32(0, accountId);\n        CharacterDatabase.Execute(stmt);\n\n        stmt = CharacterDatabase.GetPreparedStatement(CHAR_DEL_CHARACTER_BAN);\n        stmt->setUInt32(0, accountId);\n        CharacterDatabase.Execute(stmt);\n\n        SQLTransaction trans = LoginDatabase.BeginTransaction();\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_DEL_ACCOUNT);\n        stmt->setUInt32(0, accountId);\n        trans->Append(stmt);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_DEL_ACCOUNT_ACCESS);\n        stmt->setUInt32(0, accountId);\n        trans->Append(stmt);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_DEL_REALM_CHARACTERS);\n        stmt->setUInt32(0, accountId);\n        trans->Append(stmt);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_DEL_ACCOUNT_BANNED);\n        stmt->setUInt32(0, accountId);\n        trans->Append(stmt);\n\n        LoginDatabase.CommitTransaction(trans);\n\n        return AOR_OK;\n    }\n\n\n    AccountOpResult ChangeUsername(uint32 accountId, std::string newUsername, std::string newPassword)\n    {\n        \/\/ Check if accounts exists\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_SEL_ACCOUNT_BY_ID);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        if (!result)\n            return AOR_NAME_NOT_EXIST;\n\n        if (utf8length(newUsername) > MAX_ACCOUNT_STR)\n            return AOR_NAME_TOO_LONG;\n\n        if (utf8length(newPassword) > MAX_PASS_STR)\n            return AOR_PASS_TOO_LONG;                           \/\/ password's too long\n\n        normalizeString(newUsername);\n        normalizeString(newPassword);\n\n        stmt = LoginDatabase.GetPreparedStatement(LOGIN_UPD_USERNAME);\n\n        stmt->setString(0, newUsername);\n        stmt->setString(1, CalculateShaPassHash(newUsername, newPassword));\n        stmt->setUInt32(2, accountId);\n\n        LoginDatabase.Execute(stmt);\n\n        return AOR_OK;\n    }\n\n    AccountOpResult ChangePassword(uint32 accountId, std::string newPassword)\n    {\n        std::string username;\n\n        if (!GetName(accountId, username))\n        {\n            sScriptMgr->OnFailedPasswordChange(accountId);\n            return AOR_NAME_NOT_EXIST;                          \/\/ account doesn't exist\n        }\n\n        if (utf8length(newPassword) > MAX_PASS_STR)\n        {\n            sScriptMgr->OnFailedEmailChange(accountId);\n            return AOR_PASS_TOO_LONG;                           \/\/ password's too long\n        }\n\n        normalizeString(username);\n        normalizeString(newPassword);\n\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_UPD_PASSWORD);\n\n        stmt->setString(0, CalculateShaPassHash(username, newPassword));\n        stmt->setUInt32(1, accountId);\n\n        LoginDatabase.Execute(stmt);\n\n        sScriptMgr->OnPasswordChange(accountId);\n        return AOR_OK;\n    }\n\n    uint32 GetId(std::string const& username)\n    {\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_GET_ACCOUNT_ID_BY_USERNAME);\n        stmt->setString(0, username);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        return (result) ? (*result)[0].GetUInt32() : 0;\n    }\n\n    uint32 GetSecurity(uint32 accountId)\n    {\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_GET_ACCOUNT_ACCESS_GMLEVEL);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        return (result) ? (*result)[0].GetUInt8() : uint32(SEC_PLAYER);\n    }\n\n    uint32 GetSecurity(uint32 accountId, int32 realmId)\n    {\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_GET_GMLEVEL_BY_REALMID);\n        stmt->setUInt32(0, accountId);\n        stmt->setInt32(1, realmId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        return (result) ? (*result)[0].GetUInt8() : uint32(SEC_PLAYER);\n    }\n\n    bool GetName(uint32 accountId, std::string& name)\n    {\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_GET_USERNAME_BY_ID);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        if (result)\n        {\n            name = (*result)[0].GetString();\n            return true;\n        }\n\n        return false;\n    }\n\n    bool CheckPassword(uint32 accountId, std::string password)\n    {\n        std::string username;\n\n        if (!GetName(accountId, username))\n            return false;\n\n        normalizeString(username);\n        normalizeString(password);\n\n        PreparedStatement* stmt = LoginDatabase.GetPreparedStatement(LOGIN_SEL_CHECK_PASSWORD);\n        stmt->setUInt32(0, accountId);\n        stmt->setString(1, CalculateShaPassHash(username, password));\n        PreparedQueryResult result = LoginDatabase.Query(stmt);\n\n        return (result) ? true : false;\n    }\n\n    uint32 GetCharactersCount(uint32 accountId)\n    {\n        \/\/ check character count\n        PreparedStatement* stmt = CharacterDatabase.GetPreparedStatement(CHAR_SEL_SUM_CHARS);\n        stmt->setUInt32(0, accountId);\n        PreparedQueryResult result = CharacterDatabase.Query(stmt);\n\n        return (result) ? (*result)[0].GetUInt64() : 0;\n    }\n\n    bool normalizeString(std::string& utf8String)\n    {\n        wchar_t buffer[MAX_ACCOUNT_STR + 1];\n\n        size_t maxLength = MAX_ACCOUNT_STR;\n        if (!Utf8toWStr(utf8String, buffer, maxLength))\n            return false;\n#ifdef _MSC_VER\n#pragma warning(disable: 4996)\n#endif\n        std::transform(&buffer[0], buffer + maxLength, &buffer[0], wcharToUpperOnlyLatin);\n#ifdef _MSC_VER\n#pragma warning(default: 4996)\n#endif\n\n        return WStrToUtf8(buffer, maxLength, utf8String);\n    }\n\n    std::string CalculateShaPassHash(std::string const& name, std::string const& password)\n    {\n        SHA1Hash sha;\n        sha.Initialize();\n        sha.UpdateData(name);\n        sha.UpdateData(\":\");\n        sha.UpdateData(password);\n        sha.Finalize();\n\n        return ByteArrayToHexStr(sha.GetDigest(), sha.GetLength());\n    }\n\n    bool IsPlayerAccount(uint32 gmlevel)\n    {\n        return gmlevel == SEC_PLAYER;\n    }\n\n    bool IsGMAccount(uint32 gmlevel)\n    {\n        return gmlevel >= SEC_GAMEMASTER && gmlevel <= SEC_CONSOLE;\n    }\n\n    bool IsAdminAccount(uint32 gmlevel)\n    {\n        return gmlevel >= SEC_ADMINISTRATOR && gmlevel <= SEC_CONSOLE;\n    }\n\n    bool IsConsoleAccount(uint32 gmlevel)\n    {\n        return gmlevel == SEC_CONSOLE;\n    }\n\n} \/\/ Namespace AccountMgr\n<|endoftext|>"}
{"text":"<commit_before>#include <bts\/blockchain\/chain_interface.hpp>\n#include <bts\/blockchain\/operation_factory.hpp>\n#include <bts\/blockchain\/transaction_evaluation_state.hpp>\n\n#include <bts\/blockchain\/fork_blocks.hpp>\n\nnamespace bts { namespace blockchain {\n\n   transaction_evaluation_state::transaction_evaluation_state( const chain_interface_ptr& current_state, digest_type chain_id )\n   :_current_state( current_state ),_chain_id(chain_id),_skip_signature_check(false)\n   {\n   }\n\n   transaction_evaluation_state::~transaction_evaluation_state()\n   {\n   }\n\n   void transaction_evaluation_state::reset()\n   {\n      signed_keys.clear();\n      balance.clear();\n      deposits.clear();\n      withdraws.clear();\n      net_delegate_votes.clear();\n      required_deposits.clear();\n      validation_error.reset();\n   }\n\n   bool transaction_evaluation_state::check_signature( const address& a )const\n   {\n      return  _skip_signature_check || signed_keys.find( a ) != signed_keys.end();\n   }\n\n   void transaction_evaluation_state::verify_delegate_id( account_id_type id )const\n   {\n      auto current_account = _current_state->get_account_record( id );\n      if( !current_account ) FC_CAPTURE_AND_THROW( unknown_account_id, (id) );\n      if( !current_account->is_delegate() ) FC_CAPTURE_AND_THROW( not_a_delegate, (id) );\n   }\n\n   void transaction_evaluation_state::add_required_deposit( const address& owner_key, const asset& amount )\n   {\n      FC_ASSERT( trx.delegate_slate_id );\n      balance_id_type balance_id = withdraw_condition(\n                                       withdraw_with_signature( owner_key ),\n                                       amount.asset_id, *trx.delegate_slate_id ).get_address();\n\n      auto itr = required_deposits.find( balance_id );\n      if( itr == required_deposits.end() )\n      {\n         required_deposits[balance_id] = amount;\n      }\n      else\n      {\n         required_deposits[balance_id] += amount;\n      }\n   }\n\n   void transaction_evaluation_state::update_delegate_votes()\n   {\n      auto asset_rec = _current_state->get_asset_record( asset_id_type() );\n\n      for( const auto& del_vote : net_delegate_votes )\n      {\n         auto del_rec = _current_state->get_account_record( del_vote.first );\n         FC_ASSERT( !!del_rec );\n         del_rec->adjust_votes_for( del_vote.second.votes_for );\n\n         _current_state->store_account_record( *del_rec );\n      }\n   }\n\n   void transaction_evaluation_state::validate_required_fee()\n   { try {\n      asset xts_fees;\n      auto fee_itr = balance.find( 0 );\n      if( fee_itr != balance.end() ) xts_fees += asset( fee_itr->second, 0);\n\n      xts_fees += alt_fees_paid;\n\n      if( required_fees > xts_fees )\n      {\n         FC_CAPTURE_AND_THROW( insufficient_fee, (required_fees)(alt_fees_paid)(xts_fees)  )\n      }\n   } FC_RETHROW_EXCEPTIONS( warn, \"\" ) }\n\n   \/**\n    *  Process all fees and update the asset records.\n    *\/\n   void transaction_evaluation_state::post_evaluate()\n   { try {\n      \/\/ NOTE:  this line was removed in favor of trusting delegates to set the required fees rather\n      \/\/ than charging per byte. This allows the network to scale without hard fork.\n      \/\/\n      \/\/ By removing this check I am reducing restrictions so the current blockchain should still validate\n      if( _current_state->get_head_block_num() < BTS_BLOCKCHAIN_FORK_MARKET_BLOCK_NUM )\n          required_fees += asset( _current_state->calculate_data_fee( fc::raw::pack_size( trx ) ), 0 );\n\n      \/\/ Should this be here? We may not have fees in XTS now...\n      balance[0]; \/\/ make sure we have something for this.\n      for( const auto& fee : balance )\n      {\n         if( fee.second < 0 ) FC_CAPTURE_AND_THROW( negative_fee, (fee) );\n         \/\/ if the fee is already in XTS or the fee balance is zero, move along...\n         if( fee.first == 0 || fee.second == 0 )\n           continue;\n\n         \/\/ lowest ask is someone with XTS offered at a price of USD \/ XTS, fee.first\n         \/\/ is an amount of USD which can be converted to price*USD XTS provided we\n         \/\/ send lowest_ask.index.owner the USD\n         omarket_order lowest_ask = _current_state->get_lowest_ask_record( fee.first, 0 );\n         if( lowest_ask )\n         {\n            \/\/ fees paid in something other than XTS are discounted 50%\n            alt_fees_paid += asset( fee.second\/2, fee.first ) * lowest_ask->market_index.order_price;\n         }\n      }\n\n      for( const auto& fee : balance )\n      {\n         if( fee.second < 0 ) FC_CAPTURE_AND_THROW( negative_fee, (fee) );\n         if( fee.second > 0 ) \/\/ if a fee was paid...\n         {\n            auto asset_record = _current_state->get_asset_record( fee.first );\n            if( !asset_record )\n              FC_CAPTURE_AND_THROW( unknown_asset_id, (fee.first) );\n\n            asset_record->collected_fees += fee.second;\n            \/\/ collecting fees should not decrease share supply.\n            \/\/ asset_record->current_share_supply -= fee.second;\n            _current_state->store_asset_record( *asset_record );\n         }\n      }\n\n      for( const auto& required_deposit : required_deposits )\n      {\n         auto provided_itr = provided_deposits.find( required_deposit.first );\n\n         if( provided_itr->second < required_deposit.second )\n            FC_CAPTURE_AND_THROW( missing_deposit, (required_deposit) );\n      }\n\n   } FC_RETHROW_EXCEPTIONS( warn, \"\" ) }\n\n   void transaction_evaluation_state::evaluate( const signed_transaction& trx_arg, bool skip_signature_check )\n   { try {\n      reset();\n      _skip_signature_check = skip_signature_check;\n      try {\n        if( trx_arg.expiration < _current_state->now() )\n        {\n           auto expired_by_sec = (trx_arg.expiration - _current_state->now()).to_seconds();\n           FC_CAPTURE_AND_THROW( expired_transaction, (trx_arg)(_current_state->now())(expired_by_sec) );\n        }\n        if( trx_arg.expiration > (_current_state->now() + BTS_BLOCKCHAIN_MAX_TRANSACTION_EXPIRATION_SEC) )\n           FC_CAPTURE_AND_THROW( invalid_transaction_expiration, (trx_arg)(_current_state->now()) );\n\n        \/**\n         * Removing transaction size limit from chain validation rules.\n         *\n         * Note: this is to give delegates maximum flexibility without having to\n         * introduce hard forks to support larger transaction sizes.\n         *\/\n        if( _current_state->get_head_block_num() < BTS_BLOCKCHAIN_FORK_MARKET_BLOCK_NUM )\n        {\n            auto trx_size = fc::raw::pack_size( trx_arg );\n            if( trx_size > 1280 )\n               FC_CAPTURE_AND_THROW( oversized_transaction, (trx_size ) );\n        }\n\n        auto trx_id = trx_arg.id();\n\n        if( _current_state->is_known_transaction( trx_id ) )\n           FC_CAPTURE_AND_THROW( duplicate_transaction, (trx_id) );\n\n        trx = trx_arg;\n        if( !_skip_signature_check )\n        {\n           auto digest = trx_arg.digest( _chain_id );\n           for( const auto& sig : trx.signatures )\n           {\n              auto key = fc::ecc::public_key( sig, digest ).serialize();\n              signed_keys.insert( address(key) );\n              signed_keys.insert( address(pts_address(key,false,56) ) );\n              signed_keys.insert( address(pts_address(key,true,56) )  );\n              signed_keys.insert( address(pts_address(key,false,0) )  );\n              signed_keys.insert( address(pts_address(key,true,0) )   );\n           }\n        }\n        for( const auto& op : trx.operations )\n        {\n           evaluate_operation( op );\n        }\n        post_evaluate();\n        validate_required_fee();\n        update_delegate_votes();\n      }\n      catch ( const fc::exception& e )\n      {\n         validation_error = e;\n         throw;\n      }\n   } FC_RETHROW_EXCEPTIONS( warn, \"\", (\"trx\",trx_arg) ) }\n\n   void transaction_evaluation_state::evaluate_operation( const operation& op )\n   {\n      operation_factory::instance().evaluate( *this, op );\n   }\n\n   void transaction_evaluation_state::adjust_vote( slate_id_type slate_id, share_type amount )\n   {\n      if( slate_id )\n      {\n         auto slate = _current_state->get_delegate_slate( slate_id );\n         if( !slate ) FC_CAPTURE_AND_THROW( unknown_delegate_slate, (slate_id) );\n         for( const auto& delegate_id : slate->supported_delegates )\n         {\n            if( BTS_BLOCKCHAIN_ENABLE_NEGATIVE_VOTES && delegate_id < signed_int(0) )\n               net_delegate_votes[abs(delegate_id)].votes_for -= amount;\n            else\n               net_delegate_votes[abs(delegate_id)].votes_for += amount;\n         }\n      }\n   }\n\n   share_type transaction_evaluation_state::get_fees( asset_id_type id )const\n   {\n      auto itr = balance.find(id);\n      if( itr != balance.end() )\n         return itr->second;\n      return 0;\n   }\n\n   \/**\n    *\n    *\/\n   void transaction_evaluation_state::sub_balance( const balance_id_type& balance_id, const asset& amount )\n   {\n      auto provided_deposit_itr = provided_deposits.find( balance_id );\n      if( provided_deposit_itr == provided_deposits.end() )\n      {\n         provided_deposits[balance_id] = amount;\n      }\n      else\n      {\n         provided_deposit_itr->second += amount;\n      }\n\n      auto deposit_itr = deposits.find(amount.asset_id);\n      if( deposit_itr == deposits.end()  )\n      {\n         deposits[amount.asset_id] = amount;\n      }\n      else\n      {\n         deposit_itr->second += amount;\n      }\n\n      auto balance_itr = balance.find(amount.asset_id);\n      if( balance_itr != balance.end()  )\n      {\n          balance_itr->second -= amount.amount;\n      }\n      else\n      {\n          balance[amount.asset_id] =  -amount.amount;\n      }\n   }\n\n   void transaction_evaluation_state::add_balance( const asset& amount )\n   {\n      auto withdraw_itr = withdraws.find( amount.asset_id );\n      if( withdraw_itr == withdraws.end() )\n         withdraws[amount.asset_id] = amount;\n      else\n         withdraw_itr->second += amount;\n\n      auto balance_itr = balance.find( amount.asset_id );\n      if( balance_itr == balance.end() )\n         balance[amount.asset_id] = amount.amount;\n      else\n         balance_itr->second += amount.amount;\n   }\n\n   \/**\n    *  Throws if the asset is not known to the blockchain.\n    *\/\n   void transaction_evaluation_state::validate_asset( const asset& asset_to_validate )const\n   {\n      auto asset_rec = _current_state->get_asset_record( asset_to_validate.asset_id );\n      if( NOT asset_rec )\n         FC_CAPTURE_AND_THROW( unknown_asset_id, (asset_to_validate) );\n   }\n\n} } \/\/ bts::blockchain\n<commit_msg>Fix build<commit_after>#include <bts\/blockchain\/chain_interface.hpp>\n#include <bts\/blockchain\/operation_factory.hpp>\n#include <bts\/blockchain\/transaction_evaluation_state.hpp>\n\n#include <bts\/blockchain\/fork_blocks.hpp>\n\nnamespace bts { namespace blockchain {\n\n   transaction_evaluation_state::transaction_evaluation_state( const chain_interface_ptr& current_state, digest_type chain_id )\n   :_current_state( current_state ),_chain_id(chain_id),_skip_signature_check(false)\n   {\n   }\n\n   transaction_evaluation_state::~transaction_evaluation_state()\n   {\n   }\n\n   void transaction_evaluation_state::reset()\n   {\n      signed_keys.clear();\n      balance.clear();\n      deposits.clear();\n      withdraws.clear();\n      net_delegate_votes.clear();\n      required_deposits.clear();\n      validation_error.reset();\n   }\n\n   bool transaction_evaluation_state::check_signature( const address& a )const\n   {\n      return  _skip_signature_check || signed_keys.find( a ) != signed_keys.end();\n   }\n\n   void transaction_evaluation_state::verify_delegate_id( account_id_type id )const\n   {\n      auto current_account = _current_state->get_account_record( id );\n      if( !current_account ) FC_CAPTURE_AND_THROW( unknown_account_id, (id) );\n      if( !current_account->is_delegate() ) FC_CAPTURE_AND_THROW( not_a_delegate, (id) );\n   }\n\n   void transaction_evaluation_state::add_required_deposit( const address& owner_key, const asset& amount )\n   {\n      FC_ASSERT( trx.delegate_slate_id );\n      balance_id_type balance_id = withdraw_condition(\n                                       withdraw_with_signature( owner_key ),\n                                       amount.asset_id, *trx.delegate_slate_id ).get_address();\n\n      auto itr = required_deposits.find( balance_id );\n      if( itr == required_deposits.end() )\n      {\n         required_deposits[balance_id] = amount;\n      }\n      else\n      {\n         required_deposits[balance_id] += amount;\n      }\n   }\n\n   void transaction_evaluation_state::update_delegate_votes()\n   {\n      auto asset_rec = _current_state->get_asset_record( asset_id_type() );\n\n      for( const auto& del_vote : net_delegate_votes )\n      {\n         auto del_rec = _current_state->get_account_record( del_vote.first );\n         FC_ASSERT( !!del_rec );\n         del_rec->adjust_votes_for( del_vote.second.votes_for );\n\n         _current_state->store_account_record( *del_rec );\n      }\n   }\n\n   void transaction_evaluation_state::validate_required_fee()\n   { try {\n      asset xts_fees;\n      auto fee_itr = balance.find( 0 );\n      if( fee_itr != balance.end() ) xts_fees += asset( fee_itr->second, 0);\n\n      xts_fees += alt_fees_paid;\n\n      if( required_fees > xts_fees )\n      {\n         FC_CAPTURE_AND_THROW( insufficient_fee, (required_fees)(alt_fees_paid)(xts_fees)  )\n      }\n   } FC_RETHROW_EXCEPTIONS( warn, \"\" ) }\n\n   \/**\n    *  Process all fees and update the asset records.\n    *\/\n   void transaction_evaluation_state::post_evaluate()\n   { try {\n      \/\/ Should this be here? We may not have fees in XTS now...\n      balance[0]; \/\/ make sure we have something for this.\n      for( const auto& fee : balance )\n      {\n         if( fee.second < 0 ) FC_CAPTURE_AND_THROW( negative_fee, (fee) );\n         \/\/ if the fee is already in XTS or the fee balance is zero, move along...\n         if( fee.first == 0 || fee.second == 0 )\n           continue;\n\n         \/\/ lowest ask is someone with XTS offered at a price of USD \/ XTS, fee.first\n         \/\/ is an amount of USD which can be converted to price*USD XTS provided we\n         \/\/ send lowest_ask.index.owner the USD\n         omarket_order lowest_ask = _current_state->get_lowest_ask_record( fee.first, 0 );\n         if( lowest_ask )\n         {\n            \/\/ fees paid in something other than XTS are discounted 50%\n            alt_fees_paid += asset( fee.second\/2, fee.first ) * lowest_ask->market_index.order_price;\n         }\n      }\n\n      for( const auto& fee : balance )\n      {\n         if( fee.second < 0 ) FC_CAPTURE_AND_THROW( negative_fee, (fee) );\n         if( fee.second > 0 ) \/\/ if a fee was paid...\n         {\n            auto asset_record = _current_state->get_asset_record( fee.first );\n            if( !asset_record )\n              FC_CAPTURE_AND_THROW( unknown_asset_id, (fee.first) );\n\n            asset_record->collected_fees += fee.second;\n            \/\/ collecting fees should not decrease share supply.\n            \/\/ asset_record->current_share_supply -= fee.second;\n            _current_state->store_asset_record( *asset_record );\n         }\n      }\n\n      for( const auto& required_deposit : required_deposits )\n      {\n         auto provided_itr = provided_deposits.find( required_deposit.first );\n\n         if( provided_itr->second < required_deposit.second )\n            FC_CAPTURE_AND_THROW( missing_deposit, (required_deposit) );\n      }\n\n   } FC_RETHROW_EXCEPTIONS( warn, \"\" ) }\n\n   void transaction_evaluation_state::evaluate( const signed_transaction& trx_arg, bool skip_signature_check )\n   { try {\n      reset();\n      _skip_signature_check = skip_signature_check;\n      try {\n        if( trx_arg.expiration < _current_state->now() )\n        {\n           auto expired_by_sec = (trx_arg.expiration - _current_state->now()).to_seconds();\n           FC_CAPTURE_AND_THROW( expired_transaction, (trx_arg)(_current_state->now())(expired_by_sec) );\n        }\n        if( trx_arg.expiration > (_current_state->now() + BTS_BLOCKCHAIN_MAX_TRANSACTION_EXPIRATION_SEC) )\n           FC_CAPTURE_AND_THROW( invalid_transaction_expiration, (trx_arg)(_current_state->now()) );\n\n        \/**\n         * Removing transaction size limit from chain validation rules.\n         *\n         * Note: this is to give delegates maximum flexibility without having to\n         * introduce hard forks to support larger transaction sizes.\n         *\/\n        if( _current_state->get_head_block_num() < BTS_BLOCKCHAIN_FORK_MARKET_BLOCK_NUM )\n        {\n            auto trx_size = fc::raw::pack_size( trx_arg );\n            if( trx_size > 1280 )\n               FC_CAPTURE_AND_THROW( oversized_transaction, (trx_size ) );\n        }\n\n        auto trx_id = trx_arg.id();\n\n        if( _current_state->is_known_transaction( trx_id ) )\n           FC_CAPTURE_AND_THROW( duplicate_transaction, (trx_id) );\n\n        trx = trx_arg;\n        if( !_skip_signature_check )\n        {\n           auto digest = trx_arg.digest( _chain_id );\n           for( const auto& sig : trx.signatures )\n           {\n              auto key = fc::ecc::public_key( sig, digest ).serialize();\n              signed_keys.insert( address(key) );\n              signed_keys.insert( address(pts_address(key,false,56) ) );\n              signed_keys.insert( address(pts_address(key,true,56) )  );\n              signed_keys.insert( address(pts_address(key,false,0) )  );\n              signed_keys.insert( address(pts_address(key,true,0) )   );\n           }\n        }\n        for( const auto& op : trx.operations )\n        {\n           evaluate_operation( op );\n        }\n        post_evaluate();\n        validate_required_fee();\n        update_delegate_votes();\n      }\n      catch ( const fc::exception& e )\n      {\n         validation_error = e;\n         throw;\n      }\n   } FC_RETHROW_EXCEPTIONS( warn, \"\", (\"trx\",trx_arg) ) }\n\n   void transaction_evaluation_state::evaluate_operation( const operation& op )\n   {\n      operation_factory::instance().evaluate( *this, op );\n   }\n\n   void transaction_evaluation_state::adjust_vote( slate_id_type slate_id, share_type amount )\n   {\n      if( slate_id )\n      {\n         auto slate = _current_state->get_delegate_slate( slate_id );\n         if( !slate ) FC_CAPTURE_AND_THROW( unknown_delegate_slate, (slate_id) );\n         for( const auto& delegate_id : slate->supported_delegates )\n         {\n            if( BTS_BLOCKCHAIN_ENABLE_NEGATIVE_VOTES && delegate_id < signed_int(0) )\n               net_delegate_votes[abs(delegate_id)].votes_for -= amount;\n            else\n               net_delegate_votes[abs(delegate_id)].votes_for += amount;\n         }\n      }\n   }\n\n   share_type transaction_evaluation_state::get_fees( asset_id_type id )const\n   {\n      auto itr = balance.find(id);\n      if( itr != balance.end() )\n         return itr->second;\n      return 0;\n   }\n\n   \/**\n    *\n    *\/\n   void transaction_evaluation_state::sub_balance( const balance_id_type& balance_id, const asset& amount )\n   {\n      auto provided_deposit_itr = provided_deposits.find( balance_id );\n      if( provided_deposit_itr == provided_deposits.end() )\n      {\n         provided_deposits[balance_id] = amount;\n      }\n      else\n      {\n         provided_deposit_itr->second += amount;\n      }\n\n      auto deposit_itr = deposits.find(amount.asset_id);\n      if( deposit_itr == deposits.end()  )\n      {\n         deposits[amount.asset_id] = amount;\n      }\n      else\n      {\n         deposit_itr->second += amount;\n      }\n\n      auto balance_itr = balance.find(amount.asset_id);\n      if( balance_itr != balance.end()  )\n      {\n          balance_itr->second -= amount.amount;\n      }\n      else\n      {\n          balance[amount.asset_id] =  -amount.amount;\n      }\n   }\n\n   void transaction_evaluation_state::add_balance( const asset& amount )\n   {\n      auto withdraw_itr = withdraws.find( amount.asset_id );\n      if( withdraw_itr == withdraws.end() )\n         withdraws[amount.asset_id] = amount;\n      else\n         withdraw_itr->second += amount;\n\n      auto balance_itr = balance.find( amount.asset_id );\n      if( balance_itr == balance.end() )\n         balance[amount.asset_id] = amount.amount;\n      else\n         balance_itr->second += amount.amount;\n   }\n\n   \/**\n    *  Throws if the asset is not known to the blockchain.\n    *\/\n   void transaction_evaluation_state::validate_asset( const asset& asset_to_validate )const\n   {\n      auto asset_rec = _current_state->get_asset_record( asset_to_validate.asset_id );\n      if( NOT asset_rec )\n         FC_CAPTURE_AND_THROW( unknown_asset_id, (asset_to_validate) );\n   }\n\n} } \/\/ bts::blockchain\n<|endoftext|>"}
{"text":"<commit_before>#include \"IMMHandler.h\"\n\n#include <cstdlib>\n#include <sstream>\n#include <unistd.h>\n#include <iostream>\n#include <utility>\n#include <folly\/futures\/Future.h>\n#include <thrift\/lib\/cpp2\/async\/HeaderClientChannel.h>\n#include <thrift\/lib\/cpp2\/server\/ThriftServer.h>\n#include <thrift\/lib\/cpp2\/async\/HeaderClientChannel.h>\n\n#include <boost\/algorithm\/string\/classification.hpp>\n#include <boost\/algorithm\/string\/split.hpp>\n\nusing namespace std;\nusing namespace folly;\nusing namespace apache::thrift;\nusing namespace apache::thrift::async;\nusing namespace cv;\nusing namespace mongo;\n\nusing std::cout;\nusing std::endl;\nusing std::string;\nusing std::unique_ptr;\nusing std::shared_ptr;\nusing std::getenv;\n\n\/\/ cout lock.\nstd::mutex cout_lock_cpp;\n\nnamespace cpp2 {\nIMMHandler::IMMHandler() {\n\t\t\/\/ Initialize MongoDB C++ driver.\n\t\tclient::initialize();\n\t\tstring mongo_addr;\n\t\ttry {\n\t\t\t\tif (const char* env_p = getenv(\"MONGO_PORT_27017_TCP_ADDR\")) {\n\t\t\t\t\tprint(\"MongoDB: \" << env_p);\n\t\t\t\t\tmongo_addr = env_p;\n\t\t\t\t} else {\n\t\t\t\t\tprint(\"MongoDB: localhost\");\n\t\t\t\t\tmongo_addr = \"localhost\";\n\t\t\t\t}\n\t\t\t\tconn.connect(mongo_addr);\n\t\t\t\tprint(\"Connection is ok\");\n\t\t} catch (const DBException &e) {\n\t\t\t\tprint(\"Caught \" << e.what());\n\t\t}\n}\n\n\nfolly::Future<folly::Unit> IMMHandler::future_create\n(unique_ptr<string> LUCID, unique_ptr< ::cpp2::QuerySpec> spec) {\n\tfolly::MoveWrapper<folly::Promise<folly::Unit > > promise;\n\tauto future = promise->getFuture();\n\tpromise->setValue(Unit{});\n\treturn future;\n}\n\nfolly::Future<folly::Unit> IMMHandler::future_learn\n(unique_ptr<string> LUCID, unique_ptr< ::cpp2::QuerySpec> knowledge) {\n\tprint(\"Learn\");\n\t\/\/ Save LUCID and knowledge.\n\tstring LUCID_save = *LUCID;\n\t::cpp2::QuerySpec knowledge_save = *knowledge;\n\tfolly::MoveWrapper<folly::Promise<folly::Unit>> promise;\n\tauto future = promise->getFuture();\n\t\/\/ Async.\n\tfolly::RequestEventBase::get()->runInEventBaseThread(\n\t\t\t[=]() mutable {\n\t\ttry {\n\t\t\t\/\/ Go through all images and store their descriptors matices\n\t\t\t\/\/ into MongoDB GridFS.\n\t\t\tfor (const QueryInput &query_input : knowledge_save.content) {\n\t\t\t\tfor (int i = 0; i < (int) query_input.data.size(); ++i) {\n\t\t\t\t\tthis->addImage(LUCID_save, query_input.tags[i],\n\t\t\t\t\t\t\tquery_input.data[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (Exception &e) {\n\t\t\tprint(e.what());\n\t\t}\n\t\tpromise->setValue(Unit{});\n\t}\n\t);\n\treturn future;\n}\n\nfolly::Future<unique_ptr<string>> IMMHandler::future_infer\n(unique_ptr<string> LUCID, unique_ptr< ::cpp2::QuerySpec> query) {\n\tprint(\"Infer\");\n\t\/\/ Save LUCID and query.\n\tstring LUCID_save = *LUCID;\n\t::cpp2::QuerySpec query_save = *query;\n\tfolly::MoveWrapper<folly::Promise<unique_ptr<string>>> promise;\n\tauto future = promise->getFuture();\n\t\/\/ Async.\n\tfolly::RequestEventBase::get()->runInEventBaseThread(\n\t\t\t[=]() mutable {\n\t\ttry {\n\t\t\tif (query_save.content.empty()\n\t\t\t\t\t|| query_save.content[0].data.empty()) {\n\t\t\t\tthrow runtime_error(\"IMM received empty infer query\");\n\t\t\t}\n\t\t\tvector<unique_ptr<StoredImage>> images = getImages(LUCID_save);\n\t\t\tint best_index = Image::match(images,\n\t\t\t\t\tunique_ptr<QueryImage>(new QueryImage(\n\t\t\t\t\t\t\tmove(Image::imageToMatObj(\n\t\t\t\t\t\t\t\t\tquery_save.content[0].data[0])))));\n\t\t\tprint(\"Result: \" << images[best_index]->getLabel());\n\t\t\t\/\/ Check if the query needs to be further sent to QA.\n\t\t\tif (!query_save.content[0].tags.empty() &&\n\t\t\t\t\tquery_save.content[0].tags[0] != \"\") {\n\t\t\t\tif (query_save.content.size() == 1\n\t\t\t\t\t\t|| query_save.content[1].data.empty()) {\n\t\t\t\t\tthrow runtime_error(\"IMM wants to further request\"\n\t\t\t\t\t\t\t\" to QA but no text query\");\n\t\t\t\t}\n\t\t\t\tvector<string> words;\n\t\t\t\tboost::split(words,query_save.content[0].tags[0],\n\t\t\t\t\t\tboost::is_any_of(\", \"), boost::token_compress_on);\n\t\t\t\tif (words.size() != 2) {\n\t\t\t\t\tthrow runtime_error(\"tags[0] must have the following format\"\n\t\t\t\t\t\t\t\": localhost, 8083\");\n\t\t\t\t}\n\t\t\t\tEventBase event_base;\n\t\t\t\tstring QA_addr = \"127.0.0.1\"; \/\/ cannot be \"localhost\"\n\t\t\t\tint QA_port = stoi(words[1], nullptr);\n\t\t\t\tif (const char* env_p = getenv(\"QA_PORT_8083_TCP_ADDR\")) {\n\t\t\t\t\tQA_addr = env_p;\n\t\t\t\t}\n\t\t\t\tprint(\"Sending request to QA at \" << QA_addr << \" \" << QA_port);\n\t\t\t\tstd::shared_ptr<TAsyncSocket> socket(\n\t\t\t\t\t\tTAsyncSocket::newSocket(&event_base, QA_addr, QA_port));\n\t\t\t\tunique_ptr<HeaderClientChannel, DelayedDestruction::Destructor>\n\t\t\t\tchannel(new HeaderClientChannel(socket));\n\t\t\t\tchannel->setClientType(THRIFT_FRAMED_DEPRECATED);\n\t\t\t\tLucidaServiceAsyncClient client(std::move(channel));\n\t\t\t\tQuerySpec qa_query_spec;\n\t\t\t\t\/\/ Pop the front QueryInput from the current content\n\t\t\t\t\/\/ to get the new QuerySpec content for QA.\n\t\t\t\tqa_query_spec.content.assign(query_save.content.begin() + 1,\n\t\t\t\t\t\tquery_save.content.end());\n\t\t\t\t\/\/ Append the result of IMM to the end of the text query.\n\t\t\t\tstring IMM_result = images[best_index]->getLabel();\n\t\t\t\tqa_query_spec.content[0].data[0].append(\" \" + IMM_result);\n\t\t\t\tprint(\"Query to QA \" << qa_query_spec.content[0].data[0]);\n\t\t\t\tclient.future_infer(LUCID_save, qa_query_spec).then(\n\t\t\t\t\t\t[promise, IMM_result](folly::Try<string>&& t) mutable {\n\t\t\t\t\tprint(\"QA result: \" << t.value());\n\t\t\t\t\tunique_ptr<string> result = folly::make_unique<std::string>(\n\t\t\t\t\t\t\t\"IMM: \" + IMM_result\n\t\t\t\t\t\t\t+ \"; QA: \" + t.value());\n\t\t\t\t\tpromise->setValue(std::move(result)); \/\/ exit\n\t\t\t\t});\n\t\t\t\tevent_base.loop();\n\t\t\t} else {\n\t\t\t\tpromise->setValue(unique_ptr<string>(\n\t\t\t\t\t\tnew string(images[best_index]->getLabel()))); \/\/ exit\n\t\t\t}\n\t\t} catch (Exception &e) {\n\t\t\tprint(e.what());\n\t\t\tpromise->setValue(unique_ptr<string>(new string())); \/\/ exit\n\t\t}\n\t}\n\t);\n\treturn future;\n}\n\nvoid IMMHandler::addImage(const string &LUCID,\n\t\tconst string &label, const string &data) {\n\tprint(\"@@@ Label: \" << label);\n\tprint(\"@@@ Size: \" << data.size());\n\t\/\/ Insert the descriptors matrix into MongoDB.\n\tstring mat_str = Image::imageToMatString(data); \/\/ written to file system\n\tGridFS grid(conn, \"lucida\");\n\tBSONObj result = grid.storeFile(mat_str.c_str(), mat_str.size(),\n\t\t\t\"opencv_\" + LUCID + \"\/\" + label);\n}\n\nvector<unique_ptr<StoredImage>> IMMHandler::getImages(const string &LUCID) {\n\tvector<unique_ptr<StoredImage>> rtn;\n\t\/\/ Retrieve all images of the user from MongoDB.\n\tauto_ptr<DBClientCursor> cursor = conn.query(\n\t\t\t\"lucida.images_\" + LUCID, BSONObj()); \/\/ retrieve desc, NOT data\n\tGridFS grid(conn, \"lucida\");\n\twhile (cursor->more()) {\n\t\tstring label = cursor->next().getStringField(\"label\");\n\t\tostringstream out;\n\t\tGridFile gf = grid.findFileByName(\"opencv_\" + LUCID + \"\/\" + label);\n\t\tif (!gf.exists()) {\n\t\t\tprint(\"opencv_\" + LUCID + \"\/\" + label + \" not found!\");\n\t\t\tcontinue;\n\t\t}\n\t\tgf.write(out);\n\t\trtn.push_back(unique_ptr<StoredImage>(new StoredImage(\n\t\t\t\tlabel,\n\t\t\t\tmove(Image::matStringToMatObj(out.str())))));\n\t}\n\treturn rtn;\n}\n}\n<commit_msg>IMM: fix style<commit_after>#include \"IMMHandler.h\"\n\n#include <cstdlib>\n#include <sstream>\n#include <unistd.h>\n#include <iostream>\n#include <utility>\n#include <folly\/futures\/Future.h>\n#include <thrift\/lib\/cpp2\/async\/HeaderClientChannel.h>\n#include <thrift\/lib\/cpp2\/server\/ThriftServer.h>\n#include <thrift\/lib\/cpp2\/async\/HeaderClientChannel.h>\n\n#include <boost\/algorithm\/string\/classification.hpp>\n#include <boost\/algorithm\/string\/split.hpp>\n\nusing namespace std;\nusing namespace folly;\nusing namespace apache::thrift;\nusing namespace apache::thrift::async;\nusing namespace cv;\nusing namespace mongo;\n\nusing std::cout;\nusing std::endl;\nusing std::string;\nusing std::unique_ptr;\nusing std::shared_ptr;\nusing std::getenv;\n\n\/\/ cout lock.\nstd::mutex cout_lock_cpp;\n\nnamespace cpp2 {\nIMMHandler::IMMHandler() {\n\t\t\/\/ Initialize MongoDB C++ driver.\n\t\tclient::initialize();\n\t\tstring mongo_addr;\n\t\ttry {\n\t\t\tif (const char* env_p = getenv(\"MONGO_PORT_27017_TCP_ADDR\")) {\n\t\t\t\tprint(\"MongoDB: \" << env_p);\n\t\t\t\tmongo_addr = env_p;\n\t\t\t} else {\n\t\t\t\tprint(\"MongoDB: localhost\");\n\t\t\t\tmongo_addr = \"localhost\";\n\t\t\t}\n\t\t\tconn.connect(mongo_addr);\n\t\t\tprint(\"Connection is ok\");\n\t\t} catch (const DBException &e) {\n\t\t\tprint(\"Caught \" << e.what());\n\t\t}\n}\n\n\nfolly::Future<folly::Unit> IMMHandler::future_create\n(unique_ptr<string> LUCID, unique_ptr< ::cpp2::QuerySpec> spec) {\n\tfolly::MoveWrapper<folly::Promise<folly::Unit > > promise;\n\tauto future = promise->getFuture();\n\tpromise->setValue(Unit{});\n\treturn future;\n}\n\nfolly::Future<folly::Unit> IMMHandler::future_learn\n(unique_ptr<string> LUCID, unique_ptr< ::cpp2::QuerySpec> knowledge) {\n\tprint(\"Learn\");\n\t\/\/ Save LUCID and knowledge.\n\tstring LUCID_save = *LUCID;\n\t::cpp2::QuerySpec knowledge_save = *knowledge;\n\tfolly::MoveWrapper<folly::Promise<folly::Unit>> promise;\n\tauto future = promise->getFuture();\n\t\/\/ Async.\n\tfolly::RequestEventBase::get()->runInEventBaseThread(\n\t\t\t[=]() mutable {\n\t\ttry {\n\t\t\t\/\/ Go through all images and store their descriptors matices\n\t\t\t\/\/ into MongoDB GridFS.\n\t\t\tfor (const QueryInput &query_input : knowledge_save.content) {\n\t\t\t\tfor (int i = 0; i < (int) query_input.data.size(); ++i) {\n\t\t\t\t\tthis->addImage(LUCID_save, query_input.tags[i],\n\t\t\t\t\t\t\tquery_input.data[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (Exception &e) {\n\t\t\tprint(e.what());\n\t\t}\n\t\tpromise->setValue(Unit{});\n\t}\n\t);\n\treturn future;\n}\n\nfolly::Future<unique_ptr<string>> IMMHandler::future_infer\n(unique_ptr<string> LUCID, unique_ptr< ::cpp2::QuerySpec> query) {\n\tprint(\"Infer\");\n\t\/\/ Save LUCID and query.\n\tstring LUCID_save = *LUCID;\n\t::cpp2::QuerySpec query_save = *query;\n\tfolly::MoveWrapper<folly::Promise<unique_ptr<string>>> promise;\n\tauto future = promise->getFuture();\n\t\/\/ Async.\n\tfolly::RequestEventBase::get()->runInEventBaseThread(\n\t\t\t[=]() mutable {\n\t\ttry {\n\t\t\tif (query_save.content.empty()\n\t\t\t\t\t|| query_save.content[0].data.empty()) {\n\t\t\t\tthrow runtime_error(\"IMM received empty infer query\");\n\t\t\t}\n\t\t\tvector<unique_ptr<StoredImage>> images = getImages(LUCID_save);\n\t\t\tint best_index = Image::match(images,\n\t\t\t\t\tunique_ptr<QueryImage>(new QueryImage(\n\t\t\t\t\t\t\tmove(Image::imageToMatObj(\n\t\t\t\t\t\t\t\t\tquery_save.content[0].data[0])))));\n\t\t\tprint(\"Result: \" << images[best_index]->getLabel());\n\t\t\t\/\/ Check if the query needs to be further sent to QA.\n\t\t\tif (!query_save.content[0].tags.empty() &&\n\t\t\t\t\tquery_save.content[0].tags[0] != \"\") {\n\t\t\t\tif (query_save.content.size() == 1\n\t\t\t\t\t\t|| query_save.content[1].data.empty()) {\n\t\t\t\t\tthrow runtime_error(\"IMM wants to further request\"\n\t\t\t\t\t\t\t\" to QA but no text query\");\n\t\t\t\t}\n\t\t\t\tvector<string> words;\n\t\t\t\tboost::split(words,query_save.content[0].tags[0],\n\t\t\t\t\t\tboost::is_any_of(\", \"), boost::token_compress_on);\n\t\t\t\tif (words.size() != 2) {\n\t\t\t\t\tthrow runtime_error(\"tags[0] must have the following format\"\n\t\t\t\t\t\t\t\": localhost, 8083\");\n\t\t\t\t}\n\t\t\t\tEventBase event_base;\n\t\t\t\tstring QA_addr = \"127.0.0.1\"; \/\/ cannot be \"localhost\"\n\t\t\t\tint QA_port = stoi(words[1], nullptr);\n\t\t\t\tif (const char* env_p = getenv(\"QA_PORT_8083_TCP_ADDR\")) {\n\t\t\t\t\tQA_addr = env_p;\n\t\t\t\t}\n\t\t\t\tprint(\"Sending request to QA at \" << QA_addr << \" \" << QA_port);\n\t\t\t\tstd::shared_ptr<TAsyncSocket> socket(\n\t\t\t\t\t\tTAsyncSocket::newSocket(&event_base, QA_addr, QA_port));\n\t\t\t\tunique_ptr<HeaderClientChannel, DelayedDestruction::Destructor>\n\t\t\t\tchannel(new HeaderClientChannel(socket));\n\t\t\t\tchannel->setClientType(THRIFT_FRAMED_DEPRECATED);\n\t\t\t\tLucidaServiceAsyncClient client(std::move(channel));\n\t\t\t\tQuerySpec qa_query_spec;\n\t\t\t\t\/\/ Pop the front QueryInput from the current content\n\t\t\t\t\/\/ to get the new QuerySpec content for QA.\n\t\t\t\tqa_query_spec.content.assign(query_save.content.begin() + 1,\n\t\t\t\t\t\tquery_save.content.end());\n\t\t\t\t\/\/ Append the result of IMM to the end of the text query.\n\t\t\t\tstring IMM_result = images[best_index]->getLabel();\n\t\t\t\tqa_query_spec.content[0].data[0].append(\" \" + IMM_result);\n\t\t\t\tprint(\"Query to QA \" << qa_query_spec.content[0].data[0]);\n\t\t\t\tclient.future_infer(LUCID_save, qa_query_spec).then(\n\t\t\t\t\t\t[promise, IMM_result](folly::Try<string>&& t) mutable {\n\t\t\t\t\tprint(\"QA result: \" << t.value());\n\t\t\t\t\tunique_ptr<string> result = folly::make_unique<std::string>(\n\t\t\t\t\t\t\t\"IMM: \" + IMM_result\n\t\t\t\t\t\t\t+ \"; QA: \" + t.value());\n\t\t\t\t\tpromise->setValue(std::move(result)); \/\/ exit\n\t\t\t\t});\n\t\t\t\tevent_base.loop();\n\t\t\t} else {\n\t\t\t\tpromise->setValue(unique_ptr<string>(\n\t\t\t\t\t\tnew string(images[best_index]->getLabel()))); \/\/ exit\n\t\t\t}\n\t\t} catch (Exception &e) {\n\t\t\tprint(e.what());\n\t\t\tpromise->setValue(unique_ptr<string>(new string())); \/\/ exit\n\t\t}\n\t}\n\t);\n\treturn future;\n}\n\nvoid IMMHandler::addImage(const string &LUCID,\n\t\tconst string &label, const string &data) {\n\tprint(\"@@@ Label: \" << label);\n\tprint(\"@@@ Size: \" << data.size());\n\t\/\/ Insert the descriptors matrix into MongoDB.\n\tstring mat_str = Image::imageToMatString(data); \/\/ written to file system\n\tGridFS grid(conn, \"lucida\");\n\tBSONObj result = grid.storeFile(mat_str.c_str(), mat_str.size(),\n\t\t\t\"opencv_\" + LUCID + \"\/\" + label);\n}\n\nvector<unique_ptr<StoredImage>> IMMHandler::getImages(const string &LUCID) {\n\tvector<unique_ptr<StoredImage>> rtn;\n\t\/\/ Retrieve all images of the user from MongoDB.\n\tauto_ptr<DBClientCursor> cursor = conn.query(\n\t\t\t\"lucida.images_\" + LUCID, BSONObj()); \/\/ retrieve desc, NOT data\n\tGridFS grid(conn, \"lucida\");\n\twhile (cursor->more()) {\n\t\tstring label = cursor->next().getStringField(\"label\");\n\t\tostringstream out;\n\t\tGridFile gf = grid.findFileByName(\"opencv_\" + LUCID + \"\/\" + label);\n\t\tif (!gf.exists()) {\n\t\t\tprint(\"opencv_\" + LUCID + \"\/\" + label + \" not found!\");\n\t\t\tcontinue;\n\t\t}\n\t\tgf.write(out);\n\t\trtn.push_back(unique_ptr<StoredImage>(new StoredImage(\n\t\t\t\tlabel,\n\t\t\t\tmove(Image::matStringToMatObj(out.str())))));\n\t}\n\treturn rtn;\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <algorithm>\n#include <thread>\n\nnamespace tp\n{\n\n\/**\n * @brief The ThreadPoolOptions class provides creation options for\n * ThreadPool.\n *\/\nclass ThreadPoolOptions\n{\npublic:\n    \/**\n     * @brief ThreadPoolOptions Construct default options for thread pool.\n     *\/\n    ThreadPoolOptions();\n\n    \/**\n     * @brief setThreadCount Set thread count.\n     * @param count Number of threads to be created.\n     *\/\n    void setThreadCount(size_t count);\n\n    \/**\n     * @brief setQueueSize Set single worker queue size.\n     * @param count Maximum length of queue of single worker.\n     *\/\n    void setQueueSize(size_t size);\n\n    \/**\n     * @brief threadCount Return thread count.\n     *\/\n    size_t threadCount() const;\n\n    \/**\n     * @brief queueSize Return single worker queue size.\n     *\/\n    size_t queueSize() const;\n\nprivate:\n    size_t m_thread_count;\n    size_t m_queue_size;\n};\n\n\/\/\/ Implementation\n\ninline ThreadPoolOptions::ThreadPoolOptions()\n    : m_thread_count(std::max<size_t>(1u, std::thread::hardware_concurrency()))\n    , m_queue_size(1024u)\n{\n}\n\ninline void ThreadPoolOptions::setThreadCount(size_t count)\n{\n    m_thread_count = std::max<size_t>(1u, count);\n}\n\ninline void ThreadPoolOptions::setQueueSize(size_t size)\n{\n    m_queue_size = std::max<size_t>(1u, size);\n}\n\ninline size_t ThreadPoolOptions::threadCount() const\n{\n    return m_thread_count;\n}\n\ninline size_t ThreadPoolOptions::queueSize() const\n{\n    return m_queue_size;\n}\n\n}\n<commit_msg>threadpool should do hw concurrency -1 to give main thread chance to process relays<commit_after>#pragma once\n\n#include <algorithm>\n#include <thread>\n\nnamespace tp\n{\n\n\/**\n * @brief The ThreadPoolOptions class provides creation options for\n * ThreadPool.\n *\/\nclass ThreadPoolOptions\n{\npublic:\n    \/**\n     * @brief ThreadPoolOptions Construct default options for thread pool.\n     *\/\n    ThreadPoolOptions();\n\n    \/**\n     * @brief setThreadCount Set thread count.\n     * @param count Number of threads to be created.\n     *\/\n    void setThreadCount(size_t count);\n\n    \/**\n     * @brief setQueueSize Set single worker queue size.\n     * @param count Maximum length of queue of single worker.\n     *\/\n    void setQueueSize(size_t size);\n\n    \/**\n     * @brief threadCount Return thread count.\n     *\/\n    size_t threadCount() const;\n\n    \/**\n     * @brief queueSize Return single worker queue size.\n     *\/\n    size_t queueSize() const;\n\nprivate:\n    size_t m_thread_count;\n    size_t m_queue_size;\n};\n\n\/\/\/ Implementation\n\ninline ThreadPoolOptions::ThreadPoolOptions()\n    : m_thread_count(std::max<size_t>(1u, std::thread::hardware_concurrency()-1))\n    , m_queue_size(1024u)\n{\n}\n\ninline void ThreadPoolOptions::setThreadCount(size_t count)\n{\n    m_thread_count = std::max<size_t>(1u, count);\n}\n\ninline void ThreadPoolOptions::setQueueSize(size_t size)\n{\n    m_queue_size = std::max<size_t>(1u, size);\n}\n\ninline size_t ThreadPoolOptions::threadCount() const\n{\n    return m_thread_count;\n}\n\ninline size_t ThreadPoolOptions::queueSize() const\n{\n    return m_queue_size;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/pldm\/extended\/pldm_entity_ids.C $                     *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 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 pldm_entity_ids.C\n *\n * @brief Implementation for interface in pldm_entity_ids.H\n *\/\n\n\/\/ Targeting\n#include <targeting\/common\/targetservice.H>\n#include <targeting\/common\/utilFilter.H>\n\n\/\/ PLDM\n#include \"..\/common\/pldmtrace.H\"\n#include <pldm\/extended\/pldm_entity_ids.H>\n#include <pldm\/extended\/pdr_manager.H>\n#include <pldm\/extended\/hb_pdrs.H>\n#include <pldm\/extended\/pldm_fru.H>\n#include <pldm\/pldm_reasoncodes.H>\n#include <pldm\/pldm_errl.H>\n\n\/\/ libpldm\n#include \"..\/extern\/pdr.h\"\n\nusing namespace ERRORLOG;\n\nnamespace\n{\n\nusing namespace PLDM;\nusing namespace TARGETING;\n\n\/\/ These are entities whose RSID is generated by Hostboot. We encode the RSID so\n\/\/ that we can retrieve the Target instance associated with the entity.\nconst entity_type hb_entity_types[] =\n{\n    ENTITY_TYPE_PROCESSOR_MODULE,\n    ENTITY_TYPE_DIMM\n};\n\n\/\/ These are entities whose RSID is NOT generated by Hostboot. We don't have a\n\/\/ strategy yet to associate them with the right Target instance, so we are\n\/\/ relying on them having one and only one instance and associating them that\n\/\/ way.\nstruct unique_entity_info\n{\n    TARGETING::CLASS target_class;\n    TARGETING::TYPE target_type;\n    entity_type ent_type;\n};\n\nconst unique_entity_info foreign_entity_types[] =\n{\n    { CLASS_ENC, TYPE_NODE, ENTITY_TYPE_BACKPLANE },\n    \/\/TODO RTC: 246066 Enable when TPMs are detected by hostboot\n\/\/     { CLASS_CHIP, TYPE_TPM, ENTITY_TYPE_TPM }\n};\n\n\/* @brief Update the given target's PLDM_ENTITY_ID_INFO attribute\n *        with a PLDM entity ID\n *\n * @param[in] i_target  The target to update\n * @param[in] i_rsid    FRU Record Set ID to use for Entity ID info\n * @return errlHndl_t   Error if any, otherwise nullptr\n *\/\nerrlHndl_t updateTargetEntityIdAttribute(Target* const i_target,\n                                         const fru_record_set_id_t i_rsid)\n{\n    errlHndl_t errl = nullptr;\n\n    do\n    {\n\n    pldm_entity ent { };\n\n    if (!thePdrManager().findEntityByFruRecordSetId(i_rsid, ent))\n    {\n        PLDM_ERR(\"Cannot find entity by FRU RSID 0x%04x\", i_rsid);\n\n        \/*\n         * @errortype  ERRL_SEV_UNRECOVERABLE\n         * @moduleid   MOD_PLDM_ENTITY_IDS\n         * @reasoncode RC_NO_ENTITY_FROM_RSID\n         * @userdata1  The Target HUID\n         * @userdata2  The FRU Record Set ID\n         * @devdesc    Software problem, cannot find Entity from FRU Record Set ID\n         * @custdesc   A software error occurred during system boot\n         *\/\n        errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                             MOD_PLDM_ENTITY_IDS,\n                             RC_NO_ENTITY_FROM_RSID,\n                             get_huid(i_target),\n                             i_rsid,\n                             ErrlEntry::ADD_SW_CALLOUT);\n\n        addBmcErrorCallouts(errl);\n        break;\n    }\n\n    \/\/ @TODO RTC 256140: Remove this function call when the BMC normalizes all\n    \/\/ PDRs\n    if (!thePdrManager().findEntityByTypeAndId(ent))\n    {\n        PLDM_ERR(\"Cannot find normalized entity container ID in entity \"\n                 \"assocation PDRs from the BMC on target HUID = 0x%08x\"\n                 \"(RSID = 0x%08x, type = 0x%x, instance number = 0x%x)\",\n                 get_huid(i_target),\n                 i_rsid,\n                 ent.entity_type,\n                 ent.entity_instance_num);\n\n        \/*\n         * @errortype  ERRL_SEV_UNRECOVERABLE\n         * @moduleid   MOD_PLDM_ENTITY_IDS\n         * @reasoncode RC_MISSING_ENTITY_ID\n         * @userdata1  The Target HUID\n         * @userdata2[0:15]   Entity type\n         * @userdata2[16:31]  Entity instance number\n         * @userdata2[32:63]  The FRU Record Set ID\n         * @devdesc    Software problem, cannot find Entity from FRU Record Set ID\n         * @custdesc   A software error occurred during system boot\n         *\/\n        errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                             MOD_PLDM_ENTITY_IDS,\n                             RC_MISSING_ENTITY_ID,\n                             get_huid(i_target),\n                             TWO_UINT16_ONE_UINT32_TO_UINT64(ent.entity_type,\n                                                             ent.entity_instance_num,\n                                                             i_rsid),\n                             ErrlEntry::ADD_SW_CALLOUT);\n\n        addBmcErrorCallouts(errl);\n        break;\n    }\n\n    PLDM_INF(\"Set PLDM_ENTITY_ID for HUID 0x%08x (%s) to 0x%04x\/0x%04x\/0x%04x\",\n             get_huid(i_target),\n             attrToString<ATTR_TYPE>(i_target->getAttr<ATTR_TYPE>()),\n             ent.entity_type,\n             ent.entity_instance_num,\n             ent.entity_container_id);\n\n    const TARGETING::ATTR_PLDM_ENTITY_ID_INFO_type entity_info =\n    {\n        \/\/ The attribute stores its values in little-endian\n        .entityType = static_cast<uint16_t>(htole16(ent.entity_type)),\n        .entityInstanceNumber = static_cast<uint16_t>(htole16(ent.entity_instance_num)),\n        .containerId = static_cast<uint16_t>(htole16(ent.entity_container_id))\n    };\n\n    i_target->setAttr<ATTR_PLDM_ENTITY_ID_INFO>(entity_info);\n\n    } while (false);\n\n    return errl;\n}\n\n}\n\nerrlHndl_t PLDM::assignTargetEntityIds()\n{\n    PLDM_ENTER(\"assignTargetEntityIds\");\n\n    errlHndl_t errl = nullptr;\n\n    do\n    {\n\n    \/\/ These RSIDs are not produced by Hostboot so we can't decode them to\n    \/\/ determine which Target it corresponds to. Instead we rely on the fact\n    \/\/ that there is only one Target object on single-node machines. This block\n    \/\/ deals with that.\n    for (const auto& entity_info : foreign_entity_types)\n    {\n        const auto target_rsid = thePdrManager().findFruRecordSetIdsByType(entity_info.ent_type);\n\n        \/\/ We don't have a way to associate multiple backplane RSIDs (which is\n        \/\/ created by the BMC) with Targets at this point, so throw an error\n        if (target_rsid.size() > 1)\n        {\n            PLDM_ERR(\"Got %llu targets of type %s, expected 0 or 1\",\n                     target_rsid.size(),\n                     attrToString<ATTR_TYPE>(entity_info.target_type));\n\n            \/*\n             * @errortype  ERRL_SEV_UNRECOVERABLE\n             * @moduleid   MOD_PLDM_ENTITY_IDS\n             * @reasoncode RC_EXPECTED_UNIQUE_ENTITY\n             * @userdata1  The number of targets found\n             * @userdata2[0:31]  The class of target\n             * @userdata2[32:63] The type of target\n             * @devdesc    Software problem, wanted 0 or 1 target, got multiple\n             * @custdesc   A software error occurred during system boot\n             *\/\n            errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                                 MOD_PLDM_ENTITY_IDS,\n                                 RC_EXPECTED_UNIQUE_ENTITY,\n                                 target_rsid.size(),\n                                 TWO_UINT32_TO_UINT64(entity_info.target_class,\n                                                      entity_info.target_type),\n                                 ErrlEntry::ADD_SW_CALLOUT);\n\n            addBmcErrorCallouts(errl);\n            break;\n        }\n\n        TargetHandleList target;\n\n        getClassResources(target,\n                          entity_info.target_class,\n                          entity_info.target_type,\n                          UTIL_FILTER_PRESENT);\n\n        if (target.size() != target_rsid.size())\n        {\n            \/*\n             * @errortype  ERRL_SEV_UNRECOVERABLE\n             * @moduleid   MOD_PLDM_ENTITY_IDS\n             * @reasoncode RC_EXPECTED_UNIQUE_TARGET\n             * @userdata1  The number of targets found\n             * @userdata2  The number of PLDM entities found\n             * @devdesc    Software problem, mismatching number of Targets and Entities\n             * @custdesc   A software error occurred during system boot\n             *\/\n            errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                                 MOD_PLDM_ENTITY_IDS,\n                                 RC_EXPECTED_UNIQUE_TARGET,\n                                 target.size(),\n                                 target_rsid.size(),\n                                 ErrlEntry::ADD_SW_CALLOUT);\n\n            addBmcErrorCallouts(errl);\n            break;\n        }\n\n        if (!target.empty())\n        {\n            errl = updateTargetEntityIdAttribute(target[0], target_rsid[0]);\n\n            if (errl)\n            {\n                break;\n            }\n        }\n    }\n\n    if (errl)\n    {\n        break;\n    }\n\n    \/\/ Now deal with records whose RSIDs Hostboot did encode with the\n    \/\/ corresponding Target's class\/type\/instance.\n    for (const entity_type ent_type : hb_entity_types)\n    {\n        const auto fru_rsids = thePdrManager().findFruRecordSetIdsByType(ent_type);\n\n        for (const auto rsid : fru_rsids)\n        {\n            Target* const target = getTargetFromHostbootFruRecordSetID(rsid);\n\n            \/\/ This means that either there was a programming error, or else the\n            \/\/ BMC did not preserve our RSIDs when we sent our PDRs to them and\n            \/\/ refetched them at the end of the PDR exchange.\n            if (!target)\n            {\n                PLDM_ERR(\"Cannot find target from RSID 0x%04x\", rsid);\n\n                \/*\n                 * @errortype  ERRL_SEV_UNRECOVERABLE\n                 * @moduleid   MOD_PLDM_ENTITY_IDS\n                 * @reasoncode RC_NO_TARGET_FROM_RSID\n                 * @userdata1  The FRU Record Set ID that does not correspond to a Target\n                 * @userdata2  The entity type of the corresponding Record Set\n                 * @devdesc    Software problem, cannot find the Target from FRU Record Set ID\n                 * @custdesc   A software error occurred during system boot\n                 *\/\n                errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                                     MOD_PLDM_ENTITY_IDS,\n                                     RC_NO_TARGET_FROM_RSID,\n                                     rsid,\n                                     ent_type,\n                                     ErrlEntry::ADD_SW_CALLOUT);\n\n                addBmcErrorCallouts(errl);\n                break;\n            }\n\n            errl = updateTargetEntityIdAttribute(target, rsid);\n\n            if (errl)\n            {\n                break;\n            }\n        }\n\n        if (errl)\n        {\n            break;\n        }\n    }\n\n    } while (false);\n\n    PLDM_EXIT(\"assignTargetEntityIds\");\n\n    return errl;\n}\n<commit_msg>Write PLDM entity ID information to sys and chassis attributes<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/pldm\/extended\/pldm_entity_ids.C $                     *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 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 pldm_entity_ids.C\n *\n * @brief Implementation for interface in pldm_entity_ids.H\n *\/\n\n\/\/ Targeting\n#include <targeting\/common\/targetservice.H>\n#include <targeting\/common\/utilFilter.H>\n\n\/\/ PLDM\n#include \"..\/common\/pldmtrace.H\"\n#include <pldm\/extended\/pldm_entity_ids.H>\n#include <pldm\/extended\/pdr_manager.H>\n#include <pldm\/extended\/hb_pdrs.H>\n#include <pldm\/extended\/pldm_fru.H>\n#include <pldm\/pldm_reasoncodes.H>\n#include <pldm\/pldm_errl.H>\n\n\/\/ libpldm\n#include \"..\/extern\/pdr.h\"\n\nusing namespace ERRORLOG;\n\nnamespace\n{\n\nusing namespace PLDM;\nusing namespace TARGETING;\n\n\/\/ These are entities whose RSID is generated by Hostboot. We encode the RSID so\n\/\/ that we can retrieve the Target instance associated with the entity.\nconst entity_type hb_entity_types[] =\n{\n    ENTITY_TYPE_PROCESSOR_MODULE,\n    ENTITY_TYPE_DIMM\n};\n\n\/\/ These are entities whose RSID is NOT generated by Hostboot. We don't have a\n\/\/ strategy yet to associate them with the right Target instance, so we are\n\/\/ relying on them having one and only one instance and associating them that\n\/\/ way.\nstruct unique_entity_info\n{\n    TARGETING::CLASS target_class;\n    TARGETING::TYPE target_type;\n    entity_type ent_type;\n};\n\nconst unique_entity_info foreign_entity_types[] =\n{\n    { CLASS_ENC, TYPE_NODE, ENTITY_TYPE_BACKPLANE },\n    { CLASS_SYS, TYPE_SYS,  ENTITY_TYPE_CHASSIS },\n    { CLASS_SYS, TYPE_SYS,  ENTITY_TYPE_LOGICAL_SYSTEM }\n    \/\/TODO RTC: 246066 Enable when TPMs are detected by hostboot\n\/\/     { CLASS_CHIP, TYPE_TPM, ENTITY_TYPE_TPM }\n};\n\n\/* @brief Update the given target's PLDM_ENTITY_ID_INFO attribute\n *        with a PLDM entity ID\n *\n * @param[in] i_target  The target to update\n * @param[in] i_rsid    FRU Record Set ID to use for Entity ID info\n * @return errlHndl_t   Error if any, otherwise nullptr\n *\/\nerrlHndl_t updateTargetEntityIdAttribute(Target* const i_target,\n                                         const fru_record_set_id_t i_rsid)\n{\n    errlHndl_t errl = nullptr;\n\n    do\n    {\n\n    pldm_entity ent { };\n\n    if (!thePdrManager().findEntityByFruRecordSetId(i_rsid, ent))\n    {\n        PLDM_ERR(\"Cannot find entity by FRU RSID 0x%04x\", i_rsid);\n\n        \/*\n         * @errortype  ERRL_SEV_UNRECOVERABLE\n         * @moduleid   MOD_PLDM_ENTITY_IDS\n         * @reasoncode RC_NO_ENTITY_FROM_RSID\n         * @userdata1  The Target HUID\n         * @userdata2  The FRU Record Set ID\n         * @devdesc    Software problem, cannot find Entity from FRU Record Set ID\n         * @custdesc   A software error occurred during system boot\n         *\/\n        errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                             MOD_PLDM_ENTITY_IDS,\n                             RC_NO_ENTITY_FROM_RSID,\n                             get_huid(i_target),\n                             i_rsid,\n                             ErrlEntry::ADD_SW_CALLOUT);\n\n        addBmcErrorCallouts(errl);\n        break;\n    }\n\n    \/\/ @TODO RTC 256140: Remove this function call when the BMC normalizes all\n    \/\/ PDRs\n    if (!thePdrManager().findEntityByTypeAndId(ent))\n    {\n        PLDM_ERR(\"Cannot find normalized entity container ID in entity \"\n                 \"assocation PDRs from the BMC on target HUID = 0x%08x\"\n                 \"(RSID = 0x%08x, type = 0x%x, instance number = 0x%x)\",\n                 get_huid(i_target),\n                 i_rsid,\n                 ent.entity_type,\n                 ent.entity_instance_num);\n\n        \/*\n         * @errortype  ERRL_SEV_UNRECOVERABLE\n         * @moduleid   MOD_PLDM_ENTITY_IDS\n         * @reasoncode RC_MISSING_ENTITY_ID\n         * @userdata1  The Target HUID\n         * @userdata2[0:15]   Entity type\n         * @userdata2[16:31]  Entity instance number\n         * @userdata2[32:63]  The FRU Record Set ID\n         * @devdesc    Software problem, cannot find Entity from FRU Record Set ID\n         * @custdesc   A software error occurred during system boot\n         *\/\n        errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                             MOD_PLDM_ENTITY_IDS,\n                             RC_MISSING_ENTITY_ID,\n                             get_huid(i_target),\n                             TWO_UINT16_ONE_UINT32_TO_UINT64(ent.entity_type,\n                                                             ent.entity_instance_num,\n                                                             i_rsid),\n                             ErrlEntry::ADD_SW_CALLOUT);\n\n        addBmcErrorCallouts(errl);\n        break;\n    }\n\n    PLDM_INF(\"Set PLDM_ENTITY_ID for HUID 0x%08x (%s) to 0x%04x\/0x%04x\/0x%04x\",\n             get_huid(i_target),\n             attrToString<ATTR_TYPE>(i_target->getAttr<ATTR_TYPE>()),\n             ent.entity_type,\n             ent.entity_instance_num,\n             ent.entity_container_id);\n\n    \/\/ This union groups all PLDM entity ID information attributes into the\n    \/\/ same storage location to be exploited below.  All PLDM entity ID\n    \/\/ information attribute flavors need to move in lock step if they are ever\n    \/\/ changed\n    const union {\n        TARGETING::ATTR_PLDM_ENTITY_ID_INFO_type         generic;\n        TARGETING::ATTR_CHASSIS_PLDM_ENTITY_ID_INFO_type chassis;\n        TARGETING::ATTR_SYSTEM_PLDM_ENTITY_ID_INFO_type  system;\n\n    } entity_info = {\n\n        \/\/ The attribute stores its values in little-endian\n        .generic = {\n            .entityType = static_cast<uint16_t>(htole16(ent.entity_type)),\n            .entityInstanceNumber = static_cast<uint16_t>(htole16(ent.entity_instance_num)),\n            .containerId = static_cast<uint16_t>(htole16(ent.entity_container_id)) \n         }\n    };\n\n    switch(ent.entity_type)\n    {\n        \/\/ System and chassis PLDM entity ID information map to specially named\n        \/\/ attributes (with the same format as PLDM_ENTITY_ID_INFO) that reside\n        \/\/ on the system target\n        case ENTITY_TYPE_LOGICAL_SYSTEM:\n            PLDM_INF(\"Writing logical system PLDM entity ID info\");\n            i_target->setAttr<ATTR_SYSTEM_PLDM_ENTITY_ID_INFO>(entity_info.system);\n            break;\n        case ENTITY_TYPE_CHASSIS:\n            PLDM_INF(\"Writing chassis PLDM entity ID info\");\n            i_target->setAttr<ATTR_CHASSIS_PLDM_ENTITY_ID_INFO>(entity_info.chassis);\n            break;\n        default:\n            i_target->setAttr<ATTR_PLDM_ENTITY_ID_INFO>(entity_info.generic);\n            break;\n    }\n\n    } while (false);\n\n    return errl;\n}\n\n}\n\nerrlHndl_t PLDM::assignTargetEntityIds()\n{\n    PLDM_ENTER(\"assignTargetEntityIds\");\n\n    errlHndl_t errl = nullptr;\n\n    do\n    {\n\n    \/\/ These RSIDs are not produced by Hostboot so we can't decode them to\n    \/\/ determine which Target it corresponds to. Instead we rely on the fact\n    \/\/ that there is only one Target object on single-node machines. This block\n    \/\/ deals with that.\n    for (const auto& entity_info : foreign_entity_types)\n    {\n        const auto target_rsid = thePdrManager().findFruRecordSetIdsByType(entity_info.ent_type);\n\n        \/\/ We don't have a way to associate multiple backplane RSIDs (which is\n        \/\/ created by the BMC) with Targets at this point, so throw an error\n        if (target_rsid.size() > 1)\n        {\n            PLDM_ERR(\"Got %llu targets of type %s, expected 0 or 1\",\n                     target_rsid.size(),\n                     attrToString<ATTR_TYPE>(entity_info.target_type));\n\n            \/*\n             * @errortype  ERRL_SEV_UNRECOVERABLE\n             * @moduleid   MOD_PLDM_ENTITY_IDS\n             * @reasoncode RC_EXPECTED_UNIQUE_ENTITY\n             * @userdata1  The number of targets found\n             * @userdata2[0:31]  The class of target\n             * @userdata2[32:63] The type of target\n             * @devdesc    Software problem, wanted 0 or 1 target, got multiple\n             * @custdesc   A software error occurred during system boot\n             *\/\n            errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                                 MOD_PLDM_ENTITY_IDS,\n                                 RC_EXPECTED_UNIQUE_ENTITY,\n                                 target_rsid.size(),\n                                 TWO_UINT32_TO_UINT64(entity_info.target_class,\n                                                      entity_info.target_type),\n                                 ErrlEntry::ADD_SW_CALLOUT);\n\n            addBmcErrorCallouts(errl);\n            break;\n        }\n\n        TargetHandleList target;\n\n        getClassResources(target,\n                          entity_info.target_class,\n                          entity_info.target_type,\n                          UTIL_FILTER_PRESENT);\n\n        if (target.size() != target_rsid.size())\n        {\n            \/*\n             * @errortype  ERRL_SEV_UNRECOVERABLE\n             * @moduleid   MOD_PLDM_ENTITY_IDS\n             * @reasoncode RC_EXPECTED_UNIQUE_TARGET\n             * @userdata1  The number of targets found\n             * @userdata2  The number of PLDM entities found\n             * @devdesc    Software problem, mismatching number of Targets and Entities\n             * @custdesc   A software error occurred during system boot\n             *\/\n            errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                                 MOD_PLDM_ENTITY_IDS,\n                                 RC_EXPECTED_UNIQUE_TARGET,\n                                 target.size(),\n                                 target_rsid.size(),\n                                 ErrlEntry::ADD_SW_CALLOUT);\n\n            addBmcErrorCallouts(errl);\n            break;\n        }\n\n        if (!target.empty())\n        {\n            errl = updateTargetEntityIdAttribute(target[0], target_rsid[0]);\n\n            if (errl)\n            {\n                break;\n            }\n        }\n    }\n\n    if (errl)\n    {\n        break;\n    }\n\n    \/\/ Now deal with records whose RSIDs Hostboot did encode with the\n    \/\/ corresponding Target's class\/type\/instance.\n    for (const entity_type ent_type : hb_entity_types)\n    {\n        const auto fru_rsids = thePdrManager().findFruRecordSetIdsByType(ent_type);\n\n        for (const auto rsid : fru_rsids)\n        {\n            Target* const target = getTargetFromHostbootFruRecordSetID(rsid);\n\n            \/\/ This means that either there was a programming error, or else the\n            \/\/ BMC did not preserve our RSIDs when we sent our PDRs to them and\n            \/\/ refetched them at the end of the PDR exchange.\n            if (!target)\n            {\n                PLDM_ERR(\"Cannot find target from RSID 0x%04x\", rsid);\n\n                \/*\n                 * @errortype  ERRL_SEV_UNRECOVERABLE\n                 * @moduleid   MOD_PLDM_ENTITY_IDS\n                 * @reasoncode RC_NO_TARGET_FROM_RSID\n                 * @userdata1  The FRU Record Set ID that does not correspond to a Target\n                 * @userdata2  The entity type of the corresponding Record Set\n                 * @devdesc    Software problem, cannot find the Target from FRU Record Set ID\n                 * @custdesc   A software error occurred during system boot\n                 *\/\n                errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n                                     MOD_PLDM_ENTITY_IDS,\n                                     RC_NO_TARGET_FROM_RSID,\n                                     rsid,\n                                     ent_type,\n                                     ErrlEntry::ADD_SW_CALLOUT);\n\n                addBmcErrorCallouts(errl);\n                break;\n            }\n\n            errl = updateTargetEntityIdAttribute(target, rsid);\n\n            if (errl)\n            {\n                break;\n            }\n        }\n\n        if (errl)\n        {\n            break;\n        }\n    }\n\n    } while (false);\n\n    PLDM_EXIT(\"assignTargetEntityIds\");\n\n    return errl;\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 <stdio.h>\n\n#include \"webrtc\/modules\/rtp_rtcp\/interface\/rtp_header_parser.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/interface\/rtp_payload_registry.h\"\n#include \"webrtc\/modules\/video_coding\/main\/test\/rtp_file_reader.h\"\n#include \"webrtc\/modules\/video_coding\/main\/test\/rtp_player.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n\nusing namespace webrtc::rtpplayer;\n\nconst uint32_t kMaxPacketSize = 1500;\nconst int kDefaultTransmissionTimeOffsetExtensionId = 2;\n\nint main(int argc, char** argv) {\n  if (argc < 2) {\n    printf(\"Usage: rtp_to_text <input_file.rtp> <output_file.rtp>\\n\")\n    return -1;\n  }\n  webrtc::scoped_ptr<RtpPacketSourceInterface> rtp_reader(\n      CreateRtpFileReader(argv[1]));\n  if (!rtp_reader.get()) {\n    printf(\"Cannot open input file %s\\n\", argv[1]);\n    return -1;\n  }\n  uint8_t packet_buffer[kMaxPacketSize];\n  uint8_t* packet = packet_buffer;\n  uint32_t packet_length = kMaxPacketSize;\n  uint32_t time_ms = 0;\n  FILE* out_file = fopen(argv[2], \"wt\");\n  if (!out_file) {\n    printf(\"Cannot open output file %s\\n\", argv[2]);\n    return -1;\n  }\n  printf(\"Input file: %s, Output file: %s\\n\\n\", argv[1], argv[2]);\n  fprintf(out_file, \"seqnum timestamp ts_offset abs_sendtime recvtime \"\n          \"markerbit ssrc size\\n\");\n  webrtc::scoped_ptr<webrtc::RtpHeaderParser> parser(\n      webrtc::RtpHeaderParser::Create());\n  parser->RegisterRtpHeaderExtension(\n      webrtc::kRtpExtensionTransmissionTimeOffset,\n      kDefaultTransmissionTimeOffsetExtensionId);\n  int packet_counter = 0;\n  while (rtp_reader->NextPacket(packet, &packet_length, &time_ms) == 0) {\n    webrtc::RTPHeader header;\n    parser->Parse(packet, packet_length, &header);\n    fprintf(out_file, \"%u %u %d %u %u %d %u %u\\n\", header.sequenceNumber,\n            header.timestamp, header.extension.transmissionTimeOffset,\n            header.extension.absoluteSendTime, time_ms, header.markerBit,\n            header.ssrc, packet_length);\n    packet_length = kMaxPacketSize;\n    ++packet_counter;\n  }\n  printf(\"Parsed %d packets\\n\", packet_counter);\n  return 0;\n}\n<commit_msg>Fix build error in r4934.<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 <stdio.h>\n\n#include \"webrtc\/modules\/rtp_rtcp\/interface\/rtp_header_parser.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/interface\/rtp_payload_registry.h\"\n#include \"webrtc\/modules\/video_coding\/main\/test\/rtp_file_reader.h\"\n#include \"webrtc\/modules\/video_coding\/main\/test\/rtp_player.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n\nusing namespace webrtc::rtpplayer;\n\nconst uint32_t kMaxPacketSize = 1500;\nconst int kDefaultTransmissionTimeOffsetExtensionId = 2;\n\nint main(int argc, char** argv) {\n  if (argc < 2) {\n    printf(\"Usage: rtp_to_text <input_file.rtp> <output_file.rtp>\\n\");\n    return -1;\n  }\n  webrtc::scoped_ptr<RtpPacketSourceInterface> rtp_reader(\n      CreateRtpFileReader(argv[1]));\n  if (!rtp_reader.get()) {\n    printf(\"Cannot open input file %s\\n\", argv[1]);\n    return -1;\n  }\n  uint8_t packet_buffer[kMaxPacketSize];\n  uint8_t* packet = packet_buffer;\n  uint32_t packet_length = kMaxPacketSize;\n  uint32_t time_ms = 0;\n  FILE* out_file = fopen(argv[2], \"wt\");\n  if (!out_file) {\n    printf(\"Cannot open output file %s\\n\", argv[2]);\n    return -1;\n  }\n  printf(\"Input file: %s, Output file: %s\\n\\n\", argv[1], argv[2]);\n  fprintf(out_file, \"seqnum timestamp ts_offset abs_sendtime recvtime \"\n          \"markerbit ssrc size\\n\");\n  webrtc::scoped_ptr<webrtc::RtpHeaderParser> parser(\n      webrtc::RtpHeaderParser::Create());\n  parser->RegisterRtpHeaderExtension(\n      webrtc::kRtpExtensionTransmissionTimeOffset,\n      kDefaultTransmissionTimeOffsetExtensionId);\n  int packet_counter = 0;\n  while (rtp_reader->NextPacket(packet, &packet_length, &time_ms) == 0) {\n    webrtc::RTPHeader header;\n    parser->Parse(packet, packet_length, &header);\n    fprintf(out_file, \"%u %u %d %u %u %d %u %u\\n\", header.sequenceNumber,\n            header.timestamp, header.extension.transmissionTimeOffset,\n            header.extension.absoluteSendTime, time_ms, header.markerBit,\n            header.ssrc, packet_length);\n    packet_length = kMaxPacketSize;\n    ++packet_counter;\n  }\n  printf(\"Parsed %d packets\\n\", packet_counter);\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_REV_MAT_FUN_ADJ_JAC_APPLY_HPP\n#define STAN_MATH_REV_MAT_FUN_ADJ_JAC_APPLY_HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/mat.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <limits>\n#include <vector>\n\nnamespace stan {\nnamespace math {\n\n\/*\n * adj_jac_vari interfaces a user supplied functor  with the reverse mode\n * autodiff. It allows someone to implement functions with custom reverse mode\n * autodiff without having to deal with autodiff types.\n *\n * The requirements on the functor F are described in the documentation for\n * adj_jac_apply\n *\n * @tparam F class of functor\n *\/\ntemplate <typename F>\nstruct adj_jac_vari : public vari {\n  F f_;\n  int N_;\n  vari** x_vi_;\n  int M_;\n  vari** y_vi_;\n\n  \/**\n   * The adj_jac_vari constructor\n   *  1. Initializes an instance of the user defined functor F\n   *  2. Calls operator() on the F instance with the double values from the\n   * input x\n   *  3. Saves copies of the varis pointed to by the input vars for subsequent\n   * calls to chain\n   *  4. Allocates varis for the output of the functor F\n   *\n   * @param x Input as vars\n   *\/\n  explicit adj_jac_vari(const Eigen::Matrix<var, Eigen::Dynamic, 1>& x)\n      : vari(std::numeric_limits<double>::quiet_NaN()),  \/\/ The val_ in this\n                                                         \/\/ vari is unused\n        N_(x.size()),\n        x_vi_(build_vari_array(x)) {\n    Eigen::Matrix<double, Eigen::Dynamic, 1> val_x = value_of(x);\n    Eigen::Matrix<double, Eigen::Dynamic, 1> val_y = f_(val_x);\n\n    M_ = val_y.size();\n    y_vi_ = ChainableStack::instance().memalloc_.alloc_array<vari*>(M_);\n    for (int m = 0; m < M_; ++m) {\n      y_vi_[m] = new vari(val_y(m), false);\n    }\n  }\n\n  \/**\n   * chain propagates the adjoints at the output varis (y_vi_) back to the input\n   * varis (x_vi_) by using the multiply_adjoint_jacobian function of the user\n   * defined functor\n   *\n   * Unlike the constructor, this operation may be called multiple times during\n   * the life of the vari\n   *\/\n  void chain() {\n    Eigen::Matrix<double, Eigen::Dynamic, 1> y_adj(M_);\n    for (int m = 0; m < M_; ++m)\n      y_adj(m) = y_vi_[m]->adj_;\n    Eigen::Matrix<double, Eigen::Dynamic, 1> y_adj_jac\n        = f_.multiply_adjoint_jacobian(y_adj);\n    for (int n = 0; n < N_; ++n)\n      x_vi_[n]->adj_ += y_adj_jac(n);\n  }\n};\n\n\/*\n * Return the result of applying the function defined by a nullary construction\n * of F to the specified input argument\n *\n * adj_jac_apply makes it possible to write efficient reverse-mode\n * autodiff code without ever touching Stan's autodiff internals\n *\n * Mathematically, to use a function in reverse mode autodiff, you need to be\n * able to evaluate the function (y = f(x)) and multiply the Jacobian of that\n * function (df(x)\/dx) by a vector.\n *\n * As an example, pretend there exists some large, complicated function, L(x),\n * which contains our smaller function f(x). The goal of autodiff is to compute\n * dL\/dx. If we break the large function into pieces:\n *\n * y = f(x)\n * L = g(y)\n *\n * If we were given dL\/dy we could compute dL\/dx by the product dL\/dy * dy\/dx\n *\n * Because y = f(x), dy\/dx is just df(x)\/dx, the Jacobian of the function we're\n * trying to define. In vector form,\n *\n * dL\/dx = (dL\/dy)' * df(x)\/dx\n *\n * So implementing f(x) and the product above is all that is required\n * mathematically to implement reverse-mode autodiff for a function.\n *\n * adj_jac_apply takes as a template argument a functor F that supplies the\n * non-static member functions: (required) Eigen::VectorXd operator()(const\n * Eigen::VectorXd& x), (required) Eigen::VectorXd\n * multiply_adjoint_jacobian(const Eigen::VectorXd& adj) and, (optional) a\n * nullary constructor\n *\n * operator() is responsible for computing f(x) and multiply_adjoint_jacobian is\n * responsible for computing the adjoint transpose Jacobian product (which\n * frequently does not require the calculation of the full Jacobian).\n *\n * operator() will be called before multiply_adjoint_jacobian is called, and is\n * only called once in the lifetime of the functor multiply_adjoint_jacobian is\n * called after operator() and may be called multiple times for any single\n * functor\n *\n * The functor supplied to adj_jac_apply must be careful to allocate any\n * variables it defines in the autodiff arena because its destructor will\n * never be called and memory will leak if allocated anywhere else.\n *\n * @tparam F functor to be connected to the autodiff stack\n * @param x input to the functor\n * @return the result of the specified operation wrapped up in vars\n *\/\ntemplate <class F>\nEigen::Matrix<var, Eigen::Dynamic, 1> adj_jac_apply(\n    const Eigen::Matrix<var, Eigen::Dynamic, 1>& x) {\n  adj_jac_vari<F>* vi = new adj_jac_vari<F>(x);\n  Eigen::Matrix<var, Eigen::Dynamic, 1> y(vi->M_);\n\n  for (int m = 0; m < y.size(); ++m)\n    y(m) = (vi->y_vi_)[m];\n  return y;\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\n<commit_msg>add ben's fixes<commit_after>#ifndef STAN_MATH_REV_MAT_FUN_ADJ_JAC_APPLY_HPP\n#define STAN_MATH_REV_MAT_FUN_ADJ_JAC_APPLY_HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/mat\/fun\/value_of.hpp>\n#include <stan\/math\/rev\/scal\/fun\/value_of.hpp>\n#include <limits>\n#include <vector>\n\nnamespace stan {\nnamespace math {\n\n\/*\n * adj_jac_vari interfaces a user supplied functor  with the reverse mode\n * autodiff. It allows someone to implement functions with custom reverse mode\n * autodiff without having to deal with autodiff types.\n *\n * The requirements on the functor F are described in the documentation for\n * adj_jac_apply\n *\n * @tparam F class of functor\n *\/\ntemplate <typename F>\nstruct adj_jac_vari : public vari {\n  F f_;\n  int N_;\n  vari** x_vi_;\n  int M_;\n  vari** y_vi_;\n\n  \/**\n   * The adj_jac_vari constructor\n   *  1. Initializes an instance of the user defined functor F\n   *  2. Calls operator() on the F instance with the double values from the\n   * input x\n   *  3. Saves copies of the varis pointed to by the input vars for subsequent\n   * calls to chain\n   *  4. Allocates varis for the output of the functor F\n   *\n   * @param x Input as vars\n   *\/\n  explicit adj_jac_vari(const Eigen::Matrix<var, Eigen::Dynamic, 1>& x)\n      : vari(std::numeric_limits<double>::quiet_NaN()),  \/\/ The val_ in this\n                                                         \/\/ vari is unused\n        N_(x.size()),\n        x_vi_(build_vari_array(x)) {\n    Eigen::Matrix<double, Eigen::Dynamic, 1> val_x = value_of(x);\n    Eigen::Matrix<double, Eigen::Dynamic, 1> val_y = f_(val_x);\n\n    M_ = val_y.size();\n    y_vi_ = ChainableStack::instance().memalloc_.alloc_array<vari*>(M_);\n    for (int m = 0; m < M_; ++m) {\n      y_vi_[m] = new vari(val_y(m), false);\n    }\n  }\n\n  \/**\n   * chain propagates the adjoints at the output varis (y_vi_) back to the input\n   * varis (x_vi_) by using the multiply_adjoint_jacobian function of the user\n   * defined functor\n   *\n   * Unlike the constructor, this operation may be called multiple times during\n   * the life of the vari\n   *\/\n  void chain() {\n    Eigen::Matrix<double, Eigen::Dynamic, 1> y_adj(M_);\n    for (int m = 0; m < M_; ++m)\n      y_adj(m) = y_vi_[m]->adj_;\n    Eigen::Matrix<double, Eigen::Dynamic, 1> y_adj_jac\n        = f_.multiply_adjoint_jacobian(y_adj);\n    for (int n = 0; n < N_; ++n)\n      x_vi_[n]->adj_ += y_adj_jac(n);\n  }\n};\n\n\/*\n * Return the result of applying the function defined by a nullary construction\n * of F to the specified input argument\n *\n * adj_jac_apply makes it possible to write efficient reverse-mode\n * autodiff code without ever touching Stan's autodiff internals\n *\n * Mathematically, to use a function in reverse mode autodiff, you need to be\n * able to evaluate the function (y = f(x)) and multiply the Jacobian of that\n * function (df(x)\/dx) by a vector.\n *\n * As an example, pretend there exists some large, complicated function, L(x),\n * which contains our smaller function f(x). The goal of autodiff is to compute\n * dL\/dx. If we break the large function into pieces:\n *\n * y = f(x)\n * L = g(y)\n *\n * If we were given dL\/dy we could compute dL\/dx by the product dL\/dy * dy\/dx\n *\n * Because y = f(x), dy\/dx is just df(x)\/dx, the Jacobian of the function we're\n * trying to define. In vector form,\n *\n * dL\/dx = (dL\/dy)' * df(x)\/dx\n *\n * So implementing f(x) and the product above is all that is required\n * mathematically to implement reverse-mode autodiff for a function.\n *\n * adj_jac_apply takes as a template argument a functor F that supplies the\n * non-static member functions: (required) Eigen::VectorXd operator()(const\n * Eigen::VectorXd& x), (required) Eigen::VectorXd\n * multiply_adjoint_jacobian(const Eigen::VectorXd& adj) and, (optional) a\n * nullary constructor\n *\n * operator() is responsible for computing f(x) and multiply_adjoint_jacobian is\n * responsible for computing the adjoint transpose Jacobian product (which\n * frequently does not require the calculation of the full Jacobian).\n *\n * operator() will be called before multiply_adjoint_jacobian is called, and is\n * only called once in the lifetime of the functor multiply_adjoint_jacobian is\n * called after operator() and may be called multiple times for any single\n * functor\n *\n * The functor supplied to adj_jac_apply must be careful to allocate any\n * variables it defines in the autodiff arena because its destructor will\n * never be called and memory will leak if allocated anywhere else.\n *\n * @tparam F functor to be connected to the autodiff stack\n * @param x input to the functor\n * @return the result of the specified operation wrapped up in vars\n *\/\ntemplate <class F>\nEigen::Matrix<var, Eigen::Dynamic, 1> adj_jac_apply(\n    const Eigen::Matrix<var, Eigen::Dynamic, 1>& x) {\n  adj_jac_vari<F>* vi = new adj_jac_vari<F>(x);\n  Eigen::Matrix<var, Eigen::Dynamic, 1> y(vi->M_);\n\n  for (int m = 0; m < y.size(); ++m)\n    y(m) = (vi->y_vi_)[m];\n  return y;\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"defs.h\"\n\n#include \"pixbuf.h\"\n#include <wincodec.h>\n\n#pragma comment(lib, \"WindowsCodecs.lib\")\n\nstatic int\nsg_pixbuf_loadwincodec(struct sg_pixbuf *pbuf, const void *data, size_t len,\n                       struct sg_error **err)\n{\n    HRESULT hr;\n    IWICImagingFactory *fac = NULL;\n    IWICStream *stream = NULL;\n    IWICBitmapDecoder *decoder = NULL;\n    IWICBitmapFrameDecode *frame = NULL;\n    WICPixelFormatGUID pixelFormat, targetFormat;\n    IWICComponentInfo *cinfo = NULL;\n    IWICPixelFormatInfo *pinfo = NULL;\n    IWICFormatConverter *converter = NULL;\n    UINT chanCount, iwidth, iheight;\n    sg_pixbuf_format_t pfmt;\n    int r;\n\n    hr = CoCreateInstance(CLSID_WICImagingFactory, NULL, CLSCTX_INPROC_SERVER, IID_PPV_ARGS(&fac));\n    if (hr != S_OK)\n        goto failed;\n    hr = fac->CreateStream(&stream);\n    if (hr != S_OK)\n        goto failed;\n    hr = stream->InitializeFromMemory((BYTE *) data, len);\n    if (hr != S_OK)\n        goto failed;\n    hr = fac->CreateDecoderFromStream(stream, NULL, WICDecodeMetadataCacheOnDemand, &decoder);\n    if (hr != S_OK)\n        goto failed;\n    hr = decoder->GetFrame(0, &frame);\n    if (hr != S_OK)\n        goto failed;\n    hr = frame->GetPixelFormat(&pixelFormat);\n    if (hr != S_OK)\n        goto failed;\n    hr = fac->CreateComponentInfo(pixelFormat, &cinfo);\n    if (hr != S_OK)\n        goto failed;\n    hr = cinfo->QueryInterface(IID_IWICPixelFormatInfo, (void **) &pinfo);\n    if (hr != S_OK)\n        goto failed;\n    hr = pinfo->GetChannelCount(&chanCount);\n    if (hr != S_OK)\n        goto failed;\n\n    switch (chanCount) {\n    case 1:\n        pfmt = SG_Y;\n        targetFormat = GUID_WICPixelFormat8bppGray;\n        break;\n\n    case 3:\n    case 4:\n        pfmt = SG_RGBA;\n        targetFormat = GUID_WICPixelFormat32bppRGBA;\n        break;\n\n    default:\n        goto failed;\n    }\n\n    hr = fac->CreateFormatConverter(&converter);\n    if (hr != S_OK)\n        goto failed;\n    hr = converter->Initialize(frame, targetFormat, WICBitmapDitherTypeNone, NULL, 0, WICBitmapPaletteTypeCustom);\n    if (hr != S_OK)\n        goto failed;\n    hr = converter->GetSize(&iwidth, &iheight);\n    if (hr != S_OK)\n        goto failed;\n    \n    r = sg_pixbuf_set(pbuf, pfmt, iwidth, iheight, err);\n    if (r)\n        goto done;\n    r = sg_pixbuf_alloc(pbuf, err);\n    if (r)\n        goto done;\n    converter->CopyPixels(NULL, pbuf->rowbytes, pbuf->rowbytes * pbuf->pheight, (BYTE *) pbuf->data);\n    r = 0;\n\ndone:\n    if (converter) converter->Release();\n    if (pinfo) pinfo->Release();\n    if (cinfo) cinfo->Release();\n    if (frame) frame->Release();\n    if (decoder) decoder->Release();\n    if (stream) stream->Release();\n    if (fac) fac->Release();\n    return r;\n\nfailed:\n    r = -1;\n    goto done;\n}\n\nint\nsg_pixbuf_loadpng(struct sg_pixbuf *pbuf, const void *data, size_t len,\n                  struct sg_error **err)\n{\n    return sg_pixbuf_loadwincodec(pbuf, data, len, err);\n}\n\nint\nsg_pixbuf_loadjpeg(struct sg_pixbuf *pbuf, const void *data, size_t len,\n                   struct sg_error **err)\n{\n    return sg_pixbuf_loadwincodec(pbuf, data, len, err);\n}\n<commit_msg>Make wincodec decoder generate errors properly<commit_after>#include \"defs.h\"\n\n#include \"error.h\"\n#include \"log.h\"\n#include \"pixbuf.h\"\n#include <wincodec.h>\n\n#pragma comment(lib, \"WindowsCodecs.lib\")\n\nstatic int\nsg_pixbuf_loadwincodec(struct sg_pixbuf *pbuf, const void *data, size_t len,\n                       struct sg_error **err)\n{\n    HRESULT hr;\n    IWICImagingFactory *fac = NULL;\n    IWICStream *stream = NULL;\n    IWICBitmapDecoder *decoder = NULL;\n    IWICBitmapFrameDecode *frame = NULL;\n    WICPixelFormatGUID pixelFormat, targetFormat;\n    IWICComponentInfo *cinfo = NULL;\n    IWICPixelFormatInfo *pinfo = NULL;\n    IWICFormatConverter *converter = NULL;\n    UINT chanCount, iwidth, iheight;\n    sg_pixbuf_format_t pfmt;\n    int r;\n\n    hr = CoCreateInstance(CLSID_WICImagingFactory, NULL, CLSCTX_INPROC_SERVER, IID_PPV_ARGS(&fac));\n    if (hr != S_OK)\n        goto failed;\n    hr = fac->CreateStream(&stream);\n    if (hr != S_OK)\n        goto failed;\n    hr = stream->InitializeFromMemory((BYTE *) data, len);\n    if (hr != S_OK)\n        goto failed;\n    hr = fac->CreateDecoderFromStream(stream, NULL, WICDecodeMetadataCacheOnDemand, &decoder);\n    if (hr != S_OK)\n        goto failed;\n    hr = decoder->GetFrame(0, &frame);\n    if (hr != S_OK)\n        goto failed;\n    hr = frame->GetPixelFormat(&pixelFormat);\n    if (hr != S_OK)\n        goto failed;\n    hr = fac->CreateComponentInfo(pixelFormat, &cinfo);\n    if (hr != S_OK)\n        goto failed;\n    hr = cinfo->QueryInterface(IID_IWICPixelFormatInfo, (void **) &pinfo);\n    if (hr != S_OK)\n        goto failed;\n    hr = pinfo->GetChannelCount(&chanCount);\n    if (hr != S_OK)\n        goto failed;\n\n    switch (chanCount) {\n    case 1:\n        pfmt = SG_Y;\n        targetFormat = GUID_WICPixelFormat8bppGray;\n        break;\n\n    case 3:\n    case 4:\n        pfmt = SG_RGBA;\n        targetFormat = GUID_WICPixelFormat32bppRGBA;\n        break;\n\n    default:\n        sg_logf(sg_logger_get(\"image\"), LOG_ERROR,\n                \"Unsupported channel count: %u\", chanCount);\n        sg_error_data(err, \"Wincodec\");\n        goto failed;\n    }\n\n    hr = fac->CreateFormatConverter(&converter);\n    if (hr != S_OK)\n        goto failed;\n    hr = converter->Initialize(frame, targetFormat, WICBitmapDitherTypeNone, NULL, 0, WICBitmapPaletteTypeCustom);\n    if (hr != S_OK)\n        goto failed;\n    hr = converter->GetSize(&iwidth, &iheight);\n    if (hr != S_OK)\n        goto failed;\n    \n    r = sg_pixbuf_set(pbuf, pfmt, iwidth, iheight, err);\n    if (r)\n        goto done;\n    r = sg_pixbuf_alloc(pbuf, err);\n    if (r)\n        goto done;\n    converter->CopyPixels(NULL, pbuf->rowbytes, pbuf->rowbytes * pbuf->pheight, (BYTE *) pbuf->data);\n    r = 0;\n\ndone:\n    if (converter) converter->Release();\n    if (pinfo) pinfo->Release();\n    if (cinfo) cinfo->Release();\n    if (frame) frame->Release();\n    if (decoder) decoder->Release();\n    if (stream) stream->Release();\n    if (fac) fac->Release();\n    return r;\n\nfailed:\n    sg_error_hresult(err, hr);\n    r = -1;\n    goto done;\n}\n\nint\nsg_pixbuf_loadpng(struct sg_pixbuf *pbuf, const void *data, size_t len,\n                  struct sg_error **err)\n{\n    return sg_pixbuf_loadwincodec(pbuf, data, len, err);\n}\n\nint\nsg_pixbuf_loadjpeg(struct sg_pixbuf *pbuf, const void *data, size_t len,\n                   struct sg_error **err)\n{\n    return sg_pixbuf_loadwincodec(pbuf, data, len, err);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2008-present Contributors to the OpenImageIO project.\n\/\/ SPDX-License-Identifier: BSD-3-Clause\n\/\/ https:\/\/github.com\/OpenImageIO\/oiio\/blob\/master\/LICENSE.md\n#include \"bmp_pvt.h\"\n\nOIIO_PLUGIN_NAMESPACE_BEGIN\n\nusing namespace bmp_pvt;\n\n\/\/ Obligatory material to make this a recognizeable imageio plugin\nOIIO_PLUGIN_EXPORTS_BEGIN\n\nOIIO_EXPORT int bmp_imageio_version = OIIO_PLUGIN_VERSION;\n\nOIIO_EXPORT const char*\nbmp_imageio_library_version()\n{\n    return nullptr;\n}\n\nOIIO_EXPORT ImageInput*\nbmp_input_imageio_create()\n{\n    return new BmpInput;\n}\n\nOIIO_EXPORT const char* bmp_input_extensions[] = { \"bmp\", nullptr };\n\nOIIO_PLUGIN_EXPORTS_END\n\n\nbool\nBmpInput::valid_file(const std::string& filename) const\n{\n    FILE* fd = Filesystem::fopen(filename, \"rb\");\n    if (!fd)\n        return false;\n    bmp_pvt::BmpFileHeader bmp_header;\n    bool ok = bmp_header.read_header(fd) && bmp_header.isBmp();\n    fclose(fd);\n    return ok;\n}\n\n\n\nbool\nBmpInput::open(const std::string& name, ImageSpec& spec)\n{\n    \/\/ saving 'name' for later use\n    m_filename = name;\n\n    m_fd = Filesystem::fopen(m_filename, \"rb\");\n    if (!m_fd) {\n        errorf(\"Could not open file \\\"%s\\\"\", name);\n        return false;\n    }\n\n    \/\/ we read header of the file that we think is BMP file\n    if (!m_bmp_header.read_header(m_fd)) {\n        errorf(\"\\\"%s\\\": wrong bmp header size\", m_filename);\n        close();\n        return false;\n    }\n    if (!m_bmp_header.isBmp()) {\n        errorf(\"\\\"%s\\\" is not a BMP file, magic number doesn't match\",\n               m_filename);\n        close();\n        return false;\n    }\n    if (!m_dib_header.read_header(m_fd)) {\n        errorf(\"\\\"%s\\\": wrong bitmap header size\", m_filename);\n        close();\n        return false;\n    }\n\n    const int nchannels = (m_dib_header.bpp == 32) ? 4 : 3;\n    const int height    = (m_dib_header.height >= 0) ? m_dib_header.height\n                                                  : -m_dib_header.height;\n    m_spec = ImageSpec(m_dib_header.width, height, nchannels, TypeDesc::UINT8);\n    m_spec.attribute(\"XResolution\", (int)m_dib_header.hres);\n    m_spec.attribute(\"YResolution\", (int)m_dib_header.vres);\n    m_spec.attribute(\"ResolutionUnit\", \"m\");\n\n    \/\/ computing size of one scanline - this is the size of one scanline that\n    \/\/ is stored in the file, not in the memory\n    int swidth = 0;\n    switch (m_dib_header.bpp) {\n    case 32:\n    case 24:\n        m_padded_scanline_size = ((m_spec.width * m_spec.nchannels) + 3) & ~3;\n        break;\n    case 16:\n        m_padded_scanline_size = ((m_spec.width << 1) + 3) & ~3;\n        m_spec.attribute(\"oiio:BitsPerSample\", 4);\n        break;\n    case 8:\n        m_padded_scanline_size = (m_spec.width + 3) & ~3;\n        if (!read_color_table())\n            return false;\n        break;\n    case 4:\n        swidth                 = (m_spec.width + 1) \/ 2;\n        m_padded_scanline_size = (swidth + 3) & ~3;\n        if (!read_color_table())\n            return false;\n        break;\n    case 1:\n        swidth                 = (m_spec.width + 7) \/ 8;\n        m_padded_scanline_size = (swidth + 3) & ~3;\n        if (!read_color_table())\n            return false;\n        break;\n    }\n\n    \/\/ file pointer is set to the beginning of image data\n    \/\/ we save this position - it will be helpfull in read_native_scanline\n    m_image_start = Filesystem::ftell(m_fd);\n\n    spec = m_spec;\n    return true;\n}\n\n\n\nbool\nBmpInput::read_native_scanline(int subimage, int miplevel, int y, int \/*z*\/,\n                               void* data)\n{\n    lock_guard lock(*this);\n    if (!seek_subimage(subimage, miplevel))\n        return false;\n\n    if (y < 0 || y > m_spec.height)\n        return false;\n\n    \/\/ if the height is positive scanlines are stored bottom-up\n    if (m_dib_header.width >= 0)\n        y = m_spec.height - y - 1;\n    const int64_t scanline_off = y * m_padded_scanline_size;\n\n    std::unique_ptr<unsigned char[]> fscanline(\n        new unsigned char[m_padded_scanline_size]);\n    Filesystem::fseek(m_fd, m_image_start + scanline_off, SEEK_SET);\n    size_t n = fread(fscanline.get(), 1, m_padded_scanline_size, m_fd);\n    if (n != (size_t)m_padded_scanline_size) {\n        if (feof(m_fd))\n            errorf(\"Hit end of file unexpectedly\");\n        else\n            errorf(\"read error\");\n        return false;  \/\/ Read failed\n    }\n\n    \/\/ in each case we process only first m_spec.scanline_bytes () bytes\n    \/\/ as only they contain information about pixels. The rest are just\n    \/\/ because scanline size have to be 32-bit boundary\n    if (m_dib_header.bpp == 24 || m_dib_header.bpp == 32) {\n        for (unsigned int i = 0; i < m_spec.scanline_bytes();\n             i += m_spec.nchannels)\n            std::swap(fscanline[i], fscanline[i + 2]);\n        memcpy(data, fscanline.get(), m_spec.scanline_bytes());\n        return true;\n    }\n\n    size_t scanline_bytes = m_spec.scanline_bytes();\n    std::unique_ptr<unsigned char[]> mscanline(\n        new unsigned char[scanline_bytes]);\n    if (m_dib_header.bpp == 16) {\n        const uint16_t RED   = 0x7C00;\n        const uint16_t GREEN = 0x03E0;\n        const uint16_t BLUE  = 0x001F;\n        for (unsigned int i = 0, j = 0; j < scanline_bytes; i += 2, j += 3) {\n            uint16_t pixel   = (uint16_t) * (&fscanline[i]);\n            mscanline[j]     = (uint8_t)((pixel & RED) >> 8);\n            mscanline[j + 1] = (uint8_t)((pixel & GREEN) >> 4);\n            mscanline[j + 2] = (uint8_t)(pixel & BLUE);\n        }\n    }\n    if (m_dib_header.bpp == 8) {\n        for (unsigned int i = 0, j = 0; j < scanline_bytes; ++i, j += 3) {\n            mscanline[j]     = m_colortable[fscanline[i]].r;\n            mscanline[j + 1] = m_colortable[fscanline[i]].g;\n            mscanline[j + 2] = m_colortable[fscanline[i]].b;\n        }\n    }\n    if (m_dib_header.bpp == 4) {\n        for (unsigned int i = 0, j = 0; j + 6 < scanline_bytes; ++i, j += 6) {\n            uint8_t mask     = 0xF0;\n            mscanline[j]     = m_colortable[(fscanline[i] & mask) >> 4].r;\n            mscanline[j + 1] = m_colortable[(fscanline[i] & mask) >> 4].g;\n            mscanline[j + 2] = m_colortable[(fscanline[i] & mask) >> 4].b;\n            mask             = 0x0F;\n            mscanline[j + 3] = m_colortable[fscanline[i] & mask].r;\n            mscanline[j + 4] = m_colortable[fscanline[i] & mask].g;\n            mscanline[j + 5] = m_colortable[fscanline[i] & mask].b;\n        }\n    }\n    if (m_dib_header.bpp == 1) {\n        for (int64_t i = 0, k = 0; i < m_padded_scanline_size; ++i) {\n            for (int j = 7; j >= 0; --j, k += 3) {\n                if (size_t(k + 2) >= scanline_bytes)\n                    break;\n                int index = 0;\n                if (fscanline[i] & (1 << j))\n                    index = 1;\n                mscanline[k]     = m_colortable[index].r;\n                mscanline[k + 1] = m_colortable[index].g;\n                mscanline[k + 2] = m_colortable[index].b;\n            }\n        }\n    }\n    memcpy(data, &mscanline[0], scanline_bytes);\n    return true;\n}\n\n\n\nbool inline BmpInput::close(void)\n{\n    if (m_fd) {\n        fclose(m_fd);\n        m_fd = NULL;\n    }\n    init();\n    return true;\n}\n\n\n\nbool\nBmpInput::read_color_table(void)\n{\n    \/\/ size of color table is defined  by m_dib_header.cpalete\n    \/\/ if this field is 0 - color table has max colors:\n    \/\/ pow(2, m_dib_header.cpalete) otherwise color table have\n    \/\/ m_dib_header.cpalete entries\n    const int32_t colors = (m_dib_header.cpalete) ? m_dib_header.cpalete\n                                                  : 1 << m_dib_header.bpp;\n    size_t entry_size = 4;\n    \/\/ if the file is OS V2 bitmap color table entr has only 3 bytes, not four\n    if (m_dib_header.size == OS2_V1)\n        entry_size = 3;\n    m_colortable.resize(colors);\n    for (int i = 0; i < colors; i++) {\n        size_t n = fread(&m_colortable[i], 1, entry_size, m_fd);\n        if (n != entry_size) {\n            if (feof(m_fd))\n                errorf(\n                    \"Hit end of file unexpectedly while reading color table\");\n            else\n                errorf(\"read error while reading color table\");\n            return false;  \/\/ Read failed\n        }\n    }\n    return true;  \/\/ ok\n}\n\nOIIO_PLUGIN_NAMESPACE_END\n<commit_msg>Fix bmp row order (#2776)<commit_after>\/\/ Copyright 2008-present Contributors to the OpenImageIO project.\n\/\/ SPDX-License-Identifier: BSD-3-Clause\n\/\/ https:\/\/github.com\/OpenImageIO\/oiio\/blob\/master\/LICENSE.md\n#include \"bmp_pvt.h\"\n\nOIIO_PLUGIN_NAMESPACE_BEGIN\n\nusing namespace bmp_pvt;\n\n\/\/ Obligatory material to make this a recognizeable imageio plugin\nOIIO_PLUGIN_EXPORTS_BEGIN\n\nOIIO_EXPORT int bmp_imageio_version = OIIO_PLUGIN_VERSION;\n\nOIIO_EXPORT const char*\nbmp_imageio_library_version()\n{\n    return nullptr;\n}\n\nOIIO_EXPORT ImageInput*\nbmp_input_imageio_create()\n{\n    return new BmpInput;\n}\n\nOIIO_EXPORT const char* bmp_input_extensions[] = { \"bmp\", nullptr };\n\nOIIO_PLUGIN_EXPORTS_END\n\n\nbool\nBmpInput::valid_file(const std::string& filename) const\n{\n    FILE* fd = Filesystem::fopen(filename, \"rb\");\n    if (!fd)\n        return false;\n    bmp_pvt::BmpFileHeader bmp_header;\n    bool ok = bmp_header.read_header(fd) && bmp_header.isBmp();\n    fclose(fd);\n    return ok;\n}\n\n\n\nbool\nBmpInput::open(const std::string& name, ImageSpec& spec)\n{\n    \/\/ saving 'name' for later use\n    m_filename = name;\n\n    m_fd = Filesystem::fopen(m_filename, \"rb\");\n    if (!m_fd) {\n        errorf(\"Could not open file \\\"%s\\\"\", name);\n        return false;\n    }\n\n    \/\/ we read header of the file that we think is BMP file\n    if (!m_bmp_header.read_header(m_fd)) {\n        errorf(\"\\\"%s\\\": wrong bmp header size\", m_filename);\n        close();\n        return false;\n    }\n    if (!m_bmp_header.isBmp()) {\n        errorf(\"\\\"%s\\\" is not a BMP file, magic number doesn't match\",\n               m_filename);\n        close();\n        return false;\n    }\n    if (!m_dib_header.read_header(m_fd)) {\n        errorf(\"\\\"%s\\\": wrong bitmap header size\", m_filename);\n        close();\n        return false;\n    }\n\n    const int nchannels = (m_dib_header.bpp == 32) ? 4 : 3;\n    const int height    = (m_dib_header.height >= 0) ? m_dib_header.height\n                                                  : -m_dib_header.height;\n    m_spec = ImageSpec(m_dib_header.width, height, nchannels, TypeDesc::UINT8);\n    m_spec.attribute(\"XResolution\", (int)m_dib_header.hres);\n    m_spec.attribute(\"YResolution\", (int)m_dib_header.vres);\n    m_spec.attribute(\"ResolutionUnit\", \"m\");\n\n    \/\/ computing size of one scanline - this is the size of one scanline that\n    \/\/ is stored in the file, not in the memory\n    int swidth = 0;\n    switch (m_dib_header.bpp) {\n    case 32:\n    case 24:\n        m_padded_scanline_size = ((m_spec.width * m_spec.nchannels) + 3) & ~3;\n        break;\n    case 16:\n        m_padded_scanline_size = ((m_spec.width << 1) + 3) & ~3;\n        m_spec.attribute(\"oiio:BitsPerSample\", 4);\n        break;\n    case 8:\n        m_padded_scanline_size = (m_spec.width + 3) & ~3;\n        if (!read_color_table())\n            return false;\n        break;\n    case 4:\n        swidth                 = (m_spec.width + 1) \/ 2;\n        m_padded_scanline_size = (swidth + 3) & ~3;\n        if (!read_color_table())\n            return false;\n        break;\n    case 1:\n        swidth                 = (m_spec.width + 7) \/ 8;\n        m_padded_scanline_size = (swidth + 3) & ~3;\n        if (!read_color_table())\n            return false;\n        break;\n    }\n\n    \/\/ file pointer is set to the beginning of image data\n    \/\/ we save this position - it will be helpfull in read_native_scanline\n    m_image_start = Filesystem::ftell(m_fd);\n\n    spec = m_spec;\n    return true;\n}\n\n\n\nbool\nBmpInput::read_native_scanline(int subimage, int miplevel, int y, int \/*z*\/,\n                               void* data)\n{\n    lock_guard lock(*this);\n    if (!seek_subimage(subimage, miplevel))\n        return false;\n\n    if (y < 0 || y > m_spec.height)\n        return false;\n\n    \/\/ if the height is positive scanlines are stored bottom-up\n    if (m_dib_header.height >= 0)\n        y = m_spec.height - y - 1;\n    const int64_t scanline_off = y * m_padded_scanline_size;\n\n    std::unique_ptr<unsigned char[]> fscanline(\n        new unsigned char[m_padded_scanline_size]);\n    Filesystem::fseek(m_fd, m_image_start + scanline_off, SEEK_SET);\n    size_t n = fread(fscanline.get(), 1, m_padded_scanline_size, m_fd);\n    if (n != (size_t)m_padded_scanline_size) {\n        if (feof(m_fd))\n            errorf(\"Hit end of file unexpectedly\");\n        else\n            errorf(\"read error\");\n        return false;  \/\/ Read failed\n    }\n\n    \/\/ in each case we process only first m_spec.scanline_bytes () bytes\n    \/\/ as only they contain information about pixels. The rest are just\n    \/\/ because scanline size have to be 32-bit boundary\n    if (m_dib_header.bpp == 24 || m_dib_header.bpp == 32) {\n        for (unsigned int i = 0; i < m_spec.scanline_bytes();\n             i += m_spec.nchannels)\n            std::swap(fscanline[i], fscanline[i + 2]);\n        memcpy(data, fscanline.get(), m_spec.scanline_bytes());\n        return true;\n    }\n\n    size_t scanline_bytes = m_spec.scanline_bytes();\n    std::unique_ptr<unsigned char[]> mscanline(\n        new unsigned char[scanline_bytes]);\n    if (m_dib_header.bpp == 16) {\n        const uint16_t RED   = 0x7C00;\n        const uint16_t GREEN = 0x03E0;\n        const uint16_t BLUE  = 0x001F;\n        for (unsigned int i = 0, j = 0; j < scanline_bytes; i += 2, j += 3) {\n            uint16_t pixel   = (uint16_t) * (&fscanline[i]);\n            mscanline[j]     = (uint8_t)((pixel & RED) >> 8);\n            mscanline[j + 1] = (uint8_t)((pixel & GREEN) >> 4);\n            mscanline[j + 2] = (uint8_t)(pixel & BLUE);\n        }\n    }\n    if (m_dib_header.bpp == 8) {\n        for (unsigned int i = 0, j = 0; j < scanline_bytes; ++i, j += 3) {\n            mscanline[j]     = m_colortable[fscanline[i]].r;\n            mscanline[j + 1] = m_colortable[fscanline[i]].g;\n            mscanline[j + 2] = m_colortable[fscanline[i]].b;\n        }\n    }\n    if (m_dib_header.bpp == 4) {\n        for (unsigned int i = 0, j = 0; j + 6 < scanline_bytes; ++i, j += 6) {\n            uint8_t mask     = 0xF0;\n            mscanline[j]     = m_colortable[(fscanline[i] & mask) >> 4].r;\n            mscanline[j + 1] = m_colortable[(fscanline[i] & mask) >> 4].g;\n            mscanline[j + 2] = m_colortable[(fscanline[i] & mask) >> 4].b;\n            mask             = 0x0F;\n            mscanline[j + 3] = m_colortable[fscanline[i] & mask].r;\n            mscanline[j + 4] = m_colortable[fscanline[i] & mask].g;\n            mscanline[j + 5] = m_colortable[fscanline[i] & mask].b;\n        }\n    }\n    if (m_dib_header.bpp == 1) {\n        for (int64_t i = 0, k = 0; i < m_padded_scanline_size; ++i) {\n            for (int j = 7; j >= 0; --j, k += 3) {\n                if (size_t(k + 2) >= scanline_bytes)\n                    break;\n                int index = 0;\n                if (fscanline[i] & (1 << j))\n                    index = 1;\n                mscanline[k]     = m_colortable[index].r;\n                mscanline[k + 1] = m_colortable[index].g;\n                mscanline[k + 2] = m_colortable[index].b;\n            }\n        }\n    }\n    memcpy(data, &mscanline[0], scanline_bytes);\n    return true;\n}\n\n\n\nbool inline BmpInput::close(void)\n{\n    if (m_fd) {\n        fclose(m_fd);\n        m_fd = NULL;\n    }\n    init();\n    return true;\n}\n\n\n\nbool\nBmpInput::read_color_table(void)\n{\n    \/\/ size of color table is defined  by m_dib_header.cpalete\n    \/\/ if this field is 0 - color table has max colors:\n    \/\/ pow(2, m_dib_header.cpalete) otherwise color table have\n    \/\/ m_dib_header.cpalete entries\n    const int32_t colors = (m_dib_header.cpalete) ? m_dib_header.cpalete\n                                                  : 1 << m_dib_header.bpp;\n    size_t entry_size = 4;\n    \/\/ if the file is OS V2 bitmap color table entr has only 3 bytes, not four\n    if (m_dib_header.size == OS2_V1)\n        entry_size = 3;\n    m_colortable.resize(colors);\n    for (int i = 0; i < colors; i++) {\n        size_t n = fread(&m_colortable[i], 1, entry_size, m_fd);\n        if (n != entry_size) {\n            if (feof(m_fd))\n                errorf(\n                    \"Hit end of file unexpectedly while reading color table\");\n            else\n                errorf(\"read error while reading color table\");\n            return false;  \/\/ Read failed\n        }\n    }\n    return true;  \/\/ ok\n}\n\nOIIO_PLUGIN_NAMESPACE_END\n<|endoftext|>"}
{"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2005 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 MERCHANTABILITY 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\"), both));\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(\"viewZoom toggle\"),\n\t\t\t\t\t press));\n  wayToBindActions.insert(std::make_pair(std::string(\"viewZoom in\"), press));\n  wayToBindActions.insert(std::make_pair(std::string(\"viewZoom out\"), 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(\"toggleRadar\"), press));\n  wayToBindActions.insert(std::make_pair(std::string(\"toggleConsole\"), 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(\"addhunt\"), 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(BindingTable::value_type(\"F12\", \"quit\"));\n  defaultBinding.insert(BindingTable::value_type(\"Left Mouse\", \"fire\"));\n  defaultBinding.insert(BindingTable::value_type(\"Enter\", \"fire\"));\n  defaultBinding.insert(BindingTable::value_type(\"Middle Mouse\", \"drop\"));\n  defaultBinding.insert(BindingTable::value_type(\"Space\", \"drop\"));\n  defaultBinding.insert(BindingTable::value_type(\"Right Mouse\", \"identify\"));\n  defaultBinding.insert(BindingTable::value_type(\"I\", \"identify\"));\n  defaultBinding.insert(BindingTable::value_type(\"Tab\", \"jump\"));\n  defaultBinding.insert(BindingTable::value_type(\"N\", \"send all\"));\n  defaultBinding.insert(BindingTable::value_type(\"M\", \"send team\"));\n  defaultBinding.insert(BindingTable::value_type(\",\", \"send nemesis\"));\n  defaultBinding.insert(BindingTable::value_type(\".\", \"send recipient\"));\n  defaultBinding.insert(BindingTable::value_type(\"Z\", \"send admin\"));\n  defaultBinding.insert(BindingTable::value_type(\"S\", \"toggle displayScore\"));\n  defaultBinding.insert(BindingTable::value_type(\"B\", \"viewZoom toggle\"));\n  defaultBinding.insert(BindingTable::value_type(\"Ctrl+Wheel Up\", \"viewZoom in\"));\n  defaultBinding.insert(BindingTable::value_type(\"Ctrl+Wheel Down\", \"viewZoom out\"));\n  defaultBinding.insert(BindingTable::value_type(\"Pause\", \"pause\"));\n  defaultBinding.insert(BindingTable::value_type(\"P\", \"pause\"));\n  defaultBinding.insert(BindingTable::value_type(\"F1\", \"fullscreen\"));\n  defaultBinding.insert(BindingTable::value_type(\"Q\", \"toggleRadar\"));\n  defaultBinding.insert(BindingTable::value_type(\"W\", \"toggleConsole\"));\n  defaultBinding.insert(BindingTable::value_type(\"F4\", \"iconify\"));\n#ifdef SNAPPING\n  defaultBinding.insert(BindingTable::value_type(\"F5\", \"screenshot\"));\n#endif\n  defaultBinding.insert(BindingTable::value_type(\"-\", \"time backward\"));\n  defaultBinding.insert(BindingTable::value_type(\"=\", \"time forward\"));\n  defaultBinding.insert(BindingTable::value_type(\"H\", \"toggleFlags radar\"));\n  defaultBinding.insert(BindingTable::value_type(\"J\", \"toggleFlags main\"));\n  defaultBinding.insert(BindingTable::value_type(\"K\", \"silence\"));\n  defaultBinding.insert(BindingTable::value_type(\"L\", \"toggle displayLabels\"));\n  defaultBinding.insert(BindingTable::value_type(\"Delete\", \"destruct\"));\n\n  \/\/ Default movement keys\n  defaultBinding.insert(BindingTable::value_type(\"Left Arrow\", \"turn left\"));\n  defaultBinding.insert(BindingTable::value_type(\"Right Arrow\", \"turn right\"));\n  defaultBinding.insert(BindingTable::value_type(\"Up Arrow\", \"drive forward\"));\n  defaultBinding.insert(BindingTable::value_type(\"Down Arrow\", \"drive reverse\"));\n  \/\/ End default movement keys\n\n  defaultBinding.insert(BindingTable::value_type(\"Shift+Wheel Up\", \"radarZoom in\"));\n  defaultBinding.insert(BindingTable::value_type(\"Shift+Wheel Down\", \"radarZoom out\"));\n\n  defaultBinding.insert(BindingTable::value_type(\"F6\", \"roam cycle subject backward\"));\n  defaultBinding.insert(BindingTable::value_type(\"F7\", \"roam cycle subject forward\"));\n  defaultBinding.insert(BindingTable::value_type(\"F8\", \"roam cycle type forward\"));\n  defaultBinding.insert(BindingTable::value_type(\"F9\", \"roam zoom in\"));\n  defaultBinding.insert(BindingTable::value_type(\"F10\", \"roam zoom out\"));\n  defaultBinding.insert(BindingTable::value_type(\"F11\", \"roam zoom normal\"));\n  defaultBinding.insert(BindingTable::value_type(\"O\", \"servercommand\"));\n  defaultBinding.insert(BindingTable::value_type(\"F\", \"toggle displayFlagHelp\"));\n  defaultBinding.insert(BindingTable::value_type(\"Page Up\", \"scrollpanel up\"));\n  defaultBinding.insert(BindingTable::value_type(\"Wheel Up\", \"scrollpanel up\"));\n  defaultBinding.insert(BindingTable::value_type(\"Page Down\", \"scrollpanel down\"));\n  defaultBinding.insert(BindingTable::value_type(\"Wheel Down\", \"scrollpanel down\"));\n  defaultBinding.insert(BindingTable::value_type(\"1\", \"set displayRadarRange 0.25\"));\n  defaultBinding.insert(BindingTable::value_type(\"2\", \"set displayRadarRange 0.5\"));\n  defaultBinding.insert(BindingTable::value_type(\"3\", \"set displayRadarRange 1.0\"));\n  defaultBinding.insert(BindingTable::value_type(\"4\", \"radarZoom in\"));\n  defaultBinding.insert(BindingTable::value_type(\"5\", \"radarZoom out\"));\n  defaultBinding.insert(BindingTable::value_type(\"A\", \"toggle slowKeyboard\"));\n  defaultBinding.insert(BindingTable::value_type(\"U\", \"hunt\"));\n  defaultBinding.insert(BindingTable::value_type(\"7\", \"addhunt\"));\n  defaultBinding.insert(BindingTable::value_type(\"Right Mouse\", \"restart\"));\n  defaultBinding.insert(BindingTable::value_type(\"I\", \"restart\"));\n  defaultBinding.insert(BindingTable::value_type(\"9\", \"autopilot\"));\n\n  defaultBinding.insert(BindingTable::value_type(\"Shift+F1\", \"messagepanel all\"));\n  defaultBinding.insert(BindingTable::value_type(\"Shift+F2\", \"messagepanel chat\"));\n  defaultBinding.insert(BindingTable::value_type(\"Shift+F3\", \"messagepanel server\"));\n  defaultBinding.insert(BindingTable::value_type(\"Shift+F4\", \"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\tkeyBind) {\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(BindingTable::value_type(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>whoops, need this too<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2005 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 MERCHANTABILITY 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\"), both));\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(\"viewZoom toggle\"),\n\t\t\t\t\t press));\n  wayToBindActions.insert(std::make_pair(std::string(\"viewZoom in\"), press));\n  wayToBindActions.insert(std::make_pair(std::string(\"viewZoom out\"), 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(\"mousegrab\"), 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(\"toggleRadar\"), press));\n  wayToBindActions.insert(std::make_pair(std::string(\"toggleConsole\"), 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(\"addhunt\"), 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(BindingTable::value_type(\"F12\", \"quit\"));\n  defaultBinding.insert(BindingTable::value_type(\"Left Mouse\", \"fire\"));\n  defaultBinding.insert(BindingTable::value_type(\"Enter\", \"fire\"));\n  defaultBinding.insert(BindingTable::value_type(\"Middle Mouse\", \"drop\"));\n  defaultBinding.insert(BindingTable::value_type(\"Space\", \"drop\"));\n  defaultBinding.insert(BindingTable::value_type(\"Right Mouse\", \"identify\"));\n  defaultBinding.insert(BindingTable::value_type(\"I\", \"identify\"));\n  defaultBinding.insert(BindingTable::value_type(\"Tab\", \"jump\"));\n  defaultBinding.insert(BindingTable::value_type(\"N\", \"send all\"));\n  defaultBinding.insert(BindingTable::value_type(\"M\", \"send team\"));\n  defaultBinding.insert(BindingTable::value_type(\",\", \"send nemesis\"));\n  defaultBinding.insert(BindingTable::value_type(\".\", \"send recipient\"));\n  defaultBinding.insert(BindingTable::value_type(\"Z\", \"send admin\"));\n  defaultBinding.insert(BindingTable::value_type(\"S\", \"toggle displayScore\"));\n  defaultBinding.insert(BindingTable::value_type(\"B\", \"viewZoom toggle\"));\n  defaultBinding.insert(BindingTable::value_type(\"Ctrl+Wheel Up\", \"viewZoom in\"));\n  defaultBinding.insert(BindingTable::value_type(\"Ctrl+Wheel Down\", \"viewZoom out\"));\n  defaultBinding.insert(BindingTable::value_type(\"Pause\", \"pause\"));\n  defaultBinding.insert(BindingTable::value_type(\"P\", \"pause\"));\n  defaultBinding.insert(BindingTable::value_type(\"F1\", \"fullscreen\"));\n  defaultBinding.insert(BindingTable::value_type(\"Q\", \"toggleRadar\"));\n  defaultBinding.insert(BindingTable::value_type(\"W\", \"toggleConsole\"));\n  defaultBinding.insert(BindingTable::value_type(\"F4\", \"iconify\"));\n#ifdef SNAPPING\n  defaultBinding.insert(BindingTable::value_type(\"F5\", \"screenshot\"));\n#endif\n  defaultBinding.insert(BindingTable::value_type(\"-\", \"time backward\"));\n  defaultBinding.insert(BindingTable::value_type(\"=\", \"time forward\"));\n  defaultBinding.insert(BindingTable::value_type(\"H\", \"toggleFlags radar\"));\n  defaultBinding.insert(BindingTable::value_type(\"J\", \"toggleFlags main\"));\n  defaultBinding.insert(BindingTable::value_type(\"K\", \"silence\"));\n  defaultBinding.insert(BindingTable::value_type(\"L\", \"toggle displayLabels\"));\n  defaultBinding.insert(BindingTable::value_type(\"Delete\", \"destruct\"));\n\n  \/\/ Default movement keys\n  defaultBinding.insert(BindingTable::value_type(\"Left Arrow\", \"turn left\"));\n  defaultBinding.insert(BindingTable::value_type(\"Right Arrow\", \"turn right\"));\n  defaultBinding.insert(BindingTable::value_type(\"Up Arrow\", \"drive forward\"));\n  defaultBinding.insert(BindingTable::value_type(\"Down Arrow\", \"drive reverse\"));\n  \/\/ End default movement keys\n\n  defaultBinding.insert(BindingTable::value_type(\"Shift+Wheel Up\", \"radarZoom in\"));\n  defaultBinding.insert(BindingTable::value_type(\"Shift+Wheel Down\", \"radarZoom out\"));\n\n  defaultBinding.insert(BindingTable::value_type(\"F6\", \"roam cycle subject backward\"));\n  defaultBinding.insert(BindingTable::value_type(\"F7\", \"roam cycle subject forward\"));\n  defaultBinding.insert(BindingTable::value_type(\"F8\", \"roam cycle type forward\"));\n  defaultBinding.insert(BindingTable::value_type(\"F9\", \"roam zoom in\"));\n  defaultBinding.insert(BindingTable::value_type(\"F10\", \"roam zoom out\"));\n  defaultBinding.insert(BindingTable::value_type(\"F11\", \"roam zoom normal\"));\n  defaultBinding.insert(BindingTable::value_type(\"O\", \"servercommand\"));\n  defaultBinding.insert(BindingTable::value_type(\"F\", \"toggle displayFlagHelp\"));\n  defaultBinding.insert(BindingTable::value_type(\"Page Up\", \"scrollpanel up\"));\n  defaultBinding.insert(BindingTable::value_type(\"Wheel Up\", \"scrollpanel up\"));\n  defaultBinding.insert(BindingTable::value_type(\"Page Down\", \"scrollpanel down\"));\n  defaultBinding.insert(BindingTable::value_type(\"Wheel Down\", \"scrollpanel down\"));\n  defaultBinding.insert(BindingTable::value_type(\"1\", \"set displayRadarRange 0.25\"));\n  defaultBinding.insert(BindingTable::value_type(\"2\", \"set displayRadarRange 0.5\"));\n  defaultBinding.insert(BindingTable::value_type(\"3\", \"set displayRadarRange 1.0\"));\n  defaultBinding.insert(BindingTable::value_type(\"4\", \"radarZoom in\"));\n  defaultBinding.insert(BindingTable::value_type(\"5\", \"radarZoom out\"));\n  defaultBinding.insert(BindingTable::value_type(\"A\", \"toggle slowKeyboard\"));\n  defaultBinding.insert(BindingTable::value_type(\"U\", \"hunt\"));\n  defaultBinding.insert(BindingTable::value_type(\"7\", \"addhunt\"));\n  defaultBinding.insert(BindingTable::value_type(\"Right Mouse\", \"restart\"));\n  defaultBinding.insert(BindingTable::value_type(\"I\", \"restart\"));\n  defaultBinding.insert(BindingTable::value_type(\"9\", \"autopilot\"));\n\n  defaultBinding.insert(BindingTable::value_type(\"Shift+F1\", \"messagepanel all\"));\n  defaultBinding.insert(BindingTable::value_type(\"Shift+F2\", \"messagepanel chat\"));\n  defaultBinding.insert(BindingTable::value_type(\"Shift+F3\", \"messagepanel server\"));\n  defaultBinding.insert(BindingTable::value_type(\"Shift+F4\", \"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\tkeyBind) {\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(BindingTable::value_type(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>\/*\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\/\/ Class header file...\n#include \"TextFileOutputStream.hpp\"\n\n\n\n#include <sstream>\n\n\n\n#if defined(_MSC_VER)\n#include \"windows.h\"\n#else\n#define INVALID_HANDLE_VALUE 0\n#endif\n\n\n\n#include <util\/Janitor.hpp>\n#include <util\/XMLString.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\nnamespace\n{\n\tconst bool\t\t\tgOnNT = true;\n};\n\n\n\n\nconst TextFileOutputStream::BufferType::size_type\tTextFileOutputStream::s_bufferSize = 8192;\n\n\n\nTextFileOutputStream::TextFileOutputStream(const DOMString&\t\ttheFileName) :\n\tTextOutputStream(),\n\tm_fileName(theFileName),\n#if defined(_MSC_VER)\n\tm_handle(INVALID_HANDLE_VALUE),\n#else\n\tm_handle(0),\n#endif\n\tm_buffer()\n{\n\tm_buffer.reserve(s_bufferSize + 1);\n\n#if defined(_MSC_VER)\n    if (gOnNT)\n    {\n        m_handle = ::CreateFileW(toCharArray(theFileName),\n\t\t\t\t\t\t\t\t GENERIC_WRITE,\n\t\t\t\t\t\t\t\t FILE_SHARE_WRITE,\n\t\t\t\t\t\t\t\t 0,\n\t\t\t\t\t\t\t\t CREATE_ALWAYS,\n\t\t\t\t\t\t\t\t FILE_FLAG_SEQUENTIAL_SCAN,\n\t\t\t\t\t\t\t\t 0);\n    }\n    else\n    {\n        char* const\ttmpName = XMLString::transcode(toCharArray(theFileName));\n\n\t\tArrayJanitor<char> janTmp(tmpName);\n\n        m_handle = ::CreateFileA(tmpName,\n\t\t\t\t\t\t\t\t GENERIC_WRITE,\n\t\t\t\t\t\t\t\t FILE_SHARE_WRITE,\n\t\t\t\t\t\t\t\t 0,\n\t\t\t\t\t\t\t\t CREATE_ALWAYS,\n\t\t\t\t\t\t\t\t FILE_FLAG_SEQUENTIAL_SCAN,\n\t\t\t\t\t\t\t\t 0);\n    }\n\n#else\n\tchar* const\ttmpName = XMLString::transcode(toCharArray(theFileName));\n\n\tArrayJanitor<char> janTmp(tmpName);\n\n\tm_handle = fopen(tmpName, \"wt\");\n#endif\n\n    if (m_handle == INVALID_HANDLE_VALUE)\n\t{\n\t\tthrow TextFileOutputStreamOpenException(theFileName,\n\t\t\t\t\t\t\t\t\t\t\t\terrno);\n\t}\n}\n\n\n\nTextFileOutputStream::~TextFileOutputStream()\n{\n    if (m_handle != INVALID_HANDLE_VALUE)\n\t{\n#if defined(_MSC_VER)\n\t\tCloseHandle(m_handle);\n#else\n\t\tfclose(m_handle);\n#endif\n\t}\n}\n\n\n\nvoid\nTextFileOutputStream::flush()\n{\n\tflushBuffer();\n\n#if defined(_MSC_VER)\n\tFlushFileBuffers(m_handle);\n#else\n\tfflush(m_handle);\n#endif\n}\n\n\n\nvoid\nTextFileOutputStream::write(const XMLCh* const\ttheBuffer)\n{\n\tconst BufferType::size_type\t\ttheLength =\n\t\tstatic_cast<BufferType::size_type>(length(theBuffer));\n\n\tif (theLength + m_buffer.size() > s_bufferSize)\n\t{\n\t\tflushBuffer();\n\t}\n\n\tif (theLength > s_bufferSize)\n\t{\n\t\tdoWrite(theBuffer);\n\t}\n\telse\n\t{\n\t\tm_buffer.insert(m_buffer.end(),\n\t\t\t\t\t\ttheBuffer,\n\t\t\t\t\t\ttheBuffer + theLength);\n\t}\n}\n\n\n\nvoid\nTextFileOutputStream::write(const char* const\ttheBuffer)\n{\n\tflushBuffer();\n\n\tdoWrite(theBuffer,\n\t\t    strlen(theBuffer));\n}\n\n\n\nvoid\nTextFileOutputStream::write(\n\t\t\tconst char*\t\ttheBuffer,\n\t\t\tunsigned long\ttheBufferLength)\n{\n\tflushBuffer();\n\n\tdoWrite(theBuffer,\n\t\t\ttheBufferLength);\n}\n\n\n\nvoid\nTextFileOutputStream::flushBuffer()\n{\n\tif (m_buffer.size() > 0)\n\t{\n\t\tm_buffer.push_back(0);\n\n\t\tdoWrite(m_buffer.begin());\n\n\t\tm_buffer.clear();\n\t}\n}\n\n\n\nvoid\nTextFileOutputStream::doWrite(const XMLCh*\ttheBuffer)\n{\n    char* const\ttmpVal = XMLString::transcode(theBuffer);\n\n    ArrayJanitor<char> janTmp(tmpVal);\n\n\tdoWrite(tmpVal,\n\t\t\tstrlen(tmpVal));\n}\n\n\n\nvoid\nTextFileOutputStream::doWrite(\n\t\t\tconst char*\t\ttheBuffer,\n\t\t\tunsigned long\ttheBufferLength)\n{\n#if defined(_MSC_VER)\n\tDWORD\ttheBytesWritten;\n\n\tWriteFile(m_handle,\n\t\t\t  theBuffer,\n\t\t\t  theBufferLength,\n\t\t\t  &theBytesWritten,\n\t\t\t  0);\n\n#else\n\tconst size_t\ttheBytesWritten =\n\t\tfwrite(theBuffer,\n\t\t\t   1,\n\t\t\t   theBufferLength,\n\t\t\t   m_handle);\n#endif\n\n\tif(theBytesWritten != theBufferLength)\n\t{\n\t\tthrow TextFileOutputStreamWriteException(m_fileName,\n\t\t\t\t\t\t\t\t\t\t\t\t errno);\n\t}\n}\n\n\n\nTextFileOutputStreamException::TextFileOutputStreamException(\n\t\tconst DOMString&\ttheMessage,\n\t\tconst DOMString&\ttheType) :\n\tXercesPlatformSupportException(theMessage,\n\t\t\t\t\t\t\t\ttheType)\n{\n}\n\n\n\nTextFileOutputStreamException::~TextFileOutputStreamException()\n{\n}\n\n\n\nnamespace\n{\n\nconst DOMString\t\ttheOpenExceptionType(\"TextFileOutputStreamOpenException\");\nconst DOMString\t\ttheWriteExceptionType(\"TextFileOutputStreamWriteException\");\n\n\n\nDOMString\nFormatMessageLocal(\n\t\t\tconst DOMString&\ttheMessage,\n\t\t\tconst DOMString&\ttheFileName,\n\t\t\tint\t\t\t\t\ttheErrorCode)\n{\n\tDOMString\ttheResult(clone(theMessage));\n\n\ttheResult += theFileName;\n\n\tstd::stringstream\ttheFormatter;\n\n\ttheFormatter << \".  The error code was \"\n\t\t\t\t << theErrorCode\n\t\t\t\t << \".\";\n\n\ttheResult += theFormatter.str().c_str();\n\n\treturn theResult;\n}\n\n};\n\n\n\n\n\nTextFileOutputStreamOpenException::TextFileOutputStreamOpenException(\n\t\tconst DOMString&\ttheFileName,\n\t\tint\t\t\t\t\ttheErrorCode) :\n\tTextFileOutputStreamException(FormatMessageLocal(\"Error opening file: \",\n\t\t\t\t\t\t\t\t\t\t\t\t\t theFileName,\n\t\t\t\t\t\t\t\t\t\t\t\t\t theErrorCode),\n\t\t\t\t\t\t\t\t  theOpenExceptionType)\n{\n}\n\n\n\nTextFileOutputStreamOpenException::~TextFileOutputStreamOpenException()\n{\n}\n\n\n\n\n\nTextFileOutputStreamWriteException::TextFileOutputStreamWriteException(\n\t\tconst DOMString&\ttheFileName,\n\t\tint\t\t\t\t\ttheErrorCode) :\n\tTextFileOutputStreamException(FormatMessageLocal(\"Error writing file: \",\n\t\t\t\t\t\t\t\t\t\t\t\t\t theFileName,\n\t\t\t\t\t\t\t\t\t\t\t\t\t theErrorCode),\n\t\t\t\t\t\t\t\t  theWriteExceptionType)\n{\n}\n\n\n\nTextFileOutputStreamWriteException::~TextFileOutputStreamWriteException()\n{\n}\n\n\n\n<commit_msg>Add runtime check of Win32 platform so we can fallback correctly on Win95\/98 where wide-character paths are not supported.<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\/\/ Class header file...\n#include \"TextFileOutputStream.hpp\"\n\n\n\n#include <sstream>\n\n\n\n#if defined(_MSC_VER)\n#include \"windows.h\"\n#else\n#define INVALID_HANDLE_VALUE 0\n#endif\n\n\n\n#include <util\/Janitor.hpp>\n#include <util\/XMLString.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n\n\nconst TextFileOutputStream::BufferType::size_type\tTextFileOutputStream::s_bufferSize = 8192;\n\n\n\nTextFileOutputStream::TextFileOutputStream(const DOMString&\t\ttheFileName) :\n\tTextOutputStream(),\n\tm_fileName(theFileName),\n#if defined(_MSC_VER)\n\tm_handle(INVALID_HANDLE_VALUE),\n#else\n\tm_handle(0),\n#endif\n\tm_buffer()\n{\n\tm_buffer.reserve(s_bufferSize + 1);\n\n#if defined(_MSC_VER)\n\n\t\/\/ check the version.  Only NT allows  \n\t\/\/ wide character file paths\n\tOSVERSIONINFO verInfo;\n\tverInfo.dwOSVersionInfoSize=sizeof(verInfo);\n\t::GetVersionEx(&verInfo);\n\n    if (verInfo.dwPlatformId == VER_PLATFORM_WIN32_NT)\n    {\n        m_handle = ::CreateFileW(toCharArray(theFileName),\n\t\t\t\t\t\t\t\t GENERIC_WRITE,\n\t\t\t\t\t\t\t\t FILE_SHARE_WRITE,\n\t\t\t\t\t\t\t\t 0,\n\t\t\t\t\t\t\t\t CREATE_ALWAYS,\n\t\t\t\t\t\t\t\t FILE_FLAG_SEQUENTIAL_SCAN,\n\t\t\t\t\t\t\t\t 0);\n    }\n    else\n    {\n        char* const\ttmpName = XMLString::transcode(toCharArray(theFileName));\n\n\t\tArrayJanitor<char> janTmp(tmpName);\n\n        m_handle = ::CreateFileA(tmpName,\n\t\t\t\t\t\t\t\t GENERIC_WRITE,\n\t\t\t\t\t\t\t\t FILE_SHARE_WRITE,\n\t\t\t\t\t\t\t\t 0,\n\t\t\t\t\t\t\t\t CREATE_ALWAYS,\n\t\t\t\t\t\t\t\t FILE_FLAG_SEQUENTIAL_SCAN,\n\t\t\t\t\t\t\t\t 0);\n    }\n\n#else\n\tchar* const\ttmpName = XMLString::transcode(toCharArray(theFileName));\n\n\tArrayJanitor<char> janTmp(tmpName);\n\n\tm_handle = fopen(tmpName, \"wt\");\n#endif\n\n    if (m_handle == INVALID_HANDLE_VALUE)\n\t{\n\t\tthrow TextFileOutputStreamOpenException(theFileName,\n\t\t\t\t\t\t\t\t\t\t\t\terrno);\n\t}\n}\n\n\n\nTextFileOutputStream::~TextFileOutputStream()\n{\n    if (m_handle != INVALID_HANDLE_VALUE)\n\t{\n#if defined(_MSC_VER)\n\t\tCloseHandle(m_handle);\n#else\n\t\tfclose(m_handle);\n#endif\n\t}\n}\n\n\n\nvoid\nTextFileOutputStream::flush()\n{\n\tflushBuffer();\n\n#if defined(_MSC_VER)\n\tFlushFileBuffers(m_handle);\n#else\n\tfflush(m_handle);\n#endif\n}\n\n\n\nvoid\nTextFileOutputStream::write(const XMLCh* const\ttheBuffer)\n{\n\tconst BufferType::size_type\t\ttheLength =\n\t\tstatic_cast<BufferType::size_type>(length(theBuffer));\n\n\tif (theLength + m_buffer.size() > s_bufferSize)\n\t{\n\t\tflushBuffer();\n\t}\n\n\tif (theLength > s_bufferSize)\n\t{\n\t\tdoWrite(theBuffer);\n\t}\n\telse\n\t{\n\t\tm_buffer.insert(m_buffer.end(),\n\t\t\t\t\t\ttheBuffer,\n\t\t\t\t\t\ttheBuffer + theLength);\n\t}\n}\n\n\n\nvoid\nTextFileOutputStream::write(const char* const\ttheBuffer)\n{\n\tflushBuffer();\n\n\tdoWrite(theBuffer,\n\t\t    strlen(theBuffer));\n}\n\n\n\nvoid\nTextFileOutputStream::write(\n\t\t\tconst char*\t\ttheBuffer,\n\t\t\tunsigned long\ttheBufferLength)\n{\n\tflushBuffer();\n\n\tdoWrite(theBuffer,\n\t\t\ttheBufferLength);\n}\n\n\n\nvoid\nTextFileOutputStream::flushBuffer()\n{\n\tif (m_buffer.size() > 0)\n\t{\n\t\tm_buffer.push_back(0);\n\n\t\tdoWrite(m_buffer.begin());\n\n\t\tm_buffer.clear();\n\t}\n}\n\n\n\nvoid\nTextFileOutputStream::doWrite(const XMLCh*\ttheBuffer)\n{\n    char* const\ttmpVal = XMLString::transcode(theBuffer);\n\n    ArrayJanitor<char> janTmp(tmpVal);\n\n\tdoWrite(tmpVal,\n\t\t\tstrlen(tmpVal));\n}\n\n\n\nvoid\nTextFileOutputStream::doWrite(\n\t\t\tconst char*\t\ttheBuffer,\n\t\t\tunsigned long\ttheBufferLength)\n{\n#if defined(_MSC_VER)\n\tDWORD\ttheBytesWritten;\n\n\tWriteFile(m_handle,\n\t\t\t  theBuffer,\n\t\t\t  theBufferLength,\n\t\t\t  &theBytesWritten,\n\t\t\t  0);\n\n#else\n\tconst size_t\ttheBytesWritten =\n\t\tfwrite(theBuffer,\n\t\t\t   1,\n\t\t\t   theBufferLength,\n\t\t\t   m_handle);\n#endif\n\n\tif(theBytesWritten != theBufferLength)\n\t{\n\t\tthrow TextFileOutputStreamWriteException(m_fileName,\n\t\t\t\t\t\t\t\t\t\t\t\t errno);\n\t}\n}\n\n\n\nTextFileOutputStreamException::TextFileOutputStreamException(\n\t\tconst DOMString&\ttheMessage,\n\t\tconst DOMString&\ttheType) :\n\tXercesPlatformSupportException(theMessage,\n\t\t\t\t\t\t\t\ttheType)\n{\n}\n\n\n\nTextFileOutputStreamException::~TextFileOutputStreamException()\n{\n}\n\n\n\nnamespace\n{\n\nconst DOMString\t\ttheOpenExceptionType(\"TextFileOutputStreamOpenException\");\nconst DOMString\t\ttheWriteExceptionType(\"TextFileOutputStreamWriteException\");\n\n\n\nDOMString\nFormatMessageLocal(\n\t\t\tconst DOMString&\ttheMessage,\n\t\t\tconst DOMString&\ttheFileName,\n\t\t\tint\t\t\t\t\ttheErrorCode)\n{\n\tDOMString\ttheResult(clone(theMessage));\n\n\ttheResult += theFileName;\n\n\tstd::stringstream\ttheFormatter;\n\n\ttheFormatter << \".  The error code was \"\n\t\t\t\t << theErrorCode\n\t\t\t\t << \".\";\n\n\ttheResult += theFormatter.str().c_str();\n\n\treturn theResult;\n}\n\n};\n\n\n\n\n\nTextFileOutputStreamOpenException::TextFileOutputStreamOpenException(\n\t\tconst DOMString&\ttheFileName,\n\t\tint\t\t\t\t\ttheErrorCode) :\n\tTextFileOutputStreamException(FormatMessageLocal(\"Error opening file: \",\n\t\t\t\t\t\t\t\t\t\t\t\t\t theFileName,\n\t\t\t\t\t\t\t\t\t\t\t\t\t theErrorCode),\n\t\t\t\t\t\t\t\t  theOpenExceptionType)\n{\n}\n\n\n\nTextFileOutputStreamOpenException::~TextFileOutputStreamOpenException()\n{\n}\n\n\n\n\n\nTextFileOutputStreamWriteException::TextFileOutputStreamWriteException(\n\t\tconst DOMString&\ttheFileName,\n\t\tint\t\t\t\t\ttheErrorCode) :\n\tTextFileOutputStreamException(FormatMessageLocal(\"Error writing file: \",\n\t\t\t\t\t\t\t\t\t\t\t\t\t theFileName,\n\t\t\t\t\t\t\t\t\t\t\t\t\t theErrorCode),\n\t\t\t\t\t\t\t\t  theWriteExceptionType)\n{\n}\n\n\n\nTextFileOutputStreamWriteException::~TextFileOutputStreamWriteException()\n{\n}\n\n\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\/\/ Class header file.\n#include \"XercesDOMPrintWriter.hpp\"\n\n\n\n#include <cassert>\n\n\n\n#include <XalanDOM\/XalanDOMString.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/TextOutputStream.hpp>\n\n\n\nXercesDOMPrintWriter::XercesDOMPrintWriter(\n\t\t\tTextOutputStream&\ttheOutputStream,\n\t\t\tbool\t\t\t\tfAutoFlush) :\n\tPrintWriter(fAutoFlush),\n\tm_OutputStream(theOutputStream)\n{\n}\n\n\n\nXercesDOMPrintWriter::~XercesDOMPrintWriter()\n{\n\tflush();\n}\n\n\n\nbool\nXercesDOMPrintWriter::checkError() const\n{\n\treturn false;\n}\n\n\n\nvoid\nXercesDOMPrintWriter::close()\n{\n}\n\n\nvoid\nXercesDOMPrintWriter::flush()\n{\n\tm_OutputStream.flush();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::write(\n\t\t\tconst char*\t\ts,\n\t\t\tunsigned int\ttheOffset,\n\t\t\tunsigned int\ttheLength)\n{\n\twrite(DOMString(s), theOffset, theLength);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::write(\n\t\t\tconst XMLCh*\ts,\n\t\t\tunsigned int\ttheOffset,\n\t\t\tunsigned int\ttheLength)\n{\n\tassert(s != 0);\n\tassert(length(s) == 0 || theOffset < length(s));\n\n\tif (theLength == -1)\n\t{\n\t\tif (theOffset == 0)\n\t\t{\n\t\t\tm_OutputStream.write(s);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_OutputStream.write(s + theOffset);\n\t\t}\n\t}\n\telse\n\t{\n\t\tconst long\ttheStopIndex = theOffset + theLength;\n\n\t\tfor (long i = theOffset; i < theStopIndex; i++)\n\t\t{\n\t\t\tm_OutputStream.write(s[i]);\n\t\t}\n\t}\n}\n\n\n\nvoid\nXercesDOMPrintWriter::write(XMLCh\tc)\n{\n\tm_OutputStream.write(c);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::write(\n\t\t\tconst DOMString&\ts,\n\t\t\tunsigned int\t\ttheOffset,\n\t\t\tunsigned int\t\ttheLength)\n{\n\twrite(c_wstr(s), theOffset, theLength);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(bool\tb)\n{\n\tif (b == true)\n\t{\n\t\tprint(XALAN_STATIC_UCODE_STRING(\"true\"));\n\t}\n\telse\n\t{\n\t\tprint(XALAN_STATIC_UCODE_STRING(\"false\"));\n\t}\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(char\tc)\n{\n\twrite(c);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(\n\t\t\tconst char*\t\ts,\n\t\t\tunsigned int\ttheLength)\n{\n\twrite(s,\n\t\t  0,\n\t\t  theLength);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(\n\t\t\tconst XMLCh*\ts,\n\t\t\tunsigned int\ttheLength)\n{\n\tassert(s != 0);\n\tassert(theLength >= 0 || theLength == -1);\n\n\twrite(s,\n\t\t  0,\n\t\t  theLength);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(double\td)\n{\n\tm_OutputStream.write(c_wstr(DoubleToDOMString(d)));\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(int\ti)\n{\n\tm_OutputStream.write(c_wstr(LongToDOMString(i)));\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(long\tl)\n{\n\tm_OutputStream.write(c_wstr(LongToDOMString(l)));\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(const DOMString&\ts)\n{\n\tm_OutputStream.write(c_wstr(s));\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println()\n{\n\tm_OutputStream.write(c_wstr(XALAN_STATIC_UCODE_STRING(\"\\n\")));\n\n\tflush();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(bool\tb)\n{\n\tprint(b);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(char\tc)\n{\n\tprint(c);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(\n\t\t\tconst char*\t\ts,\n\t\t\tunsigned int\ttheLength)\n{\n\tprint(s, theLength);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(\n\t\t\tconst XMLCh*\ts,\n\t\t\tunsigned int\ttheLength)\n{\n\tprint(s, theLength);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(double\td)\n{\n\tprint(d);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(int\t\ti)\n{\n\tprint(i);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(long\tl)\n{\n\tprint(l);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(const DOMString&\ts)\n{\n\tprint(s);\n\n\tprintln();\n}\n<commit_msg>Call flush() in close().<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\/\/ Class header file.\n#include \"XercesDOMPrintWriter.hpp\"\n\n\n\n#include <cassert>\n\n\n\n#include <XalanDOM\/XalanDOMString.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/TextOutputStream.hpp>\n\n\n\nXercesDOMPrintWriter::XercesDOMPrintWriter(\n\t\t\tTextOutputStream&\ttheOutputStream,\n\t\t\tbool\t\t\t\tfAutoFlush) :\n\tPrintWriter(fAutoFlush),\n\tm_OutputStream(theOutputStream)\n{\n}\n\n\n\nXercesDOMPrintWriter::~XercesDOMPrintWriter()\n{\n\tflush();\n}\n\n\n\nbool\nXercesDOMPrintWriter::checkError() const\n{\n\treturn false;\n}\n\n\n\nvoid\nXercesDOMPrintWriter::close()\n{\n\tflush();\n}\n\n\nvoid\nXercesDOMPrintWriter::flush()\n{\n\tm_OutputStream.flush();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::write(\n\t\t\tconst char*\t\ts,\n\t\t\tunsigned int\ttheOffset,\n\t\t\tunsigned int\ttheLength)\n{\n\twrite(DOMString(s), theOffset, theLength);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::write(\n\t\t\tconst XMLCh*\ts,\n\t\t\tunsigned int\ttheOffset,\n\t\t\tunsigned int\ttheLength)\n{\n\tassert(s != 0);\n\tassert(length(s) == 0 || theOffset < length(s));\n\n\tif (theLength == -1)\n\t{\n\t\tif (theOffset == 0)\n\t\t{\n\t\t\tm_OutputStream.write(s);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_OutputStream.write(s + theOffset);\n\t\t}\n\t}\n\telse\n\t{\n\t\tconst long\ttheStopIndex = theOffset + theLength;\n\n\t\tfor (long i = theOffset; i < theStopIndex; i++)\n\t\t{\n\t\t\tm_OutputStream.write(s[i]);\n\t\t}\n\t}\n}\n\n\n\nvoid\nXercesDOMPrintWriter::write(XMLCh\tc)\n{\n\tm_OutputStream.write(c);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::write(\n\t\t\tconst DOMString&\ts,\n\t\t\tunsigned int\t\ttheOffset,\n\t\t\tunsigned int\t\ttheLength)\n{\n\twrite(c_wstr(s), theOffset, theLength);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(bool\tb)\n{\n\tif (b == true)\n\t{\n\t\tprint(XALAN_STATIC_UCODE_STRING(\"true\"));\n\t}\n\telse\n\t{\n\t\tprint(XALAN_STATIC_UCODE_STRING(\"false\"));\n\t}\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(char\tc)\n{\n\twrite(c);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(\n\t\t\tconst char*\t\ts,\n\t\t\tunsigned int\ttheLength)\n{\n\twrite(s,\n\t\t  0,\n\t\t  theLength);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(\n\t\t\tconst XMLCh*\ts,\n\t\t\tunsigned int\ttheLength)\n{\n\tassert(s != 0);\n\tassert(theLength >= 0 || theLength == -1);\n\n\twrite(s,\n\t\t  0,\n\t\t  theLength);\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(double\td)\n{\n\tm_OutputStream.write(c_wstr(DoubleToDOMString(d)));\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(int\ti)\n{\n\tm_OutputStream.write(c_wstr(LongToDOMString(i)));\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(long\tl)\n{\n\tm_OutputStream.write(c_wstr(LongToDOMString(l)));\n}\n\n\n\nvoid\nXercesDOMPrintWriter::print(const DOMString&\ts)\n{\n\tm_OutputStream.write(c_wstr(s));\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println()\n{\n\tm_OutputStream.write(c_wstr(XALAN_STATIC_UCODE_STRING(\"\\n\")));\n\n\tflush();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(bool\tb)\n{\n\tprint(b);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(char\tc)\n{\n\tprint(c);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(\n\t\t\tconst char*\t\ts,\n\t\t\tunsigned int\ttheLength)\n{\n\tprint(s, theLength);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(\n\t\t\tconst XMLCh*\ts,\n\t\t\tunsigned int\ttheLength)\n{\n\tprint(s, theLength);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(double\td)\n{\n\tprint(d);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(int\t\ti)\n{\n\tprint(i);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(long\tl)\n{\n\tprint(l);\n\n\tprintln();\n}\n\n\n\nvoid\nXercesDOMPrintWriter::println(const DOMString&\ts)\n{\n\tprint(s);\n\n\tprintln();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.osgeo.org\n *\n * Copyright (C) 2001-2002 Vivid Solutions Inc.\n * Copyright (C) 2018 Daniel Baston <dbaston@gmail.com>\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\n#include <geos\/algorithm\/locate\/IndexedPointInAreaLocator.h>\n#include <geos\/geom\/Geometry.h>\n#include <geos\/geom\/Polygon.h>\n#include <geos\/geom\/MultiPolygon.h>\n#include <geos\/geom\/LineString.h>\n#include <geos\/geom\/LineSegment.h>\n#include <geos\/geom\/LinearRing.h>\n#include <geos\/geom\/CoordinateSequence.h>\n#include <geos\/geom\/util\/LinearComponentExtracter.h>\n#include <geos\/index\/intervalrtree\/SortedPackedIntervalRTree.h>\n#include <geos\/util.h>\n#include <geos\/algorithm\/RayCrossingCounter.h>\n#include <geos\/index\/ItemVisitor.h>\n\n#include <algorithm>\n#include <typeinfo>\n\nnamespace geos {\nnamespace algorithm {\nnamespace locate {\n\/\/\n\/\/ private:\n\/\/\nIndexedPointInAreaLocator::IntervalIndexedGeometry::IntervalIndexedGeometry(const geom::Geometry& g)\n    : isEmpty(0)\n{\n    if (g.isEmpty())\n        isEmpty = true;\n    else\n        init(g);\n}\n\nvoid\nIndexedPointInAreaLocator::IntervalIndexedGeometry::init(const geom::Geometry& g)\n{\n    geom::LineString::ConstVect lines;\n    geom::util::LinearComponentExtracter::getLines(g, lines);\n\n    \/\/ pre-compute size of segment vector\n    size_t nsegs = 0;\n    for(const geom::LineString* line : lines) {\n        nsegs += line->getCoordinatesRO()->size() - 1;\n    }\n    segments.reserve(nsegs);\n\n    for(const geom::LineString* line : lines) {\n        addLine(line->getCoordinatesRO());\n    }\n\n    index = index::intervalrtree::SortedPackedIntervalRTree(segments.size());\n\n    for(geom::LineSegment& seg : segments) {\n        index.insert(\n            std::min(seg.p0.y, seg.p1.y),\n            std::max(seg.p0.y, seg.p1.y),\n            &seg);\n    }\n}\n\nvoid\nIndexedPointInAreaLocator::IntervalIndexedGeometry::addLine(const geom::CoordinateSequence* pts)\n{\n    for(size_t i = 1, ni = pts->size(); i < ni; i++) {\n        segments.emplace_back((*pts)[i - 1], (*pts)[i]);\n    }\n}\n\n\nvoid\nIndexedPointInAreaLocator::buildIndex(const geom::Geometry& g)\n{\n    index = detail::make_unique<IntervalIndexedGeometry>(g);\n}\n\n\n\/\/\n\/\/ protected:\n\/\/\n\n\/\/\n\/\/ public:\n\/\/\nIndexedPointInAreaLocator::IndexedPointInAreaLocator(const geom::Geometry& g)\n    :\tareaGeom(g)\n{\n    const std::type_info& areaGeomId = typeid(areaGeom);\n    if(areaGeomId != typeid(geom::Polygon)\n            &&\tareaGeomId != typeid(geom::MultiPolygon)\n            &&\tareaGeomId != typeid(geom::LinearRing)) {\n        throw util::IllegalArgumentException(\"Argument must be Polygonal or LinearRing\");\n    }\n\n    buildIndex(areaGeom);\n}\n\ngeom::Location\nIndexedPointInAreaLocator::locate(const geom::Coordinate* \/*const*\/ p)\n{\n    algorithm::RayCrossingCounter rcc(*p);\n\n    IndexedPointInAreaLocator::SegmentVisitor visitor(&rcc);\n\n    index->query(p->y, p->y, &visitor);\n\n    return rcc.getLocation();\n}\n\nvoid\nIndexedPointInAreaLocator::SegmentVisitor::visitItem(void* item)\n{\n    geom::LineSegment* seg = static_cast<geom::LineSegment*>(item);\n\n    counter->countSegment(seg->p0, seg->p1);\n}\n\nvoid\nIndexedPointInAreaLocator::IntervalIndexedGeometry::query(double min, double max, index::ItemVisitor* visitor)\n{\n    if (isEmpty)\n        return;\n    index.query(min, max, visitor);\n}\n\n\n} \/\/ geos::algorithm::locate\n} \/\/ geos::algorithm\n} \/\/ geos\n<commit_msg>Lazily build index in IndexedPointInAreaLocator<commit_after>\/**********************************************************************\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.osgeo.org\n *\n * Copyright (C) 2001-2002 Vivid Solutions Inc.\n * Copyright (C) 2018 Daniel Baston <dbaston@gmail.com>\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\n#include <geos\/algorithm\/locate\/IndexedPointInAreaLocator.h>\n#include <geos\/geom\/Geometry.h>\n#include <geos\/geom\/Polygon.h>\n#include <geos\/geom\/MultiPolygon.h>\n#include <geos\/geom\/LineString.h>\n#include <geos\/geom\/LineSegment.h>\n#include <geos\/geom\/LinearRing.h>\n#include <geos\/geom\/CoordinateSequence.h>\n#include <geos\/geom\/util\/LinearComponentExtracter.h>\n#include <geos\/index\/intervalrtree\/SortedPackedIntervalRTree.h>\n#include <geos\/util.h>\n#include <geos\/algorithm\/RayCrossingCounter.h>\n#include <geos\/index\/ItemVisitor.h>\n\n#include <algorithm>\n#include <typeinfo>\n\nnamespace geos {\nnamespace algorithm {\nnamespace locate {\n\/\/\n\/\/ private:\n\/\/\nIndexedPointInAreaLocator::IntervalIndexedGeometry::IntervalIndexedGeometry(const geom::Geometry& g)\n    : isEmpty(0)\n{\n    if (g.isEmpty())\n        isEmpty = true;\n    else\n        init(g);\n}\n\nvoid\nIndexedPointInAreaLocator::IntervalIndexedGeometry::init(const geom::Geometry& g)\n{\n    geom::LineString::ConstVect lines;\n    geom::util::LinearComponentExtracter::getLines(g, lines);\n\n    \/\/ pre-compute size of segment vector\n    size_t nsegs = 0;\n    for(const geom::LineString* line : lines) {\n        nsegs += line->getCoordinatesRO()->size() - 1;\n    }\n    segments.reserve(nsegs);\n\n    for(const geom::LineString* line : lines) {\n        addLine(line->getCoordinatesRO());\n    }\n\n    index = index::intervalrtree::SortedPackedIntervalRTree(segments.size());\n\n    for(geom::LineSegment& seg : segments) {\n        index.insert(\n            std::min(seg.p0.y, seg.p1.y),\n            std::max(seg.p0.y, seg.p1.y),\n            &seg);\n    }\n}\n\nvoid\nIndexedPointInAreaLocator::IntervalIndexedGeometry::addLine(const geom::CoordinateSequence* pts)\n{\n    for(size_t i = 1, ni = pts->size(); i < ni; i++) {\n        segments.emplace_back((*pts)[i - 1], (*pts)[i]);\n    }\n}\n\n\nvoid\nIndexedPointInAreaLocator::buildIndex(const geom::Geometry& g)\n{\n    index = detail::make_unique<IntervalIndexedGeometry>(g);\n}\n\n\n\/\/\n\/\/ protected:\n\/\/\n\n\/\/\n\/\/ public:\n\/\/\nIndexedPointInAreaLocator::IndexedPointInAreaLocator(const geom::Geometry& g)\n    :\tareaGeom(g)\n{\n    const std::type_info& areaGeomId = typeid(areaGeom);\n    if(areaGeomId != typeid(geom::Polygon)\n            &&\tareaGeomId != typeid(geom::MultiPolygon)\n            &&\tareaGeomId != typeid(geom::LinearRing)) {\n        throw util::IllegalArgumentException(\"Argument must be Polygonal or LinearRing\");\n    }\n}\n\ngeom::Location\nIndexedPointInAreaLocator::locate(const geom::Coordinate* \/*const*\/ p)\n{\n    if (index == nullptr) {\n        buildIndex(areaGeom);\n    }\n\n    algorithm::RayCrossingCounter rcc(*p);\n\n    IndexedPointInAreaLocator::SegmentVisitor visitor(&rcc);\n\n    index->query(p->y, p->y, &visitor);\n\n    return rcc.getLocation();\n}\n\nvoid\nIndexedPointInAreaLocator::SegmentVisitor::visitItem(void* item)\n{\n    geom::LineSegment* seg = static_cast<geom::LineSegment*>(item);\n\n    counter->countSegment(seg->p0, seg->p1);\n}\n\nvoid\nIndexedPointInAreaLocator::IntervalIndexedGeometry::query(double min, double max, index::ItemVisitor* visitor)\n{\n    if (isEmpty)\n        return;\n    index.query(min, max, visitor);\n}\n\n\n} \/\/ geos::algorithm::locate\n} \/\/ geos::algorithm\n} \/\/ geos\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  rbtree.cpp\n\/\/  rbtree\n\/\/\n\/\/  Created by Sunil on 3\/22\/17.\n\/\/  Copyright © 2017 Sunil. All rights reserved.\n\/\/\n\n#include \"rbtree.hpp\"\n\n#include <tuple>\n#include <stack>\n#include <list>\n#include <iostream>\n\nusing namespace std;\n\nrbnode* rbtree::search(rbnode node, int key) {\n    return nullptr;\n}\n\nrbtree::rbtree() {\n    \n}\n\nrbtree::~rbtree() {\n    \n}\n\nvoid rbtree::insert(int key) {\n    \n}\n\nvoid rbtree::remove(int key) {\n    \n}\n\nbool rbtree::has_only_red_black_nodes(rbnode* node) {\n    if (!node) {\n        \/\/ no nodes, no color.\n        return false;\n    }\n    \n    \/\/ use any tree traversal and check the color\n    \n    \/\/ everynode has to be red or black.\n    if (!node->is_red_node() && !node->is_black_node()) {\n        \/\/ this node is neither red nor black. It's a invalid rb tree.\n        return false;\n    }\n    \n    \/\/ node has red\/black color but doesn't have left or right subtree.\n    if (!node->left && !node->right) {\n        return true;\n    }\n    \n    \/\/ only right subtree is available.\n    if (!node->left && node->right) {\n        return has_only_red_black_nodes(node->right);\n    }\n    \n    \/\/ only left subtree is available.\n    if (!node->right && node->left) {\n        return has_only_red_black_nodes(node->left);\n    }\n    \n    \/\/ Both left \"and\" right subtree should have only red\/black nodes.\n    return (\n        has_only_red_black_nodes(node->left) && has_only_red_black_nodes(node->right)\n            );\n}\n\nbool rbtree::rednode_has_black_children(rbnode* parent) {\n    if (!parent) {\n        \/\/ no node, no children. Nothing to check\n        return false;\n    }\n    \n    \/\/ if node is red, then check it's children\n    if (parent->is_red_node()) {\n        \n        \/\/ if left and right children are null treat them as black.\n        if (!parent->left && !parent->right) {\n            return true;\n        }\n        \n        \/\/ both left and right are available.\n        if ((parent->left && parent->left->is_red_node())\n            || (parent->right && parent->right->is_red_node())) {\n            return false;\n        }\n        \n        \/\/ left child is not null. make sure its color is black\n        if (parent->left && parent->left->is_red_node()) {\n            \/\/ left child is not black.\n            return false;\n        }\n        \n        \/\/ right child is not null. make sure its color is black\n        if (parent->right && parent->right->is_red_node()) {\n            \/\/ right child is not black.\n            return false;\n        }\n    }\n    \n    \n    \/\/ only right subtree is available.\n    if (!parent->left && parent->right) {\n        return has_only_red_black_nodes(parent->right);\n    }\n    \n    \/\/ only left subtree is available.\n    if (!parent->right && parent->left) {\n        return has_only_red_black_nodes(parent->left);\n    }\n    \n    \/\/ Both left \"and\" right subtree\n    return (\n            has_only_red_black_nodes(parent->left) && has_only_red_black_nodes(parent->right)\n            );\n}\n\nbool rbtree::has_equal_black_nodes_all_path(rbnode* parent) {\n    \/\/ do a depth first search traversal and count the black nodes\n    \/\/ along all path from root to leaf node.\n    if (!parent) {\n        \/\/ no nodes. return true or false ?\n        return true;\n    }\n    \/\/ stack of tuple of (node, count of black nodes) pair.\n    stack<tuple<rbnode*, int>> stk;\n    list<int> paths;\n    \n    \/\/ count black nodes initially as 1 because root is black.\n    stk.push(make_tuple(parent, 1));\n    \n    while (!stk.empty()) {\n        auto pair = stk.top();\n        stk.pop();\n        \n        auto node = std::get<0>(pair);\n        auto count = std::get<1>(pair);\n        \n        if (node->left) {\n            auto left = node->left;\n            stk.push(make_tuple(left, count + (left->is_black_node() ? 1 : 0)));\n        } else {\n            \/\/ left child is null. count it as a black node.\n            paths.push_front(count + 1);\n        }\n        \n        if (node->right) {\n            auto right = node->right;\n            stk.push(make_tuple(right, count + (right->is_black_node() ? 1 : 0)));\n        } else {\n            \/\/ right child is null. count it as a black node.\n            paths.push_front(count + 1);\n        }\n    }\n    \n    \/\/ now check if black node count on all paths are same.\n    auto first = paths.front();\n    \n#if DEBUG\n    for (auto count : paths) cout << count << \"|\";\n    cout << endl;\n#endif\n    \n    for (auto count : paths) {\n        if (count != first)\n            return false;\n    }\n    \n    \n    return true;\n}\n\nbool rbtree::is_valid_rbtree() {\n    \/\/ rb tree properties:\n    \/\/  P.1: every node is red\/black.\n    \/\/  P.2: root is always black.\n    \/\/  P.3: leaf nodes are black.\n    \/\/  P.4: red node should have only black children.\n    \/\/  P.5: for any node x, # of black nodes along all\n    \/\/       paths from x to leaf nodes should be the same.\n    \n    if (!root) {\n        \/\/ no nodes in the tree, is a valid RB tree\n        return true;\n    }\n    \n    \/\/ P.1: check if all nodes are red\/ black.\n    if (!has_only_red_black_nodes(root)) {\n        \/\/ some nodes are of different color. It's not a red black tree\n        return false;\n    }\n    \n    \/\/ P.2: If root is not black then it's invalid.\n    if (root->color != rbcolor::black)\n        return false;\n    \n    \/\/ P.3: I take all null nodes to be black.\n    \/\/ I treat all null nodes as black. So I don't have to\n    \/\/ check for black null nodes.\n    \n    \/\/ P.4: all red nodes should have black children.\n    if (!rednode_has_black_children(root)) {\n        \/\/ some\/all of red nodes doesn't have a black children\n        return false;\n    }\n    \n    \/\/ P.5:  check #black nodes along all possible path from root\n    \/\/  to leaf nodes.\n    if (!has_equal_black_nodes_all_path(root)) {\n        \/\/ unequal number of black nodes.\n        return false;\n    }\n    \n    return true;\n}\n\nrbnode* rbtree::search(int key) {\n    return nullptr;\n}\n\nvoid rbtree::prune(int min, int max) {\n    throw new runtime_error(\"not implemented\");\n}\n\nvoid rbtree::bfs() {\n    throw new runtime_error(\"not implemented\");\n}\n\nvoid rbtree::dfs() {\n    throw new runtime_error(\"not implemented\");\n}\n<commit_msg>Update rbtree.cpp<commit_after>\/\/\n\/\/  rbtree.cpp\n\/\/  rbtree\n\/\/\n\/\/  Created by Sunil on 3\/22\/17.\n\/\/  Copyright © 2017 Sunil. All rights reserved.\n\/\/\n\n#include \"rbtree.hpp\"\n\n#include <tuple>\n#include <stack>\n#include <list>\n#include <iostream>\n\nusing namespace std;\n\nrbnode* rbtree::search(rbnode node, int key) {\n    return nullptr;\n}\n\nrbtree::rbtree() {\n    \n}\n\nrbtree::~rbtree() {\n    \n}\n\nbool rbtree::violates(bool contraint) {\n    \/\/ just negate the contraint and return\n    return !contraint;\n}\n\nvoid rbtree::insert(int key) {\n    \n}\n\nvoid rbtree::remove(int key) {\n    \n}\n\nbool rbtree::has_only_red_black_nodes(rbnode* node) {\n    if (!node) {\n        \/\/ no nodes, no color.\n        return false;\n    }\n    \n    \/\/ use any tree traversal and check the color\n    \n    \/\/ everynode has to be red or black.\n    if (!node->is_red_node() && !node->is_black_node()) {\n        \/\/ this node is neither red nor black. It's a invalid rb tree.\n        return false;\n    }\n    \n    \/\/ node has red\/black color but doesn't have left or right subtree.\n    if (!node->left && !node->right) {\n        return true;\n    }\n    \n    \/\/ only right subtree is available.\n    if (!node->left && node->right) {\n        return has_only_red_black_nodes(node->right);\n    }\n    \n    \/\/ only left subtree is available.\n    if (!node->right && node->left) {\n        return has_only_red_black_nodes(node->left);\n    }\n    \n    \/\/ Both left \"and\" right subtree should have only red\/black nodes.\n    return (\n        has_only_red_black_nodes(node->left) && has_only_red_black_nodes(node->right)\n            );\n}\n\nbool rbtree::rednode_has_black_children(rbnode* parent) {\n    if (!parent) {\n        \/\/ no node, no children. Nothing to check\n        return false;\n    }\n    \n    \/\/ if node is red, then check it's children\n    if (parent->is_red_node()) {\n        \n        \/\/ if left and right children are null treat them as black.\n        if (!parent->left && !parent->right) {\n            return true;\n        }\n        \n        \/\/ both left and right are available.\n        if ((parent->left && parent->left->is_red_node())\n            || (parent->right && parent->right->is_red_node())) {\n            return false;\n        }\n        \n        \/\/ left child is not null. make sure its color is black\n        if (parent->left && parent->left->is_red_node()) {\n            \/\/ left child is not black.\n            return false;\n        }\n        \n        \/\/ right child is not null. make sure its color is black\n        if (parent->right && parent->right->is_red_node()) {\n            \/\/ right child is not black.\n            return false;\n        }\n    }\n    \n    \n    \/\/ only right subtree is available.\n    if (!parent->left && parent->right) {\n        return has_only_red_black_nodes(parent->right);\n    }\n    \n    \/\/ only left subtree is available.\n    if (!parent->right && parent->left) {\n        return has_only_red_black_nodes(parent->left);\n    }\n    \n    \/\/ Both left \"and\" right subtree\n    return (\n            has_only_red_black_nodes(parent->left) && has_only_red_black_nodes(parent->right)\n            );\n}\n\nbool rbtree::has_equal_black_nodes_all_path(rbnode* parent) {\n    \/\/ do a depth first search traversal and count the black nodes\n    \/\/ along all path from root to leaf node.\n    if (!parent) {\n        \/\/ no nodes. return true or false ?\n        return true;\n    }\n    \/\/ stack of tuple of (node, count of black nodes) pair.\n    stack<tuple<rbnode*, int>> stk;\n    list<int> paths;\n    \n    \/\/ count black nodes initially as 1 because root is black.\n    stk.push(make_tuple(parent, 1));\n    \n    while (!stk.empty()) {\n        auto pair = stk.top();\n        stk.pop();\n        \n        auto node = std::get<0>(pair);\n        auto count = std::get<1>(pair);\n        \n        if (node->left) {\n            auto left = node->left;\n            stk.push(make_tuple(left, count + (left->is_black_node() ? 1 : 0)));\n        } else {\n            \/\/ left child is null. count it as a black node.\n            paths.push_front(count + 1);\n        }\n        \n        if (node->right) {\n            auto right = node->right;\n            stk.push(make_tuple(right, count + (right->is_black_node() ? 1 : 0)));\n        } else {\n            \/\/ right child is null. count it as a black node.\n            paths.push_front(count + 1);\n        }\n    }\n    \n    \/\/ now check if black node count on all paths are same.\n    auto first = paths.front();\n    \n#if DEBUG\n    for (auto count : paths) cout << count << \"|\";\n    cout << endl;\n#endif\n    \n    for (auto count : paths) {\n        if (count != first)\n            return false;\n    }\n    \n    \n    return true;\n}\n\nbool rbtree::is_valid_rbtree() {\n    \/\/ rb tree properties:\n    \/\/  P.1: every node is red\/black.\n    \/\/  P.2: root is always black.\n    \/\/  P.3: leaf nodes are black.\n    \/\/  P.4: red node should have only black children.\n    \/\/  P.5: for any node x, # of black nodes along all\n    \/\/       paths from x to leaf nodes should be the same.\n    \n    if (!root) {\n        \/\/ no nodes in the tree, is a valid RB tree\n        return true;\n    }\n    \n    \/\/ P.1: check if all nodes are red\/ black.\n    if (violates(has_only_red_black_nodes(root))) {\n        \/\/ some nodes are of different color. It's not a red black tree\n        return false;\n    }\n    \n    \/\/ P.2: If root is not black then it's invalid.\n    if (violates(root->is_black_node()))\n        return false;\n    \n    \/\/ P.3: I take all null nodes to be black.\n    \/\/ I treat all null nodes as black. So I don't have to\n    \/\/ check for black null nodes.\n    \n    \/\/ P.4: all red nodes should have black children.\n    if (violates(rednode_has_black_children(root))) {\n        \/\/ some\/all of red nodes doesn't have a black children\n        return false;\n    }\n    \n    \/\/ P.5:  check #black nodes along all possible path from root\n    \/\/  to leaf nodes.\n    if (violates(has_equal_black_nodes_all_path(root))) {\n        \/\/ unequal number of black nodes.\n        return false;\n    }\n    \n    return true;\n}\n\nrbnode* rbtree::search(int key) {\n    return nullptr;\n}\n\nvoid rbtree::prune(int min, int max) {\n    throw new runtime_error(\"not implemented\");\n}\n\nvoid rbtree::bfs() {\n    throw new runtime_error(\"not implemented\");\n}\n\nvoid rbtree::dfs() {\n    throw new runtime_error(\"not implemented\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file was generated by dbusidl2cpp version 0.4\n * when processing input file org.kde.Phonon.AudioOutput.xml\n *\n * dbusidl2cpp is Copyright (C) 2006 Trolltech AS. All rights reserved.\n *\n * This is an auto-generated file.\n *\/\n\n#include \"audiooutputadaptor.h\"\n#include \"audiooutput.h\"\n#include <QtCore\/QArgument>\n#include <QtCore\/QByteRef>\n#include <QtCore\/QList>\n#include <QtCore\/QMap>\n#include <QtCore\/QString>\n#include <QtCore\/QStringList>\n#include <QtCore\/QVariant>\n#include \"phononnamespace_p.h\"\n\n\/*\n * Implementation of adaptor class AudioOutputAdaptor\n *\/\n\nAudioOutputAdaptor::AudioOutputAdaptor(QObject *parent)\n   : QDBusAbstractAdaptor(parent)\n{\n    \/\/ constructor\n    setAutoRelaySignals(true);\n}\n\nAudioOutputAdaptor::~AudioOutputAdaptor()\n{\n    \/\/ destructor\n}\n\ndouble AudioOutputAdaptor::volume() const\n{\n    \/\/ get the value of property volume\n    return qvariant_cast<qreal>(parent()->property(\"volume\"));\n}\n\nvoid AudioOutputAdaptor::setVolume(double value)\n{\n    \/\/ set the value of property volume\n    parent()->setProperty(\"volume\", QVariant::fromValue(static_cast<qreal>(value)));\n}\n\nbool AudioOutputAdaptor::muted() const\n{\n    return parent()->property(\"muted\").toBool();\n}\n\nvoid AudioOutputAdaptor::setMuted(bool value)\n{\n    parent()->setProperty(\"muted\", value);\n}\n\nQString AudioOutputAdaptor::category()\n{\n    \/\/ handle method call org.kde.Phonon.AudioOutput.category\n    return Phonon::categoryToString(static_cast<Phonon::AudioOutput *>(parent())->category());\n}\n\nQString AudioOutputAdaptor::name()\n{\n    \/\/ handle method call org.kde.Phonon.AudioOutput.name\n    QString name;\n    \/\/QMetaObject::invokeMethod(parent(), \"name\", Q_RETURN_ARG(QString, name));\n\n    \/\/ Alternative:\n    name = static_cast<Phonon::AudioOutput *>(parent())->name();\n    return name;\n}\n\n\n#include \"moc_audiooutputadaptor.cpp\"\n<commit_msg>Fix compile<commit_after>\/*\n * This file was generated by dbusidl2cpp version 0.4\n * when processing input file org.kde.Phonon.AudioOutput.xml\n *\n * dbusidl2cpp is Copyright (C) 2006 Trolltech AS. All rights reserved.\n *\n * This is an auto-generated file.\n *\/\n\n#include \"audiooutputadaptor.h\"\n#include \"audiooutput.h\"\n#include <QtCore\/QArgument>\n#include <QtCore\/QByteRef>\n#include <QtCore\/QList>\n#include <QtCore\/QMap>\n#include <QtCore\/QString>\n#include <QtCore\/QStringList>\n#include <QtCore\/QVariant>\n#include \"phononnamespace_p.h\"\n\n\/*\n * Implementation of adaptor class AudioOutputAdaptor\n *\/\n\nAudioOutputAdaptor::AudioOutputAdaptor(QObject *parent)\n   : QDBusAbstractAdaptor(parent)\n{\n    \/\/ constructor\n    setAutoRelaySignals(true);\n}\n\nAudioOutputAdaptor::~AudioOutputAdaptor()\n{\n    \/\/ destructor\n}\n\ndouble AudioOutputAdaptor::volume() const\n{\n    \/\/ get the value of property volume\n    return qvariant_cast<qreal>(parent()->property(\"volume\"));\n}\n\nvoid AudioOutputAdaptor::setVolume(double value)\n{\n    \/\/ set the value of property volume\n    parent()->setProperty(\"volume\", QVariant::fromValue(static_cast<qreal>(value)));\n}\n\nbool AudioOutputAdaptor::muted() const\n{\n    return parent()->property(\"muted\").toBool();\n}\n\nvoid AudioOutputAdaptor::setMuted(bool value)\n{\n    parent()->setProperty(\"muted\", value);\n}\n\nQString AudioOutputAdaptor::category()\n{\n    \/\/ handle method call org.kde.Phonon.AudioOutput.category\n    return Phonon::categoryToString(static_cast<Phonon::AudioOutput *>(parent())->category());\n}\n\nQString AudioOutputAdaptor::name()\n{\n    \/\/ handle method call org.kde.Phonon.AudioOutput.name\n    QString name;\n    \/\/QMetaObject::invokeMethod(parent(), \"name\", Q_RETURN_ARG(QString, name));\n\n    \/\/ Alternative:\n    name = static_cast<Phonon::AudioOutput *>(parent())->name();\n    return name;\n}\n\n\n#include \"audiooutputadaptor.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <algorithm>\n#include <ctime>\n#include <vector>\n\n#include \"TMath.h\"\n#include \"TRandom2.h\"\n\nusing namespace std;\n\nconst int maxint = 20;\nconst int minsize = 20;\nconst int maxsize = 500;\n\n#ifndef ROOT_TMath\n\ntemplate<typename T> \nstruct CompareDesc { \n\n   CompareDesc(T d) : fData(d) {}\n\n   bool operator()(int i1, int i2) { \n      return *(fData + i1) > *(fData + i2);\n   }\n\n   T fData;\n};\n\ntemplate<typename T> \nstruct CompareAsc { \n\n   CompareAsc(T d) : fData(d) {}\n\n   bool operator()(int i1, int i2) { \n      return *(fData + i1) < *(fData + i2);\n   }\n\n   T fData; \n};\n\n#endif\n\ntemplate <typename T> bool testSort(const int n)\n{\n   vector<T> k(n);\n   vector<T> indexM(n);\n   vector<T> indexS(n);\n\n   bool equals = true;\n\n   TRandom2 r( time( 0 ) );\n\n   cout << \"k: \";\n   for ( Int_t i = 0; i < n; i++) {\n      k[i] = (T) r.Integer( maxint ); \n      cout << k[i] << ' ';\n   }\n   cout << endl;\n\n   for(Int_t i = 0; i < n; i++) { indexM[i] = i; }\n   TMath::Sort(n,&k[0],&indexM[0],kTRUE);  \n\n   cout << \"TMath[kTRUE]\\n\\tindex = \";\n   for ( Int_t i = 0; i < n; ++i )\n      cout << k[indexM[i]] << ' ';\n   cout << endl;\n\n   for(Int_t i = 0; i < n; i++) { indexS[i] = i; }\n   std::sort(&indexS[0],&indexS[n], CompareDesc<const T*>(&k[0]) );\n\n   cout << \"std::sort[CompareDesc]\\n\\tindex = \";\n   for ( Int_t i = 0; i < n; ++i )\n      cout << k[indexS[i]] << ' ';\n   cout << endl;\n\n\n   equals &= std::equal(indexM.begin(), indexM.end(), indexS.begin());\n   cout << \"Equals? \" << (char*) (equals?\"OK\":\"FAILED\") << endl;\n\n\n   for(Int_t i = 0; i < n; i++) { indexM[i] = i; }\n   TMath::Sort(n,&k[0],&indexM[0],kFALSE);  \n\n   cout << \"TMath[kFALSE]\\n\\tindex = \";\n   for ( Int_t i = 0; i < n; ++i )\n      cout << k[indexM[i]] << ' ';\n   cout << endl;\n\n   for(Int_t i = 0; i < n; i++) { indexS[i] = i; }\n   std::sort(&indexS[0],&indexS[n], CompareAsc<const T*>(&k[0]) );\n\n   cout << \"std::sort[CompareAsc]\\n\\tindex = \";\n   for ( Int_t i = 0; i < n; ++i )\n      cout << k[indexS[i]] << ' ';\n   cout << endl;\n\n\n   equals &= std::equal(indexM.begin(), indexM.end(), indexS.begin());\n   cout << \"Equals? \" << (char*) (equals?\"OK\":\"FAILED\") << endl;\n\n   return equals;\n}\n\nbool stdsort() \n{\n   return testSort<Int_t>(20);\n}\n\nint main(int \/* argc *\/ , char ** \/* argv *\/ )\n{\n   bool equals = stdsort();\n\n   if ( !equals )\n      return 1;\n   else\n      return 0;\n}\n<commit_msg>More suppression of warnings in tests<commit_after>#include <iostream>\n#include <algorithm>\n#include <ctime>\n#include <vector>\n\n#include \"TMath.h\"\n#include \"TRandom2.h\"\n\nusing namespace std;\n\nconst int maxint = 20;\n\n#ifndef ROOT_TMath\n\ntemplate<typename T> \nstruct CompareDesc { \n\n   CompareDesc(T d) : fData(d) {}\n\n   bool operator()(int i1, int i2) { \n      return *(fData + i1) > *(fData + i2);\n   }\n\n   T fData;\n};\n\ntemplate<typename T> \nstruct CompareAsc { \n\n   CompareAsc(T d) : fData(d) {}\n\n   bool operator()(int i1, int i2) { \n      return *(fData + i1) < *(fData + i2);\n   }\n\n   T fData; \n};\n\n#endif\n\ntemplate <typename T> bool testSort(const int n)\n{\n   vector<T> k(n);\n   vector<T> indexM(n);\n   vector<T> indexS(n);\n\n   bool equals = true;\n\n   TRandom2 r( time( 0 ) );\n\n   cout << \"k: \";\n   for ( Int_t i = 0; i < n; i++) {\n      k[i] = (T) r.Integer( maxint ); \n      cout << k[i] << ' ';\n   }\n   cout << endl;\n\n   for(Int_t i = 0; i < n; i++) { indexM[i] = i; }\n   TMath::Sort(n,&k[0],&indexM[0],kTRUE);  \n\n   cout << \"TMath[kTRUE]\\n\\tindex = \";\n   for ( Int_t i = 0; i < n; ++i )\n      cout << k[indexM[i]] << ' ';\n   cout << endl;\n\n   for(Int_t i = 0; i < n; i++) { indexS[i] = i; }\n   std::sort(&indexS[0],&indexS[n], CompareDesc<const T*>(&k[0]) );\n\n   cout << \"std::sort[CompareDesc]\\n\\tindex = \";\n   for ( Int_t i = 0; i < n; ++i )\n      cout << k[indexS[i]] << ' ';\n   cout << endl;\n\n\n   equals &= std::equal(indexM.begin(), indexM.end(), indexS.begin());\n   cout << \"Equals? \" << (char*) (equals?\"OK\":\"FAILED\") << endl;\n\n\n   for(Int_t i = 0; i < n; i++) { indexM[i] = i; }\n   TMath::Sort(n,&k[0],&indexM[0],kFALSE);  \n\n   cout << \"TMath[kFALSE]\\n\\tindex = \";\n   for ( Int_t i = 0; i < n; ++i )\n      cout << k[indexM[i]] << ' ';\n   cout << endl;\n\n   for(Int_t i = 0; i < n; i++) { indexS[i] = i; }\n   std::sort(&indexS[0],&indexS[n], CompareAsc<const T*>(&k[0]) );\n\n   cout << \"std::sort[CompareAsc]\\n\\tindex = \";\n   for ( Int_t i = 0; i < n; ++i )\n      cout << k[indexS[i]] << ' ';\n   cout << endl;\n\n\n   equals &= std::equal(indexM.begin(), indexM.end(), indexS.begin());\n   cout << \"Equals? \" << (char*) (equals?\"OK\":\"FAILED\") << endl;\n\n   return equals;\n}\n\nbool stdsort() \n{\n   return testSort<Int_t>(20);\n}\n\nint main(int \/* argc *\/ , char ** \/* argv *\/ )\n{\n   bool equals = stdsort();\n\n   if ( !equals )\n      return 1;\n   else\n      return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2015, Trail of Bits\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, this\n  list of conditions and the following disclaimer.\n\n  Redistributions in binary form must reproduce the above copyright notice, this  list of conditions and the following disclaimer in the documentation and\/or\n  other materials provided with the distribution.\n\n  Neither the name of Trail of Bits 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\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\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 ON\nANY 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#include \"InstructionDispatch.h\"\n#include \"toLLVM.h\"\n#include \"X86.h\"\n#include \"raiseX86.h\"\n#include \"x86Helpers.h\"\n#include \"x86Instrs_CMOV.h\"\n#include \"RegisterUsage.h\"\n\n#define NASSERT(cond) TASSERT(cond, \"\")\n\nusing namespace llvm;\n\nstatic Value *EQ(BasicBlock *b, MCSemaRegs f1, MCSemaRegs f2) {\n\n    Value *l = F_READ(b, f1);\n    Value *r = F_READ(b, f2);\n    Value *is_eq = new ICmpInst(*b, CmpInst::ICMP_EQ, l, r);\n    return is_eq;\n}\n\nstatic Value *NE(BasicBlock *b, MCSemaRegs f1, MCSemaRegs f2) {\n\n    Value *l = F_READ(b, f1);\n    Value *r = F_READ(b, f2);\n    Value *is_ne = new ICmpInst(*b, CmpInst::ICMP_NE, l, r);\n    return is_ne;\n}\n\nstatic Value *NOT(BasicBlock *b, MCSemaRegs flag) {\n\n    Value *f = F_READ(b, flag);\n    Value *not_f = BinaryOperator::CreateNot(f, \"\", b);\n    return not_f;\n}\n\nstatic Value *AND(BasicBlock *b, Value *v1, Value *v2) {\n   Value *andv = BinaryOperator::CreateAnd(v1, v2, \"\", b);\n   return andv;\n}\n\nstatic Value *OR(BasicBlock *b, Value *v1, Value *v2) {\n   Value *andv = BinaryOperator::CreateOr(v1, v2, \"\", b);\n   return andv;\n}\n\nstatic Value *CHOOSE_IF(BasicBlock *b, Value *cmp, Value *trueval, Value *falseval) {\n    Value *se = SelectInst::Create(cmp, trueval, falseval, \"\", b);\n    return se;\n}\n\ntemplate <int width>\nstatic InstTransResult  doCMOV(\n        BasicBlock *b, \n        MCOperand &dst, \n        Value *condition, \n        Value *newval) \n{\n    Value *orig = R_READ<width>(b, dst.getReg());\n\n    Value *to_write = CHOOSE_IF(b, \n            condition,\n            newval,\n            orig);\n\n    R_WRITE<width>(b, dst.getReg(), to_write);\n    return ContinueBlock;\n}\n\n#define EMIT_CMOV_RM(width, condition) [] (NativeModulePtr natM, BasicBlock *&block, InstPtr ip, MCInst &inst)->InstTransResult {\\\n    BasicBlock *b = block;\\\n    if( ip->is_data_offset() ) {\\\n        return doCMOV<width>(block, OP(0), condition, M_READ<width>(ip, b, STD_GLOBAL_OP(2)));\\\n    }else {\\\n        return doCMOV<width>(block, OP(0), condition, M_READ<width>(ip, b, ADDR(2)));\\\n    }\\\n}\n\n#define EMIT_CMOV_RR(width, condition) [] (NativeModulePtr natM, BasicBlock *&b, InstPtr ip, MCInst &inst)->InstTransResult {\\\n    return doCMOV<width>(b, OP(0), condition, R_READ<width>(b, OP(2).getReg())); \\\n}\n\n#define EMIT_CMOV(which, condition) \\\n        m[which ## 16rm] = EMIT_CMOV_RM(16, condition);\\\n        m[which ## 16rr] = EMIT_CMOV_RR(16, condition);\\\n        m[which ## 32rm] = EMIT_CMOV_RM(32, condition);\\\n        m[which ## 32rr] = EMIT_CMOV_RR(32, condition);\n\nvoid CMOV_populateDispatchMap(DispatchMap &m) {\n        EMIT_CMOV(X86::CMOVA,   AND(b, NOT(b, CF), NOT(b, ZF)));\n        EMIT_CMOV(X86::CMOVAE,  NOT(b, CF));\n        EMIT_CMOV(X86::CMOVB,   F_READ(b, CF));\n        EMIT_CMOV(X86::CMOVBE,  OR(b, F_READ(b, CF), F_READ(b, ZF)));\n        EMIT_CMOV(X86::CMOVE,   F_READ(b, ZF));\n        EMIT_CMOV(X86::CMOVG,   AND(b, NOT(b, ZF), EQ(b, SF, OF)));\n        EMIT_CMOV(X86::CMOVGE,  EQ(b, SF, OF));\n        EMIT_CMOV(X86::CMOVL,   NE(b, SF, OF));\n        EMIT_CMOV(X86::CMOVLE,  OR(b, F_READ(b, ZF), NE(b, SF, OF)));\n        EMIT_CMOV(X86::CMOVNE,  NOT(b, ZF));\n        EMIT_CMOV(X86::CMOVNO,  NOT(b, OF));\n        EMIT_CMOV(X86::CMOVNP,  NOT(b, PF));\n        EMIT_CMOV(X86::CMOVNS,  NOT(b, SF));\n        EMIT_CMOV(X86::CMOVO,   F_READ(b, OF));\n        EMIT_CMOV(X86::CMOVP,   F_READ(b, PF));\n        EMIT_CMOV(X86::CMOVS,   F_READ(b, SF));\n}\n<commit_msg>Support 64-bit cmov<commit_after>\/*\nCopyright (c) 2015, Trail of Bits\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, this\n  list of conditions and the following disclaimer.\n\n  Redistributions in binary form must reproduce the above copyright notice, this  list of conditions and the following disclaimer in the documentation and\/or\n  other materials provided with the distribution.\n\n  Neither the name of Trail of Bits 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\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\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 ON\nANY 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#include \"InstructionDispatch.h\"\n#include \"toLLVM.h\"\n#include \"X86.h\"\n#include \"raiseX86.h\"\n#include \"x86Helpers.h\"\n#include \"x86Instrs_CMOV.h\"\n#include \"RegisterUsage.h\"\n\n#define NASSERT(cond) TASSERT(cond, \"\")\n\nusing namespace llvm;\n\nstatic Value *EQ(BasicBlock *b, MCSemaRegs f1, MCSemaRegs f2) {\n\n    Value *l = F_READ(b, f1);\n    Value *r = F_READ(b, f2);\n    Value *is_eq = new ICmpInst(*b, CmpInst::ICMP_EQ, l, r);\n    return is_eq;\n}\n\nstatic Value *NE(BasicBlock *b, MCSemaRegs f1, MCSemaRegs f2) {\n\n    Value *l = F_READ(b, f1);\n    Value *r = F_READ(b, f2);\n    Value *is_ne = new ICmpInst(*b, CmpInst::ICMP_NE, l, r);\n    return is_ne;\n}\n\nstatic Value *NOT(BasicBlock *b, MCSemaRegs flag) {\n\n    Value *f = F_READ(b, flag);\n    Value *not_f = BinaryOperator::CreateNot(f, \"\", b);\n    return not_f;\n}\n\nstatic Value *AND(BasicBlock *b, Value *v1, Value *v2) {\n   Value *andv = BinaryOperator::CreateAnd(v1, v2, \"\", b);\n   return andv;\n}\n\nstatic Value *OR(BasicBlock *b, Value *v1, Value *v2) {\n   Value *andv = BinaryOperator::CreateOr(v1, v2, \"\", b);\n   return andv;\n}\n\nstatic Value *CHOOSE_IF(BasicBlock *b, Value *cmp, Value *trueval, Value *falseval) {\n    Value *se = SelectInst::Create(cmp, trueval, falseval, \"\", b);\n    return se;\n}\n\ntemplate <int width>\nstatic InstTransResult  doCMOV(\n        BasicBlock *b, \n        MCOperand &dst, \n        Value *condition, \n        Value *newval) \n{\n    Value *orig = R_READ<width>(b, dst.getReg());\n\n    Value *to_write = CHOOSE_IF(b, \n            condition,\n            newval,\n            orig);\n\n    R_WRITE<width>(b, dst.getReg(), to_write);\n    return ContinueBlock;\n}\n\n#define EMIT_CMOV_RM(width, condition) [] (NativeModulePtr natM, BasicBlock *&block, InstPtr ip, MCInst &inst)->InstTransResult {\\\n    BasicBlock *b = block;\\\n    if( ip->is_data_offset() ) {\\\n        return doCMOV<width>(block, OP(0), condition, M_READ<width>(ip, b, STD_GLOBAL_OP(2)));\\\n    }else {\\\n        return doCMOV<width>(block, OP(0), condition, M_READ<width>(ip, b, ADDR(2)));\\\n    }\\\n}\n\n#define EMIT_CMOV_RR(width, condition) [] (NativeModulePtr natM, BasicBlock *&b, InstPtr ip, MCInst &inst)->InstTransResult {\\\n    return doCMOV<width>(b, OP(0), condition, R_READ<width>(b, OP(2).getReg())); \\\n}\n\n#define EMIT_CMOV(which, condition) \\\n        m[which ## 16rm] = EMIT_CMOV_RM(16, condition);\\\n        m[which ## 16rr] = EMIT_CMOV_RR(16, condition);\\\n        m[which ## 32rm] = EMIT_CMOV_RM(32, condition);\\\n        m[which ## 32rr] = EMIT_CMOV_RR(32, condition);\\\n        m[which ## 64rm] = EMIT_CMOV_RM(32, condition);\\\n        m[which ## 64rr] = EMIT_CMOV_RR(32, condition);\n\nvoid CMOV_populateDispatchMap(DispatchMap &m) {\n        EMIT_CMOV(X86::CMOVA,   AND(b, NOT(b, CF), NOT(b, ZF)));\n        EMIT_CMOV(X86::CMOVAE,  NOT(b, CF));\n        EMIT_CMOV(X86::CMOVB,   F_READ(b, CF));\n        EMIT_CMOV(X86::CMOVBE,  OR(b, F_READ(b, CF), F_READ(b, ZF)));\n        EMIT_CMOV(X86::CMOVE,   F_READ(b, ZF));\n        EMIT_CMOV(X86::CMOVG,   AND(b, NOT(b, ZF), EQ(b, SF, OF)));\n        EMIT_CMOV(X86::CMOVGE,  EQ(b, SF, OF));\n        EMIT_CMOV(X86::CMOVL,   NE(b, SF, OF));\n        EMIT_CMOV(X86::CMOVLE,  OR(b, F_READ(b, ZF), NE(b, SF, OF)));\n        EMIT_CMOV(X86::CMOVNE,  NOT(b, ZF));\n        EMIT_CMOV(X86::CMOVNO,  NOT(b, OF));\n        EMIT_CMOV(X86::CMOVNP,  NOT(b, PF));\n        EMIT_CMOV(X86::CMOVNS,  NOT(b, SF));\n        EMIT_CMOV(X86::CMOVO,   F_READ(b, OF));\n        EMIT_CMOV(X86::CMOVP,   F_READ(b, PF));\n        EMIT_CMOV(X86::CMOVS,   F_READ(b, SF));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"deferred_task.hpp\"\n\nnamespace my\n{\nDeferredTask::DeferredTask(TDuration const & duration) : m_duration(duration)\n{\n  m_thread = thread([this]\n  {\n    unique_lock<mutex> l(m_mutex);\n    while (!m_terminate)\n    {\n      if (!m_fn)\n      {\n        m_cv.wait(l);\n        continue;\n      }\n\n      if (m_cv.wait_for(l, m_duration) != cv_status::timeout)\n        continue;\n\n      auto fn = move(m_fn);\n      m_fn = nullptr;\n\n      if (fn)\n      {\n        l.unlock();\n        fn();\n        l.lock();\n      }\n    }\n  });\n}\n\nDeferredTask::~DeferredTask()\n{\n  {\n    unique_lock<mutex> l(m_mutex);\n    m_terminate = true;\n  }\n  m_cv.notify_one();\n  m_thread.join();\n}\n\nvoid DeferredTask::Drop()\n{\n  {\n    unique_lock<mutex> l(m_mutex);\n    m_fn = nullptr;\n  }\n  m_cv.notify_one();\n}\n}  \/\/ namespace my\n<commit_msg>Review fix<commit_after>#include \"deferred_task.hpp\"\n\nnamespace my\n{\nDeferredTask::DeferredTask(TDuration const & duration) : m_duration(duration)\n{\n  m_thread = thread([this]\n  {\n    unique_lock<mutex> l(m_mutex);\n    while (!m_terminate)\n    {\n      if (!m_fn)\n      {\n        m_cv.wait(l);\n        continue;\n      }\n\n      if (m_cv.wait_for(l, m_duration) != cv_status::timeout || !m_fn)\n        continue;\n\n      auto fn = move(m_fn);\n      m_fn = nullptr;\n\n      l.unlock();\n      fn();\n      l.lock();\n    }\n  });\n}\n\nDeferredTask::~DeferredTask()\n{\n  {\n    unique_lock<mutex> l(m_mutex);\n    m_terminate = true;\n  }\n  m_cv.notify_one();\n  m_thread.join();\n}\n\nvoid DeferredTask::Drop()\n{\n  {\n    unique_lock<mutex> l(m_mutex);\n    m_fn = nullptr;\n  }\n  m_cv.notify_one();\n}\n}  \/\/ namespace my\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015 The Enquery 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. See the AUTHORS file for names of\n\/\/ contributors.\n\n#include <errno.h>\n#include <pthread.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include \"enquery\/executive.h\"\n#include \"enquery\/status.h\"\n#include \"enquery\/testing.h\"\n\nusing ::enquery::Executive;\nusing ::enquery::Future;\nusing ::enquery::Status;\n\nint negate(int x) { return -x; }\n\nint main(int argc, char* argv[]) {\n  const int input_value = 42;\n\n  Executive* executive = Executive::Create(NULL, true);\n\n  Future<int> future_result;\n  Status status = executive->Submit(negate, input_value, &future_result);\n  ASSERT_TRUE(status.IsSuccess());\n  ASSERT_EQUALS(future_result.GetValue(), negate(input_value));\n\n  delete executive;\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>more work on executive's thread ppol<commit_after>\/\/ Copyright 2015 The Enquery 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. See the AUTHORS file for names of\n\/\/ contributors.\n\n#include <errno.h>\n#include <pthread.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include \"enquery\/execution.h\"\n#include \"enquery\/executive.h\"\n#include \"enquery\/status.h\"\n#include \"enquery\/testing.h\"\n\nusing ::enquery::Execution;\nusing ::enquery::Executive;\nusing ::enquery::Future;\nusing ::enquery::Status;\n\nnamespace enquery {\n\n\/\/ Execution implementation that always fails. The constructor accepts a\n\/\/ a pointer-to-bool, which is set to 'false' on construction, and set to\n\/\/ 'true' on destruction; this can be used by the test to determine the\n\/\/ correct behavior of Executive's optional mechanism for taking ownership\n\/\/ of the Execution instance that's passed during creation.\nclass Task;\nclass FailingExecution : public Execution {\n public:\n  FailingExecution(bool* set_when_destroyed)\n      : set_when_destroyed_(set_when_destroyed) {\n    *set_when_destroyed_ = false;\n  }\n\n  virtual ~FailingExecution() { *set_when_destroyed_ = true; }\n\n  virtual Status Execute(Task*) {\n    return Status::MakeError(\"test\", \"failed to execute\");\n  }\n\n private:\n  bool* set_when_destroyed_;\n};\n\n}  \/\/ namespace enquery\n\n\/\/ Sample function for unit test (simply negates integer that's passed.)\nint negate(int x) { return -x; }\n\nvoid test_default_use() {\n  const int input_value = 42;\n\n  \/\/ Create an Executive with default options; pass NULL to use execute\n  \/\/ everything on the curren thread. The boolean parameter indicates\n  \/\/ that Executive should own the 'Execution' object, however when\n  \/\/ NULL is passed, the current thread executive is used, and the\n  \/\/ Executive *always* owns that.\n  Executive* executive = Executive::Create(NULL, true);\n\n  \/\/ Create an empty future, to be populated later via Submit()\n  Future<int> future_result;\n  ASSERT_FALSE(future_result.Valid());\n\n  \/\/ Submit a task; in this case, we're making a call to the 'negate'\n  \/\/ type, passing input_value as the argument; if successful,\n  \/\/ 'future_result' is populated with a future that will eventually\n  \/\/ hold the result of the calculation.\n  Status status = executive->Submit(negate, input_value, &future_result);\n\n  \/\/ We should succeed\n  ASSERT_TRUE(status.IsSuccess());\n\n  \/\/ We should get the correct answer\n  ASSERT_EQUALS(future_result.GetValue(), negate(input_value));\n\n  delete executive;\n}\n\nvoid test_failing_use_with_ownership() {\n  const int input_value = 42;\n\n  \/\/ First, create an execution method that always fails.\n  bool destroyed = false;\n  Execution* exm = new enquery::FailingExecution(&destroyed);\n\n  \/\/ Create an executive that's configured to take ownership of\n  \/\/ the execution method that's passed in.\n  Executive* executive = Executive::Create(exm, true);\n\n  \/\/ Create an empty future to hold the result.\n  Future<int> future_result;\n  ASSERT_FALSE(future_result.Valid());\n\n  \/\/ Submit the task for execution, which should fail fail.\n  Status status = executive->Submit(negate, input_value, &future_result);\n  ASSERT_FALSE(status.IsSuccess());\n\n  \/\/ Delete the executive.\n  delete executive;\n\n  \/\/ Assert that Execution owned by Executive was actually destroyed.\n  ASSERT_TRUE(destroyed);\n}\n\nint main(int argc, char* argv[]) {\n  test_default_use();\n  test_failing_use_with_ownership();\n  return EXIT_SUCCESS;\n}\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 <algorithm>\n#include <vector>\n#include <gtest\/gtest.h>\n\n#include \"test_api.h\"\n\n#include \"common_types.h\"\n#include \"rtp_rtcp.h\"\n#include \"rtp_rtcp_defines.h\"\n\nusing namespace webrtc;\n \nconst int kVideoNackListSize = 10;\nconst int kTestId = 123;\nconst WebRtc_UWord32 kTestSsrc = 3456;\nconst WebRtc_UWord16 kTestSequenceNumber = 2345;\nconst WebRtc_UWord32 kTestNumberOfPackets = 450;\nconst int kTestNumberOfRtxPackets = 49;\n\nclass VerifyingNackReceiver : public RtpData\n{\n public:\n  VerifyingNackReceiver() {}\n\n  virtual WebRtc_Word32 OnReceivedPayloadData(\n      const WebRtc_UWord8* data,\n      const WebRtc_UWord16 size,\n      const webrtc::WebRtcRTPHeader* rtp_header) {\n    \n    EXPECT_EQ(kTestSsrc, rtp_header->header.ssrc);\n    EXPECT_EQ(find(sequence_numbers_.begin(),\n                    sequence_numbers_.end(),\n                    rtp_header->header.sequenceNumber),\n              sequence_numbers_.end());\n    sequence_numbers_.push_back(rtp_header->header.sequenceNumber);\n    return 0;\n  }\n  std::vector<WebRtc_UWord16 > sequence_numbers_;\n};\n\nclass NackLoopBackTransport : public webrtc::Transport {\n public:\n  NackLoopBackTransport(RtpRtcp* rtp_rtcp_module, uint32_t rtx_ssrc)\n    : count_(0),\n      packet_loss_(0),\n      rtx_ssrc_(rtx_ssrc),\n      count_rtx_ssrc_(0),\n      module_(rtp_rtcp_module) {\n  }\n  void DropEveryNthPacket(int n) {\n    packet_loss_ = n;\n  }\n  virtual int SendPacket(int channel, const void *data, int len) {\n    count_++;\n    const unsigned char* ptr = static_cast<const unsigned  char*>(data);\n    uint32_t ssrc = (ptr[8] << 24) + (ptr[9] << 16) + (ptr[10] << 8) + ptr[11];\n    if (ssrc == rtx_ssrc_) count_rtx_ssrc_++;\n\n    if (packet_loss_ > 0) {\n      if ((count_ % packet_loss_) == 0) {\n        return len;\n      }\n    }\n    if (module_->IncomingPacket((const WebRtc_UWord8*)data, len) == 0) {\n      return len;\n    }\n    return -1;\n  }\n  virtual int SendRTCPPacket(int channel, const void *data, int len) {\n    if (module_->IncomingPacket((const WebRtc_UWord8*)data, len) == 0) {\n      return len;\n    }\n    return -1;\n  }\n  int count_;\n  int packet_loss_;\n  uint32_t rtx_ssrc_;\n  int count_rtx_ssrc_;\n  RtpRtcp* module_;\n};\n\nclass RtpRtcpNackTest : public ::testing::Test {\n protected:\n  RtpRtcpNackTest() {}\n  ~RtpRtcpNackTest() {}\n\n  virtual void SetUp() {\n    video_module_ = RtpRtcp::CreateRtpRtcp(kTestId, false, &fake_clock);\n    EXPECT_EQ(0, video_module_->InitReceiver());\n    EXPECT_EQ(0, video_module_->InitSender());\n    EXPECT_EQ(0, video_module_->SetRTCPStatus(kRtcpCompound));\n    EXPECT_EQ(0, video_module_->SetSSRC(kTestSsrc));\n    EXPECT_EQ(0, video_module_->SetNACKStatus(kNackRtcp));\n    EXPECT_EQ(0, video_module_->SetStorePacketsStatus(true));\n    EXPECT_EQ(0, video_module_->SetSendingStatus(true));\n    EXPECT_EQ(0, video_module_->SetSequenceNumber(kTestSequenceNumber));\n    EXPECT_EQ(0, video_module_->SetStartTimestamp(111111));\n\n    transport_ = new NackLoopBackTransport(video_module_, kTestSsrc + 1);\n    EXPECT_EQ(0, video_module_->RegisterSendTransport(transport_));\n\n    nack_receiver_ = new VerifyingNackReceiver();\n    EXPECT_EQ(0, video_module_->RegisterIncomingDataCallback(nack_receiver_));\n\n    VideoCodec video_codec;\n    memset(&video_codec, 0, sizeof(video_codec));\n    video_codec.plType = 123;\n    memcpy(video_codec.plName, \"I420\", 5);\n\n    EXPECT_EQ(0, video_module_->RegisterSendPayload(video_codec));\n    EXPECT_EQ(0, video_module_->RegisterReceivePayload(video_codec));\n\n    payload_data_length = sizeof(payload_data);\n\n    for (int n = 0; n < payload_data_length; n++) {\n      payload_data[n] = n % 10;\n    }\n  }\n\n  virtual void TearDown() {\n    RtpRtcp::DestroyRtpRtcp(video_module_);\n    delete transport_;\n    delete nack_receiver_;\n  }\n\n  RtpRtcp* video_module_;\n  NackLoopBackTransport* transport_;\n  VerifyingNackReceiver* nack_receiver_;\n  WebRtc_UWord8  payload_data[65000];\n  int payload_data_length;\n  FakeRtpRtcpClock fake_clock;\n};\n\nTEST_F(RtpRtcpNackTest, RTCP) {\n  WebRtc_UWord32 timestamp = 3000;\n  WebRtc_UWord16 nack_list[kVideoNackListSize];\n  transport_->DropEveryNthPacket(10);\n\n  for (int frame = 0; frame < 10; ++frame) {\n    EXPECT_EQ(0, video_module_->SendOutgoingData(webrtc::kVideoFrameDelta, 123,\n                                                timestamp,\n                                                payload_data,\n                                                payload_data_length));\n\n    std::sort(nack_receiver_->sequence_numbers_.begin(),\n              nack_receiver_->sequence_numbers_.end());\n\n    std::vector<WebRtc_UWord16> missing_sequence_numbers;\n    std::vector<WebRtc_UWord16>::iterator it =\n        nack_receiver_->sequence_numbers_.begin();\n\n    while (it != nack_receiver_->sequence_numbers_.end()) {\n      WebRtc_UWord16 sequence_number_1 = *it;\n      ++it;\n      if (it != nack_receiver_->sequence_numbers_.end()) {\n        WebRtc_UWord16 sequence_number_2 = *it;\n        \/\/ Add all missing sequence numbers to list\n        for (WebRtc_UWord16 i = sequence_number_1 + 1; i < sequence_number_2;\n            ++i) {\n          missing_sequence_numbers.push_back(i);\n        }\n      }\n    }\n    int n = 0;\n    for (it = missing_sequence_numbers.begin();\n        it != missing_sequence_numbers.end(); ++it) {\n      nack_list[n++] = (*it);\n    }\n    video_module_->SendNACK(nack_list, n);\n    fake_clock.IncrementTime(33);\n    video_module_->Process();\n\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n  }\n  std::sort(nack_receiver_->sequence_numbers_.begin(),\n            nack_receiver_->sequence_numbers_.end());\n  EXPECT_EQ(kTestSequenceNumber, *(nack_receiver_->sequence_numbers_.begin()));\n  EXPECT_EQ(kTestSequenceNumber + kTestNumberOfPackets - 1,\n            *(nack_receiver_->sequence_numbers_.rbegin()));\n  EXPECT_EQ(kTestNumberOfPackets, nack_receiver_->sequence_numbers_.size());\n  EXPECT_EQ(0, transport_->count_rtx_ssrc_);\n}\n\nTEST_F(RtpRtcpNackTest, RTX) {\n  EXPECT_EQ(0, video_module_->SetRTXReceiveStatus(true, kTestSsrc + 1));\n  EXPECT_EQ(0, video_module_->SetRTXSendStatus(true, true, kTestSsrc + 1));\n\n  transport_->DropEveryNthPacket(10);\n\n  WebRtc_UWord32 timestamp = 3000;\n  WebRtc_UWord16 nack_list[kVideoNackListSize];\n\n  for (int frame = 0; frame < 10; ++frame) {\n    EXPECT_EQ(0, video_module_->SendOutgoingData(webrtc::kVideoFrameDelta, 123,\n                                               timestamp,\n                                               payload_data,\n                                               payload_data_length));\n\n    std::sort(nack_receiver_->sequence_numbers_.begin(),\n              nack_receiver_->sequence_numbers_.end());\n\n    std::vector<WebRtc_UWord16> missing_sequence_numbers;\n\n\n    std::vector<WebRtc_UWord16>::iterator it =\n        nack_receiver_->sequence_numbers_.begin();\n    while (it != nack_receiver_->sequence_numbers_.end()) {\n      int sequence_number_1 = *it;\n      ++it;\n      if (it != nack_receiver_->sequence_numbers_.end()) {\n        int sequence_number_2 = *it;\n        \/\/ Add all missing sequence numbers to list.\n        for (int i = sequence_number_1 + 1; i < sequence_number_2; ++i) {\n          missing_sequence_numbers.push_back(i);\n        }\n      }\n    }\n    int n = 0;\n    for (it = missing_sequence_numbers.begin();\n        it != missing_sequence_numbers.end(); ++it) {\n      nack_list[n++] = (*it);\n    }\n    video_module_->SendNACK(nack_list, n);\n    fake_clock.IncrementTime(33);\n    video_module_->Process();\n\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n  }\n  std::sort(nack_receiver_->sequence_numbers_.begin(),\n            nack_receiver_->sequence_numbers_.end());\n  EXPECT_EQ(kTestSequenceNumber, *(nack_receiver_->sequence_numbers_.begin()));\n  EXPECT_EQ(kTestSequenceNumber + kTestNumberOfPackets - 1,\n            *(nack_receiver_->sequence_numbers_.rbegin()));\n  EXPECT_EQ(kTestNumberOfPackets, nack_receiver_->sequence_numbers_.size());\n  EXPECT_EQ(kTestNumberOfRtxPackets, transport_->count_rtx_ssrc_);\n}\n\n<commit_msg>Fix compilation error on android Review URL: https:\/\/webrtc-codereview.appspot.com\/426006<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 <algorithm>\n#include <vector>\n#include <gtest\/gtest.h>\n\n#include \"test_api.h\"\n\n#include \"common_types.h\"\n#include \"rtp_rtcp.h\"\n#include \"rtp_rtcp_defines.h\"\n\nusing namespace webrtc;\n\nconst int kVideoNackListSize = 10;\nconst int kTestId = 123;\nconst WebRtc_UWord32 kTestSsrc = 3456;\nconst WebRtc_UWord16 kTestSequenceNumber = 2345;\nconst WebRtc_UWord32 kTestNumberOfPackets = 450;\nconst int kTestNumberOfRtxPackets = 49;\n\nclass VerifyingNackReceiver : public RtpData\n{\n public:\n  VerifyingNackReceiver() {}\n\n  virtual WebRtc_Word32 OnReceivedPayloadData(\n      const WebRtc_UWord8* data,\n      const WebRtc_UWord16 size,\n      const webrtc::WebRtcRTPHeader* rtp_header) {\n\n    EXPECT_EQ(kTestSsrc, rtp_header->header.ssrc);\n    EXPECT_EQ(std::find(sequence_numbers_.begin(),\n                    sequence_numbers_.end(),\n                    rtp_header->header.sequenceNumber),\n              sequence_numbers_.end());\n    sequence_numbers_.push_back(rtp_header->header.sequenceNumber);\n    return 0;\n  }\n  std::vector<WebRtc_UWord16 > sequence_numbers_;\n};\n\nclass NackLoopBackTransport : public webrtc::Transport {\n public:\n  NackLoopBackTransport(RtpRtcp* rtp_rtcp_module, uint32_t rtx_ssrc)\n    : count_(0),\n      packet_loss_(0),\n      rtx_ssrc_(rtx_ssrc),\n      count_rtx_ssrc_(0),\n      module_(rtp_rtcp_module) {\n  }\n  void DropEveryNthPacket(int n) {\n    packet_loss_ = n;\n  }\n  virtual int SendPacket(int channel, const void *data, int len) {\n    count_++;\n    const unsigned char* ptr = static_cast<const unsigned  char*>(data);\n    uint32_t ssrc = (ptr[8] << 24) + (ptr[9] << 16) + (ptr[10] << 8) + ptr[11];\n    if (ssrc == rtx_ssrc_) count_rtx_ssrc_++;\n\n    if (packet_loss_ > 0) {\n      if ((count_ % packet_loss_) == 0) {\n        return len;\n      }\n    }\n    if (module_->IncomingPacket((const WebRtc_UWord8*)data, len) == 0) {\n      return len;\n    }\n    return -1;\n  }\n  virtual int SendRTCPPacket(int channel, const void *data, int len) {\n    if (module_->IncomingPacket((const WebRtc_UWord8*)data, len) == 0) {\n      return len;\n    }\n    return -1;\n  }\n  int count_;\n  int packet_loss_;\n  uint32_t rtx_ssrc_;\n  int count_rtx_ssrc_;\n  RtpRtcp* module_;\n};\n\nclass RtpRtcpNackTest : public ::testing::Test {\n protected:\n  RtpRtcpNackTest() {}\n  ~RtpRtcpNackTest() {}\n\n  virtual void SetUp() {\n    video_module_ = RtpRtcp::CreateRtpRtcp(kTestId, false, &fake_clock);\n    EXPECT_EQ(0, video_module_->InitReceiver());\n    EXPECT_EQ(0, video_module_->InitSender());\n    EXPECT_EQ(0, video_module_->SetRTCPStatus(kRtcpCompound));\n    EXPECT_EQ(0, video_module_->SetSSRC(kTestSsrc));\n    EXPECT_EQ(0, video_module_->SetNACKStatus(kNackRtcp));\n    EXPECT_EQ(0, video_module_->SetStorePacketsStatus(true));\n    EXPECT_EQ(0, video_module_->SetSendingStatus(true));\n    EXPECT_EQ(0, video_module_->SetSequenceNumber(kTestSequenceNumber));\n    EXPECT_EQ(0, video_module_->SetStartTimestamp(111111));\n\n    transport_ = new NackLoopBackTransport(video_module_, kTestSsrc + 1);\n    EXPECT_EQ(0, video_module_->RegisterSendTransport(transport_));\n\n    nack_receiver_ = new VerifyingNackReceiver();\n    EXPECT_EQ(0, video_module_->RegisterIncomingDataCallback(nack_receiver_));\n\n    VideoCodec video_codec;\n    memset(&video_codec, 0, sizeof(video_codec));\n    video_codec.plType = 123;\n    memcpy(video_codec.plName, \"I420\", 5);\n\n    EXPECT_EQ(0, video_module_->RegisterSendPayload(video_codec));\n    EXPECT_EQ(0, video_module_->RegisterReceivePayload(video_codec));\n\n    payload_data_length = sizeof(payload_data);\n\n    for (int n = 0; n < payload_data_length; n++) {\n      payload_data[n] = n % 10;\n    }\n  }\n\n  virtual void TearDown() {\n    RtpRtcp::DestroyRtpRtcp(video_module_);\n    delete transport_;\n    delete nack_receiver_;\n  }\n\n  RtpRtcp* video_module_;\n  NackLoopBackTransport* transport_;\n  VerifyingNackReceiver* nack_receiver_;\n  WebRtc_UWord8  payload_data[65000];\n  int payload_data_length;\n  FakeRtpRtcpClock fake_clock;\n};\n\nTEST_F(RtpRtcpNackTest, RTCP) {\n  WebRtc_UWord32 timestamp = 3000;\n  WebRtc_UWord16 nack_list[kVideoNackListSize];\n  transport_->DropEveryNthPacket(10);\n\n  for (int frame = 0; frame < 10; ++frame) {\n    EXPECT_EQ(0, video_module_->SendOutgoingData(webrtc::kVideoFrameDelta, 123,\n                                                timestamp,\n                                                payload_data,\n                                                payload_data_length));\n\n    std::sort(nack_receiver_->sequence_numbers_.begin(),\n              nack_receiver_->sequence_numbers_.end());\n\n    std::vector<WebRtc_UWord16> missing_sequence_numbers;\n    std::vector<WebRtc_UWord16>::iterator it =\n        nack_receiver_->sequence_numbers_.begin();\n\n    while (it != nack_receiver_->sequence_numbers_.end()) {\n      WebRtc_UWord16 sequence_number_1 = *it;\n      ++it;\n      if (it != nack_receiver_->sequence_numbers_.end()) {\n        WebRtc_UWord16 sequence_number_2 = *it;\n        \/\/ Add all missing sequence numbers to list\n        for (WebRtc_UWord16 i = sequence_number_1 + 1; i < sequence_number_2;\n            ++i) {\n          missing_sequence_numbers.push_back(i);\n        }\n      }\n    }\n    int n = 0;\n    for (it = missing_sequence_numbers.begin();\n        it != missing_sequence_numbers.end(); ++it) {\n      nack_list[n++] = (*it);\n    }\n    video_module_->SendNACK(nack_list, n);\n    fake_clock.IncrementTime(33);\n    video_module_->Process();\n\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n  }\n  std::sort(nack_receiver_->sequence_numbers_.begin(),\n            nack_receiver_->sequence_numbers_.end());\n  EXPECT_EQ(kTestSequenceNumber, *(nack_receiver_->sequence_numbers_.begin()));\n  EXPECT_EQ(kTestSequenceNumber + kTestNumberOfPackets - 1,\n            *(nack_receiver_->sequence_numbers_.rbegin()));\n  EXPECT_EQ(kTestNumberOfPackets, nack_receiver_->sequence_numbers_.size());\n  EXPECT_EQ(0, transport_->count_rtx_ssrc_);\n}\n\nTEST_F(RtpRtcpNackTest, RTX) {\n  EXPECT_EQ(0, video_module_->SetRTXReceiveStatus(true, kTestSsrc + 1));\n  EXPECT_EQ(0, video_module_->SetRTXSendStatus(true, true, kTestSsrc + 1));\n\n  transport_->DropEveryNthPacket(10);\n\n  WebRtc_UWord32 timestamp = 3000;\n  WebRtc_UWord16 nack_list[kVideoNackListSize];\n\n  for (int frame = 0; frame < 10; ++frame) {\n    EXPECT_EQ(0, video_module_->SendOutgoingData(webrtc::kVideoFrameDelta, 123,\n                                               timestamp,\n                                               payload_data,\n                                               payload_data_length));\n\n    std::sort(nack_receiver_->sequence_numbers_.begin(),\n              nack_receiver_->sequence_numbers_.end());\n\n    std::vector<WebRtc_UWord16> missing_sequence_numbers;\n\n\n    std::vector<WebRtc_UWord16>::iterator it =\n        nack_receiver_->sequence_numbers_.begin();\n    while (it != nack_receiver_->sequence_numbers_.end()) {\n      int sequence_number_1 = *it;\n      ++it;\n      if (it != nack_receiver_->sequence_numbers_.end()) {\n        int sequence_number_2 = *it;\n        \/\/ Add all missing sequence numbers to list.\n        for (int i = sequence_number_1 + 1; i < sequence_number_2; ++i) {\n          missing_sequence_numbers.push_back(i);\n        }\n      }\n    }\n    int n = 0;\n    for (it = missing_sequence_numbers.begin();\n        it != missing_sequence_numbers.end(); ++it) {\n      nack_list[n++] = (*it);\n    }\n    video_module_->SendNACK(nack_list, n);\n    fake_clock.IncrementTime(33);\n    video_module_->Process();\n\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n  }\n  std::sort(nack_receiver_->sequence_numbers_.begin(),\n            nack_receiver_->sequence_numbers_.end());\n  EXPECT_EQ(kTestSequenceNumber, *(nack_receiver_->sequence_numbers_.begin()));\n  EXPECT_EQ(kTestSequenceNumber + kTestNumberOfPackets - 1,\n            *(nack_receiver_->sequence_numbers_.rbegin()));\n  EXPECT_EQ(kTestNumberOfPackets, nack_receiver_->sequence_numbers_.size());\n  EXPECT_EQ(kTestNumberOfRtxPackets, transport_->count_rtx_ssrc_);\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\/\/ Test the pollable async -> sync fetcher adapter and its callback helper\n\n#include \"net\/instaweb\/http\/public\/sync_fetcher_adapter.h\"\n\n#include <algorithm>\n\n#include \"base\/basictypes.h\"\n#include \"net\/instaweb\/http\/public\/request_headers.h\"\n#include \"net\/instaweb\/http\/public\/response_headers.h\"\n#include \"net\/instaweb\/util\/public\/google_url.h\"\n#include \"net\/instaweb\/util\/public\/gtest.h\"\n#include \"net\/instaweb\/util\/public\/mock_message_handler.h\"\n#include \"net\/instaweb\/util\/public\/mock_timer.h\"\n#include \"net\/instaweb\/util\/public\/string_writer.h\"\n#include \"net\/instaweb\/util\/public\/writer.h\"\n\nnamespace net_instaweb {\n\nnamespace {\n\nconst char kText[] = \"Result\";\nconst char kHeader[] = \"X-Test-HeaderCopy\";\n\n\/\/ Writer that should never be invoked.\nclass TrapWriter : public Writer {\n public:\n  TrapWriter() {}\n\n  virtual bool Write(const StringPiece& str, MessageHandler* message_handler) {\n    ADD_FAILURE() << \"Should not do a Write\";\n    return false;\n  }\n\n  virtual bool Flush(MessageHandler* message_handler) {\n    ADD_FAILURE() << \"Should not do a Flush\";\n    return false;\n  }\n private:\n  DISALLOW_COPY_AND_ASSIGN(TrapWriter);\n};\n\n\/\/ A pollable fetcher that writes out a response at given number of microseconds\n\/\/ elapsed, or when asked to immediately. Note that it's only capable of one\n\/\/ fetch at a time!\nclass DelayedFetcher : public UrlPollableAsyncFetcher {\n public:\n  \/\/ Note: if sim_delay <= 0, will report immediately at StreamingFetch\n  DelayedFetcher(Timer* timer, MessageHandler* handler,\n                 int64 sim_delay_ms, bool sim_success)\n      : timer_(timer), handler_(handler), sim_delay_(sim_delay_ms*1000),\n        sim_success_(sim_success) {\n    CleanFetchSettings();\n  }\n\n  virtual bool StreamingFetch(const std::string& url,\n                              const RequestHeaders& request_headers,\n                              ResponseHeaders* response_headers,\n                              Writer* response_writer,\n                              MessageHandler* message_handler,\n                              Callback* callback) {\n    CHECK(!fetch_pending_);\n    response_headers_ = response_headers;\n    response_writer_ = response_writer;\n    callback_ = callback;\n    remaining_us_ = sim_delay_;\n    fetch_pending_ = true;\n\n    if (remaining_us_ <= 0) {\n      ReportResult();\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  virtual int Poll(int64 microseconds) {\n    if (fetch_pending_) {\n      int64 delay = std::min(microseconds, remaining_us_);\n      timer_->SleepUs(delay);\n      remaining_us_ -= delay;\n\n      if (remaining_us_ <= 0) {\n        ReportResult();\n      }\n    }\n\n    return fetch_pending_ ? 1 : 0;\n  }\n\n private:\n  void CleanFetchSettings() {\n    fetch_pending_ = false;\n\n    \/\/ Defensively set active fetch variables to catch us doing something silly.\n    response_headers_ = NULL;\n    response_writer_ = NULL;\n    callback_ = NULL;\n    remaining_us_ = 0;\n  }\n\n  void ReportResult() {\n    ResponseHeaders headers;\n    if (sim_success_) {\n      response_headers_->CopyFrom(headers);\n      response_headers_->Add(kHeader, kText);\n      response_writer_->Write(kText, handler_);\n      response_writer_->Flush(handler_);\n    }\n    callback_->Done(sim_success_);\n    CleanFetchSettings();\n  }\n\n  \/\/ Simulation settings:\n  Timer* timer_;\n  MessageHandler* handler_;\n  int64 sim_delay_;  \/\/ how long till we report the result\n  bool sim_success_;  \/\/ whether to report success or failure\n\n  \/\/ Fetch session:\n  bool fetch_pending_;\n  ResponseHeaders* response_headers_;\n  Writer* response_writer_;\n  Callback* callback_;  \/\/ callback for current fetch\n  int64 remaining_us_;  \/\/ how much time left to report result of current fetch\n};\n\n}  \/\/ namespace\n\nclass SyncFetcherAdapterTest : public testing::Test {\n public:\n  SyncFetcherAdapterTest(): timer_(0) {}\n\n protected:\n  bool DoFetch(UrlFetcher* fetcher, ResponseHeaders* response_headers,\n               Writer* response_writer) {\n    return fetcher->StreamingFetchUrl(\"http:\/\/www.example.com\/\",\n                                      RequestHeaders(),\n                                      response_headers,\n                                      response_writer,\n                                      &handler_);\n  }\n\n  void TestSuccessfulFetch(UrlFetcher* fetcher) {\n    ResponseHeaders out_headers;\n    std::string out_str;\n    StringWriter out_writer(&out_str);\n    EXPECT_TRUE(DoFetch(fetcher, &out_headers, &out_writer));\n    EXPECT_EQ(kText, out_str);\n\n    CharStarVector values;\n    EXPECT_TRUE(out_headers.Lookup(kHeader, &values));\n    ASSERT_EQ(1, values.size());\n    EXPECT_EQ(std::string(kText), values[0]);\n  }\n\n  void TestFailedFetch(UrlFetcher* fetcher) {\n    ResponseHeaders out_headers;\n    TrapWriter trap_writer;\n    EXPECT_FALSE(DoFetch(fetcher, &out_headers, &trap_writer));\n  }\n\n  void TestTimeoutFetch(UrlPollableAsyncFetcher* async_fetcher,\n                        UrlFetcher* fetcher) {\n    \/\/ First let the sync fetcher tineout, and return failure.\n    TestFailedFetch(fetcher);\n\n    \/\/ Now spin until async fetcher delivers the result, to make sure\n    \/\/ we do not blow up\n    while (async_fetcher->Poll(1000) != 0) {}\n  }\n\n  MockMessageHandler handler_;\n  MockTimer timer_;\n};\n\nTEST_F(SyncFetcherAdapterTest, QuickOk) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 0, true);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestSuccessfulFetch(&sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, SlowOk) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 500, true);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestSuccessfulFetch(&sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, QuickFail) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 0, false);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestFailedFetch(&sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, SlowFail) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 500, false);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestFailedFetch(&sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, TimeoutOk) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 5000, true);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestTimeoutFetch(&async_fetcher, &sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, TimeoutFail) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 5000, false);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestTimeoutFetch(&async_fetcher, &sync_fetcher);\n}\n\n}  \/\/ namespace net_instaweb\n<commit_msg>Compilation fix for some gcc versions.<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\/\/ Test the pollable async -> sync fetcher adapter and its callback helper\n\n#include \"net\/instaweb\/http\/public\/sync_fetcher_adapter.h\"\n\n#include <algorithm>\n\n#include \"base\/basictypes.h\"\n#include \"net\/instaweb\/http\/public\/request_headers.h\"\n#include \"net\/instaweb\/http\/public\/response_headers.h\"\n#include \"net\/instaweb\/util\/public\/google_url.h\"\n#include \"net\/instaweb\/util\/public\/gtest.h\"\n#include \"net\/instaweb\/util\/public\/mock_message_handler.h\"\n#include \"net\/instaweb\/util\/public\/mock_timer.h\"\n#include \"net\/instaweb\/util\/public\/string_writer.h\"\n#include \"net\/instaweb\/util\/public\/writer.h\"\n\nnamespace net_instaweb {\n\nnamespace {\n\nconst char kText[] = \"Result\";\nconst char kHeader[] = \"X-Test-HeaderCopy\";\n\n\/\/ Writer that should never be invoked.\nclass TrapWriter : public Writer {\n public:\n  TrapWriter() {}\n\n  virtual bool Write(const StringPiece& str, MessageHandler* message_handler) {\n    ADD_FAILURE() << \"Should not do a Write\";\n    return false;\n  }\n\n  virtual bool Flush(MessageHandler* message_handler) {\n    ADD_FAILURE() << \"Should not do a Flush\";\n    return false;\n  }\n private:\n  DISALLOW_COPY_AND_ASSIGN(TrapWriter);\n};\n\n\/\/ A pollable fetcher that writes out a response at given number of microseconds\n\/\/ elapsed, or when asked to immediately. Note that it's only capable of one\n\/\/ fetch at a time!\nclass DelayedFetcher : public UrlPollableAsyncFetcher {\n public:\n  \/\/ Note: if sim_delay <= 0, will report immediately at StreamingFetch\n  DelayedFetcher(Timer* timer, MessageHandler* handler,\n                 int64 sim_delay_ms, bool sim_success)\n      : timer_(timer), handler_(handler), sim_delay_(sim_delay_ms*1000),\n        sim_success_(sim_success) {\n    CleanFetchSettings();\n  }\n\n  virtual bool StreamingFetch(const std::string& url,\n                              const RequestHeaders& request_headers,\n                              ResponseHeaders* response_headers,\n                              Writer* response_writer,\n                              MessageHandler* message_handler,\n                              Callback* callback) {\n    CHECK(!fetch_pending_);\n    response_headers_ = response_headers;\n    response_writer_ = response_writer;\n    callback_ = callback;\n    remaining_us_ = sim_delay_;\n    fetch_pending_ = true;\n\n    if (remaining_us_ <= 0) {\n      ReportResult();\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  virtual int Poll(int64 microseconds) {\n    if (fetch_pending_) {\n      int64 delay = std::min(microseconds, remaining_us_);\n      timer_->SleepUs(delay);\n      remaining_us_ -= delay;\n\n      if (remaining_us_ <= 0) {\n        ReportResult();\n      }\n    }\n\n    return fetch_pending_ ? 1 : 0;\n  }\n\n private:\n  void CleanFetchSettings() {\n    fetch_pending_ = false;\n\n    \/\/ Defensively set active fetch variables to catch us doing something silly.\n    response_headers_ = NULL;\n    response_writer_ = NULL;\n    callback_ = NULL;\n    remaining_us_ = 0;\n  }\n\n  void ReportResult() {\n    ResponseHeaders headers;\n    if (sim_success_) {\n      response_headers_->CopyFrom(headers);\n      response_headers_->Add(kHeader, kText);\n      response_writer_->Write(kText, handler_);\n      response_writer_->Flush(handler_);\n    }\n    callback_->Done(sim_success_);\n    CleanFetchSettings();\n  }\n\n  \/\/ Simulation settings:\n  Timer* timer_;\n  MessageHandler* handler_;\n  int64 sim_delay_;  \/\/ how long till we report the result\n  bool sim_success_;  \/\/ whether to report success or failure\n\n  \/\/ Fetch session:\n  bool fetch_pending_;\n  ResponseHeaders* response_headers_;\n  Writer* response_writer_;\n  Callback* callback_;  \/\/ callback for current fetch\n  int64 remaining_us_;  \/\/ how much time left to report result of current fetch\n};\n\n}  \/\/ namespace\n\nclass SyncFetcherAdapterTest : public testing::Test {\n public:\n  SyncFetcherAdapterTest(): timer_(0) {}\n\n protected:\n  bool DoFetch(UrlFetcher* fetcher, ResponseHeaders* response_headers,\n               Writer* response_writer) {\n    RequestHeaders request_headers;\n    return fetcher->StreamingFetchUrl(\"http:\/\/www.example.com\/\",\n                                      request_headers,\n                                      response_headers,\n                                      response_writer,\n                                      &handler_);\n  }\n\n  void TestSuccessfulFetch(UrlFetcher* fetcher) {\n    ResponseHeaders out_headers;\n    std::string out_str;\n    StringWriter out_writer(&out_str);\n    EXPECT_TRUE(DoFetch(fetcher, &out_headers, &out_writer));\n    EXPECT_EQ(kText, out_str);\n\n    CharStarVector values;\n    EXPECT_TRUE(out_headers.Lookup(kHeader, &values));\n    ASSERT_EQ(1, values.size());\n    EXPECT_EQ(std::string(kText), values[0]);\n  }\n\n  void TestFailedFetch(UrlFetcher* fetcher) {\n    ResponseHeaders out_headers;\n    TrapWriter trap_writer;\n    EXPECT_FALSE(DoFetch(fetcher, &out_headers, &trap_writer));\n  }\n\n  void TestTimeoutFetch(UrlPollableAsyncFetcher* async_fetcher,\n                        UrlFetcher* fetcher) {\n    \/\/ First let the sync fetcher tineout, and return failure.\n    TestFailedFetch(fetcher);\n\n    \/\/ Now spin until async fetcher delivers the result, to make sure\n    \/\/ we do not blow up\n    while (async_fetcher->Poll(1000) != 0) {}\n  }\n\n  MockMessageHandler handler_;\n  MockTimer timer_;\n};\n\nTEST_F(SyncFetcherAdapterTest, QuickOk) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 0, true);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestSuccessfulFetch(&sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, SlowOk) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 500, true);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestSuccessfulFetch(&sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, QuickFail) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 0, false);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestFailedFetch(&sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, SlowFail) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 500, false);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestFailedFetch(&sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, TimeoutOk) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 5000, true);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestTimeoutFetch(&async_fetcher, &sync_fetcher);\n}\n\nTEST_F(SyncFetcherAdapterTest, TimeoutFail) {\n  DelayedFetcher async_fetcher(&timer_, &handler_, 5000, false);\n  SyncFetcherAdapter sync_fetcher(&timer_, 1000, &async_fetcher);\n  TestTimeoutFetch(&async_fetcher, &sync_fetcher);\n}\n\n}  \/\/ namespace net_instaweb\n<|endoftext|>"}
{"text":"<commit_before>#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n\n#include \"ESRIShape.h\"\n#include \"ESRIShapeParser.h\"\n\nclass ESRIShapeReaderWriter : public osgDB::ReaderWriter\n{\n    public:\n        ESRIShapeReaderWriter() {}\n\n        virtual const char* className() { return \"ESRI Shape ReaderWriter\"; }\n        \n        virtual bool acceptsExtension(const std::string& extension) const\n        {\n            return osgDB::equalCaseInsensitive(extension,\"shp\");\n        }\n\n        virtual ReadResult readObject(const std::string& fileName, const Options* opt) const\n        { return readNode(fileName,opt); }\n\n        virtual ReadResult readNode(const std::string& fileName, const Options* ) const\n        {\n            std::string ext = osgDB::getFileExtension(fileName);\n            if (!acceptsExtension(ext)) \n                return ReadResult::FILE_NOT_HANDLED;\n\n            ESRIShape::ESRIShapeParser sp(fileName);\n            return sp.getGeode();\n        }\n\n    private:\n};\n\nosgDB::RegisterReaderWriterProxy<ESRIShapeReaderWriter> g_esriShapeReaderWriter_Proxy;\n\n<commit_msg>Added file search path to ESRI reader.<commit_after>#include <osgDB\/FileNameUtils>\n#include <osgDB\/FileUtils>\n#include <osgDB\/Registry>\n\n#include \"ESRIShape.h\"\n#include \"ESRIShapeParser.h\"\n\nclass ESRIShapeReaderWriter : public osgDB::ReaderWriter\n{\n    public:\n        ESRIShapeReaderWriter() {}\n\n        virtual const char* className() { return \"ESRI Shape ReaderWriter\"; }\n        \n        virtual bool acceptsExtension(const std::string& extension) const\n        {\n            return osgDB::equalCaseInsensitive(extension,\"shp\");\n        }\n\n        virtual ReadResult readObject(const std::string& fileName, const Options* opt) const\n        { return readNode(fileName,opt); }\n\n        virtual ReadResult readNode(const std::string& file, const Options* options) const\n        {\n            std::string ext = osgDB::getFileExtension(file);\n            if (!acceptsExtension(ext)) \n                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            ESRIShape::ESRIShapeParser sp(fileName);\n            return sp.getGeode();\n        }\n\n    private:\n};\n\nosgDB::RegisterReaderWriterProxy<ESRIShapeReaderWriter> g_esriShapeReaderWriter_Proxy;\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/..\/SDP_Solver.hxx\"\n\n\/\/ dualResidues[p] = primalObjective[p] - Tr(A_p Y) - (FreeVarMatrix y)_p,\n\/\/ for 0 <= p < primalObjective.size()\n\/\/\n\/\/ The pairings Tr(A_p Y) can be written in terms of BilinearPairingsY:\n\/\/\n\/\/   Tr(A_(j,r,s,k) Y) = \\sum_{b \\in blocks[j]}\n\/\/                       (1\/2) (BilinearPairingsY_{ej r + k, ej s + k} +\n\/\/                              swap (r <-> s))\n\/\/ where ej = d_j + 1.\n\/\/\n\/\/ Inputs: sdp, y, BilinearPairingsY\n\/\/ Output: dualResidues (overwriten)\n\/\/\nvoid compute_dual_residues(const Block_Info &block_info, const SDP &sdp,\n                           const Block_Vector &y,\n                           const Block_Diagonal_Matrix &bilinear_pairings_Y,\n                           Block_Vector &dual_residues)\n{\n  auto dual_residues_block(dual_residues.blocks.begin());\n  auto primal_objective_c_block(sdp.primal_objective_c.blocks.begin());\n  auto y_block(y.blocks.begin());\n  auto free_var_matrix_block(sdp.free_var_matrix.blocks.begin());\n  auto bilinear_pairings_Y_block(bilinear_pairings_Y.blocks.begin());\n  \/\/ dualResidues[p] = -Tr(A_p Y)\n  for(auto &block_index : block_info.block_indices)\n    {\n      Zero(*dual_residues_block);\n      const size_t block_size(block_info.degrees[block_index] + 1);\n\n      \/\/ Not sure whether it is better to first loop over blocks in\n      \/\/ the result or over sub-blocks in bilinear_pairings_Y\n      for(size_t bb = 2 * block_index; bb < 2 * block_index + 2; ++bb)\n        {\n          for(size_t column_block = 0;\n              column_block < block_info.dimensions[block_index];\n              ++column_block)\n            for(size_t row_block = 0; row_block <= column_block; ++row_block)\n              {\n                size_t column_offset(column_block * block_size),\n                  row_offset(row_block * block_size);\n\n                El::DistMatrix<El::BigFloat> lower_diagonal(El::GetDiagonal(\n                  El::LockedView(*bilinear_pairings_Y_block, row_offset,\n                                 column_offset, block_size, block_size))),\n                  upper_diagonal(El::GetDiagonal(\n                    El::LockedView(*bilinear_pairings_Y_block, column_offset,\n                                   row_offset, block_size, block_size)));\n\n                size_t residue_row_offset(\n                  ((column_block * (column_block + 1)) \/ 2 + row_block)\n                  * block_size);\n\n                El::DistMatrix<El::BigFloat> residue_sub_block(El::View(\n                  *dual_residues_block, residue_row_offset, 0, block_size, 1));\n\n                \/\/ FIXME: This does twice as much work as needed when\n                \/\/ column_block==row_block.\n                El::Axpy(El::BigFloat(-0.5), lower_diagonal,\n                         residue_sub_block);\n                El::Axpy(El::BigFloat(-0.5), upper_diagonal,\n                         residue_sub_block);\n              }\n          ++bilinear_pairings_Y_block;\n        }\n      \/\/ dualResidues -= FreeVarMatrix * y\n      Gemm(El::Orientation::NORMAL, El::Orientation::NORMAL, El::BigFloat(-1),\n           *free_var_matrix_block, *y_block, El::BigFloat(1),\n           *dual_residues_block);\n      \/\/ dualResidues += primalObjective\n      Axpy(El::BigFloat(1), *primal_objective_c_block, *dual_residues_block);\n\n      ++primal_objective_c_block;\n      ++y_block;\n      ++free_var_matrix_block;\n      ++dual_residues_block;\n    }\n}\n<commit_msg>Optimize compute_dual_residues a little<commit_after>#include \"..\/..\/SDP_Solver.hxx\"\n\n\/\/ dualResidues[p] = primalObjective[p] - Tr(A_p Y) - (FreeVarMatrix y)_p,\n\/\/ for 0 <= p < primalObjective.size()\n\/\/\n\/\/ The pairings Tr(A_p Y) can be written in terms of BilinearPairingsY:\n\/\/\n\/\/   Tr(A_(j,r,s,k) Y) = \\sum_{b \\in blocks[j]}\n\/\/                       (1\/2) (BilinearPairingsY_{ej r + k, ej s + k} +\n\/\/                              swap (r <-> s))\n\/\/ where ej = d_j + 1.\n\/\/\n\/\/ Inputs: sdp, y, BilinearPairingsY\n\/\/ Output: dualResidues (overwriten)\n\/\/\nvoid compute_dual_residues(const Block_Info &block_info, const SDP &sdp,\n                           const Block_Vector &y,\n                           const Block_Diagonal_Matrix &bilinear_pairings_Y,\n                           Block_Vector &dual_residues)\n{\n  auto dual_residues_block(dual_residues.blocks.begin());\n  auto primal_objective_c_block(sdp.primal_objective_c.blocks.begin());\n  auto y_block(y.blocks.begin());\n  auto free_var_matrix_block(sdp.free_var_matrix.blocks.begin());\n  auto bilinear_pairings_Y_block(bilinear_pairings_Y.blocks.begin());\n  \/\/ dualResidues[p] = -Tr(A_p Y)\n  for(auto &block_index : block_info.block_indices)\n    {\n      Zero(*dual_residues_block);\n      const size_t block_size(block_info.degrees[block_index] + 1);\n\n      \/\/ Not sure whether it is better to first loop over blocks in\n      \/\/ the result or over sub-blocks in bilinear_pairings_Y\n      for(size_t bb = 2 * block_index; bb < 2 * block_index + 2; ++bb)\n        {\n          for(size_t column_block = 0;\n              column_block < block_info.dimensions[block_index];\n              ++column_block)\n            for(size_t row_block = 0; row_block <= column_block; ++row_block)\n              {\n                size_t column_offset(column_block * block_size),\n                  row_offset(row_block * block_size);\n\n                El::DistMatrix<El::BigFloat> lower_diagonal(El::GetDiagonal(\n                  El::LockedView(*bilinear_pairings_Y_block, row_offset,\n                                 column_offset, block_size, block_size)));\n\n                size_t residue_row_offset(\n                  ((column_block * (column_block + 1)) \/ 2 + row_block)\n                  * block_size);\n\n                El::DistMatrix<El::BigFloat> residue_sub_block(El::View(\n                  *dual_residues_block, residue_row_offset, 0, block_size, 1));\n\n                \/\/ Do a little less work when on a diagonal block.\n                if(column_offset == row_offset)\n                  {\n                    El::Axpy(El::BigFloat(-1.0), lower_diagonal,\n                             residue_sub_block);\n                  }\n                else\n                  {\n                    El::Axpy(El::BigFloat(-0.5), lower_diagonal,\n                             residue_sub_block);\n\n                    El::DistMatrix<El::BigFloat> upper_diagonal(\n                      El::GetDiagonal(El::LockedView(\n                        *bilinear_pairings_Y_block, column_offset, row_offset,\n                        block_size, block_size)));\n\n                    El::Axpy(El::BigFloat(-0.5), upper_diagonal,\n                             residue_sub_block);\n                  }\n              }\n          ++bilinear_pairings_Y_block;\n        }\n      \/\/ dualResidues -= FreeVarMatrix * y\n      Gemm(El::Orientation::NORMAL, El::Orientation::NORMAL, El::BigFloat(-1),\n           *free_var_matrix_block, *y_block, El::BigFloat(1),\n           *dual_residues_block);\n      \/\/ dualResidues += primalObjective\n      Axpy(El::BigFloat(1), *primal_objective_c_block, *dual_residues_block);\n\n      ++primal_objective_c_block;\n      ++y_block;\n      ++free_var_matrix_block;\n      ++dual_residues_block;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2021 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\/kernels\/internal\/reference\/batch_to_space_nd.h\"\n\n#include \"tensorflow\/lite\/c\/common.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\/micro_utils.h\"\n\nnamespace tflite {\n\nnamespace {\n\nconstexpr int kInputTensor = 0;\nconstexpr int kBlockShapeTensor = 1;\nconstexpr int kCropsTensor = 2;\nconstexpr int kOutputTensor = 0;\n\n\/\/ Currently, only 3D NHC and 4D NHWC input\/output op_context are supported.\n\/\/ In case of 3D input, it will be extended to 3D NHWC by adding W=1.\n\/\/ The 4D array need to have exactly 2 spatial dimensions.\n\/\/ TODO(b\/149952582): Support arbitrary dimension in SpaceToBatchND.\nconst int kInputOutputMinDimensionNum = 3;\nconst int kInputOutputMaxDimensionNum = 4;\n\nTfLiteStatus Prepare(TfLiteContext* context, TfLiteNode* node) {\n  TF_LITE_ENSURE_EQ(context, NumInputs(node), 3);\n  TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n\n  const TfLiteTensor* input = GetInput(context, node, kInputTensor);\n  TfLiteTensor* output = GetOutput(context, node, kOutputTensor);\n  TF_LITE_ENSURE(context, input != nullptr && output != nullptr);\n\n  TF_LITE_ENSURE(context, NumDimensions(input) >= kInputOutputMinDimensionNum);\n  TF_LITE_ENSURE(context, NumDimensions(output) >= kInputOutputMinDimensionNum);\n  TF_LITE_ENSURE(context, NumDimensions(input) <= kInputOutputMaxDimensionNum);\n  TF_LITE_ENSURE(context, NumDimensions(output) <= kInputOutputMaxDimensionNum);\n  TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n\n  \/\/ Padding can result in a larger output than input.\n  TF_LITE_ENSURE(context,\n                 ElementCount(*output->dims) >= ElementCount(*input->dims));\n\n  return kTfLiteOk;\n}\n\nTfLiteStatus Eval(TfLiteContext* context, TfLiteNode* node) {\n  const TfLiteEvalTensor* input =\n      tflite::micro::GetEvalInput(context, node, kInputTensor);\n  const TfLiteEvalTensor* block_shape =\n      tflite::micro::GetEvalInput(context, node, kBlockShapeTensor);\n  const TfLiteEvalTensor* crops =\n      tflite::micro::GetEvalInput(context, node, kCropsTensor);\n  TfLiteEvalTensor* output =\n      tflite::micro::GetEvalOutput(context, node, kOutputTensor);\n\n  switch (input->type) {  \/\/ Already know in\/out types are same.\n    case kTfLiteFloat32:\n      reference_ops::BatchToSpaceND(\n          tflite::micro::GetTensorShape(input),\n          tflite::micro::GetTensorData<float>(input),\n          tflite::micro::GetTensorShape(block_shape),\n          tflite::micro::GetTensorData<int32_t>(block_shape),\n          tflite::micro::GetTensorShape(crops),\n          tflite::micro::GetTensorData<int32_t>(crops),\n          tflite::micro::GetTensorShape(output),\n          tflite::micro::GetTensorData<float>(output));\n      break;\n    case kTfLiteInt8:\n      reference_ops::BatchToSpaceND(\n          tflite::micro::GetTensorShape(input),\n          tflite::micro::GetTensorData<int8_t>(input),\n          tflite::micro::GetTensorShape(block_shape),\n          tflite::micro::GetTensorData<int32_t>(block_shape),\n          tflite::micro::GetTensorShape(crops),\n          tflite::micro::GetTensorData<int32_t>(crops),\n          tflite::micro::GetTensorShape(output),\n          tflite::micro::GetTensorData<int8_t>(output));\n      break;\n    default:\n      TF_LITE_KERNEL_LOG(context, \"Type %s (%d) not supported.\",\n                         TfLiteTypeGetName(input->type), input->type);\n      return kTfLiteError;\n  }\n  return kTfLiteOk;\n}\n\n}  \/\/ namespace.\n\nTfLiteRegistration Register_BATCH_TO_SPACE_ND() {\n  return {\/*init=*\/nullptr,\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>Fixed ensure criterion<commit_after>\/* Copyright 2021 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\/kernels\/internal\/reference\/batch_to_space_nd.h\"\n\n#include \"tensorflow\/lite\/c\/common.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\/micro_utils.h\"\n\nnamespace tflite {\n\nnamespace {\n\nconstexpr int kInputTensor = 0;\nconstexpr int kBlockShapeTensor = 1;\nconstexpr int kCropsTensor = 2;\nconstexpr int kOutputTensor = 0;\n\n\/\/ Currently, only 3D NHC and 4D NHWC input\/output op_context are supported.\n\/\/ In case of 3D input, it will be extended to 3D NHWC by adding W=1.\n\/\/ The 4D array need to have exactly 2 spatial dimensions.\n\/\/ TODO(b\/149952582): Support arbitrary dimension in SpaceToBatchND.\nconst int kInputOutputMinDimensionNum = 3;\nconst int kInputOutputMaxDimensionNum = 4;\n\nTfLiteStatus Prepare(TfLiteContext* context, TfLiteNode* node) {\n  TF_LITE_ENSURE_EQ(context, NumInputs(node), 3);\n  TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n\n  const TfLiteTensor* input = GetInput(context, node, kInputTensor);\n  TfLiteTensor* output = GetOutput(context, node, kOutputTensor);\n  TF_LITE_ENSURE(context, input != nullptr && output != nullptr);\n\n  TF_LITE_ENSURE(context, NumDimensions(input) >= kInputOutputMinDimensionNum);\n  TF_LITE_ENSURE(context, NumDimensions(output) >= kInputOutputMinDimensionNum);\n  TF_LITE_ENSURE(context, NumDimensions(input) <= kInputOutputMaxDimensionNum);\n  TF_LITE_ENSURE(context, NumDimensions(output) <= kInputOutputMaxDimensionNum);\n  TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n\n  \/\/ Padding can result in a larger output than input.\n  TF_LITE_ENSURE(context,\n                 ElementCount(*output->dims) <= ElementCount(*input->dims));\n\n  return kTfLiteOk;\n}\n\nTfLiteStatus Eval(TfLiteContext* context, TfLiteNode* node) {\n  const TfLiteEvalTensor* input =\n      tflite::micro::GetEvalInput(context, node, kInputTensor);\n  const TfLiteEvalTensor* block_shape =\n      tflite::micro::GetEvalInput(context, node, kBlockShapeTensor);\n  const TfLiteEvalTensor* crops =\n      tflite::micro::GetEvalInput(context, node, kCropsTensor);\n  TfLiteEvalTensor* output =\n      tflite::micro::GetEvalOutput(context, node, kOutputTensor);\n\n  switch (input->type) {  \/\/ Already know in\/out types are same.\n    case kTfLiteFloat32:\n      reference_ops::BatchToSpaceND(\n          tflite::micro::GetTensorShape(input),\n          tflite::micro::GetTensorData<float>(input),\n          tflite::micro::GetTensorShape(block_shape),\n          tflite::micro::GetTensorData<int32_t>(block_shape),\n          tflite::micro::GetTensorShape(crops),\n          tflite::micro::GetTensorData<int32_t>(crops),\n          tflite::micro::GetTensorShape(output),\n          tflite::micro::GetTensorData<float>(output));\n      break;\n    case kTfLiteInt8:\n      reference_ops::BatchToSpaceND(\n          tflite::micro::GetTensorShape(input),\n          tflite::micro::GetTensorData<int8_t>(input),\n          tflite::micro::GetTensorShape(block_shape),\n          tflite::micro::GetTensorData<int32_t>(block_shape),\n          tflite::micro::GetTensorShape(crops),\n          tflite::micro::GetTensorData<int32_t>(crops),\n          tflite::micro::GetTensorShape(output),\n          tflite::micro::GetTensorData<int8_t>(output));\n      break;\n    default:\n      TF_LITE_KERNEL_LOG(context, \"Type %s (%d) not supported.\",\n                         TfLiteTypeGetName(input->type), input->type);\n      return kTfLiteError;\n  }\n  return kTfLiteOk;\n}\n\n}  \/\/ namespace.\n\nTfLiteRegistration Register_BATCH_TO_SPACE_ND() {\n  return {\/*init=*\/nullptr,\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 Copyright (c) 2010, The Barbarian Group\n All rights reserved.\n\n Copyright (c) Microsoft Open Technologies, Inc. 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\n    * Redistributions of source code must retain the above copyright notice, this list of conditions and\n\tthe following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n\tthe following disclaimer in the documentation and\/or other materials provided with the distribution.\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 HOLDER OR CONTRIBUTORS BE LIABLE FOR\n ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n TO, 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#include \"cinder\/msw\/CinderMsw.h\"\n#include \"cinder\/ip\/Fill.h\"\n#include \"cinder\/Exception.h\"\n\n#include <vector>\n\n#if ! defined( CINDER_WINRT ) && ( _MSC_VER < 1900 )\n#include <boost\/thread\/tss.hpp>\n#endif\n\nnamespace cinder { namespace msw {\n\n#if !defined( CINDER_WINRT )\nSurface8uRef convertHBitmap( HBITMAP hbitmap )\n{\n\t\/\/ create a temporary DC\n\tHDC hdc = ::CreateCompatibleDC( 0 );\n\t\n\t\/\/ determine the dimensions first\n\tBITMAP bm;\n\t::GetObject( hbitmap, sizeof(BITMAP), &bm );\n\t\n\tBITMAPINFO bmi;\n\tmemset( &bmi, 0, sizeof(BITMAPINFO) );\n\tbmi.bmiHeader.biSize = sizeof(BITMAPINFOHEADER);\n\tbmi.bmiHeader.biHeight = -bm.bmHeight;\n\tbmi.bmiHeader.biWidth = bm.bmWidth;\n\tbmi.bmiHeader.biPlanes = 1;\n\tbmi.bmiHeader.biBitCount = 32;\n\tbmi.bmiHeader.biCompression = BI_RGB;\n\tbmi.bmiHeader.biSizeImage = 0;\n\tbmi.bmiHeader.biXPelsPerMeter = 0;\n\tbmi.bmiHeader.biYPelsPerMeter = 0;\n\tbmi.bmiHeader.biClrUsed = 0;\n\tbmi.bmiHeader.biClrImportant = 0;\n\n\tint width = bmi.bmiHeader.biWidth;\n\tint height = -bmi.bmiHeader.biHeight;\n\n\t\/\/ allocate enough space to hold the result\n\t\/\/ We use GlobalAlloc \/ GlobalFree to ensure 8-byte alignment\n\tDWORD dwBmpSize = ((width * 32 + 31) \/ 32) * 4 * height;\n\tuint8_t *data = reinterpret_cast<uint8_t*>( ::GlobalAlloc( GMEM_FIXED, dwBmpSize ) );\n\tSurface8u *newSurface = new Surface8u( data, width, height, width * 4, SurfaceChannelOrder::BGRX );\n\tSurface8uRef result( newSurface, [=] ( Surface8u *s ) { ::GlobalFree( (HGLOBAL)data ); delete s; } );\n\t\/\/ have the Surface's destructor call this to call ::GlobalFree\n\t\n\tif( ::GetDIBits( hdc, hbitmap, 0, height, result->getData(), &bmi, DIB_RGB_COLORS ) == 0 )\n\t\tthrow Exception( \"Invalid HBITMAP\" );\n\t\n\t::ReleaseDC( NULL, hdc );\n\n\treturn result;\n}\n#endif\n\nvoid ComDelete( void *p )\n{\n\tif( p ) {\n\t\tIUnknown *unknown = reinterpret_cast<IUnknown*>( p );\n\t\tunknown->Release();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComOStream\n\nHRESULT STDMETHODCALLTYPE ComOStream::QueryInterface(REFIID iid, void ** ppvObject)\n{ \n    if (iid == __uuidof(IUnknown)\n        || iid == __uuidof(IStream)\n        || iid == __uuidof(ISequentialStream))\n    {\n        *ppvObject = static_cast<IStream*>(this);\n        AddRef();\n        return S_OK;\n    }\n    else\n        return E_NOINTERFACE; \n}\n\nULONG STDMETHODCALLTYPE ComOStream::AddRef() \n{ \n    return (ULONG)InterlockedIncrement(&_refcount); \n}\n\nULONG STDMETHODCALLTYPE ComOStream::Release() \n{\n    ULONG res = (ULONG) InterlockedDecrement(&_refcount);\n    if (res == 0) \n        delete this;\n    return res;\n}\n\nHRESULT STDMETHODCALLTYPE ComOStream::Write( void const* pv, ULONG cb, ULONG* pcbWritten )\n{\n\tmOStream->writeData( pv, cb );\n\t*pcbWritten = cb;\n    return S_OK;\n}\n\nHRESULT STDMETHODCALLTYPE ComOStream::Seek( LARGE_INTEGER liDistanceToMove, DWORD dwOrigin, ULARGE_INTEGER* lpNewFilePointer )\n{ \n\tswitch( dwOrigin ) {\n\t\tcase STREAM_SEEK_SET:\n\t\t\tmOStream->seekAbsolute( (off_t)liDistanceToMove.QuadPart );\n\t\tbreak;\n\t\tcase STREAM_SEEK_CUR:\n\t\t\tmOStream->seekRelative( (off_t)liDistanceToMove.QuadPart );\n\t\tbreak;\n\t\tcase STREAM_SEEK_END:\n\t\t\tmOStream->seekAbsolute( (off_t)(-liDistanceToMove.QuadPart) );\n\t\tbreak;\n\t\tdefault:   \n\t\t\treturn STG_E_INVALIDFUNCTION;\n\t\tbreak;\n\t}\n\n\tlpNewFilePointer->QuadPart = mOStream->tell();\n\n\treturn S_OK;\n}\n\nstd::wstring toWideString( const std::string &utf8String )\n{\n\tint wideSize = ::MultiByteToWideChar( CP_UTF8, 0, utf8String.c_str(), -1, NULL, 0 );\n\tif( wideSize == ERROR_NO_UNICODE_TRANSLATION ) {\n\t\tthrow Exception( \"Invalid UTF-8 sequence.\" );\n\t}\n\telse if( wideSize == 0 ) {\n\t\tthrow Exception( \"Error in UTF-8 to UTF-16 conversion.\" );\n\t}\n\n\tstd::vector<wchar_t> resultString( wideSize );\n\tint convResult = ::MultiByteToWideChar( CP_UTF8, 0, utf8String.c_str(), -1, &resultString[0], wideSize );\n\tif( convResult != wideSize ) {\n\t\tthrow Exception( \"Error in UTF-8 to UTF-16 conversion.\" );\n\t}\n\n\treturn std::wstring( &resultString[0] );\n}\n\nstd::string toUtf8String( const std::wstring &wideString )\n{\n\tint utf8Size = ::WideCharToMultiByte( CP_UTF8, 0, wideString.c_str(), -1, NULL, 0, NULL, NULL );\n\tif( utf8Size == 0 ) {\n\t\tthrow Exception( \"Error in UTF-16 to UTF-8 conversion.\" );\n\t}\n\n\tstd::vector<char> resultString( utf8Size );\n\n\tint convResult = ::WideCharToMultiByte( CP_UTF8, 0, wideString.c_str(), -1, &resultString[0], utf8Size, NULL, NULL );\n\n\tif( convResult != utf8Size ) {\n\t\tthrow Exception( \"Error in UTF-16 to UTF-8 conversion.\" );\n\t}\n\n\treturn std::string( &resultString[0] );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComIStream\n\nHRESULT STDMETHODCALLTYPE ComIStream::QueryInterface(REFIID iid, void ** ppvObject)\n{ \n\tif (iid == __uuidof(IUnknown)\n\t\t|| iid == __uuidof(IStream)\n\t\t|| iid == __uuidof(ISequentialStream))\n\t{\n\t\t*ppvObject = static_cast<IStream*>(this);\n\t\tAddRef();\n\t\treturn S_OK;\n\t}\n\telse\n\t\treturn E_NOINTERFACE; \n}\n\nULONG STDMETHODCALLTYPE ComIStream::AddRef() \n{ \n\treturn (ULONG)InterlockedIncrement(&_refcount); \n}\n\nULONG STDMETHODCALLTYPE ComIStream::Release() \n{\n\tULONG res = (ULONG) InterlockedDecrement(&_refcount);\n\tif (res == 0) \n\t\tdelete this;\n\treturn res;\n}\n\nHRESULT STDMETHODCALLTYPE ComIStream::Read( void* pv, ULONG cb, ULONG* pcbRead )\n{\n\tULONG dataLeft = mIStream->size() - mIStream->tell();\n\tif( dataLeft < cb ) {\n\t\tmIStream->readData( pv, dataLeft );\n\t\t*pcbRead = dataLeft;\n\t\treturn S_FALSE;\n\t}\n\telse {\n\t\tmIStream->readData( pv, cb );\n\t\t*pcbRead = cb;\n\t\treturn S_OK;\n\t}\n}\n\nHRESULT STDMETHODCALLTYPE ComIStream::Seek( LARGE_INTEGER liDistanceToMove, DWORD dwOrigin, ULARGE_INTEGER* lpNewFilePointer )\n{ \n\tswitch( dwOrigin ) {\n\tcase STREAM_SEEK_SET:\n\t\tmIStream->seekAbsolute( (off_t)liDistanceToMove.QuadPart );\n\t\tbreak;\n\tcase STREAM_SEEK_CUR:\n\t\tmIStream->seekRelative( (off_t)liDistanceToMove.QuadPart );\n\t\tbreak;\n\tcase STREAM_SEEK_END:\n\t\tmIStream->seekAbsolute( (off_t)( - liDistanceToMove.QuadPart ) );\n\t\tbreak;\n\tdefault:   \n\t\treturn STG_E_INVALIDFUNCTION;\n\t\tbreak;\n\t}\n\toff_t pos = mIStream->tell();\n\tif( lpNewFilePointer )\n\t\tlpNewFilePointer->QuadPart = pos;\n\n\treturn S_OK;\n}\n\nHRESULT STDMETHODCALLTYPE ComIStream::Stat( STATSTG* pStatstg, DWORD grfStatFlag)\n{\n\tpStatstg->pwcsName = NULL;\n\tpStatstg->cbSize.QuadPart = (ULONGLONG)mIStream->size();\n\n\treturn S_OK;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComInitializer\n\nstruct ComInitializer {\n\tComInitializer( DWORD params ) {\n\t\t::CoInitializeEx( NULL, params );\n\t}\n\n\t~ComInitializer()\n\t{\n\t\t::CoUninitialize();\n\t}\n};\n\n#if defined( CINDER_WINRT )\n\nvoid initializeCom( DWORD params )\n{\n\t::CoInitializeEx( NULL, params );\n}\n#elif ( _MSC_VER >= 1900 )\nthread_local ComInitializer *threadComInitializer = nullptr;\n\nvoid initializeCom(DWORD params)\n{\n\tif( ! threadComInitializer )\n\t\tthreadComInitializer = new ComInitializer(params);\n}\n#else\nboost::thread_specific_ptr<ComInitializer> threadComInitializer;\n\nvoid initializeCom( DWORD params )\n{\n\tif( threadComInitializer.get() == NULL )\n\t\tthreadComInitializer.reset( new ComInitializer( params ) );\n}\n#endif\n\n} } \/\/ namespace cinder::msw\n<commit_msg>Removing CinderMsw.cpp dependency on Boost.thread<commit_after>\/*\n Copyright (c) 2010, The Barbarian Group\n All rights reserved.\n\n Copyright (c) Microsoft Open Technologies, Inc. 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\n    * Redistributions of source code must retain the above copyright notice, this list of conditions and\n\tthe following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n\tthe following disclaimer in the documentation and\/or other materials provided with the distribution.\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 HOLDER OR CONTRIBUTORS BE LIABLE FOR\n ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n TO, 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#include \"cinder\/msw\/CinderMsw.h\"\n#include \"cinder\/ip\/Fill.h\"\n#include \"cinder\/Exception.h\"\n\n#include <vector>\n\nnamespace cinder { namespace msw {\n\n#if !defined( CINDER_WINRT )\nSurface8uRef convertHBitmap( HBITMAP hbitmap )\n{\n\t\/\/ create a temporary DC\n\tHDC hdc = ::CreateCompatibleDC( 0 );\n\t\n\t\/\/ determine the dimensions first\n\tBITMAP bm;\n\t::GetObject( hbitmap, sizeof(BITMAP), &bm );\n\t\n\tBITMAPINFO bmi;\n\tmemset( &bmi, 0, sizeof(BITMAPINFO) );\n\tbmi.bmiHeader.biSize = sizeof(BITMAPINFOHEADER);\n\tbmi.bmiHeader.biHeight = -bm.bmHeight;\n\tbmi.bmiHeader.biWidth = bm.bmWidth;\n\tbmi.bmiHeader.biPlanes = 1;\n\tbmi.bmiHeader.biBitCount = 32;\n\tbmi.bmiHeader.biCompression = BI_RGB;\n\tbmi.bmiHeader.biSizeImage = 0;\n\tbmi.bmiHeader.biXPelsPerMeter = 0;\n\tbmi.bmiHeader.biYPelsPerMeter = 0;\n\tbmi.bmiHeader.biClrUsed = 0;\n\tbmi.bmiHeader.biClrImportant = 0;\n\n\tint width = bmi.bmiHeader.biWidth;\n\tint height = -bmi.bmiHeader.biHeight;\n\n\t\/\/ allocate enough space to hold the result\n\t\/\/ We use GlobalAlloc \/ GlobalFree to ensure 8-byte alignment\n\tDWORD dwBmpSize = ((width * 32 + 31) \/ 32) * 4 * height;\n\tuint8_t *data = reinterpret_cast<uint8_t*>( ::GlobalAlloc( GMEM_FIXED, dwBmpSize ) );\n\tSurface8u *newSurface = new Surface8u( data, width, height, width * 4, SurfaceChannelOrder::BGRX );\n\tSurface8uRef result( newSurface, [=] ( Surface8u *s ) { ::GlobalFree( (HGLOBAL)data ); delete s; } );\n\t\/\/ have the Surface's destructor call this to call ::GlobalFree\n\t\n\tif( ::GetDIBits( hdc, hbitmap, 0, height, result->getData(), &bmi, DIB_RGB_COLORS ) == 0 )\n\t\tthrow Exception( \"Invalid HBITMAP\" );\n\t\n\t::ReleaseDC( NULL, hdc );\n\n\treturn result;\n}\n#endif\n\nvoid ComDelete( void *p )\n{\n\tif( p ) {\n\t\tIUnknown *unknown = reinterpret_cast<IUnknown*>( p );\n\t\tunknown->Release();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComOStream\n\nHRESULT STDMETHODCALLTYPE ComOStream::QueryInterface(REFIID iid, void ** ppvObject)\n{ \n    if (iid == __uuidof(IUnknown)\n        || iid == __uuidof(IStream)\n        || iid == __uuidof(ISequentialStream))\n    {\n        *ppvObject = static_cast<IStream*>(this);\n        AddRef();\n        return S_OK;\n    }\n    else\n        return E_NOINTERFACE; \n}\n\nULONG STDMETHODCALLTYPE ComOStream::AddRef() \n{ \n    return (ULONG)InterlockedIncrement(&_refcount); \n}\n\nULONG STDMETHODCALLTYPE ComOStream::Release() \n{\n    ULONG res = (ULONG) InterlockedDecrement(&_refcount);\n    if (res == 0) \n        delete this;\n    return res;\n}\n\nHRESULT STDMETHODCALLTYPE ComOStream::Write( void const* pv, ULONG cb, ULONG* pcbWritten )\n{\n\tmOStream->writeData( pv, cb );\n\t*pcbWritten = cb;\n    return S_OK;\n}\n\nHRESULT STDMETHODCALLTYPE ComOStream::Seek( LARGE_INTEGER liDistanceToMove, DWORD dwOrigin, ULARGE_INTEGER* lpNewFilePointer )\n{ \n\tswitch( dwOrigin ) {\n\t\tcase STREAM_SEEK_SET:\n\t\t\tmOStream->seekAbsolute( (off_t)liDistanceToMove.QuadPart );\n\t\tbreak;\n\t\tcase STREAM_SEEK_CUR:\n\t\t\tmOStream->seekRelative( (off_t)liDistanceToMove.QuadPart );\n\t\tbreak;\n\t\tcase STREAM_SEEK_END:\n\t\t\tmOStream->seekAbsolute( (off_t)(-liDistanceToMove.QuadPart) );\n\t\tbreak;\n\t\tdefault:   \n\t\t\treturn STG_E_INVALIDFUNCTION;\n\t\tbreak;\n\t}\n\n\tlpNewFilePointer->QuadPart = mOStream->tell();\n\n\treturn S_OK;\n}\n\nstd::wstring toWideString( const std::string &utf8String )\n{\n\tint wideSize = ::MultiByteToWideChar( CP_UTF8, 0, utf8String.c_str(), -1, NULL, 0 );\n\tif( wideSize == ERROR_NO_UNICODE_TRANSLATION ) {\n\t\tthrow Exception( \"Invalid UTF-8 sequence.\" );\n\t}\n\telse if( wideSize == 0 ) {\n\t\tthrow Exception( \"Error in UTF-8 to UTF-16 conversion.\" );\n\t}\n\n\tstd::vector<wchar_t> resultString( wideSize );\n\tint convResult = ::MultiByteToWideChar( CP_UTF8, 0, utf8String.c_str(), -1, &resultString[0], wideSize );\n\tif( convResult != wideSize ) {\n\t\tthrow Exception( \"Error in UTF-8 to UTF-16 conversion.\" );\n\t}\n\n\treturn std::wstring( &resultString[0] );\n}\n\nstd::string toUtf8String( const std::wstring &wideString )\n{\n\tint utf8Size = ::WideCharToMultiByte( CP_UTF8, 0, wideString.c_str(), -1, NULL, 0, NULL, NULL );\n\tif( utf8Size == 0 ) {\n\t\tthrow Exception( \"Error in UTF-16 to UTF-8 conversion.\" );\n\t}\n\n\tstd::vector<char> resultString( utf8Size );\n\n\tint convResult = ::WideCharToMultiByte( CP_UTF8, 0, wideString.c_str(), -1, &resultString[0], utf8Size, NULL, NULL );\n\n\tif( convResult != utf8Size ) {\n\t\tthrow Exception( \"Error in UTF-16 to UTF-8 conversion.\" );\n\t}\n\n\treturn std::string( &resultString[0] );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComIStream\n\nHRESULT STDMETHODCALLTYPE ComIStream::QueryInterface(REFIID iid, void ** ppvObject)\n{ \n\tif (iid == __uuidof(IUnknown)\n\t\t|| iid == __uuidof(IStream)\n\t\t|| iid == __uuidof(ISequentialStream))\n\t{\n\t\t*ppvObject = static_cast<IStream*>(this);\n\t\tAddRef();\n\t\treturn S_OK;\n\t}\n\telse\n\t\treturn E_NOINTERFACE; \n}\n\nULONG STDMETHODCALLTYPE ComIStream::AddRef() \n{ \n\treturn (ULONG)InterlockedIncrement(&_refcount); \n}\n\nULONG STDMETHODCALLTYPE ComIStream::Release() \n{\n\tULONG res = (ULONG) InterlockedDecrement(&_refcount);\n\tif (res == 0) \n\t\tdelete this;\n\treturn res;\n}\n\nHRESULT STDMETHODCALLTYPE ComIStream::Read( void* pv, ULONG cb, ULONG* pcbRead )\n{\n\tULONG dataLeft = mIStream->size() - mIStream->tell();\n\tif( dataLeft < cb ) {\n\t\tmIStream->readData( pv, dataLeft );\n\t\t*pcbRead = dataLeft;\n\t\treturn S_FALSE;\n\t}\n\telse {\n\t\tmIStream->readData( pv, cb );\n\t\t*pcbRead = cb;\n\t\treturn S_OK;\n\t}\n}\n\nHRESULT STDMETHODCALLTYPE ComIStream::Seek( LARGE_INTEGER liDistanceToMove, DWORD dwOrigin, ULARGE_INTEGER* lpNewFilePointer )\n{ \n\tswitch( dwOrigin ) {\n\tcase STREAM_SEEK_SET:\n\t\tmIStream->seekAbsolute( (off_t)liDistanceToMove.QuadPart );\n\t\tbreak;\n\tcase STREAM_SEEK_CUR:\n\t\tmIStream->seekRelative( (off_t)liDistanceToMove.QuadPart );\n\t\tbreak;\n\tcase STREAM_SEEK_END:\n\t\tmIStream->seekAbsolute( (off_t)( - liDistanceToMove.QuadPart ) );\n\t\tbreak;\n\tdefault:   \n\t\treturn STG_E_INVALIDFUNCTION;\n\t\tbreak;\n\t}\n\toff_t pos = mIStream->tell();\n\tif( lpNewFilePointer )\n\t\tlpNewFilePointer->QuadPart = pos;\n\n\treturn S_OK;\n}\n\nHRESULT STDMETHODCALLTYPE ComIStream::Stat( STATSTG* pStatstg, DWORD grfStatFlag)\n{\n\tpStatstg->pwcsName = NULL;\n\tpStatstg->cbSize.QuadPart = (ULONGLONG)mIStream->size();\n\n\treturn S_OK;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComInitializer\n\nstruct ComInitializer {\n\tComInitializer( DWORD params ) {\n\t\t::CoInitializeEx( NULL, params );\n\t}\n\n\t~ComInitializer()\n\t{\n\t\t::CoUninitialize();\n\t}\n};\n\n#if defined( CINDER_WINRT )\n\nvoid initializeCom( DWORD params )\n{\n\t::CoInitializeEx( NULL, params );\n}\n#else\n__declspec(thread) ComInitializer *threadComInitializer = nullptr;\n\nvoid initializeCom(DWORD params)\n{\n\tif( ! threadComInitializer )\n\t\tthreadComInitializer = new ComInitializer(params);\n}\n#endif\n\n} } \/\/ namespace cinder::msw\n<|endoftext|>"}
{"text":"<commit_before>\/*\n Copyright (c) 2010, The Barbarian Group\n 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\n    * Redistributions of source code must retain the above copyright notice, this list of conditions and\n\tthe following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n\tthe following disclaimer in the documentation and\/or other materials provided with the distribution.\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 HOLDER OR CONTRIBUTORS BE LIABLE FOR\n ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n TO, 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#include \"cinder\/app\/App.h\"\n#include \"cinder\/params\/Params.h\"\n\n#include \"AntTweakBar.h\"\n\n#include <boost\/assign\/list_of.hpp>\n\nusing namespace std;\n\nnamespace cinder { namespace params {\n\nnamespace {\n\n#undef DELETE\n\n#define SYNONYM(ck,ak) ((int)cinder::app::KeyEvent::KEY_ ## ck, TW_KEY_ ## ak)\n#define HOMONYM(k) SYNONYM(k,k)\n    std::map<int,TwKeySpecial> specialKeys = boost::assign::map_list_of\n        HOMONYM(RIGHT)\n        HOMONYM(LEFT)\n        HOMONYM(BACKSPACE)\n        HOMONYM(DELETE)\n        HOMONYM(TAB)\n        HOMONYM(F1)\n        HOMONYM(F2)\n        HOMONYM(F3)\n        HOMONYM(F4)\n        HOMONYM(F5)\n        HOMONYM(F6)\n        HOMONYM(F7)\n        HOMONYM(F8)\n        HOMONYM(F9)\n        HOMONYM(F10)\n        HOMONYM(F11)\n        HOMONYM(F12)\n        HOMONYM(F13)\n        HOMONYM(F14)\n        HOMONYM(F15)\n        HOMONYM(HOME)\n        HOMONYM(END)\n        SYNONYM(PAGEUP,PAGE_UP)\n        SYNONYM(PAGEDOWN,PAGE_DOWN)\n        ;\n#undef SYNONYM\n#undef HOMONYM\n\nbool mouseDown( app::MouseEvent event )\n{\n\tTwMouseButtonID button;\n\tif( event.isLeft() )\n\t\tbutton = TW_MOUSE_LEFT;\n\telse if( event.isRight() )\n\t\tbutton = TW_MOUSE_RIGHT;\n\telse\n\t\tbutton = TW_MOUSE_MIDDLE;\n\treturn TwMouseButton( TW_MOUSE_PRESSED, button ) != 0;\n}\n\nbool mouseUp( app::MouseEvent event )\n{\n\tTwMouseButtonID button;\n\tif( event.isLeft() )\n\t\tbutton = TW_MOUSE_LEFT;\n\telse if( event.isRight() )\n\t\tbutton = TW_MOUSE_RIGHT;\n\telse\n\t\tbutton = TW_MOUSE_MIDDLE;\n\treturn TwMouseButton( TW_MOUSE_RELEASED, button ) != 0;\n}\n\nbool mouseWheel( app::MouseEvent event )\n{\n\tstatic float sWheelPos = 0;\n\tsWheelPos += event.getWheelIncrement();\n\treturn TwMouseWheel( (int)(sWheelPos) ) != 0;\n}\n\nbool mouseMove( app::MouseEvent event )\n{\n\treturn TwMouseMotion( event.getX(), event.getY() ) != 0;\n}\n\nbool keyDown( app::KeyEvent event )\n{\n\tint kmod = 0;\n\tif( event.isShiftDown() )\n\t\tkmod |= TW_KMOD_SHIFT;\n\tif( event.isControlDown() )\n\t\tkmod |= TW_KMOD_CTRL;\n\tif( event.isAltDown() )\n\t\tkmod |= TW_KMOD_ALT;\n\treturn TwKeyPressed(\n            (specialKeys.count( event.getCode() ) > 0)\n                ? specialKeys[event.getCode()]\n                : event.getChar(),\n            kmod ) != 0;\n}\n\nbool resize( cinder::app::WindowRef window )\n{\n\tTwWindowSize( window->getWidth(), window->getHeight() );\n\treturn false;\n}\n\nvoid TW_CALL implStdStringToClient( std::string& destinationClientString, const std::string& sourceLibraryString )\n{\n  \/\/ copy strings from the library to the client app\n  destinationClientString = sourceLibraryString;\n}\n\nclass AntMgr {\n  public:\n\tAntMgr() {\n\t\tif( ! TwInit( TW_OPENGL, NULL ) ) {\n\t\t\tthrow Exception();\n\t\t}\t\t\n\t}\n\t\n\t~AntMgr() {\n\t\tTwTerminate();\n\t}\n};\n\n} \/\/ anonymous namespace\n\nvoid initAntGl()\n{\n\tstatic std::shared_ptr<AntMgr> mgr;\n\tif( ! mgr )\n\t\tmgr = std::shared_ptr<AntMgr>( new AntMgr );\n}\n\nInterfaceGl::InterfaceGl( const std::string &title, const Vec2i &size, const ColorA color )\n{\n\tinit( app::App::get()->getWindow(), title, size, color );\n}\n\nInterfaceGl::InterfaceGl( app::WindowRef window, const std::string &title, const Vec2i &size, const ColorA color )\n{\n\tinit( window, title, size, color );\n}\n\nvoid InterfaceGl::init( app::WindowRef window, const std::string &title, const Vec2i &size, const ColorA color )\n{\n\tinitAntGl();\n\t\n\tmWindow = window;\n\n\tmBar = std::shared_ptr<TwBar>( TwNewBar( title.c_str() ), TwDeleteBar );\n\tchar optionsStr[1024];\n\tsprintf( optionsStr, \"`%s` size='%d %d' color='%d %d %d' alpha=%d\", title.c_str(), size.x, size.y, (int)(color.r * 255), (int)(color.g * 255), (int)(color.b * 255), (int)(color.a * 255) );\n\tTwDefine( optionsStr );\n\t\n\tTwCopyStdStringToClientFunc( implStdStringToClient );\t\n\n\tmWindow->getSignalMouseDown().connect( mouseDown );\n\tmWindow->getSignalMouseUp().connect( mouseUp );\n\tmWindow->getSignalMouseWheel().connect( mouseWheel );\n\tmWindow->getSignalMouseMove().connect( mouseMove );\n\tmWindow->getSignalMouseDrag().connect( mouseMove );\n\tmWindow->getSignalKeyDown().connect( keyDown );\n\tmWindow->getSignalResize().connect( std::bind( resize, mWindow ) );\n}\n\nvoid InterfaceGl::draw()\n{\n\tTwDraw();\n}\n\nvoid InterfaceGl::show( bool visible )\n{\n\tint32_t visibleInt = ( visible ) ? 1 : 0;\n\tTwSetParam( mBar.get(), NULL, \"visible\", TW_PARAM_INT32, 1, &visibleInt );\n}\n\nvoid InterfaceGl::hide()\n{\n\tint32_t visibleInt = 0;\n\tTwSetParam( mBar.get(), NULL, \"visible\", TW_PARAM_INT32, 1, &visibleInt );\n}\n\nbool InterfaceGl::isVisible() const\n{\n\tint32_t visibleInt;\n\tTwGetParam( mBar.get(), NULL, \"visible\", TW_PARAM_INT32, 1, &visibleInt );\n\treturn visibleInt != 0;\n}\n\nvoid InterfaceGl::implAddParam( const std::string &name, void *param, int type, const std::string &optionsStr, bool readOnly )\n{\n\tif( readOnly )\n\t\tTwAddVarRO( mBar.get(), name.c_str(), (TwType)type, param, optionsStr.c_str() );\n\telse\n\t\tTwAddVarRW( mBar.get(), name.c_str(), (TwType)type, param, optionsStr.c_str() );\n}\n\nvoid InterfaceGl::addParam( const std::string &name, bool *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_BOOLCPP, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, float *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_FLOAT, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, double *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_DOUBLE, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, int32_t *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_INT32, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, Vec3f *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_DIR3F, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, Quatf *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_QUAT4F, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, Color *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_COLOR3F, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, ColorA *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_COLOR4F, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, std::string *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_STDSTRING, optionsStr, readOnly );\n}\n\nvoid InterfaceGl::addParam( const std::string &name, const std::vector<std::string> &enumNames, int *param, const std::string &optionsStr, bool readOnly )\n{\n\tTwEnumVal *ev = new TwEnumVal[enumNames.size()];\n\tfor( size_t v = 0; v < enumNames.size(); ++v ) {\n\t\tev[v].Value = v;\n\t\tev[v].Label = const_cast<char*>( enumNames[v].c_str() );\n\t}\n\n\tTwType evType = TwDefineEnum( (name + \"EnumType\").c_str(), ev, enumNames.size() );\n\n\tif( readOnly )\n\t\tTwAddVarRO( mBar.get(), name.c_str(), evType, param, optionsStr.c_str() );\n\telse\n\t\tTwAddVarRW( mBar.get(), name.c_str(), evType, param, optionsStr.c_str() );\n\t\t\n\tdelete [] ev;\n}\n\nvoid InterfaceGl::addSeparator( const std::string &name, const std::string &optionsStr )\n{\n\tTwAddSeparator( mBar.get(), name.c_str(), optionsStr.c_str() );\n}\n\nvoid InterfaceGl::addText( const std::string &name, const std::string &optionsStr )\n{\n\tTwAddButton( mBar.get(), name.c_str(), NULL, NULL, optionsStr.c_str() );\n}\n\nnamespace { \/\/ anonymous namespace\nvoid TW_CALL implButtonCallback( void *clientData )\n{\n\tstd::function<void ()> *fn = reinterpret_cast<std::function<void ()>*>( clientData );\n\t(*fn)(); \n} \n} \/\/ anonymous namespace\n\nvoid InterfaceGl::addButton( const std::string &name, const std::function<void ()> &callback, const std::string &optionsStr )\n{\n\tstd::shared_ptr<std::function<void ()> > callbackPtr( new std::function<void ()>( callback ) );\n\tmButtonCallbacks.push_back( callbackPtr );\n\tTwAddButton( mBar.get(), name.c_str(), implButtonCallback, (void*)callbackPtr.get(), optionsStr.c_str() );\n}\n\nvoid InterfaceGl::removeParam( const std::string &name )\n{\n\tTwRemoveVar( mBar.get(), name.c_str() );\n}\n\nvoid InterfaceGl::clear()\n{\n\tTwRemoveAllVars( mBar.get() );\n}\n\nvoid InterfaceGl::setOptions( const std::string &name, const std::string &optionsStr )\n{\n\tstd::string target = \"`\" + (std::string)TwGetBarName( mBar.get() ) + \"`\";\n\tif( !( name.empty() ) )\n\t\ttarget += \"\/`\" + name + \"`\";\n\n\tTwDefine( ( target + \" \" + optionsStr ).c_str() );\n}\n\n} } \/\/ namespace cinder::params\n<commit_msg>Fixing issue where InterfaceGl was not capturing events properly<commit_after>\/*\n Copyright (c) 2010, The Barbarian Group\n 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\n    * Redistributions of source code must retain the above copyright notice, this list of conditions and\n\tthe following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n\tthe following disclaimer in the documentation and\/or other materials provided with the distribution.\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 HOLDER OR CONTRIBUTORS BE LIABLE FOR\n ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n TO, 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#include \"cinder\/app\/App.h\"\n#include \"cinder\/params\/Params.h\"\n\n#include \"AntTweakBar.h\"\n\n#include <boost\/assign\/list_of.hpp>\n\nusing namespace std;\n\nnamespace cinder { namespace params {\n\nnamespace {\n\n#undef DELETE\n\n#define SYNONYM(ck,ak) ((int)cinder::app::KeyEvent::KEY_ ## ck, TW_KEY_ ## ak)\n#define HOMONYM(k) SYNONYM(k,k)\n    std::map<int,TwKeySpecial> specialKeys = boost::assign::map_list_of\n        HOMONYM(RIGHT)\n        HOMONYM(LEFT)\n        HOMONYM(BACKSPACE)\n        HOMONYM(DELETE)\n        HOMONYM(TAB)\n        HOMONYM(F1)\n        HOMONYM(F2)\n        HOMONYM(F3)\n        HOMONYM(F4)\n        HOMONYM(F5)\n        HOMONYM(F6)\n        HOMONYM(F7)\n        HOMONYM(F8)\n        HOMONYM(F9)\n        HOMONYM(F10)\n        HOMONYM(F11)\n        HOMONYM(F12)\n        HOMONYM(F13)\n        HOMONYM(F14)\n        HOMONYM(F15)\n        HOMONYM(HOME)\n        HOMONYM(END)\n        SYNONYM(PAGEUP,PAGE_UP)\n        SYNONYM(PAGEDOWN,PAGE_DOWN)\n        ;\n#undef SYNONYM\n#undef HOMONYM\n\nvoid mouseDown( app::MouseEvent &event )\n{\n\tTwMouseButtonID button;\n\tif( event.isLeft() )\n\t\tbutton = TW_MOUSE_LEFT;\n\telse if( event.isRight() )\n\t\tbutton = TW_MOUSE_RIGHT;\n\telse\n\t\tbutton = TW_MOUSE_MIDDLE;\n\tevent.setHandled( TwMouseButton( TW_MOUSE_PRESSED, button ) != 0 );\n}\n\nvoid mouseUp( app::MouseEvent &event )\n{\n\tTwMouseButtonID button;\n\tif( event.isLeft() )\n\t\tbutton = TW_MOUSE_LEFT;\n\telse if( event.isRight() )\n\t\tbutton = TW_MOUSE_RIGHT;\n\telse\n\t\tbutton = TW_MOUSE_MIDDLE;\n\tevent.setHandled( TwMouseButton( TW_MOUSE_RELEASED, button ) != 0 );\n}\n\nvoid mouseWheel( app::MouseEvent &event )\n{\n\tstatic float sWheelPos = 0;\n\tsWheelPos += event.getWheelIncrement();\n\tevent.setHandled( TwMouseWheel( (int)(sWheelPos) ) != 0 );\n}\n\nvoid mouseMove( app::MouseEvent &event )\n{\n\tevent.setHandled( TwMouseMotion( event.getX(), event.getY() ) != 0 );\n}\n\nvoid keyDown( app::KeyEvent &event )\n{\n\tint kmod = 0;\n\tif( event.isShiftDown() )\n\t\tkmod |= TW_KMOD_SHIFT;\n\tif( event.isControlDown() )\n\t\tkmod |= TW_KMOD_CTRL;\n\tif( event.isAltDown() )\n\t\tkmod |= TW_KMOD_ALT;\n\tevent.setHandled( TwKeyPressed(\n            (specialKeys.count( event.getCode() ) > 0)\n                ? specialKeys[event.getCode()]\n                : event.getChar(),\n            kmod ) != 0 );\n}\n\nvoid resize( cinder::app::WindowRef window )\n{\n\tTwWindowSize( window->getWidth(), window->getHeight() );\n}\n\nvoid TW_CALL implStdStringToClient( std::string& destinationClientString, const std::string& sourceLibraryString )\n{\n  \/\/ copy strings from the library to the client app\n  destinationClientString = sourceLibraryString;\n}\n\nclass AntMgr {\n  public:\n\tAntMgr() {\n\t\tif( ! TwInit( TW_OPENGL, NULL ) ) {\n\t\t\tthrow Exception();\n\t\t}\t\t\n\t}\n\t\n\t~AntMgr() {\n\t\tTwTerminate();\n\t}\n};\n\n} \/\/ anonymous namespace\n\nvoid initAntGl()\n{\n\tstatic std::shared_ptr<AntMgr> mgr;\n\tif( ! mgr )\n\t\tmgr = std::shared_ptr<AntMgr>( new AntMgr );\n}\n\nInterfaceGl::InterfaceGl( const std::string &title, const Vec2i &size, const ColorA color )\n{\n\tinit( app::App::get()->getWindow(), title, size, color );\n}\n\nInterfaceGl::InterfaceGl( app::WindowRef window, const std::string &title, const Vec2i &size, const ColorA color )\n{\n\tinit( window, title, size, color );\n}\n\nvoid InterfaceGl::init( app::WindowRef window, const std::string &title, const Vec2i &size, const ColorA color )\n{\n\tinitAntGl();\n\t\n\tmWindow = window;\n\n\tmBar = std::shared_ptr<TwBar>( TwNewBar( title.c_str() ), TwDeleteBar );\n\tchar optionsStr[1024];\n\tsprintf( optionsStr, \"`%s` size='%d %d' color='%d %d %d' alpha=%d\", title.c_str(), size.x, size.y, (int)(color.r * 255), (int)(color.g * 255), (int)(color.b * 255), (int)(color.a * 255) );\n\tTwDefine( optionsStr );\n\t\n\tTwCopyStdStringToClientFunc( implStdStringToClient );\t\n\n\tmWindow->getSignalMouseDown().connect( mouseDown );\n\tmWindow->getSignalMouseUp().connect( mouseUp );\n\tmWindow->getSignalMouseWheel().connect( mouseWheel );\n\tmWindow->getSignalMouseMove().connect( mouseMove );\n\tmWindow->getSignalMouseDrag().connect( mouseMove );\n\tmWindow->getSignalKeyDown().connect( keyDown );\n\tmWindow->getSignalResize().connect( std::bind( resize, mWindow ) );\n}\n\nvoid InterfaceGl::draw()\n{\n\tTwDraw();\n}\n\nvoid InterfaceGl::show( bool visible )\n{\n\tint32_t visibleInt = ( visible ) ? 1 : 0;\n\tTwSetParam( mBar.get(), NULL, \"visible\", TW_PARAM_INT32, 1, &visibleInt );\n}\n\nvoid InterfaceGl::hide()\n{\n\tint32_t visibleInt = 0;\n\tTwSetParam( mBar.get(), NULL, \"visible\", TW_PARAM_INT32, 1, &visibleInt );\n}\n\nbool InterfaceGl::isVisible() const\n{\n\tint32_t visibleInt;\n\tTwGetParam( mBar.get(), NULL, \"visible\", TW_PARAM_INT32, 1, &visibleInt );\n\treturn visibleInt != 0;\n}\n\nvoid InterfaceGl::implAddParam( const std::string &name, void *param, int type, const std::string &optionsStr, bool readOnly )\n{\n\tif( readOnly )\n\t\tTwAddVarRO( mBar.get(), name.c_str(), (TwType)type, param, optionsStr.c_str() );\n\telse\n\t\tTwAddVarRW( mBar.get(), name.c_str(), (TwType)type, param, optionsStr.c_str() );\n}\n\nvoid InterfaceGl::addParam( const std::string &name, bool *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_BOOLCPP, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, float *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_FLOAT, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, double *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_DOUBLE, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, int32_t *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_INT32, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, Vec3f *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_DIR3F, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, Quatf *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_QUAT4F, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, Color *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_COLOR3F, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, ColorA *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_COLOR4F, optionsStr, readOnly );\n} \n\nvoid InterfaceGl::addParam( const std::string &name, std::string *param, const std::string &optionsStr, bool readOnly )\n{\n\timplAddParam( name, param, TW_TYPE_STDSTRING, optionsStr, readOnly );\n}\n\nvoid InterfaceGl::addParam( const std::string &name, const std::vector<std::string> &enumNames, int *param, const std::string &optionsStr, bool readOnly )\n{\n\tTwEnumVal *ev = new TwEnumVal[enumNames.size()];\n\tfor( size_t v = 0; v < enumNames.size(); ++v ) {\n\t\tev[v].Value = v;\n\t\tev[v].Label = const_cast<char*>( enumNames[v].c_str() );\n\t}\n\n\tTwType evType = TwDefineEnum( (name + \"EnumType\").c_str(), ev, enumNames.size() );\n\n\tif( readOnly )\n\t\tTwAddVarRO( mBar.get(), name.c_str(), evType, param, optionsStr.c_str() );\n\telse\n\t\tTwAddVarRW( mBar.get(), name.c_str(), evType, param, optionsStr.c_str() );\n\t\t\n\tdelete [] ev;\n}\n\nvoid InterfaceGl::addSeparator( const std::string &name, const std::string &optionsStr )\n{\n\tTwAddSeparator( mBar.get(), name.c_str(), optionsStr.c_str() );\n}\n\nvoid InterfaceGl::addText( const std::string &name, const std::string &optionsStr )\n{\n\tTwAddButton( mBar.get(), name.c_str(), NULL, NULL, optionsStr.c_str() );\n}\n\nnamespace { \/\/ anonymous namespace\nvoid TW_CALL implButtonCallback( void *clientData )\n{\n\tstd::function<void ()> *fn = reinterpret_cast<std::function<void ()>*>( clientData );\n\t(*fn)(); \n} \n} \/\/ anonymous namespace\n\nvoid InterfaceGl::addButton( const std::string &name, const std::function<void ()> &callback, const std::string &optionsStr )\n{\n\tstd::shared_ptr<std::function<void ()> > callbackPtr( new std::function<void ()>( callback ) );\n\tmButtonCallbacks.push_back( callbackPtr );\n\tTwAddButton( mBar.get(), name.c_str(), implButtonCallback, (void*)callbackPtr.get(), optionsStr.c_str() );\n}\n\nvoid InterfaceGl::removeParam( const std::string &name )\n{\n\tTwRemoveVar( mBar.get(), name.c_str() );\n}\n\nvoid InterfaceGl::clear()\n{\n\tTwRemoveAllVars( mBar.get() );\n}\n\nvoid InterfaceGl::setOptions( const std::string &name, const std::string &optionsStr )\n{\n\tstd::string target = \"`\" + (std::string)TwGetBarName( mBar.get() ) + \"`\";\n\tif( !( name.empty() ) )\n\t\ttarget += \"\/`\" + name + \"`\";\n\n\tTwDefine( ( target + \" \" + optionsStr ).c_str() );\n}\n\n} } \/\/ namespace cinder::params\n<|endoftext|>"}
{"text":"<commit_before>#include \"LLVMCodeGen.h\"\n\nusing namespace llvm;\nusing namespace codegen;\n\nvoid LLVMCodeGen::visit(common::FloatPattern &Node) {\n    auto PatVal = ConstantFP::get(getType(Node.RetTy), Node.Val);\n    CurVal = Builder.CreateFCmpONE(PatVal, &*CurArg, \"cmptmp\");\n}\n\nvoid LLVMCodeGen::visit(common::IntPattern &Node) {\n    auto PatVal = ConstantInt::get(getType(Node.RetTy), (uint64_t)Node.Val);\n    CurVal = Builder.CreateICmpEQ(PatVal, &*CurArg, \"cmptmp\");\n}\n\nvoid LLVMCodeGen::visit(common::BoolPattern &Node) {\n    auto PatVal = ConstantInt::get(getType(Node.RetTy), (uint64_t)Node.Val);\n    CurVal = Builder.CreateICmpEQ(PatVal, &*CurArg, \"cmptmp\");\n}\n\nvoid LLVMCodeGen::visit(common::CharPattern &Node) {\n    auto PatVal = ConstantInt::get(getType(Node.RetTy), (uint64_t)Node.Val);\n    CurVal = Builder.CreateICmpEQ(PatVal, &*CurArg, \"cmptmp\");\n}\n\nvoid LLVMCodeGen::visit(common::IdPattern &Node) {\n    CtxVals[Node.Val] = &*CurArg;\n    CurVal = ConstantInt::get(Int1, 1);\n}\n\nvoid LLVMCodeGen::visit(common::WildPattern &Node) {\n    CurVal = ConstantInt::get(Int1, 1);\n}\n\nvoid LLVMCodeGen::visit(common::TuplePattern &Node) {\n    std::vector<llvm::Constant *> TupleVal;\n    for (auto &Element : Node.Patterns) {\n        Element->accept(*this);\n        TupleVal.push_back((Constant *)CurVal);\n    }\n\n    auto ConstVal = ConstantStruct::get(getTupleType(Node.RetTy), TupleVal);\n    CurVal = new GlobalVariable(*Module.get(), ConstVal->getType(), true,\n                                GlobalVariable::ExternalLinkage, ConstVal);\n}\n\nvoid LLVMCodeGen::visit(common::ListPattern &Node) {\n    std::vector<llvm::Constant *> ListData;\n\n    for (auto &Element : Node.Patterns) {\n        Element->accept(*this);\n        ListData.push_back(static_cast<Constant *>(CurVal));\n    }\n\n    auto ListType = ArrayType::get(getType(Node.RetTy), Node.Patterns.size());\n    auto ConstVal = ConstantArray::get(ListType, ListData);\n\n    CurVal = new GlobalVariable(*Module.get(), ConstVal->getType(), true,\n                                GlobalVariable::ExternalLinkage, ConstVal);\n}\n\nvoid LLVMCodeGen::visit(common::ParPattern &Node) {\n    Node.Pat->accept(*this);\n}\n<commit_msg>llvm: change to c++ style cast<commit_after>#include \"LLVMCodeGen.h\"\n\nusing namespace llvm;\nusing namespace codegen;\n\nvoid LLVMCodeGen::visit(common::FloatPattern &Node) {\n    auto PatVal = ConstantFP::get(getType(Node.RetTy), Node.Val);\n    CurVal = Builder.CreateFCmpONE(PatVal, &*CurArg, \"cmptmp\");\n}\n\nvoid LLVMCodeGen::visit(common::IntPattern &Node) {\n    auto PatVal = ConstantInt::get(getType(Node.RetTy), (uint64_t)Node.Val);\n    CurVal = Builder.CreateICmpEQ(PatVal, &*CurArg, \"cmptmp\");\n}\n\nvoid LLVMCodeGen::visit(common::BoolPattern &Node) {\n    auto PatVal = ConstantInt::get(getType(Node.RetTy), (uint64_t)Node.Val);\n    CurVal = Builder.CreateICmpEQ(PatVal, &*CurArg, \"cmptmp\");\n}\n\nvoid LLVMCodeGen::visit(common::CharPattern &Node) {\n    auto PatVal = ConstantInt::get(getType(Node.RetTy), (uint64_t)Node.Val);\n    CurVal = Builder.CreateICmpEQ(PatVal, &*CurArg, \"cmptmp\");\n}\n\nvoid LLVMCodeGen::visit(common::IdPattern &Node) {\n    CtxVals[Node.Val] = &*CurArg;\n    CurVal = ConstantInt::get(Int1, 1);\n}\n\nvoid LLVMCodeGen::visit(common::WildPattern &Node) {\n    CurVal = ConstantInt::get(Int1, 1);\n}\n\nvoid LLVMCodeGen::visit(common::TuplePattern &Node) {\n    std::vector<llvm::Constant *> TupleVal;\n    for (auto &Element : Node.Patterns) {\n        Element->accept(*this);\n        TupleVal.push_back(static_cast<Constant *>(CurVal));\n    }\n\n    auto ConstVal = ConstantStruct::get(getTupleType(Node.RetTy), TupleVal);\n    CurVal = new GlobalVariable(*Module.get(), ConstVal->getType(), true,\n                                GlobalVariable::ExternalLinkage, ConstVal);\n}\n\nvoid LLVMCodeGen::visit(common::ListPattern &Node) {\n    std::vector<llvm::Constant *> ListData;\n\n    for (auto &Element : Node.Patterns) {\n        Element->accept(*this);\n        ListData.push_back(static_cast<Constant *>(CurVal));\n    }\n\n    auto ListType = ArrayType::get(getType(Node.RetTy), Node.Patterns.size());\n    auto ConstVal = ConstantArray::get(ListType, ListData);\n\n    CurVal = new GlobalVariable(*Module.get(), ConstVal->getType(), true,\n                                GlobalVariable::ExternalLinkage, ConstVal);\n}\n\nvoid LLVMCodeGen::visit(common::ParPattern &Node) {\n    Node.Pat->accept(*this);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ Copyright (c) 2018 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\/*\nThis file is the implementation of the Model class.\n*\/\n\n#include \"src\/data\/model_parameters.h\"\n\n#include <string.h>\n#include <pmmintrin.h>  \/\/ for SSE\n\n#include \"src\/base\/file_util.h\"\n#include \"src\/base\/format_print.h\"\n#include \"src\/base\/math.h\"\n#include \"src\/base\/logging.h\"\n#include \"src\/base\/stringprintf.h\"\n\nnamespace xLearn {\n\n\/\/------------------------------------------------------------------------------\n\/\/ The Model class\n\/\/------------------------------------------------------------------------------\n\n\/\/ Basic contributor.\nvoid Model::Initialize(const std::string& score_func,\n                  const std::string& loss_func,\n                  index_t num_feature,\n                  index_t num_field,\n                  index_t num_K,\n                  index_t aux_size,\n                  real_t scale) {\n  CHECK(!score_func.empty());\n  CHECK(!loss_func.empty());\n  CHECK_GT(num_feature, 0);\n  CHECK_GE(num_field, 0);\n  CHECK_GE(num_K, 0);\n  \/\/ The aux_size is used for different \n  \/\/ optimization method\n  CHECK_GE(aux_size, 0);\n  CHECK_GT(scale, 0);\n  score_func_ = score_func;\n  loss_func_ = loss_func;\n  num_feat_ = num_feature;\n  num_field_ = num_field;\n  num_K_ = num_K;\n  aux_size_ = aux_size;\n  scale_ = scale;\n  \/\/ Calculate the number of model parameters\n  param_num_w_ = num_feature * aux_size_;\n  \/\/ latent vector\n  if (score_func == \"linear\") {\n    param_num_v_ = 0;\n  } else if (score_func == \"fm\") {\n    \/\/ fm: feature * K\n    param_num_v_ = num_feature * get_aligned_k() * aux_size_;\n  } else if (score_func == \"ffm\") {\n    \/\/ ffm: feature * K * field\n    param_num_v_ = num_feature * get_aligned_k() * num_field * aux_size_;\n  } else {\n    LOG(FATAL) << \"Unknow score function: \" << score_func;\n  }\n  this->initial(true);\n}\n\n\/\/ To get the best performance for SSE, we need to\n\/\/ allocate memory for the model parameters in aligned way.\n\/\/ For SSE, the align number should be 16 byte (kAlignByte).\nvoid Model::initial(bool set_val) {\n  try {\n    \/\/ Conventional malloc for linear term and bias\n    param_w_ = (real_t*)malloc(param_num_w_ * sizeof(real_t));\n    param_b_ = (real_t*)malloc(aux_size_ * sizeof(real_t));\n    if (score_func_.compare(\"fm\") == 0 ||\n        score_func_.compare(\"ffm\") == 0) {\n      \/\/ Aligned malloc for latent factor\n#ifdef _WIN32\n      param_v_ = _aligned_malloc(\n                 param_num_v_ * sizeof(real_t),\n                 kAlignByte);\n#else\n      int ret = posix_memalign(\n                (void**)&param_v_,\n                kAlignByte,\n                param_num_v_ * sizeof(real_t));\n      CHECK_EQ(ret, 0);\n#endif\n    } else {\n      param_v_ = nullptr;\n    }\n  } catch (std::bad_alloc&) {\n    LOG(FATAL) << \"Cannot allocate enough memory for current  \\\n                   model parameters. Parameter size: \"\n               << GetNumParameter();\n  }\n  \/\/ Set value for model\n  if (set_val) {\n    set_value();\n  }\n}\n\n\/\/ Set value for model\nvoid Model::set_value() {\n  \/\/ Use distribution to transform the random unsigned\n  \/\/ int generated by gen into a float in [(0.0, 1.0) * coef]\n  std::default_random_engine generator;\n  std::uniform_real_distribution<real_t> dis(0.0, 1.0);\n  \/*********************************************************\n   *  Initialize linear and bias term                      *\n   *********************************************************\/\n  for (index_t i = 0; i < param_num_w_; i += aux_size_) {\n    param_w_[i] = 0.0;        \/* model *\/\n    for (index_t j = 1; j < aux_size_; ++j) {\n      param_w_[i+j] = 1.0;    \/* gradient cache *\/\n    }\n  }\n  param_b_[0] = 0.0;      \/* model *\/\n  for (index_t j = 1; j < aux_size_; ++j) {\n    param_b_[j] = 1.0;    \/* gradient cache *\/\n  }\n  \/*********************************************************\n   *  Initialize latent factor for fm                      *\n   *********************************************************\/\n  if (score_func_.compare(\"fm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t coef = 1.0f \/ sqrt(num_K_) * scale_;\n    real_t* w = param_v_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for(index_t d = 0; d < num_K_; d++, w++) {\n        *w = coef * dis(generator);  \/* model *\/\n      }\n      for(index_t d = num_K_; d < k_aligned; d++, w++) {\n        *w = 0;  \/* Beyond aligned number *\/\n      }\n      for(index_t d = k_aligned; d < aux_size_*k_aligned; d++, w++) {\n        *w = 1.0;  \/* gradient cache *\/\n      }\n    }\n  }\n  \/*********************************************************\n   *  Initialize latent factor for ffm                     *\n   *********************************************************\/\n  else if (score_func_.compare(\"ffm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t* w = param_v_;\n    real_t coef = 1.0f \/ sqrt(num_K_) * scale_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for (index_t f = 0; f < num_field_; ++f) {\n        for (index_t d = 0; d < k_aligned; ) {\n          for (index_t s = 0; s < kAlign; s++, w++, d++) {\n            w[0] = (d < num_K_) ? coef * dis(generator) : 0.0; \/* model *\/\n            for (index_t j = 1; j < aux_size_; ++j) {\n              w[kAlign * j] = 1.0; \/* gradient cache *\/\n            }\n          }\n          w += (aux_size_-1) * kAlign;\n        }\n      }\n    }\n  }\n}\n\n\/\/ Free the allocated memory\nvoid Model::free_model() {\n  free(param_w_);\n  free(param_v_);\n  free(param_b_);\n  if (param_best_w_ != nullptr) {\n    free(param_best_w_);\n  }\n  if (param_best_v_ != nullptr) {\n    free(param_best_v_);\n  }\n  if (param_best_b_ != nullptr) {\n    free(param_best_b_);\n  }\n}\n\n\/\/ Initialize model from a checkpoint file\nModel::Model(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  if (this->Deserialize(filename) == false) {\n    Color::print_error(\n      StringPrintf(\"Cannot Load model from the file: %s\",\n           filename.c_str())\n    );\n    exit(0);\n  }\n}\n\n\/\/ Serialize current model to a disk file\nvoid Model::Serialize(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  FILE* file = OpenFileOrDie(filename.c_str(), \"w\");\n  \/\/ Write score function\n  WriteStringToFile(file, score_func_);\n  \/\/ Write loss function\n  WriteStringToFile(file, loss_func_);\n  \/\/ Write feature num\n  WriteDataToDisk(file, (char*)&num_feat_, sizeof(num_feat_));\n  \/\/ Write field num\n  WriteDataToDisk(file, (char*)&num_field_, sizeof(num_field_));\n  \/\/ Write K\n  WriteDataToDisk(file, (char*)&num_K_, sizeof(num_K_));\n  \/\/ Write aux_size\n  WriteDataToDisk(file, (char*)&aux_size_, sizeof(aux_size_));\n  \/\/ Write w\n  this->serialize_w_v_b(file);\n  Close(file);\n}\n\n\/\/ Serialize current model to a TXT file.\nvoid Model::SerializeToTXT(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  std::ofstream o_file(filename);\n  \/*********************************************************\n   *  Initialize linear and bias term                      *\n   *********************************************************\/\n  \/\/ bias term\n  o_file << \"bias: \" << param_b_[0] << \"\\n\";\n  \/\/ linear term\n  index_t idx = 0;\n  for (index_t i = 0; i < param_num_w_; i += aux_size_) {\n    o_file << \"i_\" << idx << \": \" << param_w_[i] << \"\\n\";\n    idx++;\n  }\n  \/*********************************************************\n   *  Initialize latent factor for fm                      *\n   *********************************************************\/\n  if (score_func_.compare(\"fm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t* w = param_v_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      o_file << \"v_\" << j << \": \";\n      for(index_t d = 0; d < num_K_; d++, w++) {\n        o_file << *w;\n        if (d != num_K_-1) {\n          o_file << \" \";\n        }\n      }\n      o_file << \"\\n\";\n      \/\/ skip the rest parameters\n      index_t skip = aux_size_*k_aligned-num_K_;\n      w += skip;\n    }\n  }\n  \/*********************************************************\n   *  Initialize latent factor for ffm                     *\n   *********************************************************\/\n  if (score_func_.compare(\"ffm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t* w = param_v_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for (index_t f = 0; f < num_field_; ++f) {\n        o_file << \"v_\" << j << \"_\" << f << \": \";\n        for (index_t d = 0; d < k_aligned; ) {\n          for (index_t s = 0; s < kAlign; s++, w++, d++) {\n            if (d < num_K_) {\n              o_file << w[0];\n              if (d != num_K_-1) {\n                o_file << \" \";\n              }\n            }\n          }\n          w += (aux_size_-1) * kAlign;\n        }\n        o_file << \"\\n\";\n      }\n    }\n  }\n}\n\n\/\/ Deserialize model from a checkpoint file\nbool Model::Deserialize(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  FILE* file = OpenFileOrDie(filename.c_str(), \"r\");\n  if (file == NULL) { return false; }\n  \/\/ Read score function\n  ReadStringFromFile(file, score_func_);\n  \/\/ Read loss function\n  ReadStringFromFile(file, loss_func_);\n  \/\/ Read feature num\n  ReadDataFromDisk(file, (char*)&num_feat_, sizeof(num_feat_));\n  \/\/ Read field num\n  ReadDataFromDisk(file, (char*)&num_field_, sizeof(num_field_));\n  \/\/ Read K\n  ReadDataFromDisk(file, (char*)&num_K_, sizeof(num_K_));\n  \/\/ Read aux_size\n  ReadDataFromDisk(file, (char*)&aux_size_, sizeof(aux_size_));\n  \/\/ Read w\n  this->deserialize_w_v_b(file);\n  Close(file);\n  return true;\n}\n\n\/\/ Take a record of the best model during training\nvoid Model::SetBestModel() {\n  try {\n    if (param_best_w_ == nullptr) {\n        param_best_w_ = (real_t*)malloc(\n        param_num_w_*sizeof(real_t));\n    }\n    if (param_best_v_ == nullptr &&\n        score_func_.compare(\"linear\") != 0) {\n  #ifdef _WIN32\n        param_best_v_ = _aligned_malloc(\n        param_num_v_ * sizeof(real_t),\n        kAlignByte);\n  #else\n      int ret = posix_memalign(\n                (void**)&param_best_v_,\n                kAlignByte,\n                param_num_v_ * sizeof(real_t));\n      CHECK_EQ(ret, 0);\n  #endif\n    }\n    if (param_best_b_ == nullptr) {\n        param_best_b_ = (real_t*)malloc(\n         aux_size_ * sizeof(real_t)\n        );\n    }\n  } catch (std::bad_alloc&) {\n    LOG(FATAL) << \"Cannot allocate enough memory for current  \\\n                   model parameters. Parameter size: \"\n               << GetNumParameter();\n  }\n  \/\/ Copy current model parameters\n  memcpy(param_best_w_, param_w_, param_num_w_*sizeof(real_t));\n  memcpy(param_best_v_, param_v_, param_num_v_*sizeof(real_t));\n  memcpy(param_best_b_, param_b_, aux_size_*sizeof(real_t));\n}\n\n\/\/ Shrink back for getting the best model\nvoid Model::Shrink() {\n  \/\/ Copy best model parameters\n  if (param_best_w_ != nullptr) {\n    memcpy(param_w_, param_best_w_, param_num_w_*sizeof(real_t));\n  }\n  if (param_best_v_ != nullptr) {\n    memcpy(param_v_, param_best_v_, param_num_v_*sizeof(real_t));\n  }\n  if (param_best_b_ != nullptr) {\n    memcpy(param_b_, param_best_b_, aux_size_*sizeof(real_t));\n  }\n}\n\n\/\/ Serialize w,v,b to disk file\nvoid Model::serialize_w_v_b(FILE* file) {\n  \/\/ Write size of w\n  WriteDataToDisk(file, (char*)&param_num_w_, sizeof(param_num_w_));\n  \/\/ Write size of v\n  if (score_func_.compare(\"linear\") != 0) {\n    WriteDataToDisk(file, (char*)&param_num_v_, sizeof(param_num_v_));\n  }\n  \/\/ Write w\n  WriteDataToDisk(file, (char*)param_w_, sizeof(real_t)*param_num_w_);\n  \/\/ Write b\n  WriteDataToDisk(file, (char*)param_b_, sizeof(real_t)*aux_size_);\n  \/\/ Write v\n  if (score_func_.compare(\"linear\") != 0) {\n    WriteDataToDisk(file, (char*)param_v_, sizeof(real_t)*param_num_v_);\n  }\n}\n\n\/\/ Deserialize w,v,b from disk file\nvoid Model::deserialize_w_v_b(FILE* file) {\n  \/\/ Read size of w\n  ReadDataFromDisk(file, (char*)&param_num_w_, sizeof(param_num_w_));\n  \/\/ Read size of v\n  if (score_func_.compare(\"linear\") != 0) {\n    ReadDataFromDisk(file, (char*)&param_num_v_, sizeof(param_num_v_));\n  }\n  \/\/ Allocate memory. Don't set value here\n  this->initial(false);\n  \/\/ Read w\n  ReadDataFromDisk(file, (char*)param_w_, sizeof(real_t)*param_num_w_);\n  \/\/ Read b\n  ReadDataFromDisk(file, (char*)param_b_, sizeof(real_t)*aux_size_);\n  \/\/ Read v\n  if (score_func_.compare(\"linear\") != 0) {\n    ReadDataFromDisk(file, (char*)param_v_, sizeof(real_t)*param_num_v_);\n  }\n}\n\n}  \/\/ namespace xLearn\n<commit_msg>update model serilazation<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ Copyright (c) 2018 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\/*\nThis file is the implementation of the Model class.\n*\/\n\n#include \"src\/data\/model_parameters.h\"\n\n#include <string.h>\n#include <pmmintrin.h>  \/\/ for SSE\n\n#include \"src\/base\/file_util.h\"\n#include \"src\/base\/format_print.h\"\n#include \"src\/base\/math.h\"\n#include \"src\/base\/logging.h\"\n#include \"src\/base\/stringprintf.h\"\n\nnamespace xLearn {\n\n\/\/------------------------------------------------------------------------------\n\/\/ The Model class\n\/\/------------------------------------------------------------------------------\n\n\/\/ Basic contributor.\nvoid Model::Initialize(const std::string& score_func,\n                  const std::string& loss_func,\n                  index_t num_feature,\n                  index_t num_field,\n                  index_t num_K,\n                  index_t aux_size,\n                  real_t scale) {\n  CHECK(!score_func.empty());\n  CHECK(!loss_func.empty());\n  CHECK_GT(num_feature, 0);\n  CHECK_GE(num_field, 0);\n  CHECK_GE(num_K, 0);\n  \/\/ The aux_size is used for different \n  \/\/ optimization method\n  CHECK_GE(aux_size, 0);\n  CHECK_GT(scale, 0);\n  score_func_ = score_func;\n  loss_func_ = loss_func;\n  num_feat_ = num_feature;\n  num_field_ = num_field;\n  num_K_ = num_K;\n  aux_size_ = aux_size;\n  scale_ = scale;\n  \/\/ Calculate the number of model parameters\n  param_num_w_ = num_feature * aux_size_;\n  \/\/ latent vector\n  if (score_func == \"linear\") {\n    param_num_v_ = 0;\n  } else if (score_func == \"fm\") {\n    \/\/ fm: feature * K\n    param_num_v_ = num_feature * get_aligned_k() * aux_size_;\n  } else if (score_func == \"ffm\") {\n    \/\/ ffm: feature * K * field\n    param_num_v_ = num_feature * get_aligned_k() * num_field * aux_size_;\n  } else {\n    LOG(FATAL) << \"Unknow score function: \" << score_func;\n  }\n  this->initial(true);\n}\n\n\/\/ To get the best performance for SSE, we need to\n\/\/ allocate memory for the model parameters in aligned way.\n\/\/ For SSE, the align number should be 16 byte (kAlignByte).\nvoid Model::initial(bool set_val) {\n  try {\n    \/\/ Conventional malloc for linear term and bias\n    param_w_ = (real_t*)malloc(param_num_w_ * sizeof(real_t));\n    param_b_ = (real_t*)malloc(aux_size_ * sizeof(real_t));\n    if (score_func_.compare(\"fm\") == 0 ||\n        score_func_.compare(\"ffm\") == 0) {\n      \/\/ Aligned malloc for latent factor\n#ifdef _WIN32\n      param_v_ = _aligned_malloc(\n                 param_num_v_ * sizeof(real_t),\n                 kAlignByte);\n#else\n      int ret = posix_memalign(\n                (void**)&param_v_,\n                kAlignByte,\n                param_num_v_ * sizeof(real_t));\n      CHECK_EQ(ret, 0);\n#endif\n    } else {\n      param_v_ = nullptr;\n    }\n  } catch (std::bad_alloc&) {\n    LOG(FATAL) << \"Cannot allocate enough memory for current  \\\n                   model parameters. Parameter size: \"\n               << GetNumParameter();\n  }\n  \/\/ Set value for model\n  if (set_val) {\n    set_value();\n  }\n}\n\n\/\/ Set value for model\nvoid Model::set_value() {\n  \/\/ Use distribution to transform the random unsigned\n  \/\/ int generated by gen into a float in [(0.0, 1.0) * coef]\n  std::default_random_engine generator;\n  std::uniform_real_distribution<real_t> dis(0.0, 1.0);\n  \/*********************************************************\n   *  Initialize linear and bias term                      *\n   *********************************************************\/\n  for (index_t i = 0; i < param_num_w_; i += aux_size_) {\n    param_w_[i] = 0.0;        \/* model *\/\n    for (index_t j = 1; j < aux_size_; ++j) {\n      param_w_[i+j] = 1.0;    \/* gradient cache *\/\n    }\n  }\n  param_b_[0] = 0.0;      \/* model *\/\n  for (index_t j = 1; j < aux_size_; ++j) {\n    param_b_[j] = 1.0;    \/* gradient cache *\/\n  }\n  \/*********************************************************\n   *  Initialize latent factor for fm                      *\n   *********************************************************\/\n  if (score_func_.compare(\"fm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t coef = 1.0f \/ sqrt(num_K_) * scale_;\n    real_t* w = param_v_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for(index_t d = 0; d < num_K_; d++, w++) {\n        *w = coef * dis(generator);  \/* model *\/\n      }\n      for(index_t d = num_K_; d < k_aligned; d++, w++) {\n        *w = 0;  \/* Beyond aligned number *\/\n      }\n      for(index_t d = k_aligned; d < aux_size_*k_aligned; d++, w++) {\n        *w = 1.0;  \/* gradient cache *\/\n      }\n    }\n  }\n  \/*********************************************************\n   *  Initialize latent factor for ffm                     *\n   *********************************************************\/\n  else if (score_func_.compare(\"ffm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t* w = param_v_;\n    real_t coef = 1.0f \/ sqrt(num_K_) * scale_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for (index_t f = 0; f < num_field_; ++f) {\n        for (index_t d = 0; d < k_aligned; ) {\n          for (index_t s = 0; s < kAlign; s++, w++, d++) {\n            w[0] = (d < num_K_) ? coef * dis(generator) : 0.0; \/* model *\/\n            for (index_t j = 1; j < aux_size_; ++j) {\n              w[kAlign * j] = 1.0; \/* gradient cache *\/\n            }\n          }\n          w += (aux_size_-1) * kAlign;\n        }\n      }\n    }\n  }\n}\n\n\/\/ Free the allocated memory\nvoid Model::free_model() {\n  free(param_w_);\n  free(param_v_);\n  free(param_b_);\n  if (param_best_w_ != nullptr) {\n    free(param_best_w_);\n  }\n  if (param_best_v_ != nullptr) {\n    free(param_best_v_);\n  }\n  if (param_best_b_ != nullptr) {\n    free(param_best_b_);\n  }\n}\n\n\/\/ Initialize model from a checkpoint file\nModel::Model(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  if (this->Deserialize(filename) == false) {\n    Color::print_error(\n      StringPrintf(\"Cannot Load model from the file: %s\",\n           filename.c_str())\n    );\n    exit(0);\n  }\n}\n\n\/\/ Serialize current model to a disk file\nvoid Model::Serialize(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  FILE* file = OpenFileOrDie(filename.c_str(), \"w\");\n  \/\/ Write score function\n  WriteStringToFile(file, score_func_);\n  \/\/ Write loss function\n  WriteStringToFile(file, loss_func_);\n  \/\/ Write feature num\n  WriteDataToDisk(file, (char*)&num_feat_, sizeof(num_feat_));\n  \/\/ Write field num\n  WriteDataToDisk(file, (char*)&num_field_, sizeof(num_field_));\n  \/\/ Write K\n  WriteDataToDisk(file, (char*)&num_K_, sizeof(num_K_));\n  \/\/ Write aux_size\n  WriteDataToDisk(file, (char*)&aux_size_, sizeof(aux_size_));\n  \/\/ Write w\n  this->serialize_w_v_b(file);\n  Close(file);\n}\n\n\/\/ Serialize current model to a TXT file.\nvoid Model::SerializeToTXT(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  std::ofstream o_file(filename);\n  \/*********************************************************\n   *  Write linear and bias term                      *\n   *********************************************************\/\n  \/\/ bias term\n  o_file << \"bias: \" << param_b_[0] << \"\\n\";\n  \/\/ linear term\n  index_t idx = 0;\n  for (index_t i = 0; i < param_num_w_; i += aux_size_) {\n    o_file << \"i_\" << idx << \": \" << param_w_[i] << \"\\n\";\n    idx++;\n  }\n  \/*********************************************************\n   *  Write latent factor for fm                      *\n   *********************************************************\/\n  if (score_func_.compare(\"fm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t* w = param_v_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      o_file << \"v_\" << j << \": \";\n      for(index_t d = 0; d < num_K_; d++, w++) {\n        o_file << *w;\n        if (d != num_K_-1) {\n          o_file << \" \";\n        }\n      }\n      o_file << \"\\n\";\n      \/\/ skip the rest parameters\n      index_t skip = aux_size_*k_aligned-num_K_;\n      w += skip;\n    }\n  }\n  \/*********************************************************\n   *  Write latent factor for ffm                     *\n   *********************************************************\/\n  if (score_func_.compare(\"ffm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t* w = param_v_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for (index_t f = 0; f < num_field_; ++f) {\n        o_file << \"v_\" << j << \"_\" << f << \": \";\n        for (index_t d = 0; d < k_aligned; ) {\n          for (index_t s = 0; s < kAlign; s++, w++, d++) {\n            if (d < num_K_) {\n              o_file << w[0];\n              if (d != num_K_-1) {\n                o_file << \" \";\n              }\n            }\n          }\n          w += (aux_size_-1) * kAlign;\n        }\n        o_file << \"\\n\";\n      }\n    }\n  }\n}\n\n\/\/ Deserialize model from a checkpoint file\nbool Model::Deserialize(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  FILE* file = OpenFileOrDie(filename.c_str(), \"r\");\n  if (file == NULL) { return false; }\n  \/\/ Read score function\n  ReadStringFromFile(file, score_func_);\n  \/\/ Read loss function\n  ReadStringFromFile(file, loss_func_);\n  \/\/ Read feature num\n  ReadDataFromDisk(file, (char*)&num_feat_, sizeof(num_feat_));\n  \/\/ Read field num\n  ReadDataFromDisk(file, (char*)&num_field_, sizeof(num_field_));\n  \/\/ Read K\n  ReadDataFromDisk(file, (char*)&num_K_, sizeof(num_K_));\n  \/\/ Read aux_size\n  ReadDataFromDisk(file, (char*)&aux_size_, sizeof(aux_size_));\n  \/\/ Read w\n  this->deserialize_w_v_b(file);\n  Close(file);\n  return true;\n}\n\n\/\/ Take a record of the best model during training\nvoid Model::SetBestModel() {\n  try {\n    if (param_best_w_ == nullptr) {\n        param_best_w_ = (real_t*)malloc(\n        param_num_w_*sizeof(real_t));\n    }\n    if (param_best_v_ == nullptr &&\n        score_func_.compare(\"linear\") != 0) {\n  #ifdef _WIN32\n        param_best_v_ = _aligned_malloc(\n        param_num_v_ * sizeof(real_t),\n        kAlignByte);\n  #else\n      int ret = posix_memalign(\n                (void**)&param_best_v_,\n                kAlignByte,\n                param_num_v_ * sizeof(real_t));\n      CHECK_EQ(ret, 0);\n  #endif\n    }\n    if (param_best_b_ == nullptr) {\n        param_best_b_ = (real_t*)malloc(\n         aux_size_ * sizeof(real_t)\n        );\n    }\n  } catch (std::bad_alloc&) {\n    LOG(FATAL) << \"Cannot allocate enough memory for current  \\\n                   model parameters. Parameter size: \"\n               << GetNumParameter();\n  }\n  \/\/ Copy current model parameters\n  memcpy(param_best_w_, param_w_, param_num_w_*sizeof(real_t));\n  memcpy(param_best_v_, param_v_, param_num_v_*sizeof(real_t));\n  memcpy(param_best_b_, param_b_, aux_size_*sizeof(real_t));\n}\n\n\/\/ Shrink back for getting the best model\nvoid Model::Shrink() {\n  \/\/ Copy best model parameters\n  if (param_best_w_ != nullptr) {\n    memcpy(param_w_, param_best_w_, param_num_w_*sizeof(real_t));\n  }\n  if (param_best_v_ != nullptr) {\n    memcpy(param_v_, param_best_v_, param_num_v_*sizeof(real_t));\n  }\n  if (param_best_b_ != nullptr) {\n    memcpy(param_b_, param_best_b_, aux_size_*sizeof(real_t));\n  }\n}\n\n\/\/ Serialize w,v,b to disk file\nvoid Model::serialize_w_v_b(FILE* file) {\n  \/\/ Write size of w\n  WriteDataToDisk(file, (char*)&param_num_w_, sizeof(param_num_w_));\n  \/\/ Write size of v\n  if (score_func_.compare(\"linear\") != 0) {\n    WriteDataToDisk(file, (char*)&param_num_v_, sizeof(param_num_v_));\n  }\n  \/\/ Write w\n  WriteDataToDisk(file, (char*)param_w_, sizeof(real_t)*param_num_w_);\n  \/\/ Write b\n  WriteDataToDisk(file, (char*)param_b_, sizeof(real_t)*aux_size_);\n  \/\/ Write v\n  if (score_func_.compare(\"linear\") != 0) {\n    WriteDataToDisk(file, (char*)param_v_, sizeof(real_t)*param_num_v_);\n  }\n}\n\n\/\/ Deserialize w,v,b from disk file\nvoid Model::deserialize_w_v_b(FILE* file) {\n  \/\/ Read size of w\n  ReadDataFromDisk(file, (char*)&param_num_w_, sizeof(param_num_w_));\n  \/\/ Read size of v\n  if (score_func_.compare(\"linear\") != 0) {\n    ReadDataFromDisk(file, (char*)&param_num_v_, sizeof(param_num_v_));\n  }\n  \/\/ Allocate memory. Don't set value here\n  this->initial(false);\n  \/\/ Read w\n  ReadDataFromDisk(file, (char*)param_w_, sizeof(real_t)*param_num_w_);\n  \/\/ Read b\n  ReadDataFromDisk(file, (char*)param_b_, sizeof(real_t)*aux_size_);\n  \/\/ Read v\n  if (score_func_.compare(\"linear\") != 0) {\n    ReadDataFromDisk(file, (char*)param_v_, sizeof(real_t)*param_num_v_);\n  }\n}\n\n}  \/\/ namespace xLearn\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 * $Id$\n *\/\n\n#include \"NamedNodeMapImpl.hpp\"\n#include \"NodeVector.hpp\"\n#include \"AttrImpl.hpp\"\n#include \"DOM_DOMException.hpp\"\n#include \"DocumentImpl.hpp\"\n\n\nint        NamedNodeMapImpl::gLiveNamedNodeMaps  = 0;\nint        NamedNodeMapImpl::gTotalNamedNodeMaps = 0;\n\nNamedNodeMapImpl::NamedNodeMapImpl(NodeImpl *ownerNod)\n{\n    this->ownerNode=ownerNod;\n    this->nodes = null;\n    this->readOnly = false;\n    this->refCount = 1;\n    gLiveNamedNodeMaps++;\n    gTotalNamedNodeMaps++;\n};\n\n\n\nNamedNodeMapImpl::~NamedNodeMapImpl()\n{\n    if (nodes)\n    {\n        \/\/ It is the responsibility of whoever was using the named node\n        \/\/ map to do any cleanup on the nodes contained in the map\n        \/\/  before deleting it.\n        delete nodes;\n        nodes = 0;\n    }\n    gLiveNamedNodeMaps--;\n};\n\n\nvoid NamedNodeMapImpl::addRef(NamedNodeMapImpl *This)\n{\n    if (This)\n        ++This->refCount;\n};\n\n\nNamedNodeMapImpl *NamedNodeMapImpl::cloneMap(NodeImpl *ownerNod)\n{\n    NamedNodeMapImpl *newmap = new NamedNodeMapImpl(ownerNod);\n\t\n    if (nodes != null)\n    {\n        newmap->nodes = new NodeVector(nodes->size());\n        for (unsigned int i = 0; i < nodes->size(); ++i)\n        {\n            NodeImpl *n = nodes->elementAt(i)->cloneNode(true);\n\t\t\tn->isSpecified(nodes->elementAt(i)->isSpecified());\n            n->ownerNode = ownerNod;\n            n->isOwned(true);\n            newmap->nodes->addElement(n);\n        }\n    }\n\n    return newmap;\n};\n\n\n\/\/\n\/\/  removeAll - This function removes all elements from a named node map.\n\/\/              It is called from the destructors for Elements and DocumentTypes,\n\/\/              to remove the contents when the owning Element or DocType goes\n\/\/              away.  The empty NamedNodeMap may persist if the user code\n\/\/              has a reference to it.\n\/\/\n\/\/              AH Revist - the empty map should be made read-only, since\n\/\/              adding it was logically part of the [Element, DocumentType]\n\/\/              that has been deleted, and adding anything new to it would\n\/\/              be meaningless, and almost certainly an error.\n\/\/\nvoid NamedNodeMapImpl::removeAll()\n{\n    if (nodes)\n    {\n\n        for (int i=nodes->size()-1; i>=0; i--)\n        {\n            NodeImpl *n = nodes->elementAt(i);\n            n->ownerNode = ownerNode->getOwnerDocument();\n            n->isOwned(false);\n            if (n->nodeRefCount == 0)\n                NodeImpl::deleteIf(n);\n        }\n        delete nodes;\n        nodes = null;\n    }\n}\n\n\n\nint NamedNodeMapImpl::findNamePoint(const DOMString &name)\n{\n\n    \/\/ Binary search\n    int i=0;\n    if(nodes!=null)\n    {\n        int first=0,last=nodes->size()-1;\n\n        while(first<=last)\n        {\n            i=(first+last)\/2;\n            int test = name.compareString(nodes->elementAt(i)->getNodeName());\n            if(test==0)\n                return i; \/\/ Name found\n            else if(test<0)\n                last=i-1;\n            else\n                first=i+1;\n        }\n        if(first>i) i=first;\n    }\n    \/********************\n    \/\/ Linear search\n    int i = 0;\n    if (nodes != null)\n    for (i = 0; i < nodes.size(); ++i)\n    {\n    int test = name.compareTo(((NodeImpl *) (nodes.elementAt(i))).getNodeName());\n    if (test == 0)\n    return i;\n    else\n    if (test < 0)\n    {\n    break; \/\/ Found insertpoint\n    }\n    }\n\n    *******************\/\n    return -1 - i; \/\/ not-found has to be encoded.\n};\n\n\n\nunsigned int NamedNodeMapImpl::getLength()\n{\n    return (nodes != null) ? nodes->size() : 0;\n};\n\n\n\nNodeImpl * NamedNodeMapImpl::getNamedItem(const DOMString &name)\n{\n    int i=findNamePoint(name);\n    return (i<0) ? null : (NodeImpl *)(nodes->elementAt(i));\n};\n\n\n\nNodeImpl * NamedNodeMapImpl::item(unsigned int index)\n{\n    return (nodes != null && index < nodes->size()) ?\n        (NodeImpl *) (nodes->elementAt(index)) : null;\n};\n\n\n\/\/\n\/\/ removeNamedItem() - Remove the named item, and return it.\n\/\/                      The caller must arrange for deletion of the\n\/\/                      returned item if its refcount has gone to zero -\n\/\/                      we can't do it here because the caller would\n\/\/                      never see the returned node.\n\/\/\nNodeImpl * NamedNodeMapImpl::removeNamedItem(const DOMString &name)\n{\n    if (readOnly)\n        throw DOM_DOMException(\n            DOM_DOMException::NO_MODIFICATION_ALLOWED_ERR, null);\n    int i=findNamePoint(name);\n    NodeImpl *n = null;\n\n    if(i<0)\n        throw DOM_DOMException(DOM_DOMException::NOT_FOUND_ERR, null);\n\n    n = (NodeImpl *) (nodes->elementAt(i));\n    nodes->removeElementAt(i);\n    n->ownerNode = ownerNode->getOwnerDocument();\n    n->isOwned(false);\n    return n;\n};\n\n\n\nvoid NamedNodeMapImpl::removeRef(NamedNodeMapImpl *This)\n{\n    if (This && --This->refCount == 0)\n        delete This;\n};\n\n\/\/\n\/\/ setNamedItem()  Put the item into the NamedNodeList by name.\n\/\/                  If an item with the same name already was\n\/\/                  in the list, replace it.  Return the old\n\/\/                  item, if there was one.\n\/\/                  Caller is responsible for arranging for\n\/\/                  deletion of the old item if its ref count is\n\/\/                  zero.\n\/\/\nNodeImpl * NamedNodeMapImpl::setNamedItem(NodeImpl * arg)\n{\n    if(arg->getOwnerDocument() != ownerNode->getOwnerDocument())\n        throw DOM_DOMException(DOM_DOMException::WRONG_DOCUMENT_ERR,null);\n    if (readOnly)\n        throw DOM_DOMException(DOM_DOMException::NO_MODIFICATION_ALLOWED_ERR, null);\n    if (arg->isOwned())\n        throw DOM_DOMException(DOM_DOMException::INUSE_ATTRIBUTE_ERR,null);\n\n    arg->ownerNode = ownerNode;\n    arg->isOwned(true);\n    int i=findNamePoint(arg->getNodeName());\n    NodeImpl * previous=null;\n    if(i>=0)\n    {\n        previous = nodes->elementAt(i);\n        nodes->setElementAt(arg,i);\n    }\n    else\n    {\n        i=-1-i; \/\/ Insert point (may be end of list)\n        if(null==nodes)\n            nodes=new NodeVector();\n        nodes->insertElementAt(arg,i);\n    }\n    if (previous != null) {\n        previous->ownerNode = ownerNode->getOwnerDocument();\n        previous->isOwned(false);\n    }\n\n    return previous;\n};\n\n\nvoid NamedNodeMapImpl::setReadOnly(bool readOnl, bool deep)\n{\n    this->readOnly=readOnl;\n    if(deep && nodes!=null)\n    {\n        \/\/Enumeration e=nodes->elements();\n        \/\/while(e->hasMoreElements())\n        \/\/      ((NodeImpl)e->nextElement())->setReadOnly(readOnl,deep);\n        int sz = nodes->size();\n        for (int i=0; i<sz; ++i) {\n            nodes->elementAt(i)->setReadOnly(readOnl, deep);\n        }\n    }\n};\n\n\n\/\/Introduced in DOM Level 2\n\nint NamedNodeMapImpl::findNamePoint(const DOMString &namespaceURI,\n\tconst DOMString &localName)\n{\n    if (nodes == null)\n\treturn -1;\n    \/\/ This is a linear search through the same nodes Vector.\n    \/\/ The Vector is sorted on the DOM Level 1 nodename.\n    \/\/ The DOM Level 2 NS keys are namespaceURI and Localname, \n    \/\/ so we must linear search thru it.\n    \/\/ In addition, to get this to work with nodes without any namespace\n    \/\/ (namespaceURI and localNames are both null) we then use the nodeName\n    \/\/ as a secondary key.\n    int i, len = nodes -> size();\n    for (i = 0; i < len; ++i) {\n\tNodeImpl *node = nodes -> elementAt(i);\n\tif (! node -> getNamespaceURI().equals(namespaceURI))\t\/\/URI not match\n\t    continue;\n        DOMString nLocalName = node->getLocalName();\n\tif (nLocalName.equals(localName)\n            ||\n            (nLocalName == null && localName.equals(node->getNodeName())))\n\t    return i;\n    }\n    return -1;\t\/\/not found\n}\n\n\nNodeImpl *NamedNodeMapImpl::getNamedItemNS(const DOMString &namespaceURI,\n\tconst DOMString &localName)\n{\n    int i = findNamePoint(namespaceURI, localName);\n    return i < 0 ? null : nodes -> elementAt(i);\n}\n\n\n\/\/\n\/\/ setNamedItemNS()  Put the item into the NamedNodeList by name.\n\/\/                  If an item with the same name already was\n\/\/                  in the list, replace it.  Return the old\n\/\/                  item, if there was one.\n\/\/                  Caller is responsible for arranging for\n\/\/                  deletion of the old item if its ref count is\n\/\/                  zero.\n\/\/\nNodeImpl * NamedNodeMapImpl::setNamedItemNS(NodeImpl *arg)\n{\n    if (arg->getOwnerDocument() != ownerNode->getOwnerDocument())\n        throw DOM_DOMException(DOM_DOMException::WRONG_DOCUMENT_ERR,null);\n    if (readOnly)\n        throw DOM_DOMException(DOM_DOMException::NO_MODIFICATION_ALLOWED_ERR, null);\n    if (arg->isOwned())\n        throw DOM_DOMException(DOM_DOMException::INUSE_ATTRIBUTE_ERR,null);\n\n    arg->ownerNode = ownerNode;\n    arg->isOwned(true);\n    int i=findNamePoint(arg->getNamespaceURI(), arg->getLocalName());\n    NodeImpl *previous=null;\n    if(i>=0) {\n        previous = nodes->elementAt(i);\n        nodes->setElementAt(arg,i);\n    } else {\n        i=-1-i; \/\/ Insert point (may be end of list)\n        if(null==nodes)\n            nodes=new NodeVector();\n        nodes->insertElementAt(arg,i);\n    }\n    if (previous != null) {\n        previous->ownerNode = ownerNode->getOwnerDocument();\n        previous->isOwned(false);\n    }\n\n    return previous;\n};\n\n\n\/\/ removeNamedItemNS() - Remove the named item, and return it.\n\/\/                      The caller must arrange for deletion of the\n\/\/                      returned item if its refcount has gone to zero -\n\/\/                      we can't do it here because the caller would\n\/\/                      never see the returned node.\nNodeImpl *NamedNodeMapImpl::removeNamedItemNS(const DOMString &namespaceURI,\n\tconst DOMString &localName)\n{\n    if (readOnly)\n        throw DOM_DOMException(\n        DOM_DOMException::NO_MODIFICATION_ALLOWED_ERR, null);\n    int i = findNamePoint(namespaceURI, localName);\n    if (i < 0)\n        throw DOM_DOMException(DOM_DOMException::NOT_FOUND_ERR, null);\n\n    NodeImpl * n = nodes -> elementAt(i);\n    nodes -> removeElementAt(i);\t\/\/remove n from nodes\n    n->ownerNode = ownerNode->getOwnerDocument();\n    n->isOwned(false);\n    return n;\n}\n\n\/**\n * NON-DOM\n * set the ownerDocument of this node, its children, and its attributes\n *\/\nvoid NamedNodeMapImpl::setOwnerDocument(DocumentImpl *doc) {\n    if (nodes != null) {\n        for (unsigned int i = 0; i < nodes->size(); i++) {\n            item(i)->setOwnerDocument(doc);\n        }\n    }\n}\n\n\nvoid NamedNodeMapImpl::cloneContent(NamedNodeMapImpl *srcmap) {\n\tif ((srcmap != null) && (srcmap->nodes != null))\n\t{\n\t\tif (nodes != null)\n\t\t\tdelete nodes;\n\t\tnodes = new NodeVector(srcmap->nodes->size());\n\t\tfor (unsigned int i = 0; i < srcmap->nodes->size(); i++)\n\t\t{\n\t\t\tNodeImpl *n = srcmap->nodes->elementAt(i);\n \t\t\tNodeImpl *clone = n->cloneNode(true);\n\t\t\tclone->isSpecified(n->isSpecified());\n\t\t\tclone->ownerNode = ownerNode;\n\t\t\tclone->isOwned(true);\n\t\t\tnodes->addElement(clone);\n\/\/\t\t\tn = null;\n\/\/\t\t\tclone = null;\n\t\t}\n\t}\n}\n<commit_msg>changed again findNamePoint to only consider the nodeName when namespaceURI is null<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 * $Id$\n *\/\n\n#include \"NamedNodeMapImpl.hpp\"\n#include \"NodeVector.hpp\"\n#include \"AttrImpl.hpp\"\n#include \"DOM_DOMException.hpp\"\n#include \"DocumentImpl.hpp\"\n\n\nint        NamedNodeMapImpl::gLiveNamedNodeMaps  = 0;\nint        NamedNodeMapImpl::gTotalNamedNodeMaps = 0;\n\nNamedNodeMapImpl::NamedNodeMapImpl(NodeImpl *ownerNod)\n{\n    this->ownerNode=ownerNod;\n    this->nodes = null;\n    this->readOnly = false;\n    this->refCount = 1;\n    gLiveNamedNodeMaps++;\n    gTotalNamedNodeMaps++;\n};\n\n\n\nNamedNodeMapImpl::~NamedNodeMapImpl()\n{\n    if (nodes)\n    {\n        \/\/ It is the responsibility of whoever was using the named node\n        \/\/ map to do any cleanup on the nodes contained in the map\n        \/\/  before deleting it.\n        delete nodes;\n        nodes = 0;\n    }\n    gLiveNamedNodeMaps--;\n};\n\n\nvoid NamedNodeMapImpl::addRef(NamedNodeMapImpl *This)\n{\n    if (This)\n        ++This->refCount;\n};\n\n\nNamedNodeMapImpl *NamedNodeMapImpl::cloneMap(NodeImpl *ownerNod)\n{\n    NamedNodeMapImpl *newmap = new NamedNodeMapImpl(ownerNod);\n\t\n    if (nodes != null)\n    {\n        newmap->nodes = new NodeVector(nodes->size());\n        for (unsigned int i = 0; i < nodes->size(); ++i)\n        {\n            NodeImpl *n = nodes->elementAt(i)->cloneNode(true);\n\t\t\tn->isSpecified(nodes->elementAt(i)->isSpecified());\n            n->ownerNode = ownerNod;\n            n->isOwned(true);\n            newmap->nodes->addElement(n);\n        }\n    }\n\n    return newmap;\n};\n\n\n\/\/\n\/\/  removeAll - This function removes all elements from a named node map.\n\/\/              It is called from the destructors for Elements and DocumentTypes,\n\/\/              to remove the contents when the owning Element or DocType goes\n\/\/              away.  The empty NamedNodeMap may persist if the user code\n\/\/              has a reference to it.\n\/\/\n\/\/              AH Revist - the empty map should be made read-only, since\n\/\/              adding it was logically part of the [Element, DocumentType]\n\/\/              that has been deleted, and adding anything new to it would\n\/\/              be meaningless, and almost certainly an error.\n\/\/\nvoid NamedNodeMapImpl::removeAll()\n{\n    if (nodes)\n    {\n\n        for (int i=nodes->size()-1; i>=0; i--)\n        {\n            NodeImpl *n = nodes->elementAt(i);\n            n->ownerNode = ownerNode->getOwnerDocument();\n            n->isOwned(false);\n            if (n->nodeRefCount == 0)\n                NodeImpl::deleteIf(n);\n        }\n        delete nodes;\n        nodes = null;\n    }\n}\n\n\n\nint NamedNodeMapImpl::findNamePoint(const DOMString &name)\n{\n\n    \/\/ Binary search\n    int i=0;\n    if(nodes!=null)\n    {\n        int first=0,last=nodes->size()-1;\n\n        while(first<=last)\n        {\n            i=(first+last)\/2;\n            int test = name.compareString(nodes->elementAt(i)->getNodeName());\n            if(test==0)\n                return i; \/\/ Name found\n            else if(test<0)\n                last=i-1;\n            else\n                first=i+1;\n        }\n        if(first>i) i=first;\n    }\n    \/********************\n    \/\/ Linear search\n    int i = 0;\n    if (nodes != null)\n    for (i = 0; i < nodes.size(); ++i)\n    {\n    int test = name.compareTo(((NodeImpl *) (nodes.elementAt(i))).getNodeName());\n    if (test == 0)\n    return i;\n    else\n    if (test < 0)\n    {\n    break; \/\/ Found insertpoint\n    }\n    }\n\n    *******************\/\n    return -1 - i; \/\/ not-found has to be encoded.\n};\n\n\n\nunsigned int NamedNodeMapImpl::getLength()\n{\n    return (nodes != null) ? nodes->size() : 0;\n};\n\n\n\nNodeImpl * NamedNodeMapImpl::getNamedItem(const DOMString &name)\n{\n    int i=findNamePoint(name);\n    return (i<0) ? null : (NodeImpl *)(nodes->elementAt(i));\n};\n\n\n\nNodeImpl * NamedNodeMapImpl::item(unsigned int index)\n{\n    return (nodes != null && index < nodes->size()) ?\n        (NodeImpl *) (nodes->elementAt(index)) : null;\n};\n\n\n\/\/\n\/\/ removeNamedItem() - Remove the named item, and return it.\n\/\/                      The caller must arrange for deletion of the\n\/\/                      returned item if its refcount has gone to zero -\n\/\/                      we can't do it here because the caller would\n\/\/                      never see the returned node.\n\/\/\nNodeImpl * NamedNodeMapImpl::removeNamedItem(const DOMString &name)\n{\n    if (readOnly)\n        throw DOM_DOMException(\n            DOM_DOMException::NO_MODIFICATION_ALLOWED_ERR, null);\n    int i=findNamePoint(name);\n    NodeImpl *n = null;\n\n    if(i<0)\n        throw DOM_DOMException(DOM_DOMException::NOT_FOUND_ERR, null);\n\n    n = (NodeImpl *) (nodes->elementAt(i));\n    nodes->removeElementAt(i);\n    n->ownerNode = ownerNode->getOwnerDocument();\n    n->isOwned(false);\n    return n;\n};\n\n\n\nvoid NamedNodeMapImpl::removeRef(NamedNodeMapImpl *This)\n{\n    if (This && --This->refCount == 0)\n        delete This;\n};\n\n\/\/\n\/\/ setNamedItem()  Put the item into the NamedNodeList by name.\n\/\/                  If an item with the same name already was\n\/\/                  in the list, replace it.  Return the old\n\/\/                  item, if there was one.\n\/\/                  Caller is responsible for arranging for\n\/\/                  deletion of the old item if its ref count is\n\/\/                  zero.\n\/\/\nNodeImpl * NamedNodeMapImpl::setNamedItem(NodeImpl * arg)\n{\n    if(arg->getOwnerDocument() != ownerNode->getOwnerDocument())\n        throw DOM_DOMException(DOM_DOMException::WRONG_DOCUMENT_ERR,null);\n    if (readOnly)\n        throw DOM_DOMException(DOM_DOMException::NO_MODIFICATION_ALLOWED_ERR, null);\n    if (arg->isOwned())\n        throw DOM_DOMException(DOM_DOMException::INUSE_ATTRIBUTE_ERR,null);\n\n    arg->ownerNode = ownerNode;\n    arg->isOwned(true);\n    int i=findNamePoint(arg->getNodeName());\n    NodeImpl * previous=null;\n    if(i>=0)\n    {\n        previous = nodes->elementAt(i);\n        nodes->setElementAt(arg,i);\n    }\n    else\n    {\n        i=-1-i; \/\/ Insert point (may be end of list)\n        if(null==nodes)\n            nodes=new NodeVector();\n        nodes->insertElementAt(arg,i);\n    }\n    if (previous != null) {\n        previous->ownerNode = ownerNode->getOwnerDocument();\n        previous->isOwned(false);\n    }\n\n    return previous;\n};\n\n\nvoid NamedNodeMapImpl::setReadOnly(bool readOnl, bool deep)\n{\n    this->readOnly=readOnl;\n    if(deep && nodes!=null)\n    {\n        \/\/Enumeration e=nodes->elements();\n        \/\/while(e->hasMoreElements())\n        \/\/      ((NodeImpl)e->nextElement())->setReadOnly(readOnl,deep);\n        int sz = nodes->size();\n        for (int i=0; i<sz; ++i) {\n            nodes->elementAt(i)->setReadOnly(readOnl, deep);\n        }\n    }\n};\n\n\n\/\/Introduced in DOM Level 2\n\nint NamedNodeMapImpl::findNamePoint(const DOMString &namespaceURI,\n\tconst DOMString &localName)\n{\n    if (nodes == null)\n\treturn -1;\n    \/\/ This is a linear search through the same nodes Vector.\n    \/\/ The Vector is sorted on the DOM Level 1 nodename.\n    \/\/ The DOM Level 2 NS keys are namespaceURI and Localname, \n    \/\/ so we must linear search thru it.\n    \/\/ In addition, to get this to work with nodes without any namespace\n    \/\/ (namespaceURI and localNames are both null) we then use the nodeName\n    \/\/ as a secondary key.\n    int i, len = nodes -> size();\n    for (i = 0; i < len; ++i) {\n\tNodeImpl *node = nodes -> elementAt(i);\n\tif (! node -> getNamespaceURI().equals(namespaceURI))\t\/\/URI not match\n\t    continue;\n        DOMString nNamespaceURI = node->getNamespaceURI();\n        DOMString nLocalName = node->getLocalName();\n        if (namespaceURI == null) {\n            if (nNamespaceURI == null\n                &&\n                (localName.equals(nLocalName)\n                 ||\n                 (nLocalName == null && localName.equals(node->getNodeName()))))\n                return i;\n        } else {\n            if (namespaceURI.equals(nNamespaceURI)\n                &&\n                localName.equals(nLocalName))\n                return i;\n        }\n    }\n    return -1;\t\/\/not found\n}\n\n\nNodeImpl *NamedNodeMapImpl::getNamedItemNS(const DOMString &namespaceURI,\n\tconst DOMString &localName)\n{\n    int i = findNamePoint(namespaceURI, localName);\n    return i < 0 ? null : nodes -> elementAt(i);\n}\n\n\n\/\/\n\/\/ setNamedItemNS()  Put the item into the NamedNodeList by name.\n\/\/                  If an item with the same name already was\n\/\/                  in the list, replace it.  Return the old\n\/\/                  item, if there was one.\n\/\/                  Caller is responsible for arranging for\n\/\/                  deletion of the old item if its ref count is\n\/\/                  zero.\n\/\/\nNodeImpl * NamedNodeMapImpl::setNamedItemNS(NodeImpl *arg)\n{\n    if (arg->getOwnerDocument() != ownerNode->getOwnerDocument())\n        throw DOM_DOMException(DOM_DOMException::WRONG_DOCUMENT_ERR,null);\n    if (readOnly)\n        throw DOM_DOMException(DOM_DOMException::NO_MODIFICATION_ALLOWED_ERR, null);\n    if (arg->isOwned())\n        throw DOM_DOMException(DOM_DOMException::INUSE_ATTRIBUTE_ERR,null);\n\n    arg->ownerNode = ownerNode;\n    arg->isOwned(true);\n    int i=findNamePoint(arg->getNamespaceURI(), arg->getLocalName());\n    NodeImpl *previous=null;\n    if(i>=0) {\n        previous = nodes->elementAt(i);\n        nodes->setElementAt(arg,i);\n    } else {\n        i=-1-i; \/\/ Insert point (may be end of list)\n        if(null==nodes)\n            nodes=new NodeVector();\n        nodes->insertElementAt(arg,i);\n    }\n    if (previous != null) {\n        previous->ownerNode = ownerNode->getOwnerDocument();\n        previous->isOwned(false);\n    }\n\n    return previous;\n};\n\n\n\/\/ removeNamedItemNS() - Remove the named item, and return it.\n\/\/                      The caller must arrange for deletion of the\n\/\/                      returned item if its refcount has gone to zero -\n\/\/                      we can't do it here because the caller would\n\/\/                      never see the returned node.\nNodeImpl *NamedNodeMapImpl::removeNamedItemNS(const DOMString &namespaceURI,\n\tconst DOMString &localName)\n{\n    if (readOnly)\n        throw DOM_DOMException(\n        DOM_DOMException::NO_MODIFICATION_ALLOWED_ERR, null);\n    int i = findNamePoint(namespaceURI, localName);\n    if (i < 0)\n        throw DOM_DOMException(DOM_DOMException::NOT_FOUND_ERR, null);\n\n    NodeImpl * n = nodes -> elementAt(i);\n    nodes -> removeElementAt(i);\t\/\/remove n from nodes\n    n->ownerNode = ownerNode->getOwnerDocument();\n    n->isOwned(false);\n    return n;\n}\n\n\/**\n * NON-DOM\n * set the ownerDocument of this node, its children, and its attributes\n *\/\nvoid NamedNodeMapImpl::setOwnerDocument(DocumentImpl *doc) {\n    if (nodes != null) {\n        for (unsigned int i = 0; i < nodes->size(); i++) {\n            item(i)->setOwnerDocument(doc);\n        }\n    }\n}\n\n\nvoid NamedNodeMapImpl::cloneContent(NamedNodeMapImpl *srcmap) {\n\tif ((srcmap != null) && (srcmap->nodes != null))\n\t{\n\t\tif (nodes != null)\n\t\t\tdelete nodes;\n\t\tnodes = new NodeVector(srcmap->nodes->size());\n\t\tfor (unsigned int i = 0; i < srcmap->nodes->size(); i++)\n\t\t{\n\t\t\tNodeImpl *n = srcmap->nodes->elementAt(i);\n \t\t\tNodeImpl *clone = n->cloneNode(true);\n\t\t\tclone->isSpecified(n->isSpecified());\n\t\t\tclone->ownerNode = ownerNode;\n\t\t\tclone->isOwned(true);\n\t\t\tnodes->addElement(clone);\n\/\/\t\t\tn = null;\n\/\/\t\t\tclone = null;\n\t\t}\n\t}\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.7  2000\/02\/08 01:16:18  aruna1\n * nodeIterator previous tracking problem solved\n *\n * Revision 1.6  2000\/02\/06 07:47:33  rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.5  2000\/02\/04 01:49:26  aruna1\n * TreeWalker and NodeIterator changes\n *\n * Revision 1.4  1999\/11\/30 21:16:25  roddey\n * Changes to add the transcode() method to DOMString, which returns a transcoded\n * version (to local code page) of the DOM string contents. And I changed all of the\n * exception 'throw by pointer' to 'throw by value' style.\n *\n * Revision 1.3  1999\/11\/23 01:48:16  rahulj\n * Changed 0L to 0. CC under HPUX is happy now.\n *\n * Revision 1.2  1999\/11\/20 00:56:39  rahulj\n * Source files must end with an un-escaped newline.\n *\n * Revision 1.1.1.1  1999\/11\/09 01:09:15  twl\n * Initial checkin\n *\n * Revision 1.2  1999\/11\/08 20:44:30  rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\/\/ NodeIteratorImpl.cpp: implementation of the NodeIteratorImpl class.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"NodeIteratorImpl.hpp\"\n#include \"DOM_Document.hpp\"\n#include \"DOM_DOMException.hpp\"\n#include \"DocumentImpl.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Construction\/Destruction\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nNodeIteratorImpl::NodeIteratorImpl ()\n: fDetached(false),\n    fNodeFilter(0)\n{\n}\t\n\nNodeIteratorImpl::~NodeIteratorImpl ()\n{\n\tfDetached = false;\n}\n\n\nvoid NodeIteratorImpl::detach ()\n{\n\tfDetached = true;\n}\n\n\nNodeIteratorImpl::NodeIteratorImpl (\n                                    DOM_Node root, \n                                    unsigned long whatToShow, \n                                    DOM_NodeFilter* nodeFilter,\n                                    bool expandEntityRef)\n:   fDetached(false),\n    fRoot(root),\n    fCurrentNode(0),\n    fWhatToShow(whatToShow),\n    fNodeFilter(nodeFilter),\n    fForward(true),\n    fExpandEntityReferences(expandEntityRef)\n{\n\t\n}\n\n\nNodeIteratorImpl::NodeIteratorImpl ( const NodeIteratorImpl& toCopy)\n    :   fDetached(toCopy.fDetached),\n    fRoot(toCopy.fRoot),\n    fCurrentNode(toCopy.fCurrentNode),\n    fWhatToShow(toCopy.fWhatToShow),\n    fNodeFilter(toCopy.fNodeFilter),\n    fForward(toCopy.fForward),\n    fExpandEntityReferences(toCopy.fExpandEntityReferences)\n{\n}\n\n\nNodeIteratorImpl& NodeIteratorImpl::operator= (const NodeIteratorImpl& other) {\n    fRoot                   = other.fRoot;\n    fCurrentNode            = other.fRoot;\n    fWhatToShow             = other.fWhatToShow;\n    fNodeFilter             = other.fNodeFilter;\n    fForward                = other.fForward;\n\tfDetached               = other.fDetached;\n    fExpandEntityReferences = other.fExpandEntityReferences;\n    return *this;\n}\n\n\n\n\/\/ Implementation Note: Note that the iterator looks at whatToShow\n\/\/ and filter values at each call, and therefore one _could_ add\n\/\/ setters for these values and alter them while iterating!\n\n\/** Return the whatToShow value *\/\n\nunsigned long NodeIteratorImpl::getWhatToShow () {\n    return fWhatToShow;\n}\n\n\n\/** Return the filter *\/\n\nDOM_NodeFilter* NodeIteratorImpl::getFilter () {\n    return fNodeFilter;\n}\n\n\/** Get the expandEntity reference flag. *\/\nbool NodeIteratorImpl::getExpandEntityReferences()\n{\n    return fExpandEntityReferences;\n}\n\n\/** Return the next DOM_Node in the Iterator. The node is the next node in\n *  depth-first order which also passes the filter, and whatToShow.\n *  A null return means either that\n *\/\n\nDOM_Node NodeIteratorImpl::nextNode () {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n\tDOM_Node result;\n\n    \/\/ if root is null there is no next node.\n    if (fRoot.isNull())\n\t\t\treturn result;\n\n    DOM_Node aNextNode = fCurrentNode;\n    bool accepted = false; \/\/ the next node has not been accepted.\n\n    while (!accepted) {\n\n        \/\/ if last direction is not forward, repeat node.\n        if (!fForward && !aNextNode.isNull()) {\n            \/\/System.out.println(\"nextNode():!fForward:\"+fCurrentNode.getNodeName());\n            aNextNode = fCurrentNode;\n        } else {\n        \/\/ else get the next node via depth-first\n            aNextNode = nextNode(aNextNode, true);\n        }\n\n        fForward = true; \/\/REVIST: should direction be set forward before null check?\n\n        \/\/ nothing in the list. return null.\n        if (aNextNode.isNull())\n\t\t\t\t\treturn result;\n\n        \/\/ does node pass the filters and whatToShow?\n        accepted = acceptNode(aNextNode);\n        if (accepted) {\n            \/\/ if so, then the node is the current node.\n            fCurrentNode = aNextNode;\n            return fCurrentNode;\n\t\t\t\t}\n\n    }\n\n    \/\/ no nodes, or no accepted nodes.\n    return result;\n}\n\n\n\/** Return the previous Node in the Iterator. The node is the next node in\n *  _backwards_ depth-first order which also passes the filter, and whatToShow.\n *\/\n\nDOM_Node NodeIteratorImpl::previousNode () {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\t\t\n\tDOM_Node result;\n\n    \/\/ if the root is null, or the current node is null, return null.\n    if (fRoot.isNull() || fCurrentNode.isNull())\n\t\t\treturn result;\n\n    DOM_Node aPreviousNode = fCurrentNode;\n    bool accepted = false;\n\n    while (!accepted) {\n        \/\/ we are going backwards\n        fForward = false;\n\n        if (fForward && ! aPreviousNode.isNull()) {\n            \/\/repeat last node.\n            aPreviousNode = fCurrentNode;\n        } else {\n            \/\/ get previous node in backwards depth first order.\n            aPreviousNode = previousNode(aPreviousNode);\n        }\n  \n\n        \/\/ if the new previous node is null, we're at head or past the root,\n        \/\/ so return null.\n        if (aPreviousNode.isNull())\n\t\t\t\t\treturn result;\n\n        \/\/ check if node passes filters and whatToShow.\n        accepted = acceptNode(aPreviousNode);\n        if (accepted) {\n            \/\/ if accepted, update the current node, and return it.\n            fCurrentNode = aPreviousNode;\n            return fCurrentNode;\n        }\n    }\n    \/\/ there are no nodes?\n    return result;\n}\n\n\n\/** The node is accepted if it passes the whatToShow and the filter. *\/\nbool NodeIteratorImpl::acceptNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    if (fNodeFilter == 0) {\n        return ((fWhatToShow & ((1 << node.getNodeType()) - 1)) != 0);\n    } else {\n        return ((fWhatToShow & ((1 << node.getNodeType()) - 1)) != 0 )\n            && fNodeFilter->acceptNode(node) == DOM_NodeFilter::FILTER_ACCEPT;\n    }\n}\n\n\n\/** Return node, if matches or any parent if matches. *\/\nDOM_Node NodeIteratorImpl::matchNodeOrParent (DOM_Node node) {\n\t\tDOM_Node result;\n\n    for (DOM_Node n = node; n != fRoot; n = n.getParentNode()) {\n        if (node == n) return n;\n    }\n\n    return result;\n}\n\n\n\/** The method nextNode(DOM_Node, bool) returns the next node\n *  from the actual DOM tree.\n *\n *  The bool visitChildren determines whether to visit the children.\n *  The result is the nextNode.\n *\/\n\nDOM_Node NodeIteratorImpl::nextNode (DOM_Node node, bool visitChildren) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    if (node.isNull()) return fRoot;\n\n    DOM_Node result;\n    \/\/ only check children if we visit children.\n    if (visitChildren) {\n        \/\/if hasChildren, return 1st child.\n        if (node.hasChildNodes()) {\n            result = node.getFirstChild();\n            return result;\n        }\n    }\n\n    \/\/ if hasSibling, return sibling\n    result = node.getNextSibling();\n    if (! result.isNull()) return result;\n\n\n    \/\/ return parent's 1st sibling.\n    DOM_Node parent = node.getParentNode();\n    while (!parent.isNull() && parent != fRoot) {\n        result = parent.getNextSibling();\n        if (!result.isNull()) {\n            return result;\n        } else {\n            parent = parent.getParentNode();\n        }\n\n    } \/\/ while (parent != null && parent != fRoot) {\n\n    \/\/ end of list, return null\n\t\tDOM_Node aNull;\n    return aNull;\n}\n\n\n\/** The method previousNode(DOM_Node) returns the previous node\n *  from the actual DOM tree.\n *\/\n\nDOM_Node NodeIteratorImpl::previousNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    DOM_Node result;\n\n    \/\/ if we're at the root, return null.\n    if (node == fRoot)\n\t\t\treturn result;\n\n    \/\/ get sibling\n    result = node.getPreviousSibling();\n    if (result.isNull()) {\n        \/\/if 1st sibling, return parent\n        result = node.getParentNode();\n        return result;\n    }\n\n    \/\/ if sibling has children, keep getting last child of child.\n    if (result.hasChildNodes()) {\n        while (result.hasChildNodes()) {\n            result = result.getLastChild();\n        }\n    }\n\n    return result;\n}\n\n\n\/** Fix-up the iterator on a remove. Called by DOM or otherwise,\n *  before an actual DOM remove.\n *\/\n\nvoid NodeIteratorImpl::removeNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    \/\/ Implementation note: Fix-up means setting the current node properly\n    \/\/ after a remove.\n\n    if (node.isNull())\n\t\t\t\treturn;\n\n    DOM_Node deleted = matchNodeOrParent(node);\n\n    if (deleted.isNull()) return;\n\n    if (fForward) {\n        fCurrentNode = previousNode(deleted);\n    } else\n    \/\/ if (!fForward)\n    {\n        DOM_Node next = nextNode(deleted, false);\n        if (! next.isNull()) {\n            \/\/ normal case: there _are_ nodes following this in the iterator.\n            fCurrentNode = next;\n        } else {\n            \/\/ the last node in the iterator is to be removed,\n            \/\/ so we set the current node to be the previous one.\n            fCurrentNode = previousNode(deleted);\n            fForward = true;\n        }\n\n    }\n\n}\n\n\nvoid NodeIteratorImpl::unreferenced()\n{\n    DOM_Document doc = fRoot.getOwnerDocument();\n    DocumentImpl* impl;\n\n    if (! doc.isNull()) {\n        impl = (DocumentImpl *) doc.fImpl;\n    }\n    else\n        impl = (DocumentImpl *) fRoot.fImpl;\n\n    if (impl->iterators != 0L) {\n        int i;\n        int sz = impl->iterators->size();\n        for (i = 0; i < sz; i++)\n            if (impl->iterators->elementAt(i) == this) {\n                impl->iterators->removeElementAt(i);\n                break;\n            }\n    }\n\n    delete this;\n}\n<commit_msg>NodeIterator problem solved<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.8  2000\/02\/08 20:26:11  aruna1\n * NodeIterator problem solved\n *\n * Revision 1.7  2000\/02\/08 01:16:18  aruna1\n * nodeIterator previous tracking problem solved\n *\n * Revision 1.6  2000\/02\/06 07:47:33  rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.5  2000\/02\/04 01:49:26  aruna1\n * TreeWalker and NodeIterator changes\n *\n * Revision 1.4  1999\/11\/30 21:16:25  roddey\n * Changes to add the transcode() method to DOMString, which returns a transcoded\n * version (to local code page) of the DOM string contents. And I changed all of the\n * exception 'throw by pointer' to 'throw by value' style.\n *\n * Revision 1.3  1999\/11\/23 01:48:16  rahulj\n * Changed 0L to 0. CC under HPUX is happy now.\n *\n * Revision 1.2  1999\/11\/20 00:56:39  rahulj\n * Source files must end with an un-escaped newline.\n *\n * Revision 1.1.1.1  1999\/11\/09 01:09:15  twl\n * Initial checkin\n *\n * Revision 1.2  1999\/11\/08 20:44:30  rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\/\/ NodeIteratorImpl.cpp: implementation of the NodeIteratorImpl class.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"NodeIteratorImpl.hpp\"\n#include \"DOM_Document.hpp\"\n#include \"DOM_DOMException.hpp\"\n#include \"DocumentImpl.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Construction\/Destruction\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nNodeIteratorImpl::NodeIteratorImpl ()\n: fDetached(false),\n    fNodeFilter(0)\n{\n}\t\n\nNodeIteratorImpl::~NodeIteratorImpl ()\n{\n\tfDetached = false;\n}\n\n\nvoid NodeIteratorImpl::detach ()\n{\n\tfDetached = true;\n}\n\n\nNodeIteratorImpl::NodeIteratorImpl (\n                                    DOM_Node root, \n                                    unsigned long whatToShow, \n                                    DOM_NodeFilter* nodeFilter,\n                                    bool expandEntityRef)\n:   fDetached(false),\n    fRoot(root),\n    fCurrentNode(0),\n    fWhatToShow(whatToShow),\n    fNodeFilter(nodeFilter),\n    fForward(true),\n    fExpandEntityReferences(expandEntityRef)\n{\n\t\n}\n\n\nNodeIteratorImpl::NodeIteratorImpl ( const NodeIteratorImpl& toCopy)\n    :   fDetached(toCopy.fDetached),\n    fRoot(toCopy.fRoot),\n    fCurrentNode(toCopy.fCurrentNode),\n    fWhatToShow(toCopy.fWhatToShow),\n    fNodeFilter(toCopy.fNodeFilter),\n    fForward(toCopy.fForward),\n    fExpandEntityReferences(toCopy.fExpandEntityReferences)\n{\n}\n\n\nNodeIteratorImpl& NodeIteratorImpl::operator= (const NodeIteratorImpl& other) {\n    fRoot                   = other.fRoot;\n    fCurrentNode            = other.fRoot;\n    fWhatToShow             = other.fWhatToShow;\n    fNodeFilter             = other.fNodeFilter;\n    fForward                = other.fForward;\n\tfDetached               = other.fDetached;\n    fExpandEntityReferences = other.fExpandEntityReferences;\n    return *this;\n}\n\n\n\n\/\/ Implementation Note: Note that the iterator looks at whatToShow\n\/\/ and filter values at each call, and therefore one _could_ add\n\/\/ setters for these values and alter them while iterating!\n\n\/** Return the whatToShow value *\/\n\nunsigned long NodeIteratorImpl::getWhatToShow () {\n    return fWhatToShow;\n}\n\n\n\/** Return the filter *\/\n\nDOM_NodeFilter* NodeIteratorImpl::getFilter () {\n    return fNodeFilter;\n}\n\n\/** Get the expandEntity reference flag. *\/\nbool NodeIteratorImpl::getExpandEntityReferences()\n{\n    return fExpandEntityReferences;\n}\n\n\/** Return the next DOM_Node in the Iterator. The node is the next node in\n *  depth-first order which also passes the filter, and whatToShow.\n *  A null return means either that\n *\/\n\nDOM_Node NodeIteratorImpl::nextNode () {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n\tDOM_Node result;\n\n    \/\/ if root is null there is no next node.\n    if (fRoot.isNull())\n\t\t\treturn result;\n\n    DOM_Node aNextNode = fCurrentNode;\n    bool accepted = false; \/\/ the next node has not been accepted.\n\n    while (!accepted) {\n\n        \/\/ if last direction is not forward, repeat node.\n        if (!fForward && !aNextNode.isNull()) {\n            \/\/System.out.println(\"nextNode():!fForward:\"+fCurrentNode.getNodeName());\n            aNextNode = fCurrentNode;\n        } else {\n        \/\/ else get the next node via depth-first\n            aNextNode = nextNode(aNextNode, true);\n        }\n\n        fForward = true; \/\/REVIST: should direction be set forward before null check?\n\n        \/\/ nothing in the list. return null.\n        if (aNextNode.isNull())\n\t\t\t\t\treturn result;\n\n        \/\/ does node pass the filters and whatToShow?\n        accepted = acceptNode(aNextNode);\n        if (accepted) {\n            \/\/ if so, then the node is the current node.\n            fCurrentNode = aNextNode;\n            return fCurrentNode;\n\t\t\t\t}\n\n    }\n\n    \/\/ no nodes, or no accepted nodes.\n    return result;\n}\n\n\n\/** Return the previous Node in the Iterator. The node is the next node in\n *  _backwards_ depth-first order which also passes the filter, and whatToShow.\n *\/\n\nDOM_Node NodeIteratorImpl::previousNode () {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\t\t\n\tDOM_Node result;\n\n    \/\/ if the root is null, or the current node is null, return null.\n    if (fRoot.isNull() || fCurrentNode.isNull())\n\t\t\treturn result;\n\n    DOM_Node aPreviousNode = fCurrentNode;\n    bool accepted = false;\n\n    while (!accepted) {\n        \n\n        if (fForward && ! aPreviousNode.isNull()) {\n            \/\/repeat last node.\n            aPreviousNode = fCurrentNode;\n        } else {\n            \/\/ get previous node in backwards depth first order.\n            aPreviousNode = previousNode(aPreviousNode);\n        }\n  \n        \/\/ we are going backwards\n        fForward = false;\n\n        \/\/ if the new previous node is null, we're at head or past the root,\n        \/\/ so return null.\n        if (aPreviousNode.isNull())\n\t\t\t\t\treturn result;\n\n        \/\/ check if node passes filters and whatToShow.\n        accepted = acceptNode(aPreviousNode);\n        if (accepted) {\n            \/\/ if accepted, update the current node, and return it.\n            fCurrentNode = aPreviousNode;\n            return fCurrentNode;\n        }\n    }\n    \/\/ there are no nodes?\n    return result;\n}\n\n\n\/** The node is accepted if it passes the whatToShow and the filter. *\/\nbool NodeIteratorImpl::acceptNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    if (fNodeFilter == 0) {\n        return ((fWhatToShow & ((1 << node.getNodeType()) - 1)) != 0);\n    } else {\n        return ((fWhatToShow & ((1 << node.getNodeType()) - 1)) != 0 )\n            && fNodeFilter->acceptNode(node) == DOM_NodeFilter::FILTER_ACCEPT;\n    }\n}\n\n\n\/** Return node, if matches or any parent if matches. *\/\nDOM_Node NodeIteratorImpl::matchNodeOrParent (DOM_Node node) {\n\t\tDOM_Node result;\n\n    for (DOM_Node n = node; n != fRoot; n = n.getParentNode()) {\n        if (node == n) return n;\n    }\n\n    return result;\n}\n\n\n\/** The method nextNode(DOM_Node, bool) returns the next node\n *  from the actual DOM tree.\n *\n *  The bool visitChildren determines whether to visit the children.\n *  The result is the nextNode.\n *\/\n\nDOM_Node NodeIteratorImpl::nextNode (DOM_Node node, bool visitChildren) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    if (node.isNull()) return fRoot;\n\n    DOM_Node result;\n    \/\/ only check children if we visit children.\n    if (visitChildren) {\n        \/\/if hasChildren, return 1st child.\n        if (node.hasChildNodes()) {\n            result = node.getFirstChild();\n            return result;\n        }\n    }\n\n    \/\/ if hasSibling, return sibling\n    result = node.getNextSibling();\n    if (! result.isNull()) return result;\n\n\n    \/\/ return parent's 1st sibling.\n    DOM_Node parent = node.getParentNode();\n    while (!parent.isNull() && parent != fRoot) {\n        result = parent.getNextSibling();\n        if (!result.isNull()) {\n            return result;\n        } else {\n            parent = parent.getParentNode();\n        }\n\n    } \/\/ while (parent != null && parent != fRoot) {\n\n    \/\/ end of list, return null\n\t\tDOM_Node aNull;\n    return aNull;\n}\n\n\n\/** The method previousNode(DOM_Node) returns the previous node\n *  from the actual DOM tree.\n *\/\n\nDOM_Node NodeIteratorImpl::previousNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    DOM_Node result;\n\n    \/\/ if we're at the root, return null.\n    if (node == fRoot)\n\t\t\treturn result;\n\n    \/\/ get sibling\n    result = node.getPreviousSibling();\n    if (result.isNull()) {\n        \/\/if 1st sibling, return parent\n        result = node.getParentNode();\n        return result;\n    }\n\n    \/\/ if sibling has children, keep getting last child of child.\n    if (result.hasChildNodes()) {\n        while (result.hasChildNodes()) {\n            result = result.getLastChild();\n        }\n    }\n\n    return result;\n}\n\n\n\/** Fix-up the iterator on a remove. Called by DOM or otherwise,\n *  before an actual DOM remove.\n *\/\n\nvoid NodeIteratorImpl::removeNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    \/\/ Implementation note: Fix-up means setting the current node properly\n    \/\/ after a remove.\n\n    if (node.isNull())\n\t\t\t\treturn;\n\n    DOM_Node deleted = matchNodeOrParent(node);\n\n    if (deleted.isNull()) return;\n\n    if (fForward) {\n        fCurrentNode = previousNode(deleted);\n    } else\n    \/\/ if (!fForward)\n    {\n        DOM_Node next = nextNode(deleted, false);\n        if (! next.isNull()) {\n            \/\/ normal case: there _are_ nodes following this in the iterator.\n            fCurrentNode = next;\n        } else {\n            \/\/ the last node in the iterator is to be removed,\n            \/\/ so we set the current node to be the previous one.\n            fCurrentNode = previousNode(deleted);\n            fForward = true;\n        }\n\n    }\n\n}\n\n\nvoid NodeIteratorImpl::unreferenced()\n{\n    DOM_Document doc = fRoot.getOwnerDocument();\n    DocumentImpl* impl;\n\n    if (! doc.isNull()) {\n        impl = (DocumentImpl *) doc.fImpl;\n    }\n    else\n        impl = (DocumentImpl *) fRoot.fImpl;\n\n    if (impl->iterators != 0L) {\n        int i;\n        int sz = impl->iterators->size();\n        for (i = 0; i < sz; i++)\n            if (impl->iterators->elementAt(i) == this) {\n                impl->iterators->removeElementAt(i);\n                break;\n            }\n    }\n\n    delete this;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n===========================================================================\n\ndaemon gpl source code\ncopyright (c) 2013 unvanquished developers\n\nthis file is part of the daemon gpl source code (daemon source code).\n\ndaemon source code 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 3 of the license, or\n(at your option) any later version.\n\ndaemon source code 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 general public license\nalong with daemon source code.  if not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n===========================================================================\n*\/\n\n#include \"AudioPrivate.h\"\n\nnamespace Audio {\n\n    \/\/ Structures to keep the state of entities we were given\n    struct entityData_t {\n        vec3_t position;\n        vec3_t velocity;\n        float occlusion;\n    };\n    static entityData_t entities[MAX_GENTITIES];\n    static int listenerEntity = -1;\n\n    \/\/ Keep Entitymitters in an array because there is at most one per entity.\n    static std::shared_ptr<Emitter> entityEmitters[MAX_GENTITIES];\n\n    \/\/ Position Emitters can be reused so we keep the list of all of them\n    \/\/ this is not very efficient but we cannot have more position emitters\n    \/\/ than sounds, that is about 128\n    static std::vector<std::shared_ptr<PositionEmitter>> posEmitters;\n\n    \/\/ There is a single LocalEmitter\n    static std::shared_ptr<Emitter> localEmitter;\n\n    static const vec3_t origin = {0.0f, 0.0f, 0.0f};\n\n    static Cvar::Cvar<bool> useDoppler(\"audio.doppler\", \"should the doppler effect be used\", Cvar::ARCHIVE, true);\n    static Cvar::Modified<Cvar::Cvar<bool>> useReverb(\"audio.reverb\", \"should reverb effects be used\", Cvar::ARCHIVE, true);\n    \/\/TODO use optional once we have it\n    static bool removeReverb = false;\n    static bool addReverb = false;\n\n    static AL::EffectSlot* globalEffect = nullptr;\n\n    static bool initialized = false;\n\n    void UseDoppler(bool use) {\n        float factor = use ? 1.0f : 0.0f;\n        AL::SetDopplerExaggerationFactor(factor);\n    }\n\n    void InitEmitters() {\n        if (initialized) {\n            return;\n        }\n\n        \/\/ This is a temporrary effect to test reverb\n        auto preset = AL::GetPresetByName(\"hangar\");\n\n        if (preset) {\n            AL::Effect effectParams;\n            effectParams.ApplyReverbPreset(*AL::GetPresetByName(\"hangar\"));\n\n            globalEffect = new AL::EffectSlot();\n            globalEffect->SetEffect(effectParams);\n        } else {\n            audioLogs.Warn(\"Couldn't load the default preset\");\n        }\n\n        AL::SetInverseDistanceModel();\n        AL::SetSpeedOfSound(SPEED_OF_SOUND);\n        UseDoppler(useDoppler.Get());\n\n        localEmitter = std::make_shared<LocalEmitter>();\n\n        initialized = true;\n    }\n\n    void ShutdownEmitters() {\n        if (not initialized) {\n            return;\n        }\n\n        localEmitter = nullptr;\n\n        for (int i = 0; i < MAX_GENTITIES; i++) {\n            if (entityEmitters[i]) {\n                entityEmitters[i] = nullptr;\n            }\n        }\n\n        posEmitters.clear();\n\n        delete globalEffect;\n        globalEffect = nullptr;\n\n        initialized = false;\n    }\n\n    void UpdateEmitters() {\n        localEmitter->Update();\n\n        \/\/ Both PositionEmitters and EntityEmitters are ref-counted.\n        \/\/ If we hold the only reference to them then no sound is still using\n        \/\/ the Emitter that can be destroyed.\n        for (int i = 0; i < MAX_GENTITIES; i++) {\n            auto emitter = entityEmitters[i];\n\n            if (not emitter) {\n                continue;\n            }\n\n            emitter->Update();\n\n            \/\/ No sound is using this emitter, destroy it\n            if (emitter.unique()) {\n                entityEmitters[i] = nullptr;\n            }\n        }\n\n        for (auto it = posEmitters.begin(); it != posEmitters.end();){\n            (*it)->Update();\n\n            \/\/ No sound is using this emitter, destroy it\n            if ((*it).unique()) {\n                it = posEmitters.erase(it);\n            } else {\n                it ++;\n            }\n        }\n\n        addReverb = removeReverb = false;\n        bool use;\n        if (useReverb.GetModifiedValue(use)) {\n            if (use) {\n                addReverb = true;\n            } else {\n                removeReverb = true;\n            }\n        }\n\n        UseDoppler(useDoppler.Get());\n    }\n\n    void UpdateListenerEntity(int entityNum, const vec3_t orientation[3]) {\n        listenerEntity = entityNum;\n\n        AL::SetListenerPosition(entities[listenerEntity].position);\n        AL::SetListenerVelocity(entities[listenerEntity].velocity);\n        AL::SetListenerOrientation(orientation);\n    }\n\n    std::shared_ptr<Emitter> GetEmitterForEntity(int entityNum) {\n        if (not entityEmitters[entityNum]) {\n            entityEmitters[entityNum] = std::make_shared<EntityEmitter>(entityNum);\n        }\n\n        return entityEmitters[entityNum];\n    }\n\n    std::shared_ptr<Emitter> GetEmitterForPosition(const vec3_t position) {\n        for (auto emitter : posEmitters) {\n            if (Distance(emitter->GetPosition(), position) <= 1.0f) {\n                return emitter;\n            }\n        }\n        auto emitter = std::make_shared<PositionEmitter>(position);\n        posEmitters.push_back(emitter);\n        return emitter;\n    }\n\n    std::shared_ptr<Emitter> GetLocalEmitter() {\n        return localEmitter;\n    }\n\n    void UpdateRegisteredEntityPosition(int entityNum, const vec3_t position) {\n        VectorCopy(position, entities[entityNum].position);\n    }\n\n    void UpdateRegisteredEntityVelocity(int entityNum, const vec3_t velocity) {\n        VectorCopy(velocity, entities[entityNum].velocity);\n    }\n\n    \/\/ Utility functions for emitters\n\n    \/\/ TODO avoid more unnecessary al calls\n\n    void MakeLocal(AL::Source& source) {\n        source.SetRelative(true);\n        source.SetPosition(origin);\n        source.SetVelocity(origin);\n\n        source.DisableEffect(POSITIONAL_EFFECT_SLOT);\n    }\n\n    void Make3D(AL::Source& source, const vec3_t position, const vec3_t velocity, bool forceReverb = false) {\n        source.SetRelative(false);\n        source.SetPosition(position);\n        source.SetVelocity(velocity);\n\n        if ((forceReverb and useReverb.Get()) or addReverb) {\n            source.EnableEffect(POSITIONAL_EFFECT_SLOT, *globalEffect);\n        } else if ((forceReverb and not useReverb.Get()) or removeReverb) {\n            source.DisableEffect(POSITIONAL_EFFECT_SLOT);\n        }\n    }\n\n    \/\/ Implementation for Emitter\n\n    Emitter::Emitter() {\n    }\n\n    Emitter::~Emitter() {\n    }\n\n    void Emitter::SetupSound(Sound& sound) {\n        sound.GetSource().SetReferenceDistance(120.0f);\n        InternalSetupSound(sound);\n        UpdateSound(sound);\n    }\n\n    \/\/ Implementation of EntityEmitter\n\n    EntityEmitter::EntityEmitter(int entityNum): entityNum(entityNum) {\n    }\n\n    EntityEmitter::~EntityEmitter(){\n    }\n\n    void EntityEmitter::Update() {\n        \/\/ TODO\n    }\n\n    void EntityEmitter::UpdateSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        if (entityNum == listenerEntity) {\n            MakeLocal(source);\n        } else {\n            Make3D(source, entities[entityNum].position, entities[entityNum].velocity);\n        }\n    }\n\n    void EntityEmitter::InternalSetupSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        Make3D(source, entities[entityNum].position, entities[entityNum].velocity, true);\n    }\n\n    \/\/ Implementation of PositionEmitter\n\n    PositionEmitter::PositionEmitter(const vec3_t position){\n        VectorCopy(position, this->position);\n    }\n\n    PositionEmitter::~PositionEmitter() {\n    }\n\n    void PositionEmitter::Update() {\n        \/\/TODO\n    }\n\n    void PositionEmitter::UpdateSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        Make3D(source, position, origin);\n    }\n\n    void PositionEmitter::InternalSetupSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        Make3D(source, position, origin, true);\n    }\n\n    const vec3_t& PositionEmitter::GetPosition() const {\n        return position;\n    }\n\n    \/\/ Implementation of LocalEmitter\n\n    LocalEmitter::LocalEmitter() {\n    }\n\n    LocalEmitter::~LocalEmitter() {\n    }\n\n    void LocalEmitter::Update() {\n    }\n\n    void LocalEmitter::UpdateSound(Sound&) {\n    }\n\n    void LocalEmitter::InternalSetupSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        MakeLocal(source);\n    }\n\n    class TestReverbCmd : public Cmd::StaticCmd {\n        public:\n            TestReverbCmd(): StaticCmd(\"testReverb\", Cmd::AUDIO, N_(\"Tests a reverb preset.\")) {\n            }\n\n            virtual void Run(const Cmd::Args& args) const OVERRIDE {\n                if (args.Argc() != 2) {\n                    PrintUsage(args, \"[preset name]\", \"tests the reverb preset.\");\n                    return;\n                }\n\n                auto preset = AL::GetPresetByName(args.Argv(1));\n\n                if (not preset) {\n                    Print(\"Reverb preset '%s' doesn't exist.\", args.Argv(1));\n                    return;\n                }\n\n                AL::Effect effectParams;\n                effectParams.ApplyReverbPreset(*preset);\n\n                globalEffect->SetEffect(effectParams);\n            }\n\n            Cmd::CompletionResult Complete(int argNum, const Cmd::Args&, Str::StringRef prefix) const OVERRIDE {\n                if (argNum != 1) {\n                    return {};\n                }\n                std::vector<std::string> presets = AL::ListPresetNames();\n                std::sort(presets.begin(), presets.end());\n\n                Cmd::CompletionResult res;\n\n                for (auto& name: presets) {\n                    if (Str::IsPrefix(prefix, name)) {\n                        res.push_back({std::move(name), \"\"});\n                    }\n                }\n\n                return res;\n            }\n    };\n    static TestReverbCmd testReverbRegistration;\n\n}\n<commit_msg>Audio: Change the default reverb preset to something less extreme<commit_after>\/*\n===========================================================================\n\ndaemon gpl source code\ncopyright (c) 2013 unvanquished developers\n\nthis file is part of the daemon gpl source code (daemon source code).\n\ndaemon source code 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 3 of the license, or\n(at your option) any later version.\n\ndaemon source code 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 general public license\nalong with daemon source code.  if not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n===========================================================================\n*\/\n\n#include \"AudioPrivate.h\"\n\nnamespace Audio {\n\n    \/\/ Structures to keep the state of entities we were given\n    struct entityData_t {\n        vec3_t position;\n        vec3_t velocity;\n        float occlusion;\n    };\n    static entityData_t entities[MAX_GENTITIES];\n    static int listenerEntity = -1;\n\n    \/\/ Keep Entitymitters in an array because there is at most one per entity.\n    static std::shared_ptr<Emitter> entityEmitters[MAX_GENTITIES];\n\n    \/\/ Position Emitters can be reused so we keep the list of all of them\n    \/\/ this is not very efficient but we cannot have more position emitters\n    \/\/ than sounds, that is about 128\n    static std::vector<std::shared_ptr<PositionEmitter>> posEmitters;\n\n    \/\/ There is a single LocalEmitter\n    static std::shared_ptr<Emitter> localEmitter;\n\n    static const vec3_t origin = {0.0f, 0.0f, 0.0f};\n\n    static Cvar::Cvar<bool> useDoppler(\"audio.doppler\", \"should the doppler effect be used\", Cvar::ARCHIVE, true);\n    static Cvar::Modified<Cvar::Cvar<bool>> useReverb(\"audio.reverb\", \"should reverb effects be used\", Cvar::ARCHIVE, true);\n    \/\/TODO use optional once we have it\n    static bool removeReverb = false;\n    static bool addReverb = false;\n\n    static AL::EffectSlot* globalEffect = nullptr;\n\n    static bool initialized = false;\n\n    void UseDoppler(bool use) {\n        float factor = use ? 1.0f : 0.0f;\n        AL::SetDopplerExaggerationFactor(factor);\n    }\n\n    void InitEmitters() {\n        if (initialized) {\n            return;\n        }\n\n        auto preset = AL::GetPresetByName(\"generic\");\n        if (preset) {\n            AL::Effect effectParams;\n            effectParams.ApplyReverbPreset(*preset);\n\n            globalEffect = new AL::EffectSlot();\n            globalEffect->SetEffect(effectParams);\n        } else {\n            audioLogs.Warn(\"Couldn't load the default preset\");\n        }\n\n        AL::SetInverseDistanceModel();\n        AL::SetSpeedOfSound(SPEED_OF_SOUND);\n        UseDoppler(useDoppler.Get());\n\n        localEmitter = std::make_shared<LocalEmitter>();\n\n        initialized = true;\n    }\n\n    void ShutdownEmitters() {\n        if (not initialized) {\n            return;\n        }\n\n        localEmitter = nullptr;\n\n        for (int i = 0; i < MAX_GENTITIES; i++) {\n            if (entityEmitters[i]) {\n                entityEmitters[i] = nullptr;\n            }\n        }\n\n        posEmitters.clear();\n\n        delete globalEffect;\n        globalEffect = nullptr;\n\n        initialized = false;\n    }\n\n    void UpdateEmitters() {\n        localEmitter->Update();\n\n        \/\/ Both PositionEmitters and EntityEmitters are ref-counted.\n        \/\/ If we hold the only reference to them then no sound is still using\n        \/\/ the Emitter that can be destroyed.\n        for (int i = 0; i < MAX_GENTITIES; i++) {\n            auto emitter = entityEmitters[i];\n\n            if (not emitter) {\n                continue;\n            }\n\n            emitter->Update();\n\n            \/\/ No sound is using this emitter, destroy it\n            if (emitter.unique()) {\n                entityEmitters[i] = nullptr;\n            }\n        }\n\n        for (auto it = posEmitters.begin(); it != posEmitters.end();){\n            (*it)->Update();\n\n            \/\/ No sound is using this emitter, destroy it\n            if ((*it).unique()) {\n                it = posEmitters.erase(it);\n            } else {\n                it ++;\n            }\n        }\n\n        addReverb = removeReverb = false;\n        bool use;\n        if (useReverb.GetModifiedValue(use)) {\n            if (use) {\n                addReverb = true;\n            } else {\n                removeReverb = true;\n            }\n        }\n\n        UseDoppler(useDoppler.Get());\n    }\n\n    void UpdateListenerEntity(int entityNum, const vec3_t orientation[3]) {\n        listenerEntity = entityNum;\n\n        AL::SetListenerPosition(entities[listenerEntity].position);\n        AL::SetListenerVelocity(entities[listenerEntity].velocity);\n        AL::SetListenerOrientation(orientation);\n    }\n\n    std::shared_ptr<Emitter> GetEmitterForEntity(int entityNum) {\n        if (not entityEmitters[entityNum]) {\n            entityEmitters[entityNum] = std::make_shared<EntityEmitter>(entityNum);\n        }\n\n        return entityEmitters[entityNum];\n    }\n\n    std::shared_ptr<Emitter> GetEmitterForPosition(const vec3_t position) {\n        for (auto emitter : posEmitters) {\n            if (Distance(emitter->GetPosition(), position) <= 1.0f) {\n                return emitter;\n            }\n        }\n        auto emitter = std::make_shared<PositionEmitter>(position);\n        posEmitters.push_back(emitter);\n        return emitter;\n    }\n\n    std::shared_ptr<Emitter> GetLocalEmitter() {\n        return localEmitter;\n    }\n\n    void UpdateRegisteredEntityPosition(int entityNum, const vec3_t position) {\n        VectorCopy(position, entities[entityNum].position);\n    }\n\n    void UpdateRegisteredEntityVelocity(int entityNum, const vec3_t velocity) {\n        VectorCopy(velocity, entities[entityNum].velocity);\n    }\n\n    \/\/ Utility functions for emitters\n\n    \/\/ TODO avoid more unnecessary al calls\n\n    void MakeLocal(AL::Source& source) {\n        source.SetRelative(true);\n        source.SetPosition(origin);\n        source.SetVelocity(origin);\n\n        source.DisableEffect(POSITIONAL_EFFECT_SLOT);\n    }\n\n    void Make3D(AL::Source& source, const vec3_t position, const vec3_t velocity, bool forceReverb = false) {\n        source.SetRelative(false);\n        source.SetPosition(position);\n        source.SetVelocity(velocity);\n\n        if ((forceReverb and useReverb.Get()) or addReverb) {\n            source.EnableEffect(POSITIONAL_EFFECT_SLOT, *globalEffect);\n        } else if ((forceReverb and not useReverb.Get()) or removeReverb) {\n            source.DisableEffect(POSITIONAL_EFFECT_SLOT);\n        }\n    }\n\n    \/\/ Implementation for Emitter\n\n    Emitter::Emitter() {\n    }\n\n    Emitter::~Emitter() {\n    }\n\n    void Emitter::SetupSound(Sound& sound) {\n        sound.GetSource().SetReferenceDistance(120.0f);\n        InternalSetupSound(sound);\n        UpdateSound(sound);\n    }\n\n    \/\/ Implementation of EntityEmitter\n\n    EntityEmitter::EntityEmitter(int entityNum): entityNum(entityNum) {\n    }\n\n    EntityEmitter::~EntityEmitter(){\n    }\n\n    void EntityEmitter::Update() {\n        \/\/ TODO\n    }\n\n    void EntityEmitter::UpdateSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        if (entityNum == listenerEntity) {\n            MakeLocal(source);\n        } else {\n            Make3D(source, entities[entityNum].position, entities[entityNum].velocity);\n        }\n    }\n\n    void EntityEmitter::InternalSetupSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        Make3D(source, entities[entityNum].position, entities[entityNum].velocity, true);\n    }\n\n    \/\/ Implementation of PositionEmitter\n\n    PositionEmitter::PositionEmitter(const vec3_t position){\n        VectorCopy(position, this->position);\n    }\n\n    PositionEmitter::~PositionEmitter() {\n    }\n\n    void PositionEmitter::Update() {\n        \/\/TODO\n    }\n\n    void PositionEmitter::UpdateSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        Make3D(source, position, origin);\n    }\n\n    void PositionEmitter::InternalSetupSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        Make3D(source, position, origin, true);\n    }\n\n    const vec3_t& PositionEmitter::GetPosition() const {\n        return position;\n    }\n\n    \/\/ Implementation of LocalEmitter\n\n    LocalEmitter::LocalEmitter() {\n    }\n\n    LocalEmitter::~LocalEmitter() {\n    }\n\n    void LocalEmitter::Update() {\n    }\n\n    void LocalEmitter::UpdateSound(Sound&) {\n    }\n\n    void LocalEmitter::InternalSetupSound(Sound& sound) {\n        AL::Source& source = sound.GetSource();\n\n        MakeLocal(source);\n    }\n\n    class TestReverbCmd : public Cmd::StaticCmd {\n        public:\n            TestReverbCmd(): StaticCmd(\"testReverb\", Cmd::AUDIO, N_(\"Tests a reverb preset.\")) {\n            }\n\n            virtual void Run(const Cmd::Args& args) const OVERRIDE {\n                if (args.Argc() != 2) {\n                    PrintUsage(args, \"[preset name]\", \"tests the reverb preset.\");\n                    return;\n                }\n\n                auto preset = AL::GetPresetByName(args.Argv(1));\n\n                if (not preset) {\n                    Print(\"Reverb preset '%s' doesn't exist.\", args.Argv(1));\n                    return;\n                }\n\n                AL::Effect effectParams;\n                effectParams.ApplyReverbPreset(*preset);\n\n                globalEffect->SetEffect(effectParams);\n            }\n\n            Cmd::CompletionResult Complete(int argNum, const Cmd::Args&, Str::StringRef prefix) const OVERRIDE {\n                if (argNum != 1) {\n                    return {};\n                }\n                std::vector<std::string> presets = AL::ListPresetNames();\n                std::sort(presets.begin(), presets.end());\n\n                Cmd::CompletionResult res;\n\n                for (auto& name: presets) {\n                    if (Str::IsPrefix(prefix, name)) {\n                        res.push_back({std::move(name), \"\"});\n                    }\n                }\n\n                return res;\n            }\n    };\n    static TestReverbCmd testReverbRegistration;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <bashclass\/BArrayUse.h>\n#include <bashclass\/BElementType.h>\n\nBArrayUse::BArrayUse() {\n    m_type = std::make_shared<BElementType>();\n}\n\nvoid BArrayUse::setTypeLexicalToken(std::shared_ptr<ecc::LexicalToken> lexicalToken) {\n    m_type->setLexicalToken(lexicalToken);\n}\n\nvoid BArrayUse::castType(std::shared_ptr<BElementType> type) {\n    m_type->cast(type);\n}<commit_msg>Fixed bug in array use<commit_after>#include <bashclass\/BArrayUse.h>\n\nBArrayUse::BArrayUse() {\n    m_type = std::make_shared<BElementType>();\n}\n\nvoid BArrayUse::setTypeLexicalToken(std::shared_ptr<ecc::LexicalToken> lexicalToken) {\n\n    \/\/ Set the type lexical token\n    m_type->setLexicalToken(lexicalToken);\n\n    \/\/ Link type\n    m_type->linkType();\n}\n\nvoid BArrayUse::castType(std::shared_ptr<BElementType> type) {\n    m_type->cast(type);\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n *  This file is part of Poedit (https:\/\/poedit.net)\n *\n *  Copyright (C) 2000-2019 Vaclav Slavik\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\n#include \"extractor.h\"\n\n#include \"extractor_legacy.h\"\n\n#include \"gexecute.h\"\n\n#include <wx\/dir.h>\n#include <wx\/filename.h>\n\n#include <algorithm>\n\nnamespace\n{\n\n\/\/ Path matching with support for wildcards\n\nstruct PathToMatch\n{\n    wxString path;\n    bool isWildcard;\n\n    bool MatchesFile(const wxString& fn) const\n    {\n        if (isWildcard)\n            return wxMatchWild(path, fn);\n        else\n            return fn == path || fn.StartsWith(path + \"\/\");\n    }\n};\n\nclass PathsToMatch\n{\npublic:\n    PathsToMatch() {}\n    explicit PathsToMatch(const wxArrayString& a)\n    {\n        paths.reserve(a.size());\n        for (auto& p: a)\n            paths.push_back({p, wxIsWild(p)});\n    }\n\n    bool MatchesFile(const wxString& fn) const\n    {\n        for (auto& p: paths)\n        {\n            if (p.MatchesFile(fn))\n                return true;\n        }\n        return false;\n    }\n\nprivate:\n    std::vector<PathToMatch> paths;\n};\n\n\nint FindInDir(const wxString& basepath, const wxString& dirname, const PathsToMatch& excludedPaths,\n              Extractor::FilesList& output)\n{\n    if (dirname.empty())\n        return 0;\n\n    wxDir dir(basepath + dirname);\n    if (!dir.IsOpened()) \n        return 0;\n\n    bool cont;\n    wxString filename;\n    int found = 0;\n    \n    cont = dir.GetFirst(&filename, wxEmptyString, wxDIR_FILES);\n    while (cont)\n    {\n        const wxString f = (dirname == \".\") ? filename : dirname + \"\/\" + filename;\n        cont = dir.GetNext(&filename);\n\n        if (excludedPaths.MatchesFile(f))\n            continue;\n\n        wxLogTrace(\"poedit.extractor\", \"  - %s\", f);\n        output.push_back(f);\n        found++;\n    }\n\n    cont = dir.GetFirst(&filename, wxEmptyString, wxDIR_DIRS);\n    while (cont)\n    {\n        const wxString f = (dirname == \".\") ? filename : dirname + \"\/\" + filename;\n        cont = dir.GetNext(&filename);\n\n        if (excludedPaths.MatchesFile(f))\n            continue;\n\n        found += FindInDir(basepath, f, excludedPaths, output);\n    }\n\n    return found;\n}\n\n} \/\/ anonymous namespace\n\n\nExtractor::FilesList Extractor::CollectAllFiles(const SourceCodeSpec& sources)\n{\n    \/\/ TODO: Only collect files with recognized extensions\n\n    wxLogTrace(\"poedit.extractor\", \"collecting files:\");\n\n    const auto basepath = sources.BasePath;\n    const auto excludedPaths = PathsToMatch(sources.ExcludedPaths);\n\n    FilesList output;\n\n    for (auto& path: sources.SearchPaths)\n    {\n        if (wxFileName::FileExists(basepath + path))\n        {\n            if (excludedPaths.MatchesFile(path))\n            {\n                wxLogTrace(\"poedit.extractor\", \"no files found in '%s'\", path);\n                continue;\n            }\n            wxLogTrace(\"poedit.extractor\", \"  - %s\", path);\n            output.push_back(path);\n        }\n        else if (!FindInDir(basepath, path, excludedPaths, output))\n        {\n            wxLogTrace(\"poedit.extractor\", \"no files found in '%s'\", path);\n        }\n    }\n\n    \/\/ Sort the filenames in some well-defined order. This is because directory\n    \/\/ traversal has, generally speaking, undefined order, and the order differs\n    \/\/ between filesystems. Finally, the order is reflected in the created PO\n    \/\/ files and it is much better for diffs if it remains consistent.\n    std::sort(output.begin(), output.end());\n\n    wxLogTrace(\"poedit.extractor\", \"finished collecting %d files\", (int)output.size());\n\n    return output;\n}\n\n\nwxString Extractor::ExtractWithAll(TempDirectory& tmpdir,\n                                   const SourceCodeSpec& sourceSpec,\n                                   const std::vector<wxString>& files_)\n{\n    auto files = files_;\n    wxLogTrace(\"poedit.extractor\", \"extracting from %d files\", (int)files.size());\n\n    std::vector<wxString> subPots;\n\n    for (auto ex: CreateAllExtractors())\n    {\n        const auto ex_files = ex->FilterFiles(files);\n        if (ex_files.empty())\n            continue;\n\n        wxLogTrace(\"poedit.extractor\", \" .. using extractor '%s' for %d files\", ex->GetId(), (int)ex_files.size());\n        auto subPot = ex->Extract(tmpdir, sourceSpec, ex_files);\n        if (!subPot.empty())\n            subPots.push_back(subPot);\n\n        if (files.size() > ex_files.size())\n        {\n            FilesList remaining;\n            remaining.reserve(files.size() - ex_files.size());\n            \/\/ Note that this only works because the lists are sorted:\n            std::set_difference(files.begin(), files.end(),\n                                ex_files.begin(), ex_files.end(),\n                                std::inserter(remaining, remaining.begin()));\n            std::swap(files, remaining);\n        }\n        else\n        {\n            files.clear();\n            break; \/\/ no more work to do\n        }\n    }\n\n    wxLogTrace(\"poedit.extractor\", \"extraction finished with %d unrecognized files and %d sub-POTs\", (int)files.size(), (int)subPots.size());\n\n    if (subPots.empty())\n    {\n        return \"\";\n    }\n    else if (subPots.size() == 1)\n    {\n        return subPots.front();\n    }\n    else\n    {\n        wxLogTrace(\"poedit.extractor\", \"merging %d subPOTs\", (int)subPots.size());\n        return ConcatCatalogs(tmpdir, subPots);\n    }\n}\n\n\nExtractor::FilesList Extractor::FilterFiles(const FilesList& files) const\n{\n    FilesList out;\n    for (auto& f: files)\n    {\n        if (IsFileSupported(f))\n            out.push_back(f);\n    }\n    return out;\n}\n\n\nbool Extractor::IsFileSupported(const wxString& file) const\n{\n#ifdef __WXMSW__\n    auto f = file.Lower();\n#else\n    auto& f = file;\n#endif\n\n    auto ext = f.AfterLast('.');\n    if (ext != f && m_extensions.find(ext) != m_extensions.end())\n        return true;\n\n    for (auto& w: m_wildcards)\n    {\n        if (f.Matches(w))\n            return true;\n    }\n\n    return false;\n}\n\n\nvoid Extractor::RegisterExtension(const wxString& ext)\n{\n    if (ext.Contains(\".\"))\n    {\n        RegisterWildcard(\"*.\" + ext);\n        return;\n    }\n\n#ifdef __WXMSW__\n    m_extensions.insert(ext.Lower());\n#else\n    m_extensions.insert(ext);\n#endif\n    wxLogTrace(\"poedit.extractor\", \"%s handles extension %s\", GetId(), ext);\n}\n\nvoid Extractor::RegisterWildcard(const wxString& wildcard)\n{\n#ifdef __WXMSW__\n    m_wildcards.push_back(wildcard.Lower());\n#else\n    m_wildcards.push_back(wildcard);\n#endif\n    wxLogTrace(\"poedit.extractor\", \"%s handles %s\", GetId(), wildcard);\n}\n\n\nwxString Extractor::ConcatCatalogs(TempDirectory& tmpdir, const std::vector<wxString>& files)\n{\n    if (files.empty())\n    {\n        return \"\";\n    }\n    else if (files.size() == 1)\n    {\n        return files.front();\n    }\n\n    auto outfile = tmpdir.CreateFileName(\"concatenated.pot\");\n\n    wxString list;\n    for (auto& f: files)\n        list += wxString::Format(\" %s\", QuoteCmdlineArg(f));\n\n    auto cmd = wxString::Format(\"msgcat --force-po -o %s %s\", QuoteCmdlineArg(outfile), list);\n    bool succ = ExecuteGettext(cmd);\n\n    if (!succ)\n    {\n        wxLogError(_(\"Failed command: %s\"), cmd.c_str());\n        wxLogError(_(\"Failed to merge gettext catalogs.\"));\n        return \"\";\n    }\n\n    return outfile;\n}\n\n\nExtractor::ExtractorsList Extractor::CreateAllExtractors()\n{\n    ExtractorsList all;\n\n    \/\/ User-defined \"legacy\" extractors take precedence over anything else,\n    \/\/ to allow customization of the behavior:\n    CreateAllLegacyExtractors(all);\n\n    \/\/ Standard builtin extractors follow\n    CreateGettextExtractors(all);\n\n    return all;\n}\n<commit_msg>Skip over common VCS directories during extraction<commit_after>\/*\n *  This file is part of Poedit (https:\/\/poedit.net)\n *\n *  Copyright (C) 2000-2019 Vaclav Slavik\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\n#include \"extractor.h\"\n\n#include \"extractor_legacy.h\"\n\n#include \"gexecute.h\"\n\n#include <wx\/dir.h>\n#include <wx\/filename.h>\n\n#include <algorithm>\n\nnamespace\n{\n\n\/\/ Path matching with support for wildcards\n\nstruct PathToMatch\n{\n    wxString path;\n    bool isWildcard;\n\n    bool MatchesFile(const wxString& fn) const\n    {\n        if (isWildcard)\n            return wxMatchWild(path, fn);\n        else\n            return fn == path || fn.StartsWith(path + \"\/\");\n    }\n};\n\nclass PathsToMatch\n{\npublic:\n    PathsToMatch() {}\n    explicit PathsToMatch(const wxArrayString& a)\n    {\n        paths.reserve(a.size());\n        for (auto& p: a)\n            paths.push_back({p, wxIsWild(p)});\n    }\n\n    bool MatchesFile(const wxString& fn) const\n    {\n        for (auto& p: paths)\n        {\n            if (p.MatchesFile(fn))\n                return true;\n        }\n        return false;\n    }\n\nprivate:\n    std::vector<PathToMatch> paths;\n};\n\n\ninline bool IsVCSDir(const wxString& d)\n{\n    return d == \".git\" || d == \".svn\" || d == \".hg\" || d == \".bzr\" || d == \"CVS\";\n}\n\n\nint FindInDir(const wxString& basepath, const wxString& dirname, const PathsToMatch& excludedPaths,\n              Extractor::FilesList& output)\n{\n    if (dirname.empty())\n        return 0;\n\n    wxDir dir(basepath + dirname);\n    if (!dir.IsOpened()) \n        return 0;\n\n    bool cont;\n    wxString filename;\n    int found = 0;\n    \n    cont = dir.GetFirst(&filename, wxEmptyString, wxDIR_FILES);\n    while (cont)\n    {\n        const wxString f = (dirname == \".\") ? filename : dirname + \"\/\" + filename;\n        cont = dir.GetNext(&filename);\n\n        if (excludedPaths.MatchesFile(f))\n            continue;\n\n        wxLogTrace(\"poedit.extractor\", \"  - %s\", f);\n        output.push_back(f);\n        found++;\n    }\n\n    cont = dir.GetFirst(&filename, wxEmptyString, wxDIR_DIRS);\n    while (cont)\n    {\n        const wxString f = (dirname == \".\") ? filename : dirname + \"\/\" + filename;\n        cont = dir.GetNext(&filename);\n\n        if (IsVCSDir(filename))\n            continue;\n\n        if (excludedPaths.MatchesFile(f))\n            continue;\n\n        found += FindInDir(basepath, f, excludedPaths, output);\n    }\n\n    return found;\n}\n\n} \/\/ anonymous namespace\n\n\nExtractor::FilesList Extractor::CollectAllFiles(const SourceCodeSpec& sources)\n{\n    \/\/ TODO: Only collect files with recognized extensions\n\n    wxLogTrace(\"poedit.extractor\", \"collecting files:\");\n\n    const auto basepath = sources.BasePath;\n    const auto excludedPaths = PathsToMatch(sources.ExcludedPaths);\n\n    FilesList output;\n\n    for (auto& path: sources.SearchPaths)\n    {\n        if (wxFileName::FileExists(basepath + path))\n        {\n            if (excludedPaths.MatchesFile(path))\n            {\n                wxLogTrace(\"poedit.extractor\", \"no files found in '%s'\", path);\n                continue;\n            }\n            wxLogTrace(\"poedit.extractor\", \"  - %s\", path);\n            output.push_back(path);\n        }\n        else if (!FindInDir(basepath, path, excludedPaths, output))\n        {\n            wxLogTrace(\"poedit.extractor\", \"no files found in '%s'\", path);\n        }\n    }\n\n    \/\/ Sort the filenames in some well-defined order. This is because directory\n    \/\/ traversal has, generally speaking, undefined order, and the order differs\n    \/\/ between filesystems. Finally, the order is reflected in the created PO\n    \/\/ files and it is much better for diffs if it remains consistent.\n    std::sort(output.begin(), output.end());\n\n    wxLogTrace(\"poedit.extractor\", \"finished collecting %d files\", (int)output.size());\n\n    return output;\n}\n\n\nwxString Extractor::ExtractWithAll(TempDirectory& tmpdir,\n                                   const SourceCodeSpec& sourceSpec,\n                                   const std::vector<wxString>& files_)\n{\n    auto files = files_;\n    wxLogTrace(\"poedit.extractor\", \"extracting from %d files\", (int)files.size());\n\n    std::vector<wxString> subPots;\n\n    for (auto ex: CreateAllExtractors())\n    {\n        const auto ex_files = ex->FilterFiles(files);\n        if (ex_files.empty())\n            continue;\n\n        wxLogTrace(\"poedit.extractor\", \" .. using extractor '%s' for %d files\", ex->GetId(), (int)ex_files.size());\n        auto subPot = ex->Extract(tmpdir, sourceSpec, ex_files);\n        if (!subPot.empty())\n            subPots.push_back(subPot);\n\n        if (files.size() > ex_files.size())\n        {\n            FilesList remaining;\n            remaining.reserve(files.size() - ex_files.size());\n            \/\/ Note that this only works because the lists are sorted:\n            std::set_difference(files.begin(), files.end(),\n                                ex_files.begin(), ex_files.end(),\n                                std::inserter(remaining, remaining.begin()));\n            std::swap(files, remaining);\n        }\n        else\n        {\n            files.clear();\n            break; \/\/ no more work to do\n        }\n    }\n\n    wxLogTrace(\"poedit.extractor\", \"extraction finished with %d unrecognized files and %d sub-POTs\", (int)files.size(), (int)subPots.size());\n\n    if (subPots.empty())\n    {\n        return \"\";\n    }\n    else if (subPots.size() == 1)\n    {\n        return subPots.front();\n    }\n    else\n    {\n        wxLogTrace(\"poedit.extractor\", \"merging %d subPOTs\", (int)subPots.size());\n        return ConcatCatalogs(tmpdir, subPots);\n    }\n}\n\n\nExtractor::FilesList Extractor::FilterFiles(const FilesList& files) const\n{\n    FilesList out;\n    for (auto& f: files)\n    {\n        if (IsFileSupported(f))\n            out.push_back(f);\n    }\n    return out;\n}\n\n\nbool Extractor::IsFileSupported(const wxString& file) const\n{\n#ifdef __WXMSW__\n    auto f = file.Lower();\n#else\n    auto& f = file;\n#endif\n\n    auto ext = f.AfterLast('.');\n    if (ext != f && m_extensions.find(ext) != m_extensions.end())\n        return true;\n\n    for (auto& w: m_wildcards)\n    {\n        if (f.Matches(w))\n            return true;\n    }\n\n    return false;\n}\n\n\nvoid Extractor::RegisterExtension(const wxString& ext)\n{\n    if (ext.Contains(\".\"))\n    {\n        RegisterWildcard(\"*.\" + ext);\n        return;\n    }\n\n#ifdef __WXMSW__\n    m_extensions.insert(ext.Lower());\n#else\n    m_extensions.insert(ext);\n#endif\n    wxLogTrace(\"poedit.extractor\", \"%s handles extension %s\", GetId(), ext);\n}\n\nvoid Extractor::RegisterWildcard(const wxString& wildcard)\n{\n#ifdef __WXMSW__\n    m_wildcards.push_back(wildcard.Lower());\n#else\n    m_wildcards.push_back(wildcard);\n#endif\n    wxLogTrace(\"poedit.extractor\", \"%s handles %s\", GetId(), wildcard);\n}\n\n\nwxString Extractor::ConcatCatalogs(TempDirectory& tmpdir, const std::vector<wxString>& files)\n{\n    if (files.empty())\n    {\n        return \"\";\n    }\n    else if (files.size() == 1)\n    {\n        return files.front();\n    }\n\n    auto outfile = tmpdir.CreateFileName(\"concatenated.pot\");\n\n    wxString list;\n    for (auto& f: files)\n        list += wxString::Format(\" %s\", QuoteCmdlineArg(f));\n\n    auto cmd = wxString::Format(\"msgcat --force-po -o %s %s\", QuoteCmdlineArg(outfile), list);\n    bool succ = ExecuteGettext(cmd);\n\n    if (!succ)\n    {\n        wxLogError(_(\"Failed command: %s\"), cmd.c_str());\n        wxLogError(_(\"Failed to merge gettext catalogs.\"));\n        return \"\";\n    }\n\n    return outfile;\n}\n\n\nExtractor::ExtractorsList Extractor::CreateAllExtractors()\n{\n    ExtractorsList all;\n\n    \/\/ User-defined \"legacy\" extractors take precedence over anything else,\n    \/\/ to allow customization of the behavior:\n    CreateAllLegacyExtractors(all);\n\n    \/\/ Standard builtin extractors follow\n    CreateGettextExtractors(all);\n\n    return all;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Author: newsworthy39\n * Documentation: http:\/\/www.sfml-dev.org\/documentation\/2.2\/\n *\/\n\n#include <iostream>\n#include <SFML\/Graphics.hpp>\n\nusing namespace std;\n\nint main() {\n\n    sf::ContextSettings settings;\n    settings.antialiasingLevel = 8;\n\n    sf::RenderWindow window(sf::VideoMode(1024, 768), \"SFML works!\",\n            sf::Style::Default, settings);\n\n    sf::CircleShape shape(100.f);\n    shape.setFillColor(sf::Color::Green);\n\n    while (window.isOpen()) {\n        sf::Event event;\n        while (window.pollEvent(event)) {\n            if (sf::Keyboard::isKeyPressed(sf::Keyboard::Right)) {\n                \/\/ left key is pressed: move our character\n                shape.move(1, 0);\n            }\n\n            if (sf::Keyboard::isKeyPressed(sf::Keyboard::Left)) {\n                \/\/ left key is pressed: move our character\n                shape.move(-1, 0);\n            }\n\n            if (event.type == sf::Event::Closed)\n                window.close();\n        }\n\n        window.clear();\n        window.draw(shape);\n        window.display();\n    }\n\n    return 0;\n}\n<commit_msg>Lets try this<commit_after>\/**\n * Author: newsworthy39\n * Documentation: http:\/\/www.sfml-dev.org\/documentation\/2.2\/\n *\/\n\n#include <iostream>\n#include <SFML\/Graphics.hpp>\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n\n    sf::ContextSettings settings;\n    settings.antialiasingLevel = 8;\n\n    sf::RenderWindow window(sf::VideoMode(640, 480), \"SFML works!\",\n            sf::Style::Default, settings);\n\n    sf::Vertex line[] = {\n            sf::Vertex(sf::Vector2f(100,100), sf::Color::White),\n            sf::Vertex(sf::Vector2f(100,100), sf::Color::White)\n    };\n\n    float degrees = 1.0f;\n\n    while (window.isOpen()) {\n        sf::Event event;\n        while (window.pollEvent(event)) {\n\n            if (event.type == sf::Event::Closed)\n                window.close();\n        }\n\n        degrees += 0.1f;\n\n        line[1].position.x = 100 + (std::cos((2 * M_PI \/ 360 ) * degrees)*100);\n        line[1].position.y = 100 + (std::sin((2 * M_PI \/ 360) * degrees)*100);\n\n        window.clear();\n        window.draw(line, 2, sf::Lines);\n        window.display();\n    }\n\n    return 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\/\/ mapnik\n#include <mapnik\/debug.hpp>\n#include <mapnik\/font_engine_freetype.hpp>\n#include <mapnik\/pixel_position.hpp>\n#include <mapnik\/text\/face.hpp>\n#include <mapnik\/util\/fs.hpp>\n\n\/\/ boost\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/filesystem.hpp>\n\n\/\/ stl\n#include <algorithm>\n#include <stdexcept>\n#include <cstdlib>\n\n\/\/ freetype2\nextern \"C\"\n{\n#include <ft2build.h>\n#include FT_FREETYPE_H\n#include FT_STROKER_H\n#include FT_MODULE_H\n}\n\nvoid* _Alloc_Func(FT_Memory memory, long size)\n{\n    return std::malloc(size);\n}\n\nvoid _Free_Func(FT_Memory memory, void *block)\n{\n    std::free(block);\n}\n\nvoid* _Realloc_Func(FT_Memory memory, long cur_size, long new_size, void* block)\n{\n    return std::realloc(block, new_size);\n}\n\nnamespace mapnik\n{\n\nvoid init_freetype(FT_Memory memory, FT_Library & library)\n{\n    memory->alloc = _Alloc_Func;\n    memory->free = _Free_Func;\n    memory->realloc = _Realloc_Func;\n    FT_Error error = FT_New_Library(memory, &library );\n    if (error) throw std::runtime_error(\"can not initalise FreeType2 library\");\n    FT_Add_Default_Modules(library);\n}\n\nfreetype_engine::freetype_engine() :\n    library_(nullptr),\n    memory_(new FT_MemoryRec_)\n\n{\n    init_freetype(&*memory_, library_);\n}\n\nfreetype_engine::~freetype_engine()\n{\n    FT_Done_Library(library_);\n}\n\nbool freetype_engine::is_font_file(std::string const& file_name)\n{\n    \/\/ only accept files that will be matched by freetype2's `figurefiletype()`\n    std::string fn = file_name;\n    std::transform(fn.begin(), fn.end(), fn.begin(), ::tolower);\n    return boost::algorithm::ends_with(fn,std::string(\".ttf\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".otf\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".ttc\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".pfa\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".pfb\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".ttc\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".woff\"))||\n        \/\/ Plus OSX custom ext\n        boost::algorithm::ends_with(fn,std::string(\".dfont\"));\n}\n\nbool freetype_engine::register_font(std::string const& file_name)\n{\n#ifdef MAPNIK_THREADSAFE\n    mapnik::scoped_lock lock(mutex_);\n#endif\n    std::unique_ptr<FT_MemoryRec_> memory(new FT_MemoryRec_);\n    FT_Library library = 0;\n    init_freetype(&*memory, library);\n    bool result = register_font_impl(file_name, library);\n    FT_Done_Library(library);\n    return result;\n}\n\nbool freetype_engine::register_font_impl(std::string const& file_name, FT_LibraryRec_ * library)\n{\n    FT_Face face = 0;\n    int num_faces = 0;\n    bool success = false;\n    \/\/ some font files have multiple fonts in a file\n    \/\/ the count is in the 'root' face library[0]\n    \/\/ see the FT_FaceRec in freetype.h\n    for ( int i = 0; face == 0 || i < num_faces; i++ ) {\n        \/\/ if face is null then this is the first face\n        FT_Error error = FT_New_Face (library,file_name.c_str(),i,&face);\n        if (error)\n        {\n            break;\n        }\n        \/\/ store num_faces locally, after FT_Done_Face it can not be accessed any more\n        if (!num_faces)\n            num_faces = face->num_faces;\n        \/\/ some fonts can lack names, skip them\n        \/\/ http:\/\/www.freetype.org\/freetype2\/docs\/reference\/ft2-base_interface.html#FT_FaceRec\n        if (face->family_name && face->style_name)\n        {\n            std::string name = std::string(face->family_name) + \" \" + std::string(face->style_name);\n            \/\/ skip fonts with leading . in the name\n            if (!boost::algorithm::starts_with(name,\".\"))\n            {\n                name2file_.insert(std::make_pair(name, std::make_pair(i,file_name)));\n                success = true;\n            }\n        }\n        else\n        {\n            std::ostringstream s;\n            s << \"Warning: unable to load font file '\" << file_name << \"' \";\n            if (!face->family_name && !face->style_name)\n                s << \"which lacks both a family name and style name\";\n            else if (face->family_name)\n                s << \"which reports a family name of '\" << std::string(face->family_name) << \"' and lacks a style name\";\n            else if (face->style_name)\n                s << \"which reports a style name of '\" << std::string(face->style_name) << \"' and lacks a family name\";\n\n            MAPNIK_LOG_ERROR(font_engine_freetype) << \"register_font: \" << s.str();\n        }\n    }\n\n    if (face) FT_Done_Face(face);\n\n    return success;\n}\n\nbool freetype_engine::register_fonts(std::string const& dir, bool recurse)\n{\n#ifdef MAPNIK_THREADSAFE\n    mapnik::scoped_lock lock(mutex_);\n#endif\n    std::unique_ptr<FT_MemoryRec_> memory(new FT_MemoryRec_);\n    FT_Library library = 0;\n    init_freetype(&*memory, library);\n    bool result = register_fonts_impl(dir, library, recurse);\n    FT_Done_Library(library);\n    return result;\n}\n\nbool freetype_engine::register_fonts_impl(std::string const& dir, FT_LibraryRec_ * library, bool recurse)\n{\n    if (!mapnik::util::exists(dir))\n    {\n        return false;\n    }\n    if (!mapnik::util::is_directory(dir))\n    {\n        return mapnik::freetype_engine::register_font_impl(dir, library);\n    }\n    bool success = false;\n    try\n    {\n        boost::filesystem::directory_iterator end_itr;\n        for (boost::filesystem::directory_iterator itr(dir); itr != end_itr; ++itr)\n        {\n#if (BOOST_FILESYSTEM_VERSION == 3)\n            std::string file_name = itr->path().string();\n#else \/\/ v2\n            std::string file_name = itr->string();\n#endif\n            if (boost::filesystem::is_directory(*itr) && recurse)\n            {\n                if (register_fonts_impl(file_name, library, true))\n                {\n                    success = true;\n                }\n            }\n            else\n            {\n#if (BOOST_FILESYSTEM_VERSION == 3)\n                std::string base_name = itr->path().filename().string();\n#else \/\/ v2\n                std::string base_name = itr->filename();\n#endif\n                if (!boost::algorithm::starts_with(base_name,\".\") &&\n                    boost::filesystem::is_regular_file(file_name) &&\n                    is_font_file(file_name))\n                {\n                    if (mapnik::freetype_engine::register_font_impl(file_name, library))\n                    {\n                        success = true;\n                    }\n                }\n            }\n        }\n    }\n    catch (std::exception const& ex)\n    {\n        MAPNIK_LOG_ERROR(font_engine_freetype) << \"register_fonts: \" << ex.what();\n    }\n    return success;\n}\n\n\nstd::vector<std::string> freetype_engine::face_names ()\n{\n    std::vector<std::string> names;\n    std::map<std::string,std::pair<int,std::string> >::const_iterator itr;\n    for (itr = name2file_.begin();itr!=name2file_.end();++itr)\n    {\n        names.push_back(itr->first);\n    }\n    return names;\n}\n\nstd::map<std::string,std::pair<int,std::string> > const& freetype_engine::get_mapping()\n{\n    return name2file_;\n}\n\n\nface_ptr freetype_engine::create_face(std::string const& family_name)\n{\n    std::map<std::string, std::pair<int,std::string> >::const_iterator itr;\n    itr = name2file_.find(family_name);\n    if (itr != name2file_.end())\n    {\n        FT_Face face;\n\n        std::map<std::string,std::string>::const_iterator mem_font_itr = memory_fonts_.find(itr->second.second);\n\n        if (mem_font_itr != memory_fonts_.end()) \/\/ memory font\n        {\n            FT_Error error = FT_New_Memory_Face(library_,\n                                                reinterpret_cast<FT_Byte const*>(mem_font_itr->second.c_str()),\n                                                static_cast<FT_Long>(mem_font_itr->second.size()), \/\/ size\n                                                itr->second.first, \/\/ face index\n                                                &face);\n\n            if (!error) return std::make_shared<font_face>(face);\n        }\n        else\n        {\n            \/\/ load font into memory\n#ifdef MAPNIK_THREADSAFE\n            mapnik::scoped_lock lock(mutex_);\n#endif\n            std::ifstream is(itr->second.second.c_str() , std::ios::binary);\n            std::string buffer((std::istreambuf_iterator<char>(is)),\n                               std::istreambuf_iterator<char>());\n            std::pair<std::map<std::string,std::string>::iterator,bool> result\n                = memory_fonts_.insert(std::make_pair(itr->second.second, buffer));\n\n            FT_Error error = FT_New_Memory_Face (library_,\n                                                 reinterpret_cast<FT_Byte const*>(result.first->second.c_str()),\n                                                 static_cast<FT_Long>(buffer.size()),\n                                                 itr->second.first,\n                                                 &face);\n            if (!error) return std::make_shared<font_face>(face);\n            else\n            {\n                \/\/ we can't load font, erase it.\n                memory_fonts_.erase(result.first);\n            }\n        }\n    }\n    return face_ptr();\n}\n\n\nstroker_ptr freetype_engine::create_stroker()\n{\n    FT_Stroker s;\n    FT_Error error = FT_Stroker_New(library_, &s);\n    if (!error)\n    {\n        return std::make_shared<stroker>(s);\n    }\n    return stroker_ptr();\n}\n\n\n\ntemplate <typename T>\nface_ptr face_manager<T>::get_face(const std::string &name)\n{\n    face_ptr_cache_type::iterator itr;\n    itr = face_ptr_cache_.find(name);\n    if (itr != face_ptr_cache_.end())\n    {\n        return itr->second;\n    }\n    else\n    {\n        face_ptr face = engine_.create_face(name);\n        if (face)\n        {\n            face_ptr_cache_.insert(make_pair(name,face));\n        }\n        return face;\n    }\n}\n\ntemplate <typename T>\nface_set_ptr face_manager<T>::get_face_set(const std::string &name)\n{\n    face_set_ptr face_set = std::make_shared<font_face_set>();\n    if (face_ptr face = get_face(name))\n    {\n        face_set->add(face);\n    }\n    return face_set;\n}\n\ntemplate <typename T>\nface_set_ptr face_manager<T>::get_face_set(const font_set &fset)\n{\n    std::vector<std::string> const& names = fset.get_face_names();\n    face_set_ptr face_set = std::make_shared<font_face_set>();\n    for (std::vector<std::string>::const_iterator name = names.begin(); name != names.end(); ++name)\n    {\n        face_ptr face = get_face(*name);\n        if (face)\n        {\n            face_set->add(face);\n        }\n#ifdef MAPNIK_LOG\n        else\n        {\n            MAPNIK_LOG_DEBUG(font_engine_freetype)\n                << \"Failed to find face '\" << *name\n                << \"' in font set '\" << fset.get_name() << \"'\\n\";\n        }\n#endif\n    }\n    return face_set;\n}\n\ntemplate <typename T>\nface_set_ptr face_manager<T>::get_face_set(const std::string &name, boost::optional<font_set> fset)\n{\n    if (fset && fset->size() > 0)\n    {\n        return get_face_set(*fset);\n    }\n    else\n    {\n        return get_face_set(name);\n    }\n}\n\n#ifdef MAPNIK_THREADSAFE\nstd::mutex freetype_engine::mutex_;\n#endif\nstd::map<std::string,std::pair<int,std::string> > freetype_engine::name2file_;\nstd::map<std::string,std::string> freetype_engine::memory_fonts_;\ntemplate class face_manager<freetype_engine>;\n\n}\n<commit_msg>mapnik c++ style<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\/\/ mapnik\n#include <mapnik\/debug.hpp>\n#include <mapnik\/font_engine_freetype.hpp>\n#include <mapnik\/pixel_position.hpp>\n#include <mapnik\/text\/face.hpp>\n#include <mapnik\/util\/fs.hpp>\n\n\/\/ boost\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/filesystem.hpp>\n\n\/\/ stl\n#include <algorithm>\n#include <stdexcept>\n#include <cstdlib>\n\n\/\/ freetype2\nextern \"C\"\n{\n#include <ft2build.h>\n#include FT_FREETYPE_H\n#include FT_STROKER_H\n#include FT_MODULE_H\n}\n\nvoid* _Alloc_Func(FT_Memory memory, long size)\n{\n    return std::malloc(size);\n}\n\nvoid _Free_Func(FT_Memory memory, void *block)\n{\n    std::free(block);\n}\n\nvoid* _Realloc_Func(FT_Memory memory, long cur_size, long new_size, void* block)\n{\n    return std::realloc(block, new_size);\n}\n\nnamespace mapnik\n{\n\nvoid init_freetype(FT_Memory memory, FT_Library & library)\n{\n    memory->alloc = _Alloc_Func;\n    memory->free = _Free_Func;\n    memory->realloc = _Realloc_Func;\n    FT_Error error = FT_New_Library(memory, &library );\n    if (error) throw std::runtime_error(\"can not initalise FreeType2 library\");\n    FT_Add_Default_Modules(library);\n}\n\nfreetype_engine::freetype_engine()\n    : library_(nullptr),\n      memory_(new FT_MemoryRec_)\n{\n    init_freetype(&*memory_, library_);\n}\n\nfreetype_engine::~freetype_engine()\n{\n    FT_Done_Library(library_);\n}\n\nbool freetype_engine::is_font_file(std::string const& file_name)\n{\n    \/\/ only accept files that will be matched by freetype2's `figurefiletype()`\n    std::string fn = file_name;\n    std::transform(fn.begin(), fn.end(), fn.begin(), ::tolower);\n    return boost::algorithm::ends_with(fn,std::string(\".ttf\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".otf\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".ttc\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".pfa\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".pfb\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".ttc\")) ||\n        boost::algorithm::ends_with(fn,std::string(\".woff\"))||\n        \/\/ Plus OSX custom ext\n        boost::algorithm::ends_with(fn,std::string(\".dfont\"));\n}\n\nbool freetype_engine::register_font(std::string const& file_name)\n{\n#ifdef MAPNIK_THREADSAFE\n    mapnik::scoped_lock lock(mutex_);\n#endif\n    std::unique_ptr<FT_MemoryRec_> memory(new FT_MemoryRec_);\n    FT_Library library = 0;\n    init_freetype(&*memory, library);\n    bool result = register_font_impl(file_name, library);\n    FT_Done_Library(library);\n    return result;\n}\n\nbool freetype_engine::register_font_impl(std::string const& file_name, FT_LibraryRec_ * library)\n{\n    FT_Face face = 0;\n    int num_faces = 0;\n    bool success = false;\n    \/\/ some font files have multiple fonts in a file\n    \/\/ the count is in the 'root' face library[0]\n    \/\/ see the FT_FaceRec in freetype.h\n    for ( int i = 0; face == 0 || i < num_faces; i++ ) {\n        \/\/ if face is null then this is the first face\n        FT_Error error = FT_New_Face (library,file_name.c_str(),i,&face);\n        if (error)\n        {\n            break;\n        }\n        \/\/ store num_faces locally, after FT_Done_Face it can not be accessed any more\n        if (!num_faces)\n            num_faces = face->num_faces;\n        \/\/ some fonts can lack names, skip them\n        \/\/ http:\/\/www.freetype.org\/freetype2\/docs\/reference\/ft2-base_interface.html#FT_FaceRec\n        if (face->family_name && face->style_name)\n        {\n            std::string name = std::string(face->family_name) + \" \" + std::string(face->style_name);\n            \/\/ skip fonts with leading . in the name\n            if (!boost::algorithm::starts_with(name,\".\"))\n            {\n                name2file_.insert(std::make_pair(name, std::make_pair(i,file_name)));\n                success = true;\n            }\n        }\n        else\n        {\n            std::ostringstream s;\n            s << \"Warning: unable to load font file '\" << file_name << \"' \";\n            if (!face->family_name && !face->style_name)\n                s << \"which lacks both a family name and style name\";\n            else if (face->family_name)\n                s << \"which reports a family name of '\" << std::string(face->family_name) << \"' and lacks a style name\";\n            else if (face->style_name)\n                s << \"which reports a style name of '\" << std::string(face->style_name) << \"' and lacks a family name\";\n\n            MAPNIK_LOG_ERROR(font_engine_freetype) << \"register_font: \" << s.str();\n        }\n    }\n\n    if (face) FT_Done_Face(face);\n\n    return success;\n}\n\nbool freetype_engine::register_fonts(std::string const& dir, bool recurse)\n{\n#ifdef MAPNIK_THREADSAFE\n    mapnik::scoped_lock lock(mutex_);\n#endif\n    std::unique_ptr<FT_MemoryRec_> memory(new FT_MemoryRec_);\n    FT_Library library = 0;\n    init_freetype(&*memory, library);\n    bool result = register_fonts_impl(dir, library, recurse);\n    FT_Done_Library(library);\n    return result;\n}\n\nbool freetype_engine::register_fonts_impl(std::string const& dir, FT_LibraryRec_ * library, bool recurse)\n{\n    if (!mapnik::util::exists(dir))\n    {\n        return false;\n    }\n    if (!mapnik::util::is_directory(dir))\n    {\n        return mapnik::freetype_engine::register_font_impl(dir, library);\n    }\n    bool success = false;\n    try\n    {\n        boost::filesystem::directory_iterator end_itr;\n        for (boost::filesystem::directory_iterator itr(dir); itr != end_itr; ++itr)\n        {\n#if (BOOST_FILESYSTEM_VERSION == 3)\n            std::string file_name = itr->path().string();\n#else \/\/ v2\n            std::string file_name = itr->string();\n#endif\n            if (boost::filesystem::is_directory(*itr) && recurse)\n            {\n                if (register_fonts_impl(file_name, library, true))\n                {\n                    success = true;\n                }\n            }\n            else\n            {\n#if (BOOST_FILESYSTEM_VERSION == 3)\n                std::string base_name = itr->path().filename().string();\n#else \/\/ v2\n                std::string base_name = itr->filename();\n#endif\n                if (!boost::algorithm::starts_with(base_name,\".\") &&\n                    boost::filesystem::is_regular_file(file_name) &&\n                    is_font_file(file_name))\n                {\n                    if (mapnik::freetype_engine::register_font_impl(file_name, library))\n                    {\n                        success = true;\n                    }\n                }\n            }\n        }\n    }\n    catch (std::exception const& ex)\n    {\n        MAPNIK_LOG_ERROR(font_engine_freetype) << \"register_fonts: \" << ex.what();\n    }\n    return success;\n}\n\n\nstd::vector<std::string> freetype_engine::face_names ()\n{\n    std::vector<std::string> names;\n    std::map<std::string,std::pair<int,std::string> >::const_iterator itr;\n    for (itr = name2file_.begin();itr!=name2file_.end();++itr)\n    {\n        names.push_back(itr->first);\n    }\n    return names;\n}\n\nstd::map<std::string,std::pair<int,std::string> > const& freetype_engine::get_mapping()\n{\n    return name2file_;\n}\n\n\nface_ptr freetype_engine::create_face(std::string const& family_name)\n{\n    std::map<std::string, std::pair<int,std::string> >::const_iterator itr;\n    itr = name2file_.find(family_name);\n    if (itr != name2file_.end())\n    {\n        FT_Face face;\n\n        std::map<std::string,std::string>::const_iterator mem_font_itr = memory_fonts_.find(itr->second.second);\n\n        if (mem_font_itr != memory_fonts_.end()) \/\/ memory font\n        {\n            FT_Error error = FT_New_Memory_Face(library_,\n                                                reinterpret_cast<FT_Byte const*>(mem_font_itr->second.c_str()),\n                                                static_cast<FT_Long>(mem_font_itr->second.size()), \/\/ size\n                                                itr->second.first, \/\/ face index\n                                                &face);\n\n            if (!error) return std::make_shared<font_face>(face);\n        }\n        else\n        {\n            \/\/ load font into memory\n#ifdef MAPNIK_THREADSAFE\n            mapnik::scoped_lock lock(mutex_);\n#endif\n            std::ifstream is(itr->second.second.c_str() , std::ios::binary);\n            std::string buffer((std::istreambuf_iterator<char>(is)),\n                               std::istreambuf_iterator<char>());\n            std::pair<std::map<std::string,std::string>::iterator,bool> result\n                = memory_fonts_.insert(std::make_pair(itr->second.second, buffer));\n\n            FT_Error error = FT_New_Memory_Face (library_,\n                                                 reinterpret_cast<FT_Byte const*>(result.first->second.c_str()),\n                                                 static_cast<FT_Long>(buffer.size()),\n                                                 itr->second.first,\n                                                 &face);\n            if (!error) return std::make_shared<font_face>(face);\n            else\n            {\n                \/\/ we can't load font, erase it.\n                memory_fonts_.erase(result.first);\n            }\n        }\n    }\n    return face_ptr();\n}\n\n\nstroker_ptr freetype_engine::create_stroker()\n{\n    FT_Stroker s;\n    FT_Error error = FT_Stroker_New(library_, &s);\n    if (!error)\n    {\n        return std::make_shared<stroker>(s);\n    }\n    return stroker_ptr();\n}\n\n\n\ntemplate <typename T>\nface_ptr face_manager<T>::get_face(std::string const& name)\n{\n    auto itr = face_ptr_cache_.find(name);\n    if (itr != face_ptr_cache_.end())\n    {\n        return itr->second;\n    }\n    else\n    {\n        face_ptr face = engine_.create_face(name);\n        if (face)\n        {\n            face_ptr_cache_.insert(make_pair(name,face));\n        }\n        return face;\n    }\n}\n\ntemplate <typename T>\nface_set_ptr face_manager<T>::get_face_set(std::string const& name)\n{\n    face_set_ptr face_set = std::make_shared<font_face_set>();\n    if (face_ptr face = get_face(name))\n    {\n        face_set->add(face);\n    }\n    return face_set;\n}\n\ntemplate <typename T>\nface_set_ptr face_manager<T>::get_face_set(font_set const& fset)\n{\n    std::vector<std::string> const& names = fset.get_face_names();\n    face_set_ptr face_set = std::make_shared<font_face_set>();\n    for (std::vector<std::string>::const_iterator name = names.begin(); name != names.end(); ++name)\n    {\n        face_ptr face = get_face(*name);\n        if (face)\n        {\n            face_set->add(face);\n        }\n#ifdef MAPNIK_LOG\n        else\n        {\n            MAPNIK_LOG_DEBUG(font_engine_freetype)\n                << \"Failed to find face '\" << *name\n                << \"' in font set '\" << fset.get_name() << \"'\\n\";\n        }\n#endif\n    }\n    return face_set;\n}\n\ntemplate <typename T>\nface_set_ptr face_manager<T>::get_face_set(const std::string &name, boost::optional<font_set> fset)\n{\n    if (fset && fset->size() > 0)\n    {\n        return get_face_set(*fset);\n    }\n    else\n    {\n        return get_face_set(name);\n    }\n}\n\n#ifdef MAPNIK_THREADSAFE\nstd::mutex freetype_engine::mutex_;\n#endif\nstd::map<std::string,std::pair<int,std::string> > freetype_engine::name2file_;\nstd::map<std::string,std::string> freetype_engine::memory_fonts_;\ntemplate class face_manager<freetype_engine>;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\r\n\/*\r\n    Copyright 2011 Aevum Software aevum @ aevumlab.com\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    @author Victor Vicente de Carvalho victor.carvalho@aevumlab.com\r\n    @author Ozires Bortolon de Faria ozires@aevumlab.com\r\n*\/\r\n\r\n#include \"Frustum.hpp\"\r\n\r\n#include \"Vector3.hpp\"\r\n#include \"Matrix4.hpp\"\r\n#include \"collision\/BoundingBox.hpp\"\r\n\r\n#include <string.h>\r\n\r\nusing namespace gdx_cpp::math;\r\n\r\n\r\nVector3 Frustum::clipSpacePlanePoints[] = { Vector3(-1, -1, -1), Vector3(1, -1, -1),\r\n        Vector3(1, 1, -1), Vector3(-1, 1, -1), \/\/ near clip\r\n        Vector3(-1, -1, 1), Vector3(1, -1, 1), Vector3(1, 1, 1), Vector3(-1, 1, 1)}; \/\/ far clip\r\n\r\nfloat Frustum::clipSpacePlanePointsArray[8 * 3];\r\n\r\nFrustum::Frustum()\r\n{\r\n    for (int i = 0; i < 6; i++) {\r\n        planes[i] = new Plane(Vector3(), 0);\r\n    }\r\n}\r\n\r\nvoid Frustum::update (const Matrix4& inverseProjectionView) {\r\n    memcpy(planePointsArray, clipSpacePlanePointsArray, 24 );\r\n\r\n    Matrix4::prj(inverseProjectionView.val, planePointsArray, 0, 8, 3);\r\n    for (int i = 0, j = 0; i < 8; i++) {\r\n        Vector3& v = planePoints[i];\r\n        v.x = planePointsArray[j++];\r\n        v.y = planePointsArray[j++];\r\n        v.z = planePointsArray[j++];\r\n    }\r\n\r\n    planes[0]->set(planePoints[1], planePoints[0], planePoints[2]);\r\n    planes[1]->set(planePoints[4], planePoints[5], planePoints[7]);\r\n    planes[2]->set(planePoints[0], planePoints[4], planePoints[3]);\r\n    planes[3]->set(planePoints[5], planePoints[1], planePoints[6]);\r\n    planes[4]->set(planePoints[2], planePoints[3], planePoints[6]);\r\n    planes[5]->set(planePoints[4], planePoints[0], planePoints[1]);\r\n}\r\n\r\nbool Frustum::pointInFrustum (const Vector3& point) {\r\n    for (int i = 0; i < 6; i++) {\r\n        Plane::PlaneSide result = planes[i]->testPoint(point);\r\n        if (result == Plane::PlaneSide_Back) return false;\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool Frustum::sphereInFrustum (const Vector3& center,float radius) {\r\n    for (int i = 0; i < 6; i++)\r\n        if (planes[i]->distance(center) < -radius) return false;\r\n\r\n    return true;\r\n}\r\n\r\nbool Frustum::sphereInFrustumWithoutNearFar (const Vector3& center,float radius) {\r\n    for (int i = 0; i < 6; i++)\r\n        if (planes[i]->distance(center) < -radius) return false;\r\n\r\n    return true;\r\n}\r\n\r\nbool Frustum::boundsInFrustum (const gdx_cpp::math::collision::BoundingBox& bounds) {\r\n    const std::vector<Vector3>& corners = bounds.getCorners();\r\n    int len = corners.size();\r\n\r\n    for (int i = 0, len2 = 6; i < len2; i++) {\r\n        int out = 0;\r\n\r\n        for (int j = 0; j < len; j++)\r\n          if (planes[i]->testPoint(corners[j]) == Plane::PlaneSide_Back) out++;\r\n\r\n        if (out == 8) return false;\r\n    }\r\n\r\n    return true;\r\n}<commit_msg>Added destructor<commit_after>\r\n\/*\r\n    Copyright 2011 Aevum Software aevum @ aevumlab.com\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    @author Victor Vicente de Carvalho victor.carvalho@aevumlab.com\r\n    @author Ozires Bortolon de Faria ozires@aevumlab.com\r\n*\/\r\n\r\n#include \"Frustum.hpp\"\r\n\r\n#include \"Vector3.hpp\"\r\n#include \"Matrix4.hpp\"\r\n#include \"collision\/BoundingBox.hpp\"\r\n\r\n#include <string.h>\r\n\r\nusing namespace gdx_cpp::math;\r\n\r\n\r\nVector3 Frustum::clipSpacePlanePoints[] = { Vector3(-1, -1, -1), Vector3(1, -1, -1),\r\n        Vector3(1, 1, -1), Vector3(-1, 1, -1), \/\/ near clip\r\n        Vector3(-1, -1, 1), Vector3(1, -1, 1), Vector3(1, 1, 1), Vector3(-1, 1, 1)}; \/\/ far clip\r\n\r\nfloat Frustum::clipSpacePlanePointsArray[8 * 3];\r\n\r\nFrustum::Frustum()\r\n{\r\n    for (int i = 0; i < 6; i++) {\r\n        planes[i] = new Plane(Vector3(), 0);\r\n    }\r\n}\r\n\r\ngdx_cpp::math::Frustum::~Frustum()\r\n{\r\n  for (int i = 0; i < 6; i++) {\r\n    delete planes[i];\r\n  }\r\n}\r\n\r\nvoid Frustum::update (const Matrix4& inverseProjectionView) {\r\n    memcpy(planePointsArray, clipSpacePlanePointsArray, 24 );\r\n\r\n    Matrix4::prj(inverseProjectionView.val, planePointsArray, 0, 8, 3);\r\n    for (int i = 0, j = 0; i < 8; i++) {\r\n        Vector3& v = planePoints[i];\r\n        v.x = planePointsArray[j++];\r\n        v.y = planePointsArray[j++];\r\n        v.z = planePointsArray[j++];\r\n    }\r\n\r\n    planes[0]->set(planePoints[1], planePoints[0], planePoints[2]);\r\n    planes[1]->set(planePoints[4], planePoints[5], planePoints[7]);\r\n    planes[2]->set(planePoints[0], planePoints[4], planePoints[3]);\r\n    planes[3]->set(planePoints[5], planePoints[1], planePoints[6]);\r\n    planes[4]->set(planePoints[2], planePoints[3], planePoints[6]);\r\n    planes[5]->set(planePoints[4], planePoints[0], planePoints[1]);\r\n}\r\n\r\nbool Frustum::pointInFrustum (const Vector3& point) {\r\n    for (int i = 0; i < 6; i++) {\r\n        Plane::PlaneSide result = planes[i]->testPoint(point);\r\n        if (result == Plane::PlaneSide_Back) return false;\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool Frustum::sphereInFrustum (const Vector3& center,float radius) {\r\n    for (int i = 0; i < 6; i++)\r\n        if (planes[i]->distance(center) < -radius) return false;\r\n\r\n    return true;\r\n}\r\n\r\nbool Frustum::sphereInFrustumWithoutNearFar (const Vector3& center,float radius) {\r\n    for (int i = 0; i < 6; i++)\r\n        if (planes[i]->distance(center) < -radius) return false;\r\n\r\n    return true;\r\n}\r\n\r\nbool Frustum::boundsInFrustum (const gdx_cpp::math::collision::BoundingBox& bounds) {\r\n    const std::vector<Vector3>& corners = bounds.getCorners();\r\n    int len = corners.size();\r\n\r\n    for (int i = 0, len2 = 6; i < len2; i++) {\r\n        int out = 0;\r\n\r\n        for (int j = 0; j < len; j++)\r\n          if (planes[i]->testPoint(corners[j]) == Plane::PlaneSide_Back) out++;\r\n\r\n        if (out == 8) return false;\r\n    }\r\n\r\n    return true;\r\n}<|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#include \"ast.h\"\n#include \"glsl_types.h\"\n#include \"ir.h\"\n\nvoid\nast_array_specifier::print(void) const\n{\n   if (this->is_unsized_array) {\n      printf(\"[ ] \");\n   }\n\n   foreach_list_typed (ast_node, array_dimension, link, &this->array_dimensions) {\n      printf(\"[ \");\n      array_dimension->print();\n      printf(\"] \");\n   }\n}\n\n\/**\n * If \\c ir is a reference to an array for which we are tracking the max array\n * element accessed, track that the given element has been accessed.\n * Otherwise do nothing.\n *\n * This function also checks whether the array is a built-in array whose\n * maximum size is too small to accommodate the given index, and if so uses\n * loc and state to report the error.\n *\/\nstatic void\nupdate_max_array_access(ir_rvalue *ir, int idx, YYLTYPE *loc,\n                        struct _mesa_glsl_parse_state *state)\n{\n   if (ir_dereference_variable *deref_var = ir->as_dereference_variable()) {\n      ir_variable *var = deref_var->var;\n      if (idx > (int)var->data.max_array_access) {\n         var->data.max_array_access = idx;\n\n         \/* Check whether this access will, as a side effect, implicitly cause\n          * the size of a built-in array to be too large.\n          *\/\n         check_builtin_array_max_size(var->name, idx+1, *loc, state);\n      }\n   } else if (ir_dereference_record *deref_record =\n              ir->as_dereference_record()) {\n      \/* There are two possibilities we need to consider:\n       *\n       * - Accessing an element of an array that is a member of a named\n       *   interface block (e.g. ifc.foo[i])\n       *\n       * - Accessing an element of an array that is a member of a named\n       *   interface block array (e.g. ifc[j].foo[i]).\n       *\/\n      ir_dereference_variable *deref_var =\n         deref_record->record->as_dereference_variable();\n      if (deref_var == NULL) {\n         if (ir_dereference_array *deref_array =\n             deref_record->record->as_dereference_array()) {\n            deref_var = deref_array->array->as_dereference_variable();\n         }\n      }\n\n      if (deref_var != NULL) {\n         if (deref_var->var->is_interface_instance()) {\n            unsigned field_index =\n               deref_record->record->type->field_index(deref_record->field);\n            assert(field_index < deref_var->var->get_interface_type()->length);\n\n            unsigned *const max_ifc_array_access =\n               deref_var->var->get_max_ifc_array_access();\n\n            assert(max_ifc_array_access != NULL);\n\n            if (idx > (int)max_ifc_array_access[field_index]) {\n               max_ifc_array_access[field_index] = idx;\n\n               \/* Check whether this access will, as a side effect, implicitly\n                * cause the size of a built-in array to be too large.\n                *\/\n               check_builtin_array_max_size(deref_record->field, idx+1, *loc,\n                                            state);\n            }\n         }\n      }\n   }\n}\n\n\nstatic int\nget_implicit_array_size(struct _mesa_glsl_parse_state *state,\n                        ir_rvalue *array)\n{\n   ir_variable *var = array->variable_referenced();\n\n   \/* Inputs in control shader are implicitly sized\n    * to the maximum patch size.\n    *\/\n   if (state->stage == MESA_SHADER_TESS_CTRL &&\n       var->data.mode == ir_var_shader_in) {\n      return state->Const.MaxPatchVertices;\n   }\n\n   \/* Non-patch inputs in evaluation shader are implicitly sized\n    * to the maximum patch size.\n    *\/\n   if (state->stage == MESA_SHADER_TESS_EVAL &&\n       var->data.mode == ir_var_shader_in &&\n       !var->data.patch) {\n      return state->Const.MaxPatchVertices;\n   }\n\n   return 0;\n}\n\n\nir_rvalue *\n_mesa_ast_array_index_to_hir(void *mem_ctx,\n\t\t\t     struct _mesa_glsl_parse_state *state,\n\t\t\t     ir_rvalue *array, ir_rvalue *idx,\n\t\t\t     YYLTYPE &loc, YYLTYPE &idx_loc)\n{\n   if (!array->type->is_error()\n       && !array->type->is_array()\n       && !array->type->is_matrix()\n       && !array->type->is_vector()) {\n      _mesa_glsl_error(& idx_loc, state,\n\t\t       \"cannot dereference non-array \/ non-matrix \/ \"\n\t\t       \"non-vector\");\n   }\n\n   if (!idx->type->is_error()) {\n      if (!idx->type->is_integer()) {\n\t _mesa_glsl_error(& idx_loc, state, \"array index must be integer type\");\n      } else if (!idx->type->is_scalar()) {\n\t _mesa_glsl_error(& idx_loc, state, \"array index must be scalar\");\n      }\n   }\n\n   \/* If the array index is a constant expression and the array has a\n    * declared size, ensure that the access is in-bounds.  If the array\n    * index is not a constant expression, ensure that the array has a\n    * declared size.\n    *\/\n   ir_constant *const const_index = idx->constant_expression_value();\n   if (const_index != NULL && idx->type->is_integer()) {\n      const int idx = const_index->value.i[0];\n      const char *type_name = \"error\";\n      unsigned bound = 0;\n\n      \/* From page 24 (page 30 of the PDF) of the GLSL 1.50 spec:\n       *\n       *    \"It is illegal to declare an array with a size, and then\n       *    later (in the same shader) index the same array with an\n       *    integral constant expression greater than or equal to the\n       *    declared size. It is also illegal to index an array with a\n       *    negative constant expression.\"\n       *\/\n      if (array->type->is_matrix()) {\n\t if (array->type->row_type()->vector_elements <= idx) {\n\t    type_name = \"matrix\";\n\t    bound = array->type->row_type()->vector_elements;\n\t }\n      } else if (array->type->is_vector()) {\n\t if (array->type->vector_elements <= idx) {\n\t    type_name = \"vector\";\n\t    bound = array->type->vector_elements;\n\t }\n      } else {\n\t \/* glsl_type::array_size() returns -1 for non-array types.  This means\n\t  * that we don't need to verify that the type is an array before\n\t  * doing the bounds checking.\n\t  *\/\n\t if ((array->type->array_size() > 0)\n\t     && (array->type->array_size() <= idx)) {\n\t    type_name = \"array\";\n\t    bound = array->type->array_size();\n\t }\n      }\n\n      if (bound > 0) {\n\t _mesa_glsl_error(& loc, state, \"%s index must be < %u\",\n\t\t\t  type_name, bound);\n      } else if (idx < 0) {\n\t _mesa_glsl_error(& loc, state, \"%s index must be >= 0\",\n\t\t\t  type_name);\n      }\n\n      if (array->type->is_array())\n         update_max_array_access(array, idx, &loc, state);\n   } else if (const_index == NULL && array->type->is_array()) {\n      if (array->type->is_unsized_array()) {\n         int implicit_size = get_implicit_array_size(state, array);\n         if (implicit_size) {\n            ir_variable *v = array->whole_variable_referenced();\n            if (v != NULL)\n               v->data.max_array_access = implicit_size - 1;\n         }\n         else if (state->stage == MESA_SHADER_TESS_CTRL &&\n                  array->variable_referenced()->data.mode == ir_var_shader_out &&\n                  !array->variable_referenced()->data.patch) {\n            \/* Tessellation control shader output non-patch arrays are\n             * initially unsized. Despite that, they are allowed to be\n             * indexed with a non-constant expression (typically\n             * \"gl_InvocationID\"). The array size will be determined\n             * by the linker.\n             *\/\n         }\n         else {\n            _mesa_glsl_error(&loc, state, \"unsized array index must be constant\");\n         }\n      } else if (array->type->fields.array->is_interface()\n                 && array->variable_referenced()->data.mode == ir_var_uniform\n                 && !state->is_version(400, 0) && !state->ARB_gpu_shader5_enable) {\n\t \/* Page 46 in section 4.3.7 of the OpenGL ES 3.00 spec says:\n\t  *\n\t  *     \"All indexes used to index a uniform block array must be\n\t  *     constant integral expressions.\"\n\t  *\/\n\t _mesa_glsl_error(&loc, state,\n\t\t\t  \"uniform block array index must be constant\");\n      } else {\n\t \/* whole_variable_referenced can return NULL if the array is a\n\t  * member of a structure.  In this case it is safe to not update\n\t  * the max_array_access field because it is never used for fields\n\t  * of structures.\n\t  *\/\n\t ir_variable *v = array->whole_variable_referenced();\n\t if (v != NULL)\n\t    v->data.max_array_access = array->type->array_size() - 1;\n      }\n\n      \/* From page 23 (29 of the PDF) of the GLSL 1.30 spec:\n       *\n       *    \"Samplers aggregated into arrays within a shader (using square\n       *    brackets [ ]) can only be indexed with integral constant\n       *    expressions [...].\"\n       *\n       * This restriction was added in GLSL 1.30.  Shaders using earlier\n       * version of the language should not be rejected by the compiler\n       * front-end for using this construct.  This allows useful things such\n       * as using a loop counter as the index to an array of samplers.  If the\n       * loop in unrolled, the code should compile correctly.  Instead, emit a\n       * warning.\n       *\n       * In GLSL 4.00 \/ ARB_gpu_shader5, this requirement is relaxed again to allow\n       * indexing with dynamically uniform expressions. Note that these are not\n       * required to be uniforms or expressions based on them, but merely that the\n       * values must not diverge between shader invocations run together. If the\n       * values *do* diverge, then the behavior of the operation requiring a\n       * dynamically uniform expression is undefined.\n       *\/\n      if (array->type->without_array()->is_sampler()) {\n         if (!state->is_version(400, 0) && !state->ARB_gpu_shader5_enable) {\n            if (state->is_version(130, 300))\n               _mesa_glsl_error(&loc, state,\n                                \"sampler arrays indexed with non-constant \"\n                                \"expressions are forbidden in GLSL %s \"\n                                \"and later\",\n                                state->es_shader ? \"ES 3.00\" : \"1.30\");\n            else if (state->es_shader)\n               _mesa_glsl_warning(&loc, state,\n                                  \"sampler arrays indexed with non-constant \"\n                                  \"expressions will be forbidden in GLSL \"\n                                  \"3.00 and later\");\n            else\n               _mesa_glsl_warning(&loc, state,\n                                  \"sampler arrays indexed with non-constant \"\n                                  \"expressions will be forbidden in GLSL \"\n                                  \"1.30 and later\");\n         }\n      }\n   }\n\n   \/* After performing all of the error checking, generate the IR for the\n    * expression.\n    *\/\n   if (array->type->is_array()\n       || array->type->is_matrix()) {\n      return new(mem_ctx) ir_dereference_array(array, idx);\n   } else if (array->type->is_vector()) {\n      return new(mem_ctx) ir_expression(ir_binop_vector_extract, array, idx);\n   } else if (array->type->is_error()) {\n      return array;\n   } else {\n      ir_rvalue *result = new(mem_ctx) ir_dereference_array(array, idx);\n      result->type = glsl_type::error_type;\n\n      return result;\n   }\n}\n<commit_msg>glsl: Forbid non-constant image array indexing in GLSL ES 3.1.<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#include \"ast.h\"\n#include \"glsl_types.h\"\n#include \"ir.h\"\n\nvoid\nast_array_specifier::print(void) const\n{\n   if (this->is_unsized_array) {\n      printf(\"[ ] \");\n   }\n\n   foreach_list_typed (ast_node, array_dimension, link, &this->array_dimensions) {\n      printf(\"[ \");\n      array_dimension->print();\n      printf(\"] \");\n   }\n}\n\n\/**\n * If \\c ir is a reference to an array for which we are tracking the max array\n * element accessed, track that the given element has been accessed.\n * Otherwise do nothing.\n *\n * This function also checks whether the array is a built-in array whose\n * maximum size is too small to accommodate the given index, and if so uses\n * loc and state to report the error.\n *\/\nstatic void\nupdate_max_array_access(ir_rvalue *ir, int idx, YYLTYPE *loc,\n                        struct _mesa_glsl_parse_state *state)\n{\n   if (ir_dereference_variable *deref_var = ir->as_dereference_variable()) {\n      ir_variable *var = deref_var->var;\n      if (idx > (int)var->data.max_array_access) {\n         var->data.max_array_access = idx;\n\n         \/* Check whether this access will, as a side effect, implicitly cause\n          * the size of a built-in array to be too large.\n          *\/\n         check_builtin_array_max_size(var->name, idx+1, *loc, state);\n      }\n   } else if (ir_dereference_record *deref_record =\n              ir->as_dereference_record()) {\n      \/* There are two possibilities we need to consider:\n       *\n       * - Accessing an element of an array that is a member of a named\n       *   interface block (e.g. ifc.foo[i])\n       *\n       * - Accessing an element of an array that is a member of a named\n       *   interface block array (e.g. ifc[j].foo[i]).\n       *\/\n      ir_dereference_variable *deref_var =\n         deref_record->record->as_dereference_variable();\n      if (deref_var == NULL) {\n         if (ir_dereference_array *deref_array =\n             deref_record->record->as_dereference_array()) {\n            deref_var = deref_array->array->as_dereference_variable();\n         }\n      }\n\n      if (deref_var != NULL) {\n         if (deref_var->var->is_interface_instance()) {\n            unsigned field_index =\n               deref_record->record->type->field_index(deref_record->field);\n            assert(field_index < deref_var->var->get_interface_type()->length);\n\n            unsigned *const max_ifc_array_access =\n               deref_var->var->get_max_ifc_array_access();\n\n            assert(max_ifc_array_access != NULL);\n\n            if (idx > (int)max_ifc_array_access[field_index]) {\n               max_ifc_array_access[field_index] = idx;\n\n               \/* Check whether this access will, as a side effect, implicitly\n                * cause the size of a built-in array to be too large.\n                *\/\n               check_builtin_array_max_size(deref_record->field, idx+1, *loc,\n                                            state);\n            }\n         }\n      }\n   }\n}\n\n\nstatic int\nget_implicit_array_size(struct _mesa_glsl_parse_state *state,\n                        ir_rvalue *array)\n{\n   ir_variable *var = array->variable_referenced();\n\n   \/* Inputs in control shader are implicitly sized\n    * to the maximum patch size.\n    *\/\n   if (state->stage == MESA_SHADER_TESS_CTRL &&\n       var->data.mode == ir_var_shader_in) {\n      return state->Const.MaxPatchVertices;\n   }\n\n   \/* Non-patch inputs in evaluation shader are implicitly sized\n    * to the maximum patch size.\n    *\/\n   if (state->stage == MESA_SHADER_TESS_EVAL &&\n       var->data.mode == ir_var_shader_in &&\n       !var->data.patch) {\n      return state->Const.MaxPatchVertices;\n   }\n\n   return 0;\n}\n\n\nir_rvalue *\n_mesa_ast_array_index_to_hir(void *mem_ctx,\n\t\t\t     struct _mesa_glsl_parse_state *state,\n\t\t\t     ir_rvalue *array, ir_rvalue *idx,\n\t\t\t     YYLTYPE &loc, YYLTYPE &idx_loc)\n{\n   if (!array->type->is_error()\n       && !array->type->is_array()\n       && !array->type->is_matrix()\n       && !array->type->is_vector()) {\n      _mesa_glsl_error(& idx_loc, state,\n\t\t       \"cannot dereference non-array \/ non-matrix \/ \"\n\t\t       \"non-vector\");\n   }\n\n   if (!idx->type->is_error()) {\n      if (!idx->type->is_integer()) {\n\t _mesa_glsl_error(& idx_loc, state, \"array index must be integer type\");\n      } else if (!idx->type->is_scalar()) {\n\t _mesa_glsl_error(& idx_loc, state, \"array index must be scalar\");\n      }\n   }\n\n   \/* If the array index is a constant expression and the array has a\n    * declared size, ensure that the access is in-bounds.  If the array\n    * index is not a constant expression, ensure that the array has a\n    * declared size.\n    *\/\n   ir_constant *const const_index = idx->constant_expression_value();\n   if (const_index != NULL && idx->type->is_integer()) {\n      const int idx = const_index->value.i[0];\n      const char *type_name = \"error\";\n      unsigned bound = 0;\n\n      \/* From page 24 (page 30 of the PDF) of the GLSL 1.50 spec:\n       *\n       *    \"It is illegal to declare an array with a size, and then\n       *    later (in the same shader) index the same array with an\n       *    integral constant expression greater than or equal to the\n       *    declared size. It is also illegal to index an array with a\n       *    negative constant expression.\"\n       *\/\n      if (array->type->is_matrix()) {\n\t if (array->type->row_type()->vector_elements <= idx) {\n\t    type_name = \"matrix\";\n\t    bound = array->type->row_type()->vector_elements;\n\t }\n      } else if (array->type->is_vector()) {\n\t if (array->type->vector_elements <= idx) {\n\t    type_name = \"vector\";\n\t    bound = array->type->vector_elements;\n\t }\n      } else {\n\t \/* glsl_type::array_size() returns -1 for non-array types.  This means\n\t  * that we don't need to verify that the type is an array before\n\t  * doing the bounds checking.\n\t  *\/\n\t if ((array->type->array_size() > 0)\n\t     && (array->type->array_size() <= idx)) {\n\t    type_name = \"array\";\n\t    bound = array->type->array_size();\n\t }\n      }\n\n      if (bound > 0) {\n\t _mesa_glsl_error(& loc, state, \"%s index must be < %u\",\n\t\t\t  type_name, bound);\n      } else if (idx < 0) {\n\t _mesa_glsl_error(& loc, state, \"%s index must be >= 0\",\n\t\t\t  type_name);\n      }\n\n      if (array->type->is_array())\n         update_max_array_access(array, idx, &loc, state);\n   } else if (const_index == NULL && array->type->is_array()) {\n      if (array->type->is_unsized_array()) {\n         int implicit_size = get_implicit_array_size(state, array);\n         if (implicit_size) {\n            ir_variable *v = array->whole_variable_referenced();\n            if (v != NULL)\n               v->data.max_array_access = implicit_size - 1;\n         }\n         else if (state->stage == MESA_SHADER_TESS_CTRL &&\n                  array->variable_referenced()->data.mode == ir_var_shader_out &&\n                  !array->variable_referenced()->data.patch) {\n            \/* Tessellation control shader output non-patch arrays are\n             * initially unsized. Despite that, they are allowed to be\n             * indexed with a non-constant expression (typically\n             * \"gl_InvocationID\"). The array size will be determined\n             * by the linker.\n             *\/\n         }\n         else {\n            _mesa_glsl_error(&loc, state, \"unsized array index must be constant\");\n         }\n      } else if (array->type->fields.array->is_interface()\n                 && array->variable_referenced()->data.mode == ir_var_uniform\n                 && !state->is_version(400, 0) && !state->ARB_gpu_shader5_enable) {\n\t \/* Page 46 in section 4.3.7 of the OpenGL ES 3.00 spec says:\n\t  *\n\t  *     \"All indexes used to index a uniform block array must be\n\t  *     constant integral expressions.\"\n\t  *\/\n\t _mesa_glsl_error(&loc, state,\n\t\t\t  \"uniform block array index must be constant\");\n      } else {\n\t \/* whole_variable_referenced can return NULL if the array is a\n\t  * member of a structure.  In this case it is safe to not update\n\t  * the max_array_access field because it is never used for fields\n\t  * of structures.\n\t  *\/\n\t ir_variable *v = array->whole_variable_referenced();\n\t if (v != NULL)\n\t    v->data.max_array_access = array->type->array_size() - 1;\n      }\n\n      \/* From page 23 (29 of the PDF) of the GLSL 1.30 spec:\n       *\n       *    \"Samplers aggregated into arrays within a shader (using square\n       *    brackets [ ]) can only be indexed with integral constant\n       *    expressions [...].\"\n       *\n       * This restriction was added in GLSL 1.30.  Shaders using earlier\n       * version of the language should not be rejected by the compiler\n       * front-end for using this construct.  This allows useful things such\n       * as using a loop counter as the index to an array of samplers.  If the\n       * loop in unrolled, the code should compile correctly.  Instead, emit a\n       * warning.\n       *\n       * In GLSL 4.00 \/ ARB_gpu_shader5, this requirement is relaxed again to allow\n       * indexing with dynamically uniform expressions. Note that these are not\n       * required to be uniforms or expressions based on them, but merely that the\n       * values must not diverge between shader invocations run together. If the\n       * values *do* diverge, then the behavior of the operation requiring a\n       * dynamically uniform expression is undefined.\n       *\/\n      if (array->type->without_array()->is_sampler()) {\n         if (!state->is_version(400, 0) && !state->ARB_gpu_shader5_enable) {\n            if (state->is_version(130, 300))\n               _mesa_glsl_error(&loc, state,\n                                \"sampler arrays indexed with non-constant \"\n                                \"expressions are forbidden in GLSL %s \"\n                                \"and later\",\n                                state->es_shader ? \"ES 3.00\" : \"1.30\");\n            else if (state->es_shader)\n               _mesa_glsl_warning(&loc, state,\n                                  \"sampler arrays indexed with non-constant \"\n                                  \"expressions will be forbidden in GLSL \"\n                                  \"3.00 and later\");\n            else\n               _mesa_glsl_warning(&loc, state,\n                                  \"sampler arrays indexed with non-constant \"\n                                  \"expressions will be forbidden in GLSL \"\n                                  \"1.30 and later\");\n         }\n      }\n\n      \/* From page 27 of the GLSL ES 3.1 specification:\n       *\n       * \"When aggregated into arrays within a shader, images can only be\n       *  indexed with a constant integral expression.\"\n       *\n       * On the other hand the desktop GL specification extension allows\n       * non-constant indexing of image arrays, but behavior is left undefined\n       * in cases where the indexing expression is not dynamically uniform.\n       *\/\n      if (state->es_shader && array->type->without_array()->is_image()) {\n         _mesa_glsl_error(&loc, state,\n                          \"image arrays indexed with non-constant \"\n                          \"expressions are forbidden in GLSL ES.\");\n      }\n   }\n\n   \/* After performing all of the error checking, generate the IR for the\n    * expression.\n    *\/\n   if (array->type->is_array()\n       || array->type->is_matrix()) {\n      return new(mem_ctx) ir_dereference_array(array, idx);\n   } else if (array->type->is_vector()) {\n      return new(mem_ctx) ir_expression(ir_binop_vector_extract, array, idx);\n   } else if (array->type->is_error()) {\n      return array;\n   } else {\n      ir_rvalue *result = new(mem_ctx) ir_dereference_array(array, idx);\n      result->type = glsl_type::error_type;\n\n      return result;\n   }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <numeric>\n#include <algorithm> \n\n#include <boost\/lambda\/bind.hpp>\n\n#include <assert.h>\n#include <string>\n\n#include \"cyc_std.h\"\n#include \"logger.h\"\n\n#include \"greedy_preconditioner.h\"\n\nnamespace l = boost::lambda;\n\nnamespace cyclus {\n\ninline double SumPref(double total, std::pair<Arc, double> pref) {\n  return total += pref.second;\n};\n\ndouble AvgPref(ExchangeNode::Ptr n) {\n  std::map<Arc, double>& prefs = n->prefs;\n  return prefs.size() > 0 ?\n      std::accumulate(prefs.begin(), prefs.end(), 0.0, SumPref) \/ prefs.size() :\n      0;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid GreedyPreconditioner::Condition(ExchangeGraph* graph) {\n  avg_prefs_.clear();\n  \n  std::vector<RequestGroup::Ptr>& groups =\n      const_cast<std::vector<RequestGroup::Ptr>&>(graph->request_groups());\n\n  std::vector<RequestGroup::Ptr>::iterator it;\n  for (it = groups.begin(); it != groups.end(); ++it) {\n    std::vector<ExchangeNode::Ptr>& nodes =\n        const_cast<std::vector<ExchangeNode::Ptr>&>((*it)->nodes());\n\n    \/\/ get avg prefs\n    for (int i = 0; i != nodes.size(); i++) {\n      avg_prefs_[nodes[i]] = AvgPref(nodes[i]);\n    }\n    \n    \/\/ sort nodes by weight\n    std::sort(nodes.begin(),\n              nodes.end(),\n              l::bind(&GreedyPreconditioner::NodeComp, this, l::_1, l::_2));\n    \n    \/\/ get avg group weights\n    group_weights_[*it] = GroupWeight(*it, &commod_weights_, &avg_prefs_); \n    CLOG(LEV_DEBUG1) << \"Group weight value during graph preconditioning is \"\n                     << group_weights_[*it] << \".\";\n  }\n\n  \/\/ sort groups by avg weight\n  std::sort(groups.begin(),\n            groups.end(),\n            l::bind(&GreedyPreconditioner::GroupComp, this, l::_1, l::_2));\n\n  \/\/ clear graph-specific state\n  group_weights_.clear();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid GreedyPreconditioner::ProcessWeights_(WgtOrder order) {\n\n  double min = std::min_element(\n      commod_weights_.begin(),\n      commod_weights_.end(),\n      SecondLT< std::pair<std::string, double> >())->second;\n  \n  double max = std::max_element(\n      commod_weights_.begin(),\n      commod_weights_.end(),\n      SecondLT< std::pair<std::string, double> >())->second;\n  \n  assert(min >= 0);\n  \n  std::map<std::string, double>::iterator it;\n  switch(order) {\n    case REVERSE:\n      for (it = commod_weights_.begin();\n           it != commod_weights_.end();\n           ++it) {\n        it->second = max + min - it->second; \/\/ reverses order\n      }\n      break;\n    default: \/\/ do nothing\n      break;\n  }\n     \n  for (it = commod_weights_.begin();\n       it != commod_weights_.end();\n       ++it) {\n    CLOG(LEV_INFO1) << \"GreedyPreconditioner commodity weight value for \"\n                    << it->first\n                    << \" is \" << it->second;\n  }\n  \n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble GroupWeight(RequestGroup::Ptr g,\n                   std::map<std::string, double>* weights,\n                   std::map<ExchangeNode::Ptr, double>* avg_prefs) {\n  std::vector<ExchangeNode::Ptr>& nodes = g->nodes();\n  double sum = 0;\n\n  ExchangeNode::Ptr n;\n  for (int i = 0; i != nodes.size(); i++) {\n    n = nodes[i];\n    sum += NodeWeight(n, weights, (*avg_prefs)[n]);\n  }\n  return nodes.size() > 0 ? sum \/ nodes.size() : 0;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble NodeWeight(ExchangeNode::Ptr n,\n                  std::map<std::string, double>* weights,\n                  double avg_pref) {\n  double commod_weight = (*weights)[n->commod];\n  double node_weight = commod_weight * ( 1 + avg_pref \/ ( 1 + avg_pref));\n  \n  CLOG(LEV_DEBUG5) << \"Determining node weight: \";\n  CLOG(LEV_DEBUG5) << \"       commodity weight: \" << commod_weight;\n  CLOG(LEV_DEBUG5) << \"               avg pref: \" << avg_pref; \n  CLOG(LEV_DEBUG5) << \"            node weight: \" << node_weight;\n\n  return node_weight;\n}\n\n} \/\/ namespace cyclus\n<commit_msg>assert hotfix<commit_after>#include <numeric>\n#include <algorithm> \n\n#include <boost\/lambda\/bind.hpp>\n\n#include <assert.h>\n#include <string>\n\n#include \"cyc_std.h\"\n#include \"logger.h\"\n\n#include \"greedy_preconditioner.h\"\n\nnamespace l = boost::lambda;\n\nnamespace cyclus {\n\ninline double SumPref(double total, std::pair<Arc, double> pref) {\n  return total += pref.second;\n};\n\ndouble AvgPref(ExchangeNode::Ptr n) {\n  std::map<Arc, double>& prefs = n->prefs;\n  return prefs.size() > 0 ?\n      std::accumulate(prefs.begin(), prefs.end(), 0.0, SumPref) \/ prefs.size() :\n      0;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid GreedyPreconditioner::Condition(ExchangeGraph* graph) {\n  avg_prefs_.clear();\n  \n  std::vector<RequestGroup::Ptr>& groups =\n      const_cast<std::vector<RequestGroup::Ptr>&>(graph->request_groups());\n\n  std::vector<RequestGroup::Ptr>::iterator it;\n  for (it = groups.begin(); it != groups.end(); ++it) {\n    std::vector<ExchangeNode::Ptr>& nodes =\n        const_cast<std::vector<ExchangeNode::Ptr>&>((*it)->nodes());\n\n    \/\/ get avg prefs\n    for (int i = 0; i != nodes.size(); i++) {\n      avg_prefs_[nodes[i]] = AvgPref(nodes[i]);\n    }\n    \n    \/\/ sort nodes by weight\n    std::sort(nodes.begin(),\n              nodes.end(),\n              l::bind(&GreedyPreconditioner::NodeComp, this, l::_1, l::_2));\n    \n    \/\/ get avg group weights\n    group_weights_[*it] = GroupWeight(*it, &commod_weights_, &avg_prefs_); \n    CLOG(LEV_DEBUG1) << \"Group weight value during graph preconditioning is \"\n                     << group_weights_[*it] << \".\";\n  }\n\n  \/\/ sort groups by avg weight\n  std::sort(groups.begin(),\n            groups.end(),\n            l::bind(&GreedyPreconditioner::GroupComp, this, l::_1, l::_2));\n\n  \/\/ clear graph-specific state\n  group_weights_.clear();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid GreedyPreconditioner::ProcessWeights_(WgtOrder order) {\n\n  double min = std::min_element(\n      commod_weights_.begin(),\n      commod_weights_.end(),\n      SecondLT< std::pair<std::string, double> >())->second;\n  \n  double max = std::max_element(\n      commod_weights_.begin(),\n      commod_weights_.end(),\n      SecondLT< std::pair<std::string, double> >())->second;\n\n  assert(commod_weights_.size() == 0 || min >= 0);\n  \n  std::map<std::string, double>::iterator it;\n  switch(order) {\n    case REVERSE:\n      for (it = commod_weights_.begin();\n           it != commod_weights_.end();\n           ++it) {\n        it->second = max + min - it->second; \/\/ reverses order\n      }\n      break;\n    default: \/\/ do nothing\n      break;\n  }\n     \n  for (it = commod_weights_.begin();\n       it != commod_weights_.end();\n       ++it) {\n    CLOG(LEV_INFO1) << \"GreedyPreconditioner commodity weight value for \"\n                    << it->first\n                    << \" is \" << it->second;\n  }\n  \n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble GroupWeight(RequestGroup::Ptr g,\n                   std::map<std::string, double>* weights,\n                   std::map<ExchangeNode::Ptr, double>* avg_prefs) {\n  std::vector<ExchangeNode::Ptr>& nodes = g->nodes();\n  double sum = 0;\n\n  ExchangeNode::Ptr n;\n  for (int i = 0; i != nodes.size(); i++) {\n    n = nodes[i];\n    sum += NodeWeight(n, weights, (*avg_prefs)[n]);\n  }\n  return nodes.size() > 0 ? sum \/ nodes.size() : 0;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble NodeWeight(ExchangeNode::Ptr n,\n                  std::map<std::string, double>* weights,\n                  double avg_pref) {\n  double commod_weight = (*weights)[n->commod];\n  double node_weight = commod_weight * ( 1 + avg_pref \/ ( 1 + avg_pref));\n  \n  CLOG(LEV_DEBUG5) << \"Determining node weight: \";\n  CLOG(LEV_DEBUG5) << \"       commodity weight: \" << commod_weight;\n  CLOG(LEV_DEBUG5) << \"               avg pref: \" << avg_pref; \n  CLOG(LEV_DEBUG5) << \"            node weight: \" << node_weight;\n\n  return node_weight;\n}\n\n} \/\/ namespace cyclus\n<|endoftext|>"}
{"text":"<commit_before>\/*!\r\n@file\r\n@author Nou (korewananda@gmail.com)\r\n\r\n@brief Contains the intercept::invoker class.\r\n\r\nhttps:\/\/github.com\/NouberNou\/intercept\r\n*\/\r\n#pragma once\r\n#include \"shared.hpp\"\r\n#include \"singleton.hpp\"\r\n#include \"logging.hpp\"\r\n#include \"arguments.hpp\"\r\n#include \"loader.hpp\"\r\n#include \"shared\\types.hpp\"\r\n#include <mutex>\r\n#include <condition_variable>\r\n#include <queue>\r\n#include \"eventhandlers.hpp\"\r\n\r\n\r\nusing namespace intercept::types;\r\n\r\n\r\nnamespace intercept {\r\n    class _invoker_unlock;\r\n    \/*!\r\n    @brief Handles invoking SQF functions. Used as an interface between clients, \r\n    RV Engine, and the intercept::loader.\r\n\r\n    The invoker class handles all of the bread and butter tasks of Intercept, it \r\n    is used as a bridge between client plugins, the RV Engine, and the data gathered \r\n    by the loader class.\r\n\r\n    This includes:\r\n    - Invoking specific SQF functions.\r\n    - Releasing Memory\r\n    - Defining and handling SQF internal types.\r\n    - Testing the validity of the Intercept system at boot\/mission start.\r\n    *\/\r\n    class invoker\r\n        : public singleton<invoker>\r\n    {\r\n    public:\r\n        invoker();\r\n        ~invoker();\r\n\r\n        \/*!\r\n        @brief Attaches intercept::controller commands from this class to the main\r\n        controller.\r\n        *\/\r\n        void attach_controller();\r\n        \r\n        \/*!\r\n        @name Invoke Functions\r\n        *\/\r\n        \/\/!@{\r\n        \/*!@{\r\n        @brief Nular invoke functions.\r\n\r\n        Invoke a nular SQF function, either by function pointer or by name.\r\n\r\n        @return Returns a raw intercept::types::rv_game_value struct. This is often\r\n        passed into a intercept::types::game_value to be unwound into the appropriate\r\n        return type, or passed to a complex argument constructor such as `object`\r\n        or `group`, etc.\r\n        *\/\r\n        rv_game_value invoke_raw(nular_function function_);\r\n        rv_game_value invoke_raw_nolock(nular_function function_);\r\n        rv_game_value invoke_raw(std::string function_name_);\r\n        \/\/!@}\r\n\r\n        \/*!@{\r\n        @brief Unary invoke functions.\r\n\r\n        Invoke a unary SQF function, either by function pointer or by name and \r\n        arguement signatures.\r\n\r\n        @return Returns a raw intercept::types::rv_game_value struct. This is often\r\n        passed into a intercept::types::game_value to be unwound into the appropriate\r\n        return type, or passed to a complex argument constructor such as `object`\r\n        or `group`, etc.\r\n        *\/\r\n        rv_game_value invoke_raw(unary_function function_, const game_value * right_);\r\n        rv_game_value invoke_raw_nolock(unary_function function_, const game_value * right_);\r\n        rv_game_value invoke_raw(std::string function_name_, const game_value *right_);\r\n        rv_game_value invoke_raw(std::string function_name_, const game_value *right_, std::string right_type_);\r\n        \/\/!@}\r\n\r\n        \/*!@{\r\n        @brief Binary invoke functions.\r\n\r\n        Invoke a binary SQF function, either by function pointer or by name and\r\n        arguement signatures.\r\n\r\n        @return Returns a raw intercept::types::rv_game_value struct. This is often\r\n        passed into a intercept::types::game_value to be unwound into the appropriate\r\n        return type, or passed to a complex argument constructor such as `object`\r\n        or `group`, etc.\r\n        *\/\r\n        rv_game_value invoke_raw(binary_function function_, const game_value * left_, const game_value * right_);\r\n        rv_game_value invoke_raw_nolock(binary_function function_, const game_value * left_, const game_value * right_);\r\n        rv_game_value invoke_raw(std::string function_name_, const game_value *left_, const game_value *right_);\r\n        rv_game_value invoke_raw(std::string function_name_, const game_value *left_, std::string left_type_, const game_value *right_, std::string right_type_);\r\n        \/\/!@}\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @name Type Functions\r\n        *\/\r\n        \/\/!@{\r\n        \/*!\r\n        @brief Returns the numerical type id. This is the vtable ptr of the data\r\n        type.\r\n        *\/\r\n        uintptr_t get_type(const game_value *value_) const;\r\n\r\n        \/*!\r\n        @brief Returns the string representation of the data type. IE: \"ARRAY\",\r\n        \"STRING\", \"SCALAR\", etc.\r\n        *\/\r\n        const std::string get_type_str(const game_value *value_) const;\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @name Memory Functions\r\n        *\/\r\n        \/\/!@{\r\n        \/*!\r\n        @brief Releases a value that was obtained from the RV Engine.\r\n\r\n        This function releases the data of a value obtained from inside the RV\r\n        Engine. Data obtained in the RV Engine must be released in the RV Engine\r\n        and as such we need to have a method of doing this.\r\n\r\n        The way that Intercept handles this is by defining a global array in SQF\r\n        and populating tha array with values that need to be freed. When the array\r\n        reaches a certain size, it is resized to 0 and this invokes SQF to release\r\n        the variable memory (depending on the internal ref-count, which can be\r\n        manipulated both in Intercept and inside the RV Engine itself via SQF.\r\n\r\n        @param value_ A pointer to the value that is to be freed.\r\n        @param immediate_ If this value should be released immediately. If set \r\n        to true, this will also free any other variables waiting to be freed.\r\n\r\n        @return `true` if the value was added to the collection array, `false`\r\n        if the value was not released (due to it not being properly owned by the\r\n        RV Engine).\r\n        *\/\r\n        bool release_value(game_value * value_, bool immediate_ = true);\r\n\r\n        \/*!\r\n        @brief Actually resizes the collection array to 0 and back to its normal\r\n        size of 100.\r\n\r\n        This function is separate from the release_value function for organizational\r\n        reasons. It invokes an atomic lock that ensures that the array is resized\r\n        to 0 and back to its normal size in one step and that no other variables\r\n        might accidently race and be added to a 0 size array.\r\n        *\/\r\n        void invoke_delete();\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @name Controller Functions\r\n        *\/\r\n        \/\/!@{\r\n        \/*!\r\n        @brief Hooks the SQF `str` function to derive type information at boot.\r\n        *\/\r\n        bool invoker_begin_register(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Defines what the next variable type will be from the hooked function.\r\n        *\/\r\n        bool invoker_register(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Unhooks the SQF `str` function.\r\n        *\/\r\n        bool invoker_end_register(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Initializes the Invoker at mission start. This assignes the delete\r\n        storage array, and sets the zero\/max size arguments.\r\n        *\/\r\n        bool init_invoker(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Tests the invoker. This function will attempt to get the Steam profile\r\n        name of the current game user and compare the value with the same call\r\n        made in normal SQF.\r\n        *\/\r\n        bool test_invoker(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Opens the RV Engine up for a period of time to allow client threads\r\n        access.\r\n\r\n        This is easily the most important function in the invoker as it is the \r\n        function that dictates when other threads can access the game engine.\r\n\r\n        This function is invoked from a per-frame handler in SQF, each frame this\r\n        controller function is called and the Invoker will unlock all client threads\r\n        for 3ms of access to the RV Engine and then it will close. Before it closes\r\n        though it invokes the clients `on_frame()` function, which is a blocking\r\n        function call that each client plugin can define for guaranteed per-frame\r\n        execution.\r\n        *\/\r\n        bool do_invoke_period(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Consume an event from the RV Engine and dispatches it.\r\n        *\/\r\n        bool rv_event(const arguments & args_, std::string & result_);\r\n        \r\n        \/*!\r\n        This is a general purpose function to test the invoker. It is not meant\r\n        for public use and is only there to serve as an easy test bed for development.\r\n        *\/\r\n        bool invoker_demo(const arguments & args_, std::string & result_);\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @brief Adds a bound event handler-handler to the map of event handler binds \r\n        for invoking a RV event handler in the client plugins.\r\n\r\n        @param name_ The name of the event being raised from SQF (these need to\r\n        be bound in SQF to call into the `rv_event` `callExtension` event in this\r\n        class).\r\n        @param func_ The function bind.\r\n\r\n        @return Returns `true` if it was bound, `false` if it was not.\r\n        *\/\r\n        bool add_eventhandler(const std::string & name_, std::function<void(const std::string &, game_value &)> func_);\r\n\r\n        \/*!\r\n        @brief A map of vtable ptrs to string stypes.\r\n        *\/\r\n        std::unordered_map<uintptr_t, std::string> type_map;\r\n\r\n        \/*!\r\n        @brief A map of string type names to their corresponding vtable ptrs.\r\n        *\/\r\n        std::unordered_map<std::string, std::pair<uintptr_t, uintptr_t>> type_structures;\r\n\r\n        void lock();\r\n\r\n        void unlock();\r\n\r\n        static game_data_string_pool<> string_pool;\r\n    protected:\r\n        \/*!\r\n        @brief The hook function for getting type information. Hooked via intercept::invoker_begin_register.\r\n        *\/\r\n        static int __cdecl _register_hook(char *sqf_this_, uintptr_t sqf_game_state_, uintptr_t right_arg_);\r\n\r\n        \/*!\r\n        @brief The trampoline for `str` that is used as the type registration function.\r\n        *\/\r\n        static unary_function _register_hook_trampoline;\r\n\r\n        \/*!\r\n        @brief The current type of variable being passed to `str` for type analysis.\r\n        *\/\r\n        std::string _registration_type;\r\n\r\n        \/*!\r\n        @brief The mission namespace, used for getting variables.\r\n        *\/\r\n        game_value _mission_namespace;\r\n\r\n        \/*!\r\n        @brief The delete array for collecting values.\r\n        *\/\r\n        game_value _delete_array_ptr;\r\n\r\n        \/*!\r\n        @brief The scalar game_value for resizing the delete array to 0.\r\n        *\/\r\n        game_value _delete_size_zero;\r\n\r\n        \/*!\r\n        @brief The scalar game_value for resizing the delete array back to its \r\n        max size.\r\n        *\/\r\n        game_value _delete_size_max;\r\n\r\n        game_value _eh_params;\r\n\r\n        \/*!\r\n        @brief The index counter for the delete array.\r\n        *\/\r\n        uint32_t _delete_index;\r\n\r\n        \/*!\r\n        @brief This is actually null. Really it should just be exchanged with a\r\n        null literal where it is used.\r\n\r\n        This is a pointless `__thiscall` convention `this` pointer. It is never\r\n        used by any SQF function because they are not member functions.\r\n        *\/\r\n        char *_sqf_this;\r\n\r\n        \/*!\r\n        @brief The address of the game state object.\r\n\r\n        This address needs to be passed to every SQF function for proper execution.\r\n        *\/\r\n        uintptr_t _sqf_game_state;\r\n\r\n        \/*!@{\r\n        @brief Various mutexes and `std::` locking devices used for concurrency\r\n        and RV Engine access.\r\n        *\/\r\n        std::recursive_mutex _invoke_mutex;\r\n        std::mutex _state_mutex;\r\n        std::mutex _delete_mutex;\r\n        std::condition_variable _invoke_condition;\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @brief A collection of demo threads, used for testing locking\/concurrency.\r\n        *\/\r\n        std::vector<std::thread> _demo_threads;\r\n\r\n        \/*!\r\n        @brief A collection of bound functions for processing event handlers in\r\n        the client plugins.\r\n        *\/\r\n        std::unordered_map < std::string, std::function<void(const std::string &, game_value &)> > _eventhandlers;\r\n\r\n        bool _patched;\r\n        bool _attached;\r\n\r\n        std::queue<game_data *> _to_delete;\r\n\r\n        \r\n\r\n        \/*!\r\n        @brief A RAII style mutex handler for access to the RV Engine\r\n\r\n        Provides a safe way to unlock other threads or invokes to the RV engine. \r\n        Will unlock an invoker passed in, by default only allowing access to invokes\r\n        from the invokers own thread. If `all_threads_` is set to true in the constructor\r\n        it will unlock all threads attempting to invoke. It is also possible to\r\n        delay unlocking, so that the unlock can happen based on a condition but\r\n        still retain the safety of being bound to the scope in which it was declared.\r\n\r\n        Instances of this class are NOT moveable or copyable.\r\n        *\/\r\n        class _invoker_unlock {\r\n        public:\r\n            _invoker_unlock(invoker *instance_, bool all_threads_ = false, bool delayed_ = false);\r\n            _invoker_unlock(const invoker &) = delete;\r\n            _invoker_unlock(invoker &&) = delete;\r\n            _invoker_unlock & operator=(const _invoker_unlock &) = delete;\r\n            _invoker_unlock & operator=(_invoker_unlock &&) = delete;\r\n            ~_invoker_unlock();\r\n            void unlock();\r\n        protected:\r\n            bool _unlocked;\r\n            invoker *_instance;\r\n            bool _all;\r\n        };\r\n    };\r\n\r\n\r\n}<commit_msg>Woops, lets actually delete the right copy\/move constructors eh?<commit_after>\/*!\r\n@file\r\n@author Nou (korewananda@gmail.com)\r\n\r\n@brief Contains the intercept::invoker class.\r\n\r\nhttps:\/\/github.com\/NouberNou\/intercept\r\n*\/\r\n#pragma once\r\n#include \"shared.hpp\"\r\n#include \"singleton.hpp\"\r\n#include \"logging.hpp\"\r\n#include \"arguments.hpp\"\r\n#include \"loader.hpp\"\r\n#include \"shared\\types.hpp\"\r\n#include <mutex>\r\n#include <condition_variable>\r\n#include <queue>\r\n#include \"eventhandlers.hpp\"\r\n\r\n\r\nusing namespace intercept::types;\r\n\r\n\r\nnamespace intercept {\r\n    class _invoker_unlock;\r\n    \/*!\r\n    @brief Handles invoking SQF functions. Used as an interface between clients, \r\n    RV Engine, and the intercept::loader.\r\n\r\n    The invoker class handles all of the bread and butter tasks of Intercept, it \r\n    is used as a bridge between client plugins, the RV Engine, and the data gathered \r\n    by the loader class.\r\n\r\n    This includes:\r\n    - Invoking specific SQF functions.\r\n    - Releasing Memory\r\n    - Defining and handling SQF internal types.\r\n    - Testing the validity of the Intercept system at boot\/mission start.\r\n    *\/\r\n    class invoker\r\n        : public singleton<invoker>\r\n    {\r\n    public:\r\n        invoker();\r\n        ~invoker();\r\n\r\n        \/*!\r\n        @brief Attaches intercept::controller commands from this class to the main\r\n        controller.\r\n        *\/\r\n        void attach_controller();\r\n        \r\n        \/*!\r\n        @name Invoke Functions\r\n        *\/\r\n        \/\/!@{\r\n        \/*!@{\r\n        @brief Nular invoke functions.\r\n\r\n        Invoke a nular SQF function, either by function pointer or by name.\r\n\r\n        @return Returns a raw intercept::types::rv_game_value struct. This is often\r\n        passed into a intercept::types::game_value to be unwound into the appropriate\r\n        return type, or passed to a complex argument constructor such as `object`\r\n        or `group`, etc.\r\n        *\/\r\n        rv_game_value invoke_raw(nular_function function_);\r\n        rv_game_value invoke_raw_nolock(nular_function function_);\r\n        rv_game_value invoke_raw(std::string function_name_);\r\n        \/\/!@}\r\n\r\n        \/*!@{\r\n        @brief Unary invoke functions.\r\n\r\n        Invoke a unary SQF function, either by function pointer or by name and \r\n        arguement signatures.\r\n\r\n        @return Returns a raw intercept::types::rv_game_value struct. This is often\r\n        passed into a intercept::types::game_value to be unwound into the appropriate\r\n        return type, or passed to a complex argument constructor such as `object`\r\n        or `group`, etc.\r\n        *\/\r\n        rv_game_value invoke_raw(unary_function function_, const game_value * right_);\r\n        rv_game_value invoke_raw_nolock(unary_function function_, const game_value * right_);\r\n        rv_game_value invoke_raw(std::string function_name_, const game_value *right_);\r\n        rv_game_value invoke_raw(std::string function_name_, const game_value *right_, std::string right_type_);\r\n        \/\/!@}\r\n\r\n        \/*!@{\r\n        @brief Binary invoke functions.\r\n\r\n        Invoke a binary SQF function, either by function pointer or by name and\r\n        arguement signatures.\r\n\r\n        @return Returns a raw intercept::types::rv_game_value struct. This is often\r\n        passed into a intercept::types::game_value to be unwound into the appropriate\r\n        return type, or passed to a complex argument constructor such as `object`\r\n        or `group`, etc.\r\n        *\/\r\n        rv_game_value invoke_raw(binary_function function_, const game_value * left_, const game_value * right_);\r\n        rv_game_value invoke_raw_nolock(binary_function function_, const game_value * left_, const game_value * right_);\r\n        rv_game_value invoke_raw(std::string function_name_, const game_value *left_, const game_value *right_);\r\n        rv_game_value invoke_raw(std::string function_name_, const game_value *left_, std::string left_type_, const game_value *right_, std::string right_type_);\r\n        \/\/!@}\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @name Type Functions\r\n        *\/\r\n        \/\/!@{\r\n        \/*!\r\n        @brief Returns the numerical type id. This is the vtable ptr of the data\r\n        type.\r\n        *\/\r\n        uintptr_t get_type(const game_value *value_) const;\r\n\r\n        \/*!\r\n        @brief Returns the string representation of the data type. IE: \"ARRAY\",\r\n        \"STRING\", \"SCALAR\", etc.\r\n        *\/\r\n        const std::string get_type_str(const game_value *value_) const;\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @name Memory Functions\r\n        *\/\r\n        \/\/!@{\r\n        \/*!\r\n        @brief Releases a value that was obtained from the RV Engine.\r\n\r\n        This function releases the data of a value obtained from inside the RV\r\n        Engine. Data obtained in the RV Engine must be released in the RV Engine\r\n        and as such we need to have a method of doing this.\r\n\r\n        The way that Intercept handles this is by defining a global array in SQF\r\n        and populating tha array with values that need to be freed. When the array\r\n        reaches a certain size, it is resized to 0 and this invokes SQF to release\r\n        the variable memory (depending on the internal ref-count, which can be\r\n        manipulated both in Intercept and inside the RV Engine itself via SQF.\r\n\r\n        @param value_ A pointer to the value that is to be freed.\r\n        @param immediate_ If this value should be released immediately. If set \r\n        to true, this will also free any other variables waiting to be freed.\r\n\r\n        @return `true` if the value was added to the collection array, `false`\r\n        if the value was not released (due to it not being properly owned by the\r\n        RV Engine).\r\n        *\/\r\n        bool release_value(game_value * value_, bool immediate_ = true);\r\n\r\n        \/*!\r\n        @brief Actually resizes the collection array to 0 and back to its normal\r\n        size of 100.\r\n\r\n        This function is separate from the release_value function for organizational\r\n        reasons. It invokes an atomic lock that ensures that the array is resized\r\n        to 0 and back to its normal size in one step and that no other variables\r\n        might accidently race and be added to a 0 size array.\r\n        *\/\r\n        void invoke_delete();\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @name Controller Functions\r\n        *\/\r\n        \/\/!@{\r\n        \/*!\r\n        @brief Hooks the SQF `str` function to derive type information at boot.\r\n        *\/\r\n        bool invoker_begin_register(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Defines what the next variable type will be from the hooked function.\r\n        *\/\r\n        bool invoker_register(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Unhooks the SQF `str` function.\r\n        *\/\r\n        bool invoker_end_register(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Initializes the Invoker at mission start. This assignes the delete\r\n        storage array, and sets the zero\/max size arguments.\r\n        *\/\r\n        bool init_invoker(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Tests the invoker. This function will attempt to get the Steam profile\r\n        name of the current game user and compare the value with the same call\r\n        made in normal SQF.\r\n        *\/\r\n        bool test_invoker(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Opens the RV Engine up for a period of time to allow client threads\r\n        access.\r\n\r\n        This is easily the most important function in the invoker as it is the \r\n        function that dictates when other threads can access the game engine.\r\n\r\n        This function is invoked from a per-frame handler in SQF, each frame this\r\n        controller function is called and the Invoker will unlock all client threads\r\n        for 3ms of access to the RV Engine and then it will close. Before it closes\r\n        though it invokes the clients `on_frame()` function, which is a blocking\r\n        function call that each client plugin can define for guaranteed per-frame\r\n        execution.\r\n        *\/\r\n        bool do_invoke_period(const arguments & args_, std::string & result_);\r\n\r\n        \/*!\r\n        @brief Consume an event from the RV Engine and dispatches it.\r\n        *\/\r\n        bool rv_event(const arguments & args_, std::string & result_);\r\n        \r\n        \/*!\r\n        This is a general purpose function to test the invoker. It is not meant\r\n        for public use and is only there to serve as an easy test bed for development.\r\n        *\/\r\n        bool invoker_demo(const arguments & args_, std::string & result_);\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @brief Adds a bound event handler-handler to the map of event handler binds \r\n        for invoking a RV event handler in the client plugins.\r\n\r\n        @param name_ The name of the event being raised from SQF (these need to\r\n        be bound in SQF to call into the `rv_event` `callExtension` event in this\r\n        class).\r\n        @param func_ The function bind.\r\n\r\n        @return Returns `true` if it was bound, `false` if it was not.\r\n        *\/\r\n        bool add_eventhandler(const std::string & name_, std::function<void(const std::string &, game_value &)> func_);\r\n\r\n        \/*!\r\n        @brief A map of vtable ptrs to string stypes.\r\n        *\/\r\n        std::unordered_map<uintptr_t, std::string> type_map;\r\n\r\n        \/*!\r\n        @brief A map of string type names to their corresponding vtable ptrs.\r\n        *\/\r\n        std::unordered_map<std::string, std::pair<uintptr_t, uintptr_t>> type_structures;\r\n\r\n        void lock();\r\n\r\n        void unlock();\r\n\r\n        static game_data_string_pool<> string_pool;\r\n    protected:\r\n        \/*!\r\n        @brief The hook function for getting type information. Hooked via intercept::invoker_begin_register.\r\n        *\/\r\n        static int __cdecl _register_hook(char *sqf_this_, uintptr_t sqf_game_state_, uintptr_t right_arg_);\r\n\r\n        \/*!\r\n        @brief The trampoline for `str` that is used as the type registration function.\r\n        *\/\r\n        static unary_function _register_hook_trampoline;\r\n\r\n        \/*!\r\n        @brief The current type of variable being passed to `str` for type analysis.\r\n        *\/\r\n        std::string _registration_type;\r\n\r\n        \/*!\r\n        @brief The mission namespace, used for getting variables.\r\n        *\/\r\n        game_value _mission_namespace;\r\n\r\n        \/*!\r\n        @brief The delete array for collecting values.\r\n        *\/\r\n        game_value _delete_array_ptr;\r\n\r\n        \/*!\r\n        @brief The scalar game_value for resizing the delete array to 0.\r\n        *\/\r\n        game_value _delete_size_zero;\r\n\r\n        \/*!\r\n        @brief The scalar game_value for resizing the delete array back to its \r\n        max size.\r\n        *\/\r\n        game_value _delete_size_max;\r\n\r\n        game_value _eh_params;\r\n\r\n        \/*!\r\n        @brief The index counter for the delete array.\r\n        *\/\r\n        uint32_t _delete_index;\r\n\r\n        \/*!\r\n        @brief This is actually null. Really it should just be exchanged with a\r\n        null literal where it is used.\r\n\r\n        This is a pointless `__thiscall` convention `this` pointer. It is never\r\n        used by any SQF function because they are not member functions.\r\n        *\/\r\n        char *_sqf_this;\r\n\r\n        \/*!\r\n        @brief The address of the game state object.\r\n\r\n        This address needs to be passed to every SQF function for proper execution.\r\n        *\/\r\n        uintptr_t _sqf_game_state;\r\n\r\n        \/*!@{\r\n        @brief Various mutexes and `std::` locking devices used for concurrency\r\n        and RV Engine access.\r\n        *\/\r\n        std::recursive_mutex _invoke_mutex;\r\n        std::mutex _state_mutex;\r\n        std::mutex _delete_mutex;\r\n        std::condition_variable _invoke_condition;\r\n        \/\/!@}\r\n\r\n        \/*!\r\n        @brief A collection of demo threads, used for testing locking\/concurrency.\r\n        *\/\r\n        std::vector<std::thread> _demo_threads;\r\n\r\n        \/*!\r\n        @brief A collection of bound functions for processing event handlers in\r\n        the client plugins.\r\n        *\/\r\n        std::unordered_map < std::string, std::function<void(const std::string &, game_value &)> > _eventhandlers;\r\n\r\n        bool _patched;\r\n        bool _attached;\r\n\r\n        std::queue<game_data *> _to_delete;\r\n\r\n        \r\n\r\n        \/*!\r\n        @brief A RAII style mutex handler for access to the RV Engine\r\n\r\n        Provides a safe way to unlock other threads or invokes to the RV engine. \r\n        Will unlock an invoker passed in, by default only allowing access to invokes\r\n        from the invokers own thread. If `all_threads_` is set to true in the constructor\r\n        it will unlock all threads attempting to invoke. It is also possible to\r\n        delay unlocking, so that the unlock can happen based on a condition but\r\n        still retain the safety of being bound to the scope in which it was declared.\r\n\r\n        Instances of this class are NOT moveable or copyable.\r\n        *\/\r\n        class _invoker_unlock {\r\n        public:\r\n            _invoker_unlock(invoker *instance_, bool all_threads_ = false, bool delayed_ = false);\r\n            _invoker_unlock(const _invoker_unlock &) = delete;\r\n            _invoker_unlock(_invoker_unlock &&) = delete;\r\n            _invoker_unlock & operator=(const _invoker_unlock &) = delete;\r\n            _invoker_unlock & operator=(_invoker_unlock &&) = delete;\r\n            ~_invoker_unlock();\r\n            void unlock();\r\n        protected:\r\n            bool _unlocked;\r\n            invoker *_instance;\r\n            bool _all;\r\n        };\r\n    };\r\n\r\n\r\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2010 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 \"SkJpegUtility.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstatic void sk_init_source(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n#ifdef SK_BUILD_FOR_ANDROID\n    src->current_offset = 0;\n#endif\n    if (!src->fStream->rewind()) {\n        SkDebugf(\"xxxxxxxxxxxxxx failure to rewind\\n\");\n        cinfo->err->error_exit((j_common_ptr)cinfo);\n    }\n}\n\n#ifdef SK_BUILD_FOR_ANDROID\nstatic boolean sk_seek_input_data(j_decompress_ptr cinfo, long byte_offset) {\n    skjpeg_source_mgr* src = (skjpeg_source_mgr*)cinfo->src;\n    size_t bo = (size_t) byte_offset;\n\n    if (bo > src->current_offset) {\n        (void)src->fStream->skip(bo - src->current_offset);\n    } else {\n        if (!src->fStream->rewind()) {\n            SkDebugf(\"xxxxxxxxxxxxxx failure to rewind\\n\");\n            cinfo->err->error_exit((j_common_ptr)cinfo);\n            return false;\n        }\n        (void)src->fStream->skip(bo);\n    }\n\n    src->current_offset = bo;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n    return true;\n}\n#endif\n\nstatic boolean sk_fill_input_buffer(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr* src = (skjpeg_source_mgr*)cinfo->src;\n    if (src->fDecoder != NULL && src->fDecoder->shouldCancelDecode()) {\n        return FALSE;\n    }\n    size_t bytes = src->fStream->read(src->fBuffer, skjpeg_source_mgr::kBufferSize);\n    \/\/ note that JPEG is happy with less than the full read,\n    \/\/ as long as the result is non-zero\n    if (bytes == 0) {\n        return FALSE;\n    }\n\n#ifdef SK_BUILD_FOR_ANDROID\n    src->current_offset += bytes;\n#endif\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = bytes;\n    return TRUE;\n}\n\nstatic void sk_skip_input_data(j_decompress_ptr cinfo, long num_bytes) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n\n    if (num_bytes > (long)src->bytes_in_buffer) {\n        size_t bytesToSkip = num_bytes - src->bytes_in_buffer;\n        while (bytesToSkip > 0) {\n            size_t bytes = src->fStream->skip(bytesToSkip);\n            if (bytes <= 0 || bytes > bytesToSkip) {\n\/\/              SkDebugf(\"xxxxxxxxxxxxxx failure to skip request %d returned %d\\n\", bytesToSkip, bytes);\n                cinfo->err->error_exit((j_common_ptr)cinfo);\n                return;\n            }\n#ifdef SK_BUILD_FOR_ANDROID\n            src->current_offset += bytes;\n#endif\n            bytesToSkip -= bytes;\n        }\n        src->next_input_byte = (const JOCTET*)src->fBuffer;\n        src->bytes_in_buffer = 0;\n    } else {\n        src->next_input_byte += num_bytes;\n        src->bytes_in_buffer -= num_bytes;\n    }\n}\n\nstatic void sk_term_source(j_decompress_ptr \/*cinfo*\/) {}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nskjpeg_source_mgr::skjpeg_source_mgr(SkStream* stream, SkImageDecoder* decoder)\n    : fStream(SkRef(stream))\n    , fDecoder(decoder) {\n\n    init_source = sk_init_source;\n    fill_input_buffer = sk_fill_input_buffer;\n    skip_input_data = sk_skip_input_data;\n    resync_to_restart = jpeg_resync_to_restart;\n    term_source = sk_term_source;\n#ifdef SK_BUILD_FOR_ANDROID\n    seek_input_data = sk_seek_input_data;\n#endif\n\/\/    SkDebugf(\"**************** use memorybase %p %d\\n\", fMemoryBase, fMemoryBaseSize);\n}\n\nskjpeg_source_mgr::~skjpeg_source_mgr() {\n    SkSafeUnref(fStream);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void sk_init_destination(j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    dest->next_output_byte = dest->fBuffer;\n    dest->free_in_buffer = skjpeg_destination_mgr::kBufferSize;\n}\n\nstatic boolean sk_empty_output_buffer(j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n\/\/  if (!dest->fStream->write(dest->fBuffer, skjpeg_destination_mgr::kBufferSize - dest->free_in_buffer))\n    if (!dest->fStream->write(dest->fBuffer,\n            skjpeg_destination_mgr::kBufferSize)) {\n        ERREXIT(cinfo, JERR_FILE_WRITE);\n        return false;\n    }\n\n    dest->next_output_byte = dest->fBuffer;\n    dest->free_in_buffer = skjpeg_destination_mgr::kBufferSize;\n    return TRUE;\n}\n\nstatic void sk_term_destination (j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    size_t size = skjpeg_destination_mgr::kBufferSize - dest->free_in_buffer;\n    if (size > 0) {\n        if (!dest->fStream->write(dest->fBuffer, size)) {\n            ERREXIT(cinfo, JERR_FILE_WRITE);\n            return;\n        }\n    }\n    dest->fStream->flush();\n}\n\nskjpeg_destination_mgr::skjpeg_destination_mgr(SkWStream* stream)\n        : fStream(stream) {\n    this->init_destination = sk_init_destination;\n    this->empty_output_buffer = sk_empty_output_buffer;\n    this->term_destination = sk_term_destination;\n}\n\nvoid skjpeg_error_exit(j_common_ptr cinfo) {\n    skjpeg_error_mgr* error = (skjpeg_error_mgr*)cinfo->err;\n\n    (*error->output_message) (cinfo);\n\n    \/* Let the memory manager delete any temp files before we die *\/\n    jpeg_destroy(cinfo);\n\n    longjmp(error->fJmpBuf, -1);\n}\n<commit_msg>Modify skjpeg_destination_mgr to make it work with both optimized and orignial Libjpeg's SW JPEG encoders<commit_after>\/*\n * Copyright 2010 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 \"SkJpegUtility.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstatic void sk_init_source(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n#ifdef SK_BUILD_FOR_ANDROID\n    src->current_offset = 0;\n#endif\n    if (!src->fStream->rewind()) {\n        SkDebugf(\"xxxxxxxxxxxxxx failure to rewind\\n\");\n        cinfo->err->error_exit((j_common_ptr)cinfo);\n    }\n}\n\n#ifdef SK_BUILD_FOR_ANDROID\nstatic boolean sk_seek_input_data(j_decompress_ptr cinfo, long byte_offset) {\n    skjpeg_source_mgr* src = (skjpeg_source_mgr*)cinfo->src;\n    size_t bo = (size_t) byte_offset;\n\n    if (bo > src->current_offset) {\n        (void)src->fStream->skip(bo - src->current_offset);\n    } else {\n        if (!src->fStream->rewind()) {\n            SkDebugf(\"xxxxxxxxxxxxxx failure to rewind\\n\");\n            cinfo->err->error_exit((j_common_ptr)cinfo);\n            return false;\n        }\n        (void)src->fStream->skip(bo);\n    }\n\n    src->current_offset = bo;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n    return true;\n}\n#endif\n\nstatic boolean sk_fill_input_buffer(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr* src = (skjpeg_source_mgr*)cinfo->src;\n    if (src->fDecoder != NULL && src->fDecoder->shouldCancelDecode()) {\n        return FALSE;\n    }\n    size_t bytes = src->fStream->read(src->fBuffer, skjpeg_source_mgr::kBufferSize);\n    \/\/ note that JPEG is happy with less than the full read,\n    \/\/ as long as the result is non-zero\n    if (bytes == 0) {\n        return FALSE;\n    }\n\n#ifdef SK_BUILD_FOR_ANDROID\n    src->current_offset += bytes;\n#endif\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = bytes;\n    return TRUE;\n}\n\nstatic void sk_skip_input_data(j_decompress_ptr cinfo, long num_bytes) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n\n    if (num_bytes > (long)src->bytes_in_buffer) {\n        size_t bytesToSkip = num_bytes - src->bytes_in_buffer;\n        while (bytesToSkip > 0) {\n            size_t bytes = src->fStream->skip(bytesToSkip);\n            if (bytes <= 0 || bytes > bytesToSkip) {\n\/\/              SkDebugf(\"xxxxxxxxxxxxxx failure to skip request %d returned %d\\n\", bytesToSkip, bytes);\n                cinfo->err->error_exit((j_common_ptr)cinfo);\n                return;\n            }\n#ifdef SK_BUILD_FOR_ANDROID\n            src->current_offset += bytes;\n#endif\n            bytesToSkip -= bytes;\n        }\n        src->next_input_byte = (const JOCTET*)src->fBuffer;\n        src->bytes_in_buffer = 0;\n    } else {\n        src->next_input_byte += num_bytes;\n        src->bytes_in_buffer -= num_bytes;\n    }\n}\n\nstatic void sk_term_source(j_decompress_ptr \/*cinfo*\/) {}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nskjpeg_source_mgr::skjpeg_source_mgr(SkStream* stream, SkImageDecoder* decoder)\n    : fStream(SkRef(stream))\n    , fDecoder(decoder) {\n\n    init_source = sk_init_source;\n    fill_input_buffer = sk_fill_input_buffer;\n    skip_input_data = sk_skip_input_data;\n    resync_to_restart = jpeg_resync_to_restart;\n    term_source = sk_term_source;\n#ifdef SK_BUILD_FOR_ANDROID\n    seek_input_data = sk_seek_input_data;\n#endif\n\/\/    SkDebugf(\"**************** use memorybase %p %d\\n\", fMemoryBase, fMemoryBaseSize);\n}\n\nskjpeg_source_mgr::~skjpeg_source_mgr() {\n    SkSafeUnref(fStream);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void sk_init_destination(j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    dest->next_output_byte = dest->fBuffer;\n    dest->free_in_buffer = skjpeg_destination_mgr::kBufferSize;\n}\n\nstatic boolean sk_empty_output_buffer(j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    if (!dest->fStream->write(dest->fBuffer, skjpeg_destination_mgr::kBufferSize - dest->free_in_buffer)){\n        ERREXIT(cinfo, JERR_FILE_WRITE);\n        return false;\n    }\n\n    dest->next_output_byte = dest->fBuffer;\n    dest->free_in_buffer = skjpeg_destination_mgr::kBufferSize;\n    return TRUE;\n}\n\nstatic void sk_term_destination (j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    size_t size = skjpeg_destination_mgr::kBufferSize - dest->free_in_buffer;\n    if (size > 0) {\n        if (!dest->fStream->write(dest->fBuffer, size)) {\n            ERREXIT(cinfo, JERR_FILE_WRITE);\n            return;\n        }\n    }\n    dest->fStream->flush();\n}\n\nskjpeg_destination_mgr::skjpeg_destination_mgr(SkWStream* stream)\n        : fStream(stream) {\n    this->init_destination = sk_init_destination;\n    this->empty_output_buffer = sk_empty_output_buffer;\n    this->term_destination = sk_term_destination;\n}\n\nvoid skjpeg_error_exit(j_common_ptr cinfo) {\n    skjpeg_error_mgr* error = (skjpeg_error_mgr*)cinfo->err;\n\n    (*error->output_message) (cinfo);\n\n    \/* Let the memory manager delete any temp files before we die *\/\n    jpeg_destroy(cinfo);\n\n    longjmp(error->fJmpBuf, -1);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2010 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 \"SkJpegUtility.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstatic void sk_init_source(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n    src->current_offset = 0;\n    src->fStream->rewind();\n}\n\nstatic boolean sk_seek_input_data(j_decompress_ptr cinfo, long byte_offset) {\n    skjpeg_source_mgr* src = (skjpeg_source_mgr*)cinfo->src;\n\n    if (byte_offset > src->current_offset) {\n        (void)src->fStream->skip(byte_offset - src->current_offset);\n    } else {\n        src->fStream->rewind();\n        (void)src->fStream->skip(byte_offset);\n    }\n\n    src->current_offset = byte_offset;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n    return TRUE;\n}\n\nstatic boolean sk_fill_input_buffer(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr* src = (skjpeg_source_mgr*)cinfo->src;\n    if (src->fDecoder != NULL && src->fDecoder->shouldCancelDecode()) {\n        return FALSE;\n    }\n    size_t bytes = src->fStream->read(src->fBuffer, skjpeg_source_mgr::kBufferSize);\n    \/\/ note that JPEG is happy with less than the full read,\n    \/\/ as long as the result is non-zero\n    if (bytes == 0) {\n        return FALSE;\n    }\n\n    src->current_offset += bytes;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = bytes;\n    return TRUE;\n}\n\nstatic void sk_skip_input_data(j_decompress_ptr cinfo, long num_bytes) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n\n    if (num_bytes > (long)src->bytes_in_buffer) {\n        long bytesToSkip = num_bytes - src->bytes_in_buffer;\n        while (bytesToSkip > 0) {\n            long bytes = (long)src->fStream->skip(bytesToSkip);\n            if (bytes <= 0 || bytes > bytesToSkip) {\n\/\/              SkDebugf(\"xxxxxxxxxxxxxx failure to skip request %d returned %d\\n\", bytesToSkip, bytes);\n                cinfo->err->error_exit((j_common_ptr)cinfo);\n                return;\n            }\n            src->current_offset += bytes;\n            bytesToSkip -= bytes;\n        }\n        src->next_input_byte = (const JOCTET*)src->fBuffer;\n        src->bytes_in_buffer = 0;\n    } else {\n        src->next_input_byte += num_bytes;\n        src->bytes_in_buffer -= num_bytes;\n    }\n}\n\nstatic boolean sk_resync_to_restart(j_decompress_ptr cinfo, int desired) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n\n    \/\/ what is the desired param for???\n\n    if (!src->fStream->rewind()) {\n        SkDebugf(\"xxxxxxxxxxxxxx failure to rewind\\n\");\n        cinfo->err->error_exit((j_common_ptr)cinfo);\n        return FALSE;\n    }\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n    return TRUE;\n}\n\nstatic void sk_term_source(j_decompress_ptr \/*cinfo*\/) {}\n\n\nstatic void skmem_init_source(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n    src->next_input_byte = (const JOCTET*)src->fMemoryBase;\n    src->start_input_byte = (const JOCTET*)src->fMemoryBase;\n    src->bytes_in_buffer = src->fMemoryBaseSize;\n    src->current_offset = src->fMemoryBaseSize;\n}\n\nstatic boolean skmem_fill_input_buffer(j_decompress_ptr cinfo) {\n    SkDebugf(\"xxxxxxxxxxxxxx skmem_fill_input_buffer called\\n\");\n    return FALSE;\n}\n\nstatic void skmem_skip_input_data(j_decompress_ptr cinfo, long num_bytes) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n\/\/    SkDebugf(\"xxxxxxxxxxxxxx skmem_skip_input_data called %d\\n\", num_bytes);\n    src->next_input_byte = (const JOCTET*)((const char*)src->next_input_byte + num_bytes);\n    src->bytes_in_buffer -= num_bytes;\n}\n\nstatic boolean skmem_resync_to_restart(j_decompress_ptr cinfo, int desired) {\n    SkDebugf(\"xxxxxxxxxxxxxx skmem_resync_to_restart called\\n\");\n    return TRUE;\n}\n\nstatic void skmem_term_source(j_decompress_ptr \/*cinfo*\/) {}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nskjpeg_source_mgr::skjpeg_source_mgr(SkStream* stream, SkImageDecoder* decoder,\n                                     bool copyStream, bool ownStream) : fStream(stream) {\n    fDecoder = decoder;\n    const void* baseAddr = stream->getMemoryBase();\n    size_t bufferSize = 4096;\n    size_t len;\n    fMemoryBase = NULL;\n    fUnrefStream = ownStream;\n    if (copyStream) {\n        fMemoryBaseSize = 0;\n        fMemoryBase = sk_malloc_throw(bufferSize);\n        while ((len = stream->read(fMemoryBase + fMemoryBaseSize,\n                        bufferSize - fMemoryBaseSize)) != 0) {\n            fMemoryBaseSize += len;\n            if (fMemoryBaseSize == bufferSize) {\n                bufferSize *= 2;\n                fMemoryBase = sk_realloc_throw(fMemoryBase, bufferSize);\n            }\n        }\n        fMemoryBase = sk_realloc_throw(fMemoryBase, fMemoryBaseSize);\n\n        init_source = skmem_init_source;\n        fill_input_buffer = skmem_fill_input_buffer;\n        skip_input_data = skmem_skip_input_data;\n        resync_to_restart = skmem_resync_to_restart;\n        term_source = skmem_term_source;\n        seek_input_data = NULL;\n    } else {\n        fMemoryBase = NULL;\n        fMemoryBaseSize = 0;\n\n        init_source = sk_init_source;\n        fill_input_buffer = sk_fill_input_buffer;\n        skip_input_data = sk_skip_input_data;\n        resync_to_restart = sk_resync_to_restart;\n        term_source = sk_term_source;\n        seek_input_data = sk_seek_input_data;\n    }\n\/\/    SkDebugf(\"**************** use memorybase %p %d\\n\", fMemoryBase, fMemoryBaseSize);\n}\n\nskjpeg_source_mgr::~skjpeg_source_mgr() {\n    if (fMemoryBase) {\n        sk_free(fMemoryBase);\n    }\n    if (fUnrefStream) {\n        fStream->unref();\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void sk_init_destination(j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    dest->next_output_byte = dest->fBuffer;\n    dest->free_in_buffer = skjpeg_destination_mgr::kBufferSize;\n}\n\nstatic boolean sk_empty_output_buffer(j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n\/\/  if (!dest->fStream->write(dest->fBuffer, skjpeg_destination_mgr::kBufferSize - dest->free_in_buffer))\n    if (!dest->fStream->write(dest->fBuffer,\n            skjpeg_destination_mgr::kBufferSize)) {\n        ERREXIT(cinfo, JERR_FILE_WRITE);\n        return false;\n    }\n\n    dest->next_output_byte = dest->fBuffer;\n    dest->free_in_buffer = skjpeg_destination_mgr::kBufferSize;\n    return TRUE;\n}\n\nstatic void sk_term_destination (j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    size_t size = skjpeg_destination_mgr::kBufferSize - dest->free_in_buffer;\n    if (size > 0) {\n        if (!dest->fStream->write(dest->fBuffer, size)) {\n            ERREXIT(cinfo, JERR_FILE_WRITE);\n            return;\n        }\n    }\n    dest->fStream->flush();\n}\n\nskjpeg_destination_mgr::skjpeg_destination_mgr(SkWStream* stream)\n        : fStream(stream) {\n    this->init_destination = sk_init_destination;\n    this->empty_output_buffer = sk_empty_output_buffer;\n    this->term_destination = sk_term_destination;\n}\n\nvoid skjpeg_error_exit(j_common_ptr cinfo) {\n    skjpeg_error_mgr* error = (skjpeg_error_mgr*)cinfo->err;\n\n    (*error->output_message) (cinfo);\n\n    \/* Let the memory manager delete any temp files before we die *\/\n    jpeg_destroy(cinfo);\n\n    longjmp(error->fJmpBuf, -1);\n}\n<commit_msg>Fix SkJpegUtility bug.<commit_after>\/*\n * Copyright (C) 2010 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 \"SkJpegUtility.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstatic void sk_init_source(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n    src->current_offset = 0;\n    src->fStream->rewind();\n}\n\nstatic boolean sk_seek_input_data(j_decompress_ptr cinfo, long byte_offset) {\n    skjpeg_source_mgr* src = (skjpeg_source_mgr*)cinfo->src;\n\n    if (byte_offset > src->current_offset) {\n        (void)src->fStream->skip(byte_offset - src->current_offset);\n    } else {\n        src->fStream->rewind();\n        (void)src->fStream->skip(byte_offset);\n    }\n\n    src->current_offset = byte_offset;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n    return TRUE;\n}\n\nstatic boolean sk_fill_input_buffer(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr* src = (skjpeg_source_mgr*)cinfo->src;\n    if (src->fDecoder != NULL && src->fDecoder->shouldCancelDecode()) {\n        return FALSE;\n    }\n    size_t bytes = src->fStream->read(src->fBuffer, skjpeg_source_mgr::kBufferSize);\n    \/\/ note that JPEG is happy with less than the full read,\n    \/\/ as long as the result is non-zero\n    if (bytes == 0) {\n        return FALSE;\n    }\n\n    src->current_offset += bytes;\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = bytes;\n    return TRUE;\n}\n\nstatic void sk_skip_input_data(j_decompress_ptr cinfo, long num_bytes) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n\n    if (num_bytes > (long)src->bytes_in_buffer) {\n        long bytesToSkip = num_bytes - src->bytes_in_buffer;\n        while (bytesToSkip > 0) {\n            long bytes = (long)src->fStream->skip(bytesToSkip);\n            if (bytes <= 0 || bytes > bytesToSkip) {\n\/\/              SkDebugf(\"xxxxxxxxxxxxxx failure to skip request %d returned %d\\n\", bytesToSkip, bytes);\n                cinfo->err->error_exit((j_common_ptr)cinfo);\n                return;\n            }\n            src->current_offset += bytes;\n            bytesToSkip -= bytes;\n        }\n        src->next_input_byte = (const JOCTET*)src->fBuffer;\n        src->bytes_in_buffer = 0;\n    } else {\n        src->next_input_byte += num_bytes;\n        src->bytes_in_buffer -= num_bytes;\n    }\n}\n\nstatic boolean sk_resync_to_restart(j_decompress_ptr cinfo, int desired) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n\n    \/\/ what is the desired param for???\n\n    if (!src->fStream->rewind()) {\n        SkDebugf(\"xxxxxxxxxxxxxx failure to rewind\\n\");\n        cinfo->err->error_exit((j_common_ptr)cinfo);\n        return FALSE;\n    }\n    src->next_input_byte = (const JOCTET*)src->fBuffer;\n    src->bytes_in_buffer = 0;\n    return TRUE;\n}\n\nstatic void sk_term_source(j_decompress_ptr \/*cinfo*\/) {}\n\n\nstatic void skmem_init_source(j_decompress_ptr cinfo) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n    src->next_input_byte = (const JOCTET*)src->fMemoryBase;\n    src->start_input_byte = (const JOCTET*)src->fMemoryBase;\n    src->bytes_in_buffer = src->fMemoryBaseSize;\n    src->current_offset = src->fMemoryBaseSize;\n}\n\nstatic boolean skmem_fill_input_buffer(j_decompress_ptr cinfo) {\n    SkDebugf(\"xxxxxxxxxxxxxx skmem_fill_input_buffer called\\n\");\n    return FALSE;\n}\n\nstatic void skmem_skip_input_data(j_decompress_ptr cinfo, long num_bytes) {\n    skjpeg_source_mgr*  src = (skjpeg_source_mgr*)cinfo->src;\n\/\/    SkDebugf(\"xxxxxxxxxxxxxx skmem_skip_input_data called %d\\n\", num_bytes);\n    src->next_input_byte = (const JOCTET*)((const char*)src->next_input_byte + num_bytes);\n    src->bytes_in_buffer -= num_bytes;\n}\n\nstatic boolean skmem_resync_to_restart(j_decompress_ptr cinfo, int desired) {\n    SkDebugf(\"xxxxxxxxxxxxxx skmem_resync_to_restart called\\n\");\n    return TRUE;\n}\n\nstatic void skmem_term_source(j_decompress_ptr \/*cinfo*\/) {}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nskjpeg_source_mgr::skjpeg_source_mgr(SkStream* stream, SkImageDecoder* decoder,\n                                     bool copyStream, bool ownStream) : fStream(stream) {\n    fDecoder = decoder;\n    const void* baseAddr = stream->getMemoryBase();\n    size_t bufferSize = 4096;\n    size_t len;\n    fMemoryBase = NULL;\n    fUnrefStream = ownStream;\n    if (copyStream) {\n        fMemoryBaseSize = 0;\n        fMemoryBase = sk_malloc_throw(bufferSize);\n        while ((len = stream->read((char*)fMemoryBase + fMemoryBaseSize,\n                    bufferSize - fMemoryBaseSize)) != 0) {\n            fMemoryBaseSize += len;\n            if (fMemoryBaseSize == bufferSize) {\n                bufferSize *= 2;\n                fMemoryBase = sk_realloc_throw(fMemoryBase, bufferSize);\n            }\n        }\n        fMemoryBase = sk_realloc_throw(fMemoryBase, fMemoryBaseSize);\n\n        init_source = skmem_init_source;\n        fill_input_buffer = skmem_fill_input_buffer;\n        skip_input_data = skmem_skip_input_data;\n        resync_to_restart = skmem_resync_to_restart;\n        term_source = skmem_term_source;\n        seek_input_data = NULL;\n    } else {\n        fMemoryBase = NULL;\n        fMemoryBaseSize = 0;\n\n        init_source = sk_init_source;\n        fill_input_buffer = sk_fill_input_buffer;\n        skip_input_data = sk_skip_input_data;\n        resync_to_restart = sk_resync_to_restart;\n        term_source = sk_term_source;\n        seek_input_data = sk_seek_input_data;\n    }\n\/\/    SkDebugf(\"**************** use memorybase %p %d\\n\", fMemoryBase, fMemoryBaseSize);\n}\n\nskjpeg_source_mgr::~skjpeg_source_mgr() {\n    if (fMemoryBase) {\n        sk_free(fMemoryBase);\n    }\n    if (fUnrefStream) {\n        fStream->unref();\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void sk_init_destination(j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    dest->next_output_byte = dest->fBuffer;\n    dest->free_in_buffer = skjpeg_destination_mgr::kBufferSize;\n}\n\nstatic boolean sk_empty_output_buffer(j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n\/\/  if (!dest->fStream->write(dest->fBuffer, skjpeg_destination_mgr::kBufferSize - dest->free_in_buffer))\n    if (!dest->fStream->write(dest->fBuffer,\n            skjpeg_destination_mgr::kBufferSize)) {\n        ERREXIT(cinfo, JERR_FILE_WRITE);\n        return false;\n    }\n\n    dest->next_output_byte = dest->fBuffer;\n    dest->free_in_buffer = skjpeg_destination_mgr::kBufferSize;\n    return TRUE;\n}\n\nstatic void sk_term_destination (j_compress_ptr cinfo) {\n    skjpeg_destination_mgr* dest = (skjpeg_destination_mgr*)cinfo->dest;\n\n    size_t size = skjpeg_destination_mgr::kBufferSize - dest->free_in_buffer;\n    if (size > 0) {\n        if (!dest->fStream->write(dest->fBuffer, size)) {\n            ERREXIT(cinfo, JERR_FILE_WRITE);\n            return;\n        }\n    }\n    dest->fStream->flush();\n}\n\nskjpeg_destination_mgr::skjpeg_destination_mgr(SkWStream* stream)\n        : fStream(stream) {\n    this->init_destination = sk_init_destination;\n    this->empty_output_buffer = sk_empty_output_buffer;\n    this->term_destination = sk_term_destination;\n}\n\nvoid skjpeg_error_exit(j_common_ptr cinfo) {\n    skjpeg_error_mgr* error = (skjpeg_error_mgr*)cinfo->err;\n\n    (*error->output_message) (cinfo);\n\n    \/* Let the memory manager delete any temp files before we die *\/\n    jpeg_destroy(cinfo);\n\n    longjmp(error->fJmpBuf, -1);\n}\n<|endoftext|>"}
{"text":"<commit_before><?hh \/\/ strict\n\n\/**\n * This file is part of hhpack\\process package.\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\\process\\input;\n\nuse hhpack\\process\\Writable;\n\nfinal class FileInputStream implements ReadableStream<int>\n{\n\n    private resource $handle;\n\n    public function __construct(\n        private string $path\n    )\n    {\n        $this->handle = fopen($this->path, 'r');\n        stream_set_blocking($this->handle, 0);\n    }\n\n    public function eof() : bool\n    {\n        return feof($this->handle);\n    }\n\n    public function isOpened() : bool\n    {\n        return is_resource($this->handle);\n    }\n\n    public function isClosed() : bool\n    {\n        return $this->isOpened() === false;\n    }\n\n    public function ready() : bool\n    {\n        $read = [ $this->handle ];\n        $write = [];\n        $expect = null;\n\n        $ng = ($num = stream_select($read, $write, $expect, 0, 200000)) === false;\n\n        if ($ng || $num <= 0) {\n            return false;\n        }\n\n        return true;\n    }\n\n    public function notReady() : bool\n    {\n        return $this->ready() === false;\n    }\n\n    public function read(int $length = 4096) : string\n    {\n        if ($this->notReady()) {\n            return '';\n        }\n\n        $bufferedOutput = '';\n\n        while (($chunk = fread($this->handle, 16384)) !== false) {\n            if ((string) $chunk === '') {\n                break;\n            }\n            $bufferedOutput .= (string) $chunk;\n        }\n\n        if ($this->eof() && strlen($bufferedOutput) <= 0) {\n            $this->close();\n        }\n\n        return $bufferedOutput;\n    }\n\n    public function close() : void\n    {\n        fclose($this->handle);\n    }\n\n}\n<commit_msg>delegate stream<commit_after><?hh \/\/ strict\n\n\/**\n * This file is part of hhpack\\process package.\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\\process\\input;\n\nuse hhpack\\process\\Writable;\n\nfinal class FileInputStream implements ReadableStream<int>\n{\n\n    private ResourceStream $stream;\n\n    public function __construct(\n        private string $path\n    )\n    {\n        $handle = fopen($this->path, 'r');\n        $this->stream = new ResourceStream($handle);\n    }\n\n    public function eof() : bool\n    {\n        return $this->stream->eof();\n    }\n\n    public function isOpened() : bool\n    {\n        return $this->stream->isOpened();\n    }\n\n    public function isClosed() : bool\n    {\n        return $this->stream->isClosed();\n    }\n\n    public function ready() : bool\n    {\n        return $this->stream->ready();\n    }\n\n    public function notReady() : bool\n    {\n        return $this->stream->notReady();\n    }\n\n    public function read(int $length = 4096) : string\n    {\n        return $this->stream->read($length);\n    }\n\n    public function close() : void\n    {\n        $this->stream->close();\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ net_fdm.hxx -- defines a common net I\/O interface to the flight\n\/\/                dynamics model\n\/\/\n\/\/ Written by Curtis Olson - http:\/\/www.flightgear.org\/~curt\n\/\/ Started September 2001.\n\/\/\n\/\/ This file is in the Public Domain, and comes with no warranty.\n\/\/\n\/\/ $Id: net_fdm.hxx,v 1.2 2007\/12\/03 09:21:47 jberndt Exp $\n\n\n#ifndef _NET_FDM_HXX\n#define _NET_FDM_HXX\n\n\n#include <time.h> \/\/ time_t\n\n#ifdef _MSC_VER\ntypedef unsigned long uint32_t;\ntypedef long int32_t;\n#endif\n\n\/\/--->>>#include <simgear\/misc\/stdint.hxx> \/\/not required for JSBSim\n\n\n\/\/ NOTE: this file defines an external interface structure.  Due to\n\/\/ variability between platforms and architectures, we only used fixed\n\/\/ length types here.  Specifically, integer types can vary in length.\n\/\/ I am not aware of any platforms that don't use 4 bytes for float\n\/\/ and 8 bytes for double.\n\nconst uint32_t FG_NET_FDM_VERSION = 24;\n\n\n\/\/ Define a structure containing the top level flight dynamics model\n\/\/ parameters\n\nclass FGNetFDM {\n\npublic:\n\n    enum {\n        FG_MAX_ENGINES = 4,\n        FG_MAX_WHEELS = 3,\n        FG_MAX_TANKS = 4\n    };\n\n    uint32_t version;\t\t\/\/ increment when data values change\n    uint32_t padding;\t\t\/\/ padding\n\n    \/\/ Positions\n    double longitude;\t\t\/\/ geodetic (radians)\n    double latitude;\t\t\/\/ geodetic (radians)\n    double altitude;\t\t\/\/ above sea level (meters)\n    float agl;\t\t\t\/\/ above ground level (meters)\n    float phi;\t\t\t\/\/ roll (radians)\n    float theta;\t\t\/\/ pitch (radians)\n    float psi;\t\t\t\/\/ yaw or true heading (radians)\n    float alpha;                \/\/ angle of attack (radians)\n    float beta;                 \/\/ side slip angle (radians)\n\n    \/\/ Velocities\n    float phidot;\t\t\/\/ roll rate (radians\/sec)\n    float thetadot;\t\t\/\/ pitch rate (radians\/sec)\n    float psidot;\t\t\/\/ yaw rate (radians\/sec)\n    float vcas;\t\t        \/\/ calibrated airspeed\n    float climb_rate;\t\t\/\/ feet per second\n    float v_north;              \/\/ north velocity in local\/body frame, fps\n    float v_east;               \/\/ east velocity in local\/body frame, fps\n    float v_down;               \/\/ down\/vertical velocity in local\/body frame, fps\n    float v_wind_body_north;    \/\/ north velocity in local\/body frame\n                                \/\/ relative to local airmass, fps\n    float v_wind_body_east;     \/\/ east velocity in local\/body frame\n                                \/\/ relative to local airmass, fps\n    float v_wind_body_down;     \/\/ down\/vertical velocity in local\/body\n                                \/\/ frame relative to local airmass, fps\n\n    \/\/ Accelerations\n    float A_X_pilot;\t\t\/\/ X accel in body frame ft\/sec^2\n    float A_Y_pilot;\t\t\/\/ Y accel in body frame ft\/sec^2\n    float A_Z_pilot;\t\t\/\/ Z accel in body frame ft\/sec^2\n\n    \/\/ Stall\n    float stall_warning;        \/\/ 0.0 - 1.0 indicating the amount of stall\n    float slip_deg;\t\t\/\/ slip ball deflection\n\n    \/\/ Pressure\n    \n    \/\/ Engine status\n    uint32_t num_engines;\t     \/\/ Number of valid engines\n    uint32_t eng_state[FG_MAX_ENGINES];\/\/ Engine state (off, cranking, running)\n    float rpm[FG_MAX_ENGINES];\t     \/\/ Engine RPM rev\/min\n    float fuel_flow[FG_MAX_ENGINES]; \/\/ Fuel flow gallons\/hr\n    float fuel_px[FG_MAX_ENGINES];   \/\/ Fuel pressure psi\n    float egt[FG_MAX_ENGINES];\t     \/\/ Exhuast gas temp deg F\n    float cht[FG_MAX_ENGINES];\t     \/\/ Cylinder head temp deg F\n    float mp_osi[FG_MAX_ENGINES];    \/\/ Manifold pressure\n    float tit[FG_MAX_ENGINES];\t     \/\/ Turbine Inlet Temperature\n    float oil_temp[FG_MAX_ENGINES];  \/\/ Oil temp deg F\n    float oil_px[FG_MAX_ENGINES];    \/\/ Oil pressure psi\n\n    \/\/ Consumables\n    uint32_t num_tanks;\t\t\/\/ Max number of fuel tanks\n    float fuel_quantity[FG_MAX_TANKS];\n\n    \/\/ Gear status\n    uint32_t num_wheels;\n    uint32_t wow[FG_MAX_WHEELS];\n    float gear_pos[FG_MAX_WHEELS];\n    float gear_steer[FG_MAX_WHEELS];\n    float gear_compression[FG_MAX_WHEELS];\n\n    \/\/ Environment\n    uint32_t cur_time;           \/\/ current unix time\n                                 \/\/ FIXME: make this uint64_t before 2038\n    int32_t warp;                \/\/ offset in seconds to unix time\n    float visibility;            \/\/ visibility in meters (for env. effects)\n\n    \/\/ Control surface positions (normalized values)\n    float elevator;\n    float elevator_trim_tab;\n    float left_flap;\n    float right_flap;\n    float left_aileron;\n    float right_aileron;\n    float rudder;\n    float nose_wheel;\n    float speedbrake;\n    float spoilers;\n};\n\n\n#endif \/\/ _NET_FDM_HXX\n<commit_msg>Needed by newer gcc.<commit_after>\/\/ net_fdm.hxx -- defines a common net I\/O interface to the flight\n\/\/                dynamics model\n\/\/\n\/\/ Written by Curtis Olson - http:\/\/www.flightgear.org\/~curt\n\/\/ Started September 2001.\n\/\/\n\/\/ This file is in the Public Domain, and comes with no warranty.\n\/\/\n\/\/ $Id: net_fdm.hxx,v 1.3 2009\/10\/26 19:42:06 andgi Exp $\n\n\n#ifndef _NET_FDM_HXX\n#define _NET_FDM_HXX\n\n\n#include <time.h> \/\/ time_t\n#include <stdint.h>\n\n#ifdef _MSC_VER\ntypedef unsigned long uint32_t;\ntypedef long int32_t;\n#endif\n\n\/\/--->>>#include <simgear\/misc\/stdint.hxx> \/\/not required for JSBSim\n\n\n\/\/ NOTE: this file defines an external interface structure.  Due to\n\/\/ variability between platforms and architectures, we only used fixed\n\/\/ length types here.  Specifically, integer types can vary in length.\n\/\/ I am not aware of any platforms that don't use 4 bytes for float\n\/\/ and 8 bytes for double.\n\nconst uint32_t FG_NET_FDM_VERSION = 24;\n\n\n\/\/ Define a structure containing the top level flight dynamics model\n\/\/ parameters\n\nclass FGNetFDM {\n\npublic:\n\n    enum {\n        FG_MAX_ENGINES = 4,\n        FG_MAX_WHEELS = 3,\n        FG_MAX_TANKS = 4\n    };\n\n    uint32_t version;\t\t\/\/ increment when data values change\n    uint32_t padding;\t\t\/\/ padding\n\n    \/\/ Positions\n    double longitude;\t\t\/\/ geodetic (radians)\n    double latitude;\t\t\/\/ geodetic (radians)\n    double altitude;\t\t\/\/ above sea level (meters)\n    float agl;\t\t\t\/\/ above ground level (meters)\n    float phi;\t\t\t\/\/ roll (radians)\n    float theta;\t\t\/\/ pitch (radians)\n    float psi;\t\t\t\/\/ yaw or true heading (radians)\n    float alpha;                \/\/ angle of attack (radians)\n    float beta;                 \/\/ side slip angle (radians)\n\n    \/\/ Velocities\n    float phidot;\t\t\/\/ roll rate (radians\/sec)\n    float thetadot;\t\t\/\/ pitch rate (radians\/sec)\n    float psidot;\t\t\/\/ yaw rate (radians\/sec)\n    float vcas;\t\t        \/\/ calibrated airspeed\n    float climb_rate;\t\t\/\/ feet per second\n    float v_north;              \/\/ north velocity in local\/body frame, fps\n    float v_east;               \/\/ east velocity in local\/body frame, fps\n    float v_down;               \/\/ down\/vertical velocity in local\/body frame, fps\n    float v_wind_body_north;    \/\/ north velocity in local\/body frame\n                                \/\/ relative to local airmass, fps\n    float v_wind_body_east;     \/\/ east velocity in local\/body frame\n                                \/\/ relative to local airmass, fps\n    float v_wind_body_down;     \/\/ down\/vertical velocity in local\/body\n                                \/\/ frame relative to local airmass, fps\n\n    \/\/ Accelerations\n    float A_X_pilot;\t\t\/\/ X accel in body frame ft\/sec^2\n    float A_Y_pilot;\t\t\/\/ Y accel in body frame ft\/sec^2\n    float A_Z_pilot;\t\t\/\/ Z accel in body frame ft\/sec^2\n\n    \/\/ Stall\n    float stall_warning;        \/\/ 0.0 - 1.0 indicating the amount of stall\n    float slip_deg;\t\t\/\/ slip ball deflection\n\n    \/\/ Pressure\n    \n    \/\/ Engine status\n    uint32_t num_engines;\t     \/\/ Number of valid engines\n    uint32_t eng_state[FG_MAX_ENGINES];\/\/ Engine state (off, cranking, running)\n    float rpm[FG_MAX_ENGINES];\t     \/\/ Engine RPM rev\/min\n    float fuel_flow[FG_MAX_ENGINES]; \/\/ Fuel flow gallons\/hr\n    float fuel_px[FG_MAX_ENGINES];   \/\/ Fuel pressure psi\n    float egt[FG_MAX_ENGINES];\t     \/\/ Exhuast gas temp deg F\n    float cht[FG_MAX_ENGINES];\t     \/\/ Cylinder head temp deg F\n    float mp_osi[FG_MAX_ENGINES];    \/\/ Manifold pressure\n    float tit[FG_MAX_ENGINES];\t     \/\/ Turbine Inlet Temperature\n    float oil_temp[FG_MAX_ENGINES];  \/\/ Oil temp deg F\n    float oil_px[FG_MAX_ENGINES];    \/\/ Oil pressure psi\n\n    \/\/ Consumables\n    uint32_t num_tanks;\t\t\/\/ Max number of fuel tanks\n    float fuel_quantity[FG_MAX_TANKS];\n\n    \/\/ Gear status\n    uint32_t num_wheels;\n    uint32_t wow[FG_MAX_WHEELS];\n    float gear_pos[FG_MAX_WHEELS];\n    float gear_steer[FG_MAX_WHEELS];\n    float gear_compression[FG_MAX_WHEELS];\n\n    \/\/ Environment\n    uint32_t cur_time;           \/\/ current unix time\n                                 \/\/ FIXME: make this uint64_t before 2038\n    int32_t warp;                \/\/ offset in seconds to unix time\n    float visibility;            \/\/ visibility in meters (for env. effects)\n\n    \/\/ Control surface positions (normalized values)\n    float elevator;\n    float elevator_trim_tab;\n    float left_flap;\n    float right_flap;\n    float left_aileron;\n    float right_aileron;\n    float rudder;\n    float nose_wheel;\n    float speedbrake;\n    float spoilers;\n};\n\n\n#endif \/\/ _NET_FDM_HXX\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Asynchronous local file access.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_file.hxx\"\n#include \"istream_buffer.hxx\"\n#include \"istream_oo.hxx\"\n#include \"buffered_io.hxx\"\n#include \"system\/fd_util.h\"\n#include \"gerrno.h\"\n#include \"pool.hxx\"\n#include \"fb_pool.hxx\"\n#include \"SliceFifoBuffer.hxx\"\n#include \"event\/Event.hxx\"\n#include \"event\/Callback.hxx\"\n\n#include <assert.h>\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#include <limits.h>\n\n\/**\n * If EAGAIN occurs (on NFS), we try again after 100ms.  We can't\n * check EV_READ, because the kernel always indicates VFS files as\n * \"readable without blocking\".\n *\/\nstatic const struct timeval file_retry_timeout = {\n    .tv_sec = 0,\n    .tv_usec = 100000,\n};\n\nstruct FileIstream final : public Istream {\n    int fd;\n\n    FdType fd_type;\n\n    \/**\n     * A timer to retry reading after EAGAIN.\n     *\/\n    Event event;\n\n    off_t rest;\n    SliceFifoBuffer buffer;\n    const char *path;\n\n    FileIstream(struct pool &p, int _fd, FdType _fd_type, off_t _length,\n                const char *_path)\n        :Istream(p),\n         fd(_fd), fd_type(_fd_type), rest(_length),\n         path(_path) {\n        event.SetTimer(MakeSimpleEventCallback(FileIstream, EventCallback),\n                       this);\n    }\n\n    static FileIstream &Cast2(struct istream &i) {\n        return (FileIstream &)Istream::Cast(i);\n    }\n\n    void CloseHandle() {\n        if (fd < 0)\n            return;\n\n        event.Delete();\n\n        close(fd);\n        fd = -1;\n\n        buffer.FreeIfDefined(fb_pool_get());\n    }\n\n    void Abort(GError *error) {\n        CloseHandle();\n        DestroyError(error);\n    }\n\n    \/**\n     * @return the number of bytes still in the buffer\n     *\/\n    size_t SubmitBuffer() {\n        return ConsumeFromBuffer(buffer);\n    }\n\n    void EofDetected() {\n        assert(fd >= 0);\n\n        CloseHandle();\n        DestroyEof();\n    }\n\n    gcc_pure\n    size_t GetMaxRead() const {\n        if (rest != (off_t)-1 && rest < (off_t)INT_MAX)\n            return (size_t)rest;\n        else\n            return INT_MAX;\n    }\n\n    void TryData();\n    void TryDirect();\n\n    void TryRead() {\n        if (CheckDirect(fd_type))\n            TryDirect();\n        else\n            TryData();\n    }\n\n    void EventCallback() {\n        TryRead();\n    }\n\n    \/* virtual methods from class Istream *\/\n\n    off_t GetAvailable(bool partial) override;\n    off_t Skip(gcc_unused off_t length) override;\n\n    void Read() override {\n        event.Delete();\n        TryRead();\n    }\n\n    int AsFd() override;\n    void Close() override {\n        CloseHandle();\n        Destroy();\n    }\n};\n\ninline void\nFileIstream::TryData()\n{\n    size_t buffer_rest = 0;\n\n    if (buffer.IsNull()) {\n        if (rest != 0)\n            buffer.Allocate(fb_pool_get());\n    } else {\n        const size_t available = buffer.GetAvailable();\n        if (available > 0) {\n            buffer_rest = SubmitBuffer();\n            if (buffer_rest == available)\n                \/* not a single byte was consumed: we may have been\n                   closed, and we must bail out now *\/\n                return;\n        }\n    }\n\n    if (rest == 0) {\n        if (buffer_rest == 0)\n            EofDetected();\n        return;\n    }\n\n    ssize_t nbytes = read_to_buffer(fd, buffer, GetMaxRead());\n    if (nbytes == 0) {\n        if (rest == (off_t)-1) {\n            rest = 0;\n            if (buffer_rest == 0)\n                EofDetected();\n        } else {\n            GError *error =\n                g_error_new(g_file_error_quark(), 0,\n                            \"premature end of file in '%s'\", path);\n            Abort(error);\n        }\n        return;\n    } else if (nbytes == -1) {\n        GError *error =\n            g_error_new(errno_quark(), errno,\n                        \"failed to read from '%s': %s\",\n                        path, strerror(errno));\n        Abort(error);\n        return;\n    } else if (nbytes > 0 && rest != (off_t)-1) {\n        rest -= (off_t)nbytes;\n        assert(rest >= 0);\n    }\n\n    assert(!buffer.IsEmpty());\n\n    buffer_rest = SubmitBuffer();\n    if (buffer_rest == 0 && rest == 0)\n        EofDetected();\n}\n\ninline void\nFileIstream::TryDirect()\n{\n    \/* first consume the rest of the buffer *\/\n    if (SubmitBuffer() > 0)\n        return;\n\n    if (rest == 0) {\n        EofDetected();\n        return;\n    }\n\n    ssize_t nbytes = InvokeDirect(fd_type, fd, GetMaxRead());\n    if (nbytes == ISTREAM_RESULT_CLOSED)\n        \/* this stream was closed during the direct() callback *\/\n        return;\n\n    if (nbytes > 0 || nbytes == ISTREAM_RESULT_BLOCKING) {\n        \/* -2 means the callback wasn't able to consume any data right\n           now *\/\n        if (nbytes > 0 && rest != (off_t)-1) {\n            rest -= (off_t)nbytes;\n            assert(rest >= 0);\n            if (rest == 0)\n                EofDetected();\n        }\n    } else if (nbytes == ISTREAM_RESULT_EOF) {\n        if (rest == (off_t)-1) {\n            EofDetected();\n        } else {\n            GError *error =\n                g_error_new(g_file_error_quark(), 0,\n                            \"premature end of file in '%s'\", path);\n            Abort(error);\n        }\n    } else if (errno == EAGAIN) {\n        \/* this should only happen for splice(SPLICE_F_NONBLOCK) from\n           NFS files - unfortunately we cannot use EV_READ here, so we\n           just install a timer which retries after 100ms *\/\n\n        event.Add(file_retry_timeout);\n    } else {\n        \/* XXX *\/\n        GError *error =\n            g_error_new(errno_quark(), errno,\n                        \"failed to read from '%s': %s\",\n                        path, strerror(errno));\n        Abort(error);\n    }\n}\n\n\/*\n * istream implementation\n *\n *\/\n\noff_t\nFileIstream::GetAvailable(bool partial)\n{\n    off_t available;\n    if (rest != (off_t)-1)\n        available = rest;\n    else if (!partial)\n        return (off_t)-1;\n    else\n        available = 0;\n\n    available += buffer.GetAvailable();\n    return available;\n}\n\noff_t\nFileIstream::Skip(off_t length)\n{\n    event.Delete();\n\n    if (rest == (off_t)-1)\n        return (off_t)-1;\n\n    if (length == 0)\n        return 0;\n\n    \/* clear the buffer; later we could optimize this function by\n       flushing only the skipped number of bytes *\/\n    buffer.Clear();\n\n    if (length >= rest) {\n        \/* skip beyond EOF *\/\n\n        length = rest;\n        rest = 0;\n    } else {\n        \/* seek the file descriptor *\/\n\n        off_t ret = lseek(fd, length, SEEK_CUR);\n        if (ret < 0)\n            return -1;\n        rest -= length;\n    }\n\n    return length;\n}\n\nint\nFileIstream::AsFd()\n{\n    int result_fd = fd;\n\n    event.Delete();\n    Destroy();\n\n    return result_fd;\n}\n\n\/*\n * constructor and public methods\n *\n *\/\n\nstruct istream *\nistream_file_fd_new(struct pool *pool, const char *path,\n                    int fd, FdType fd_type, off_t length)\n{\n    assert(fd >= 0);\n    assert(length >= -1);\n\n    return NewIstream<FileIstream>(*pool, fd, fd_type, length, path);\n}\n\nstruct istream *\nistream_file_stat_new(struct pool *pool, const char *path, struct stat *st,\n                      GError **error_r)\n{\n    assert(path != nullptr);\n    assert(st != nullptr);\n\n    int fd = open_cloexec(path, O_RDONLY|O_NOCTTY, 0);\n    if (fd < 0) {\n        set_error_errno(error_r);\n        g_prefix_error(error_r, \"Failed to open %s: \", path);\n        return nullptr;\n    }\n\n    if (fstat(fd, st) < 0) {\n        set_error_errno(error_r);\n        g_prefix_error(error_r, \"Failed to stat %s: \", path);\n        close(fd);\n        return nullptr;\n    }\n\n    FdType fd_type = FdType::FD_FILE;\n    off_t size = st->st_size;\n\n    if (S_ISCHR(st->st_mode)) {\n        fd_type = FdType::FD_CHARDEV;\n        size = -1;\n    }\n\n    return istream_file_fd_new(pool, path, fd, fd_type, size);\n}\n\nstruct istream *\nistream_file_new(struct pool *pool, const char *path, off_t length,\n                 GError **error_r)\n{\n    assert(length >= -1);\n\n    int fd = open_cloexec(path, O_RDONLY|O_NOCTTY, 0);\n    if (fd < 0) {\n        set_error_errno(error_r);\n        g_prefix_error(error_r, \"Failed to open %s: \", path);\n        return nullptr;\n    }\n\n    return istream_file_fd_new(pool, path, fd, FdType::FD_FILE, length);\n}\n\nint\nistream_file_fd(struct istream *istream)\n{\n    assert(istream != nullptr);\n\n    auto &file = FileIstream::Cast2(*istream);\n    assert(file.fd >= 0);\n    return file.fd;\n}\n\nbool\nistream_file_set_range(struct istream *istream, off_t start, off_t end)\n{\n    assert(istream != nullptr);\n    assert(start >= 0);\n    assert(end >= start);\n\n    auto &file = FileIstream::Cast2(*istream);\n    assert(file.fd >= 0);\n    assert(file.rest >= 0);\n    assert(file.buffer.IsNull());\n    assert(end <= file.rest);\n\n    if (start > 0 && lseek(file.fd, start, SEEK_CUR) < 0)\n        return false;\n\n    file.rest = end - start;\n    return true;\n}\n<commit_msg>istream_file: fix Skip() implementation<commit_after>\/*\n * Asynchronous local file access.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_file.hxx\"\n#include \"istream_buffer.hxx\"\n#include \"istream_oo.hxx\"\n#include \"buffered_io.hxx\"\n#include \"system\/fd_util.h\"\n#include \"gerrno.h\"\n#include \"pool.hxx\"\n#include \"fb_pool.hxx\"\n#include \"SliceFifoBuffer.hxx\"\n#include \"event\/Event.hxx\"\n#include \"event\/Callback.hxx\"\n\n#include <assert.h>\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#include <limits.h>\n\n\/**\n * If EAGAIN occurs (on NFS), we try again after 100ms.  We can't\n * check EV_READ, because the kernel always indicates VFS files as\n * \"readable without blocking\".\n *\/\nstatic const struct timeval file_retry_timeout = {\n    .tv_sec = 0,\n    .tv_usec = 100000,\n};\n\nstruct FileIstream final : public Istream {\n    int fd;\n\n    FdType fd_type;\n\n    \/**\n     * A timer to retry reading after EAGAIN.\n     *\/\n    Event event;\n\n    off_t rest;\n    SliceFifoBuffer buffer;\n    const char *path;\n\n    FileIstream(struct pool &p, int _fd, FdType _fd_type, off_t _length,\n                const char *_path)\n        :Istream(p),\n         fd(_fd), fd_type(_fd_type), rest(_length),\n         path(_path) {\n        event.SetTimer(MakeSimpleEventCallback(FileIstream, EventCallback),\n                       this);\n    }\n\n    static FileIstream &Cast2(struct istream &i) {\n        return (FileIstream &)Istream::Cast(i);\n    }\n\n    void CloseHandle() {\n        if (fd < 0)\n            return;\n\n        event.Delete();\n\n        close(fd);\n        fd = -1;\n\n        buffer.FreeIfDefined(fb_pool_get());\n    }\n\n    void Abort(GError *error) {\n        CloseHandle();\n        DestroyError(error);\n    }\n\n    \/**\n     * @return the number of bytes still in the buffer\n     *\/\n    size_t SubmitBuffer() {\n        return ConsumeFromBuffer(buffer);\n    }\n\n    void EofDetected() {\n        assert(fd >= 0);\n\n        CloseHandle();\n        DestroyEof();\n    }\n\n    gcc_pure\n    size_t GetMaxRead() const {\n        if (rest != (off_t)-1 && rest < (off_t)INT_MAX)\n            return (size_t)rest;\n        else\n            return INT_MAX;\n    }\n\n    void TryData();\n    void TryDirect();\n\n    void TryRead() {\n        if (CheckDirect(fd_type))\n            TryDirect();\n        else\n            TryData();\n    }\n\n    void EventCallback() {\n        TryRead();\n    }\n\n    \/* virtual methods from class Istream *\/\n\n    off_t GetAvailable(bool partial) override;\n    off_t Skip(gcc_unused off_t length) override;\n\n    void Read() override {\n        event.Delete();\n        TryRead();\n    }\n\n    int AsFd() override;\n    void Close() override {\n        CloseHandle();\n        Destroy();\n    }\n};\n\ninline void\nFileIstream::TryData()\n{\n    size_t buffer_rest = 0;\n\n    if (buffer.IsNull()) {\n        if (rest != 0)\n            buffer.Allocate(fb_pool_get());\n    } else {\n        const size_t available = buffer.GetAvailable();\n        if (available > 0) {\n            buffer_rest = SubmitBuffer();\n            if (buffer_rest == available)\n                \/* not a single byte was consumed: we may have been\n                   closed, and we must bail out now *\/\n                return;\n        }\n    }\n\n    if (rest == 0) {\n        if (buffer_rest == 0)\n            EofDetected();\n        return;\n    }\n\n    ssize_t nbytes = read_to_buffer(fd, buffer, GetMaxRead());\n    if (nbytes == 0) {\n        if (rest == (off_t)-1) {\n            rest = 0;\n            if (buffer_rest == 0)\n                EofDetected();\n        } else {\n            GError *error =\n                g_error_new(g_file_error_quark(), 0,\n                            \"premature end of file in '%s'\", path);\n            Abort(error);\n        }\n        return;\n    } else if (nbytes == -1) {\n        GError *error =\n            g_error_new(errno_quark(), errno,\n                        \"failed to read from '%s': %s\",\n                        path, strerror(errno));\n        Abort(error);\n        return;\n    } else if (nbytes > 0 && rest != (off_t)-1) {\n        rest -= (off_t)nbytes;\n        assert(rest >= 0);\n    }\n\n    assert(!buffer.IsEmpty());\n\n    buffer_rest = SubmitBuffer();\n    if (buffer_rest == 0 && rest == 0)\n        EofDetected();\n}\n\ninline void\nFileIstream::TryDirect()\n{\n    \/* first consume the rest of the buffer *\/\n    if (SubmitBuffer() > 0)\n        return;\n\n    if (rest == 0) {\n        EofDetected();\n        return;\n    }\n\n    ssize_t nbytes = InvokeDirect(fd_type, fd, GetMaxRead());\n    if (nbytes == ISTREAM_RESULT_CLOSED)\n        \/* this stream was closed during the direct() callback *\/\n        return;\n\n    if (nbytes > 0 || nbytes == ISTREAM_RESULT_BLOCKING) {\n        \/* -2 means the callback wasn't able to consume any data right\n           now *\/\n        if (nbytes > 0 && rest != (off_t)-1) {\n            rest -= (off_t)nbytes;\n            assert(rest >= 0);\n            if (rest == 0)\n                EofDetected();\n        }\n    } else if (nbytes == ISTREAM_RESULT_EOF) {\n        if (rest == (off_t)-1) {\n            EofDetected();\n        } else {\n            GError *error =\n                g_error_new(g_file_error_quark(), 0,\n                            \"premature end of file in '%s'\", path);\n            Abort(error);\n        }\n    } else if (errno == EAGAIN) {\n        \/* this should only happen for splice(SPLICE_F_NONBLOCK) from\n           NFS files - unfortunately we cannot use EV_READ here, so we\n           just install a timer which retries after 100ms *\/\n\n        event.Add(file_retry_timeout);\n    } else {\n        \/* XXX *\/\n        GError *error =\n            g_error_new(errno_quark(), errno,\n                        \"failed to read from '%s': %s\",\n                        path, strerror(errno));\n        Abort(error);\n    }\n}\n\n\/*\n * istream implementation\n *\n *\/\n\noff_t\nFileIstream::GetAvailable(bool partial)\n{\n    off_t available;\n    if (rest != (off_t)-1)\n        available = rest;\n    else if (!partial)\n        return (off_t)-1;\n    else\n        available = 0;\n\n    available += buffer.GetAvailable();\n    return available;\n}\n\noff_t\nFileIstream::Skip(off_t length)\n{\n    event.Delete();\n\n    if (rest == (off_t)-1)\n        return (off_t)-1;\n\n    if (length == 0)\n        return 0;\n\n    const size_t buffer_available = buffer.GetAvailable();\n    if (length < off_t(buffer_available)) {\n        buffer.Consume(length);\n        return length;\n    }\n\n    length -= buffer_available;\n    buffer.Clear();\n\n    if (length >= rest) {\n        \/* skip beyond EOF *\/\n\n        length = rest;\n        rest = 0;\n    } else {\n        \/* seek the file descriptor *\/\n\n        off_t ret = lseek(fd, length, SEEK_CUR);\n        if (ret < 0)\n            return -1;\n        rest -= length;\n    }\n\n    return buffer_available + length;\n}\n\nint\nFileIstream::AsFd()\n{\n    int result_fd = fd;\n\n    event.Delete();\n    Destroy();\n\n    return result_fd;\n}\n\n\/*\n * constructor and public methods\n *\n *\/\n\nstruct istream *\nistream_file_fd_new(struct pool *pool, const char *path,\n                    int fd, FdType fd_type, off_t length)\n{\n    assert(fd >= 0);\n    assert(length >= -1);\n\n    return NewIstream<FileIstream>(*pool, fd, fd_type, length, path);\n}\n\nstruct istream *\nistream_file_stat_new(struct pool *pool, const char *path, struct stat *st,\n                      GError **error_r)\n{\n    assert(path != nullptr);\n    assert(st != nullptr);\n\n    int fd = open_cloexec(path, O_RDONLY|O_NOCTTY, 0);\n    if (fd < 0) {\n        set_error_errno(error_r);\n        g_prefix_error(error_r, \"Failed to open %s: \", path);\n        return nullptr;\n    }\n\n    if (fstat(fd, st) < 0) {\n        set_error_errno(error_r);\n        g_prefix_error(error_r, \"Failed to stat %s: \", path);\n        close(fd);\n        return nullptr;\n    }\n\n    FdType fd_type = FdType::FD_FILE;\n    off_t size = st->st_size;\n\n    if (S_ISCHR(st->st_mode)) {\n        fd_type = FdType::FD_CHARDEV;\n        size = -1;\n    }\n\n    return istream_file_fd_new(pool, path, fd, fd_type, size);\n}\n\nstruct istream *\nistream_file_new(struct pool *pool, const char *path, off_t length,\n                 GError **error_r)\n{\n    assert(length >= -1);\n\n    int fd = open_cloexec(path, O_RDONLY|O_NOCTTY, 0);\n    if (fd < 0) {\n        set_error_errno(error_r);\n        g_prefix_error(error_r, \"Failed to open %s: \", path);\n        return nullptr;\n    }\n\n    return istream_file_fd_new(pool, path, fd, FdType::FD_FILE, length);\n}\n\nint\nistream_file_fd(struct istream *istream)\n{\n    assert(istream != nullptr);\n\n    auto &file = FileIstream::Cast2(*istream);\n    assert(file.fd >= 0);\n    return file.fd;\n}\n\nbool\nistream_file_set_range(struct istream *istream, off_t start, off_t end)\n{\n    assert(istream != nullptr);\n    assert(start >= 0);\n    assert(end >= start);\n\n    auto &file = FileIstream::Cast2(*istream);\n    assert(file.fd >= 0);\n    assert(file.rest >= 0);\n    assert(file.buffer.IsNull());\n    assert(end <= file.rest);\n\n    if (start > 0 && lseek(file.fd, start, SEEK_CUR) < 0)\n        return false;\n\n    file.rest = end - start;\n    return true;\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\tassert(o->m_refs >= 0);\n\tassert(o != 0);\n\t++o->m_refs;\n}\n\nvoid intrusive_ptr_release(observer const* o)\n{\n\tassert(o->m_refs > 0);\n\tassert(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.ordered_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\tassert(m_oldest_transaction_id >= 0);\n\tassert(m_oldest_transaction_id < max_transactions);\n\tassert(m_next_transaction_id >= 0);\n\tassert(m_next_transaction_id < max_transactions);\n\tassert(!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\tassert(!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\tassert(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\tassert(m_oldest_transaction_id >= 0);\n\t\tassert(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\tassert(m_oldest_transaction_id == m_next_transaction_id);\n\t}\n\tassert(!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\tassert(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\tassert(!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\tassert(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\tassert(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\tassert(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\tassert(!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>DHT optimization by using unordered free instead of ordered free on the pool<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\tassert(o->m_refs >= 0);\n\tassert(o != 0);\n\t++o->m_refs;\n}\n\nvoid intrusive_ptr_release(observer const* o)\n{\n\tassert(o->m_refs > 0);\n\tassert(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\tassert(m_oldest_transaction_id >= 0);\n\tassert(m_oldest_transaction_id < max_transactions);\n\tassert(m_next_transaction_id >= 0);\n\tassert(m_next_transaction_id < max_transactions);\n\tassert(!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\tassert(!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\tassert(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\tassert(m_oldest_transaction_id >= 0);\n\t\tassert(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\tassert(m_oldest_transaction_id == m_next_transaction_id);\n\t}\n\tassert(!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\tassert(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\tassert(!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\tassert(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\tassert(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\tassert(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\tassert(!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>\/******************************************************************************\n** Copyright (c) 2014-2015, Intel Corporation                                **\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** 3. Neither the name of the copyright holder 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** HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,    **\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED  **\n** TO, 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\/* Hans Pabst (Intel Corp.)\n******************************************************************************\/\n#if defined(LIBXSTREAM_EXPORTED) || defined(__LIBXSTREAM)\n#include \"libxstream_workqueue.hpp\"\n#include \"libxstream_workitem.hpp\"\n\n#include <libxstream_begin.h>\n#include <algorithm>\n#include <cstdio>\n#if defined(LIBXSTREAM_STDFEATURES)\n# include <atomic>\n#endif\n#include <libxstream_end.h>\n\n\nvoid libxstream_workqueue::entry_type::push(libxstream_workitem& workitem)\n{\n  delete m_dangling;\n  const bool async = 0 == (LIBXSTREAM_CALL_WAIT & workitem.flags());\n  const bool enone = 0 == (LIBXSTREAM_CALL_ERROR & workitem.flags());\n  libxstream_workitem *const item = async ? workitem.clone() : &workitem;\n  m_status = enone ? LIBXSTREAM_ERROR_NONE : LIBXSTREAM_ERROR_CONDITION;\n  m_dangling = async ? item : 0;\n  m_item = item;\n}\n\n\nint libxstream_workqueue::entry_type::wait() const\n{\n#if defined(LIBXSTREAM_SLEEP_CLIENT)\n  size_t cycle = 0;\n  while (0 != m_item) this_thread_wait(cycle);\n#else\n  while (0 != m_item) this_thread_yield();\n#endif\n  const int result = m_status;\n  m_status = LIBXSTREAM_ERROR_NONE;\n  LIBXSTREAM_ASSERT(LIBXSTREAM_ERROR_NONE == result);\n  return result;\n}\n\n\nvoid libxstream_workqueue::entry_type::execute()\n{\n  (*m_item)(*this);\n}\n\n\nvoid libxstream_workqueue::entry_type::pop()\n{\n  m_item = 0;\n  LIBXSTREAM_ASSERT(0 != m_queue);\n  m_queue->pop();\n}\n\n\nlibxstream_workqueue::libxstream_workqueue()\n  : m_index(0)\n#if defined(LIBXSTREAM_STDFEATURES)\n  , m_size(new std::atomic<size_t>(0))\n#else\n  , m_size(new size_t(0))\n#endif\n{\n  std::fill_n(m_buffer, LIBXSTREAM_MAX_QSIZE, entry_type(this, 0));\n}\n\n\nlibxstream_workqueue::~libxstream_workqueue()\n{\n#if defined(LIBXSTREAM_DEBUG)\n  size_t pending = 0;\n  for (size_t i = 0; i < LIBXSTREAM_MAX_QSIZE; ++i) {\n    pending += (0 == m_buffer[i].item()) ? 0 : 1;\n    delete m_buffer[i].dangling();\n  }\n  if (0 < pending) {\n    LIBXSTREAM_PRINT(1, \"%lu work item%s pending!\", static_cast<unsigned long>(pending), 1 < pending ? \"s are\" : \" is\");\n  }\n#endif\n#if defined(LIBXSTREAM_STDFEATURES)\n  delete static_cast<std::atomic<size_t>*>(m_size);\n#else\n  delete static_cast<size_t*>(m_size);\n#endif\n}\n\n\nsize_t libxstream_workqueue::size() const\n{\n  const size_t index = m_index;\n#if defined(LIBXSTREAM_STDFEATURES)\n  const size_t offset = *static_cast<const std::atomic<size_t>*>(m_size);\n#else\n  const size_t offset = *static_cast<const size_t*>(m_size);\n#endif\n  const entry_type& entry = m_buffer[LIBXSTREAM_MOD(index, LIBXSTREAM_MAX_QSIZE)];\n  return 0 != entry.item() ? (offset - index) : (std::max<size_t>(offset - index, 1) - 1);\n}\n\n\nlibxstream_workqueue::entry_type& libxstream_workqueue::allocate_entry_mt()\n{\n  entry_type* result = 0;\n#if defined(LIBXSTREAM_STDFEATURES)\n  result = m_buffer + LIBXSTREAM_MOD((*static_cast<std::atomic<size_t>*>(m_size))++, LIBXSTREAM_MAX_QSIZE);\n#elif defined(_OPENMP)\n  size_t size1 = 0;\n  size_t& size = *static_cast<size_t*>(m_size);\n# if (201107 <= _OPENMP)\n#   pragma omp atomic capture\n# else\n#   pragma omp critical\n# endif\n  size1 = ++size;\n  result = m_buffer + LIBXSTREAM_MOD(size1 - 1, LIBXSTREAM_MAX_QSIZE);\n#else \/\/ generic\n  size_t& size = *static_cast<size_t*>(m_size);\n  libxstream_lock *const lock = libxstream_lock_get(this);\n  libxstream_lock_acquire(lock);\n  result = m_buffer + LIBXSTREAM_MOD(size++, LIBXSTREAM_MAX_QSIZE);\n  libxstream_lock_release(lock);\n#endif\n  LIBXSTREAM_ASSERT(0 != result && result->queue() == this);\n\n  if (0 != result->item()) {\n    LIBXSTREAM_PRINT0(1, \"queuing work is stalled!\");\n    do { \/\/ stall if capacity is exceeded\n      this_thread_sleep();\n    }\n    while (0 != result->item());\n  }\n\n  return *result;\n}\n\n\nlibxstream_workqueue::entry_type& libxstream_workqueue::allocate_entry()\n{\n  entry_type* result = 0;\n#if defined(LIBXSTREAM_STDFEATURES)\n  result = m_buffer + LIBXSTREAM_MOD(static_cast<std::atomic<size_t>*>(m_size)->fetch_add(1, std::memory_order_relaxed), LIBXSTREAM_MAX_QSIZE);\n#else\n  size_t& size = *static_cast<size_t*>(m_size);\n  result = m_buffer + LIBXSTREAM_MOD(size++, LIBXSTREAM_MAX_QSIZE);\n#endif\n  LIBXSTREAM_ASSERT(0 != result && result->queue() == this);\n\n  if (0 != result->item()) {\n    LIBXSTREAM_PRINT0(1, \"queuing work is stalled!\");\n    do { \/\/ stall if capacity is exceeded\n      this_thread_sleep();\n    }\n    while (0 != result->item());\n  }\n\n  return *result;\n}\n\n#endif \/\/ defined(LIBXSTREAM_EXPORTED) || defined(__LIBXSTREAM)\n<commit_msg>Introduced assertion.<commit_after>\/******************************************************************************\n** Copyright (c) 2014-2015, Intel Corporation                                **\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** 3. Neither the name of the copyright holder 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** HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,    **\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED  **\n** TO, 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\/* Hans Pabst (Intel Corp.)\n******************************************************************************\/\n#if defined(LIBXSTREAM_EXPORTED) || defined(__LIBXSTREAM)\n#include \"libxstream_workqueue.hpp\"\n#include \"libxstream_workitem.hpp\"\n\n#include <libxstream_begin.h>\n#include <algorithm>\n#include <cstdio>\n#if defined(LIBXSTREAM_STDFEATURES)\n# include <atomic>\n#endif\n#include <libxstream_end.h>\n\n\nvoid libxstream_workqueue::entry_type::push(libxstream_workitem& workitem)\n{\n  delete m_dangling;\n  const bool async = 0 == (LIBXSTREAM_CALL_WAIT & workitem.flags());\n  const bool enone = 0 == (LIBXSTREAM_CALL_ERROR & workitem.flags());\n  libxstream_workitem *const item = async ? workitem.clone() : &workitem;\n  m_status = enone ? LIBXSTREAM_ERROR_NONE : LIBXSTREAM_ERROR_CONDITION;\n  m_dangling = async ? item : 0;\n  m_item = item;\n}\n\n\nint libxstream_workqueue::entry_type::wait() const\n{\n#if defined(LIBXSTREAM_SLEEP_CLIENT)\n  size_t cycle = 0;\n  while (0 != m_item) this_thread_wait(cycle);\n#else\n  while (0 != m_item) this_thread_yield();\n#endif\n  const int result = m_status;\n  m_status = LIBXSTREAM_ERROR_NONE;\n  LIBXSTREAM_ASSERT(LIBXSTREAM_ERROR_NONE == result);\n  return result;\n}\n\n\nvoid libxstream_workqueue::entry_type::execute()\n{\n  LIBXSTREAM_ASSERT(0 != m_item && (m_item == m_dangling || 0 == m_dangling));\n  (*m_item)(*this);\n}\n\n\nvoid libxstream_workqueue::entry_type::pop()\n{\n  m_item = 0;\n  LIBXSTREAM_ASSERT(0 != m_queue);\n  m_queue->pop();\n}\n\n\nlibxstream_workqueue::libxstream_workqueue()\n  : m_index(0)\n#if defined(LIBXSTREAM_STDFEATURES)\n  , m_size(new std::atomic<size_t>(0))\n#else\n  , m_size(new size_t(0))\n#endif\n{\n  std::fill_n(m_buffer, LIBXSTREAM_MAX_QSIZE, entry_type(this, 0));\n}\n\n\nlibxstream_workqueue::~libxstream_workqueue()\n{\n#if defined(LIBXSTREAM_DEBUG)\n  size_t pending = 0;\n  for (size_t i = 0; i < LIBXSTREAM_MAX_QSIZE; ++i) {\n    pending += (0 == m_buffer[i].item()) ? 0 : 1;\n    delete m_buffer[i].dangling();\n  }\n  if (0 < pending) {\n    LIBXSTREAM_PRINT(1, \"%lu work item%s pending!\", static_cast<unsigned long>(pending), 1 < pending ? \"s are\" : \" is\");\n  }\n#endif\n#if defined(LIBXSTREAM_STDFEATURES)\n  delete static_cast<std::atomic<size_t>*>(m_size);\n#else\n  delete static_cast<size_t*>(m_size);\n#endif\n}\n\n\nsize_t libxstream_workqueue::size() const\n{\n  const size_t index = m_index;\n#if defined(LIBXSTREAM_STDFEATURES)\n  const size_t offset = *static_cast<const std::atomic<size_t>*>(m_size);\n#else\n  const size_t offset = *static_cast<const size_t*>(m_size);\n#endif\n  const entry_type& entry = m_buffer[LIBXSTREAM_MOD(index, LIBXSTREAM_MAX_QSIZE)];\n  return 0 != entry.item() ? (offset - index) : (std::max<size_t>(offset - index, 1) - 1);\n}\n\n\nlibxstream_workqueue::entry_type& libxstream_workqueue::allocate_entry_mt()\n{\n  entry_type* result = 0;\n#if defined(LIBXSTREAM_STDFEATURES)\n  result = m_buffer + LIBXSTREAM_MOD((*static_cast<std::atomic<size_t>*>(m_size))++, LIBXSTREAM_MAX_QSIZE);\n#elif defined(_OPENMP)\n  size_t size1 = 0;\n  size_t& size = *static_cast<size_t*>(m_size);\n# if (201107 <= _OPENMP)\n#   pragma omp atomic capture\n# else\n#   pragma omp critical\n# endif\n  size1 = ++size;\n  result = m_buffer + LIBXSTREAM_MOD(size1 - 1, LIBXSTREAM_MAX_QSIZE);\n#else \/\/ generic\n  size_t& size = *static_cast<size_t*>(m_size);\n  libxstream_lock *const lock = libxstream_lock_get(this);\n  libxstream_lock_acquire(lock);\n  result = m_buffer + LIBXSTREAM_MOD(size++, LIBXSTREAM_MAX_QSIZE);\n  libxstream_lock_release(lock);\n#endif\n  LIBXSTREAM_ASSERT(0 != result && result->queue() == this);\n\n  if (0 != result->item()) {\n    LIBXSTREAM_PRINT0(1, \"queuing work is stalled!\");\n    do { \/\/ stall if capacity is exceeded\n      this_thread_sleep();\n    }\n    while (0 != result->item());\n  }\n\n  return *result;\n}\n\n\nlibxstream_workqueue::entry_type& libxstream_workqueue::allocate_entry()\n{\n  entry_type* result = 0;\n#if defined(LIBXSTREAM_STDFEATURES)\n  result = m_buffer + LIBXSTREAM_MOD(static_cast<std::atomic<size_t>*>(m_size)->fetch_add(1, std::memory_order_relaxed), LIBXSTREAM_MAX_QSIZE);\n#else\n  size_t& size = *static_cast<size_t*>(m_size);\n  result = m_buffer + LIBXSTREAM_MOD(size++, LIBXSTREAM_MAX_QSIZE);\n#endif\n  LIBXSTREAM_ASSERT(0 != result && result->queue() == this);\n\n  if (0 != result->item()) {\n    LIBXSTREAM_PRINT0(1, \"queuing work is stalled!\");\n    do { \/\/ stall if capacity is exceeded\n      this_thread_sleep();\n    }\n    while (0 != result->item());\n  }\n\n  return *result;\n}\n\n#endif \/\/ defined(LIBXSTREAM_EXPORTED) || defined(__LIBXSTREAM)\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 \"qlandmarkid.h\"\n#include \"qlandmarkid_p.h\"\n#include <QString>\n\nQTM_USE_NAMESPACE\n\n\/*!\n    \\class QLandmarkId\n    \\ingroup location\n\n    \\brief The QLandmarkId class provides a unique identifier for\n    a category.\n\n    It consists of a manager URI which identifies the manager which contains\n    the category, and the id for that category.\n*\/\n\n\/*!\n\n    Creates an invalid identifier, id() and managerUri() will return null strings\n*\/\nQLandmarkId::QLandmarkId()\n    :d(new QLandmarkIdPrivate)\n{\n}\n\n\/*!\n    Constructs a copy of \\a other.\n*\/\nQLandmarkId::QLandmarkId(const QLandmarkId &other)\n    :d(other.d)\n{\n}\n\n\/*!\n    Destroys the identifier.\n*\/\nQLandmarkId::~QLandmarkId()\n{\n}\n\n\/*!\n    Returns true if the identifier is valid, meaning that both\n    a manager URI and id have been set\n*\/\nbool QLandmarkId::isValid() const\n{\n    return (!d->m_databaseName.isEmpty() && !d->m_id.isEmpty());\n}\n\n\/*!\n    Returns the id of the category identifier.\n*\/\nQString QLandmarkId::id() const\n{\n    return d->m_id;\n}\n\n\/*!\n    Sets the \\a id of the category identifier\n*\/\nvoid QLandmarkId::setId(const QString &id)\n{\n    d->m_id = id;\n}\n\n\/*!\n    Returns the URI of the manager which this category identifer\n    belongs to.\n*\/\nQString QLandmarkId::managerUri() const\n{\n    return d->m_databaseName;\n}\n\n\/*!\n    Sets the manager \\a uri which this category identifier\n    belongs to.\n*\/\nvoid QLandmarkId::setManagerUri(const QString &uri)\n{\n    d->m_databaseName = uri;\n}\n\n\/*!\n    Assigns \\a other to this category identifier and returns a reference\n    to this category identifier.\n*\/\nQLandmarkId &QLandmarkId::operator=(const QLandmarkId &other)\n{\n    d = other.d;\n    return *this;\n}\n\n\/*!\n    Returns true if this category identifer is equal to \\a other, otherwise\n    returns false.\n\n    Two QLandmarkIds are considered equal if both have the same\n    manager URI and id.\n*\/\nbool QLandmarkId::operator==(const QLandmarkId &other) const\n{\n    return ((d->m_id == other.d->m_id)\n            && (d->m_databaseName == other.d->m_databaseName));\n}\n\n\/*!\n    Returns true if this category identifier is not equal to \\a other,\n    otherwise returns false.\n\n    If either the manager URIs or ids differ, then the\n    QLandmarkIds are not considered equal.\n*\/\nbool QLandmarkId::operator!=(const QLandmarkId &other) const\n{\n    return !this->operator ==(other);\n}\n\n\n<commit_msg>fix qlandmarkid docs.<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 \"qlandmarkid.h\"\n#include \"qlandmarkid_p.h\"\n#include <QString>\n\nQTM_USE_NAMESPACE\n\n\/*!\n    \\class QLandmarkId\n    \\ingroup location\n\n    \\brief The QLandmarkId class provides a unique identifier for\n    a landmark.\n\n    It consists of a manager URI which identifies the manager which contains\n    the landmark, and a manager specific id for that landmark.\n*\/\n\n\/*!\n\n    Creates an invalid identifier.\n\n     id() and managerUri() will return null strings\n*\/\nQLandmarkId::QLandmarkId()\n    :d(new QLandmarkIdPrivate)\n{\n}\n\n\/*!\n    Constructs a copy of \\a other.\n*\/\nQLandmarkId::QLandmarkId(const QLandmarkId &other)\n    :d(other.d)\n{\n}\n\n\/*!\n    Destroys the identifier.\n*\/\nQLandmarkId::~QLandmarkId()\n{\n}\n\n\/*!\n    Returns true if the identifier is valid, meaning that both\n    a manager URI and id have been set.\n*\/\nbool QLandmarkId::isValid() const\n{\n    return (!d->m_databaseName.isEmpty() && !d->m_id.isEmpty());\n}\n\n\/*!\n    Returns the id of the landmark identifier.\n\n    This id is specific to a particular landmark manager.\n*\/\nQString QLandmarkId::id() const\n{\n    return d->m_id;\n}\n\n\/*!\n    Sets the \\a id of the landmark identifier.\n*\/\nvoid QLandmarkId::setId(const QString &id)\n{\n    d->m_id = id;\n}\n\n\/*!\n    Returns the URI of the manager which this landmark identifer\n    belongs to.\n*\/\nQString QLandmarkId::managerUri() const\n{\n    return d->m_databaseName;\n}\n\n\/*!\n    Sets the manager \\a uri which this landmark identifier\n    belongs to.\n*\/\nvoid QLandmarkId::setManagerUri(const QString &uri)\n{\n    d->m_databaseName = uri;\n}\n\n\/*!\n    Assigns \\a other to this landmark identifier and returns a reference\n    to this landmark identifier.\n*\/\nQLandmarkId &QLandmarkId::operator=(const QLandmarkId &other)\n{\n    d = other.d;\n    return *this;\n}\n\n\/*!\n    Returns true if this landmark identifer is equal to \\a other, otherwise\n    returns false.\n\n    Two QLandmarkIds are considered equal if both have the same\n    manager URI and id.\n\n    \\sa operator!=()\n*\/\nbool QLandmarkId::operator==(const QLandmarkId &other) const\n{\n    return ((d->m_id == other.d->m_id)\n            && (d->m_databaseName == other.d->m_databaseName));\n}\n\n\/*!\n    Returns true if this landmark identifier is not equal to \\a other,\n    otherwise returns false.\n\n    If either the manager URIs or ids differ, then the\n    QLandmarkIds are not considered equal.\n\n    \\sa operator==()\n*\/\nbool QLandmarkId::operator!=(const QLandmarkId &other) const\n{\n    return !this->operator ==(other);\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 \"logjoin\/LogJoinUpload.h\"\n#include \"fnord-base\/uri.h\"\n#include \"fnord-base\/util\/binarymessagewriter.h\"\n#include \"fnord-http\/httprequest.h\"\n\nusing namespace fnord;\n\nnamespace cm {\n\nLogJoinUpload::LogJoinUpload(\n    RefPtr<mdb::MDB> db,\n    const String& feedserver_url,\n    http::HTTPConnectionPool* http) :\n    db_(db),\n    feedserver_url_(feedserver_url),\n    http_(http),\n    batch_size_(kDefaultBatchSize) {}\n\nvoid LogJoinUpload::upload() {\n  while (scanQueue(\"__uploadq-sessions\") > 0);\n}\n\nsize_t LogJoinUpload::scanQueue(const String& queue_name) {\n  auto txn = db_->startTransaction();\n  auto cursor = txn->getCursor();\n\n  Buffer key;\n  Buffer value;\n  bool eof = false;\n  Vector<Buffer> batch;\n  for (int i = 0; i < batch_size_ && !eof; ++i) {\n    if (i == 0) {\n      key.append(queue_name);\n      eof = !cursor->getFirstOrGreater(&key, &value);\n    } else {\n      eof = !cursor->getNext(&key, &value);\n    }\n\n    if (!StringUtil::beginsWith(key.toString(), queue_name)) {\n      eof = true;\n    }\n\n    if (!eof) {\n      batch.emplace_back(value);\n      txn->del(key);\n    }\n  }\n\n  cursor->close();\n\n  try {\n    if (batch.size() > 0) {\n      uploadBatch(queue_name, batch);\n    }\n  } catch (...) {\n    txn->abort();\n    throw;\n  }\n\n  txn->commit();\n\n  return batch.size();\n}\n\nvoid LogJoinUpload::uploadBatch(\n    const String& queue_name,\n    const Vector<Buffer>& batch) {\n  URI uri(feedserver_url_ + \"\/tsdb\/insert_batch?stream=joined_sessions.dawanda\");\n\n  http::HTTPRequest req(http::HTTPMessage::M_POST, uri.pathAndQuery());\n  req.addHeader(\"Host\", uri.hostAndPort());\n  req.addHeader(\"Content-Type\", \"application\/fnord-msg\");\n\n  util::BinaryMessageWriter body;\n  for (const auto& b : batch) {\n    body.append(b.data(), b.size());\n  }\n\n  req.addBody(body.data(), body.size());\n\n  auto res = http_->executeRequest(req);\n  res.wait();\n\n  const auto& r = res.get();\n  if (r.statusCode() != 201) {\n    RAISEF(kRuntimeError, \"received non-201 response: $0\", r.body().toString());\n  }\n}\n\n} \/\/ namespace cm\n\n<commit_msg>use mdb_cursor_del as mdb_del has some kind of bug<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 \"logjoin\/LogJoinUpload.h\"\n#include \"fnord-base\/uri.h\"\n#include \"fnord-base\/util\/binarymessagewriter.h\"\n#include \"fnord-http\/httprequest.h\"\n\nusing namespace fnord;\n\nnamespace cm {\n\nLogJoinUpload::LogJoinUpload(\n    RefPtr<mdb::MDB> db,\n    const String& feedserver_url,\n    http::HTTPConnectionPool* http) :\n    db_(db),\n    feedserver_url_(feedserver_url),\n    http_(http),\n    batch_size_(kDefaultBatchSize) {}\n\nvoid LogJoinUpload::upload() {\n  while (scanQueue(\"__uploadq-sessions\") > 0);\n}\n\nsize_t LogJoinUpload::scanQueue(const String& queue_name) {\n  auto txn = db_->startTransaction();\n  auto cursor = txn->getCursor();\n\n  Buffer key;\n  Buffer value;\n  Vector<Buffer> batch;\n  for (int i = 0; i < batch_size_; ++i) {\n    if (i == 0) {\n      key.append(queue_name);\n\n      if (!cursor->getFirstOrGreater(&key, &value)) {\n        break;\n      }\n    } else {\n      if (!cursor->getNext(&key, &value)) {\n        break;\n      }\n    }\n\n    if (!StringUtil::beginsWith(key.toString(), queue_name)) {\n      break;\n    }\n\n    batch.emplace_back(value);\n    cursor->del();\n  }\n\n  cursor->close();\n\n  try {\n    if (batch.size() > 0) {\n      uploadBatch(queue_name, batch);\n    }\n  } catch (...) {\n    txn->abort();\n    throw;\n  }\n\n  txn->commit();\n\n  return batch.size();\n}\n\nvoid LogJoinUpload::uploadBatch(\n    const String& queue_name,\n    const Vector<Buffer>& batch) {\n  URI uri(feedserver_url_ + \"\/tsdb\/insert_batch?stream=joined_sessions.dawanda\");\n\n  http::HTTPRequest req(http::HTTPMessage::M_POST, uri.pathAndQuery());\n  req.addHeader(\"Host\", uri.hostAndPort());\n  req.addHeader(\"Content-Type\", \"application\/fnord-msg\");\n\n  util::BinaryMessageWriter body;\n  for (const auto& b : batch) {\n    body.append(b.data(), b.size());\n  }\n\n  req.addBody(body.data(), body.size());\n\n  auto res = http_->executeRequest(req);\n  res.wait();\n\n  const auto& r = res.get();\n  if (r.statusCode() != 201) {\n    RAISEF(kRuntimeError, \"received non-201 response: $0\", r.body().toString());\n  }\n}\n\n} \/\/ namespace cm\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"lxc_isolation_module.hpp\"\n\n#include <algorithm>\n\n#include \"foreach.hpp\"\n\nusing std::cerr;\nusing std::cout;\nusing std::endl;\nusing std::list;\nusing std::make_pair;\nusing std::max;\nusing std::ostringstream;\nusing std::pair;\nusing std::queue;\nusing std::string;\nusing std::vector;\n\nusing boost::lexical_cast;\nusing boost::unordered_map;\nusing boost::unordered_set;\n\nusing namespace nexus;\nusing namespace nexus::internal;\nusing namespace nexus::internal::slave;\n\n\nLxcIsolationModule::LxcIsolationModule(Slave* slave)\n{\n  this->slave = slave;\n  reaper = new Reaper(this);\n  Process::spawn(reaper);\n}\n\n\nLxcIsolationModule::~LxcIsolationModule()\n{\n  \/\/ We want to wait until the reaper has completed because it\n  \/\/ accesses 'this' in order to make callbacks ... deleting 'this'\n  \/\/ could thus lead to a seg fault!\n  Process::post(reaper->getPID(), SHUTDOWN_REAPER);\n  Process::wait(reaper);\n  delete reaper;\n}\n\n\nvoid LxcIsolationModule::frameworkAdded(Framework* framework)\n{\n  lxcExecutePid[framework->id] = -1;\n  container[framework->id] = \"\";\n  framework->executorStatus = \"No executor running\";\n}\n\n\nvoid LxcIsolationModule::frameworkRemoved(Framework *framework)\n{\n  lxcExecutePid.erase(framework->id);\n  container.erase(framework->id);\n}\n\n\nvoid LxcIsolationModule::startExecutor(Framework *fw)\n{\n  LOG(INFO) << \"Starting executor for framework \" << fw->id << \": \"\n            << fw->executorInfo.uri;\n  CHECK(lxcExecutePid[fw->id] == -1 && container[fw->id] == \"\");\n\n  \/\/ Get location of Nexus install in order to find nexus-launcher.\n  const char *nexusHome = getenv(\"NEXUS_HOME\");\n  if (!nexusHome)\n    nexusHome = \"..\";\n  string nexusLauncher = string(nexusHome) + \"\/src\/nexus-launcher\";\n\n  \/\/ Create a name for the container\n  ostringstream oss;\n  oss << \"nexus.slave-\" << slave->id << \".framework-\" << fw->id;\n  string containerName = oss.str();\n\n  container[fw->id] = containerName;\n  fw->executorStatus = \"Container: \" + containerName;\n\n  \/\/ Run lxc-execute nexus-launcher using a fork-exec (since lxc-execute\n  \/\/ does not return until the container is finished). Note that lxc-execute\n  \/\/ automatically creates the container and will delete it when finished.\n  pid_t pid;\n  if ((pid = fork()) == -1)\n    PLOG(FATAL) << \"Failed to fork to launch lxc-execute\";\n\n  if (pid) {\n    \/\/ In parent process\n    lxcExecutePid[fw->id] = pid;\n    LOG(INFO) << \"Started lxc-execute, pid = \" << pid;\n    int status;\n  } else {\n    \/\/ Set up environment variables.\n    setenv(\"NEXUS_FRAMEWORK_ID\", lexical_cast<string>(fw->id).c_str(), 1);\n    setenv(\"NEXUS_EXECUTOR_URI\", fw->executorInfo.uri.c_str(), 1);\n    setenv(\"NEXUS_USER\", fw->user.c_str(), 1);\n    setenv(\"NEXUS_SLAVE_PID\", lexical_cast<string>(slave->self()).c_str(), 1);\n    setenv(\"NEXUS_REDIRECT_IO\", slave->local ? \"1\" : \"0\", 1);\n    setenv(\"NEXUS_WORK_DIRECTORY\", slave->getWorkDirectory(fw->id).c_str(), 1);\n\n    \/\/ Run lxc-execute.\n    execlp(\"lxc-execute\", \"lxc-execute\", \"-n\", containerName.c_str(),\n           nexusLauncher.c_str(), (char *) NULL);\n    \/\/ If we get here, the execl call failed.\n    fatalerror(\"Could not exec lxc-execute\");\n    \/\/ TODO: Exit the slave if this happens\n  }\n}\n\n\nvoid LxcIsolationModule::killExecutor(Framework* fw)\n{\n  if (container[fw->id] != \"\") {\n    LOG(INFO) << \"Stopping container \" << container[fw->id];\n    int ret = shell(\"lxc-stop -n %s\", container[fw->id].c_str());\n    if (ret != 0)\n      LOG(ERROR) << \"lxc-stop returned \" << ret;\n    container[fw->id] = \"\";\n    fw->executorStatus = \"No executor running\";\n  }\n}\n\n\nvoid LxcIsolationModule::resourcesChanged(Framework* fw)\n{\n  if (container[fw->id] != \"\") {\n    \/\/ For now, just try setting the CPUs and mem right away.\n    \/\/ A slightly smarter thing might be to only update them periodically.\n    int ret;\n    \n    int32_t cpuShares = max(1024 * fw->resources.cpus, 10);\n    LOG(INFO) << \"Setting CPU shares for \" << fw->id << \" to \" << cpuShares;\n    ret = shell(\"lxc-cgroup -n %s cpu.shares %d\",\n                container[fw->id].c_str(), cpuShares);\n    if (ret != 0)\n      LOG(ERROR) << \"lxc-cgroup returned \" << ret;\n\n    int64_t rssLimit = max(fw->resources.mem, 128 * Megabyte);\n    LOG(INFO) << \"Setting RSS limit for \" << fw->id << \" to \" << rssLimit;\n    ret = shell(\"lxc-cgroup -n %s memory.limit_in_bytes %lld\",\n                container[fw->id].c_str(), rssLimit);\n    if (ret != 0)\n      LOG(ERROR) << \"lxc-cgroup returned \" << ret;\n    \n    \/\/ TODO: Decreasing the RSS limit will fail if the current RSS is too\n    \/\/ large and memory can't be swapped out. In that case, we should\n    \/\/ either freeze the container before changing RSS, or just kill it.\n  }\n}\n\n\nint LxcIsolationModule::shell(const char* fmt, ...)\n{\n  char *cmd;\n  FILE *f;\n  int ret;\n  va_list args;\n  va_start(args, fmt);\n  if (vasprintf(&cmd, fmt, args) == -1)\n    return -1;\n  if ((f = popen(cmd, \"w\")) == NULL)\n    return -1;\n  ret = pclose(f);\n  if (ret == -1)\n    LOG(INFO) << \"pclose error: \" << strerror(errno);\n  free(cmd);\n  va_end(args);\n  return ret;\n}\n\n\nLxcIsolationModule::Reaper::Reaper(LxcIsolationModule* m)\n  : module(m)\n{}\n\n  \nvoid LxcIsolationModule::Reaper::operator () ()\n{\n  pause(1); \/\/ HACK(matei)\n  link(module->slave->getPID());\n  while (true) {\n    switch (receive(1)) {\n    case PROCESS_TIMEOUT: {\n      \/\/ Check whether any child process has exited\n      pid_t pid;\n      int status;\n      if ((pid = waitpid((pid_t) -1, &status, WNOHANG)) > 0) {\n\tforeachpair (FrameworkID fid, pid_t& fwPid, module->lxcExecutePid) {\n\t  if (fwPid == pid) {\n\t    module->container[fid] = \"\";\n\t    module->lxcExecutePid[fid] = -1;\n\t    LOG(INFO) << \"Telling slave of lost framework \" << fid;\n\t    module->slave->executorExited(fid, status);\n\t    break;\n\t  }\n\t}\n      }\n    }\n    case SHUTDOWN_REAPER:\n    case PROCESS_EXIT:\n      return;\n    }\n  }\n}\n<commit_msg>Revert non-working fix<commit_after>#include \"lxc_isolation_module.hpp\"\n\n#include <algorithm>\n\n#include \"foreach.hpp\"\n\nusing std::cerr;\nusing std::cout;\nusing std::endl;\nusing std::list;\nusing std::make_pair;\nusing std::max;\nusing std::ostringstream;\nusing std::pair;\nusing std::queue;\nusing std::string;\nusing std::vector;\n\nusing boost::lexical_cast;\nusing boost::unordered_map;\nusing boost::unordered_set;\n\nusing namespace nexus;\nusing namespace nexus::internal;\nusing namespace nexus::internal::slave;\n\n\nLxcIsolationModule::LxcIsolationModule(Slave* slave)\n{\n  this->slave = slave;\n  reaper = new Reaper(this);\n  Process::spawn(reaper);\n}\n\n\nLxcIsolationModule::~LxcIsolationModule()\n{\n  \/\/ We want to wait until the reaper has completed because it\n  \/\/ accesses 'this' in order to make callbacks ... deleting 'this'\n  \/\/ could thus lead to a seg fault!\n  Process::post(reaper->getPID(), SHUTDOWN_REAPER);\n  Process::wait(reaper);\n  delete reaper;\n}\n\n\nvoid LxcIsolationModule::frameworkAdded(Framework* framework)\n{\n  lxcExecutePid[framework->id] = -1;\n  container[framework->id] = \"\";\n  framework->executorStatus = \"No executor running\";\n}\n\n\nvoid LxcIsolationModule::frameworkRemoved(Framework *framework)\n{\n  lxcExecutePid.erase(framework->id);\n  container.erase(framework->id);\n}\n\n\nvoid LxcIsolationModule::startExecutor(Framework *fw)\n{\n  LOG(INFO) << \"Starting executor for framework \" << fw->id << \": \"\n            << fw->executorInfo.uri;\n  CHECK(lxcExecutePid[fw->id] == -1 && container[fw->id] == \"\");\n\n  \/\/ Get location of Nexus install in order to find nexus-launcher.\n  const char *nexusHome = getenv(\"NEXUS_HOME\");\n  if (!nexusHome)\n    nexusHome = \"..\";\n  string nexusLauncher = string(nexusHome) + \"\/src\/nexus-launcher\";\n\n  \/\/ Create a name for the container\n  ostringstream oss;\n  oss << \"nexus.slave-\" << slave->id << \".framework-\" << fw->id;\n  string containerName = oss.str();\n\n  container[fw->id] = containerName;\n  fw->executorStatus = \"Container: \" + containerName;\n\n  \/\/ Run lxc-execute nexus-launcher using a fork-exec (since lxc-execute\n  \/\/ does not return until the container is finished). Note that lxc-execute\n  \/\/ automatically creates the container and will delete it when finished.\n  pid_t pid;\n  if ((pid = fork()) == -1)\n    PLOG(FATAL) << \"Failed to fork to launch lxc-execute\";\n\n  if (pid) {\n    \/\/ In parent process\n    lxcExecutePid[fw->id] = pid;\n    LOG(INFO) << \"Started lxc-execute, pid = \" << pid;\n    int status;\n  } else {\n    \/\/ Set up environment variables.\n    setenv(\"NEXUS_FRAMEWORK_ID\", lexical_cast<string>(fw->id).c_str(), 1);\n    setenv(\"NEXUS_EXECUTOR_URI\", fw->executorInfo.uri.c_str(), 1);\n    setenv(\"NEXUS_USER\", fw->user.c_str(), 1);\n    setenv(\"NEXUS_SLAVE_PID\", lexical_cast<string>(slave->self()).c_str(), 1);\n    setenv(\"NEXUS_REDIRECT_IO\", slave->local ? \"1\" : \"0\", 1);\n    setenv(\"NEXUS_WORK_DIRECTORY\", slave->getWorkDirectory(fw->id).c_str(), 1);\n\n    \/\/ Run lxc-execute.\n    execlp(\"lxc-execute\", \"lxc-execute\", \"-n\", containerName.c_str(),\n           nexusLauncher.c_str(), (char *) NULL);\n    \/\/ If we get here, the execl call failed.\n    fatalerror(\"Could not exec lxc-execute\");\n    \/\/ TODO: Exit the slave if this happens\n  }\n}\n\n\nvoid LxcIsolationModule::killExecutor(Framework* fw)\n{\n  if (container[fw->id] != \"\") {\n    LOG(INFO) << \"Stopping container \" << container[fw->id];\n    int ret = shell(\"lxc-stop -n %s\", container[fw->id].c_str());\n    if (ret != 0)\n      LOG(ERROR) << \"lxc-stop returned \" << ret;\n    container[fw->id] = \"\";\n    fw->executorStatus = \"No executor running\";\n  }\n}\n\n\nvoid LxcIsolationModule::resourcesChanged(Framework* fw)\n{\n  if (container[fw->id] != \"\") {\n    \/\/ For now, just try setting the CPUs and mem right away.\n    \/\/ A slightly smarter thing might be to only update them periodically.\n    int ret;\n    \n    int32_t cpuShares = max(1024 * fw->resources.cpus, 10);\n    LOG(INFO) << \"Setting CPU shares for \" << fw->id << \" to \" << cpuShares;\n    ret = shell(\"lxc-cgroup -n %s cpu.shares %d\",\n                container[fw->id].c_str(), cpuShares);\n    if (ret != 0)\n      LOG(ERROR) << \"lxc-cgroup returned \" << ret;\n\n    int64_t rssLimit = max(fw->resources.mem, 128 * Megabyte);\n    LOG(INFO) << \"Setting RSS limit for \" << fw->id << \" to \" << rssLimit;\n    ret = shell(\"lxc-cgroup -n %s memory.limit_in_bytes %lld\",\n                container[fw->id].c_str(), rssLimit);\n    if (ret != 0)\n      LOG(ERROR) << \"lxc-cgroup returned \" << ret;\n    \n    \/\/ TODO: Decreasing the RSS limit will fail if the current RSS is too\n    \/\/ large and memory can't be swapped out. In that case, we should\n    \/\/ either freeze the container before changing RSS, or just kill it.\n  }\n}\n\n\nint LxcIsolationModule::shell(const char* fmt, ...)\n{\n  char *cmd;\n  FILE *f;\n  int ret;\n  va_list args;\n  va_start(args, fmt);\n  if (vasprintf(&cmd, fmt, args) == -1)\n    return -1;\n  if ((f = popen(cmd, \"w\")) == NULL)\n    return -1;\n  ret = pclose(f);\n  if (ret == -1)\n    LOG(INFO) << \"pclose error: \" << strerror(errno);\n  free(cmd);\n  va_end(args);\n  return ret;\n}\n\n\nLxcIsolationModule::Reaper::Reaper(LxcIsolationModule* m)\n  : module(m)\n{}\n\n  \nvoid LxcIsolationModule::Reaper::operator () ()\n{\n  link(module->slave->getPID());\n  while (true) {\n    switch (receive(1)) {\n    case PROCESS_TIMEOUT: {\n      \/\/ Check whether any child process has exited\n      pid_t pid;\n      int status;\n      if ((pid = waitpid((pid_t) -1, &status, WNOHANG)) > 0) {\n\tforeachpair (FrameworkID fid, pid_t& fwPid, module->lxcExecutePid) {\n\t  if (fwPid == pid) {\n\t    module->container[fid] = \"\";\n\t    module->lxcExecutePid[fid] = -1;\n\t    LOG(INFO) << \"Telling slave of lost framework \" << fid;\n\t    module->slave->executorExited(fid, status);\n\t    break;\n\t  }\n\t}\n      }\n    }\n    case SHUTDOWN_REAPER:\n    case PROCESS_EXIT:\n      return;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef INCLUDE_AL_GRAPHICS_SHADER_HPP\n#define INCLUDE_AL_GRAPHICS_SHADER_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\tWrappers to OpenGL GLSL shaders\n\n\tFile author(s):\n\tLance Putnam, 2010, putnam.lance@gmail.com\n\tGraham Wakefield, 2010, grrrwaaa@gmail.com\n\tWesley Smith, 2010, wesley.hoke@gmail.com\n*\/\n\n#include <string>\n#include <unordered_map>\n#include \"allocore\/graphics\/al_GPUObject.hpp\"\n#include \"allocore\/math\/al_Mat.hpp\"\n#include \"allocore\/math\/al_Quat.hpp\"\n#include \"allocore\/math\/al_Vec.hpp\"\n\n#define AL_SHADER_MAX_LOG_SIZE\t4096\n\nnamespace al{\n\n\/\/\/ Shader abstract base class\n\/\/\/ @ingroup allocore\nclass ShaderBase : public GPUObject{\npublic:\n\n\tvirtual ~ShaderBase(){}\n\n\t\/\/\/ Returns info log or 0 if none\n\tconst char * log() const;\n\n\t\/\/\/ Prints info log, if any\n\tvoid printLog() const;\n\nprotected:\n\tvirtual void get(int pname, void * params) const = 0;\n\tvirtual void getLog(char * buf) const = 0;\n};\n\n\n\n\/\/\/ Shader object\n\n\/\/\/ A shader object represents your source code. You are able to pass your\n\/\/\/ source code to a shader object and compile the shader object.\n\/\/\/ @ingroup allocore\nclass Shader : public ShaderBase{\npublic:\n\n\tenum Type {\n\t\tVERTEX,\n\t\tFRAGMENT,\n\t\tGEOMETRY\n\t};\n\n\tShader(const std::string& source=\"\", Shader::Type type=FRAGMENT);\n\n\t\/\/\/ This will automatically delete the shader object when it is no longer\n\t\/\/\/ attached to any program object.\n\tvirtual ~Shader(){ destroy(); }\n\n\tShader& source(const std::string& v);\n\tShader& source(const std::string& v, Shader::Type type);\n\tShader& compile();\n\tbool compiled() const;\n\n\tShader::Type type() const { return mType; }\n\nprivate:\n\tstd::string mSource;\n\tShader::Type mType;\n\tvoid sendSource();\n\n\tvirtual void get(int pname, void * params) const;\n\tvirtual void getLog(char * buf) const;\n\n\tvirtual void onCreate();\n\tvirtual void onDestroy();\n};\n\n\n\n\/\/\/ Shader program object\n\n\/\/\/ A program object represents a useable part of render pipeline.\n\/\/\/ It links one or more shader units into a single program object.\n\/\/\/ @ingroup allocore\nclass ShaderProgram : public ShaderBase{\npublic:\n\n\tShaderProgram();\n\n\t\/\/\/ Any attached shaders will automatically be detached, but not deleted.\n\tvirtual ~ShaderProgram();\n\n\n\t\/\/\/ Attach shader to program\n\n\t\/\/\/ The input shader will be compiled if necessary.\n\t\/\/\/\n\tShaderProgram& attach(Shader& s);\n\n\t\/\/\/ Detach shader from program\n\tconst ShaderProgram& detach(const Shader& s) const;\n\n\t\/\/\/ Link attached shaders\n\n\t\/\/\/ @param[in] doValidate\tvalidate program after linking;\n\t\/\/\/\t\tYou might not want to do this if you need to set uniforms before\n\t\/\/\/\t\tvalidating, e.g., when using different texture sampler types in the\n\t\/\/\/\t\tsame shader.\n\tconst ShaderProgram& link(bool doValidate=true) const;\n\n\n\t\/\/\/ Compile and link shader sources\n\n\t\/\/\/ If called outside of a graphics context, compiling and linking will\n\t\/\/\/ occur once the first time the shader is bound.\n\tbool compile(\n\t\tconst std::string& vertSource,\n\t\tconst std::string& fragSource,\n\t\tconst std::string& geomSource=\"\"\n\t);\n\n\n\tconst ShaderProgram& use();\n\n\t\/\/\/ Get whether program is active\n\tbool active() const { return mActive; }\n\n\t\/\/\/ Set whether program is active\n\tShaderProgram& active(bool v){ mActive=v; return *this; }\n\n\t\/\/\/ Toggle active state\n\tShaderProgram& toggleActive(){ mActive^=true; return *this; }\n\n\t\/\/\/ Begin use of shader program\n\tbool begin();\n\n\t\/\/\/ End use of shader program\n\tvoid end() const;\n\n\n\t\/\/\/ Returns whether program linked successfully\n\tbool linked() const;\n\n\t\/\/\/ Returns whether linked program can execute in current graphics state\n\tbool validateProgram(bool printLog=false) const;\n\n\n\t\/\/\/ Set parameters for geometry shader\n\n\t\/\/\/ @param[in] inPrim\tInput primitive to geometry shader\n\t\/\/\/ @param[in] outPrim\tOutput primitive from geometry shader\n\t\/\/\/ @param[in] outVert\tNumber of vertices output from geometry shader \n\t\/\/\/\t\t\t\t\t\t(note the number of input vertices is always 1)\n\t\/\/\/\n\t\/\/\/ This must be called before attaching the geometry shader.\n\t\/\/\/ For GLSL, the geometry shader must include the line:\n\t\/\/\/\t\t#extension GL_EXT_geometry_shader4 : enable\n\tShaderProgram& setGeometry(int inPrim, int outPrim, unsigned outVert){\n\t\tmInPrim=inPrim; mOutPrim=outPrim; mOutVertices=outVert; return *this;\n\t}\n\n\t\/\/ These parameters must be set before attaching geometry shaders\n\tShaderProgram& setGeometryInputPrimitive(int prim){ mInPrim = prim; return *this; }\n\tShaderProgram& setGeometryOutputPrimitive(int prim){ mOutPrim = prim; return *this; }\n\tShaderProgram& setGeometryOutputVertices(unsigned i){ mOutVertices = i; return *this; }\n\n\tstd::vector<std::string>& transformFeedbackVaryings(){ return mTFVaryings; }\n\tconst std::vector<std::string>& transformFeedbackVaryings() const { return mTFVaryings; }\n\n\t\/\/\/ Print out all the input parameters to the shader\n\tvoid listParams() const;\n\n\t\/\/\/ Get location of uniform\n\tint uniform(const char * name) const;\n\n\t\/\/\/ Get location of attribute\n\tint attribute(const char * name) const;\n\n\tconst ShaderProgram& uniform(const char * name, Color v) const {\n\t  return uniform(name, v[0], v[1], v[2], v[3]);\n\t}\n\n\tconst ShaderProgram& uniform(int loc, int v) const;\n\tconst ShaderProgram& uniform(int loc, float v) const;\n\tconst ShaderProgram& uniform(int loc, double v) const { return uniform(loc, float(v)); }\n\tconst ShaderProgram& uniform(int loc, float v0, float v1) const;\n\tconst ShaderProgram& uniform(int loc, float v0, float v1, float v2) const;\n\tconst ShaderProgram& uniform(int loc, float v0, float v1, float v2, float v3) const;\n\ttemplate <typename T>\n\tconst ShaderProgram& uniform(int loc, const Vec<2,T>& v) const {\n\t\treturn uniform(loc, v.x, v.y);\n\t}\n\ttemplate <typename T>\n\tconst ShaderProgram& uniform(int loc, const Vec<3,T>& v) const {\n\t\treturn uniform(loc, v.x, v.y, v.z);\n\t}\n\ttemplate <typename T>\n\tconst ShaderProgram& uniform(int loc, const Vec<4,T>& v) const {\n\t\treturn uniform(loc, v.x, v.y, v.z, v.w);\n\t}\n\tconst ShaderProgram& uniformMatrix3(int loc, const float * v, bool transpose=false) const;\n\tconst ShaderProgram& uniformMatrix4(int loc, const float * v, bool transpose=false) const;\n\tconst ShaderProgram& uniform(int loc, const Mat<4,float>& m) const{\n\t\treturn uniformMatrix4(loc, m.elems());\n\t}\n\ttemplate<typename T>\n\tconst ShaderProgram& uniform(int loc, const Mat<4,T>& m) const{\n\t\treturn uniform(loc, Mat4f(m));\n\t}\n\n\tconst ShaderProgram& uniform(const char * name, int v) const;\n\tconst ShaderProgram& uniform(const char * name, float v) const;\n\tconst ShaderProgram& uniform(const char * name, double v) const { return uniform(name, float(v)); }\n\tconst ShaderProgram& uniform(const char * name, float v0, float v1) const;\n\tconst ShaderProgram& uniform(const char * name, float v0, float v1, float v2) const;\n\tconst ShaderProgram& uniform(const char * name, float v0, float v1, float v2, float v3) const;\n\n\ttemplate <typename T>\n\tconst ShaderProgram& uniform(const char * name, const Vec<2,T>& v) const {\n\t\treturn uniform(name, v.x, v.y);\n\t}\n\n\ttemplate <typename T>\n\tconst ShaderProgram& uniform(const char * name, const Vec<3,T>& v) const {\n\t\treturn uniform(name, v.x, v.y, v.z);\n\t}\n\n\ttemplate <typename T>\n\tconst ShaderProgram& uniform(const char * name, const Vec<4,T>& v) const {\n\t\treturn uniform(name, v.x, v.y, v.z, v.w);\n\t}\n\n\tconst ShaderProgram& uniform(const char * name, const Mat<4,float>& m) const{\n\t\treturn uniformMatrix4(name, m.elems());\n\t}\n\n\ttemplate<typename T>\n\tconst ShaderProgram& uniform(const char * name, const Mat<4,T>& m) const{\n\t\treturn uniform(name, Mat4f(m));\n\t}\n\n\ttemplate <typename T>\n\tconst ShaderProgram& uniform(const char * name, const Quat<T>& q) const {\n\t\t\/\/ note wxyz => xyzw for GLSL vec4:\n\t\treturn uniform(name, q.x, q.y, q.z, q.w);\n\t}\n\n\n\tconst ShaderProgram& uniform1(const char * name, const float * v, int count=1) const;\n\tconst ShaderProgram& uniform2(const char * name, const float * v, int count=1) const;\n\tconst ShaderProgram& uniform3(const char * name, const float * v, int count=1) const;\n\tconst ShaderProgram& uniform4(const char * name, const float * v, int count=1) const;\n\n\tconst ShaderProgram& uniformMatrix3(const char * name, const float * v, bool transpose=false) const;\n\tconst ShaderProgram& uniformMatrix4(const char * name, const float * v, bool transpose=false) const;\n\n\n\tconst ShaderProgram& attribute(int loc, float v) const;\n\tconst ShaderProgram& attribute(int loc, float v0, float v1) const;\n\tconst ShaderProgram& attribute(int loc, float v0, float v1, float v2) const;\n\tconst ShaderProgram& attribute(int loc, float v0, float v1, float v2, float v3) const;\n\n\tconst ShaderProgram& attribute(const char * name, float v) const;\n\tconst ShaderProgram& attribute(const char * name, float v0, float v1) const;\n\tconst ShaderProgram& attribute(const char * name, float v0, float v1, float v2) const;\n\tconst ShaderProgram& attribute(const char * name, float v0, float v1, float v2, float v3) const;\n\n\tconst ShaderProgram& attribute1(const char * name, const float * v) const;\n\tconst ShaderProgram& attribute2(const char * name, const float * v) const;\n\tconst ShaderProgram& attribute3(const char * name, const float * v) const;\n\tconst ShaderProgram& attribute4(const char * name, const float * v) const;\n\tconst ShaderProgram& attribute1(int loc, const double * v) const;\n\tconst ShaderProgram& attribute2(int loc, const double * v) const;\n\tconst ShaderProgram& attribute3(int loc, const double * v) const;\n\tconst ShaderProgram& attribute4(int loc, const double * v) const;\n\n\ttemplate<typename T>\n\tconst ShaderProgram& attribute(int loc, const Vec<2,T>& v) const {\n\t\treturn attribute(loc, v.x, v.y);\n\t}\n\ttemplate<typename T>\n\tconst ShaderProgram& attribute(int loc, const Vec<3,T>& v) const {\n\t\treturn attribute(loc, v.x, v.y, v.z);\n\t}\n\ttemplate<typename T>\n\tconst ShaderProgram& attribute(int loc, const Vec<4,T>& v) const {\n\t\treturn attribute(loc, v.x, v.y, v.z, v.w);\n\t}\n\ttemplate<typename T>\n\tconst ShaderProgram& attribute(int loc, const Quat<T>& q) const {\n\t\t\/\/ note wxyz => xyzw for GLSL vec4:\n\t\treturn attribute(loc, q.x, q.y, q.z, q.w);\n\t}\n\n\n\n\tstatic void use(unsigned programID);\n\nprotected:\n\tint mInPrim, mOutPrim;\t\/\/ IO primitives for geometry shaders\n\tunsigned int mOutVertices;\n\tstd::string mVertSource, mFragSource, mGeomSource;\n\tmutable std::unordered_map<std::string, int> mUniformLocs, mAttribLocs;\n\tstd::vector<std::string> mTFVaryings;\n\tbool mActive;\n\n\tvirtual void get(int pname, void * params) const;\n\tvirtual void getLog(char * buf) const;\n\n\tvirtual void onCreate();\n\tvirtual void onDestroy();\n};\n\n} \/\/ ::al\n\n#endif\n<commit_msg>fix compile error: al_Shader.hpp:218:50: error: unknown type name \\'Color\\'; thanks to Sihwa Park<commit_after>#ifndef INCLUDE_AL_GRAPHICS_SHADER_HPP\n#define INCLUDE_AL_GRAPHICS_SHADER_HPP\n\n\/*\tAllocore --\n        Multimedia \/ virtual environment application class library\n\n        Copyright (C) 2009. AlloSphere Research Group, Media Arts & Technology,\n   UCSB. Copyright (C) 2012. The Regents of the University of California. All\n   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\n   copyright notice, this list of conditions and the following disclaimer in the\n                documentation and\/or other materials provided with the\n   distribution.\n\n                Neither the name of the University of California nor the names\n   of its 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\n   IS\" AND ANY 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 HOLDER 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 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        File description:\n        Wrappers to OpenGL GLSL shaders\n\n        File author(s):\n        Lance Putnam, 2010, putnam.lance@gmail.com\n        Graham Wakefield, 2010, grrrwaaa@gmail.com\n        Wesley Smith, 2010, wesley.hoke@gmail.com\n*\/\n\n#include <string>\n#include <unordered_map>\n#include \"allocore\/graphics\/al_GPUObject.hpp\"\n#include \"allocore\/math\/al_Mat.hpp\"\n#include \"allocore\/math\/al_Quat.hpp\"\n#include \"allocore\/math\/al_Vec.hpp\"\n#include \"allocore\/types\/al_Color.hpp\"\n\n#define AL_SHADER_MAX_LOG_SIZE 4096\n\nnamespace al {\n\n\/\/\/ Shader abstract base class\n\/\/\/ @ingroup allocore\nclass ShaderBase : public GPUObject {\n public:\n  virtual ~ShaderBase() {}\n\n  \/\/\/ Returns info log or 0 if none\n  const char* log() const;\n\n  \/\/\/ Prints info log, if any\n  void printLog() const;\n\n protected:\n  virtual void get(int pname, void* params) const = 0;\n  virtual void getLog(char* buf) const = 0;\n};\n\n\/\/\/ Shader object\n\n\/\/\/ A shader object represents your source code. You are able to pass your\n\/\/\/ source code to a shader object and compile the shader object.\n\/\/\/ @ingroup allocore\nclass Shader : public ShaderBase {\n public:\n  enum Type { VERTEX, FRAGMENT, GEOMETRY };\n\n  Shader(const std::string& source = \"\", Shader::Type type = FRAGMENT);\n\n  \/\/\/ This will automatically delete the shader object when it is no longer\n  \/\/\/ attached to any program object.\n  virtual ~Shader() { destroy(); }\n\n  Shader& source(const std::string& v);\n  Shader& source(const std::string& v, Shader::Type type);\n  Shader& compile();\n  bool compiled() const;\n\n  Shader::Type type() const { return mType; }\n\n private:\n  std::string mSource;\n  Shader::Type mType;\n  void sendSource();\n\n  virtual void get(int pname, void* params) const;\n  virtual void getLog(char* buf) const;\n\n  virtual void onCreate();\n  virtual void onDestroy();\n};\n\n\/\/\/ Shader program object\n\n\/\/\/ A program object represents a useable part of render pipeline.\n\/\/\/ It links one or more shader units into a single program object.\n\/\/\/ @ingroup allocore\nclass ShaderProgram : public ShaderBase {\n public:\n  ShaderProgram();\n\n  \/\/\/ Any attached shaders will automatically be detached, but not deleted.\n  virtual ~ShaderProgram();\n\n  \/\/\/ Attach shader to program\n\n  \/\/\/ The input shader will be compiled if necessary.\n  \/\/\/\n  ShaderProgram& attach(Shader& s);\n\n  \/\/\/ Detach shader from program\n  const ShaderProgram& detach(const Shader& s) const;\n\n  \/\/\/ Link attached shaders\n\n  \/\/\/ @param[in] doValidate\tvalidate program after linking;\n  \/\/\/\t\tYou might not want to do this if you need to set uniforms before\n  \/\/\/\t\tvalidating, e.g., when using different texture sampler types in\n  \/\/\/the \t\tsame shader.\n  const ShaderProgram& link(bool doValidate = true) const;\n\n  \/\/\/ Compile and link shader sources\n\n  \/\/\/ If called outside of a graphics context, compiling and linking will\n  \/\/\/ occur once the first time the shader is bound.\n  bool compile(const std::string& vertSource, const std::string& fragSource,\n               const std::string& geomSource = \"\");\n\n  const ShaderProgram& use();\n\n  \/\/\/ Get whether program is active\n  bool active() const { return mActive; }\n\n  \/\/\/ Set whether program is active\n  ShaderProgram& active(bool v) {\n    mActive = v;\n    return *this;\n  }\n\n  \/\/\/ Toggle active state\n  ShaderProgram& toggleActive() {\n    mActive ^= true;\n    return *this;\n  }\n\n  \/\/\/ Begin use of shader program\n  bool begin();\n\n  \/\/\/ End use of shader program\n  void end() const;\n\n  \/\/\/ Returns whether program linked successfully\n  bool linked() const;\n\n  \/\/\/ Returns whether linked program can execute in current graphics state\n  bool validateProgram(bool printLog = false) const;\n\n  \/\/\/ Set parameters for geometry shader\n\n  \/\/\/ @param[in] inPrim\tInput primitive to geometry shader\n  \/\/\/ @param[in] outPrim\tOutput primitive from geometry shader\n  \/\/\/ @param[in] outVert\tNumber of vertices output from geometry shader\n  \/\/\/\t\t\t\t\t\t(note the number of input vertices is always\n  \/\/\/1)\n  \/\/\/\n  \/\/\/ This must be called before attaching the geometry shader.\n  \/\/\/ For GLSL, the geometry shader must include the line:\n  \/\/\/\t\t#extension GL_EXT_geometry_shader4 : enable\n  ShaderProgram& setGeometry(int inPrim, int outPrim, unsigned outVert) {\n    mInPrim = inPrim;\n    mOutPrim = outPrim;\n    mOutVertices = outVert;\n    return *this;\n  }\n\n  \/\/ These parameters must be set before attaching geometry shaders\n  ShaderProgram& setGeometryInputPrimitive(int prim) {\n    mInPrim = prim;\n    return *this;\n  }\n  ShaderProgram& setGeometryOutputPrimitive(int prim) {\n    mOutPrim = prim;\n    return *this;\n  }\n  ShaderProgram& setGeometryOutputVertices(unsigned i) {\n    mOutVertices = i;\n    return *this;\n  }\n\n  std::vector<std::string>& transformFeedbackVaryings() { return mTFVaryings; }\n  const std::vector<std::string>& transformFeedbackVaryings() const {\n    return mTFVaryings;\n  }\n\n  \/\/\/ Print out all the input parameters to the shader\n  void listParams() const;\n\n  \/\/\/ Get location of uniform\n  int uniform(const char* name) const;\n\n  \/\/\/ Get location of attribute\n  int attribute(const char* name) const;\n\n  const ShaderProgram& uniform(const char* name, Color v) const {\n    return uniform(name, v[0], v[1], v[2], v[3]);\n  }\n\n  const ShaderProgram& uniform(int loc, int v) const;\n  const ShaderProgram& uniform(int loc, float v) const;\n  const ShaderProgram& uniform(int loc, double v) const {\n    return uniform(loc, float(v));\n  }\n  const ShaderProgram& uniform(int loc, float v0, float v1) const;\n  const ShaderProgram& uniform(int loc, float v0, float v1, float v2) const;\n  const ShaderProgram& uniform(int loc, float v0, float v1, float v2,\n                               float v3) const;\n  template <typename T>\n  const ShaderProgram& uniform(int loc, const Vec<2, T>& v) const {\n    return uniform(loc, v.x, v.y);\n  }\n  template <typename T>\n  const ShaderProgram& uniform(int loc, const Vec<3, T>& v) const {\n    return uniform(loc, v.x, v.y, v.z);\n  }\n  template <typename T>\n  const ShaderProgram& uniform(int loc, const Vec<4, T>& v) const {\n    return uniform(loc, v.x, v.y, v.z, v.w);\n  }\n  const ShaderProgram& uniformMatrix3(int loc, const float* v,\n                                      bool transpose = false) const;\n  const ShaderProgram& uniformMatrix4(int loc, const float* v,\n                                      bool transpose = false) const;\n  const ShaderProgram& uniform(int loc, const Mat<4, float>& m) const {\n    return uniformMatrix4(loc, m.elems());\n  }\n  template <typename T>\n  const ShaderProgram& uniform(int loc, const Mat<4, T>& m) const {\n    return uniform(loc, Mat4f(m));\n  }\n\n  const ShaderProgram& uniform(const char* name, int v) const;\n  const ShaderProgram& uniform(const char* name, float v) const;\n  const ShaderProgram& uniform(const char* name, double v) const {\n    return uniform(name, float(v));\n  }\n  const ShaderProgram& uniform(const char* name, float v0, float v1) const;\n  const ShaderProgram& uniform(const char* name, float v0, float v1,\n                               float v2) const;\n  const ShaderProgram& uniform(const char* name, float v0, float v1, float v2,\n                               float v3) const;\n\n  template <typename T>\n  const ShaderProgram& uniform(const char* name, const Vec<2, T>& v) const {\n    return uniform(name, v.x, v.y);\n  }\n\n  template <typename T>\n  const ShaderProgram& uniform(const char* name, const Vec<3, T>& v) const {\n    return uniform(name, v.x, v.y, v.z);\n  }\n\n  template <typename T>\n  const ShaderProgram& uniform(const char* name, const Vec<4, T>& v) const {\n    return uniform(name, v.x, v.y, v.z, v.w);\n  }\n\n  const ShaderProgram& uniform(const char* name, const Mat<4, float>& m) const {\n    return uniformMatrix4(name, m.elems());\n  }\n\n  template <typename T>\n  const ShaderProgram& uniform(const char* name, const Mat<4, T>& m) const {\n    return uniform(name, Mat4f(m));\n  }\n\n  template <typename T>\n  const ShaderProgram& uniform(const char* name, const Quat<T>& q) const {\n    \/\/ note wxyz => xyzw for GLSL vec4:\n    return uniform(name, q.x, q.y, q.z, q.w);\n  }\n\n  const ShaderProgram& uniform1(const char* name, const float* v,\n                                int count = 1) const;\n  const ShaderProgram& uniform2(const char* name, const float* v,\n                                int count = 1) const;\n  const ShaderProgram& uniform3(const char* name, const float* v,\n                                int count = 1) const;\n  const ShaderProgram& uniform4(const char* name, const float* v,\n                                int count = 1) const;\n\n  const ShaderProgram& uniformMatrix3(const char* name, const float* v,\n                                      bool transpose = false) const;\n  const ShaderProgram& uniformMatrix4(const char* name, const float* v,\n                                      bool transpose = false) const;\n\n  const ShaderProgram& attribute(int loc, float v) const;\n  const ShaderProgram& attribute(int loc, float v0, float v1) const;\n  const ShaderProgram& attribute(int loc, float v0, float v1, float v2) const;\n  const ShaderProgram& attribute(int loc, float v0, float v1, float v2,\n                                 float v3) const;\n\n  const ShaderProgram& attribute(const char* name, float v) const;\n  const ShaderProgram& attribute(const char* name, float v0, float v1) const;\n  const ShaderProgram& attribute(const char* name, float v0, float v1,\n                                 float v2) const;\n  const ShaderProgram& attribute(const char* name, float v0, float v1, float v2,\n                                 float v3) const;\n\n  const ShaderProgram& attribute1(const char* name, const float* v) const;\n  const ShaderProgram& attribute2(const char* name, const float* v) const;\n  const ShaderProgram& attribute3(const char* name, const float* v) const;\n  const ShaderProgram& attribute4(const char* name, const float* v) const;\n  const ShaderProgram& attribute1(int loc, const double* v) const;\n  const ShaderProgram& attribute2(int loc, const double* v) const;\n  const ShaderProgram& attribute3(int loc, const double* v) const;\n  const ShaderProgram& attribute4(int loc, const double* v) const;\n\n  template <typename T>\n  const ShaderProgram& attribute(int loc, const Vec<2, T>& v) const {\n    return attribute(loc, v.x, v.y);\n  }\n  template <typename T>\n  const ShaderProgram& attribute(int loc, const Vec<3, T>& v) const {\n    return attribute(loc, v.x, v.y, v.z);\n  }\n  template <typename T>\n  const ShaderProgram& attribute(int loc, const Vec<4, T>& v) const {\n    return attribute(loc, v.x, v.y, v.z, v.w);\n  }\n  template <typename T>\n  const ShaderProgram& attribute(int loc, const Quat<T>& q) const {\n    \/\/ note wxyz => xyzw for GLSL vec4:\n    return attribute(loc, q.x, q.y, q.z, q.w);\n  }\n\n  static void use(unsigned programID);\n\n protected:\n  int mInPrim, mOutPrim;  \/\/ IO primitives for geometry shaders\n  unsigned int mOutVertices;\n  std::string mVertSource, mFragSource, mGeomSource;\n  mutable std::unordered_map<std::string, int> mUniformLocs, mAttribLocs;\n  std::vector<std::string> mTFVaryings;\n  bool mActive;\n\n  virtual void get(int pname, void* params) const;\n  virtual void getLog(char* buf) const;\n\n  virtual void onCreate();\n  virtual void onDestroy();\n};\n\n}  \/\/ namespace al\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n#include <gmock\/gmock.h>\n#include <rapidcheck\/gtest.h>\n\n#include <crest\/geometry\/indexed_mesh.hpp>\n#include <crest\/geometry\/refinement.hpp>\n#include <crest\/basis\/lagrange_basis2d.hpp>\n#include <crest\/basis\/homogenized_basis.hpp>\n\n#include <crest\/util\/algorithms.hpp>\n\n#include <util\/eigen_matchers.hpp>\n#include <util\/test_generators.hpp>\n\n#include <Eigen\/Sparse>\n#include <Eigen\/Dense>\n\nusing ::testing::ElementsAreArray;\nusing ::testing::Pointwise;\nusing ::testing::Eq;\nusing ::testing::DoubleEq;\nusing ::testing::Lt;\nusing ::testing::Each;\n\nusing crest::IndexedMesh;\nusing crest::LagrangeBasis2d;\n\ntypedef IndexedMesh<double, int>::Vertex Vertex;\ntypedef IndexedMesh<double, int>::Element Element;\n\nTEST(homogenized_basis_test, correctors_are_in_interpolator_kernel_for_threshold_fine_mesh)\n{\n    \/\/ Recall that by definition, I_H c = 0, for any corrector with weights c.\n    const std::vector<Vertex> coarse_vertices {\n            Vertex(0.0, 0.0),\n            Vertex(1.0, 0.0),\n            Vertex(1.0, 1.0),\n            Vertex(0.0, 1.0)\n    };\n\n    const std::vector<Element> coarse_elements {\n            Element({3, 0, 1}),\n            Element({1, 2, 3})\n    };\n\n    const auto initial_mesh = IndexedMesh<double, int>(coarse_vertices, coarse_elements);\n\n    const auto two_scale_meshes = crest::threshold(initial_mesh, 0.5,\n                                                   { crest::ReentrantCorner<double, int>(0, 2.35)});\n\n    const auto basis = crest::detail::homogenized_basis_correctors(two_scale_meshes.coarse,\n                                                                   two_scale_meshes.fine,\n                                                                   4);\n\n    ASSERT_THAT(basis.rows(), Eq(two_scale_meshes.coarse.num_vertices()));\n    ASSERT_THAT(basis.cols(), Eq(two_scale_meshes.fine.num_vertices()));\n\n    const auto coarse_interior = two_scale_meshes.coarse.compute_interior_vertices();\n    const auto fine_dof = crest::algo::integer_range<int>(0, two_scale_meshes.fine.num_vertices());\n\n    const auto I_H = crest::quasi_interpolator(two_scale_meshes.coarse, two_scale_meshes.fine);\n    \/\/ We need to test with the coarse interior, because the matrix returned by quasi_interpolator\n    \/\/ does not impose that I_H x = 0 on the boundary.\n    const auto I_H_interior = sparse_submatrix(I_H, coarse_interior, fine_dof);\n\n    \/\/ Recall that each row of 'basis' corresponds to weights in the fine space, so by transposing it and\n    \/\/ left-multiplying by I_H, we effectively compute I_H x_i for each basis function i.\n    \/\/ Since x_i is in the kernel of I_H, we expect the result to be zero.\n    const Eigen::SparseMatrix<double> Z = I_H_interior * basis.transpose();\n    const Eigen::MatrixXd Z_dense = Z;\n\n    EXPECT_TRUE(Z_dense.isZero(1e-15));\n}\n\nTEST(construct_saddle_point_problem_test, blockwise_correct)\n{\n    MatrixX<double> A(5, 5);\n    A.setZero();\n    A(0, 0) = 1.0;\n    A(1, 1) = 2.0;\n    A(2, 2) = 3.0;\n    A(3, 3) = 4.0;\n    A(4, 4) = 5.0;\n\n    MatrixX<double> I_H(3, 5);\n    I_H.setZero();\n    I_H(0, 0) = 6.0;\n    I_H(1, 1) = 7.0;\n    I_H(2, 2) = 8.0;\n\n    VectorX<double> b(5);\n    b.setZero();\n    b(0) = 1.0;\n    b(1) = 2.0;\n    b(2) = 3.0;\n    b(3) = 4.0;\n    b(4) = 5.0;\n\n    const Eigen::SparseMatrix<double> A_sparse = A.sparseView();\n    const Eigen::SparseMatrix<double> I_H_sparse = I_H.sparseView();\n\n    const auto saddle_point = crest::detail::construct_saddle_point_problem(A_sparse, I_H_sparse, b);\n    const MatrixX<double> C = saddle_point.first;\n    const VectorX<double> c = saddle_point.second;\n\n    ASSERT_THAT(C.rows(), 8);\n    ASSERT_THAT(C.cols(), 8);\n    ASSERT_THAT(c.rows(), 8);\n\n    const MatrixX<double> bottomRightCorner = C.bottomRightCorner(3, 3);\n    const auto bottomRightCornerElements = std::vector<double>(bottomRightCorner.data(), bottomRightCorner.data() + 9);\n\n    \/\/ TODO: The current MatrixEq is not entirely reliable, I think. Improve!\n    EXPECT_THAT(C.topLeftCorner(5, 5), MatrixEq(A));\n    EXPECT_THAT(C.bottomLeftCorner(3, 5), MatrixEq(I_H));\n    EXPECT_THAT(C.topRightCorner(5, 3), MatrixEq(I_H.transpose()));\n    EXPECT_THAT(bottomRightCornerElements, Each(DoubleEq(0.0)));\n\n    EXPECT_THAT(c.topRows(5), MatrixEq(b));\n    EXPECT_THAT(c.bottomRows(3)(0), DoubleEq(0.0));\n    EXPECT_THAT(c.bottomRows(3)(1), DoubleEq(0.0));\n    EXPECT_THAT(c.bottomRows(3)(2), DoubleEq(0.0));\n}\n\nRC_GTEST_PROP(homogenized_basis_test, correctors_are_in_interpolator_kernel, ())\n{\n    const auto oversampling = *rc::gen::arbitrary<unsigned int>();\n    const auto coarse_mesh = *crest::gen::arbitrary_unit_square_mesh(4);\n\n    \/\/ Make sure the fine mesh does not coincide with the coarse mesh\n    const auto fine_mesh = *rc::gen::suchThat(crest::gen::arbitrary_refinement(coarse_mesh, 1, 4),\n                                              [coarse_mesh] (auto mesh)\n                                              {\n                                                  return mesh.num_elements() != coarse_mesh.num_elements();\n                                              });\n\n    const auto basis = crest::detail::homogenized_basis_correctors(coarse_mesh, fine_mesh, oversampling);\n\n    ASSERT_THAT(basis.rows(), Eq(coarse_mesh.num_vertices()));\n    ASSERT_THAT(basis.cols(), Eq(fine_mesh.num_vertices()));\n\n    const auto coarse_interior = coarse_mesh.compute_interior_vertices();\n    const auto fine_dof = crest::algo::integer_range<int>(0, fine_mesh.num_vertices());\n\n    const auto I_H = crest::quasi_interpolator(coarse_mesh, fine_mesh);\n\n    \/\/ We need to test with the coarse interior, because the matrix returned by quasi_interpolator\n    \/\/ does not impose that I_H x = 0 on the boundary.\n    const auto I_H_interior = sparse_submatrix(I_H, coarse_interior, fine_dof);\n\n    \/\/ Recall that each row of 'basis' corresponds to weights in the fine space, so by transposing it and\n    \/\/ left-multiplying by I_H, we effectively compute I_H x_i for each basis function i.\n    \/\/ Since x_i is in the kernel of I_H, we expect the result to be zero.\n    const Eigen::SparseMatrix<double> Z = I_H_interior * basis.transpose();\n    const Eigen::MatrixXd Z_dense = Z;\n\n    RC_ASSERT(Z_dense.isZero(1e-14));\n}\n\nRC_GTEST_PROP(homogenized_basis_test, correctors_are_zero_with_no_refinement, ())\n{\n    const auto oversampling = static_cast<unsigned int>(*rc::gen::inRange(0, 6));\n    const auto mesh = *crest::gen::arbitrary_unit_square_mesh();\n    const auto basis = crest::detail::homogenized_basis_correctors(mesh, mesh, oversampling);\n\n    ASSERT_THAT(basis.rows(), Eq(mesh.num_vertices()));\n    ASSERT_THAT(basis.cols(), Eq(mesh.num_vertices()));\n\n    double max_abs = 0.0;\n    for (int o = 0; o < basis.outerSize(); ++o)\n    {\n        for (Eigen::SparseMatrix<double>::InnerIterator it(basis, o); it; ++it)\n        {\n            max_abs = std::max(max_abs, std::abs(it.value()));\n        }\n    }\n\n    RC_ASSERT(max_abs < 1e-14);\n}\n\nRC_GTEST_PROP(homogenized_basis_test, corrected_basis_is_orthogonal_to_fine_space, ())\n{\n    \/\/ Let W be such that W_ij corrected basis function i is defined by\n    \/\/\n    \/\/ lambda_i = sum_j W_ij phi_j\n    \/\/\n    \/\/ where phi_j denotes the fine-scale basis functions. Then the a-orthogonality of the corrected space V_H and\n    \/\/ the fine-scale finite element space implies that\n    \/\/\n    \/\/ A W^T = 0\n    \/\/\n    \/\/ where A is the fine-scale stiffness matrix (interior nodes).\n    \/\/\n    \/\/ Our corrected basis is constructed by a localized approximation, so this does not hold exactly.\n    \/\/ We can, however, choose an oversampling parameter so large that each corrector problem is a global problem.\n    \/\/ In this case, the above property should still hold.\n\n    \/\/ Make sure interior is not empty, because Eigen's SVD fails on empty matrices\n    const auto coarse = *rc::gen::suchThat(crest::gen::arbitrary_unit_square_mesh(),\n                                           [] (const auto & mesh) {\n                                               return !mesh.compute_interior_vertices().empty();\n                                           }).as(\"coarse mesh\");\n    const auto fine = *crest::gen::arbitrary_refinement(coarse).as(\"fine mesh\");\n\n    const auto fine_interior = fine.compute_interior_vertices();\n    const auto coarse_interior = coarse.compute_interior_vertices();\n    const auto fine_basis = LagrangeBasis2d<double>(fine);\n\n    const auto oversampling = static_cast<unsigned int>(coarse.num_vertices());\n    const auto basis_weights = crest::detail::corrected_basis_coefficients(coarse, fine, oversampling);\n    const auto basis_interior_weights = sparse_submatrix(basis_weights, coarse_interior, fine_interior);\n\n    \/\/ Construct a basis for W_H, the kernel of I_H.\n    const Eigen::MatrixXd I_H = sparse_submatrix(crest::quasi_interpolator(coarse, fine), coarse_interior, fine_interior);\n    const Eigen::JacobiSVD<Eigen::MatrixXd> svd(I_H, Eigen::ComputeFullV);\n    const auto r = svd.rank();\n    const auto n = I_H.cols();\n    const Eigen::MatrixXd W_H_kernel_basis = svd.matrixV().rightCols(n - r);\n\n    const Eigen::MatrixXd W = basis_interior_weights;\n    const Eigen::MatrixXd A = sparse_submatrix(fine_basis.assemble().stiffness, fine_interior, fine_interior);\n    const auto & N = W_H_kernel_basis;\n\n    const Eigen::MatrixXd product = W * A * N;\n\n    RC_LOG() << \"W:   \" << std::endl << W << std::endl << std::endl;\n    RC_LOG() << \"A:   \" << std::endl << A << std::endl << std::endl;\n    RC_LOG() << \"N:   \" << std::endl << N << std::endl << std::endl;\n    RC_LOG() << \"WAN: \" << std::endl << product << std::endl << std::endl;\n\n    RC_ASSERT(product.isZero(1e-14));\n}\n\nTEST(standard_coarse_basis_in_fine_space, basic_mesh)\n{\n    const std::vector<Vertex> coarse_vertices{\n            Vertex(0.0, 0.0),\n            Vertex(1.0, 0.0),\n            Vertex(1.0, 1.0),\n            Vertex(0.0, 1.0)\n    };\n\n    const std::vector<Element> coarse_elements {\n            Element({3, 0, 1}),\n            Element({1, 2, 3})\n    };\n\n    const std::vector<Vertex> fine_vertices {\n            Vertex(0.0, 0.0),\n            Vertex(1.0, 0.0),\n            Vertex(1.0, 1.0),\n            Vertex(0.0, 1.0),\n            Vertex(0.5, 0.5)\n    };\n\n    const std::vector<Element> fine_elements {\n            Element({0, 4, 3}),\n            Element({2, 4, 1}),\n            Element({1, 4, 0}),\n            Element({2, 4, 3})\n    };\n\n    const auto coarse_mesh = IndexedMesh<double, int>(coarse_vertices, coarse_elements);\n    const auto fine_mesh = IndexedMesh<double, int>(fine_vertices, fine_elements);\n\n    const Eigen::Matrix<double, 4, 5> coarse_basis_in_fine =\n            crest::detail::standard_coarse_basis_in_fine_space(coarse_mesh, fine_mesh);\n\n    Eigen::Matrix<double, 4, 5> expected;\n    expected <<\n             1.0, 0.0, 0.0, 0.0, 0.0,\n            0.0, 1.0, 0.0, 0.0, 0.5,\n            0.0, 0.0, 1.0, 0.0, 0.0,\n            0.0, 0.0, 0.0, 1.0, 0.5;\n\n    ASSERT_THAT(coarse_basis_in_fine, MatrixEq(expected));\n}\n\nRC_GTEST_PROP(standard_coarse_basis_in_fine_space, quasi_interpolation_recovers_coarse_basis, ())\n{\n    \/\/ Let v_H be the weights of a function in the coarse space. Then v_H is also a function in the fine space,\n    \/\/ and since I_H is a quasi interpolation, we have that I_H v_h = v_H, where v_h are the fine weights of\n    \/\/ the coarse function.\n    \/\/ We can verify that this property holds for all basis functions as represented in the fine space.\n\n    const auto coarse = *crest::gen::arbitrary_unit_square_mesh().as(\"Coarse mesh\");\n    const auto fine = *crest::gen::arbitrary_refinement(coarse, 0, 5).as(\"Fine mesh\");\n\n    const auto basis = crest::detail::standard_coarse_basis_in_fine_space(coarse, fine);\n    const auto I_H = crest::quasi_interpolator(coarse, fine);\n\n    const Eigen::SparseMatrix<double> interpolated = I_H * basis.transpose();\n    const Eigen::MatrixXd interpolated_dense = interpolated;\n\n    RC_LOG() << interpolated_dense << std::endl;\n\n    \/\/ We could have had a shaper tolerance here, but it appears Eigen does not do an elementwise comparison\n    \/\/ for isIdentity (which is very annoying, by the way), as it can spuriously fail even when all non-diagonal\n    \/\/ elements are smaller than 3e-16.\n    RC_ASSERT(interpolated_dense.isIdentity(1e-14));\n}\n<commit_msg>Correct explanation in orthogonality test<commit_after>#include <gtest\/gtest.h>\n#include <gmock\/gmock.h>\n#include <rapidcheck\/gtest.h>\n\n#include <crest\/geometry\/indexed_mesh.hpp>\n#include <crest\/geometry\/refinement.hpp>\n#include <crest\/basis\/lagrange_basis2d.hpp>\n#include <crest\/basis\/homogenized_basis.hpp>\n\n#include <crest\/util\/algorithms.hpp>\n\n#include <util\/eigen_matchers.hpp>\n#include <util\/test_generators.hpp>\n\n#include <Eigen\/Sparse>\n#include <Eigen\/Dense>\n\nusing ::testing::ElementsAreArray;\nusing ::testing::Pointwise;\nusing ::testing::Eq;\nusing ::testing::DoubleEq;\nusing ::testing::Lt;\nusing ::testing::Each;\n\nusing crest::IndexedMesh;\nusing crest::LagrangeBasis2d;\n\ntypedef IndexedMesh<double, int>::Vertex Vertex;\ntypedef IndexedMesh<double, int>::Element Element;\n\nTEST(homogenized_basis_test, correctors_are_in_interpolator_kernel_for_threshold_fine_mesh)\n{\n    \/\/ Recall that by definition, I_H c = 0, for any corrector with weights c.\n    const std::vector<Vertex> coarse_vertices {\n            Vertex(0.0, 0.0),\n            Vertex(1.0, 0.0),\n            Vertex(1.0, 1.0),\n            Vertex(0.0, 1.0)\n    };\n\n    const std::vector<Element> coarse_elements {\n            Element({3, 0, 1}),\n            Element({1, 2, 3})\n    };\n\n    const auto initial_mesh = IndexedMesh<double, int>(coarse_vertices, coarse_elements);\n\n    const auto two_scale_meshes = crest::threshold(initial_mesh, 0.5,\n                                                   { crest::ReentrantCorner<double, int>(0, 2.35)});\n\n    const auto basis = crest::detail::homogenized_basis_correctors(two_scale_meshes.coarse,\n                                                                   two_scale_meshes.fine,\n                                                                   4);\n\n    ASSERT_THAT(basis.rows(), Eq(two_scale_meshes.coarse.num_vertices()));\n    ASSERT_THAT(basis.cols(), Eq(two_scale_meshes.fine.num_vertices()));\n\n    const auto coarse_interior = two_scale_meshes.coarse.compute_interior_vertices();\n    const auto fine_dof = crest::algo::integer_range<int>(0, two_scale_meshes.fine.num_vertices());\n\n    const auto I_H = crest::quasi_interpolator(two_scale_meshes.coarse, two_scale_meshes.fine);\n    \/\/ We need to test with the coarse interior, because the matrix returned by quasi_interpolator\n    \/\/ does not impose that I_H x = 0 on the boundary.\n    const auto I_H_interior = sparse_submatrix(I_H, coarse_interior, fine_dof);\n\n    \/\/ Recall that each row of 'basis' corresponds to weights in the fine space, so by transposing it and\n    \/\/ left-multiplying by I_H, we effectively compute I_H x_i for each basis function i.\n    \/\/ Since x_i is in the kernel of I_H, we expect the result to be zero.\n    const Eigen::SparseMatrix<double> Z = I_H_interior * basis.transpose();\n    const Eigen::MatrixXd Z_dense = Z;\n\n    EXPECT_TRUE(Z_dense.isZero(1e-15));\n}\n\nTEST(construct_saddle_point_problem_test, blockwise_correct)\n{\n    MatrixX<double> A(5, 5);\n    A.setZero();\n    A(0, 0) = 1.0;\n    A(1, 1) = 2.0;\n    A(2, 2) = 3.0;\n    A(3, 3) = 4.0;\n    A(4, 4) = 5.0;\n\n    MatrixX<double> I_H(3, 5);\n    I_H.setZero();\n    I_H(0, 0) = 6.0;\n    I_H(1, 1) = 7.0;\n    I_H(2, 2) = 8.0;\n\n    VectorX<double> b(5);\n    b.setZero();\n    b(0) = 1.0;\n    b(1) = 2.0;\n    b(2) = 3.0;\n    b(3) = 4.0;\n    b(4) = 5.0;\n\n    const Eigen::SparseMatrix<double> A_sparse = A.sparseView();\n    const Eigen::SparseMatrix<double> I_H_sparse = I_H.sparseView();\n\n    const auto saddle_point = crest::detail::construct_saddle_point_problem(A_sparse, I_H_sparse, b);\n    const MatrixX<double> C = saddle_point.first;\n    const VectorX<double> c = saddle_point.second;\n\n    ASSERT_THAT(C.rows(), 8);\n    ASSERT_THAT(C.cols(), 8);\n    ASSERT_THAT(c.rows(), 8);\n\n    const MatrixX<double> bottomRightCorner = C.bottomRightCorner(3, 3);\n    const auto bottomRightCornerElements = std::vector<double>(bottomRightCorner.data(), bottomRightCorner.data() + 9);\n\n    \/\/ TODO: The current MatrixEq is not entirely reliable, I think. Improve!\n    EXPECT_THAT(C.topLeftCorner(5, 5), MatrixEq(A));\n    EXPECT_THAT(C.bottomLeftCorner(3, 5), MatrixEq(I_H));\n    EXPECT_THAT(C.topRightCorner(5, 3), MatrixEq(I_H.transpose()));\n    EXPECT_THAT(bottomRightCornerElements, Each(DoubleEq(0.0)));\n\n    EXPECT_THAT(c.topRows(5), MatrixEq(b));\n    EXPECT_THAT(c.bottomRows(3)(0), DoubleEq(0.0));\n    EXPECT_THAT(c.bottomRows(3)(1), DoubleEq(0.0));\n    EXPECT_THAT(c.bottomRows(3)(2), DoubleEq(0.0));\n}\n\nRC_GTEST_PROP(homogenized_basis_test, correctors_are_in_interpolator_kernel, ())\n{\n    const auto oversampling = *rc::gen::arbitrary<unsigned int>();\n    const auto coarse_mesh = *crest::gen::arbitrary_unit_square_mesh(4);\n\n    \/\/ Make sure the fine mesh does not coincide with the coarse mesh\n    const auto fine_mesh = *rc::gen::suchThat(crest::gen::arbitrary_refinement(coarse_mesh, 1, 4),\n                                              [coarse_mesh] (auto mesh)\n                                              {\n                                                  return mesh.num_elements() != coarse_mesh.num_elements();\n                                              });\n\n    const auto basis = crest::detail::homogenized_basis_correctors(coarse_mesh, fine_mesh, oversampling);\n\n    ASSERT_THAT(basis.rows(), Eq(coarse_mesh.num_vertices()));\n    ASSERT_THAT(basis.cols(), Eq(fine_mesh.num_vertices()));\n\n    const auto coarse_interior = coarse_mesh.compute_interior_vertices();\n    const auto fine_dof = crest::algo::integer_range<int>(0, fine_mesh.num_vertices());\n\n    const auto I_H = crest::quasi_interpolator(coarse_mesh, fine_mesh);\n\n    \/\/ We need to test with the coarse interior, because the matrix returned by quasi_interpolator\n    \/\/ does not impose that I_H x = 0 on the boundary.\n    const auto I_H_interior = sparse_submatrix(I_H, coarse_interior, fine_dof);\n\n    \/\/ Recall that each row of 'basis' corresponds to weights in the fine space, so by transposing it and\n    \/\/ left-multiplying by I_H, we effectively compute I_H x_i for each basis function i.\n    \/\/ Since x_i is in the kernel of I_H, we expect the result to be zero.\n    const Eigen::SparseMatrix<double> Z = I_H_interior * basis.transpose();\n    const Eigen::MatrixXd Z_dense = Z;\n\n    RC_ASSERT(Z_dense.isZero(1e-14));\n}\n\nRC_GTEST_PROP(homogenized_basis_test, correctors_are_zero_with_no_refinement, ())\n{\n    const auto oversampling = static_cast<unsigned int>(*rc::gen::inRange(0, 6));\n    const auto mesh = *crest::gen::arbitrary_unit_square_mesh();\n    const auto basis = crest::detail::homogenized_basis_correctors(mesh, mesh, oversampling);\n\n    ASSERT_THAT(basis.rows(), Eq(mesh.num_vertices()));\n    ASSERT_THAT(basis.cols(), Eq(mesh.num_vertices()));\n\n    double max_abs = 0.0;\n    for (int o = 0; o < basis.outerSize(); ++o)\n    {\n        for (Eigen::SparseMatrix<double>::InnerIterator it(basis, o); it; ++it)\n        {\n            max_abs = std::max(max_abs, std::abs(it.value()));\n        }\n    }\n\n    RC_ASSERT(max_abs < 1e-14);\n}\n\nRC_GTEST_PROP(homogenized_basis_test, corrected_basis_is_orthogonal_to_fine_space, ())\n{\n    \/\/ Let W be such that W_ij corrected basis function i is defined by\n    \/\/\n    \/\/ lambda_i = sum_j W_ij phi_j\n    \/\/\n    \/\/ where phi_j denotes the fine-scale basis functions. Then the a-orthogonality of the corrected space V_H and\n    \/\/ the fine-scale finite element space implies that\n    \/\/\n    \/\/ W A N = 0\n    \/\/\n    \/\/ where A is the fine-scale stiffness matrix (interior nodes) and N is a basis for W_H = ker(I_H).\n    \/\/ In real applications, obtaining a basis for W_H is normally infeasible due to sparsity requirements.\n    \/\/ However, since we only do small-scale tests here, we have the luxury of just simply building a dense\n    \/\/ basis through the SVD.\n    \/\/\n    \/\/ Our corrected basis is constructed by a localized approximation, so the above property does not hold exactly.\n    \/\/ We can, however, choose an oversampling parameter so large that each corrector problem is a global problem.\n    \/\/ In this case, the above property must still hold.\n\n    \/\/ Make sure interior is not empty, because Eigen's SVD fails on empty matrices\n    const auto coarse = *rc::gen::suchThat(crest::gen::arbitrary_unit_square_mesh(),\n                                           [] (const auto & mesh) {\n                                               return !mesh.compute_interior_vertices().empty();\n                                           }).as(\"coarse mesh\");\n    const auto fine = *crest::gen::arbitrary_refinement(coarse).as(\"fine mesh\");\n\n    const auto fine_interior = fine.compute_interior_vertices();\n    const auto coarse_interior = coarse.compute_interior_vertices();\n    const auto fine_basis = LagrangeBasis2d<double>(fine);\n\n    const auto oversampling = static_cast<unsigned int>(coarse.num_vertices());\n    const auto basis_weights = crest::detail::corrected_basis_coefficients(coarse, fine, oversampling);\n    const auto basis_interior_weights = sparse_submatrix(basis_weights, coarse_interior, fine_interior);\n\n    \/\/ Construct a basis for W_H, the kernel of I_H.\n    const Eigen::MatrixXd I_H = sparse_submatrix(crest::quasi_interpolator(coarse, fine), coarse_interior, fine_interior);\n    const Eigen::JacobiSVD<Eigen::MatrixXd> svd(I_H, Eigen::ComputeFullV);\n    const auto r = svd.rank();\n    const auto n = I_H.cols();\n    const Eigen::MatrixXd W_H_kernel_basis = svd.matrixV().rightCols(n - r);\n\n    const Eigen::MatrixXd W = basis_interior_weights;\n    const Eigen::MatrixXd A = sparse_submatrix(fine_basis.assemble().stiffness, fine_interior, fine_interior);\n    const auto & N = W_H_kernel_basis;\n\n    const Eigen::MatrixXd product = W * A * N;\n\n    RC_LOG() << \"W:   \" << std::endl << W << std::endl << std::endl;\n    RC_LOG() << \"A:   \" << std::endl << A << std::endl << std::endl;\n    RC_LOG() << \"N:   \" << std::endl << N << std::endl << std::endl;\n    RC_LOG() << \"WAN: \" << std::endl << product << std::endl << std::endl;\n\n    RC_ASSERT(product.isZero(1e-14));\n}\n\nTEST(standard_coarse_basis_in_fine_space, basic_mesh)\n{\n    const std::vector<Vertex> coarse_vertices{\n            Vertex(0.0, 0.0),\n            Vertex(1.0, 0.0),\n            Vertex(1.0, 1.0),\n            Vertex(0.0, 1.0)\n    };\n\n    const std::vector<Element> coarse_elements {\n            Element({3, 0, 1}),\n            Element({1, 2, 3})\n    };\n\n    const std::vector<Vertex> fine_vertices {\n            Vertex(0.0, 0.0),\n            Vertex(1.0, 0.0),\n            Vertex(1.0, 1.0),\n            Vertex(0.0, 1.0),\n            Vertex(0.5, 0.5)\n    };\n\n    const std::vector<Element> fine_elements {\n            Element({0, 4, 3}),\n            Element({2, 4, 1}),\n            Element({1, 4, 0}),\n            Element({2, 4, 3})\n    };\n\n    const auto coarse_mesh = IndexedMesh<double, int>(coarse_vertices, coarse_elements);\n    const auto fine_mesh = IndexedMesh<double, int>(fine_vertices, fine_elements);\n\n    const Eigen::Matrix<double, 4, 5> coarse_basis_in_fine =\n            crest::detail::standard_coarse_basis_in_fine_space(coarse_mesh, fine_mesh);\n\n    Eigen::Matrix<double, 4, 5> expected;\n    expected <<\n             1.0, 0.0, 0.0, 0.0, 0.0,\n            0.0, 1.0, 0.0, 0.0, 0.5,\n            0.0, 0.0, 1.0, 0.0, 0.0,\n            0.0, 0.0, 0.0, 1.0, 0.5;\n\n    ASSERT_THAT(coarse_basis_in_fine, MatrixEq(expected));\n}\n\nRC_GTEST_PROP(standard_coarse_basis_in_fine_space, quasi_interpolation_recovers_coarse_basis, ())\n{\n    \/\/ Let v_H be the weights of a function in the coarse space. Then v_H is also a function in the fine space,\n    \/\/ and since I_H is a quasi interpolation, we have that I_H v_h = v_H, where v_h are the fine weights of\n    \/\/ the coarse function.\n    \/\/ We can verify that this property holds for all basis functions as represented in the fine space.\n\n    const auto coarse = *crest::gen::arbitrary_unit_square_mesh().as(\"Coarse mesh\");\n    const auto fine = *crest::gen::arbitrary_refinement(coarse, 0, 5).as(\"Fine mesh\");\n\n    const auto basis = crest::detail::standard_coarse_basis_in_fine_space(coarse, fine);\n    const auto I_H = crest::quasi_interpolator(coarse, fine);\n\n    const Eigen::SparseMatrix<double> interpolated = I_H * basis.transpose();\n    const Eigen::MatrixXd interpolated_dense = interpolated;\n\n    RC_LOG() << interpolated_dense << std::endl;\n\n    \/\/ We could have had a shaper tolerance here, but it appears Eigen does not do an elementwise comparison\n    \/\/ for isIdentity (which is very annoying, by the way), as it can spuriously fail even when all non-diagonal\n    \/\/ elements are smaller than 3e-16.\n    RC_ASSERT(interpolated_dense.isIdentity(1e-14));\n}\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\/environment.h>\n#include <fnordmetric\/metricdb\/backends\/disk\/binaryformat.h>\n#include <fnordmetric\/metricdb\/backends\/disk\/metric.h>\n#include <fnordmetric\/metricdb\/backends\/disk\/tableref.h>\n#include <fnordmetric\/metricdb\/backends\/disk\/samplewriter.h>\n#include <fnordmetric\/util\/runtimeexception.h>\n#include <fnordmetric\/util\/freeondestroy.h>\n#include <fnordmetric\/util\/wallclock.h>\n#include <string.h>\n\nusing namespace fnord;\nusing fnord::util::WallClock;\n\nnamespace fnordmetric {\nnamespace metricdb {\nnamespace disk_backend {\n\nMetric::Metric(\n    const std::string& key,\n    io::FileRepository* file_repo) :\n    IMetric(key),\n    file_repo_(file_repo),\n    head_(nullptr),\n    max_generation_(0),\n    live_table_max_size_(kLiveTableMaxSize),\n    live_table_idle_time_micros_(kLiveTableIdleTimeMicros),\n    last_insert_(0) {}\n\nMetric::Metric(\n    const std::string& key,\n    io::FileRepository* file_repo,\n    std::vector<std::unique_ptr<TableRef>>&& tables) :\n    IMetric(key),\n    file_repo_(file_repo),\n    live_table_max_size_(kLiveTableMaxSize),\n    live_table_idle_time_micros_(kLiveTableIdleTimeMicros),\n    last_insert_(0) {\n  TableRef* head_table = nullptr;\n  std::vector<uint64_t> generations;\n\n  for (auto& table : tables) {\n    if (head_table == nullptr ||\n        table->generation() > head_table->generation()) {\n      head_table = table.get();\n    }\n  }\n\n  generations = head_table->parents();\n  generations.emplace_back(head_table->generation());\n\n  if (env()->verbose()) {\n    env()->logger()->printf(\n        \"DEBUG\",\n        \"Reopening metric: '%s' with %i table(s), generation: %\" PRIu64,\n        key.c_str(),\n        (int) generations.size(),\n        head_table->generation());\n  }\n\n  std::shared_ptr<MetricSnapshot> snapshot(new MetricSnapshot());\n  for (const auto gen : generations) {\n    for (auto& table : tables) {\n      if (table.get() == nullptr) {\n        continue;\n      }\n\n      if (table->generation() == gen) {\n        table->import(&token_index_, &label_index_);\n        snapshot->appendTable(std::move(table));\n        table.reset(nullptr);\n      }\n    }\n  }\n\n  head_ = snapshot;\n  max_generation_ = head_table->generation();\n\n  for (auto& table : tables) {\n    if (table.get() != nullptr) {\n      env()->logger()->printf(\"INFO\", \"Orphaned table...\");\n    }\n  }\n}\n\nstd::shared_ptr<MetricSnapshot> Metric::getSnapshot() const {\n  std::lock_guard<std::mutex> lock_holder(head_mutex_);\n  return head_;\n}\n\n\/\/ Must hold append_mutex_ to call this!\nstd::shared_ptr<MetricSnapshot> Metric::getOrCreateSnapshot() {\n  {\n    std::lock_guard<std::mutex> lock_holder(head_mutex_);\n\n    if (head_.get() != nullptr &&\n        head_->isWritable() &&\n        head_->tables().back()->isWritable() &&\n        head_->tables().back()->bodySize() < live_table_max_size_) {\n      return head_;\n    }\n  }\n\n  std::lock_guard<std::mutex> lock_holder(head_mutex_);\n  auto new_snapshot = createSnapshot(true);\n  head_ = new_snapshot;\n  return head_;\n}\n\nvoid Metric::insertSample(\n    double value,\n    const std::vector<std::pair<std::string, std::string>>& labels) {\n  SampleWriter writer(&token_index_);\n  writer.writeValue(value);\n  for (const auto& label : labels) {\n    writer.writeLabel(label.first, label.second);\n    label_index_.addLabel(label.first);\n  }\n\n  std::lock_guard<std::mutex> lock_holder(append_mutex_);\n  auto snapshot = getOrCreateSnapshot();\n  auto& table = snapshot->tables().back();\n\n  uint64_t now = fnord::util::WallClock::unixMicros();\n  table->addSample(&writer, now);\n  last_insert_ = now;\n}\n\n\/\/ FIXPAUL misnomer...it creates a new snapshot + appends a new, clean table\nstd::shared_ptr<MetricSnapshot> Metric::createSnapshot(bool writable) {\n  std::shared_ptr<MetricSnapshot> snapshot;\n  std::vector<uint64_t> parents;\n\n  if (head_.get() == nullptr) {\n    snapshot.reset(new MetricSnapshot());\n  } else {\n    snapshot = head_->clone();\n    for (const auto& tbl : snapshot->tables()) {\n      parents.emplace_back(tbl->generation());\n    }\n  }\n\n  snapshot->setWritable(writable);\n\n  if (writable) {\n    \/\/ open new file\n    auto fileref = file_repo_->createFile();\n    auto file = io::File::openFile(\n        fileref.absolute_path,\n        io::File::O_READ | io::File::O_WRITE | io::File::O_CREATE);\n\n    snapshot->appendTable(TableRef::createTable(\n        fileref.absolute_path,\n        key_,\n        std::move(file),\n        ++max_generation_,\n        parents));\n  }\n\n  return snapshot;\n}\n\nvoid Metric::scanSamples(\n    const fnord::util::DateTime& time_begin,\n    const fnord::util::DateTime& time_end,\n    std::function<bool (Sample* sample)> callback) {\n  auto snapshot = getSnapshot();\n  if (snapshot.get() == nullptr) {\n    return;\n  }\n\n  MetricCursor cursor(snapshot, &token_index_);\n  while (cursor.valid()) {\n    \/\/callback(&cursor);\n\n    if (!cursor.next()) {\n      break;\n    }\n  }\n}\n\nvoid Metric::compact(CompactionPolicy* compaction \/* = nullptr *\/) {\n  if (!compaction_mutex_.try_lock()) {\n    return;\n  }\n\n  std::lock_guard<std::mutex>(compaction_mutex_, std::adopt_lock);\n\n  if (env()->verbose()) {\n    env()->logger()->printf(\n        \"DEBUG\",\n        \"Running compaction for metric: '%s'\",\n        key_.c_str());\n  }\n\n  \/\/ create a new snapshot and make all tables immutable\n  std::shared_ptr<MetricSnapshot> snapshot;\n  {\n    std::lock_guard<std::mutex> append_lock_holder(append_mutex_);\n    std::lock_guard<std::mutex> head_lock_holder(head_mutex_);\n    snapshot = createSnapshot(false);\n  }\n\n  auto old_tables = snapshot->tables();\n  auto idle_time_micros = WallClock::unixMicros() - last_insert_;\n\n  if (idle_time_micros < live_table_idle_time_micros_) {\n    old_tables.pop_back();\n  }\n\n  std::vector<std::shared_ptr<TableRef>> new_tables;\n\n  \/\/ finalize unfinished sstables\n  for (auto& table : old_tables) {\n    if (table->isWritable()) {\n      if (table->bodySize() == 0) {\n        if (env()->verbose()) {\n          env()->logger()->printf(\n              \"DEBUG\",\n              \"SSTable '%s' (%s) is empty, deleting...\",\n              table->filename().c_str(),\n              table->metricKey().c_str());\n        }\n\n        continue;\n      } else {\n        if (env()->verbose()) {\n          env()->logger()->printf(\n              \"DEBUG\",\n              \"Finalizing sstable '%s' (%s)\",\n              table->filename().c_str(),\n              table->metricKey().c_str());\n        }\n\n        table->finalize(&token_index_, &label_index_);\n        new_tables.emplace_back(new ReadonlyTableRef(*table));\n      }\n    } else {\n      new_tables.emplace_back(table);\n    }\n  }\n\n  \/\/ run the compaction\n  if (compaction != nullptr) {\n    compaction->compact(&new_tables);\n  }\n\n  \/\/ create a new snapshot and commit modifications\n  {\n    std::lock_guard<std::mutex> append_lock_holder(append_mutex_);\n    std::lock_guard<std::mutex> head_lock_holder(head_mutex_);\n    auto new_snapshot = new MetricSnapshot();\n    new_snapshot->setWritable(head_->isWritable());\n\n    for (const auto& table : new_tables) {\n      new_snapshot->appendTable(table);\n    }\n\n    for (int i = old_tables.size(); i < head_->tables().size(); ++i) {\n      new_snapshot->appendTable(head_->tables()[i]);\n    }\n\n    head_.reset(new_snapshot);\n  }\n}\n\nvoid Metric::setLiveTableMaxSize(size_t max_size) {\n  live_table_max_size_ = max_size;\n}\n\nvoid Metric::setLiveTableIdleTimeMicros(uint64_t idle_time_micros) {\n  live_table_idle_time_micros_ = idle_time_micros;\n}\n\nsize_t Metric::numTables() const {\n  auto snapshot = getSnapshot();\n  return snapshot->tables().size();\n}\n\nsize_t Metric::totalBytes() const {\n  auto snapshot = getSnapshot();\n\n  size_t bytes = 0;\n  for (const auto& tbl : snapshot->tables()) {\n    bytes += tbl->bodySize();\n  }\n\n  return bytes;\n}\n\nDateTime Metric::lastInsertTime() const {\n  return DateTime(last_insert_);\n}\n\nstd::set<std::string> Metric::labels() const {\n  return label_index_.labels();\n}\n\nbool Metric::hasLabel(const std::string& label) const {\n  return label_index_.hasLabel(label);\n}\n\n}\n}\n}\n\n<commit_msg>disk_backend::Metric::scanSamples<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\/environment.h>\n#include <fnordmetric\/metricdb\/backends\/disk\/binaryformat.h>\n#include <fnordmetric\/metricdb\/backends\/disk\/metric.h>\n#include <fnordmetric\/metricdb\/backends\/disk\/tableref.h>\n#include <fnordmetric\/metricdb\/backends\/disk\/samplewriter.h>\n#include <fnordmetric\/util\/runtimeexception.h>\n#include <fnordmetric\/util\/freeondestroy.h>\n#include <fnordmetric\/util\/wallclock.h>\n#include <string.h>\n\nusing namespace fnord;\nusing fnord::util::WallClock;\n\nnamespace fnordmetric {\nnamespace metricdb {\nnamespace disk_backend {\n\nMetric::Metric(\n    const std::string& key,\n    io::FileRepository* file_repo) :\n    IMetric(key),\n    file_repo_(file_repo),\n    head_(nullptr),\n    max_generation_(0),\n    live_table_max_size_(kLiveTableMaxSize),\n    live_table_idle_time_micros_(kLiveTableIdleTimeMicros),\n    last_insert_(0) {}\n\nMetric::Metric(\n    const std::string& key,\n    io::FileRepository* file_repo,\n    std::vector<std::unique_ptr<TableRef>>&& tables) :\n    IMetric(key),\n    file_repo_(file_repo),\n    live_table_max_size_(kLiveTableMaxSize),\n    live_table_idle_time_micros_(kLiveTableIdleTimeMicros),\n    last_insert_(0) {\n  TableRef* head_table = nullptr;\n  std::vector<uint64_t> generations;\n\n  for (auto& table : tables) {\n    if (head_table == nullptr ||\n        table->generation() > head_table->generation()) {\n      head_table = table.get();\n    }\n  }\n\n  generations = head_table->parents();\n  generations.emplace_back(head_table->generation());\n\n  if (env()->verbose()) {\n    env()->logger()->printf(\n        \"DEBUG\",\n        \"Reopening metric: '%s' with %i table(s), generation: %\" PRIu64,\n        key.c_str(),\n        (int) generations.size(),\n        head_table->generation());\n  }\n\n  std::shared_ptr<MetricSnapshot> snapshot(new MetricSnapshot());\n  for (const auto gen : generations) {\n    for (auto& table : tables) {\n      if (table.get() == nullptr) {\n        continue;\n      }\n\n      if (table->generation() == gen) {\n        table->import(&token_index_, &label_index_);\n        snapshot->appendTable(std::move(table));\n        table.reset(nullptr);\n      }\n    }\n  }\n\n  head_ = snapshot;\n  max_generation_ = head_table->generation();\n\n  for (auto& table : tables) {\n    if (table.get() != nullptr) {\n      env()->logger()->printf(\"INFO\", \"Orphaned table...\");\n    }\n  }\n}\n\nstd::shared_ptr<MetricSnapshot> Metric::getSnapshot() const {\n  std::lock_guard<std::mutex> lock_holder(head_mutex_);\n  return head_;\n}\n\n\/\/ Must hold append_mutex_ to call this!\nstd::shared_ptr<MetricSnapshot> Metric::getOrCreateSnapshot() {\n  {\n    std::lock_guard<std::mutex> lock_holder(head_mutex_);\n\n    if (head_.get() != nullptr &&\n        head_->isWritable() &&\n        head_->tables().back()->isWritable() &&\n        head_->tables().back()->bodySize() < live_table_max_size_) {\n      return head_;\n    }\n  }\n\n  std::lock_guard<std::mutex> lock_holder(head_mutex_);\n  auto new_snapshot = createSnapshot(true);\n  head_ = new_snapshot;\n  return head_;\n}\n\nvoid Metric::insertSample(\n    double value,\n    const std::vector<std::pair<std::string, std::string>>& labels) {\n  SampleWriter writer(&token_index_);\n  writer.writeValue(value);\n  for (const auto& label : labels) {\n    writer.writeLabel(label.first, label.second);\n    label_index_.addLabel(label.first);\n  }\n\n  std::lock_guard<std::mutex> lock_holder(append_mutex_);\n  auto snapshot = getOrCreateSnapshot();\n  auto& table = snapshot->tables().back();\n\n  uint64_t now = fnord::util::WallClock::unixMicros();\n  table->addSample(&writer, now);\n  last_insert_ = now;\n}\n\n\/\/ FIXPAUL misnomer...it creates a new snapshot + appends a new, clean table\nstd::shared_ptr<MetricSnapshot> Metric::createSnapshot(bool writable) {\n  std::shared_ptr<MetricSnapshot> snapshot;\n  std::vector<uint64_t> parents;\n\n  if (head_.get() == nullptr) {\n    snapshot.reset(new MetricSnapshot());\n  } else {\n    snapshot = head_->clone();\n    for (const auto& tbl : snapshot->tables()) {\n      parents.emplace_back(tbl->generation());\n    }\n  }\n\n  snapshot->setWritable(writable);\n\n  if (writable) {\n    \/\/ open new file\n    auto fileref = file_repo_->createFile();\n    auto file = io::File::openFile(\n        fileref.absolute_path,\n        io::File::O_READ | io::File::O_WRITE | io::File::O_CREATE);\n\n    snapshot->appendTable(TableRef::createTable(\n        fileref.absolute_path,\n        key_,\n        std::move(file),\n        ++max_generation_,\n        parents));\n  }\n\n  return snapshot;\n}\n\nvoid Metric::scanSamples(\n    const fnord::util::DateTime& time_begin,\n    const fnord::util::DateTime& time_end,\n    std::function<bool (Sample* sample)> callback) {\n  auto snapshot = getSnapshot();\n  if (snapshot.get() == nullptr) {\n    return;\n  }\n\n  MetricCursor cursor(snapshot, &token_index_);\n  while (cursor.valid()) {\n    auto sample = cursor.sample<double>();\n    auto time = cursor.time();\n\n    if (time >= static_cast<uint64_t>(time_end)) {\n      break;\n    }\n\n    if (time >= static_cast<uint64_t>(time_begin)) {\n      Sample cb_sample(\n          time,\n          sample->value(),\n          sample->labels());\n\n      callback(&cb_sample);\n    }\n\n    if (!cursor.next()) {\n      break;\n    }\n  }\n}\n\nvoid Metric::compact(CompactionPolicy* compaction \/* = nullptr *\/) {\n  if (!compaction_mutex_.try_lock()) {\n    return;\n  }\n\n  std::lock_guard<std::mutex>(compaction_mutex_, std::adopt_lock);\n\n  if (env()->verbose()) {\n    env()->logger()->printf(\n        \"DEBUG\",\n        \"Running compaction for metric: '%s'\",\n        key_.c_str());\n  }\n\n  \/\/ create a new snapshot and make all tables immutable\n  std::shared_ptr<MetricSnapshot> snapshot;\n  {\n    std::lock_guard<std::mutex> append_lock_holder(append_mutex_);\n    std::lock_guard<std::mutex> head_lock_holder(head_mutex_);\n    snapshot = createSnapshot(false);\n  }\n\n  auto old_tables = snapshot->tables();\n  auto idle_time_micros = WallClock::unixMicros() - last_insert_;\n\n  if (idle_time_micros < live_table_idle_time_micros_) {\n    old_tables.pop_back();\n  }\n\n  std::vector<std::shared_ptr<TableRef>> new_tables;\n\n  \/\/ finalize unfinished sstables\n  for (auto& table : old_tables) {\n    if (table->isWritable()) {\n      if (table->bodySize() == 0) {\n        if (env()->verbose()) {\n          env()->logger()->printf(\n              \"DEBUG\",\n              \"SSTable '%s' (%s) is empty, deleting...\",\n              table->filename().c_str(),\n              table->metricKey().c_str());\n        }\n\n        continue;\n      } else {\n        if (env()->verbose()) {\n          env()->logger()->printf(\n              \"DEBUG\",\n              \"Finalizing sstable '%s' (%s)\",\n              table->filename().c_str(),\n              table->metricKey().c_str());\n        }\n\n        table->finalize(&token_index_, &label_index_);\n        new_tables.emplace_back(new ReadonlyTableRef(*table));\n      }\n    } else {\n      new_tables.emplace_back(table);\n    }\n  }\n\n  \/\/ run the compaction\n  if (compaction != nullptr) {\n    compaction->compact(&new_tables);\n  }\n\n  \/\/ create a new snapshot and commit modifications\n  {\n    std::lock_guard<std::mutex> append_lock_holder(append_mutex_);\n    std::lock_guard<std::mutex> head_lock_holder(head_mutex_);\n    auto new_snapshot = new MetricSnapshot();\n    new_snapshot->setWritable(head_->isWritable());\n\n    for (const auto& table : new_tables) {\n      new_snapshot->appendTable(table);\n    }\n\n    for (int i = old_tables.size(); i < head_->tables().size(); ++i) {\n      new_snapshot->appendTable(head_->tables()[i]);\n    }\n\n    head_.reset(new_snapshot);\n  }\n}\n\nvoid Metric::setLiveTableMaxSize(size_t max_size) {\n  live_table_max_size_ = max_size;\n}\n\nvoid Metric::setLiveTableIdleTimeMicros(uint64_t idle_time_micros) {\n  live_table_idle_time_micros_ = idle_time_micros;\n}\n\nsize_t Metric::numTables() const {\n  auto snapshot = getSnapshot();\n  return snapshot->tables().size();\n}\n\nsize_t Metric::totalBytes() const {\n  auto snapshot = getSnapshot();\n\n  size_t bytes = 0;\n  for (const auto& tbl : snapshot->tables()) {\n    bytes += tbl->bodySize();\n  }\n\n  return bytes;\n}\n\nDateTime Metric::lastInsertTime() const {\n  return DateTime(last_insert_);\n}\n\nstd::set<std::string> Metric::labels() const {\n  return label_index_.labels();\n}\n\nbool Metric::hasLabel(const std::string& label) const {\n  return label_index_.hasLabel(label);\n}\n\n}\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2003-2005 Tommi Maekitalo\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\n\n#include <tnt\/httpparser.h>\n#include <tnt\/httperror.h>\n#include <tnt\/httpheader.h>\n#include <cxxtools\/log.h>\n#include <sstream>\n#include <algorithm>\n\n#define SET_STATE(new_state)  state = &Parser::new_state\n\nnamespace tnt\n{\n  namespace\n  {\n    std::string chartoprint(char ch)\n    {\n      const static char hex[] = \"0123456789abcdef\";\n      if (std::isprint(ch))\n        return std::string(1, '\\'') + ch + '\\'';\n      else\n        return std::string(\"'\\\\x\") + hex[(ch >> 4) & 0xf] + hex[ch & 0xf] + '\\'';\n    }\n\n    inline bool istokenchar(char ch)\n    {\n      static const char s[] = \"\\\"(),\/:;<=>?@[\\\\]{}\";\n      return std::isalpha(ch) || std::binary_search(s, s + sizeof(s) - 1, ch);\n    }\n\n    inline bool isHexDigit(char ch)\n    {\n      return (ch >= '0' && ch <= '9')\n          || (ch >= 'A' && ch <= 'Z')\n          || (ch >= 'a' && ch <= 'z');\n    }\n\n    inline unsigned valueOfHexDigit(char ch)\n    {\n      return ch >= '0' && ch <= '9' ? ch - '0'\n           : ch >= 'a' && ch <= 'z' ? ch - 'a' + 10\n           : ch >= 'A' && ch <= 'Z' ? ch - 'A' + 10\n           : 0;\n    }\n  }\n\n  log_define(\"tntnet.httpmessage.parser\")\n\n  bool RequestSizeMonitor::post(bool ret)\n  {\n    if (++requestSize > HttpRequest::getMaxRequestSize()\n      && HttpRequest::getMaxRequestSize() > 0)\n    {\n      requestSizeExceeded();\n      return true;\n    }\n    return ret;\n  }\n\n  void RequestSizeMonitor::requestSizeExceeded()\n  { }\n\n  void HttpRequest::Parser::reset()\n  {\n    message.clear();\n    SET_STATE(state_cmd0);\n    httpCode = HTTP_OK;\n    failedFlag = false;\n    RequestSizeMonitor::reset();\n    headerParser.reset();\n  }\n\n  bool HttpRequest::Parser::state_cmd0(char ch)\n  {\n    if (istokenchar(ch))\n    {\n      message.method[0] = ch;\n      message.methodLen = 1;\n      SET_STATE(state_cmd);\n    }\n    else if (ch != ' ' && ch != '\\t')\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in method\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_cmd(char ch)\n  {\n    if (istokenchar(ch))\n    {\n      if (message.methodLen >= sizeof(message.method) - 1)\n      {\n        log_debug(\"invalid method field; method=\" << std::string(message.method, message.methodLen) << \", len=\" << message.methodLen);\n        throw HttpError(HTTP_BAD_REQUEST, \"invalid method field\");\n      }\n      message.method[message.methodLen++] = ch;\n    }\n    else if (ch == ' ')\n    {\n      message.method[message.methodLen] = '\\0';\n      log_debug(\"method=\" << message.method);\n      SET_STATE(state_url0);\n    }\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in method\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_url0(char ch)\n  {\n    if (ch == ' ' || ch == '\\t')\n    {\n    }\n    else if (ch == '\/')\n    {\n      message.url.clear();\n      message.url.reserve(32);\n      message.url += ch;\n      SET_STATE(state_url);\n    }\n    else if (std::isalpha(ch))\n    {\n      SET_STATE(state_protocol);\n    }\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_protocol(char ch)\n  {\n    if (ch == ':')\n      SET_STATE(state_protocol_slash1);\n    else if (!std::isalpha(ch))\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_protocol_slash1(char ch)\n  {\n    if (ch == '\/')\n      SET_STATE(state_protocol_slash2);\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_protocol_slash2(char ch)\n  {\n    if (ch == '\/')\n      SET_STATE(state_protocol_host);\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_protocol_host(char ch)\n  {\n    if (ch == '\/')\n    {\n      message.url.clear();\n      message.url.reserve(32);\n      message.url += ch;\n      SET_STATE(state_url);\n    }\n    else if (!std::isalpha(ch)\n           && !std::isdigit(ch)\n           && ch != '['\n           && ch != ']'\n           && ch != '.'\n           && ch != ':')\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_url(char ch)\n  {\n    if (ch == '?')\n    {\n      log_debug(\"url=\" << message.url);\n      SET_STATE(state_qparam);\n    }\n    else if (ch == '\\r')\n    {\n      log_debug(\"url=\" << message.url);\n      SET_STATE(state_end0);\n    }\n    else if (ch == '\\n')\n    {\n      log_debug(\"url=\" << message.url);\n      SET_STATE(state_header);\n    }\n    else if (ch == ' ' || ch == '\\t')\n    {\n      log_debug(\"url=\" << message.url);\n      SET_STATE(state_version);\n    }\n    else if (ch == '+')\n      message.url += ' ';\n    else if (ch == '%')\n    {\n      SET_STATE(state_urlesc);\n      message.url += ch;\n    }\n    else if (ch > ' ')\n      message.url += ch;\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_urlesc(char ch)\n  {\n    if (isHexDigit(ch))\n    {\n      if (message.url.size() >= 2 && message.url[message.url.size() - 2] == '%')\n      {\n        unsigned v = (valueOfHexDigit(message.url[message.url.size() - 1]) << 4) | valueOfHexDigit(ch);\n        message.url[message.url.size() - 2] = static_cast<char>(v);\n        message.url.resize(message.url.size() - 1);\n        SET_STATE(state_url);\n      }\n      else\n      {\n        message.url += ch;\n      }\n      return false;\n    }\n    else\n    {\n      SET_STATE(state_url);\n      return state_url(ch);\n    }\n  }\n\n  bool HttpRequest::Parser::state_qparam(char ch)\n  {\n    if (ch == ' ' || ch == '\\t')\n    {\n      log_debug(\"queryString=\" << message.queryString);\n      SET_STATE(state_version);\n    }\n    else\n      message.queryString += ch;\n    return false;\n  }\n\n  bool HttpRequest::Parser::state_version(char ch)\n  {\n    if (ch == '\/')\n    {\n      message.setVersion(0, 0);\n      skipWs(&Parser::state_version_major);\n    }\n    else if (ch == '\\r')\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in version\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_version_major(char ch)\n  {\n    if (ch == '.')\n      SET_STATE(state_version_minor0);\n    else if (std::isdigit(ch))\n      message.setVersion(message.getMajorVersion() * 10 + (ch - '0'), message.getMinorVersion());\n    else if (ch == ' ' || ch == '\\t')\n      SET_STATE(state_version_major_sp);\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in version-major\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_version_major_sp(char ch)\n  {\n    if (ch == '.')\n      SET_STATE(state_version_minor0);\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in version-major\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_version_minor0(char ch)\n  {\n    return ch == ' ' || ch == '\\t' ? failedFlag\n                                   : state_version_minor(ch);\n  }\n\n  bool HttpRequest::Parser::state_version_minor(char ch)\n  {\n    if (ch == '\\n')\n      SET_STATE(state_header);\n    else if (ch == ' ' || ch == '\\t' || ch == '\\r')\n      SET_STATE(state_end0);\n    else if (std::isdigit(ch))\n      message.setVersion(message.getMajorVersion(), message.getMinorVersion() * 10 + (ch - '0'));\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in version-minor\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_end0(char ch)\n  {\n    if (ch == '\\n')\n      SET_STATE(state_header);\n    else if (ch != ' ' && ch != '\\t')\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in end\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_header(char ch)\n  {\n    if (headerParser.parse(ch))\n    {\n      if (headerParser.failed())\n      {\n        httpCode = HTTP_BAD_REQUEST;\n        failedFlag = true;\n        return true;\n      }\n\n      const char* content_length_header = message.getHeader(httpheader::contentLength);\n      if (*content_length_header)\n      {\n        bodySize = 0;\n        for (const char* c = content_length_header; *c; ++c)\n        {\n          if (*c > '9' || *c < '0')\n            throw HttpError(HTTP_BAD_REQUEST, \"invalid Content-Length\");\n          bodySize = bodySize * 10 + *c - '0';\n        }\n\n        if (getMaxRequestSize() > 0\n          && getCurrentRequestSize() + bodySize > getMaxRequestSize())\n        {\n          requestSizeExceeded();\n          return true;\n        }\n\n        message.contentSize = bodySize;\n        if (bodySize == 0)\n          return true;\n        else\n        {\n          SET_STATE(state_body);\n          message.body.reserve(bodySize);\n          return false;\n        }\n      }\n\n      return true;\n    }\n\n    return false;\n  }\n\n  bool HttpRequest::Parser::state_body(char ch)\n  {\n    message.body += ch;\n    return --bodySize == 0;\n  }\n\n  void HttpRequest::Parser::requestSizeExceeded()\n  {\n    log_warn(\"max request size \" << getMaxRequestSize() << \" exceeded\");\n    httpCode = HTTP_REQUEST_ENTITY_TOO_LARGE;\n    failedFlag = true;\n  }\n}\n<commit_msg>do not translate '+' to space when parsing urls<commit_after>\/*\n * Copyright (C) 2003-2005 Tommi Maekitalo\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\n\n#include <tnt\/httpparser.h>\n#include <tnt\/httperror.h>\n#include <tnt\/httpheader.h>\n#include <cxxtools\/log.h>\n#include <sstream>\n#include <algorithm>\n\n#define SET_STATE(new_state)  state = &Parser::new_state\n\nnamespace tnt\n{\n  namespace\n  {\n    std::string chartoprint(char ch)\n    {\n      const static char hex[] = \"0123456789abcdef\";\n      if (std::isprint(ch))\n        return std::string(1, '\\'') + ch + '\\'';\n      else\n        return std::string(\"'\\\\x\") + hex[(ch >> 4) & 0xf] + hex[ch & 0xf] + '\\'';\n    }\n\n    inline bool istokenchar(char ch)\n    {\n      static const char s[] = \"\\\"(),\/:;<=>?@[\\\\]{}\";\n      return std::isalpha(ch) || std::binary_search(s, s + sizeof(s) - 1, ch);\n    }\n\n    inline bool isHexDigit(char ch)\n    {\n      return (ch >= '0' && ch <= '9')\n          || (ch >= 'A' && ch <= 'Z')\n          || (ch >= 'a' && ch <= 'z');\n    }\n\n    inline unsigned valueOfHexDigit(char ch)\n    {\n      return ch >= '0' && ch <= '9' ? ch - '0'\n           : ch >= 'a' && ch <= 'z' ? ch - 'a' + 10\n           : ch >= 'A' && ch <= 'Z' ? ch - 'A' + 10\n           : 0;\n    }\n  }\n\n  log_define(\"tntnet.httpmessage.parser\")\n\n  bool RequestSizeMonitor::post(bool ret)\n  {\n    if (++requestSize > HttpRequest::getMaxRequestSize()\n      && HttpRequest::getMaxRequestSize() > 0)\n    {\n      requestSizeExceeded();\n      return true;\n    }\n    return ret;\n  }\n\n  void RequestSizeMonitor::requestSizeExceeded()\n  { }\n\n  void HttpRequest::Parser::reset()\n  {\n    message.clear();\n    SET_STATE(state_cmd0);\n    httpCode = HTTP_OK;\n    failedFlag = false;\n    RequestSizeMonitor::reset();\n    headerParser.reset();\n  }\n\n  bool HttpRequest::Parser::state_cmd0(char ch)\n  {\n    if (istokenchar(ch))\n    {\n      message.method[0] = ch;\n      message.methodLen = 1;\n      SET_STATE(state_cmd);\n    }\n    else if (ch != ' ' && ch != '\\t')\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in method\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_cmd(char ch)\n  {\n    if (istokenchar(ch))\n    {\n      if (message.methodLen >= sizeof(message.method) - 1)\n      {\n        log_debug(\"invalid method field; method=\" << std::string(message.method, message.methodLen) << \", len=\" << message.methodLen);\n        throw HttpError(HTTP_BAD_REQUEST, \"invalid method field\");\n      }\n      message.method[message.methodLen++] = ch;\n    }\n    else if (ch == ' ')\n    {\n      message.method[message.methodLen] = '\\0';\n      log_debug(\"method=\" << message.method);\n      SET_STATE(state_url0);\n    }\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in method\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_url0(char ch)\n  {\n    if (ch == ' ' || ch == '\\t')\n    {\n    }\n    else if (ch == '\/')\n    {\n      message.url.clear();\n      message.url.reserve(32);\n      message.url += ch;\n      SET_STATE(state_url);\n    }\n    else if (std::isalpha(ch))\n    {\n      SET_STATE(state_protocol);\n    }\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_protocol(char ch)\n  {\n    if (ch == ':')\n      SET_STATE(state_protocol_slash1);\n    else if (!std::isalpha(ch))\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_protocol_slash1(char ch)\n  {\n    if (ch == '\/')\n      SET_STATE(state_protocol_slash2);\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_protocol_slash2(char ch)\n  {\n    if (ch == '\/')\n      SET_STATE(state_protocol_host);\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_protocol_host(char ch)\n  {\n    if (ch == '\/')\n    {\n      message.url.clear();\n      message.url.reserve(32);\n      message.url += ch;\n      SET_STATE(state_url);\n    }\n    else if (!std::isalpha(ch)\n           && !std::isdigit(ch)\n           && ch != '['\n           && ch != ']'\n           && ch != '.'\n           && ch != ':')\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_url(char ch)\n  {\n    if (ch == '?')\n    {\n      log_debug(\"url=\" << message.url);\n      SET_STATE(state_qparam);\n    }\n    else if (ch == '\\r')\n    {\n      log_debug(\"url=\" << message.url);\n      SET_STATE(state_end0);\n    }\n    else if (ch == '\\n')\n    {\n      log_debug(\"url=\" << message.url);\n      SET_STATE(state_header);\n    }\n    else if (ch == ' ' || ch == '\\t')\n    {\n      log_debug(\"url=\" << message.url);\n      SET_STATE(state_version);\n    }\n    else if (ch == '%')\n    {\n      SET_STATE(state_urlesc);\n      message.url += ch;\n    }\n    else if (ch > ' ')\n      message.url += ch;\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in url\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_urlesc(char ch)\n  {\n    if (isHexDigit(ch))\n    {\n      if (message.url.size() >= 2 && message.url[message.url.size() - 2] == '%')\n      {\n        unsigned v = (valueOfHexDigit(message.url[message.url.size() - 1]) << 4) | valueOfHexDigit(ch);\n        message.url[message.url.size() - 2] = static_cast<char>(v);\n        message.url.resize(message.url.size() - 1);\n        SET_STATE(state_url);\n      }\n      else\n      {\n        message.url += ch;\n      }\n      return false;\n    }\n    else\n    {\n      SET_STATE(state_url);\n      return state_url(ch);\n    }\n  }\n\n  bool HttpRequest::Parser::state_qparam(char ch)\n  {\n    if (ch == ' ' || ch == '\\t')\n    {\n      log_debug(\"queryString=\" << message.queryString);\n      SET_STATE(state_version);\n    }\n    else\n      message.queryString += ch;\n    return false;\n  }\n\n  bool HttpRequest::Parser::state_version(char ch)\n  {\n    if (ch == '\/')\n    {\n      message.setVersion(0, 0);\n      skipWs(&Parser::state_version_major);\n    }\n    else if (ch == '\\r')\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in version\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_version_major(char ch)\n  {\n    if (ch == '.')\n      SET_STATE(state_version_minor0);\n    else if (std::isdigit(ch))\n      message.setVersion(message.getMajorVersion() * 10 + (ch - '0'), message.getMinorVersion());\n    else if (ch == ' ' || ch == '\\t')\n      SET_STATE(state_version_major_sp);\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in version-major\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_version_major_sp(char ch)\n  {\n    if (ch == '.')\n      SET_STATE(state_version_minor0);\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in version-major\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_version_minor0(char ch)\n  {\n    return ch == ' ' || ch == '\\t' ? failedFlag\n                                   : state_version_minor(ch);\n  }\n\n  bool HttpRequest::Parser::state_version_minor(char ch)\n  {\n    if (ch == '\\n')\n      SET_STATE(state_header);\n    else if (ch == ' ' || ch == '\\t' || ch == '\\r')\n      SET_STATE(state_end0);\n    else if (std::isdigit(ch))\n      message.setVersion(message.getMajorVersion(), message.getMinorVersion() * 10 + (ch - '0'));\n    else\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in version-minor\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_end0(char ch)\n  {\n    if (ch == '\\n')\n      SET_STATE(state_header);\n    else if (ch != ' ' && ch != '\\t')\n    {\n      log_warn(\"invalid character \" << chartoprint(ch) << \" in end\");\n      httpCode = HTTP_BAD_REQUEST;\n      failedFlag = true;\n    }\n    return failedFlag;\n  }\n\n  bool HttpRequest::Parser::state_header(char ch)\n  {\n    if (headerParser.parse(ch))\n    {\n      if (headerParser.failed())\n      {\n        httpCode = HTTP_BAD_REQUEST;\n        failedFlag = true;\n        return true;\n      }\n\n      const char* content_length_header = message.getHeader(httpheader::contentLength);\n      if (*content_length_header)\n      {\n        bodySize = 0;\n        for (const char* c = content_length_header; *c; ++c)\n        {\n          if (*c > '9' || *c < '0')\n            throw HttpError(HTTP_BAD_REQUEST, \"invalid Content-Length\");\n          bodySize = bodySize * 10 + *c - '0';\n        }\n\n        if (getMaxRequestSize() > 0\n          && getCurrentRequestSize() + bodySize > getMaxRequestSize())\n        {\n          requestSizeExceeded();\n          return true;\n        }\n\n        message.contentSize = bodySize;\n        if (bodySize == 0)\n          return true;\n        else\n        {\n          SET_STATE(state_body);\n          message.body.reserve(bodySize);\n          return false;\n        }\n      }\n\n      return true;\n    }\n\n    return false;\n  }\n\n  bool HttpRequest::Parser::state_body(char ch)\n  {\n    message.body += ch;\n    return --bodySize == 0;\n  }\n\n  void HttpRequest::Parser::requestSizeExceeded()\n  {\n    log_warn(\"max request size \" << getMaxRequestSize() << \" exceeded\");\n    httpCode = HTTP_REQUEST_ENTITY_TOO_LARGE;\n    failedFlag = true;\n  }\n}\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 <cstring>\n\n#include <folly\/experimental\/TestUtil.h>\n#include <folly\/experimental\/symbolizer\/StackTrace.h>\n#include <folly\/experimental\/symbolizer\/Symbolizer.h>\n\n#include <glog\/logging.h>\n\n#include <folly\/portability\/GTest.h>\n\nusing namespace folly;\nusing namespace folly::symbolizer;\n\nFOLLY_NOINLINE void foo1();\nFOLLY_NOINLINE void foo2();\n\nvoid verifyStackTraces() {\n  constexpr size_t kMaxAddresses = 100;\n  FrameArray<kMaxAddresses> fa;\n  CHECK(getStackTrace(fa));\n\n  FrameArray<kMaxAddresses> faSafe;\n  CHECK(getStackTraceSafe(faSafe));\n\n  CHECK_EQ(fa.frameCount, faSafe.frameCount);\n\n  if (VLOG_IS_ON(1)) {\n    Symbolizer symbolizer;\n    OStreamSymbolizePrinter printer(std::cerr, SymbolizePrinter::COLOR_IF_TTY);\n\n    symbolizer.symbolize(fa);\n    VLOG(1) << \"getStackTrace\\n\";\n    printer.println(fa);\n\n    symbolizer.symbolize(faSafe);\n    VLOG(1) << \"getStackTraceSafe\\n\";\n    printer.println(faSafe);\n  }\n\n  \/\/ Other than the top 2 frames (this one and getStackTrace \/\n  \/\/ getStackTraceSafe), the stack traces should be identical\n  for (size_t i = 2; i < fa.frameCount; ++i) {\n    LOG(INFO) << \"i=\" << i << \" \" << std::hex << \"0x\" << fa.addresses[i]\n              << \" 0x\" << faSafe.addresses[i];\n    EXPECT_EQ(fa.addresses[i], faSafe.addresses[i]);\n  }\n}\n\nvoid foo1() {\n  foo2();\n}\n\nvoid foo2() {\n  verifyStackTraces();\n}\n\nvolatile bool handled = false;\nvoid handler(int \/* num *\/, siginfo_t* \/* info *\/, void* \/* ctx *\/) {\n  \/\/ Yes, getStackTrace and VLOG aren't async-signal-safe, but signals\n  \/\/ raised with raise() aren't \"async\" signals.\n  foo1();\n  handled = true;\n}\n\nTEST(StackTraceTest, Simple) {\n  foo1();\n}\n\nTEST(StackTraceTest, Signal) {\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(sa));\n  sa.sa_sigaction = handler;\n  sa.sa_flags = SA_RESETHAND | SA_SIGINFO;\n  CHECK_ERR(sigaction(SIGUSR1, &sa, nullptr));\n  raise(SIGUSR1);\n  EXPECT_TRUE(handled);\n}\n\nssize_t read_all(int fd, uint8_t* buffer, size_t size) {\n  uint8_t* pos = buffer;\n  ssize_t bytes_read;\n  do {\n    bytes_read = read(fd, pos, size);\n    if (bytes_read < 0) {\n      if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR) {\n        continue;\n      }\n      return bytes_read;\n    }\n\n    pos += bytes_read;\n    size -= bytes_read;\n  } while (bytes_read > 0 && size > 0);\n\n  return pos - buffer;\n}\n\n\/\/ Returns the position in the file after done reading.\noff_t get_stack_trace(int fd, size_t file_pos, uint8_t* buffer, size_t count) {\n  off_t rv = lseek(fd, file_pos, SEEK_SET);\n  assert(rv == (off_t)file_pos);\n\n  \/\/ Subtract 1 from size of buffer to hold nullptr.\n  ssize_t bytes_read = read_all(fd, buffer, count - 1);\n  assert(bytes_read > 0);\n  buffer[bytes_read] = '\\0';\n  return lseek(fd, 0, SEEK_CUR);\n}\n\ntemplate <class StackTracePrinter>\nvoid testStackTracePrinter(StackTracePrinter& printer, int fd) {\n  ASSERT_GT(fd, 0);\n\n  printer.printStackTrace(true);\n  printer.flush();\n\n  std::array<uint8_t, 4000> first;\n  off_t pos = get_stack_trace(fd, 0, first.data(), first.size());\n  ASSERT_GT(pos, 0);\n\n  printer.printStackTrace(true);\n  printer.flush();\n\n  std::array<uint8_t, 4000> second;\n  get_stack_trace(fd, pos, second.data(), second.size());\n\n  \/\/ The first two lines refer to this stack frame, which is different in the\n  \/\/ two cases, so strip those off.  The rest should be equal.\n  ASSERT_STREQ(\n      strchr(strchr((const char*)first.data(), '\\n') + 1, '\\n') + 1,\n      strchr(strchr((const char*)second.data(), '\\n') + 1, '\\n') + 1);\n}\n\nTEST(StackTraceTest, SafeStackTracePrinter) {\n  test::TemporaryFile file;\n\n  SafeStackTracePrinter printer{10, file.fd()};\n\n  testStackTracePrinter<SafeStackTracePrinter>(printer, file.fd());\n}\n\nTEST(StackTraceTest, FastStackTracePrinter) {\n  test::TemporaryFile file;\n\n  FastStackTracePrinter printer{\n      std::make_unique<FDSymbolizePrinter>(file.fd())};\n\n  testStackTracePrinter<FastStackTracePrinter>(printer, file.fd());\n}\n<commit_msg>Fix broken opt build due to \"error: unused variable 'rv'\"<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 <cstring>\n\n#include <folly\/experimental\/TestUtil.h>\n#include <folly\/experimental\/symbolizer\/StackTrace.h>\n#include <folly\/experimental\/symbolizer\/Symbolizer.h>\n\n#include <glog\/logging.h>\n\n#include <folly\/portability\/GTest.h>\n\nusing namespace folly;\nusing namespace folly::symbolizer;\n\nFOLLY_NOINLINE void foo1();\nFOLLY_NOINLINE void foo2();\n\nvoid verifyStackTraces() {\n  constexpr size_t kMaxAddresses = 100;\n  FrameArray<kMaxAddresses> fa;\n  CHECK(getStackTrace(fa));\n\n  FrameArray<kMaxAddresses> faSafe;\n  CHECK(getStackTraceSafe(faSafe));\n\n  CHECK_EQ(fa.frameCount, faSafe.frameCount);\n\n  if (VLOG_IS_ON(1)) {\n    Symbolizer symbolizer;\n    OStreamSymbolizePrinter printer(std::cerr, SymbolizePrinter::COLOR_IF_TTY);\n\n    symbolizer.symbolize(fa);\n    VLOG(1) << \"getStackTrace\\n\";\n    printer.println(fa);\n\n    symbolizer.symbolize(faSafe);\n    VLOG(1) << \"getStackTraceSafe\\n\";\n    printer.println(faSafe);\n  }\n\n  \/\/ Other than the top 2 frames (this one and getStackTrace \/\n  \/\/ getStackTraceSafe), the stack traces should be identical\n  for (size_t i = 2; i < fa.frameCount; ++i) {\n    LOG(INFO) << \"i=\" << i << \" \" << std::hex << \"0x\" << fa.addresses[i]\n              << \" 0x\" << faSafe.addresses[i];\n    EXPECT_EQ(fa.addresses[i], faSafe.addresses[i]);\n  }\n}\n\nvoid foo1() {\n  foo2();\n}\n\nvoid foo2() {\n  verifyStackTraces();\n}\n\nvolatile bool handled = false;\nvoid handler(int \/* num *\/, siginfo_t* \/* info *\/, void* \/* ctx *\/) {\n  \/\/ Yes, getStackTrace and VLOG aren't async-signal-safe, but signals\n  \/\/ raised with raise() aren't \"async\" signals.\n  foo1();\n  handled = true;\n}\n\nTEST(StackTraceTest, Simple) {\n  foo1();\n}\n\nTEST(StackTraceTest, Signal) {\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(sa));\n  sa.sa_sigaction = handler;\n  sa.sa_flags = SA_RESETHAND | SA_SIGINFO;\n  CHECK_ERR(sigaction(SIGUSR1, &sa, nullptr));\n  raise(SIGUSR1);\n  EXPECT_TRUE(handled);\n}\n\nssize_t read_all(int fd, uint8_t* buffer, size_t size) {\n  uint8_t* pos = buffer;\n  ssize_t bytes_read;\n  do {\n    bytes_read = read(fd, pos, size);\n    if (bytes_read < 0) {\n      if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR) {\n        continue;\n      }\n      return bytes_read;\n    }\n\n    pos += bytes_read;\n    size -= bytes_read;\n  } while (bytes_read > 0 && size > 0);\n\n  return pos - buffer;\n}\n\n\/\/ Returns the position in the file after done reading.\noff_t get_stack_trace(int fd, size_t file_pos, uint8_t* buffer, size_t count) {\n  off_t rv = lseek(fd, file_pos, SEEK_SET);\n  CHECK_EQ(rv, (off_t)file_pos);\n\n  \/\/ Subtract 1 from size of buffer to hold nullptr.\n  ssize_t bytes_read = read_all(fd, buffer, count - 1);\n  CHECK_GT(bytes_read, 0);\n  buffer[bytes_read] = '\\0';\n  return lseek(fd, 0, SEEK_CUR);\n}\n\ntemplate <class StackTracePrinter>\nvoid testStackTracePrinter(StackTracePrinter& printer, int fd) {\n  ASSERT_GT(fd, 0);\n\n  printer.printStackTrace(true);\n  printer.flush();\n\n  std::array<uint8_t, 4000> first;\n  off_t pos = get_stack_trace(fd, 0, first.data(), first.size());\n  ASSERT_GT(pos, 0);\n\n  printer.printStackTrace(true);\n  printer.flush();\n\n  std::array<uint8_t, 4000> second;\n  get_stack_trace(fd, pos, second.data(), second.size());\n\n  \/\/ The first two lines refer to this stack frame, which is different in the\n  \/\/ two cases, so strip those off.  The rest should be equal.\n  ASSERT_STREQ(\n      strchr(strchr((const char*)first.data(), '\\n') + 1, '\\n') + 1,\n      strchr(strchr((const char*)second.data(), '\\n') + 1, '\\n') + 1);\n}\n\nTEST(StackTraceTest, SafeStackTracePrinter) {\n  test::TemporaryFile file;\n\n  SafeStackTracePrinter printer{10, file.fd()};\n\n  testStackTracePrinter<SafeStackTracePrinter>(printer, file.fd());\n}\n\nTEST(StackTraceTest, FastStackTracePrinter) {\n  test::TemporaryFile file;\n\n  FastStackTracePrinter printer{\n      std::make_unique<FDSymbolizePrinter>(file.fd())};\n\n  testStackTracePrinter<FastStackTracePrinter>(printer, file.fd());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"s3propparser.hpp\"\n#include <utils\/davix_s3_utils.hpp>\n\n#include <stack>\n#include <utils\/davix_logger_internal.hpp>\n\n\nnamespace Davix{\n\nconst std::string col_prop = \"Name\";\nconst std::string delimiter_prop =\"Contents\";\nconst std::string name_prop = \"Key\";\nconst std::string size_prop = \"Size\";\n\nconst std::string prefix_prop = \"Prefix\";\nconst std::string com_prefix_prop = \"CommonPrefixes\";\nconst std::string listbucketresult_prop = \"ListBucketResult\";\nconst std::string last_modified_prop = \"LastModified\";\n\nstruct S3PropParser::Internal{\n    std::string current;\n    std::string prefix;\n    std::string prefix_to_remove;\n    bool inside_com_prefix;\n    int prop_count;\n    std::stack<std::string> stack_status;\n    std::deque<FileProperties> props;\n\n    FileProperties property;\n    S3ListingMode::S3ListingMode _s3_listing_mode;\n\n    int start_elem(const std::string &elem){\n        \/\/ new tag, clean content;\n        current.clear();\n\n        \/\/ check XML nested level, security protection\n        if(stack_status.size() < 200){\n            stack_status.push(elem);\n        }else{\n            throw DavixException(davix_scope_xml_parser(), StatusCode::ParsingError, \"Impossible to parse S3 content, corrupted XML\");\n        }\n\n        \/\/ check element, if collection name add first entry\n        if( StrUtil::compare_ncase(col_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"collection found\", elem.c_str());\n            property.clear();\n            prop_count = 0;\n        }\n\n        \/\/ check element, if new entry clear current entry\n        if( StrUtil::compare_ncase(delimiter_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"new element found\", elem.c_str());\n            property.clear();\n        }\n\n        \/\/ check element, if common prefixes set flag\n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && StrUtil::compare_ncase(com_prefix_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"common prefixes found\", elem.c_str());\n            inside_com_prefix = true;\n        }\n\n        \/\/ check element, if prefix clear current entry\n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && StrUtil::compare_ncase(prefix_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"prefix found\", elem.c_str());\n            property.clear();\n        }\n\n        return 1;\n    }\n\n    int add_chunk(const std::string & chunk){\n        current.append(chunk);\n        return 0;\n    }\n\n    int end_elem(const std::string &elem){\n        StrUtil::trim(current);\n\n        \/\/ found prefix \n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && \n                StrUtil::compare_ncase(prefix_prop, elem) ==0 && \n                !current.empty()){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"new prefix {}\", current.c_str());\n            prefix = current;\n            if(inside_com_prefix){  \/\/ all keys would have been processed by now, just common prefixes left, use as DIRs\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"push new common prefix {}\", current.c_str());\n                current = current.erase(current.size()-1,1);\n                property.filename = current.erase(0, prefix_to_remove.size());\n                property.info.mode =  0755 | S_IFDIR;\n                property.info.mode &= ~(S_IFREG);\n                props.push_back(property);\n                prop_count++;\n            }\n        }\n\n        \/\/ new name new fileprop\n        if( StrUtil::compare_ncase(name_prop, elem) ==0){\n\n            if((_s3_listing_mode == S3ListingMode::Flat)){  \/\/ flat mode\n                property.filename = current.erase(0,prefix.size());\n            }\n            else if(prefix.empty()){    \/\/ at root level\n                property.filename = current;\n            }\n            else if(!prefix.empty()){\n                if(prefix.compare((prefix.size()-1),1,\"\/\")){ \/\/ prefix doesn't end with '\/', file\n                    property.filename = current;\n                }\n                else if(!(StrUtil::compare_ncase(prefix, current) ==0)){ \/\/ folder   \n                    property.filename = current.erase(0, prefix_to_remove.size());\n\n                }\n            }\n\n            if(!property.filename.empty())\n                property.info.mode = 0755;\n        }\n\n        if( StrUtil::compare_ncase(size_prop, elem) ==0){\n            try{\n                dav_size_t size = toType<dav_size_t, std::string>()(current);\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"element size {}\", size);\n                property.info.size = size;\n            }catch(...){\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"Unable to parse element size\");\n            }\n        }\n\n        if( StrUtil::compare_ncase(last_modified_prop, elem) ==0){\n            try{\n                time_t mtime = S3::s3TimeConverter(current);\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"element LastModified {}\", current);\n                property.info.mtime = mtime;\n                property.info.ctime = mtime;\n            }catch(...){\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"Unable to parse element LastModified\");\n            }\n        }\n\n        \/\/ found bucket name\n        \/\/ push it as first item to identify bucket\n        if( StrUtil::compare_ncase(col_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"push collection\", elem.c_str());\n            property.filename = current;\n            property.info.mode |= S_IFDIR;\n            property.info.mode &= ~(S_IFREG);\n            props.push_back(property);\n        }\n\n        \/\/ check element, if end entry push new entry\n        if( StrUtil::compare_ncase(delimiter_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"push new element {}\", elem.c_str());\n            props.push_back(property);\n            prop_count++;\n        }\n\n        \/\/ check element, if end common prefix reset flag\n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && StrUtil::compare_ncase(com_prefix_prop, elem) ==0){\n            inside_com_prefix = false;\n        }\n       \n        \/\/ end of xml respond and still no property, requested key exists but isn't a directory\n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && (StrUtil::compare_ncase(listbucketresult_prop, elem) ==0) && (prop_count ==0) ){\n            throw DavixException(davix_scope_directory_listing_str(), StatusCode::IsNotADirectory, \"Not a S3 directory\");\n        }\n\n        \/\/ reduce stack size\n        if(stack_status.size() > 0)\n            stack_status.pop();\n        current.clear();\n        return 0;\n    }\n\n};\n\nS3PropParser::S3PropParser() : d_ptr(new Internal())\n{\n    S3PropParser(S3ListingMode::Hierarchical, \"\");\n}\n\n\nS3PropParser::S3PropParser(S3ListingMode::S3ListingMode s3_listing_mode = S3ListingMode::Hierarchical) : d_ptr(new Internal())\n{\n    S3PropParser(s3_listing_mode, \"\");\n}\n\n\nS3PropParser::S3PropParser(S3ListingMode::S3ListingMode s3_listing_mode = S3ListingMode::Hierarchical, std::string s3_prefix = \"\") : d_ptr(new Internal())\n{\n    d_ptr->_s3_listing_mode = s3_listing_mode;\n\n    if(!s3_prefix.empty()){\n        if(s3_prefix.compare(s3_prefix.size()-1,1,\"\/\")==0)\n            d_ptr->prefix_to_remove = s3_prefix.erase(0,1);\n        else\n            d_ptr->prefix_to_remove = s3_prefix;\n    }\n}\n\n\nS3PropParser::~S3PropParser(){\n}\n\n\nint S3PropParser::parserStartElemCb(int parent, const char *nspace, const char *name, const char **atts){\n    (void) parent;\n    (void) nspace;\n    (void) atts;\n    return d_ptr->start_elem(std::string(name));\n\n}\n\nint S3PropParser::parserCdataCb(int state, const char *cdata, size_t len){\n    (void) state;\n    (void) len;\n    return d_ptr->add_chunk(std::string(cdata, len));\n}\n\nint S3PropParser::parserEndElemCb(int state, const char *nspace, const char *name){\n    (void) state;\n    (void) nspace;\n    return d_ptr->end_elem(std::string(name));\n}\n\nstd::deque<FileProperties> & S3PropParser::getProperties(){\n    return d_ptr->props;\n}\n\n\n}\n<commit_msg>Remove defaults inside s3propparser.cpp<commit_after>#include \"s3propparser.hpp\"\n#include <utils\/davix_s3_utils.hpp>\n\n#include <stack>\n#include <utils\/davix_logger_internal.hpp>\n\n\nnamespace Davix{\n\nconst std::string col_prop = \"Name\";\nconst std::string delimiter_prop =\"Contents\";\nconst std::string name_prop = \"Key\";\nconst std::string size_prop = \"Size\";\n\nconst std::string prefix_prop = \"Prefix\";\nconst std::string com_prefix_prop = \"CommonPrefixes\";\nconst std::string listbucketresult_prop = \"ListBucketResult\";\nconst std::string last_modified_prop = \"LastModified\";\n\nstruct S3PropParser::Internal{\n    std::string current;\n    std::string prefix;\n    std::string prefix_to_remove;\n    bool inside_com_prefix;\n    int prop_count;\n    std::stack<std::string> stack_status;\n    std::deque<FileProperties> props;\n\n    FileProperties property;\n    S3ListingMode::S3ListingMode _s3_listing_mode;\n\n    int start_elem(const std::string &elem){\n        \/\/ new tag, clean content;\n        current.clear();\n\n        \/\/ check XML nested level, security protection\n        if(stack_status.size() < 200){\n            stack_status.push(elem);\n        }else{\n            throw DavixException(davix_scope_xml_parser(), StatusCode::ParsingError, \"Impossible to parse S3 content, corrupted XML\");\n        }\n\n        \/\/ check element, if collection name add first entry\n        if( StrUtil::compare_ncase(col_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"collection found\", elem.c_str());\n            property.clear();\n            prop_count = 0;\n        }\n\n        \/\/ check element, if new entry clear current entry\n        if( StrUtil::compare_ncase(delimiter_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"new element found\", elem.c_str());\n            property.clear();\n        }\n\n        \/\/ check element, if common prefixes set flag\n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && StrUtil::compare_ncase(com_prefix_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"common prefixes found\", elem.c_str());\n            inside_com_prefix = true;\n        }\n\n        \/\/ check element, if prefix clear current entry\n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && StrUtil::compare_ncase(prefix_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"prefix found\", elem.c_str());\n            property.clear();\n        }\n\n        return 1;\n    }\n\n    int add_chunk(const std::string & chunk){\n        current.append(chunk);\n        return 0;\n    }\n\n    int end_elem(const std::string &elem){\n        StrUtil::trim(current);\n\n        \/\/ found prefix \n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && \n                StrUtil::compare_ncase(prefix_prop, elem) ==0 && \n                !current.empty()){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"new prefix {}\", current.c_str());\n            prefix = current;\n            if(inside_com_prefix){  \/\/ all keys would have been processed by now, just common prefixes left, use as DIRs\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"push new common prefix {}\", current.c_str());\n                current = current.erase(current.size()-1,1);\n                property.filename = current.erase(0, prefix_to_remove.size());\n                property.info.mode =  0755 | S_IFDIR;\n                property.info.mode &= ~(S_IFREG);\n                props.push_back(property);\n                prop_count++;\n            }\n        }\n\n        \/\/ new name new fileprop\n        if( StrUtil::compare_ncase(name_prop, elem) ==0){\n\n            if((_s3_listing_mode == S3ListingMode::Flat)){  \/\/ flat mode\n                property.filename = current.erase(0,prefix.size());\n            }\n            else if(prefix.empty()){    \/\/ at root level\n                property.filename = current;\n            }\n            else if(!prefix.empty()){\n                if(prefix.compare((prefix.size()-1),1,\"\/\")){ \/\/ prefix doesn't end with '\/', file\n                    property.filename = current;\n                }\n                else if(!(StrUtil::compare_ncase(prefix, current) ==0)){ \/\/ folder   \n                    property.filename = current.erase(0, prefix_to_remove.size());\n\n                }\n            }\n\n            if(!property.filename.empty())\n                property.info.mode = 0755;\n        }\n\n        if( StrUtil::compare_ncase(size_prop, elem) ==0){\n            try{\n                dav_size_t size = toType<dav_size_t, std::string>()(current);\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"element size {}\", size);\n                property.info.size = size;\n            }catch(...){\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"Unable to parse element size\");\n            }\n        }\n\n        if( StrUtil::compare_ncase(last_modified_prop, elem) ==0){\n            try{\n                time_t mtime = S3::s3TimeConverter(current);\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"element LastModified {}\", current);\n                property.info.mtime = mtime;\n                property.info.ctime = mtime;\n            }catch(...){\n                DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"Unable to parse element LastModified\");\n            }\n        }\n\n        \/\/ found bucket name\n        \/\/ push it as first item to identify bucket\n        if( StrUtil::compare_ncase(col_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"push collection\", elem.c_str());\n            property.filename = current;\n            property.info.mode |= S_IFDIR;\n            property.info.mode &= ~(S_IFREG);\n            props.push_back(property);\n        }\n\n        \/\/ check element, if end entry push new entry\n        if( StrUtil::compare_ncase(delimiter_prop, elem) ==0){\n            DAVIX_SLOG(DAVIX_LOG_TRACE, DAVIX_LOG_XML, \"push new element {}\", elem.c_str());\n            props.push_back(property);\n            prop_count++;\n        }\n\n        \/\/ check element, if end common prefix reset flag\n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && StrUtil::compare_ncase(com_prefix_prop, elem) ==0){\n            inside_com_prefix = false;\n        }\n       \n        \/\/ end of xml respond and still no property, requested key exists but isn't a directory\n        if( (_s3_listing_mode == S3ListingMode::Hierarchical) && (StrUtil::compare_ncase(listbucketresult_prop, elem) ==0) && (prop_count ==0) ){\n            throw DavixException(davix_scope_directory_listing_str(), StatusCode::IsNotADirectory, \"Not a S3 directory\");\n        }\n\n        \/\/ reduce stack size\n        if(stack_status.size() > 0)\n            stack_status.pop();\n        current.clear();\n        return 0;\n    }\n\n};\n\nS3PropParser::S3PropParser() : d_ptr(new Internal())\n{\n    S3PropParser(S3ListingMode::Hierarchical, \"\");\n}\n\n\nS3PropParser::S3PropParser(S3ListingMode::S3ListingMode s3_listing_mode) : d_ptr(new Internal())\n{\n    S3PropParser(s3_listing_mode, \"\");\n}\n\n\nS3PropParser::S3PropParser(S3ListingMode::S3ListingMode s3_listing_mode, std::string s3_prefix) : d_ptr(new Internal())\n{\n    d_ptr->_s3_listing_mode = s3_listing_mode;\n\n    if(!s3_prefix.empty()){\n        if(s3_prefix.compare(s3_prefix.size()-1,1,\"\/\")==0)\n            d_ptr->prefix_to_remove = s3_prefix.erase(0,1);\n        else\n            d_ptr->prefix_to_remove = s3_prefix;\n    }\n}\n\n\nS3PropParser::~S3PropParser(){\n}\n\n\nint S3PropParser::parserStartElemCb(int parent, const char *nspace, const char *name, const char **atts){\n    (void) parent;\n    (void) nspace;\n    (void) atts;\n    return d_ptr->start_elem(std::string(name));\n\n}\n\nint S3PropParser::parserCdataCb(int state, const char *cdata, size_t len){\n    (void) state;\n    (void) len;\n    return d_ptr->add_chunk(std::string(cdata, len));\n}\n\nint S3PropParser::parserEndElemCb(int state, const char *nspace, const char *name){\n    (void) state;\n    (void) nspace;\n    return d_ptr->end_elem(std::string(name));\n}\n\nstd::deque<FileProperties> & S3PropParser::getProperties(){\n    return d_ptr->props;\n}\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2010  Timo Savola\n *\/\n\n#ifndef CIO_CHANNEL_HPP\n#define CIO_CHANNEL_HPP\n\n#include \"channel.h\"\n\n#include <cassert>\n#include <cstring>\n#include <stdexcept>\n\nnamespace cio {\n\n\/**\n * @defgroup channel_cpp Channel (C++)\n * @code #include <cio\/channel.hpp> @endcode\n * @{\n *\/\n\ntemplate <typename T>\nclass channel\n{\n\tstruct cio_channel *c;\n\npublic:\n\t\/**\n\t * Create a new channel.\n\t *\/\n\tchannel() throw (std::bad_alloc) : c(cio_channel_create(sizeof (T)))\n\t{\n\t\tif (!c)\n\t\t\tthrow std::bad_alloc();\n\t}\n\n\t\/**\n\t * Steal a reference to a C channel object.\n\t *\n\t * @pre Item size of @p c_ptr must match @b T\n\t *\/\n\texplicit channel(struct cio_channel *c_ptr) throw () : c(c_ptr)\n\t{\n\t\tassert(cio_channel_item_size(c_ptr) == sizeof (T));\n\t}\n\n\t\/**\n\t * Reference an existing channel.\n\t *\/\n\tchannel(channel &other) throw () : c(other.c)\n\t{\n\t\tcio_channel_ref(c);\n\t}\n\n\t\/**\n\t * Unreference the channel.\n\t *\/\n\t~channel() throw ()\n\t{\n\t\tcio_channel_unref(c);\n\t}\n\n\t\/**\n\t * Drop the existing reference and reference another channel.\n\t *\/\n\tchannel &operator=(channel &other) throw ()\n\t{\n\t\tcio_channel_unref(c);\n\t\tc = other.c;\n\t\tcio_channel_ref(c);\n\t\treturn *this;\n\t}\n\n\t\/**\n\t * @see cio_channel_close\n\t *\/\n\tvoid close() throw ()\n\t{\n\t\tcio_channel_close(c);\n\t}\n\n\t\/**\n\t * @see cio_read\n\t *\/\n\tbool read(T &item)\n\t{\n\t\tint ret = cio_channel_read(c, reinterpret_cast<void *> (&item), sizeof (T));\n\t\tif (ret < 0)\n\t\t\tthrow std::runtime_error(std::strerror(errno));\n\t\treturn ret != 0;\n\t}\n\n\t\/**\n\t * @see cio_write\n\t *\/\n\tbool write(const T &item)\n\t{\n\t\tint ret = cio_channel_write(c, reinterpret_cast<const void *> (&item), sizeof (T));\n\t\tif (ret < 0)\n\t\t\tthrow std::runtime_error(std::strerror(errno));\n\t\treturn ret != 0;\n\t}\n\n\t\/**\n\t * @return a shared reference to the C channel object\n\t *\/\n\tstruct cio_channel *c_ptr() throw ()\n\t{\n\t\treturn c;\n\t}\n\n\tclass iterator\n\t{\n\t\tfriend class channel;\n\n\t\tchannel *c;\n\t\tmutable T item;\n\n\t\texplicit iterator(channel *c_) : c(c_)\n\t\t{\n\t\t\toperator++();\n\t\t}\n\n\t\titerator() throw () : c(0)\n\t\t{\n\t\t}\n\n\tpublic:\n\t\tT operator*() const throw ()\n\t\t{\n\t\t\treturn item;\n\t\t}\n\n\t\tT &operator->() const throw ()\n\t\t{\n\t\t\treturn item;\n\t\t}\n\n\t\tT &operator++()\n\t\t{\n\t\t\tif (!c->read(item))\n\t\t\t\tc = 0;\n\t\t\treturn item;\n\t\t}\n\n\t\tT operator++(int)\n\t\t{\n\t\t\tT copy = item;\n\t\t\tif (!c->read(item))\n\t\t\t\tc = 0;\n\t\t\treturn copy;\n\t\t}\n\n\t\tbool operator==(const iterator &other) const throw ()\n\t\t{\n\t\t\treturn !c && !other.c;\n\t\t}\n\n\t\tbool operator!=(const iterator &other) const throw ()\n\t\t{\n\t\t\treturn !operator==(other);\n\t\t}\n\t};\n\n\titerator begin()\n\t{\n\t\treturn iterator(this);\n\t}\n\n\titerator end() throw ()\n\t{\n\t\treturn iterator();\n\t}\n};\n\n\/** @} *\/\n\n} \/\/ namespace cio\n\n#endif\n<commit_msg>fix channel C++ iterator<commit_after>\/*\n * Copyright (c) 2010  Timo Savola\n *\/\n\n#ifndef CIO_CHANNEL_HPP\n#define CIO_CHANNEL_HPP\n\n#include \"channel.h\"\n\n#include <cassert>\n#include <cstring>\n#include <stdexcept>\n\nnamespace cio {\n\n\/**\n * @defgroup channel_cpp Channel (C++)\n * @code #include <cio\/channel.hpp> @endcode\n * @{\n *\/\n\ntemplate <typename T>\nclass channel\n{\n\tstruct cio_channel *c;\n\npublic:\n\t\/**\n\t * Create a new channel.\n\t *\/\n\tchannel() throw (std::bad_alloc) : c(cio_channel_create(sizeof (T)))\n\t{\n\t\tif (!c)\n\t\t\tthrow std::bad_alloc();\n\t}\n\n\t\/**\n\t * Steal a reference to a C channel object.\n\t *\n\t * @pre Item size of @p c_ptr must match @b T\n\t *\/\n\texplicit channel(struct cio_channel *c_ptr) throw () : c(c_ptr)\n\t{\n\t\tassert(cio_channel_item_size(c_ptr) == sizeof (T));\n\t}\n\n\t\/**\n\t * Reference an existing channel.\n\t *\/\n\tchannel(channel &other) throw () : c(other.c)\n\t{\n\t\tcio_channel_ref(c);\n\t}\n\n\t\/**\n\t * Unreference the channel.\n\t *\/\n\t~channel() throw ()\n\t{\n\t\tcio_channel_unref(c);\n\t}\n\n\t\/**\n\t * Drop the existing reference and reference another channel.\n\t *\/\n\tchannel &operator=(channel &other) throw ()\n\t{\n\t\tcio_channel_unref(c);\n\t\tc = other.c;\n\t\tcio_channel_ref(c);\n\t\treturn *this;\n\t}\n\n\t\/**\n\t * @see cio_channel_close\n\t *\/\n\tvoid close() throw ()\n\t{\n\t\tcio_channel_close(c);\n\t}\n\n\t\/**\n\t * @see cio_read\n\t *\/\n\tbool read(T &item)\n\t{\n\t\tint ret = cio_channel_read(c, reinterpret_cast<void *> (&item), sizeof (T));\n\t\tif (ret < 0)\n\t\t\tthrow std::runtime_error(std::strerror(errno));\n\t\treturn ret != 0;\n\t}\n\n\t\/**\n\t * @see cio_write\n\t *\/\n\tbool write(const T &item)\n\t{\n\t\tint ret = cio_channel_write(c, reinterpret_cast<const void *> (&item), sizeof (T));\n\t\tif (ret < 0)\n\t\t\tthrow std::runtime_error(std::strerror(errno));\n\t\treturn ret != 0;\n\t}\n\n\t\/**\n\t * @return a shared reference to the C channel object\n\t *\/\n\tstruct cio_channel *c_ptr() throw ()\n\t{\n\t\treturn c;\n\t}\n\n\tclass iterator\n\t{\n\t\tfriend class channel;\n\n\t\tchannel *c;\n\t\tmutable T item;\n\n\t\texplicit iterator(channel *c_) : c(c_)\n\t\t{\n\t\t\toperator++();\n\t\t}\n\n\t\titerator() throw () : c(0)\n\t\t{\n\t\t}\n\n\tpublic:\n\t\tT operator*() const throw ()\n\t\t{\n\t\t\treturn item;\n\t\t}\n\n\t\tT *operator->() const throw ()\n\t\t{\n\t\t\treturn &item;\n\t\t}\n\n\t\tT &operator++()\n\t\t{\n\t\t\tif (!c->read(item))\n\t\t\t\tc = 0;\n\t\t\treturn item;\n\t\t}\n\n\t\tT operator++(int)\n\t\t{\n\t\t\tT copy = item;\n\t\t\tif (!c->read(item))\n\t\t\t\tc = 0;\n\t\t\treturn copy;\n\t\t}\n\n\t\tbool operator==(const iterator &other) const throw ()\n\t\t{\n\t\t\treturn !c && !other.c;\n\t\t}\n\n\t\tbool operator!=(const iterator &other) const throw ()\n\t\t{\n\t\t\treturn !operator==(other);\n\t\t}\n\t};\n\n\titerator begin()\n\t{\n\t\treturn iterator(this);\n\t}\n\n\titerator end() throw ()\n\t{\n\t\treturn iterator();\n\t}\n};\n\n\/** @} *\/\n\n} \/\/ namespace cio\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KitchenSync.\n\n    Copyright (c) 2004 Cornelius Schumacher <schumacher@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 \"remotekonnector.h\"\n\n#include \"remotekonnectorconfig.h\"\n\n#include <calendarsyncee.h>\n#include <addressbooksyncee.h>\n#include <bookmarksyncee.h>\n\n#include <kabc\/vcardconverter.h>\n#include <libkcal\/icalformat.h>\n\n#include <konnectorinfo.h>\n#include <kapabilities.h>\n\n#include <kconfig.h>\n#include <kgenericfactory.h>\n\nusing namespace KSync;\nusing namespace KABC;\nusing namespace KCal;\n\nextern \"C\"\n{\n  void *init_libremotekonnector()\n  {\n    return new KRES::PluginFactory<RemoteKonnector,RemoteKonnectorConfig>();\n  }\n}\n\n\nRemoteKonnector::RemoteKonnector( const KConfig *config )\n    : Konnector( config ), mConfigWidget( 0 )\n{\n  if ( config ) {\n    mCalendarUrl = config->readPathEntry( \"CalendarUrl\" );\n    mAddressBookUrl = config->readPathEntry( \"AddressBookUrl\" );\n    mBookmarkUrl = config->readPathEntry( \"BookmarkUrl\" );\n  }\n\n  mAddressBookSyncee =\tnew AddressBookSyncee( &mAddressBook );\n  mAddressBookSyncee->setSource( i18n( \"Remote\" ) );\n  mCalendarSyncee = new CalendarSyncee( &mCalendar );\n  mCalendarSyncee->setSource( i18n( \"Remote\" ) );\n  \n  mSyncees.append( mCalendarSyncee );\n  mSyncees.append( mAddressBookSyncee );\n  mSyncees.append( new BookmarkSyncee( &mBookmarkManager ) );\n}\n\nRemoteKonnector::~RemoteKonnector()\n{\n}\n\nvoid RemoteKonnector::writeConfig( KConfig *config )\n{\n  Konnector::writeConfig( config );\n\n  config->writePathEntry( \"CalendarUrl\", mCalendarUrl );\n  config->writeEntry( \"AddressBookUrl\", mAddressBookUrl );\n  config->writeEntry( \"BookmarkFile\", mAddressBookUrl );\n}\n\nKSync::Kapabilities RemoteKonnector::capabilities()\n{\n  KSync::Kapabilities caps;\n\n  caps.setSupportMetaSyncing( false ); \/\/ we can meta sync\n  caps.setSupportsPushSync( false ); \/\/ we can initialize the sync from here\n  caps.setNeedsConnection( false ); \/\/ we need to have pppd running\n  caps.setSupportsListDir( false ); \/\/ we will support that once there is API for it...\n  caps.setNeedsIPs( false ); \/\/ we need the IP\n  caps.setNeedsSrcIP( false ); \/\/ we do not bind to any address...\n  caps.setNeedsDestIP( false ); \/\/ we need to know where to connect\n  caps.setAutoHandle( false ); \/\/ we currently do not support auto handling\n  caps.setNeedAuthentication( false ); \/\/ HennevL says we do not need that\n  caps.setNeedsModelName( false ); \/\/ we need a name for our meta path!\n\n  return caps;\n}\n\nvoid RemoteKonnector::setCapabilities( const KSync::Kapabilities& )\n{\n}\n\nbool RemoteKonnector::readSyncees()\n{\n  kdDebug() << \"RemoteKonnector::readSyncees()\" << endl;\n\n  mSynceeReadCount = 0;\n\n  if ( !mCalendarUrl.isEmpty() ) {\n    kdDebug() << \"RemoteKonnector::readSyncees(): calendar: \" << mCalendarUrl\n              << endl;\n\n    mCalendarData = \"\";\n\n    KIO::TransferJob *job = KIO::get( KURL( mCalendarUrl ) );\n    connect( job, SIGNAL( result( KIO::Job * ) ),\n             SLOT( slotCalendarReadResult( KIO::Job * ) ) );\n    connect( job, SIGNAL( data( KIO::Job *, const QByteArray & ) ),\n             SLOT( slotCalendarData( KIO::Job *, const QByteArray & ) ) );\n\n    ++mSynceeReadCount;\n  }\n  \n  if ( !mAddressBookUrl.isEmpty() ) {\n    kdDebug() << \"RemoteKonnector::readSyncees(): AddressBook: \"\n              << mAddressBookUrl << endl;\n\n    mAddressBookData = \"\";\n\n    KIO::TransferJob *job = KIO::get( KURL( mAddressBookUrl ) );\n    connect( job, SIGNAL( result( KIO::Job * ) ),\n             SLOT( slotAddressBookReadResult( KIO::Job * ) ) );\n    connect( job, SIGNAL( data( KIO::Job *, const QByteArray & ) ),\n             SLOT( slotAddressBookData( KIO::Job *, const QByteArray & ) ) );\n\n    ++mSynceeReadCount;\n  }\n\n  \/\/ TODO: Read Bookmarks\n  \n  return true;\n}\n\nvoid RemoteKonnector::slotCalendarData( KIO::Job *, const QByteArray &d )\n{\n  mCalendarData += QString::fromUtf8( d );\n}\n\nvoid RemoteKonnector::slotCalendarReadResult( KIO::Job *job )\n{\n  --mSynceeReadCount;\n\n  if ( job->error() ) {\n    job->showErrorDialog( 0 );\n    emit synceeReadError( this );\n  } else {\n    mCalendar.close();\n    ICalFormat ical;\n    if ( ical.fromString( &mCalendar, mCalendarData ) ) {\n      kdDebug() << \"Read succeeded.\" << endl;\n      mCalendarSyncee->reset();\n      mCalendarSyncee->setIdentifier( mCalendarUrl );\n      kdDebug() << \"IDENTIFIER: \" << mCalendarSyncee->identifier() << endl;\n    } else {\n      kdDebug() << \"Read failed.\" << endl;\n      emit synceeReadError( this );\n    }\n  }\n  \n  finishRead();\n}\n\nvoid RemoteKonnector::slotAddressBookData( KIO::Job *, const QByteArray &d )\n{\n  mAddressBookData += QString::fromUtf8( d );\n}\n\nvoid RemoteKonnector::slotAddressBookReadResult( KIO::Job *job )\n{\n  --mSynceeReadCount;\n\n  if ( job->error() ) {\n    job->showErrorDialog( 0 );\n    emit synceeReadError( this );\n  } else {\n    mAddressBook.clear();\n    VCardConverter v;\n    Addressee::List a = v.parseVCards( mAddressBookData );\n    Addressee::List::ConstIterator it;\n    for( it = a.begin(); it != a.end(); ++it ) {\n      mAddressBook.insertAddressee( *it );\n      KSync::AddressBookSyncEntry entry( *it, mAddressBookSyncee );\n      mAddressBookSyncee->addEntry( &entry );\n    }\n  }\n  \n  finishRead();\n}\n\nvoid RemoteKonnector::finishRead()\n{\n  if ( mSynceeReadCount > 0 ) return;\n\n  emit synceesRead( this );\n}\n\nbool RemoteKonnector::connectDevice()\n{\n  return true;\n}\n\nbool RemoteKonnector::disconnectDevice()\n{\n  return true;\n}\n\nKSync::KonnectorInfo RemoteKonnector::info() const\n{\n  return KonnectorInfo( i18n(\"Remote Konnector\"),\n                        QIconSet(),\n                        QString::fromLatin1(\"RemoteKonnector\"),  \/\/ same as the .desktop file\n                        \"Remote Konnector\",\n                        \"agenda\", \/\/ icon name\n                        false );\n}\n\nbool RemoteKonnector::writeSyncees()\n{\n  kdDebug() << \"RemoteKonnector::writeSyncees()\" << endl;\n\n  mSynceeWriteCount = 0;\n\n  if ( !mCalendarUrl.isEmpty() ) {\n    kdDebug() << \"RemoteKonnector::writeSyncees(): calendar: \" << mCalendarUrl\n              << endl;\n\n    ICalFormat ical;\n    mCalendarData = ical.toString( &mCalendar );\n    if ( !mCalendarData.isEmpty() ) {\n      KIO::TransferJob *job = KIO::put( KURL( mCalendarUrl ), -1, true, false );\n      connect( job, SIGNAL( result( KIO::Job * ) ),\n               SLOT( slotCalendarWriteResult( KIO::Job * ) ) );\n      connect( job, SIGNAL( dataReq( KIO::Job *, QByteArray & ) ),\n               SLOT( slotCalendarDataReq( KIO::Job *, QByteArray & ) ) );\n\n      ++mSynceeWriteCount;\n    }\n  }\n  \n  if ( !mAddressBookUrl.isEmpty() ) {\n    kdDebug() << \"RemoteKonnector::writeSyncees(): AddressBook: \"\n              << mAddressBookUrl << endl;\n\n    mAddressBookData = \"\";\n\n    VCardConverter v;\n    AddressBook::ConstIterator it;\n    for( mAddressBook.begin(); it != mAddressBook.end(); ++it ) {\n      mAddressBookData.append( v.createVCard( *it ) );\n    }\n\n    if ( !mAddressBookData.isEmpty() ) {\n      KIO::TransferJob *job = KIO::put( KURL( mAddressBookUrl ), -1, true,\n                                        false );\n      connect( job, SIGNAL( result( KIO::Job * ) ),\n               SLOT( slotAddressBookWriteResult( KIO::Job * ) ) );\n      connect( job, SIGNAL( dataReq( KIO::Job *, QByteArray & ) ),\n               SLOT( slotAddressBookDataReq( KIO::Job *, QByteArray & ) ) );\n\n      ++mSynceeWriteCount;\n    }\n  }\n\n  \/\/ TODO: Write Bookmarks\n  \n  return true;\n}\n\nvoid RemoteKonnector::slotCalendarDataReq( KIO::Job *, QByteArray &d )\n{\n  if ( !mCalendarData.isEmpty() ) {\n    d = mCalendarData.utf8();\n    mCalendarData = QString::null;\n  }\n}\n\nvoid RemoteKonnector::slotCalendarWriteResult( KIO::Job *job )\n{\n  --mSynceeWriteCount;\n\n  if ( job->error() ) {\n    job->showErrorDialog( 0 );\n    emit synceeWriteError( this );\n  }\n  \n  finishWrite();\n}\n\nvoid RemoteKonnector::slotAddressBookDataReq( KIO::Job *, QByteArray &d )\n{\n  if ( !mAddressBookData.isEmpty() ) {\n    d = mAddressBookData.utf8();\n    mAddressBookData = QString::null;\n  }\n}\n\nvoid RemoteKonnector::slotAddressBookWriteResult( KIO::Job *job )\n{\n  --mSynceeWriteCount;\n\n  if ( job->error() ) {\n    job->showErrorDialog( 0 );\n    emit synceeWriteError( this );\n  }\n  \n  finishWrite();\n}\n\nvoid RemoteKonnector::finishWrite()\n{\n  if ( mSynceeWriteCount > 0 ) return;\n\n  emit synceesWritten( this );\n}\n\n\n#include \"remotekonnector.moc\"\n<commit_msg>The addressbook needs at least one resource, otherwise it'll crash. And initialize the iterator is also a good idea IMHO...<commit_after>\/*\n    This file is part of KitchenSync.\n\n    Copyright (c) 2004 Cornelius Schumacher <schumacher@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 \"remotekonnector.h\"\n\n#include \"remotekonnectorconfig.h\"\n\n#include <calendarsyncee.h>\n#include <addressbooksyncee.h>\n#include <bookmarksyncee.h>\n\n#include <kabc\/vcardconverter.h>\n#include <libkcal\/icalformat.h>\n#include <libkdepim\/kabcresourcenull.h>\n\n#include <konnectorinfo.h>\n#include <kapabilities.h>\n\n#include <kconfig.h>\n#include <kgenericfactory.h>\n\nusing namespace KSync;\nusing namespace KABC;\nusing namespace KCal;\n\nextern \"C\"\n{\n  void *init_libremotekonnector()\n  {\n    return new KRES::PluginFactory<RemoteKonnector,RemoteKonnectorConfig>();\n  }\n}\n\n\nRemoteKonnector::RemoteKonnector( const KConfig *config )\n    : Konnector( config ), mConfigWidget( 0 )\n{\n  if ( config ) {\n    mCalendarUrl = config->readPathEntry( \"CalendarUrl\" );\n    mAddressBookUrl = config->readPathEntry( \"AddressBookUrl\" );\n    mBookmarkUrl = config->readPathEntry( \"BookmarkUrl\" );\n  }\n\n  mAddressBook.addResource( new KABC::ResourceNull() );\n\n  mAddressBookSyncee =\tnew AddressBookSyncee( &mAddressBook );\n  mAddressBookSyncee->setSource( i18n( \"Remote\" ) );\n  mCalendarSyncee = new CalendarSyncee( &mCalendar );\n  mCalendarSyncee->setSource( i18n( \"Remote\" ) );\n  \n  mSyncees.append( mCalendarSyncee );\n  mSyncees.append( mAddressBookSyncee );\n  mSyncees.append( new BookmarkSyncee( &mBookmarkManager ) );\n}\n\nRemoteKonnector::~RemoteKonnector()\n{\n}\n\nvoid RemoteKonnector::writeConfig( KConfig *config )\n{\n  Konnector::writeConfig( config );\n\n  config->writePathEntry( \"CalendarUrl\", mCalendarUrl );\n  config->writeEntry( \"AddressBookUrl\", mAddressBookUrl );\n  config->writeEntry( \"BookmarkFile\", mAddressBookUrl );\n}\n\nKSync::Kapabilities RemoteKonnector::capabilities()\n{\n  KSync::Kapabilities caps;\n\n  caps.setSupportMetaSyncing( false ); \/\/ we can meta sync\n  caps.setSupportsPushSync( false ); \/\/ we can initialize the sync from here\n  caps.setNeedsConnection( false ); \/\/ we need to have pppd running\n  caps.setSupportsListDir( false ); \/\/ we will support that once there is API for it...\n  caps.setNeedsIPs( false ); \/\/ we need the IP\n  caps.setNeedsSrcIP( false ); \/\/ we do not bind to any address...\n  caps.setNeedsDestIP( false ); \/\/ we need to know where to connect\n  caps.setAutoHandle( false ); \/\/ we currently do not support auto handling\n  caps.setNeedAuthentication( false ); \/\/ HennevL says we do not need that\n  caps.setNeedsModelName( false ); \/\/ we need a name for our meta path!\n\n  return caps;\n}\n\nvoid RemoteKonnector::setCapabilities( const KSync::Kapabilities& )\n{\n}\n\nbool RemoteKonnector::readSyncees()\n{\n  kdDebug() << \"RemoteKonnector::readSyncees()\" << endl;\n\n  mSynceeReadCount = 0;\n\n  if ( !mCalendarUrl.isEmpty() ) {\n    kdDebug() << \"RemoteKonnector::readSyncees(): calendar: \" << mCalendarUrl\n              << endl;\n\n    mCalendarData = \"\";\n\n    KIO::TransferJob *job = KIO::get( KURL( mCalendarUrl ) );\n    connect( job, SIGNAL( result( KIO::Job * ) ),\n             SLOT( slotCalendarReadResult( KIO::Job * ) ) );\n    connect( job, SIGNAL( data( KIO::Job *, const QByteArray & ) ),\n             SLOT( slotCalendarData( KIO::Job *, const QByteArray & ) ) );\n\n    ++mSynceeReadCount;\n  }\n  \n  if ( !mAddressBookUrl.isEmpty() ) {\n    kdDebug() << \"RemoteKonnector::readSyncees(): AddressBook: \"\n              << mAddressBookUrl << endl;\n\n    mAddressBookData = \"\";\n\n    KIO::TransferJob *job = KIO::get( KURL( mAddressBookUrl ) );\n    connect( job, SIGNAL( result( KIO::Job * ) ),\n             SLOT( slotAddressBookReadResult( KIO::Job * ) ) );\n    connect( job, SIGNAL( data( KIO::Job *, const QByteArray & ) ),\n             SLOT( slotAddressBookData( KIO::Job *, const QByteArray & ) ) );\n\n    ++mSynceeReadCount;\n  }\n\n  \/\/ TODO: Read Bookmarks\n  \n  return true;\n}\n\nvoid RemoteKonnector::slotCalendarData( KIO::Job *, const QByteArray &d )\n{\n  mCalendarData += QString::fromUtf8( d );\n}\n\nvoid RemoteKonnector::slotCalendarReadResult( KIO::Job *job )\n{\n  --mSynceeReadCount;\n\n  if ( job->error() ) {\n    job->showErrorDialog( 0 );\n    emit synceeReadError( this );\n  } else {\n    mCalendar.close();\n    ICalFormat ical;\n    if ( ical.fromString( &mCalendar, mCalendarData ) ) {\n      kdDebug() << \"Read succeeded.\" << endl;\n      mCalendarSyncee->reset();\n      mCalendarSyncee->setIdentifier( mCalendarUrl );\n      kdDebug() << \"IDENTIFIER: \" << mCalendarSyncee->identifier() << endl;\n    } else {\n      kdDebug() << \"Read failed.\" << endl;\n      emit synceeReadError( this );\n    }\n  }\n  \n  finishRead();\n}\n\nvoid RemoteKonnector::slotAddressBookData( KIO::Job *, const QByteArray &d )\n{\n  mAddressBookData += QString::fromUtf8( d );\n}\n\nvoid RemoteKonnector::slotAddressBookReadResult( KIO::Job *job )\n{\n  --mSynceeReadCount;\n\n  if ( job->error() ) {\n    job->showErrorDialog( 0 );\n    emit synceeReadError( this );\n  } else {\n    mAddressBook.clear();\n    VCardConverter v;\n    Addressee::List a = v.parseVCards( mAddressBookData );\n    Addressee::List::ConstIterator it;\n    for( it = a.begin(); it != a.end(); ++it ) {\n      mAddressBook.insertAddressee( *it );\n      KSync::AddressBookSyncEntry entry( *it, mAddressBookSyncee );\n      mAddressBookSyncee->addEntry( &entry );\n    }\n  }\n  \n  finishRead();\n}\n\nvoid RemoteKonnector::finishRead()\n{\n  if ( mSynceeReadCount > 0 ) return;\n\n  emit synceesRead( this );\n}\n\nbool RemoteKonnector::connectDevice()\n{\n  return true;\n}\n\nbool RemoteKonnector::disconnectDevice()\n{\n  return true;\n}\n\nKSync::KonnectorInfo RemoteKonnector::info() const\n{\n  return KonnectorInfo( i18n(\"Remote Konnector\"),\n                        QIconSet(),\n                        QString::fromLatin1(\"RemoteKonnector\"),  \/\/ same as the .desktop file\n                        \"Remote Konnector\",\n                        \"agenda\", \/\/ icon name\n                        false );\n}\n\nbool RemoteKonnector::writeSyncees()\n{\n  kdDebug() << \"RemoteKonnector::writeSyncees()\" << endl;\n\n  mSynceeWriteCount = 0;\n\n  if ( !mCalendarUrl.isEmpty() ) {\n    kdDebug() << \"RemoteKonnector::writeSyncees(): calendar: \" << mCalendarUrl\n              << endl;\n\n    ICalFormat ical;\n    mCalendarData = ical.toString( &mCalendar );\n    if ( !mCalendarData.isEmpty() ) {\n      KIO::TransferJob *job = KIO::put( KURL( mCalendarUrl ), -1, true, false );\n      connect( job, SIGNAL( result( KIO::Job * ) ),\n               SLOT( slotCalendarWriteResult( KIO::Job * ) ) );\n      connect( job, SIGNAL( dataReq( KIO::Job *, QByteArray & ) ),\n               SLOT( slotCalendarDataReq( KIO::Job *, QByteArray & ) ) );\n\n      ++mSynceeWriteCount;\n    }\n  }\n  \n  if ( !mAddressBookUrl.isEmpty() ) {\n    kdDebug() << \"RemoteKonnector::writeSyncees(): AddressBook: \"\n              << mAddressBookUrl << endl;\n\n    mAddressBookData = \"\";\n\n    VCardConverter v;\n    AddressBook::ConstIterator it;\n    for ( it = mAddressBook.begin(); it != mAddressBook.end(); ++it ) {\n      mAddressBookData.append( v.createVCard( *it ) );\n    }\n\n    if ( !mAddressBookData.isEmpty() ) {\n      KIO::TransferJob *job = KIO::put( KURL( mAddressBookUrl ), -1, true,\n                                        false );\n      connect( job, SIGNAL( result( KIO::Job * ) ),\n               SLOT( slotAddressBookWriteResult( KIO::Job * ) ) );\n      connect( job, SIGNAL( dataReq( KIO::Job *, QByteArray & ) ),\n               SLOT( slotAddressBookDataReq( KIO::Job *, QByteArray & ) ) );\n\n      ++mSynceeWriteCount;\n    }\n  }\n\n  \/\/ TODO: Write Bookmarks\n  \n  return true;\n}\n\nvoid RemoteKonnector::slotCalendarDataReq( KIO::Job *, QByteArray &d )\n{\n  if ( !mCalendarData.isEmpty() ) {\n    d = mCalendarData.utf8();\n    mCalendarData = QString::null;\n  }\n}\n\nvoid RemoteKonnector::slotCalendarWriteResult( KIO::Job *job )\n{\n  --mSynceeWriteCount;\n\n  if ( job->error() ) {\n    job->showErrorDialog( 0 );\n    emit synceeWriteError( this );\n  }\n  \n  finishWrite();\n}\n\nvoid RemoteKonnector::slotAddressBookDataReq( KIO::Job *, QByteArray &d )\n{\n  if ( !mAddressBookData.isEmpty() ) {\n    d = mAddressBookData.utf8();\n    mAddressBookData = QString::null;\n  }\n}\n\nvoid RemoteKonnector::slotAddressBookWriteResult( KIO::Job *job )\n{\n  --mSynceeWriteCount;\n\n  if ( job->error() ) {\n    job->showErrorDialog( 0 );\n    emit synceeWriteError( this );\n  }\n  \n  finishWrite();\n}\n\nvoid RemoteKonnector::finishWrite()\n{\n  if ( mSynceeWriteCount > 0 ) return;\n\n  emit synceesWritten( this );\n}\n\n\n#include \"remotekonnector.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- RNBSocket.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\/\/  Created by Greg Clayton on 12\/12\/07.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"RNBSocket.h\"\n#include <arpa\/inet.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <netdb.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <termios.h>\n#include \"DNBLog.h\"\n#include \"DNBError.h\"\n\n#ifdef WITH_LOCKDOWN\n#include \"lockdown.h\"\n#endif\n\n\/* Once we have a RNBSocket object with a port # specified,\n   this function is called to wait for an incoming connection.\n   This function blocks while waiting for that connection.  *\/\n\nbool\nResolveIPV4HostName (const char *hostname, in_addr_t &addr)\n{\n    if (hostname == NULL ||\n        hostname[0] == '\\0' ||\n        strcmp(hostname, \"localhost\") == 0 ||\n        strcmp(hostname, \"127.0.0.1\") == 0)\n    {\n        addr = htonl (INADDR_LOOPBACK);\n        return true;\n    }\n    else if (strcmp(hostname, \"*\") == 0)\n    {\n        addr = htonl (INADDR_ANY);\n        return true;\n    }\n    else\n    {\n        \/\/ See if an IP address was specified as numbers\n        int inet_pton_result = ::inet_pton (AF_INET, hostname, &addr);\n\n        if (inet_pton_result == 1)\n            return true;\n        \n        struct hostent *host_entry = gethostbyname (hostname);\n        if (host_entry)\n        {\n            std::string ip_str (::inet_ntoa (*(struct in_addr *)*host_entry->h_addr_list));\n            inet_pton_result = ::inet_pton (AF_INET, ip_str.c_str(), &addr);\n            if (inet_pton_result == 1)\n                return true;\n        }\n    }\n    return false;\n}\n\nrnb_err_t\nRNBSocket::Listen (const char *listen_host, in_port_t port, PortBoundCallback callback, const void *callback_baton)\n{\n    \/\/DNBLogThreadedIf(LOG_RNB_COMM, \"%8u RNBSocket::%s called\", (uint32_t)m_timer.ElapsedMicroSeconds(true), __FUNCTION__);\n    \/\/ Disconnect without saving errno\n    Disconnect (false);\n\n    \/\/ Now figure out the hostname that will be attaching and palce it into\n    struct sockaddr_in listen_addr;\n    ::memset (&listen_addr, 0, sizeof listen_addr);\n    listen_addr.sin_len = sizeof listen_addr;\n    listen_addr.sin_family = AF_INET;\n    listen_addr.sin_port = htons (port);\n    listen_addr.sin_addr.s_addr = INADDR_ANY;\n    \n    if (!ResolveIPV4HostName(listen_host, listen_addr.sin_addr.s_addr))\n    {\n        DNBLogThreaded(\"error: failed to resolve connecting host '%s'\", listen_host);\n        return rnb_err;\n    }\n    \n    DNBError err;\n    int listen_fd = ::socket (AF_INET, SOCK_STREAM, IPPROTO_TCP);\n    if (listen_fd == -1)\n        err.SetError(errno, DNBError::POSIX);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::socket ( domain = AF_INET, type = SOCK_STREAM, protocol = IPPROTO_TCP ) => socket = %i\", listen_fd);\n\n    if (err.Fail())\n        return rnb_err;\n\n    \/\/ enable local address reuse\n    SetSocketOption (listen_fd, SOL_SOCKET, SO_REUSEADDR, 1);\n\n    struct sockaddr_in sa;\n    ::memset (&sa, 0, sizeof sa);\n    sa.sin_len = sizeof sa;\n    sa.sin_family = AF_INET;\n    sa.sin_port = htons (port);\n    sa.sin_addr.s_addr = INADDR_ANY; \/\/ Let incoming connections bind to any host network interface (this is NOT who can connect to us)\n    int error = ::bind (listen_fd, (struct sockaddr *) &sa, sizeof(sa));\n    if (error == -1)\n        err.SetError(errno, DNBError::POSIX);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::bind ( socket = %i, (struct sockaddr *) &sa, sizeof(sa)) )\", listen_fd);\n\n    if (err.Fail())\n    {\n        ClosePort (listen_fd, false);\n        return rnb_err;\n    }\n\n    if (callback && port == 0)\n    {\n        \/\/ We were asked to listen on port zero which means we\n        \/\/ must now read the actual port that was given to us \n        \/\/ as port zero is a special code for \"find an open port\n        \/\/ for me\".\n        socklen_t sa_len = sizeof (sa);\n        if (getsockname(listen_fd, (struct sockaddr *)&sa, &sa_len) == 0)\n        {\n            port = ntohs (sa.sin_port);\n            callback (callback_baton, port);\n        }\n    }\n\n    error = ::listen (listen_fd, 5);\n    if (error == -1)\n        err.SetError(errno, DNBError::POSIX);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::listen ( socket = %i, backlog = 1 )\", listen_fd);\n\n    if (err.Fail())\n    {\n        ClosePort (listen_fd, false);\n        return rnb_err;\n    }\n\n    struct sockaddr_in accept_addr;\n    ::memset (&accept_addr, 0, sizeof accept_addr);\n    accept_addr.sin_len = sizeof accept_addr;\n\n    bool accept_connection = false;\n\n    \/\/ Loop until we are happy with our connection\n    while (!accept_connection)\n    {\n        socklen_t accept_addr_len = sizeof accept_addr;\n        m_fd = ::accept (listen_fd, (struct sockaddr *)&accept_addr, &accept_addr_len);\n\n        if (m_fd == -1)\n            err.SetError(errno, DNBError::POSIX);\n        \n        if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n            err.LogThreaded(\"::accept ( socket = %i, address = %p, address_len = %u )\", listen_fd, &accept_addr, accept_addr_len);\n\n        if (err.Fail())\n            break;\n\n        if (listen_addr.sin_addr.s_addr == INADDR_ANY)\n            accept_connection = true;\n        else\n        {\n            if (accept_addr_len == listen_addr.sin_len &&\n                accept_addr.sin_addr.s_addr == listen_addr.sin_addr.s_addr)\n            {\n                accept_connection = true;\n            }\n            else\n            {\n                ::close (m_fd);\n                m_fd = -1;\n                const uint8_t *accept_ip = (const uint8_t *)&accept_addr.sin_addr.s_addr;\n                const uint8_t *listen_ip = (const uint8_t *)&listen_addr.sin_addr.s_addr;\n                ::fprintf (stderr,\n                           \"error: rejecting incoming connection from %u.%u.%u.%u (expecting %u.%u.%u.%u)\\n\",\n                           accept_ip[0], accept_ip[1], accept_ip[2], accept_ip[3],\n                           listen_ip[0], listen_ip[1], listen_ip[2], listen_ip[3]);\n                DNBLogThreaded (\"error: rejecting connection from %u.%u.%u.%u (expecting %u.%u.%u.%u)\",\n                                accept_ip[0], accept_ip[1], accept_ip[2], accept_ip[3],\n                                listen_ip[0], listen_ip[1], listen_ip[2], listen_ip[3]);\n            }\n        }\n    }\n\n    ClosePort (listen_fd, false);\n\n    if (err.Fail())\n    {\n        return rnb_err;\n    }\n    else\n    {\n        \/\/ Keep our TCP packets coming without any delays.\n        SetSocketOption (m_fd, IPPROTO_TCP, TCP_NODELAY, 1);\n    }\n\n    return rnb_success;\n}\n\nrnb_err_t\nRNBSocket::Connect (const char *host, uint16_t port)\n{\n    Disconnect (false);\n\n    \/\/ Create the socket\n    m_fd = ::socket (AF_INET, SOCK_STREAM, IPPROTO_TCP);\n    if (m_fd == -1)\n        return rnb_err;\n    \n    \/\/ Enable local address reuse\n    SetSocketOption (m_fd, SOL_SOCKET, SO_REUSEADDR, 1);\n    \n    struct sockaddr_in sa;\n    ::memset (&sa, 0, sizeof (sa));\n    sa.sin_family = AF_INET;\n    sa.sin_port = htons (port);\n    \n    if (!ResolveIPV4HostName(host, sa.sin_addr.s_addr))\n    {\n        DNBLogThreaded(\"error: failed to resolve host '%s'\", host);\n        Disconnect (false);\n        return rnb_err;\n    }\n    \n    if (-1 == ::connect (m_fd, (const struct sockaddr *)&sa, sizeof(sa)))\n    {\n        Disconnect (false);\n        return rnb_err;\n    }\n    \n    \/\/ Keep our TCP packets coming without any delays.\n    SetSocketOption (m_fd, IPPROTO_TCP, TCP_NODELAY, 1);\n    return rnb_success;\n}\n\nrnb_err_t\nRNBSocket::useFD(int fd)\n{\n       if (fd < 0) {\n               DNBLogThreadedIf(LOG_RNB_COMM, \"Bad file descriptor passed in.\");\n               return rnb_err;\n       }\n       \n       m_fd = fd;\n       return rnb_success;\n}\n\n#ifdef WITH_LOCKDOWN\nrnb_err_t\nRNBSocket::ConnectToService()\n{\n    DNBLog(\"Connecting to com.apple.%s service...\", DEBUGSERVER_PROGRAM_NAME);\n    \/\/ Disconnect from any previous connections\n    Disconnect(false);\n    if (::secure_lockdown_checkin (&m_ld_conn, NULL, NULL) != kLDESuccess)\n    {\n        DNBLogThreadedIf(LOG_RNB_COMM, \"::secure_lockdown_checkin(&m_fd, NULL, NULL) failed\");\n        m_fd = -1;\n        return rnb_not_connected;\n    }\n    m_fd = ::lockdown_get_socket (m_ld_conn);\n    if (m_fd == -1)\n    {\n        DNBLogThreadedIf(LOG_RNB_COMM, \"::lockdown_get_socket() failed\");\n        return rnb_not_connected;\n    }\n    m_fd_from_lockdown = true;\n    return rnb_success;\n}\n#endif\n\nrnb_err_t\nRNBSocket::OpenFile (const char *path)\n{\n    DNBError err;\n    m_fd = open (path, O_RDWR);\n    if (m_fd == -1)\n    {\n        err.SetError(errno, DNBError::POSIX);\n        err.LogThreaded (\"can't open file '%s'\", path);\n        return rnb_not_connected;\n    }\n    else\n    {\n        struct termios stdin_termios;\n\n        if (::tcgetattr (m_fd, &stdin_termios) == 0)\n        {\n            stdin_termios.c_lflag &= ~ECHO;     \/\/ Turn off echoing\n            stdin_termios.c_lflag &= ~ICANON;   \/\/ Get one char at a time\n            ::tcsetattr (m_fd, TCSANOW, &stdin_termios);\n        }\n    }\n    return rnb_success;\n}\n\nint\nRNBSocket::SetSocketOption(int fd, int level, int option_name, int option_value)\n{\n    return ::setsockopt(fd, level, option_name, &option_value, sizeof(option_value));\n}\n\nrnb_err_t\nRNBSocket::Disconnect (bool save_errno)\n{\n#ifdef WITH_LOCKDOWN\n    if (m_fd_from_lockdown)\n    {\n        m_fd_from_lockdown = false;\n        m_fd = -1;\n        if (lockdown_deactivate (m_ld_conn) == 0)\n            return rnb_success;\n        else\n            return rnb_err;\n    }\n#endif\n    return ClosePort (m_fd, save_errno);\n}\n\n\nrnb_err_t\nRNBSocket::Read (std::string &p)\n{\n    char buf[1024];\n    p.clear();\n\n    \/\/ Note that BUF is on the stack so we must be careful to keep any\n    \/\/ writes to BUF from overflowing or we'll have security issues.\n\n    if (m_fd == -1)\n        return rnb_err;\n\n    \/\/DNBLogThreadedIf(LOG_RNB_COMM, \"%8u RNBSocket::%s calling read()\", (uint32_t)m_timer.ElapsedMicroSeconds(true), __FUNCTION__);\n    DNBError err;\n    int bytesread = read (m_fd, buf, sizeof (buf));\n    if (bytesread <= 0)\n        err.SetError(errno, DNBError::POSIX);\n    else\n        p.append(buf, bytesread);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::read ( %i, %p, %llu ) => %i\", m_fd, buf, sizeof (buf), (uint64_t)bytesread);\n\n    \/\/ Our port went away - we have to mark this so IsConnected will return the truth.\n    if (bytesread == 0)\n    {\n        m_fd = -1;\n        return rnb_not_connected;\n    }\n    else if (bytesread == -1)\n    {\n        m_fd = -1;\n        return rnb_err;\n    }\n    \/\/ Strip spaces from the end of the buffer\n    while (!p.empty() && isspace (p[p.size() - 1]))\n        p.erase (p.size () - 1);\n\n    \/\/ Most data in the debugserver packets valid printable characters...\n    DNBLogThreadedIf(LOG_RNB_COMM, \"read: %s\", p.c_str());\n    return rnb_success;\n}\n\nrnb_err_t\nRNBSocket::Write (const void *buffer, size_t length)\n{\n    if (m_fd == -1)\n        return rnb_err;\n\n    DNBError err;\n    int bytessent = write (m_fd, buffer, length);\n    if (bytessent < 0)\n        err.SetError(errno, DNBError::POSIX);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::write ( socket = %i, buffer = %p, length = %llu) => %i\", m_fd, buffer, length, (uint64_t)bytessent);\n\n    if (bytessent < 0)\n        return rnb_err;\n\n    if (bytessent != length)\n        return rnb_err;\n\n    DNBLogThreadedIf(LOG_RNB_PACKETS, \"putpkt: %*s\", (int)length, (char *)buffer);   \/\/ All data is string based in debugserver, so this is safe\n    DNBLogThreadedIf(LOG_RNB_COMM, \"sent: %*s\", (int)length, (char *)buffer);\n\n    return rnb_success;\n}\n\n\nrnb_err_t\nRNBSocket::ClosePort (int& fd, bool save_errno)\n{\n    int close_err = 0;\n    if (fd > 0)\n    {\n        errno = 0;\n        close_err = close (fd);\n        fd = -1;\n    }\n    return close_err != 0 ? rnb_err : rnb_success;\n}\n\n\n<commit_msg>Use the correct call to close down the lockdown connection.<commit_after>\/\/===-- RNBSocket.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\/\/  Created by Greg Clayton on 12\/12\/07.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"RNBSocket.h\"\n#include <arpa\/inet.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <netdb.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <termios.h>\n#include \"DNBLog.h\"\n#include \"DNBError.h\"\n\n#ifdef WITH_LOCKDOWN\n#include \"lockdown.h\"\n#endif\n\n\/* Once we have a RNBSocket object with a port # specified,\n   this function is called to wait for an incoming connection.\n   This function blocks while waiting for that connection.  *\/\n\nbool\nResolveIPV4HostName (const char *hostname, in_addr_t &addr)\n{\n    if (hostname == NULL ||\n        hostname[0] == '\\0' ||\n        strcmp(hostname, \"localhost\") == 0 ||\n        strcmp(hostname, \"127.0.0.1\") == 0)\n    {\n        addr = htonl (INADDR_LOOPBACK);\n        return true;\n    }\n    else if (strcmp(hostname, \"*\") == 0)\n    {\n        addr = htonl (INADDR_ANY);\n        return true;\n    }\n    else\n    {\n        \/\/ See if an IP address was specified as numbers\n        int inet_pton_result = ::inet_pton (AF_INET, hostname, &addr);\n\n        if (inet_pton_result == 1)\n            return true;\n        \n        struct hostent *host_entry = gethostbyname (hostname);\n        if (host_entry)\n        {\n            std::string ip_str (::inet_ntoa (*(struct in_addr *)*host_entry->h_addr_list));\n            inet_pton_result = ::inet_pton (AF_INET, ip_str.c_str(), &addr);\n            if (inet_pton_result == 1)\n                return true;\n        }\n    }\n    return false;\n}\n\nrnb_err_t\nRNBSocket::Listen (const char *listen_host, in_port_t port, PortBoundCallback callback, const void *callback_baton)\n{\n    \/\/DNBLogThreadedIf(LOG_RNB_COMM, \"%8u RNBSocket::%s called\", (uint32_t)m_timer.ElapsedMicroSeconds(true), __FUNCTION__);\n    \/\/ Disconnect without saving errno\n    Disconnect (false);\n\n    \/\/ Now figure out the hostname that will be attaching and palce it into\n    struct sockaddr_in listen_addr;\n    ::memset (&listen_addr, 0, sizeof listen_addr);\n    listen_addr.sin_len = sizeof listen_addr;\n    listen_addr.sin_family = AF_INET;\n    listen_addr.sin_port = htons (port);\n    listen_addr.sin_addr.s_addr = INADDR_ANY;\n    \n    if (!ResolveIPV4HostName(listen_host, listen_addr.sin_addr.s_addr))\n    {\n        DNBLogThreaded(\"error: failed to resolve connecting host '%s'\", listen_host);\n        return rnb_err;\n    }\n    \n    DNBError err;\n    int listen_fd = ::socket (AF_INET, SOCK_STREAM, IPPROTO_TCP);\n    if (listen_fd == -1)\n        err.SetError(errno, DNBError::POSIX);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::socket ( domain = AF_INET, type = SOCK_STREAM, protocol = IPPROTO_TCP ) => socket = %i\", listen_fd);\n\n    if (err.Fail())\n        return rnb_err;\n\n    \/\/ enable local address reuse\n    SetSocketOption (listen_fd, SOL_SOCKET, SO_REUSEADDR, 1);\n\n    struct sockaddr_in sa;\n    ::memset (&sa, 0, sizeof sa);\n    sa.sin_len = sizeof sa;\n    sa.sin_family = AF_INET;\n    sa.sin_port = htons (port);\n    sa.sin_addr.s_addr = INADDR_ANY; \/\/ Let incoming connections bind to any host network interface (this is NOT who can connect to us)\n    int error = ::bind (listen_fd, (struct sockaddr *) &sa, sizeof(sa));\n    if (error == -1)\n        err.SetError(errno, DNBError::POSIX);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::bind ( socket = %i, (struct sockaddr *) &sa, sizeof(sa)) )\", listen_fd);\n\n    if (err.Fail())\n    {\n        ClosePort (listen_fd, false);\n        return rnb_err;\n    }\n\n    if (callback && port == 0)\n    {\n        \/\/ We were asked to listen on port zero which means we\n        \/\/ must now read the actual port that was given to us \n        \/\/ as port zero is a special code for \"find an open port\n        \/\/ for me\".\n        socklen_t sa_len = sizeof (sa);\n        if (getsockname(listen_fd, (struct sockaddr *)&sa, &sa_len) == 0)\n        {\n            port = ntohs (sa.sin_port);\n            callback (callback_baton, port);\n        }\n    }\n\n    error = ::listen (listen_fd, 5);\n    if (error == -1)\n        err.SetError(errno, DNBError::POSIX);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::listen ( socket = %i, backlog = 1 )\", listen_fd);\n\n    if (err.Fail())\n    {\n        ClosePort (listen_fd, false);\n        return rnb_err;\n    }\n\n    struct sockaddr_in accept_addr;\n    ::memset (&accept_addr, 0, sizeof accept_addr);\n    accept_addr.sin_len = sizeof accept_addr;\n\n    bool accept_connection = false;\n\n    \/\/ Loop until we are happy with our connection\n    while (!accept_connection)\n    {\n        socklen_t accept_addr_len = sizeof accept_addr;\n        m_fd = ::accept (listen_fd, (struct sockaddr *)&accept_addr, &accept_addr_len);\n\n        if (m_fd == -1)\n            err.SetError(errno, DNBError::POSIX);\n        \n        if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n            err.LogThreaded(\"::accept ( socket = %i, address = %p, address_len = %u )\", listen_fd, &accept_addr, accept_addr_len);\n\n        if (err.Fail())\n            break;\n\n        if (listen_addr.sin_addr.s_addr == INADDR_ANY)\n            accept_connection = true;\n        else\n        {\n            if (accept_addr_len == listen_addr.sin_len &&\n                accept_addr.sin_addr.s_addr == listen_addr.sin_addr.s_addr)\n            {\n                accept_connection = true;\n            }\n            else\n            {\n                ::close (m_fd);\n                m_fd = -1;\n                const uint8_t *accept_ip = (const uint8_t *)&accept_addr.sin_addr.s_addr;\n                const uint8_t *listen_ip = (const uint8_t *)&listen_addr.sin_addr.s_addr;\n                ::fprintf (stderr,\n                           \"error: rejecting incoming connection from %u.%u.%u.%u (expecting %u.%u.%u.%u)\\n\",\n                           accept_ip[0], accept_ip[1], accept_ip[2], accept_ip[3],\n                           listen_ip[0], listen_ip[1], listen_ip[2], listen_ip[3]);\n                DNBLogThreaded (\"error: rejecting connection from %u.%u.%u.%u (expecting %u.%u.%u.%u)\",\n                                accept_ip[0], accept_ip[1], accept_ip[2], accept_ip[3],\n                                listen_ip[0], listen_ip[1], listen_ip[2], listen_ip[3]);\n            }\n        }\n    }\n\n    ClosePort (listen_fd, false);\n\n    if (err.Fail())\n    {\n        return rnb_err;\n    }\n    else\n    {\n        \/\/ Keep our TCP packets coming without any delays.\n        SetSocketOption (m_fd, IPPROTO_TCP, TCP_NODELAY, 1);\n    }\n\n    return rnb_success;\n}\n\nrnb_err_t\nRNBSocket::Connect (const char *host, uint16_t port)\n{\n    Disconnect (false);\n\n    \/\/ Create the socket\n    m_fd = ::socket (AF_INET, SOCK_STREAM, IPPROTO_TCP);\n    if (m_fd == -1)\n        return rnb_err;\n    \n    \/\/ Enable local address reuse\n    SetSocketOption (m_fd, SOL_SOCKET, SO_REUSEADDR, 1);\n    \n    struct sockaddr_in sa;\n    ::memset (&sa, 0, sizeof (sa));\n    sa.sin_family = AF_INET;\n    sa.sin_port = htons (port);\n    \n    if (!ResolveIPV4HostName(host, sa.sin_addr.s_addr))\n    {\n        DNBLogThreaded(\"error: failed to resolve host '%s'\", host);\n        Disconnect (false);\n        return rnb_err;\n    }\n    \n    if (-1 == ::connect (m_fd, (const struct sockaddr *)&sa, sizeof(sa)))\n    {\n        Disconnect (false);\n        return rnb_err;\n    }\n    \n    \/\/ Keep our TCP packets coming without any delays.\n    SetSocketOption (m_fd, IPPROTO_TCP, TCP_NODELAY, 1);\n    return rnb_success;\n}\n\nrnb_err_t\nRNBSocket::useFD(int fd)\n{\n       if (fd < 0) {\n               DNBLogThreadedIf(LOG_RNB_COMM, \"Bad file descriptor passed in.\");\n               return rnb_err;\n       }\n       \n       m_fd = fd;\n       return rnb_success;\n}\n\n#ifdef WITH_LOCKDOWN\nrnb_err_t\nRNBSocket::ConnectToService()\n{\n    DNBLog(\"Connecting to com.apple.%s service...\", DEBUGSERVER_PROGRAM_NAME);\n    \/\/ Disconnect from any previous connections\n    Disconnect(false);\n    if (::secure_lockdown_checkin (&m_ld_conn, NULL, NULL) != kLDESuccess)\n    {\n        DNBLogThreadedIf(LOG_RNB_COMM, \"::secure_lockdown_checkin(&m_fd, NULL, NULL) failed\");\n        m_fd = -1;\n        return rnb_not_connected;\n    }\n    m_fd = ::lockdown_get_socket (m_ld_conn);\n    if (m_fd == -1)\n    {\n        DNBLogThreadedIf(LOG_RNB_COMM, \"::lockdown_get_socket() failed\");\n        return rnb_not_connected;\n    }\n    m_fd_from_lockdown = true;\n    return rnb_success;\n}\n#endif\n\nrnb_err_t\nRNBSocket::OpenFile (const char *path)\n{\n    DNBError err;\n    m_fd = open (path, O_RDWR);\n    if (m_fd == -1)\n    {\n        err.SetError(errno, DNBError::POSIX);\n        err.LogThreaded (\"can't open file '%s'\", path);\n        return rnb_not_connected;\n    }\n    else\n    {\n        struct termios stdin_termios;\n\n        if (::tcgetattr (m_fd, &stdin_termios) == 0)\n        {\n            stdin_termios.c_lflag &= ~ECHO;     \/\/ Turn off echoing\n            stdin_termios.c_lflag &= ~ICANON;   \/\/ Get one char at a time\n            ::tcsetattr (m_fd, TCSANOW, &stdin_termios);\n        }\n    }\n    return rnb_success;\n}\n\nint\nRNBSocket::SetSocketOption(int fd, int level, int option_name, int option_value)\n{\n    return ::setsockopt(fd, level, option_name, &option_value, sizeof(option_value));\n}\n\nrnb_err_t\nRNBSocket::Disconnect (bool save_errno)\n{\n#ifdef WITH_LOCKDOWN\n    if (m_fd_from_lockdown)\n    {\n        m_fd_from_lockdown = false;\n        m_fd = -1;\n        lockdown_disconnect (m_ld_conn);\n        return rnb_success;\n    }\n#endif\n    return ClosePort (m_fd, save_errno);\n}\n\n\nrnb_err_t\nRNBSocket::Read (std::string &p)\n{\n    char buf[1024];\n    p.clear();\n\n    \/\/ Note that BUF is on the stack so we must be careful to keep any\n    \/\/ writes to BUF from overflowing or we'll have security issues.\n\n    if (m_fd == -1)\n        return rnb_err;\n\n    \/\/DNBLogThreadedIf(LOG_RNB_COMM, \"%8u RNBSocket::%s calling read()\", (uint32_t)m_timer.ElapsedMicroSeconds(true), __FUNCTION__);\n    DNBError err;\n    int bytesread = read (m_fd, buf, sizeof (buf));\n    if (bytesread <= 0)\n        err.SetError(errno, DNBError::POSIX);\n    else\n        p.append(buf, bytesread);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::read ( %i, %p, %llu ) => %i\", m_fd, buf, sizeof (buf), (uint64_t)bytesread);\n\n    \/\/ Our port went away - we have to mark this so IsConnected will return the truth.\n    if (bytesread == 0)\n    {\n        m_fd = -1;\n        return rnb_not_connected;\n    }\n    else if (bytesread == -1)\n    {\n        m_fd = -1;\n        return rnb_err;\n    }\n    \/\/ Strip spaces from the end of the buffer\n    while (!p.empty() && isspace (p[p.size() - 1]))\n        p.erase (p.size () - 1);\n\n    \/\/ Most data in the debugserver packets valid printable characters...\n    DNBLogThreadedIf(LOG_RNB_COMM, \"read: %s\", p.c_str());\n    return rnb_success;\n}\n\nrnb_err_t\nRNBSocket::Write (const void *buffer, size_t length)\n{\n    if (m_fd == -1)\n        return rnb_err;\n\n    DNBError err;\n    int bytessent = write (m_fd, buffer, length);\n    if (bytessent < 0)\n        err.SetError(errno, DNBError::POSIX);\n\n    if (err.Fail() || DNBLogCheckLogBit(LOG_RNB_COMM))\n        err.LogThreaded(\"::write ( socket = %i, buffer = %p, length = %llu) => %i\", m_fd, buffer, length, (uint64_t)bytessent);\n\n    if (bytessent < 0)\n        return rnb_err;\n\n    if (bytessent != length)\n        return rnb_err;\n\n    DNBLogThreadedIf(LOG_RNB_PACKETS, \"putpkt: %*s\", (int)length, (char *)buffer);   \/\/ All data is string based in debugserver, so this is safe\n    DNBLogThreadedIf(LOG_RNB_COMM, \"sent: %*s\", (int)length, (char *)buffer);\n\n    return rnb_success;\n}\n\n\nrnb_err_t\nRNBSocket::ClosePort (int& fd, bool save_errno)\n{\n    int close_err = 0;\n    if (fd > 0)\n    {\n        errno = 0;\n        close_err = close (fd);\n        fd = -1;\n    }\n    return close_err != 0 ? rnb_err : rnb_success;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\nframenotifier_app.cpp\n\n  Created on: 13 Oct 2015\n      Author: up45\n*\/\n#include <signal.h>\n#include <string>\n#include <cstring>\n#include <iostream>\n#include <fstream>\nusing namespace std;\n\n\n#include <log4cxx\/logger.h>\n#include <log4cxx\/basicconfigurator.h>\n#include <log4cxx\/propertyconfigurator.h>\n#include <log4cxx\/helpers\/exception.h>\nusing namespace log4cxx;\nusing namespace log4cxx::helpers;\n\n#include <boost\/foreach.hpp>\n#include <boost\/program_options.hpp>\n#include \"boost\/date_time\/posix_time\/posix_time.hpp\"\nnamespace po = boost::program_options;\n\n#include \"rapidjson\/document.h\"\n#include \"rapidjson\/writer.h\"\n#include \"rapidjson\/prettywriter.h\"\n#include \"rapidjson\/stringbuffer.h\"\nusing namespace rapidjson;\n\n#include \"zmq\/zmq.hpp\"\n\n#include \"framenotifier_data.h\"\n#include \"FileWriter.h\"\n\nvoid parse_arguments(int argc, char** argv, po::variables_map& vm, LoggerPtr& logger)\n{\n    try\n    {\n        std::string config_file;\n\n        \/\/ Declare a group of options that will allowed only on the command line\n        po::options_description generic(\"Generic options\");\n        generic.add_options()\n                (\"help,h\",\n                    \"Print this help message\")\n                (\"config,c\",    po::value<string>(&config_file),\n                    \"Specify program configuration file\")\n                ;\n\n        \/\/ Declare a group of options that will be allowed both on the command line\n        \/\/ and in the configuration file\n        po::options_description config(\"Configuration options\");\n        config.add_options()\n                (\"logconfig,l\",  po::value<string>(),\n                    \"Set the log4cxx logging configuration file\")\n                (\"ready,r\",       po::value<std::string>()->default_value(\"tcp:\/\/127.0.0.1:5001\"),\n                    \"Ready ZMQ endpoint from frameReceiver\")\n                (\"release\",       po::value<std::string>()->default_value(\"tcp:\/\/127.0.0.1:5002\"),\n                        \"Release frame ZMQ endpoint from frameReceiver\")\n                (\"frames,f\",     po::value<unsigned int>()->default_value(1),\n                    \"Set the number of frames to be notified about before terminating\")\n                (\"sharedbuf\",    po::value<std::string>()->default_value(\"FrameReceiverBuffer\"),\n                    \"Set the name of the shared memory frame buffer\")\n                ;\n\n        \/\/ Group the variables for parsing at the command line and\/or from the configuration file\n        po::options_description cmdline_options;\n        cmdline_options.add(generic).add(config);\n        po::options_description config_file_options;\n        config_file_options.add(config);\n\n        \/\/ Parse the command line options\n        po::store(po::parse_command_line(argc, argv, cmdline_options), vm);\n        po::notify(vm);\n\n        \/\/ If the command-line help option was given, print help and exit\n        if (vm.count(\"help\"))\n        {\n            std::cout << \"usage: frameReceiver [options]\" << std::endl << std::endl;\n            std::cout << cmdline_options << std::endl;\n            exit(1);\n        }\n\n        \/\/ If the command line config option was given, parse the specified configuration\n        \/\/ file for additional options. Note that boost::program_options gives precedence\n        \/\/ to the first instance occurring. In this case, that implies that command-line\n        \/\/ options have precedence over equivalent configuration file entries.\n        if (vm.count(\"config\"))\n        {\n            std::ifstream config_ifs(config_file.c_str());\n            if (config_ifs)\n            {\n                LOG4CXX_DEBUG(logger, \"Parsing configuration file \" << config_file);\n                po::store(po::parse_config_file(config_ifs, config_file_options, true), vm);\n                po::notify(vm);\n            }\n            else\n            {\n                LOG4CXX_ERROR(logger, \"Unable to open configuration file \" << config_file << \" for parsing\");\n                exit(1);\n            }\n        }\n\n        if (vm.count(\"logconfig\"))\n        {\n            PropertyConfigurator::configure(vm[\"logconfig\"].as<string>());\n            LOG4CXX_DEBUG(logger, \"log4cxx config file is set to \" << vm[\"logconfig\"].as<string>());\n        }\n\n        if (vm.count(\"ready\"))\n        {\n            LOG4CXX_DEBUG(logger, \"Setting frame ready notification ZMQ address to \" << vm[\"ready\"].as<string>());\n        }\n\n        if (vm.count(\"release\"))\n        {\n            LOG4CXX_DEBUG(logger, \"Setting frame release notification ZMQ address to \" << vm[\"release\"].as<string>());\n        }\n\n        if (vm.count(\"frames\"))\n        {\n            LOG4CXX_DEBUG(logger, \"Setting number of frames to receive to \" << vm[\"frames\"].as<unsigned int>());\n        }\n\n    }\n    catch (po::unknown_option &e)\n    {\n        LOG4CXX_WARN(logger, \"CLI parsing error: \" << e.what() << \". Will carry on...\");\n    }\n    catch (Exception &e)\n    {\n        LOG4CXX_FATAL(logger, \"Got Log4CXX exception: \" << e.what());\n        throw;\n    }\n    catch (exception &e)\n    {\n        LOG4CXX_ERROR(logger, \"Got exception:\" << e.what());\n        throw;\n    }\n    catch (...)\n    {\n        LOG4CXX_FATAL(logger, \"Exception of unknown type!\");\n        throw;\n    }\n}\n\nint main(int argc, char** argv)\n{\n    int rc = 0;\n\n    \/\/ Create a default basic logger configuration, which can be overridden by command-line option later\n    BasicConfigurator::configure();\n\n    LoggerPtr logger(Logger::getLogger(\"FrameNotifier\"));\n    po::variables_map vm;\n    parse_arguments(argc, argv, vm, logger);\n\n    SharedMemParser smp(vm[\"sharedbuf\"].as<string>());\n\n    \/\/ Assuming this is a P2M, our image dimensions are:\n    size_t bytes_per_pixel = 2;\n    dimensions_t p2m_dims(2); p2m_dims[0] = 1484; p2m_dims[1] = 1404;\n\n    zmq::context_t zmq_context; \/\/ Global ZMQ context\n\n    \/\/ The \"release\" ZMQ PUB socket, used to release frames back to the frameReceiver\n    zmq::socket_t zsocket_release(zmq_context, ZMQ_PUB);\n    zsocket_release.connect(vm[\"release\"].as<string>().c_str());\n\n    \/\/ The \"ready\" ZMQ SUB socket, used to get notifications that new frames are ready to be processed\n    zmq::socket_t zsocket_ready(zmq_context, ZMQ_SUB);\n    zsocket_ready.connect(vm[\"ready\"].as<string>().c_str());\n    zsocket_ready.setsockopt(ZMQ_SUBSCRIBE, \"\", strlen(\"\"));\n    zmq::pollitem_t poll_item;\n    poll_item.socket = zsocket_ready;\n    poll_item.events = ZMQ_POLLIN;\n    poll_item.fd = 0;\n    poll_item.revents = 0;\n\n    \/\/ The file writer object\n    FileWriter hdfwr;\n    hdfwr.createFile(\"data.h5\");\n    FileWriter::DatasetDefinition dset_def;\n    dset_def.name = \"data\";\n    dset_def.frame_dimensions = p2m_dims;\n    dset_def.pixel = FileWriter::pixel_raw_16bit;\n    dset_def.num_frames = vm[\"frames\"].as<unsigned int>();\n    hdfwr.createDataset(dset_def);\n\n    \/\/ The polling loop. Polls on all elements in poll_item\n    \/\/ Stop the loop by setting keep_running=false\n    \/\/ Loop automatically ends if notification_count > user option \"frames\"\n    unsigned long notification_count = 0;\n    bool keep_running = true;\n    LOG4CXX_DEBUG(logger, \"Entering ZMQ polling loop (\" << vm[\"ready\"].as<string>().c_str() << \")\");\n    while (keep_running)\n    {\n        \/\/ Always reset the last raw events before polling\n        poll_item.revents = 0;\n\n        \/\/ Do the poll with a 10ms timeout (i.e. 10Hz poll)\n        zmq::poll(&poll_item, 1, 10);\n\n        \/\/ Check for poll error and exit the loop is one is found\n        if (poll_item.revents & ZMQ_POLLERR)\n        {\n            LOG4CXX_ERROR(logger, \"Got ZMQ error in polling. Quitting polling loop.\");\n            keep_running = false;\n        }\n        \/\/ Do work if a message is received\n        else if (poll_item.revents & ZMQ_POLLIN)\n        {\n            LOG4CXX_DEBUG(logger, \"Reading data from ZMQ socket\");\n            notification_count++;\n            zmq::message_t msg;\n            zsocket_ready.recv(&msg); \/\/ Read the message from the ready socket\n\n            string msg_str(reinterpret_cast<char*>(msg.data()), msg.size()-1);\n            LOG4CXX_DEBUG(logger, \"Parsing JSON msg string: \" << msg_str);\n            Document msg_doc;\n            msg_doc.Parse(msg_str.c_str()); \/\/ Parse the JSON string into a Document DOM object\n\n            \/\/ Setup a string buffer and a writer so we can stringify the Document DOM object again\n            StringBuffer buffer;\n            PrettyWriter<StringBuffer> writer(buffer);\n            msg_doc.Accept(writer);\n            LOG4CXX_DEBUG(logger, \"Parsed json: \" << buffer.GetString());\n\n            \/\/ Copy the data out into a Frame object\n            LOG4CXX_DEBUG(logger, \"Creating Frame object\");\n            Frame frame(bytes_per_pixel, p2m_dims);\n            LOG4CXX_DEBUG(logger, \"Copying buffer ID: \" << msg_doc[\"params\"][\"buffer_id\"].GetInt64());\n            smp.get_frame(frame, msg_doc[\"params\"][\"buffer_id\"].GetInt64());\n            LOG4CXX_DEBUG(logger, \"Frame completeness: \" << frame.get_header()->packets_received << \" packets received\");\n\n            \/\/ Clear the json string buffer and reset the writer so we can re-use them\n            \/\/ after modifying the Document DOM object\n            buffer.Clear();\n            writer.Reset(buffer);\n\n            \/\/ We want to return the exact same JSON message back to the frameReceiver\n            \/\/ so we just modify the relevant bits: msg_val: from frame_ready to frame_release\n            \/\/ and update the timestamp\n            msg_doc[\"msg_val\"].SetString(\"frame_release\");\n\n            \/\/ Create and update the timestamp in the JSON message\n            boost::posix_time::ptime msg_timestamp = boost::posix_time::microsec_clock::local_time();\n            string msg_timestamp_str = boost::posix_time::to_iso_extended_string(msg_timestamp);\n            msg_doc[\"timestamp\"].SetString(StringRef(msg_timestamp_str.c_str()));\n\n            \/\/ Encode the JSON Document DOM object using the writer\n            msg_doc.Accept(writer);\n            LOG4CXX_DEBUG(logger, \"Changing msg_val: \" << msg_doc[\"msg_val\"].GetString());\n            string release_msg(buffer.GetString()); \/\/ Get a copy of the JSON string\n            LOG4CXX_DEBUG(logger, \"New json: \" << release_msg);\n\n            LOG4CXX_DEBUG(logger, \"Sending release response\");\n            \/\/ Send the new JSON object (string) back to the frameReceiver on the \"release\" ZMQ socket\n            size_t nbytes = zsocket_release.send(release_msg.c_str(), release_msg.size() + 1);\n            LOG4CXX_DEBUG(logger, \"Sent \" << nbytes << \" bytes\");\n\n            \/\/ Write the frame to disk\n            hdfwr.writeFrame(frame);\n\n        } else\n        {\n            \/\/ No new data\n        }\n\n        \/\/ Quit the loop if we have received the desired number of frames\n        if (notification_count >= vm[\"frames\"].as<unsigned int>()) keep_running=false;\n    }\n    hdfwr.closeFile();\n    return rc;\n}\n\n\n<commit_msg>filewriter: adding CLI option for output filename<commit_after>\/**\nframenotifier_app.cpp\n\n  Created on: 13 Oct 2015\n      Author: up45\n*\/\n#include <signal.h>\n#include <string>\n#include <cstring>\n#include <iostream>\n#include <fstream>\nusing namespace std;\n\n\n#include <log4cxx\/logger.h>\n#include <log4cxx\/basicconfigurator.h>\n#include <log4cxx\/propertyconfigurator.h>\n#include <log4cxx\/helpers\/exception.h>\nusing namespace log4cxx;\nusing namespace log4cxx::helpers;\n\n#include <boost\/foreach.hpp>\n#include <boost\/program_options.hpp>\n#include \"boost\/date_time\/posix_time\/posix_time.hpp\"\nnamespace po = boost::program_options;\n\n#include \"rapidjson\/document.h\"\n#include \"rapidjson\/writer.h\"\n#include \"rapidjson\/prettywriter.h\"\n#include \"rapidjson\/stringbuffer.h\"\nusing namespace rapidjson;\n\n#include \"zmq\/zmq.hpp\"\n\n#include \"framenotifier_data.h\"\n#include \"FileWriter.h\"\n\nvoid parse_arguments(int argc, char** argv, po::variables_map& vm, LoggerPtr& logger)\n{\n    try\n    {\n        std::string config_file;\n\n        \/\/ Declare a group of options that will allowed only on the command line\n        po::options_description generic(\"Generic options\");\n        generic.add_options()\n                (\"help,h\",\n                    \"Print this help message\")\n                (\"config,c\",    po::value<string>(&config_file),\n                    \"Specify program configuration file\")\n                ;\n\n        \/\/ Declare a group of options that will be allowed both on the command line\n        \/\/ and in the configuration file\n        po::options_description config(\"Configuration options\");\n        config.add_options()\n                (\"logconfig,l\",  po::value<string>(),\n                    \"Set the log4cxx logging configuration file\")\n                (\"ready,r\",       po::value<std::string>()->default_value(\"tcp:\/\/127.0.0.1:5001\"),\n                    \"Ready ZMQ endpoint from frameReceiver\")\n                (\"release\",       po::value<std::string>()->default_value(\"tcp:\/\/127.0.0.1:5002\"),\n                        \"Release frame ZMQ endpoint from frameReceiver\")\n                (\"frames,f\",     po::value<unsigned int>()->default_value(1),\n                    \"Set the number of frames to be notified about before terminating\")\n                (\"sharedbuf\",    po::value<std::string>()->default_value(\"FrameReceiverBuffer\"),\n                    \"Set the name of the shared memory frame buffer\")\n                (\"output,o\",     po::value<std::string>(),\n                    \"Name of HDF5 file to write frames to (default: no file writing)\")\n                ;\n\n        \/\/ Group the variables for parsing at the command line and\/or from the configuration file\n        po::options_description cmdline_options;\n        cmdline_options.add(generic).add(config);\n        po::options_description config_file_options;\n        config_file_options.add(config);\n\n        \/\/ Parse the command line options\n        po::store(po::parse_command_line(argc, argv, cmdline_options), vm);\n        po::notify(vm);\n\n        \/\/ If the command-line help option was given, print help and exit\n        if (vm.count(\"help\"))\n        {\n            std::cout << \"usage: frameReceiver [options]\" << std::endl << std::endl;\n            std::cout << cmdline_options << std::endl;\n            exit(1);\n        }\n\n        \/\/ If the command line config option was given, parse the specified configuration\n        \/\/ file for additional options. Note that boost::program_options gives precedence\n        \/\/ to the first instance occurring. In this case, that implies that command-line\n        \/\/ options have precedence over equivalent configuration file entries.\n        if (vm.count(\"config\"))\n        {\n            std::ifstream config_ifs(config_file.c_str());\n            if (config_ifs)\n            {\n                LOG4CXX_DEBUG(logger, \"Parsing configuration file \" << config_file);\n                po::store(po::parse_config_file(config_ifs, config_file_options, true), vm);\n                po::notify(vm);\n            }\n            else\n            {\n                LOG4CXX_ERROR(logger, \"Unable to open configuration file \" << config_file << \" for parsing\");\n                exit(1);\n            }\n        }\n\n        if (vm.count(\"logconfig\"))\n        {\n            PropertyConfigurator::configure(vm[\"logconfig\"].as<string>());\n            LOG4CXX_DEBUG(logger, \"log4cxx config file is set to \" << vm[\"logconfig\"].as<string>());\n        }\n\n        if (vm.count(\"ready\"))\n        {\n            LOG4CXX_DEBUG(logger, \"Setting frame ready notification ZMQ address to \" << vm[\"ready\"].as<string>());\n        }\n\n        if (vm.count(\"release\"))\n        {\n            LOG4CXX_DEBUG(logger, \"Setting frame release notification ZMQ address to \" << vm[\"release\"].as<string>());\n        }\n\n        if (vm.count(\"frames\"))\n        {\n            LOG4CXX_DEBUG(logger, \"Setting number of frames to receive to \" << vm[\"frames\"].as<unsigned int>());\n        }\n\n        if (vm.count(\"output\"))\n        {\n            LOG4CXX_DEBUG(logger, \"Writing frames to file: \" << vm[\"output\"].as<string>());\n        }\n\n    }\n    catch (po::unknown_option &e)\n    {\n        LOG4CXX_WARN(logger, \"CLI parsing error: \" << e.what() << \". Will carry on...\");\n    }\n    catch (Exception &e)\n    {\n        LOG4CXX_FATAL(logger, \"Got Log4CXX exception: \" << e.what());\n        throw;\n    }\n    catch (exception &e)\n    {\n        LOG4CXX_ERROR(logger, \"Got exception:\" << e.what());\n        throw;\n    }\n    catch (...)\n    {\n        LOG4CXX_FATAL(logger, \"Exception of unknown type!\");\n        throw;\n    }\n}\n\nint main(int argc, char** argv)\n{\n    int rc = 0;\n\n    \/\/ Create a default basic logger configuration, which can be overridden by command-line option later\n    BasicConfigurator::configure();\n\n    LoggerPtr logger(Logger::getLogger(\"FrameNotifier\"));\n    po::variables_map vm;\n    parse_arguments(argc, argv, vm, logger);\n\n    SharedMemParser smp(vm[\"sharedbuf\"].as<string>());\n\n    \/\/ Assuming this is a P2M, our image dimensions are:\n    size_t bytes_per_pixel = 2;\n    dimensions_t p2m_dims(2); p2m_dims[0] = 1484; p2m_dims[1] = 1404;\n\n    zmq::context_t zmq_context; \/\/ Global ZMQ context\n\n    \/\/ The \"release\" ZMQ PUB socket, used to release frames back to the frameReceiver\n    zmq::socket_t zsocket_release(zmq_context, ZMQ_PUB);\n    zsocket_release.connect(vm[\"release\"].as<string>().c_str());\n\n    \/\/ The \"ready\" ZMQ SUB socket, used to get notifications that new frames are ready to be processed\n    zmq::socket_t zsocket_ready(zmq_context, ZMQ_SUB);\n    zsocket_ready.connect(vm[\"ready\"].as<string>().c_str());\n    zsocket_ready.setsockopt(ZMQ_SUBSCRIBE, \"\", strlen(\"\"));\n    zmq::pollitem_t poll_item;\n    poll_item.socket = zsocket_ready;\n    poll_item.events = ZMQ_POLLIN;\n    poll_item.fd = 0;\n    poll_item.revents = 0;\n\n    \/\/ The file writer object\n    FileWriter hdfwr;\n    bool write_file = false;\n    if (vm.count(\"output\")) {\n        write_file = true;\n        hdfwr.createFile(vm[\"output\"].as<string>());\n        FileWriter::DatasetDefinition dset_def;\n        dset_def.name = \"data\";\n        dset_def.frame_dimensions = p2m_dims;\n        dset_def.pixel = FileWriter::pixel_raw_16bit;\n        dset_def.num_frames = vm[\"frames\"].as<unsigned int>();\n        hdfwr.createDataset(dset_def);\n    }\n\n    \/\/ The polling loop. Polls on all elements in poll_item\n    \/\/ Stop the loop by setting keep_running=false\n    \/\/ Loop automatically ends if notification_count > user option \"frames\"\n    unsigned long notification_count = 0;\n    bool keep_running = true;\n    LOG4CXX_DEBUG(logger, \"Entering ZMQ polling loop (\" << vm[\"ready\"].as<string>().c_str() << \")\");\n    while (keep_running)\n    {\n        \/\/ Always reset the last raw events before polling\n        poll_item.revents = 0;\n\n        \/\/ Do the poll with a 10ms timeout (i.e. 10Hz poll)\n        zmq::poll(&poll_item, 1, 10);\n\n        \/\/ Check for poll error and exit the loop is one is found\n        if (poll_item.revents & ZMQ_POLLERR)\n        {\n            LOG4CXX_ERROR(logger, \"Got ZMQ error in polling. Quitting polling loop.\");\n            keep_running = false;\n        }\n        \/\/ Do work if a message is received\n        else if (poll_item.revents & ZMQ_POLLIN)\n        {\n            LOG4CXX_DEBUG(logger, \"Reading data from ZMQ socket\");\n            notification_count++;\n            zmq::message_t msg;\n            zsocket_ready.recv(&msg); \/\/ Read the message from the ready socket\n\n            string msg_str(reinterpret_cast<char*>(msg.data()), msg.size()-1);\n            LOG4CXX_DEBUG(logger, \"Parsing JSON msg string: \" << msg_str);\n            Document msg_doc;\n            msg_doc.Parse(msg_str.c_str()); \/\/ Parse the JSON string into a Document DOM object\n\n            \/\/ Setup a string buffer and a writer so we can stringify the Document DOM object again\n            StringBuffer buffer;\n            PrettyWriter<StringBuffer> writer(buffer);\n            msg_doc.Accept(writer);\n            LOG4CXX_DEBUG(logger, \"Parsed json: \" << buffer.GetString());\n\n            \/\/ Copy the data out into a Frame object\n            LOG4CXX_DEBUG(logger, \"Creating Frame object\");\n            Frame frame(bytes_per_pixel, p2m_dims);\n            LOG4CXX_DEBUG(logger, \"Copying buffer ID: \" << msg_doc[\"params\"][\"buffer_id\"].GetInt64());\n            smp.get_frame(frame, msg_doc[\"params\"][\"buffer_id\"].GetInt64());\n            LOG4CXX_DEBUG(logger, \"Frame completeness: \" << frame.get_header()->packets_received << \" packets received\");\n\n            \/\/ Clear the json string buffer and reset the writer so we can re-use them\n            \/\/ after modifying the Document DOM object\n            buffer.Clear();\n            writer.Reset(buffer);\n\n            \/\/ We want to return the exact same JSON message back to the frameReceiver\n            \/\/ so we just modify the relevant bits: msg_val: from frame_ready to frame_release\n            \/\/ and update the timestamp\n            msg_doc[\"msg_val\"].SetString(\"frame_release\");\n\n            \/\/ Create and update the timestamp in the JSON message\n            boost::posix_time::ptime msg_timestamp = boost::posix_time::microsec_clock::local_time();\n            string msg_timestamp_str = boost::posix_time::to_iso_extended_string(msg_timestamp);\n            msg_doc[\"timestamp\"].SetString(StringRef(msg_timestamp_str.c_str()));\n\n            \/\/ Encode the JSON Document DOM object using the writer\n            msg_doc.Accept(writer);\n            LOG4CXX_DEBUG(logger, \"Changing msg_val: \" << msg_doc[\"msg_val\"].GetString());\n            string release_msg(buffer.GetString()); \/\/ Get a copy of the JSON string\n            LOG4CXX_DEBUG(logger, \"New json: \" << release_msg);\n\n            LOG4CXX_DEBUG(logger, \"Sending release response\");\n            \/\/ Send the new JSON object (string) back to the frameReceiver on the \"release\" ZMQ socket\n            size_t nbytes = zsocket_release.send(release_msg.c_str(), release_msg.size() + 1);\n            LOG4CXX_DEBUG(logger, \"Sent \" << nbytes << \" bytes\");\n\n            \/\/ Write the frame to disk\n            if (write_file) hdfwr.writeFrame(frame);\n\n        } else\n        {\n            \/\/ No new data\n        }\n\n        \/\/ Quit the loop if we have received the desired number of frames\n        if (notification_count >= vm[\"frames\"].as<unsigned int>()) keep_running=false;\n    }\n    if (write_file) hdfwr.closeFile();\n    return rc;\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 \"base\/basictypes.h\"\n#include \"base\/command_line.h\"\n#if defined(OS_MACOSX)\n#include \"base\/mac\/mac_util.h\"\n#endif\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/win\/windows_version.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_test_message_listener.h\"\n#include \"chrome\/browser\/extensions\/tab_helper.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/fullscreen\/fullscreen_controller.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"chrome\/common\/extensions\/feature_switch.h\"\n#include \"chrome\/common\/extensions\/features\/base_feature_provider.h\"\n#include \"chrome\/common\/extensions\/features\/complex_feature.h\"\n#include \"chrome\/common\/extensions\/features\/simple_feature.h\"\n#include \"chrome\/test\/base\/test_switches.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"extensions\/common\/features\/feature.h\"\n\nnamespace {\n\nconst char kExtensionId[] = \"ddchlicdkolnonkihahngkmmmjnjlkkf\";\n\nclass TabCaptureApiTest : public ExtensionApiTest {\n public:\n  TabCaptureApiTest() {}\n\n  virtual void SetUp() OVERRIDE {\n    \/\/ TODO(danakj): The GPU Video Decoder needs real GL bindings.\n    \/\/ crbug.com\/269087\n    UseRealGLBindings();\n\n    ExtensionApiTest::SetUp();\n  }\n\n  void AddExtensionToCommandLineWhitelist() {\n    CommandLine::ForCurrentProcess()->AppendSwitchASCII(\n        switches::kWhitelistedExtensionID, kExtensionId);\n  }\n};\n\n}  \/\/ namespace\n\n\/\/ http:\/\/crbug.com\/261493 and http:\/\/crbug.com\/268644\n#if defined(OS_LINUX) || defined(OS_CHROMEOS) || defined(USE_AURA)\n#define MAYBE_ApiTests DISABLED_ApiTests\n#else\n#define MAYBE_ApiTests ApiTests\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_ApiTests) {\n#if defined(OS_WIN) && defined(USE_ASH)\n  \/\/ Disable this test in Metro+Ash for now (http:\/\/crbug.com\/262796).\n  if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kAshBrowserTests))\n    return;\n#endif\n\n#if defined(OS_WIN)\n  \/\/ TODO(justinlin): Disabled for WinXP due to timeout issues.\n  if (base::win::GetVersion() < base::win::VERSION_VISTA) {\n    return;\n  }\n#endif\n\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"api_tests.html\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/268644\n#if defined(USE_AURA)\n#define MAYBE_ApiTestsAudio DISABLED_ApiTestsAudio\n#else\n#define MAYBE_ApiTestsAudio ApiTestsAudio\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_ApiTestsAudio) {\n#if defined(OS_WIN)\n  \/\/ TODO(justinlin): Disabled for WinXP due to timeout issues.\n  if (base::win::GetVersion() < base::win::VERSION_VISTA) {\n    return;\n  }\n#endif\n\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"api_tests_audio.html\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/177163 and http:\/\/crbug.com\/268644\n#if defined(OS_WIN) && (!defined(NDEBUG) || defined(USE_AURA))\n#define MAYBE_EndToEnd DISABLED_EndToEnd\n#else\n#define MAYBE_EndToEnd EndToEnd\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_EndToEnd) {\n#if defined(OS_WIN)\n  \/\/ TODO(justinlin): Disabled for WinXP due to timeout issues.\n  if (base::win::GetVersion() < base::win::VERSION_VISTA) {\n    return;\n  }\n#endif\n#if defined(OS_MACOSX)\n  \/\/ TODO(miu): Disabled for Mac OS X 10.6 due to timeout issues.\n  \/\/ http:\/\/crbug.com\/174640\n  if (base::mac::IsOSSnowLeopard())\n    return;\n#endif\n\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"end_to_end.html\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/177163\n#if defined(OS_WIN) && !defined(NDEBUG)\n#define MAYBE_GetUserMediaTest DISABLED_GetUserMediaTest\n#else\n#define MAYBE_GetUserMediaTest GetUserMediaTest\n#endif\n\/\/ Test that we can't get tabCapture streams using GetUserMedia directly.\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_GetUserMediaTest) {\n  ExtensionTestMessageListener listener(\"ready\", true);\n\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"get_user_media_test.html\")) << message_;\n\n  EXPECT_TRUE(listener.WaitUntilSatisfied());\n\n  content::OpenURLParams params(GURL(\"about:blank\"), content::Referrer(),\n                                NEW_FOREGROUND_TAB,\n                                content::PAGE_TRANSITION_LINK, false);\n  content::WebContents* web_contents = browser()->OpenURL(params);\n\n  content::RenderViewHost* const rvh = web_contents->GetRenderViewHost();\n  int render_process_id = rvh->GetProcess()->GetID();\n  int routing_id = rvh->GetRoutingID();\n\n  listener.Reply(base::StringPrintf(\"%i:%i\", render_process_id, routing_id));\n\n  ResultCatcher catcher;\n  catcher.RestrictToProfile(browser()->profile());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n}\n\n\/\/ http:\/\/crbug.com\/177163\n#if defined(OS_WIN)\n#define MAYBE_ActiveTabPermission DISABLED_ActiveTabPermission\n#else\n#define MAYBE_ActiveTabPermission ActiveTabPermission\n#endif\n\/\/ Make sure tabCapture.capture only works if the tab has been granted\n\/\/ permission via an extension icon click or the extension is whitelisted.\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_ActiveTabPermission) {\n  ExtensionTestMessageListener before_open_tab(\"ready1\", true);\n  ExtensionTestMessageListener before_grant_permission(\"ready2\", true);\n  ExtensionTestMessageListener before_open_new_tab(\"ready3\", true);\n  ExtensionTestMessageListener before_whitelist_extension(\"ready4\", true);\n\n  ASSERT_TRUE(RunExtensionSubtest(\n      \"tab_capture\/experimental\", \"active_tab_permission_test.html\"))\n          << message_;\n\n  \/\/ Open a new tab and make sure capture is denied.\n  EXPECT_TRUE(before_open_tab.WaitUntilSatisfied());\n  content::OpenURLParams params(GURL(\"http:\/\/google.com\"), content::Referrer(),\n                                NEW_FOREGROUND_TAB,\n                                content::PAGE_TRANSITION_LINK, false);\n  content::WebContents* web_contents = browser()->OpenURL(params);\n  before_open_tab.Reply(\"\");\n\n  \/\/ Grant permission and make sure capture succeeds.\n  EXPECT_TRUE(before_grant_permission.WaitUntilSatisfied());\n  ExtensionService* extension_service =\n      Profile::FromBrowserContext(web_contents->GetBrowserContext())\n          ->GetExtensionService();\n  const extensions::Extension* extension =\n      extension_service->GetExtensionById(kExtensionId, false);\n  extensions::TabHelper::FromWebContents(web_contents)\n      ->active_tab_permission_granter()->GrantIfRequested(extension);\n  before_grant_permission.Reply(\"\");\n\n  \/\/ Open a new tab and make sure capture is denied.\n  EXPECT_TRUE(before_open_new_tab.WaitUntilSatisfied());\n  browser()->OpenURL(params);\n  before_open_new_tab.Reply(\"\");\n\n  \/\/ Add extension to whitelist and make sure capture succeeds.\n  EXPECT_TRUE(before_whitelist_extension.WaitUntilSatisfied());\n  AddExtensionToCommandLineWhitelist();\n  before_whitelist_extension.Reply(\"\");\n\n  ResultCatcher catcher;\n  catcher.RestrictToProfile(browser()->profile());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n}\n\n\/\/ http:\/\/crbug.com\/177163\n#if defined(OS_WIN) && !defined(NDEBUG)\n#define MAYBE_FullscreenEvents DISABLED_FullscreenEvents\n#elif defined(USE_AURA) || defined(OS_MACOSX)\n\/\/ These don't always fire fullscreen events when run in tests. Tested manually.\n#define MAYBE_FullscreenEvents DISABLED_FullscreenEvents\n#elif defined(OS_LINUX)\n\/\/ Flaky to get out of fullscreen in tests. Tested manually.\n#define MAYBE_FullscreenEvents DISABLED_FullscreenEvents\n#else\n#define MAYBE_FullscreenEvents FullscreenEvents\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_FullscreenEvents) {\n#if defined(OS_WIN)\n  \/\/ TODO(justinlin): Disabled for WinXP due to timeout issues.\n  if (base::win::GetVersion() < base::win::VERSION_VISTA) {\n    return;\n  }\n#endif\n\n  AddExtensionToCommandLineWhitelist();\n\n  content::OpenURLParams params(GURL(\"chrome:\/\/version\"),\n                                content::Referrer(),\n                                CURRENT_TAB,\n                                content::PAGE_TRANSITION_LINK, false);\n  content::WebContents* web_contents = browser()->OpenURL(params);\n\n  ExtensionTestMessageListener listeners_setup(\"ready1\", true);\n  ExtensionTestMessageListener fullscreen_entered(\"ready2\", true);\n\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"fullscreen_test.html\")) << message_;\n  EXPECT_TRUE(listeners_setup.WaitUntilSatisfied());\n\n  \/\/ Toggle fullscreen after setting up listeners.\n  browser()->fullscreen_controller()->ToggleFullscreenModeForTab(web_contents,\n                                                                 true);\n  listeners_setup.Reply(\"\");\n\n  \/\/ Toggle again after JS should have the event.\n  EXPECT_TRUE(fullscreen_entered.WaitUntilSatisfied());\n  browser()->fullscreen_controller()->ToggleFullscreenModeForTab(web_contents,\n                                                                 false);\n  fullscreen_entered.Reply(\"\");\n\n  ResultCatcher catcher;\n  catcher.RestrictToProfile(browser()->profile());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n}\n\n\/\/ Times out on Win dbg bots: http:\/\/crbug.com\/177163\n\/\/ #if defined(OS_WIN) && !defined(NDEBUG)\n\/\/ Times out on all Win bots: http:\/\/crbug.com\/294431\n#if defined(OS_WIN)\n#define MAYBE_GrantForChromePages DISABLED_GrantForChromePages\n#else\n#define MAYBE_GrantForChromePages GrantForChromePages\n#endif\n\/\/ Make sure tabCapture API can be granted for Chrome:\/\/ pages.\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_GrantForChromePages) {\n  ExtensionTestMessageListener before_open_tab(\"ready1\", true);\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"active_tab_chrome_pages.html\")) << message_;\n  EXPECT_TRUE(before_open_tab.WaitUntilSatisfied());\n\n  \/\/ Open a tab on a chrome:\/\/ page and make sure we can capture.\n  content::OpenURLParams params(GURL(\"chrome:\/\/version\"), content::Referrer(),\n                                NEW_FOREGROUND_TAB,\n                                content::PAGE_TRANSITION_LINK, false);\n  content::WebContents* web_contents = browser()->OpenURL(params);\n  ExtensionService* extension_service =\n      Profile::FromBrowserContext(web_contents->GetBrowserContext())\n          ->GetExtensionService();\n  extensions::TabHelper::FromWebContents(web_contents)\n      ->active_tab_permission_granter()->GrantIfRequested(\n            extension_service->GetExtensionById(kExtensionId, false));\n  before_open_tab.Reply(\"\");\n\n  ResultCatcher catcher;\n  catcher.RestrictToProfile(browser()->profile());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n}\n\n#if defined(OS_WIN)\n#define MAYBE_CaptureInSplitIncognitoMode DISABLED_CaptureInSplitIncognitoMode\n#else\n#define MAYBE_CaptureInSplitIncognitoMode CaptureInSplitIncognitoMode\n#endif\n\/\/ Test that a tab can be captured in split incognito mode.\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_CaptureInSplitIncognitoMode) {\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"incognito.html\",\n                                  kFlagEnableIncognito | kFlagUseIncognito))\n      << message_;\n}\n\n#if defined(OS_WIN)\n#define MAYBE_Constraints DISABLED_Constraints\n#else\n#define MAYBE_Constraints Constraints\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_Constraints) {\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"constraints.html\")) << message_;\n}\n<commit_msg>Re-enable TabCaptureApiTest.ApiTests for Linux.<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 \"base\/basictypes.h\"\n#include \"base\/command_line.h\"\n#if defined(OS_MACOSX)\n#include \"base\/mac\/mac_util.h\"\n#endif\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/win\/windows_version.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_test_message_listener.h\"\n#include \"chrome\/browser\/extensions\/tab_helper.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/fullscreen\/fullscreen_controller.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"chrome\/common\/extensions\/feature_switch.h\"\n#include \"chrome\/common\/extensions\/features\/base_feature_provider.h\"\n#include \"chrome\/common\/extensions\/features\/complex_feature.h\"\n#include \"chrome\/common\/extensions\/features\/simple_feature.h\"\n#include \"chrome\/test\/base\/test_switches.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"extensions\/common\/features\/feature.h\"\n\nnamespace {\n\nconst char kExtensionId[] = \"ddchlicdkolnonkihahngkmmmjnjlkkf\";\n\nclass TabCaptureApiTest : public ExtensionApiTest {\n public:\n  TabCaptureApiTest() {}\n\n  virtual void SetUp() OVERRIDE {\n    \/\/ TODO(danakj): The GPU Video Decoder needs real GL bindings.\n    \/\/ crbug.com\/269087\n    UseRealGLBindings();\n\n    ExtensionApiTest::SetUp();\n  }\n\n  void AddExtensionToCommandLineWhitelist() {\n    CommandLine::ForCurrentProcess()->AppendSwitchASCII(\n        switches::kWhitelistedExtensionID, kExtensionId);\n  }\n};\n\n}  \/\/ namespace\n\n\/\/ http:\/\/crbug.com\/261493 and http:\/\/crbug.com\/268644\n#if defined(OS_CHROMEOS) || defined(USE_AURA)\n#define MAYBE_ApiTests DISABLED_ApiTests\n#else\n#define MAYBE_ApiTests ApiTests\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_ApiTests) {\n#if defined(OS_WIN) && defined(USE_ASH)\n  \/\/ Disable this test in Metro+Ash for now (http:\/\/crbug.com\/262796).\n  if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kAshBrowserTests))\n    return;\n#endif\n\n#if defined(OS_WIN)\n  \/\/ TODO(justinlin): Disabled for WinXP due to timeout issues.\n  if (base::win::GetVersion() < base::win::VERSION_VISTA) {\n    return;\n  }\n#endif\n\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"api_tests.html\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/268644\n#if defined(USE_AURA)\n#define MAYBE_ApiTestsAudio DISABLED_ApiTestsAudio\n#else\n#define MAYBE_ApiTestsAudio ApiTestsAudio\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_ApiTestsAudio) {\n#if defined(OS_WIN)\n  \/\/ TODO(justinlin): Disabled for WinXP due to timeout issues.\n  if (base::win::GetVersion() < base::win::VERSION_VISTA) {\n    return;\n  }\n#endif\n\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"api_tests_audio.html\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/177163 and http:\/\/crbug.com\/268644\n#if defined(OS_WIN) && (!defined(NDEBUG) || defined(USE_AURA))\n#define MAYBE_EndToEnd DISABLED_EndToEnd\n#else\n#define MAYBE_EndToEnd EndToEnd\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_EndToEnd) {\n#if defined(OS_WIN)\n  \/\/ TODO(justinlin): Disabled for WinXP due to timeout issues.\n  if (base::win::GetVersion() < base::win::VERSION_VISTA) {\n    return;\n  }\n#endif\n#if defined(OS_MACOSX)\n  \/\/ TODO(miu): Disabled for Mac OS X 10.6 due to timeout issues.\n  \/\/ http:\/\/crbug.com\/174640\n  if (base::mac::IsOSSnowLeopard())\n    return;\n#endif\n\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"end_to_end.html\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/177163\n#if defined(OS_WIN) && !defined(NDEBUG)\n#define MAYBE_GetUserMediaTest DISABLED_GetUserMediaTest\n#else\n#define MAYBE_GetUserMediaTest GetUserMediaTest\n#endif\n\/\/ Test that we can't get tabCapture streams using GetUserMedia directly.\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_GetUserMediaTest) {\n  ExtensionTestMessageListener listener(\"ready\", true);\n\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"get_user_media_test.html\")) << message_;\n\n  EXPECT_TRUE(listener.WaitUntilSatisfied());\n\n  content::OpenURLParams params(GURL(\"about:blank\"), content::Referrer(),\n                                NEW_FOREGROUND_TAB,\n                                content::PAGE_TRANSITION_LINK, false);\n  content::WebContents* web_contents = browser()->OpenURL(params);\n\n  content::RenderViewHost* const rvh = web_contents->GetRenderViewHost();\n  int render_process_id = rvh->GetProcess()->GetID();\n  int routing_id = rvh->GetRoutingID();\n\n  listener.Reply(base::StringPrintf(\"%i:%i\", render_process_id, routing_id));\n\n  ResultCatcher catcher;\n  catcher.RestrictToProfile(browser()->profile());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n}\n\n\/\/ http:\/\/crbug.com\/177163\n#if defined(OS_WIN)\n#define MAYBE_ActiveTabPermission DISABLED_ActiveTabPermission\n#else\n#define MAYBE_ActiveTabPermission ActiveTabPermission\n#endif\n\/\/ Make sure tabCapture.capture only works if the tab has been granted\n\/\/ permission via an extension icon click or the extension is whitelisted.\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_ActiveTabPermission) {\n  ExtensionTestMessageListener before_open_tab(\"ready1\", true);\n  ExtensionTestMessageListener before_grant_permission(\"ready2\", true);\n  ExtensionTestMessageListener before_open_new_tab(\"ready3\", true);\n  ExtensionTestMessageListener before_whitelist_extension(\"ready4\", true);\n\n  ASSERT_TRUE(RunExtensionSubtest(\n      \"tab_capture\/experimental\", \"active_tab_permission_test.html\"))\n          << message_;\n\n  \/\/ Open a new tab and make sure capture is denied.\n  EXPECT_TRUE(before_open_tab.WaitUntilSatisfied());\n  content::OpenURLParams params(GURL(\"http:\/\/google.com\"), content::Referrer(),\n                                NEW_FOREGROUND_TAB,\n                                content::PAGE_TRANSITION_LINK, false);\n  content::WebContents* web_contents = browser()->OpenURL(params);\n  before_open_tab.Reply(\"\");\n\n  \/\/ Grant permission and make sure capture succeeds.\n  EXPECT_TRUE(before_grant_permission.WaitUntilSatisfied());\n  ExtensionService* extension_service =\n      Profile::FromBrowserContext(web_contents->GetBrowserContext())\n          ->GetExtensionService();\n  const extensions::Extension* extension =\n      extension_service->GetExtensionById(kExtensionId, false);\n  extensions::TabHelper::FromWebContents(web_contents)\n      ->active_tab_permission_granter()->GrantIfRequested(extension);\n  before_grant_permission.Reply(\"\");\n\n  \/\/ Open a new tab and make sure capture is denied.\n  EXPECT_TRUE(before_open_new_tab.WaitUntilSatisfied());\n  browser()->OpenURL(params);\n  before_open_new_tab.Reply(\"\");\n\n  \/\/ Add extension to whitelist and make sure capture succeeds.\n  EXPECT_TRUE(before_whitelist_extension.WaitUntilSatisfied());\n  AddExtensionToCommandLineWhitelist();\n  before_whitelist_extension.Reply(\"\");\n\n  ResultCatcher catcher;\n  catcher.RestrictToProfile(browser()->profile());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n}\n\n\/\/ http:\/\/crbug.com\/177163\n#if defined(OS_WIN) && !defined(NDEBUG)\n#define MAYBE_FullscreenEvents DISABLED_FullscreenEvents\n#elif defined(USE_AURA) || defined(OS_MACOSX)\n\/\/ These don't always fire fullscreen events when run in tests. Tested manually.\n#define MAYBE_FullscreenEvents DISABLED_FullscreenEvents\n#elif defined(OS_LINUX)\n\/\/ Flaky to get out of fullscreen in tests. Tested manually.\n#define MAYBE_FullscreenEvents DISABLED_FullscreenEvents\n#else\n#define MAYBE_FullscreenEvents FullscreenEvents\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_FullscreenEvents) {\n#if defined(OS_WIN)\n  \/\/ TODO(justinlin): Disabled for WinXP due to timeout issues.\n  if (base::win::GetVersion() < base::win::VERSION_VISTA) {\n    return;\n  }\n#endif\n\n  AddExtensionToCommandLineWhitelist();\n\n  content::OpenURLParams params(GURL(\"chrome:\/\/version\"),\n                                content::Referrer(),\n                                CURRENT_TAB,\n                                content::PAGE_TRANSITION_LINK, false);\n  content::WebContents* web_contents = browser()->OpenURL(params);\n\n  ExtensionTestMessageListener listeners_setup(\"ready1\", true);\n  ExtensionTestMessageListener fullscreen_entered(\"ready2\", true);\n\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"fullscreen_test.html\")) << message_;\n  EXPECT_TRUE(listeners_setup.WaitUntilSatisfied());\n\n  \/\/ Toggle fullscreen after setting up listeners.\n  browser()->fullscreen_controller()->ToggleFullscreenModeForTab(web_contents,\n                                                                 true);\n  listeners_setup.Reply(\"\");\n\n  \/\/ Toggle again after JS should have the event.\n  EXPECT_TRUE(fullscreen_entered.WaitUntilSatisfied());\n  browser()->fullscreen_controller()->ToggleFullscreenModeForTab(web_contents,\n                                                                 false);\n  fullscreen_entered.Reply(\"\");\n\n  ResultCatcher catcher;\n  catcher.RestrictToProfile(browser()->profile());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n}\n\n\/\/ Times out on Win dbg bots: http:\/\/crbug.com\/177163\n\/\/ #if defined(OS_WIN) && !defined(NDEBUG)\n\/\/ Times out on all Win bots: http:\/\/crbug.com\/294431\n#if defined(OS_WIN)\n#define MAYBE_GrantForChromePages DISABLED_GrantForChromePages\n#else\n#define MAYBE_GrantForChromePages GrantForChromePages\n#endif\n\/\/ Make sure tabCapture API can be granted for Chrome:\/\/ pages.\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_GrantForChromePages) {\n  ExtensionTestMessageListener before_open_tab(\"ready1\", true);\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"active_tab_chrome_pages.html\")) << message_;\n  EXPECT_TRUE(before_open_tab.WaitUntilSatisfied());\n\n  \/\/ Open a tab on a chrome:\/\/ page and make sure we can capture.\n  content::OpenURLParams params(GURL(\"chrome:\/\/version\"), content::Referrer(),\n                                NEW_FOREGROUND_TAB,\n                                content::PAGE_TRANSITION_LINK, false);\n  content::WebContents* web_contents = browser()->OpenURL(params);\n  ExtensionService* extension_service =\n      Profile::FromBrowserContext(web_contents->GetBrowserContext())\n          ->GetExtensionService();\n  extensions::TabHelper::FromWebContents(web_contents)\n      ->active_tab_permission_granter()->GrantIfRequested(\n            extension_service->GetExtensionById(kExtensionId, false));\n  before_open_tab.Reply(\"\");\n\n  ResultCatcher catcher;\n  catcher.RestrictToProfile(browser()->profile());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n}\n\n#if defined(OS_WIN)\n#define MAYBE_CaptureInSplitIncognitoMode DISABLED_CaptureInSplitIncognitoMode\n#else\n#define MAYBE_CaptureInSplitIncognitoMode CaptureInSplitIncognitoMode\n#endif\n\/\/ Test that a tab can be captured in split incognito mode.\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_CaptureInSplitIncognitoMode) {\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"incognito.html\",\n                                  kFlagEnableIncognito | kFlagUseIncognito))\n      << message_;\n}\n\n#if defined(OS_WIN)\n#define MAYBE_Constraints DISABLED_Constraints\n#else\n#define MAYBE_Constraints Constraints\n#endif\nIN_PROC_BROWSER_TEST_F(TabCaptureApiTest, MAYBE_Constraints) {\n  AddExtensionToCommandLineWhitelist();\n  ASSERT_TRUE(RunExtensionSubtest(\"tab_capture\/experimental\",\n                                  \"constraints.html\")) << message_;\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\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/automation\/tab_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\nclass NotificationsPermissionTest : public UITest {\n public:\n  NotificationsPermissionTest() {\n    dom_automation_enabled_ = true;\n    show_window_ = true;\n  }\n};\n\n\/\/ Flaky, http:\/\/crbug.com\/62311.\nTEST_F(NotificationsPermissionTest, FLAKY_TestUserGestureInfobar) {\n  net::TestServer test_server(net::TestServer::TYPE_HTTP,\n                              FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n  ASSERT_TRUE(test_server.Start());\n\n  scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(browser.get());\n  scoped_refptr<TabProxy> tab(browser->GetActiveTab());\n  ASSERT_TRUE(tab.get());\n  ASSERT_EQ(AUTOMATION_MSG_NAVIGATION_SUCCESS,\n            tab->NavigateToURL(test_server.GetURL(\n                \"files\/notifications\/notifications_request_function.html\")));\n  WaitUntilTabCount(1);\n\n  \/\/ Request permission by calling request() while eval'ing an inline script;\n  \/\/ That's considered a user gesture to webkit, and should produce an infobar.\n  bool result;\n  ASSERT_TRUE(tab->ExecuteAndExtractBool(\n      L\"\",\n      L\"window.domAutomationController.send(request());\",\n      &result));\n  EXPECT_TRUE(result);\n\n  EXPECT_TRUE(tab->WaitForInfoBarCount(1));\n}\n\n\/\/ Flaky, http:\/\/crbug.com\/62311.\nTEST_F(NotificationsPermissionTest, FLAKY_TestNoUserGestureInfobar) {\n  net::TestServer test_server(net::TestServer::TYPE_HTTP,\n                              FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n  ASSERT_TRUE(test_server.Start());\n\n  scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(browser.get());\n  scoped_refptr<TabProxy> tab(browser->GetActiveTab());\n  ASSERT_TRUE(tab.get());\n\n  \/\/ Load a page which just does a request; no user gesture should result\n  \/\/ in no infobar.\n  ASSERT_EQ(AUTOMATION_MSG_NAVIGATION_SUCCESS,\n            tab->NavigateToURL(test_server.GetURL(\n                \"files\/notifications\/notifications_request_inline.html\")));\n  WaitUntilTabCount(1);\n\n  size_t info_bar_count;\n  ASSERT_TRUE(tab->GetInfoBarCount(&info_bar_count));\n  EXPECT_EQ(0U, info_bar_count);\n}\n<commit_msg>Disable test that's timing out BUG=74428 TEST=none Review URL: http:\/\/codereview.chromium.org\/6598038<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\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/automation\/tab_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\nclass NotificationsPermissionTest : public UITest {\n public:\n  NotificationsPermissionTest() {\n    dom_automation_enabled_ = true;\n    show_window_ = true;\n  }\n};\n\n\/\/ Flaky, http:\/\/crbug.com\/62311 and http:\/\/crbug.com\/74428.\nTEST_F(NotificationsPermissionTest, DISABLED_TestUserGestureInfobar) {\n  net::TestServer test_server(net::TestServer::TYPE_HTTP,\n                              FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n  ASSERT_TRUE(test_server.Start());\n\n  scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(browser.get());\n  scoped_refptr<TabProxy> tab(browser->GetActiveTab());\n  ASSERT_TRUE(tab.get());\n  ASSERT_EQ(AUTOMATION_MSG_NAVIGATION_SUCCESS,\n            tab->NavigateToURL(test_server.GetURL(\n                \"files\/notifications\/notifications_request_function.html\")));\n  WaitUntilTabCount(1);\n\n  \/\/ Request permission by calling request() while eval'ing an inline script;\n  \/\/ That's considered a user gesture to webkit, and should produce an infobar.\n  bool result;\n  ASSERT_TRUE(tab->ExecuteAndExtractBool(\n      L\"\",\n      L\"window.domAutomationController.send(request());\",\n      &result));\n  EXPECT_TRUE(result);\n\n  EXPECT_TRUE(tab->WaitForInfoBarCount(1));\n}\n\n\/\/ Flaky, http:\/\/crbug.com\/62311.\nTEST_F(NotificationsPermissionTest, FLAKY_TestNoUserGestureInfobar) {\n  net::TestServer test_server(net::TestServer::TYPE_HTTP,\n                              FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n  ASSERT_TRUE(test_server.Start());\n\n  scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(browser.get());\n  scoped_refptr<TabProxy> tab(browser->GetActiveTab());\n  ASSERT_TRUE(tab.get());\n\n  \/\/ Load a page which just does a request; no user gesture should result\n  \/\/ in no infobar.\n  ASSERT_EQ(AUTOMATION_MSG_NAVIGATION_SUCCESS,\n            tab->NavigateToURL(test_server.GetURL(\n                \"files\/notifications\/notifications_request_inline.html\")));\n  WaitUntilTabCount(1);\n\n  size_t info_bar_count;\n  ASSERT_TRUE(tab->GetInfoBarCount(&info_bar_count));\n  EXPECT_EQ(0U, info_bar_count);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2013-2015 John Connor (BM-NC49AxAjcqVcF5jNPu85Rb8MJ2d9JqZt)\n *\n * This file is part of vanillacoin.\n *\n * vanillacoin is free software: you can redistribute it and\/or modify\n * 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 <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <coin\/globals.hpp>\n#include <coin\/stack_impl.hpp>\n#include <coin\/zerotime.hpp>\n#include <coin\/zerotime_manager.hpp>\n\nusing namespace coin;\n\nzerotime_manager::zerotime_manager(\n    boost::asio::io_service & ios, boost::asio::strand & s, stack_impl & owner\n    )\n    : io_service_(ios)\n    , strand_(s)\n    , stack_impl_(owner)\n    , timer_(ios)\n{\n    \/\/ ...\n}\n\nvoid zerotime_manager::start()\n{\n    \/**\n     * Start the timer.\n     *\/\n    do_tick(60);\n}\n\nvoid zerotime_manager::stop()\n{\n    timer_.cancel();\n}\n\nvoid zerotime_manager::probe_for_answers(\n    const sha256 & hash_tx,\n    const std::vector<transaction_in> & transactions_in\n    )\n{\n    if (globals::instance().is_zerotime_enabled())\n    {\n        if (m_questions.count(hash_tx) == 0)\n        {\n            #warning :TODO:\n            \n            \/\/ Prepare:\n            \/\/ :TODO: m_questions[hash_tx] = zerotime_question(transactions_in);\n            \/\/ :TODO: 6 blocks = 20 mins = 1200 seconds\n            \/\/ :TODO: m_qa_expire_times[hash_tx] = std::time(0) + (20 * 60);\n            \n            \/\/ Probe:\n            \/\/ :TODO: auto addrs = stack_impl_.get_address_manager()->get_addr(8);\n            \/\/ :TODO: m_questioned_tcp_endpoints[hash_tx].push_back(addrs[0]);\n\n            \/\/ Listen:\n            \/\/ :TODO: m_answers_tcp[ztanswer.hash_tx()].push_back(std::make_pair(ep, ztanswer));\n        }\n    }\n}\n\nvoid zerotime_manager::do_tick(const std::uint32_t & interval)\n{\n    auto self(shared_from_this());\n    \n    timer_.expires_from_now(std::chrono::seconds(interval));\n    timer_.async_wait(strand_.wrap([this, self, interval]\n        (boost::system::error_code ec)\n    {\n        if (ec)\n        {\n            \/\/ ...\n        }\n        else\n        {\n            if (globals::instance().is_zerotime_enabled())\n            {\n                \/**\n                 * Clear expired input locks.\n                 *\/\n                zerotime::instance().clear_expired_input_locks();\n            }\n            \n            \/**\n             * Start the timer.\n             *\/\n            do_tick(60);\n        }\n    }));\n}\n<commit_msg>removed compile warning<commit_after>\/*\n * Copyright (c) 2013-2015 John Connor (BM-NC49AxAjcqVcF5jNPu85Rb8MJ2d9JqZt)\n *\n * This file is part of vanillacoin.\n *\n * vanillacoin is free software: you can redistribute it and\/or modify\n * 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 <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <coin\/globals.hpp>\n#include <coin\/stack_impl.hpp>\n#include <coin\/zerotime.hpp>\n#include <coin\/zerotime_manager.hpp>\n\nusing namespace coin;\n\nzerotime_manager::zerotime_manager(\n    boost::asio::io_service & ios, boost::asio::strand & s, stack_impl & owner\n    )\n    : io_service_(ios)\n    , strand_(s)\n    , stack_impl_(owner)\n    , timer_(ios)\n{\n    \/\/ ...\n}\n\nvoid zerotime_manager::start()\n{\n    \/**\n     * Start the timer.\n     *\/\n    do_tick(60);\n}\n\nvoid zerotime_manager::stop()\n{\n    timer_.cancel();\n}\n\nvoid zerotime_manager::probe_for_answers(\n    const sha256 & hash_tx,\n    const std::vector<transaction_in> & transactions_in\n    )\n{\n    if (globals::instance().is_zerotime_enabled())\n    {\n        if (m_questions.count(hash_tx) == 0)\n        {\n            \n        }\n    }\n}\n\nvoid zerotime_manager::do_tick(const std::uint32_t & interval)\n{\n    auto self(shared_from_this());\n    \n    timer_.expires_from_now(std::chrono::seconds(interval));\n    timer_.async_wait(strand_.wrap([this, self, interval]\n        (boost::system::error_code ec)\n    {\n        if (ec)\n        {\n            \/\/ ...\n        }\n        else\n        {\n            if (globals::instance().is_zerotime_enabled())\n            {\n                \/**\n                 * Clear expired input locks.\n                 *\/\n                zerotime::instance().clear_expired_input_locks();\n            }\n            \n            \/**\n             * Start the timer.\n             *\/\n            do_tick(60);\n        }\n    }));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015 Cryptonomex, Inc., and contributors.\n *\n * The MIT License\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 <graphene\/account_history\/account_history_plugin.hpp>\n\n#include <graphene\/chain\/impacted.hpp>\n\n#include <graphene\/chain\/account_evaluator.hpp>\n#include <graphene\/chain\/account_object.hpp>\n#include <graphene\/chain\/config.hpp>\n#include <graphene\/chain\/database.hpp>\n#include <graphene\/chain\/evaluator.hpp>\n#include <graphene\/chain\/operation_history_object.hpp>\n#include <graphene\/chain\/transaction_evaluation_state.hpp>\n\n#include <fc\/smart_ref_impl.hpp>\n#include <fc\/thread\/thread.hpp>\n\nnamespace graphene { namespace account_history {\n\nnamespace detail\n{\n\n\nclass account_history_plugin_impl\n{\n   public:\n      account_history_plugin_impl(account_history_plugin& _plugin)\n         : _self( _plugin )\n      { }\n      virtual ~account_history_plugin_impl();\n\n\n      \/** this method is called as a callback after a block is applied\n       * and will process\/index all operations that were applied in the block.\n       *\/\n      void update_account_histories( const signed_block& b );\n\n      graphene::chain::database& database()\n      {\n         return _self.database();\n      }\n\n      account_history_plugin& _self;\n      flat_set<account_id_type> _tracked_accounts;\n      bool _partial_operations = false;\n      primary_index< operation_history_index >* _oho_index;\n      uint64_t _max_ops_per_account = -1;\n   private:\n      \/** add one history record, then check and remove the earliest history record *\/\n      void add_account_history( const account_id_type account_id, const operation_history_id_type op_id );\n\n};\n\naccount_history_plugin_impl::~account_history_plugin_impl()\n{\n   return;\n}\n\nvoid account_history_plugin_impl::update_account_histories( const signed_block& b )\n{\n   graphene::chain::database& db = database();\n   const vector<optional< operation_history_object > >& hist = db.get_applied_operations();\n   bool is_first = true;\n   auto skip_oho_id = [&is_first,&db,this]() {\n      if( is_first && db._undo_db.enabled() ) \/\/ this ensures that the current id is rolled back on undo\n      {\n         db.remove( db.create<operation_history_object>( []( operation_history_object& obj) {} ) );\n         is_first = false;\n      }\n      else\n         _oho_index->use_next_id();\n   };\n\n   for( const optional< operation_history_object >& o_op : hist )\n   {\n      optional<operation_history_object> oho;\n\n      auto create_oho = [&]() {\n         is_first = false;\n         return optional<operation_history_object>( db.create<operation_history_object>( [&]( operation_history_object& h )\n         {\n            if( o_op.valid() )\n            {\n               h.op           = o_op->op;\n               h.result       = o_op->result;\n               h.block_num    = o_op->block_num;\n               h.trx_in_block = o_op->trx_in_block;\n               h.op_in_trx    = o_op->op_in_trx;\n               h.virtual_op   = o_op->virtual_op;\n            }\n         } ) );\n      };\n\n      if( !o_op.valid() || ( _max_ops_per_account == 0 && _partial_operations ) )\n      {\n         \/\/ Note: the 2nd and 3rd checks above are for better performance, when the db is not clean,\n         \/\/       they will break consistency of account_stats.total_ops and removed_ops and most_recent_op\n         skip_oho_id();\n         continue;\n      }\n      else if( !_partial_operations )\n         \/\/ add to the operation history index\n         oho = create_oho();\n\n      const operation_history_object& op = *o_op;\n\n      \/\/ get the set of accounts this operation applies to\n      flat_set<account_id_type> impacted;\n      vector<authority> other;\n      operation_get_required_authorities( op.op, impacted, impacted, other ); \/\/ fee_payer is added here\n\n      if( op.op.which() == operation::tag< account_create_operation >::value )\n         impacted.insert( op.result.get<object_id_type>() );\n      else\n         graphene::chain::operation_get_impacted_accounts( op.op, impacted );\n\n      for( auto& a : other )\n         for( auto& item : a.account_auths )\n            impacted.insert( item.first );\n\n      \/\/ be here, either _max_ops_per_account > 0, or _partial_operations == false, or both\n      \/\/ if _partial_operations == false, oho should have been created above\n      \/\/ so the only case should be checked here is:\n      \/\/    whether need to create oho if _max_ops_per_account > 0 and _partial_operations == true\n\n      \/\/ for each operation this account applies to that is in the config link it into the history\n      if( _tracked_accounts.size() == 0 ) \/\/ tracking all accounts\n      {\n         \/\/ if tracking all accounts, when impacted is not empty (although it will always be),\n         \/\/    still need to create oho if _max_ops_per_account > 0 and _partial_operations == true\n         \/\/    so always need to create oho if not done\n         if (!impacted.empty() && !oho.valid()) { oho = create_oho(); }\n\n         if( _max_ops_per_account > 0 )\n         {\n            \/\/ Note: the check above is for better performance, when the db is not clean,\n            \/\/       it breaks consistency of account_stats.total_ops and removed_ops and most_recent_op,\n            \/\/       but it ensures it's safe to remove old entries in add_account_history(...)\n            for( auto& account_id : impacted )\n            {\n               \/\/ we don't do index_account_keys here anymore, because\n               \/\/ that indexing now happens in observers' post_evaluate()\n\n               \/\/ add history\n               add_account_history( account_id, oho->id );\n            }\n         }\n      }\n      else \/\/ tracking a subset of accounts\n      {\n         \/\/ whether need to create oho if _max_ops_per_account > 0 and _partial_operations == true ?\n         \/\/ the answer: only need to create oho if a tracked account is impacted and need to save history\n\n         if( _max_ops_per_account > 0 )\n         {\n            \/\/ Note: the check above is for better performance, when the db is not clean,\n            \/\/       it breaks consistency of account_stats.total_ops and removed_ops and most_recent_op,\n            \/\/       but it ensures it's safe to remove old entries in add_account_history(...)\n            for( auto account_id : _tracked_accounts )\n            {\n               if( impacted.find( account_id ) != impacted.end() )\n               {\n                  if (!oho.valid()) { oho = create_oho(); }\n                  \/\/ add history\n                  add_account_history( account_id, oho->id );\n               }\n            }\n         }\n      }\n      if (_partial_operations && ! oho.valid())\n         skip_oho_id();\n   }\n}\n\nvoid account_history_plugin_impl::add_account_history( const account_id_type account_id, const operation_history_id_type op_id )\n{\n   graphene::chain::database& db = database();\n   const auto& stats_obj = account_id(db).statistics(db);\n   \/\/ add new entry\n   const auto& ath = db.create<account_transaction_history_object>( [&]( account_transaction_history_object& obj ){\n       obj.operation_id = op_id;\n       obj.account = account_id;\n       obj.sequence = stats_obj.total_ops + 1;\n       obj.next = stats_obj.most_recent_op;\n   });\n   db.modify( stats_obj, [&]( account_statistics_object& obj ){\n       obj.most_recent_op = ath.id;\n       obj.total_ops = ath.sequence;\n   });\n   \/\/ remove the earliest account history entry if too many\n   \/\/ _max_ops_per_account is guaranteed to be non-zero outside\n   if( stats_obj.total_ops - stats_obj.removed_ops > _max_ops_per_account )\n   {\n      \/\/ look for the earliest entry\n      const auto& his_idx = db.get_index_type<account_transaction_history_index>();\n      const auto& by_seq_idx = his_idx.indices().get<by_seq>();\n      auto itr = by_seq_idx.lower_bound( boost::make_tuple( account_id, 0 ) );\n      \/\/ make sure don't remove the one just added\n      if( itr != by_seq_idx.end() && itr->account == account_id && itr->id != ath.id )\n      {\n         \/\/ if found, remove the entry, and adjust account stats object\n         const auto remove_op_id = itr->operation_id;\n         const auto itr_remove = itr;\n         ++itr;\n         db.remove( *itr_remove );\n         db.modify( stats_obj, [&]( account_statistics_object& obj ){\n             obj.removed_ops = obj.removed_ops + 1;\n         });\n         \/\/ modify previous node's next pointer\n         \/\/ this should be always true, but just have a check here\n         if( itr != by_seq_idx.end() && itr->account == account_id )\n         {\n            db.modify( *itr, [&]( account_transaction_history_object& obj ){\n               obj.next = account_transaction_history_id_type();\n            });\n         }\n         \/\/ else need to modify the head pointer, but it shouldn't be true\n\n         \/\/ remove the operation history entry (1.11.x) if configured and no reference left\n         if( _partial_operations )\n         {\n            \/\/ check for references\n            const auto& by_opid_idx = his_idx.indices().get<by_opid>();\n            if( by_opid_idx.find( remove_op_id ) == by_opid_idx.end() )\n            {\n               \/\/ if no reference, remove\n               db.remove( remove_op_id(db) );\n            }\n         }\n      }\n   }\n}\n\n} \/\/ end namespace detail\n\n\n\n\n\n\naccount_history_plugin::account_history_plugin() :\n   my( new detail::account_history_plugin_impl(*this) )\n{\n}\n\naccount_history_plugin::~account_history_plugin()\n{\n}\n\nstd::string account_history_plugin::plugin_name()const\n{\n   return \"account_history\";\n}\n\nvoid account_history_plugin::plugin_set_program_options(\n   boost::program_options::options_description& cli,\n   boost::program_options::options_description& cfg\n   )\n{\n   cli.add_options()\n         (\"track-account\", boost::program_options::value<std::vector<std::string>>()->composing()->multitoken(), \"Account ID to track history for (may specify multiple times)\")\n         (\"partial-operations\", boost::program_options::value<bool>(), \"Keep only those operations in memory that are related to account history tracking\")\n         (\"max-ops-per-account\", boost::program_options::value<uint32_t>(), \"Maximum number of operations per account will be kept in memory\")\n         ;\n   cfg.add(cli);\n}\n\nvoid account_history_plugin::plugin_initialize(const boost::program_options::variables_map& options)\n{\n   database().applied_block.connect( [&]( const signed_block& b){ my->update_account_histories(b); } );\n   my->_oho_index = database().add_index< primary_index< operation_history_index > >();\n   database().add_index< primary_index< account_transaction_history_index > >();\n\n   LOAD_VALUE_SET(options, \"track-account\", my->_tracked_accounts, graphene::chain::account_id_type);\n   if (options.count(\"partial-operations\")) {\n       my->_partial_operations = options[\"partial-operations\"].as<bool>();\n   }\n   if (options.count(\"max-ops-per-account\")) {\n       my->_max_ops_per_account = options[\"max-ops-per-account\"].as<uint64_t>();\n   }\n}\n\nvoid account_history_plugin::plugin_startup()\n{\n}\n\nflat_set<account_id_type> account_history_plugin::tracked_accounts() const\n{\n   return my->_tracked_accounts;\n}\n\n} }\n<commit_msg>Update max-ops-per-account program option to 64bit<commit_after>\/*\n * Copyright (c) 2015 Cryptonomex, Inc., and contributors.\n *\n * The MIT License\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 <graphene\/account_history\/account_history_plugin.hpp>\n\n#include <graphene\/chain\/impacted.hpp>\n\n#include <graphene\/chain\/account_evaluator.hpp>\n#include <graphene\/chain\/account_object.hpp>\n#include <graphene\/chain\/config.hpp>\n#include <graphene\/chain\/database.hpp>\n#include <graphene\/chain\/evaluator.hpp>\n#include <graphene\/chain\/operation_history_object.hpp>\n#include <graphene\/chain\/transaction_evaluation_state.hpp>\n\n#include <fc\/smart_ref_impl.hpp>\n#include <fc\/thread\/thread.hpp>\n\nnamespace graphene { namespace account_history {\n\nnamespace detail\n{\n\n\nclass account_history_plugin_impl\n{\n   public:\n      account_history_plugin_impl(account_history_plugin& _plugin)\n         : _self( _plugin )\n      { }\n      virtual ~account_history_plugin_impl();\n\n\n      \/** this method is called as a callback after a block is applied\n       * and will process\/index all operations that were applied in the block.\n       *\/\n      void update_account_histories( const signed_block& b );\n\n      graphene::chain::database& database()\n      {\n         return _self.database();\n      }\n\n      account_history_plugin& _self;\n      flat_set<account_id_type> _tracked_accounts;\n      bool _partial_operations = false;\n      primary_index< operation_history_index >* _oho_index;\n      uint64_t _max_ops_per_account = -1;\n   private:\n      \/** add one history record, then check and remove the earliest history record *\/\n      void add_account_history( const account_id_type account_id, const operation_history_id_type op_id );\n\n};\n\naccount_history_plugin_impl::~account_history_plugin_impl()\n{\n   return;\n}\n\nvoid account_history_plugin_impl::update_account_histories( const signed_block& b )\n{\n   graphene::chain::database& db = database();\n   const vector<optional< operation_history_object > >& hist = db.get_applied_operations();\n   bool is_first = true;\n   auto skip_oho_id = [&is_first,&db,this]() {\n      if( is_first && db._undo_db.enabled() ) \/\/ this ensures that the current id is rolled back on undo\n      {\n         db.remove( db.create<operation_history_object>( []( operation_history_object& obj) {} ) );\n         is_first = false;\n      }\n      else\n         _oho_index->use_next_id();\n   };\n\n   for( const optional< operation_history_object >& o_op : hist )\n   {\n      optional<operation_history_object> oho;\n\n      auto create_oho = [&]() {\n         is_first = false;\n         return optional<operation_history_object>( db.create<operation_history_object>( [&]( operation_history_object& h )\n         {\n            if( o_op.valid() )\n            {\n               h.op           = o_op->op;\n               h.result       = o_op->result;\n               h.block_num    = o_op->block_num;\n               h.trx_in_block = o_op->trx_in_block;\n               h.op_in_trx    = o_op->op_in_trx;\n               h.virtual_op   = o_op->virtual_op;\n            }\n         } ) );\n      };\n\n      if( !o_op.valid() || ( _max_ops_per_account == 0 && _partial_operations ) )\n      {\n         \/\/ Note: the 2nd and 3rd checks above are for better performance, when the db is not clean,\n         \/\/       they will break consistency of account_stats.total_ops and removed_ops and most_recent_op\n         skip_oho_id();\n         continue;\n      }\n      else if( !_partial_operations )\n         \/\/ add to the operation history index\n         oho = create_oho();\n\n      const operation_history_object& op = *o_op;\n\n      \/\/ get the set of accounts this operation applies to\n      flat_set<account_id_type> impacted;\n      vector<authority> other;\n      operation_get_required_authorities( op.op, impacted, impacted, other ); \/\/ fee_payer is added here\n\n      if( op.op.which() == operation::tag< account_create_operation >::value )\n         impacted.insert( op.result.get<object_id_type>() );\n      else\n         graphene::chain::operation_get_impacted_accounts( op.op, impacted );\n\n      for( auto& a : other )\n         for( auto& item : a.account_auths )\n            impacted.insert( item.first );\n\n      \/\/ be here, either _max_ops_per_account > 0, or _partial_operations == false, or both\n      \/\/ if _partial_operations == false, oho should have been created above\n      \/\/ so the only case should be checked here is:\n      \/\/    whether need to create oho if _max_ops_per_account > 0 and _partial_operations == true\n\n      \/\/ for each operation this account applies to that is in the config link it into the history\n      if( _tracked_accounts.size() == 0 ) \/\/ tracking all accounts\n      {\n         \/\/ if tracking all accounts, when impacted is not empty (although it will always be),\n         \/\/    still need to create oho if _max_ops_per_account > 0 and _partial_operations == true\n         \/\/    so always need to create oho if not done\n         if (!impacted.empty() && !oho.valid()) { oho = create_oho(); }\n\n         if( _max_ops_per_account > 0 )\n         {\n            \/\/ Note: the check above is for better performance, when the db is not clean,\n            \/\/       it breaks consistency of account_stats.total_ops and removed_ops and most_recent_op,\n            \/\/       but it ensures it's safe to remove old entries in add_account_history(...)\n            for( auto& account_id : impacted )\n            {\n               \/\/ we don't do index_account_keys here anymore, because\n               \/\/ that indexing now happens in observers' post_evaluate()\n\n               \/\/ add history\n               add_account_history( account_id, oho->id );\n            }\n         }\n      }\n      else \/\/ tracking a subset of accounts\n      {\n         \/\/ whether need to create oho if _max_ops_per_account > 0 and _partial_operations == true ?\n         \/\/ the answer: only need to create oho if a tracked account is impacted and need to save history\n\n         if( _max_ops_per_account > 0 )\n         {\n            \/\/ Note: the check above is for better performance, when the db is not clean,\n            \/\/       it breaks consistency of account_stats.total_ops and removed_ops and most_recent_op,\n            \/\/       but it ensures it's safe to remove old entries in add_account_history(...)\n            for( auto account_id : _tracked_accounts )\n            {\n               if( impacted.find( account_id ) != impacted.end() )\n               {\n                  if (!oho.valid()) { oho = create_oho(); }\n                  \/\/ add history\n                  add_account_history( account_id, oho->id );\n               }\n            }\n         }\n      }\n      if (_partial_operations && ! oho.valid())\n         skip_oho_id();\n   }\n}\n\nvoid account_history_plugin_impl::add_account_history( const account_id_type account_id, const operation_history_id_type op_id )\n{\n   graphene::chain::database& db = database();\n   const auto& stats_obj = account_id(db).statistics(db);\n   \/\/ add new entry\n   const auto& ath = db.create<account_transaction_history_object>( [&]( account_transaction_history_object& obj ){\n       obj.operation_id = op_id;\n       obj.account = account_id;\n       obj.sequence = stats_obj.total_ops + 1;\n       obj.next = stats_obj.most_recent_op;\n   });\n   db.modify( stats_obj, [&]( account_statistics_object& obj ){\n       obj.most_recent_op = ath.id;\n       obj.total_ops = ath.sequence;\n   });\n   \/\/ remove the earliest account history entry if too many\n   \/\/ _max_ops_per_account is guaranteed to be non-zero outside\n   if( stats_obj.total_ops - stats_obj.removed_ops > _max_ops_per_account )\n   {\n      \/\/ look for the earliest entry\n      const auto& his_idx = db.get_index_type<account_transaction_history_index>();\n      const auto& by_seq_idx = his_idx.indices().get<by_seq>();\n      auto itr = by_seq_idx.lower_bound( boost::make_tuple( account_id, 0 ) );\n      \/\/ make sure don't remove the one just added\n      if( itr != by_seq_idx.end() && itr->account == account_id && itr->id != ath.id )\n      {\n         \/\/ if found, remove the entry, and adjust account stats object\n         const auto remove_op_id = itr->operation_id;\n         const auto itr_remove = itr;\n         ++itr;\n         db.remove( *itr_remove );\n         db.modify( stats_obj, [&]( account_statistics_object& obj ){\n             obj.removed_ops = obj.removed_ops + 1;\n         });\n         \/\/ modify previous node's next pointer\n         \/\/ this should be always true, but just have a check here\n         if( itr != by_seq_idx.end() && itr->account == account_id )\n         {\n            db.modify( *itr, [&]( account_transaction_history_object& obj ){\n               obj.next = account_transaction_history_id_type();\n            });\n         }\n         \/\/ else need to modify the head pointer, but it shouldn't be true\n\n         \/\/ remove the operation history entry (1.11.x) if configured and no reference left\n         if( _partial_operations )\n         {\n            \/\/ check for references\n            const auto& by_opid_idx = his_idx.indices().get<by_opid>();\n            if( by_opid_idx.find( remove_op_id ) == by_opid_idx.end() )\n            {\n               \/\/ if no reference, remove\n               db.remove( remove_op_id(db) );\n            }\n         }\n      }\n   }\n}\n\n} \/\/ end namespace detail\n\n\n\n\n\n\naccount_history_plugin::account_history_plugin() :\n   my( new detail::account_history_plugin_impl(*this) )\n{\n}\n\naccount_history_plugin::~account_history_plugin()\n{\n}\n\nstd::string account_history_plugin::plugin_name()const\n{\n   return \"account_history\";\n}\n\nvoid account_history_plugin::plugin_set_program_options(\n   boost::program_options::options_description& cli,\n   boost::program_options::options_description& cfg\n   )\n{\n   cli.add_options()\n         (\"track-account\", boost::program_options::value<std::vector<std::string>>()->composing()->multitoken(), \"Account ID to track history for (may specify multiple times)\")\n         (\"partial-operations\", boost::program_options::value<bool>(), \"Keep only those operations in memory that are related to account history tracking\")\n         (\"max-ops-per-account\", boost::program_options::value<uint64_t>(), \"Maximum number of operations per account will be kept in memory\")\n         ;\n   cfg.add(cli);\n}\n\nvoid account_history_plugin::plugin_initialize(const boost::program_options::variables_map& options)\n{\n   database().applied_block.connect( [&]( const signed_block& b){ my->update_account_histories(b); } );\n   my->_oho_index = database().add_index< primary_index< operation_history_index > >();\n   database().add_index< primary_index< account_transaction_history_index > >();\n\n   LOAD_VALUE_SET(options, \"track-account\", my->_tracked_accounts, graphene::chain::account_id_type);\n   if (options.count(\"partial-operations\")) {\n       my->_partial_operations = options[\"partial-operations\"].as<bool>();\n   }\n   if (options.count(\"max-ops-per-account\")) {\n       my->_max_ops_per_account = options[\"max-ops-per-account\"].as<uint64_t>();\n   }\n}\n\nvoid account_history_plugin::plugin_startup()\n{\n}\n\nflat_set<account_id_type> account_history_plugin::tracked_accounts() const\n{\n   return my->_tracked_accounts;\n}\n\n} }\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: unodoc.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2006-08-14 18:00: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\/\/ System - Includes -----------------------------------------------------\n\n#include <tools\/string.hxx>\n#include <sfx2\/docfac.hxx>\n#include \"swdll.hxx\"\n#include \"docsh.hxx\"\n#include \"globdoc.hxx\"\n#include \"wdocsh.hxx\"\n\n#ifndef _VOS_MUTEX_HXX_\n#include <vos\/mutex.hxx>\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\nusing namespace ::com::sun::star;\n\n\/\/============================================================\n\/\/ com.sun.star.comp.Writer.TextDocument\n\nuno::Sequence< ::rtl::OUString > SAL_CALL SwTextDocument_getSupportedServiceNames() throw()\n{\n    \/\/ return only top level services here! All others must be\n    \/\/ resolved by rtti!\n    uno::Sequence< ::rtl::OUString > aRet ( 1 );\n    ::rtl::OUString* pArray = aRet.getArray();\n    pArray[0] = ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.text.TextDocument\" ) );\n\n    return aRet;\n}\n\n::rtl::OUString SAL_CALL SwTextDocument_getImplementationName() throw()\n{\n    return ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.comp.Writer.TextDocument\" ) );\n}\n\nuno::Reference< uno::XInterface > SAL_CALL SwTextDocument_createInstance( const uno::Reference< lang::XMultiServiceFactory > &rSMgr )\n    throw( uno::Exception )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n    SwDLL::Init();\n    SfxObjectShell* pShell = new SwDocShell( SFX_CREATE_MODE_STANDARD );\n    return uno::Reference< uno::XInterface >( pShell->GetModel() );\n}\n\n\/\/============================================================\n\/\/ com.sun.star.comp.Writer.WebDocument\n\nuno::Sequence< ::rtl::OUString > SAL_CALL SwWebDocument_getSupportedServiceNames() throw()\n{\n    \/\/ return only top level services here! All others must be\n    \/\/ resolved by rtti!\n    uno::Sequence< ::rtl::OUString > aRet ( 1 );\n    ::rtl::OUString* pArray = aRet.getArray();\n    pArray[0] = ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.text.WebDocument\" ) );\n\n    return aRet;\n}\n\n::rtl::OUString SAL_CALL SwWebDocument_getImplementationName() throw()\n{\n    return ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.comp.Writer.WebDocument\" ) );\n}\n\nuno::Reference< uno::XInterface > SAL_CALL SwWebDocument_createInstance( const uno::Reference< lang::XMultiServiceFactory > &rSMgr )\n    throw( uno::Exception )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n    SwDLL::Init();\n    SfxObjectShell* pShell = new SwWebDocShell( SFX_CREATE_MODE_STANDARD );\n    return uno::Reference< uno::XInterface >( pShell->GetModel() );\n}\n\n\/\/============================================================\n\/\/ com.sun.star.comp.Writer.GlobalDocument\n\nuno::Sequence< ::rtl::OUString > SAL_CALL SwGlobalDocument_getSupportedServiceNames() throw()\n{\n    uno::Sequence< ::rtl::OUString > aRet ( 1 );\n    ::rtl::OUString* pArray = aRet.getArray();\n    pArray[0] = ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.text.GlobalDocument\" ) );\n\n    return aRet;\n}\n\n::rtl::OUString SAL_CALL SwGlobalDocument_getImplementationName() throw()\n{\n    return ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.comp.Writer.GlobalDocument\" ) );\n}\n\nuno::Reference< uno::XInterface > SAL_CALL SwGlobalDocument_createInstance( const uno::Reference< lang::XMultiServiceFactory > &rSMgr )\n    throw( uno::Exception )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n    SwDLL::Init();\n    SfxObjectShell* pShell = new SwGlobalDocShell( SFX_CREATE_MODE_STANDARD );\n    return uno::Reference< uno::XInterface >( pShell->GetModel() );\n}\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.6.2); FILE MERGED 2006\/09\/01 17:53:30 kaib 1.6.2.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: unodoc.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 23:30: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sw.hxx\"\n\/\/ System - Includes -----------------------------------------------------\n\n#include <tools\/string.hxx>\n#include <sfx2\/docfac.hxx>\n#include \"swdll.hxx\"\n#include \"docsh.hxx\"\n#include \"globdoc.hxx\"\n#include \"wdocsh.hxx\"\n\n#ifndef _VOS_MUTEX_HXX_\n#include <vos\/mutex.hxx>\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\nusing namespace ::com::sun::star;\n\n\/\/============================================================\n\/\/ com.sun.star.comp.Writer.TextDocument\n\nuno::Sequence< ::rtl::OUString > SAL_CALL SwTextDocument_getSupportedServiceNames() throw()\n{\n    \/\/ return only top level services here! All others must be\n    \/\/ resolved by rtti!\n    uno::Sequence< ::rtl::OUString > aRet ( 1 );\n    ::rtl::OUString* pArray = aRet.getArray();\n    pArray[0] = ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.text.TextDocument\" ) );\n\n    return aRet;\n}\n\n::rtl::OUString SAL_CALL SwTextDocument_getImplementationName() throw()\n{\n    return ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.comp.Writer.TextDocument\" ) );\n}\n\nuno::Reference< uno::XInterface > SAL_CALL SwTextDocument_createInstance( const uno::Reference< lang::XMultiServiceFactory > &rSMgr )\n    throw( uno::Exception )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n    SwDLL::Init();\n    SfxObjectShell* pShell = new SwDocShell( SFX_CREATE_MODE_STANDARD );\n    return uno::Reference< uno::XInterface >( pShell->GetModel() );\n}\n\n\/\/============================================================\n\/\/ com.sun.star.comp.Writer.WebDocument\n\nuno::Sequence< ::rtl::OUString > SAL_CALL SwWebDocument_getSupportedServiceNames() throw()\n{\n    \/\/ return only top level services here! All others must be\n    \/\/ resolved by rtti!\n    uno::Sequence< ::rtl::OUString > aRet ( 1 );\n    ::rtl::OUString* pArray = aRet.getArray();\n    pArray[0] = ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.text.WebDocument\" ) );\n\n    return aRet;\n}\n\n::rtl::OUString SAL_CALL SwWebDocument_getImplementationName() throw()\n{\n    return ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.comp.Writer.WebDocument\" ) );\n}\n\nuno::Reference< uno::XInterface > SAL_CALL SwWebDocument_createInstance( const uno::Reference< lang::XMultiServiceFactory > &rSMgr )\n    throw( uno::Exception )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n    SwDLL::Init();\n    SfxObjectShell* pShell = new SwWebDocShell( SFX_CREATE_MODE_STANDARD );\n    return uno::Reference< uno::XInterface >( pShell->GetModel() );\n}\n\n\/\/============================================================\n\/\/ com.sun.star.comp.Writer.GlobalDocument\n\nuno::Sequence< ::rtl::OUString > SAL_CALL SwGlobalDocument_getSupportedServiceNames() throw()\n{\n    uno::Sequence< ::rtl::OUString > aRet ( 1 );\n    ::rtl::OUString* pArray = aRet.getArray();\n    pArray[0] = ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.text.GlobalDocument\" ) );\n\n    return aRet;\n}\n\n::rtl::OUString SAL_CALL SwGlobalDocument_getImplementationName() throw()\n{\n    return ::rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.comp.Writer.GlobalDocument\" ) );\n}\n\nuno::Reference< uno::XInterface > SAL_CALL SwGlobalDocument_createInstance( const uno::Reference< lang::XMultiServiceFactory > &rSMgr )\n    throw( uno::Exception )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n    SwDLL::Init();\n    SfxObjectShell* pShell = new SwGlobalDocShell( SFX_CREATE_MODE_STANDARD );\n    return uno::Reference< uno::XInterface >( pShell->GetModel() );\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\/common_types.h\"\n\n#include <string.h>\n\n#include \"webrtc\/base\/checks.h\"\n\nnamespace webrtc {\n\nint InStream::Rewind() {\n  DCHECK(false);\n  return -1;\n}\n\nint OutStream::Rewind() {\n  DCHECK(false);\n  return -1;\n}\n\nStreamDataCounters::StreamDataCounters() : first_packet_time_ms(-1) {}\n\nRTPHeader::RTPHeader()\n    : markerBit(false),\n      payloadType(0),\n      sequenceNumber(0),\n      timestamp(0),\n      ssrc(0),\n      numCSRCs(0),\n      paddingLength(0),\n      headerLength(0),\n      payload_type_frequency(0),\n      extension() {\n  memset(&arrOfCSRCs, 0, sizeof(arrOfCSRCs));\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Remove DCHECK from common_types.cc<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\/common_types.h\"\n\n#include <string.h>\n\nnamespace webrtc {\n\nint InStream::Rewind() { return -1; }\n\nint OutStream::Rewind() { return -1; }\n\nStreamDataCounters::StreamDataCounters() : first_packet_time_ms(-1) {}\n\nRTPHeader::RTPHeader()\n    : markerBit(false),\n      payloadType(0),\n      sequenceNumber(0),\n      timestamp(0),\n      ssrc(0),\n      numCSRCs(0),\n      paddingLength(0),\n      headerLength(0),\n      payload_type_frequency(0),\n      extension() {\n  memset(&arrOfCSRCs, 0, sizeof(arrOfCSRCs));\n}\n\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n * Copyright (c) 2012-2018 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_DetailsDistributedSearchTreeImpl.hpp>\n\n#include <Teuchos_DefaultComm.hpp>\n#include <Teuchos_UnitTestHarness.hpp>\n#include <Tpetra_Distributor.hpp>\n\n#include <algorithm> \/\/ fill\n#include <set>\n#include <vector>\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    TEST_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_from = distributor.getLengthsFrom();\n    TEST_EQUALITY( procs_from.size(), lengths_from.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_from[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},\n        {6, 2},\n        {8, 5, 1},\n        {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},\n        {16, 12},\n        {18, 15, 11},\n        {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::Details::DistributedSearchTreeImpl<\n        DeviceType>::sortResults( 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    Kokkos::View<int *, DeviceType> not_sized_properly( \"\", m );\n    TEST_THROW( DataTransferKit::Details::DistributedSearchTreeImpl<\n                    DeviceType>::sortResults( ids, not_sized_properly ),\n                DataTransferKit::DataTransferKitException );\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::Details::DistributedSearchTreeImpl<\n        DeviceType>::countResults( 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\ntemplate <typename View1, typename View2>\ninline void checkViewWasNotAllocated( View1 const &v1, View2 const &v2,\n                                      bool &success,\n                                      Teuchos::FancyOStream &out )\n{\n    \/\/ NOTE: cannot use operator== here because array layout may \"change\" for\n    \/\/ rank-1 views\n    TEST_EQUALITY( v1.data(), v2.data() );\n    TEST_EQUALITY( v1.span(), v2.span() );\n\n    TEST_EQUALITY( (int)View1::rank, (int)View2::rank );\n    TEST_ASSERT( ( std::is_same<typename View1::const_value_type,\n                                typename View2::const_value_type>::value ) );\n    TEST_ASSERT( ( std::is_same<typename View1::memory_space,\n                                typename View2::memory_space>::value ) );\n\n    TEST_EQUALITY( v1.dimension_0(), v2.dimension_0() );\n    TEST_EQUALITY( v1.dimension_1(), v2.dimension_1() );\n    TEST_EQUALITY( v1.dimension_2(), v2.dimension_2() );\n    TEST_EQUALITY( v1.dimension_3(), v2.dimension_3() );\n    TEST_EQUALITY( v1.dimension_4(), v2.dimension_4() );\n    TEST_EQUALITY( v1.dimension_5(), v2.dimension_5() );\n    TEST_EQUALITY( v1.dimension_6(), v2.dimension_6() );\n    TEST_EQUALITY( v1.dimension_7(), v2.dimension_7() );\n}\n\ntemplate <typename View1, typename View2>\ninline void checkNewViewWasAllocated( View1 const &v1, View2 const &v2,\n                                      bool &success,\n                                      Teuchos::FancyOStream &out )\n{\n    TEST_INEQUALITY( v1.data(), v2.data() );\n\n    TEST_EQUALITY( (int)View1::rank, (int)View2::rank );\n    TEST_ASSERT( ( std::is_same<typename View1::const_value_type,\n                                typename View2::const_value_type>::value ) );\n\n    TEST_EQUALITY( v1.dimension_0(), v2.dimension_0() );\n    TEST_EQUALITY( v1.dimension_1(), v2.dimension_1() );\n    TEST_EQUALITY( v1.dimension_2(), v2.dimension_2() );\n    TEST_EQUALITY( v1.dimension_3(), v2.dimension_3() );\n    TEST_EQUALITY( v1.dimension_4(), v2.dimension_4() );\n    TEST_EQUALITY( v1.dimension_5(), v2.dimension_5() );\n    TEST_EQUALITY( v1.dimension_6(), v2.dimension_6() );\n    TEST_EQUALITY( v1.dimension_7(), v2.dimension_7() );\n}\n\nTEUCHOS_UNIT_TEST( DetailsDistributedSearchTreeImpl,\n                   create_layout_right_mirror_view )\n{\n    using DataTransferKit::Details::create_layout_right_mirror_view;\n    using Kokkos::ALL;\n    using Kokkos::LayoutLeft;\n    using Kokkos::LayoutRight;\n    using Kokkos::make_pair;\n    using Kokkos::subview;\n    using Kokkos::View;\n\n    \/\/ rank-1 and not strided -> do not allocate\n    View<int *, LayoutLeft> u( \"u\", 255 );\n    auto u_h = create_layout_right_mirror_view( u );\n    checkViewWasNotAllocated( u, u_h, success, out );\n\n    \/\/ right layout -> do not allocate\n    View<int **, LayoutRight> v( \"v\", 2, 3 );\n    auto v_h = create_layout_right_mirror_view( v );\n    checkViewWasNotAllocated( v, v_h, success, out );\n\n    \/\/ left layout and rank > 1 -> allocate\n    View<int **, LayoutLeft> w( \"w\", 4, 5 );\n    auto w_h = create_layout_right_mirror_view( w );\n    checkNewViewWasAllocated( w, w_h, success, out );\n\n    \/\/ strided layout -> allocate\n    auto x = subview( v, ALL, 0 );\n    auto x_h = create_layout_right_mirror_view( x );\n    checkNewViewWasAllocated( x, x_h, success, out );\n\n    \/\/ subview is rank-1 and not strided -> do not allocate\n    auto y = subview( u, make_pair( 8, 16 ) );\n    auto y_h = create_layout_right_mirror_view( y );\n    checkViewWasNotAllocated( y, y_h, success, out );\n}\n\n\/\/ Include the test macros.\n#include \"DataTransferKit_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\n\/\/ Demangle the types\nDTK_ETI_MANGLING_TYPEDEFS()\n\n\/\/ Instantiate the tests\nDTK_INSTANTIATE_N( UNIT_TEST_GROUP )\n<commit_msg>Remove test checking that it is not necessary to pass ranks with a Tpetra::Distributor<commit_after>\/****************************************************************************\n * Copyright (c) 2012-2018 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_DetailsDistributedSearchTreeImpl.hpp>\n\n#include <Teuchos_DefaultComm.hpp>\n#include <Teuchos_UnitTestHarness.hpp>\n\n#include <algorithm> \/\/ fill\n#include <set>\n#include <vector>\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},\n        {6, 2},\n        {8, 5, 1},\n        {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},\n        {16, 12},\n        {18, 15, 11},\n        {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::Details::DistributedSearchTreeImpl<\n        DeviceType>::sortResults( 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    Kokkos::View<int *, DeviceType> not_sized_properly( \"\", m );\n    TEST_THROW( DataTransferKit::Details::DistributedSearchTreeImpl<\n                    DeviceType>::sortResults( ids, not_sized_properly ),\n                DataTransferKit::DataTransferKitException );\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::Details::DistributedSearchTreeImpl<\n        DeviceType>::countResults( 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\ntemplate <typename View1, typename View2>\ninline void checkViewWasNotAllocated( View1 const &v1, View2 const &v2,\n                                      bool &success,\n                                      Teuchos::FancyOStream &out )\n{\n    \/\/ NOTE: cannot use operator== here because array layout may \"change\" for\n    \/\/ rank-1 views\n    TEST_EQUALITY( v1.data(), v2.data() );\n    TEST_EQUALITY( v1.span(), v2.span() );\n\n    TEST_EQUALITY( (int)View1::rank, (int)View2::rank );\n    TEST_ASSERT( ( std::is_same<typename View1::const_value_type,\n                                typename View2::const_value_type>::value ) );\n    TEST_ASSERT( ( std::is_same<typename View1::memory_space,\n                                typename View2::memory_space>::value ) );\n\n    TEST_EQUALITY( v1.dimension_0(), v2.dimension_0() );\n    TEST_EQUALITY( v1.dimension_1(), v2.dimension_1() );\n    TEST_EQUALITY( v1.dimension_2(), v2.dimension_2() );\n    TEST_EQUALITY( v1.dimension_3(), v2.dimension_3() );\n    TEST_EQUALITY( v1.dimension_4(), v2.dimension_4() );\n    TEST_EQUALITY( v1.dimension_5(), v2.dimension_5() );\n    TEST_EQUALITY( v1.dimension_6(), v2.dimension_6() );\n    TEST_EQUALITY( v1.dimension_7(), v2.dimension_7() );\n}\n\ntemplate <typename View1, typename View2>\ninline void checkNewViewWasAllocated( View1 const &v1, View2 const &v2,\n                                      bool &success,\n                                      Teuchos::FancyOStream &out )\n{\n    TEST_INEQUALITY( v1.data(), v2.data() );\n\n    TEST_EQUALITY( (int)View1::rank, (int)View2::rank );\n    TEST_ASSERT( ( std::is_same<typename View1::const_value_type,\n                                typename View2::const_value_type>::value ) );\n\n    TEST_EQUALITY( v1.dimension_0(), v2.dimension_0() );\n    TEST_EQUALITY( v1.dimension_1(), v2.dimension_1() );\n    TEST_EQUALITY( v1.dimension_2(), v2.dimension_2() );\n    TEST_EQUALITY( v1.dimension_3(), v2.dimension_3() );\n    TEST_EQUALITY( v1.dimension_4(), v2.dimension_4() );\n    TEST_EQUALITY( v1.dimension_5(), v2.dimension_5() );\n    TEST_EQUALITY( v1.dimension_6(), v2.dimension_6() );\n    TEST_EQUALITY( v1.dimension_7(), v2.dimension_7() );\n}\n\nTEUCHOS_UNIT_TEST( DetailsDistributedSearchTreeImpl,\n                   create_layout_right_mirror_view )\n{\n    using DataTransferKit::Details::create_layout_right_mirror_view;\n    using Kokkos::ALL;\n    using Kokkos::LayoutLeft;\n    using Kokkos::LayoutRight;\n    using Kokkos::make_pair;\n    using Kokkos::subview;\n    using Kokkos::View;\n\n    \/\/ rank-1 and not strided -> do not allocate\n    View<int *, LayoutLeft> u( \"u\", 255 );\n    auto u_h = create_layout_right_mirror_view( u );\n    checkViewWasNotAllocated( u, u_h, success, out );\n\n    \/\/ right layout -> do not allocate\n    View<int **, LayoutRight> v( \"v\", 2, 3 );\n    auto v_h = create_layout_right_mirror_view( v );\n    checkViewWasNotAllocated( v, v_h, success, out );\n\n    \/\/ left layout and rank > 1 -> allocate\n    View<int **, LayoutLeft> w( \"w\", 4, 5 );\n    auto w_h = create_layout_right_mirror_view( w );\n    checkNewViewWasAllocated( w, w_h, success, out );\n\n    \/\/ strided layout -> allocate\n    auto x = subview( v, ALL, 0 );\n    auto x_h = create_layout_right_mirror_view( x );\n    checkNewViewWasAllocated( x, x_h, success, out );\n\n    \/\/ subview is rank-1 and not strided -> do not allocate\n    auto y = subview( u, make_pair( 8, 16 ) );\n    auto y_h = create_layout_right_mirror_view( y );\n    checkViewWasNotAllocated( y, y_h, success, out );\n}\n\n\/\/ Include the test macros.\n#include \"DataTransferKit_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                                          sort_results, DeviceType##NODE )     \\\n    TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl,    \\\n                                          count_results, 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>#include <memory>\n\n#include <QHash>\n#include <QDir>\n#include <QLibrary>\n#include <QSet>\n#include <QDebug>\n\n#include \"..\/logger\/Logging.h\"\n#include \"..\/QzCoreContext.h\"\n#include \"AbstractPlugin.h\"\n#include \"IPluginAdapter.h\"\n#include \"PluginManager.h\"\n#include \"AbstractPluginBundle.h\"\n#include \"BundleEnv.h\"\n\nnamespace Quartz {\n\nstruct BundleInfo\n{\n    BundleInfo()\n        : m_bundle{ nullptr }\n        , m_library{}\n    {\n\n    }\n\n    BundleInfo( AbstractPluginBundle *bundle,\n                std::shared_ptr< QLibrary > library )\n        : m_bundle{ bundle }\n        , m_library{ library }\n    {\n\n    }\n\n    bool isValid() const\n    {\n        return ! ( m_bundle == nullptr || m_library == nullptr );\n    }\n\n    AbstractPluginBundle *m_bundle;\n\n    std::shared_ptr< QLibrary > m_library;\n};\n\nusing PluginMap = QHash< QString, std::shared_ptr< AbstractPlugin >>;\nusing AdapterMap = QHash< QString, std::shared_ptr< IPluginAdapter >>;\nusing BundleInfoMap = QHash< QString, BundleInfo >;\n\ntypedef PluginBundleWrapper ( *PluginFunc )( BundleInputWrapper * );\ntypedef void ( *BundleDestroyerFunc )();\n\nstatic const char * PLUGIN_GET_FUNC_NAME = \"getBundleWrapper\";\nstatic const char * BUNDLE_DESTROY_FUNC_NAME = \"destroy\";\n\n\nclass PluginManager::Impl\n{\npublic:\n    bool load( const QDir &dir );\n\n    bool destroy();\n\n    std::size_t loadBundles( const QDir &pluginRoot,\n                             QZ_OUT BundleInfoMap &bundleInfoOut );\n\n    BundleInfo getBundle( const QString &pluginRoot,\n                          const QString &pluginFilePath );\n    bool processBundles( const BundleInfo &bundleInfo,\n                         const BundleInfoMap &loadedBundles,\n                         QZ_OUT QSet< QString > &processedBundles );\n\n    bool initBundle( AbstractPluginBundle *bundle );\n\n    void registerPluginAdapter( std::shared_ptr< IPluginAdapter > adapter );\n\n    PluginMap m_plugins;\n\n    AdapterMap m_adapters;\n\n    BundleInfoMap m_bundles;\n\n    bool m_active;\n};\n\nbool PluginManager::Impl::load( const QDir &dir )\n{\n    bool result = true;\n    auto dirList = dir.entryInfoList( QDir::Dirs | QDir::NoDotAndDotDot,\n                                      QDir::SortFlag::NoSort );\n    BundleInfoMap loadedBundles;\n    foreach(const QFileInfo &info, dirList) {\n        if( info.isReadable() ) {\n            QDir pluginDir{ info.absoluteFilePath() };\n            auto numLoaded = loadBundles( pluginDir, loadedBundles );\n            QZ_DEBUG( \"Qz:Core:Ext\" )\n                    << \"Loaded \" << numLoaded << \" plugins from \"\n                    << info.absoluteFilePath();\n        }\n        else {\n            QZ_WARN( \"Qz:Core:Ext\" ) << \"Could not read plugin directory at \"\n                                     << info.absoluteFilePath();\n            result = false;\n        }\n    }\n    QSet< QString > processed;\n    for( auto it = loadedBundles.begin(); it != loadedBundles.end(); ++ it ) {\n        const auto &binfo = it.value();\n        if( ! processed.contains( binfo.m_bundle->bundleId() )) {\n            result = processBundles( binfo,\n                                     loadedBundles,\n                                     processed ) && result;\n        }\n    }\n    \/\/unload failed bundles\n    for( auto it = loadedBundles.begin();\n         it != loadedBundles.end();\n         ++ it ) {\n        auto &binfo = it.value();\n        if( ! m_bundles.contains( binfo.m_bundle->bundleId() )) {\n            auto lib = binfo.m_library;\n            if( lib != nullptr ) {\n                auto destroyFunc = reinterpret_cast< BundleDestroyerFunc >(\n                            lib->resolve( BUNDLE_DESTROY_FUNC_NAME ));\n                if( destroyFunc != nullptr ) {\n                    destroyFunc();\n                }\n                else {\n                    QZ_DEBUG( \"Qz:Core:Ext\" )\n                            << \"Could not find symbol for destroy function in \"\n                               \" library: \" << lib->fileName();\n                }\n                result = result && lib->unload();\n            }\n            QZ_DEBUG( \"Qz:Core:Ext\" )\n                    << \"Unloaded library for bundle with id \" <<\n                       binfo.m_bundle->bundleId()\n                    << \" which failed to initialize\";\n        }\n        else {\n            initBundle( binfo.m_bundle );\n        }\n    }\n    return result;\n}\n\nstd::size_t PluginManager::Impl::loadBundles(\n        const QDir &bundleRoot,\n        QZ_OUT BundleInfoMap &bundleInfoOut )\n{\n    QStringList extensions;\n#ifdef Q_OS_LINUX\n    extensions << \"*.so\";\n#elif defined Q_OS_WIN\n    extensions << \"*.dll\";\n#else\n    extensions << \"*.dylib\" << \"*.so\";\n#endif\n\n#ifdef QT_DEBUG\n    QDir bundleDir{ bundleRoot.absoluteFilePath( \"debug\" )};\n#else\n\/\/    QDir pluginDir{ dirInfo.absoluteFilePath() };\n        QDir pluginDir = pluginRoot;\n#endif\n    std::size_t numLoaded = 0;\n    QZ_DEBUG( \"Qz:Core:Ext\" )\n            << \"Searching for plugins at \" << bundleDir.absolutePath();\n    auto fileList = bundleDir.entryInfoList( extensions,\n                                             QDir::Files,\n                                             QDir::NoSort );\n    foreach( const auto &info, fileList ) {\n        if( info.fileName().startsWith( \"plugin_\" )\n                || info.fileName().startsWith( \"libplugin_\" )) {\n\n            auto binfo = getBundle( bundleRoot.absolutePath(),\n                                    info.absoluteFilePath() );\n            if( binfo.isValid() ) {\n                bundleInfoOut.insert( binfo.m_bundle->bundleId(), binfo );\n                ++ numLoaded;\n            }\n        }\n    }\n    return numLoaded;\n}\n\nBundleInfo PluginManager::Impl::getBundle( const QString &bundleRoot,\n                                           const QString &bundleFilePath )\n{\n    auto lib = std::make_shared< QLibrary >( bundleFilePath );\n    lib->load();\n    BundleInfo binfo{};\n    if( lib->isLoaded() ) {\n        auto func = reinterpret_cast< PluginFunc >(\n                    lib->resolve( PLUGIN_GET_FUNC_NAME ));\n        if( func != nullptr ) {\n            auto bundleEnv = std::unique_ptr< BundleEnv >{\n                new BundleEnv{ bundleRoot, lib->fileName(), \"0.1.0000\" }};\n            BundleInputWrapper input{ std::move( bundleEnv ),\n                                      QzCoreContext::get() };\n            auto bundle = func( &input ).bundle;\n            if( bundle != nullptr ) {\n                binfo = BundleInfo{ bundle, lib };\n            }\n            else {\n                QZ_WARN( \"Qz:Core:Ext\" )\n                        << \"Library at \" << bundleFilePath << \" does not \"\n                           \"contain any bundle, unloading...\";\n                lib->unload();\n            }\n        }\n        else {\n            lib->unload();\n            QZ_ERROR( \"Qz:Core:Ext\" )\n                    << \"Plugin library at \" << bundleFilePath  << \" does \"\n                    << \"not export entry point\";\n        }\n    }\n    else {\n        QZ_ERROR( \"Qz:Core:Ext\" )\n                << \"Failed to load plugin library at \" << bundleFilePath;\n    }\n    return binfo;\n}\n\nbool PluginManager::Impl::processBundles(\n        const BundleInfo &bundleInfo,\n        const BundleInfoMap &loadedBundles,\n        QZ_OUT QSet< QString > &processedBundles )\n{\n    if( processedBundles.contains( bundleInfo.m_bundle->bundleId() )) {\n        return true;\n    }\n    bool result = true;\n    const auto &hardDeps = bundleInfo.m_bundle->dependencies();\n    for( int i = 0; i < hardDeps.size(); ++ i ) {\n        const auto & depEntry = hardDeps.at( i );\n        auto depInfo = m_bundles.value( depEntry.first );\n        if( depInfo.isValid() ) {\n            result = processBundles( depInfo,\n                                     loadedBundles,\n                                     processedBundles );\n        }\n        else {\n            result = false;\n        }\n        if( ! result && depEntry.second == DependencyType::Optional ) {\n            QZ_DEBUG( \"Qz:Core:Ext\" )\n                    << \"Optional dependency \" << depEntry.first << \" for \"\n                    << bundleInfo.m_bundle->bundleId() << \" not present, \"\n                       \"hence ignored.\";\n            continue;\n        }\n        else if( ! result ) {\n            QZ_ERROR( \"Qz:Core:Ext\" )\n                    << \"Could not initialize bundle with id \"\n                    << bundleInfo.m_bundle->bundleId()\n                    << \"; could not find required dependncy with id \"\n                    << depEntry.first;\n            break;\n        }\n\n    }\n\n    if( result ) {\n        m_bundles.insert( bundleInfo.m_bundle->bundleId(), bundleInfo );\n        QZ_DEBUG( \"Qz:Core:Ext\" )\n                << \"Successfuly processed bundle with id \"\n                << bundleInfo.m_bundle->bundleId();\n    }\n    processedBundles.insert( bundleInfo.m_bundle->bundleId() );\n\n    return result;\n}\n\nbool PluginManager::Impl::initBundle( AbstractPluginBundle *bundle )\n{\n    const auto &adapters = bundle->adapters();\n    for( int i = 0; i < adapters.size(); ++ i ) {\n        const auto adapter = adapters.at( i );\n        if( ! m_adapters.contains( adapter->pluginType() )) {\n            m_adapters.insert( adapter->pluginType(), adapter );\n        }\n    }\n    auto result = true;\n    const auto plugins = bundle->plugins();\n    for( int i = 0; i < plugins.size(); ++ i ) {\n        auto plugin = plugins.at( i );\n\n            auto adapter = m_adapters.value( plugin->pluginType() );\n            if( adapter != nullptr ) {\n                result = adapter->handlePlugin( plugin.get() );\n            }\n            else {\n                QZ_ERROR( \"Qz:Core:Ext\" )\n                        << \"Could not find adapter for plugin type \"\n                        << plugin->pluginType() << \", required by plugin \"\n                        << plugin->pluginId() << \". Ignoring...\";\n                result = false;\n            }\n    }\n    return result;\n}\n\nvoid PluginManager::Impl::registerPluginAdapter(\n        std::shared_ptr< IPluginAdapter > adapter )\n{\n    if( adapter ) {\n        m_adapters[ adapter->pluginAdapterName() ] = adapter;\n    }\n}\n\nbool PluginManager::Impl::destroy()\n{\n    if( ! m_active ) {\n        return false;\n    }\n    bool result = true;\n    for( auto it = m_adapters.begin();\n         it != m_adapters.end();\n         ++ it ) {\n        auto &handler = it.value();\n        result = result && handler->finalizePlugins();\n    }\n    foreach( auto &bundle, m_bundles ) {\n        auto lib = bundle.m_library;\n        if( lib != nullptr ) {\n            auto destroyFunc = reinterpret_cast< BundleDestroyerFunc >(\n                        lib->resolve( BUNDLE_DESTROY_FUNC_NAME ));\n            if( destroyFunc != nullptr ) {\n                destroyFunc();\n            }\n            else {\n                QZ_DEBUG( \"Qz:Core:Ext\" )\n                        << \"Could not find symbol for destroy function in \"\n                           \" library: \" << lib->fileName();\n            }\n            result = result && lib->unload();\n        }\n    }\n    m_active = false;\n    return result;\n}\n\n\/\/========================== PluginManager ====================================\nPluginManager::PluginManager()\n\/\/    : m_data( std::make_unique< PluginManager::Data >() )\n    : m_impl( std::unique_ptr< Impl >( new Impl() ))\n{\n\n}\n\n\nPluginManager::~PluginManager()\n{\n    destroy();\n}\n\nAbstractPlugin * PluginManager::plugin( const QString &id ) const\n{\n    auto &plugin = m_impl->m_plugins.value( id );\n    return plugin.get();\n}\n\nIPluginAdapter * PluginManager::adapter( const QString &id ) const\n{\n    return m_impl->m_adapters.value(\n                id, std::shared_ptr< IPluginAdapter >{} ).get();\n}\n\nvoid PluginManager::registerPluginAdapter(\n        std::shared_ptr< IPluginAdapter > adapter )\n{\n    m_impl->registerPluginAdapter( adapter );\n}\n\nvoid PluginManager::registerPluginAdapter( IPluginAdapter *adapter )\n{\n    std::shared_ptr< IPluginAdapter > adptr{ adapter,\n                                             []( IPluginAdapter *){ }};\n    m_impl->registerPluginAdapter(  adptr );\n}\n\nbool PluginManager::loadFrom( const QString &location )\n{\n    bool result = false;\n    QFileInfo info{ location };\n    if( info.isDir() && info.isReadable() ) {\n        result = m_impl->load( QDir{ location });\n    }\n    else {\n        QZ_ERROR( \"Qz:Core:Ext\" )\n                << \"Invalid plugin root directory \" << location << \" given\";\n    }\n    return result;\n}\n\nbool PluginManager::destroy()\n{\n    return m_impl->destroy();\n}\n\n}\n<commit_msg>Fixed plugin adapter registration<commit_after>#include <memory>\n\n#include <QHash>\n#include <QDir>\n#include <QLibrary>\n#include <QSet>\n#include <QDebug>\n\n#include \"..\/logger\/Logging.h\"\n#include \"..\/QzCoreContext.h\"\n#include \"AbstractPlugin.h\"\n#include \"IPluginAdapter.h\"\n#include \"PluginManager.h\"\n#include \"AbstractPluginBundle.h\"\n#include \"BundleEnv.h\"\n\nnamespace Quartz {\n\nstruct BundleInfo\n{\n    BundleInfo()\n        : m_bundle{ nullptr }\n        , m_library{}\n    {\n\n    }\n\n    BundleInfo( AbstractPluginBundle *bundle,\n                std::shared_ptr< QLibrary > library )\n        : m_bundle{ bundle }\n        , m_library{ library }\n    {\n\n    }\n\n    bool isValid() const\n    {\n        return ! ( m_bundle == nullptr || m_library == nullptr );\n    }\n\n    AbstractPluginBundle *m_bundle;\n\n    std::shared_ptr< QLibrary > m_library;\n};\n\nusing PluginMap = QHash< QString, std::shared_ptr< AbstractPlugin >>;\nusing AdapterMap = QHash< QString, std::shared_ptr< IPluginAdapter >>;\nusing BundleInfoMap = QHash< QString, BundleInfo >;\n\ntypedef PluginBundleWrapper ( *PluginFunc )( BundleInputWrapper * );\ntypedef void ( *BundleDestroyerFunc )();\n\nstatic const char * PLUGIN_GET_FUNC_NAME = \"getBundleWrapper\";\nstatic const char * BUNDLE_DESTROY_FUNC_NAME = \"destroy\";\n\n\nclass PluginManager::Impl\n{\npublic:\n    bool load( const QDir &dir );\n\n    bool destroy();\n\n    std::size_t loadBundles( const QDir &pluginRoot,\n                             QZ_OUT BundleInfoMap &bundleInfoOut );\n\n    BundleInfo getBundle( const QString &pluginRoot,\n                          const QString &pluginFilePath );\n    bool processBundles( const BundleInfo &bundleInfo,\n                         const BundleInfoMap &loadedBundles,\n                         QZ_OUT QSet< QString > &processedBundles );\n\n    bool initBundle( AbstractPluginBundle *bundle );\n\n    void registerPluginAdapter( std::shared_ptr< IPluginAdapter > adapter );\n\n    PluginMap m_plugins;\n\n    AdapterMap m_adapters;\n\n    BundleInfoMap m_bundles;\n\n    bool m_active;\n};\n\nbool PluginManager::Impl::load( const QDir &dir )\n{\n    bool result = true;\n    auto dirList = dir.entryInfoList( QDir::Dirs | QDir::NoDotAndDotDot,\n                                      QDir::SortFlag::NoSort );\n    BundleInfoMap loadedBundles;\n    foreach(const QFileInfo &info, dirList) {\n        if( info.isReadable() ) {\n            QDir pluginDir{ info.absoluteFilePath() };\n            auto numLoaded = loadBundles( pluginDir, loadedBundles );\n            QZ_DEBUG( \"Qz:Core:Ext\" )\n                    << \"Loaded \" << numLoaded << \" plugins from \"\n                    << info.absoluteFilePath();\n        }\n        else {\n            QZ_WARN( \"Qz:Core:Ext\" ) << \"Could not read plugin directory at \"\n                                     << info.absoluteFilePath();\n            result = false;\n        }\n    }\n    QSet< QString > processed;\n    for( auto it = loadedBundles.begin(); it != loadedBundles.end(); ++ it ) {\n        const auto &binfo = it.value();\n        if( ! processed.contains( binfo.m_bundle->bundleId() )) {\n            result = processBundles( binfo,\n                                     loadedBundles,\n                                     processed ) && result;\n        }\n    }\n    \/\/unload failed bundles\n    for( auto it = loadedBundles.begin();\n         it != loadedBundles.end();\n         ++ it ) {\n        auto &binfo = it.value();\n        if( ! m_bundles.contains( binfo.m_bundle->bundleId() )) {\n            auto lib = binfo.m_library;\n            if( lib != nullptr ) {\n                auto destroyFunc = reinterpret_cast< BundleDestroyerFunc >(\n                            lib->resolve( BUNDLE_DESTROY_FUNC_NAME ));\n                if( destroyFunc != nullptr ) {\n                    destroyFunc();\n                }\n                else {\n                    QZ_DEBUG( \"Qz:Core:Ext\" )\n                            << \"Could not find symbol for destroy function in \"\n                               \" library: \" << lib->fileName();\n                }\n                result = result && lib->unload();\n            }\n            QZ_DEBUG( \"Qz:Core:Ext\" )\n                    << \"Unloaded library for bundle with id \" <<\n                       binfo.m_bundle->bundleId()\n                    << \" which failed to initialize\";\n        }\n        else {\n            initBundle( binfo.m_bundle );\n        }\n    }\n    return result;\n}\n\nstd::size_t PluginManager::Impl::loadBundles(\n        const QDir &bundleRoot,\n        QZ_OUT BundleInfoMap &bundleInfoOut )\n{\n    QStringList extensions;\n#ifdef Q_OS_LINUX\n    extensions << \"*.so\";\n#elif defined Q_OS_WIN\n    extensions << \"*.dll\";\n#else\n    extensions << \"*.dylib\" << \"*.so\";\n#endif\n\n#ifdef QT_DEBUG\n    QDir bundleDir{ bundleRoot.absoluteFilePath( \"debug\" )};\n#else\n\/\/    QDir pluginDir{ dirInfo.absoluteFilePath() };\n        QDir pluginDir = pluginRoot;\n#endif\n    std::size_t numLoaded = 0;\n    QZ_DEBUG( \"Qz:Core:Ext\" )\n            << \"Searching for plugins at \" << bundleDir.absolutePath();\n    auto fileList = bundleDir.entryInfoList( extensions,\n                                             QDir::Files,\n                                             QDir::NoSort );\n    foreach( const auto &info, fileList ) {\n        if( info.fileName().startsWith( \"plugin_\" )\n                || info.fileName().startsWith( \"libplugin_\" )) {\n\n            auto binfo = getBundle( bundleRoot.absolutePath(),\n                                    info.absoluteFilePath() );\n            if( binfo.isValid() ) {\n                bundleInfoOut.insert( binfo.m_bundle->bundleId(), binfo );\n                ++ numLoaded;\n            }\n        }\n    }\n    return numLoaded;\n}\n\nBundleInfo PluginManager::Impl::getBundle( const QString &bundleRoot,\n                                           const QString &bundleFilePath )\n{\n    auto lib = std::make_shared< QLibrary >( bundleFilePath );\n    lib->load();\n    BundleInfo binfo{};\n    if( lib->isLoaded() ) {\n        auto func = reinterpret_cast< PluginFunc >(\n                    lib->resolve( PLUGIN_GET_FUNC_NAME ));\n        if( func != nullptr ) {\n            auto bundleEnv = std::unique_ptr< BundleEnv >{\n                new BundleEnv{ bundleRoot, lib->fileName(), \"0.1.0000\" }};\n            BundleInputWrapper input{ std::move( bundleEnv ),\n                                      QzCoreContext::get() };\n            auto bundle = func( &input ).bundle;\n            if( bundle != nullptr ) {\n                binfo = BundleInfo{ bundle, lib };\n            }\n            else {\n                QZ_WARN( \"Qz:Core:Ext\" )\n                        << \"Library at \" << bundleFilePath << \" does not \"\n                           \"contain any bundle, unloading...\";\n                lib->unload();\n            }\n        }\n        else {\n            lib->unload();\n            QZ_ERROR( \"Qz:Core:Ext\" )\n                    << \"Plugin library at \" << bundleFilePath  << \" does \"\n                    << \"not export entry point\";\n        }\n    }\n    else {\n        QZ_ERROR( \"Qz:Core:Ext\" )\n                << \"Failed to load plugin library at \" << bundleFilePath;\n    }\n    return binfo;\n}\n\nbool PluginManager::Impl::processBundles(\n        const BundleInfo &bundleInfo,\n        const BundleInfoMap &loadedBundles,\n        QZ_OUT QSet< QString > &processedBundles )\n{\n    if( processedBundles.contains( bundleInfo.m_bundle->bundleId() )) {\n        return true;\n    }\n    bool result = true;\n    const auto &hardDeps = bundleInfo.m_bundle->dependencies();\n    for( int i = 0; i < hardDeps.size(); ++ i ) {\n        const auto & depEntry = hardDeps.at( i );\n        auto depInfo = m_bundles.value( depEntry.first );\n        if( depInfo.isValid() ) {\n            result = processBundles( depInfo,\n                                     loadedBundles,\n                                     processedBundles );\n        }\n        else {\n            result = false;\n        }\n        if( ! result && depEntry.second == DependencyType::Optional ) {\n            QZ_DEBUG( \"Qz:Core:Ext\" )\n                    << \"Optional dependency \" << depEntry.first << \" for \"\n                    << bundleInfo.m_bundle->bundleId() << \" not present, \"\n                       \"hence ignored.\";\n            continue;\n        }\n        else if( ! result ) {\n            QZ_ERROR( \"Qz:Core:Ext\" )\n                    << \"Could not initialize bundle with id \"\n                    << bundleInfo.m_bundle->bundleId()\n                    << \"; could not find required dependncy with id \"\n                    << depEntry.first;\n            break;\n        }\n\n    }\n\n    if( result ) {\n        m_bundles.insert( bundleInfo.m_bundle->bundleId(), bundleInfo );\n        QZ_DEBUG( \"Qz:Core:Ext\" )\n                << \"Successfuly processed bundle with id \"\n                << bundleInfo.m_bundle->bundleId();\n    }\n    processedBundles.insert( bundleInfo.m_bundle->bundleId() );\n\n    return result;\n}\n\nbool PluginManager::Impl::initBundle( AbstractPluginBundle *bundle )\n{\n    const auto &adapters = bundle->adapters();\n    for( int i = 0; i < adapters.size(); ++ i ) {\n        const auto adapter = adapters.at( i );\n        if( ! m_adapters.contains( adapter->pluginType() )) {\n            m_adapters.insert( adapter->pluginType(), adapter );\n        }\n    }\n    auto result = true;\n    const auto plugins = bundle->plugins();\n    for( int i = 0; i < plugins.size(); ++ i ) {\n        auto plugin = plugins.at( i );\n\n            auto adapter = m_adapters.value( plugin->pluginType() );\n            if( adapter != nullptr ) {\n                result = adapter->handlePlugin( plugin.get() );\n            }\n            else {\n                QZ_ERROR( \"Qz:Core:Ext\" )\n                        << \"Could not find adapter for plugin type \"\n                        << plugin->pluginType() << \", required by plugin \"\n                        << plugin->pluginId() << \". Ignoring...\";\n                result = false;\n            }\n    }\n    return result;\n}\n\nvoid PluginManager::Impl::registerPluginAdapter(\n        std::shared_ptr< IPluginAdapter > adapter )\n{\n    if( adapter ) {\n        m_adapters[ adapter->pluginType() ] = adapter;\n    }\n}\n\nbool PluginManager::Impl::destroy()\n{\n    if( ! m_active ) {\n        return false;\n    }\n    bool result = true;\n    for( auto it = m_adapters.begin();\n         it != m_adapters.end();\n         ++ it ) {\n        auto &handler = it.value();\n        result = result && handler->finalizePlugins();\n    }\n    foreach( auto &bundle, m_bundles ) {\n        auto lib = bundle.m_library;\n        if( lib != nullptr ) {\n            auto destroyFunc = reinterpret_cast< BundleDestroyerFunc >(\n                        lib->resolve( BUNDLE_DESTROY_FUNC_NAME ));\n            if( destroyFunc != nullptr ) {\n                destroyFunc();\n            }\n            else {\n                QZ_DEBUG( \"Qz:Core:Ext\" )\n                        << \"Could not find symbol for destroy function in \"\n                           \" library: \" << lib->fileName();\n            }\n            result = result && lib->unload();\n        }\n    }\n    m_active = false;\n    return result;\n}\n\n\/\/========================== PluginManager ====================================\nPluginManager::PluginManager()\n\/\/    : m_data( std::make_unique< PluginManager::Data >() )\n    : m_impl( std::unique_ptr< Impl >( new Impl() ))\n{\n\n}\n\n\nPluginManager::~PluginManager()\n{\n    destroy();\n}\n\nAbstractPlugin * PluginManager::plugin( const QString &id ) const\n{\n    auto &plugin = m_impl->m_plugins.value( id );\n    return plugin.get();\n}\n\nIPluginAdapter * PluginManager::adapter( const QString &id ) const\n{\n    return m_impl->m_adapters.value(\n                id, std::shared_ptr< IPluginAdapter >{} ).get();\n}\n\nvoid PluginManager::registerPluginAdapter(\n        std::shared_ptr< IPluginAdapter > adapter )\n{\n    m_impl->registerPluginAdapter( adapter );\n}\n\nvoid PluginManager::registerPluginAdapter( IPluginAdapter *adapter )\n{\n    std::shared_ptr< IPluginAdapter > adptr{ adapter,\n                                             []( IPluginAdapter *){ }};\n    m_impl->registerPluginAdapter(  adptr );\n}\n\nbool PluginManager::loadFrom( const QString &location )\n{\n    bool result = false;\n    QFileInfo info{ location };\n    if( info.isDir() && info.isReadable() ) {\n        result = m_impl->load( QDir{ location });\n    }\n    else {\n        QZ_ERROR( \"Qz:Core:Ext\" )\n                << \"Invalid plugin root directory \" << location << \" given\";\n    }\n    return result;\n}\n\nbool PluginManager::destroy()\n{\n    return m_impl->destroy();\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2015, Nagoya 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, 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 Autoware 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\n#include <cstddef>\n#include <cstring>\n\n#include <sys\/socket.h>\n\n#include <udon_socket\/udon.hpp>\n\nnamespace udon_socket {\n\nnamespace udon {\n\nnamespace {\n\nconstexpr std::int32_t TYPE_BEACON\t= 0;\nconstexpr std::int32_t TYPE_MODE\t= 3;\nconstexpr std::int32_t TYPE_LOCATION\t= 6;\n\nconstexpr std::size_t SIZE_REQUEST\t= 0x08;\nconstexpr std::size_t SIZE_RESPONSE\t= 0x04;\nconstexpr std::size_t SIZE_MODE\t\t= 0x08;\nconstexpr std::size_t SIZE_LOCATION\t= 0x28;\n\nconstexpr std::ptrdiff_t OFFSET_TYPE\t\t= 0x00;\nconstexpr std::ptrdiff_t OFFSET_VALUE\t\t= 0x04;\nconstexpr std::ptrdiff_t OFFSET_LENGTH\t\t= 0x04;\nconstexpr std::ptrdiff_t OFFSET_LOCATION_X\t= 0x08;\nconstexpr std::ptrdiff_t OFFSET_LOCATION_Y\t= 0x10;\nconstexpr std::ptrdiff_t OFFSET_LOCATION_Z\t= 0x18;\nconstexpr std::ptrdiff_t OFFSET_LOCATION_D\t= 0x20;\n\nvoid set_type(std::uint8_t *buf, std::int32_t type)\n{\n\tstd::memcpy(buf + OFFSET_TYPE, &type, sizeof(type));\n}\n\nvoid set_value(std::uint8_t *buf, std::int32_t value)\n{\n\tstd::memcpy(buf + OFFSET_VALUE, &value, sizeof(value));\n}\n\nvoid set_length(std::uint8_t *buf, std::int32_t length)\n{\n\tstd::memcpy(buf + OFFSET_LENGTH, &length, sizeof(length));\n}\n\nvoid set_location_x(std::uint8_t *buf, double x)\n{\n\tstd::memcpy(buf + OFFSET_LOCATION_X, &x, sizeof(x));\n}\n\nvoid set_location_y(std::uint8_t *buf, double y)\n{\n\tstd::memcpy(buf + OFFSET_LOCATION_Y, &y, sizeof(y));\n}\n\nvoid set_location_z(std::uint8_t *buf, double z)\n{\n\tstd::memcpy(buf + OFFSET_LOCATION_Z, &z, sizeof(z));\n}\n\nvoid set_location_d(std::uint8_t *buf, double d)\n{\n\tstd::memcpy(buf + OFFSET_LOCATION_D, &d, sizeof(d));\n}\n\n} \/\/ namespace\n\nbool Location::operator !=(const Location& location) const\n{\n\treturn !(x == location.x && y == location.y && z == location.z && d == location.d);\n}\n\nssize_t send_request(int fd)\n{\n\tstd::uint8_t buf[SIZE_REQUEST];\n\tset_type(buf, TYPE_BEACON);\n\tset_value(buf, 0);\n\n\treturn send(fd, &buf, sizeof(buf), 0);\n}\n\nssize_t send_response(int fd)\n{\n\tstd::uint8_t buf[SIZE_RESPONSE];\n\tset_type(buf, TYPE_BEACON);\n\n\treturn send(fd, &buf, sizeof(buf), 0);\n}\n\nssize_t send_mode(int fd, std::int32_t mode)\n{\n\tstd::uint8_t buf[SIZE_MODE];\n\tset_type(buf, TYPE_MODE);\n\tset_value(buf, mode);\n\n\treturn send(fd, &buf, sizeof(buf), 0);\n}\n\nssize_t send_location(int fd, const Location& location)\n{\n\tstd::uint8_t buf[SIZE_LOCATION];\n\tset_type(buf, TYPE_LOCATION);\n\tset_length(buf, sizeof(double) * 4);\n\tset_location_x(buf, location.x);\n\tset_location_y(buf, location.y);\n\tset_location_z(buf, location.z);\n\tset_location_d(buf, location.d);\n\n\treturn send(fd, &buf, sizeof(buf), 0);\n}\n\n} \/\/ namespace udon\n\n} \/\/ namespace udon_socket\n<commit_msg>Handle both STR and DRV mode as automatic cruise mode in udon_socket<commit_after>\/*\n *  Copyright (c) 2015, Nagoya 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, 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 Autoware 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\n#include <cstddef>\n#include <cstring>\n\n#include <sys\/socket.h>\n\n#include <udon_socket\/udon.hpp>\n\nnamespace udon_socket {\n\nnamespace udon {\n\nnamespace {\n\nconstexpr std::int32_t TYPE_BEACON\t= 0;\nconstexpr std::int32_t TYPE_MODE\t= 3;\nconstexpr std::int32_t TYPE_LOCATION\t= 6;\n\nconstexpr std::size_t SIZE_REQUEST\t= 0x08;\nconstexpr std::size_t SIZE_RESPONSE\t= 0x04;\nconstexpr std::size_t SIZE_MODE\t\t= 0x08;\nconstexpr std::size_t SIZE_LOCATION\t= 0x28;\n\nconstexpr std::ptrdiff_t OFFSET_TYPE\t\t= 0x00;\nconstexpr std::ptrdiff_t OFFSET_VALUE\t\t= 0x04;\nconstexpr std::ptrdiff_t OFFSET_LENGTH\t\t= 0x04;\nconstexpr std::ptrdiff_t OFFSET_LOCATION_X\t= 0x08;\nconstexpr std::ptrdiff_t OFFSET_LOCATION_Y\t= 0x10;\nconstexpr std::ptrdiff_t OFFSET_LOCATION_Z\t= 0x18;\nconstexpr std::ptrdiff_t OFFSET_LOCATION_D\t= 0x20;\n\nvoid set_type(std::uint8_t *buf, std::int32_t type)\n{\n\tstd::memcpy(buf + OFFSET_TYPE, &type, sizeof(type));\n}\n\nvoid set_value(std::uint8_t *buf, std::int32_t value)\n{\n\tstd::memcpy(buf + OFFSET_VALUE, &value, sizeof(value));\n}\n\nvoid set_length(std::uint8_t *buf, std::int32_t length)\n{\n\tstd::memcpy(buf + OFFSET_LENGTH, &length, sizeof(length));\n}\n\nvoid set_location_x(std::uint8_t *buf, double x)\n{\n\tstd::memcpy(buf + OFFSET_LOCATION_X, &x, sizeof(x));\n}\n\nvoid set_location_y(std::uint8_t *buf, double y)\n{\n\tstd::memcpy(buf + OFFSET_LOCATION_Y, &y, sizeof(y));\n}\n\nvoid set_location_z(std::uint8_t *buf, double z)\n{\n\tstd::memcpy(buf + OFFSET_LOCATION_Z, &z, sizeof(z));\n}\n\nvoid set_location_d(std::uint8_t *buf, double d)\n{\n\tstd::memcpy(buf + OFFSET_LOCATION_D, &d, sizeof(d));\n}\n\n} \/\/ namespace\n\nbool Location::operator !=(const Location& location) const\n{\n\treturn !(x == location.x && y == location.y && z == location.z && d == location.d);\n}\n\nssize_t send_request(int fd)\n{\n\tstd::uint8_t buf[SIZE_REQUEST];\n\tset_type(buf, TYPE_BEACON);\n\tset_value(buf, 0);\n\n\treturn send(fd, &buf, sizeof(buf), 0);\n}\n\nssize_t send_response(int fd)\n{\n\tstd::uint8_t buf[SIZE_RESPONSE];\n\tset_type(buf, TYPE_BEACON);\n\n\treturn send(fd, &buf, sizeof(buf), 0);\n}\n\nssize_t send_mode(int fd, std::int32_t mode)\n{\n\tstd::uint8_t buf[SIZE_MODE];\n\tset_type(buf, TYPE_MODE);\n\tset_value(buf, (mode > 0) ? 1:0);\n\n\treturn send(fd, &buf, sizeof(buf), 0);\n}\n\nssize_t send_location(int fd, const Location& location)\n{\n\tstd::uint8_t buf[SIZE_LOCATION];\n\tset_type(buf, TYPE_LOCATION);\n\tset_length(buf, sizeof(double) * 4);\n\tset_location_x(buf, location.x);\n\tset_location_y(buf, location.y);\n\tset_location_z(buf, location.z);\n\tset_location_d(buf, location.d);\n\n\treturn send(fd, &buf, sizeof(buf), 0);\n}\n\n} \/\/ namespace udon\n\n} \/\/ namespace udon_socket\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 \"bucketdb.h\"\n#include <cassert>\n#include <algorithm>\n\nusing document::GlobalId;\nusing storage::spi::BucketChecksum;\n\nnamespace proton {\n\nBucketDB::BucketDB()\n    : _map(),\n      _cachedBucketId(),\n      _cachedBucketState()\n{\n}\n\nBucketDB::~BucketDB()\n{\n    checkEmpty();\n    clear();\n}\n\nvoid\nBucketDB::add(const BucketId &bucketId, const BucketState & state) {\n    _map[bucketId] += state;\n}\n\nbucketdb::BucketState *\nBucketDB::getBucketStatePtr(const BucketId &bucket)\n{\n    auto it(_map.find(bucket));\n    if (it != _map.end()) {\n        return &it->second;\n    }\n    return nullptr;\n}\n\nvoid\nBucketDB::unloadBucket(const BucketId &bucket, const BucketState &delta)\n{\n    BucketState *state = getBucketStatePtr(bucket);\n    assert(state);\n    *state -= delta;\n}\n\nconst bucketdb::BucketState &\nBucketDB::add(const GlobalId &gid,\n              const BucketId &bucketId, const Timestamp &timestamp, uint32_t docSize,\n              SubDbType subDbType)\n{\n    BucketState &state = _map[bucketId];\n    state.add(gid, timestamp, docSize, subDbType);\n    return state;\n}\n\nvoid\nBucketDB::remove(const GlobalId &gid,\n                 const BucketId &bucketId, const Timestamp &timestamp, uint32_t docSize,\n                 SubDbType subDbType)\n{\n    BucketState &state = _map[bucketId];\n    state.remove(gid, timestamp, docSize, subDbType);\n}\n\nvoid\nBucketDB::modify(const GlobalId &gid,\n                 const BucketId &oldBucketId, const Timestamp &oldTimestamp, uint32_t oldDocSize,\n                 const BucketId &newBucketId, const Timestamp &newTimestamp, uint32_t newDocSize,\n                 SubDbType subDbType)\n{\n    if (oldBucketId == newBucketId) {\n        BucketState &state = _map[oldBucketId];\n        state.modify(gid, oldTimestamp, oldDocSize, newTimestamp, newDocSize, subDbType);\n    } else {\n        remove(gid, oldBucketId, oldTimestamp, oldDocSize, subDbType);\n        add(gid, newBucketId, newTimestamp, newDocSize, subDbType);\n    }\n}\n\n\nbucketdb::BucketState\nBucketDB::get(const BucketId &bucketId) const\n{\n    auto itr = _map.find(bucketId);\n    if (itr != _map.end()) {\n        return itr->second;\n    }\n    return BucketState();\n}\n\nvoid\nBucketDB::cacheBucket(const BucketId &bucketId)\n{\n    _cachedBucketId = bucketId;\n    _cachedBucketState = get(bucketId);\n}\n\nvoid\nBucketDB::uncacheBucket()\n{\n    _cachedBucketId = BucketId();\n    _cachedBucketState = BucketState();\n}\n\nbool\nBucketDB::isCachedBucket(const BucketId &bucketId) const\n{\n    return _cachedBucketId == bucketId;\n}\n\nbucketdb::BucketState\nBucketDB::cachedGet(const BucketId &bucketId) const\n{\n    if (isCachedBucket(bucketId)) {\n        return _cachedBucketState;\n    }\n    return get(bucketId);\n}\n\nbool\nBucketDB::hasBucket(const BucketId &bucketId) const\n{\n    return (_map.find(bucketId) != _map.end());\n}\n\n\nbool\nBucketDB::isActiveBucket(const BucketId &bucketId) const\n{\n    Map::const_iterator itr = _map.find(bucketId);\n    if (itr != _map.end()) {\n        return itr->second.isActive();\n    }\n    return false;\n}\n\nvoid\nBucketDB::getBuckets(BucketId::List &buckets) const\n{\n    buckets.reserve(_map.size());\n    for (const auto & entry : _map) {\n        buckets.push_back(entry.first);\n    }\n}\n\nbool\nBucketDB::empty() const\n{\n    return _map.empty();\n}\n\nvoid\nBucketDB::clear()\n{\n    _map.clear();\n}\n\nvoid\nBucketDB::checkEmpty() const\n{\n    for (auto &entry : _map) {\n        const BucketState &state = entry.second;\n        assert(state.empty());\n        (void) state;\n    }\n}\n\n\nvoid\nBucketDB::setBucketState(const BucketId &bucketId, bool active)\n{\n    BucketState &state = _map[bucketId];\n    state.setActive(active);\n}\n\n\nvoid\nBucketDB::createBucket(const BucketId &bucketId)\n{\n    BucketState &state = _map[bucketId];\n    (void) state;\n}\n\n\nvoid\nBucketDB::deleteEmptyBucket(const BucketId &bucketId)\n{\n    Map::iterator itr = _map.find(bucketId);\n    if (itr == _map.end()) {\n        return;\n    }\n    const BucketState &state = itr->second;\n    if (state.empty()) {\n        _map.erase(itr);\n    }\n}\n\nvoid\nBucketDB::getActiveBuckets(BucketId::List &buckets) const\n{\n    for (const auto & entry : _map) {\n        if (entry.second.isActive()) {\n            buckets.push_back(entry.first);\n        }\n    }\n}\n\nvoid\nBucketDB::populateActiveBuckets(const BucketId::List &buckets,\n                                BucketId::List &fixupBuckets)\n{\n    typedef BucketId::List BIV;\n    BIV sorted(buckets);\n    BIV toAdd;\n    std::sort(sorted.begin(), sorted.end());\n    BIV::const_iterator si(sorted.begin());\n    BIV::const_iterator se(sorted.end());\n    for (const auto & entry : _map) {\n        for (; si != se && !(entry.first < *si); ++si) {\n            if (*si < entry.first) {\n                toAdd.push_back(*si);\n            } else if (!entry.second.isActive()) {\n                fixupBuckets.push_back(*si);\n                setBucketState(*si, true);\n            }\n        }\n    }\n    for (; si != se; ++si) {\n        toAdd.push_back(*si);\n    }\n    BucketState activeState;\n    activeState.setActive(true);\n    for (const BucketId & bucketId : toAdd) {\n        InsertResult ins(_map.insert(std::make_pair(bucketId, activeState)));\n        assert(ins.second);\n    }\n}\n\n}\n<commit_msg>Simplify with emplace and auto<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 \"bucketdb.h\"\n#include <cassert>\n#include <algorithm>\n\nusing document::GlobalId;\nusing storage::spi::BucketChecksum;\n\nnamespace proton {\n\nBucketDB::BucketDB()\n    : _map(),\n      _cachedBucketId(),\n      _cachedBucketState()\n{\n}\n\nBucketDB::~BucketDB()\n{\n    checkEmpty();\n    clear();\n}\n\nvoid\nBucketDB::add(const BucketId &bucketId, const BucketState & state) {\n    _map[bucketId] += state;\n}\n\nbucketdb::BucketState *\nBucketDB::getBucketStatePtr(const BucketId &bucket)\n{\n    auto it(_map.find(bucket));\n    if (it != _map.end()) {\n        return &it->second;\n    }\n    return nullptr;\n}\n\nvoid\nBucketDB::unloadBucket(const BucketId &bucket, const BucketState &delta)\n{\n    BucketState *state = getBucketStatePtr(bucket);\n    assert(state);\n    *state -= delta;\n}\n\nconst bucketdb::BucketState &\nBucketDB::add(const GlobalId &gid,\n              const BucketId &bucketId, const Timestamp &timestamp, uint32_t docSize,\n              SubDbType subDbType)\n{\n    BucketState &state = _map[bucketId];\n    state.add(gid, timestamp, docSize, subDbType);\n    return state;\n}\n\nvoid\nBucketDB::remove(const GlobalId &gid,\n                 const BucketId &bucketId, const Timestamp &timestamp, uint32_t docSize,\n                 SubDbType subDbType)\n{\n    BucketState &state = _map[bucketId];\n    state.remove(gid, timestamp, docSize, subDbType);\n}\n\nvoid\nBucketDB::modify(const GlobalId &gid,\n                 const BucketId &oldBucketId, const Timestamp &oldTimestamp, uint32_t oldDocSize,\n                 const BucketId &newBucketId, const Timestamp &newTimestamp, uint32_t newDocSize,\n                 SubDbType subDbType)\n{\n    if (oldBucketId == newBucketId) {\n        BucketState &state = _map[oldBucketId];\n        state.modify(gid, oldTimestamp, oldDocSize, newTimestamp, newDocSize, subDbType);\n    } else {\n        remove(gid, oldBucketId, oldTimestamp, oldDocSize, subDbType);\n        add(gid, newBucketId, newTimestamp, newDocSize, subDbType);\n    }\n}\n\n\nbucketdb::BucketState\nBucketDB::get(const BucketId &bucketId) const\n{\n    auto itr = _map.find(bucketId);\n    if (itr != _map.end()) {\n        return itr->second;\n    }\n    return BucketState();\n}\n\nvoid\nBucketDB::cacheBucket(const BucketId &bucketId)\n{\n    _cachedBucketId = bucketId;\n    _cachedBucketState = get(bucketId);\n}\n\nvoid\nBucketDB::uncacheBucket()\n{\n    _cachedBucketId = BucketId();\n    _cachedBucketState = BucketState();\n}\n\nbool\nBucketDB::isCachedBucket(const BucketId &bucketId) const\n{\n    return _cachedBucketId == bucketId;\n}\n\nbucketdb::BucketState\nBucketDB::cachedGet(const BucketId &bucketId) const\n{\n    if (isCachedBucket(bucketId)) {\n        return _cachedBucketState;\n    }\n    return get(bucketId);\n}\n\nbool\nBucketDB::hasBucket(const BucketId &bucketId) const\n{\n    return (_map.find(bucketId) != _map.end());\n}\n\n\nbool\nBucketDB::isActiveBucket(const BucketId &bucketId) const\n{\n    auto itr = _map.find(bucketId);\n    return (itr != _map.end()) && itr->second.isActive();\n}\n\nvoid\nBucketDB::getBuckets(BucketId::List &buckets) const\n{\n    buckets.reserve(_map.size());\n    for (const auto & entry : _map) {\n        buckets.push_back(entry.first);\n    }\n}\n\nbool\nBucketDB::empty() const\n{\n    return _map.empty();\n}\n\nvoid\nBucketDB::clear()\n{\n    _map.clear();\n}\n\nvoid\nBucketDB::checkEmpty() const\n{\n    for (auto &entry : _map) {\n        const BucketState &state = entry.second;\n        assert(state.empty());\n        (void) state;\n    }\n}\n\n\nvoid\nBucketDB::setBucketState(const BucketId &bucketId, bool active)\n{\n    BucketState &state = _map[bucketId];\n    state.setActive(active);\n}\n\n\nvoid\nBucketDB::createBucket(const BucketId &bucketId)\n{\n    BucketState &state = _map[bucketId];\n    (void) state;\n}\n\n\nvoid\nBucketDB::deleteEmptyBucket(const BucketId &bucketId)\n{\n    auto itr = _map.find(bucketId);\n    if (itr == _map.end()) {\n        return;\n    }\n    const BucketState &state = itr->second;\n    if (state.empty()) {\n        _map.erase(itr);\n    }\n}\n\nvoid\nBucketDB::getActiveBuckets(BucketId::List &buckets) const\n{\n    for (const auto & entry : _map) {\n        if (entry.second.isActive()) {\n            buckets.push_back(entry.first);\n        }\n    }\n}\n\nvoid\nBucketDB::populateActiveBuckets(const BucketId::List &buckets, BucketId::List &fixupBuckets)\n{\n    typedef BucketId::List BIV;\n    BIV sorted(buckets);\n    BIV toAdd;\n    std::sort(sorted.begin(), sorted.end());\n    BIV::const_iterator si(sorted.begin());\n    BIV::const_iterator se(sorted.end());\n    for (const auto & entry : _map) {\n        for (; si != se && !(entry.first < *si); ++si) {\n            if (*si < entry.first) {\n                toAdd.push_back(*si);\n            } else if (!entry.second.isActive()) {\n                fixupBuckets.push_back(*si);\n                setBucketState(*si, true);\n            }\n        }\n    }\n    for (; si != se; ++si) {\n        toAdd.push_back(*si);\n    }\n    BucketState activeState;\n    activeState.setActive(true);\n    for (const BucketId & bucketId : toAdd) {\n        InsertResult ins(_map.emplace(bucketId, activeState));\n        assert(ins.second);\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2017 The nanoFramework project contributors\n\/\/ Portions Copyright (c) Microsoft Corporation.  All rights reserved.\n\/\/ See LICENSE file in the project root for full license information.\n\/\/\n#include \"CorLib.h\"\n\n\nHRESULT Library_corlib_native_System_Reflection_FieldInfo::SetValue___VOID__OBJECT__OBJECT( CLR_RT_StackFrame& stack )\n{\n    NATIVE_PROFILE_CLR_CORE();\n    NANOCLR_HEADER();\n\n    CLR_RT_FieldDef_Instance   instFD;\n    CLR_RT_TypeDef_Instance    instTD;\n    CLR_RT_TypeDescriptor      instTDescObj;\n    CLR_RT_TypeDef_Instance    instTDField;\n    const CLR_RECORD_FIELDDEF* fd;\n    CLR_RT_HeapBlock*          obj;\n    bool                       fValueType;\n    CLR_RT_HeapBlock&          srcVal = stack.Arg2();        \n    CLR_RT_HeapBlock           val; val.Assign( srcVal );    \n    CLR_RT_ProtectFromGC       gc( val );\n\n\n    NANOCLR_CHECK_HRESULT(Library_corlib_native_System_Reflection_FieldInfo::Initialize( stack, instFD, instTD, obj ));\n\n    fd = instFD.m_target;\n    \n    if(fd->flags & CLR_RECORD_FIELDDEF::FD_NoReflection) \/\/ don't allow reflection for fields with NoReflection attribute\n    {\n        NANOCLR_SET_AND_LEAVE(CLR_E_NOT_SUPPORTED);\n    }\n\n    NANOCLR_CHECK_HRESULT(instTDescObj.InitializeFromFieldDefinition(instFD));\n\n    \/\/ make sure the right side object is of the same type as the left side        \n    if(NULL != val.Dereference() && !CLR_RT_ExecutionEngine::IsInstanceOf(val, instTDescObj.m_handlerCls)) NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n\n    fValueType = obj->IsAValueType();\n    if(fValueType || (c_CLR_RT_DataTypeLookup[ obj->DataType() ].m_flags & CLR_RT_DataTypeLookup::c_OptimizedValueType))\n    {\n        if(val.Dereference() == NULL || !val.Dereference()->IsBoxed()) NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n    \n        if(fValueType)\n        {\n            _ASSERTE(NULL != obj->Dereference());\n            if(NULL == obj->Dereference()) NANOCLR_SET_AND_LEAVE(CLR_E_INVALID_PARAMETER);\n            instTDField.InitializeFromIndex( obj->Dereference()->ObjectCls() );\n        }\n        else\n        {\n            instTDField.InitializeFromIndex( *c_CLR_RT_DataTypeLookup[ obj->DataType() ].m_cls );\n        }\n                    \n        NANOCLR_CHECK_HRESULT(val.PerformUnboxing( instTDField ));\n    }\n    else\n    {\n#if defined(NANOCLR_APPDOMAINS)\n        CLR_RT_HeapBlock&          srcObj = stack.Arg1();        \n\n        if(srcObj.IsTransparentProxy())\n        {\n            _ASSERTE(srcObj.DataType() == DATATYPE_OBJECT);\n            _ASSERTE(srcObj.Dereference() != NULL && srcObj.Dereference()->DataType() == DATATYPE_TRANSPARENT_PROXY);\n\n            NANOCLR_CHECK_HRESULT(srcObj.Dereference()->TransparentProxyValidate());\n            NANOCLR_CHECK_HRESULT(srcObj.Dereference()->TransparentProxyAppDomain()->MarshalObject( val, val ));\n        }\n#endif\n    }\n\n    switch(obj->DataType())\n    {\n        case DATATYPE_DATETIME: \/\/ Special case.\n        case DATATYPE_TIMESPAN: \/\/ Special case.\n            obj->NumericByRef().s8 = val.NumericByRefConst().s8;\n            break;\n\n        default:\n            obj->Assign( val );\n            break;\n    }\n\n    NANOCLR_NOCLEANUP();\n}\n\n\/\/--\/\/\n\nHRESULT Library_corlib_native_System_Reflection_FieldInfo::Initialize( CLR_RT_StackFrame& stack, CLR_RT_FieldDef_Instance& instFD, CLR_RT_TypeDef_Instance& instTD, CLR_RT_HeapBlock*& obj )\n{\n    NATIVE_PROFILE_CLR_CORE();\n    NANOCLR_HEADER();\n    CLR_RT_HeapBlock* hbField = stack.Arg0().Dereference();\n\n    if(CLR_RT_ReflectionDef_Index::Convert( *hbField, instFD ) == false ||\n       instTD.InitializeFromField         (           instFD ) == false  )\n    {\n        NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n    }\n\n    if(instFD.m_target->flags & CLR_RECORD_FIELDDEF::FD_Static)\n    {\n        obj = CLR_RT_ExecutionEngine::AccessStaticField( instFD );\n                \n        if(obj == NULL) NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n    }\n    else\n    {\n        NANOCLR_CHECK_HRESULT(stack.Arg1().EnsureObjectReference( obj ));\n\n        if(CLR_RT_ExecutionEngine::IsInstanceOf( *obj, instTD ) == false)\n        {\n            NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n        }\n                \n        obj = &obj[ instFD.CrossReference().m_offset ];\n    }\n\n    NANOCLR_NOCLEANUP();\n}\n\nHRESULT Library_corlib_native_System_Reflection_FieldInfo::GetCustomAttributes___SZARRAY_OBJECT__BOOLEAN( CLR_RT_StackFrame& stack )\n{\n    NANOCLR_HEADER();\n\n    NANOCLR_SET_AND_LEAVE(stack.NotImplementedStub());\n\n    NANOCLR_NOCLEANUP();\n}\n<commit_msg>Add implementation of GetCustomAttributes for fields (#1394)<commit_after>\/\/\n\/\/ Copyright (c) 2017 The nanoFramework project contributors\n\/\/ Portions Copyright (c) Microsoft Corporation.  All rights reserved.\n\/\/ See LICENSE file in the project root for full license information.\n\/\/\n#include \"CorLib.h\"\n\n\nHRESULT Library_corlib_native_System_Reflection_FieldInfo::SetValue___VOID__OBJECT__OBJECT( CLR_RT_StackFrame& stack )\n{\n    NATIVE_PROFILE_CLR_CORE();\n    NANOCLR_HEADER();\n\n    CLR_RT_FieldDef_Instance   instFD;\n    CLR_RT_TypeDef_Instance    instTD;\n    CLR_RT_TypeDescriptor      instTDescObj;\n    CLR_RT_TypeDef_Instance    instTDField;\n    const CLR_RECORD_FIELDDEF* fd;\n    CLR_RT_HeapBlock*          obj;\n    bool                       fValueType;\n    CLR_RT_HeapBlock&          srcVal = stack.Arg2();        \n    CLR_RT_HeapBlock           val; val.Assign( srcVal );    \n    CLR_RT_ProtectFromGC       gc( val );\n\n\n    NANOCLR_CHECK_HRESULT(Library_corlib_native_System_Reflection_FieldInfo::Initialize( stack, instFD, instTD, obj ));\n\n    fd = instFD.m_target;\n    \n    if(fd->flags & CLR_RECORD_FIELDDEF::FD_NoReflection) \/\/ don't allow reflection for fields with NoReflection attribute\n    {\n        NANOCLR_SET_AND_LEAVE(CLR_E_NOT_SUPPORTED);\n    }\n\n    NANOCLR_CHECK_HRESULT(instTDescObj.InitializeFromFieldDefinition(instFD));\n\n    \/\/ make sure the right side object is of the same type as the left side        \n    if(NULL != val.Dereference() && !CLR_RT_ExecutionEngine::IsInstanceOf(val, instTDescObj.m_handlerCls)) NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n\n    fValueType = obj->IsAValueType();\n    if(fValueType || (c_CLR_RT_DataTypeLookup[ obj->DataType() ].m_flags & CLR_RT_DataTypeLookup::c_OptimizedValueType))\n    {\n        if(val.Dereference() == NULL || !val.Dereference()->IsBoxed()) NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n    \n        if(fValueType)\n        {\n            _ASSERTE(NULL != obj->Dereference());\n            if(NULL == obj->Dereference()) NANOCLR_SET_AND_LEAVE(CLR_E_INVALID_PARAMETER);\n            instTDField.InitializeFromIndex( obj->Dereference()->ObjectCls() );\n        }\n        else\n        {\n            instTDField.InitializeFromIndex( *c_CLR_RT_DataTypeLookup[ obj->DataType() ].m_cls );\n        }\n                    \n        NANOCLR_CHECK_HRESULT(val.PerformUnboxing( instTDField ));\n    }\n    else\n    {\n#if defined(NANOCLR_APPDOMAINS)\n        CLR_RT_HeapBlock&          srcObj = stack.Arg1();        \n\n        if(srcObj.IsTransparentProxy())\n        {\n            _ASSERTE(srcObj.DataType() == DATATYPE_OBJECT);\n            _ASSERTE(srcObj.Dereference() != NULL && srcObj.Dereference()->DataType() == DATATYPE_TRANSPARENT_PROXY);\n\n            NANOCLR_CHECK_HRESULT(srcObj.Dereference()->TransparentProxyValidate());\n            NANOCLR_CHECK_HRESULT(srcObj.Dereference()->TransparentProxyAppDomain()->MarshalObject( val, val ));\n        }\n#endif\n    }\n\n    switch(obj->DataType())\n    {\n        case DATATYPE_DATETIME: \/\/ Special case.\n        case DATATYPE_TIMESPAN: \/\/ Special case.\n            obj->NumericByRef().s8 = val.NumericByRefConst().s8;\n            break;\n\n        default:\n            obj->Assign( val );\n            break;\n    }\n\n    NANOCLR_NOCLEANUP();\n}\n\n\/\/--\/\/\n\nHRESULT Library_corlib_native_System_Reflection_FieldInfo::Initialize( CLR_RT_StackFrame& stack, CLR_RT_FieldDef_Instance& instFD, CLR_RT_TypeDef_Instance& instTD, CLR_RT_HeapBlock*& obj )\n{\n    NATIVE_PROFILE_CLR_CORE();\n    NANOCLR_HEADER();\n    CLR_RT_HeapBlock* hbField = stack.Arg0().Dereference();\n\n    if(CLR_RT_ReflectionDef_Index::Convert( *hbField, instFD ) == false ||\n       instTD.InitializeFromField         (           instFD ) == false  )\n    {\n        NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n    }\n\n    if(instFD.m_target->flags & CLR_RECORD_FIELDDEF::FD_Static)\n    {\n        obj = CLR_RT_ExecutionEngine::AccessStaticField( instFD );\n                \n        if(obj == NULL) NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n    }\n    else\n    {\n        NANOCLR_CHECK_HRESULT(stack.Arg1().EnsureObjectReference( obj ));\n\n        if(CLR_RT_ExecutionEngine::IsInstanceOf( *obj, instTD ) == false)\n        {\n            NANOCLR_SET_AND_LEAVE(CLR_E_WRONG_TYPE);\n        }\n                \n        obj = &obj[ instFD.CrossReference().m_offset ];\n    }\n\n    NANOCLR_NOCLEANUP();\n}\n\nHRESULT Library_corlib_native_System_Reflection_FieldInfo::GetCustomAttributes___SZARRAY_OBJECT__BOOLEAN( CLR_RT_StackFrame& stack )\n{\n    NANOCLR_HEADER();\n\n    CLR_RT_HeapBlock*           callerField;\n    CLR_RT_HeapBlock*           returnArray = NULL;\n    CLR_RT_FieldDef_Instance    fieldDefinition;\n    int count = 0;\n\n    \/\/ put the return array on the stack\n    CLR_RT_HeapBlock& top = stack.PushValueAndClear();\n\n    \/\/ get the caller field\n    callerField = stack.Arg0().Dereference();\n\n    NANOCLR_CHECK_HRESULT(Library_corlib_native_System_Reflection_RuntimeFieldInfo::GetFieldDescriptor( stack, *callerField, fieldDefinition ));\n\n    \/\/ setup attribute enumerator\n    CLR_RT_AttributeEnumerator attributeEnumerator;\n    attributeEnumerator.Initialize( fieldDefinition );\n\n    \/\/ 1st pass: count attributes\n    do\n    {\n        \/\/ move to the next attribute in the collection, if any\n        if(attributeEnumerator.Advance())\n        {\n            count++;\n        }\n        else\n        {\n            \/\/ done sweeping attributes\n\n            \/\/ create the result array\n            NANOCLR_CHECK_HRESULT(CLR_RT_HeapBlock_Array::CreateInstance( top, count, g_CLR_RT_WellKnownTypes.m_TypeStatic ));\n\n            \/\/ use this to skip the 2nd pass if no attribute was found\n            if (count == 0) break;\n\n            \/\/ get the pointer to the first element\n            returnArray = (CLR_RT_HeapBlock*)top.DereferenceArray()->GetFirstElement();\n\n            \/\/ reset attribute enumerator\n            attributeEnumerator.Initialize( fieldDefinition );\n\n            break;\n        }\n    } \n    while(true);\n\n    \/\/ 2nd pass: fill the array with the attributes types, if any\n    while(count > 0)\n    {\n        \/\/ move to the next attribute in the collection, if any\n        if(attributeEnumerator.Advance())\n        {\n            CLR_RT_TypeDef_Instance instanceTypeDef;\n            CLR_RT_HeapBlock*     hbObj;\n            \n            \/\/ get the type def for the current attribute\n            attributeEnumerator.GetCurrent(&instanceTypeDef);\n\n            CLR_RT_TypeDef_Index attributeType;\n            attributeType.Set(instanceTypeDef.Assembly(), instanceTypeDef.Type());\n\n            \/\/ create a new object for the attribute type and put it on the return array\n            NANOCLR_CHECK_HRESULT(g_CLR_RT_ExecutionEngine.NewObjectFromIndex(*returnArray, g_CLR_RT_WellKnownTypes.m_TypeStatic));\n            hbObj = returnArray->Dereference();\n            \/\/ make sure the reflection is pointing to the attribute type\n            hbObj->SetReflection( attributeType );\n\n            returnArray++;\n            count--;\n        }\n        else\n        {\n            \/\/ no more attributes\n            break;\n        }\n    } \n\n    NANOCLR_NOCLEANUP();\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef UPDATE_RULE_AMS_SIMD_HPP\n#define UPDATE_RULE_AMS_SIMD_HPP\n\n#include <vector>\n#include <limits>\n#include <string>\n#include <mipp.h>\n\n#include \"Tools\/Math\/max.h\"\n\nnamespace aff3ct\n{\nnamespace tools\n{\ntemplate <typename R = float, proto_min_i<R> MIN = min_star_linear2_i>\nclass Update_rule_AMS_simd \/\/ Approximate Min Star\n{\nprotected:\n\tconst std::string name;\n\tconst mipp::Msk<mipp::N<R>()> false_msk;\n\tconst mipp::Reg<R> max;\n\tconst mipp::Reg<R> zero;\n\tmipp::Msk<mipp::N<R>()> sign;\n\tmipp::Reg<R> min;\n\tmipp::Reg<R> delta_min;\n\tmipp::Reg<R> delta;\n\n\tint n_ite;\n\tint ite;\n\npublic:\n\tUpdate_rule_AMS_simd()\n\t: name(\"AMS\"), false_msk(false), max(std::numeric_limits<R>::max()), zero((R)0), sign(false), min(max),\n\t  delta_min(max), delta(max), n_ite(0), ite(0)\n\t{\n\t}\n\n\tvirtual ~Update_rule_AMS_simd()\n\t{\n\t}\n\n\tstd::string get_name() const\n\t{\n\t\treturn this->name;\n\t}\n\n\t\/\/ ----------------------------------------------------------------------------------------------------------------\n\t\/\/ ----------------------------------------------------------------------------------------------------------------\n\n\tinline void begin_decoding(const int n_ite)\n\t{\n\t\tthis->n_ite = n_ite;\n\t}\n\n\tinline void begin_ite(const int ite)\n\t{\n\t\tthis->ite = ite;\n\t}\n\n\t\/\/ incoming values from the variable nodes into the check nodes\n\tinline void begin_chk_node_in(const int chk_id, const int chk_degree)\n\t{\n\t\tassert(chk_degree <= (int)this->values.size());\n\n\t\tthis->sign      = this->false_msk;\n\t\tthis->min       = this->max;\n\t\tthis->delta_min = this->max;\n\t}\n\n\tinline void compute_chk_node_in(const int var_id, const mipp::Reg<R> var_val)\n\t{\n\t\tconst auto var_abs = mipp::abs(var_val);\n\t\tconst auto var_sgn = mipp::sign(var_val);\n\t\tconst auto tmp     = this->min;\n\n\t\tthis->sign     ^= var_sgn;\n\t\tthis->min       = mipp::min(this->min, var_abs);\n\t\tthis->delta_min = MIN(this->delta_min, mipp::blend(tmp, var_abs, var_abs == this->min));\n\t}\n\n\tinline void end_chk_node_in()\n\t{\n\t\tthis->delta     = mipp::max(zero, MIN(this->delta_min, this->min));\n\t\tthis->delta_min = mipp::max(zero, this->delta_min);\n\t}\n\n\t\/\/ outcomming values from the check nodes into the variable nodes\n\tinline void begin_chk_node_out(const int chk_id, const int chk_degree)\n\t{\n\t}\n\n\tinline mipp::Reg<R> compute_chk_node_out(const int var_id, const mipp::Reg<R> var_val)\n\t{\n\t\tconst auto var_abs = mipp::abs(var_val);\n\t\t      auto res_abs = mipp::blend(this->delta_min, this->delta, var_abs == this->min);\n\t\tconst auto res_sgn = this->sign ^ mipp::sign(var_val);\n\n\t\treturn mipp::copysign(res_abs, res_sgn);\n\t}\n\n\tinline void end_chk_node_out()\n\t{\n\t}\n\n\tinline void end_ite()\n\t{\n\t}\n\n\tinline void end_decoding()\n\t{\n\t}\n};\n}\n}\n\n#endif \/* UPDATE_RULE_AMS_SIMD_HPP *\/\n<commit_msg>Fix compilation error.<commit_after>#ifndef UPDATE_RULE_AMS_SIMD_HPP\n#define UPDATE_RULE_AMS_SIMD_HPP\n\n#include <vector>\n#include <limits>\n#include <string>\n#include <mipp.h>\n\n#include \"Tools\/Math\/max.h\"\n\nnamespace aff3ct\n{\nnamespace tools\n{\ntemplate <typename R = float, proto_min_i<R> MIN = min_star_linear2_i>\nclass Update_rule_AMS_simd \/\/ Approximate Min Star\n{\nprotected:\n\tconst std::string name;\n\tconst mipp::Msk<mipp::N<R>()> false_msk;\n\tconst mipp::Reg<R> max;\n\tconst mipp::Reg<R> zero;\n\tmipp::Msk<mipp::N<R>()> sign;\n\tmipp::Reg<R> min;\n\tmipp::Reg<R> delta_min;\n\tmipp::Reg<R> delta;\n\n\tint n_ite;\n\tint ite;\n\npublic:\n\tUpdate_rule_AMS_simd()\n\t: name(\"AMS\"), false_msk(false), max(std::numeric_limits<R>::max()), zero((R)0), sign(false), min(max),\n\t  delta_min(max), delta(max), n_ite(0), ite(0)\n\t{\n\t}\n\n\tvirtual ~Update_rule_AMS_simd()\n\t{\n\t}\n\n\tstd::string get_name() const\n\t{\n\t\treturn this->name;\n\t}\n\n\t\/\/ ----------------------------------------------------------------------------------------------------------------\n\t\/\/ ----------------------------------------------------------------------------------------------------------------\n\n\tinline void begin_decoding(const int n_ite)\n\t{\n\t\tthis->n_ite = n_ite;\n\t}\n\n\tinline void begin_ite(const int ite)\n\t{\n\t\tthis->ite = ite;\n\t}\n\n\t\/\/ incoming values from the variable nodes into the check nodes\n\tinline void begin_chk_node_in(const int chk_id, const int chk_degree)\n\t{\n\t\tthis->sign      = this->false_msk;\n\t\tthis->min       = this->max;\n\t\tthis->delta_min = this->max;\n\t}\n\n\tinline void compute_chk_node_in(const int var_id, const mipp::Reg<R> var_val)\n\t{\n\t\tconst auto var_abs = mipp::abs(var_val);\n\t\tconst auto var_sgn = mipp::sign(var_val);\n\t\tconst auto tmp     = this->min;\n\n\t\tthis->sign     ^= var_sgn;\n\t\tthis->min       = mipp::min(this->min, var_abs);\n\t\tthis->delta_min = MIN(this->delta_min, mipp::blend(tmp, var_abs, var_abs == this->min));\n\t}\n\n\tinline void end_chk_node_in()\n\t{\n\t\tthis->delta     = mipp::max(zero, MIN(this->delta_min, this->min));\n\t\tthis->delta_min = mipp::max(zero, this->delta_min);\n\t}\n\n\t\/\/ outcomming values from the check nodes into the variable nodes\n\tinline void begin_chk_node_out(const int chk_id, const int chk_degree)\n\t{\n\t}\n\n\tinline mipp::Reg<R> compute_chk_node_out(const int var_id, const mipp::Reg<R> var_val)\n\t{\n\t\tconst auto var_abs = mipp::abs(var_val);\n\t\t      auto res_abs = mipp::blend(this->delta_min, this->delta, var_abs == this->min);\n\t\tconst auto res_sgn = this->sign ^ mipp::sign(var_val);\n\n\t\treturn mipp::copysign(res_abs, res_sgn);\n\t}\n\n\tinline void end_chk_node_out()\n\t{\n\t}\n\n\tinline void end_ite()\n\t{\n\t}\n\n\tinline void end_decoding()\n\t{\n\t}\n};\n}\n}\n\n#endif \/* UPDATE_RULE_AMS_SIMD_HPP *\/\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-2015 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\/containers\/dictionary.h\"\n#include \"foundation\/utility\/containers\/specializedarrays.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(\"edf\", InputFormatEntity, \"\");\n            m_inputs.declare(\"alpha_map\", InputFormatScalar, \"\");\n            m_inputs.declare(\"displacement_map\", InputFormatSpectralReflectance, \"\");\n        }\n\n        virtual void release() APPLESEED_OVERRIDE\n        {\n            delete this;\n        }\n\n        virtual const char* get_model() const APPLESEED_OVERRIDE\n        {\n            return Model;\n        }\n\n        virtual bool on_frame_begin(\n            const Project&              project,\n            const Assembly&             assembly,\n            foundation::IAbortSwitch*   abort_switch = 0) APPLESEED_OVERRIDE\n        {\n            if (!Material::on_frame_begin(project, assembly, abort_switch))\n                return false;\n\n            m_bsdf = get_uncached_bsdf();\n            m_edf = get_uncached_edf();\n\n            const EntityDefMessageContext context(\"material\", this);\n            if (!create_basis_modifier(context))\n                return false;\n\n            if (m_edf && 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        virtual void on_frame_end(\n            const Project&              project,\n            const Assembly&             assembly) APPLESEED_OVERRIDE\n        {\n            Material::on_frame_end(project, assembly);\n        }\n    };\n}\n\n\n\/\/\n\/\/ GenericMaterialFactory class implementation.\n\/\/\n\nconst char* GenericMaterialFactory::get_model() const\n{\n    return Model;\n}\n\nconst char* GenericMaterialFactory::get_human_readable_model() const\n{\n    return \"Generic Material\";\n}\n\nDictionaryArray GenericMaterialFactory::get_input_metadata() const\n{\n    DictionaryArray metadata;\n\n    add_common_input_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\", \"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\", \"alpha_map\")\n            .insert(\"label\", \"Alpha Map\")\n            .insert(\"type\", \"colormap\")\n            .insert(\"entity_types\",\n                Dictionary()\n                    .insert(\"color\", \"Colors\")\n                    .insert(\"texture_instance\", \"Textures\"))\n            .insert(\"use\", \"optional\"));\n\n    metadata.push_back(\n        Dictionary()\n            .insert(\"name\", \"displacement_map\")\n            .insert(\"label\", \"Displacement Map\")\n            .insert(\"type\", \"colormap\")\n            .insert(\"entity_types\",\n                Dictionary().insert(\"texture_instance\", \"Textures\"))\n            .insert(\"use\", \"optional\"));\n\n    metadata.push_back(\n        Dictionary()\n            .insert(\"name\", \"displacement_method\")\n            .insert(\"label\", \"Displacement Method\")\n            .insert(\"type\", \"enumeration\")\n            .insert(\"items\",\n                Dictionary()\n                    .insert(\"Bump Mapping\", \"bump\")\n                    .insert(\"Normal Mapping\", \"normal\"))\n            .insert(\"use\", \"required\")\n            .insert(\"default\", \"bump\"));\n\n    metadata.push_back(\n        Dictionary()\n            .insert(\"name\", \"bump_amplitude\")\n            .insert(\"label\", \"Bump Amplitude\")\n            .insert(\"type\", \"text\")\n            .insert(\"use\", \"optional\")\n            .insert(\"default\", \"1.0\"));\n\n    metadata.push_back(\n        Dictionary()\n            .insert(\"name\", \"normal_map_up\")\n            .insert(\"label\", \"Normal Map Up Vector\")\n            .insert(\"type\", \"enumeration\")\n            .insert(\"items\",\n                Dictionary()\n                    .insert(\"Green Channel (Y)\", \"y\")\n                    .insert(\"Blue Channel (Z)\", \"z\"))\n            .insert(\"use\", \"optional\")\n            .insert(\"default\", \"z\"));\n\n    return metadata;\n}\n\nauto_release_ptr<Material> GenericMaterialFactory::create(\n    const char*         name,\n    const ParamArray&   params) const\n{\n    return\n        auto_release_ptr<Material>(\n            new GenericMaterial(name, params));\n}\n\n}   \/\/ namespace renderer\n<commit_msg>bump amplitude is now a numeric widget.<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-2015 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\/containers\/dictionary.h\"\n#include \"foundation\/utility\/containers\/specializedarrays.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(\"edf\", InputFormatEntity, \"\");\n            m_inputs.declare(\"alpha_map\", InputFormatScalar, \"\");\n            m_inputs.declare(\"displacement_map\", InputFormatSpectralReflectance, \"\");\n        }\n\n        virtual void release() APPLESEED_OVERRIDE\n        {\n            delete this;\n        }\n\n        virtual const char* get_model() const APPLESEED_OVERRIDE\n        {\n            return Model;\n        }\n\n        virtual bool on_frame_begin(\n            const Project&              project,\n            const Assembly&             assembly,\n            foundation::IAbortSwitch*   abort_switch = 0) APPLESEED_OVERRIDE\n        {\n            if (!Material::on_frame_begin(project, assembly, abort_switch))\n                return false;\n\n            m_bsdf = get_uncached_bsdf();\n            m_edf = get_uncached_edf();\n\n            const EntityDefMessageContext context(\"material\", this);\n            if (!create_basis_modifier(context))\n                return false;\n\n            if (m_edf && 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        virtual void on_frame_end(\n            const Project&              project,\n            const Assembly&             assembly) APPLESEED_OVERRIDE\n        {\n            Material::on_frame_end(project, assembly);\n        }\n    };\n}\n\n\n\/\/\n\/\/ GenericMaterialFactory class implementation.\n\/\/\n\nconst char* GenericMaterialFactory::get_model() const\n{\n    return Model;\n}\n\nconst char* GenericMaterialFactory::get_human_readable_model() const\n{\n    return \"Generic Material\";\n}\n\nDictionaryArray GenericMaterialFactory::get_input_metadata() const\n{\n    DictionaryArray metadata;\n\n    add_common_input_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\", \"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\", \"alpha_map\")\n            .insert(\"label\", \"Alpha Map\")\n            .insert(\"type\", \"colormap\")\n            .insert(\"entity_types\",\n                Dictionary()\n                    .insert(\"color\", \"Colors\")\n                    .insert(\"texture_instance\", \"Textures\"))\n            .insert(\"use\", \"optional\"));\n\n    metadata.push_back(\n        Dictionary()\n            .insert(\"name\", \"displacement_map\")\n            .insert(\"label\", \"Displacement Map\")\n            .insert(\"type\", \"colormap\")\n            .insert(\"entity_types\",\n                Dictionary().insert(\"texture_instance\", \"Textures\"))\n            .insert(\"use\", \"optional\"));\n\n    metadata.push_back(\n        Dictionary()\n            .insert(\"name\", \"displacement_method\")\n            .insert(\"label\", \"Displacement Method\")\n            .insert(\"type\", \"enumeration\")\n            .insert(\"items\",\n                Dictionary()\n                    .insert(\"Bump Mapping\", \"bump\")\n                    .insert(\"Normal Mapping\", \"normal\"))\n            .insert(\"use\", \"required\")\n            .insert(\"default\", \"bump\"));\n\n    metadata.push_back(\n        Dictionary()\n            .insert(\"name\", \"bump_amplitude\")\n            .insert(\"label\", \"Bump Amplitude\")\n            .insert(\"type\", \"numeric\")\n            .insert(\"min_value\", \"0.0\")\n            .insert(\"max_value\", \"1.0\")\n            .insert(\"use\", \"optional\")\n            .insert(\"default\", \"1.0\"));\n\n    metadata.push_back(\n        Dictionary()\n            .insert(\"name\", \"normal_map_up\")\n            .insert(\"label\", \"Normal Map Up Vector\")\n            .insert(\"type\", \"enumeration\")\n            .insert(\"items\",\n                Dictionary()\n                    .insert(\"Green Channel (Y)\", \"y\")\n                    .insert(\"Blue Channel (Z)\", \"z\"))\n            .insert(\"use\", \"optional\")\n            .insert(\"default\", \"z\"));\n\n    return metadata;\n}\n\nauto_release_ptr<Material> GenericMaterialFactory::create(\n    const char*         name,\n    const ParamArray&   params) const\n{\n    return\n        auto_release_ptr<Material>(\n            new GenericMaterial(name, params));\n}\n\n}   \/\/ namespace renderer\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2015 Couchbase, 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 \"config.h\"\n\n#include <atomic>\n#include <cstring>\n#include <platform\/cb_malloc.h>\n#include <string>\n\n#include \"daemon\/alloc_hooks.h\"\n\n#include <gtest\/gtest.h>\n\n#if defined(HAVE_MALLOC_USABLE_SIZE)\n#include <malloc.h>\n#endif\n\n\/\/ Test pointer in global scope to prevent compiler optimizing malloc\/free away\n\/\/ via DCE.\nchar* p;\n\nclass MemoryTrackerTest : public ::testing::Test {\npublic:\n    \/\/ callback function for when memory is allocated.\n    static void NewHook(const void* ptr, size_t) {\n        if (ptr != NULL) {\n            void* p = const_cast<void*>(ptr);\n            alloc_size += AllocHooks::get_allocation_size(p);\n        }\n    }\n\n    \/\/ callback function for when memory is deleted.\n    static void DeleteHook(const void* ptr) {\n        if (ptr != NULL) {\n            void* p = const_cast<void*>(ptr);\n            alloc_size -= AllocHooks::get_allocation_size(p);\n        }\n    }\n\n    \/\/ function executed by our accounting test thread.\n    static void AccountingTestThread(void* arg);\n\n    \/\/ Helper function to lookup a symbol in a plugin and return a correctly-typed\n    \/\/ function pointer.\n    template <typename T>\n    static T get_plugin_symbol(cb_dlhandle_t handle, const char* symbol_name) {\n        char* errmsg;\n        T symbol = reinterpret_cast<T>(cb_dlsym(handle, symbol_name, &errmsg));\n        cb_assert(symbol != nullptr);\n        return symbol;\n    }\n\n    static std::atomic_size_t alloc_size;\n};\n\nstd::atomic_size_t MemoryTrackerTest::alloc_size;\n\n\nvoid MemoryTrackerTest::AccountingTestThread(void* arg) {\n    alloc_size = 0;\n\n    \/\/ Test new & delete \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = new char();\n    EXPECT_GT(alloc_size, 0);\n    delete p;\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test sized delete \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = new char();\n    EXPECT_GT(alloc_size, 0);\n    operator delete(p, sizeof(char));\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test new[] & delete[] \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = new char[100];\n    EXPECT_GE(alloc_size, 100);\n    delete []p;\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test sized delete[] \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = new char[100];\n    EXPECT_GE(alloc_size, 100);\n    operator delete[](p, sizeof(char) * 100);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test cb_malloc() \/ cb_free() \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = static_cast<char*>(cb_malloc(sizeof(char) * 10));\n    EXPECT_GE(alloc_size, 10);\n    cb_free(p);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test cb_realloc() \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = static_cast<char*>(cb_malloc(1));\n    EXPECT_GE(alloc_size, 1);\n\n    \/\/ Allocator may round up allocation sizes; so it's hard to\n    \/\/ accurately predict how much alloc_size will increase. Hence\n    \/\/ we just increase by a \"large\" amount and check at least half that\n    \/\/ increment.\n    size_t prev_size = alloc_size;\n    p = static_cast<char*>(cb_realloc(p, sizeof(char) * 100));\n    EXPECT_GE(alloc_size, (prev_size + 50));\n\n    prev_size = alloc_size;\n    p = static_cast<char*>(cb_realloc(p, 1));\n    EXPECT_LT(alloc_size, prev_size);\n\n    prev_size = alloc_size;\n    char* q = static_cast<char*>(cb_realloc(NULL, 10));\n    EXPECT_GE(alloc_size, prev_size + 10);\n\n    cb_free(p);\n    cb_free(q);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test cb_calloc() \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = static_cast<char*>(cb_calloc(sizeof(char), 20));\n    EXPECT_GE(alloc_size, 20);\n    cb_free(p);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test indirect use of malloc() via cb_strdup() \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = cb_strdup(\"random string\");\n    EXPECT_GE(alloc_size, sizeof(\"random string\"));\n    cb_free(p);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test memory allocations performed from another shared library loaded\n    \/\/ at runtime.\n    char* errmsg = nullptr;\n    cb_dlhandle_t plugin = cb_dlopen(\"memcached_memory_tracking_plugin\",\n                                     &errmsg);\n    EXPECT_NE(plugin, nullptr);\n\n    \/\/ dlopen()ing a plugin can allocate memory. Reset alloc_size.\n    alloc_size = 0;\n\n    typedef void* (*plugin_malloc_t)(size_t);\n    auto plugin_malloc =\n        get_plugin_symbol<plugin_malloc_t>(plugin, \"plugin_malloc\");\n    p = static_cast<char*>(plugin_malloc(100));\n    EXPECT_GE(alloc_size, 100);\n\n    typedef void (*plugin_free_t)(void*);\n    auto plugin_free =\n        get_plugin_symbol<plugin_free_t>(plugin, \"plugin_free\");\n    plugin_free(p);\n    EXPECT_EQ(0, alloc_size);\n\n    typedef char* (*plugin_new_char_t)(size_t);\n    auto plugin_new_char =\n        get_plugin_symbol<plugin_new_char_t>(plugin, \"plugin_new_char_array\");\n    p = plugin_new_char(200);\n    EXPECT_GE(alloc_size, 200);\n\n    typedef void (*plugin_delete_array_t)(char*);\n    auto plugin_delete_char =\n        get_plugin_symbol<plugin_delete_array_t>(plugin, \"plugin_delete_array\");\n    plugin_delete_char(p);\n    EXPECT_EQ(0, alloc_size);\n\n    typedef std::string* (*plugin_new_string_t)(const char*);\n    auto plugin_new_string =\n        get_plugin_symbol<plugin_new_string_t>(plugin, \"plugin_new_string\");\n    auto* string = plugin_new_string(\"duplicate_string\");\n    EXPECT_GE(alloc_size, 16);\n\n    typedef void(*plugin_delete_string_t)(std::string* ptr);\n    auto plugin_delete_string =\n        get_plugin_symbol<plugin_delete_string_t>(plugin, \"plugin_delete_string\");\n    plugin_delete_string(string);\n    EXPECT_EQ(0, alloc_size);\n\n    cb_dlclose(plugin);\n}\n\n\/\/ Test that the various memory allocation \/ deletion functions are correctly\n\/\/ accounted for, when run in a parallel thread.\nTEST_F(MemoryTrackerTest, Accounting) {\n    AllocHooks::add_new_hook(NewHook);\n    AllocHooks::add_delete_hook(DeleteHook);\n\n    cb_thread_t tid;\n    ASSERT_EQ(0, cb_create_thread(&tid, AccountingTestThread, 0, 0));\n    ASSERT_EQ(0, cb_join_thread(tid));\n\n    AllocHooks::remove_new_hook(NewHook);\n    AllocHooks::remove_delete_hook(DeleteHook);\n}\n\n\/* Test that malloc_usable_size is correctly interposed when using a\n * non-system allocator, as otherwise, our global new replacement could\n * lead to memory being allocated with jemalloc, but the system\n * malloc_usable_size being called with it.\n * We compare the result of malloc_usable_size to the result of\n * AllocHooks::get_allocation_size, which under jemalloc\n * maps to je_malloc_usable_size.\n * If these differ, or this test segfaults, it is suspicious and\n * worth investigating.\n * NB: ASAN is not helpful here as it does not work well with jemalloc\n *\/\n#if defined(HAVE_MALLOC_USABLE_SIZE)\nTEST_F(MemoryTrackerTest, mallocUsableSize) {\n    \/\/ Allocate some data\n    auto* ptr = new char[1];\n\n    size_t allocHooksResult = AllocHooks::get_allocation_size(ptr);\n    size_t directCallResult = malloc_usable_size(ptr);\n\n    EXPECT_EQ(allocHooksResult, directCallResult);\n\n    delete[] ptr;\n}\n#endif\n\nint main(int argc, char** argv) {\n    ::testing::InitGoogleTest(&argc, argv);\n\n    AllocHooks::initialize();\n\n    return RUN_ALL_TESTS();\n}\n<commit_msg>Revert \"MB-32009: Add sized delete operator tests\"<commit_after>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2015 Couchbase, 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 \"config.h\"\n\n#include <atomic>\n#include <cstring>\n#include <platform\/cb_malloc.h>\n#include <string>\n\n#include \"daemon\/alloc_hooks.h\"\n\n#include <gtest\/gtest.h>\n\n#if defined(HAVE_MALLOC_USABLE_SIZE)\n#include <malloc.h>\n#endif\n\n\/\/ Test pointer in global scope to prevent compiler optimizing malloc\/free away\n\/\/ via DCE.\nchar* p;\n\nclass MemoryTrackerTest : public ::testing::Test {\npublic:\n    \/\/ callback function for when memory is allocated.\n    static void NewHook(const void* ptr, size_t) {\n        if (ptr != NULL) {\n            void* p = const_cast<void*>(ptr);\n            alloc_size += AllocHooks::get_allocation_size(p);\n        }\n    }\n\n    \/\/ callback function for when memory is deleted.\n    static void DeleteHook(const void* ptr) {\n        if (ptr != NULL) {\n            void* p = const_cast<void*>(ptr);\n            alloc_size -= AllocHooks::get_allocation_size(p);\n        }\n    }\n\n    \/\/ function executed by our accounting test thread.\n    static void AccountingTestThread(void* arg);\n\n    \/\/ Helper function to lookup a symbol in a plugin and return a correctly-typed\n    \/\/ function pointer.\n    template <typename T>\n    static T get_plugin_symbol(cb_dlhandle_t handle, const char* symbol_name) {\n        char* errmsg;\n        T symbol = reinterpret_cast<T>(cb_dlsym(handle, symbol_name, &errmsg));\n        cb_assert(symbol != nullptr);\n        return symbol;\n    }\n\n    static std::atomic_size_t alloc_size;\n};\n\nstd::atomic_size_t MemoryTrackerTest::alloc_size;\n\n\nvoid MemoryTrackerTest::AccountingTestThread(void* arg) {\n    alloc_size = 0;\n\n    \/\/ Test new & delete \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = new char();\n    EXPECT_GT(alloc_size, 0);\n    delete p;\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test new[] & delete[] \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = new char[100];\n    EXPECT_GE(alloc_size, 100);\n    delete []p;\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test cb_malloc() \/ cb_free() \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = static_cast<char*>(cb_malloc(sizeof(char) * 10));\n    EXPECT_GE(alloc_size, 10);\n    cb_free(p);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test cb_realloc() \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = static_cast<char*>(cb_malloc(1));\n    EXPECT_GE(alloc_size, 1);\n\n    \/\/ Allocator may round up allocation sizes; so it's hard to\n    \/\/ accurately predict how much alloc_size will increase. Hence\n    \/\/ we just increase by a \"large\" amount and check at least half that\n    \/\/ increment.\n    size_t prev_size = alloc_size;\n    p = static_cast<char*>(cb_realloc(p, sizeof(char) * 100));\n    EXPECT_GE(alloc_size, (prev_size + 50));\n\n    prev_size = alloc_size;\n    p = static_cast<char*>(cb_realloc(p, 1));\n    EXPECT_LT(alloc_size, prev_size);\n\n    prev_size = alloc_size;\n    char* q = static_cast<char*>(cb_realloc(NULL, 10));\n    EXPECT_GE(alloc_size, prev_size + 10);\n\n    cb_free(p);\n    cb_free(q);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test cb_calloc() \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = static_cast<char*>(cb_calloc(sizeof(char), 20));\n    EXPECT_GE(alloc_size, 20);\n    cb_free(p);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test indirect use of malloc() via cb_strdup() \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    p = cb_strdup(\"random string\");\n    EXPECT_GE(alloc_size, sizeof(\"random string\"));\n    cb_free(p);\n    EXPECT_EQ(0, alloc_size);\n\n    \/\/ Test memory allocations performed from another shared library loaded\n    \/\/ at runtime.\n    char* errmsg = nullptr;\n    cb_dlhandle_t plugin = cb_dlopen(\"memcached_memory_tracking_plugin\",\n                                     &errmsg);\n    EXPECT_NE(plugin, nullptr);\n\n    \/\/ dlopen()ing a plugin can allocate memory. Reset alloc_size.\n    alloc_size = 0;\n\n    typedef void* (*plugin_malloc_t)(size_t);\n    auto plugin_malloc =\n        get_plugin_symbol<plugin_malloc_t>(plugin, \"plugin_malloc\");\n    p = static_cast<char*>(plugin_malloc(100));\n    EXPECT_GE(alloc_size, 100);\n\n    typedef void (*plugin_free_t)(void*);\n    auto plugin_free =\n        get_plugin_symbol<plugin_free_t>(plugin, \"plugin_free\");\n    plugin_free(p);\n    EXPECT_EQ(0, alloc_size);\n\n    typedef char* (*plugin_new_char_t)(size_t);\n    auto plugin_new_char =\n        get_plugin_symbol<plugin_new_char_t>(plugin, \"plugin_new_char_array\");\n    p = plugin_new_char(200);\n    EXPECT_GE(alloc_size, 200);\n\n    typedef void (*plugin_delete_array_t)(char*);\n    auto plugin_delete_char =\n        get_plugin_symbol<plugin_delete_array_t>(plugin, \"plugin_delete_array\");\n    plugin_delete_char(p);\n    EXPECT_EQ(0, alloc_size);\n\n    typedef std::string* (*plugin_new_string_t)(const char*);\n    auto plugin_new_string =\n        get_plugin_symbol<plugin_new_string_t>(plugin, \"plugin_new_string\");\n    auto* string = plugin_new_string(\"duplicate_string\");\n    EXPECT_GE(alloc_size, 16);\n\n    typedef void(*plugin_delete_string_t)(std::string* ptr);\n    auto plugin_delete_string =\n        get_plugin_symbol<plugin_delete_string_t>(plugin, \"plugin_delete_string\");\n    plugin_delete_string(string);\n    EXPECT_EQ(0, alloc_size);\n\n    cb_dlclose(plugin);\n}\n\n\/\/ Test that the various memory allocation \/ deletion functions are correctly\n\/\/ accounted for, when run in a parallel thread.\nTEST_F(MemoryTrackerTest, Accounting) {\n    AllocHooks::add_new_hook(NewHook);\n    AllocHooks::add_delete_hook(DeleteHook);\n\n    cb_thread_t tid;\n    ASSERT_EQ(0, cb_create_thread(&tid, AccountingTestThread, 0, 0));\n    ASSERT_EQ(0, cb_join_thread(tid));\n\n    AllocHooks::remove_new_hook(NewHook);\n    AllocHooks::remove_delete_hook(DeleteHook);\n}\n\n\/* Test that malloc_usable_size is correctly interposed when using a\n * non-system allocator, as otherwise, our global new replacement could\n * lead to memory being allocated with jemalloc, but the system\n * malloc_usable_size being called with it.\n * We compare the result of malloc_usable_size to the result of\n * AllocHooks::get_allocation_size, which under jemalloc\n * maps to je_malloc_usable_size.\n * If these differ, or this test segfaults, it is suspicious and\n * worth investigating.\n * NB: ASAN is not helpful here as it does not work well with jemalloc\n *\/\n#if defined(HAVE_MALLOC_USABLE_SIZE)\nTEST_F(MemoryTrackerTest, mallocUsableSize) {\n    \/\/ Allocate some data\n    auto* ptr = new char[1];\n\n    size_t allocHooksResult = AllocHooks::get_allocation_size(ptr);\n    size_t directCallResult = malloc_usable_size(ptr);\n\n    EXPECT_EQ(allocHooksResult, directCallResult);\n\n    delete[] ptr;\n}\n#endif\n\nint main(int argc, char** argv) {\n    ::testing::InitGoogleTest(&argc, argv);\n\n    AllocHooks::initialize();\n\n    return RUN_ALL_TESTS();\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 <stdlib.h>\n#include <string.h>\n\n#include <gtest\/gtest.h>\n\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/channel\/channel_trace.h\"\n#include \"src\/core\/lib\/channel\/channel_trace_registry.h\"\n#include \"src\/core\/lib\/gpr\/useful.h\"\n#include \"src\/core\/lib\/iomgr\/exec_ctx.h\"\n#include \"src\/core\/lib\/json\/json.h\"\n\n#include \"test\/core\/util\/test_config.h\"\n#include \"test\/cpp\/util\/channel_trace_proto_helper.h\"\n\n\/\/ remove me\n#include <grpc\/support\/string_util.h>\n#include <stdlib.h>\n#include <string.h>\n\nnamespace grpc_core {\nnamespace testing {\nnamespace {\n\ngrpc_json* GetJsonChild(grpc_json* parent, const char* key) {\n  EXPECT_NE(parent, nullptr);\n  for (grpc_json* child = parent->child; child != nullptr;\n       child = child->next) {\n    if (child->key != nullptr && strcmp(child->key, key) == 0) return child;\n  }\n  return nullptr;\n}\n\nvoid ValidateJsonArraySize(grpc_json* json, const char* key,\n                           size_t expected_size) {\n  grpc_json* arr = GetJsonChild(json, key);\n  ASSERT_NE(arr, nullptr);\n  ASSERT_EQ(arr->type, GRPC_JSON_ARRAY);\n  size_t count = 0;\n  for (grpc_json* child = arr->child; child != nullptr; child = child->next) {\n    ++count;\n  }\n  ASSERT_EQ(count, expected_size);\n}\n\nvoid ValidateChannelTraceData(grpc_json* json,\n                              size_t num_events_logged_expected,\n                              size_t actual_num_events_expected) {\n  ASSERT_NE(json, nullptr);\n  grpc_json* num_events_logged_json = GetJsonChild(json, \"numEventsLogged\");\n  ASSERT_NE(num_events_logged_json, nullptr);\n  grpc_json* start_time = GetJsonChild(json, \"creationTime\");\n  ASSERT_NE(start_time, nullptr);\n  size_t num_events_logged =\n      (size_t)strtol(num_events_logged_json->value, nullptr, 0);\n  ASSERT_EQ(num_events_logged, num_events_logged_expected);\n  ValidateJsonArraySize(json, \"events\", actual_num_events_expected);\n}\n\nvoid AddSimpleTrace(RefCountedPtr<ChannelTrace> tracer) {\n  tracer->AddTraceEvent(ChannelTrace::Severity::Info,\n                        grpc_slice_from_static_string(\"simple trace\"));\n}\n\n\/\/ checks for the existence of all the required members of the tracer.\nvoid ValidateChannelTrace(RefCountedPtr<ChannelTrace> tracer,\n                          size_t expected_num_event_logged, size_t max_nodes) {\n  if (!max_nodes) return;\n  char* json_str = tracer->RenderTrace();\n  grpc::testing::ValidateChannelTraceProtoJsonTranslation(json_str);\n  grpc_json* json = grpc_json_parse_string(json_str);\n  ValidateChannelTraceData(json, expected_num_event_logged,\n                           GPR_MIN(expected_num_event_logged, max_nodes));\n  grpc_json_destroy(json);\n  gpr_free(json_str);\n}\n\nvoid ValidateTraceDataMatchedUuidLookup(RefCountedPtr<ChannelTrace> tracer) {\n  intptr_t uuid = tracer->GetUuid();\n  if (uuid == -1) return;  \/\/ Doesn't make sense to lookup if tracing disabled\n  char* tracer_json_str = tracer->RenderTrace();\n  ChannelTrace* uuid_lookup =\n      grpc_channel_trace_registry_get_channel_trace(uuid);\n  char* uuid_lookup_json_str = uuid_lookup->RenderTrace();\n  EXPECT_EQ(strcmp(tracer_json_str, uuid_lookup_json_str), 0);\n  gpr_free(tracer_json_str);\n  gpr_free(uuid_lookup_json_str);\n}\n\n}  \/\/ anonymous namespace\n\nclass ChannelTracerTest : public ::testing::TestWithParam<size_t> {};\n\n\/\/ Tests basic ChannelTrace functionality like construction, adding trace, and\n\/\/ lookups by uuid.\nTEST_P(ChannelTracerTest, BasicTest) {\n  grpc_core::ExecCtx exec_ctx;\n  RefCountedPtr<ChannelTrace> tracer = MakeRefCounted<ChannelTrace>(GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateTraceDataMatchedUuidLookup(tracer);\n  tracer->AddTraceEvent(ChannelTrace::Severity::Info,\n                        grpc_slice_from_static_string(\"trace three\"));\n  tracer->AddTraceEvent(ChannelTrace::Severity::Error,\n                        grpc_slice_from_static_string(\"trace four error\"));\n  ValidateChannelTrace(tracer, 4, GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 6, GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 10, GetParam());\n  ValidateTraceDataMatchedUuidLookup(tracer);\n  tracer.reset(nullptr);\n}\n\n\/\/ Tests more complex functionality, like a parent channel tracking\n\/\/ subchannles. This exercises the ref\/unref patterns since the parent tracer\n\/\/ and this function will both hold refs to the subchannel.\nTEST_P(ChannelTracerTest, ComplexTest) {\n  grpc_core::ExecCtx exec_ctx;\n  RefCountedPtr<ChannelTrace> tracer = MakeRefCounted<ChannelTrace>(GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  RefCountedPtr<ChannelTrace> sc1 = MakeRefCounted<ChannelTrace>(GetParam());\n  tracer->AddTraceEventReferencingSubchannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"subchannel one created\"), sc1);\n  ValidateChannelTrace(tracer, 3, GetParam());\n  AddSimpleTrace(sc1);\n  AddSimpleTrace(sc1);\n  AddSimpleTrace(sc1);\n  ValidateChannelTrace(sc1, 3, GetParam());\n  AddSimpleTrace(sc1);\n  AddSimpleTrace(sc1);\n  AddSimpleTrace(sc1);\n  ValidateChannelTrace(sc1, 6, GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 5, GetParam());\n  ValidateTraceDataMatchedUuidLookup(tracer);\n  RefCountedPtr<ChannelTrace> sc2 = MakeRefCounted<ChannelTrace>(GetParam());\n  tracer->AddTraceEventReferencingChannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"LB channel two created\"), sc2);\n  tracer->AddTraceEventReferencingSubchannel(\n      ChannelTrace::Severity::Warning,\n      grpc_slice_from_static_string(\"subchannel one inactive\"), sc1);\n  ValidateChannelTrace(tracer, 7, GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateTraceDataMatchedUuidLookup(tracer);\n  tracer.reset(nullptr);\n  sc1.reset(nullptr);\n  sc2.reset(nullptr);\n}\n\n\/\/ Test a case in which the parent channel has subchannels and the subchannels\n\/\/ have connections. Ensures that everything lives as long as it should then\n\/\/ gets deleted.\nTEST_P(ChannelTracerTest, TestNesting) {\n  grpc_core::ExecCtx exec_ctx;\n  RefCountedPtr<ChannelTrace> tracer = MakeRefCounted<ChannelTrace>(GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  RefCountedPtr<ChannelTrace> sc1 = MakeRefCounted<ChannelTrace>(GetParam());\n  tracer->AddTraceEventReferencingChannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"subchannel one created\"), sc1);\n  AddSimpleTrace(sc1);\n  RefCountedPtr<ChannelTrace> conn1 = MakeRefCounted<ChannelTrace>(GetParam());\n  \/\/ nesting one level deeper.\n  sc1->AddTraceEventReferencingSubchannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"connection one created\"), conn1);\n  AddSimpleTrace(conn1);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  RefCountedPtr<ChannelTrace> sc2 = MakeRefCounted<ChannelTrace>(GetParam());\n  tracer->AddTraceEventReferencingSubchannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"subchannel two created\"), sc2);\n  \/\/ this trace should not get added to the parents children since it is already\n  \/\/ present in the tracer.\n  tracer->AddTraceEventReferencingChannel(\n      ChannelTrace::Severity::Warning,\n      grpc_slice_from_static_string(\"subchannel one inactive\"), sc1);\n  AddSimpleTrace(tracer);\n  tracer.reset(nullptr);\n  sc1.reset(nullptr);\n  sc2.reset(nullptr);\n  conn1.reset(nullptr);\n}\n\nINSTANTIATE_TEST_CASE_P(ChannelTracerTestSweep, ChannelTracerTest,\n                        ::testing::Values(0, 1, 2, 6, 10, 15));\n\n}  \/\/ namespace testing\n}  \/\/ namespace grpc_core\n\nint main(int argc, char** argv) {\n  grpc_test_init(argc, argv);\n  grpc_init();\n  ::testing::InitGoogleTest(&argc, argv);\n  int ret = RUN_ALL_TESTS();\n  grpc_shutdown();\n  return ret;\n}\n<commit_msg>Add more validation tests to channel_trace_test<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 <stdlib.h>\n#include <string.h>\n\n#include <gtest\/gtest.h>\n\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/channel\/channel_trace.h\"\n#include \"src\/core\/lib\/channel\/channel_trace_registry.h\"\n#include \"src\/core\/lib\/gpr\/useful.h\"\n#include \"src\/core\/lib\/iomgr\/exec_ctx.h\"\n#include \"src\/core\/lib\/json\/json.h\"\n\n#include \"test\/core\/util\/test_config.h\"\n#include \"test\/cpp\/util\/channel_trace_proto_helper.h\"\n\n\/\/ remove me\n#include <grpc\/support\/string_util.h>\n#include <stdlib.h>\n#include <string.h>\n\nnamespace grpc_core {\nnamespace testing {\nnamespace {\n\ngrpc_json* GetJsonChild(grpc_json* parent, const char* key) {\n  EXPECT_NE(parent, nullptr);\n  for (grpc_json* child = parent->child; child != nullptr;\n       child = child->next) {\n    if (child->key != nullptr && strcmp(child->key, key) == 0) return child;\n  }\n  return nullptr;\n}\n\nvoid ValidateJsonArraySize(grpc_json* json, const char* key,\n                           size_t expected_size) {\n  grpc_json* arr = GetJsonChild(json, key);\n  ASSERT_NE(arr, nullptr);\n  ASSERT_EQ(arr->type, GRPC_JSON_ARRAY);\n  size_t count = 0;\n  for (grpc_json* child = arr->child; child != nullptr; child = child->next) {\n    ++count;\n  }\n  ASSERT_EQ(count, expected_size);\n}\n\nvoid ValidateChannelTraceData(grpc_json* json,\n                              size_t num_events_logged_expected,\n                              size_t actual_num_events_expected) {\n  ASSERT_NE(json, nullptr);\n  grpc_json* num_events_logged_json = GetJsonChild(json, \"numEventsLogged\");\n  ASSERT_NE(num_events_logged_json, nullptr);\n  grpc_json* start_time = GetJsonChild(json, \"creationTime\");\n  ASSERT_NE(start_time, nullptr);\n  size_t num_events_logged =\n      (size_t)strtol(num_events_logged_json->value, nullptr, 0);\n  ASSERT_EQ(num_events_logged, num_events_logged_expected);\n  ValidateJsonArraySize(json, \"events\", actual_num_events_expected);\n}\n\nvoid AddSimpleTrace(RefCountedPtr<ChannelTrace> tracer) {\n  tracer->AddTraceEvent(ChannelTrace::Severity::Info,\n                        grpc_slice_from_static_string(\"simple trace\"));\n}\n\n\/\/ checks for the existence of all the required members of the tracer.\nvoid ValidateChannelTrace(RefCountedPtr<ChannelTrace> tracer,\n                          size_t expected_num_event_logged, size_t max_nodes) {\n  if (!max_nodes) return;\n  char* json_str = tracer->RenderTrace();\n  grpc::testing::ValidateChannelTraceProtoJsonTranslation(json_str);\n  grpc_json* json = grpc_json_parse_string(json_str);\n  ValidateChannelTraceData(json, expected_num_event_logged,\n                           GPR_MIN(expected_num_event_logged, max_nodes));\n  grpc_json_destroy(json);\n  gpr_free(json_str);\n}\n\nvoid ValidateTraceDataMatchedUuidLookup(RefCountedPtr<ChannelTrace> tracer) {\n  intptr_t uuid = tracer->GetUuid();\n  if (uuid == -1) return;  \/\/ Doesn't make sense to lookup if tracing disabled\n  char* tracer_json_str = tracer->RenderTrace();\n  ChannelTrace* uuid_lookup =\n      grpc_channel_trace_registry_get_channel_trace(uuid);\n  char* uuid_lookup_json_str = uuid_lookup->RenderTrace();\n  EXPECT_EQ(strcmp(tracer_json_str, uuid_lookup_json_str), 0);\n  gpr_free(tracer_json_str);\n  gpr_free(uuid_lookup_json_str);\n}\n\n}  \/\/ anonymous namespace\n\nclass ChannelTracerTest : public ::testing::TestWithParam<size_t> {};\n\n\/\/ Tests basic ChannelTrace functionality like construction, adding trace, and\n\/\/ lookups by uuid.\nTEST_P(ChannelTracerTest, BasicTest) {\n  grpc_core::ExecCtx exec_ctx;\n  RefCountedPtr<ChannelTrace> tracer = MakeRefCounted<ChannelTrace>(GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateTraceDataMatchedUuidLookup(tracer);\n  tracer->AddTraceEvent(ChannelTrace::Severity::Info,\n                        grpc_slice_from_static_string(\"trace three\"));\n  tracer->AddTraceEvent(ChannelTrace::Severity::Error,\n                        grpc_slice_from_static_string(\"trace four error\"));\n  ValidateChannelTrace(tracer, 4, GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 6, GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 10, GetParam());\n  ValidateTraceDataMatchedUuidLookup(tracer);\n  tracer.reset(nullptr);\n}\n\n\/\/ Tests more complex functionality, like a parent channel tracking\n\/\/ subchannles. This exercises the ref\/unref patterns since the parent tracer\n\/\/ and this function will both hold refs to the subchannel.\nTEST_P(ChannelTracerTest, ComplexTest) {\n  grpc_core::ExecCtx exec_ctx;\n  RefCountedPtr<ChannelTrace> tracer = MakeRefCounted<ChannelTrace>(GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  RefCountedPtr<ChannelTrace> sc1 = MakeRefCounted<ChannelTrace>(GetParam());\n  tracer->AddTraceEventReferencingSubchannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"subchannel one created\"), sc1);\n  ValidateChannelTrace(tracer, 3, GetParam());\n  AddSimpleTrace(sc1);\n  AddSimpleTrace(sc1);\n  AddSimpleTrace(sc1);\n  ValidateChannelTrace(sc1, 3, GetParam());\n  AddSimpleTrace(sc1);\n  AddSimpleTrace(sc1);\n  AddSimpleTrace(sc1);\n  ValidateChannelTrace(sc1, 6, GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 5, GetParam());\n  ValidateTraceDataMatchedUuidLookup(tracer);\n  RefCountedPtr<ChannelTrace> sc2 = MakeRefCounted<ChannelTrace>(GetParam());\n  tracer->AddTraceEventReferencingChannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"LB channel two created\"), sc2);\n  tracer->AddTraceEventReferencingSubchannel(\n      ChannelTrace::Severity::Warning,\n      grpc_slice_from_static_string(\"subchannel one inactive\"), sc1);\n  ValidateChannelTrace(tracer, 7, GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateTraceDataMatchedUuidLookup(tracer);\n  tracer.reset(nullptr);\n  sc1.reset(nullptr);\n  sc2.reset(nullptr);\n}\n\n\/\/ Test a case in which the parent channel has subchannels and the subchannels\n\/\/ have connections. Ensures that everything lives as long as it should then\n\/\/ gets deleted.\nTEST_P(ChannelTracerTest, TestNesting) {\n  grpc_core::ExecCtx exec_ctx;\n  RefCountedPtr<ChannelTrace> tracer = MakeRefCounted<ChannelTrace>(GetParam());\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 2, GetParam());\n  RefCountedPtr<ChannelTrace> sc1 = MakeRefCounted<ChannelTrace>(GetParam());\n  tracer->AddTraceEventReferencingChannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"subchannel one created\"), sc1);\n  ValidateChannelTrace(tracer, 3, GetParam());\n  AddSimpleTrace(sc1);\n  RefCountedPtr<ChannelTrace> conn1 = MakeRefCounted<ChannelTrace>(GetParam());\n  \/\/ nesting one level deeper.\n  sc1->AddTraceEventReferencingSubchannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"connection one created\"), conn1);\n  ValidateChannelTrace(tracer, 3, GetParam());\n  AddSimpleTrace(conn1);\n  AddSimpleTrace(tracer);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 5, GetParam());\n  ValidateChannelTrace(conn1, 1, GetParam());\n  RefCountedPtr<ChannelTrace> sc2 = MakeRefCounted<ChannelTrace>(GetParam());\n  tracer->AddTraceEventReferencingSubchannel(\n      ChannelTrace::Severity::Info,\n      grpc_slice_from_static_string(\"subchannel two created\"), sc2);\n  \/\/ this trace should not get added to the parents children since it is already\n  \/\/ present in the tracer.\n  tracer->AddTraceEventReferencingChannel(\n      ChannelTrace::Severity::Warning,\n      grpc_slice_from_static_string(\"subchannel one inactive\"), sc1);\n  AddSimpleTrace(tracer);\n  ValidateChannelTrace(tracer, 8, GetParam());\n  tracer.reset(nullptr);\n  sc1.reset(nullptr);\n  sc2.reset(nullptr);\n  conn1.reset(nullptr);\n}\n\nINSTANTIATE_TEST_CASE_P(ChannelTracerTestSweep, ChannelTracerTest,\n                        ::testing::Values(0, 1, 2, 6, 10, 15));\n\n}  \/\/ namespace testing\n}  \/\/ namespace grpc_core\n\nint main(int argc, char** argv) {\n  grpc_test_init(argc, argv);\n  grpc_init();\n  ::testing::InitGoogleTest(&argc, argv);\n  int ret = RUN_ALL_TESTS();\n  grpc_shutdown();\n  return ret;\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\/* Test out various metadata handling primitives *\/\n\n#include <benchmark\/benchmark.h>\n#include <grpc\/grpc.h>\n\n#include \"src\/core\/lib\/slice\/slice_internal.h\"\n#include \"src\/core\/lib\/transport\/metadata.h\"\n#include \"src\/core\/lib\/transport\/static_metadata.h\"\n\n#include \"test\/cpp\/microbenchmarks\/helpers.h\"\n#include \"test\/cpp\/util\/test_config.h\"\n\nstatic void BM_SliceFromStatic(benchmark::State& state) {\n  TrackCounters track_counters;\n  for (auto _ : state) {\n    benchmark::DoNotOptimize(grpc_core::ExternallyManagedSlice(\"abc\"));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceFromStatic);\n\nstatic void BM_SliceFromCopied(benchmark::State& state) {\n  TrackCounters track_counters;\n  for (auto _ : state) {\n    grpc_slice_unref(grpc_core::UnmanagedMemorySlice(\"abc\"));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceFromCopied);\n\nstatic void BM_SliceIntern(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice slice(\"abc\");\n  for (auto _ : state) {\n    grpc_slice_unref(grpc_core::ManagedMemorySlice(&slice));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceIntern);\n\nstatic void BM_SliceReIntern(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice static_slice(\"abc\");\n  grpc_core::ManagedMemorySlice slice(&static_slice);\n  for (auto _ : state) {\n    grpc_slice_unref(grpc_core::ManagedMemorySlice(&slice));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceReIntern);\n\nstatic void BM_SliceInternStaticMetadata(benchmark::State& state) {\n  TrackCounters track_counters;\n  for (auto _ : state) {\n    benchmark::DoNotOptimize(grpc_core::ManagedMemorySlice(&GRPC_MDSTR_GZIP));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceInternStaticMetadata);\n\nstatic void BM_SliceInternEqualToStaticMetadata(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice slice(\"gzip\");\n  for (auto _ : state) {\n    benchmark::DoNotOptimize(grpc_core::ManagedMemorySlice(&slice));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceInternEqualToStaticMetadata);\n\nstatic void BM_MetadataFromNonInternedSlices(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice k(\"key\");\n  grpc_core::ExternallyManagedSlice v(\"value\");\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(k, v, nullptr));\n  }\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromNonInternedSlices);\n\nstatic void BM_MetadataFromInternedSlices(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ManagedMemorySlice v(\"value\");\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(k, v, nullptr));\n  }\n\n  grpc_slice_unref(k);\n  grpc_slice_unref(v);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedSlices);\n\nstatic void BM_MetadataFromInternedSlicesAlreadyInIndex(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ManagedMemorySlice v(\"value\");\n  grpc_core::ExecCtx exec_ctx;\n  grpc_mdelem seed = grpc_mdelem_create(k, v, nullptr);\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(k, v, nullptr));\n  }\n  GRPC_MDELEM_UNREF(seed);\n\n  grpc_slice_unref(k);\n  grpc_slice_unref(v);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedSlicesAlreadyInIndex);\n\nstatic void BM_MetadataFromInternedKey(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ExternallyManagedSlice v(\"value\");\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(k, v, nullptr));\n  }\n\n  grpc_slice_unref(k);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedKey);\n\nstatic void BM_MetadataFromNonInternedSlicesWithBackingStore(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice k(\"key\");\n  grpc_core::ExternallyManagedSlice v(\"value\");\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(\n        k, v, reinterpret_cast<grpc_mdelem_data*>(backing_store)));\n  }\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromNonInternedSlicesWithBackingStore);\n\nstatic void BM_MetadataFromInternedSlicesWithBackingStore(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ManagedMemorySlice v(\"value\");\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(\n        k, v, reinterpret_cast<grpc_mdelem_data*>(backing_store)));\n  }\n\n  grpc_slice_unref(k);\n  grpc_slice_unref(v);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedSlicesWithBackingStore);\n\nstatic void BM_MetadataFromInternedKeyWithBackingStore(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ExternallyManagedSlice v(\"value\");\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(\n        k, v, reinterpret_cast<grpc_mdelem_data*>(backing_store)));\n  }\n\n  grpc_slice_unref(k);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedKeyWithBackingStore);\n\nstatic void BM_MetadataFromStaticMetadataStrings(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(\n        grpc_mdelem_create(GRPC_MDSTR_STATUS, GRPC_MDSTR_200, nullptr));\n  }\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromStaticMetadataStrings);\n\nstatic void BM_MetadataFromStaticMetadataStringsNotIndexed(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(\n        grpc_mdelem_create(GRPC_MDSTR_STATUS, GRPC_MDSTR_GZIP, nullptr));\n  }\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromStaticMetadataStringsNotIndexed);\n\nstatic void BM_MetadataRefUnrefExternal(benchmark::State& state) {\n  TrackCounters track_counters;\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  grpc_mdelem el =\n      grpc_mdelem_create(grpc_core::ExternallyManagedSlice(\"a\"),\n                         grpc_core::ExternallyManagedSlice(\"b\"),\n                         reinterpret_cast<grpc_mdelem_data*>(backing_store));\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(GRPC_MDELEM_REF(el));\n  }\n  GRPC_MDELEM_UNREF(el);\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataRefUnrefExternal);\n\nstatic void BM_MetadataRefUnrefInterned(benchmark::State& state) {\n  TrackCounters track_counters;\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ManagedMemorySlice v(\"value\");\n  grpc_mdelem el = grpc_mdelem_create(\n      k, v, reinterpret_cast<grpc_mdelem_data*>(backing_store));\n  grpc_slice_unref(k);\n  grpc_slice_unref(v);\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(GRPC_MDELEM_REF(el));\n  }\n  GRPC_MDELEM_UNREF(el);\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataRefUnrefInterned);\n\nstatic void BM_MetadataRefUnrefAllocated(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExecCtx exec_ctx;\n  grpc_mdelem el =\n      grpc_mdelem_create(grpc_core::ExternallyManagedSlice(\"a\"),\n                         grpc_core::ExternallyManagedSlice(\"b\"), nullptr);\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(GRPC_MDELEM_REF(el));\n  }\n  GRPC_MDELEM_UNREF(el);\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataRefUnrefAllocated);\n\nstatic void BM_MetadataRefUnrefStatic(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExecCtx exec_ctx;\n  grpc_mdelem el =\n      grpc_mdelem_create(GRPC_MDSTR_STATUS, GRPC_MDSTR_200, nullptr);\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(GRPC_MDELEM_REF(el));\n  }\n  GRPC_MDELEM_UNREF(el);\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataRefUnrefStatic);\n\n\/\/ Some distros have RunSpecifiedBenchmarks under the benchmark namespace,\n\/\/ and others do not. This allows us to support both modes.\nnamespace benchmark {\nvoid RunTheBenchmarksNamespaced() { RunSpecifiedBenchmarks(); }\n}  \/\/ namespace benchmark\n\nint main(int argc, char** argv) {\n  LibraryInitializer libInit;\n  ::benchmark::Initialize(&argc, argv);\n  ::grpc::testing::InitTest(&argc, &argv, false);\n  benchmark::RunTheBenchmarksNamespaced();\n  return 0;\n}\n<commit_msg>Add missing grpc_slice_unref to bm_metadata<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\/* Test out various metadata handling primitives *\/\n\n#include <benchmark\/benchmark.h>\n#include <grpc\/grpc.h>\n\n#include \"src\/core\/lib\/slice\/slice_internal.h\"\n#include \"src\/core\/lib\/transport\/metadata.h\"\n#include \"src\/core\/lib\/transport\/static_metadata.h\"\n\n#include \"test\/cpp\/microbenchmarks\/helpers.h\"\n#include \"test\/cpp\/util\/test_config.h\"\n\nstatic void BM_SliceFromStatic(benchmark::State& state) {\n  TrackCounters track_counters;\n  for (auto _ : state) {\n    benchmark::DoNotOptimize(grpc_core::ExternallyManagedSlice(\"abc\"));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceFromStatic);\n\nstatic void BM_SliceFromCopied(benchmark::State& state) {\n  TrackCounters track_counters;\n  for (auto _ : state) {\n    grpc_slice_unref(grpc_core::UnmanagedMemorySlice(\"abc\"));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceFromCopied);\n\nstatic void BM_SliceIntern(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice slice(\"abc\");\n  for (auto _ : state) {\n    grpc_slice_unref(grpc_core::ManagedMemorySlice(&slice));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceIntern);\n\nstatic void BM_SliceReIntern(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice static_slice(\"abc\");\n  grpc_core::ManagedMemorySlice slice(&static_slice);\n  for (auto _ : state) {\n    grpc_slice_unref(grpc_core::ManagedMemorySlice(&slice));\n  }\n  grpc_slice_unref(slice);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceReIntern);\n\nstatic void BM_SliceInternStaticMetadata(benchmark::State& state) {\n  TrackCounters track_counters;\n  for (auto _ : state) {\n    benchmark::DoNotOptimize(grpc_core::ManagedMemorySlice(&GRPC_MDSTR_GZIP));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceInternStaticMetadata);\n\nstatic void BM_SliceInternEqualToStaticMetadata(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice slice(\"gzip\");\n  for (auto _ : state) {\n    benchmark::DoNotOptimize(grpc_core::ManagedMemorySlice(&slice));\n  }\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_SliceInternEqualToStaticMetadata);\n\nstatic void BM_MetadataFromNonInternedSlices(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice k(\"key\");\n  grpc_core::ExternallyManagedSlice v(\"value\");\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(k, v, nullptr));\n  }\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromNonInternedSlices);\n\nstatic void BM_MetadataFromInternedSlices(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ManagedMemorySlice v(\"value\");\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(k, v, nullptr));\n  }\n\n  grpc_slice_unref(k);\n  grpc_slice_unref(v);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedSlices);\n\nstatic void BM_MetadataFromInternedSlicesAlreadyInIndex(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ManagedMemorySlice v(\"value\");\n  grpc_core::ExecCtx exec_ctx;\n  grpc_mdelem seed = grpc_mdelem_create(k, v, nullptr);\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(k, v, nullptr));\n  }\n  GRPC_MDELEM_UNREF(seed);\n\n  grpc_slice_unref(k);\n  grpc_slice_unref(v);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedSlicesAlreadyInIndex);\n\nstatic void BM_MetadataFromInternedKey(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ExternallyManagedSlice v(\"value\");\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(k, v, nullptr));\n  }\n\n  grpc_slice_unref(k);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedKey);\n\nstatic void BM_MetadataFromNonInternedSlicesWithBackingStore(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExternallyManagedSlice k(\"key\");\n  grpc_core::ExternallyManagedSlice v(\"value\");\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(\n        k, v, reinterpret_cast<grpc_mdelem_data*>(backing_store)));\n  }\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromNonInternedSlicesWithBackingStore);\n\nstatic void BM_MetadataFromInternedSlicesWithBackingStore(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ManagedMemorySlice v(\"value\");\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(\n        k, v, reinterpret_cast<grpc_mdelem_data*>(backing_store)));\n  }\n\n  grpc_slice_unref(k);\n  grpc_slice_unref(v);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedSlicesWithBackingStore);\n\nstatic void BM_MetadataFromInternedKeyWithBackingStore(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ExternallyManagedSlice v(\"value\");\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(grpc_mdelem_create(\n        k, v, reinterpret_cast<grpc_mdelem_data*>(backing_store)));\n  }\n\n  grpc_slice_unref(k);\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromInternedKeyWithBackingStore);\n\nstatic void BM_MetadataFromStaticMetadataStrings(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(\n        grpc_mdelem_create(GRPC_MDSTR_STATUS, GRPC_MDSTR_200, nullptr));\n  }\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromStaticMetadataStrings);\n\nstatic void BM_MetadataFromStaticMetadataStringsNotIndexed(\n    benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExecCtx exec_ctx;\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(\n        grpc_mdelem_create(GRPC_MDSTR_STATUS, GRPC_MDSTR_GZIP, nullptr));\n  }\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataFromStaticMetadataStringsNotIndexed);\n\nstatic void BM_MetadataRefUnrefExternal(benchmark::State& state) {\n  TrackCounters track_counters;\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  grpc_mdelem el =\n      grpc_mdelem_create(grpc_core::ExternallyManagedSlice(\"a\"),\n                         grpc_core::ExternallyManagedSlice(\"b\"),\n                         reinterpret_cast<grpc_mdelem_data*>(backing_store));\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(GRPC_MDELEM_REF(el));\n  }\n  GRPC_MDELEM_UNREF(el);\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataRefUnrefExternal);\n\nstatic void BM_MetadataRefUnrefInterned(benchmark::State& state) {\n  TrackCounters track_counters;\n  char backing_store[sizeof(grpc_mdelem_data)];\n  grpc_core::ExecCtx exec_ctx;\n  grpc_core::ManagedMemorySlice k(\"key\");\n  grpc_core::ManagedMemorySlice v(\"value\");\n  grpc_mdelem el = grpc_mdelem_create(\n      k, v, reinterpret_cast<grpc_mdelem_data*>(backing_store));\n  grpc_slice_unref(k);\n  grpc_slice_unref(v);\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(GRPC_MDELEM_REF(el));\n  }\n  GRPC_MDELEM_UNREF(el);\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataRefUnrefInterned);\n\nstatic void BM_MetadataRefUnrefAllocated(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExecCtx exec_ctx;\n  grpc_mdelem el =\n      grpc_mdelem_create(grpc_core::ExternallyManagedSlice(\"a\"),\n                         grpc_core::ExternallyManagedSlice(\"b\"), nullptr);\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(GRPC_MDELEM_REF(el));\n  }\n  GRPC_MDELEM_UNREF(el);\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataRefUnrefAllocated);\n\nstatic void BM_MetadataRefUnrefStatic(benchmark::State& state) {\n  TrackCounters track_counters;\n  grpc_core::ExecCtx exec_ctx;\n  grpc_mdelem el =\n      grpc_mdelem_create(GRPC_MDSTR_STATUS, GRPC_MDSTR_200, nullptr);\n  for (auto _ : state) {\n    GRPC_MDELEM_UNREF(GRPC_MDELEM_REF(el));\n  }\n  GRPC_MDELEM_UNREF(el);\n\n  track_counters.Finish(state);\n}\nBENCHMARK(BM_MetadataRefUnrefStatic);\n\n\/\/ Some distros have RunSpecifiedBenchmarks under the benchmark namespace,\n\/\/ and others do not. This allows us to support both modes.\nnamespace benchmark {\nvoid RunTheBenchmarksNamespaced() { RunSpecifiedBenchmarks(); }\n}  \/\/ namespace benchmark\n\nint main(int argc, char** argv) {\n  LibraryInitializer libInit;\n  ::benchmark::Initialize(&argc, argv);\n  ::grpc::testing::InitTest(&argc, &argv, false);\n  benchmark::RunTheBenchmarksNamespaced();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>routing: added QoS similar to ros latch mode<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <QtTest\/QtTest>\n#include <QProcess>\n\nnamespace cutehmi {\nnamespace daemon {\n\nclass test_cutehmi_daemon:\n\tpublic QObject\n{\n\tQ_OBJECT\n\n\tprivate slots:\n\t\tvoid initTestCase();\n\n\t\tvoid helpOption();\n\n\t\tvoid versionOption();\n\n\t\tvoid countDaemonExample();\n\n\tprivate:\n\t\tQString m_installRoot;\n\t\tQString m_programPath;\n};\n\nvoid test_cutehmi_daemon::initTestCase()\n{\n\tQString m_installRoot = qEnvironmentVariable(\"CUTEHMI_INSTALL_ROOT\");\n\tQVERIFY(!m_installRoot.isEmpty());\n\n\tm_programPath = m_installRoot + \"\/bin\/cutehmi_daemon\";\n#ifndef CUTEHMI_NDEBUG\n\tm_programPath += \"_debug\";\n#endif\n}\n\nvoid test_cutehmi_daemon::helpOption()\n{\n\tQList<QStringList> argumentsList;\n\targumentsList << QStringList({\"--help\"})\n\t\t\t\t  << QStringList({\"--h\"});\n\n\tfor (auto arguments: argumentsList) {\n\t\tQProcess process;\n\t\tprocess.start(m_programPath, arguments);\n\t\tprocess.waitForFinished(1000);\n\t\tQCOMPARE(process.error(), QProcess::UnknownError);\n\t\tQVERIFY(!process.readAllStandardError().contains(\"Unknown option\"));\n\t\tQVERIFY(!process.readAllStandardOutput().isEmpty());\n\t\tQCOMPARE(process.exitStatus(), QProcess::NormalExit);\n\t\tQCOMPARE(process.exitCode(), EXIT_SUCCESS);\n\t}\n}\n\nvoid test_cutehmi_daemon::versionOption()\n{\n\tQList<QStringList> argumentsList;\n\targumentsList << QStringList({\"--version\"})\n\t\t\t\t  << QStringList({\"--v\"});\n\n\tfor (auto arguments: argumentsList) {\n\t\tQProcess process;\n\t\tprocess.start(m_programPath, arguments);\n\t\tprocess.waitForFinished(1000);\n\t\tQCOMPARE(process.error(), QProcess::UnknownError);\n\t\tQVERIFY(!process.readAllStandardError().contains(\"Unknown option\"));\n\t\tQVERIFY(!process.readAllStandardOutput().isEmpty());\n\t\tQCOMPARE(process.exitStatus(), QProcess::NormalExit);\n\t\tQCOMPARE(process.exitCode(), EXIT_SUCCESS);\n\t}\n}\n\nvoid test_cutehmi_daemon::countDaemonExample()\n{\n\tQProcess process;\n\tQStringList arguments { {\"--app\"}, {\"--project=examples\/CountDaemon\/Main.qml\"} };\n\tprocess.start(m_programPath, arguments);\n\tprocess.waitForFinished();\n\n\tQString stdOut = QString::fromLocal8Bit(process.readAllStandardOutput());\n\tQString stdErr = QString::fromLocal8Bit(process.readAllStandardError());\n\n\tQVERIFY(!stdErr.contains(\"Unknown option\"));\n\n\t{\n\t\tQRegExp rx(\".*(Project file .* does not exist).*\");\n\t\tQVERIFY2(!rx.exactMatch(stdErr), rx.cap(1).toLocal8Bit().constData());\n\t}\n\n\tQVERIFY(stdErr.contains(\"I can count\"));\n\n\tQCOMPARE(process.error(), QProcess::UnknownError);\n\tQCOMPARE(process.exitStatus(), QProcess::NormalExit);\n\tQCOMPARE(process.exitCode(), EXIT_SUCCESS);\n}\n\n}\n}\n\nQTEST_MAIN(cutehmi::daemon::test_cutehmi_daemon)\n#include \"test_cutehmi_daemon.moc\"\n\n\/\/(c)MP: Copyright © 2019, Michal Policht. All rights reserved.\n\/\/(c)MP: 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 distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n<commit_msg>Verify that process has finished.<commit_after>#include <QtTest\/QtTest>\n#include <QProcess>\n\nnamespace cutehmi {\nnamespace daemon {\n\nclass test_cutehmi_daemon:\n\tpublic QObject\n{\n\tQ_OBJECT\n\n\tprivate slots:\n\t\tvoid initTestCase();\n\n\t\tvoid helpOption();\n\n\t\tvoid versionOption();\n\n\t\tvoid countDaemonExample();\n\n\tprivate:\n\t\tQString m_installRoot;\n\t\tQString m_programPath;\n};\n\nvoid test_cutehmi_daemon::initTestCase()\n{\n\tQString m_installRoot = qEnvironmentVariable(\"CUTEHMI_INSTALL_ROOT\");\n\tQVERIFY(!m_installRoot.isEmpty());\n\n\tm_programPath = m_installRoot + \"\/bin\/cutehmi_daemon\";\n#ifndef CUTEHMI_NDEBUG\n\tm_programPath += \"_debug\";\n#endif\n}\n\nvoid test_cutehmi_daemon::helpOption()\n{\n\tQList<QStringList> argumentsList;\n\targumentsList << QStringList({\"--help\"})\n\t\t\t\t  << QStringList({\"--h\"});\n\n\tfor (auto arguments: argumentsList) {\n\t\tQProcess process;\n\t\tprocess.start(m_programPath, arguments);\n\t\tprocess.waitForFinished(1000);\n\t\tQCOMPARE(process.error(), QProcess::UnknownError);\n\t\tQVERIFY(!process.readAllStandardError().contains(\"Unknown option\"));\n\t\tQVERIFY(!process.readAllStandardOutput().isEmpty());\n\t\tQCOMPARE(process.exitStatus(), QProcess::NormalExit);\n\t\tQCOMPARE(process.exitCode(), EXIT_SUCCESS);\n\t}\n}\n\nvoid test_cutehmi_daemon::versionOption()\n{\n\tQList<QStringList> argumentsList;\n\targumentsList << QStringList({\"--version\"})\n\t\t\t\t  << QStringList({\"--v\"});\n\n\tfor (auto arguments: argumentsList) {\n\t\tQProcess process;\n\t\tprocess.start(m_programPath, arguments);\n\t\tprocess.waitForFinished(1000);\n\t\tQCOMPARE(process.error(), QProcess::UnknownError);\n\t\tQVERIFY(!process.readAllStandardError().contains(\"Unknown option\"));\n\t\tQVERIFY(!process.readAllStandardOutput().isEmpty());\n\t\tQCOMPARE(process.exitStatus(), QProcess::NormalExit);\n\t\tQCOMPARE(process.exitCode(), EXIT_SUCCESS);\n\t}\n}\n\nvoid test_cutehmi_daemon::countDaemonExample()\n{\n\tQProcess process;\n\tQStringList arguments { {\"--app\"}, {\"--project=examples\/CountDaemon\/Main.qml\"} };\n\tprocess.start(m_programPath, arguments);\n\tQVERIFY(process.waitForFinished());\n\n\tQString stdOut = QString::fromLocal8Bit(process.readAllStandardOutput());\n\tQString stdErr = QString::fromLocal8Bit(process.readAllStandardError());\n\n\tQVERIFY(!stdErr.contains(\"Unknown option\"));\n\n\t{\n\t\tQRegExp rx(\".*(Project file .* does not exist).*\");\n\t\tQVERIFY2(!rx.exactMatch(stdErr), rx.cap(1).toLocal8Bit().constData());\n\t}\n\n\tQVERIFY(stdErr.contains(\"I can count\"));\n\n\tQCOMPARE(process.error(), QProcess::UnknownError);\n\tQCOMPARE(process.exitStatus(), QProcess::NormalExit);\n\tQCOMPARE(process.exitCode(), EXIT_SUCCESS);\n}\n\n}\n}\n\nQTEST_MAIN(cutehmi::daemon::test_cutehmi_daemon)\n#include \"test_cutehmi_daemon.moc\"\n\n\/\/(c)MP: Copyright © 2019, Michal Policht. All rights reserved.\n\/\/(c)MP: 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 distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ packet_manager_test.cpp\n\/\/\n\/\/ Identification: test\/wire\/packet_manager_test.cpp\n\/\/\n\/\/ Copyright (c) 2016-17, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"common\/harness.h\"\n#include \"gtest\/gtest.h\"\n#include \"common\/logger.h\"\n#include \"wire\/libevent_server.h\"\n#include <pqxx\/pqxx> \/* libpqxx is used to instantiate C++ client *\/\n\n#define NUM_THREADS 1\n\nnamespace peloton {\nnamespace test {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Packet Manager Tests\n\/\/===--------------------------------------------------------------------===\/\/\n\nclass PacketManagerTests : public PelotonTest {};\n\nstatic void *LaunchServer(peloton::wire::LibeventServer libeventserver) {\n  try {\n    libeventserver.StartServer();\n  } catch (peloton::ConnectionException exception) {\n    LOG_INFO(\"[LaunchServer] exception in thread\");\n  }\n  return NULL;\n}\n\n\/**\n * Simple select query test\n *\/\nstatic void *SimpleQueryTest(void *) {\n  try {\n    pqxx::connection C(\n        \"host=127.0.0.1 port=15721 user=postgres sslmode=disable\");\n    LOG_INFO(\"[SimpleQueryTest] Connected to %s\", C.dbname());\n    pqxx::work W(C);\n\n    peloton::wire::LibeventSocket *conn =\n        peloton::wire::LibeventServer::GetConn(\n            peloton::wire::LibeventServer::recent_connfd);\n\n    EXPECT_EQ(conn->pkt_manager.is_started, true);\n    EXPECT_EQ(conn->state, peloton::wire::CONN_READ);\n    \/\/ create table and insert some data\n    W.exec(\"DROP TABLE IF EXISTS employee;\");\n    W.exec(\"CREATE TABLE employee(id INT, name VARCHAR(100));\");\n    W.exec(\"INSERT INTO employee VALUES (1, 'Han LI');\");\n    W.exec(\"INSERT INTO employee VALUES (2, 'Shaokun ZOU');\");\n    W.exec(\"INSERT INTO employee VALUES (3, 'Yilei CHU');\");\n\n    pqxx::result R = W.exec(\"SELECT name FROM employee where id=1;\");\n\n    EXPECT_EQ(R.size(), 1);\n    LOG_INFO(\"[SimpleQueryTest] Found %lu employees\", R.size());\n    W.commit();\n  } catch (const std::exception &e) {\n    LOG_INFO(\"[SimpleQueryTest] Exception occurred\");\n  }\n\n  LOG_INFO(\"[SimpleQueryTest] Client has closed\");\n  return NULL;\n}\n\n\/**\n * named prepare statement without parameters\n * TODO: add prepare's parameters when parser team fix the bug\n *\/\n\nstatic void *PrepareStatementTest(void *) {\n  try {\n    pqxx::connection C(\n        \"host=127.0.0.1 port=15721 user=postgres sslmode=disable\");\n    LOG_INFO(\"[PrepareStatementTest] Connected to %s\", C.dbname());\n    pqxx::work W(C);\n    \n    peloton::wire::LibeventSocket *conn =\n        peloton::wire::LibeventServer::GetConn(\n            peloton::wire::LibeventServer::recent_connfd);\n\n    \/\/ create table and insert some data\n    W.exec(\"DROP TABLE IF EXISTS employee;\");\n    W.exec(\"CREATE TABLE employee(id INT, name VARCHAR(100));\");\n    W.exec(\"INSERT INTO employee VALUES (1, 'Han LI');\");\n    W.exec(\"INSERT INTO employee VALUES (2, 'Shaokun ZOU');\");\n    W.exec(\"INSERT INTO employee VALUES (3, 'Yilei CHU');\");\n\n    \/\/ test prepare statement\n    C.prepare(\"searchstmt\",\"SELECT name FROM employee WHERE id=1;\");\n    \/\/ invocation as in variable binding\n    pqxx::result R = W.prepared(\"searchstmt\").exec();\n    W.commit();\n\n    \/\/ test prepared statement already in statement cache\n\/\/    LOG_INFO(\"[Prepare statement cache] %d\",conn->pkt_manager.ExistCachedStatement(\"searchstmt\"));\n    EXPECT_TRUE(conn->pkt_manager.ExistCachedStatement(\"searchstmt\"));\n\n    LOG_INFO(\"Prepare statement search result:%lu\",R.size());\n  } catch (const std::exception &e) {\n    LOG_INFO(\"[PrepareStatementTest] Exception occurred\");\n  }\n\n  LOG_INFO(\"[PrepareStatementTest] Client has closed\");\n  return NULL;\n}\n\n\/**\n * Use std::thread to initiate peloton server and pqxx client in separate\n * threads\n * Simple query test to guarantee both sides run correctly\n * Callback method to close server after client finishes\n *\/\nTEST_F(PacketManagerTests, SimpleQueryTest) {\n  peloton::PelotonInit::Initialize();\n  LOG_INFO(\"Server initialized\");\n  peloton::wire::LibeventServer libeventserver;\n  std::thread serverThread(LaunchServer, libeventserver);\n  while (!libeventserver.is_started) {\n    sleep(1);\n  }\n\n  \/* server & client running correctly *\/\n  SimpleQueryTest(NULL);\n\n  \/* TODO: monitor packet_manager's status when receiving prepare statement from\n   * client *\/\n  \/\/ PrepareStatementTest(NULL);\n\n  libeventserver.CloseServer();\n  serverThread.join();\n  LOG_INFO(\"Thread has joined\");\n  peloton::PelotonInit::Shutdown();\n  LOG_INFO(\"Peloton has shut down\\n\");\n}\n\nTEST_F(PacketManagerTests, PrepareStatementTest) {\n  peloton::PelotonInit::Initialize();\n  LOG_INFO(\"Server initialized\");\n  peloton::wire::LibeventServer libeventserver;\n  std::thread serverThread(LaunchServer, libeventserver);\n  while (!libeventserver.is_started) {\n    sleep(1);\n  }\n\n  PrepareStatementTest(NULL);\n\n  libeventserver.CloseServer();\n  serverThread.join();\n  LOG_INFO(\"Thread has joined\");\n  peloton::PelotonInit::Shutdown();\n  LOG_INFO(\"Peloton has shut down\\n\");\n}\n\n}  \/\/ End test namespace\n}  \/\/ End peloton namespace\n<commit_msg>add rollback test<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ packet_manager_test.cpp\n\/\/\n\/\/ Identification: test\/wire\/packet_manager_test.cpp\n\/\/\n\/\/ Copyright (c) 2016-17, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"common\/harness.h\"\n#include \"gtest\/gtest.h\"\n#include \"common\/logger.h\"\n#include \"wire\/libevent_server.h\"\n#include <pqxx\/pqxx> \/* libpqxx is used to instantiate C++ client *\/\n\n#define NUM_THREADS 1\n\nnamespace peloton {\nnamespace test {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Packet Manager Tests\n\/\/===--------------------------------------------------------------------===\/\/\n\nclass PacketManagerTests : public PelotonTest {};\n\nstatic void *LaunchServer(peloton::wire::LibeventServer libeventserver) {\n  try {\n    libeventserver.StartServer();\n  } catch (peloton::ConnectionException exception) {\n    LOG_INFO(\"[LaunchServer] exception in thread\");\n  }\n  return NULL;\n}\n\n\/**\n * Simple select query test\n *\/\nstatic void *SimpleQueryTest(void *) {\n  try {\n    pqxx::connection C(\n        \"host=127.0.0.1 port=15721 user=postgres sslmode=disable\");\n    LOG_INFO(\"[SimpleQueryTest] Connected to %s\", C.dbname());\n    pqxx::work W(C);\n\n    peloton::wire::LibeventSocket *conn =\n        peloton::wire::LibeventServer::GetConn(\n            peloton::wire::LibeventServer::recent_connfd);\n\n    EXPECT_EQ(conn->pkt_manager.is_started, true);\n    EXPECT_EQ(conn->state, peloton::wire::CONN_READ);\n    \/\/ create table and insert some data\n    W.exec(\"DROP TABLE IF EXISTS employee;\");\n    W.exec(\"CREATE TABLE employee(id INT, name VARCHAR(100));\");\n    W.exec(\"INSERT INTO employee VALUES (1, 'Han LI');\");\n    W.exec(\"INSERT INTO employee VALUES (2, 'Shaokun ZOU');\");\n    W.exec(\"INSERT INTO employee VALUES (3, 'Yilei CHU');\");\n\n    pqxx::result R = W.exec(\"SELECT name FROM employee where id=1;\");\n\n    EXPECT_EQ(R.size(), 1);\n    LOG_INFO(\"[SimpleQueryTest] Found %lu employees\", R.size());\n    W.commit();\n  } catch (const std::exception &e) {\n    LOG_INFO(\"[SimpleQueryTest] Exception occurred\");\n  }\n\n  LOG_INFO(\"[SimpleQueryTest] Client has closed\");\n  return NULL;\n}\n\n\/**\n * named prepare statement without parameters\n * TODO: add prepare's parameters when parser team fix the bug\n *\/\n\nstatic void *PrepareStatementTest(void *) {\n  try {\n    pqxx::connection C(\n        \"host=127.0.0.1 port=15721 user=postgres sslmode=disable\");\n    LOG_INFO(\"[PrepareStatementTest] Connected to %s\", C.dbname());\n    pqxx::work W(C);\n    \n    peloton::wire::LibeventSocket *conn =\n        peloton::wire::LibeventServer::GetConn(\n            peloton::wire::LibeventServer::recent_connfd);\n\n    \/\/ create table and insert some data\n    W.exec(\"DROP TABLE IF EXISTS employee;\");\n    W.exec(\"CREATE TABLE employee(id INT, name VARCHAR(100));\");\n    W.exec(\"INSERT INTO employee VALUES (1, 'Han LI');\");\n    W.exec(\"INSERT INTO employee VALUES (2, 'Shaokun ZOU');\");\n    W.exec(\"INSERT INTO employee VALUES (3, 'Yilei CHU');\");\n\n    \/\/ test prepare statement\n    C.prepare(\"searchstmt\",\"SELECT name FROM employee WHERE id=1;\");\n    \/\/ invocation as in variable binding\n    pqxx::result R = W.prepared(\"searchstmt\").exec();\n    W.commit();\n\n    \/\/ test prepared statement already in statement cache\n\/\/    LOG_INFO(\"[Prepare statement cache] %d\",conn->pkt_manager.ExistCachedStatement(\"searchstmt\"));\n    EXPECT_TRUE(conn->pkt_manager.ExistCachedStatement(\"searchstmt\"));\n\n    LOG_INFO(\"Prepare statement search result:%lu\",R.size());\n  } catch (const std::exception &e) {\n    LOG_INFO(\"[PrepareStatementTest] Exception occurred\");\n  }\n\n  LOG_INFO(\"[PrepareStatementTest] Client has closed\");\n  return NULL;\n}\n\n\/**\n * rollback test\n *\/\nstatic void *RollbackTest(void *) {\n  try {\n    pqxx::connection C(\n        \"host=127.0.0.1 port=15721 user=postgres sslmode=disable\");\n    LOG_INFO(\"[RollbackTest] Connected to %s\", C.dbname());\n    pqxx::work W(C);\n\n    peloton::wire::LibeventSocket *conn =\n        peloton::wire::LibeventServer::GetConn(\n            peloton::wire::LibeventServer::recent_connfd);\n\n    EXPECT_EQ(conn->pkt_manager.is_started, true);\n    EXPECT_EQ(conn->state, peloton::wire::CONN_READ);\n    \/\/ create table and insert some data\n    W.exec(\"DROP TABLE IF EXISTS employee;\");\n    W.exec(\"CREATE TABLE employee(id INT, name VARCHAR(100));\");\n    w.abort();\n\n    \/\/ W.exec(\"INSERT INTO employee VALUES (1, 'Han LI');\");\n    \/\/ W.exec(\"INSERT INTO employee VALUES (2, 'Shaokun ZOU');\");\n    \/\/ W.exec(\"INSERT INTO employee VALUES (3, 'Yilei CHU');\");\n\n    pqxx::result R = W.exec(\"SELECT name FROM employee where id=1;\");\n\n    EXPECT_EQ(R.size(), 1);\n    LOG_INFO(\"[RollbackTest] Found %lu employees\", R.size());\n    W.commit();\n  } catch (const std::exception &e) {\n    LOG_INFO(\"[RollbackTest] Exception occurred\");\n  }\n\n  LOG_INFO(\"[RollbackTest] Client has closed\");\n  return NULL;\n}\n\n\n\/**\n * Use std::thread to initiate peloton server and pqxx client in separate\n * threads\n * Simple query test to guarantee both sides run correctly\n * Callback method to close server after client finishes\n *\/\nTEST_F(PacketManagerTests, SimpleQueryTest) {\n  peloton::PelotonInit::Initialize();\n  LOG_INFO(\"Server initialized\");\n  peloton::wire::LibeventServer libeventserver;\n  std::thread serverThread(LaunchServer, libeventserver);\n  while (!libeventserver.is_started) {\n    sleep(1);\n  }\n\n  \/* server & client running correctly *\/\n  SimpleQueryTest(NULL);\n\n  \/* TODO: monitor packet_manager's status when receiving prepare statement from\n   * client *\/\n  \/\/ PrepareStatementTest(NULL);\n\n  libeventserver.CloseServer();\n  serverThread.join();\n  LOG_INFO(\"Thread has joined\");\n  peloton::PelotonInit::Shutdown();\n  LOG_INFO(\"Peloton has shut down\\n\");\n}\n\nTEST_F(PacketManagerTests, PrepareStatementTest) {\n  peloton::PelotonInit::Initialize();\n  LOG_INFO(\"Server initialized\");\n  peloton::wire::LibeventServer libeventserver;\n  std::thread serverThread(LaunchServer, libeventserver);\n  while (!libeventserver.is_started) {\n    sleep(1);\n  }\n\n  PrepareStatementTest(NULL);\n\n  libeventserver.CloseServer();\n  serverThread.join();\n  LOG_INFO(\"Thread has joined\");\n  peloton::PelotonInit::Shutdown();\n  LOG_INFO(\"Peloton has shut down\\n\");\n}\n\n\nTEST_F(PacketManagerTests, RollbackTest) {\n  peloton::PelotonInit::Initialize();\n  LOG_INFO(\"Server initialized\");\n  peloton::wire::LibeventServer libeventserver;\n  std::thread serverThread(LaunchServer, libeventserver);\n  while (!libeventserver.is_started) {\n    sleep(1);\n  }\n\n  RollbackTest(NULL);\n\n  libeventserver.CloseServer();\n  serverThread.join();\n  LOG_INFO(\"Thread has joined\");\n  peloton::PelotonInit::Shutdown();\n  LOG_INFO(\"Peloton has shut down\\n\");\n}\n\n}  \/\/ End test namespace\n}  \/\/ End peloton namespace\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (C) 2003 MySQL 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#ifndef NDB_SCAN_FILTER_HPP\n#define NDB_SCAN_FILTER_HPP\n\n#include <ndb_types.h>\n\n\/**\n * @class NdbScanFilter\n * @brief A simple way to specify filters for scan operations\n *\n * @note  This filter interface is under development and may change in \n *        the future! \n * \n *\/\nclass NdbScanFilter {\npublic:\n  \/**\n   * Constructor\n   * @param op  The NdbOperation that the filter belongs to (is applied to).\n   *\/\n  NdbScanFilter(class NdbOperation * op);\n  ~NdbScanFilter();\n  \n  \/**\n   *  Group operators\n   *\/\n  enum Group {\n    AND  = 1,    \/\/\/< (x1 AND x2 AND x3)\n    OR   = 2,    \/\/\/< (x1 OR x2 OR X3)\n    NAND = 3,    \/\/\/< NOT (x1 AND x2 AND x3)\n    NOR  = 4     \/\/\/< NOT (x1 OR x2 OR x3)\n  };\n\n  enum BinaryCondition \n  {\n    COND_LE = 0,        \/\/\/< lower bound\n    COND_LT = 1,        \/\/\/< lower bound, strict\n    COND_GE = 2,        \/\/\/< upper bound\n    COND_GT = 3,        \/\/\/< upper bound, strict\n    COND_EQ = 4,        \/\/\/< equality\n    COND_NE = 5\n  };\n\n  \/** \n   * @name Grouping\n   * @{\n   *\/\n\n  \/**\n   *  Begin of compound.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int begin(Group group = AND);    \n\n  \/**\n   *  End of compound.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int end();\n\n  \/** @} *********************************************************************\/\n\n  \/**\n   *  <i>Explanation missing<\/i>\n   *\/\n  int istrue();\n\n  \/**\n   *  <i>Explanation missing<\/i>\n   *\/\n  int isfalse();\n\n  \/**\n   * Compare column <b>ColId<\/b> with <b>val<\/b>\n   *\/\n  int cmp(BinaryCondition cond, int ColId, const void *val, Uint32 len = 0); \n\n  \/** \n   * @name Integer Comparators\n   * @{\n   *\/\n  \/** Compare column value with integer for equal   \n   *  return  0 if successful, -1 otherwize\n   *\/\n  int eq(int ColId, Uint32 value) { return cmp(COND_EQ, ColId, &value, 4);}\n\n  \/** Compare column value with integer for not equal.\n   *  return  0 if successful, -1 otherwize \n   *\/\n  int ne(int ColId, Uint32 value) { return cmp(COND_NE, ColId, &value, 4);}  \n  \/** Compare column value with integer for less than.\n   *  return  0 if successful, -1 otherwize \n   *\/\n  int lt(int ColId, Uint32 value) { return cmp(COND_LT, ColId, &value, 4);}\n  \/** Compare column value with integer for less than or equal. \n   *  return  0 if successful, -1 otherwize\n   *\/\n  int le(int ColId, Uint32 value) { return cmp(COND_LE, ColId, &value, 4);}\n  \/** Compare column value with integer for greater than. \n   *  return  0 if successful, -1 otherwize\n   *\/\n  int gt(int ColId, Uint32 value) { return cmp(COND_GT, ColId, &value, 4);} \n  \/** Compare column value with integer for greater than or equal.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int ge(int ColId, Uint32 value) { return cmp(COND_GE, ColId, &value, 4);}\n\n  \/** Compare column value with integer for equal. 64-bit.  \n   *  return  0 if successful, -1 otherwize\n   *\/\n  int eq(int ColId, Uint64 value) { return cmp(COND_EQ, ColId, &value, 8);}\n  \/** Compare column value with integer for not equal. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int ne(int ColId, Uint64 value) { return cmp(COND_NE, ColId, &value, 8);}\n  \/** Compare column value with integer for less than. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int lt(int ColId, Uint64 value) { return cmp(COND_LT, ColId, &value, 8);}  \n  \/** Compare column value with integer for less than or equal. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int le(int ColId, Uint64 value) { return cmp(COND_LE, ColId, &value, 8);}\n  \/** Compare column value with integer for greater than. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int gt(int ColId, Uint64 value) { return cmp(COND_GT, ColId, &value, 8);}\n  \/** Compare column value with integer for greater than or equal. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int ge(int ColId, Uint64 value) { return cmp(COND_GE, ColId, &value, 8);}\n  \/** @} *********************************************************************\/\n\n  \/** Check if column value is NULL *\/\n  int isnull(int ColId);             \n  \/** Check if column value is non-NULL *\/\n  int isnotnull(int ColId);          \n  \n#ifndef DOXYGEN_SHOULD_SKIP_INTERNAL\n  \/**\n   *  Like comparison operator.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int like(int ColId, const char * val, Uint32 len, bool nopad=false);\n  \/**\n   *  Notlike comparison operator.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int notlike(int ColId, const char * val, Uint32 len, bool nopad=false);\n  \/** @} *********************************************************************\/\n#endif\n\nprivate:\n#ifndef DOXYGEN_SHOULD_SKIP_INTERNAL\n  friend class NdbScanFilterImpl;\n#endif\n  class NdbScanFilterImpl & m_impl;\n  NdbScanFilter& operator=(const NdbScanFilter&); \/\/\/< Defined not implemented\n};\n\n#endif\n<commit_msg>NdbScanFilter.hpp:   added docs<commit_after>\/* Copyright (C) 2003 MySQL 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#ifndef NDB_SCAN_FILTER_HPP\n#define NDB_SCAN_FILTER_HPP\n\n#include <ndb_types.h>\n\n\/**\n * @class NdbScanFilter\n * @brief A simple way to specify filters for scan operations\n *\n * @note  This filter interface is under development and may change in \n *        the future! \n * \n *\/\nclass NdbScanFilter {\npublic:\n  \/**\n   * Constructor\n   * @param op  The NdbOperation that the filter belongs to (is applied to).\n   *\/\n  NdbScanFilter(class NdbOperation * op);\n  ~NdbScanFilter();\n  \n  \/**\n   *  Group operators\n   *\/\n  enum Group {\n    AND  = 1,    \/\/\/< (x1 AND x2 AND x3)\n    OR   = 2,    \/\/\/< (x1 OR x2 OR X3)\n    NAND = 3,    \/\/\/< NOT (x1 AND x2 AND x3)\n    NOR  = 4     \/\/\/< NOT (x1 OR x2 OR x3)\n  };\n\n  enum BinaryCondition \n  {\n    COND_LE = 0,        \/\/\/< lower bound\n    COND_LT = 1,        \/\/\/< lower bound, strict\n    COND_GE = 2,        \/\/\/< upper bound\n    COND_GT = 3,        \/\/\/< upper bound, strict\n    COND_EQ = 4,        \/\/\/< equality\n    COND_NE = 5         \/\/\/< not equal\n  };\n\n  \/** \n   * @name Grouping\n   * @{\n   *\/\n\n  \/**\n   *  Begin of compound.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int begin(Group group = AND);    \n\n  \/**\n   *  End of compound.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int end();\n\n  \/** @} *********************************************************************\/\n\n  \/**\n   *  <i>Explanation missing<\/i>\n   *\/\n  int istrue();\n\n  \/**\n   *  <i>Explanation missing<\/i>\n   *\/\n  int isfalse();\n\n  \/**\n   * Compare column <b>ColId<\/b> with <b>val<\/b>\n   *\/\n  int cmp(BinaryCondition cond, int ColId, const void *val, Uint32 len = 0); \n\n  \/** \n   * @name Integer Comparators\n   * @{\n   *\/\n  \/** Compare column value with integer for equal   \n   *  return  0 if successful, -1 otherwize\n   *\/\n  int eq(int ColId, Uint32 value) { return cmp(COND_EQ, ColId, &value, 4);}\n\n  \/** Compare column value with integer for not equal.\n   *  return  0 if successful, -1 otherwize \n   *\/\n  int ne(int ColId, Uint32 value) { return cmp(COND_NE, ColId, &value, 4);}  \n  \/** Compare column value with integer for less than.\n   *  return  0 if successful, -1 otherwize \n   *\/\n  int lt(int ColId, Uint32 value) { return cmp(COND_LT, ColId, &value, 4);}\n  \/** Compare column value with integer for less than or equal. \n   *  return  0 if successful, -1 otherwize\n   *\/\n  int le(int ColId, Uint32 value) { return cmp(COND_LE, ColId, &value, 4);}\n  \/** Compare column value with integer for greater than. \n   *  return  0 if successful, -1 otherwize\n   *\/\n  int gt(int ColId, Uint32 value) { return cmp(COND_GT, ColId, &value, 4);} \n  \/** Compare column value with integer for greater than or equal.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int ge(int ColId, Uint32 value) { return cmp(COND_GE, ColId, &value, 4);}\n\n  \/** Compare column value with integer for equal. 64-bit.  \n   *  return  0 if successful, -1 otherwize\n   *\/\n  int eq(int ColId, Uint64 value) { return cmp(COND_EQ, ColId, &value, 8);}\n  \/** Compare column value with integer for not equal. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int ne(int ColId, Uint64 value) { return cmp(COND_NE, ColId, &value, 8);}\n  \/** Compare column value with integer for less than. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int lt(int ColId, Uint64 value) { return cmp(COND_LT, ColId, &value, 8);}  \n  \/** Compare column value with integer for less than or equal. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int le(int ColId, Uint64 value) { return cmp(COND_LE, ColId, &value, 8);}\n  \/** Compare column value with integer for greater than. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int gt(int ColId, Uint64 value) { return cmp(COND_GT, ColId, &value, 8);}\n  \/** Compare column value with integer for greater than or equal. 64-bit.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int ge(int ColId, Uint64 value) { return cmp(COND_GE, ColId, &value, 8);}\n  \/** @} *********************************************************************\/\n\n  \/** Check if column value is NULL *\/\n  int isnull(int ColId);             \n  \/** Check if column value is non-NULL *\/\n  int isnotnull(int ColId);          \n  \n#ifndef DOXYGEN_SHOULD_SKIP_INTERNAL\n  \/**\n   *  Like comparison operator.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int like(int ColId, const char * val, Uint32 len, bool nopad=false);\n  \/**\n   *  Notlike comparison operator.\n   *  return  0 if successful, -1 otherwize\n   *\/\n  int notlike(int ColId, const char * val, Uint32 len, bool nopad=false);\n  \/** @} *********************************************************************\/\n#endif\n\nprivate:\n#ifndef DOXYGEN_SHOULD_SKIP_INTERNAL\n  friend class NdbScanFilterImpl;\n#endif\n  class NdbScanFilterImpl & m_impl;\n  NdbScanFilter& operator=(const NdbScanFilter&); \/\/\/< Defined not implemented\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\r\n#include <cstdlib>\r\n\r\n#include <MultiRegions\/ExpList.h>\r\n\r\nusing namespace Nektar;\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n    Array<OneD,NekDouble>  fce; \r\n    Array<OneD,NekDouble>  xc0,xc1,xc2; \r\n\r\n    if(argc != 2)\r\n    {\r\n        fprintf(stderr,\"Usage: XmlToTecplotWireFrame  meshfile\\n\");\r\n        exit(1);\r\n    }\r\n\r\n    LibUtilities::SessionReaderSharedPtr vSession\r\n            = LibUtilities::SessionReader::CreateInstance(argc, argv);\r\n\r\n    \/\/----------------------------------------------\r\n    \/\/ Read in mesh from input file\r\n    string meshfile(argv[argc-1]);\r\n    SpatialDomains::MeshGraphSharedPtr mesh  = SpatialDomains::MeshGraph::Read(vSession);\r\n    \/\/----------------------------------------------\r\n\r\n    \/\/----------------------------------------------        \r\n    \/\/ Define Expansion \r\n    int expdim   = mesh->GetMeshDimension();\r\n\r\n    switch(expdim)\r\n    {\r\n    case 1:\r\n        ASSERTL0(false,\"3D not set up\");\r\n        break;\r\n    case 2:\r\n        {\r\n            NekDouble x,y,z;\r\n            string   outname(strtok(argv[argc-1],\".\"));\r\n            outname += \".dat\";\r\n            FILE *fp = fopen(outname.c_str(),\"w\");\r\n            \r\n            SpatialDomains::TriGeomMap trigeom = mesh->GetAllTriGeoms();\r\n            SpatialDomains::QuadGeomMap quadgeom = mesh->GetAllQuadGeoms();\r\n\r\n            int nverts = mesh->GetNvertices();\r\n\r\n            fprintf(fp,\"Variables = x, y\\n\");\r\n            fprintf(fp,\"Zone,N=%d, E=%d,DATAPACKING=POINT,ZONETYPE=FEQUADRILATERAL\\n\",nverts,(int)(trigeom.size()+quadgeom.size()));\r\n            \r\n            for(int i = 0; i < nverts; ++i)\r\n            {\r\n                mesh->GetVertex(i)->GetCoords(x,y,z);\r\n                fprintf(fp,\"%lf %lf\\n\",x,y);\r\n            }\r\n            \r\n            std::map<int,SpatialDomains::TriGeomSharedPtr>::iterator triIter;\r\n            for(triIter = trigeom.begin(); triIter != trigeom.end(); ++triIter)\r\n            {\r\n                fprintf(fp,\"%d %d %d %d\\n\",(triIter->second)->GetVid(0)+1,(triIter->second)->GetVid(1)+1,(triIter->second)->GetVid(2)+1,(triIter->second)->GetVid(2)+1);\r\n            }\r\n            \r\n            std::map<int,SpatialDomains::QuadGeomSharedPtr>::iterator quadIter;\r\n            for(quadIter = quadgeom.begin(); quadIter != quadgeom.end(); ++quadIter)\r\n            {\r\n                fprintf(fp,\"%d %d %d %d\\n\",(quadIter->second)->GetVid(0)+1,(quadIter->second)->GetVid(1)+1,(quadIter->second)->GetVid(2)+1,(quadIter->second)->GetVid(3)+1);\r\n            }\r\n        }\r\n        break;\r\n    case 3:\r\n        ASSERTL0(false,\"3D not set up\");\r\n        break;\r\n    default:\r\n        ASSERTL0(false,\"Expansion dimension not recognised\");\r\n        break;\r\n    }\r\n\r\n    \/\/-----------------------------------------------\r\n        \r\n    return 0;\r\n}\r\n\r\n<commit_msg>Added routine to dump 3d fields and check tet rotation<commit_after>#include <cstdio>\r\n#include <cstdlib>\r\n\r\n#include <MultiRegions\/ExpList.h>\r\n\r\nusing namespace Nektar;\r\n\r\nvoid CheckTetRotation(Array<OneD, NekDouble> &xc, Array<OneD, NekDouble> &yc, \r\n                      Array<OneD, NekDouble> &xz, \r\n                      std::map<int,SpatialDomains::TetGeomSharedPtr>::iterator &tetIter,\r\n                      int id);\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n    Array<OneD,NekDouble>  fce; \r\n    Array<OneD,NekDouble>  xc0,xc1,xc2; \r\n\r\n    if(argc != 2)\r\n    {\r\n        fprintf(stderr,\"Usage: XmlToTecplotWireFrame  meshfile\\n\");\r\n        exit(1);\r\n    }\r\n\r\n    LibUtilities::SessionReaderSharedPtr vSession\r\n            = LibUtilities::SessionReader::CreateInstance(argc, argv);\r\n\r\n    \/\/----------------------------------------------\r\n    \/\/ Read in mesh from input file\r\n    string meshfile(argv[argc-1]);\r\n    SpatialDomains::MeshGraphSharedPtr mesh  = SpatialDomains::MeshGraph::Read(vSession);\r\n    \/\/----------------------------------------------\r\n\r\n    \/\/----------------------------------------------        \r\n    \/\/ Define Expansion \r\n    int expdim   = mesh->GetMeshDimension();\r\n\r\n    switch(expdim)\r\n    {\r\n    case 1:\r\n        ASSERTL0(false,\"1D not set up\");\r\n        break;\r\n    case 2:\r\n        {\r\n            NekDouble x,y,z;\r\n            string   outname(strtok(argv[argc-1],\".\"));\r\n            outname += \".dat\";\r\n            FILE *fp = fopen(outname.c_str(),\"w\");\r\n            \r\n            SpatialDomains::TriGeomMap trigeom = mesh->GetAllTriGeoms();\r\n            SpatialDomains::QuadGeomMap quadgeom = mesh->GetAllQuadGeoms();\r\n\r\n            int nverts = mesh->GetNvertices();\r\n\r\n            fprintf(fp,\"Variables = x, y\\n\");\r\n            fprintf(fp,\"Zone,N=%d, E=%d,DATAPACKING=POINT,ZONETYPE=FEQUADRILATERAL\\n\",nverts,(int)(trigeom.size()+quadgeom.size()));\r\n            \r\n            for(int i = 0; i < nverts; ++i)\r\n            {\r\n                mesh->GetVertex(i)->GetCoords(x,y,z);\r\n                fprintf(fp,\"%lf %lf\\n\",x,y);\r\n            }\r\n            \r\n            std::map<int,SpatialDomains::TriGeomSharedPtr>::iterator triIter;\r\n            for(triIter = trigeom.begin(); triIter != trigeom.end(); ++triIter)\r\n            {\r\n                fprintf(fp,\"%d %d %d %d\\n\",(triIter->second)->GetVid(0)+1,(triIter->second)->GetVid(1)+1,(triIter->second)->GetVid(2)+1,(triIter->second)->GetVid(2)+1);\r\n            }\r\n            \r\n            std::map<int,SpatialDomains::QuadGeomSharedPtr>::iterator quadIter;\r\n            for(quadIter = quadgeom.begin(); quadIter != quadgeom.end(); ++quadIter)\r\n            {\r\n                fprintf(fp,\"%d %d %d %d\\n\",(quadIter->second)->GetVid(0)+1,(quadIter->second)->GetVid(1)+1,(quadIter->second)->GetVid(2)+1,(quadIter->second)->GetVid(3)+1);\r\n            }\r\n        }\r\n        break;\r\n    case 3:\r\n        {\r\n            NekDouble x,y,z;\r\n            string   outname(strtok(argv[argc-1],\".\"));\r\n            outname += \".dat\";\r\n            FILE *fp = fopen(outname.c_str(),\"w\");\r\n            \r\n            SpatialDomains::TetGeomMap   tetgeom   = mesh->GetAllTetGeoms();\r\n            SpatialDomains::PyrGeomMap   pyrgeom   = mesh->GetAllPyrGeoms();\r\n            SpatialDomains::PrismGeomMap prismgeom = mesh->GetAllPrismGeoms();\r\n            SpatialDomains::HexGeomMap   hexgeom   = mesh->GetAllHexGeoms();\r\n\r\n            int nverts = mesh->GetNvertices();\r\n\r\n            fprintf(fp,\"Variables = x, y, z\\n\");\r\n            fprintf(fp,\"Zone,N=%d, E=%d,DATAPACKING=POINT,ZONETYPE=FEBRICK\\n\",nverts,(int)(tetgeom.size() + pyrgeom.size() + prismgeom.size() + hexgeom.size()));\r\n            \r\n            Array<OneD, NekDouble> xc(nverts),yc(nverts),zc(nverts);\r\n            \r\n            for(int i = 0; i < nverts; ++i)\r\n            {\r\n                mesh->GetVertex(i)->GetCoords(x,y,z);\r\n                fprintf(fp,\"%lf %lf %lf \\n\",x,y,z);\r\n                xc[i] = x;\r\n                yc[i] = y;\r\n                zc[i] = z;\r\n            }\r\n            \r\n            std::map<int,SpatialDomains::TetGeomSharedPtr>::iterator tetIter;\r\n            int cnt = 0;\r\n            for(tetIter = tetgeom.begin(); tetIter != tetgeom.end(); ++tetIter)\r\n            {\r\n                \/\/ check rotation and dump\r\n                CheckTetRotation(xc,yc,zc,tetIter,cnt++);\r\n\r\n                fprintf(fp,\"%d %d %d %d %d %d %d %d\\n\",(tetIter->second)->GetVid(0)+1,\r\n                        (tetIter->second)->GetVid(1)+1,(tetIter->second)->GetVid(2)+1,\r\n                        (tetIter->second)->GetVid(3)+1,(tetIter->second)->GetVid(3)+1,\r\n                        (tetIter->second)->GetVid(3)+1,(tetIter->second)->GetVid(3)+1,\r\n                        (tetIter->second)->GetVid(3)+1);\r\n            }\r\n\r\n\r\n            std::map<int,SpatialDomains::PyrGeomSharedPtr>::iterator pyrIter;\r\n            for(pyrIter = pyrgeom.begin(); pyrIter != pyrgeom.end(); ++pyrIter)\r\n            {\r\n                fprintf(fp,\"%d %d %d %d %d %d %d %d\\n\",(pyrIter->second)->GetVid(0)+1,\r\n                        (pyrIter->second)->GetVid(1)+1,(pyrIter->second)->GetVid(2)+1,\r\n                        (pyrIter->second)->GetVid(3)+1,(pyrIter->second)->GetVid(4)+1,\r\n                        (pyrIter->second)->GetVid(4)+1,(pyrIter->second)->GetVid(4)+1,\r\n                        (pyrIter->second)->GetVid(5)+1);\r\n            }\r\n\r\n\r\n            std::map<int,SpatialDomains::PrismGeomSharedPtr>::iterator prismIter;\r\n            for(prismIter = prismgeom.begin(); prismIter != prismgeom.end(); ++prismIter)\r\n            {\r\n                fprintf(fp,\"%d %d %d %d %d %d %d %d\\n\",(prismIter->second)->GetVid(0)+1,\r\n                        (prismIter->second)->GetVid(1)+1,(prismIter->second)->GetVid(2)+1,\r\n                        (prismIter->second)->GetVid(3)+1,(prismIter->second)->GetVid(4)+1,\r\n                        (prismIter->second)->GetVid(4)+1,(prismIter->second)->GetVid(5)+1,\r\n                        (prismIter->second)->GetVid(5)+1);\r\n            }\r\n\r\n            std::map<int,SpatialDomains::HexGeomSharedPtr>::iterator hexIter;\r\n            for(hexIter = hexgeom.begin(); hexIter != hexgeom.end(); ++hexIter)\r\n            {\r\n                fprintf(fp,\"%d %d %d %d %d %d %d %d\\n\",(hexIter->second)->GetVid(0)+1,\r\n                        (hexIter->second)->GetVid(1)+1,(hexIter->second)->GetVid(2)+1,\r\n                        (hexIter->second)->GetVid(3)+1,(hexIter->second)->GetVid(4)+1,\r\n                        (hexIter->second)->GetVid(5)+1,(hexIter->second)->GetVid(6)+1,\r\n                        (hexIter->second)->GetVid(7)+1);\r\n            }\r\n\r\n        }            \r\n\r\n        break;\r\n    default:\r\n        ASSERTL0(false,\"Expansion dimension not recognised\");\r\n        break;\r\n    }\r\n\r\n    \/\/-----------------------------------------------\r\n        \r\n    return 0;\r\n}\r\n\r\nclass Ord\r\n{\r\npublic:\r\n    double x;\r\n    double y;\r\n    double z;\r\n};\r\n\r\nvoid CheckTetRotation(Array<OneD, NekDouble> &xc, Array<OneD, NekDouble> &yc, Array<OneD, NekDouble> &zc, std::map<int,SpatialDomains::TetGeomSharedPtr>::iterator &tetIter, int id)\r\n{\r\n    Ord       v[4];\r\n    NekDouble abx,aby,abz; \r\n    \r\n    v[0].x = xc[(tetIter->second)->GetVid(0)];\r\n    v[0].y = yc[(tetIter->second)->GetVid(0)];\r\n    v[0].z = zc[(tetIter->second)->GetVid(0)];\r\n\r\n    v[1].x = xc[(tetIter->second)->GetVid(1)];\r\n    v[1].y = yc[(tetIter->second)->GetVid(1)];\r\n    v[1].z = zc[(tetIter->second)->GetVid(1)];\r\n\r\n    v[2].x = xc[(tetIter->second)->GetVid(2)];\r\n    v[2].y = yc[(tetIter->second)->GetVid(2)];\r\n    v[2].z = zc[(tetIter->second)->GetVid(2)];\r\n\r\n    v[3].x = xc[(tetIter->second)->GetVid(3)];\r\n    v[3].y = yc[(tetIter->second)->GetVid(3)];\r\n    v[3].z = zc[(tetIter->second)->GetVid(3)];\r\n    \r\n    \/\/ cross product of edge 0 and 2\r\n    abx = (v[1].y-v[0].y)*(v[2].z-v[0].z) - \r\n        (v[1].z-v[0].z)*(v[2].y-v[0].y);\r\n    aby = (v[1].z-v[0].z)*(v[2].x-v[0].x) -\r\n        (v[1].x-v[0].x)*(v[2].z-v[0].z);\r\n    abz = (v[1].x-v[0].x)*(v[2].y-v[0].y) -\r\n        (v[1].y-v[0].y)*(v[2].x-v[0].x);\r\n\r\n    \/\/ inner product of cross product with respect to edge 3 should be positive \r\n    if(((v[3].x-v[0].x)*abx + (v[3].y-v[0].y)*aby +\r\n        (v[3].z-v[0].z)*abz)<0.0)\r\n    {\r\n        cerr << \"ERROR: Element \" << id + 1 << \"is NOT counter-clockwise\\n\" << endl;\r\n    }\r\n    \r\n}\r\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 <limits>\n\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/source\/byte_io.h\"\n\nnamespace webrtc {\nnamespace {\n\nclass ByteIoTest : public ::testing::Test {\n protected:\n  ByteIoTest() {}\n  virtual ~ByteIoTest() {}\n\n  enum { kAlignments = sizeof(uint64_t) - 1 };\n\n  \/\/ Method to create a test value that is not the same when byte reversed.\n  template <typename T>\n  T CreateTestValue(bool negative, uint8_t num_bytes) {\n    T val = 0;\n    for (uint8_t i = 0; i != num_bytes; ++i) {\n      val = (val << 8) + (negative ? (0xFF - i) : (i + 1));\n    }\n    if (negative && std::numeric_limits<T>::is_signed) {\n      val |= static_cast<T>(-1) << (8 * num_bytes);\n    }\n    return val;\n  }\n\n  \/\/ Populate byte buffer with value, in big endian format.\n  template <typename T>\n  void PopulateTestData(uint8_t* data, T value, int num_bytes, bool bigendian) {\n    if (bigendian) {\n      for (int i = 0; i < num_bytes; ++i) {\n        data[i] = (value >> ((num_bytes - i - 1) * 8)) & 0xFF;\n      }\n    } else {\n      for (int i = 0; i < num_bytes; ++i) {\n        data[i] = (value >> (i * 8)) & 0xFF;\n      }\n    }\n  }\n\n  \/\/ Test reading big endian numbers.\n  \/\/ Template arguments: Type T, read method RM(buffer), B bytes of data.\n  template <typename T, T (*RM)(const uint8_t*), int B>\n  void TestRead(bool big_endian) {\n    \/\/ Test both for values that are positive and negative (if signed)\n    for (int neg = 0; neg < 2; ++neg) {\n      bool negative = neg > 0;\n\n      \/\/ Write test value to byte buffer, in big endian format.\n      T test_value = CreateTestValue<T>(negative, B);\n      uint8_t bytes[B + kAlignments];\n\n      \/\/ Make one test for each alignment.\n      for (int i = 0; i < kAlignments; ++i) {\n        PopulateTestData(bytes + i, test_value, B, big_endian);\n\n        \/\/ Check that test value is retrieved from buffer when used read method.\n        EXPECT_EQ(test_value, RM(bytes + i));\n      }\n    }\n  }\n\n  \/\/ Test writing big endian numbers.\n  \/\/ Template arguments: Type T, write method WM(buffer, value), B bytes of data\n  template <typename T, void (*WM)(uint8_t*, T), int B>\n  void TestWrite(bool big_endian) {\n    \/\/ Test both for values that are positive and negative (if signed).\n    for (int neg = 0; neg < 2; ++neg) {\n      bool negative = neg > 0;\n\n      \/\/ Write test value to byte buffer, in big endian format.\n      T test_value = CreateTestValue<T>(negative, B);\n      uint8_t expected_bytes[B + kAlignments];\n      uint8_t bytes[B + kAlignments];\n\n      \/\/ Make one test for each alignment.\n      for (int i = 0; i < kAlignments; ++i) {\n        PopulateTestData(expected_bytes + i, test_value, B, big_endian);\n\n        \/\/ Zero initialize buffer and let WM populate it.\n        memset(bytes, 0, B + kAlignments);\n        WM(bytes + i, test_value);\n\n        \/\/ Check that data produced by WM is big endian as expected.\n        for (int j = 0; j < B; ++j) {\n          EXPECT_EQ(expected_bytes[i + j], bytes[i + j]);\n        }\n      }\n    }\n  }\n};\n\nTEST_F(ByteIoTest, Test16UBitBigEndian) {\n  TestRead<uint16_t, ByteReader<uint16_t>::ReadBigEndian,\n      sizeof(uint16_t)>(true);\n  TestWrite<uint16_t, ByteWriter<uint16_t>::WriteBigEndian,\n    sizeof(uint16_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test24UBitBigEndian) {\n  TestRead<uint32_t, ByteReader<uint32_t, 3>::ReadBigEndian, 3>(true);\n  TestWrite<uint32_t, ByteWriter<uint32_t, 3>::WriteBigEndian, 3>(true);\n}\n\nTEST_F(ByteIoTest, Test32UBitBigEndian) {\n  TestRead<uint32_t, ByteReader<uint32_t>::ReadBigEndian,\n      sizeof(uint32_t)>(true);\n  TestWrite<uint32_t, ByteWriter<uint32_t>::WriteBigEndian,\n      sizeof(uint32_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test64UBitBigEndian) {\n  TestRead<uint64_t, ByteReader<uint64_t>::ReadBigEndian,\n      sizeof(uint64_t)>(true);\n  TestWrite<uint64_t, ByteWriter<uint64_t>::WriteBigEndian,\n      sizeof(uint64_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test16SBitBigEndian) {\n  TestRead<int16_t, ByteReader<int16_t>::ReadBigEndian,\n      sizeof(int16_t)>(true);\n  TestWrite<int16_t, ByteWriter<int16_t>::WriteBigEndian,\n      sizeof(int16_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test24SBitBigEndian) {\n  TestRead<int32_t, ByteReader<int32_t, 3>::ReadBigEndian, 3>(true);\n  TestWrite<int32_t, ByteWriter<int32_t, 3>::WriteBigEndian, 3>(true);\n}\n\n\/\/ Disabled for UBSan: https:\/\/bugs.chromium.org\/p\/webrtc\/issues\/detail?id=5490\n#ifdef UNDEFINED_SANITIZER\n#define MAYBE_Test32SBitBigEndian DISABLED_Test32SBitBigEndian\n#else\n#define MAYBE_Test32SBitBigEndian Test32SBitBigEndian\n#endif\nTEST_F(ByteIoTest, MAYBE_Test32SBitBigEndian) {\n  TestRead<int32_t, ByteReader<int32_t>::ReadBigEndian,\n      sizeof(int32_t)>(true);\n  TestWrite<int32_t, ByteWriter<int32_t>::WriteBigEndian,\n      sizeof(int32_t)>(true);\n}\n\n\/\/ Disabled for UBSan: https:\/\/bugs.chromium.org\/p\/webrtc\/issues\/detail?id=5490\n#ifdef UNDEFINED_SANITIZER\n#define MAYBE_Test64SBitBigEndian DISABLED_Test64SBitBigEndian\n#else\n#define MAYBE_Test64SBitBigEndian Test64SBitBigEndian\n#endif\nTEST_F(ByteIoTest, MAYBE_Test64SBitBigEndian) {\n  TestRead<int64_t, ByteReader<int64_t>::ReadBigEndian,\n      sizeof(int64_t)>(true);\n  TestWrite<int64_t, ByteWriter<int64_t>::WriteBigEndian,\n      sizeof(int64_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test16UBitLittleEndian) {\n  TestRead<uint16_t, ByteReader<uint16_t>::ReadLittleEndian,\n      sizeof(uint16_t)>(false);\n  TestWrite<uint16_t, ByteWriter<uint16_t>::WriteLittleEndian,\n      sizeof(uint16_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test24UBitLittleEndian) {\n  TestRead<uint32_t, ByteReader<uint32_t, 3>::ReadLittleEndian, 3>(false);\n  TestWrite<uint32_t, ByteWriter<uint32_t, 3>::WriteLittleEndian, 3>(false);\n}\n\nTEST_F(ByteIoTest, Test32UBitLittleEndian) {\n  TestRead<uint32_t, ByteReader<uint32_t>::ReadLittleEndian,\n      sizeof(uint32_t)>(false);\n  TestWrite<uint32_t, ByteWriter<uint32_t>::WriteLittleEndian,\n      sizeof(uint32_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test64UBitLittleEndian) {\n  TestRead<uint64_t, ByteReader<uint64_t>::ReadLittleEndian,\n      sizeof(uint64_t)>(false);\n  TestWrite<uint64_t, ByteWriter<uint64_t>::WriteLittleEndian,\n      sizeof(uint64_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test16SBitLittleEndian) {\n  TestRead<int16_t, ByteReader<int16_t>::ReadLittleEndian,\n      sizeof(int16_t)>(false);\n  TestWrite<int16_t, ByteWriter<int16_t>::WriteLittleEndian,\n      sizeof(int16_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test24SBitLittleEndian) {\n  TestRead<int32_t, ByteReader<int32_t, 3>::ReadLittleEndian, 3>(false);\n  TestWrite<int32_t, ByteWriter<int32_t, 3>::WriteLittleEndian, 3>(false);\n}\n\n\/\/ Disabled for UBSan: https:\/\/bugs.chromium.org\/p\/webrtc\/issues\/detail?id=5490\n#ifdef UNDEFINED_SANITIZER\n#define MAYBE_Test32SBitLittleEndian DISABLED_Test32SBitLittleEndian\n#else\n#define MAYBE_Test32SBitLittleEndian Test32SBitLittleEndian\n#endif\nTEST_F(ByteIoTest, MAYBE_Test32SBitLittleEndian) {\n  TestRead<int32_t, ByteReader<int32_t>::ReadLittleEndian,\n      sizeof(int32_t)>(false);\n  TestWrite<int32_t, ByteWriter<int32_t>::WriteLittleEndian,\n      sizeof(int32_t)>(false);\n}\n\n\/\/ Disabled for UBSan: https:\/\/bugs.chromium.org\/p\/webrtc\/issues\/detail?id=5490\n#ifdef UNDEFINED_SANITIZER\n#define MAYBE_Test64SBitLittleEndian DISABLED_Test64SBitLittleEndian\n#else\n#define MAYBE_Test64SBitLittleEndian Test64SBitLittleEndian\n#endif\nTEST_F(ByteIoTest, MAYBE_Test64SBitLittleEndian) {\n  TestRead<int64_t, ByteReader<int64_t>::ReadLittleEndian,\n      sizeof(int64_t)>(false);\n  TestWrite<int64_t, ByteWriter<int64_t>::WriteLittleEndian,\n      sizeof(int64_t)>(false);\n}\n\n\/\/ Sets up a fixed byte array and converts N bytes from the array into a\n\/\/ uint64_t. Verifies the value with hard-coded reference.\nTEST(ByteIo, SanityCheckFixedByteArrayUnsignedReadBigEndian) {\n  uint8_t data[8] = {0xFF, 0xEE, 0xDD, 0xCC, 0xBB, 0xAA, 0x99, 0x88};\n  uint64_t value = ByteReader<uint64_t, 2>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEE), value);\n  value = ByteReader<uint64_t, 3>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDD), value);\n  value = ByteReader<uint64_t, 4>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCC), value);\n  value = ByteReader<uint64_t, 5>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCCBB), value);\n  value = ByteReader<uint64_t, 6>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCCBBAA), value);\n  value = ByteReader<uint64_t, 7>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCCBBAA99), value);\n  value = ByteReader<uint64_t, 8>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCCBBAA9988), value);\n}\n\n\/\/ Same as above, but for little-endian reading.\nTEST(ByteIo, SanityCheckFixedByteArrayUnsignedReadLittleEndian) {\n  uint8_t data[8] = {0xFF, 0xEE, 0xDD, 0xCC, 0xBB, 0xAA, 0x99, 0x88};\n  uint64_t value = ByteReader<uint64_t, 2>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xEEFF), value);\n  value = ByteReader<uint64_t, 3>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xDDEEFF), value);\n  value = ByteReader<uint64_t, 4>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xCCDDEEFF), value);\n  value = ByteReader<uint64_t, 5>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xBBCCDDEEFF), value);\n  value = ByteReader<uint64_t, 6>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xAABBCCDDEEFF), value);\n  value = ByteReader<uint64_t, 7>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0x99AABBCCDDEEFF), value);\n  value = ByteReader<uint64_t, 8>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0x8899AABBCCDDEEFF), value);\n}\n}  \/\/ namespace\n}  \/\/ namespace webrtc\n<commit_msg>Fix ubsan warning in byteio_unittest<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 <limits>\n\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/source\/byte_io.h\"\n\nnamespace webrtc {\nnamespace {\n\nclass ByteIoTest : public ::testing::Test {\n protected:\n  ByteIoTest() {}\n  virtual ~ByteIoTest() {}\n\n  enum { kAlignments = sizeof(uint64_t) - 1 };\n\n  \/\/ Method to create a test value that is not the same when byte reversed.\n  template <typename T>\n  T CreateTestValue(bool negative, uint8_t num_bytes) {\n    \/\/ Examples of output:\n    \/\/ T = int32_t, negative = false, num_bytes = 4: 0x00010203\n    \/\/ T = int32_t, negative = true, num_bytes = 4: 0xFFFEFDFC\n    \/\/ T = int32_t, negative = false, num_bytes = 3: 0x000102\n    \/\/ * T = int32_t, negative = true, num_bytes = 3: 0xFFFEFD\n\n    T val = 0;\n    for (uint8_t i = 0; i != num_bytes; ++i) {\n      val = (val << 8) + (negative ? (0xFF - i) : (i + 1));\n    }\n\n    \/\/ This loop will create a sign extend mask if num_bytes if necessary.\n    \/\/ For the last example (marked * above), the number needs to be sign\n    \/\/ extended to be a valid int32_t. The sign extend mask is 0xFF000000.\n    \/\/ Comments for each step with this example below.\n    if (std::numeric_limits<T>::is_signed && negative &&\n        num_bytes < sizeof(T)) {\n      \/\/ Start with mask = 0xFFFFFFFF.\n      T mask = static_cast<T>(-1);\n      \/\/ Create a temporary for the lowest byte (0x000000FF).\n      const T neg_byte = static_cast<T>(0xFF);\n      for (int i = 0; i < num_bytes; ++i) {\n        \/\/ And the inverse of the temporary and the mask:\n        \/\/ 0xFFFFFFFF & 0xFFFFFF00 = 0xFFFFFF00.\n        \/\/ 0xFFFFFF00 & 0xFFFF00FF = 0xFFFF0000.\n        \/\/ 0xFFFF0000 & 0xFF00FFFF = 0xFF000000.\n        mask &= ~(neg_byte << (i * 8));\n      }\n      \/\/ Add the sign extension mask to the actual value.\n      val |= mask;\n    }\n    return val;\n  }\n\n  \/\/ Populate byte buffer with value, in big endian format.\n  template <typename T>\n  void PopulateTestData(uint8_t* data, T value, int num_bytes, bool bigendian) {\n    if (bigendian) {\n      for (int i = 0; i < num_bytes; ++i) {\n        data[i] = (value >> ((num_bytes - i - 1) * 8)) & 0xFF;\n      }\n    } else {\n      for (int i = 0; i < num_bytes; ++i) {\n        data[i] = (value >> (i * 8)) & 0xFF;\n      }\n    }\n  }\n\n  \/\/ Test reading big endian numbers.\n  \/\/ Template arguments: Type T, read method RM(buffer), B bytes of data.\n  template <typename T, T (*RM)(const uint8_t*), int B>\n  void TestRead(bool big_endian) {\n    \/\/ Test both for values that are positive and negative (if signed)\n    for (int neg = 0; neg < 2; ++neg) {\n      bool negative = neg > 0;\n\n      \/\/ Write test value to byte buffer, in big endian format.\n      T test_value = CreateTestValue<T>(negative, B);\n      uint8_t bytes[B + kAlignments];\n\n      \/\/ Make one test for each alignment.\n      for (int i = 0; i < kAlignments; ++i) {\n        PopulateTestData(bytes + i, test_value, B, big_endian);\n\n        \/\/ Check that test value is retrieved from buffer when used read method.\n        EXPECT_EQ(test_value, RM(bytes + i));\n      }\n    }\n  }\n\n  \/\/ Test writing big endian numbers.\n  \/\/ Template arguments: Type T, write method WM(buffer, value), B bytes of data\n  template <typename T, void (*WM)(uint8_t*, T), int B>\n  void TestWrite(bool big_endian) {\n    \/\/ Test both for values that are positive and negative (if signed).\n    for (int neg = 0; neg < 2; ++neg) {\n      bool negative = neg > 0;\n\n      \/\/ Write test value to byte buffer, in big endian format.\n      T test_value = CreateTestValue<T>(negative, B);\n      uint8_t expected_bytes[B + kAlignments];\n      uint8_t bytes[B + kAlignments];\n\n      \/\/ Make one test for each alignment.\n      for (int i = 0; i < kAlignments; ++i) {\n        PopulateTestData(expected_bytes + i, test_value, B, big_endian);\n\n        \/\/ Zero initialize buffer and let WM populate it.\n        memset(bytes, 0, B + kAlignments);\n        WM(bytes + i, test_value);\n\n        \/\/ Check that data produced by WM is big endian as expected.\n        for (int j = 0; j < B; ++j) {\n          EXPECT_EQ(expected_bytes[i + j], bytes[i + j]);\n        }\n      }\n    }\n  }\n};\n\nTEST_F(ByteIoTest, Test16UBitBigEndian) {\n  TestRead<uint16_t, ByteReader<uint16_t>::ReadBigEndian,\n      sizeof(uint16_t)>(true);\n  TestWrite<uint16_t, ByteWriter<uint16_t>::WriteBigEndian,\n    sizeof(uint16_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test24UBitBigEndian) {\n  TestRead<uint32_t, ByteReader<uint32_t, 3>::ReadBigEndian, 3>(true);\n  TestWrite<uint32_t, ByteWriter<uint32_t, 3>::WriteBigEndian, 3>(true);\n}\n\nTEST_F(ByteIoTest, Test32UBitBigEndian) {\n  TestRead<uint32_t, ByteReader<uint32_t>::ReadBigEndian,\n      sizeof(uint32_t)>(true);\n  TestWrite<uint32_t, ByteWriter<uint32_t>::WriteBigEndian,\n      sizeof(uint32_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test64UBitBigEndian) {\n  TestRead<uint64_t, ByteReader<uint64_t>::ReadBigEndian,\n      sizeof(uint64_t)>(true);\n  TestWrite<uint64_t, ByteWriter<uint64_t>::WriteBigEndian,\n      sizeof(uint64_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test16SBitBigEndian) {\n  TestRead<int16_t, ByteReader<int16_t>::ReadBigEndian,\n      sizeof(int16_t)>(true);\n  TestWrite<int16_t, ByteWriter<int16_t>::WriteBigEndian,\n      sizeof(int16_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test24SBitBigEndian) {\n  TestRead<int32_t, ByteReader<int32_t, 3>::ReadBigEndian, 3>(true);\n  TestWrite<int32_t, ByteWriter<int32_t, 3>::WriteBigEndian, 3>(true);\n}\n\nTEST_F(ByteIoTest, Test32SBitBigEndian) {\n  TestRead<int32_t, ByteReader<int32_t>::ReadBigEndian,\n      sizeof(int32_t)>(true);\n  TestWrite<int32_t, ByteWriter<int32_t>::WriteBigEndian,\n      sizeof(int32_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test64SBitBigEndian) {\n  TestRead<int64_t, ByteReader<int64_t>::ReadBigEndian,\n      sizeof(int64_t)>(true);\n  TestWrite<int64_t, ByteWriter<int64_t>::WriteBigEndian,\n      sizeof(int64_t)>(true);\n}\n\nTEST_F(ByteIoTest, Test16UBitLittleEndian) {\n  TestRead<uint16_t, ByteReader<uint16_t>::ReadLittleEndian,\n      sizeof(uint16_t)>(false);\n  TestWrite<uint16_t, ByteWriter<uint16_t>::WriteLittleEndian,\n      sizeof(uint16_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test24UBitLittleEndian) {\n  TestRead<uint32_t, ByteReader<uint32_t, 3>::ReadLittleEndian, 3>(false);\n  TestWrite<uint32_t, ByteWriter<uint32_t, 3>::WriteLittleEndian, 3>(false);\n}\n\nTEST_F(ByteIoTest, Test32UBitLittleEndian) {\n  TestRead<uint32_t, ByteReader<uint32_t>::ReadLittleEndian,\n      sizeof(uint32_t)>(false);\n  TestWrite<uint32_t, ByteWriter<uint32_t>::WriteLittleEndian,\n      sizeof(uint32_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test64UBitLittleEndian) {\n  TestRead<uint64_t, ByteReader<uint64_t>::ReadLittleEndian,\n      sizeof(uint64_t)>(false);\n  TestWrite<uint64_t, ByteWriter<uint64_t>::WriteLittleEndian,\n      sizeof(uint64_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test16SBitLittleEndian) {\n  TestRead<int16_t, ByteReader<int16_t>::ReadLittleEndian,\n      sizeof(int16_t)>(false);\n  TestWrite<int16_t, ByteWriter<int16_t>::WriteLittleEndian,\n      sizeof(int16_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test24SBitLittleEndian) {\n  TestRead<int32_t, ByteReader<int32_t, 3>::ReadLittleEndian, 3>(false);\n  TestWrite<int32_t, ByteWriter<int32_t, 3>::WriteLittleEndian, 3>(false);\n}\n\nTEST_F(ByteIoTest, Test32SBitLittleEndian) {\n  TestRead<int32_t, ByteReader<int32_t>::ReadLittleEndian,\n      sizeof(int32_t)>(false);\n  TestWrite<int32_t, ByteWriter<int32_t>::WriteLittleEndian,\n      sizeof(int32_t)>(false);\n}\n\nTEST_F(ByteIoTest, Test64SBitLittleEndian) {\n  TestRead<int64_t, ByteReader<int64_t>::ReadLittleEndian,\n      sizeof(int64_t)>(false);\n  TestWrite<int64_t, ByteWriter<int64_t>::WriteLittleEndian,\n      sizeof(int64_t)>(false);\n}\n\n\/\/ Sets up a fixed byte array and converts N bytes from the array into a\n\/\/ uint64_t. Verifies the value with hard-coded reference.\nTEST(ByteIo, SanityCheckFixedByteArrayUnsignedReadBigEndian) {\n  uint8_t data[8] = {0xFF, 0xEE, 0xDD, 0xCC, 0xBB, 0xAA, 0x99, 0x88};\n  uint64_t value = ByteReader<uint64_t, 2>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEE), value);\n  value = ByteReader<uint64_t, 3>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDD), value);\n  value = ByteReader<uint64_t, 4>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCC), value);\n  value = ByteReader<uint64_t, 5>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCCBB), value);\n  value = ByteReader<uint64_t, 6>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCCBBAA), value);\n  value = ByteReader<uint64_t, 7>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCCBBAA99), value);\n  value = ByteReader<uint64_t, 8>::ReadBigEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xFFEEDDCCBBAA9988), value);\n}\n\n\/\/ Same as above, but for little-endian reading.\nTEST(ByteIo, SanityCheckFixedByteArrayUnsignedReadLittleEndian) {\n  uint8_t data[8] = {0xFF, 0xEE, 0xDD, 0xCC, 0xBB, 0xAA, 0x99, 0x88};\n  uint64_t value = ByteReader<uint64_t, 2>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xEEFF), value);\n  value = ByteReader<uint64_t, 3>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xDDEEFF), value);\n  value = ByteReader<uint64_t, 4>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xCCDDEEFF), value);\n  value = ByteReader<uint64_t, 5>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xBBCCDDEEFF), value);\n  value = ByteReader<uint64_t, 6>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0xAABBCCDDEEFF), value);\n  value = ByteReader<uint64_t, 7>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0x99AABBCCDDEEFF), value);\n  value = ByteReader<uint64_t, 8>::ReadLittleEndian(data);\n  EXPECT_EQ(static_cast<uint64_t>(0x8899AABBCCDDEEFF), value);\n}\n}  \/\/ namespace\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n%EXPM_SRT_3D Compute a transformation matrix, given the Lie algebra vector\r\n%\r\n%   M = expm_srt_3d(X)\r\n%\r\n% Computes the transformation matrix defined by a Lie vector consisting of\r\n% a rotation, translation and uniform scaling.\r\n%\r\n% The computation is done in closed form, using the formulae given in the\r\n% paper:\r\n% \"Distances and Means of Direct Similarities\"\r\n% M-T Pham et al.\r\n%\r\n%IN:\r\n%   X - DxN array, where each column specifies a different\r\n%       transformation. X(1:3,:) are the rotation components, X(4:6,:) are\r\n%       the translation components and X(7,:) are the scale components. D\r\n%       can be 3 (rotation only, 6 (rotation and translation), or 7\r\n%       (rotation, translation and scale).\r\n%\r\n%OUT:\r\n%   M - 3x(3+D~=3)xN array of transformation matrices.\r\n*\/\r\n\r\n#include <math.h>\r\n#include <stdlib.h>\r\n\r\n\/\/ out - pointer to a column major matrix of size 3x4, or 3x3 if t==NULL.\r\n\/\/ r - pointer to a 3 element vector of rotation components (x, y, z).\r\n\/\/ t - pointer to a 3 element vector of translation components (x, y, z). Zero translation assumed if NULL.\r\n\/\/ s - a uniform scaling component.\r\ntemplate<class REAL> void expm_srt_3d(REAL *out, const REAL *r, const REAL *t=NULL, const REAL s=0)\r\n{\r\n    \/\/ First compute the rotation part\r\n    \/\/ Angle of rotation\r\n    REAL theta2 = r[0] * r[0] + r[1] * r[1] + r[2] * r[2];\r\n    REAL theta = sqrt(theta2);\r\n    REAL cos_theta = cos(theta);\r\n    REAL sin_theta = sin(theta);\r\n    REAL cosf = REAL(0.5);\r\n    REAL sinc = REAL(1.0);\r\n    if (theta2 > REAL(2.23e-16)) {\r\n        cosf = (REAL(1.0) - cos_theta) \/ theta2;\r\n        sinc = sin_theta \/ theta;\r\n    }\r\n    REAL w2[6];\r\n    \/\/ Diagonals\r\n    w2[0] = r[0] * r[0] - theta2;\r\n    w2[1] = r[1] * r[1] - theta2;\r\n    w2[2] = r[2] * r[2] - theta2;\r\n    out[0] = w2[0] * cosf + REAL(1.0);\r\n    out[4] = w2[1] * cosf + REAL(1.0);\r\n    out[8] = w2[2] * cosf + REAL(1.0);\r\n    \/\/ Off diagonals\r\n    w2[3] = r[0] * r[1];\r\n    out[1] = w2[3] * cosf;\r\n    out[3] = out[1] - sinc * r[2];\r\n    out[1] += sinc * r[2];\r\n    w2[4] = r[0] * r[2];\r\n    out[2] = w2[4] * cosf;\r\n    out[6] = out[2] + sinc * r[1];\r\n    out[2] -= sinc * r[1];\r\n    w2[5] = r[1] * r[2];\r\n    out[5] = w2[5] * cosf;\r\n    out[7] = out[5] - sinc * r[0];\r\n    out[5] += sinc * r[0];\r\n    \r\n    \/\/ Multiply by scale\r\n    REAL exp_s = REAL(1.0);\r\n    if (s) {\r\n        exp_s = exp(s);\r\n        for (int a = 0; a < 9; ++a)\r\n            out[a] = exp_s * out[a];\r\n    }\r\n    \r\n    \/\/ Now compute the translation part\r\n    if (t) {\r\n        REAL exp_sa = abs(s) < REAL(1.0e-10) ? REAL(1.0) : (exp_s - REAL(1.0)) \/ s;\r\n        REAL eta_r, eta_i;\r\n        theta2 += REAL(1e-38); \/\/ Avoid divides by 0\r\n        if (s) {\r\n            REAL x = exp_s * cos_theta - REAL(1.0);\r\n            REAL y = exp_s * sin_theta;\r\n            eta_r = exp_sa - (s * x + theta * y) \/ (s * s + theta2);\r\n            eta_i = (s * y - theta * x) \/ (theta * (s * s + theta2) + REAL(1e-38));\r\n        } else {\r\n            eta_r = REAL(1.0) - sinc;\r\n            eta_i = cosf;\r\n        }\r\n        eta_r \/= theta2;\r\n        \r\n        out[9] = t[0] * (eta_r * w2[0] + exp_sa);\r\n        out[9] += t[1] * (eta_r * w2[3] - eta_i * r[2]);\r\n        out[9] += t[2] * (eta_r * w2[4] + eta_i * r[1]);\r\n        out[10] = t[0] * (eta_r * w2[3] + eta_i * r[2]);\r\n        out[10] += t[1] * (eta_r * w2[1] + exp_sa);\r\n        out[10] += t[2] * (eta_r * w2[5] - eta_i * r[0]);\r\n        out[11] = t[0] * (eta_r * w2[4] - eta_i * r[1]);\r\n        out[11] += t[1] * (eta_r * w2[5] + eta_i * r[0]);\r\n        out[11] += t[2] * (eta_r * w2[2] + exp_sa);\r\n    }\r\n}\r\n\r\n#ifdef _MATLAB_\r\n#include <mex.h>\r\n#ifdef _OPENMP\r\n#include <omp.h>\r\n#endif\r\n\r\n#if _MATLAB_ < 805 \/\/ R2015a\r\nextern \"C\" mxArray *mxCreateUninitNumericArray(mwSize ndim, const size_t *dims, mxClassID classid, mxComplexity ComplexFlag);\r\n#endif\r\n\r\nvoid mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[])\r\n{\r\n\t\/\/ Check number of arguments\r\n\tif (nrhs != 1)\r\n\t\tmexErrMsgTxt(\"Unexpected number of input arguments.\");\r\n\tif (nlhs != 1)\r\n\t\tmexErrMsgTxt(\"Unexpected number of output arguments.\");\r\n\r\n\t\/\/ Check argument types are valid\r\n\tif (mxGetClassID(prhs[0]) != mxDOUBLE_CLASS || mxIsComplex(prhs[0]))\r\n\t\tmexErrMsgTxt(\"Input must be a real double matrix\");\r\n    int nparams = mxGetM(prhs[0]);\r\n    if (nparams != 3 && nparams != 6 && nparams != 7)\r\n        mexErrMsgTxt(\"Input must have 3, 6 or 7 rows\");\r\n    \r\n    \/\/ Construct the output array\r\n    int ndims = mxGetNumberOfDimensions(prhs[0]);\r\n\tif (ndims > 19)\r\n\t\tmexErrMsgTxt(\"Input has an unsupported number of dimensions\");\r\n\tsize_t out_dims[20];\r\n\tout_dims[0] = 3;\r\n\tout_dims[1] = 3 + (nparams != 3);\r\n\tconst int *dims = mxGetDimensions(prhs[0]);\r\n\tint nmatrices = 1;\r\n\tfor (int a = 1; a < ndims; ++a) {\r\n\t\tout_dims[a+1] = dims[a];\r\n\t\tnmatrices *= dims[a];\r\n\t}\r\n    plhs[0] = mxCreateUninitNumericArray(ndims+1, out_dims, mxDOUBLE_CLASS, mxREAL);\r\n    double *out = (double *)mxGetData(plhs[0]);\r\n    \r\n    \/\/ Get the data pointers and strides\r\n    double *r = (double *)mxGetData(prhs[0]);\r\n    double *t = NULL;\r\n    int t_stride = 0;\r\n    if (nparams > 3) {\r\n        t = r + 3;\r\n        t_stride = nparams;\r\n    }\r\n    double s_ = 0;\r\n    double *s = &s_;\r\n    int s_stride = 0;\r\n    if (nparams == 7) { \r\n        s = r + 6;\r\n        s_stride = 7;\r\n    }\r\n    int out_stride = 3 * (3 + (nparams != 3));\r\n\t    \r\n\t\/\/ Call the expm function\r\n    int a;\r\n#pragma omp parallel for if (nmatrices > 1000) num_threads(omp_get_num_procs()) default(shared) private(a)\r\n    for (a = 0; a < nmatrices; ++a)\r\n        expm_srt_3d(&out[out_stride*a], &r[nparams*a], &t[t_stride*a], s[s_stride*a]);\r\n\r\n\treturn;\r\n}\r\n#endif<commit_msg>Fix compilation<commit_after>\/*\r\n%EXPM_SRT_3D Compute a transformation matrix, given the Lie algebra vector\r\n%\r\n%   M = expm_srt_3d(X)\r\n%\r\n% Computes the transformation matrix defined by a Lie vector consisting of\r\n% a rotation, translation and uniform scaling.\r\n%\r\n% The computation is done in closed form, using the formulae given in the\r\n% paper:\r\n% \"Distances and Means of Direct Similarities\"\r\n% M-T Pham et al.\r\n%\r\n%IN:\r\n%   X - DxN array, where each column specifies a different\r\n%       transformation. X(1:3,:) are the rotation components, X(4:6,:) are\r\n%       the translation components and X(7,:) are the scale components. D\r\n%       can be 3 (rotation only, 6 (rotation and translation), or 7\r\n%       (rotation, translation and scale).\r\n%\r\n%OUT:\r\n%   M - 3x(3+D~=3)xN array of transformation matrices.\r\n*\/\r\n\r\n#include <cmath>\r\n\r\n\/\/ out - pointer to a column major matrix of size 3x4, or 3x3 if t==NULL.\r\n\/\/ r - pointer to a 3 element vector of rotation components (x, y, z).\r\n\/\/ t - pointer to a 3 element vector of translation components (x, y, z). Zero translation assumed if NULL.\r\n\/\/ s - a uniform scaling component.\r\ntemplate<class REAL> void expm_srt_3d(REAL *out, const REAL *r, const REAL *t=NULL, const REAL s=0)\r\n{\r\n    \/\/ First compute the rotation part\r\n    \/\/ Angle of rotation\r\n    REAL theta2 = r[0] * r[0] + r[1] * r[1] + r[2] * r[2];\r\n    REAL theta = std::sqrt(theta2);\r\n    REAL cos_theta = std::cos(theta);\r\n    REAL sin_theta = std::sin(theta);\r\n    REAL cosf = REAL(0.5);\r\n    REAL sinc = REAL(1.0);\r\n    if (theta2 > REAL(2.23e-16)) {\r\n        cosf = (REAL(1.0) - cos_theta) \/ theta2;\r\n        sinc = sin_theta \/ theta;\r\n    }\r\n    REAL w2[6];\r\n    \/\/ Diagonals\r\n    w2[0] = r[0] * r[0] - theta2;\r\n    w2[1] = r[1] * r[1] - theta2;\r\n    w2[2] = r[2] * r[2] - theta2;\r\n    out[0] = w2[0] * cosf + REAL(1.0);\r\n    out[4] = w2[1] * cosf + REAL(1.0);\r\n    out[8] = w2[2] * cosf + REAL(1.0);\r\n    \/\/ Off diagonals\r\n    w2[3] = r[0] * r[1];\r\n    out[1] = w2[3] * cosf;\r\n    out[3] = out[1] - sinc * r[2];\r\n    out[1] += sinc * r[2];\r\n    w2[4] = r[0] * r[2];\r\n    out[2] = w2[4] * cosf;\r\n    out[6] = out[2] + sinc * r[1];\r\n    out[2] -= sinc * r[1];\r\n    w2[5] = r[1] * r[2];\r\n    out[5] = w2[5] * cosf;\r\n    out[7] = out[5] - sinc * r[0];\r\n    out[5] += sinc * r[0];\r\n    \r\n    \/\/ Multiply by scale\r\n    REAL exp_s = REAL(1.0);\r\n    if (s) {\r\n        exp_s = std::exp(s);\r\n        for (int a = 0; a < 9; ++a)\r\n            out[a] = exp_s * out[a];\r\n    }\r\n    \r\n    \/\/ Now compute the translation part\r\n    if (t) {\r\n        REAL exp_sa = std::abs(s) < REAL(1.0e-10) ? REAL(1.0) : (exp_s - REAL(1.0)) \/ s;\r\n        REAL eta_r, eta_i;\r\n        theta2 += REAL(1e-38); \/\/ Avoid divides by 0\r\n        if (s) {\r\n            REAL x = exp_s * cos_theta - REAL(1.0);\r\n            REAL y = exp_s * sin_theta;\r\n            eta_r = exp_sa - (s * x + theta * y) \/ (s * s + theta2);\r\n            eta_i = (s * y - theta * x) \/ (theta * (s * s + theta2) + REAL(1e-38));\r\n        } else {\r\n            eta_r = REAL(1.0) - sinc;\r\n            eta_i = cosf;\r\n        }\r\n        eta_r \/= theta2;\r\n        \r\n        out[9] = t[0] * (eta_r * w2[0] + exp_sa);\r\n        out[9] += t[1] * (eta_r * w2[3] - eta_i * r[2]);\r\n        out[9] += t[2] * (eta_r * w2[4] + eta_i * r[1]);\r\n        out[10] = t[0] * (eta_r * w2[3] + eta_i * r[2]);\r\n        out[10] += t[1] * (eta_r * w2[1] + exp_sa);\r\n        out[10] += t[2] * (eta_r * w2[5] - eta_i * r[0]);\r\n        out[11] = t[0] * (eta_r * w2[4] - eta_i * r[1]);\r\n        out[11] += t[1] * (eta_r * w2[5] + eta_i * r[0]);\r\n        out[11] += t[2] * (eta_r * w2[2] + exp_sa);\r\n    }\r\n}\r\n\r\n#ifdef _MATLAB_\r\n#include <mex.h>\r\n#ifdef _OPENMP\r\n#include <omp.h>\r\n#endif\r\n\r\n#if _MATLAB_ < 805 \/\/ R2015a\r\nextern \"C\" mxArray *mxCreateUninitNumericArray(mwSize ndim, const size_t *dims, mxClassID classid, mxComplexity ComplexFlag);\r\n#endif\r\n\r\nvoid mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[])\r\n{\r\n\t\/\/ Check number of arguments\r\n\tif (nrhs != 1)\r\n\t\tmexErrMsgTxt(\"Unexpected number of input arguments.\");\r\n\tif (nlhs != 1)\r\n\t\tmexErrMsgTxt(\"Unexpected number of output arguments.\");\r\n\r\n\t\/\/ Check argument types are valid\r\n\tif (mxGetClassID(prhs[0]) != mxDOUBLE_CLASS || mxIsComplex(prhs[0]))\r\n\t\tmexErrMsgTxt(\"Input must be a real double matrix\");\r\n    int nparams = mxGetM(prhs[0]);\r\n    if (nparams != 3 && nparams != 6 && nparams != 7)\r\n        mexErrMsgTxt(\"Input must have 3, 6 or 7 rows\");\r\n    \r\n    \/\/ Construct the output array\r\n    int ndims = mxGetNumberOfDimensions(prhs[0]);\r\n\tif (ndims > 19)\r\n\t\tmexErrMsgTxt(\"Input has an unsupported number of dimensions\");\r\n\tsize_t out_dims[20];\r\n\tout_dims[0] = 3;\r\n\tout_dims[1] = 3 + (nparams != 3);\r\n\tconst int *dims = mxGetDimensions(prhs[0]);\r\n\tint nmatrices = 1;\r\n\tfor (int a = 1; a < ndims; ++a) {\r\n\t\tout_dims[a+1] = dims[a];\r\n\t\tnmatrices *= dims[a];\r\n\t}\r\n    plhs[0] = mxCreateUninitNumericArray(ndims+1, out_dims, mxDOUBLE_CLASS, mxREAL);\r\n    double *out = (double *)mxGetData(plhs[0]);\r\n    \r\n    \/\/ Get the data pointers and strides\r\n    double *r = (double *)mxGetData(prhs[0]);\r\n    double *t = NULL;\r\n    int t_stride = 0;\r\n    if (nparams > 3) {\r\n        t = r + 3;\r\n        t_stride = nparams;\r\n    }\r\n    double s_ = 0;\r\n    double *s = &s_;\r\n    int s_stride = 0;\r\n    if (nparams == 7) { \r\n        s = r + 6;\r\n        s_stride = 7;\r\n    }\r\n    int out_stride = 3 * (3 + (nparams != 3));\r\n\t    \r\n\t\/\/ Call the expm function\r\n    int a;\r\n#pragma omp parallel for if (nmatrices > 1000) num_threads(omp_get_num_procs()) default(shared) private(a)\r\n    for (a = 0; a < nmatrices; ++a)\r\n        expm_srt_3d(&out[out_stride*a], &r[nparams*a], &t[t_stride*a], s[s_stride*a]);\r\n\r\n\treturn;\r\n}\r\n#endif<|endoftext|>"}
{"text":"<commit_before>\n#pragma once\n\n#include <experimental\/optional>\n#include <utility>\n#include <vector>\n\n#include \"base\/array.hpp\"\n#include \"geometry\/affine_map.hpp\"\n#include \"geometry\/grassmann.hpp\"\n#include \"geometry\/point.hpp\"\n#include \"geometry\/rp2_point.hpp\"\n#include \"geometry\/sphere.hpp\"\n\nnamespace principia {\nnamespace geometry {\nnamespace internal_perspective {\n\nusing base::BoundedArray;\n\ntemplate<typename Vector>\nusing Segment = std::pair<Point<Vector>, Point<Vector>>;\n\ntemplate<typename Vector>\nusing Segments = std::vector<Segment<Vector>>;\n\n\/\/ A perspective using the pinhole camera model.  It project a point of\n\/\/ |FromFrame| to an element of ℝP².  |ToFrame| is the frame of the camera.  In\n\/\/ that frame the camera is located at the origin and looking at the positive\n\/\/ z-axis.  The x- and y- axis of the camera correspond to those of ℝP².\ntemplate<typename FromFrame, typename ToFrame, typename Scalar,\n         template<typename, typename> class LinearMap>\nclass Perspective final {\n public:\n  Perspective(\n      AffineMap<ToFrame, FromFrame, Scalar, LinearMap> const& from_camera,\n      Scalar const& focal);\n  Perspective(\n      AffineMap<FromFrame, ToFrame, Scalar, LinearMap> const& to_camera,\n      Scalar const& focal);\n\n  Scalar const& focal() const;\n\n  \/\/ Returns the ℝP² element resulting from the projection of |point|.  This\n  \/\/ is properly defined for all points other than the camera origin.\n  RP2Point<Scalar, ToFrame> operator()(\n      Point<Vector<Scalar, FromFrame>> const& point) const;\n\n  \/\/ Returns the part of |segment| that is behind the focal plane as seen from\n  \/\/ the camera.  Returns nullopt if |segment| is entirely in front of the focal\n  \/\/ plane.\n  std::experimental::optional<Segment<Vector<Scalar, FromFrame>>>\n  SegmentBehindFocalPlane(\n      Segment<Vector<Scalar, FromFrame>> const& segment) const;\n\n  \/\/ Returns true iff the |point| is hidden by the |sphere| in this perspective.\n  bool IsHiddenBySphere(Point<Vector<Scalar, FromFrame>> const& point,\n                        Sphere<Scalar, FromFrame> const& sphere) const;\n\n  \/\/ Returns sin² ɑ where ɑ is the half angle under which the |sphere| is seen.\n  double SphereSin²HalfAngle(Sphere<Scalar, FromFrame> const& sphere) const;\n\n  \/\/ Returns the (sub)segments of |segment| that are visible in this perspective\n  \/\/ after taking into account the hiding by |sphere|.  The returned vector has\n  \/\/ 0, 1, or 2 elements.\n  BoundedArray<Segment<Vector<Scalar, FromFrame>>, 2> VisibleSegments(\n      Segment<Vector<Scalar, FromFrame>> const& segment,\n      Sphere<Scalar, FromFrame> const& sphere) const;\n\n  \/\/ Same as above, but for hiding with multiple spheres.  For N spheres it may\n  \/\/ return N + 1 segments.\n  Segments<Vector<Scalar, FromFrame>> VisibleSegments(\n      Segment<Vector<Scalar, FromFrame>> const& segment,\n      std::vector<Sphere<Scalar, FromFrame>> const& spheres) const;\n\n private:\n  AffineMap<ToFrame, FromFrame, Scalar, LinearMap> const from_camera_;\n  AffineMap<FromFrame, ToFrame, Scalar, LinearMap> const to_camera_;\n  Point<Vector<Scalar, FromFrame>> const camera_;\n  Scalar const focal_;\n};\n\n}  \/\/ namespace internal_perspective\n\nusing internal_perspective::Perspective;\nusing internal_perspective::Segment;\n\n}  \/\/ namespace geometry\n}  \/\/ namespace principia\n\n#include \"geometry\/perspective_body.hpp\"\n<commit_msg>Fix compilation error.<commit_after>\n#pragma once\n\n#include <experimental\/optional>\n#include <utility>\n#include <vector>\n\n#include \"base\/array.hpp\"\n#include \"geometry\/affine_map.hpp\"\n#include \"geometry\/grassmann.hpp\"\n#include \"geometry\/point.hpp\"\n#include \"geometry\/rp2_point.hpp\"\n#include \"geometry\/sphere.hpp\"\n\nnamespace principia {\nnamespace geometry {\nnamespace internal_perspective {\n\nusing base::BoundedArray;\n\ntemplate<typename Vector>\nusing Segment = std::pair<Point<Vector>, Point<Vector>>;\n\ntemplate<typename Vector>\nusing Segments = std::vector<Segment<Vector>>;\n\n\/\/ A perspective using the pinhole camera model.  It project a point of\n\/\/ |FromFrame| to an element of ℝP².  |ToFrame| is the frame of the camera.  In\n\/\/ that frame the camera is located at the origin and looking at the positive\n\/\/ z-axis.  The x- and y- axis of the camera correspond to those of ℝP².\ntemplate<typename FromFrame, typename ToFrame, typename Scalar,\n         template<typename, typename> class LinearMap>\nclass Perspective final {\n public:\n  Perspective(\n      AffineMap<ToFrame, FromFrame, Scalar, LinearMap> const& from_camera,\n      Scalar const& focal);\n  Perspective(\n      AffineMap<FromFrame, ToFrame, Scalar, LinearMap> const& to_camera,\n      Scalar const& focal);\n\n  Scalar const& focal() const;\n\n  \/\/ Returns the ℝP² element resulting from the projection of |point|.  This\n  \/\/ is properly defined for all points other than the camera origin.\n  RP2Point<Scalar, ToFrame> operator()(\n      Point<Vector<Scalar, FromFrame>> const& point) const;\n\n  \/\/ Returns the part of |segment| that is behind the focal plane as seen from\n  \/\/ the camera.  Returns nullopt if |segment| is entirely in front of the focal\n  \/\/ plane.\n  std::experimental::optional<Segment<Vector<Scalar, FromFrame>>>\n  SegmentBehindFocalPlane(\n      Segment<Vector<Scalar, FromFrame>> const& segment) const;\n\n  \/\/ Returns true iff the |point| is hidden by the |sphere| in this perspective.\n  bool IsHiddenBySphere(Point<Vector<Scalar, FromFrame>> const& point,\n                        Sphere<Scalar, FromFrame> const& sphere) const;\n\n  \/\/ Returns sin² ɑ where ɑ is the half angle under which the |sphere| is seen.\n  double SphereSin²HalfAngle(Sphere<Scalar, FromFrame> const& sphere) const;\n\n  \/\/ Returns the (sub)segments of |segment| that are visible in this perspective\n  \/\/ after taking into account the hiding by |sphere|.  The returned vector has\n  \/\/ 0, 1, or 2 elements.\n  BoundedArray<Segment<Vector<Scalar, FromFrame>>, 2> VisibleSegments(\n      Segment<Vector<Scalar, FromFrame>> const& segment,\n      Sphere<Scalar, FromFrame> const& sphere) const;\n\n  \/\/ Same as above, but for hiding with multiple spheres.  For N spheres it may\n  \/\/ return N + 1 segments.\n  Segments<Vector<Scalar, FromFrame>> VisibleSegments(\n      Segment<Vector<Scalar, FromFrame>> const& segment,\n      std::vector<Sphere<Scalar, FromFrame>> const& spheres) const;\n\n private:\n  AffineMap<ToFrame, FromFrame, Scalar, LinearMap> const from_camera_;\n  AffineMap<FromFrame, ToFrame, Scalar, LinearMap> const to_camera_;\n  Point<Vector<Scalar, FromFrame>> const camera_;\n  Scalar const focal_;\n};\n\n}  \/\/ namespace internal_perspective\n\nusing internal_perspective::Perspective;\nusing internal_perspective::Segment;\nusing internal_perspective::Segments;\n\n}  \/\/ namespace geometry\n}  \/\/ namespace principia\n\n#include \"geometry\/perspective_body.hpp\"\n<|endoftext|>"}
{"text":"<commit_before>#include \"numerics\/global_optimization.hpp\"\n\n#include \"geometry\/frame.hpp\"\n#include \"geometry\/grassmann.hpp\"\n#include \"geometry\/named_quantities.hpp\"\n#include \"gtest\/gtest.h\"\n#include \"quantities\/named_quantities.hpp\"\n#include \"quantities\/quantities.hpp\"\n#include \"quantities\/si.hpp\"\n#include \"testing_utilities\/almost_equals.hpp\"\n#include \"testing_utilities\/approximate_quantity.hpp\"\n#include \"testing_utilities\/componentwise.hpp\"\n#include \"testing_utilities\/is_near.hpp\"\n#include \"testing_utilities\/numerics_matchers.hpp\"\n#include \"testing_utilities\/optimization_test_functions.hpp\"\n#include \"testing_utilities\/vanishes_before.hpp\"\n\nnamespace principia {\nnamespace numerics {\n\nusing geometry::Displacement;\nusing geometry::Frame;\nusing geometry::Position;\nusing geometry::Vector;\nusing quantities::Inverse;\nusing quantities::Length;\nusing quantities::Pow;\nusing quantities::si::Metre;\nusing testing_utilities::AbsoluteErrorFrom;\nusing testing_utilities::AlmostEquals;\nusing testing_utilities::Branin;\nusing testing_utilities::Componentwise;\nusing testing_utilities::GoldsteinPrice;\nusing testing_utilities::IsNear;\nusing testing_utilities::RelativeErrorFrom;\nusing testing_utilities::𝛁Branin;\nusing testing_utilities::𝛁GoldsteinPrice;\nusing testing_utilities::operator\"\"_;\nusing ::testing::ElementsAre;\nusing ::testing::UnorderedElementsAre;\n\n\/\/ The test functions in this file are from\n\/\/ https:\/\/www.sfu.ca\/~ssurjano\/optimization.html.\nclass GlobalOptimizationTest : public ::testing::Test {\n protected:\n  using World = Frame<enum class WorldTag>;\n};\n\nTEST_F(GlobalOptimizationTest, Branin) {\n  using Optimizer = MultiLevelSingleLinkage<double, Displacement<World>>;\n  int function_invocations = 0;\n  int gradient_invocations = 0;\n\n  auto branin =\n      [&function_invocations](Displacement<World> const& displacement) {\n    ++function_invocations;\n    auto const& coordinates = displacement.coordinates();\n    \/\/ The extra |x₀| term ensures that we have a unique solution in three\n    \/\/ dimensions.\n    double const x₀ = coordinates[0] \/ Metre;\n    double const x₁ = coordinates[1] \/ Metre;\n    double const x₂ = coordinates[2] \/ Metre;\n    return Pow<2>(x₀) + Branin(x₁, x₂);\n  };\n\n  auto grad_branin = [&gradient_invocations](\n                         Displacement<World> const& displacement) {\n    ++gradient_invocations;\n    auto const& coordinates = displacement.coordinates();\n    double const x₀ = coordinates[0] \/ Metre;\n    double const x₁ = coordinates[1] \/ Metre;\n    double const x₂ = coordinates[2] \/ Metre;\n    double const g₀ = 2 * x₀;\n    auto const [g₁, g₂] = 𝛁Branin(x₁, x₂);\n    return Vector<Inverse<Length>, World>({g₀ \/ Metre, g₁ \/ Metre, g₂ \/ Metre});\n  };\n\n  Optimizer::Box const box = {\n      .centre = Displacement<World>({0 * Metre, 2.5 * Metre, 7.5 * Metre}),\n      .vertices = {\n          Displacement<World>({2 * Metre, 0 * Metre, 0 * Metre}),\n          Displacement<World>({0 * Metre, 7.5 * Metre, 0 * Metre}),\n          Displacement<World>({0 * Metre, 0 * Metre, 7.5 * Metre}),\n      }};\n\n  const auto tolerance = 1e-6 * Metre;\n  Optimizer optimizer(box, branin, grad_branin);\n  auto const minima = optimizer.FindGlobalMinima(\/*points_per_round=*\/10,\n                                                 \/*number_of_rounds=*\/10,\n                                                 tolerance);\n\n  EXPECT_EQ(1434, function_invocations);\n  EXPECT_EQ(598, gradient_invocations);\n\n  \/\/ Note that the fourth minima is outside the |box| passed to the optimizer.\n  EXPECT_THAT(\n      minima,\n      ElementsAre(\n          Componentwise(\n              AbsoluteErrorFrom(0 * Metre, IsNear(1.4e-7_(1) * Metre)),\n              AbsoluteErrorFrom(9.42478 * Metre, IsNear(2.0e-6_(1) * Metre)),\n              RelativeErrorFrom(2.475 * Metre, IsNear(8.0e-9_(1)))),\n          Componentwise(\n              AbsoluteErrorFrom(0 * Metre, IsNear(5.7e-7_(1) * Metre)),\n              AbsoluteErrorFrom(π * Metre, IsNear(4.8e-9_(1) * Metre)),\n              RelativeErrorFrom(2.275 * Metre, IsNear(9.1e-8_(1)))),\n          Componentwise(\n              AbsoluteErrorFrom(0 * Metre, IsNear(5.9e-8_(1) * Metre)),\n              RelativeErrorFrom(-π * Metre, IsNear(3.5e-8_(1))),\n              RelativeErrorFrom(12.275 * Metre, IsNear(6.2e-9_(1)))),\n          Componentwise(\n              AbsoluteErrorFrom(0 * Metre, IsNear(1.9e-8_(1) * Metre)),\n              RelativeErrorFrom(5 * π * Metre, IsNear(7.3e-10_(1))),\n              RelativeErrorFrom(12.875 * Metre, IsNear(1.0e-9_(1))))));\n}\n\nTEST_F(GlobalOptimizationTest, GoldsteinPrice) {\n  using Optimizer = MultiLevelSingleLinkage<double, Displacement<World>>;\n  int function_invocations = 0;\n  int gradient_invocations = 0;\n\n  auto goldstein_price = [&function_invocations](\n                             Displacement<World> const& displacement) {\n    ++function_invocations;\n    auto const& coordinates = displacement.coordinates();\n    \/\/ The extra |x₀| term ensures that we have a unique solution in three\n    \/\/ dimensions.\n    double const x₀ = coordinates[0] \/ Metre;\n    double const x₁ = coordinates[1] \/ Metre;\n    double const x₂ = coordinates[2] \/ Metre;\n    return Pow<2>(x₀) + GoldsteinPrice(x₁, x₂);\n  };\n\n  auto grad_goldstein_price = [&gradient_invocations](\n                                  Displacement<World> const& displacement) {\n    ++gradient_invocations;\n    auto const& coordinates = displacement.coordinates();\n    double const x₀ = coordinates[0] \/ Metre;\n    double const x₁ = coordinates[1] \/ Metre;\n    double const x₂ = coordinates[2] \/ Metre;\n    double const g₀ = 2 * x₀;\n    auto const [g₁, g₂] = 𝛁GoldsteinPrice(x₁, x₂);\n    return Vector<Inverse<Length>, World>({g₀ \/ Metre, g₁ \/ Metre, g₂ \/ Metre});\n  };\n\n  Optimizer::Box const box = {\n      .centre = Displacement<World>(),\n      .vertices = {\n          Displacement<World>({2 * Metre, 0 * Metre, 0 * Metre}),\n          Displacement<World>({0 * Metre, 2 * Metre, 0 * Metre}),\n          Displacement<World>({0 * Metre, 0 * Metre, 2 * Metre}),\n      }};\n\n  const auto tolerance = 1e-6 * Metre;\n  Optimizer optimizer(box, goldstein_price, grad_goldstein_price);\n\n  {\n    auto const minima = optimizer.FindGlobalMinima(\/*points_per_round=*\/10,\n                                                   \/*number_of_rounds=*\/10,\n                                                   tolerance);\n\n    EXPECT_EQ(2740, function_invocations);\n    EXPECT_EQ(1813, gradient_invocations);\n    EXPECT_THAT(\n        minima,\n        UnorderedElementsAre(\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(7.6e-7_(1) * Metre)),\n                AbsoluteErrorFrom(0 * Metre, IsNear(5.3e-8_(1) * Metre)),\n                RelativeErrorFrom(-1 * Metre, IsNear(3.8e-8_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(5.6e-8_(1) * Metre)),\n                RelativeErrorFrom(-0.6 * Metre, IsNear(6.8e-10_(1))),\n                RelativeErrorFrom(-0.4 * Metre, IsNear(1.1e-9_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(5.6e-8_(1) * Metre)),\n                RelativeErrorFrom(1.8 * Metre, IsNear(1.8e-10_(1))),\n                RelativeErrorFrom(0.2 * Metre, IsNear(7.0e-10_(1))))));\n  }\n  {\n    auto const minima =\n        optimizer.FindGlobalMinima(\/*points_per_round=*\/10,\n                                   \/*number_of_rounds=*\/std::nullopt,\n                                   tolerance);\n\n    EXPECT_EQ(3620, function_invocations);\n    EXPECT_EQ(2474, gradient_invocations);\n    EXPECT_THAT(\n        minima,\n        UnorderedElementsAre(\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(1.6e-7_(1) * Metre)),\n                RelativeErrorFrom(-0.6 * Metre, IsNear(1.6e-8_(1))),\n                RelativeErrorFrom(-0.4 * Metre, IsNear(7.0e-8_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(4.0e-7_(1) * Metre)),\n                AbsoluteErrorFrom(0 * Metre, IsNear(1.1e-7_(1) * Metre)),\n                RelativeErrorFrom(-1 * Metre, IsNear(7.0e-8_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(1.3e-7_(1) * Metre)),\n                RelativeErrorFrom(1.2 * Metre, IsNear(6.7e-10_(1))),\n                RelativeErrorFrom(0.8 * Metre, IsNear(9.6e-10_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(3.6e-7_(1) * Metre)),\n                RelativeErrorFrom(1.8 * Metre, IsNear(4.4e-8_(1))),\n                RelativeErrorFrom(0.2 * Metre, IsNear(5.2e-7_(1))))));\n  }\n}\n\n}  \/\/ namespace numerics\n}  \/\/ namespace principia\n<commit_msg>Test Branin with Bayesian termination.<commit_after>#include \"numerics\/global_optimization.hpp\"\n\n#include \"geometry\/frame.hpp\"\n#include \"geometry\/grassmann.hpp\"\n#include \"geometry\/named_quantities.hpp\"\n#include \"gtest\/gtest.h\"\n#include \"quantities\/named_quantities.hpp\"\n#include \"quantities\/quantities.hpp\"\n#include \"quantities\/si.hpp\"\n#include \"testing_utilities\/almost_equals.hpp\"\n#include \"testing_utilities\/approximate_quantity.hpp\"\n#include \"testing_utilities\/componentwise.hpp\"\n#include \"testing_utilities\/is_near.hpp\"\n#include \"testing_utilities\/numerics_matchers.hpp\"\n#include \"testing_utilities\/optimization_test_functions.hpp\"\n#include \"testing_utilities\/vanishes_before.hpp\"\n\nnamespace principia {\nnamespace numerics {\n\nusing geometry::Displacement;\nusing geometry::Frame;\nusing geometry::Position;\nusing geometry::Vector;\nusing quantities::Inverse;\nusing quantities::Length;\nusing quantities::Pow;\nusing quantities::si::Metre;\nusing testing_utilities::AbsoluteErrorFrom;\nusing testing_utilities::AlmostEquals;\nusing testing_utilities::Branin;\nusing testing_utilities::Componentwise;\nusing testing_utilities::GoldsteinPrice;\nusing testing_utilities::IsNear;\nusing testing_utilities::RelativeErrorFrom;\nusing testing_utilities::𝛁Branin;\nusing testing_utilities::𝛁GoldsteinPrice;\nusing testing_utilities::operator\"\"_;\nusing ::testing::ElementsAre;\nusing ::testing::UnorderedElementsAre;\n\n\/\/ The test functions in this file are from\n\/\/ https:\/\/www.sfu.ca\/~ssurjano\/optimization.html.\nclass GlobalOptimizationTest : public ::testing::Test {\n protected:\n  using World = Frame<enum class WorldTag>;\n};\n\nTEST_F(GlobalOptimizationTest, Branin) {\n  using Optimizer = MultiLevelSingleLinkage<double, Displacement<World>>;\n  int function_invocations = 0;\n  int gradient_invocations = 0;\n\n  auto branin =\n      [&function_invocations](Displacement<World> const& displacement) {\n    ++function_invocations;\n    auto const& coordinates = displacement.coordinates();\n    \/\/ The extra |x₀| term ensures that we have a unique solution in three\n    \/\/ dimensions.\n    double const x₀ = coordinates[0] \/ Metre;\n    double const x₁ = coordinates[1] \/ Metre;\n    double const x₂ = coordinates[2] \/ Metre;\n    return Pow<2>(x₀) + Branin(x₁, x₂);\n  };\n\n  auto grad_branin = [&gradient_invocations](\n                         Displacement<World> const& displacement) {\n    ++gradient_invocations;\n    auto const& coordinates = displacement.coordinates();\n    double const x₀ = coordinates[0] \/ Metre;\n    double const x₁ = coordinates[1] \/ Metre;\n    double const x₂ = coordinates[2] \/ Metre;\n    double const g₀ = 2 * x₀;\n    auto const [g₁, g₂] = 𝛁Branin(x₁, x₂);\n    return Vector<Inverse<Length>, World>({g₀ \/ Metre, g₁ \/ Metre, g₂ \/ Metre});\n  };\n\n  Optimizer::Box const box = {\n      .centre = Displacement<World>({0 * Metre, 2.5 * Metre, 7.5 * Metre}),\n      .vertices = {\n          Displacement<World>({2 * Metre, 0 * Metre, 0 * Metre}),\n          Displacement<World>({0 * Metre, 7.5 * Metre, 0 * Metre}),\n          Displacement<World>({0 * Metre, 0 * Metre, 7.5 * Metre}),\n      }};\n\n  const auto tolerance = 1e-6 * Metre;\n  Optimizer optimizer(box, branin, grad_branin);\n  {\n    auto const minima = optimizer.FindGlobalMinima(\/*points_per_round=*\/10,\n                                                   \/*number_of_rounds=*\/10,\n                                                   tolerance);\n\n    EXPECT_EQ(1434, function_invocations);\n    EXPECT_EQ(598, gradient_invocations);\n\n    \/\/ Note that the fourth minima is outside the |box| passed to the optimizer.\n    EXPECT_THAT(\n        minima,\n        UnorderedElementsAre(\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(1.4e-7_(1) * Metre)),\n                AbsoluteErrorFrom(9.42478 * Metre, IsNear(2.0e-6_(1) * Metre)),\n                RelativeErrorFrom(2.475 * Metre, IsNear(8.0e-9_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(5.7e-7_(1) * Metre)),\n                AbsoluteErrorFrom(π * Metre, IsNear(4.8e-9_(1) * Metre)),\n                RelativeErrorFrom(2.275 * Metre, IsNear(9.1e-8_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(5.9e-8_(1) * Metre)),\n                RelativeErrorFrom(-π * Metre, IsNear(3.5e-8_(1))),\n                RelativeErrorFrom(12.275 * Metre, IsNear(6.2e-9_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(1.9e-8_(1) * Metre)),\n                RelativeErrorFrom(5 * π * Metre, IsNear(7.3e-10_(1))),\n                RelativeErrorFrom(12.875 * Metre, IsNear(1.0e-9_(1))))));\n  }\n  function_invocations = 0;\n  gradient_invocations = 0;\n  {\n    auto const minima =\n        optimizer.FindGlobalMinima(\/*points_per_round=*\/10,\n                                   \/*number_of_rounds=*\/std::nullopt,\n                                   tolerance);\n\n    EXPECT_EQ(849, function_invocations);\n    EXPECT_EQ(641, gradient_invocations);\n\n    \/\/ Note that the fourth minima is outside the |box| passed to the optimizer.\n    EXPECT_THAT(\n        minima,\n        ElementsAre(\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(4.3e-8_(1) * Metre)),\n                RelativeErrorFrom(-π * Metre, IsNear(8.5e-9_(1))),\n                RelativeErrorFrom(12.275 * Metre, IsNear(2.1e-9_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(3.9e-8_(1) * Metre)),\n                AbsoluteErrorFrom(π * Metre, IsNear(1.6e-9_(1) * Metre)),\n                RelativeErrorFrom(2.275 * Metre, IsNear(5.6e-9_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(3.3e-8_(1) * Metre)),\n                AbsoluteErrorFrom(9.42478 * Metre, IsNear(2.0e-6_(1) * Metre)),\n                RelativeErrorFrom(2.475 * Metre, IsNear(3.8e-9_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(4.7e-7_(1) * Metre)),\n                RelativeErrorFrom(5 * π * Metre, IsNear(1.3e-8_(1))),\n                RelativeErrorFrom(12.875 * Metre, IsNear(3.3e-8_(1))))));\n  }\n}\n\nTEST_F(GlobalOptimizationTest, GoldsteinPrice) {\n  using Optimizer = MultiLevelSingleLinkage<double, Displacement<World>>;\n  int function_invocations = 0;\n  int gradient_invocations = 0;\n\n  auto goldstein_price = [&function_invocations](\n                             Displacement<World> const& displacement) {\n    ++function_invocations;\n    auto const& coordinates = displacement.coordinates();\n    \/\/ The extra |x₀| term ensures that we have a unique solution in three\n    \/\/ dimensions.\n    double const x₀ = coordinates[0] \/ Metre;\n    double const x₁ = coordinates[1] \/ Metre;\n    double const x₂ = coordinates[2] \/ Metre;\n    return Pow<2>(x₀) + GoldsteinPrice(x₁, x₂);\n  };\n\n  auto grad_goldstein_price = [&gradient_invocations](\n                                  Displacement<World> const& displacement) {\n    ++gradient_invocations;\n    auto const& coordinates = displacement.coordinates();\n    double const x₀ = coordinates[0] \/ Metre;\n    double const x₁ = coordinates[1] \/ Metre;\n    double const x₂ = coordinates[2] \/ Metre;\n    double const g₀ = 2 * x₀;\n    auto const [g₁, g₂] = 𝛁GoldsteinPrice(x₁, x₂);\n    return Vector<Inverse<Length>, World>({g₀ \/ Metre, g₁ \/ Metre, g₂ \/ Metre});\n  };\n\n  Optimizer::Box const box = {\n      .centre = Displacement<World>(),\n      .vertices = {\n          Displacement<World>({2 * Metre, 0 * Metre, 0 * Metre}),\n          Displacement<World>({0 * Metre, 2 * Metre, 0 * Metre}),\n          Displacement<World>({0 * Metre, 0 * Metre, 2 * Metre}),\n      }};\n\n  const auto tolerance = 1e-6 * Metre;\n  Optimizer optimizer(box, goldstein_price, grad_goldstein_price);\n\n  {\n    auto const minima = optimizer.FindGlobalMinima(\/*points_per_round=*\/10,\n                                                   \/*number_of_rounds=*\/10,\n                                                   tolerance);\n\n    EXPECT_EQ(2739, function_invocations);\n    EXPECT_EQ(1812, gradient_invocations);\n    EXPECT_THAT(\n        minima,\n        UnorderedElementsAre(\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(7.6e-7_(1) * Metre)),\n                AbsoluteErrorFrom(0 * Metre, IsNear(5.3e-8_(1) * Metre)),\n                RelativeErrorFrom(-1 * Metre, IsNear(3.8e-8_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(5.6e-8_(1) * Metre)),\n                RelativeErrorFrom(-0.6 * Metre, IsNear(6.8e-10_(1))),\n                RelativeErrorFrom(-0.4 * Metre, IsNear(1.1e-9_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(5.6e-8_(1) * Metre)),\n                RelativeErrorFrom(1.8 * Metre, IsNear(1.8e-10_(1))),\n                RelativeErrorFrom(0.2 * Metre, IsNear(7.0e-10_(1))))));\n  }\n  function_invocations = 0;\n  gradient_invocations = 0;\n  {\n    auto const minima =\n        optimizer.FindGlobalMinima(\/*points_per_round=*\/10,\n                                   \/*number_of_rounds=*\/std::nullopt,\n                                   tolerance);\n\n    EXPECT_EQ(880, function_invocations);\n    EXPECT_EQ(661, gradient_invocations);\n    EXPECT_THAT(\n        minima,\n        UnorderedElementsAre(\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(1.6e-7_(1) * Metre)),\n                RelativeErrorFrom(-0.6 * Metre, IsNear(1.6e-8_(1))),\n                RelativeErrorFrom(-0.4 * Metre, IsNear(7.0e-8_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(4.0e-7_(1) * Metre)),\n                AbsoluteErrorFrom(0 * Metre, IsNear(1.1e-7_(1) * Metre)),\n                RelativeErrorFrom(-1 * Metre, IsNear(7.0e-8_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(1.3e-7_(1) * Metre)),\n                RelativeErrorFrom(1.2 * Metre, IsNear(6.7e-10_(1))),\n                RelativeErrorFrom(0.8 * Metre, IsNear(9.6e-10_(1)))),\n            Componentwise(\n                AbsoluteErrorFrom(0 * Metre, IsNear(3.6e-7_(1) * Metre)),\n                RelativeErrorFrom(1.8 * Metre, IsNear(4.4e-8_(1))),\n                RelativeErrorFrom(0.2 * Metre, IsNear(5.2e-7_(1))))));\n  }\n}\n\n}  \/\/ namespace numerics\n}  \/\/ namespace principia\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 * Cylinder-Plane collider by Bram Stolk\n *\n * This testing basically comes down to testing the intersection\n * of the cylinder caps (discs) with the plane.\n * As a special case, we should consider co-planar discs and plane,\n * In which case we simply test for intersection between cyl axis\n * and plane.\n *\/\n\n#define PRTVEC3(A) \\\n  fprintf(stderr, #A \"%6.3f %6.3f %6.3f\\n\", A[0],A[1],A[2]);\n\n#include <ode\/collision.h>\n#include <ode\/matrix.h>\n#include <ode\/rotation.h>\n#include <ode\/odemath.h>\n#include <ode\/objects.h>\n\n#include \"collision_util.h\"\t\/\/ for dCollideSpheres\n#include \"collision_kernel.h\"\t\/\/ for dxGeom\n\n\n\n\/\/ Find the line of intersection between two planes.\n\/\/ Returns false if planes are parallel\nstatic bool isect_plane_plane\n(\n  const dVector3 &pos0,\n  const dVector3 &nrm0,\n  const dVector3 &pos1,\n  const dVector3 &nrm1,\n  dVector3 &org,\n  dVector3 &dir\n)\n{\n  dReal norms_dot = dDOT(nrm0,nrm1);\n  if (norms_dot >= (1.0-dEpsilon))\n    return false; \/\/ planes are parallel\n  dReal inv_det = dReal(1.0) \/ (dReal(1.0) - norms_dot*norms_dot);\n\n  dReal planeconstant0 = dDOT(nrm0, pos0);\n  dReal planeconstant1 = dDOT(nrm1, pos1);\n  dReal c0 = (planeconstant0 - norms_dot*planeconstant1) * inv_det;\n  dReal c1 = (planeconstant1 - norms_dot*planeconstant0) * inv_det;\n\n  org[0] =  c0 * nrm0[0] + c1 * nrm1[0];\n  org[1] =  c0 * nrm0[1] + c1 * nrm1[1];\n  org[2] =  c0 * nrm0[2] + c1 * nrm1[2];\n\n  dCROSS(dir, =, nrm0, nrm1);\n  dNormalize3(dir);\n\/\/  PRTVEC3(org);\n\/\/  PRTVEC3(dir);\n  return true;\n}\n\n\n\/\/ Finds a point on the line of intersection between a plane and a disc.\n\/\/ Direction of intersection (doi) points from disc center to this point.\n\/\/ Intersection depth is the distance of the point to the edge of the disc.\n\/\/ We could re-use this func when writing a cyl-cyl collider, probably.\nstatic bool isect_disc_plane\n(\n  const dVector3 &discpos,\n  const dVector3 &discnorm,\n  const dVector3 &planepos,\n  const dVector3 &planenorm,\n  dReal rad,\n  dVector3 &poi,\t\t\/\/ point of intersection\n  dVector3 &doi,\t\t\/\/ direction of intersection\n  dReal &intersectiondepth\n)\n{\n  dVector3 org, dir;\n  bool planes_do_intersect = isect_plane_plane(discpos,discnorm,planepos,planenorm,org,dir);\n  if (!planes_do_intersect)\n    return false;\n\n  dVector3 tmp;\n\n  \/\/ Determine the closest point on the intersection line to the position of disc\n  dVector3Subtract(discpos, org, tmp);\n  dReal t0 = dDOT(dir, tmp) \/ dDOT(dir,dir);\n\n  poi[0] = org[0] + t0 * dir[0];\n  poi[1] = org[1] + t0 * dir[1];\n  poi[2] = org[2] + t0 * dir[2];\n\n  dVector3Subtract(poi, discpos, doi);\n  dReal dist = dVector3Length(doi);\n\n  if (dist >= rad)\n    return false;\n\n  intersectiondepth = rad - dist;\n  dNormalize3(doi);\n\n\/\/  fprintf(stderr,\"disc intersects plane with depth %f\\n\", intersectiondepth);\n  return true;\n}\n \n\n\/\/ Test code\nstatic bool test_disc_isect()\n{\n  dVector3 discpos={1,0,3};\n  dVector3 discnorm={0,1,0};\n  dVector3 planepos={5,10,0};\n  dVector3 planenorm={0,0,1};\n  dReal    radius=4.0;\n\n  dVector3 poi, doi;\n  dReal depth;\n\n  isect_disc_plane(discpos, discnorm, planepos, planenorm, radius, poi, doi, depth);\n}\n\/\/static bool dummy=test_disc_isect();\n\n\n\/\/ Finds out which global axis, x y or z, is the most perpendicular one to \n\/\/ a given vector.\nstatic int minor_axis(const dVector3 &v, dVector3 &axis)\n{\n  dVector3 x={1,0,0};\n  dVector3 y={0,1,0};\n  dVector3 z={0,0,1};\n  float dotx = (float)dFabs(dDOT(v,x));\n  float doty = (float)dFabs(dDOT(v,y));\n  float dotz = (float)dFabs(dDOT(v,z));\n  if (dotx <= doty && dotx <= dotz) \n  {\n    dVector3Copy(x, axis);\n    return 0;\n  }\n  if (doty <= dotx && doty <= dotz)\n  {\n    dVector3Copy(y, axis);\n    return 1;\n  }\n  dVector3Copy(z, axis);\n  return 2;\n}\n\n\nint dCollideCylinderPlane(dxGeom *cylgeom, dxGeom *planegeom, int flags, dContactGeom *contact, int skip)\n{\n  dIASSERT (skip >= (int)sizeof(dContactGeom));\n  dIASSERT ((flags & 0xffff) >= 1);\n\n  int nContacts=0;\n\n  \/\/ Get the properties of the cylinder (len+radius)\n  dReal radius, length;\n  dGeomCylinderGetParams(cylgeom, &radius, &length);\n  dVector3 &cylpos = cylgeom->final_posr->pos;\n  \/\/ Get the properties of the plane\n  dVector4 planevec;\n  dGeomPlaneGetParams(planegeom, planevec);\n  dVector3 planenorm = {planevec[0],planevec[1],planevec[2]};\n  dVector3 planepos = {planevec[0],planevec[1],planevec[2]};\n  dVector3Scale(planepos, planevec[3]);\n\n  dVector3 axis = \n  {\n    cylgeom->final_posr->R[2],\n    cylgeom->final_posr->R[6],\n    cylgeom->final_posr->R[10]\n  };\n  dReal axislen = dVector3Length(axis);\n  dIASSERT(axislen>=0.9999);\n  dIASSERT(axislen<=1.0001);\n\n  dReal hl = length\/dReal(2.0);\n  dVector3 disc_top_pos = { cylpos[0]+axis[0]*hl, cylpos[1]+axis[1]*hl, cylpos[2]+axis[2]*hl };\n  dVector3 disc_bot_pos = { cylpos[0]-axis[0]*hl, cylpos[1]-axis[1]*hl, cylpos[2]-axis[2]*hl };\n  dVector3 disc_top_nrm = {  axis[0],  axis[1],  axis[2] };\n  dVector3 disc_bot_nrm = { -axis[0], -axis[1], -axis[2] };\n\n  \/\/ Discs and plane are parallel?\n  \/\/ If so, the cyl may be resting on the plane, with one of its discs\n  dReal norms_dot = dFabs(dDOT(planenorm,axis));\n  bool coplanar = (norms_dot >= 0.999);\n  if (coplanar)\n  {\n    dReal dist_top = dPointPlaneDistance(disc_top_pos, planevec);\n    if (dist_top <= 0)\n    { \n      dVector3 x;\n      minor_axis(axis, x);\n      dVector3 y;\n      dVector3Cross(axis, x, y);\n      dVector3 p;\n      dVector3Scale(x, radius); dVector3Scale(y, radius);\n      dContactGeom *Contact;\n\n      \/\/ Contact 1\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_top_pos, p);\n      dVector3Add(p, x, Contact->pos);\n      Contact->g1 = planegeom;\n      Contact->g2 = cylgeom;\n      Contact->depth = dFabs(dist_top);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 2\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_top_pos, p);\n      dVector3Add(p, y, Contact->pos);\n      Contact->g1 = planegeom;\n      Contact->g2 = cylgeom;\n      Contact->depth = dFabs(dist_top);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 3\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_top_pos, p);\n      dVector3Subtract(p, x, Contact->pos);\n      Contact->g1 = planegeom;\n      Contact->g2 = cylgeom;\n      Contact->depth = dFabs(dist_top);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 4\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_top_pos, p);\n      dVector3Subtract(p, y, Contact->pos);\n      Contact->g1 = planegeom;\n      Contact->g2 = cylgeom;\n      Contact->depth = dFabs(dist_top);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n      return nContacts;\n    }\n    dReal dist_bot = dPointPlaneDistance(disc_bot_pos, planevec);\n    if (dist_bot <= 0)\n    {\n      dVector3 x;\n      minor_axis(axis, x);\n      dVector3 y;\n      dVector3Cross(axis, x, y);\n      dVector3 p;\n      dVector3Scale(x, radius); dVector3Scale(y, radius);\n      dContactGeom *Contact;\n\n      \/\/ Contact 1\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_bot_pos, p);\n      dVector3Add(p, x, Contact->pos);\n      Contact->g1 = cylgeom;\n      Contact->g2 = planegeom;\n      Contact->depth = dFabs(dist_bot);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 2\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_bot_pos, p);\n      dVector3Add(p, y, Contact->pos);\n      Contact->g1 = cylgeom;\n      Contact->g2 = planegeom;\n      Contact->depth = dFabs(dist_bot);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 3\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_bot_pos, p);\n      dVector3Subtract(p, x, Contact->pos);\n      Contact->g1 = cylgeom;\n      Contact->g2 = planegeom;\n      Contact->depth = dFabs(dist_bot);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 4\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_bot_pos, p);\n      dVector3Subtract(p, y, Contact->pos);\n      Contact->g1 = cylgeom;\n      Contact->g2 = planegeom;\n      Contact->depth = dFabs(dist_bot);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n      return nContacts;\n    }\n    return 0;\n  }\n\n  \/\/ Test the discs!\n\n  dVector3 poi_top, doi_top;\n  dVector3 poi_bot, doi_bot;\n  dReal depth_top, depth_bot;\n\n  bool top_disc_does_intersect = isect_disc_plane(disc_top_pos, disc_top_nrm, planepos, planenorm, radius,  poi_top, doi_top, depth_top);\n  bool bot_disc_does_intersect = isect_disc_plane(disc_bot_pos, disc_bot_nrm, planepos, planenorm, radius,  poi_bot, doi_bot, depth_bot);\n\n  if (top_disc_does_intersect)\n  {\n    dContactGeom *Contact = SAFECONTACT(flags, contact, nContacts, skip);\n    dVector3 tmp;\n    dVector3Copy(doi_top, tmp);\n    dVector3Scale(tmp, radius);\n    dVector3Add(disc_top_pos, tmp, Contact->pos);\n    \/\/ Note: ODE convention is: normal points *into* g1\n    Contact->g1 = cylgeom;\n    Contact->g2 = planegeom;\n    dVector3Copy(planenorm, Contact->normal);\n    dReal d = depth_top * dDOT(planenorm, doi_top);\n    Contact->depth = dFabs(d);\n    nContacts++;\n  }\n\n  if (bot_disc_does_intersect)\n  {\n    dContactGeom *Contact = SAFECONTACT(flags, contact, nContacts, skip);\n    dVector3 tmp;\n    dVector3Copy(doi_bot, tmp);\n    dVector3Scale(tmp, radius);\n    dVector3Add(disc_bot_pos, tmp, Contact->pos);\n    \/\/ Note: ODE convention is: normal points *into* g1\n    Contact->g1 = cylgeom;\n    Contact->g2 = planegeom;\n    dVector3Copy(planenorm, Contact->normal);\n    dReal d = depth_bot * dDOT(planenorm, doi_bot);\n    Contact->depth = dFabs(d);\n    nContacts++;\n  }\n\n  return nContacts;\n}\n\n\n<commit_msg>Added missing return<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 * Cylinder-Plane collider by Bram Stolk\n *\n * This testing basically comes down to testing the intersection\n * of the cylinder caps (discs) with the plane.\n * As a special case, we should consider co-planar discs and plane,\n * In which case we simply test for intersection between cyl axis\n * and plane.\n *\/\n\n#define PRTVEC3(A) \\\n  fprintf(stderr, #A \"%6.3f %6.3f %6.3f\\n\", A[0],A[1],A[2]);\n\n#include <ode\/collision.h>\n#include <ode\/matrix.h>\n#include <ode\/rotation.h>\n#include <ode\/odemath.h>\n#include <ode\/objects.h>\n\n#include \"collision_util.h\"\t\/\/ for dCollideSpheres\n#include \"collision_kernel.h\"\t\/\/ for dxGeom\n\n\n\n\/\/ Find the line of intersection between two planes.\n\/\/ Returns false if planes are parallel\nstatic bool isect_plane_plane\n(\n  const dVector3 &pos0,\n  const dVector3 &nrm0,\n  const dVector3 &pos1,\n  const dVector3 &nrm1,\n  dVector3 &org,\n  dVector3 &dir\n)\n{\n  dReal norms_dot = dDOT(nrm0,nrm1);\n  if (norms_dot >= (1.0-dEpsilon))\n    return false; \/\/ planes are parallel\n  dReal inv_det = dReal(1.0) \/ (dReal(1.0) - norms_dot*norms_dot);\n\n  dReal planeconstant0 = dDOT(nrm0, pos0);\n  dReal planeconstant1 = dDOT(nrm1, pos1);\n  dReal c0 = (planeconstant0 - norms_dot*planeconstant1) * inv_det;\n  dReal c1 = (planeconstant1 - norms_dot*planeconstant0) * inv_det;\n\n  org[0] =  c0 * nrm0[0] + c1 * nrm1[0];\n  org[1] =  c0 * nrm0[1] + c1 * nrm1[1];\n  org[2] =  c0 * nrm0[2] + c1 * nrm1[2];\n\n  dCROSS(dir, =, nrm0, nrm1);\n  dNormalize3(dir);\n\/\/  PRTVEC3(org);\n\/\/  PRTVEC3(dir);\n  return true;\n}\n\n\n\/\/ Finds a point on the line of intersection between a plane and a disc.\n\/\/ Direction of intersection (doi) points from disc center to this point.\n\/\/ Intersection depth is the distance of the point to the edge of the disc.\n\/\/ We could re-use this func when writing a cyl-cyl collider, probably.\nstatic bool isect_disc_plane\n(\n  const dVector3 &discpos,\n  const dVector3 &discnorm,\n  const dVector3 &planepos,\n  const dVector3 &planenorm,\n  dReal rad,\n  dVector3 &poi,\t\t\/\/ point of intersection\n  dVector3 &doi,\t\t\/\/ direction of intersection\n  dReal &intersectiondepth\n)\n{\n  dVector3 org, dir;\n  bool planes_do_intersect = isect_plane_plane(discpos,discnorm,planepos,planenorm,org,dir);\n  if (!planes_do_intersect)\n    return false;\n\n  dVector3 tmp;\n\n  \/\/ Determine the closest point on the intersection line to the position of disc\n  dVector3Subtract(discpos, org, tmp);\n  dReal t0 = dDOT(dir, tmp) \/ dDOT(dir,dir);\n\n  poi[0] = org[0] + t0 * dir[0];\n  poi[1] = org[1] + t0 * dir[1];\n  poi[2] = org[2] + t0 * dir[2];\n\n  dVector3Subtract(poi, discpos, doi);\n  dReal dist = dVector3Length(doi);\n\n  if (dist >= rad)\n    return false;\n\n  intersectiondepth = rad - dist;\n  dNormalize3(doi);\n\n\/\/  fprintf(stderr,\"disc intersects plane with depth %f\\n\", intersectiondepth);\n  return true;\n}\n \n\n\/\/ Test code\nstatic bool test_disc_isect()\n{\n  dVector3 discpos={1,0,3};\n  dVector3 discnorm={0,1,0};\n  dVector3 planepos={5,10,0};\n  dVector3 planenorm={0,0,1};\n  dReal    radius=4.0;\n\n  dVector3 poi, doi;\n  dReal depth;\n\n  return isect_disc_plane(discpos, discnorm, planepos, planenorm, radius, poi, doi, depth);\n}\n\/\/static bool dummy=test_disc_isect();\n\n\n\/\/ Finds out which global axis, x y or z, is the most perpendicular one to \n\/\/ a given vector.\nstatic int minor_axis(const dVector3 &v, dVector3 &axis)\n{\n  dVector3 x={1,0,0};\n  dVector3 y={0,1,0};\n  dVector3 z={0,0,1};\n  float dotx = (float)dFabs(dDOT(v,x));\n  float doty = (float)dFabs(dDOT(v,y));\n  float dotz = (float)dFabs(dDOT(v,z));\n  if (dotx <= doty && dotx <= dotz) \n  {\n    dVector3Copy(x, axis);\n    return 0;\n  }\n  if (doty <= dotx && doty <= dotz)\n  {\n    dVector3Copy(y, axis);\n    return 1;\n  }\n  dVector3Copy(z, axis);\n  return 2;\n}\n\n\nint dCollideCylinderPlane(dxGeom *cylgeom, dxGeom *planegeom, int flags, dContactGeom *contact, int skip)\n{\n  dIASSERT (skip >= (int)sizeof(dContactGeom));\n  dIASSERT ((flags & 0xffff) >= 1);\n\n  int nContacts=0;\n\n  \/\/ Get the properties of the cylinder (len+radius)\n  dReal radius, length;\n  dGeomCylinderGetParams(cylgeom, &radius, &length);\n  dVector3 &cylpos = cylgeom->final_posr->pos;\n  \/\/ Get the properties of the plane\n  dVector4 planevec;\n  dGeomPlaneGetParams(planegeom, planevec);\n  dVector3 planenorm = {planevec[0],planevec[1],planevec[2]};\n  dVector3 planepos = {planevec[0],planevec[1],planevec[2]};\n  dVector3Scale(planepos, planevec[3]);\n\n  dVector3 axis = \n  {\n    cylgeom->final_posr->R[2],\n    cylgeom->final_posr->R[6],\n    cylgeom->final_posr->R[10]\n  };\n  dReal axislen = dVector3Length(axis);\n  dIASSERT(axislen>=0.9999);\n  dIASSERT(axislen<=1.0001);\n\n  dReal hl = length\/dReal(2.0);\n  dVector3 disc_top_pos = { cylpos[0]+axis[0]*hl, cylpos[1]+axis[1]*hl, cylpos[2]+axis[2]*hl };\n  dVector3 disc_bot_pos = { cylpos[0]-axis[0]*hl, cylpos[1]-axis[1]*hl, cylpos[2]-axis[2]*hl };\n  dVector3 disc_top_nrm = {  axis[0],  axis[1],  axis[2] };\n  dVector3 disc_bot_nrm = { -axis[0], -axis[1], -axis[2] };\n\n  \/\/ Discs and plane are parallel?\n  \/\/ If so, the cyl may be resting on the plane, with one of its discs\n  dReal norms_dot = dFabs(dDOT(planenorm,axis));\n  bool coplanar = (norms_dot >= 0.999);\n  if (coplanar)\n  {\n    dReal dist_top = dPointPlaneDistance(disc_top_pos, planevec);\n    if (dist_top <= 0)\n    { \n      dVector3 x;\n      minor_axis(axis, x);\n      dVector3 y;\n      dVector3Cross(axis, x, y);\n      dVector3 p;\n      dVector3Scale(x, radius); dVector3Scale(y, radius);\n      dContactGeom *Contact;\n\n      \/\/ Contact 1\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_top_pos, p);\n      dVector3Add(p, x, Contact->pos);\n      Contact->g1 = planegeom;\n      Contact->g2 = cylgeom;\n      Contact->depth = dFabs(dist_top);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 2\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_top_pos, p);\n      dVector3Add(p, y, Contact->pos);\n      Contact->g1 = planegeom;\n      Contact->g2 = cylgeom;\n      Contact->depth = dFabs(dist_top);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 3\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_top_pos, p);\n      dVector3Subtract(p, x, Contact->pos);\n      Contact->g1 = planegeom;\n      Contact->g2 = cylgeom;\n      Contact->depth = dFabs(dist_top);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 4\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_top_pos, p);\n      dVector3Subtract(p, y, Contact->pos);\n      Contact->g1 = planegeom;\n      Contact->g2 = cylgeom;\n      Contact->depth = dFabs(dist_top);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n      return nContacts;\n    }\n    dReal dist_bot = dPointPlaneDistance(disc_bot_pos, planevec);\n    if (dist_bot <= 0)\n    {\n      dVector3 x;\n      minor_axis(axis, x);\n      dVector3 y;\n      dVector3Cross(axis, x, y);\n      dVector3 p;\n      dVector3Scale(x, radius); dVector3Scale(y, radius);\n      dContactGeom *Contact;\n\n      \/\/ Contact 1\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_bot_pos, p);\n      dVector3Add(p, x, Contact->pos);\n      Contact->g1 = cylgeom;\n      Contact->g2 = planegeom;\n      Contact->depth = dFabs(dist_bot);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 2\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_bot_pos, p);\n      dVector3Add(p, y, Contact->pos);\n      Contact->g1 = cylgeom;\n      Contact->g2 = planegeom;\n      Contact->depth = dFabs(dist_bot);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 3\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_bot_pos, p);\n      dVector3Subtract(p, x, Contact->pos);\n      Contact->g1 = cylgeom;\n      Contact->g2 = planegeom;\n      Contact->depth = dFabs(dist_bot);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n\n      \/\/ Contact 4\n      Contact = SAFECONTACT(flags, contact, nContacts, skip);\n      dVector3Copy(disc_bot_pos, p);\n      dVector3Subtract(p, y, Contact->pos);\n      Contact->g1 = cylgeom;\n      Contact->g2 = planegeom;\n      Contact->depth = dFabs(dist_bot);\n      dVector3Copy(planenorm, Contact->normal);\n      nContacts++;\n      return nContacts;\n    }\n    return 0;\n  }\n\n  \/\/ Test the discs!\n\n  dVector3 poi_top, doi_top;\n  dVector3 poi_bot, doi_bot;\n  dReal depth_top, depth_bot;\n\n  bool top_disc_does_intersect = isect_disc_plane(disc_top_pos, disc_top_nrm, planepos, planenorm, radius,  poi_top, doi_top, depth_top);\n  bool bot_disc_does_intersect = isect_disc_plane(disc_bot_pos, disc_bot_nrm, planepos, planenorm, radius,  poi_bot, doi_bot, depth_bot);\n\n  if (top_disc_does_intersect)\n  {\n    dContactGeom *Contact = SAFECONTACT(flags, contact, nContacts, skip);\n    dVector3 tmp;\n    dVector3Copy(doi_top, tmp);\n    dVector3Scale(tmp, radius);\n    dVector3Add(disc_top_pos, tmp, Contact->pos);\n    \/\/ Note: ODE convention is: normal points *into* g1\n    Contact->g1 = cylgeom;\n    Contact->g2 = planegeom;\n    dVector3Copy(planenorm, Contact->normal);\n    dReal d = depth_top * dDOT(planenorm, doi_top);\n    Contact->depth = dFabs(d);\n    nContacts++;\n  }\n\n  if (bot_disc_does_intersect)\n  {\n    dContactGeom *Contact = SAFECONTACT(flags, contact, nContacts, skip);\n    dVector3 tmp;\n    dVector3Copy(doi_bot, tmp);\n    dVector3Scale(tmp, radius);\n    dVector3Add(disc_bot_pos, tmp, Contact->pos);\n    \/\/ Note: ODE convention is: normal points *into* g1\n    Contact->g1 = cylgeom;\n    Contact->g2 = planegeom;\n    dVector3Copy(planenorm, Contact->normal);\n    dReal d = depth_bot * dDOT(planenorm, doi_bot);\n    Contact->depth = dFabs(d);\n    nContacts++;\n  }\n\n  return nContacts;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n@file traits.hpp\n@brief Traits.\n\n@author Timothy Howard\n@copyright 2014 Timothy Howard under the MIT license;\nsee @ref index or the accompanying LICENSE file for full text.\n*\/\n\n#ifndef CACOPHONY_TRAITS_HPP_\n#define CACOPHONY_TRAITS_HPP_\n\n#include <Cacophony\/config.hpp>\n#include <Cacophony\/types.hpp>\n\n#include <duct\/traits.hpp>\n\n#include <type_traits>\n#include <utility>\n\n\/** @cond INTERNAL *\/\n\nnamespace Cacophony {\nnamespace detail {\nstruct unimplemented {};\n}\n}\n\n\/\/ captures\ntemplate<class... P>\nCacophony::detail::unimplemented\nserialize(P&&...);\n\ntemplate<class... P>\nCacophony::detail::unimplemented\nread(P&&...);\n\ntemplate<class... P>\nCacophony::detail::unimplemented\nwrite(P&&...);\n\n\/** @endcond *\/ \/\/ INTERNAL\n\nnamespace Cacophony {\n\n\/\/ Forward declarations\nclass accessor;\ntemplate<class>\nclass OutputSerializer; \/\/ external\ntemplate<class>\nclass InputSerializer; \/\/ external\n\n\/**\n\t@addtogroup traits\n\t@{\n*\/\n\n\/**\n\tRemove reference from type.\n*\/\ntemplate<class T>\nusing refless_type = typename std::remove_reference<T>::type;\n\n\/**\n\tRemove reference and const qualifier from type.\n*\/\ntemplate<class T>\nusing bare_type = typename std::remove_const<refless_type<T>>::type;\n\n\/**\n\tCheck if a type is a size type.\n\n\t@note The default definition only accepts unsigned integrals.\n\tSpecialize this for user-defined types.\n*\/\ntemplate<class T>\nstruct is_size_type\n\t: public std::integral_constant<\n\t\tbool,\n\t\tstd::is_integral<bare_type<T>>::value &&\n\t\tstd::is_unsigned<bare_type<T>>::value\n\t>\n{};\n\n\/**\n\tCheck if class is an input serializer.\n*\/\ntemplate<class Ser>\nstruct is_input_serializer\n\t: public std::integral_constant<\n\t\tbool,\n\t\tstd::is_base_of<InputSerializer<bare_type<Ser>>, bare_type<Ser>>::value\n\t>\n{};\n\n\/**\n\tCheck if class is an output serializer.\n*\/\ntemplate<class Ser>\nstruct is_output_serializer\n\t: public std::integral_constant<\n\t\tbool,\n\t\tstd::is_base_of<OutputSerializer<bare_type<Ser>>, bare_type<Ser>>::value\n\t>\n{};\n\n\/**\n\tCheck if class is a serializer.\n*\/\ntemplate<class Ser>\nstruct is_serializer\n\t: public std::integral_constant<\n\t\tbool,\n\t\tis_input_serializer <Ser>::value ||\n\t\tis_output_serializer<Ser>::value\n\t>\n{};\n\n\/** @cond INTERNAL *\/\n\ntemplate<class Ser, class T>\nstruct has_non_member_serialize_impl {\n\tusing ser_type = bare_type<Ser>;\n\tusing value_type = bare_type<T>;\n\tusing reversed_type = std::is_same<\n\t\tdetail::unimplemented,\n\t\tdecltype(serialize(\n\t\t\tstd::declval<ser_type&>(),\n\t\t\tstd::declval<value_type&>()\n\t\t))\n\t>;\n\tusing type = std::integral_constant<bool, !reversed_type::value>;\n\tstatic constexpr bool const value = type::value;\n};\n\ntemplate<class Ser, class T>\nstruct has_non_member_read_impl {\n\tusing ser_type = bare_type<Ser>;\n\tusing value_type = T;\n\tusing reversed_type = std::is_same<\n\t\tdetail::unimplemented,\n\t\tdecltype(read(\n\t\t\tstd::declval<ser_type&>(),\n\t\t\tstd::declval<value_type&>()\n\t\t))\n\t>;\n\tusing type = std::integral_constant<bool, !reversed_type::value>;\n\tstatic constexpr bool const value = type::value;\n};\n\ntemplate<class Ser, class T>\nstruct has_non_member_write_impl {\n\tusing ser_type = bare_type<Ser>;\n\tusing value_type = T;\n\tusing reversed_type = std::is_same<\n\t\tdetail::unimplemented,\n\t\tdecltype(write(\n\t\t\tstd::declval<ser_type&>(),\n\t\t\tstd::declval<value_type const&>()\n\t\t))\n\t>;\n\tusing type = std::integral_constant<bool, !reversed_type::value>;\n\tstatic constexpr bool const value = type::value;\n};\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/**\n\tClass access injector.\n\n\tFriend this class within a class if its member serialization\n\tfunctions are private or protected.\n*\/\nclass accessor\n\t: public duct::traits::restrict_all\n{\npublic:\n\/** @cond INTERNAL *\/\n\ttemplate<class Ser, class T>\n\tstruct has_member_serialize_impl {\n\t\tusing ser_type = bare_type<Ser>;\n\t\tusing value_type = bare_type<T>;\n\n\t\ttemplate<class U>\n\t\tstatic auto match(void(U::*)(ser_type&)) -> U;\n\n\t\ttemplate<class U>\n\t\tusing is_t = typename std::is_same<value_type, U>::type;\n\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(\n\t\t\t&U::template serialize<ser_type>\n\t\t))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(&U::serialize))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(...) -> std::false_type;\n\n\t\tusing type = decltype(test<value_type>(0));\n\t\tstatic constexpr bool const value = type::value;\n\t};\n\n\ttemplate<class Ser, class T>\n\tstruct has_member_read_impl {\n\t\tusing ser_type = bare_type<Ser>;\n\t\tusing value_type = bare_type<T>;\n\n\t\ttemplate<class U>\n\t\tstatic auto match(void(U::*)(ser_type&)) -> U;\n\n\t\ttemplate<class U>\n\t\tusing is_t = typename std::is_same<value_type, U>::type;\n\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(\n\t\t\t&U::template read<ser_type>\n\t\t))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(&U::read))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(...) -> std::false_type;\n\n\t\tusing type = decltype(test<value_type>(0));\n\t\tstatic constexpr bool const value = type::value;\n\t};\n\n\ttemplate<class Ser, class T>\n\tstruct has_member_write_impl {\n\t\tusing ser_type = bare_type<Ser>;\n\t\tusing value_type = bare_type<T>;\n\n\t\ttemplate<class U>\n\t\tstatic auto match(void(U::*)(ser_type&) const) -> U;\n\n\t\ttemplate<class U>\n\t\tusing is_t = typename std::is_same<value_type, U>::type;\n\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(\n\t\t\t&U::template write<ser_type>\n\t\t))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(&U::write))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(...) -> std::false_type;\n\n\t\tusing type = decltype(test<value_type>(0));\n\t\tstatic constexpr bool const value = type::value;\n\t};\n\/** @endcond *\/ \/\/ INTERNAL\n\n\t\/**\n\t\tRead a value from an input serializer.\n\n\t\t@note This function is enabled by the availability of the\n\t\t@c serialize() and @c read() serialization functions. A call\n\t\twill be ambiguous if both are available.\n\t\t@{\n\t*\/\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_member_serialize_impl<Ser, bare_type<T>>::value>\n\tin(Ser& ser, T&& value) {\n\t\tvalue.serialize(ser);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_non_member_serialize_impl<Ser, bare_type<T>>::value>\n\tin(Ser& ser, T&& value) {\n\t\tserialize(ser, value);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_member_read_impl<Ser, bare_type<T>>::value>\n\tin(Ser& ser, T&& value) {\n\t\tvalue.read(ser);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_non_member_read_impl<Ser, bare_type<T>>::value>\n\tin(Ser& ser, T&& value) {\n\t\tread(ser, value);\n\t}\n\t\/** @} *\/\n\n\t\/**\n\t\tWrite a value to an output serializer.\n\n\t\t@note This function is enabled by the availability of the\n\t\t@c serialize() and @c write() serialization functions. A call\n\t\twill be ambiguous if both are available.\n\t\t@{\n\t*\/\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_member_serialize_impl<Ser, T>::value>\n\tout(Ser& ser, T const& value) {\n\t\tconst_cast<bare_type<T>&>(value).serialize(ser);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_non_member_serialize_impl<Ser, T>::value>\n\tout(Ser& ser, T const& value) {\n\t\tserialize(ser, const_cast<bare_type<T>&>(value));\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_member_write_impl<Ser, T>::value>\n\tout(Ser& ser, T const& value) {\n\t\tvalue.write(ser);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_non_member_write_impl<Ser, T>::value>\n\tout(Ser& ser, T const& value) {\n\t\twrite(ser, value);\n\t}\n\t\/** @} *\/\n};\n\n\/**\n\tWhether there is a serialize() member function for a\n\tserializer-value pair.\n*\/\ntemplate<class Ser, class T>\nstruct has_member_serialize\n\t: public accessor::has_member_serialize_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a serialize() non-member function for a\n\tserializer-value pair.\n*\/\ntemplate<class Ser, class T>\nstruct has_non_member_serialize\n\t: public has_non_member_serialize_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a read() member function for a serializer-value\n\tpair.\n*\/\ntemplate<class Ser, class T>\nstruct has_member_read\n\t: public accessor::has_member_read_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a read() non-member function for a\n\tserializer-value pair.\n*\/\ntemplate<class Ser, class T>\nstruct has_non_member_read\n\t: public has_non_member_read_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a write() member function for a serializer-value\n\tpair.\n*\/\ntemplate<class Ser, class T>\nstruct has_member_write\n\t: public accessor::has_member_write_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a write() non-member function for a\n\tserializer-value pair.\n*\/\ntemplate<class Ser, class T>\nstruct has_non_member_write\n\t: public has_non_member_write_impl<Ser, T>::type\n{};\n\n\/\/ serializable by type\n\n\/**\n\tWhether a type is serializable with a specific input serializer.\n*\/\ntemplate<class Ser, class T>\nstruct is_input_serializable\n\t: public std::integral_constant<\n\t\tbool,\n\t\tis_input_serializer<Ser>::value && (\n\t\t\/\/ serialize()\n\t\thas_member_serialize\t\t<Ser, T>::value ||\n\t\thas_non_member_serialize\t<Ser, T>::value ||\n\t\t\/\/ write()\n\t\thas_member_read\t\t\t\t<Ser, T>::value ||\n\t\thas_non_member_read\t\t\t<Ser, T>::value\n\t)>\n{\n\t\/\/static_assert();\n};\n\n\/**\n\tWhether a type is serializable with a specific output serializer.\n*\/\ntemplate<class Ser, class T>\nstruct is_output_serializable\n\t: public std::integral_constant<\n\t\tbool,\n\t\tis_output_serializer<Ser>::value && (\n\t\t\/\/ serialize()\n\t\thas_member_serialize\t\t<Ser, T>::value ||\n\t\thas_non_member_serialize\t<Ser, T>::value ||\n\t\t\/\/ read()\n\t\thas_member_write\t\t\t<Ser, T>::value ||\n\t\thas_non_member_write\t\t<Ser, T>::value\n\t)>\n{\n\t\/\/static_assert();\n};\n\ntemplate<class T>\nstruct is_binary_serializable\n\t: public std::integral_constant<\n\t\tbool,\n\t\t!std::is_same<bool, bare_type<T>>::value &&\n\t\tstd::is_arithmetic<bare_type<T>>::value\n\t>\n{};\n\n\/**\n\t@c serialize() function return tag.\n\n\t@note This always constrains by is_serializer.\n\n\t@tparam Ser %Serializer type.\n\t@tparam constraints Additional constraints.\n*\/\ntemplate<class Ser, bool const constraints = true>\nusing tag_serialize = enable_ser<\n\tis_serializer<Ser>::value &&\n\tconstraints\n>;\n\n\/**\n\t@c read() function return tag.\n\n\t@note This always constrains by is_input_serializer.\n\n\t@tparam Ser %Serializer type.\n\t@tparam constraints Additional constraints.\n*\/\ntemplate<class Ser, bool const constraints = true>\nusing tag_read = enable_ser<\n\tis_input_serializer<Ser>::value &&\n\tconstraints\n>;\n\n\/**\n\t@c write() function return tag.\n\n\t@note This always constrains by is_output_serializer.\n\n\t@tparam Ser %Serializer type.\n\t@tparam constraints Additional constraints.\n*\/\ntemplate<class Ser, bool const constraints = true>\nusing tag_write = enable_ser<\n\tis_output_serializer<Ser>::value &&\n\tconstraints\n>;\n\n\/** @} *\/ \/\/ end of doc-group traits\n\n} \/\/ namespace Cacophony\n\n#endif \/\/ CACOPHONY_TRAITS_HPP_\n<commit_msg>traits: added loose tags.<commit_after>\/**\n@file traits.hpp\n@brief Traits.\n\n@author Timothy Howard\n@copyright 2014 Timothy Howard under the MIT license;\nsee @ref index or the accompanying LICENSE file for full text.\n*\/\n\n#ifndef CACOPHONY_TRAITS_HPP_\n#define CACOPHONY_TRAITS_HPP_\n\n#include <Cacophony\/config.hpp>\n#include <Cacophony\/types.hpp>\n\n#include <duct\/traits.hpp>\n\n#include <type_traits>\n#include <utility>\n\n\/** @cond INTERNAL *\/\n\nnamespace Cacophony {\nnamespace detail {\nstruct unimplemented {};\n}\n}\n\n\/\/ captures\ntemplate<class... P>\nCacophony::detail::unimplemented\nserialize(P&&...);\n\ntemplate<class... P>\nCacophony::detail::unimplemented\nread(P&&...);\n\ntemplate<class... P>\nCacophony::detail::unimplemented\nwrite(P&&...);\n\n\/** @endcond *\/ \/\/ INTERNAL\n\nnamespace Cacophony {\n\n\/\/ Forward declarations\nclass accessor;\ntemplate<class>\nclass OutputSerializer; \/\/ external\ntemplate<class>\nclass InputSerializer; \/\/ external\n\n\/**\n\t@addtogroup traits\n\t@{\n*\/\n\n\/**\n\tRemove reference from type.\n*\/\ntemplate<class T>\nusing refless_type = typename std::remove_reference<T>::type;\n\n\/**\n\tRemove reference and const qualifier from type.\n*\/\ntemplate<class T>\nusing bare_type = typename std::remove_const<refless_type<T>>::type;\n\n\/**\n\tCheck if a type is a size type.\n\n\t@note The default definition only accepts unsigned integrals.\n\tSpecialize this for user-defined types.\n*\/\ntemplate<class T>\nstruct is_size_type\n\t: public std::integral_constant<\n\t\tbool,\n\t\tstd::is_integral<bare_type<T>>::value &&\n\t\tstd::is_unsigned<bare_type<T>>::value\n\t>\n{};\n\n\/**\n\tCheck if class is an input serializer.\n*\/\ntemplate<class Ser>\nstruct is_input_serializer\n\t: public std::integral_constant<\n\t\tbool,\n\t\tstd::is_base_of<InputSerializer<bare_type<Ser>>, bare_type<Ser>>::value\n\t>\n{};\n\n\/**\n\tCheck if class is an output serializer.\n*\/\ntemplate<class Ser>\nstruct is_output_serializer\n\t: public std::integral_constant<\n\t\tbool,\n\t\tstd::is_base_of<OutputSerializer<bare_type<Ser>>, bare_type<Ser>>::value\n\t>\n{};\n\n\/**\n\tCheck if class is a serializer.\n*\/\ntemplate<class Ser>\nstruct is_serializer\n\t: public std::integral_constant<\n\t\tbool,\n\t\tis_input_serializer <Ser>::value ||\n\t\tis_output_serializer<Ser>::value\n\t>\n{};\n\n\/** @cond INTERNAL *\/\n\ntemplate<class Ser, class T>\nstruct has_non_member_serialize_impl {\n\tusing ser_type = bare_type<Ser>;\n\tusing value_type = bare_type<T>;\n\tusing reversed_type = std::is_same<\n\t\tdetail::unimplemented,\n\t\tdecltype(serialize(\n\t\t\tstd::declval<ser_type&>(),\n\t\t\tstd::declval<value_type&>()\n\t\t))\n\t>;\n\tusing type = std::integral_constant<bool, !reversed_type::value>;\n\tstatic constexpr bool const value = type::value;\n};\n\ntemplate<class Ser, class T>\nstruct has_non_member_read_impl {\n\tusing ser_type = bare_type<Ser>;\n\tusing value_type = T;\n\tusing reversed_type = std::is_same<\n\t\tdetail::unimplemented,\n\t\tdecltype(read(\n\t\t\tstd::declval<ser_type&>(),\n\t\t\tstd::declval<value_type&>()\n\t\t))\n\t>;\n\tusing type = std::integral_constant<bool, !reversed_type::value>;\n\tstatic constexpr bool const value = type::value;\n};\n\ntemplate<class Ser, class T>\nstruct has_non_member_write_impl {\n\tusing ser_type = bare_type<Ser>;\n\tusing value_type = T;\n\tusing reversed_type = std::is_same<\n\t\tdetail::unimplemented,\n\t\tdecltype(write(\n\t\t\tstd::declval<ser_type&>(),\n\t\t\tstd::declval<value_type const&>()\n\t\t))\n\t>;\n\tusing type = std::integral_constant<bool, !reversed_type::value>;\n\tstatic constexpr bool const value = type::value;\n};\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/**\n\tClass access injector.\n\n\tFriend this class within a class if its member serialization\n\tfunctions are private or protected.\n*\/\nclass accessor\n\t: public duct::traits::restrict_all\n{\npublic:\n\/** @cond INTERNAL *\/\n\ttemplate<class Ser, class T>\n\tstruct has_member_serialize_impl {\n\t\tusing ser_type = bare_type<Ser>;\n\t\tusing value_type = bare_type<T>;\n\n\t\ttemplate<class U>\n\t\tstatic auto match(void(U::*)(ser_type&)) -> U;\n\n\t\ttemplate<class U>\n\t\tusing is_t = typename std::is_same<value_type, U>::type;\n\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(\n\t\t\t&U::template serialize<ser_type>\n\t\t))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(&U::serialize))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(...) -> std::false_type;\n\n\t\tusing type = decltype(test<value_type>(0));\n\t\tstatic constexpr bool const value = type::value;\n\t};\n\n\ttemplate<class Ser, class T>\n\tstruct has_member_read_impl {\n\t\tusing ser_type = bare_type<Ser>;\n\t\tusing value_type = bare_type<T>;\n\n\t\ttemplate<class U>\n\t\tstatic auto match(void(U::*)(ser_type&)) -> U;\n\n\t\ttemplate<class U>\n\t\tusing is_t = typename std::is_same<value_type, U>::type;\n\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(\n\t\t\t&U::template read<ser_type>\n\t\t))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(&U::read))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(...) -> std::false_type;\n\n\t\tusing type = decltype(test<value_type>(0));\n\t\tstatic constexpr bool const value = type::value;\n\t};\n\n\ttemplate<class Ser, class T>\n\tstruct has_member_write_impl {\n\t\tusing ser_type = bare_type<Ser>;\n\t\tusing value_type = bare_type<T>;\n\n\t\ttemplate<class U>\n\t\tstatic auto match(void(U::*)(ser_type&) const) -> U;\n\n\t\ttemplate<class U>\n\t\tusing is_t = typename std::is_same<value_type, U>::type;\n\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(\n\t\t\t&U::template write<ser_type>\n\t\t))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(int) -> is_t<decltype(match(&U::write))>;\n\t\ttemplate<class U>\n\t\tstatic auto test(...) -> std::false_type;\n\n\t\tusing type = decltype(test<value_type>(0));\n\t\tstatic constexpr bool const value = type::value;\n\t};\n\/** @endcond *\/ \/\/ INTERNAL\n\n\t\/**\n\t\tRead a value from an input serializer.\n\n\t\t@note This function is enabled by the availability of the\n\t\t@c serialize() and @c read() serialization functions. A call\n\t\twill be ambiguous if both are available.\n\t\t@{\n\t*\/\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_member_serialize_impl<Ser, bare_type<T>>::value>\n\tin(Ser& ser, T&& value) {\n\t\tvalue.serialize(ser);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_non_member_serialize_impl<Ser, bare_type<T>>::value>\n\tin(Ser& ser, T&& value) {\n\t\tserialize(ser, value);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_member_read_impl<Ser, bare_type<T>>::value>\n\tin(Ser& ser, T&& value) {\n\t\tvalue.read(ser);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_non_member_read_impl<Ser, bare_type<T>>::value>\n\tin(Ser& ser, T&& value) {\n\t\tread(ser, value);\n\t}\n\t\/** @} *\/\n\n\t\/**\n\t\tWrite a value to an output serializer.\n\n\t\t@note This function is enabled by the availability of the\n\t\t@c serialize() and @c write() serialization functions. A call\n\t\twill be ambiguous if both are available.\n\t\t@{\n\t*\/\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_member_serialize_impl<Ser, T>::value>\n\tout(Ser& ser, T const& value) {\n\t\tconst_cast<bare_type<T>&>(value).serialize(ser);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_non_member_serialize_impl<Ser, T>::value>\n\tout(Ser& ser, T const& value) {\n\t\tserialize(ser, const_cast<bare_type<T>&>(value));\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_member_write_impl<Ser, T>::value>\n\tout(Ser& ser, T const& value) {\n\t\tvalue.write(ser);\n\t}\n\n\ttemplate<class Ser, class T>\n\tstatic inline enable_ser<has_non_member_write_impl<Ser, T>::value>\n\tout(Ser& ser, T const& value) {\n\t\twrite(ser, value);\n\t}\n\t\/** @} *\/\n};\n\n\/**\n\tWhether there is a serialize() member function for a\n\tserializer-value pair.\n*\/\ntemplate<class Ser, class T>\nstruct has_member_serialize\n\t: public accessor::has_member_serialize_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a serialize() non-member function for a\n\tserializer-value pair.\n*\/\ntemplate<class Ser, class T>\nstruct has_non_member_serialize\n\t: public has_non_member_serialize_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a read() member function for a serializer-value\n\tpair.\n*\/\ntemplate<class Ser, class T>\nstruct has_member_read\n\t: public accessor::has_member_read_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a read() non-member function for a\n\tserializer-value pair.\n*\/\ntemplate<class Ser, class T>\nstruct has_non_member_read\n\t: public has_non_member_read_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a write() member function for a serializer-value\n\tpair.\n*\/\ntemplate<class Ser, class T>\nstruct has_member_write\n\t: public accessor::has_member_write_impl<Ser, T>::type\n{};\n\n\/**\n\tWhether there is a write() non-member function for a\n\tserializer-value pair.\n*\/\ntemplate<class Ser, class T>\nstruct has_non_member_write\n\t: public has_non_member_write_impl<Ser, T>::type\n{};\n\n\/\/ serializable by type\n\n\/**\n\tWhether a type is serializable with a specific input serializer.\n*\/\ntemplate<class Ser, class T>\nstruct is_input_serializable\n\t: public std::integral_constant<\n\t\tbool,\n\t\tis_input_serializer<Ser>::value && (\n\t\t\/\/ serialize()\n\t\thas_member_serialize\t\t<Ser, T>::value ||\n\t\thas_non_member_serialize\t<Ser, T>::value ||\n\t\t\/\/ write()\n\t\thas_member_read\t\t\t\t<Ser, T>::value ||\n\t\thas_non_member_read\t\t\t<Ser, T>::value\n\t)>\n{\n\t\/\/static_assert();\n};\n\n\/**\n\tWhether a type is serializable with a specific output serializer.\n*\/\ntemplate<class Ser, class T>\nstruct is_output_serializable\n\t: public std::integral_constant<\n\t\tbool,\n\t\tis_output_serializer<Ser>::value && (\n\t\t\/\/ serialize()\n\t\thas_member_serialize\t\t<Ser, T>::value ||\n\t\thas_non_member_serialize\t<Ser, T>::value ||\n\t\t\/\/ read()\n\t\thas_member_write\t\t\t<Ser, T>::value ||\n\t\thas_non_member_write\t\t<Ser, T>::value\n\t)>\n{\n\t\/\/static_assert();\n};\n\ntemplate<class T>\nstruct is_binary_serializable\n\t: public std::integral_constant<\n\t\tbool,\n\t\t!std::is_same<bool, bare_type<T>>::value &&\n\t\tstd::is_arithmetic<bare_type<T>>::value\n\t>\n{};\n\n\/**\n\t@c serialize() function return tag.\n\n\t@note This always constrains by is_serializer.\n\n\t@tparam Ser %Serializer type.\n\t@tparam constraints Additional constraints.\n*\/\ntemplate<class Ser, bool const constraints = true>\nusing tag_serialize = enable_ser<\n\tis_serializer<Ser>::value &&\n\tconstraints\n>;\n\n\/**\n\tLoose @c serialize() function return tag.\n\n\t@note This tag assumes the serializer type has already been\n\tvalidated.\n\n\t@tparam constraints Constraints.\n*\/\ntemplate<bool const constraints = true>\nusing tag_serialize_loose = enable_ser<\n\tconstraints\n>;\n\n\/**\n\t@c read() function return tag.\n\n\t@note This always constrains by is_input_serializer.\n\n\t@tparam Ser %Serializer type.\n\t@tparam constraints Additional constraints.\n*\/\ntemplate<class Ser, bool const constraints = true>\nusing tag_read = enable_ser<\n\tis_input_serializer<Ser>::value &&\n\tconstraints\n>;\n\n\/**\n\tLoose @c read() function return tag.\n\n\t@note This tag assumes the serializer type has already been\n\tvalidated.\n\n\t@tparam constraints Constraints.\n*\/\ntemplate<bool const constraints = true>\nusing tag_read_loose = enable_ser<\n\tconstraints\n>;\n\n\/**\n\t@c write() function return tag.\n\n\t@note This always constrains by is_output_serializer.\n\n\t@tparam Ser %Serializer type.\n\t@tparam constraints Additional constraints.\n*\/\ntemplate<class Ser, bool const constraints = true>\nusing tag_write = enable_ser<\n\tis_output_serializer<Ser>::value &&\n\tconstraints\n>;\n\n\/**\n\tLoose @c write() function return tag.\n\n\t@note This tag assumes the serializer type has already been\n\tvalidated.\n\n\t@tparam constraints Constraints.\n*\/\ntemplate<bool const constraints = true>\nusing tag_write_loose = enable_ser<\n\tconstraints\n>;\n\n\/** @} *\/ \/\/ end of doc-group traits\n\n} \/\/ namespace Cacophony\n\n#endif \/\/ CACOPHONY_TRAITS_HPP_\n<|endoftext|>"}
{"text":"<commit_before>#include <clip_tokenizer.h> \/\/ @manual\n#include <gpt2_bpe_tokenizer.h> \/\/ @manual\n#include <pybind11\/pybind11.h>\n#include <pybind11\/stl.h>\n#include <regex.h>\n#include <regex_tokenizer.h> \/\/ @manual\n#include <sentencepiece.h> \/\/ @manual\n#include <torch\/csrc\/jit\/python\/pybind_utils.h> \/\/ @manual\n#include <torch\/csrc\/utils\/pybind.h> \/\/ @manual\n#include <torch\/script.h>\n#include <vectors.h> \/\/ @manual\n#include <vocab.h> \/\/ @manual\n#include <vocab_factory.h> \/\/ @manual\n\n#include <iostream>\n\nnamespace torchtext {\n\nnamespace py = pybind11;\n\nnamespace {\nVocab build_vocab_from_text_file(\n    const std::string& file_path,\n    const int64_t min_freq,\n    const int64_t num_cpus,\n    py::object fn) {\n  torch::jit::script::Module module(*torch::jit::as_module(fn));\n  return _build_vocab_from_text_file(file_path, min_freq, num_cpus, module);\n}\n} \/\/ namespace\n\n\/\/ Registers our custom classes with pybind11.\nPYBIND11_MODULE(_torchtext, m) {\n  \/\/ Classes\n  py::class_<Regex, c10::intrusive_ptr<Regex>>(m, \"Regex\")\n      .def(py::init<std::string>())\n      .def(\"Sub\", &Regex::Sub)\n      .def(\"FindAndConsume\", &Regex::FindAndConsume)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<Regex>& self) -> std::string {\n            return _serialize_regex(self);\n          },\n          \/\/ __setstate__\n          [](std::string state) -> c10::intrusive_ptr<Regex> {\n            return _deserialize_regex(std::move(state));\n          }));\n\n  py::class_<RegexTokenizer, c10::intrusive_ptr<RegexTokenizer>>(\n      m, \"RegexTokenizer\")\n      .def_readonly(\"patterns_\", &RegexTokenizer::patterns_)\n      .def_readonly(\"replacements_\", &RegexTokenizer::replacements_)\n      .def_readonly(\"to_lower_\", &RegexTokenizer::to_lower_)\n      .def(py::init<std::vector<std::string>, std::vector<std::string>, bool>())\n      .def(\"forward\", &RegexTokenizer::forward)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<RegexTokenizer>& self)\n              -> RegexTokenizerStates {\n            return _serialize_regex_tokenizer(self);\n          },\n          \/\/ __setstate__\n          [](RegexTokenizerStates states)\n              -> c10::intrusive_ptr<RegexTokenizer> {\n            return _deserialize_regex_tokenizer(std::move(states));\n          }));\n\n  py::class_<SentencePiece, c10::intrusive_ptr<SentencePiece>>(\n      m, \"SentencePiece\")\n      .def(py::init<std::string>())\n      .def(\n          \"_return_content\",\n          [](const SentencePiece& self) { return py::bytes(self.content_); })\n      .def(\"Encode\", &SentencePiece::Encode)\n      .def(\"EncodeAsIds\", &SentencePiece::EncodeAsIds)\n      .def(\"DecodeIds\", &SentencePiece::DecodeIds)\n      .def(\"EncodeAsPieces\", &SentencePiece::EncodeAsPieces)\n      .def(\"DecodePieces\", &SentencePiece::DecodePieces)\n      .def(\"GetPieceSize\", &SentencePiece::GetPieceSize)\n      .def(\"unk_id\", &SentencePiece::unk_id)\n      .def(\"PieceToId\", &SentencePiece::PieceToId)\n      .def(\"IdToPiece\", &SentencePiece::IdToPiece)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<SentencePiece>& self) -> py::bytes {\n            return py::bytes(self->content_);\n          },\n          \/\/ __setstate__\n          [](py::bytes state) -> c10::intrusive_ptr<SentencePiece> {\n            return c10::make_intrusive<SentencePiece>(std::string(state));\n          }));\n\n  py::class_<Vectors, c10::intrusive_ptr<Vectors>>(m, \"Vectors\")\n      .def(py::init<\n           std::vector<std::string>,\n           std::vector<int64_t>,\n           torch::Tensor,\n           torch::Tensor>())\n      .def_readonly(\"vectors_\", &Vectors::vectors_)\n      .def_readonly(\"unk_tensor_\", &Vectors::unk_tensor_)\n      .def(\"get_stoi\", &Vectors::get_stoi)\n      .def(\"__getitem__\", &Vectors::__getitem__)\n      .def(\"lookup_vectors\", &Vectors::lookup_vectors)\n      .def(\"__setitem__\", &Vectors::__setitem__)\n      .def(\"__len__\", &Vectors::__len__)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<Vectors>& self) -> VectorsStates {\n            return _serialize_vectors(self);\n          },\n          \/\/ __setstate__\n          [](VectorsStates states) -> c10::intrusive_ptr<Vectors> {\n            return _deserialize_vectors(states);\n          }));\n\n  py::class_<Vocab, c10::intrusive_ptr<Vocab>>(m, \"Vocab\")\n      .def(py::init<StringList, c10::optional<int64_t>>())\n      .def_readonly(\"itos_\", &Vocab::itos_)\n      .def_readonly(\"default_index_\", &Vocab::default_index_)\n      .def(\n          \"__contains__\",\n          [](c10::intrusive_ptr<Vocab>& self, const py::str& item) -> bool {\n            ssize_t length;\n            const char* buffer = PyUnicode_AsUTF8AndSize(item.ptr(), &length);\n            return self->__contains__(c10::string_view{buffer, (size_t)length});\n          })\n      .def(\n          \"__getitem__\",\n          [](c10::intrusive_ptr<Vocab>& self, const py::str& item) -> int64_t {\n            ssize_t length;\n            const char* buffer = PyUnicode_AsUTF8AndSize(item.ptr(), &length);\n            return self->__getitem__(c10::string_view{buffer, (size_t)length});\n          })\n      .def(\"insert_token\", &Vocab::insert_token)\n      .def(\"set_default_index\", &Vocab::set_default_index)\n      .def(\"get_default_index\", &Vocab::get_default_index)\n      .def(\"__len__\", &Vocab::__len__)\n      .def(\"append_token\", &Vocab::append_token)\n      .def(\"lookup_token\", &Vocab::lookup_token)\n      .def(\"lookup_tokens\", &Vocab::lookup_tokens)\n      .def(\n          \"lookup_indices\",\n          [](const c10::intrusive_ptr<Vocab>& self, const py::list& items) {\n            std::vector<int64_t> indices(items.size());\n            int64_t counter = 0;\n            for (const auto& item : items) {\n              ssize_t length;\n              const char* buffer = PyUnicode_AsUTF8AndSize(item.ptr(), &length);\n              indices[counter++] =\n                  self->__getitem__(c10::string_view{buffer, (size_t)length});\n            }\n            return indices;\n          })\n      .def(\"get_stoi\", &Vocab::get_stoi)\n      .def(\"get_itos\", &Vocab::get_itos)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<Vocab>& self) -> VocabStates {\n            return _serialize_vocab(self);\n          },\n          \/\/ __setstate__\n          [](VocabStates states) -> c10::intrusive_ptr<Vocab> {\n            return _deserialize_vocab(states);\n          }));\n\n  py::class_<GPT2BPEEncoder, c10::intrusive_ptr<GPT2BPEEncoder>>(\n      m, \"GPT2BPEEncoder\")\n      .def(py::init<\n           std::unordered_map<std::string, int64_t>,\n           std::unordered_map<std::string, int64_t>,\n           std::string,\n           std::unordered_map<int64_t, std::string>,\n           bool>())\n      .def_property_readonly(\"bpe_encoder_\", &GPT2BPEEncoder::GetBPEEncoder)\n      .def_property_readonly(\n          \"bpe_merge_ranks_\", &GPT2BPEEncoder::GetBPEMergeRanks)\n      .def_readonly(\"seperator_\", &GPT2BPEEncoder::seperator_)\n      .def_property_readonly(\"byte_encoder_\", &GPT2BPEEncoder::GetByteEncoder)\n      .def(\"encode\", &GPT2BPEEncoder::Encode)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<GPT2BPEEncoder>& self)\n              -> GPT2BPEEncoderStatesPybind {\n            return _serialize_gpt2_bpe_encoder_pybind(self);\n          },\n          \/\/ __setstate__\n          [](GPT2BPEEncoderStatesPybind states)\n              -> c10::intrusive_ptr<GPT2BPEEncoder> {\n            return _deserialize_gpt2_bpe_encoder_pybind(states);\n          }));\n\n  py::class_<CLIPEncoder, c10::intrusive_ptr<CLIPEncoder>>(m, \"CLIPEncoder\")\n      .def(py::init<\n           std::unordered_map<std::string, int64_t>,\n           std::unordered_map<std::string, int64_t>,\n           std::string,\n           std::unordered_map<int64_t, std::string>,\n           bool>())\n      .def_property_readonly(\"bpe_encoder_\", &CLIPEncoder::GetBPEEncoder)\n      .def_property_readonly(\"bpe_merge_ranks_\", &CLIPEncoder::GetBPEMergeRanks)\n      .def_readonly(\"seperator_\", &CLIPEncoder::seperator_)\n      .def_property_readonly(\"byte_encoder_\", &CLIPEncoder::GetByteEncoder)\n      .def(\"encode\", &CLIPEncoder::Encode)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<CLIPEncoder>& self)\n              -> CLIPEncoderStatesPybind {\n            return _serialize_clip_encoder_pybind(self);\n          },\n          \/\/ __setstate__\n          [](CLIPEncoderStatesPybind states)\n              -> c10::intrusive_ptr<CLIPEncoder> {\n            return _deserialize_clip_encoder_pybind(states);\n          }));\n\n  \/\/ Functions\n  m.def(\n      \"_load_token_and_vectors_from_file\", &_load_token_and_vectors_from_file);\n  m.def(\"_load_vocab_from_file\", &_load_vocab_from_file);\n  m.def(\"_build_vocab_from_text_file\", &build_vocab_from_text_file);\n  m.def(\n      \"_build_vocab_from_text_file_using_python_tokenizer\",\n      &_build_vocab_from_text_file_using_python_tokenizer);\n}\n\n} \/\/ namespace torchtext\n<commit_msg>Fix for windows builds with python 3.10 , getting rid of ssize_t (#1627)<commit_after>#include <clip_tokenizer.h> \/\/ @manual\n#include <gpt2_bpe_tokenizer.h> \/\/ @manual\n#include <pybind11\/pybind11.h>\n#include <pybind11\/stl.h>\n#include <regex.h>\n#include <regex_tokenizer.h> \/\/ @manual\n#include <sentencepiece.h> \/\/ @manual\n#include <torch\/csrc\/jit\/python\/pybind_utils.h> \/\/ @manual\n#include <torch\/csrc\/utils\/pybind.h> \/\/ @manual\n#include <torch\/script.h>\n#include <vectors.h> \/\/ @manual\n#include <vocab.h> \/\/ @manual\n#include <vocab_factory.h> \/\/ @manual\n\n#include <iostream>\n\nnamespace torchtext {\n\nnamespace py = pybind11;\n\nnamespace {\nVocab build_vocab_from_text_file(\n    const std::string& file_path,\n    const int64_t min_freq,\n    const int64_t num_cpus,\n    py::object fn) {\n  torch::jit::script::Module module(*torch::jit::as_module(fn));\n  return _build_vocab_from_text_file(file_path, min_freq, num_cpus, module);\n}\n} \/\/ namespace\n\n\/\/ Registers our custom classes with pybind11.\nPYBIND11_MODULE(_torchtext, m) {\n  \/\/ Classes\n  py::class_<Regex, c10::intrusive_ptr<Regex>>(m, \"Regex\")\n      .def(py::init<std::string>())\n      .def(\"Sub\", &Regex::Sub)\n      .def(\"FindAndConsume\", &Regex::FindAndConsume)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<Regex>& self) -> std::string {\n            return _serialize_regex(self);\n          },\n          \/\/ __setstate__\n          [](std::string state) -> c10::intrusive_ptr<Regex> {\n            return _deserialize_regex(std::move(state));\n          }));\n\n  py::class_<RegexTokenizer, c10::intrusive_ptr<RegexTokenizer>>(\n      m, \"RegexTokenizer\")\n      .def_readonly(\"patterns_\", &RegexTokenizer::patterns_)\n      .def_readonly(\"replacements_\", &RegexTokenizer::replacements_)\n      .def_readonly(\"to_lower_\", &RegexTokenizer::to_lower_)\n      .def(py::init<std::vector<std::string>, std::vector<std::string>, bool>())\n      .def(\"forward\", &RegexTokenizer::forward)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<RegexTokenizer>& self)\n              -> RegexTokenizerStates {\n            return _serialize_regex_tokenizer(self);\n          },\n          \/\/ __setstate__\n          [](RegexTokenizerStates states)\n              -> c10::intrusive_ptr<RegexTokenizer> {\n            return _deserialize_regex_tokenizer(std::move(states));\n          }));\n\n  py::class_<SentencePiece, c10::intrusive_ptr<SentencePiece>>(\n      m, \"SentencePiece\")\n      .def(py::init<std::string>())\n      .def(\n          \"_return_content\",\n          [](const SentencePiece& self) { return py::bytes(self.content_); })\n      .def(\"Encode\", &SentencePiece::Encode)\n      .def(\"EncodeAsIds\", &SentencePiece::EncodeAsIds)\n      .def(\"DecodeIds\", &SentencePiece::DecodeIds)\n      .def(\"EncodeAsPieces\", &SentencePiece::EncodeAsPieces)\n      .def(\"DecodePieces\", &SentencePiece::DecodePieces)\n      .def(\"GetPieceSize\", &SentencePiece::GetPieceSize)\n      .def(\"unk_id\", &SentencePiece::unk_id)\n      .def(\"PieceToId\", &SentencePiece::PieceToId)\n      .def(\"IdToPiece\", &SentencePiece::IdToPiece)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<SentencePiece>& self) -> py::bytes {\n            return py::bytes(self->content_);\n          },\n          \/\/ __setstate__\n          [](py::bytes state) -> c10::intrusive_ptr<SentencePiece> {\n            return c10::make_intrusive<SentencePiece>(std::string(state));\n          }));\n\n  py::class_<Vectors, c10::intrusive_ptr<Vectors>>(m, \"Vectors\")\n      .def(py::init<\n           std::vector<std::string>,\n           std::vector<int64_t>,\n           torch::Tensor,\n           torch::Tensor>())\n      .def_readonly(\"vectors_\", &Vectors::vectors_)\n      .def_readonly(\"unk_tensor_\", &Vectors::unk_tensor_)\n      .def(\"get_stoi\", &Vectors::get_stoi)\n      .def(\"__getitem__\", &Vectors::__getitem__)\n      .def(\"lookup_vectors\", &Vectors::lookup_vectors)\n      .def(\"__setitem__\", &Vectors::__setitem__)\n      .def(\"__len__\", &Vectors::__len__)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<Vectors>& self) -> VectorsStates {\n            return _serialize_vectors(self);\n          },\n          \/\/ __setstate__\n          [](VectorsStates states) -> c10::intrusive_ptr<Vectors> {\n            return _deserialize_vectors(states);\n          }));\n\n  py::class_<Vocab, c10::intrusive_ptr<Vocab>>(m, \"Vocab\")\n      .def(py::init<StringList, c10::optional<int64_t>>())\n      .def_readonly(\"itos_\", &Vocab::itos_)\n      .def_readonly(\"default_index_\", &Vocab::default_index_)\n      .def(\n          \"__contains__\",\n          [](c10::intrusive_ptr<Vocab>& self, const py::str& item) -> bool {\n            Py_ssize_t length;\n            const char* buffer = PyUnicode_AsUTF8AndSize(item.ptr(), &length);\n            return self->__contains__(c10::string_view{buffer, (size_t)length});\n          })\n      .def(\n          \"__getitem__\",\n          [](c10::intrusive_ptr<Vocab>& self, const py::str& item) -> int64_t {\n            Py_ssize_t length;\n            const char* buffer = PyUnicode_AsUTF8AndSize(item.ptr(), &length);\n            return self->__getitem__(c10::string_view{buffer, (size_t)length});\n          })\n      .def(\"insert_token\", &Vocab::insert_token)\n      .def(\"set_default_index\", &Vocab::set_default_index)\n      .def(\"get_default_index\", &Vocab::get_default_index)\n      .def(\"__len__\", &Vocab::__len__)\n      .def(\"append_token\", &Vocab::append_token)\n      .def(\"lookup_token\", &Vocab::lookup_token)\n      .def(\"lookup_tokens\", &Vocab::lookup_tokens)\n      .def(\n          \"lookup_indices\",\n          [](const c10::intrusive_ptr<Vocab>& self, const py::list& items) {\n            std::vector<int64_t> indices(items.size());\n            int64_t counter = 0;\n            for (const auto& item : items) {\n              Py_ssize_t length;\n              const char* buffer = PyUnicode_AsUTF8AndSize(item.ptr(), &length);\n              indices[counter++] =\n                  self->__getitem__(c10::string_view{buffer, (size_t)length});\n            }\n            return indices;\n          })\n      .def(\"get_stoi\", &Vocab::get_stoi)\n      .def(\"get_itos\", &Vocab::get_itos)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<Vocab>& self) -> VocabStates {\n            return _serialize_vocab(self);\n          },\n          \/\/ __setstate__\n          [](VocabStates states) -> c10::intrusive_ptr<Vocab> {\n            return _deserialize_vocab(states);\n          }));\n\n  py::class_<GPT2BPEEncoder, c10::intrusive_ptr<GPT2BPEEncoder>>(\n      m, \"GPT2BPEEncoder\")\n      .def(py::init<\n           std::unordered_map<std::string, int64_t>,\n           std::unordered_map<std::string, int64_t>,\n           std::string,\n           std::unordered_map<int64_t, std::string>,\n           bool>())\n      .def_property_readonly(\"bpe_encoder_\", &GPT2BPEEncoder::GetBPEEncoder)\n      .def_property_readonly(\n          \"bpe_merge_ranks_\", &GPT2BPEEncoder::GetBPEMergeRanks)\n      .def_readonly(\"seperator_\", &GPT2BPEEncoder::seperator_)\n      .def_property_readonly(\"byte_encoder_\", &GPT2BPEEncoder::GetByteEncoder)\n      .def(\"encode\", &GPT2BPEEncoder::Encode)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<GPT2BPEEncoder>& self)\n              -> GPT2BPEEncoderStatesPybind {\n            return _serialize_gpt2_bpe_encoder_pybind(self);\n          },\n          \/\/ __setstate__\n          [](GPT2BPEEncoderStatesPybind states)\n              -> c10::intrusive_ptr<GPT2BPEEncoder> {\n            return _deserialize_gpt2_bpe_encoder_pybind(states);\n          }));\n\n  py::class_<CLIPEncoder, c10::intrusive_ptr<CLIPEncoder>>(m, \"CLIPEncoder\")\n      .def(py::init<\n           std::unordered_map<std::string, int64_t>,\n           std::unordered_map<std::string, int64_t>,\n           std::string,\n           std::unordered_map<int64_t, std::string>,\n           bool>())\n      .def_property_readonly(\"bpe_encoder_\", &CLIPEncoder::GetBPEEncoder)\n      .def_property_readonly(\"bpe_merge_ranks_\", &CLIPEncoder::GetBPEMergeRanks)\n      .def_readonly(\"seperator_\", &CLIPEncoder::seperator_)\n      .def_property_readonly(\"byte_encoder_\", &CLIPEncoder::GetByteEncoder)\n      .def(\"encode\", &CLIPEncoder::Encode)\n      .def(py::pickle(\n          \/\/ __getstate__\n          [](const c10::intrusive_ptr<CLIPEncoder>& self)\n              -> CLIPEncoderStatesPybind {\n            return _serialize_clip_encoder_pybind(self);\n          },\n          \/\/ __setstate__\n          [](CLIPEncoderStatesPybind states)\n              -> c10::intrusive_ptr<CLIPEncoder> {\n            return _deserialize_clip_encoder_pybind(states);\n          }));\n\n  \/\/ Functions\n  m.def(\n      \"_load_token_and_vectors_from_file\", &_load_token_and_vectors_from_file);\n  m.def(\"_load_vocab_from_file\", &_load_vocab_from_file);\n  m.def(\"_build_vocab_from_text_file\", &build_vocab_from_text_file);\n  m.def(\n      \"_build_vocab_from_text_file_using_python_tokenizer\",\n      &_build_vocab_from_text_file_using_python_tokenizer);\n}\n\n} \/\/ namespace torchtext\n<|endoftext|>"}
{"text":"<commit_before>\/**\r\n * Appcelerator Titanium - licensed under the Apache Public License 2\r\n * see LICENSE in the root folder for details on the license.\r\n * Copyright (c) 2009 Appcelerator, Inc. All Rights Reserved.\r\n *\/\r\n\r\n#include <windows.h>\r\n#include <objbase.h>\r\n#include <Wininet.h>\r\n#include <vector>\r\n#include <iostream>\r\n#include <fstream>\r\n#include <io.h>\r\n#include <stdlib.h>\r\n#include <stdio.h>\r\n#include \"Progress.h\"\r\n#include \"Resource.h\"\r\n\r\n#define alert(msg) MessageBoxA(GetDesktopWindow(), msg, \"Message\", MB_OK);\r\n#define walert(msg) MessageBoxW(GetDesktopWindow(), msg, L\"Message\", MB_OK);\r\n\r\n#define DISTRIBUTION_UUID\tL\"7F7FA377-E695-4280-9F1F-96126F3D2C2A\"\r\n#define RUNTIME_UUID\t\tL\"A2AC5CB5-8C52-456C-9525-601A5B0725DA\"\r\n#define MODULE_UUID\t\t\tL\"1ACE5D3A-2B52-43FB-A136-007BD166CFD0\"\r\n\r\n\r\nstd::wstring ParseQueryParam(std::wstring uri, std::wstring name)\r\n{\r\n\tstd::wstring key = name;\r\n\tkey+=L\"=\";\r\n\tsize_t pos = uri.find(key);\r\n\tif (pos!=std::wstring::npos)\r\n\t{\r\n\t\tstd::wstring p = uri.substr(pos + key.length());\r\n\t\tpos = p.find(L\"&\");\r\n\t\tif (pos!=std::wstring::npos)\r\n\t\t{\r\n\t\t\tp = p.substr(0,pos);\r\n\t\t}\r\n\r\n\t\t\/\/ decode\r\n\t\tWCHAR szOut[INTERNET_MAX_URL_LENGTH];\r\n\t\tDWORD cchDecodedUrl = INTERNET_MAX_URL_LENGTH;\r\n\t\tCoInternetParseUrl(p.c_str(), PARSE_UNESCAPE, 0, szOut, INTERNET_MAX_URL_LENGTH, &cchDecodedUrl, 0);\r\n\t\tp.assign(szOut);\r\n\r\n\t\treturn p;\r\n\t}\r\n\treturn L\"\";\r\n}\r\n\r\nstd::wstring ProgressString(DWORD size, DWORD total)\r\n{\r\n\tchar str[1024];\r\n\r\n#define KB 1024\r\n#define MB KB * 1024\r\n\r\n\tif (total < KB) {\r\n\t\tsprintf(str, \"%0.2f of %0.2f bytes\", size, total);\r\n\t}\r\n\r\n\telse if (size < MB) {\r\n\t\tdouble totalKB = total\/1024.0;\r\n\t\tdouble sizeKB = size\/1024.0;\r\n\t\tsprintf(str, \"%0.2f of %0.2f KB\", sizeKB, totalKB);\r\n\t}\r\n\t\r\n\telse {\r\n\t\t\/\/ hopefully we shouldn't ever need to count more than 1023 in a single file!\r\n\t\tdouble totalMB = total\/1024.0\/1024.0;\r\n\t\tdouble sizeMB = size\/1024.0\/1024.0;\r\n\t\tsprintf(str, \"%0.2f of %0.2f MB\", size, total);\r\n\t}\r\n\t\r\n\twchar_t wstr[1024];\r\n\tmbtowc(wstr, str, strlen(str));\r\n\treturn std::wstring(wstr);\r\n}\r\n\r\nbool DownloadURL(Progress *p, HINTERNET hINet, std::wstring url, std::wstring outFilename)\r\n{\r\n\tWCHAR szDecodedUrl[INTERNET_MAX_URL_LENGTH];\r\n\tDWORD cchDecodedUrl = INTERNET_MAX_URL_LENGTH;\r\n\tWCHAR szDomainName[INTERNET_MAX_URL_LENGTH];\r\n\r\n\t\/\/ parse the URL\n\tHRESULT hr = CoInternetParseUrl(url.c_str(), PARSE_DECODE, URL_ENCODING_NONE, szDecodedUrl,\r\n                    INTERNET_MAX_URL_LENGTH, &cchDecodedUrl, 0);\n\tif (hr != S_OK)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\t\/\/ figure out the domain\/hostname\r\n\thr = CoInternetParseUrl(szDecodedUrl, PARSE_DOMAIN, 0, szDomainName, INTERNET_MAX_URL_LENGTH, &cchDecodedUrl, 0);\r\n\tif (hr != S_OK)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\t\r\n\t\/\/ TODO - how to cancel download if user presses the Cancel button\r\n\t\r\n\t\/\/ start the HTTP fetch\r\n\tHINTERNET hConnection = InternetConnectW( hINet, szDomainName, 80, L\" \", L\" \", INTERNET_SERVICE_HTTP, 0, 0 );\r\n\tif ( !hConnection )\r\n\t{\n\t\treturn false;\r\n\t}\r\n\t\r\n\tstd::wstring wurl(szDecodedUrl);\r\n\tstd::wstring path = wurl.substr(wurl.find(szDomainName)+wcslen(szDomainName));\r\n\t\/\/std::wstring queryString = url.substr(url.rfind(\"?\")+1);\r\n\t\/\/astd::wstring object = path + \"?\" + queryString;\r\n\t\r\n\tHINTERNET hRequest = HttpOpenRequestW( hConnection, L\"GET\", path.c_str(), NULL, NULL, NULL, INTERNET_FLAG_RELOAD|INTERNET_FLAG_NO_CACHE_WRITE|INTERNET_FLAG_NO_COOKIES|INTERNET_FLAG_NO_UI|INTERNET_FLAG_IGNORE_CERT_CN_INVALID|INTERNET_FLAG_IGNORE_CERT_DATE_INVALID, 0 );\r\n\n\tif ( !hRequest )\r\n\t{\r\n\t\tInternetCloseHandle(hConnection);\r\n\t\treturn false;\r\n\t}\r\n\r\n\t\/\/ now stream the resulting HTTP into a file\r\n\tstd::ofstream ostr;\r\n\tostr.open(outFilename.c_str(), std::ios_base::binary | std::ios_base::trunc);\r\n\r\n\tbool failed = false;\r\n\r\n\tCHAR buffer[2048];\r\n\tDWORD dwRead;\r\n\tDWORD total = 0;\r\n\twchar_t msg[255];\r\n\t\r\n\tHttpSendRequest( hRequest, NULL, 0, NULL, 0);\r\n\twhile( InternetReadFile( hRequest, buffer, 2047, &dwRead ) )\r\n\t{\r\n\t\tif ( dwRead == 0)\r\n\t\t{\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tif (p->IsCancelled())\r\n\t\t{\r\n\t\t\tfailed = true;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tbuffer[dwRead] = '\\0';\r\n\t\ttotal+=dwRead;\r\n\t\tostr.write(buffer, dwRead);\r\n\t\twsprintfW(msg,L\"Downloaded %d KB\",total\/1024);\r\n\t\tp->SetLineText(2,msg,true);\r\n\t}\r\n\tostr.close();\r\n\tInternetCloseHandle(hConnection);\r\n\tInternetCloseHandle(hRequest);\r\n\r\n\treturn ! failed;\r\n}\r\n\r\nbool DownloadURL2(Progress *p, HINTERNET hINet, std::wstring url, std::wstring outFilename)\r\n{\r\n\t\/\/ TODO - how to cancel download if user presses the Cancel button\r\n\r\n\t\/\/url = L\"http:\/\/www.google.com\";\r\n\t\/\/ start the HTTP fetch\r\n\tHINTERNET urlConn = InternetOpenUrlW(hINet, url.c_str(), NULL, 0, 0, 0);\r\n\tif ( !urlConn )\r\n\t{\r\n\t\tMessageBoxW(GetDesktopWindow(), L\"didn't get a good url connection?\", L\"Download no good\", MB_OK);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tbool failed = false;\r\n\r\n\r\n\t\/\/ now stream the resulting HTTP into a file\r\n\tstd::ofstream ostr;\r\n\tostr.open(outFilename.c_str(), std::ios_base::binary | std::ios_base::trunc);\r\n\t\r\n\tCHAR buffer[2048];\r\n\tDWORD dwRead;\r\n\tDWORD total = 0;\r\n\twchar_t msg[255];\r\n\twhile( InternetReadFile(urlConn, buffer, 2047, &dwRead ) )\r\n\t{\r\n\t\tif ( dwRead == 0)\r\n\t\t{\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tif (p->IsCancelled())\r\n\t\t{\r\n\t\t\tfailed = true;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tbuffer[dwRead] = 0;\r\n\t\ttotal+=dwRead;\r\n\t\tostr << buffer;\r\n\t\twsprintfW(msg,L\"Downloaded %d bytes\",total);\r\n\t\tp->SetLineText(2,msg,true);\r\n\t}\t\r\n\tostr.close();\r\n\tInternetCloseHandle(urlConn);\r\n\r\n\tMessageBoxW(GetDesktopWindow(), url.c_str(), L\"URL Downloaded\", MB_OK);\r\n\tMessageBoxW(GetDesktopWindow(), outFilename.c_str(), L\"File Downloaded\", MB_OK);\r\n\r\n\treturn ! failed;\r\n}\r\n\r\nBOOL DirectoryExists(std::wstring dirName)\r\n{\r\n\tDWORD attribs = ::GetFileAttributesW(dirName.c_str());\r\n\r\n\tif (attribs == INVALID_FILE_ATTRIBUTES) {\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn (attribs & FILE_ATTRIBUTE_DIRECTORY);\r\n}\r\n\r\nvoid CreateDirectoryTree(std::wstring dir)\r\n{\r\n\tif(! DirectoryExists(dir))\r\n\t{\r\n\t\t\/\/ ensure parent dir exits\r\n\t\tint lastSlash = dir.find_last_of(L\"\\\\\");\r\n\t\tif(lastSlash != std::wstring::npos)\r\n\t\t{\r\n\t\t\tstd::wstring parent = dir.substr(0, lastSlash);\r\n\r\n\t\t\tCreateDirectoryTree(parent);\r\n\t\t}\r\n\r\n\t\t\/\/ by this point, all parent dirs are created\r\n\t\tCreateDirectoryW(dir.c_str(), NULL);\r\n\t}\r\n}\r\n\r\nbool UnzipFile(std::wstring unzipper, std::wstring zipFile, std::wstring destdir)\r\n{\r\n\t\/\/ ensure destdir exists\r\n\tCreateDirectoryTree(destdir);\r\n\r\n\t\/\/ now we're going to invoke back into the boot to unzip our file and install\r\n\tSTARTUPINFOW si;\r\n\tPROCESS_INFORMATION pi;\r\n\tZeroMemory( &si, sizeof(si) );\r\n\tZeroMemory( &pi, sizeof(pi) );\r\n\tsi.cb = sizeof(si);\r\n\r\n\tstd::wstring cmdline = L\"\\\"\";\r\n\tcmdline+=unzipper;\r\n\tcmdline+=L\"\\\" --tiunzip \\\"\";\r\n\tcmdline+=zipFile;\r\n\tcmdline+=L\"\\\" \\\"\";\r\n\tcmdline+=destdir;\r\n\tcmdline+=L\"\\\"\";\r\n\r\n\t\/\/ in win32, we just invoke back the same process and let him unzip\r\n\tif (!CreateProcessW(NULL,(LPWSTR)cmdline.c_str(),NULL,NULL,FALSE,NULL,NULL,NULL,&si,&pi))\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\t\/\/ wait for the process to finish unzipping\r\n\tWaitForSingleObject(pi.hProcess,INFINITE);\r\n\r\n\treturn true;\r\n}\r\nint WINAPI WinMain(\r\n    HINSTANCE hInstance,\r\n    HINSTANCE hPrevInstance,\r\n    LPSTR lpCmdLine,\r\n    int nCmdShow\r\n)\r\n{\r\n\t\/\/TODO: set the icon for this app and dialogs\r\n\/\/\tHICON icon = LoadIcon(hInstance,MAKEINTRESOURCE(IDR_MAINFRAME));\r\n\/\/\tSendMessage(NULL, WM_SETICON, (WPARAM)true, (LPARAM)icon);\r\n\r\n\t\/\/ get the command line\r\n\tLPWSTR cmdline = GetCommandLineW();\r\n    int argcount = 0;\r\n\tLPWSTR *args = CommandLineToArgvW(cmdline,&argcount);\r\n\t\r\n\t\/\/ we must have at least the mandatory args + 1 URL\r\n\tif (argcount < 7)\r\n\t{\r\n\t\tMessageBoxW(GetDesktopWindow(),L\"Invalid arguments passed to Installer\",L\"Application Error\",MB_OK|MB_SYSTEMMODAL|MB_ICONEXCLAMATION);\r\n\t\treturn 1;\r\n\t}\r\n\r\n\tstd::wstring appname = args[1];\r\n\tstd::wstring title = args[2];\r\n\tstd::wstring message = args[3];\r\n\tstd::wstring appTitle = appname + L\" Installer\";\r\n\tstd::wstring tempdir = args[4];\r\n\tstd::wstring installdir = args[5];\r\n\tstd::wstring unzipper = args[6];\r\n\r\n\t\/\/ verify the installation\r\n\tif (IDOK != MessageBoxW(GetDesktopWindow(),message.c_str(),title.c_str(),MB_ICONINFORMATION|MB_OKCANCEL))\r\n\t{\r\n\t\tMessageBoxW(GetDesktopWindow(),L\"Installation Aborted. To install later, re-run the application again.\", title.c_str(), MB_OK|MB_ICONWARNING);\r\n\t\treturn 1;\r\n\t}\r\n\r\n\tint count = argcount - 7;\r\n\tint startAt = 7;\r\n\r\n\tCoInitialize(NULL);\r\n\r\n\t\/\/ create our progress indicator class\r\n\tProgress *p = new Progress;\r\n\tp->SetTitle(appTitle.c_str());\r\n\tp->SetCancelMessage(L\"Cancelling, one moment...\");\r\n\r\n\twchar_t buf[255];\r\n\twsprintfW(buf,L\"Preparing to download %d file%s\", count, (count > 1 ? L\"s\" : L\"\"));\r\n\r\n\tp->SetLineText(1,std::wstring(buf),true);\r\n\tp->Show();\r\n\tp->Update(0,count);\r\n\r\n\t\/\/ initialize interent DLL\r\n\tHINTERNET hINet = InternetOpenW(L\"Mozilla\/5.0 (compatible; Titanium_Downloader\/0.1; Win32)\", INTERNET_OPEN_TYPE_PRECONFIG, NULL, NULL, 0 );\r\n\r\n\t\/\/ for each URL, fetch the URL and then unzip it\r\n\tbool failed = false;\r\n\tDWORD x = 0;\r\n\tfor (int c=startAt;c<argcount;c++)\r\n\t{\r\n\t\tp->Update(x++,count);\r\n\t\tstd::wstring url = args[c];\r\n\r\n\t\tstd::wstring uuid = ParseQueryParam(url,L\"uuid\");\r\n\t\tstd::wstring name = ParseQueryParam(url,L\"name\");\r\n\t\tstd::wstring version = ParseQueryParam(url,L\"version\");\r\n\t\tstd::wstring filename = name;\r\n\t\tfilename+=L\"-\";\r\n\t\tfilename+=version;\r\n\t\tfilename+=L\".zip\";\r\n\r\n\t\t\/\/ figure out the path and destination\r\n\t\tstd::wstring path = tempdir + L\"\\\\\" + filename;\r\n\t\tstd::wstring destdir;\r\n\r\n\t\tif (RUNTIME_UUID == uuid)\r\n        {\r\n\t\t\tdestdir = installdir + L\"\\\\runtime\\\\win32\\\\\" + version;\r\n        }\r\n        else if (MODULE_UUID == uuid)\r\n        {\r\n\t\t\tdestdir = installdir + L\"\\\\modules\\\\win32\\\\\" + name + L\"\\\\\" + version;\r\n        }\r\n        else\r\n        {\r\n\t\t\tcontinue;\r\n        }\r\n\r\n\t\tbool downloaded = DownloadURL(p, hINet, url, path);\r\n\r\n\t\tif(downloaded)\r\n\t\t{\r\n\t\t\twchar_t msg[255];\r\n\t\t\twsprintfW(msg, L\"Installing %s\/%s ...\",name.c_str(),version.c_str());\r\n\t\t\tp->SetLineText(2,msg,true);\r\n\t\t\tUnzipFile(unzipper, path, destdir);\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ done with iNet - so close it\r\n\tInternetCloseHandle(hINet);\r\n\r\n\tif (p->IsCancelled())\r\n\t{\r\n\t\tfailed = true;\r\n\t}\r\n\r\n\t\/\/ cleanup\r\n\tdelete p;\r\n\r\n\tCoUninitialize();\r\n\r\n\treturn (failed) ? 1 : 0;\r\n}\r\n<commit_msg>normalize url before attempting the download<commit_after>\/**\r\n * Appcelerator Titanium - licensed under the Apache Public License 2\r\n * see LICENSE in the root folder for details on the license.\r\n * Copyright (c) 2009 Appcelerator, Inc. All Rights Reserved.\r\n *\/\r\n\r\n#include <windows.h>\r\n#include <objbase.h>\r\n#include <Wininet.h>\r\n#include <vector>\r\n#include <iostream>\r\n#include <fstream>\r\n#include <io.h>\r\n#include <stdlib.h>\r\n#include <stdio.h>\r\n#include \"Progress.h\"\r\n#include \"Resource.h\"\r\n\r\n#define alert(msg) MessageBoxA(GetDesktopWindow(), msg, \"Message\", MB_OK);\r\n#define walert(msg) MessageBoxW(GetDesktopWindow(), msg, L\"Message\", MB_OK);\r\n\r\n#define DISTRIBUTION_UUID\tL\"7F7FA377-E695-4280-9F1F-96126F3D2C2A\"\r\n#define RUNTIME_UUID\t\tL\"A2AC5CB5-8C52-456C-9525-601A5B0725DA\"\r\n#define MODULE_UUID\t\t\tL\"1ACE5D3A-2B52-43FB-A136-007BD166CFD0\"\r\n\r\n\r\nstd::wstring ParseQueryParam(std::wstring uri, std::wstring name)\r\n{\r\n\tstd::wstring key = name;\r\n\tkey+=L\"=\";\r\n\tsize_t pos = uri.find(key);\r\n\tif (pos!=std::wstring::npos)\r\n\t{\r\n\t\tstd::wstring p = uri.substr(pos + key.length());\r\n\t\tpos = p.find(L\"&\");\r\n\t\tif (pos!=std::wstring::npos)\r\n\t\t{\r\n\t\t\tp = p.substr(0,pos);\r\n\t\t}\r\n\r\n\t\t\/\/ decode\r\n\t\tWCHAR szOut[INTERNET_MAX_URL_LENGTH];\r\n\t\tDWORD cchDecodedUrl = INTERNET_MAX_URL_LENGTH;\r\n\t\tCoInternetParseUrl(p.c_str(), PARSE_UNESCAPE, 0, szOut, INTERNET_MAX_URL_LENGTH, &cchDecodedUrl, 0);\r\n\t\tp.assign(szOut);\r\n\r\n\t\treturn p;\r\n\t}\r\n\treturn L\"\";\r\n}\r\n\r\nstd::wstring ProgressString(DWORD size, DWORD total)\r\n{\r\n\tchar str[1024];\r\n\r\n#define KB 1024\r\n#define MB KB * 1024\r\n\r\n\tif (total < KB) {\r\n\t\tsprintf(str, \"%0.2f of %0.2f bytes\", size, total);\r\n\t}\r\n\r\n\telse if (size < MB) {\r\n\t\tdouble totalKB = total\/1024.0;\r\n\t\tdouble sizeKB = size\/1024.0;\r\n\t\tsprintf(str, \"%0.2f of %0.2f KB\", sizeKB, totalKB);\r\n\t}\r\n\t\r\n\telse {\r\n\t\t\/\/ hopefully we shouldn't ever need to count more than 1023 in a single file!\r\n\t\tdouble totalMB = total\/1024.0\/1024.0;\r\n\t\tdouble sizeMB = size\/1024.0\/1024.0;\r\n\t\tsprintf(str, \"%0.2f of %0.2f MB\", size, total);\r\n\t}\r\n\t\r\n\twchar_t wstr[1024];\r\n\tmbtowc(wstr, str, strlen(str));\r\n\treturn std::wstring(wstr);\r\n}\r\n\r\nbool DownloadURL(Progress *p, HINTERNET hINet, std::wstring url, std::wstring outFilename)\r\n{\r\n\tWCHAR szDecodedUrl[INTERNET_MAX_URL_LENGTH];\r\n\tDWORD cchDecodedUrl = INTERNET_MAX_URL_LENGTH;\r\n\tWCHAR szDomainName[INTERNET_MAX_URL_LENGTH];\r\n\r\n\t\/\/ parse the URL\n\tHRESULT hr = CoInternetParseUrl(url.c_str(), PARSE_DECODE, URL_ENCODING_NONE, szDecodedUrl,\r\n                    INTERNET_MAX_URL_LENGTH, &cchDecodedUrl, 0);\n\tif (hr != S_OK)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\t\/\/ figure out the domain\/hostname\r\n\thr = CoInternetParseUrl(szDecodedUrl, PARSE_DOMAIN, 0, szDomainName, INTERNET_MAX_URL_LENGTH, &cchDecodedUrl, 0);\r\n\tif (hr != S_OK)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\t\r\n\t\/\/ TODO - how to cancel download if user presses the Cancel button\r\n\t\r\n\t\/\/ start the HTTP fetch\r\n\tHINTERNET hConnection = InternetConnectW( hINet, szDomainName, 80, L\" \", L\" \", INTERNET_SERVICE_HTTP, 0, 0 );\r\n\tif ( !hConnection )\r\n\t{\n\t\treturn false;\r\n\t}\r\n\t\r\n\tstd::wstring wurl(szDecodedUrl);\r\n\tstd::wstring path = wurl.substr(wurl.find(szDomainName)+wcslen(szDomainName));\r\n\t\/\/std::wstring queryString = url.substr(url.rfind(\"?\")+1);\r\n\t\/\/astd::wstring object = path + \"?\" + queryString;\r\n\t\r\n\tHINTERNET hRequest = HttpOpenRequestW( hConnection, L\"GET\", path.c_str(), NULL, NULL, NULL, INTERNET_FLAG_RELOAD|INTERNET_FLAG_NO_CACHE_WRITE|INTERNET_FLAG_NO_COOKIES|INTERNET_FLAG_NO_UI|INTERNET_FLAG_IGNORE_CERT_CN_INVALID|INTERNET_FLAG_IGNORE_CERT_DATE_INVALID, 0 );\r\n\n\tif ( !hRequest )\r\n\t{\r\n\t\tInternetCloseHandle(hConnection);\r\n\t\treturn false;\r\n\t}\r\n\r\n\t\/\/ now stream the resulting HTTP into a file\r\n\tstd::ofstream ostr;\r\n\tostr.open(outFilename.c_str(), std::ios_base::binary | std::ios_base::trunc);\r\n\r\n\tbool failed = false;\r\n\r\n\tCHAR buffer[2048];\r\n\tDWORD dwRead;\r\n\tDWORD total = 0;\r\n\twchar_t msg[255];\r\n\t\r\n\tHttpSendRequest( hRequest, NULL, 0, NULL, 0);\r\n\twhile( InternetReadFile( hRequest, buffer, 2047, &dwRead ) )\r\n\t{\r\n\t\tif ( dwRead == 0)\r\n\t\t{\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tif (p->IsCancelled())\r\n\t\t{\r\n\t\t\tfailed = true;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tbuffer[dwRead] = '\\0';\r\n\t\ttotal+=dwRead;\r\n\t\tostr.write(buffer, dwRead);\r\n\t\twsprintfW(msg,L\"Downloaded %d KB\",total\/1024);\r\n\t\tp->SetLineText(2,msg,true);\r\n\t}\r\n\tostr.close();\r\n\tInternetCloseHandle(hConnection);\r\n\tInternetCloseHandle(hRequest);\r\n\r\n\treturn ! failed;\r\n}\r\n\r\nbool DownloadURL2(Progress *p, HINTERNET hINet, std::wstring url, std::wstring outFilename)\r\n{\r\n\tWCHAR szDecodedUrl[INTERNET_MAX_URL_LENGTH];\r\n\tDWORD cchDecodedUrl = INTERNET_MAX_URL_LENGTH;\r\n\tHRESULT hr = CoInternetParseUrl(url.c_str(), PARSE_DECODE, URL_ENCODING_NONE, szDecodedUrl, INTERNET_MAX_URL_LENGTH, &cchDecodedUrl, 0);\n\tif (hr != S_OK)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\t\/\/ start the HTTP fetch\r\n\tHINTERNET urlConn = InternetOpenUrlW(hINet, szDecodedUrl, NULL, 0, 0, 0);\r\n\tif ( !urlConn )\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\tbool failed = false;\r\n\r\n\r\n\t\/\/ now stream the resulting HTTP into a file\r\n\tstd::ofstream ostr;\r\n\tostr.open(outFilename.c_str(), std::ios_base::binary | std::ios_base::trunc);\r\n\t\r\n\tCHAR buffer[2048];\r\n\tDWORD dwRead;\r\n\tDWORD total = 0;\r\n\twchar_t msg[255];\r\n\twhile( InternetReadFile(urlConn, buffer, 2047, &dwRead ) )\r\n\t{\r\n\t\tif ( dwRead == 0)\r\n\t\t{\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tif (p->IsCancelled())\r\n\t\t{\r\n\t\t\tfailed = true;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tbuffer[dwRead] = '\\0';\r\n\t\ttotal+=dwRead;\r\n\t\tostr.write(buffer, dwRead);\r\n\t\twsprintfW(msg,L\"Downloaded %d KB\",total\/1024);\r\n\t\tp->SetLineText(2,msg,true);\r\n\t}\t\r\n\tostr.close();\r\n\tInternetCloseHandle(urlConn);\r\n\r\n\treturn ! failed;\r\n}\r\n\r\nBOOL DirectoryExists(std::wstring dirName)\r\n{\r\n\tDWORD attribs = ::GetFileAttributesW(dirName.c_str());\r\n\r\n\tif (attribs == INVALID_FILE_ATTRIBUTES) {\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn (attribs & FILE_ATTRIBUTE_DIRECTORY);\r\n}\r\n\r\nvoid CreateDirectoryTree(std::wstring dir)\r\n{\r\n\tif(! DirectoryExists(dir))\r\n\t{\r\n\t\t\/\/ ensure parent dir exits\r\n\t\tint lastSlash = dir.find_last_of(L\"\\\\\");\r\n\t\tif(lastSlash != std::wstring::npos)\r\n\t\t{\r\n\t\t\tstd::wstring parent = dir.substr(0, lastSlash);\r\n\r\n\t\t\tCreateDirectoryTree(parent);\r\n\t\t}\r\n\r\n\t\t\/\/ by this point, all parent dirs are created\r\n\t\tCreateDirectoryW(dir.c_str(), NULL);\r\n\t}\r\n}\r\n\r\nbool UnzipFile(std::wstring unzipper, std::wstring zipFile, std::wstring destdir)\r\n{\r\n\t\/\/ ensure destdir exists\r\n\tCreateDirectoryTree(destdir);\r\n\r\n\t\/\/ now we're going to invoke back into the boot to unzip our file and install\r\n\tSTARTUPINFOW si;\r\n\tPROCESS_INFORMATION pi;\r\n\tZeroMemory( &si, sizeof(si) );\r\n\tZeroMemory( &pi, sizeof(pi) );\r\n\tsi.cb = sizeof(si);\r\n\r\n\tstd::wstring cmdline = L\"\\\"\";\r\n\tcmdline+=unzipper;\r\n\tcmdline+=L\"\\\" --tiunzip \\\"\";\r\n\tcmdline+=zipFile;\r\n\tcmdline+=L\"\\\" \\\"\";\r\n\tcmdline+=destdir;\r\n\tcmdline+=L\"\\\"\";\r\n\r\n\t\/\/ in win32, we just invoke back the same process and let him unzip\r\n\tif (!CreateProcessW(NULL,(LPWSTR)cmdline.c_str(),NULL,NULL,FALSE,NULL,NULL,NULL,&si,&pi))\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\t\/\/ wait for the process to finish unzipping\r\n\tWaitForSingleObject(pi.hProcess,INFINITE);\r\n\r\n\treturn true;\r\n}\r\nint WINAPI WinMain(\r\n    HINSTANCE hInstance,\r\n    HINSTANCE hPrevInstance,\r\n    LPSTR lpCmdLine,\r\n    int nCmdShow\r\n)\r\n{\r\n\t\/\/TODO: set the icon for this app and dialogs\r\n\/\/\tHICON icon = LoadIcon(hInstance,MAKEINTRESOURCE(IDR_MAINFRAME));\r\n\/\/\tSendMessage(NULL, WM_SETICON, (WPARAM)true, (LPARAM)icon);\r\n\r\n\t\/\/ get the command line\r\n\tLPWSTR cmdline = GetCommandLineW();\r\n    int argcount = 0;\r\n\tLPWSTR *args = CommandLineToArgvW(cmdline,&argcount);\r\n\t\r\n\t\/\/ we must have at least the mandatory args + 1 URL\r\n\tif (argcount < 7)\r\n\t{\r\n\t\tMessageBoxW(GetDesktopWindow(),L\"Invalid arguments passed to Installer\",L\"Application Error\",MB_OK|MB_SYSTEMMODAL|MB_ICONEXCLAMATION);\r\n\t\treturn 1;\r\n\t}\r\n\r\n\tstd::wstring appname = args[1];\r\n\tstd::wstring title = args[2];\r\n\tstd::wstring message = args[3];\r\n\tstd::wstring appTitle = appname + L\" Installer\";\r\n\tstd::wstring tempdir = args[4];\r\n\tstd::wstring installdir = args[5];\r\n\tstd::wstring unzipper = args[6];\r\n\r\n\t\/\/ verify the installation\r\n\tif (IDOK != MessageBoxW(GetDesktopWindow(),message.c_str(),title.c_str(),MB_ICONINFORMATION|MB_OKCANCEL))\r\n\t{\r\n\t\tMessageBoxW(GetDesktopWindow(),L\"Installation Aborted. To install later, re-run the application again.\", title.c_str(), MB_OK|MB_ICONWARNING);\r\n\t\treturn 1;\r\n\t}\r\n\r\n\tint count = argcount - 7;\r\n\tint startAt = 7;\r\n\r\n\tCoInitialize(NULL);\r\n\r\n\t\/\/ create our progress indicator class\r\n\tProgress *p = new Progress;\r\n\tp->SetTitle(appTitle.c_str());\r\n\tp->SetCancelMessage(L\"Cancelling, one moment...\");\r\n\r\n\twchar_t buf[255];\r\n\twsprintfW(buf,L\"Preparing to download %d file%s\", count, (count > 1 ? L\"s\" : L\"\"));\r\n\r\n\tp->SetLineText(1,std::wstring(buf),true);\r\n\tp->Show();\r\n\tp->Update(0,count);\r\n\r\n\t\/\/ initialize interent DLL\r\n\tHINTERNET hINet = InternetOpenW(L\"Mozilla\/5.0 (compatible; Titanium_Downloader\/0.1; Win32)\", INTERNET_OPEN_TYPE_PRECONFIG, NULL, NULL, 0 );\r\n\r\n\t\/\/ for each URL, fetch the URL and then unzip it\r\n\tbool failed = false;\r\n\tDWORD x = 0;\r\n\tfor (int c=startAt;c<argcount;c++)\r\n\t{\r\n\t\tp->Update(x++,count);\r\n\t\tstd::wstring url = args[c];\r\n\r\n\t\tstd::wstring uuid = ParseQueryParam(url,L\"uuid\");\r\n\t\tstd::wstring name = ParseQueryParam(url,L\"name\");\r\n\t\tstd::wstring version = ParseQueryParam(url,L\"version\");\r\n\t\tstd::wstring filename = name;\r\n\t\tfilename+=L\"-\";\r\n\t\tfilename+=version;\r\n\t\tfilename+=L\".zip\";\r\n\r\n\t\t\/\/ figure out the path and destination\r\n\t\tstd::wstring path = tempdir + L\"\\\\\" + filename;\r\n\t\tstd::wstring destdir;\r\n\r\n\t\tif (RUNTIME_UUID == uuid)\r\n        {\r\n\t\t\tdestdir = installdir + L\"\\\\runtime\\\\win32\\\\\" + version;\r\n        }\r\n        else if (MODULE_UUID == uuid)\r\n        {\r\n\t\t\tdestdir = installdir + L\"\\\\modules\\\\win32\\\\\" + name + L\"\\\\\" + version;\r\n        }\r\n        else\r\n        {\r\n\t\t\tcontinue;\r\n        }\r\n\r\n\t\tbool downloaded = DownloadURL(p, hINet, url, path);\r\n\r\n\t\tif(downloaded)\r\n\t\t{\r\n\t\t\twchar_t msg[255];\r\n\t\t\twsprintfW(msg, L\"Installing %s\/%s ...\",name.c_str(),version.c_str());\r\n\t\t\tp->SetLineText(2,msg,true);\r\n\t\t\tUnzipFile(unzipper, path, destdir);\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ done with iNet - so close it\r\n\tInternetCloseHandle(hINet);\r\n\r\n\tif (p->IsCancelled())\r\n\t{\r\n\t\tfailed = true;\r\n\t}\r\n\r\n\t\/\/ cleanup\r\n\tdelete p;\r\n\r\n\tCoUninitialize();\r\n\r\n\treturn (failed) ? 1 : 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: testfactreg.hxx,v $\n *\n *  $Revision: 1.1.1.1 $\n *\n *  last change: $Author: hr $ $Date: 2000-09-18 17:24: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#include <rtl\/strbuf.hxx>\n\nReference< XInterface > SAL_CALL OPipeTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw( Exception );\nSequence<OUString> OPipeTest_getSupportedServiceNames(void) throw();\nOUString     OPipeTest_getServiceName() throw();\nOUString    OPipeTest_getImplementationName() throw();\n\nReference< XInterface > SAL_CALL OPumpTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw( Exception );\nSequence<OUString> OPumpTest_getSupportedServiceNames(void) throw();\nOUString     OPumpTest_getServiceName() throw();\nOUString    OPumpTest_getImplementationName() throw();\n\nReference< XInterface > SAL_CALL ODataStreamTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString> ODataStreamTest_getSupportedServiceNames( int i) throw();\nOUString     ODataStreamTest_getServiceName( int i) throw();\nOUString    ODataStreamTest_getImplementationName( int i) throw();\n\nReference< XInterface > SAL_CALL OMarkableOutputStreamTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString> OMarkableOutputStreamTest_getSupportedServiceNames(void) throw();\nOUString     OMarkableOutputStreamTest_getServiceName() throw();\nOUString    OMarkableOutputStreamTest_getImplementationName() throw();\n\nReference< XInterface > SAL_CALL OMarkableInputStreamTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString> OMarkableInputStreamTest_getSupportedServiceNames(void) throw();\nOUString     OMarkableInputStreamTest_getServiceName() throw();\nOUString    OMarkableInputStreamTest_getImplementationName() throw();\n\nReference< XInterface > SAL_CALL OObjectStreamTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString> OObjectStreamTest_getSupportedServiceNames( int i) throw();\nOUString     OObjectStreamTest_getServiceName( int i) throw();\nOUString    OObjectStreamTest_getImplementationName( int i) throw();\n\nReference< XInterface > SAL_CALL OMyPersistObject_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString>  OMyPersistObject_getSupportedServiceNames( ) throw();\nOUString            OMyPersistObject_getServiceName( ) throw();\nOUString            OMyPersistObject_getImplementationName( ) throw();\n\nSequence<sal_Int8> createSeq( char * p );\nSequence<sal_Int8> createIntSeq( sal_Int32 i );\n\n#define BUILD_ERROR(expr, Message)\\\n        {\\\n            m_seqErrors.realloc( m_seqErrors.getLength() + 1 ); \\\n        m_seqExceptions.realloc(  m_seqExceptions.getLength() + 1 ); \\\n        OStringBuffer str(128); \\\n        str.append( __FILE__ );\\\n        str.append( \" \" ); \\\n        str.append( \"(\" ); \\\n        str.append( OString::valueOf( (sal_Int32)__LINE__) );\\\n        str.append(\")\\n\" );\\\n        str.append( \"[ \" ); \\\n        str.append( #expr ); \\\n        str.append( \" ] : \" ); \\\n        str.append( Message ); \\\n        m_seqErrors.getArray()[ m_seqErrors.getLength()-1] =\\\n                       OStringToOUString( str.makeStringAndClear() , RTL_TEXTENCODING_ASCII_US ); \\\n        }\\\n        ((void)0)\n\n\n#define WARNING_ASSERT(expr, Message) \\\n        if( ! (expr) ) { \\\n            m_seqWarnings.realloc( m_seqErrors.getLength() +1 ); \\\n            OStringBuffer str(128);\\\n            str.append( __FILE__);\\\n            str.append( \" \"); \\\n            str.append( \"(\" ); \\\n            str.append(OString::valueOf( (sal_Int32)__LINE__)) ;\\\n            str.append( \")\\n\");\\\n            str.append( \"[ \" ); \\\n            str.append( #expr ); \\\n            str.append( \" ] : \") ; \\\n            str.append( Message); \\\n            m_seqWarnings.getArray()[ m_seqWarnings.getLength()-1] =\\\n                          OStringToOUString( str.makeStringAndClear() , RTL_TEXTENCODING_ASCII_US ); \\\n            return; \\\n        }\\\n        ((void)0)\n\n#define ERROR_ASSERT(expr, Message) \\\n        if( ! (expr) ) { \\\n            BUILD_ERROR(expr, Message );\\\n            return; \\\n        }\\\n        ((void)0)\n\n#define ERROR_EXCEPTION_ASSERT(expr, Message, Exception) \\\n    if( !(expr)) { \\\n        BUILD_ERROR(expr,Message);\\\n        m_seqExceptions.getArray()[ m_seqExceptions.getLength()-1] = Any( Exception );\\\n        return; \\\n    } \\\n    ((void)0)\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.146); FILE MERGED 2005\/09\/05 17:14:55 rt 1.1.1.1.146.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: testfactreg.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 18:34:53 $\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#include <rtl\/strbuf.hxx>\n\nReference< XInterface > SAL_CALL OPipeTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw( Exception );\nSequence<OUString> OPipeTest_getSupportedServiceNames(void) throw();\nOUString     OPipeTest_getServiceName() throw();\nOUString    OPipeTest_getImplementationName() throw();\n\nReference< XInterface > SAL_CALL OPumpTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw( Exception );\nSequence<OUString> OPumpTest_getSupportedServiceNames(void) throw();\nOUString     OPumpTest_getServiceName() throw();\nOUString    OPumpTest_getImplementationName() throw();\n\nReference< XInterface > SAL_CALL ODataStreamTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString> ODataStreamTest_getSupportedServiceNames( int i) throw();\nOUString     ODataStreamTest_getServiceName( int i) throw();\nOUString    ODataStreamTest_getImplementationName( int i) throw();\n\nReference< XInterface > SAL_CALL OMarkableOutputStreamTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString> OMarkableOutputStreamTest_getSupportedServiceNames(void) throw();\nOUString     OMarkableOutputStreamTest_getServiceName() throw();\nOUString    OMarkableOutputStreamTest_getImplementationName() throw();\n\nReference< XInterface > SAL_CALL OMarkableInputStreamTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString> OMarkableInputStreamTest_getSupportedServiceNames(void) throw();\nOUString     OMarkableInputStreamTest_getServiceName() throw();\nOUString    OMarkableInputStreamTest_getImplementationName() throw();\n\nReference< XInterface > SAL_CALL OObjectStreamTest_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString> OObjectStreamTest_getSupportedServiceNames( int i) throw();\nOUString     OObjectStreamTest_getServiceName( int i) throw();\nOUString    OObjectStreamTest_getImplementationName( int i) throw();\n\nReference< XInterface > SAL_CALL OMyPersistObject_CreateInstance( const Reference< XMultiServiceFactory > & rSMgr ) throw(Exception);\nSequence<OUString>  OMyPersistObject_getSupportedServiceNames( ) throw();\nOUString            OMyPersistObject_getServiceName( ) throw();\nOUString            OMyPersistObject_getImplementationName( ) throw();\n\nSequence<sal_Int8> createSeq( char * p );\nSequence<sal_Int8> createIntSeq( sal_Int32 i );\n\n#define BUILD_ERROR(expr, Message)\\\n        {\\\n            m_seqErrors.realloc( m_seqErrors.getLength() + 1 ); \\\n        m_seqExceptions.realloc(  m_seqExceptions.getLength() + 1 ); \\\n        OStringBuffer str(128); \\\n        str.append( __FILE__ );\\\n        str.append( \" \" ); \\\n        str.append( \"(\" ); \\\n        str.append( OString::valueOf( (sal_Int32)__LINE__) );\\\n        str.append(\")\\n\" );\\\n        str.append( \"[ \" ); \\\n        str.append( #expr ); \\\n        str.append( \" ] : \" ); \\\n        str.append( Message ); \\\n        m_seqErrors.getArray()[ m_seqErrors.getLength()-1] =\\\n                       OStringToOUString( str.makeStringAndClear() , RTL_TEXTENCODING_ASCII_US ); \\\n        }\\\n        ((void)0)\n\n\n#define WARNING_ASSERT(expr, Message) \\\n        if( ! (expr) ) { \\\n            m_seqWarnings.realloc( m_seqErrors.getLength() +1 ); \\\n            OStringBuffer str(128);\\\n            str.append( __FILE__);\\\n            str.append( \" \"); \\\n            str.append( \"(\" ); \\\n            str.append(OString::valueOf( (sal_Int32)__LINE__)) ;\\\n            str.append( \")\\n\");\\\n            str.append( \"[ \" ); \\\n            str.append( #expr ); \\\n            str.append( \" ] : \") ; \\\n            str.append( Message); \\\n            m_seqWarnings.getArray()[ m_seqWarnings.getLength()-1] =\\\n                          OStringToOUString( str.makeStringAndClear() , RTL_TEXTENCODING_ASCII_US ); \\\n            return; \\\n        }\\\n        ((void)0)\n\n#define ERROR_ASSERT(expr, Message) \\\n        if( ! (expr) ) { \\\n            BUILD_ERROR(expr, Message );\\\n            return; \\\n        }\\\n        ((void)0)\n\n#define ERROR_EXCEPTION_ASSERT(expr, Message, Exception) \\\n    if( !(expr)) { \\\n        BUILD_ERROR(expr,Message);\\\n        m_seqExceptions.getArray()[ m_seqExceptions.getLength()-1] = Any( Exception );\\\n        return; \\\n    } \\\n    ((void)0)\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Axel Naumann <axel@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 \"cling\/MetaProcessor\/MetaProcessor.h\"\n\n#include \"Display.h\"\n#include \"InputValidator.h\"\n#include \"MetaParser.h\"\n#include \"MetaSema.h\"\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n\n#include \"llvm\/Support\/Path.h\"\n\n#include <fstream>\n#include <cstdlib>\n#include <cctype>\n#include <stdio.h>\n#ifndef WIN32\n#include <unistd.h>\n#else\n#include <io.h>\n#define STDIN_FILENO  0\n#define STDOUT_FILENO 1\n#define STDERR_FILENO 2\n#endif\n\nusing namespace clang;\n\nnamespace cling {\n\n  MetaProcessor::MaybeRedirectOutputRAII::MaybeRedirectOutputRAII(\n                                          MetaProcessor* p)\n  :m_MetaProcessor(p), m_isCurrentlyRedirecting(0) {\n    StringRef redirectionFile;\n    if (!m_MetaProcessor->m_PrevStdoutFileName.empty()) {\n      redirectionFile = m_MetaProcessor->m_PrevStdoutFileName.back();\n      redirect(stdout, redirectionFile.str(), kSTDOUT);\n    }\n    if (!m_MetaProcessor->m_PrevStderrFileName.empty()) {\n      redirectionFile = m_MetaProcessor->m_PrevStderrFileName.back();\n      \/\/ Deal with the case 2>&1 and 2&>1\n      if (strcmp(redirectionFile.data(), \"_IO_2_1_stdout_\") == 0) {\n        \/\/ If out is redirected to a file.\n        if (!m_MetaProcessor->m_PrevStdoutFileName.empty()) {\n          redirectionFile = m_MetaProcessor->m_PrevStdoutFileName.back();\n        } else {\n          unredirect(m_MetaProcessor->m_backupFDStderr, STDERR_FILENO, stderr);\n        }\n      }\n      redirect(stderr, redirectionFile.str(), kSTDERR);\n    }\n  }\n\n  void MetaProcessor::MaybeRedirectOutputRAII::redirect(FILE* file,\n                                        const std::string& fileName,\n                                        MetaProcessor::RedirectionScope scope) {\n    if (!fileName.empty()) {\n      FILE* redirectionFile = freopen(fileName.c_str(), \"a\", file);\n      if (!redirectionFile) {\n        llvm::errs()<<\"cling::MetaProcessor::MaybeRedirectOutputRAII::redirect:\"\n                    \" Not succefully reopened the redirection file \"\n                    << fileName.c_str() << \"\\n.\";\n      } else {\n        m_isCurrentlyRedirecting |= scope;\n      }\n    }\n  }\n\n  void MetaProcessor::MaybeRedirectOutputRAII::pop() {\n    if (m_isCurrentlyRedirecting & kSTDOUT) {\n      unredirect(m_MetaProcessor->m_backupFDStdout, STDOUT_FILENO, stdout);\n    }\n    if (m_isCurrentlyRedirecting & kSTDERR) {\n      unredirect(m_MetaProcessor->m_backupFDStderr, STDERR_FILENO, stderr);\n    }\n  }\n\n  void MetaProcessor::MaybeRedirectOutputRAII::unredirect(int backupFD,\n                                                          int expectedFD,\n                                                          FILE* file) {\n    \/\/ Switch back to previous file after line is processed.\n\n    \/\/ Flush the current content if there is any.\n    if (!feof(file)) {\n      fflush(file);\n    }\n    \/\/ Copy the original fd for the std.\n    if (dup2(backupFD, expectedFD) != expectedFD) {\n        llvm::errs() << \"cling::MetaProcessor::unredirect \"\n                     << \"The unredirection file descriptor not valid \"\n                     << backupFD << \".\\n\";\n    }\n  }\n\n  MetaProcessor::MetaProcessor(Interpreter& interp, raw_ostream& outs)\n    : m_Interp(interp), m_Outs(&outs) {\n    m_InputValidator.reset(new InputValidator());\n    m_MetaParser.reset(new MetaParser(new MetaSema(interp, *this)));\n    m_backupFDStdout = copyFileDescriptor(STDOUT_FILENO);\n    m_backupFDStderr = copyFileDescriptor(STDERR_FILENO);\n  }\n\n  MetaProcessor::~MetaProcessor() {}\n\n  int MetaProcessor::process(const char* input_text,\n                             Interpreter::CompilationResult& compRes,\n                             Value* result) {\n    if (result)\n      *result = Value();\n    compRes = Interpreter::kSuccess;\n    int expectedIndent = m_InputValidator->getExpectedIndent();\n\n    if (expectedIndent)\n      compRes = Interpreter::kMoreInputExpected;\n    if (!input_text || !input_text[0]) {\n      \/\/ nullptr \/ empty string, nothing to do.\n      return expectedIndent;\n    }\n    std::string input_line(input_text);\n    if (input_line == \"\\n\") { \/\/ just a blank line, nothing to do.\n      return expectedIndent;\n    }\n    \/\/  Check for and handle meta commands.\n    m_MetaParser->enterNewInputLine(input_line);\n    MetaSema::ActionResult actionResult = MetaSema::AR_Success;\n    if (m_MetaParser->isMetaCommand(actionResult, result)) {\n\n      if (m_MetaParser->isQuitRequested())\n        return -1;\n\n      if (actionResult != MetaSema::AR_Success)\n        compRes = Interpreter::kFailure;\n       \/\/ ExpectedIndent might have changed after meta command.\n       return m_InputValidator->getExpectedIndent();\n    }\n\n    \/\/ Check if the current statement is now complete. If not, return to\n    \/\/ prompt for more.\n    if (m_InputValidator->validate(input_line) == InputValidator::kIncomplete) {\n      compRes = Interpreter::kMoreInputExpected;\n      return m_InputValidator->getExpectedIndent();\n    }\n\n    \/\/  We have a complete statement, compile and execute it.\n    std::string input = m_InputValidator->getInput();\n    m_InputValidator->reset();\n    \/\/ if (m_Options.RawInput)\n    \/\/   compResLocal = m_Interp.declare(input);\n    \/\/ else\n    compRes = m_Interp.process(input, result);\n\n    return 0;\n  }\n\n  void MetaProcessor::cancelContinuation() const {\n    m_InputValidator->reset();\n  }\n\n  int MetaProcessor::getExpectedIndent() const {\n    return m_InputValidator->getExpectedIndent();\n  }\n\n  Interpreter::CompilationResult\n  MetaProcessor::readInputFromFile(llvm::StringRef filename,\n                                   Value* result,\n                                   bool ignoreOutmostBlock \/*=false*\/) {\n\n    {\n      \/\/ check that it's not binary:\n      std::ifstream in(filename.str().c_str(), std::ios::in | std::ios::binary);\n      char magic[1024] = {0};\n      in.read(magic, sizeof(magic));\n      size_t readMagic = in.gcount();\n      if (readMagic >= 4) {\n        llvm::StringRef magicStr(magic,in.gcount());\n        llvm::sys::fs::file_magic fileType\n          = llvm::sys::fs::identify_magic(magicStr);\n        if (fileType != llvm::sys::fs::file_magic::unknown) {\n          llvm::errs() << \"Error in cling::MetaProcessor: \"\n            \"cannot read input from a binary file!\\n\";\n          return Interpreter::kFailure;\n        }\n        unsigned printable = 0;\n        for (size_t i = 0; i < readMagic; ++i)\n          if (isprint(magic[i]))\n            ++printable;\n        if (10 * printable <  5 * readMagic) {\n          \/\/ 50% printable for ASCII files should be a safe guess.\n          llvm::errs() << \"Error in cling::MetaProcessor: \"\n            \"cannot read input from a (likely) binary file!\\n\" << printable;\n          return Interpreter::kFailure;\n        }\n      }\n    }\n\n    std::ifstream in(filename.str().c_str());\n    in.seekg(0, std::ios::end);\n    size_t size = in.tellg();\n    std::string content(size, ' ');\n    in.seekg(0);\n    in.read(&content[0], size);\n\n    if (ignoreOutmostBlock && !content.empty()) {\n      static const char whitespace[] = \" \\t\\r\\n\";\n      std::string::size_type posNonWS = content.find_first_not_of(whitespace);\n      \/\/ Handle comments before leading {\n      while (content[posNonWS] == '\/' && content[posNonWS+1] == '\/') {\n        \/\/ Remove the comment line\n        posNonWS = content.find_first_of('\\n', posNonWS+2)+1;\n      }\n      std::string::size_type replaced = posNonWS;\n      if (posNonWS != std::string::npos) {\n        if (content[posNonWS] == '{') {\n          \/\/ hide the curly brace:\n          content[posNonWS] = ' ';\n          \/\/ and the matching closing '}'\n          posNonWS = content.find_last_not_of(whitespace);\n          if (posNonWS != std::string::npos) {\n            if (content[posNonWS] == ';' && content[posNonWS-1] == '}') {\n              content[posNonWS--] = ' '; \/\/ replace ';' and enter next if\n            }\n            if (content[posNonWS] == '}') {\n              content[posNonWS] = ' '; \/\/ replace '}'\n            } else {\n              std::string::size_type posBlockClose = content.find_last_of('}');\n              if (posBlockClose != std::string::npos) {\n                content[posBlockClose] = ' '; \/\/ replace '}'\n              }\n              std::string::size_type posComment\n                = content.find_first_not_of(whitespace, posComment);\n              if (content[posComment] == '\/' && content[posComment+1] == '\/') {\n              \/\/ More text (comments) are okay after the last '}', but\n              \/\/ we can not easily find it to remove it (so we need to upgrade\n              \/\/ this code to better handle the case with comments or\n              \/\/ preprocessor code before and after the leading { and\n              \/\/ trailing })\n                while (posComment <= posNonWS) {\n                  content[posComment++] = ' '; \/\/ replace '}' and comment\n                }\n              } else {\n                content[replaced] = '{';\n                \/\/ By putting the '{' back, we keep the code as consistent as\n                \/\/ the user wrote it ... but we should still warn that we not\n                \/\/ goint to treat this file an unamed macro.\n                llvm::errs()\n                << \"Warning in cling::MetaProcessor: can not find the closing '}', \"\n                << llvm::sys::path::filename(filename)\n                << \" is not handled as an unamed script!\\n\";\n              } \/\/ did not find '}''\n            } \/\/ remove comments after the trailing '}'\n          } \/\/ find '}'\n        } \/\/ have '{'\n      } \/\/ have non-whitespace\n    } \/\/ ignore outmost block\n\n    std::string strFilename(filename.str());\n    m_CurrentlyExecutingFile = strFilename;\n    bool topmost = !m_TopExecutingFile.data();\n    if (topmost)\n      m_TopExecutingFile = m_CurrentlyExecutingFile;\n    Interpreter::CompilationResult ret;\n    \/\/ We don't want to value print the results of a unnamed macro.\n    content = \"#line 2 \\\"\" + filename.str() + \"\\\" \\n\" + content;\n    if (process((content + \";\").c_str(), ret, result)) {\n      \/\/ Input file has to be complete.\n       llvm::errs()\n          << \"Error in cling::MetaProcessor: file \"\n          << llvm::sys::path::filename(filename)\n          << \" is incomplete (missing parenthesis or similar)!\\n\";\n      ret = Interpreter::kFailure;\n    }\n    m_CurrentlyExecutingFile = llvm::StringRef();\n    if (topmost)\n      m_TopExecutingFile = llvm::StringRef();\n    return ret;\n  }\n\n  void MetaProcessor::setFileStream(llvm::StringRef file, bool append, int fd,\n              llvm::SmallVector<llvm::SmallString<128>, 2>& prevFileStack) {\n    \/\/ If we have a fileName to redirect to store it.\n    if (!file.empty()) {\n      prevFileStack.push_back(file);\n      \/\/ pop and push a null terminating 0.\n      \/\/ SmallVectorImpl<T> does not have a c_str(), thus instead of casting to\n      \/\/ a SmallString<T> we null terminate the data that we have and pop the\n      \/\/ 0 char back.\n      prevFileStack.back().push_back(0);\n      prevFileStack.back().pop_back();\n      if (!append) {\n        FILE * f;\n        if (!(f = fopen(file.data(), \"w\"))) {\n          llvm::errs() << \"cling::MetaProcessor::setFileStream:\"\n                       \" The file path \" << file.data() << \"is not valid.\";\n        } else {\n          fclose(f);\n        }\n      }\n    \/\/ Else unredirection, so switch to the previous file.\n    } else {\n      \/\/ If there is no previous file on the stack we pop the file\n      if (!prevFileStack.empty()) {\n        prevFileStack.pop_back();\n      }\n    }\n  }\n\n  void MetaProcessor::setStdStream(llvm::StringRef file,\n                                   RedirectionScope stream, bool append) {\n\n    if (stream & kSTDOUT) {\n      setFileStream(file, append, STDOUT_FILENO, m_PrevStdoutFileName);\n    }\n    if (stream & kSTDERR) {\n      setFileStream(file, append, STDERR_FILENO, m_PrevStderrFileName);\n    }\n  }\n\n  int MetaProcessor::copyFileDescriptor(int fd) {\n    int backupFD = dup(fd);\n    if (backupFD < 0) {\n      llvm::errs() << \"MetaProcessor::copyFileDescriptor: Duplicating the file\"\n                   \" descriptor \" << fd << \"resulted in an error.\"\n                   \" Will not be able to unredirect.\";\n    }\n    return backupFD;\n  }\n\n  void MetaProcessor::registerUnloadPoint(const Transaction* T,\n                                          llvm::StringRef filename) {\n    m_MetaParser->getActions().registerUnloadPoint(T, filename);\n  }\n\n} \/\/ end namespace cling\n<commit_msg>Handle npos \/ not found (Coverity 55587).<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Axel Naumann <axel@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 \"cling\/MetaProcessor\/MetaProcessor.h\"\n\n#include \"Display.h\"\n#include \"InputValidator.h\"\n#include \"MetaParser.h\"\n#include \"MetaSema.h\"\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n\n#include \"llvm\/Support\/Path.h\"\n\n#include <fstream>\n#include <cstdlib>\n#include <cctype>\n#include <stdio.h>\n#ifndef WIN32\n#include <unistd.h>\n#else\n#include <io.h>\n#define STDIN_FILENO  0\n#define STDOUT_FILENO 1\n#define STDERR_FILENO 2\n#endif\n\nusing namespace clang;\n\nnamespace cling {\n\n  MetaProcessor::MaybeRedirectOutputRAII::MaybeRedirectOutputRAII(\n                                          MetaProcessor* p)\n  :m_MetaProcessor(p), m_isCurrentlyRedirecting(0) {\n    StringRef redirectionFile;\n    if (!m_MetaProcessor->m_PrevStdoutFileName.empty()) {\n      redirectionFile = m_MetaProcessor->m_PrevStdoutFileName.back();\n      redirect(stdout, redirectionFile.str(), kSTDOUT);\n    }\n    if (!m_MetaProcessor->m_PrevStderrFileName.empty()) {\n      redirectionFile = m_MetaProcessor->m_PrevStderrFileName.back();\n      \/\/ Deal with the case 2>&1 and 2&>1\n      if (strcmp(redirectionFile.data(), \"_IO_2_1_stdout_\") == 0) {\n        \/\/ If out is redirected to a file.\n        if (!m_MetaProcessor->m_PrevStdoutFileName.empty()) {\n          redirectionFile = m_MetaProcessor->m_PrevStdoutFileName.back();\n        } else {\n          unredirect(m_MetaProcessor->m_backupFDStderr, STDERR_FILENO, stderr);\n        }\n      }\n      redirect(stderr, redirectionFile.str(), kSTDERR);\n    }\n  }\n\n  void MetaProcessor::MaybeRedirectOutputRAII::redirect(FILE* file,\n                                        const std::string& fileName,\n                                        MetaProcessor::RedirectionScope scope) {\n    if (!fileName.empty()) {\n      FILE* redirectionFile = freopen(fileName.c_str(), \"a\", file);\n      if (!redirectionFile) {\n        llvm::errs()<<\"cling::MetaProcessor::MaybeRedirectOutputRAII::redirect:\"\n                    \" Not succefully reopened the redirection file \"\n                    << fileName.c_str() << \"\\n.\";\n      } else {\n        m_isCurrentlyRedirecting |= scope;\n      }\n    }\n  }\n\n  void MetaProcessor::MaybeRedirectOutputRAII::pop() {\n    if (m_isCurrentlyRedirecting & kSTDOUT) {\n      unredirect(m_MetaProcessor->m_backupFDStdout, STDOUT_FILENO, stdout);\n    }\n    if (m_isCurrentlyRedirecting & kSTDERR) {\n      unredirect(m_MetaProcessor->m_backupFDStderr, STDERR_FILENO, stderr);\n    }\n  }\n\n  void MetaProcessor::MaybeRedirectOutputRAII::unredirect(int backupFD,\n                                                          int expectedFD,\n                                                          FILE* file) {\n    \/\/ Switch back to previous file after line is processed.\n\n    \/\/ Flush the current content if there is any.\n    if (!feof(file)) {\n      fflush(file);\n    }\n    \/\/ Copy the original fd for the std.\n    if (dup2(backupFD, expectedFD) != expectedFD) {\n        llvm::errs() << \"cling::MetaProcessor::unredirect \"\n                     << \"The unredirection file descriptor not valid \"\n                     << backupFD << \".\\n\";\n    }\n  }\n\n  MetaProcessor::MetaProcessor(Interpreter& interp, raw_ostream& outs)\n    : m_Interp(interp), m_Outs(&outs) {\n    m_InputValidator.reset(new InputValidator());\n    m_MetaParser.reset(new MetaParser(new MetaSema(interp, *this)));\n    m_backupFDStdout = copyFileDescriptor(STDOUT_FILENO);\n    m_backupFDStderr = copyFileDescriptor(STDERR_FILENO);\n  }\n\n  MetaProcessor::~MetaProcessor() {}\n\n  int MetaProcessor::process(const char* input_text,\n                             Interpreter::CompilationResult& compRes,\n                             Value* result) {\n    if (result)\n      *result = Value();\n    compRes = Interpreter::kSuccess;\n    int expectedIndent = m_InputValidator->getExpectedIndent();\n\n    if (expectedIndent)\n      compRes = Interpreter::kMoreInputExpected;\n    if (!input_text || !input_text[0]) {\n      \/\/ nullptr \/ empty string, nothing to do.\n      return expectedIndent;\n    }\n    std::string input_line(input_text);\n    if (input_line == \"\\n\") { \/\/ just a blank line, nothing to do.\n      return expectedIndent;\n    }\n    \/\/  Check for and handle meta commands.\n    m_MetaParser->enterNewInputLine(input_line);\n    MetaSema::ActionResult actionResult = MetaSema::AR_Success;\n    if (m_MetaParser->isMetaCommand(actionResult, result)) {\n\n      if (m_MetaParser->isQuitRequested())\n        return -1;\n\n      if (actionResult != MetaSema::AR_Success)\n        compRes = Interpreter::kFailure;\n       \/\/ ExpectedIndent might have changed after meta command.\n       return m_InputValidator->getExpectedIndent();\n    }\n\n    \/\/ Check if the current statement is now complete. If not, return to\n    \/\/ prompt for more.\n    if (m_InputValidator->validate(input_line) == InputValidator::kIncomplete) {\n      compRes = Interpreter::kMoreInputExpected;\n      return m_InputValidator->getExpectedIndent();\n    }\n\n    \/\/  We have a complete statement, compile and execute it.\n    std::string input = m_InputValidator->getInput();\n    m_InputValidator->reset();\n    \/\/ if (m_Options.RawInput)\n    \/\/   compResLocal = m_Interp.declare(input);\n    \/\/ else\n    compRes = m_Interp.process(input, result);\n\n    return 0;\n  }\n\n  void MetaProcessor::cancelContinuation() const {\n    m_InputValidator->reset();\n  }\n\n  int MetaProcessor::getExpectedIndent() const {\n    return m_InputValidator->getExpectedIndent();\n  }\n\n  Interpreter::CompilationResult\n  MetaProcessor::readInputFromFile(llvm::StringRef filename,\n                                   Value* result,\n                                   bool ignoreOutmostBlock \/*=false*\/) {\n\n    {\n      \/\/ check that it's not binary:\n      std::ifstream in(filename.str().c_str(), std::ios::in | std::ios::binary);\n      char magic[1024] = {0};\n      in.read(magic, sizeof(magic));\n      size_t readMagic = in.gcount();\n      if (readMagic >= 4) {\n        llvm::StringRef magicStr(magic,in.gcount());\n        llvm::sys::fs::file_magic fileType\n          = llvm::sys::fs::identify_magic(magicStr);\n        if (fileType != llvm::sys::fs::file_magic::unknown) {\n          llvm::errs() << \"Error in cling::MetaProcessor: \"\n            \"cannot read input from a binary file!\\n\";\n          return Interpreter::kFailure;\n        }\n        unsigned printable = 0;\n        for (size_t i = 0; i < readMagic; ++i)\n          if (isprint(magic[i]))\n            ++printable;\n        if (10 * printable <  5 * readMagic) {\n          \/\/ 50% printable for ASCII files should be a safe guess.\n          llvm::errs() << \"Error in cling::MetaProcessor: \"\n            \"cannot read input from a (likely) binary file!\\n\" << printable;\n          return Interpreter::kFailure;\n        }\n      }\n    }\n\n    std::ifstream in(filename.str().c_str());\n    in.seekg(0, std::ios::end);\n    size_t size = in.tellg();\n    std::string content(size, ' ');\n    in.seekg(0);\n    in.read(&content[0], size);\n\n    if (ignoreOutmostBlock && !content.empty()) {\n      static const char whitespace[] = \" \\t\\r\\n\";\n      std::string::size_type posNonWS = content.find_first_not_of(whitespace);\n      \/\/ Handle comments before leading {\n      while (content[posNonWS] == '\/' && content[posNonWS+1] == '\/') {\n        \/\/ Remove the comment line\n        posNonWS = content.find_first_of('\\n', posNonWS+2)+1;\n      }\n      std::string::size_type replaced = posNonWS;\n      if (posNonWS != std::string::npos) {\n        if (content[posNonWS] == '{') {\n          \/\/ hide the curly brace:\n          content[posNonWS] = ' ';\n          \/\/ and the matching closing '}'\n          posNonWS = content.find_last_not_of(whitespace);\n          if (posNonWS != std::string::npos) {\n            if (content[posNonWS] == ';' && content[posNonWS-1] == '}') {\n              content[posNonWS--] = ' '; \/\/ replace ';' and enter next if\n            }\n            if (content[posNonWS] == '}') {\n              content[posNonWS] = ' '; \/\/ replace '}'\n            } else {\n              std::string::size_type posBlockClose = content.find_last_of('}');\n              if (posBlockClose != std::string::npos) {\n                content[posBlockClose] = ' '; \/\/ replace '}'\n              }\n              std::string::size_type posComment\n                = content.find_first_not_of(whitespace, posComment);\n              if (posComment != std::string::npos) {\n                if (content[posComment] == '\/' && content[posComment+1] == '\/') {\n                  \/\/ More text (comments) are okay after the last '}', but\n                  \/\/ we can not easily find it to remove it (so we need to upgrade\n                  \/\/ this code to better handle the case with comments or\n                  \/\/ preprocessor code before and after the leading { and\n                  \/\/ trailing })\n                  while (posComment <= posNonWS) {\n                    content[posComment++] = ' '; \/\/ replace '}' and comment\n                  }\n                } else {\n                  content[replaced] = '{';\n                  \/\/ By putting the '{' back, we keep the code as consistent as\n                  \/\/ the user wrote it ... but we should still warn that we not\n                  \/\/ goint to treat this file an unamed macro.\n                  llvm::errs()\n                  << \"Warning in cling::MetaProcessor: can not find the closing '}', \"\n                  << llvm::sys::path::filename(filename)\n                  << \" is not handled as an unamed script!\\n\";\n                } \/\/ did not find '}''\n              } \/\/ no whitespace\n            } \/\/ remove comments after the trailing '}'\n          } \/\/ find '}'\n        } \/\/ have '{'\n      } \/\/ have non-whitespace\n    } \/\/ ignore outmost block\n\n    std::string strFilename(filename.str());\n    m_CurrentlyExecutingFile = strFilename;\n    bool topmost = !m_TopExecutingFile.data();\n    if (topmost)\n      m_TopExecutingFile = m_CurrentlyExecutingFile;\n    Interpreter::CompilationResult ret;\n    \/\/ We don't want to value print the results of a unnamed macro.\n    content = \"#line 2 \\\"\" + filename.str() + \"\\\" \\n\" + content;\n    if (process((content + \";\").c_str(), ret, result)) {\n      \/\/ Input file has to be complete.\n       llvm::errs()\n          << \"Error in cling::MetaProcessor: file \"\n          << llvm::sys::path::filename(filename)\n          << \" is incomplete (missing parenthesis or similar)!\\n\";\n      ret = Interpreter::kFailure;\n    }\n    m_CurrentlyExecutingFile = llvm::StringRef();\n    if (topmost)\n      m_TopExecutingFile = llvm::StringRef();\n    return ret;\n  }\n\n  void MetaProcessor::setFileStream(llvm::StringRef file, bool append, int fd,\n              llvm::SmallVector<llvm::SmallString<128>, 2>& prevFileStack) {\n    \/\/ If we have a fileName to redirect to store it.\n    if (!file.empty()) {\n      prevFileStack.push_back(file);\n      \/\/ pop and push a null terminating 0.\n      \/\/ SmallVectorImpl<T> does not have a c_str(), thus instead of casting to\n      \/\/ a SmallString<T> we null terminate the data that we have and pop the\n      \/\/ 0 char back.\n      prevFileStack.back().push_back(0);\n      prevFileStack.back().pop_back();\n      if (!append) {\n        FILE * f;\n        if (!(f = fopen(file.data(), \"w\"))) {\n          llvm::errs() << \"cling::MetaProcessor::setFileStream:\"\n                       \" The file path \" << file.data() << \"is not valid.\";\n        } else {\n          fclose(f);\n        }\n      }\n    \/\/ Else unredirection, so switch to the previous file.\n    } else {\n      \/\/ If there is no previous file on the stack we pop the file\n      if (!prevFileStack.empty()) {\n        prevFileStack.pop_back();\n      }\n    }\n  }\n\n  void MetaProcessor::setStdStream(llvm::StringRef file,\n                                   RedirectionScope stream, bool append) {\n\n    if (stream & kSTDOUT) {\n      setFileStream(file, append, STDOUT_FILENO, m_PrevStdoutFileName);\n    }\n    if (stream & kSTDERR) {\n      setFileStream(file, append, STDERR_FILENO, m_PrevStderrFileName);\n    }\n  }\n\n  int MetaProcessor::copyFileDescriptor(int fd) {\n    int backupFD = dup(fd);\n    if (backupFD < 0) {\n      llvm::errs() << \"MetaProcessor::copyFileDescriptor: Duplicating the file\"\n                   \" descriptor \" << fd << \"resulted in an error.\"\n                   \" Will not be able to unredirect.\";\n    }\n    return backupFD;\n  }\n\n  void MetaProcessor::registerUnloadPoint(const Transaction* T,\n                                          llvm::StringRef filename) {\n    m_MetaParser->getActions().registerUnloadPoint(T, filename);\n  }\n\n} \/\/ end namespace cling\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n\n  SSL Context management\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#include \"ink_config.h\"\n\n#include \"P_SSLCertLookup.h\"\n#include \"P_SSLUtils.h\"\n#include \"P_SSLConfig.h\"\n#include \"I_EventSystem.h\"\n#include \"I_Layout.h\"\n#include \"Regex.h\"\n#include \"Trie.h\"\n#include \"ts\/TestBox.h\"\n\nstruct SSLAddressLookupKey\n{\n  explicit\n  SSLAddressLookupKey(const IpEndpoint& ip) : sep(0)\n  {\n    static const char hextab[16] = {\n      '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'\n    };\n\n    int nbytes;\n    uint16_t port = ntohs(ip.port());\n\n    \/\/ For IP addresses, the cache key is the hex address with the port concatenated. This makes the lookup\n    \/\/ insensitive to address formatting and also allow the longest match semantic to produce different matches\n    \/\/ if there is a certificate on the port.\n    nbytes = ats_ip_to_hex(&ip.sa, key, sizeof(key));\n    if (port) {\n      sep = nbytes;\n      key[nbytes++] = '.';\n      key[nbytes++] = hextab[ (port >> 12) & 0x000F ];\n      key[nbytes++] = hextab[ (port >>  8) & 0x000F ];\n      key[nbytes++] = hextab[ (port >>  4) & 0x000F ];\n      key[nbytes++] = hextab[ (port      ) & 0x000F ];\n    }\n    key[nbytes++] = 0;\n  }\n\n  const char * get() const { return key; }\n  void split() { key[sep] = '\\0'; }\n  void unsplit() { key[sep] = '.'; }\n\nprivate:\n  char key[(TS_IP6_SIZE * 2) \/* hex addr *\/ + 1 \/* dot *\/ + 4 \/* port *\/ + 1 \/* NULL *\/];\n  unsigned char sep; \/\/ offset of address\/port separator\n};\n\nstruct SSLContextStorage\n{\npublic:\n  SSLContextStorage();\n  ~SSLContextStorage();\n\n  \/\/\/ Add a cert context to storage\n  \/\/\/ @return The @a host_store index or -1 on error.\n  int insert(const char * name, SSLCertContext const& cc);\n  \/\/\/ Add a cert context to storage.\n  \/\/\/ @a idx must be a value returned by a previous call to insert.\n  \/\/\/ This creates an alias, a different @a name referring to the same\n  \/\/\/ cert context.\n  \/\/\/ @return @a idx\n  int insert(const char * name, int idx);\n  SSLCertContext* lookup(const char * name) const;\n  unsigned count() const { return this->ctx_store.length(); }\n  SSLCertContext* get(unsigned i) const { return &this->ctx_store[i]; }\n\nprivate:\n  \/** A struct that can stored a @c Trie.\n      It contains the index of the real certificate and the\n      linkage required by @c Trie.\n  *\/\n  struct ContextRef \n  {\n    ContextRef(): idx(-1) {}\n    explicit ContextRef(int n) : idx(n) {}\n    void Print() const { Debug(\"ssl\", \"Item=%p SSL_CTX=#%d\", this, idx); }\n    int idx; \/\/\/< Index in the context store.\n    LINK(ContextRef, link); \/\/\/< Require by @c Trie\n  };\n\n  \/\/\/ Items tored by wildcard name\n  Trie<ContextRef>  wildcards;\n  \/\/\/ Contexts store by IP address or FQDN\n  InkHashTable *  hostnames;\n  \/\/\/ List for cleanup.\n  \/\/\/ Exactly one pointer to each SSL context is stored here.\n  Vec<SSLCertContext>  ctx_store;\n\n  \/\/\/ Add a context to the clean up list.\n  \/\/\/ @return The index of the added context.\n  int store(SSLCertContext const& cc);\n  \/\/\/ Remove last added context\n  void unstore();\n\n};\n\nSSLCertLookup::SSLCertLookup()\n  : ssl_storage(new SSLContextStorage()), ssl_default(NULL)\n{\n}\n\nSSLCertLookup::~SSLCertLookup()\n{\n  delete this->ssl_storage;\n}\n\nSSLCertContext *\nSSLCertLookup::find(const char * address) const\n{\n  return this->ssl_storage->lookup(address);\n}\n\nSSLCertContext *\nSSLCertLookup::find(const IpEndpoint& address) const\n{\n  SSLCertContext * cc;\n  SSLAddressLookupKey key(address);\n\n  \/\/ First try the full address.\n  if ((cc = this->ssl_storage->lookup(key.get()))) {\n    return cc;\n  }\n\n  \/\/ If that failed, try the address without the port.\n  if (address.port()) {\n    key.split();\n    return this->ssl_storage->lookup(key.get());\n  }\n\n  return NULL;\n}\n\nint\nSSLCertLookup::insert(const char *name, SSLCertContext const &cc)\n{\n  return this->ssl_storage->insert(name, cc);\n}\n\nint\nSSLCertLookup::insert(const IpEndpoint& address, SSLCertContext const &cc)\n{\n  SSLAddressLookupKey key(address);\n  return this->ssl_storage->insert(key.get(), cc);\n}\n\nunsigned\nSSLCertLookup::count() const\n{\n  return ssl_storage->count();\n}\n\nSSLCertContext *\nSSLCertLookup::get(unsigned i) const\n{\n  return ssl_storage->get(i);\n}\n\nstruct ats_wildcard_matcher\n{\n  ats_wildcard_matcher() {\n    if (regex.compile(\"^\\\\*\\\\.[^\\\\*.]+\") != 0) {\n      Fatal(\"failed to compile TLS wildcard matching regex\");\n    }\n  }\n\n  ~ats_wildcard_matcher() {\n  }\n\n  bool match(const char * hostname) const {\n    return regex.match(hostname) != -1;\n  }\n\nprivate:\n  DFA regex;\n};\n\nstatic char *\nreverse_dns_name(const char * hostname, char (&reversed)[TS_MAX_HOST_NAME_LEN+1])\n{\n  char * ptr = reversed + sizeof(reversed);\n  const char * part = hostname;\n\n  *(--ptr) = '\\0'; \/\/ NUL-terminate\n\n  while (*part) {\n    ssize_t len = strcspn(part, \".\");\n    ssize_t remain = ptr - reversed;\n\n    if (remain < (len + 1)) {\n      return NULL;\n    }\n\n    ptr -= len;\n    memcpy(ptr, part, len);\n\n    \/\/ Skip to the next domain component. This will take us to either a '.' or a NUL.\n    \/\/ If it's a '.' we need to skip over it.\n    part += len;\n    if (*part == '.') {\n      ++part;\n      *(--ptr) = '.';\n    }\n  }\n\n  return ptr;\n}\n\nSSLContextStorage::SSLContextStorage()\n  :wildcards(), hostnames(ink_hash_table_create(InkHashTableKeyType_String))\n{\n}\n\nSSLContextStorage::~SSLContextStorage()\n{\n  for (unsigned i = 0; i < this->ctx_store.length(); ++i) {\n    SSLReleaseContext(this->ctx_store[i].ctx);\n  }\n\n  ink_hash_table_destroy(this->hostnames);\n}\n\nint\nSSLContextStorage::store(SSLCertContext const& cc)\n{\n  int idx = this->ctx_store.length();\n  this->ctx_store.add(cc);\n  return idx;\n}\n\nvoid\nSSLContextStorage::unstore()\n{\n  this->ctx_store.drop();\n}\n\nint\nSSLContextStorage::insert(const char* name, SSLCertContext const& cc)\n{\n  int idx = this->store(cc);\n  idx = this->insert(name, idx);\n  if (idx < 0) this->unstore();\n  return idx;\n}\n\nint \nSSLContextStorage::insert(const char* name, int idx) \n{\n  ats_wildcard_matcher wildcard;\n  bool inserted = false;\n\n  if (wildcard.match(name)) {\n    \/\/ We turn wildcards into the reverse DNS form, then insert them into the trie\n    \/\/ so that we can do a longest match lookup.\n    char namebuf[TS_MAX_HOST_NAME_LEN + 1];\n    char * reversed;\n    ats_scoped_obj<ContextRef> ref;\n\n    reversed = reverse_dns_name(name + 1, namebuf);\n    if (!reversed) {\n      Error(\"wildcard name '%s' is too long\", name);\n      return -1;\n    }\n\n    ref = new ContextRef(idx);\n    inserted = this->wildcards.Insert(reversed, ref, 0 \/* rank *\/, -1 \/* keylen *\/);\n    if (!inserted) {\n      ContextRef * found;\n\n      \/\/ We fail to insert, so the longest wildcard match search should return the full match value.\n      found = this->wildcards.Search(reversed);\n      \/\/ Fail even if we are reinserting the exact same value\n      \/\/ Otherwise we cannot detect and recover from a doupble insert\n      \/\/ into the references array\n      \/\/if (found != NULL && found->idx != idx) {\n      if (found != NULL) {\n        Warning(\"previously indexed wildcard certificate for '%s' as '%s', cannot index it with SSL_CTX #%d now\",\n            name, reversed, idx);\n      }\n      idx = -1;\n    }\n\n    Debug(\"ssl\", \"%s wildcard certificate for '%s' as '%s' with SSL_CTX %p [%d]\", \n      idx >= 0 ? \"index\" : \"failed to index\", name, reversed, this->ctx_store[(*ref).idx].ctx, (*ref).idx);\n    ref.release();\n  } else {\n    InkHashTableValue value;\n\n    if (ink_hash_table_lookup(this->hostnames, name, &value) && reinterpret_cast<InkHashTableValue>(idx) != value) {\n      Warning(\"previously indexed '%s' with SSL_CTX %p, cannot index it with SSL_CTX #%d now\", name, value, idx);\n      idx = -1;\n    } else {\n      inserted = true;\n      ink_hash_table_insert(this->hostnames, name, reinterpret_cast<void*>(static_cast<intptr_t>(idx)));\n      Debug(\"ssl\", \"indexed '%s' with SSL_CTX %p [%d]\", \n        name, this->ctx_store[idx].ctx, idx);\n    }\n  }\n  return idx;\n}\n\nSSLCertContext *\nSSLContextStorage::lookup(const char * name) const\n{\n  InkHashTableValue value;\n\n  if (ink_hash_table_lookup(const_cast<InkHashTable *>(this->hostnames), name, &value)) {\n    return &(this->ctx_store[reinterpret_cast<intptr_t>(value)]);\n  }\n\n  if (!this->wildcards.Empty()) {\n    char namebuf[TS_MAX_HOST_NAME_LEN + 1];\n    char * reversed;\n    ContextRef * ref;\n\n    reversed = reverse_dns_name(name, namebuf);\n    if (!reversed) {\n      Error(\"failed to reverse hostname name '%s' is too long\", name);\n      return NULL;\n    }\n\n    Debug(\"ssl\", \"attempting wildcard match for %s\", reversed);\n    ref = this->wildcards.Search(reversed);\n    if (ref) {\n      return &(this->ctx_store[ref->idx]);\n    }\n  }\n\n  return NULL;\n}\n\n#if TS_HAS_TESTS\n\nREGRESSION_TEST(SSLWildcardMatch)(RegressionTest * t, int \/* atype ATS_UNUSED *\/, int * pstatus)\n{\n  TestBox box(t, pstatus);\n  ats_wildcard_matcher wildcard;\n\n  box = REGRESSION_TEST_PASSED;\n\n  box.check(wildcard.match(\"foo.com\") == false, \"foo.com is not a wildcard\");\n  box.check(wildcard.match(\"*.foo.com\") == true, \"*.foo.com not a wildcard\");\n  box.check(wildcard.match(\"bar*.foo.com\") == false, \"bar*.foo.com not a wildcard\");\n  box.check(wildcard.match(\"*\") == false, \"* is not a wildcard\");\n  box.check(wildcard.match(\"\") == false, \"'' is not a wildcard\");\n}\n\nREGRESSION_TEST(SSLReverseHostname)(RegressionTest * t, int \/* atype ATS_UNUSED *\/, int * pstatus)\n{\n  TestBox box(t, pstatus);\n\n  char reversed[TS_MAX_HOST_NAME_LEN + 1];\n\n#define _R(name) reverse_dns_name(name, reversed)\n\n  box = REGRESSION_TEST_PASSED;\n\n  box.check(strcmp(_R(\"foo.com\"), \"com.foo\") == 0, \"reversed foo.com\");\n  box.check(strcmp(_R(\"bar.foo.com\"), \"com.foo.bar\") == 0, \"reversed bar.foo.com\");\n  box.check(strcmp(_R(\"foo\"), \"foo\") == 0, \"reversed foo\");\n\n#undef _R\n}\n\n#endif \/\/ TS_HAS_TESTS\n<commit_msg>Clean up whitespace<commit_after>\/** @file\n\n  SSL Context management\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#include \"ink_config.h\"\n\n#include \"P_SSLCertLookup.h\"\n#include \"P_SSLUtils.h\"\n#include \"P_SSLConfig.h\"\n#include \"I_EventSystem.h\"\n#include \"I_Layout.h\"\n#include \"Regex.h\"\n#include \"Trie.h\"\n#include \"ts\/TestBox.h\"\n\nstruct SSLAddressLookupKey\n{\n  explicit\n  SSLAddressLookupKey(const IpEndpoint& ip) : sep(0)\n  {\n    static const char hextab[16] = {\n      '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'\n    };\n\n    int nbytes;\n    uint16_t port = ntohs(ip.port());\n\n    \/\/ For IP addresses, the cache key is the hex address with the port concatenated. This makes the lookup\n    \/\/ insensitive to address formatting and also allow the longest match semantic to produce different matches\n    \/\/ if there is a certificate on the port.\n    nbytes = ats_ip_to_hex(&ip.sa, key, sizeof(key));\n    if (port) {\n      sep = nbytes;\n      key[nbytes++] = '.';\n      key[nbytes++] = hextab[ (port >> 12) & 0x000F ];\n      key[nbytes++] = hextab[ (port >>  8) & 0x000F ];\n      key[nbytes++] = hextab[ (port >>  4) & 0x000F ];\n      key[nbytes++] = hextab[ (port      ) & 0x000F ];\n    }\n    key[nbytes++] = 0;\n  }\n\n  const char * get() const { return key; }\n  void split() { key[sep] = '\\0'; }\n  void unsplit() { key[sep] = '.'; }\n\nprivate:\n  char key[(TS_IP6_SIZE * 2) \/* hex addr *\/ + 1 \/* dot *\/ + 4 \/* port *\/ + 1 \/* NULL *\/];\n  unsigned char sep; \/\/ offset of address\/port separator\n};\n\nstruct SSLContextStorage\n{\npublic:\n  SSLContextStorage();\n  ~SSLContextStorage();\n\n  \/\/\/ Add a cert context to storage\n  \/\/\/ @return The @a host_store index or -1 on error.\n  int insert(const char * name, SSLCertContext const& cc);\n\n  \/\/\/ Add a cert context to storage.\n  \/\/\/ @a idx must be a value returned by a previous call to insert.\n  \/\/\/ This creates an alias, a different @a name referring to the same\n  \/\/\/ cert context.\n  \/\/\/ @return @a idx\n  int insert(const char * name, int idx);\n  SSLCertContext* lookup(const char * name) const;\n  unsigned count() const { return this->ctx_store.length(); }\n  SSLCertContext* get(unsigned i) const { return &this->ctx_store[i]; }\n\nprivate:\n  \/** A struct that can be stored a @c Trie.\n      It contains the index of the real certificate and the\n      linkage required by @c Trie.\n  *\/\n  struct ContextRef\n  {\n    ContextRef(): idx(-1) {}\n    explicit ContextRef(int n) : idx(n) {}\n    void Print() const { Debug(\"ssl\", \"Item=%p SSL_CTX=#%d\", this, idx); }\n    int idx; \/\/\/< Index in the context store.\n    LINK(ContextRef, link); \/\/\/< Require by @c Trie\n  };\n\n  \/\/\/ Items tored by wildcard name\n  Trie<ContextRef>  wildcards;\n  \/\/\/ Contexts stored by IP address or FQDN\n  InkHashTable *  hostnames;\n  \/\/\/ List for cleanup.\n  \/\/\/ Exactly one pointer to each SSL context is stored here.\n  Vec<SSLCertContext>  ctx_store;\n\n  \/\/\/ Add a context to the clean up list.\n  \/\/\/ @return The index of the added context.\n  int store(SSLCertContext const& cc);\n  \/\/\/ Remove last added context\n  void unstore();\n\n};\n\nSSLCertLookup::SSLCertLookup()\n  : ssl_storage(new SSLContextStorage()), ssl_default(NULL)\n{\n}\n\nSSLCertLookup::~SSLCertLookup()\n{\n  delete this->ssl_storage;\n}\n\nSSLCertContext *\nSSLCertLookup::find(const char * address) const\n{\n  return this->ssl_storage->lookup(address);\n}\n\nSSLCertContext *\nSSLCertLookup::find(const IpEndpoint& address) const\n{\n  SSLCertContext * cc;\n  SSLAddressLookupKey key(address);\n\n  \/\/ First try the full address.\n  if ((cc = this->ssl_storage->lookup(key.get()))) {\n    return cc;\n  }\n\n  \/\/ If that failed, try the address without the port.\n  if (address.port()) {\n    key.split();\n    return this->ssl_storage->lookup(key.get());\n  }\n\n  return NULL;\n}\n\nint\nSSLCertLookup::insert(const char *name, SSLCertContext const &cc)\n{\n  return this->ssl_storage->insert(name, cc);\n}\n\nint\nSSLCertLookup::insert(const IpEndpoint& address, SSLCertContext const &cc)\n{\n  SSLAddressLookupKey key(address);\n  return this->ssl_storage->insert(key.get(), cc);\n}\n\nunsigned\nSSLCertLookup::count() const\n{\n  return ssl_storage->count();\n}\n\nSSLCertContext *\nSSLCertLookup::get(unsigned i) const\n{\n  return ssl_storage->get(i);\n}\n\nstruct ats_wildcard_matcher\n{\n  ats_wildcard_matcher() {\n    if (regex.compile(\"^\\\\*\\\\.[^\\\\*.]+\") != 0) {\n      Fatal(\"failed to compile TLS wildcard matching regex\");\n    }\n  }\n\n  ~ats_wildcard_matcher() {\n  }\n\n  bool match(const char * hostname) const {\n    return regex.match(hostname) != -1;\n  }\n\nprivate:\n  DFA regex;\n};\n\nstatic char *\nreverse_dns_name(const char * hostname, char (&reversed)[TS_MAX_HOST_NAME_LEN+1])\n{\n  char * ptr = reversed + sizeof(reversed);\n  const char * part = hostname;\n\n  *(--ptr) = '\\0'; \/\/ NUL-terminate\n\n  while (*part) {\n    ssize_t len = strcspn(part, \".\");\n    ssize_t remain = ptr - reversed;\n\n    if (remain < (len + 1)) {\n      return NULL;\n    }\n\n    ptr -= len;\n    memcpy(ptr, part, len);\n\n    \/\/ Skip to the next domain component. This will take us to either a '.' or a NUL.\n    \/\/ If it's a '.' we need to skip over it.\n    part += len;\n    if (*part == '.') {\n      ++part;\n      *(--ptr) = '.';\n    }\n  }\n\n  return ptr;\n}\n\nSSLContextStorage::SSLContextStorage()\n  :wildcards(), hostnames(ink_hash_table_create(InkHashTableKeyType_String))\n{\n}\n\nSSLContextStorage::~SSLContextStorage()\n{\n  for (unsigned i = 0; i < this->ctx_store.length(); ++i) {\n    SSLReleaseContext(this->ctx_store[i].ctx);\n  }\n\n  ink_hash_table_destroy(this->hostnames);\n}\n\nint\nSSLContextStorage::store(SSLCertContext const& cc)\n{\n  int idx = this->ctx_store.length();\n  this->ctx_store.add(cc);\n  return idx;\n}\n\nvoid\nSSLContextStorage::unstore()\n{\n  this->ctx_store.drop();\n}\n\nint\nSSLContextStorage::insert(const char* name, SSLCertContext const& cc)\n{\n  int idx = this->store(cc);\n  idx = this->insert(name, idx);\n  if (idx < 0) this->unstore();\n  return idx;\n}\n\nint\nSSLContextStorage::insert(const char* name, int idx)\n{\n  ats_wildcard_matcher wildcard;\n  bool inserted = false;\n\n  if (wildcard.match(name)) {\n    \/\/ We turn wildcards into the reverse DNS form, then insert them into the trie\n    \/\/ so that we can do a longest match lookup.\n    char namebuf[TS_MAX_HOST_NAME_LEN + 1];\n    char * reversed;\n    ats_scoped_obj<ContextRef> ref;\n\n    reversed = reverse_dns_name(name + 1, namebuf);\n    if (!reversed) {\n      Error(\"wildcard name '%s' is too long\", name);\n      return -1;\n    }\n\n    ref = new ContextRef(idx);\n    inserted = this->wildcards.Insert(reversed, ref, 0 \/* rank *\/, -1 \/* keylen *\/);\n    if (!inserted) {\n      ContextRef * found;\n\n      \/\/ We fail to insert, so the longest wildcard match search should return the full match value.\n      found = this->wildcards.Search(reversed);\n      \/\/ Fail even if we are reinserting the exact same value\n      \/\/ Otherwise we cannot detect and recover from a doupble insert\n      \/\/ into the references array\n      \/\/if (found != NULL && found->idx != idx) {\n      if (found != NULL) {\n        Warning(\"previously indexed wildcard certificate for '%s' as '%s', cannot index it with SSL_CTX #%d now\",\n            name, reversed, idx);\n      }\n      idx = -1;\n    }\n\n    Debug(\"ssl\", \"%s wildcard certificate for '%s' as '%s' with SSL_CTX %p [%d]\",\n      idx >= 0 ? \"index\" : \"failed to index\", name, reversed, this->ctx_store[(*ref).idx].ctx, (*ref).idx);\n    ref.release();\n  } else {\n    InkHashTableValue value;\n\n    if (ink_hash_table_lookup(this->hostnames, name, &value) && reinterpret_cast<InkHashTableValue>(idx) != value) {\n      Warning(\"previously indexed '%s' with SSL_CTX %p, cannot index it with SSL_CTX #%d now\", name, value, idx);\n      idx = -1;\n    } else {\n      inserted = true;\n      ink_hash_table_insert(this->hostnames, name, reinterpret_cast<void*>(static_cast<intptr_t>(idx)));\n      Debug(\"ssl\", \"indexed '%s' with SSL_CTX %p [%d]\",\n        name, this->ctx_store[idx].ctx, idx);\n    }\n  }\n  return idx;\n}\n\nSSLCertContext *\nSSLContextStorage::lookup(const char * name) const\n{\n  InkHashTableValue value;\n\n  if (ink_hash_table_lookup(const_cast<InkHashTable *>(this->hostnames), name, &value)) {\n    return &(this->ctx_store[reinterpret_cast<intptr_t>(value)]);\n  }\n\n  if (!this->wildcards.Empty()) {\n    char namebuf[TS_MAX_HOST_NAME_LEN + 1];\n    char * reversed;\n    ContextRef * ref;\n\n    reversed = reverse_dns_name(name, namebuf);\n    if (!reversed) {\n      Error(\"failed to reverse hostname name '%s' is too long\", name);\n      return NULL;\n    }\n\n    Debug(\"ssl\", \"attempting wildcard match for %s\", reversed);\n    ref = this->wildcards.Search(reversed);\n    if (ref) {\n      return &(this->ctx_store[ref->idx]);\n    }\n  }\n\n  return NULL;\n}\n\n#if TS_HAS_TESTS\n\nREGRESSION_TEST(SSLWildcardMatch)(RegressionTest * t, int \/* atype ATS_UNUSED *\/, int * pstatus)\n{\n  TestBox box(t, pstatus);\n  ats_wildcard_matcher wildcard;\n\n  box = REGRESSION_TEST_PASSED;\n\n  box.check(wildcard.match(\"foo.com\") == false, \"foo.com is not a wildcard\");\n  box.check(wildcard.match(\"*.foo.com\") == true, \"*.foo.com not a wildcard\");\n  box.check(wildcard.match(\"bar*.foo.com\") == false, \"bar*.foo.com not a wildcard\");\n  box.check(wildcard.match(\"*\") == false, \"* is not a wildcard\");\n  box.check(wildcard.match(\"\") == false, \"'' is not a wildcard\");\n}\n\nREGRESSION_TEST(SSLReverseHostname)(RegressionTest * t, int \/* atype ATS_UNUSED *\/, int * pstatus)\n{\n  TestBox box(t, pstatus);\n\n  char reversed[TS_MAX_HOST_NAME_LEN + 1];\n\n#define _R(name) reverse_dns_name(name, reversed)\n\n  box = REGRESSION_TEST_PASSED;\n\n  box.check(strcmp(_R(\"foo.com\"), \"com.foo\") == 0, \"reversed foo.com\");\n  box.check(strcmp(_R(\"bar.foo.com\"), \"com.foo.bar\") == 0, \"reversed bar.foo.com\");\n  box.check(strcmp(_R(\"foo\"), \"foo\") == 0, \"reversed foo\");\n\n#undef _R\n}\n\n#endif \/\/ TS_HAS_TESTS\n<|endoftext|>"}
{"text":"<commit_before>\n#include <qbitarray.h>\n#include <qbuffer.h>\n#include <qdom.h>\n#include <qfile.h>\n#include <qtextstream.h>\n\n#include <kdebug.h>\n\n#include <eventsyncee.h>\n\n#include \"device.h\"\n#include \"datebook.h\"\n\nusing namespace OpieHelper;\n\nnamespace {\n\/\/ from TT\nint week ( const QDate &start ) {\n    int stop = start.day();\n    int sentinel = start.dayOfWeek();\n    int dayOfWeek = QDate( start.year(),  start.month(),  1 ).dayOfWeek();\n    int week = 1;\n    for ( int i = 1; i < stop; i++ ) {\n        if ( dayOfWeek++ == sentinel )\n            week++;\n        if ( dayOfWeek > 7 )\n            dayOfWeek = 0;\n    }\n    return week;\n}\n\n};\n\nDateBook::DateBook( CategoryEdit* edit,\n                    KSync::KonnectorUIDHelper* helper,\n                    const QString& tz,\n                    bool meta, Device *dev )\n    : Base( edit,  helper,  tz, meta, dev )\n{\n}\nDateBook::~DateBook(){\n}\n\/**\n * Converts an Opie Event to a KDE one\n *\/\nKCal::Event* DateBook::toEvent( QDomElement e) {\n\/\/    kdDebug(522) << \"inside event\" << endl;\n    KCal::Event* event = new KCal::Event();\n    QStringList list = QStringList::split(\";\",  e.attribute(\"categories\") );\n    QStringList categories;\n    for ( uint i = 0; i < list.count(); i++ ) {\n\/\/        kdDebug(5229) << list[i]<< \" categories \" << m_edit->categoryById( list[i],  \"Calendar\") << endl;\n        categories.append(m_edit->categoryById(list[i], \"Calendar\") );\n    }\n    if (!categories.isEmpty() ) {\n        event->setCategories( categories );\n    }\n    \/\/event->setDescription(e.attribute(\"Description\") );\n    event->setSummary( e.attribute(\"description\") );\n    event->setUid( kdeId( \"EventSyncEntry\",  e.attribute(\"uid\") ) );\n    event->setDescription( e.attribute(\"note\") );\n    event->setLocation( e.attribute(\"location\") );\n    \/\/ time\n\n    QString start = e.attribute(\"start\");\n\/\/    kdDebug(5229) << \"Start \" << fromUTC( (time_t) start.toLong() ).toString() << endl;\n    event->setDtStart( fromUTC( (time_t) start.toLong() ) );\n\n    QString end = e.attribute(\"end\");\n\/\/    kdDebug(5229) << \"End \" << fromUTC( (time_t) end.toLong() ).toString() << endl;\n    event->setDtEnd( fromUTC( (time_t) end.toLong() ) );\n\n    \/\/ type\n    if ( e.attribute(\"type\") == \"AllDay\" ) {\n        event->setFloats( true );\n    }else{\n        event->setFloats( false );\n    }\n\n    \/\/ alarm\n    QString alarm = e.attribute(\"alarm\");\n\n    \/* there is an alarm *\/\n    if (!alarm.isEmpty() ) {\n        KCal::Alarm *al = new KCal::Alarm( event );\n        al->setStartOffset( alarm.toInt() * -60 );\n        al->setAudioAlarm( e.attribute(\"sound\") );\n        event->addAlarm( al );\n\n        kdDebug(5229) << \"Alarm offset \" << al->startOffset().asSeconds() << endl;\n        kdDebug(5229) << \"Alarm \" << e.attribute(\"alarm\") << \" \" << e.attribute(\"sound\") << endl;\n    }\n\n\n    \/\/ Recurrence damn I feared to do that\n    QString type = e.attribute(\"rtype\");\n    int freq = e.attribute(\"rfreq\").toInt();\n    bool hasEnd = e.attribute(\"rhasenddate\").toInt();\n    \/\/kdDebug(5229) << \"HasEndDate: \" << hasEnd << endl;\n\n    KCal::Recurrence *rec = event->recurrence();\n    start = e.attribute(\"created\");\n    rec->setRecurStart( fromUTC( (time_t) start.toLong() ) );\n\n    if ( type == \"Daily\" ) {\n        if ( hasEnd ) {\n            start = e.attribute(\"enddt\");\n            rec->setDaily(freq,  fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setDaily( freq,  -1 );\n        }\n        \/\/ weekly\n    }else if ( type == \"Weekly\") {\n        int days = e.attribute(\"rweekdays\").toInt();\n        QBitArray bits( 7 );\n        bits.fill( false );\n        if ( Monday & days )\n            bits.setBit( 0 );\n        if ( Tuesday & days )\n            bits.setBit( 1 );\n        if ( Wednesday & days )\n            bits.setBit( 2 );\n        if ( Thursday & days )\n            bits.setBit( 3 );\n        if ( Friday & days )\n            bits.setBit( 4 );\n        if ( Saturday & days )\n            bits.setBit( 5 );\n        if ( Sunday & days )\n            bits.setBit( 6 );\n\n        if ( hasEnd ) {\n            start = e.attribute(\"enddt\");\n\/\/            kdDebug(5229) << \"has end \" << start << endl;\n            rec->setWeekly( freq,  bits, fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setWeekly( freq,  bits,  -1 );\n        }\n    \/\/ monthly\n    }else if ( type == \"MonthlyDay\" ) {\n        \/\/ monthly day the  1st Saturday of the month\n        int rposition = e.attribute(\"rposition\").toInt();\n        if ( hasEnd ) {\n            start = e.attribute(\"enddt\");\n            rec->setMonthly( KCal::Recurrence::rMonthlyPos,\n                             freq,fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setMonthly( KCal::Recurrence::rMonthlyPos,\n                             freq,  -1 );\n        }\n        QBitArray array( 7);\n        array.fill( false );\n        QDate date = event->dtStart().date();\n        array.setBit( date.dayOfWeek() - 1 );\n        rec->addMonthlyPos( rposition, array );\n\n    }else if ( type == \"MonthlyDate\" ) {\n        \/\/ int rposition = e.attribute(\"rposition\").toInt();\n        if ( hasEnd ) {\n            start = e.attribute(\"enddt\");\n            rec->setMonthly( KCal::Recurrence::rMonthlyDay,\n                             freq,fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setMonthly( KCal::Recurrence::rMonthlyDay,\n                             freq,  -1 );\n        }\n        QDate date = event->dtStart().date();\n        rec->addMonthlyDay( date.day() );\n\n    }else if ( type == \"Yearly\" ) {\n        if (hasEnd ) {\n            start = e.attribute(\"enddt\");\n            rec->setYearly( KCal::Recurrence::rYearlyDay,\n                            freq,\n                            fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setYearly( KCal::Recurrence::rYearlyDay,\n                            freq, -1 );\n        }\n        rec->addYearlyNum( event->dtStart().date().dayOfYear() );\n    }\n    return event;\n}\n\nKSync::EventSyncee* DateBook::toKDE( const QString& fileName )\n{\n\/\/    kdDebug(5229) << \"To KDE \" << endl;\n    KSync::EventSyncee* syncee = new KSync::EventSyncee();\n    if( device() )\n\tsyncee->setSupports( device()->supports( Device::Calendar ) );\n\n    QFile file( fileName );\n    if ( file.open( IO_ReadOnly ) ) {\n        \/\/kdDebug(5229) << \"file open\" << endl;\n        QDomDocument doc(\"mydocument\");\n        if ( doc.setContent( &file ) ) {\n\/\/            kdDebug(5229) << \"setContent\" << endl;\n            QDomElement docElem = doc.documentElement();\n\/\/            kdDebug(5229) << \"TagName docElem \" << docElem.tagName() << endl;\n            QDomNode n = docElem.firstChild();\n            QString dummy;\n            while (!n.isNull() ) {\n                QDomElement el = n.toElement();\n                if (!el.isNull() ) {\n\/\/                    kdDebug(5229) << \"e \" << el.tagName() << endl;\n\/\/                    kdDebug(5229) << \"e.isNull not\" << endl;\n\n                    if ( el.tagName() == \"events\") {\n\n                        QDomNode no = el.firstChild();\n                        while (!no.isNull() ) {\n                            QDomElement e = no.toElement();\n\n                            if (!e.isNull() ) {\n                                if (e.tagName() == \"event\") {\n                                    KCal::Event* event = toEvent( e );\n                                    if (event != 0 ) {\n                                        KSync::EventSyncEntry* entry;\n                                        entry = new KSync::EventSyncEntry( event );\n                                        syncee->addEntry( entry );\n                                    }\n                                }\n                            }\n                            no = no.nextSibling();\n                        }\n                    }\n                    n = n.nextSibling();\n                }\/\/ n.isNULL\n            }\n        }\n    }\n    return syncee;\n}\n\nKTempFile* DateBook::fromKDE( KSync::EventSyncee* syncee )\n{\n    m_kde2opie.clear();\n    Kontainer::ValueList newIds = syncee->ids( \"EventSyncEntry\");\n    Kontainer::ValueList::ConstIterator idIt;\n    for ( idIt = newIds.begin(); idIt != newIds.end(); ++idIt ) {\n        m_helper->addId(\"EventSyncEntry\",  (*idIt).first(),  (*idIt).second() );\n    }\n    KTempFile* tempFile = file();\n    if ( tempFile->textStream() ) {\n        QTextStream *stream = tempFile->textStream();\n        stream->setEncoding( QTextStream::UnicodeUTF8 );\n        *stream <<\"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\" << endl;\n        *stream << \"<!DOCTYPE DATEBOOK><DATEBOOK>\" << endl;\n        KSync::EventSyncEntry *entry;\n        KCal::Event *event;\n        *stream << \"<events>\" << endl;\n        for ( entry = (KSync::EventSyncEntry*) syncee->firstEntry();\n              entry != 0;\n              entry = (KSync::EventSyncEntry*) syncee->nextEntry() )\n        {\n            if (entry->state() == KSync::SyncEntry::Removed )\n                continue;\n            event = entry->incidence();\n            *stream << event2string( event ) << endl;\n        }\n        *stream << \"<\/events>\" << endl;\n        *stream << \"<\/DATEBOOK>\" << endl;\n\n    }\n    if (m_helper )\n        m_helper->replaceIds( \"EventSyncEntry\",  m_kde2opie );\n\n    tempFile->close();\n    return tempFile;\n}\nQString DateBook::event2string( KCal::Event *event )\n{\n    QString str;\n    str.append( \"<event \");\n    str.append( \"description=\\\"\" +escape( event->summary() ) + \"\\\" \");\n    str.append( \"location=\\\"\" + escape( event->location() ) + \"\\\" \");\n    str.append( \"categories=\\\"\" +  categoriesToNumber( event->categories() ) + \"\\\" \");\n    str.append( \"uid=\\\"\" +  konnectorId(\"EventSyncEntry\", event->uid() ) + \"\\\" \");\n    str.append( \"start=\\\"\" + QString::number( toUTC( event->dtStart() ) ) + \"\\\" \");\n    str.append( \"end=\\\"\" +  QString::number(  toUTC( event->dtEnd() ) ) + \"\\\" \");\n    str.append( \"note=\\\"\" + escape( event->description() ) + \"\\\" \"); \/\/use escapeString copied from TT\n    if ( event->doesFloat() )\n        str.append( \"type=\\\"AllDay\\\" \");\n    \/\/ recurrence\n    KCal::Recurrence *rec = event->recurrence();\n    if ( rec->doesRecur() ) {\n        QString type;\n        switch( rec->doesRecur() ) {\n        case KCal::Recurrence::rDaily :{\n            type = \"Daily\";\n            break;\n        }\n        case KCal::Recurrence::rWeekly :{\n            type = \"Weekly\";\n            char day = 0; \/\/ signed\n            QBitArray array = rec->days();\n            if ( array.testBit(0 ) ) day |= Monday;\n            if ( array.testBit(1 ) ) day |= Tuesday;\n            if ( array.testBit(2 ) ) day |= Wednesday;\n            if ( array.testBit(3 ) ) day |= Thursday;\n            if ( array.testBit(4 ) ) day |= Friday;\n            if ( array.testBit(5 ) ) day |= Saturday;\n            if ( array.testBit(6 ) ) day |= Sunday;\n            str.append( \"rweekdays=\\\"\" + QString::number(static_cast<int> (day) ) + \"\\\" \");\n            break;\n        }\n        case KCal::Recurrence::rMonthlyPos :{\n            str.append( \"rposition=\\\"\" + QString::number( week( event->dtStart().date() ) )  + \"\\\" \");\n            type = \"MonthlyDay\";\n            break;\n        }\n        case KCal::Recurrence::rMonthlyDay :{\n            type = \"MonthlyDate\";\n\n            break;\n        }\n        case KCal::Recurrence::rYearlyDay :{\n            type = \"Yearly\";\n            break;\n        }\n        case KCal::Recurrence::rNone : \/\/ fall through\n        default :\n            break;\n        }\n        str.append( \"rtype=\\\"\" + type + \"\\\" \");\n        str.append( \"rfreq=\\\"\" + QString::number( rec->frequency() ) + \"\\\" \");\n        if ( rec->duration() == -1 || rec->duration() != 0 )\n            str.append( \"rhasenddate=\\\"0\\\" \");\n        else if ( rec->duration() == 0 ) {\n            str.append( \"rhasenddate=\\\"1\\\" \");\n            str.append( \"enddt=\\\"\" + QString::number( toUTC(rec->endDate() ) ) + \"\\\" \");\n        }\n        str.append( \"created=\\\"\" + QString::number( toUTC(rec->recurStart() ) ) + \"\\\" \");\n\n\n    }\n    \/\/ alarm\n    KCal::Alarm *al = event->alarms().first();\n    if ( al != 0 ) {\n        int sec = al->startOffset().asSeconds();\n        sec = sec > 0 ? sec % 60 : sec % -60; \/\/ as minutes now\n\tif( sec != 0 ){\n            str.append( \"alarm=\\\"\" +QString::number( sec )  + \"\\\" \");\n\t    QString sound = al->audioFile();\n    \t    if ( sound != \"loud\" && sound != \"silent\" ) {\n        \tif ( sound.isEmpty() )\n                \tsound = QString::fromLatin1(\"silent\");\n\t        else\n    \t            sound = QString::fromLatin1(\"loud\");\n    \t    }\n    \t    str.append( \"sound=\\\"\" +  sound + \"\\\" \");\n\t}\n    }\n    str.append( \" \/>\" );\n    return str;\n}\n<commit_msg>Fix writing of recurrence in XML files If no recurrence day is set set it to the event start day only save if days > 0<commit_after>\n#include <qbitarray.h>\n#include <qbuffer.h>\n#include <qdom.h>\n#include <qfile.h>\n#include <qtextstream.h>\n\n#include <kdebug.h>\n\n#include <eventsyncee.h>\n\n#include \"device.h\"\n#include \"datebook.h\"\n\nusing namespace OpieHelper;\n\nnamespace {\n\/\/ from TT\nint week ( const QDate &start ) {\n    int stop = start.day();\n    int sentinel = start.dayOfWeek();\n    int dayOfWeek = QDate( start.year(),  start.month(),  1 ).dayOfWeek();\n    int week = 1;\n    for ( int i = 1; i < stop; i++ ) {\n        if ( dayOfWeek++ == sentinel )\n            week++;\n        if ( dayOfWeek > 7 )\n            dayOfWeek = 0;\n    }\n    return week;\n}\n\n};\n\nDateBook::DateBook( CategoryEdit* edit,\n                    KSync::KonnectorUIDHelper* helper,\n                    const QString& tz,\n                    bool meta, Device *dev )\n    : Base( edit,  helper,  tz, meta, dev )\n{\n}\nDateBook::~DateBook(){\n}\n\/**\n * Converts an Opie Event to a KDE one\n *\/\nKCal::Event* DateBook::toEvent( QDomElement e) {\n\/\/    kdDebug(522) << \"inside event\" << endl;\n    KCal::Event* event = new KCal::Event();\n    QStringList list = QStringList::split(\";\",  e.attribute(\"categories\") );\n    QStringList categories;\n    for ( uint i = 0; i < list.count(); i++ ) {\n\/\/        kdDebug(5229) << list[i]<< \" categories \" << m_edit->categoryById( list[i],  \"Calendar\") << endl;\n        categories.append(m_edit->categoryById(list[i], \"Calendar\") );\n    }\n    if (!categories.isEmpty() ) {\n        event->setCategories( categories );\n    }\n    \/\/event->setDescription(e.attribute(\"Description\") );\n    event->setSummary( e.attribute(\"description\") );\n    event->setUid( kdeId( \"EventSyncEntry\",  e.attribute(\"uid\") ) );\n    event->setDescription( e.attribute(\"note\") );\n    event->setLocation( e.attribute(\"location\") );\n    \/\/ time\n\n    QString start = e.attribute(\"start\");\n\/\/    kdDebug(5229) << \"Start \" << fromUTC( (time_t) start.toLong() ).toString() << endl;\n    event->setDtStart( fromUTC( (time_t) start.toLong() ) );\n\n    QString end = e.attribute(\"end\");\n\/\/    kdDebug(5229) << \"End \" << fromUTC( (time_t) end.toLong() ).toString() << endl;\n    event->setDtEnd( fromUTC( (time_t) end.toLong() ) );\n\n    \/\/ type\n    if ( e.attribute(\"type\") == \"AllDay\" ) {\n        event->setFloats( true );\n    }else{\n        event->setFloats( false );\n    }\n\n    \/\/ alarm\n    QString alarm = e.attribute(\"alarm\");\n\n    \/* there is an alarm *\/\n    if (!alarm.isEmpty() ) {\n        KCal::Alarm *al = new KCal::Alarm( event );\n        al->setStartOffset( alarm.toInt() * -60 );\n        al->setAudioAlarm( e.attribute(\"sound\") );\n        event->addAlarm( al );\n\n        kdDebug(5229) << \"Alarm offset \" << al->startOffset().asSeconds() << endl;\n        kdDebug(5229) << \"Alarm \" << e.attribute(\"alarm\") << \" \" << e.attribute(\"sound\") << endl;\n    }\n\n\n    \/\/ Recurrence damn I feared to do that\n    QString type = e.attribute(\"rtype\");\n    int freq = e.attribute(\"rfreq\").toInt();\n    bool hasEnd = e.attribute(\"rhasenddate\").toInt();\n    \/\/kdDebug(5229) << \"HasEndDate: \" << hasEnd << endl;\n\n    KCal::Recurrence *rec = event->recurrence();\n    start = e.attribute(\"created\");\n    rec->setRecurStart( fromUTC( (time_t) start.toLong() ) );\n\n    if ( type == \"Daily\" ) {\n        if ( hasEnd ) {\n            start = e.attribute(\"enddt\");\n            rec->setDaily(freq,  fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setDaily( freq,  -1 );\n        }\n        \/\/ weekly\n    }else if ( type == \"Weekly\") {\n        int days = e.attribute(\"rweekdays\").toInt();\n        QBitArray bits( 7 );\n        bits.fill( false );\n        if ( Monday & days )\n            bits.setBit( 0 );\n        if ( Tuesday & days )\n            bits.setBit( 1 );\n        if ( Wednesday & days )\n            bits.setBit( 2 );\n        if ( Thursday & days )\n            bits.setBit( 3 );\n        if ( Friday & days )\n            bits.setBit( 4 );\n        if ( Saturday & days )\n            bits.setBit( 5 );\n        if ( Sunday & days )\n            bits.setBit( 6 );\n\n        if ( hasEnd ) {\n            start = e.attribute(\"enddt\");\n\/\/            kdDebug(5229) << \"has end \" << start << endl;\n            rec->setWeekly( freq,  bits, fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setWeekly( freq,  bits,  -1 );\n        }\n    \/\/ monthly\n    }else if ( type == \"MonthlyDay\" ) {\n        \/\/ monthly day the  1st Saturday of the month\n        int rposition = e.attribute(\"rposition\").toInt();\n        if ( hasEnd ) {\n            start = e.attribute(\"enddt\");\n            rec->setMonthly( KCal::Recurrence::rMonthlyPos,\n                             freq,fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setMonthly( KCal::Recurrence::rMonthlyPos,\n                             freq,  -1 );\n        }\n        QBitArray array( 7);\n        array.fill( false );\n        QDate date = event->dtStart().date();\n        array.setBit( date.dayOfWeek() - 1 );\n        rec->addMonthlyPos( rposition, array );\n\n    }else if ( type == \"MonthlyDate\" ) {\n        \/\/ int rposition = e.attribute(\"rposition\").toInt();\n        if ( hasEnd ) {\n            start = e.attribute(\"enddt\");\n            rec->setMonthly( KCal::Recurrence::rMonthlyDay,\n                             freq,fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setMonthly( KCal::Recurrence::rMonthlyDay,\n                             freq,  -1 );\n        }\n        QDate date = event->dtStart().date();\n        rec->addMonthlyDay( date.day() );\n\n    }else if ( type == \"Yearly\" ) {\n        if (hasEnd ) {\n            start = e.attribute(\"enddt\");\n            rec->setYearly( KCal::Recurrence::rYearlyDay,\n                            freq,\n                            fromUTC( (time_t) start.toLong() ).date() );\n        }else{\n            rec->setYearly( KCal::Recurrence::rYearlyDay,\n                            freq, -1 );\n        }\n        rec->addYearlyNum( event->dtStart().date().dayOfYear() );\n    }\n    return event;\n}\n\nKSync::EventSyncee* DateBook::toKDE( const QString& fileName )\n{\n\/\/    kdDebug(5229) << \"To KDE \" << endl;\n    KSync::EventSyncee* syncee = new KSync::EventSyncee();\n    if( device() )\n\tsyncee->setSupports( device()->supports( Device::Calendar ) );\n\n    QFile file( fileName );\n    if ( file.open( IO_ReadOnly ) ) {\n        \/\/kdDebug(5229) << \"file open\" << endl;\n        QDomDocument doc(\"mydocument\");\n        if ( doc.setContent( &file ) ) {\n\/\/            kdDebug(5229) << \"setContent\" << endl;\n            QDomElement docElem = doc.documentElement();\n\/\/            kdDebug(5229) << \"TagName docElem \" << docElem.tagName() << endl;\n            QDomNode n = docElem.firstChild();\n            QString dummy;\n            while (!n.isNull() ) {\n                QDomElement el = n.toElement();\n                if (!el.isNull() ) {\n\/\/                    kdDebug(5229) << \"e \" << el.tagName() << endl;\n\/\/                    kdDebug(5229) << \"e.isNull not\" << endl;\n\n                    if ( el.tagName() == \"events\") {\n\n                        QDomNode no = el.firstChild();\n                        while (!no.isNull() ) {\n                            QDomElement e = no.toElement();\n\n                            if (!e.isNull() ) {\n                                if (e.tagName() == \"event\") {\n                                    KCal::Event* event = toEvent( e );\n                                    if (event != 0 ) {\n                                        KSync::EventSyncEntry* entry;\n                                        entry = new KSync::EventSyncEntry( event );\n                                        syncee->addEntry( entry );\n                                    }\n                                }\n                            }\n                            no = no.nextSibling();\n                        }\n                    }\n                    n = n.nextSibling();\n                }\/\/ n.isNULL\n            }\n        }\n    }\n    return syncee;\n}\n\nKTempFile* DateBook::fromKDE( KSync::EventSyncee* syncee )\n{\n    m_kde2opie.clear();\n    Kontainer::ValueList newIds = syncee->ids( \"EventSyncEntry\");\n    Kontainer::ValueList::ConstIterator idIt;\n    for ( idIt = newIds.begin(); idIt != newIds.end(); ++idIt ) {\n        m_helper->addId(\"EventSyncEntry\",  (*idIt).first(),  (*idIt).second() );\n    }\n    KTempFile* tempFile = file();\n    if ( tempFile->textStream() ) {\n        QTextStream *stream = tempFile->textStream();\n        stream->setEncoding( QTextStream::UnicodeUTF8 );\n        *stream <<\"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\" << endl;\n        *stream << \"<!DOCTYPE DATEBOOK><DATEBOOK>\" << endl;\n        KSync::EventSyncEntry *entry;\n        KCal::Event *event;\n        *stream << \"<events>\" << endl;\n        for ( entry = (KSync::EventSyncEntry*) syncee->firstEntry();\n              entry != 0;\n              entry = (KSync::EventSyncEntry*) syncee->nextEntry() )\n        {\n            if (entry->state() == KSync::SyncEntry::Removed )\n                continue;\n            event = entry->incidence();\n            *stream << event2string( event ) << endl;\n        }\n        *stream << \"<\/events>\" << endl;\n        *stream << \"<\/DATEBOOK>\" << endl;\n\n    }\n    if (m_helper )\n        m_helper->replaceIds( \"EventSyncEntry\",  m_kde2opie );\n\n    tempFile->close();\n    return tempFile;\n}\nQString DateBook::event2string( KCal::Event *event )\n{\n    QString str;\n    str.append( \"<event \");\n    str.append( \"description=\\\"\" +escape( event->summary() ) + \"\\\" \");\n    str.append( \"location=\\\"\" + escape( event->location() ) + \"\\\" \");\n    str.append( \"categories=\\\"\" +  categoriesToNumber( event->categories() ) + \"\\\" \");\n    str.append( \"uid=\\\"\" +  konnectorId(\"EventSyncEntry\", event->uid() ) + \"\\\" \");\n    str.append( \"start=\\\"\" + QString::number( toUTC( event->dtStart() ) ) + \"\\\" \");\n    str.append( \"end=\\\"\" +  QString::number(  toUTC( event->dtEnd() ) ) + \"\\\" \");\n    str.append( \"note=\\\"\" + escape( event->description() ) + \"\\\" \"); \/\/use escapeString copied from TT\n    if ( event->doesFloat() )\n        str.append( \"type=\\\"AllDay\\\" \");\n    \/\/ recurrence\n    KCal::Recurrence *rec = event->recurrence();\n    if ( rec->doesRecur() ) {\n        QString type;\n        switch( rec->doesRecur() ) {\n        case KCal::Recurrence::rDaily :{\n            type = \"Daily\";\n            break;\n        }\n        case KCal::Recurrence::rWeekly :{\n            type = \"Weekly\";\n            char day = 0; \/\/ signed\n            QBitArray array = rec->days();\n            if ( array.testBit(0 ) ) day |= Monday;\n            if ( array.testBit(1 ) ) day |= Tuesday;\n            if ( array.testBit(2 ) ) day |= Wednesday;\n            if ( array.testBit(3 ) ) day |= Thursday;\n            if ( array.testBit(4 ) ) day |= Friday;\n            if ( array.testBit(5 ) ) day |= Saturday;\n            if ( array.testBit(6 ) ) day |= Sunday;\n\n            \/* need to be > 0  we set the repeat day to the day where the event takes place*\/\n            if ( day < 0 ) {\n                switch( event->dtStart().date().dayOfWeek() ) {\n                case 1: \/\/ Monday\n                    day = Monday;\n                    break;\n                case 2: \/\/ Tuesday\n                    day = Tuesday;\n                    break;\n                case 3: \/\/ Wednesday\n                    day = Wednesday;\n                    break;\n                case 4: \/\/  Thursday\n                    day = Thursday;\n                    break;\n                case 5: \/\/ Friday\n                    day = Friday;\n                    break;\n                case 6: \/\/ Staurday\n                    day = Saturday;\n                    break;\n                default:\/\/ should never happen\n                case 7: \/\/ Sunday\n                    day = Sunday;\n                    break;\n                }\n\n            }\n            str.append( \"rweekdays=\\\"\" + QString::number(static_cast<int> (day) ) + \"\\\" \");\n            break;\n        }\n        case KCal::Recurrence::rMonthlyPos :{\n            int rpos = week( event->dtStart().date() );\n            if ( rpos != 0 )\n                str.append( \"rposition=\\\"\" + QString::number(rpos)  + \"\\\" \");\n            type = \"MonthlyDay\";\n            break;\n        }\n        case KCal::Recurrence::rMonthlyDay :{\n            type = \"MonthlyDate\";\n\n            break;\n        }\n        case KCal::Recurrence::rYearlyDay :{\n            type = \"Yearly\";\n            break;\n        }\n        case KCal::Recurrence::rNone : \/\/ fall through\n        default :\n            break;\n        }\n        str.append( \"rtype=\\\"\" + type + \"\\\" \");\n        str.append( \"rfreq=\\\"\" + QString::number( rec->frequency() ) + \"\\\" \");\n        if ( rec->duration() == -1 || rec->duration() != 0 )\n            str.append( \"rhasenddate=\\\"0\\\" \");\n        else if ( rec->duration() == 0 ) {\n            str.append( \"rhasenddate=\\\"1\\\" \");\n            str.append( \"enddt=\\\"\" + QString::number( toUTC(rec->endDate() ) ) + \"\\\" \");\n        }\n        str.append( \"created=\\\"\" + QString::number( toUTC(rec->recurStart() ) ) + \"\\\" \");\n\n\n    }\n    \/\/ alarm\n    KCal::Alarm *al = event->alarms().first();\n    if ( al != 0 ) {\n        int sec = al->startOffset().asSeconds();\n        sec = sec > 0 ? sec % 60 : sec % -60; \/\/ as minutes now\n\tif( sec != 0 ){\n            str.append( \"alarm=\\\"\" +QString::number( sec )  + \"\\\" \");\n\t    QString sound = al->audioFile();\n    \t    if ( sound != \"loud\" && sound != \"silent\" ) {\n        \tif ( sound.isEmpty() )\n                \tsound = QString::fromLatin1(\"silent\");\n\t        else\n    \t            sound = QString::fromLatin1(\"loud\");\n    \t    }\n    \t    str.append( \"sound=\\\"\" +  sound + \"\\\" \");\n\t}\n    }\n    str.append( \" \/>\" );\n    return str;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * customwidgets.cpp: Custom widgets\n ****************************************************************************\n * Copyright (C) 2006 the VideoLAN team\n * Copyright (C) 2004 Daniel Molkentin <molkentin@kde.org>\n * $Id$\n *\n * Authors: Clément Stenac <zorglub@videolan.org>\n * The \"ClickLineEdit\" control is based on code by  Daniel Molkentin\n * <molkentin@kde.org> for libkdepim\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#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"customwidgets.hpp\"\n#include <QPainter>\n#include <QLineEdit>\n#include <QColorGroup>\n#include <QRect>\n#include <QKeyEvent>\n#include <QWheelEvent>\n\n#include <vlc_keys.h>\n\nClickLineEdit::ClickLineEdit( const QString &msg, QWidget *parent) : QLineEdit( parent )\n{\n    mDrawClickMsg = true;\n    setClickMessage( msg );\n}\n\nvoid ClickLineEdit::setClickMessage( const QString &msg )\n{\n    mClickMessage = msg;\n    repaint();\n}\n\n\nvoid ClickLineEdit::setText( const QString &txt )\n{\n    mDrawClickMsg = txt.isEmpty();\n    repaint();\n    QLineEdit::setText( txt );\n}\n\nvoid ClickLineEdit::paintEvent( QPaintEvent *pe )\n{\n    QLineEdit::paintEvent( pe );\n    if ( mDrawClickMsg == true && !hasFocus() ) {\n        QPainter p( this );\n        QPen tmp = p.pen();\n        p.setPen( palette().color( QPalette::Disabled, QPalette::Text ) );\n        QRect cr = contentsRect();\n        \/\/ Add two pixel margin on the left side\n        cr.setLeft( cr.left() + 3 );\n        p.drawText( cr, Qt::AlignLeft | Qt::AlignVCenter, mClickMessage );\n        p.setPen( tmp );\n        p.end();\n    }\n}\n\nvoid ClickLineEdit::dropEvent( QDropEvent *ev )\n{\n    mDrawClickMsg = false;\n    QLineEdit::dropEvent( ev );\n}\n\nvoid ClickLineEdit::focusInEvent( QFocusEvent *ev )\n{\n    if ( mDrawClickMsg == true ) {\n        mDrawClickMsg = false;\n        repaint();\n    }\n    QLineEdit::focusInEvent( ev );\n}\n\nvoid ClickLineEdit::focusOutEvent( QFocusEvent *ev )\n{\n    if ( text().isEmpty() ) {\n        mDrawClickMsg = true;\n        repaint();\n    }\n    QLineEdit::focusOutEvent( ev );\n}\n\n\/***************************************************************************\n * Hotkeys converters\n ***************************************************************************\/\nint qtKeyModifiersToVLC( QInputEvent* e )\n{\n    int i_keyModifiers = 0;\n    if( e->modifiers() & Qt::ShiftModifier ) i_keyModifiers |= KEY_MODIFIER_SHIFT;\n    if( e->modifiers() & Qt::AltModifier ) i_keyModifiers |= KEY_MODIFIER_ALT;\n    if( e->modifiers() & Qt::ControlModifier ) i_keyModifiers |= KEY_MODIFIER_CTRL;\n    if( e->modifiers() & Qt::MetaModifier ) i_keyModifiers |= KEY_MODIFIER_META;\n    return i_keyModifiers;\n}\n\nint qtEventToVLCKey( QKeyEvent *e )\n{\n    int i_vlck = 0;\n    \/* Handle modifiers *\/\n    i_vlck |= qtKeyModifiersToVLC( e );\n\n    bool found = false;\n    \/* Look for some special keys *\/\n#define HANDLE( qt, vk ) case Qt::qt : i_vlck |= vk; found = true;break\n    switch( e->key() )\n    {\n        HANDLE( Key_Left, KEY_LEFT );\n        HANDLE( Key_Right, KEY_RIGHT );\n        HANDLE( Key_Up, KEY_UP );\n        HANDLE( Key_Down, KEY_DOWN );\n        HANDLE( Key_Space, KEY_SPACE );\n        HANDLE( Key_Escape, KEY_ESC );\n        HANDLE( Key_Enter, KEY_ENTER );\n        HANDLE( Key_F1, KEY_F1 );\n        HANDLE( Key_F2, KEY_F2 );\n        HANDLE( Key_F3, KEY_F3 );\n        HANDLE( Key_F4, KEY_F4 );\n        HANDLE( Key_F5, KEY_F5 );\n        HANDLE( Key_F6, KEY_F6 );\n        HANDLE( Key_F7, KEY_F7 );\n        HANDLE( Key_F8, KEY_F8 );\n        HANDLE( Key_F9, KEY_F9 );\n        HANDLE( Key_F10, KEY_F10 );\n        HANDLE( Key_F11, KEY_F11 );\n        HANDLE( Key_F12, KEY_F12 );\n        HANDLE( Key_PageUp, KEY_PAGEUP );\n        HANDLE( Key_PageDown, KEY_PAGEDOWN );\n        HANDLE( Key_Home, KEY_HOME );\n        HANDLE( Key_End, KEY_END );\n        HANDLE( Key_Insert, KEY_INSERT );\n        HANDLE( Key_Delete, KEY_DELETE );\n        HANDLE( Key_VolumeDown, KEY_VOLUME_DOWN);\n        HANDLE( Key_VolumeUp, KEY_VOLUME_UP );\n        HANDLE( Key_VolumeMute, KEY_VOLUME_MUTE );\n        HANDLE( Key_MediaPlay, KEY_MEDIA_PLAY_PAUSE );\n        HANDLE( Key_MediaStop, KEY_MEDIA_STOP );\n        HANDLE( Key_MediaPrevious, KEY_MEDIA_PREV_TRACK );\n        HANDLE( Key_MediaNext, KEY_MEDIA_NEXT_TRACK );\n\n    }\n    if( !found )\n    {\n        \/* Force lowercase *\/\n        if( e->key() >= Qt::Key_A && e->key() <= Qt::Key_Z )\n            i_vlck += e->key() + 32;\n        \/* Rest of the ascii range *\/\n        else if( e->key() >= Qt::Key_Space && e->key() <= Qt::Key_AsciiTilde )\n            i_vlck += e->key();\n    }\n    return i_vlck;\n}\n\nint qtWheelEventToVLCKey( QWheelEvent *e )\n{\n    int i_vlck = 0;\n    \/* Handle modifiers *\/\n    i_vlck |= qtKeyModifiersToVLC( e );\n    if ( e->delta() > 0 )\n        i_vlck |= KEY_MOUSEWHEELUP;\n    else\n        i_vlck |= KEY_MOUSEWHEELDOWN;\n    return i_vlck;\n}\n\nQString VLCKeyToString( int val )\n{\n    const char *base = KeyToString (val & ~KEY_MODIFIER);\n\n    QString r = \"\";\n    if( val & KEY_MODIFIER_CTRL )\n        r+= \"Ctrl+\";\n    if( val & KEY_MODIFIER_ALT )\n        r+= \"Alt+\";\n    if( val & KEY_MODIFIER_SHIFT )\n        r+= \"Shift+\";\n\n    return r + (base ? base : \"Unset\");\n}\n\n<commit_msg>Someone did not RTFM Qt::Key_Enter != Qt::Key_Return :D<commit_after>\/*****************************************************************************\n * customwidgets.cpp: Custom widgets\n ****************************************************************************\n * Copyright (C) 2006 the VideoLAN team\n * Copyright (C) 2004 Daniel Molkentin <molkentin@kde.org>\n * $Id$\n *\n * Authors: Clément Stenac <zorglub@videolan.org>\n * The \"ClickLineEdit\" control is based on code by  Daniel Molkentin\n * <molkentin@kde.org> for libkdepim\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#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"customwidgets.hpp\"\n#include <QPainter>\n#include <QLineEdit>\n#include <QColorGroup>\n#include <QRect>\n#include <QKeyEvent>\n#include <QWheelEvent>\n\n#include <vlc_keys.h>\n\nClickLineEdit::ClickLineEdit( const QString &msg, QWidget *parent) : QLineEdit( parent )\n{\n    mDrawClickMsg = true;\n    setClickMessage( msg );\n}\n\nvoid ClickLineEdit::setClickMessage( const QString &msg )\n{\n    mClickMessage = msg;\n    repaint();\n}\n\n\nvoid ClickLineEdit::setText( const QString &txt )\n{\n    mDrawClickMsg = txt.isEmpty();\n    repaint();\n    QLineEdit::setText( txt );\n}\n\nvoid ClickLineEdit::paintEvent( QPaintEvent *pe )\n{\n    QLineEdit::paintEvent( pe );\n    if ( mDrawClickMsg == true && !hasFocus() ) {\n        QPainter p( this );\n        QPen tmp = p.pen();\n        p.setPen( palette().color( QPalette::Disabled, QPalette::Text ) );\n        QRect cr = contentsRect();\n        \/\/ Add two pixel margin on the left side\n        cr.setLeft( cr.left() + 3 );\n        p.drawText( cr, Qt::AlignLeft | Qt::AlignVCenter, mClickMessage );\n        p.setPen( tmp );\n        p.end();\n    }\n}\n\nvoid ClickLineEdit::dropEvent( QDropEvent *ev )\n{\n    mDrawClickMsg = false;\n    QLineEdit::dropEvent( ev );\n}\n\nvoid ClickLineEdit::focusInEvent( QFocusEvent *ev )\n{\n    if ( mDrawClickMsg == true ) {\n        mDrawClickMsg = false;\n        repaint();\n    }\n    QLineEdit::focusInEvent( ev );\n}\n\nvoid ClickLineEdit::focusOutEvent( QFocusEvent *ev )\n{\n    if ( text().isEmpty() ) {\n        mDrawClickMsg = true;\n        repaint();\n    }\n    QLineEdit::focusOutEvent( ev );\n}\n\n\/***************************************************************************\n * Hotkeys converters\n ***************************************************************************\/\nint qtKeyModifiersToVLC( QInputEvent* e )\n{\n    int i_keyModifiers = 0;\n    if( e->modifiers() & Qt::ShiftModifier ) i_keyModifiers |= KEY_MODIFIER_SHIFT;\n    if( e->modifiers() & Qt::AltModifier ) i_keyModifiers |= KEY_MODIFIER_ALT;\n    if( e->modifiers() & Qt::ControlModifier ) i_keyModifiers |= KEY_MODIFIER_CTRL;\n    if( e->modifiers() & Qt::MetaModifier ) i_keyModifiers |= KEY_MODIFIER_META;\n    return i_keyModifiers;\n}\n\nint qtEventToVLCKey( QKeyEvent *e )\n{\n    int i_vlck = 0;\n    \/* Handle modifiers *\/\n    i_vlck |= qtKeyModifiersToVLC( e );\n\n    bool found = false;\n    \/* Look for some special keys *\/\n#define HANDLE( qt, vk ) case Qt::qt : i_vlck |= vk; found = true;break\n    switch( e->key() )\n    {\n        HANDLE( Key_Left, KEY_LEFT );\n        HANDLE( Key_Right, KEY_RIGHT );\n        HANDLE( Key_Up, KEY_UP );\n        HANDLE( Key_Down, KEY_DOWN );\n        HANDLE( Key_Space, KEY_SPACE );\n        HANDLE( Key_Escape, KEY_ESC );\n        HANDLE( Key_Return, KEY_ENTER );\n        HANDLE( Key_Enter, KEY_ENTER );\n        HANDLE( Key_F1, KEY_F1 );\n        HANDLE( Key_F2, KEY_F2 );\n        HANDLE( Key_F3, KEY_F3 );\n        HANDLE( Key_F4, KEY_F4 );\n        HANDLE( Key_F5, KEY_F5 );\n        HANDLE( Key_F6, KEY_F6 );\n        HANDLE( Key_F7, KEY_F7 );\n        HANDLE( Key_F8, KEY_F8 );\n        HANDLE( Key_F9, KEY_F9 );\n        HANDLE( Key_F10, KEY_F10 );\n        HANDLE( Key_F11, KEY_F11 );\n        HANDLE( Key_F12, KEY_F12 );\n        HANDLE( Key_PageUp, KEY_PAGEUP );\n        HANDLE( Key_PageDown, KEY_PAGEDOWN );\n        HANDLE( Key_Home, KEY_HOME );\n        HANDLE( Key_End, KEY_END );\n        HANDLE( Key_Insert, KEY_INSERT );\n        HANDLE( Key_Delete, KEY_DELETE );\n        HANDLE( Key_VolumeDown, KEY_VOLUME_DOWN);\n        HANDLE( Key_VolumeUp, KEY_VOLUME_UP );\n        HANDLE( Key_VolumeMute, KEY_VOLUME_MUTE );\n        HANDLE( Key_MediaPlay, KEY_MEDIA_PLAY_PAUSE );\n        HANDLE( Key_MediaStop, KEY_MEDIA_STOP );\n        HANDLE( Key_MediaPrevious, KEY_MEDIA_PREV_TRACK );\n        HANDLE( Key_MediaNext, KEY_MEDIA_NEXT_TRACK );\n\n    }\n    if( !found )\n    {\n        \/* Force lowercase *\/\n        if( e->key() >= Qt::Key_A && e->key() <= Qt::Key_Z )\n            i_vlck += e->key() + 32;\n        \/* Rest of the ascii range *\/\n        else if( e->key() >= Qt::Key_Space && e->key() <= Qt::Key_AsciiTilde )\n            i_vlck += e->key();\n    }\n    return i_vlck;\n}\n\nint qtWheelEventToVLCKey( QWheelEvent *e )\n{\n    int i_vlck = 0;\n    \/* Handle modifiers *\/\n    i_vlck |= qtKeyModifiersToVLC( e );\n    if ( e->delta() > 0 )\n        i_vlck |= KEY_MOUSEWHEELUP;\n    else\n        i_vlck |= KEY_MOUSEWHEELDOWN;\n    return i_vlck;\n}\n\nQString VLCKeyToString( int val )\n{\n    const char *base = KeyToString (val & ~KEY_MODIFIER);\n\n    QString r = \"\";\n    if( val & KEY_MODIFIER_CTRL )\n        r+= \"Ctrl+\";\n    if( val & KEY_MODIFIER_ALT )\n        r+= \"Alt+\";\n    if( val & KEY_MODIFIER_SHIFT )\n        r+= \"Shift+\";\n\n    return r + (base ? base : \"Unset\");\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * bitmap_font.cpp\n *****************************************************************************\n * Copyright (C) 2004 the VideoLAN team\n * $Id$\n *\n * Authors: Cyril Deguet     <asmax@via.ecp.fr>\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, USA.\n *****************************************************************************\/\n\n#include \"bitmap_font.hpp\"\n#include \"generic_bitmap.hpp\"\n#include \"..\/utils\/ustring.hpp\"\n\n\nBitmapFont::BitmapFont( intf_thread_t *pIntf, const GenericBitmap &rBitmap,\n                        const string &rType ):\n    GenericFont( pIntf ), m_rBitmap( rBitmap )\n{\n    int i;\n\n    \/\/ Build the character table\n    if( rType == \"digits\" )\n    {\n        m_width = 9;\n        m_height = 13;\n        m_advance = 12;\n        m_skip = 6;\n        for( i = 0; i <= 9; i++ )\n        {\n            m_table['0'+i].m_xPos = i * m_width;\n        }\n        m_table[(size_t)'-'].m_xPos = 11 * m_width;\n    }\n    else if( rType == \"text\" )\n    {\n        m_width = 5;\n        m_height = 6;\n        m_advance = 5;\n        m_skip = 5;\n        for( i = 0; i < 26; i++ )\n        {\n            m_table['A'+i].m_xPos = m_table['a'+i].m_xPos = i * m_width;\n        }\n        m_table[(size_t)'\"'].m_xPos = 26 * m_width;\n        m_table[(size_t)'@'].m_xPos = 27 * m_width;\n        m_table[(size_t)' '].m_xPos = 29 * m_width;\n        for( i = 0; i <= 9; i++ )\n        {\n            m_table['0'+i].m_xPos = i * m_width;\n            m_table['0'+i].m_yPos = m_height;\n        }\n        static const char specialChars[] = {'.', ':', '(', ')', '-', '\\'',\n            '!', '_', '+', '\\\\', '\/', '[', ']', '^', '&', '%', ',', '=', '$',\n            '#'};\n        for( i = 0; i < 19; i++ )\n        {\n            m_table[(size_t)specialChars[i]].m_xPos = (11 + i) * m_width;\n            m_table[(size_t)specialChars[i]].m_yPos = m_height;\n        }\n        m_table[(size_t)'?'].m_xPos = 4 * m_width;\n        m_table[(size_t)'*'].m_xPos = 5 * m_width;\n        m_table[(size_t)'?'].m_yPos = m_table[(size_t)'*'].m_yPos = 2 * m_height;\n    }\n}\n\n\nGenericBitmap *BitmapFont::drawString( const UString &rString,\n                                       uint32_t color, int maxWidth ) const\n{\n    uint32_t *pString = (uint32_t*)rString.u_str();\n    \/\/ Compute the text width\n    int width = 0;\n    for( uint32_t *ptr = pString; *ptr; ptr++ )\n    {\n        uint32_t c = *ptr;\n        if( c < 256 && m_table[c].m_xPos != -1 )\n        {\n            width += m_advance;\n        }\n        else\n        {\n            width += m_skip;\n        }\n    }\n    \/\/ Create a bitmap\n    BitmapImpl *pBmp = new BitmapImpl( getIntf(), width, m_height );\n    int xDest = 0;\n    while( *pString )\n    {\n        uint32_t c = *(pString++);\n        if( c < 256 && m_table[c].m_xPos != -1 )\n        {\n            pBmp->drawBitmap( m_rBitmap, m_table[c].m_xPos, m_table[c].m_yPos,\n                              xDest, 0, m_width, m_height );\n            xDest += m_advance;\n        }\n        else\n        {\n            xDest += m_skip;\n        }\n    }\n    return pBmp;\n}\n\n<commit_msg> * skins2\/src\/bitmap_font.cpp: log a warning if a char cannot be rendered<commit_after>\/*****************************************************************************\n * bitmap_font.cpp\n *****************************************************************************\n * Copyright (C) 2004 the VideoLAN team\n * $Id$\n *\n * Authors: Cyril Deguet     <asmax@via.ecp.fr>\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, USA.\n *****************************************************************************\/\n\n#include \"bitmap_font.hpp\"\n#include \"generic_bitmap.hpp\"\n#include \"..\/utils\/ustring.hpp\"\n\n\nBitmapFont::BitmapFont( intf_thread_t *pIntf, const GenericBitmap &rBitmap,\n                        const string &rType ):\n    GenericFont( pIntf ), m_rBitmap( rBitmap )\n{\n    int i;\n\n    \/\/ Build the character table\n    if( rType == \"digits\" )\n    {\n        m_width = 9;\n        m_height = 13;\n        m_advance = 12;\n        m_skip = 6;\n        for( i = 0; i <= 9; i++ )\n        {\n            m_table['0'+i].m_xPos = i * m_width;\n        }\n        m_table[(size_t)'-'].m_xPos = 11 * m_width;\n    }\n    else if( rType == \"text\" )\n    {\n        m_width = 5;\n        m_height = 6;\n        m_advance = 5;\n        m_skip = 5;\n        for( i = 0; i < 26; i++ )\n        {\n            m_table['A'+i].m_xPos = m_table['a'+i].m_xPos = i * m_width;\n        }\n        m_table[(size_t)'\"'].m_xPos = 26 * m_width;\n        m_table[(size_t)'@'].m_xPos = 27 * m_width;\n        m_table[(size_t)' '].m_xPos = 29 * m_width;\n        for( i = 0; i <= 9; i++ )\n        {\n            m_table['0'+i].m_xPos = i * m_width;\n            m_table['0'+i].m_yPos = m_height;\n        }\n        static const char specialChars[] = {'.', ':', '(', ')', '-', '\\'',\n            '!', '_', '+', '\\\\', '\/', '[', ']', '^', '&', '%', ',', '=', '$',\n            '#'};\n        for( i = 0; i < 19; i++ )\n        {\n            m_table[(size_t)specialChars[i]].m_xPos = (11 + i) * m_width;\n            m_table[(size_t)specialChars[i]].m_yPos = m_height;\n        }\n        m_table[(size_t)'?'].m_xPos = 4 * m_width;\n        m_table[(size_t)'*'].m_xPos = 5 * m_width;\n        m_table[(size_t)'?'].m_yPos = m_table[(size_t)'*'].m_yPos = 2 * m_height;\n    }\n}\n\n\nGenericBitmap *BitmapFont::drawString( const UString &rString,\n                                       uint32_t color, int maxWidth ) const\n{\n    uint32_t *pString = (uint32_t*)rString.u_str();\n    \/\/ Compute the text width\n    int width = 0;\n    for( uint32_t *ptr = pString; *ptr; ptr++ )\n    {\n        uint32_t c = *ptr;\n        if( c < 256 && m_table[c].m_xPos != -1 )\n        {\n            width += m_advance;\n        }\n        else\n        {\n            width += m_skip;\n        }\n    }\n    \/\/ Create a bitmap\n    BitmapImpl *pBmp = new BitmapImpl( getIntf(), width, m_height );\n    int xDest = 0;\n    while( *pString )\n    {\n        uint32_t c = *(pString++);\n        if( c < 256 && m_table[c].m_xPos != -1 )\n        {\n            bool res = pBmp->drawBitmap( m_rBitmap, m_table[c].m_xPos,\n                                         m_table[c].m_yPos, xDest, 0,\n                                         m_width, m_height );\n            if ( !res )\n                msg_Warn( getIntf(), \"BitmapFont::drawString: ignoring char\" );\n            xDest += m_advance;\n        }\n        else\n        {\n            xDest += m_skip;\n        }\n    }\n    return pBmp;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: fmmodel.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: fs $ $Date: 2000-10-20 16:27:18 $\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 _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef SVX_LIGHT\n#ifndef _SFX_OBJSH_HXX \/\/autogen\n#include <sfx2\/objsh.hxx>\n#endif\n#else\nclass SfxObjectShell;\n#endif\n\n#pragma hdrstop\n\n#ifndef _FM_FMMODEL_HXX\n#include \"fmmodel.hxx\"\n#endif\n\n#ifndef _SVDIO_HXX\n#include \"svdio.hxx\"\n#endif\n\n#ifndef _FM_PAGE_HXX\n#include \"fmpage.hxx\"\n#endif\n#ifndef _SVX_FMUNDO_HXX\n#include \"fmundo.hxx\"\n#endif\n#ifndef _SVX_SVDOBJ_HXX\n#include \"svdobj.hxx\"\n#endif\n\nTYPEINIT1(FmFormModel, SdrModel);\n\nstruct FmFormModelImplData\n{\n    FmXUndoEnvironment*     pUndoEnv;\n    XubString               sNextPageId;\n};\n\n\/*************************************************************************\n|*\n|* Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(SfxItemPool* pPool, SvPersist* pPers)\n            :SdrModel(pPool, pPers, LOADREFCOUNTS)\n            ,pObjShell(0)\n            ,bStreamingOldVersion(sal_False)\n            ,m_pImpl(NULL)\n            ,m_bOpenInDesignMode(sal_True)\n            ,m_bAutoControlFocus(sal_False)\n{\n#ifndef SVX_LIGHT\n    m_pImpl = new FmFormModelImplData;\n    m_pImpl->pUndoEnv = new FmXUndoEnvironment(*this);\n    m_pImpl->pUndoEnv->acquire();\n    m_pImpl->sNextPageId = '0';\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(const XubString& rPath, SfxItemPool* pPool, SvPersist* pPers)\n            :SdrModel(rPath, pPool, pPers)\n            ,pObjShell(0)\n            ,bStreamingOldVersion(sal_False)\n            ,m_pImpl(NULL)\n            ,m_bOpenInDesignMode(sal_True)\n            ,m_bAutoControlFocus(sal_False)\n{\n#ifndef SVX_LIGHT\n    m_pImpl = new FmFormModelImplData;\n    m_pImpl->pUndoEnv = new FmXUndoEnvironment(*this);\n    m_pImpl->pUndoEnv->acquire();\n    m_pImpl->sNextPageId = '0';\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(SfxItemPool* pPool, SvPersist* pPers,\n                         FASTBOOL bUseExtColorTable\n                         )\n            :SdrModel(pPool, pPers, bUseExtColorTable, LOADREFCOUNTS)\n            ,pObjShell(0)\n            ,bStreamingOldVersion(sal_False)\n            ,m_pImpl(NULL)\n{\n#ifndef SVX_LIGHT\n    m_pImpl = new FmFormModelImplData;\n    m_pImpl->pUndoEnv = new FmXUndoEnvironment(*this);\n    m_pImpl->pUndoEnv->acquire();\n    m_pImpl->sNextPageId = '0';\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(const XubString& rPath, SfxItemPool* pPool, SvPersist* pPers,\n                         FASTBOOL bUseExtColorTable)\n            :SdrModel(rPath, pPool, pPers, bUseExtColorTable, LOADREFCOUNTS)\n            ,pObjShell(0)\n            ,bStreamingOldVersion(sal_False)\n            ,m_bOpenInDesignMode(sal_True)\n            ,m_bAutoControlFocus(sal_False)\n{\n#ifndef SVX_LIGHT\n    m_pImpl = new FmFormModelImplData;\n    m_pImpl->pUndoEnv = new FmXUndoEnvironment(*this);\n    m_pImpl->pUndoEnv->acquire();\n    m_pImpl->sNextPageId = '0';\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Dtor\n|*\n\\************************************************************************\/\nFmFormModel::~FmFormModel()\n{\n#ifndef SVX_LIGHT\n    if (pObjShell && m_pImpl->pUndoEnv->IsListening(*pObjShell))\n        SetObjectShell(NULL);\n\n    ClearUndoBuffer();\n    \/\/ minimale grenze fuer undos\n    SetMaxUndoActionCount(1);\n\n    m_pImpl->pUndoEnv->release();\n    delete m_pImpl;\n\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Copy-Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(const FmFormModel&)\n{\n    DBG_ERROR(\"FmFormModel: CopyCtor not implemented\");\n}\n\n\/*************************************************************************\n|*\n|* Operator=\n|*\n\\************************************************************************\/\nvoid FmFormModel::operator=(const FmFormModel&)\n{\n    DBG_ERROR(\"FmFormModel: operator= not implemented\");\n}\n\n\/*************************************************************************\n|*\n|* Operator==\n|*\n\\************************************************************************\/\nFASTBOOL FmFormModel::operator==(const FmFormModel&) const\n{\n    DBG_ERROR(\"FmFormModel: operator== not implemented\");\n    return sal_False;\n}\n\n\n\/*************************************************************************\n|*\n|* Erzeugt eine neue Seite\n|*\n\\************************************************************************\/\nSdrPage* FmFormModel::AllocPage(FASTBOOL bMasterPage)\n{\n    return new FmFormPage(*this, NULL, bMasterPage);\n}\n\n\/*************************************************************************\n|*\n|* WriteData\n|*\n\\************************************************************************\/\n\nvoid FmFormModel::WriteData(SvStream& rOut) const\n{\n#ifndef SVX_LIGHT\n\n    if( rOut.GetVersion() < SOFFICE_FILEFORMAT_50 )\n        ((FmFormModel*)this)->bStreamingOldVersion = sal_True;\n\n    SdrModel::WriteData( rOut );\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Speichern der Option OpenInDesignMode\n    if (!bStreamingOldVersion)\n    {\n        SdrDownCompat aModelFormatCompat(rOut,STREAM_WRITE);\n\n        sal_uInt8 nTemp = m_bOpenInDesignMode;\n        rOut << nTemp;\n\n        nTemp = m_bAutoControlFocus;\n        rOut << nTemp;\n    }\n\n    ((FmFormModel*)this)->bStreamingOldVersion = sal_False;\n\n#endif\n}\n\n\n\/*************************************************************************\n|*\n|* ReadData\n|*\n\\************************************************************************\/\nvoid FmFormModel::ReadData(const SdrIOHeader& rHead, SvStream& rIn)\n{\n    if( rIn.GetVersion() < SOFFICE_FILEFORMAT_50 )\n        ((FmFormModel*)this)->bStreamingOldVersion = sal_True;\n\n    SdrModel::ReadData( rHead, rIn );\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Lesen der Option OpenInDesignMode\n    if (!bStreamingOldVersion)\n    {\n        SdrDownCompat aCompat(rIn,STREAM_READ);\n        sal_uInt8 nTemp = 0;\n        rIn >> nTemp;\n        m_bOpenInDesignMode = nTemp ? sal_True : sal_False;\n\n        if (aCompat.GetBytesLeft())\n        {   \/\/ it is a version which already wrote the AutoControlFocus flag\n            rIn >> nTemp;\n            m_bAutoControlFocus = nTemp ? sal_True : sal_False;\n        }\n    }\n\n    ((FmFormModel*)this)->bStreamingOldVersion = sal_False;\n}\n\n\n\/*************************************************************************\n|*\n|* InsertPage\n|*\n\\************************************************************************\/\nvoid FmFormModel::InsertPage(SdrPage* pPage, sal_uInt16 nPos)\n{\n#ifndef SVX_LIGHT\n    \/\/ hack solange Methode intern\n    if (pObjShell && !m_pImpl->pUndoEnv->IsListening( *pObjShell ))\n        SetObjectShell(pObjShell);\n#endif\n\n    SdrModel::InsertPage( pPage, nPos );\n\n#ifndef SVX_LIGHT\n    if (pPage)\n        m_pImpl->pUndoEnv->AddForms(((FmFormPage*)pPage)->GetForms());\n#endif\n}\n\n\/*************************************************************************\n|*\n|* InsertPage\n|*\n\\************************************************************************\/\nSdrPage* FmFormModel::RemovePage(sal_uInt16 nPgNum)\n{\n    FmFormPage* pPage = (FmFormPage*)SdrModel::RemovePage(nPgNum);\n\n#ifndef SVX_LIGHT\n    if (pPage)\n        m_pImpl->pUndoEnv->RemoveForms(pPage->GetForms());\n#endif\n\n    return pPage;\n}\n\n\/*************************************************************************\n|*\n|* InsertMasterPage\n|*\n\\************************************************************************\/\nvoid FmFormModel::InsertMasterPage(SdrPage* pPage, sal_uInt16 nPos)\n{\n#ifndef SVX_LIGHT\n    \/\/ hack solange Methode intern\n    if (pObjShell && !m_pImpl->pUndoEnv->IsListening( *pObjShell ))\n        SetObjectShell(pObjShell);\n#endif\n\n    SdrModel::InsertMasterPage(pPage, nPos);\n\n#ifndef SVX_LIGHT\n    if (pPage)\n        m_pImpl->pUndoEnv->AddForms(((FmFormPage*)pPage)->GetForms());\n#endif\n}\n\n\/*************************************************************************\n|*\n|* RemoveMasterPage\n|*\n\\************************************************************************\/\nSdrPage* FmFormModel::RemoveMasterPage(sal_uInt16 nPgNum)\n{\n    FmFormPage* pPage = (FmFormPage*)SdrModel::RemoveMasterPage(nPgNum);\n\n#ifndef SVX_LIGHT\n    if (pPage)\n        m_pImpl->pUndoEnv->RemoveForms(pPage->GetForms());\n#endif\n\n    return pPage;\n}\n\n\/\/------------------------------------------------------------------------\nSdrLayerID FmFormModel::GetControlExportLayerId( const SdrObject& rObj ) const\n{\n    return rObj.GetLayer();\n}\n\n\/\/------------------------------------------------------------------------\nvoid FmFormModel::SetOpenInDesignMode( sal_Bool bOpenDesignMode )\n{\n#ifndef SVX_LIGHT\n    if( bOpenDesignMode != m_bOpenInDesignMode )\n    {\n        m_bOpenInDesignMode = bOpenDesignMode;\n        pObjShell->SetModified( sal_True );\n    }\n#endif\n}\n\n\/\/------------------------------------------------------------------------\nvoid FmFormModel::SetAutoControlFocus( sal_Bool _bAutoControlFocus )\n{\n#ifndef SVX_LIGHT\n    if( _bAutoControlFocus != m_bAutoControlFocus )\n    {\n        m_bAutoControlFocus = _bAutoControlFocus;\n        pObjShell->SetModified( sal_True );\n    }\n#endif\n}\n\n\/\/------------------------------------------------------------------------\nvoid FmFormModel::SetObjectShell( SfxObjectShell* pShell )\n{\n#ifndef SVX_LIGHT\n    if (pShell == pObjShell)\n        return;\n\n    if (pObjShell)\n    {\n        m_pImpl->pUndoEnv->EndListening( *this );\n        m_pImpl->pUndoEnv->EndListening( *pObjShell );\n    }\n\n    pObjShell = pShell;\n\n    if (pObjShell)\n    {\n        m_pImpl->pUndoEnv->SetReadOnly(pObjShell->IsReadOnly() || pObjShell->IsReadOnlyUI());\n\n        if (!m_pImpl->pUndoEnv->IsReadOnly())\n             m_pImpl->pUndoEnv->StartListening(*this);\n\n        m_pImpl->pUndoEnv->StartListening( *pObjShell );\n    }\n#endif\n}\n\n\/\/------------------------------------------------------------------------\nFmXUndoEnvironment& FmFormModel::GetUndoEnv()\n{\n    return *m_pImpl->pUndoEnv;\n}\n\n\/\/------------------------------------------------------------------------\nXubString FmFormModel::GetUniquePageId()\n{\n    XubString sReturn = m_pImpl->sNextPageId;\n\n    xub_Unicode aNextChar = m_pImpl->sNextPageId.GetChar(m_pImpl->sNextPageId.Len() - 1);\n    sal_Bool bNeedNewChar = sal_False;\n    switch (aNextChar)\n    {\n        case '9' : aNextChar = 'A'; break;\n        case 'Z' : aNextChar = 'a'; break;\n        case 'z' : aNextChar = '0'; bNeedNewChar = sal_True; break;\n        default: ++aNextChar; break;\n    }\n    m_pImpl->sNextPageId.SetChar(m_pImpl->sNextPageId.Len() - 1, aNextChar);\n    if (bNeedNewChar)\n        m_pImpl->sNextPageId += '0';\n\n    return sReturn;\n}\n\n\n<commit_msg>94595# change default value for openindesignmode<commit_after>\/*************************************************************************\n *\n *  $RCSfile: fmmodel.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: oj $ $Date: 2001-11-15 08:38: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 _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef SVX_LIGHT\n#ifndef _SFX_OBJSH_HXX \/\/autogen\n#include <sfx2\/objsh.hxx>\n#endif\n#else\nclass SfxObjectShell;\n#endif\n\n#pragma hdrstop\n\n#ifndef _FM_FMMODEL_HXX\n#include \"fmmodel.hxx\"\n#endif\n\n#ifndef _SVDIO_HXX\n#include \"svdio.hxx\"\n#endif\n\n#ifndef _FM_PAGE_HXX\n#include \"fmpage.hxx\"\n#endif\n#ifndef _SVX_FMUNDO_HXX\n#include \"fmundo.hxx\"\n#endif\n#ifndef _SVX_SVDOBJ_HXX\n#include \"svdobj.hxx\"\n#endif\n\nTYPEINIT1(FmFormModel, SdrModel);\n\nstruct FmFormModelImplData\n{\n    FmXUndoEnvironment*     pUndoEnv;\n    XubString               sNextPageId;\n};\n\n\/*************************************************************************\n|*\n|* Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(SfxItemPool* pPool, SvPersist* pPers)\n            :SdrModel(pPool, pPers, LOADREFCOUNTS)\n            ,pObjShell(0)\n            ,bStreamingOldVersion(sal_False)\n            ,m_pImpl(NULL)\n            ,m_bOpenInDesignMode(sal_False)\n            ,m_bAutoControlFocus(sal_False)\n{\n#ifndef SVX_LIGHT\n    m_pImpl = new FmFormModelImplData;\n    m_pImpl->pUndoEnv = new FmXUndoEnvironment(*this);\n    m_pImpl->pUndoEnv->acquire();\n    m_pImpl->sNextPageId = '0';\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(const XubString& rPath, SfxItemPool* pPool, SvPersist* pPers)\n            :SdrModel(rPath, pPool, pPers)\n            ,pObjShell(0)\n            ,bStreamingOldVersion(sal_False)\n            ,m_pImpl(NULL)\n            ,m_bOpenInDesignMode(sal_False)\n            ,m_bAutoControlFocus(sal_False)\n{\n#ifndef SVX_LIGHT\n    m_pImpl = new FmFormModelImplData;\n    m_pImpl->pUndoEnv = new FmXUndoEnvironment(*this);\n    m_pImpl->pUndoEnv->acquire();\n    m_pImpl->sNextPageId = '0';\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(SfxItemPool* pPool, SvPersist* pPers,\n                         FASTBOOL bUseExtColorTable\n                         )\n            :SdrModel(pPool, pPers, bUseExtColorTable, LOADREFCOUNTS)\n            ,pObjShell(0)\n            ,bStreamingOldVersion(sal_False)\n            ,m_pImpl(NULL)\n{\n#ifndef SVX_LIGHT\n    m_pImpl = new FmFormModelImplData;\n    m_pImpl->pUndoEnv = new FmXUndoEnvironment(*this);\n    m_pImpl->pUndoEnv->acquire();\n    m_pImpl->sNextPageId = '0';\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(const XubString& rPath, SfxItemPool* pPool, SvPersist* pPers,\n                         FASTBOOL bUseExtColorTable)\n            :SdrModel(rPath, pPool, pPers, bUseExtColorTable, LOADREFCOUNTS)\n            ,pObjShell(0)\n            ,bStreamingOldVersion(sal_False)\n            ,m_bOpenInDesignMode(sal_False)\n            ,m_bAutoControlFocus(sal_False)\n{\n#ifndef SVX_LIGHT\n    m_pImpl = new FmFormModelImplData;\n    m_pImpl->pUndoEnv = new FmXUndoEnvironment(*this);\n    m_pImpl->pUndoEnv->acquire();\n    m_pImpl->sNextPageId = '0';\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Dtor\n|*\n\\************************************************************************\/\nFmFormModel::~FmFormModel()\n{\n#ifndef SVX_LIGHT\n    if (pObjShell && m_pImpl->pUndoEnv->IsListening(*pObjShell))\n        SetObjectShell(NULL);\n\n    ClearUndoBuffer();\n    \/\/ minimale grenze fuer undos\n    SetMaxUndoActionCount(1);\n\n    m_pImpl->pUndoEnv->release();\n    delete m_pImpl;\n\n#endif\n}\n\n\/*************************************************************************\n|*\n|* Copy-Ctor\n|*\n\\************************************************************************\/\nFmFormModel::FmFormModel(const FmFormModel&)\n{\n    DBG_ERROR(\"FmFormModel: CopyCtor not implemented\");\n}\n\n\/*************************************************************************\n|*\n|* Operator=\n|*\n\\************************************************************************\/\nvoid FmFormModel::operator=(const FmFormModel&)\n{\n    DBG_ERROR(\"FmFormModel: operator= not implemented\");\n}\n\n\/*************************************************************************\n|*\n|* Operator==\n|*\n\\************************************************************************\/\nFASTBOOL FmFormModel::operator==(const FmFormModel&) const\n{\n    DBG_ERROR(\"FmFormModel: operator== not implemented\");\n    return sal_False;\n}\n\n\n\/*************************************************************************\n|*\n|* Erzeugt eine neue Seite\n|*\n\\************************************************************************\/\nSdrPage* FmFormModel::AllocPage(FASTBOOL bMasterPage)\n{\n    return new FmFormPage(*this, NULL, bMasterPage);\n}\n\n\/*************************************************************************\n|*\n|* WriteData\n|*\n\\************************************************************************\/\n\nvoid FmFormModel::WriteData(SvStream& rOut) const\n{\n#ifndef SVX_LIGHT\n\n    if( rOut.GetVersion() < SOFFICE_FILEFORMAT_50 )\n        ((FmFormModel*)this)->bStreamingOldVersion = sal_True;\n\n    SdrModel::WriteData( rOut );\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Speichern der Option OpenInDesignMode\n    if (!bStreamingOldVersion)\n    {\n        SdrDownCompat aModelFormatCompat(rOut,STREAM_WRITE);\n\n        sal_uInt8 nTemp = m_bOpenInDesignMode;\n        rOut << nTemp;\n\n        nTemp = m_bAutoControlFocus;\n        rOut << nTemp;\n    }\n\n    ((FmFormModel*)this)->bStreamingOldVersion = sal_False;\n\n#endif\n}\n\n\n\/*************************************************************************\n|*\n|* ReadData\n|*\n\\************************************************************************\/\nvoid FmFormModel::ReadData(const SdrIOHeader& rHead, SvStream& rIn)\n{\n    if( rIn.GetVersion() < SOFFICE_FILEFORMAT_50 )\n        ((FmFormModel*)this)->bStreamingOldVersion = sal_True;\n\n    SdrModel::ReadData( rHead, rIn );\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Lesen der Option OpenInDesignMode\n    if (!bStreamingOldVersion)\n    {\n        SdrDownCompat aCompat(rIn,STREAM_READ);\n        sal_uInt8 nTemp = 0;\n        rIn >> nTemp;\n        m_bOpenInDesignMode = nTemp ? sal_True : sal_False;\n\n        if (aCompat.GetBytesLeft())\n        {   \/\/ it is a version which already wrote the AutoControlFocus flag\n            rIn >> nTemp;\n            m_bAutoControlFocus = nTemp ? sal_True : sal_False;\n        }\n    }\n\n    ((FmFormModel*)this)->bStreamingOldVersion = sal_False;\n}\n\n\n\/*************************************************************************\n|*\n|* InsertPage\n|*\n\\************************************************************************\/\nvoid FmFormModel::InsertPage(SdrPage* pPage, sal_uInt16 nPos)\n{\n#ifndef SVX_LIGHT\n    \/\/ hack solange Methode intern\n    if (pObjShell && !m_pImpl->pUndoEnv->IsListening( *pObjShell ))\n        SetObjectShell(pObjShell);\n#endif\n\n    SdrModel::InsertPage( pPage, nPos );\n\n#ifndef SVX_LIGHT\n    if (pPage)\n        m_pImpl->pUndoEnv->AddForms(((FmFormPage*)pPage)->GetForms());\n#endif\n}\n\n\/*************************************************************************\n|*\n|* InsertPage\n|*\n\\************************************************************************\/\nSdrPage* FmFormModel::RemovePage(sal_uInt16 nPgNum)\n{\n    FmFormPage* pPage = (FmFormPage*)SdrModel::RemovePage(nPgNum);\n\n#ifndef SVX_LIGHT\n    if (pPage)\n        m_pImpl->pUndoEnv->RemoveForms(pPage->GetForms());\n#endif\n\n    return pPage;\n}\n\n\/*************************************************************************\n|*\n|* InsertMasterPage\n|*\n\\************************************************************************\/\nvoid FmFormModel::InsertMasterPage(SdrPage* pPage, sal_uInt16 nPos)\n{\n#ifndef SVX_LIGHT\n    \/\/ hack solange Methode intern\n    if (pObjShell && !m_pImpl->pUndoEnv->IsListening( *pObjShell ))\n        SetObjectShell(pObjShell);\n#endif\n\n    SdrModel::InsertMasterPage(pPage, nPos);\n\n#ifndef SVX_LIGHT\n    if (pPage)\n        m_pImpl->pUndoEnv->AddForms(((FmFormPage*)pPage)->GetForms());\n#endif\n}\n\n\/*************************************************************************\n|*\n|* RemoveMasterPage\n|*\n\\************************************************************************\/\nSdrPage* FmFormModel::RemoveMasterPage(sal_uInt16 nPgNum)\n{\n    FmFormPage* pPage = (FmFormPage*)SdrModel::RemoveMasterPage(nPgNum);\n\n#ifndef SVX_LIGHT\n    if (pPage)\n        m_pImpl->pUndoEnv->RemoveForms(pPage->GetForms());\n#endif\n\n    return pPage;\n}\n\n\/\/------------------------------------------------------------------------\nSdrLayerID FmFormModel::GetControlExportLayerId( const SdrObject& rObj ) const\n{\n    return rObj.GetLayer();\n}\n\n\/\/------------------------------------------------------------------------\nvoid FmFormModel::SetOpenInDesignMode( sal_Bool bOpenDesignMode )\n{\n#ifndef SVX_LIGHT\n    if( bOpenDesignMode != m_bOpenInDesignMode )\n    {\n        m_bOpenInDesignMode = bOpenDesignMode;\n        pObjShell->SetModified( sal_True );\n    }\n#endif\n}\n\n\/\/------------------------------------------------------------------------\nvoid FmFormModel::SetAutoControlFocus( sal_Bool _bAutoControlFocus )\n{\n#ifndef SVX_LIGHT\n    if( _bAutoControlFocus != m_bAutoControlFocus )\n    {\n        m_bAutoControlFocus = _bAutoControlFocus;\n        pObjShell->SetModified( sal_True );\n    }\n#endif\n}\n\n\/\/------------------------------------------------------------------------\nvoid FmFormModel::SetObjectShell( SfxObjectShell* pShell )\n{\n#ifndef SVX_LIGHT\n    if (pShell == pObjShell)\n        return;\n\n    if (pObjShell)\n    {\n        m_pImpl->pUndoEnv->EndListening( *this );\n        m_pImpl->pUndoEnv->EndListening( *pObjShell );\n    }\n\n    pObjShell = pShell;\n\n    if (pObjShell)\n    {\n        m_pImpl->pUndoEnv->SetReadOnly(pObjShell->IsReadOnly() || pObjShell->IsReadOnlyUI());\n\n        if (!m_pImpl->pUndoEnv->IsReadOnly())\n             m_pImpl->pUndoEnv->StartListening(*this);\n\n        m_pImpl->pUndoEnv->StartListening( *pObjShell );\n    }\n#endif\n}\n\n\/\/------------------------------------------------------------------------\nFmXUndoEnvironment& FmFormModel::GetUndoEnv()\n{\n    return *m_pImpl->pUndoEnv;\n}\n\n\/\/------------------------------------------------------------------------\nXubString FmFormModel::GetUniquePageId()\n{\n    XubString sReturn = m_pImpl->sNextPageId;\n\n    xub_Unicode aNextChar = m_pImpl->sNextPageId.GetChar(m_pImpl->sNextPageId.Len() - 1);\n    sal_Bool bNeedNewChar = sal_False;\n    switch (aNextChar)\n    {\n        case '9' : aNextChar = 'A'; break;\n        case 'Z' : aNextChar = 'a'; break;\n        case 'z' : aNextChar = '0'; bNeedNewChar = sal_True; break;\n        default: ++aNextChar; break;\n    }\n    m_pImpl->sNextPageId.SetChar(m_pImpl->sNextPageId.Len() - 1, aNextChar);\n    if (bNeedNewChar)\n        m_pImpl->sNextPageId += '0';\n\n    return sReturn;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n    Copyright (c) The Taichi Authors (2016- ). All Rights Reserved.\n    The use of this software is governed by the LICENSE file.\n*******************************************************************************\/\n\n#include \"taichi\/system\/traceback.h\"\n\n#include <vector>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <cstdio>\n#include <algorithm>\n#include <memory>\n#include <mutex>\n#include \"spdlog\/fmt\/bundled\/color.h\"\n\n#if defined(__APPLE__) || \\\n    (defined(__unix__) && !defined(__linux__)) && !defined(ANDROID)\n#include <execinfo.h>\n#include <cxxabi.h>\n#endif\n#ifdef _WIN64\n#include <intrin.h>\n#include <dbghelp.h>\n\n#include \"taichi\/platform\/windows\/windows.h\"\n\n#pragma comment(lib, \"dbghelp.lib\")\n\/\/  https:\/\/gist.github.com\/rioki\/85ca8295d51a5e0b7c56e5005b0ba8b4\n\/\/\n\/\/  Debug Helpers\n\/\/\n\/\/ Copyright (c) 2015 - 2017 Sean Farrell <sean.farrell@rioki.org>\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\nnamespace dbg {\nvoid trace(const char *msg, ...) {\n  char buff[1024];\n\n  va_list args;\n  va_start(args, msg);\n  vsnprintf(buff, 1024, msg, args);\n\n  OutputDebugStringA(buff);\n\n  va_end(args);\n}\n\nstd::string basename(const std::string &file) {\n  unsigned int i = file.find_last_of(\"\\\\\/\");\n  if (i == std::string::npos) {\n    return file;\n  } else {\n    return file.substr(i + 1);\n  }\n}\n\nstruct StackFrame {\n  DWORD64 address;\n  std::string name;\n  std::string module;\n  unsigned int line;\n  std::string file;\n};\n\ninline std::vector<StackFrame> stack_trace() {\n#if _WIN64\n  DWORD machine = IMAGE_FILE_MACHINE_AMD64;\n#else\n  DWORD machine = IMAGE_FILE_MACHINE_I386;\n#endif\n  HANDLE process = GetCurrentProcess();\n  HANDLE thread = GetCurrentThread();\n\n  if (SymInitialize(process, NULL, TRUE) == FALSE) {\n    trace(\"Failed to call SymInitialize.\");\n    return std::vector<StackFrame>();\n  }\n\n  SymSetOptions(SYMOPT_LOAD_LINES);\n\n  CONTEXT context = {};\n  context.ContextFlags = CONTEXT_FULL;\n  RtlCaptureContext(&context);\n\n#if _WIN64\n  STACKFRAME frame = {};\n  frame.AddrPC.Offset = context.Rip;\n  frame.AddrPC.Mode = AddrModeFlat;\n  frame.AddrFrame.Offset = context.Rbp;\n  frame.AddrFrame.Mode = AddrModeFlat;\n  frame.AddrStack.Offset = context.Rsp;\n  frame.AddrStack.Mode = AddrModeFlat;\n#else\n  STACKFRAME frame = {};\n  frame.AddrPC.Offset = context.Eip;\n  frame.AddrPC.Mode = AddrModeFlat;\n  frame.AddrFrame.Offset = context.Ebp;\n  frame.AddrFrame.Mode = AddrModeFlat;\n  frame.AddrStack.Offset = context.Esp;\n  frame.AddrStack.Mode = AddrModeFlat;\n#endif\n\n  bool first = true;\n\n  std::vector<StackFrame> frames;\n  while (StackWalk(machine, process, thread, &frame, &context, NULL,\n                   SymFunctionTableAccess, SymGetModuleBase, NULL)) {\n    StackFrame f = {};\n    f.address = frame.AddrPC.Offset;\n\n#if _WIN64\n    DWORD64 moduleBase = 0;\n#else\n    DWORD moduleBase = 0;\n#endif\n\n    moduleBase = SymGetModuleBase(process, frame.AddrPC.Offset);\n\n    char moduelBuff[MAX_PATH];\n    if (moduleBase &&\n        GetModuleFileNameA((HINSTANCE)moduleBase, moduelBuff, MAX_PATH)) {\n      f.module = basename(moduelBuff);\n    } else {\n      f.module = \"Unknown Module\";\n    }\n#if _WIN64\n    DWORD64 offset = 0;\n#else\n    DWORD offset = 0;\n#endif\n    char symbolBuffer[sizeof(IMAGEHLP_SYMBOL) + 255];\n    PIMAGEHLP_SYMBOL symbol = (PIMAGEHLP_SYMBOL)symbolBuffer;\n    symbol->SizeOfStruct = sizeof(IMAGEHLP_SYMBOL) + 255;\n    symbol->MaxNameLength = 254;\n\n    if (SymGetSymFromAddr(process, frame.AddrPC.Offset, &offset, symbol)) {\n      f.name = symbol->Name;\n    } else {\n      DWORD error = GetLastError();\n      trace(\"Failed to resolve address 0x%X: %u\\n\", frame.AddrPC.Offset, error);\n      f.name = \"Unknown Function\";\n    }\n\n    IMAGEHLP_LINE line;\n    line.SizeOfStruct = sizeof(IMAGEHLP_LINE);\n\n    DWORD offset_ln = 0;\n    if (SymGetLineFromAddr(process, frame.AddrPC.Offset, &offset_ln, &line)) {\n      f.file = line.FileName;\n      f.line = line.LineNumber;\n    } else {\n      DWORD error = GetLastError();\n      trace(\"Failed to resolve line for 0x%X: %u\\n\", frame.AddrPC.Offset,\n            error);\n      f.line = 0;\n    }\n\n    if (!first) {\n      frames.push_back(f);\n    }\n    first = false;\n  }\n\n  SymCleanup(process);\n\n  return frames;\n}\n}  \/\/ namespace dbg\n#endif\n#if defined(__linux__) && !defined(ANDROID)\n#include <execinfo.h>\n#include <signal.h>\n#include <ucontext.h>\n#include <unistd.h>\n#include <cxxabi.h>\n#endif\n\nTI_NAMESPACE_BEGIN\n\nvoid print_traceback() {\n#ifdef __APPLE__\n  static std::mutex traceback_printer_mutex;\n  \/\/ Modified based on\n  \/\/ http:\/\/www.nullptr.me\/2013\/04\/14\/generating-stack-trace-on-os-x\/\n  \/\/ TODO: print line number instead of offset\n  \/\/ (https:\/\/stackoverflow.com\/questions\/8278691\/how-to-fix-backtrace-line-number-error-in-c)\n\n  \/\/ record stack trace upto 128 frames\n  void *callstack[128] = {};\n  \/\/ collect stack frames\n  int frames = backtrace((void **)callstack, 128);\n  \/\/ get the human-readable symbols (mangled)\n  char **strs = backtrace_symbols((void **)callstack, frames);\n  std::vector<std::string> stack_frames;\n  for (int i = 0; i < frames; i++) {\n    char function_symbol[1024] = {};\n    char module_name[1024] = {};\n    int offset = 0;\n    char addr[48] = {};\n    \/\/ split the string, take out chunks out of stack trace\n    \/\/ we are primarily interested in module, function and address\n    sscanf(strs[i], \"%*s %s %s %s %*s %d\", module_name, addr, function_symbol,\n           &offset);\n\n    int valid_cpp_name = 0;\n    \/\/  if this is a C++ library, symbol will be demangled\n    \/\/  on success function returns 0\n    char *function_name =\n        abi::__cxa_demangle(function_symbol, NULL, 0, &valid_cpp_name);\n\n    char stack_frame[4096] = {};\n    sprintf(stack_frame, \"* %28s | %7d | %s\", module_name, offset,\n            function_name);\n    if (function_name != nullptr)\n      free(function_name);\n\n    std::string frameStr(stack_frame);\n    stack_frames.push_back(frameStr);\n  }\n  free(strs);\n\n  \/\/ Pretty print the traceback table\n  \/\/ Exclude this function itself\n  stack_frames.erase(stack_frames.begin());\n  std::reverse(stack_frames.begin(), stack_frames.end());\n  std::lock_guard<std::mutex> guard(traceback_printer_mutex);\n  printf(\"\\n\");\n  printf(\n      \"                            * Taichi Core - Stack Traceback *           \"\n      \"                  \\n\");\n  printf(\n      \"========================================================================\"\n      \"==================\\n\");\n  printf(\n      \"|                       Module |  Offset | Function                     \"\n      \"                 |\\n\");\n  printf(\n      \"|-----------------------------------------------------------------------\"\n      \"-----------------|\\n\");\n  std::reverse(stack_frames.begin(), stack_frames.end());\n  for (auto trace : stack_frames) {\n    const int function_start = 39;\n    const int line_width = 86;\n    const int function_width = line_width - function_start - 2;\n    int i;\n    for (i = 0; i < (int)trace.size(); i++) {\n      std::cout << trace[i];\n      if (i > function_start + 3 &&\n          (i - 3 - function_start) % function_width == 0) {\n        std::cout << \" |\" << std::endl << \" \";\n        for (int j = 0; j < function_start; j++) {\n          std::cout << \" \";\n        }\n        std::cout << \" | \";\n      }\n    }\n    for (int j = 0;\n         j < function_width + 2 - (i - 3 - function_start) % function_width;\n         j++) {\n      std::cout << \" \";\n    }\n    std::cout << \"|\" << std::endl;\n  }\n  printf(\n      \"========================================================================\"\n      \"==================\\n\");\n  printf(\"\\n\");\n#elif defined(_WIN64)\n  \/\/ Windows\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta), \"* Taichi Compiler Stack Traceback *\\n\");\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n\n  std::vector<dbg::StackFrame> stack = dbg::stack_trace();\n  for (unsigned int i = 0; i < stack.size(); i++) {\n    fmt::print(fg(fmt::color::magenta),\n               fmt::format(\"0x{:x}: \", stack[i].address));\n    fmt::print(fg(fmt::color::red), stack[i].name);\n    if (stack[i].file != std::string(\"\"))\n      fmt::print(fg(fmt::color::magenta),\n                 fmt::format(\"(line {} in {})\", stack[i].line, stack[i].file));\n    fmt::print(fg(fmt::color::magenta),\n               fmt::format(\" in {}\\n\", stack[i].module));\n  }\n#elif defined(ANDROID)\n  \/\/ Not supported\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta), \"* Taichi Compiler Stack Traceback *\\n\");\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta), \"NOT SUPPORTED ON ANDROID\\n\");\n#else\n  \/\/ Based on http:\/\/man7.org\/linux\/man-pages\/man3\/backtrace.3.html\n  constexpr int BT_BUF_SIZE = 1024;\n  int nptrs;\n  void *buffer[BT_BUF_SIZE];\n  char **strings;\n\n  nptrs = backtrace(buffer, BT_BUF_SIZE);\n  strings = backtrace_symbols(buffer, nptrs);\n\n  if (strings == nullptr) {\n    perror(\"backtrace_symbols\");\n    exit(EXIT_FAILURE);\n  }\n\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta), \"* Taichi Compiler Stack Traceback *\\n\");\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n\n  \/\/ j = 0: taichi::print_traceback\n  for (int j = 1; j < nptrs; j++) {\n    std::string s(strings[j]);\n    std::size_t slash = s.find(\"\/\");\n    std::size_t start = s.find(\"(\");\n    std::size_t end = s.rfind(\"+\");\n\n    std::string line;\n\n    if (slash == 0 && start < end && s[start + 1] != '+') {\n      std::string name = s.substr(start + 1, end - start - 1);\n\n      char *demangled_name_;\n\n      int status = -1;\n\n      demangled_name_ = abi::__cxa_demangle(name.c_str(), NULL, NULL, &status);\n\n      if (demangled_name_) {\n        name = std::string(demangled_name_);\n      }\n\n      std::string prefix = s.substr(0, start);\n\n      line = fmt::format(\"{}: {}\", prefix, name);\n      free(demangled_name_);\n    } else {\n      line = s;\n    }\n    fmt::print(fg(fmt::color::magenta), \"{}\\n\", line);\n  }\n  std::free(strings);\n#endif\n\n  fmt::print(\n      fg(fmt::color::orange),\n      \"\\nInternal error occurred. Check out this page for possible solutions:\\n\"\n      \"https:\/\/docs.taichi.graphics\/lang\/articles\/misc\/install\\n\");\n}\n\nTI_NAMESPACE_END\n<commit_msg>[javascript] Disable stack trace logging when TI_EMSCRIPTENED (JS 9\/n) (#4117)<commit_after>\/*******************************************************************************\n    Copyright (c) The Taichi Authors (2016- ). All Rights Reserved.\n    The use of this software is governed by the LICENSE file.\n*******************************************************************************\/\n\n#include \"taichi\/system\/traceback.h\"\n\n#include <vector>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <cstdio>\n#include <algorithm>\n#include <memory>\n#include <mutex>\n#include \"spdlog\/fmt\/bundled\/color.h\"\n\n#if defined(__APPLE__) || (defined(__unix__) && !defined(__linux__)) && \\\n                              !defined(ANDROID) && !defined(TI_EMSCRIPTENED)\n#include <execinfo.h>\n#include <cxxabi.h>\n#endif\n#ifdef _WIN64\n#include <intrin.h>\n#include <dbghelp.h>\n\n#include \"taichi\/platform\/windows\/windows.h\"\n\n#pragma comment(lib, \"dbghelp.lib\")\n\/\/  https:\/\/gist.github.com\/rioki\/85ca8295d51a5e0b7c56e5005b0ba8b4\n\/\/\n\/\/  Debug Helpers\n\/\/\n\/\/ Copyright (c) 2015 - 2017 Sean Farrell <sean.farrell@rioki.org>\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\nnamespace dbg {\nvoid trace(const char *msg, ...) {\n  char buff[1024];\n\n  va_list args;\n  va_start(args, msg);\n  vsnprintf(buff, 1024, msg, args);\n\n  OutputDebugStringA(buff);\n\n  va_end(args);\n}\n\nstd::string basename(const std::string &file) {\n  unsigned int i = file.find_last_of(\"\\\\\/\");\n  if (i == std::string::npos) {\n    return file;\n  } else {\n    return file.substr(i + 1);\n  }\n}\n\nstruct StackFrame {\n  DWORD64 address;\n  std::string name;\n  std::string module;\n  unsigned int line;\n  std::string file;\n};\n\ninline std::vector<StackFrame> stack_trace() {\n#if _WIN64\n  DWORD machine = IMAGE_FILE_MACHINE_AMD64;\n#else\n  DWORD machine = IMAGE_FILE_MACHINE_I386;\n#endif\n  HANDLE process = GetCurrentProcess();\n  HANDLE thread = GetCurrentThread();\n\n  if (SymInitialize(process, NULL, TRUE) == FALSE) {\n    trace(\"Failed to call SymInitialize.\");\n    return std::vector<StackFrame>();\n  }\n\n  SymSetOptions(SYMOPT_LOAD_LINES);\n\n  CONTEXT context = {};\n  context.ContextFlags = CONTEXT_FULL;\n  RtlCaptureContext(&context);\n\n#if _WIN64\n  STACKFRAME frame = {};\n  frame.AddrPC.Offset = context.Rip;\n  frame.AddrPC.Mode = AddrModeFlat;\n  frame.AddrFrame.Offset = context.Rbp;\n  frame.AddrFrame.Mode = AddrModeFlat;\n  frame.AddrStack.Offset = context.Rsp;\n  frame.AddrStack.Mode = AddrModeFlat;\n#else\n  STACKFRAME frame = {};\n  frame.AddrPC.Offset = context.Eip;\n  frame.AddrPC.Mode = AddrModeFlat;\n  frame.AddrFrame.Offset = context.Ebp;\n  frame.AddrFrame.Mode = AddrModeFlat;\n  frame.AddrStack.Offset = context.Esp;\n  frame.AddrStack.Mode = AddrModeFlat;\n#endif\n\n  bool first = true;\n\n  std::vector<StackFrame> frames;\n  while (StackWalk(machine, process, thread, &frame, &context, NULL,\n                   SymFunctionTableAccess, SymGetModuleBase, NULL)) {\n    StackFrame f = {};\n    f.address = frame.AddrPC.Offset;\n\n#if _WIN64\n    DWORD64 moduleBase = 0;\n#else\n    DWORD moduleBase = 0;\n#endif\n\n    moduleBase = SymGetModuleBase(process, frame.AddrPC.Offset);\n\n    char moduelBuff[MAX_PATH];\n    if (moduleBase &&\n        GetModuleFileNameA((HINSTANCE)moduleBase, moduelBuff, MAX_PATH)) {\n      f.module = basename(moduelBuff);\n    } else {\n      f.module = \"Unknown Module\";\n    }\n#if _WIN64\n    DWORD64 offset = 0;\n#else\n    DWORD offset = 0;\n#endif\n    char symbolBuffer[sizeof(IMAGEHLP_SYMBOL) + 255];\n    PIMAGEHLP_SYMBOL symbol = (PIMAGEHLP_SYMBOL)symbolBuffer;\n    symbol->SizeOfStruct = sizeof(IMAGEHLP_SYMBOL) + 255;\n    symbol->MaxNameLength = 254;\n\n    if (SymGetSymFromAddr(process, frame.AddrPC.Offset, &offset, symbol)) {\n      f.name = symbol->Name;\n    } else {\n      DWORD error = GetLastError();\n      trace(\"Failed to resolve address 0x%X: %u\\n\", frame.AddrPC.Offset, error);\n      f.name = \"Unknown Function\";\n    }\n\n    IMAGEHLP_LINE line;\n    line.SizeOfStruct = sizeof(IMAGEHLP_LINE);\n\n    DWORD offset_ln = 0;\n    if (SymGetLineFromAddr(process, frame.AddrPC.Offset, &offset_ln, &line)) {\n      f.file = line.FileName;\n      f.line = line.LineNumber;\n    } else {\n      DWORD error = GetLastError();\n      trace(\"Failed to resolve line for 0x%X: %u\\n\", frame.AddrPC.Offset,\n            error);\n      f.line = 0;\n    }\n\n    if (!first) {\n      frames.push_back(f);\n    }\n    first = false;\n  }\n\n  SymCleanup(process);\n\n  return frames;\n}\n}  \/\/ namespace dbg\n#endif\n#if defined(__linux__) && !defined(ANDROID)\n#include <execinfo.h>\n#include <signal.h>\n#include <ucontext.h>\n#include <unistd.h>\n#include <cxxabi.h>\n#endif\n\nTI_NAMESPACE_BEGIN\n\nvoid print_traceback() {\n#ifdef __APPLE__\n  static std::mutex traceback_printer_mutex;\n  \/\/ Modified based on\n  \/\/ http:\/\/www.nullptr.me\/2013\/04\/14\/generating-stack-trace-on-os-x\/\n  \/\/ TODO: print line number instead of offset\n  \/\/ (https:\/\/stackoverflow.com\/questions\/8278691\/how-to-fix-backtrace-line-number-error-in-c)\n\n  \/\/ record stack trace upto 128 frames\n  void *callstack[128] = {};\n  \/\/ collect stack frames\n  int frames = backtrace((void **)callstack, 128);\n  \/\/ get the human-readable symbols (mangled)\n  char **strs = backtrace_symbols((void **)callstack, frames);\n  std::vector<std::string> stack_frames;\n  for (int i = 0; i < frames; i++) {\n    char function_symbol[1024] = {};\n    char module_name[1024] = {};\n    int offset = 0;\n    char addr[48] = {};\n    \/\/ split the string, take out chunks out of stack trace\n    \/\/ we are primarily interested in module, function and address\n    sscanf(strs[i], \"%*s %s %s %s %*s %d\", module_name, addr, function_symbol,\n           &offset);\n\n    int valid_cpp_name = 0;\n    \/\/  if this is a C++ library, symbol will be demangled\n    \/\/  on success function returns 0\n    char *function_name =\n        abi::__cxa_demangle(function_symbol, NULL, 0, &valid_cpp_name);\n\n    char stack_frame[4096] = {};\n    sprintf(stack_frame, \"* %28s | %7d | %s\", module_name, offset,\n            function_name);\n    if (function_name != nullptr)\n      free(function_name);\n\n    std::string frameStr(stack_frame);\n    stack_frames.push_back(frameStr);\n  }\n  free(strs);\n\n  \/\/ Pretty print the traceback table\n  \/\/ Exclude this function itself\n  stack_frames.erase(stack_frames.begin());\n  std::reverse(stack_frames.begin(), stack_frames.end());\n  std::lock_guard<std::mutex> guard(traceback_printer_mutex);\n  printf(\"\\n\");\n  printf(\n      \"                            * Taichi Core - Stack Traceback *           \"\n      \"                  \\n\");\n  printf(\n      \"========================================================================\"\n      \"==================\\n\");\n  printf(\n      \"|                       Module |  Offset | Function                     \"\n      \"                 |\\n\");\n  printf(\n      \"|-----------------------------------------------------------------------\"\n      \"-----------------|\\n\");\n  std::reverse(stack_frames.begin(), stack_frames.end());\n  for (auto trace : stack_frames) {\n    const int function_start = 39;\n    const int line_width = 86;\n    const int function_width = line_width - function_start - 2;\n    int i;\n    for (i = 0; i < (int)trace.size(); i++) {\n      std::cout << trace[i];\n      if (i > function_start + 3 &&\n          (i - 3 - function_start) % function_width == 0) {\n        std::cout << \" |\" << std::endl << \" \";\n        for (int j = 0; j < function_start; j++) {\n          std::cout << \" \";\n        }\n        std::cout << \" | \";\n      }\n    }\n    for (int j = 0;\n         j < function_width + 2 - (i - 3 - function_start) % function_width;\n         j++) {\n      std::cout << \" \";\n    }\n    std::cout << \"|\" << std::endl;\n  }\n  printf(\n      \"========================================================================\"\n      \"==================\\n\");\n  printf(\"\\n\");\n#elif defined(_WIN64)\n  \/\/ Windows\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta), \"* Taichi Compiler Stack Traceback *\\n\");\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n\n  std::vector<dbg::StackFrame> stack = dbg::stack_trace();\n  for (unsigned int i = 0; i < stack.size(); i++) {\n    fmt::print(fg(fmt::color::magenta),\n               fmt::format(\"0x{:x}: \", stack[i].address));\n    fmt::print(fg(fmt::color::red), stack[i].name);\n    if (stack[i].file != std::string(\"\"))\n      fmt::print(fg(fmt::color::magenta),\n                 fmt::format(\"(line {} in {})\", stack[i].line, stack[i].file));\n    fmt::print(fg(fmt::color::magenta),\n               fmt::format(\" in {}\\n\", stack[i].module));\n  }\n#elif defined(ANDROID)\n  \/\/ Not supported\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta), \"* Taichi Compiler Stack Traceback *\\n\");\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta), \"NOT SUPPORTED ON ANDROID\\n\");\n#elif defined(TI_EMSCRIPTENED)\n  \/\/ Not supported\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta),\n             \"* Emscriptened Taichi Compiler Stack Traceback *\\n\");\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n#else\n  \/\/ Based on http:\/\/man7.org\/linux\/man-pages\/man3\/backtrace.3.html\n  constexpr int BT_BUF_SIZE = 1024;\n  int nptrs;\n  void *buffer[BT_BUF_SIZE];\n  char **strings;\n\n  nptrs = backtrace(buffer, BT_BUF_SIZE);\n  strings = backtrace_symbols(buffer, nptrs);\n\n  if (strings == nullptr) {\n    perror(\"backtrace_symbols\");\n    exit(EXIT_FAILURE);\n  }\n\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n  fmt::print(fg(fmt::color::magenta), \"* Taichi Compiler Stack Traceback *\\n\");\n  fmt::print(fg(fmt::color::magenta), \"***********************************\\n\");\n\n  \/\/ j = 0: taichi::print_traceback\n  for (int j = 1; j < nptrs; j++) {\n    std::string s(strings[j]);\n    std::size_t slash = s.find(\"\/\");\n    std::size_t start = s.find(\"(\");\n    std::size_t end = s.rfind(\"+\");\n\n    std::string line;\n\n    if (slash == 0 && start < end && s[start + 1] != '+') {\n      std::string name = s.substr(start + 1, end - start - 1);\n\n      char *demangled_name_;\n\n      int status = -1;\n\n      demangled_name_ = abi::__cxa_demangle(name.c_str(), NULL, NULL, &status);\n\n      if (demangled_name_) {\n        name = std::string(demangled_name_);\n      }\n\n      std::string prefix = s.substr(0, start);\n\n      line = fmt::format(\"{}: {}\", prefix, name);\n      free(demangled_name_);\n    } else {\n      line = s;\n    }\n    fmt::print(fg(fmt::color::magenta), \"{}\\n\", line);\n  }\n  std::free(strings);\n#endif\n\n  fmt::print(\n      fg(fmt::color::orange),\n      \"\\nInternal error occurred. Check out this page for possible solutions:\\n\"\n      \"https:\/\/docs.taichi.graphics\/lang\/articles\/misc\/install\\n\");\n}\n\nTI_NAMESPACE_END\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\/\/                           License Agreement\n\/\/                For Open Source Computer Vision Library\n\/\/\n\/\/ Copyright (C) 2013, OpenCV Foundation, 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 the copyright holders 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#include \"precomp.hpp\"\n#include \"opencv2\/photo.hpp\"\n\n#include \"seamless_cloning.hpp\"\n\nusing namespace std;\nusing namespace cv;\n\nvoid cv::seamlessClone(InputArray _src, InputArray _dst, InputArray _mask, Point p, OutputArray _blend, int flags)\n{\n    CV_INSTRUMENT_REGION();\n\n    const Mat src  = _src.getMat();\n    const Mat dest = _dst.getMat();\n    const Mat mask = _mask.getMat();\n    dest.copyTo(_blend);\n    Mat blend = _blend.getMat();\n\n    Mat gray;\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n    {\n        if (mask.empty())\n            gray = Mat(src.rows, src.cols, CV_8UC1, Scalar(255));\n        else\n            mask.copyTo(gray);\n    }\n\n    Mat gray_inner = gray(Rect(1, 1, gray.cols - 2, gray.rows - 2));\n    copyMakeBorder(gray_inner, gray, 1, 1, 1, 1, BORDER_ISOLATED | BORDER_CONSTANT, Scalar(0));\n\n    int minx = INT_MAX, miny = INT_MAX, maxx = INT_MIN, maxy = INT_MIN;\n    int h = gray.size().height;\n    int w = gray.size().width;\n\n    for(int i=0;i<h;i++)\n    {\n        for(int j=0;j<w;j++)\n        {\n            if(gray.at<uchar>(i,j) == 255)\n            {\n                miny = std::min(miny,i);\n                maxy = std::max(maxy,i);\n                minx = std::min(minx,j);\n                maxx = std::max(maxx,j);\n            }\n        }\n    }\n\n    int lenx = maxx - minx + 1;\n    int leny = maxy - miny + 1;\n\n    int minxd = p.x - lenx\/2;\n    int minyd = p.y - leny\/2;\n\n    Rect roi_d(minxd,minyd,lenx,leny);\n    Rect roi_s(minx,miny,lenx,leny);\n\n    Mat destinationROI = dest(roi_d).clone();\n\n    Mat sourceROI = Mat::zeros(leny, lenx, src.type());\n    src(roi_s).copyTo(sourceROI,gray(roi_s));\n\n    Mat maskROI = gray(roi_s);\n    Mat recoveredROI = blend(roi_d);\n\n    Cloning obj;\n    obj.normalClone(destinationROI,sourceROI,maskROI,recoveredROI,flags);\n}\n\nvoid cv::colorChange(InputArray _src, InputArray _mask, OutputArray _dst, float red, float green, float blue)\n{\n    CV_INSTRUMENT_REGION();\n\n    Mat src  = _src.getMat();\n    Mat mask  = _mask.getMat();\n    _dst.create(src.size(), src.type());\n    Mat blend = _dst.getMat();\n\n    Mat gray, cs_mask;\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        mask.copyTo(gray);\n\n    src.copyTo(cs_mask,gray);\n\n    Cloning obj;\n    obj.localColorChange(src,cs_mask,gray,blend,red,green,blue);\n}\n\nvoid cv::illuminationChange(InputArray _src, InputArray _mask, OutputArray _dst, float alpha, float beta)\n{\n    CV_INSTRUMENT_REGION();\n\n    Mat src  = _src.getMat();\n    Mat mask  = _mask.getMat();\n    _dst.create(src.size(), src.type());\n    Mat blend = _dst.getMat();\n\n    Mat gray, cs_mask;\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        mask.copyTo(gray);\n\n    src.copyTo(cs_mask,gray);\n\n    Cloning obj;\n    obj.illuminationChange(src,cs_mask,gray,blend,alpha,beta);\n\n}\n\nvoid cv::textureFlattening(InputArray _src, InputArray _mask, OutputArray _dst,\n                           float low_threshold, float high_threshold, int kernel_size)\n{\n    CV_INSTRUMENT_REGION();\n\n    Mat src  = _src.getMat();\n    Mat mask  = _mask.getMat();\n    _dst.create(src.size(), src.type());\n    Mat blend = _dst.getMat();\n    Mat gray, cs_mask;\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        mask.copyTo(gray);\n\n    src.copyTo(cs_mask,gray);\n\n    Cloning obj;\n    obj.textureFlatten(src,cs_mask,gray,low_threshold,high_threshold,kernel_size,blend);\n}\n<commit_msg>Update seamless_cloning.cpp<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\/\/                           License Agreement\n\/\/                For Open Source Computer Vision Library\n\/\/\n\/\/ Copyright (C) 2013, OpenCV Foundation, 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 the copyright holders 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#include \"precomp.hpp\"\n#include \"opencv2\/photo.hpp\"\n\n#include \"seamless_cloning.hpp\"\n\nusing namespace std;\nusing namespace cv;\n\nstatic Mat checkMask(InputArray _mask, Size size)\n{\n    Mat mask = _mask.getMat();\n    Mat gray;\n    if (mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY);\n    else\n    {\n        if (mask.empty())\n            gray = Mat(size.height, size.width, CV_8UC1, Scalar(255));\n        else\n            mask.copyTo(gray);\n    }\n\n    return gray;\n}\n\nvoid cv::seamlessClone(InputArray _src, InputArray _dst, InputArray _mask, Point p, OutputArray _blend, int flags)\n{\n    CV_INSTRUMENT_REGION();\n\n    const Mat src  = _src.getMat();\n    const Mat dest = _dst.getMat();\n    Mat mask = checkMask(_mask, src.size());\n    dest.copyTo(_blend);\n    Mat blend = _blend.getMat();\n\n    Mat mask_inner = mask(Rect(1, 1, mask.cols - 2, mask.rows - 2));\n    copyMakeBorder(mask_inner, mask, 1, 1, 1, 1, BORDER_ISOLATED | BORDER_CONSTANT, Scalar(0));\n\n    Rect roi_s = boundingRect(mask);\n    Rect roi_d(p.x - roi_s.width \/ 2, p.y - roi_s.height \/ 2, roi_s.width, roi_s.height);\n\n    Mat destinationROI = dest(roi_d).clone();\n\n    Mat sourceROI = Mat::zeros(roi_s.height, roi_s.width, src.type());\n    src(roi_s).copyTo(sourceROI,mask(roi_s));\n\n    Mat maskROI = mask(roi_s);\n    Mat recoveredROI = blend(roi_d);\n\n    Cloning obj;\n    obj.normalClone(destinationROI,sourceROI,maskROI,recoveredROI,flags);\n}\n\nvoid cv::colorChange(InputArray _src, InputArray _mask, OutputArray _dst, float red, float green, float blue)\n{\n    CV_INSTRUMENT_REGION();\n\n    Mat src  = _src.getMat();\n    Mat mask = checkMask(_mask, src.size());\n    _dst.create(src.size(), src.type());\n    Mat blend = _dst.getMat();\n\n    Mat cs_mask = Mat::zeros(src.size(), src.type());\n    src.copyTo(cs_mask, mask);\n\n    Cloning obj;\n    obj.localColorChange(src, cs_mask, mask, blend, red, green, blue);\n}\n\nvoid cv::illuminationChange(InputArray _src, InputArray _mask, OutputArray _dst, float alpha, float beta)\n{\n    CV_INSTRUMENT_REGION();\n\n    Mat src  = _src.getMat();\n    Mat mask = checkMask(_mask, src.size());\n    _dst.create(src.size(), src.type());\n    Mat blend = _dst.getMat();\n\n    Mat cs_mask = Mat::zeros(src.size(), src.type());\n    src.copyTo(cs_mask, mask);\n\n    Cloning obj;\n    obj.illuminationChange(src, cs_mask, mask, blend, alpha, beta);\n\n}\n\nvoid cv::textureFlattening(InputArray _src, InputArray _mask, OutputArray _dst,\n                           float low_threshold, float high_threshold, int kernel_size)\n{\n    CV_INSTRUMENT_REGION();\n\n    Mat src  = _src.getMat();\n    Mat mask = checkMask(_mask, src.size());\n    _dst.create(src.size(), src.type());\n    Mat blend = _dst.getMat();\n\n    Mat cs_mask = Mat::zeros(src.size(), src.type());\n    src.copyTo(cs_mask, mask);\n\n    Cloning obj;\n    obj.textureFlatten(src, cs_mask, mask, low_threshold, high_threshold, kernel_size, blend);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cnttab.hxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 09:04:39 $\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 _CNTTAB_HXX\n#define _CNTTAB_HXX\n\n#ifndef _SVX_STDDLG_HXX \/\/autogen\n#include <svx\/stddlg.hxx>\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n\n#ifndef _EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _FIELD_HXX \/\/autogen\n#include <vcl\/field.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _SFXTABDLG_HXX \/\/autogen\n#include <sfx2\/tabdlg.hxx>\n#endif\n\n#include \"tox.hxx\"\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n#ifndef _TOXMGR_HXX\n#include <toxmgr.hxx>\n#endif\n#ifndef _SVX_CHECKLBX_HXX \/\/autogen wg. SvxCheckListBox\n#include <svx\/checklbx.hxx>\n#endif\n#ifndef _TOOLS_RESARY_HXX\n#include <tools\/resary.hxx>\n#endif\n#ifndef _SVTREEBOX_HXX\n#include <svtools\/svtreebx.hxx>\n#endif\n#ifndef _SV_MENUBTN_HXX\n#include <vcl\/menubtn.hxx>\n#endif\n#ifndef _SVX_LANGBOX_HXX\n#include <svx\/langbox.hxx>\n#endif\n#define TOX_PAGE_SELECT 1\n#define TOX_PAGE_ENTRY  2\n#define TOX_PAGE_STYLES 3\n\nstruct CurTOXType\n{\n    TOXTypes    eType;\n    USHORT      nIndex; \/\/for TOX_USER only\n\n    BOOL operator==(const CurTOXType aCmp)\n       {\n        return eType == aCmp.eType && nIndex == aCmp.nIndex;\n       }\n    USHORT GetFlatIndex() const;\n\n};\n\nclass SwOLENames : public Resource\n{\n    ResStringArray      aNamesAry;\npublic:\n    SwOLENames(const ResId& rResId) :\n        Resource(rResId),\n        aNamesAry(ResId(1)){FreeResource();}\n\n    ResStringArray&     GetNames() { return aNamesAry;}\n\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS residcleanup (1.14.728); FILE MERGED 2007\/03\/04 17:03:03 pl 1.14.728.1: #i73635# ResId cleanup<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cnttab.hxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-26 09:11: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#ifndef _CNTTAB_HXX\n#define _CNTTAB_HXX\n\n#ifndef _SVX_STDDLG_HXX \/\/autogen\n#include <svx\/stddlg.hxx>\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n\n#ifndef _EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _FIELD_HXX \/\/autogen\n#include <vcl\/field.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _SFXTABDLG_HXX \/\/autogen\n#include <sfx2\/tabdlg.hxx>\n#endif\n\n#include \"tox.hxx\"\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n#ifndef _TOXMGR_HXX\n#include <toxmgr.hxx>\n#endif\n#ifndef _SVX_CHECKLBX_HXX \/\/autogen wg. SvxCheckListBox\n#include <svx\/checklbx.hxx>\n#endif\n#ifndef _TOOLS_RESARY_HXX\n#include <tools\/resary.hxx>\n#endif\n#ifndef _SVTREEBOX_HXX\n#include <svtools\/svtreebx.hxx>\n#endif\n#ifndef _SV_MENUBTN_HXX\n#include <vcl\/menubtn.hxx>\n#endif\n#ifndef _SVX_LANGBOX_HXX\n#include <svx\/langbox.hxx>\n#endif\n#define TOX_PAGE_SELECT 1\n#define TOX_PAGE_ENTRY  2\n#define TOX_PAGE_STYLES 3\n\nstruct CurTOXType\n{\n    TOXTypes    eType;\n    USHORT      nIndex; \/\/for TOX_USER only\n\n    BOOL operator==(const CurTOXType aCmp)\n       {\n        return eType == aCmp.eType && nIndex == aCmp.nIndex;\n       }\n    USHORT GetFlatIndex() const;\n\n};\n\nclass SwOLENames : public Resource\n{\n    ResStringArray      aNamesAry;\npublic:\n    SwOLENames(const ResId& rResId) :\n        Resource(rResId),\n        aNamesAry(ResId(1,*rResId.GetResMgr())){FreeResource();}\n\n    ResStringArray&     GetNames() { return aNamesAry;}\n\n};\n\n#endif\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 \"RuntimeTypePch.h\"\n\nnamespace Js\n{\n    bool DynamicObjectPropertyEnumerator::GetEnumNonEnumerable() const\n    {\n        return !!(flags & EnumeratorFlags::EnumNonEnumerable);\n    }\n    bool DynamicObjectPropertyEnumerator::GetEnumSymbols() const\n    {\n        return !!(flags & EnumeratorFlags::EnumSymbols);\n    }\n    bool DynamicObjectPropertyEnumerator::GetSnapShotSemantics() const\n    {\n        return !!(flags & EnumeratorFlags::SnapShotSemantics);\n    }\n\n    bool DynamicObjectPropertyEnumerator::GetUseCache() const\n    {\n#if ENABLE_TTD\n        if(this->scriptContext->GetThreadContext()->IsRuntimeInTTDMode())\n        {\n            return false;\n        }\n#endif\n\n        return ((flags & (EnumeratorFlags::SnapShotSemantics | EnumeratorFlags::UseCache)) == (EnumeratorFlags::SnapShotSemantics | EnumeratorFlags::UseCache));\n    }\n\n    void DynamicObjectPropertyEnumerator::Initialize(DynamicType * type, CachedData * data, Js::BigPropertyIndex initialPropertyCount)\n    {\n        this->initialType = type;\n        this->cachedData = data;\n        this->initialPropertyCount = initialPropertyCount;\n    }\n\n    bool DynamicObjectPropertyEnumerator::Initialize(DynamicObject * object, EnumeratorFlags flags, ScriptContext * requestContext, EnumeratorCache * enumeratorCache)\n    {\n        this->scriptContext = requestContext;\n        this->object = object;\n        this->flags = flags;\n\n        if (!object)\n        {\n            this->cachedData = nullptr;\n            return true;\n        }\n\n        this->objectIndex = Constants::NoBigSlot;\n        this->enumeratedCount = 0;\n\n        if (!GetUseCache())\n        {\n            if (!object->GetDynamicType()->GetTypeHandler()->EnsureObjectReady(object))\n            {\n                return false;\n            }\n            Initialize(object->GetDynamicType(), nullptr, GetSnapShotSemantics() ? this->object->GetPropertyCount() : Constants::NoBigSlot);\n            return true;\n        }\n\n        DynamicType * type = object->GetDynamicType();\n\n        CachedData * data;\n        if (enumeratorCache && type == enumeratorCache->type)\n        {\n            data = (CachedData *)enumeratorCache->data;\n\n            Assert(data != nullptr);\n            Assert(data->scriptContext == this->scriptContext); \/\/ The cache data script context should be the same as request context\n\n            if (data->enumNonEnumerable == GetEnumNonEnumerable())\n            {\n                Initialize(type, data, data->propertyCount);\n                return true;\n            }\n        }\n\n        data = (CachedData *)requestContext->GetThreadContext()->GetDynamicObjectEnumeratorCache(type);\n\n        if (data != nullptr && data->scriptContext == this->scriptContext && data->enumNonEnumerable == GetEnumNonEnumerable() && data->enumSymbols == GetEnumSymbols())\n        {\n            Initialize(type, data, data->propertyCount);\n\n            if (enumeratorCache)\n            {\n                enumeratorCache->type = type;\n                enumeratorCache->data = data;\n            }\n            return true;\n        }\n\n        if (!object->GetDynamicType()->GetTypeHandler()->EnsureObjectReady(object))\n        {\n            return false;\n        }\n\n        \/\/ Reload the type after EnsureObjecteReady\n        type = object->GetDynamicType();\n        if (!type->PrepareForTypeSnapshotEnumeration())\n        {\n            Initialize(type, nullptr, object->GetPropertyCount());\n            return true;\n        }\n\n        uint propertyCount = this->object->GetPropertyCountForEnum();\n        data = RecyclerNewStructPlus(requestContext->GetRecycler(),\n            propertyCount * sizeof(Field(PropertyString*)) + propertyCount * sizeof(BigPropertyIndex) + propertyCount * sizeof(PropertyAttributes), CachedData);\n        data->scriptContext = requestContext;\n        data->cachedCount = 0;\n        data->propertyCount = propertyCount;\n        data->strings = reinterpret_cast<Field(PropertyString*)*>(data + 1);\n        data->indexes = unsafe_write_barrier_cast<BigPropertyIndex *>(data->strings + propertyCount);\n        data->attributes = (PropertyAttributes*)(data->indexes + propertyCount);\n        data->completed = false;\n        data->enumNonEnumerable = GetEnumNonEnumerable();\n        data->enumSymbols = GetEnumSymbols();\n        requestContext->GetThreadContext()->AddDynamicObjectEnumeratorCache(type, data);\n        Initialize(type, data, propertyCount);\n\n        if (enumeratorCache)\n        {\n            enumeratorCache->type = type;\n            enumeratorCache->data = data;\n        }\n        return true;\n    }\n\n    bool DynamicObjectPropertyEnumerator::IsNullEnumerator() const\n    {\n        return this->object == nullptr;\n    }\n\n    bool DynamicObjectPropertyEnumerator::CanUseJITFastPath() const\n    {\n#if ENABLE_TTD\n        TTDAssert(this->cachedData == nullptr || !this->scriptContext->GetThreadContext()->IsRuntimeInTTDMode(), \"We should always have cachedData null if we are in record or replay mode\");\n#endif\n\n        return !this->IsNullEnumerator() && !GetEnumNonEnumerable() && this->cachedData != nullptr;\n    }\n\n    void DynamicObjectPropertyEnumerator::Clear(EnumeratorFlags flags, ScriptContext * requestContext)\n    {\n        Initialize(nullptr, flags, requestContext, nullptr);\n    }\n\n    void DynamicObjectPropertyEnumerator::Reset()\n    {\n        Initialize(object, flags, scriptContext, nullptr);\n    }\n\n    DynamicType * DynamicObjectPropertyEnumerator::GetTypeToEnumerate() const\n    {\n        return\n            GetSnapShotSemantics() &&\n            initialType->GetIsLocked() &&\n            CONFIG_FLAG(TypeSnapshotEnumeration)\n            ? PointerValue(initialType)\n            : object->GetDynamicType();\n    }\n\n    JavascriptString * DynamicObjectPropertyEnumerator::MoveAndGetNextWithCache(PropertyId& propertyId, PropertyAttributes* attributes)\n    {\n#if ENABLE_TTD\n        AssertMsg(!this->scriptContext->GetThreadContext()->IsRuntimeInTTDMode(), \"We should always trap out to explicit enumeration in this case\");\n#endif\n\n        Assert(enumeratedCount <= cachedData->cachedCount);\n        JavascriptString* propertyStringName;\n        PropertyAttributes propertyAttributes = PropertyNone;\n        if (enumeratedCount < cachedData->cachedCount)\n        {\n            PropertyString * propertyString = cachedData->strings[enumeratedCount];\n            propertyStringName = propertyString;\n            propertyId = propertyString->GetPropertyId();\n\n#if DBG\n            PropertyId tempPropertyId;\n            \/* JavascriptString * tempPropertyString = *\/ this->MoveAndGetNextNoCache(tempPropertyId, attributes);\n\n            Assert(tempPropertyId == propertyId);\n            Assert(this->objectIndex == cachedData->indexes[enumeratedCount]);\n#endif\n\n            this->objectIndex = cachedData->indexes[enumeratedCount];\n            propertyAttributes = cachedData->attributes[enumeratedCount];\n\n            enumeratedCount++;\n        }\n        else if (!cachedData->completed)\n        {\n            propertyStringName = this->MoveAndGetNextNoCache(propertyId, &propertyAttributes);\n\n            if (propertyStringName)\n            {\n                PropertyString* propertyString = JavascriptOperators::TryFromVar<PropertyString>(propertyStringName);\n                if (propertyString != nullptr)\n                {\n                    Assert(enumeratedCount < this->initialPropertyCount);\n                    cachedData->strings[enumeratedCount] = propertyString;\n                    cachedData->indexes[enumeratedCount] = this->objectIndex;\n                    cachedData->attributes[enumeratedCount] = propertyAttributes;\n                    cachedData->cachedCount = ++enumeratedCount;\n                }\n            }\n            else\n            {\n                cachedData->completed = true;\n            }\n        }\n        else\n        {\n#if DBG\n            PropertyId tempPropertyId;\n            Assert(this->MoveAndGetNextNoCache(tempPropertyId, attributes) == nullptr);\n#endif\n\n            propertyStringName = nullptr;\n        }\n\n        if (attributes != nullptr)\n        {\n            *attributes = propertyAttributes;\n        }\n\n        return propertyStringName;\n    }\n    JavascriptString * DynamicObjectPropertyEnumerator::MoveAndGetNextNoCache(PropertyId& propertyId, PropertyAttributes * attributes)\n    {\n        JavascriptString* propertyString = nullptr;\n        BigPropertyIndex newIndex = this->objectIndex;\n        PropertyValueInfo info;\n        RecyclableObject * startingObject = this->object;\n        do\n        {\n            newIndex++;\n            PropertyValueInfo::ClearCacheInfo(&info);\n            if (!this->object->FindNextProperty(newIndex, &propertyString, &propertyId, attributes,\n                GetTypeToEnumerate(), flags, this->scriptContext, &info)\n                || (GetSnapShotSemantics() && PropertyIndexToPropertyEnumeration(newIndex) >= initialPropertyCount))\n            {\n                \/\/ No more properties\n                newIndex--;\n                propertyString = nullptr;\n                PropertyValueInfo::ClearCacheInfo(&info);\n                break;\n            }\n        } while (Js::IsInternalPropertyId(propertyId));\n\n        if (info.GetPropertyRecordUsageCache() != nullptr && info.GetPropertyRecordUsageCache()->ShouldUseCache() && propertyString == info.GetProperty())\n        {\n            CacheOperators::CachePropertyRead(startingObject, this->object, false, propertyId, false, &info, scriptContext);\n            if ((!(this->flags & EnumeratorFlags::EphemeralReference)) && info.IsStoreFieldCacheEnabled() && info.IsWritable() && ((info.GetFlags() & (InlineCacheGetterFlag | InlineCacheSetterFlag)) == 0))\n            {\n                PropertyValueInfo::SetCacheInfo(&info, info.GetPropertyRecordUsageCache()->GetStElemInlineCache(), info.AllowResizingPolymorphicInlineCache());\n                CacheOperators::CachePropertyWrite(this->object, false, this->object->GetType(), propertyId, &info, scriptContext);\n            }\n        }\n        this->objectIndex = newIndex;\n        return propertyString;\n    }\n\n    JavascriptString * DynamicObjectPropertyEnumerator::MoveAndGetNext(PropertyId& propertyId, PropertyAttributes * attributes)\n    {\n        propertyId = Js::Constants::NoProperty;\n        if (this->cachedData && this->initialType == this->object->GetDynamicType())\n        {\n            return MoveAndGetNextWithCache(propertyId, attributes);\n        }\n        if (this->object)\n        {\n            \/\/ Once enters NoCache path, ensure never switches to Cache path above.\n            this->cachedData = nullptr;\n            return MoveAndGetNextNoCache(propertyId, attributes);\n        }\n        return nullptr;\n    }\n}\n<commit_msg>Objecte -> Object<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 \"RuntimeTypePch.h\"\n\nnamespace Js\n{\n    bool DynamicObjectPropertyEnumerator::GetEnumNonEnumerable() const\n    {\n        return !!(flags & EnumeratorFlags::EnumNonEnumerable);\n    }\n    bool DynamicObjectPropertyEnumerator::GetEnumSymbols() const\n    {\n        return !!(flags & EnumeratorFlags::EnumSymbols);\n    }\n    bool DynamicObjectPropertyEnumerator::GetSnapShotSemantics() const\n    {\n        return !!(flags & EnumeratorFlags::SnapShotSemantics);\n    }\n\n    bool DynamicObjectPropertyEnumerator::GetUseCache() const\n    {\n#if ENABLE_TTD\n        if(this->scriptContext->GetThreadContext()->IsRuntimeInTTDMode())\n        {\n            return false;\n        }\n#endif\n\n        return ((flags & (EnumeratorFlags::SnapShotSemantics | EnumeratorFlags::UseCache)) == (EnumeratorFlags::SnapShotSemantics | EnumeratorFlags::UseCache));\n    }\n\n    void DynamicObjectPropertyEnumerator::Initialize(DynamicType * type, CachedData * data, Js::BigPropertyIndex initialPropertyCount)\n    {\n        this->initialType = type;\n        this->cachedData = data;\n        this->initialPropertyCount = initialPropertyCount;\n    }\n\n    bool DynamicObjectPropertyEnumerator::Initialize(DynamicObject * object, EnumeratorFlags flags, ScriptContext * requestContext, EnumeratorCache * enumeratorCache)\n    {\n        this->scriptContext = requestContext;\n        this->object = object;\n        this->flags = flags;\n\n        if (!object)\n        {\n            this->cachedData = nullptr;\n            return true;\n        }\n\n        this->objectIndex = Constants::NoBigSlot;\n        this->enumeratedCount = 0;\n\n        if (!GetUseCache())\n        {\n            if (!object->GetDynamicType()->GetTypeHandler()->EnsureObjectReady(object))\n            {\n                return false;\n            }\n            Initialize(object->GetDynamicType(), nullptr, GetSnapShotSemantics() ? this->object->GetPropertyCount() : Constants::NoBigSlot);\n            return true;\n        }\n\n        DynamicType * type = object->GetDynamicType();\n\n        CachedData * data;\n        if (enumeratorCache && type == enumeratorCache->type)\n        {\n            data = (CachedData *)enumeratorCache->data;\n\n            Assert(data != nullptr);\n            Assert(data->scriptContext == this->scriptContext); \/\/ The cache data script context should be the same as request context\n\n            if (data->enumNonEnumerable == GetEnumNonEnumerable())\n            {\n                Initialize(type, data, data->propertyCount);\n                return true;\n            }\n        }\n\n        data = (CachedData *)requestContext->GetThreadContext()->GetDynamicObjectEnumeratorCache(type);\n\n        if (data != nullptr && data->scriptContext == this->scriptContext && data->enumNonEnumerable == GetEnumNonEnumerable() && data->enumSymbols == GetEnumSymbols())\n        {\n            Initialize(type, data, data->propertyCount);\n\n            if (enumeratorCache)\n            {\n                enumeratorCache->type = type;\n                enumeratorCache->data = data;\n            }\n            return true;\n        }\n\n        if (!object->GetDynamicType()->GetTypeHandler()->EnsureObjectReady(object))\n        {\n            return false;\n        }\n\n        \/\/ Reload the type after EnsureObjectReady\n        type = object->GetDynamicType();\n        if (!type->PrepareForTypeSnapshotEnumeration())\n        {\n            Initialize(type, nullptr, object->GetPropertyCount());\n            return true;\n        }\n\n        uint propertyCount = this->object->GetPropertyCountForEnum();\n        data = RecyclerNewStructPlus(requestContext->GetRecycler(),\n            propertyCount * sizeof(Field(PropertyString*)) + propertyCount * sizeof(BigPropertyIndex) + propertyCount * sizeof(PropertyAttributes), CachedData);\n        data->scriptContext = requestContext;\n        data->cachedCount = 0;\n        data->propertyCount = propertyCount;\n        data->strings = reinterpret_cast<Field(PropertyString*)*>(data + 1);\n        data->indexes = unsafe_write_barrier_cast<BigPropertyIndex *>(data->strings + propertyCount);\n        data->attributes = (PropertyAttributes*)(data->indexes + propertyCount);\n        data->completed = false;\n        data->enumNonEnumerable = GetEnumNonEnumerable();\n        data->enumSymbols = GetEnumSymbols();\n        requestContext->GetThreadContext()->AddDynamicObjectEnumeratorCache(type, data);\n        Initialize(type, data, propertyCount);\n\n        if (enumeratorCache)\n        {\n            enumeratorCache->type = type;\n            enumeratorCache->data = data;\n        }\n        return true;\n    }\n\n    bool DynamicObjectPropertyEnumerator::IsNullEnumerator() const\n    {\n        return this->object == nullptr;\n    }\n\n    bool DynamicObjectPropertyEnumerator::CanUseJITFastPath() const\n    {\n#if ENABLE_TTD\n        TTDAssert(this->cachedData == nullptr || !this->scriptContext->GetThreadContext()->IsRuntimeInTTDMode(), \"We should always have cachedData null if we are in record or replay mode\");\n#endif\n\n        return !this->IsNullEnumerator() && !GetEnumNonEnumerable() && this->cachedData != nullptr;\n    }\n\n    void DynamicObjectPropertyEnumerator::Clear(EnumeratorFlags flags, ScriptContext * requestContext)\n    {\n        Initialize(nullptr, flags, requestContext, nullptr);\n    }\n\n    void DynamicObjectPropertyEnumerator::Reset()\n    {\n        Initialize(object, flags, scriptContext, nullptr);\n    }\n\n    DynamicType * DynamicObjectPropertyEnumerator::GetTypeToEnumerate() const\n    {\n        return\n            GetSnapShotSemantics() &&\n            initialType->GetIsLocked() &&\n            CONFIG_FLAG(TypeSnapshotEnumeration)\n            ? PointerValue(initialType)\n            : object->GetDynamicType();\n    }\n\n    JavascriptString * DynamicObjectPropertyEnumerator::MoveAndGetNextWithCache(PropertyId& propertyId, PropertyAttributes* attributes)\n    {\n#if ENABLE_TTD\n        AssertMsg(!this->scriptContext->GetThreadContext()->IsRuntimeInTTDMode(), \"We should always trap out to explicit enumeration in this case\");\n#endif\n\n        Assert(enumeratedCount <= cachedData->cachedCount);\n        JavascriptString* propertyStringName;\n        PropertyAttributes propertyAttributes = PropertyNone;\n        if (enumeratedCount < cachedData->cachedCount)\n        {\n            PropertyString * propertyString = cachedData->strings[enumeratedCount];\n            propertyStringName = propertyString;\n            propertyId = propertyString->GetPropertyId();\n\n#if DBG\n            PropertyId tempPropertyId;\n            \/* JavascriptString * tempPropertyString = *\/ this->MoveAndGetNextNoCache(tempPropertyId, attributes);\n\n            Assert(tempPropertyId == propertyId);\n            Assert(this->objectIndex == cachedData->indexes[enumeratedCount]);\n#endif\n\n            this->objectIndex = cachedData->indexes[enumeratedCount];\n            propertyAttributes = cachedData->attributes[enumeratedCount];\n\n            enumeratedCount++;\n        }\n        else if (!cachedData->completed)\n        {\n            propertyStringName = this->MoveAndGetNextNoCache(propertyId, &propertyAttributes);\n\n            if (propertyStringName)\n            {\n                PropertyString* propertyString = JavascriptOperators::TryFromVar<PropertyString>(propertyStringName);\n                if (propertyString != nullptr)\n                {\n                    Assert(enumeratedCount < this->initialPropertyCount);\n                    cachedData->strings[enumeratedCount] = propertyString;\n                    cachedData->indexes[enumeratedCount] = this->objectIndex;\n                    cachedData->attributes[enumeratedCount] = propertyAttributes;\n                    cachedData->cachedCount = ++enumeratedCount;\n                }\n            }\n            else\n            {\n                cachedData->completed = true;\n            }\n        }\n        else\n        {\n#if DBG\n            PropertyId tempPropertyId;\n            Assert(this->MoveAndGetNextNoCache(tempPropertyId, attributes) == nullptr);\n#endif\n\n            propertyStringName = nullptr;\n        }\n\n        if (attributes != nullptr)\n        {\n            *attributes = propertyAttributes;\n        }\n\n        return propertyStringName;\n    }\n    JavascriptString * DynamicObjectPropertyEnumerator::MoveAndGetNextNoCache(PropertyId& propertyId, PropertyAttributes * attributes)\n    {\n        JavascriptString* propertyString = nullptr;\n        BigPropertyIndex newIndex = this->objectIndex;\n        PropertyValueInfo info;\n        RecyclableObject * startingObject = this->object;\n        do\n        {\n            newIndex++;\n            PropertyValueInfo::ClearCacheInfo(&info);\n            if (!this->object->FindNextProperty(newIndex, &propertyString, &propertyId, attributes,\n                GetTypeToEnumerate(), flags, this->scriptContext, &info)\n                || (GetSnapShotSemantics() && PropertyIndexToPropertyEnumeration(newIndex) >= initialPropertyCount))\n            {\n                \/\/ No more properties\n                newIndex--;\n                propertyString = nullptr;\n                PropertyValueInfo::ClearCacheInfo(&info);\n                break;\n            }\n        } while (Js::IsInternalPropertyId(propertyId));\n\n        if (info.GetPropertyRecordUsageCache() != nullptr && info.GetPropertyRecordUsageCache()->ShouldUseCache() && propertyString == info.GetProperty())\n        {\n            CacheOperators::CachePropertyRead(startingObject, this->object, false, propertyId, false, &info, scriptContext);\n            if ((!(this->flags & EnumeratorFlags::EphemeralReference)) && info.IsStoreFieldCacheEnabled() && info.IsWritable() && ((info.GetFlags() & (InlineCacheGetterFlag | InlineCacheSetterFlag)) == 0))\n            {\n                PropertyValueInfo::SetCacheInfo(&info, info.GetPropertyRecordUsageCache()->GetStElemInlineCache(), info.AllowResizingPolymorphicInlineCache());\n                CacheOperators::CachePropertyWrite(this->object, false, this->object->GetType(), propertyId, &info, scriptContext);\n            }\n        }\n        this->objectIndex = newIndex;\n        return propertyString;\n    }\n\n    JavascriptString * DynamicObjectPropertyEnumerator::MoveAndGetNext(PropertyId& propertyId, PropertyAttributes * attributes)\n    {\n        propertyId = Js::Constants::NoProperty;\n        if (this->cachedData && this->initialType == this->object->GetDynamicType())\n        {\n            return MoveAndGetNextWithCache(propertyId, attributes);\n        }\n        if (this->object)\n        {\n            \/\/ Once enters NoCache path, ensure never switches to Cache path above.\n            this->cachedData = nullptr;\n            return MoveAndGetNextNoCache(propertyId, attributes);\n        }\n        return nullptr;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- AccessedStorageAnalysis.cpp  - Accessed Storage Analysis ---------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2018 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#define DEBUG_TYPE \"sil-sea\"\n\n#include \"swift\/SILOptimizer\/Analysis\/AccessedStorageAnalysis.h\"\n#include \"swift\/SILOptimizer\/Analysis\/BasicCalleeAnalysis.h\"\n#include \"swift\/SILOptimizer\/Analysis\/FunctionOrder.h\"\n#include \"swift\/SILOptimizer\/PassManager\/PassManager.h\"\n\nusing namespace swift;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ MARK: Accessing the results.\n\/\/ -----------------------------------------------------------------------------\n\nbool AccessedStorageResult::hasNoNestedConflict(\n    const AccessedStorage &otherStorage) const {\n  assert(otherStorage.isUniquelyIdentified());\n  assert(!hasUnidentifiedAccess());\n\n  return getStorageAccessInfo(otherStorage).hasNoNestedConflict();\n}\n\nbool AccessedStorageResult::mayConflictWith(\n    SILAccessKind otherAccessKind, const AccessedStorage &otherStorage) const {\n  if (hasUnidentifiedAccess()\n      && accessKindMayConflict(otherAccessKind,\n                               unidentifiedAccess.getValue())) {\n    return true;\n  }\n  for (auto &storageAccess : storageAccessSet) {\n    assert(storageAccess && \"FunctionAccessedStorage mapped invalid storage.\");\n\n    if (!accessKindMayConflict(otherAccessKind, storageAccess.getAccessKind()))\n      continue;\n\n    if (!otherStorage.isDistinctFrom(storageAccess))\n      return true;\n  }\n  return false;\n}\n\nStorageAccessInfo AccessedStorageResult::getStorageAccessInfo(\n    const AccessedStorage &otherStorage) const {\n  \/\/ Construct a fake StorageAccessInfo to do a hash lookup for the real\n  \/\/ StorageAccessInfo. The DenseSet key is limited to the AccessedStorage base\n  \/\/ class members.\n  StorageAccessInfo storageKey(otherStorage, SILAccessKind::Read, false);\n  auto iter = storageAccessSet.find(storageKey);\n  assert(iter != storageAccessSet.end());\n  return *iter;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ MARK: Constructing the results.\n\/\/ -----------------------------------------------------------------------------\n\nstatic bool updateAccessKind(SILAccessKind &LHS, SILAccessKind RHS) {\n  bool changed = false;\n  \/\/ Assume we don't track Init\/Deinit.\n  if (LHS == SILAccessKind::Read && RHS == SILAccessKind::Modify) {\n    LHS = RHS;\n    changed = true;\n  }\n  return changed;\n}\n\nstatic bool updateOptionalAccessKind(Optional<SILAccessKind> &LHS,\n                                     Optional<SILAccessKind> RHS) {\n  if (RHS == None)\n    return false;\n\n  if (LHS == None) {\n    LHS = RHS;\n    return true;\n  }\n  return updateAccessKind(LHS.getValue(), RHS.getValue());\n}\n\nbool StorageAccessInfo::mergeFrom(const StorageAccessInfo &RHS) {\n  bool changed = false;\n  SILAccessKind accessKind = getAccessKind();\n  assert(accessKind == SILAccessKind::Read\n         || accessKind == SILAccessKind::Modify && \"uninitialized info\");\n  if (updateAccessKind(accessKind, RHS.getAccessKind())) {\n    setAccessKind(accessKind);\n    changed = true;\n  }\n  if (hasNoNestedConflict() && !RHS.hasNoNestedConflict()) {\n    setNoNestedConflict(false);\n    changed = true;\n  }\n  return changed;\n}\n\nbool AccessedStorageResult::updateUnidentifiedAccess(SILAccessKind accessKind) {\n  if (unidentifiedAccess == None) {\n    unidentifiedAccess = accessKind;\n    return true;\n  }\n  return updateAccessKind(unidentifiedAccess.getValue(), accessKind);\n}\n\n\/\/ Merge the given AccessedStorageResult in `other` into this\n\/\/ AccessedStorageResult. Use the given `transformStorage` to map `other`\n\/\/ AccessedStorage into this context. If `other` is from a callee, argument\n\/\/ substitution will be performed if possible. However, there's no guarantee\n\/\/ that the merged access values will belong to this region.\n\/\/\n\/\/ Return true if these results changed, requiring further propagation through\n\/\/ the call graph.\nbool AccessedStorageResult::mergeAccesses(\n    const AccessedStorageResult &other,\n    std::function<StorageAccessInfo(const StorageAccessInfo &)>\n        transformStorage) {\n\n  \/\/ The cost of BottomUpIPAnalysis can be quadratic for large recursive call\n  \/\/ graphs. That cost is multiplied by the size of storageAccessSet. Slowdowns\n  \/\/ can occur ~1000 elements. 200 is large enough to cover \"normal\" code,\n  \/\/ while ensuring compile time isn't affected.\n  if (storageAccessSet.size() > 200) {\n    llvm::dbgs() << \"BIG SET \" << storageAccessSet.size() << \"\\n\";\n    setWorstEffects();\n    return true;\n  }\n  \/\/ To save compile time, if this storage already has worst-case effects, avoid\n  \/\/ growing its storageAccessSet.\n  if (hasWorstEffects())\n    return false;\n\n  \/\/ When `this` == `other` (for self-recursion), insertion in DenseMap\n  \/\/ invalidates the iterator. We still need to propagate and merge in that case\n  \/\/ because arguments can be recursively dependent. The alternative would be\n  \/\/ treating all self-recursion conservatively.\n  const AccessedStorageResult *otherRegionAccesses = &other;\n  AccessedStorageResult regionAccessCopy;\n  if (this == &other) {\n    regionAccessCopy = other;\n    otherRegionAccesses = &regionAccessCopy;\n  }\n  bool changed = false;\n  \/\/ Nondeterminstically iterate for the sole purpose of inserting into another\n  \/\/ unordered set.\n  for (auto &rawStorageInfo : otherRegionAccesses->storageAccessSet) {\n    const StorageAccessInfo &otherStorageInfo =\n        transformStorage(rawStorageInfo);\n    \/\/ If transformStorage() returns invalid storage object for local storage,\n    \/\/ that should not be merged with the caller.\n    if (!otherStorageInfo)\n      continue;\n\n    if (otherStorageInfo.getKind() == AccessedStorage::Unidentified) {\n      changed |= updateUnidentifiedAccess(otherStorageInfo.getAccessKind());\n      continue;\n    }\n    \/\/ Attempt to add identified AccessedStorage to this map.\n    auto result = insertStorageAccess(otherStorageInfo);\n    if (result.second) {\n      \/\/ A new AccessedStorage key was added to this map.\n      changed = true;\n      continue;\n    }\n    \/\/ Merge StorageAccessInfo into already-mapped AccessedStorage.\n    changed |= result.first->mergeFrom(otherStorageInfo);\n  }\n  if (other.unidentifiedAccess != None)\n    changed |= updateUnidentifiedAccess(other.unidentifiedAccess.getValue());\n\n  return changed;\n}\n\nbool AccessedStorageResult::mergeFrom(const AccessedStorageResult &other) {\n  \/\/ Merge accesses from other. Both `this` and `other` are either from the same\n  \/\/ function or are both callees of the same call site, so their parameters\n  \/\/ indices coincide. transformStorage is the identity function.\n  return mergeAccesses(other, [](const StorageAccessInfo &s) { return s; });\n}\n\n\/\/\/ Returns the argument of the full apply or partial apply corresponding to the\n\/\/\/ callee's parameter index, or returns an invalid SILValue if the applied\n\/\/\/ closure cannot be found. This walks up the apply chain starting at the given\n\/\/\/ `fullApply` to find the applied argument.\nstatic SILValue getCallerArg(FullApplySite fullApply, unsigned paramIndex) {\n  if (paramIndex < fullApply.getNumArguments())\n    return fullApply.getArgument(paramIndex);\n\n  SILValue callee = fullApply.getCalleeOrigin();\n  auto *PAI = dyn_cast<PartialApplyInst>(callee);\n  if (!PAI)\n    return SILValue();\n\n  unsigned appliedIndex =\n    paramIndex - ApplySite(PAI).getCalleeArgIndexOfFirstAppliedArg();\n  if (appliedIndex < PAI->getNumArguments())\n    return PAI->getArgument(appliedIndex);\n\n  \/\/ This must be a chain of partial_applies. We don't expect this in practice,\n  \/\/ so handle it conservatively.\n  return SILValue();\n}\n\n\/\/\/ Transform AccessedStorage from a callee into the caller context. If this is\n\/\/\/ uniquely identified local storage, then return an invalid storage object.\n\/\/\/\n\/\/\/ For correctness, AccessEnforcementOpts relies on all Argument access to\n\/\/\/ either be mapped into the caller's context or marked as an unidentified\n\/\/\/ access at the call site.\n\/\/\/\n\/\/\/ Note: This does *not* map the storage index into the caller function's index\n\/\/\/ range. (When the storage value doesn't need to be remapped, it returns the\n\/\/\/ original storage value.) It's simpler to set the storage index later when it\n\/\/\/ is actually added to the function's storageAccessSet.\nstatic StorageAccessInfo\ntransformCalleeStorage(const StorageAccessInfo &storage,\n                       FullApplySite fullApply) {\n  switch (storage.getKind()) {\n  case AccessedStorage::Box:\n  case AccessedStorage::Stack:\n    \/\/ Do not merge local storage.\n    return StorageAccessInfo(AccessedStorage(), storage);\n  case AccessedStorage::Global:\n    \/\/ Global accesses is universal.\n    return storage;\n  case AccessedStorage::Class: {\n    \/\/ If the object's value is an argument, translate it into a value on the\n    \/\/ caller side.\n    SILValue obj = storage.getObject();\n    if (auto *arg = dyn_cast<SILFunctionArgument>(obj)) {\n      SILValue argVal = getCallerArg(fullApply, arg->getIndex());\n      if (argVal) {\n        unsigned idx = storage.getPropertyIndex();\n        \/\/ Remap this storage info. The argument source value is now the new\n        \/\/ object. The old storage info is inherited.\n        return StorageAccessInfo(AccessedStorage::forClass(argVal, idx),\n                                 storage);\n      }\n    }\n    \/\/ Otherwise, continue to reference the value in the callee because we don't\n    \/\/ have any better placeholder for a callee-defined object.\n    return storage;\n  }\n  case AccessedStorage::Argument: {\n    \/\/ Transitively search for the storage base in the caller.\n    SILValue argVal = getCallerArg(fullApply, storage.getParamIndex());\n    if (argVal) {\n      \/\/ Remap the argument source value and inherit the old storage info.\n      auto calleeStorage = findAccessedStorageNonNested(argVal);\n      if (calleeStorage)\n        return StorageAccessInfo(calleeStorage, storage);\n    }\n    \/\/ If the argument can't be transformed, demote it to an unidentified\n    \/\/ access.\n    \/\/\n    \/\/ This is an untested bailout. It is only reachable if the call graph\n    \/\/ contains an edge that getCallerArg is unable to analyze OR if\n    \/\/ findAccessedStorageNonNested returns an invalid SILValue, which won't\n    \/\/ pass SIL verification.\n    \/\/\n    \/\/ FIXME: In case argVal is invalid, support Unidentified access for invalid\n    \/\/ values. This would also be useful for partially invalidating results.\n    return StorageAccessInfo(\n        AccessedStorage(argVal, AccessedStorage::Unidentified), storage);\n  }\n  case AccessedStorage::Nested:\n    llvm_unreachable(\"Unexpected nested access\");\n  case AccessedStorage::Yield:\n    \/\/ Continue to hold on to yields from the callee because we don't have\n    \/\/ any better placeholder in the callee.\n    return storage;\n  case AccessedStorage::Unidentified:\n    \/\/ For unidentified storage, continue to reference the value in the callee\n    \/\/ because we don't have any better placeholder for a callee-defined object.\n    return storage;\n  }\n  llvm_unreachable(\"unhandled kind\");\n}\n\nbool AccessedStorageResult::mergeFromApply(\n    const AccessedStorageResult &calleeAccess, FullApplySite fullApply) {\n  \/\/ Merge accesses from calleeAccess. Transform any Argument type\n  \/\/ AccessedStorage into the caller context to be added to `this` storage map.\n  return mergeAccesses(calleeAccess, [&fullApply](const StorageAccessInfo &s) {\n    return transformCalleeStorage(s, fullApply);\n  });\n}\n\ntemplate <typename B>\nvoid AccessedStorageResult::visitBeginAccess(B *beginAccess) {\n  if (beginAccess->getEnforcement() != SILAccessEnforcement::Dynamic)\n    return;\n\n  const AccessedStorage &storage =\n      findAccessedStorageNonNested(beginAccess->getSource());\n\n  if (storage.getKind() == AccessedStorage::Unidentified) {\n    \/\/ This also catches invalid storage.\n    updateOptionalAccessKind(unidentifiedAccess, beginAccess->getAccessKind());\n    return;\n  }\n  StorageAccessInfo storageAccess(storage, beginAccess);\n  auto result = insertStorageAccess(storageAccess);\n  if (!result.second)\n    result.first->mergeFrom(storageAccess);\n}\n\nvoid AccessedStorageResult::analyzeInstruction(SILInstruction *I) {\n  assert(!FullApplySite::isa(I) && \"caller should merge\");\n\n  if (auto *BAI = dyn_cast<BeginAccessInst>(I))\n    visitBeginAccess(BAI);\n  else if (auto *BUAI = dyn_cast<BeginUnpairedAccessInst>(I))\n    visitBeginAccess(BUAI);\n}\n\nvoid StorageAccessInfo::print(raw_ostream &os) const {\n  os << \"  [\" << getSILAccessKindName(getAccessKind()) << \"] \";\n  if (hasNoNestedConflict())\n    os << \"[no_nested_conflict] \";\n  AccessedStorage::print(os);\n}\n\nvoid StorageAccessInfo::dump() const { print(llvm::dbgs()); }\n\nvoid AccessedStorageResult::print(raw_ostream &os) const {\n  for (auto &storageAccess : storageAccessSet)\n    storageAccess.print(os);\n\n  if (unidentifiedAccess != None) {\n    os << \"  unidentified accesses: \"\n       << getSILAccessKindName(unidentifiedAccess.getValue()) << \"\\n\";\n  }\n}\n\nvoid AccessedStorageResult::dump() const { print(llvm::dbgs()); }\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ MARK: FunctionAccessedStorage, implementation of\n\/\/ GenericFunctionEffectAnalysis.\n\/\/ -----------------------------------------------------------------------------\n\nbool FunctionAccessedStorage::summarizeFunction(SILFunction *F) {\n  assert(accessResult.isEmpty() && \"expected uninitialized results.\");\n\n  if (F->isDefinition())\n    return false;\n\n  \/\/ If the function definition is unavailable, set unidentifiedAccess to a\n  \/\/ conservative value, since analyzeInstruction will never be called.\n  \/\/\n  \/\/ If FunctionSideEffects can be summarized, use that information.\n  FunctionSideEffects functionSideEffects;\n  if (!functionSideEffects.summarizeFunction(F)) {\n    setWorstEffects();\n    \/\/ May as well consider this a successful summary since there are no\n    \/\/ instructions to visit anyway.\n    return true;\n  }\n  bool mayRead = functionSideEffects.getGlobalEffects().mayRead();\n  bool mayWrite = functionSideEffects.getGlobalEffects().mayWrite();\n  for (auto &paramEffects : functionSideEffects.getParameterEffects()) {\n    mayRead |= paramEffects.mayRead();\n    mayWrite |= paramEffects.mayWrite();\n  }\n  if (mayWrite)\n    accessResult.setUnidentifiedAccess(SILAccessKind::Modify);\n  else if (mayRead)\n    accessResult.setUnidentifiedAccess(SILAccessKind::Read);\n\n  \/\/ If function side effects is \"readnone\" then this result will have an empty\n  \/\/ storageAccessSet and unidentifiedAccess == None.\n  return true;\n}\n\nSILAnalysis *swift::createAccessedStorageAnalysis(SILModule *) {\n  return new AccessedStorageAnalysis();\n}\n<commit_msg>Remove a stray llvm::dbgs() from compile time debugging.<commit_after>\/\/===--- AccessedStorageAnalysis.cpp  - Accessed Storage Analysis ---------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2018 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#define DEBUG_TYPE \"sil-sea\"\n\n#include \"swift\/SILOptimizer\/Analysis\/AccessedStorageAnalysis.h\"\n#include \"swift\/SILOptimizer\/Analysis\/BasicCalleeAnalysis.h\"\n#include \"swift\/SILOptimizer\/Analysis\/FunctionOrder.h\"\n#include \"swift\/SILOptimizer\/PassManager\/PassManager.h\"\n\nusing namespace swift;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ MARK: Accessing the results.\n\/\/ -----------------------------------------------------------------------------\n\nbool AccessedStorageResult::hasNoNestedConflict(\n    const AccessedStorage &otherStorage) const {\n  assert(otherStorage.isUniquelyIdentified());\n  assert(!hasUnidentifiedAccess());\n\n  return getStorageAccessInfo(otherStorage).hasNoNestedConflict();\n}\n\nbool AccessedStorageResult::mayConflictWith(\n    SILAccessKind otherAccessKind, const AccessedStorage &otherStorage) const {\n  if (hasUnidentifiedAccess()\n      && accessKindMayConflict(otherAccessKind,\n                               unidentifiedAccess.getValue())) {\n    return true;\n  }\n  for (auto &storageAccess : storageAccessSet) {\n    assert(storageAccess && \"FunctionAccessedStorage mapped invalid storage.\");\n\n    if (!accessKindMayConflict(otherAccessKind, storageAccess.getAccessKind()))\n      continue;\n\n    if (!otherStorage.isDistinctFrom(storageAccess))\n      return true;\n  }\n  return false;\n}\n\nStorageAccessInfo AccessedStorageResult::getStorageAccessInfo(\n    const AccessedStorage &otherStorage) const {\n  \/\/ Construct a fake StorageAccessInfo to do a hash lookup for the real\n  \/\/ StorageAccessInfo. The DenseSet key is limited to the AccessedStorage base\n  \/\/ class members.\n  StorageAccessInfo storageKey(otherStorage, SILAccessKind::Read, false);\n  auto iter = storageAccessSet.find(storageKey);\n  assert(iter != storageAccessSet.end());\n  return *iter;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ MARK: Constructing the results.\n\/\/ -----------------------------------------------------------------------------\n\nstatic bool updateAccessKind(SILAccessKind &LHS, SILAccessKind RHS) {\n  bool changed = false;\n  \/\/ Assume we don't track Init\/Deinit.\n  if (LHS == SILAccessKind::Read && RHS == SILAccessKind::Modify) {\n    LHS = RHS;\n    changed = true;\n  }\n  return changed;\n}\n\nstatic bool updateOptionalAccessKind(Optional<SILAccessKind> &LHS,\n                                     Optional<SILAccessKind> RHS) {\n  if (RHS == None)\n    return false;\n\n  if (LHS == None) {\n    LHS = RHS;\n    return true;\n  }\n  return updateAccessKind(LHS.getValue(), RHS.getValue());\n}\n\nbool StorageAccessInfo::mergeFrom(const StorageAccessInfo &RHS) {\n  bool changed = false;\n  SILAccessKind accessKind = getAccessKind();\n  assert(accessKind == SILAccessKind::Read\n         || accessKind == SILAccessKind::Modify && \"uninitialized info\");\n  if (updateAccessKind(accessKind, RHS.getAccessKind())) {\n    setAccessKind(accessKind);\n    changed = true;\n  }\n  if (hasNoNestedConflict() && !RHS.hasNoNestedConflict()) {\n    setNoNestedConflict(false);\n    changed = true;\n  }\n  return changed;\n}\n\nbool AccessedStorageResult::updateUnidentifiedAccess(SILAccessKind accessKind) {\n  if (unidentifiedAccess == None) {\n    unidentifiedAccess = accessKind;\n    return true;\n  }\n  return updateAccessKind(unidentifiedAccess.getValue(), accessKind);\n}\n\n\/\/ Merge the given AccessedStorageResult in `other` into this\n\/\/ AccessedStorageResult. Use the given `transformStorage` to map `other`\n\/\/ AccessedStorage into this context. If `other` is from a callee, argument\n\/\/ substitution will be performed if possible. However, there's no guarantee\n\/\/ that the merged access values will belong to this region.\n\/\/\n\/\/ Return true if these results changed, requiring further propagation through\n\/\/ the call graph.\nbool AccessedStorageResult::mergeAccesses(\n    const AccessedStorageResult &other,\n    std::function<StorageAccessInfo(const StorageAccessInfo &)>\n        transformStorage) {\n\n  \/\/ The cost of BottomUpIPAnalysis can be quadratic for large recursive call\n  \/\/ graphs. That cost is multiplied by the size of storageAccessSet. Slowdowns\n  \/\/ can occur ~1000 elements. 200 is large enough to cover \"normal\" code,\n  \/\/ while ensuring compile time isn't affected.\n  if (storageAccessSet.size() > 200) {\n    setWorstEffects();\n    return true;\n  }\n  \/\/ To save compile time, if this storage already has worst-case effects, avoid\n  \/\/ growing its storageAccessSet.\n  if (hasWorstEffects())\n    return false;\n\n  \/\/ When `this` == `other` (for self-recursion), insertion in DenseMap\n  \/\/ invalidates the iterator. We still need to propagate and merge in that case\n  \/\/ because arguments can be recursively dependent. The alternative would be\n  \/\/ treating all self-recursion conservatively.\n  const AccessedStorageResult *otherRegionAccesses = &other;\n  AccessedStorageResult regionAccessCopy;\n  if (this == &other) {\n    regionAccessCopy = other;\n    otherRegionAccesses = &regionAccessCopy;\n  }\n  bool changed = false;\n  \/\/ Nondeterminstically iterate for the sole purpose of inserting into another\n  \/\/ unordered set.\n  for (auto &rawStorageInfo : otherRegionAccesses->storageAccessSet) {\n    const StorageAccessInfo &otherStorageInfo =\n        transformStorage(rawStorageInfo);\n    \/\/ If transformStorage() returns invalid storage object for local storage,\n    \/\/ that should not be merged with the caller.\n    if (!otherStorageInfo)\n      continue;\n\n    if (otherStorageInfo.getKind() == AccessedStorage::Unidentified) {\n      changed |= updateUnidentifiedAccess(otherStorageInfo.getAccessKind());\n      continue;\n    }\n    \/\/ Attempt to add identified AccessedStorage to this map.\n    auto result = insertStorageAccess(otherStorageInfo);\n    if (result.second) {\n      \/\/ A new AccessedStorage key was added to this map.\n      changed = true;\n      continue;\n    }\n    \/\/ Merge StorageAccessInfo into already-mapped AccessedStorage.\n    changed |= result.first->mergeFrom(otherStorageInfo);\n  }\n  if (other.unidentifiedAccess != None)\n    changed |= updateUnidentifiedAccess(other.unidentifiedAccess.getValue());\n\n  return changed;\n}\n\nbool AccessedStorageResult::mergeFrom(const AccessedStorageResult &other) {\n  \/\/ Merge accesses from other. Both `this` and `other` are either from the same\n  \/\/ function or are both callees of the same call site, so their parameters\n  \/\/ indices coincide. transformStorage is the identity function.\n  return mergeAccesses(other, [](const StorageAccessInfo &s) { return s; });\n}\n\n\/\/\/ Returns the argument of the full apply or partial apply corresponding to the\n\/\/\/ callee's parameter index, or returns an invalid SILValue if the applied\n\/\/\/ closure cannot be found. This walks up the apply chain starting at the given\n\/\/\/ `fullApply` to find the applied argument.\nstatic SILValue getCallerArg(FullApplySite fullApply, unsigned paramIndex) {\n  if (paramIndex < fullApply.getNumArguments())\n    return fullApply.getArgument(paramIndex);\n\n  SILValue callee = fullApply.getCalleeOrigin();\n  auto *PAI = dyn_cast<PartialApplyInst>(callee);\n  if (!PAI)\n    return SILValue();\n\n  unsigned appliedIndex =\n    paramIndex - ApplySite(PAI).getCalleeArgIndexOfFirstAppliedArg();\n  if (appliedIndex < PAI->getNumArguments())\n    return PAI->getArgument(appliedIndex);\n\n  \/\/ This must be a chain of partial_applies. We don't expect this in practice,\n  \/\/ so handle it conservatively.\n  return SILValue();\n}\n\n\/\/\/ Transform AccessedStorage from a callee into the caller context. If this is\n\/\/\/ uniquely identified local storage, then return an invalid storage object.\n\/\/\/\n\/\/\/ For correctness, AccessEnforcementOpts relies on all Argument access to\n\/\/\/ either be mapped into the caller's context or marked as an unidentified\n\/\/\/ access at the call site.\n\/\/\/\n\/\/\/ Note: This does *not* map the storage index into the caller function's index\n\/\/\/ range. (When the storage value doesn't need to be remapped, it returns the\n\/\/\/ original storage value.) It's simpler to set the storage index later when it\n\/\/\/ is actually added to the function's storageAccessSet.\nstatic StorageAccessInfo\ntransformCalleeStorage(const StorageAccessInfo &storage,\n                       FullApplySite fullApply) {\n  switch (storage.getKind()) {\n  case AccessedStorage::Box:\n  case AccessedStorage::Stack:\n    \/\/ Do not merge local storage.\n    return StorageAccessInfo(AccessedStorage(), storage);\n  case AccessedStorage::Global:\n    \/\/ Global accesses is universal.\n    return storage;\n  case AccessedStorage::Class: {\n    \/\/ If the object's value is an argument, translate it into a value on the\n    \/\/ caller side.\n    SILValue obj = storage.getObject();\n    if (auto *arg = dyn_cast<SILFunctionArgument>(obj)) {\n      SILValue argVal = getCallerArg(fullApply, arg->getIndex());\n      if (argVal) {\n        unsigned idx = storage.getPropertyIndex();\n        \/\/ Remap this storage info. The argument source value is now the new\n        \/\/ object. The old storage info is inherited.\n        return StorageAccessInfo(AccessedStorage::forClass(argVal, idx),\n                                 storage);\n      }\n    }\n    \/\/ Otherwise, continue to reference the value in the callee because we don't\n    \/\/ have any better placeholder for a callee-defined object.\n    return storage;\n  }\n  case AccessedStorage::Argument: {\n    \/\/ Transitively search for the storage base in the caller.\n    SILValue argVal = getCallerArg(fullApply, storage.getParamIndex());\n    if (argVal) {\n      \/\/ Remap the argument source value and inherit the old storage info.\n      auto calleeStorage = findAccessedStorageNonNested(argVal);\n      if (calleeStorage)\n        return StorageAccessInfo(calleeStorage, storage);\n    }\n    \/\/ If the argument can't be transformed, demote it to an unidentified\n    \/\/ access.\n    \/\/\n    \/\/ This is an untested bailout. It is only reachable if the call graph\n    \/\/ contains an edge that getCallerArg is unable to analyze OR if\n    \/\/ findAccessedStorageNonNested returns an invalid SILValue, which won't\n    \/\/ pass SIL verification.\n    \/\/\n    \/\/ FIXME: In case argVal is invalid, support Unidentified access for invalid\n    \/\/ values. This would also be useful for partially invalidating results.\n    return StorageAccessInfo(\n        AccessedStorage(argVal, AccessedStorage::Unidentified), storage);\n  }\n  case AccessedStorage::Nested:\n    llvm_unreachable(\"Unexpected nested access\");\n  case AccessedStorage::Yield:\n    \/\/ Continue to hold on to yields from the callee because we don't have\n    \/\/ any better placeholder in the callee.\n    return storage;\n  case AccessedStorage::Unidentified:\n    \/\/ For unidentified storage, continue to reference the value in the callee\n    \/\/ because we don't have any better placeholder for a callee-defined object.\n    return storage;\n  }\n  llvm_unreachable(\"unhandled kind\");\n}\n\nbool AccessedStorageResult::mergeFromApply(\n    const AccessedStorageResult &calleeAccess, FullApplySite fullApply) {\n  \/\/ Merge accesses from calleeAccess. Transform any Argument type\n  \/\/ AccessedStorage into the caller context to be added to `this` storage map.\n  return mergeAccesses(calleeAccess, [&fullApply](const StorageAccessInfo &s) {\n    return transformCalleeStorage(s, fullApply);\n  });\n}\n\ntemplate <typename B>\nvoid AccessedStorageResult::visitBeginAccess(B *beginAccess) {\n  if (beginAccess->getEnforcement() != SILAccessEnforcement::Dynamic)\n    return;\n\n  const AccessedStorage &storage =\n      findAccessedStorageNonNested(beginAccess->getSource());\n\n  if (storage.getKind() == AccessedStorage::Unidentified) {\n    \/\/ This also catches invalid storage.\n    updateOptionalAccessKind(unidentifiedAccess, beginAccess->getAccessKind());\n    return;\n  }\n  StorageAccessInfo storageAccess(storage, beginAccess);\n  auto result = insertStorageAccess(storageAccess);\n  if (!result.second)\n    result.first->mergeFrom(storageAccess);\n}\n\nvoid AccessedStorageResult::analyzeInstruction(SILInstruction *I) {\n  assert(!FullApplySite::isa(I) && \"caller should merge\");\n\n  if (auto *BAI = dyn_cast<BeginAccessInst>(I))\n    visitBeginAccess(BAI);\n  else if (auto *BUAI = dyn_cast<BeginUnpairedAccessInst>(I))\n    visitBeginAccess(BUAI);\n}\n\nvoid StorageAccessInfo::print(raw_ostream &os) const {\n  os << \"  [\" << getSILAccessKindName(getAccessKind()) << \"] \";\n  if (hasNoNestedConflict())\n    os << \"[no_nested_conflict] \";\n  AccessedStorage::print(os);\n}\n\nvoid StorageAccessInfo::dump() const { print(llvm::dbgs()); }\n\nvoid AccessedStorageResult::print(raw_ostream &os) const {\n  for (auto &storageAccess : storageAccessSet)\n    storageAccess.print(os);\n\n  if (unidentifiedAccess != None) {\n    os << \"  unidentified accesses: \"\n       << getSILAccessKindName(unidentifiedAccess.getValue()) << \"\\n\";\n  }\n}\n\nvoid AccessedStorageResult::dump() const { print(llvm::dbgs()); }\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ MARK: FunctionAccessedStorage, implementation of\n\/\/ GenericFunctionEffectAnalysis.\n\/\/ -----------------------------------------------------------------------------\n\nbool FunctionAccessedStorage::summarizeFunction(SILFunction *F) {\n  assert(accessResult.isEmpty() && \"expected uninitialized results.\");\n\n  if (F->isDefinition())\n    return false;\n\n  \/\/ If the function definition is unavailable, set unidentifiedAccess to a\n  \/\/ conservative value, since analyzeInstruction will never be called.\n  \/\/\n  \/\/ If FunctionSideEffects can be summarized, use that information.\n  FunctionSideEffects functionSideEffects;\n  if (!functionSideEffects.summarizeFunction(F)) {\n    setWorstEffects();\n    \/\/ May as well consider this a successful summary since there are no\n    \/\/ instructions to visit anyway.\n    return true;\n  }\n  bool mayRead = functionSideEffects.getGlobalEffects().mayRead();\n  bool mayWrite = functionSideEffects.getGlobalEffects().mayWrite();\n  for (auto &paramEffects : functionSideEffects.getParameterEffects()) {\n    mayRead |= paramEffects.mayRead();\n    mayWrite |= paramEffects.mayWrite();\n  }\n  if (mayWrite)\n    accessResult.setUnidentifiedAccess(SILAccessKind::Modify);\n  else if (mayRead)\n    accessResult.setUnidentifiedAccess(SILAccessKind::Read);\n\n  \/\/ If function side effects is \"readnone\" then this result will have an empty\n  \/\/ storageAccessSet and unidentifiedAccess == None.\n  return true;\n}\n\nSILAnalysis *swift::createAccessedStorageAnalysis(SILModule *) {\n  return new AccessedStorageAnalysis();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"mmsapt.h\"\nusing namespace std;\nusing namespace Moses;\n\n\/\/ currently broken\n\nMmsapt* PT;\nint main(int argc, char* argv[])\n{\n  \/\/ string base = argv[1];\n  \/\/ string L1   = argv[2];\n  \/\/ string L2   = argv[3];\n  \/\/ ostringstream buf;\n  \/\/ buf << \"Mmsapt name=PT0 output-factor=0 num-features=5 base=\"\n  \/\/     << base << \" L1=\" << L1 << \" L2=\" << L2;\n  \/\/ string configline = buf.str();\n  \/\/ PT = new Mmsapt(configline);\n  \/\/ PT->Load();\n  \/\/ float w[] = { 0.0582634, 0.0518865, 0.0229819, 0.00640856,  0.647506 };\n  \/\/ vector<float> weights(w,w+5);\n  \/\/ PT->setWeights(weights);\n  \/\/ \/\/ these values are taken from a moses.ini file;\n  \/\/ \/\/ is there a convenient way of accessing them from within mmsapt ???\n  \/\/ string eline,fline;\n  \/\/ \/\/ TokenIndex V; V.open(\"crp\/trn\/mm\/de.tdx\");\n  \/\/ while (getline(cin,eline) && getline(cin,fline))\n  \/\/   {\n  \/\/     cout << eline << endl;\n  \/\/     cout << fline << endl;\n  \/\/     PT->align(eline,fline);\n  \/\/   }\n  \/\/ delete PT;\n}\n\n<commit_msg>Work in progress.<commit_after>#include \"mm\/ug_bitext.h\"\n#include <boost\/format.hpp>\nusing namespace std;\nusing namespace Moses;\nusing namespace ugdiss;\n\ntypedef L2R_Token<SimpleWordId> Token;\ntypedef mmTtrack<Token> ttrack_t;\ntypedef mmTSA<Token>     tsa_t;\n\nTokenIndex V1,V2;\nboost::shared_ptr<ttrack_t> T1,T2;\ntsa_t I1,I2;\n\nnamespace stats\n{\n  using namespace Moses::bitext;\n  float \n  pmi(size_t j,size_t m1, size_t m2, size_t N)\n  {\n    float p1 = lbop(N,m1,.1);\n    float p2 = lbop(N,m2,.1);\n    float p12 = lbop(N,j,.1);\n    return log(p12) - log(p1) - log(p2);\n    \/\/ return log(j) + log(N) - log(m1) - log(m2);\n  }\n  \n  float \n  npmi(size_t j,size_t m1, size_t m2, size_t N)\n  {\n    \n    float p1 = lbop(N,m1,.1);\n    float p2 = lbop(N,m2,.1);\n    float p12 = lbop(N,j,.1);\n    return (log(p12) - log(p1) - log(p2)) \/ -log(p12);\n    \/\/ return pmi(j,m1,m2,N) \/ (log(N) - log(j)); \n  }\n\n  float \n  mi(size_t j,size_t m1, size_t m2, size_t N)\n  {\n    float ret = 0;\n    if (j)    ret += float(j)\/N * pmi(j,m1,m2,N);\n    if (m1>j) ret += float(m1-j)\/N * pmi(m1-j,m1,N-m2,N);\n    if (m2>j) ret += float(m2-j)\/N * pmi(m2-j,N-m1,m2,N);\n    if (N>m1+m2-j) ret += float(N-m1-m2+j)\/N * pmi(N-m1-m2+j,N-m1,N-m2,N);\n    return ret;\n  }\n}\n\nstruct SinglePhrase\n{\n  typedef map<uint64_t,sptr<SinglePhrase> > cache_t;\n  uint64_t pid; \/\/ phrase id\n  vector<ttrack::Position> occs; \/\/ occurrences\n};\n\n\nstruct PhrasePair\n{\n  struct score_t;\n  uint64_t p1,p2;\n  ushort s1,e1,s2,e2;\n  int parent;\n\n  struct stats_t\n  {\n    typedef map<pair<uint64_t,uint64_t>, sptr<stats_t> > cache_t;\n    size_t m1,m2,j;\n    float  npmi; \/\/ normalized point-wise mutual information\n    float   pmi; \/\/ point-wise mutual information\n    float    mi; \/\/ mutual information\n    float score;\n\n    void \n    set(vector<ttrack::Position> const& o1,\n\tvector<ttrack::Position> const& o2,\n\tsize_t const N)\n    {\n      m1 = m2 = j = 0;\n      size_t i1=0,i2=0;\n      while (i1 < o1.size() && i2 < o2.size())\n\t{\n\t  if (i1 && o1[i1].sid == o1[i1-1].sid) { ++i1; continue; }\n\t  if (i2 && o2[i2].sid == o2[i2-1].sid) { ++i2; continue; }\n\t  \n\t  if (o1[i1].sid == o2[i2].sid) { ++j; ++i1; ++i2; ++m1; ++m2; }\n\t  else if (o1[i1].sid < o2[i2].sid) { ++i1; ++m1; }\n\t  else { ++i2; ++m2; }\n\t}\n      \/\/ for (++i1; i1 < o1.size(); ++i1)\n      \/\/ \tif (o1[i1-1].sid != o1[i1].sid) ++m1;\n      \/\/ for (++i2; i2 < o2.size(); ++i2)\n      \/\/ \tif (o2[i2-1].sid != o2[i2].sid) ++m2;\n\n      m1 = 1; m2 = 1;\n      for (i1=1; i1 < o1.size(); ++i1)\n       \tif (o1[i1-1].sid != o1[i1].sid) ++m1;\n      for (i2=1; i2 < o2.size(); ++i2)\n\tif (o2[i2-1].sid != o2[i2].sid) ++m2;\n\n      this->mi = stats::mi(j,m1,m2,N);\n      this->pmi = stats::pmi(j,m1,m2,N);\n      this->npmi = stats::npmi(j,m1,m2,N);\n      \/\/ float z = float(m1)\/N * float(m2)\/N;\n      float hmean = 2.*j\/(m1+m2);\n      this->score = npmi; \/\/ hmean; \/\/ \/sqrt(z);\n    }\n  } stats;\n  \n  PhrasePair(ushort s1_=0, ushort e1_=0, ushort s2_=0, ushort e2_=0)\n    : s1(s1_), e1(e1_), s2(s2_), e2(e2_), parent(-1) { }\n\n\n  bool \n  operator<(PhrasePair const& other) const\n  { \n    return (this->stats.score == other.stats.score \n\t    ? (e1-s1 + e2-s2 > other.e1-other.s1 + other.e2-other.s2)\n\t    : (this->stats.score > other.stats.score)); \n  }\n  \n};\n\nSinglePhrase::cache_t cache1,cache2;\nPhrasePair::stats_t::cache_t ppcache;\n\n\nstruct SortByPositionInCorpus\n{\n  bool \n  operator()(ttrack::Position const& a, \n\t     ttrack::Position const& b) const\n  {\n    return a.sid != b.sid ? a.sid < b.sid : a.offset < b.offset;\n  }\n};\n\n\nvoid \ngetoccs(tsa_t::tree_iterator const& m, \n\tvector<ttrack::Position>& occs)\n{\n  occs.clear();\n  occs.reserve(m.approxOccurrenceCount()+10);\n  tsa::ArrayEntry I(m.lower_bound(-1));\n  char const* stop = m.upper_bound(-1);\n  do {\n    m.root->readEntry(I.next,I);\n    occs.push_back(I);\n  } while (I.next != stop);\n  sort(occs.begin(),occs.end(),SortByPositionInCorpus());\n}\n\nvoid \nlookup_phrases(vector<id_type> const& snt, \n\t       TokenIndex& V, ttrack_t const& T, \n\t       tsa_t const& I, SinglePhrase::cache_t& cache,\n\t       vector<vector<sptr<SinglePhrase> > >& dest)\n{\n  dest.resize(snt.size());\n  for (size_t i = 0; i < snt.size(); ++i)\n    {\n      tsa_t::tree_iterator m(&I);\n      dest[i].clear();\n      for (size_t k = i; k < snt.size() && m.extend(snt[k]); ++k)\n\t{\n\t  sptr<SinglePhrase>& o = cache[m.getPid()];\n\t  if (!o) \n\t    {\n\t      o.reset(new SinglePhrase());\n\t      o->pid = m.getPid();\n\t      getoccs(m,o->occs);\n\t    }\n\t  dest[i].push_back(o);\n\t}\n    }\n}\n\nstruct \nRowIndexSorter\n{\n  vector<vector<float> > const& M;\n  size_t const my_col;\n  RowIndexSorter(vector<vector<float> > const& m, size_t const c)\n    : M(m), my_col(c) { }\n\n  template<typename T>\n  bool \n  operator()(T const& a, T const& b) const \n  { \n    return M.at(a).at(my_col) > M.at(b).at(my_col);\n  }\n};\n\nstruct \nColIndexSorter\n{\n  vector<vector<float> > const& M;\n  size_t const my_row;\n  ColIndexSorter(vector<vector<float> > const& m, size_t const r)\n    : M(m), my_row(r) { }\n\n  template<typename T>\n  bool \n  operator()(T const& a, T const& b) const \n  { \n    return M.at(my_row).at(a) > M[my_row].at(b);\n  }\n\n};\n\nint main(int argc, char* argv[])\n{\n  string base = argv[1];\n  string L1   = argv[2];\n  string L2   = argv[3];\n\n  T1.reset(new ttrack_t());\n  T2.reset(new ttrack_t());\n  \n  V1.open(base + L1 + \".tdx\");\n  T1->open(base + L1 + \".mct\");\n  I1.open(base + L1 + \".sfa\", T1);\n\n  V2.open(base + L2 + \".tdx\");\n  T2->open(base + L2 + \".mct\");\n  I2.open(base + L2 + \".sfa\", T2);\n\n  tsa_t::tree_iterator m1(&I1);\n  tsa_t::tree_iterator m2(&I1);\n  string line1, line2;\n  while (getline(cin,line1) and getline(cin,line2))\n    {\n      cout << line1 << \"\\n\" << line2 << endl;\n      vector<vector<sptr<SinglePhrase> > > M1,M2;\n      vector<id_type> snt1,snt2;\n      V1.fillIdSeq(line1,snt1);\n      V2.fillIdSeq(line2,snt2);\n      lookup_phrases(snt1,V1,*T1,I1,cache1,M1);\n      lookup_phrases(snt2,V2,*T2,I2,cache2,M2);\n\n      vector<PhrasePair> pp_all,pp_good;\n      vector<int> a1(snt1.size(),-1);\n      vector<int> a2(snt2.size(),-1);\n      \n      vector<vector<int> > z1(snt1.size(),vector<int>(snt1.size(),-1));\n      vector<vector<int> > z2(snt2.size(),vector<int>(snt2.size(),-1));\n      vector<vector<vector<PhrasePair> > >ppm1(M1.size()),ppm2(M2.size());\n      vector<vector<float> >  M(snt1.size(), vector<float>(snt2.size(),0));\n      vector<vector<size_t> > best1(snt1.size()), best2(snt2.size());\n      for (size_t i1 = 0; i1 < M1.size(); ++i1)\n\t{\n\t  PhrasePair pp;\n\t  pp.s1 = i1;\n\t  ppm1[i1].resize(M1[i1].size());\n\t  for (size_t i2 = 0; i2 < M2.size(); ++i2)\n\t    {\n\t      pp.s2 = i2;\n\t      pp.stats.j = 1;\n\t      ppm2[i2].resize(M2[i2].size());\n\t      for (size_t k1 = 0; k1 < M1[i1].size(); ++k1)\n\t\t{\n\t\t  pp.e1 = i1 + k1 + 1;\n\t\t  \/\/ if (pp.stats.j == 0) break;\n\t\t  for (size_t k2 = 0; k2 < M2[i2].size(); ++k2)\n\t\t    {\n\t\t      pp.e2 = i2 + k2 + 1;\n\t\t      sptr<PhrasePair::stats_t> & s \n\t\t\t= ppcache[make_pair(M1[i1][k1]->pid,M2[i2][k2]->pid)];\n\t\t      if (!s) \n\t\t\t{\n\t\t\t  s.reset(new PhrasePair::stats_t());\n\t\t\t  s->set(M1[i1][k1]->occs,M2[i2][k2]->occs,T1->size());\n\t\t\t}\n\t\t      pp.stats = *s;\n\t\t      if (pp.stats.j == 0) break;\n\t\t      \/\/ ppm1[i1][k1].push_back(pp);\n\t\t      \/\/ ppm2[i2][k2].push_back(pp);\n\t\t      if (pp.stats.score > 0) \n\t\t\tpp_all.push_back(pp);\n\t\t    }\n\t\t}\n\t    }\n\t}\n      sort(pp_all.begin(),pp_all.end());\n      BOOST_FOREACH(PhrasePair const& pp,pp_all)\n\t{\n\t  if (pp.stats.npmi < 0) continue;\n\t  for (size_t r = pp.s1; r < pp.e1; ++r)\n\t    for (size_t c = pp.s2; c < pp.e2; ++c)\n\t      {\n\t\t\/\/ M[r][c] += log(1-pp.stats.npmi); \n\t\tM[r][c] += log(1-pp.stats.mi);\n\t      }\n\t}\n      for (size_t r = 0; r < M.size(); ++r)\n\tfor (size_t c = 0; c < M[r].size(); ++c)\n\t  M[r][c] = 1.-exp(M[r][c]);\n      for (size_t r = 0; r < best1.size(); ++r)\n\t{\n\t  best1[r].resize(snt2.size());\n\t  for (size_t c = 0; c < best1[r].size(); ++c)\n\t    best1[r][c] = c;\n\t  sort(best1[r].begin(),best1[r].end(),ColIndexSorter(M,r));\n\t}\n      for (size_t c = 0; c < best2.size(); ++c)\n\t{\n\t  best2[c].resize(snt1.size());\n\t  for (size_t r = 0; r < best2[c].size(); ++r)\n\t    best2[c][r] = r;\n\t  sort(best2[c].begin(),best2[c].end(),RowIndexSorter(M,c));\n\t}\n      for (size_t r = 0; r < best1.size(); ++r)\n\t{\n\t  cout << V1[snt1[r]] << \":\";\n\t  for (size_t i = 0; i < min(3UL,M[r].size()); ++i)\n\t    {\n\t      size_t k = best1[r][i];\n\t      \/\/ if (M[r][k] >= M[best2[k][min(2UL,M.size())]][k])\n\t      cout << \" \" << k << \":\" << V2[snt2[k]] << \" \" << M[r][k];\n\t    }\n\t  cout << endl;\n\t}\n      \n#if 0\n      for (size_t k = 1; k < pp_all.size(); ++k)\n\tfor (size_t i = k; i--;)\n\t  if (pp_all[i].s1 >= pp_all[k].s1 && \n\t      pp_all[i].e1 <= pp_all[k].e1 &&\n\t      pp_all[i].s2 >= pp_all[k].s2 &&\n\t      pp_all[i].e2 <= pp_all[k].e2)\n\t    pp_all[i].stats.score += pp_all[k].stats.score;\n      sort(pp_all.begin(),pp_all.end());\n#endif\n\n#if 1\n      for (size_t p = 0; p < pp_all.size(); ++p)\n\t{\n\t  PhrasePair const& x = pp_all[p];\n\t  \/\/ if (x.stats.npmi < .7) break;\n\t  \/\/ if (z1[x.s1][x.e1-1] >= 0 || z2[x.s2][x.e2-1] >=0) \n\t  \/\/ continue;\n\t  z1[x.s1][x.e1-1] = p;\n\t  z2[x.s2][x.e2-1] = p;\n\t  cout << (boost::format(\"%.4f %.4f %.4f\") \n\t\t   % x.stats.score \n\t\t   % x.stats.mi\n\t\t   % x.stats.npmi);\n\t  for (size_t z = x.s1; z < x.e1; ++z)\n\t    cout << \" \" << V1[snt1[z]];\n\t  cout << \" :::\";\n\t  for (size_t z = x.s2; z < x.e2; ++z)\n\t    cout << \" \" << V2[snt2[z]];\n\t  cout << \" [\" \n\t       << x.stats.m1 << \"\/\" << x.stats.j << \"\/\" << x.stats.m2 \n\t       << \"]\" << endl;\n\t}\n#endif      \n      \/\/ sort(pp_all.begin(),pp_all.end());\n      \/\/ BOOST_FOREACH(PhrasePair const& pp, pp_all)\n      \/\/ \t{\n      \/\/ \t  while (ppm1[pp.s1].size() < pp.e1 - pp.s1) \n      \/\/ \t    ppm1[pp.s1].push_back(vector<PhrasePair>());\n      \/\/ \t  vector<PhrasePair>& v1 = ppm1[pp.s1][pp.e1-pp.s1-1];\n      \/\/ \t  if (v1.size() && v1[0].stats.score > pp.stats.score)\n      \/\/ \t    continue;\n      \/\/ \t  while (ppm2[pp.s2].size() < pp.e2 - pp.s2) \n      \/\/ \t    ppm2[pp.s2].push_back(vector<PhrasePair>());\n      \/\/ \t  vector<PhrasePair>& v2 = ppm2[pp.s2][pp.e2-pp.s2-1];\n      \/\/ \t  if (v2.size() && v2[0].stats.score > pp.stats.score)\n      \/\/ \t    continue;\n      \/\/ \t  v1.push_back(pp);\n      \/\/ \t  v2.push_back(pp);\n      \/\/ \t}\n\n      \n      \/\/ BOOST_FOREACH(vector<vector<PhrasePair> >& vv, ppm1)\n      \/\/ \t{ \n      \/\/ \t  BOOST_FOREACH(vector<PhrasePair>& v, vv) \n      \/\/ \t    { \n      \/\/ \t      sort(v.begin(),v.end()); \n      \/\/ \t      if (v.size() > 1 && v[0].stats.score == v[1].stats.score)\n      \/\/ \t\tv.clear();\n      \/\/ \t    }\n      \/\/ \t}\n      \/\/ for (size_t i2 = 0; i2 < ppm2.size(); ++i2)\n      \/\/ \t{\n      \/\/ \t  for (size_t k2 = 0; k2 < ppm2[i2].size(); ++k2)\n      \/\/ \t    { \n      \/\/ \t      vector<PhrasePair>& v2 = ppm2[i2][k2];\n      \/\/ \t      sort(v2.begin(),v2.end());\n      \/\/ \t      if (v2.size() > 1 && v2[0].stats.score == v2[1].stats.score) \n      \/\/ \t\t{\n      \/\/ \t\t  v2.clear();\n      \/\/ \t\t  continue;\n      \/\/ \t\t}\n      \/\/ \t      ushort i1 = v2[0].s1;\n      \/\/ \t      ushort k1 = v2[0].e1 - i1 -1;\n\t      \n      \/\/ \t      if (ppm1[i1][k1].size() == 0 || \n      \/\/ \t\t  ppm1[i1][k1][0].s2 != i2 || \n      \/\/ \t\t  ppm1[i1][k1][0].e2 != i2 + k2 + 1)\n      \/\/ \t\t{ v2.clear(); }\n      \/\/ \t      else pp_good.push_back(ppm2[i2][k2][0]);\n      \/\/ \t    }\n      \/\/ \t}\n      \/\/ BOOST_FOREACH(PhrasePair const& pp, pp_good)\n      \/\/ \t{\n      \/\/ \t  cout << pp.stats.mi << \" \";\n      \/\/ \t  for (size_t z = pp.s1; z < pp.e1; ++z)\n      \/\/ \t    cout << V1[snt1[z]] << \" \";\n      \/\/ \t  cout << \" ::: \";\n      \/\/ \t  for (size_t z = pp.s2; z < pp.e2; ++z)\n      \/\/ \t    cout << V2[snt2[z]] << \" \";\n      \/\/ \t  cout << pp.stats.m1 << \"\/\" << pp.stats.j << \"\/\" << pp.stats.m2 << endl;\n      \/\/ \t}\n      \/\/ \/\/ cout << string(80,'=') << endl;\n      \/\/ \/\/ sort(pp_all.begin(),pp_all.end());\n      \/\/ \/\/ BOOST_FOREACH(PhrasePair const& pp, pp_all)\n      \/\/ \/\/ \t{\n      \/\/ \/\/ \t  cout << pp.mi << \" \";\n      \/\/ \/\/ \t  for (size_t z = pp.s1; z < pp.e1; ++z)\n      \/\/ \/\/ \t    cout << V1[snt1[z]] << \" \";\n      \/\/ \/\/ \t  cout << \" ::: \";\n      \/\/ \/\/ \t  for (size_t z = pp.s2; z < pp.e2; ++z)\n      \/\/ \/\/ \t    cout << V2[snt2[z]] << \" \";\n      \/\/ \/\/ \t  cout << pp.m1 << \"\/\" << pp.j << \"\/\" << pp.m2 << endl;\n      \/\/ \/\/ \t}\n      \n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <list>\n#include <string>\n\n#include <AlpinoCorpus\/CompactCorpusReader.hh>\n#include <AlpinoCorpus\/CorpusReader.hh>\n#include <AlpinoCorpus\/CorpusReaderFactory.hh>\n#include <AlpinoCorpus\/CorpusReader.hh>\n#include <AlpinoCorpus\/DbCorpusReader.hh>\n#include <AlpinoCorpus\/DirectoryCorpusReader.hh>\n#include <AlpinoCorpus\/Error.hh>\n#include <AlpinoCorpus\/RecursiveCorpusReader.hh>\n\nnamespace alpinocorpus {\n\n    CorpusReader *CorpusReaderFactory::open(std::string const &corpusPath)\n    {\n        try {\n            return new DirectoryCorpusReader(corpusPath);\n        } catch (OpenError const &) {}\n\n        try {\n            return new CompactCorpusReader(corpusPath);\n        } catch (OpenError const &) {}\n\n#if defined(USE_DBXML)\n        try {\n            return new DbCorpusReader(corpusPath);\n        } catch (OpenError const &) {}\n#endif\n        \n        throw OpenError(corpusPath);\n    }\n\n    CorpusReader *CorpusReaderFactory::openRecursive(std::string const &path)\n    {\n      return new RecursiveCorpusReader(path);\n    }\n\n    bool CorpusReaderFactory::readerAvailable(ReaderType readerType)\n    {\n#ifndef USE_DBXML\n        if (readerType == DBXML_CORPUS_READER)\n            return false;\n#endif USE_DBXML\n\n        return true;\n    }\n\n    std::list<CorpusReaderFactory::ReaderInfo> CorpusReaderFactory::readersAvailable()\n    {\n        std::list<ReaderInfo> readers;\n\n        \/\/ XXX - How to present directory corpus readers?\n\n        readers.push_back(ReaderInfo(DIRECTORY_CORPUS_READER,\n            \"Directory reader\", std::list<std::string>()));\n\n        #ifdef USE_DBXML\n        readers.push_back(ReaderInfo(DBXML_CORPUS_READER,\n            \"Dact (DBXML) corpus reader\", std::list<std::string>(1, \"dact\")));\n        #endif\n\n        readers.push_back(ReaderInfo(COMPACT_CORPUS_READER,\n            \"Compact corpus reader\", std::list<std::string>(1, \"data.dz\")));\n        \n        return readers;\n    }\n\n\n}\n<commit_msg>CorpusReaderFactory: include config.hh<commit_after>#include <list>\n#include <string>\n\n#include <AlpinoCorpus\/CompactCorpusReader.hh>\n#include <AlpinoCorpus\/CorpusReader.hh>\n#include <AlpinoCorpus\/CorpusReaderFactory.hh>\n#include <AlpinoCorpus\/CorpusReader.hh>\n#include <AlpinoCorpus\/DbCorpusReader.hh>\n#include <AlpinoCorpus\/DirectoryCorpusReader.hh>\n#include <AlpinoCorpus\/Error.hh>\n#include <AlpinoCorpus\/RecursiveCorpusReader.hh>\n\n#include <config.hh>\n\nnamespace alpinocorpus {\n\n    CorpusReader *CorpusReaderFactory::open(std::string const &corpusPath)\n    {\n        try {\n            return new DirectoryCorpusReader(corpusPath);\n        } catch (OpenError const &) {}\n\n        try {\n            return new CompactCorpusReader(corpusPath);\n        } catch (OpenError const &) {}\n\n#if defined(USE_DBXML)\n        try {\n            return new DbCorpusReader(corpusPath);\n        } catch (OpenError const &) {}\n#endif\n        \n        throw OpenError(corpusPath);\n    }\n\n    CorpusReader *CorpusReaderFactory::openRecursive(std::string const &path)\n    {\n      return new RecursiveCorpusReader(path);\n    }\n\n    bool CorpusReaderFactory::readerAvailable(ReaderType readerType)\n    {\n#ifndef USE_DBXML\n        if (readerType == DBXML_CORPUS_READER)\n            return false;\n#endif USE_DBXML\n\n        return true;\n    }\n\n    std::list<CorpusReaderFactory::ReaderInfo> CorpusReaderFactory::readersAvailable()\n    {\n        std::list<ReaderInfo> readers;\n\n        \/\/ XXX - How to present directory corpus readers?\n\n        readers.push_back(ReaderInfo(DIRECTORY_CORPUS_READER,\n            \"Directory reader\", std::list<std::string>()));\n\n        #ifdef USE_DBXML\n        readers.push_back(ReaderInfo(DBXML_CORPUS_READER,\n            \"Dact (DBXML) corpus reader\", std::list<std::string>(1, \"dact\")));\n        #endif\n\n        readers.push_back(ReaderInfo(COMPACT_CORPUS_READER,\n            \"Compact corpus reader\", std::list<std::string>(1, \"data.dz\")));\n        \n        return readers;\n    }\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ CppSample.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n\n\nint main()\n{\n    return 0;\n}\n\n<commit_msg>basic class<commit_after>\/\/ CppSample.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n#include <stdio.h>\n#include <string.h>\n\n\n#define BOOL int\n#define TRUE 1\n#define FALSE !TRUE\n\nclass Worker\n{\nprivate:\n\tchar m_FullName[256];\npublic:\n\tWorker();\n\n\tvoid\tSetName(const char* pFullName);\n\tvoid\tPrintName() const;\n};\n\nWorker::Worker() \n{\n\tmemset(m_FullName, 0, sizeof(m_FullName));\n}\n\nvoid Worker::SetName(const char* pFullName) \n{\n\tstrncpy(m_FullName, pFullName, sizeof(m_FullName));\n}\n\nvoid Worker::PrintName() const\n{\n\tputs(\"Hello \");\n\tputs(m_FullName);\n}\n\nint main()\n{\n\tWorker w;\n\tw.SetName(\"Andrea\");\n\n\tw.PrintName();\n\n\tgetchar();\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    UnstructuredGridCellGradients.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 (c) Sandia Corporation\n See Copyright.txt or http:\/\/www.paraview.org\/HTML\/Copyright.html for details.\n----------------------------------------------------------------------------*\/\n\n#include \"vtkActor.h\"\n#include \"vtkArrowSource.h\"\n#include \"vtkAssignAttribute.h\"\n#include \"vtkCamera.h\"\n#include \"vtkCellCenters.h\"\n#include \"vtkExtractEdges.h\"\n#include \"vtkGlyph3D.h\"\n#include \"vtkGradientFilter.h\"\n#include \"vtkPointDataToCellData.h\"\n#include \"vtkPolyDataMapper.h\"\n#include \"vtkRegressionTestImage.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkStdString.h\"\n#include \"vtkTubeFilter.h\"\n#include \"vtkUnstructuredGridReader.h\"\n\n#include \"vtkSmartPointer.h\"\n#define VTK_CREATE(type, var) \\\n  vtkSmartPointer<type> var = vtkSmartPointer<type>::New()\n\nint UnstructuredGridCellGradients(int argc, char *argv[])\n{\n  int i;\n  \/\/ Need to get the data root.\n  const char *data_root = NULL;\n  for (i = 0; i < argc-1; i++)\n    {\n    if (strcmp(\"-D\", argv[i]) == 0)\n      {\n      data_root = argv[i+1];\n      break;\n      }\n    }\n  if (!data_root)\n    {\n    cout << \"Need to specify the directory to VTK_DATA_ROOT with -D <dir>.\" << endl;\n    return 1;\n    }\n\n  \/\/ Create the reader for the data.\n  \/\/ This is the data that will be volume rendered.\n  vtkStdString filename;\n  filename = data_root;\n  filename += \"\/Data\/uGridEx.vtk\";\n  cout << \"Loading \" << filename.c_str() << endl;\n  VTK_CREATE(vtkUnstructuredGridReader, reader);\n  reader->SetFileName(filename.c_str());\n\n  VTK_CREATE(vtkExtractEdges, edges);\n  edges->SetInputConnection(reader->GetOutputPort());\n\n  VTK_CREATE(vtkTubeFilter, tubes);\n  tubes->SetInputConnection(edges->GetOutputPort());\n  tubes->SetRadius(0.0625);\n  tubes->SetVaryRadiusToVaryRadiusOff();\n  tubes->SetNumberOfSides(32);\n\n  VTK_CREATE(vtkPolyDataMapper, tubesMapper);\n  tubesMapper->SetInputConnection(tubes->GetOutputPort());\n  tubesMapper->SetScalarRange(0.0, 26.0);\n\n  VTK_CREATE(vtkActor, tubesActor);\n  tubesActor->SetMapper(tubesMapper);\n\n  VTK_CREATE(vtkPointDataToCellData, pd2cd);\n  pd2cd->SetInputConnection(reader->GetOutputPort());\n\n  VTK_CREATE(vtkGradientFilter, gradients);\n  gradients->SetInputConnection(pd2cd->GetOutputPort());\n  gradients->SetInputScalars(vtkDataObject::FIELD_ASSOCIATION_CELLS,\n                             vtkDataSetAttributes::SCALARS);\n\n  VTK_CREATE(vtkCellCenters, cellCenters);\n  cellCenters->SetInputConnection(gradients->GetOutputPort());\n\n  VTK_CREATE(vtkAssignAttribute, vectors);\n  vectors->SetInputConnection(cellCenters->GetOutputPort());\n  vectors->Assign(\"Gradients\", vtkDataSetAttributes::VECTORS,\n                  vtkAssignAttribute::POINT_DATA);\n\n  VTK_CREATE(vtkArrowSource, arrow);\n\n  VTK_CREATE(vtkGlyph3D, glyphs);\n  glyphs->SetInputConnection(0, vectors->GetOutputPort());\n  glyphs->SetInputConnection(1, arrow->GetOutputPort());\n  glyphs->ScalingOn();\n  glyphs->SetScaleModeToScaleByVector();\n  glyphs->SetScaleFactor(0.25);\n  glyphs->OrientOn();\n  glyphs->ClampingOff();\n  glyphs->SetVectorModeToUseVector();\n  glyphs->SetIndexModeToOff();\n\n  VTK_CREATE(vtkPolyDataMapper, glyphMapper);\n  glyphMapper->SetInputConnection(glyphs->GetOutputPort());\n  glyphMapper->ScalarVisibilityOff();\n\n  VTK_CREATE(vtkActor, glyphActor);\n  glyphActor->SetMapper(glyphMapper);\n\n  VTK_CREATE(vtkRenderer, renderer);\n  renderer->AddActor(tubesActor);\n  renderer->AddActor(glyphActor);\n  renderer->SetBackground(0.328125, 0.347656, 0.425781);\n\n  VTK_CREATE(vtkRenderWindow, renwin);\n  renwin->AddRenderer(renderer);\n  renwin->SetSize(350, 500);\n\n  renderer->ResetCamera();\n  vtkCamera *camera = renderer->GetActiveCamera();\n  camera->Elevation(-90.0);\n  camera->OrthogonalizeViewUp();\n  camera->Elevation(-10.0);\n  camera->Azimuth(55.0);\n\n  int retVal = vtkTesting::Test(argc, argv, renwin, 5.0);\n  if (retVal == vtkRegressionTester::DO_INTERACTOR)\n    {\n    VTK_CREATE(vtkRenderWindowInteractor, iren);\n    iren->SetRenderWindow(renwin);\n    iren->Initialize();\n    iren->Start();\n    retVal = vtkRegressionTester::PASSED;\n    }\n\n  if (retVal == vtkRegressionTester::PASSED)\n    {\n    return 0;\n    }\n  else\n    {\n    return 1;\n    }\n}\n<commit_msg>BUG: Fix a problem where some machines were flipping the data over.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    UnstructuredGridCellGradients.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 (c) Sandia Corporation\n See Copyright.txt or http:\/\/www.paraview.org\/HTML\/Copyright.html for details.\n----------------------------------------------------------------------------*\/\n\n#include \"vtkActor.h\"\n#include \"vtkArrowSource.h\"\n#include \"vtkAssignAttribute.h\"\n#include \"vtkCamera.h\"\n#include \"vtkCellCenters.h\"\n#include \"vtkExtractEdges.h\"\n#include \"vtkGlyph3D.h\"\n#include \"vtkGradientFilter.h\"\n#include \"vtkPointDataToCellData.h\"\n#include \"vtkPolyDataMapper.h\"\n#include \"vtkRegressionTestImage.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkStdString.h\"\n#include \"vtkTubeFilter.h\"\n#include \"vtkUnstructuredGridReader.h\"\n\n#include \"vtkSmartPointer.h\"\n#define VTK_CREATE(type, var) \\\n  vtkSmartPointer<type> var = vtkSmartPointer<type>::New()\n\nint UnstructuredGridCellGradients(int argc, char *argv[])\n{\n  int i;\n  \/\/ Need to get the data root.\n  const char *data_root = NULL;\n  for (i = 0; i < argc-1; i++)\n    {\n    if (strcmp(\"-D\", argv[i]) == 0)\n      {\n      data_root = argv[i+1];\n      break;\n      }\n    }\n  if (!data_root)\n    {\n    cout << \"Need to specify the directory to VTK_DATA_ROOT with -D <dir>.\" << endl;\n    return 1;\n    }\n\n  \/\/ Create the reader for the data.\n  \/\/ This is the data that will be volume rendered.\n  vtkStdString filename;\n  filename = data_root;\n  filename += \"\/Data\/uGridEx.vtk\";\n  cout << \"Loading \" << filename.c_str() << endl;\n  VTK_CREATE(vtkUnstructuredGridReader, reader);\n  reader->SetFileName(filename.c_str());\n\n  VTK_CREATE(vtkExtractEdges, edges);\n  edges->SetInputConnection(reader->GetOutputPort());\n\n  VTK_CREATE(vtkTubeFilter, tubes);\n  tubes->SetInputConnection(edges->GetOutputPort());\n  tubes->SetRadius(0.0625);\n  tubes->SetVaryRadiusToVaryRadiusOff();\n  tubes->SetNumberOfSides(32);\n\n  VTK_CREATE(vtkPolyDataMapper, tubesMapper);\n  tubesMapper->SetInputConnection(tubes->GetOutputPort());\n  tubesMapper->SetScalarRange(0.0, 26.0);\n\n  VTK_CREATE(vtkActor, tubesActor);\n  tubesActor->SetMapper(tubesMapper);\n\n  VTK_CREATE(vtkPointDataToCellData, pd2cd);\n  pd2cd->SetInputConnection(reader->GetOutputPort());\n\n  VTK_CREATE(vtkGradientFilter, gradients);\n  gradients->SetInputConnection(pd2cd->GetOutputPort());\n  gradients->SetInputScalars(vtkDataObject::FIELD_ASSOCIATION_CELLS,\n                             vtkDataSetAttributes::SCALARS);\n\n  VTK_CREATE(vtkCellCenters, cellCenters);\n  cellCenters->SetInputConnection(gradients->GetOutputPort());\n\n  VTK_CREATE(vtkAssignAttribute, vectors);\n  vectors->SetInputConnection(cellCenters->GetOutputPort());\n  vectors->Assign(\"Gradients\", vtkDataSetAttributes::VECTORS,\n                  vtkAssignAttribute::POINT_DATA);\n\n  VTK_CREATE(vtkArrowSource, arrow);\n\n  VTK_CREATE(vtkGlyph3D, glyphs);\n  glyphs->SetInputConnection(0, vectors->GetOutputPort());\n  glyphs->SetInputConnection(1, arrow->GetOutputPort());\n  glyphs->ScalingOn();\n  glyphs->SetScaleModeToScaleByVector();\n  glyphs->SetScaleFactor(0.25);\n  glyphs->OrientOn();\n  glyphs->ClampingOff();\n  glyphs->SetVectorModeToUseVector();\n  glyphs->SetIndexModeToOff();\n\n  VTK_CREATE(vtkPolyDataMapper, glyphMapper);\n  glyphMapper->SetInputConnection(glyphs->GetOutputPort());\n  glyphMapper->ScalarVisibilityOff();\n\n  VTK_CREATE(vtkActor, glyphActor);\n  glyphActor->SetMapper(glyphMapper);\n\n  VTK_CREATE(vtkRenderer, renderer);\n  renderer->AddActor(tubesActor);\n  renderer->AddActor(glyphActor);\n  renderer->SetBackground(0.328125, 0.347656, 0.425781);\n\n  VTK_CREATE(vtkRenderWindow, renwin);\n  renwin->AddRenderer(renderer);\n  renwin->SetSize(350, 500);\n\n  renderer->ResetCamera();\n  vtkCamera *camera = renderer->GetActiveCamera();\n  camera->Elevation(-85.0);\n  camera->OrthogonalizeViewUp();\n  camera->Elevation(-5.0);\n  camera->OrthogonalizeViewUp();\n  camera->Elevation(-10.0);\n  camera->Azimuth(55.0);\n\n  int retVal = vtkTesting::Test(argc, argv, renwin, 5.0);\n  if (retVal == vtkRegressionTester::DO_INTERACTOR)\n    {\n    VTK_CREATE(vtkRenderWindowInteractor, iren);\n    iren->SetRenderWindow(renwin);\n    iren->Initialize();\n    iren->Start();\n    retVal = vtkRegressionTester::PASSED;\n    }\n\n  if (retVal == vtkRegressionTester::PASSED)\n    {\n    return 0;\n    }\n  else\n    {\n    return 1;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"Graph.hpp\"\n\ntemplate <typename Weight>\nWeight min_cost_flow(Graph<Weight> &g, int s, int t, Flow f) {\n  const int V = g.size();\n  const Weight INF = 1e9;\n  \/\/ const Weight eps = 1e-8;\n  static vector<Weight> h(V, 0), dist(V, 0);\n  static vector<int> prevv(V), preve(V);\n  using P = pair<Weight, int>;\n  Weight res = 0;\n  while (f > 0) {\n    priority_queue<P, vector<P>, greater<P>> que;\n    fill(begin(dist), end(dist), INF);\n    dist[s] = 0;\n    que.push(P(0, s));\n    while (!que.empty()) {\n      P p = que.top(); que.pop();\n      int v = p.second;\n      if (dist[v] < p.first) continue;\n      for (int i = 0; i < (int)g[v].size(); ++i) {\n        const auto &e = g[v][i];\n        if (e.cap <= 0) continue;\n        if (dist[e.to] > dist[v] + e.cost + h[v] - h[e.to] \/* + eps *\/) {\n          dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n          prevv[e.to] = v;\n          preve[e.to] = i;\n          que.push(P(dist[e.to], e.to));\n        }\n      }\n    }\n    if (dist[t] == INF) return -1;\n    for (int i = 0; i < V; ++i) {\n      h[i] += dist[i];\n    }\n\n    Flow d = f;\n    for (int v = t; v != s; v = prevv[v]) {\n      d = min(d, g[prevv[v]][preve[v]].cap);\n    }\n    f -= d;\n    res += d * h[t];\n    for (int v = t; v != s; v = prevv[v]) {\n      auto &e = g[prevv[v]][preve[v]];\n      e.cap -= d;\n      g[v][e.rev].cap += d;\n    }\n  }\n  return res;\n}\n\n\/\/ Verified : AOJ GRL_6_B (Minimum Cost Flow)\n\/*\nint main() {\n  int V, E, F;\n  cin >> V >> E >> F;\n  Graph<int> g(V);\n  while (E--) {\n    int u, v, c, d;\n    cin >> u >> v >> c >> d;\n    add_edge(g, u, v, c, d);\n  }\n  cout << min_cost_flow(g, 0, V-1, F) << endl;\n  return 0;\n}\n*\/\n<commit_msg>modify min_cost_flow<commit_after>#pragma once\n\n#include \"Graph.hpp\"\n\ntemplate <typename Flow, typename Cost>\nCost min_cost_flow(FCGraph<Flow, Cost> &g, int s, int t, Flow f,\n                   Cost inf, bool init = true) {\n  const int V = g.size();\n  \/\/ const Cost eps = 1e-8;\n  static vector<Cost> h(V, 0), dist(V, 0);\n  static vector<int> prevv(V), preve(V);\n  if (init) {\n    fill(begin(h), end(h), 0);\n    fill(begin(dist), end(dist), 0);\n    fill(begin(prevv), end(prevv), 0);\n    fill(begin(preve), end(preve), 0);\n  }\n  using P = pair<Cost, int>;\n  Cost res = 0;\n  while (f > 0) {\n    priority_queue<P, vector<P>, greater<P>> que;\n    fill(begin(dist), end(dist), inf);\n    dist[s] = 0;\n    que.push(P(0, s));\n    while (!que.empty()) {\n      P p = que.top(); que.pop();\n      int v = p.second;\n      if (dist[v] < p.first) continue;\n      for (int i = 0; i < (int)g[v].size(); ++i) {\n        const auto &e = g[v][i];\n        if (e.cap <= 0) continue;\n        if (dist[e.to] > dist[v] + e.cost + h[v] - h[e.to] \/* + eps *\/) {\n          dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n          prevv[e.to] = v;\n          preve[e.to] = i;\n          que.push(P(dist[e.to], e.to));\n        }\n      }\n    }\n    if (dist[t] == inf) return -1;\n    for (int i = 0; i < V; ++i) {\n      h[i] += dist[i];\n    }\n\n    Flow d = f;\n    for (int v = t; v != s; v = prevv[v]) {\n      d = min(d, g[prevv[v]][preve[v]].cap);\n    }\n    f -= d;\n    res += d * h[t];\n    for (int v = t; v != s; v = prevv[v]) {\n      auto &e = g[prevv[v]][preve[v]];\n      e.cap -= d;\n      g[v][e.rev].cap += d;\n    }\n  }\n  return res;\n}\n\n\/\/ Verified : AOJ GRL_6_B (Minimum Cost Flow)\n\/*\nint main() {\n  int V, E, F;\n  cin >> V >> E >> F;\n  FCGraph<int, int> g(V);\n  while (E--) {\n    int u, v, c, d;\n    cin >> u >> v >> c >> d;\n    add_edge(g, u, v, c, d);\n  }\n  cout << min_cost_flow(g, 0, V-1, F, int(1e9)) << endl;\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 \"net\/base\/address_list.h\"\n#include \"net\/base\/host_resolver.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/tcp_client_socket.h\"\n#include \"net\/base\/test_completion_callback.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n\/\/-----------------------------------------------------------------------------\n\nnamespace {\n\nclass TCPClientSocketTest : public testing::Test {\n};\n\n}  \/\/ namespace\n\n\/\/-----------------------------------------------------------------------------\n\nTEST_F(TCPClientSocketTest, Connect) {\n  net::AddressList addr;\n  net::HostResolver resolver;\n  TestCompletionCallback callback;\n\n  int rv = resolver.Resolve(\"www.google.com\", 80, &addr, NULL);\n  EXPECT_EQ(rv, net::OK);\n\n  net::TCPClientSocket sock(addr);\n\n  EXPECT_FALSE(sock.IsConnected());\n\n  rv = sock.Connect(&callback);\n  if (rv != net::OK) {\n    ASSERT_EQ(rv, net::ERR_IO_PENDING);\n\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, net::OK);\n  }\n\n  EXPECT_TRUE(sock.IsConnected());\n\n  sock.Disconnect();\n  EXPECT_FALSE(sock.IsConnected());\n}\n\nTEST_F(TCPClientSocketTest, Read) {\n  net::AddressList addr;\n  net::HostResolver resolver;\n  TestCompletionCallback callback;\n\n  int rv = resolver.Resolve(\"www.google.com\", 80, &addr, &callback);\n  EXPECT_EQ(rv, net::ERR_IO_PENDING);\n\n  rv = callback.WaitForResult();\n  EXPECT_EQ(rv, net::OK);\n\n  net::TCPClientSocket sock(addr);\n\n  rv = sock.Connect(&callback);\n  if (rv != net::OK) {\n    ASSERT_EQ(rv, net::ERR_IO_PENDING);\n\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, net::OK);\n  }\n\n  const char request_text[] = \"GET \/ HTTP\/1.0\\r\\n\\r\\n\";\n  rv = sock.Write(request_text, arraysize(request_text) - 1, &callback);\n  EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n  if (rv == net::ERR_IO_PENDING) {\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, arraysize(request_text) - 1);\n  }\n\n  char buf[4096];\n  for (;;) {\n    rv = sock.Read(buf, sizeof(buf), &callback);\n    EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n    if (rv == net::ERR_IO_PENDING)\n      rv = callback.WaitForResult();\n\n    EXPECT_GE(rv, 0);\n    if (rv <= 0)\n      break;\n  }\n}\n\nTEST_F(TCPClientSocketTest, Read_SmallChunks) {\n  net::AddressList addr;\n  net::HostResolver resolver;\n  TestCompletionCallback callback;\n\n  int rv = resolver.Resolve(\"www.google.com\", 80, &addr, NULL);\n  EXPECT_EQ(rv, net::OK);\n\n  net::TCPClientSocket sock(addr);\n\n  rv = sock.Connect(&callback);\n  if (rv != net::OK) {\n    ASSERT_EQ(rv, net::ERR_IO_PENDING);\n\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, net::OK);\n  }\n\n  const char request_text[] = \"GET \/ HTTP\/1.0\\r\\n\\r\\n\";\n  rv = sock.Write(request_text, arraysize(request_text) - 1, &callback);\n  EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n  if (rv == net::ERR_IO_PENDING) {\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, arraysize(request_text) - 1);\n  }\n\n  char buf[1];\n  for (;;) {\n    rv = sock.Read(buf, sizeof(buf), &callback);\n    EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n    if (rv == net::ERR_IO_PENDING)\n      rv = callback.WaitForResult();\n\n    EXPECT_GE(rv, 0);\n    if (rv <= 0)\n      break;\n  }\n}\n\nTEST_F(TCPClientSocketTest, Read_Interrupted) {\n  net::AddressList addr;\n  net::HostResolver resolver;\n  TestCompletionCallback callback;\n\n  int rv = resolver.Resolve(\"www.google.com\", 80, &addr, NULL);\n  EXPECT_EQ(rv, net::OK);\n\n  net::TCPClientSocket sock(addr);\n\n  rv = sock.Connect(&callback);\n  if (rv != net::OK) {\n    ASSERT_EQ(rv, net::ERR_IO_PENDING);\n\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, net::OK);\n  }\n\n  const char request_text[] = \"GET \/ HTTP\/1.0\\r\\n\\r\\n\";\n  rv = sock.Write(request_text, arraysize(request_text) - 1, &callback);\n  EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n  if (rv == net::ERR_IO_PENDING) {\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, arraysize(request_text) - 1);\n  }\n\n  \/\/ Do a partial read and then exit.  This test should not crash!\n  char buf[512];\n  rv = sock.Read(buf, sizeof(buf), &callback);\n  EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n  if (rv == net::ERR_IO_PENDING)\n    rv = callback.WaitForResult();\n\n  EXPECT_NE(rv, 0);\n}\n\n<commit_msg>Avoid signedness mismatch errors from gcc<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 \"net\/base\/address_list.h\"\n#include \"net\/base\/host_resolver.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/tcp_client_socket.h\"\n#include \"net\/base\/test_completion_callback.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n\/\/-----------------------------------------------------------------------------\n\nnamespace {\n\nclass TCPClientSocketTest : public testing::Test {\n};\n\n}  \/\/ namespace\n\n\/\/-----------------------------------------------------------------------------\n\nTEST_F(TCPClientSocketTest, Connect) {\n  net::AddressList addr;\n  net::HostResolver resolver;\n  TestCompletionCallback callback;\n\n  int rv = resolver.Resolve(\"www.google.com\", 80, &addr, NULL);\n  EXPECT_EQ(rv, net::OK);\n\n  net::TCPClientSocket sock(addr);\n\n  EXPECT_FALSE(sock.IsConnected());\n\n  rv = sock.Connect(&callback);\n  if (rv != net::OK) {\n    ASSERT_EQ(rv, net::ERR_IO_PENDING);\n\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, net::OK);\n  }\n\n  EXPECT_TRUE(sock.IsConnected());\n\n  sock.Disconnect();\n  EXPECT_FALSE(sock.IsConnected());\n}\n\nTEST_F(TCPClientSocketTest, Read) {\n  net::AddressList addr;\n  net::HostResolver resolver;\n  TestCompletionCallback callback;\n\n  int rv = resolver.Resolve(\"www.google.com\", 80, &addr, &callback);\n  EXPECT_EQ(rv, net::ERR_IO_PENDING);\n\n  rv = callback.WaitForResult();\n  EXPECT_EQ(rv, net::OK);\n\n  net::TCPClientSocket sock(addr);\n\n  rv = sock.Connect(&callback);\n  if (rv != net::OK) {\n    ASSERT_EQ(rv, net::ERR_IO_PENDING);\n\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, net::OK);\n  }\n\n  const char request_text[] = \"GET \/ HTTP\/1.0\\r\\n\\r\\n\";\n  rv = sock.Write(request_text, arraysize(request_text) - 1, &callback);\n  EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n  if (rv == net::ERR_IO_PENDING) {\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, static_cast<int>(arraysize(request_text) - 1));\n  }\n\n  char buf[4096];\n  for (;;) {\n    rv = sock.Read(buf, sizeof(buf), &callback);\n    EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n    if (rv == net::ERR_IO_PENDING)\n      rv = callback.WaitForResult();\n\n    EXPECT_GE(rv, 0);\n    if (rv <= 0)\n      break;\n  }\n}\n\nTEST_F(TCPClientSocketTest, Read_SmallChunks) {\n  net::AddressList addr;\n  net::HostResolver resolver;\n  TestCompletionCallback callback;\n\n  int rv = resolver.Resolve(\"www.google.com\", 80, &addr, NULL);\n  EXPECT_EQ(rv, net::OK);\n\n  net::TCPClientSocket sock(addr);\n\n  rv = sock.Connect(&callback);\n  if (rv != net::OK) {\n    ASSERT_EQ(rv, net::ERR_IO_PENDING);\n\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, net::OK);\n  }\n\n  const char request_text[] = \"GET \/ HTTP\/1.0\\r\\n\\r\\n\";\n  rv = sock.Write(request_text, arraysize(request_text) - 1, &callback);\n  EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n  if (rv == net::ERR_IO_PENDING) {\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, static_cast<int>(arraysize(request_text) - 1));\n  }\n\n  char buf[1];\n  for (;;) {\n    rv = sock.Read(buf, sizeof(buf), &callback);\n    EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n    if (rv == net::ERR_IO_PENDING)\n      rv = callback.WaitForResult();\n\n    EXPECT_GE(rv, 0);\n    if (rv <= 0)\n      break;\n  }\n}\n\nTEST_F(TCPClientSocketTest, Read_Interrupted) {\n  net::AddressList addr;\n  net::HostResolver resolver;\n  TestCompletionCallback callback;\n\n  int rv = resolver.Resolve(\"www.google.com\", 80, &addr, NULL);\n  EXPECT_EQ(rv, net::OK);\n\n  net::TCPClientSocket sock(addr);\n\n  rv = sock.Connect(&callback);\n  if (rv != net::OK) {\n    ASSERT_EQ(rv, net::ERR_IO_PENDING);\n\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, net::OK);\n  }\n\n  const char request_text[] = \"GET \/ HTTP\/1.0\\r\\n\\r\\n\";\n  rv = sock.Write(request_text, arraysize(request_text) - 1, &callback);\n  EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n  if (rv == net::ERR_IO_PENDING) {\n    rv = callback.WaitForResult();\n    EXPECT_EQ(rv, static_cast<int>(arraysize(request_text) - 1));\n  }\n\n  \/\/ Do a partial read and then exit.  This test should not crash!\n  char buf[512];\n  rv = sock.Read(buf, sizeof(buf), &callback);\n  EXPECT_TRUE(rv >= 0 || rv == net::ERR_IO_PENDING);\n\n  if (rv == net::ERR_IO_PENDING)\n    rv = callback.WaitForResult();\n\n  EXPECT_NE(rv, 0);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2006-2020  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 \"vectorrealtotensor.h\"\n\nusing namespace std;\n\nnamespace essentia {\nnamespace streaming {\n\nconst char* VectorRealToTensor::name = \"VectorRealToTensor\";\nconst char* VectorRealToTensor::category = \"Standard\";\nconst char* VectorRealToTensor::description = DOC(\"This algorithm generates tensors \"\n\"out of a stream of input frames. The 4 dimensions of the tensors stand for (batchSize, channels, patchSize, featureSize):\\n\"\n\"  - batchSize: Number of patches per tensor. If batchSize is set to 0 it will accumulate patches until the end of the stream is reached and then produce a single tensor. \"\n\"Warning: This option may exhaust memory depending on the size of the stream.\\n\"\n\"  - channels: Number of channels per tensor. Currently, only single-channel tensors are supported. Otherwise, an exception is thrown.\\n\"\n\"  - patchSize: Number of timestamps (i.e., number of frames) per patch.\\n\"\n\"  - featureSize: Expected number of features (e.g., mel bands) of every input frame. This algorithm throws an exception if the size of any frame is different from featureSize.\\n\"\n\"Additionally, the patchHopSize and batchHopSize parameters provide control over the amount of overlap on those dimensions.\");\n\n\nvoid VectorRealToTensor::configure() {\n  vector<int> shape = parameter(\"shape\").toVectorInt();\n  _patchHopSize = parameter(\"patchHopSize\").toInt();\n  _batchHopSize = parameter(\"batchHopSize\").toInt();\n  _lastPatchMode = parameter(\"lastPatchMode\").toString();\n\n  _shape.resize(shape.size());\n  for (size_t i = 0; i < shape.size(); i++) {\n    if (shape[i] == 0) {\n    throw EssentiaException(\"VectorRealToTensor: All dimensions should have a non-zero size.\");\n    }\n\n    _shape[i] = shape[i];\n  }\n\n  if (shape[1] != 1) {\n    throw EssentiaException(\"VectorRealToTensor: Currently only single-channel tensors are supported.\");\n  }\n\n  _timeStamps = shape[2];\n  _frame.setAcquireSize(_timeStamps);\n\n  if (shape[0] == -1) {\n    _accumulate = true;\n  }\n\n  if (_batchHopSize == 0) {\n    _batchHopSize = shape[0];\n  }\n\n  if (_patchHopSize == 0) {\n    _patchHopSize = _timeStamps;\n  }\n\n  _acc.assign(0, vector<vector<Real> >(_shape[2], vector<Real>(_shape[3], 0.0)));\n  _push = false;\n\n  if (_patchHopSize > _timeStamps) {\n    throw EssentiaException(\"VectorRealToTensor: `patchHopSize` has to be smaller that the number of timestamps\");\n  }\n\n\n  if (shape[0] > 0) {\n    if (_batchHopSize > _timeStamps) {\n      throw EssentiaException(\"VectorRealToTensor: `batchHopSize` has to be smaller that the number batch size (shape[0])\");\n    }\n  }\n\n}\n\n\nAlgorithmStatus VectorRealToTensor::process() {\n  EXEC_DEBUG(\"process()\");\n  if (_timeStamps != _frame.acquireSize()) {\n    _frame.setAcquireSize(_timeStamps);\n  }\n  if (_patchHopSize != _frame.releaseSize()) {\n    _frame.setReleaseSize(_patchHopSize);\n  }\n\n  \/\/ Check if we have enough frames to add a patch.\n  int available = _frame.available();\n  bool addPatch = (available >= _timeStamps);\n\n  \/\/ If we should stop just take the remaining frames.\n  if (shouldStop() && (available < _timeStamps)) {\n    _frame.setAcquireSize(available);\n    _frame.setReleaseSize(available);\n\n    \/\/ Push if there are remaining frames\n    if (_lastPatchMode == \"repeat\" && available > 0) {\n      addPatch = true;\n      _push = true;\n  \n    \/\/ or if we have been accumulating.\n    } else if (_accumulate && _acc.size() >= 1) {\n      addPatch = true;\n      _push = true;\n    }\n  }\n\n  \/\/ Return if there is nothing to do.\n  if ((!addPatch) && (!_push)) return NO_INPUT;\n\n  if (_push) {\n    _tensor.setAcquireSize(1);\n    _tensor.setReleaseSize(1);\n\n    \/\/ Don't get frames if we just want to push.\n    if (!addPatch) {\n      _frame.setAcquireSize(0);\n      _frame.setReleaseSize(0);\n    }\n\n  \/\/ Don't get a tensor if we are just accumulating.\n  } else {\n    _tensor.setAcquireSize(0);\n    _tensor.setReleaseSize(0);\n  }\n\n  AlgorithmStatus status = acquireData();\n  EXEC_DEBUG(\"data acquired (in: \" << _frame.acquireSize()\n            << \" - out: \" << _tensor.acquireSize() << \")\");\n\n  if (status != OK) {\n    return status;\n  };\n\n  AlgorithmStatus outStatus = NO_OUTPUT;\n\n  \/\/ Frames accumulation step.\n  if (addPatch) {\n    const vector<vector<Real> >& frame = _frame.tokens();\n\n    \/\/ Sanity check.\n    for (size_t i = 0; i < frame.size(); i++) {\n      if ((int)frame[i].size() != _shape[3]) {\n        throw EssentiaException(\"VectorRealToTensor: Found input frame with size \", frame[i].size(),\n                                \" while the algorithm was configured to work with frames with size \", _shape[3]);\n      }\n    }\n\n    \/\/ Add a regular patch.\n    if ((int)frame.size() == _timeStamps) {\n      _acc.push_back(frame);\n\n    \/\/ If size does not match rather repeat frames or discard them.\n    } else {\n      if (_lastPatchMode == \"repeat\") {\n        if (frame.size() == 0) {\n          EXEC_DEBUG(\"VectorRealToTensor: 0 frames remaining.\");\n\n        } else {\n          vector<vector<Real> > padded_frame = frame;\n\n          for (int i = 0; i < _timeStamps; i++) {\n            padded_frame.push_back(frame[i % frame.size()]);\n          }\n\n          EXEC_DEBUG(\"VectorRealToTensor: Repeating the remaining \" << frame.size() << \" frames to make one last patch.\");\n          _acc.push_back(padded_frame);\n        }\n\n      } else if (_lastPatchMode == \"discard\") {\n        EXEC_DEBUG(\"VectorRealToTensor: Discarding last frames\");\n      } else {\n        throw EssentiaException(\"VectorRealToTensor: Incomplete patch found \"\n                                \"before reaching the end of the stream. This is not supposed to happen\");\n      }\n    }\n  }\n\n  \/\/ We only push if when we have filled the whole batch\n  \/\/ or if we have reached the end of the stream in\n  \/\/ accumulate mode.\n  if (_push) {\n    vector<int> shape = _shape;\n    int batchHopSize = _batchHopSize;\n\n    \/\/ If we have been accumulating we have to get the\n    \/\/ tensor's shape from the current status of the\n    \/\/ accumulator.\n    if (_accumulate) {\n      shape[0] = _acc.size();\n      batchHopSize = _acc.size();\n\n      if (_acc.size() == 0) {\n        throw EssentiaException(\"VectorRealToTensor: The stream has finished without enough frames to \"\n                                \"produce a patch of the desired size. Consider setting the `lastPatchMode` \"\n                                \"parameter to `repeat` in order to produce a batch.\");\n      }\n    }\n\n    Tensor<Real>& tensor = *(Tensor<Real> *)_tensor.getFirstToken();\n    tensor.resize(shape);\n\n    \/\/ TODO: Add flag to swap frequency axis from 4 to 2.\n    for (int i = 0; i < shape[0]; i++) {      \/\/ Batch axis\n      for (int j = 0; j < shape[2]; j++) {    \/\/ Time axis\n        for (int k = 0; k < shape[3]; k++) {  \/\/ Freq axis\n          tensor(i, 0, j, k) = _acc[i][j][k];\n        }\n      }\n    }\n\n    \/\/ Empty the accumulator.\n    _acc.erase(_acc.begin(), _acc.begin() + batchHopSize);\n  \n    _push = false;\n    outStatus = OK;\n  }\n\n  \/\/ Check if we should push in the next process().\n  if (!_accumulate) {\n    if ((int)_acc.size() >= _shape[0]) _push = true;\n  }\n\n  EXEC_DEBUG(\"releasing\");\n  releaseData();\n  EXEC_DEBUG(\"released\");\n  return outStatus;\n}\n\nvoid VectorRealToTensor::reset() {\n  _acc.assign(0, vector<vector<Real> >(_shape[1], vector<Real>(_shape[2], 0.0)));\n  _push = false;\n}\n\n} \/\/ namespace streaming\n} \/\/ namespace essentia\n<commit_msg>Add Warning to VectorRealToTensor<commit_after>\/*\n * Copyright (C) 2006-2020  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 \"vectorrealtotensor.h\"\n\nusing namespace std;\n\nnamespace essentia {\nnamespace streaming {\n\nconst char* VectorRealToTensor::name = \"VectorRealToTensor\";\nconst char* VectorRealToTensor::category = \"Standard\";\nconst char* VectorRealToTensor::description = DOC(\"This algorithm generates tensors \"\n\"out of a stream of input frames. The 4 dimensions of the tensors stand for (batchSize, channels, patchSize, featureSize):\\n\"\n\"  - batchSize: Number of patches per tensor. If batchSize is set to 0 it will accumulate patches until the end of the stream is reached and then produce a single tensor. \"\n\"Warning: This option may exhaust memory depending on the size of the stream.\\n\"\n\"  - channels: Number of channels per tensor. Currently, only single-channel tensors are supported. Otherwise, an exception is thrown.\\n\"\n\"  - patchSize: Number of timestamps (i.e., number of frames) per patch.\\n\"\n\"  - featureSize: Expected number of features (e.g., mel bands) of every input frame. This algorithm throws an exception if the size of any frame is different from featureSize.\\n\"\n\"Additionally, the patchHopSize and batchHopSize parameters provide control over the amount of overlap on those dimensions.\");\n\n\nvoid VectorRealToTensor::configure() {\n  vector<int> shape = parameter(\"shape\").toVectorInt();\n  _patchHopSize = parameter(\"patchHopSize\").toInt();\n  _batchHopSize = parameter(\"batchHopSize\").toInt();\n  _lastPatchMode = parameter(\"lastPatchMode\").toString();\n\n  _shape.resize(shape.size());\n  for (size_t i = 0; i < shape.size(); i++) {\n    if (shape[i] == 0) {\n    throw EssentiaException(\"VectorRealToTensor: All dimensions should have a non-zero size.\");\n    }\n\n    _shape[i] = shape[i];\n  }\n\n  if (shape[1] != 1) {\n    throw EssentiaException(\"VectorRealToTensor: Currently only single-channel tensors are supported.\");\n  }\n\n  _timeStamps = shape[2];\n  _frame.setAcquireSize(_timeStamps);\n\n  if (shape[0] == -1) {\n    _accumulate = true;\n  }\n\n  if (_batchHopSize == 0) {\n    _batchHopSize = shape[0];\n  }\n\n  if (_patchHopSize == 0) {\n    _patchHopSize = _timeStamps;\n  }\n\n  _acc.assign(0, vector<vector<Real> >(_shape[2], vector<Real>(_shape[3], 0.0)));\n  _push = false;\n\n  if (_patchHopSize > _timeStamps) {\n    throw EssentiaException(\"VectorRealToTensor: `patchHopSize` has to be smaller that the number of timestamps\");\n  }\n\n\n  if (shape[0] > 0) {\n    if (_batchHopSize > _timeStamps) {\n      throw EssentiaException(\"VectorRealToTensor: `batchHopSize` has to be smaller that the number batch size (shape[0])\");\n    }\n  }\n\n}\n\n\nAlgorithmStatus VectorRealToTensor::process() {\n  EXEC_DEBUG(\"process()\");\n  if (_timeStamps != _frame.acquireSize()) {\n    _frame.setAcquireSize(_timeStamps);\n  }\n  if (_patchHopSize != _frame.releaseSize()) {\n    _frame.setReleaseSize(_patchHopSize);\n  }\n\n  \/\/ Check if we have enough frames to add a patch.\n  int available = _frame.available();\n  bool addPatch = (available >= _timeStamps);\n\n  \/\/ If we should stop just take the remaining frames.\n  if (shouldStop() && (available < _timeStamps)) {\n    _frame.setAcquireSize(available);\n    _frame.setReleaseSize(available);\n\n    \/\/ Push if there are remaining frames\n    if (_lastPatchMode == \"repeat\" && available > 0) {\n      addPatch = true;\n      _push = true;\n  \n    \/\/ or if we have been accumulating.\n    } else if (_accumulate && _acc.size() >= 1) {\n      addPatch = true;\n      _push = true;\n    }\n  }\n\n  \/\/ Return if there is nothing to do.\n  if ((!addPatch) && (!_push)) return NO_INPUT;\n\n  if (_push) {\n    _tensor.setAcquireSize(1);\n    _tensor.setReleaseSize(1);\n\n    \/\/ Don't get frames if we just want to push.\n    if (!addPatch) {\n      _frame.setAcquireSize(0);\n      _frame.setReleaseSize(0);\n    }\n\n  \/\/ Don't get a tensor if we are just accumulating.\n  } else {\n    _tensor.setAcquireSize(0);\n    _tensor.setReleaseSize(0);\n  }\n\n  AlgorithmStatus status = acquireData();\n  EXEC_DEBUG(\"data acquired (in: \" << _frame.acquireSize()\n            << \" - out: \" << _tensor.acquireSize() << \")\");\n\n  if (status != OK) {\n    return status;\n  };\n\n  AlgorithmStatus outStatus = NO_OUTPUT;\n\n  \/\/ Frames accumulation step.\n  if (addPatch) {\n    const vector<vector<Real> >& frame = _frame.tokens();\n\n    \/\/ Sanity check.\n    for (size_t i = 0; i < frame.size(); i++) {\n      if ((int)frame[i].size() != _shape[3]) {\n        throw EssentiaException(\"VectorRealToTensor: Found input frame with size \", frame[i].size(),\n                                \" while the algorithm was configured to work with frames with size \", _shape[3]);\n      }\n    }\n\n    \/\/ Add a regular patch.\n    if ((int)frame.size() == _timeStamps) {\n      _acc.push_back(frame);\n\n    \/\/ If size does not match rather repeat frames or discard them.\n    } else {\n      if (_lastPatchMode == \"repeat\") {\n        if (frame.size() == 0) {\n          EXEC_DEBUG(\"VectorRealToTensor: 0 frames remaining.\");\n\n        } else {\n          if (frame.size() < 10) {\n            E_WARNING(\"VectorRealToTensor: Last patch produced by repeating the last \" << frame.size() << \" frames. May result in unreliable predictions.\");\n          }\n          vector<vector<Real> > padded_frame = frame;\n\n          for (int i = 0; i < _timeStamps; i++) {\n            padded_frame.push_back(frame[i % frame.size()]);\n          }\n\n          EXEC_DEBUG(\"VectorRealToTensor: Repeating the remaining \" << frame.size() << \" frames to make one last patch.\");\n          _acc.push_back(padded_frame);\n        }\n\n      } else if (_lastPatchMode == \"discard\") {\n        EXEC_DEBUG(\"VectorRealToTensor: Discarding last frames\");\n\n      } else {\n        throw EssentiaException(\"VectorRealToTensor: Incomplete patch found \"\n                                \"before reaching the end of the stream. This is not supposed to happen\");\n      }\n    }\n  }\n\n  \/\/ We only push if when we have filled the whole batch\n  \/\/ or if we have reached the end of the stream in\n  \/\/ accumulate mode.\n  if (_push) {\n    vector<int> shape = _shape;\n    int batchHopSize = _batchHopSize;\n\n    \/\/ If we have been accumulating we have to get the\n    \/\/ tensor's shape from the current status of the\n    \/\/ accumulator.\n    if (_accumulate) {\n      shape[0] = _acc.size();\n      batchHopSize = _acc.size();\n\n      if (_acc.size() == 0) {\n        throw EssentiaException(\"VectorRealToTensor: The stream has finished without enough frames to \"\n                                \"produce a patch of the desired size. Consider setting the `lastPatchMode` \"\n                                \"parameter to `repeat` in order to produce a batch.\");\n      }\n    }\n\n    Tensor<Real>& tensor = *(Tensor<Real> *)_tensor.getFirstToken();\n    tensor.resize(shape);\n\n    \/\/ TODO: Add flag to swap frequency axis from 4 to 2.\n    for (int i = 0; i < shape[0]; i++) {      \/\/ Batch axis\n      for (int j = 0; j < shape[2]; j++) {    \/\/ Time axis\n        for (int k = 0; k < shape[3]; k++) {  \/\/ Freq axis\n          tensor(i, 0, j, k) = _acc[i][j][k];\n        }\n      }\n    }\n\n    \/\/ Empty the accumulator.\n    _acc.erase(_acc.begin(), _acc.begin() + batchHopSize);\n  \n    _push = false;\n    outStatus = OK;\n  }\n\n  \/\/ Check if we should push in the next process().\n  if (!_accumulate) {\n    if ((int)_acc.size() >= _shape[0]) _push = true;\n  }\n\n  EXEC_DEBUG(\"releasing\");\n  releaseData();\n  EXEC_DEBUG(\"released\");\n  return outStatus;\n}\n\nvoid VectorRealToTensor::reset() {\n  _acc.assign(0, vector<vector<Real> >(_shape[1], vector<Real>(_shape[2], 0.0)));\n  _push = false;\n}\n\n} \/\/ namespace streaming\n} \/\/ namespace essentia\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 The SwiftShader 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 \"FrameBufferX11.hpp\"\n\n#include \"libX11.hpp\"\n#include \"Common\/Timer.hpp\"\n\n#include <sys\/ipc.h>\n#include <sys\/shm.h>\n#include <string.h>\n#include <assert.h>\n#include <stdlib.h>\n\nnamespace sw\n{\n\tstatic int (*PreviousXErrorHandler)(Display *display, XErrorEvent *event) = 0;\n\tstatic bool shmBadAccess = false;\n\n\t\/\/ Catches BadAcces errors so we can fall back to not using MIT-SHM\n\tstatic int XShmErrorHandler(Display *display, XErrorEvent *event)\n\t{\n\t\tif(event->error_code == BadAccess)\n\t\t{\n\t\t\tshmBadAccess = true;\n\t\t\treturn 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn PreviousXErrorHandler(display, event);\n\t\t}\n\t}\n\n\tFrameBufferX11::FrameBufferX11(Display *display, Window window, int width, int height) : FrameBuffer(width, height, false, false), ownX11(!display), x_display(display), x_window(window)\n\t{\n\t\tif(!x_display)\n\t\t{\n\t\t\tx_display = libX11->XOpenDisplay(0);\n\t\t\tassert(x_display);\n\t\t}\n\n\t\tXWindowAttributes attribs;\n\t\tStatus status = libX11->XGetWindowAttributes(display, window, &attribs);\n\t\tassert(status == 0);\n\t\tint depth = attribs.depth;\n\t\tVisual *visual = attribs.visual;\n\n\t\tx_gc = libX11->XCreateGC(x_display, window, 0, nullptr);\n\n\t\tmit_shm = (libX11->XShmQueryExtension && libX11->XShmQueryExtension(x_display) == True);\n\t\tif(mit_shm)\n\t\t{\n\t\t\tx_image = libX11->XShmCreateImage(x_display, visual, depth, ZPixmap, 0, &shminfo, width, height);\n\n\t\t\tshminfo.shmid = shmget(IPC_PRIVATE, x_image->bytes_per_line * x_image->height, IPC_CREAT | SHM_R | SHM_W);\n\t\t\tshminfo.shmaddr = x_image->data = (char*)shmat(shminfo.shmid, 0, 0);\n\t\t\tshminfo.readOnly = False;\n\n\t\t\tPreviousXErrorHandler = libX11->XSetErrorHandler(XShmErrorHandler);\n\t\t\tlibX11->XShmAttach(x_display, &shminfo);   \/\/ May produce a BadAccess error\n\t\t\tlibX11->XSync(x_display, False);\n\t\t\tlibX11->XSetErrorHandler(PreviousXErrorHandler);\n\n\t\t\tif(shmBadAccess)\n\t\t\t{\n\t\t\t\tmit_shm = false;\n\n\t\t\t\tXDestroyImage(x_image);\n\t\t\t\tshmdt(shminfo.shmaddr);\n\t\t\t\tshmctl(shminfo.shmid, IPC_RMID, 0);\n\n\t\t\t\tshmBadAccess = false;\n\t\t\t}\n\t\t}\n\n\t\tif(!mit_shm)\n\t\t{\n\t\t\tint bytes_per_line = width * 4;\n\t\t\tint bytes_per_image = height * bytes_per_line;\n\t\t\tchar *buffer = (char*)malloc(bytes_per_image);\n\t\t\tmemset(buffer, 0, bytes_per_image);\n\n\t\t\tx_image = libX11->XCreateImage(x_display, visual, depth, ZPixmap, 0, buffer, width, height, 32, bytes_per_line);\n\t\t\tassert(x_image);\n\n\t\t\tif(!x_image)\n\t\t\t{\n\t\t\t\tfree(buffer);\n\t\t\t}\n\t\t}\n\t}\n\n\tFrameBufferX11::~FrameBufferX11()\n\t{\n\t\tif(x_gc)\n\t\t{\n\t\t\tlibX11->XFreeGC(x_display, x_gc);\n\t\t}\n\n\t\tif(!mit_shm)\n\t\t{\n\t\t\tXDestroyImage(x_image);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlibX11->XShmDetach(x_display, &shminfo);\n\t\t\tXDestroyImage(x_image);\n\t\t\tshmdt(shminfo.shmaddr);\n\t\t\tshmctl(shminfo.shmid, IPC_RMID, 0);\n\t\t}\n\n\t\tif(ownX11)\n\t\t{\n\t\t\tlibX11->XCloseDisplay(x_display);\n\t\t}\n\t}\n\n\tvoid *FrameBufferX11::lock()\n\t{\n\t\tif(x_image)\n\t\t{\n\t\t\tstride = x_image->bytes_per_line;\n\t\t\tframebuffer = x_image->data;\n\t\t}\n\n\t\treturn framebuffer;\n\t}\n\n\tvoid FrameBufferX11::unlock()\n\t{\n\t\tframebuffer = nullptr;\n\t}\n\n\tvoid FrameBufferX11::blit(sw::Surface *source, const Rect *sourceRect, const Rect *destRect)\n\t{\n\t\tcopy(source);\n\n\t\tif(!mit_shm)\n\t\t{\n\t\t\tlibX11->XPutImage(x_display, x_window, x_gc, x_image, 0, 0, 0, 0, width, height);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlibX11->XShmPutImage(x_display, x_window, x_gc, x_image, 0, 0, 0, 0, width, height, False);\n\t\t}\n\n\t\tlibX11->XSync(x_display, False);\n\n\t\tif(false)   \/\/ Draw the framerate on screen\n\t\t{\n\t\t\tstatic double fpsTime = sw::Timer::seconds();\n\t\t\tstatic int frames = -1;\n\n\t\t\tdouble time = sw::Timer::seconds();\n\t\t\tdouble delta = time - fpsTime;\n\t\t\tframes++;\n\n\t\t\tstatic double FPS = 0.0;\n\t\t\tstatic double maxFPS = 0.0;\n\n\t\t\tif(delta > 1.0)\n\t\t\t{\n\t\t\t\tFPS = frames \/ delta;\n\n\t\t\t\tfpsTime = time;\n\t\t\t\tframes = 0;\n\n\t\t\t\tif(FPS > maxFPS)\n\t\t\t\t{\n\t\t\t\t\tmaxFPS = FPS;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tchar string[256];\n\t\t\tsprintf(string, \"FPS: %.2f (max: %.2f)\", FPS, maxFPS);\n\t\t\tlibX11->XDrawString(x_display, x_window, x_gc, 50, 50, string, strlen(string));\n\t\t}\n\t}\n}\n\n\/\/ Chromium can be built with USE_X11 && USE_OZONE. In case of pure USE_X11 builds, we can use this path.\n\/\/ In another case, the decision what framebuffer to create will be done by the FrameBufferFactoryOzone.\n#if !defined(USE_OZONE)\nNO_SANITIZE_FUNCTION sw::FrameBuffer *createFrameBuffer(void *display, Window window, int width, int height)\n{\n\treturn new sw::FrameBufferX11((::Display*)display, window, width, height);\n}\n#endif\n<commit_msg>Convert failing assert condition<commit_after>\/\/ Copyright 2016 The SwiftShader 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 \"FrameBufferX11.hpp\"\n\n#include \"libX11.hpp\"\n#include \"Common\/Timer.hpp\"\n\n#include <sys\/ipc.h>\n#include <sys\/shm.h>\n#include <string.h>\n#include <assert.h>\n#include <stdlib.h>\n\nnamespace sw\n{\n\tstatic int (*PreviousXErrorHandler)(Display *display, XErrorEvent *event) = 0;\n\tstatic bool shmBadAccess = false;\n\n\t\/\/ Catches BadAcces errors so we can fall back to not using MIT-SHM\n\tstatic int XShmErrorHandler(Display *display, XErrorEvent *event)\n\t{\n\t\tif(event->error_code == BadAccess)\n\t\t{\n\t\t\tshmBadAccess = true;\n\t\t\treturn 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn PreviousXErrorHandler(display, event);\n\t\t}\n\t}\n\n\tFrameBufferX11::FrameBufferX11(Display *display, Window window, int width, int height) : FrameBuffer(width, height, false, false), ownX11(!display), x_display(display), x_window(window)\n\t{\n\t\tif(!x_display)\n\t\t{\n\t\t\tx_display = libX11->XOpenDisplay(0);\n\t\t\tassert(x_display);\n\t\t}\n\n\t\tXWindowAttributes attribs;\n\t\tStatus status = libX11->XGetWindowAttributes(display, window, &attribs);\n\t\tassert(status != 0);\n\t\tint depth = attribs.depth;\n\t\tVisual *visual = attribs.visual;\n\n\t\tx_gc = libX11->XCreateGC(x_display, window, 0, nullptr);\n\n\t\tmit_shm = (libX11->XShmQueryExtension && libX11->XShmQueryExtension(x_display) == True);\n\t\tif(mit_shm)\n\t\t{\n\t\t\tx_image = libX11->XShmCreateImage(x_display, visual, depth, ZPixmap, 0, &shminfo, width, height);\n\n\t\t\tshminfo.shmid = shmget(IPC_PRIVATE, x_image->bytes_per_line * x_image->height, IPC_CREAT | SHM_R | SHM_W);\n\t\t\tshminfo.shmaddr = x_image->data = (char*)shmat(shminfo.shmid, 0, 0);\n\t\t\tshminfo.readOnly = False;\n\n\t\t\tPreviousXErrorHandler = libX11->XSetErrorHandler(XShmErrorHandler);\n\t\t\tlibX11->XShmAttach(x_display, &shminfo);   \/\/ May produce a BadAccess error\n\t\t\tlibX11->XSync(x_display, False);\n\t\t\tlibX11->XSetErrorHandler(PreviousXErrorHandler);\n\n\t\t\tif(shmBadAccess)\n\t\t\t{\n\t\t\t\tmit_shm = false;\n\n\t\t\t\tXDestroyImage(x_image);\n\t\t\t\tshmdt(shminfo.shmaddr);\n\t\t\t\tshmctl(shminfo.shmid, IPC_RMID, 0);\n\n\t\t\t\tshmBadAccess = false;\n\t\t\t}\n\t\t}\n\n\t\tif(!mit_shm)\n\t\t{\n\t\t\tint bytes_per_line = width * 4;\n\t\t\tint bytes_per_image = height * bytes_per_line;\n\t\t\tchar *buffer = (char*)malloc(bytes_per_image);\n\t\t\tmemset(buffer, 0, bytes_per_image);\n\n\t\t\tx_image = libX11->XCreateImage(x_display, visual, depth, ZPixmap, 0, buffer, width, height, 32, bytes_per_line);\n\t\t\tassert(x_image);\n\n\t\t\tif(!x_image)\n\t\t\t{\n\t\t\t\tfree(buffer);\n\t\t\t}\n\t\t}\n\t}\n\n\tFrameBufferX11::~FrameBufferX11()\n\t{\n\t\tif(x_gc)\n\t\t{\n\t\t\tlibX11->XFreeGC(x_display, x_gc);\n\t\t}\n\n\t\tif(!mit_shm)\n\t\t{\n\t\t\tXDestroyImage(x_image);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlibX11->XShmDetach(x_display, &shminfo);\n\t\t\tXDestroyImage(x_image);\n\t\t\tshmdt(shminfo.shmaddr);\n\t\t\tshmctl(shminfo.shmid, IPC_RMID, 0);\n\t\t}\n\n\t\tif(ownX11)\n\t\t{\n\t\t\tlibX11->XCloseDisplay(x_display);\n\t\t}\n\t}\n\n\tvoid *FrameBufferX11::lock()\n\t{\n\t\tif(x_image)\n\t\t{\n\t\t\tstride = x_image->bytes_per_line;\n\t\t\tframebuffer = x_image->data;\n\t\t}\n\n\t\treturn framebuffer;\n\t}\n\n\tvoid FrameBufferX11::unlock()\n\t{\n\t\tframebuffer = nullptr;\n\t}\n\n\tvoid FrameBufferX11::blit(sw::Surface *source, const Rect *sourceRect, const Rect *destRect)\n\t{\n\t\tcopy(source);\n\n\t\tif(!mit_shm)\n\t\t{\n\t\t\tlibX11->XPutImage(x_display, x_window, x_gc, x_image, 0, 0, 0, 0, width, height);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlibX11->XShmPutImage(x_display, x_window, x_gc, x_image, 0, 0, 0, 0, width, height, False);\n\t\t}\n\n\t\tlibX11->XSync(x_display, False);\n\n\t\tif(false)   \/\/ Draw the framerate on screen\n\t\t{\n\t\t\tstatic double fpsTime = sw::Timer::seconds();\n\t\t\tstatic int frames = -1;\n\n\t\t\tdouble time = sw::Timer::seconds();\n\t\t\tdouble delta = time - fpsTime;\n\t\t\tframes++;\n\n\t\t\tstatic double FPS = 0.0;\n\t\t\tstatic double maxFPS = 0.0;\n\n\t\t\tif(delta > 1.0)\n\t\t\t{\n\t\t\t\tFPS = frames \/ delta;\n\n\t\t\t\tfpsTime = time;\n\t\t\t\tframes = 0;\n\n\t\t\t\tif(FPS > maxFPS)\n\t\t\t\t{\n\t\t\t\t\tmaxFPS = FPS;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tchar string[256];\n\t\t\tsprintf(string, \"FPS: %.2f (max: %.2f)\", FPS, maxFPS);\n\t\t\tlibX11->XDrawString(x_display, x_window, x_gc, 50, 50, string, strlen(string));\n\t\t}\n\t}\n}\n\n\/\/ Chromium can be built with USE_X11 && USE_OZONE. In case of pure USE_X11 builds, we can use this path.\n\/\/ In another case, the decision what framebuffer to create will be done by the FrameBufferFactoryOzone.\n#if !defined(USE_OZONE)\nNO_SANITIZE_FUNCTION sw::FrameBuffer *createFrameBuffer(void *display, Window window, int width, int height)\n{\n\treturn new sw::FrameBufferX11((::Display*)display, window, width, height);\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * opencog\/atoms\/reduct\/ArithmeticLink.cc\n *\n * Copyright (C) 2015 Linas Vepstas\n * 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 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 <limits>\n\n#include <opencog\/atoms\/base\/atom_types.h>\n#include <opencog\/atoms\/base\/ClassServer.h>\n#include <opencog\/atoms\/core\/NumberNode.h>\n#include \"ArithmeticLink.h\"\n\nusing namespace opencog;\n\nArithmeticLink::ArithmeticLink(const HandleSeq& oset, Type t)\n    : FoldLink(oset, t)\n{\n\tinit();\n}\n\nArithmeticLink::ArithmeticLink(Type t, const Handle& a, const Handle& b)\n    : FoldLink(t, a, b)\n{\n\tinit();\n}\n\nArithmeticLink::ArithmeticLink(const Link& l)\n    : FoldLink(l)\n{\n\tinit();\n}\n\nvoid ArithmeticLink::init(void)\n{\n\tType tscope = get_type();\n\tif (not classserver().isA(tscope, ARITHMETIC_LINK))\n\t\tthrow InvalidParamException(TRACE_INFO, \"Expecting a ArithmeticLink\");\n\n\tknild = std::numeric_limits<double>::quiet_NaN();\n}\n\n\/\/ ===========================================================\n\/\/\/ reduce() -- reduce the expression by summing constants, etc.\n\/\/\/\n\/\/\/ No actual black-box evaluation or execution is performed. Only\n\/\/\/ clearbox reductions are performed.\n\/\/\/\n\/\/\/ Examples: the reduct of (PlusLink (NumberNode 2) (NumberNode 2))\n\/\/\/ is (NumberNode 4) -- its just a constant.\n\/\/\/\n\/\/\/ The reduct of (PlusLink (VariableNode \"$x\") (NumberNode 0)) is\n\/\/\/ (VariableNode \"$x\"), because adding zero to anything yeilds the\n\/\/\/ thing itself.\nHandle ArithmeticLink::reduce(void)\n{\n\tHandle road(reorder());\n\tArithmeticLinkPtr alp(ArithmeticLinkCast(road));\n\n\tHandle red(alp->FoldLink::reduce());\n\n\talp = ArithmeticLinkCast(red);\n\tif (NULL == alp) return red;\n\treturn alp->reorder();\n}\n\n\/\/ ============================================================\n\n\/\/\/ re-order the contents of an ArithmeticLink into \"lexicographic\" order.\n\/\/\/\n\/\/\/ The goal of the re-ordering is to simplify the reduction code,\n\/\/\/ by placing atoms where they are easily found.  For now, this\n\/\/\/ means:\n\/\/\/ first, all of the variables,\n\/\/\/ next, all compound expressions,\n\/\/\/ last, all number nodes\n\/\/\/ We do not currently sort the variables, but maybe we should...?\n\/\/\/ Sorting by variable names would hold consilidate them...\n\/\/\/ The FoldLink::reduce() method already returns expressions that are\n\/\/\/ almost in the correct order.\nHandle ArithmeticLink::reorder(void)\n{\n\tHandleSeq vars;\n\tHandleSeq exprs;\n\tHandleSeq numbers;\n\n\tfor (const Handle& h : _outgoing)\n\t{\n\t\tif (h->get_type() == VARIABLE_NODE)\n\t\t\tvars.push_back(h);\n\t\telse if (h->get_type() == NUMBER_NODE)\n\t\t\tnumbers.push_back(h);\n\t\telse\n\t\t\texprs.push_back(h);\n\t}\n\n\tHandleSeq result;\n\tfor (const Handle& h : vars) result.push_back(h);\n\tfor (const Handle& h : exprs) result.push_back(h);\n\tfor (const Handle& h : numbers) result.push_back(h);\n\n\tHandle h(createLink(result, get_type()));\n\tif (NULL == _atom_space) return h;\n\n\treturn _atom_space->add_atom(h);\n}\n\n\/\/ ===========================================================\n\n\/\/\/ execute() -- Execute the expression, returning a number\n\/\/\/\n\/\/\/ Similar to reduce(), above, except that this can only work\n\/\/\/ on fully grounded (closed) sentences: after executation,\n\/\/\/ everything must be a number, and there can be no variables\n\/\/\/ in sight.\nstatic inline double get_double(AtomSpace *as, Handle h)\n{\n\tNumberNodePtr nnn(NumberNodeCast(h));\n\tif (nnn == nullptr)\n\t\tthrow RuntimeException(TRACE_INFO,\n\t\t\t  \"Expecting a NumberNode, got %s\",\n\t\t     classserver().getTypeName(h->get_type()).c_str());\n\n\treturn nnn->get_value();\n}\n\nNumberNodePtr ArithmeticLink::unwrap_set(Handle h) const\n{\n\tFunctionLinkPtr flp(FunctionLinkCast(h));\n\tif (flp) h = flp->execute();\n\n\t\/\/ Pattern matching hack. The pattern matcher returns sets of atoms;\n\t\/\/ if that set contains numbers or something numeric, then unwrap it.\n\tif (SET_LINK == h->get_type())\n\t{\n\t\tif (1 != h->get_arity())\n\t\t\tthrow SyntaxException(TRACE_INFO,\n\t\t\t\t\"Don't know how to do arithmetic with this: %s\",\n\t\t\t\th->to_string().c_str());\n\t\th = h->getOutgoingAtom(0);\n\t}\n\n\tNumberNodePtr na(NumberNodeCast(h));\n\tif (nullptr == na)\n\t\tthrow SyntaxException(TRACE_INFO,\n\t\t\t\"Don't know how to do arithmetic with this: %s\",\n\t\t\th->to_string().c_str());\n\treturn na;\n}\n\nHandle ArithmeticLink::execute(AtomSpace* as) const\n{\n\t\/\/ Pattern matching hack. The pattern matcher returns sets of atoms;\n\t\/\/ if that set contains numbers or something numeric, then unwrap it.\n\tif (1 == _outgoing.size())\n\t{\n\t\tHandle arg = _outgoing[0];\n\t\tFunctionLinkPtr flp(FunctionLinkCast(arg));\n\t\tif (flp) arg = flp->execute(as);\n\n\t\tif (SET_LINK == arg->get_type())\n\t\t{\n\t\t\treturn do_execute(as, arg->getOutgoingSet());\n\t\t}\n\t\tHandleSeq o;\n\t\to.emplace_back(arg);\n\t\treturn do_execute(as, o);\n\t}\n\treturn do_execute(as, _outgoing);\n}\n\nHandle ArithmeticLink::do_execute(AtomSpace* as, const HandleSeq& oset) const\n{\n\tdouble sum = knild;\n\tfor (Handle h: oset)\n\t{\n\t\th = unwrap_set(h);\n\t\tsum = konsd(sum, get_double(as, h));\n\t}\n\n\tif (as) return as->add_atom(createNumberNode(sum));\n\treturn Handle(createNumberNode(sum));\n}\n\n\/\/ ===========================================================\n<commit_msg>Minor ArithmeticLink::execute simplification<commit_after>\/*\n * opencog\/atoms\/reduct\/ArithmeticLink.cc\n *\n * Copyright (C) 2015 Linas Vepstas\n * 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 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 <limits>\n\n#include <opencog\/atoms\/base\/atom_types.h>\n#include <opencog\/atoms\/base\/ClassServer.h>\n#include <opencog\/atoms\/core\/NumberNode.h>\n#include \"ArithmeticLink.h\"\n\nusing namespace opencog;\n\nArithmeticLink::ArithmeticLink(const HandleSeq& oset, Type t)\n    : FoldLink(oset, t)\n{\n\tinit();\n}\n\nArithmeticLink::ArithmeticLink(Type t, const Handle& a, const Handle& b)\n    : FoldLink(t, a, b)\n{\n\tinit();\n}\n\nArithmeticLink::ArithmeticLink(const Link& l)\n    : FoldLink(l)\n{\n\tinit();\n}\n\nvoid ArithmeticLink::init(void)\n{\n\tType tscope = get_type();\n\tif (not classserver().isA(tscope, ARITHMETIC_LINK))\n\t\tthrow InvalidParamException(TRACE_INFO, \"Expecting a ArithmeticLink\");\n\n\tknild = std::numeric_limits<double>::quiet_NaN();\n}\n\n\/\/ ===========================================================\n\/\/\/ reduce() -- reduce the expression by summing constants, etc.\n\/\/\/\n\/\/\/ No actual black-box evaluation or execution is performed. Only\n\/\/\/ clearbox reductions are performed.\n\/\/\/\n\/\/\/ Examples: the reduct of (PlusLink (NumberNode 2) (NumberNode 2))\n\/\/\/ is (NumberNode 4) -- its just a constant.\n\/\/\/\n\/\/\/ The reduct of (PlusLink (VariableNode \"$x\") (NumberNode 0)) is\n\/\/\/ (VariableNode \"$x\"), because adding zero to anything yeilds the\n\/\/\/ thing itself.\nHandle ArithmeticLink::reduce(void)\n{\n\tHandle road(reorder());\n\tArithmeticLinkPtr alp(ArithmeticLinkCast(road));\n\n\tHandle red(alp->FoldLink::reduce());\n\n\talp = ArithmeticLinkCast(red);\n\tif (NULL == alp) return red;\n\treturn alp->reorder();\n}\n\n\/\/ ============================================================\n\n\/\/\/ re-order the contents of an ArithmeticLink into \"lexicographic\" order.\n\/\/\/\n\/\/\/ The goal of the re-ordering is to simplify the reduction code,\n\/\/\/ by placing atoms where they are easily found.  For now, this\n\/\/\/ means:\n\/\/\/ first, all of the variables,\n\/\/\/ next, all compound expressions,\n\/\/\/ last, all number nodes\n\/\/\/ We do not currently sort the variables, but maybe we should...?\n\/\/\/ Sorting by variable names would hold consilidate them...\n\/\/\/ The FoldLink::reduce() method already returns expressions that are\n\/\/\/ almost in the correct order.\nHandle ArithmeticLink::reorder(void)\n{\n\tHandleSeq vars;\n\tHandleSeq exprs;\n\tHandleSeq numbers;\n\n\tfor (const Handle& h : _outgoing)\n\t{\n\t\tif (h->get_type() == VARIABLE_NODE)\n\t\t\tvars.push_back(h);\n\t\telse if (h->get_type() == NUMBER_NODE)\n\t\t\tnumbers.push_back(h);\n\t\telse\n\t\t\texprs.push_back(h);\n\t}\n\n\tHandleSeq result;\n\tfor (const Handle& h : vars) result.push_back(h);\n\tfor (const Handle& h : exprs) result.push_back(h);\n\tfor (const Handle& h : numbers) result.push_back(h);\n\n\tHandle h(createLink(result, get_type()));\n\tif (NULL == _atom_space) return h;\n\n\treturn _atom_space->add_atom(h);\n}\n\n\/\/ ===========================================================\n\n\/\/\/ execute() -- Execute the expression, returning a number\n\/\/\/\n\/\/\/ Similar to reduce(), above, except that this can only work\n\/\/\/ on fully grounded (closed) sentences: after executation,\n\/\/\/ everything must be a number, and there can be no variables\n\/\/\/ in sight.\nstatic inline double get_double(AtomSpace *as, Handle h)\n{\n\tNumberNodePtr nnn(NumberNodeCast(h));\n\tif (nnn == nullptr)\n\t\tthrow RuntimeException(TRACE_INFO,\n\t\t\t  \"Expecting a NumberNode, got %s\",\n\t\t     classserver().getTypeName(h->get_type()).c_str());\n\n\treturn nnn->get_value();\n}\n\nNumberNodePtr ArithmeticLink::unwrap_set(Handle h) const\n{\n\tFunctionLinkPtr flp(FunctionLinkCast(h));\n\tif (flp) h = flp->execute();\n\n\t\/\/ Pattern matching hack. The pattern matcher returns sets of atoms;\n\t\/\/ if that set contains numbers or something numeric, then unwrap it.\n\tif (SET_LINK == h->get_type())\n\t{\n\t\tif (1 != h->get_arity())\n\t\t\tthrow SyntaxException(TRACE_INFO,\n\t\t\t\t\"Don't know how to do arithmetic with this: %s\",\n\t\t\t\th->to_string().c_str());\n\t\th = h->getOutgoingAtom(0);\n\t}\n\n\tNumberNodePtr na(NumberNodeCast(h));\n\tif (nullptr == na)\n\t\tthrow SyntaxException(TRACE_INFO,\n\t\t\t\"Don't know how to do arithmetic with this: %s\",\n\t\t\th->to_string().c_str());\n\treturn na;\n}\n\nHandle ArithmeticLink::execute(AtomSpace* as) const\n{\n\t\/\/ Pattern matching hack. The pattern matcher returns sets of atoms;\n\t\/\/ if that set contains numbers or something numeric, then unwrap it.\n\tif (1 == _outgoing.size())\n\t{\n\t\tHandle arg = _outgoing[0];\n\t\tFunctionLinkPtr flp(FunctionLinkCast(arg));\n\t\tif (flp) arg = flp->execute(as);\n\n\t\tif (SET_LINK == arg->get_type())\n\t\t{\n\t\t\treturn do_execute(as, arg->getOutgoingSet());\n\t\t}\n\t\treturn do_execute(as, {arg});\n\t}\n\treturn do_execute(as, _outgoing);\n}\n\nHandle ArithmeticLink::do_execute(AtomSpace* as, const HandleSeq& oset) const\n{\n\tdouble sum = knild;\n\tfor (Handle h: oset)\n\t{\n\t\th = unwrap_set(h);\n\t\tsum = konsd(sum, get_double(as, h));\n\t}\n\n\tif (as) return as->add_atom(createNumberNode(sum));\n\treturn Handle(createNumberNode(sum));\n}\n\n\/\/ ===========================================================\n<|endoftext|>"}
{"text":"<commit_before>\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n*\/\n\n#include <Onsang\/utility.hpp>\n#include <Onsang\/UI\/Defs.hpp>\n#include <Onsang\/UI\/BasicGrid.hpp>\n#include <Onsang\/App.hpp>\n\n#include <duct\/debug.hpp>\n\nnamespace Onsang {\nnamespace UI {\n\nvoid\nBasicGrid::reflow_impl(\n\tRect const& area,\n\tbool const cache\n) noexcept {\n\tbase::reflow_impl(area, cache);\n\treflow_view(get_geometry().get_frame());\n\tadjust_view();\n\tqueue_header_render();\n\tqueue_cell_render(0, get_row_count());\n\tqueue_actions(\n\t\tUI::UpdateActions::render |\n\t\tUI::UpdateActions::flag_noclear\n\t);\n}\n\nbool\nBasicGrid::handle_event_impl(\n\tUI::Event const& event\n) noexcept {\n\tswitch (event.type) {\n\tcase UI::EventType::key_input:\n\t\tif (!has_input_control()) {\n\t\t\tbool handled = true;\n\t\t\tswitch (event.key_input.code) {\n\t\t\tcase KeyCode::up   : row_step(-1); break;\n\t\t\tcase KeyCode::down : row_step(+1); break;\n\t\t\tcase KeyCode::left : col_step(-1); break;\n\t\t\tcase KeyCode::right: col_step(+1); break;\n\t\t\tcase KeyCode::home: row_abs(0); break;\n\t\t\tcase KeyCode::end : row_abs(max_ce(0, get_row_count() - 1)); break;\n\t\t\tcase KeyCode::pgup:\n\t\t\t\trow_step(min_ce(0, -get_view().fit_count - 1)); break;\n\t\t\tcase KeyCode::pgdn:\n\t\t\t\trow_step(max_ce(0, +get_view().fit_count - 1)); break;\n\n\t\t\tdefault:\n\t\t\t\tswitch (event.key_input.cp) {\n\t\t\t\tcase 'k': row_step(-1); break;\n\t\t\t\tcase 'j': row_step(+1); break;\n\t\t\t\tcase 'h': col_step(-1); break;\n\t\t\t\tcase 'l': col_step(+1); break;\n\t\t\t\tcase 'a': select_all(); break;\n\t\t\t\tcase 'A': select_none(); break;\n\t\t\t\tcase 's': select_toggle(m_cursor.row, 1); break;\n\t\t\t\t\/\/case 'e': erase(m_cursor.row, 1); break;\n\t\t\t\t\/\/case 'E': erase_selected(); break;\n\t\t\t\t\/\/case 'i': insert_after (m_cursor.row, 1); break;\n\t\t\t\t\/\/case 'I': insert_before(m_cursor.row, 1); break;\n\t\t\t\tdefault:\n\t\t\t\t\thandled = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn handled;\n\t\t}\n\t\tbreak;\n\n\tcase UI::EventType::focus_changed:\n\t\tqueue_cell_render(\n\t\t\tm_cursor.row, m_cursor.row + 1,\n\t\t\tm_cursor.col, m_cursor.col + 1\n\t\t);\n\t\tif (is_focused()) {\n\t\t\tApp::instance.m_ui.csline->set_location(\n\t\t\t\tstd::to_string(m_cursor.row) + \", \" +\n\t\t\t\tstd::to_string(m_cursor.col)\n\t\t\t);\n\t\t} else {\n\t\t\tApp::instance.m_ui.csline->clear_location();\n\t\t}\n\t\treturn false;\n\n\tdefault:\n\t\tbreak;\n\t}\n\treturn false;\n}\n\nvoid\nBasicGrid::render_impl(\n\tUI::Widget::RenderData& rd\n) noexcept {\n\tUI::GridRenderData grid_rd{\n\t\trd,\n\t\tis_focused(),\n\t\tis_focused()\n\t};\n\trender_view(\n\t\tgrid_rd,\n\t\t!enum_cast(get_queued_actions() & UI::UpdateActions::flag_noclear)\n\t);\n\n\tauto const& view = get_view();\n\tRect const empty_frame{\n\t\t{view.content_frame.pos.x, view.content_frame.pos.y + view.row_count},\n\t\t{\n\t\t\tview.content_frame.size.width,\n\t\t\tmax_ce(0, view.fit_count - view.row_count)\n\t\t}\n\t};\n\tif (0 < empty_frame.size.height) {\n\t\tgrid_rd.rd.terminal.clear_back(empty_frame);\n\t\tgrid_rd.rd.terminal.put_line(\n\t\t\tempty_frame.pos,\n\t\t\tempty_frame.size.height,\n\t\t\tAxis::vertical,\n\t\t\ttty::make_cell('~',\n\t\t\t\ttty::Color::blue | tty::Attr::bold,\n\t\t\t\ttty::Color::term_default\n\t\t\t)\n\t\t);\n\t}\n}\n\nvoid\nBasicGrid::content_action(\n\tUI::ProtoGrid::ContentAction action,\n\tUI::index_type row_begin,\n\tUI::index_type count\n) noexcept {\n\tusing CA = UI::ProtoGrid::ContentAction;\n\n\tDUCT_ASSERTE(get_row_count() == signed_cast(m_sel.size()));\n\t\/\/ Cast insert_after in terms of insert_before\n\tif (CA::insert_after == action) {\n\t\t++row_begin;\n\t}\n\trow_begin = value_clamp(row_begin, 0, get_row_count());\n\tauto const row_end = min_ce(row_begin + count, get_row_count());\n\tauto clear_flag = UI::UpdateActions::none;\n\tswitch (action) {\n\t\/\/ Select\n\tcase CA::select: \/\/ fall-through\n\tcase CA::unselect: {\n\t\tbool const enable = CA::select == action;\n\t\tauto const end = m_sel.begin() + row_end;\n\t\tfor (auto it = m_sel.begin() + row_begin; end > it; ++it) {\n\t\t\t*it = enable;\n\t\t}\n\t\tqueue_cell_render(row_begin, row_end);\n\t\tclear_flag = UI::UpdateActions::flag_noclear;\n\t}\tbreak;\n\n\tcase CA::select_toggle: {\n\t\tauto const end = m_sel.begin() + row_end;\n\t\tfor (auto it = m_sel.begin() + row_begin; end > it; ++it) {\n\t\t\t*it = !*it;\n\t\t}\n\t\tqueue_cell_render(row_begin, row_end);\n\t\tclear_flag = UI::UpdateActions::flag_noclear;\n\t}\tbreak;\n\n\t\/\/ Insert\n\tcase CA::insert_after: \/\/ fall-through\n\tcase CA::insert_before:\n\t\tfor (UI::index_type i = 0; i < count; ++i) {\n\t\t\tif (content_insert(row_begin + i)) {\n\t\t\t\tm_sel.insert(m_sel.begin() + row_begin + i, false);\n\t\t\t\tcontent_action_internal(CA::insert_before, row_begin + i, 1);\n\t\t\t}\n\t\t}\n\t\tif (get_row_count() == 1) {\n\t\t\tset_cursor(m_cursor.col, 0);\n\t\t} else if (row_begin <= m_cursor.row) {\n\t\t\tset_cursor(m_cursor.col, m_cursor.row + count);\n\t\t}\n\t\tadjust_view();\n\t\tbreak;\n\n\t\/\/ Erase\n\tcase CA::erase:\n\t\tfor (UI::index_type i = 0; i < count; ++i) {\n\t\t\tif (content_erase(row_begin)) {\n\t\t\t\tm_sel.erase(m_sel.cbegin() + row_begin);\n\t\t\t\tcontent_action_internal(CA::erase, row_begin, 1);\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\tcase CA::erase_selected:\n\t\tfor (UI::index_type index = 0; index < get_row_count();) {\n\t\t\tif (m_sel[index] && content_erase(index)) {\n\t\t\t\tm_sel.erase(m_sel.cbegin() + index);\n\t\t\t\tcontent_action_internal(CA::erase, index, 1);\n\t\t\t} else {\n\t\t\t\t++index;\n\t\t\t}\n\t\t}\n\t\tbreak;\n\t} \/\/ switch (action)\n\n\t\/\/ Post action\n\tswitch (action) {\n\tcase CA::erase:\n\tcase CA::erase_selected:\n\t\t\/\/ Let cursor clamp to new bounds\n\t\tset_cursor(m_cursor.col, m_cursor.row);\n\t\tadjust_view();\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n\tqueue_actions(\n\t\tUI::UpdateActions::render |\n\t\tclear_flag\n\t);\n}\n\nvoid\nBasicGrid::adjust_view() noexcept {\n\tauto const& view = get_view();\n\tif (\n\t\tview.row_range.x >  m_cursor.row ||\n\t\tview.row_range.y <= m_cursor.row ||\n\t\tview.col_range.x >  m_cursor.col ||\n\t\tview.col_range.y <= m_cursor.col\n\t) {\n\t\tauto row_begin = m_cursor.row;\n\t\tif (view.row_range.y <= m_cursor.row) {\n\t\t\trow_begin -= view.fit_count - 1;\n\t\t}\n\t\tupdate_view(\n\t\t\trow_begin,\n\t\t\trow_begin + view.fit_count,\n\t\t\t0,\n\t\t\tget_col_count(),\n\t\t\ttrue\n\t\t);\n\t\tqueue_actions(UI::UpdateActions::render);\n\t}\n}\n\nvoid\nBasicGrid::set_cursor(\n\tUI::index_type col,\n\tUI::index_type row\n) noexcept {\n\tcol = value_clamp(col, 0, max_ce(0, get_col_count() - 1));\n\trow = value_clamp(row, 0, max_ce(0, get_row_count() - 1));\n\tif (col != m_cursor.col || row != m_cursor.row) {\n\t\tif (\n\t\t\tvalue_in_bounds(m_cursor.row, 0, get_row_count()) &&\n\t\t\tvalue_in_bounds(m_cursor.col, 0, get_col_count())\n\t\t) {\n\t\t\tqueue_cell_render(\n\t\t\t\tm_cursor.row, m_cursor.row + 1,\n\t\t\t\tm_cursor.col, m_cursor.col + 1\n\t\t\t);\n\t\t}\n\t\tif (get_row_count() > 0) {\n\t\t\tqueue_cell_render(\n\t\t\t\trow, row + 1,\n\t\t\t\tcol, col + 1\n\t\t\t);\n\t\t}\n\t\tqueue_actions(\n\t\t\tUI::UpdateActions::render |\n\t\t\tUI::UpdateActions::flag_noclear\n\t\t);\n\t\tm_cursor.col = col;\n\t\tm_cursor.row = row;\n\t\tadjust_view();\n\t\tif (is_focused()) {\n\t\t\tApp::instance.m_ui.csline->set_location(\n\t\t\t\tstd::to_string(m_cursor.row) + \", \" +\n\t\t\t\tstd::to_string(m_cursor.col)\n\t\t\t);\n\t\t}\n\t}\n}\n\nvoid\nBasicGrid::resize_grid(\n\tUI::index_type col_count,\n\tUI::index_type row_count\n) {\n\tm_sel.resize(row_count);\n\tset_row_count(row_count);\n\tset_col_count(col_count);\n\tset_cursor(m_cursor.col, m_cursor.row);\n\tadjust_view();\n\tqueue_actions(\n\t\tUI::UpdateActions::render\n\t);\n}\n\n} \/\/ namespace UI\n} \/\/ namespace Onsang\n<commit_msg>UI\/BasicGrid: update view and queue full grid render in resize_grid().<commit_after>\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n*\/\n\n#include <Onsang\/utility.hpp>\n#include <Onsang\/UI\/Defs.hpp>\n#include <Onsang\/UI\/BasicGrid.hpp>\n#include <Onsang\/App.hpp>\n\n#include <duct\/debug.hpp>\n\nnamespace Onsang {\nnamespace UI {\n\nvoid\nBasicGrid::reflow_impl(\n\tRect const& area,\n\tbool const cache\n) noexcept {\n\tbase::reflow_impl(area, cache);\n\treflow_view(get_geometry().get_frame());\n\tadjust_view();\n\tqueue_header_render();\n\tqueue_cell_render(0, get_row_count());\n\tqueue_actions(\n\t\tUI::UpdateActions::render |\n\t\tUI::UpdateActions::flag_noclear\n\t);\n}\n\nbool\nBasicGrid::handle_event_impl(\n\tUI::Event const& event\n) noexcept {\n\tswitch (event.type) {\n\tcase UI::EventType::key_input:\n\t\tif (!has_input_control()) {\n\t\t\tbool handled = true;\n\t\t\tswitch (event.key_input.code) {\n\t\t\tcase KeyCode::up   : row_step(-1); break;\n\t\t\tcase KeyCode::down : row_step(+1); break;\n\t\t\tcase KeyCode::left : col_step(-1); break;\n\t\t\tcase KeyCode::right: col_step(+1); break;\n\t\t\tcase KeyCode::home: row_abs(0); break;\n\t\t\tcase KeyCode::end : row_abs(max_ce(0, get_row_count() - 1)); break;\n\t\t\tcase KeyCode::pgup:\n\t\t\t\trow_step(min_ce(0, -get_view().fit_count - 1)); break;\n\t\t\tcase KeyCode::pgdn:\n\t\t\t\trow_step(max_ce(0, +get_view().fit_count - 1)); break;\n\n\t\t\tdefault:\n\t\t\t\tswitch (event.key_input.cp) {\n\t\t\t\tcase 'k': row_step(-1); break;\n\t\t\t\tcase 'j': row_step(+1); break;\n\t\t\t\tcase 'h': col_step(-1); break;\n\t\t\t\tcase 'l': col_step(+1); break;\n\t\t\t\tcase 'a': select_all(); break;\n\t\t\t\tcase 'A': select_none(); break;\n\t\t\t\tcase 's': select_toggle(m_cursor.row, 1); break;\n\t\t\t\t\/\/case 'e': erase(m_cursor.row, 1); break;\n\t\t\t\t\/\/case 'E': erase_selected(); break;\n\t\t\t\t\/\/case 'i': insert_after (m_cursor.row, 1); break;\n\t\t\t\t\/\/case 'I': insert_before(m_cursor.row, 1); break;\n\t\t\t\tdefault:\n\t\t\t\t\thandled = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn handled;\n\t\t}\n\t\tbreak;\n\n\tcase UI::EventType::focus_changed:\n\t\tqueue_cell_render(\n\t\t\tm_cursor.row, m_cursor.row + 1,\n\t\t\tm_cursor.col, m_cursor.col + 1\n\t\t);\n\t\tif (is_focused()) {\n\t\t\tApp::instance.m_ui.csline->set_location(\n\t\t\t\tstd::to_string(m_cursor.row) + \", \" +\n\t\t\t\tstd::to_string(m_cursor.col)\n\t\t\t);\n\t\t} else {\n\t\t\tApp::instance.m_ui.csline->clear_location();\n\t\t}\n\t\treturn false;\n\n\tdefault:\n\t\tbreak;\n\t}\n\treturn false;\n}\n\nvoid\nBasicGrid::render_impl(\n\tUI::Widget::RenderData& rd\n) noexcept {\n\tUI::GridRenderData grid_rd{\n\t\trd,\n\t\tis_focused(),\n\t\tis_focused()\n\t};\n\trender_view(\n\t\tgrid_rd,\n\t\t!enum_cast(get_queued_actions() & UI::UpdateActions::flag_noclear)\n\t);\n\n\tauto const& view = get_view();\n\tRect const empty_frame{\n\t\t{view.content_frame.pos.x, view.content_frame.pos.y + view.row_count},\n\t\t{\n\t\t\tview.content_frame.size.width,\n\t\t\tmax_ce(0, view.fit_count - view.row_count)\n\t\t}\n\t};\n\tif (0 < empty_frame.size.height) {\n\t\tgrid_rd.rd.terminal.clear_back(empty_frame);\n\t\tgrid_rd.rd.terminal.put_line(\n\t\t\tempty_frame.pos,\n\t\t\tempty_frame.size.height,\n\t\t\tAxis::vertical,\n\t\t\ttty::make_cell('~',\n\t\t\t\ttty::Color::blue | tty::Attr::bold,\n\t\t\t\ttty::Color::term_default\n\t\t\t)\n\t\t);\n\t}\n}\n\nvoid\nBasicGrid::content_action(\n\tUI::ProtoGrid::ContentAction action,\n\tUI::index_type row_begin,\n\tUI::index_type count\n) noexcept {\n\tusing CA = UI::ProtoGrid::ContentAction;\n\n\tDUCT_ASSERTE(get_row_count() == signed_cast(m_sel.size()));\n\t\/\/ Cast insert_after in terms of insert_before\n\tif (CA::insert_after == action) {\n\t\t++row_begin;\n\t}\n\trow_begin = value_clamp(row_begin, 0, get_row_count());\n\tauto const row_end = min_ce(row_begin + count, get_row_count());\n\tauto clear_flag = UI::UpdateActions::none;\n\tswitch (action) {\n\t\/\/ Select\n\tcase CA::select: \/\/ fall-through\n\tcase CA::unselect: {\n\t\tbool const enable = CA::select == action;\n\t\tauto const end = m_sel.begin() + row_end;\n\t\tfor (auto it = m_sel.begin() + row_begin; end > it; ++it) {\n\t\t\t*it = enable;\n\t\t}\n\t\tqueue_cell_render(row_begin, row_end);\n\t\tclear_flag = UI::UpdateActions::flag_noclear;\n\t}\tbreak;\n\n\tcase CA::select_toggle: {\n\t\tauto const end = m_sel.begin() + row_end;\n\t\tfor (auto it = m_sel.begin() + row_begin; end > it; ++it) {\n\t\t\t*it = !*it;\n\t\t}\n\t\tqueue_cell_render(row_begin, row_end);\n\t\tclear_flag = UI::UpdateActions::flag_noclear;\n\t}\tbreak;\n\n\t\/\/ Insert\n\tcase CA::insert_after: \/\/ fall-through\n\tcase CA::insert_before:\n\t\tfor (UI::index_type i = 0; i < count; ++i) {\n\t\t\tif (content_insert(row_begin + i)) {\n\t\t\t\tm_sel.insert(m_sel.begin() + row_begin + i, false);\n\t\t\t\tcontent_action_internal(CA::insert_before, row_begin + i, 1);\n\t\t\t}\n\t\t}\n\t\tif (get_row_count() == 1) {\n\t\t\tset_cursor(m_cursor.col, 0);\n\t\t} else if (row_begin <= m_cursor.row) {\n\t\t\tset_cursor(m_cursor.col, m_cursor.row + count);\n\t\t}\n\t\tadjust_view();\n\t\tbreak;\n\n\t\/\/ Erase\n\tcase CA::erase:\n\t\tfor (UI::index_type i = 0; i < count; ++i) {\n\t\t\tif (content_erase(row_begin)) {\n\t\t\t\tm_sel.erase(m_sel.cbegin() + row_begin);\n\t\t\t\tcontent_action_internal(CA::erase, row_begin, 1);\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\tcase CA::erase_selected:\n\t\tfor (UI::index_type index = 0; index < get_row_count();) {\n\t\t\tif (m_sel[index] && content_erase(index)) {\n\t\t\t\tm_sel.erase(m_sel.cbegin() + index);\n\t\t\t\tcontent_action_internal(CA::erase, index, 1);\n\t\t\t} else {\n\t\t\t\t++index;\n\t\t\t}\n\t\t}\n\t\tbreak;\n\t} \/\/ switch (action)\n\n\t\/\/ Post action\n\tswitch (action) {\n\tcase CA::erase:\n\tcase CA::erase_selected:\n\t\t\/\/ Let cursor clamp to new bounds\n\t\tset_cursor(m_cursor.col, m_cursor.row);\n\t\tadjust_view();\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n\tqueue_actions(\n\t\tUI::UpdateActions::render |\n\t\tclear_flag\n\t);\n}\n\nvoid\nBasicGrid::adjust_view() noexcept {\n\tauto const& view = get_view();\n\tif (\n\t\tview.row_range.x >  m_cursor.row ||\n\t\tview.row_range.y <= m_cursor.row ||\n\t\tview.col_range.x >  m_cursor.col ||\n\t\tview.col_range.y <= m_cursor.col\n\t) {\n\t\tauto row_begin = m_cursor.row;\n\t\tif (view.row_range.y <= m_cursor.row) {\n\t\t\trow_begin -= view.fit_count - 1;\n\t\t}\n\t\tupdate_view(\n\t\t\trow_begin,\n\t\t\trow_begin + view.fit_count,\n\t\t\t0,\n\t\t\tget_col_count(),\n\t\t\ttrue\n\t\t);\n\t\tqueue_actions(UI::UpdateActions::render);\n\t}\n}\n\nvoid\nBasicGrid::set_cursor(\n\tUI::index_type col,\n\tUI::index_type row\n) noexcept {\n\tcol = value_clamp(col, 0, max_ce(0, get_col_count() - 1));\n\trow = value_clamp(row, 0, max_ce(0, get_row_count() - 1));\n\tif (col != m_cursor.col || row != m_cursor.row) {\n\t\tif (\n\t\t\tvalue_in_bounds(m_cursor.row, 0, get_row_count()) &&\n\t\t\tvalue_in_bounds(m_cursor.col, 0, get_col_count())\n\t\t) {\n\t\t\tqueue_cell_render(\n\t\t\t\tm_cursor.row, m_cursor.row + 1,\n\t\t\t\tm_cursor.col, m_cursor.col + 1\n\t\t\t);\n\t\t}\n\t\tif (get_row_count() > 0) {\n\t\t\tqueue_cell_render(\n\t\t\t\trow, row + 1,\n\t\t\t\tcol, col + 1\n\t\t\t);\n\t\t}\n\t\tqueue_actions(\n\t\t\tUI::UpdateActions::render |\n\t\t\tUI::UpdateActions::flag_noclear\n\t\t);\n\t\tm_cursor.col = col;\n\t\tm_cursor.row = row;\n\t\tadjust_view();\n\t\tif (is_focused()) {\n\t\t\tApp::instance.m_ui.csline->set_location(\n\t\t\t\tstd::to_string(m_cursor.row) + \", \" +\n\t\t\t\tstd::to_string(m_cursor.col)\n\t\t\t);\n\t\t}\n\t}\n}\n\nvoid\nBasicGrid::resize_grid(\n\tUI::index_type col_count,\n\tUI::index_type row_count\n) {\n\tm_sel.resize(row_count);\n\tset_row_count(row_count);\n\tset_col_count(col_count);\n\tset_cursor(0, 0);\n\tupdate_view(\n\t\t0, get_view().fit_count,\n\t\t0, get_col_count(),\n\t\tfalse\n\t);\n\tqueue_header_render();\n\tqueue_cell_render(0, get_row_count());\n\tqueue_actions(\n\t\tUI::UpdateActions::render\n\t);\n}\n\n} \/\/ namespace UI\n} \/\/ namespace Onsang\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nsl_exchange5.cc\n\n3 spin simulation with exchange in Hilbert space\n\n*\/\n\n#include \"gamma.h\"\n\/\/#include <sys\/time.h>\n\/\/#include <sys\/resource.h>\n\n#define NPROP 1000\n#define MAXSPINS 3\n\nusing namespace std;\n\nint main(int argc, char *argv[])\n\n{\n  sys_dynamic ax;\n  gen_op Hrf,Ham, H[5], sigma, sigma1, detect[MAXSPINS];\n  super_op Iop,K,L,U[NPROP],UT;\n  spin_T  Hdip[MAXSPINS][MAXSPINS];\n  space_T Adip[MAXSPINS][MAXSPINS], Adip_R[MAXSPINS][MAXSPINS];\n  double D[MAXSPINS][MAXSPINS];\n  double iso_CSA[MAXSPINS];\n  int i,j,k,k1,k2,Fnp,count,qu,steps,nrotor;\n  string name, names;\n  const double thetam=54.73561032;\n  double mas_freq,gamB1;\n  double ltime, time, time_prop, scale;\n  int nstart, nspins, index, nprop;\n  double alpha,beta,gamma;\n  double alpha_D[MAXSPINS][MAXSPINS],beta_D[MAXSPINS][MAXSPINS];\n  double gamma_D[MAXSPINS][MAXSPINS];\n  double tauc, kex;\n  \/\/struct rusage me;\n  \/\/struct timeval tp;\n\n\n  int value1[] = {1, 50, 100, 144, 200, 300, 538, 1154};\n  int value2[] = {1,  7,  27,  11,  29,  37,  55,  107};\n  int value3[] = {1, 11,  41,  53,  79,  61, 229,  271};\n\n\/*initialize the random number generator*\/\n  \/\/gettimeofday(&tp,NULL);\n  \/\/srand48(tp.tv_usec);\n  enable_blockdiag();\n\n  count = 1;\n  query_parameter(argc,argv,count++,\"Spin System Name            ? \", names);\n\/\/setup for the spin system\n  ax.read(names);\n  nspins = ax.spins();\n  if(nspins != 3)\n  { cerr << \"This program is written for a MAXSPINS spin system.\\n\";\n    cerr << \"Please change your spin system definition in \\n\";\n    cerr << \"the file \" << names << \".\\n\";\n    cerr << \"Aborting ....\\n\\n\";\n    exit(-1);\n  }\n  for(i=0;i<2;++i)\n  { for(j=i+1;j<3;++j)\n    { query_parameter(argc,argv,count++,\"Dipolar Coupling Constant   ? \", D[i][j]);\n      query_parameter(argc,argv,count++,\"Euler angle alpha           ? \", alpha_D[i][j]);\n      query_parameter(argc,argv,count++,\"Euler angle beta            ? \", beta_D[i][j]);\n      query_parameter(argc,argv,count++,\"Euler angle gamma           ? \", gamma_D[i][j]);\n    }\n  }\n  for(i=0;i<3;++i)\n  { query_parameter(argc,argv,count++,\"Isotropic chemical shift    ? \", iso_CSA[i]);\n  }\n  query_parameter(argc,argv,count++,\"Powder Quality (cheng)      ? \", qu);\n  query_parameter(argc,argv,count++,\"Number of time steps        ? \", steps);\n  query_parameter(argc,argv,count++,\"spinning speed              ? \", mas_freq);\n  query_parameter(argc,argv,count++,\"Number of rotor periods     ? \", nrotor);\n  query_parameter(argc,argv,count++,\"Number of sampling per rotor? \", nprop);\n  query_parameter(argc,argv,count++,\"Initial density operator    ? \", nstart);\n  query_parameter(argc,argv,count++,\"jump correlation time       ? \", tauc);\n  query_parameter(argc,argv,count++,\"rf-field amplitude          ? \", gamB1);\n  query_parameter(argc,argv,count++,\"Output Filename             ? \", name);\n\n  if(nstart >= nspins)\n  { cerr << \"The starting density operator has a spin number which is\\n\";\n    cerr << \"larger than the number of spins.\\n\";\n    cerr << \"Aborting ....\\n\\n\";\n    exit(-1);\n  }\n\n  Fnp = nprop*nrotor;\n\n  time_prop  = (1.0\/mas_freq)\/nprop;\n  time       = (1.0\/mas_freq)\/steps;\n  kex        =1.0\/(2.0*tauc);\n\n  cout << \"\\n\\nSimulation of isotropic chemical shift by dipolar coupling\\n\";\n  cout << \"==========================================================\\n\\n\";\n  cout << \"Parameters:\\n\";\n  cout << \"rotation angle thetam          : \" << thetam << \" Degree\\n\";\n  cout << \"size of spin system            : \" << nspins << \" spins\\n\";\n  cout << \"initial density operator       : Ix(ax,\" << nstart << \")\\n\"; \n  for(i=0;i<2;++i)\n  { for(j=i+1;j<3;++j)\n    { cout << \"dipolar coupling constant (\" << i << \",\" << j << \") : \" <<\n              D[i][j] << \" Hz\\n\";\n      cout << \"relativ orientation of D tensor: (\" << alpha_D[i][j] << \",\" <<\n               beta_D[i][j] << \",\" << gamma_D[i][j] << \")\\n\";\n    }\n  }\n  for(i=0;i<3;++i)\n  { cout << \"isotropic chemical shift (\" << i << \") : \" << iso_CSA[i] << \" Hz\\n\";\n  }\n  cout << \"# of sampling points:          \" << nprop << \"\\n\";\n  cout << \"# of rotor periods:            \" << nrotor << \"\\n\";\n  cout << \"Powder Quality Number:         \" << qu << \"  (\" << value1[qu] <<\n          \" orientations)\\n\";\n  cout << \"Number of data points:         \" << Fnp << \" points\\n\";\n  cout << \"MAS frequency:                 \" << mas_freq << \" Hz\\n\";\n\n\tchar timex[100];\n#ifdef _MSC_VER\n\tsprintf_s ( timex, \"%.6f\", time);\n#else\n\tsprintf ( timex, \"%.12f\", time);\n#endif\n\n  cout << \"time increments:               \" << timex << \"s\\n\";\n\n\tchar tprop[100];\n#ifdef _MSC_VER\n\tsprintf_s ( tprop, \"%.5f\", time_prop);\n#else\n\tsprintf ( tprop, \"%.10f\", time_prop);\n#endif\n\n  cout << \"dwell time:                    \" << tprop << \"s\\n\";\n  cout << \"jump rate constant             \" << kex << \" s-1\\n\";\n  cout << \"correlation time               \" << tauc << \" s\\n\";\n  cout << \"rf-field amplitude:            \" << gamB1 << \" Hz\\n\";\n  cout << \"Output filename:               \" << name << \"\\n\";\n  cout << \"\\n\";\n  cout.flush();\n\n  ax.Kex(kex,0);\n  matrix mx(ax.HS()*ax.HS(), ax.HS()*ax.HS(), i_matrix_type); \/\/ ExpLOp is the identity superop\n  Iop = super_op(mx);\n\n  block_2D data(nspins,Fnp);\n  for(k1=0;k1<nspins;++k1)\n  { for(k2=0;k2<Fnp;++k2)\n    { data(k1,k2) = 0;\n    }\n  }\n\n\/\/setup for the hamiltonian\n  for(i=0;i<nspins-1;++i)\n  { for(j=i+1;j<nspins;++j)\n    { Hdip[i][j] = T_D(ax,i,j);\n    }\n  }\n\n\/\/setup for the space tensor\n  matrix help(3,3,0);\n  for(i=0;i<2;++i)\n  { for(j=i+1;j<3;++j)\n    { help.put_h(-1.0\/2.0,0,0);\n      help.put_h(-1.0\/2.0,1,1);\n      help.put_h( 1.0,2,2);\n      help   = - (complex) D[i][j] * help;\n      Adip[i][j] = A2(help);\n      Adip[i][j] = Adip[i][j].rotate(alpha_D[i][j],beta_D[i][j],gamma_D[i][j]);\n    }\n  }\n\n\n  string name1 = name+\".mat\";\n  string name2 = name;\n\n\/\/here starts the powder loop\n\/\/reference JCP 59 (8), 3992 (1973).\n\n  for(count=1; count<=value1[qu]; ++count)\n  { beta  = 180.0 * count\/value1[qu];\n    alpha = 360.0 * ((value2[qu]*count) % value1[qu])\/value1[qu];\n    gamma = 360.0 * ((value3[qu]*count) % value1[qu])\/value1[qu];\n    if(count % 10 == 1)\n    { \/\/getrusage(0, & me);\n      cout << count << \"\\tbeta = \" << beta << \"\\talpha = \"\n           << alpha << \"\\tgamma = \" << gamma << \"\\n\";\n      cout.flush();\n    }\n    scale = sin(beta\/180.0*PI);\n    sigma = iso_CSA[nstart]\/sqrt(iso_CSA[nstart]*iso_CSA[nstart]+gamB1*gamB1)*Iz(ax,nstart) +\n            gamB1\/sqrt(iso_CSA[nstart]*iso_CSA[nstart]+gamB1*gamB1)*Ix(ax,nstart);\n    for(k=0;k<nspins;++k)\n    { detect[k] = Ix(ax,k);\n    }\n  \n\/\/now we rotate the space tensor\n    for(i=0;i<2;++i)\n    { for(j=i+1;j<3;++j)\n      { Adip_R[i][j] = Adip[i][j].rotate(alpha,beta,gamma);\n      }\n    }\n\n\/\/zero all components\n    for(i=0;i<5;++i)\n      H[i] = gen_op();\n\n\/\/this is the dipolar part\n    for(i=0;i<nspins;++i)\n      H[2] += iso_CSA[i]*Iz(ax,i);\n    for(i=0;i<2;++i)\n    { for(j=i+1;j<3;++j)\n      { for(k=-2;k<=2;++k)\n        { H[k+2] += Adip_R[i][j].component(2,k) * d2(k,0,thetam) * Hdip[i][j].component(2,0);\n        }\n      }\n    }\n    for(i=0;i<nprop;++i)\n      U[i] = Iop;\n\n\/\/now we calculate the propagator over one cycle of the MAS\n    for(ltime=0.5*time;ltime<=steps*time;ltime += time)\n    { index = int(ltime\/time_prop);\n      Ham = gamB1*Fx(ax,\"1H\");\n      for(i=-2;i<=2;++i)\n        Ham += exp(complex(0,i*2.0*PI*ltime*mas_freq)) * H[i+2];\n      L = complex(0,2.0*PI)*commutator(Ham);\n\/\/    cout << \"\\nHam = \\n\";\n\/\/    cout << Ham;\n\/\/    cout << \"\\nL = \\n\";\n\/\/    cout << L;\n      K = Kex(ax, Ham.get_basis());\n\/\/    cout << \"\\nK = \\n\";\n\/\/    cout << K;\n\/\/    cout.flush();\n      L += K;\n      UT = exp(L,-time);\n      UT.set_HBR();\n      U[index] = UT*U[index];\n    }\n    for(i=0;i<nprop;++i)\n      U[i].set_DBR();\n    sigma.set_DBR();\n    for(i=0;i<Fnp;++i)\n    { for(j=0;j<nspins;++j)\n      { data(j,i) += proj(sigma,detect[j])*scale;\n      }\n      sigma=U[i%nprop]*sigma;\n    }\n  } \/\/ end of powder loop\n  MATLAB(name1,name2,data,1);\n  exit(0);\n}\n<commit_msg>Fixed small \"oversight\" in changing code on windows.<commit_after>\/*\n\nsl_exchange5.cc\n\n3 spin simulation with exchange in Hilbert space\n\n*\/\n\n#include \"gamma.h\"\n\/\/#include <sys\/time.h>\n\/\/#include <sys\/resource.h>\n\n#define NPROP 1000\n#define MAXSPINS 3\n\nusing namespace std;\n\nint main(int argc, char *argv[])\n\n{\n  sys_dynamic ax;\n  gen_op Hrf,Ham, H[5], sigma, sigma1, detect[MAXSPINS];\n  super_op Iop,K,L,U[NPROP],UT;\n  spin_T  Hdip[MAXSPINS][MAXSPINS];\n  space_T Adip[MAXSPINS][MAXSPINS], Adip_R[MAXSPINS][MAXSPINS];\n  double D[MAXSPINS][MAXSPINS];\n  double iso_CSA[MAXSPINS];\n  int i,j,k,k1,k2,Fnp,count,qu,steps,nrotor;\n  string name, names;\n  const double thetam=54.73561032;\n  double mas_freq,gamB1;\n  double ltime, time, time_prop, scale;\n  int nstart, nspins, index, nprop;\n  double alpha,beta,gamma;\n  double alpha_D[MAXSPINS][MAXSPINS],beta_D[MAXSPINS][MAXSPINS];\n  double gamma_D[MAXSPINS][MAXSPINS];\n  double tauc, kex;\n  \/\/struct rusage me;\n  \/\/struct timeval tp;\n\n\n  int value1[] = {1, 50, 100, 144, 200, 300, 538, 1154};\n  int value2[] = {1,  7,  27,  11,  29,  37,  55,  107};\n  int value3[] = {1, 11,  41,  53,  79,  61, 229,  271};\n\n\/*initialize the random number generator*\/\n  \/\/gettimeofday(&tp,NULL);\n  \/\/srand48(tp.tv_usec);\n  enable_blockdiag();\n\n  count = 1;\n  query_parameter(argc,argv,count++,\"Spin System Name            ? \", names);\n\/\/setup for the spin system\n  ax.read(names);\n  nspins = ax.spins();\n  if(nspins != 3)\n  { cerr << \"This program is written for a MAXSPINS spin system.\\n\";\n    cerr << \"Please change your spin system definition in \\n\";\n    cerr << \"the file \" << names << \".\\n\";\n    cerr << \"Aborting ....\\n\\n\";\n    exit(-1);\n  }\n  for(i=0;i<2;++i)\n  { for(j=i+1;j<3;++j)\n    { query_parameter(argc,argv,count++,\"Dipolar Coupling Constant   ? \", D[i][j]);\n      query_parameter(argc,argv,count++,\"Euler angle alpha           ? \", alpha_D[i][j]);\n      query_parameter(argc,argv,count++,\"Euler angle beta            ? \", beta_D[i][j]);\n      query_parameter(argc,argv,count++,\"Euler angle gamma           ? \", gamma_D[i][j]);\n    }\n  }\n  for(i=0;i<3;++i)\n  { query_parameter(argc,argv,count++,\"Isotropic chemical shift    ? \", iso_CSA[i]);\n  }\n  query_parameter(argc,argv,count++,\"Powder Quality (cheng)      ? \", qu);\n  query_parameter(argc,argv,count++,\"Number of time steps        ? \", steps);\n  query_parameter(argc,argv,count++,\"spinning speed              ? \", mas_freq);\n  query_parameter(argc,argv,count++,\"Number of rotor periods     ? \", nrotor);\n  query_parameter(argc,argv,count++,\"Number of sampling per rotor? \", nprop);\n  query_parameter(argc,argv,count++,\"Initial density operator    ? \", nstart);\n  query_parameter(argc,argv,count++,\"jump correlation time       ? \", tauc);\n  query_parameter(argc,argv,count++,\"rf-field amplitude          ? \", gamB1);\n  query_parameter(argc,argv,count++,\"Output Filename             ? \", name);\n\n  if(nstart >= nspins)\n  { cerr << \"The starting density operator has a spin number which is\\n\";\n    cerr << \"larger than the number of spins.\\n\";\n    cerr << \"Aborting ....\\n\\n\";\n    exit(-1);\n  }\n\n  Fnp = nprop*nrotor;\n\n  time_prop  = (1.0\/mas_freq)\/nprop;\n  time       = (1.0\/mas_freq)\/steps;\n  kex        =1.0\/(2.0*tauc);\n\n  cout << \"\\n\\nSimulation of isotropic chemical shift by dipolar coupling\\n\";\n  cout << \"==========================================================\\n\\n\";\n  cout << \"Parameters:\\n\";\n  cout << \"rotation angle thetam          : \" << thetam << \" Degree\\n\";\n  cout << \"size of spin system            : \" << nspins << \" spins\\n\";\n  cout << \"initial density operator       : Ix(ax,\" << nstart << \")\\n\"; \n  for(i=0;i<2;++i)\n  { for(j=i+1;j<3;++j)\n    { cout << \"dipolar coupling constant (\" << i << \",\" << j << \") : \" <<\n              D[i][j] << \" Hz\\n\";\n      cout << \"relativ orientation of D tensor: (\" << alpha_D[i][j] << \",\" <<\n               beta_D[i][j] << \",\" << gamma_D[i][j] << \")\\n\";\n    }\n  }\n  for(i=0;i<3;++i)\n  { cout << \"isotropic chemical shift (\" << i << \") : \" << iso_CSA[i] << \" Hz\\n\";\n  }\n  cout << \"# of sampling points:          \" << nprop << \"\\n\";\n  cout << \"# of rotor periods:            \" << nrotor << \"\\n\";\n  cout << \"Powder Quality Number:         \" << qu << \"  (\" << value1[qu] <<\n          \" orientations)\\n\";\n  cout << \"Number of data points:         \" << Fnp << \" points\\n\";\n  cout << \"MAS frequency:                 \" << mas_freq << \" Hz\\n\";\n\n\tchar timex[100];\n#ifdef _MSC_VER\n\tsprintf_s ( timex, \"%.6f\", time);\n#else\n\tsprintf ( timex, \"%.6f\", time);\n#endif\n\n  cout << \"time increments:               \" << timex << \"s\\n\";\n\n\tchar tprop[100];\n#ifdef _MSC_VER\n\tsprintf_s ( tprop, \"%.5f\", time_prop);\n#else\n\tsprintf ( tprop, \"%.5f\", time_prop);\n#endif\n\n  cout << \"dwell time:                    \" << tprop << \"s\\n\";\n  cout << \"jump rate constant             \" << kex << \" s-1\\n\";\n  cout << \"correlation time               \" << tauc << \" s\\n\";\n  cout << \"rf-field amplitude:            \" << gamB1 << \" Hz\\n\";\n  cout << \"Output filename:               \" << name << \"\\n\";\n  cout << \"\\n\";\n  cout.flush();\n\n  ax.Kex(kex,0);\n  matrix mx(ax.HS()*ax.HS(), ax.HS()*ax.HS(), i_matrix_type); \/\/ ExpLOp is the identity superop\n  Iop = super_op(mx);\n\n  block_2D data(nspins,Fnp);\n  for(k1=0;k1<nspins;++k1)\n  { for(k2=0;k2<Fnp;++k2)\n    { data(k1,k2) = 0;\n    }\n  }\n\n\/\/setup for the hamiltonian\n  for(i=0;i<nspins-1;++i)\n  { for(j=i+1;j<nspins;++j)\n    { Hdip[i][j] = T_D(ax,i,j);\n    }\n  }\n\n\/\/setup for the space tensor\n  matrix help(3,3,0);\n  for(i=0;i<2;++i)\n  { for(j=i+1;j<3;++j)\n    { help.put_h(-1.0\/2.0,0,0);\n      help.put_h(-1.0\/2.0,1,1);\n      help.put_h( 1.0,2,2);\n      help   = - (complex) D[i][j] * help;\n      Adip[i][j] = A2(help);\n      Adip[i][j] = Adip[i][j].rotate(alpha_D[i][j],beta_D[i][j],gamma_D[i][j]);\n    }\n  }\n\n\n  string name1 = name+\".mat\";\n  string name2 = name;\n\n\/\/here starts the powder loop\n\/\/reference JCP 59 (8), 3992 (1973).\n\n  for(count=1; count<=value1[qu]; ++count)\n  { beta  = 180.0 * count\/value1[qu];\n    alpha = 360.0 * ((value2[qu]*count) % value1[qu])\/value1[qu];\n    gamma = 360.0 * ((value3[qu]*count) % value1[qu])\/value1[qu];\n    if(count % 10 == 1)\n    { \/\/getrusage(0, & me);\n      cout << count << \"\\tbeta = \" << beta << \"\\talpha = \"\n           << alpha << \"\\tgamma = \" << gamma << \"\\n\";\n      cout.flush();\n    }\n    scale = sin(beta\/180.0*PI);\n    sigma = iso_CSA[nstart]\/sqrt(iso_CSA[nstart]*iso_CSA[nstart]+gamB1*gamB1)*Iz(ax,nstart) +\n            gamB1\/sqrt(iso_CSA[nstart]*iso_CSA[nstart]+gamB1*gamB1)*Ix(ax,nstart);\n    for(k=0;k<nspins;++k)\n    { detect[k] = Ix(ax,k);\n    }\n  \n\/\/now we rotate the space tensor\n    for(i=0;i<2;++i)\n    { for(j=i+1;j<3;++j)\n      { Adip_R[i][j] = Adip[i][j].rotate(alpha,beta,gamma);\n      }\n    }\n\n\/\/zero all components\n    for(i=0;i<5;++i)\n      H[i] = gen_op();\n\n\/\/this is the dipolar part\n    for(i=0;i<nspins;++i)\n      H[2] += iso_CSA[i]*Iz(ax,i);\n    for(i=0;i<2;++i)\n    { for(j=i+1;j<3;++j)\n      { for(k=-2;k<=2;++k)\n        { H[k+2] += Adip_R[i][j].component(2,k) * d2(k,0,thetam) * Hdip[i][j].component(2,0);\n        }\n      }\n    }\n    for(i=0;i<nprop;++i)\n      U[i] = Iop;\n\n\/\/now we calculate the propagator over one cycle of the MAS\n    for(ltime=0.5*time;ltime<=steps*time;ltime += time)\n    { index = int(ltime\/time_prop);\n      Ham = gamB1*Fx(ax,\"1H\");\n      for(i=-2;i<=2;++i)\n        Ham += exp(complex(0,i*2.0*PI*ltime*mas_freq)) * H[i+2];\n      L = complex(0,2.0*PI)*commutator(Ham);\n\/\/    cout << \"\\nHam = \\n\";\n\/\/    cout << Ham;\n\/\/    cout << \"\\nL = \\n\";\n\/\/    cout << L;\n      K = Kex(ax, Ham.get_basis());\n\/\/    cout << \"\\nK = \\n\";\n\/\/    cout << K;\n\/\/    cout.flush();\n      L += K;\n      UT = exp(L,-time);\n      UT.set_HBR();\n      U[index] = UT*U[index];\n    }\n    for(i=0;i<nprop;++i)\n      U[i].set_DBR();\n    sigma.set_DBR();\n    for(i=0;i<Fnp;++i)\n    { for(j=0;j<nspins;++j)\n      { data(j,i) += proj(sigma,detect[j])*scale;\n      }\n      sigma=U[i%nprop]*sigma;\n    }\n  } \/\/ end of powder loop\n  MATLAB(name1,name2,data,1);\n  exit(0);\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#include <af\/random_engine.h>\n\n#include <af\/array.h>\n#include <af\/data.h>\n#include <af\/defines.h>\n#include <af\/dim4.hpp>\n#include <backend.hpp>\n#include <err_common.hpp>\n#include <handle.hpp>\n#include <random_engine.hpp>\n#include <MersenneTwister.hpp>\n\n#include <af\/util.h>\n#include <iostream>\n\nusing detail::cfloat;\nusing detail::cdouble;\nusing detail::uchar;\nusing detail::uniformDistribution;\nusing detail::normalDistribution;\n\nusing common::MaxBlocks;\nusing common::TableLength;\nusing common::MtStateLength;\nusing common::pos;\nusing common::sh1;\nusing common::sh2;\nusing common::mask;\nusing common::recursion_tbl;\nusing common::temper_tbl;\n\n\/\/TODO : static pointer to random_engine_t that wil hold the default random engine\n\/\/protect this object with mutex\n\n\/\/TODO : class and camel case\ntypedef struct {\n    af_random_type type;\n    unsigned long long seed;\n    unsigned long long counter;\n    af_array pos;\n    af_array sh1;\n    af_array sh2;\n    uint mask;\n    af_array recursion_table;\n    af_array temper_table;\n    af_array state;\n} af_random_engine_t;\n\naf_random_engine getRandomEngineHandle(const af_random_engine_t engine)\n{\n    af_random_engine_t *engineHandle = new af_random_engine_t;\n    *engineHandle = engine;\n    return static_cast<af_random_engine>(engineHandle);\n}\n\naf_random_engine_t* getRandomEngine(const af_random_engine engineHandle)\n{\n    return (af_random_engine_t *)engineHandle;\n}\n\ntemplate<typename T>\nstatic inline af_array uniformDistribution_(const af::dim4 &dims, af_random_engine_t *e)\n{\n    if (e->type == AF_RANDOM_MERSENNE) {\n        return getHandle(uniformDistribution<T>(dims,\n                    getArray<uint>(e->pos),\n                    getArray<uint>(e->sh1),\n                    getArray<uint>(e->sh2),\n                    e->mask,\n                    getArray<uint>(e->recursion_table),\n                    getArray<uint>(e->temper_table),\n                    getArray<uint>(e->state)));\n    } else {\n        return getHandle(uniformDistribution<T>(dims, e->type, e->seed, e->counter));\n    }\n}\n\ntemplate<typename T>\nstatic inline af_array normalDistribution_(const af::dim4 &dims, af_random_engine_t *e)\n{\n    if (e->type == AF_RANDOM_MERSENNE) {\n        return getHandle(normalDistribution<T>(dims,\n                    getArray<uint>(e->pos),\n                    getArray<uint>(e->sh1),\n                    getArray<uint>(e->sh2),\n                    e->mask,\n                    getArray<uint>(e->recursion_table),\n                    getArray<uint>(e->temper_table),\n                    getArray<uint>(e->state)));\n    } else {\n        return getHandle(normalDistribution<T>(dims, e->type, e->seed, e->counter));\n    }\n}\n\naf_err af_create_random_engine(af_random_engine *engineHandle, af_random_type rtype, unsigned long long seed)\n{\n    try {\n        af_random_engine_t e;\n        e.type = rtype;\n        e.seed = seed;\n        e.counter = 0;\n        if (rtype == AF_RANDOM_MERSENNE) {\n            \/\/TODO Add AF_CHECK(af_* calls)\n            AF_CHECK(af_create_array(&e.pos, pos, 1, &MaxBlocks, u32));\n            AF_CHECK(af_create_array(&e.sh1, sh1, 1, &MaxBlocks, u32));\n            AF_CHECK(af_create_array(&e.sh2, sh2, 1, &MaxBlocks, u32));\n            e.mask = mask;\n            AF_CHECK(af_create_array(&e.recursion_table, recursion_tbl, 1, &TableLength, u32));\n            AF_CHECK(af_create_array(&e.temper_table, temper_tbl, 1, &TableLength, u32));\n            e.state = getHandle(initMersenneState(seed, getArray<uint>(e.recursion_table)));\n        }\n        *engineHandle = getRandomEngineHandle(e);\n    } CATCHALL;\n\n    return AF_SUCCESS;\n}\n\naf_err af_random_engine_uniform(af_array *out, af_random_engine engine, const unsigned ndims, const dim_t * const dims, const af_dtype type)\n{\n    try {\n        af_array result;\n        AF_CHECK(af_init());\n\n        af::dim4 d = verifyDims(ndims, dims);\n        af_random_engine_t *e = getRandomEngine(engine);\n\n        switch(type) {\n        case f32:   result = uniformDistribution_<float  >(d, e); break;\n        case c32:   result = uniformDistribution_<cfloat >(d, e); break;\n        case f64:   result = uniformDistribution_<double >(d, e); break;\n        case c64:   result = uniformDistribution_<cdouble>(d, e); break;\n        case s32:   result = uniformDistribution_<int    >(d, e); break;\n        case u32:   result = uniformDistribution_<uint   >(d, e); break;\n        case s64:   result = uniformDistribution_<intl   >(d, e); break;\n        case u64:   result = uniformDistribution_<uintl  >(d, e); break;\n        case s16:   result = uniformDistribution_<short  >(d, e); break;\n        case u16:   result = uniformDistribution_<ushort >(d, e); break;\n        case u8:    result = uniformDistribution_<uchar  >(d, e); break;\n        case b8:    result = uniformDistribution_<char   >(d, e); break;\n        default:    TYPE_ERROR(4, type);\n        }\n        std::swap(*out, result);\n    }\n    CATCHALL;\n    return AF_SUCCESS;\n}\n\naf_err af_random_engine_normal(af_array *out, af_random_engine engine, const unsigned ndims, const dim_t * const dims, const af_dtype type)\n{\n    try {\n        af_array result;\n        AF_CHECK(af_init());\n\n        af::dim4 d = verifyDims(ndims, dims);\n        af_random_engine_t *e = getRandomEngine(engine);\n\n        switch(type) {\n        case f32:   result = normalDistribution_<float  >(d, e); break;\n        case c32:   result = normalDistribution_<cfloat >(d, e); break;\n        case f64:   result = normalDistribution_<double >(d, e); break;\n        case c64:   result = normalDistribution_<cdouble>(d, e); break;\n        default:    TYPE_ERROR(4, type);\n        }\n        std::swap(*out, result);\n    }\n    CATCHALL;\n    return AF_SUCCESS;\n}\n\naf_err af_release_random_engine(af_random_engine engineHandle)\n{\n    try {\n        af_random_engine_t *e = getRandomEngine(engineHandle);\n        if (e->type == AF_RANDOM_MERSENNE) {\n            AF_CHECK(af_release_array(e->pos));\n            AF_CHECK(af_release_array(e->sh1));\n            AF_CHECK(af_release_array(e->sh2));\n            AF_CHECK(af_release_array(e->recursion_table));\n            AF_CHECK(af_release_array(e->temper_table));\n            AF_CHECK(af_release_array(e->state));\n        }\n        delete e;\n    }\n    CATCHALL;\n    return AF_SUCCESS;\n}\n<commit_msg>Changed internal struct to class<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#include <af\/random_engine.h>\n\n#include <af\/array.h>\n#include <af\/data.h>\n#include <af\/defines.h>\n#include <af\/dim4.hpp>\n#include <backend.hpp>\n#include <err_common.hpp>\n#include <handle.hpp>\n#include <random_engine.hpp>\n#include <MersenneTwister.hpp>\n\n#include <af\/util.h>\n#include <iostream>\n\nusing detail::cfloat;\nusing detail::cdouble;\nusing detail::uchar;\nusing detail::uniformDistribution;\nusing detail::normalDistribution;\n\nusing common::MaxBlocks;\nusing common::TableLength;\nusing common::MtStateLength;\nusing common::pos;\nusing common::sh1;\nusing common::sh2;\nusing common::mask;\nusing common::recursion_tbl;\nusing common::temper_tbl;\n\n\/\/TODO : static pointer to random_engine_t that wil hold the default random engine\n\/\/protect this object with mutex\n\n\/\/TODO : class and camel case\ntypedef struct {\n    af_random_type type;\n    unsigned long long seed;\n    unsigned long long counter;\n    af_array pos;\n    af_array sh1;\n    af_array sh2;\n    uint mask;\n    af_array recursion_table;\n    af_array temper_table;\n    af_array state;\n} af_random_engine_t;\n\nclass RandomEngine\n{\n    public :\n    af_random_type type;\n    unsigned long long seed;\n    unsigned long long counter;\n    af_array pos;\n    af_array sh1;\n    af_array sh2;\n    uint mask;\n    af_array recursion_table;\n    af_array temper_table;\n    af_array state;\n};\n\naf_random_engine getRandomEngineHandle(const RandomEngine engine)\n{\n    RandomEngine *engineHandle = new RandomEngine;\n    *engineHandle = engine;\n    return static_cast<af_random_engine>(engineHandle);\n}\n\nRandomEngine* getRandomEngine(const af_random_engine engineHandle)\n{\n    return (RandomEngine *)engineHandle;\n}\n\ntemplate<typename T>\nstatic inline af_array uniformDistribution_(const af::dim4 &dims, RandomEngine *e)\n{\n    if (e->type == AF_RANDOM_MERSENNE) {\n        return getHandle(uniformDistribution<T>(dims,\n                    getArray<uint>(e->pos),\n                    getArray<uint>(e->sh1),\n                    getArray<uint>(e->sh2),\n                    e->mask,\n                    getArray<uint>(e->recursion_table),\n                    getArray<uint>(e->temper_table),\n                    getArray<uint>(e->state)));\n    } else {\n        return getHandle(uniformDistribution<T>(dims, e->type, e->seed, e->counter));\n    }\n}\n\ntemplate<typename T>\nstatic inline af_array normalDistribution_(const af::dim4 &dims, RandomEngine *e)\n{\n    if (e->type == AF_RANDOM_MERSENNE) {\n        return getHandle(normalDistribution<T>(dims,\n                    getArray<uint>(e->pos),\n                    getArray<uint>(e->sh1),\n                    getArray<uint>(e->sh2),\n                    e->mask,\n                    getArray<uint>(e->recursion_table),\n                    getArray<uint>(e->temper_table),\n                    getArray<uint>(e->state)));\n    } else {\n        return getHandle(normalDistribution<T>(dims, e->type, e->seed, e->counter));\n    }\n}\n\naf_err af_create_random_engine(af_random_engine *engineHandle, af_random_type rtype, unsigned long long seed)\n{\n    try {\n        RandomEngine e;\n        e.type = rtype;\n        e.seed = seed;\n        e.counter = 0;\n        if (rtype == AF_RANDOM_MERSENNE) {\n            \/\/TODO Add AF_CHECK(af_* calls)\n            AF_CHECK(af_create_array(&e.pos, pos, 1, &MaxBlocks, u32));\n            AF_CHECK(af_create_array(&e.sh1, sh1, 1, &MaxBlocks, u32));\n            AF_CHECK(af_create_array(&e.sh2, sh2, 1, &MaxBlocks, u32));\n            e.mask = mask;\n            AF_CHECK(af_create_array(&e.recursion_table, recursion_tbl, 1, &TableLength, u32));\n            AF_CHECK(af_create_array(&e.temper_table, temper_tbl, 1, &TableLength, u32));\n            e.state = getHandle(initMersenneState(seed, getArray<uint>(e.recursion_table)));\n        }\n        *engineHandle = getRandomEngineHandle(e);\n    } CATCHALL;\n\n    return AF_SUCCESS;\n}\n\naf_err af_random_engine_uniform(af_array *out, af_random_engine engine, const unsigned ndims, const dim_t * const dims, const af_dtype type)\n{\n    try {\n        af_array result;\n        AF_CHECK(af_init());\n\n        af::dim4 d = verifyDims(ndims, dims);\n        RandomEngine *e = getRandomEngine(engine);\n\n        switch(type) {\n        case f32:   result = uniformDistribution_<float  >(d, e); break;\n        case c32:   result = uniformDistribution_<cfloat >(d, e); break;\n        case f64:   result = uniformDistribution_<double >(d, e); break;\n        case c64:   result = uniformDistribution_<cdouble>(d, e); break;\n        case s32:   result = uniformDistribution_<int    >(d, e); break;\n        case u32:   result = uniformDistribution_<uint   >(d, e); break;\n        case s64:   result = uniformDistribution_<intl   >(d, e); break;\n        case u64:   result = uniformDistribution_<uintl  >(d, e); break;\n        case s16:   result = uniformDistribution_<short  >(d, e); break;\n        case u16:   result = uniformDistribution_<ushort >(d, e); break;\n        case u8:    result = uniformDistribution_<uchar  >(d, e); break;\n        case b8:    result = uniformDistribution_<char   >(d, e); break;\n        default:    TYPE_ERROR(4, type);\n        }\n        std::swap(*out, result);\n    }\n    CATCHALL;\n    return AF_SUCCESS;\n}\n\naf_err af_random_engine_normal(af_array *out, af_random_engine engine, const unsigned ndims, const dim_t * const dims, const af_dtype type)\n{\n    try {\n        af_array result;\n        AF_CHECK(af_init());\n\n        af::dim4 d = verifyDims(ndims, dims);\n        RandomEngine *e = getRandomEngine(engine);\n\n        switch(type) {\n        case f32:   result = normalDistribution_<float  >(d, e); break;\n        case c32:   result = normalDistribution_<cfloat >(d, e); break;\n        case f64:   result = normalDistribution_<double >(d, e); break;\n        case c64:   result = normalDistribution_<cdouble>(d, e); break;\n        default:    TYPE_ERROR(4, type);\n        }\n        std::swap(*out, result);\n    }\n    CATCHALL;\n    return AF_SUCCESS;\n}\n\naf_err af_release_random_engine(af_random_engine engineHandle)\n{\n    try {\n        RandomEngine *e = getRandomEngine(engineHandle);\n        if (e->type == AF_RANDOM_MERSENNE) {\n            AF_CHECK(af_release_array(e->pos));\n            AF_CHECK(af_release_array(e->sh1));\n            AF_CHECK(af_release_array(e->sh2));\n            AF_CHECK(af_release_array(e->recursion_table));\n            AF_CHECK(af_release_array(e->temper_table));\n            AF_CHECK(af_release_array(e->state));\n        }\n        delete e;\n    }\n    CATCHALL;\n    return AF_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * Copyright (c) 2007-2008 The Florida State 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\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: Stephen Hines\n *\/\n\n#ifndef __ARCH_ARM_LINUX_LINUX_HH__\n#define __ARCH_ARM_LINUX_LINUX_HH__\n\n#include \"kern\/linux\/linux.hh\"\n\nclass ArmLinux : public Linux\n{\n  public:\n\n    \/\/\/ This table maps the target open() flags to the corresponding\n    \/\/\/ host open() flags.\n    static OpenFlagTransTable openFlagTable[];\n\n    \/\/\/ Number of entries in openFlagTable[].\n    static const int NUM_OPEN_FLAGS;\n\n    \/\/@{\n    \/\/\/ open(2) flag values.\n    static const int TGT_O_RDONLY    = 00000000; \/\/!< O_RDONLY\n    static const int TGT_O_WRONLY    = 00000001; \/\/!< O_WRONLY\n    static const int TGT_O_RDWR      = 00000002; \/\/!< O_RDWR\n    static const int TGT_O_CREAT     = 00000100; \/\/!< O_CREAT\n    static const int TGT_O_EXCL      = 00000200; \/\/!< O_EXCL\n    static const int TGT_O_NOCTTY    = 00000400; \/\/!< O_NOCTTY\n    static const int TGT_O_TRUNC     = 00001000; \/\/!< O_TRUNC\n    static const int TGT_O_APPEND    = 00002000; \/\/!< O_APPEND\n    static const int TGT_O_NONBLOCK  = 00004000; \/\/!< O_NONBLOCK\n    static const int TGT_O_SYNC      = 00010000; \/\/!< O_SYNC\n    static const int TGT_FASYNC      = 00020000; \/\/!< FASYNC\n    static const int TGT_O_DIRECTORY = 00040000; \/\/!< O_DIRECTORY\n    static const int TGT_O_NOFOLLOW  = 00100000; \/\/!< O_NOFOLLOW\n    static const int TGT_O_DIRECT    = 00200000; \/\/!< O_DIRECT\n    static const int TGT_O_LARGEFILE = 00400000; \/\/!< O_LARGEFILE\n    static const int TGT_O_NOATIME   = 01000000; \/\/!< O_NOATIME\n    \/\/@}\n\n    \/\/\/ For mmap().\n    static const unsigned TGT_MAP_ANONYMOUS = 0x800;\n\n    \/\/@{\n    \/\/\/ For getsysinfo().\n    static const unsigned GSI_PLATFORM_NAME = 103; \/\/!< platform name as string\n    static const unsigned GSI_CPU_INFO = 59;       \/\/!< CPU information\n    static const unsigned GSI_PROC_TYPE = 60;      \/\/!< get proc_type\n    static const unsigned GSI_MAX_CPU = 30;        \/\/!< max # cpu's on this machine\n    static const unsigned GSI_CPUS_IN_BOX = 55;    \/\/!< number of CPUs in system\n    static const unsigned GSI_PHYSMEM = 19;        \/\/!< Physical memory in KB\n    static const unsigned GSI_CLK_TCK = 42;        \/\/!< clock freq in Hz\n    \/\/@}\n\n    \/\/@{\n    \/\/\/ For getrusage().\n    static const int TGT_RUSAGE_SELF = 0;\n    static const int TGT_RUSAGE_CHILDREN = -1;\n    static const int TGT_RUSAGE_BOTH = -2;\n    \/\/@}\n\n    \/\/@{\n    \/\/\/ For setsysinfo().\n    static const unsigned SSI_IEEE_FP_CONTROL = 14; \/\/!< ieee_set_fp_control()\n    \/\/@}\n\n    \/\/@{\n    \/\/\/ ioctl() command codes.\n    static const unsigned TIOCGETP_   = 0x40067408;\n    static const unsigned TIOCSETP_   = 0x80067409;\n    static const unsigned TIOCSETN_   = 0x8006740a;\n    static const unsigned TIOCSETC_   = 0x80067411;\n    static const unsigned TIOCGETC_   = 0x40067412;\n    static const unsigned FIONREAD_   = 0x4004667f;\n    static const unsigned TIOCISATTY_ = 0x2000745e;\n    static const unsigned TIOCGETS_   = 0x402c7413;\n    static const unsigned TIOCGETA_   = 0x40127417;\n    \/\/@}\n\n    \/\/\/ For table().\n    static const int TBL_SYSINFO = 12;\n\n    \/\/\/ Resource enumeration for getrlimit().\n    enum rlimit_resources {\n        TGT_RLIMIT_CPU = 0,\n        TGT_RLIMIT_FSIZE = 1,\n        TGT_RLIMIT_DATA = 2,\n        TGT_RLIMIT_STACK = 3,\n        TGT_RLIMIT_CORE = 4,\n        TGT_RLIMIT_NOFILE = 5,\n        TGT_RLIMIT_AS = 6,\n        TGT_RLIMIT_RSS = 7,\n        TGT_RLIMIT_VMEM = 7,\n        TGT_RLIMIT_NPROC = 8,\n        TGT_RLIMIT_MEMLOCK = 9,\n        TGT_RLIMIT_LOCKS = 10\n    };\n\n    typedef struct {\n        uint32_t st_dev;\n        uint32_t st_ino;\n        uint16_t st_mode;\n        uint16_t st_nlink;\n        uint16_t st_uid;\n        uint16_t st_gid;\n        uint32_t st_rdev;\n        uint32_t st_size;\n        uint32_t st_blksize;\n        uint32_t st_blocks;\n        uint32_t st_atimeX;\n        uint32_t st_atime_nsec;\n        uint32_t st_mtimeX;\n        uint32_t st_mtime_nsec;\n        uint32_t st_ctimeX;\n        uint32_t st_ctime_nsec;\n    } tgt_stat;\n\n    typedef struct {\n        uint64_t  st_dev;\n        uint8_t   __pad0[4];\n        uint32_t  __st_ino;\n        uint32_t  st_mode;\n        uint32_t  st_nlink;\n        uint32_t  st_uid;\n        uint32_t  st_gid;\n        uint64_t  st_rdev;\n        uint8_t   __pad3[4];\n        int64_t   __attribute__ ((aligned (8))) st_size;\n        uint32_t  st_blksize;\n        uint64_t  __attribute__ ((aligned (8))) st_blocks;\n        uint32_t  st_atimeX;\n        uint32_t  st_atime_nsec;\n        uint32_t  st_mtimeX;\n        uint32_t  st_mtime_nsec;\n        uint32_t  st_ctimeX;\n        uint32_t  st_ctime_nsec;\n        uint64_t  st_ino;\n    } tgt_stat64;\n\n\n};\n\n#endif\n<commit_msg>ARM: Update some syscall constants and delete others that are Alpha only.<commit_after>\/*\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * Copyright (c) 2007-2008 The Florida State 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\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: Stephen Hines\n *\/\n\n#ifndef __ARCH_ARM_LINUX_LINUX_HH__\n#define __ARCH_ARM_LINUX_LINUX_HH__\n\n#include \"kern\/linux\/linux.hh\"\n\nclass ArmLinux : public Linux\n{\n  public:\n\n    \/\/\/ This table maps the target open() flags to the corresponding\n    \/\/\/ host open() flags.\n    static OpenFlagTransTable openFlagTable[];\n\n    \/\/\/ Number of entries in openFlagTable[].\n    static const int NUM_OPEN_FLAGS;\n\n    \/\/@{\n    \/\/\/ open(2) flag values.\n    static const int TGT_O_RDONLY    = 00000000; \/\/!< O_RDONLY\n    static const int TGT_O_WRONLY    = 00000001; \/\/!< O_WRONLY\n    static const int TGT_O_RDWR      = 00000002; \/\/!< O_RDWR\n    static const int TGT_O_CREAT     = 00000100; \/\/!< O_CREAT\n    static const int TGT_O_EXCL      = 00000200; \/\/!< O_EXCL\n    static const int TGT_O_NOCTTY    = 00000400; \/\/!< O_NOCTTY\n    static const int TGT_O_TRUNC     = 00001000; \/\/!< O_TRUNC\n    static const int TGT_O_APPEND    = 00002000; \/\/!< O_APPEND\n    static const int TGT_O_NONBLOCK  = 00004000; \/\/!< O_NONBLOCK\n    static const int TGT_O_SYNC      = 00010000; \/\/!< O_SYNC\n    static const int TGT_FASYNC      = 00020000; \/\/!< FASYNC\n    static const int TGT_O_DIRECTORY = 00040000; \/\/!< O_DIRECTORY\n    static const int TGT_O_NOFOLLOW  = 00100000; \/\/!< O_NOFOLLOW\n    static const int TGT_O_DIRECT    = 00200000; \/\/!< O_DIRECT\n    static const int TGT_O_LARGEFILE = 00400000; \/\/!< O_LARGEFILE\n    static const int TGT_O_NOATIME   = 01000000; \/\/!< O_NOATIME\n    \/\/@}\n\n    \/\/\/ For mmap().\n    static const unsigned TGT_MAP_ANONYMOUS = 0x20;\n\n    \/\/@{\n    \/\/\/ For getrusage().\n    static const int TGT_RUSAGE_SELF = 0;\n    static const int TGT_RUSAGE_CHILDREN = -1;\n    static const int TGT_RUSAGE_BOTH = -2;\n    \/\/@}\n\n    \/\/@{\n    \/\/\/ ioctl() command codes.\n    static const unsigned TIOCGETP_   = 0x40067408;\n    static const unsigned TIOCSETP_   = 0x80067409;\n    static const unsigned TIOCSETN_   = 0x8006740a;\n    static const unsigned TIOCSETC_   = 0x80067411;\n    static const unsigned TIOCGETC_   = 0x40067412;\n    static const unsigned FIONREAD_   = 0x4004667f;\n    static const unsigned TIOCISATTY_ = 0x2000745e;\n    static const unsigned TIOCGETS_   = 0x402c7413;\n    static const unsigned TIOCGETA_   = 0x40127417;\n    \/\/@}\n\n    \/\/\/ For table().\n    static const int TBL_SYSINFO = 12;\n\n    \/\/\/ Resource enumeration for getrlimit().\n    enum rlimit_resources {\n        TGT_RLIMIT_CPU = 0,\n        TGT_RLIMIT_FSIZE = 1,\n        TGT_RLIMIT_DATA = 2,\n        TGT_RLIMIT_STACK = 3,\n        TGT_RLIMIT_CORE = 4,\n        TGT_RLIMIT_RSS = 5,\n        TGT_RLIMIT_NPROC = 6,\n        TGT_RLIMIT_NOFILE = 7,\n        TGT_RLIMIT_MEMLOCK = 8,\n        TGT_RLIMIT_AS = 9,\n        TGT_RLIMIT_LOCKS = 10\n    };\n\n    typedef struct {\n        uint32_t st_dev;\n        uint32_t st_ino;\n        uint16_t st_mode;\n        uint16_t st_nlink;\n        uint16_t st_uid;\n        uint16_t st_gid;\n        uint32_t st_rdev;\n        uint32_t st_size;\n        uint32_t st_blksize;\n        uint32_t st_blocks;\n        uint32_t st_atimeX;\n        uint32_t st_atime_nsec;\n        uint32_t st_mtimeX;\n        uint32_t st_mtime_nsec;\n        uint32_t st_ctimeX;\n        uint32_t st_ctime_nsec;\n    } tgt_stat;\n\n    typedef struct {\n        uint64_t  st_dev;\n        uint8_t   __pad0[4];\n        uint32_t  __st_ino;\n        uint32_t  st_mode;\n        uint32_t  st_nlink;\n        uint32_t  st_uid;\n        uint32_t  st_gid;\n        uint64_t  st_rdev;\n        uint8_t   __pad3[4];\n        int64_t   __attribute__ ((aligned (8))) st_size;\n        uint32_t  st_blksize;\n        uint64_t  __attribute__ ((aligned (8))) st_blocks;\n        uint32_t  st_atimeX;\n        uint32_t  st_atime_nsec;\n        uint32_t  st_mtimeX;\n        uint32_t  st_mtime_nsec;\n        uint32_t  st_ctimeX;\n        uint32_t  st_ctime_nsec;\n        uint64_t  st_ino;\n    } tgt_stat64;\n\n\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef DORY_PROCESS_SPAWN_H_\n#define DORY_PROCESS_SPAWN_H_\n\n#include <cstdio>\n#include <cassert>\n#include <functional>\n#include <iostream>\n#include <sstream>\n#include <map>\n\n#include \"uv.h\"\n\nnamespace spawn {\nusing namespace std;\n\n\/\/ Forward declaration\nclass DoryProcessSpawn;\n\n#if defined(NDEBUG)\n# define ASSERT(exp)\n#else\n# define ASSERT(exp)  assert(exp)\n#endif\n\ntemplate<class... T>\nusing Callback = std::map<std::string, std::function<void(T...)>>;\n\nstatic uv_alloc_cb uvAllocCb = [](uv_handle_t* handle, size_t size, uv_buf_t* buf) {\n  buf->base = (char*)malloc(size);\n  buf->len = size;\n};\n\nclass DoryProcessSpawn {\npublic:\n  DoryProcessSpawn(char** args) : DoryProcessSpawn(uv_default_loop(), args) {}\n  DoryProcessSpawn(uv_loop_t *loop,\n                     char** args,\n                     const char* cwd = NULL,\n                     char** env = NULL) {\n    this->uv_loop = loop;\n    process.data = this;\n    pipeOut.data = this;\n    pipeErr.data = this;\n    timer.data = this;\n\n    uv_pipe_init(uv_loop, &pipeOut, 0);\n    uv_pipe_init(uv_loop, &pipeErr, 0);\n\n    options.stdio = stdio;\n    options.stdio[0].flags = UV_IGNORE; \/\/ FIXME : supports input\n    options.stdio[1].flags = (uv_stdio_flags)(UV_CREATE_PIPE | UV_WRITABLE_PIPE);\n    options.stdio[1].data.stream = (uv_stream_t*)&pipeOut;\n    options.stdio[2].flags = (uv_stdio_flags)(UV_CREATE_PIPE | UV_WRITABLE_PIPE);\n    options.stdio[2].data.stream = (uv_stream_t*)&pipeErr;\n    options.stdio_count = 3;\n    options.cwd = cwd;\n    options.env = env;\n\n    options.exit_cb = [](uv_process_t *req, int64_t exit_status, int term_signal) {\n      DoryProcessSpawn *child = (DoryProcessSpawn*)req->data;\n      if (child->timer.loop == child->uv_loop) \/\/ which is initialized\n        child->_clearTimer();\n\n      uv_close((uv_handle_t*) req, NULL);\n      uv_close((uv_handle_t*)&child->pipeOut, [](uv_handle_t*){});\n      uv_close((uv_handle_t*)&child->pipeErr, [](uv_handle_t*){});\n\n      child->emit(\"exit\", exit_status, term_signal);\n    };\n\n    this->args = args;\n    options.file = args[0];\n    options.args = args;\n  }\n\n  DoryProcessSpawn& kill(int term_signal = 9) {\n    uv_process_kill(&process, term_signal);\n    return *this;\n  }\n\n  \/\/ FIXME : look ugly\n  \/\/ work around emit and on.\n  DoryProcessSpawn& emit(const string name, int64_t exit_status, int term_signal) {\n    if (name.compare(\"exit\") == 0 && exitCallback != nullptr)\n      exitCallback(exit_status, term_signal);\n    return *this;\n  }\n  DoryProcessSpawn& emit(const string name, char* buf, ssize_t nread) {\n    if (name.compare(\"stdout\") == 0 && stdoutCallback != nullptr)\n      stdoutCallback(buf, nread);\n    if (name.compare(\"stderr\") == 0 && stderrCallback != nullptr)\n      stderrCallback(buf, nread);\n    return *this;\n  }\n  DoryProcessSpawn& emit(const string name, const char* _name, const char* message) {\n    if (name.compare(\"error\") == 0 && exitCallback != nullptr)\n      errorCallback(_name, message);\n    return *this;\n  }\n\n  \/\/FIXME : variadic ..Args using tuple.\n  template <typename... Args>\n  DoryProcessSpawn& emit(const string name, Args&&... args) {\n    if (eventListeners.count(name))\n      eventListeners[name]();\n\n    return *this;\n  }\n\n  DoryProcessSpawn& on(const string name, std::function<void(const char*, const char*)> func) {\n    if (name.compare(\"error\") == 0)\n      errorCallback = func;\n\n    return *this;\n  }\n  DoryProcessSpawn& on(const string name, std::function<void(int64_t,int)> func) {\n    if (name.compare(\"exit\") == 0)\n      exitCallback = func;\n\n    return *this;\n  }\n  DoryProcessSpawn& on(const string name, std::function<void(char*,ssize_t)> func) {\n    if (name.compare(\"stdout\") == 0)\n      stdoutCallback = func;\n    else if (name.compare(\"stderr\") == 0)\n        stderrCallback = func;\n\n    return *this;\n  }\n  template <typename... Args>\n  DoryProcessSpawn& on(const string name, std::function<void(Args...)> func) {\n    eventListeners[name] = func;\n\n    return *this;\n  }\n  DoryProcessSpawn& on(const string name, std::function<void()> func) {\n    eventListeners[name] = func;\n\n    return *this;\n  }\n  int spawn() {\n    int r;\n\n    if (timeout > 0) {\n      r = uv_timer_init(uv_loop, &timer);\n      ASSERT(r == 0);\n      r = uv_timer_start(&timer, [](uv_timer_t* timer){\n        DoryProcessSpawn *child = (DoryProcessSpawn*)timer->data;\n        child->_clearTimer();\n\n        uv_process_kill(&child->process, SIGKILL);\n\n        child->emit(\"timeout\");\n      }, timeout, 0);\n      ASSERT(r == 0);\n    }\n\n    r = uv_spawn(uv_loop, &process, &options);\n    if (r != 0) \/\/ spawn error.\n      return r;\n\n    \/\/ stdout pipe\n    r = uv_read_start((uv_stream_t*) &pipeOut, uvAllocCb, [](uv_stream_t* stream, ssize_t nread, const uv_buf_t* buf) {\n      DoryProcessSpawn *child = (DoryProcessSpawn*)stream->data;\n      if (nread > 0) {\n        child->emit(\"stdout\", buf->base, nread);\n      } else if (nread < 0) {\n        if (nread != UV_EOF)\n          child->kill(SIGTERM);\n        \/\/assert(nread == UV_EOF);\n      }\n      free(buf->base);\n    });\n    if (r != 0) { \/\/ stdout pipe error.\n      kill();\n      return r;\n    }\n\n    \/\/ stderr pipe\n    r = uv_read_start((uv_stream_t*) &pipeErr, uvAllocCb, [](uv_stream_t* stream, ssize_t nread, const uv_buf_t* buf) {\n      DoryProcessSpawn *child = (DoryProcessSpawn*)stream->data;\n      if (nread > 0) {\n        child->emit(\"stderr\", buf->base, nread);\n      } else if (nread < 0) {\n        if (nread != UV_EOF)\n          child->kill(SIGTERM);\n        \/\/assert(nread == UV_EOF);\n      }\n      free(buf->base);\n    });\n    if (r != 0) { \/\/ stderr pipe error.\n      kill();\n      return r;\n    }\n\n    \/\/ everything is ok\n    return 0;\n  }\n\n  int getPid() {\n    return this->process.pid;\n  }\n\n  unsigned int timeout = 0; \/\/ forever in defaults\nprivate:\n  uv_loop_t* uv_loop;\n  uv_process_t process;\n  uv_process_options_t options = {0};\n  uv_stdio_container_t stdio[3];\n  char** args;\n  uv_pipe_t pipeOut; \/\/ stdout\n  uv_pipe_t pipeErr; \/\/ stderr\n  uv_timer_t timer;\n\n  Callback<> eventListeners;\n  std::function<void(const char*, const char*)> errorCallback = nullptr;\n  std::function<void(int64_t,int)> exitCallback = nullptr;\n  std::function<void(char*, ssize_t)> stdoutCallback = nullptr;\n  std::function<void(char*, ssize_t)> stderrCallback = nullptr;\n\n  void _clearTimer() {\n    if (!uv_is_closing((uv_handle_t*)&this->timer)) {\n      uv_close((uv_handle_t*)&this->timer, [](uv_handle_t*){});\n    }\n  }\n};\n\n} \/\/ namespace spawn\n\n#endif \/\/ DORY_PROCESS_SPAWN_H_<commit_msg>clean up the eventListeners in destructor<commit_after>#ifndef DORY_PROCESS_SPAWN_H_\n#define DORY_PROCESS_SPAWN_H_\n\n#include <cstdio>\n#include <cassert>\n#include <functional>\n#include <iostream>\n#include <sstream>\n#include <map>\n\n#include \"uv.h\"\n\nnamespace spawn {\nusing namespace std;\n\n\/\/ Forward declaration\nclass DoryProcessSpawn;\n\n#if defined(NDEBUG)\n# define ASSERT(exp)\n#else\n# define ASSERT(exp)  assert(exp)\n#endif\n\ntemplate<class... T>\nusing Callback = std::map<std::string, std::function<void(T...)>>;\n\nstatic uv_alloc_cb uvAllocCb = [](uv_handle_t* handle, size_t size, uv_buf_t* buf) {\n  buf->base = (char*)malloc(size);\n  buf->len = size;\n};\n\nclass DoryProcessSpawn {\npublic:\n  DoryProcessSpawn(char** args) : DoryProcessSpawn(uv_default_loop(), args) {}\n  DoryProcessSpawn(uv_loop_t *loop,\n                     char** args,\n                     const char* cwd = NULL,\n                     char** env = NULL) {\n    this->uv_loop = loop;\n    process.data = this;\n    pipeOut.data = this;\n    pipeErr.data = this;\n    timer.data = this;\n\n    uv_pipe_init(uv_loop, &pipeOut, 0);\n    uv_pipe_init(uv_loop, &pipeErr, 0);\n\n    options.stdio = stdio;\n    options.stdio[0].flags = UV_IGNORE; \/\/ FIXME : supports input\n    options.stdio[1].flags = (uv_stdio_flags)(UV_CREATE_PIPE | UV_WRITABLE_PIPE);\n    options.stdio[1].data.stream = (uv_stream_t*)&pipeOut;\n    options.stdio[2].flags = (uv_stdio_flags)(UV_CREATE_PIPE | UV_WRITABLE_PIPE);\n    options.stdio[2].data.stream = (uv_stream_t*)&pipeErr;\n    options.stdio_count = 3;\n    options.cwd = cwd;\n    options.env = env;\n\n    options.exit_cb = [](uv_process_t *req, int64_t exit_status, int term_signal) {\n      DoryProcessSpawn *child = (DoryProcessSpawn*)req->data;\n      if (child->timer.loop == child->uv_loop) \/\/ which is initialized\n        child->_clearTimer();\n\n      uv_close((uv_handle_t*) req, NULL);\n      uv_close((uv_handle_t*)&child->pipeOut, [](uv_handle_t*){});\n      uv_close((uv_handle_t*)&child->pipeErr, [](uv_handle_t*){});\n\n      child->emit(\"exit\", exit_status, term_signal);\n    };\n\n    this->args = args;\n    options.file = args[0];\n    options.args = args;\n  }\n  ~DoryProcessSpawn() {\n    eventListeners.clear();\n  }\n\n  DoryProcessSpawn& kill(int term_signal = 9) {\n    uv_process_kill(&process, term_signal);\n    return *this;\n  }\n\n  \/\/ FIXME : look ugly\n  \/\/ work around emit and on.\n  DoryProcessSpawn& emit(const string name, int64_t exit_status, int term_signal) {\n    if (name.compare(\"exit\") == 0 && exitCallback != nullptr)\n      exitCallback(exit_status, term_signal);\n    return *this;\n  }\n  DoryProcessSpawn& emit(const string name, char* buf, ssize_t nread) {\n    if (name.compare(\"stdout\") == 0 && stdoutCallback != nullptr)\n      stdoutCallback(buf, nread);\n    if (name.compare(\"stderr\") == 0 && stderrCallback != nullptr)\n      stderrCallback(buf, nread);\n    return *this;\n  }\n  DoryProcessSpawn& emit(const string name, const char* _name, const char* message) {\n    if (name.compare(\"error\") == 0 && exitCallback != nullptr)\n      errorCallback(_name, message);\n    return *this;\n  }\n\n  \/\/FIXME : variadic ..Args using tuple.\n  template <typename... Args>\n  DoryProcessSpawn& emit(const string name, Args&&... args) {\n    if (eventListeners.count(name))\n      eventListeners[name]();\n\n    return *this;\n  }\n\n  DoryProcessSpawn& on(const string name, std::function<void(const char*, const char*)> func) {\n    if (name.compare(\"error\") == 0)\n      errorCallback = func;\n\n    return *this;\n  }\n  DoryProcessSpawn& on(const string name, std::function<void(int64_t,int)> func) {\n    if (name.compare(\"exit\") == 0)\n      exitCallback = func;\n\n    return *this;\n  }\n  DoryProcessSpawn& on(const string name, std::function<void(char*,ssize_t)> func) {\n    if (name.compare(\"stdout\") == 0)\n      stdoutCallback = func;\n    else if (name.compare(\"stderr\") == 0)\n        stderrCallback = func;\n\n    return *this;\n  }\n  template <typename... Args>\n  DoryProcessSpawn& on(const string name, std::function<void(Args...)> func) {\n    eventListeners[name] = func;\n\n    return *this;\n  }\n  DoryProcessSpawn& on(const string name, std::function<void()> func) {\n    eventListeners[name] = func;\n\n    return *this;\n  }\n  int spawn() {\n    int r;\n\n    if (timeout > 0) {\n      r = uv_timer_init(uv_loop, &timer);\n      ASSERT(r == 0);\n      r = uv_timer_start(&timer, [](uv_timer_t* timer){\n        DoryProcessSpawn *child = (DoryProcessSpawn*)timer->data;\n        child->_clearTimer();\n\n        uv_process_kill(&child->process, SIGKILL);\n\n        child->emit(\"timeout\");\n      }, timeout, 0);\n      ASSERT(r == 0);\n    }\n\n    r = uv_spawn(uv_loop, &process, &options);\n    if (r != 0) \/\/ spawn error.\n      return r;\n\n    \/\/ stdout pipe\n    r = uv_read_start((uv_stream_t*) &pipeOut, uvAllocCb, [](uv_stream_t* stream, ssize_t nread, const uv_buf_t* buf) {\n      DoryProcessSpawn *child = (DoryProcessSpawn*)stream->data;\n      if (nread > 0) {\n        child->emit(\"stdout\", buf->base, nread);\n      } else if (nread < 0) {\n        if (nread != UV_EOF)\n          child->kill(SIGTERM);\n        \/\/assert(nread == UV_EOF);\n      }\n      free(buf->base);\n    });\n    if (r != 0) { \/\/ stdout pipe error.\n      kill();\n      return r;\n    }\n\n    \/\/ stderr pipe\n    r = uv_read_start((uv_stream_t*) &pipeErr, uvAllocCb, [](uv_stream_t* stream, ssize_t nread, const uv_buf_t* buf) {\n      DoryProcessSpawn *child = (DoryProcessSpawn*)stream->data;\n      if (nread > 0) {\n        child->emit(\"stderr\", buf->base, nread);\n      } else if (nread < 0) {\n        if (nread != UV_EOF)\n          child->kill(SIGTERM);\n        \/\/assert(nread == UV_EOF);\n      }\n      free(buf->base);\n    });\n    if (r != 0) { \/\/ stderr pipe error.\n      kill();\n      return r;\n    }\n\n    \/\/ everything is ok\n    return 0;\n  }\n\n  int getPid() {\n    return this->process.pid;\n  }\n\n  unsigned int timeout = 0; \/\/ forever in defaults\nprivate:\n  uv_loop_t* uv_loop;\n  uv_process_t process;\n  uv_process_options_t options = {0};\n  uv_stdio_container_t stdio[3];\n  char** args;\n  uv_pipe_t pipeOut; \/\/ stdout\n  uv_pipe_t pipeErr; \/\/ stderr\n  uv_timer_t timer;\n\n  Callback<> eventListeners;\n  std::function<void(const char*, const char*)> errorCallback = nullptr;\n  std::function<void(int64_t,int)> exitCallback = nullptr;\n  std::function<void(char*, ssize_t)> stdoutCallback = nullptr;\n  std::function<void(char*, ssize_t)> stderrCallback = nullptr;\n\n  void _clearTimer() {\n    if (!uv_is_closing((uv_handle_t*)&this->timer)) {\n      uv_close((uv_handle_t*)&this->timer, [](uv_handle_t*){});\n    }\n  }\n};\n\n} \/\/ namespace spawn\n\n#endif \/\/ DORY_PROCESS_SPAWN_H_<|endoftext|>"}
{"text":"<commit_before>#include \"ts_packet.h\"\n\nTS_Packet::TS_Packet() {\n  Clear( );\n}\n\nTS_Packet::TS_Packet( std::string & Data ) {\n  if( Data.size() < 188 ) {\n    Clear( );    \n  } else {\n    for( int i = 0; i < 188; i++ ) {\n      Buffer[i] = Data[i];\n    }\n    Data.erase(0,188);\n    Free = 0;\n  }\n}\n\nTS_Packet::~TS_Packet() { }\n\nvoid TS_Packet::PID( int NewVal ) {\n  Buffer[1] = (Buffer[1] & 0xE0) + ((NewVal & 0x1F00) >> 8 );\n  Buffer[2] = (NewVal & 0x00FF);\n  Free = std::min( Free, 185 );\n}\n\nint TS_Packet::PID() {\n  return (( Buffer[1] & 0x1F ) << 8 ) + Buffer[2];\n}\n\nvoid TS_Packet::ContinuityCounter( int NewVal ) {\n  Buffer[3] = ( Buffer[3] & 0xF0 ) + ( NewVal & 0x0F );\n  Free = std::min( Free, 184 );\n}\n\nint TS_Packet::ContinuityCounter() {\n  return ( Buffer[3] & 0x0F );\n}\n\nint TS_Packet::BytesFree( ) {\n  return Free;\n}\n\nvoid TS_Packet::Clear( ) {\n  Free = 187;\n  Buffer[0] = 0x47;\n  for( int i = 1; i < 188; i++ ) {\n    Buffer[i] = 0x00;\n  }\n}\n\nvoid TS_Packet::AdaptionField( int NewVal ) {\n  NewVal = NewVal % 4;\n  NewVal = NewVal << 4;\n  Buffer[3] = ( Buffer[3] & 0xCF ) + NewVal;\n}\n\nint TS_Packet::AdaptionField( ) {\n  return ((Buffer[3] & 0x30) >> 4 ) >= 2;\n}\n\nvoid TS_Packet::PCR( int64_t NewVal ) {\n  Buffer[3] = (Buffer[3] | 0x30);\n  Buffer[4] = 7;\n  Buffer[5] = (Buffer[5] | 0x10 );\n  int64_t TmpVal = NewVal \/ 300;\n  Buffer[6] = (((TmpVal>>1)>>24) & 0xFF);\n  Buffer[7] = (((TmpVal>>1)>>16) & 0xFF);\n  Buffer[8] = (((TmpVal>>1)>>8) & 0xFF);\n  Buffer[9] = ((TmpVal>>1) & 0xFF);\n  int Remainder = NewVal % 300;\n  Buffer[10] = 0x7E + ((TmpVal & 0x01)<<7) + ((Remainder & 0x0100) >> 8 );\n  Buffer[11] = (Remainder & 0x00FF);\n  Free = std::min( Free, 176 );\n};\n\nint64_t TS_Packet::PCR( ) {\n  if( !AdaptionField() ) {\n    return -1;\n  }\n  if( !(Buffer[5] & 0x10 ) ) {\n    return -1;\n  }\n  int64_t Result = 0;\n  Result = (((((((Buffer[6] << 8) + Buffer[7]) << 8) + Buffer[8]) << 8) + Buffer[9]) << 1) + ( Buffer[10] & 0x80 );\n  Result = Result * 300;\n  Result += ((Buffer[10] & 0x01) << 8 + Buffer[11]);\n  return Result;\n}\n\nint TS_Packet::AdaptionFieldLen( ) {\n  if( !AdaptionField() ) {\n    return -1;\n  }\n  return (int)Buffer[4];\n}\n\nvoid TS_Packet::Print( ) {\n  std::cout << \"TS Packet: \" << (Buffer[0] == 0x47)\n            << \"\\n\\tNewUnit: \" << UnitStart()\n            << \"\\n\\tPID: \" << PID()\n            << \"\\n\\tContinuity Counter: \" << ContinuityCounter()\n            << \"\\n\\tAdaption Field: \" << AdaptionField() << \"\\n\";\n  if( AdaptionField() ) {\n    std::cout << \"\\t\\tAdaption Field Length: \" << AdaptionFieldLen() << \"\\n\";\n    if( AdaptionFieldLen() ) {\n      std::cout << \"\\t\\tRandom Access: \" << RandomAccess() << \"\\n\";\n    }\n    if( PCR() != -1 ) {\n      std::cout << \"\\t\\tPCR: \" << PCR() << \"( \" << (double)PCR() \/ 27000000 << \" s )\\n\";\n    }\n  }\n}\n\nint TS_Packet::UnitStart( ) {\n  return ( Buffer[1] & 0x40) >> 6;\n}\n\nvoid TS_Packet::UnitStart( int NewVal ) {\n  if( NewVal ) {\n    Buffer[1] = (Buffer[1] | 0x40);\n  } else {\n    Buffer[1] = (Buffer[1] & 0xBF);\n  }\n}\n\nint TS_Packet::RandomAccess( ) {\n  if( !AdaptionField() ) {\n    return -1;\n  }\n  return ( Buffer[5] & 0x40) >> 6;\n}\n\nvoid TS_Packet::RandomAccess( int NewVal ) {\n  if( AdaptionField() ) {\n    if( NewVal ) {\n      Buffer[5] = (Buffer[5] | 0x40);\n    } else {\n      Buffer[5] = (Buffer[5] & 0xBF);\n    }\n  } else {\n    Buffer[3] = (Buffer[3] | 0x30);\n    Buffer[4] = 1;\n    if( NewVal ) {\n      Buffer[5] = 0x40;\n    } else {\n      Buffer[5] = 0x00;\n    }\n    Free = 183;\n  }\n}\n\nvoid TS_Packet::DefaultPAT( ) {\n  static int MyCntr = 0;\n  UnitStart( 1 );\n  PID( 0 );\n  ContinuityCounter( MyCntr );\n  AdaptionField( 0x01 );\n  Buffer[ 4] = 0x00;\/\/Pointer Field\n  Buffer[ 5] = 0x00;\/\/TableID\n  Buffer[ 6] = 0xB0,\/\/Reserved + SectionLength\n  Buffer[ 7] = 0x0D;\/\/SectionLength (Cont)\n  Buffer[ 8] = 0x00;\/\/Transport_Stream_ID\n  Buffer[ 9] = 0x01;\/\/Transport_Stream_ID (Cont)\n  Buffer[10] = 0xC1;\/\/Reserved + VersionNumber + Current_Next_Indicator\n  Buffer[11] = 0x00;\/\/Section_Number\n  Buffer[12] = 0x00;\/\/Last_Section_Number\n  Buffer[13] = 0x00;  \/\/Program Number\n  Buffer[14] = 0x01;  \/\/Program Number (Cont)\n  Buffer[15] = 0xF0;  \/\/Reserved + Program_Map_PID\n  Buffer[16] = 0x00;  \/\/Program_Map_PID (Cont)\n  Buffer[17] = 0x2A;\/\/CRC32\n  Buffer[18] = 0xB1;\/\/CRC32 (Cont)\n  Buffer[19] = 0x04;\/\/CRC32 (Cont)\n  Buffer[20] = 0xB2;\/\/CRC32 (Cont)\n  std::fill( Buffer+21, Buffer+188, 0xFF );\n  Free = 0;\n  MyCntr = ( (MyCntr + 1) % 0xF);\n}\n\nvoid TS_Packet::DefaultPMT( ) {\n  static int MyCntr = 0;\n  UnitStart( 1 );\n  PID( 0x1000 );\n  ContinuityCounter( MyCntr );\n  AdaptionField( 0x01 );\n  Buffer[ 4] = 0x00;\/\/Pointer Field\n  Buffer[ 5] = 0x02;\/\/TableID\n  Buffer[ 6] = 0xb0;\/\/Reserved + Section_Length\n  Buffer[ 7] = 0x12;\/\/Section_Length (Cont)\n  Buffer[ 8] = 0x00;\/\/Program_Number\n  Buffer[ 9] = 0x01;\/\/Program_Number (Cont)\n  Buffer[10] = 0xc1;\/\/Reserved + VersionNumber + Current_Next_Indicator\n  Buffer[11] = 0x00;\/\/Section_Number\n  Buffer[12] = 0x00;\/\/Last_Section_Number\n  Buffer[13] = 0xe1;\/\/Reserved + PCR_PID\n  Buffer[14] = 0x00;\/\/PCR_PID (Cont)\n  Buffer[15] = 0xf0;\/\/Reserved + Program_Info_Length\n  Buffer[16] = 0x00;\/\/Program_Info_Length (Cont)\n  Buffer[17] = 0x1b;  \/\/Stream_Type\n  Buffer[18] = 0xe1;  \/\/Reserved + Elementary_PID\n  Buffer[19] = 0x00;  \/\/Elementary_PID (Cont)\n  Buffer[20] = 0xf0;  \/\/Reserved + ES_Info_Length\n  Buffer[21] = 0x00;  \/\/ES_Info_Length (Cont)\n  Buffer[22] = 0x15;\/\/CRC32\n  Buffer[23] = 0xbd;\/\/CRC32 (Cont)\n  Buffer[24] = 0x4d;\/\/CRC32 (Cont)\n  Buffer[25] = 0x56;\/\/CRC32 (Cont)\n  std::fill( Buffer+26, Buffer+188, 0xFF );\n  Free = 0;\n  MyCntr = ( (MyCntr + 1) % 0xF);\n}\n\nstd::string TS_Packet::ToString( ) {\n  std::string Result( Buffer, 188 );\n  return Result;\n}\n\nvoid TS_Packet::PESLeadIn( int NewLen ) {\n  int Offset = ( 188 - Free );\n  Buffer[Offset] = 0x00;\/\/PacketStartCodePrefix\n  Buffer[Offset+1] = 0x00;\/\/PacketStartCodePrefix (Cont)\n  Buffer[Offset+2] = 0x01;\/\/PacketStartCodePrefix (Cont)\n  Buffer[Offset+3] = 0xe0;\/\/StreamType Video\n  Buffer[Offset+4] = (NewLen & 0xFF00) >> 8;\/\/PES PacketLength\n  Buffer[Offset+5] = (NewLen & 0x00FF);\/\/PES PacketLength (Cont)\n  Buffer[Offset+6] = 0x80;\/\/Reserved + Flags\n  Buffer[Offset+7] = 0x80;\/\/PTSOnlyFlag + Flags\n  Buffer[Offset+8] = 0x05;\/\/PESHeaderDataLength\n  Buffer[Offset+9] = 0x20 + ((PCR() & 0x1C0000000) >> 29 ) + 1;\/\/PTS\n  Buffer[Offset+10] = 0x00 + ((PCR() & 0x03FC00000) >> 22 );\/\/PTS (Cont)\n  Buffer[Offset+11] = 0x00 + ((PCR() & 0x0003F8000) >> 14 ) + 1;\/\/PTS (Cont)\n  Buffer[Offset+12] = 0x00 + ((PCR() & 0x000008F10) >> 7 );\/\/PTS (Cont)\n  Buffer[Offset+13] = 0x00 + ((PCR() & 0x0000000EF) << 1) + 1;\/\/PTS (Cont)\n  \n  \/\/PesPacket-Wise Prepended Data\n  \n  Buffer[Offset+14] = 0x00;\/\/NALU StartCode\n  Buffer[Offset+15] = 0x00;\/\/NALU StartCode (Cont)\n  Buffer[Offset+16] = 0x00;\/\/NALU StartCode (Cont)\n  Buffer[Offset+17] = 0x01;\/\/NALU StartCode (Cont)\n  Buffer[Offset+18] = 0x09;\/\/NALU EndOfPacket (Einde Vorige Packet)\n  Buffer[Offset+19] = 0xF0;\/\/NALU EndOfPacket (Cont)\n  Free = Free - 20;\n  fprintf( stderr, \"\\tAdding PES Lead In with Offset %d and Size %d\\n\", Offset, NewLen );\n  fprintf( stderr, \"\\t\\tNew Free is %d\\n\", Free );\n}\n\nvoid TS_Packet::FillFree( std::string & NewVal ) {\n  int Offset = (188 - Free);\n  for( int i = 0; (Offset + i) < 188; i++ ) {\n    Buffer[Offset+i] = NewVal[i];\n  }\n  NewVal.erase(0,Free);\n  Free = 0;\n}\n\nvoid TS_Packet::AddStuffing( int NumBytes ) {\n  if( NumBytes < 0 ) { return; }\n  if( AdaptionField( ) == 3 ) {\n    int Offset = Buffer[4];\n    Buffer[4] = Offset + NumBytes - 1;\n    for( int i = 0; i < ( NumBytes -2 ); i ++ ) {\n      Buffer[Offset+i] = 0xFF;\n    }\n    Free -= NumBytes;\n  } else {\n    AdaptionField( 3 );\n    Buffer[4] = NumBytes - 1;\n    Buffer[5] = 0x00;\n    for( int i = 0; i < ( NumBytes -2 ); i ++ ) {\n      Buffer[6+i] = 0xFF;\n    }\n    Free -= NumBytes;\n  }\n}\n<commit_msg>Working video, though with some glitches, probably due to inconsistency in PTS increases<commit_after>#include \"ts_packet.h\"\n\nTS_Packet::TS_Packet() {\n  Clear( );\n}\n\nTS_Packet::TS_Packet( std::string & Data ) {\n  if( Data.size() < 188 ) {\n    Clear( );    \n  } else {\n    for( int i = 0; i < 188; i++ ) {\n      Buffer[i] = Data[i];\n    }\n    Data.erase(0,188);\n    Free = 0;\n  }\n}\n\nTS_Packet::~TS_Packet() { }\n\nvoid TS_Packet::PID( int NewVal ) {\n  Buffer[1] = (Buffer[1] & 0xE0) + ((NewVal & 0x1F00) >> 8 );\n  Buffer[2] = (NewVal & 0x00FF);\n  Free = std::min( Free, 185 );\n}\n\nint TS_Packet::PID() {\n  return (( Buffer[1] & 0x1F ) << 8 ) + Buffer[2];\n}\n\nvoid TS_Packet::ContinuityCounter( int NewVal ) {\n  Buffer[3] = ( Buffer[3] & 0xF0 ) + ( NewVal & 0x0F );\n  Free = std::min( Free, 184 );\n}\n\nint TS_Packet::ContinuityCounter() {\n  return ( Buffer[3] & 0x0F );\n}\n\nint TS_Packet::BytesFree( ) {\n  return Free;\n}\n\nvoid TS_Packet::Clear( ) {\n  Free = 187;\n  Buffer[0] = 0x47;\n  for( int i = 1; i < 188; i++ ) {\n    Buffer[i] = 0x00;\n  }\n  AdaptionField( 1 );\n}\n\nvoid TS_Packet::AdaptionField( int NewVal ) {\n  NewVal = NewVal % 4;\n  NewVal = NewVal << 4;\n  Buffer[3] = ( Buffer[3] & 0xCF ) + NewVal;\n  Free = std::min( Free, 184 );\n}\n\nint TS_Packet::AdaptionField( ) {\n  return ((Buffer[3] & 0x30) >> 4 ) >= 2;\n}\n\nvoid TS_Packet::PCR( int64_t NewVal ) {\n  NewVal += (0xF618 * 300);\n  Buffer[3] = (Buffer[3] | 0x30);\n  Buffer[4] = 7;\n  Buffer[5] = (Buffer[5] | 0x10 );\n  int64_t TmpVal = NewVal \/ 300;\n  Buffer[6] = (((TmpVal>>1)>>24) & 0xFF);\n  Buffer[7] = (((TmpVal>>1)>>16) & 0xFF);\n  Buffer[8] = (((TmpVal>>1)>>8) & 0xFF);\n  Buffer[9] = ((TmpVal>>1) & 0xFF);\n  int Remainder = NewVal % 300;\n  Buffer[10] = 0x7E + ((TmpVal & 0x01)<<7) + ((Remainder & 0x0100) >> 8 );\n  Buffer[11] = (Remainder & 0x00FF);\n  Free = std::min( Free, 176 );\n};\n\nint64_t TS_Packet::PCR( ) {\n  if( !AdaptionField() ) {\n    return -1;\n  }\n  if( !(Buffer[5] & 0x10 ) ) {\n    return -1;\n  }\n  int64_t Result = 0;\n  Result = (((((((Buffer[6] << 8) + Buffer[7]) << 8) + Buffer[8]) << 8) + Buffer[9]) << 1) + ( Buffer[10] & 0x80 );\n  Result = Result * 300;\n  Result += ((Buffer[10] & 0x01) << 8 + Buffer[11]);\n  return Result;\n}\n\nint TS_Packet::AdaptionFieldLen( ) {\n  if( !AdaptionField() ) {\n    return -1;\n  }\n  return (int)Buffer[4];\n}\n\nvoid TS_Packet::Print( ) {\n  std::cout << \"TS Packet: \" << (Buffer[0] == 0x47)\n            << \"\\n\\tNewUnit: \" << UnitStart()\n            << \"\\n\\tPID: \" << PID()\n            << \"\\n\\tContinuity Counter: \" << ContinuityCounter()\n            << \"\\n\\tAdaption Field: \" << AdaptionField() << \"\\n\";\n  if( AdaptionField() ) {\n    std::cout << \"\\t\\tAdaption Field Length: \" << AdaptionFieldLen() << \"\\n\";\n    if( AdaptionFieldLen() ) {\n      std::cout << \"\\t\\tRandom Access: \" << RandomAccess() << \"\\n\";\n    }\n    if( PCR() != -1 ) {\n      std::cout << \"\\t\\tPCR: \" << PCR() << \"( \" << (double)PCR() \/ 27000000 << \" s )\\n\";\n    }\n  }\n}\n\nint TS_Packet::UnitStart( ) {\n  return ( Buffer[1] & 0x40) >> 6;\n}\n\nvoid TS_Packet::UnitStart( int NewVal ) {\n  if( NewVal ) {\n    Buffer[1] = (Buffer[1] | 0x40);\n  } else {\n    Buffer[1] = (Buffer[1] & 0xBF);\n  }\n}\n\nint TS_Packet::RandomAccess( ) {\n  if( !AdaptionField() ) {\n    return -1;\n  }\n  return ( Buffer[5] & 0x40) >> 6;\n}\n\nvoid TS_Packet::RandomAccess( int NewVal ) {\n  if( AdaptionField() ) {\n    if( NewVal ) {\n      Buffer[5] = (Buffer[5] | 0x40);\n    } else {\n      Buffer[5] = (Buffer[5] & 0xBF);\n    }\n  } else {\n    Buffer[3] = (Buffer[3] | 0x30);\n    Buffer[4] = 1;\n    if( NewVal ) {\n      Buffer[5] = 0x40;\n    } else {\n      Buffer[5] = 0x00;\n    }\n    Free = 183;\n  }\n}\n\nvoid TS_Packet::DefaultPAT( ) {\n  static int MyCntr = 0;\n  UnitStart( 1 );\n  PID( 0 );\n  ContinuityCounter( MyCntr );\n  AdaptionField( 0x01 );\n  Buffer[ 4] = 0x00;\/\/Pointer Field\n  Buffer[ 5] = 0x00;\/\/TableID\n  Buffer[ 6] = 0xB0,\/\/Reserved + SectionLength\n  Buffer[ 7] = 0x0D;\/\/SectionLength (Cont)\n  Buffer[ 8] = 0x00;\/\/Transport_Stream_ID\n  Buffer[ 9] = 0x01;\/\/Transport_Stream_ID (Cont)\n  Buffer[10] = 0xC1;\/\/Reserved + VersionNumber + Current_Next_Indicator\n  Buffer[11] = 0x00;\/\/Section_Number\n  Buffer[12] = 0x00;\/\/Last_Section_Number\n  Buffer[13] = 0x00;  \/\/Program Number\n  Buffer[14] = 0x01;  \/\/Program Number (Cont)\n  Buffer[15] = 0xF0;  \/\/Reserved + Program_Map_PID\n  Buffer[16] = 0x00;  \/\/Program_Map_PID (Cont)\n  Buffer[17] = 0x2A;\/\/CRC32\n  Buffer[18] = 0xB1;\/\/CRC32 (Cont)\n  Buffer[19] = 0x04;\/\/CRC32 (Cont)\n  Buffer[20] = 0xB2;\/\/CRC32 (Cont)\n  std::fill( Buffer+21, Buffer+188, 0xFF );\n  Free = 0;\n  MyCntr = ( (MyCntr + 1) % 0xF);\n}\n\nvoid TS_Packet::DefaultPMT( ) {\n  static int MyCntr = 0;\n  UnitStart( 1 );\n  PID( 0x1000 );\n  ContinuityCounter( MyCntr );\n  AdaptionField( 0x01 );\n  Buffer[ 4] = 0x00;\/\/Pointer Field\n  Buffer[ 5] = 0x02;\/\/TableID\n  Buffer[ 6] = 0xb0;\/\/Reserved + Section_Length\n  Buffer[ 7] = 0x12;\/\/Section_Length (Cont)\n  Buffer[ 8] = 0x00;\/\/Program_Number\n  Buffer[ 9] = 0x01;\/\/Program_Number (Cont)\n  Buffer[10] = 0xc1;\/\/Reserved + VersionNumber + Current_Next_Indicator\n  Buffer[11] = 0x00;\/\/Section_Number\n  Buffer[12] = 0x00;\/\/Last_Section_Number\n  Buffer[13] = 0xe1;\/\/Reserved + PCR_PID\n  Buffer[14] = 0x00;\/\/PCR_PID (Cont)\n  Buffer[15] = 0xf0;\/\/Reserved + Program_Info_Length\n  Buffer[16] = 0x00;\/\/Program_Info_Length (Cont)\n  Buffer[17] = 0x1b;  \/\/Stream_Type\n  Buffer[18] = 0xe1;  \/\/Reserved + Elementary_PID\n  Buffer[19] = 0x00;  \/\/Elementary_PID (Cont)\n  Buffer[20] = 0xf0;  \/\/Reserved + ES_Info_Length\n  Buffer[21] = 0x00;  \/\/ES_Info_Length (Cont)\n  Buffer[22] = 0x15;\/\/CRC32\n  Buffer[23] = 0xbd;\/\/CRC32 (Cont)\n  Buffer[24] = 0x4d;\/\/CRC32 (Cont)\n  Buffer[25] = 0x56;\/\/CRC32 (Cont)\n  std::fill( Buffer+26, Buffer+188, 0xFF );\n  Free = 0;\n  MyCntr = ( (MyCntr + 1) % 0xF);\n}\n\nstd::string TS_Packet::ToString( ) {\n  std::string Result( Buffer, 188 );\n  return Result;\n}\n\nvoid TS_Packet::PESLeadIn( int NewLen ) {\n  static uint64_t PTS = 126000;\n  NewLen += 14;\n  int Offset = ( 188 - Free );\n  Buffer[Offset] = 0x00;\/\/PacketStartCodePrefix\n  Buffer[Offset+1] = 0x00;\/\/PacketStartCodePrefix (Cont)\n  Buffer[Offset+2] = 0x01;\/\/PacketStartCodePrefix (Cont)\n  Buffer[Offset+3] = 0xe0;\/\/StreamType Video\n  Buffer[Offset+4] = (NewLen & 0xFF00) >> 8;\/\/PES PacketLength\n  Buffer[Offset+5] = (NewLen & 0x00FF);\/\/PES PacketLength (Cont)\n  Buffer[Offset+6] = 0x80;\/\/Reserved + Flags\n  Buffer[Offset+7] = 0x80;\/\/PTSOnlyFlag + Flags\n  Buffer[Offset+8] = 0x05;\/\/PESHeaderDataLength\n  Buffer[Offset+9] = 0x20 + ((PTS & 0x1C0000000) >> 29 ) + 1;\/\/PTS\n  Buffer[Offset+10] = 0x00 + ((PTS & 0x03FC00000) >> 22 );\/\/PTS (Cont)\n  Buffer[Offset+11] = 0x00 + ((PTS & 0x0003F8000) >> 14 ) + 1;\/\/PTS (Cont)\n  Buffer[Offset+12] = 0x00 + ((PTS & 0x000007F10) >> 7 );\/\/PTS (Cont)\n  Buffer[Offset+13] = 0x00 + ((PTS & 0x00000007F) << 1) + 1;\/\/PTS (Cont)\n  \n  \/\/PesPacket-Wise Prepended Data\n  \n  Buffer[Offset+14] = 0x00;\/\/NALU StartCode\n  Buffer[Offset+15] = 0x00;\/\/NALU StartCode (Cont)\n  Buffer[Offset+16] = 0x00;\/\/NALU StartCode (Cont)\n  Buffer[Offset+17] = 0x01;\/\/NALU StartCode (Cont)\n  Buffer[Offset+18] = 0x09;\/\/NALU EndOfPacket (Einde Vorige Packet)\n  Buffer[Offset+19] = 0xF0;\/\/NALU EndOfPacket (Cont)\n  Free = Free - 20;\n  fprintf( stderr, \"\\tAdding PES Lead In with Offset %d and Size %d\\n\", Offset, NewLen );\n  fprintf( stderr, \"\\t\\tNew Free is %d\\n\", Free );\n  PTS += 3003;\n}\n\nvoid TS_Packet::FillFree( std::string & NewVal ) {\n  int Offset = (188 - Free);\n  for( int i = 0; (Offset + i) < 188; i++ ) {\n    Buffer[Offset+i] = NewVal[i];\n  }\n  NewVal.erase(0,Free);\n  Free = 0;\n}\n\nvoid TS_Packet::AddStuffing( int NumBytes ) {\n  if( NumBytes < 0 ) { return; }\n  if( AdaptionField( ) == 3 ) {\n    int Offset = Buffer[4];\n    Buffer[4] = Offset + NumBytes - 1;\n    for( int i = 0; i < ( NumBytes -2 ); i ++ ) {\n      Buffer[Offset+i] = 0xFF;\n    }\n    Free -= NumBytes;\n  } else {\n    AdaptionField( 3 );\n    Buffer[4] = NumBytes - 1;\n    Buffer[5] = 0x00;\n    for( int i = 0; i < ( NumBytes -2 ); i ++ ) {\n      Buffer[6+i] = 0xFF;\n    }\n    Free -= NumBytes;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Header$\n\n#include \"TrackGL.h\"\n#include <Reve\/Track.h>\n\n#include <TGLDrawFlags.h>\n\n#ifdef WIN32\n#include \"Windows4root.h\"\n#endif\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n\nusing namespace Reve;\n\n\/\/______________________________________________________________________\n\/\/ TrackGL\n\/\/\n\nClassImp(TrackGL)\n\nTrackGL::TrackGL() : LineGL()\n{\n  \/\/ fCached = false; \/\/ Disable display list.\n}\n\nTrackGL::~TrackGL()\n{}\n\n\/**************************************************************************\/\n\nBool_t TrackGL::SetModel(TObject* obj)\n{\n  if(LineGL::SetModel(obj) == kFALSE) return kFALSE;\n  if(SetModelCheckClass(obj, Track::Class())) {\n    fTrack = dynamic_cast<Track*>(obj);\n    return kTRUE;\n  }\n  return kFALSE;\n}\n\/**************************************************************************\/\n\nvoid TrackGL::ProcessSelection(UInt_t* ptr, TGLViewer*, TGLScene*)\n{\n  \/\/ Processes secondary selection from TGLViewer.\n  \/\/ Calls TPointSet3D::PointSelected(Int_t) with index of selected\n  \/\/ point as an argument.\n\n  Int_t n = ptr[0];\n  printf(\"TrackGL::ProcessSelection %d names on the stack (z1=%g, z2=%g).\\n\",\n\t n, Float_t(ptr[1])\/0x7fffffff, Float_t(ptr[2])\/0x7fffffff);\n  ptr += 3;\n  printf(\"  Names: \");\n  for (Int_t j=0; j<n; ++j, ++ptr) printf (\"%d \", *ptr);\n  printf(\"\\n\");\n\n  ((Track*)fM)->CtrlClicked((Track*)fM);\n}\n\n\/**************************************************************************\/\nvoid TrackGL::DirectDraw(const TGLDrawFlags & flags) const\n{\n  \/\/ Render line and path marks\n\n  LineGL::DirectDraw(flags);\n\n  if ( ! fTrack->fPathMarks.empty()){\n\n    TrackRnrStyle* rs = fTrack->GetRnrStyle();\n    Int_t  style = rs->fPMStyle;\n\n    UChar_t color[4];\n    ColorFromIdx(rs->fPMColor, color);\n    glColor4ubv(color);\n    \n    glPushAttrib(GL_POINT_BIT | GL_LINE_BIT | GL_ENABLE_BIT);\n    glDisable(GL_LIGHTING);\n\n    Int_t ms = rs->fPMStyle;\n    \/\/ points\n    if (ms != 2 && ms != 3 && ms != 5 && ms != 28) \n    {\n      Float_t size = 5*rs->fPMSize;\n      if (style == 4 || style == 20 || style == 24) \n      {\n\tif (style == 4 || style == 24)\n\t  glEnable(GL_BLEND);\n\tglEnable(GL_POINT_SMOOTH);\n      } \n      else \n      {\n\tglDisable(GL_POINT_SMOOTH);\n\tif      (style == 1) size = 1;\n\telse if (style == 6) size = 2;\n\telse if (style == 7) size = 3;\n      }\n      glPointSize(size);\n\n      glBegin(GL_POINTS);\n      Bool_t accept;\n      std::vector<PathMark*>& pm = fTrack->fPathMarks;\n      for(std::vector<PathMark*>::iterator i=pm.begin(); i!=pm.end(); ++i) \n      {\n\taccept = kFALSE;\n\tswitch((*i)->type)\n\t{\n\t  case(PathMark::Daughter):\n\t    if(rs->fRnrDaughters) accept = kTRUE;\n\t    break;\n\t  case(PathMark::Reference):\n\t    if(rs->fRnrReferences) accept = kTRUE;\n\t    break;\n\t  case(PathMark::Decay):\n\t    if(rs->fRnrDecay) accept = kTRUE;\n\t    break;\n\t} \n\tif(accept)\n\t{\n\t  if((TMath::Abs((*i)->V.z) < rs->fMaxZ) && (*i)->V.Perp() < rs->fMaxR*rs->fMaxR)\n\t    glVertex3f((*i)->V.x, (*i)->V.y,(*i)->V.z);\n\t}\n      } \n      glEnd();\n    } \/\/ end render points\n    else \n    {\n      \/\/ crosses\n      if ( style== 28) \n      {\n\tglEnable(GL_BLEND);\n\tglEnable(GL_LINE_SMOOTH);\n\tglLineWidth(2);\n      } \n      else \n      {\n\tglDisable(GL_LINE_SMOOTH);\n      }\n\n      glBegin(GL_LINES);\n      Bool_t accept;\n      Float_t d = 2* rs->fPMSize;\n      Float_t p[3];\n      std::vector<PathMark*>& pm = fTrack->fPathMarks;     \n      for(std::vector<PathMark*>::iterator i=pm.begin(); i!=pm.end(); ++i) \n      {\n\taccept = kFALSE;\n\tswitch((*i)->type)\n\t{\n\t  case(PathMark::Daughter):\n\t    if(rs->fRnrDaughters) accept = kTRUE;\n\t    break;\n\t  case(PathMark::Reference):\n\t    if(rs->fRnrReferences) accept = kTRUE;\n\t    break;\n\t  case(PathMark::Decay):\n\t    if(rs->fRnrDecay) accept = kTRUE;\n\t    break;\n\t} \n\tif(accept)\n\t{\n\t  if((TMath::Abs((*i)->V.z) < rs->fMaxZ) && (*i)->V.Perp() < rs->fMaxR*rs->fMaxR)\n\t  {\n\t    p[0] = (*i)->V.x; p[1] = (*i)->V.y; p[2] = (*i)->V.z;\n\t    glVertex3f(p[0]-d, p[1], p[2]); glVertex3f(p[0]+d, p[1], p[2]);\n\t    glVertex3f(p[0], p[1]-d, p[2]); glVertex3f(p[0], p[1]+d, p[2]);\n\t    glVertex3f(p[0], p[1], p[2]-d); glVertex3f(p[0], p[1], p[2]+d);\n\t  }\n\t}\n      } \n      glEnd();\n    } \/\/ end render corsses\n    glPopAttrib();\n  } \/\/if PM not empty\n}\n<commit_msg>Fix for checking boundaries of path-marks.<commit_after>\/\/ $Header$\n\n#include \"TrackGL.h\"\n#include <Reve\/Track.h>\n\n#include <TGLDrawFlags.h>\n\n#ifdef WIN32\n#include \"Windows4root.h\"\n#endif\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n\nusing namespace Reve;\n\n\/\/______________________________________________________________________\n\/\/ TrackGL\n\/\/\n\nClassImp(TrackGL)\n\nTrackGL::TrackGL() : LineGL()\n{\n  \/\/ fCached = false; \/\/ Disable display list.\n}\n\nTrackGL::~TrackGL()\n{}\n\n\/**************************************************************************\/\n\nBool_t TrackGL::SetModel(TObject* obj)\n{\n  if(LineGL::SetModel(obj) == kFALSE) return kFALSE;\n  if(SetModelCheckClass(obj, Track::Class())) {\n    fTrack = dynamic_cast<Track*>(obj);\n    return kTRUE;\n  }\n  return kFALSE;\n}\n\/**************************************************************************\/\n\nvoid TrackGL::ProcessSelection(UInt_t* ptr, TGLViewer*, TGLScene*)\n{\n  \/\/ Processes secondary selection from TGLViewer.\n  \/\/ Calls TPointSet3D::PointSelected(Int_t) with index of selected\n  \/\/ point as an argument.\n\n  Int_t n = ptr[0];\n  printf(\"TrackGL::ProcessSelection %d names on the stack (z1=%g, z2=%g).\\n\",\n\t n, Float_t(ptr[1])\/0x7fffffff, Float_t(ptr[2])\/0x7fffffff);\n  ptr += 3;\n  printf(\"  Names: \");\n  for (Int_t j=0; j<n; ++j, ++ptr) printf (\"%d \", *ptr);\n  printf(\"\\n\");\n\n  ((Track*)fM)->CtrlClicked((Track*)fM);\n}\n\n\/**************************************************************************\/\nvoid TrackGL::DirectDraw(const TGLDrawFlags & flags) const\n{\n  \/\/ Render line and path marks\n\n  LineGL::DirectDraw(flags);\n\n  if ( ! fTrack->fPathMarks.empty()){\n\n    TrackRnrStyle* rs = fTrack->GetRnrStyle();\n    Int_t  style = rs->fPMStyle;\n\n    UChar_t color[4];\n    ColorFromIdx(rs->fPMColor, color);\n    glColor4ubv(color);\n    \n    glPushAttrib(GL_POINT_BIT | GL_LINE_BIT | GL_ENABLE_BIT);\n    glDisable(GL_LIGHTING);\n\n    Int_t ms = rs->fPMStyle;\n    \/\/ points\n    if (ms != 2 && ms != 3 && ms != 5 && ms != 28) \n    {\n      Float_t size = 5*rs->fPMSize;\n      if (style == 4 || style == 20 || style == 24) \n      {\n\tif (style == 4 || style == 24)\n\t  glEnable(GL_BLEND);\n\tglEnable(GL_POINT_SMOOTH);\n      } \n      else \n      {\n\tglDisable(GL_POINT_SMOOTH);\n\tif      (style == 1) size = 1;\n\telse if (style == 6) size = 2;\n\telse if (style == 7) size = 3;\n      }\n      glPointSize(size);\n\n      glBegin(GL_POINTS);\n      Bool_t accept;\n      std::vector<PathMark*>& pm = fTrack->fPathMarks;\n      for(std::vector<PathMark*>::iterator i=pm.begin(); i!=pm.end(); ++i) \n      {\n\taccept = kFALSE;\n\tswitch((*i)->type)\n\t{\n\t  case(PathMark::Daughter):\n\t    if(rs->fRnrDaughters) accept = kTRUE;\n\t    break;\n\t  case(PathMark::Reference):\n\t    if(rs->fRnrReferences) accept = kTRUE;\n\t    break;\n\t  case(PathMark::Decay):\n\t    if(rs->fRnrDecay) accept = kTRUE;\n\t    break;\n\t} \n\tif(accept)\n\t{\n\t  if((TMath::Abs((*i)->V.z) < rs->fMaxZ) && ((*i)->V.Perp() < rs->fMaxR))\n\t    glVertex3f((*i)->V.x, (*i)->V.y,(*i)->V.z);\n\t}\n      } \n      glEnd();\n    } \/\/ end render points\n    else \n    {\n      \/\/ crosses\n      if ( style== 28) \n      {\n\tglEnable(GL_BLEND);\n\tglEnable(GL_LINE_SMOOTH);\n\tglLineWidth(2);\n      } \n      else \n      {\n\tglDisable(GL_LINE_SMOOTH);\n      }\n\n      glBegin(GL_LINES);\n      Bool_t accept;\n      Float_t d = 2* rs->fPMSize;\n      Float_t p[3];\n      std::vector<PathMark*>& pm = fTrack->fPathMarks;     \n      for(std::vector<PathMark*>::iterator i=pm.begin(); i!=pm.end(); ++i) \n      {\n\taccept = kFALSE;\n\tswitch((*i)->type)\n\t{\n\t  case(PathMark::Daughter):\n\t    if(rs->fRnrDaughters) accept = kTRUE;\n\t    break;\n\t  case(PathMark::Reference):\n\t    if(rs->fRnrReferences) accept = kTRUE;\n\t    break;\n\t  case(PathMark::Decay):\n\t    if(rs->fRnrDecay) accept = kTRUE;\n\t    break;\n\t} \n\tif(accept)\n\t{\n\t  if((TMath::Abs((*i)->V.z) < rs->fMaxZ) && ((*i)->V.Perp() < rs->fMaxR))\n\t  {\n\t    p[0] = (*i)->V.x; p[1] = (*i)->V.y; p[2] = (*i)->V.z;\n\t    glVertex3f(p[0]-d, p[1], p[2]); glVertex3f(p[0]+d, p[1], p[2]);\n\t    glVertex3f(p[0], p[1]-d, p[2]); glVertex3f(p[0], p[1]+d, p[2]);\n\t    glVertex3f(p[0], p[1], p[2]-d); glVertex3f(p[0], p[1], p[2]+d);\n\t  }\n\t}\n      } \n      glEnd();\n    } \/\/ end render corsses\n    glPopAttrib();\n  } \/\/if PM not empty\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2007  Benjamin S. Kirk, John W. Peterson\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\/\/ Local includes\n#include \"boundary_info.h\"\n#include \"elem.h\"\n#include \"libmesh_logging.h\"\n#include \"parallel_mesh.h\"\n#include \"parallel.h\"\n\n\/\/ ------------------------------------------------------------\n\/\/ ParallelMesh class member functions\nParallelMesh::ParallelMesh (unsigned int d) :\n  UnstructuredMesh (d)\n{\n}\n\n\nParallelMesh::~ParallelMesh ()\n{\n  this->clear();  \/\/ Free nodes and elements\n}\n\n\n\/\/ This might be specialized later, but right now it's just here to\n\/\/ make sure the compiler doesn't give us a default (non-deep) copy\n\/\/ constructor instead.\nParallelMesh::ParallelMesh (const ParallelMesh &other_mesh) :\n  UnstructuredMesh (other_mesh)\n{\n  this->copy_nodes_and_elements(other_mesh);\n}\n\n\n\nParallelMesh::ParallelMesh (const UnstructuredMesh &other_mesh) :\n  UnstructuredMesh (other_mesh)\n{\n  this->copy_nodes_and_elements(other_mesh);\n}\n\n\n\nconst Point& ParallelMesh::point (const unsigned int i) const\n{\n  assert (i < this->max_node_id());\n  assert (_nodes[i] != NULL);\n  assert (_nodes[i]->id() != Node::invalid_id);  \n\n  return (*_nodes[i]);\n}\n\n\n\n\n\nconst Node& ParallelMesh::node (const unsigned int i) const\n{\n  assert (i < this->max_node_id());\n  assert (_nodes[i] != NULL);\n  assert (_nodes[i]->id() != Node::invalid_id);  \n  \n  return (*_nodes[i]);\n}\n\n\n\n\n\nNode& ParallelMesh::node (const unsigned int i)\n{\n  assert (i < this->max_node_id());\n  assert (_nodes[i] != NULL);\n  assert (_nodes[i]->id() != Node::invalid_id);  \n\n  return (*_nodes[i]);\n}\n\n\n\nconst Node* ParallelMesh::node_ptr (const unsigned int i) const\n{\n  assert (i < this->max_node_id());\n  assert (_nodes[i] != NULL);\n  assert (_nodes[i]->id() != Node::invalid_id);  \n  \n  return _nodes[i];\n}\n\n\n\n\nNode* & ParallelMesh::node_ptr (const unsigned int i)\n{\n  assert (i < this->max_node_id());\n\n  return _nodes[i];\n}\n\n\n\n\nElem* ParallelMesh::elem (const unsigned int i) const\n{\n  assert (i < this->max_elem_id());\n  assert (_elements[i] != NULL);\n  \n  return _elements[i];\n}\n\n\n\n\nElem* ParallelMesh::add_elem (Elem* e)\n{\n  if (e != NULL)\n    e->set_id (this->max_elem_id());\n  \n  _elements[this->max_elem_id()] = e;\n\n  return e;\n}\n\n\n\nElem* ParallelMesh::insert_elem (Elem* e)\n{\n  if (_elements[e->id()])\n    this->delete_elem(_elements[e->id()]);\n\n  _elements[e->id()] = e;\n\n  return e;\n}\n\n\n\nvoid ParallelMesh::delete_elem(Elem* e)\n{\n  assert (e != NULL);\n\n  \/\/ Delete the element from the BoundaryInfo object\n  this->boundary_info->remove(e);\n\n  \/\/ But not yet from the container; we might invalidate\n  \/\/ an iterator that way!\n\n  \/\/_elements.erase(e->id());\n\n  \/\/ Instead, we set it to NULL for now\n\n  _elements[e->id()] = NULL;\n  \n  \/\/ delete the element\n  delete e;\n}\n\n\n\nNode* ParallelMesh::add_point (const Point& p)\n{  \n  Node* n = Node::build(p, this->max_node_id()).release();\n  _nodes[this->max_node_id()] = n;\n  \n  return n;\n}\n\n\n\nvoid ParallelMesh::delete_node(Node* n)\n{\n  assert (n != NULL);\n  assert (n->id() < this->max_node_id());\n\n  \/\/ Delete the node from the BoundaryInfo object\n  this->boundary_info->remove(n);\n\n  \/\/ And from the container\n  _nodes.erase(n->id());\n  \n  \/\/ delete the node\n  delete n;\n}\n\n\n\nvoid ParallelMesh::clear ()\n{\n  \/\/ Call parent clear function\n  MeshBase::clear();\n\n  \n  \/\/ Clear our elements and nodes\n  {\n    elem_iterator_imp        it = _elements.begin();\n    const elem_iterator_imp end = _elements.end();\n\n    \/\/ There is no need to remove the elements from\n    \/\/ the BoundaryInfo data structure since we\n    \/\/ already cleared it.\n    for (; it != end; ++it)\n      delete *it;\n\n    _elements.clear();\n  }\n\n  \/\/ clear the nodes data structure\n  {\n    node_iterator_imp it  = _nodes.begin();\n    node_iterator_imp end = _nodes.end();\n\n    \/\/ There is no need to remove the nodes from\n    \/\/ the BoundaryInfo data structure since we\n    \/\/ already cleared it.\n    for (; it != end; ++it)\n      delete *it;\n    \n    _nodes.clear();\n  }\n}\n\n\n\ntemplate <typename T>\nvoid ParallelMesh::renumber_dof_objects (mapvector<T*> &objects)\n{\n  typedef typename mapvector<T*>::veclike_iterator object_iterator;\n\n  \/\/ In parallel we may not know what objects other processors have.\n  \/\/ Start by figuring out how many\n  unsigned int objects_on_me = 0;\n  unsigned int unpartitioned_objects = 0;\n\n  object_iterator it  = objects.begin();\n  object_iterator end = objects.end();\n\n  for (; it != end;)\n    {\n      T *obj = *it;\n\n      \/\/ Remove any NULL container entries while we're here,\n      \/\/ being careful not to invalidate our iterator\n      if (!*it)\n        objects.erase(it++);\n      else\n        {\n          unsigned int obj_procid = obj->processor_id();\n          if (obj_procid == libMesh::processor_id())\n            objects_on_me++;\n          else if (obj_procid == DofObject::invalid_processor_id)\n            unpartitioned_objects++;\n          ++it;\n        }\n    }\n\n  std::vector<unsigned int> objects_on_proc(libMesh::n_processors(), 0);\n  Parallel::allgather(objects_on_me, objects_on_proc);\n\n#ifdef DEBUG\n  unsigned int global_unpartitioned_objects = unpartitioned_objects;\n  Parallel::max(global_unpartitioned_objects);\n  assert(global_unpartitioned_objects == unpartitioned_objects);\n#endif\n\n  \/\/ We'll renumber objects in blocks by processor id\n  std::vector<unsigned int> first_object_on_proc(libMesh::n_processors());\n  for (unsigned int i=1; i != libMesh::n_processors(); ++i)\n    first_object_on_proc[i] = first_object_on_proc[i-1] +\n                              objects_on_proc[i-1];\n  unsigned int next_id = first_object_on_proc[libMesh::processor_id()];\n\n  \/\/ First set new local object ids and build request sets \n  \/\/ for non-local object ids\n  \n  \/\/ Request sets to send to each processor\n  std::vector<std::vector<unsigned int> >\n    requested_ids(libMesh::n_processors());\n\n  \/\/ We know how many objects live on each processor, so reseve() space for\n  \/\/ each.\n  for (unsigned int p=0; p != libMesh::n_processors(); ++p)\n    if (p != libMesh::processor_id())\n      requested_ids[p].reserve(objects_on_proc[p]);\n\n  end = objects.end();\n  for (it = objects.begin(); it != end; ++it)\n    {\n      T *obj = *it;\n      if (obj->processor_id() == libMesh::processor_id())\n        obj->set_id(next_id++);\n      else if (obj->processor_id() != DofObject::invalid_processor_id)\n        requested_ids[obj->processor_id()].push_back(obj->id());\n    }\n\n  \/\/ Next set ghost object ids from other processors\n  if (libMesh::n_processors() > 1)\n    {\n      for (unsigned int p=1; p != libMesh::n_processors(); ++p)\n        {\n          \/\/ Trade my requests with processor procup and procdown\n          unsigned int procup = (libMesh::processor_id() + p) %\n                                 libMesh::n_processors();\n          unsigned int procdown = (libMesh::n_processors() +\n                                   libMesh::processor_id() - p) %\n                                   libMesh::n_processors();\n          std::vector<unsigned int> request_to_fill;\n          Parallel::send_receive(procup, requested_ids[procup],\n                                 procdown, request_to_fill);\n\n          \/\/ Fill those requests\n          std::vector<unsigned int> new_ids(request_to_fill.size());\n          for (unsigned int i=0; i != request_to_fill.size(); ++i)\n            {\n              assert(objects[request_to_fill[i]]);\n              assert(objects[request_to_fill[i]]->processor_id()\n                     == libMesh::processor_id());\n              new_ids[i] = objects[request_to_fill[i]]->id();\n              assert(new_ids[i] >=\n                     first_object_on_proc[libMesh::processor_id()]);\n              assert(new_ids[i] <\n                     first_object_on_proc[libMesh::processor_id()] +\n                     objects_on_proc[libMesh::processor_id()]);\n            }\n\n          \/\/ Trade back the results\n          std::vector<unsigned int> filled_request;\n          Parallel::send_receive(procdown, new_ids,\n                                 procup, filled_request);\n\n          \/\/ And copy the id changes we've now been informed of\n          for (unsigned int i=0; i != filled_request.size(); ++i)\n            {\n              assert (objects[requested_ids[procup][i]]->processor_id()\n                      == procup);\n              assert(filled_request[i] >=\n                     first_object_on_proc[procup]);\n              assert(filled_request[i] <\n                     first_object_on_proc[procup] +\n                     objects_on_proc[procup]);\n              objects[requested_ids[procup][i]]->set_id(filled_request[i]);\n            }\n        }\n    }\n\n  \/\/ Next set unpartitioned object ids\n  next_id = 0;\n  for (unsigned int i=0; i != libMesh::n_processors(); ++i)\n    next_id += objects_on_proc[i];\n  for (it = objects.begin(); it != end; ++it)\n    {\n      T *obj = *it;\n      if (obj->processor_id() == DofObject::invalid_processor_id)\n        obj->set_id(next_id++);\n    }\n\n  \/\/ Finally shuffle around objects so that container indices\n  \/\/ match ids\n  end = objects.end();\n  for (it = objects.begin(); it != end;)\n    {\n      T *obj = *it;\n      if (obj) \/\/ don't try shuffling already-NULL entries\n        {\n          T *next = objects[obj->id()];\n          \/\/ If we have to move this object\n          if (next != obj)\n            {\n              \/\/ NULL out its original position for now\n              \/\/ (our shuffling may put another object there shortly)\n              *it = NULL;\n\n              \/\/ There may already be another object with this id that\n              \/\/ needs to be moved itself\n              while (next)\n                {\n                  \/\/ We shouldn't be trying to give two objects the\n                  \/\/ same id\n                  assert (next->id() != obj->id());\n                  objects[obj->id()] = obj;\n                  obj = next;\n                  next = objects[obj->id()];\n                }\n              objects[obj->id()] = obj;\n            }\n        }\n      \/\/ Remove any container entries that were left as NULL,\n      \/\/ being careful not to invalidate our iterator\n      if (!*it)\n        objects.erase(it++);\n      else\n        ++it;\n    }\n}\n\n\nvoid ParallelMesh::renumber_nodes_and_elements ()\n{\n  START_LOG(\"renumber_nodes_and_elem()\", \"Mesh\");\n\n  std::set<unsigned int> used_nodes;\n\n  \/\/ flag the nodes we need\n  {      \n    element_iterator  it = elements_begin();\n    element_iterator end = elements_end();\n\n    for (; it != end; ++it)\n      {\n        Elem *elem = *it;\n\n        for (unsigned int n=0; n != elem->n_nodes(); ++n)\n          used_nodes.insert(elem->node(n));\n      }\n  }\n\n  \/\/ Nodes not connected to any local elements are deleted\n  {\n    node_iterator_imp  it = _nodes.begin();\n    node_iterator_imp end = _nodes.end();\n\n    for (; it != end;)\n      {\n\tNode *node = *it;\n        if (used_nodes.find(node->id()) == used_nodes.end())\n          {\n\t    \/\/ remove any boundary information associated with\n\t    \/\/ this node\n\t    this->boundary_info->remove (node);\n\n\t    \/\/ delete the node\n\t    delete node;\n\n            _nodes.erase(it++);\n\t  }\n        else\n          ++it;\n      }\n  }\n\n  \/\/ Finally renumber all the elements\n  this->renumber_dof_objects (_elements);\n\n  \/\/ and all the remaining nodes\n  this->renumber_dof_objects (_nodes);\n\n  STOP_LOG(\"renumber_nodes_and_elem()\", \"Mesh\");\n}\n\n\n\nvoid ParallelMesh::delete_nonlocal_elements()\n{\n  std::vector<bool> local_nodes(this->max_node_id(), false);\n  std::vector<bool> semilocal_elems(this->max_elem_id(), false);\n\n  const_element_iterator l_elem_it = this->local_elements_begin(),\n                         l_end     = this->local_elements_end();\n  for (; l_elem_it != l_end; ++l_elem_it)\n    {\n      const Elem *elem = *l_elem_it;\n      for (unsigned int n=0; n != elem->n_nodes(); ++n)\n        local_nodes[elem->node(n)] = true;\n    }\n\n  element_iterator nl_elem_it = this->not_local_elements_begin(),\n                   nl_end     = this->not_local_elements_end();\n  for (; nl_elem_it != nl_end; ++nl_elem_it)\n    {\n      Elem *elem = *nl_elem_it;\n      for (unsigned int n=0; n != elem->n_nodes(); ++n)\n        if (local_nodes[elem->node(n)])\n          {\n            semilocal_elems[elem->id()] = true;\n            break;\n          }\n      if (!semilocal_elems[elem->id()])\n        {\n          \/\/ delete_elem doesn't currently invalidate element\n          \/\/ iterators... that had better not change\n          this->delete_elem(elem);\n        }\n    }\n\/\/  We eventually want to compact the _nodes and _elems vectors\n\/\/  But not do a repartition or anything\n\/\/  do not this->prepare_for_use();\n}\n\nvoid ParallelMesh::restore_nonlocal_elements()\n{\n  \/\/ Someday...\n  error();\n}\n<commit_msg>reserve() space for efficiency since the information we need to do that is freely available.<commit_after>\/\/ $Id$\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2007  Benjamin S. Kirk, John W. Peterson\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\/\/ Local includes\n#include \"boundary_info.h\"\n#include \"elem.h\"\n#include \"libmesh_logging.h\"\n#include \"parallel_mesh.h\"\n#include \"parallel.h\"\n\n\/\/ ------------------------------------------------------------\n\/\/ ParallelMesh class member functions\nParallelMesh::ParallelMesh (unsigned int d) :\n  UnstructuredMesh (d)\n{\n}\n\n\nParallelMesh::~ParallelMesh ()\n{\n  this->clear();  \/\/ Free nodes and elements\n}\n\n\n\/\/ This might be specialized later, but right now it's just here to\n\/\/ make sure the compiler doesn't give us a default (non-deep) copy\n\/\/ constructor instead.\nParallelMesh::ParallelMesh (const ParallelMesh &other_mesh) :\n  UnstructuredMesh (other_mesh)\n{\n  this->copy_nodes_and_elements(other_mesh);\n}\n\n\n\nParallelMesh::ParallelMesh (const UnstructuredMesh &other_mesh) :\n  UnstructuredMesh (other_mesh)\n{\n  this->copy_nodes_and_elements(other_mesh);\n}\n\n\n\nconst Point& ParallelMesh::point (const unsigned int i) const\n{\n  assert (i < this->max_node_id());\n  assert (_nodes[i] != NULL);\n  assert (_nodes[i]->id() != Node::invalid_id);  \n\n  return (*_nodes[i]);\n}\n\n\n\n\n\nconst Node& ParallelMesh::node (const unsigned int i) const\n{\n  assert (i < this->max_node_id());\n  assert (_nodes[i] != NULL);\n  assert (_nodes[i]->id() != Node::invalid_id);  \n  \n  return (*_nodes[i]);\n}\n\n\n\n\n\nNode& ParallelMesh::node (const unsigned int i)\n{\n  assert (i < this->max_node_id());\n  assert (_nodes[i] != NULL);\n  assert (_nodes[i]->id() != Node::invalid_id);  \n\n  return (*_nodes[i]);\n}\n\n\n\nconst Node* ParallelMesh::node_ptr (const unsigned int i) const\n{\n  assert (i < this->max_node_id());\n  assert (_nodes[i] != NULL);\n  assert (_nodes[i]->id() != Node::invalid_id);  \n  \n  return _nodes[i];\n}\n\n\n\n\nNode* & ParallelMesh::node_ptr (const unsigned int i)\n{\n  assert (i < this->max_node_id());\n\n  return _nodes[i];\n}\n\n\n\n\nElem* ParallelMesh::elem (const unsigned int i) const\n{\n  assert (i < this->max_elem_id());\n  assert (_elements[i] != NULL);\n  \n  return _elements[i];\n}\n\n\n\n\nElem* ParallelMesh::add_elem (Elem* e)\n{\n  if (e != NULL)\n    e->set_id (this->max_elem_id());\n  \n  _elements[this->max_elem_id()] = e;\n\n  return e;\n}\n\n\n\nElem* ParallelMesh::insert_elem (Elem* e)\n{\n  if (_elements[e->id()])\n    this->delete_elem(_elements[e->id()]);\n\n  _elements[e->id()] = e;\n\n  return e;\n}\n\n\n\nvoid ParallelMesh::delete_elem(Elem* e)\n{\n  assert (e != NULL);\n\n  \/\/ Delete the element from the BoundaryInfo object\n  this->boundary_info->remove(e);\n\n  \/\/ But not yet from the container; we might invalidate\n  \/\/ an iterator that way!\n\n  \/\/_elements.erase(e->id());\n\n  \/\/ Instead, we set it to NULL for now\n\n  _elements[e->id()] = NULL;\n  \n  \/\/ delete the element\n  delete e;\n}\n\n\n\nNode* ParallelMesh::add_point (const Point& p)\n{  \n  Node* n = Node::build(p, this->max_node_id()).release();\n  _nodes[this->max_node_id()] = n;\n  \n  return n;\n}\n\n\n\nvoid ParallelMesh::delete_node(Node* n)\n{\n  assert (n != NULL);\n  assert (n->id() < this->max_node_id());\n\n  \/\/ Delete the node from the BoundaryInfo object\n  this->boundary_info->remove(n);\n\n  \/\/ And from the container\n  _nodes.erase(n->id());\n  \n  \/\/ delete the node\n  delete n;\n}\n\n\n\nvoid ParallelMesh::clear ()\n{\n  \/\/ Call parent clear function\n  MeshBase::clear();\n\n  \n  \/\/ Clear our elements and nodes\n  {\n    elem_iterator_imp        it = _elements.begin();\n    const elem_iterator_imp end = _elements.end();\n\n    \/\/ There is no need to remove the elements from\n    \/\/ the BoundaryInfo data structure since we\n    \/\/ already cleared it.\n    for (; it != end; ++it)\n      delete *it;\n\n    _elements.clear();\n  }\n\n  \/\/ clear the nodes data structure\n  {\n    node_iterator_imp it  = _nodes.begin();\n    node_iterator_imp end = _nodes.end();\n\n    \/\/ There is no need to remove the nodes from\n    \/\/ the BoundaryInfo data structure since we\n    \/\/ already cleared it.\n    for (; it != end; ++it)\n      delete *it;\n    \n    _nodes.clear();\n  }\n}\n\n\n\ntemplate <typename T>\nvoid ParallelMesh::renumber_dof_objects (mapvector<T*> &objects)\n{\n  typedef typename mapvector<T*>::veclike_iterator object_iterator;\n\n  \/\/ In parallel we may not know what objects other processors have.\n  \/\/ Start by figuring out how many\n  unsigned int objects_on_me = 0;\n  unsigned int unpartitioned_objects = 0;\n\n  object_iterator it  = objects.begin();\n  object_iterator end = objects.end();\n\n  for (; it != end;)\n    {\n      T *obj = *it;\n\n      \/\/ Remove any NULL container entries while we're here,\n      \/\/ being careful not to invalidate our iterator\n      if (!*it)\n        objects.erase(it++);\n      else\n        {\n          unsigned int obj_procid = obj->processor_id();\n          if (obj_procid == libMesh::processor_id())\n            objects_on_me++;\n          else if (obj_procid == DofObject::invalid_processor_id)\n            unpartitioned_objects++;\n          ++it;\n        }\n    }\n\n  std::vector<unsigned int> objects_on_proc(libMesh::n_processors(), 0);\n  Parallel::allgather(objects_on_me, objects_on_proc);\n\n#ifdef DEBUG\n  unsigned int global_unpartitioned_objects = unpartitioned_objects;\n  Parallel::max(global_unpartitioned_objects);\n  assert(global_unpartitioned_objects == unpartitioned_objects);\n#endif\n\n  \/\/ We'll renumber objects in blocks by processor id\n  std::vector<unsigned int> first_object_on_proc(libMesh::n_processors());\n  for (unsigned int i=1; i != libMesh::n_processors(); ++i)\n    first_object_on_proc[i] = first_object_on_proc[i-1] +\n                              objects_on_proc[i-1];\n  unsigned int next_id = first_object_on_proc[libMesh::processor_id()];\n\n  \/\/ First set new local object ids and build request sets \n  \/\/ for non-local object ids\n  \n  \/\/ Request sets to send to each processor\n  std::vector<std::vector<unsigned int> >\n    requested_ids(libMesh::n_processors());\n\n  \/\/ We know how many objects live on each processor, so reseve() space for\n  \/\/ each.\n  for (unsigned int p=0; p != libMesh::n_processors(); ++p)\n    if (p != libMesh::processor_id())\n      requested_ids[p].reserve(objects_on_proc[p]);\n\n  end = objects.end();\n  for (it = objects.begin(); it != end; ++it)\n    {\n      T *obj = *it;\n      if (obj->processor_id() == libMesh::processor_id())\n        obj->set_id(next_id++);\n      else if (obj->processor_id() != DofObject::invalid_processor_id)\n        requested_ids[obj->processor_id()].push_back(obj->id());\n    }\n\n  \/\/ Next set ghost object ids from other processors\n  if (libMesh::n_processors() > 1)\n    {\n      for (unsigned int p=1; p != libMesh::n_processors(); ++p)\n        {\n          \/\/ Trade my requests with processor procup and procdown\n          unsigned int procup = (libMesh::processor_id() + p) %\n                                 libMesh::n_processors();\n          unsigned int procdown = (libMesh::n_processors() +\n                                   libMesh::processor_id() - p) %\n                                   libMesh::n_processors();\n          std::vector<unsigned int> request_to_fill;\n          Parallel::send_receive(procup, requested_ids[procup],\n                                 procdown, request_to_fill);\n\n          \/\/ Fill those requests\n          std::vector<unsigned int> new_ids(request_to_fill.size());\n          for (unsigned int i=0; i != request_to_fill.size(); ++i)\n            {\n              assert(objects[request_to_fill[i]]);\n              assert(objects[request_to_fill[i]]->processor_id()\n                     == libMesh::processor_id());\n              new_ids[i] = objects[request_to_fill[i]]->id();\n              assert(new_ids[i] >=\n                     first_object_on_proc[libMesh::processor_id()]);\n              assert(new_ids[i] <\n                     first_object_on_proc[libMesh::processor_id()] +\n                     objects_on_proc[libMesh::processor_id()]);\n            }\n\n          \/\/ Trade back the results\n          std::vector<unsigned int> filled_request;\n          Parallel::send_receive(procdown, new_ids,\n                                 procup, filled_request);\n\n          \/\/ And copy the id changes we've now been informed of\n          for (unsigned int i=0; i != filled_request.size(); ++i)\n            {\n              assert (objects[requested_ids[procup][i]]->processor_id()\n                      == procup);\n              assert(filled_request[i] >=\n                     first_object_on_proc[procup]);\n              assert(filled_request[i] <\n                     first_object_on_proc[procup] +\n                     objects_on_proc[procup]);\n              objects[requested_ids[procup][i]]->set_id(filled_request[i]);\n            }\n        }\n    }\n\n  \/\/ Next set unpartitioned object ids\n  next_id = 0;\n  for (unsigned int i=0; i != libMesh::n_processors(); ++i)\n    next_id += objects_on_proc[i];\n  for (it = objects.begin(); it != end; ++it)\n    {\n      T *obj = *it;\n      if (obj->processor_id() == DofObject::invalid_processor_id)\n        obj->set_id(next_id++);\n    }\n\n  \/\/ Finally shuffle around objects so that container indices\n  \/\/ match ids\n  end = objects.end();\n  for (it = objects.begin(); it != end;)\n    {\n      T *obj = *it;\n      if (obj) \/\/ don't try shuffling already-NULL entries\n        {\n          T *next = objects[obj->id()];\n          \/\/ If we have to move this object\n          if (next != obj)\n            {\n              \/\/ NULL out its original position for now\n              \/\/ (our shuffling may put another object there shortly)\n              *it = NULL;\n\n              \/\/ There may already be another object with this id that\n              \/\/ needs to be moved itself\n              while (next)\n                {\n                  \/\/ We shouldn't be trying to give two objects the\n                  \/\/ same id\n                  assert (next->id() != obj->id());\n                  objects[obj->id()] = obj;\n                  obj = next;\n                  next = objects[obj->id()];\n                }\n              objects[obj->id()] = obj;\n            }\n        }\n      \/\/ Remove any container entries that were left as NULL,\n      \/\/ being careful not to invalidate our iterator\n      if (!*it)\n        objects.erase(it++);\n      else\n        ++it;\n    }\n}\n\n\nvoid ParallelMesh::renumber_nodes_and_elements ()\n{\n  START_LOG(\"renumber_nodes_and_elem()\", \"Mesh\");\n\n  std::set<unsigned int> used_nodes;\n\n  \/\/ flag the nodes we need\n  {      \n    element_iterator  it = elements_begin();\n    element_iterator end = elements_end();\n\n    for (; it != end; ++it)\n      {\n        Elem *elem = *it;\n\n        for (unsigned int n=0; n != elem->n_nodes(); ++n)\n          used_nodes.insert(elem->node(n));\n      }\n  }\n\n  \/\/ Nodes not connected to any local elements are deleted\n  {\n    node_iterator_imp  it = _nodes.begin();\n    node_iterator_imp end = _nodes.end();\n\n    for (; it != end;)\n      {\n\tNode *node = *it;\n        if (!used_nodes.count(node->id()))\n          {\n\t    \/\/ remove any boundary information associated with\n\t    \/\/ this node\n\t    this->boundary_info->remove (node);\n\n\t    \/\/ delete the node\n\t    delete node;\n\n            _nodes.erase(it++);\n\t  }\n        else\n          ++it;\n      }\n  }\n\n  \/\/ Finally renumber all the elements\n  this->renumber_dof_objects (_elements);\n\n  \/\/ and all the remaining nodes\n  this->renumber_dof_objects (_nodes);\n\n  STOP_LOG(\"renumber_nodes_and_elem()\", \"Mesh\");\n}\n\n\n\nvoid ParallelMesh::delete_nonlocal_elements()\n{\n  std::vector<bool> local_nodes(this->max_node_id(), false);\n  std::vector<bool> semilocal_elems(this->max_elem_id(), false);\n\n  const_element_iterator l_elem_it = this->local_elements_begin(),\n                         l_end     = this->local_elements_end();\n  for (; l_elem_it != l_end; ++l_elem_it)\n    {\n      const Elem *elem = *l_elem_it;\n      for (unsigned int n=0; n != elem->n_nodes(); ++n)\n        local_nodes[elem->node(n)] = true;\n    }\n\n  element_iterator nl_elem_it = this->not_local_elements_begin(),\n                   nl_end     = this->not_local_elements_end();\n  for (; nl_elem_it != nl_end; ++nl_elem_it)\n    {\n      Elem *elem = *nl_elem_it;\n      for (unsigned int n=0; n != elem->n_nodes(); ++n)\n        if (local_nodes[elem->node(n)])\n          {\n            semilocal_elems[elem->id()] = true;\n            break;\n          }\n      if (!semilocal_elems[elem->id()])\n        {\n          \/\/ delete_elem doesn't currently invalidate element\n          \/\/ iterators... that had better not change\n          this->delete_elem(elem);\n        }\n    }\n\/\/  We eventually want to compact the _nodes and _elems vectors\n\/\/  But not do a repartition or anything\n\/\/  do not this->prepare_for_use();\n}\n\nvoid ParallelMesh::restore_nonlocal_elements()\n{\n  \/\/ Someday...\n  error();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: LockSequence.cxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: rt $ $Date: 2008-02-19 12:34: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_ucb.hxx\"\n\n#include <string.h>\n\n#ifndef NE_XML_H\n#include <ne_xml.h>\n#endif\n\n#ifndef _LOCKSEQUENCE_HXX_\n#include \"LockSequence.hxx\"\n#endif\n\nusing namespace webdav_ucp;\nusing namespace com::sun::star;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct LockSequenceParseContext\n{\n    ucb::Lock * pLock;\n    bool hasLockScope;\n    bool hasLockType;\n    bool hasDepth;\n    bool hasHREF;\n    bool hasTimeout;\n\n    LockSequenceParseContext()\n    : pLock( 0 ), hasLockScope( false ), hasLockType( false ),\n      hasDepth( false ), hasHREF( false ), hasTimeout( false ) {}\n\n    ~LockSequenceParseContext() { delete pLock; }\n};\n\n#define STATE_TOP (1)\n\n#define STATE_ACTIVELOCK    (STATE_TOP)\n#define STATE_LOCKSCOPE     (STATE_TOP + 1)\n#define STATE_LOCKTYPE      (STATE_TOP + 2)\n#define STATE_DEPTH         (STATE_TOP + 3)\n#define STATE_OWNER         (STATE_TOP + 4)\n#define STATE_TIMEOUT       (STATE_TOP + 5)\n#define STATE_LOCKTOKEN     (STATE_TOP + 6)\n#define STATE_EXCLUSIVE     (STATE_TOP + 7)\n#define STATE_SHARED        (STATE_TOP + 8)\n#define STATE_WRITE         (STATE_TOP + 9)\n#define STATE_HREF          (STATE_TOP + 10)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nextern \"C\" int LockSequence_startelement_callback(\n    void *,\n    int parent,\n    const char *nspace,\n    const char *name,\n    const char ** )\n{\n    if ( ( name != 0 ) &&\n         ( ( nspace == 0 ) || ( strcmp( nspace, \"\" ) == 0 ) ) )\n    {\n        switch ( parent )\n        {\n            case NE_XML_STATEROOT:\n                if ( strcmp( name, \"activelock\" ) == 0 )\n                    return STATE_ACTIVELOCK;\n                break;\n\n            case STATE_ACTIVELOCK:\n                if ( strcmp( name, \"lockscope\" ) == 0 )\n                    return STATE_LOCKSCOPE;\n                else if ( strcmp( name, \"locktype\" ) == 0 )\n                    return STATE_LOCKTYPE;\n                else if ( strcmp( name, \"depth\" ) == 0 )\n                    return STATE_DEPTH;\n                else if ( strcmp( name, \"owner\" ) == 0 )\n                    return STATE_OWNER;\n                else if ( strcmp( name, \"timeout\" ) == 0 )\n                    return STATE_TIMEOUT;\n                else if ( strcmp( name, \"locktoken\" ) == 0 )\n                    return STATE_LOCKTOKEN;\n                break;\n\n            case STATE_LOCKSCOPE:\n                if ( strcmp( name, \"exclusive\" ) == 0 )\n                    return STATE_EXCLUSIVE;\n                else if ( strcmp( name, \"shared\" ) == 0 )\n                    return STATE_SHARED;\n                break;\n\n            case STATE_LOCKTYPE:\n                if ( strcmp( name, \"write\" ) == 0 )\n                    return STATE_WRITE;\n                break;\n\n            case STATE_LOCKTOKEN:\n                if ( strcmp( name, \"href\" ) == 0 )\n                    return STATE_HREF;\n                break;\n\n            case STATE_OWNER:\n                \/\/ owner elem contains ANY. Accept anything; no state change.\n                return STATE_OWNER;\n        }\n    }\n    return NE_XML_DECLINE;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nextern \"C\" int LockSequence_chardata_callback(\n    void *userdata,\n    int state,\n    const char *buf,\n    size_t len )\n{\n    LockSequenceParseContext * pCtx\n                    = static_cast< LockSequenceParseContext * >( userdata );\n    if ( !pCtx->pLock )\n        pCtx->pLock = new ucb::Lock;\n\n    switch ( state )\n    {\n        case STATE_DEPTH:\n            if ( rtl_str_compareIgnoreAsciiCase_WithLength(\n                    buf, len, \"0\", 1 ) == 0 )\n            {\n                pCtx->pLock->Depth = ucb::LockDepth_ZERO;\n                pCtx->hasDepth = true;\n            }\n            else if ( rtl_str_compareIgnoreAsciiCase_WithLength(\n                    buf, len, \"1\", 1 ) == 0 )\n            {\n                pCtx->pLock->Depth = ucb::LockDepth_ONE;\n                pCtx->hasDepth = true;\n            }\n            else if ( rtl_str_compareIgnoreAsciiCase_WithLength(\n                    buf, len, \"infinity\", 8 ) == 0 )\n            {\n                pCtx->pLock->Depth = ucb::LockDepth_INFINITY;\n                pCtx->hasDepth = true;\n            }\n            else\n                OSL_ENSURE( sal_False,\n                            \"LockSequence_chardata_callback - Unknown depth!\" );\n            break;\n\n        case STATE_OWNER:\n        {\n            \/\/ collect raw XML data... (owner contains ANY)\n            rtl::OUString aValue;\n            pCtx->pLock->Owner >>= aValue;\n            aValue += rtl::OUString( buf, len, RTL_TEXTENCODING_ASCII_US );\n            pCtx->pLock->Owner <<= aValue;\n            break;\n        }\n\n        case STATE_TIMEOUT:\n            \/\/\n            \/\/  RFC2518, RFC2616:\n            \/\/\n            \/\/  TimeType = (\"Second-\" DAVTimeOutVal | \"Infinite\" | Other)\n            \/\/  DAVTimeOutVal = 1*digit\n            \/\/  Other = \"Extend\" field-value\n            \/\/  field-value = *( field-content | LWS )\n            \/\/  field-content = <the OCTETs making up the field-value\n            \/\/                  and consisting of either *TEXT or combinations\n            \/\/                  of token, separators, and quoted-string>\n\n            if ( rtl_str_compareIgnoreAsciiCase_WithLength(\n                    buf, len, \"Infinite\", 8 ) == 0 )\n            {\n                pCtx->pLock->Timeout = sal_Int64( -1 );\n                pCtx->hasTimeout = true;\n            }\n            else if ( rtl_str_shortenedCompareIgnoreAsciiCase_WithLength(\n                                            buf, len, \"Second-\", 7, 7 ) == 0 )\n            {\n                pCtx->pLock->Timeout\n                    = rtl::OString( buf + 7, len - 7 ).toInt64();\n                pCtx->hasTimeout = true;\n            }\n\/\/          else if ( rtl_str_shortenedCompareIgnoreCase_WithLength(\n\/\/                                          buf, len, \"Extend\", 6, 6 ) == 0 )\n\/\/          {\n\/\/              @@@\n\/\/          }\n            else\n            {\n                pCtx->pLock->Timeout = sal_Int64( -1 );\n                pCtx->hasTimeout = true;\n                OSL_ENSURE( sal_False,\n                        \"LockSequence_chardata_callback - Unknown timeout!\" );\n            }\n            break;\n\n        case STATE_HREF:\n        {\n            \/\/ collect hrefs.\n            sal_Int32 nPos = pCtx->pLock->LockTokens.getLength();\n            pCtx->pLock->LockTokens.realloc( nPos + 1 );\n            pCtx->pLock->LockTokens[ nPos ]\n                = rtl::OUString( buf, len, RTL_TEXTENCODING_ASCII_US );\n            pCtx->hasHREF = true;\n            break;\n        }\n\n    }\n    return 0; \/\/ zero to continue, non-zero to abort parsing\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nextern \"C\" int LockSequence_endelement_callback(\n    void *userdata,\n    int state,\n    const char *,\n    const char * )\n{\n    LockSequenceParseContext * pCtx\n                    = static_cast< LockSequenceParseContext * >( userdata );\n    if ( !pCtx->pLock )\n        pCtx->pLock = new ucb::Lock;\n\n    switch ( state )\n    {\n        case STATE_EXCLUSIVE:\n            pCtx->pLock->Scope = ucb::LockScope_EXCLUSIVE;\n            pCtx->hasLockScope = true;\n            break;\n\n        case STATE_SHARED:\n            pCtx->pLock->Scope = ucb::LockScope_SHARED;\n            pCtx->hasLockScope = true;\n            break;\n\n        case STATE_WRITE:\n            pCtx->pLock->Type = ucb::LockType_WRITE;\n            pCtx->hasLockType = true;\n            break;\n\n        case STATE_DEPTH:\n            if ( !pCtx->hasDepth )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_HREF:\n            if ( !pCtx->hasHREF )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_TIMEOUT:\n            if ( !pCtx->hasTimeout )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_LOCKSCOPE:\n            if ( !pCtx->hasLockScope )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_LOCKTYPE:\n            if ( !pCtx->hasLockType )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_ACTIVELOCK:\n            if ( !pCtx->hasLockType || !pCtx->hasLockType || !pCtx->hasDepth )\n                return 1; \/\/ abort\n            break;\n\n        default:\n            break;\n    }\n    return 0; \/\/ zero to continue, non-zero to abort parsing\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ static\nbool LockSequence::createFromXML( const rtl::OString & rInData,\n                                  uno::Sequence< ucb::Lock > & rOutData )\n{\n    const sal_Int32 TOKEN_LENGTH = 13; \/\/ <\/activelock>\n    bool success = true;\n\n    \/\/ rInData may contain multiple <activelock>...<\/activelock> tags.\n    sal_Int32 nCount = 0;\n    sal_Int32 nStart = 0;\n    sal_Int32 nEnd   = rInData.indexOf( \"<\/activelock>\" );\n    while ( nEnd > -1 )\n    {\n        ne_xml_parser * parser = ne_xml_create();\n        if ( !parser )\n        {\n            success = false;\n            break;\n        }\n\n        LockSequenceParseContext aCtx;\n        ne_xml_push_handler( parser,\n                             LockSequence_startelement_callback,\n                             LockSequence_chardata_callback,\n                             LockSequence_endelement_callback,\n                             &aCtx );\n\n        ne_xml_parse( parser,\n                      rInData.getStr() + nStart,\n                      nEnd - nStart + TOKEN_LENGTH );\n\n#if NEON_VERSION >= 0x0250\n        success = !ne_xml_failed( parser );\n#else\n        success = !!ne_xml_valid( parser );\n#endif\n\n        ne_xml_destroy( parser );\n\n        if ( !success )\n            break;\n\n        if ( aCtx.pLock )\n        {\n            nCount++;\n            if ( nCount > rOutData.getLength() )\n                rOutData.realloc( rOutData.getLength() + 1 );\n\n            rOutData[ nCount - 1 ] = *aCtx.pLock;\n        }\n\n        nStart = nEnd + TOKEN_LENGTH + 1;\n        nEnd   = rInData.indexOf( \"<\/activelock>\", nStart );\n    }\n\n    return success;\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.16.16); FILE MERGED 2008\/04\/01 16:02:26 thb 1.16.16.3: #i85898# Stripping all external header guards 2008\/04\/01 12:58:26 thb 1.16.16.2: #i85898# Stripping all external header guards 2008\/03\/31 15:30:31 rt 1.16.16.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: LockSequence.cxx,v $\n * $Revision: 1.17 $\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_ucb.hxx\"\n\n#include <string.h>\n#include <ne_xml.h>\n#include \"LockSequence.hxx\"\n\nusing namespace webdav_ucp;\nusing namespace com::sun::star;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct LockSequenceParseContext\n{\n    ucb::Lock * pLock;\n    bool hasLockScope;\n    bool hasLockType;\n    bool hasDepth;\n    bool hasHREF;\n    bool hasTimeout;\n\n    LockSequenceParseContext()\n    : pLock( 0 ), hasLockScope( false ), hasLockType( false ),\n      hasDepth( false ), hasHREF( false ), hasTimeout( false ) {}\n\n    ~LockSequenceParseContext() { delete pLock; }\n};\n\n#define STATE_TOP (1)\n\n#define STATE_ACTIVELOCK    (STATE_TOP)\n#define STATE_LOCKSCOPE     (STATE_TOP + 1)\n#define STATE_LOCKTYPE      (STATE_TOP + 2)\n#define STATE_DEPTH         (STATE_TOP + 3)\n#define STATE_OWNER         (STATE_TOP + 4)\n#define STATE_TIMEOUT       (STATE_TOP + 5)\n#define STATE_LOCKTOKEN     (STATE_TOP + 6)\n#define STATE_EXCLUSIVE     (STATE_TOP + 7)\n#define STATE_SHARED        (STATE_TOP + 8)\n#define STATE_WRITE         (STATE_TOP + 9)\n#define STATE_HREF          (STATE_TOP + 10)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nextern \"C\" int LockSequence_startelement_callback(\n    void *,\n    int parent,\n    const char *nspace,\n    const char *name,\n    const char ** )\n{\n    if ( ( name != 0 ) &&\n         ( ( nspace == 0 ) || ( strcmp( nspace, \"\" ) == 0 ) ) )\n    {\n        switch ( parent )\n        {\n            case NE_XML_STATEROOT:\n                if ( strcmp( name, \"activelock\" ) == 0 )\n                    return STATE_ACTIVELOCK;\n                break;\n\n            case STATE_ACTIVELOCK:\n                if ( strcmp( name, \"lockscope\" ) == 0 )\n                    return STATE_LOCKSCOPE;\n                else if ( strcmp( name, \"locktype\" ) == 0 )\n                    return STATE_LOCKTYPE;\n                else if ( strcmp( name, \"depth\" ) == 0 )\n                    return STATE_DEPTH;\n                else if ( strcmp( name, \"owner\" ) == 0 )\n                    return STATE_OWNER;\n                else if ( strcmp( name, \"timeout\" ) == 0 )\n                    return STATE_TIMEOUT;\n                else if ( strcmp( name, \"locktoken\" ) == 0 )\n                    return STATE_LOCKTOKEN;\n                break;\n\n            case STATE_LOCKSCOPE:\n                if ( strcmp( name, \"exclusive\" ) == 0 )\n                    return STATE_EXCLUSIVE;\n                else if ( strcmp( name, \"shared\" ) == 0 )\n                    return STATE_SHARED;\n                break;\n\n            case STATE_LOCKTYPE:\n                if ( strcmp( name, \"write\" ) == 0 )\n                    return STATE_WRITE;\n                break;\n\n            case STATE_LOCKTOKEN:\n                if ( strcmp( name, \"href\" ) == 0 )\n                    return STATE_HREF;\n                break;\n\n            case STATE_OWNER:\n                \/\/ owner elem contains ANY. Accept anything; no state change.\n                return STATE_OWNER;\n        }\n    }\n    return NE_XML_DECLINE;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nextern \"C\" int LockSequence_chardata_callback(\n    void *userdata,\n    int state,\n    const char *buf,\n    size_t len )\n{\n    LockSequenceParseContext * pCtx\n                    = static_cast< LockSequenceParseContext * >( userdata );\n    if ( !pCtx->pLock )\n        pCtx->pLock = new ucb::Lock;\n\n    switch ( state )\n    {\n        case STATE_DEPTH:\n            if ( rtl_str_compareIgnoreAsciiCase_WithLength(\n                    buf, len, \"0\", 1 ) == 0 )\n            {\n                pCtx->pLock->Depth = ucb::LockDepth_ZERO;\n                pCtx->hasDepth = true;\n            }\n            else if ( rtl_str_compareIgnoreAsciiCase_WithLength(\n                    buf, len, \"1\", 1 ) == 0 )\n            {\n                pCtx->pLock->Depth = ucb::LockDepth_ONE;\n                pCtx->hasDepth = true;\n            }\n            else if ( rtl_str_compareIgnoreAsciiCase_WithLength(\n                    buf, len, \"infinity\", 8 ) == 0 )\n            {\n                pCtx->pLock->Depth = ucb::LockDepth_INFINITY;\n                pCtx->hasDepth = true;\n            }\n            else\n                OSL_ENSURE( sal_False,\n                            \"LockSequence_chardata_callback - Unknown depth!\" );\n            break;\n\n        case STATE_OWNER:\n        {\n            \/\/ collect raw XML data... (owner contains ANY)\n            rtl::OUString aValue;\n            pCtx->pLock->Owner >>= aValue;\n            aValue += rtl::OUString( buf, len, RTL_TEXTENCODING_ASCII_US );\n            pCtx->pLock->Owner <<= aValue;\n            break;\n        }\n\n        case STATE_TIMEOUT:\n            \/\/\n            \/\/  RFC2518, RFC2616:\n            \/\/\n            \/\/  TimeType = (\"Second-\" DAVTimeOutVal | \"Infinite\" | Other)\n            \/\/  DAVTimeOutVal = 1*digit\n            \/\/  Other = \"Extend\" field-value\n            \/\/  field-value = *( field-content | LWS )\n            \/\/  field-content = <the OCTETs making up the field-value\n            \/\/                  and consisting of either *TEXT or combinations\n            \/\/                  of token, separators, and quoted-string>\n\n            if ( rtl_str_compareIgnoreAsciiCase_WithLength(\n                    buf, len, \"Infinite\", 8 ) == 0 )\n            {\n                pCtx->pLock->Timeout = sal_Int64( -1 );\n                pCtx->hasTimeout = true;\n            }\n            else if ( rtl_str_shortenedCompareIgnoreAsciiCase_WithLength(\n                                            buf, len, \"Second-\", 7, 7 ) == 0 )\n            {\n                pCtx->pLock->Timeout\n                    = rtl::OString( buf + 7, len - 7 ).toInt64();\n                pCtx->hasTimeout = true;\n            }\n\/\/          else if ( rtl_str_shortenedCompareIgnoreCase_WithLength(\n\/\/                                          buf, len, \"Extend\", 6, 6 ) == 0 )\n\/\/          {\n\/\/              @@@\n\/\/          }\n            else\n            {\n                pCtx->pLock->Timeout = sal_Int64( -1 );\n                pCtx->hasTimeout = true;\n                OSL_ENSURE( sal_False,\n                        \"LockSequence_chardata_callback - Unknown timeout!\" );\n            }\n            break;\n\n        case STATE_HREF:\n        {\n            \/\/ collect hrefs.\n            sal_Int32 nPos = pCtx->pLock->LockTokens.getLength();\n            pCtx->pLock->LockTokens.realloc( nPos + 1 );\n            pCtx->pLock->LockTokens[ nPos ]\n                = rtl::OUString( buf, len, RTL_TEXTENCODING_ASCII_US );\n            pCtx->hasHREF = true;\n            break;\n        }\n\n    }\n    return 0; \/\/ zero to continue, non-zero to abort parsing\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nextern \"C\" int LockSequence_endelement_callback(\n    void *userdata,\n    int state,\n    const char *,\n    const char * )\n{\n    LockSequenceParseContext * pCtx\n                    = static_cast< LockSequenceParseContext * >( userdata );\n    if ( !pCtx->pLock )\n        pCtx->pLock = new ucb::Lock;\n\n    switch ( state )\n    {\n        case STATE_EXCLUSIVE:\n            pCtx->pLock->Scope = ucb::LockScope_EXCLUSIVE;\n            pCtx->hasLockScope = true;\n            break;\n\n        case STATE_SHARED:\n            pCtx->pLock->Scope = ucb::LockScope_SHARED;\n            pCtx->hasLockScope = true;\n            break;\n\n        case STATE_WRITE:\n            pCtx->pLock->Type = ucb::LockType_WRITE;\n            pCtx->hasLockType = true;\n            break;\n\n        case STATE_DEPTH:\n            if ( !pCtx->hasDepth )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_HREF:\n            if ( !pCtx->hasHREF )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_TIMEOUT:\n            if ( !pCtx->hasTimeout )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_LOCKSCOPE:\n            if ( !pCtx->hasLockScope )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_LOCKTYPE:\n            if ( !pCtx->hasLockType )\n                return 1; \/\/ abort\n            break;\n\n        case STATE_ACTIVELOCK:\n            if ( !pCtx->hasLockType || !pCtx->hasLockType || !pCtx->hasDepth )\n                return 1; \/\/ abort\n            break;\n\n        default:\n            break;\n    }\n    return 0; \/\/ zero to continue, non-zero to abort parsing\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ static\nbool LockSequence::createFromXML( const rtl::OString & rInData,\n                                  uno::Sequence< ucb::Lock > & rOutData )\n{\n    const sal_Int32 TOKEN_LENGTH = 13; \/\/ <\/activelock>\n    bool success = true;\n\n    \/\/ rInData may contain multiple <activelock>...<\/activelock> tags.\n    sal_Int32 nCount = 0;\n    sal_Int32 nStart = 0;\n    sal_Int32 nEnd   = rInData.indexOf( \"<\/activelock>\" );\n    while ( nEnd > -1 )\n    {\n        ne_xml_parser * parser = ne_xml_create();\n        if ( !parser )\n        {\n            success = false;\n            break;\n        }\n\n        LockSequenceParseContext aCtx;\n        ne_xml_push_handler( parser,\n                             LockSequence_startelement_callback,\n                             LockSequence_chardata_callback,\n                             LockSequence_endelement_callback,\n                             &aCtx );\n\n        ne_xml_parse( parser,\n                      rInData.getStr() + nStart,\n                      nEnd - nStart + TOKEN_LENGTH );\n\n#if NEON_VERSION >= 0x0250\n        success = !ne_xml_failed( parser );\n#else\n        success = !!ne_xml_valid( parser );\n#endif\n\n        ne_xml_destroy( parser );\n\n        if ( !success )\n            break;\n\n        if ( aCtx.pLock )\n        {\n            nCount++;\n            if ( nCount > rOutData.getLength() )\n                rOutData.realloc( rOutData.getLength() + 1 );\n\n            rOutData[ nCount - 1 ] = *aCtx.pLock;\n        }\n\n        nStart = nEnd + TOKEN_LENGTH + 1;\n        nEnd   = rInData.indexOf( \"<\/activelock>\", nStart );\n    }\n\n    return success;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2017 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 \"util\/linux\/exception_handler_client.h\"\n\n#include <errno.h>\n#include <sys\/prctl.h>\n#include <sys\/socket.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include \"base\/logging.h\"\n#include \"base\/posix\/eintr_wrapper.h\"\n#include \"util\/file\/file_io.h\"\n#include \"util\/linux\/ptrace_broker.h\"\n#include \"util\/posix\/signals.h\"\n\nnamespace crashpad {\n\nExceptionHandlerClient::ExceptionHandlerClient(int sock)\n    : server_sock_(sock), ptracer_(-1), can_set_ptracer_(true) {}\n\nExceptionHandlerClient::~ExceptionHandlerClient() = default;\n\nint ExceptionHandlerClient::RequestCrashDump(const ClientInformation& info) {\n  int status = SendCrashDumpRequest(info);\n  if (status != 0) {\n    return status;\n  }\n  return WaitForCrashDumpComplete();\n}\n\nint ExceptionHandlerClient::SetPtracer(pid_t pid) {\n  if (ptracer_ == pid) {\n    return 0;\n  }\n\n  if (!can_set_ptracer_) {\n    return EPERM;\n  }\n\n  if (prctl(PR_SET_PTRACER, pid, 0, 0, 0) == 0) {\n    return 0;\n  }\n  return errno;\n}\n\nvoid ExceptionHandlerClient::SetCanSetPtracer(bool can_set_ptracer) {\n  can_set_ptracer_ = can_set_ptracer;\n}\n\nint ExceptionHandlerClient::SendCrashDumpRequest(\n    const ClientInformation& info) {\n  ClientToServerMessage message;\n  message.type = ClientToServerMessage::kCrashDumpRequest;\n  message.client_info = info;\n\n  iovec iov;\n  iov.iov_base = &message;\n  iov.iov_len = sizeof(message);\n\n  msghdr msg;\n  msg.msg_name = nullptr;\n  msg.msg_namelen = 0;\n  msg.msg_iov = &iov;\n  msg.msg_iovlen = 1;\n\n  ucred creds;\n  creds.pid = getpid();\n  creds.uid = geteuid();\n  creds.gid = getegid();\n\n  char cmsg_buf[CMSG_SPACE(sizeof(creds))];\n  msg.msg_control = cmsg_buf;\n  msg.msg_controllen = sizeof(cmsg_buf);\n\n  cmsghdr* cmsg = CMSG_FIRSTHDR(&msg);\n  cmsg->cmsg_level = SOL_SOCKET;\n  cmsg->cmsg_type = SCM_CREDENTIALS;\n  cmsg->cmsg_len = CMSG_LEN(sizeof(creds));\n  *reinterpret_cast<ucred*>(CMSG_DATA(cmsg)) = creds;\n\n  if (sendmsg(server_sock_, &msg, MSG_NOSIGNAL) < 0) {\n    PLOG(ERROR) << \"sendmsg\";\n    return errno;\n  }\n\n  return 0;\n}\n\nint ExceptionHandlerClient::WaitForCrashDumpComplete() {\n  ServerToClientMessage message;\n\n  \/\/ If the server hangs up, ReadFileExactly will return false without setting\n  \/\/ errno.\n  errno = 0;\n  while (ReadFileExactly(server_sock_, &message, sizeof(message))) {\n    switch (message.type) {\n      case ServerToClientMessage::kTypeForkBroker: {\n        Signals::InstallDefaultHandler(SIGCHLD);\n\n        pid_t pid = fork();\n        if (pid < 0) {\n          Errno error = errno;\n          if (!WriteFile(server_sock_, &error, sizeof(error))) {\n            return errno;\n          }\n          continue;\n        }\n\n        if (pid == 0) {\n#if defined(ARCH_CPU_64_BITS)\n          constexpr bool am_64_bit = true;\n#else\n          constexpr bool am_64_bit = false;\n#endif  \/\/ ARCH_CPU_64_BITS\n\n          PtraceBroker broker(server_sock_, am_64_bit);\n          _exit(broker.Run());\n        }\n\n        int status = 0;\n        pid_t child = HANDLE_EINTR(waitpid(pid, &status, 0));\n        DCHECK_EQ(child, pid);\n\n        if (child == pid && status != 0) {\n          return status;\n        }\n        continue;\n      }\n\n      case ServerToClientMessage::kTypeSetPtracer: {\n        Errno result = SetPtracer(message.pid);\n        if (!WriteFile(server_sock_, &result, sizeof(result))) {\n          return errno;\n        }\n        continue;\n      }\n\n      case ServerToClientMessage::kTypeCrashDumpComplete:\n      case ServerToClientMessage::kTypeCrashDumpFailed:\n        return 0;\n    }\n\n    DCHECK(false);\n  }\n\n  return errno;\n}\n\n}  \/\/ namespace crashpad\n<commit_msg>linux: Add missing build_config.h include<commit_after>\/\/ Copyright 2017 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 \"util\/linux\/exception_handler_client.h\"\n\n#include <errno.h>\n#include <sys\/prctl.h>\n#include <sys\/socket.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include \"base\/logging.h\"\n#include \"base\/posix\/eintr_wrapper.h\"\n#include \"build\/build_config.h\"\n#include \"util\/file\/file_io.h\"\n#include \"util\/linux\/ptrace_broker.h\"\n#include \"util\/posix\/signals.h\"\n\nnamespace crashpad {\n\nExceptionHandlerClient::ExceptionHandlerClient(int sock)\n    : server_sock_(sock), ptracer_(-1), can_set_ptracer_(true) {}\n\nExceptionHandlerClient::~ExceptionHandlerClient() = default;\n\nint ExceptionHandlerClient::RequestCrashDump(const ClientInformation& info) {\n  int status = SendCrashDumpRequest(info);\n  if (status != 0) {\n    return status;\n  }\n  return WaitForCrashDumpComplete();\n}\n\nint ExceptionHandlerClient::SetPtracer(pid_t pid) {\n  if (ptracer_ == pid) {\n    return 0;\n  }\n\n  if (!can_set_ptracer_) {\n    return EPERM;\n  }\n\n  if (prctl(PR_SET_PTRACER, pid, 0, 0, 0) == 0) {\n    return 0;\n  }\n  return errno;\n}\n\nvoid ExceptionHandlerClient::SetCanSetPtracer(bool can_set_ptracer) {\n  can_set_ptracer_ = can_set_ptracer;\n}\n\nint ExceptionHandlerClient::SendCrashDumpRequest(\n    const ClientInformation& info) {\n  ClientToServerMessage message;\n  message.type = ClientToServerMessage::kCrashDumpRequest;\n  message.client_info = info;\n\n  iovec iov;\n  iov.iov_base = &message;\n  iov.iov_len = sizeof(message);\n\n  msghdr msg;\n  msg.msg_name = nullptr;\n  msg.msg_namelen = 0;\n  msg.msg_iov = &iov;\n  msg.msg_iovlen = 1;\n\n  ucred creds;\n  creds.pid = getpid();\n  creds.uid = geteuid();\n  creds.gid = getegid();\n\n  char cmsg_buf[CMSG_SPACE(sizeof(creds))];\n  msg.msg_control = cmsg_buf;\n  msg.msg_controllen = sizeof(cmsg_buf);\n\n  cmsghdr* cmsg = CMSG_FIRSTHDR(&msg);\n  cmsg->cmsg_level = SOL_SOCKET;\n  cmsg->cmsg_type = SCM_CREDENTIALS;\n  cmsg->cmsg_len = CMSG_LEN(sizeof(creds));\n  *reinterpret_cast<ucred*>(CMSG_DATA(cmsg)) = creds;\n\n  if (sendmsg(server_sock_, &msg, MSG_NOSIGNAL) < 0) {\n    PLOG(ERROR) << \"sendmsg\";\n    return errno;\n  }\n\n  return 0;\n}\n\nint ExceptionHandlerClient::WaitForCrashDumpComplete() {\n  ServerToClientMessage message;\n\n  \/\/ If the server hangs up, ReadFileExactly will return false without setting\n  \/\/ errno.\n  errno = 0;\n  while (ReadFileExactly(server_sock_, &message, sizeof(message))) {\n    switch (message.type) {\n      case ServerToClientMessage::kTypeForkBroker: {\n        Signals::InstallDefaultHandler(SIGCHLD);\n\n        pid_t pid = fork();\n        if (pid < 0) {\n          Errno error = errno;\n          if (!WriteFile(server_sock_, &error, sizeof(error))) {\n            return errno;\n          }\n          continue;\n        }\n\n        if (pid == 0) {\n#if defined(ARCH_CPU_64_BITS)\n          constexpr bool am_64_bit = true;\n#else\n          constexpr bool am_64_bit = false;\n#endif  \/\/ ARCH_CPU_64_BITS\n\n          PtraceBroker broker(server_sock_, am_64_bit);\n          _exit(broker.Run());\n        }\n\n        int status = 0;\n        pid_t child = HANDLE_EINTR(waitpid(pid, &status, 0));\n        DCHECK_EQ(child, pid);\n\n        if (child == pid && status != 0) {\n          return status;\n        }\n        continue;\n      }\n\n      case ServerToClientMessage::kTypeSetPtracer: {\n        Errno result = SetPtracer(message.pid);\n        if (!WriteFile(server_sock_, &result, sizeof(result))) {\n          return errno;\n        }\n        continue;\n      }\n\n      case ServerToClientMessage::kTypeCrashDumpComplete:\n      case ServerToClientMessage::kTypeCrashDumpFailed:\n        return 0;\n    }\n\n    DCHECK(false);\n  }\n\n  return errno;\n}\n\n}  \/\/ namespace crashpad\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n *\/\n#pragma once\n\n#include \"libbirch\/external.hpp\"\n#include \"libbirch\/type.hpp\"\n#include \"libbirch\/Any.hpp\"\n#include \"libbirch\/Label.hpp\"\n#include \"libbirch\/Nil.hpp\"\n#include \"libbirch\/thread.hpp\"\n\nnamespace libbirch {\n\/**\n * Wraps a pointer type to apply lazy deep clone semantics.\n *\n * @ingroup libbirch\n *\n * @tparam P Pointer type. Either SharedPtr, WeakPtr or InitPtr.\n *\/\ntemplate<class P>\nclass Lazy {\n  template<class U> friend class Lazy;\npublic:\n  using pointer_type = P;\n  using value_type = typename P::value_type;\n\n  Lazy& operator=(const Lazy&) = delete;\n  Lazy& operator=(Lazy&&) = delete;\n\n  \/**\n   * Constructor.\n   *\/\n  Lazy(const Nil& = nil) :\n      object(),\n      label(0),\n      cross(false) {\n    \/\/\n  }\n\n  \/**\n   * Constructor.\n   *\/\n  Lazy(Label* context, const Nil& = nil) :\n      object(),\n      label(0),\n      cross(false) {\n    \/\/\n  }\n\n  \/**\n   * Constructor.\n   *\/\n  Lazy(Label* context, value_type* object, const bool cross = false) :\n      object(object),\n      label(reinterpret_cast<intptr_t>(context)),\n      cross(cross) {\n    if (cross) {\n      getLabel()->incShared();\n    }\n  }\n\n  \/**\n   * Constructor.\n   *\/\n  Lazy(Label* context, const P& object, const bool cross = false) :\n      object(object),\n      label(reinterpret_cast<intptr_t>(context)),\n      cross(cross) {\n    if (cross) {\n      getLabel()->incShared();\n    }\n  }\n\n  \/**\n   * Copy constructor.\n   *\/\n  Lazy(const Lazy<P>& o) :\n      object(o.get()),\n      label(o.label),\n      cross(o.cross) {\n    if (cross) {\n      getLabel()->incShared();\n    }\n  }\n\n  \/**\n   * Copy constructor.\n   *\/\n  template<class Q, IS_CONVERTIBLE(Q,P)>\n  Lazy(const Lazy<Q>& o) :\n      object(o.get()),\n      label(o.label),\n      cross(o.cross) {\n    if (cross) {\n      getLabel()->incShared();\n    }\n  }\n\n  \/**\n   * Copy constructor.\n   *\/\n  Lazy(Label* context, const Lazy<P>& o) :\n      object(o.get()),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(o.getLabel(), o.getLabel() != context);\n    }\n  }\n\n  \/**\n   * Copy constructor.\n   *\/\n  template<class Q, IS_CONVERTIBLE(Q,P)>\n  Lazy(Label* context, const Lazy<Q>& o) :\n      object(o.get()),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(o.getLabel(), o.getLabel() != context);\n    }\n  }\n\n  \/**\n   * Move constructor.\n   *\/\n  Lazy(Lazy<P>&& o) :\n      object(std::move(o.object)),\n      label(o.label),\n      cross(o.cross) {\n    o.label = 0;\n    o.cross = false;\n  }\n\n  \/**\n   * Move constructor.\n   *\/\n  template<class Q, IS_CONVERTIBLE(Q,P)>\n  Lazy(Lazy<Q>&& o) :\n      object(std::move(o.object)),\n      label(o.label),\n      cross(o.cross) {\n    o.label = 0;\n    o.cross = false;\n  }\n\n  \/**\n   * Move constructor.\n   *\/\n  Lazy(Label* context, Lazy<P>&& o) :\n      object(std::move(o.object)),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(o.getLabel(), o.getLabel() != context);\n    }\n  }\n\n  \/**\n   * Move constructor.\n   *\/\n  template<class Q, IS_CONVERTIBLE(Q,P)>\n  Lazy(Label* context, Lazy<Q>&& o) :\n      object(std::move(o.object)),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(o.getLabel(), o.getLabel() != context);\n    }\n  }\n\n  \/**\n   * Deep copy constructor.\n   *\/\n  Lazy(Label* context, Label* label, const Lazy<P>& o) :\n      object(),\n      label(0),\n      cross(false) {\n    assert(context == label);\n    if (o.object) {\n      if (o.isCross()) {\n        o.finish();\n        o.freeze();\n      }\n      object = o.object;\n      setLabel(label, false);\n    }\n  }\n\n  \/**\n   * Destructor.\n   *\/\n  ~Lazy() {\n    releaseLabel();\n  }\n\n  \/**\n   * Copy assignment.\n   *\/\n  template<class Q>\n  Lazy& assign(Label* context, const Lazy<Q>& o) {\n    if (object) {\n      replaceLabel(o.getLabel(), o.getLabel() != context);\n    } else {\n      releaseLabel();\n    }\n    object = o.get();\n    return *this;\n  }\n\n  \/**\n   * Move assignment.\n   *\/\n  template<class Q>\n  Lazy& assign(Label* context, Lazy<Q>&& o) {\n    if (object) {\n      replaceLabel(o.getLabel(), o.getLabel() != context);\n    } else {\n      releaseLabel();\n    }\n    object = std::move(o.get());\n    return *this;\n  }\n\n  \/**\n   * Value assignment.\n   *\/\n  template<class U, typename = std::enable_if_t<is_value<U>::value>>\n  Lazy<P>& assign(Label* context, const U& o) {\n    *get() = o;\n    return *this;\n  }\n\n  \/**\n   * Release the pointer.\n   *\/\n  void release() {\n    object.release();\n    releaseLabel();\n  }\n\n  \/**\n   * Value conversion.\n   *\/\n  template<class U, IS_CONVERTIBLE(value_type,U)>\n  operator U() const {\n    return static_cast<U>(*get());\n  }\n\n  \/**\n   * Is the pointer not null?\n   *\/\n  bool query() const {\n    return static_cast<bool>(object);\n  }\n\n  \/**\n   * Get the raw pointer, with lazy cloning.\n   *\/\n  P& get() {\n    auto raw = object.get();\n    if (raw && raw->isFrozen()) {\n      raw = static_cast<value_type*>(getLabel()->get(raw));\n      object.replace(raw);\n      assert(object);\n    }\n    return object;\n  }\n\n  \/**\n   * Get the raw pointer, with lazy cloning.\n   *\/\n  auto get() const {\n    return const_cast<Lazy<P>*>(this)->get();\n  }\n\n  \/**\n   * Get the raw pointer for read-only use, without cloning.\n   *\/\n  P& pull() {\n    auto raw = object.get();\n    if (raw && raw->isFrozen()) {\n      raw = static_cast<value_type*>(getLabel()->pull(raw));\n      object.replace(raw);\n      assert(object);\n    }\n    return object;\n  }\n\n  \/**\n   * Get the raw pointer for read-only use, without cloning.\n   *\/\n  auto pull() const {\n    return const_cast<Lazy<P>*>(this)->pull();\n  }\n\n  \/**\n   * Start lazy deep clone.\n   *\/\n  Lazy<P> clone(Label* context) const {\n    assert(object);\n    pull();\n    startFreeze();\n    return Lazy<P>(getLabel()->fork(), object, true);\n  }\n\n  \/**\n   * Start a freeze operation. This is just like freeze(), but manages thread\n   * safety on entry and exit.\n   *\/\n  void startFreeze() {\n    if (object) {\n      freezeLock.enter();\n      freeze();\n      freezeLock.exit();\n    }\n  }\n\n  \/**\n   * Start a freeze operation. This is just like freeze(), but manages thread\n   * safety on entry and exit.\n   *\/\n  void startFreeze() const {\n    return const_cast<Lazy<P>*>(this)->startFreeze();\n  }\n\n  \/**\n   * Freeze.\n   *\/\n  void freeze() {\n    if (object) {\n      object->freeze();\n      getLabel()->freeze();\n    }\n  }\n\n  \/**\n   * Freeze.\n   *\/\n  void freeze() const {\n    return const_cast<Lazy<P>*>(this)->freeze();\n  }\n\n  \/**\n   * Thaw.\n   *\/\n  void thaw(Label* label) {\n    if (isCross()) {\n      startFinish();\n      startFreeze();\n    }\n    if (object) {\n      this->label = reinterpret_cast<intptr_t>(label);\n    }\n  }\n\n  \/**\n   * Thaw.\n   *\/\n  void thaw(Label* label) const {\n    return const_cast<Lazy<P>*>(this)->thaw(label);\n  }\n\n  \/**\n   * Start a finish operation. This is just like finish(), but manages thread\n   * safety on entry and exit.\n   *\/\n  void startFinish() {\n    if (object) {\n      finishLock.enter();\n      finish();\n      finishLock.exit();\n    }\n  }\n\n  \/**\n   * Start a freeze operation. This is just like finish(), but manages thread\n   * safety on entry and exit.\n   *\/\n  void startFinish() const {\n    return const_cast<Lazy<P>*>(this)->startFinish();\n  }\n\n  \/**\n   * Finish.\n   *\/\n  void finish() {\n    if (object) {\n      get();\n      object->finish();\n    }\n  }\n\n  \/**\n   * Finish.\n   *\/\n  void finish() const {\n    return const_cast<Lazy<P>*>(this)->finish();\n  }\n\n  \/**\n   * Dereference.\n   *\/\n  auto& operator*() const {\n    return *get();\n  }\n\n  \/**\n   * Member access.\n   *\/\n  auto operator->() const {\n    return get();\n  }\n\n  \/**\n   * Equal comparison.\n   *\/\n  template<class U>\n  bool operator==(const Lazy<U>& o) const {\n    return get() == o.get();\n  }\n\n  \/**\n   * Not equal comparison.\n   *\/\n  template<class U>\n  bool operator!=(const Lazy<U>& o) const {\n    return get() != o.get();\n  }\n\n  \/**\n   * Dynamic cast.\n   *\/\n  template<class U>\n  auto dynamic_pointer_cast(Label* context) const {\n    auto cast = get().template dynamic_pointer_cast<typename U::pointer_type>();\n    return Lazy<decltype(cast)>(getLabel(), cast);\n  }\n\n  \/**\n   * Static cast.\n   *\/\n  template<class U>\n  auto static_pointer_cast(Label* context) const {\n    auto cast = get().template static_pointer_cast<typename U::pointer_type>();\n    return Lazy<decltype(cast)>(getLabel(), cast);\n  }\n\nprivate:\n  \/**\n   * Constructor.\n   *\/\n  Lazy(Label* context, Label* label, const P& object) :\n      object(object),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(label, label != context);\n    }\n  }\n\n  \/**\n   * Get the label.\n   *\/\n  Label* getLabel() const {\n    return reinterpret_cast<Label*>(this->label);\n  }\n\n  \/**\n   * Is this pointer crossed? A crossed pointer is to a context different to\n   * that of the context in which it was created (e.g. the context of the\n   * object to which it belongs).\n   *\/\n  bool isCross() const {\n    return cross;\n  }\n\n  \/**\n   * Set the label.\n   *\/\n  void setLabel(Label* label, bool cross) {\n    assert(this->label == 0);\n    assert(!this->cross);\n    this->label = reinterpret_cast<intptr_t>(label);\n    this->cross = cross;\n    if (label && cross) {\n      label->incShared();\n    }\n  }\n\n  \/**\n   * Replace the label.\n   *\/\n  void replaceLabel(Label* label, bool cross) {\n    auto oldLabel = this->getLabel();\n    auto oldCross = this->isCross();\n    this->label = reinterpret_cast<intptr_t>(label);\n    this->cross = cross;\n    if (label && cross) {\n      label->incShared();\n    }\n    if (oldLabel && oldCross) {\n      oldLabel->decShared();\n    }\n  }\n\n  \/**\n   * Release the label.\n   *\/\n  void releaseLabel() {\n    auto label = getLabel();\n    auto cross = isCross();\n    this->label = 0;\n    this->cross = false;\n    if (label && cross) {\n      label->decShared();\n    }\n  }\n\n  \/**\n   * Object.\n   *\/\n  P object;\n\n  \/**\n   * Raw pointer.\n   *\/\n  intptr_t label:63;\n\n  \/**\n   * Is this pointer crossed? A crossed pointer is to a context different to\n   * that of the context in which it was created (e.g. the context of the\n   * object to which it belongs).\n   *\/\n  bool cross:1;\n};\n\ntemplate<class P>\nstruct is_value<Lazy<P>> {\n  static const bool value = false;\n};\n\ntemplate<class P>\nstruct is_pointer<Lazy<P>> {\n  static const bool value = true;\n};\n}\n<commit_msg>Fix to assignment functions in Lazy.<commit_after>\/**\n * @file\n *\/\n#pragma once\n\n#include \"libbirch\/external.hpp\"\n#include \"libbirch\/type.hpp\"\n#include \"libbirch\/Any.hpp\"\n#include \"libbirch\/Label.hpp\"\n#include \"libbirch\/Nil.hpp\"\n#include \"libbirch\/thread.hpp\"\n\nnamespace libbirch {\n\/**\n * Wraps a pointer type to apply lazy deep clone semantics.\n *\n * @ingroup libbirch\n *\n * @tparam P Pointer type. Either SharedPtr, WeakPtr or InitPtr.\n *\/\ntemplate<class P>\nclass Lazy {\n  template<class U> friend class Lazy;\npublic:\n  using pointer_type = P;\n  using value_type = typename P::value_type;\n\n  Lazy& operator=(const Lazy&) = delete;\n  Lazy& operator=(Lazy&&) = delete;\n\n  \/**\n   * Constructor.\n   *\/\n  Lazy(const Nil& = nil) :\n      object(),\n      label(0),\n      cross(false) {\n    \/\/\n  }\n\n  \/**\n   * Constructor.\n   *\/\n  Lazy(Label* context, const Nil& = nil) :\n      object(),\n      label(0),\n      cross(false) {\n    \/\/\n  }\n\n  \/**\n   * Constructor.\n   *\/\n  Lazy(Label* context, value_type* object, const bool cross = false) :\n      object(object),\n      label(reinterpret_cast<intptr_t>(context)),\n      cross(cross) {\n    if (cross) {\n      getLabel()->incShared();\n    }\n  }\n\n  \/**\n   * Constructor.\n   *\/\n  Lazy(Label* context, const P& object, const bool cross = false) :\n      object(object),\n      label(reinterpret_cast<intptr_t>(context)),\n      cross(cross) {\n    if (cross) {\n      getLabel()->incShared();\n    }\n  }\n\n  \/**\n   * Copy constructor.\n   *\/\n  Lazy(const Lazy<P>& o) :\n      object(o.get()),\n      label(o.label),\n      cross(o.cross) {\n    if (cross) {\n      getLabel()->incShared();\n    }\n  }\n\n  \/**\n   * Copy constructor.\n   *\/\n  template<class Q, IS_CONVERTIBLE(Q,P)>\n  Lazy(const Lazy<Q>& o) :\n      object(o.get()),\n      label(o.label),\n      cross(o.cross) {\n    if (cross) {\n      getLabel()->incShared();\n    }\n  }\n\n  \/**\n   * Copy constructor.\n   *\/\n  Lazy(Label* context, const Lazy<P>& o) :\n      object(o.get()),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(o.getLabel(), o.getLabel() != context);\n    }\n  }\n\n  \/**\n   * Copy constructor.\n   *\/\n  template<class Q, IS_CONVERTIBLE(Q,P)>\n  Lazy(Label* context, const Lazy<Q>& o) :\n      object(o.get()),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(o.getLabel(), o.getLabel() != context);\n    }\n  }\n\n  \/**\n   * Move constructor.\n   *\/\n  Lazy(Lazy<P>&& o) :\n      object(std::move(o.object)),\n      label(o.label),\n      cross(o.cross) {\n    o.label = 0;\n    o.cross = false;\n  }\n\n  \/**\n   * Move constructor.\n   *\/\n  template<class Q, IS_CONVERTIBLE(Q,P)>\n  Lazy(Lazy<Q>&& o) :\n      object(std::move(o.object)),\n      label(o.label),\n      cross(o.cross) {\n    o.label = 0;\n    o.cross = false;\n  }\n\n  \/**\n   * Move constructor.\n   *\/\n  Lazy(Label* context, Lazy<P>&& o) :\n      object(std::move(o.object)),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(o.getLabel(), o.getLabel() != context);\n    }\n  }\n\n  \/**\n   * Move constructor.\n   *\/\n  template<class Q, IS_CONVERTIBLE(Q,P)>\n  Lazy(Label* context, Lazy<Q>&& o) :\n      object(std::move(o.object)),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(o.getLabel(), o.getLabel() != context);\n    }\n  }\n\n  \/**\n   * Deep copy constructor.\n   *\/\n  Lazy(Label* context, Label* label, const Lazy<P>& o) :\n      object(),\n      label(0),\n      cross(false) {\n    assert(context == label);\n    if (o.object) {\n      if (o.isCross()) {\n        o.finish();\n        o.freeze();\n      }\n      object = o.object;\n      setLabel(label, false);\n    }\n  }\n\n  \/**\n   * Destructor.\n   *\/\n  ~Lazy() {\n    releaseLabel();\n  }\n\n  \/**\n   * Copy assignment.\n   *\/\n  template<class Q>\n  Lazy& assign(Label* context, const Lazy<Q>& o) {\n    if (o.query()) {\n      replaceLabel(o.getLabel(), o.getLabel() != context);\n    } else {\n      releaseLabel();\n    }\n    object = o.get();\n    return *this;\n  }\n\n  \/**\n   * Move assignment.\n   *\/\n  template<class Q>\n  Lazy& assign(Label* context, Lazy<Q>&& o) {\n    if (o.query()) {\n      replaceLabel(o.getLabel(), o.getLabel() != context);\n    } else {\n      releaseLabel();\n    }\n    object = std::move(o.get());\n    return *this;\n  }\n\n  \/**\n   * Value assignment.\n   *\/\n  template<class U, typename = std::enable_if_t<is_value<U>::value>>\n  Lazy<P>& assign(Label* context, const U& o) {\n    *get() = o;\n    return *this;\n  }\n\n  \/**\n   * Release the pointer.\n   *\/\n  void release() {\n    object.release();\n    releaseLabel();\n  }\n\n  \/**\n   * Value conversion.\n   *\/\n  template<class U, IS_CONVERTIBLE(value_type,U)>\n  operator U() const {\n    return static_cast<U>(*get());\n  }\n\n  \/**\n   * Is the pointer not null?\n   *\/\n  bool query() const {\n    return static_cast<bool>(object);\n  }\n\n  \/**\n   * Get the raw pointer, with lazy cloning.\n   *\/\n  P& get() {\n    auto raw = object.get();\n    if (raw && raw->isFrozen()) {\n      raw = static_cast<value_type*>(getLabel()->get(raw));\n      object.replace(raw);\n      assert(object);\n    }\n    return object;\n  }\n\n  \/**\n   * Get the raw pointer, with lazy cloning.\n   *\/\n  auto get() const {\n    return const_cast<Lazy<P>*>(this)->get();\n  }\n\n  \/**\n   * Get the raw pointer for read-only use, without cloning.\n   *\/\n  P& pull() {\n    auto raw = object.get();\n    if (raw && raw->isFrozen()) {\n      raw = static_cast<value_type*>(getLabel()->pull(raw));\n      object.replace(raw);\n      assert(object);\n    }\n    return object;\n  }\n\n  \/**\n   * Get the raw pointer for read-only use, without cloning.\n   *\/\n  auto pull() const {\n    return const_cast<Lazy<P>*>(this)->pull();\n  }\n\n  \/**\n   * Start lazy deep clone.\n   *\/\n  Lazy<P> clone(Label* context) const {\n    assert(object);\n    pull();\n    startFreeze();\n    return Lazy<P>(getLabel()->fork(), object, true);\n  }\n\n  \/**\n   * Start a freeze operation. This is just like freeze(), but manages thread\n   * safety on entry and exit.\n   *\/\n  void startFreeze() {\n    if (object) {\n      freezeLock.enter();\n      freeze();\n      freezeLock.exit();\n    }\n  }\n\n  \/**\n   * Start a freeze operation. This is just like freeze(), but manages thread\n   * safety on entry and exit.\n   *\/\n  void startFreeze() const {\n    return const_cast<Lazy<P>*>(this)->startFreeze();\n  }\n\n  \/**\n   * Freeze.\n   *\/\n  void freeze() {\n    if (object) {\n      object->freeze();\n      getLabel()->freeze();\n    }\n  }\n\n  \/**\n   * Freeze.\n   *\/\n  void freeze() const {\n    return const_cast<Lazy<P>*>(this)->freeze();\n  }\n\n  \/**\n   * Thaw.\n   *\/\n  void thaw(Label* label) {\n    if (isCross()) {\n      startFinish();\n      startFreeze();\n    }\n    if (object) {\n      this->label = reinterpret_cast<intptr_t>(label);\n    }\n  }\n\n  \/**\n   * Thaw.\n   *\/\n  void thaw(Label* label) const {\n    return const_cast<Lazy<P>*>(this)->thaw(label);\n  }\n\n  \/**\n   * Start a finish operation. This is just like finish(), but manages thread\n   * safety on entry and exit.\n   *\/\n  void startFinish() {\n    if (object) {\n      finishLock.enter();\n      finish();\n      finishLock.exit();\n    }\n  }\n\n  \/**\n   * Start a freeze operation. This is just like finish(), but manages thread\n   * safety on entry and exit.\n   *\/\n  void startFinish() const {\n    return const_cast<Lazy<P>*>(this)->startFinish();\n  }\n\n  \/**\n   * Finish.\n   *\/\n  void finish() {\n    if (object) {\n      get();\n      object->finish();\n    }\n  }\n\n  \/**\n   * Finish.\n   *\/\n  void finish() const {\n    return const_cast<Lazy<P>*>(this)->finish();\n  }\n\n  \/**\n   * Dereference.\n   *\/\n  auto& operator*() const {\n    return *get();\n  }\n\n  \/**\n   * Member access.\n   *\/\n  auto operator->() const {\n    return get();\n  }\n\n  \/**\n   * Equal comparison.\n   *\/\n  template<class U>\n  bool operator==(const Lazy<U>& o) const {\n    return get() == o.get();\n  }\n\n  \/**\n   * Not equal comparison.\n   *\/\n  template<class U>\n  bool operator!=(const Lazy<U>& o) const {\n    return get() != o.get();\n  }\n\n  \/**\n   * Dynamic cast.\n   *\/\n  template<class U>\n  auto dynamic_pointer_cast(Label* context) const {\n    auto cast = get().template dynamic_pointer_cast<typename U::pointer_type>();\n    return Lazy<decltype(cast)>(getLabel(), cast);\n  }\n\n  \/**\n   * Static cast.\n   *\/\n  template<class U>\n  auto static_pointer_cast(Label* context) const {\n    auto cast = get().template static_pointer_cast<typename U::pointer_type>();\n    return Lazy<decltype(cast)>(getLabel(), cast);\n  }\n\nprivate:\n  \/**\n   * Constructor.\n   *\/\n  Lazy(Label* context, Label* label, const P& object) :\n      object(object),\n      label(0),\n      cross(false) {\n    if (object) {\n      setLabel(label, label != context);\n    }\n  }\n\n  \/**\n   * Get the label.\n   *\/\n  Label* getLabel() const {\n    return reinterpret_cast<Label*>(this->label);\n  }\n\n  \/**\n   * Is this pointer crossed? A crossed pointer is to a context different to\n   * that of the context in which it was created (e.g. the context of the\n   * object to which it belongs).\n   *\/\n  bool isCross() const {\n    return cross;\n  }\n\n  \/**\n   * Set the label.\n   *\/\n  void setLabel(Label* label, bool cross) {\n    assert(this->label == 0);\n    assert(!this->cross);\n    this->label = reinterpret_cast<intptr_t>(label);\n    this->cross = cross;\n    if (label && cross) {\n      label->incShared();\n    }\n  }\n\n  \/**\n   * Replace the label.\n   *\/\n  void replaceLabel(Label* label, bool cross) {\n    auto oldLabel = this->getLabel();\n    auto oldCross = this->isCross();\n    this->label = reinterpret_cast<intptr_t>(label);\n    this->cross = cross;\n    if (label && cross) {\n      label->incShared();\n    }\n    if (oldLabel && oldCross) {\n      oldLabel->decShared();\n    }\n  }\n\n  \/**\n   * Release the label.\n   *\/\n  void releaseLabel() {\n    auto label = getLabel();\n    auto cross = isCross();\n    this->label = 0;\n    this->cross = false;\n    if (label && cross) {\n      label->decShared();\n    }\n  }\n\n  \/**\n   * Object.\n   *\/\n  P object;\n\n  \/**\n   * Raw pointer.\n   *\/\n  intptr_t label:63;\n\n  \/**\n   * Is this pointer crossed? A crossed pointer is to a context different to\n   * that of the context in which it was created (e.g. the context of the\n   * object to which it belongs).\n   *\/\n  bool cross:1;\n};\n\ntemplate<class P>\nstruct is_value<Lazy<P>> {\n  static const bool value = false;\n};\n\ntemplate<class P>\nstruct is_pointer<Lazy<P>> {\n  static const bool value = true;\n};\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright 2016 Nu-book Inc.\n* Copyright 2017 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 \"ByteArray.h\"\n#include \"BlackboxTestRunner.h\"\n#include \"ImageLoader.h\"\n#include \"TestReader.h\"\n#include \"GenericLuminanceSource.h\"\n#include \"HybridBinarizer.h\"\n#include \"TextUtfEncoding.h\"\n#include \"ZXContainerAlgorithms.h\"\n#include \"lodepng.h\"\n\n#include <iostream>\n#include <fstream>\n#include <set>\n\n#if __has_include(<filesystem>)\n#  include <filesystem>\n#  ifdef __cpp_lib_filesystem\n     namespace fs = std::filesystem;\n#    define ZXING_HAS_FILESYSTEM\n#  endif\n#endif\n#if !defined(ZXING_HAS_FILESYSTEM) && __has_include(<experimental\/filesystem>)\n#  include <experimental\/filesystem>\n#  ifdef __cpp_lib_experimental_filesystem\n     namespace fs = std::experimental::filesystem;\n#    define ZXING_HAS_FILESYSTEM\n#  endif\n#endif\n#if defined(__APPLE__) && !defined(__clang__) &&                                                                       \\\n\t__has_include(<dirent.h>) && defined(__SANITIZE_ADDRESS__) && defined(ZXING_HAS_FILESYSTEM)\n#  warning detected gcc + macos + <filesystem> + address_sanitizer == bad -> disable <filesystem>\n#  undef ZXING_HAS_FILESYSTEM\n#endif\n#if !defined(ZXING_HAS_FILESYSTEM)\n#  if __has_include(<dirent.h>)\n#    include <dirent.h>\n#  else\n#    error need <filesystem> or <dirent.h>\n#  endif\n#endif\n\n\/\/ compiling this with clang (e.g. version 6) might require linking against libc++experimental.a or libc++fs.a.\n\/\/ E.g.: CMAKE_EXE_LINKER_FLAGS = -L\/usr\/local\/Cellar\/llvm\/6.0.1\/lib -lc++experimental\n\nusing namespace ZXing;\nusing namespace ZXing::Test;\n\nstatic std::string getExtension(const std::string& fn)\n{\n\tauto p = fn.find_last_of(\".\");\n\treturn p != std::string::npos ?\tfn.substr(p) : \"\";\n}\n\nstatic std::shared_ptr<LuminanceSource> readPNM(FILE* f)\n{\n\tint w, h;\n\tif (fscanf(f, \"P5\\n%d %d\\n255\\n\", &w, &h) != 2)\n\t\tthrow std::runtime_error(\"Failed to parse PNM file header.\");\n\tauto ba = std::make_shared<ByteArray>(w * h);\n\tauto read = fread(ba->data(), sizeof(uint8_t), w*h, f);\n\/\/\tif (read != w * h)\n\/\/\t\tthrow std::runtime_error(\"Failed to read PNM file data: \" + std::to_string(read) + \" != \" + std::to_string(w * h) + \" -> \" + std::to_string(feof(f)));\n\treturn std::make_shared<GenericLuminanceSource>(0, 0, w, h, ba, w);\n}\n\nstatic std::shared_ptr<LuminanceSource> readPNG(const std::string& filename)\n{\n\tstd::vector<unsigned char> buffer;\n\tunsigned width, height;\n\tunsigned error = lodepng::decode(buffer, width, height, filename);\n\tif (error) {\n\t\tthrow std::runtime_error(\"Failed to read image\");\n\t}\n\treturn std::make_shared<GenericLuminanceSource>((int)width, (int)height, buffer.data(), width*4, 4, 0, 1, 2);\n}\n\nstatic std::shared_ptr<LuminanceSource> readImage(const std::string& filename)\n{\n\tif( getExtension(filename) == \".png\" )\n\t\treturn readPNG(filename);\n\n\tstd::string cmd = \"convert '\" + filename + \"' -intensity Rec601Luma -colorspace gray +set comment pgm:-\";\n\tbool pipe = getExtension(filename) != \".pgm\";\n\tFILE* f = pipe ? popen(cmd.c_str(), \"r\") : fopen(filename.c_str(), \"r\");\n\tif (!f)\n\t\tthrow std::runtime_error(\"Failed to open pipe '\" + cmd + \"': \" + std::strerror(errno));\n\ttry {\n\t\tauto res = readPNM(f);\n\t\tpipe ? pclose(f) : fclose(f);\n\t\treturn res;\n\t} catch (std::runtime_error& e) {\n\t\tpipe ? pclose(f) : fclose(f);\n\t\tthrow std::runtime_error(\"Failed to read pipe '\" + cmd + \"': \" + e.what());\n\t}\n}\n\nclass GenericImageLoader : public ImageLoader\n{\npublic:\n\tstd::shared_ptr<LuminanceSource> load(const std::wstring& filename) const final\n\t{\n\t\treturn readImage(TextUtfEncoding::ToUtf8(filename));\n\t}\n};\n\nclass GenericBlackboxTestRunner : public BlackboxTestRunner\n{\npublic:\n\tGenericBlackboxTestRunner(const std::wstring& pathPrefix)\n\t\t: BlackboxTestRunner(pathPrefix, std::make_shared<GenericImageLoader>())\n\t{\n\t}\n\n\tstd::vector<std::wstring> getImagesInDirectory(const std::wstring& dirPath) final\n\t{\n\t\tstd::vector<std::wstring> result;\n#ifndef ZXING_HAS_FILESYSTEM\n\t\tif (auto dir = opendir(TextUtfEncoding::ToUtf8(pathPrefix() + L\"\/\" + dirPath).c_str())) {\n\t\t\twhile (auto entry = readdir(dir)) {\n\t\t\t\tif (Contains({\".png\", \".jpg\", \".pgm\", \".gif\"}, getExtension(entry->d_name))) {\n\t\t\t\t\tresult.push_back(dirPath + L\"\/\" + TextUtfEncoding::FromUtf8(entry->d_name));\n\t\t\t\t}\n\t\t\t}\n\t\t\tclosedir(dir);\n\t\t}\n\t\telse {\n\t\t\tstd::cerr << \"Error open dir \" << TextUtfEncoding::ToUtf8(dirPath) << std::endl;\n\t\t}\n#else\n\t\tfor (const auto& entry : fs::directory_iterator(fs::path(pathPrefix()) \/ dirPath))\n\t\t\tif (fs::is_regular_file(entry.status()) &&\n\t\t\t        Contains({\".png\", \".jpg\", \".pgm\", \".gif\"}, entry.path().extension()))\n\t\t\t\tresult.push_back(dirPath + L\"\/\" + entry.path().filename().generic_wstring());\n#endif\n\t\treturn result;\n\t}\n};\n\nint main(int argc, char** argv)\n{\n\tif (argc <= 1) {\n\t\tstd::cout << \"Usage: \" << argv[0] << \" <test_path_prefix>\" << std::endl;\n\t\treturn 0;\n\t}\n\n\tstd::string pathPrefix = argv[1];\n\n\tGenericBlackboxTestRunner runner(TextUtfEncoding::FromUtf8(pathPrefix));\n\n\tif (Contains({\".png\", \".jpg\", \".pgm\", \".gif\"}, getExtension(pathPrefix))) {\n#if 0\n\t\tTestReader reader = runner.createReader(false, false, \"QR_CODE\");\n#else\n\t\tTestReader reader = runner.createReader(true, true);\n#endif\n\t\tbool isPure = getenv(\"IS_PURE\");\n\t\tint rotation = getenv(\"ROTATION\") ? atoi(getenv(\"ROTATION\")) : 0;\n\n\t\tfor (int i = 1; i < argc; ++i) {\n\t\t\tauto result = reader.read(TextUtfEncoding::FromUtf8(argv[i]), rotation, isPure);\n\t\t\tstd::cout << argv[i] << \": \";\n\t\t\tif (result)\n\t\t\t\tstd::cout << result.format << \": \" << TextUtfEncoding::ToUtf8(result.text) << \"\\n\";\n\t\t\telse\n\t\t\t\tstd::cout << \"FAILED\\n\";\n\t\t}\n\t\treturn 0;\n\t}\n\n\tstd::set<std::string> includedTests;\n\tfor (int i = 2; i < argc; ++i) {\n\t\tif (std::strlen(argv[i]) > 2 && argv[i][0] == '-' && argv[i][1] == 't') {\n\t\t\tincludedTests.insert(argv[i] + 2);\n\t\t}\n\t}\n\n\trunner.run(includedTests);\n}\n<commit_msg>TestReader: support output of decoded text to file<commit_after>\/*\n* Copyright 2016 Nu-book Inc.\n* Copyright 2017 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 \"ByteArray.h\"\n#include \"BlackboxTestRunner.h\"\n#include \"ImageLoader.h\"\n#include \"TestReader.h\"\n#include \"GenericLuminanceSource.h\"\n#include \"HybridBinarizer.h\"\n#include \"TextUtfEncoding.h\"\n#include \"ZXContainerAlgorithms.h\"\n#include \"lodepng.h\"\n\n#include <iostream>\n#include <fstream>\n#include <set>\n\n#if __has_include(<filesystem>)\n#  include <filesystem>\n#  ifdef __cpp_lib_filesystem\n     namespace fs = std::filesystem;\n#    define ZXING_HAS_FILESYSTEM\n#  endif\n#endif\n#if !defined(ZXING_HAS_FILESYSTEM) && __has_include(<experimental\/filesystem>)\n#  include <experimental\/filesystem>\n#  ifdef __cpp_lib_experimental_filesystem\n     namespace fs = std::experimental::filesystem;\n#    define ZXING_HAS_FILESYSTEM\n#  endif\n#endif\n#if defined(__APPLE__) && !defined(__clang__) &&                                                                       \\\n\t__has_include(<dirent.h>) && defined(__SANITIZE_ADDRESS__) && defined(ZXING_HAS_FILESYSTEM)\n#  warning detected gcc + macos + <filesystem> + address_sanitizer == bad -> disable <filesystem>\n#  undef ZXING_HAS_FILESYSTEM\n#endif\n#if !defined(ZXING_HAS_FILESYSTEM)\n#  if __has_include(<dirent.h>)\n#    include <dirent.h>\n#  else\n#    error need <filesystem> or <dirent.h>\n#  endif\n#endif\n\n\/\/ compiling this with clang (e.g. version 6) might require linking against libc++experimental.a or libc++fs.a.\n\/\/ E.g.: CMAKE_EXE_LINKER_FLAGS = -L\/usr\/local\/Cellar\/llvm\/6.0.1\/lib -lc++experimental\n\nusing namespace ZXing;\nusing namespace ZXing::Test;\n\nstatic std::string getExtension(const std::string& fn)\n{\n\tauto p = fn.find_last_of(\".\");\n\treturn p != std::string::npos ?\tfn.substr(p) : \"\";\n}\n\nstatic std::shared_ptr<LuminanceSource> readPNM(FILE* f)\n{\n\tint w, h;\n\tif (fscanf(f, \"P5\\n%d %d\\n255\\n\", &w, &h) != 2)\n\t\tthrow std::runtime_error(\"Failed to parse PNM file header.\");\n\tauto ba = std::make_shared<ByteArray>(w * h);\n\tauto read = fread(ba->data(), sizeof(uint8_t), w*h, f);\n\/\/\tif (read != w * h)\n\/\/\t\tthrow std::runtime_error(\"Failed to read PNM file data: \" + std::to_string(read) + \" != \" + std::to_string(w * h) + \" -> \" + std::to_string(feof(f)));\n\treturn std::make_shared<GenericLuminanceSource>(0, 0, w, h, ba, w);\n}\n\nstatic std::shared_ptr<LuminanceSource> readPNG(const std::string& filename)\n{\n\tstd::vector<unsigned char> buffer;\n\tunsigned width, height;\n\tunsigned error = lodepng::decode(buffer, width, height, filename);\n\tif (error) {\n\t\tthrow std::runtime_error(\"Failed to read image\");\n\t}\n\treturn std::make_shared<GenericLuminanceSource>((int)width, (int)height, buffer.data(), width*4, 4, 0, 1, 2);\n}\n\nstatic std::shared_ptr<LuminanceSource> readImage(const std::string& filename)\n{\n\tif( getExtension(filename) == \".png\" )\n\t\treturn readPNG(filename);\n\n\tstd::string cmd = \"convert '\" + filename + \"' -intensity Rec601Luma -colorspace gray +set comment pgm:-\";\n\tbool pipe = getExtension(filename) != \".pgm\";\n\tFILE* f = pipe ? popen(cmd.c_str(), \"r\") : fopen(filename.c_str(), \"r\");\n\tif (!f)\n\t\tthrow std::runtime_error(\"Failed to open pipe '\" + cmd + \"': \" + std::strerror(errno));\n\ttry {\n\t\tauto res = readPNM(f);\n\t\tpipe ? pclose(f) : fclose(f);\n\t\treturn res;\n\t} catch (std::runtime_error& e) {\n\t\tpipe ? pclose(f) : fclose(f);\n\t\tthrow std::runtime_error(\"Failed to read pipe '\" + cmd + \"': \" + e.what());\n\t}\n}\n\nclass GenericImageLoader : public ImageLoader\n{\npublic:\n\tstd::shared_ptr<LuminanceSource> load(const std::wstring& filename) const final\n\t{\n\t\treturn readImage(TextUtfEncoding::ToUtf8(filename));\n\t}\n};\n\nclass GenericBlackboxTestRunner : public BlackboxTestRunner\n{\npublic:\n\tGenericBlackboxTestRunner(const std::wstring& pathPrefix)\n\t\t: BlackboxTestRunner(pathPrefix, std::make_shared<GenericImageLoader>())\n\t{\n\t}\n\n\tstd::vector<std::wstring> getImagesInDirectory(const std::wstring& dirPath) final\n\t{\n\t\tstd::vector<std::wstring> result;\n#ifndef ZXING_HAS_FILESYSTEM\n\t\tif (auto dir = opendir(TextUtfEncoding::ToUtf8(pathPrefix() + L\"\/\" + dirPath).c_str())) {\n\t\t\twhile (auto entry = readdir(dir)) {\n\t\t\t\tif (Contains({\".png\", \".jpg\", \".pgm\", \".gif\"}, getExtension(entry->d_name))) {\n\t\t\t\t\tresult.push_back(dirPath + L\"\/\" + TextUtfEncoding::FromUtf8(entry->d_name));\n\t\t\t\t}\n\t\t\t}\n\t\t\tclosedir(dir);\n\t\t}\n\t\telse {\n\t\t\tstd::cerr << \"Error open dir \" << TextUtfEncoding::ToUtf8(dirPath) << std::endl;\n\t\t}\n#else\n\t\tfor (const auto& entry : fs::directory_iterator(fs::path(pathPrefix()) \/ dirPath))\n\t\t\tif (fs::is_regular_file(entry.status()) &&\n\t\t\t        Contains({\".png\", \".jpg\", \".pgm\", \".gif\"}, entry.path().extension()))\n\t\t\t\tresult.push_back(dirPath + L\"\/\" + entry.path().filename().generic_wstring());\n#endif\n\t\treturn result;\n\t}\n};\n\nint main(int argc, char** argv)\n{\n\tif (argc <= 1) {\n\t\tstd::cout << \"Usage: \" << argv[0] << \" <test_path_prefix>\" << std::endl;\n\t\treturn 0;\n\t}\n\n\tstd::string pathPrefix = argv[1];\n\n\tGenericBlackboxTestRunner runner(TextUtfEncoding::FromUtf8(pathPrefix));\n\n\tif (Contains({\".png\", \".jpg\", \".pgm\", \".gif\"}, getExtension(pathPrefix))) {\n#if 0\n\t\tTestReader reader = runner.createReader(false, false, \"QR_CODE\");\n#else\n\t\tTestReader reader = runner.createReader(true, true);\n#endif\n\t\tbool isPure = getenv(\"IS_PURE\");\n\t\tint rotation = getenv(\"ROTATION\") ? atoi(getenv(\"ROTATION\")) : 0;\n\n\t\tfor (int i = 1; i < argc; ++i) {\n\t\t\tauto result = reader.read(TextUtfEncoding::FromUtf8(argv[i]), rotation, isPure);\n\t\t\tstd::cout << argv[i] << \": \";\n\t\t\tif (result)\n\t\t\t\tstd::cout << result.format << \": \" << TextUtfEncoding::ToUtf8(result.text) << \"\\n\";\n\t\t\telse\n\t\t\t\tstd::cout << \"FAILED\\n\";\n#ifdef ZXING_HAS_FILESYSTEM\n\t\t\tif (result && getenv(\"WRITE_TEXT\")) {\n\t\t\t\tstd::ofstream f(fs::path(argv[i]).replace_extension(\".txt\"));\n\t\t\t\tf << TextUtfEncoding::ToUtf8(result.text);\n\t\t\t}\n#endif\n\t\t}\n\t\treturn 0;\n\t}\n\n\tstd::set<std::string> includedTests;\n\tfor (int i = 2; i < argc; ++i) {\n\t\tif (std::strlen(argv[i]) > 2 && argv[i][0] == '-' && argv[i][1] == 't') {\n\t\t\tincludedTests.insert(argv[i] + 2);\n\t\t}\n\t}\n\n\trunner.run(includedTests);\n}\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#include \"test\/gtest.h\"\n#include \"test\/scenario\/scenario.h\"\n\nnamespace webrtc {\nnamespace test {\nnamespace {\nvoid CreateAnalyzedStream(Scenario* s,\n                          NetworkNodeConfig network_config,\n                          VideoQualityAnalyzer* analyzer) {\n  VideoStreamConfig config;\n  config.encoder.codec = VideoStreamConfig::Encoder::Codec::kVideoCodecVP8;\n  config.encoder.implementation =\n      VideoStreamConfig::Encoder::Implementation::kSoftware;\n  config.hooks.frame_pair_handlers = {analyzer->Handler()};\n  auto route = s->CreateRoutes(s->CreateClient(\"caller\", CallClientConfig()),\n                               {s->CreateSimulationNode(network_config)},\n                               s->CreateClient(\"callee\", CallClientConfig()),\n                               {s->CreateSimulationNode(NetworkNodeConfig())});\n  s->CreateVideoStream(route->forward(), config);\n}\n}  \/\/ namespace\n\nTEST(ScenarioAnalyzerTest, PsnrIsHighWhenNetworkIsGood) {\n  VideoQualityAnalyzer analyzer;\n  {\n    Scenario s;\n    NetworkNodeConfig good_network;\n    good_network.simulation.bandwidth = DataRate::kbps(1000);\n    CreateAnalyzedStream(&s, good_network, &analyzer);\n    s.RunFor(TimeDelta::seconds(1));\n  }\n  \/\/ This is mainty a regression test, the target is based on previous runs and\n  \/\/ might change due to changes in configuration and encoder etc.\n  EXPECT_GT(analyzer.stats().psnr.Mean(), 45);\n}\n\nTEST(ScenarioAnalyzerTest, PsnrIsLowWhenNetworkIsBad) {\n  VideoQualityAnalyzer analyzer;\n  {\n    Scenario s;\n    NetworkNodeConfig bad_network;\n    bad_network.simulation.bandwidth = DataRate::kbps(100);\n    bad_network.simulation.loss_rate = 0.02;\n    CreateAnalyzedStream(&s, bad_network, &analyzer);\n    s.RunFor(TimeDelta::seconds(1));\n  }\n  \/\/ This is mainty a regression test, the target is based on previous runs and\n  \/\/ might change due to changes in configuration and encoder etc.\n  EXPECT_LT(analyzer.stats().psnr.Mean(), 43);\n}\n}  \/\/ namespace test\n}  \/\/ namespace webrtc\n<commit_msg>Running scenario quality unit tests in simulated time.<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#include \"test\/gtest.h\"\n#include \"test\/scenario\/scenario.h\"\n\nnamespace webrtc {\nnamespace test {\nnamespace {\nvoid CreateAnalyzedStream(Scenario* s,\n                          NetworkNodeConfig network_config,\n                          VideoQualityAnalyzer* analyzer) {\n  VideoStreamConfig config;\n  config.encoder.codec = VideoStreamConfig::Encoder::Codec::kVideoCodecVP8;\n  config.encoder.implementation =\n      VideoStreamConfig::Encoder::Implementation::kSoftware;\n  config.hooks.frame_pair_handlers = {analyzer->Handler()};\n  auto route = s->CreateRoutes(s->CreateClient(\"caller\", CallClientConfig()),\n                               {s->CreateSimulationNode(network_config)},\n                               s->CreateClient(\"callee\", CallClientConfig()),\n                               {s->CreateSimulationNode(NetworkNodeConfig())});\n  s->CreateVideoStream(route->forward(), config);\n}\n}  \/\/ namespace\n\nTEST(ScenarioAnalyzerTest, PsnrIsHighWhenNetworkIsGood) {\n  VideoQualityAnalyzer analyzer;\n  {\n    Scenario s(\"\", \/*real_time*\/ false);\n    NetworkNodeConfig good_network;\n    good_network.simulation.bandwidth = DataRate::kbps(1000);\n    CreateAnalyzedStream(&s, good_network, &analyzer);\n    s.RunFor(TimeDelta::seconds(1));\n  }\n  \/\/ This is mainty a regression test, the target is based on previous runs and\n  \/\/ might change due to changes in configuration and encoder etc.\n  EXPECT_GT(analyzer.stats().psnr.Mean(), 45);\n}\n\nTEST(ScenarioAnalyzerTest, PsnrIsLowWhenNetworkIsBad) {\n  VideoQualityAnalyzer analyzer;\n  {\n    Scenario s(\"\", \/*real_time*\/ false);\n    NetworkNodeConfig bad_network;\n    bad_network.simulation.bandwidth = DataRate::kbps(100);\n    bad_network.simulation.loss_rate = 0.02;\n    CreateAnalyzedStream(&s, bad_network, &analyzer);\n    s.RunFor(TimeDelta::seconds(1));\n  }\n  \/\/ This is mainty a regression test, the target is based on previous runs and\n  \/\/ might change due to changes in configuration and encoder etc.\n  EXPECT_LT(analyzer.stats().psnr.Mean(), 43);\n}\n}  \/\/ namespace test\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>#include \"microbench\/microbench.h\"\r\n\r\n#include <cstdio>\r\n#include <cstdlib>\r\n#include <atomic>\r\n#include <thread>\r\n#include <cstdint>\r\n\r\n#ifdef _WIN32\r\n#define WIN32_LEAN_AND_MEAN\r\n#define NOMINMAX\r\n#include <windows.h>\r\n#define THREAD_LOCAL __declspec(thread)\r\n#else\r\n#define THREAD_LOCAL thread_local\r\n#endif\r\n\r\nuintptr_t ghetto_thread_id()\r\n{\r\n\tstatic THREAD_LOCAL int x;\r\n\treturn reinterpret_cast<uintptr_t>(&x);\r\n}\r\n\r\nint main(int argc, char** argv)\r\n{\r\n\tstd::atomic<int> x32(0);\r\n\tint y32 = rand();\r\n\tint z32 = rand();\r\n\tif (sizeof(x32) != 4) exit(1);\r\n\t\r\n\tstd::atomic<long long> x64(0);\r\n\tlong long y64 = rand();\r\n\tlong long z64 = rand();\r\n\tif (sizeof(x64) != 8) exit(2);\r\n\t\r\n\tprintf(\"32-bit CAS takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { x32.compare_exchange_strong(y32, z32, std::memory_order_acq_rel); },\r\n\t\t\t1000000, \/* iterations per test run *\/\r\n\t\t\t50 \/* number of test runs *\/\r\n\t\t) * 1000 * 1000    \/\/ ms -> ns\r\n\t);\r\n\t\r\n\tprintf(\"64-bit CAS takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { x64.compare_exchange_strong(y64, z64, std::memory_order_acq_rel); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n\t\r\n\tprintf(\"32-bit FAA takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { x32.fetch_add(y32, std::memory_order_acq_rel); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n\t\r\n\tprintf(\"64-bit FAA takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { x64.fetch_add(y64, std::memory_order_acq_rel); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n\t\r\n\tprintf(\"std::this_thread::get_id() takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { std::this_thread::get_id(); },\r\n\t\t\t10000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n\t\r\n#ifdef _WIN32\r\n\tprintf(\"GetCurrentThreadId() takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { GetCurrentThreadId(); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n#endif\r\n\t\r\n#if !defined(__APPLE__) || (!defined(TARGET_IPHONE_SIMULATOR) && !defined(TARGET_OS_IPHONE))\r\n\tvolatile uintptr_t ghettoId = 0;\r\n\tprintf(\"ghetto_thread_id() takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t[&]() { ghettoId += ghetto_thread_id(); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n#endif\r\n\t\r\n\treturn 0;\r\n}\r\n<commit_msg>Added mach pthread ID benchmark -- untested!<commit_after>#include \"microbench\/microbench.h\"\r\n\r\n#include <cstdio>\r\n#include <cstdlib>\r\n#include <atomic>\r\n#include <thread>\r\n#include <cstdint>\r\n\r\n#ifdef __APPLE__\r\n#include <pthread.h>\r\n#endif\r\n\r\n#ifdef _WIN32\r\n#define WIN32_LEAN_AND_MEAN\r\n#define NOMINMAX\r\n#include <windows.h>\r\n#define THREAD_LOCAL __declspec(thread)\r\n#else\r\n#define THREAD_LOCAL thread_local\r\n#endif\r\n\r\nuintptr_t ghetto_thread_id()\r\n{\r\n\tstatic THREAD_LOCAL int x;\r\n\treturn reinterpret_cast<uintptr_t>(&x);\r\n}\r\n\r\nint main(int argc, char** argv)\r\n{\r\n\tstd::atomic<int> x32(0);\r\n\tint y32 = rand();\r\n\tint z32 = rand();\r\n\tif (sizeof(x32) != 4) exit(1);\r\n\t\r\n\tstd::atomic<long long> x64(0);\r\n\tlong long y64 = rand();\r\n\tlong long z64 = rand();\r\n\tif (sizeof(x64) != 8) exit(2);\r\n\t\r\n\tprintf(\"32-bit CAS takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { x32.compare_exchange_strong(y32, z32, std::memory_order_acq_rel); },\r\n\t\t\t1000000, \/* iterations per test run *\/\r\n\t\t\t50 \/* number of test runs *\/\r\n\t\t) * 1000 * 1000    \/\/ ms -> ns\r\n\t);\r\n\t\r\n\tprintf(\"64-bit CAS takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { x64.compare_exchange_strong(y64, z64, std::memory_order_acq_rel); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n\t\r\n\tprintf(\"32-bit FAA takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { x32.fetch_add(y32, std::memory_order_acq_rel); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n\t\r\n\tprintf(\"64-bit FAA takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { x64.fetch_add(y64, std::memory_order_acq_rel); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n\t\r\n\tprintf(\"std::this_thread::get_id() takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { std::this_thread::get_id(); },\r\n\t\t\t10000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n\t\r\n#ifdef _WIN32\r\n\tprintf(\"GetCurrentThreadId() takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t\t[&]() { GetCurrentThreadId(); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n#endif\r\n\t\r\n#if !defined(__APPLE__) || (!defined(TARGET_IPHONE_SIMULATOR) && !defined(TARGET_OS_IPHONE))\r\n\tvolatile uintptr_t ghettoId = 0;\r\n\tprintf(\"ghetto_thread_id() takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t[&]() { ghettoId += ghetto_thread_id(); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n#endif\r\n\r\n#ifdef __APPLE__\r\n\tvolatile mach_port_t machId = 0;\r\n\tprintf(\"pthread_mach_thread_np(pthread_self()) takes %.4fns on average\\n\",\r\n\t\tmoodycamel::microbench(\r\n\t\t[&]() { machId = pthread_mach_thread_np(pthread_self()); },\r\n\t\t\t1000000,\r\n\t\t\t50\r\n\t\t) * 1000 * 1000\r\n\t);\r\n#endif\r\n\t\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include <ncurses.h>\n#include <utility>\n\n#include \"board.hpp\"\n#include \"print.hpp\"\n#include \"reversi.hpp\"\n\nnamespace roadagain\n{\n\nReversi::Reversi() : black_(2), white_(2)\n{\n}\n\nReversi::~Reversi()\n{\n}\n\nvoid Reversi::start()\n{\n    print();\n}\n\nstd::pair<int, int> Reversi::put()\n{\n    int y = 0;\n    int x = 0;\n    char c = getch();\n\n    while (c != '\\n'){\n\n        switch (c){\n          case 'h':\n            x = (x + Board::COL - 1) % Board::COL;\n            break;\n          case 'j':\n            y = (y + 1) % Board::ROW;\n            break;\n          case 'k':\n            y = (y + Board::ROW - 1) % Board::ROW;\n            break;\n          case 'l':\n            x = (x + 1) % Board::COL;\n            break;\n        }\n        print_stone(y, x, BLACK);\n    }\n\n    return (std::pair<int, int>(y, x));\n}\n\n}\n<commit_msg>Moved getch from initialize to substitute<commit_after>#include <ncurses.h>\n#include <utility>\n\n#include \"board.hpp\"\n#include \"print.hpp\"\n#include \"reversi.hpp\"\n\nnamespace roadagain\n{\n\nReversi::Reversi() : black_(2), white_(2)\n{\n}\n\nReversi::~Reversi()\n{\n}\n\nvoid Reversi::start()\n{\n    print();\n}\n\nstd::pair<int, int> Reversi::put()\n{\n    int y = 0;\n    int x = 0;\n    char c;\n\n\n    c = getch();\n    while (c != '\\n'){\n        switch (c){\n          case 'h':\n            x = (x + Board::COL - 1) % Board::COL;\n            break;\n          case 'j':\n            y = (y + 1) % Board::ROW;\n            break;\n          case 'k':\n            y = (y + Board::ROW - 1) % Board::ROW;\n            break;\n          case 'l':\n            x = (x + 1) % Board::COL;\n            break;\n        }\n        print_stone(y, x, BLACK);\n        c = getch();\n    }\n\n    return (std::pair<int, int>(y, x));\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"VM.hpp\"\n#include \"detail\/ruby.hpp\"\n\n#ifndef RUBY_VM\nextern C\n{\n#include \"env.h\"\n}\n#endif\n\n#include <stdexcept>\n\nRice::VM::\nVM(char * app_name)\n{\n  Object o;\n  init_stack(&o);\n  init(1, &app_name);\n}\n\nRice::VM::\nVM(int argc, char * argv[])\n{\n  Object o;\n  init_stack(&o);\n  init(argc, argv);\n}\n\nRice::VM::\nVM(std::vector<char *> const & args)\n{\n  check_not_initialized();\n  Object o;\n  init_stack(&o);\n  init(args.size(), const_cast<char * *>(&args[0]));\n}\n\nRice::VM::\n~VM()\n{\n  Object o;\n  init_stack(&o);\n}\n\n#if RUBY_VERSION_CODE < 186\n  extern \"C\"\n  void Init_stack(VALUE *);\n#endif\n\nvoid Rice::VM::\ninit_stack(Object * location_on_stack)\n{\n  VALUE * v = const_cast<VALUE *>(&location_on_stack->value());\n#if RUBY_VERSION_CODE >= 186\n  ruby_init_stack(v);\n#else\n  Init_stack(v);\n#endif\n}\n\nvoid Rice::VM::\nrun()\n{\n  Object o;\n  init_stack(&o);\n#ifdef RUBY_VM\n#else\n  ruby_run();\n#endif\n}\n\nextern \"C\"\n{\n\nRUBY_EXTERN VALUE * rb_gc_stack_start;\n\n}\n\nvoid Rice::VM::\ncheck_not_initialized() const\n{\n  if(rb_gc_stack_start)\n  {\n    throw std::runtime_error(\"Only one VM allowed per application\");\n  }\n}\n\nvoid Rice::VM::\ninit(int argc, char * argv[])\n{\n  ruby_init();\n  ruby_options(argc, argv);\n}\n\n<commit_msg>Fixed extern C to extern \"C\".<commit_after>#include \"VM.hpp\"\n#include \"detail\/ruby.hpp\"\n\n#ifndef RUBY_VM\nextern \"C\"\n{\n#include \"env.h\"\n}\n#endif\n\n#include <stdexcept>\n\nRice::VM::\nVM(char * app_name)\n{\n  Object o;\n  init_stack(&o);\n  init(1, &app_name);\n}\n\nRice::VM::\nVM(int argc, char * argv[])\n{\n  Object o;\n  init_stack(&o);\n  init(argc, argv);\n}\n\nRice::VM::\nVM(std::vector<char *> const & args)\n{\n  check_not_initialized();\n  Object o;\n  init_stack(&o);\n  init(args.size(), const_cast<char * *>(&args[0]));\n}\n\nRice::VM::\n~VM()\n{\n  Object o;\n  init_stack(&o);\n}\n\n#if RUBY_VERSION_CODE < 186\n  extern \"C\"\n  void Init_stack(VALUE *);\n#endif\n\nvoid Rice::VM::\ninit_stack(Object * location_on_stack)\n{\n  VALUE * v = const_cast<VALUE *>(&location_on_stack->value());\n#if RUBY_VERSION_CODE >= 186\n  ruby_init_stack(v);\n#else\n  Init_stack(v);\n#endif\n}\n\nvoid Rice::VM::\nrun()\n{\n  Object o;\n  init_stack(&o);\n#ifdef RUBY_VM\n#else\n  ruby_run();\n#endif\n}\n\nextern \"C\"\n{\n\nRUBY_EXTERN VALUE * rb_gc_stack_start;\n\n}\n\nvoid Rice::VM::\ncheck_not_initialized() const\n{\n  if(rb_gc_stack_start)\n  {\n    throw std::runtime_error(\"Only one VM allowed per application\");\n  }\n}\n\nvoid Rice::VM::\ninit(int argc, char * argv[])\n{\n  ruby_init();\n  ruby_options(argc, argv);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n   Source File : RotatedPagesPDF.cpp\n\n\n   Copyright 2011 Gal Kahana PDFWriter\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF 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 \"RotatedPagesPDF.h\"\n#include \"PageContentContext.h\"\n#include \"PDFWriter.h\"\n#include \"PDFPage.h\"\n#include \"PDFRectangle.h\"\n#include \"PDFPageInput.h\"\n#include \"TestsRunner.h\"\n\n#include <iostream>\n\nusing namespace std;\nusing namespace PDFHummus;\n\nRotatedPagesPDF::RotatedPagesPDF(void)\n{\n}\n\nRotatedPagesPDF::~RotatedPagesPDF(void)\n{\n}\n\nEStatusCode RotatedPagesPDF::Run(const TestConfiguration& inTestConfiguration)\n{\n\tLogConfiguration logConfiguration(true,true,RelativeURLToLocalPath(inTestConfiguration.mSampleFileBase,\"RotatedPagesLog.txt\"));\n\tEStatusCode status; \n\n\tdo\n\t{\n\t\t\/\/ PDF Page rotation writing\n\n\t\tPDFWriter pdfWriter;\n\t\tstatus = pdfWriter.StartPDF(RelativeURLToLocalPath(inTestConfiguration.mSampleFileBase,\"RotatedPages.PDF\"),ePDFVersion13,logConfiguration);\n\t\tif(status != PDFHummus::eSuccess)\n\t\t{\n\t\t\tcout<<\"failed to start PDF\\n\";\n\t\t\tbreak;\n\t\t}\t\n\n\t\tAbstractContentContext::TextOptions textOptions(pdfWriter.GetFontForFile(\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tRelativeURLToLocalPath(\n                                                                            inTestConfiguration.mSampleFileBase,\n                                                                            \"TestMaterials\/fonts\/arial.ttf\")),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t14,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tAbstractContentContext::eGray,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t0);\n\n\t\tfor(int i=0;i<4 && PDFHummus::eSuccess == status;++i)\n\t\t{\n\t\t\tPDFPage page;\n\t\t\tpage.SetMediaBox(PDFRectangle(0,0,595,842));\n\t\t\tpage.SetRotate(i*90);\n\t\t\n\t\t\tstd::ostringstream s;\n\t\t\ts << \"Page rotated by \" << i*90 << \" degrees.\";\n\n\t\t\tPageContentContext* cxt = pdfWriter.StartPageContentContext(&page);\n\t\t\tcxt->WriteText(75,805,s.str(),textOptions);\n\t\t\tstatus = pdfWriter.EndPageContentContext(cxt);\n\t\t\tif(status != eSuccess)\n\t\t\t{\n\t\t\t\tstatus = PDFHummus::eFailure;\n\t\t\t\tcout<<\"Failed to end content context\\n\";\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tstatus = pdfWriter.WritePage(&page);\n\t\t\tif(status != PDFHummus::eSuccess)\n\t\t\t\tcout<<\"failed to write page \"<<i<<\"\\n\";\n\t\t}\n\n\t\tstatus = pdfWriter.EndPDF();\n\t\tif(status != PDFHummus::eSuccess)\n\t\t{\n\t\t\tcout<<\"failed in end PDF\\n\";\n\t\t\tbreak;\n\t\t}\n\n\n\t\t\/\/ PDF Page rotation parsing\n\n\t\tInputFile pdfFile;\n\t\tPDFParser pdfParser;\n\n\t\tstatus = pdfFile.OpenFile(RelativeURLToLocalPath(inTestConfiguration.mSampleFileBase,\"RotatedPages.PDF\"));\n\t\tif(status != PDFHummus::eSuccess)\n\t\t{\n\t\t\tcout<<\"unable to open file for reading. should be in TestMaterials\/XObjectContent.PDF\\n\";\n\t\t\tbreak;\n\t\t}\n\n\t\tstatus = pdfParser.StartPDFParsing(pdfFile.GetInputStream());\n\t\tif(status != PDFHummus::eSuccess)\n\t\t{\n\t\t\tcout<<\"unable to parse input file\";\n\t\t\tbreak;\n\t\t}\n\n\t\tif(pdfParser.GetPagesCount() != 4)\n\t\t{\n\t\t\tcout<<\"expecting 4 pages, got \"<<pdfParser.GetPagesCount()<<\"\\n\";\n\t\t\tstatus = PDFHummus::eFailure;\n\t\t\tbreak;\n\t\t}\n\n\t\tfor(int i=0;i<4 && PDFHummus::eSuccess == status;++i)\n\t\t{\n\t\t\tRefCountPtr<PDFDictionary> page = pdfParser.ParsePage(i);\n\t\t\tif (!page)\n\t\t\t{\n\t\t\t\tcout << i << \". page parsing failed\\n\";\n\t\t\t\tstatus = PDFHummus::eFailure;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tPDFPageInput input( &pdfParser, page );\n\t\t\tif ( input.GetRotate() != i*90 )\n\t\t\t{\n\t\t\t\tcout<< i << \". page has invalid rotation\\n\";\n\t\t\t\tstatus = PDFHummus::eFailure;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t}while(false);\n\treturn status;\n}\n\n\nADD_CATEGORIZED_TEST(RotatedPagesPDF,\"PDF\")\n<commit_msg>Add test for invalid rotation (must be multiple of 90)<commit_after>\/*\n   Source File : RotatedPagesPDF.cpp\n\n\n   Copyright 2011 Gal Kahana PDFWriter\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF 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 \"RotatedPagesPDF.h\"\n#include \"PageContentContext.h\"\n#include \"PDFWriter.h\"\n#include \"PDFPage.h\"\n#include \"PDFRectangle.h\"\n#include \"PDFPageInput.h\"\n#include \"TestsRunner.h\"\n\n#include <iostream>\n\nusing namespace std;\nusing namespace PDFHummus;\n\nRotatedPagesPDF::RotatedPagesPDF(void)\n{\n}\n\nRotatedPagesPDF::~RotatedPagesPDF(void)\n{\n}\n\nEStatusCode RotatedPagesPDF::Run(const TestConfiguration& inTestConfiguration)\n{\n\tLogConfiguration logConfiguration(true,true,RelativeURLToLocalPath(inTestConfiguration.mSampleFileBase,\"RotatedPagesLog.txt\"));\n\tEStatusCode status; \n\n\tdo\n\t{\n\t\t\/\/ PDF Page rotation writing\n\n\t\tPDFWriter pdfWriter;\n\t\tstatus = pdfWriter.StartPDF(RelativeURLToLocalPath(inTestConfiguration.mSampleFileBase,\"RotatedPages.PDF\"),ePDFVersion13,logConfiguration);\n\t\tif(status != PDFHummus::eSuccess)\n\t\t{\n\t\t\tcout<<\"failed to start PDF\\n\";\n\t\t\tbreak;\n\t\t}\t\n\n\t\tAbstractContentContext::TextOptions textOptions(pdfWriter.GetFontForFile(\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tRelativeURLToLocalPath(\n                                                                            inTestConfiguration.mSampleFileBase,\n                                                                            \"TestMaterials\/fonts\/arial.ttf\")),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t14,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tAbstractContentContext::eGray,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t0);\n\n\t\tfor(int i=0;i<4 && PDFHummus::eSuccess == status;++i)\n\t\t{\n\t\t\tPDFPage page;\n\t\t\tpage.SetMediaBox(PDFRectangle(0,0,595,842));\n\n\t\t\tpage.SetRotate(33);\n\t\t\tif ( page.GetRotate().second != 0 )\n\t\t\t{\n\t\t\t\tstatus = PDFHummus::eFailure;\n\t\t\t\tcout<<\"Failed to reject invalid rotation\\n\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tpage.SetRotate(i*90);\n\t\t\n\t\t\tstd::ostringstream s;\n\t\t\ts << \"Page rotated by \" << i*90 << \" degrees.\";\n\n\t\t\tPageContentContext* cxt = pdfWriter.StartPageContentContext(&page);\n\t\t\tcxt->WriteText(75,805,s.str(),textOptions);\n\t\t\tstatus = pdfWriter.EndPageContentContext(cxt);\n\t\t\tif(status != eSuccess)\n\t\t\t{\n\t\t\t\tstatus = PDFHummus::eFailure;\n\t\t\t\tcout<<\"Failed to end content context\\n\";\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tstatus = pdfWriter.WritePage(&page);\n\t\t\tif(status != PDFHummus::eSuccess)\n\t\t\t\tcout<<\"failed to write page \"<<i<<\"\\n\";\n\t\t}\n\n\t\tstatus = pdfWriter.EndPDF();\n\t\tif(status != PDFHummus::eSuccess)\n\t\t{\n\t\t\tcout<<\"failed in end PDF\\n\";\n\t\t\tbreak;\n\t\t}\n\n\n\t\t\/\/ PDF Page rotation parsing\n\n\t\tInputFile pdfFile;\n\t\tPDFParser pdfParser;\n\n\t\tstatus = pdfFile.OpenFile(RelativeURLToLocalPath(inTestConfiguration.mSampleFileBase,\"RotatedPages.PDF\"));\n\t\tif(status != PDFHummus::eSuccess)\n\t\t{\n\t\t\tcout<<\"unable to open file for reading. should be in TestMaterials\/XObjectContent.PDF\\n\";\n\t\t\tbreak;\n\t\t}\n\n\t\tstatus = pdfParser.StartPDFParsing(pdfFile.GetInputStream());\n\t\tif(status != PDFHummus::eSuccess)\n\t\t{\n\t\t\tcout<<\"unable to parse input file\";\n\t\t\tbreak;\n\t\t}\n\n\t\tif(pdfParser.GetPagesCount() != 4)\n\t\t{\n\t\t\tcout<<\"expecting 4 pages, got \"<<pdfParser.GetPagesCount()<<\"\\n\";\n\t\t\tstatus = PDFHummus::eFailure;\n\t\t\tbreak;\n\t\t}\n\n\t\tfor(int i=0;i<4 && PDFHummus::eSuccess == status;++i)\n\t\t{\n\t\t\tRefCountPtr<PDFDictionary> page = pdfParser.ParsePage(i);\n\t\t\tif (!page)\n\t\t\t{\n\t\t\t\tcout << i << \". page parsing failed\\n\";\n\t\t\t\tstatus = PDFHummus::eFailure;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tPDFPageInput input( &pdfParser, page );\n\t\t\tif ( input.GetRotate() != i*90 )\n\t\t\t{\n\t\t\t\tcout<< i << \". page has invalid rotation\\n\";\n\t\t\t\tstatus = PDFHummus::eFailure;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t}while(false);\n\treturn status;\n}\n\n\nADD_CATEGORIZED_TEST(RotatedPagesPDF,\"PDF\")\n<|endoftext|>"}
{"text":"<commit_before>#include \"server_functions.h\"\n#include <string.h>\n\n#include <iostream>\n#include <sstream>\n\n#include <netinet\/in.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/param.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <vector>\n#include <algorithm>\n#include <list>\n#include <map>\n\n#include <netdb.h>\n#include <stdlib.h>\n\n#include \"segment.h\"\n#include \"message.h\"\n#include \"register_success_message.h\"\n#include \"register_failure_message.h\"\n#include \"register_request_message.h\"\n#include \"loc_success_message.h\"\n#include \"loc_failure_message.h\"\n#include \"loc_request_message.h\"\n\n#include \"rpc.h\"\n#include \"constants.h\"\n#include \"helper_function.h\"\n#include \"message_types.h\"\n\nusing namespace std;\n\n\/\/TODO:\n\/\/MANAGE CLIENT CONNECTION\n\/\/MANAGE SERVER CONNECTION\n\/\/DATABASE\n\/\/ROUND ROBIN\n\n\n\nstatic map<procedure_signature, list<server_info *> * > proc_loc_dict;\nstatic list<server_function_info *> roundRobinList;\n\n\/*\nTODO:\nADD FUNCTION TO MAP\nADD FUNCTION TO ROUND ROBIN\nIF FUNCTION EXISTS IN ROUND ROBIN DELETE OLD REPLACE WITH NEW (where)\n*\/\nvoid registration_request_handler(RegisterRequestMessage * message, int sock){\n\tchar * name = message->getName().c_str();\n  int * argTypes = message->getArgTypes();\n  string server_identifier = message->getServerIdentifier();\n  int port = message->getPort();\n\n  procedure_signature * key = new procedure_signature(name, argTypes);\n\t\n  \n  int status = 0;\n\n  \/\/if no key dosnt exist in map\n\tif (proc_loc_dict.find(key) == proc_loc_dict.end()) {\n    \/\/Adding to the map\n\n    \/\/int *memArgTypes = copyArgTypes(argTypes);\n    \/\/key = procedure_signature(name, memArgTypes);\n\n    proc_loc_dict[key] = new list<server_info *>();\n    server_info * entry = new server_info(server_identifier, port, sock);\n\n    \/\/Adding to roundRobinList\n    server_function_info * info = new server_function_info(entry, key);\n    roundRobinList.push_back(info);\n\n  }else{\n\n    bool sameLoc = false;\n    list<server_info *> *hostList = proc_loc_dict[key]; \/\/ proc_loc_dict.find[key]\n\n    for (list<server_info *>::iterator it = hostList->begin(); it != hostList->end(); it++) {\n      \/\/ IF THEY ARE AT THE SAME PLACE, THEY SHOULD HAVE TEH SAME SOCKET\n      if((*it)->socket == sock){\n        \/\/The same procedure signature already exists on the same location\n        \/\/TODO: Move to end of round robin or something\n        sameLoc = true;\n      }\n    \n    }\n    \/\/Same procedure signature, different location\n  \tif(!sameLoc){\n       server_info * new_msg_loc = new server_info(server_identifier, port, sock);  \n       hostList->push_back(new_msg_loc);\n    }\n  }\n\n  RegisterSuccessMessage * success_message = new RegisterSuccessMessage(status);\n  success_message->send(sock);\n}\n\n\/*\nTODO:\nUSE ROUND ROBIN TO ACCESS THE CORRECT SERVER\/FUNCTION FOR THE CLIENT\n*\/\nint location_request_handler(LocRequestMessage * message, int sock){\n\n  bool exist = false;\n\tfor (list<server_function_info *>::iterator it = roundRobinList.begin(); it != roundRobinList.end(); it++){\n\n    \/\/If the name are the same\n    if((*it)->ps->name == message->getName() && compareArr((*it)->ps->argTypes, message->getArgTypes() )){\n\n      exist = true;\n\n      LocSuccessMessage * success_message = new LocSuccessMessage((*it)->si->server_identifier, (*it)->si->port);\n\n      success_message->send(sock);\n\n      \/\/When we have identified the correct procedure_signature use round robin and move that service to the end\n      roundRobinList.splice(roundRobinList.end(), roundRobinList, it);\n\n      break;\n \t\t}\n\t}\n\n  if(!exist){\n    int reasoncode = 0;\n    LocFailureMessage * failure_message = new LocFailureMessage(reasoncode);\n    failure_message->send(sock);\n  }\n\n\treturn 0; \/\/LOC_FAILURE\n}\n\nint request_handler(Segment * segment, int sock){\n  int retval = 0;\n  if(segment->getType() == MSG_TYPE_REGISTER_REQUEST){ \/\/'LOC_REQUEST'\n    Message * cast1 = segment->getMessage();\n    RegisterRequestMessage * rrm = dynamic_cast<RegisterRequestMessage*>(cast1);\n    registration_request_handler(rrm, sock);\n\n  }else if (segment->getType() == MSG_TYPE_LOC_REQUEST){ \/\/'REGISTER'\n    Message * cast2 = segment->getMessage();\n    LocRequestMessage * lqm = dynamic_cast<LocRequestMessage*>(cast2);\n    retval = location_request_handler(lqm, sock);\n  }\n\n\treturn retval;\n}\n\n\/\/ Returns the binder address\nstring getBinderAddress() {\n   char hostname[MAXHOSTNAMELEN + 1] = {'\\0'};\n   gethostname(hostname, sizeof(hostname));\n   return string(hostname);\n}\n\n\/\/ Returns the binder port\nint getBinderPort(int welcomeSocket) {\n   struct sockaddr_in binderAddress;\n   socklen_t binderAddressLength = sizeof(binderAddress);\n\n   int result = getsockname(welcomeSocket, (struct sockaddr*) &binderAddress,\n      &binderAddressLength);\n   if (result < 0) {\n      exit(-1);\n   } \/\/ if\n\n   return ntohs(binderAddress.sin_port);\n}\n\n\/\/TODO:\n\/\/Create helper functions that can be used for rpcServer.cc\nint main(){\n\n  vector<int> myConnections;\n  vector<int> myToRemove;\n\n  int status;\n  struct addrinfo hints;\n  struct addrinfo* servinfo;\n  struct addrinfo* p;\n\n  memset(&hints, 0, sizeof hints);\n  hints.ai_family = AF_UNSPEC;\n  hints.ai_socktype = SOCK_STREAM;\n  hints.ai_flags = AI_PASSIVE;\n\n  status = getaddrinfo(NULL, \"0\", &hints, &servinfo);\n\n  if (status != 0) {\n    fprintf(stderr, \"getaddrinfo error: %s\\n\", gai_strerror(status));\n    return 0;\n  }\n\n  p = servinfo;\n  int sock = socket(p->ai_family, p->ai_socktype, p->ai_protocol);\n\n  status = bind(sock, servinfo->ai_addr, servinfo->ai_addrlen);\n  status = listen(sock, 5);\n\n  cout << \"BINDER_ADDRESS \" << getBinderAddress() << endl;\n  cout << \"BINDER_PORT \" << getBinderPort(sock) << endl;\n\n  fd_set readfds;\n  int n;\n  struct sockaddr_storage their_addr;\n\n  while(true){\n    \/\/CONNECTIONS VECTOR\n    FD_ZERO(&readfds);\n    FD_SET(sock, &readfds);\n\n    n = sock;\n\n    for (vector<int>::iterator it = myConnections.begin();it != myConnections.end(); ++it) {\n      int connection = *it;\n      FD_SET(connection, &readfds);\n       if (connection > n){\n        n = connection;\n      }\n    }\n\n    n = n+1;\n\n    status = select(n, &readfds, NULL, NULL, NULL);\n\n    if (status == -1) {\n      cerr << \"ERROR: select failed.\" << endl;\n    } else {\n\n      if (FD_ISSET(sock, &readfds)) {\n        socklen_t addr_size = sizeof their_addr;\n        int new_sock = accept(sock, (struct sockaddr*)&their_addr, &addr_size);\n\n        if (new_sock < 0) {\n          cerr << \"ERROR: while accepting connection\" << endl;\n          close(new_sock);\n          continue;\n        }\n\n        myConnections.push_back(new_sock);\n\n      } else {\n\n        for (vector<int>::iterator it = myConnections.begin(); it != myConnections.end(); ++it) {\n          int tempConnection = *it;\n          if (FD_ISSET(tempConnection, &readfds)) {\n\n            Segment * segment = 0;\n            status = Segment::receive(sock, segment);\n\n            if (status < 0) {\n                RegisterFailureMessage * failure_message = new RegisterFailureMessage(status);\n                failure_message->send(sock);\n                return status;\n            }\n\n            if (status == 0) {\n              \/\/ client has closed the connection\n              myToRemove.push_back(sock);\n              return status;\n            }\n\n            request_handler(segment, sock);\n          }\n        }\n      }\n\n      for (vector<int>::iterator it = myToRemove.begin(); it != myToRemove.end(); ++it) {\n        myConnections.erase(remove(myConnections.begin(), myConnections.end(), *it), myConnections.end());\n        close(*it);\n      }\n      myToRemove.clear();\n    }\n  }\n\n  freeaddrinfo(servinfo);\n}\n<commit_msg>changes<commit_after>#include \"server_functions.h\"\n#include <string.h>\n\n#include <iostream>\n#include <sstream>\n\n#include <netinet\/in.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/param.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <vector>\n#include <algorithm>\n#include <list>\n#include <map>\n\n#include <netdb.h>\n#include <stdlib.h>\n\n#include \"segment.h\"\n#include \"message.h\"\n#include \"register_success_message.h\"\n#include \"register_failure_message.h\"\n#include \"register_request_message.h\"\n#include \"loc_success_message.h\"\n#include \"loc_failure_message.h\"\n#include \"loc_request_message.h\"\n\n#include \"rpc.h\"\n#include \"constants.h\"\n#include \"helper_function.h\"\n#include \"message_types.h\"\n\nusing namespace std;\n\n\/\/TODO:\n\/\/MANAGE CLIENT CONNECTION\n\/\/MANAGE SERVER CONNECTION\n\/\/DATABASE\n\/\/ROUND ROBIN\n\n\n\nstatic map<procedure_signature, list<server_info *> * > proc_loc_dict;\nstatic list<server_function_info *> roundRobinList;\n\n\/*\nTODO:\nADD FUNCTION TO MAP\nADD FUNCTION TO ROUND ROBIN\nIF FUNCTION EXISTS IN ROUND ROBIN DELETE OLD REPLACE WITH NEW (where)\n*\/\nvoid registration_request_handler(RegisterRequestMessage * message, int sock){\n\tchar * name = message->getName().c_str();\n  int * argTypes = message->getArgTypes();\n  string server_identifier = message->getServerIdentifier();\n  int port = message->getPort();\n\n  procedure_signature * key = new procedure_signature(name, argTypes);\n\t\n  \n  int status = 0;\n\n  \/\/if no key dosnt exist in map\n\tif (proc_loc_dict.find(key) == proc_loc_dict.end()) {\n    \/\/Adding to the map\n\n    \/\/int *memArgTypes = copyArgTypes(argTypes);\n    \/\/key = procedure_signature(name, memArgTypes);\n\n    proc_loc_dict[key] = new list<server_info *>();\n    server_info * entry = new server_info(server_identifier, port, sock);\n\n    \/\/Adding to roundRobinList\n    server_function_info * info = new server_function_info(entry, key);\n    roundRobinList.push_back(info);\n\n  }else{\n\n    bool sameLoc = false;\n    \/\/list<server_info *> *hostList = proc_loc_dict[key];\n    list<server_info *> *hostList = proc_loc_dict.find(key);\n\n    for (list<server_info *>::iterator it = hostList->begin(); it != hostList->end(); it++) {\n      \/\/ IF THEY ARE AT THE SAME PLACE, THEY SHOULD HAVE TEH SAME SOCKET\n      if((*it)->socket == sock){\n        \/\/The same procedure signature already exists on the same location\n        \/\/TODO: Move to end of round robin or something\n        sameLoc = true;\n      }\n    \n    }\n    \/\/Same procedure signature, different location\n  \tif(!sameLoc){\n       server_info * new_msg_loc = new server_info(server_identifier, port, sock);  \n       hostList->push_back(new_msg_loc);\n    }\n  }\n\n  RegisterSuccessMessage * success_message = new RegisterSuccessMessage(status);\n  success_message->send(sock);\n}\n\n\/*\nTODO:\nUSE ROUND ROBIN TO ACCESS THE CORRECT SERVER\/FUNCTION FOR THE CLIENT\n*\/\nint location_request_handler(LocRequestMessage * message, int sock){\n\n  bool exist = false;\n\tfor (list<server_function_info *>::iterator it = roundRobinList.begin(); it != roundRobinList.end(); it++){\n\n    \/\/If the name are the same\n    if((*it)->ps->name == message->getName() && compareArr((*it)->ps->argTypes, message->getArgTypes() )){\n\n      exist = true;\n\n      LocSuccessMessage * success_message = new LocSuccessMessage((*it)->si->server_identifier, (*it)->si->port);\n\n      success_message->send(sock);\n\n      \/\/When we have identified the correct procedure_signature use round robin and move that service to the end\n      roundRobinList.splice(roundRobinList.end(), roundRobinList, it);\n\n      break;\n \t\t}\n\t}\n\n  if(!exist){\n    int reasoncode = 0;\n    LocFailureMessage * failure_message = new LocFailureMessage(reasoncode);\n    failure_message->send(sock);\n  }\n\n\treturn 0; \/\/LOC_FAILURE\n}\n\nint request_handler(Segment * segment, int sock){\n  int retval = 0;\n  if(segment->getType() == MSG_TYPE_REGISTER_REQUEST){ \/\/'LOC_REQUEST'\n    Message * cast1 = segment->getMessage();\n    RegisterRequestMessage * rrm = dynamic_cast<RegisterRequestMessage*>(cast1);\n    registration_request_handler(rrm, sock);\n\n  }else if (segment->getType() == MSG_TYPE_LOC_REQUEST){ \/\/'REGISTER'\n    Message * cast2 = segment->getMessage();\n    LocRequestMessage * lqm = dynamic_cast<LocRequestMessage*>(cast2);\n    retval = location_request_handler(lqm, sock);\n  }\n\n\treturn retval;\n}\n\n\/\/ Returns the binder address\nstring getBinderAddress() {\n   char hostname[MAXHOSTNAMELEN + 1] = {'\\0'};\n   gethostname(hostname, sizeof(hostname));\n   return string(hostname);\n}\n\n\/\/ Returns the binder port\nint getBinderPort(int welcomeSocket) {\n   struct sockaddr_in binderAddress;\n   socklen_t binderAddressLength = sizeof(binderAddress);\n\n   int result = getsockname(welcomeSocket, (struct sockaddr*) &binderAddress,\n      &binderAddressLength);\n   if (result < 0) {\n      exit(-1);\n   } \/\/ if\n\n   return ntohs(binderAddress.sin_port);\n}\n\n\/\/TODO:\n\/\/Create helper functions that can be used for rpcServer.cc\nint main(){\n\n  vector<int> myConnections;\n  vector<int> myToRemove;\n\n  int status;\n  struct addrinfo hints;\n  struct addrinfo* servinfo;\n  struct addrinfo* p;\n\n  memset(&hints, 0, sizeof hints);\n  hints.ai_family = AF_UNSPEC;\n  hints.ai_socktype = SOCK_STREAM;\n  hints.ai_flags = AI_PASSIVE;\n\n  status = getaddrinfo(NULL, \"0\", &hints, &servinfo);\n\n  if (status != 0) {\n    fprintf(stderr, \"getaddrinfo error: %s\\n\", gai_strerror(status));\n    return 0;\n  }\n\n  p = servinfo;\n  int sock = socket(p->ai_family, p->ai_socktype, p->ai_protocol);\n\n  status = bind(sock, servinfo->ai_addr, servinfo->ai_addrlen);\n  status = listen(sock, 5);\n\n  cout << \"BINDER_ADDRESS \" << getBinderAddress() << endl;\n  cout << \"BINDER_PORT \" << getBinderPort(sock) << endl;\n\n  fd_set readfds;\n  int n;\n  struct sockaddr_storage their_addr;\n\n  while(true){\n    \/\/CONNECTIONS VECTOR\n    FD_ZERO(&readfds);\n    FD_SET(sock, &readfds);\n\n    n = sock;\n\n    for (vector<int>::iterator it = myConnections.begin();it != myConnections.end(); ++it) {\n      int connection = *it;\n      FD_SET(connection, &readfds);\n       if (connection > n){\n        n = connection;\n      }\n    }\n\n    n = n+1;\n\n    status = select(n, &readfds, NULL, NULL, NULL);\n\n    if (status == -1) {\n      cerr << \"ERROR: select failed.\" << endl;\n    } else {\n\n      if (FD_ISSET(sock, &readfds)) {\n        socklen_t addr_size = sizeof their_addr;\n        int new_sock = accept(sock, (struct sockaddr*)&their_addr, &addr_size);\n\n        if (new_sock < 0) {\n          cerr << \"ERROR: while accepting connection\" << endl;\n          close(new_sock);\n          continue;\n        }\n\n        myConnections.push_back(new_sock);\n\n      } else {\n\n        for (vector<int>::iterator it = myConnections.begin(); it != myConnections.end(); ++it) {\n          int tempConnection = *it;\n          if (FD_ISSET(tempConnection, &readfds)) {\n\n            Segment * segment = 0;\n            status = Segment::receive(sock, segment);\n\n            if (status < 0) {\n                RegisterFailureMessage * failure_message = new RegisterFailureMessage(status);\n                failure_message->send(sock);\n                return status;\n            }\n\n            if (status == 0) {\n              \/\/ client has closed the connection\n              myToRemove.push_back(sock);\n              return status;\n            }\n\n            request_handler(segment, sock);\n          }\n        }\n      }\n\n      for (vector<int>::iterator it = myToRemove.begin(); it != myToRemove.end(); ++it) {\n        myConnections.erase(remove(myConnections.begin(), myConnections.end(), *it), myConnections.end());\n        close(*it);\n      }\n      myToRemove.clear();\n    }\n  }\n\n  freeaddrinfo(servinfo);\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_REGISTRATION_TRANSFORMATION_ESTIMATION_LM_HPP_\n#define PCL_REGISTRATION_TRANSFORMATION_ESTIMATION_LM_HPP_\n\n#include \"pcl\/registration\/warp_point_rigid.h\"\n#include \"pcl\/registration\/warp_point_rigid_6d.h\"\n#include \"pcl\/registration\/distances.h\"\n#include <unsupported\/Eigen\/NonLinearOptimization>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::estimateRigidTransformation (\n    const pcl::PointCloud<PointSource> &cloud_src,\n    const pcl::PointCloud<PointTarget> &cloud_tgt,\n    Eigen::Matrix4f &transformation_matrix)\n{\n\n  \/\/ <cloud_src,cloud_src> is the source dataset\n  if (cloud_src.points.size () != cloud_tgt.points.size ())\n  {\n    PCL_ERROR (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation] \");\n    PCL_ERROR (\"Number or points in source (%lu) differs than target (%lu)!\\n\", \n               (unsigned long)cloud_src.points.size (), (unsigned long)cloud_tgt.points.size ());\n    return;\n  }\n  if (cloud_src.points.size () < 4)     \/\/ need at least 4 samples\n  {\n    PCL_ERROR (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation] \");\n    PCL_ERROR (\"Need at least 4 points to estimate a transform! Source and target have %lu points!\\n\", \n               (unsigned long)cloud_src.points.size ());\n    return;\n  }\n\n  \/\/ If no warp function has been set, use the default (WarpPointRigid6D)\n  if (!warp_point_)\n    warp_point_.reset (new WarpPointRigid6D<PointSource, PointTarget>);\n\n  int n_unknowns = warp_point_->getDimension ();\n  int m = cloud_src.points.size ();\n  Eigen::VectorXd x(n_unknowns);\n  x.setZero ();\n  \n  \/\/ Set temporary pointers\n  tmp_src_ = &cloud_src;\n  tmp_tgt_ = &cloud_tgt;\n\n  OptimizationFunctor functor (n_unknowns, m, this);\n  Eigen::NumericalDiff<OptimizationFunctor> num_diff (functor);\n  Eigen::LevenbergMarquardt<Eigen::NumericalDiff<OptimizationFunctor> > lm (num_diff);\n  int info = lm.minimize (x);\n\n  \/\/ Compute the norm of the residuals\n  PCL_DEBUG (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation]\");\n  PCL_DEBUG (\"LM solver finished with exit code %i, having a residual norm of %g. \\n\", info, lm.fvec.norm ());\n  if(n_unknowns == 7)\n    PCL_DEBUG (\"Final solution: [%f %f %f %f] [%f %f %f]\\n\", x[0], x[1], x[2], x[3], x[4], x[5], x[6]);\n  else\n    PCL_DEBUG (\"Final solution: [%f %f %f] [%f %f %f]\\n\", x[0], x[1], x[2], x[3], x[4], x[5]);\n  \n  \/\/ Return the correct transformation\n  transformation_matrix.setZero ();\n\n  Eigen::Quaternionf q (0, x[3], x[4], x[5]);\n  q.w () = sqrt (1 - q.dot (q));   \/\/ Compute w from the unit quaternion\n  transformation_matrix.topLeftCorner<3, 3> () = q.toRotationMatrix ();\n\n  Eigen::Vector4f t (x[0], x[1], x[2], 1.0);\n  transformation_matrix.block <4, 1> (0, 3) = t;\n\n  tmp_src_ = NULL;\n  tmp_tgt_ = NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::estimateRigidTransformation (\n    const pcl::PointCloud<PointSource> &cloud_src,\n    const std::vector<int> &indices_src,\n    const pcl::PointCloud<PointTarget> &cloud_tgt,\n    Eigen::Matrix4f &transformation_matrix)\n{\n  if (indices_src.size () != cloud_tgt.points.size ())\n  {\n    PCL_ERROR (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation] Number or points in source (%lu) differs than target (%lu)!\\n\", (unsigned long)indices_src.size (), (unsigned long)cloud_tgt.points.size ());\n    return;\n  }\n\n  \/\/ <cloud_src,cloud_src> is the source dataset\n  transformation_matrix.setIdentity ();\n\n  const int nr_correspondences = (int)cloud_tgt.points.size ();\n  std::vector<int> indices_tgt;\n  indices_tgt.resize(nr_correspondences);\n  for (int i = 0; i < nr_correspondences; ++i)\n    indices_tgt[i] = i;\n\n  estimateRigidTransformation(cloud_src, indices_src, cloud_tgt, indices_tgt, transformation_matrix);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> inline void\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::estimateRigidTransformation (\n    const pcl::PointCloud<PointSource> &cloud_src,\n    const std::vector<int> &indices_src,\n    const pcl::PointCloud<PointTarget> &cloud_tgt,\n    const std::vector<int> &indices_tgt,\n    Eigen::Matrix4f &transformation_matrix)\n{\n  if (indices_src.size () != indices_tgt.size ())\n  {\n    PCL_ERROR (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation] Number or points in source (%lu) differs than target (%lu)!\\n\", (unsigned long)indices_src.size (), (unsigned long)indices_tgt.size ());\n    return;\n  }\n\n  if (indices_src.size () < 4)     \/\/ need at least 4 samples\n  {\n    PCL_ERROR (\"[pcl::IterativeClosestPointNonLinear::estimateRigidTransformationLM] \");\n    PCL_ERROR (\"Need at least 4 points to estimate a transform! Source and target have %lu points!\",\n               (unsigned long)indices_src.size ());\n    return;\n  }\n\n  \/\/ If no warp function has been set, use the default (WarpPointRigid6D)\n  if (!warp_point_)\n    warp_point_.reset (new WarpPointRigid6D<PointSource, PointTarget>);\n\n  int n_unknowns = warp_point_->getDimension ();  \/\/ get dimension of unknown space\n  int m = indices_src.size ();\n  Eigen::VectorXd x(n_unknowns);\n  x.setConstant (n_unknowns, 0);\n\n  \/\/ Set temporary pointers\n  tmp_src_ = &cloud_src;\n  tmp_tgt_ = &cloud_tgt;\n  tmp_idx_src_ = &indices_src;\n  tmp_idx_tgt_ = &indices_tgt;\n\n  OptimizationFunctorWithIndices functor (n_unknowns, m, this);\n  Eigen::NumericalDiff<OptimizationFunctorWithIndices> num_diff (functor);\n  Eigen::LevenbergMarquardt<Eigen::NumericalDiff<OptimizationFunctorWithIndices> > lm (num_diff);\n  int info = lm.minimize (x);\n\n  \/\/ Compute the norm of the residuals\n  PCL_DEBUG (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation]\");\n  PCL_DEBUG (\"LM solver finished with exit code %i, having a residual norm of %g. \\n\", info, lm.fvec.norm ());\n  PCL_DEBUG (\"Final solution: [%f %f %f] [%f %f %f]\\n\", x[0], x[1], x[2], x[3], x[4], x[5]);\n\n  \/\/ Return the correct transformation\n  transformation_matrix.setZero ();\n\n  Eigen::Quaternionf q (0, x[3], x[4], x[5]);\n  q.w () = sqrt (1 - q.dot (q));   \/\/ Compute w from the unit quaternion\n  transformation_matrix.topLeftCorner<3, 3> () = q.toRotationMatrix ();\n\n  Eigen::Vector4f t (x[0], x[1], x[2], 1.0);\n  transformation_matrix.block <4, 1> (0, 3) = t;\n\n  tmp_src_ = NULL;\n  tmp_tgt_ = NULL;\n  tmp_idx_src_ = tmp_idx_tgt_ = NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> inline void\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::estimateRigidTransformation (\n    const pcl::PointCloud<PointSource> &cloud_src,\n    const pcl::PointCloud<PointTarget> &cloud_tgt,\n    const pcl::Correspondences &correspondences,\n    Eigen::Matrix4f &transformation_matrix)\n{\n  const int nr_correspondences = (int)correspondences.size();\n  std::vector<int> indices_src(nr_correspondences);\n  std::vector<int> indices_tgt(nr_correspondences);\n  for (int i = 0; i < nr_correspondences; ++i)\n  {\n    indices_src[i] = correspondences[i].index_query;\n    indices_tgt[i] = correspondences[i].index_match;\n  }\n\n  estimateRigidTransformation(cloud_src, indices_src, cloud_tgt, indices_tgt, transformation_matrix);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> int \npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::OptimizationFunctor::operator() (const Eigen::VectorXd &x, Eigen::VectorXd &fvec) const\n{\n  const PointCloud<PointSource> & src_points = *estimator_->tmp_src_;\n  const PointCloud<PointTarget> & tgt_points = *estimator_->tmp_tgt_;\n  const std::vector<int> & src_indices = *estimator_->tmp_idx_src_;\n  const std::vector<int> & tgt_indices = *estimator_->tmp_idx_tgt_;\n\n  \/\/ Initialize the warp function with the given parameters\n  Eigen::VectorXf params = x.cast<float> ();\n  estimator_->warp_point_->setParam (params);\n\n  \/\/ Transform each source point and compute its distance to the corresponding target point\n  for (int i = 0; i < m_values; i++)\n  {\n    const PointSource & p_src = src_points.points[src_indices[i]];\n    const PointTarget & p_tgt = tgt_points.points[tgt_indices[i]];\n\n    \/\/ Transform the source point based on the current warp parameters\n    PointSource p_src_warped;\n    estimator_->warp_point_->warpPoint (p_src, p_src_warped);\n    \n    \/\/ Estimate the distance (cost function)\n    fvec[i] = estimator_->computeDistance (p_src_warped, p_tgt);\n  }\n  return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> int\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::OptimizationFunctorWithIndices::operator() (const Eigen::VectorXd &x, Eigen::VectorXd &fvec) const\n{\n  const PointCloud<PointSource> & src_points = *estimator_->tmp_src_;\n  const PointCloud<PointTarget> & tgt_points = *estimator_->tmp_tgt_;\n  const std::vector<int> & src_indices = *estimator_->tmp_idx_src_;\n  const std::vector<int> & tgt_indices = *estimator_->tmp_idx_tgt_;\n\n  \/\/ Initialize the warp function with the given parameters\n  Eigen::VectorXf params = x.cast<float> ();\n  estimator_->warp_point_->setParam (params);\n\n  \/\/ Transform each source point and compute its distance to the corresponding target point\n  for (int i = 0; i < m_values; ++i)\n  {\n    const PointSource & p_src = src_points.points[src_indices[i]];\n    const PointTarget & p_tgt = tgt_points.points[tgt_indices[i]];\n\n    \/\/ Transform the source point based on the current warp parameters\n    PointSource p_src_warped;\n    estimator_->warp_point_->warpPoint (p_src, p_src_warped);\n    \n    \/\/ Estimate the distance (cost function)\n    fvec[i] = estimator_->computeDistance (p_src_warped, p_tgt);\n  }\n  return (0);\n}\n\/*\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> inline double \npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::computeMedian (double *fvec, int m)\n{\n  double median;\n  \/\/ Copy the values to vectors for faster sorting\n  std::vector<double> data (m);\n  memcpy (&data[0], fvec, sizeof (double) * m);\n\n  std::sort (data.begin (), data.end ());\n\n  int mid = data.size () \/ 2;\n  if (data.size () % 2 == 0)\n    median = (data[mid-1] + data[mid]) \/ 2.0;\n  else\n    median = data[mid];\n  return (median);\n}\n*\/\n\n\/\/#define PCL_INSTANTIATE_TransformationEstimationLM(T,U) template class PCL_EXPORTS pcl::registration::TransformationEstimationLM<T,U>;\n\n#endif \/* PCL_REGISTRATION_TRANSFORMATION_ESTIMATION_LM_HPP_ *\/\n<commit_msg>Fixed an overzealous copy-paste in transformation_estimation_lm.hpp<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_REGISTRATION_TRANSFORMATION_ESTIMATION_LM_HPP_\n#define PCL_REGISTRATION_TRANSFORMATION_ESTIMATION_LM_HPP_\n\n#include \"pcl\/registration\/warp_point_rigid.h\"\n#include \"pcl\/registration\/warp_point_rigid_6d.h\"\n#include \"pcl\/registration\/distances.h\"\n#include <unsupported\/Eigen\/NonLinearOptimization>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::estimateRigidTransformation (\n    const pcl::PointCloud<PointSource> &cloud_src,\n    const pcl::PointCloud<PointTarget> &cloud_tgt,\n    Eigen::Matrix4f &transformation_matrix)\n{\n\n  \/\/ <cloud_src,cloud_src> is the source dataset\n  if (cloud_src.points.size () != cloud_tgt.points.size ())\n  {\n    PCL_ERROR (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation] \");\n    PCL_ERROR (\"Number or points in source (%lu) differs than target (%lu)!\\n\", \n               (unsigned long)cloud_src.points.size (), (unsigned long)cloud_tgt.points.size ());\n    return;\n  }\n  if (cloud_src.points.size () < 4)     \/\/ need at least 4 samples\n  {\n    PCL_ERROR (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation] \");\n    PCL_ERROR (\"Need at least 4 points to estimate a transform! Source and target have %lu points!\\n\", \n               (unsigned long)cloud_src.points.size ());\n    return;\n  }\n\n  \/\/ If no warp function has been set, use the default (WarpPointRigid6D)\n  if (!warp_point_)\n    warp_point_.reset (new WarpPointRigid6D<PointSource, PointTarget>);\n\n  int n_unknowns = warp_point_->getDimension ();\n  int m = cloud_src.points.size ();\n  Eigen::VectorXd x(n_unknowns);\n  x.setZero ();\n  \n  \/\/ Set temporary pointers\n  tmp_src_ = &cloud_src;\n  tmp_tgt_ = &cloud_tgt;\n\n  OptimizationFunctor functor (n_unknowns, m, this);\n  Eigen::NumericalDiff<OptimizationFunctor> num_diff (functor);\n  Eigen::LevenbergMarquardt<Eigen::NumericalDiff<OptimizationFunctor> > lm (num_diff);\n  int info = lm.minimize (x);\n\n  \/\/ Compute the norm of the residuals\n  PCL_DEBUG (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation]\");\n  PCL_DEBUG (\"LM solver finished with exit code %i, having a residual norm of %g. \\n\", info, lm.fvec.norm ());\n  if(n_unknowns == 7)\n    PCL_DEBUG (\"Final solution: [%f %f %f %f] [%f %f %f]\\n\", x[0], x[1], x[2], x[3], x[4], x[5], x[6]);\n  else\n    PCL_DEBUG (\"Final solution: [%f %f %f] [%f %f %f]\\n\", x[0], x[1], x[2], x[3], x[4], x[5]);\n  \n  \/\/ Return the correct transformation\n  transformation_matrix.setZero ();\n\n  Eigen::Quaternionf q (0, x[3], x[4], x[5]);\n  q.w () = sqrt (1 - q.dot (q));   \/\/ Compute w from the unit quaternion\n  transformation_matrix.topLeftCorner<3, 3> () = q.toRotationMatrix ();\n\n  Eigen::Vector4f t (x[0], x[1], x[2], 1.0);\n  transformation_matrix.block <4, 1> (0, 3) = t;\n\n  tmp_src_ = NULL;\n  tmp_tgt_ = NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::estimateRigidTransformation (\n    const pcl::PointCloud<PointSource> &cloud_src,\n    const std::vector<int> &indices_src,\n    const pcl::PointCloud<PointTarget> &cloud_tgt,\n    Eigen::Matrix4f &transformation_matrix)\n{\n  if (indices_src.size () != cloud_tgt.points.size ())\n  {\n    PCL_ERROR (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation] Number or points in source (%lu) differs than target (%lu)!\\n\", (unsigned long)indices_src.size (), (unsigned long)cloud_tgt.points.size ());\n    return;\n  }\n\n  \/\/ <cloud_src,cloud_src> is the source dataset\n  transformation_matrix.setIdentity ();\n\n  const int nr_correspondences = (int)cloud_tgt.points.size ();\n  std::vector<int> indices_tgt;\n  indices_tgt.resize(nr_correspondences);\n  for (int i = 0; i < nr_correspondences; ++i)\n    indices_tgt[i] = i;\n\n  estimateRigidTransformation(cloud_src, indices_src, cloud_tgt, indices_tgt, transformation_matrix);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> inline void\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::estimateRigidTransformation (\n    const pcl::PointCloud<PointSource> &cloud_src,\n    const std::vector<int> &indices_src,\n    const pcl::PointCloud<PointTarget> &cloud_tgt,\n    const std::vector<int> &indices_tgt,\n    Eigen::Matrix4f &transformation_matrix)\n{\n  if (indices_src.size () != indices_tgt.size ())\n  {\n    PCL_ERROR (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation] Number or points in source (%lu) differs than target (%lu)!\\n\", (unsigned long)indices_src.size (), (unsigned long)indices_tgt.size ());\n    return;\n  }\n\n  if (indices_src.size () < 4)     \/\/ need at least 4 samples\n  {\n    PCL_ERROR (\"[pcl::IterativeClosestPointNonLinear::estimateRigidTransformationLM] \");\n    PCL_ERROR (\"Need at least 4 points to estimate a transform! Source and target have %lu points!\",\n               (unsigned long)indices_src.size ());\n    return;\n  }\n\n  \/\/ If no warp function has been set, use the default (WarpPointRigid6D)\n  if (!warp_point_)\n    warp_point_.reset (new WarpPointRigid6D<PointSource, PointTarget>);\n\n  int n_unknowns = warp_point_->getDimension ();  \/\/ get dimension of unknown space\n  int m = indices_src.size ();\n  Eigen::VectorXd x(n_unknowns);\n  x.setConstant (n_unknowns, 0);\n\n  \/\/ Set temporary pointers\n  tmp_src_ = &cloud_src;\n  tmp_tgt_ = &cloud_tgt;\n  tmp_idx_src_ = &indices_src;\n  tmp_idx_tgt_ = &indices_tgt;\n\n  OptimizationFunctorWithIndices functor (n_unknowns, m, this);\n  Eigen::NumericalDiff<OptimizationFunctorWithIndices> num_diff (functor);\n  Eigen::LevenbergMarquardt<Eigen::NumericalDiff<OptimizationFunctorWithIndices> > lm (num_diff);\n  int info = lm.minimize (x);\n\n  \/\/ Compute the norm of the residuals\n  PCL_DEBUG (\"[pcl::registration::TransformationEstimationLM::estimateRigidTransformation]\");\n  PCL_DEBUG (\"LM solver finished with exit code %i, having a residual norm of %g. \\n\", info, lm.fvec.norm ());\n  PCL_DEBUG (\"Final solution: [%f %f %f] [%f %f %f]\\n\", x[0], x[1], x[2], x[3], x[4], x[5]);\n\n  \/\/ Return the correct transformation\n  transformation_matrix.setZero ();\n\n  Eigen::Quaternionf q (0, x[3], x[4], x[5]);\n  q.w () = sqrt (1 - q.dot (q));   \/\/ Compute w from the unit quaternion\n  transformation_matrix.topLeftCorner<3, 3> () = q.toRotationMatrix ();\n\n  Eigen::Vector4f t (x[0], x[1], x[2], 1.0);\n  transformation_matrix.block <4, 1> (0, 3) = t;\n\n  tmp_src_ = NULL;\n  tmp_tgt_ = NULL;\n  tmp_idx_src_ = tmp_idx_tgt_ = NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> inline void\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::estimateRigidTransformation (\n    const pcl::PointCloud<PointSource> &cloud_src,\n    const pcl::PointCloud<PointTarget> &cloud_tgt,\n    const pcl::Correspondences &correspondences,\n    Eigen::Matrix4f &transformation_matrix)\n{\n  const int nr_correspondences = (int)correspondences.size();\n  std::vector<int> indices_src(nr_correspondences);\n  std::vector<int> indices_tgt(nr_correspondences);\n  for (int i = 0; i < nr_correspondences; ++i)\n  {\n    indices_src[i] = correspondences[i].index_query;\n    indices_tgt[i] = correspondences[i].index_match;\n  }\n\n  estimateRigidTransformation(cloud_src, indices_src, cloud_tgt, indices_tgt, transformation_matrix);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> int \npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::OptimizationFunctor::operator() (const Eigen::VectorXd &x, Eigen::VectorXd &fvec) const\n{\n  const PointCloud<PointSource> & src_points = *estimator_->tmp_src_;\n  const PointCloud<PointTarget> & tgt_points = *estimator_->tmp_tgt_;\n\n  \/\/ Initialize the warp function with the given parameters\n  Eigen::VectorXf params = x.cast<float> ();\n  estimator_->warp_point_->setParam (params);\n\n  \/\/ Transform each source point and compute its distance to the corresponding target point\n  for (int i = 0; i < m_values; i++)\n  {\n    const PointSource & p_src = src_points.points[i];\n    const PointTarget & p_tgt = tgt_points.points[i];\n\n    \/\/ Transform the source point based on the current warp parameters\n    PointSource p_src_warped;\n    estimator_->warp_point_->warpPoint (p_src, p_src_warped);\n    \n    \/\/ Estimate the distance (cost function)\n    fvec[i] = estimator_->computeDistance (p_src_warped, p_tgt);\n  }\n  return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> int\npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::OptimizationFunctorWithIndices::operator() (const Eigen::VectorXd &x, Eigen::VectorXd &fvec) const\n{\n  const PointCloud<PointSource> & src_points = *estimator_->tmp_src_;\n  const PointCloud<PointTarget> & tgt_points = *estimator_->tmp_tgt_;\n  const std::vector<int> & src_indices = *estimator_->tmp_idx_src_;\n  const std::vector<int> & tgt_indices = *estimator_->tmp_idx_tgt_;\n\n  \/\/ Initialize the warp function with the given parameters\n  Eigen::VectorXf params = x.cast<float> ();\n  estimator_->warp_point_->setParam (params);\n\n  \/\/ Transform each source point and compute its distance to the corresponding target point\n  for (int i = 0; i < m_values; ++i)\n  {\n    const PointSource & p_src = src_points.points[src_indices[i]];\n    const PointTarget & p_tgt = tgt_points.points[tgt_indices[i]];\n\n    \/\/ Transform the source point based on the current warp parameters\n    PointSource p_src_warped;\n    estimator_->warp_point_->warpPoint (p_src, p_src_warped);\n    \n    \/\/ Estimate the distance (cost function)\n    fvec[i] = estimator_->computeDistance (p_src_warped, p_tgt);\n  }\n  return (0);\n}\n\/*\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> inline double \npcl::registration::TransformationEstimationLM<PointSource, PointTarget>::computeMedian (double *fvec, int m)\n{\n  double median;\n  \/\/ Copy the values to vectors for faster sorting\n  std::vector<double> data (m);\n  memcpy (&data[0], fvec, sizeof (double) * m);\n\n  std::sort (data.begin (), data.end ());\n\n  int mid = data.size () \/ 2;\n  if (data.size () % 2 == 0)\n    median = (data[mid-1] + data[mid]) \/ 2.0;\n  else\n    median = data[mid];\n  return (median);\n}\n*\/\n\n\/\/#define PCL_INSTANTIATE_TransformationEstimationLM(T,U) template class PCL_EXPORTS pcl::registration::TransformationEstimationLM<T,U>;\n\n#endif \/* PCL_REGISTRATION_TRANSFORMATION_ESTIMATION_LM_HPP_ *\/\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    GPUMemManDataStructs.cpp\n  \\author  Jens Krueger\n           SCI Institute\n           University of Utah\n  \\date    August 2008\n*\/\n\n#include \"GPUMemManDataStructs.h\"\n#include <Controller\/Controller.h>\n\nTexture3DListElem::Texture3DListElem(VolumeDataset* _pDataset, const std::vector<UINT64>& _vLOD, const std::vector<UINT64>& _vBrick, bool bIsPaddedToPowerOfTwo, bool bIsDownsampledTo8Bits, bool bDisableBorder, UINT64 iIntraFrameCounter, UINT64 iFrameCounter, MasterController* pMasterController) :\n  pData(NULL),\n  pTexture(NULL),\n  pDataset(_pDataset),\n  iUserCount(1),\n  m_iIntraFrameCounter(iIntraFrameCounter),\n  m_iFrameCounter(iFrameCounter),\n  m_pMasterController(pMasterController),\n  vLOD(_vLOD),\n  vBrick(_vBrick),\n  m_bIsPaddedToPowerOfTwo(bIsPaddedToPowerOfTwo),\n  m_bIsDownsampledTo8Bits(bIsDownsampledTo8Bits),\n  m_bDisableBorder(bDisableBorder)\n{\n  if (!CreateTexture()) {\n    pTexture->Delete();\n    delete pTexture;\n    pTexture = NULL;\n  }\n}\n\nTexture3DListElem::~Texture3DListElem() {\n  FreeData();\n  FreeTexture();\n}\n\nbool Texture3DListElem::Equals(const VolumeDataset* _pDataset,\n                               const std::vector<UINT64>& _vLOD,\n                               const std::vector<UINT64>& _vBrick,\n                               bool bIsPaddedToPowerOfTwo,\n                               bool bIsDownsampledTo8Bits, bool bDisableBorder)\n{\n  if (_pDataset != pDataset ||\n      _vLOD.size() != vLOD.size() ||\n      _vBrick.size() != vBrick.size() ||\n      m_bIsPaddedToPowerOfTwo != bIsPaddedToPowerOfTwo ||\n      m_bIsDownsampledTo8Bits != bIsDownsampledTo8Bits ||\n      m_bDisableBorder != bDisableBorder) return false;\n\n  for (size_t i = 0;i<vLOD.size();i++)   if (vLOD[i] != _vLOD[i]) return false;\n  for (size_t i = 0;i<vBrick.size();i++) if (vBrick[i] != _vBrick[i]) return false;\n\n  return true;\n}\n\nGLTexture3D* Texture3DListElem::Access(UINT64& iIntraFrameCounter, UINT64& iFrameCounter) {\n  m_iIntraFrameCounter = iIntraFrameCounter;\n  m_iFrameCounter = iFrameCounter;\n  iUserCount++;\n\n  return pTexture;\n}\n\nbool Texture3DListElem::BestMatch(const std::vector<UINT64>& vDimension, bool bIsPaddedToPowerOfTwo, bool bIsDownsampledTo8Bits, bool bDisableBorder, UINT64& iIntraFrameCounter, UINT64& iFrameCounter) {\n  if (!Match(vDimension) || iUserCount > 0\n      || m_bIsPaddedToPowerOfTwo != bIsPaddedToPowerOfTwo\n      || m_bIsDownsampledTo8Bits != bIsDownsampledTo8Bits\n      || m_bDisableBorder != bDisableBorder) return false;\n\n  \/\/ framewise older data as before found -> use this object\n  if (iFrameCounter > m_iFrameCounter) {\n      iFrameCounter = m_iFrameCounter;\n      iIntraFrameCounter = m_iIntraFrameCounter;\n\n      return true;\n  }\n\n  \/\/ framewise older data as before found -> use this object\n  if (iFrameCounter == m_iFrameCounter &&\n      iIntraFrameCounter < m_iIntraFrameCounter) {\n\n      iFrameCounter = m_iFrameCounter;\n      iIntraFrameCounter = m_iIntraFrameCounter;\n\n      return true;\n  }\n\n  return false;\n}\n\n\nbool Texture3DListElem::Match(const std::vector<UINT64>& vDimension) {\n  if (pTexture == NULL) return false;\n\n  const std::vector<UINT64> vSize = pDataset->GetInfo()->GetBrickSizeND(vLOD, vBrick);\n\n  if (vDimension.size() != vSize.size()) return false;\n  for (size_t i = 0;i<vSize.size();i++)   if (vSize[i] != vDimension[i]) return false;\n\n  return true;\n}\n\nbool Texture3DListElem::Replace(VolumeDataset* _pDataset,\n                                const std::vector<UINT64>& _vLOD,\n                                const std::vector<UINT64>& _vBrick,\n                                bool bIsPaddedToPowerOfTwo,\n                                bool bIsDownsampledTo8Bits,\n                                bool bDisableBorder, UINT64 iIntraFrameCounter,\n                                UINT64 iFrameCounter) {\n  if (pTexture == NULL) return false;\n\n  pDataset = _pDataset;\n  vLOD     = _vLOD;\n  vBrick   = _vBrick;\n  m_bIsPaddedToPowerOfTwo = bIsPaddedToPowerOfTwo;\n  m_bIsDownsampledTo8Bits = bIsDownsampledTo8Bits;\n  m_bDisableBorder        = bDisableBorder;\n\n  m_iIntraFrameCounter = iIntraFrameCounter;\n  m_iFrameCounter = iFrameCounter;\n\n  LoadData();\n  glGetError();\n  pTexture->SetData(pData);\n  return GL_NO_ERROR==glGetError();\n}\n\n\nbool Texture3DListElem::LoadData() {\n  FreeData();\n  return pDataset->GetBrick(&pData, vLOD, vBrick);\n}\n\nvoid  Texture3DListElem::FreeData() {\n  delete [] pData;\n  pData = NULL;\n}\n\n\nbool Texture3DListElem::CreateTexture(bool bDeleteOldTexture) {\n  if (bDeleteOldTexture) FreeTexture();\n\n  if (pData == NULL)\n    if (!LoadData()) return false;\n\n  const std::vector<UINT64> vSize = pDataset->GetInfo()->GetBrickSizeND(vLOD, vBrick);\n\n  bool bToggleEndian = !pDataset->GetInfo()->IsSameEndianess();\n\n  UINT64 iBitWidth  = pDataset->GetInfo()->GetBitWidth();\n  UINT64 iCompCount = pDataset->GetInfo()->GetComponentCount();\n\n  GLint glInternalformat;\n  GLenum glFormat;\n  GLenum glType;\n\n\n  if (m_bIsDownsampledTo8Bits && iBitWidth != 8) {\n    \/\/ here we assume that data which is not 8 bit is 16 bit\n    if (iBitWidth != 16) {\n      FreeData();\n      return false;\n    }\n\n    unsigned char* pTmpData = new unsigned char[vSize[0]*vSize[1]*vSize[2]*iCompCount];\n\n    size_t iMax = pDataset->Get1DHistogram()->GetFilledSize();\n\n    for (size_t i = 0;i<vSize[0]*vSize[1]*vSize[2]*iCompCount;i++) {\n      unsigned char iQuantizedVal = (unsigned char)(255.0*((unsigned short*)pData)[i]\/float(iMax));\n      pTmpData[i] = iQuantizedVal;\n    }\n\n    delete [] pData;\n    pData = pTmpData;\n    iBitWidth = 8;\n  }\n\n\n  switch (iCompCount) {\n    case 1 : glFormat = GL_LUMINANCE; break;\n    case 3 : glFormat = GL_RGB; break;\n    case 4 : glFormat = GL_RGBA; break;\n    default : FreeData(); return false;\n  }\n\n  if (iBitWidth == 8) {\n      glType = GL_UNSIGNED_BYTE;\n      switch (iCompCount) {\n        case 1 : glInternalformat = GL_LUMINANCE8; break;\n        case 3 : glInternalformat = GL_RGB8; break;\n        case 4 : glInternalformat = GL_RGBA8; break;\n        default : FreeData(); return false;\n      }\n  } else {\n    if (iBitWidth == 16) {\n      glType = GL_UNSIGNED_SHORT;\n\n      if (bToggleEndian) {\n        UINT64 iElemCount = vSize[0];\n        for (size_t i = 1;i<vSize.size();i++) iElemCount *= vSize[i];\n        short* pShorData = (short*)pData;\n        for (UINT64 i = 0;i<iCompCount*iElemCount;i++) {\n          EndianConvert::Swap<short>(pShorData+i);\n        }\n      }\n\n      switch (iCompCount) {\n        case 1 : glInternalformat = GL_LUMINANCE16; break;\n        case 3 : glInternalformat = GL_RGB16; break;\n        case 4 : glInternalformat = GL_RGBA16; break;\n        default : FreeData(); return false;\n      }\n\n    } else {\n        FreeData();\n        return false;\n    }\n  }\n\n  glGetError();\n  if (!m_bIsPaddedToPowerOfTwo || (MathTools::IsPow2(UINT32(vSize[0])) && MathTools::IsPow2(UINT32(vSize[1])) && MathTools::IsPow2(UINT32(vSize[2])))) {\n    pTexture = new GLTexture3D(UINT32(vSize[0]), UINT32(vSize[1]), UINT32(vSize[2]), glInternalformat, glFormat, glType, UINT32(iBitWidth\/8*iCompCount), pData, GL_LINEAR, GL_LINEAR, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP);\n  } else {\n    \/\/ pad the data to a power of two\n    UINTVECTOR3 vPaddedSize(MathTools::NextPow2(UINT32(vSize[0])), MathTools::NextPow2(UINT32(vSize[1])), MathTools::NextPow2(UINT32(vSize[2])));\n\n    size_t iTarget = 0;\n    size_t iSource = 0;\n    size_t iElementSize = iBitWidth\/8*iCompCount;\n    size_t iRowSizeSource = vSize[0]*iElementSize;\n    size_t iRowSizeTarget = vPaddedSize[0]*iElementSize;\n\n    unsigned char* pPaddedData = new unsigned char[iRowSizeTarget*vPaddedSize[1]*vPaddedSize[2]];\n    memset(pPaddedData, 0, iRowSizeTarget*vPaddedSize[1]*vPaddedSize[2]);\n\n    for (size_t z = 0;z<vSize[2];z++) {\n      for (size_t y = 0;y<vSize[1];y++) {\n        memcpy(pPaddedData+iTarget, pData+iSource, iRowSizeSource);\n\n        \/\/ if the x sizes differ, duplicate the last element to make the\n        \/\/ texture behave like clamp\n        if (!m_bDisableBorder && iRowSizeTarget > iRowSizeSource)\n          memcpy(pPaddedData+iTarget+iRowSizeSource,\n                 pPaddedData+iTarget+iRowSizeSource-iElementSize,\n                 iElementSize);\n        iTarget += iRowSizeTarget;\n        iSource += iRowSizeSource;\n      }\n      \/\/ if the y sizes differ, duplicate the last element to make the texture\n      \/\/ behave like clamp\n      if (vPaddedSize[1] > vSize[1]) {\n        if (!m_bDisableBorder)\n          memcpy(pPaddedData+iTarget, pPaddedData+iTarget-iRowSizeTarget, iRowSizeTarget);\n        iTarget += (vPaddedSize[1]-vSize[1])*iRowSizeTarget;\n      }\n    }\n    \/\/ if the z sizes differ, duplicate the last element to make the texture\n    \/\/ behave like clamp\n    if (!m_bDisableBorder && vPaddedSize[2] > vSize[2]) {\n      memcpy(pPaddedData+iTarget, pPaddedData+(iTarget-vPaddedSize[1]*iRowSizeTarget), vPaddedSize[1]*iRowSizeTarget);\n    }\n\n    MESSAGE(\"Actually creating new texture %i x %i x %i, bitsize=%i, componentcount=%i due to compatibility settings\", int(vPaddedSize[0]), int(vPaddedSize[1]), int(vPaddedSize[2]), int(iBitWidth), int(iCompCount));\n\n    pTexture = new GLTexture3D(vPaddedSize[0], vPaddedSize[1], vPaddedSize[2], glInternalformat, glFormat, glType, UINT32(iBitWidth\/8*iCompCount), pPaddedData, GL_LINEAR, GL_LINEAR, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP);\n\n    delete [] pPaddedData;\n  }\n\n  FreeData();\n  return GL_NO_ERROR==glGetError();\n}\n\nvoid Texture3DListElem::FreeTexture() {\n  if (pTexture != NULL) {\n    pTexture->Delete();\n    delete pTexture;\n  }\n  pTexture = NULL;\n}\n<commit_msg>Print an error before bailing if we can't create the texture.<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    GPUMemManDataStructs.cpp\n  \\author  Jens Krueger\n           SCI Institute\n           University of Utah\n  \\date    August 2008\n*\/\n\n#include \"GPUMemManDataStructs.h\"\n#include <Controller\/Controller.h>\n\nTexture3DListElem::Texture3DListElem(VolumeDataset* _pDataset, const std::vector<UINT64>& _vLOD, const std::vector<UINT64>& _vBrick, bool bIsPaddedToPowerOfTwo, bool bIsDownsampledTo8Bits, bool bDisableBorder, UINT64 iIntraFrameCounter, UINT64 iFrameCounter, MasterController* pMasterController) :\n  pData(NULL),\n  pTexture(NULL),\n  pDataset(_pDataset),\n  iUserCount(1),\n  m_iIntraFrameCounter(iIntraFrameCounter),\n  m_iFrameCounter(iFrameCounter),\n  m_pMasterController(pMasterController),\n  vLOD(_vLOD),\n  vBrick(_vBrick),\n  m_bIsPaddedToPowerOfTwo(bIsPaddedToPowerOfTwo),\n  m_bIsDownsampledTo8Bits(bIsDownsampledTo8Bits),\n  m_bDisableBorder(bDisableBorder)\n{\n  if (!CreateTexture()) {\n    pTexture->Delete();\n    delete pTexture;\n    pTexture = NULL;\n  }\n}\n\nTexture3DListElem::~Texture3DListElem() {\n  FreeData();\n  FreeTexture();\n}\n\nbool Texture3DListElem::Equals(const VolumeDataset* _pDataset,\n                               const std::vector<UINT64>& _vLOD,\n                               const std::vector<UINT64>& _vBrick,\n                               bool bIsPaddedToPowerOfTwo,\n                               bool bIsDownsampledTo8Bits, bool bDisableBorder)\n{\n  if (_pDataset != pDataset ||\n      _vLOD.size() != vLOD.size() ||\n      _vBrick.size() != vBrick.size() ||\n      m_bIsPaddedToPowerOfTwo != bIsPaddedToPowerOfTwo ||\n      m_bIsDownsampledTo8Bits != bIsDownsampledTo8Bits ||\n      m_bDisableBorder != bDisableBorder) return false;\n\n  for (size_t i = 0;i<vLOD.size();i++)   if (vLOD[i] != _vLOD[i]) return false;\n  for (size_t i = 0;i<vBrick.size();i++) if (vBrick[i] != _vBrick[i]) return false;\n\n  return true;\n}\n\nGLTexture3D* Texture3DListElem::Access(UINT64& iIntraFrameCounter, UINT64& iFrameCounter) {\n  m_iIntraFrameCounter = iIntraFrameCounter;\n  m_iFrameCounter = iFrameCounter;\n  iUserCount++;\n\n  return pTexture;\n}\n\nbool Texture3DListElem::BestMatch(const std::vector<UINT64>& vDimension, bool bIsPaddedToPowerOfTwo, bool bIsDownsampledTo8Bits, bool bDisableBorder, UINT64& iIntraFrameCounter, UINT64& iFrameCounter) {\n  if (!Match(vDimension) || iUserCount > 0\n      || m_bIsPaddedToPowerOfTwo != bIsPaddedToPowerOfTwo\n      || m_bIsDownsampledTo8Bits != bIsDownsampledTo8Bits\n      || m_bDisableBorder != bDisableBorder) return false;\n\n  \/\/ framewise older data as before found -> use this object\n  if (iFrameCounter > m_iFrameCounter) {\n      iFrameCounter = m_iFrameCounter;\n      iIntraFrameCounter = m_iIntraFrameCounter;\n\n      return true;\n  }\n\n  \/\/ framewise older data as before found -> use this object\n  if (iFrameCounter == m_iFrameCounter &&\n      iIntraFrameCounter < m_iIntraFrameCounter) {\n\n      iFrameCounter = m_iFrameCounter;\n      iIntraFrameCounter = m_iIntraFrameCounter;\n\n      return true;\n  }\n\n  return false;\n}\n\n\nbool Texture3DListElem::Match(const std::vector<UINT64>& vDimension) {\n  if (pTexture == NULL) return false;\n\n  const std::vector<UINT64> vSize = pDataset->GetInfo()->GetBrickSizeND(vLOD, vBrick);\n\n  if (vDimension.size() != vSize.size()) return false;\n  for (size_t i = 0;i<vSize.size();i++)   if (vSize[i] != vDimension[i]) return false;\n\n  return true;\n}\n\nbool Texture3DListElem::Replace(VolumeDataset* _pDataset,\n                                const std::vector<UINT64>& _vLOD,\n                                const std::vector<UINT64>& _vBrick,\n                                bool bIsPaddedToPowerOfTwo,\n                                bool bIsDownsampledTo8Bits,\n                                bool bDisableBorder, UINT64 iIntraFrameCounter,\n                                UINT64 iFrameCounter) {\n  if (pTexture == NULL) return false;\n\n  pDataset = _pDataset;\n  vLOD     = _vLOD;\n  vBrick   = _vBrick;\n  m_bIsPaddedToPowerOfTwo = bIsPaddedToPowerOfTwo;\n  m_bIsDownsampledTo8Bits = bIsDownsampledTo8Bits;\n  m_bDisableBorder        = bDisableBorder;\n\n  m_iIntraFrameCounter = iIntraFrameCounter;\n  m_iFrameCounter = iFrameCounter;\n\n  LoadData();\n  glGetError();\n  pTexture->SetData(pData);\n  return GL_NO_ERROR==glGetError();\n}\n\n\nbool Texture3DListElem::LoadData() {\n  FreeData();\n  return pDataset->GetBrick(&pData, vLOD, vBrick);\n}\n\nvoid  Texture3DListElem::FreeData() {\n  delete [] pData;\n  pData = NULL;\n}\n\n\nbool Texture3DListElem::CreateTexture(bool bDeleteOldTexture) {\n  if (bDeleteOldTexture) FreeTexture();\n\n  if (pData == NULL)\n    if (!LoadData()) return false;\n\n  const std::vector<UINT64> vSize = pDataset->GetInfo()->GetBrickSizeND(vLOD, vBrick);\n\n  bool bToggleEndian = !pDataset->GetInfo()->IsSameEndianess();\n\n  UINT64 iBitWidth  = pDataset->GetInfo()->GetBitWidth();\n  UINT64 iCompCount = pDataset->GetInfo()->GetComponentCount();\n\n  GLint glInternalformat;\n  GLenum glFormat;\n  GLenum glType;\n\n\n  if (m_bIsDownsampledTo8Bits && iBitWidth != 8) {\n    \/\/ here we assume that data which is not 8 bit is 16 bit\n    if (iBitWidth != 16) {\n      FreeData();\n      return false;\n    }\n\n    unsigned char* pTmpData = new unsigned char[vSize[0]*vSize[1]*vSize[2]*iCompCount];\n\n    size_t iMax = pDataset->Get1DHistogram()->GetFilledSize();\n\n    for (size_t i = 0;i<vSize[0]*vSize[1]*vSize[2]*iCompCount;i++) {\n      unsigned char iQuantizedVal = (unsigned char)(255.0*((unsigned short*)pData)[i]\/float(iMax));\n      pTmpData[i] = iQuantizedVal;\n    }\n\n    delete [] pData;\n    pData = pTmpData;\n    iBitWidth = 8;\n  }\n\n\n  switch (iCompCount) {\n    case 1 : glFormat = GL_LUMINANCE; break;\n    case 3 : glFormat = GL_RGB; break;\n    case 4 : glFormat = GL_RGBA; break;\n    default : FreeData(); return false;\n  }\n\n  if (iBitWidth == 8) {\n      glType = GL_UNSIGNED_BYTE;\n      switch (iCompCount) {\n        case 1 : glInternalformat = GL_LUMINANCE8; break;\n        case 3 : glInternalformat = GL_RGB8; break;\n        case 4 : glInternalformat = GL_RGBA8; break;\n        default : FreeData(); return false;\n      }\n  } else {\n    if (iBitWidth == 16) {\n      glType = GL_UNSIGNED_SHORT;\n\n      if (bToggleEndian) {\n        UINT64 iElemCount = vSize[0];\n        for (size_t i = 1;i<vSize.size();i++) iElemCount *= vSize[i];\n        short* pShorData = (short*)pData;\n        for (UINT64 i = 0;i<iCompCount*iElemCount;i++) {\n          EndianConvert::Swap<short>(pShorData+i);\n        }\n      }\n\n      switch (iCompCount) {\n        case 1 : glInternalformat = GL_LUMINANCE16; break;\n        case 3 : glInternalformat = GL_RGB16; break;\n        case 4 : glInternalformat = GL_RGBA16; break;\n        default : FreeData(); return false;\n      }\n    } else {\n      T_ERROR(\"Cannot handle data of width %d\", iBitWidth);\n      FreeData();\n      return false;\n    }\n  }\n\n  glGetError();\n  if (!m_bIsPaddedToPowerOfTwo || (MathTools::IsPow2(UINT32(vSize[0])) && MathTools::IsPow2(UINT32(vSize[1])) && MathTools::IsPow2(UINT32(vSize[2])))) {\n    pTexture = new GLTexture3D(UINT32(vSize[0]), UINT32(vSize[1]), UINT32(vSize[2]), glInternalformat, glFormat, glType, UINT32(iBitWidth\/8*iCompCount), pData, GL_LINEAR, GL_LINEAR, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP);\n  } else {\n    \/\/ pad the data to a power of two\n    UINTVECTOR3 vPaddedSize(MathTools::NextPow2(UINT32(vSize[0])), MathTools::NextPow2(UINT32(vSize[1])), MathTools::NextPow2(UINT32(vSize[2])));\n\n    size_t iTarget = 0;\n    size_t iSource = 0;\n    size_t iElementSize = iBitWidth\/8*iCompCount;\n    size_t iRowSizeSource = vSize[0]*iElementSize;\n    size_t iRowSizeTarget = vPaddedSize[0]*iElementSize;\n\n    unsigned char* pPaddedData = new unsigned char[iRowSizeTarget*vPaddedSize[1]*vPaddedSize[2]];\n    memset(pPaddedData, 0, iRowSizeTarget*vPaddedSize[1]*vPaddedSize[2]);\n\n    for (size_t z = 0;z<vSize[2];z++) {\n      for (size_t y = 0;y<vSize[1];y++) {\n        memcpy(pPaddedData+iTarget, pData+iSource, iRowSizeSource);\n\n        \/\/ if the x sizes differ, duplicate the last element to make the\n        \/\/ texture behave like clamp\n        if (!m_bDisableBorder && iRowSizeTarget > iRowSizeSource)\n          memcpy(pPaddedData+iTarget+iRowSizeSource,\n                 pPaddedData+iTarget+iRowSizeSource-iElementSize,\n                 iElementSize);\n        iTarget += iRowSizeTarget;\n        iSource += iRowSizeSource;\n      }\n      \/\/ if the y sizes differ, duplicate the last element to make the texture\n      \/\/ behave like clamp\n      if (vPaddedSize[1] > vSize[1]) {\n        if (!m_bDisableBorder)\n          memcpy(pPaddedData+iTarget, pPaddedData+iTarget-iRowSizeTarget, iRowSizeTarget);\n        iTarget += (vPaddedSize[1]-vSize[1])*iRowSizeTarget;\n      }\n    }\n    \/\/ if the z sizes differ, duplicate the last element to make the texture\n    \/\/ behave like clamp\n    if (!m_bDisableBorder && vPaddedSize[2] > vSize[2]) {\n      memcpy(pPaddedData+iTarget, pPaddedData+(iTarget-vPaddedSize[1]*iRowSizeTarget), vPaddedSize[1]*iRowSizeTarget);\n    }\n\n    MESSAGE(\"Actually creating new texture %i x %i x %i, bitsize=%i, componentcount=%i due to compatibility settings\", int(vPaddedSize[0]), int(vPaddedSize[1]), int(vPaddedSize[2]), int(iBitWidth), int(iCompCount));\n\n    pTexture = new GLTexture3D(vPaddedSize[0], vPaddedSize[1], vPaddedSize[2], glInternalformat, glFormat, glType, UINT32(iBitWidth\/8*iCompCount), pPaddedData, GL_LINEAR, GL_LINEAR, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP, m_bDisableBorder ? GL_CLAMP_TO_EDGE : GL_CLAMP);\n\n    delete [] pPaddedData;\n  }\n\n  FreeData();\n  return GL_NO_ERROR==glGetError();\n}\n\nvoid Texture3DListElem::FreeTexture() {\n  if (pTexture != NULL) {\n    pTexture->Delete();\n    delete pTexture;\n  }\n  pTexture = NULL;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkHierarchicalPolyDataMapper.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#include \"vtkInformation.h\"\n#include \"vtkMapper.h\"\n#include \"vtkExecutive.h\"\n#include \"vtkCompositeDataPipeline.h\"\n#include \"vtkCompositeDataSet.h\"\n#include \"vtkCompositeDataIterator.h\"\n#include \"vtkHierarchicalDataSet.h\"\n#include \"vtkPolyDataMapper.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkHierarchicalPolyDataMapper.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkMath.h\"\n#include \"vtkGarbageCollector.h\"\n\n#include <vtkstd\/vector>\n\nvtkCxxRevisionMacro(vtkHierarchicalPolyDataMapper, \"1.5\");\nvtkStandardNewMacro(vtkHierarchicalPolyDataMapper);\n\nclass vtkHierarchicalPolyDataMapperInternals\n{\npublic:\n  vtkstd::vector<vtkPolyDataMapper*> Mappers;\n};\n\nvtkHierarchicalPolyDataMapper::vtkHierarchicalPolyDataMapper()\n{\n  this->Internal = new vtkHierarchicalPolyDataMapperInternals;\n}\n\nvtkHierarchicalPolyDataMapper::~vtkHierarchicalPolyDataMapper()\n{\n  for(unsigned int i=0;i<this->Internal->Mappers.size();i++)\n    {\n    this->Internal->Mappers[i]->UnRegister(this);\n    }\n  this->Internal->Mappers.clear();\n  \n  delete this->Internal;\n}\n\n\/\/ Specify the type of data this mapper can handle. If we are\n\/\/ working with a regular (not hierarchical) pipeline, then we\n\/\/ need vtkPolyData. For composite data pipelines, then\n\/\/ vtkHierarchicalDataSet is required, and we'll check when\n\/\/ building our structure whether all the part of the composite\n\/\/ data set are polydata.\nint vtkHierarchicalPolyDataMapper::FillInputPortInformation(\n  int vtkNotUsed(port), vtkInformation* info)\n{\n  info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkPolyData\");\n  info->Set(vtkCompositeDataPipeline::INPUT_REQUIRED_COMPOSITE_DATA_TYPE(), \n            \"vtkHierarchicalDataSet\");\n  return 1;\n}    \n\n\/\/ When the structure is out-of-date, recreate it by\n\/\/ creating a mapper for each input data.\nvoid vtkHierarchicalPolyDataMapper::BuildPolyDataMapper()\n{\n  int warnOnce = 0;\n  \n  \/\/Delete pdmappers if they already exist.\n  for(unsigned int i=0;i<this->Internal->Mappers.size();i++)\n    {\n    this->Internal->Mappers[i]->UnRegister(this);\n    }\n  this->Internal->Mappers.clear();\n  \n  \/\/Get the HierarchicalDataSet from the input\n  vtkInformation* inInfo = this->GetExecutive()->GetInputInformation(0,0);\n  vtkHierarchicalDataSet *input = vtkHierarchicalDataSet::SafeDownCast(\n    inInfo->Get(vtkCompositeDataSet::COMPOSITE_DATA_SET()));\n  \n  \/\/ If it isn't hierarchical, maybe it is just a plain vtkPolyData\n  if(!input) \n    {\n    vtkPolyData *pd = vtkPolyData::SafeDownCast(\n      this->GetExecutive()->GetInputData(0, 0));\n    if ( pd )\n      {\n      \/\/ Make a copy of the data to break the pipeline here\n      vtkPolyData *newpd = vtkPolyData::New();\n      newpd->ShallowCopy(pd);\n      vtkPolyDataMapper *pdmapper = vtkPolyDataMapper::New();\n      pdmapper->Register( this );\n      pdmapper->SetInput(newpd);\n      this->Internal->Mappers.push_back(pdmapper);\n      newpd->Delete();\n      pdmapper->Delete();\n      }\n    }\n  else\n    {\n    \/\/for each data set build a vtkPolyDataMapper\n    vtkCompositeDataIterator* iter = input->NewIterator();\n    iter->GoToFirstItem();  \n    while (!iter->IsDoneWithTraversal())\n      {\n      vtkPolyData* pd = vtkPolyData::SafeDownCast(iter->GetCurrentDataObject());      \n      if (pd)\n        {\n        \/\/ Make a copy of the data to break the pipeline here\n        vtkPolyData *newpd = vtkPolyData::New();\n        newpd->ShallowCopy(pd);\n        vtkPolyDataMapper *pdmapper = vtkPolyDataMapper::New();\n        pdmapper->Register(this);\n        pdmapper->SetInput(newpd);\n        this->Internal->Mappers.push_back(pdmapper);\n        newpd->Delete();\n        pdmapper->Delete();\n        }\n      \/\/ This is not polydata - warn the user that there are non-polydata\n      \/\/ parts to this data set which will not be rendered by this mapper\n      else\n        {\n        if ( !warnOnce )\n          {\n          vtkErrorMacro(\"All data in the hierachical dataset must be polydata.\");\n          warnOnce = 1;\n          }\n        }\n      iter->GoToNextItem();\n      }\n    iter->Delete();\n    }\n  \n  this->InternalMappersBuildTime.Modified();\n  \n}\n\nvoid vtkHierarchicalPolyDataMapper::Render(vtkRenderer *ren, vtkActor *a)\n{\n  \/\/If the PolyDataMappers are not up-to-date then rebuild them\n  vtkCompositeDataPipeline * executive = \n    vtkCompositeDataPipeline::SafeDownCast(this->GetExecutive());\n  \n  if(executive->GetPipelineMTime() > this->InternalMappersBuildTime.GetMTime())\n    {\n    this->BuildPolyDataMapper();    \n    }\n  \n  \/\/Call Render() on each of the PolyDataMappers\n  for(unsigned int i=0;i<this->Internal->Mappers.size();i++)\n    {\n    this->Internal->Mappers[i]->SetClippingPlanes( this->GetClippingPlanes() );\n    this->Internal->Mappers[i]->Render(ren,a);    \n    }\n}\nvtkExecutive* vtkHierarchicalPolyDataMapper::CreateDefaultExecutive()\n{\n  return vtkCompositeDataPipeline::New();\n}\n\n\/\/Looks at each DataSet and finds the union of all the bounds\nvoid vtkHierarchicalPolyDataMapper::ComputeBounds()\n{\n  vtkMath::UninitializeBounds(this->Bounds);\n  \n  vtkInformation* inInfo = this->GetExecutive()->GetInputInformation(0,0);\n  vtkHierarchicalDataSet *input = vtkHierarchicalDataSet::SafeDownCast(\n    inInfo->Get(vtkCompositeDataSet::COMPOSITE_DATA_SET()));\n\n  \/\/ If we don't have hierarchical data, test to see if we have\n  \/\/ plain old polydata. In this case, the bounds are simply\n  \/\/ the bounds of the input polydata.\n  if(!input) \n    {\n    vtkPolyData *pd = vtkPolyData::SafeDownCast(\n      this->GetExecutive()->GetInputData(0, 0));\n    if ( pd )\n      {\n      pd->GetBounds( this->Bounds );\n      }\n    return;\n    }\n  \n  \/\/ We do have hierarchical data - so we need to loop over\n  \/\/ it and get the total bounds.\n  vtkCompositeDataIterator* iter = input->NewIterator();\n  iter->GoToFirstItem();  \n  double bounds[6];\n  int i;\n  \n  while (!iter->IsDoneWithTraversal())\n    {\n    vtkPolyData *pd = vtkPolyData::SafeDownCast(iter->GetCurrentDataObject());    \n    if (pd)\n      {\n      \/\/ If this isn't the first time through, expand bounds\n      \/\/ we've compute so far based on the bounds of this\n      \/\/ block\n      if ( vtkMath::AreBoundsInitialized(this->Bounds) )\n        {\n        pd->GetBounds(bounds);\n        for(i=0; i<3; i++)\n          {\n          this->Bounds[i*2] = \n            (bounds[i*2]<this->Bounds[i*2])?\n            (bounds[i*2]):(this->Bounds[i*2]);\n          this->Bounds[i*2+1] = \n            (bounds[i*2+1]>this->Bounds[i*2+1])?\n            (bounds[i*2+1]):(this->Bounds[i*2+1]);\n          }\n        }\n      \/\/ If this is our first time through, just get the bounds\n      \/\/ of the data as the initial bounds\n      else\n        {\n        pd->GetBounds(this->Bounds);\n        }\n      }\n    iter->GoToNextItem();\n    }\n  iter->Delete();\n  this->BoundsMTime.Modified();\n}\n\ndouble* vtkHierarchicalPolyDataMapper::GetBounds()\n{\n  static double bounds[] = {-1.0,1.0, -1.0,1.0, -1.0,1.0};\n  \n  if ( ! this->GetInput() ) \n    {\n    return bounds;\n    }\n  else\n    {\n\n    this->Update();\n    \n    \/\/only compute bounds when the input data has changed\n    vtkCompositeDataPipeline * executive = vtkCompositeDataPipeline::SafeDownCast(this->GetExecutive());\n    if( executive->GetPipelineMTime() > this->BoundsMTime.GetMTime() )\n      {\n      ComputeBounds();\n      }\n    \n    return this->Bounds;\n    }\n}\n\nvoid vtkHierarchicalPolyDataMapper::ReleaseGraphicsResources( vtkWindow *win )\n{\n  for(unsigned int i=0;i<this->Internal->Mappers.size();i++)\n    {\n    this->Internal->Mappers[i]->ReleaseGraphicsResources( win );\n    }\n}\n\nvoid vtkHierarchicalPolyDataMapper::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n<commit_msg>BUG: mapper was not passing all relavent parameters on to internal mapper<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkHierarchicalPolyDataMapper.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#include \"vtkInformation.h\"\n#include \"vtkMapper.h\"\n#include \"vtkExecutive.h\"\n#include \"vtkCompositeDataPipeline.h\"\n#include \"vtkCompositeDataSet.h\"\n#include \"vtkCompositeDataIterator.h\"\n#include \"vtkHierarchicalDataSet.h\"\n#include \"vtkPolyDataMapper.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkHierarchicalPolyDataMapper.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkMath.h\"\n#include \"vtkGarbageCollector.h\"\n\n#include <vtkstd\/vector>\n\nvtkCxxRevisionMacro(vtkHierarchicalPolyDataMapper, \"1.6\");\nvtkStandardNewMacro(vtkHierarchicalPolyDataMapper);\n\nclass vtkHierarchicalPolyDataMapperInternals\n{\npublic:\n  vtkstd::vector<vtkPolyDataMapper*> Mappers;\n};\n\nvtkHierarchicalPolyDataMapper::vtkHierarchicalPolyDataMapper()\n{\n  this->Internal = new vtkHierarchicalPolyDataMapperInternals;\n}\n\nvtkHierarchicalPolyDataMapper::~vtkHierarchicalPolyDataMapper()\n{\n  for(unsigned int i=0;i<this->Internal->Mappers.size();i++)\n    {\n    this->Internal->Mappers[i]->UnRegister(this);\n    }\n  this->Internal->Mappers.clear();\n  \n  delete this->Internal;\n}\n\n\/\/ Specify the type of data this mapper can handle. If we are\n\/\/ working with a regular (not hierarchical) pipeline, then we\n\/\/ need vtkPolyData. For composite data pipelines, then\n\/\/ vtkHierarchicalDataSet is required, and we'll check when\n\/\/ building our structure whether all the part of the composite\n\/\/ data set are polydata.\nint vtkHierarchicalPolyDataMapper::FillInputPortInformation(\n  int vtkNotUsed(port), vtkInformation* info)\n{\n  info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkPolyData\");\n  info->Set(vtkCompositeDataPipeline::INPUT_REQUIRED_COMPOSITE_DATA_TYPE(), \n            \"vtkHierarchicalDataSet\");\n  return 1;\n}    \n\n\/\/ When the structure is out-of-date, recreate it by\n\/\/ creating a mapper for each input data.\nvoid vtkHierarchicalPolyDataMapper::BuildPolyDataMapper()\n{\n  int warnOnce = 0;\n  \n  \/\/Delete pdmappers if they already exist.\n  for(unsigned int i=0;i<this->Internal->Mappers.size();i++)\n    {\n    this->Internal->Mappers[i]->UnRegister(this);\n    }\n  this->Internal->Mappers.clear();\n  \n  \/\/Get the HierarchicalDataSet from the input\n  vtkInformation* inInfo = this->GetExecutive()->GetInputInformation(0,0);\n  vtkHierarchicalDataSet *input = vtkHierarchicalDataSet::SafeDownCast(\n    inInfo->Get(vtkCompositeDataSet::COMPOSITE_DATA_SET()));\n  \n  \/\/ If it isn't hierarchical, maybe it is just a plain vtkPolyData\n  if(!input) \n    {\n    vtkPolyData *pd = vtkPolyData::SafeDownCast(\n      this->GetExecutive()->GetInputData(0, 0));\n    if ( pd )\n      {\n      \/\/ Make a copy of the data to break the pipeline here\n      vtkPolyData *newpd = vtkPolyData::New();\n      newpd->ShallowCopy(pd);\n      vtkPolyDataMapper *pdmapper = vtkPolyDataMapper::New();\n      pdmapper->Register( this );\n      pdmapper->SetInput(newpd);\n      this->Internal->Mappers.push_back(pdmapper);\n      newpd->Delete();\n      pdmapper->Delete();\n      }\n    }\n  else\n    {\n    \/\/for each data set build a vtkPolyDataMapper\n    vtkCompositeDataIterator* iter = input->NewIterator();\n    iter->GoToFirstItem();  \n    while (!iter->IsDoneWithTraversal())\n      {\n      vtkPolyData* pd = vtkPolyData::SafeDownCast(iter->GetCurrentDataObject());      \n      if (pd)\n        {\n        \/\/ Make a copy of the data to break the pipeline here\n        vtkPolyData *newpd = vtkPolyData::New();\n        newpd->ShallowCopy(pd);\n        vtkPolyDataMapper *pdmapper = vtkPolyDataMapper::New();\n        pdmapper->Register(this);\n        pdmapper->SetInput(newpd);\n        this->Internal->Mappers.push_back(pdmapper);\n        newpd->Delete();\n        pdmapper->Delete();\n        }\n      \/\/ This is not polydata - warn the user that there are non-polydata\n      \/\/ parts to this data set which will not be rendered by this mapper\n      else\n        {\n        if ( !warnOnce )\n          {\n          vtkErrorMacro(\"All data in the hierachical dataset must be polydata.\");\n          warnOnce = 1;\n          }\n        }\n      iter->GoToNextItem();\n      }\n    iter->Delete();\n    }\n  \n  this->InternalMappersBuildTime.Modified();\n  \n}\n\nvoid vtkHierarchicalPolyDataMapper::Render(vtkRenderer *ren, vtkActor *a)\n{\n  \/\/If the PolyDataMappers are not up-to-date then rebuild them\n  vtkCompositeDataPipeline * executive = \n    vtkCompositeDataPipeline::SafeDownCast(this->GetExecutive());\n  \n  if(executive->GetPipelineMTime() > this->InternalMappersBuildTime.GetMTime())\n    {\n    this->BuildPolyDataMapper();    \n    }\n  \n  this->TimeToDraw = 0;\n  \/\/Call Render() on each of the PolyDataMappers\n  for(unsigned int i=0;i<this->Internal->Mappers.size();i++)\n    {\n    if ( this->ClippingPlanes != \n         this->Internal->Mappers[i]->GetClippingPlanes() )\n      {\n      this->Internal->Mappers[i]->SetClippingPlanes( this->ClippingPlanes );\n      }\n    \n    this->Internal->Mappers[i]->SetLookupTable(\n      this->GetLookupTable());\n    this->Internal->Mappers[i]->SetScalarVisibility(\n      this->GetScalarVisibility());\n    this->Internal->Mappers[i]->SetUseLookupTableScalarRange(\n      this->GetUseLookupTableScalarRange());\n    this->Internal->Mappers[i]->SetScalarRange(\n      this->GetScalarRange());\n    this->Internal->Mappers[i]->SetImmediateModeRendering(\n      this->GetImmediateModeRendering());\n    this->Internal->Mappers[i]->SetColorMode(this->GetColorMode());\n    this->Internal->Mappers[i]->SetInterpolateScalarsBeforeMapping(\n      this->GetInterpolateScalarsBeforeMapping());\n\n    this->Internal->Mappers[i]->SetScalarMode(this->GetScalarMode());\n    if ( this->ScalarMode == VTK_SCALAR_MODE_USE_POINT_FIELD_DATA ||\n         this->ScalarMode == VTK_SCALAR_MODE_USE_CELL_FIELD_DATA )\n      {\n      if ( this->ArrayAccessMode == VTK_GET_ARRAY_BY_ID )\n        {\n        this->Internal->Mappers[i]->ColorByArrayComponent(\n          this->ArrayId,ArrayComponent);\n        }\n      else\n        {\n        this->Internal->Mappers[i]->ColorByArrayComponent(\n          this->ArrayName,ArrayComponent);\n        }\n      }\n  \n    this->Internal->Mappers[i]->Render(ren,a);    \n    this->TimeToDraw += this->Internal->Mappers[i]->GetTimeToDraw();\n    }\n}\nvtkExecutive* vtkHierarchicalPolyDataMapper::CreateDefaultExecutive()\n{\n  return vtkCompositeDataPipeline::New();\n}\n\n\/\/Looks at each DataSet and finds the union of all the bounds\nvoid vtkHierarchicalPolyDataMapper::ComputeBounds()\n{\n  vtkMath::UninitializeBounds(this->Bounds);\n  \n  vtkInformation* inInfo = this->GetExecutive()->GetInputInformation(0,0);\n  vtkHierarchicalDataSet *input = vtkHierarchicalDataSet::SafeDownCast(\n    inInfo->Get(vtkCompositeDataSet::COMPOSITE_DATA_SET()));\n\n  \/\/ If we don't have hierarchical data, test to see if we have\n  \/\/ plain old polydata. In this case, the bounds are simply\n  \/\/ the bounds of the input polydata.\n  if(!input) \n    {\n    vtkPolyData *pd = vtkPolyData::SafeDownCast(\n      this->GetExecutive()->GetInputData(0, 0));\n    if ( pd )\n      {\n      pd->GetBounds( this->Bounds );\n      }\n    return;\n    }\n  \n  \/\/ We do have hierarchical data - so we need to loop over\n  \/\/ it and get the total bounds.\n  vtkCompositeDataIterator* iter = input->NewIterator();\n  iter->GoToFirstItem();  \n  double bounds[6];\n  int i;\n  \n  while (!iter->IsDoneWithTraversal())\n    {\n    vtkPolyData *pd = vtkPolyData::SafeDownCast(iter->GetCurrentDataObject());    \n    if (pd)\n      {\n      \/\/ If this isn't the first time through, expand bounds\n      \/\/ we've compute so far based on the bounds of this\n      \/\/ block\n      if ( vtkMath::AreBoundsInitialized(this->Bounds) )\n        {\n        pd->GetBounds(bounds);\n        for(i=0; i<3; i++)\n          {\n          this->Bounds[i*2] = \n            (bounds[i*2]<this->Bounds[i*2])?\n            (bounds[i*2]):(this->Bounds[i*2]);\n          this->Bounds[i*2+1] = \n            (bounds[i*2+1]>this->Bounds[i*2+1])?\n            (bounds[i*2+1]):(this->Bounds[i*2+1]);\n          }\n        }\n      \/\/ If this is our first time through, just get the bounds\n      \/\/ of the data as the initial bounds\n      else\n        {\n        pd->GetBounds(this->Bounds);\n        }\n      }\n    iter->GoToNextItem();\n    }\n  iter->Delete();\n  this->BoundsMTime.Modified();\n}\n\ndouble* vtkHierarchicalPolyDataMapper::GetBounds()\n{\n  static double bounds[] = {-1.0,1.0, -1.0,1.0, -1.0,1.0};\n  \n  if ( ! this->GetInput() ) \n    {\n    return bounds;\n    }\n  else\n    {\n\n    this->Update();\n    \n    \/\/only compute bounds when the input data has changed\n    vtkCompositeDataPipeline * executive = vtkCompositeDataPipeline::SafeDownCast(this->GetExecutive());\n    if( executive->GetPipelineMTime() > this->BoundsMTime.GetMTime() )\n      {\n      ComputeBounds();\n      }\n    \n    return this->Bounds;\n    }\n}\n\nvoid vtkHierarchicalPolyDataMapper::ReleaseGraphicsResources( vtkWindow *win )\n{\n  for(unsigned int i=0;i<this->Internal->Mappers.size();i++)\n    {\n    this->Internal->Mappers[i]->ReleaseGraphicsResources( win );\n    }\n}\n\nvoid vtkHierarchicalPolyDataMapper::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"CollisionSystem.hpp\"\n#include \"EntityManager.hpp\"\n\n#include \"functions\/OnCollision.hpp\"\n#include \"data\/CollisionComponent.hpp\"\n\nnamespace kengine {\n\t\/\/ declarations\n\tstatic void onCollision(Entity & first, Entity & second);\n\t\/\/\n\tEntityCreator * CollisionSystem(EntityManager & em) {\n\t\treturn [](Entity & e) {\n\t\t\te += functions::OnCollision{ onCollision };\n\t\t};\n\t}\n\n\t\/\/ declarations\n\tstatic void trigger(Entity & first, Entity & second);\n\t\/\/\n\tstatic void onCollision(Entity & first, Entity & second) {\n\t\ttrigger(first, second);\n\t\ttrigger(second, first);\n\t}\n\n\tstatic void trigger(Entity & first, Entity & second) {\n\t\tif (!first.has<CollisionComponent>())\n\t\t\treturn;\n\n\t\tconst auto & comp = first.get<CollisionComponent>();\n\t\tif (comp.onCollide != nullptr)\n\t\t\tcomp.onCollide(first, second);\n\t}\n}\n<commit_msg>add regions to CollisionSystem<commit_after>#include \"CollisionSystem.hpp\"\n#include \"EntityManager.hpp\"\n\n#include \"functions\/OnCollision.hpp\"\n#include \"data\/CollisionComponent.hpp\"\n\nnamespace kengine {\n#pragma region declarations\n\tstatic void onCollision(Entity & first, Entity & second);\n#pragma endregion\n\tEntityCreator * CollisionSystem(EntityManager & em) {\n\t\treturn [](Entity & e) {\n\t\t\te += functions::OnCollision{ onCollision };\n\t\t};\n\t}\n\n#pragma region onCollision\n#pragma region declarations\n\tstatic void trigger(Entity & first, Entity & second);\n#pragma endregion\n\tstatic void onCollision(Entity & first, Entity & second) {\n\t\ttrigger(first, second);\n\t\ttrigger(second, first);\n\t}\n\n\tstatic void trigger(Entity & first, Entity & second) {\n\t\tif (!first.has<CollisionComponent>())\n\t\t\treturn;\n\n\t\tconst auto & comp = first.get<CollisionComponent>();\n\t\tif (comp.onCollide != nullptr)\n\t\t\tcomp.onCollide(first, second);\n\t}\n#pragma endregion onCollision\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <GLFW\/glfw3.h>\n\n#include \"GLFWSystem.hpp\"\n#include \"kengine.hpp\"\n\n#include \"data\/InputBufferComponent.hpp\"\n#include \"data\/GLFWWindowComponent.hpp\"\n#include \"data\/WindowComponent.hpp\"\n\n#include \"functions\/OnTerminate.hpp\"\n#include \"functions\/OnMouseCaptured.hpp\"\n#include \"functions\/Execute.hpp\"\n\n#include \"helpers\/logHelper.hpp\"\n\n#include \"imgui.h\"\n\nnamespace kengine {\n\tnamespace Input {\n\t\tstatic InputBufferComponent * g_buffer;\n\n\t\tstatic void onKey(GLFWwindow * window, int key, int scancode, int action, int mods) noexcept {\n\t\t\tif (g_buffer == nullptr || (ImGui::GetCurrentContext() != nullptr && ImGui::GetIO().WantCaptureKeyboard))\n\t\t\t\treturn;\n\n\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\n\t\t\tif (action == GLFW_PRESS)\n\t\t\t\tg_buffer->keys.push_back(InputBufferComponent::KeyEvent{ id, key, true });\n\t\t\telse if (action == GLFW_RELEASE)\n\t\t\t\tg_buffer->keys.push_back(InputBufferComponent::KeyEvent{ id, key, false });\n\t\t}\n\n\t\tstatic putils::Point2f lastPos{ FLT_MAX, FLT_MAX };\n\n\t\tstatic void onClick(GLFWwindow * window, int button, int action, int mods) noexcept {\n\t\t\tif (g_buffer == nullptr || (ImGui::GetCurrentContext() != nullptr && ImGui::GetIO().WantCaptureMouse))\n\t\t\t\treturn;\n\n\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\n\t\t\tif (action == GLFW_PRESS)\n\t\t\t\tg_buffer->clicks.push_back(InputBufferComponent::ClickEvent{ id, lastPos, button, true });\n\t\t\telse if (action == GLFW_RELEASE)\n\t\t\t\tg_buffer->clicks.push_back(InputBufferComponent::ClickEvent{ id, lastPos, button, false });\n\t\t}\n\n\t\tstatic void onMouseMove(GLFWwindow * window, double xpos, double ypos) noexcept {\n\t\t\tif (lastPos.x == FLT_MAX) {\n\t\t\t\tlastPos.x = (float)xpos;\n\t\t\t\tlastPos.y = (float)ypos;\n\t\t\t}\n\n\t\t\tif (g_buffer == nullptr || (ImGui::GetCurrentContext() != nullptr && ImGui::GetIO().WantCaptureMouse))\n\t\t\t\treturn;\n\n\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\n\t\t\tInputBufferComponent::MouseMoveEvent info;\n\t\t\tinfo.window = id;\n\t\t\tinfo.pos = { (float)xpos, (float)ypos };\n\t\t\tinfo.rel = { (float)xpos - lastPos.x, (float)ypos - lastPos.y };\n\t\t\tlastPos = info.pos;\n\n\t\t\tg_buffer->moves.push_back(info);\n\t\t}\n\n\t\tstatic void onScroll(GLFWwindow * window, double xoffset, double yoffset) noexcept {\n\t\t\tif (g_buffer == nullptr || (ImGui::GetCurrentContext() != nullptr && ImGui::GetIO().WantCaptureMouse))\n\t\t\t\treturn;\n\n\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\t\t\tg_buffer->scrolls.push_back(InputBufferComponent::MouseScrollEvent{ id, (float)xoffset, (float)yoffset, lastPos });\n\t\t}\n\t}\n\n\tEntityCreator * GLFWSystem() noexcept {\n\t\tstruct impl {\n\t\t\tstatic void init(Entity & e) noexcept {\n\t\t\t\tkengine_log(Log, \"Init\", \"GLFWSystem\");\n\t\t\t\te += functions::Execute{ execute };\n\t\t\t\te += functions::OnEntityCreated{ onEntityCreated };\n\t\t\t\te += functions::OnTerminate{ terminate };\n\t\t\t\te += functions::OnMouseCaptured{ onMouseCaptured };\n\n\t\t\t\tfor (const auto & [e, buffer] : entities.with<InputBufferComponent>()) {\n\t\t\t\t\tInput::g_buffer = &buffer;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tconst auto ret = glfwInit();\n                kengine_assert(ret == GLFW_TRUE);\n\t\t\t\texecute(0.f); \/\/ init already existing windows\n\t\t\t}\n\n\t\t\tstatic void terminate() noexcept {\n\t\t\t\tkengine_log(Log, \"Terminate\", \"GLFWSystem\");\n\t\t\t\tglfwTerminate();\n\t\t\t}\n\n\t\t\tstatic void onMouseCaptured(EntityID window, bool captured) noexcept {\n\t\t\t\tconst auto inputMode = captured ? GLFW_CURSOR_DISABLED : GLFW_CURSOR_NORMAL;\n\t\t\t\tconst auto state = captured ? \"captured\" : \"released\";\n\n\t\t\t\tkengine_logf(Log, \"GLFWSystem\", \"Mouse %s for ImGui\", state);\n\t\t\t\tif (captured)\n\t\t\t\t\tImGui::GetIO().ConfigFlags |= ImGuiConfigFlags_NoMouse;\n\t\t\t\telse\n\t\t\t\t\tImGui::GetIO().ConfigFlags &= ~ImGuiConfigFlags_NoMouse;\n\n\t\t\t\tif (window == INVALID_ID) {\n\t\t\t\t\tfor (const auto & [e, glfw] : entities.with<GLFWWindowComponent>()) {\n\t\t\t\t\t\tkengine_logf(Log, \"GLFWSystem\", \"Mouse %s for %zu\", state, e.id);\n\t\t\t\t\t\tglfwSetInputMode(glfw.window.get(), GLFW_CURSOR, inputMode);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst auto glfw = entities[window].tryGet<GLFWWindowComponent>();\n\t\t\t\tif (glfw == nullptr)\n\t\t\t\t\treturn;\n\t\t\t\tkengine_logf(Log, \"GLFWSystem\", \"Mouse %s for %zu\", state, window);\n\t\t\t\tglfwSetInputMode(glfw->window.get(), GLFW_CURSOR, inputMode);\n\t\t\t}\n\n\t\t\tstatic void onEntityCreated(Entity & e) noexcept {\n\t\t\t\tconst auto window = e.tryGet<WindowComponent>();\n\t\t\t\tif (!window)\n\t\t\t\t\treturn;\n\n\t\t\t\tconst auto initGlfw = e.tryGet<GLFWWindowInitComponent>();\n\t\t\t\tif (!initGlfw)\n\t\t\t\t\treturn;\n\n\t\t\t\tcreateWindow(e, *window, *initGlfw);\n\t\t\t}\n\n\t\t\tstatic void execute(float deltaTime) noexcept {\n\t\t\t\tkengine_log(Verbose, \"Execute\", \"GLFWSystem\");\n\t\t\t\tfor (const auto & [e, window, glfw] : entities.with<WindowComponent, GLFWWindowComponent>())\n\t\t\t\t\tif (glfwWindowShouldClose(glfw.window.get())) {\n\t\t\t\t\t\tif (window.shutdownOnClose)\n\t\t\t\t\t\t\tstopRunning();\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tentities -= e.id;\n\t\t\t\t\t}\n\n\t\t\t\tfor (auto [e, window, initGlfw, noGLFW] : entities.with<WindowComponent, GLFWWindowInitComponent, no<GLFWWindowComponent>>()) {\n\t\t\t\t\tcreateWindow(e, window, initGlfw);\n\t\t\t\t\te.detach<GLFWWindowInitComponent>();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstatic void createWindow(Entity & e, WindowComponent & window, const GLFWWindowInitComponent & initGlfw) noexcept {\n\t\t\t\tkengine_logf(Log, \"GLFWSystem\", \"Initializing window for %zu\", e.id);\n\t\t\t\tauto & glfwComp = e.attach<GLFWWindowComponent>();\n\n\t\t\t\tif (initGlfw.setHints)\n\t\t\t\t\tinitGlfw.setHints();\n\n\t\t\t\t\/\/ TODO: depend on g_windowComponent->fullscreen\n\t\t\t\tglfwWindowHint(GLFW_RESIZABLE, GLFW_TRUE);\n\n\t\t\t\tglfwComp.window = glfwCreateWindow((int)window.size.x, (int)window.size.y, window.name, nullptr, nullptr);\n\t\t\t\t\/\/ Desired size may not have been available, update to actual size\n\t\t\t\tint width, height;\n\t\t\t\tglfwGetWindowSize(glfwComp.window.get(), &width, &height);\n\t\t\t\twindow.size = { (unsigned int)width, (unsigned int)height };\n\t\t\t\tglfwSetWindowAspectRatio(glfwComp.window.get(), window.size.x, window.size.y);\n\n\t\t\t\tglfwMakeContextCurrent(glfwComp.window.get());\n\t\t\t\tglfwSetWindowSizeCallback(glfwComp.window.get(), [](GLFWwindow * window, int width, int height) noexcept {\n\t\t\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\t\t\t\t\tauto & comp = entities[id].get<WindowComponent>();\n\t\t\t\t\tcomp.size = { (unsigned int)width, (unsigned int)height };\n                });\n\n\t\t\t\tglfwSetMouseButtonCallback(glfwComp.window.get(), Input::onClick);\n\t\t\t\tglfwSetCursorPosCallback(glfwComp.window.get(), Input::onMouseMove);\n\t\t\t\tglfwSetScrollCallback(glfwComp.window.get(), Input::onScroll);\n\t\t\t\tglfwSetKeyCallback(glfwComp.window.get(), Input::onKey);\n\n\t\t\t\tglfwSetWindowUserPointer(glfwComp.window.get(), (void *)e.id);\n\n\t\t\t\tif (initGlfw.onWindowCreated)\n\t\t\t\t\tinitGlfw.onWindowCreated();\n\t\t\t}\n\t\t};\n\n\t\treturn impl::init;\n\t}\n}<commit_msg>glfw: set error callback<commit_after>#include <GLFW\/glfw3.h>\n\n#include \"GLFWSystem.hpp\"\n#include \"kengine.hpp\"\n\n#include \"data\/InputBufferComponent.hpp\"\n#include \"data\/GLFWWindowComponent.hpp\"\n#include \"data\/WindowComponent.hpp\"\n\n#include \"functions\/OnTerminate.hpp\"\n#include \"functions\/OnMouseCaptured.hpp\"\n#include \"functions\/Execute.hpp\"\n\n#include \"helpers\/logHelper.hpp\"\n\n#include \"imgui.h\"\n\nnamespace kengine {\n\tnamespace Input {\n\t\tstatic InputBufferComponent * g_buffer;\n\n\t\tstatic void onKey(GLFWwindow * window, int key, int scancode, int action, int mods) noexcept {\n\t\t\tif (g_buffer == nullptr || (ImGui::GetCurrentContext() != nullptr && ImGui::GetIO().WantCaptureKeyboard))\n\t\t\t\treturn;\n\n\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\n\t\t\tif (action == GLFW_PRESS)\n\t\t\t\tg_buffer->keys.push_back(InputBufferComponent::KeyEvent{ id, key, true });\n\t\t\telse if (action == GLFW_RELEASE)\n\t\t\t\tg_buffer->keys.push_back(InputBufferComponent::KeyEvent{ id, key, false });\n\t\t}\n\n\t\tstatic putils::Point2f lastPos{ FLT_MAX, FLT_MAX };\n\n\t\tstatic void onClick(GLFWwindow * window, int button, int action, int mods) noexcept {\n\t\t\tif (g_buffer == nullptr || (ImGui::GetCurrentContext() != nullptr && ImGui::GetIO().WantCaptureMouse))\n\t\t\t\treturn;\n\n\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\n\t\t\tif (action == GLFW_PRESS)\n\t\t\t\tg_buffer->clicks.push_back(InputBufferComponent::ClickEvent{ id, lastPos, button, true });\n\t\t\telse if (action == GLFW_RELEASE)\n\t\t\t\tg_buffer->clicks.push_back(InputBufferComponent::ClickEvent{ id, lastPos, button, false });\n\t\t}\n\n\t\tstatic void onMouseMove(GLFWwindow * window, double xpos, double ypos) noexcept {\n\t\t\tif (lastPos.x == FLT_MAX) {\n\t\t\t\tlastPos.x = (float)xpos;\n\t\t\t\tlastPos.y = (float)ypos;\n\t\t\t}\n\n\t\t\tif (g_buffer == nullptr || (ImGui::GetCurrentContext() != nullptr && ImGui::GetIO().WantCaptureMouse))\n\t\t\t\treturn;\n\n\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\n\t\t\tInputBufferComponent::MouseMoveEvent info;\n\t\t\tinfo.window = id;\n\t\t\tinfo.pos = { (float)xpos, (float)ypos };\n\t\t\tinfo.rel = { (float)xpos - lastPos.x, (float)ypos - lastPos.y };\n\t\t\tlastPos = info.pos;\n\n\t\t\tg_buffer->moves.push_back(info);\n\t\t}\n\n\t\tstatic void onScroll(GLFWwindow * window, double xoffset, double yoffset) noexcept {\n\t\t\tif (g_buffer == nullptr || (ImGui::GetCurrentContext() != nullptr && ImGui::GetIO().WantCaptureMouse))\n\t\t\t\treturn;\n\n\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\t\t\tg_buffer->scrolls.push_back(InputBufferComponent::MouseScrollEvent{ id, (float)xoffset, (float)yoffset, lastPos });\n\t\t}\n\t}\n\n\tEntityCreator * GLFWSystem() noexcept {\n\t\tstruct impl {\n\t\t\tstatic void init(Entity & e) noexcept {\n\t\t\t\tkengine_log(Log, \"Init\", \"GLFWSystem\");\n\t\t\t\te += functions::Execute{ execute };\n\t\t\t\te += functions::OnEntityCreated{ onEntityCreated };\n\t\t\t\te += functions::OnTerminate{ terminate };\n\t\t\t\te += functions::OnMouseCaptured{ onMouseCaptured };\n\n\t\t\t\tfor (const auto & [e, buffer] : entities.with<InputBufferComponent>()) {\n\t\t\t\t\tInput::g_buffer = &buffer;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n                glfwSetErrorCallback([](int error, const char * desc) {\n                    kengine_logf(Error, \"GLFW\", \"Error code: %d. Description: '%s'\", error, desc);\n                });\n\n\t\t\t\tconst auto ret = glfwInit();\n                kengine_assert(ret == GLFW_TRUE);\n\t\t\t\texecute(0.f); \/\/ init already existing windows\n\t\t\t}\n\n\t\t\tstatic void terminate() noexcept {\n\t\t\t\tkengine_log(Log, \"Terminate\", \"GLFWSystem\");\n\t\t\t\tglfwTerminate();\n\t\t\t}\n\n\t\t\tstatic void onMouseCaptured(EntityID window, bool captured) noexcept {\n\t\t\t\tconst auto inputMode = captured ? GLFW_CURSOR_DISABLED : GLFW_CURSOR_NORMAL;\n\t\t\t\tconst auto state = captured ? \"captured\" : \"released\";\n\n\t\t\t\tkengine_logf(Log, \"GLFWSystem\", \"Mouse %s for ImGui\", state);\n\t\t\t\tif (captured)\n\t\t\t\t\tImGui::GetIO().ConfigFlags |= ImGuiConfigFlags_NoMouse;\n\t\t\t\telse\n\t\t\t\t\tImGui::GetIO().ConfigFlags &= ~ImGuiConfigFlags_NoMouse;\n\n\t\t\t\tif (window == INVALID_ID) {\n\t\t\t\t\tfor (const auto & [e, glfw] : entities.with<GLFWWindowComponent>()) {\n\t\t\t\t\t\tkengine_logf(Log, \"GLFWSystem\", \"Mouse %s for %zu\", state, e.id);\n\t\t\t\t\t\tglfwSetInputMode(glfw.window.get(), GLFW_CURSOR, inputMode);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst auto glfw = entities[window].tryGet<GLFWWindowComponent>();\n\t\t\t\tif (glfw == nullptr)\n\t\t\t\t\treturn;\n\t\t\t\tkengine_logf(Log, \"GLFWSystem\", \"Mouse %s for %zu\", state, window);\n\t\t\t\tglfwSetInputMode(glfw->window.get(), GLFW_CURSOR, inputMode);\n\t\t\t}\n\n\t\t\tstatic void onEntityCreated(Entity & e) noexcept {\n\t\t\t\tconst auto window = e.tryGet<WindowComponent>();\n\t\t\t\tif (!window)\n\t\t\t\t\treturn;\n\n\t\t\t\tconst auto initGlfw = e.tryGet<GLFWWindowInitComponent>();\n\t\t\t\tif (!initGlfw)\n\t\t\t\t\treturn;\n\n\t\t\t\tcreateWindow(e, *window, *initGlfw);\n\t\t\t}\n\n\t\t\tstatic void execute(float deltaTime) noexcept {\n\t\t\t\tkengine_log(Verbose, \"Execute\", \"GLFWSystem\");\n\t\t\t\tfor (const auto & [e, window, glfw] : entities.with<WindowComponent, GLFWWindowComponent>())\n\t\t\t\t\tif (glfwWindowShouldClose(glfw.window.get())) {\n\t\t\t\t\t\tif (window.shutdownOnClose)\n\t\t\t\t\t\t\tstopRunning();\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tentities -= e.id;\n\t\t\t\t\t}\n\n\t\t\t\tfor (auto [e, window, initGlfw, noGLFW] : entities.with<WindowComponent, GLFWWindowInitComponent, no<GLFWWindowComponent>>()) {\n\t\t\t\t\tcreateWindow(e, window, initGlfw);\n\t\t\t\t\te.detach<GLFWWindowInitComponent>();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstatic void createWindow(Entity & e, WindowComponent & window, const GLFWWindowInitComponent & initGlfw) noexcept {\n\t\t\t\tkengine_logf(Log, \"GLFWSystem\", \"Initializing window for %zu\", e.id);\n\t\t\t\tauto & glfwComp = e.attach<GLFWWindowComponent>();\n\n\t\t\t\tif (initGlfw.setHints)\n\t\t\t\t\tinitGlfw.setHints();\n\n\t\t\t\t\/\/ TODO: depend on g_windowComponent->fullscreen\n\t\t\t\tglfwWindowHint(GLFW_RESIZABLE, GLFW_TRUE);\n\n\t\t\t\tglfwComp.window = glfwCreateWindow((int)window.size.x, (int)window.size.y, window.name, nullptr, nullptr);\n\t\t\t\t\/\/ Desired size may not have been available, update to actual size\n\t\t\t\tint width, height;\n\t\t\t\tglfwGetWindowSize(glfwComp.window.get(), &width, &height);\n\t\t\t\twindow.size = { (unsigned int)width, (unsigned int)height };\n\t\t\t\tglfwSetWindowAspectRatio(glfwComp.window.get(), window.size.x, window.size.y);\n\n\t\t\t\tglfwMakeContextCurrent(glfwComp.window.get());\n\t\t\t\tglfwSetWindowSizeCallback(glfwComp.window.get(), [](GLFWwindow * window, int width, int height) noexcept {\n\t\t\t\t\tconst auto id = (EntityID)glfwGetWindowUserPointer(window);\n\t\t\t\t\tauto & comp = entities[id].get<WindowComponent>();\n\t\t\t\t\tcomp.size = { (unsigned int)width, (unsigned int)height };\n                });\n\n\t\t\t\tglfwSetMouseButtonCallback(glfwComp.window.get(), Input::onClick);\n\t\t\t\tglfwSetCursorPosCallback(glfwComp.window.get(), Input::onMouseMove);\n\t\t\t\tglfwSetScrollCallback(glfwComp.window.get(), Input::onScroll);\n\t\t\t\tglfwSetKeyCallback(glfwComp.window.get(), Input::onKey);\n\n\t\t\t\tglfwSetWindowUserPointer(glfwComp.window.get(), (void *)e.id);\n\n\t\t\t\tif (initGlfw.onWindowCreated)\n\t\t\t\t\tinitGlfw.onWindowCreated();\n\t\t\t}\n\t\t};\n\n\t\treturn impl::init;\n\t}\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#include <blas.hpp>\n#include <af\/blas.h>\n#include <Array.hpp>\n#include <cassert>\n#include <string>\n#include <functional>\n#include <stdexcept>\n#include <mutex>\n#include <err_common.hpp>\n#include <err_clblas.hpp>\n#include <math.hpp>\n\nnamespace opencl\n{\n\nusing std::is_floating_point;\nusing std::enable_if;\nusing std::once_flag;\nusing std::call_once;\nusing std::runtime_error;\nusing std::to_string;\n\nclblasTranspose\ntoClblasTranspose(af_mat_prop opt)\n{\n    clblasTranspose out = clblasNoTrans;\n    switch(opt) {\n        case AF_MAT_NONE        : out = clblasNoTrans;   break;\n        case AF_MAT_TRANS           : out = clblasTrans;     break;\n        case AF_MAT_CTRANS : out = clblasConjTrans; break;\n        default                     : AF_ERROR(\"INVALID af_mat_prop\", AF_ERR_ARG);\n    }\n    return out;\n}\n\n#define BLAS_FUNC_DEF(NAME)                                             \\\ntemplate<typename T>                                                    \\\nstruct NAME##_func;\n\n#define BLAS_FUNC(NAME, TYPE, PREFIX)                                   \\\ntemplate<>                                                              \\\nstruct NAME##_func<TYPE>                                                \\\n{                                                                       \\\n    template<typename... Args>                                          \\\n    clblasStatus                                                        \\\n    operator() (Args... args) { return clblas##PREFIX##NAME(args...); } \\\n};\n\nBLAS_FUNC_DEF(gemm)\nBLAS_FUNC(gemm, float,      S)\nBLAS_FUNC(gemm, double,     D)\nBLAS_FUNC(gemm, cfloat,     C)\nBLAS_FUNC(gemm, cdouble,    Z)\n\nBLAS_FUNC_DEF(gemv)\nBLAS_FUNC(gemv, float,      S)\nBLAS_FUNC(gemv, double,     D)\nBLAS_FUNC(gemv, cfloat,     C)\nBLAS_FUNC(gemv, cdouble,    Z)\n\nBLAS_FUNC_DEF( dot )\nBLAS_FUNC(dot, float,       S)\nBLAS_FUNC(dot, double,      D)\n\n#undef BLAS_FUNC_DEF\n#undef BLAS_FUNC\n\n#define BLAS_FUNC(NAME, TYPE, PREFIX, SUFFIX)\t\t\t\t\t\\\ntemplate<>                                                              \\\nstruct NAME##_func<TYPE>                                                \\\n{                                                                       \\\n    template<typename... Args>                                          \\\n    clblasStatus                                                        \\\n    operator() (Args... args) { return clblas##PREFIX##NAME##SUFFIX(args...); } \\\n};\n\nBLAS_FUNC(dot, cfloat,       C, u)\nBLAS_FUNC(dot, cdouble,      Z, u)\n\n#undef BLAS_FUNC_DEF\n#undef BLAS_FUNC\n\ntemplate<typename T>\nArray<T> matmul(const Array<T> &lhs, const Array<T> &rhs,\n                af_mat_prop optLhs, af_mat_prop optRhs)\n{\n    initBlas();\n    clblasTranspose lOpts = toClblasTranspose(optLhs);\n    clblasTranspose rOpts = toClblasTranspose(optRhs);\n\n    int aRowDim = (lOpts == clblasNoTrans) ? 0 : 1;\n    int aColDim = (lOpts == clblasNoTrans) ? 1 : 0;\n    int bColDim = (rOpts == clblasNoTrans) ? 1 : 0;\n\n    dim4 lDims = lhs.dims();\n    dim4 rDims = rhs.dims();\n    int M = lDims[aRowDim];\n    int N = rDims[bColDim];\n    int K = lDims[aColDim];\n\n    \/\/FIXME: Leaks on errors.\n    Array<T> out = createEmptyArray<T>(af::dim4(M, N, 1, 1));\n    auto alpha = scalar<T>(1);\n    auto beta  = scalar<T>(0);\n\n    dim4 lStrides = lhs.strides();\n    dim4 rStrides = rhs.strides();\n    cl::Event event;\n    if(rDims[bColDim] == 1) {\n        N = lDims[aColDim];\n        gemv_func<T> gemv;\n        CLBLAS_CHECK(\n            gemv(\n                clblasColumnMajor, lOpts,\n                lDims[0], lDims[1],\n                alpha,\n                (*lhs.get())(),    lhs.getOffset(),   lStrides[1],\n                (*rhs.get())(),    rhs.getOffset(),   rStrides[0],\n                beta ,\n                (*out.get())(),   out.getOffset(),             1,\n                1, &getQueue()(), 0, nullptr, &event())\n            );\n    } else {\n        gemm_func<T> gemm;\n        CLBLAS_CHECK(\n            gemm(\n                clblasColumnMajor, lOpts, rOpts,\n                M, N, K,\n                alpha,\n                (*lhs.get())(),    lhs.getOffset(),   lStrides[1],\n                (*rhs.get())(),    rhs.getOffset(),   rStrides[1],\n                beta,\n                (*out.get())(),   out.getOffset(),  out.dims()[0],\n                1, &getQueue()(), 0, nullptr, &event())\n            );\n\n    }\n\n    return out;\n}\n\ntemplate<typename T>\nArray<T> dot(const Array<T> &lhs, const Array<T> &rhs,\n             af_mat_prop optLhs, af_mat_prop optRhs)\n{\n    initBlas();\n\n    int N = lhs.dims()[0];\n    dot_func<T> dot;\n    cl::Event event;\n    auto out = createEmptyArray<T>(af::dim4(1));\n    cl::Buffer scratch(getContext(), CL_MEM_READ_WRITE, sizeof(T) * N);\n    CLBLAS_CHECK(\n        dot(N,\n            (*out.get())(), out.getOffset(),\n            (*lhs.get())(),  lhs.getOffset(), lhs.strides()[0],\n            (*rhs.get())(),  rhs.getOffset(), rhs.strides()[0],\n            scratch(),\n            1, &getQueue()(), 0, nullptr, &event())\n        );\n    return out;\n}\n\n#define INSTANTIATE_BLAS(TYPE)                                                          \\\n    template Array<TYPE> matmul<TYPE>(const Array<TYPE> &lhs, const Array<TYPE> &rhs,  \\\n                    af_mat_prop optLhs, af_mat_prop optRhs);\n\nINSTANTIATE_BLAS(float)\nINSTANTIATE_BLAS(cfloat)\nINSTANTIATE_BLAS(double)\nINSTANTIATE_BLAS(cdouble)\n\n#define INSTANTIATE_DOT(TYPE)                                                       \\\n    template Array<TYPE> dot<TYPE>(const Array<TYPE> &lhs, const Array<TYPE> &rhs, \\\n                                   af_mat_prop optLhs, af_mat_prop optRhs);\n\ntemplate<typename T>\nArray<T> dot(const Array<T> &lhs, const Array<T> &rhs,\n              af_mat_prop optLhs, af_mat_prop optRhs);\n\nINSTANTIATE_DOT(float)\nINSTANTIATE_DOT(double)\nINSTANTIATE_DOT(cfloat)\nINSTANTIATE_DOT(cdouble)\n}\n<commit_msg>Revert \"BUILD: Fix redefinition warning in blas.\"<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#include <blas.hpp>\n#include <af\/blas.h>\n#include <Array.hpp>\n#include <cassert>\n#include <string>\n#include <functional>\n#include <stdexcept>\n#include <mutex>\n#include <err_common.hpp>\n#include <err_clblas.hpp>\n#include <math.hpp>\n\nnamespace opencl\n{\n\nusing std::is_floating_point;\nusing std::enable_if;\nusing std::once_flag;\nusing std::call_once;\nusing std::runtime_error;\nusing std::to_string;\n\nclblasTranspose\ntoClblasTranspose(af_mat_prop opt)\n{\n    clblasTranspose out = clblasNoTrans;\n    switch(opt) {\n        case AF_MAT_NONE        : out = clblasNoTrans;   break;\n        case AF_MAT_TRANS           : out = clblasTrans;     break;\n        case AF_MAT_CTRANS : out = clblasConjTrans; break;\n        default                     : AF_ERROR(\"INVALID af_mat_prop\", AF_ERR_ARG);\n    }\n    return out;\n}\n\n#define BLAS_FUNC_DEF(NAME)                                             \\\ntemplate<typename T>                                                    \\\nstruct NAME##_func;\n\n#define BLAS_FUNC(NAME, TYPE, PREFIX)                                   \\\ntemplate<>                                                              \\\nstruct NAME##_func<TYPE>                                                \\\n{                                                                       \\\n    template<typename... Args>                                          \\\n    clblasStatus                                                        \\\n    operator() (Args... args) { return clblas##PREFIX##NAME(args...); } \\\n};\n\nBLAS_FUNC_DEF(gemm)\nBLAS_FUNC(gemm, float,      S)\nBLAS_FUNC(gemm, double,     D)\nBLAS_FUNC(gemm, cfloat,     C)\nBLAS_FUNC(gemm, cdouble,    Z)\n\nBLAS_FUNC_DEF(gemv)\nBLAS_FUNC(gemv, float,      S)\nBLAS_FUNC(gemv, double,     D)\nBLAS_FUNC(gemv, cfloat,     C)\nBLAS_FUNC(gemv, cdouble,    Z)\n\nBLAS_FUNC_DEF( dot )\nBLAS_FUNC(dot, float,       S)\nBLAS_FUNC(dot, double,      D)\n\n#undef BLAS_FUNC_DEF\n#define BLAS_FUNC(NAME, TYPE, PREFIX, SUFFIX)\t\t\t\t\t\\\ntemplate<>                                                              \\\nstruct NAME##_func<TYPE>                                                \\\n{                                                                       \\\n    template<typename... Args>                                          \\\n    clblasStatus                                                        \\\n    operator() (Args... args) { return clblas##PREFIX##NAME##SUFFIX(args...); } \\\n};\n\nBLAS_FUNC(dot, cfloat,       C, u)\nBLAS_FUNC(dot, cdouble,      Z, u)\n\n#undef BLAS_FUNC_DEF\n#undef BLAS_FUNC\n\ntemplate<typename T>\nArray<T> matmul(const Array<T> &lhs, const Array<T> &rhs,\n                af_mat_prop optLhs, af_mat_prop optRhs)\n{\n    initBlas();\n    clblasTranspose lOpts = toClblasTranspose(optLhs);\n    clblasTranspose rOpts = toClblasTranspose(optRhs);\n\n    int aRowDim = (lOpts == clblasNoTrans) ? 0 : 1;\n    int aColDim = (lOpts == clblasNoTrans) ? 1 : 0;\n    int bColDim = (rOpts == clblasNoTrans) ? 1 : 0;\n\n    dim4 lDims = lhs.dims();\n    dim4 rDims = rhs.dims();\n    int M = lDims[aRowDim];\n    int N = rDims[bColDim];\n    int K = lDims[aColDim];\n\n    \/\/FIXME: Leaks on errors.\n    Array<T> out = createEmptyArray<T>(af::dim4(M, N, 1, 1));\n    auto alpha = scalar<T>(1);\n    auto beta  = scalar<T>(0);\n\n    dim4 lStrides = lhs.strides();\n    dim4 rStrides = rhs.strides();\n    cl::Event event;\n    if(rDims[bColDim] == 1) {\n        N = lDims[aColDim];\n        gemv_func<T> gemv;\n        CLBLAS_CHECK(\n            gemv(\n                clblasColumnMajor, lOpts,\n                lDims[0], lDims[1],\n                alpha,\n                (*lhs.get())(),    lhs.getOffset(),   lStrides[1],\n                (*rhs.get())(),    rhs.getOffset(),   rStrides[0],\n                beta ,\n                (*out.get())(),   out.getOffset(),             1,\n                1, &getQueue()(), 0, nullptr, &event())\n            );\n    } else {\n        gemm_func<T> gemm;\n        CLBLAS_CHECK(\n            gemm(\n                clblasColumnMajor, lOpts, rOpts,\n                M, N, K,\n                alpha,\n                (*lhs.get())(),    lhs.getOffset(),   lStrides[1],\n                (*rhs.get())(),    rhs.getOffset(),   rStrides[1],\n                beta,\n                (*out.get())(),   out.getOffset(),  out.dims()[0],\n                1, &getQueue()(), 0, nullptr, &event())\n            );\n\n    }\n\n    return out;\n}\n\ntemplate<typename T>\nArray<T> dot(const Array<T> &lhs, const Array<T> &rhs,\n             af_mat_prop optLhs, af_mat_prop optRhs)\n{\n    initBlas();\n\n    int N = lhs.dims()[0];\n    dot_func<T> dot;\n    cl::Event event;\n    auto out = createEmptyArray<T>(af::dim4(1));\n    cl::Buffer scratch(getContext(), CL_MEM_READ_WRITE, sizeof(T) * N);\n    CLBLAS_CHECK(\n        dot(N,\n            (*out.get())(), out.getOffset(),\n            (*lhs.get())(),  lhs.getOffset(), lhs.strides()[0],\n            (*rhs.get())(),  rhs.getOffset(), rhs.strides()[0],\n            scratch(),\n            1, &getQueue()(), 0, nullptr, &event())\n        );\n    return out;\n}\n\n#define INSTANTIATE_BLAS(TYPE)                                                          \\\n    template Array<TYPE> matmul<TYPE>(const Array<TYPE> &lhs, const Array<TYPE> &rhs,  \\\n                    af_mat_prop optLhs, af_mat_prop optRhs);\n\nINSTANTIATE_BLAS(float)\nINSTANTIATE_BLAS(cfloat)\nINSTANTIATE_BLAS(double)\nINSTANTIATE_BLAS(cdouble)\n\n#define INSTANTIATE_DOT(TYPE)                                                       \\\n    template Array<TYPE> dot<TYPE>(const Array<TYPE> &lhs, const Array<TYPE> &rhs, \\\n                                   af_mat_prop optLhs, af_mat_prop optRhs);\n\ntemplate<typename T>\nArray<T> dot(const Array<T> &lhs, const Array<T> &rhs,\n              af_mat_prop optLhs, af_mat_prop optRhs);\n\nINSTANTIATE_DOT(float)\nINSTANTIATE_DOT(double)\nINSTANTIATE_DOT(cfloat)\nINSTANTIATE_DOT(cdouble)\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file pointPolygonTest.cpp\n * @brief mex interface for pointPolygonTest\n * @author Kota Yamaguchi\n * @date 2011\n *\/\n#include \"mexopencv.hpp\"\nusing namespace std;\nusing namespace cv;\n\n\/**\n * Main entry called from Matlab\n * @param nlhs number of left-hand-side arguments\n * @param plhs pointers to mxArrays in the left-hand-side\n * @param nrhs number of right-hand-side arguments\n * @param prhs pointers to mxArrays in the right-hand-side\n *\/\nvoid mexFunction( int nlhs, mxArray *plhs[],\n                  int nrhs, const mxArray *prhs[] )\n{\n    \/\/ Check the number of arguments\n    if (nrhs<2 || nlhs>1)\n        mexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \n    \/\/ Argument vector\n    vector<MxArray> rhs(prhs,prhs+nrhs);\n    vector<Point2f> contour(rhs[0].toVector<Point2f>());\n    Point2f pt(rhs[1].toPoint_<float>());\n    bool measureDist=false;\n    for (int i=2; i<nrhs; i+=2) {\n        string key(rhs[i].toString());\n        if (key==\"MeasureDist\")\n            measureDist = rhs[i+1].toBool();\n        else\n            mexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    }\n    plhs[0] = MxArray(pointPolygonTest(contour,pt,measureDist));\n}\n<commit_msg>small fix on pointPolygonTest<commit_after>\/**\n * @file pointPolygonTest.cpp\n * @brief mex interface for pointPolygonTest\n * @author Kota Yamaguchi\n * @date 2011\n *\/\n#include \"mexopencv.hpp\"\nusing namespace std;\nusing namespace cv;\n\n\/**\n * Main entry called from Matlab\n * @param nlhs number of left-hand-side arguments\n * @param plhs pointers to mxArrays in the left-hand-side\n * @param nrhs number of right-hand-side arguments\n * @param prhs pointers to mxArrays in the right-hand-side\n *\/\nvoid mexFunction( int nlhs, mxArray *plhs[],\n                  int nrhs, const mxArray *prhs[] )\n{\n    \/\/ Check the number of arguments\n    if (nrhs<2 || nlhs>1)\n        mexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    \n    \/\/ Argument vector\n    vector<MxArray> rhs(prhs,prhs+nrhs);\n   \n    Point2f pt(rhs[1].toPoint_<float>());\n    bool measureDist=false;\n    \n    for (int i=2; i<nrhs; i+=2) \n    {\n        string key(rhs[i].toString());\n        if (key==\"MeasureDist\")\n            measureDist = rhs[i+1].toBool();\n        else\n            mexErrMsgIdAndTxt(\"mexopencv:error\",\"Wrong number of arguments\");\n    }\n        \n    if (rhs[0].isNumeric()) \n    {\n        Mat contour(rhs[0].toMat(CV_32F)); \n        plhs[0] = MxArray(pointPolygonTest(contour,pt,measureDist));\n    }\n    else if (rhs[0].isCell()) { \n        \n        vector<Point2f> contour(rhs[0].toVector<Point2f>());\n        plhs[0] = MxArray(pointPolygonTest(contour,pt,measureDist));\n    }\n      \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *                                                                       *\n *  I|*j^3Cl|a   \"+!*%                  qt          Nd   gW              *\n *  l]{y+l?MM*  !#Wla\\NNP               NW          MM   I|              *\n *        PW    ?E|    tWg              Wg  sC!     AW           ~@v~    *\n *       NC     ?M!    yN|  WW     MK   MW@K1Y%M@   RM   #Q    QP@tim    *\n *     CM|      |WQCljAE|   MD     Mg   RN     cM~  NM   WQ   MQ         *\n *    #M        aQ?         MW     M3   Mg      Q(  HQ   YR  IM|         *\n *   Dq         {Ql         MH    iMX   Mg     MM   QP   QM   Eg         *\n * !EWNaPRag2$  +M\"          $WNaHaN%   MQE$%EXW    QQ   CM    %M%a$D    *\n *                                                                       *\n *               Website: https:\/\/github.com\/zpublic\/zpublic             *\n *                                                                       *\n ************************************************************************\/\n\/**\n * @file\n * @brief 该文件定义命名空间zl::WinUtils下的一个类。\n *\/\n\n#pragma once\n#include \"win_utils_header.h\"\n\nnamespace zl\n{\nnamespace WinUtils\n{\n\t\/**\n\t* @brief ZLShortcut类，包含三个静态成员函数。\n\t* 用于生成给定文件的快捷方式，由给定的快捷方式获取文件路径与文件名\n\t*\/\n    class ZLShortcut\n    {\n\n        enum\n        {\n            WIN_PATH_MAX_UNICODE_PATH           = 32767 + 4,    \/\/\/> max size of buffer to store path, in bytes\n            WIN_PATH_UNICODE_PATH_PREFIX        = 4,            \/\/\/> length of \"\\\\\\\\??\\\\\"\n            WIN_PATH_UNICODE_UNC_PATH_PREFIX    = 7,            \/\/\/> length of \"\\\\\\\\??\\\\UNC\\\\\"\n        };\n\n    public:\n\t\/**\n\t * @brief 对于给定的可执行文件创建快捷方式\n\t * @param[in]   lpLnkFilePath 创建的快捷方式的路径与文件名\n\t * @param[in]   lpDstFilePath 可执行文件路径与文件名\n\t * @param[in]  pszArguments 设置快捷方式的命令行参数\n\t * @param[in]  pszDesc 设置快捷方式的描述信息\n\t * @param[in]  pszIcon 设置快捷方式的图标\n\t * @return 如果成功，返回TRUE，如果失败返回FALSE\n\t * @see _ExpandFullPathName\n\t *\/\n        static BOOL Create(\n            LPCWSTR lpLnkFilePath,\n            LPCWSTR lpDstFilePath,\n            LPCWSTR pszArguments = NULL,\n            LPCWSTR pszDesc = NULL,\n            LPCWSTR pszIcon = NULL)\n        {\n            BOOL bReturn = FALSE;\n            ::CoInitialize(NULL);\n\n            if (!lpDstFilePath || !lpLnkFilePath)\n                goto Exit0;\n\n            {\n                CComPtr<IShellLink> spiShellLink;\n                CString strFullPath = lpDstFilePath;\n                HRESULT hr = _ExpandFullPathName(strFullPath);\n                if (FAILED(hr))\n                    goto Exit0;\n\n                hr = ::CoCreateInstance(\n                    CLSID_ShellLink,\n                    NULL, \n                    CLSCTX_INPROC_SERVER,\n                    IID_IShellLink,\n                    (void**)&spiShellLink);\n                if (FAILED(hr))\n                    goto Exit0;\n\n                CComPtr<IPersistFile> spiPersistFile;\n                hr = spiShellLink.QueryInterface(&spiPersistFile);\n                if (FAILED(hr))\n                    goto Exit0;\n\n                \/\/ Set the path to the shortcut target and add the description\n                hr = spiShellLink->SetPath(strFullPath);\n                if (FAILED(hr))\n                    goto Exit0;\n\n                if (pszArguments)\n                {\n                    hr = spiShellLink->SetArguments(pszArguments);\n                    if (FAILED(hr))\n                        goto Exit0;\n                }\n\n                if (pszDesc)\n                {\n                    hr = spiShellLink->SetDescription(pszDesc);\n                    if (FAILED(hr))\n                        goto Exit0;\n                }\n\n                if (pszIcon)\n                {\n                    hr = spiShellLink->SetIconLocation(pszIcon, 0);\n                    if (FAILED(hr))\n                        goto Exit0;\n                }\n\n                \/\/ Write the shortcut to disk\n                hr = spiPersistFile->Save(lpLnkFilePath, TRUE);\n                if (FAILED(hr))\n                    goto Exit0;\n            }\n\n            bReturn = TRUE;\n\nExit0:\n            ::CoUninitialize();\n            return bReturn;\n        }\n\t\t\n\t\/**\n\t * @brief 给定快捷方式，获取快捷方式对应的路径和文件名\n\t * @param[in]   lpLnkFilePath 以空终止的字符串包含打开文件的绝对路径\n\t * @param[out]  sDstPath 字符串引用，获取快捷方式的路径和文件名\n\t * @return 如果成功，返回TRUE，如果失败返回FALSE\n\t *\/\n        static BOOL GetDstPath(LPCTSTR lpLnkFilePath, CString &sDstPath)\n        {\n            bool bReturn = FALSE;\n\n            ::CoInitialize(NULL);\n\n            CComPtr<IPersistFile> pPersistFile;\n            HRESULT hr = CoCreateInstance(CLSID_ShellLink, NULL, CLSCTX_INPROC_SERVER, IID_IPersistFile, (void**)(&pPersistFile));\n            if(SUCCEEDED(hr))\n            {\n                CComPtr<IShellLink> pShellLink;\n                hr = pPersistFile->QueryInterface(IID_IShellLink, (void**)(&pShellLink));\n                if(SUCCEEDED(hr))\n                {\n                    hr = pPersistFile->Load(lpLnkFilePath, STGM_READ);\n                    if(SUCCEEDED(hr))\n                    {\n                        TCHAR szPath[MAX_PATH + 1] = {0};\n                        hr = pShellLink->GetPath(szPath, MAX_PATH, NULL, 0);\n                        if(SUCCEEDED(hr))\n                        {\n                            sDstPath = szPath;\n                            bReturn = TRUE;\n                        }\n                    }\n                }\n            }\n\n            CoUninitialize();\n            return bReturn;\n        }\n\n    private:\n\t\n\t\/**\n\t * @brief 由指定文件名获取文件的全路径与文件名\n\t * @param[in,out]   strPathName CString引用，传进文件名，返回文件全路径与文件名\n\t * @return 如果成功，返回S_OK，如果失败，以HRESULT的形式返回调用线程的最近错误码或E_FAIL\n\t * @see GetFullPathName\n\t *\/\n        static HRESULT _ExpandFullPathName( CString& strPathName )\n        {\n            DWORD dwLen = ::GetFullPathName(strPathName, 0, NULL, NULL);\n            if (0 == dwLen)\n                return GetLastError() ? AtlHresultFromLastError() : E_FAIL;\n\n            assert(dwLen <= WIN_PATH_MAX_UNICODE_PATH);\n            if (dwLen > WIN_PATH_MAX_UNICODE_PATH)\n                return E_UNEXPECTED;\n\n            CString strFullPathName;\n            dwLen = ::GetFullPathName(strPathName, dwLen, strFullPathName.GetBuffer(dwLen), NULL);\n            if (0 == dwLen)\n            {\n                strFullPathName.ReleaseBuffer(0);\n                return GetLastError() ? AtlHresultFromLastError() : E_FAIL;\n            }\n\n            strFullPathName.ReleaseBuffer();\n            strPathName = strFullPathName;\n            return S_OK;\n        }\n    };\n}\n}\n\n\n<commit_msg>*shortcut注释修改<commit_after>\/*************************************************************************\n *                                                                       *\n *  I|*j^3Cl|a   \"+!*%                  qt          Nd   gW              *\n *  l]{y+l?MM*  !#Wla\\NNP               NW          MM   I|              *\n *        PW    ?E|    tWg              Wg  sC!     AW           ~@v~    *\n *       NC     ?M!    yN|  WW     MK   MW@K1Y%M@   RM   #Q    QP@tim    *\n *     CM|      |WQCljAE|   MD     Mg   RN     cM~  NM   WQ   MQ         *\n *    #M        aQ?         MW     M3   Mg      Q(  HQ   YR  IM|         *\n *   Dq         {Ql         MH    iMX   Mg     MM   QP   QM   Eg         *\n * !EWNaPRag2$  +M\"          $WNaHaN%   MQE$%EXW    QQ   CM    %M%a$D    *\n *                                                                       *\n *               Website: https:\/\/github.com\/zpublic\/zpublic             *\n *                                                                       *\n ************************************************************************\/\n\/**\n * @file\n * @brief 快捷方式处理\n *\/\n\n#pragma once\n#include \"win_utils_header.h\"\n\nnamespace zl\n{\nnamespace WinUtils\n{\n\t\/**\n\t* @brief 快捷方式处理类\n\t* 用于生成给定文件的快捷方式，由给定的快捷方式获取文件路径与文件名\n\t*\/\n    class ZLShortcut\n    {\n\n        enum\n        {\n            WIN_PATH_MAX_UNICODE_PATH           = 32767 + 4,    \/\/\/> max size of buffer to store path, in bytes\n            WIN_PATH_UNICODE_PATH_PREFIX        = 4,            \/\/\/> length of \"\\\\\\\\??\\\\\"\n            WIN_PATH_UNICODE_UNC_PATH_PREFIX    = 7,            \/\/\/> length of \"\\\\\\\\??\\\\UNC\\\\\"\n        };\n\n    public:\n\t\t\/**\n\t\t* @brief 对于给定的可执行文件创建快捷方式\n\t\t* @param[in]   lpLnkFilePath 创建的快捷方式的路径与文件名\n\t\t* @param[in]   lpDstFilePath 可执行文件路径与文件名\n\t\t* @param[in]  pszArguments 设置快捷方式的命令行参数\n\t\t* @param[in]  pszDesc 设置快捷方式的描述信息\n\t\t* @param[in]  pszIcon 设置快捷方式的图标\n\t\t* @return 如果成功，返回TRUE，如果失败返回FALSE\n\t\t* @see _ExpandFullPathName\n\t\t*\/\n        static BOOL Create(\n            LPCWSTR lpLnkFilePath,\n            LPCWSTR lpDstFilePath,\n            LPCWSTR pszArguments = NULL,\n            LPCWSTR pszDesc = NULL,\n            LPCWSTR pszIcon = NULL)\n        {\n            BOOL bReturn = FALSE;\n            ::CoInitialize(NULL);\n\n            if (!lpDstFilePath || !lpLnkFilePath)\n                goto Exit0;\n\n            {\n                CComPtr<IShellLink> spiShellLink;\n                CString strFullPath = lpDstFilePath;\n                HRESULT hr = _ExpandFullPathName(strFullPath);\n                if (FAILED(hr))\n                    goto Exit0;\n\n                hr = ::CoCreateInstance(\n                    CLSID_ShellLink,\n                    NULL, \n                    CLSCTX_INPROC_SERVER,\n                    IID_IShellLink,\n                    (void**)&spiShellLink);\n                if (FAILED(hr))\n                    goto Exit0;\n\n                CComPtr<IPersistFile> spiPersistFile;\n                hr = spiShellLink.QueryInterface(&spiPersistFile);\n                if (FAILED(hr))\n                    goto Exit0;\n\n                \/\/ Set the path to the shortcut target and add the description\n                hr = spiShellLink->SetPath(strFullPath);\n                if (FAILED(hr))\n                    goto Exit0;\n\n                if (pszArguments)\n                {\n                    hr = spiShellLink->SetArguments(pszArguments);\n                    if (FAILED(hr))\n                        goto Exit0;\n                }\n\n                if (pszDesc)\n                {\n                    hr = spiShellLink->SetDescription(pszDesc);\n                    if (FAILED(hr))\n                        goto Exit0;\n                }\n\n                if (pszIcon)\n                {\n                    hr = spiShellLink->SetIconLocation(pszIcon, 0);\n                    if (FAILED(hr))\n                        goto Exit0;\n                }\n\n                \/\/ Write the shortcut to disk\n                hr = spiPersistFile->Save(lpLnkFilePath, TRUE);\n                if (FAILED(hr))\n                    goto Exit0;\n            }\n\n            bReturn = TRUE;\n\nExit0:\n            ::CoUninitialize();\n            return bReturn;\n        }\n\t\t\n\t\t\/**\n\t\t* @brief 给定快捷方式，获取快捷方式对应的路径和文件名\n\t\t* @param[in]   lpLnkFilePath 以空终止的字符串包含打开文件的绝对路径\n\t\t* @param[out]  sDstPath 字符串引用，获取快捷方式的路径和文件名\n\t\t* @return 如果成功，返回TRUE，如果失败返回FALSE\n\t\t*\/\n        static BOOL GetDstPath(LPCTSTR lpLnkFilePath, CString &sDstPath)\n        {\n            bool bReturn = FALSE;\n\n            ::CoInitialize(NULL);\n\n            CComPtr<IPersistFile> pPersistFile;\n            HRESULT hr = CoCreateInstance(CLSID_ShellLink, NULL, CLSCTX_INPROC_SERVER, IID_IPersistFile, (void**)(&pPersistFile));\n            if(SUCCEEDED(hr))\n            {\n                CComPtr<IShellLink> pShellLink;\n                hr = pPersistFile->QueryInterface(IID_IShellLink, (void**)(&pShellLink));\n                if(SUCCEEDED(hr))\n                {\n                    hr = pPersistFile->Load(lpLnkFilePath, STGM_READ);\n                    if(SUCCEEDED(hr))\n                    {\n                        TCHAR szPath[MAX_PATH + 1] = {0};\n                        hr = pShellLink->GetPath(szPath, MAX_PATH, NULL, 0);\n                        if(SUCCEEDED(hr))\n                        {\n                            sDstPath = szPath;\n                            bReturn = TRUE;\n                        }\n                    }\n                }\n            }\n\n            CoUninitialize();\n            return bReturn;\n        }\n\n    private:\n\t\n\t\t\/**\n\t\t* @brief 由指定文件名获取文件的全路径与文件名\n\t\t* @param[in,out]   strPathName CString引用，传进文件名，返回文件全路径与文件名\n\t\t* @return 如果成功，返回S_OK，如果失败，以HRESULT的形式返回调用线程的最近错误码或E_FAIL\n\t\t* @see GetFullPathName\n\t\t*\/\n        static HRESULT _ExpandFullPathName( CString& strPathName )\n        {\n            DWORD dwLen = ::GetFullPathName(strPathName, 0, NULL, NULL);\n            if (0 == dwLen)\n                return GetLastError() ? AtlHresultFromLastError() : E_FAIL;\n\n            assert(dwLen <= WIN_PATH_MAX_UNICODE_PATH);\n            if (dwLen > WIN_PATH_MAX_UNICODE_PATH)\n                return E_UNEXPECTED;\n\n            CString strFullPathName;\n            dwLen = ::GetFullPathName(strPathName, dwLen, strFullPathName.GetBuffer(dwLen), NULL);\n            if (0 == dwLen)\n            {\n                strFullPathName.ReleaseBuffer(0);\n                return GetLastError() ? AtlHresultFromLastError() : E_FAIL;\n            }\n\n            strFullPathName.ReleaseBuffer();\n            strPathName = strFullPathName;\n            return S_OK;\n        }\n    };\n}\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * SaveHandler.hpp\n *\n *  Created on: 29.05.2017\n *      Author: Alexander\n *\/\n\n#ifndef PERSISTENCE_BASE_SAVEHANDLER_HPP\n#define PERSISTENCE_BASE_SAVEHANDLER_HPP\n\n#include \"persistence\/interface\/XSaveHandler.hpp\"\n\n#include <string>\n#include \"abstractDataTypes\/Bag.hpp\"\n\nnamespace ecore\n{\n\tclass EObject;\n}\n\nnamespace persistence\n{\n\tnamespace base\n\t{\n\t\tclass SaveHandler: public persistence::interface::XSaveHandler\n\t\t{\n\t\t\tpublic:\n\t\t\t\tSaveHandler();\n\t\t\t\tvirtual ~SaveHandler();\n\n\t\t\t\tstd::string getPrefix();\n\t\t\t\tvoid setRootObject(std::shared_ptr<ecore::EObject> object);\n\n\t\t\t\tstd::string extractType(std::shared_ptr<ecore::EObject> obj) const;\n\n\t\t\t\tvirtual bool createRootNode(const std::string& name, const std::string& ns_uri) = 0;\n\t\t\t\tvirtual bool createRootNode(const std::string& prefix, const std::string& name, const std::string& ns_uri) = 0;\n\n\t\t\t\tvirtual bool createAndAddElement(const std::string& name) = 0;\n\n\t\t\t\tvoid addAttribute(const std::string &name, bool value);\n\t\t\t\tvirtual void addAttribute(const std::string &name, const std::string& value) = 0;\n\n\t\t\t\tvoid addReference(const std::string &name, std::shared_ptr<ecore::EObject> object);\n\t\t\t\tvirtual void addReferences(const std::string &name, std::shared_ptr<ecore::EObject> object) = 0;\n\t\t\t\tvirtual void addReference(const std::shared_ptr<ecore::EObject> object, const std::string &tagName, const bool typeRequired);\n\t\t\t\tvirtual void release() = 0;\n\t\t\t\tvirtual void setThisPtr(std::shared_ptr<SaveHandler> thisPtr);\n\t\t\t\tvirtual void setIsXSIMode(bool value);\n\t\t\t\tvirtual void setTypesMap(std::map<std::string, std::shared_ptr<ecore::EObject>> typesMap);\n\t\t\t\tvirtual void addTypeReference(const std::string& href, const std::string& xmitype) = 0;\n\n\t\t\tprotected:\n\t\t\t\tstd::shared_ptr<ecore::EObject> m_rootObject;\n\t\t\t\tstd::string m_rootPrefix;\n\n\t\t\tprivate:\n\t\t\t\tstd::shared_ptr<SaveHandler> m_thisPtr;\n\t\t\t\tbool m_isXSIMode;\n\t\t\t\tstd::shared_ptr<Bag<ecore::EObject>> m_savedObjects;\n\t\t\t\tstd::map<std::shared_ptr<ecore::EObject>, std::string> m_refToObject_map;\n\t\t};\n\t} \/* namespace base *\/\n} \/* namespace persistence *\/\n\n#endif \/* SaveHandler_HPP_ *\/\n<commit_msg>[persistence] map for references should be protected<commit_after>\/*\n * SaveHandler.hpp\n *\n *  Created on: 29.05.2017\n *      Author: Alexander\n *\/\n\n#ifndef PERSISTENCE_BASE_SAVEHANDLER_HPP\n#define PERSISTENCE_BASE_SAVEHANDLER_HPP\n\n#include \"persistence\/interface\/XSaveHandler.hpp\"\n\n#include <string>\n#include \"abstractDataTypes\/Bag.hpp\"\n\nnamespace ecore\n{\n\tclass EObject;\n}\n\nnamespace persistence\n{\n\tnamespace base\n\t{\n\t\tclass SaveHandler: public persistence::interface::XSaveHandler\n\t\t{\n\t\t\tpublic:\n\t\t\t\tSaveHandler();\n\t\t\t\tvirtual ~SaveHandler();\n\n\t\t\t\tstd::string getPrefix();\n\t\t\t\tvoid setRootObject(std::shared_ptr<ecore::EObject> object);\n\n\t\t\t\tstd::string extractType(std::shared_ptr<ecore::EObject> obj) const;\n\n\t\t\t\tvirtual bool createRootNode(const std::string& name, const std::string& ns_uri) = 0;\n\t\t\t\tvirtual bool createRootNode(const std::string& prefix, const std::string& name, const std::string& ns_uri) = 0;\n\n\t\t\t\tvirtual bool createAndAddElement(const std::string& name) = 0;\n\n\t\t\t\tvoid addAttribute(const std::string &name, bool value);\n\t\t\t\tvirtual void addAttribute(const std::string &name, const std::string& value) = 0;\n\n\t\t\t\tvoid addReference(const std::string &name, std::shared_ptr<ecore::EObject> object);\n\t\t\t\tvirtual void addReferences(const std::string &name, std::shared_ptr<ecore::EObject> object) = 0;\n\t\t\t\tvirtual void addReference(const std::shared_ptr<ecore::EObject> object, const std::string &tagName, const bool typeRequired);\n\t\t\t\tvirtual void release() = 0;\n\t\t\t\tvirtual void setThisPtr(std::shared_ptr<SaveHandler> thisPtr);\n\t\t\t\tvirtual void setIsXSIMode(bool value);\n\t\t\t\tvirtual void setTypesMap(std::map<std::string, std::shared_ptr<ecore::EObject>> typesMap);\n\t\t\t\tvirtual void addTypeReference(const std::string& href, const std::string& xmitype) = 0;\n\n\t\t\tprotected:\n\t\t\t\tstd::shared_ptr<ecore::EObject> m_rootObject;\n\t\t\t\tstd::string m_rootPrefix;\n\t\t\t\tstd::map<std::shared_ptr<ecore::EObject>, std::string> m_refToObject_map;\n\n\t\t\tprivate:\n\t\t\t\tstd::shared_ptr<SaveHandler> m_thisPtr;\n\t\t\t\tbool m_isXSIMode;\n\t\t\t\tstd::shared_ptr<Bag<ecore::EObject>> m_savedObjects;\n\t\t};\n\t} \/* namespace base *\/\n} \/* namespace persistence *\/\n\n#endif \/* SaveHandler_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/sysctl.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <iostream>\n#include <fstream>\n#include <map>\n\n#include <CoreFoundation\/CoreFoundation.h>\n\nnamespace {\n  CFStringRef applicationID = CFSTR(\"org.pqrs.KeyRemap4MacBook\");\n\n  \/\/ ============================================================\n  \/\/ SAVE & LOAD\n  CFMutableDictionaryRef dict_sysctl = NULL;\n  std::map<std::string, int> map_reset;\n\n  void\n  save(const char *name)\n  {\n    if (! dict_sysctl) return;\n\n    char entry[512];\n    snprintf(entry, sizeof(entry), \"keyremap4macbook.%s\", name);\n\n    int value;\n    size_t len = sizeof(value);\n    if (sysctlbyname(entry, &value, &len, NULL, 0) == -1) return;\n\n    CFStringRef key = CFStringCreateWithCString(NULL, name, kCFStringEncodingUTF8);\n    CFNumberRef val = CFNumberCreate(NULL, kCFNumberIntType, &value);\n\n    typeof(map_reset.end()) it = map_reset.find(name);\n    if (it == map_reset.end()) return;\n    CFNumberRef defaultval = CFNumberCreate(NULL, kCFNumberIntType, &(it->second));\n\n    if (CFNumberCompare(val, defaultval, NULL) != 0) {\n      CFDictionarySetValue(dict_sysctl, key, val);\n    }\n  }\n\n  void\n  load(const char *name)\n  {\n    if (! dict_sysctl) return;\n    CFStringRef key = CFStringCreateWithCString(NULL, name, kCFStringEncodingUTF8);\n\n    CFNumberRef val = reinterpret_cast<CFNumberRef>(CFDictionaryGetValue(dict_sysctl, key));\n    if (! val) return;\n\n    int value;\n    if (! CFNumberGetValue(val, kCFNumberIntType, &value)) return;\n\n    char cmd[512];\n    snprintf(cmd, sizeof(cmd), \"\/Library\/org.pqrs\/KeyRemap4MacBook\/bin\/KeyRemap4MacBook_sysctl_set %s %d\", name, value);\n    system(cmd);\n  }\n\n  void\n  scanLines(const char *filename, void (*func)(const char *))\n  {\n    std::ifstream ifs(filename);\n    if (! ifs) return;\n\n    while (! ifs.eof()) {\n      char line[512];\n\n      ifs.getline(line, sizeof(line));\n\n      const char *sysctl_begin = \"<sysctl>\";\n      const char *sysctl_end = \"<\/sysctl>\";\n\n      char *begin = strstr(line, \"<sysctl>\");\n      if (! begin) continue;\n      char *end = strstr(line, sysctl_end);\n      if (! end) continue;\n\n      begin += strlen(sysctl_begin);\n      *end = '\\0';\n\n      func(begin);\n    }\n  }\n\n  bool\n  makeMapReset(void)\n  {\n    std::ifstream ifs(\"\/Library\/org.pqrs\/KeyRemap4MacBook\/share\/reset\");\n    if (! ifs) return false;\n\n    while (! ifs.eof()) {\n      char line[512];\n\n      ifs.getline(line, sizeof(line));\n\n      char *p = strchr(line, ' ');\n      if (! p) continue;\n      *p = '\\0';\n\n      int value = atoi(p + 1);\n\n      map_reset[line] = value;\n    }\n\n    return true;\n  }\n\n  bool\n  saveToFile(const char **targetFiles, CFStringRef identify)\n  {\n    if (! makeMapReset()) return false;\n\n    dict_sysctl = CFDictionaryCreateMutable(NULL, 0, NULL, NULL);\n    if (! dict_sysctl) return false;\n\n    for (int i = 0; ; ++i) {\n      const char *filename = targetFiles[i];\n      if (! filename) break;\n      scanLines(filename, save);\n    }\n    CFPreferencesSetAppValue(identify, dict_sysctl, applicationID);\n\n    CFRelease(dict_sysctl); dict_sysctl = NULL;\n    return true;\n  }\n\n  bool\n  loadFromFile(const char **targetFiles, CFStringRef identify)\n  {\n    dict_sysctl = reinterpret_cast<CFMutableDictionaryRef>(const_cast<void *>(CFPreferencesCopyAppValue(identify, applicationID)));\n    if (! dict_sysctl) return false;\n\n    for (int i = 0; ; ++i) {\n      const char *filename = targetFiles[i];\n      if (! filename) break;\n      scanLines(filename, load);\n    }\n\n    CFRelease(dict_sysctl); dict_sysctl = NULL;\n    return true;\n  }\n\n  \/\/ ============================================================\n  \/\/ ADD & DELETE & SELECT\n  void\n  setConfigList(CFArrayRef list)\n  {\n    CFPreferencesSetAppValue(CFSTR(\"configList\"), list, applicationID);\n  }\n\n  CFArrayRef\n  getConfigList(void)\n  {\n    CFArrayRef list = reinterpret_cast<CFArrayRef>(CFPreferencesCopyAppValue(CFSTR(\"configList\"), applicationID));\n\n    if (! list || CFArrayGetCount(list) == 0) {\n      if (list) CFRelease(list);\n\n      CFMutableDictionaryRef dict[1];\n      dict[0] = CFDictionaryCreateMutable(NULL, 0, NULL, NULL);\n      CFDictionarySetValue(dict[0], CFSTR(\"name\"), CFSTR(\"Default\"));\n      CFDictionarySetValue(dict[0], CFSTR(\"identify\"), CFSTR(\"config_default\"));\n\n      list = CFArrayCreate(NULL, const_cast<const void **>(reinterpret_cast<void **>(dict)), 1, NULL);\n      setConfigList(list);\n    }\n\n    return list;\n  }\n\n  CFDictionaryRef\n  getConfigDictionary(CFIndex index)\n  {\n    CFArrayRef list = getConfigList();\n    if (! list) return NULL;\n\n    if (index < 0) return NULL;\n    if (index >= CFArrayGetCount(list)) return NULL;\n\n    return reinterpret_cast<CFDictionaryRef>(CFArrayGetValueAtIndex(list, index));\n  }\n\n  CFStringRef\n  getIdentify(CFIndex index)\n  {\n    CFDictionaryRef dict = getConfigDictionary(index);\n    if (! dict) return NULL;\n\n    return reinterpret_cast<CFStringRef>(CFDictionaryGetValue(dict, CFSTR(\"identify\")));\n  }\n\n  CFStringRef\n  getConfigName(int index)\n  {\n    CFDictionaryRef dict = getConfigDictionary(index);\n    if (! dict) return NULL;\n\n    return reinterpret_cast<CFStringRef>(CFDictionaryGetValue(dict, CFSTR(\"name\")));\n  }\n\n  bool\n  appendConfig(void)\n  {\n    CFArrayRef list = getConfigList();\n    if (! list) return false;\n\n    struct timeval tm;\n    gettimeofday(&tm, NULL);\n    CFStringRef identify = CFStringCreateWithFormat(NULL, NULL, CFSTR(\"config_%d_%d\"), tm.tv_sec, tm.tv_usec);\n\n    CFMutableDictionaryRef dict;\n    dict = CFDictionaryCreateMutable(NULL, 0, NULL, NULL);\n    CFDictionarySetValue(dict, CFSTR(\"name\"), CFSTR(\"NewItem\"));\n    CFDictionarySetValue(dict, CFSTR(\"identify\"), identify);\n\n    CFMutableArrayRef newlist = CFArrayCreateMutableCopy(NULL, 0, list);\n    CFArrayAppendValue(newlist, dict);\n\n    setConfigList(newlist);\n    return true;\n  }\n\n  bool\n  removeConfig(int index)\n  {\n    CFStringRef identify = getIdentify(index);\n    if (! identify) return false;\n\n    CFPreferencesSetAppValue(identify, NULL, applicationID);\n\n    CFArrayRef list = getConfigList();\n    if (! list) return false;\n\n    CFMutableArrayRef newlist = CFArrayCreateMutableCopy(NULL, 0, list);\n    CFArrayRemoveValueAtIndex(newlist, index);\n\n    setConfigList(newlist);\n    return true;\n  }\n\n  bool\n  renameConfig(int index, const char *newname)\n  {\n    CFArrayRef list = getConfigList();\n    if (! list) return false;\n\n    CFDictionaryRef olddict = getConfigDictionary(index);\n    if (! olddict) return false;\n\n    CFMutableDictionaryRef newdict = CFDictionaryCreateMutableCopy(NULL, 0, olddict);\n    CFDictionarySetValue(newdict, CFSTR(\"name\"), CFStringCreateWithCString(NULL, newname, kCFStringEncodingUTF8));\n\n    CFMutableArrayRef newlist = CFArrayCreateMutableCopy(NULL, 0, list);\n    CFArraySetValueAtIndex(newlist, index, newdict);\n\n    setConfigList(newlist);\n    return true;\n  }\n\n  CFIndex\n  getConfigCount(void)\n  {\n    CFArrayRef list = getConfigList();\n    if (! list) return 0;\n\n    return CFArrayGetCount(list);\n  }\n\n  \/\/ ----------------------------------------\n  bool\n  setSelectedIndex(CFIndex index)\n  {\n    CFDictionaryRef dict = getConfigDictionary(index);\n    if (! dict) return false;\n\n    CFNumberRef val = CFNumberCreate(NULL, kCFNumberIntType, &index);\n    CFPreferencesSetAppValue(CFSTR(\"selectedIndex\"), val, applicationID);\n\n    return true;\n  }\n\n  CFIndex\n  getSelectedIndex(void)\n  {\n    Boolean isOK;\n    CFIndex value = CFPreferencesGetAppIntegerValue(CFSTR(\"selectedIndex\"), applicationID, &isOK);\n    if (! isOK || value < 0) {\n      value = 0;\n      setSelectedIndex(value);\n    }\n    return value;\n  }\n\n  \/\/ ----------------------------------------\n  bool\n  setStatusbarEnable(CFIndex enable)\n  {\n    CFNumberRef val = CFNumberCreate(NULL, kCFNumberIntType, &enable);\n    CFPreferencesSetAppValue(CFSTR(\"isStatusbarEnable\"), val, applicationID);\n    return true;\n  }\n\n  CFIndex\n  isStatusbarEnable(void)\n  {\n    Boolean isOK;\n    CFIndex value = CFPreferencesGetAppIntegerValue(CFSTR(\"isStatusbarEnable\"), applicationID, &isOK);\n    if (! isOK) {\n      value = 1;\n      setStatusbarEnable(value);\n    }\n    return value;\n  }\n\n  void\n  stripString(char *buf, size_t buflen)\n  {\n    char *p = buf;\n    for (;;) {\n      if (! isspace(*p)) break;\n      ++p;\n    }\n    char *q = p;\n    for (;;) {\n      if (*q == '\\0' || *q == '\\r' || *q == '\\n') break;\n      ++q;\n    }\n    *q = '\\0';\n    snprintf(buf, buflen, \"%s\", p);\n  }\n}\n\n\nint\nmain(int argc, char **argv)\n{\n  if (argc == 1) {\n    fprintf(stderr, \"Usage: %s (save|load|add|delete|rename|getname|select|count|current|statusbar|toggle_statusbar) [params]\\n\", argv[0]);\n    return 1;\n  }\n\n  bool isSuccess = false;\n\n  if (strcmp(argv[1], \"select\") == 0) {\n    if (argc < 3) {\n      fprintf(stderr, \"Usage: %s select index\\n\", argv[0]);\n      goto finish;\n    }\n    int index = atoi(argv[2]);\n    isSuccess = setSelectedIndex(index);\n\n  } else if (strcmp(argv[1], \"add\") == 0) {\n    isSuccess = appendConfig();\n\n  } else if (strcmp(argv[1], \"delete\") == 0) {\n    if (argc < 3) {\n      fprintf(stderr, \"Usage: %s delete index\\n\", argv[0]);\n      goto finish;\n    }\n    int index = atoi(argv[2]);\n    isSuccess = removeConfig(index);\n\n  } else if (strcmp(argv[1], \"rename\") == 0) {\n    \/\/ sysctl_ctl rename \"index\" \"newname\"\n    if (argc < 4) {\n      fprintf(stderr, \"Usage: %s rename index newname\\n\", argv[0]);\n      goto finish;\n    }\n    int index = atoi(argv[2]);\n    char buf[512];\n    snprintf(buf, sizeof(buf), \"%s\", argv[3]);\n    stripString(buf, sizeof(buf));\n    if (buf[0] == '\\0') {\n      snprintf(buf, sizeof(buf), \"(null)\");\n    }\n    isSuccess = renameConfig(index, buf);\n\n  } else if (strcmp(argv[1], \"count\") == 0) {\n    printf(\"%ld\\n\", getConfigCount());\n    return 0;\n\n  } else if (strcmp(argv[1], \"current\") == 0) {\n    printf(\"%ld\\n\", getSelectedIndex());\n    return 0;\n\n  } else if (strcmp(argv[1], \"statusbar\") == 0) {\n    printf(\"%ld\\n\", isStatusbarEnable());\n    return 0;\n\n  } else if (strcmp(argv[1], \"toggle_statusbar\") == 0) {\n    CFIndex value = isStatusbarEnable();\n    isSuccess = setStatusbarEnable(! value);\n\n  } else if (strcmp(argv[1], \"getname\") == 0) {\n    if (argc < 3) {\n      fprintf(stderr, \"Usage: %s getname index\\n\", argv[0]);\n      goto finish;\n    }\n    int index = atoi(argv[2]);\n    CFStringRef name = getConfigName(index);\n    if (name) {\n      char buf[512];\n      if (CFStringGetCString(name, buf, sizeof(buf), kCFStringEncodingUTF8)) {\n        stripString(buf, sizeof(buf));\n        printf(\"%s\\n\", buf);\n      } else {\n        printf(\"(null)\\n\", buf);\n      }\n    }\n    return 0;\n\n  } else if ((strcmp(argv[1], \"save\") == 0) || (strcmp(argv[1], \"load\") == 0)) {\n    CFIndex value = getSelectedIndex();\n    CFStringRef identify = getIdentify(value);\n\n    const char *targetFiles[] = {\n      \"\/Library\/org.pqrs\/KeyRemap4MacBook\/prefpane\/checkbox.xml\",\n      \"\/Library\/org.pqrs\/KeyRemap4MacBook\/prefpane\/number.xml\",\n      NULL,\n    };\n    if (strcmp(argv[1], \"save\") == 0) {\n      isSuccess = saveToFile(targetFiles, identify);\n    }\n    if (strcmp(argv[1], \"load\") == 0) {\n      system(\"\/Library\/org.pqrs\/KeyRemap4MacBook\/bin\/KeyRemap4MacBook_sysctl_reset\");\n      isSuccess = loadFromFile(targetFiles, identify);\n    }\n  }\n\n  CFPreferencesAppSynchronize(applicationID);\n\nfinish:\n  if (isSuccess) {\n    fprintf(stderr, \"[DONE]\\n\");\n  } else {\n    fprintf(stderr, \"[ERROR]\\n\");\n  }\n\n  return 0;\n}\n<commit_msg>apply uncrustify<commit_after>#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/sysctl.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <iostream>\n#include <fstream>\n#include <map>\n\n#include <CoreFoundation\/CoreFoundation.h>\n\nnamespace {\n  CFStringRef applicationID = CFSTR(\"org.pqrs.KeyRemap4MacBook\");\n\n  \/\/ ============================================================\n  \/\/ SAVE & LOAD\n  CFMutableDictionaryRef dict_sysctl = NULL;\n  std::map<std::string, int> map_reset;\n\n  void\n  save(const char* name)\n  {\n    if (! dict_sysctl) return;\n\n    char entry[512];\n    snprintf(entry, sizeof(entry), \"keyremap4macbook.%s\", name);\n\n    int value;\n    size_t len = sizeof(value);\n    if (sysctlbyname(entry, &value, &len, NULL, 0) == -1) return;\n\n    CFStringRef key = CFStringCreateWithCString(NULL, name, kCFStringEncodingUTF8);\n    CFNumberRef val = CFNumberCreate(NULL, kCFNumberIntType, &value);\n\n    std::map<std::string, int>::iterator it = map_reset.find(name);\n    if (it == map_reset.end()) return;\n    CFNumberRef defaultval = CFNumberCreate(NULL, kCFNumberIntType, &(it->second));\n\n    if (CFNumberCompare(val, defaultval, NULL) != 0) {\n      CFDictionarySetValue(dict_sysctl, key, val);\n    }\n  }\n\n  void\n  load(const char* name)\n  {\n    if (! dict_sysctl) return;\n    CFStringRef key = CFStringCreateWithCString(NULL, name, kCFStringEncodingUTF8);\n\n    CFNumberRef val = reinterpret_cast<CFNumberRef>(CFDictionaryGetValue(dict_sysctl, key));\n    if (! val) return;\n\n    int value;\n    if (! CFNumberGetValue(val, kCFNumberIntType, &value)) return;\n\n    char cmd[512];\n    snprintf(cmd, sizeof(cmd), \"\/Library\/org.pqrs\/KeyRemap4MacBook\/bin\/KeyRemap4MacBook_sysctl_set %s %d\", name, value);\n    system(cmd);\n  }\n\n  void\n  scanLines(const char* filename, void (* func)(const char*))\n  {\n    std::ifstream ifs(filename);\n    if (! ifs) return;\n\n    while (! ifs.eof()) {\n      char line[512];\n\n      ifs.getline(line, sizeof(line));\n\n      const char* sysctl_begin = \"<sysctl>\";\n      const char* sysctl_end = \"<\/sysctl>\";\n\n      char* begin = strstr(line, \"<sysctl>\");\n      if (! begin) continue;\n      char* end = strstr(line, sysctl_end);\n      if (! end) continue;\n\n      begin += strlen(sysctl_begin);\n      *end = '\\0';\n\n      func(begin);\n    }\n  }\n\n  bool\n  makeMapReset(void)\n  {\n    std::ifstream ifs(\"\/Library\/org.pqrs\/KeyRemap4MacBook\/share\/reset\");\n    if (! ifs) return false;\n\n    while (! ifs.eof()) {\n      char line[512];\n\n      ifs.getline(line, sizeof(line));\n\n      char* p = strchr(line, ' ');\n      if (! p) continue;\n      *p = '\\0';\n\n      int value = atoi(p + 1);\n\n      map_reset[line] = value;\n    }\n\n    return true;\n  }\n\n  bool\n  saveToFile(const char** targetFiles, CFStringRef identify)\n  {\n    if (! makeMapReset()) return false;\n\n    dict_sysctl = CFDictionaryCreateMutable(NULL, 0, NULL, NULL);\n    if (! dict_sysctl) return false;\n\n    for (int i = 0;; ++i) {\n      const char* filename = targetFiles[i];\n      if (! filename) break;\n      scanLines(filename, save);\n    }\n    CFPreferencesSetAppValue(identify, dict_sysctl, applicationID);\n\n    CFRelease(dict_sysctl); dict_sysctl = NULL;\n    return true;\n  }\n\n  bool\n  loadFromFile(const char** targetFiles, CFStringRef identify)\n  {\n    dict_sysctl = reinterpret_cast<CFMutableDictionaryRef>(const_cast<void*>(CFPreferencesCopyAppValue(identify, applicationID)));\n    if (! dict_sysctl) return false;\n\n    for (int i = 0;; ++i) {\n      const char* filename = targetFiles[i];\n      if (! filename) break;\n      scanLines(filename, load);\n    }\n\n    CFRelease(dict_sysctl); dict_sysctl = NULL;\n    return true;\n  }\n\n  \/\/ ============================================================\n  \/\/ ADD & DELETE & SELECT\n  void\n  setConfigList(CFArrayRef list)\n  {\n    CFPreferencesSetAppValue(CFSTR(\"configList\"), list, applicationID);\n  }\n\n  CFArrayRef\n  getConfigList(void)\n  {\n    CFArrayRef list = reinterpret_cast<CFArrayRef>(CFPreferencesCopyAppValue(CFSTR(\"configList\"), applicationID));\n\n    if (! list || CFArrayGetCount(list) == 0) {\n      if (list) CFRelease(list);\n\n      CFMutableDictionaryRef dict[1];\n      dict[0] = CFDictionaryCreateMutable(NULL, 0, NULL, NULL);\n      CFDictionarySetValue(dict[0], CFSTR(\"name\"), CFSTR(\"Default\"));\n      CFDictionarySetValue(dict[0], CFSTR(\"identify\"), CFSTR(\"config_default\"));\n\n      list = CFArrayCreate(NULL, const_cast<const void**>(reinterpret_cast<void**>(dict)), 1, NULL);\n      setConfigList(list);\n    }\n\n    return list;\n  }\n\n  CFDictionaryRef\n  getConfigDictionary(CFIndex index)\n  {\n    CFArrayRef list = getConfigList();\n    if (! list) return NULL;\n\n    if (index < 0) return NULL;\n    if (index >= CFArrayGetCount(list)) return NULL;\n\n    return reinterpret_cast<CFDictionaryRef>(CFArrayGetValueAtIndex(list, index));\n  }\n\n  CFStringRef\n  getIdentify(CFIndex index)\n  {\n    CFDictionaryRef dict = getConfigDictionary(index);\n    if (! dict) return NULL;\n\n    return reinterpret_cast<CFStringRef>(CFDictionaryGetValue(dict, CFSTR(\"identify\")));\n  }\n\n  CFStringRef\n  getConfigName(int index)\n  {\n    CFDictionaryRef dict = getConfigDictionary(index);\n    if (! dict) return NULL;\n\n    return reinterpret_cast<CFStringRef>(CFDictionaryGetValue(dict, CFSTR(\"name\")));\n  }\n\n  bool\n  appendConfig(void)\n  {\n    CFArrayRef list = getConfigList();\n    if (! list) return false;\n\n    struct timeval tm;\n    gettimeofday(&tm, NULL);\n    CFStringRef identify = CFStringCreateWithFormat(NULL, NULL, CFSTR(\"config_%d_%d\"), tm.tv_sec, tm.tv_usec);\n\n    CFMutableDictionaryRef dict;\n    dict = CFDictionaryCreateMutable(NULL, 0, NULL, NULL);\n    CFDictionarySetValue(dict, CFSTR(\"name\"), CFSTR(\"NewItem\"));\n    CFDictionarySetValue(dict, CFSTR(\"identify\"), identify);\n\n    CFMutableArrayRef newlist = CFArrayCreateMutableCopy(NULL, 0, list);\n    CFArrayAppendValue(newlist, dict);\n\n    setConfigList(newlist);\n    return true;\n  }\n\n  bool\n  removeConfig(int index)\n  {\n    CFStringRef identify = getIdentify(index);\n    if (! identify) return false;\n\n    CFPreferencesSetAppValue(identify, NULL, applicationID);\n\n    CFArrayRef list = getConfigList();\n    if (! list) return false;\n\n    CFMutableArrayRef newlist = CFArrayCreateMutableCopy(NULL, 0, list);\n    CFArrayRemoveValueAtIndex(newlist, index);\n\n    setConfigList(newlist);\n    return true;\n  }\n\n  bool\n  renameConfig(int index, const char* newname)\n  {\n    CFArrayRef list = getConfigList();\n    if (! list) return false;\n\n    CFDictionaryRef olddict = getConfigDictionary(index);\n    if (! olddict) return false;\n\n    CFMutableDictionaryRef newdict = CFDictionaryCreateMutableCopy(NULL, 0, olddict);\n    CFDictionarySetValue(newdict, CFSTR(\"name\"), CFStringCreateWithCString(NULL, newname, kCFStringEncodingUTF8));\n\n    CFMutableArrayRef newlist = CFArrayCreateMutableCopy(NULL, 0, list);\n    CFArraySetValueAtIndex(newlist, index, newdict);\n\n    setConfigList(newlist);\n    return true;\n  }\n\n  CFIndex\n  getConfigCount(void)\n  {\n    CFArrayRef list = getConfigList();\n    if (! list) return 0;\n\n    return CFArrayGetCount(list);\n  }\n\n  \/\/ ----------------------------------------\n  bool\n  setSelectedIndex(CFIndex index)\n  {\n    CFDictionaryRef dict = getConfigDictionary(index);\n    if (! dict) return false;\n\n    CFNumberRef val = CFNumberCreate(NULL, kCFNumberIntType, &index);\n    CFPreferencesSetAppValue(CFSTR(\"selectedIndex\"), val, applicationID);\n\n    return true;\n  }\n\n  CFIndex\n  getSelectedIndex(void)\n  {\n    Boolean isOK;\n    CFIndex value = CFPreferencesGetAppIntegerValue(CFSTR(\"selectedIndex\"), applicationID, &isOK);\n    if (! isOK || value < 0) {\n      value = 0;\n      setSelectedIndex(value);\n    }\n    return value;\n  }\n\n  \/\/ ----------------------------------------\n  bool\n  setStatusbarEnable(CFIndex enable)\n  {\n    CFNumberRef val = CFNumberCreate(NULL, kCFNumberIntType, &enable);\n    CFPreferencesSetAppValue(CFSTR(\"isStatusbarEnable\"), val, applicationID);\n    return true;\n  }\n\n  CFIndex\n  isStatusbarEnable(void)\n  {\n    Boolean isOK;\n    CFIndex value = CFPreferencesGetAppIntegerValue(CFSTR(\"isStatusbarEnable\"), applicationID, &isOK);\n    if (! isOK) {\n      value = 1;\n      setStatusbarEnable(value);\n    }\n    return value;\n  }\n\n  void\n  stripString(char* buf, size_t buflen)\n  {\n    char* p = buf;\n    for (;;) {\n      if (! isspace(*p)) break;\n      ++p;\n    }\n    char* q = p;\n    for (;;) {\n      if (*q == '\\0' || *q == '\\r' || *q == '\\n') break;\n      ++q;\n    }\n    *q = '\\0';\n    snprintf(buf, buflen, \"%s\", p);\n  }\n}\n\n\nint\nmain(int argc, char** argv)\n{\n  if (argc == 1) {\n    fprintf(stderr, \"Usage: %s (save|load|add|delete|rename|getname|select|count|current|statusbar|toggle_statusbar) [params]\\n\", argv[0]);\n    return 1;\n  }\n\n  bool isSuccess = false;\n\n  if (strcmp(argv[1], \"select\") == 0) {\n    if (argc < 3) {\n      fprintf(stderr, \"Usage: %s select index\\n\", argv[0]);\n      goto finish;\n    }\n    int index = atoi(argv[2]);\n    isSuccess = setSelectedIndex(index);\n\n  } else if (strcmp(argv[1], \"add\") == 0) {\n    isSuccess = appendConfig();\n\n  } else if (strcmp(argv[1], \"delete\") == 0) {\n    if (argc < 3) {\n      fprintf(stderr, \"Usage: %s delete index\\n\", argv[0]);\n      goto finish;\n    }\n    int index = atoi(argv[2]);\n    isSuccess = removeConfig(index);\n\n  } else if (strcmp(argv[1], \"rename\") == 0) {\n    \/\/ sysctl_ctl rename \"index\" \"newname\"\n    if (argc < 4) {\n      fprintf(stderr, \"Usage: %s rename index newname\\n\", argv[0]);\n      goto finish;\n    }\n    int index = atoi(argv[2]);\n    char buf[512];\n    snprintf(buf, sizeof(buf), \"%s\", argv[3]);\n    stripString(buf, sizeof(buf));\n    if (buf[0] == '\\0') {\n      snprintf(buf, sizeof(buf), \"(null)\");\n    }\n    isSuccess = renameConfig(index, buf);\n\n  } else if (strcmp(argv[1], \"count\") == 0) {\n    printf(\"%ld\\n\", getConfigCount());\n    return 0;\n\n  } else if (strcmp(argv[1], \"current\") == 0) {\n    printf(\"%ld\\n\", getSelectedIndex());\n    return 0;\n\n  } else if (strcmp(argv[1], \"statusbar\") == 0) {\n    printf(\"%ld\\n\", isStatusbarEnable());\n    return 0;\n\n  } else if (strcmp(argv[1], \"toggle_statusbar\") == 0) {\n    CFIndex value = isStatusbarEnable();\n    isSuccess = setStatusbarEnable(! value);\n\n  } else if (strcmp(argv[1], \"getname\") == 0) {\n    if (argc < 3) {\n      fprintf(stderr, \"Usage: %s getname index\\n\", argv[0]);\n      goto finish;\n    }\n    int index = atoi(argv[2]);\n    CFStringRef name = getConfigName(index);\n    if (name) {\n      char buf[512];\n      if (CFStringGetCString(name, buf, sizeof(buf), kCFStringEncodingUTF8)) {\n        stripString(buf, sizeof(buf));\n        printf(\"%s\\n\", buf);\n      } else {\n        printf(\"(null)\\n\", buf);\n      }\n    }\n    return 0;\n\n  } else if ((strcmp(argv[1], \"save\") == 0) || (strcmp(argv[1], \"load\") == 0)) {\n    CFIndex value = getSelectedIndex();\n    CFStringRef identify = getIdentify(value);\n\n    const char* targetFiles[] = {\n      \"\/Library\/org.pqrs\/KeyRemap4MacBook\/prefpane\/checkbox.xml\",\n      \"\/Library\/org.pqrs\/KeyRemap4MacBook\/prefpane\/number.xml\",\n      NULL,\n    };\n    if (strcmp(argv[1], \"save\") == 0) {\n      isSuccess = saveToFile(targetFiles, identify);\n    }\n    if (strcmp(argv[1], \"load\") == 0) {\n      system(\"\/Library\/org.pqrs\/KeyRemap4MacBook\/bin\/KeyRemap4MacBook_sysctl_reset\");\n      isSuccess = loadFromFile(targetFiles, identify);\n    }\n  }\n\n  CFPreferencesAppSynchronize(applicationID);\n\nfinish:\n  if (isSuccess) {\n    fprintf(stderr, \"[DONE]\\n\");\n  } else {\n    fprintf(stderr, \"[ERROR]\\n\");\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>App: fix Python object leak in ObjectIdentifier<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright (C) 2009, Joacim Jacobsson ( j dot jacobsson at gmail dot com )\n * All rights reserved.\n *\n * See LICENSE file for details\n *\n *\/\n\n#include \"BehaviorTreeNode.h\"\n#include \"..\/NodeToNodeArrow.h\"\n#include <btree\/btree.h>\n\n#include <QtGui\/QtGui>\n#include <QtSvg\/QSvgRenderer>\n\nconst char* const g_NodeResourcePaths[_E_MAX_GRIST_TYPES_] = {\n\t\":\/nodes\/unknown.svg\",\n\t\":\/nodes\/sequence.svg\",\n\t\":\/nodes\/selector.svg\",\n\t\":\/nodes\/parallel.svg\",\n\t\":\/nodes\/dyn_selector.svg\",\n\t\":\/nodes\/decorator.svg\",\n\t\":\/nodes\/action.svg\"\n};\n\nBehaviorTreeNode::BehaviorTreeNode( Node* n, BehaviorTreeNode* parent )\n\t: QGraphicsSvgItem( g_NodeResourcePaths[n->m_Grist.m_Type] )\n\t, m_Node( n )\n\t, m_MouseState( E_MS_NONE )\n\t, m_DraggingArrow( 0x0 )\n{\n\tsetFlag( QGraphicsItem::ItemIsMovable, true );\n\tsetFlag( QGraphicsItem::ItemIsSelectable, true );\n\tsetFlag( QGraphicsItem::ItemStacksBehindParent, false );\n\n\tif( parent )\n\t\tsetParentItem( parent );\n\tsetZValue( 0.0 );\n}\n\nvoid BehaviorTreeNode::removeArrow(NodeToNodeArrow *arrow)\n{\n\tint index = m_Arrows.indexOf(arrow);\n\n\tif (index != -1)\n\t\tm_Arrows.removeAt(index);\n}\n\nvoid BehaviorTreeNode::removeArrows()\n{\n\tforeach( NodeToNodeArrow *arrow, m_Arrows )\n\t{\n\t\tarrow->startItem()->removeArrow(arrow);\n\t\tarrow->endItem()->removeArrow(arrow);\n\t\tscene()->removeItem(arrow);\n\t\tdelete arrow;\n\t}\n}\n\nvoid BehaviorTreeNode::addArrow(NodeToNodeArrow *arrow)\n{\n\tm_Arrows.append(arrow);\n}\n\nNodeToNodeArrow* BehaviorTreeNode::findArrowTo( BehaviorTreeNode* other )\n{\n\tforeach( NodeToNodeArrow *arrow, m_Arrows )\n\t{\n\t\tif( arrow->startItem() == this && arrow->endItem() == other )\n\t\t\treturn arrow;\n\t\tif( arrow->startItem() == other && arrow->endItem() == this )\n\t\t\treturn arrow;\n\t}\n\treturn 0x0;\n}\n\nQVariant BehaviorTreeNode::itemChange( GraphicsItemChange change, const QVariant &value )\n{\n\tswitch( change )\n\t{\n\tcase ItemSelectedChange:\n\t\tupdate();\n\t\tbreak;\n\tcase ItemPositionChange:\n\t\tbreak;\n\t}\n\treturn QGraphicsSvgItem::itemChange( change, value );\n}\n\nvoid BehaviorTreeNode::mousePressEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( event->button() == Qt::LeftButton )\n\t{\n\t\tm_MouseState = E_MS_LB_DOWN;\n\t\tm_StartPos = event->screenPos();\n\t}\n\tQGraphicsSvgItem::mousePressEvent( event );\n}\n\nvoid BehaviorTreeNode::mouseReleaseEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( event->button() == Qt::LeftButton )\n\t{\n\t\tif( m_MouseState == E_MS_DRAGGING )\n\t\t\tdraggingEnded();\n\n\t\tm_MouseState = E_MS_NONE;\n\t}\n\tQGraphicsSvgItem::mouseReleaseEvent( event );\n}\n\nvoid BehaviorTreeNode::mouseMoveEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( m_MouseState == E_MS_LB_DOWN )\n\t{\n\t\tif( m_StartPos != event->screenPos() )\n\t\t{\n\t\t\tdraggingStarted();\n\t\t\tm_MouseState = E_MS_DRAGGING;\n\t\t}\n\t}\n\tif( m_MouseState == E_MS_DRAGGING )\n\t\tlookForRelinkTarget();\n\n\tQGraphicsSvgItem::mouseMoveEvent( event );\n}\n\nvoid BehaviorTreeNode::draggingStarted()\n{\n\tif( parentItem() )\n\t{\n\t\tBehaviorTreeNode* p = (BehaviorTreeNode*)parentItem();\n\t\tm_DraggingArrow = findArrowTo( p );\n\t\tp->removeArrow( m_DraggingArrow );\n\t\tm_DraggingArrow->setDashed( true );\n\t\tm_DraggingArrow->setStartAndEnd( this, p );\n\n\t\tQPointF position( scenePos() );\n\t\tsetParentItem( 0x0 );\n\t\tsetPos( position );\n\t}\n\telse\n\t{\n\t\tm_DraggingArrow = new NodeToNodeArrow( this, 0x0, scene() );\n\t\tm_DraggingArrow->setDashed( true );\n\t\taddArrow( m_DraggingArrow );\n\t}\n\n\tsetupRelinkage();\n\n\tsetZValue( 1.0 );\n}\n\nvoid BehaviorTreeNode::draggingEnded()\n{\n\tif( m_Relinkage.m_Parent )\n\t{\n\t\tBehaviorTreeNode* p = (BehaviorTreeNode*)m_Relinkage.m_Parent->m_UserData;\n\t\tsetPos( p->mapFromScene( scenePos() ) );\n\t\tsetParentItem( p );\n\n\t\tp->addArrow( m_DraggingArrow );\n\t\tm_DraggingArrow->setStartAndEnd( p, this );\n\t\tm_DraggingArrow->setDashed( false );\n\t\tm_DraggingArrow = 0x0;\n\t}\n\telse\n\t{\n\t\tremoveArrow( m_DraggingArrow );\n\t\tdelete m_DraggingArrow;\n\t\tm_DraggingArrow = 0x0;\n\t}\n\n\texecuteRelinkage();\n\n\tsetZValue( 0.0 );\n\n\temit nodeDragged();\n}\n\nvoid BehaviorTreeNode::setupRelinkage()\n{\n\tm_Relinkage.m_Parent = m_Node->m_Pare;\n\tif( m_Node->m_Prev )\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= m_Node->m_Prev;\n\t\tm_Relinkage.m_BeforeSibling\t= false;\n\t}\n\telse if( m_Node->m_Next )\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= m_Node->m_Next;\n\t\tm_Relinkage.m_BeforeSibling\t= true;\n\t}\n\telse\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= 0x0;\n\t\tm_Relinkage.m_BeforeSibling = false;\n\t}\n\tUnlinkNodeFromParentAndSiblings( m_Node );\n}\n\nvoid BehaviorTreeNode::executeRelinkage()\n{\n\tif( m_Relinkage.m_Parent )\n\t\tm_Node->m_Pare = m_Relinkage.m_Parent;\n\n\tif( m_Relinkage.m_Sibling )\n\t{\n\t\tif( m_Relinkage.m_BeforeSibling )\n\t\t{\n\t\t\tif( m_Relinkage.m_Sibling->m_Prev )\n\t\t\t\tm_Relinkage.m_Sibling->m_Prev->m_Next = m_Node;\n\t\t\telse\n\t\t\t\tSetFirstChild( m_Node->m_Pare, m_Node );\n\n\t\t\tm_Node->m_Prev = m_Relinkage.m_Sibling->m_Prev;\n\n\t\t\tm_Relinkage.m_Sibling->m_Prev = m_Node;\n\t\t\tm_Node->m_Next = m_Relinkage.m_Sibling;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif( m_Relinkage.m_Sibling->m_Next )\n\t\t\t\tm_Relinkage.m_Sibling->m_Next->m_Prev = m_Node;\n\t\t\tm_Node->m_Next = m_Relinkage.m_Sibling->m_Next;\n\t\t\tm_Relinkage.m_Sibling->m_Next = m_Node;\n\t\t\tm_Node->m_Prev = m_Relinkage.m_Sibling;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_Node->m_Next = 0x0;\n\t\tm_Node->m_Prev = 0x0;\n\t\tSetFirstChild( m_Node->m_Pare, m_Node );\n\t}\n}\n\nvoid BehaviorTreeNode::lookForRelinkTarget()\n{\n\tQList<QGraphicsItem*> coll( collidingItems() );\n\tforeach( QGraphicsItem* uknown_item, coll )\n\t{\n\t\tif( uknown_item->type() != Type )\n\t\t\tcontinue;\n\n\t\tBehaviorTreeNode* item = (BehaviorTreeNode*)uknown_item;\n\t\tNode* p = item->m_Node;\n\n\t\tif( !AcceptsMoreChildren( p ) && !AcceptsMoreChildren( p = p->m_Pare ) )\n\t\t\tcontinue;\n\n\t\t\/\/ Current parent does not need evaluation.\n\t\tif( p == m_Relinkage.m_Parent )\n\t\t\tcontinue;\n\n\t\tRelinkage t;\n\n\t\tt.m_Parent  \t\t= p;\n\t\tt.m_Sibling\t\t\t= GetFirstChild( p );\n\t\tt.m_BeforeSibling \t= true;\n\n\t\tm_DraggingArrow->setStartAndEnd( this, (BehaviorTreeNode*)p->m_UserData );\n\t\tm_Relinkage = t;\n\t}\n\/*\n\tBehaviorTreeNode* p = (BehaviorTreeNode*)m_Relinkage.m_Parent->m_UserData;\n\n\tQPointF p1(p->scenePos());\n\tQPointF p2(scenePos());\n\tQRectF r1( p->boundingRect() );\n\tQRectF r2( boundingRect() );\n\tp1.rx() += r1.width() \/ 2.0f;\n\tp2.rx() += r2.width() \/ 2.0f;\n\n\tif( p1.x() > p2.x() )\n\t\tp2.rx() = p1.x() + (p1.x()-p2.x());\n\n\tQLineF line( p1, p2 );\n\tqreal a\t\t= line.angle();\n\tqreal best\t= 0;\n\n\tQList<QGraphicsItem*> childlist( p->childItems() );\n\tforeach( QGraphicsItem* uknown_item, coll )\n\t{\n\t\tif( uknown_item->type() != Type )\n\t\t\tcontinue;\n\n\t\tBehaviorTreeNode* item = (BehaviorTreeNode*)uknown_item;\n\t\tp2 = item->scenePos();\n\t\tr2 = item->boundingRect();\n\t\tp2.rx() += r2.width() \/ 2.0f;\n\t\tline.setP2( p2 );\n\t\tqreal ta = line.angle();\n\n\t\tif( m_Relinkage.m_Sibling == 0x0 )\n\t\t{\n\t\t\tm_Relinkage.m_Sibling = item->m_Node;\n\t\t\tbest = ta;\n\t\t\tm_Relinkage.m_BeforeSibling = ta < a;\n\t\t}\n\t\telse if( qAbs( a - best ) > qAbs( ta - best ) )\n\t\t{\n\t\t\tm_Relinkage.m_Sibling = item->m_Node;\n\t\t\tbest = ta;\n\t\t\tm_Relinkage.m_BeforeSibling = ta < a;\n\t\t}\n\t}\n*\/\n}\n\n<commit_msg>Let's get rid of that since it's full of fail.<commit_after>\/*\n *\n * Copyright (C) 2009, Joacim Jacobsson ( j dot jacobsson at gmail dot com )\n * All rights reserved.\n *\n * See LICENSE file for details\n *\n *\/\n\n#include \"BehaviorTreeNode.h\"\n#include \"..\/NodeToNodeArrow.h\"\n#include <btree\/btree.h>\n\n#include <QtGui\/QtGui>\n#include <QtSvg\/QSvgRenderer>\n\nconst char* const g_NodeResourcePaths[_E_MAX_GRIST_TYPES_] = {\n\t\":\/nodes\/unknown.svg\",\n\t\":\/nodes\/sequence.svg\",\n\t\":\/nodes\/selector.svg\",\n\t\":\/nodes\/parallel.svg\",\n\t\":\/nodes\/dyn_selector.svg\",\n\t\":\/nodes\/decorator.svg\",\n\t\":\/nodes\/action.svg\"\n};\n\nBehaviorTreeNode::BehaviorTreeNode( Node* n, BehaviorTreeNode* parent )\n\t: QGraphicsSvgItem( g_NodeResourcePaths[n->m_Grist.m_Type] )\n\t, m_Node( n )\n\t, m_MouseState( E_MS_NONE )\n\t, m_DraggingArrow( 0x0 )\n{\n\tsetFlag( QGraphicsItem::ItemIsMovable, true );\n\tsetFlag( QGraphicsItem::ItemIsSelectable, true );\n\tsetFlag( QGraphicsItem::ItemStacksBehindParent, false );\n\n\tif( parent )\n\t\tsetParentItem( parent );\n\tsetZValue( 0.0 );\n}\n\nvoid BehaviorTreeNode::removeArrow(NodeToNodeArrow *arrow)\n{\n\tint index = m_Arrows.indexOf(arrow);\n\n\tif (index != -1)\n\t\tm_Arrows.removeAt(index);\n}\n\nvoid BehaviorTreeNode::removeArrows()\n{\n\tforeach( NodeToNodeArrow *arrow, m_Arrows )\n\t{\n\t\tarrow->startItem()->removeArrow(arrow);\n\t\tarrow->endItem()->removeArrow(arrow);\n\t\tscene()->removeItem(arrow);\n\t\tdelete arrow;\n\t}\n}\n\nvoid BehaviorTreeNode::addArrow(NodeToNodeArrow *arrow)\n{\n\tm_Arrows.append(arrow);\n}\n\nNodeToNodeArrow* BehaviorTreeNode::findArrowTo( BehaviorTreeNode* other )\n{\n\tforeach( NodeToNodeArrow *arrow, m_Arrows )\n\t{\n\t\tif( arrow->startItem() == this && arrow->endItem() == other )\n\t\t\treturn arrow;\n\t\tif( arrow->startItem() == other && arrow->endItem() == this )\n\t\t\treturn arrow;\n\t}\n\treturn 0x0;\n}\n\nQVariant BehaviorTreeNode::itemChange( GraphicsItemChange change, const QVariant &value )\n{\n\tswitch( change )\n\t{\n\tcase ItemSelectedChange:\n\t\tupdate();\n\t\tbreak;\n\tcase ItemPositionChange:\n\t\tbreak;\n\t}\n\treturn QGraphicsSvgItem::itemChange( change, value );\n}\n\nvoid BehaviorTreeNode::mousePressEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( event->button() == Qt::LeftButton )\n\t{\n\t\tm_MouseState = E_MS_LB_DOWN;\n\t\tm_StartPos = event->screenPos();\n\t}\n\tQGraphicsSvgItem::mousePressEvent( event );\n}\n\nvoid BehaviorTreeNode::mouseReleaseEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( event->button() == Qt::LeftButton )\n\t{\n\t\tif( m_MouseState == E_MS_DRAGGING )\n\t\t\tdraggingEnded();\n\n\t\tm_MouseState = E_MS_NONE;\n\t}\n\tQGraphicsSvgItem::mouseReleaseEvent( event );\n}\n\nvoid BehaviorTreeNode::mouseMoveEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( m_MouseState == E_MS_LB_DOWN )\n\t{\n\t\tif( m_StartPos != event->screenPos() )\n\t\t{\n\t\t\tdraggingStarted();\n\t\t\tm_MouseState = E_MS_DRAGGING;\n\t\t}\n\t}\n\tif( m_MouseState == E_MS_DRAGGING )\n\t\tlookForRelinkTarget();\n\n\tQGraphicsSvgItem::mouseMoveEvent( event );\n}\n\nvoid BehaviorTreeNode::draggingStarted()\n{\n\tif( parentItem() )\n\t{\n\t\tBehaviorTreeNode* p = (BehaviorTreeNode*)parentItem();\n\t\tm_DraggingArrow = findArrowTo( p );\n\t\tp->removeArrow( m_DraggingArrow );\n\t\tm_DraggingArrow->setDashed( true );\n\t\tm_DraggingArrow->setStartAndEnd( this, p );\n\n\t\tQPointF position( scenePos() );\n\t\tsetParentItem( 0x0 );\n\t\tsetPos( position );\n\t}\n\telse\n\t{\n\t\tm_DraggingArrow = new NodeToNodeArrow( this, 0x0, scene() );\n\t\tm_DraggingArrow->setDashed( true );\n\t\taddArrow( m_DraggingArrow );\n\t}\n\n\tsetupRelinkage();\n\n\tsetZValue( 1.0 );\n}\n\nvoid BehaviorTreeNode::draggingEnded()\n{\n\tif( m_Relinkage.m_Parent )\n\t{\n\t\tBehaviorTreeNode* p = (BehaviorTreeNode*)m_Relinkage.m_Parent->m_UserData;\n\t\tsetPos( p->mapFromScene( scenePos() ) );\n\t\tsetParentItem( p );\n\n\t\tp->addArrow( m_DraggingArrow );\n\t\tm_DraggingArrow->setStartAndEnd( p, this );\n\t\tm_DraggingArrow->setDashed( false );\n\t\tm_DraggingArrow = 0x0;\n\t}\n\telse\n\t{\n\t\tremoveArrow( m_DraggingArrow );\n\t\tdelete m_DraggingArrow;\n\t\tm_DraggingArrow = 0x0;\n\t}\n\n\texecuteRelinkage();\n\n\tsetZValue( 0.0 );\n\n\temit nodeDragged();\n}\n\nvoid BehaviorTreeNode::setupRelinkage()\n{\n\tm_Relinkage.m_Parent = m_Node->m_Pare;\n\tif( m_Node->m_Prev )\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= m_Node->m_Prev;\n\t\tm_Relinkage.m_BeforeSibling\t= false;\n\t}\n\telse if( m_Node->m_Next )\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= m_Node->m_Next;\n\t\tm_Relinkage.m_BeforeSibling\t= true;\n\t}\n\telse\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= 0x0;\n\t\tm_Relinkage.m_BeforeSibling = false;\n\t}\n\tUnlinkNodeFromParentAndSiblings( m_Node );\n}\n\nvoid BehaviorTreeNode::executeRelinkage()\n{\n\tif( m_Relinkage.m_Parent )\n\t\tm_Node->m_Pare = m_Relinkage.m_Parent;\n\n\tif( m_Relinkage.m_Sibling )\n\t{\n\t\tif( m_Relinkage.m_BeforeSibling )\n\t\t{\n\t\t\tif( m_Relinkage.m_Sibling->m_Prev )\n\t\t\t\tm_Relinkage.m_Sibling->m_Prev->m_Next = m_Node;\n\t\t\telse\n\t\t\t\tSetFirstChild( m_Node->m_Pare, m_Node );\n\n\t\t\tm_Node->m_Prev = m_Relinkage.m_Sibling->m_Prev;\n\n\t\t\tm_Relinkage.m_Sibling->m_Prev = m_Node;\n\t\t\tm_Node->m_Next = m_Relinkage.m_Sibling;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif( m_Relinkage.m_Sibling->m_Next )\n\t\t\t\tm_Relinkage.m_Sibling->m_Next->m_Prev = m_Node;\n\t\t\tm_Node->m_Next = m_Relinkage.m_Sibling->m_Next;\n\t\t\tm_Relinkage.m_Sibling->m_Next = m_Node;\n\t\t\tm_Node->m_Prev = m_Relinkage.m_Sibling;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_Node->m_Next = 0x0;\n\t\tm_Node->m_Prev = 0x0;\n\t\tSetFirstChild( m_Node->m_Pare, m_Node );\n\t}\n}\n\nvoid BehaviorTreeNode::lookForRelinkTarget()\n{\n\tQList<QGraphicsItem*> coll( collidingItems() );\n\tforeach( QGraphicsItem* uknown_item, coll )\n\t{\n\t\tif( uknown_item->type() != Type )\n\t\t\tcontinue;\n\n\t\tBehaviorTreeNode* item = (BehaviorTreeNode*)uknown_item;\n\t\tNode* p = item->m_Node;\n\n\t\tif( !AcceptsMoreChildren( p ) && !AcceptsMoreChildren( p = p->m_Pare ) )\n\t\t\tcontinue;\n\n\t\t\/\/ Current parent does not need evaluation.\n\t\tif( p == m_Relinkage.m_Parent )\n\t\t\tcontinue;\n\n\t\tRelinkage t;\n\n\t\tt.m_Parent  \t\t= p;\n\t\tt.m_Sibling\t\t\t= GetFirstChild( p );\n\t\tt.m_BeforeSibling \t= true;\n\n\t\tm_DraggingArrow->setStartAndEnd( this, (BehaviorTreeNode*)p->m_UserData );\n\t\tm_Relinkage = t;\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <string>\n\n#include \"caffe\/layer.hpp\"\n#include \"caffe\/layer_factory.hpp\"\n#include \"caffe\/proto\/caffe.pb.h\"\n#include \"caffe\/vision_layers.hpp\"\n\nnamespace caffe {\n\n\/\/ GetLayer() defines the overall layer factory. The Get*Layer() functions\n\/\/ define factories for layers with multiple computational engines.\n\n\/\/ Get convolution layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetConvolutionLayer(\n    const LayerParameter& param) {\n  ConvolutionParameter_Engine engine = param.convolution_param().engine();\n  if (engine == ConvolutionParameter_Engine_DEFAULT) {\n    engine = ConvolutionParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = ConvolutionParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == ConvolutionParameter_Engine_CAFFE) {\n    return new ConvolutionLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == ConvolutionParameter_Engine_CUDNN) {\n    return new CuDNNConvolutionLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get pooling layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetPoolingLayer(const LayerParameter& param) {\n  PoolingParameter_Engine engine = param.pooling_param().engine();\n  if (engine == PoolingParameter_Engine_DEFAULT) {\n    engine = PoolingParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = PoolingParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == PoolingParameter_Engine_CAFFE) {\n    return new PoolingLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == PoolingParameter_Engine_CUDNN) {\n    if (p_param.pad_h() || p_param.pad_w() || param.top_size() > 1) {\n      LOG(INFO) << \"CUDNN does not support padding or multiple tops. \"\n                << \"Using Caffe's own pooling layer.\";\n      return new PoolingLayer<DType>(param);\n    }\n    return new CuDNNPoolingLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get relu layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetReLULayer(const LayerParameter& param) {\n  ReLUParameter_Engine engine = param.relu_param().engine();\n  if (engine == ReLUParameter_Engine_DEFAULT) {\n    engine = ReLUParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = ReLUParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == ReLUParameter_Engine_CAFFE) {\n    return new ReLULayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == ReLUParameter_Engine_CUDNN) {\n    return new CuDNNReLULayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get sigmoid layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetSigmoidLayer(const LayerParameter& param) {\n  SigmoidParameter_Engine engine = param.sigmoid_param().engine();\n  if (engine == SigmoidParameter_Engine_DEFAULT) {\n    engine = SigmoidParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = SigmoidParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == SigmoidParameter_Engine_CAFFE) {\n    return new SigmoidLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == SigmoidParameter_Engine_CUDNN) {\n    return new CuDNNSigmoidLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get tanh layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetTanHLayer(const LayerParameter& param) {\n  TanHParameter_Engine engine = param.tanh_param().engine();\n  if (engine == TanHParameter_Engine_DEFAULT) {\n    engine = TanHParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = TanHParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == TanHParameter_Engine_CAFFE) {\n    return new TanHLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == TanHParameter_Engine_CUDNN) {\n    return new CuDNNTanHLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get softmax layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetSoftmaxLayer(const LayerParameter& param) {\n  SoftmaxParameter_Engine engine = param.softmax_param().engine();\n  if (engine == SoftmaxParameter_Engine_DEFAULT) {\n    engine = SoftmaxParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = SoftmaxParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == SoftmaxParameter_Engine_CAFFE) {\n    return new SoftmaxLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == SoftmaxParameter_Engine_CUDNN) {\n    return new CuDNNSoftmaxLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Layers that have a specific creator function.\nREGISTER_LAYER_CREATOR(CONVOLUTION, GetConvolutionLayer);\nREGISTER_LAYER_CREATOR(POOLING, GetPoolingLayer);\nREGISTER_LAYER_CREATOR(RELU, GetReLULayer);\nREGISTER_LAYER_CREATOR(SIGMOID, GetSigmoidLayer);\nREGISTER_LAYER_CREATOR(SOFTMAX, GetSoftmaxLayer);\nREGISTER_LAYER_CREATOR(TANH, GetTanHLayer);\n\n\/\/ Layers that use their constructor as their default creator.\nREGISTER_LAYER_CLASS(ACCURACY, AccuracyLayer);\nREGISTER_LAYER_CLASS(ABSVAL, AbsValLayer);\nREGISTER_LAYER_CLASS(ARGMAX, ArgMaxLayer);\nREGISTER_LAYER_CLASS(BNLL, BNLLLayer);\nREGISTER_LAYER_CLASS(CONCAT, ConcatLayer);\nREGISTER_LAYER_CLASS(CONTRASTIVE_LOSS, ContrastiveLossLayer);\nREGISTER_LAYER_CLASS(DATA, DataLayer);\nREGISTER_LAYER_CLASS(DROPOUT, DropoutLayer);\nREGISTER_LAYER_CLASS(DUMMY_DATA, DummyDataLayer);\nREGISTER_LAYER_CLASS(EUCLIDEAN_LOSS, EuclideanLossLayer);\nREGISTER_LAYER_CLASS(ELTWISE, EltwiseLayer);\nREGISTER_LAYER_CLASS(FLATTEN, FlattenLayer);\nREGISTER_LAYER_CLASS(HDF5_DATA, HDF5DataLayer);\nREGISTER_LAYER_CLASS(HDF5_OUTPUT, HDF5OutputLayer);\nREGISTER_LAYER_CLASS(HINGE_LOSS, HingeLossLayer);\nREGISTER_LAYER_CLASS(IMAGE_DATA, ImageDataLayer);\nREGISTER_LAYER_CLASS(IM2COL, Im2colLayer);\nREGISTER_LAYER_CLASS(INFOGAIN_LOSS, InfogainLossLayer);\nREGISTER_LAYER_CLASS(INNER_PRODUCT, InnerProductLayer);\nREGISTER_LAYER_CLASS(LRN, LRNLayer);\nREGISTER_LAYER_CLASS(MEMORY_DATA, MemoryDataLayer);\nREGISTER_LAYER_CLASS(MVN, MVNLayer);\nREGISTER_LAYER_CLASS(MULTINOMIAL_LOGISTIC_LOSS, MultinomialLogisticLossLayer);\nREGISTER_LAYER_CLASS(POWER, PowerLayer);\nREGISTER_LAYER_CLASS(SILENCE, SilenceLayer);\nREGISTER_LAYER_CLASS(SIGMOID_CROSS_ENTROPY_LOSS, SigmoidCrossEntropyLossLayer);\nREGISTER_LAYER_CLASS(SLICE, SliceLayer);\nREGISTER_LAYER_CLASS(SOFTMAX_LOSS, SoftmaxWithLossLayer);\nREGISTER_LAYER_CLASS(SPLIT, SplitLayer);\nREGISTER_LAYER_CLASS(WINDOW_DATA, WindowDataLayer);\n\n}  \/\/ namespace caffe\n<commit_msg>add long-ignored threshold layer<commit_after>#include <string>\n\n#include \"caffe\/layer.hpp\"\n#include \"caffe\/layer_factory.hpp\"\n#include \"caffe\/proto\/caffe.pb.h\"\n#include \"caffe\/vision_layers.hpp\"\n\nnamespace caffe {\n\n\/\/ GetLayer() defines the overall layer factory. The Get*Layer() functions\n\/\/ define factories for layers with multiple computational engines.\n\n\/\/ Get convolution layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetConvolutionLayer(\n    const LayerParameter& param) {\n  ConvolutionParameter_Engine engine = param.convolution_param().engine();\n  if (engine == ConvolutionParameter_Engine_DEFAULT) {\n    engine = ConvolutionParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = ConvolutionParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == ConvolutionParameter_Engine_CAFFE) {\n    return new ConvolutionLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == ConvolutionParameter_Engine_CUDNN) {\n    return new CuDNNConvolutionLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get pooling layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetPoolingLayer(const LayerParameter& param) {\n  PoolingParameter_Engine engine = param.pooling_param().engine();\n  if (engine == PoolingParameter_Engine_DEFAULT) {\n    engine = PoolingParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = PoolingParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == PoolingParameter_Engine_CAFFE) {\n    return new PoolingLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == PoolingParameter_Engine_CUDNN) {\n    if (p_param.pad_h() || p_param.pad_w() || param.top_size() > 1) {\n      LOG(INFO) << \"CUDNN does not support padding or multiple tops. \"\n                << \"Using Caffe's own pooling layer.\";\n      return new PoolingLayer<DType>(param);\n    }\n    return new CuDNNPoolingLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get relu layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetReLULayer(const LayerParameter& param) {\n  ReLUParameter_Engine engine = param.relu_param().engine();\n  if (engine == ReLUParameter_Engine_DEFAULT) {\n    engine = ReLUParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = ReLUParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == ReLUParameter_Engine_CAFFE) {\n    return new ReLULayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == ReLUParameter_Engine_CUDNN) {\n    return new CuDNNReLULayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get sigmoid layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetSigmoidLayer(const LayerParameter& param) {\n  SigmoidParameter_Engine engine = param.sigmoid_param().engine();\n  if (engine == SigmoidParameter_Engine_DEFAULT) {\n    engine = SigmoidParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = SigmoidParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == SigmoidParameter_Engine_CAFFE) {\n    return new SigmoidLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == SigmoidParameter_Engine_CUDNN) {\n    return new CuDNNSigmoidLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get tanh layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetTanHLayer(const LayerParameter& param) {\n  TanHParameter_Engine engine = param.tanh_param().engine();\n  if (engine == TanHParameter_Engine_DEFAULT) {\n    engine = TanHParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = TanHParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == TanHParameter_Engine_CAFFE) {\n    return new TanHLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == TanHParameter_Engine_CUDNN) {\n    return new CuDNNTanHLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Get softmax layer according to engine.\ntemplate <typename Dtype>\nLayer<Dtype>* GetSoftmaxLayer(const LayerParameter& param) {\n  SoftmaxParameter_Engine engine = param.softmax_param().engine();\n  if (engine == SoftmaxParameter_Engine_DEFAULT) {\n    engine = SoftmaxParameter_Engine_CAFFE;\n#ifdef USE_CUDNN\n    engine = SoftmaxParameter_Engine_CUDNN;\n#endif\n  }\n  if (engine == SoftmaxParameter_Engine_CAFFE) {\n    return new SoftmaxLayer<Dtype>(param);\n#ifdef USE_CUDNN\n  } else if (engine == SoftmaxParameter_Engine_CUDNN) {\n    return new CuDNNSoftmaxLayer<Dtype>(param);\n#endif\n  } else {\n    LOG(FATAL) << \"Layer \" << param.name() << \" has unknown engine.\";\n  }\n}\n\n\/\/ Layers that have a specific creator function.\nREGISTER_LAYER_CREATOR(CONVOLUTION, GetConvolutionLayer);\nREGISTER_LAYER_CREATOR(POOLING, GetPoolingLayer);\nREGISTER_LAYER_CREATOR(RELU, GetReLULayer);\nREGISTER_LAYER_CREATOR(SIGMOID, GetSigmoidLayer);\nREGISTER_LAYER_CREATOR(SOFTMAX, GetSoftmaxLayer);\nREGISTER_LAYER_CREATOR(TANH, GetTanHLayer);\n\n\/\/ Layers that use their constructor as their default creator.\nREGISTER_LAYER_CLASS(ACCURACY, AccuracyLayer);\nREGISTER_LAYER_CLASS(ABSVAL, AbsValLayer);\nREGISTER_LAYER_CLASS(ARGMAX, ArgMaxLayer);\nREGISTER_LAYER_CLASS(BNLL, BNLLLayer);\nREGISTER_LAYER_CLASS(CONCAT, ConcatLayer);\nREGISTER_LAYER_CLASS(CONTRASTIVE_LOSS, ContrastiveLossLayer);\nREGISTER_LAYER_CLASS(DATA, DataLayer);\nREGISTER_LAYER_CLASS(DROPOUT, DropoutLayer);\nREGISTER_LAYER_CLASS(DUMMY_DATA, DummyDataLayer);\nREGISTER_LAYER_CLASS(EUCLIDEAN_LOSS, EuclideanLossLayer);\nREGISTER_LAYER_CLASS(ELTWISE, EltwiseLayer);\nREGISTER_LAYER_CLASS(FLATTEN, FlattenLayer);\nREGISTER_LAYER_CLASS(HDF5_DATA, HDF5DataLayer);\nREGISTER_LAYER_CLASS(HDF5_OUTPUT, HDF5OutputLayer);\nREGISTER_LAYER_CLASS(HINGE_LOSS, HingeLossLayer);\nREGISTER_LAYER_CLASS(IMAGE_DATA, ImageDataLayer);\nREGISTER_LAYER_CLASS(IM2COL, Im2colLayer);\nREGISTER_LAYER_CLASS(INFOGAIN_LOSS, InfogainLossLayer);\nREGISTER_LAYER_CLASS(INNER_PRODUCT, InnerProductLayer);\nREGISTER_LAYER_CLASS(LRN, LRNLayer);\nREGISTER_LAYER_CLASS(MEMORY_DATA, MemoryDataLayer);\nREGISTER_LAYER_CLASS(MVN, MVNLayer);\nREGISTER_LAYER_CLASS(MULTINOMIAL_LOGISTIC_LOSS, MultinomialLogisticLossLayer);\nREGISTER_LAYER_CLASS(POWER, PowerLayer);\nREGISTER_LAYER_CLASS(SILENCE, SilenceLayer);\nREGISTER_LAYER_CLASS(SIGMOID_CROSS_ENTROPY_LOSS, SigmoidCrossEntropyLossLayer);\nREGISTER_LAYER_CLASS(SLICE, SliceLayer);\nREGISTER_LAYER_CLASS(SOFTMAX_LOSS, SoftmaxWithLossLayer);\nREGISTER_LAYER_CLASS(SPLIT, SplitLayer);\nREGISTER_LAYER_CLASS(THRESHOLD, ThresholdLayer);\nREGISTER_LAYER_CLASS(WINDOW_DATA, WindowDataLayer);\n\n}  \/\/ namespace caffe\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <iterator>\n\n#include <cstdlib> \/\/malloc, realloc\n#include <cstring> \/\/memcpy\n#include <exception> \/\/bad_alloc\n\nnamespace tyti {\ntemplate<typename T>\nclass any_iterator : std::iterator<std::bidirectional_iterator_tag, T>\n{\n    \/\/functionpointer save structure\n    struct TypeInfos\n    {\n        void(*inc_fn)(void*);\n        void(*dec_fn)(void*);\n        const bool(*equal_fn)(const void*,const void*);\n        const T*(*deref_fn)(const void*);\n        size_t size;\n    };\n\n    template<typename IterType>\n    TypeInfos* getFunctionInfos()\n    {\n        static TypeInfos ti =\n        {\n            any_iterator::inc<IterType>,\n            any_iterator::dec<IterType>,\n            any_iterator::equal<IterType>,\n            any_iterator::deref<IterType>,\n            sizeof(IterType)\n        };\n        return &ti;\n    }\n\n    \/\/access functions\n    template<typename Iter>\n    static void inc(void* _ptr)\n    {\n        ++(*reinterpret_cast<Iter*>(_ptr));\n    }\n\n    template<typename Iter>\n    static void dec(void* _ptr)\n    {\n        --(*reinterpret_cast<Iter*>(_ptr));\n    }\n\n    template<typename Iter>\n    static const T* deref(const void* _ptr)\n    {\n        return &(*(*reinterpret_cast<const Iter*>(_ptr)));\n    }\n\n    template<typename Iter>\n    static const bool equal(const void* _lhs, const void* _rhs)\n    {\n        return *reinterpret_cast<const Iter*>(_lhs) == *reinterpret_cast<const Iter*>(_rhs);\n    }\n\n    \/\/ helper functions\n    static void assign(void* dst_, size_t dst_size_, const void* src_, size_t src_size_)\n    {\n        if (dst_size_ < src_size_)\n        {\n            dst_ = std::realloc(dst_, src_size_);\n            if (!dst_)\n                throw std::bad_alloc();\n        }\n        std::memcpy(dst_, src_, src_size_);\n    }\n\n    \/\/ member variables\n    void* ptr_;\n    TypeInfos* ti_;\n\n    \/\/\/ Interface\npublic:\n    template <typename IterType>\n    explicit any_iterator(const IterType& _iter) \n        : ptr_(std::malloc(sizeof(IterType))), ti_(getFunctionInfos<IterType>())\n    {\n        if (!ptr_)\n            throw std::bad_alloc();\n        std::memcpy(ptr_, &_iter, sizeof(IterType));\n    }\n\n    any_iterator(const any_iterator& _iter)\n        : ptr_(std::malloc(_iter.ti_->size)), ti_(_iter.ti_)\n    {\n        if (!ptr_)\n            throw std::bad_alloc();\n        std::memcpy(ptr_, _iter.ptr_, ti_->size);\n    }\n\n    template <typename IterType>\n    any_iterator operator=(const IterType& _iter)\n    {\n        const size_t old_size = ti_->size;\n        const size_t new_size = sizeof(IterType);\n        assign(ptr_, old_size, &_iter, new_size);\n        ti_ = getFunctionInfos<IterType>();\n        return *this;\n    }\n\n    any_iterator operator=(const any_iterator& _iter)\n    {\n        const size_t old_size = ti_->size;\n        const size_t new_size = _iter.ti_->size;\n        assign(ptr_, old_size, _iter.ptr_, new_size);\n        ti_ = _iter.ti_;\n        return *this;\n    }\n\n    ~any_iterator() \n    {\n        std::free(ptr_);\n    }\n\n    bool operator==(const any_iterator& _rhs) const\n    {\n        if (ti_ != _rhs.ti_) \/\/different types\n            return false;\n        return ti_->equal_fn(ptr_, _rhs.ptr_);\n    }\n\n    template <typename IterType>\n    bool operator==(const IterType& _rhs) const {\n        return ti_->equal_fn(ptr_, reinterpret_cast<const void*>(&_rhs));\n    }\n\n    template <typename IterType>\n    bool operator!=(const IterType& _rhs) const{\n        return !operator==(_rhs);\n    }\n\n    \/\/\/ Standard pre-increment operator\n    any_iterator& operator++() {\n        ti_->inc_fn(ptr_);\n        return *this;\n    }\n\n    \/\/\/ Standard post-increment operator\n    any_iterator operator++(int) {\n        any_iterator cpy(*this);\n        ti_->inc_fn(ptr_);\n        return cpy;\n    }\n\n    \/\/\/ Standard pre-decrement operator\n    any_iterator& operator--() {\n        ti_->dec_fn(ptr_);\n        return *this;\n    }\n\n    \/\/\/ Standard post-decrement operator\n    any_iterator operator--(int) {\n        any_iterator cpy(*this);\n        ti_->dec_fn(ptr_);\n        return cpy;\n    }\n\n    const T& operator*() const {\n        return *(ti_->deref_fn(ptr_));\n    }\n\n    \/\/\/ Standard pointer operator.\n    const T* operator->() const {\n        return ti_->deref_fn(ptr_);\n    }\n};\n\n\/\/ C++17 todo:\n\/\/if msvc >= 2017 or gcc with c++17 support\n\/\/#include <any>\n\/\/using AnyIterator = AnyIteratorT<std::any>;\n\/\/endif\n\n} \/\/ end namespace tyti\n\ntemplate<typename IterT, typename T>\nbool operator==(const IterT& _lhs, const tyti::any_iterator<T>& _rhs)\n{\n    return _rhs == _lhs;\n}\n\ntemplate<typename IterT, typename T>\nbool operator!=(const IterT& _lhs, const tyti::any_iterator<T>& _rhs)\n{\n    return _rhs != _lhs;\n}<commit_msg>Update any_iterator.hpp (#3)<commit_after>#pragma once\n\n#include <iterator>\n\n#include <cstdlib> \/\/malloc, realloc\n#include <cstring> \/\/memcpy\n#include <exception> \/\/bad_alloc\n\nnamespace tyti {\ntemplate<typename T>\nclass any_iterator : std::iterator<std::bidirectional_iterator_tag, T>\n{\n    \/\/functionpointer save structure\n    struct TypeInfos\n    {\n        void(*inc_fn)(void*);\n        void(*dec_fn)(void*);\n        const bool(*equal_fn)(const void*,const void*);\n        const T*(*deref_fn)(const void*);\n        size_t size;\n    };\n\n    template<typename IterType>\n    TypeInfos* getFunctionInfos()\n    {\n        static TypeInfos ti =\n        {\n            any_iterator::inc<IterType>,\n            any_iterator::dec<IterType>,\n            any_iterator::equal<IterType>,\n            any_iterator::deref<IterType>,\n            sizeof(IterType)\n        };\n        return &ti;\n    }\n\n    \/\/access functions\n    template<typename Iter>\n    static void inc(void* _ptr)\n    {\n        ++(*reinterpret_cast<Iter*>(_ptr));\n    }\n\n    template<typename Iter>\n    static void dec(void* _ptr)\n    {\n        --(*reinterpret_cast<Iter*>(_ptr));\n    }\n\n    template<typename Iter>\n    static const T* deref(const void* _ptr)\n    {\n        return &(*(*reinterpret_cast<const Iter*>(_ptr)));\n    }\n\n    template<typename Iter>\n    static const bool equal(const void* _lhs, const void* _rhs)\n    {\n        return *reinterpret_cast<const Iter*>(_lhs) == *reinterpret_cast<const Iter*>(_rhs);\n    }\n\n    \/\/ helper functions\n    static void assign(void** dst_, size_t dst_size_, const void* src_, size_t src_size_)\n    {\n        if (dst_size_ < src_size_)\n        {\n            *dst_ = std::realloc(*dst_, src_size_);\n            if (!*dst_)\n                throw std::bad_alloc();\n        }\n        std::memcpy(*dst_, src_, src_size_);\n    }\n\n    \/\/ member variables\n    void* ptr_;\n    TypeInfos* ti_;\n\n    \/\/\/ Interface\npublic:\n    template <typename IterType>\n    explicit any_iterator(const IterType& _iter) \n        : ptr_(std::malloc(sizeof(IterType))), ti_(getFunctionInfos<IterType>())\n    {\n        if (!ptr_)\n            throw std::bad_alloc();\n        std::memcpy(ptr_, &_iter, sizeof(IterType));\n    }\n\n    any_iterator(const any_iterator& _iter)\n        : ptr_(std::malloc(_iter.ti_->size)), ti_(_iter.ti_)\n    {\n        if (!ptr_)\n            throw std::bad_alloc();\n        std::memcpy(ptr_, _iter.ptr_, ti_->size);\n    }\n\n    template <typename IterType>\n    any_iterator operator=(const IterType& _iter)\n    {\n        const size_t old_size = ti_->size;\n        const size_t new_size = sizeof(IterType);\n        assign(&ptr_, old_size, &_iter, new_size);\n        ti_ = getFunctionInfos<IterType>();\n        return *this;\n    }\n\n    any_iterator operator=(const any_iterator& _iter)\n    {\n        const size_t old_size = ti_->size;\n        const size_t new_size = _iter.ti_->size;\n        assign(&ptr_, old_size, _iter.ptr_, new_size);\n        ti_ = _iter.ti_;\n        return *this;\n    }\n\n    ~any_iterator() \n    {\n        std::free(ptr_);\n    }\n\n    bool operator==(const any_iterator& _rhs) const\n    {\n        if (ti_ != _rhs.ti_) \/\/different types\n            return false;\n        return ti_->equal_fn(ptr_, _rhs.ptr_);\n    }\n\n    template <typename IterType>\n    bool operator==(const IterType& _rhs) const {\n        return ti_->equal_fn(ptr_, reinterpret_cast<const void*>(&_rhs));\n    }\n\n    template <typename IterType>\n    bool operator!=(const IterType& _rhs) const{\n        return !operator==(_rhs);\n    }\n\n    \/\/\/ Standard pre-increment operator\n    any_iterator& operator++() {\n        ti_->inc_fn(ptr_);\n        return *this;\n    }\n\n    \/\/\/ Standard post-increment operator\n    any_iterator operator++(int) {\n        any_iterator cpy(*this);\n        ti_->inc_fn(ptr_);\n        return cpy;\n    }\n\n    \/\/\/ Standard pre-decrement operator\n    any_iterator& operator--() {\n        ti_->dec_fn(ptr_);\n        return *this;\n    }\n\n    \/\/\/ Standard post-decrement operator\n    any_iterator operator--(int) {\n        any_iterator cpy(*this);\n        ti_->dec_fn(ptr_);\n        return cpy;\n    }\n\n    const T& operator*() const {\n        return *(ti_->deref_fn(ptr_));\n    }\n\n    \/\/\/ Standard pointer operator.\n    const T* operator->() const {\n        return ti_->deref_fn(ptr_);\n    }\n};\n\n\/\/ C++17 todo:\n\/\/if msvc >= 2017 or gcc with c++17 support\n\/\/#include <any>\n\/\/using AnyIterator = AnyIteratorT<std::any>;\n\/\/endif\n\n} \/\/ end namespace tyti\n\ntemplate<typename IterT, typename T>\nbool operator==(const IterT& _lhs, const tyti::any_iterator<T>& _rhs)\n{\n    return _rhs == _lhs;\n}\n\ntemplate<typename IterT, typename T>\nbool operator!=(const IterT& _lhs, const tyti::any_iterator<T>& _rhs)\n{\n    return _rhs != _lhs;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2016 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#include \"m2ts\/vpxpes2ts.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <cstdio>\n#include <vector>\n\nnamespace libwebm {\n\/\/ TODO(tomfinegan): Dedupe this and PesHeaderField.\n\/\/ Stores a value and its size in bits for writing into a MPEG2 TS Header.\n\/\/ Maximum size is 64 bits. Users may call the Check() method to perform minimal\n\/\/ validation (size > 0 and <= 64).\nstruct TsHeaderField {\n  TsHeaderField(std::uint64_t value, std::uint32_t size_in_bits,\n                std::uint8_t byte_index, std::uint8_t bits_to_shift)\n      : bits(value),\n        num_bits(size_in_bits),\n        index(byte_index),\n        shift(bits_to_shift) {}\n  TsHeaderField() = delete;\n  TsHeaderField(const TsHeaderField&) = default;\n  TsHeaderField(TsHeaderField&&) = default;\n  ~TsHeaderField() = default;\n  bool Check() const {\n    return num_bits > 0 && num_bits <= 64 && shift >= 0 && shift < 64;\n  }\n\n  \/\/ Value to be stored in the field.\n  std::uint64_t bits;\n\n  \/\/ Number of bits in the value.\n  const int num_bits;\n\n  \/\/ Index into the header for the byte in which |bits| will be written.\n  const std::uint8_t index;\n\n  \/\/ Number of bits to left shift value before or'ing. Ignored for whole bytes.\n  const int shift;\n};\n\n\/\/ Data storage for MPEG2 Transport Stream headers.\n\/\/ https:\/\/en.wikipedia.org\/wiki\/MPEG_transport_stream#Packet\nstruct TsHeader {\n  TsHeader(bool payload_start, bool adaptation_flag, std::uint8_t counter)\n      : is_payload_start(payload_start),\n        has_adaptation(adaptation_flag),\n        counter_value(counter) {}\n  TsHeader() = delete;\n  TsHeader(const TsHeader&) = default;\n  TsHeader(TsHeader&&) = default;\n  ~TsHeader() = default;\n\n  void Write(PacketDataBuffer* buffer) const;\n\n  \/\/ Indicates the packet is the beginning of a new fragmented payload.\n  const bool is_payload_start;\n\n  \/\/ Indicates the packet contains an adaptation field.\n  const bool has_adaptation;\n\n  \/\/ The sync byte is the bit pattern of 0x47 (ASCII char 'G').\n  const std::uint8_t kTsHeaderSyncByte = 0x47;\n  const std::uint8_t sync_byte = kTsHeaderSyncByte;\n\n  \/\/ Value for |continuity_counter|. Used to detect gaps when demuxing.\n  const std::uint8_t counter_value;\n\n  \/\/ Set when FEC is impossible. Always 0.\n  const TsHeaderField transport_error_indicator = TsHeaderField(0, 1, 1, 7);\n\n  \/\/ This MPEG2 TS header is the start of a new payload (aka PES packet).\n  const TsHeaderField payload_unit_start_indicator =\n      TsHeaderField(is_payload_start ? 1 : 0, 1, 1, 6);\n\n  \/\/ Set when the current packet has a higher priority than other packets with\n  \/\/ the same PID. Always 0 for VPX.\n  const TsHeaderField transport_priority = TsHeaderField(0, 1, 1, 5);\n\n  \/\/ https:\/\/en.wikipedia.org\/wiki\/MPEG_transport_stream#Packet_Identifier_.28PID.29\n  \/\/ 0x0020-0x1FFA May be assigned as needed to Program Map Tables, elementary\n  \/\/ streams and other data tables.\n  \/\/ Note: Though we hard code to 0x20, this value is actually 13 bits-- the\n  \/\/ buffer for the header is always set to 0, so it doesn't matter in practice.\n  const TsHeaderField pid = TsHeaderField(0x20, 8, 2, 0);\n\n  \/\/ Indicates scrambling key. Unused; always 0.\n  const TsHeaderField scrambling_control = TsHeaderField(0, 2, 3, 6);\n\n  \/\/ Adaptation field flag. Unused; always 0.\n  \/\/ TODO(tomfinegan): Not sure this is OK. Might need to add support for\n  \/\/ writing the Adaptation Field.\n  const TsHeaderField adaptation_field_flag =\n      TsHeaderField(has_adaptation ? 1 : 0, 1, 3, 5);\n\n  \/\/ Payload flag. All output packets created here have payloads. Always 1.\n  const TsHeaderField payload_flag = TsHeaderField(1, 1, 3, 4);\n\n  \/\/ Continuity counter. Two bit field that is incremented for every packet.\n  const TsHeaderField continuity_counter =\n      TsHeaderField(counter_value, 4, 3, 3);\n};\n\nvoid TsHeader::Write(PacketDataBuffer* buffer) const {\n  std::uint8_t* byte = &(*buffer)[0];\n  *byte = sync_byte;\n\n  *++byte = 0;\n  *byte |= transport_error_indicator.bits << transport_error_indicator.shift;\n  *byte |= payload_unit_start_indicator.bits\n           << payload_unit_start_indicator.shift;\n  *byte |= transport_priority.bits << transport_priority.shift;\n\n  *++byte = pid.bits;\n\n  *++byte = 0;\n  *byte |= scrambling_control.bits << scrambling_control.shift;\n  *byte |= adaptation_field_flag.bits << adaptation_field_flag.shift;\n  *byte |= payload_flag.bits << payload_flag.shift;\n  *byte |= continuity_counter.bits;  \/\/ last 4 bits.\n}\n\nbool VpxPes2Ts::ConvertToFile() {\n  output_file_ = FilePtr(fopen(output_file_name_.c_str(), \"wb\"), FILEDeleter());\n  if (output_file_ == nullptr) {\n    std::fprintf(stderr, \"VpxPes2Ts: Cannot open %s for output.\\n\",\n                 output_file_name_.c_str());\n    return false;\n  }\n  pes_converter_.reset(new Webm2Pes(input_file_name_, this));\n  if (pes_converter_ == nullptr) {\n    std::fprintf(stderr, \"VpxPes2Ts: Out of memory.\\n\");\n    return false;\n  }\n  return pes_converter_->ConvertToPacketReceiver();\n}\n\nbool VpxPes2Ts::ReceivePacket(const PacketDataBuffer& packet_data) {\n  const int kTsHeaderSize = 4;\n  const int kTsPayloadSize = 184;\n  const int kTsPacketSize = kTsHeaderSize + kTsPayloadSize;\n  int bytes_to_packetize = packet_data.size();\n  std::uint8_t continuity_counter = 0;\n  std::size_t read_pos = 0;\n\n  ts_buffer_.reserve(kTsPacketSize);\n\n  while (bytes_to_packetize > 0) {\n    if (continuity_counter > 0xf)\n      continuity_counter = 0;\n\n    \/\/ Calculate payload size (need to know if we'll have to pad with an empty\n    \/\/ adaptation field).\n    int payload_size = std::min(bytes_to_packetize, kTsPayloadSize);\n\n    \/\/ Write the TS header.\n    const TsHeader header(\n        bytes_to_packetize == static_cast<int>(packet_data.size()),\n        payload_size != kTsPayloadSize, continuity_counter);\n    header.Write(&ts_buffer_);\n    int write_pos = kTsHeaderSize;\n\n    \/\/ (pre)Pad payload with an empty adaptation field. All packets must be\n    \/\/ |kTsPacketSize| (188).\n    if (payload_size < kTsPayloadSize) {\n      \/\/ We need at least 2 bytes to write an empty adaptation field.\n      if (payload_size == (kTsPayloadSize - 1)) {\n        payload_size--;\n      }\n\n      \/\/ Padding adaptation field:\n      \/\/   8 bits: number of adaptation field bytes following this byte.\n      \/\/   8 bits: unused (in this program) flags.\n      \/\/ This is followed by a run of 0xff to reach |kTsPayloadSize| (184)\n      \/\/ bytes.\n      const int pad_size = kTsPayloadSize - payload_size - 1 - 1;\n      ts_buffer_[write_pos++] = pad_size + 1;\n      ts_buffer_[write_pos++] = 0;\n\n      const std::uint8_t kStuffingByte = 0xff;\n      for (int i = 0; i < pad_size; ++i) {\n        ts_buffer_[write_pos++] = kStuffingByte;\n      }\n    }\n\n    for (int i = 0; i < payload_size; ++i) {\n      ts_buffer_[write_pos++] = packet_data[read_pos++];\n    }\n\n    bytes_to_packetize -= payload_size;\n    continuity_counter++;\n\n    if (write_pos != kTsPacketSize) {\n      fprintf(stderr, \"VpxPes2Ts: Invalid packet length.\\n\");\n      return false;\n    }\n\n    \/\/ Write contents of |ts_buffer_| to |output_file_|.\n    \/\/ TODO(tomfinegan): Writing 188 bytes at a time isn't exactly efficient...\n    \/\/ Fix me.\n    if (static_cast<int>(std::fwrite(&ts_buffer_[0], 1, kTsPacketSize,\n                                     output_file_.get())) != kTsPacketSize) {\n      std::fprintf(stderr, \"VpxPes2Ts: TS packet write failed.\\n\");\n      return false;\n    }\n  }\n\n  return true;\n}\n\n}  \/\/ namespace libwebm\n<commit_msg>msvc\/vpxpes2ts: Fix MSVC integer conversion warning.<commit_after>\/\/ Copyright (c) 2016 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#include \"m2ts\/vpxpes2ts.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <cstdio>\n#include <vector>\n\nnamespace libwebm {\n\/\/ TODO(tomfinegan): Dedupe this and PesHeaderField.\n\/\/ Stores a value and its size in bits for writing into a MPEG2 TS Header.\n\/\/ Maximum size is 64 bits. Users may call the Check() method to perform minimal\n\/\/ validation (size > 0 and <= 64).\nstruct TsHeaderField {\n  TsHeaderField(std::uint64_t value, std::uint32_t size_in_bits,\n                std::uint8_t byte_index, std::uint8_t bits_to_shift)\n      : bits(value),\n        num_bits(size_in_bits),\n        index(byte_index),\n        shift(bits_to_shift) {}\n  TsHeaderField() = delete;\n  TsHeaderField(const TsHeaderField&) = default;\n  TsHeaderField(TsHeaderField&&) = default;\n  ~TsHeaderField() = default;\n  bool Check() const {\n    return num_bits > 0 && num_bits <= 64 && shift >= 0 && shift < 64;\n  }\n\n  \/\/ Value to be stored in the field.\n  std::uint64_t bits;\n\n  \/\/ Number of bits in the value.\n  const int num_bits;\n\n  \/\/ Index into the header for the byte in which |bits| will be written.\n  const std::uint8_t index;\n\n  \/\/ Number of bits to left shift value before or'ing. Ignored for whole bytes.\n  const int shift;\n};\n\n\/\/ Data storage for MPEG2 Transport Stream headers.\n\/\/ https:\/\/en.wikipedia.org\/wiki\/MPEG_transport_stream#Packet\nstruct TsHeader {\n  TsHeader(bool payload_start, bool adaptation_flag, std::uint8_t counter)\n      : is_payload_start(payload_start),\n        has_adaptation(adaptation_flag),\n        counter_value(counter) {}\n  TsHeader() = delete;\n  TsHeader(const TsHeader&) = default;\n  TsHeader(TsHeader&&) = default;\n  ~TsHeader() = default;\n\n  void Write(PacketDataBuffer* buffer) const;\n\n  \/\/ Indicates the packet is the beginning of a new fragmented payload.\n  const bool is_payload_start;\n\n  \/\/ Indicates the packet contains an adaptation field.\n  const bool has_adaptation;\n\n  \/\/ The sync byte is the bit pattern of 0x47 (ASCII char 'G').\n  const std::uint8_t kTsHeaderSyncByte = 0x47;\n  const std::uint8_t sync_byte = kTsHeaderSyncByte;\n\n  \/\/ Value for |continuity_counter|. Used to detect gaps when demuxing.\n  const std::uint8_t counter_value;\n\n  \/\/ Set when FEC is impossible. Always 0.\n  const TsHeaderField transport_error_indicator = TsHeaderField(0, 1, 1, 7);\n\n  \/\/ This MPEG2 TS header is the start of a new payload (aka PES packet).\n  const TsHeaderField payload_unit_start_indicator =\n      TsHeaderField(is_payload_start ? 1 : 0, 1, 1, 6);\n\n  \/\/ Set when the current packet has a higher priority than other packets with\n  \/\/ the same PID. Always 0 for VPX.\n  const TsHeaderField transport_priority = TsHeaderField(0, 1, 1, 5);\n\n  \/\/ https:\/\/en.wikipedia.org\/wiki\/MPEG_transport_stream#Packet_Identifier_.28PID.29\n  \/\/ 0x0020-0x1FFA May be assigned as needed to Program Map Tables, elementary\n  \/\/ streams and other data tables.\n  \/\/ Note: Though we hard code to 0x20, this value is actually 13 bits-- the\n  \/\/ buffer for the header is always set to 0, so it doesn't matter in practice.\n  const TsHeaderField pid = TsHeaderField(0x20, 8, 2, 0);\n\n  \/\/ Indicates scrambling key. Unused; always 0.\n  const TsHeaderField scrambling_control = TsHeaderField(0, 2, 3, 6);\n\n  \/\/ Adaptation field flag. Unused; always 0.\n  \/\/ TODO(tomfinegan): Not sure this is OK. Might need to add support for\n  \/\/ writing the Adaptation Field.\n  const TsHeaderField adaptation_field_flag =\n      TsHeaderField(has_adaptation ? 1 : 0, 1, 3, 5);\n\n  \/\/ Payload flag. All output packets created here have payloads. Always 1.\n  const TsHeaderField payload_flag = TsHeaderField(1, 1, 3, 4);\n\n  \/\/ Continuity counter. Two bit field that is incremented for every packet.\n  const TsHeaderField continuity_counter =\n      TsHeaderField(counter_value, 4, 3, 3);\n};\n\nvoid TsHeader::Write(PacketDataBuffer* buffer) const {\n  std::uint8_t* byte = &(*buffer)[0];\n  *byte = sync_byte;\n\n  *++byte = 0;\n  *byte |= transport_error_indicator.bits << transport_error_indicator.shift;\n  *byte |= payload_unit_start_indicator.bits\n           << payload_unit_start_indicator.shift;\n  *byte |= transport_priority.bits << transport_priority.shift;\n\n  *++byte = pid.bits & 0xff;\n\n  *++byte = 0;\n  *byte |= scrambling_control.bits << scrambling_control.shift;\n  *byte |= adaptation_field_flag.bits << adaptation_field_flag.shift;\n  *byte |= payload_flag.bits << payload_flag.shift;\n  *byte |= continuity_counter.bits;  \/\/ last 4 bits.\n}\n\nbool VpxPes2Ts::ConvertToFile() {\n  output_file_ = FilePtr(fopen(output_file_name_.c_str(), \"wb\"), FILEDeleter());\n  if (output_file_ == nullptr) {\n    std::fprintf(stderr, \"VpxPes2Ts: Cannot open %s for output.\\n\",\n                 output_file_name_.c_str());\n    return false;\n  }\n  pes_converter_.reset(new Webm2Pes(input_file_name_, this));\n  if (pes_converter_ == nullptr) {\n    std::fprintf(stderr, \"VpxPes2Ts: Out of memory.\\n\");\n    return false;\n  }\n  return pes_converter_->ConvertToPacketReceiver();\n}\n\nbool VpxPes2Ts::ReceivePacket(const PacketDataBuffer& packet_data) {\n  const int kTsHeaderSize = 4;\n  const int kTsPayloadSize = 184;\n  const int kTsPacketSize = kTsHeaderSize + kTsPayloadSize;\n  int bytes_to_packetize = packet_data.size();\n  std::uint8_t continuity_counter = 0;\n  std::size_t read_pos = 0;\n\n  ts_buffer_.reserve(kTsPacketSize);\n\n  while (bytes_to_packetize > 0) {\n    if (continuity_counter > 0xf)\n      continuity_counter = 0;\n\n    \/\/ Calculate payload size (need to know if we'll have to pad with an empty\n    \/\/ adaptation field).\n    int payload_size = std::min(bytes_to_packetize, kTsPayloadSize);\n\n    \/\/ Write the TS header.\n    const TsHeader header(\n        bytes_to_packetize == static_cast<int>(packet_data.size()),\n        payload_size != kTsPayloadSize, continuity_counter);\n    header.Write(&ts_buffer_);\n    int write_pos = kTsHeaderSize;\n\n    \/\/ (pre)Pad payload with an empty adaptation field. All packets must be\n    \/\/ |kTsPacketSize| (188).\n    if (payload_size < kTsPayloadSize) {\n      \/\/ We need at least 2 bytes to write an empty adaptation field.\n      if (payload_size == (kTsPayloadSize - 1)) {\n        payload_size--;\n      }\n\n      \/\/ Padding adaptation field:\n      \/\/   8 bits: number of adaptation field bytes following this byte.\n      \/\/   8 bits: unused (in this program) flags.\n      \/\/ This is followed by a run of 0xff to reach |kTsPayloadSize| (184)\n      \/\/ bytes.\n      const int pad_size = kTsPayloadSize - payload_size - 1 - 1;\n      ts_buffer_[write_pos++] = pad_size + 1;\n      ts_buffer_[write_pos++] = 0;\n\n      const std::uint8_t kStuffingByte = 0xff;\n      for (int i = 0; i < pad_size; ++i) {\n        ts_buffer_[write_pos++] = kStuffingByte;\n      }\n    }\n\n    for (int i = 0; i < payload_size; ++i) {\n      ts_buffer_[write_pos++] = packet_data[read_pos++];\n    }\n\n    bytes_to_packetize -= payload_size;\n    continuity_counter++;\n\n    if (write_pos != kTsPacketSize) {\n      fprintf(stderr, \"VpxPes2Ts: Invalid packet length.\\n\");\n      return false;\n    }\n\n    \/\/ Write contents of |ts_buffer_| to |output_file_|.\n    \/\/ TODO(tomfinegan): Writing 188 bytes at a time isn't exactly efficient...\n    \/\/ Fix me.\n    if (static_cast<int>(std::fwrite(&ts_buffer_[0], 1, kTsPacketSize,\n                                     output_file_.get())) != kTsPacketSize) {\n      std::fprintf(stderr, \"VpxPes2Ts: TS packet write failed.\\n\");\n      return false;\n    }\n  }\n\n  return true;\n}\n\n}  \/\/ namespace libwebm\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CAFFE_UTIL_IO_H_\n#define CAFFE_UTIL_IO_H_\n\n#include <boost\/filesystem.hpp>\n#include <string>\n\n#include \"google\/protobuf\/message.h\"\n\n#include \"caffe\/common.hpp\"\n#include \"caffe\/proto\/caffe.pb.h\"\n\nnamespace caffe {\n\nusing ::google::protobuf::Message;\nusing ::boost::filesystem::path;\n\ninline void MakeTempFilename(string* temp_filename) {\n  temp_filename->clear();\n  const path& model = boost::filesystem::temp_directory_path()\n    \/\"caffe_test.%%%%%%\";\n  *temp_filename = boost::filesystem::unique_path(model).string();\n}\n\ninline void MakeTempDir(string* temp_dirname) {\n  temp_dirname->clear();\n  const path& model = boost::filesystem::temp_directory_path()\n    \/\"caffe_test.%%%%%%\";\n  const path& dir = boost::filesystem::unique_path(model).string();\n  bool directoryCreated = boost::filesystem::create_directory(dir);\n  CHECK(directoryCreated);\n  *temp_dirname = dir.string();\n}\n\nbool ReadProtoFromTextFile(const char* filename, Message* proto);\n\ninline bool ReadProtoFromTextFile(const string& filename, Message* proto) {\n  return ReadProtoFromTextFile(filename.c_str(), proto);\n}\n\ninline void ReadProtoFromTextFileOrDie(const char* filename, Message* proto) {\n  CHECK(ReadProtoFromTextFile(filename, proto));\n}\n\ninline void ReadProtoFromTextFileOrDie(const string& filename, Message* proto) {\n  ReadProtoFromTextFileOrDie(filename.c_str(), proto);\n}\n\nvoid WriteProtoToTextFile(const Message& proto, const char* filename);\ninline void WriteProtoToTextFile(const Message& proto, const string& filename) {\n  WriteProtoToTextFile(proto, filename.c_str());\n}\n\nbool ReadProtoFromBinaryFile(const char* filename, Message* proto);\n\ninline bool ReadProtoFromBinaryFile(const string& filename, Message* proto) {\n  return ReadProtoFromBinaryFile(filename.c_str(), proto);\n}\n\ninline void ReadProtoFromBinaryFileOrDie(const char* filename, Message* proto) {\n  CHECK(ReadProtoFromBinaryFile(filename, proto));\n}\n\ninline void ReadProtoFromBinaryFileOrDie(const string& filename,\n                                         Message* proto) {\n  ReadProtoFromBinaryFileOrDie(filename.c_str(), proto);\n}\n\n\nvoid WriteProtoToBinaryFile(const Message& proto, const char* filename);\ninline void WriteProtoToBinaryFile(\n    const Message& proto, const string& filename) {\n  WriteProtoToBinaryFile(proto, filename.c_str());\n}\n\nbool ReadFileToDatum(const string& filename, const int label, Datum* datum);\n\ninline bool ReadFileToDatum(const string& filename, Datum* datum) {\n  return ReadFileToDatum(filename, -1, datum);\n}\n\nbool ReadImageToDatum(const string& filename, const int label,\n    const int height, const int width, const bool is_color,\n    const std::string & encoding, Datum* datum);\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    const int height, const int width, const bool is_color, Datum* datum) {\n  return ReadImageToDatum(filename, label, height, width, is_color,\n                          \"\", datum);\n}\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    const int height, const int width, Datum* datum) {\n  return ReadImageToDatum(filename, label, height, width, true, datum);\n}\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    const bool is_color, Datum* datum) {\n  return ReadImageToDatum(filename, label, 0, 0, is_color, datum);\n}\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    Datum* datum) {\n  return ReadImageToDatum(filename, label, 0, 0, true, datum);\n}\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    const std::string & encoding, Datum* datum) {\n  return ReadImageToDatum(filename, label, 0, 0, true, encoding, datum);\n}\n\nbool DecodeDatumNative(Datum* datum);\nbool DecodeDatum(Datum* datum, bool is_color);\n\n#ifdef USE_OPENCV\ncv::Mat ReadImageToCVMat(const string& filename,\n    const int height, const int width, const bool is_color);\n\ncv::Mat ReadImageToCVMat(const string& filename,\n    const int height, const int width);\n\ncv::Mat ReadImageToCVMat(const string& filename,\n    const bool is_color);\n\ncv::Mat ReadImageToCVMat(const string& filename);\n\ncv::Mat DecodeDatumToCVMatNative(const Datum& datum);\ncv::Mat DecodeDatumToCVMat(const Datum& datum, bool is_color);\n\nvoid CVMatToDatum(const cv::Mat& cv_img, Datum* datum);\n#endif  \/\/ USE_OPENCV\n\n}  \/\/ namespace caffe\n\n#endif   \/\/ CAFFE_UTIL_IO_H_\n<commit_msg>Secure implementation of MakeTempDir<commit_after>#ifndef CAFFE_UTIL_IO_H_\n#define CAFFE_UTIL_IO_H_\n\n#include <boost\/filesystem.hpp>\n#include <string>\n\n#include \"google\/protobuf\/message.h\"\n\n#include \"caffe\/common.hpp\"\n#include \"caffe\/proto\/caffe.pb.h\"\n\n#ifndef CAFFE_TMP_DIR_RETRIES\n#define CAFFE_TMP_DIR_RETRIES 100\n#endif\n\nnamespace caffe {\n\nusing ::google::protobuf::Message;\nusing ::boost::filesystem::path;\n\ninline void MakeTempFilename(string* temp_filename) {\n  temp_filename->clear();\n  const path& model = boost::filesystem::temp_directory_path()\n    \/\"caffe_test.%%%%%%\";\n  *temp_filename = boost::filesystem::unique_path(model).string();\n}\n\ninline void MakeTempDir(string* temp_dirname) {\n  temp_dirname->clear();\n  const path& model =\n    boost::filesystem::temp_directory_path()\/\"caffe_test.%%%%-%%%%\";\n  for ( int i = 0; i < CAFFE_TMP_DIR_RETRIES; i++ ) {\n    const path& dir = boost::filesystem::unique_path(model).string();\n    bool done = boost::filesystem::create_directory(dir);\n    if ( done ) {\n      *temp_dirname = dir.string();\n      return;\n    }\n  }\n  LOG(FATAL) << \"Failed to create a temporary directory.\";\n}\n\nbool ReadProtoFromTextFile(const char* filename, Message* proto);\n\ninline bool ReadProtoFromTextFile(const string& filename, Message* proto) {\n  return ReadProtoFromTextFile(filename.c_str(), proto);\n}\n\ninline void ReadProtoFromTextFileOrDie(const char* filename, Message* proto) {\n  CHECK(ReadProtoFromTextFile(filename, proto));\n}\n\ninline void ReadProtoFromTextFileOrDie(const string& filename, Message* proto) {\n  ReadProtoFromTextFileOrDie(filename.c_str(), proto);\n}\n\nvoid WriteProtoToTextFile(const Message& proto, const char* filename);\ninline void WriteProtoToTextFile(const Message& proto, const string& filename) {\n  WriteProtoToTextFile(proto, filename.c_str());\n}\n\nbool ReadProtoFromBinaryFile(const char* filename, Message* proto);\n\ninline bool ReadProtoFromBinaryFile(const string& filename, Message* proto) {\n  return ReadProtoFromBinaryFile(filename.c_str(), proto);\n}\n\ninline void ReadProtoFromBinaryFileOrDie(const char* filename, Message* proto) {\n  CHECK(ReadProtoFromBinaryFile(filename, proto));\n}\n\ninline void ReadProtoFromBinaryFileOrDie(const string& filename,\n                                         Message* proto) {\n  ReadProtoFromBinaryFileOrDie(filename.c_str(), proto);\n}\n\n\nvoid WriteProtoToBinaryFile(const Message& proto, const char* filename);\ninline void WriteProtoToBinaryFile(\n    const Message& proto, const string& filename) {\n  WriteProtoToBinaryFile(proto, filename.c_str());\n}\n\nbool ReadFileToDatum(const string& filename, const int label, Datum* datum);\n\ninline bool ReadFileToDatum(const string& filename, Datum* datum) {\n  return ReadFileToDatum(filename, -1, datum);\n}\n\nbool ReadImageToDatum(const string& filename, const int label,\n    const int height, const int width, const bool is_color,\n    const std::string & encoding, Datum* datum);\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    const int height, const int width, const bool is_color, Datum* datum) {\n  return ReadImageToDatum(filename, label, height, width, is_color,\n                          \"\", datum);\n}\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    const int height, const int width, Datum* datum) {\n  return ReadImageToDatum(filename, label, height, width, true, datum);\n}\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    const bool is_color, Datum* datum) {\n  return ReadImageToDatum(filename, label, 0, 0, is_color, datum);\n}\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    Datum* datum) {\n  return ReadImageToDatum(filename, label, 0, 0, true, datum);\n}\n\ninline bool ReadImageToDatum(const string& filename, const int label,\n    const std::string & encoding, Datum* datum) {\n  return ReadImageToDatum(filename, label, 0, 0, true, encoding, datum);\n}\n\nbool DecodeDatumNative(Datum* datum);\nbool DecodeDatum(Datum* datum, bool is_color);\n\n#ifdef USE_OPENCV\ncv::Mat ReadImageToCVMat(const string& filename,\n    const int height, const int width, const bool is_color);\n\ncv::Mat ReadImageToCVMat(const string& filename,\n    const int height, const int width);\n\ncv::Mat ReadImageToCVMat(const string& filename,\n    const bool is_color);\n\ncv::Mat ReadImageToCVMat(const string& filename);\n\ncv::Mat DecodeDatumToCVMatNative(const Datum& datum);\ncv::Mat DecodeDatumToCVMat(const Datum& datum, bool is_color);\n\nvoid CVMatToDatum(const cv::Mat& cv_img, Datum* datum);\n#endif  \/\/ USE_OPENCV\n\n}  \/\/ namespace caffe\n\n#endif   \/\/ CAFFE_UTIL_IO_H_\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the \"libfnord\" project\n *   Copyright (c) 2015 Paul Asmuth\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 <chartsql\/CSTableScan.h>\n#include <chartsql\/qtree\/ColumnReferenceNode.h>\n#include <chartsql\/runtime\/defaultruntime.h>\n#include <chartsql\/runtime\/compile.h>\n#include <fnord\/inspect.h>\n\nusing namespace fnord;\n\nnamespace csql {\n\nCSTableScan::CSTableScan(\n    RefPtr<SequentialScanNode> stmt,\n    cstable::CSTableReader&& cstable,\n    DefaultRuntime* runtime) :\n    cstable_(std::move(cstable)),\n    colindex_(0),\n    aggr_strategy_(stmt->aggregationStrategy()) {\n\n  Set<String> column_names;\n  for (const auto& slnode : stmt->selectList()) {\n    findColumns(slnode->expression(), &column_names);\n  }\n\n  for (const auto& col : column_names) {\n    columns_.emplace(col, ColumnRef(cstable_.getColumnReader(col), colindex_++));\n  }\n\n  for (auto& slnode : stmt->selectList()) {\n    resolveColumns(slnode->expression());\n  }\n\n  for (const auto& slnode : stmt->selectList()) {\n    select_list_.emplace_back(\n        findMaxRepetitionLevel(slnode->expression()),\n        runtime->buildScalarExpression(slnode->expression()),\n        &scratch_);\n  }\n}\n\nvoid CSTableScan::execute(\n    ExecutionContext* context,\n    Function<bool (int argc, const SValue* argv)> fn) {\n  uint64_t select_level = 0;\n  uint64_t fetch_level = 0;\n\n  Vector<SValue> in_row(colindex_, SValue{});\n  Vector<SValue> out_row(select_list_.size(), SValue{});\n\n  size_t num_records = 0;\n  size_t total_records = cstable_.numRecords();\n  while (num_records < total_records) {\n    uint64_t next_level = 0;\n\n    if (fetch_level == 0) {\n      ++num_records;\n    }\n\n    for (auto& col : columns_) {\n      auto nextr = col.second.reader->nextRepetitionLevel();\n\n      if (nextr >= fetch_level) {\n        auto& reader = col.second.reader;\n\n        uint64_t r;\n        uint64_t d;\n        void* data;\n        size_t size;\n        reader->next(&r, &d, &data, &size);\n\n        switch (col.second.reader->type()) {\n\n          case msg::FieldType::STRING:\n            in_row[col.second.index] =\n                SValue(SValue::StringType((char*) data, size));\n            break;\n\n          case msg::FieldType::UINT32:\n          case msg::FieldType::UINT64:\n            switch (size) {\n              case sizeof(uint32_t):\n                in_row[col.second.index] =\n                    SValue(SValue::IntegerType(*((uint32_t*) data)));\n                break;\n              case sizeof(uint64_t):\n                in_row[col.second.index] =\n                    SValue(SValue::IntegerType(*((uint64_t*) data)));\n                break;\n              case 0:\n                in_row[col.second.index] = SValue();\n                break;\n            }\n            break;\n\n          case msg::FieldType::BOOLEAN:\n            switch (size) {\n              case sizeof(uint32_t):\n                in_row[col.second.index] =\n                    SValue(SValue::BoolType(*((uint32_t*) data) > 0));\n                break;\n              case sizeof(uint64_t):\n                in_row[col.second.index] =\n                    SValue(SValue::BoolType(*((uint64_t*) data) > 0));\n                break;\n              case 0:\n                in_row[col.second.index] = SValue(SValue::BoolType(false));\n                break;\n            }\n            break;\n\n          case msg::FieldType::OBJECT:\n            RAISE(kIllegalStateError);\n\n        }\n      }\n\n      next_level = std::max(next_level, col.second.reader->nextRepetitionLevel());\n    }\n\n    fetch_level = next_level;\n\n    if (true) { \/\/ where clause\n      for (int i = 0; i < select_list_.size(); ++i) {\n        if (select_list_[i].rep_level >= select_level) {\n          select_list_[i].compiled->accumulate(\n              &select_list_[i].instance,\n              in_row.size(),\n              in_row.data());\n        }\n      }\n\n      switch (aggr_strategy_) {\n\n        case AggregationStrategy::AGGREGATE_ALL:\n          break;\n\n        case AggregationStrategy::AGGREGATE_WITHIN_RECORD:\n          if (next_level != 0) {\n            break;\n          }\n          \/* fallthrough *\/\n\n        case AggregationStrategy::NO_AGGREGATION:\n          for (int i = 0; i < select_list_.size(); ++i) {\n            select_list_[i].compiled->result(\n                &select_list_[i].instance,\n                &out_row[i]);\n\n            select_list_[i].compiled->reset(&select_list_[i].instance);\n          }\n\n          if (!fn(out_row.size(), out_row.data())) {\n            return;\n          }\n\n          break;\n\n      }\n\n      select_level = fetch_level;\n    } else {\n      select_level = std::min(select_level, fetch_level);\n    }\n\n    for (const auto& col : columns_) {\n      if (col.second.reader->maxRepetitionLevel() >= select_level) {\n        in_row[col.second.index] = SValue();\n      }\n    }\n  }\n\n  switch (aggr_strategy_) {\n    case AggregationStrategy::AGGREGATE_ALL:\n      for (int i = 0; i < select_list_.size(); ++i) {\n        select_list_[i].compiled->result(\n            &select_list_[i].instance,\n            &out_row[i]);\n\n        select_list_[i].compiled->reset(&select_list_[i].instance);\n      }\n\n      fn(out_row.size(), out_row.data());\n      break;\n\n    default:\n      break;\n\n  }\n}\n\nvoid CSTableScan::findColumns(\n    RefPtr<ScalarExpressionNode> expr,\n    Set<String>* column_names) const {\n  auto fieldref = dynamic_cast<ColumnReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    column_names->emplace(fieldref->fieldName());\n  }\n\n  for (const auto& e : expr->arguments()) {\n    findColumns(e, column_names);\n  }\n}\n\nvoid CSTableScan::resolveColumns(RefPtr<ScalarExpressionNode> expr) const {\n  auto fieldref = dynamic_cast<ColumnReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    auto col = columns_.find(fieldref->fieldName());\n    if (col == columns_.end()) {\n      RAISE(kIllegalStateError);\n    }\n\n    fieldref->setColumnIndex(col->second.index);\n  }\n\n  for (const auto& e : expr->arguments()) {\n    resolveColumns(e);\n  }\n}\n\nuint64_t CSTableScan::findMaxRepetitionLevel(\n    RefPtr<ScalarExpressionNode> expr) const {\n  uint64_t max_level = 0;\n\n  auto fieldref = dynamic_cast<ColumnReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    auto col = columns_.find(fieldref->fieldName());\n    if (col == columns_.end()) {\n      RAISE(kIllegalStateError);\n    }\n\n    auto col_level = col->second.reader->maxRepetitionLevel();\n    if (col_level > max_level) {\n      max_level = col_level;\n    }\n  }\n\n  for (const auto& e : expr->arguments()) {\n    auto e_level = findMaxRepetitionLevel(e);\n    if (e_level > max_level) {\n      max_level = e_level;\n    }\n  }\n\n  return max_level;\n}\n\nCSTableScan::ColumnRef::ColumnRef(\n    RefPtr<cstable::ColumnReader> r,\n    size_t i) :\n    reader(r),\n    index(i) {}\n\nCSTableScan::ExpressionRef::ExpressionRef(\n    size_t _rep_level,\n    ScopedPtr<ScalarExpression> _compiled,\n    ScratchMemory* smem) :\n    rep_level(_rep_level),\n    compiled(std::move(_compiled)),\n    instance(compiled->allocInstance(smem)) {}\n\nCSTableScan::ExpressionRef::ExpressionRef(\n    ExpressionRef&& other) :\n    rep_level(other.rep_level),\n    compiled(std::move(other.compiled)),\n    instance(other.instance) {\n  other.instance.scratch = nullptr;\n}\n\nCSTableScan::ExpressionRef::~ExpressionRef() {\n  if (instance.scratch) {\n    compiled->freeInstance(&instance);\n  }\n}\n\n} \/\/ namespace csql\n<commit_msg>CSTableScan...<commit_after>\/**\n * This file is part of the \"libfnord\" project\n *   Copyright (c) 2015 Paul Asmuth\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 <chartsql\/CSTableScan.h>\n#include <chartsql\/qtree\/ColumnReferenceNode.h>\n#include <chartsql\/runtime\/defaultruntime.h>\n#include <chartsql\/runtime\/compile.h>\n#include <fnord\/inspect.h>\n\nusing namespace fnord;\n\nnamespace csql {\n\nCSTableScan::CSTableScan(\n    RefPtr<SequentialScanNode> stmt,\n    cstable::CSTableReader&& cstable,\n    DefaultRuntime* runtime) :\n    cstable_(std::move(cstable)),\n    colindex_(0),\n    aggr_strategy_(stmt->aggregationStrategy()) {\n\n  Set<String> column_names;\n  for (const auto& slnode : stmt->selectList()) {\n    findColumns(slnode->expression(), &column_names);\n  }\n\n  for (const auto& col : column_names) {\n    columns_.emplace(col, ColumnRef(cstable_.getColumnReader(col), colindex_++));\n  }\n\n  for (auto& slnode : stmt->selectList()) {\n    resolveColumns(slnode->expression());\n  }\n\n  for (const auto& slnode : stmt->selectList()) {\n    select_list_.emplace_back(\n        findMaxRepetitionLevel(slnode->expression()),\n        runtime->buildScalarExpression(slnode->expression()),\n        &scratch_);\n  }\n}\n\nvoid CSTableScan::execute(\n    ExecutionContext* context,\n    Function<bool (int argc, const SValue* argv)> fn) {\n  uint64_t select_level = 0;\n  uint64_t fetch_level = 0;\n\n  Vector<SValue> in_row(colindex_, SValue{});\n  Vector<SValue> out_row(select_list_.size(), SValue{});\n\n  size_t num_records = 0;\n  size_t total_records = cstable_.numRecords();\n  while (num_records < total_records) {\n    uint64_t next_level = 0;\n\n    if (fetch_level == 0) {\n      ++num_records;\n    }\n\n    for (auto& col : columns_) {\n      auto nextr = col.second.reader->nextRepetitionLevel();\n\n      if (nextr >= fetch_level) {\n        auto& reader = col.second.reader;\n\n        uint64_t r;\n        uint64_t d;\n        void* data;\n        size_t size;\n        reader->next(&r, &d, &data, &size);\n\n        switch (col.second.reader->type()) {\n\n          case msg::FieldType::STRING:\n            in_row[col.second.index] =\n                SValue(SValue::StringType((char*) data, size));\n            break;\n\n          case msg::FieldType::UINT32:\n          case msg::FieldType::UINT64:\n            switch (size) {\n              case sizeof(uint32_t):\n                in_row[col.second.index] =\n                    SValue(SValue::IntegerType(*((uint32_t*) data)));\n                break;\n              case sizeof(uint64_t):\n                in_row[col.second.index] =\n                    SValue(SValue::IntegerType(*((uint64_t*) data)));\n                break;\n              case 0:\n                in_row[col.second.index] = SValue();\n                break;\n            }\n            break;\n\n          case msg::FieldType::BOOLEAN:\n            switch (size) {\n              case sizeof(uint32_t):\n                in_row[col.second.index] =\n                    SValue(SValue::BoolType(*((uint32_t*) data) > 0));\n                break;\n              case sizeof(uint64_t):\n                in_row[col.second.index] =\n                    SValue(SValue::BoolType(*((uint64_t*) data) > 0));\n                break;\n              case 0:\n                in_row[col.second.index] = SValue(SValue::BoolType(false));\n                break;\n            }\n            break;\n\n          case msg::FieldType::OBJECT:\n            RAISE(kIllegalStateError);\n\n        }\n      }\n\n      next_level = std::max(\n          next_level,\n          col.second.reader->nextRepetitionLevel());\n    }\n\n    fetch_level = next_level;\n\n    if (true) { \/\/ where clause\n      for (int i = 0; i < select_list_.size(); ++i) {\n        if (select_list_[i].rep_level >= select_level) {\n          select_list_[i].compiled->accumulate(\n              &select_list_[i].instance,\n              in_row.size(),\n              in_row.data());\n        }\n      }\n\n      switch (aggr_strategy_) {\n\n        case AggregationStrategy::AGGREGATE_ALL:\n          break;\n\n        case AggregationStrategy::AGGREGATE_WITHIN_RECORD:\n          if (next_level != 0) {\n            break;\n          }\n          \/* fallthrough *\/\n\n        case AggregationStrategy::NO_AGGREGATION:\n          for (int i = 0; i < select_list_.size(); ++i) {\n            select_list_[i].compiled->evaluate(\n                in_row.size(),\n                in_row.data(),\n                &out_row[i]);\n          }\n\n          if (!fn(out_row.size(), out_row.data())) {\n            return;\n          }\n\n          break;\n\n      }\n\n      select_level = fetch_level;\n    } else {\n      select_level = std::min(select_level, fetch_level);\n    }\n  }\n\n  switch (aggr_strategy_) {\n    case AggregationStrategy::AGGREGATE_ALL:\n      for (int i = 0; i < select_list_.size(); ++i) {\n        select_list_[i].compiled->result(\n            &select_list_[i].instance,\n            &out_row[i]);\n\n        select_list_[i].compiled->reset(&select_list_[i].instance);\n      }\n\n      fn(out_row.size(), out_row.data());\n      break;\n\n    default:\n      break;\n\n  }\n}\n\nvoid CSTableScan::findColumns(\n    RefPtr<ScalarExpressionNode> expr,\n    Set<String>* column_names) const {\n  auto fieldref = dynamic_cast<ColumnReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    column_names->emplace(fieldref->fieldName());\n  }\n\n  for (const auto& e : expr->arguments()) {\n    findColumns(e, column_names);\n  }\n}\n\nvoid CSTableScan::resolveColumns(RefPtr<ScalarExpressionNode> expr) const {\n  auto fieldref = dynamic_cast<ColumnReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    auto col = columns_.find(fieldref->fieldName());\n    if (col == columns_.end()) {\n      RAISE(kIllegalStateError);\n    }\n\n    fieldref->setColumnIndex(col->second.index);\n  }\n\n  for (const auto& e : expr->arguments()) {\n    resolveColumns(e);\n  }\n}\n\nuint64_t CSTableScan::findMaxRepetitionLevel(\n    RefPtr<ScalarExpressionNode> expr) const {\n  uint64_t max_level = 0;\n\n  auto fieldref = dynamic_cast<ColumnReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    auto col = columns_.find(fieldref->fieldName());\n    if (col == columns_.end()) {\n      RAISE(kIllegalStateError);\n    }\n\n    auto col_level = col->second.reader->maxRepetitionLevel();\n    if (col_level > max_level) {\n      max_level = col_level;\n    }\n  }\n\n  for (const auto& e : expr->arguments()) {\n    auto e_level = findMaxRepetitionLevel(e);\n    if (e_level > max_level) {\n      max_level = e_level;\n    }\n  }\n\n  return max_level;\n}\n\nCSTableScan::ColumnRef::ColumnRef(\n    RefPtr<cstable::ColumnReader> r,\n    size_t i) :\n    reader(r),\n    index(i) {}\n\nCSTableScan::ExpressionRef::ExpressionRef(\n    size_t _rep_level,\n    ScopedPtr<ScalarExpression> _compiled,\n    ScratchMemory* smem) :\n    rep_level(_rep_level),\n    compiled(std::move(_compiled)),\n    instance(compiled->allocInstance(smem)) {}\n\nCSTableScan::ExpressionRef::ExpressionRef(\n    ExpressionRef&& other) :\n    rep_level(other.rep_level),\n    compiled(std::move(other.compiled)),\n    instance(other.instance) {\n  other.instance.scratch = nullptr;\n}\n\nCSTableScan::ExpressionRef::~ExpressionRef() {\n  if (instance.scratch) {\n    compiled->freeInstance(&instance);\n  }\n}\n\n} \/\/ namespace csql\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the \"libfnord\" project\n *   Copyright (c) 2015 Paul Asmuth\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 <chartsql\/CSTableScan.h>\n#include <chartsql\/qtree\/FieldReferenceNode.h>\n#include <chartsql\/runtime\/defaultruntime.h>\n#include <chartsql\/runtime\/compile.h>\n#include <fnord\/inspect.h>\n\nusing namespace fnord;\n\nnamespace csql {\n\nCSTableScan::CSTableScan(\n    RefPtr<SelectProjectAggregateNode> stmt,\n    cstable::CSTableReader&& cstable) :\n    cstable_(std::move(cstable)),\n    colindex_(0) {\n\n  Set<String> column_names;\n  for (const auto& expr : stmt->selectList()) {\n    findColumns(expr, &column_names);\n  }\n\n  for (const auto& col : column_names) {\n    columns_.emplace(col, ColumnRef(cstable_.getColumnReader(col), colindex_++));\n  }\n\n  for (auto& expr : stmt->selectList()) {\n    resolveColumns(expr);\n  }\n\n  \/\/fnord::iputs(\"all cols: $0\", column_names);\n\n  DefaultRuntime runtime;\n\n  for (const auto& expr : stmt->selectList()) {\n    select_list_.emplace_back(\n        findMaxRepetitionLevel(expr),\n        runtime.compiler()->compile(expr),\n        &scratch_);\n  }\n}\n\nvoid CSTableScan::execute(Function<bool (int argc, const SValue* argv)> fn) {\n  uint64_t select_level = 0;\n  uint64_t fetch_level = 0;\n\n  Vector<SValue> in_row(colindex_, SValue{});\n  Vector<SValue> out_row(select_list_.size(), SValue{});\n\n  size_t num_records = 0;\n  size_t total_records = cstable_.numRecords();\n  while (num_records < total_records) {\n    uint64_t next_level = 0;\n\n    if (fetch_level == 0) {\n      ++num_records;\n    }\n\n    for (auto& col : columns_) {\n      if (col.second.reader->nextRepetitionLevel() >= fetch_level) {\n        uint64_t r;\n        uint64_t d;\n        void* data;\n        size_t size;\n        col.second.reader->next(&r, &d, &data, &size);\n        in_row[col.second.index] = SValue(\"fnord\");\n      }\n\n      next_level = std::max(next_level, col.second.reader->nextRepetitionLevel());\n    }\n\n    fetch_level = next_level;\n\n    if (true) { \/\/ where clause\n      for (int i = 0; i < select_list_.size(); ++i) {\n        if (select_list_[i].rep_level >= select_level) {\n          \/\/select_level_[i].compiled.accumulate();\n        }\n      }\n\n      for (int i = 0; i < select_list_.size(); ++i) {\n        select_list_[i].compiled->evaluate(\n            &select_list_[i].instance,\n            in_row.size(),\n            in_row.data(),\n            &out_row[i]);\n      }\n\n      if (!fn(out_row.size(), out_row.data())) {\n        return;\n      }\n\n      select_level = fetch_level;\n    } else {\n      select_level = std::min(select_level, fetch_level);\n    }\n  }\n}\n\nvoid CSTableScan::findColumns(\n    RefPtr<ScalarExpressionNode> expr,\n    Set<String>* column_names) const {\n  auto fieldref = dynamic_cast<FieldReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    column_names->emplace(fieldref->fieldName());\n  }\n\n  for (const auto& e : expr->arguments()) {\n    findColumns(e, column_names);\n  }\n}\n\nvoid CSTableScan::resolveColumns(RefPtr<ScalarExpressionNode> expr) const {\n  auto fieldref = dynamic_cast<FieldReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    auto col = columns_.find(fieldref->fieldName());\n    if (col == columns_.end()) {\n      RAISE(kIllegalStateError);\n    }\n\n    fieldref->setColumnIndex(col->second.index);\n  }\n\n  for (const auto& e : expr->arguments()) {\n    resolveColumns(e);\n  }\n}\n\nuint64_t CSTableScan::findMaxRepetitionLevel(\n    RefPtr<ScalarExpressionNode> expr) const {\n  uint64_t max_level = 0;\n\n  auto fieldref = dynamic_cast<FieldReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    auto col = columns_.find(fieldref->fieldName());\n    if (col == columns_.end()) {\n      RAISE(kIllegalStateError);\n    }\n\n    auto col_level = col->second.reader->maxRepetitionLevel();\n    if (col_level > max_level) {\n      max_level = col_level;\n    }\n  }\n\n  for (const auto& e : expr->arguments()) {\n    auto e_level = findMaxRepetitionLevel(e);\n    if (e_level > max_level) {\n      max_level = e_level;\n    }\n  }\n\n  return max_level;\n}\n\nCSTableScan::ColumnRef::ColumnRef(\n    RefPtr<cstable::ColumnReader> r,\n    size_t i) :\n    reader(r),\n    index(i) {}\n\nCSTableScan::ExpressionRef::ExpressionRef(\n    size_t _rep_level,\n    ScopedPtr<CompiledProgram> _compiled,\n    ScratchMemory* smem) :\n    rep_level(_rep_level),\n    compiled(std::move(_compiled)),\n    instance(compiled->allocInstance(smem)) {}\n\nCSTableScan::ExpressionRef::ExpressionRef(\n    ExpressionRef&& other) :\n    rep_level(other.rep_level),\n    compiled(std::move(other.compiled)),\n    instance(other.instance) {\n  other.instance.scratch = nullptr;\n}\n\nCSTableScan::ExpressionRef::~ExpressionRef() {\n  if (instance.scratch) {\n    compiled->freeInstance(&instance);\n  }\n}\n\n} \/\/ namespace csql\n<commit_msg>encode SValues in CSTableScan<commit_after>\/**\n * This file is part of the \"libfnord\" project\n *   Copyright (c) 2015 Paul Asmuth\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 <chartsql\/CSTableScan.h>\n#include <chartsql\/qtree\/FieldReferenceNode.h>\n#include <chartsql\/runtime\/defaultruntime.h>\n#include <chartsql\/runtime\/compile.h>\n#include <fnord\/inspect.h>\n\nusing namespace fnord;\n\nnamespace csql {\n\nCSTableScan::CSTableScan(\n    RefPtr<SelectProjectAggregateNode> stmt,\n    cstable::CSTableReader&& cstable) :\n    cstable_(std::move(cstable)),\n    colindex_(0) {\n\n  Set<String> column_names;\n  for (const auto& expr : stmt->selectList()) {\n    findColumns(expr, &column_names);\n  }\n\n  for (const auto& col : column_names) {\n    columns_.emplace(col, ColumnRef(cstable_.getColumnReader(col), colindex_++));\n  }\n\n  for (auto& expr : stmt->selectList()) {\n    resolveColumns(expr);\n  }\n\n  \/\/fnord::iputs(\"all cols: $0\", column_names);\n\n  DefaultRuntime runtime;\n\n  for (const auto& expr : stmt->selectList()) {\n    select_list_.emplace_back(\n        findMaxRepetitionLevel(expr),\n        runtime.compiler()->compile(expr),\n        &scratch_);\n  }\n}\n\nvoid CSTableScan::execute(Function<bool (int argc, const SValue* argv)> fn) {\n  uint64_t select_level = 0;\n  uint64_t fetch_level = 0;\n\n  Vector<SValue> in_row(colindex_, SValue{});\n  Vector<SValue> out_row(select_list_.size(), SValue{});\n\n  size_t num_records = 0;\n  size_t total_records = cstable_.numRecords();\n  while (num_records < total_records) {\n    uint64_t next_level = 0;\n\n    if (fetch_level == 0) {\n      ++num_records;\n    }\n\n    for (auto& col : columns_) {\n      if (col.second.reader->nextRepetitionLevel() >= fetch_level) {\n        auto& reader = col.second.reader;\n\n        uint64_t r;\n        uint64_t d;\n        void* data;\n        size_t size;\n        reader->next(&r, &d, &data, &size);\n\n        switch (col.second.reader->type()) {\n\n          case msg::FieldType::STRING:\n            in_row[col.second.index] =\n                SValue(SValue::StringType((char*) data, size));\n            break;\n\n          case msg::FieldType::UINT32:\n          case msg::FieldType::UINT64:\n            switch (size) {\n              case sizeof(uint32_t):\n                in_row[col.second.index] =\n                    SValue(SValue::IntegerType(*((uint32_t*) data)));\n                break;\n              case sizeof(uint64_t):\n                in_row[col.second.index] =\n                    SValue(SValue::IntegerType(*((uint64_t*) data)));\n                break;\n              case 0:\n                in_row[col.second.index] = SValue(SValue::IntegerType(0));\n                break;\n            }\n            break;\n\n          case msg::FieldType::BOOLEAN:\n            switch (size) {\n              case sizeof(uint32_t):\n                in_row[col.second.index] =\n                    SValue(SValue::BoolType(*((uint32_t*) data) > 0));\n                break;\n              case sizeof(uint64_t):\n                in_row[col.second.index] =\n                    SValue(SValue::BoolType(*((uint64_t*) data) > 0));\n                break;\n              case 0:\n                in_row[col.second.index] = SValue(SValue::BoolType(false));\n                break;\n            }\n            break;\n\n          case msg::FieldType::OBJECT:\n            RAISE(kIllegalStateError);\n\n        }\n\n      }\n\n      next_level = std::max(next_level, col.second.reader->nextRepetitionLevel());\n    }\n\n    fetch_level = next_level;\n\n    if (true) { \/\/ where clause\n      for (int i = 0; i < select_list_.size(); ++i) {\n        if (select_list_[i].rep_level >= select_level) {\n          \/\/select_level_[i].compiled.accumulate();\n        }\n      }\n\n      for (int i = 0; i < select_list_.size(); ++i) {\n        select_list_[i].compiled->evaluate(\n            &select_list_[i].instance,\n            in_row.size(),\n            in_row.data(),\n            &out_row[i]);\n      }\n\n      if (!fn(out_row.size(), out_row.data())) {\n        return;\n      }\n\n      select_level = fetch_level;\n    } else {\n      select_level = std::min(select_level, fetch_level);\n    }\n  }\n}\n\nvoid CSTableScan::findColumns(\n    RefPtr<ScalarExpressionNode> expr,\n    Set<String>* column_names) const {\n  auto fieldref = dynamic_cast<FieldReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    column_names->emplace(fieldref->fieldName());\n  }\n\n  for (const auto& e : expr->arguments()) {\n    findColumns(e, column_names);\n  }\n}\n\nvoid CSTableScan::resolveColumns(RefPtr<ScalarExpressionNode> expr) const {\n  auto fieldref = dynamic_cast<FieldReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    auto col = columns_.find(fieldref->fieldName());\n    if (col == columns_.end()) {\n      RAISE(kIllegalStateError);\n    }\n\n    fieldref->setColumnIndex(col->second.index);\n  }\n\n  for (const auto& e : expr->arguments()) {\n    resolveColumns(e);\n  }\n}\n\nuint64_t CSTableScan::findMaxRepetitionLevel(\n    RefPtr<ScalarExpressionNode> expr) const {\n  uint64_t max_level = 0;\n\n  auto fieldref = dynamic_cast<FieldReferenceNode*>(expr.get());\n  if (fieldref != nullptr) {\n    auto col = columns_.find(fieldref->fieldName());\n    if (col == columns_.end()) {\n      RAISE(kIllegalStateError);\n    }\n\n    auto col_level = col->second.reader->maxRepetitionLevel();\n    if (col_level > max_level) {\n      max_level = col_level;\n    }\n  }\n\n  for (const auto& e : expr->arguments()) {\n    auto e_level = findMaxRepetitionLevel(e);\n    if (e_level > max_level) {\n      max_level = e_level;\n    }\n  }\n\n  return max_level;\n}\n\nCSTableScan::ColumnRef::ColumnRef(\n    RefPtr<cstable::ColumnReader> r,\n    size_t i) :\n    reader(r),\n    index(i) {}\n\nCSTableScan::ExpressionRef::ExpressionRef(\n    size_t _rep_level,\n    ScopedPtr<CompiledProgram> _compiled,\n    ScratchMemory* smem) :\n    rep_level(_rep_level),\n    compiled(std::move(_compiled)),\n    instance(compiled->allocInstance(smem)) {}\n\nCSTableScan::ExpressionRef::ExpressionRef(\n    ExpressionRef&& other) :\n    rep_level(other.rep_level),\n    compiled(std::move(other.compiled)),\n    instance(other.instance) {\n  other.instance.scratch = nullptr;\n}\n\nCSTableScan::ExpressionRef::~ExpressionRef() {\n  if (instance.scratch) {\n    compiled->freeInstance(&instance);\n  }\n}\n\n} \/\/ namespace csql\n<|endoftext|>"}
{"text":"<commit_before>\/********** tell emacs we use -*- c++ -*- style comments *******************\n $Revision: 1.2 $  $Author: trey $  $Date: 2006-04-27 23:19:14 $\n\n @file    zmdpSolve.cc\n @brief   No brief\n\n Copyright (c) 2002-2006, Trey Smith.  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 * The software may not be sold or incorporated into a commercial\n   product without specific prior written permission.\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 <assert.h>\n#include <sys\/time.h>\n#include <getopt.h>\n\n#include <iostream>\n#include <fstream>\n\n#include \"zmdpCommonTime.h\"\n#include \"solverUtils.h\"\n\nusing namespace std;\nusing namespace MatrixUtils;\nusing namespace zmdp;\n\nstruct OutputParams {\n  const char* outFileName;\n  double timeoutSeconds;\n\n  OutputParams(void);\n};\n\nOutputParams::OutputParams(void) {\n  outFileName = \"out.policy\";\n  timeoutSeconds = -1;\n}\n\nbool userTerminatedG = false;\n\nvoid doSolve(const SolverParams& p, const OutputParams& op)\n{\n  StopWatch run;\n  init_matrix_utils();\n\n  printf(\"%05d reading model file and allocating data structures\\n\",\n\t (int) run.elapsedTime());\n  SolverObjects so;\n  constructSolverObjects(so, p);\n\n  if (!so.bounds->getSupportsPolicyOutput()) {\n    cerr << \"ERROR: with selected options, policy output is not supported:\" << endl;\n    cerr << \"  try adding '-v convex' and '--lower-bound' options\" << endl;\n    exit(EXIT_FAILURE);\n  }\n\n\n  \/\/ initialize the solver\n  printf(\"%05d calculating initial heuristics\\n\",\n\t (int) run.elapsedTime());\n  so.solver->planInit(so.sim->getModel(), p.targetPrecision);\n  printf(\"%05d finished initialization, beginning to improve policy\\n\",\n\t (int) run.elapsedTime());\n  \n  double lastPrintTime = -1000;\n  bool reachedTargetPrecision = false;\n  bool reachedTimeout = false;\n  int numSolverCalls = 0;\n  while (!(reachedTargetPrecision || reachedTimeout || userTerminatedG)) {\n    \/\/ make a call to the solver\n    reachedTargetPrecision =\n      so.solver->planFixedTime(so.sim->getModel()->getInitialState(),\n\t\t\t       \/* maxTime = *\/ -1, p.targetPrecision);\n    numSolverCalls++;\n\n    \/\/ check timeout\n    double elapsed = run.elapsedTime();\n    if (op.timeoutSeconds > 0 && elapsed >= op.timeoutSeconds) {\n      reachedTimeout = true;\n    }\n\n    \/\/ print a progress update every 10 seconds\n    if ((elapsed - lastPrintTime > 10)\n\t|| reachedTargetPrecision || reachedTimeout || userTerminatedG) {\n      ValueInterval intv = so.solver->getValueAt(so.sim->getModel()->getInitialState());\n      printf(\"%05d %6d calls to solver, bounds [%8.4f .. %8.4f], precision %g\\n\",\n\t     (int) elapsed, numSolverCalls, intv.l, intv.u, (intv.u - intv.l));\n      lastPrintTime = elapsed;\n    }\n  }\n\n  \/\/ say why the run ended\n  if (reachedTargetPrecision) {\n    printf(\"%05d terminating run; reached target precision of %g\\n\",\n\t   (int) run.elapsedTime(), p.targetPrecision);\n  } else if (reachedTimeout) {\n    printf(\"%05d terminating run; passed specified timeout of %g seconds\\n\",\n\t   (int) run.elapsedTime(), op.timeoutSeconds);\n  } else {\n    printf(\"%05d terminating run; caught SIGINT from user\\n\",\n\t   (int) run.elapsedTime());\n  }\n\n  \/\/ write out a policy\n  printf(\"%05d writing policy to '%s'\\n\", (int) run.elapsedTime(), op.outFileName);\n  so.bounds->writePolicy(op.outFileName);\n\n  printf(\"%05d done\\n\", (int) run.elapsedTime());\n}\n\nvoid usage(const char* cmdName) {\n  cerr <<\n    \"usage: \" << cmdName << \" OPTIONS <model>\\n\"\n    \"  -h or --help           Print this help\\n\"\n    \"  --version              Print version information (CFLAGS used at compilation)\\n\"\n    \"\\n\"\n    \"Solver options:\\n\"\n    \"  -s or --search         Specifies search strategy. Valid choices:\\n\"\n    \"                           rtdp, lrtdp, hdp, hsvi, frtdp [default: frtdp]\\n\"\n    \"  -t or --type           Specifies problem type. Valid choices:\\n\"\n    \"                           racetrack, pomdp [default: infer from model filename]\\n\"\n    \"  -v or --value          Specifies value function representation. Valid choices\\n\"\n    \"                         depend on problem type. With -t pomdp, choices are:\\n\"\n    \"                           point, convex [default: convex]\\n\"\n    \"                         For other problem types, choices are:\\n\"\n    \"                           point [default: point]\\n\"\n    \"  -f or --fast           Use fast (but very picky) alternate POMDP parser\\n\"\n    \"  -p or --precision      Set target precision in solution quality; run ends when\\n\"\n    \"                           target is reached [default: 1e-3]\\n\"\n    \"  --weak-heuristic       Avoid spending time generating a good upper bound heuristic\\n\"\n    \"                           (only valid for some problems, interpretation depends on\\n\"\n    \"                            the problem; e.g. sets h_U = 0 for racetrack)\\n\"\n    \"  --lower-bound          Forces zmdpSolve to maintain a lower bound and use it for\\n\"\n    \"                           action selection, even if it is not used during search.\\n\"\n    \"  --upper-bound          Forces zmdpSolve to use the upper bound for action selection\\n\"\n    \"                           (normally the lower bound is used if it is available).\\n\"\n    \"\\n\"\n    \"Policy output options:\\n\"\n    \"  -o or --output         Specifies name of policy output file [default: 'out.policy']\\n\"\n    \"  --timeout              Specifies a timeout in seconds.  If running time exceeds\\n\"\n    \"                           the specified value, zmdpSolve writes out a policy\\n\"\n    \"                           and terminates [default: no maximum]\\n\"\n    \"\\n\"\n    \"Examples:\\n\"\n    \"  \" << cmdName << \" RockSample_4_4.pomdp\\n\"\n    \"  \" << cmdName << \" large-b.racetrack\\n\"\n    \"  \" << cmdName << \" --timeout 60 --output my.policy RockSample_4_4.pomdp\\n\"\n    \"  \" << cmdName << \" --search lrtdp --value point RockSample_4_4.pomdp\\n\"\n    \"  \" << cmdName << \" -f RockSample_5_7.pomdp\\n\"\n    \"\\n\"\n;\n  exit(-1);\n}\n\nint main(int argc, char **argv) {\n  static char shortOptions[] = \"hs:t:v:fo:\";\n  static struct option longOptions[]={\n    {\"help\",          0,NULL,'h'},\n    {\"version\",       0,NULL,'V'},\n    {\"search\",        1,NULL,'s'},\n    {\"type\",          1,NULL,'t'},\n    {\"value\",         1,NULL,'v'},\n    {\"fast\",          0,NULL,'f'},\n    {\"precision\",     1,NULL,'p'},\n    {\"weak-heuristic\",0,NULL,'W'},\n    {\"lower-bound\",   0,NULL,'L'},\n    {\"upper-bound\",   0,NULL,'U'},\n    {\"output\",        1,NULL,'o'},\n    {\"timeout\",       1,NULL,'T'},\n    {NULL,0,0,0}\n  };\n\n  SolverParams p;\n  OutputParams op;\n\n#if USE_DEBUG_PRINT\n  \/\/ save arguments for debug printout later\n  ostringstream outs;\n  for (int i=1; i < argc; i++) {\n    outs << argv[i] << \" \";\n  }\n#endif\n\n  p.cmdName = argv[0];\n  while (1) {\n    char optchar = getopt_long(argc,argv,shortOptions,longOptions,NULL);\n    if (optchar == -1) break;\n\n    switch (optchar) {\n    case 'h': \/\/ help\n      usage(argv[0]);\n      break;\n    case 'V': \/\/ version\n      cout << \"CFLAGS = \" << CFLAGS << endl;\n      exit(EXIT_SUCCESS);\n      break;\n    case 's': \/\/ search\n      p.setStrategy(optarg);\n      break;\n    case 't': \/\/ type\n      p.setProbType(optarg);\n      break;\n    case 'v': \/\/ value\n      p.setValueRepr(optarg);\n      break;\n    case 'f': \/\/ fast\n      p.useFastParser = true;\n      break;\n    case 'p': \/\/ precision\n      p.targetPrecision = atof(optarg);\n      break;\n    case 'W': \/\/ weak-heuristic\n      p.useHeuristic = false;\n      break;\n    case 'L': \/\/ lower-bound\n      p.forceLowerBound = true;\n      break;\n    case 'U': \/\/ upper-bound\n      p.forceUpperBoundActionSelection = true;\n      break;\n    case 'o': \/\/ output\n      op.outFileName = optarg;\n      break;\n    case 'T': \/\/ timeout\n      op.timeoutSeconds = atof(optarg);\n      break;\n\n    case '?': \/\/ unknown option\n    case ':': \/\/ option with missing parameter\n      \/\/ getopt() prints an informative error message\n      cerr << endl;\n      usage(argv[0]);\n      break;\n    default:\n      abort(); \/\/ never reach this point\n    }\n  }\n  if (argc-optind != 1) {\n    cerr << \"ERROR: wrong number of arguments (should be 1)\" << endl << endl;\n    usage(argv[0]);\n  }\n\n  p.probName = argv[optind++];\n  p.inferMissingValues();\n\n#if USE_DEBUG_PRINT\n  printf(\"CFLAGS = %s\\n\", CFLAGS);\n  printf(\"ARGS = %s\\n\", outs.str().c_str());\n  fflush(stdout);\n#endif\n\n  doSolve(p, op);\n\n  return 0;\n}\n\n\/***************************************************************************\n * REVISION HISTORY:\n * $Log: not supported by cvs2svn $\n * Revision 1.1  2006\/04\/27 23:07:24  trey\n * initial check-in\n *\n *\n ***************************************************************************\/\n<commit_msg>improved error diagnostic for policy output<commit_after>\/********** tell emacs we use -*- c++ -*- style comments *******************\n $Revision: 1.3 $  $Author: trey $  $Date: 2006-04-27 23:42:54 $\n\n @file    zmdpSolve.cc\n @brief   No brief\n\n Copyright (c) 2002-2006, Trey Smith.  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 * The software may not be sold or incorporated into a commercial\n   product without specific prior written permission.\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 <assert.h>\n#include <sys\/time.h>\n#include <getopt.h>\n\n#include <iostream>\n#include <fstream>\n\n#include \"zmdpCommonTime.h\"\n#include \"solverUtils.h\"\n\nusing namespace std;\nusing namespace MatrixUtils;\nusing namespace zmdp;\n\nstruct OutputParams {\n  const char* outFileName;\n  double timeoutSeconds;\n\n  OutputParams(void);\n};\n\nOutputParams::OutputParams(void) {\n  outFileName = \"out.policy\";\n  timeoutSeconds = -1;\n}\n\nbool userTerminatedG = false;\n\nvoid doSolve(const SolverParams& p, const OutputParams& op)\n{\n  StopWatch run;\n  init_matrix_utils();\n\n  printf(\"%05d reading model file and allocating data structures\\n\",\n\t (int) run.elapsedTime());\n  SolverObjects so;\n  constructSolverObjects(so, p);\n\n  if (!so.bounds->getSupportsPolicyOutput()) {\n    cerr << \"ERROR: with selected options, policy output is not supported:\" << endl;\n    cerr << \"  in order to enable policy output, problem must be a POMDP; if\" << endl;\n    cout << \"  it is, try adding the '-v convex' and '--lower-bound' options\" << endl;\n    exit(EXIT_FAILURE);\n  }\n\n  \/\/ initialize the solver\n  printf(\"%05d calculating initial heuristics\\n\",\n\t (int) run.elapsedTime());\n  so.solver->planInit(so.sim->getModel(), p.targetPrecision);\n  printf(\"%05d finished initialization, beginning to improve policy\\n\",\n\t (int) run.elapsedTime());\n  \n  double lastPrintTime = -1000;\n  bool reachedTargetPrecision = false;\n  bool reachedTimeout = false;\n  int numSolverCalls = 0;\n  while (!(reachedTargetPrecision || reachedTimeout || userTerminatedG)) {\n    \/\/ make a call to the solver\n    reachedTargetPrecision =\n      so.solver->planFixedTime(so.sim->getModel()->getInitialState(),\n\t\t\t       \/* maxTime = *\/ -1, p.targetPrecision);\n    numSolverCalls++;\n\n    \/\/ check timeout\n    double elapsed = run.elapsedTime();\n    if (op.timeoutSeconds > 0 && elapsed >= op.timeoutSeconds) {\n      reachedTimeout = true;\n    }\n\n    \/\/ print a progress update every 10 seconds\n    if ((elapsed - lastPrintTime > 10)\n\t|| reachedTargetPrecision || reachedTimeout || userTerminatedG) {\n      ValueInterval intv = so.solver->getValueAt(so.sim->getModel()->getInitialState());\n      printf(\"%05d %6d calls to solver, bounds [%8.4f .. %8.4f], precision %g\\n\",\n\t     (int) elapsed, numSolverCalls, intv.l, intv.u, (intv.u - intv.l));\n      lastPrintTime = elapsed;\n    }\n  }\n\n  \/\/ say why the run ended\n  if (reachedTargetPrecision) {\n    printf(\"%05d terminating run; reached target precision of %g\\n\",\n\t   (int) run.elapsedTime(), p.targetPrecision);\n  } else if (reachedTimeout) {\n    printf(\"%05d terminating run; passed specified timeout of %g seconds\\n\",\n\t   (int) run.elapsedTime(), op.timeoutSeconds);\n  } else {\n    printf(\"%05d terminating run; caught SIGINT from user\\n\",\n\t   (int) run.elapsedTime());\n  }\n\n  \/\/ write out a policy\n  printf(\"%05d writing policy to '%s'\\n\", (int) run.elapsedTime(), op.outFileName);\n  so.bounds->writePolicy(op.outFileName);\n\n  printf(\"%05d done\\n\", (int) run.elapsedTime());\n}\n\nvoid usage(const char* cmdName) {\n  cerr <<\n    \"usage: \" << cmdName << \" OPTIONS <model>\\n\"\n    \"  -h or --help           Print this help\\n\"\n    \"  --version              Print version information (CFLAGS used at compilation)\\n\"\n    \"\\n\"\n    \"Solver options:\\n\"\n    \"  -s or --search         Specifies search strategy. Valid choices:\\n\"\n    \"                           rtdp, lrtdp, hdp, hsvi, frtdp [default: frtdp]\\n\"\n    \"  -t or --type           Specifies problem type. Valid choices:\\n\"\n    \"                           racetrack, pomdp [default: infer from model filename]\\n\"\n    \"  -v or --value          Specifies value function representation. Valid choices\\n\"\n    \"                         depend on problem type. With -t pomdp, choices are:\\n\"\n    \"                           point, convex [default: convex]\\n\"\n    \"                         For other problem types, choices are:\\n\"\n    \"                           point [default: point]\\n\"\n    \"  -f or --fast           Use fast (but very picky) alternate POMDP parser\\n\"\n    \"  -p or --precision      Set target precision in solution quality; run ends when\\n\"\n    \"                           target is reached [default: 1e-3]\\n\"\n    \"  --weak-heuristic       Avoid spending time generating a good upper bound heuristic\\n\"\n    \"                           (only valid for some problems, interpretation depends on\\n\"\n    \"                            the problem; e.g. sets h_U = 0 for racetrack)\\n\"\n    \"  --lower-bound          Forces zmdpSolve to maintain a lower bound and use it for\\n\"\n    \"                           action selection, even if it is not used during search.\\n\"\n    \"  --upper-bound          Forces zmdpSolve to use the upper bound for action selection\\n\"\n    \"                           (normally the lower bound is used if it is available).\\n\"\n    \"\\n\"\n    \"Policy output options:\\n\"\n    \"  -o or --output         Specifies name of policy output file [default: 'out.policy']\\n\"\n    \"  --timeout              Specifies a timeout in seconds.  If running time exceeds\\n\"\n    \"                           the specified value, zmdpSolve writes out a policy\\n\"\n    \"                           and terminates [default: no maximum]\\n\"\n    \"\\n\"\n    \"Examples:\\n\"\n    \"  \" << cmdName << \" RockSample_4_4.pomdp\\n\"\n    \"  \" << cmdName << \" large-b.racetrack\\n\"\n    \"  \" << cmdName << \" --timeout 60 --output my.policy RockSample_4_4.pomdp\\n\"\n    \"  \" << cmdName << \" --search lrtdp --value point RockSample_4_4.pomdp\\n\"\n    \"  \" << cmdName << \" -f RockSample_5_7.pomdp\\n\"\n    \"\\n\"\n;\n  exit(-1);\n}\n\nint main(int argc, char **argv) {\n  static char shortOptions[] = \"hs:t:v:fo:\";\n  static struct option longOptions[]={\n    {\"help\",          0,NULL,'h'},\n    {\"version\",       0,NULL,'V'},\n    {\"search\",        1,NULL,'s'},\n    {\"type\",          1,NULL,'t'},\n    {\"value\",         1,NULL,'v'},\n    {\"fast\",          0,NULL,'f'},\n    {\"precision\",     1,NULL,'p'},\n    {\"weak-heuristic\",0,NULL,'W'},\n    {\"lower-bound\",   0,NULL,'L'},\n    {\"upper-bound\",   0,NULL,'U'},\n    {\"output\",        1,NULL,'o'},\n    {\"timeout\",       1,NULL,'T'},\n    {NULL,0,0,0}\n  };\n\n  SolverParams p;\n  OutputParams op;\n\n#if USE_DEBUG_PRINT\n  \/\/ save arguments for debug printout later\n  ostringstream outs;\n  for (int i=1; i < argc; i++) {\n    outs << argv[i] << \" \";\n  }\n#endif\n\n  p.cmdName = argv[0];\n  while (1) {\n    char optchar = getopt_long(argc,argv,shortOptions,longOptions,NULL);\n    if (optchar == -1) break;\n\n    switch (optchar) {\n    case 'h': \/\/ help\n      usage(argv[0]);\n      break;\n    case 'V': \/\/ version\n      cout << \"CFLAGS = \" << CFLAGS << endl;\n      exit(EXIT_SUCCESS);\n      break;\n    case 's': \/\/ search\n      p.setStrategy(optarg);\n      break;\n    case 't': \/\/ type\n      p.setProbType(optarg);\n      break;\n    case 'v': \/\/ value\n      p.setValueRepr(optarg);\n      break;\n    case 'f': \/\/ fast\n      p.useFastParser = true;\n      break;\n    case 'p': \/\/ precision\n      p.targetPrecision = atof(optarg);\n      break;\n    case 'W': \/\/ weak-heuristic\n      p.useHeuristic = false;\n      break;\n    case 'L': \/\/ lower-bound\n      p.forceLowerBound = true;\n      break;\n    case 'U': \/\/ upper-bound\n      p.forceUpperBoundActionSelection = true;\n      break;\n    case 'o': \/\/ output\n      op.outFileName = optarg;\n      break;\n    case 'T': \/\/ timeout\n      op.timeoutSeconds = atof(optarg);\n      break;\n\n    case '?': \/\/ unknown option\n    case ':': \/\/ option with missing parameter\n      \/\/ getopt() prints an informative error message\n      cerr << endl;\n      usage(argv[0]);\n      break;\n    default:\n      abort(); \/\/ never reach this point\n    }\n  }\n  if (argc-optind != 1) {\n    cerr << \"ERROR: wrong number of arguments (should be 1)\" << endl << endl;\n    usage(argv[0]);\n  }\n\n  p.probName = argv[optind++];\n  p.inferMissingValues();\n\n#if USE_DEBUG_PRINT\n  printf(\"CFLAGS = %s\\n\", CFLAGS);\n  printf(\"ARGS = %s\\n\", outs.str().c_str());\n  fflush(stdout);\n#endif\n\n  doSolve(p, op);\n\n  return 0;\n}\n\n\/***************************************************************************\n * REVISION HISTORY:\n * $Log: not supported by cvs2svn $\n * Revision 1.2  2006\/04\/27 23:19:14  trey\n * removed unnecessary #include of Interleave.h\n *\n * Revision 1.1  2006\/04\/27 23:07:24  trey\n * initial check-in\n *\n *\n ***************************************************************************\/\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"..\/Flare.h\"\n#include \"FlareGame.h\"\n#include \"FlareDebrisField.h\"\n#include \"FlareSimulatedSector.h\"\n\n#include \"StaticMeshResources.h\"\n\n\n#define LOCTEXT_NAMESPACE \"FlareDebrisField\"\n\n\n\/*----------------------------------------------------\n\tConstructor\n----------------------------------------------------*\/\n\nUFlareDebrisField::UFlareDebrisField(const FObjectInitializer& ObjectInitializer)\n\t: Super(ObjectInitializer)\n{\n\tCurrentGenerationIndex = 0;\n}\n\nvoid UFlareDebrisField::Setup(AFlareGame* GameMode, UFlareSimulatedSector* Sector)\n{\n\tcheck(Sector);\n\tcheck(GameMode);\n\n\t\/\/ Get debris field parameters\n\tGame = GameMode;\n\tconst FFlareDebrisFieldInfo* DebrisFieldInfo = &Sector->GetDescription()->DebrisFieldInfo;\n\tUFlareAsteroidCatalog* DebrisFieldMeshes = DebrisFieldInfo->DebrisCatalog;\n\tTArray<AStaticMeshActor*> NewDebris;\n\n\t\/\/ Add debris\n\tif (DebrisFieldInfo)\n\t{\n\t\tfloat SectorScale = 5000 * 100;\n\t\tint32 DebrisCount = 100 * DebrisFieldInfo->DebrisFieldDensity;\n\t\tFLOGV(\"UFlareDebrisField::Setup : spawning debris field : gen %d, size = %d, icy = %d\", CurrentGenerationIndex, DebrisCount, Sector->GetDescription()->IsIcy);\n\n\t\tfor (int32 Index = 0; Index < DebrisCount; Index++)\n\t\t{\n\t\t\tint32 DebrisIndex = FMath::RandRange(0, DebrisFieldMeshes->Asteroids.Num() - 1);\n\n\t\t\tfloat MinSize = DebrisFieldInfo->MinDebrisSize;\n\t\t\tfloat MaxSize = DebrisFieldInfo->MaxDebrisSize;\n\t\t\tfloat Size = FMath::FRandRange(MinSize, MaxSize);\n\n\t\t\tFName Name = FName(*(FString::Printf(TEXT(\"DebrisGen%dIndex%d\"), CurrentGenerationIndex, Index)));\n\n\t\t\tNewDebris.Add(AddDebris(Sector, DebrisFieldMeshes->Asteroids[DebrisIndex], Size, SectorScale, Name));\n\t\t}\n\t}\n\n\t\/\/ Remember new debris\n\tDebrisField.Empty();\n\tfor (int DebrisIndex = 0; DebrisIndex < NewDebris.Num(); DebrisIndex++)\n\t{\n\t\tif (NewDebris[DebrisIndex])\n\t\t{\n\t\t\tDebrisField.Add(NewDebris[DebrisIndex]);\n\t\t}\n\t}\n\n\tCurrentGenerationIndex++;\n\tFLOGV(\"UFlareDebrisField::Setup : done spawning debris field, size = %d\", DebrisField.Num());\n}\n\nvoid UFlareDebrisField::Reset()\n{\n\tFLOGV(\"UFlareDebrisField::Reset : clearing debris field, size = %d\", DebrisField.Num());\n\tfor (int i = 0; i < DebrisField.Num(); i++)\n\t{\n\t\tGame->GetWorld()->DestroyActor(DebrisField[i]);\n\t}\n\tDebrisField.Empty();\n}\n\nvoid UFlareDebrisField::SetWorldPause(bool Pause)\n{\n\tfor (int i = 0; i < DebrisField.Num(); i++)\n\t{\n\t\tDebrisField[i]->SetActorHiddenInGame(Pause);\n\t\tDebrisField[i]->CustomTimeDilation = (Pause ? 0.f : 1.0);\n\t\tCast<UPrimitiveComponent>(DebrisField[i]->GetRootComponent())->SetSimulatePhysics(!Pause);\n\t}\n}\n\n\n\/*----------------------------------------------------\n\tInternals\n----------------------------------------------------*\/\n\nAStaticMeshActor* UFlareDebrisField::AddDebris(UFlareSimulatedSector* Sector, UStaticMesh* Mesh, float Size, float SectorScale, FName Name)\n{\n\tFActorSpawnParameters Params;\n\tParams.Name = Name;\n\tParams.Owner = Game;\n\tParams.bNoFail = false;\n\tParams.SpawnCollisionHandlingOverride = ESpawnActorCollisionHandlingMethod::DontSpawnIfColliding;\n\n\t\/\/ Compute size, location and rotation\n\tFVector Location = FMath::VRand() * SectorScale * FMath::FRandRange(0.2, 1.0);\n\tFRotator Rotation = FRotator(FMath::FRandRange(0, 360), FMath::FRandRange(0, 360), FMath::FRandRange(0, 360));\n\n\t\/\/ Spawn\n\tAStaticMeshActor* DebrisMesh = Game->GetWorld()->SpawnActor<AStaticMeshActor>(AStaticMeshActor::StaticClass(), Location, Rotation, Params);\n\tif (DebrisMesh)\n\t{\n\t\tDebrisMesh->SetMobility(EComponentMobility::Movable);\n\t\tDebrisMesh->SetActorScale3D(Size * FVector(1, 1, 1));\n\t\tDebrisMesh->SetActorEnableCollision(true);\n\n\t\t\/\/ Setup\n\t\tUStaticMeshComponent* DebrisComponent = DebrisMesh->GetStaticMeshComponent();\n\t\tif (DebrisComponent)\n\t\t{\n\t\t\tDebrisComponent->SetStaticMesh(Mesh);\n\t\t\tDebrisComponent->SetSimulatePhysics(true);\n\t\t\tDebrisComponent->SetCollisionProfileName(\"BlockAllDynamic\");\n\n\t\t\t\/\/ Set material\n\t\t\tUMaterialInstanceDynamic* DebrisMaterial = UMaterialInstanceDynamic::Create(DebrisComponent->GetMaterial(0), DebrisComponent->GetWorld());\n\t\t\tif (DebrisMaterial)\n\t\t\t{\n\t\t\t\tDebrisComponent->SetMaterial(0, DebrisMaterial);\n\t\t\t\tDebrisMaterial->SetScalarParameterValue(\"IceMask\", Sector->GetDescription()->IsIcy);\n\t\t\t\tFLOGV(\"UFlareDebrisField::AddDebris : updated icy set %d\", Sector->GetDescription()->IsIcy);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tFLOG(\"UFlareDebrisField::AddDebris : failed to set material (no material or mesh)\")\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tFLOG(\"UFlareDebrisField::AddDebris : failed to spawn debris\")\n\t}\n\n\treturn DebrisMesh;\n}\n\n\n#undef LOCTEXT_NAMESPACE\n<commit_msg>Removed spamming logs<commit_after>\n#include \"..\/Flare.h\"\n#include \"FlareGame.h\"\n#include \"FlareDebrisField.h\"\n#include \"FlareSimulatedSector.h\"\n\n#include \"StaticMeshResources.h\"\n\n\n#define LOCTEXT_NAMESPACE \"FlareDebrisField\"\n\n\n\/*----------------------------------------------------\n\tConstructor\n----------------------------------------------------*\/\n\nUFlareDebrisField::UFlareDebrisField(const FObjectInitializer& ObjectInitializer)\n\t: Super(ObjectInitializer)\n{\n\tCurrentGenerationIndex = 0;\n}\n\nvoid UFlareDebrisField::Setup(AFlareGame* GameMode, UFlareSimulatedSector* Sector)\n{\n\tcheck(Sector);\n\tcheck(GameMode);\n\n\t\/\/ Get debris field parameters\n\tGame = GameMode;\n\tconst FFlareDebrisFieldInfo* DebrisFieldInfo = &Sector->GetDescription()->DebrisFieldInfo;\n\tUFlareAsteroidCatalog* DebrisFieldMeshes = DebrisFieldInfo->DebrisCatalog;\n\tTArray<AStaticMeshActor*> NewDebris;\n\n\t\/\/ Add debris\n\tif (DebrisFieldInfo)\n\t{\n\t\tfloat SectorScale = 5000 * 100;\n\t\tint32 DebrisCount = 100 * DebrisFieldInfo->DebrisFieldDensity;\n\t\tFLOGV(\"UFlareDebrisField::Setup : spawning debris field : gen %d, size = %d, icy = %d\", CurrentGenerationIndex, DebrisCount, Sector->GetDescription()->IsIcy);\n\n\t\tfor (int32 Index = 0; Index < DebrisCount; Index++)\n\t\t{\n\t\t\tint32 DebrisIndex = FMath::RandRange(0, DebrisFieldMeshes->Asteroids.Num() - 1);\n\n\t\t\tfloat MinSize = DebrisFieldInfo->MinDebrisSize;\n\t\t\tfloat MaxSize = DebrisFieldInfo->MaxDebrisSize;\n\t\t\tfloat Size = FMath::FRandRange(MinSize, MaxSize);\n\n\t\t\tFName Name = FName(*(FString::Printf(TEXT(\"DebrisGen%dIndex%d\"), CurrentGenerationIndex, Index)));\n\n\t\t\tNewDebris.Add(AddDebris(Sector, DebrisFieldMeshes->Asteroids[DebrisIndex], Size, SectorScale, Name));\n\t\t}\n\t}\n\n\t\/\/ Remember new debris\n\tDebrisField.Empty();\n\tfor (int DebrisIndex = 0; DebrisIndex < NewDebris.Num(); DebrisIndex++)\n\t{\n\t\tif (NewDebris[DebrisIndex])\n\t\t{\n\t\t\tDebrisField.Add(NewDebris[DebrisIndex]);\n\t\t}\n\t}\n\n\tCurrentGenerationIndex++;\n}\n\nvoid UFlareDebrisField::Reset()\n{\n\tFLOGV(\"UFlareDebrisField::Reset : clearing debris field, size = %d\", DebrisField.Num());\n\tfor (int i = 0; i < DebrisField.Num(); i++)\n\t{\n\t\tGame->GetWorld()->DestroyActor(DebrisField[i]);\n\t}\n\tDebrisField.Empty();\n}\n\nvoid UFlareDebrisField::SetWorldPause(bool Pause)\n{\n\tfor (int i = 0; i < DebrisField.Num(); i++)\n\t{\n\t\tDebrisField[i]->SetActorHiddenInGame(Pause);\n\t\tDebrisField[i]->CustomTimeDilation = (Pause ? 0.f : 1.0);\n\t\tCast<UPrimitiveComponent>(DebrisField[i]->GetRootComponent())->SetSimulatePhysics(!Pause);\n\t}\n}\n\n\n\/*----------------------------------------------------\n\tInternals\n----------------------------------------------------*\/\n\nAStaticMeshActor* UFlareDebrisField::AddDebris(UFlareSimulatedSector* Sector, UStaticMesh* Mesh, float Size, float SectorScale, FName Name)\n{\n\tFActorSpawnParameters Params;\n\tParams.Name = Name;\n\tParams.Owner = Game;\n\tParams.bNoFail = false;\n\tParams.SpawnCollisionHandlingOverride = ESpawnActorCollisionHandlingMethod::DontSpawnIfColliding;\n\n\t\/\/ Compute size, location and rotation\n\tFVector Location = FMath::VRand() * SectorScale * FMath::FRandRange(0.2, 1.0);\n\tFRotator Rotation = FRotator(FMath::FRandRange(0, 360), FMath::FRandRange(0, 360), FMath::FRandRange(0, 360));\n\n\t\/\/ Spawn\n\tAStaticMeshActor* DebrisMesh = Game->GetWorld()->SpawnActor<AStaticMeshActor>(AStaticMeshActor::StaticClass(), Location, Rotation, Params);\n\tif (DebrisMesh)\n\t{\n\t\tDebrisMesh->SetMobility(EComponentMobility::Movable);\n\t\tDebrisMesh->SetActorScale3D(Size * FVector(1, 1, 1));\n\t\tDebrisMesh->SetActorEnableCollision(true);\n\n\t\t\/\/ Setup\n\t\tUStaticMeshComponent* DebrisComponent = DebrisMesh->GetStaticMeshComponent();\n\t\tif (DebrisComponent)\n\t\t{\n\t\t\tDebrisComponent->SetStaticMesh(Mesh);\n\t\t\tDebrisComponent->SetSimulatePhysics(true);\n\t\t\tDebrisComponent->SetCollisionProfileName(\"BlockAllDynamic\");\n\n\t\t\t\/\/ Set material\n\t\t\tUMaterialInstanceDynamic* DebrisMaterial = UMaterialInstanceDynamic::Create(DebrisComponent->GetMaterial(0), DebrisComponent->GetWorld());\n\t\t\tif (DebrisMaterial)\n\t\t\t{\n\t\t\t\tDebrisComponent->SetMaterial(0, DebrisMaterial);\n\t\t\t\tDebrisMaterial->SetScalarParameterValue(\"IceMask\", Sector->GetDescription()->IsIcy);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tFLOG(\"UFlareDebrisField::AddDebris : failed to set material (no material or mesh)\")\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tFLOG(\"UFlareDebrisField::AddDebris : failed to spawn debris\")\n\t}\n\n\treturn DebrisMesh;\n}\n\n\n#undef LOCTEXT_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  Created by Robert Segal on 2014-04-01.\n\/\/  Copyright (c) 2016 Get Set Games Inc. All rights reserved.\n\/\/\n\n#include \"UpsightPrivatePCH.h\"\n#include \"CallbackDevice.h\"\n\n#if PLATFORM_IOS\n#import <UpsightKit\/UpsightKit.h>\n#endif\n\n#if PLATFORM_IOS\n\n@interface UUpsightComponentDelegate : NSObject <USBillboardDelegate>\n-(UIViewController *)presentingViewControllerForBillboard:(id<USBillboard>)aBillboard;\n@end\n\nstatic UUpsightComponentDelegate* ucd;\n\n@implementation UUpsightComponentDelegate\n\n+(void)load\n{\n    if (!ucd)\n    {\n        ucd = [[UUpsightComponentDelegate alloc] init];\n    }\n}\n\n-(id)init\n{\n    self = [super init];\n    \n    if (self)\n    {\n        [[NSNotificationCenter defaultCenter] addObserver:self\n                                                 selector:@selector(applicationDidFinishLaunching:)\n                                                     name:UIApplicationDidFinishLaunchingNotification\n                                                   object:nil];\n    }\n    \n    return self;\n}\n\n-(void)dealloc\n{\n    [[NSNotificationCenter defaultCenter] removeObserver:self];\n    [super dealloc];\n}\n\n-(void)applicationDidFinishLaunching:(NSNotification *)n\n{\n    NSDictionary *dLaunchOptionsUrl = n.userInfo[@\"UIApplicationLaunchOptionsURLKey\"];\n    \n    if (!dLaunchOptionsUrl)\n    {\n        [USPush registerForPushNotifications];\n    }\n}\n\n-(UIViewController *)presentingViewControllerForBillboard:(id<USBillboard>)aBillboard\n{\n    UIViewController *topController = [UIApplication sharedApplication].keyWindow.rootViewController;\n    \n    while (topController.presentedViewController) {\n        topController = topController.presentedViewController;\n    }\n    \n    return topController;\n}\n\n@end\n\n#endif\n\nvoid UUpsightComponent::OnRegister()\n{\n\tSuper::OnRegister();\n    \n    FCoreDelegates::ApplicationRegisteredForRemoteNotificationsDelegate.AddUObject(this, &UUpsightComponent::ApplicationRegisteredForRemoteNotifications_Handler);\n    FCoreDelegates::ApplicationRegisteredForUserNotificationsDelegate.AddUObject(this, &UUpsightComponent::ApplicationRegisteredForUserNotificationsDelegate_Handler);\n    FCoreDelegates::ApplicationFailedToRegisterForRemoteNotificationsDelegate.AddUObject(this, &UUpsightComponent::ApplicationFailedToRegisterForRemoteNotifications_Handler);\n    FCoreDelegates::ApplicationReceivedRemoteNotificationDelegate.AddUObject(this, &UUpsightComponent::ApplicationReceivedRemoteNotification_Handler);\n}\n\nvoid UUpsightComponent::OnUnregister()\n{\n\tSuper::OnUnregister();\n}\n\nvoid UUpsightComponent::ApplicationRegisteredForUserNotificationsDelegate_Handler(int32 inInt)\n{\n#if PLATFORM_IOS\n    UIUserNotificationSettings *notificationSettings = (UIUserNotificationSettings *)inInt;\n    \n    [USPush didRegisterUserNotificationSettings:notificationSettings];\n#endif\n}\n\nvoid UUpsightComponent::ApplicationRegisteredForRemoteNotifications_Handler(TArray<uint8> Token)\n{\n#if PLATFORM_IOS\n    NSData* TokenData = [NSData dataWithBytes:Token.GetData() length:Token.Num()];\n    \n    [USPush registerPushToken:TokenData];\n#endif\n}\n\nvoid UUpsightComponent::ApplicationFailedToRegisterForRemoteNotifications_Handler(FString RegisterError)\n{\n    UE_LOG(LogUpsight, Error, TEXT(\"ApplicationFailedToRegisterForRemoteNotifications: %s\"), *RegisterError);\n}\n\nvoid UUpsightComponent::ApplicationReceivedRemoteNotification_Handler(FString Json)\n{\n#if PLATFORM_IOS\n    [USPush pushBillboard].delegate = ucd;\n    \n    NSDictionary *userInfo = @{ @\"message\" : @\"\" };\n    \n    [USPush handleRemoteNotificationWithUserInfo:userInfo];\n#endif\n    \n    UE_LOG(LogUpsight, Log, TEXT(\"ApplicationReceivedRemoteNotification: %s\"), *Json);\n}\n\n<commit_msg>Correctly convert and pass int32 argument on to UIUserNotificationSettings structure require by Upsight call<commit_after>\/\/\n\/\/  Created by Robert Segal on 2014-04-01.\n\/\/  Copyright (c) 2016 Get Set Games Inc. All rights reserved.\n\/\/\n\n#include \"UpsightPrivatePCH.h\"\n#include \"CallbackDevice.h\"\n\n#if PLATFORM_IOS\n#import <UpsightKit\/UpsightKit.h>\n#endif\n\n#if PLATFORM_IOS\n\n@interface UUpsightComponentDelegate : NSObject <USBillboardDelegate>\n-(UIViewController *)presentingViewControllerForBillboard:(id<USBillboard>)aBillboard;\n@end\n\nstatic UUpsightComponentDelegate* ucd;\n\n@implementation UUpsightComponentDelegate\n\n+(void)load\n{\n    if (!ucd)\n    {\n        ucd = [[UUpsightComponentDelegate alloc] init];\n    }\n}\n\n-(id)init\n{\n    self = [super init];\n    \n    if (self)\n    {\n        [[NSNotificationCenter defaultCenter] addObserver:self\n                                                 selector:@selector(applicationDidFinishLaunching:)\n                                                     name:UIApplicationDidFinishLaunchingNotification\n                                                   object:nil];\n    }\n    \n    return self;\n}\n\n-(void)dealloc\n{\n    [[NSNotificationCenter defaultCenter] removeObserver:self];\n    [super dealloc];\n}\n\n-(void)applicationDidFinishLaunching:(NSNotification *)n\n{\n    NSDictionary *dLaunchOptionsUrl = n.userInfo[@\"UIApplicationLaunchOptionsURLKey\"];\n    \n    if (!dLaunchOptionsUrl)\n    {\n        [USPush registerForPushNotifications];\n    }\n}\n\n-(UIViewController *)presentingViewControllerForBillboard:(id<USBillboard>)aBillboard\n{\n    UIViewController *topController = [UIApplication sharedApplication].keyWindow.rootViewController;\n    \n    while (topController.presentedViewController) {\n        topController = topController.presentedViewController;\n    }\n    \n    return topController;\n}\n\n@end\n\n#endif\n\nvoid UUpsightComponent::OnRegister()\n{\n\tSuper::OnRegister();\n    \n    FCoreDelegates::ApplicationRegisteredForRemoteNotificationsDelegate.AddUObject(this, &UUpsightComponent::ApplicationRegisteredForRemoteNotifications_Handler);\n    FCoreDelegates::ApplicationRegisteredForUserNotificationsDelegate.AddUObject(this, &UUpsightComponent::ApplicationRegisteredForUserNotificationsDelegate_Handler);\n    FCoreDelegates::ApplicationFailedToRegisterForRemoteNotificationsDelegate.AddUObject(this, &UUpsightComponent::ApplicationFailedToRegisterForRemoteNotifications_Handler);\n    FCoreDelegates::ApplicationReceivedRemoteNotificationDelegate.AddUObject(this, &UUpsightComponent::ApplicationReceivedRemoteNotification_Handler);\n}\n\nvoid UUpsightComponent::OnUnregister()\n{\n\tSuper::OnUnregister();\n}\n\nvoid UUpsightComponent::ApplicationRegisteredForUserNotificationsDelegate_Handler(int32 inInt)\n{\n#if PLATFORM_IOS\n    NSUInteger t = [[NSNumber numberWithInt:inInt] unsignedIntegerValue];\n    \n    UIUserNotificationSettings *s = [UIUserNotificationSettings settingsForTypes:t categories:nil];\n    \n    [USPush didRegisterUserNotificationSettings:s];\n#endif\n}\n\nvoid UUpsightComponent::ApplicationRegisteredForRemoteNotifications_Handler(TArray<uint8> Token)\n{\n#if PLATFORM_IOS\n    NSData* TokenData = [NSData dataWithBytes:Token.GetData() length:Token.Num()];\n    \n    [USPush registerPushToken:TokenData];\n#endif\n}\n\nvoid UUpsightComponent::ApplicationFailedToRegisterForRemoteNotifications_Handler(FString RegisterError)\n{\n    UE_LOG(LogUpsight, Error, TEXT(\"ApplicationFailedToRegisterForRemoteNotifications: %s\"), *RegisterError);\n}\n\nvoid UUpsightComponent::ApplicationReceivedRemoteNotification_Handler(FString Json)\n{\n#if PLATFORM_IOS\n    [USPush pushBillboard].delegate = ucd;\n    \n    NSDictionary *userInfo = @{ @\"message\" : @\"\" };\n    \n    [USPush handleRemoteNotificationWithUserInfo:userInfo];\n#endif\n    \n    UE_LOG(LogUpsight, Log, TEXT(\"ApplicationReceivedRemoteNotification: %s\"), *Json);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * callbacks.hpp - Framework support of callback functions\n *\n *   Copyright 2010-2012 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\/cat.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);\t\t\t\t        \\\n    template <int N, int M>\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n    struct SetCallbackImpl<                                                 \\\n        cli::callback::BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE), N, M>  \\\n    {                                                                       \\\n        template <typename T, typename Functor>                             \\\n        static void setCallback(T& interpreter, Functor function)           \\\n            { interpreter.BOOST_PP_TUPLE_ELEM(2, 1, DECLARATION_TUPLE) =    \\\n                function; }                                                 \\\n    };\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    template <int N, int M>                                                 \\\n    struct SetCallbackImpl<                                                 \\\n        cli::callback::BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE), N, M>  \\\n    {                                                                       \\\n        template <typename T, typename Functor>                             \\\n        static void setCallback(T& interpreter, Functor function)           \\\n            { interpreter.BOOST_PP_TUPLE_ELEM(2, 1, DECLARATION_TUPLE) =    \\\n                function; }                                                 \\\n    };\n\n#define CLI_DECLARE_CALLBACKS(TYPE, DECLARATIONS_SEQ)               \\\n    template <template <typename> class Callback, int N, int M> \t\\\n    struct SetCallbackImpl\t\t\t\t\t\t\t\t\t\t\t\\\n    {\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n        template <typename T, typename Functor>\t\t\t\t\t\t\\\n        static void setCallback(T& interpreter, Functor function)\t\\\n        {\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n            throw cli::exception::UnknownCallbackException(\t\t\t\\\n                Callback<T>::name());\t\t\t\t\t\t\t\t\\\n        }\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n    };\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\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\n#define CLI_DECLARE_CALLBACKS_TPL(TYPE, DECLARATIONS_SEQ)           \\\n    template <template <typename> class Callback, int N, int M> \t\\\n    struct SetCallbackImpl\t\t\t\t\t\t\t\t\t\t\t\\\n    {\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n        template <typename T, typename Functor>\t\t\t\t\t\t\\\n        static void setCallback(T& interpreter, Functor function)\t\\\n        {\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n            throw cli::exception::UnknownCallbackException(\t\t\t\\\n                Callback<T>::name());\t\t\t\t\t\t\t\t\\\n        }\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n    };\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\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\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    \/\/ DoCommandCallback\n    \/\/\n\n    template <typename T>\n    struct DoCommandCallback\n    {\n        typedef bool (Type)(const std::string&,\n            typename T::ArgumentsType const&);\n        static const char* name() { return \"DoCommandCallback\"; }\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    \/\/\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    \/\/\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    \/\/\n    \/\/ ParseErrorCallback\n    \/\/\n\n    template <typename T>\n    struct ParseErrorCallback\n    {\n            typedef bool (Type)(typename T::ParseErrorType const&,\n                const std::string&);\n            static const char* name() { return \"ParseErrorCallback\"; }\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    \/\/\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    \/\/\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    \/\/\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\n#endif \/* CALLBACKS_HPP_ *\/\n<commit_msg>fix wrong tabulation<commit_after>\/*\n * callbacks.hpp - Framework support of callback functions\n *\n *   Copyright 2010-2012 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\/cat.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    template <int N, int M>                                                 \\\n    struct SetCallbackImpl<                                                 \\\n        cli::callback::BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE), N, M>  \\\n    {                                                                       \\\n        template <typename T, typename Functor>                             \\\n        static void setCallback(T& interpreter, Functor function)           \\\n            { interpreter.BOOST_PP_TUPLE_ELEM(2, 1, DECLARATION_TUPLE) =    \\\n                function; }                                                 \\\n    };\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    template <int N, int M>                                                 \\\n    struct SetCallbackImpl<                                                 \\\n        cli::callback::BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE), N, M>  \\\n    {                                                                       \\\n        template <typename T, typename Functor>                             \\\n        static void setCallback(T& interpreter, Functor function)           \\\n            { interpreter.BOOST_PP_TUPLE_ELEM(2, 1, DECLARATION_TUPLE) =    \\\n                function; }                                                 \\\n    };\n\n#define CLI_DECLARE_CALLBACKS(TYPE, DECLARATIONS_SEQ)               \\\n    template <template <typename> class Callback, int N, int M>     \\\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    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\n#define CLI_DECLARE_CALLBACKS_TPL(TYPE, DECLARATIONS_SEQ)           \\\n    template <template <typename> class Callback, int N, int M>     \\\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    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\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    \/\/ DoCommandCallback\n    \/\/\n\n    template <typename T>\n    struct DoCommandCallback\n    {\n        typedef bool (Type)(const std::string&,\n            typename T::ArgumentsType const&);\n        static const char* name() { return \"DoCommandCallback\"; }\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    \/\/\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    \/\/\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    \/\/\n    \/\/ ParseErrorCallback\n    \/\/\n\n    template <typename T>\n    struct ParseErrorCallback\n    {\n            typedef bool (Type)(typename T::ParseErrorType const&,\n                const std::string&);\n            static const char* name() { return \"ParseErrorCallback\"; }\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    \/\/\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    \/\/\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    \/\/\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\n#endif \/* CALLBACKS_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#ifndef COBALT_EVENTS_HPP_INCLUDED\n#define COBALT_EVENTS_HPP_INCLUDED\n\n#pragma once\n\n\/\/ Classes in this file:\n\/\/     event\n\/\/     basic_event\n\/\/     rebind_event_handler\n\/\/     event_dispatcher\n\/\/     event_subscriber\n\/\/     event_target\n\n#include <cobalt\/utility\/intrusive.hpp>\n#include <cobalt\/utility\/hash.hpp>\n#include <cobalt\/utility\/enum_traits.hpp>\n\n#include <boost\/assert.hpp>\n\n#include <array>\n#include <deque>\n#include <unordered_map>\n#include <chrono>\n\nCO_DEFINE_ENUM_CLASS(\n\tevent_phase, uint8_t,\n\tbubbling,\n\tcapture,\n\tsinking\n)\n\nCO_DEFINE_ENUM_FLAGS_CLASS(\n\tsubscribe_mode, uint8_t,\n\ttype = 1 << 0,\n\tname = 1 << 1,\n\ttype_and_name = type | name\n)\n\nnamespace cobalt {\n\n\/\/\/ event\nclass event : public ref_counter<event> {\npublic:\n\ttypedef hash_type target_type;\n\n\tvirtual ~event() = default;\n\tvirtual target_type target() const = 0;\n};\n\n\/\/\/ basic_event\ntemplate <event::target_type Target>\nclass basic_event : public event {\npublic:\n\tstatic constexpr target_type type = Target;\n\n\tvirtual target_type target() const override { return Target; }\n};\n\n#define CO_DEFINE_EVENT_CLASS(event_class_name) class event_class_name : public basic_event<#event_class_name##_hash>\n\n\/\/\/ rebind_event_handler\ntemplate\n<\n\ttypename T,\n\ttypename E,\n\ttypename = typename std::enable_if<std::is_base_of<event, E>::value>::type\n>\nclass rebind_event_handler {\npublic:\n\trebind_event_handler(void(T::*mf)(E*), T* obj)\n\t\t: _obj(obj)\n\t\t, _mf(mf)\n\t{\n\t}\n\n\tvoid operator()(event* ev) {\n\t\t(_obj->*_mf)(static_cast<E*>(ev));\n\t}\n\n\tfriend bool operator==(const rebind_event_handler& rhs, const rebind_event_handler& lhs) {\n\t\treturn rhs._obj == lhs._obj && rhs._mf == lhs._mf;\n\t}\n\nprivate:\n\tT* _obj;\n\tvoid(T::*_mf)(E*);\n};\n\n\/\/\/ event_dispatcher\nclass event_dispatcher {\npublic:\n\ttypedef event::target_type target_type;\n\ttypedef std::function<void(event*)> handler_type;\n\ttypedef std::chrono::high_resolution_clock clock_type;\n\n\tevent_dispatcher() = default;\n\n\t\/\/ subscribe\/subscribed\/unsubscribe\n\n\tsize_t subscribe(target_type target, handler_type handler) {\n\t\tsize_t handler_hash = handler.target_type().hash_code();\n\t\t_handlers.emplace(target, std::move(handler));\n\t\treturn handler_hash;\n\t}\n\n\tbool subscribed(target_type target, handler_type handler) const {\n\t\treturn subscribed(target, handler.target_type().hash_code());\n\t}\n\n\tbool subscribed(target_type target, size_t handler_hash) const {\n\t\tauto range = _handlers.equal_range(target);\n\t\tfor (auto it = range.first; it != range.second; ++it) {\n\t\t\tauto&& typeinfo = (*it).second.target_type();\n\t\t\tif (typeinfo.hash_code() == handler_hash)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tbool unsubscribe(target_type target, handler_type handler) {\n\t\treturn unsubscribe(target, handler.target_type().hash_code());\n\t}\n\n\tbool unsubscribe(target_type target, size_t handler_hash) {\n\t\tauto range = _handlers.equal_range(target);\n\t\tfor (auto it = range.first; it != range.second; ++it) {\n\t\t\tauto&& typeinfo = (*it).second.target_type();\n\t\t\tif (typeinfo.hash_code() == handler_hash) {\n\t\t\t\t_handlers.erase(it);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\t\/\/ subscribe\/subscribed\/unsubscribe templated overloads for member functions\n\n\ttemplate <typename T, typename E>\n\tsize_t subscribe(void(T::*mf)(E*), T* obj) {\n\t\tsubscribe(E::type, rebind_event_handler<T, E>(mf, obj));\n\t\treturn typeid(rebind_event_handler<T, E>).hash_code();\n\t}\n\n\ttemplate <typename T, typename E>\n\tbool subscribed(void(T::*mf)(E*), T* obj) const {\n\t\tauto range = _handlers.equal_range(E::type);\n\t\tfor (auto it = range.first; it != range.second; ++it) {\n\t\t\tauto target = (*it).second.template target<rebind_event_handler<T, E>>();\n\t\t\tif (target && *target == rebind_event_handler<T, E>(mf, obj))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate <typename T, typename E>\n\tbool unsubscribe(void(T::*mf)(E*), T* obj, size_t* handler_hash = nullptr) {\n\t\tauto range = _handlers.equal_range(E::type);\n\t\tfor (auto it = range.first; it != range.second; ++it) {\n\t\t\tauto target = (*it).second.template target<rebind_event_handler<T, E>>();\n\t\t\tif (target && *target == rebind_event_handler<T, E>(mf, obj)) {\n\t\t\t\tif (handler_hash)\n\t\t\t\t\t*handler_hash = (*it).second.target_type().hash_code();\n\t\t\t\t_handlers.erase(it);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\t\/\/ post\/dispatch\/invoke\n\n\tbool empty() const {\n\t\treturn _queues[0].empty();\n\t}\n\n\tvoid post(const ref_ptr<event>& event) {\n\t\t_queues[0].emplace_back(event->target(), event);\n\t}\n\t\n\tvoid post(ref_ptr<event>&& event) {\n\t\t_queues[0].emplace_back(event->target(), std::move(event));\n\t}\n\n\tvoid post(target_type target, const ref_ptr<event>& event) {\n\t\t_queues[0].emplace_back(target, event);\n\t}\n\n\tvoid post(target_type target, ref_ptr<event>&& event) {\n\t\t_queues[0].emplace_back(target, std::move(event));\n\t}\n\n\tbool posted(target_type target) const {\n\t\tfor (auto&& p : _queues[0]) {\n\t\t\tif (p.first == target)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tbool abort_first(target_type target) {\n\t\tauto it = std::find_if(_queues[0].begin(), _queues[0].end(),\n\t\t\t[&](const Events::value_type& v) {\n\t\t\t\treturn v.first == target;\n\t\t\t});\n\n\t\tif (it != _queues[0].end()) {\n\t\t\t_queues[0].erase(it);\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tbool abort_last(target_type target) {\n\t\tauto it = std::find_if(_queues[0].rbegin(), _queues[0].rend(),\n\t\t\t[&](const Events::value_type& v) {\n\t\t\t\treturn v.first == target;\n\t\t\t});\n\n\t\tif (it != _queues[0].rend()) {\n\t\t\t_queues[0].erase(--it.base());\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tvoid abort_all(target_type target) {\n\t\tauto it = std::remove_if(_queues[0].begin(), _queues[0].end(),\n\t\t\t[&](const Events::value_type& v) {\n\t\t\t\treturn v.first == target;\n\t\t\t});\n\t\t\n\t\tif (it != _queues[0].end())\n\t\t\t_queues[0].erase(it, _queues[0].end());\n\t}\n\n\t\/\/\/ Dispatches events with timeout\n\t\/\/\/ @return Number of invoked handlers\n\tsize_t dispatch(clock_type::duration timeout) {\n\t\tsize_t count = 0;\n\n\t\tstd::swap(_queues[0], _queues[1]);\n\n\t\tauto start = clock_type::now();\n\n\t\twhile (!_queues[1].empty()) {\n\t\t\tauto&& p = _queues[1].front();\n\t\t\tcount += invoke(p.first, p.second);\n\t\t\t_queues[1].pop_front();\n\n\t\t\tif (clock_type::now() - start >= timeout)\n\t\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ Insert not processed events to the main queue\n\t\tif (!_queues[1].empty()) {\n\t\t\t_queues[0].insert(_queues[0].begin(),\n\t\t\t\tstd::make_move_iterator(_queues[1].begin()),\n\t\t\t\tstd::make_move_iterator(_queues[1].end()));\n\t\t\t\n\t\t\t_queues[1].clear();\n\t\t}\n\n\t\treturn count;\n\t}\n\n\t\/\/\/ Invokes the event immediately\n\t\/\/\/ @return Number of invoked handlers\n\tsize_t invoke(const ref_ptr<event>& event) {\n\t\tsize_t count = 0;\n\t\tauto range = _handlers.equal_range(event->target());\n\t\tfor (auto it = range.first; it != range.second; ++it, ++count)\n\t\t\t(*it).second(event.get());\n\t\treturn count;\n\t}\n\n\t\/\/\/ Invokes the event immediately\n\t\/\/\/ @return Number of invoked handlers\n\tsize_t invoke(target_type target, const ref_ptr<event>& event) {\n\t\tsize_t count = 0;\n\t\tauto range = _handlers.equal_range(target);\n\t\tfor (auto it = range.first; it != range.second; ++it, ++count)\n\t\t\t(*it).second(event.get());\n\t\treturn count;\n\t}\n\nprivate:\n\ttypedef std::unordered_multimap<target_type, handler_type, dont_hash<target_type>> Handlers;\n\tHandlers _handlers;\n\n\ttypedef std::deque<std::pair<target_type, ref_ptr<event>>> Events;\n\tstd::array<Events, 2> _queues;\n};\n\n\/\/\/ Helper base class for objects to subscribe to and automatically unsubscribe from events\ntemplate <typename T>\nclass event_subscriber {\npublic:\n\texplicit event_subscriber(event_dispatcher& dispatcher)\n\t\t: _dispatcher(dispatcher)\n\t{\n\t}\n\n\t~event_subscriber() {\n\t\tfor (auto&& s : _subscriptions) {\n\t\t\tBOOST_VERIFY(_dispatcher.unsubscribe(s.first, s.second));\n\t\t}\n\t}\n\n\ttemplate <typename E>\n\tvoid subscribe(void(T::*mf)(E*)) {\n\t\tauto handler_hash = _dispatcher.subscribe(mf, static_cast<T*>(this));\n\t\t_subscriptions.emplace_back(E::type, handler_hash);\n\t}\n\n\ttemplate <typename E>\n\tbool subscribed(void(T::*mf)(E*)) const {\n\t\treturn _dispatcher.subscribed(mf, static_cast<T*>(this));\n\t}\n\n\ttemplate <typename E>\n\tvoid unsubscribe(void(T::*mf)(E*)) {\n\t\tsize_t handler_hash = 0;\n\t\tBOOST_VERIFY(_dispatcher.unsubscribe(mf, static_cast<T*>(this), &handler_hash));\n\t\t\/\/ Remove handler hash for event type from subscriptions\n\t\tauto it = std::find(_subscriptions.begin(), _subscriptions.end(), std::make_pair(E::type, handler_hash));\n\t\tif (it != _subscriptions.end())\n\t\t\t_subscriptions.erase(it);\n\t}\n\nprivate:\n\tevent_dispatcher& _dispatcher;\n\n\ttypedef std::deque<std::pair<event_dispatcher::target_type, size_t>> Subscriptions;\n\tSubscriptions _subscriptions;\n};\n\n\/\/\/ Base class for objects to make them event targets\ntemplate\n<\n\ttypename T,\n\tsubscribe_mode Mode = subscribe_mode::type_and_name\n>\nclass event_target {\npublic:\n\texplicit event_target(event_dispatcher& dispatcher, const char* target_name = nullptr)\n\t\t: _dispatcher(dispatcher)\n\t\t, _target(get_target(target_name))\n\t{\n\t\tusing std::placeholders::_1;\n\t\t\n\t\tevent_dispatcher::handler_type handler = std::bind(&event_target::on_event, static_cast<T*>(this), _1);\n\t\t_handler_hash = _dispatcher.subscribe(_target, handler);\n\t}\n\n\tvirtual ~event_target() {\n\t\tBOOST_VERIFY(_dispatcher.unsubscribe(_target, _handler_hash));\n\t}\n\n\tvirtual void on_event(event*) = 0;\n\n\tstatic event_dispatcher::target_type get_target(const char* target_name) {\n\t\tstatic_assert(std::is_same<event_dispatcher::target_type, hash_type>::value, \"target_type is not hash_type\");\n\t\t\n\t\thash_type hash_value = 0;\n\n\t\tif ((Mode & subscribe_mode::type) == subscribe_mode::type)\n\t\t\thash_value = typeid(T).hash_code();\n\n\t\tif ((Mode & subscribe_mode::name) == subscribe_mode::name && target_name != nullptr)\n\t\t\t\thash_value = murmur3(target_name, std::strlen(target_name), hash_value);\n\n\t\treturn hash_value;\n\t}\n\nprivate:\n\tevent_dispatcher& _dispatcher;\n\tevent_dispatcher::target_type _target = 0;\n\tsize_t _handler_hash = 0;\n};\n\n} \/\/ namespace cobalt\n\n#endif \/\/ COBALT_EVENTS_HPP_INCLUDED\n<commit_msg>Added assertion<commit_after>#ifndef COBALT_EVENTS_HPP_INCLUDED\n#define COBALT_EVENTS_HPP_INCLUDED\n\n#pragma once\n\n\/\/ Classes in this file:\n\/\/     event\n\/\/     basic_event\n\/\/     rebind_event_handler\n\/\/     event_dispatcher\n\/\/     event_subscriber\n\/\/     event_target\n\n#include <cobalt\/utility\/intrusive.hpp>\n#include <cobalt\/utility\/hash.hpp>\n#include <cobalt\/utility\/enum_traits.hpp>\n\n#include <boost\/assert.hpp>\n\n#include <array>\n#include <deque>\n#include <unordered_map>\n#include <chrono>\n\nCO_DEFINE_ENUM_CLASS(\n\tevent_phase, uint8_t,\n\tbubbling,\n\tcapture,\n\tsinking\n)\n\nCO_DEFINE_ENUM_FLAGS_CLASS(\n\tsubscribe_mode, uint8_t,\n\ttype = 1 << 0,\n\tname = 1 << 1,\n\ttype_and_name = type | name\n)\n\nnamespace cobalt {\n\n\/\/\/ event\nclass event : public ref_counter<event> {\npublic:\n\ttypedef hash_type target_type;\n\n\tvirtual ~event() = default;\n\tvirtual target_type target() const = 0;\n};\n\n\/\/\/ basic_event\ntemplate <event::target_type Target>\nclass basic_event : public event {\npublic:\n\tstatic constexpr target_type type = Target;\n\n\tvirtual target_type target() const override { return Target; }\n};\n\n#define CO_DEFINE_EVENT_CLASS(event_class_name) class event_class_name : public basic_event<#event_class_name##_hash>\n\n\/\/\/ rebind_event_handler\ntemplate\n<\n\ttypename T,\n\ttypename E,\n\ttypename = typename std::enable_if<std::is_base_of<event, E>::value>::type\n>\nclass rebind_event_handler {\npublic:\n\trebind_event_handler(void(T::*mf)(E*), T* obj)\n\t\t: _obj(obj)\n\t\t, _mf(mf)\n\t{\n\t}\n\n\tvoid operator()(event* ev) {\n\t\t(_obj->*_mf)(static_cast<E*>(ev));\n\t}\n\n\tfriend bool operator==(const rebind_event_handler& rhs, const rebind_event_handler& lhs) {\n\t\treturn rhs._obj == lhs._obj && rhs._mf == lhs._mf;\n\t}\n\nprivate:\n\tT* _obj;\n\tvoid(T::*_mf)(E*);\n};\n\n\/\/\/ event_dispatcher\nclass event_dispatcher {\npublic:\n\ttypedef event::target_type target_type;\n\ttypedef std::function<void(event*)> handler_type;\n\ttypedef std::chrono::high_resolution_clock clock_type;\n\n\tevent_dispatcher() = default;\n\n\t\/\/ subscribe\/subscribed\/unsubscribe\n\n\tsize_t subscribe(target_type target, handler_type handler) {\n\t\tsize_t handler_hash = handler.target_type().hash_code();\n\t\t_handlers.emplace(target, std::move(handler));\n\t\treturn handler_hash;\n\t}\n\n\tbool subscribed(target_type target, handler_type handler) const {\n\t\treturn subscribed(target, handler.target_type().hash_code());\n\t}\n\n\tbool subscribed(target_type target, size_t handler_hash) const {\n\t\tauto range = _handlers.equal_range(target);\n\t\tfor (auto it = range.first; it != range.second; ++it) {\n\t\t\tauto&& typeinfo = (*it).second.target_type();\n\t\t\tif (typeinfo.hash_code() == handler_hash)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tbool unsubscribe(target_type target, handler_type handler) {\n\t\treturn unsubscribe(target, handler.target_type().hash_code());\n\t}\n\n\tbool unsubscribe(target_type target, size_t handler_hash) {\n\t\tauto range = _handlers.equal_range(target);\n\t\tfor (auto it = range.first; it != range.second; ++it) {\n\t\t\tauto&& typeinfo = (*it).second.target_type();\n\t\t\tif (typeinfo.hash_code() == handler_hash) {\n\t\t\t\t_handlers.erase(it);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\t\/\/ subscribe\/subscribed\/unsubscribe templated overloads for member functions\n\n\ttemplate <typename T, typename E>\n\tsize_t subscribe(void(T::*mf)(E*), T* obj) {\n\t\tsubscribe(E::type, rebind_event_handler<T, E>(mf, obj));\n\t\treturn typeid(rebind_event_handler<T, E>).hash_code();\n\t}\n\n\ttemplate <typename T, typename E>\n\tbool subscribed(void(T::*mf)(E*), T* obj) const {\n\t\tauto range = _handlers.equal_range(E::type);\n\t\tfor (auto it = range.first; it != range.second; ++it) {\n\t\t\tauto target = (*it).second.template target<rebind_event_handler<T, E>>();\n\t\t\tif (target && *target == rebind_event_handler<T, E>(mf, obj))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate <typename T, typename E>\n\tbool unsubscribe(void(T::*mf)(E*), T* obj, size_t* handler_hash = nullptr) {\n\t\tauto range = _handlers.equal_range(E::type);\n\t\tfor (auto it = range.first; it != range.second; ++it) {\n\t\t\tauto target = (*it).second.template target<rebind_event_handler<T, E>>();\n\t\t\tif (target && *target == rebind_event_handler<T, E>(mf, obj)) {\n\t\t\t\tif (handler_hash)\n\t\t\t\t\t*handler_hash = (*it).second.target_type().hash_code();\n\t\t\t\t_handlers.erase(it);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\t\/\/ post\/dispatch\/invoke\n\n\tbool empty() const {\n\t\treturn _queues[0].empty();\n\t}\n\n\tvoid post(const ref_ptr<event>& event) {\n\t\t_queues[0].emplace_back(event->target(), event);\n\t}\n\t\n\tvoid post(ref_ptr<event>&& event) {\n\t\t_queues[0].emplace_back(event->target(), std::move(event));\n\t}\n\n\tvoid post(target_type target, const ref_ptr<event>& event) {\n\t\t_queues[0].emplace_back(target, event);\n\t}\n\n\tvoid post(target_type target, ref_ptr<event>&& event) {\n\t\t_queues[0].emplace_back(target, std::move(event));\n\t}\n\n\tbool posted(target_type target) const {\n\t\tfor (auto&& p : _queues[0]) {\n\t\t\tif (p.first == target)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tbool abort_first(target_type target) {\n\t\tauto it = std::find_if(_queues[0].begin(), _queues[0].end(),\n\t\t\t[&](const Events::value_type& v) {\n\t\t\t\treturn v.first == target;\n\t\t\t});\n\n\t\tif (it != _queues[0].end()) {\n\t\t\t_queues[0].erase(it);\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tbool abort_last(target_type target) {\n\t\tauto it = std::find_if(_queues[0].rbegin(), _queues[0].rend(),\n\t\t\t[&](const Events::value_type& v) {\n\t\t\t\treturn v.first == target;\n\t\t\t});\n\n\t\tif (it != _queues[0].rend()) {\n\t\t\t_queues[0].erase(--it.base());\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tvoid abort_all(target_type target) {\n\t\tauto it = std::remove_if(_queues[0].begin(), _queues[0].end(),\n\t\t\t[&](const Events::value_type& v) {\n\t\t\t\treturn v.first == target;\n\t\t\t});\n\t\t\n\t\tif (it != _queues[0].end())\n\t\t\t_queues[0].erase(it, _queues[0].end());\n\t}\n\n\t\/\/\/ Dispatches events with timeout\n\t\/\/\/ @return Number of invoked handlers\n\tsize_t dispatch(clock_type::duration timeout) {\n\t\tsize_t count = 0;\n\n\t\tstd::swap(_queues[0], _queues[1]);\n\n\t\tauto start = clock_type::now();\n\n\t\twhile (!_queues[1].empty()) {\n\t\t\tauto&& p = _queues[1].front();\n\t\t\tcount += invoke(p.first, p.second);\n\t\t\t_queues[1].pop_front();\n\n\t\t\tif (clock_type::now() - start >= timeout)\n\t\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ Insert not processed events to the main queue\n\t\tif (!_queues[1].empty()) {\n\t\t\t_queues[0].insert(_queues[0].begin(),\n\t\t\t\tstd::make_move_iterator(_queues[1].begin()),\n\t\t\t\tstd::make_move_iterator(_queues[1].end()));\n\t\t\t\n\t\t\t_queues[1].clear();\n\t\t}\n\n\t\treturn count;\n\t}\n\n\t\/\/\/ Invokes the event immediately\n\t\/\/\/ @return Number of invoked handlers\n\tsize_t invoke(const ref_ptr<event>& event) {\n\t\tsize_t count = 0;\n\t\tauto range = _handlers.equal_range(event->target());\n\t\tfor (auto it = range.first; it != range.second; ++it, ++count)\n\t\t\t(*it).second(event.get());\n\t\treturn count;\n\t}\n\n\t\/\/\/ Invokes the event immediately\n\t\/\/\/ @return Number of invoked handlers\n\tsize_t invoke(target_type target, const ref_ptr<event>& event) {\n\t\tsize_t count = 0;\n\t\tauto range = _handlers.equal_range(target);\n\t\tfor (auto it = range.first; it != range.second; ++it, ++count)\n\t\t\t(*it).second(event.get());\n\t\treturn count;\n\t}\n\nprivate:\n\ttypedef std::unordered_multimap<target_type, handler_type, dont_hash<target_type>> Handlers;\n\tHandlers _handlers;\n\n\ttypedef std::deque<std::pair<target_type, ref_ptr<event>>> Events;\n\tstd::array<Events, 2> _queues;\n};\n\n\/\/\/ Helper base class for objects to subscribe to and automatically unsubscribe from events\ntemplate <typename T>\nclass event_subscriber {\npublic:\n\texplicit event_subscriber(event_dispatcher& dispatcher)\n\t\t: _dispatcher(dispatcher)\n\t{\n\t}\n\n\t~event_subscriber() {\n\t\tfor (auto&& s : _subscriptions) {\n\t\t\tBOOST_VERIFY(_dispatcher.unsubscribe(s.first, s.second));\n\t\t}\n\t}\n\n\ttemplate <typename E>\n\tvoid subscribe(void(T::*mf)(E*)) {\n\t\tauto handler_hash = _dispatcher.subscribe(mf, static_cast<T*>(this));\n\t\t_subscriptions.emplace_back(E::type, handler_hash);\n\t}\n\n\ttemplate <typename E>\n\tbool subscribed(void(T::*mf)(E*)) const {\n\t\treturn _dispatcher.subscribed(mf, static_cast<T*>(this));\n\t}\n\n\ttemplate <typename E>\n\tvoid unsubscribe(void(T::*mf)(E*)) {\n\t\tsize_t handler_hash = 0;\n\t\tBOOST_VERIFY(_dispatcher.unsubscribe(mf, static_cast<T*>(this), &handler_hash));\n\t\t\/\/ Remove handler hash for event type from subscriptions\n\t\tauto it = std::find(_subscriptions.begin(), _subscriptions.end(), std::make_pair(E::type, handler_hash));\n\t\tif (it != _subscriptions.end())\n\t\t\t_subscriptions.erase(it);\n\t}\n\nprivate:\n\tevent_dispatcher& _dispatcher;\n\n\ttypedef std::deque<std::pair<event_dispatcher::target_type, size_t>> Subscriptions;\n\tSubscriptions _subscriptions;\n};\n\n\/\/\/ Base class for objects to make them event targets\ntemplate\n<\n\ttypename T,\n\tsubscribe_mode Mode = subscribe_mode::type_and_name\n>\nclass event_target {\npublic:\n\texplicit event_target(event_dispatcher& dispatcher, const char* target_name = nullptr)\n\t\t: _dispatcher(dispatcher)\n\t\t, _target(get_target(target_name))\n\t{\n\t\tusing std::placeholders::_1;\n\t\t\n\t\tevent_dispatcher::handler_type handler = std::bind(&event_target::on_event, static_cast<T*>(this), _1);\n\t\t_handler_hash = _dispatcher.subscribe(_target, handler);\n\t}\n\n\tvirtual ~event_target() {\n\t\tBOOST_VERIFY(_dispatcher.unsubscribe(_target, _handler_hash));\n\t}\n\n\tvirtual void on_event(event*) = 0;\n\n\tstatic event_dispatcher::target_type get_target(const char* target_name) {\n\t\tstatic_assert(std::is_same<event_dispatcher::target_type, hash_type>::value, \"target_type is not hash_type\");\n\t\t\n\t\thash_type hash_value = 0;\n\n\t\tif ((Mode & subscribe_mode::type) == subscribe_mode::type)\n\t\t\thash_value = typeid(T).hash_code();\n\n\t\tif ((Mode & subscribe_mode::name) == subscribe_mode::name && target_name != nullptr)\n\t\t\thash_value = murmur3(target_name, std::strlen(target_name), hash_value);\n\n\t\tBOOST_ASSERT_MSG(hash_value != 0, \"Cannot identify target\");\n\t\t\n\t\treturn hash_value;\n\t}\n\nprivate:\n\tevent_dispatcher& _dispatcher;\n\tevent_dispatcher::target_type _target = 0;\n\tsize_t _handler_hash = 0;\n};\n\n} \/\/ namespace cobalt\n\n#endif \/\/ COBALT_EVENTS_HPP_INCLUDED\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\/labs.h\"\n\n#include <algorithm>\n#include <iterator>\n#include <map>\n#include <set>\n\n#include \"app\/l10n_util.h\"\n#include \"base\/command_line.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/platform_util.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"grit\/generated_resources.h\"\n\nnamespace about_labs {\n\nenum { kOsMac = 1 << 0, kOsWin = 1 << 1, kOsLinux = 1 << 2 };\n\nunsigned kOsAll = kOsMac | kOsWin | kOsLinux;\n\nstruct Experiment {\n  \/\/ The internal name of the experiment. This is never shown to the user.\n  \/\/ It _is_ however stored in the prefs file, so you shouldn't change the\n  \/\/ name of existing labs.\n  const char* internal_name;\n\n  \/\/ String id of the message containing the experiment's name.\n  int visible_name_id;\n\n  \/\/ String id of the message containing the experiment's description.\n  int visible_description_id;\n\n  \/\/ The platforms the experiment is available on\n  \/\/ Needs to be more than a compile-time #ifdef because of profile sync.\n  unsigned supported_platforms;  \/\/ bitmask\n\n  \/\/ The commandline parameter that's added when this lab is active. This is\n  \/\/ different from |internal_name| so that the commandline flag can be\n  \/\/ renamed without breaking the prefs file.\n  const char* command_line;\n};\n\nconst Experiment kExperiments[] = {\n  {\n    \"expose-for-tabs\",  \/\/ Do not change; see above.\n    IDS_LABS_TABPOSE_NAME,\n    IDS_LABS_TABPOSE_DESCRIPTION,\n    kOsMac,\n#if defined(OS_MACOSX)\n    \/\/ The switch exists only on OS X.\n    switches::kEnableExposeForTabs\n#else\n    \"\"\n#endif\n  },\n  {\n    \"vertical-tabs\",  \/\/ Do not change; see above.\n    IDS_LABS_SIDE_TABS_NAME,\n    IDS_LABS_SIDE_TABS_DESCRIPTION,\n    kOsWin,\n    switches::kEnableVerticalTabs\n  },\n  {\n    \"tabbed-options\",  \/\/ Do not change; see above.\n    IDS_LABS_TABBED_OPTIONS_NAME,\n    IDS_LABS_TABBED_OPTIONS_DESCRIPTION,\n    kOsAll,\n    switches::kEnableTabbedOptions\n  },\n  {\n    \"match-preview\",  \/\/ Do not change; see above.\n    IDS_LABS_INSTANT_NAME,\n    IDS_LABS_INSTANT_DESCRIPTION,\n    kOsWin,\n    switches::kEnableMatchPreview\n  },\n  {\n    \"remoting\",  \/\/ Do not change; see above.\n    IDS_LABS_REMOTING_NAME,\n#if defined(OS_WINDOWS)\n    \/\/ Windows only supports host functionality at the moment.\n    IDS_LABS_REMOTING_HOST_DESCRIPTION,\n#elif defined(OS_LINUX)\n    \/\/ Linux only supports client functionality at the moment.\n    IDS_LABS_REMOTING_CLIENT_DESCRIPTION,\n#else\n    \/\/ On other platforms, this lab isn't available at all.\n    0,\n#endif\n    kOsWin | kOsLinux,\n    switches::kEnableRemoting\n  },\n};\n\n\/\/ Extracts the list of enabled lab experiments from a profile and stores them\n\/\/ in a set.\nvoid GetEnabledLabs(const PrefService* prefs, std::set<std::string>* result) {\n  const ListValue* enabled_experiments = prefs->GetList(\n      prefs::kEnabledLabsExperiments);\n  if (!enabled_experiments)\n    return;\n\n  for (ListValue::const_iterator it = enabled_experiments->begin();\n       it != enabled_experiments->end();\n       ++it) {\n    std::string experiment_name;\n    if (!(*it)->GetAsString(&experiment_name)) {\n      LOG(WARNING) << \"Invalid entry in \" << prefs::kEnabledLabsExperiments;\n      continue;\n    }\n    result->insert(experiment_name);\n  }\n}\n\n\/\/ Takes a set of enabled lab experiments\nvoid SetEnabledLabs(\n    PrefService* prefs, const std::set<std::string>& enabled_experiments) {\n  ListValue* experiments_list = prefs->GetMutableList(\n      prefs::kEnabledLabsExperiments);\n  if (!experiments_list)\n    return;\n\n  experiments_list->Clear();\n  for (std::set<std::string>::const_iterator it = enabled_experiments.begin();\n       it != enabled_experiments.end();\n       ++it) {\n    experiments_list->Append(new StringValue(*it));\n  }\n}\n\n\/\/ Removes all experiments from prefs::kEnabledLabsExperiments that are\n\/\/ unknown, to prevent this list to become very long as experiments are added\n\/\/ and removed.\nvoid SanitizeList(PrefService* prefs) {\n  std::set<std::string> known_experiments;\n  for (size_t i = 0; i < arraysize(kExperiments); ++i)\n    known_experiments.insert(kExperiments[i].internal_name);\n\n  std::set<std::string> enabled_experiments;\n  GetEnabledLabs(prefs, &enabled_experiments);\n\n  std::set<std::string> new_enabled_experiments;\n  std::set_intersection(\n      known_experiments.begin(), known_experiments.end(),\n      enabled_experiments.begin(), enabled_experiments.end(),\n      std::inserter(new_enabled_experiments, new_enabled_experiments.begin()));\n\n  SetEnabledLabs(prefs, new_enabled_experiments);\n}\n\nvoid GetSanitizedEnabledLabs(\n    PrefService* prefs, std::set<std::string>* result) {\n  SanitizeList(prefs);\n  GetEnabledLabs(prefs, result);\n}\n\nint GetCurrentPlatform() {\n#if defined(OS_MACOSX)\n  return kOsMac;\n#elif defined(OS_WIN)\n  return kOsWin;\n#elif defined(OS_LINUX)\n  return kOsLinux;\n#else\n#error Unknown platform\n#endif\n}\n\nbool IsEnabled() {\n#if defined(OS_CHROMEOS)\n  \/\/ ChromeOS uses a different mechanism for about:labs; integrated with their\n  \/\/ dom ui options.\n  return false;\n#elif defined(GOOGLE_CHROME_BUILD)\n  \/\/ Don't enable this on the stable channel.\n  return !platform_util::GetVersionStringModifier().empty();\n#else\n  return true;\n#endif\n}\n\nvoid ConvertLabsToSwitches(Profile* profile, CommandLine* command_line) {\n  \/\/ Do not activate labs features on the stable channel.\n  if (!IsEnabled())\n    return;\n\n  std::set<std::string> enabled_experiments;\n  GetSanitizedEnabledLabs(profile->GetPrefs(), &enabled_experiments);\n\n  std::map<std::string, const Experiment*> experiments;\n  for (size_t i = 0; i < arraysize(kExperiments); ++i)\n    experiments[kExperiments[i].internal_name] = &kExperiments[i];\n\n  for (std::set<std::string>::iterator it = enabled_experiments.begin();\n       it != enabled_experiments.end();\n       ++it) {\n    const std::string& experiment_name = *it;\n    std::map<std::string, const Experiment*>::iterator experiment =\n        experiments.find(experiment_name);\n    DCHECK(experiment != experiments.end());\n    if (experiment == experiments.end())\n      continue;\n\n    command_line->AppendSwitch(experiment->second->command_line);\n  }\n}\n\nListValue* GetLabsExperimentsData(Profile* profile) {\n  std::set<std::string> enabled_experiments;\n  GetSanitizedEnabledLabs(profile->GetPrefs(), &enabled_experiments);\n\n  int current_platform = GetCurrentPlatform();\n\n  ListValue* experiments_data = new ListValue();\n  for (size_t i = 0; i < arraysize(kExperiments); ++i) {\n    const Experiment& experiment = kExperiments[i];\n    if (!(experiment.supported_platforms & current_platform))\n      continue;\n\n    DictionaryValue* data = new DictionaryValue();\n    data->SetString(\"internal_name\", experiment.internal_name);\n    data->SetString(\"name\",\n                    l10n_util::GetStringUTF16(experiment.visible_name_id));\n    data->SetString(\"description\",\n                    l10n_util::GetStringUTF16(\n                        experiment.visible_description_id));\n    data->SetBoolean(\"enabled\",\n                      enabled_experiments.count(experiment.internal_name) > 0);\n\n    experiments_data->Append(data);\n  }\n  return experiments_data;\n}\n\nstatic bool needs_restart_ = false;\n\nbool IsRestartNeededToCommitChanges() {\n  return needs_restart_;\n}\n\nvoid SetExperimentEnabled(\n    Profile* profile, const std::string& internal_name, bool enable) {\n  needs_restart_ = true;\n\n  std::set<std::string> enabled_experiments;\n  GetSanitizedEnabledLabs(profile->GetPrefs(), &enabled_experiments);\n\n  if (enable)\n    enabled_experiments.insert(internal_name);\n  else\n    enabled_experiments.erase(internal_name);\n\n  SetEnabledLabs(profile->GetPrefs(), enabled_experiments);\n}\n\n}  \/\/ namespace Labs\n<commit_msg>Fix a typo introduced in r60578.<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\/labs.h\"\n\n#include <algorithm>\n#include <iterator>\n#include <map>\n#include <set>\n\n#include \"app\/l10n_util.h\"\n#include \"base\/command_line.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/platform_util.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"grit\/generated_resources.h\"\n\nnamespace about_labs {\n\nenum { kOsMac = 1 << 0, kOsWin = 1 << 1, kOsLinux = 1 << 2 };\n\nunsigned kOsAll = kOsMac | kOsWin | kOsLinux;\n\nstruct Experiment {\n  \/\/ The internal name of the experiment. This is never shown to the user.\n  \/\/ It _is_ however stored in the prefs file, so you shouldn't change the\n  \/\/ name of existing labs.\n  const char* internal_name;\n\n  \/\/ String id of the message containing the experiment's name.\n  int visible_name_id;\n\n  \/\/ String id of the message containing the experiment's description.\n  int visible_description_id;\n\n  \/\/ The platforms the experiment is available on\n  \/\/ Needs to be more than a compile-time #ifdef because of profile sync.\n  unsigned supported_platforms;  \/\/ bitmask\n\n  \/\/ The commandline parameter that's added when this lab is active. This is\n  \/\/ different from |internal_name| so that the commandline flag can be\n  \/\/ renamed without breaking the prefs file.\n  const char* command_line;\n};\n\nconst Experiment kExperiments[] = {\n  {\n    \"expose-for-tabs\",  \/\/ Do not change; see above.\n    IDS_LABS_TABPOSE_NAME,\n    IDS_LABS_TABPOSE_DESCRIPTION,\n    kOsMac,\n#if defined(OS_MACOSX)\n    \/\/ The switch exists only on OS X.\n    switches::kEnableExposeForTabs\n#else\n    \"\"\n#endif\n  },\n  {\n    \"vertical-tabs\",  \/\/ Do not change; see above.\n    IDS_LABS_SIDE_TABS_NAME,\n    IDS_LABS_SIDE_TABS_DESCRIPTION,\n    kOsWin,\n    switches::kEnableVerticalTabs\n  },\n  {\n    \"tabbed-options\",  \/\/ Do not change; see above.\n    IDS_LABS_TABBED_OPTIONS_NAME,\n    IDS_LABS_TABBED_OPTIONS_DESCRIPTION,\n    kOsAll,\n    switches::kEnableTabbedOptions\n  },\n  {\n    \"match-preview\",  \/\/ Do not change; see above.\n    IDS_LABS_INSTANT_NAME,\n    IDS_LABS_INSTANT_DESCRIPTION,\n    kOsWin,\n    switches::kEnableMatchPreview\n  },\n  {\n    \"remoting\",  \/\/ Do not change; see above.\n    IDS_LABS_REMOTING_NAME,\n#if defined(OS_WIN)\n    \/\/ Windows only supports host functionality at the moment.\n    IDS_LABS_REMOTING_HOST_DESCRIPTION,\n#elif defined(OS_LINUX)\n    \/\/ Linux only supports client functionality at the moment.\n    IDS_LABS_REMOTING_CLIENT_DESCRIPTION,\n#else\n    \/\/ On other platforms, this lab isn't available at all.\n    0,\n#endif\n    kOsWin | kOsLinux,\n    switches::kEnableRemoting\n  },\n};\n\n\/\/ Extracts the list of enabled lab experiments from a profile and stores them\n\/\/ in a set.\nvoid GetEnabledLabs(const PrefService* prefs, std::set<std::string>* result) {\n  const ListValue* enabled_experiments = prefs->GetList(\n      prefs::kEnabledLabsExperiments);\n  if (!enabled_experiments)\n    return;\n\n  for (ListValue::const_iterator it = enabled_experiments->begin();\n       it != enabled_experiments->end();\n       ++it) {\n    std::string experiment_name;\n    if (!(*it)->GetAsString(&experiment_name)) {\n      LOG(WARNING) << \"Invalid entry in \" << prefs::kEnabledLabsExperiments;\n      continue;\n    }\n    result->insert(experiment_name);\n  }\n}\n\n\/\/ Takes a set of enabled lab experiments\nvoid SetEnabledLabs(\n    PrefService* prefs, const std::set<std::string>& enabled_experiments) {\n  ListValue* experiments_list = prefs->GetMutableList(\n      prefs::kEnabledLabsExperiments);\n  if (!experiments_list)\n    return;\n\n  experiments_list->Clear();\n  for (std::set<std::string>::const_iterator it = enabled_experiments.begin();\n       it != enabled_experiments.end();\n       ++it) {\n    experiments_list->Append(new StringValue(*it));\n  }\n}\n\n\/\/ Removes all experiments from prefs::kEnabledLabsExperiments that are\n\/\/ unknown, to prevent this list to become very long as experiments are added\n\/\/ and removed.\nvoid SanitizeList(PrefService* prefs) {\n  std::set<std::string> known_experiments;\n  for (size_t i = 0; i < arraysize(kExperiments); ++i)\n    known_experiments.insert(kExperiments[i].internal_name);\n\n  std::set<std::string> enabled_experiments;\n  GetEnabledLabs(prefs, &enabled_experiments);\n\n  std::set<std::string> new_enabled_experiments;\n  std::set_intersection(\n      known_experiments.begin(), known_experiments.end(),\n      enabled_experiments.begin(), enabled_experiments.end(),\n      std::inserter(new_enabled_experiments, new_enabled_experiments.begin()));\n\n  SetEnabledLabs(prefs, new_enabled_experiments);\n}\n\nvoid GetSanitizedEnabledLabs(\n    PrefService* prefs, std::set<std::string>* result) {\n  SanitizeList(prefs);\n  GetEnabledLabs(prefs, result);\n}\n\nint GetCurrentPlatform() {\n#if defined(OS_MACOSX)\n  return kOsMac;\n#elif defined(OS_WIN)\n  return kOsWin;\n#elif defined(OS_LINUX)\n  return kOsLinux;\n#else\n#error Unknown platform\n#endif\n}\n\nbool IsEnabled() {\n#if defined(OS_CHROMEOS)\n  \/\/ ChromeOS uses a different mechanism for about:labs; integrated with their\n  \/\/ dom ui options.\n  return false;\n#elif defined(GOOGLE_CHROME_BUILD)\n  \/\/ Don't enable this on the stable channel.\n  return !platform_util::GetVersionStringModifier().empty();\n#else\n  return true;\n#endif\n}\n\nvoid ConvertLabsToSwitches(Profile* profile, CommandLine* command_line) {\n  \/\/ Do not activate labs features on the stable channel.\n  if (!IsEnabled())\n    return;\n\n  std::set<std::string> enabled_experiments;\n  GetSanitizedEnabledLabs(profile->GetPrefs(), &enabled_experiments);\n\n  std::map<std::string, const Experiment*> experiments;\n  for (size_t i = 0; i < arraysize(kExperiments); ++i)\n    experiments[kExperiments[i].internal_name] = &kExperiments[i];\n\n  for (std::set<std::string>::iterator it = enabled_experiments.begin();\n       it != enabled_experiments.end();\n       ++it) {\n    const std::string& experiment_name = *it;\n    std::map<std::string, const Experiment*>::iterator experiment =\n        experiments.find(experiment_name);\n    DCHECK(experiment != experiments.end());\n    if (experiment == experiments.end())\n      continue;\n\n    command_line->AppendSwitch(experiment->second->command_line);\n  }\n}\n\nListValue* GetLabsExperimentsData(Profile* profile) {\n  std::set<std::string> enabled_experiments;\n  GetSanitizedEnabledLabs(profile->GetPrefs(), &enabled_experiments);\n\n  int current_platform = GetCurrentPlatform();\n\n  ListValue* experiments_data = new ListValue();\n  for (size_t i = 0; i < arraysize(kExperiments); ++i) {\n    const Experiment& experiment = kExperiments[i];\n    if (!(experiment.supported_platforms & current_platform))\n      continue;\n\n    DictionaryValue* data = new DictionaryValue();\n    data->SetString(\"internal_name\", experiment.internal_name);\n    data->SetString(\"name\",\n                    l10n_util::GetStringUTF16(experiment.visible_name_id));\n    data->SetString(\"description\",\n                    l10n_util::GetStringUTF16(\n                        experiment.visible_description_id));\n    data->SetBoolean(\"enabled\",\n                      enabled_experiments.count(experiment.internal_name) > 0);\n\n    experiments_data->Append(data);\n  }\n  return experiments_data;\n}\n\nstatic bool needs_restart_ = false;\n\nbool IsRestartNeededToCommitChanges() {\n  return needs_restart_;\n}\n\nvoid SetExperimentEnabled(\n    Profile* profile, const std::string& internal_name, bool enable) {\n  needs_restart_ = true;\n\n  std::set<std::string> enabled_experiments;\n  GetSanitizedEnabledLabs(profile->GetPrefs(), &enabled_experiments);\n\n  if (enable)\n    enabled_experiments.insert(internal_name);\n  else\n    enabled_experiments.erase(internal_name);\n\n  SetEnabledLabs(profile->GetPrefs(), enabled_experiments);\n}\n\n}  \/\/ namespace Labs\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010-2021, 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 \"mfem.hpp\"\n#include \"unit_tests.hpp\"\n#include \"linalg\/dtensor.hpp\"\n\nusing namespace mfem;\n\nTEST_CASE(\"DenseMatrix init-list construction\", \"[DenseMatrix]\")\n{\n   double ContigData[6] = {6.0, 5.0, 4.0, 3.0, 2.0, 1.0};\n   DenseMatrix Contiguous(ContigData, 2, 3);\n\n   DenseMatrix Nested(\n   {\n      {6.0, 4.0, 2.0},\n      {5.0, 3.0, 1.0}\n   });\n\n   for (int i = 0; i < Contiguous.Height(); i++)\n   {\n      for (int j = 0; j < Contiguous.Width(); j++)\n      {\n         REQUIRE(Nested(i,j) == Contiguous(i,j));\n      }\n   }\n}\n\nTEST_CASE(\"DenseMatrix LinearSolve methods\",\n          \"[DenseMatrix]\")\n{\n   SECTION(\"singular_system\")\n   {\n      constexpr int N = 3;\n\n      DenseMatrix A(N);\n      A.SetRow(0, 0.0);\n      A.SetRow(1, 0.0);\n      A.SetRow(2, 0.0);\n\n      double X[3];\n\n      REQUIRE_FALSE(LinearSolve(A,X));\n   }\n\n   SECTION(\"1x1_system\")\n   {\n      constexpr int N = 1;\n      DenseMatrix A(N);\n      A(0,0) = 2;\n\n      double X[1] = { 12 };\n\n      REQUIRE(LinearSolve(A,X));\n      REQUIRE(X[0] == MFEM_Approx(6));\n   }\n\n   SECTION(\"2x2_system\")\n   {\n      constexpr int N = 2;\n\n      DenseMatrix A(N);\n      A(0,0) = 2.0; A(0,1) = 1.0;\n      A(1,0) = 3.0; A(1,1) = 4.0;\n\n      double X[2] = { 1, 14 };\n\n      REQUIRE(LinearSolve(A,X));\n      REQUIRE(X[0] == MFEM_Approx(-2));\n      REQUIRE(X[1] == MFEM_Approx(5));\n   }\n\n   SECTION(\"3x3_system\")\n   {\n      constexpr int N = 3;\n\n      DenseMatrix A(N);\n      A(0,0) = 4; A(0,1) =  5; A(0,2) = -2;\n      A(1,0) = 7; A(1,1) = -1; A(1,2) =  2;\n      A(2,0) = 3; A(2,1) =  1; A(2,2) =  4;\n\n      double X[3] = { -14, 42, 28 };\n\n      REQUIRE(LinearSolve(A,X));\n      REQUIRE(X[0] == MFEM_Approx(4));\n      REQUIRE(X[1] == MFEM_Approx(-4));\n      REQUIRE(X[2] == MFEM_Approx(5));\n   }\n\n}\n\nTEST_CASE(\"DenseMatrix A*B^T methods\",\n          \"[DenseMatrix]\")\n{\n   double tol = 1e-12;\n\n   double AtData[6] = {6.0, 5.0,\n                       4.0, 3.0,\n                       2.0, 1.0\n                      };\n   double BtData[12] = {1.0, 3.0, 5.0, 7.0,\n                        2.0, 4.0, 6.0, 8.0,\n                        1.0, 2.0, 3.0, 5.0\n                       };\n\n   DenseMatrix A(AtData, 2, 3);\n   DenseMatrix B(BtData, 4, 3);\n   DenseMatrix C(2,4);\n\n   SECTION(\"MultABt\")\n   {\n      double BData[12] = {1.0, 2.0, 1.0,\n                          3.0, 4.0, 2.0,\n                          5.0, 6.0, 3.0,\n                          7.0, 8.0, 5.0\n                         };\n      DenseMatrix Bt(BData, 3, 4);\n\n      double CtData[8] = {16.0, 12.0,\n                          38.0, 29.0,\n                          60.0, 46.0,\n                          84.0, 64.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      MultABt(A, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      Mult(A, Bt, Cexact);\n      MultABt(A, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n   SECTION(\"MultADBt\")\n   {\n      double DData[3] = {11.0, 7.0, 5.0};\n      Vector D(DData, 3);\n\n      double CtData[8] = {132.0, 102.0,\n                          330.0, 259.0,\n                          528.0, 416.0,\n                          736.0, 578.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      MultADBt(A, D, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n   SECTION(\"AddMultABt\")\n   {\n      double CtData[8] = {17.0, 17.0,\n                          40.0, 35.0,\n                          63.0, 53.0,\n                          88.0, 72.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      C(0, 0) = 1.0; C(0, 1) = 2.0; C(0, 2) = 3.0; C(0, 3) = 4.0;\n      C(1, 0) = 5.0; C(1, 1) = 6.0; C(1, 2) = 7.0; C(1, 3) = 8.0;\n\n      AddMultABt(A, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      MultABt(A, B, C);\n      C *= -1.0;\n      AddMultABt(A, B, C);\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n   SECTION(\"AddMultADBt\")\n   {\n      double DData[3] = {11.0, 7.0, 5.0};\n      Vector D(DData, 3);\n\n      double CtData[8] = {133.0, 107.0,\n                          332.0, 265.0,\n                          531.0, 423.0,\n                          740.0, 586.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      C(0, 0) = 1.0; C(0, 1) = 2.0; C(0, 2) = 3.0; C(0, 3) = 4.0;\n      C(1, 0) = 5.0; C(1, 1) = 6.0; C(1, 2) = 7.0; C(1, 3) = 8.0;\n\n      AddMultADBt(A, D, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      MultADBt(A, D, B, C);\n      C *= -1.0;\n      AddMultADBt(A, D, B, C);\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      DData[0] = 1.0; DData[1] = 1.0; DData[2] = 1.0;\n      MultABt(A, B, C);\n      C *= -1.0;\n      AddMultADBt(A, D, B, C);\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n   SECTION(\"AddMult_a_ABt\")\n   {\n      double a = 3.0;\n\n      double CtData[8] = { 49.0,  41.0,\n                           116.0,  93.0,\n                           183.0, 145.0,\n                           256.0, 200.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      C(0, 0) = 1.0; C(0, 1) = 2.0; C(0, 2) = 3.0; C(0, 3) = 4.0;\n      C(1, 0) = 5.0; C(1, 1) = 6.0; C(1, 2) = 7.0; C(1, 3) = 8.0;\n\n      AddMult_a_ABt(a, A, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      MultABt(A, B, C);\n      AddMult_a_ABt(-1.0, A, B, C);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n}\n\n\nTEST_CASE(\"LUFactors RightSolve\", \"[DenseMatrix]\")\n{\n   double tol = 1e-12;\n\n   \/\/ Zero on diagonal forces non-trivial pivot\n   double AData[9] = { 0.0, 0.0, 3.0, 2.0, 2.0, 2.0, 2.0, 0.0, 4.0 };\n   double BData[6] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 };\n   int ipiv[3];\n\n   DenseMatrix A(AData, 3, 3);\n   DenseMatrix B(BData, 2, 3);\n\n   DenseMatrixInverse Af1(A);\n   DenseMatrix Ainv;\n   Af1.GetInverseMatrix(Ainv);\n\n   LUFactors Af2(AData, ipiv);\n   Af2.Factor(3);\n\n   DenseMatrix C(2,3);\n   Mult(B, Ainv, C);\n   Af2.RightSolve(3, 2, B.GetData());\n   C -= B;\n\n   REQUIRE(C.MaxMaxNorm() < tol);\n}\n\nTEST_CASE(\"DenseTensor LinearSolve methods\",\n          \"[DenseMatrix]\")\n{\n\n   int N = 3;\n   DenseMatrix A(N);\n   A(0,0) = 4; A(0,1) =  5; A(0,2) = -2;\n   A(1,0) = 7; A(1,1) = -1; A(1,2) =  2;\n   A(2,0) = 3; A(2,1) =  1; A(2,2) =  4;\n\n   double X[3] = { -14, 42, 28 };\n\n   int NE = 10;\n   Vector X_batch(N*NE);\n   DenseTensor A_batch(N,N,NE);\n\n   auto a_batch = mfem::Reshape(A_batch.HostWrite(),N,N,NE);\n   auto x_batch = mfem::Reshape(X_batch.HostWrite(),N,NE);\n   \/\/ Column major\n   for (int e=0; e<NE; ++e)\n   {\n\n      for (int r=0; r<N; ++r)\n      {\n         for (int c=0; c<N; ++c)\n         {\n            a_batch(c, r, e) = A.GetData()[c+r*N];\n         }\n         x_batch(r,e) = X[r];\n      }\n   }\n\n   Array<int> P;\n   BatchLUFactor(A_batch, P);\n   BatchLUSolve(A_batch, P, X_batch);\n\n   auto xans_batch = mfem::Reshape(X_batch.HostRead(),N,NE);\n   REQUIRE(LinearSolve(A,X));\n   for (int e=0; e<NE; ++e)\n   {\n      for (int r=0; r<N; ++r)\n      {\n         REQUIRE(xans_batch(r,e) == MFEM_Approx(X[r]));\n      }\n   }\n}\n\nTEST_CASE(\"DenseTensor copy\", \"[DenseMatrix][DenseTensor]\")\n{\n   DenseTensor t1(2,3,4);\n   for (int i=0; i<t1.TotalSize(); ++i)\n   {\n      t1.Data()[i] = i;\n   }\n   DenseTensor t2(t1);\n   DenseTensor t3;\n   t3 = t1;\n   REQUIRE(t2.SizeI() == t1.SizeI());\n   REQUIRE(t2.SizeJ() == t1.SizeJ());\n   REQUIRE(t2.SizeK() == t1.SizeK());\n\n   REQUIRE(t3.SizeI() == t1.SizeI());\n   REQUIRE(t3.SizeJ() == t1.SizeJ());\n   REQUIRE(t3.SizeK() == t1.SizeK());\n\n   REQUIRE(t2.Data() != t1.Data());\n   REQUIRE(t3.Data() != t1.Data());\n\n   for (int i=0; i<t1.TotalSize(); ++i)\n   {\n      REQUIRE(t2.Data()[i] == t1.Data()[i]);\n      REQUIRE(t3.Data()[i] == t1.Data()[i]);\n   }\n}\n<commit_msg>adding unit tests for Generalized EigSystem and SVDs<commit_after>\/\/ Copyright (c) 2010-2021, 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 \"mfem.hpp\"\n#include \"unit_tests.hpp\"\n#include \"linalg\/dtensor.hpp\"\n\nusing namespace mfem;\n\nTEST_CASE(\"DenseMatrix init-list construction\", \"[DenseMatrix]\")\n{\n   double ContigData[6] = {6.0, 5.0, 4.0, 3.0, 2.0, 1.0};\n   DenseMatrix Contiguous(ContigData, 2, 3);\n\n   DenseMatrix Nested(\n   {\n      {6.0, 4.0, 2.0},\n      {5.0, 3.0, 1.0}\n   });\n\n   for (int i = 0; i < Contiguous.Height(); i++)\n   {\n      for (int j = 0; j < Contiguous.Width(); j++)\n      {\n         REQUIRE(Nested(i,j) == Contiguous(i,j));\n      }\n   }\n}\n\nTEST_CASE(\"DenseMatrix LinearSolve methods\",\n          \"[DenseMatrix]\")\n{\n   SECTION(\"singular_system\")\n   {\n      constexpr int N = 3;\n\n      DenseMatrix A(N);\n      A.SetRow(0, 0.0);\n      A.SetRow(1, 0.0);\n      A.SetRow(2, 0.0);\n\n      double X[3];\n\n      REQUIRE_FALSE(LinearSolve(A,X));\n   }\n\n   SECTION(\"1x1_system\")\n   {\n      constexpr int N = 1;\n      DenseMatrix A(N);\n      A(0,0) = 2;\n\n      double X[1] = { 12 };\n\n      REQUIRE(LinearSolve(A,X));\n      REQUIRE(X[0] == MFEM_Approx(6));\n   }\n\n   SECTION(\"2x2_system\")\n   {\n      constexpr int N = 2;\n\n      DenseMatrix A(N);\n      A(0,0) = 2.0; A(0,1) = 1.0;\n      A(1,0) = 3.0; A(1,1) = 4.0;\n\n      double X[2] = { 1, 14 };\n\n      REQUIRE(LinearSolve(A,X));\n      REQUIRE(X[0] == MFEM_Approx(-2));\n      REQUIRE(X[1] == MFEM_Approx(5));\n   }\n\n   SECTION(\"3x3_system\")\n   {\n      constexpr int N = 3;\n\n      DenseMatrix A(N);\n      A(0,0) = 4; A(0,1) =  5; A(0,2) = -2;\n      A(1,0) = 7; A(1,1) = -1; A(1,2) =  2;\n      A(2,0) = 3; A(2,1) =  1; A(2,2) =  4;\n\n      double X[3] = { -14, 42, 28 };\n\n      REQUIRE(LinearSolve(A,X));\n      REQUIRE(X[0] == MFEM_Approx(4));\n      REQUIRE(X[1] == MFEM_Approx(-4));\n      REQUIRE(X[2] == MFEM_Approx(5));\n   }\n\n}\n\nTEST_CASE(\"DenseMatrix A*B^T methods\",\n          \"[DenseMatrix]\")\n{\n   double tol = 1e-12;\n\n   double AtData[6] = {6.0, 5.0,\n                       4.0, 3.0,\n                       2.0, 1.0\n                      };\n   double BtData[12] = {1.0, 3.0, 5.0, 7.0,\n                        2.0, 4.0, 6.0, 8.0,\n                        1.0, 2.0, 3.0, 5.0\n                       };\n\n   DenseMatrix A(AtData, 2, 3);\n   DenseMatrix B(BtData, 4, 3);\n   DenseMatrix C(2,4);\n\n   SECTION(\"MultABt\")\n   {\n      double BData[12] = {1.0, 2.0, 1.0,\n                          3.0, 4.0, 2.0,\n                          5.0, 6.0, 3.0,\n                          7.0, 8.0, 5.0\n                         };\n      DenseMatrix Bt(BData, 3, 4);\n\n      double CtData[8] = {16.0, 12.0,\n                          38.0, 29.0,\n                          60.0, 46.0,\n                          84.0, 64.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      MultABt(A, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      Mult(A, Bt, Cexact);\n      MultABt(A, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n   SECTION(\"MultADBt\")\n   {\n      double DData[3] = {11.0, 7.0, 5.0};\n      Vector D(DData, 3);\n\n      double CtData[8] = {132.0, 102.0,\n                          330.0, 259.0,\n                          528.0, 416.0,\n                          736.0, 578.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      MultADBt(A, D, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n   SECTION(\"AddMultABt\")\n   {\n      double CtData[8] = {17.0, 17.0,\n                          40.0, 35.0,\n                          63.0, 53.0,\n                          88.0, 72.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      C(0, 0) = 1.0; C(0, 1) = 2.0; C(0, 2) = 3.0; C(0, 3) = 4.0;\n      C(1, 0) = 5.0; C(1, 1) = 6.0; C(1, 2) = 7.0; C(1, 3) = 8.0;\n\n      AddMultABt(A, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      MultABt(A, B, C);\n      C *= -1.0;\n      AddMultABt(A, B, C);\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n   SECTION(\"AddMultADBt\")\n   {\n      double DData[3] = {11.0, 7.0, 5.0};\n      Vector D(DData, 3);\n\n      double CtData[8] = {133.0, 107.0,\n                          332.0, 265.0,\n                          531.0, 423.0,\n                          740.0, 586.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      C(0, 0) = 1.0; C(0, 1) = 2.0; C(0, 2) = 3.0; C(0, 3) = 4.0;\n      C(1, 0) = 5.0; C(1, 1) = 6.0; C(1, 2) = 7.0; C(1, 3) = 8.0;\n\n      AddMultADBt(A, D, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      MultADBt(A, D, B, C);\n      C *= -1.0;\n      AddMultADBt(A, D, B, C);\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      DData[0] = 1.0; DData[1] = 1.0; DData[2] = 1.0;\n      MultABt(A, B, C);\n      C *= -1.0;\n      AddMultADBt(A, D, B, C);\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n   SECTION(\"AddMult_a_ABt\")\n   {\n      double a = 3.0;\n\n      double CtData[8] = { 49.0,  41.0,\n                           116.0,  93.0,\n                           183.0, 145.0,\n                           256.0, 200.0\n                         };\n      DenseMatrix Cexact(CtData, 2, 4);\n\n      C(0, 0) = 1.0; C(0, 1) = 2.0; C(0, 2) = 3.0; C(0, 3) = 4.0;\n      C(1, 0) = 5.0; C(1, 1) = 6.0; C(1, 2) = 7.0; C(1, 3) = 8.0;\n\n      AddMult_a_ABt(a, A, B, C);\n      C.Add(-1.0, Cexact);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n\n      MultABt(A, B, C);\n      AddMult_a_ABt(-1.0, A, B, C);\n\n      REQUIRE(C.MaxMaxNorm() < tol);\n   }\n}\n\n\nTEST_CASE(\"LUFactors RightSolve\", \"[DenseMatrix]\")\n{\n   double tol = 1e-12;\n\n   \/\/ Zero on diagonal forces non-trivial pivot\n   double AData[9] = { 0.0, 0.0, 3.0, 2.0, 2.0, 2.0, 2.0, 0.0, 4.0 };\n   double BData[6] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 };\n   int ipiv[3];\n\n   DenseMatrix A(AData, 3, 3);\n   DenseMatrix B(BData, 2, 3);\n\n   DenseMatrixInverse Af1(A);\n   DenseMatrix Ainv;\n   Af1.GetInverseMatrix(Ainv);\n\n   LUFactors Af2(AData, ipiv);\n   Af2.Factor(3);\n\n   DenseMatrix C(2,3);\n   Mult(B, Ainv, C);\n   Af2.RightSolve(3, 2, B.GetData());\n   C -= B;\n\n   REQUIRE(C.MaxMaxNorm() < tol);\n}\n\nTEST_CASE(\"DenseTensor LinearSolve methods\",\n          \"[DenseMatrix]\")\n{\n\n   int N = 3;\n   DenseMatrix A(N);\n   A(0,0) = 4; A(0,1) =  5; A(0,2) = -2;\n   A(1,0) = 7; A(1,1) = -1; A(1,2) =  2;\n   A(2,0) = 3; A(2,1) =  1; A(2,2) =  4;\n\n   double X[3] = { -14, 42, 28 };\n\n   int NE = 10;\n   Vector X_batch(N*NE);\n   DenseTensor A_batch(N,N,NE);\n\n   auto a_batch = mfem::Reshape(A_batch.HostWrite(),N,N,NE);\n   auto x_batch = mfem::Reshape(X_batch.HostWrite(),N,NE);\n   \/\/ Column major\n   for (int e=0; e<NE; ++e)\n   {\n\n      for (int r=0; r<N; ++r)\n      {\n         for (int c=0; c<N; ++c)\n         {\n            a_batch(c, r, e) = A.GetData()[c+r*N];\n         }\n         x_batch(r,e) = X[r];\n      }\n   }\n\n   Array<int> P;\n   BatchLUFactor(A_batch, P);\n   BatchLUSolve(A_batch, P, X_batch);\n\n   auto xans_batch = mfem::Reshape(X_batch.HostRead(),N,NE);\n   REQUIRE(LinearSolve(A,X));\n   for (int e=0; e<NE; ++e)\n   {\n      for (int r=0; r<N; ++r)\n      {\n         REQUIRE(xans_batch(r,e) == MFEM_Approx(X[r]));\n      }\n   }\n}\n\nTEST_CASE(\"DenseTensor copy\", \"[DenseMatrix][DenseTensor]\")\n{\n   DenseTensor t1(2,3,4);\n   for (int i=0; i<t1.TotalSize(); ++i)\n   {\n      t1.Data()[i] = i;\n   }\n   DenseTensor t2(t1);\n   DenseTensor t3;\n   t3 = t1;\n   REQUIRE(t2.SizeI() == t1.SizeI());\n   REQUIRE(t2.SizeJ() == t1.SizeJ());\n   REQUIRE(t2.SizeK() == t1.SizeK());\n\n   REQUIRE(t3.SizeI() == t1.SizeI());\n   REQUIRE(t3.SizeJ() == t1.SizeJ());\n   REQUIRE(t3.SizeK() == t1.SizeK());\n\n   REQUIRE(t2.Data() != t1.Data());\n   REQUIRE(t3.Data() != t1.Data());\n\n   for (int i=0; i<t1.TotalSize(); ++i)\n   {\n      REQUIRE(t2.Data()[i] == t1.Data()[i]);\n      REQUIRE(t3.Data()[i] == t1.Data()[i]);\n   }\n}\n\n#ifdef MFEM_USE_LAPACK\n\n\nenum class TestCase { GenEigSPD, GenEigGE, SVD};\nstd::string TestCaseName(TestCase testcase)\n{\n   switch (testcase)\n   {\n      case TestCase::GenEigSPD:\n         return \"Generalized Eigenvalue problem for an SPD matrix\";\n      case TestCase::GenEigGE:\n         return \"Generalized Eigenvalue problem for a general matrix\";\n      case TestCase::SVD:\n         return \"Singula Value Decomposition for a general matrix\";\n   }\n   return \"\";\n}\n\nTEST_CASE(\"Eigensystem Problems\",\n          \"[DenseMatrix]\")\n{\n   auto testcase = GENERATE(TestCase::GenEigSPD, TestCase::GenEigGE,\n                            TestCase::SVD);\n\n   CAPTURE(TestCaseName(testcase));\n\n   DenseMatrix M({{0.279841, 0.844288, 0.498302, 0.323955},\n      {0.884680, 0.243511, 0.397405, 0.265708},\n      {0.649685, 0.700754, 0.586396, 0.023724},\n      {0.081588, 0.728236, 0.083123, 0.488041}\n   });\n\n   switch (testcase)\n   {\n      case TestCase::GenEigSPD:\n      {\n         DenseMatrix A({{0.56806, 0.29211, 0.48315, 0.70024},\n            {0.29211, 0.85147, 0.68123, 0.70689},\n            {0.48315, 0.68123, 1.07229, 1.02681},\n            {0.70024, 0.70689, 1.02681, 1.15468}});\n\n         DenseMatrixGeneralizedEigensystem geig(A,M,true,true);\n         geig.Eval();\n         Vector & Lamda = geig.EigenvaluesRealPart();\n         DenseMatrix & Vl = geig.LeftEigenvectors();\n         DenseMatrix & Vr = geig.RightEigenvectors();\n\n         \/\/ check A * Vr - L * M * Vr\n         DenseMatrix AVr(4);\n         DenseMatrix MVr(4);\n         Mult(A,Vr,AVr);\n         Mult(M,Vr,MVr);\n         MVr.RightScaling(Lamda);\n         AVr-=MVr;\n\n         REQUIRE(AVr.MaxMaxNorm() == MFEM_Approx(0.));\n\n         \/\/ check Vl^t * A - L * Vl^t * M\n         DenseMatrix VltA(4);\n         DenseMatrix VltM(4);\n         MultAtB(Vl,A,VltA);\n         MultAtB(Vl,M,VltM);\n         VltM.LeftScaling(Lamda);\n         VltA-=VltM;\n\n         REQUIRE(VltA.MaxMaxNorm() == MFEM_Approx(0.));\n\n      }\n      break;\n      case TestCase::GenEigGE:\n      {\n         DenseMatrix A({{0.486278, 0.041135, 0.480727, 0.616026},\n            {0.523599, 0.119827, 0.087808, 0.415241},\n            {0.214454, 0.661631, 0.909626, 0.744259},\n            {0.107007, 0.630604, 0.077862, 0.221006}});\n\n         mfem::out << \"TestCase::GenEigGE: TODO\" << std::endl;\n\n      }\n      break;\n      case TestCase::SVD:\n      {\n         DenseMatrix Mc(M);\n         DenseMatrixSVD svd(Mc,true,true);\n         svd.Eval(Mc);\n         Vector &sigma = svd.Singularvalues();\n         DenseMatrix &U = svd.LeftSingularvectors();\n         DenseMatrix &V = svd.RightSingularvectors();\n\n         DenseMatrix Vt(V);\n         Vt.Transpose();\n         DenseMatrix USVt(4);\n         MultADBt(U,sigma,Vt,USVt);\n\n         USVt -= M;\n\n         REQUIRE(USVt.MaxMaxNorm() == MFEM_Approx(0.));\n      }\n      break;\n   }\n}\n\n#endif \/\/ if MFEM_USE_LAPACK<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (C) 2015 German Aerospace Center (DLR\/SC)\n*\n* Created: 2015-05-08 Martin Siggel <Martin.Siggel@dlr.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#include \"tigl.h\"\n#include \"tiglcommonfunctions.h\"\n#include \"test.h\"\n#include <BRep_Builder.hxx>\n#include <BRepTools.hxx>\n\n#include <gp_Pln.hxx>\n#include <BRepPrimAPI_MakeBox.hxx>\n#include <BRepBuilderAPI_MakeVertex.hxx>\n\n#include <list>\n\nTEST(TiglCommonFunctions, isPathRelative)\n{\n    ASSERT_TRUE(IsPathRelative(\".\/test.txt\"));\n\n    ASSERT_TRUE(IsPathRelative(\"test.txt\"));\n\n    ASSERT_TRUE(IsPathRelative(\"..\/test.txt\"));\n\n    \/\/ check absolute paths\n#ifdef WIN32\n    ASSERT_FALSE(IsPathRelative(\"d:\/data\/test.txt\"));\n#else\n    ASSERT_FALSE(IsPathRelative(\"\/usr\/bin\/test.txt\"));\n#endif\n}\n\nTEST(TiglCommonFunctions, isFileReadable)\n{\n    ASSERT_TRUE(IsFileReadable(\"TestData\/nacelle.stp\"));\n    ASSERT_FALSE(IsFileReadable(\"invalidfile.txt\"));\n}\n\nTEST(TiglCommonFunctions, getEdgeContinuity)\n{\n    TopoDS_Edge edge1;\n    TopoDS_Edge edge2;\n    TopoDS_Edge edge3;\n    BRep_Builder b;\n    BRepTools::Read(edge1, \"TestData\/checkEdgeContinuity_edge1.brep\", b);\n    BRepTools::Read(edge2, \"TestData\/checkEdgeContinuity_edge2.brep\", b);\n    BRepTools::Read(edge3, \"TestData\/checkEdgeContinuity_edge3.brep\", b);\n    ASSERT_EQ(C2, getEdgeContinuity(edge1, edge2));\n    ASSERT_EQ(C0, getEdgeContinuity(edge2, edge3));\n    ASSERT_EQ(C0, getEdgeContinuity(edge3, edge1));\n}\n\nTEST(TiglCommonFunctions, IntersectLinePlane)\n{\n    gp_Pln plane(gp_Pnt(10., 2., 0.), gp_Dir(0., 1., 0));\n\n    gp_Pnt result;\n    ASSERT_EQ(BetweenPoints, IntersectLinePlane(gp_Pnt(0., 0., 0.), gp_Pnt(0., 4., 0.), plane, result));\n    ASSERT_NEAR(0., result.Distance(gp_Pnt(0., 2., 0)), 1e-10);\n\n    ASSERT_EQ(OutsideBefore, IntersectLinePlane(gp_Pnt(1., 3., 0.), gp_Pnt(1., 4., 0.), plane, result));\n    ASSERT_NEAR(0., result.Distance(gp_Pnt(1., 2., 0)), 1e-10);\n\n    ASSERT_EQ(OutsideAfter, IntersectLinePlane(gp_Pnt(1., 0., 0.), gp_Pnt(1., 1., 0.), plane, result));\n    ASSERT_NEAR(0., result.Distance(gp_Pnt(1., 2., 0)), 1e-10);\n\n    ASSERT_EQ(NoIntersection, IntersectLinePlane(gp_Pnt(1., 3., 0.), gp_Pnt(10., 3., 0.), plane, result));\n}\n\nTEST(TiglCommonFunctions, IsPointInsideShape)\n{\n    TopoDS_Shape box = BRepPrimAPI_MakeBox(1., 1., 1).Solid();\n\n    EXPECT_TRUE(IsPointInsideShape(box, gp_Pnt(0.5, 0.5, 0.5)));\n    EXPECT_TRUE(IsPointInsideShape(box, gp_Pnt(1.0, 0.5, 0.5)));\n\n    EXPECT_FALSE(IsPointInsideShape(box, gp_Pnt(1.5, 0.5, 0.5)));\n\n    TopoDS_Shape boxrev = box.Reversed();\n\n    EXPECT_TRUE(IsPointInsideShape(boxrev, gp_Pnt(0.5, 0.5, 0.5)));\n    EXPECT_TRUE(IsPointInsideShape(boxrev, gp_Pnt(1.0, 0.5, 0.5)));\n\n    EXPECT_FALSE(IsPointInsideShape(boxrev, gp_Pnt(1.5, 0.5, 0.5)));\n\n    \/\/ check tolerance of 1e-3\n    EXPECT_TRUE(IsPointInsideShape(boxrev, gp_Pnt(1.0009, 0.5, 0.5)));\n    EXPECT_FALSE(IsPointInsideShape(boxrev, gp_Pnt(1.0011, 0.5, 0.5)));\n\n    \/\/ The function requires a solid, else it will throw\n    TopoDS_Vertex v = BRepBuilderAPI_MakeVertex(gp_Pnt(10., 10., 10.));\n    EXPECT_THROW(IsPointInsideShape(v, gp_Pnt(0., 0., 0.)), tigl::CTiglError);\n}\n\nTEST(TiglCommonFunctions, tiglCheckPointInside_api)\n{\n    TixiDocumentHandle tixiSimpleWingHandle = -1;\n    TiglCPACSConfigurationHandle tiglSimpleWingHandle = -1;\n\n    ReturnCode tixiRet = tixiOpenDocument(\"TestData\/simpletest.cpacs.xml\", &tixiSimpleWingHandle);\n    ASSERT_EQ (SUCCESS, tixiRet);\n\n    TiglReturnCode tiglRet = tiglOpenCPACSConfiguration(tixiSimpleWingHandle, \"Cpacs2Test\", &tiglSimpleWingHandle);\n    ASSERT_EQ(TIGL_SUCCESS, tiglRet);\n\n    TiglBoolean isInside = TIGL_FALSE;\n\n    ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 0., \"segmentD150_Fuselage_1Segment2ID\", &isInside));\n    EXPECT_EQ(TIGL_TRUE, isInside);\n\n    ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 2., \"segmentD150_Fuselage_1Segment2ID\", &isInside));\n    EXPECT_EQ(TIGL_FALSE, isInside);\n\n    \/\/ test errors\n    EXPECT_EQ(TIGL_UID_ERROR, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 0., \"wrongUID\", &isInside));\n    EXPECT_EQ(TIGL_NOT_FOUND, tiglCheckPointInside(-1, 0., 0., 0., \"wrongUID\", &isInside));\n    EXPECT_EQ(TIGL_NULL_POINTER, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 0., NULL, &isInside));\n    EXPECT_EQ(TIGL_NULL_POINTER, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 0., \"wrongUID\", NULL));\n\n\n}\n\nTEST(TiglCommonFunctions, LinspaceWithBreaks)\n{\n    std::vector<double> breaks;\n    breaks.push_back(0.25);\n    breaks.push_back(0.49);\n    breaks.push_back(0.62);\n    breaks.push_back(0.);\n    breaks.push_back(1.0);\n    std::vector<double> res = LinspaceWithBreaks(0., 1., 11, breaks);\n    ASSERT_EQ(12, res.size());\n    EXPECT_NEAR(0.00, res[0], 1e-10);\n    EXPECT_NEAR(0.10, res[1], 1e-10);\n    EXPECT_NEAR(0.20, res[2], 1e-10);\n    EXPECT_NEAR(0.25, res[3], 1e-10);\n    EXPECT_NEAR(0.30, res[4], 1e-10);\n    EXPECT_NEAR(0.40, res[5], 1e-10);\n    EXPECT_NEAR(0.49, res[6], 1e-10);\n    EXPECT_NEAR(0.62, res[7], 1e-10);\n    EXPECT_NEAR(0.70, res[8], 1e-10);\n    EXPECT_NEAR(0.80, res[9], 1e-10);\n    EXPECT_NEAR(0.90, res[10], 1e-10);\n    EXPECT_NEAR(1.00, res[11], 1e-10);\n}\n\nTEST(TiglCommonFunctions, ReplaceAdjacentWith)\n{\n    auto is_adjacent = [](int v1, int v2) {\n        return v1 + 1 == v2;\n    };\n    \n    auto merged = [](int v1, int v2) {\n        return v2;\n    };\n    \n    std::list<int> a = {1, 2, 3, 10};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({3, 10}, a));\n    \n    a = {1, 2, 5, 6, 7, 9, 11, 23,24};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({2, 7, 9, 11, 24}, a));\n    \n    a = {5};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({5}, a));\n    \n    a = {5, 6};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({6}, a));\n    \n    a = {};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({}, a));\n \n}\n<commit_msg>Style change<commit_after>\/*\n* Copyright (C) 2015 German Aerospace Center (DLR\/SC)\n*\n* Created: 2015-05-08 Martin Siggel <Martin.Siggel@dlr.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#include \"tigl.h\"\n#include \"tiglcommonfunctions.h\"\n#include \"test.h\"\n#include <BRep_Builder.hxx>\n#include <BRepTools.hxx>\n\n#include <gp_Pln.hxx>\n#include <BRepPrimAPI_MakeBox.hxx>\n#include <BRepBuilderAPI_MakeVertex.hxx>\n\n#include <list>\n\nTEST(TiglCommonFunctions, isPathRelative)\n{\n    ASSERT_TRUE(IsPathRelative(\".\/test.txt\"));\n\n    ASSERT_TRUE(IsPathRelative(\"test.txt\"));\n\n    ASSERT_TRUE(IsPathRelative(\"..\/test.txt\"));\n\n    \/\/ check absolute paths\n#ifdef WIN32\n    ASSERT_FALSE(IsPathRelative(\"d:\/data\/test.txt\"));\n#else\n    ASSERT_FALSE(IsPathRelative(\"\/usr\/bin\/test.txt\"));\n#endif\n}\n\nTEST(TiglCommonFunctions, isFileReadable)\n{\n    ASSERT_TRUE(IsFileReadable(\"TestData\/nacelle.stp\"));\n    ASSERT_FALSE(IsFileReadable(\"invalidfile.txt\"));\n}\n\nTEST(TiglCommonFunctions, getEdgeContinuity)\n{\n    TopoDS_Edge edge1;\n    TopoDS_Edge edge2;\n    TopoDS_Edge edge3;\n    BRep_Builder b;\n    BRepTools::Read(edge1, \"TestData\/checkEdgeContinuity_edge1.brep\", b);\n    BRepTools::Read(edge2, \"TestData\/checkEdgeContinuity_edge2.brep\", b);\n    BRepTools::Read(edge3, \"TestData\/checkEdgeContinuity_edge3.brep\", b);\n    ASSERT_EQ(C2, getEdgeContinuity(edge1, edge2));\n    ASSERT_EQ(C0, getEdgeContinuity(edge2, edge3));\n    ASSERT_EQ(C0, getEdgeContinuity(edge3, edge1));\n}\n\nTEST(TiglCommonFunctions, IntersectLinePlane)\n{\n    gp_Pln plane(gp_Pnt(10., 2., 0.), gp_Dir(0., 1., 0));\n\n    gp_Pnt result;\n    ASSERT_EQ(BetweenPoints, IntersectLinePlane(gp_Pnt(0., 0., 0.), gp_Pnt(0., 4., 0.), plane, result));\n    ASSERT_NEAR(0., result.Distance(gp_Pnt(0., 2., 0)), 1e-10);\n\n    ASSERT_EQ(OutsideBefore, IntersectLinePlane(gp_Pnt(1., 3., 0.), gp_Pnt(1., 4., 0.), plane, result));\n    ASSERT_NEAR(0., result.Distance(gp_Pnt(1., 2., 0)), 1e-10);\n\n    ASSERT_EQ(OutsideAfter, IntersectLinePlane(gp_Pnt(1., 0., 0.), gp_Pnt(1., 1., 0.), plane, result));\n    ASSERT_NEAR(0., result.Distance(gp_Pnt(1., 2., 0)), 1e-10);\n\n    ASSERT_EQ(NoIntersection, IntersectLinePlane(gp_Pnt(1., 3., 0.), gp_Pnt(10., 3., 0.), plane, result));\n}\n\nTEST(TiglCommonFunctions, IsPointInsideShape)\n{\n    TopoDS_Shape box = BRepPrimAPI_MakeBox(1., 1., 1).Solid();\n\n    EXPECT_TRUE(IsPointInsideShape(box, gp_Pnt(0.5, 0.5, 0.5)));\n    EXPECT_TRUE(IsPointInsideShape(box, gp_Pnt(1.0, 0.5, 0.5)));\n\n    EXPECT_FALSE(IsPointInsideShape(box, gp_Pnt(1.5, 0.5, 0.5)));\n\n    TopoDS_Shape boxrev = box.Reversed();\n\n    EXPECT_TRUE(IsPointInsideShape(boxrev, gp_Pnt(0.5, 0.5, 0.5)));\n    EXPECT_TRUE(IsPointInsideShape(boxrev, gp_Pnt(1.0, 0.5, 0.5)));\n\n    EXPECT_FALSE(IsPointInsideShape(boxrev, gp_Pnt(1.5, 0.5, 0.5)));\n\n    \/\/ check tolerance of 1e-3\n    EXPECT_TRUE(IsPointInsideShape(boxrev, gp_Pnt(1.0009, 0.5, 0.5)));\n    EXPECT_FALSE(IsPointInsideShape(boxrev, gp_Pnt(1.0011, 0.5, 0.5)));\n\n    \/\/ The function requires a solid, else it will throw\n    TopoDS_Vertex v = BRepBuilderAPI_MakeVertex(gp_Pnt(10., 10., 10.));\n    EXPECT_THROW(IsPointInsideShape(v, gp_Pnt(0., 0., 0.)), tigl::CTiglError);\n}\n\nTEST(TiglCommonFunctions, tiglCheckPointInside_api)\n{\n    TixiDocumentHandle tixiSimpleWingHandle = -1;\n    TiglCPACSConfigurationHandle tiglSimpleWingHandle = -1;\n\n    ReturnCode tixiRet = tixiOpenDocument(\"TestData\/simpletest.cpacs.xml\", &tixiSimpleWingHandle);\n    ASSERT_EQ (SUCCESS, tixiRet);\n\n    TiglReturnCode tiglRet = tiglOpenCPACSConfiguration(tixiSimpleWingHandle, \"Cpacs2Test\", &tiglSimpleWingHandle);\n    ASSERT_EQ(TIGL_SUCCESS, tiglRet);\n\n    TiglBoolean isInside = TIGL_FALSE;\n\n    ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 0., \"segmentD150_Fuselage_1Segment2ID\", &isInside));\n    EXPECT_EQ(TIGL_TRUE, isInside);\n\n    ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 2., \"segmentD150_Fuselage_1Segment2ID\", &isInside));\n    EXPECT_EQ(TIGL_FALSE, isInside);\n\n    \/\/ test errors\n    EXPECT_EQ(TIGL_UID_ERROR, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 0., \"wrongUID\", &isInside));\n    EXPECT_EQ(TIGL_NOT_FOUND, tiglCheckPointInside(-1, 0., 0., 0., \"wrongUID\", &isInside));\n    EXPECT_EQ(TIGL_NULL_POINTER, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 0., nullptr, &isInside));\n    EXPECT_EQ(TIGL_NULL_POINTER, tiglCheckPointInside(tiglSimpleWingHandle, 0., 0., 0., \"wrongUID\", nullptr));\n\n\n}\n\nTEST(TiglCommonFunctions, LinspaceWithBreaks)\n{\n    std::vector<double> breaks;\n    breaks.push_back(0.25);\n    breaks.push_back(0.49);\n    breaks.push_back(0.62);\n    breaks.push_back(0.);\n    breaks.push_back(1.0);\n    std::vector<double> res = LinspaceWithBreaks(0., 1., 11, breaks);\n    ASSERT_EQ(12, res.size());\n    EXPECT_NEAR(0.00, res[0], 1e-10);\n    EXPECT_NEAR(0.10, res[1], 1e-10);\n    EXPECT_NEAR(0.20, res[2], 1e-10);\n    EXPECT_NEAR(0.25, res[3], 1e-10);\n    EXPECT_NEAR(0.30, res[4], 1e-10);\n    EXPECT_NEAR(0.40, res[5], 1e-10);\n    EXPECT_NEAR(0.49, res[6], 1e-10);\n    EXPECT_NEAR(0.62, res[7], 1e-10);\n    EXPECT_NEAR(0.70, res[8], 1e-10);\n    EXPECT_NEAR(0.80, res[9], 1e-10);\n    EXPECT_NEAR(0.90, res[10], 1e-10);\n    EXPECT_NEAR(1.00, res[11], 1e-10);\n}\n\nTEST(TiglCommonFunctions, ReplaceAdjacentWith)\n{\n    auto is_adjacent = [](int v1, int v2) {\n        return v1 + 1 == v2;\n    };\n    \n    auto merged = [](int \/* v1 *\/, int v2) {\n        return v2;\n    };\n    \n    std::list<int> a = {1, 2, 3, 10};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({3, 10}, a));\n    \n    a = {1, 2, 5, 6, 7, 9, 11, 23, 24};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({2, 7, 9, 11, 24}, a));\n    \n    a = {5};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({5}, a));\n    \n    a = {5, 6};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({6}, a));\n    \n    a = {};\n    ReplaceAdjacentWithMerged(a, is_adjacent, merged);\n    EXPECT_TRUE(ArraysMatch({}, a));\n \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 (directui@nokia.com)\n**\n** This file is part of meegotouch-controlpanelapplets.\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_resetapplet.h\"\n#include \"resetapplet.h\"\n#include \"resetwidget.h\"\n\n#include \"resetbrief.h\"\n\n#include <dcpwidgettypes.h>\n#include <dcpbrief.h>\n\n#include <mdesktopentry.h>\n#include <MApplication>\n#include <MAction>\n#include <MDialog>\n#include <QVector>\n\n#define DEBUG\n#include \"..\/..\/src\/debug.h\"\n\n\/******************************************************************************\n * Stubbing the system() C library function here.\n *\/\nstatic QString lastExecutedCommand;\nstatic int     commandSuccess;\n\nint\nsystem (\n        const char *command)\n{\n    SYS_DEBUG (\"*** command = %s\", command);\n\n    lastExecutedCommand = command;\n    return commandSuccess;\n}\n\nstatic bool dialogAnswerYes = false;\nstatic bool dialogAnswerNo = false;\nstatic bool dialogExecuted = false;\n\nint \nMDialog::exec (MWindow *window)\n{\n    SYS_DEBUG (\"\");\n\n    Q_UNUSED (window);\n\n    dialogExecuted = true;\n\n    if (dialogAnswerYes)\n        return M::YesButton;\n    if (dialogAnswerNo)\n        return M::NoButton;\n\n    return 0;\n}\n\n\/******************************************************************************\n * Ut_ResetApplet implementation. \n *\/\nvoid \nUt_ResetApplet::init()\n{\n}\n\nvoid \nUt_ResetApplet::cleanup()\n{\n}\n\n\nstatic int argc = 1;\nstatic char *app_name = (char*) \".\/Ut_ResetApplet\";\n\nvoid \nUt_ResetApplet::initTestCase()\n{\n    m_App = new MApplication (argc, &app_name);\n    m_Applet = new ResetApplet;\n    \n    QVERIFY (!m_Applet->m_MainWidget);\n    m_Applet->init ();\n    \n    \/*\n     * Testing if the widget is not created yet.\n     *\/\n    QVERIFY (!m_Applet->m_MainWidget);\n}\n\nvoid \nUt_ResetApplet::cleanupTestCase()\n{\n    delete m_Applet;\n    m_App->deleteLater ();\n}\n\nvoid \nUt_ResetApplet::testTitle ()\n{\n    QString title = m_Applet->title();\n    QVERIFY (!title.isEmpty());\n}\n\nvoid\nUt_ResetApplet::testConstructWidget ()\n{\n    ResetWidget *widget;\n    bool         backAccepted;\n\n    \/*\n     * We check if we got a NULL pointer for the invalid window ID.\n     *\/\n    widget = (ResetWidget *) m_Applet->constructWidget (3);\n    QVERIFY (!widget);\n\n    \/*\n     * Testing if the applet creates a widget the first time.\n     *\/\n    widget = (ResetWidget *) m_Applet->constructWidget (0);\n    QVERIFY (widget);\n    QVERIFY (m_Applet->m_MainWidget == widget);\n    \n    \/*\n     * Testing if the widget accepts the back. Our applets always accept back.\n     *\/\n    backAccepted = widget->back();\n    QVERIFY (backAccepted);\n\n    \/*\n     * Testing the ResetWidget. We could write a separate unit test, but it\n     * would be very primitive...\n     *\/\n    \/\/ Restore with 'no' as answer.\n    lastExecutedCommand = \"\";\n    commandSuccess = 0;\n    dialogAnswerYes = false;\n    dialogAnswerNo = true;\n    dialogExecuted = false;\n    widget->restoreActivated ();\n    widget->doTheWork ();\n    QVERIFY (lastExecutedCommand == \"\");\n    QVERIFY (dialogExecuted);\n    \n    \/\/ Restore with 'yes' as answer.\n    lastExecutedCommand = \"\";\n    commandSuccess = 0;\n    dialogAnswerYes = true;\n    dialogAnswerNo = false;\n    dialogExecuted = false;\n    widget->restoreActivated ();\n    widget->doTheWork ();\n    QVERIFY (lastExecutedCommand == \"\/usr\/sbin\/clean-device.sh --rfs\");\n    QVERIFY (dialogExecuted);\n    \n    \/\/ Clear with 'no' as answer.\n    lastExecutedCommand = \"\";\n    commandSuccess = 0;\n    dialogAnswerYes = false;\n    dialogAnswerNo = true;\n    dialogExecuted = false;\n    widget->clearActivated ();\n    widget->doTheWork ();\n    QVERIFY (lastExecutedCommand == \"\");\n    QVERIFY (dialogExecuted);\n    \n    \/\/ Clear with 'yes' as answer.\n    lastExecutedCommand = \"\";\n    commandSuccess = 0;\n    dialogAnswerYes = true;\n    dialogAnswerNo = false;\n    dialogExecuted = false;\n    widget->clearActivated ();\n    widget->doTheWork ();\n    QVERIFY (lastExecutedCommand == \"\/usr\/sbin\/clean-device.sh --cud\");\n    QVERIFY (dialogExecuted);\n\n    \/*\n     * Testing if the applet knows about the destruction of the widget.\n     *\/\n    delete widget;\n    QVERIFY (!m_Applet->m_MainWidget);\n}\n\nvoid \nUt_ResetApplet::testMenuItems ()\n{\n    QVector<MAction*> items = m_Applet->viewMenuItems ();\n    \n    QVERIFY (items.size() == 1);\n}\n\nvoid \nUt_ResetApplet::testConstructbrief ()\n{\n    ResetBrief *brief1 = (ResetBrief *) m_Applet->constructBrief(0);\n    QString   iconName;\n    QString   text;\n\n    QVERIFY (brief1);\n    QVERIFY (brief1->widgetTypeID() == DcpWidgetType::Label);\n\n    iconName = brief1->icon ();\n    QVERIFY (iconName.isEmpty());\n\n    text = brief1->valueText ();\n    QVERIFY (text.isEmpty());\n\n    \/\/ FIXME: Why does this method has an argument, it must be some leftover\n    \/\/ code. Also: we should check if the signal is emitted.\n    delete brief1;\n}\n\n\/*!\n * Testing the whole functionality of the ResetBusinesslogic. We could write a\n * separate unit test for this class, but it is very primitive, so we just do\n * the job here.\n *\/\nvoid \nUt_ResetApplet::testResetBusinessLogic ()\n{\n    \/\/ So we get a better coverage we use an error code sometimes.\n    commandSuccess = 3;\n\n    m_Applet->m_ResetBusinessLogic->performRestoreSettings ();\n    QVERIFY (lastExecutedCommand == \"\/usr\/sbin\/clean-device.sh --rfs\");\n\n    m_Applet->m_ResetBusinessLogic->performClearData ();\n    QVERIFY (lastExecutedCommand == \"\/usr\/sbin\/clean-device.sh --cud\");\n}\n\nQTEST_APPLESS_MAIN(Ut_ResetApplet)\n\n\n\n\n<commit_msg>Changes: ut_resetapplet: following the implementation changes<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 meegotouch-controlpanelapplets.\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_resetapplet.h\"\n#include \"resetapplet.h\"\n#include \"resetwidget.h\"\n\n#include \"resetbrief.h\"\n\n#include <dcpwidgettypes.h>\n#include <dcpbrief.h>\n\n#include <mdesktopentry.h>\n#include <MApplication>\n#include <MAction>\n#include <MDialog>\n#include <QVector>\n\n#define DEBUG\n#include \"..\/..\/src\/debug.h\"\n\n\/******************************************************************************\n * Stubbing the system() C library function here.\n *\/\nstatic QString lastExecutedCommand;\nstatic int     commandSuccess;\n\nint\nsystem (\n        const char *command)\n{\n    SYS_DEBUG (\"*** command = %s\", command);\n\n    lastExecutedCommand = command;\n    return commandSuccess;\n}\n\nstatic bool dialogAnswerYes = false;\nstatic bool dialogAnswerNo = false;\nstatic bool dialogExecuted = false;\n\nint \nMDialog::exec (MWindow *window)\n{\n    SYS_DEBUG (\"\");\n\n    Q_UNUSED (window);\n\n    dialogExecuted = true;\n\n    if (dialogAnswerYes)\n        return M::YesButton;\n    if (dialogAnswerNo)\n        return M::NoButton;\n\n    return 0;\n}\n\n\/******************************************************************************\n * Ut_ResetApplet implementation. \n *\/\nvoid \nUt_ResetApplet::init()\n{\n}\n\nvoid \nUt_ResetApplet::cleanup()\n{\n}\n\n\nstatic int argc = 1;\nstatic char *app_name = (char*) \".\/Ut_ResetApplet\";\n\nvoid \nUt_ResetApplet::initTestCase()\n{\n    m_App = new MApplication (argc, &app_name);\n    m_Applet = new ResetApplet;\n    \n    QVERIFY (!m_Applet->m_MainWidget);\n    m_Applet->init ();\n    \n    \/*\n     * Testing if the widget is not created yet.\n     *\/\n    QVERIFY (!m_Applet->m_MainWidget);\n}\n\nvoid \nUt_ResetApplet::cleanupTestCase()\n{\n    delete m_Applet;\n    m_App->deleteLater ();\n}\n\nvoid \nUt_ResetApplet::testTitle ()\n{\n    QString title = m_Applet->title();\n    QVERIFY (!title.isEmpty());\n}\n\nvoid\nUt_ResetApplet::testConstructWidget ()\n{\n    ResetWidget *widget;\n    bool         backAccepted;\n\n    \/*\n     * We check if we got a NULL pointer for the invalid window ID.\n     *\/\n    widget = (ResetWidget *) m_Applet->constructWidget (3);\n    QVERIFY (!widget);\n\n    \/*\n     * Testing if the applet creates a widget the first time.\n     *\/\n    widget = (ResetWidget *) m_Applet->constructWidget (0);\n    QVERIFY (widget);\n    QVERIFY (m_Applet->m_MainWidget == widget);\n    \n    \/*\n     * Testing if the widget accepts the back. Our applets always accept back.\n     *\/\n    backAccepted = widget->back();\n    QVERIFY (backAccepted);\n\n    \/*\n     * Testing the ResetWidget. We could write a separate unit test, but it\n     * would be very primitive...\n     *\/\n    \/\/ Restore with 'no' as answer.\n    lastExecutedCommand = \"\";\n    commandSuccess = 0;\n    dialogAnswerYes = false;\n    dialogAnswerNo = true;\n    dialogExecuted = false;\n    widget->restoreActivated ();\n    widget->doTheWork ();\n    QVERIFY (lastExecutedCommand == \"\");\n    QVERIFY (dialogExecuted);\n    \n    \/\/ Restore with 'yes' as answer.\n    lastExecutedCommand = \"\";\n    commandSuccess = 0;\n    dialogAnswerYes = true;\n    dialogAnswerNo = false;\n    dialogExecuted = false;\n    widget->restoreActivated ();\n    widget->doTheWork ();\n    QVERIFY (lastExecutedCommand == \"\/usr\/sbin\/clean-device.sh --rfs\");\n    QVERIFY (dialogExecuted);\n    \n    \/\/ Clear with 'no' as answer.\n    lastExecutedCommand = \"\";\n    commandSuccess = 0;\n    dialogAnswerYes = false;\n    dialogAnswerNo = true;\n    dialogExecuted = false;\n    widget->clearActivated ();\n    widget->doTheWork ();\n    QVERIFY (lastExecutedCommand == \"\");\n    QVERIFY (dialogExecuted);\n    \n    \/\/ Clear with 'yes' as answer.\n    lastExecutedCommand = \"\";\n    commandSuccess = 0;\n    dialogAnswerYes = true;\n    dialogAnswerNo = false;\n    dialogExecuted = false;\n    widget->clearActivated ();\n    widget->doTheWork ();\n    QVERIFY (lastExecutedCommand == \"\/usr\/sbin\/clean-device.sh --cud-reset\");\n    QVERIFY (dialogExecuted);\n\n    \/*\n     * Testing if the applet knows about the destruction of the widget.\n     *\/\n    delete widget;\n    QVERIFY (!m_Applet->m_MainWidget);\n}\n\nvoid \nUt_ResetApplet::testMenuItems ()\n{\n    QVector<MAction*> items = m_Applet->viewMenuItems ();\n    \n    QVERIFY (items.size() == 1);\n}\n\nvoid \nUt_ResetApplet::testConstructbrief ()\n{\n    ResetBrief *brief1 = (ResetBrief *) m_Applet->constructBrief(0);\n    QString   iconName;\n    QString   text;\n\n    QVERIFY (brief1);\n    QVERIFY (brief1->widgetTypeID() == DcpWidgetType::Label);\n\n    iconName = brief1->icon ();\n    QVERIFY (iconName.isEmpty());\n\n    text = brief1->valueText ();\n    QVERIFY (text.isEmpty());\n\n    \/\/ FIXME: Why does this method has an argument, it must be some leftover\n    \/\/ code. Also: we should check if the signal is emitted.\n    delete brief1;\n}\n\n\/*!\n * Testing the whole functionality of the ResetBusinesslogic. We could write a\n * separate unit test for this class, but it is very primitive, so we just do\n * the job here.\n *\/\nvoid \nUt_ResetApplet::testResetBusinessLogic ()\n{\n    \/\/ So we get a better coverage we use an error code sometimes.\n    commandSuccess = 3;\n\n    m_Applet->m_ResetBusinessLogic->performRestoreSettings ();\n    QVERIFY (lastExecutedCommand == \"\/usr\/sbin\/clean-device.sh --rfs\");\n\n    m_Applet->m_ResetBusinessLogic->performClearData ();\n    QVERIFY (lastExecutedCommand == \"\/usr\/sbin\/clean-device.sh --cud-reset\");\n}\n\nQTEST_APPLESS_MAIN(Ut_ResetApplet)\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2003-2005 Tommi Maekitalo\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\n\n#include <tnt\/httprequest.h>\n#include <tnt\/httpparser.h>\n#include <tnt\/httperror.h>\n#include <tnt\/util.h>\n#include <sstream>\n#include <cxxtools\/log.h>\n#include <cxxtools\/mutex.h>\n#include <cxxtools\/base64stream.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <tnt\/sessionscope.h>\n#include <tnt\/socketif.h>\n#include <pthread.h>\n#include \"config.h\"\n#include <tnt\/stringlessignorecase.h>\n#include <cstring>\n\nnamespace tnt\n{\n  log_define(\"tntnet.httprequest\")\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/ HttpRequest\n  \/\/\n  cxxtools::atomic_t HttpRequest::serial_ = 0;\n\n  HttpRequest::HttpRequest(Tntnet& application_, const SocketIf* socketIf_)\n    : socketIf(socketIf_),\n      locale_init(false),\n      encodingRead(false),\n      requestScope(0),\n      applicationScope(0),\n      sessionScope(0),\n      secureSessionScope(0),\n      threadContext(0),\n      applicationScopeLocked(false),\n      sessionScopeLocked(false),\n      secureSessionScopeLocked(false),\n      application(application_)\n  {\n  }\n\n  HttpRequest::HttpRequest(Tntnet& application_, const std::string& url_, const SocketIf* socketIf_)\n    : socketIf(socketIf_),\n      locale_init(false),\n      requestScope(0),\n      applicationScope(0),\n      sessionScope(0),\n      secureSessionScope(0),\n      threadContext(0),\n      applicationScopeLocked(false),\n      sessionScopeLocked(false),\n      secureSessionScopeLocked(false),\n      application(application_)\n  {\n    std::istringstream s(\"GET \" + url_ + \" HTTP\/1.1\\r\\n\\r\\n\");\n    parse(s);\n  }\n\n  HttpRequest::HttpRequest(const HttpRequest& r)\n    : methodLen(0),\n      pathinfo(r.pathinfo),\n      args(r.args),\n      getparam(r.getparam),\n      postparam(r.postparam),\n      qparam(r.qparam),\n      socketIf(r.socketIf),\n      ct(r.ct),\n      mp(r.mp),\n      serial(r.serial),\n      locale_init(r.locale_init),\n      locale(r.locale),\n      requestScope(r.requestScope),\n      applicationScope(r.applicationScope),\n      sessionScope(r.sessionScope),\n      secureSessionScope(r.secureSessionScope),\n      threadContext(r.threadContext),\n      applicationScopeLocked(false),\n      sessionScopeLocked(false),\n      secureSessionScopeLocked(false),\n      application(r.application)\n  {\n    if (requestScope)\n      requestScope->addRef();\n    if (applicationScope)\n      applicationScope->addRef();\n    if (sessionScope)\n      sessionScope->addRef();\n    if (secureSessionScope)\n      secureSessionScope->addRef();\n  }\n\n  HttpRequest::~HttpRequest()\n  {\n    releaseLocks();\n\n    if (requestScope && requestScope->release() == 0)\n      delete requestScope;\n    if (applicationScope && applicationScope->release() == 0)\n      delete applicationScope;\n    if (sessionScope && sessionScope->release() == 0)\n      delete sessionScope;\n    if (secureSessionScope && secureSessionScope->release() == 0)\n      delete secureSessionScope;\n  }\n\n  HttpRequest& HttpRequest::operator= (const HttpRequest& r)\n  {\n    pathinfo = r.pathinfo;\n    args = r.args;\n    getparam = r.getparam;\n    postparam = r.postparam;\n    qparam = r.qparam;\n    ct = r.ct;\n    mp = r.mp;\n    socketIf = r.socketIf;\n    serial = r.serial;\n    locale_init = r.locale_init;\n    locale = r.locale;\n    requestScope = r.requestScope;\n    applicationScope = r.applicationScope;\n    sessionScope = r.sessionScope;\n    secureSessionScope = r.secureSessionScope;\n    threadContext = r.threadContext;\n    applicationScopeLocked = false;\n    sessionScopeLocked = false;\n    secureSessionScopeLocked = false;\n\n    if (requestScope)\n      requestScope->addRef();\n    if (applicationScope)\n      applicationScope->addRef();\n    if (sessionScope)\n      sessionScope->addRef();\n    if (secureSessionScope)\n      secureSessionScope->addRef();\n\n    return *this;\n  }\n\n  void HttpRequest::clear()\n  {\n    HttpMessage::clear();\n    body.clear();\n    methodLen = 0;\n    method[0] = '\\0';\n    url.clear();\n    queryString.clear();\n    contentSize = 0;\n    pathinfo.clear();\n    args.clear();\n    getparam.clear();\n    postparam.clear();\n    qparam.clear();\n    ct = Contenttype();\n    mp = Multipart();\n    locale_init = false;\n    if (requestScope)\n    {\n      if (requestScope->release() == 0)\n        delete requestScope;\n      requestScope = 0;\n    }\n    httpcookies.clear();\n    encodingRead = false;\n    username.clear();\n    password.clear();\n\n    releaseLocks();\n\n    if (applicationScope)\n    {\n      if (applicationScope->release() == 0)\n        delete applicationScope;\n      applicationScope = 0;\n    }\n\n    if (sessionScope)\n    {\n      if (sessionScope->release() == 0)\n        delete sessionScope;\n      sessionScope = 0;\n    }\n\n    if (secureSessionScope)\n    {\n      if (secureSessionScope->release() == 0)\n        delete secureSessionScope;\n      secureSessionScope = 0;\n    }\n\n    threadContext = 0;\n  }\n\n  void HttpRequest::setMethod(const char* m)\n  {\n    if (strlen(m) >= 7)\n      throw HttpError(HTTP_BAD_REQUEST, \"invalid method\");\n    std::strcpy(method, m);\n  }\n\n  std::string HttpRequest::getArgDef(args_type::size_type n, const std::string& def) const\n  {\n    std::ostringstream k;\n    k << \"arg\" << n;\n    return getArg(k.str());\n  }\n\n  std::string HttpRequest::getArg(const std::string& name, const std::string& def) const\n  {\n    args_type::const_iterator it = args.find(name);\n    return it == args.end() ? def : it->second;\n  }\n\n  void HttpRequest::parse(std::istream& in)\n  {\n    Parser p(*this);\n    p.parse(in);\n    if (!p.failed())\n      doPostParse();\n  }\n\n  void HttpRequest::doPostParse()\n  {\n    if (hasHeader(\"Expect:\"))\n      throw HttpError(HTTP_EXPECTATION_FAILED, \"expectation failed\", \"Expect not supported by this server\");\n\n    getparam.parse_url(getQueryString());\n\n    if (isMethodPOST())\n    {\n      std::istringstream in(getHeader(httpheader::contentType));\n      in >> ct;\n\n      if (in)\n      {\n        if (ct.isMultipart())\n        {\n          mp.set(ct.getBoundary(), getBody());\n          for (Multipart::const_iterator it = mp.begin();\n               it != mp.end(); ++it)\n          {\n            \/\/ don't copy uploaded files into qparam to prevent unnecessery\n            \/\/ copies of large chunks\n            if (it->getFilename().empty())\n            {\n              std::string multipartBody(it->getBodyBegin(), it->getBodyEnd());\n              postparam.add(it->getName(), multipartBody);\n            }\n          }\n        }\n        else if (ct.getType() == \"application\"\n              && ct.getSubtype() == \"x-www-form-urlencoded\")\n        {\n          postparam.parse_url(getBody());\n        }\n      }\n    }\n\n    qparam.add(getparam);\n    qparam.add(postparam);\n\n    serial = cxxtools::atomicIncrement(serial_);\n  }\n\n  namespace\n  {\n    typedef std::map<std::string, std::locale> locale_map_type;\n    static std::locale* stdlocale = 0;\n    static locale_map_type locale_map;\n    static cxxtools::Mutex locale_monitor;\n\n    const std::locale& getCacheLocale(const std::string& lang)\n    {\n\n      if (stdlocale == 0)\n      {\n        cxxtools::MutexLock lock(locale_monitor);\n        if (stdlocale == 0)\n        {\n          try\n          {\n            stdlocale = new std::locale(\"\");\n          }\n          catch (const std::exception& e)\n          {\n            log_warn(\"error initializing standard-locale - using locale \\\"C\\\"\");\n          }\n        }\n      }\n\n      if (lang.empty() || lang == stdlocale->name())\n        return *stdlocale;\n\n      try\n      {\n        cxxtools::MutexLock lock(locale_monitor);\n        locale_map_type::const_iterator it = locale_map.find(lang);\n        if (it == locale_map.end())\n        {\n          std::locale loc = std::locale(lang.c_str());\n          return locale_map.insert(locale_map_type::value_type(lang, loc)).first->second;\n        }\n        else\n          return it->second;\n      }\n      catch (const std::exception& e)\n      {\n        log_warn(\"unknown locale \" << lang << \": \" << e.what());\n        locale_map.insert(locale_map_type::value_type(lang, *stdlocale));\n        return *stdlocale;\n      }\n    }\n\n    void clearLocaleCache()\n    {\n      cxxtools::MutexLock lock(locale_monitor);\n      locale_map.clear();\n      delete stdlocale;\n      stdlocale = 0;\n    }\n  }\n\n  const std::locale& HttpRequest::getLocale() const\n  {\n    if (!locale_init)\n    {\n      static const std::string LANG = \"LANG\";\n      lang = qparam[LANG];\n      locale = getCacheLocale(qparam[LANG]);\n      if (lang.empty())\n        lang = locale.name();\n      locale_init = true;\n    }\n\n    return locale;\n  }\n\n  void HttpRequest::setLocale(const std::locale& loc)\n  {\n    locale_init = true;\n    locale = loc;\n    lang = loc.name();\n  }\n\n  void HttpRequest::setLang(const std::string& lang_)\n  {\n    lang = lang_;\n    locale = getCacheLocale(lang_);\n    locale_init = true;\n  }\n\n  const Cookies& HttpRequest::getCookies() const\n  {\n    if (!httpcookies.hasCookies())\n    {\n      header_type::const_iterator it = header.find(httpheader::cookie);\n      if (it != header.end())\n        const_cast<HttpRequest*>(this)->httpcookies.set(it->second);\n    }\n\n    return httpcookies;\n  }\n\n  const Encoding& HttpRequest::getEncoding() const\n  {\n    if (!encodingRead)\n    {\n      encoding.parse(getHeader(httpheader::acceptEncoding));\n      encodingRead = true;\n    }\n    return encoding;\n  }\n\n  const std::string& HttpRequest::getUsername() const\n  {\n    if (username.empty() && hasHeader(httpheader::authorization))\n    {\n      std::istringstream authHeader(getHeader(httpheader::authorization));\n      while (authHeader && authHeader.get() != ' ')\n        ;\n      cxxtools::Base64istream in(authHeader);\n      std::getline(in, username, ':');\n      std::getline(in, password);\n    }\n\n    return username;\n  }\n\n  const std::string& HttpRequest::getPassword() const\n  {\n    getUsername();\n    return password;\n  }\n\n  bool HttpRequest::verifyPassword(const std::string& password_) const\n  {\n    getUsername();\n    return password == password_;\n  }\n\n  bool HttpRequest::keepAlive() const\n  {\n    \/\/ request is keep alive when either a connection header is explicitely set to keep alive\n    \/\/ or the http version is 1.1\n    Messageheader::const_iterator it = header.find(httpheader::connection);\n\n    return it == header.end()\n               ? getMinorVersion() >= 1 && getMajorVersion() >= 1\n               : tnt::StringCompareIgnoreCase<const char*>(it->second,\n                    httpheader::connectionKeepAlive) == 0;\n  }\n\n  const Contenttype& HttpRequest::getContentTypePriv() const\n  {\n    std::istringstream in(getHeader(httpheader::contentType));\n    in >> ct;\n    return ct;\n  }\n\n  void HttpRequest::setApplicationScope(Scope* s)\n  {\n    if (applicationScope == s)\n      return;\n\n    if (applicationScope)\n    {\n      releaseApplicationScopeLock();\n      if (applicationScope->release() == 0)\n        delete applicationScope;\n    }\n\n    if (s)\n      s->addRef();\n    applicationScope = s;\n  }\n\n  void HttpRequest::setSessionScope(Sessionscope* s)\n  {\n    if (sessionScope == s)\n      return;\n\n    if (sessionScope)\n    {\n      if (sessionScopeLocked)\n      {\n        sessionScope->unlock();\n        sessionScopeLocked = false;\n      }\n      if (sessionScope->release() == 0)\n        delete sessionScope;\n    }\n\n    if (s)\n      s->addRef();\n\n    sessionScope = s;\n  }\n\n  void HttpRequest::setSecureSessionScope(Sessionscope* s)\n  {\n    if (secureSessionScope == s)\n      return;\n\n    if (secureSessionScope)\n    {\n      if (secureSessionScopeLocked)\n      {\n        secureSessionScope->unlock();\n        secureSessionScopeLocked = false;\n      }\n      if (secureSessionScope->release() == 0)\n        delete secureSessionScope;\n    }\n\n    if (s)\n      s->addRef();\n\n    secureSessionScope = s;\n  }\n\n  void HttpRequest::clearSession()\n  {\n    log_info(\"end session\");\n\n    if (sessionScope)\n    {\n      if (sessionScopeLocked)\n      {\n        sessionScope->unlock();\n        sessionScopeLocked = false;\n      }\n\n      if (sessionScope->release() == 0)\n        delete sessionScope;\n      sessionScope = 0;\n    }\n\n    if (secureSessionScope)\n    {\n      if (secureSessionScopeLocked)\n      {\n        secureSessionScope->unlock();\n        secureSessionScopeLocked = false;\n      }\n\n      if (secureSessionScope->release() == 0)\n        delete secureSessionScope;\n      secureSessionScope = 0;\n    }\n\n  }\n\n  void HttpRequest::ensureApplicationScopeLock()\n  {\n    ensureSessionScopeLock();\n    if (applicationScope && !applicationScopeLocked)\n    {\n      applicationScope->lock();\n      applicationScopeLocked = true;\n    }\n  }\n\n  void HttpRequest::ensureSessionScopeLock()\n  {\n    if (sessionScope && !sessionScopeLocked)\n    {\n      sessionScope->lock();\n      sessionScopeLocked = true;\n    }\n\n    if (secureSessionScope && !secureSessionScopeLocked)\n    {\n      secureSessionScope->lock();\n      secureSessionScopeLocked = true;\n    }\n\n  }\n\n  void HttpRequest::releaseApplicationScopeLock()\n  {\n    releaseSessionScopeLock();\n\n    if (applicationScope && applicationScopeLocked)\n    {\n      applicationScopeLocked = false;\n      applicationScope->unlock();\n    }\n  }\n\n  void HttpRequest::releaseSessionScopeLock()\n  {\n    if (secureSessionScope && secureSessionScopeLocked)\n    {\n      secureSessionScopeLocked = false;\n      secureSessionScope->unlock();\n    }\n\n    if (sessionScope && sessionScopeLocked)\n    {\n      sessionScopeLocked = false;\n      sessionScope->unlock();\n    }\n  }\n\n  Scope& HttpRequest::getRequestScope()\n  {\n    if (requestScope == 0)\n      requestScope = new Scope();\n    return *requestScope;\n  }\n\n  Scope& HttpRequest::getThreadScope()\n  {\n    if (threadContext == 0)\n      throwRuntimeError(\"threadcontext not set\");\n    return threadContext->getScope();\n  }\n\n  Scope& HttpRequest::getApplicationScope()\n  {\n    ensureApplicationScopeLock();\n    return *applicationScope;\n  }\n\n  Sessionscope& HttpRequest::getSessionScope()\n  {\n    if (!sessionScope)\n      sessionScope = new Sessionscope();\n    ensureSessionScopeLock();\n    return *sessionScope;\n  }\n\n  Sessionscope& HttpRequest::getSecureSessionScope()\n  {\n    if (!secureSessionScope)\n      secureSessionScope = new Sessionscope();\n    ensureSessionScopeLock();\n    return *secureSessionScope;\n  }\n\n  bool HttpRequest::hasSessionScope() const\n  {\n    return sessionScope != 0 && !sessionScope->empty();\n  }\n\n  bool HttpRequest::hasSecureSessionScope() const\n  {\n    return secureSessionScope != 0 && !secureSessionScope->empty();\n  }\n\n  void HttpRequest::postRunCleanup()\n  {\n    tnt::clearLocaleCache();\n  }\n}\n\n<commit_msg>bugfix: request.getArgDef(number, default) did not use the default value<commit_after>\/*\n * Copyright (C) 2003-2005 Tommi Maekitalo\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\n\n#include <tnt\/httprequest.h>\n#include <tnt\/httpparser.h>\n#include <tnt\/httperror.h>\n#include <tnt\/util.h>\n#include <sstream>\n#include <cxxtools\/log.h>\n#include <cxxtools\/mutex.h>\n#include <cxxtools\/base64stream.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <tnt\/sessionscope.h>\n#include <tnt\/socketif.h>\n#include <pthread.h>\n#include \"config.h\"\n#include <tnt\/stringlessignorecase.h>\n#include <cstring>\n\nnamespace tnt\n{\n  log_define(\"tntnet.httprequest\")\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/ HttpRequest\n  \/\/\n  cxxtools::atomic_t HttpRequest::serial_ = 0;\n\n  HttpRequest::HttpRequest(Tntnet& application_, const SocketIf* socketIf_)\n    : socketIf(socketIf_),\n      locale_init(false),\n      encodingRead(false),\n      requestScope(0),\n      applicationScope(0),\n      sessionScope(0),\n      secureSessionScope(0),\n      threadContext(0),\n      applicationScopeLocked(false),\n      sessionScopeLocked(false),\n      secureSessionScopeLocked(false),\n      application(application_)\n  {\n  }\n\n  HttpRequest::HttpRequest(Tntnet& application_, const std::string& url_, const SocketIf* socketIf_)\n    : socketIf(socketIf_),\n      locale_init(false),\n      requestScope(0),\n      applicationScope(0),\n      sessionScope(0),\n      secureSessionScope(0),\n      threadContext(0),\n      applicationScopeLocked(false),\n      sessionScopeLocked(false),\n      secureSessionScopeLocked(false),\n      application(application_)\n  {\n    std::istringstream s(\"GET \" + url_ + \" HTTP\/1.1\\r\\n\\r\\n\");\n    parse(s);\n  }\n\n  HttpRequest::HttpRequest(const HttpRequest& r)\n    : methodLen(0),\n      pathinfo(r.pathinfo),\n      args(r.args),\n      getparam(r.getparam),\n      postparam(r.postparam),\n      qparam(r.qparam),\n      socketIf(r.socketIf),\n      ct(r.ct),\n      mp(r.mp),\n      serial(r.serial),\n      locale_init(r.locale_init),\n      locale(r.locale),\n      requestScope(r.requestScope),\n      applicationScope(r.applicationScope),\n      sessionScope(r.sessionScope),\n      secureSessionScope(r.secureSessionScope),\n      threadContext(r.threadContext),\n      applicationScopeLocked(false),\n      sessionScopeLocked(false),\n      secureSessionScopeLocked(false),\n      application(r.application)\n  {\n    if (requestScope)\n      requestScope->addRef();\n    if (applicationScope)\n      applicationScope->addRef();\n    if (sessionScope)\n      sessionScope->addRef();\n    if (secureSessionScope)\n      secureSessionScope->addRef();\n  }\n\n  HttpRequest::~HttpRequest()\n  {\n    releaseLocks();\n\n    if (requestScope && requestScope->release() == 0)\n      delete requestScope;\n    if (applicationScope && applicationScope->release() == 0)\n      delete applicationScope;\n    if (sessionScope && sessionScope->release() == 0)\n      delete sessionScope;\n    if (secureSessionScope && secureSessionScope->release() == 0)\n      delete secureSessionScope;\n  }\n\n  HttpRequest& HttpRequest::operator= (const HttpRequest& r)\n  {\n    pathinfo = r.pathinfo;\n    args = r.args;\n    getparam = r.getparam;\n    postparam = r.postparam;\n    qparam = r.qparam;\n    ct = r.ct;\n    mp = r.mp;\n    socketIf = r.socketIf;\n    serial = r.serial;\n    locale_init = r.locale_init;\n    locale = r.locale;\n    requestScope = r.requestScope;\n    applicationScope = r.applicationScope;\n    sessionScope = r.sessionScope;\n    secureSessionScope = r.secureSessionScope;\n    threadContext = r.threadContext;\n    applicationScopeLocked = false;\n    sessionScopeLocked = false;\n    secureSessionScopeLocked = false;\n\n    if (requestScope)\n      requestScope->addRef();\n    if (applicationScope)\n      applicationScope->addRef();\n    if (sessionScope)\n      sessionScope->addRef();\n    if (secureSessionScope)\n      secureSessionScope->addRef();\n\n    return *this;\n  }\n\n  void HttpRequest::clear()\n  {\n    HttpMessage::clear();\n    body.clear();\n    methodLen = 0;\n    method[0] = '\\0';\n    url.clear();\n    queryString.clear();\n    contentSize = 0;\n    pathinfo.clear();\n    args.clear();\n    getparam.clear();\n    postparam.clear();\n    qparam.clear();\n    ct = Contenttype();\n    mp = Multipart();\n    locale_init = false;\n    if (requestScope)\n    {\n      if (requestScope->release() == 0)\n        delete requestScope;\n      requestScope = 0;\n    }\n    httpcookies.clear();\n    encodingRead = false;\n    username.clear();\n    password.clear();\n\n    releaseLocks();\n\n    if (applicationScope)\n    {\n      if (applicationScope->release() == 0)\n        delete applicationScope;\n      applicationScope = 0;\n    }\n\n    if (sessionScope)\n    {\n      if (sessionScope->release() == 0)\n        delete sessionScope;\n      sessionScope = 0;\n    }\n\n    if (secureSessionScope)\n    {\n      if (secureSessionScope->release() == 0)\n        delete secureSessionScope;\n      secureSessionScope = 0;\n    }\n\n    threadContext = 0;\n  }\n\n  void HttpRequest::setMethod(const char* m)\n  {\n    if (strlen(m) >= 7)\n      throw HttpError(HTTP_BAD_REQUEST, \"invalid method\");\n    std::strcpy(method, m);\n  }\n\n  std::string HttpRequest::getArgDef(args_type::size_type n, const std::string& def) const\n  {\n    std::ostringstream k;\n    k << \"arg\" << n;\n    return getArg(k.str(), def);\n  }\n\n  std::string HttpRequest::getArg(const std::string& name, const std::string& def) const\n  {\n    args_type::const_iterator it = args.find(name);\n    return it == args.end() ? def : it->second;\n  }\n\n  void HttpRequest::parse(std::istream& in)\n  {\n    Parser p(*this);\n    p.parse(in);\n    if (!p.failed())\n      doPostParse();\n  }\n\n  void HttpRequest::doPostParse()\n  {\n    if (hasHeader(\"Expect:\"))\n      throw HttpError(HTTP_EXPECTATION_FAILED, \"expectation failed\", \"Expect not supported by this server\");\n\n    getparam.parse_url(getQueryString());\n\n    if (isMethodPOST())\n    {\n      std::istringstream in(getHeader(httpheader::contentType));\n      in >> ct;\n\n      if (in)\n      {\n        if (ct.isMultipart())\n        {\n          mp.set(ct.getBoundary(), getBody());\n          for (Multipart::const_iterator it = mp.begin();\n               it != mp.end(); ++it)\n          {\n            \/\/ don't copy uploaded files into qparam to prevent unnecessery\n            \/\/ copies of large chunks\n            if (it->getFilename().empty())\n            {\n              std::string multipartBody(it->getBodyBegin(), it->getBodyEnd());\n              postparam.add(it->getName(), multipartBody);\n            }\n          }\n        }\n        else if (ct.getType() == \"application\"\n              && ct.getSubtype() == \"x-www-form-urlencoded\")\n        {\n          postparam.parse_url(getBody());\n        }\n      }\n    }\n\n    qparam.add(getparam);\n    qparam.add(postparam);\n\n    serial = cxxtools::atomicIncrement(serial_);\n  }\n\n  namespace\n  {\n    typedef std::map<std::string, std::locale> locale_map_type;\n    static std::locale* stdlocale = 0;\n    static locale_map_type locale_map;\n    static cxxtools::Mutex locale_monitor;\n\n    const std::locale& getCacheLocale(const std::string& lang)\n    {\n\n      if (stdlocale == 0)\n      {\n        cxxtools::MutexLock lock(locale_monitor);\n        if (stdlocale == 0)\n        {\n          try\n          {\n            stdlocale = new std::locale(\"\");\n          }\n          catch (const std::exception& e)\n          {\n            log_warn(\"error initializing standard-locale - using locale \\\"C\\\"\");\n          }\n        }\n      }\n\n      if (lang.empty() || lang == stdlocale->name())\n        return *stdlocale;\n\n      try\n      {\n        cxxtools::MutexLock lock(locale_monitor);\n        locale_map_type::const_iterator it = locale_map.find(lang);\n        if (it == locale_map.end())\n        {\n          std::locale loc = std::locale(lang.c_str());\n          return locale_map.insert(locale_map_type::value_type(lang, loc)).first->second;\n        }\n        else\n          return it->second;\n      }\n      catch (const std::exception& e)\n      {\n        log_warn(\"unknown locale \" << lang << \": \" << e.what());\n        locale_map.insert(locale_map_type::value_type(lang, *stdlocale));\n        return *stdlocale;\n      }\n    }\n\n    void clearLocaleCache()\n    {\n      cxxtools::MutexLock lock(locale_monitor);\n      locale_map.clear();\n      delete stdlocale;\n      stdlocale = 0;\n    }\n  }\n\n  const std::locale& HttpRequest::getLocale() const\n  {\n    if (!locale_init)\n    {\n      static const std::string LANG = \"LANG\";\n      lang = qparam[LANG];\n      locale = getCacheLocale(qparam[LANG]);\n      if (lang.empty())\n        lang = locale.name();\n      locale_init = true;\n    }\n\n    return locale;\n  }\n\n  void HttpRequest::setLocale(const std::locale& loc)\n  {\n    locale_init = true;\n    locale = loc;\n    lang = loc.name();\n  }\n\n  void HttpRequest::setLang(const std::string& lang_)\n  {\n    lang = lang_;\n    locale = getCacheLocale(lang_);\n    locale_init = true;\n  }\n\n  const Cookies& HttpRequest::getCookies() const\n  {\n    if (!httpcookies.hasCookies())\n    {\n      header_type::const_iterator it = header.find(httpheader::cookie);\n      if (it != header.end())\n        const_cast<HttpRequest*>(this)->httpcookies.set(it->second);\n    }\n\n    return httpcookies;\n  }\n\n  const Encoding& HttpRequest::getEncoding() const\n  {\n    if (!encodingRead)\n    {\n      encoding.parse(getHeader(httpheader::acceptEncoding));\n      encodingRead = true;\n    }\n    return encoding;\n  }\n\n  const std::string& HttpRequest::getUsername() const\n  {\n    if (username.empty() && hasHeader(httpheader::authorization))\n    {\n      std::istringstream authHeader(getHeader(httpheader::authorization));\n      while (authHeader && authHeader.get() != ' ')\n        ;\n      cxxtools::Base64istream in(authHeader);\n      std::getline(in, username, ':');\n      std::getline(in, password);\n    }\n\n    return username;\n  }\n\n  const std::string& HttpRequest::getPassword() const\n  {\n    getUsername();\n    return password;\n  }\n\n  bool HttpRequest::verifyPassword(const std::string& password_) const\n  {\n    getUsername();\n    return password == password_;\n  }\n\n  bool HttpRequest::keepAlive() const\n  {\n    \/\/ request is keep alive when either a connection header is explicitely set to keep alive\n    \/\/ or the http version is 1.1\n    Messageheader::const_iterator it = header.find(httpheader::connection);\n\n    return it == header.end()\n               ? getMinorVersion() >= 1 && getMajorVersion() >= 1\n               : tnt::StringCompareIgnoreCase<const char*>(it->second,\n                    httpheader::connectionKeepAlive) == 0;\n  }\n\n  const Contenttype& HttpRequest::getContentTypePriv() const\n  {\n    std::istringstream in(getHeader(httpheader::contentType));\n    in >> ct;\n    return ct;\n  }\n\n  void HttpRequest::setApplicationScope(Scope* s)\n  {\n    if (applicationScope == s)\n      return;\n\n    if (applicationScope)\n    {\n      releaseApplicationScopeLock();\n      if (applicationScope->release() == 0)\n        delete applicationScope;\n    }\n\n    if (s)\n      s->addRef();\n    applicationScope = s;\n  }\n\n  void HttpRequest::setSessionScope(Sessionscope* s)\n  {\n    if (sessionScope == s)\n      return;\n\n    if (sessionScope)\n    {\n      if (sessionScopeLocked)\n      {\n        sessionScope->unlock();\n        sessionScopeLocked = false;\n      }\n      if (sessionScope->release() == 0)\n        delete sessionScope;\n    }\n\n    if (s)\n      s->addRef();\n\n    sessionScope = s;\n  }\n\n  void HttpRequest::setSecureSessionScope(Sessionscope* s)\n  {\n    if (secureSessionScope == s)\n      return;\n\n    if (secureSessionScope)\n    {\n      if (secureSessionScopeLocked)\n      {\n        secureSessionScope->unlock();\n        secureSessionScopeLocked = false;\n      }\n      if (secureSessionScope->release() == 0)\n        delete secureSessionScope;\n    }\n\n    if (s)\n      s->addRef();\n\n    secureSessionScope = s;\n  }\n\n  void HttpRequest::clearSession()\n  {\n    log_info(\"end session\");\n\n    if (sessionScope)\n    {\n      if (sessionScopeLocked)\n      {\n        sessionScope->unlock();\n        sessionScopeLocked = false;\n      }\n\n      if (sessionScope->release() == 0)\n        delete sessionScope;\n      sessionScope = 0;\n    }\n\n    if (secureSessionScope)\n    {\n      if (secureSessionScopeLocked)\n      {\n        secureSessionScope->unlock();\n        secureSessionScopeLocked = false;\n      }\n\n      if (secureSessionScope->release() == 0)\n        delete secureSessionScope;\n      secureSessionScope = 0;\n    }\n\n  }\n\n  void HttpRequest::ensureApplicationScopeLock()\n  {\n    ensureSessionScopeLock();\n    if (applicationScope && !applicationScopeLocked)\n    {\n      applicationScope->lock();\n      applicationScopeLocked = true;\n    }\n  }\n\n  void HttpRequest::ensureSessionScopeLock()\n  {\n    if (sessionScope && !sessionScopeLocked)\n    {\n      sessionScope->lock();\n      sessionScopeLocked = true;\n    }\n\n    if (secureSessionScope && !secureSessionScopeLocked)\n    {\n      secureSessionScope->lock();\n      secureSessionScopeLocked = true;\n    }\n\n  }\n\n  void HttpRequest::releaseApplicationScopeLock()\n  {\n    releaseSessionScopeLock();\n\n    if (applicationScope && applicationScopeLocked)\n    {\n      applicationScopeLocked = false;\n      applicationScope->unlock();\n    }\n  }\n\n  void HttpRequest::releaseSessionScopeLock()\n  {\n    if (secureSessionScope && secureSessionScopeLocked)\n    {\n      secureSessionScopeLocked = false;\n      secureSessionScope->unlock();\n    }\n\n    if (sessionScope && sessionScopeLocked)\n    {\n      sessionScopeLocked = false;\n      sessionScope->unlock();\n    }\n  }\n\n  Scope& HttpRequest::getRequestScope()\n  {\n    if (requestScope == 0)\n      requestScope = new Scope();\n    return *requestScope;\n  }\n\n  Scope& HttpRequest::getThreadScope()\n  {\n    if (threadContext == 0)\n      throwRuntimeError(\"threadcontext not set\");\n    return threadContext->getScope();\n  }\n\n  Scope& HttpRequest::getApplicationScope()\n  {\n    ensureApplicationScopeLock();\n    return *applicationScope;\n  }\n\n  Sessionscope& HttpRequest::getSessionScope()\n  {\n    if (!sessionScope)\n      sessionScope = new Sessionscope();\n    ensureSessionScopeLock();\n    return *sessionScope;\n  }\n\n  Sessionscope& HttpRequest::getSecureSessionScope()\n  {\n    if (!secureSessionScope)\n      secureSessionScope = new Sessionscope();\n    ensureSessionScopeLock();\n    return *secureSessionScope;\n  }\n\n  bool HttpRequest::hasSessionScope() const\n  {\n    return sessionScope != 0 && !sessionScope->empty();\n  }\n\n  bool HttpRequest::hasSecureSessionScope() const\n  {\n    return secureSessionScope != 0 && !secureSessionScope->empty();\n  }\n\n  void HttpRequest::postRunCleanup()\n  {\n    tnt::clearLocaleCache();\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"BasicAIModule.h\"\r\nusing namespace BWAPI;\r\n\r\nvoid BasicAIModule::onStart()\r\n{\r\n  this->showManagerAssignments=false;\r\n  if (Broodwar->isReplay()) return;\r\n  \/\/ Enable some cheat flags\r\n  Broodwar->enableFlag(Flag::UserInput);\r\n  Broodwar->enableFlag(Flag::CompleteMapInformation);\r\n  BWTA::readMap();\r\n  BWTA::analyze();\r\n  this->analyzed=true;\r\n  this->buildManager      = new BuildManager(&this->arbitrator);\r\n  this->techManager       = new TechManager(&this->arbitrator);\r\n  this->upgradeManager    = new UpgradeManager(&this->arbitrator);\r\n  this->buildOrderManager = new BuildOrderManager(this->buildManager,this->techManager,this->upgradeManager);\r\n  this->scoutManager      = new ScoutManager(&this->arbitrator);\r\n  this->workerManager     = new WorkerManager(&this->arbitrator);\r\n  this->baseManager       = new BaseManager();\r\n  this->supplyManager     = new SupplyManager();\r\n\r\n  this->supplyManager->setBuildManager(this->buildManager);\r\n  this->supplyManager->setBuildOrderManager(this->buildOrderManager);\r\n  this->techManager->setBuildingPlacer(this->buildManager->getBuildingPlacer());\r\n  this->upgradeManager->setBuildingPlacer(this->buildManager->getBuildingPlacer());\r\n  this->workerManager->setBaseManager(this->baseManager);\r\n  this->baseManager->setBuildOrderManager(this->buildOrderManager);\r\n  \r\n  BWAPI::Race race = Broodwar->self()->getRace();\r\n  BWAPI::UnitType workerType=*(race.getWorker());\r\n  this->buildOrderManager->build(20,workerType,80);\r\n  \/\/make the basic production facility\r\n  if (race == BWAPI::Races::Zerg)\r\n  {\r\n    \/\/send an overlord out if Zerg\r\n    this->scoutManager->setScoutCount(1);\r\n    this->buildManager->build(BWAPI::UnitTypes::Zerg_Spawning_Pool);\r\n    this->buildManager->build(BWAPI::UnitTypes::Zerg_Zergling);\r\n    this->buildManager->build(BWAPI::UnitTypes::Zerg_Zergling);\r\n    this->buildManager->build(BWAPI::UnitTypes::Zerg_Zergling);\r\n  }\r\n  else if (race == BWAPI::Races::Terran)\r\n  {\r\n    this->buildManager->build(BWAPI::UnitTypes::Terran_Barracks);\r\n    this->buildManager->build(BWAPI::UnitTypes::Terran_Marine);\r\n    this->buildManager->build(BWAPI::UnitTypes::Terran_Marine);\r\n  }\r\n  else if (race == BWAPI::Races::Protoss)\r\n  {\r\n    this->buildManager->build(BWAPI::UnitTypes::Protoss_Gateway);\r\n    this->buildManager->build(BWAPI::UnitTypes::Protoss_Zealot);\r\n  }\r\n \r\n}\r\n\r\n\r\nvoid BasicAIModule::onFrame()\r\n{\r\n  if (Broodwar->isReplay()) return;\r\n  if (!this->analyzed) return;\r\n  this->buildManager->update();\r\n  this->buildOrderManager->update();\r\n  this->baseManager->update();\r\n  this->workerManager->update();\r\n  this->techManager->update();\r\n  this->upgradeManager->update();\r\n  this->supplyManager->update();\r\n  this->scoutManager->update();\r\n  this->arbitrator.update();\r\n  if (Broodwar->getFrameCount()>24*50)\r\n    scoutManager->setScoutCount(1);\r\n\r\n  std::set<Unit*> units=Broodwar->self()->getUnits();\r\n  if (this->showManagerAssignments)\r\n  {\r\n    for(std::set<Unit*>::iterator i=units.begin();i!=units.end();i++)\r\n    {\r\n      if (this->arbitrator.hasBid(*i))\r\n      {\r\n        int x=(*i)->getPosition().x();\r\n        int y=(*i)->getPosition().y();\r\n        std::list< std::pair< Arbitrator::Controller<BWAPI::Unit*,double>*, double> > bids=this->arbitrator.getAllBidders(*i);\r\n        int y_off=0;\r\n        for(std::list< std::pair< Arbitrator::Controller<BWAPI::Unit*,double>*, double> >::iterator j=bids.begin();j!=bids.end();j++)\r\n        {\r\n          Broodwar->drawText(CoordinateType::Map,x,y+y_off,\"%s: %d\",j->first->getName().c_str(),(int)j->second);\r\n          y_off+=20;\r\n        }\r\n      }\r\n    }\r\n  }\r\n  \/*\r\n  for(std::set<Unit*>::iterator i=units.begin();i!=units.end();i++)\r\n  {\r\n    int x=(*i)->getPosition().x();\r\n    int y=(*i)->getPosition().y();\r\n    Broodwar->drawCircle(CoordinateType::Map,x,y,(*i)->getType().airWeapon()->maxRange(),Colors::Blue,false);\r\n    Broodwar->drawCircle(CoordinateType::Map,x,y,(*i)->getType().groundWeapon()->maxRange(),Colors::Green,false);\r\n  }\r\n  *\/\r\n\r\n  \/\/we will iterate through all the base locations, and draw their outlines.\r\n  for(std::set<BWTA::BaseLocation*>::const_iterator i=BWTA::getBaseLocations().begin();i!=BWTA::getBaseLocations().end();i++)\r\n  {\r\n    TilePosition p=(*i)->getTilePosition();\r\n    Position c=(*i)->getPosition();\r\n\r\n    \/\/draw outline of center location\r\n    Broodwar->drawBox(CoordinateType::Map,p.x()*32,p.y()*32,p.x()*32+4*32,p.y()*32+3*32,Colors::Blue,false);\r\n\r\n    \/\/draw a circle at each mineral patch\r\n    for(std::set<BWAPI::Unit*>::const_iterator j=(*i)->getMinerals().begin();j!=(*i)->getMinerals().end();j++)\r\n    {\r\n      Position q=(*j)->getPosition();\r\n      Broodwar->drawCircle(CoordinateType::Map,q.x(),q.y(),30,Colors::Cyan,false);\r\n    }\r\n\r\n    \/\/draw the outlines of vespene geysers\r\n    for(std::set<BWAPI::Unit*>::const_iterator j=(*i)->getGeysers().begin();j!=(*i)->getGeysers().end();j++)\r\n    {\r\n      TilePosition q=(*j)->getTilePosition();\r\n      Broodwar->drawBox(CoordinateType::Map,q.x()*32,q.y()*32,q.x()*32+4*32,q.y()*32+2*32,Colors::Orange,false);\r\n    }\r\n\r\n    \/\/if this is an island expansion, draw a yellow circle around the base location\r\n    if ((*i)->isIsland())\r\n    {\r\n      Broodwar->drawCircle(CoordinateType::Map,c.x(),c.y(),80,Colors::Yellow,false);\r\n    }\r\n  }\r\n    \r\n  \/\/we will iterate through all the regions and draw the polygon outline of it in green.\r\n  for(std::set<BWTA::Region*>::const_iterator r=BWTA::getRegions().begin();r!=BWTA::getRegions().end();r++)\r\n  {\r\n    BWTA::Polygon p=(*r)->getPolygon();\r\n    for(int j=0;j<(int)p.size();j++)\r\n    {\r\n      Position point1=p[j];\r\n      Position point2=p[(j+1) % p.size()];\r\n      Broodwar->drawLine(CoordinateType::Map,point1.x(),point1.y(),point2.x(),point2.y(),Colors::Green);\r\n    }\r\n  }\r\n\r\n  \/\/we will visualize the chokepoints with red lines\r\n  for(std::set<BWTA::Region*>::const_iterator r=BWTA::getRegions().begin();r!=BWTA::getRegions().end();r++)\r\n  {\r\n    for(std::set<BWTA::Chokepoint*>::const_iterator c=(*r)->getChokepoints().begin();c!=(*r)->getChokepoints().end();c++)\r\n    {\r\n      Position point1=(*c)->getSides().first;\r\n      Position point2=(*c)->getSides().second;\r\n      Broodwar->drawLine(CoordinateType::Map,point1.x(),point1.y(),point2.x(),point2.y(),Colors::Red);\r\n    }\r\n  }\r\n}\r\n\r\nvoid BasicAIModule::onUnitDestroy(BWAPI::Unit* unit)\r\n{\r\n  this->arbitrator.onRemoveObject(unit);\r\n  this->buildManager->onRemoveUnit(unit);\r\n  this->techManager->onRemoveUnit(unit);\r\n  this->upgradeManager->onRemoveUnit(unit);\r\n  this->workerManager->onRemoveUnit(unit);\r\n  this->scoutManager->onRemoveUnit(unit);\r\n}\r\nbool BasicAIModule::onSendText(std::string text)\r\n{\r\n  UnitType type=UnitTypes::getUnitType(text);\r\n  if (text==\"debug\")\r\n  {\r\n    this->showManagerAssignments=true;\r\n    return true;\r\n  }\r\n  if (type!=UnitTypes::Unknown)\r\n  {\r\n    this->buildManager->build(type);\r\n  }\r\n  else\r\n  {\r\n    TechType type=TechTypes::getTechType(text);\r\n    if (type!=TechTypes::Unknown)\r\n    {\r\n      this->techManager->research(type);\r\n    }\r\n    else\r\n    {\r\n      UpgradeType type=UpgradeTypes::getUpgradeType(text);\r\n      if (type!=UpgradeTypes::Unknown)\r\n      {\r\n        this->upgradeManager->upgrade(type);\r\n      }\r\n      else\r\n        Broodwar->printf(\"You typed '%s'!\",text.c_str());\r\n    }\r\n  }\r\n  return true;\r\n}\r\n<commit_msg>Removes the complete map information flag. It's serious business time!<commit_after>#include \"BasicAIModule.h\"\r\nusing namespace BWAPI;\r\n\r\nvoid BasicAIModule::onStart()\r\n{\r\n  this->showManagerAssignments=false;\r\n  if (Broodwar->isReplay()) return;\r\n  \/\/ Enable some cheat flags\r\n  Broodwar->enableFlag(Flag::UserInput);\r\n  \/\/Broodwar->enableFlag(Flag::CompleteMapInformation);\r\n  BWTA::readMap();\r\n  BWTA::analyze();\r\n  this->analyzed=true;\r\n  this->buildManager      = new BuildManager(&this->arbitrator);\r\n  this->techManager       = new TechManager(&this->arbitrator);\r\n  this->upgradeManager    = new UpgradeManager(&this->arbitrator);\r\n  this->buildOrderManager = new BuildOrderManager(this->buildManager,this->techManager,this->upgradeManager);\r\n  this->scoutManager      = new ScoutManager(&this->arbitrator);\r\n  this->workerManager     = new WorkerManager(&this->arbitrator);\r\n  this->baseManager       = new BaseManager();\r\n  this->supplyManager     = new SupplyManager();\r\n\r\n  this->supplyManager->setBuildManager(this->buildManager);\r\n  this->supplyManager->setBuildOrderManager(this->buildOrderManager);\r\n  this->techManager->setBuildingPlacer(this->buildManager->getBuildingPlacer());\r\n  this->upgradeManager->setBuildingPlacer(this->buildManager->getBuildingPlacer());\r\n  this->workerManager->setBaseManager(this->baseManager);\r\n  this->baseManager->setBuildOrderManager(this->buildOrderManager);\r\n  \r\n  BWAPI::Race race = Broodwar->self()->getRace();\r\n  BWAPI::UnitType workerType=*(race.getWorker());\r\n  this->buildOrderManager->build(20,workerType,80);\r\n  \/\/make the basic production facility\r\n  if (race == BWAPI::Races::Zerg)\r\n  {\r\n    \/\/send an overlord out if Zerg\r\n    this->scoutManager->setScoutCount(1);\r\n    this->buildManager->build(BWAPI::UnitTypes::Zerg_Spawning_Pool);\r\n    this->buildManager->build(BWAPI::UnitTypes::Zerg_Zergling);\r\n    this->buildManager->build(BWAPI::UnitTypes::Zerg_Zergling);\r\n    this->buildManager->build(BWAPI::UnitTypes::Zerg_Zergling);\r\n  }\r\n  else if (race == BWAPI::Races::Terran)\r\n  {\r\n    this->buildManager->build(BWAPI::UnitTypes::Terran_Barracks);\r\n    this->buildManager->build(BWAPI::UnitTypes::Terran_Marine);\r\n    this->buildManager->build(BWAPI::UnitTypes::Terran_Marine);\r\n  }\r\n  else if (race == BWAPI::Races::Protoss)\r\n  {\r\n    this->buildManager->build(BWAPI::UnitTypes::Protoss_Gateway);\r\n    this->buildManager->build(BWAPI::UnitTypes::Protoss_Zealot);\r\n  }\r\n \r\n}\r\n\r\n\r\nvoid BasicAIModule::onFrame()\r\n{\r\n  if (Broodwar->isReplay()) return;\r\n  if (!this->analyzed) return;\r\n  this->buildManager->update();\r\n  this->buildOrderManager->update();\r\n  this->baseManager->update();\r\n  this->workerManager->update();\r\n  this->techManager->update();\r\n  this->upgradeManager->update();\r\n  this->supplyManager->update();\r\n  this->scoutManager->update();\r\n  this->arbitrator.update();\r\n  if (Broodwar->getFrameCount()>24*50)\r\n    scoutManager->setScoutCount(1);\r\n\r\n  std::set<Unit*> units=Broodwar->self()->getUnits();\r\n  if (this->showManagerAssignments)\r\n  {\r\n    for(std::set<Unit*>::iterator i=units.begin();i!=units.end();i++)\r\n    {\r\n      if (this->arbitrator.hasBid(*i))\r\n      {\r\n        int x=(*i)->getPosition().x();\r\n        int y=(*i)->getPosition().y();\r\n        std::list< std::pair< Arbitrator::Controller<BWAPI::Unit*,double>*, double> > bids=this->arbitrator.getAllBidders(*i);\r\n        int y_off=0;\r\n        for(std::list< std::pair< Arbitrator::Controller<BWAPI::Unit*,double>*, double> >::iterator j=bids.begin();j!=bids.end();j++)\r\n        {\r\n          Broodwar->drawText(CoordinateType::Map,x,y+y_off,\"%s: %d\",j->first->getName().c_str(),(int)j->second);\r\n          y_off+=20;\r\n        }\r\n      }\r\n    }\r\n  }\r\n  \/*\r\n  for(std::set<Unit*>::iterator i=units.begin();i!=units.end();i++)\r\n  {\r\n    int x=(*i)->getPosition().x();\r\n    int y=(*i)->getPosition().y();\r\n    Broodwar->drawCircle(CoordinateType::Map,x,y,(*i)->getType().airWeapon()->maxRange(),Colors::Blue,false);\r\n    Broodwar->drawCircle(CoordinateType::Map,x,y,(*i)->getType().groundWeapon()->maxRange(),Colors::Green,false);\r\n  }\r\n  *\/\r\n\r\n  \/\/we will iterate through all the base locations, and draw their outlines.\r\n  for(std::set<BWTA::BaseLocation*>::const_iterator i=BWTA::getBaseLocations().begin();i!=BWTA::getBaseLocations().end();i++)\r\n  {\r\n    TilePosition p=(*i)->getTilePosition();\r\n    Position c=(*i)->getPosition();\r\n\r\n    \/\/draw outline of center location\r\n    Broodwar->drawBox(CoordinateType::Map,p.x()*32,p.y()*32,p.x()*32+4*32,p.y()*32+3*32,Colors::Blue,false);\r\n\r\n    \/\/draw a circle at each mineral patch\r\n    for(std::set<BWAPI::Unit*>::const_iterator j=(*i)->getMinerals().begin();j!=(*i)->getMinerals().end();j++)\r\n    {\r\n      Position q=(*j)->getPosition();\r\n      Broodwar->drawCircle(CoordinateType::Map,q.x(),q.y(),30,Colors::Cyan,false);\r\n    }\r\n\r\n    \/\/draw the outlines of vespene geysers\r\n    for(std::set<BWAPI::Unit*>::const_iterator j=(*i)->getGeysers().begin();j!=(*i)->getGeysers().end();j++)\r\n    {\r\n      TilePosition q=(*j)->getTilePosition();\r\n      Broodwar->drawBox(CoordinateType::Map,q.x()*32,q.y()*32,q.x()*32+4*32,q.y()*32+2*32,Colors::Orange,false);\r\n    }\r\n\r\n    \/\/if this is an island expansion, draw a yellow circle around the base location\r\n    if ((*i)->isIsland())\r\n    {\r\n      Broodwar->drawCircle(CoordinateType::Map,c.x(),c.y(),80,Colors::Yellow,false);\r\n    }\r\n  }\r\n    \r\n  \/\/we will iterate through all the regions and draw the polygon outline of it in green.\r\n  for(std::set<BWTA::Region*>::const_iterator r=BWTA::getRegions().begin();r!=BWTA::getRegions().end();r++)\r\n  {\r\n    BWTA::Polygon p=(*r)->getPolygon();\r\n    for(int j=0;j<(int)p.size();j++)\r\n    {\r\n      Position point1=p[j];\r\n      Position point2=p[(j+1) % p.size()];\r\n      Broodwar->drawLine(CoordinateType::Map,point1.x(),point1.y(),point2.x(),point2.y(),Colors::Green);\r\n    }\r\n  }\r\n\r\n  \/\/we will visualize the chokepoints with red lines\r\n  for(std::set<BWTA::Region*>::const_iterator r=BWTA::getRegions().begin();r!=BWTA::getRegions().end();r++)\r\n  {\r\n    for(std::set<BWTA::Chokepoint*>::const_iterator c=(*r)->getChokepoints().begin();c!=(*r)->getChokepoints().end();c++)\r\n    {\r\n      Position point1=(*c)->getSides().first;\r\n      Position point2=(*c)->getSides().second;\r\n      Broodwar->drawLine(CoordinateType::Map,point1.x(),point1.y(),point2.x(),point2.y(),Colors::Red);\r\n    }\r\n  }\r\n}\r\n\r\nvoid BasicAIModule::onUnitDestroy(BWAPI::Unit* unit)\r\n{\r\n  this->arbitrator.onRemoveObject(unit);\r\n  this->buildManager->onRemoveUnit(unit);\r\n  this->techManager->onRemoveUnit(unit);\r\n  this->upgradeManager->onRemoveUnit(unit);\r\n  this->workerManager->onRemoveUnit(unit);\r\n  this->scoutManager->onRemoveUnit(unit);\r\n}\r\nbool BasicAIModule::onSendText(std::string text)\r\n{\r\n  UnitType type=UnitTypes::getUnitType(text);\r\n  if (text==\"debug\")\r\n  {\r\n    this->showManagerAssignments=true;\r\n    return true;\r\n  }\r\n  if (type!=UnitTypes::Unknown)\r\n  {\r\n    this->buildManager->build(type);\r\n  }\r\n  else\r\n  {\r\n    TechType type=TechTypes::getTechType(text);\r\n    if (type!=TechTypes::Unknown)\r\n    {\r\n      this->techManager->research(type);\r\n    }\r\n    else\r\n    {\r\n      UpgradeType type=UpgradeTypes::getUpgradeType(text);\r\n      if (type!=UpgradeTypes::Unknown)\r\n      {\r\n        this->upgradeManager->upgrade(type);\r\n      }\r\n      else\r\n        Broodwar->printf(\"You typed '%s'!\",text.c_str());\r\n    }\r\n  }\r\n  return true;\r\n}\r\n<|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 <cstdlib>\n#include <iostream>\n\n#include <vnl\/vnl_math.h>\n#include <vcl_cmath.h>\n\n#include \"itkMacro.h\"\n#include \"itkImage.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkMersenneTwisterRandomVariateGenerator.h\"\n\n#include \"..\/itkSplineND.h\"\n#include \"..\/itkOptBrent1D.h\"\n#include \"..\/itkSplineApproximation1D.h\"\n#include \"..\/itkUserFunc.h\"\n\nclass MySANDFunc:\n  public itk::UserFunc< vnl_vector<int>, double > \n  {\n  private:\n    double cVal;\n  public:\n    MySANDFunc( )\n      {\n      cVal = 0;\n      };\n    const double & value( const vnl_vector<int> & x )\n      {\n      cVal = vcl_sin((double)x[0]\/2);\n      cVal += vcl_cos((double)x[1]\/2);\n      std::cout << \"s: x = \" << x[0] << \", \" << x[1] \n        << \" : v = \" << cVal << std::endl;\n      return cVal;\n      };\n  };\n\nclass MySANDFuncV:\n  public itk::UserFunc< vnl_vector<double>, double > \n  {\n  private:\n    double cVal;\n  public:\n    MySANDFuncV( )\n      {\n      cVal = 0;\n      };\n    const double & value( const vnl_vector<double> & x )\n      {\n      cVal = vcl_sin((double)x[0]\/2);\n      cVal += vcl_cos((double)x[1]\/2);\n      return cVal;\n      };\n  };\nclass MySANDFuncD:\n  public itk::UserFunc< vnl_vector<double>, vnl_vector<double> > \n  {\n  private:\n    vnl_vector<double> cDeriv;\n  public:\n    MySANDFuncD( )\n      {\n      cDeriv.set_size(2);\n      cDeriv.fill( 0 );\n      };\n    const vnl_vector<double> & value( const vnl_vector<double> & x )\n      {\n      cDeriv[0] = vcl_cos((double)x[0]\/2);\n      cDeriv[1] = -vcl_sin((double)x[1]\/2);\n      return cDeriv;\n      };\n  };\n\nint itkSplineNDTest( int argc, char *argv[] )\n{\n  if( argc != 2 )\n    {\n    std::cout << \"usage: run <outImFile>\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  double epsilon = 0.000001;\n\n  MySANDFunc * myFunc = new MySANDFunc();\n  MySANDFuncV * myFuncV = new MySANDFuncV();\n  MySANDFuncD * myFuncD = new MySANDFuncD();\n\n  itk::SplineApproximation1D * spline1D = new itk::SplineApproximation1D();\n\n  itk::OptBrent1D * opt = new itk::OptBrent1D( );\n  opt->smallDouble( epsilon );\n  opt->searchForMin( true );\n  opt->xStep( 0.01 );\n  opt->tolerance( 0.0000001 );\n\n  itk::SplineND spline( 2, myFunc, spline1D, opt );\n\n  int returnStatus = EXIT_SUCCESS;\n\n  spline.clipEdge( true );\n\n  vnl_vector<int> xMin(2, -6);\n  spline.xMin( xMin );\n  if( spline.xMin()[0] != -6 )\n    {\n    std::cout << \"xMin should be -6 and not \" << spline.xMin() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  vnl_vector<int> xMax(2, 6);\n  spline.xMax( xMax );\n  if( spline.xMax()[0] != 6 )\n    {\n    std::cout << \"xMax should be 6 and not \" << spline.xMax() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  typedef itk::Image< float, 3 >  ImageType;\n\n  ImageType::Pointer im = ImageType::New( );\n  ImageType::RegionType imRegion;\n  ImageType::SizeType imSize;\n  imSize[0] = 60;\n  imSize[1] = 60;\n  imSize[2] = 20;\n  imRegion.SetSize( imSize );\n  ImageType::IndexType index0;\n  index0[0] = -30;\n  index0[1] = -30;\n  index0[2] = -10;\n  imRegion.SetIndex( index0 );\n  im->SetRegions( imRegion );\n  ImageType::SpacingType imSpacing;\n  imSpacing[0] = 0.2;\n  imSpacing[1] = 0.2;\n  imSpacing[2] = 0.2;\n  im->SetSpacing( imSpacing );\n  im->Allocate( );\n\n  itk::ImageRegionIteratorWithIndex<ImageType> itIm( im,\n    im->GetLargestPossibleRegion( ) );\n  ImageType::PointType pnt;\n  itIm.GoToBegin();\n  vnl_vector<double> x(2);\n  vnl_vector<double> d(2);\n  vnl_vector<int> di(2);\n  di.fill( 0 );\n  di[1] = 1;\n  vnl_matrix<double> m(2,2);\n  vnl_vector<double> d2(2);\n  while( !itIm.IsAtEnd() )\n    {\n    im->TransformIndexToPhysicalPoint( itIm.GetIndex(), pnt );\n    x[0] = pnt[0];\n    x[1] = pnt[1];\n    std::cout << \"img: \" << std::flush;\n    switch( (itIm.GetIndex()[2] - index0[2]) % 9 )\n      {\n      default:\n      case 0:\n        {\n        itIm.Set( spline.value(x) );\n        break;\n        }\n      case 1:\n        {\n        itIm.Set( myFuncV->value(x) );\n        break;\n        }\n      case 2:\n        {\n        itIm.Set( spline.valueD(x, di) );\n        break;\n        }\n      case 3:\n        {\n        itIm.Set( myFuncD->value(x)[1] );\n        break;\n        }\n      case 4:\n        {\n        d = spline.valueD(x);\n        itIm.Set( d[0]*d[0] + d[1]*d[1] );\n        break;\n        }\n      case 5:\n        {\n        d = myFuncD->value(x);\n        itIm.Set( d[0]*d[0] + d[1]*d[1] );\n        break;\n        }\n      case 6:\n        {\n        m = spline.hessian(x);\n        itIm.Set( m[0][0]*m[0][0] + m[1][1]*m[1][1] );\n        break;\n        }\n      case 7:\n        {\n        itIm.Set( spline.valueJet(x, d, m) );\n        break;\n        }\n      case 8:\n        {\n        itIm.Set( spline.valueVDD2(x, d, d2) );\n        break;\n        }\n      };\n    ++itIm;\n    }\n\n  typedef itk::ImageFileWriter<ImageType> ImageWriterType;\n  ImageWriterType::Pointer imWriter = ImageWriterType::New( );\n  imWriter->SetFileName( argv[1] );\n  imWriter->SetInput( im );\n  imWriter->Update( );\n\n  itk::Statistics::MersenneTwisterRandomVariateGenerator::Pointer rndGen\n    = itk::Statistics::MersenneTwisterRandomVariateGenerator::New();\n  rndGen->Initialize( 1 );\n\n  int failed = 0;\n  for(unsigned int c=0; c<100; c++)\n    {\n    x[0] = rndGen->GetNormalVariate( -1.0, 0.1 );\n    x[1] = rndGen->GetNormalVariate( -1.0, 0.1 );\n    std::cout << \"Optimizing from \" << x[0] << \", \" << x[1] << std::endl;\n    double xVal = 0;\n    if( !spline.extreme( x, &xVal ) )\n      {\n      std::cout << \"Spline.extreme failed.\" << std::endl;\n      std::cout << \"  x = \" << x[0] << \", \" << x[1] << std::endl;\n      std::cout << \"  xVal = \" << xVal << std::endl;\n      returnStatus = EXIT_FAILURE;\n      ++failed;\n      }\n    else\n      {\n      bool err = false;\n      if( x[0] != -1.5 || x[1] != -1.5 )\n        {\n        std::cout << \"Spline.extreme failed.\" << std::endl;\n        std::cout << \"  x=\" << x[0] << \",\" << x[1] \n          << \" != ideal=-1.5,-1.5\" << std::endl;\n        returnStatus = EXIT_FAILURE;\n        err = true;\n        }\n      if( xVal != -0.8 ) \n        {\n        std::cout << \"Spline.extreme failed.\" << std::endl;\n        std::cout << \"  xVal=\" << xVal << \" != -0.8\" << std::endl;\n        returnStatus = EXIT_FAILURE;\n        err = true;\n        }\n      if( err )\n        {\n        ++failed;\n        }\n      }\n    }\n\n  std::cout << failed << \" out of 100 optimizations failed.\" << std::endl;\n\n  return returnStatus;\n}\n\n<commit_msg>ENH: Fixed test of optimization using splines.   Specified proper target values.   Set optimization parameters for the ND optimizer, not for the 1D optimizer it uses.<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 <cstdlib>\n#include <iostream>\n\n#include <vnl\/vnl_math.h>\n#include <vcl_cmath.h>\n\n#include \"itkMacro.h\"\n#include \"itkImage.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkMersenneTwisterRandomVariateGenerator.h\"\n\n#include \"..\/itkSplineND.h\"\n#include \"..\/itkOptBrent1D.h\"\n#include \"..\/itkOptParabolicFit1D.h\"\n#include \"..\/itkSplineApproximation1D.h\"\n#include \"..\/itkUserFunc.h\"\n\nclass MySANDFunc:\n  public itk::UserFunc< vnl_vector<int>, double > \n  {\n  private:\n    double cVal;\n  public:\n    MySANDFunc( )\n      {\n      cVal = 0;\n      };\n    const double & value( const vnl_vector<int> & x )\n      {\n      cVal = vcl_sin((double)x[0]\/2);\n      cVal += vcl_cos((double)x[1]\/2);\n      std::cout << \"s: x = \" << x[0] << \", \" << x[1] \n        << \" : v = \" << cVal << std::endl;\n      return cVal;\n      };\n  };\n\nclass MySANDFuncV:\n  public itk::UserFunc< vnl_vector<double>, double > \n  {\n  private:\n    double cVal;\n  public:\n    MySANDFuncV( )\n      {\n      cVal = 0;\n      };\n    const double & value( const vnl_vector<double> & x )\n      {\n      cVal = vcl_sin((double)x[0]\/2);\n      cVal += vcl_cos((double)x[1]\/2);\n      return cVal;\n      };\n  };\nclass MySANDFuncD:\n  public itk::UserFunc< vnl_vector<double>, vnl_vector<double> > \n  {\n  private:\n    vnl_vector<double> cDeriv;\n  public:\n    MySANDFuncD( )\n      {\n      cDeriv.set_size(2);\n      cDeriv.fill( 0 );\n      };\n    const vnl_vector<double> & value( const vnl_vector<double> & x )\n      {\n      cDeriv[0] = vcl_cos((double)x[0]\/2);\n      cDeriv[1] = -vcl_sin((double)x[1]\/2);\n      return cDeriv;\n      };\n  };\n\nint itkSplineNDTest( int argc, char *argv[] )\n{\n  if( argc != 2 )\n    {\n    std::cout << \"usage: run <outImFile>\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  MySANDFunc * myFunc = new MySANDFunc();\n  MySANDFuncV * myFuncV = new MySANDFuncV();\n  MySANDFuncD * myFuncD = new MySANDFuncD();\n\n  itk::SplineApproximation1D * spline1D = new itk::SplineApproximation1D();\n\n  \/\/itk::OptParabolicFit1D * opt = new itk::OptParabolicFit1D( );\n  itk::OptBrent1D * opt = new itk::OptBrent1D( );\n\n  itk::SplineND spline( 2, myFunc, spline1D, opt );\n\n  int returnStatus = EXIT_SUCCESS;\n\n  spline.clipEdge( true );\n\n  vnl_vector<int> xMin(2, -6);\n  spline.xMin( xMin );\n  if( spline.xMin()[0] != -6 )\n    {\n    std::cout << \"xMin should be -6 and not \" << spline.xMin() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  vnl_vector<int> xMax(2, 6);\n  spline.xMax( xMax );\n  if( spline.xMax()[0] != 6 )\n    {\n    std::cout << \"xMax should be 6 and not \" << spline.xMax() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  typedef itk::Image< float, 3 >  ImageType;\n\n  ImageType::Pointer im = ImageType::New( );\n  ImageType::RegionType imRegion;\n  ImageType::SizeType imSize;\n  imSize[0] = 60;\n  imSize[1] = 60;\n  imSize[2] = 20;\n  imRegion.SetSize( imSize );\n  ImageType::IndexType index0;\n  index0[0] = -30;\n  index0[1] = -30;\n  index0[2] = -10;\n  imRegion.SetIndex( index0 );\n  im->SetRegions( imRegion );\n  ImageType::SpacingType imSpacing;\n  imSpacing[0] = 0.2;\n  imSpacing[1] = 0.2;\n  imSpacing[2] = 0.2;\n  im->SetSpacing( imSpacing );\n  im->Allocate( );\n\n  itk::ImageRegionIteratorWithIndex<ImageType> itIm( im,\n    im->GetLargestPossibleRegion( ) );\n  ImageType::PointType pnt;\n  itIm.GoToBegin();\n  vnl_vector<double> x(2);\n  vnl_vector<double> d(2);\n  vnl_vector<int> di(2);\n  di.fill( 0 );\n  di[1] = 1;\n  vnl_matrix<double> m(2,2);\n  vnl_vector<double> d2(2);\n  while( !itIm.IsAtEnd() )\n    {\n    im->TransformIndexToPhysicalPoint( itIm.GetIndex(), pnt );\n    x[0] = pnt[0];\n    x[1] = pnt[1];\n    switch( (itIm.GetIndex()[2] - index0[2]) % 9 )\n      {\n      default:\n      case 0:\n        {\n        itIm.Set( spline.value(x) );\n        break;\n        }\n      case 1:\n        {\n        itIm.Set( myFuncV->value(x) );\n        break;\n        }\n      case 2:\n        {\n        itIm.Set( spline.valueD(x, di) );\n        break;\n        }\n      case 3:\n        {\n        itIm.Set( myFuncD->value(x)[1] );\n        break;\n        }\n      case 4:\n        {\n        d = spline.valueD(x);\n        itIm.Set( d[0] + d[1] );\n        break;\n        }\n      case 5:\n        {\n        d = myFuncD->value(x);\n        itIm.Set( d[0] + d[1] );\n        break;\n        }\n      case 6:\n        {\n        m = spline.hessian(x);\n        itIm.Set( m[0][0]*m[0][0] + m[1][1]*m[1][1] );\n        break;\n        }\n      case 7:\n        {\n        itIm.Set( spline.valueJet(x, d, m) );\n        break;\n        }\n      case 8:\n        {\n        itIm.Set( spline.valueVDD2(x, d, d2) );\n        break;\n        }\n      };\n    ++itIm;\n    }\n\n  typedef itk::ImageFileWriter<ImageType> ImageWriterType;\n  ImageWriterType::Pointer imWriter = ImageWriterType::New( );\n  imWriter->SetFileName( argv[1] );\n  imWriter->SetInput( im );\n  imWriter->Update( );\n\n  itk::Statistics::MersenneTwisterRandomVariateGenerator::Pointer rndGen\n    = itk::Statistics::MersenneTwisterRandomVariateGenerator::New();\n  rndGen->Initialize( 1 );\n\n  spline.optimizerND()->searchForMin( false );\n  vnl_vector<double> xStep(2, 0.1);\n  spline.optimizerND()->xStep( xStep );\n  spline.optimizerND()->tolerance( 0.0001 );\n  spline.optimizerND()->maxIterations( 1000 );\n  spline.optimizerND()->maxLineSearches( 40 );\n  if( opt->searchForMin() != false )\n    {\n    std::cout << \"SearchForMin not preserved.\" << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n  if( opt->tolerance() != 0.0001 )\n    {\n    std::cout << \"tolerance not preserved.\" << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n  opt->maxIterations( 1000 );\n  if( opt->maxIterations() != 1000 )\n    {\n    std::cout << \"maxIterations not preserved.\" << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n  int failed = 0;\n  for(unsigned int c=0; c<100; c++)\n    {\n    x[0] = rndGen->GetNormalVariate( 3.14, 0.5 );\n    x[1] = rndGen->GetNormalVariate( 0.0, 0.5 );\n    std::cout << \"Optimizing from \" << x[0] << \", \" << x[1] << std::endl;\n    double xVal = 0;\n    if( !spline.extreme( x, &xVal ) )\n      {\n      std::cout << \"Spline.extreme failed.\" << std::endl;\n      std::cout << \"  x = \" << x[0] << \", \" << x[1] << std::endl;\n      std::cout << \"  xVal = \" << xVal << std::endl;\n      returnStatus = EXIT_FAILURE;\n      ++failed;\n      }\n    else\n      {\n      bool err = false;\n      if( vnl_math_abs(x[0] - 3.139) > 0.001 \n        || vnl_math_abs(x[1] - 0.0) > 0.001 )\n        {\n        std::cout << \"Spline.extreme failed.\" << std::endl;\n        std::cout << \"  x = (\" << x[0] << \", \" << x[1] \n          << \") != ideal = (3.1139, 0.0)\" << std::endl;\n        returnStatus = EXIT_FAILURE;\n        err = true;\n        }\n      if( vnl_math_abs( xVal - 1.918) > 0.001 ) \n        {\n        std::cout << \"Spline.extreme failed.\" << std::endl;\n        std::cout << \"  xVal=\" << xVal << \" != 1.918\" << std::endl;\n        returnStatus = EXIT_FAILURE;\n        err = true;\n        }\n      if( err )\n        {\n        ++failed;\n        }\n      else\n        {\n        std::cout << \"Success: x = \" << x << \" : xVal = \" \n          << xVal << std::endl;\n        }\n      }\n    }\n\n  std::cout << failed << \" out of 100 optimizations failed.\" << std::endl;\n\n  return returnStatus;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"GolfBall.hpp\"\n#include \"..\/Resources.hpp\"\n#include \"Default3D.vert.hpp\"\n#include \"Default3D.geom.hpp\"\n#include \"Default3D.frag.hpp\"\n#include \"glm\/gtc\/constants.hpp\"\n#include \"..\/Util\/Log.hpp\"\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/quaternion.hpp>\n\nGolfBall::GolfBall(BallType ballType, TerrainObject* terrain, Water* water) : ModelObject(modelGeometry = Resources().CreateOBJModel(\"Resources\/Models\/GolfBall\/GolfBall.obj\"),\n                                                                            \"Resources\/Models\/GolfBall\/Diffuse.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Normal.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Specular.png\") {\n    state = GolfBall::INITIAL;\n    \n    restitution = ballType == TWOPIECE ? 0.78f : 0.68f;\n    this->terrain = terrain;\n    this->water = water;\n    origin = glm::vec3(1.f, 0.f, 1.f);\n    \n    mass = 0.0459f;\n    this->ballType = ballType;\n    \n    sphere.position = Position();\n    SetRadius(0.0214f);\n}\n\nGolfBall::~GolfBall() {\n    Resources().FreeOBJModel(modelGeometry);\n}\n\nvoid GolfBall::Reset(glm::vec3 newOrigin){\n    state = GolfBall::INITIAL;\n    velocity = glm::vec3(0.f, 0.f, 0.f);\n    angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    SetPosition(newOrigin);\n    sphere.position = Position();\n    orientation = glm::quat();\n}\n\n\nvoid GolfBall::Render(Camera* camera, const glm::vec2& screenSize, const glm::vec4& clippingPlane) const{\n    if (state != GolfBall::EXPLODED && state != GolfBall::OUT)\n        ModelObject::Render(camera, screenSize, clippingPlane);\n}\n\nvoid GolfBall::Explode(std::vector<PlayerObject>& players){\n    \/\/@TODO: Set mass equivalent depending on material used.\n    float equivalenceFactor = 1.0f;\n    float massEquivalent = mass*equivalenceFactor;\n    for (auto &player : players){\n        glm::vec3 distanceV = (Position() - player.Position());\n        float distance = glm::length(distanceV); \n        \/\/pow(meq, 1.f\/3.f) => cube root of meq\n        float z = distance \/ (pow(massEquivalent, 1.f \/ 3.f));\n        float alpha = 1 + pow((z \/ 4.5f), 2.f);\n        float beta = 1 + pow((z \/ 0.048f), 2.f);\n        float gamma = 1 + pow((z \/ 1.35f), 2.f);\n        float delta = 1 + pow((z \/ 0.32f), 2.f);\n        \/\/float Pf = 8.08f*pow(10.f, 7.f)*alpha;\n\t\tfloat Pf = ((8.08e7)*alpha) \/ sqrt(beta*gamma*delta);\n        player.TakeDamage(Pf);\n    }\n    state = GolfBall::EXPLODED;\n}\n\nvoid GolfBall::Strike(ClubType club, const glm::vec3& clubVelocity) {\n    state = GolfBall::ACTIVE;\n    \n    \/\/ Club velocity in strike plane.\n    float v = glm::length(clubVelocity);\n    if (v > 0.f)\n    {\n        float sinLoft = sin(club.loft);\n        float cosLoft = cos(club.loft);\n        \n        \/\/ Ball velocity.\n        float massCoefficient = club.mass \/ (club.mass + mass);\n        float Up = (1.f + restitution) * massCoefficient * v * cosLoft;\n        float Un = (2.f \/ 7.f) * massCoefficient * v * sinLoft;\n        \n        \/\/ Go back from strike plane to 3D.\n        glm::vec3 forward = clubVelocity \/ v;\n        glm::vec3 up = glm::cross(forward, glm::cross(glm::vec3(0.f, 1.f, 0.f), forward));\n        glm::vec3 ep = glm::normalize(cosLoft * forward + sinLoft * up);\n        glm::vec3 en = glm::normalize(sinLoft * forward - cosLoft * up);\n        \n        \/\/ Total velocity.\n        velocity = Up * ep + Un * en;\n        angularVelocity = -Un \/ sphere.radius * glm::cross(ep, en);\n    } else {\n        velocity = glm::vec3(0.f, 0.f, 0.f);\n        angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    }\n}\n\nfloat GolfBall::Radius() const {\n    return sphere.radius;\n}\n\nvoid GolfBall::SetRadius(float radius) {\n    sphere.radius = radius;\n    SetScale(glm::vec3(radius, radius, radius));\n    area = glm::pi<float>() * radius * radius;\n}\n\nglm::mat4 GolfBall::Orientation() const {\n    return glm::toMat4(orientation);\n}\n\nGolfBall::State GolfBall::GetState() const {\n    return state;\n}\n<commit_msg>Stuff<commit_after>#include \"GolfBall.hpp\"\n#include \"..\/Resources.hpp\"\n#include \"Default3D.vert.hpp\"\n#include \"Default3D.geom.hpp\"\n#include \"Default3D.frag.hpp\"\n#include \"glm\/gtc\/constants.hpp\"\n#include \"..\/Util\/Log.hpp\"\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/quaternion.hpp>\n\nGolfBall::GolfBall(BallType ballType, TerrainObject* terrain, Water* water) : ModelObject(modelGeometry = Resources().CreateOBJModel(\"Resources\/Models\/GolfBall\/GolfBall.obj\"),\n                                                                            \"Resources\/Models\/GolfBall\/Diffuse.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Normal.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Specular.png\") {\n    state = GolfBall::INITIAL;\n    \n    restitution = ballType == TWOPIECE ? 0.78f : 0.68f;\n    this->terrain = terrain;\n    this->water = water;\n    origin = glm::vec3(1.f, 0.f, 1.f);\n    \n    mass = 0.0459f;\n    this->ballType = ballType;\n    \n    sphere.position = Position();\n    SetRadius(0.0214f);\n}\n\nGolfBall::~GolfBall() {\n    Resources().FreeOBJModel(modelGeometry);\n}\n\nvoid GolfBall::Reset(glm::vec3 newOrigin){\n    state = GolfBall::INITIAL;\n    velocity = glm::vec3(0.f, 0.f, 0.f);\n    angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    SetPosition(newOrigin);\n    sphere.position = Position();\n    orientation = glm::quat();\n}\n\nvoid GolfBall::Update(double time, const glm::vec3& wind, std::vector<PlayerObject>& players) {\n\tif (state == GolfBall::ACTIVE) {\n\t\tMove(static_cast<float>(time)* velocity);\n\t\tsphere.position = Position();\n\n\t\tif (glm::length(angularVelocity) > 0.0001f) {\n\t\t\tglm::quat deltaQuat = glm::angleAxis(static_cast<float>(time)* glm::length(angularVelocity), glm::normalize(angularVelocity));\n\t\t\torientation = deltaQuat * orientation;\n\t\t}\n\n\t\tglm::vec3 dragForce, magnusForce, acceleration = glm::vec3(0.f, 0.f, 0.f);\n\n\t\tfloat groundLevel = terrain->GetY(Position().x, Position().z);\n\t\tfloat waterLevel = water->Position().y;\n\n\t\t\/\/ Check if in water.\n\t\tif ((sphere.position.y - sphere.radius < groundLevel && groundLevel + sphere.radius < waterLevel) || sphere.position.y + sphere.radius < waterLevel) {\n\t\t\tstate = GolfBall::OUT;\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Check for collision\n\t\tif ((sphere.position.y - sphere.radius) < groundLevel){\n\t\t\tfloat vCritical = 1.8f;\n\t\t\tfloat e = 0.35f;\n\t\t\tfloat muSliding = 0.51f;\n\t\t\tfloat muRolling = 0.096f;\n\t\t\tSetPosition(Position().x, groundLevel + sphere.radius, Position().z);\n\t\t\tsphere.position = Position();\n\t\t\tglm::vec3 eRoh = glm::normalize(terrain->GetNormal(Position().x, Position().z));\n\t\t\tglm::vec3 tangentialVelocity = velocity - glm::dot(velocity, eRoh) * eRoh;\n\t\t\tglm::vec3 eFriction = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (glm::length(glm::cross(eRoh, angularVelocity) + tangentialVelocity) > 0.0001f){\n\t\t\t\teFriction = glm::normalize(sphere.radius * glm::cross(eRoh, angularVelocity) + tangentialVelocity);\n\t\t\t}\n\t\t\tfloat vRoh = glm::dot(velocity, eRoh);\n\t\t\tfloat deltaU = -(e + 1.f) * vRoh;\n\n\t\t\tif (vRoh < vCritical && glm::length(tangentialVelocity) > 0.0001f) {\n\t\t\t\tglm::vec3 mg = (9.82f*glm::vec3(0.f, -1.f, 0.f));\n\t\t\t\tglm::vec3 tangentialGravityAcceleration = mg - glm::dot(mg, eRoh)*eRoh;\n\t\t\t\tglm::vec3 compareVectorPositive = eFriction - normalize(tangentialVelocity);\n\t\t\t\tglm::vec3 compareVectorNegative = eFriction - normalize(-tangentialVelocity);\n\t\t\t\tif ((glm::length(compareVectorNegative) < 0.03f) || (glm::length(compareVectorPositive) < 0.03f)) {\n\t\t\t\t\t\/\/sliding\n\t\t\t\t\tglm::vec3 tangentialSlidingFrictionDeceleration = muSliding*eFriction*9.82f*mass*eRoh.y;\n\t\t\t\t\tfloat alpha = (glm::length(tangentialSlidingFrictionDeceleration)*sphere.radius) \/ (mass*sphere.radius*sphere.radius*0.4f);\n\t\t\t\t\tvelocity = velocity + (tangentialSlidingFrictionDeceleration + tangentialGravityAcceleration)*static_cast<float>(time);\n\t\t\t\t\tglm::vec3 tangentialVelocityDirection = glm::normalize(velocity);\n\t\t\t\t\tangularVelocity = angularVelocity + (alpha*static_cast<float>(time))*(glm::cross(sphere.radius*tangentialVelocityDirection, -eRoh));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\t\/\/rolling\n\t\t\t\t\tglm::vec3 tangentialRollingFrictionDeceleration = muRolling*eFriction*9.82f*mass*eRoh.y;\n\t\t\t\t\tvelocity = velocity + (tangentialRollingFrictionDeceleration + tangentialGravityAcceleration)*static_cast<float>(time);\n\t\t\t\t\tglm::vec3 tangentialVelocityDirection = glm::normalize(velocity);\n\t\t\t\t\tangularVelocity = (glm::length(velocity) \/ sphere.radius)*(glm::cross(eFriction, -eRoh));\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfloat deltaTime = pow(mass * mass \/ (fabs(vRoh) * sphere.radius), 0.2f) * 0.00251744f;\n\t\t\t\tfloat velocityRoh = glm::dot(velocity, eRoh);\n\t\t\t\tfloat velocityNormal = glm::dot(velocity, eFriction);\n\t\t\t\tfloat uRoh = -e*velocityRoh;\n\t\t\t\tfloat deltauRoh = uRoh - (velocityRoh);\n\t\t\t\tfloat deltaUn = muSliding*deltauRoh;\n\t\t\t\tfloat rollUn = (5.f \/ 7.f)*velocityNormal;\n\t\t\t\tfloat slideUn = velocityNormal - deltaUn;\n\n\t\t\t\tif (velocityNormal > rollUn){\n\t\t\t\t\tvelocity = uRoh*eRoh + rollUn*eFriction;\n\t\t\t\t\tangularVelocity += muRolling * (deltaU + 9.82f*eRoh.y * deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tvelocity = uRoh*eRoh + slideUn*eFriction;\n\t\t\t\t\tangularVelocity += muSliding * (deltaU + 9.82f *eRoh.y* deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t\/\/ Calculate magnus force.\n\t\t\tfloat v = glm::length(velocity);\n\t\t\tfloat u = glm::length(velocity - wind);\n\t\t\tfloat w = glm::length(angularVelocity);\n\t\t\tglm::vec3 eU = (velocity - wind) \/ u;\n\t\t\tmagnusForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f && v > 0.f && w > 0.f) {\n\t\t\t\tfloat Cm = (sqrt(1.f + 0.31f * (w \/ v)) - 1.f) \/ 20.f;\n\t\t\t\tfloat Fm = 0.5f * Cm * 1.23f * area * u * u;\n\t\t\t\tmagnusForce = Fm * glm::cross(eU, glm::normalize(angularVelocity));\n\t\t\t}\n\n\t\t\t\/\/ Calculate drag force.\n\t\t\tfloat cD;\n\t\t\tif (ballType == TWOPIECE)\n\t\t\t\tcD = v < 65.f ? -0.0051f * v + 0.53f : 0.21f;\n\t\t\telse\n\t\t\t\tcD = v < 60.f ? -0.0084f * v + 0.73f : 0.22f;\n\t\t\tdragForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f)\n\t\t\t\tdragForce = -0.5f * 1.23f * area * cD * u * u * eU;\n\n\t\t\t\/\/ Calculate gravitational force.\n\t\t\tglm::vec3 gravitationForce = glm::vec3(0.f, mass * -9.82f, 0.f);\n\t\t\t\/\/ Get acceleration from total force.\n\t\t\tacceleration = (dragForce + magnusForce + gravitationForce) \/ mass;\n\t\t\tvelocity += acceleration * static_cast<float>(time);\n\t\t}\n\t}\n}\n\nvoid GolfBall::Render(Camera* camera, const glm::vec2& screenSize, const glm::vec4& clippingPlane) const{\n    if (state != GolfBall::EXPLODED && state != GolfBall::OUT)\n        ModelObject::Render(camera, screenSize, clippingPlane);\n}\n\nvoid GolfBall::Explode(std::vector<PlayerObject>& players){\n    \/\/@TODO: Set mass equivalent depending on material used.\n    float equivalenceFactor = 1.0f;\n    float massEquivalent = mass*equivalenceFactor;\n    for (auto &player : players){\n        glm::vec3 distanceV = (Position() - player.Position());\n        float distance = glm::length(distanceV); \n        \/\/pow(meq, 1.f\/3.f) => cube root of meq\n        float z = distance \/ (pow(massEquivalent, 1.f \/ 3.f));\n        float alpha = 1 + pow((z \/ 4.5f), 2.f);\n        float beta = 1 + pow((z \/ 0.048f), 2.f);\n        float gamma = 1 + pow((z \/ 1.35f), 2.f);\n        float delta = 1 + pow((z \/ 0.32f), 2.f);\n        \/\/float Pf = 8.08f*pow(10.f, 7.f)*alpha;\n\t\tfloat Pf = ((8.08e7)*alpha) \/ sqrt(beta*gamma*delta);\n        player.TakeDamage(Pf);\n    }\n    state = GolfBall::EXPLODED;\n}\n\nvoid GolfBall::Strike(ClubType club, const glm::vec3& clubVelocity) {\n    state = GolfBall::ACTIVE;\n    \n    \/\/ Club velocity in strike plane.\n    float v = glm::length(clubVelocity);\n    if (v > 0.f)\n    {\n        float sinLoft = sin(club.loft);\n        float cosLoft = cos(club.loft);\n        \n        \/\/ Ball velocity.\n        float massCoefficient = club.mass \/ (club.mass + mass);\n        float Up = (1.f + restitution) * massCoefficient * v * cosLoft;\n        float Un = (2.f \/ 7.f) * massCoefficient * v * sinLoft;\n        \n        \/\/ Go back from strike plane to 3D.\n        glm::vec3 forward = clubVelocity \/ v;\n        glm::vec3 up = glm::cross(forward, glm::cross(glm::vec3(0.f, 1.f, 0.f), forward));\n        glm::vec3 ep = glm::normalize(cosLoft * forward + sinLoft * up);\n        glm::vec3 en = glm::normalize(sinLoft * forward - cosLoft * up);\n        \n        \/\/ Total velocity.\n        velocity = Up * ep + Un * en;\n        angularVelocity = -Un \/ sphere.radius * glm::cross(ep, en);\n    } else {\n        velocity = glm::vec3(0.f, 0.f, 0.f);\n        angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    }\n}\n\nfloat GolfBall::Radius() const {\n    return sphere.radius;\n}\n\nvoid GolfBall::SetRadius(float radius) {\n    sphere.radius = radius;\n    SetScale(glm::vec3(radius, radius, radius));\n    area = glm::pi<float>() * radius * radius;\n}\n\nglm::mat4 GolfBall::Orientation() const {\n    return glm::toMat4(orientation);\n}\n\nGolfBall::State GolfBall::GetState() const {\n    return state;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"GolfBall.hpp\"\n#include \"..\/Resources.hpp\"\n#include \"Default3D.vert.hpp\"\n#include \"Default3D.geom.hpp\"\n#include \"Default3D.frag.hpp\"\n#include \"glm\/gtc\/constants.hpp\"\n#include \"..\/Util\/Log.hpp\"\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/quaternion.hpp>\n\nGolfBall::GolfBall(BallType ballType, TerrainObject* terrain, Water* water) : ModelObject(modelGeometry = Resources().CreateOBJModel(\"Resources\/Models\/GolfBall\/GolfBall.obj\"),\n                                                                            \"Resources\/Models\/GolfBall\/Diffuse.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Normal.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Specular.png\") {\n    state = GolfBall::INITIAL;\n    \n    restitution = ballType == TWOPIECE ? 0.78f : 0.68f;\n    this->terrain = terrain;\n    this->water = water;\n    origin = glm::vec3(1.f, 0.f, 1.f);\n    \n    mass = 0.0459f;\n    this->ballType = ballType;\n    \n    sphere.position = Position();\n    SetRadius(0.0214f);\n}\n\nGolfBall::~GolfBall() {\n    Resources().FreeOBJModel(modelGeometry);\n}\n\nvoid GolfBall::Reset(){\n    state = GolfBall::INITIAL;\n    velocity = glm::vec3(0.f, 0.f, 0.f);\n    angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    SetPosition(origin);\n    sphere.position = Position();\n    orientation = glm::quat();\n}\n\nvoid GolfBall::Update(double time, const glm::vec3& wind, std::vector<PlayerObject>& players) {\n\tif (state == GolfBall::ACTIVE) {\n\t\tMove(static_cast<float>(time)* velocity);\n\t\tsphere.position = Position();\n\n\t\tif (glm::length(angularVelocity) > 0.0001f) {\n\t\t\tglm::quat deltaQuat = glm::angleAxis(static_cast<float>(time)* glm::length(angularVelocity), glm::normalize(angularVelocity));\n\t\t\torientation = deltaQuat * orientation;\n\t\t}\n\n\t\tglm::vec3 dragForce, magnusForce = glm::vec3(0.f, 0.f, 0.f);\n\n\t\tfloat groundLevel = terrain->GetY(Position().x, Position().z);\n        float waterLevel = water->Position().y;\n        \n        \/\/ Check if in water.\n        if ((sphere.position.y - sphere.radius < groundLevel && groundLevel + sphere.radius < waterLevel) || sphere.position.y + sphere.radius < waterLevel) {\n            state = GolfBall::OUT;\n            return;\n        }\n        \n        \/\/ Check for collision\n\t\tif (glm::length(velocity) > 0.0001f && (sphere.position.y - sphere.radius) < groundLevel){\n\t\t\tfloat vCritical = 0.3f;\n\t\t\tfloat e = 0.35f;\n\t\t\tfloat muSliding = 0.51f;\n\t\t\tfloat muRolling = 0.096f;\n\t\t\tSetPosition(Position().x, groundLevel + sphere.radius, Position().z);\n\t\t\tsphere.position = Position();\n\t\t\t\/\/glm::vec3 eRoh = glm::normalize(glm::vec3(0.f, 1.f, 0.f));\n\t\t\tglm::vec3 eRoh = terrain->GetNormal(Position().x, Position().z);\n\t\t\tglm::vec3 tangentialVelocity = velocity - glm::dot(velocity, eRoh) * eRoh;\n\t\t\tglm::vec3 eFriction = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (glm::length(glm::cross(eRoh, angularVelocity) + tangentialVelocity) > 0.0001f){\n\t\t\t\teFriction = glm::normalize(sphere.radius * glm::cross(eRoh, angularVelocity) + tangentialVelocity);\n\t\t\t}\n\t\t\tfloat vRoh = glm::dot(velocity, eRoh);\n\t\t\tfloat deltaU = -(e + 1.f) * vRoh;\n\t\t\tglm::vec3 angularDirection = glm::cross(eRoh, glm::normalize(tangentialVelocity));\n\t\t\tfloat w = glm::dot(angularVelocity, angularDirection);\n\n\t\t\tif (fabs(vRoh) < vCritical && glm::length(tangentialVelocity) > 0.0001f) {\n\t\t\t\tglm::vec3 mg = (9.82f)*glm::vec3(0.f, -1.f, 0.f);\n\t\t\t\tglm::vec3 tangentialGravityAcceleration = glm::dot(mg, eRoh)*eRoh;\n\t\t\t\tglm::vec3 tangentialSlidingFrictionDeceleration = muSliding*eFriction;\n\t\t\t\tglm::vec3 tangentialRolling = (5.f\/7.f)*tangentialVelocity;\n\t\t\t\tglm::vec3 tangentialDelta = tangentialVelocity + (tangentialGravityAcceleration - tangentialSlidingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\tif (w * sphere.radius + 0.0001f < glm::length(tangentialVelocity)) {\n\t\t\t\t\t\/\/Rolling\n\t\t\t\t\tvelocity = tangentialVelocity - tangentialRolling*static_cast<float>(time);\n\t\t\t\t\tangularVelocity = (glm::length(velocity) \/ sphere.radius) * cross(eRoh,eFriction);\n\t\t\t\t} else {\n\t\t\t\t\t\/\/Sliding\n\t\t\t\t\tvelocity = tangentialVelocity - (tangentialGravityAcceleration - tangentialSlidingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\t\tangularVelocity += (5.f \/ 2.f) * (muSliding * 9.82f \/ sphere.radius * static_cast<float>(time)) * cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfloat deltaTime = pow(mass * mass \/ (fabs(vRoh) * sphere.radius), 0.2f) * 0.00251744f;\n\t\t\t\tfloat velocityRoh = glm::dot(velocity, eRoh);\n\t\t\t\tfloat velocityNormal = glm::dot(velocity, eFriction);\n\t\t\t\tfloat uRoh = -e*velocityRoh;\n\t\t\t\tfloat deltauRoh = uRoh - (velocityRoh);\n\t\t\t\tfloat deltaUn = muSliding*deltauRoh;\n\t\t\t\tfloat rollUn = (5.f \/ 7.f)*velocityNormal;\n\t\t\t\tfloat slideUn = velocityNormal - deltaUn;\n\n\t\t\t\tif (velocityNormal > rollUn){\n\t\t\t\t\tvelocity = uRoh*eRoh + rollUn*eFriction;\n\t\t\t\t\tangularVelocity += muRolling * (deltaU + 9.82f*eRoh.y * deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t} else {\n\t\t\t\t\tvelocity = uRoh*eRoh + slideUn*eFriction;\n\t\t\t\t\tangularVelocity += muSliding * (deltaU + 9.82f *eRoh.y* deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\t\/\/ Calculate magnus force.\n\t\t\tfloat v = glm::length(velocity);\n\t\t\tfloat u = glm::length(velocity - wind);\n\t\t\tfloat w = glm::length(angularVelocity);\n\t\t\tglm::vec3 eU = (velocity - wind) \/ u;\n\t\t\tmagnusForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f && v > 0.f && w > 0.f) {\n\t\t\t\tfloat Cm = (sqrt(1.f + 0.31f * (w \/ v)) - 1.f) \/ 20.f;\n\t\t\t\tfloat Fm = 0.5f * Cm * 1.23f * area * u * u;\n\t\t\t\tmagnusForce = Fm * glm::cross(eU, glm::normalize(angularVelocity));\n\t\t\t}\n\n\t\t\t\/\/ Calculate drag force.\n\t\t\tfloat cD;\n\t\t\tif (ballType == TWOPIECE)\n\t\t\t\tcD = v < 65.f ? -0.0051f * v + 0.53f : 0.21f;\n\t\t\telse\n\t\t\t\tcD = v < 60.f ? -0.0084f * v + 0.73f : 0.22f;\n\t\t\tdragForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f)\n\t\t\t\tdragForce = -0.5f * 1.23f * area * cD * u * u * eU;\n\t\t}\n\t\t\/\/ Calculate gravitational force.\n\t\tglm::vec3 gravitationForce = glm::vec3(0.f, mass * -9.82f, 0.f);\n\t\t\/\/ Get acceleration from total force.\n\t\tglm::vec3 acceleration = (dragForce + magnusForce + gravitationForce) \/ mass;\n\t\tvelocity += acceleration * static_cast<float>(time);\n\n\t}\n}\n\nvoid GolfBall::Render(Camera* camera, const glm::vec2& screenSize, const glm::vec4& clippingPlane) const{\n    if (state != GolfBall::EXPLODED && state != GolfBall::OUT)\n        ModelObject::Render(camera, screenSize, clippingPlane);\n}\n\nvoid GolfBall::Explode(std::vector<PlayerObject>& players){\n    \/\/@TODO: Set mass equivalent depending on material used.\n    float equivalenceFactor = 1.0f;\n    float massEquivalent = mass*equivalenceFactor;\n    for (auto &player : players){\n        glm::vec3 distanceV = (Position() - player.Position());\n        float distance = glm::length(distanceV); \n        \/\/pow(meq, 1.f\/3.f) => cube root of meq\n        float z = distance \/ (pow(massEquivalent, 1.f \/ 3.f));\n        float alpha = 1 + pow((z \/ 4.5f), 2.f);\n        float beta = 1 + pow((z \/ 0.048f), 2.f);\n        float gamma = 1 + pow((z \/ 1.35f), 2.f);\n        float delta = 1 + pow((z \/ 0.32f), 2.f);\n        \/\/float Pf = 8.08f*pow(10.f, 7.f)*alpha;\n\t\tfloat Pf = ((8.08e7)*alpha) \/ sqrt(beta*gamma*delta);\n        player.TakeDamage(Pf);\n    }\n    state = GolfBall::EXPLODED;\n}\n\nvoid GolfBall::Strike(ClubType club, const glm::vec3& clubVelocity) {\n    state = GolfBall::ACTIVE;\n    \n    \/\/ Club velocity in strike plane.\n    float v = glm::length(clubVelocity);\n    if (v > 0.f)\n    {\n        float sinLoft = sin(club.loft);\n        float cosLoft = cos(club.loft);\n        \n        \/\/ Ball velocity.\n        float massCoefficient = club.mass \/ (club.mass + mass);\n        float Up = (1.f + restitution) * massCoefficient * v * cosLoft;\n        float Un = (2.f \/ 7.f) * massCoefficient * v * sinLoft;\n        \n        \/\/ Go back from strike plane to 3D.\n        glm::vec3 forward = clubVelocity \/ v;\n        glm::vec3 up = glm::cross(forward, glm::cross(glm::vec3(0.f, 1.f, 0.f), forward));\n        glm::vec3 ep = glm::normalize(cosLoft * forward + sinLoft * up);\n        glm::vec3 en = glm::normalize(sinLoft * forward - cosLoft * up);\n        \n        \/\/ Total velocity.\n        velocity = Up * ep + Un * en;\n        angularVelocity = -Un \/ sphere.radius * glm::cross(ep, en);\n    } else {\n        velocity = glm::vec3(0.f, 0.f, 0.f);\n        angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    }\n}\n\nfloat GolfBall::Radius() const {\n    return sphere.radius;\n}\n\nvoid GolfBall::SetRadius(float radius) {\n    sphere.radius = radius;\n    SetScale(glm::vec3(radius, radius, radius));\n    area = glm::pi<float>() * radius * radius;\n}\n\nglm::mat4 GolfBall::Orientation() const {\n    return glm::toMat4(orientation);\n}\n\nGolfBall::State GolfBall::GetState() const {\n    return state;\n}\n<commit_msg>More work on friction<commit_after>#include \"GolfBall.hpp\"\n#include \"..\/Resources.hpp\"\n#include \"Default3D.vert.hpp\"\n#include \"Default3D.geom.hpp\"\n#include \"Default3D.frag.hpp\"\n#include \"glm\/gtc\/constants.hpp\"\n#include \"..\/Util\/Log.hpp\"\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/quaternion.hpp>\n\nGolfBall::GolfBall(BallType ballType, TerrainObject* terrain, Water* water) : ModelObject(modelGeometry = Resources().CreateOBJModel(\"Resources\/Models\/GolfBall\/GolfBall.obj\"),\n                                                                            \"Resources\/Models\/GolfBall\/Diffuse.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Normal.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Specular.png\") {\n    state = GolfBall::INITIAL;\n    \n    restitution = ballType == TWOPIECE ? 0.78f : 0.68f;\n    this->terrain = terrain;\n    this->water = water;\n    origin = glm::vec3(1.f, 0.f, 1.f);\n    \n    mass = 0.0459f;\n    this->ballType = ballType;\n    \n    sphere.position = Position();\n    SetRadius(0.0214f);\n}\n\nGolfBall::~GolfBall() {\n    Resources().FreeOBJModel(modelGeometry);\n}\n\nvoid GolfBall::Reset(){\n    state = GolfBall::INITIAL;\n    velocity = glm::vec3(0.f, 0.f, 0.f);\n    angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    SetPosition(origin);\n    sphere.position = Position();\n    orientation = glm::quat();\n}\n\nvoid GolfBall::Update(double time, const glm::vec3& wind, std::vector<PlayerObject>& players) {\n\tif (state == GolfBall::ACTIVE) {\n\t\tMove(static_cast<float>(time)* velocity);\n\t\tsphere.position = Position();\n\n\t\tif (glm::length(angularVelocity) > 0.0001f) {\n\t\t\tglm::quat deltaQuat = glm::angleAxis(static_cast<float>(time)* glm::length(angularVelocity), glm::normalize(angularVelocity));\n\t\t\torientation = deltaQuat * orientation;\n\t\t}\n\n\t\tglm::vec3 dragForce, magnusForce = glm::vec3(0.f, 0.f, 0.f);\n\n\t\tfloat groundLevel = terrain->GetY(Position().x, Position().z);\n        float waterLevel = water->Position().y;\n        \n        \/\/ Check if in water.\n        if ((sphere.position.y - sphere.radius < groundLevel && groundLevel + sphere.radius < waterLevel) || sphere.position.y + sphere.radius < waterLevel) {\n            state = GolfBall::OUT;\n            return;\n        }\n        \n        \/\/ Check for collision\n\t\tif (glm::length(velocity) > 0.0001f && (sphere.position.y - sphere.radius) < groundLevel){\n\t\t\tfloat vCritical = 0.3f;\n\t\t\tfloat e = 0.35f;\n\t\t\tfloat muSliding = 0.51f;\n\t\t\tfloat muRolling = 0.096f;\n\t\t\tSetPosition(Position().x, groundLevel + sphere.radius, Position().z);\n\t\t\tsphere.position = Position();\n\t\t\t\/\/glm::vec3 eRoh = glm::normalize(glm::vec3(0.f, 1.f, 0.f));\n\t\t\tglm::vec3 eRoh = terrain->GetNormal(Position().x, Position().z);\n\t\t\tglm::vec3 tangentialVelocity = velocity - glm::dot(velocity, eRoh) * eRoh;\n\t\t\tglm::vec3 eFriction = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (glm::length(glm::cross(eRoh, angularVelocity) + tangentialVelocity) > 0.0001f){\n\t\t\t\teFriction = glm::normalize(sphere.radius * glm::cross(eRoh, angularVelocity) + tangentialVelocity);\n\t\t\t}\n\t\t\tfloat vRoh = glm::dot(velocity, eRoh);\n\t\t\tfloat deltaU = -(e + 1.f) * vRoh;\n\t\t\tglm::vec3 angularDirection = glm::cross(eRoh, glm::normalize(tangentialVelocity));\n\t\t\tfloat w = glm::dot(angularVelocity, angularDirection);\n\n\t\t\tif (fabs(vRoh) < vCritical && glm::length(tangentialVelocity) > 0.0001f) {\n\t\t\t\tglm::vec3 mg = (9.82f)*glm::vec3(0.f, -1.f, 0.f);\n\t\t\t\tglm::vec3 tangentialGravityAcceleration = glm::dot(mg, eRoh)*eRoh;\n\t\t\t\tglm::vec3 tangentialSlidingFrictionDeceleration = muSliding*eFriction;\n\t\t\t\tglm::vec3 tangentialRollingFrictionDeceleration = muRolling*eFriction;\n\t\t\t\tglm::vec3 tangentialDelta = tangentialVelocity + (tangentialGravityAcceleration - tangentialSlidingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\tif (w * sphere.radius + 0.0001f < glm::length(tangentialVelocity)) {\n\t\t\t\t\t\/\/Rolling\n\t\t\t\t\tvelocity = tangentialVelocity + (tangentialGravityAcceleration - tangentialRollingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\t\tangularVelocity = (glm::length(velocity) \/ sphere.radius) * cross(eRoh,eFriction);\n\t\t\t\t} else {\n\t\t\t\t\t\/\/Sliding\n\t\t\t\t\tvelocity = tangentialVelocity + (tangentialGravityAcceleration - tangentialSlidingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\t\tangularVelocity += (5.f \/ 2.f) * (muSliding * 9.82f \/ sphere.radius * static_cast<float>(time)) * cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfloat deltaTime = pow(mass * mass \/ (fabs(vRoh) * sphere.radius), 0.2f) * 0.00251744f;\n\t\t\t\tfloat velocityRoh = glm::dot(velocity, eRoh);\n\t\t\t\tfloat velocityNormal = glm::dot(velocity, eFriction);\n\t\t\t\tfloat uRoh = -e*velocityRoh;\n\t\t\t\tfloat deltauRoh = uRoh - (velocityRoh);\n\t\t\t\tfloat deltaUn = muSliding*deltauRoh;\n\t\t\t\tfloat rollUn = (5.f \/ 7.f)*velocityNormal;\n\t\t\t\tfloat slideUn = velocityNormal - deltaUn;\n\n\t\t\t\tif (velocityNormal > rollUn){\n\t\t\t\t\tvelocity = uRoh*eRoh + rollUn*eFriction;\n\t\t\t\t\tangularVelocity += muRolling * (deltaU + 9.82f*eRoh.y * deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t} else {\n\t\t\t\t\tvelocity = uRoh*eRoh + slideUn*eFriction;\n\t\t\t\t\tangularVelocity += muSliding * (deltaU + 9.82f *eRoh.y* deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\t\/\/ Calculate magnus force.\n\t\t\tfloat v = glm::length(velocity);\n\t\t\tfloat u = glm::length(velocity - wind);\n\t\t\tfloat w = glm::length(angularVelocity);\n\t\t\tglm::vec3 eU = (velocity - wind) \/ u;\n\t\t\tmagnusForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f && v > 0.f && w > 0.f) {\n\t\t\t\tfloat Cm = (sqrt(1.f + 0.31f * (w \/ v)) - 1.f) \/ 20.f;\n\t\t\t\tfloat Fm = 0.5f * Cm * 1.23f * area * u * u;\n\t\t\t\tmagnusForce = Fm * glm::cross(eU, glm::normalize(angularVelocity));\n\t\t\t}\n\n\t\t\t\/\/ Calculate drag force.\n\t\t\tfloat cD;\n\t\t\tif (ballType == TWOPIECE)\n\t\t\t\tcD = v < 65.f ? -0.0051f * v + 0.53f : 0.21f;\n\t\t\telse\n\t\t\t\tcD = v < 60.f ? -0.0084f * v + 0.73f : 0.22f;\n\t\t\tdragForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f)\n\t\t\t\tdragForce = -0.5f * 1.23f * area * cD * u * u * eU;\n\t\t}\n\t\t\/\/ Calculate gravitational force.\n\t\tglm::vec3 gravitationForce = glm::vec3(0.f, mass * -9.82f, 0.f);\n\t\t\/\/ Get acceleration from total force.\n\t\tglm::vec3 acceleration = (dragForce + magnusForce + gravitationForce) \/ mass;\n\t\tvelocity += acceleration * static_cast<float>(time);\n\n\t}\n}\n\nvoid GolfBall::Render(Camera* camera, const glm::vec2& screenSize, const glm::vec4& clippingPlane) const{\n    if (state != GolfBall::EXPLODED && state != GolfBall::OUT)\n        ModelObject::Render(camera, screenSize, clippingPlane);\n}\n\nvoid GolfBall::Explode(std::vector<PlayerObject>& players){\n    \/\/@TODO: Set mass equivalent depending on material used.\n    float equivalenceFactor = 1.0f;\n    float massEquivalent = mass*equivalenceFactor;\n    for (auto &player : players){\n        glm::vec3 distanceV = (Position() - player.Position());\n        float distance = glm::length(distanceV); \n        \/\/pow(meq, 1.f\/3.f) => cube root of meq\n        float z = distance \/ (pow(massEquivalent, 1.f \/ 3.f));\n        float alpha = 1 + pow((z \/ 4.5f), 2.f);\n        float beta = 1 + pow((z \/ 0.048f), 2.f);\n        float gamma = 1 + pow((z \/ 1.35f), 2.f);\n        float delta = 1 + pow((z \/ 0.32f), 2.f);\n        \/\/float Pf = 8.08f*pow(10.f, 7.f)*alpha;\n\t\tfloat Pf = ((8.08e7)*alpha) \/ sqrt(beta*gamma*delta);\n        player.TakeDamage(Pf);\n    }\n    state = GolfBall::EXPLODED;\n}\n\nvoid GolfBall::Strike(ClubType club, const glm::vec3& clubVelocity) {\n    state = GolfBall::ACTIVE;\n    \n    \/\/ Club velocity in strike plane.\n    float v = glm::length(clubVelocity);\n    if (v > 0.f)\n    {\n        float sinLoft = sin(club.loft);\n        float cosLoft = cos(club.loft);\n        \n        \/\/ Ball velocity.\n        float massCoefficient = club.mass \/ (club.mass + mass);\n        float Up = (1.f + restitution) * massCoefficient * v * cosLoft;\n        float Un = (2.f \/ 7.f) * massCoefficient * v * sinLoft;\n        \n        \/\/ Go back from strike plane to 3D.\n        glm::vec3 forward = clubVelocity \/ v;\n        glm::vec3 up = glm::cross(forward, glm::cross(glm::vec3(0.f, 1.f, 0.f), forward));\n        glm::vec3 ep = glm::normalize(cosLoft * forward + sinLoft * up);\n        glm::vec3 en = glm::normalize(sinLoft * forward - cosLoft * up);\n        \n        \/\/ Total velocity.\n        velocity = Up * ep + Un * en;\n        angularVelocity = -Un \/ sphere.radius * glm::cross(ep, en);\n    } else {\n        velocity = glm::vec3(0.f, 0.f, 0.f);\n        angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    }\n}\n\nfloat GolfBall::Radius() const {\n    return sphere.radius;\n}\n\nvoid GolfBall::SetRadius(float radius) {\n    sphere.radius = radius;\n    SetScale(glm::vec3(radius, radius, radius));\n    area = glm::pi<float>() * radius * radius;\n}\n\nglm::mat4 GolfBall::Orientation() const {\n    return glm::toMat4(orientation);\n}\n\nGolfBall::State GolfBall::GetState() const {\n    return state;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iomanip>\n\n#include \"battleship.hpp\"\n\n\nconst char  HIT = 'h',\n            MISS = 'm',\n            EMPTY = ' ',\n            HORIZONTAL = 'H',\n            VERTICAL = 'V';\n\nconst int HITCHANCENORMAL = 20;\nconst int HITCHANCEHARD = 30;\nconst int HITCHANCEEXTREME = 40;\n\nbool debug = false;\n\nconst pair<string, int> SHIPTYPES[] =\n{\n    \/\/ Pairing ship names with lengths\n    pair<string, int>(\"Carrier\", 5),\n    pair<string, int>(\"Battleship\", 4),\n    pair<string, int>(\"Cruiser\", 3),\n    pair<string, int>(\"Submarine\", 3),\n    pair<string, int>(\"Destroyer\", 2)\n};\n\nconst string title = \"  ██████╗  █████╗ ████████╗████████╗██╗     ███████╗███████╗██╗  ██╗██╗██████╗ \\n  ██╔══██╗██╔══██╗╚══██╔══╝╚══██╔══╝██║     ██╔════╝██╔════╝██║  ██║██║██╔══██╗\\n  ██████╔╝███████║   ██║      ██║   ██║     █████╗  ███████╗███████║██║██████╔╝\\n  ██╔══██╗██╔══██║   ██║      ██║   ██║     ██╔══╝  ╚════██║██╔══██║██║██╔═══╝ \\n  ██████╔╝██║  ██║   ██║      ██║   ███████╗███████╗███████║██║  ██║██║██║     \\n  ╚═════╝ ╚═╝  ╚═╝   ╚═╝      ╚═╝   ╚══════╝╚══════╝╚══════╝╚═╝  ╚═╝╚═╝╚═╝     \\n                                                                               \\n\";\n\nint getMenuChoice(int numChoices, string message)\n{\n    int choice; \/\/ Holds user's choice\n    bool valid = false;\n    \n    cout << message;\n    \n    do\n    {\n        \/\/ Keep asking for choice until a valid choice is made\n        cout << \"\\n> \";\n        \n        if (cin >> choice)\n        {\n            if (choice >= 1 && choice <= numChoices)\n            {\n                valid = true; \/\/ If the input is an int and within the limit, it's\n                \/\/ valid\n            }\n        }\n        \n        cin.clear();\n        cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n        \n        if (!valid)\n        {\n            cout << \"\\nPlease select a choice from the menu.\";\n        }\n        \n    } while (!valid);\n    \n    return choice;\n}\n\nstring getStringInput()\n{\n    \/\/ Returns a string given by user\n    string input;\n    getline(cin, input);\n    return input;\n}\n\nstring toLowercase(string s)\n{\n    \/\/ Converts all uppercase letters in a string to lowercase letters\n    for (auto c : s)\n    {\n        c = tolower(c);\n    }\n    \n    return s;\n}\n\nvoid clearScreen()\n{\n    \/\/ Outputs a bunch of newlines, effectively \"clearing\" the screen\n    int count = 500;\n    \n    if (debug)\n    {\n        count = 5;\n    }\n    \n    while (count > 0)\n    {\n        cout << endl;\n        count--;\n    }\n}\n\nint getShipLengthFromName(string name)\n{\n    \/\/ We try to match the name given to our ship to a ship in our SHIPS array\n    \/\/ so we can set our ship to the desired length.\n    bool validName = false;\n    int length = 0;\n    \n    for (auto ship : SHIPTYPES)\n    {\n        if (ship.first == name)\n        {\n            length = ship.second;\n            validName = true;\n        }\n    }\n    \n    \/\/ If the name given doesn't match up to anything, that's bad, m'kay.\n    if (!validName)\n    {\n        throw ExceptionInvalidShipName();\n    }\n    \n    return length;\n}\n\nvoid displayTitle()\n{\n    if (!debug)\n    {\n        clearScreen();\n        cout << title;\n        cout << std::setw(44) << \"Cody Kelly\" << endl;\n        cout << std::setw(43) << \"© 2017\" << endl << endl;\n        cout << \"Press enter to continue.\\n\\n\";\n        cin.get();\n    }\n}\n\nstd::ostream& operator<< (std::ostream& os, const Coordinate c)\n{\n    os << char(c.x + 'A') << c.y + 1;\n    \n    return os;\n}\n<commit_msg>Added <limits><commit_after>#include <iomanip>\n#include <limits>\n\n#include \"battleship.hpp\"\n\n\nconst char  HIT = 'h',\n            MISS = 'm',\n            EMPTY = ' ',\n            HORIZONTAL = 'H',\n            VERTICAL = 'V';\n\nconst int HITCHANCENORMAL = 20;\nconst int HITCHANCEHARD = 30;\nconst int HITCHANCEEXTREME = 40;\n\nbool debug = false;\n\nconst pair<string, int> SHIPTYPES[] =\n{\n    \/\/ Pairing ship names with lengths\n    pair<string, int>(\"Carrier\", 5),\n    pair<string, int>(\"Battleship\", 4),\n    pair<string, int>(\"Cruiser\", 3),\n    pair<string, int>(\"Submarine\", 3),\n    pair<string, int>(\"Destroyer\", 2)\n};\n\nconst string title = \"  ██████╗  █████╗ ████████╗████████╗██╗     ███████╗███████╗██╗  ██╗██╗██████╗ \\n  ██╔══██╗██╔══██╗╚══██╔══╝╚══██╔══╝██║     ██╔════╝██╔════╝██║  ██║██║██╔══██╗\\n  ██████╔╝███████║   ██║      ██║   ██║     █████╗  ███████╗███████║██║██████╔╝\\n  ██╔══██╗██╔══██║   ██║      ██║   ██║     ██╔══╝  ╚════██║██╔══██║██║██╔═══╝ \\n  ██████╔╝██║  ██║   ██║      ██║   ███████╗███████╗███████║██║  ██║██║██║     \\n  ╚═════╝ ╚═╝  ╚═╝   ╚═╝      ╚═╝   ╚══════╝╚══════╝╚══════╝╚═╝  ╚═╝╚═╝╚═╝     \\n                                                                               \\n\";\n\nint getMenuChoice(int numChoices, string message)\n{\n    int choice; \/\/ Holds user's choice\n    bool valid = false;\n    \n    cout << message;\n    \n    do\n    {\n        \/\/ Keep asking for choice until a valid choice is made\n        cout << \"\\n> \";\n        \n        if (cin >> choice)\n        {\n            if (choice >= 1 && choice <= numChoices)\n            {\n                valid = true; \/\/ If the input is an int and within the limit, it's\n                \/\/ valid\n            }\n        }\n        \n        cin.clear();\n        cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n        \n        if (!valid)\n        {\n            cout << \"\\nPlease select a choice from the menu.\";\n        }\n        \n    } while (!valid);\n    \n    return choice;\n}\n\nstring getStringInput()\n{\n    \/\/ Returns a string given by user\n    string input;\n    getline(cin, input);\n    return input;\n}\n\nstring toLowercase(string s)\n{\n    \/\/ Converts all uppercase letters in a string to lowercase letters\n    for (auto c : s)\n    {\n        c = tolower(c);\n    }\n    \n    return s;\n}\n\nvoid clearScreen()\n{\n    \/\/ Outputs a bunch of newlines, effectively \"clearing\" the screen\n    int count = 500;\n    \n    if (debug)\n    {\n        count = 5;\n    }\n    \n    while (count > 0)\n    {\n        cout << endl;\n        count--;\n    }\n}\n\nint getShipLengthFromName(string name)\n{\n    \/\/ We try to match the name given to our ship to a ship in our SHIPS array\n    \/\/ so we can set our ship to the desired length.\n    bool validName = false;\n    int length = 0;\n    \n    for (auto ship : SHIPTYPES)\n    {\n        if (ship.first == name)\n        {\n            length = ship.second;\n            validName = true;\n        }\n    }\n    \n    \/\/ If the name given doesn't match up to anything, that's bad, m'kay.\n    if (!validName)\n    {\n        throw ExceptionInvalidShipName();\n    }\n    \n    return length;\n}\n\nvoid displayTitle()\n{\n    if (!debug)\n    {\n        clearScreen();\n        cout << title;\n        cout << std::setw(44) << \"Cody Kelly\" << endl;\n        cout << std::setw(43) << \"© 2017\" << endl << endl;\n        cout << \"Press enter to continue.\\n\\n\";\n        cin.get();\n    }\n}\n\nstd::ostream& operator<< (std::ostream& os, const Coordinate c)\n{\n    os << char(c.x + 'A') << c.y + 1;\n    \n    return os;\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#ifndef DBN_UNIT_TYPE_HPP\n#define DBN_UNIT_TYPE_HPP\n\nnamespace dll {\n\nenum class unit_type {\n    BINARY,    \/\/Stochastic binary unity\n    EXP,        \/\/Exponential unit (for last layer)\n    SOFTMAX,    \/\/Softmax unit (for last layer)\n    GAUSSIAN,   \/\/Gaussian visible layers\n    RELU        \/\/Noisy Rectified Linear Unit (nRLU)\n};\n\n} \/\/end of dbn namespace\n\n#endif<commit_msg>Prepare support for new RELU unit<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#ifndef DBN_UNIT_TYPE_HPP\n#define DBN_UNIT_TYPE_HPP\n\nnamespace dll {\n\nenum class unit_type {\n    BINARY,     \/\/Stochastic binary unity\n    EXP,        \/\/Exponential unit (for last layer)\n    SOFTMAX,    \/\/Softmax unit (for last layer)\n    GAUSSIAN,   \/\/Gaussian unit\n    RELU,       \/\/Rectified Linear Unit (ReLU) (Nair and Hinton, 2010)\n    RELU1,      \/\/Rectified Linear Unit (ReLU) capped at 1 (Krizhevsky, 2010)\n    RELU6,      \/\/Rectified Linear Unit (ReLU) capped at 6 (Krizhevsky,. 2010)\n};\n\nconstexpr bool is_relu(unit_type t){\n    return t == unit_type::RELU || t == unit_type::RELU1 || t == unit_type::RELU6;\n}\n\n} \/\/end of dbn namespace\n\n#endif<|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#ifndef ETL_FAST_EXPR_HPP\n#define ETL_FAST_EXPR_HPP\n\n#include \"fast_op.hpp\"\n#include \"tmp.hpp\"\n\nnamespace etl {\n\ntemplate<typename LE, typename RE, typename Enable = void>\nstruct get_etl_size ;\n\ntemplate<typename LE, typename RE>\nstruct get_etl_size<LE, RE, enable_if_t<is_etl_expr<LE>::value>> \n    : std::integral_constant<std::size_t, std::remove_reference<LE>::type::etl_size> {} ;\n\ntemplate<typename LE, typename RE>\nstruct get_etl_size<LE, RE, enable_if_t<and_u<is_etl_expr<RE>::value, not_u<is_etl_expr<LE>::value>::value>::value>> \n    : std::integral_constant<std::size_t, std::remove_reference<RE>::type::etl_size> {};\n\ntemplate <typename T, typename LeftExpr, typename BinaryOp, typename RightExpr>\nclass binary_expr {\nprivate:\n    LeftExpr _lhs;\n    RightExpr _rhs;\n\n    typedef binary_expr<T, LeftExpr, BinaryOp, RightExpr> this_type;\n\npublic:\n    static constexpr const bool etl_marker = true;\n    static constexpr const bool etl_fast = true;\n    static constexpr const std::size_t etl_size = get_etl_size<LeftExpr, RightExpr>::value;\n\n    using value_type = T;\n\n    \/\/Cannot be constructed with no args\n    binary_expr() = delete;\n\n    \/\/Construct a new expression\n    binary_expr(LeftExpr l, RightExpr r) :\n            _lhs(std::forward<LeftExpr>(l)), _rhs(std::forward<RightExpr>(r)){\n        \/\/Nothing else to init\n    }\n\n    \/\/No copying\n    binary_expr(const binary_expr&) = delete;\n    binary_expr& operator=(const binary_expr&) = delete;\n\n    \/\/Make sure move is supported\n    binary_expr(binary_expr&&) = default;\n    binary_expr& operator=(binary_expr&&) = default;\n\n    \/\/Accessors\n\n    \/\/TODO size() can be constexpr if Expr is fast_X\n\n    template<typename LE = LeftExpr, enable_if_u<is_etl_expr<LE>::value> = detail::dummy>\n    std::size_t size() const {\n        return _lhs.size();\n    }\n\n    template<typename LE = LeftExpr, disable_if_u<is_etl_expr<LE>::value> = detail::dummy>\n    std::size_t size() const {\n        return _rhs.size();\n    }\n\n    typename std::add_lvalue_reference<LeftExpr>::type lhs(){\n        return _lhs;\n    }\n\n    typename std::add_lvalue_reference<typename std::add_const<LeftExpr>::type>::type lhs() const {\n        return _lhs;\n    }\n\n    typename std::add_lvalue_reference<RightExpr>::type rhs(){\n        return _rhs;\n    }\n\n    typename std::add_lvalue_reference<typename std::add_const<RightExpr>::type>::type rhs() const {\n        return _rhs;\n    }\n\n    \/\/Apply the expression\n\n    decltype(auto) operator[](std::size_t i) const {\n        return BinaryOp::apply(lhs()[i], rhs()[i]);\n    }\n};\n\ntemplate <typename T, typename Expr, typename UnaryOp>\nclass unary_expr {\nprivate:\n    Expr _value;\n\n    typedef unary_expr<T, Expr, UnaryOp> this_type;\n\npublic:\n    static constexpr const bool etl_marker = true;\n    static constexpr const bool etl_fast = true;\n    static constexpr const std::size_t etl_size = std::remove_reference<Expr>::type::etl_size;\n\n    using value_type = T;\n\n    \/\/Cannot be constructed with no args\n    unary_expr() = delete;\n\n    \/\/Construct a new expression\n    unary_expr(Expr l) : _value(std::forward<Expr>(l)){\n        \/\/Nothing else to init\n    }\n\n    \/\/No copying\n    unary_expr(const unary_expr&) = delete;\n    unary_expr& operator=(const unary_expr&) = delete;\n\n    \/\/Make sure move is supported\n    unary_expr(unary_expr&&) = default;\n    unary_expr& operator=(unary_expr&&) = default;\n\n    \/\/Accessors\n\n    \/\/TODO size() can be constexpr if Expr is fast_X\n\n    std::size_t size() const {\n        return _value.size();\n    }\n\n    typename std::add_lvalue_reference<Expr>::type value(){\n        return _value;\n    }\n\n    typename std::add_lvalue_reference<typename std::add_const<Expr>::type>::type value() const {\n        return _value;\n    }\n\n    \/\/Apply the expression\n\n    decltype(auto) operator[](std::size_t i) const {\n        return UnaryOp::apply(value()[i]);\n    }\n};\n\n\/\/{{{ Build binary expressions from two ETL expressions (vector,matrix,binary,unary)\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator-(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, minus_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator+(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, plus_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator*(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, mul_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator\/(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, div_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator%(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, mod_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\n\/\/}}}\n\n\/\/{{{ Mix scalars and ETL expressions (vector,matrix,binary,unary)\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator-(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, minus_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator-(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, minus_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator+(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, plus_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator+(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, plus_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator*(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, mul_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator*(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, mul_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator\/(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, div_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator\/(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, div_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator%(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, mod_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator%(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, mod_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\n\/\/}}}\n\n\/\/{{{ Apply an unary expression on an ETL expression (vector,matrix,binary,unary)\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\nauto abs(const E& value) -> unary_expr<typename E::value_type, const E&, abs_unary_op<typename E::value_type>> {\n    return {value};\n}\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\nauto log(const E& value) -> unary_expr<typename E::value_type, const E&, log_unary_op<typename E::value_type>> {\n    return {value};\n}\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\nauto sign(const E& value) -> unary_expr<typename E::value_type, const E&, sign_unary_op<typename E::value_type>> {\n    return {value};\n}\n\n\/\/}}}\n\n\/\/{{{ Apply a reduction on an ETL expression (vector,matrix,binary,unary)\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\ntypename E::value_type sum(const E& values){\n    auto acc = static_cast<typename E::value_type>(0);\n\n    for(std::size_t i = 0; i < values.size(); ++i){\n        acc += values[i];\n    }\n\n    return acc;\n}\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\ntypename E::value_type mean(const E& values){\n    return sum(values) \/ values.size();\n}\n\n\/\/}}}\n\n} \/\/end of namespace etl\n\n#endif\n<commit_msg>Cleanup size stuff<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#ifndef ETL_FAST_EXPR_HPP\n#define ETL_FAST_EXPR_HPP\n\n#include \"fast_op.hpp\"\n#include \"tmp.hpp\"\n\nnamespace etl {\n\ntemplate<typename LE, typename RE, typename Enable = void>\nstruct get_etl_size ;\n\ntemplate<typename LE, typename RE>\nstruct get_etl_size<LE, RE, enable_if_t<is_etl_expr<LE>::value>> \n    : std::integral_constant<std::size_t, std::remove_reference<LE>::type::etl_size> {} ;\n\ntemplate<typename LE, typename RE>\nstruct get_etl_size<LE, RE, enable_if_t<and_u<is_etl_expr<RE>::value, not_u<is_etl_expr<LE>::value>::value>::value>> \n    : std::integral_constant<std::size_t, std::remove_reference<RE>::type::etl_size> {};\n\ntemplate <typename T, typename LeftExpr, typename BinaryOp, typename RightExpr>\nclass binary_expr {\nprivate:\n    static_assert(or_u<is_etl_expr<LeftExpr>::value, is_etl_expr<RightExpr>::value>::value, \"At least one of the binary expressions arguments must be an ETL expr\");\n\n    LeftExpr _lhs;\n    RightExpr _rhs;\n\n    typedef binary_expr<T, LeftExpr, BinaryOp, RightExpr> this_type;\n\npublic:\n    static constexpr const bool etl_marker = true;\n    static constexpr const bool etl_fast = true;\n    static constexpr const std::size_t etl_size = get_etl_size<LeftExpr, RightExpr>::value;\n\n    using value_type = T;\n\n    \/\/Cannot be constructed with no args\n    binary_expr() = delete;\n\n    \/\/Construct a new expression\n    binary_expr(LeftExpr l, RightExpr r) :\n            _lhs(std::forward<LeftExpr>(l)), _rhs(std::forward<RightExpr>(r)){\n        \/\/Nothing else to init\n    }\n\n    \/\/No copying\n    binary_expr(const binary_expr&) = delete;\n    binary_expr& operator=(const binary_expr&) = delete;\n\n    \/\/Make sure move is supported\n    binary_expr(binary_expr&&) = default;\n    binary_expr& operator=(binary_expr&&) = default;\n\n    \/\/Accessors\n\n    \/\/TODO size() can be constexpr if Expr is fast_X\n\n    template<typename LE = LeftExpr, enable_if_u<is_etl_expr<LE>::value> = detail::dummy>\n    std::size_t size() const {\n        return _lhs.size();\n    }\n\n    template<typename LE = LeftExpr, disable_if_u<is_etl_expr<LE>::value> = detail::dummy>\n    std::size_t size() const {\n        return _rhs.size();\n    }\n\n    typename std::add_lvalue_reference<LeftExpr>::type lhs(){\n        return _lhs;\n    }\n\n    typename std::add_lvalue_reference<typename std::add_const<LeftExpr>::type>::type lhs() const {\n        return _lhs;\n    }\n\n    typename std::add_lvalue_reference<RightExpr>::type rhs(){\n        return _rhs;\n    }\n\n    typename std::add_lvalue_reference<typename std::add_const<RightExpr>::type>::type rhs() const {\n        return _rhs;\n    }\n\n    \/\/Apply the expression\n\n    decltype(auto) operator[](std::size_t i) const {\n        return BinaryOp::apply(lhs()[i], rhs()[i]);\n    }\n};\n\ntemplate <typename T, typename Expr, typename UnaryOp>\nclass unary_expr {\nprivate:\n    static_assert(is_etl_expr<Expr>::value, \"Only ETL expressions can be used in unary_expr\");\n\n    Expr _value;\n\n    typedef unary_expr<T, Expr, UnaryOp> this_type;\n\npublic:\n    static constexpr const bool etl_marker = true;\n    static constexpr const bool etl_fast = true;\n    static constexpr const std::size_t etl_size = std::remove_reference<Expr>::type::etl_size;\n\n    using value_type = T;\n\n    \/\/Cannot be constructed with no args\n    unary_expr() = delete;\n\n    \/\/Construct a new expression\n    unary_expr(Expr l) : _value(std::forward<Expr>(l)){\n        \/\/Nothing else to init\n    }\n\n    \/\/No copying\n    unary_expr(const unary_expr&) = delete;\n    unary_expr& operator=(const unary_expr&) = delete;\n\n    \/\/Make sure move is supported\n    unary_expr(unary_expr&&) = default;\n    unary_expr& operator=(unary_expr&&) = default;\n\n    \/\/Accessors\n\n    template<typename E = Expr, enable_if_u<std::remove_reference<E>::type::etl_fast> = detail::dummy>\n    constexpr std::size_t size() const {\n        return _value.size();\n    }\n    \n    template<typename E = Expr, disable_if_u<std::remove_reference<E>::type::etl_fast> = detail::dummy>\n    std::size_t size() const {\n        return _value.size();\n    }\n\n    typename std::add_lvalue_reference<Expr>::type value(){\n        return _value;\n    }\n\n    typename std::add_lvalue_reference<typename std::add_const<Expr>::type>::type value() const {\n        return _value;\n    }\n\n    \/\/Apply the expression\n\n    decltype(auto) operator[](std::size_t i) const {\n        return UnaryOp::apply(value()[i]);\n    }\n};\n\n\/\/{{{ Build binary expressions from two ETL expressions (vector,matrix,binary,unary)\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator-(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, minus_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator+(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, plus_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator*(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, mul_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator\/(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, div_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<is_etl_expr<LE>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator%(const LE& lhs, const RE& rhs) -> binary_expr<typename LE::value_type, const LE&, mod_binary_op<typename LE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\n\/\/}}}\n\n\/\/{{{ Mix scalars and ETL expressions (vector,matrix,binary,unary)\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator-(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, minus_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator-(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, minus_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator+(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, plus_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator+(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, plus_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator*(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, mul_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator*(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, mul_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator\/(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, div_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator\/(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, div_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<RE, typename LE::value_type>::value, is_etl_expr<LE>::value>::value> = detail::dummy>\nauto operator%(const LE& lhs, RE rhs) -> binary_expr<typename LE::value_type, const LE&, mod_binary_op<typename LE::value_type>, scalar<typename LE::value_type>> {\n    return {lhs, rhs};\n}\n\ntemplate<typename LE, typename RE, enable_if_u<and_u<std::is_convertible<LE, typename RE::value_type>::value, is_etl_expr<RE>::value>::value> = detail::dummy>\nauto operator%(LE lhs, const RE& rhs) -> binary_expr<typename RE::value_type, scalar<typename RE::value_type>, mod_binary_op<typename RE::value_type>, const RE&> {\n    return {lhs, rhs};\n}\n\n\/\/}}}\n\n\/\/{{{ Apply an unary expression on an ETL expression (vector,matrix,binary,unary)\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\nauto abs(const E& value) -> unary_expr<typename E::value_type, const E&, abs_unary_op<typename E::value_type>> {\n    return {value};\n}\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\nauto log(const E& value) -> unary_expr<typename E::value_type, const E&, log_unary_op<typename E::value_type>> {\n    return {value};\n}\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\nauto sign(const E& value) -> unary_expr<typename E::value_type, const E&, sign_unary_op<typename E::value_type>> {\n    return {value};\n}\n\n\/\/}}}\n\n\/\/{{{ Apply a reduction on an ETL expression (vector,matrix,binary,unary)\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\ntypename E::value_type sum(const E& values){\n    auto acc = static_cast<typename E::value_type>(0);\n\n    for(std::size_t i = 0; i < values.size(); ++i){\n        acc += values[i];\n    }\n\n    return acc;\n}\n\ntemplate<typename E, enable_if_u<is_etl_expr<E>::value> = detail::dummy>\ntypename E::value_type mean(const E& values){\n    return sum(values) \/ values.size();\n}\n\n\/\/}}}\n\n} \/\/end of namespace etl\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*      _______   __   __   __   ______   __   __   _______   __   __\n *     \/ _____\/\\ \/ \/\\ \/ \/\\ \/ \/\\ \/ ____\/\\ \/ \/\\ \/ \/\\ \/ ___  \/\\ \/  |\\\/ \/\\\n *    \/ \/\\____\\\/\/ \/ \/\/ \/ \/\/ \/ \/\/ \/\\___\\\/\/ \/_\/\/ \/ \/\/ \/\\_\/ \/ \/\/ , |\/ \/ \/\n *   \/ \/ \/__   \/ \/ \/\/ \/ \/\/ \/ \/\/ \/ \/    \/ ___  \/ \/\/ ___  \/ \/\/ \/| ' \/ \/\n *  \/ \/_\/\/ \/\\ \/ \/_\/\/ \/ \/\/ \/ \/\/ \/_\/_   \/ \/ \/\/ \/ \/\/ \/\\_\/ \/ \/\/ \/ |  \/ \/\n * \/______\/ \/\/______\/ \/\/_\/ \/\/_____\/\\ \/_\/ \/\/_\/ \/\/_\/ \/\/_\/ \/\/_\/ \/|_\/ \/\n * \\______\\\/ \\______\\\/ \\_\\\/ \\_____\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/\n *\n * Copyright (c) 2004, 2005, 2006, 2007 Olof Naessn and Per Larsson\n *\n *                                                         Js_.\/\n * Per Larsson a.k.a finalman                          _RqZ{a<^_aa\n * Olof Naessn a.k.a jansem\/yakslem                _asww7!uY`>  )\\a\/\/\n *                                                 _Qhm`] _f \"'c  1!5m\n * Visit: http:\/\/guichan.darkbits.org             )Qk<P ` _: :+' .'  \"{[\n *                                               .)j(] .d_\/ '-(  P .   S\n * License: (BSD)                                <Td\/Z <fP\"5(\\\"??\"\\a.  .L\n * Redistribution and use in source and          _dV>ws?a-?'      ._\/L  #'\n * binary forms, with or without                 )4d[#7r, .   '     )d`)[\n * modification, are permitted provided         _Q-5'5W..j\/?'   -?!\\)cam'\n * that the following conditions are met:       j<<WP+k\/);.        _W=j f\n * 1. Redistributions of source code must       .$%w\\\/]Q  . .\"'  .  mj$\n *    retain the above copyright notice,        ]E.pYY(Q]>.   a     J@\\\n *    this list of conditions and the           j(]1u<sE\"L,. .   .\/^ ]{a\n *    following disclaimer.                     4'_uomm\\.  )L);-4     (3=\n * 2. Redistributions in binary form must        )_]X{Z('a_\"a7'<a\"a,  ]\"[\n *    reproduce the above copyright notice,       #}<]m7`Za??4,P-\"'7. ).m\n *    this list of conditions and the            ]d2e)Q(<Q(  ?94   b-  LQ\/\n *    following disclaimer in the                <B!<\/]C)d_, '(<' .f. =C+m\n *    documentation and\/or other materials      .Z!=J ]e []('-4f _ ) -.)m]'\n *    provided with the distribution.          .w[5]' _[ \/.)_-\"+?   _\/ <W\"\n * 3. Neither the name of Guichan nor the      :$we` _! + _\/ .        j?\n *    names of its contributors may be used     =3)= _f  (_yQmWW$#(    \"\n *    to endorse or promote products derived     -   W,  sQQQQmZQ#Wwa]..\n *    from this software without specific        (js, \\[QQW$QWW#?!V\"\".\n *    prior written permission.                    ]y:.<\\..          .\n *                                                 -]n w\/ '         [.\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT       )\/ )\/           !\n * HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY         <  (; sac    ,    '\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING,               ]^ .-  %\n * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF            c <   r\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR            aga<  <La\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE          5%  )P'-3L\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR        _bQf` y`..)a\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,          ,J?4P'.P\"_(\\?d'.,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES               _Pa,)!f\/<[]\/  ?\"\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT      _2-..:. .r+_,.. .\n * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,     ?a.<%\"'  \" -'.a_ _,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION)                     ^\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifndef GCN_IMAGE_HPP\n#define GCN_IMAGE_HPP\n\n#include <string>\n\n#include \"guichan\/platform.hpp\"\n\nnamespace gcn\n{\n    class Color;\n    class ImageLoader;\n\n    \/**\n     * Holds an image. To be able to use this class you must first set an\n     * ImageLoader in Image by calling\n     * @code Image::setImageLoader(myImageLoader) @endcode\n     * The function is static. If this is not done, the constructor taking a\n     * filename will throw an exception. The ImageLoader you use must be\n     * compatible with the Graphics object you use.\n     *\n     * EXAMPLE: If you use SDLGraphics you should use SDLImageLoader.\n     *          Otherwise your program will crash in a most bizarre way.\n     *\/\n    class GCN_CORE_DECLSPEC Image\n    {\n    public:\n\n        \/**\n         * Constructor.\n         *\/\n        Image();\n\n        \/**\n         * Destructor.\n         *\/\n        virtual ~Image();\n\n        \/**\n         * Loads an image by calling the Image class' ImageLoader.\n         *\n         * NOTE: The functions getPixel and putPixel are only guaranteed to work\n         *       before an image has been converted to display format.\n         *\n         * @param filename the file to load.\n         * @param convertToDisplayFormat true if the image should be converted\n         *                               to display, false otherwise.\n         *\/\n        static Image* load(const std::string& filename, bool convertToDisplayFormat = true);\n\n        \/**\n         * Gets the ImageLoader used for loading Images.\n         *\n         * @return the ImageLoader used for loading Images.\n         * @see SDLImageLoader, AllegroImageLoader\n         *\/\n        static ImageLoader* getImageLoader();\n\n        \/**\n         * Sets the ImageLoader to be used for loading images.\n         *\n         * IMPORTANT: The ImageLoader is static and MUST be set before loading\n         *            images!\n         *\n         * @param imageLoader the ImageLoader to be used for loading images.\n         * @see SDLImageLoader, AllegroImageLoader\n         *\/\n        static void setImageLoader(ImageLoader* imageLoader);\n\n        \/**\n         * Frees an image.\n         *\/\n        virtual void free() = 0;\n\n        \/**\n         * Gets the width of the Image.\n         *\n         * @return the image width\n         *\/\n        virtual int getWidth() const = 0;\n\n        \/**\n         * Gets the height of the Image.\n         *\n         * @return the image height\n         *\/\n        virtual int getHeight() const = 0;\n\n        \/**\n         * Gets the color of a pixel at coordinate (x, y) in the image.\n         *\n         * IMPORTANT: Only guaranteed to work before the image has been\n         *            converted to display format.\n         *\n         * @param x the x coordinate.\n         * @param y the y coordinate.\n         * @return the color of the pixel.\n         *\/\n        virtual Color getPixel(int x, int y) = 0;\n\n        \/**\n         * Puts a pixel with a certain color at coordinate (x, y).\n         *\n         * @param x the x coordinate.\n         * @param y the y coordinate.\n         * @param color the color of the pixel to put.\n         *\/\n        virtual void putPixel(int x, int y, const Color& color) = 0;\n\n        \/**\n         * Converts the image, if possible, to display format.\n         *\n         * IMPORTANT: Only guaranteed to work before the image has been\n         *            converted to display format.\n         *\/\n        virtual void convertToDisplayFormat() = 0;\n\n    protected:\n        static ImageLoader* mImageLoader;\n    };\n}\n\n#endif \/\/ end GCN_IMAGE_HPP\n<commit_msg>Documentation has been improved.<commit_after>\/*      _______   __   __   __   ______   __   __   _______   __   __\n *     \/ _____\/\\ \/ \/\\ \/ \/\\ \/ \/\\ \/ ____\/\\ \/ \/\\ \/ \/\\ \/ ___  \/\\ \/  |\\\/ \/\\\n *    \/ \/\\____\\\/\/ \/ \/\/ \/ \/\/ \/ \/\/ \/\\___\\\/\/ \/_\/\/ \/ \/\/ \/\\_\/ \/ \/\/ , |\/ \/ \/\n *   \/ \/ \/__   \/ \/ \/\/ \/ \/\/ \/ \/\/ \/ \/    \/ ___  \/ \/\/ ___  \/ \/\/ \/| ' \/ \/\n *  \/ \/_\/\/ \/\\ \/ \/_\/\/ \/ \/\/ \/ \/\/ \/_\/_   \/ \/ \/\/ \/ \/\/ \/\\_\/ \/ \/\/ \/ |  \/ \/\n * \/______\/ \/\/______\/ \/\/_\/ \/\/_____\/\\ \/_\/ \/\/_\/ \/\/_\/ \/\/_\/ \/\/_\/ \/|_\/ \/\n * \\______\\\/ \\______\\\/ \\_\\\/ \\_____\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/\n *\n * Copyright (c) 2004, 2005, 2006, 2007 Olof Naessn and Per Larsson\n *\n *                                                         Js_.\/\n * Per Larsson a.k.a finalman                          _RqZ{a<^_aa\n * Olof Naessn a.k.a jansem\/yakslem                _asww7!uY`>  )\\a\/\/\n *                                                 _Qhm`] _f \"'c  1!5m\n * Visit: http:\/\/guichan.darkbits.org             )Qk<P ` _: :+' .'  \"{[\n *                                               .)j(] .d_\/ '-(  P .   S\n * License: (BSD)                                <Td\/Z <fP\"5(\\\"??\"\\a.  .L\n * Redistribution and use in source and          _dV>ws?a-?'      ._\/L  #'\n * binary forms, with or without                 )4d[#7r, .   '     )d`)[\n * modification, are permitted provided         _Q-5'5W..j\/?'   -?!\\)cam'\n * that the following conditions are met:       j<<WP+k\/);.        _W=j f\n * 1. Redistributions of source code must       .$%w\\\/]Q  . .\"'  .  mj$\n *    retain the above copyright notice,        ]E.pYY(Q]>.   a     J@\\\n *    this list of conditions and the           j(]1u<sE\"L,. .   .\/^ ]{a\n *    following disclaimer.                     4'_uomm\\.  )L);-4     (3=\n * 2. Redistributions in binary form must        )_]X{Z('a_\"a7'<a\"a,  ]\"[\n *    reproduce the above copyright notice,       #}<]m7`Za??4,P-\"'7. ).m\n *    this list of conditions and the            ]d2e)Q(<Q(  ?94   b-  LQ\/\n *    following disclaimer in the                <B!<\/]C)d_, '(<' .f. =C+m\n *    documentation and\/or other materials      .Z!=J ]e []('-4f _ ) -.)m]'\n *    provided with the distribution.          .w[5]' _[ \/.)_-\"+?   _\/ <W\"\n * 3. Neither the name of Guichan nor the      :$we` _! + _\/ .        j?\n *    names of its contributors may be used     =3)= _f  (_yQmWW$#(    \"\n *    to endorse or promote products derived     -   W,  sQQQQmZQ#Wwa]..\n *    from this software without specific        (js, \\[QQW$QWW#?!V\"\".\n *    prior written permission.                    ]y:.<\\..          .\n *                                                 -]n w\/ '         [.\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT       )\/ )\/           !\n * HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY         <  (; sac    ,    '\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING,               ]^ .-  %\n * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF            c <   r\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR            aga<  <La\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE          5%  )P'-3L\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR        _bQf` y`..)a\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,          ,J?4P'.P\"_(\\?d'.,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES               _Pa,)!f\/<[]\/  ?\"\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT      _2-..:. .r+_,.. .\n * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,     ?a.<%\"'  \" -'.a_ _,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION)                     ^\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifndef GCN_IMAGE_HPP\n#define GCN_IMAGE_HPP\n\n#include <string>\n\n#include \"guichan\/platform.hpp\"\n\nnamespace gcn\n{\n    class Color;\n    class ImageLoader;\n\n    \/**\n     * Holds an image. To be able to use this class you must first set an\n     * ImageLoader in Image by calling\n     * @code Image::setImageLoader(myImageLoader) @endcode\n     * The function is static. If this is not done, the constructor taking a\n     * filename will throw an exception. The ImageLoader you use must be\n     * compatible with the Graphics object you use.\n     *\n     * EXAMPLE: If you use SDLGraphics you should use SDLImageLoader.\n     *          Otherwise your program will crash in a most bizarre way.\n     *\/\n    class GCN_CORE_DECLSPEC Image\n    {\n    public:\n\n        \/**\n         * Constructor.\n         *\/\n        Image();\n\n        \/**\n         * Destructor.\n         *\/\n        virtual ~Image();\n\n        \/**\n         * Loads an image by calling the Image class' ImageLoader. With most image loaders\n         * you can assume a newly instantiated image is return which must be deleted in\n         * order to avoid a memory leak.\n         *\n         * NOTE: The functions getPixel and putPixel are only guaranteed to work\n         *       before an image has been converted to display format.\n         *\n         * @param filename the file to load.\n         * @param convertToDisplayFormat true if the image should be converted\n         *                               to display, false otherwise.\n         *\/\n        static Image* load(const std::string& filename, bool convertToDisplayFormat = true);\n\n        \/**\n         * Gets the ImageLoader used for loading Images.\n         *\n         * @return the ImageLoader used for loading Images.\n         * @see SDLImageLoader, AllegroImageLoader\n         *\/\n        static ImageLoader* getImageLoader();\n\n        \/**\n         * Sets the ImageLoader to be used for loading images.\n         *\n         * IMPORTANT: The ImageLoader is static and MUST be set before loading\n         *            images!\n         *\n         * @param imageLoader the ImageLoader to be used for loading images.\n         * @see SDLImageLoader, AllegroImageLoader\n         *\/\n        static void setImageLoader(ImageLoader* imageLoader);\n\n        \/**\n         * Frees an image.\n         *\/\n        virtual void free() = 0;\n\n        \/**\n         * Gets the width of the Image.\n         *\n         * @return the image width\n         *\/\n        virtual int getWidth() const = 0;\n\n        \/**\n         * Gets the height of the Image.\n         *\n         * @return the image height\n         *\/\n        virtual int getHeight() const = 0;\n\n        \/**\n         * Gets the color of a pixel at coordinate (x, y) in the image.\n         *\n         * IMPORTANT: Only guaranteed to work before the image has been\n         *            converted to display format.\n         *\n         * @param x the x coordinate.\n         * @param y the y coordinate.\n         * @return the color of the pixel.\n         *\/\n        virtual Color getPixel(int x, int y) = 0;\n\n        \/**\n         * Puts a pixel with a certain color at coordinate (x, y).\n         *\n         * @param x the x coordinate.\n         * @param y the y coordinate.\n         * @param color the color of the pixel to put.\n         *\/\n        virtual void putPixel(int x, int y, const Color& color) = 0;\n\n        \/**\n         * Converts the image, if possible, to display format.\n         *\n         * IMPORTANT: Only guaranteed to work before the image has been\n         *            converted to display format.\n         *\/\n        virtual void convertToDisplayFormat() = 0;\n\n    protected:\n        static ImageLoader* mImageLoader;\n    };\n}\n\n#endif \/\/ end GCN_IMAGE_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(dlogd)\n\/\/ Space: O(1)\n\nclass Solution {\npublic:\n    string findLongestWord(string s, vector<string>& d) {\n        sort(d.begin(), d.end(), \n             [](const string& a, const string&b) {\n                return a.length() != b.length() ? a.length() > b.length() : a < b;\n             });\n\n        for (const auto& word : d) {\n            int i = 0;\n            for (const auto& c : s) {\n                if (i < word.length() && word[i] == c) {\n                    ++i;\n                }\n            }\n            if (i == word.length()) {\n                return word;\n            }\n        }\n        return \"\";\n    }\n};\n<commit_msg>Update longest-word-in-dictionary-through-deleting.cpp<commit_after>\/\/ Time:  O((d * l) * logd), l is the average length of words\n\/\/ Space: O(1)\n\nclass Solution {\npublic:\n    string findLongestWord(string s, vector<string>& d) {\n        sort(d.begin(), d.end(), \n             [](const string& a, const string&b) {\n                return a.length() != b.length() ? a.length() > b.length() : a < b;\n             });\n\n        for (const auto& word : d) {\n            int i = 0;\n            for (const auto& c : s) {\n                if (i < word.length() && word[i] == c) {\n                    ++i;\n                }\n            }\n            if (i == word.length()) {\n                return word;\n            }\n        }\n        return \"\";\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 IronBee++ &mdash; All IronBee++ Headers\n *\n * @author Christopher Alfeld <calfeld@qualys.com>\n *\/\n\n#ifndef __IBPP__ALL__\n#define __IBPP__ALL__\n\n#include <include\/ironbeepp\/byte_string.hpp>\n#include <include\/ironbeepp\/clock.hpp>\n#include <include\/ironbeepp\/common_semantics.hpp>\n#include <include\/ironbeepp\/configuration_directives.hpp>\n#include <include\/ironbeepp\/configuration_map.hpp>\n#include <include\/ironbeepp\/configuration_parser.hpp>\n#include <include\/ironbeepp\/connection.hpp>\n#include <include\/ironbeepp\/connection_data.hpp>\n#include <include\/ironbeepp\/context.hpp>\n#include <include\/ironbeepp\/engine.hpp>\n#include <include\/ironbeepp\/exception.hpp>\n#include <include\/ironbeepp\/field.hpp>\n#include <include\/ironbeepp\/hooks.hpp>\n#include <include\/ironbeepp\/internal>\n#include <include\/ironbeepp\/internal\/catch.hpp>\n#include <include\/ironbeepp\/internal\/data.hpp>\n#include <include\/ironbeepp\/internal\/throw.hpp>\n#include <include\/ironbeepp\/ironbee.hpp>\n#include <include\/ironbeepp\/list.hpp>\n#include <include\/ironbeepp\/memory_pool.hpp>\n#include <include\/ironbeepp\/module.hpp>\n#include <include\/ironbeepp\/module_bootstrap.hpp>\n#include <include\/ironbeepp\/module_delegate.hpp>\n#include <include\/ironbeepp\/notifier.hpp>\n#include <include\/ironbeepp\/parsed_name_value.hpp>\n#include <include\/ironbeepp\/parsed_request_line.hpp>\n#include <include\/ironbeepp\/parsed_response_line.hpp>\n#include <include\/ironbeepp\/server.hpp>\n#include <include\/ironbeepp\/site.hpp>\n#include <include\/ironbeepp\/transaction.hpp>\n#include <include\/ironbeepp\/transaction_data.hpp>\n\n#endif\n<commit_msg>IronBee++\/all.hpp: Fixed issue with all.hpp<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 IronBee++ &mdash; All IronBee++ Headers\n *\n * @author Christopher Alfeld <calfeld@qualys.com>\n *\/\n\n#ifndef __IBPP__ALL__\n#define __IBPP__ALL__\n\n#include <include\/ironbeepp\/byte_string.hpp>\n#include <include\/ironbeepp\/clock.hpp>\n#include <include\/ironbeepp\/common_semantics.hpp>\n#include <include\/ironbeepp\/configuration_directives.hpp>\n#include <include\/ironbeepp\/configuration_map.hpp>\n#include <include\/ironbeepp\/configuration_parser.hpp>\n#include <include\/ironbeepp\/connection.hpp>\n#include <include\/ironbeepp\/connection_data.hpp>\n#include <include\/ironbeepp\/context.hpp>\n#include <include\/ironbeepp\/engine.hpp>\n#include <include\/ironbeepp\/exception.hpp>\n#include <include\/ironbeepp\/field.hpp>\n#include <include\/ironbeepp\/hooks.hpp>\n#include <include\/ironbeepp\/internal\/catch.hpp>\n#include <include\/ironbeepp\/internal\/data.hpp>\n#include <include\/ironbeepp\/internal\/throw.hpp>\n#include <include\/ironbeepp\/ironbee.hpp>\n#include <include\/ironbeepp\/list.hpp>\n#include <include\/ironbeepp\/memory_pool.hpp>\n#include <include\/ironbeepp\/module.hpp>\n#include <include\/ironbeepp\/module_bootstrap.hpp>\n#include <include\/ironbeepp\/module_delegate.hpp>\n#include <include\/ironbeepp\/notifier.hpp>\n#include <include\/ironbeepp\/parsed_name_value.hpp>\n#include <include\/ironbeepp\/parsed_request_line.hpp>\n#include <include\/ironbeepp\/parsed_response_line.hpp>\n#include <include\/ironbeepp\/server.hpp>\n#include <include\/ironbeepp\/site.hpp>\n#include <include\/ironbeepp\/transaction.hpp>\n#include <include\/ironbeepp\/transaction_data.hpp>\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  shellprocess.cpp  -  execute a shell process\n *  Program:  kalarm\n *  Copyright © 2004,2005,2007,2008 by David Jarvie <djarvie@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 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 <stdlib.h>\n#include <qglobal.h>\n#include <kde_file.h>\n#include <kapplication.h>\n#include <klocale.h>\n#include <kdebug.h>\n#include <kauthorized.h>\n\n#include \"shellprocess.moc\"\n\n\nQByteArray ShellProcess::mShellName;\nQByteArray ShellProcess::mShellPath;\nbool       ShellProcess::mInitialised = false;\nbool       ShellProcess::mAuthorised  = false;\n\n\nShellProcess::ShellProcess(const QString& command)\n\t: mCommand(command),\n\t  mStdinBytes(0),\n\t  mStatus(INACTIVE),\n\t  mStdinExit(false)\n{\n}\n\n\/******************************************************************************\n* Execute a command.\n*\/\nbool ShellProcess::start(OpenMode openMode)\n{\n\tif (!authorised())\n\t{\n\t\tmStatus = UNAUTHORISED;\n\t\treturn false;\n\t}\n\tconnect(this, SIGNAL(bytesWritten(qint64)), SLOT(writtenStdin(qint64)));\n\tconnect(this, SIGNAL(finished(int, QProcess::ExitStatus)), SLOT(slotExited(int, QProcess::ExitStatus)));\n\tconnect(this, SIGNAL(readyReadStandardOutput()), SLOT(stdoutReady()));\n\tconnect(this, SIGNAL(readyReadStandardError()), SLOT(stderrReady()));\n\tQStringList args;\n\targs << \"-c\" << mCommand;\n\tQProcess::start(shellName(), args, openMode);\n\tif (!waitForStarted())\n\t{\n\t\tmStatus = START_FAIL;\n\t\treturn false;\n\t}\n\tmStatus = RUNNING;\n\treturn true;\n}\n\n\/******************************************************************************\n* Called when a shell process execution completes.\n* Interprets the exit status according to which shell was called, and emits\n* a shellExited() signal.\n*\/\nvoid ShellProcess::slotExited(int exitCode, QProcess::ExitStatus exitStatus)\n{\n\tkDebug() << exitCode << \",\" << exitStatus;\n\tmStdinQueue.clear();\n\tmStatus = SUCCESS;\n\tmExitCode = exitCode;\n\tif (exitStatus != NormalExit)\n\t{\n\t\tkWarning(5950) << mCommand << \":\" << mShellName << \": crashed\/killed\";\n\t\tmStatus = DIED;\n\t}\n\telse\n\t{\n\t\t\/\/ Some shells report if the command couldn't be found, or is not executable\n\t\tif ((mShellName == \"bash\"  &&  (exitCode == 126 || exitCode == 127))\n\t\t||  (mShellName == \"ksh\"  &&  exitCode == 127))\n\t\t{\n\t\t\tkWarning(5950) << mCommand << \":\" << mShellName << \": not found or not executable\";\n\t\t\tmStatus = NOT_FOUND;\n\t\t}\n\t}\n\temit shellExited(this);\n}\n\n\/******************************************************************************\n* Write a string to STDIN.\n*\/\nvoid ShellProcess::writeStdin(const char* buffer, int bufflen)\n{\n\tQByteArray scopy(buffer, bufflen);    \/\/ construct a deep copy\n\tbool doWrite = mStdinQueue.isEmpty();\n\tmStdinQueue.enqueue(scopy);\n\tif (doWrite)\n\t{\n\t\tmStdinBytes = mStdinQueue.head().length();\n\t\twrite(mStdinQueue.head());\n\t}\n}\n\n\/******************************************************************************\n* Called when output to STDIN completes.\n* Send the next queued output, if any.\n* Note that buffers written to STDIN must not be freed until the bytesWritten()\n* signal has been processed.\n*\/\nvoid ShellProcess::writtenStdin(qint64 bytes)\n{\n\tmStdinBytes -= bytes;\n\tif (mStdinBytes > 0)\n\t\treturn;   \/\/ buffer has only been partially written so far\n\tif (!mStdinQueue.isEmpty())\n\t\tmStdinQueue.dequeue();   \/\/ free the buffer which has now been written\n\tif (!mStdinQueue.isEmpty())\n\t{\n\t\tmStdinBytes = mStdinQueue.head().length();\n\t\twrite(mStdinQueue.head());\n\t}\n\telse if (mStdinExit)\n\t\tkill();\n}\n\n\/******************************************************************************\n* Tell the process to exit once all STDIN strings have been written.\n*\/\nvoid ShellProcess::stdinExit()\n{\n\tif (mStdinQueue.isEmpty())\n\t\tkill();\n\telse\n\t\tmStdinExit = true;\n}\n\n\/******************************************************************************\n* Return the error message corresponding to the command exit status.\n* Reply = null string if not yet exited, or if command successful.\n*\/\nQString ShellProcess::errorMessage() const\n{\n\tswitch (mStatus)\n\t{\n\t\tcase UNAUTHORISED:\n\t\t\treturn i18nc(\"@info\", \"Failed to execute command (shell access not authorized)\");\n\t\tcase START_FAIL:\n\t\tcase NOT_FOUND:\n\t\t\treturn i18nc(\"@info\", \"Failed to execute command\");\n\t\tcase DIED:\n\t\t\treturn i18nc(\"@info\", \"Command execution error\");\n\t\tcase SUCCESS:\n\t\t\tif (mExitCode)\n\t\t\t\treturn i18nc(\"@info\", \"Command exit code: %1\", mExitCode);\n\t\t\t\/\/ Fall through to INACTIVE\n\t\tcase INACTIVE:\n\t\tcase RUNNING:\n\t\tdefault:\n\t\t\treturn QString();\n\t}\n}\n\n\/******************************************************************************\n* Determine which shell to use.\n* Don't use the KProcess default shell, since we need to know which shell is\n* used in order to decide what its exit code means.\n*\/\nconst QByteArray& ShellProcess::shellPath()\n{\n\tif (mShellPath.isEmpty())\n\t{\n\t\t\/\/ Get the path to the shell\n\t\tmShellPath = \"\/bin\/sh\";\n\t\tQByteArray envshell = qgetenv(\"SHELL\").trimmed();\n\t\tif (!envshell.isEmpty())\n\t\t{\n\t\t\tstruct stat fileinfo;\n\t\t\tif (KDE_stat(envshell.data(), &fileinfo) != -1  \/\/ ensure file exists\n\t\t\t&&  !S_ISDIR(fileinfo.st_mode)              \/\/ and it's not a directory\n\t\t\t&&  !S_ISCHR(fileinfo.st_mode)              \/\/ and it's not a character device\n\t\t\t&&  !S_ISBLK(fileinfo.st_mode)              \/\/ and it's not a block device\n#ifdef S_ISSOCK\n\t\t\t&&  !S_ISSOCK(fileinfo.st_mode)             \/\/ and it's not a socket\n#endif\n\t\t\t&&  !S_ISFIFO(fileinfo.st_mode)             \/\/ and it's not a fifo\n\t\t\t&&  !access(envshell.data(), X_OK))         \/\/ and it's executable\n\t\t\t\tmShellPath = envshell;\n\t\t}\n\n\t\t\/\/ Get the shell filename with the path stripped off\n\t\tint i = mShellPath.lastIndexOf('\/');\n\t\tif (i >= 0)\n\t\t\tmShellName = mShellPath.mid(i + 1);\n\t\telse\n\t\t\tmShellName = mShellPath;\n\t}\n\treturn mShellPath;\n}\n\n\/******************************************************************************\n* Check whether shell commands are allowed at all.\n*\/\nbool ShellProcess::authorised()\n{\n\tif (!mInitialised)\n\t{\n\t\tmAuthorised = KAuthorized::authorizeKAction(\"shell_access\");\n\t\tmInitialised = true;\n\t}\n\treturn mAuthorised;\n}\n<commit_msg>Krazy<commit_after>\/*\n *  shellprocess.cpp  -  execute a shell process\n *  Program:  kalarm\n *  Copyright © 2004,2005,2007,2008 by David Jarvie <djarvie@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 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 <stdlib.h>\n#include <qglobal.h>\n#include <kde_file.h>\n#include <kapplication.h>\n#include <klocale.h>\n#include <kdebug.h>\n#include <kauthorized.h>\n\n#include \"shellprocess.moc\"\n\n\nQByteArray ShellProcess::mShellName;\nQByteArray ShellProcess::mShellPath;\nbool       ShellProcess::mInitialised = false;\nbool       ShellProcess::mAuthorised  = false;\n\n\nShellProcess::ShellProcess(const QString& command)\n\t: mCommand(command),\n\t  mStdinBytes(0),\n\t  mStatus(INACTIVE),\n\t  mStdinExit(false)\n{\n}\n\n\/******************************************************************************\n* Execute a command.\n*\/\nbool ShellProcess::start(OpenMode openMode)\n{\n\tif (!authorised())\n\t{\n\t\tmStatus = UNAUTHORISED;\n\t\treturn false;\n\t}\n\tconnect(this, SIGNAL(bytesWritten(qint64)), SLOT(writtenStdin(qint64)));\n\tconnect(this, SIGNAL(finished(int, QProcess::ExitStatus)), SLOT(slotExited(int, QProcess::ExitStatus)));\n\tconnect(this, SIGNAL(readyReadStandardOutput()), SLOT(stdoutReady()));\n\tconnect(this, SIGNAL(readyReadStandardError()), SLOT(stderrReady()));\n\tQStringList args;\n\targs << \"-c\" << mCommand;\n\tQProcess::start(shellName(), args, openMode);\n\tif (!waitForStarted())\n\t{\n\t\tmStatus = START_FAIL;\n\t\treturn false;\n\t}\n\tmStatus = RUNNING;\n\treturn true;\n}\n\n\/******************************************************************************\n* Called when a shell process execution completes.\n* Interprets the exit status according to which shell was called, and emits\n* a shellExited() signal.\n*\/\nvoid ShellProcess::slotExited(int exitCode, QProcess::ExitStatus exitStatus)\n{\n\tkDebug() << exitCode << \",\" << exitStatus;\n\tmStdinQueue.clear();\n\tmStatus = SUCCESS;\n\tmExitCode = exitCode;\n\tif (exitStatus != NormalExit)\n\t{\n\t\tkWarning(5950) << mCommand << \":\" << mShellName << \": crashed\/killed\";\n\t\tmStatus = DIED;\n\t}\n\telse\n\t{\n\t\t\/\/ Some shells report if the command couldn't be found, or is not executable\n\t\tif ((mShellName == \"bash\"  &&  (exitCode == 126 || exitCode == 127))\n\t\t||  (mShellName == \"ksh\"  &&  exitCode == 127))\n\t\t{\n\t\t\tkWarning(5950) << mCommand << \":\" << mShellName << \": not found or not executable\";\n\t\t\tmStatus = NOT_FOUND;\n\t\t}\n\t}\n\temit shellExited(this);\n}\n\n\/******************************************************************************\n* Write a string to STDIN.\n*\/\nvoid ShellProcess::writeStdin(const char* buffer, int bufflen)\n{\n\tQByteArray scopy(buffer, bufflen);    \/\/ construct a deep copy\n\tbool doWrite = mStdinQueue.isEmpty();\n\tmStdinQueue.enqueue(scopy);\n\tif (doWrite)\n\t{\n\t\tmStdinBytes = mStdinQueue.head().length();\n\t\twrite(mStdinQueue.head());\n\t}\n}\n\n\/******************************************************************************\n* Called when output to STDIN completes.\n* Send the next queued output, if any.\n* Note that buffers written to STDIN must not be freed until the bytesWritten()\n* signal has been processed.\n*\/\nvoid ShellProcess::writtenStdin(qint64 bytes)\n{\n\tmStdinBytes -= bytes;\n\tif (mStdinBytes > 0)\n\t\treturn;   \/\/ buffer has only been partially written so far\n\tif (!mStdinQueue.isEmpty())\n\t\tmStdinQueue.dequeue();   \/\/ free the buffer which has now been written\n\tif (!mStdinQueue.isEmpty())\n\t{\n\t\tmStdinBytes = mStdinQueue.head().length();\n\t\twrite(mStdinQueue.head());\n\t}\n\telse if (mStdinExit)\n\t\tkill();\n}\n\n\/******************************************************************************\n* Tell the process to exit once all STDIN strings have been written.\n*\/\nvoid ShellProcess::stdinExit()\n{\n\tif (mStdinQueue.isEmpty())\n\t\tkill();\n\telse\n\t\tmStdinExit = true;\n}\n\n\/******************************************************************************\n* Return the error message corresponding to the command exit status.\n* Reply = null string if not yet exited, or if command successful.\n*\/\nQString ShellProcess::errorMessage() const\n{\n\tswitch (mStatus)\n\t{\n\t\tcase UNAUTHORISED:\n\t\t\treturn i18nc(\"@info\", \"Failed to execute command (shell access not authorized)\");\n\t\tcase START_FAIL:\n\t\tcase NOT_FOUND:\n\t\t\treturn i18nc(\"@info\", \"Failed to execute command\");\n\t\tcase DIED:\n\t\t\treturn i18nc(\"@info\", \"Command execution error\");\n\t\tcase SUCCESS:\n\t\t\tif (mExitCode)\n\t\t\t\treturn i18nc(\"@info\", \"Command exit code: %1\", mExitCode);\n\t\t\t\/\/ Fall through to INACTIVE\n\t\tcase INACTIVE:\n\t\tcase RUNNING:\n\t\tdefault:\n\t\t\treturn QString();\n\t}\n}\n\n\/******************************************************************************\n* Determine which shell to use.\n* Don't use the KProcess default shell, since we need to know which shell is\n* used in order to decide what its exit code means.\n*\/\nconst QByteArray& ShellProcess::shellPath()\n{\n\tif (mShellPath.isEmpty())\n\t{\n\t\t\/\/ Get the path to the shell\n\t\tmShellPath = \"\/bin\/sh\";\n\t\tQByteArray envshell = qgetenv(\"SHELL\").trimmed();\n\t\tif (!envshell.isEmpty())\n\t\t{\n\t\t\tKDE_struct_stat fileinfo;\n\t\t\tif (KDE_stat(envshell.data(), &fileinfo) != -1  \/\/ ensure file exists\n\t\t\t&&  !S_ISDIR(fileinfo.st_mode)              \/\/ and it's not a directory\n\t\t\t&&  !S_ISCHR(fileinfo.st_mode)              \/\/ and it's not a character device\n\t\t\t&&  !S_ISBLK(fileinfo.st_mode)              \/\/ and it's not a block device\n#ifdef S_ISSOCK\n\t\t\t&&  !S_ISSOCK(fileinfo.st_mode)             \/\/ and it's not a socket\n#endif\n\t\t\t&&  !S_ISFIFO(fileinfo.st_mode)             \/\/ and it's not a fifo\n\t\t\t&&  !access(envshell.data(), X_OK))         \/\/ and it's executable\n\t\t\t\tmShellPath = envshell;\n\t\t}\n\n\t\t\/\/ Get the shell filename with the path stripped off\n\t\tint i = mShellPath.lastIndexOf('\/');\n\t\tif (i >= 0)\n\t\t\tmShellName = mShellPath.mid(i + 1);\n\t\telse\n\t\t\tmShellName = mShellPath;\n\t}\n\treturn mShellPath;\n}\n\n\/******************************************************************************\n* Check whether shell commands are allowed at all.\n*\/\nbool ShellProcess::authorised()\n{\n\tif (!mInitialised)\n\t{\n\t\tmAuthorised = KAuthorized::authorizeKAction(\"shell_access\");\n\t\tmInitialised = true;\n\t}\n\treturn mAuthorised;\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\/io\/p9_io_dmi_clear_firs.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\/\/\/ @file p9_io_dmi_clear_firs.C\n\/\/\/ @brief Clears I\/O Firs\n\/\/\/-----------------------------------------------------------------------------\n\/\/\/ *HWP HWP Owner        : Chris Steffen <cwsteffen@us.ibm.com>\n\/\/\/ *HWP HWP Backup Owner : Gary Peterson <garyp@us.ibm.com>\n\/\/\/ *HWP FW Owner         : Jamie Knight <rjknight@us.ibm.com>\n\/\/\/ *HWP Team             : IO\n\/\/\/ *HWP Level            : 2\n\/\/\/ *HWP Consumed by      : FSP:HB\n\/\/\/-----------------------------------------------------------------------------\n\/\/\/\n\/\/\/ @verbatim\n\/\/\/ High-level procedure flow:\n\/\/\/\n\/\/\/ Clears I\/O Xbus FIRs on the PHY Rx\/Tx.\n\/\/\/\n\/\/\/ Clocks must be running.\n\/\/\/\n\/\/\/ @endverbatim\n\/\/\/----------------------------------------------------------------------------\n\n\/\/-----------------------------------------------------------------------------\n\/\/  Includes\n\/\/-----------------------------------------------------------------------------\n#include <p9_io_dmi_clear_firs.H>\n#include <p9_io_scom.H>\n#include <p9_io_regs.H>\n\n\/\/-----------------------------------------------------------------------------\n\/\/  Definitions\n\/\/-----------------------------------------------------------------------------\nfapi2::ReturnCode io_dmi_proc_rx_fir_reset(const DMI_PROC_TGT& i_tgt);\nfapi2::ReturnCode io_dmi_proc_tx_fir_reset(const DMI_PROC_TGT& i_tgt);\n\nfapi2::ReturnCode io_dmi_cn_rx_fir_reset(const DMI_CN_TGT& i_tgt);\nfapi2::ReturnCode io_dmi_cn_tx_fir_reset(const DMI_CN_TGT& i_tgt);\n\n\/**\n * @brief Clears PHY Rx\/Tx FIRs on the DMI(EDI+) specified target.  The FIRs\n *   are cleared by toggling a rx & tx fir reset bit.\n * @param[in] i_tgt         FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode p9_io_dmi_proc_clear_firs(const DMI_PROC_TGT& i_tgt)\n{\n    FAPI_IMP(\"I\/O Start DMI Proc Clear FIRs\");\n\n    FAPI_TRY(io_dmi_proc_tx_fir_reset(i_tgt), \"Tx Reset Failed\");\n\n    FAPI_TRY(io_dmi_proc_rx_fir_reset(i_tgt), \"Rx Reset Failed\");\n\nfapi_try_exit:\n    FAPI_IMP(\"I\/O End DMI Proc Clear FIRs\");\n    return fapi2::current_err;\n}\n\n\/**\n * @brief This function resets the Rx Firs on a EDI+ DMI\n * @param[in] i_tgt       FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode io_dmi_proc_rx_fir_reset(const DMI_PROC_TGT& i_tgt)\n{\n    const uint8_t GRP3 = 3;\n    const uint8_t LN0 = 0;\n    uint64_t l_data = 0;\n\n    FAPI_TRY(io::read(EDIP_RX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_RX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDIP_RX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_RX_FIR_RESET, 1, l_data);\n    FAPI_TRY(io::write(EDIP_RX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_RX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDIP_RX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/**\n * @brief This function resets the Tx Firs on a EDI+ DMI\n * @param[in] i_tgt       FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode io_dmi_proc_tx_fir_reset(const DMI_PROC_TGT& i_tgt)\n{\n    const uint8_t GRP3 = 3;\n    const uint8_t LN0 = 0;\n    uint64_t l_data = 0;\n\n    FAPI_TRY(io::read(EDIP_TX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_TX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDIP_TX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_TX_FIR_RESET, 1, l_data);\n    FAPI_TRY(io::write(EDIP_TX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_TX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDIP_TX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\n\/**\n * @brief Clears PHY Rx\/Tx FIRs on the DMI Centaur(EDI) specified target.  The FIRs\n *   are cleared by toggling a rx & tx fir reset bit.\n * @param[in] i_tgt         FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode p9_io_dmi_cn_clear_firs(const DMI_CN_TGT& i_tgt)\n{\n    FAPI_IMP(\"I\/O Start DMI Proc Clear FIRs\");\n\n    FAPI_TRY(io_dmi_cn_tx_fir_reset(i_tgt), \"Tx Reset Failed\");\n\n    FAPI_TRY(io_dmi_cn_rx_fir_reset(i_tgt), \"Rx Reset Failed\");\n\nfapi_try_exit:\n    FAPI_IMP(\"I\/O End DMI Proc Clear FIRs\");\n    return fapi2::current_err;\n}\n\n\/**\n * @brief This function resets the Rx Firs on a EDI DMI Centaur\n * @param[in] i_tgt       FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode io_dmi_cn_rx_fir_reset(const DMI_CN_TGT& i_tgt)\n{\n    const uint8_t GRP0 = 0;\n    const uint8_t LN0 = 0;\n    uint64_t l_data = 0;\n\n    FAPI_TRY(io::read(EDI_RX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_RX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDI_RX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_RX_FIR_RESET, 1, l_data);\n    FAPI_TRY(io::write(EDI_RX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_RX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDI_RX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/**\n * @brief This function resets the Tx Firs on a EDI DMI Centaur\n * @param[in] i_tgt       FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode io_dmi_cn_tx_fir_reset(const DMI_CN_TGT& i_tgt)\n{\n    const uint8_t GRP0 = 0;\n    const uint8_t LN0 = 0;\n    uint64_t l_data = 0;\n\n    FAPI_TRY(io::read(EDI_TX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_TX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDI_TX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_TX_FIR_RESET, 1, l_data);\n    FAPI_TRY(io::write(EDI_TX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_TX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDI_TX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n<commit_msg>I\/O Metadata Cleanup<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/io\/p9_io_dmi_clear_firs.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\/\/\/ @file p9_io_dmi_clear_firs.C\n\/\/\/ @brief Clears I\/O Firs\n\/\/\/-----------------------------------------------------------------------------\n\/\/\/ *HWP HWP Owner        : Chris Steffen <cwsteffen@us.ibm.com>\n\/\/\/ *HWP HWP Backup Owner : Gary Peterson <garyp@us.ibm.com>\n\/\/\/ *HWP FW Owner         : Jamie Knight <rjknight@us.ibm.com>\n\/\/\/ *HWP Team             : IO\n\/\/\/ *HWP Level            : 3\n\/\/\/ *HWP Consumed by      : FSP:HB\n\/\/\/-----------------------------------------------------------------------------\n\/\/\/\n\/\/\/ @verbatim\n\/\/\/ High-level procedure flow:\n\/\/\/\n\/\/\/ Clears I\/O Xbus FIRs on the PHY Rx\/Tx.\n\/\/\/\n\/\/\/ Clocks must be running.\n\/\/\/\n\/\/\/ @endverbatim\n\/\/\/----------------------------------------------------------------------------\n\n\/\/-----------------------------------------------------------------------------\n\/\/  Includes\n\/\/-----------------------------------------------------------------------------\n#include <p9_io_dmi_clear_firs.H>\n#include <p9_io_scom.H>\n#include <p9_io_regs.H>\n\n\/\/-----------------------------------------------------------------------------\n\/\/  Definitions\n\/\/-----------------------------------------------------------------------------\nfapi2::ReturnCode io_dmi_proc_rx_fir_reset(const DMI_PROC_TGT& i_tgt);\nfapi2::ReturnCode io_dmi_proc_tx_fir_reset(const DMI_PROC_TGT& i_tgt);\n\nfapi2::ReturnCode io_dmi_cn_rx_fir_reset(const DMI_CN_TGT& i_tgt);\nfapi2::ReturnCode io_dmi_cn_tx_fir_reset(const DMI_CN_TGT& i_tgt);\n\n\/**\n * @brief Clears PHY Rx\/Tx FIRs on the DMI(EDI+) specified target.  The FIRs\n *   are cleared by toggling a rx & tx fir reset bit.\n * @param[in] i_tgt         FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode p9_io_dmi_proc_clear_firs(const DMI_PROC_TGT& i_tgt)\n{\n    FAPI_IMP(\"I\/O Start DMI Proc Clear FIRs\");\n\n    FAPI_TRY(io_dmi_proc_tx_fir_reset(i_tgt), \"Tx Reset Failed\");\n\n    FAPI_TRY(io_dmi_proc_rx_fir_reset(i_tgt), \"Rx Reset Failed\");\n\nfapi_try_exit:\n    FAPI_IMP(\"I\/O End DMI Proc Clear FIRs\");\n    return fapi2::current_err;\n}\n\n\/**\n * @brief This function resets the Rx Firs on a EDI+ DMI\n * @param[in] i_tgt       FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode io_dmi_proc_rx_fir_reset(const DMI_PROC_TGT& i_tgt)\n{\n    const uint8_t GRP3 = 3;\n    const uint8_t LN0 = 0;\n    uint64_t l_data = 0;\n\n    FAPI_TRY(io::read(EDIP_RX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_RX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDIP_RX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_RX_FIR_RESET, 1, l_data);\n    FAPI_TRY(io::write(EDIP_RX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_RX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDIP_RX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/**\n * @brief This function resets the Tx Firs on a EDI+ DMI\n * @param[in] i_tgt       FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode io_dmi_proc_tx_fir_reset(const DMI_PROC_TGT& i_tgt)\n{\n    const uint8_t GRP3 = 3;\n    const uint8_t LN0 = 0;\n    uint64_t l_data = 0;\n\n    FAPI_TRY(io::read(EDIP_TX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_TX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDIP_TX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_TX_FIR_RESET, 1, l_data);\n    FAPI_TRY(io::write(EDIP_TX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\n    io::set (EDIP_TX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDIP_TX_FIR_RESET, i_tgt, GRP3, LN0, l_data));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\n\/**\n * @brief Clears PHY Rx\/Tx FIRs on the DMI Centaur(EDI) specified target.  The FIRs\n *   are cleared by toggling a rx & tx fir reset bit.\n * @param[in] i_tgt         FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode p9_io_dmi_cn_clear_firs(const DMI_CN_TGT& i_tgt)\n{\n    FAPI_IMP(\"I\/O Start DMI Proc Clear FIRs\");\n\n    FAPI_TRY(io_dmi_cn_tx_fir_reset(i_tgt), \"Tx Reset Failed\");\n\n    FAPI_TRY(io_dmi_cn_rx_fir_reset(i_tgt), \"Rx Reset Failed\");\n\nfapi_try_exit:\n    FAPI_IMP(\"I\/O End DMI Proc Clear FIRs\");\n    return fapi2::current_err;\n}\n\n\/**\n * @brief This function resets the Rx Firs on a EDI DMI Centaur\n * @param[in] i_tgt       FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode io_dmi_cn_rx_fir_reset(const DMI_CN_TGT& i_tgt)\n{\n    const uint8_t GRP0 = 0;\n    const uint8_t LN0 = 0;\n    uint64_t l_data = 0;\n\n    FAPI_TRY(io::read(EDI_RX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_RX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDI_RX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_RX_FIR_RESET, 1, l_data);\n    FAPI_TRY(io::write(EDI_RX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_RX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDI_RX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/**\n * @brief This function resets the Tx Firs on a EDI DMI Centaur\n * @param[in] i_tgt       FAPI2 Target\n * @retval ReturnCode\n *\/\nfapi2::ReturnCode io_dmi_cn_tx_fir_reset(const DMI_CN_TGT& i_tgt)\n{\n    const uint8_t GRP0 = 0;\n    const uint8_t LN0 = 0;\n    uint64_t l_data = 0;\n\n    FAPI_TRY(io::read(EDI_TX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_TX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDI_TX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_TX_FIR_RESET, 1, l_data);\n    FAPI_TRY(io::write(EDI_TX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\n    io::set (EDI_TX_FIR_RESET, 0, l_data);\n    FAPI_TRY(io::write(EDI_TX_FIR_RESET, i_tgt, GRP0, LN0, l_data));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2015 GitHub, Inc.\n\/\/ Use of this source code is governed by the MIT license that can be\n\/\/ found in the LICENSE file.\n\n#include \"atom\/browser\/api\/atom_api_web_request.h\"\n\n#include \"atom\/browser\/atom_browser_context.h\"\n#include \"atom\/browser\/net\/atom_network_delegate.h\"\n#include \"atom\/common\/native_mate_converters\/callback.h\"\n#include \"atom\/common\/native_mate_converters\/file_path_converter.h\"\n#include \"atom\/common\/native_mate_converters\/gurl_converter.h\"\n#include \"atom\/common\/native_mate_converters\/net_converter.h\"\n#include \"base\/files\/file_path.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"native_mate\/dictionary.h\"\n#include \"native_mate\/object_template_builder.h\"\n#include \"v8\/include\/v8.h\"\n\nusing content::BrowserThread;\n\nnamespace mate {\n\ntemplate<>\nstruct Converter<URLPattern> {\n  static bool FromV8(v8::Isolate* isolate, v8::Local<v8::Value> val,\n                     URLPattern* out) {\n    std::string pattern;\n    if (!ConvertFromV8(isolate, val, &pattern))\n      return false;\n    return out->Parse(pattern) == URLPattern::PARSE_SUCCESS;\n  }\n};\n\ntemplate<>\nstruct Converter<net::URLFetcher::RequestType> {\n  static bool FromV8(v8::Isolate* isolate, v8::Handle<v8::Value> val,\n                     net::URLFetcher::RequestType* out) {\n    std::string type = base::ToLowerASCII(V8ToString(val));\n    if (type == \"get\")\n      *out = net::URLFetcher::RequestType::GET;\n    else if (type == \"post\")\n      *out = net::URLFetcher::RequestType::POST;\n    else if (type == \"head\")\n      *out = net::URLFetcher::RequestType::HEAD;\n    else if (type == \"delete_request\")\n      *out = net::URLFetcher::RequestType::DELETE_REQUEST;\n    else if (type == \"put\")\n      *out = net::URLFetcher::RequestType::PUT;\n    else if (type == \"patch\")\n      *out = net::URLFetcher::RequestType::PATCH;\n    return true;\n  }\n};\n\n}  \/\/ namespace mate\n\nnamespace atom {\n\nnamespace api {\n\nWebRequest::WebRequest(v8::Isolate* isolate,\n                       AtomBrowserContext* browser_context)\n    : browser_context_(browser_context) {\n  Init(isolate);\n}\n\nWebRequest::~WebRequest() {\n  net::URLFetcher::CancelAll();\n}\n\nvoid WebRequest::OnURLFetchComplete(\n    const net::URLFetcher* source) {\n  mate::Dictionary response = mate::Dictionary::CreateEmpty(isolate());\n  int response_code = source->GetResponseCode();\n  response.Set(\"statusCode\", response_code);\n\n  std::string body;\n  v8::Local<v8::Value> err = v8::Null(isolate());\n  if (response_code == net::URLFetcher::ResponseCode::RESPONSE_CODE_INVALID) {\n    base::DictionaryValue dict;\n    dict.SetInteger(\"errorCode\", source->GetStatus().error());\n    err = mate::ConvertToV8(isolate(), dict);\n  } else {\n    response.Set(\"headers\", source->GetResponseHeaders());\n    source->GetResponseAsString(&body);\n  }\n\n  FetchCallback callback = fetchers_[source];\n  \/\/ error, response, body\n  const uint8_t* data = reinterpret_cast<const uint8_t*>(body.c_str());\n  callback.Run(err, response, v8::String::NewFromOneByte(isolate(),\n      data, v8::NewStringType::kNormal, body.length()).ToLocalChecked());\n  fetchers_.erase(source);\n}\n\nvoid WebRequest::Fetch(mate::Arguments* args) {\n  GURL url;\n  if (!args->GetNext(&url)) {\n    args->ThrowError(\"invalid url parameter\");\n    return;\n  }\n\n  net::URLFetcher::RequestType request_type = net::URLFetcher::RequestType::GET;\n  net::HttpRequestHeaders headers;\n  base::FilePath path;\n  std::string payload;\n  std::string payload_content_type;\n  mate::Dictionary dict;\n  if (args->GetNext(&dict)) {\n    dict.Get(\"method\", &request_type);\n    dict.Get(\"headers\", &headers);\n    dict.Get(\"path\", &path);\n    if (dict.Get(\"payload\", &payload)) {\n      if (!dict.Get(\"payload_content_type\", &payload_content_type)) {\n        args->ThrowError(\"payload_content_type is required for payload\");\n      }\n    }\n  }\n\n  FetchCallback callback;\n  if (!args->GetNext(&callback)) {\n    args->ThrowError(\"invalid callback parameter\");\n    return;\n  }\n\n  net::URLFetcher* fetcher = net::URLFetcher::Create(url, request_type, this)\n      .release();\n  fetcher->SetRequestContext(browser_context_->GetRequestContext());\n  if (!payload.empty())\n    fetcher->SetUploadData(payload_content_type, payload);\n  if (!headers.IsEmpty())\n    fetcher->SetExtraRequestHeaders(headers.ToString());\n  if (!path.empty())\n    fetcher->SaveResponseToFileAtPath(\n        path,\n        BrowserThread::GetMessageLoopProxyForThread(BrowserThread::FILE));\n  fetcher->Start();\n  fetchers_[fetcher] = FetchCallback(callback);\n}\n\ntemplate<AtomNetworkDelegate::SimpleEvent type>\nvoid WebRequest::SetSimpleListener(mate::Arguments* args) {\n  SetListener<AtomNetworkDelegate::SimpleListener>(\n      &AtomNetworkDelegate::SetSimpleListenerInIO, type, args);\n}\n\ntemplate<AtomNetworkDelegate::ResponseEvent type>\nvoid WebRequest::SetResponseListener(mate::Arguments* args) {\n  SetListener<AtomNetworkDelegate::ResponseListener>(\n      &AtomNetworkDelegate::SetResponseListenerInIO, type, args);\n}\n\ntemplate<typename Listener, typename Method, typename Event>\nvoid WebRequest::SetListener(Method method, Event type, mate::Arguments* args) {\n  \/\/ { urls }.\n  URLPatterns patterns;\n  mate::Dictionary dict;\n  args->GetNext(&dict) && dict.Get(\"urls\", &patterns);\n\n  \/\/ Function or null.\n  v8::Local<v8::Value> value;\n  Listener listener;\n  if (!args->GetNext(&listener) &&\n      !(args->GetNext(&value) && value->IsNull())) {\n    args->ThrowError(\"Must pass null or a Function\");\n    return;\n  }\n\n  auto delegate = browser_context_->network_delegate();\n  BrowserThread::PostTask(BrowserThread::IO, FROM_HERE,\n                          base::Bind(method, base::Unretained(delegate), type,\n                                     patterns, listener));\n}\n\n\/\/ static\nmate::Handle<WebRequest> WebRequest::Create(\n    v8::Isolate* isolate,\n    AtomBrowserContext* browser_context) {\n  return mate::CreateHandle(isolate, new WebRequest(isolate, browser_context));\n}\n\n\/\/ static\nvoid WebRequest::BuildPrototype(v8::Isolate* isolate,\n                                v8::Local<v8::FunctionTemplate> prototype) {\n  prototype->SetClassName(mate::StringToV8(isolate, \"WebRequest\"));\n  mate::ObjectTemplateBuilder(isolate, prototype->PrototypeTemplate())\n      .SetMethod(\"onBeforeRequest\",\n                 &WebRequest::SetResponseListener<\n                    AtomNetworkDelegate::kOnBeforeRequest>)\n      .SetMethod(\"onBeforeSendHeaders\",\n                 &WebRequest::SetResponseListener<\n                    AtomNetworkDelegate::kOnBeforeSendHeaders>)\n      .SetMethod(\"onHeadersReceived\",\n                 &WebRequest::SetResponseListener<\n                    AtomNetworkDelegate::kOnHeadersReceived>)\n      .SetMethod(\"onSendHeaders\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnSendHeaders>)\n      .SetMethod(\"onBeforeRedirect\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnBeforeRedirect>)\n      .SetMethod(\"onResponseStarted\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnResponseStarted>)\n      .SetMethod(\"onCompleted\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnCompleted>)\n      .SetMethod(\"onErrorOccurred\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnErrorOccurred>)\n      .SetMethod(\"fetch\",\n                 &WebRequest::Fetch);\n}\n\n}  \/\/ namespace api\n\n}  \/\/ namespace atom\n<commit_msg>let `BrowserProcessSubThread` handle cancelling fetches auditors: @bbondy<commit_after>\/\/ Copyright (c) 2015 GitHub, Inc.\n\/\/ Use of this source code is governed by the MIT license that can be\n\/\/ found in the LICENSE file.\n\n#include \"atom\/browser\/api\/atom_api_web_request.h\"\n\n#include \"atom\/browser\/atom_browser_context.h\"\n#include \"atom\/browser\/net\/atom_network_delegate.h\"\n#include \"atom\/common\/native_mate_converters\/callback.h\"\n#include \"atom\/common\/native_mate_converters\/file_path_converter.h\"\n#include \"atom\/common\/native_mate_converters\/gurl_converter.h\"\n#include \"atom\/common\/native_mate_converters\/net_converter.h\"\n#include \"base\/files\/file_path.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"native_mate\/dictionary.h\"\n#include \"native_mate\/object_template_builder.h\"\n#include \"v8\/include\/v8.h\"\n\nusing content::BrowserThread;\n\nnamespace mate {\n\ntemplate<>\nstruct Converter<URLPattern> {\n  static bool FromV8(v8::Isolate* isolate, v8::Local<v8::Value> val,\n                     URLPattern* out) {\n    std::string pattern;\n    if (!ConvertFromV8(isolate, val, &pattern))\n      return false;\n    return out->Parse(pattern) == URLPattern::PARSE_SUCCESS;\n  }\n};\n\ntemplate<>\nstruct Converter<net::URLFetcher::RequestType> {\n  static bool FromV8(v8::Isolate* isolate, v8::Handle<v8::Value> val,\n                     net::URLFetcher::RequestType* out) {\n    std::string type = base::ToLowerASCII(V8ToString(val));\n    if (type == \"get\")\n      *out = net::URLFetcher::RequestType::GET;\n    else if (type == \"post\")\n      *out = net::URLFetcher::RequestType::POST;\n    else if (type == \"head\")\n      *out = net::URLFetcher::RequestType::HEAD;\n    else if (type == \"delete_request\")\n      *out = net::URLFetcher::RequestType::DELETE_REQUEST;\n    else if (type == \"put\")\n      *out = net::URLFetcher::RequestType::PUT;\n    else if (type == \"patch\")\n      *out = net::URLFetcher::RequestType::PATCH;\n    return true;\n  }\n};\n\n}  \/\/ namespace mate\n\nnamespace atom {\n\nnamespace api {\n\nWebRequest::WebRequest(v8::Isolate* isolate,\n                       AtomBrowserContext* browser_context)\n    : browser_context_(browser_context) {\n  Init(isolate);\n}\n\nWebRequest::~WebRequest() {\n  fetchers_.clear();\n}\n\nvoid WebRequest::OnURLFetchComplete(\n    const net::URLFetcher* source) {\n  FetchCallback callback = fetchers_[source];\n  fetchers_.erase(source);\n\n  mate::Dictionary response = mate::Dictionary::CreateEmpty(isolate());\n  int response_code = source->GetResponseCode();\n  response.Set(\"statusCode\", response_code);\n\n  std::string body;\n  v8::Local<v8::Value> err = v8::Null(isolate());\n  if (response_code == net::URLFetcher::ResponseCode::RESPONSE_CODE_INVALID ||\n      !source->GetStatus().is_success()) {\n    base::DictionaryValue dict;\n    dict.SetInteger(\"errorCode\", source->GetStatus().error());\n    err = mate::ConvertToV8(isolate(), dict);\n  } else {\n    response.Set(\"headers\", source->GetResponseHeaders());\n    source->GetResponseAsString(&body);\n  }\n\n  \/\/ error, response, body\n  const uint8_t* data = reinterpret_cast<const uint8_t*>(body.c_str());\n  callback.Run(err, response, v8::String::NewFromOneByte(isolate(),\n      data, v8::NewStringType::kNormal, body.length()).ToLocalChecked());\n}\n\nvoid WebRequest::Fetch(mate::Arguments* args) {\n  GURL url;\n  if (!args->GetNext(&url)) {\n    args->ThrowError(\"invalid url parameter\");\n    return;\n  }\n\n  net::URLFetcher::RequestType request_type = net::URLFetcher::RequestType::GET;\n  net::HttpRequestHeaders headers;\n  base::FilePath path;\n  std::string payload;\n  std::string payload_content_type;\n  mate::Dictionary dict;\n  if (args->GetNext(&dict)) {\n    dict.Get(\"method\", &request_type);\n    dict.Get(\"headers\", &headers);\n    dict.Get(\"path\", &path);\n    if (dict.Get(\"payload\", &payload)) {\n      if (!dict.Get(\"payload_content_type\", &payload_content_type)) {\n        args->ThrowError(\"payload_content_type is required for payload\");\n      }\n    }\n  }\n\n  FetchCallback callback;\n  if (!args->GetNext(&callback)) {\n    args->ThrowError(\"invalid callback parameter\");\n    return;\n  }\n\n  net::URLFetcher* fetcher = net::URLFetcher::Create(url, request_type, this)\n      .release();\n  fetcher->SetRequestContext(browser_context_->GetRequestContext());\n  if (!payload.empty())\n    fetcher->SetUploadData(payload_content_type, payload);\n  if (!headers.IsEmpty())\n    fetcher->SetExtraRequestHeaders(headers.ToString());\n  if (!path.empty())\n    fetcher->SaveResponseToFileAtPath(\n        path,\n        BrowserThread::GetMessageLoopProxyForThread(BrowserThread::FILE));\n  fetcher->Start();\n  fetchers_[fetcher] = FetchCallback(callback);\n}\n\ntemplate<AtomNetworkDelegate::SimpleEvent type>\nvoid WebRequest::SetSimpleListener(mate::Arguments* args) {\n  SetListener<AtomNetworkDelegate::SimpleListener>(\n      &AtomNetworkDelegate::SetSimpleListenerInIO, type, args);\n}\n\ntemplate<AtomNetworkDelegate::ResponseEvent type>\nvoid WebRequest::SetResponseListener(mate::Arguments* args) {\n  SetListener<AtomNetworkDelegate::ResponseListener>(\n      &AtomNetworkDelegate::SetResponseListenerInIO, type, args);\n}\n\ntemplate<typename Listener, typename Method, typename Event>\nvoid WebRequest::SetListener(Method method, Event type, mate::Arguments* args) {\n  \/\/ { urls }.\n  URLPatterns patterns;\n  mate::Dictionary dict;\n  args->GetNext(&dict) && dict.Get(\"urls\", &patterns);\n\n  \/\/ Function or null.\n  v8::Local<v8::Value> value;\n  Listener listener;\n  if (!args->GetNext(&listener) &&\n      !(args->GetNext(&value) && value->IsNull())) {\n    args->ThrowError(\"Must pass null or a Function\");\n    return;\n  }\n\n  auto delegate = browser_context_->network_delegate();\n  BrowserThread::PostTask(BrowserThread::IO, FROM_HERE,\n                          base::Bind(method, base::Unretained(delegate), type,\n                                     patterns, listener));\n}\n\n\/\/ static\nmate::Handle<WebRequest> WebRequest::Create(\n    v8::Isolate* isolate,\n    AtomBrowserContext* browser_context) {\n  return mate::CreateHandle(isolate, new WebRequest(isolate, browser_context));\n}\n\n\/\/ static\nvoid WebRequest::BuildPrototype(v8::Isolate* isolate,\n                                v8::Local<v8::FunctionTemplate> prototype) {\n  prototype->SetClassName(mate::StringToV8(isolate, \"WebRequest\"));\n  mate::ObjectTemplateBuilder(isolate, prototype->PrototypeTemplate())\n      .SetMethod(\"onBeforeRequest\",\n                 &WebRequest::SetResponseListener<\n                    AtomNetworkDelegate::kOnBeforeRequest>)\n      .SetMethod(\"onBeforeSendHeaders\",\n                 &WebRequest::SetResponseListener<\n                    AtomNetworkDelegate::kOnBeforeSendHeaders>)\n      .SetMethod(\"onHeadersReceived\",\n                 &WebRequest::SetResponseListener<\n                    AtomNetworkDelegate::kOnHeadersReceived>)\n      .SetMethod(\"onSendHeaders\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnSendHeaders>)\n      .SetMethod(\"onBeforeRedirect\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnBeforeRedirect>)\n      .SetMethod(\"onResponseStarted\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnResponseStarted>)\n      .SetMethod(\"onCompleted\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnCompleted>)\n      .SetMethod(\"onErrorOccurred\",\n                 &WebRequest::SetSimpleListener<\n                    AtomNetworkDelegate::kOnErrorOccurred>)\n      .SetMethod(\"fetch\",\n                 &WebRequest::Fetch);\n}\n\n}  \/\/ namespace api\n\n}  \/\/ namespace atom\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\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 \"mitkLevelWindowManager.h\"\n#include <itkCommand.h>\n#include \"mitkDataStorage.h\"\n#include \"mitkNodePredicateBase.h\"\n#include \"mitkNodePredicateProperty.h\"\n#include \"mitkNodePredicateDataType.h\"\n#include \"mitkNodePredicateAnd.h\"\n#include \"mitkNodePredicateOr.h\"\n#include \"mitkNodePredicateNot.h\"\n#include \"mitkProperties.h\"\n#include \"mitkMessage.h\"\n\n\nmitk::LevelWindowManager::LevelWindowManager()\n: m_DataStorage(NULL), m_LevelWindowProperty(NULL), m_AutoTopMost(true),\n  m_IsObserverTagSet(false), m_CurrentImage(NULL),m_IsPropertyModifiedTagSet(false)\n{\n}\n\n\nmitk::LevelWindowManager::~LevelWindowManager()\n{\n  if (m_DataStorage.IsNotNull())\n  {\n    m_DataStorage->AddNodeEvent.RemoveListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageChanged ));\n    m_DataStorage->RemoveNodeEvent.RemoveListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageRemovedNode ));\n    m_DataStorage = NULL;\n  }\n  if (m_IsPropertyModifiedTagSet && m_LevelWindowProperty.IsNotNull())\n  {\n    m_LevelWindowProperty->RemoveObserver(m_PropertyModifiedTag);\n    m_IsPropertyModifiedTagSet = false;\n  }\n  for( std::map<unsigned long, mitk::BaseProperty::Pointer>::iterator iter = m_PropObserverToNode.begin(); iter != m_PropObserverToNode.end(); iter++ ) {\n    (*iter).second->RemoveObserver((*iter).first);\n  }\n  for( std::map<unsigned long, mitk::BaseProperty::Pointer>::iterator iter = m_PropObserverToNode2.begin(); iter != m_PropObserverToNode2.end(); iter++ ) {\n    (*iter).second->RemoveObserver((*iter).first);\n  }\n}\n\n\nvoid mitk::LevelWindowManager::SetDataStorage( mitk::DataStorage* ds )\n{\n  if (ds == NULL)\n    return;\n\n  \/* remove listeners of old DataStorage *\/\n  if (m_DataStorage.IsNotNull())\n  {\n    m_DataStorage->AddNodeEvent.RemoveListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageChanged ));\n    m_DataStorage->RemoveNodeEvent.RemoveListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageRemovedNode ));\n  }\n  \/* register listener for new DataStorage *\/\n  m_DataStorage = ds;  \/\/ register \n  m_DataStorage->AddNodeEvent.AddListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageChanged ));\n  m_DataStorage->RemoveNodeEvent.AddListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageRemovedNode ));\n  this->DataStorageChanged(); \/\/ update us with new DataStorage\n}\n\n\nvoid mitk::LevelWindowManager::OnPropertyModified(const itk::EventObject& )\n{\n  Modified();\n}\n\n\nvoid mitk::LevelWindowManager::SetAutoTopMostImage(bool autoTopMost, const mitk::DataNode* removedNode)\n{\n  m_AutoTopMost = autoTopMost;\n  if (m_AutoTopMost == false)\n    return;\n\n  if (m_IsPropertyModifiedTagSet && m_LevelWindowProperty.IsNotNull())\n  {\n    m_LevelWindowProperty->RemoveObserver(m_PropertyModifiedTag);\n    m_IsPropertyModifiedTagSet = false;\n  }\n  \/* search topmost image *\/\n  if (m_DataStorage.IsNull())\n  {\n    itkExceptionMacro(\"DataStorage not set\");\n  }\n  int maxLayer = itk::NumericTraits<int>::min();\n  m_LevelWindowProperty = NULL;\n\n  mitk::DataStorage::SetOfObjects::ConstPointer all = this->GetRelevantNodes();\n  for (mitk::DataStorage::SetOfObjects::ConstIterator it = all->Begin(); it != all->End(); ++it)\n  {\n    mitk::DataNode::Pointer node = it->Value();\n    if (node.IsNull() || (removedNode != NULL && node == removedNode))\n      continue;\n    if (node->IsVisible(NULL) == false)\n      continue;\n    int layer = 0;\n    node->GetIntProperty(\"layer\", layer);\n    if ( layer < maxLayer )\n      continue;\n    mitk::LevelWindowProperty::Pointer levelWindowProperty = dynamic_cast<mitk::LevelWindowProperty*>(node->GetProperty(\"levelwindow\"));\n    if (levelWindowProperty.IsNull())\n      continue;\n    m_LevelWindowProperty = levelWindowProperty;\n    m_CurrentImage = dynamic_cast<mitk::Image*>(node->GetData());\n    maxLayer = layer;\n  }\n  Modified();\n}\n\n\/\/ sets an specific LevelWindowProperty, all changes will affect the image belonging to this property.\n\/\/ sets m_AutoTopMost to false\nvoid mitk::LevelWindowManager::SetLevelWindowProperty(LevelWindowProperty::Pointer levelWindowProperty)\n{\n  if (levelWindowProperty.IsNull())\n    return;\n\n  if (m_IsPropertyModifiedTagSet)  \/\/ remove listener for old property\n  {\n    m_LevelWindowProperty->RemoveObserver(m_PropertyModifiedTag);\n    m_IsPropertyModifiedTagSet = false;\n  }\n  m_LevelWindowProperty = levelWindowProperty;\n\n  itk::ReceptorMemberCommand<LevelWindowManager>::Pointer command = itk::ReceptorMemberCommand<LevelWindowManager>::New();  \/\/ register listener for new property\n  command->SetCallbackFunction(this, &LevelWindowManager::OnPropertyModified);\n  m_PropertyModifiedTag = m_LevelWindowProperty->AddObserver( itk::ModifiedEvent(), command );\n  m_IsPropertyModifiedTagSet = true;\n  m_AutoTopMost = false;\n\n  \/* search image than belongs to the property *\/\n  mitk::NodePredicateProperty::Pointer p = mitk::NodePredicateProperty::New(\"levelwindow\", m_LevelWindowProperty);\n  mitk::DataNode* n = m_DataStorage->GetNode(p);\n  if (n == NULL)\n  {\n    itkExceptionMacro(\"No Image in DataStorage that belongs to LevelWindow property \" << m_LevelWindowProperty);\n  }\n  m_CurrentImage = dynamic_cast<mitk::Image*>(n->GetData());\n  this->Modified();\n}\n\n\n\/\/ returns the current mitkLevelWindowProperty object from the image that is affected by changes\nmitk::LevelWindowProperty::Pointer mitk::LevelWindowManager::GetLevelWindowProperty()\n{\n  return m_LevelWindowProperty;\n}\n\n\n\/\/ returns Level\/Window values for the current image\nconst mitk::LevelWindow& mitk::LevelWindowManager::GetLevelWindow()\n{\n  if (m_LevelWindowProperty.IsNotNull())\n    return m_LevelWindowProperty->GetLevelWindow();\n  else\n  {\n    itkExceptionMacro(\"No LevelWindow available!\");\n  }\n}\n\n\/\/ sets new Level\/Window values and informs all listeners about changes\nvoid mitk::LevelWindowManager::SetLevelWindow(const mitk::LevelWindow& levelWindow)\n{\n  if (m_LevelWindowProperty.IsNotNull())\n  {\n    m_LevelWindowProperty->SetLevelWindow(levelWindow);\n  }\n  this->Modified();\n}\n\nvoid mitk::LevelWindowManager::DataStorageChanged( const mitk::DataNode* )\n{\n  this->DataStorageRemovedNode();\n}\nvoid mitk::LevelWindowManager::DataStorageRemovedNode( const mitk::DataNode* removedNode )\n{\n  \/* remove old observers *\/\n  for (ObserverToPropertyMap::iterator iter = m_PropObserverToNode.begin(); iter != m_PropObserverToNode.end(); iter++ ) \n    (*iter).second->RemoveObserver((*iter).first);\n  m_PropObserverToNode.clear();\n\n  for (ObserverToPropertyMap::iterator iter = m_PropObserverToNode2.begin(); iter != m_PropObserverToNode2.end(); iter++ ) \n    (*iter).second->RemoveObserver((*iter).first);\n  m_PropObserverToNode2.clear();\n\n  if (m_DataStorage.IsNull())\n  {\n    itkExceptionMacro(\"DataStorage not set\");\n  }\n\n  \/* listen to changes  in visible property of all images *\/\n\n  mitk::DataStorage::SetOfObjects::ConstPointer all = this->GetRelevantNodes();\n  for (mitk::DataStorage::SetOfObjects::ConstIterator it = all->Begin(); it != all->End(); ++it)\n  {\n    if (it->Value().IsNull())\n      continue;\n    \/* register listener for changes in visible property *\/\n    itk::ReceptorMemberCommand<LevelWindowManager>::Pointer command = itk::ReceptorMemberCommand<LevelWindowManager>::New();\n    command->SetCallbackFunction(this, &LevelWindowManager::Update);\n    m_PropObserverToNode[it->Value()->GetProperty(\"visible\")->AddObserver( itk::ModifiedEvent(), command )] = it->Value()->GetProperty(\"visible\");\n  }\n\n  \/* listen to changes  in layer property of all images *\/\n\n  for (mitk::DataStorage::SetOfObjects::ConstIterator it = all->Begin(); it != all->End(); ++it)\n  {\n    if (it->Value().IsNull())\n      continue;\n    \/* register listener for changes in layer property *\/\n    itk::ReceptorMemberCommand<LevelWindowManager>::Pointer command2 = itk::ReceptorMemberCommand<LevelWindowManager>::New();\n    command2->SetCallbackFunction(this, &LevelWindowManager::Update);\n    m_PropObserverToNode2[it->Value()->GetProperty(\"layer\")->AddObserver( itk::ModifiedEvent(), command2 )] = it->Value()->GetProperty(\"layer\");\n  }\n\n  \/* search image than belongs to the property *\/\n  if (m_LevelWindowProperty.IsNull())\n    SetAutoTopMostImage(true, removedNode);\n  else\n  {\n    mitk::NodePredicateProperty::Pointer p2 = mitk::NodePredicateProperty::New(\"levelwindow\", m_LevelWindowProperty);\n    mitk::DataNode* n = m_DataStorage->GetNode(p2);\n    if (n == NULL || m_AutoTopMost) \/\/ if node was deleted, change our behaviour to AutoTopMost, if AutoTopMost is true change level window to topmost node\n      SetAutoTopMostImage(true, removedNode);\n   }\n}\n\n\nmitk::DataStorage* mitk::LevelWindowManager::GetDataStorage()\n{\n  return m_DataStorage.GetPointer();\n}\n\n\n\/\/ true if changes on slider or line-edits will affect always the topmost layer image\nbool mitk::LevelWindowManager::isAutoTopMost()\n{\n  return m_AutoTopMost;\n}\n\n\nvoid mitk::LevelWindowManager::Update(const itk::EventObject&)  \/\/ visible property of a image has changed\n{\n  if (m_AutoTopMost)\n  {\n    SetAutoTopMostImage(true);\n    return;\n  }\n  mitk::DataStorage::SetOfObjects::ConstPointer all = this->GetRelevantNodes();\n  for (mitk::DataStorage::SetOfObjects::ConstIterator it = all->Begin(); it != all->End(); ++it)\n  {\n    mitk::DataNode::Pointer node = it->Value();\n    if (node.IsNull())\n      continue;\n    if (node->IsVisible(NULL) == false)\n      continue;\n    mitk::LevelWindowProperty::Pointer levelWindowProperty = dynamic_cast<mitk::LevelWindowProperty*>(node->GetProperty(\"levelwindow\"));\n    if (levelWindowProperty.IsNull())\n      continue;\n    m_LevelWindowProperty = levelWindowProperty;\n    m_CurrentImage = dynamic_cast<mitk::Image*>(node->GetData());\n    if (m_LevelWindowProperty.IsNull() && m_LevelWindowProperty.GetPointer() == levelWindowProperty) \/\/ we found our m_LevelWindowProperty\n    {\n      return;\n    }\n  }\n  Modified();\n}\n\n\nmitk::DataStorage::SetOfObjects::ConstPointer mitk::LevelWindowManager::GetRelevantNodes()\n{\n  if (m_DataStorage.IsNull())\n    return mitk::DataStorage::SetOfObjects::ConstPointer(mitk::DataStorage::SetOfObjects::New());  \/\/ return empty set\n\n  mitk::BoolProperty::Pointer trueProp = mitk::BoolProperty::New(true);\n  mitk::NodePredicateProperty::Pointer notBinary = mitk::NodePredicateProperty::New(\"binary\", mitk::BoolProperty::New(false));\n  mitk::NodePredicateProperty::Pointer hasLevelWindow = mitk::NodePredicateProperty::New(\"levelwindow\", NULL);\n  \n  mitk::NodePredicateDataType::Pointer isImage = mitk::NodePredicateDataType::New(\"Image\");\n  mitk::NodePredicateDataType::Pointer isDImage = mitk::NodePredicateDataType::New(\"DiffusionImage\");\n  mitk::NodePredicateDataType::Pointer isTImage = mitk::NodePredicateDataType::New(\"TensorImage\");\n  mitk::NodePredicateDataType::Pointer isQImage = mitk::NodePredicateDataType::New(\"QBallImage\");\n  mitk::NodePredicateOr::Pointer predicateTypes = mitk::NodePredicateOr::New();\n  predicateTypes->AddPredicate(isImage);\n  predicateTypes->AddPredicate(isDImage);\n  predicateTypes->AddPredicate(isTImage);\n  predicateTypes->AddPredicate(isQImage);\n  \n  mitk::NodePredicateAnd::Pointer predicate = mitk::NodePredicateAnd::New();\n  predicate->AddPredicate(notBinary);\n  predicate->AddPredicate(hasLevelWindow); \n  predicate->AddPredicate(predicateTypes);\n\n  mitk::DataStorage::SetOfObjects::ConstPointer relevantNodes = m_DataStorage->GetSubset( predicate );\n  return relevantNodes; \n}\n\n\nmitk::Image* mitk::LevelWindowManager::GetCurrentImage()\n{\n  return m_CurrentImage;\n}\n<commit_msg>setting property for levelWindow editing on correct node<commit_after>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\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 \"mitkLevelWindowManager.h\"\n#include <itkCommand.h>\n#include \"mitkDataStorage.h\"\n#include \"mitkNodePredicateBase.h\"\n#include \"mitkNodePredicateProperty.h\"\n#include \"mitkNodePredicateDataType.h\"\n#include \"mitkNodePredicateAnd.h\"\n#include \"mitkNodePredicateOr.h\"\n#include \"mitkNodePredicateNot.h\"\n#include \"mitkProperties.h\"\n#include \"mitkMessage.h\"\n\n\nmitk::LevelWindowManager::LevelWindowManager()\n: m_DataStorage(NULL), m_LevelWindowProperty(NULL), m_AutoTopMost(true),\n  m_IsObserverTagSet(false), m_CurrentImage(NULL),m_IsPropertyModifiedTagSet(false)\n{\n}\n\n\nmitk::LevelWindowManager::~LevelWindowManager()\n{\n  if (m_DataStorage.IsNotNull())\n  {\n    m_DataStorage->AddNodeEvent.RemoveListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageChanged ));\n    m_DataStorage->RemoveNodeEvent.RemoveListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageRemovedNode ));\n    m_DataStorage = NULL;\n  }\n  if (m_IsPropertyModifiedTagSet && m_LevelWindowProperty.IsNotNull())\n  {\n    m_LevelWindowProperty->RemoveObserver(m_PropertyModifiedTag);\n    m_IsPropertyModifiedTagSet = false;\n  }\n  for( std::map<unsigned long, mitk::BaseProperty::Pointer>::iterator iter = m_PropObserverToNode.begin(); iter != m_PropObserverToNode.end(); iter++ ) {\n    (*iter).second->RemoveObserver((*iter).first);\n  }\n  for( std::map<unsigned long, mitk::BaseProperty::Pointer>::iterator iter = m_PropObserverToNode2.begin(); iter != m_PropObserverToNode2.end(); iter++ ) {\n    (*iter).second->RemoveObserver((*iter).first);\n  }\n}\n\n\nvoid mitk::LevelWindowManager::SetDataStorage( mitk::DataStorage* ds )\n{\n  if (ds == NULL)\n    return;\n\n  \/* remove listeners of old DataStorage *\/\n  if (m_DataStorage.IsNotNull())\n  {\n    m_DataStorage->AddNodeEvent.RemoveListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageChanged ));\n    m_DataStorage->RemoveNodeEvent.RemoveListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageRemovedNode ));\n  }\n  \/* register listener for new DataStorage *\/\n  m_DataStorage = ds;  \/\/ register \n  m_DataStorage->AddNodeEvent.AddListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageChanged ));\n  m_DataStorage->RemoveNodeEvent.AddListener(MessageDelegate1<LevelWindowManager, const mitk::DataNode*>( this, &LevelWindowManager::DataStorageRemovedNode ));\n  this->DataStorageChanged(); \/\/ update us with new DataStorage\n}\n\n\nvoid mitk::LevelWindowManager::OnPropertyModified(const itk::EventObject& )\n{\n  Modified();\n}\n\n\nvoid mitk::LevelWindowManager::SetAutoTopMostImage(bool autoTopMost, const mitk::DataNode* removedNode)\n{\n  m_AutoTopMost = autoTopMost;\n  if (m_AutoTopMost == false)\n    return;\n\n  if (m_IsPropertyModifiedTagSet && m_LevelWindowProperty.IsNotNull())\n  {\n    m_LevelWindowProperty->RemoveObserver(m_PropertyModifiedTag);\n    m_IsPropertyModifiedTagSet = false;\n  }\n  \/* search topmost image *\/\n  if (m_DataStorage.IsNull())\n  {\n    itkExceptionMacro(\"DataStorage not set\");\n  }\n  int maxLayer = itk::NumericTraits<int>::min();\n  m_LevelWindowProperty = NULL;\n\n  mitk::DataStorage::SetOfObjects::ConstPointer all = this->GetRelevantNodes();\n  for (mitk::DataStorage::SetOfObjects::ConstIterator it = all->Begin(); it != all->End(); ++it)\n  {\n    mitk::DataNode::Pointer node = it->Value();\n    if (node.IsNull() || (removedNode != NULL && node == removedNode))\n      continue;\n\n    node->SetBoolProperty( \"imageForLevelWindow\", false );\n\n    if (node->IsVisible(NULL) == false)\n      continue;\n    \n    int layer = 0;\n    node->GetIntProperty(\"layer\", layer);\n    if ( layer < maxLayer )\n      continue;\n    mitk::LevelWindowProperty::Pointer levelWindowProperty = dynamic_cast<mitk::LevelWindowProperty*>(node->GetProperty(\"levelwindow\"));\n    if (levelWindowProperty.IsNull())\n      continue;\n    m_LevelWindowProperty = levelWindowProperty;\n    m_CurrentImage = dynamic_cast<mitk::Image*>(node->GetData());\n    node->SetBoolProperty( \"imageForLevelWindow\", true );\n    \n    maxLayer = layer;\n  }\n  Modified();\n}\n\n\/\/ sets an specific LevelWindowProperty, all changes will affect the image belonging to this property.\n\/\/ sets m_AutoTopMost to false\nvoid mitk::LevelWindowManager::SetLevelWindowProperty(LevelWindowProperty::Pointer levelWindowProperty)\n{\n  if (levelWindowProperty.IsNull())\n    return;\n\n  if (m_IsPropertyModifiedTagSet)  \/\/ remove listener for old property\n  {\n    m_LevelWindowProperty->RemoveObserver(m_PropertyModifiedTag);\n    m_IsPropertyModifiedTagSet = false;\n  }\n  m_LevelWindowProperty = levelWindowProperty;\n\n  itk::ReceptorMemberCommand<LevelWindowManager>::Pointer command = itk::ReceptorMemberCommand<LevelWindowManager>::New();  \/\/ register listener for new property\n  command->SetCallbackFunction(this, &LevelWindowManager::OnPropertyModified);\n  m_PropertyModifiedTag = m_LevelWindowProperty->AddObserver( itk::ModifiedEvent(), command );\n  m_IsPropertyModifiedTagSet = true;\n  m_AutoTopMost = false;\n\n  \/* search image than belongs to the property *\/\n  mitk::NodePredicateProperty::Pointer p = mitk::NodePredicateProperty::New(\"levelwindow\", m_LevelWindowProperty);\n  mitk::DataNode* n = m_DataStorage->GetNode(p);\n  if (n == NULL)\n  {\n    itkExceptionMacro(\"No Image in DataStorage that belongs to LevelWindow property \" << m_LevelWindowProperty);\n  }\n  m_CurrentImage = dynamic_cast<mitk::Image*>(n->GetData());\n  n->SetBoolProperty( \"imageForLevelWindow\", true );\n  this->Modified();\n}\n\n\n\/\/ returns the current mitkLevelWindowProperty object from the image that is affected by changes\nmitk::LevelWindowProperty::Pointer mitk::LevelWindowManager::GetLevelWindowProperty()\n{\n  return m_LevelWindowProperty;\n}\n\n\n\/\/ returns Level\/Window values for the current image\nconst mitk::LevelWindow& mitk::LevelWindowManager::GetLevelWindow()\n{\n  if (m_LevelWindowProperty.IsNotNull())\n    return m_LevelWindowProperty->GetLevelWindow();\n  else\n  {\n    itkExceptionMacro(\"No LevelWindow available!\");\n  }\n}\n\n\/\/ sets new Level\/Window values and informs all listeners about changes\nvoid mitk::LevelWindowManager::SetLevelWindow(const mitk::LevelWindow& levelWindow)\n{\n  if (m_LevelWindowProperty.IsNotNull())\n  {\n    m_LevelWindowProperty->SetLevelWindow(levelWindow);\n  }\n  this->Modified();\n}\n\nvoid mitk::LevelWindowManager::DataStorageChanged( const mitk::DataNode* )\n{\n  this->DataStorageRemovedNode();\n}\nvoid mitk::LevelWindowManager::DataStorageRemovedNode( const mitk::DataNode* removedNode )\n{\n  \/* remove old observers *\/\n  for (ObserverToPropertyMap::iterator iter = m_PropObserverToNode.begin(); iter != m_PropObserverToNode.end(); iter++ ) \n    (*iter).second->RemoveObserver((*iter).first);\n  m_PropObserverToNode.clear();\n\n  for (ObserverToPropertyMap::iterator iter = m_PropObserverToNode2.begin(); iter != m_PropObserverToNode2.end(); iter++ ) \n    (*iter).second->RemoveObserver((*iter).first);\n  m_PropObserverToNode2.clear();\n\n  if (m_DataStorage.IsNull())\n  {\n    itkExceptionMacro(\"DataStorage not set\");\n  }\n\n  \/* listen to changes  in visible property of all images *\/\n\n  mitk::DataStorage::SetOfObjects::ConstPointer all = this->GetRelevantNodes();\n  for (mitk::DataStorage::SetOfObjects::ConstIterator it = all->Begin(); it != all->End(); ++it)\n  {\n    if (it->Value().IsNull())\n      continue;\n    \/* register listener for changes in visible property *\/\n    itk::ReceptorMemberCommand<LevelWindowManager>::Pointer command = itk::ReceptorMemberCommand<LevelWindowManager>::New();\n    command->SetCallbackFunction(this, &LevelWindowManager::Update);\n    m_PropObserverToNode[it->Value()->GetProperty(\"visible\")->AddObserver( itk::ModifiedEvent(), command )] = it->Value()->GetProperty(\"visible\");\n  }\n\n  \/* listen to changes  in layer property of all images *\/\n\n  for (mitk::DataStorage::SetOfObjects::ConstIterator it = all->Begin(); it != all->End(); ++it)\n  {\n    if (it->Value().IsNull())\n      continue;\n    \/* register listener for changes in layer property *\/\n    itk::ReceptorMemberCommand<LevelWindowManager>::Pointer command2 = itk::ReceptorMemberCommand<LevelWindowManager>::New();\n    command2->SetCallbackFunction(this, &LevelWindowManager::Update);\n    m_PropObserverToNode2[it->Value()->GetProperty(\"layer\")->AddObserver( itk::ModifiedEvent(), command2 )] = it->Value()->GetProperty(\"layer\");\n  }\n\n  \/* search image than belongs to the property *\/\n  if (m_LevelWindowProperty.IsNull())\n    SetAutoTopMostImage(true, removedNode);\n  else\n  {\n    mitk::NodePredicateProperty::Pointer p2 = mitk::NodePredicateProperty::New(\"levelwindow\", m_LevelWindowProperty);\n    mitk::DataNode* n = m_DataStorage->GetNode(p2);\n    if (n == NULL || m_AutoTopMost) \/\/ if node was deleted, change our behaviour to AutoTopMost, if AutoTopMost is true change level window to topmost node\n      SetAutoTopMostImage(true, removedNode);\n   }\n}\n\n\nmitk::DataStorage* mitk::LevelWindowManager::GetDataStorage()\n{\n  return m_DataStorage.GetPointer();\n}\n\n\n\/\/ true if changes on slider or line-edits will affect always the topmost layer image\nbool mitk::LevelWindowManager::isAutoTopMost()\n{\n  return m_AutoTopMost;\n}\n\n\nvoid mitk::LevelWindowManager::Update(const itk::EventObject&)  \/\/ visible property of a image has changed\n{\n  if (m_AutoTopMost)\n  {\n    SetAutoTopMostImage(true);\n    return;\n  }\n  mitk::DataStorage::SetOfObjects::ConstPointer all = this->GetRelevantNodes();\n  for (mitk::DataStorage::SetOfObjects::ConstIterator it = all->Begin(); it != all->End(); ++it)\n  {\n    mitk::DataNode::Pointer node = it->Value();\n    if (node.IsNull())\n      continue;\n\n    node->SetBoolProperty( \"imageForLevelWindow\", false );\n\n    if (node->IsVisible(NULL) == false)\n      continue;\n\n    mitk::LevelWindowProperty::Pointer levelWindowProperty = dynamic_cast<mitk::LevelWindowProperty*>(node->GetProperty(\"levelwindow\"));\n    if (levelWindowProperty.IsNull())\n      continue;\n    m_LevelWindowProperty = levelWindowProperty;\n    m_CurrentImage = dynamic_cast<mitk::Image*>(node->GetData());\n    node->SetBoolProperty( \"imageForLevelWindow\", true );\n    if (m_LevelWindowProperty.IsNull() && m_LevelWindowProperty.GetPointer() == levelWindowProperty) \/\/ we found our m_LevelWindowProperty\n    {\n      return;\n    }\n  }\n  Modified();\n}\n\n\nmitk::DataStorage::SetOfObjects::ConstPointer mitk::LevelWindowManager::GetRelevantNodes()\n{\n  if (m_DataStorage.IsNull())\n    return mitk::DataStorage::SetOfObjects::ConstPointer(mitk::DataStorage::SetOfObjects::New());  \/\/ return empty set\n\n  mitk::BoolProperty::Pointer trueProp = mitk::BoolProperty::New(true);\n  mitk::NodePredicateProperty::Pointer notBinary = mitk::NodePredicateProperty::New(\"binary\", mitk::BoolProperty::New(false));\n  mitk::NodePredicateProperty::Pointer hasLevelWindow = mitk::NodePredicateProperty::New(\"levelwindow\", NULL);\n  \n  mitk::NodePredicateDataType::Pointer isImage = mitk::NodePredicateDataType::New(\"Image\");\n  mitk::NodePredicateDataType::Pointer isDImage = mitk::NodePredicateDataType::New(\"DiffusionImage\");\n  mitk::NodePredicateDataType::Pointer isTImage = mitk::NodePredicateDataType::New(\"TensorImage\");\n  mitk::NodePredicateDataType::Pointer isQImage = mitk::NodePredicateDataType::New(\"QBallImage\");\n  mitk::NodePredicateOr::Pointer predicateTypes = mitk::NodePredicateOr::New();\n  predicateTypes->AddPredicate(isImage);\n  predicateTypes->AddPredicate(isDImage);\n  predicateTypes->AddPredicate(isTImage);\n  predicateTypes->AddPredicate(isQImage);\n  \n  mitk::NodePredicateAnd::Pointer predicate = mitk::NodePredicateAnd::New();\n  predicate->AddPredicate(notBinary);\n  predicate->AddPredicate(hasLevelWindow); \n  predicate->AddPredicate(predicateTypes);\n\n  mitk::DataStorage::SetOfObjects::ConstPointer relevantNodes = m_DataStorage->GetSubset( predicate );\n  return relevantNodes; \n}\n\n\nmitk::Image* mitk::LevelWindowManager::GetCurrentImage()\n{\n  return m_CurrentImage;\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_VERTEX_HPP\n#define MAPNIK_VERTEX_HPP\n\n#include <sstream>\n\nnamespace mapnik\n{\n\nenum CommandType {\n    SEG_END   =0,\n    SEG_MOVETO=1,\n    SEG_LINETO=2,\n    SEG_CLOSE =3\n};\n\ntemplate <typename T,int dim>\nstruct vertex {\n    typedef T coord_type;\n};\n\ntemplate <typename T>\nstruct vertex<T,2>\n{\n    enum no_init_t { no_init };\n\n    typedef T coord_type;\n    coord_type x;\n    coord_type y;\n    unsigned cmd;\n\n    vertex()\n        : x(0),y(0),cmd(SEG_END) {}\n\n    explicit vertex(no_init_t)\n        {}\n\n    vertex(coord_type x,coord_type y,unsigned cmd)\n        : x(x),y(y),cmd(cmd) {}\n\n    template <typename T2>\n    vertex(const vertex<T2,2>& rhs)\n        : x(coord_type(rhs.x)),\n          y(coord_type(rhs.y)),\n          cmd(rhs.cmd) {}\n\n    template <typename T2> vertex<T,2> operator=(const vertex<T2,2>& rhs)\n    {\n        if (&cmd != &rhs.cmd)\n        {\n            x = coord_type(rhs.x);\n            y = coord_type(rhs.y);\n            cmd = rhs.cmd;\n        }\n        return *this;\n    }\n};\n\ntypedef vertex<double,2> vertex2d;\ntypedef vertex<int,2> vertex2i;\n\ntemplate <class charT,class traits,class T,int dim>\ninline std::basic_ostream<charT,traits>&\noperator << (std::basic_ostream<charT,traits>& out,\n             const vertex<T,dim>& c);\n\ntemplate <class charT,class traits,class T>\ninline std::basic_ostream<charT,traits>&\noperator << (std::basic_ostream<charT,traits>& out,\n             const vertex<T,2>& v)\n{\n    std::basic_ostringstream<charT,traits> s;\n    s.copyfmt(out);\n    s.width(0);\n    switch (v.cmd)\n    {\n        case SEG_END: s << \"End \"; break;\n        case SEG_MOVETO: s << \"MoveTo \"; break;\n        case SEG_LINETO: s << \"LineTo \"; break;\n        case SEG_CLOSE: s << \"Close \"; break;\n    }\n    s << \"(\" << v.x << \", \" << v.y << \")\";\n    return out << s.str();\n}\n\ntemplate <class charT,class traits,class T>\ninline std::basic_ostream<charT,traits>&\noperator << (std::basic_ostream<charT,traits>& out,\n             const vertex<T,3>& v)\n{\n    std::basic_ostringstream<charT,traits> s;\n    s.copyfmt(out);\n    s.width(0);\n    s<<\"vertex3(\"<<v.x<<\",\"<<v.y<<\",\"<<v.z<<\",cmd=\"<<v.cmd<<\")\";\n    out << s.str();\n    return out;\n}\n\n}\n\n#endif \/\/ MAPNIK_VERTEX_HPP\n<commit_msg>+ fix SEG_CLOSE value to be compatible with agg<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_VERTEX_HPP\n#define MAPNIK_VERTEX_HPP\n\n#include <sstream>\n\nnamespace mapnik\n{\n\nenum CommandType {\n    SEG_END    = 0,\n    SEG_MOVETO = 1,\n    SEG_LINETO = 2,\n    SEG_CLOSE = (0x40 | 0x0f)\n};\n\ntemplate <typename T,int dim>\nstruct vertex {\n    typedef T coord_type;\n};\n\ntemplate <typename T>\nstruct vertex<T,2>\n{\n    enum no_init_t { no_init };\n\n    typedef T coord_type;\n    coord_type x;\n    coord_type y;\n    unsigned cmd;\n\n    vertex()\n        : x(0),y(0),cmd(SEG_END) {}\n\n    explicit vertex(no_init_t)\n        {}\n\n    vertex(coord_type x,coord_type y,unsigned cmd)\n        : x(x),y(y),cmd(cmd) {}\n\n    template <typename T2>\n    vertex(const vertex<T2,2>& rhs)\n        : x(coord_type(rhs.x)),\n          y(coord_type(rhs.y)),\n          cmd(rhs.cmd) {}\n\n    template <typename T2> vertex<T,2> operator=(const vertex<T2,2>& rhs)\n    {\n        if (&cmd != &rhs.cmd)\n        {\n            x = coord_type(rhs.x);\n            y = coord_type(rhs.y);\n            cmd = rhs.cmd;\n        }\n        return *this;\n    }\n};\n\ntypedef vertex<double,2> vertex2d;\ntypedef vertex<int,2> vertex2i;\n\ntemplate <class charT,class traits,class T,int dim>\ninline std::basic_ostream<charT,traits>&\noperator << (std::basic_ostream<charT,traits>& out,\n             const vertex<T,dim>& c);\n\ntemplate <class charT,class traits,class T>\ninline std::basic_ostream<charT,traits>&\noperator << (std::basic_ostream<charT,traits>& out,\n             const vertex<T,2>& v)\n{\n    std::basic_ostringstream<charT,traits> s;\n    s.copyfmt(out);\n    s.width(0);\n    switch (v.cmd)\n    {\n        case SEG_END: s << \"End \"; break;\n        case SEG_MOVETO: s << \"MoveTo \"; break;\n        case SEG_LINETO: s << \"LineTo \"; break;\n        case SEG_CLOSE: s << \"Close \"; break;\n    }\n    s << \"(\" << v.x << \", \" << v.y << \")\";\n    return out << s.str();\n}\n\ntemplate <class charT,class traits,class T>\ninline std::basic_ostream<charT,traits>&\noperator << (std::basic_ostream<charT,traits>& out,\n             const vertex<T,3>& v)\n{\n    std::basic_ostringstream<charT,traits> s;\n    s.copyfmt(out);\n    s.width(0);\n    s<<\"vertex3(\"<<v.x<<\",\"<<v.y<<\",\"<<v.z<<\",cmd=\"<<v.cmd<<\")\";\n    out << s.str();\n    return out;\n}\n\n}\n\n#endif \/\/ MAPNIK_VERTEX_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file\n\/\/\/ \\ingroup tutorial_legacy\n\/\/\/ Example of TTasks.\n\/\/\/ Create a hierarchy of objects derived from TTask in library Mytasks\n\/\/\/ Show the tasks in a browser.\n\/\/\/ To execute a Task, use the context context menu and select\n\/\/\/ the item \"ExecuteTask\"\n\/\/\/ see also other functions in the TTask context menu, such as\n\/\/\/  - setting a breakpoint in one or more tasks\n\/\/\/  - enabling\/disabling one task, etc\n\/\/\/\n\/\/\/ \\macro_code\n\/\/\/\n\/\/\/ \\author Rene Brun\n\n#ifndef __RUN_TASKS__\n\nvoid tasks()\n{\n   TString dir = gSystem->UnixPathName(__FILE__);\n   dir.ReplaceAll(\"tasks.C\",\"\");\n   dir.ReplaceAll(\"\/.\/\",\"\/\");\n   gROOT->LoadMacro(dir +\"MyTasks.cxx+\");\n\n   gROOT->ProcessLine(\"#define __RUN_TASKS__ 1\");\n   gROOT->ProcessLine(TString(\"#include \\\"\") + dir + \"tasks.C\\\"\");\n   gROOT->ProcessLine(\"runtasks()\");\n   gROOT->ProcessLine(\"#undef __RUN_TASKS__\");\n}\n\n#else\n\nvoid runtasks()\n\/\/void tasks()\n{\n   TTask *run      = new MyRun(\"run\",\"Process one run\");\n   TTask *event    = new MyEvent(\"event\",\"Process one event\");\n   TTask *geomInit = new MyGeomInit(\"geomInit\",\"Geometry Initialisation\");\n   TTask *matInit  = new MyMaterialInit(\"matInit\",\"Materials Initialisation\");\n   TTask *tracker  = new MyTracker(\"tracker\",\"Tracker manager\");\n   TTask *tpc      = new MyRecTPC(\"tpc\",\"TPC Reconstruction\");\n   TTask *its      = new MyRecITS(\"its\",\"ITS Reconstruction\");\n   TTask *muon     = new MyRecMUON(\"muon\",\"MUON Reconstruction\");\n   TTask *phos     = new MyRecPHOS(\"phos\",\"PHOS Reconstruction\");\n   TTask *rich     = new MyRecRICH(\"rich\",\"RICH Reconstruction\");\n   TTask *trd      = new MyRecTRD(\"trd\",\"TRD Reconstruction\");\n   TTask *global   = new MyRecGlobal(\"global\",\"Global Reconstruction\");\n\n   run->Add(geomInit);\n   run->Add(matInit);\n   run->Add(event);\n   event->Add(tracker);\n   event->Add(global);\n   tracker->Add(tpc);\n   tracker->Add(its);\n   tracker->Add(muon);\n   tracker->Add(phos);\n   tracker->Add(rich);\n   tracker->Add(trd);\n\n   gROOT->GetListOfTasks()->Add(run);\n   gROOT->GetListOfBrowsables()->Add(run);\n   new TBrowser;\n}\n\n#endif\n<commit_msg>[tutorials] Explain why tasks.C is legacy (NFC).<commit_after>\/\/\/ \\file\n\/\/\/ \\ingroup tutorial_legacy\n\/\/\/ Example of TTasks.\n\/\/\/ Create a hierarchy of objects derived from TTask in library Mytasks\n\/\/\/ Show the tasks in a browser.\n\/\/\/ To execute a Task, use the context context menu and select\n\/\/\/ the item \"ExecuteTask\"\n\/\/\/ see also other functions in the TTask context menu, such as\n\/\/\/  - setting a breakpoint in one or more tasks\n\/\/\/  - enabling\/disabling one task, etc\n\/\/\/\n\/\/\/ As of 2021, tbb is a fine replacement for ROOT's task system. It\n\/\/\/ offers better interplay with non-ROOT multi-threading use cases.\n\/\/\/\n\/\/\/ \\macro_code\n\/\/\/\n\/\/\/ \\author Rene Brun\n\n#ifndef __RUN_TASKS__\n\nvoid tasks()\n{\n   TString dir = gSystem->UnixPathName(__FILE__);\n   dir.ReplaceAll(\"tasks.C\",\"\");\n   dir.ReplaceAll(\"\/.\/\",\"\/\");\n   gROOT->LoadMacro(dir +\"MyTasks.cxx+\");\n\n   gROOT->ProcessLine(\"#define __RUN_TASKS__ 1\");\n   gROOT->ProcessLine(TString(\"#include \\\"\") + dir + \"tasks.C\\\"\");\n   gROOT->ProcessLine(\"runtasks()\");\n   gROOT->ProcessLine(\"#undef __RUN_TASKS__\");\n}\n\n#else\n\nvoid runtasks()\n\/\/void tasks()\n{\n   TTask *run      = new MyRun(\"run\",\"Process one run\");\n   TTask *event    = new MyEvent(\"event\",\"Process one event\");\n   TTask *geomInit = new MyGeomInit(\"geomInit\",\"Geometry Initialisation\");\n   TTask *matInit  = new MyMaterialInit(\"matInit\",\"Materials Initialisation\");\n   TTask *tracker  = new MyTracker(\"tracker\",\"Tracker manager\");\n   TTask *tpc      = new MyRecTPC(\"tpc\",\"TPC Reconstruction\");\n   TTask *its      = new MyRecITS(\"its\",\"ITS Reconstruction\");\n   TTask *muon     = new MyRecMUON(\"muon\",\"MUON Reconstruction\");\n   TTask *phos     = new MyRecPHOS(\"phos\",\"PHOS Reconstruction\");\n   TTask *rich     = new MyRecRICH(\"rich\",\"RICH Reconstruction\");\n   TTask *trd      = new MyRecTRD(\"trd\",\"TRD Reconstruction\");\n   TTask *global   = new MyRecGlobal(\"global\",\"Global Reconstruction\");\n\n   run->Add(geomInit);\n   run->Add(matInit);\n   run->Add(event);\n   event->Add(tracker);\n   event->Add(global);\n   tracker->Add(tpc);\n   tracker->Add(its);\n   tracker->Add(muon);\n   tracker->Add(phos);\n   tracker->Add(rich);\n   tracker->Add(trd);\n\n   gROOT->GetListOfTasks()->Add(run);\n   gROOT->GetListOfBrowsables()->Add(run);\n   new TBrowser;\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Area - Program that ask the user to enter the height and the width of\n *        triangle and print out the the area.\n *\n * Author - Moses Olawoyin <m.bastford@gmail.com\n * Date - 05 March 2015\n *\/\n\n#include <iostream>\n\n\nint main ( int argc, char *argv[])\n{\n    int width;\n    int height;\n    int area;\n\n    std::cout <<\"Enter the height\" << std::endl;\n    std::cin >> height;\n\n    std::cout <<\"Enter the width\"<< std::endl;\n    std::cin >> width;\n\n    area = (height * width)\/2;\n\n    std::cout << \"The area of the triangle is :\"<< area << std::endl;\n\n    return 0;\n}\n<commit_msg> created function for area calculation. closes #66<commit_after>\/*\n *\n * Area - Program that ask the user to enter the height and the width of\n *        triangle and print out the the area.\n *\n * Author - Moses Olawoyin <m.bastford@gmail.com\n * Date - 05 March 2015\n *\/\n\n#include <iostream>\n\nint calc_area( int width, int height)\n{\n    return (width * height)\/2;\n\n}\n\n\nint main ( int argc, char *argv[])\n{\n    int width;\n    int height;\n    int area;\n\n    std::cout <<\"Enter the height\" << std::endl;\n    std::cin >> height;\n\n    std::cout <<\"Enter the width\"<< std::endl;\n    std::cin >> width;\n\n    area = calc_area(width, height);\n\n    std::cout << \"The area of the triangle is :\"<< area << std::endl;\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <atomic>\n\nnamespace mos {\nnamespace gfx {\n\n\/** Base class for geometric shapes. *\/\nclass Shape {\npublic:\n  Shape();\n  \/** Unique id. *\/\n  unsigned int id() const;\nprivate:\n  static std::atomic_uint current_id_;\n  unsigned int id_;\n};\n\n}\n}\n\n\n\n<commit_msg>Shape default constructor.<commit_after>#pragma once\n\n#include <atomic>\n\nnamespace mos {\nnamespace gfx {\n\n\/** Base class for geometric shapes. *\/\nclass Shape {\npublic:\n  Shape();\n  ~Shape() = default;\n  \/** Unique id. *\/\n  unsigned int id() const;\nprivate:\n  static std::atomic_uint current_id_;\n  unsigned int id_;\n};\n\n}\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n\nYASK: Yet Another Stencil Kernel\nCopyright (c) 2014-2019, Intel Corporation\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to\ndeal in the Software without restriction, including without limitation the\nrights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\nsell copies of the Software, and to permit persons to whom the Software is\nfurnished 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\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\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\nIN THE SOFTWARE.\n\n*****************************************************************************\/\n\n\/\/\/\/\/\/\/\/ Some common code shared between YASK compiler and kernel. \/\/\/\/\/\/\/\/\/\/\n\n\/\/ Include this first to assure NDEBUG is set properly.\n#include \"yask_assert.hpp\"\n\n#include <sstream>\n#include \"common_utils.hpp\"\n\nusing namespace std;\n\nnamespace yask {\n\n    \/\/ Update this version string anytime changes are\n    \/\/ committed to a repository, especially when\n    \/\/ affecting master or develop branches.\n    \/\/ Be sure to keep 2 digits in minor and patch\n    \/\/ fields to allow proper alphanumeric sorting\n    \/\/ for numbers above 9 (at least up to 99).\n\n    \/\/ Format: \"major.minor.patch\".\n    const string version = \"2.19.01\";\n\n    string yask_get_version_string() {\n        return version;\n    }\n\n    \/\/ Controls whether make*Str() functions add\n    \/\/ suffixes or just print full number for\n    \/\/ machine parsing.\n    bool is_suffix_print_enabled = true;\n    \n    \/\/ Return num with SI multiplier and \"iB\" suffix,\n    \/\/ e.g., 412KiB.\n    string makeByteStr(size_t nbytes)\n    {\n        if (!is_suffix_print_enabled)\n            return to_string(nbytes);\n        \n        ostringstream os;\n        double num = double(nbytes);\n        const double oneK = 1024;\n        const double oneM = oneK * oneK;\n        const double oneG = oneK * oneM;\n        const double oneT = oneK * oneG;\n        const double oneP = oneK * oneT;\n        const double oneE = oneK * oneP;\n        if (num > oneE)\n            os << (num \/ oneE) << \"Ei\";\n        else if (num > oneP)\n            os << (num \/ oneP) << \"Pi\";\n        else if (num > oneT)\n            os << (num \/ oneT) << \"Ti\";\n        else if (num > oneG)\n            os << (num \/ oneG) << \"Gi\";\n        else if (num > oneM)\n            os << (num \/ oneM) << \"Mi\";\n        else if (num > oneK)\n            os << (num \/ oneK) << \"Ki\";\n        else\n            os << num;\n        os << \"B\";\n        return os.str();\n    }\n\n    \/\/ Return num with SI multiplier, e.g. \"3.14M\".\n    \/\/ Use this one for rates, etc.\n    string makeNumStr(idx_t num) {\n        if (!is_suffix_print_enabled || (num >= 0 && num < 1000))\n            return to_string(num);\n        return makeNumStr(double(num));\n    }\n    string makeNumStr(double num)\n    {\n        if (!is_suffix_print_enabled)\n            return to_string(num);\n\n        ostringstream os;\n        const double oneK = 1e3;\n        const double oneM = 1e6;\n        const double oneG = 1e9;\n        const double oneT = 1e12;\n        const double oneP = 1e15;\n        const double oneE = 1e18;\n        const double onem = 1e-3;\n        const double oneu = 1e-6;\n        const double onen = 1e-9;\n#ifdef USE_PICO\n        const double onep = 1e-12;\n        const double onef = 1e-15;\n#endif\n        if (num == 0.)\n            os << num;\n        else if (num > oneE)\n            os << (num \/ oneE) << \"E\";\n        else if (num > oneP)\n            os << (num \/ oneP) << \"P\";\n        else if (num > oneT)\n            os << (num \/ oneT) << \"T\";\n        else if (num > oneG)\n            os << (num \/ oneG) << \"G\";\n        else if (num > oneM)\n            os << (num \/ oneM) << \"M\";\n        else if (num > oneK)\n            os << (num \/ oneK) << \"K\"; \/\/ NB: official SI symbol is \"k\".\n#ifdef USE_PICO\n        else if (num < onep)\n            os << (num \/ onef) << \"f\";\n        else if (num < onen)\n            os << (num \/ onep) << \"p\";\n#endif\n        else if (num < oneu)\n            os << (num \/ onen) << \"n\";\n        else if (num < onem)\n            os << (num \/ oneu) << \"u\"; \/\/ NB: official SI symbol is Greek mu.\n        else if (num < 1.)\n            os << (num \/ onem) << \"m\";\n        else\n            os << num;\n        return os.str();\n    }\n\n    \/\/ A var that behaves like OMP_NUM_THREADS.\n    int yask_num_threads[yask_max_levels] = { 0 };\n\n    \/\/ See yask_common_api.hpp for documentation.\n    const char* yask_exception::what() noexcept {\n        return \"yask::yask_exception\\n\";\n    }\n\n    void yask_exception::add_message(const string& arg_msg) {\n        _msg.append(arg_msg);\n    }\n\n    const char* yask_exception::get_message() const {\n        return _msg.c_str();\n    }\n}\n<commit_msg>Update version.<commit_after>\/*****************************************************************************\n\nYASK: Yet Another Stencil Kernel\nCopyright (c) 2014-2019, Intel Corporation\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to\ndeal in the Software without restriction, including without limitation the\nrights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\nsell copies of the Software, and to permit persons to whom the Software is\nfurnished 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\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\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\nIN THE SOFTWARE.\n\n*****************************************************************************\/\n\n\/\/\/\/\/\/\/\/ Some common code shared between YASK compiler and kernel. \/\/\/\/\/\/\/\/\/\/\n\n\/\/ Include this first to assure NDEBUG is set properly.\n#include \"yask_assert.hpp\"\n\n#include <sstream>\n#include \"common_utils.hpp\"\n\nusing namespace std;\n\nnamespace yask {\n\n    \/\/ Update this version string anytime changes are\n    \/\/ committed to a repository, especially when\n    \/\/ affecting master or develop branches.\n    \/\/ Be sure to keep 2 digits in minor and patch\n    \/\/ fields to allow proper alphanumeric sorting\n    \/\/ for numbers above 9 (at least up to 99).\n\n    \/\/ Format: \"major.minor.patch\".\n    const string version = \"2.19.02\";\n\n    string yask_get_version_string() {\n        return version;\n    }\n\n    \/\/ Controls whether make*Str() functions add\n    \/\/ suffixes or just print full number for\n    \/\/ machine parsing.\n    bool is_suffix_print_enabled = true;\n    \n    \/\/ Return num with SI multiplier and \"iB\" suffix,\n    \/\/ e.g., 412KiB.\n    string makeByteStr(size_t nbytes)\n    {\n        if (!is_suffix_print_enabled)\n            return to_string(nbytes);\n        \n        ostringstream os;\n        double num = double(nbytes);\n        const double oneK = 1024;\n        const double oneM = oneK * oneK;\n        const double oneG = oneK * oneM;\n        const double oneT = oneK * oneG;\n        const double oneP = oneK * oneT;\n        const double oneE = oneK * oneP;\n        if (num > oneE)\n            os << (num \/ oneE) << \"Ei\";\n        else if (num > oneP)\n            os << (num \/ oneP) << \"Pi\";\n        else if (num > oneT)\n            os << (num \/ oneT) << \"Ti\";\n        else if (num > oneG)\n            os << (num \/ oneG) << \"Gi\";\n        else if (num > oneM)\n            os << (num \/ oneM) << \"Mi\";\n        else if (num > oneK)\n            os << (num \/ oneK) << \"Ki\";\n        else\n            os << num;\n        os << \"B\";\n        return os.str();\n    }\n\n    \/\/ Return num with SI multiplier, e.g. \"3.14M\".\n    \/\/ Use this one for rates, etc.\n    string makeNumStr(idx_t num) {\n        if (!is_suffix_print_enabled || (num >= 0 && num < 1000))\n            return to_string(num);\n        return makeNumStr(double(num));\n    }\n    string makeNumStr(double num)\n    {\n        if (!is_suffix_print_enabled)\n            return to_string(num);\n\n        ostringstream os;\n        const double oneK = 1e3;\n        const double oneM = 1e6;\n        const double oneG = 1e9;\n        const double oneT = 1e12;\n        const double oneP = 1e15;\n        const double oneE = 1e18;\n        const double onem = 1e-3;\n        const double oneu = 1e-6;\n        const double onen = 1e-9;\n#ifdef USE_PICO\n        const double onep = 1e-12;\n        const double onef = 1e-15;\n#endif\n        if (num == 0.)\n            os << num;\n        else if (num > oneE)\n            os << (num \/ oneE) << \"E\";\n        else if (num > oneP)\n            os << (num \/ oneP) << \"P\";\n        else if (num > oneT)\n            os << (num \/ oneT) << \"T\";\n        else if (num > oneG)\n            os << (num \/ oneG) << \"G\";\n        else if (num > oneM)\n            os << (num \/ oneM) << \"M\";\n        else if (num > oneK)\n            os << (num \/ oneK) << \"K\"; \/\/ NB: official SI symbol is \"k\".\n#ifdef USE_PICO\n        else if (num < onep)\n            os << (num \/ onef) << \"f\";\n        else if (num < onen)\n            os << (num \/ onep) << \"p\";\n#endif\n        else if (num < oneu)\n            os << (num \/ onen) << \"n\";\n        else if (num < onem)\n            os << (num \/ oneu) << \"u\"; \/\/ NB: official SI symbol is Greek mu.\n        else if (num < 1.)\n            os << (num \/ onem) << \"m\";\n        else\n            os << num;\n        return os.str();\n    }\n\n    \/\/ A var that behaves like OMP_NUM_THREADS.\n    int yask_num_threads[yask_max_levels] = { 0 };\n\n    \/\/ See yask_common_api.hpp for documentation.\n    const char* yask_exception::what() noexcept {\n        return \"yask::yask_exception\\n\";\n    }\n\n    void yask_exception::add_message(const string& arg_msg) {\n        _msg.append(arg_msg);\n    }\n\n    const char* yask_exception::get_message() const {\n        return _msg.c_str();\n    }\n}\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 \"geometry.h\"\n#include \"scene.h\"\n\nnamespace embree\n{\n  const char* Geometry::gtype_names[Geometry::GTY_END] =\n  {\n    \"flat_linear_curve\",\n    \"round_linear_curve\",\n    \"oriented_linear_curve\",\n    \"\",\n    \"flat_bezier_curve\",\n    \"round_bezier_curve\",\n    \"oriented_bezier_curve\",\n    \"\",\n    \"flat_bspline_curve\",\n    \"round_bspline_curve\",\n    \"oriented_bspline_curve\",\n    \"\",\n    \"flat_hermite_curve\",\n    \"round_hermite_curve\",\n    \"oriented_hermite_curve\",\n    \"\",\n    \"flat_catmull_rom_curve\",\n    \"round_catmull_rom_curve\",\n    \"oriented_catmull_rom_curve\",\n    \"\",    \n    \"triangles\",\n    \"quads\",\n    \"grid\",\n    \"subdivs\",\n    \"\",\n    \"sphere\",\n    \"disc\",\n    \"oriented_disc\",\n    \"\",\n    \"usergeom\",\n    \"instance_cheap\",\n    \"instance_expensive\",\n  };\n     \n  Geometry::Geometry (Device* device, GType gtype, unsigned int numPrimitives, unsigned int numTimeSteps) \n    : device(device), scene(nullptr), userPtr(nullptr),\n      geomID(0), numPrimitives(numPrimitives), numTimeSteps(unsigned(numTimeSteps)), fnumTimeSegments(float(numTimeSteps-1)), time_range(0.0f,1.0f),\n      mask(-1),\n      gtype(gtype),\n      quality(RTC_BUILD_QUALITY_MEDIUM),\n      state(MODIFIED),\n      numPrimitivesChanged(false),\n      enabled(true),\n      intersectionFilterN(nullptr), occlusionFilterN(nullptr), pointQueryFunc(nullptr)\n  {\n    device->refInc();\n  }\n\n  Geometry::~Geometry()\n  {\n    device->refDec();\n  }\n\n  void Geometry::setNumPrimitives(unsigned int numPrimitives_in)\n  {      \n    if (numPrimitives_in == numPrimitives) return;\n    \n    numPrimitives = numPrimitives_in;\n    numPrimitivesChanged = true;\n    \n    Geometry::update();\n  }\n\n  void Geometry::setNumTimeSteps (unsigned int numTimeSteps_in)\n  {\n    if (numTimeSteps_in == numTimeSteps)\n      return;\n    \n    numTimeSteps = numTimeSteps_in;\n    fnumTimeSegments = float(numTimeSteps_in-1);\n    \n    Geometry::update();\n  }\n\n  void Geometry::setTimeRange (const BBox1f range)\n  {\n    time_range = range;\n    Geometry::update();\n  }\n  \n  void Geometry::update() \n  {\n    if (scene)\n      scene->setModified();\n\n    state = MODIFIED;\n  }\n  \n  void Geometry::commit() \n  {\n    if (scene)\n      scene->setModified();\n\n    state = COMMITTED;\n  }\n\n  void Geometry::preCommit()\n  {\n    if (state == MODIFIED)\n      throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"geometry not committed\");\n  }\n\n  void Geometry::postCommit()\n  {\n    numPrimitivesChanged = false;\n    \n    \/* set state to build *\/\n    if (isEnabled())\n      state = BUILD;\n  }\n\n  void Geometry::updateIntersectionFilters(bool enable)\n  {\n    const size_t numN  = (intersectionFilterN  != nullptr) + (occlusionFilterN  != nullptr);\n\n    if (enable) {\n      scene->numIntersectionFiltersN += numN;\n    } else {\n      scene->numIntersectionFiltersN -= numN;\n    }\n  }\n\n  Geometry* Geometry::attach(Scene* scene, unsigned int geomID)\n  {\n    assert(scene);\n    this->scene = scene;\n    this->geomID = geomID;\n    if (isEnabled()) {\n      scene->setModified();\n      updateIntersectionFilters(true);\n    }\n    return this;\n  }\n\n  void Geometry::detach()\n  {\n    if (scene && isEnabled()) {\n      scene->setModified();\n      updateIntersectionFilters(false);\n    }\n    this->scene = nullptr;\n    this->geomID = -1;\n  }\n  \n  void Geometry::enable () \n  {\n    if (isEnabled()) \n      return;\n\n    if (scene) {\n      updateIntersectionFilters(true);\n      scene->setModified();\n    }\n\n    enabled = true;\n  }\n\n  void Geometry::disable () \n  {\n    if (isDisabled()) \n      return;\n\n    if (scene) {\n      updateIntersectionFilters(false);\n      scene->setModified();\n    }\n    \n    enabled = false;\n  }\n\n  void Geometry::setUserData (void* ptr)\n  {\n    userPtr = ptr;\n  }\n  \n  void Geometry::setIntersectionFilterFunctionN (RTCFilterFunctionN filter) \n  {\n    if (!(getTypeMask() & (MTY_TRIANGLE_MESH | MTY_QUAD_MESH | MTY_CURVES | MTY_SUBDIV_MESH | MTY_USER_GEOMETRY | MTY_GRID_MESH)))\n      throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"filter functions not supported for this geometry\"); \n\n    if (scene && isEnabled()) {\n      scene->numIntersectionFiltersN -= intersectionFilterN != nullptr;\n      scene->numIntersectionFiltersN += filter != nullptr;\n    }\n    intersectionFilterN = filter;\n  }\n\n  void Geometry::setOcclusionFilterFunctionN (RTCFilterFunctionN filter) \n  {\n    if (!(getTypeMask() & (MTY_TRIANGLE_MESH | MTY_QUAD_MESH | MTY_CURVES | MTY_SUBDIV_MESH | MTY_USER_GEOMETRY | MTY_GRID_MESH)))\n      throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"filter functions not supported for this geometry\"); \n\n    if (scene && isEnabled()) {\n      scene->numIntersectionFiltersN -= occlusionFilterN != nullptr;\n      scene->numIntersectionFiltersN += filter != nullptr;\n    }\n    occlusionFilterN = filter;\n  }\n  \n  void Geometry::setPointQueryFunction (RTCPointQueryFunction func) \n  {\n    pointQueryFunc = func;\n  }\n\n  void Geometry::interpolateN(const RTCInterpolateNArguments* const args)\n  {\n    const void* valid_i = args->valid;\n    const unsigned* primIDs = args->primIDs;\n    const float* u = args->u;\n    const float* v = args->v;\n    unsigned int N = args->N;\n    RTCBufferType bufferType = args->bufferType;\n    unsigned int bufferSlot = args->bufferSlot;\n    float* P = args->P;\n    float* dPdu = args->dPdu;\n    float* dPdv = args->dPdv;\n    float* ddPdudu = args->ddPdudu;\n    float* ddPdvdv = args->ddPdvdv;\n    float* ddPdudv = args->ddPdudv;\n    unsigned int valueCount = args->valueCount;\n\n    if (valueCount > 256) throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"maximally 256 floating point values can be interpolated per vertex\");\n    const int* valid = (const int*) valid_i;\n \n    __aligned(64) float P_tmp[256];\n    __aligned(64) float dPdu_tmp[256];\n    __aligned(64) float dPdv_tmp[256];\n    __aligned(64) float ddPdudu_tmp[256];\n    __aligned(64) float ddPdvdv_tmp[256];\n    __aligned(64) float ddPdudv_tmp[256];\n\n    float* Pt = P ? P_tmp : nullptr;\n    float* dPdut = nullptr, *dPdvt = nullptr;\n    if (dPdu) { dPdut = dPdu_tmp; dPdvt = dPdv_tmp; }\n    float* ddPdudut = nullptr, *ddPdvdvt = nullptr, *ddPdudvt = nullptr;\n    if (ddPdudu) { ddPdudut = ddPdudu_tmp; ddPdvdvt = ddPdvdv_tmp; ddPdudvt = ddPdudv_tmp; }\n    \n    for (unsigned int i=0; i<N; i++)\n    {\n      if (valid && !valid[i]) continue;\n\n      RTCInterpolateArguments iargs;\n      iargs.primID = primIDs[i];\n      iargs.u = u[i];\n      iargs.v = v[i];\n      iargs.bufferType = bufferType;\n      iargs.bufferSlot = bufferSlot;\n      iargs.P = Pt;\n      iargs.dPdu = dPdut;\n      iargs.dPdv = dPdvt;\n      iargs.ddPdudu = ddPdudut;\n      iargs.ddPdvdv = ddPdvdvt;\n      iargs.ddPdudv = ddPdudvt;\n      iargs.valueCount = valueCount;\n      interpolate(&iargs);\n      \n      if (likely(P)) {\n        for (unsigned int j=0; j<valueCount; j++) \n          P[j*N+i] = Pt[j];\n      }\n      if (likely(dPdu)) \n      {\n        for (unsigned int j=0; j<valueCount; j++) {\n          dPdu[j*N+i] = dPdut[j];\n          dPdv[j*N+i] = dPdvt[j];\n        }\n      }\n      if (likely(ddPdudu)) \n      {\n        for (unsigned int j=0; j<valueCount; j++) {\n          ddPdudu[j*N+i] = ddPdudut[j];\n          ddPdvdv[j*N+i] = ddPdvdvt[j];\n          ddPdudv[j*N+i] = ddPdudvt[j];\n        }\n      }\n    }\n  }\n    \n  bool Geometry::pointQuery(PointQuery* query, PointQueryContext* context)\n  {\n    assert(context->primID < size());\n   \n    RTCPointQueryFunctionArguments args;\n    args.query           = (RTCPointQuery*)context->query_ws;\n    args.userPtr         = context->userPtr;\n    args.primID          = context->primID;\n    args.geomID          = context->geomID;\n    args.context         = context->userContext;\n    args.similarityScale = context->similarityScale;\n    \n    bool update = false;\n    if(context->func)  update |= context->func(&args);\n    if(pointQueryFunc) update |= pointQueryFunc(&args);\n\n    if (update && context->userContext->instStackSize > 0)\n    {\n      \/\/ update point query\n      if (context->query_type == POINT_QUERY_TYPE_AABB) {\n        context->updateAABB();\n      } else {\n        assert(context->similarityScale > 0.f);\n        query->radius = context->query_ws->radius * context->similarityScale;\n      }\n    }\n    return update;\n  }\n}\n<commit_msg>Detach geometries in Geometry::attach() if they are still attached to another scene.<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 \"geometry.h\"\n#include \"scene.h\"\n\nnamespace embree\n{\n  const char* Geometry::gtype_names[Geometry::GTY_END] =\n  {\n    \"flat_linear_curve\",\n    \"round_linear_curve\",\n    \"oriented_linear_curve\",\n    \"\",\n    \"flat_bezier_curve\",\n    \"round_bezier_curve\",\n    \"oriented_bezier_curve\",\n    \"\",\n    \"flat_bspline_curve\",\n    \"round_bspline_curve\",\n    \"oriented_bspline_curve\",\n    \"\",\n    \"flat_hermite_curve\",\n    \"round_hermite_curve\",\n    \"oriented_hermite_curve\",\n    \"\",\n    \"flat_catmull_rom_curve\",\n    \"round_catmull_rom_curve\",\n    \"oriented_catmull_rom_curve\",\n    \"\",    \n    \"triangles\",\n    \"quads\",\n    \"grid\",\n    \"subdivs\",\n    \"\",\n    \"sphere\",\n    \"disc\",\n    \"oriented_disc\",\n    \"\",\n    \"usergeom\",\n    \"instance_cheap\",\n    \"instance_expensive\",\n  };\n     \n  Geometry::Geometry (Device* device, GType gtype, unsigned int numPrimitives, unsigned int numTimeSteps) \n    : device(device), scene(nullptr), userPtr(nullptr),\n      geomID(0), numPrimitives(numPrimitives), numTimeSteps(unsigned(numTimeSteps)), fnumTimeSegments(float(numTimeSteps-1)), time_range(0.0f,1.0f),\n      mask(-1),\n      gtype(gtype),\n      quality(RTC_BUILD_QUALITY_MEDIUM),\n      state(MODIFIED),\n      numPrimitivesChanged(false),\n      enabled(true),\n      intersectionFilterN(nullptr), occlusionFilterN(nullptr), pointQueryFunc(nullptr)\n  {\n    device->refInc();\n  }\n\n  Geometry::~Geometry()\n  {\n    device->refDec();\n  }\n\n  void Geometry::setNumPrimitives(unsigned int numPrimitives_in)\n  {      \n    if (numPrimitives_in == numPrimitives) return;\n    \n    numPrimitives = numPrimitives_in;\n    numPrimitivesChanged = true;\n    \n    Geometry::update();\n  }\n\n  void Geometry::setNumTimeSteps (unsigned int numTimeSteps_in)\n  {\n    if (numTimeSteps_in == numTimeSteps)\n      return;\n    \n    numTimeSteps = numTimeSteps_in;\n    fnumTimeSegments = float(numTimeSteps_in-1);\n    \n    Geometry::update();\n  }\n\n  void Geometry::setTimeRange (const BBox1f range)\n  {\n    time_range = range;\n    Geometry::update();\n  }\n  \n  void Geometry::update() \n  {\n    if (scene)\n      scene->setModified();\n\n    state = MODIFIED;\n  }\n  \n  void Geometry::commit() \n  {\n    if (scene)\n      scene->setModified();\n\n    state = COMMITTED;\n  }\n\n  void Geometry::preCommit()\n  {\n    if (state == MODIFIED)\n      throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"geometry not committed\");\n  }\n\n  void Geometry::postCommit()\n  {\n    numPrimitivesChanged = false;\n    \n    \/* set state to build *\/\n    if (isEnabled())\n      state = BUILD;\n  }\n\n  void Geometry::updateIntersectionFilters(bool enable)\n  {\n    const size_t numN  = (intersectionFilterN  != nullptr) + (occlusionFilterN  != nullptr);\n\n    if (enable) {\n      scene->numIntersectionFiltersN += numN;\n    } else {\n      scene->numIntersectionFiltersN -= numN;\n    }\n  }\n\n  Geometry* Geometry::attach(Scene* scene, unsigned int geomID)\n  {\n    assert(scene);\n    if (this->scene)\n      this->scene->detachGeometry(this->geomID);\n\n    this->scene = scene;\n    this->geomID = geomID;\n    if (isEnabled()) {\n      scene->setModified();\n      updateIntersectionFilters(true);\n    }\n    return this;\n  }\n\n  void Geometry::detach()\n  {\n    if (scene && isEnabled()) {\n      scene->setModified();\n      updateIntersectionFilters(false);\n    }\n    this->scene = nullptr;\n    this->geomID = -1;\n  }\n  \n  void Geometry::enable () \n  {\n    if (isEnabled()) \n      return;\n\n    if (scene) {\n      updateIntersectionFilters(true);\n      scene->setModified();\n    }\n\n    enabled = true;\n  }\n\n  void Geometry::disable () \n  {\n    if (isDisabled()) \n      return;\n\n    if (scene) {\n      updateIntersectionFilters(false);\n      scene->setModified();\n    }\n    \n    enabled = false;\n  }\n\n  void Geometry::setUserData (void* ptr)\n  {\n    userPtr = ptr;\n  }\n  \n  void Geometry::setIntersectionFilterFunctionN (RTCFilterFunctionN filter) \n  {\n    if (!(getTypeMask() & (MTY_TRIANGLE_MESH | MTY_QUAD_MESH | MTY_CURVES | MTY_SUBDIV_MESH | MTY_USER_GEOMETRY | MTY_GRID_MESH)))\n      throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"filter functions not supported for this geometry\"); \n\n    if (scene && isEnabled()) {\n      scene->numIntersectionFiltersN -= intersectionFilterN != nullptr;\n      scene->numIntersectionFiltersN += filter != nullptr;\n    }\n    intersectionFilterN = filter;\n  }\n\n  void Geometry::setOcclusionFilterFunctionN (RTCFilterFunctionN filter) \n  {\n    if (!(getTypeMask() & (MTY_TRIANGLE_MESH | MTY_QUAD_MESH | MTY_CURVES | MTY_SUBDIV_MESH | MTY_USER_GEOMETRY | MTY_GRID_MESH)))\n      throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"filter functions not supported for this geometry\"); \n\n    if (scene && isEnabled()) {\n      scene->numIntersectionFiltersN -= occlusionFilterN != nullptr;\n      scene->numIntersectionFiltersN += filter != nullptr;\n    }\n    occlusionFilterN = filter;\n  }\n  \n  void Geometry::setPointQueryFunction (RTCPointQueryFunction func) \n  {\n    pointQueryFunc = func;\n  }\n\n  void Geometry::interpolateN(const RTCInterpolateNArguments* const args)\n  {\n    const void* valid_i = args->valid;\n    const unsigned* primIDs = args->primIDs;\n    const float* u = args->u;\n    const float* v = args->v;\n    unsigned int N = args->N;\n    RTCBufferType bufferType = args->bufferType;\n    unsigned int bufferSlot = args->bufferSlot;\n    float* P = args->P;\n    float* dPdu = args->dPdu;\n    float* dPdv = args->dPdv;\n    float* ddPdudu = args->ddPdudu;\n    float* ddPdvdv = args->ddPdvdv;\n    float* ddPdudv = args->ddPdudv;\n    unsigned int valueCount = args->valueCount;\n\n    if (valueCount > 256) throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"maximally 256 floating point values can be interpolated per vertex\");\n    const int* valid = (const int*) valid_i;\n \n    __aligned(64) float P_tmp[256];\n    __aligned(64) float dPdu_tmp[256];\n    __aligned(64) float dPdv_tmp[256];\n    __aligned(64) float ddPdudu_tmp[256];\n    __aligned(64) float ddPdvdv_tmp[256];\n    __aligned(64) float ddPdudv_tmp[256];\n\n    float* Pt = P ? P_tmp : nullptr;\n    float* dPdut = nullptr, *dPdvt = nullptr;\n    if (dPdu) { dPdut = dPdu_tmp; dPdvt = dPdv_tmp; }\n    float* ddPdudut = nullptr, *ddPdvdvt = nullptr, *ddPdudvt = nullptr;\n    if (ddPdudu) { ddPdudut = ddPdudu_tmp; ddPdvdvt = ddPdvdv_tmp; ddPdudvt = ddPdudv_tmp; }\n    \n    for (unsigned int i=0; i<N; i++)\n    {\n      if (valid && !valid[i]) continue;\n\n      RTCInterpolateArguments iargs;\n      iargs.primID = primIDs[i];\n      iargs.u = u[i];\n      iargs.v = v[i];\n      iargs.bufferType = bufferType;\n      iargs.bufferSlot = bufferSlot;\n      iargs.P = Pt;\n      iargs.dPdu = dPdut;\n      iargs.dPdv = dPdvt;\n      iargs.ddPdudu = ddPdudut;\n      iargs.ddPdvdv = ddPdvdvt;\n      iargs.ddPdudv = ddPdudvt;\n      iargs.valueCount = valueCount;\n      interpolate(&iargs);\n      \n      if (likely(P)) {\n        for (unsigned int j=0; j<valueCount; j++) \n          P[j*N+i] = Pt[j];\n      }\n      if (likely(dPdu)) \n      {\n        for (unsigned int j=0; j<valueCount; j++) {\n          dPdu[j*N+i] = dPdut[j];\n          dPdv[j*N+i] = dPdvt[j];\n        }\n      }\n      if (likely(ddPdudu)) \n      {\n        for (unsigned int j=0; j<valueCount; j++) {\n          ddPdudu[j*N+i] = ddPdudut[j];\n          ddPdvdv[j*N+i] = ddPdvdvt[j];\n          ddPdudv[j*N+i] = ddPdudvt[j];\n        }\n      }\n    }\n  }\n    \n  bool Geometry::pointQuery(PointQuery* query, PointQueryContext* context)\n  {\n    assert(context->primID < size());\n   \n    RTCPointQueryFunctionArguments args;\n    args.query           = (RTCPointQuery*)context->query_ws;\n    args.userPtr         = context->userPtr;\n    args.primID          = context->primID;\n    args.geomID          = context->geomID;\n    args.context         = context->userContext;\n    args.similarityScale = context->similarityScale;\n    \n    bool update = false;\n    if(context->func)  update |= context->func(&args);\n    if(pointQueryFunc) update |= pointQueryFunc(&args);\n\n    if (update && context->userContext->instStackSize > 0)\n    {\n      \/\/ update point query\n      if (context->query_type == POINT_QUERY_TYPE_AABB) {\n        context->updateAABB();\n      } else {\n        assert(context->similarityScale > 0.f);\n        query->radius = context->query_ws->radius * context->similarityScale;\n      }\n    }\n    return update;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* 2013+ Copyright (c) Andrey Kashin <kashin.andrej@gmail.com>\n* 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 Lesser 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 Lesser General Public License for more details.\n*\/\n\n#ifndef UPDATER_HPP\n#define UPDATER_HPP\n\n#include <stack>\n#include <stdexcept>\n\nnamespace react {\n\n\/*!\n * \\brief Class for interactive building of call tree\n *\n *  Allows you to log actions in call-tree manner.\n *\/\ntemplate<typename TreeType>\nclass call_tree_updater_t {\npublic:\n\ttypedef TreeType time_stats_tree_t;\n\ttypedef concurrent_call_tree_t<TreeType> concurrent_time_stats_tree_t;\n\n\t\/*!\n\t * \\brief Call tree node type\n\t *\/\n\ttypedef typename time_stats_tree_t::node_t node_t;\n\n\t\/*!\n\t * \\brief Pointer to call tree node type\n\t *\/\n\ttypedef typename time_stats_tree_t::p_node_t p_node_t;\n\n\t\/*!\n\t * \\brief Time point type\n\t *\/\n\ttypedef std::chrono::time_point<std::chrono::system_clock> time_point_t;\n\n\t\/*!\n\t * \\brief Initializes updater without target tree\n\t * \\param max_depth Maximum monitored depth of call stack\n\t *\/\n\tcall_tree_updater_t(const size_t max_depth = DEFAULT_DEPTH):\n\t\tcurrent_node(0), time_stats_tree(NULL), depth(0), max_depth(max_depth) {\n\t\tmeasurements.emplace(std::chrono::system_clock::now(), +time_stats_tree_t::NO_NODE);\n\t}\n\n\t\/*!\n\t * \\brief Initializes updater with target tree\n\t * \\param time_stats_tree Tree used to monitor updates\n\t * \\param max_depth Maximum monitored depth of call stack\n\t *\/\n\tcall_tree_updater_t(concurrent_time_stats_tree_t &time_stats_tree,\n\t\t\t\t\t\t const size_t max_depth = DEFAULT_DEPTH): call_tree_updater_t(max_depth) {\n\t\tset_time_stats_tree(time_stats_tree);\n\t\tmeasurements.emplace(std::chrono::system_clock::now(), +time_stats_tree_t::NO_NODE);\n\t}\n\n\t\/*!\n\t * \\brief Checks if all actions were correctly finished.\n\t *\/\n\tvirtual ~call_tree_updater_t() {\n\t\tcheck_for_extra_measurements();\n\t}\n\n\t\/*!\n\t * \\brief Sets target tree for updates\n\t * \\param time_stats_tree Tree used to monitor updates\n\t *\/\n\tvoid set_time_stats_tree(concurrent_time_stats_tree_t &time_stats_tree) {\n\t\tcheck_for_extra_measurements();\n\t\tcurrent_node = time_stats_tree.get_time_stats_tree().root;\n\t\tthis->time_stats_tree = &time_stats_tree;\n\t\tdepth = 0;\n\t}\n\n\t\/*!\n\t * \\brief Resets current call tree\n\t *\/\n\tvoid reset_time_stats_tree() {\n\t\tcheck_for_extra_measurements();\n\t\tcurrent_node = time_stats_tree_t::NO_NODE;\n\t\tthis->time_stats_tree = NULL;\n\t\tdepth = 0;\n\t}\n\n\t\/*!\n\t * \\brief Checks whether tree for updates is set\n\t * \\return whether updater target tree was set\n\t *\/\n\tbool has_time_stats_tree() const {\n\t\treturn (time_stats_tree != NULL);\n\t}\n\n\t\/*!\n\t * \\brief Starts new branch in tree with action \\a action_code\n\t * \\param action_code Code of new action\n\t *\/\n\tvirtual void start(const int action_code) {\n\t\tstart(action_code, std::chrono::system_clock::now());\n\t}\n\n\t\/*!\n\t * \\brief Starts new branch in tree with action \\a action_code and with specified start time\n\t * \\param action_code Code of new action\n\t * \\param start_time Action start time\n\t *\/\n\tvoid start(const int action_code, const time_point_t& start_time) {\n\t\t++depth;\n\t\tif (get_depth() > max_depth) {\n\t\t\treturn;\n\t\t}\n\n\t\ttime_stats_tree->lock();\n\t\tp_node_t next_node = time_stats_tree->get_time_stats_tree().add_new_link_if_missing(current_node, action_code);\n\t\ttime_stats_tree->unlock();\n\n\t\tmeasurements.emplace(start_time, current_node);\n\t\tcurrent_node = next_node;\n\t}\n\n\t\/*!\n\t * \\brief Stops last action. Updates total consumed time in call-tree.\n\t * \\param action_code Code of finished action\n\t *\/\n\tvirtual void stop(const int action_code) {\n\t\tif (get_depth() > max_depth) {\n\t\t\t--depth;\n\t\t\treturn;\n\t\t}\n\n\t\tstd::lock_guard<concurrent_time_stats_tree_t> guard(*time_stats_tree);\n\n\t\tint expected_code = time_stats_tree->get_time_stats_tree().get_node_action_code(current_node);\n\t\tif (expected_code != action_code) {\n\t\t\tstd::string expected_action_name = get_action_name(expected_code);\n\t\t\tstd::string found_action_name = get_action_name(action_code);\n\t\t\tthrow std::logic_error(\"Stopping wrong action. Expected: \" + expected_action_name + \", Found: \" + found_action_name);\n\t\t}\n\t\tpop_measurement();\n\t}\n\n\t\/*!\n\t * \\brief Sets max monitored call stack depth to \\a max_depth\n\t * \\param max_depth Max monitored call stack depth\n\t *\/\n\tvoid set_max_depth(const size_t max_depth) {\n\t\tif (depth != 0) {\n\t\t\tthrow std::logic_error(\"can't change max_depth during update\");\n\t\t}\n\n\t\tthis->max_depth = max_depth;\n\t}\n\n\t\/*!\n\t * \\brief Gets current call stack depth\n\t * \\return Current call stack depth\n\t *\/\n\tsize_t get_depth() const {\n\t\treturn depth;\n\t}\n\n\t\/*!\n\t * \\brief Returns name of action with \\a action_code\n\t * \\return Name of action with \\a action_code\n\t *\/\n\tstd::string get_action_name(int action_code) const {\n\t\treturn time_stats_tree->get_time_stats_tree().get_actions_set().get_action_name(action_code);\n\t}\n\n\t\/*!\n\t * \\brief Returns name of action in current node\n\t * \\return Current's node action name\n\t *\/\n\tstd::string get_current_node_action_name() const {\n\t\treturn get_action_name(time_stats_tree->get_time_stats_tree().get_node_action_code(current_node));\n\t}\n\nprivate:\n\t\/*!\n\t * \\internal\n\t *\n\t * \\brief Returns delta between two time_points\n\t *\/\n\ttemplate<class Period = std::chrono::microseconds>\n\tlong long int delta(time_point_t& start, const time_point_t& end) const {\n\t\treturn (std::chrono::duration_cast<Period> (end - start)).count();\n\t}\n\n\t\/*!\n\t * \\internal\n\t *\n\t * \\brief Assures that updater is empty\n\t *\/\n\tvoid check_for_extra_measurements() {\n\t\tif (depth != 0) {\n\t\t\tstd::string error_message;\n\t\t\tif (!time_stats_tree) {\n\t\t\t\terror_message = \"~time_stats_updater(): extra measurements, tree is NULL\\n\";\n\t\t\t} else {\n\t\t\t\terror_message = \"~time_stats_updater(): extra measurements:\\n\";\n\t\t\t\twhile (!measurements.empty()) {\n\t\t\t\t\terror_message += get_current_node_action_name() + '\\n';\n\t\t\t\t\tpop_measurement();\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::cerr << error_message << std::endl;\n\t\t\tthrow std::logic_error(error_message);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Represents single call measurement\n\t *\/\n\tstruct measurement {\n\t\t\/*!\n\t\t * \\brief Initializes measurement with specified start time and pointer to previous node in call stack\n\t\t * \\param time Start time\n\t\t * \\param previous_node Pointer to previous node in call stack\n\t\t *\/\n\t\tmeasurement(const time_point_t& time, p_node_t previous_node): start_time(time),\n\t\t\tprevious_node(previous_node) {}\n\n\t\t\/*!\n\t\t * \\brief Start time of the measurement\n\t\t *\/\n\t\ttime_point_t start_time;\n\n\t\t\/*!\n\t\t * \\brief Pointer to previous node in call stack\n\t\t *\/\n\t\tp_node_t previous_node;\n\t};\n\n\t\/*!\n\t * \\brief Removes measurement from top of call stack and updates corresponding node in call-tree\n\t * \\param end_time End time of the measurement\n\t *\/\n\tvoid pop_measurement(const time_point_t& end_time = std::chrono::system_clock::now()) {\n\t\tmeasurement previous_measurement = measurements.top();\n\t\tmeasurements.pop();\n\t\ttime_stats_tree->get_time_stats_tree().inc_node_time(current_node, delta(previous_measurement.start_time, end_time));\n\t\ttime_stats_tree->get_time_stats_tree().inc_node_calls_number(current_node);\n\t\tcurrent_node = previous_measurement.previous_node;\n\t\t--depth;\n\t}\n\n\t\/*!\n\t * \\brief Current position in call-tree\n\t *\/\n\tp_node_t current_node;\n\n\t\/*!\n\t * \\brief Call stack\n\t *\/\n\tstd::stack<measurement> measurements;\n\n\t\/*!\n\t * \\brief Target call-tree\n\t *\/\n\tconcurrent_time_stats_tree_t* time_stats_tree;\n\n\t\/*!\n\t * \\brief Current call stack depth\n\t *\/\n\tsize_t depth;\n\n\t\/*!\n\t * \\brief Maximum monitored call stack depth\n\t *\/\n\tsize_t max_depth;\n\n\t\/*!\n\t * \\brief Default monitored call stack depth\n\t *\/\n\tstatic const size_t DEFAULT_DEPTH = -1;\n};\n\ntemplate<typename TreeType>\nclass dummy_call_tree_updater_t : public call_tree_updater_t<TreeType> {\npublic:\n\tdummy_call_tree_updater_t() {}\n\t~dummy_call_tree_updater_t() {}\n\n\tvoid start(int) {}\n\tvoid stop(int) {}\n};\n\n\/*!\n * \\brief Auxiliary class for logging actions with variable place of stop time (branching\/end of function\/end of scope)\n *\/\ntemplate<typename TreeType>\nclass action_guard_base_t {\npublic:\n\t\/*!\n\t * \\brief Initializes guard and starts action with \\a action_code\n\t * \\param updater Updater whos start is called\n\t * \\param action_code Code of new action\n\t *\/\n\taction_guard_base_t(call_tree_updater_t<TreeType> *updater, const int action_code):\n\t\tupdater(updater), action_code(action_code), is_stopped(false) {\n\t\tif (updater) {\n\t\t\tupdater->start(action_code);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Stops action if it is not already stopped\n\t *\/\n\t~action_guard_base_t() {\n\t\tif (!is_stopped && updater) {\n\t\t\tupdater->stop(action_code);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Allows to stop action manually\n\t *\/\n\tvoid stop() {\n\t\tif (is_stopped) {\n\t\t\tthrow std::logic_error(\"action \" + updater->get_action_name(action_code) + \" is already stopped\");\n\t\t}\n\n\t\tif (updater) {\n\t\t\tupdater->stop(action_code);\n\t\t\tis_stopped = true;\n\t\t}\n\t}\n\nprivate:\n\t\/*!\n\t * \\brief Updater whos start\/stop are called\n\t *\/\n\tcall_tree_updater_t<TreeType> *updater;\n\n\t\/*!\n\t * \\brief Action code of guarded action\n\t *\/\n\tconst int action_code;\n\n\t\/*!\n\t * \\brief Shows if action is already stopped\n\t *\/\n\tbool is_stopped;\n};\n\ntypedef action_guard_base_t<call_tree_t> action_guard_t;\n\n} \/\/ namespace react\n\n#endif \/\/ UPDATER_HPP\n<commit_msg>Compilation under gcc4.4 fixed<commit_after>\/*\n* 2013+ Copyright (c) Andrey Kashin <kashin.andrej@gmail.com>\n* 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 Lesser 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 Lesser General Public License for more details.\n*\/\n\n#ifndef UPDATER_HPP\n#define UPDATER_HPP\n\n#include <stack>\n#include <stdexcept>\n\nnamespace react {\n\n\/*!\n * \\brief Class for interactive building of call tree\n *\n *  Allows you to log actions in call-tree manner.\n *\/\ntemplate<typename TreeType>\nclass call_tree_updater_t {\npublic:\n\ttypedef TreeType time_stats_tree_t;\n\ttypedef concurrent_call_tree_t<TreeType> concurrent_time_stats_tree_t;\n\n\t\/*!\n\t * \\brief Call tree node type\n\t *\/\n\ttypedef typename time_stats_tree_t::node_t node_t;\n\n\t\/*!\n\t * \\brief Pointer to call tree node type\n\t *\/\n\ttypedef typename time_stats_tree_t::p_node_t p_node_t;\n\n\t\/*!\n\t * \\brief Time point type\n\t *\/\n\ttypedef std::chrono::time_point<std::chrono::system_clock> time_point_t;\n\n\t\/*!\n\t * \\brief Initializes updater without target tree\n\t * \\param max_depth Maximum monitored depth of call stack\n\t *\/\n\tcall_tree_updater_t(const size_t max_depth = DEFAULT_DEPTH):\n\t\tcurrent_node(0), time_stats_tree(NULL), depth(0), max_depth(max_depth) {\n\t\tmeasurements.emplace(std::chrono::system_clock::now(), +time_stats_tree_t::NO_NODE);\n\t}\n\n\t\/*!\n\t * \\brief Initializes updater with target tree\n\t * \\param time_stats_tree Tree used to monitor updates\n\t * \\param max_depth Maximum monitored depth of call stack\n\t *\/\n\tcall_tree_updater_t(concurrent_time_stats_tree_t &time_stats_tree,\n\t\t\tconst size_t max_depth = DEFAULT_DEPTH):\n\t\tcurrent_node(0), time_stats_tree(NULL), depth(0), max_depth(max_depth) {\n\t\tset_time_stats_tree(time_stats_tree);\n\t\tmeasurements.emplace(std::chrono::system_clock::now(), +time_stats_tree_t::NO_NODE);\n\t}\n\n\t\/*!\n\t * \\brief Checks if all actions were correctly finished.\n\t *\/\n\tvirtual ~call_tree_updater_t() {\n\t\tcheck_for_extra_measurements();\n\t}\n\n\t\/*!\n\t * \\brief Sets target tree for updates\n\t * \\param time_stats_tree Tree used to monitor updates\n\t *\/\n\tvoid set_time_stats_tree(concurrent_time_stats_tree_t &time_stats_tree) {\n\t\tcheck_for_extra_measurements();\n\t\tcurrent_node = time_stats_tree.get_time_stats_tree().root;\n\t\tthis->time_stats_tree = &time_stats_tree;\n\t\tdepth = 0;\n\t}\n\n\t\/*!\n\t * \\brief Resets current call tree\n\t *\/\n\tvoid reset_time_stats_tree() {\n\t\tcheck_for_extra_measurements();\n\t\tcurrent_node = time_stats_tree_t::NO_NODE;\n\t\tthis->time_stats_tree = NULL;\n\t\tdepth = 0;\n\t}\n\n\t\/*!\n\t * \\brief Checks whether tree for updates is set\n\t * \\return whether updater target tree was set\n\t *\/\n\tbool has_time_stats_tree() const {\n\t\treturn (time_stats_tree != NULL);\n\t}\n\n\t\/*!\n\t * \\brief Starts new branch in tree with action \\a action_code\n\t * \\param action_code Code of new action\n\t *\/\n\tvirtual void start(const int action_code) {\n\t\tstart(action_code, std::chrono::system_clock::now());\n\t}\n\n\t\/*!\n\t * \\brief Starts new branch in tree with action \\a action_code and with specified start time\n\t * \\param action_code Code of new action\n\t * \\param start_time Action start time\n\t *\/\n\tvoid start(const int action_code, const time_point_t& start_time) {\n\t\t++depth;\n\t\tif (get_depth() > max_depth) {\n\t\t\treturn;\n\t\t}\n\n\t\ttime_stats_tree->lock();\n\t\tp_node_t next_node = time_stats_tree->get_time_stats_tree().add_new_link_if_missing(current_node, action_code);\n\t\ttime_stats_tree->unlock();\n\n\t\tmeasurements.emplace(start_time, current_node);\n\t\tcurrent_node = next_node;\n\t}\n\n\t\/*!\n\t * \\brief Stops last action. Updates total consumed time in call-tree.\n\t * \\param action_code Code of finished action\n\t *\/\n\tvirtual void stop(const int action_code) {\n\t\tif (get_depth() > max_depth) {\n\t\t\t--depth;\n\t\t\treturn;\n\t\t}\n\n\t\tstd::lock_guard<concurrent_time_stats_tree_t> guard(*time_stats_tree);\n\n\t\tint expected_code = time_stats_tree->get_time_stats_tree().get_node_action_code(current_node);\n\t\tif (expected_code != action_code) {\n\t\t\tstd::string expected_action_name = get_action_name(expected_code);\n\t\t\tstd::string found_action_name = get_action_name(action_code);\n\t\t\tthrow std::logic_error(\"Stopping wrong action. Expected: \" + expected_action_name + \", Found: \" + found_action_name);\n\t\t}\n\t\tpop_measurement();\n\t}\n\n\t\/*!\n\t * \\brief Sets max monitored call stack depth to \\a max_depth\n\t * \\param max_depth Max monitored call stack depth\n\t *\/\n\tvoid set_max_depth(const size_t max_depth) {\n\t\tif (depth != 0) {\n\t\t\tthrow std::logic_error(\"can't change max_depth during update\");\n\t\t}\n\n\t\tthis->max_depth = max_depth;\n\t}\n\n\t\/*!\n\t * \\brief Gets current call stack depth\n\t * \\return Current call stack depth\n\t *\/\n\tsize_t get_depth() const {\n\t\treturn depth;\n\t}\n\n\t\/*!\n\t * \\brief Returns name of action with \\a action_code\n\t * \\return Name of action with \\a action_code\n\t *\/\n\tstd::string get_action_name(int action_code) const {\n\t\treturn time_stats_tree->get_time_stats_tree().get_actions_set().get_action_name(action_code);\n\t}\n\n\t\/*!\n\t * \\brief Returns name of action in current node\n\t * \\return Current's node action name\n\t *\/\n\tstd::string get_current_node_action_name() const {\n\t\treturn get_action_name(time_stats_tree->get_time_stats_tree().get_node_action_code(current_node));\n\t}\n\nprivate:\n\t\/*!\n\t * \\internal\n\t *\n\t * \\brief Returns delta between two time_points\n\t *\/\n\ttemplate<class Period = std::chrono::microseconds>\n\tlong long int delta(time_point_t& start, const time_point_t& end) const {\n\t\treturn (std::chrono::duration_cast<Period> (end - start)).count();\n\t}\n\n\t\/*!\n\t * \\internal\n\t *\n\t * \\brief Assures that updater is empty\n\t *\/\n\tvoid check_for_extra_measurements() {\n\t\tif (depth != 0) {\n\t\t\tstd::string error_message;\n\t\t\tif (!time_stats_tree) {\n\t\t\t\terror_message = \"~time_stats_updater(): extra measurements, tree is NULL\\n\";\n\t\t\t} else {\n\t\t\t\terror_message = \"~time_stats_updater(): extra measurements:\\n\";\n\t\t\t\twhile (!measurements.empty()) {\n\t\t\t\t\terror_message += get_current_node_action_name() + '\\n';\n\t\t\t\t\tpop_measurement();\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::cerr << error_message << std::endl;\n\t\t\tthrow std::logic_error(error_message);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Represents single call measurement\n\t *\/\n\tstruct measurement {\n\t\t\/*!\n\t\t * \\brief Initializes measurement with specified start time and pointer to previous node in call stack\n\t\t * \\param time Start time\n\t\t * \\param previous_node Pointer to previous node in call stack\n\t\t *\/\n\t\tmeasurement(const time_point_t& time, p_node_t previous_node): start_time(time),\n\t\t\tprevious_node(previous_node) {}\n\n\t\t\/*!\n\t\t * \\brief Start time of the measurement\n\t\t *\/\n\t\ttime_point_t start_time;\n\n\t\t\/*!\n\t\t * \\brief Pointer to previous node in call stack\n\t\t *\/\n\t\tp_node_t previous_node;\n\t};\n\n\t\/*!\n\t * \\brief Removes measurement from top of call stack and updates corresponding node in call-tree\n\t * \\param end_time End time of the measurement\n\t *\/\n\tvoid pop_measurement(const time_point_t& end_time = std::chrono::system_clock::now()) {\n\t\tmeasurement previous_measurement = measurements.top();\n\t\tmeasurements.pop();\n\t\ttime_stats_tree->get_time_stats_tree().inc_node_time(current_node, delta(previous_measurement.start_time, end_time));\n\t\ttime_stats_tree->get_time_stats_tree().inc_node_calls_number(current_node);\n\t\tcurrent_node = previous_measurement.previous_node;\n\t\t--depth;\n\t}\n\n\t\/*!\n\t * \\brief Current position in call-tree\n\t *\/\n\tp_node_t current_node;\n\n\t\/*!\n\t * \\brief Call stack\n\t *\/\n\tstd::stack<measurement> measurements;\n\n\t\/*!\n\t * \\brief Target call-tree\n\t *\/\n\tconcurrent_time_stats_tree_t* time_stats_tree;\n\n\t\/*!\n\t * \\brief Current call stack depth\n\t *\/\n\tsize_t depth;\n\n\t\/*!\n\t * \\brief Maximum monitored call stack depth\n\t *\/\n\tsize_t max_depth;\n\n\t\/*!\n\t * \\brief Default monitored call stack depth\n\t *\/\n\tstatic const size_t DEFAULT_DEPTH = -1;\n};\n\ntemplate<typename TreeType>\nclass dummy_call_tree_updater_t : public call_tree_updater_t<TreeType> {\npublic:\n\tdummy_call_tree_updater_t() {}\n\t~dummy_call_tree_updater_t() {}\n\n\tvoid start(int) {}\n\tvoid stop(int) {}\n};\n\n\/*!\n * \\brief Auxiliary class for logging actions with variable place of stop time (branching\/end of function\/end of scope)\n *\/\ntemplate<typename TreeType>\nclass action_guard_base_t {\npublic:\n\t\/*!\n\t * \\brief Initializes guard and starts action with \\a action_code\n\t * \\param updater Updater whos start is called\n\t * \\param action_code Code of new action\n\t *\/\n\taction_guard_base_t(call_tree_updater_t<TreeType> *updater, const int action_code):\n\t\tupdater(updater), action_code(action_code), is_stopped(false) {\n\t\tif (updater) {\n\t\t\tupdater->start(action_code);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Stops action if it is not already stopped\n\t *\/\n\t~action_guard_base_t() {\n\t\tif (!is_stopped && updater) {\n\t\t\tupdater->stop(action_code);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Allows to stop action manually\n\t *\/\n\tvoid stop() {\n\t\tif (is_stopped) {\n\t\t\tthrow std::logic_error(\"action \" + updater->get_action_name(action_code) + \" is already stopped\");\n\t\t}\n\n\t\tif (updater) {\n\t\t\tupdater->stop(action_code);\n\t\t\tis_stopped = true;\n\t\t}\n\t}\n\nprivate:\n\t\/*!\n\t * \\brief Updater whos start\/stop are called\n\t *\/\n\tcall_tree_updater_t<TreeType> *updater;\n\n\t\/*!\n\t * \\brief Action code of guarded action\n\t *\/\n\tconst int action_code;\n\n\t\/*!\n\t * \\brief Shows if action is already stopped\n\t *\/\n\tbool is_stopped;\n};\n\ntypedef action_guard_base_t<call_tree_t> action_guard_t;\n\n} \/\/ namespace react\n\n#endif \/\/ UPDATER_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n *\n * @ingroup dspSoundFileLib\n *\n * @brief Provides a common interface to soundfile data\n *\n * @details This object provides a common set of attributes and methods for working with soundfiles at a specific filepath.\n * This allows us to access metadata and copy values in a common way without duplicating code. As with the rest of the\n * SoundfileLib, it relies on the third-party <a href=\"http:\/\/www.mega-nerd.com\/libsndfile\/\">libsndfile library<\/a>.@n\n * Be aware that attributes and metadata are cached when the setFilePath method is called in order to provide efficiency, but this may lead to problems if the file somehow changes after the method call.\n *\n * @authors Nathan Wolek\n *\n * @copyright Copyright © 2013 by Nathan Wolek @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 \"TTSoundfile.h\"\n\n#define thisTTClass\t\t\tTTSoundfile\n#define thisTTClassName\t\t\"soundfile\"\n#define thisTTClassTags\t\t\"soundfile\"\n\nTT_AUDIO_CONSTRUCTOR,\nmFilePath(kTTSymEmpty),\nmNumChannels(0),\nmSampleRate(0.0),\nmLengthInSamples(0),\nmLengthInSeconds(0.0),\nmTitle(kTTSymEmpty),\nmArtist(kTTSymEmpty),\nmDate(kTTSymEmpty),\nmAnnotation(kTTSymEmpty),\nmSoundFile(NULL)\n{\n\t\/\/ add the attributes and messages here\n    addAttributeWithSetter(FilePath, kTypeSymbol);\n    addAttribute(NumChannels, kTypeInt16);\n        addAttributeProperty(NumChannels, readOnly, kTTBoolYes);\n    \/\/ need to add the rest of these here...\n    addAttribute(SampleRate, kTypeFloat64);\n        addAttributeProperty(SampleRate, readOnly, kTTBoolYes);\n    addAttribute(LengthInSamples, kTypeInt64);\n        addAttributeProperty(LengthInSamples, readOnly, kTTBoolYes);\n    addAttribute(LengthInSeconds, kTypeFloat64);\n        addAttributeProperty(LengthInSeconds, readOnly, kTTBoolYes);\n    addAttribute(Title, kTypeSymbol);\n        addAttributeProperty(Title, readOnly, kTTBoolYes);\n    addAttribute(Artist, kTypeSymbol);\n        addAttributeProperty(Artist, readOnly, kTTBoolYes);\n    addAttribute(Date, kTypeSymbol);\n        addAttributeProperty(Date, readOnly, kTTBoolYes);\n    addAttribute(Annotation, kTypeSymbol);\n        addAttributeProperty(Annotation, readOnly, kTTBoolYes);\n\t\n}\n\nTTSoundfile::~TTSoundfile()\n{\n\t\/\/ copied from TTSoundfilePlayer, confirm that it is needed\n\tif (mSoundFile)\n\t\tsf_close(mSoundFile);\n}\n\n\nTTErr TTSoundfile::setFilePath(const TTValue& newValue)\n{\n\tTTSymbol\tpotentialFilePath = newValue;\n\tSNDFILE*\tsoundfile;\n\tconst char*\ttextInfo;\n#ifdef TT_PLATFORM_WIN\n\t\/\/ There is a bug in libsndfile on Windows where upon return from this function a runtime check fails\n\t\/\/ because the stack is corrupted around soundfileInfo when sf_open() is called.\n\t\/\/ We work around this by allocating some extra memory to absorb the overrun.\n    \/\/ [tap - old comment from soundfileplayer]\n\tSF_INFO\t\tsoundfileInfo[2];\n#else\n\tSF_INFO\t\tsoundfileInfo[1];\n#endif\n    \n\tmemset(&soundfileInfo, 0, sizeof(SF_INFO));\n\t\/\/soundfileInfo.format = 0;\n\tsoundfile = sf_open(potentialFilePath.c_str(), SFM_READ, soundfileInfo);\n\t\n\tif (soundfile) { \/\/ if the filepath was valid\n\t\t\n\t\t\/\/ swap out the old for the new, but hold onto the old for a moment\n\t\tSNDFILE* oldSoundFile = mSoundFile;\n\t\tmSoundFile = soundfile;\n\t\t\n\t\t\/\/ if there was an old file, we can now close it\n\t\tif (oldSoundFile)\n\t\t\tsf_close(oldSoundFile);\n\t\t\n\t\t\/\/ copy the metadata to our local variable\n\t\tmemcpy(&mSoundFileInfo, soundfileInfo, sizeof(SF_INFO));\n\t\t\n\t\t\/* copy additional data to local variables *\/\n        \/\/ filepath\n\t\tmFilePath = potentialFilePath;\n        \n        \/\/ number of channels\n        mNumChannels = mSoundFileInfo.channels;\n        \n        \/\/ sample rate\n        mSampleRate = mSoundFileInfo.samplerate;\n        \n        \/\/ duration in samples\n\t\tmLengthInSamples = mSoundFileInfo.frames;\n        \n        \/\/ duration in seconds\n\t\tmLengthInSeconds = mLengthInSamples \/ mSampleRate;\n\t\t\n\t\t\/\/ copy specific metadata pieces to separate TTSymbols\n\t\t\/\/ in transfer from player, made this little pattern into a macro\n            #define SF_STRING_TO_TTSYMBOL(sf_info_piece, local_ttsymbol) \\\n                textInfo = sf_get_string(soundfile, sf_info_piece); \\\n                if (textInfo) { \\\n                    local_ttsymbol = TT(textInfo); \\\n                } \\\n                else local_ttsymbol = kTTSymEmpty;\n\t\t\n\t\t\/\/ title\n\t\tSF_STRING_TO_TTSYMBOL(SF_STR_TITLE, mTitle);\n\t\t\/\/ artist\n\t\tSF_STRING_TO_TTSYMBOL(SF_STR_ARTIST, mArtist);\n\t\t\/\/ date\n\t\tSF_STRING_TO_TTSYMBOL(SF_STR_DATE, mDate);\n        \/\/ comment\n\t\tSF_STRING_TO_TTSYMBOL(SF_STR_COMMENT, mAnnotation);\n        \n\t\t\n\t\treturn kTTErrNone;\n        \n\t} else { \/\/ if the filepath was invalid\n\t\tchar errstr[256];\n\t\tsf_error_str(soundfile, errstr, 256);\n\t\tTTLogMessage(\"cannot open soundfile %s: %s\", potentialFilePath.c_str(), errstr);\n        \n\t\treturn kTTErrInvalidValue;\n        \n\t}\n\t\n}\n\nTTErr\tTTSoundfile::peek(const TTColumnID frame, const TTRowID channel, TTSampleValue& value)\n{\n    TTSampleVector temp_value;\n    sf_count_t seekInFrames;\n    sf_count_t numSamplesRead;\n    \n    seekInFrames = sf_seek(mSoundFile, frame, SEEK_SET);\n    \n    if (seekInFrames == -1) {\n        return kTTErrGeneric;\n    }\n    \n    temp_value.resize(mNumChannels);\n    \n    numSamplesRead = sf_readf_double(mSoundFile, &temp_value[0], 1);\n    \n    if (numSamplesRead != 1) {\n        return kTTErrGeneric;\n    }\n    \n    value = temp_value[channel];\n    return kTTErrNone;\n    \n}<commit_msg>using new filepath error code<commit_after>\/** @file\n *\n * @ingroup dspSoundFileLib\n *\n * @brief Provides a common interface to soundfile data\n *\n * @details This object provides a common set of attributes and methods for working with soundfiles at a specific filepath.\n * This allows us to access metadata and copy values in a common way without duplicating code. As with the rest of the\n * SoundfileLib, it relies on the third-party <a href=\"http:\/\/www.mega-nerd.com\/libsndfile\/\">libsndfile library<\/a>.@n\n * Be aware that attributes and metadata are cached when the setFilePath method is called in order to provide efficiency, but this may lead to problems if the file somehow changes after the method call.\n *\n * @authors Nathan Wolek\n *\n * @copyright Copyright © 2013 by Nathan Wolek @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 \"TTSoundfile.h\"\n\n#define thisTTClass\t\t\tTTSoundfile\n#define thisTTClassName\t\t\"soundfile\"\n#define thisTTClassTags\t\t\"soundfile\"\n\nTT_AUDIO_CONSTRUCTOR,\nmFilePath(kTTSymEmpty),\nmNumChannels(0),\nmSampleRate(0.0),\nmLengthInSamples(0),\nmLengthInSeconds(0.0),\nmTitle(kTTSymEmpty),\nmArtist(kTTSymEmpty),\nmDate(kTTSymEmpty),\nmAnnotation(kTTSymEmpty),\nmSoundFile(NULL)\n{\n\t\/\/ add the attributes and messages here\n    addAttributeWithSetter(FilePath, kTypeSymbol);\n    addAttribute(NumChannels, kTypeInt16);\n        addAttributeProperty(NumChannels, readOnly, kTTBoolYes);\n    \/\/ need to add the rest of these here...\n    addAttribute(SampleRate, kTypeFloat64);\n        addAttributeProperty(SampleRate, readOnly, kTTBoolYes);\n    addAttribute(LengthInSamples, kTypeInt64);\n        addAttributeProperty(LengthInSamples, readOnly, kTTBoolYes);\n    addAttribute(LengthInSeconds, kTypeFloat64);\n        addAttributeProperty(LengthInSeconds, readOnly, kTTBoolYes);\n    addAttribute(Title, kTypeSymbol);\n        addAttributeProperty(Title, readOnly, kTTBoolYes);\n    addAttribute(Artist, kTypeSymbol);\n        addAttributeProperty(Artist, readOnly, kTTBoolYes);\n    addAttribute(Date, kTypeSymbol);\n        addAttributeProperty(Date, readOnly, kTTBoolYes);\n    addAttribute(Annotation, kTypeSymbol);\n        addAttributeProperty(Annotation, readOnly, kTTBoolYes);\n\t\n}\n\nTTSoundfile::~TTSoundfile()\n{\n\t\/\/ copied from TTSoundfilePlayer, confirm that it is needed\n\tif (mSoundFile)\n\t\tsf_close(mSoundFile);\n}\n\n\nTTErr TTSoundfile::setFilePath(const TTValue& newValue)\n{\n\tTTSymbol\tpotentialFilePath = newValue;\n\tSNDFILE*\tsoundfile;\n\tconst char*\ttextInfo;\n#ifdef TT_PLATFORM_WIN\n\t\/\/ There is a bug in libsndfile on Windows where upon return from this function a runtime check fails\n\t\/\/ because the stack is corrupted around soundfileInfo when sf_open() is called.\n\t\/\/ We work around this by allocating some extra memory to absorb the overrun.\n    \/\/ [tap - old comment from soundfileplayer]\n\tSF_INFO\t\tsoundfileInfo[2];\n#else\n\tSF_INFO\t\tsoundfileInfo[1];\n#endif\n    \n\tmemset(&soundfileInfo, 0, sizeof(SF_INFO));\n\t\/\/soundfileInfo.format = 0;\n\tsoundfile = sf_open(potentialFilePath.c_str(), SFM_READ, soundfileInfo);\n\t\n\tif (soundfile) { \/\/ if the filepath was valid\n\t\t\n\t\t\/\/ swap out the old for the new, but hold onto the old for a moment\n\t\tSNDFILE* oldSoundFile = mSoundFile;\n\t\tmSoundFile = soundfile;\n\t\t\n\t\t\/\/ if there was an old file, we can now close it\n\t\tif (oldSoundFile)\n\t\t\tsf_close(oldSoundFile);\n\t\t\n\t\t\/\/ copy the metadata to our local variable\n\t\tmemcpy(&mSoundFileInfo, soundfileInfo, sizeof(SF_INFO));\n\t\t\n\t\t\/* copy additional data to local variables *\/\n        \/\/ filepath\n\t\tmFilePath = potentialFilePath;\n        \n        \/\/ number of channels\n        mNumChannels = mSoundFileInfo.channels;\n        \n        \/\/ sample rate\n        mSampleRate = mSoundFileInfo.samplerate;\n        \n        \/\/ duration in samples\n\t\tmLengthInSamples = mSoundFileInfo.frames;\n        \n        \/\/ duration in seconds\n\t\tmLengthInSeconds = mLengthInSamples \/ mSampleRate;\n\t\t\n\t\t\/\/ copy specific metadata pieces to separate TTSymbols\n\t\t\/\/ in transfer from player, made this little pattern into a macro\n            #define SF_STRING_TO_TTSYMBOL(sf_info_piece, local_ttsymbol) \\\n                textInfo = sf_get_string(soundfile, sf_info_piece); \\\n                if (textInfo) { \\\n                    local_ttsymbol = TT(textInfo); \\\n                } \\\n                else local_ttsymbol = kTTSymEmpty;\n\t\t\n\t\t\/\/ title\n\t\tSF_STRING_TO_TTSYMBOL(SF_STR_TITLE, mTitle);\n\t\t\/\/ artist\n\t\tSF_STRING_TO_TTSYMBOL(SF_STR_ARTIST, mArtist);\n\t\t\/\/ date\n\t\tSF_STRING_TO_TTSYMBOL(SF_STR_DATE, mDate);\n        \/\/ comment\n\t\tSF_STRING_TO_TTSYMBOL(SF_STR_COMMENT, mAnnotation);\n        \n\t\t\n\t\treturn kTTErrNone;\n        \n\t} else { \/\/ if the filepath was invalid\n\t\tchar errstr[256];\n\t\tsf_error_str(soundfile, errstr, 256);\n\t\tTTLogMessage(\"cannot open soundfile %s: %s\", potentialFilePath.c_str(), errstr);\n        \n\t\treturn kTTErrInvalidFilepath;\n        \n\t}\n\t\n}\n\nTTErr\tTTSoundfile::peek(const TTColumnID frame, const TTRowID channel, TTSampleValue& value)\n{\n    TTSampleVector temp_value;\n    sf_count_t seekInFrames;\n    sf_count_t numSamplesRead;\n    \n    seekInFrames = sf_seek(mSoundFile, frame, SEEK_SET);\n    \n    if (seekInFrames == -1) {\n        return kTTErrGeneric;\n    }\n    \n    temp_value.resize(mNumChannels);\n    \n    numSamplesRead = sf_readf_double(mSoundFile, &temp_value[0], 1);\n    \n    if (numSamplesRead != 1) {\n        return kTTErrGeneric;\n    }\n    \n    value = temp_value[channel];\n    return kTTErrNone;\n    \n}<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KMail.\n\n    Copyright (c) 2004 Jakob Schr�er <js@camaya.net>\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    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#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"xfaceconfigurator.h\"\n\n#include <kactivelabel.h>\n#include <kdialog.h>\n#include <kfiledialog.h>\n#include <kglobalsettings.h>\n#include <kimageio.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kurl.h>\n#include <kio\/netaccess.h>\n\/\/Added by qt3to4:\n#include <QPixmap>\n#include <QVBoxLayout>\n#include <Q3Frame>\n#include <QHBoxLayout>\nusing namespace KIO;\n#include <kxface.h>\nusing namespace KPIM;\n#include <kabc\/stdaddressbook.h>\n#include <kabc\/addressee.h>\nusing namespace KABC;\n\n#include <qbitmap.h>\n#include <qcheckbox.h>\n#include <qcombobox.h>\n#include <qimage.h>\n#include <qlabel.h>\n#include <qlayout.h>\n#include <qpushbutton.h>\n\n#include <QStackedWidget>\n\n\n\/\/ #include <assert.h>\n\nusing namespace KMail;\nusing namespace KPIM;\n\nnamespace KMail {\n\n  XFaceConfigurator::XFaceConfigurator( QWidget * parent, const char * name )\n    : QWidget( parent, name )\n  {\n    \/\/ tmp. vars:\n    QLabel * label;\n    QLabel * label1;\n    KActiveLabel * label2;\n    QWidget * page;\n    QVBoxLayout * vlay;\n    QHBoxLayout * hlay;\n    QVBoxLayout * page_vlay;\n    QPushButton * mFromFileBtn;\n    QPushButton * mFromAddrbkBtn;\n\n    vlay = new QVBoxLayout( this, 0, KDialog::spacingHint(), \"main layout\" );\n    hlay = new QHBoxLayout( vlay );\n\n    \/\/ \"enable X-Face\" checkbox:\n    mEnableCheck = new QCheckBox( i18n(\"&Send picture with every message\"), this );\n    mEnableCheck->setWhatsThis(\n        i18n( \"Check this box if you want KMail to add a so-called X-Face header to messages \"\n            \"written with this identity. An X-Face is a small (48x48 pixels) black and \"\n            \"white image that some mail clients are able to display.\" ) );\n    hlay->addWidget( mEnableCheck, Qt::AlignLeft | Qt::AlignVCenter );\n\n    mXFaceLabel = new QLabel( this );\n    mXFaceLabel->setWhatsThis(\n                    i18n( \"This is a preview of the picture selected\/entered below.\" ) );\n    mXFaceLabel->setFixedSize(48, 48);\n    mXFaceLabel->setFrameShape( Q3Frame::Box );\n    hlay->addWidget( mXFaceLabel );\n\n\/\/     label1 = new QLabel( \"X-Face:\", this );\n\/\/     vlay->addWidget( label1 );\n\n    \/\/ \"obtain X-Face from\" combo and label:\n    hlay = new QHBoxLayout( vlay ); \/\/ inherits spacing\n    mSourceCombo = new QComboBox( false, this );\n    mSourceCombo->setWhatsThis(\n                    i18n(\"Click on the widgets below to obtain help on the input methods.\"));\n    mSourceCombo->setEnabled( false ); \/\/ since !mEnableCheck->isChecked()\n    mSourceCombo->insertStringList( QStringList()\n        << i18n( \"continuation of \\\"obtain picture from\\\"\",\n                 \"External Source\" )\n        << i18n( \"continuation of \\\"obtain picture from\\\"\",\n                 \"Input Field Below\" ) );\n    label = new QLabel( mSourceCombo,\n                        i18n(\"Obtain pic&ture from:\"), this );\n    label->setEnabled( false ); \/\/ since !mEnableCheck->isChecked()\n    hlay->addWidget( label );\n    hlay->addWidget( mSourceCombo, 1 );\n\n    \/\/ widget stack that is controlled by the source combo:\n    QStackedWidget * widgetStack = new QStackedWidget( this );\n    widgetStack->setEnabled( false ); \/\/ since !mEnableCheck->isChecked()\n    vlay->addWidget( widgetStack, 1 );\n    connect( mSourceCombo, SIGNAL(highlighted(int)),\n             widgetStack, SLOT(raiseWidget(int)) );\n    connect( mEnableCheck, SIGNAL(toggled(bool)),\n             mSourceCombo, SLOT(setEnabled(bool)) );\n    connect( mEnableCheck, SIGNAL(toggled(bool)),\n             widgetStack, SLOT(setEnabled(bool)) );\n    connect( mEnableCheck, SIGNAL(toggled(bool)),\n             label, SLOT(setEnabled(bool)) );\n    \/\/ The focus might be still in the widget that is disabled\n    connect( mEnableCheck, SIGNAL(clicked()),\n             mEnableCheck, SLOT(setFocus()) );\n\n    int pageno = 0;\n    \/\/ page 0: create X-Face from image file or address book entry\n    page = new QWidget( widgetStack );\n    widgetStack->insertWidget( pageno, page ); \/\/ force sequential numbers (play safe)\n    page_vlay = new QVBoxLayout( page, 0, KDialog::spacingHint() );\n    hlay = new QHBoxLayout( page_vlay ); \/\/ inherits spacing\n    mFromFileBtn = new QPushButton( i18n(\"Select File...\"), page );\n    mFromFileBtn->setWhatsThis(\n                     i18n(\"Use this to select an image file to create the picture from. \"\n                         \"The image should be of high contrast and nearly quadratic shape. \"\n                         \"A light background helps improve the result.\" ) );\n    mFromFileBtn->setAutoDefault( false );\n    page_vlay->addWidget( mFromFileBtn, 1 );\n    connect( mFromFileBtn, SIGNAL(released()),\n             this, SLOT(slotSelectFile()) );\n    mFromAddrbkBtn = new QPushButton( i18n(\"Set From Address Book\"), page );\n    mFromAddrbkBtn->setWhatsThis(\n                     i18n( \"You can use a scaled-down version of the picture \"\n                         \"you have set in your address book entry.\" ) );\n    mFromAddrbkBtn->setAutoDefault( false );\n    page_vlay->addWidget( mFromAddrbkBtn, 1 );\n    connect( mFromAddrbkBtn, SIGNAL(released()),\n             this, SLOT(slotSelectFromAddressbook()) );\n    label1 = new QLabel( i18n(\"<qt>KMail can send a small (48x48 pixels), low-quality, \"\n        \"monochrome picture with every message. \"\n        \"For example, this could be a picture of you or a glyph. \"\n        \"It is shown in the recipient's mail client (if supported).\" ), page );\n    label1->setAlignment( Qt::TextWordWrap | Qt::AlignVCenter );\n    page_vlay->addWidget( label1 );\n\n    widgetStack->setCurrentIndex( 0 ); \/\/ since mSourceCombo->currentItem() == 0\n\n    \/\/ page 1: input field for direct entering\n    ++pageno;\n    page = new QWidget( widgetStack );\n    widgetStack->insertWidget( pageno,page );\n    page_vlay = new QVBoxLayout( page, 0, KDialog::spacingHint() );\n    mTextEdit = new Q3TextEdit( page );\n    page_vlay->addWidget( mTextEdit );\n    mTextEdit->setWhatsThis( i18n( \"Use this field to enter an arbitrary X-Face string.\" ) );\n    mTextEdit->setFont( KGlobalSettings::fixedFont() );\n    mTextEdit->setWrapPolicy( Q3TextEdit::Anywhere );\n    mTextEdit->setTextFormat( Qt::PlainText );\n    label2 = new KActiveLabel( i18n(\"Examples are available at <a href=\\\"http:\/\/www.xs4all.nl\/~ace\/X-Faces\/\\\">http:\/\/www.xs4all.nl\/~ace\/X-Faces\/<\/a>.\"), page );\n    page_vlay->addWidget( label2 );\n\n\n    connect(mTextEdit, SIGNAL(textChanged()), this, SLOT(slotUpdateXFace()));\n  }\n\n  XFaceConfigurator::~XFaceConfigurator() {\n\n  }\n\n  bool XFaceConfigurator::isXFaceEnabled() const {\n    return mEnableCheck->isChecked();\n  }\n\n  void XFaceConfigurator::setXFaceEnabled( bool enable ) {\n    mEnableCheck->setChecked( enable );\n  }\n\n  QString XFaceConfigurator::xface() const {\n    return mTextEdit->text();\n  }\n\n  void XFaceConfigurator::setXFace( const QString & text ) {\n    mTextEdit->setText( text );\n  }\n\n  void XFaceConfigurator::setXfaceFromFile( const KURL &url )\n  {\n    QString tmpFile;\n    if( KIO::NetAccess::download( url, tmpFile, this ) )\n    {\n      KXFace xf;\n      mTextEdit->setText( xf.fromImage( QImage( tmpFile ) ) );\n      KIO::NetAccess::removeTempFile( tmpFile );\n    } else {\n      KMessageBox::error(this, KIO::NetAccess::lastErrorString() );\n    }\n  }\n\n  void XFaceConfigurator::slotSelectFile()\n  {\n    QStringList mimeTypes = KImageIO::mimeTypes (KImageIO::Reading);\n    QString filter = mimeTypes.join (\" \");\n    KURL url = KFileDialog::getOpenURL( QString::null, filter, this, QString::null );\n    if ( !url.isEmpty() )\n      setXfaceFromFile( url );\n  }\n\n  void XFaceConfigurator::slotSelectFromAddressbook()\n  {\n    StdAddressBook *ab = StdAddressBook::self( true );\n    Addressee me = ab->whoAmI();\n    if ( !me.isEmpty() )\n    {\n      if ( me.photo().isIntern() )\n      {\n        QImage photo = me.photo().data();\n        if ( !photo.isNull() )\n        {\n          KXFace xf;\n          mTextEdit->setText( xf.fromImage( photo ) );\n        }\n        else\n          KMessageBox::information( this, i18n(\"No picture set for your address book entry.\"), i18n(\"No Picture\") );\n\n      }\n      else\n      {\n        KURL url = me.photo().url();\n        if( !url.isEmpty() )\n          setXfaceFromFile( url );\n        else\n          KMessageBox::information( this, i18n(\"No picture set for your address book entry.\"), i18n(\"No Picture\") );\n      }\n    }\n    else\n      KMessageBox::information( this, i18n(\"You do not have your own contact defined in the address book.\"), i18n(\"No Picture\") );\n  }\n\n  void XFaceConfigurator::slotUpdateXFace()\n  {\n    QString str = mTextEdit->text();\n    if ( !str.isEmpty() )\n    {\n      if ( str.startsWith(\"x-face:\", false) )\n      {\n        str = str.remove(\"x-face:\", false);\n        mTextEdit->setText(str);\n      }\n      KXFace xf;\n      QPixmap p( 48, 48 );\n      p.convertFromImage( xf.toImage(str) );\n      mXFaceLabel->setPixmap( p );\n    }\n    else\n      mXFaceLabel->setPixmap( 0L );\n  }\n\n} \/\/ namespace KMail\n\n#include \"xfaceconfigurator.moc\"\n<commit_msg>Fix crash: setPixmap(0L) makes crash kmail => use clear<commit_after>\/*\n    This file is part of KMail.\n\n    Copyright (c) 2004 Jakob Schr�er <js@camaya.net>\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    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#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"xfaceconfigurator.h\"\n#include <kactivelabel.h>\n#include <kdialog.h>\n#include <kfiledialog.h>\n#include <kglobalsettings.h>\n#include <kimageio.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kurl.h>\n#include <kio\/netaccess.h>\n\/\/Added by qt3to4:\n#include <QPixmap>\n#include <QVBoxLayout>\n#include <Q3Frame>\n#include <QHBoxLayout>\nusing namespace KIO;\n#include <kxface.h>\nusing namespace KPIM;\n#include <kabc\/stdaddressbook.h>\n#include <kabc\/addressee.h>\nusing namespace KABC;\n\n#include <qbitmap.h>\n#include <qcheckbox.h>\n#include <qcombobox.h>\n#include <qimage.h>\n#include <qlabel.h>\n#include <qlayout.h>\n#include <qpushbutton.h>\n\n#include <QStackedWidget>\n\n\n\/\/ #include <assert.h>\n\nusing namespace KMail;\nusing namespace KPIM;\n\nnamespace KMail {\n\n  XFaceConfigurator::XFaceConfigurator( QWidget * parent, const char * name )\n    : QWidget( parent, name )\n  {\n    \/\/ tmp. vars:\n    QLabel * label;\n    QLabel * label1;\n    KActiveLabel * label2;\n    QWidget * page;\n    QVBoxLayout * vlay;\n    QHBoxLayout * hlay;\n    QVBoxLayout * page_vlay;\n    QPushButton * mFromFileBtn;\n    QPushButton * mFromAddrbkBtn;\n\n    vlay = new QVBoxLayout( this, 0, KDialog::spacingHint(), \"main layout\" );\n    hlay = new QHBoxLayout( vlay );\n\n    \/\/ \"enable X-Face\" checkbox:\n    mEnableCheck = new QCheckBox( i18n(\"&Send picture with every message\"), this );\n    mEnableCheck->setWhatsThis(\n        i18n( \"Check this box if you want KMail to add a so-called X-Face header to messages \"\n            \"written with this identity. An X-Face is a small (48x48 pixels) black and \"\n            \"white image that some mail clients are able to display.\" ) );\n    hlay->addWidget( mEnableCheck, Qt::AlignLeft | Qt::AlignVCenter );\n\n    mXFaceLabel = new QLabel( this );\n    mXFaceLabel->setWhatsThis(\n                    i18n( \"This is a preview of the picture selected\/entered below.\" ) );\n    mXFaceLabel->setFixedSize(48, 48);\n    mXFaceLabel->setFrameShape( Q3Frame::Box );\n    hlay->addWidget( mXFaceLabel );\n\n\/\/     label1 = new QLabel( \"X-Face:\", this );\n\/\/     vlay->addWidget( label1 );\n\n    \/\/ \"obtain X-Face from\" combo and label:\n    hlay = new QHBoxLayout( vlay ); \/\/ inherits spacing\n    mSourceCombo = new QComboBox( false, this );\n    mSourceCombo->setWhatsThis(\n                    i18n(\"Click on the widgets below to obtain help on the input methods.\"));\n    mSourceCombo->setEnabled( false ); \/\/ since !mEnableCheck->isChecked()\n    mSourceCombo->insertStringList( QStringList()\n        << i18n( \"continuation of \\\"obtain picture from\\\"\",\n                 \"External Source\" )\n        << i18n( \"continuation of \\\"obtain picture from\\\"\",\n                 \"Input Field Below\" ) );\n    label = new QLabel( mSourceCombo,\n                        i18n(\"Obtain pic&ture from:\"), this );\n    label->setEnabled( false ); \/\/ since !mEnableCheck->isChecked()\n    hlay->addWidget( label );\n    hlay->addWidget( mSourceCombo, 1 );\n\n    \/\/ widget stack that is controlled by the source combo:\n    QStackedWidget * widgetStack = new QStackedWidget( this );\n    widgetStack->setEnabled( false ); \/\/ since !mEnableCheck->isChecked()\n    vlay->addWidget( widgetStack, 1 );\n    connect( mSourceCombo, SIGNAL(highlighted(int)),\n             widgetStack, SLOT(raiseWidget(int)) );\n    connect( mEnableCheck, SIGNAL(toggled(bool)),\n             mSourceCombo, SLOT(setEnabled(bool)) );\n    connect( mEnableCheck, SIGNAL(toggled(bool)),\n             widgetStack, SLOT(setEnabled(bool)) );\n    connect( mEnableCheck, SIGNAL(toggled(bool)),\n             label, SLOT(setEnabled(bool)) );\n    \/\/ The focus might be still in the widget that is disabled\n    connect( mEnableCheck, SIGNAL(clicked()),\n             mEnableCheck, SLOT(setFocus()) );\n\n    int pageno = 0;\n    \/\/ page 0: create X-Face from image file or address book entry\n    page = new QWidget( widgetStack );\n    widgetStack->insertWidget( pageno, page ); \/\/ force sequential numbers (play safe)\n    page_vlay = new QVBoxLayout( page, 0, KDialog::spacingHint() );\n    hlay = new QHBoxLayout( page_vlay ); \/\/ inherits spacing\n    mFromFileBtn = new QPushButton( i18n(\"Select File...\"), page );\n    mFromFileBtn->setWhatsThis(\n                     i18n(\"Use this to select an image file to create the picture from. \"\n                         \"The image should be of high contrast and nearly quadratic shape. \"\n                         \"A light background helps improve the result.\" ) );\n    mFromFileBtn->setAutoDefault( false );\n    page_vlay->addWidget( mFromFileBtn, 1 );\n    connect( mFromFileBtn, SIGNAL(released()),\n             this, SLOT(slotSelectFile()) );\n    mFromAddrbkBtn = new QPushButton( i18n(\"Set From Address Book\"), page );\n    mFromAddrbkBtn->setWhatsThis(\n                     i18n( \"You can use a scaled-down version of the picture \"\n                         \"you have set in your address book entry.\" ) );\n    mFromAddrbkBtn->setAutoDefault( false );\n    page_vlay->addWidget( mFromAddrbkBtn, 1 );\n    connect( mFromAddrbkBtn, SIGNAL(released()),\n             this, SLOT(slotSelectFromAddressbook()) );\n    label1 = new QLabel( i18n(\"<qt>KMail can send a small (48x48 pixels), low-quality, \"\n        \"monochrome picture with every message. \"\n        \"For example, this could be a picture of you or a glyph. \"\n        \"It is shown in the recipient's mail client (if supported).\" ), page );\n    label1->setAlignment( Qt::TextWordWrap | Qt::AlignVCenter );\n    page_vlay->addWidget( label1 );\n\n    widgetStack->setCurrentIndex( 0 ); \/\/ since mSourceCombo->currentItem() == 0\n\n    \/\/ page 1: input field for direct entering\n    ++pageno;\n    page = new QWidget( widgetStack );\n    widgetStack->insertWidget( pageno,page );\n    page_vlay = new QVBoxLayout( page, 0, KDialog::spacingHint() );\n    mTextEdit = new Q3TextEdit( page );\n    page_vlay->addWidget( mTextEdit );\n    mTextEdit->setWhatsThis( i18n( \"Use this field to enter an arbitrary X-Face string.\" ) );\n    mTextEdit->setFont( KGlobalSettings::fixedFont() );\n    mTextEdit->setWrapPolicy( Q3TextEdit::Anywhere );\n    mTextEdit->setTextFormat( Qt::PlainText );\n    label2 = new KActiveLabel( i18n(\"Examples are available at <a href=\\\"http:\/\/www.xs4all.nl\/~ace\/X-Faces\/\\\">http:\/\/www.xs4all.nl\/~ace\/X-Faces\/<\/a>.\"), page );\n    page_vlay->addWidget( label2 );\n\n\n    connect(mTextEdit, SIGNAL(textChanged()), this, SLOT(slotUpdateXFace()));\n  }\n\n  XFaceConfigurator::~XFaceConfigurator() {\n\n  }\n\n  bool XFaceConfigurator::isXFaceEnabled() const {\n    return mEnableCheck->isChecked();\n  }\n\n  void XFaceConfigurator::setXFaceEnabled( bool enable ) {\n    mEnableCheck->setChecked( enable );\n  }\n\n  QString XFaceConfigurator::xface() const {\n    return mTextEdit->text();\n  }\n\n  void XFaceConfigurator::setXFace( const QString & text ) {\n    mTextEdit->setText( text );\n  }\n\n  void XFaceConfigurator::setXfaceFromFile( const KURL &url )\n  {\n    QString tmpFile;\n    if( KIO::NetAccess::download( url, tmpFile, this ) )\n    {\n      KXFace xf;\n      mTextEdit->setText( xf.fromImage( QImage( tmpFile ) ) );\n      KIO::NetAccess::removeTempFile( tmpFile );\n    } else {\n      KMessageBox::error(this, KIO::NetAccess::lastErrorString() );\n    }\n  }\n\n  void XFaceConfigurator::slotSelectFile()\n  {\n    QStringList mimeTypes = KImageIO::mimeTypes (KImageIO::Reading);\n    QString filter = mimeTypes.join (\" \");\n    KURL url = KFileDialog::getOpenURL( QString::null, filter, this, QString::null );\n    if ( !url.isEmpty() )\n      setXfaceFromFile( url );\n  }\n\n  void XFaceConfigurator::slotSelectFromAddressbook()\n  {\n    StdAddressBook *ab = StdAddressBook::self( true );\n    Addressee me = ab->whoAmI();\n    if ( !me.isEmpty() )\n    {\n      if ( me.photo().isIntern() )\n      {\n        QImage photo = me.photo().data();\n        if ( !photo.isNull() )\n        {\n          KXFace xf;\n          mTextEdit->setText( xf.fromImage( photo ) );\n        }\n        else\n          KMessageBox::information( this, i18n(\"No picture set for your address book entry.\"), i18n(\"No Picture\") );\n\n      }\n      else\n      {\n        KURL url = me.photo().url();\n        if( !url.isEmpty() )\n          setXfaceFromFile( url );\n        else\n          KMessageBox::information( this, i18n(\"No picture set for your address book entry.\"), i18n(\"No Picture\") );\n      }\n    }\n    else\n      KMessageBox::information( this, i18n(\"You do not have your own contact defined in the address book.\"), i18n(\"No Picture\") );\n  }\n\n  void XFaceConfigurator::slotUpdateXFace()\n  {\n    QString str = mTextEdit->text();\n    \n    if ( !str.isEmpty() )\n    {\n      if ( str.startsWith(\"x-face:\", false) )\n      {\n        str = str.remove(\"x-face:\", false);\n        mTextEdit->setText(str);\n      }\n      KXFace xf;\n      QPixmap p( 48, 48 );\n      p.convertFromImage( xf.toImage(str) );\n      mXFaceLabel->setPixmap( p );\n    }\n    else\n    {\n      mXFaceLabel->clear();\n    }\n  }\n\n} \/\/ namespace KMail\n\n#include \"xfaceconfigurator.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/** \n * @file lldate.cpp\n * @author Phoenix\n * @date 2006-02-05\n * @brief Implementation of the date class\n *\n * $LicenseInfo:firstyear=2006&license=viewergpl$\n * \n * Copyright (c) 2006-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab.  Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"linden_common.h\"\n#include \"lldate.h\"\n\n#include \"apr_time.h\"\n\n#include <time.h>\n#include <locale.h>\n#include <string>\n#include <iomanip>\n#include <sstream>\n\n#include \"lltimer.h\"\n#include \"llstring.h\"\n\nstatic const F64 DATE_EPOCH = 0.0;\n\nstatic const F64 LL_APR_USEC_PER_SEC = 1000000.0;\n\t\/\/ should be APR_USEC_PER_SEC, but that relies on INT64_C which\n\t\/\/ isn't defined in glib under our build set up for some reason\n\n\nLLDate::LLDate() : mSecondsSinceEpoch(DATE_EPOCH)\n{\n}\n\nLLDate::LLDate(const LLDate& date) :\n\tmSecondsSinceEpoch(date.mSecondsSinceEpoch)\n{\n}\n\nLLDate::LLDate(F64 seconds_since_epoch) :\n\tmSecondsSinceEpoch(seconds_since_epoch)\n{\n}\n\nLLDate::LLDate(const std::string& iso8601_date)\n{\n\tif(!fromString(iso8601_date))\n\t{\n\t\tllwarns << \"date \" << iso8601_date << \" failed to parse; \"\n\t\t\t<< \"ZEROING IT OUT\" << llendl;\n\t\tmSecondsSinceEpoch = DATE_EPOCH;\n\t}\n}\n\nstd::string LLDate::asString() const\n{\n\tstd::ostringstream stream;\n\ttoStream(stream);\n\treturn stream.str();\n}\n\n\/\/@ brief Converts time in seconds since EPOCH\n\/\/        to RFC 1123 compliant date format\n\/\/        E.g. 1184797044.037586 == Wednesday, 18 Jul 2007 22:17:24 GMT\n\/\/        in RFC 1123. HTTP dates are always in GMT and RFC 1123\n\/\/        is one of the standards used and the prefered format\nstd::string LLDate::asRFC1123() const\n{\n\treturn toHTTPDateString (std::string (\"%A, %d %b %Y %H:%M:%S GMT\"));\n}\n\nLLFastTimer::DeclareTimer FT_DATE_FORMAT(\"Date Format\");\n\nstd::string LLDate::toHTTPDateString (std::string fmt) const\n{\n\tLLFastTimer ft1(FT_DATE_FORMAT);\n\t\n\ttime_t locSeconds = (time_t) mSecondsSinceEpoch;\n\tstruct tm * gmt = gmtime (&locSeconds);\n\treturn toHTTPDateString(gmt, fmt);\n}\n\nstd::string LLDate::toHTTPDateString (tm * gmt, std::string fmt)\n{\n\tLLFastTimer ft1(FT_DATE_FORMAT);\n\n\t\/\/ avoid calling setlocale() unnecessarily - it's expensive.\n\tstatic std::string prev_locale = \"\";\n\tstd::string this_locale = LLStringUtil::getLocale();\n\tif (this_locale != prev_locale)\n\t{\n\t\tsetlocale(LC_TIME, this_locale.c_str());\n\t\tprev_locale = this_locale;\n\t}\n\n\t\/\/ use strftime() as it appears to be faster than std::time_put\n\tchar buffer[128];\n\tstrftime(buffer, 128, fmt.c_str(), gmt);\n\treturn std::string(buffer);\n}\n\nvoid LLDate::toStream(std::ostream& s) const\n{\n\tapr_time_t time = (apr_time_t)(mSecondsSinceEpoch * LL_APR_USEC_PER_SEC);\n\t\n\tapr_time_exp_t exp_time;\n\tif (apr_time_exp_gmt(&exp_time, time) != APR_SUCCESS)\n\t{\n\t\ts << \"1970-01-01T00:00:00Z\";\n\t\treturn;\n\t}\n\t\n\ts << std::dec << std::setfill('0');\n#if( LL_WINDOWS || __GNUC__ > 2)\n\ts << std::right;\n#else\n\ts.setf(ios::right);\n#endif\n\ts\t\t << std::setw(4) << (exp_time.tm_year + 1900)\n\t  << '-' << std::setw(2) << (exp_time.tm_mon + 1)\n\t  << '-' << std::setw(2) << (exp_time.tm_mday)\n\t  << 'T' << std::setw(2) << (exp_time.tm_hour)\n\t  << ':' << std::setw(2) << (exp_time.tm_min)\n\t  << ':' << std::setw(2) << (exp_time.tm_sec);\n\tif (exp_time.tm_usec > 0)\n\t{\n\t\ts << '.' << std::setw(2)\n\t\t  << (int)(exp_time.tm_usec \/ (LL_APR_USEC_PER_SEC \/ 100));\n\t}\n\ts << 'Z'\n\t  << std::setfill(' ');\n}\n\nbool LLDate::split(S32 *year, S32 *month, S32 *day, S32 *hour, S32 *min, S32 *sec) const\n{\n\tapr_time_t time = (apr_time_t)(mSecondsSinceEpoch * LL_APR_USEC_PER_SEC);\n\t\n\tapr_time_exp_t exp_time;\n\tif (apr_time_exp_gmt(&exp_time, time) != APR_SUCCESS)\n\t{\n\t\treturn false;\n\t}\n\n\tif (year)\n\t\t*year = exp_time.tm_year + 1900;\n\n\tif (month)\n\t\t*month = exp_time.tm_mon + 1;\n\n\tif (day)\n\t\t*day = exp_time.tm_mday;\n\n\tif (hour)\n\t\t*hour = exp_time.tm_hour;\n\n\tif (min)\n\t\t*min = exp_time.tm_min;\n\n\tif (sec)\n\t\t*sec = exp_time.tm_sec;\n\n\treturn true;\n}\n\nbool LLDate::fromString(const std::string& iso8601_date)\n{\n\tstd::istringstream stream(iso8601_date);\n\treturn fromStream(stream);\n}\n\nbool LLDate::fromStream(std::istream& s)\n{\n\tstruct apr_time_exp_t exp_time;\n\tapr_int32_t tm_part;\n\tint c;\n\t\n\ts >> tm_part;\n\texp_time.tm_year = tm_part - 1900;\n\tc = s.get(); \/\/ skip the hypen\n\tif (c != '-') { return false; }\n\ts >> tm_part;\n\texp_time.tm_mon = tm_part - 1;\n\tc = s.get(); \/\/ skip the hypen\n\tif (c != '-') { return false; }\n\ts >> tm_part;\n\texp_time.tm_mday = tm_part;\n\t\n\tc = s.get(); \/\/ skip the T\n\tif (c != 'T') { return false; }\n\t\n\ts >> tm_part;\n\texp_time.tm_hour = tm_part;\n\tc = s.get(); \/\/ skip the :\n\tif (c != ':') { return false; }\n\ts >> tm_part;\n\texp_time.tm_min = tm_part;\n\tc = s.get(); \/\/ skip the :\n\tif (c != ':') { return false; }\n\ts >> tm_part;\n\texp_time.tm_sec = tm_part;\n\n\t\/\/ zero out the unused fields\n\texp_time.tm_usec = 0;\n\texp_time.tm_wday = 0;\n\texp_time.tm_yday = 0;\n\texp_time.tm_isdst = 0;\n\texp_time.tm_gmtoff = 0;\n\n\t\/\/ generate a time_t from that\n\tapr_time_t time;\n\tif (apr_time_exp_gmt_get(&time, &exp_time) != APR_SUCCESS)\n\t{\n\t\treturn false;\n\t}\n\t\n\tF64 seconds_since_epoch = time \/ LL_APR_USEC_PER_SEC;\n\n\t\/\/ check for fractional\n\tc = s.peek();\n\tif(c == '.')\n\t{\n\t\tF64 fractional = 0.0;\n\t\ts >> fractional;\n\t\tseconds_since_epoch += fractional;\n\t}\n\n\tc = s.peek(); \/\/ check for offset\n\tif (c == '+' || c == '-')\n\t{\n\t\tS32 offset_sign = (c == '+') ? 1 : -1;\n\t\tS32 offset_hours = 0;\n\t\tS32 offset_minutes = 0;\n\t\tS32 offset_in_seconds = 0;\n\n\t\ts >> offset_hours;\n\n\t\tc = s.get(); \/\/ skip the colon a get the minutes if there are any\n\t\tif (c == ':')\n\t\t{\t\t\n\t\t\ts >> offset_minutes;\n\t\t}\n\t\t\n\t\toffset_in_seconds =  (offset_hours * 60 + offset_sign * offset_minutes) * 60;\n\t\tseconds_since_epoch -= offset_in_seconds;\n\t}\n\telse if (c != 'Z') { return false; } \/\/ skip the Z\n\n\tmSecondsSinceEpoch = seconds_since_epoch;\n\treturn true;\n}\n\nbool LLDate::fromYMDHMS(S32 year, S32 month, S32 day, S32 hour, S32 min, S32 sec)\n{\n\tstruct apr_time_exp_t exp_time;\n\t\n\texp_time.tm_year = year - 1900;\n\texp_time.tm_mon = month - 1;\n\texp_time.tm_mday = day;\n\texp_time.tm_hour = hour;\n\texp_time.tm_min = min;\n\texp_time.tm_sec = sec;\n\n\t\/\/ zero out the unused fields\n\texp_time.tm_usec = 0;\n\texp_time.tm_wday = 0;\n\texp_time.tm_yday = 0;\n\texp_time.tm_isdst = 0;\n\texp_time.tm_gmtoff = 0;\n\n\t\/\/ generate a time_t from that\n\tapr_time_t time;\n\tif (apr_time_exp_gmt_get(&time, &exp_time) != APR_SUCCESS)\n\t{\n\t\treturn false;\n\t}\n\t\n\tmSecondsSinceEpoch = time \/ LL_APR_USEC_PER_SEC;\n\n\treturn true;\n}\n\nF64 LLDate::secondsSinceEpoch() const\n{\n\treturn mSecondsSinceEpoch;\n}\n\nvoid LLDate::secondsSinceEpoch(F64 seconds)\n{\n\tmSecondsSinceEpoch = seconds;\n}\n\n\/* static *\/ LLDate LLDate::now()\n{\n\t\/\/ time() returns seconds, we want fractions of a second, which LLTimer provides --RN\n\treturn LLDate(LLTimer::getTotalSeconds());\n}\n\nbool LLDate::operator<(const LLDate& rhs) const\n{\n    return mSecondsSinceEpoch < rhs.mSecondsSinceEpoch;\n}\n\nstd::ostream& operator<<(std::ostream& s, const LLDate& date)\n{\n\tdate.toStream(s);\n\treturn s;\n}\n\nstd::istream& operator>>(std::istream& s, LLDate& date)\n{\n\tdate.fromStream(s);\n\treturn s;\n}\n\n<commit_msg>EXT-8524 FIXED Non-ASCII character corruption in date.<commit_after>\/** \n * @file lldate.cpp\n * @author Phoenix\n * @date 2006-02-05\n * @brief Implementation of the date class\n *\n * $LicenseInfo:firstyear=2006&license=viewergpl$\n * \n * Copyright (c) 2006-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab.  Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"linden_common.h\"\n#include \"lldate.h\"\n\n#include \"apr_time.h\"\n\n#include <time.h>\n#include <locale.h>\n#include <string>\n#include <iomanip>\n#include <sstream>\n\n#include \"lltimer.h\"\n#include \"llstring.h\"\n\nstatic const F64 DATE_EPOCH = 0.0;\n\nstatic const F64 LL_APR_USEC_PER_SEC = 1000000.0;\n\t\/\/ should be APR_USEC_PER_SEC, but that relies on INT64_C which\n\t\/\/ isn't defined in glib under our build set up for some reason\n\n\nLLDate::LLDate() : mSecondsSinceEpoch(DATE_EPOCH)\n{\n}\n\nLLDate::LLDate(const LLDate& date) :\n\tmSecondsSinceEpoch(date.mSecondsSinceEpoch)\n{\n}\n\nLLDate::LLDate(F64 seconds_since_epoch) :\n\tmSecondsSinceEpoch(seconds_since_epoch)\n{\n}\n\nLLDate::LLDate(const std::string& iso8601_date)\n{\n\tif(!fromString(iso8601_date))\n\t{\n\t\tllwarns << \"date \" << iso8601_date << \" failed to parse; \"\n\t\t\t<< \"ZEROING IT OUT\" << llendl;\n\t\tmSecondsSinceEpoch = DATE_EPOCH;\n\t}\n}\n\nstd::string LLDate::asString() const\n{\n\tstd::ostringstream stream;\n\ttoStream(stream);\n\treturn stream.str();\n}\n\n\/\/@ brief Converts time in seconds since EPOCH\n\/\/        to RFC 1123 compliant date format\n\/\/        E.g. 1184797044.037586 == Wednesday, 18 Jul 2007 22:17:24 GMT\n\/\/        in RFC 1123. HTTP dates are always in GMT and RFC 1123\n\/\/        is one of the standards used and the prefered format\nstd::string LLDate::asRFC1123() const\n{\n\treturn toHTTPDateString (std::string (\"%A, %d %b %Y %H:%M:%S GMT\"));\n}\n\nLLFastTimer::DeclareTimer FT_DATE_FORMAT(\"Date Format\");\n\nstd::string LLDate::toHTTPDateString (std::string fmt) const\n{\n\tLLFastTimer ft1(FT_DATE_FORMAT);\n\t\n\ttime_t locSeconds = (time_t) mSecondsSinceEpoch;\n\tstruct tm * gmt = gmtime (&locSeconds);\n\treturn toHTTPDateString(gmt, fmt);\n}\n\nstd::string LLDate::toHTTPDateString (tm * gmt, std::string fmt)\n{\n\tLLFastTimer ft1(FT_DATE_FORMAT);\n\n\t\/\/ avoid calling setlocale() unnecessarily - it's expensive.\n\tstatic std::string prev_locale = \"\";\n\tstd::string this_locale = LLStringUtil::getLocale();\n\tif (this_locale != prev_locale)\n\t{\n\t\tsetlocale(LC_TIME, this_locale.c_str());\n\t\tprev_locale = this_locale;\n\t}\n\n\t\/\/ use strftime() as it appears to be faster than std::time_put\n\tchar buffer[128];\n\tstrftime(buffer, 128, fmt.c_str(), gmt);\n\tstd::string res(buffer);\n#if LL_WINDOWS\n\t\/\/ Convert from locale-dependant charset to UTF-8 (EXT-8524).\n\tres = ll_convert_string_to_utf8_string(res);\n#endif\n\treturn res;\n}\n\nvoid LLDate::toStream(std::ostream& s) const\n{\n\tapr_time_t time = (apr_time_t)(mSecondsSinceEpoch * LL_APR_USEC_PER_SEC);\n\t\n\tapr_time_exp_t exp_time;\n\tif (apr_time_exp_gmt(&exp_time, time) != APR_SUCCESS)\n\t{\n\t\ts << \"1970-01-01T00:00:00Z\";\n\t\treturn;\n\t}\n\t\n\ts << std::dec << std::setfill('0');\n#if( LL_WINDOWS || __GNUC__ > 2)\n\ts << std::right;\n#else\n\ts.setf(ios::right);\n#endif\n\ts\t\t << std::setw(4) << (exp_time.tm_year + 1900)\n\t  << '-' << std::setw(2) << (exp_time.tm_mon + 1)\n\t  << '-' << std::setw(2) << (exp_time.tm_mday)\n\t  << 'T' << std::setw(2) << (exp_time.tm_hour)\n\t  << ':' << std::setw(2) << (exp_time.tm_min)\n\t  << ':' << std::setw(2) << (exp_time.tm_sec);\n\tif (exp_time.tm_usec > 0)\n\t{\n\t\ts << '.' << std::setw(2)\n\t\t  << (int)(exp_time.tm_usec \/ (LL_APR_USEC_PER_SEC \/ 100));\n\t}\n\ts << 'Z'\n\t  << std::setfill(' ');\n}\n\nbool LLDate::split(S32 *year, S32 *month, S32 *day, S32 *hour, S32 *min, S32 *sec) const\n{\n\tapr_time_t time = (apr_time_t)(mSecondsSinceEpoch * LL_APR_USEC_PER_SEC);\n\t\n\tapr_time_exp_t exp_time;\n\tif (apr_time_exp_gmt(&exp_time, time) != APR_SUCCESS)\n\t{\n\t\treturn false;\n\t}\n\n\tif (year)\n\t\t*year = exp_time.tm_year + 1900;\n\n\tif (month)\n\t\t*month = exp_time.tm_mon + 1;\n\n\tif (day)\n\t\t*day = exp_time.tm_mday;\n\n\tif (hour)\n\t\t*hour = exp_time.tm_hour;\n\n\tif (min)\n\t\t*min = exp_time.tm_min;\n\n\tif (sec)\n\t\t*sec = exp_time.tm_sec;\n\n\treturn true;\n}\n\nbool LLDate::fromString(const std::string& iso8601_date)\n{\n\tstd::istringstream stream(iso8601_date);\n\treturn fromStream(stream);\n}\n\nbool LLDate::fromStream(std::istream& s)\n{\n\tstruct apr_time_exp_t exp_time;\n\tapr_int32_t tm_part;\n\tint c;\n\t\n\ts >> tm_part;\n\texp_time.tm_year = tm_part - 1900;\n\tc = s.get(); \/\/ skip the hypen\n\tif (c != '-') { return false; }\n\ts >> tm_part;\n\texp_time.tm_mon = tm_part - 1;\n\tc = s.get(); \/\/ skip the hypen\n\tif (c != '-') { return false; }\n\ts >> tm_part;\n\texp_time.tm_mday = tm_part;\n\t\n\tc = s.get(); \/\/ skip the T\n\tif (c != 'T') { return false; }\n\t\n\ts >> tm_part;\n\texp_time.tm_hour = tm_part;\n\tc = s.get(); \/\/ skip the :\n\tif (c != ':') { return false; }\n\ts >> tm_part;\n\texp_time.tm_min = tm_part;\n\tc = s.get(); \/\/ skip the :\n\tif (c != ':') { return false; }\n\ts >> tm_part;\n\texp_time.tm_sec = tm_part;\n\n\t\/\/ zero out the unused fields\n\texp_time.tm_usec = 0;\n\texp_time.tm_wday = 0;\n\texp_time.tm_yday = 0;\n\texp_time.tm_isdst = 0;\n\texp_time.tm_gmtoff = 0;\n\n\t\/\/ generate a time_t from that\n\tapr_time_t time;\n\tif (apr_time_exp_gmt_get(&time, &exp_time) != APR_SUCCESS)\n\t{\n\t\treturn false;\n\t}\n\t\n\tF64 seconds_since_epoch = time \/ LL_APR_USEC_PER_SEC;\n\n\t\/\/ check for fractional\n\tc = s.peek();\n\tif(c == '.')\n\t{\n\t\tF64 fractional = 0.0;\n\t\ts >> fractional;\n\t\tseconds_since_epoch += fractional;\n\t}\n\n\tc = s.peek(); \/\/ check for offset\n\tif (c == '+' || c == '-')\n\t{\n\t\tS32 offset_sign = (c == '+') ? 1 : -1;\n\t\tS32 offset_hours = 0;\n\t\tS32 offset_minutes = 0;\n\t\tS32 offset_in_seconds = 0;\n\n\t\ts >> offset_hours;\n\n\t\tc = s.get(); \/\/ skip the colon a get the minutes if there are any\n\t\tif (c == ':')\n\t\t{\t\t\n\t\t\ts >> offset_minutes;\n\t\t}\n\t\t\n\t\toffset_in_seconds =  (offset_hours * 60 + offset_sign * offset_minutes) * 60;\n\t\tseconds_since_epoch -= offset_in_seconds;\n\t}\n\telse if (c != 'Z') { return false; } \/\/ skip the Z\n\n\tmSecondsSinceEpoch = seconds_since_epoch;\n\treturn true;\n}\n\nbool LLDate::fromYMDHMS(S32 year, S32 month, S32 day, S32 hour, S32 min, S32 sec)\n{\n\tstruct apr_time_exp_t exp_time;\n\t\n\texp_time.tm_year = year - 1900;\n\texp_time.tm_mon = month - 1;\n\texp_time.tm_mday = day;\n\texp_time.tm_hour = hour;\n\texp_time.tm_min = min;\n\texp_time.tm_sec = sec;\n\n\t\/\/ zero out the unused fields\n\texp_time.tm_usec = 0;\n\texp_time.tm_wday = 0;\n\texp_time.tm_yday = 0;\n\texp_time.tm_isdst = 0;\n\texp_time.tm_gmtoff = 0;\n\n\t\/\/ generate a time_t from that\n\tapr_time_t time;\n\tif (apr_time_exp_gmt_get(&time, &exp_time) != APR_SUCCESS)\n\t{\n\t\treturn false;\n\t}\n\t\n\tmSecondsSinceEpoch = time \/ LL_APR_USEC_PER_SEC;\n\n\treturn true;\n}\n\nF64 LLDate::secondsSinceEpoch() const\n{\n\treturn mSecondsSinceEpoch;\n}\n\nvoid LLDate::secondsSinceEpoch(F64 seconds)\n{\n\tmSecondsSinceEpoch = seconds;\n}\n\n\/* static *\/ LLDate LLDate::now()\n{\n\t\/\/ time() returns seconds, we want fractions of a second, which LLTimer provides --RN\n\treturn LLDate(LLTimer::getTotalSeconds());\n}\n\nbool LLDate::operator<(const LLDate& rhs) const\n{\n    return mSecondsSinceEpoch < rhs.mSecondsSinceEpoch;\n}\n\nstd::ostream& operator<<(std::ostream& s, const LLDate& date)\n{\n\tdate.toStream(s);\n\treturn s;\n}\n\nstd::istream& operator>>(std::istream& s, LLDate& date)\n{\n\tdate.fromStream(s);\n\treturn s;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ArchiveExtractor.h\"\n#include \"BigFix\/ArchiveReader.h\"\n#include \"BigFix\/ArgParser.h\"\n#include \"BigFix\/DataRef.h\"\n#include \"BigFix\/Filesystem.h\"\n#include \"BigFix\/InflateStream.h\"\n#include <iostream>\n\nusing namespace BigFix;\n\nstatic void PrintUsage()\n{\n  std::cout\n    << \"Usage:\\n\"\n       \"  bfarchive -a <source file or directory> <name of archive>\\n\"\n       \"  bfarchive -x <source archive> <target directory>\\n\"\n       \"  bfarchive -l <source archive>\\n\"\n       \"\\n\"\n       \"Where:\\n\"\n       \"  -a, --archive    Create an archive\\n\"\n       \"  -h, --help       Print this help message\\n\"\n       \"  -l, --list       List the archive contents\\n\"\n       \"  -v, --verbose    Print every file and directory as it is processed\\n\"\n       \"  -V, --version    Print the version and exit\\n\"\n       \"  -x, --extract    Extract an archive\\n\";\n}\n\nint main( int argc, const char* argv[] )\n{\n  try\n  {\n    ArgParser argParser;\n    argParser.AddOption( 'a', \"archive\" );\n    argParser.AddOption( 'h', \"help\" );\n    argParser.AddOption( 'l', \"list\" );\n    argParser.AddOption( 'v', \"verbose\" );\n    argParser.AddOption( 'V', \"version\" );\n    argParser.AddOption( 'x', \"extract\" );\n    argParser.Parse( argc, argv );\n\n    if ( argParser.HasOption( 'h' ) )\n    {\n      PrintUsage();\n    }\n    else if ( argParser.HasOption( 'V' ) )\n    {\n      std::cout << \"Print version\\n\";\n    }\n    else if ( argParser.HasOption( 'a' ) )\n    {\n      std::cout << \"Create archive\\n\";\n\n      if ( argParser.HasOption( 'v' ) )\n        std::cout << \"Verbose\\n\";\n    }\n    else if ( argParser.HasOption( 'x' ) )\n    {\n      std::cout << \"Extract archive\\n\";\n\n      if ( argParser.HasOption( 'v' ) )\n        std::cout << \"Verbose\\n\";\n    }\n    else if ( argParser.HasOption( 'l' ) )\n    {\n      std::cout << \"List archive\\n\";\n    }\n    else\n    {\n      PrintUsage();\n    }\n  }\n  catch ( const std::exception& err )\n  {\n    std::cerr << \"Error: \" << err.what() << std::endl;\n    return 1;\n  }\n\n  return 0;\n}\n<commit_msg>Look for the long name so it's easier to read<commit_after>#include \"ArchiveExtractor.h\"\n#include \"BigFix\/ArchiveReader.h\"\n#include \"BigFix\/ArgParser.h\"\n#include \"BigFix\/DataRef.h\"\n#include \"BigFix\/Filesystem.h\"\n#include \"BigFix\/InflateStream.h\"\n#include <iostream>\n\nusing namespace BigFix;\n\nstatic void PrintUsage()\n{\n  std::cout\n    << \"Usage:\\n\"\n       \"  bfarchive -a <source file or directory> <name of archive>\\n\"\n       \"  bfarchive -x <source archive> <target directory>\\n\"\n       \"  bfarchive -l <source archive>\\n\"\n       \"\\n\"\n       \"Where:\\n\"\n       \"  -a, --create     Create an archive\\n\"\n       \"  -x, --extract    Extract an archive\\n\"\n       \"  -h, --help       Print this help message\\n\"\n       \"  -l, --list       List the archive contents\\n\"\n       \"  -v, --verbose    Print every file and directory as it is processed\\n\"\n       \"  -V, --version    Print the version and exit\\n\";\n}\n\nint main( int argc, const char* argv[] )\n{\n  try\n  {\n    ArgParser argParser;\n    argParser.AddOption( 'a', \"create\" );\n    argParser.AddOption( 'h', \"help\" );\n    argParser.AddOption( 'l', \"list\" );\n    argParser.AddOption( 'v', \"verbose\" );\n    argParser.AddOption( 'V', \"version\" );\n    argParser.AddOption( 'x', \"extract\" );\n    argParser.Parse( argc, argv );\n\n    if ( argParser.HasOption( \"help\" ) )\n    {\n      PrintUsage();\n    }\n    else if ( argParser.HasOption( \"version\" ) )\n    {\n      std::cout << \"Print version\\n\";\n    }\n    else if ( argParser.HasOption( \"create\" ) )\n    {\n      std::cout << \"Create archive\\n\";\n\n      if ( argParser.HasOption( \"verbose\" ) )\n        std::cout << \"Verbose\\n\";\n    }\n    else if ( argParser.HasOption( \"extract\" ) )\n    {\n      std::cout << \"Extract archive\\n\";\n\n      if ( argParser.HasOption( \"verbose\" ) )\n        std::cout << \"Verbose\\n\";\n    }\n    else if ( argParser.HasOption( \"list\" ) )\n    {\n      std::cout << \"List archive\\n\";\n    }\n    else\n    {\n      PrintUsage();\n      return 1;\n    }\n  }\n  catch ( const std::exception& err )\n  {\n    std::cerr << \"Error: \" << err.what() << std::endl;\n    return 1;\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  This file is part of KDE Kontact.\n\n  Copyright (c) 2003 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 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  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 \"aboutdialog.h\"\n#include \"core.h\"\n#include \"plugin.h\"\n\n#include <kdebug.h>\n#include <klocale.h>\n#include <kcomponentdata.h>\n#include <kaboutdata.h>\n#include <ktextbrowser.h>\n#include <kicon.h>\n\n#include <QLayout>\n#include <QLabel>\n#include <QTextEdit>\n\nusing namespace Kontact;\n\nAboutDialog::AboutDialog( Kontact::Core *core )\n  : KPageDialog( core ), mCore( core )\n{\n  setCaption( i18n( \"About Kontact\" ) );\n  setButtons( Ok );\n  setDefaultButton( Ok );\n  setModal( false );\n  showButtonSeparator( true );\n  setFaceType( KPageDialog::List );\n  addAboutData( i18n( \"Kontact Container\" ), QString( \"kontact\" ),\n                KGlobal::mainComponent().aboutData() );\n\n  QList<Plugin*> plugins = mCore->pluginList();\n  QList<Plugin*>::ConstIterator end = plugins.constEnd();\n  QList<Plugin*>::ConstIterator it = plugins.constBegin();\n  for ( ; it != end; ++it ) {\n    addAboutPlugin( *it );\n  }\n\n  addLicenseText( KGlobal::mainComponent().aboutData() );\n\n  setInitialSize( QSize( 600, 400 ) );\n  restoreDialogSize( KConfigGroup( KGlobal::config(), \"AboutDialog\" ) );\n  connect( this, SIGNAL(finished(int)), this, SLOT(saveSize()) );\n}\n\nvoid AboutDialog::saveSize()\n{\n  KConfigGroup group( KGlobal::config(), \"AboutDialog\" );\n  saveDialogSize( group );\n  group.sync();\n}\n\nvoid AboutDialog::addAboutPlugin( Kontact::Plugin *plugin )\n{\n  addAboutData( plugin->title(), plugin->icon(), plugin->aboutData() );\n}\n\nvoid AboutDialog::addAboutData( const QString &title, const QString &icon,\n                                const KAboutData *about )\n{\n  QIcon pixmap = KIcon( icon );\n\n  QFrame *topFrame = new QFrame();\n  KPageWidgetItem *pageItem = new KPageWidgetItem( topFrame, title );\n  pageItem->setIcon( KIcon( pixmap ) );\n\n  addPage( pageItem );\n\n  QBoxLayout *topLayout = new QVBoxLayout( topFrame );\n\n  if ( !about ) {\n    QLabel *label = new QLabel( i18n( \"No about information available.\" ), topFrame );\n    topLayout->addWidget( label );\n  } else {\n    QString text;\n\n    text += \"<p>\";\n    text += \"<b>\" + about->programName() + \"<\/b>\";\n    text += \"<br>\";\n\n    text += i18n( \"Version %1\", about->version() );\n    text += \"<\/p>\";\n\n    if ( !about->shortDescription().isEmpty() ) {\n      text += \"<p>\" + about->shortDescription() + \"<br>\" +\n               about->copyrightStatement() + \"<\/p>\";\n    }\n\n    QString home = about->homepage();\n    if ( !home.isEmpty() ) {\n      text += \"<a href=\\\"\" + home + \"\\\">\" + home + \"<\/a><br>\";\n    }\n\n    text.replace( \"\\n\", \"<br>\" );\n\n    QLabel *label = new QLabel( text, topFrame );\n    label->setAlignment( Qt::AlignTop );\n    label->setOpenExternalLinks(true);\n    label->setTextInteractionFlags(\n      Qt::TextSelectableByMouse | Qt::TextSelectableByKeyboard | Qt::LinksAccessibleByMouse );\n    topLayout->addWidget( label );\n\n    QTextEdit *personView = new QTextEdit( topFrame ); \/\/krazy:exclude=qclasses\n    personView->setReadOnly( true );\n    topLayout->addWidget( personView, 1 );\n\n    text = \"\";\n\n    text +=\"\\\n    <i>This Free Software product was improved as part of a commercial project:<\/i>\\\n    <h3>Credits<\/h3>\\\n    v20080902.2  Project Kowi (March 2007 - )<br \/><br \/>\\\n    \\\n    <b>Production \/ Project Coordination<\/b><br \/>\\\n    Bernhard Reiter<br \/>\\\n    <b>Director of Development<\/b><br \/>\\\n    Till Adam\\\n    <br \/><br \/>\\\n    \\\n    <table border=\\\"0\\\" width=\\\"100%\\\"> \\\n    <tr>\\\n     <td colspan=\\\"2\\\">\\\n      <b>Osnabr&uuml;ck Unit, Intevation GmbH<\/b>\\\n     <\/td>\\\n    <\/tr>\\\n    <tr>\\\n     <td width=\\\"60%\\\">\\\n      Unit Lead<br \/>\\\n      Senior QA, Packaging<br \/>\\\n      QA, Packaging<br \/>\\\n      Additional NSIS<br \/>\\\n      Backup Coordinator\\\n     <\/td>\\\n     <td>\\\n      Bernhard Reiter<br \/>\\\n      Bernhard Herzog<br \/>\\\n      Ludwig Reiter<br \/>\\\n      Emanuel Sch&uuml;tze<br \/>\\\n      Dr. Jan-Oliver Wagner\\\n     <\/td>\\\n    <\/tr>\\\n    <\/table>\\\n    <br \/><br \/>\\\n    \\\n    <table border=\\\"0\\\" width=\\\"100%\\\">\\\n    <tr>\\\n     <td colspan=\\\"2\\\">\\\n        <b>Berlin Unit, Klar&auml;lvdalens Datakonsult AB<\/b>\\\n     <\/td>\\\n    <\/tr>\\\n    <tr>\\\n     <td width=\\\"60%\\\">\\\n      Unit Lead<br \/>\\\n      Development<br \/>\\\n      Development<br \/>\\\n      Additional D. + Crypto<br \/>\\\n      Crypto GUI Development\\\n     <\/td>\\\n     <td>\\\n      Till Adam<br \/>\\\n      Jaroslaw Staniek<br \/>\\\n      Volker Krause<br \/>\\\n      Frank Osterfeld<br \/>\\\n      Marc Mutz\\\n     <\/td>\\\n    <\/tr>\\\n    <\/table>\\\n    <br \/><br \/>\\\n    \\\n    <table border=\\\"0\\\" width=\\\"100%\\\">\\\n    <tr>\\\n     <td colspan=\\\"2\\\">\\\n      <b>D&uuml;sseldorf Unit, g10 Code GmbH<\/b>\\\n     <\/td>\\\n    <\/tr>\\\n    <tr>\\\n     <td width=\\\"60%\\\">\\\n      Crypto-Backend Porting<br \/>\\\n      Crypto-Backend\\\n     <\/td>\\\n     <td>\\\n      Werner Koch<br \/>\\\n      Marcus Brinkmann\\\n     <\/td>\\\n    <\/tr>\\\n    <\/table>\\\n    <br \/><br \/>\\\n    \\\n    <table border=\\\"0\\\" width=\\\"100%\\\">\\\n    <tr>\\\n     <td colspan=\\\"2\\\">\\\n      <b>External QA Darmstadt, basysKom GmbH<\/b>\\\n     <\/td>\\\n    <\/tr>\\\n    <tr>\\\n     <td width=\\\"60%\\\">\\\n      Unit-Lead\\\n     <\/td>\\\n     <td>\\\n      Dr. Stefan Werden\\\n     <\/td>\\\n    <\/tr>\\\n    <\/table><br \/><br \/>\";\n\n    const QList<KAboutPerson> authors = about->authors();\n    if ( !authors.isEmpty() ) {\n      text += i18n( \"<p><b>Authors:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = authors.begin(); it != authors.end(); ++it ) {\n        text += formatPerson( (*it).name(), (*it).emailAddress() );\n        if ( !(*it).task().isEmpty() ) {\n          text += \"<i>\" + (*it).task() + \"<\/i><br>\";\n        }\n      }\n    }\n\n    const QList<KAboutPerson> credits = about->credits();\n    if ( !credits.isEmpty() ) {\n      text += i18n( \"<p><b>Thanks to:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = credits.begin(); it != credits.end(); ++it ) {\n        text += formatPerson( (*it).name(), (*it).emailAddress() );\n        if ( !(*it).task().isEmpty() ) {\n          text += \"<i>\" + (*it).task() + \"<\/i><br>\";\n        }\n      }\n    }\n\n    const QList<KAboutPerson> translators = about->translators();\n    if ( !translators.isEmpty() ) {\n      text += i18n( \"<p><b>Translators:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = translators.begin(); it != translators.end(); ++it ) {\n       text += formatPerson( (*it).name(), (*it).emailAddress() );\n      }\n    }\n\n    personView->setText( text );\n  }\n}\n\nQString AboutDialog::formatPerson( const QString &name, const QString &email )\n{\n  QString text = name;\n  if ( !email.isEmpty() ) {\n    text += \" &lt;<a href=\\\"mailto:\" + email + \"\\\">\" + email + \"<\/a>&gt;\";\n  }\n\n  text += \"<br>\";\n  return text;\n}\n\nvoid AboutDialog::addLicenseText( const KAboutData *about )\n{\n  if ( !about || about->license().isEmpty() ) {\n    return;\n  }\n\n  QPixmap pixmap = KIconLoader::global()->loadIcon( \"help-about\",\n                                                    KIconLoader::Desktop, 48 );\n\n  QString title = i18n( \"%1 License\", about->programName() );\n\n  QFrame *topFrame = new QFrame();\n  KPageWidgetItem *page = new KPageWidgetItem( topFrame, title );\n  page->setIcon( KIcon( pixmap ) );\n  addPage( page );\n  QBoxLayout *topLayout = new QVBoxLayout( topFrame );\n\n  KTextBrowser *textBrowser = new KTextBrowser( topFrame );\n  textBrowser->setHtml( QString( \"<pre>%1<\/pre>\" ).arg( about->license() ) );\n\n  topLayout->addWidget( textBrowser );\n}\n\n#include \"aboutdialog.moc\"\n<commit_msg>No date code here.<commit_after>\/*\n  This file is part of KDE Kontact.\n\n  Copyright (c) 2003 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 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  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 \"aboutdialog.h\"\n#include \"core.h\"\n#include \"plugin.h\"\n\n#include <kdebug.h>\n#include <klocale.h>\n#include <kcomponentdata.h>\n#include <kaboutdata.h>\n#include <ktextbrowser.h>\n#include <kicon.h>\n\n#include <QLayout>\n#include <QLabel>\n#include <QTextEdit>\n\nusing namespace Kontact;\n\nAboutDialog::AboutDialog( Kontact::Core *core )\n  : KPageDialog( core ), mCore( core )\n{\n  setCaption( i18n( \"About Kontact\" ) );\n  setButtons( Ok );\n  setDefaultButton( Ok );\n  setModal( false );\n  showButtonSeparator( true );\n  setFaceType( KPageDialog::List );\n  addAboutData( i18n( \"Kontact Container\" ), QString( \"kontact\" ),\n                KGlobal::mainComponent().aboutData() );\n\n  QList<Plugin*> plugins = mCore->pluginList();\n  QList<Plugin*>::ConstIterator end = plugins.constEnd();\n  QList<Plugin*>::ConstIterator it = plugins.constBegin();\n  for ( ; it != end; ++it ) {\n    addAboutPlugin( *it );\n  }\n\n  addLicenseText( KGlobal::mainComponent().aboutData() );\n\n  setInitialSize( QSize( 600, 400 ) );\n  restoreDialogSize( KConfigGroup( KGlobal::config(), \"AboutDialog\" ) );\n  connect( this, SIGNAL(finished(int)), this, SLOT(saveSize()) );\n}\n\nvoid AboutDialog::saveSize()\n{\n  KConfigGroup group( KGlobal::config(), \"AboutDialog\" );\n  saveDialogSize( group );\n  group.sync();\n}\n\nvoid AboutDialog::addAboutPlugin( Kontact::Plugin *plugin )\n{\n  addAboutData( plugin->title(), plugin->icon(), plugin->aboutData() );\n}\n\nvoid AboutDialog::addAboutData( const QString &title, const QString &icon,\n                                const KAboutData *about )\n{\n  QIcon pixmap = KIcon( icon );\n\n  QFrame *topFrame = new QFrame();\n  KPageWidgetItem *pageItem = new KPageWidgetItem( topFrame, title );\n  pageItem->setIcon( KIcon( pixmap ) );\n\n  addPage( pageItem );\n\n  QBoxLayout *topLayout = new QVBoxLayout( topFrame );\n\n  if ( !about ) {\n    QLabel *label = new QLabel( i18n( \"No about information available.\" ), topFrame );\n    topLayout->addWidget( label );\n  } else {\n    QString text;\n\n    text += \"<p>\";\n    text += \"<b>\" + about->programName() + \"<\/b>\";\n    text += \"<br>\";\n\n    text += i18n( \"Version %1\", about->version() );\n    text += \"<\/p>\";\n\n    if ( !about->shortDescription().isEmpty() ) {\n      text += \"<p>\" + about->shortDescription() + \"<br>\" +\n               about->copyrightStatement() + \"<\/p>\";\n    }\n\n    QString home = about->homepage();\n    if ( !home.isEmpty() ) {\n      text += \"<a href=\\\"\" + home + \"\\\">\" + home + \"<\/a><br>\";\n    }\n\n    text.replace( \"\\n\", \"<br>\" );\n\n    QLabel *label = new QLabel( text, topFrame );\n    label->setAlignment( Qt::AlignTop );\n    label->setOpenExternalLinks(true);\n    label->setTextInteractionFlags(\n      Qt::TextSelectableByMouse | Qt::TextSelectableByKeyboard | Qt::LinksAccessibleByMouse );\n    topLayout->addWidget( label );\n\n    QTextEdit *personView = new QTextEdit( topFrame ); \/\/krazy:exclude=qclasses\n    personView->setReadOnly( true );\n    topLayout->addWidget( personView, 1 );\n\n    text = \"\";\n\n    text +=\"\\\n    <i>This Free Software product was improved as part of a commercial project:<\/i>\\\n    <h3>Credits<\/h3>\\\n    Project Kowi (March 2007 - )<br \/><br \/>\\\n    \\\n    <b>Production \/ Project Coordination<\/b><br \/>\\\n    Bernhard Reiter<br \/>\\\n    <b>Director of Development<\/b><br \/>\\\n    Till Adam\\\n    <br \/><br \/>\\\n    \\\n    <table border=\\\"0\\\" width=\\\"100%\\\"> \\\n    <tr>\\\n     <td colspan=\\\"2\\\">\\\n      <b>Osnabr&uuml;ck Unit, Intevation GmbH<\/b>\\\n     <\/td>\\\n    <\/tr>\\\n    <tr>\\\n     <td width=\\\"60%\\\">\\\n      Unit Lead<br \/>\\\n      Senior QA, Packaging<br \/>\\\n      QA, Packaging<br \/>\\\n      Additional NSIS<br \/>\\\n      Backup Coordinator\\\n     <\/td>\\\n     <td>\\\n      Bernhard Reiter<br \/>\\\n      Bernhard Herzog<br \/>\\\n      Ludwig Reiter<br \/>\\\n      Emanuel Sch&uuml;tze<br \/>\\\n      Dr. Jan-Oliver Wagner\\\n     <\/td>\\\n    <\/tr>\\\n    <\/table>\\\n    <br \/><br \/>\\\n    \\\n    <table border=\\\"0\\\" width=\\\"100%\\\">\\\n    <tr>\\\n     <td colspan=\\\"2\\\">\\\n        <b>Berlin Unit, Klar&auml;lvdalens Datakonsult AB<\/b>\\\n     <\/td>\\\n    <\/tr>\\\n    <tr>\\\n     <td width=\\\"60%\\\">\\\n      Unit Lead<br \/>\\\n      Development<br \/>\\\n      Development<br \/>\\\n      Additional D. + Crypto<br \/>\\\n      Crypto GUI Development\\\n     <\/td>\\\n     <td>\\\n      Till Adam<br \/>\\\n      Jaroslaw Staniek<br \/>\\\n      Volker Krause<br \/>\\\n      Frank Osterfeld<br \/>\\\n      Marc Mutz\\\n     <\/td>\\\n    <\/tr>\\\n    <\/table>\\\n    <br \/><br \/>\\\n    \\\n    <table border=\\\"0\\\" width=\\\"100%\\\">\\\n    <tr>\\\n     <td colspan=\\\"2\\\">\\\n      <b>D&uuml;sseldorf Unit, g10 Code GmbH<\/b>\\\n     <\/td>\\\n    <\/tr>\\\n    <tr>\\\n     <td width=\\\"60%\\\">\\\n      Crypto-Backend Porting<br \/>\\\n      Crypto-Backend\\\n     <\/td>\\\n     <td>\\\n      Werner Koch<br \/>\\\n      Marcus Brinkmann\\\n     <\/td>\\\n    <\/tr>\\\n    <\/table>\\\n    <br \/><br \/>\\\n    \\\n    <table border=\\\"0\\\" width=\\\"100%\\\">\\\n    <tr>\\\n     <td colspan=\\\"2\\\">\\\n      <b>External QA Darmstadt, basysKom GmbH<\/b>\\\n     <\/td>\\\n    <\/tr>\\\n    <tr>\\\n     <td width=\\\"60%\\\">\\\n      Unit-Lead\\\n     <\/td>\\\n     <td>\\\n      Dr. Stefan Werden\\\n     <\/td>\\\n    <\/tr>\\\n    <\/table><br \/><br \/>\";\n\n    const QList<KAboutPerson> authors = about->authors();\n    if ( !authors.isEmpty() ) {\n      text += i18n( \"<p><b>Authors:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = authors.begin(); it != authors.end(); ++it ) {\n        text += formatPerson( (*it).name(), (*it).emailAddress() );\n        if ( !(*it).task().isEmpty() ) {\n          text += \"<i>\" + (*it).task() + \"<\/i><br>\";\n        }\n      }\n    }\n\n    const QList<KAboutPerson> credits = about->credits();\n    if ( !credits.isEmpty() ) {\n      text += i18n( \"<p><b>Thanks to:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = credits.begin(); it != credits.end(); ++it ) {\n        text += formatPerson( (*it).name(), (*it).emailAddress() );\n        if ( !(*it).task().isEmpty() ) {\n          text += \"<i>\" + (*it).task() + \"<\/i><br>\";\n        }\n      }\n    }\n\n    const QList<KAboutPerson> translators = about->translators();\n    if ( !translators.isEmpty() ) {\n      text += i18n( \"<p><b>Translators:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = translators.begin(); it != translators.end(); ++it ) {\n       text += formatPerson( (*it).name(), (*it).emailAddress() );\n      }\n    }\n\n    personView->setText( text );\n  }\n}\n\nQString AboutDialog::formatPerson( const QString &name, const QString &email )\n{\n  QString text = name;\n  if ( !email.isEmpty() ) {\n    text += \" &lt;<a href=\\\"mailto:\" + email + \"\\\">\" + email + \"<\/a>&gt;\";\n  }\n\n  text += \"<br>\";\n  return text;\n}\n\nvoid AboutDialog::addLicenseText( const KAboutData *about )\n{\n  if ( !about || about->license().isEmpty() ) {\n    return;\n  }\n\n  QPixmap pixmap = KIconLoader::global()->loadIcon( \"help-about\",\n                                                    KIconLoader::Desktop, 48 );\n\n  QString title = i18n( \"%1 License\", about->programName() );\n\n  QFrame *topFrame = new QFrame();\n  KPageWidgetItem *page = new KPageWidgetItem( topFrame, title );\n  page->setIcon( KIcon( pixmap ) );\n  addPage( page );\n  QBoxLayout *topLayout = new QVBoxLayout( topFrame );\n\n  KTextBrowser *textBrowser = new KTextBrowser( topFrame );\n  textBrowser->setHtml( QString( \"<pre>%1<\/pre>\" ).arg( about->license() ) );\n\n  topLayout->addWidget( textBrowser );\n}\n\n#include \"aboutdialog.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KDE Kontact.\n\n    Copyright (c) 2003 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., 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 \"aboutdialog.h\"\n\n#include \"core.h\"\n#include \"plugin.h\"\n\n#include <klocale.h>\n#include <kcomponentdata.h>\n#include <kaboutdata.h>\n#include <ktextbrowser.h>\n#include <kicon.h>\n#include <QLayout>\n#include <QLabel>\n\n#include <kdebug.h>\n\nusing namespace Kontact;\n\nAboutDialog::AboutDialog( Kontact::Core *core )\n  : KPageDialog( core )\n    ,mCore( core )\n{\n  setCaption(i18n(\"About Kontact\"));\n  setButtons(Ok);\n  setDefaultButton(Ok);\n  setModal(false);\n  showButtonSeparator(true);\n  setFaceType(KPageDialog::List);\n  addAboutData( i18n( \"Kontact Container\" ), QString( \"kontact\" ),\n                KGlobal::mainComponent().aboutData() );\n\n  QList<Plugin*> plugins = mCore->pluginList();\n  QList<Plugin*>::ConstIterator end = plugins.end();\n  QList<Plugin*>::ConstIterator it = plugins.begin();\n  for ( ; it != end; ++it )\n    addAboutPlugin( *it );\n\n  addLicenseText( KGlobal::mainComponent().aboutData() );\n\n  setInitialSize(QSize(600, 400));\n  restoreDialogSize(KConfigGroup(KGlobal::config(), \"AboutDialog\"));\n  connect(this, SIGNAL(finished(int)), this, SLOT(saveSize()));\n}\n\nvoid AboutDialog::saveSize()\n{\n  KConfigGroup group(KGlobal::config(), \"AboutDialog\");\n  saveDialogSize(group);\n}\n\nvoid AboutDialog::addAboutPlugin( Kontact::Plugin *plugin )\n{\n  addAboutData( plugin->title(), plugin->icon(), plugin->aboutData() );\n}\n\nvoid AboutDialog::addAboutData( const QString &title, const QString &icon,\n                                const KAboutData *about )\n{\n  QIcon pixmap = KIcon( icon );\n\n  QFrame *topFrame = new QFrame();\n  KPageWidgetItem *pageItem = new KPageWidgetItem( topFrame, title );\n  pageItem->setIcon(KIcon(pixmap));\n\n  addPage( pageItem );\n\n  QBoxLayout *topLayout = new QVBoxLayout( topFrame );\n\n  if ( !about ) {\n    QLabel *label = new QLabel( i18n( \"No about information available.\" ),\n                                topFrame );\n    topLayout->addWidget( label );\n  } else {\n    QString text;\n\n    text += \"<p><b>\" + about->programName() + \"<\/b><br>\";\n\n    text += i18n( \"Version %1<\/p>\", about->version() );\n\n    if ( !about->shortDescription().isEmpty() ) {\n      text += \"<p>\" + about->shortDescription() + \"<br>\" +\n               about->copyrightStatement() + \"<\/p>\";\n    }\n\n    QString home = about->homepage();\n    if ( !home.isEmpty() ) {\n      text += \"<a href=\\\"\" + home + \"\\\">\" + home + \"<\/a><br>\";\n    }\n\n    text.replace( \"\\n\", \"<br>\" );\n\n    QLabel *label = new QLabel( text, topFrame );\n    label->setAlignment( Qt::AlignTop );\n    label->setOpenExternalLinks(true);\n    label->setTextInteractionFlags(Qt::TextSelectableByMouse|Qt::TextSelectableByKeyboard|Qt::LinksAccessibleByMouse);\n    topLayout->addWidget( label );\n\n\n    QTextEdit *personView = new QTextEdit( topFrame );\n    personView->setReadOnly( true );\n    topLayout->addWidget( personView, 1 );\n\n    text = \"\";\n\n    const QList<KAboutPerson> authors = about->authors();\n    if ( !authors.isEmpty() ) {\n      text += i18n( \"<p><b>Authors:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = authors.begin(); it != authors.end(); ++it ) {\n        text += formatPerson( (*it).name(), (*it).emailAddress() );\n        if ( !(*it).task().isEmpty() )\n          text += \"<i>\" + (*it).task() + \"<\/i><br>\";\n      }\n    }\n\n    const QList<KAboutPerson> credits = about->credits();\n    if ( !credits.isEmpty() ) {\n      text += i18n( \"<p><b>Thanks to:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = credits.begin(); it != credits.end(); ++it ) {\n        text += formatPerson( (*it).name(), (*it).emailAddress() );\n        if ( !(*it).task().isEmpty() )\n          text += \"<i>\" + (*it).task() + \"<\/i><br>\";\n      }\n    }\n\n    const QList<KAboutPerson> translators = about->translators();\n    if ( !translators.isEmpty() ) {\n      text += i18n(\"<p><b>Translators:<\/b><\/p>\");\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = translators.begin(); it != translators.end(); ++it ) {\n       text += formatPerson( (*it).name(), (*it).emailAddress() );\n      }\n    }\n\n    personView->setText( text );\n  }\n}\n\nQString AboutDialog::formatPerson( const QString &name, const QString &email )\n{\n  QString text = name;\n  if ( !email.isEmpty() ) {\n    text += \" &lt;<a href=\\\"mailto:\" + email + \"\\\">\" + email + \"<\/a>&gt;\";\n  }\n\n  text += \"<br>\";\n  return text;\n}\n\nvoid AboutDialog::addLicenseText( const KAboutData *about )\n{\n  if ( !about || about->license().isEmpty() )\n    return;\n\n  QPixmap pixmap = KIconLoader::global()->loadIcon( \"help-about\",\n                                                    KIconLoader::Desktop, 48 );\n\n  QString title = i18n( \"%1 License\", about->programName() );\n\n  QFrame *topFrame = new QFrame();\n  KPageWidgetItem *page = new KPageWidgetItem( topFrame, title );\n  page->setIcon(KIcon(pixmap));\n  addPage( page );\n  QBoxLayout *topLayout = new QVBoxLayout( topFrame );\n\n  KTextBrowser *textBrowser = new KTextBrowser( topFrame );\n  textBrowser->setHtml( QString( \"<pre>%1<\/pre>\" ).arg( about->license() ) );\n\n  topLayout->addWidget( textBrowser );\n}\n\n#include \"aboutdialog.moc\"\n<commit_msg>why do I even listen to Till? :)<commit_after>\/*\n    This file is part of KDE Kontact.\n\n    Copyright (c) 2003 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., 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 \"aboutdialog.h\"\n\n#include \"core.h\"\n#include \"plugin.h\"\n\n#include <klocale.h>\n#include <kcomponentdata.h>\n#include <kaboutdata.h>\n#include <ktextbrowser.h>\n#include <kicon.h>\n#include <QLayout>\n#include <QLabel>\n\n#include <kdebug.h>\n\nusing namespace Kontact;\n\nAboutDialog::AboutDialog( Kontact::Core *core )\n  : KPageDialog( core )\n    ,mCore( core )\n{\n  setCaption(i18n(\"About Kontact\"));\n  setButtons(Ok);\n  setDefaultButton(Ok);\n  setModal(false);\n  showButtonSeparator(true);\n  setFaceType(KPageDialog::List);\n  addAboutData( i18n( \"Kontact Container\" ), QString( \"kontact\" ),\n                KGlobal::mainComponent().aboutData() );\n\n  QList<Plugin*> plugins = mCore->pluginList();\n  QList<Plugin*>::ConstIterator end = plugins.end();\n  QList<Plugin*>::ConstIterator it = plugins.begin();\n  for ( ; it != end; ++it )\n    addAboutPlugin( *it );\n\n  addLicenseText( KGlobal::mainComponent().aboutData() );\n\n  setInitialSize(QSize(600, 400));\n  restoreDialogSize(KConfigGroup(KGlobal::config(), \"AboutDialog\"));\n  connect(this, SIGNAL(finished(int)), this, SLOT(saveSize()));\n}\n\nvoid AboutDialog::saveSize()\n{\n  KConfigGroup group(KGlobal::config(), \"AboutDialog\");\n  saveDialogSize(group);\n  group.sync();\n}\n\nvoid AboutDialog::addAboutPlugin( Kontact::Plugin *plugin )\n{\n  addAboutData( plugin->title(), plugin->icon(), plugin->aboutData() );\n}\n\nvoid AboutDialog::addAboutData( const QString &title, const QString &icon,\n                                const KAboutData *about )\n{\n  QIcon pixmap = KIcon( icon );\n\n  QFrame *topFrame = new QFrame();\n  KPageWidgetItem *pageItem = new KPageWidgetItem( topFrame, title );\n  pageItem->setIcon(KIcon(pixmap));\n\n  addPage( pageItem );\n\n  QBoxLayout *topLayout = new QVBoxLayout( topFrame );\n\n  if ( !about ) {\n    QLabel *label = new QLabel( i18n( \"No about information available.\" ),\n                                topFrame );\n    topLayout->addWidget( label );\n  } else {\n    QString text;\n\n    text += \"<p><b>\" + about->programName() + \"<\/b><br>\";\n\n    text += i18n( \"Version %1<\/p>\", about->version() );\n\n    if ( !about->shortDescription().isEmpty() ) {\n      text += \"<p>\" + about->shortDescription() + \"<br>\" +\n               about->copyrightStatement() + \"<\/p>\";\n    }\n\n    QString home = about->homepage();\n    if ( !home.isEmpty() ) {\n      text += \"<a href=\\\"\" + home + \"\\\">\" + home + \"<\/a><br>\";\n    }\n\n    text.replace( \"\\n\", \"<br>\" );\n\n    QLabel *label = new QLabel( text, topFrame );\n    label->setAlignment( Qt::AlignTop );\n    label->setOpenExternalLinks(true);\n    label->setTextInteractionFlags(Qt::TextSelectableByMouse|Qt::TextSelectableByKeyboard|Qt::LinksAccessibleByMouse);\n    topLayout->addWidget( label );\n\n\n    QTextEdit *personView = new QTextEdit( topFrame );\n    personView->setReadOnly( true );\n    topLayout->addWidget( personView, 1 );\n\n    text = \"\";\n\n    const QList<KAboutPerson> authors = about->authors();\n    if ( !authors.isEmpty() ) {\n      text += i18n( \"<p><b>Authors:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = authors.begin(); it != authors.end(); ++it ) {\n        text += formatPerson( (*it).name(), (*it).emailAddress() );\n        if ( !(*it).task().isEmpty() )\n          text += \"<i>\" + (*it).task() + \"<\/i><br>\";\n      }\n    }\n\n    const QList<KAboutPerson> credits = about->credits();\n    if ( !credits.isEmpty() ) {\n      text += i18n( \"<p><b>Thanks to:<\/b><\/p>\" );\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = credits.begin(); it != credits.end(); ++it ) {\n        text += formatPerson( (*it).name(), (*it).emailAddress() );\n        if ( !(*it).task().isEmpty() )\n          text += \"<i>\" + (*it).task() + \"<\/i><br>\";\n      }\n    }\n\n    const QList<KAboutPerson> translators = about->translators();\n    if ( !translators.isEmpty() ) {\n      text += i18n(\"<p><b>Translators:<\/b><\/p>\");\n\n      QList<KAboutPerson>::ConstIterator it;\n      for ( it = translators.begin(); it != translators.end(); ++it ) {\n       text += formatPerson( (*it).name(), (*it).emailAddress() );\n      }\n    }\n\n    personView->setText( text );\n  }\n}\n\nQString AboutDialog::formatPerson( const QString &name, const QString &email )\n{\n  QString text = name;\n  if ( !email.isEmpty() ) {\n    text += \" &lt;<a href=\\\"mailto:\" + email + \"\\\">\" + email + \"<\/a>&gt;\";\n  }\n\n  text += \"<br>\";\n  return text;\n}\n\nvoid AboutDialog::addLicenseText( const KAboutData *about )\n{\n  if ( !about || about->license().isEmpty() )\n    return;\n\n  QPixmap pixmap = KIconLoader::global()->loadIcon( \"help-about\",\n                                                    KIconLoader::Desktop, 48 );\n\n  QString title = i18n( \"%1 License\", about->programName() );\n\n  QFrame *topFrame = new QFrame();\n  KPageWidgetItem *page = new KPageWidgetItem( topFrame, title );\n  page->setIcon(KIcon(pixmap));\n  addPage( page );\n  QBoxLayout *topLayout = new QVBoxLayout( topFrame );\n\n  KTextBrowser *textBrowser = new KTextBrowser( topFrame );\n  textBrowser->setHtml( QString( \"<pre>%1<\/pre>\" ).arg( about->license() ) );\n\n  topLayout->addWidget( textBrowser );\n}\n\n#include \"aboutdialog.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/ MMOVE.C -- implementation of MMOVE class\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <ugens.h>\n#include <mixerr.h>\n#include <rt.h>\n#include <rtdefs.h>\n\n#include <common.h>\n#include \"MMOVE.h\"\n\n#undef debug\n\n#ifdef SIG_DEBUG\n#define DBG(stmt) { stmt; }\n#else\n#define DBG(stmt)\n#endif\n\nextern \"C\" int get_path_params(double *rhos, double *thetas, int *cartesian, double *mdiff);\n\n\/\/ Defined in ..\/MOVE\/common.C\nextern double SINARRAY[1025], COSARRAY[1025], ATANARRAY[1025];\n\nstatic const double radpt = 162.99746617261;   \/* converts rads to 1024-element array ptr *\/\nstatic const double radpt2 = 325.9493234522;\n\ninline double SIN(double x) { return SINARRAY[(int)(wrap(x) * radpt + 0.5)]; }\ninline double COS(double x) { return COSARRAY[(int)(wrap(x) * radpt + 0.5)]; }\ninline double ATAN(double x) { return ATANARRAY[(int)((x) * radpt2) + 512]; }\n\nstatic const double LocationUnset = -999999.999999;\n\n\/* ------------------------------------------------------------ makeMOVE --- *\/\nInstrument *makeMMOVE()\n{\n   MOVE *inst;\n\n   inst = new MOVE();\t\/\/ The class is called MOVE, but the inst is MMOVE\n   inst->set_bus_config(\"MMOVE\");\n\n   return inst;\n}\n\nextern Instrument *makeRVB();\t\/\/ From RVB.C\n\n\/* ------------------------------------------------------------ rtprofile --- *\/\nvoid rtprofile()\n{\n   RT_INTRO(\"MMOVE\", makeMMOVE);\n   RT_INTRO(\"RVB\", makeRVB);\n}\n\n\/\/ Move methods\n\nMOVE::MOVE()\n{\n    R_old = -100000.0;\n    T_old = 0.0;\n    m_updateCount = 0;\n    m_updateSamps = BUFLEN;\n    setup_trigfuns();\n    rholoc = new double[ARRAYSIZE];\n    thetaloc = new double[ARRAYSIZE];\n    for (int n = 0; n < 2; n++)\n        for (int o = 0; o < 13; o++)\n\t    oldOutlocs[n][o] = LocationUnset;\t\/\/ to force update\n}\n\nMOVE::~MOVE()\n{\n    delete [] thetaloc;\n    delete [] rholoc;\n}\n\nint MOVE::localInit(double *p, int n_args)\n{\n    if (n_args < 6)\n        return die(name(), \"Wrong number of args.\");\n    m_dist = p[4];\n    m_inchan = n_args > 5 ? (int)p[5] : AVERAGE_CHANS;\n    \n    \/\/ copy global params into instrument\n    \n    if (get_path_params(&rholoc[0], &thetaloc[0], &m_cartflag, &mindiff) < 0)\n\t\t  return die(name(), \"get_path_params failed.\");\n\n\t\/\/ treat mindiff as update rate in seconds\n\tif (mindiff > 0.0) {\n\t\tm_updateSamps = (int) (SR * mindiff + 0.5);\n\t\tif (m_updateSamps <= BUFLEN)\n\t\t{\n\t        setBufferSize(m_updateSamps);\n#ifdef debug\n\t\t\tprintf(\"buffer size reset to %d samples\\n\", getBufferSize());\n#endif\n\t\t}\n\t\t\/\/ if update rate is larger than BUFLEN samples, set buffer size\n\t\t\/\/ to be some integer fraction of the desired update count, then\n\t\t\/\/ reset update count to be multiple of this.\n\t\telse {\n\t\t    int divisor = 2;\n\t\t\tint newBufferLen;\n\t\t\twhile ((newBufferLen = m_updateSamps \/ divisor) > BUFLEN)\n\t\t\t    divisor++;\n\t\t\tsetBufferSize(newBufferLen);\n\t\t\tm_updateSamps = newBufferLen * divisor;\n#ifdef debug\n\t\t\tprintf(\"buffer size reset to %d samples\\n\", getBufferSize());\n#endif\n\t\t}\n#ifdef debug\n\t    printf(\"updating every %d samps\\n\", m_updateSamps);\n#endif\n\t}\n\n    \/\/ tables for positional lookup\n    \n    tableset(SR, m_dur, ARRAYSIZE, tabr);\n    tableset(SR, m_dur, ARRAYSIZE, tabt);\n    \n    return 0;\n}\n\nint MOVE::finishInit(double rvb_time, double *ringdur)\n{\n    *ringdur = rvb_time;\t\/\/ default\n\ttapcount = updatePosition(0);\n    return 0;\n}\n\nvoid MOVE::get_tap(int currentSamp, int chan, int path, int len)\n{\n   Vector *vec = &m_vectors[chan][path];\n   double outloc = vec->outloc;\n   const double oldOutloc = oldOutlocs[chan][path];\n   double delta;\n   if (oldOutloc == LocationUnset)\n       delta = 0.0;\n   else\n       delta = outloc - oldOutloc;\n   oldOutlocs[chan][path] = outloc;\n   \n   double incr = 1.0 + delta \/ len;\n\n   const int tap = currentSamp % m_tapsize;\n   register double otap = (double) tap - outloc;\n   if (otap < 0.0) otap += m_tapsize;\n   double otapPlusOne = otap + 1.0;\n   if (otapPlusOne >= (double) m_tapsize) otapPlusOne -= m_tapsize;\n   \n   double closestToEnd = max(otap, otapPlusOne);\n\n   \/\/ run till one of output taps wrap, or len reached\n\n   int len1 = min(len, m_tapsize - (int) closestToEnd);\n\n   register double *tapdel = m_tapDelay;\n   register double *Sig = vec->Sig;\n   int out = 0;\n   \n   while (out < len)\n   {\n       const int clen = len1;\n       for (int i = 0; i < clen; ++i) {\n\t   int outtap = (int) otap;\n\t   double frac = otap - (double)outtap;\n\t   Sig[out++] = tapdel[outtap] + frac * (tapdel[outtap + 1] - tapdel[outtap]);\n\t   otap += incr;\n       }\n\n       if (otap >= (double) m_tapsize) otap -= m_tapsize;\n       otapPlusOne = otap + 1.0;\n       if (otapPlusOne >= (double) m_tapsize) otapPlusOne -= m_tapsize;\n       closestToEnd = max(otap, otapPlusOne);\n\n       len1 = min(len - out, m_tapsize - (int) closestToEnd);\n   }\n}\n\n\/\/ This gets called every internal buffer's worth of samples.  The actual\n\/\/ update of source angles and delays only happens if we are due for an update\n\/\/ (based on the update count) and there has been a change of position\n\nint MOVE::updatePosition(int currentSamp)\n{\n    double R = tablei(currentSamp, rholoc, tabr);\n    double T = tablei(currentSamp, thetaloc, tabt);\n    int maxtap = tapcount;\n\tm_updateCount -= getBufferSize();\n    if (m_updateCount <= 0 && (R != R_old || T != T_old)) {\n#ifdef debug\n        printf(\"updatePosition[%d]:\\t\\tR: %f  T: %f\\n\", currentSamp, R, T);\n#endif\n\t\tif (roomtrig(R , T, m_dist, m_cartflag)) {\n            return (-1);\n\t\t}\n        \/\/ set taps, return max samp\n        maxtap = tap_set(m_binaural);\n \t    int resetFlag = (currentSamp == 0);\n\t\tairfil_set(resetFlag);\n\t\tif (m_binaural)\n\t\t   earfil_set(resetFlag);\n\t\telse\n\t\t   mike_set();\n\t\tR_old = R;\n\t\tT_old = T;\n\t\tm_updateCount = m_updateSamps;\t\/\/ reset counter\n    }\n    return maxtap;\t\/\/ return new maximum delay in samples\n}\n<commit_msg>Fixed serious bug involving overwrite of tap delay.<commit_after>\/\/ MMOVE.C -- implementation of MMOVE class\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <ugens.h>\n#include <mixerr.h>\n#include <rt.h>\n#include <rtdefs.h>\n#include <assert.h>\n\n#include <common.h>\n#include \"MMOVE.h\"\n\n\/\/#define debug\n\n#ifdef SIG_DEBUG\n#define DBG(stmt) { stmt; }\n#else\n#define DBG(stmt)\n#endif\n\nextern \"C\" int get_path_params(double *rhos, double *thetas, int *cartesian, double *mdiff);\n\n\/\/ Defined in ..\/MOVE\/common.C\nextern double SINARRAY[1025], COSARRAY[1025], ATANARRAY[1025];\n\nstatic const double radpt = 162.99746617261;   \/* converts rads to 1024-element array ptr *\/\nstatic const double radpt2 = 325.9493234522;\n\ninline double SIN(double x) { return SINARRAY[(int)(wrap(x) * radpt + 0.5)]; }\ninline double COS(double x) { return COSARRAY[(int)(wrap(x) * radpt + 0.5)]; }\ninline double ATAN(double x) { return ATANARRAY[(int)((x) * radpt2) + 512]; }\n\nstatic const double LocationUnset = -999999.999999;\n\n\/* ------------------------------------------------------------ makeMOVE --- *\/\nInstrument *makeMMOVE()\n{\n   MOVE *inst;\n\n   inst = new MOVE();\t\/\/ The class is called MOVE, but the inst is MMOVE\n   inst->set_bus_config(\"MMOVE\");\n\n   return inst;\n}\n\nextern Instrument *makeRVB();\t\/\/ From RVB.C\n\n\/* ------------------------------------------------------------ rtprofile --- *\/\nvoid rtprofile()\n{\n   RT_INTRO(\"MMOVE\", makeMMOVE);\n   RT_INTRO(\"RVB\", makeRVB);\n}\n\n\/\/ Move methods\n\nMOVE::MOVE()\n{\n    R_old = -100000.0;\n    T_old = 0.0;\n    m_updateCount = 0;\n    m_updateSamps = BUFLEN;\n    setup_trigfuns();\n    rholoc = new double[ARRAYSIZE];\n    thetaloc = new double[ARRAYSIZE];\n    for (int n = 0; n < 2; n++)\n        for (int o = 0; o < 13; o++)\n\t    oldOutlocs[n][o] = LocationUnset;\t\/\/ to force update\n}\n\nMOVE::~MOVE()\n{\n    delete [] thetaloc;\n    delete [] rholoc;\n}\n\nint MOVE::localInit(double *p, int n_args)\n{\n    if (n_args < 6)\n        return die(name(), \"Wrong number of args.\");\n    m_dist = p[4];\n    m_inchan = n_args > 5 ? (int)p[5] : AVERAGE_CHANS;\n    \n    \/\/ copy global params into instrument\n    \n    if (get_path_params(&rholoc[0], &thetaloc[0], &m_cartflag, &mindiff) < 0)\n\t\t  return die(name(), \"get_path_params failed.\");\n\n\t\/\/ treat mindiff as update rate in seconds\n\tif (mindiff > 0.0) {\n\t\tm_updateSamps = (int) (SR * mindiff + 0.5);\n\t\tif (m_updateSamps <= BUFLEN)\n\t\t{\n\t        setBufferSize(m_updateSamps);\n#ifdef debug\n\t\t\tprintf(\"buffer size reset to %d samples\\n\", getBufferSize());\n#endif\n\t\t}\n\t\t\/\/ if update rate is larger than BUFLEN samples, set buffer size\n\t\t\/\/ to be some integer fraction of the desired update count, then\n\t\t\/\/ reset update count to be multiple of this.\n\t\telse {\n\t\t    int divisor = 2;\n\t\t\tint newBufferLen;\n\t\t\twhile ((newBufferLen = m_updateSamps \/ divisor) > BUFLEN)\n\t\t\t    divisor++;\n\t\t\tsetBufferSize(newBufferLen);\n\t\t\tm_updateSamps = newBufferLen * divisor;\n#ifdef debug\n\t\t\tprintf(\"buffer size reset to %d samples\\n\", getBufferSize());\n#endif\n\t\t}\n#ifdef debug\n\t    printf(\"updating every %d samps\\n\", m_updateSamps);\n#endif\n\t}\n\n    \/\/ tables for positional lookup\n    \n    tableset(SR, m_dur, ARRAYSIZE, tabr);\n    tableset(SR, m_dur, ARRAYSIZE, tabt);\n    \n    return 0;\n}\n\nint MOVE::finishInit(double rvb_time, double *ringdur)\n{\n    *ringdur = rvb_time;\t\/\/ default\n\ttapcount = updatePosition(0);\n    return 0;\n}\n\nvoid MOVE::get_tap(int currentSamp, int chan, int path, int len)\n{\n   Vector *vec = &m_vectors[chan][path];\n   const double outloc = (double) vec->outloc;\n   if (outloc < -40000.0 || outloc > 40000.0) {\n\t   printf(\"WHAM\\n\");\n   }\n   const double oldOutloc = oldOutlocs[chan][path];\n   const double delta = (oldOutloc == LocationUnset) ? 0.0 : outloc - oldOutloc;\n   \n   oldOutlocs[chan][path] = outloc;\n   \n   const double incr = 1.0 + delta \/ len;\n   const int tap = currentSamp % m_tapsize;\n   \n   register double *tapdel = m_tapDelay;\n   register double *Sig = vec->Sig;\n   register double outTap = (double) tap - outloc;\n   if (outTap < 0.0)\n\t   outTap += m_tapsize;\n   int out = 0;\n   \n   while (out < len)\n   {\n\t\tif (outTap >= (double) m_tapsize)\n\t\t\toutTap -= m_tapsize;   \n\t\tint iouttap = (int) outTap;\n\t\tint outTapPlusOne = int(outTap + 1.0);\n\t\tif (outTapPlusOne >= m_tapsize)\n\t\t\toutTapPlusOne -= m_tapsize;   \n\t\tdouble frac = outTap - (double)iouttap;\n\t\tSig[out++] = tapdel[iouttap] + frac * (tapdel[outTapPlusOne] - tapdel[iouttap]);\n\t\toutTap += incr;\n   }\n}\n\n\/\/ This gets called every internal buffer's worth of samples.  The actual\n\/\/ update of source angles and delays only happens if we are due for an update\n\/\/ (based on the update count) and there has been a change of position\n\nint MOVE::updatePosition(int currentSamp)\n{\n    double R = tablei(currentSamp, rholoc, tabr);\n    double T = tablei(currentSamp, thetaloc, tabt);\n    int maxtap = tapcount;\n\tm_updateCount -= getBufferSize();\n    if (m_updateCount <= 0 && (R != R_old || T != T_old)) {\n#ifdef debug\n        printf(\"updatePosition[%d]:\\t\\tR: %f  T: %f\\n\", currentSamp, R, T);\n#endif\n\t\tif (roomtrig(R , T, m_dist, m_cartflag)) {\n            return (-1);\n\t\t}\n        \/\/ set taps, return max samp\n        maxtap = tap_set(m_binaural);\n \t    int resetFlag = (currentSamp == 0);\n\t\tairfil_set(resetFlag);\n\t\tif (m_binaural)\n\t\t   earfil_set(resetFlag);\n\t\telse\n\t\t   mike_set();\n\t\tR_old = R;\n\t\tT_old = T;\n\t\tm_updateCount = m_updateSamps;\t\/\/ reset counter\n    }\n    return maxtap;\t\/\/ return new maximum delay in samples\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ByteString::ToInt64 is atoi the same as ToInt32, and we downcast anyway<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include \"condor_common.h\"\n#include \"exprTree.h\"\n\nvoid help( void );\n\nint \nmain( void )\n{\n\tClassAd \tad;\n\tchar \t\tbuffer1[2048], buffer2[2048];\n\tExprTree\t*expr=NULL, *fexpr=NULL;\n\tint \t\tcommand;\n\tValue\t\tvalue;\n\tSource\t\tsrc;\n\tSink\t\tsnk;\n\n\tsnk.setSink( stdout );\n\n\tprintf( \"'h' for help\\n# \" );\n\twhile( 1 ) {\t\n\t\tcommand = tolower( getchar() );\n\t\tswitch( command ) {\n\t\t\tcase 'c': \n\t\t\t\tad.clear();\n\t\t\t\tbreak;\n\n\t\t\tcase 'd':\n\t\t\t\tif( scanf( \"%s\", buffer1 ) != 1 ) {\n\t\t\t\t\tprintf( \"Error reading attribute name\\n\" );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( !ad.remove( buffer1 ) ) {\n\t\t\t\t\tprintf( \"Error removing attribute %s\\n\", buffer1 );\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase 'e':\n\t\t\t\tfgets( buffer1, 2048, stdin );\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tif( !src.parseExpression( expr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", buffer1 );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tad.evaluate( expr, value );\n\t\t\t\tvalue.toSink( snk );\n\t\t\t\tsnk.flushSink();\n\t\t\t\tdelete expr;\n\t\t\t\texpr = NULL;\n\t\t\t\tbreak;\n\t\t\n\t\t\tcase 'f': \n\t\t\t\tfgets( buffer1, 2048, stdin );\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tif( !src.parseExpression( expr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", buffer1 );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( ad.flatten( expr, value, fexpr ) ) {\n\t\t\t\t\tif( fexpr ) {\n\t\t\t\t\t\tfexpr->toSink( snk );\n\t\t\t\t\t\tdelete fexpr;\n\t\t\t\t\t\tfexpr = NULL;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tvalue.toSink( snk );\n\t\t\t\t\t}\n\t\t\t\t\tsnk.flushSink();\n\t\t\t\t} else {\t\n\t\t\t\t\tprintf( \"Error flattening expression\\n\" );\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase 'h': \n\t\t\t\thelp(); \n\t\t\t\tbreak;\n\n\t\t\tcase 'i':\n\t\t\t\tif( scanf( \"%s\", buffer1 ) != 1 ) {\t\/\/ name\n\t\t\t\t\tprintf( \"Error reading attribute name\\n\" );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tfgets( buffer2, 2048, stdin );\t\t\/\/ expr\n\t\t\t\tsrc.setSource( buffer2, 2048 );\n\t\t\t\tif( !src.parseExpression( expr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", buffer2 );\n\t\t\t\t} \n\t\t\t\tif( !ad.insert( buffer1, expr ) ) {\n\t\t\t\t\tprintf( \"Error inserting expression\\n\" );\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase 'n': \n\t\t\t\tad.clear();\n\t\t\t\tfgets( buffer1, 2048, stdin );\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tif( !src.parseClassAd( &ad ) ) {\n\t\t\t\t\tprintf( \"Error parsing classad\\n\" );\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tcase 'p':\n\t\t\t\tad.toSink( snk );\n\t\t\t\tsnk.flushSink();\n\t\t\t\tbreak;\n\n\t\t\tcase 'q': \n\t\t\t\tprintf( \"Done\\n\\n\" );\n\t\t\t\texit( 0 );\n\n\t\t\tcase 's': \n\t\t\t\tad.clear();\n\t\t\t\tsprintf( buffer1, \"[adc1=[self=.adc1.ad;other=.adc2.ad;ad=[]];\"\n\t\t\t\t\t\t\t\t  \" adc2=[self=.adc2.ad;other=.adc1.ad;ad=[]]]\"\n\t\t\t\t\t\t);\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tad.clear();\n\t\t\t\tif( !src.parseClassAd( &ad ) ) {\n\t\t\t\t\tprintf( \"Error parsing classad: %s\\n\", buffer1 );\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tprintf( \"Unknown command: '%c' -- Ignoring input\\n\", command );\n\t\t\t\tfflush( stdin );\n\t\t}\n\n\t\tfflush( stdin );\n\t\tprintf( \"\\n# \" );\n\t}\n\n\texit( 0 );\n}\n\n\nvoid \nhelp( void )\n{\n\tprintf( \"\\nCommands are:\\n\" );\n\tprintf( \"\\tc\\t\\t- (C)lear toplevel ad\\n\" );\n\tprintf( \"\\td <name>\\t- (D)elete expression from ad\\n\" );\n\tprintf( \"\\te <expr>\\t- (E)valuate expression (in toplevel ad)\\n\" );\t\n\tprintf( \"\\tf <expr>\\t- (F)latten expression (in toplevel ad)\\n\" );\n\tprintf( \"\\th\\t\\t- (H)elp; This screen\\n\" );\n\tprintf( \"\\ti <name> <expr>\\t- (I)nsert expression into toplevel ad\\n\" );\n\tprintf( \"\\tn <classad>\\t- Enter (n)ew toplevel ad\\n\" );\n\tprintf( \"\\to\\t\\t- Output toplevel ad\\n\" );\n\tprintf( \"\\tq\\t\\t- (Q)uit\\n\" );\n\tprintf( \"\\ts\\t\\t- (S)etup Condor toplevel ad\\n\" );\n}\t\n<commit_msg>Upgraded and debugged classad expression interpreter.<commit_after>#include <stdio.h>\n#include \"condor_common.h\"\n\/*\n#include \"condor_config.h\"\n*\/\n#include \"classad_package.h\"\n\nvoid help( void );\n\nint \nmain( void )\n{\n\tClassAd \tad, *adptr;\n\tchar \t\tbuffer1[2048], buffer2[2048];\n\/\/\tchar\t\t*tmp;\n\tExprTree\t*expr=NULL, *fexpr=NULL;\n\tint \t\tcommand;\n\tValue\t\tvalue;\n\tSource\t\tsrc;\n\tSink\t\tsnk;\n\n\tsnk.setSink( stdout );\n\/*\n\tconfig( 0 );\n*\/\n\tprintf( \"'h' for help\\n# \" );\n\twhile( 1 ) {\t\n\t\tcommand = tolower( getchar() );\n\t\tswitch( command ) {\n\t\t\tcase 'c': \n\t\t\t\tad.clear();\n\t\t\t\tbreak;\n\n\t\t\tcase 'd':\n\t\t\t\tif( scanf( \"%s\", buffer1 ) != 1 ) {\t\/\/ expr\n\t\t\t\t\tprintf( \"Error reading primary expression\\n\" );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tif( !src.parseExpression( expr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", buffer1 );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( scanf( \"%s\", buffer1 ) != 1 ) {\n\t\t\t\t\tprintf( \"Error reading attribute name\\n\" );\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\n\t\t\t\tfgets( buffer2, 2048, stdin );\n\t\t\t\tsrc.setSource( buffer2, 2048 );\n\t\t\t\tif( !src.parseExpression( fexpr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", buffer2 );\n\t\t\t\t\tbreak;\n\t\t\t\t} \n\t\t\t\tad.evaluate( expr, value );\n\t\t\t\tif( !value.isClassAdValue( adptr ) ) {\n\t\t\t\t\tprintf( \"Error:  Primary expression was not a classad\\n\" );\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\n\t\t\t\tif( !adptr->insert( buffer1, fexpr ) ) {\n\t\t\t\t\tprintf( \"Error inserting expression\\n\" );\n\t\t\t\t}\n\t\t\t\tdelete expr;\n\t\t\t\tadptr = NULL;\n\t\t\t\texpr  = NULL;\n\t\t\t\tbreak;\n\n\t\t\tcase 'e':\n\t\t\t\tfgets( buffer1, 2048, stdin );\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tif( !src.parseExpression( expr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", buffer1 );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tad.evaluate( expr, value );\n\t\t\t\tvalue.toSink( snk );\n\t\t\t\tsnk.flushSink();\n\t\t\t\tdelete expr;\n\t\t\t\texpr = NULL;\n\t\t\t\tbreak;\n\t\t\n\t\t\tcase 'f': \n\t\t\t\tfgets( buffer1, 2048, stdin );\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tif( !src.parseExpression( expr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", buffer1 );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( ad.flatten( expr, value, fexpr ) ) {\n\t\t\t\t\tif( fexpr ) {\n\t\t\t\t\t\tfexpr->toSink( snk );\n\t\t\t\t\t\tdelete fexpr;\n\t\t\t\t\t\tfexpr = NULL;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tvalue.toSink( snk );\n\t\t\t\t\t}\n\t\t\t\t\tsnk.flushSink();\n\t\t\t\t} else {\t\n\t\t\t\t\tprintf( \"Error flattening expression\\n\" );\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase 'h': \n\t\t\t\thelp(); \n\t\t\t\tbreak;\n\n\t\t\tcase 'i':\n\t\t\t\tif( scanf( \"%s\", buffer1 ) != 1 ) {\n\t\t\t\t\tprintf( \"Error reading attribute name\\n\" );\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\n\t\t\t\tfgets( buffer2, 2048, stdin );\n\t\t\t\tsrc.setSource( buffer2, 2048 );\n\t\t\t\tif( !src.parseExpression( fexpr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", buffer2 );\n\t\t\t\t\tbreak;\n\t\t\t\t} \n\t\t\t\tif( ad.insert( buffer1, expr ) ) {\n\t\t\t\t\tprintf( \"Error inserting expression\\n\" );\n\t\t\t\t}\n\t\t\t\texpr  = NULL;\n\t\t\t\tbreak;\n\n\t\t\tcase 'n': \n\t\t\t\tad.clear();\n\t\t\t\tfgets( buffer1, 2048, stdin );\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tif( !src.parseClassAd( &ad ) ) {\n\t\t\t\t\tprintf( \"Error parsing classad\\n\" );\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tcase 'o':\n\t\t\t\tad.toSink( snk );\n\t\t\t\tsnk.flushSink();\n\t\t\t\tbreak;\n\n\/*\n\t\t\tcase 'p':\n\t\t\t\tfgets( buffer1, 2048, stdin );\n\t\t\t\tif( !( tmp = param( buffer1 ) ) ) {\n\t\t\t\t\tprintf( \"Did not find %s in config file\\n\", buffer1 );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tsrc.setSource( tmp, strlen( tmp ) );\n\t\t\t\tif( !src.parseExpression( expr ) ) {\n\t\t\t\t\tprintf( \"Error parsing expression: %s\\n\", tmp );\n\t\t\t\t\tfree( tmp );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( !ad.insert( buffer1, expr ) ) {\n\t\t\t\t\tprintf( \"Error inserting: %s = %s\\n\", buffer1, tmp );\n\t\t\t\t}\n\t\t\t\tdelete tmp;\n\t\t\t\texpr = NULL;\n\t\t\t\tbreak;\n*\/\n\t\t\t\t\n\t\t\tcase 'q': \n\t\t\t\tprintf( \"Done\\n\\n\" );\n\t\t\t\texit( 0 );\n\n\t\t\tcase 'r':\n\t\t\t\tif( scanf( \"%s\", buffer1 ) != 1 ) {\n\t\t\t\t\tprintf( \"Error reading attribute name\\n\" );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( !ad.remove( buffer1 ) ) {\n\t\t\t\t\tprintf( \"Error removing attribute %s\\n\", buffer1 );\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase 's': \n\t\t\t\tad.clear();\n\t\t\t\tsprintf( buffer1, \"[adc1=[self=.adc1.ad;other=.adc2.ad;ad=[]];\"\n\t\t\t\t\t\t\t\t  \" adc2=[self=.adc2.ad;other=.adc1.ad;ad=[]]]\"\n\t\t\t\t\t\t);\n\t\t\t\tsrc.setSource( buffer1, 2048 );\n\t\t\t\tad.clear();\n\t\t\t\tif( !src.parseClassAd( &ad ) ) {\n\t\t\t\t\tprintf( \"Error parsing classad: %s\\n\", buffer1 );\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tprintf( \"Unknown command: '%c' -- Ignoring input\\n\", command );\n\t\t\t\tfflush( stdin );\n\t\t}\n\n\t\tfflush( stdin );\n\t\tprintf( \"\\n# \" );\n\t}\n\n\texit( 0 );\n}\n\n\nvoid \nhelp( void )\n{\n\tprintf( \"\\nCommands are:\\n\" );\n\tprintf( \"\\tc\\t\\t- (C)lear toplevel ad\\n\" );\n\tprintf( \"\\td <e1><name><e2>- (D)eep insert e2 into classad e1\\n\");\n\tprintf( \"\\te <expr>\\t- (E)valuate expression (in toplevel ad)\\n\" );\t\n\tprintf( \"\\tf <expr>\\t- (F)latten expression (in toplevel ad)\\n\" );\n\tprintf( \"\\th\\t\\t- (H)elp; This screen\\n\" );\n\tprintf( \"\\ti <name><expr>\\t- (I)nsert expression into toplevel ad\\n\" );\n\tprintf( \"\\tn <classad>\\t- Enter (n)ew toplevel ad\\n\" );\n\tprintf( \"\\to\\t\\t- (O)utput toplevel ad\\n\" );\n\/*\n\tprintf( \"\\tp <name>\\t- (P)aram from config file and insert in toplevel\\n\" );\n*\/\n\tprintf( \"\\tq\\t\\t- (Q)uit\\n\" );\n\tprintf( \"\\ts\\t\\t- (S)etup Condor toplevel ad\\n\" );\n}\t\n<|endoftext|>"}
{"text":"<commit_before>#include \"condor_common.h\"\n\n#include <algorithm>\n#include \"ranger.h\"\n\n\n\/\/\/\/\/ ranger insert\/erase\/find implementation \/\/\/\/\/\n\n\nranger::iterator ranger::insert(ranger::range r)\n{\n    \/\/ lower_bound here will coalesce an adjacent disjoint range;\n    \/\/ can use upper_bound instead to avoid this and leave them fractured\n    iterator it_start = lower_bound(r._start);\n    iterator it = it_start;\n    while (it != end() && it->_start <= r._end)  \/\/ '<' for no coalesce\n        ++it;\n\n    iterator it_end = it;\n    if (it_start == it_end)\n        return forest.insert(it_end, r);\n\n    if (it_start->contains(r))\n        return it_start;\n\n    iterator it_back = --it;\n    range rr_new = { std::min(it_start->_start, r._start),\n                     std::max(it_back->_end, r._end) };\n\n    \/\/ update back of affected range in-place\n    it_back->_start = rr_new._start;\n    it_back->_end = rr_new._end;\n\n    return it_start == it_back ? it_back : forest.erase(it_start, it_back);\n}\n\nranger::iterator ranger::erase(ranger::range r)\n{\n    iterator it_start = upper_bound(r._start);\n    iterator it = it_start;\n    while (it != end() && it->_start < r._end)\n        ++it;\n\n    iterator it_end = it;\n    if (it_start == it_end)\n        return it_start;\n\n    iterator it_back = --it;\n    range orig_back = *it_back;\n\n    if (it_start->_start < r._start && r._end < it_start->_end) {\n        \/\/ split a single range\n        it_start->_end = r._start;\n        return forest.insert(it_end, range(r._end, orig_back._end));\n    }\n\n    if (it_start->_start < r._start) {\n        it_start->_end = r._start;\n        ++it_start;\n    }\n\n    if (r._end < orig_back._end) {\n        it_back->_start = r._end;\n        --it_end;\n    }\n\n    return it_start == it_end ? it_end : forest.erase(it_start, it_end);\n}\n\nstd::pair<ranger::iterator, bool>\nranger::find(element_type x) const\n{\n    iterator it = upper_bound(x);\n    return {it, it != end() && it->_start <= x};\n}\n\nbool ranger::contains(element_type x) const\n{\n    return find(x).second;\n}\n\nranger::ranger(const std::initializer_list<ranger::range> &il)\n{\n    for (const range &rr : il)\n        insert(rr);\n}\n\n\n\/\/ specialize lower_bound \/ upper_bound based on forest type\nstatic inline std::set<ranger::range>::const_iterator\nlower_bounder(const std::set<ranger::range> &f, ranger::range rr)\n{\n    return f.lower_bound(rr);\n}\n\nstatic inline std::set<ranger::range>::const_iterator\nupper_bounder(const std::set<ranger::range> &f, ranger::range rr)\n{\n    return f.upper_bound(rr);\n}\n\nstatic inline std::vector<ranger::range>::const_iterator\nlower_bounder(const std::vector<ranger::range> &f, ranger::range rr)\n{\n    return std::lower_bound(f.begin(), f.end(), rr);\n}\n\nstatic inline std::vector<ranger::range>::const_iterator\nupper_bounder(const std::vector<ranger::range> &f, ranger::range rr)\n{\n    return std::upper_bound(f.begin(), f.end(), rr);\n}\n\n\nranger::iterator ranger::lower_bound(element_type x) const\n{\n    return lower_bounder(forest, x);\n}\n\nranger::iterator ranger::upper_bound(element_type x) const\n{\n    return upper_bounder(forest, x);\n}\n\n\n\n\/\/\/\/\/ ranger::elements::iterator implementation \/\/\/\/\/\n\n\n\/* This allows:\n *\n *      for (int i : myranger.get_elements())\n *          process_int(i);\n *\n *\n * Instead of the still-straightforward:\n *\n *      for (auto &rr : myranger)\n *          for (int i : rr)\n *              process_int(i);\n *\/\n\nvoid ranger::elements::iterator::mk_valid()\n{\n    if (!rit_valid) {\n        rit = sit->begin();\n        rit_valid = true;\n    }\n}\n\nranger::element_type ranger::elements::iterator::operator*()\n{\n    mk_valid();\n    return *rit;\n}\n\nranger::elements::iterator &ranger::elements::iterator::operator++()\n{\n    mk_valid();\n    if (++rit == sit->end()) {\n        ++sit;\n        rit_valid = false;\n    }\n    return *this;\n}\n\nranger::elements::iterator &ranger::elements::iterator::operator--()\n{\n    mk_valid();\n    if (rit == sit->begin()) {\n        --sit;\n        rit = sit->end();\n        --rit;\n    }\n    return *this;\n}\n\nbool ranger::elements::iterator::operator==(iterator &it)\n{\n    if (sit != it.sit)\n        return false;\n    if (!rit_valid && !it.rit_valid)\n        return true;\n    \/\/ at this point neither sit nor it.sit points to the end() of its set,\n    \/\/ thus it's OK to call mk_valid() on each, which may dereference *sit\n    mk_valid();\n    it.mk_valid();\n    return rit == it.rit;\n}\n\nbool ranger::elements::iterator::operator!=(iterator &it)\n{\n    return !(*this == it);\n}\n\n\n\n\n\/\/\/\/\/ ranger persist\/load implementation \/\/\/\/\/\n\n\n#include <stdlib.h> \/\/ strtol\n#include <stdio.h>  \/\/ sprintf\n#include <string>\n\n\/*  persist \/ load ranger objects\n *\n *  The serialized format is one or more sub-ranges, separated by semicolons,\n *  where each sub-range is either N-M (for inclusive N..M) or N for a single\n *  integer.  Eg, \"2\", \"5-10\", \"4;7;10-20;44;50-60\"\n *\/\n\nstatic\nvoid persist_range_single(std::string &s, const ranger::range &rr)\n{\n    char buf[64];\n    int n;\n    if (rr._start == rr._end - 1)\n        n = sprintf(buf, \"%d;\", rr._start);\n    else\n        n = sprintf(buf, \"%d-%d;\", rr._start, rr._end - 1);\n    s.append(buf, n);\n}\n\nvoid persist(std::string &s, const ranger &r)\n{\n    s.clear();\n    if (r.empty())\n        return;\n\n    for (auto &rr : r)\n        persist_range_single(s, rr);\n\n    s.erase(s.size() - 1);\n}\n\nvoid persist_range(std::string &s, const ranger &r, const ranger::range &rr)\n{\n    s.clear();\n    if (r.empty())\n        return;\n\n    auto rit = r.find(rr._start).first;\n    for (; rit != r.end() && rit->_start < rr._end; ++rit) {\n        ranger::range rr_new = { std::max(rit->_start, rr._start),\n                                 std::min(rit->_end,   rr._end) };\n        persist_range_single(s, rr_new);\n    }\n\n    s.erase(s.size() - 1);\n}\n\nvoid persist_slice(std::string &s, const ranger &r, int start, int back)\n{\n    persist_range(s, r, {start, back+1});\n}\n\n\/\/ return 0 on success, (-1 - (position in string)) on parse failure\nint load(ranger &r, const char *s)\n{\n    const char *sstart = s;\n    while (*s) {\n        char *sp;\n        int start = strtol(s, &sp, 10);\n        int back;\n        if (s == sp)\n            \/\/ no int parsed is ok as long as we're at the end\n            return *s ? -1 - int(s - sstart) : 0;\n        s = sp;\n        if (*sp == '-') {\n            s++;\n            back = strtol(s, &sp, 10);\n            if (s == sp)\n                \/\/ a number should have followed '-'\n                return -1 - int(s - sstart);\n            s = sp;\n        } else {\n            back = start;\n        }\n        if (*s == ';')\n            s++;\n        else if (*s)\n            \/\/ expected either ';' or end of string\n            return -1 - int(s - sstart);\n        r.insert({start, back + 1});\n    }\n    return 0;\n}\n\n<commit_msg>only update the affected ends of a range for insert<commit_after>#include \"condor_common.h\"\n\n#include <algorithm>\n#include \"ranger.h\"\n\n\n\/\/\/\/\/ ranger insert\/erase\/find implementation \/\/\/\/\/\n\n\nranger::iterator ranger::insert(ranger::range r)\n{\n    \/\/ lower_bound here will coalesce an adjacent disjoint range;\n    \/\/ can use upper_bound instead to avoid this and leave them fractured\n    iterator it_start = lower_bound(r._start);\n    iterator it = it_start;\n    while (it != end() && it->_start <= r._end)  \/\/ '<' for no coalesce\n        ++it;\n\n    iterator it_end = it;\n    if (it_start == it_end)\n        return forest.insert(it_end, r);\n\n    iterator it_back = --it;\n    element_type min_start = std::min(it_start->_start, r._start);\n\n    \/\/ update back of affected range in-place\n    if (min_start < it_back->_start)\n        it_back->_start = min_start;\n\n    if (it_back->_end < r._end)\n        it_back->_end = r._end;\n\n    return it_start == it_back ? it_back : forest.erase(it_start, it_back);\n}\n\nranger::iterator ranger::erase(ranger::range r)\n{\n    iterator it_start = upper_bound(r._start);\n    iterator it = it_start;\n    while (it != end() && it->_start < r._end)\n        ++it;\n\n    iterator it_end = it;\n    if (it_start == it_end)\n        return it_start;\n\n    iterator it_back = --it;\n    range orig_back = *it_back;\n\n    if (it_start->_start < r._start && r._end < it_start->_end) {\n        \/\/ split a single range\n        it_start->_end = r._start;\n        return forest.insert(it_end, range(r._end, orig_back._end));\n    }\n\n    if (it_start->_start < r._start) {\n        it_start->_end = r._start;\n        ++it_start;\n    }\n\n    if (r._end < orig_back._end) {\n        it_back->_start = r._end;\n        --it_end;\n    }\n\n    return it_start == it_end ? it_end : forest.erase(it_start, it_end);\n}\n\nstd::pair<ranger::iterator, bool>\nranger::find(element_type x) const\n{\n    iterator it = upper_bound(x);\n    return {it, it != end() && it->_start <= x};\n}\n\nbool ranger::contains(element_type x) const\n{\n    return find(x).second;\n}\n\nranger::ranger(const std::initializer_list<ranger::range> &il)\n{\n    for (const range &rr : il)\n        insert(rr);\n}\n\n\n\/\/ specialize lower_bound \/ upper_bound based on forest type\nstatic inline std::set<ranger::range>::const_iterator\nlower_bounder(const std::set<ranger::range> &f, ranger::range rr)\n{\n    return f.lower_bound(rr);\n}\n\nstatic inline std::set<ranger::range>::const_iterator\nupper_bounder(const std::set<ranger::range> &f, ranger::range rr)\n{\n    return f.upper_bound(rr);\n}\n\nstatic inline std::vector<ranger::range>::const_iterator\nlower_bounder(const std::vector<ranger::range> &f, ranger::range rr)\n{\n    return std::lower_bound(f.begin(), f.end(), rr);\n}\n\nstatic inline std::vector<ranger::range>::const_iterator\nupper_bounder(const std::vector<ranger::range> &f, ranger::range rr)\n{\n    return std::upper_bound(f.begin(), f.end(), rr);\n}\n\n\nranger::iterator ranger::lower_bound(element_type x) const\n{\n    return lower_bounder(forest, x);\n}\n\nranger::iterator ranger::upper_bound(element_type x) const\n{\n    return upper_bounder(forest, x);\n}\n\n\n\n\/\/\/\/\/ ranger::elements::iterator implementation \/\/\/\/\/\n\n\n\/* This allows:\n *\n *      for (int i : myranger.get_elements())\n *          process_int(i);\n *\n *\n * Instead of the still-straightforward:\n *\n *      for (auto &rr : myranger)\n *          for (int i : rr)\n *              process_int(i);\n *\/\n\nvoid ranger::elements::iterator::mk_valid()\n{\n    if (!rit_valid) {\n        rit = sit->begin();\n        rit_valid = true;\n    }\n}\n\nranger::element_type ranger::elements::iterator::operator*()\n{\n    mk_valid();\n    return *rit;\n}\n\nranger::elements::iterator &ranger::elements::iterator::operator++()\n{\n    mk_valid();\n    if (++rit == sit->end()) {\n        ++sit;\n        rit_valid = false;\n    }\n    return *this;\n}\n\nranger::elements::iterator &ranger::elements::iterator::operator--()\n{\n    mk_valid();\n    if (rit == sit->begin()) {\n        --sit;\n        rit = sit->end();\n        --rit;\n    }\n    return *this;\n}\n\nbool ranger::elements::iterator::operator==(iterator &it)\n{\n    if (sit != it.sit)\n        return false;\n    if (!rit_valid && !it.rit_valid)\n        return true;\n    \/\/ at this point neither sit nor it.sit points to the end() of its set,\n    \/\/ thus it's OK to call mk_valid() on each, which may dereference *sit\n    mk_valid();\n    it.mk_valid();\n    return rit == it.rit;\n}\n\nbool ranger::elements::iterator::operator!=(iterator &it)\n{\n    return !(*this == it);\n}\n\n\n\n\n\/\/\/\/\/ ranger persist\/load implementation \/\/\/\/\/\n\n\n#include <stdlib.h> \/\/ strtol\n#include <stdio.h>  \/\/ sprintf\n#include <string>\n\n\/*  persist \/ load ranger objects\n *\n *  The serialized format is one or more sub-ranges, separated by semicolons,\n *  where each sub-range is either N-M (for inclusive N..M) or N for a single\n *  integer.  Eg, \"2\", \"5-10\", \"4;7;10-20;44;50-60\"\n *\/\n\nstatic\nvoid persist_range_single(std::string &s, const ranger::range &rr)\n{\n    char buf[64];\n    int n;\n    if (rr._start == rr._end - 1)\n        n = sprintf(buf, \"%d;\", rr._start);\n    else\n        n = sprintf(buf, \"%d-%d;\", rr._start, rr._end - 1);\n    s.append(buf, n);\n}\n\nvoid persist(std::string &s, const ranger &r)\n{\n    s.clear();\n    if (r.empty())\n        return;\n\n    for (auto &rr : r)\n        persist_range_single(s, rr);\n\n    s.erase(s.size() - 1);\n}\n\nvoid persist_range(std::string &s, const ranger &r, const ranger::range &rr)\n{\n    s.clear();\n    if (r.empty())\n        return;\n\n    auto rit = r.find(rr._start).first;\n    for (; rit != r.end() && rit->_start < rr._end; ++rit) {\n        ranger::range rr_new = { std::max(rit->_start, rr._start),\n                                 std::min(rit->_end,   rr._end) };\n        persist_range_single(s, rr_new);\n    }\n\n    s.erase(s.size() - 1);\n}\n\nvoid persist_slice(std::string &s, const ranger &r, int start, int back)\n{\n    persist_range(s, r, {start, back+1});\n}\n\n\/\/ return 0 on success, (-1 - (position in string)) on parse failure\nint load(ranger &r, const char *s)\n{\n    const char *sstart = s;\n    while (*s) {\n        char *sp;\n        int start = strtol(s, &sp, 10);\n        int back;\n        if (s == sp)\n            \/\/ no int parsed is ok as long as we're at the end\n            return *s ? -1 - int(s - sstart) : 0;\n        s = sp;\n        if (*sp == '-') {\n            s++;\n            back = strtol(s, &sp, 10);\n            if (s == sp)\n                \/\/ a number should have followed '-'\n                return -1 - int(s - sstart);\n            s = sp;\n        } else {\n            back = start;\n        }\n        if (*s == ';')\n            s++;\n        else if (*s)\n            \/\/ expected either ';' or end of string\n            return -1 - int(s - sstart);\n        r.insert({start, back + 1});\n    }\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n   For more information, please see: http:\/\/software.sci.utah.edu\r\n\r\n   The MIT License\r\n\r\n   Copyright (c) 2008 Scientific Computing and Imaging Institute,\r\n   University of Utah.\r\n\r\n   \r\n   Permission is hereby granted, free of charge, to any person obtaining a\r\n   copy of this software and associated documentation files (the \"Software\"),\r\n   to deal in the Software without restriction, including without limitation\r\n   the rights to use, copy, modify, merge, publish, distribute, sublicense,\r\n   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\r\n   in all copies or substantial portions of the Software.\r\n\r\n   THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r\n   OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n   FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\r\n   THE 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\r\n   FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\r\n   DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n\/**\r\n  \\file    VolumeDataset.cpp\r\n  \\author    Jens Krueger\r\n        SCI Institute\r\n        University of Utah\r\n  \\date    August 2008\r\n*\/\r\n\r\n#include \"VolumeDataset.h\"\r\n\r\n\r\nVolumeDataset::VolumeDataset(const std::string& strFilename) : \r\n  m_strFilename(strFilename),\r\n  m_pVolumeDatasetInfo(NULL),\r\n  m_pHist1D(NULL), \r\n  m_pHist2D(NULL)\r\n{\r\n  LoadDataset();\r\n  ComputeHistogramms();\r\n}\r\n\r\nVolumeDataset::~VolumeDataset()\r\n{\r\n  delete m_pHist1D;\r\n  delete m_pHist2D;\r\n  delete m_pVolumeDatasetInfo;\r\n}\r\n\r\n\r\nbool VolumeDataset::IsLoaded() const\r\n{\r\n  \/\/ TODO\r\n  return true;\r\n}\r\n\r\n\r\nvoid VolumeDataset::LoadDataset() \r\n{\r\n  \/\/ TODO\r\n  m_pVolumeDatasetInfo = new VolumeDatasetInfo(8);\r\n}\r\n\r\nvoid VolumeDataset::ComputeHistogramms() \r\n{\r\n  \/\/ DEBUG CODE\r\n  \/\/ generate a random 1D histogram\r\n  m_pHist1D = new Histogram1D(1<<m_pVolumeDatasetInfo->GetBitwith());\r\n  for (size_t i = 0;i<m_pHist1D->GetSize();i++) m_pHist1D->Set(i, (unsigned int)(i+(rand()*10) \/ RAND_MAX));\r\n  \/\/ generate a random 2D histogram\r\n  m_pHist2D = new Histogram2D(VECTOR2<size_t>(1<<m_pVolumeDatasetInfo->GetBitwith(),256));  \/\/ TODO: decide: always 8bit gradient ?\r\n  for (size_t y = 0;y<m_pHist2D->GetSize().y;y++)\r\n    for (size_t x = 0;x<m_pHist2D->GetSize().x;x++) \r\n      m_pHist2D->Set(x,y,(unsigned int)(x+(rand()*10) \/ RAND_MAX)*(unsigned int)(y+(rand()*10) \/ RAND_MAX));\r\n  \/\/ END DEBUG CODE\r\n}\r\n<commit_msg><commit_after>\/*\r\n   For more information, please see: http:\/\/software.sci.utah.edu\r\n\r\n   The MIT License\r\n\r\n   Copyright (c) 2008 Scientific Computing and Imaging Institute,\r\n   University of Utah.\r\n\r\n   \r\n   Permission is hereby granted, free of charge, to any person obtaining a\r\n   copy of this software and associated documentation files (the \"Software\"),\r\n   to deal in the Software without restriction, including without limitation\r\n   the rights to use, copy, modify, merge, publish, distribute, sublicense,\r\n   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\r\n   in all copies or substantial portions of the Software.\r\n\r\n   THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r\n   OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n   FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\r\n   THE 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\r\n   FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\r\n   DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n\/**\r\n  \\file    VolumeDataset.cpp\r\n  \\author    Jens Krueger\r\n        SCI Institute\r\n        University of Utah\r\n  \\date    August 2008\r\n*\/\r\n\r\n#include \"VolumeDataset.h\"\r\n#include <cstdlib> \r\n\r\nVolumeDataset::VolumeDataset(const std::string& strFilename) : \r\n  m_strFilename(strFilename),\r\n  m_pVolumeDatasetInfo(NULL),\r\n  m_pHist1D(NULL), \r\n  m_pHist2D(NULL)\r\n{\r\n  LoadDataset();\r\n  ComputeHistogramms();\r\n}\r\n\r\nVolumeDataset::~VolumeDataset()\r\n{\r\n  delete m_pHist1D;\r\n  delete m_pHist2D;\r\n  delete m_pVolumeDatasetInfo;\r\n}\r\n\r\n\r\nbool VolumeDataset::IsLoaded() const\r\n{\r\n  \/\/ TODO\r\n  return true;\r\n}\r\n\r\n\r\nvoid VolumeDataset::LoadDataset() \r\n{\r\n  \/\/ TODO\r\n  m_pVolumeDatasetInfo = new VolumeDatasetInfo(8);\r\n}\r\n\r\nvoid VolumeDataset::ComputeHistogramms() \r\n{\r\n  \/\/ DEBUG CODE\r\n  \/\/ generate a random 1D histogram\r\n  m_pHist1D = new Histogram1D(1<<m_pVolumeDatasetInfo->GetBitwith());\r\n  for (size_t i = 0;i<m_pHist1D->GetSize();i++) m_pHist1D->Set(i, (unsigned int)(i+(rand()*10) \/ RAND_MAX));\r\n  \/\/ generate a random 2D histogram\r\n  m_pHist2D = new Histogram2D(VECTOR2<size_t>(1<<m_pVolumeDatasetInfo->GetBitwith(),256));  \/\/ TODO: decide: always 8bit gradient ?\r\n  for (size_t y = 0;y<m_pHist2D->GetSize().y;y++)\r\n    for (size_t x = 0;x<m_pHist2D->GetSize().x;x++) \r\n      m_pHist2D->Set(x,y,(unsigned int)(x+(rand()*10) \/ RAND_MAX)*(unsigned int)(y+(rand()*10) \/ RAND_MAX));\r\n  \/\/ END DEBUG CODE\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Steer TRD QA train for Reconstruction (Clusterizer, Tracking and PID).\n\/\/ \n\/\/ Usage:\n\/\/   run.C(tasks, files, entries)\n\/\/   tasks : \"ALL\" or one\/more of the following:\n\/\/     \"EFF\"  : TRD Tracking Efficiency \n\/\/     \"EFFC\" : TRD Tracking Efficiency Combined (barrel + stand alone) - only in case of simulations\n\/\/     \"RES\"  : TRD tracking Resolution\n\/\/     \"CAL\"  : TRD calibration\n\/\/     \"PID\"  : TRD PID - pion efficiency \n\/\/     \"PIDR\" : TRD PID - reference data\n\/\/     \"DET\"  : Basic TRD Detector checks\n\/\/     \"NOFR\" : Data set does not have AliESDfriends.root \n\/\/     \"NOMC\" : Data set does not have Monte Carlo Informations (real data), so all tasks which rely\n\/\/              on MC information are switched off\n\/\/\n\/\/ In compiled mode : \n\/\/ Don't forget to load first the libraries\n\/\/ gSystem->Load(\"libMemStat.so\")\n\/\/ gSystem->Load(\"libMemStatGui.so\")\n\/\/ gSystem->Load(\"libANALYSIS.so\")\n\/\/ gSystem->Load(\"libTRDqaRec.so\")\n\/\/\n\/\/ Authors:\n\/\/   Alex Bercuci (A.Bercuci@gsi.de) \n\/\/   Markus Fasel (m.Fasel@gsi.de) \n\n#ifndef __CINT__\n#include <Riostream.h>\n\n#include \"TStopwatch.h\"\n#include \"TMemStat.h\"\n#include \"TMemStatViewerGUI.h\"\n\n#include \"TROOT.h\"\n#include \"TSystem.h\"\n#include \"TError.h\"\n#include \"TChain.h\"\n\n#include \"AliMagFMaps.h\"\n#include \"AliTracker.h\"\n#include \"AliLog.h\"\n#include \"AliCDBManager.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisDataContainer.h\"\n#include \"AliMCEventHandler.h\"\n#include \"AliESDInputHandler.h\"\n\n#include \"TRD\/AliTRDtrackerV1.h\"\n#include \"TRD\/AliTRDcalibDB.h\"\n#include \"TRD\/qaRec\/AliTRDtrackInfo\/AliTRDeventInfo.h\"\n#include \"TRD\/qaRec\/AliTRDtrackInfoGen.h\"\n#include \"TRD\/qaRec\/AliTRDtrackingEfficiency.h\"\n#include \"TRD\/qaRec\/AliTRDtrackingEfficiencyCombined.h\"\n#include \"TRD\/qaRec\/AliTRDtrackingResolution.h\"\n#include \"TRD\/qaRec\/AliTRDcalibration.h\"\n#include \"TRD\/qaRec\/AliTRDpidChecker.h\"\n#include \"TRD\/qaRec\/AliTRDpidRefMaker.h\"\n#include \"TRD\/qaRec\/AliTRDcheckDetector.h\"\n#endif\n\n#include \"run.h\"\n\nBool_t MEM = kFALSE;\n\nTChain* CreateESDChain(const char* filename = 0x0, Int_t nfiles=-1 );\nvoid run(Char_t *tasks=\"ALL\", const Char_t *files=0x0, Int_t nmax=-1)\n{\n  TMemStat *mem = 0x0;\n  if(MEM){ \n    gSystem->Load(\"libMemStat.so\");\n    gSystem->Load(\"libMemStatGui.so\");\n    mem = new TMemStat(\"new, gnubuildin\");\n    mem->AddStamp(\"Start\");\n  }\n\n  TStopwatch timer;\n  timer.Start();\n\n  if(gSystem->Load(\"libANALYSIS.so\")<0) return;\n  if(gSystem->Load(\"libTRDqaRec.so\")<0) return;\n  \n  Bool_t fHasMCdata = kTRUE;\n  Bool_t fHasFriends = kTRUE;\n  TObjArray *tasksArray = TString(tasks).Tokenize(\" \");\n\n  Int_t fSteerTask = 0; SETBIT(fSteerTask, kInfoGen);\n  for(Int_t isel = 0; isel < tasksArray->GetEntriesFast(); isel++){\n    TString s = (dynamic_cast<TObjString *>(tasksArray->UncheckedAt(isel)))->String();\n    if(s.CompareTo(\"ALL\") == 0){\n      for(Int_t itask = 1; itask < NTRDTASKS; itask++) SETBIT(fSteerTask, itask);\n      continue;\n    } else if(s.CompareTo(\"NOFR\") == 0){ \n      fHasFriends = kFALSE;\n    } else if(s.CompareTo(\"NOMC\") == 0){ \n      fHasMCdata = kFALSE;\n    } else { \n      Bool_t foundOpt = kFALSE;  \n      for(Int_t itask = 1; itask < NTRDTASKS; itask++){\n        if(s.CompareTo(fgkTRDtaskOpt[itask]) != 0) continue;\n        SETBIT(fSteerTask, itask);\n        foundOpt = kTRUE;\n        break;\n      }\n      if(!foundOpt) Info(\"run.C\", Form(\"Task %s not implemented (yet).\", s.Data()));\n    }\n  }\n  \/\/ define task list pointers;\n  AliTRDrecoTask *taskPtr[NTRDTASKS], *task = 0x0;\n  memset(taskPtr, 0, NTRDTASKS*sizeof(AliAnalysisTask*));\n\n  \/\/____________________________________________\/\/\n  \/\/gROOT->LoadMacro(Form(\"%s\/TRD\/qaRec\/CreateESDChain.C\", gSystem->ExpandPathName(\"$ALICE_ROOT\")));\n  TChain *chain = CreateESDChain(files, nmax);\n  \/\/chain->SetBranchStatus(\"*\", 0);\n  chain->SetBranchStatus(\"*FMD*\",0);\n  chain->SetBranchStatus(\"*Calo*\",0);\n  chain->SetBranchStatus(\"Tracks\", 1);\n  chain->SetBranchStatus(\"ESDfriend*\",1);\n  chain->Lookup();\n  chain->GetListOfFiles()->Print();\n  printf(\"\\n ----> CHAIN HAS %d ENTRIES <----\\n\\n\", (Int_t)chain->GetEntries());\n  \n  AliLog::SetGlobalLogLevel(AliLog::kError);\n\n  \/\/____________________________________________\n  \/\/ Make the analysis manager\n  AliAnalysisManager *mgr = new AliAnalysisManager(\"TRD QA Reconstruction Manager\");\n  \/\/mgr->SetSpecialOutputLocation(source); \/\/ To Be Changed\n  AliVEventHandler *esdH = 0x0, *mcH = 0x0;\n  mgr->SetInputEventHandler(esdH = new AliESDInputHandler);\n  if(fHasMCdata) mgr->SetMCtruthEventHandler(mcH = new AliMCEventHandler());\n  \/\/mgr->SetDebugLevel(10);\n\n  \/\/____________________________________________\n  \/\/ TRD track summary generator\n  mgr->AddTask(task = new AliTRDtrackInfoGen());\n  taskPtr[(Int_t)kInfoGen] = task;\n  task->SetDebugLevel(1);\n  task->SetMCdata(fHasMCdata);\n  \/\/ Create containers for input\/output\n  AliAnalysisDataContainer *cinput1 = mgr->CreateContainer(\"data\", TChain::Class(), AliAnalysisManager::kInputContainer);\n  AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"trackInfo\", TObjArray::Class(), AliAnalysisManager::kExchangeContainer);\n  AliAnalysisDataContainer *coutput1a = mgr->CreateContainer(\"eventInfo\", AliTRDeventInfo::Class(), AliAnalysisManager::kExchangeContainer);\n  mgr->ConnectInput( task, 0, cinput1);\n  mgr->ConnectOutput(task, 0, coutput1);\n  mgr->ConnectOutput(task, 1, coutput1a);\n\n  \/\/____________________________________________\n  \/\/ TRD detector checker\n\tif(TESTBIT(fSteerTask, kCheckDetector)){\n    mgr->AddTask(task = new AliTRDcheckDetector());\n    taskPtr[(Int_t)kCheckDetector] = task;\n    task->SetDebugLevel(4);\n    task->SetMCdata(fHasMCdata);\n    \n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectInput( task, 1, coutput1a);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n  \/\/____________________________________________\n  \/\/ TRD barrel tracking efficiency\n  if(fHasMCdata && TESTBIT(fSteerTask, kTrackingEfficiency)){\n    mgr->AddTask(task = new AliTRDtrackingEfficiency());\n    taskPtr[(Int_t)kTrackingEfficiency] = task;\n    task->SetDebugLevel(0);\n\n    \/\/Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n  \/\/____________________________________________\n  \/\/ TRD combined tracking efficiency\n  if(fHasMCdata && TESTBIT(fSteerTask, kTrackingCombinedEfficiency)){\n    mgr->AddTask(task = new AliTRDtrackingEfficiencyCombined());\n    taskPtr[(Int_t)kTrackingCombinedEfficiency] = task;\n    task->SetDebugLevel(0);\n\n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n  \/\/____________________________________________\n  \/\/ TRD tracking resolution\n  if(TESTBIT(fSteerTask, kTrackingResolution)){\n    mgr->AddTask(task = new AliTRDtrackingResolution());\n    taskPtr[(Int_t)kTrackingResolution] = task;\n    task->SetMCdata(fHasMCdata);\n    task->SetPostProcess(kFALSE);\n    task->SetDebugLevel(1);\n    \n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n  \/\/____________________________________________\n  \/\/ TRD calibration\n  if(TESTBIT(fSteerTask, kCalibration)){\n    mgr->AddTask(task = new AliTRDcalibration());\n    taskPtr[(Int_t)kCalibration] = task;\n    ((AliTRDcalibration*)task)->SetLow(0);\n    ((AliTRDcalibration*)task)->SetHigh(30);\n    ((AliTRDcalibration*)task)->SetFillZero(kFALSE);\n    task->SetDebugLevel(0);\n\n    \/\/ Create containers for input\/output\n    mgr->ConnectInput(task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n  \n  \/\/____________________________________________\n  \/\/ TRD pid checker\n  if(TESTBIT(fSteerTask, kPIDChecker)){\n    mgr->AddTask(task = new AliTRDpidChecker());\n    taskPtr[(Int_t)kPIDChecker] = task;\n    task->SetDebugLevel(0);\n    task->SetMCdata(fHasMCdata);\n    \n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n\n  \/\/____________________________________________\n  \/\/ TRD pid reference \n  if(TESTBIT(fSteerTask, kPIDRefMaker)){\n    mgr->AddTask(task = new AliTRDpidRefMaker());\n    taskPtr[(Int_t)kPIDRefMaker] = task;\n    task->SetDebugLevel(0);\n    task->SetMCdata(fHasMCdata);\n    \n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n    mgr->ConnectOutput(task, 1, mgr->CreateContainer(Form(\"%sNN\", task->GetName()), TTree::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%sNN.root\", task->GetName())));\n    mgr->ConnectOutput(task, 2, mgr->CreateContainer(Form(\"%sLQ\", task->GetName()), TTree::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%sLQ.root\", task->GetName())));\n  }\n\n\n  if (!mgr->InitAnalysis()) return;\n  printf(\"\\n\\tRUNNING TRAIN FOR TASKS:\\n\");\n  for(Int_t itask = 1; itask < NTRDTASKS; itask++){\n    if(TESTBIT(fSteerTask, itask)) printf(\"\\t   %s [%s]\\n\", taskPtr[itask]->GetTitle(), taskPtr[itask]->GetName());\n  }\n  printf(\"\\n\\n\");\n  \/\/mgr->PrintStatus();\n\n\n  AliCDBManager *cdbManager = AliCDBManager::Instance();\n  cdbManager->SetDefaultStorage(\"local:\/\/$ALICE_ROOT\");\n  \/\/cdbManager->SetSpecificStorage(\"TRD\/Calib\/FEE\",\"local:\/\/\/u\/bailhach\/aliroot\/database30head\/database\");\n  cdbManager->SetRun(0);\n  cdbManager->SetCacheFlag(kFALSE);\n \n  \/\/ initialize TRD settings\n  AliMagFMaps *field = new AliMagFMaps(\"Maps\",\"Maps\", 2, 1., 10., AliMagFMaps::k5kG);\n  AliTracker::SetFieldMap(field, kTRUE);\n  AliTRDcalibDB *cal = AliTRDcalibDB::Instance();\n  AliTRDtrackerV1::SetNTimeBins(cal->GetNumberOfTimeBins());\n\n\n  mgr->StartAnalysis(\"local\",chain);\n\n  timer.Stop();\n  timer.Print();  \n\n  cal->Terminate();\n  delete field;\n  delete cdbManager;\n  for(Int_t it=NTRDTASKS-1; it>=0; it--) if(taskPtr[it]) delete taskPtr[it];\n  if(mcH) delete mcH;\n  delete esdH;\n  delete mgr;\n  delete chain;\n  if(MEM) delete mem;\n  if(MEM) TMemStatViewerGUI::ShowGUI();\n}\n\n\nTChain* CreateESDChain(const char* filename, Int_t nfiles)\n{\n  \/\/ Create the chain\n  TChain* chain = new TChain(\"esdTree\");\n\n  if(!filename){\n    chain->Add(Form(\"%s\/AliESDs.root\", gSystem->pwd()));\n    return chain;\n  }\n\n\n  \/\/ read ESD files from the input list.\n  ifstream in;\n  in.open(filename);\n  TString esdfile;\n  while(in.good() && (nfiles--) ) {\n    in >> esdfile;\n    if (!esdfile.Contains(\"root\")) continue; \/\/ protection\n    chain->Add(esdfile.Data());\n  }\n\n  in.close();\n\n  return chain;\n}\n<commit_msg>move macro TESTBIT to TSTBIT<commit_after>\/\/ Steer TRD QA train for Reconstruction (Clusterizer, Tracking and PID).\n\/\/ \n\/\/ Usage:\n\/\/   run.C(tasks, files, entries)\n\/\/   tasks : \"ALL\" or one\/more of the following:\n\/\/     \"EFF\"  : TRD Tracking Efficiency \n\/\/     \"EFFC\" : TRD Tracking Efficiency Combined (barrel + stand alone) - only in case of simulations\n\/\/     \"RES\"  : TRD tracking Resolution\n\/\/     \"CAL\"  : TRD calibration\n\/\/     \"PID\"  : TRD PID - pion efficiency \n\/\/     \"PIDR\" : TRD PID - reference data\n\/\/     \"DET\"  : Basic TRD Detector checks\n\/\/     \"NOFR\" : Data set does not have AliESDfriends.root \n\/\/     \"NOMC\" : Data set does not have Monte Carlo Informations (real data), so all tasks which rely\n\/\/              on MC information are switched off\n\/\/\n\/\/ In compiled mode : \n\/\/ Don't forget to load first the libraries\n\/\/ gSystem->Load(\"libMemStat.so\")\n\/\/ gSystem->Load(\"libMemStatGui.so\")\n\/\/ gSystem->Load(\"libANALYSIS.so\")\n\/\/ gSystem->Load(\"libTRDqaRec.so\")\n\/\/\n\/\/ Authors:\n\/\/   Alex Bercuci (A.Bercuci@gsi.de) \n\/\/   Markus Fasel (m.Fasel@gsi.de) \n\n#ifndef __CINT__\n#include <Riostream.h>\n\n#include \"TStopwatch.h\"\n#include \"TMemStat.h\"\n#include \"TMemStatViewerGUI.h\"\n\n#include \"TROOT.h\"\n#include \"TSystem.h\"\n#include \"TError.h\"\n#include \"TChain.h\"\n\n#include \"AliMagFMaps.h\"\n#include \"AliTracker.h\"\n#include \"AliLog.h\"\n#include \"AliCDBManager.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisDataContainer.h\"\n#include \"AliMCEventHandler.h\"\n#include \"AliESDInputHandler.h\"\n\n#include \"TRD\/AliTRDtrackerV1.h\"\n#include \"TRD\/AliTRDcalibDB.h\"\n#include \"TRD\/qaRec\/AliTRDtrackInfo\/AliTRDeventInfo.h\"\n#include \"TRD\/qaRec\/AliTRDtrackInfoGen.h\"\n#include \"TRD\/qaRec\/AliTRDtrackingEfficiency.h\"\n#include \"TRD\/qaRec\/AliTRDtrackingEfficiencyCombined.h\"\n#include \"TRD\/qaRec\/AliTRDtrackingResolution.h\"\n#include \"TRD\/qaRec\/AliTRDcalibration.h\"\n#include \"TRD\/qaRec\/AliTRDpidChecker.h\"\n#include \"TRD\/qaRec\/AliTRDpidRefMaker.h\"\n#include \"TRD\/qaRec\/AliTRDcheckDetector.h\"\n#endif\n\n#include \"run.h\"\n\nBool_t MEM = kFALSE;\n\nTChain* CreateESDChain(const char* filename = 0x0, Int_t nfiles=-1 );\nvoid run(Char_t *tasks=\"ALL\", const Char_t *files=0x0, Int_t nmax=-1)\n{\n  TMemStat *mem = 0x0;\n  if(MEM){ \n    gSystem->Load(\"libMemStat.so\");\n    gSystem->Load(\"libMemStatGui.so\");\n    mem = new TMemStat(\"new, gnubuildin\");\n    mem->AddStamp(\"Start\");\n  }\n\n  TStopwatch timer;\n  timer.Start();\n\n  if(gSystem->Load(\"libANALYSIS.so\")<0) return;\n  if(gSystem->Load(\"libTRDqaRec.so\")<0) return;\n  \n  Bool_t fHasMCdata = kTRUE;\n  Bool_t fHasFriends = kTRUE;\n  TObjArray *tasksArray = TString(tasks).Tokenize(\" \");\n\n  Int_t fSteerTask = 0; SETBIT(fSteerTask, kInfoGen);\n  for(Int_t isel = 0; isel < tasksArray->GetEntriesFast(); isel++){\n    TString s = (dynamic_cast<TObjString *>(tasksArray->UncheckedAt(isel)))->String();\n    if(s.CompareTo(\"ALL\") == 0){\n      for(Int_t itask = 1; itask < NTRDTASKS; itask++) SETBIT(fSteerTask, itask);\n      continue;\n    } else if(s.CompareTo(\"NOFR\") == 0){ \n      fHasFriends = kFALSE;\n    } else if(s.CompareTo(\"NOMC\") == 0){ \n      fHasMCdata = kFALSE;\n    } else { \n      Bool_t foundOpt = kFALSE;  \n      for(Int_t itask = 1; itask < NTRDTASKS; itask++){\n        if(s.CompareTo(fgkTRDtaskOpt[itask]) != 0) continue;\n        SETBIT(fSteerTask, itask);\n        foundOpt = kTRUE;\n        break;\n      }\n      if(!foundOpt) Info(\"run.C\", Form(\"Task %s not implemented (yet).\", s.Data()));\n    }\n  }\n  \/\/ define task list pointers;\n  AliTRDrecoTask *taskPtr[NTRDTASKS], *task = 0x0;\n  memset(taskPtr, 0, NTRDTASKS*sizeof(AliAnalysisTask*));\n\n  \/\/____________________________________________\/\/\n  \/\/gROOT->LoadMacro(Form(\"%s\/TRD\/qaRec\/CreateESDChain.C\", gSystem->ExpandPathName(\"$ALICE_ROOT\")));\n  TChain *chain = CreateESDChain(files, nmax);\n  \/\/chain->SetBranchStatus(\"*\", 0);\n  chain->SetBranchStatus(\"*FMD*\",0);\n  chain->SetBranchStatus(\"*Calo*\",0);\n  chain->SetBranchStatus(\"Tracks\", 1);\n  chain->SetBranchStatus(\"ESDfriend*\",1);\n  chain->Lookup();\n  chain->GetListOfFiles()->Print();\n  printf(\"\\n ----> CHAIN HAS %d ENTRIES <----\\n\\n\", (Int_t)chain->GetEntries());\n  \n  AliLog::SetGlobalLogLevel(AliLog::kError);\n\n  \/\/____________________________________________\n  \/\/ Make the analysis manager\n  AliAnalysisManager *mgr = new AliAnalysisManager(\"TRD QA Reconstruction Manager\");\n  \/\/mgr->SetSpecialOutputLocation(source); \/\/ To Be Changed\n  AliVEventHandler *esdH = 0x0, *mcH = 0x0;\n  mgr->SetInputEventHandler(esdH = new AliESDInputHandler);\n  if(fHasMCdata) mgr->SetMCtruthEventHandler(mcH = new AliMCEventHandler());\n  \/\/mgr->SetDebugLevel(10);\n\n  \/\/____________________________________________\n  \/\/ TRD track summary generator\n  mgr->AddTask(task = new AliTRDtrackInfoGen());\n  taskPtr[(Int_t)kInfoGen] = task;\n  task->SetDebugLevel(1);\n  task->SetMCdata(fHasMCdata);\n  \/\/ Create containers for input\/output\n  AliAnalysisDataContainer *cinput1 = mgr->CreateContainer(\"data\", TChain::Class(), AliAnalysisManager::kInputContainer);\n  AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"trackInfo\", TObjArray::Class(), AliAnalysisManager::kExchangeContainer);\n  AliAnalysisDataContainer *coutput1a = mgr->CreateContainer(\"eventInfo\", AliTRDeventInfo::Class(), AliAnalysisManager::kExchangeContainer);\n  mgr->ConnectInput( task, 0, cinput1);\n  mgr->ConnectOutput(task, 0, coutput1);\n  mgr->ConnectOutput(task, 1, coutput1a);\n\n  \/\/____________________________________________\n  \/\/ TRD detector checker\n\tif(TSTBIT(fSteerTask, kCheckDetector)){\n    mgr->AddTask(task = new AliTRDcheckDetector());\n    taskPtr[(Int_t)kCheckDetector] = task;\n    task->SetDebugLevel(4);\n    task->SetMCdata(fHasMCdata);\n    \n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectInput( task, 1, coutput1a);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n  \/\/____________________________________________\n  \/\/ TRD barrel tracking efficiency\n  if(fHasMCdata && TSTBIT(fSteerTask, kTrackingEfficiency)){\n    mgr->AddTask(task = new AliTRDtrackingEfficiency());\n    taskPtr[(Int_t)kTrackingEfficiency] = task;\n    task->SetDebugLevel(0);\n\n    \/\/Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n  \/\/____________________________________________\n  \/\/ TRD combined tracking efficiency\n  if(fHasMCdata && TSTBIT(fSteerTask, kTrackingCombinedEfficiency)){\n    mgr->AddTask(task = new AliTRDtrackingEfficiencyCombined());\n    taskPtr[(Int_t)kTrackingCombinedEfficiency] = task;\n    task->SetDebugLevel(0);\n\n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n  \/\/____________________________________________\n  \/\/ TRD tracking resolution\n  if(TSTBIT(fSteerTask, kTrackingResolution)){\n    mgr->AddTask(task = new AliTRDtrackingResolution());\n    taskPtr[(Int_t)kTrackingResolution] = task;\n    task->SetMCdata(fHasMCdata);\n    task->SetPostProcess(kFALSE);\n    task->SetDebugLevel(1);\n    \n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n  \/\/____________________________________________\n  \/\/ TRD calibration\n  if(TSTBIT(fSteerTask, kCalibration)){\n    mgr->AddTask(task = new AliTRDcalibration());\n    taskPtr[(Int_t)kCalibration] = task;\n    ((AliTRDcalibration*)task)->SetLow(0);\n    ((AliTRDcalibration*)task)->SetHigh(30);\n    ((AliTRDcalibration*)task)->SetFillZero(kFALSE);\n    task->SetDebugLevel(0);\n\n    \/\/ Create containers for input\/output\n    mgr->ConnectInput(task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n  \n  \/\/____________________________________________\n  \/\/ TRD pid checker\n  if(TSTBIT(fSteerTask, kPIDChecker)){\n    mgr->AddTask(task = new AliTRDpidChecker());\n    taskPtr[(Int_t)kPIDChecker] = task;\n    task->SetDebugLevel(0);\n    task->SetMCdata(fHasMCdata);\n    \n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n  }\n\n\n  \/\/____________________________________________\n  \/\/ TRD pid reference \n  if(TSTBIT(fSteerTask, kPIDRefMaker)){\n    mgr->AddTask(task = new AliTRDpidRefMaker());\n    taskPtr[(Int_t)kPIDRefMaker] = task;\n    task->SetDebugLevel(0);\n    task->SetMCdata(fHasMCdata);\n    \n    \/\/ Create containers for input\/output\n    mgr->ConnectInput( task, 0, coutput1);\n    mgr->ConnectOutput(task, 0, mgr->CreateContainer(task->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%s.root\", task->GetName())));\n    mgr->ConnectOutput(task, 1, mgr->CreateContainer(Form(\"%sNN\", task->GetName()), TTree::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%sNN.root\", task->GetName())));\n    mgr->ConnectOutput(task, 2, mgr->CreateContainer(Form(\"%sLQ\", task->GetName()), TTree::Class(), AliAnalysisManager::kOutputContainer, Form(\"TRD.Task%sLQ.root\", task->GetName())));\n  }\n\n\n  if (!mgr->InitAnalysis()) return;\n  printf(\"\\n\\tRUNNING TRAIN FOR TASKS:\\n\");\n  for(Int_t itask = 1; itask < NTRDTASKS; itask++){\n    if(TSTBIT(fSteerTask, itask)) printf(\"\\t   %s [%s]\\n\", taskPtr[itask]->GetTitle(), taskPtr[itask]->GetName());\n  }\n  printf(\"\\n\\n\");\n  \/\/mgr->PrintStatus();\n\n\n  AliCDBManager *cdbManager = AliCDBManager::Instance();\n  cdbManager->SetDefaultStorage(\"local:\/\/$ALICE_ROOT\");\n  \/\/cdbManager->SetSpecificStorage(\"TRD\/Calib\/FEE\",\"local:\/\/\/u\/bailhach\/aliroot\/database30head\/database\");\n  cdbManager->SetRun(0);\n  cdbManager->SetCacheFlag(kFALSE);\n \n  \/\/ initialize TRD settings\n  AliMagFMaps *field = new AliMagFMaps(\"Maps\",\"Maps\", 2, 1., 10., AliMagFMaps::k5kG);\n  AliTracker::SetFieldMap(field, kTRUE);\n  AliTRDcalibDB *cal = AliTRDcalibDB::Instance();\n  AliTRDtrackerV1::SetNTimeBins(cal->GetNumberOfTimeBins());\n\n\n  mgr->StartAnalysis(\"local\",chain);\n\n  timer.Stop();\n  timer.Print();  \n\n  cal->Terminate();\n  delete field;\n  delete cdbManager;\n  for(Int_t it=NTRDTASKS-1; it>=0; it--) if(taskPtr[it]) delete taskPtr[it];\n  if(mcH) delete mcH;\n  delete esdH;\n  delete mgr;\n  delete chain;\n  if(MEM) delete mem;\n  if(MEM) TMemStatViewerGUI::ShowGUI();\n}\n\n\nTChain* CreateESDChain(const char* filename, Int_t nfiles)\n{\n  \/\/ Create the chain\n  TChain* chain = new TChain(\"esdTree\");\n\n  if(!filename){\n    chain->Add(Form(\"%s\/AliESDs.root\", gSystem->pwd()));\n    return chain;\n  }\n\n\n  \/\/ read ESD files from the input list.\n  ifstream in;\n  in.open(filename);\n  TString esdfile;\n  while(in.good() && (nfiles--) ) {\n    in >> esdfile;\n    if (!esdfile.Contains(\"root\")) continue; \/\/ protection\n    chain->Add(esdfile.Data());\n  }\n\n  in.close();\n\n  return chain;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <SDL.h>\n#include <stdexcept>\n#include <string>\n#include <iostream>\n#include \"window.h\"\n\n\/*\n*  Lesson 7: Taking advantage of classes\n*\/\nint main(int argc, char** argv){\n    \/\/Start our window\n    try {\n        Window::Init(\"Lesson 7\");\n    }\n    catch (const std::runtime_error &e){\n        std::cout << e.what() << std::endl;\n    }\n\n    \/\/Load up an image\n    SDL_Texture *img;\n    try {\n        std::string file = \"..\/res\/Lesson7\/image.png\";\n        img = Window::LoadImage(file);\n    }\n    catch (const std::runtime_error &e){\n        \/\/Catch error and crash\n        std::cout << e.what() << std::endl;\n        Window::Quit();\n        return -1;\n    }\n    \/\/Set a position to draw it with\n    SDL_Rect pos = { Window::Box().w \/ 2 - 100 \/ 2,\n                     Window::Box().h \/ 2 - 100 \/ 2,\n                     100, 100 };\n    \/\/The angle to draw at, so we can play with it\n    int angle = 0;\n\n    \/\/Our event structure\n\tSDL_Event e;\n\t\/\/For tracking if we want to quit\n\tbool quit = false;\n\twhile (!quit){\n\t\t\/\/Event Polling\n\t\twhile (SDL_PollEvent(&e)){\n\t\t\t\/\/If user closes he window\n\t\t\tif (e.type == SDL_QUIT)\n\t\t\t\tquit = true;\n\t\t\t\/\/If user presses any key\n\t\t\tif (e.type == SDL_KEYDOWN){\n\t\t\t\tswitch (e.key.keysym.sym){\n                    \/\/For rotating image\n                    case SDLK_d:\n                        angle += 2;\n                        break;\n                    case SDLK_a:\n                        angle -= 2;\n                        break;\n\t\t\t\t\t\/\/For quitting, escape key\n\t\t\t\t\tcase SDLK_ESCAPE:\n\t\t\t\t\t\tquit = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n        \/\/RENDERING\n        Window::Clear();\n        \/\/Draw our image with a 45 degree rotation\n        Window::Draw(img, pos, NULL, angle);\n\n        Window::Present();\n\t}\n\t\n\treturn 0;\n}<commit_msg>forgot to call Window::Quit() in L7<commit_after>#include <SDL.h>\n#include <stdexcept>\n#include <string>\n#include <iostream>\n#include \"window.h\"\n\n\/*\n*  Lesson 7: Taking advantage of classes\n*\/\nint main(int argc, char** argv){\n    \/\/Start our window\n    try {\n        Window::Init(\"Lesson 7\");\n    }\n    catch (const std::runtime_error &e){\n        std::cout << e.what() << std::endl;\n    }\n\n    \/\/Load up an image\n    SDL_Texture *img;\n    try {\n        std::string file = \"..\/res\/Lesson7\/image.png\";\n        img = Window::LoadImage(file);\n    }\n    catch (const std::runtime_error &e){\n        \/\/Catch error and crash\n        std::cout << e.what() << std::endl;\n        Window::Quit();\n        return -1;\n    }\n    \/\/Set a position to draw it with\n    SDL_Rect pos = { Window::Box().w \/ 2 - 100 \/ 2,\n                     Window::Box().h \/ 2 - 100 \/ 2,\n                     100, 100 };\n    \/\/The angle to draw at, so we can play with it\n    int angle = 0;\n\n    \/\/Our event structure\n\tSDL_Event e;\n\t\/\/For tracking if we want to quit\n\tbool quit = false;\n\twhile (!quit){\n\t\t\/\/Event Polling\n\t\twhile (SDL_PollEvent(&e)){\n\t\t\t\/\/If user closes he window\n\t\t\tif (e.type == SDL_QUIT)\n\t\t\t\tquit = true;\n\t\t\t\/\/If user presses any key\n\t\t\tif (e.type == SDL_KEYDOWN){\n\t\t\t\tswitch (e.key.keysym.sym){\n                    \/\/For rotating image\n                    case SDLK_d:\n                        angle += 2;\n                        break;\n                    case SDLK_a:\n                        angle -= 2;\n                        break;\n\t\t\t\t\t\/\/For quitting, escape key\n\t\t\t\t\tcase SDLK_ESCAPE:\n\t\t\t\t\t\tquit = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n        \/\/RENDERING\n        Window::Clear();\n        \/\/Draw our image with a 45 degree rotation\n        Window::Draw(img, pos, NULL, angle);\n\n        Window::Present();\n\t}\n\tWindow::Quit();\n\n\treturn 0;\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: baciTestServer.cpp,v 1.115 2006\/06\/21 10:34:11 bjeram Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* msekoran 2002-02-07 Fixed destruction.\n* gchiozzi 2002-02-06 Fixed bug in call to DBConnector::initDB()\n* gchiozzi 2001-12-19 Added initialisation of standard LoggingProxy fields\n*\/\n \nstatic char *rcsId=\"@(#) $Id: baciTestServer.cpp,v 1.115 2006\/06\/21 10:34:11 bjeram Exp $\";\nstatic void *use_rcsId = ((void)&use_rcsId,(void *) &rcsId);\n\n#include <vltPort.h>\n#include <acsutil.h> \n#include <acsutilPorts.h>\n\n#include <baci.h>\n#include <baciDB.h>\n\n#include \"baciTestClassImpl.h\"\n#include \"baciTest.h\"\n#include \"baciTestUtils.h\"\n#include \"baciTestContainerServices.h\"\n\n#ifdef MAKE_VXWORKS\n#\tinclude <acsutilArgUnpack.h>\n#endif\n\n\/\/--------------------------------------\n\/\/ do not use ACS ! \n\/\/ ACS:: prefix is obligatory for VxWorks \n\/\/ (for all CORBA objects, object declared in an IDL, e.g. ACS::Callback, maci::Manager)\n\/\/ NAMESPACE_USE(ACS);\nNAMESPACE_USE(baci);\n\n\/**\n * Hardcoded !\n *\/ \nstatic int   devCount = 2;\nstatic char *devices[] = {\"BACI1\",\"BACI2\"};\nstatic bool shutting_down = false;\nstatic bool signaled = false;\nstatic TestContainerServices *cs_p[]={0, 0};\nstatic LoggingProxy *g_logger = 0;\n\n\/\/\/ The mutual exclusion mechanism which is required to use the\n\/\/\/ <condition_>.\nstatic ACE_SYNCH_MUTEX mutex;\n\n\/**\n * Condition used to wait until finalize method has finished\n *\/\nstatic ACE_SYNCH_CONDITION condition(mutex);\n\n\n\nvoid finalize()\n{\n    \n\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Destroying CharacteristicComponents.\"));\n\t\n\tfor (int n=0; n < devCount; n++)\n\t  {\n\n\t  try\n\t    {\n\t\t\n\t      ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Destroying \\\"%s\\\"\", devices[n]));\n\n\t      PortableServer::ObjectId_var id =\n\t\tPortableServer::string_to_ObjectId(devices[n]);\n\t    \n\t      BACI_CORBA::getPOA()->deactivate_object(id.in());\n\n\t    }\n\t  catch(...)\n\t    {\n\t      ACS_SHORT_LOG((LM_INFO, \n\t\t     \"baciTestServer: Exceptions raised while destroying Component\"));\n\t      \/\/ do not bail out just because of one Component destruction failure \n\t      \/\/ ACE_CHECK_RETURN (-1);\n\t    }\n\n\t    \n\t  }\n\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Closing CORBA.\"));\n\n    try\n\t{\n\t  BACI_CORBA::getORB()->shutdown(false);\n\t\n\t}\n    catch(CORBA::Exception &ex)\n\t{\n\tACE_PRINT_EXCEPTION(ACE_ANY_EXCEPTION, \"finalize\");\n\t}\n\n    if (CDBPropertySet::getInstance() != 0)\n\t{\n\tCDBPropertySet * propSet_p = CDBPropertySet::getInstance();\n\tdelete propSet_p;\n\t}\n\n    ACSError::done();\n    DBConnector::closeDB();\n    BACI_CORBA::DoneCORBA();\n\n\n}\n\n\nvoid finalizeOtherThread()\n{\n    if (shutting_down) return;\n    shutting_down=true;\n    \n    \/\/ initialize logger (this is a new thread)\n    if (g_logger)\n      {\n\tLoggingProxy::init(g_logger);\n\tLoggingProxy::ThreadName(\"finalization\");\n\tACS_SHORT_LOG((LM_INFO, \"Logging proxy successfully created !\"));\n      }\n\n    finalize();\n\n    sleep(2);\n    LoggingProxy::done(); \n    std::cout << std::flush; \n\n    signaled = true;\n    condition.signal();\n}\n\n\nvoid TerminationSignalHandler(int)\n{\n    finalizeOtherThread();\n}\n\n\nint main(int argc, char* argv[])\n{ \n    CORBAShutdown::setShutdownFunction(&finalizeOtherThread);\n    bool monitoring=true;\n\n       \n    \/\/ create logging proxy\n    g_logger = new LoggingProxy(0, 0, 31, 0);\n    LoggingProxy::init(g_logger);\n    LoggingProxy::ProcessName(argv[0]);\n    LoggingProxy::ThreadName(\"main\");\n    ACS_SHORT_LOG((LM_INFO, \"Logging proxy successfully created !\"));\n\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Starting\"));\n\n    if ( argc>=2 )\n\t{\n\tmonitoring = atoi(argv[1]);\n\tACS_SHORT_LOG((LM_INFO,\"baciTestServer: monitoring flag: %d passed from cmd line\", monitoring));\n\t}\n\n      \/\/ Installs termination signal handlers, to be able\n    \/\/ to terminate cleanly\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Installing signal handlers\"));\n    ACE_OS::signal(SIGINT,  TerminationSignalHandler);  \/\/ Ctrl+C\n    ACE_OS::signal(SIGTERM, TerminationSignalHandler);  \/\/ termination request\n\n     ACS_SHORT_LOG((LM_INFO,\"baciTestServer: CharacteristicComponent IDs ready\"));\n    if (devCount<1) {\n       ACS_SHORT_LOG((LM_INFO,\"No devices found for %s\", argv[0]));\n      return -1;\n    }\n    \n    CORBA::String_var ior[devCount];\n    CORBA::String_var name[devCount];\n    CORBA::String_var type[devCount];\n\n    int count = 0;\n        \n    try {\n\n     BACI_CORBA::InitCORBA(argc, argv);\n\n    if (!ACSError::init (BACI_CORBA::getORB()))\n      {\n\tACS_LOG(LM_RUNTIME_CONTEXT, \"baciTestServer\",\n\t\t(LM_INFO, \"Failed to initialize ACSError.\"));\n\treturn -1;\n      }\n\n    \/\/ read parameters\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Init DB\"));\n    if (!DBConnector::initDB(\":Appl_data:alma\", argc, argv, BACI_CORBA::getORB()))\n      {\n\tACS_SHORT_LOG((LM_INFO,\"Error creating DB...\"));\n\treturn -1;\n      }\n\n     \/\/ Instantiate the CBDPropertySet singleton\n     if (DBConnector::getDBTable())\n\t CDBPropertySet::createInstance(BACI_CORBA::getORB(), \n\t\t\t\t\tBACI_CORBA::getPOAManager(),\n\t\t\t\t\tBACI_CORBA::getPOARoot());\n\n     for (int n=0; n < devCount; n++) {\n \n        ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Exporting \\\"%s\\\"\", devices[n]));\n        \n\tACE_CString compName = devices[n];\n\n\tcs_p[n] = new TestContainerServices(compName,\n\t\t\t\t\t BACI_CORBA::getPOA(), BACI_CORBA::getORB());\n\n        BaciTestClassImpl* ps = new BaciTestClassImpl(devices[n], \n\t\t\t\t\t\t      cs_p[n],\n\t\t\t\t\t\t      monitoring);\n\n\tCORBA::Object_var ps_obj = BACI_CORBA::ActivateCORBAObject(ps, devices[n]);\n\tif (CORBA::is_nil(ps_obj.in()))\n\t  {\n\t    ACS_SHORT_LOG((LM_ERROR,\"baciTestServer: Failed to activate \\\"%s\\\"\", devices[n]));\n\t    delete ps;\n\t    delete cs_p[n];\n\t    finalize();\n\t    throw CORBA::NO_RESOURCES();\n\t  }\n\t\n\t\/\/ remove reference to servant, so that only POA nows owns it\n\t\/\/ when POA will release servent's reference, ref. \n        \/\/ count will drop to 0 and servant will be deleted\n\tps->_remove_ref();\n\t\n        ior[count] = BACI_CORBA::getORB()->object_to_string (ps_obj.in());\n        \n \n        name[count] = CORBA::string_dup(devices[n]);\n        type[count] = CORBA::string_dup(\"BaciTestClass\");\n        count++;\n \n        ACS_SHORT_LOG((LM_INFO, \"baciTestServer: %s exported\", devices[n]));\n        \n      }\n    }\n    catch (...) {\n      ACS_SHORT_LOG((LM_INFO, \"baciTestServer: Exceptions raised while creating Component\"));\n      return -1;\n      \/\/ACE_CHECK_RETURN (-1);\n    }\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Writing IORS to file...\"));\n \n    write_iors_to_file(count, name, type, ior);\n \n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Running ORB.\"));\n    BACI_CORBA::getORB()->run();\n\n    \/\/ check if already shut down using signals\n    if (shutting_down)\n      {\n        \/\/ \"strange\" thing, if server is killed using \n        \/\/ 'killall SIGTERM baciTestServer' it causes call of signal handles,\n        \/\/ but if CTRL-C is pressed all threads receive signal \n        \/\/ (including CORBA ORB main thread) and run() method terminates\n        \/\/ this makes the main program to terminate before initialization() is done\n        if (!signaled) condition.wait();\n      }\n    else\n\tfinalize();\n \n    LoggingProxy::done(); \n    std::cout << std::flush; \n\n    return 0;\n}\n\n#ifdef MAKE_VXWORKS\n\nint startBaciTestServer(char *szCmdLn)\n{\n  int  argc;\n  char *argv[100];\n\n  ACE_OS_Object_Manager ace_os_object_manager;\n  ACE_Object_Manager ace_object_manager;\n\n  \/\/ACE_MAIN_OBJECT_MANAGER\n  argc = argUnpack(szCmdLn, argv);\n  argv[0] = \"baciTestServer\";\n\n  int retval = ace_main_i(argc, argv);\n\n  return retval;\n}\n\n#endif\n\n\n\n\n\n\n<commit_msg>made some modification for VxWorks<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: baciTestServer.cpp,v 1.116 2006\/06\/26 15:55:13 bjeram Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* msekoran 2002-02-07 Fixed destruction.\n* gchiozzi 2002-02-06 Fixed bug in call to DBConnector::initDB()\n* gchiozzi 2001-12-19 Added initialisation of standard LoggingProxy fields\n*\/\n \nstatic char *rcsId=\"@(#) $Id: baciTestServer.cpp,v 1.116 2006\/06\/26 15:55:13 bjeram Exp $\";\nstatic void *use_rcsId = ((void)&use_rcsId,(void *) &rcsId);\n\n#include <vltPort.h>\n#include <acsutil.h> \n#include <acsutilPorts.h>\n\n#include <baci.h>\n#include <baciDB.h>\n\n#include \"baciTestClassImpl.h\"\n#include \"baciTest.h\"\n#include \"baciTestUtils.h\"\n#include \"baciTestContainerServices.h\"\n\n#ifdef MAKE_VXWORKS\n#\tinclude <acsutilArgUnpack.h>\n#endif\n\n\/\/--------------------------------------\n\/\/ do not use ACS ! \n\/\/ ACS:: prefix is obligatory for VxWorks \n\/\/ (for all CORBA objects, object declared in an IDL, e.g. ACS::Callback, maci::Manager)\n\/\/ NAMESPACE_USE(ACS);\nNAMESPACE_USE(baci);\n\n\/**\n * Hardcoded !\n *\/ \nstatic int   devCount = 2;\nstatic char *devices[] = {\"BACI1\",\"BACI2\"};\nstatic bool shutting_down = false;\nstatic bool signaled = false;\nstatic TestContainerServices *cs_p[]={0, 0};\nstatic LoggingProxy *g_logger = 0;\n\n\/\/\/ The mutual exclusion mechanism which is required to use the\n\/\/\/ <condition_>.\nstatic ACE_SYNCH_MUTEX mutex;\n\n\/**\n * Condition used to wait until finalize method has finished\n *\/\nstatic ACE_SYNCH_CONDITION condition(mutex);\n\n\n\nvoid finalize()\n{\n    \n\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Destroying CharacteristicComponents.\"));\n\t\n\tfor (int n=0; n < devCount; n++)\n\t  {\n\n\t  try\n\t    {\n\t\t\n\t      ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Destroying \\\"%s\\\"\", devices[n]));\n\n\t      PortableServer::ObjectId_var id =\n\t\tPortableServer::string_to_ObjectId(devices[n]);\n\t    \n\t      BACI_CORBA::getPOA()->deactivate_object(id.in());\n\n\t    }\n\t  catch(...)\n\t    {\n\t      ACS_SHORT_LOG((LM_INFO, \n\t\t     \"baciTestServer: Exceptions raised while destroying Component\"));\n\t      \/\/ do not bail out just because of one Component destruction failure \n\t      \/\/ ACE_CHECK_RETURN (-1);\n\t    }\n\n\t    \n\t  }\n\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Closing CORBA.\"));\n\n    try\n\t{\n\t  BACI_CORBA::getORB()->shutdown(false);\n\t\n\t}\n    catch(CORBA::Exception &ex)\n\t{\n\tACE_PRINT_EXCEPTION(ACE_ANY_EXCEPTION, \"finalize\");\n\t}\n\n    if (CDBPropertySet::getInstance() != 0)\n\t{\n\tCDBPropertySet * propSet_p = CDBPropertySet::getInstance();\n\tdelete propSet_p;\n\t}\n\n    ACSError::done();\n    DBConnector::closeDB();\n    BACI_CORBA::DoneCORBA();\n\n\n}\n\n\nvoid finalizeOtherThread()\n{\n    if (shutting_down) return;\n    shutting_down=true;\n    \n    \/\/ initialize logger (this is a new thread)\n    if (g_logger)\n      {\n\tLoggingProxy::init(g_logger);\n\tLoggingProxy::ThreadName(\"finalization\");\n\tACS_SHORT_LOG((LM_INFO, \"Logging proxy successfully created !\"));\n      }\n\n    finalize();\n\n    sleep(2);\n    LoggingProxy::done(); \n    std::cout << std::flush; \n\n    signaled = true;\n    condition.signal();\n}\n\n\nvoid TerminationSignalHandler(int)\n{\n    finalizeOtherThread();\n}\n\n\n#ifdef MAKE_VXWORKS\n\nint startBaciTestServer(char *szCmdLn)\n{\n  int  argc;\n  char *argv[100];\n\n  ACE_OS_Object_Manager ace_os_object_manager;\n  ACE_Object_Manager ace_object_manager;\n\n  argc = argUnpack(szCmdLn, argv);\n  argv[0] = \"baciTestServer\";\n\n#else\nint main(int argc, char* argv[])\n{ \n#endif\n\n\n    CORBAShutdown::setShutdownFunction(&finalizeOtherThread);\n    bool monitoring=true;\n\n       \n    \/\/ create logging proxy\n    g_logger = new LoggingProxy(0, 0, 31, 0);\n    LoggingProxy::init(g_logger);\n    LoggingProxy::ProcessName(argv[0]);\n    LoggingProxy::ThreadName(\"main\");\n    ACS_SHORT_LOG((LM_INFO, \"Logging proxy successfully created !\"));\n\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Starting\"));\n\n    if ( argc>=2 )\n\t{\n\tmonitoring = atoi(argv[1]);\n\tACS_SHORT_LOG((LM_INFO,\"baciTestServer: monitoring flag: %d passed from cmd line\", monitoring));\n\t}\n\n      \/\/ Installs termination signal handlers, to be able\n    \/\/ to terminate cleanly\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Installing signal handlers\"));\n    ACE_OS::signal(SIGINT,  TerminationSignalHandler);  \/\/ Ctrl+C\n    ACE_OS::signal(SIGTERM, TerminationSignalHandler);  \/\/ termination request\n\n     ACS_SHORT_LOG((LM_INFO,\"baciTestServer: CharacteristicComponent IDs ready\"));\n    if (devCount<1) {\n       ACS_SHORT_LOG((LM_INFO,\"No devices found for %s\", argv[0]));\n      return -1;\n    }\n    \n    CORBA::String_var ior[devCount];\n    CORBA::String_var name[devCount];\n    CORBA::String_var type[devCount];\n\n    int count = 0;\n        \n    try {\n\n     BACI_CORBA::InitCORBA(argc, argv);\n\n    if (!ACSError::init (BACI_CORBA::getORB()))\n      {\n\tACS_LOG(LM_RUNTIME_CONTEXT, \"baciTestServer\",\n\t\t(LM_INFO, \"Failed to initialize ACSError.\"));\n\treturn -1;\n      }\n\n    \/\/ read parameters\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Init DB\"));\n    if (!DBConnector::initDB(\":Appl_data:alma\", argc, argv, BACI_CORBA::getORB()))\n      {\n\tACS_SHORT_LOG((LM_INFO,\"Error creating DB...\"));\n\treturn -1;\n      }\n\n     \/\/ Instantiate the CBDPropertySet singleton\n     if (DBConnector::getDBTable())\n\t CDBPropertySet::createInstance(BACI_CORBA::getORB(), \n\t\t\t\t\tBACI_CORBA::getPOAManager(),\n\t\t\t\t\tBACI_CORBA::getPOARoot());\n\n     for (int n=0; n < devCount; n++) {\n \n        ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Exporting \\\"%s\\\"\", devices[n]));\n        \n\tACE_CString compName = devices[n];\n\n\tcs_p[n] = new TestContainerServices(compName,\n\t\t\t\t\t BACI_CORBA::getPOA(), BACI_CORBA::getORB());\n\n        BaciTestClassImpl* ps = new BaciTestClassImpl(devices[n], \n\t\t\t\t\t\t      cs_p[n],\n\t\t\t\t\t\t      monitoring);\n\n\tCORBA::Object_var ps_obj = BACI_CORBA::ActivateCORBAObject(ps, devices[n]);\n\tif (CORBA::is_nil(ps_obj.in()))\n\t  {\n\t    ACS_SHORT_LOG((LM_ERROR,\"baciTestServer: Failed to activate \\\"%s\\\"\", devices[n]));\n\t    delete ps;\n\t    delete cs_p[n];\n\t    finalize();\n\t    throw CORBA::NO_RESOURCES();\n\t  }\n\t\n\t\/\/ remove reference to servant, so that only POA nows owns it\n\t\/\/ when POA will release servent's reference, ref. \n        \/\/ count will drop to 0 and servant will be deleted\n\tps->_remove_ref();\n\t\n        ior[count] = BACI_CORBA::getORB()->object_to_string (ps_obj.in());\n        \n \n        name[count] = CORBA::string_dup(devices[n]);\n        type[count] = CORBA::string_dup(\"BaciTestClass\");\n        count++;\n \n        ACS_SHORT_LOG((LM_INFO, \"baciTestServer: %s exported\", devices[n]));\n        \n      }\n    }\n    catch (...) {\n      ACS_SHORT_LOG((LM_INFO, \"baciTestServer: Exceptions raised while creating Component\"));\n      return -1;\n      \/\/ACE_CHECK_RETURN (-1);\n    }\n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Writing IORS to file...\"));\n \n    write_iors_to_file(count, name, type, ior);\n \n    ACS_SHORT_LOG((LM_INFO,\"baciTestServer: Running ORB.\"));\n    BACI_CORBA::getORB()->run();\n\n    \/\/ check if already shut down using signals\n    if (shutting_down)\n      {\n        \/\/ \"strange\" thing, if server is killed using \n        \/\/ 'killall SIGTERM baciTestServer' it causes call of signal handles,\n        \/\/ but if CTRL-C is pressed all threads receive signal \n        \/\/ (including CORBA ORB main thread) and run() method terminates\n        \/\/ this makes the main program to terminate before initialization() is done\n        if (!signaled) condition.wait();\n      }\n    else\n\tfinalize();\n \n    LoggingProxy::done(); \n    std::cout << std::flush; \n\n    return 0;\n}\n\n\n\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include \"LinearRegression.h\"\n#include \"Utils.h\"\n\nusing namespace std;\n\nLinearRegression::LinearRegression(double x[], double y[], int m) \n{\n    this->x = x;\n    this->y = y;\n    this->m = m;\n}\n\nvoid LinearRegression::train(double alpha, int iterations) \n{\n    double *J = new double[iterations];\n    this->theta = gradient_descent(x, y, alpha, iterations, J, m);\n\n}\n\ndouble LinearRegression::predict(double x) \n{\n    return h(x, theta);\n}\n\ndouble LinearRegression::compute_cost(double x[], double y[], double theta[], int m) \n{\n    double *predictions = calculate_predictions(x, theta, m);\n    double *diff = Utils::array_diff(predictions, y, m);\n    double *sq_errors = Utils::array_pow(diff, m, 2);\n    return (1.0 \/ (2 * m)) * Utils::array_sum(sq_errors, m);\n}\n\ndouble LinearRegression::h(double x, double theta[]) \n{\n    return theta[0] + theta[1] * x;\n}\n\ndouble *LinearRegression::calculate_predictions(double x[], double theta[], int m) \n{\n    double *predictions = new double[m];\n\n    \/\/ calculate h for each training example\n    for (int i = 0; i < m; ++i) {\n        predictions[i] = h(x[i], theta);\n    }\n\n    return predictions;\n}\n\ndouble *LinearRegression::gradient_descent(double x[], double y[], double alpha, int iters, double *J, int m) \n{\n    double *theta = new double[2];\n    theta[0] = 1;\n    theta[1] = 1;\n\n    for (int i = 0; i < iters; ++i)\n    {\n        double *predictions = calculate_predictions(x, theta, m);\n        double *diff = Utils::array_diff(predictions, y, m);\n\n        double *errors_x1 = diff;\n        double *errors_x2 = Utils::array_multiplication(diff, x, m);\n\n        theta[0] = theta[0] - alpha * (1.0 \/ m) * Utils::array_sum(errors_x1, m);\n        theta[1] = theta[1] - alpha * (1.0 \/ m) * Utils::array_sum(errors_x2, m);\n\n        J[i] = compute_cost(x, y, theta, m);\n    }\n\n    return theta;\n}\n<commit_msg>Memory Leaks Fixed for  Multiple Iterations<commit_after>#include <iostream>\n#include \"LinearRegression.h\"\n#include \"Utils.h\"\n\nusing namespace std;\n\nLinearRegression::LinearRegression(double x[], double y[], int m) \n{\n    this->x = x;\n    this->y = y;\n    this->m = m;\n}\n\nvoid LinearRegression::train(double alpha, int iterations) \n{\n    double *J = new double[iterations];\n    this->theta = gradient_descent(x, y, alpha, iterations, J, m);\n    delete J;\n}\n\ndouble LinearRegression::predict(double x) \n{\n    return h(x, theta);\n}\n\ndouble LinearRegression::compute_cost(double x[], double y[], double theta[], int m) \n{\n    double *predictions = calculate_predictions(x, theta, m);\n    double *diff = Utils::array_diff(predictions, y, m);\n    double *sq_errors = Utils::array_pow(diff, m, 2);\n    delete predictions,diff;\n    return (1.0 \/ (2 * m)) * Utils::array_sum(sq_errors, m);\n}\n\ndouble LinearRegression::h(double x, double theta[]) \n{\n    return theta[0] + theta[1] * x;\n}\n\ndouble *LinearRegression::calculate_predictions(double x[], double theta[], int m) \n{\n    double *predictions = new double[m];\n\n    \/\/ calculate h for each training example\n    for (int i = 0; i < m; ++i) {\n        predictions[i] = h(x[i], theta);\n    }\n\n    return predictions;\n}\n\ndouble *LinearRegression::gradient_descent(double x[], double y[], double alpha, int iters, double *J, int m) \n{\n    double *theta = new double[2];\n    theta[0] = 1;\n    theta[1] = 1;\n\n    for (int i = 0; i < iters; ++i)\n    {\n        double *predictions = calculate_predictions(x, theta, m);\n        double *diff = Utils::array_diff(predictions, y, m);\n\n        double *errors_x1 = diff;\n        double *errors_x2 = Utils::array_multiplication(diff, x, m);\n\n        theta[0] = theta[0] - alpha * (1.0 \/ m) * Utils::array_sum(errors_x1, m);\n        theta[1] = theta[1] - alpha * (1.0 \/ m) * Utils::array_sum(errors_x2, m);\n\n        J[i] = compute_cost(x, y, theta, m);\n    }\n\n    return theta;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2001,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 * limitations under the License.\n *\/\n\n\/*\n * $Id$\n * $Log$\n * Revision 1.12  2004\/09\/08 13:56:52  peiyongz\n * Apache License Version 2.0\n *\n * Revision 1.11  2003\/12\/23 21:50:36  peiyongz\n * Absorb exception thrown in getCanonicalRepresentation and return 0,\n * only validate when required\n *\n * Revision 1.10  2003\/12\/17 00:18:38  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.9  2003\/12\/11 21:40:24  peiyongz\n * support for Canonical Representation for Datatype\n *\n * Revision 1.8  2003\/11\/28 18:53:07  peiyongz\n * Support for getCanonicalRepresentation\n *\n * Revision 1.7  2003\/11\/12 20:32:03  peiyongz\n * Statless Grammar: ValidationContext\n *\n * Revision 1.6  2003\/10\/02 19:21:06  peiyongz\n * Implementation of Serialization\/Deserialization\n *\n * Revision 1.5  2003\/05\/15 18:53:26  knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.4  2003\/02\/02 23:55:40  peiyongz\n * getFormattedString() added to return original and converted value.\n *\n * Revision 1.3  2003\/01\/30 21:56:22  tng\n * Performance: call getRawData instead of toString\n *\n * Revision 1.2  2002\/11\/04 14:53:27  tng\n * C++ Namespace Support.\n *\n * Revision 1.1.1.1  2002\/02\/01 22:22:39  peiyongz\n * sane_include\n *\n * Revision 1.2  2001\/10\/09 21:16:31  peiyongz\n * . macro to simplify code\n *\n * Revision 1.1  2001\/10\/01 16:13:56  peiyongz\n * DTV Reorganization:new classes: AbstractNumericFactValidator\/ AbstractNumericValidator\n *\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/validators\/datatype\/AbstractNumericValidator.hpp>\n#include <xercesc\/validators\/datatype\/InvalidDatatypeValueException.hpp>\n#include <xercesc\/util\/XMLAbstractDoubleFloat.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n#define  REPORT_VALUE_ERROR(val1, val2, except_code, manager)    \\\n  ThrowXMLwithMemMgr2(InvalidDatatypeValueException               \\\n          , except_code                                 \\\n          , val1->getFormattedString()                  \\\n          , val2->getFormattedString()                  \\\n          , manager);\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nAbstractNumericValidator::~AbstractNumericValidator()\n{}\n\nAbstractNumericValidator::AbstractNumericValidator(\n                          DatatypeValidator*            const baseValidator\n                        , RefHashTableOf<KVStringPair>* const facets\n                        , const int                           finalSet\n                        , const ValidatorType                 type\n                        , MemoryManager* const                manager)\n:AbstractNumericFacetValidator(baseValidator, facets, finalSet, type, manager)\n{\n    \/\/do not invoke init() here !!!\n}\n\nvoid AbstractNumericValidator::validate(const XMLCh*             const content\n                                       ,      ValidationContext* const context\n                                       ,      MemoryManager*     const manager)\n{\n    checkContent(content, context, false, manager);\n}\n\nvoid AbstractNumericValidator::boundsCheck(const XMLNumber*         const theData\n                                          ,      MemoryManager*     const manager)\n{\n    int thisFacetsDefined = getFacetsDefined();\n    int result;\n\n    try\n    {\n\n        \/\/ must be < MaxExclusive\n        if ( (thisFacetsDefined & DatatypeValidator::FACET_MAXEXCLUSIVE) != 0 )\n        {\n            result = compareValues(theData, getMaxExclusive());\n            if ( result != -1)\n            {\n                REPORT_VALUE_ERROR(theData\n                                 , getMaxExclusive()\n                                 , XMLExcepts::VALUE_exceed_maxExcl\n                                 , manager)\n            }\n        } \t\n\n        \/\/ must be <= MaxInclusive\n        if ( (thisFacetsDefined & DatatypeValidator::FACET_MAXINCLUSIVE) != 0 )\n        {\n            result = compareValues(theData, getMaxInclusive());\n            if (result == 1)\n            {\n                REPORT_VALUE_ERROR(theData\n                                 , getMaxInclusive()\n                                 , XMLExcepts::VALUE_exceed_maxIncl\n                                 , manager)\n            }\n        }\n\n        \/\/ must be >= MinInclusive\n        if ( (thisFacetsDefined & DatatypeValidator::FACET_MININCLUSIVE) != 0 )\n        {\n            result = compareValues(theData, getMinInclusive());\n            if (result == -1)\n            {\n                REPORT_VALUE_ERROR(theData\n                                 , getMinInclusive()\n                                 , XMLExcepts::VALUE_exceed_minIncl\n                                 , manager)\n            }\n        }\n\n        \/\/ must be > MinExclusive\n        if ( (thisFacetsDefined & DatatypeValidator::FACET_MINEXCLUSIVE) != 0 )\n        {\n            result = compareValues(theData, getMinExclusive());\n            if (result != 1)\n            {\n                REPORT_VALUE_ERROR(theData\n                                 , getMinExclusive()\n                                 , XMLExcepts::VALUE_exceed_minExcl\n                                 , manager)\n            }\n        }\n    }\n    catch (XMLException &e)\n    {\n       ThrowXMLwithMemMgr1(InvalidDatatypeValueException, XMLExcepts::RethrowError, e.getMessage(), manager);\n    }\n\n}\n\nconst XMLCh* AbstractNumericValidator::getCanonicalRepresentation(const XMLCh*         const rawData\n                                                                 ,      MemoryManager* const memMgr\n                                                                 ,      bool                 toValidate) const\n{\n    MemoryManager* toUse = memMgr? memMgr : fMemoryManager;\n\n    if (toValidate)\n    {\n        AbstractNumericValidator* temp = (AbstractNumericValidator*) this;\n\n        try \n        {\n            temp->checkContent(rawData, 0, false, toUse);\n        }\n        catch (...)\n        {\n            return 0;\n        }\n    }\n\n    \/\/ XMLAbstractDoubleFloat::getCanonicalRepresentation handles\n    \/\/ exceptional cases\n    return XMLAbstractDoubleFloat::getCanonicalRepresentation(rawData, toUse);\n\n}\n\n\/***\n * Support for Serialization\/De-serialization\n ***\/\n\nIMPL_XSERIALIZABLE_NOCREATE(AbstractNumericValidator)\n\nvoid AbstractNumericValidator::serialize(XSerializeEngine& serEng)\n{\n    AbstractNumericFacetValidator::serialize(serEng);\n\n    \/***\n     * Need not to do anything else here\n     *\n     * Note: its derivatives, Doubledv, Floatdv and Decimaldv writes\n     *       number type info into the binary data stream to be read\n     *       by AbstractNumericFacetVaildator during loading, therefore\n     *       this class can NOT write\/read anything into\/from the binary\n     *       data stream.\n     *\n     *       Later on, if this class has to write\/read something into\/from\n     *       the binary data stream, we need to add a numberType data\n     *       to XMLNumber and let AbstractNumericFacetValidator to write\/read\n     *       this number type info.\n     ***\/\n}\n\nXERCES_CPP_NAMESPACE_END\n\n\/**\n  * End of file AbstractNumericValidator::cpp\n  *\/\n\n<commit_msg>Minor code cleanup.<commit_after>\/*\n * Copyright 2001,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 * limitations under the License.\n *\/\n\n\/*\n * $Id$\n * $Log$\n * Revision 1.13  2004\/12\/01 17:44:20  cargilld\n * Minor code cleanup.\n *\n * Revision 1.12  2004\/09\/08 13:56:52  peiyongz\n * Apache License Version 2.0\n *\n * Revision 1.11  2003\/12\/23 21:50:36  peiyongz\n * Absorb exception thrown in getCanonicalRepresentation and return 0,\n * only validate when required\n *\n * Revision 1.10  2003\/12\/17 00:18:38  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.9  2003\/12\/11 21:40:24  peiyongz\n * support for Canonical Representation for Datatype\n *\n * Revision 1.8  2003\/11\/28 18:53:07  peiyongz\n * Support for getCanonicalRepresentation\n *\n * Revision 1.7  2003\/11\/12 20:32:03  peiyongz\n * Statless Grammar: ValidationContext\n *\n * Revision 1.6  2003\/10\/02 19:21:06  peiyongz\n * Implementation of Serialization\/Deserialization\n *\n * Revision 1.5  2003\/05\/15 18:53:26  knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.4  2003\/02\/02 23:55:40  peiyongz\n * getFormattedString() added to return original and converted value.\n *\n * Revision 1.3  2003\/01\/30 21:56:22  tng\n * Performance: call getRawData instead of toString\n *\n * Revision 1.2  2002\/11\/04 14:53:27  tng\n * C++ Namespace Support.\n *\n * Revision 1.1.1.1  2002\/02\/01 22:22:39  peiyongz\n * sane_include\n *\n * Revision 1.2  2001\/10\/09 21:16:31  peiyongz\n * . macro to simplify code\n *\n * Revision 1.1  2001\/10\/01 16:13:56  peiyongz\n * DTV Reorganization:new classes: AbstractNumericFactValidator\/ AbstractNumericValidator\n *\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/validators\/datatype\/AbstractNumericValidator.hpp>\n#include <xercesc\/validators\/datatype\/InvalidDatatypeValueException.hpp>\n#include <xercesc\/util\/XMLAbstractDoubleFloat.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n#define  REPORT_VALUE_ERROR(val1, val2, except_code, manager)    \\\n  ThrowXMLwithMemMgr2(InvalidDatatypeValueException               \\\n          , except_code                                 \\\n          , val1->getFormattedString()                  \\\n          , val2->getFormattedString()                  \\\n          , manager);\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nAbstractNumericValidator::~AbstractNumericValidator()\n{}\n\nAbstractNumericValidator::AbstractNumericValidator(\n                          DatatypeValidator*            const baseValidator\n                        , RefHashTableOf<KVStringPair>* const facets\n                        , const int                           finalSet\n                        , const ValidatorType                 type\n                        , MemoryManager* const                manager)\n:AbstractNumericFacetValidator(baseValidator, facets, finalSet, type, manager)\n{\n    \/\/do not invoke init() here !!!\n}\n\nvoid AbstractNumericValidator::validate(const XMLCh*             const content\n                                       ,      ValidationContext* const context\n                                       ,      MemoryManager*     const manager)\n{\n    checkContent(content, context, false, manager);\n}\n\nvoid AbstractNumericValidator::boundsCheck(const XMLNumber*         const theData\n                                          ,      MemoryManager*     const manager)\n{\n    int thisFacetsDefined = getFacetsDefined();\n    int result;\n\n    if (thisFacetsDefined == 0)\n        return;\n\n    try\n    {\n\n        \/\/ must be < MaxExclusive\n        if ( (thisFacetsDefined & DatatypeValidator::FACET_MAXEXCLUSIVE) != 0 )\n        {\n            result = compareValues(theData, getMaxExclusive());\n            if ( result != -1)\n            {\n                REPORT_VALUE_ERROR(theData\n                                 , getMaxExclusive()\n                                 , XMLExcepts::VALUE_exceed_maxExcl\n                                 , manager)\n            }\n        } \t\n\n        \/\/ must be <= MaxInclusive\n        if ( (thisFacetsDefined & DatatypeValidator::FACET_MAXINCLUSIVE) != 0 )\n        {\n            result = compareValues(theData, getMaxInclusive());\n            if (result == 1)\n            {\n                REPORT_VALUE_ERROR(theData\n                                 , getMaxInclusive()\n                                 , XMLExcepts::VALUE_exceed_maxIncl\n                                 , manager)\n            }\n        }\n\n        \/\/ must be >= MinInclusive\n        if ( (thisFacetsDefined & DatatypeValidator::FACET_MININCLUSIVE) != 0 )\n        {\n            result = compareValues(theData, getMinInclusive());\n            if (result == -1)\n            {\n                REPORT_VALUE_ERROR(theData\n                                 , getMinInclusive()\n                                 , XMLExcepts::VALUE_exceed_minIncl\n                                 , manager)\n            }\n        }\n\n        \/\/ must be > MinExclusive\n        if ( (thisFacetsDefined & DatatypeValidator::FACET_MINEXCLUSIVE) != 0 )\n        {\n            result = compareValues(theData, getMinExclusive());\n            if (result != 1)\n            {\n                REPORT_VALUE_ERROR(theData\n                                 , getMinExclusive()\n                                 , XMLExcepts::VALUE_exceed_minExcl\n                                 , manager)\n            }\n        }\n    }\n    catch (XMLException &e)\n    {\n       ThrowXMLwithMemMgr1(InvalidDatatypeValueException, XMLExcepts::RethrowError, e.getMessage(), manager);\n    }\n\n}\n\nconst XMLCh* AbstractNumericValidator::getCanonicalRepresentation(const XMLCh*         const rawData\n                                                                 ,      MemoryManager* const memMgr\n                                                                 ,      bool                 toValidate) const\n{\n    MemoryManager* toUse = memMgr? memMgr : fMemoryManager;\n\n    if (toValidate)\n    {\n        AbstractNumericValidator* temp = (AbstractNumericValidator*) this;\n\n        try \n        {\n            temp->checkContent(rawData, 0, false, toUse);\n        }\n        catch (...)\n        {\n            return 0;\n        }\n    }\n\n    \/\/ XMLAbstractDoubleFloat::getCanonicalRepresentation handles\n    \/\/ exceptional cases\n    return XMLAbstractDoubleFloat::getCanonicalRepresentation(rawData, toUse);\n\n}\n\n\/***\n * Support for Serialization\/De-serialization\n ***\/\n\nIMPL_XSERIALIZABLE_NOCREATE(AbstractNumericValidator)\n\nvoid AbstractNumericValidator::serialize(XSerializeEngine& serEng)\n{\n    AbstractNumericFacetValidator::serialize(serEng);\n\n    \/***\n     * Need not to do anything else here\n     *\n     * Note: its derivatives, Doubledv, Floatdv and Decimaldv writes\n     *       number type info into the binary data stream to be read\n     *       by AbstractNumericFacetVaildator during loading, therefore\n     *       this class can NOT write\/read anything into\/from the binary\n     *       data stream.\n     *\n     *       Later on, if this class has to write\/read something into\/from\n     *       the binary data stream, we need to add a numberType data\n     *       to XMLNumber and let AbstractNumericFacetValidator to write\/read\n     *       this number type info.\n     ***\/\n}\n\nXERCES_CPP_NAMESPACE_END\n\n\/**\n  * End of file AbstractNumericValidator::cpp\n  *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * Copyright (c) 2014 Niall Frederick Weedon and other Contributors\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * which accompanies this distribution, and is available at\n * http:\/\/www.eclipse.org\/legal\/epl-v10.html\n *\n * Contributors:\n *    Niall Frederick Weedon - Initial Contribution\n *******************************************************************************\/ \n#include \"QuickstartClient.h\"\n\n\/\/ QuickstartClient (Constructor)\n\/\/ Constructs the quickstart client, setting up an asynchronous\n\/\/ MQTT client connection to the Quickstart service and the topic\n\/\/ string to be used when publishing.\n\/\/ @param deviceName \t- The name you wish to provide the service as an identifier.\n\/\/ @param macAddress\t- The MAC Address you wish to provide the service.\nQuickstartClient::QuickstartClient(std::string deviceName, std::string macAddress) {\n\tclient = std::unique_ptr<mqtt::async_client>(new mqtt::async_client(\"messaging.quickstart.internetofthings.ibmcloud.com:1883\", \"quickstart:\" + macAddress));\n\ttopic = std::string(\"iot-1\/d\/\" + macAddress + \"\/evt\/rpi-quickstart\/json\");\n\tmyName = deviceName;\n\n\tif(client) {\n\t\tClientCallback cb;\n\t\tclient->set_callback(cb);\n\n\t\tconnect();\n\t}\n}\n\n\/\/ QuickstartClient (Destructor)\n\/\/ Destructs the Quickstart client, in this case, disconnecting\n\/\/ the client if it is connected and releasing the resources used\n\/\/ by it.\nQuickstartClient::~QuickstartClient(void) {\n\tdisconnect();\n}\n\n\/\/ connect\n\/\/ Connects to the MQTT Service.\nvoid QuickstartClient::connect(void) {\n\tif(client) {\n\t\tstd::cout << \"Connecting...\" << std::flush;\n\t\t\/\/ Connect to the service asynchronously and wait\n\t\t\/\/ for the connection to complete.\n\t\tconnectionToken = client->connect();\n\t\tconnectionToken->wait_for_completion();\n\t\tstd::cout << \"\\t\\t\\t[ OK ]\" << std::endl;\n\t}\n}\n\n\/\/ disconnect\n\/\/ Disconnects from the MQTT Service.\nvoid QuickstartClient::disconnect(void) {\n\tif(client) {\n\t\tstd::cout << \"Disconnecting...\" << std::flush;\n\t\t\/\/ Disconnect asynchronously and wait for its\n\t\t\/\/ completion.\n\t\tconnectionToken = client->disconnect();\n\t\tconnectionToken->wait_for_completion();\n\t\tstd::cout << \"\\t\\t[ OK ]\" << std::endl;\n\t}\n}\n\n\/\/ publish\n\/\/ Publish a Raspberry Pi quickstart message.\n\/\/ @param cpuTemperature\n\/\/ @param cpuLoad\n\/\/ @param sine\nvoid QuickstartClient::publish(double cpuTemperature, double cpuLoad, double sine) {\n\tif(client) {\n\t\tstd::string payload = std::string(\"{\\\"d\\\":{ \\\"cputemp\\\":\" + std::to_string(cpuTemperature));\n\t\tpayload += std::string(\", \\\"cpuload\\\":\" + std::to_string(cpuLoad));\n\t\tpayload += std::string(\", \\\"sine\\\":\" + std::to_string(sine));\n\t\tpayload += std::string(\", \\\"myName\\\": \\\"\" + myName + \"\\\" } }\");\n\n\t\tmqtt::message_ptr pubmsg = std::make_shared<mqtt::message>(payload.c_str());\n\t\tpubmsg->set_qos(0);\n\t\tclient->publish(topic, pubmsg)->wait_for_completion(TIMEOUT);\n\t}\n}\n\n\/\/ connection_lost\n\/\/ Event fired when the client unexpectedly loses\n\/\/ connection from the service.\nvoid QuickstartClient::ClientCallback::connection_lost(const std::string& cause) {\n\tstd::cout << \"\\nConnection lost.\" << std::endl;\n\tif (!cause.empty())\n\t\tstd::cout << \"\\tCause: \" << cause << std::endl;\n}\n\n\/\/ delivery_complete\n\/\/ Event fired when the client successfully publishes\n\/\/ a message.\nvoid QuickstartClient::ClientCallback::delivery_complete(mqtt::idelivery_token_ptr tok) {\n\t\n}\n\n\/\/ message_arrived\n\/\/ Event fired when the client receives a message.\nvoid QuickstartClient::ClientCallback::message_arrived(const std::string& topic, mqtt::message_ptr msg) {\n\n}<commit_msg>Connect to iot-2 Quickstart<commit_after>\/*******************************************************************************\n * Copyright (c) 2014 Niall Frederick Weedon and other Contributors\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * which accompanies this distribution, and is available at\n * http:\/\/www.eclipse.org\/legal\/epl-v10.html\n *\n * Contributors:\n *    Niall Frederick Weedon - Initial Contribution\n *******************************************************************************\/ \n#include \"QuickstartClient.h\"\n\n\/\/ QuickstartClient (Constructor)\n\/\/ Constructs the quickstart client, setting up an asynchronous\n\/\/ MQTT client connection to the Quickstart service and the topic\n\/\/ string to be used when publishing.\n\/\/ @param deviceName \t- The name you wish to provide the service as an identifier.\n\/\/ @param macAddress\t- The MAC Address you wish to provide the service.\nQuickstartClient::QuickstartClient(std::string deviceName, std::string macAddress) {\n\tclient = std::unique_ptr<mqtt::async_client>(new mqtt::async_client(\"quickstart.messaging.internetofthings.ibmcloud.com:1883\", \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\"d:quickstart:iotsample-raspberrypi:\" + macAddress));\n\ttopic = std::string(\"iot-2\/evt\/status\/fmt\/json\");\n\tmyName = deviceName;\n\n\tif(client) {\n\t\tClientCallback cb;\n\t\tclient->set_callback(cb);\n\n\t\tconnect();\n\t}\n}\n\n\/\/ QuickstartClient (Destructor)\n\/\/ Destructs the Quickstart client, in this case, disconnecting\n\/\/ the client if it is connected and releasing the resources used\n\/\/ by it.\nQuickstartClient::~QuickstartClient(void) {\n\tdisconnect();\n}\n\n\/\/ connect\n\/\/ Connects to the MQTT Service.\nvoid QuickstartClient::connect(void) {\n\tif(client) {\n\t\tstd::cout << \"Connecting...\" << std::flush;\n\t\t\/\/ Connect to the service asynchronously and wait\n\t\t\/\/ for the connection to complete.\n\t\tconnectionToken = client->connect();\n\t\tconnectionToken->wait_for_completion();\n\t\tstd::cout << \"\\t\\t\\t[ OK ]\" << std::endl;\n\t}\n}\n\n\/\/ disconnect\n\/\/ Disconnects from the MQTT Service.\nvoid QuickstartClient::disconnect(void) {\n\tif(client) {\n\t\tstd::cout << \"Disconnecting...\" << std::flush;\n\t\t\/\/ Disconnect asynchronously and wait for its\n\t\t\/\/ completion.\n\t\tconnectionToken = client->disconnect();\n\t\tconnectionToken->wait_for_completion();\n\t\tstd::cout << \"\\t\\t[ OK ]\" << std::endl;\n\t}\n}\n\n\/\/ publish\n\/\/ Publish a Raspberry Pi quickstart message.\n\/\/ @param cpuTemperature\n\/\/ @param cpuLoad\n\/\/ @param sine\nvoid QuickstartClient::publish(double cpuTemperature, double cpuLoad, double sine) {\n\tif(client) {\n\t\tstd::string payload = std::string(\"{\\\"d\\\":{ \\\"cputemp\\\":\" + std::to_string(cpuTemperature));\n\t\tpayload += std::string(\", \\\"cpuload\\\":\" + std::to_string(cpuLoad));\n\t\tpayload += std::string(\", \\\"sine\\\":\" + std::to_string(sine));\n\t\tpayload += std::string(\", \\\"myName\\\": \\\"\" + myName + \"\\\" } }\");\n\n\t\tmqtt::message_ptr pubmsg = std::make_shared<mqtt::message>(payload.c_str());\n\t\tpubmsg->set_qos(0);\n\t\tclient->publish(topic, pubmsg)->wait_for_completion(TIMEOUT);\n\t}\n}\n\n\/\/ connection_lost\n\/\/ Event fired when the client unexpectedly loses\n\/\/ connection from the service.\nvoid QuickstartClient::ClientCallback::connection_lost(const std::string& cause) {\n\tstd::cout << \"\\nConnection lost.\" << std::endl;\n\tif (!cause.empty())\n\t\tstd::cout << \"\\tCause: \" << cause << std::endl;\n}\n\n\/\/ delivery_complete\n\/\/ Event fired when the client successfully publishes\n\/\/ a message.\nvoid QuickstartClient::ClientCallback::delivery_complete(mqtt::idelivery_token_ptr tok) {\n\t\n}\n\n\/\/ message_arrived\n\/\/ Event fired when the client receives a message.\nvoid QuickstartClient::ClientCallback::message_arrived(const std::string& topic, mqtt::message_ptr msg) {\n\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <GL\/glew.h>\n#include \"glfw3.h\"\n#include <vector>\n\n#include \"Engine\/Display.h\"\n#include \"MB\/Scene.h\"\n#include \"MB\/Scene1.h\"\n#include \"MB\/StartMenu.h\"\n\nDisplay* display;\nScene* scene;\nScene1* scene1;\nStartMenu* startscene;\n\nint main()\n{\n  display = new Display();\n  startscene = new StartMenu(display->input);\n  scene = new Scene(display->input);\n  scene1 = new Scene1(display->input);\n  display->addScene(startscene);\n  display->addScene(scene);\n  display->addScene(scene1);\n  display->gameLoop();\n  delete scene;\n  delete scene1;\n  delete startscene;\n  delete display;\n  std::cout << \"Window closed\" << std::endl;\n  return 0;\n}\n<commit_msg>Update documentation<commit_after>#include <iostream>\n#include <GL\/glew.h>\n#include \"glfw3.h\"\n#include <vector>\n\n#include \"Engine\/Display.h\"\n#include \"MB\/Scene.h\"\n#include \"MB\/Scene1.h\"\n#include \"MB\/StartMenu.h\"\n\n\/\/ Declare types\nDisplay* display;\nScene* scene;\nScene1* scene1;\nStartMenu* startscene;\n\nint main()\n{\n  \/\/ Make a new Display, This will load all necessary framework related classes\n  display = new Display();\n  \/\/ Make the scenes we have and give them the input display created for us\n  startscene = new StartMenu(display->input);\n  scene = new Scene(display->input);\n  scene1 = new Scene1(display->input);\n  \/\/ Add those scenes to the scenemanager\n  display->addScene(startscene);\n  display->addScene(scene);\n  display->addScene(scene1);\n  \/\/ Start the main gameloop\n  display->gameLoop();\n  \/\/ If the gameloop stops we can delete everything we created here\n  delete scene;\n  delete scene1;\n  delete startscene;\n  delete display;\n  std::cout << \"Window closed\" << std::endl;\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#if _WIN32\n#ifndef NOMINMAX\n#define NOMINMAX\n#endif\n#include <objbase.h>\n#endif\n\n#include <clocale>\n#include <memory>\n#include <boo\/boo.hpp>\n#include <boo\/graphicsdev\/GL.hpp>\n#include \"CBasics.hpp\"\n#include \"CMemoryCardSys.hpp\"\n#include \"CResFactory.hpp\"\n#include \"CSimplePool.hpp\"\n#include \"Character\/CAssetFactory.hpp\"\n#include \"CAi.hpp\"\n#include \"CGameState.hpp\"\n#include \"CInGameTweakManager.hpp\"\n#include \"Particle\/CElementGen.hpp\"\n#include \"Character\/CAnimData.hpp\"\n#include \"Particle\/CDecalManager.hpp\"\n#include \"Graphics\/CBooRenderer.hpp\"\n#include \"Audio\/CAudioSys.hpp\"\n#include \"Input\/CInputGenerator.hpp\"\n#include \"GuiSys\/CGuiSys.hpp\"\n#include \"CIOWinManager.hpp\"\n#include \"GuiSys\/CSplashScreen.hpp\"\n#include \"CMainFlow.hpp\"\n#include \"GuiSys\/CConsoleOutputWindow.hpp\"\n#include \"Audio\/CAudioStateWin.hpp\"\n#include \"GameGlobalObjects.hpp\"\n#include \"CArchitectureQueue.hpp\"\n#include \"CMain.hpp\"\n#include \"CTimeProvider.hpp\"\n\n#include \"DataSpec\/DNAMP1\/Tweaks\/CTweakPlayer.hpp\"\n#include \"DataSpec\/DNAMP1\/Tweaks\/CTweakGame.hpp\"\n\nnamespace pshag\n{\nCMemoryCardSys* g_MemoryCardSys = nullptr;\nCResFactory*  g_ResFactory = nullptr;\nCSimplePool* g_SimplePool = nullptr;\nCCharacterFactoryBuilder* g_CharFactoryBuilder = nullptr;\nCAiFuncMap* g_AiFuncMap = nullptr;\nCGameState* g_GameState = nullptr;\nCInGameTweakManagerBase* g_TweakManager = nullptr;\nCBooRenderer* g_Renderer = nullptr;\n\nnamespace MP1\n{\nclass CMain* g_main = nullptr;\n\nclass CGameGlobalObjects\n{\n    CMemoryCardSys x0_memoryCardSys;\n    CResFactory x20_resFactory;\n    CSimplePool x114_simplePool;\n    CCharacterFactoryBuilder x14c_charFactoryBuilder;\n    CAiFuncMap x188_aiFuncMap;\n    CGameState x1a8_gameState;\n    CInGameTweakManager x1c0_tweakManager;\n    std::unique_ptr<CBooRenderer> m_renderer;\n\n    void AddPaksAndFactories()\n    {\n    }\n    void LoadStringTable()\n    {\n    }\n    static CBooRenderer*\n    AllocateRenderer(IObjectStore& store,\n                     CMemorySys& memSys, CResFactory& resFactory)\n    {\n        g_Renderer = new CBooRenderer(store, memSys, resFactory);\n        return g_Renderer;\n    }\n\npublic:\n    CGameGlobalObjects()\n    : x114_simplePool(x20_resFactory)\n    {\n        g_MemoryCardSys = &x0_memoryCardSys;\n        g_ResFactory = &x20_resFactory;\n        g_SimplePool = &x114_simplePool;\n        g_CharFactoryBuilder = &x14c_charFactoryBuilder;\n        g_AiFuncMap = &x188_aiFuncMap;\n        g_GameState = &x1a8_gameState;\n        g_TweakManager = &x1c0_tweakManager;\n    }\n\n    void PostInitialize(CMemorySys& memSys)\n    {\n        AddPaksAndFactories();\n        LoadStringTable();\n        m_renderer.reset(AllocateRenderer(x114_simplePool, memSys, x20_resFactory));\n    }\n};\n\nclass CGameArchitectureSupport : public boo::IWindowCallback\n{\n    CArchitectureQueue m_archQueue;\n    CAudioSys m_audioSys;\n    CInputGenerator m_inputGenerator;\n    CGuiSys m_guiSys;\n    CIOWinManager m_ioWinManager;\n    CSplashScreen m_splashScreen;\n    CMainFlow m_mainFlow;\n    CConsoleOutputWindow m_consoleWindow;\n    CAudioStateWin m_audioStateWin;\n\n    void mouseDown(const boo::SWindowCoord &coord, boo::EMouseButton button, boo::EModifierKey mods)\n    { m_inputGenerator.mouseDown(coord, button, mods); }\n    void mouseUp(const boo::SWindowCoord &coord, boo::EMouseButton button, boo::EModifierKey mods)\n    { m_inputGenerator.mouseUp(coord, button, mods); }\n    void mouseMove(const boo::SWindowCoord &coord)\n    { m_inputGenerator.mouseMove(coord); }\n    void scroll(const boo::SWindowCoord &coord, const boo::SScrollDelta &scroll)\n    { m_inputGenerator.scroll(coord, scroll); }\n    void charKeyDown(unsigned long charCode, boo::EModifierKey mods, bool isRepeat)\n    { m_inputGenerator.charKeyDown(charCode, mods, isRepeat); }\n    void charKeyUp(unsigned long charCode, boo::EModifierKey mods)\n    { m_inputGenerator.charKeyUp(charCode, mods); }\n    void specialKeyDown(boo::ESpecialKey key, boo::EModifierKey mods, bool isRepeat)\n    { m_inputGenerator.specialKeyDown(key, mods, isRepeat); }\n    void specialKeyUp(boo::ESpecialKey key, boo::EModifierKey mods)\n    { m_inputGenerator.specialKeyUp(key, mods); }\n    void modKeyDown(boo::EModifierKey mod, bool isRepeat)\n    { m_inputGenerator.modKeyDown(mod, isRepeat);}\n    void modKeyUp(boo::EModifierKey mod)\n    { m_inputGenerator.modKeyUp(mod); }\n\n    void destroyed() { m_archQueue.Push(std::move(MakeMsg::CreateApplicationExit(EArchMsgTarget::ArchitectureSupport))); }\n\npublic:\n    CGameArchitectureSupport()\n        : m_audioSys(0,0,0,0,0),\n          m_inputGenerator(0.0f \/*g_tweakPlayer->GetLeftLogicalThreshold()*\/,\n                           0.0f \/*g_tweakPlayer->GetRightLogicalThreshold()*\/)\n    {\n        m_inputGenerator.startScanning();\n    }\n    bool Update()\n    {\n        bool finished = false;\n        m_inputGenerator.Update(1.0 \/ 60.0, m_archQueue);\n\n        while(m_archQueue)\n        {\n            CArchitectureMessage msg = m_archQueue.Pop();\n            if (msg.GetTarget() == EArchMsgTarget::ArchitectureSupport)\n            {\n                if (msg.GetType() == EArchMsgType::ApplicationExit)\n                    finished = true;\n            }\n\n            if (msg.GetTarget() == EArchMsgTarget::Game && msg.GetType() == EArchMsgType::UserInput)\n            {\n                const CArchMsgParmUserInput* input = msg.GetParm<CArchMsgParmUserInput>();\n                if (input->x4_parm.DStart())\n                    m_archQueue.Push(std::move(MakeMsg::CreateApplicationExit(EArchMsgTarget::ArchitectureSupport)));\n            }\n        }\n        return finished;\n    }\n};\n\nCMain::CMain()\n: x6c_memSys(CMemorySys::GetGameAllocator())\n{\n    g_main = this;\n    xe4_gameplayResult = EGameplayResult::Playing;\n}\nvoid CMain::RegisterResourceTweaks()\n{\n}\nvoid CMain::ResetGameState()\n{\n}\n\nvoid CMain::InitializeSubsystems()\n{\n    CElementGen::Initialize();\n    CAnimData::InitializeCache();\n    CDecalManager::Initialize();\n}\nvoid CMain::AddWorldPaks()\n{\n#if 0\n    u32 i = 0;\n    while (i <= 255)\n    {\n        std::string pakName = CBasics::Stringize(\"%s%i.pak\", g_tweakGame->GetWorldPrefix().c_str(), i);\n        if (CDvdFile::FileExists(pakName.c_str()))\n            g_ResFactory->GetLoader().AddPakFile(pakName, false);\n        i++;\n    }\n#endif\n}\n\nvoid CMain::FillInAssetIDs()\n{\n}\nvoid CMain::LoadAudio()\n{\n}\n\nint CMain::appMain(boo::IApplication* app)\n{\n    Zeus::detectCPU();\n    mainWindow = app->newWindow(_S(\"Metroid Prime 1 Reimplementation vZygote\"));\n    mainWindow->showWindow();\n    TOneStatic<CGameGlobalObjects> globalObjs;\n    InitializeSubsystems();\n    globalObjs->PostInitialize(x6c_memSys);\n    x70_tweaks.RegisterTweaks();\n    AddWorldPaks();\n    g_TweakManager->ReadFromMemoryCard(\"AudioTweaks\");\n    FillInAssetIDs();\n    TOneStatic<CGameArchitectureSupport> archSupport;\n    mainWindow->setCallback(archSupport.GetAllocSpace());\n\n    boo::IGraphicsCommandQueue* gfxQ = mainWindow->getCommandQueue();\n    float rgba[4] = { 0.2f, 0.2f, 0.2f, 1.0f};\n    gfxQ->setClearColor(rgba);\n\n    while (!xe8_b24_finished)\n    {\n        mainWindow->waitForRetrace();\n        xe8_b24_finished = archSupport->Update();\n        gfxQ->clearTarget();\n\n        gfxQ->resolveDisplay(nullptr);\n        gfxQ->execute();\n    }\n    return 0;\n}\n\n}\n}\n\n#ifdef _WIN32\nint wmain(int argc, const wchar_t* argv[])\n#else\nint main(int argc, const char* argv[])\n#endif\n{\n#if _WIN32\n    CoInitializeEx(nullptr, COINIT_MULTITHREADED);\n#else\n    std::setlocale(LC_ALL, \"en-US.UTF-8\");\n#endif\n\n    LogVisor::RegisterConsoleLogger();\n    pshag::TOneStatic<pshag::MP1::CMain> main;\n    int ret = boo::ApplicationRun(boo::IApplication::EPlatformType::Auto, *main,\n                                  _S(\"mp1\"), _S(\"MP1\"), argc, argv);\n    return ret;\n}\n<commit_msg>Use rendertarget<commit_after>#if _WIN32\n#ifndef NOMINMAX\n#define NOMINMAX\n#endif\n#include <objbase.h>\n#endif\n\n#include <clocale>\n#include <memory>\n#include <boo\/boo.hpp>\n#include <boo\/graphicsdev\/GL.hpp>\n#include \"CBasics.hpp\"\n#include \"CMemoryCardSys.hpp\"\n#include \"CResFactory.hpp\"\n#include \"CSimplePool.hpp\"\n#include \"Character\/CAssetFactory.hpp\"\n#include \"CAi.hpp\"\n#include \"CGameState.hpp\"\n#include \"CInGameTweakManager.hpp\"\n#include \"Particle\/CElementGen.hpp\"\n#include \"Character\/CAnimData.hpp\"\n#include \"Particle\/CDecalManager.hpp\"\n#include \"Graphics\/CBooRenderer.hpp\"\n#include \"Audio\/CAudioSys.hpp\"\n#include \"Input\/CInputGenerator.hpp\"\n#include \"GuiSys\/CGuiSys.hpp\"\n#include \"CIOWinManager.hpp\"\n#include \"GuiSys\/CSplashScreen.hpp\"\n#include \"CMainFlow.hpp\"\n#include \"GuiSys\/CConsoleOutputWindow.hpp\"\n#include \"Audio\/CAudioStateWin.hpp\"\n#include \"GameGlobalObjects.hpp\"\n#include \"CArchitectureQueue.hpp\"\n#include \"CMain.hpp\"\n#include \"CTimeProvider.hpp\"\n\n#include \"DataSpec\/DNAMP1\/Tweaks\/CTweakPlayer.hpp\"\n#include \"DataSpec\/DNAMP1\/Tweaks\/CTweakGame.hpp\"\n\nnamespace pshag\n{\nCMemoryCardSys* g_MemoryCardSys = nullptr;\nCResFactory*  g_ResFactory = nullptr;\nCSimplePool* g_SimplePool = nullptr;\nCCharacterFactoryBuilder* g_CharFactoryBuilder = nullptr;\nCAiFuncMap* g_AiFuncMap = nullptr;\nCGameState* g_GameState = nullptr;\nCInGameTweakManagerBase* g_TweakManager = nullptr;\nCBooRenderer* g_Renderer = nullptr;\n\nnamespace MP1\n{\nclass CMain* g_main = nullptr;\n\nclass CGameGlobalObjects\n{\n    CMemoryCardSys x0_memoryCardSys;\n    CResFactory x20_resFactory;\n    CSimplePool x114_simplePool;\n    CCharacterFactoryBuilder x14c_charFactoryBuilder;\n    CAiFuncMap x188_aiFuncMap;\n    CGameState x1a8_gameState;\n    CInGameTweakManager x1c0_tweakManager;\n    std::unique_ptr<CBooRenderer> m_renderer;\n\n    void AddPaksAndFactories()\n    {\n    }\n    void LoadStringTable()\n    {\n    }\n    static CBooRenderer*\n    AllocateRenderer(IObjectStore& store,\n                     CMemorySys& memSys, CResFactory& resFactory)\n    {\n        g_Renderer = new CBooRenderer(store, memSys, resFactory);\n        return g_Renderer;\n    }\n\npublic:\n    CGameGlobalObjects()\n    : x114_simplePool(x20_resFactory)\n    {\n        g_MemoryCardSys = &x0_memoryCardSys;\n        g_ResFactory = &x20_resFactory;\n        g_SimplePool = &x114_simplePool;\n        g_CharFactoryBuilder = &x14c_charFactoryBuilder;\n        g_AiFuncMap = &x188_aiFuncMap;\n        g_GameState = &x1a8_gameState;\n        g_TweakManager = &x1c0_tweakManager;\n    }\n\n    void PostInitialize(CMemorySys& memSys)\n    {\n        AddPaksAndFactories();\n        LoadStringTable();\n        m_renderer.reset(AllocateRenderer(x114_simplePool, memSys, x20_resFactory));\n    }\n};\n\nclass CGameArchitectureSupport : public boo::IWindowCallback\n{\n    CArchitectureQueue m_archQueue;\n    CAudioSys m_audioSys;\n    CInputGenerator m_inputGenerator;\n    CGuiSys m_guiSys;\n    CIOWinManager m_ioWinManager;\n    CSplashScreen m_splashScreen;\n    CMainFlow m_mainFlow;\n    CConsoleOutputWindow m_consoleWindow;\n    CAudioStateWin m_audioStateWin;\n    boo::SWindowRect m_windowRect;\n    bool m_rectIsDirty;\n\n    void mouseDown(const boo::SWindowCoord &coord, boo::EMouseButton button, boo::EModifierKey mods)\n    { m_inputGenerator.mouseDown(coord, button, mods); }\n    void mouseUp(const boo::SWindowCoord &coord, boo::EMouseButton button, boo::EModifierKey mods)\n    { m_inputGenerator.mouseUp(coord, button, mods); }\n    void mouseMove(const boo::SWindowCoord &coord)\n    { m_inputGenerator.mouseMove(coord); }\n    void scroll(const boo::SWindowCoord &coord, const boo::SScrollDelta &scroll)\n    { m_inputGenerator.scroll(coord, scroll); }\n    void charKeyDown(unsigned long charCode, boo::EModifierKey mods, bool isRepeat)\n    { m_inputGenerator.charKeyDown(charCode, mods, isRepeat); }\n    void charKeyUp(unsigned long charCode, boo::EModifierKey mods)\n    { m_inputGenerator.charKeyUp(charCode, mods); }\n    void specialKeyDown(boo::ESpecialKey key, boo::EModifierKey mods, bool isRepeat)\n    { m_inputGenerator.specialKeyDown(key, mods, isRepeat); }\n    void specialKeyUp(boo::ESpecialKey key, boo::EModifierKey mods)\n    { m_inputGenerator.specialKeyUp(key, mods); }\n    void modKeyDown(boo::EModifierKey mod, bool isRepeat)\n    { m_inputGenerator.modKeyDown(mod, isRepeat);}\n    void modKeyUp(boo::EModifierKey mod)\n    { m_inputGenerator.modKeyUp(mod); }\n\n    void destroyed() { m_archQueue.Push(std::move(MakeMsg::CreateApplicationExit(EArchMsgTarget::ArchitectureSupport))); }\n\n    void resized(const boo::SWindowRect &rect)\n    {\n        m_windowRect = rect;\n        m_rectIsDirty = true;\n    }\n\npublic:\n    CGameArchitectureSupport()\n        : m_audioSys(0,0,0,0,0),\n          m_inputGenerator(0.0f \/*g_tweakPlayer->GetLeftLogicalThreshold()*\/,\n                           0.0f \/*g_tweakPlayer->GetRightLogicalThreshold()*\/)\n    {\n        m_inputGenerator.startScanning();\n    }\n    bool Update()\n    {\n        bool finished = false;\n        m_inputGenerator.Update(1.0 \/ 60.0, m_archQueue);\n\n        while(m_archQueue)\n        {\n            CArchitectureMessage msg = m_archQueue.Pop();\n            if (msg.GetTarget() == EArchMsgTarget::ArchitectureSupport)\n            {\n                if (msg.GetType() == EArchMsgType::ApplicationExit)\n                    finished = true;\n            }\n\n            if (msg.GetTarget() == EArchMsgTarget::Game && msg.GetType() == EArchMsgType::UserInput)\n            {\n                const CArchMsgParmUserInput* input = msg.GetParm<CArchMsgParmUserInput>();\n                if (input->x4_parm.DStart())\n                    m_archQueue.Push(std::move(MakeMsg::CreateApplicationExit(EArchMsgTarget::ArchitectureSupport)));\n            }\n        }\n        return finished;\n    }\n\n    bool isRectDirty() { return m_rectIsDirty; }\n    const boo::SWindowRect& getWindowRect()\n    {\n        m_rectIsDirty = false;\n        return m_windowRect;\n    }\n};\n\nCMain::CMain()\n: x6c_memSys(CMemorySys::GetGameAllocator())\n{\n    g_main = this;\n    xe4_gameplayResult = EGameplayResult::Playing;\n}\nvoid CMain::RegisterResourceTweaks()\n{\n}\nvoid CMain::ResetGameState()\n{\n}\n\nvoid CMain::InitializeSubsystems()\n{\n    CElementGen::Initialize();\n    CAnimData::InitializeCache();\n    CDecalManager::Initialize();\n}\nvoid CMain::AddWorldPaks()\n{\n#if 0\n    u32 i = 0;\n    while (i <= 255)\n    {\n        std::string pakName = CBasics::Stringize(\"%s%i.pak\", g_tweakGame->GetWorldPrefix().c_str(), i);\n        if (CDvdFile::FileExists(pakName.c_str()))\n            g_ResFactory->GetLoader().AddPakFile(pakName, false);\n        i++;\n    }\n#endif\n}\n\nvoid CMain::FillInAssetIDs()\n{\n}\nvoid CMain::LoadAudio()\n{\n}\n\nint CMain::appMain(boo::IApplication* app)\n{\n    Zeus::detectCPU();\n    mainWindow = app->newWindow(_S(\"Metroid Prime 1 Reimplementation vZygote\"));\n    mainWindow->showWindow();\n    TOneStatic<CGameGlobalObjects> globalObjs;\n    InitializeSubsystems();\n    globalObjs->PostInitialize(x6c_memSys);\n    x70_tweaks.RegisterTweaks();\n    AddWorldPaks();\n    g_TweakManager->ReadFromMemoryCard(\"AudioTweaks\");\n    FillInAssetIDs();\n    TOneStatic<CGameArchitectureSupport> archSupport;\n    mainWindow->setCallback(archSupport.GetAllocSpace());\n\n    boo::IGraphicsCommandQueue* gfxQ = mainWindow->getCommandQueue();\n    boo::SWindowRect windowRect = mainWindow->getWindowFrame();\n    boo::ITextureR* renderTex = mainWindow->getMainContextDataFactory()->newRenderTexture(windowRect.size[0], windowRect.size[1], 1);\n    float rgba[4] = { 0.2f, 0.2f, 0.2f, 1.0f};\n    gfxQ->setClearColor(rgba);\n\n    while (!xe8_b24_finished)\n    {\n        mainWindow->waitForRetrace();\n        xe8_b24_finished = archSupport->Update();\n\n        if (archSupport->isRectDirty())\n        {\n            const boo::SWindowRect& windowRect = archSupport->getWindowRect();\n            gfxQ->resizeRenderTexture(renderTex,\n                                      windowRect.size[0],\n                                      windowRect.size[1]);\n        }\n\n        gfxQ->setRenderTarget(renderTex);\n        gfxQ->clearTarget();\n        gfxQ->resolveDisplay(renderTex);\n        gfxQ->execute();\n    }\n    return 0;\n}\n\n}\n}\n\n#ifdef _WIN32\nint wmain(int argc, const wchar_t* argv[])\n#else\nint main(int argc, const char* argv[])\n#endif\n{\n#if _WIN32\n    CoInitializeEx(nullptr, COINIT_MULTITHREADED);\n#else\n    std::setlocale(LC_ALL, \"en-US.UTF-8\");\n#endif\n\n    LogVisor::RegisterConsoleLogger();\n    pshag::TOneStatic<pshag::MP1::CMain> main;\n    int ret = boo::ApplicationRun(boo::IApplication::EPlatformType::Auto, *main,\n                                  _S(\"mp1\"), _S(\"MP1\"), argc, argv);\n    return ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>#if !defined __GNUC__\n#pragma warning( disable: 4571 4820 4514 4987 4710 4309 4986 4548)\n\/\/ relative include path contains '..'\n\/\/ (function) selected for automatic inline expansion\n#pragma warning( disable: 4464 4711 )\n#endif\n\n#include <iostream>\n#include \"..\/SafeInt.hpp\"\n\nenum class Foo\n{\n\tFoo1 = 0,\n\tFoo2\n};\n\ntemplate <typename T, typename U>\nvoid CompiledMixedType()\n{\n\t\/\/ Mixed constructors\n\tU u = 0;\n\tSafeInt<T> st(u);\n\tSafeInt<U> su(u);\n\tSafeInt<T> st2(su);\n}\n\ntemplate <typename T>\nvoid CompileType()\n{\n\t\/\/ Test constructors\n\tSafeInt<T> s;\n\tSafeInt<T> i(Foo::Foo1);\n\tT t = 0;\n\tSafeInt<T> st(t);\n\tSafeInt<T> b(false);\n\n\t\/\/ Mixed operations\n\tCompiledMixedType<T, char>();\n\tCompiledMixedType<T, signed char>();\n\tCompiledMixedType<T, unsigned char>();\n\tCompiledMixedType<T, short>();\n\tCompiledMixedType<T, unsigned short>();\n\tCompiledMixedType<T, int>();\n\tCompiledMixedType<T, unsigned int>();\n\tCompiledMixedType<T, long>();\n\tCompiledMixedType<T, unsigned long>();\n\tCompiledMixedType<T, long long>();\n\tCompiledMixedType<T, unsigned long long>();\n}\n\nvoid CompileMe()\n{\n\tCompileType<char>();\n\tCompileType<unsigned char>();\n\tCompileType<signed char>();\n\n\tCompileType<unsigned short>();\n\tCompileType<signed short>();\n\tCompileType<unsigned int>();\n\tCompileType<signed int>();\n\tCompileType<unsigned long>();\n\tCompileType<signed long>();\n\tCompileType<unsigned long long>();\n\tCompileType<signed long long>();\n}\n\nint main(int, char**)\n{\n  std::cout << \"It compiles!\\n\";\n  return 0;\n}\n<commit_msg>Clang warning suppression.<commit_after>#if !defined __GNUC__\n#pragma warning( disable: 4571 4820 4514 4987 4710 4309 4986 4548)\n\/\/ relative include path contains '..'\n\/\/ (function) selected for automatic inline expansion\n#pragma warning( disable: 4464 4711 )\n#else\n#pragma GCC diagnostic ignored \"-Wunused-variable\"\n#endif\n\n#include <iostream>\n#include \"..\/SafeInt.hpp\"\n\nenum class Foo\n{\n\tFoo1 = 0,\n\tFoo2\n};\n\ntemplate <typename T, typename U>\nvoid CompiledMixedType()\n{\n\t\/\/ Mixed constructors\n\tU u = 0;\n\tSafeInt<T> st(u);\n\tSafeInt<U> su(u);\n\tSafeInt<T> st2(su);\n}\n\ntemplate <typename T>\nvoid CompileType()\n{\n\t\/\/ Test constructors\n\tSafeInt<T> s;\n\tSafeInt<T> i(Foo::Foo1);\n\tT t = 0;\n\tSafeInt<T> st(t);\n\tSafeInt<T> b(false);\n\n\t\/\/ Mixed operations\n\tCompiledMixedType<T, char>();\n\tCompiledMixedType<T, signed char>();\n\tCompiledMixedType<T, unsigned char>();\n\tCompiledMixedType<T, short>();\n\tCompiledMixedType<T, unsigned short>();\n\tCompiledMixedType<T, int>();\n\tCompiledMixedType<T, unsigned int>();\n\tCompiledMixedType<T, long>();\n\tCompiledMixedType<T, unsigned long>();\n\tCompiledMixedType<T, long long>();\n\tCompiledMixedType<T, unsigned long long>();\n}\n\nvoid CompileMe()\n{\n\tCompileType<char>();\n\tCompileType<unsigned char>();\n\tCompileType<signed char>();\n\n\tCompileType<unsigned short>();\n\tCompileType<signed short>();\n\tCompileType<unsigned int>();\n\tCompileType<signed int>();\n\tCompileType<unsigned long>();\n\tCompileType<signed long>();\n\tCompileType<unsigned long long>();\n\tCompileType<signed long long>();\n}\n\nint main(int, char**)\n{\n  std::cout << \"It compiles!\\n\";\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <math.h>\n#include <iostream>\n#include <cassert>\n#include <chrono>\n#include <thread>\n#include \"RhIO.hpp\"\n\nint main()\n{\n    RhIO::Root.newChild(\"test\");\n    RhIO::Root.newChild(\"test2\/pouet\");\n    RhIO::Root.newBool(\"test\/paramBool\");\n    RhIO::Root.newFloat(\"test\/freq\");\n    RhIO::Root.newFloat(\"test\/sin\")\n        ->minimum(-1)\n        ->maximum(1);\n    RhIO::Root.newInt(\"test\/test3\/paramInt\")\n        ->minimum(-1)\n        ->maximum(10);\n    RhIO::Root.child(\"test\").newFloat(\"paramFloat\")\n        ->comment(\"this is a test float\")\n        ->defaultValue(42.0)\n        ->persisted(true);\n    RhIO::Root.child(\"test\/test3\").newStr(\"paramStr\");\n\n    RhIO::Root.newChild(\"server\");\n    RhIO::Root.child(\"server\").newStr(\"hostname\")\n        ->defaultValue(\"testServ\")\n        ->persisted(true)\n        ;\n\n    RhIO::Root.newChild(\"sensors\");\n    RhIO::Root.newChild(\"sensors\/GyroY\");\n    RhIO::Root.newFloat(\"sensors\/GyroYaw\");\n\n    RhIO::Root.newStream(\"test\/stream1\", \"Some stream\");\n\n    RhIO::Root.newCommand(\"test\/command1\",\n        \"command1\",\n        [](const std::vector<std::string>& args) -> std::string\n        {\n            if (args.size()!=1) {\n                return \"Usage: command1 arg\";\n            } else {\n                return \"OK \" + args[0];\n            }\n        });\n\n    std::cout << \"Waiting\" << std::endl;\n\n    float angle = 0.0;\n    RhIO::Bind bind(\"lowlevel\/servos\/ChevilleG\");\n    bind.bindNew(\"angle\", angle);\n\n    auto &out = RhIO::Root.out(\"test\/stream1\");\n\n    float t = 0.0;\n    while (true) {\n        std::this_thread::sleep_for(\n            std::chrono::milliseconds(10));\n        float f = RhIO::Root.getFloat(\"test\/freq\");\n        t += 0.01*f;\n\n        RhIO::Root.setFloat(\"test\/sin\", sin(t*2*M_PI));\n        out << \"Debug, t=\" << t << \", sin(t) = \" << sin(t*2*M_PI) << std::flush;\n\n        angle = sin(t)*1.0;\n        bind.push();\n    }\n\n    return 0;\n}\n<commit_msg>Adding buggy completion example<commit_after>#include <math.h>\n#include <iostream>\n#include <cassert>\n#include <chrono>\n#include <thread>\n#include \"RhIO.hpp\"\n\nint main()\n{\n    RhIO::Root.newChild(\"test\");\n    RhIO::Root.newChild(\"test2\/pouet\");\n    RhIO::Root.newBool(\"test\/paramBool\");\n    RhIO::Root.newFloat(\"test\/freq\");\n    RhIO::Root.newFloat(\"test\/sin\")\n        ->minimum(-1)\n        ->maximum(1);\n    RhIO::Root.newInt(\"test\/test3\/paramInt\")\n        ->minimum(-1)\n        ->maximum(10);\n    RhIO::Root.child(\"test\").newFloat(\"paramFloat\")\n        ->comment(\"this is a test float\")\n        ->defaultValue(42.0)\n        ->persisted(true);\n    RhIO::Root.child(\"test\/test3\").newStr(\"paramStr\");\n\n    RhIO::Root.newChild(\"server\");\n    RhIO::Root.child(\"server\").newStr(\"hostname\")\n        ->defaultValue(\"testServ\")\n        ->persisted(true)\n        ;\n\n    RhIO::Root.newChild(\"foo\");\n    RhIO::Root.newChild(\"foo\/bar\");\n    RhIO::Root.newFloat(\"foo\/bar\/x\");\n    RhIO::Root.newChild(\"foo\/barz\");\n    RhIO::Root.newFloat(\"foo\/barz\/x\");\n\n    RhIO::Root.newStream(\"test\/stream1\", \"Some stream\");\n\n    RhIO::Root.newCommand(\"test\/command1\",\n        \"command1\",\n        [](const std::vector<std::string>& args) -> std::string\n        {\n            if (args.size()!=1) {\n                return \"Usage: command1 arg\";\n            } else {\n                return \"OK \" + args[0];\n            }\n        });\n\n    std::cout << \"Waiting\" << std::endl;\n\n    float angle = 0.0;\n    RhIO::Bind bind(\"lowlevel\/servos\/ChevilleG\");\n    bind.bindNew(\"angle\", angle);\n\n    auto &out = RhIO::Root.out(\"test\/stream1\");\n\n    float t = 0.0;\n    while (true) {\n        std::this_thread::sleep_for(\n            std::chrono::milliseconds(10));\n        float f = RhIO::Root.getFloat(\"test\/freq\");\n        t += 0.01*f;\n\n        RhIO::Root.setFloat(\"test\/sin\", sin(t*2*M_PI));\n        out << \"Debug, t=\" << t << \", sin(t) = \" << sin(t*2*M_PI) << std::flush;\n\n        angle = sin(t)*1.0;\n        bind.push();\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"EasyCL.h\"\n#include \"util\/stringhelper.h\"\n#include \"util\/StatefulTimer.h\"\n#include \"templates\/TemplatedKernel.h\"\n\n#include <sstream>\n#include <iostream>\n#include <string>\n\n#include <clBLAS.h>\n\n#include \"BackwardIm2Col.h\"\n\nusing namespace std;\n\n#undef STATIC\n#define STATIC \n\n#undef VIRTUAL\n#define VIRTUAL \n\n#define PUBLIC\n\nPUBLIC BackwardIm2Col::BackwardIm2Col(EasyCL *cl, LayerDimensions dim) :\n            Backward(cl, dim)\n        {\n\/\/    addBias = new AddBias(cl);\n\n    int size = dim.inputSize;\n    int padding = dim.padZeros ? dim.halfFilterSize : 0;\n    int stride = 1;\n    int channels = dim.inputPlanes;\n    int size_col = (size + 2 * padding - dim.filterSize) \/ stride + 1;\n\n    this->numKernels = channels * dim.inputSizeSquared;\n\n    TemplatedKernel builder(cl);\n    builder.set(\"padding\", dim.padZeros ? dim.halfFilterSize : 0);\n    builder.set(\"stride\", 1);\n    builder.set(\"colSize\", size_col);\n    builder.set(\"channels\", dim.inputPlanes);\n    builder.set(\"filterSize\", dim.filterSize);\n    builder.set(\"size\", dim.inputSize);\n    this->kernelCol2Im = builder.buildKernel(\n        \"col2im\",\n        \"ForwardIm2Col.cl\",\n        getKernelTemplate(),\n        \"col2im\",\n        false);\n}\nPUBLIC VIRTUAL BackwardIm2Col::~BackwardIm2Col() {\n    delete kernelCol2Im;\n\/\/    delete addBias;\n}\nPUBLIC VIRTUAL void BackwardIm2Col::backward( int batchSize, \n        CLWrapper *inputDataWrapper, CLWrapper *gradOutputWrapper, CLWrapper *weightsWrapper,\n        CLWrapper *gradInputWrapper ) {\n    StatefulTimer::timeCheck(\"BackwardIm2Col::backward START\");\n\n    int gradColumnsSize = dim.inputPlanes * dim.filterSizeSquared * dim.outputSizeSquared;\n    float *gradColumns = new float[gradColumnsSize];\n    CLWrapper *gradColumnsWrapper = cl->wrap(gradColumnsSize, gradColumns);\n    gradColumnsWrapper->createOnDevice();\n\/\/    cout << \"gradColumnsSize: \" << gradColumnsSize << endl;\n\/\/    cout << \"weightsize: \" << weightsWrapper->size() << endl;\n\n    StatefulTimer::timeCheck(\"BackwardIm2Col::backward after alloc\");\n\n    if(!gradInputWrapper->isOnDevice()) {\n        gradInputWrapper->createOnDevice();\n    }\n    for (int b = 0; b < batchSize; b ++) {\n\/\/        cout << \"b=\" << b << \" numkernels=\" << numKernels << endl;\n        \/\/ Extract columns:\n\n        \/\/ M,N,K are dims of matrix A and B\n        \/\/ (see http:\/\/docs.nvidia.com\/cuda\/clblas\/#clblas-lt-t-gt-gemm)\n\n\/\/    long m = weight->size[1];  = inputPlanes * filterSizeSquared\n\/\/    long n = gradColumns->size[1]; = outputSizeSquared\n\/\/    long k = weight->size[0]; = numFilters\n\n\n        long m = dim.outputSizeSquared;\n        long n = dim.inputPlanes * dim.filterSizeSquared;\n        long k = dim.numFilters;\n\/\/        cout << \"m=\" << m << \" k=\" << k << \" n=\" << n << endl;\n\n        clblasOrder order = clblasColumnMajor;\n        clblasTranspose aTrans = clblasNoTrans;\n        clblasTranspose bTrans = clblasTrans;\n        size_t lda = ((order == clblasRowMajor) != (aTrans == clblasTrans)) ? k : m;\n        size_t ldb = ((order == clblasRowMajor) != (bTrans == clblasTrans)) ? n : k;\n        size_t ldc = order == clblasRowMajor ? n : m;\n        cl_int err = clblasSgemm(\n            order,\n            aTrans, bTrans,\n            m, n, k,\n            1,\n            gradOutputWrapper->getBuffer(), b * dim.outputCubeSize, lda,\n            weightsWrapper->getBuffer(), 0, ldb,\n            0,\n            gradColumnsWrapper->getBuffer(), 0, ldc,\n            1, cl->queue, 0, NULL, 0\n       );\n       if (err != CL_SUCCESS) {\n           throw runtime_error(\"clblasSgemm() failed with \" + toString(err));\n       }\n\n\/\/    long m = weight->size[1];\n\/\/    long n = gradColumns->size[1];\n\/\/    long k = weight->size[0];\n\n\/\/    \/\/ Do GEMM (note: this is a bit confusing because gemm assumes column-major matrices)\n\/\/    THClBlas_gemm(\n\/\/        state,\n\/\/        'n', 't',\n\/\/        n, m, k,\n\/\/        1,\n\/\/        gradOutput_n, n,\n\/\/        weight, m,\n\/\/        0,\n\/\/        gradColumns, n\n\/\/    );\n\n\/\/       cl->finish();\n\/\/       gradOutputWrapper->copyToHost();\n\/\/       for( int i = 0; i < gradOutputWrapper->size(); i++ ) {\n\/\/           cout << \"gradOutput[\" << i << \"]=\" << reinterpret_cast<float *>(gradOutputWrapper->getHostArray())[i] << endl;\n\/\/       }\n\/\/       weightsWrapper->copyToHost();\n\/\/       for( int i = 0; i < weightsWrapper->size(); i++ ) {\n\/\/           cout << \"weights[\" << i << \"]=\" << reinterpret_cast<float *>(weightsWrapper->getHostArray())[i] << endl;\n\/\/       }\n\/\/       gradColumnsWrapper->copyToHost();\n\/\/       for( int i = 0; i < gradColumnsSize; i++ ) {\n\/\/           cout << \"gradColumns[\" << i << \"]=\" << reinterpret_cast<float *>(gradColumnsWrapper->getHostArray())[i] << endl;\n\/\/       }\n\n\/\/    THClBlas_gemm(\n\/\/        'n', 't',\n\/\/        n, m, k,\n\/\/        1,\n\/\/        gradOutput_n, n,\n\/\/        weight, m,\n\/\/        0,\n\/\/        gradColumns, n\n\/\/    );\n        kernelCol2Im->in(numKernels);\n        kernelCol2Im->in(gradColumnsWrapper);\n        kernelCol2Im->out(gradInputWrapper);\n        kernelCol2Im->in(b * dim.inputCubeSize);\n\n        int workgroupSize = cl->getMaxWorkgroupSize();\n        int numWorkgroups = this->numKernels;\n\n\/\/        cout << \"numworkgroups=\" << numWorkgroups << \" workgorupSize=\" << workgroupSize << endl;\n        kernelCol2Im->run_1d(numWorkgroups * workgroupSize, workgroupSize);\n\n\n\/\/        cl->finish();\n\/\/        gradInputWrapper->copyToHost();\n\/\/        cl->finish();\n\/\/        for( int i = 0; i < gradInputWrapper->size(); i++ ) {\n\/\/            cout << \"gradInput[\" << i << \"]=\" << reinterpret_cast<float *>(gradInputWrapper->getHostArray())[i] << endl;\n\/\/        }\n    }\n\n    delete gradColumnsWrapper;\n    delete gradColumns;\n\n    StatefulTimer::timeCheck(\"BackwardIm2Col::backward after call backward\");\n\n    StatefulTimer::timeCheck(\"BackwardIm2Col::backward END\");\n}\nSTATIC std::string BackwardIm2Col::getKernelTemplate() {\n    \/\/ [[[cog\n    \/\/ import stringify\n    \/\/ stringify.write_kernel(\"kernel\", \"cl\/ForwardIm2Col.cl\")\n    \/\/ ]]]\n    \/\/ generated using cog, from cl\/ForwardIm2Col.cl:\n    const char * kernelSource =  \n    \"\/\/ from SpatialConvolutionMM.cu:\\n\" \n    \"\\n\" \n    \"\/\/ CL: grid stride looping\\n\" \n    \"#define CL_KERNEL_LOOP(i, n)                        \\\\\\n\" \n    \"  for (int i = get_group_id(0) * get_local_size(0) + get_local_id(0); \\\\\\n\" \n    \"      i < (n);                                       \\\\\\n\" \n    \"      i += get_local_size(0) * get_num_groups(0))\\n\" \n    \"\\n\" \n    \"\/\/#define gPadding {{padding}}\\n\" \n    \"\/\/#define gStride {{stride}}\\n\" \n    \"\/\/#define gColSize {{colSize}}\\n\" \n    \"\/\/#define gFilterSize {{filterSize}}\\n\" \n    \"\/\/#define gSize {{size}}\\n\" \n    \"\\n\" \n    \"\/\/ Kernel for fast unfold+copy\\n\" \n    \"\/\/ (adapted from Caffe: https:\/\/github.com\/BVLC\/caffe\/blob\/master\/src\/caffe\/layers\/conv_layer.cu)\\n\" \n    \"kernel void im2col(\\n\" \n    \"    const int n,\\n\" \n    \"    global float const * im_data, int im_offset,\\n\" \n    \"    global float* data_col) {\\n\" \n    \"  global const float *data_im = im_data + im_offset;\\n\" \n    \"\\n\" \n    \"  CL_KERNEL_LOOP(index, n) {\\n\" \n    \"    int w_out = index % {{colSize}};\\n\" \n    \"    index \/= {{colSize}};\\n\" \n    \"    int h_out = index % {{colSize}};\\n\" \n    \"    int channel_in = index \/ {{colSize}};\\n\" \n    \"    int channel_out = channel_in * {{filterSize}} * {{filterSize}};\\n\" \n    \"    int h_in = h_out * {{stride}} - {{padding}};\\n\" \n    \"    int w_in = w_out * {{stride}} - {{padding}};\\n\" \n    \"    data_col += (channel_out * {{colSize}} + h_out) * {{colSize}} + w_out;\\n\" \n    \"    data_im += (channel_in * {{size}} + h_in) * {{size}} + w_in;\\n\" \n    \"    for (int i = 0; i < {{filterSize}}; ++i) {\\n\" \n    \"      for (int j = 0; j < {{filterSize}}; ++j) {\\n\" \n    \"        int h = h_in + i;\\n\" \n    \"        int w = w_in + j;\\n\" \n    \"        *data_col = (h >= 0 && w >= 0 && h < {{size}} && w < {{size}}) ?\\n\" \n    \"          data_im[i * {{size}} + j] : 0;\\n\" \n    \"        data_col += {{colSize}} * {{colSize}};\\n\" \n    \"      }\\n\" \n    \"    }\\n\" \n    \"  }\\n\" \n    \"}\\n\" \n    \"\\n\" \n    \"kernel void col2im(\\n\" \n    \"    const int n,\\n\" \n    \"    global float const *data_col,\\n\" \n    \"    global float* im_data, int im_offset) {\\n\" \n    \"  global float *data_im = im_data + im_offset;\\n\" \n    \"\\n\" \n    \"  for (int index = get_group_id(0) * get_local_size(0) + get_local_id(0); index < (n); index += get_local_size(0) * get_num_groups(0)) {\\n\" \n    \"    float val = 0;\\n\" \n    \"    int w = index % {{size}} + {{padding}};\\n\" \n    \"    int h = (index \/ {{size}}) % {{size}} + {{padding}};\\n\" \n    \"    int c = index \/ ({{size}} * {{size}});\\n\" \n    \"    \/\/ compute the start and end of the output\\n\" \n    \"    int w_col_start = (w < {{filterSize}}) ? 0 : (w - {{filterSize}}) \/ {{stride}} + 1;\\n\" \n    \"    int w_col_end = min(w \/ {{stride}} + 1, {{colSize}});\\n\" \n    \"    int h_col_start = (h < {{filterSize}}) ? 0 : (h - {{filterSize}}) \/ {{stride}} + 1;\\n\" \n    \"    int h_col_end = min(h \/ {{stride}} + 1, {{colSize}});\\n\" \n    \"\\n\" \n    \"    int offset = (c * {{filterSize}} * {{filterSize}} + h * {{filterSize}} + w) * {{colSize}} * {{colSize}};\\n\" \n    \"    int coeff_h_col = (1 - {{stride}} * {{filterSize}} * {{colSize}}) * {{colSize}};\\n\" \n    \"    int coeff_w_col = (1 - {{stride}} * {{colSize}} * {{colSize}});\\n\" \n    \"    for (int h_col = h_col_start; h_col < h_col_end; ++h_col) {\\n\" \n    \"      for (int w_col = w_col_start; w_col < w_col_end; ++w_col) {\\n\" \n    \"        val += data_col[offset + h_col * coeff_h_col + w_col * coeff_w_col];\\n\" \n    \"      }\\n\" \n    \"    }\\n\" \n    \"    data_im[index] = val;\\n\" \n    \"  }\\n\" \n    \"}\\n\" \n    \"\\n\" \n    \"\";\n    \/\/ [[[end]]]\n    return kernelSource;\n}\n\n<commit_msg>initialize clblas at start of backwardim2col<commit_after>#include \"EasyCL.h\"\n#include \"util\/stringhelper.h\"\n#include \"util\/StatefulTimer.h\"\n#include \"templates\/TemplatedKernel.h\"\n\n#include <sstream>\n#include <iostream>\n#include <string>\n\n#include <clBLAS.h>\n\n#include \"clblas\/ClBlasInstance.h\"\n#include \"BackwardIm2Col.h\"\n\nusing namespace std;\n\n#undef STATIC\n#define STATIC \n\n#undef VIRTUAL\n#define VIRTUAL \n\n#define PUBLIC\n\nPUBLIC BackwardIm2Col::BackwardIm2Col(EasyCL *cl, LayerDimensions dim) :\n            Backward(cl, dim)\n        {\n    ClBlasInstance::initializeIfNecessary();\n\n\/\/    addBias = new AddBias(cl);\n\n    int size = dim.inputSize;\n    int padding = dim.padZeros ? dim.halfFilterSize : 0;\n    int stride = 1;\n    int channels = dim.inputPlanes;\n    int size_col = (size + 2 * padding - dim.filterSize) \/ stride + 1;\n\n    this->numKernels = channels * dim.inputSizeSquared;\n\n    TemplatedKernel builder(cl);\n    builder.set(\"padding\", dim.padZeros ? dim.halfFilterSize : 0);\n    builder.set(\"stride\", 1);\n    builder.set(\"colSize\", size_col);\n    builder.set(\"channels\", dim.inputPlanes);\n    builder.set(\"filterSize\", dim.filterSize);\n    builder.set(\"size\", dim.inputSize);\n    this->kernelCol2Im = builder.buildKernel(\n        \"col2im\",\n        \"ForwardIm2Col.cl\",\n        getKernelTemplate(),\n        \"col2im\",\n        false);\n}\nPUBLIC VIRTUAL BackwardIm2Col::~BackwardIm2Col() {\n    delete kernelCol2Im;\n\/\/    delete addBias;\n}\nPUBLIC VIRTUAL void BackwardIm2Col::backward( int batchSize, \n        CLWrapper *inputDataWrapper, CLWrapper *gradOutputWrapper, CLWrapper *weightsWrapper,\n        CLWrapper *gradInputWrapper ) {\n    StatefulTimer::timeCheck(\"BackwardIm2Col::backward START\");\n\n    int gradColumnsSize = dim.inputPlanes * dim.filterSizeSquared * dim.outputSizeSquared;\n    float *gradColumns = new float[gradColumnsSize];\n    CLWrapper *gradColumnsWrapper = cl->wrap(gradColumnsSize, gradColumns);\n    gradColumnsWrapper->createOnDevice();\n\/\/    cout << \"gradColumnsSize: \" << gradColumnsSize << endl;\n\/\/    cout << \"weightsize: \" << weightsWrapper->size() << endl;\n\n    StatefulTimer::timeCheck(\"BackwardIm2Col::backward after alloc\");\n\n    if(!gradInputWrapper->isOnDevice()) {\n        gradInputWrapper->createOnDevice();\n    }\n    for (int b = 0; b < batchSize; b ++) {\n\/\/        cout << \"b=\" << b << \" numkernels=\" << numKernels << endl;\n        \/\/ Extract columns:\n\n        \/\/ M,N,K are dims of matrix A and B\n        \/\/ (see http:\/\/docs.nvidia.com\/cuda\/clblas\/#clblas-lt-t-gt-gemm)\n\n\/\/    long m = weight->size[1];  = inputPlanes * filterSizeSquared\n\/\/    long n = gradColumns->size[1]; = outputSizeSquared\n\/\/    long k = weight->size[0]; = numFilters\n\n\n        long m = dim.outputSizeSquared;\n        long n = dim.inputPlanes * dim.filterSizeSquared;\n        long k = dim.numFilters;\n\/\/        cout << \"m=\" << m << \" k=\" << k << \" n=\" << n << endl;\n\n        clblasOrder order = clblasColumnMajor;\n        clblasTranspose aTrans = clblasNoTrans;\n        clblasTranspose bTrans = clblasTrans;\n        size_t lda = ((order == clblasRowMajor) != (aTrans == clblasTrans)) ? k : m;\n        size_t ldb = ((order == clblasRowMajor) != (bTrans == clblasTrans)) ? n : k;\n        size_t ldc = order == clblasRowMajor ? n : m;\n        cl_int err = clblasSgemm(\n            order,\n            aTrans, bTrans,\n            m, n, k,\n            1,\n            gradOutputWrapper->getBuffer(), b * dim.outputCubeSize, lda,\n            weightsWrapper->getBuffer(), 0, ldb,\n            0,\n            gradColumnsWrapper->getBuffer(), 0, ldc,\n            1, cl->queue, 0, NULL, 0\n       );\n       if (err != CL_SUCCESS) {\n           throw runtime_error(\"clblasSgemm() failed with \" + toString(err));\n       }\n\n\/\/    long m = weight->size[1];\n\/\/    long n = gradColumns->size[1];\n\/\/    long k = weight->size[0];\n\n\/\/    \/\/ Do GEMM (note: this is a bit confusing because gemm assumes column-major matrices)\n\/\/    THClBlas_gemm(\n\/\/        state,\n\/\/        'n', 't',\n\/\/        n, m, k,\n\/\/        1,\n\/\/        gradOutput_n, n,\n\/\/        weight, m,\n\/\/        0,\n\/\/        gradColumns, n\n\/\/    );\n\n\/\/       cl->finish();\n\/\/       gradOutputWrapper->copyToHost();\n\/\/       for( int i = 0; i < gradOutputWrapper->size(); i++ ) {\n\/\/           cout << \"gradOutput[\" << i << \"]=\" << reinterpret_cast<float *>(gradOutputWrapper->getHostArray())[i] << endl;\n\/\/       }\n\/\/       weightsWrapper->copyToHost();\n\/\/       for( int i = 0; i < weightsWrapper->size(); i++ ) {\n\/\/           cout << \"weights[\" << i << \"]=\" << reinterpret_cast<float *>(weightsWrapper->getHostArray())[i] << endl;\n\/\/       }\n\/\/       gradColumnsWrapper->copyToHost();\n\/\/       for( int i = 0; i < gradColumnsSize; i++ ) {\n\/\/           cout << \"gradColumns[\" << i << \"]=\" << reinterpret_cast<float *>(gradColumnsWrapper->getHostArray())[i] << endl;\n\/\/       }\n\n\/\/    THClBlas_gemm(\n\/\/        'n', 't',\n\/\/        n, m, k,\n\/\/        1,\n\/\/        gradOutput_n, n,\n\/\/        weight, m,\n\/\/        0,\n\/\/        gradColumns, n\n\/\/    );\n        kernelCol2Im->in(numKernels);\n        kernelCol2Im->in(gradColumnsWrapper);\n        kernelCol2Im->out(gradInputWrapper);\n        kernelCol2Im->in(b * dim.inputCubeSize);\n\n        int workgroupSize = cl->getMaxWorkgroupSize();\n        int numWorkgroups = this->numKernels;\n\n\/\/        cout << \"numworkgroups=\" << numWorkgroups << \" workgorupSize=\" << workgroupSize << endl;\n        kernelCol2Im->run_1d(numWorkgroups * workgroupSize, workgroupSize);\n\n\n\/\/        cl->finish();\n\/\/        gradInputWrapper->copyToHost();\n\/\/        cl->finish();\n\/\/        for( int i = 0; i < gradInputWrapper->size(); i++ ) {\n\/\/            cout << \"gradInput[\" << i << \"]=\" << reinterpret_cast<float *>(gradInputWrapper->getHostArray())[i] << endl;\n\/\/        }\n    }\n\n    delete gradColumnsWrapper;\n    delete gradColumns;\n\n    StatefulTimer::timeCheck(\"BackwardIm2Col::backward after call backward\");\n\n    StatefulTimer::timeCheck(\"BackwardIm2Col::backward END\");\n}\nSTATIC std::string BackwardIm2Col::getKernelTemplate() {\n    \/\/ [[[cog\n    \/\/ import stringify\n    \/\/ stringify.write_kernel(\"kernel\", \"cl\/ForwardIm2Col.cl\")\n    \/\/ ]]]\n    \/\/ generated using cog, from cl\/ForwardIm2Col.cl:\n    const char * kernelSource =  \n    \"\/\/ from SpatialConvolutionMM.cu:\\n\" \n    \"\\n\" \n    \"\/\/ CL: grid stride looping\\n\" \n    \"#define CL_KERNEL_LOOP(i, n)                        \\\\\\n\" \n    \"  for (int i = get_group_id(0) * get_local_size(0) + get_local_id(0); \\\\\\n\" \n    \"      i < (n);                                       \\\\\\n\" \n    \"      i += get_local_size(0) * get_num_groups(0))\\n\" \n    \"\\n\" \n    \"\/\/#define gPadding {{padding}}\\n\" \n    \"\/\/#define gStride {{stride}}\\n\" \n    \"\/\/#define gColSize {{colSize}}\\n\" \n    \"\/\/#define gFilterSize {{filterSize}}\\n\" \n    \"\/\/#define gSize {{size}}\\n\" \n    \"\\n\" \n    \"\/\/ Kernel for fast unfold+copy\\n\" \n    \"\/\/ (adapted from Caffe: https:\/\/github.com\/BVLC\/caffe\/blob\/master\/src\/caffe\/layers\/conv_layer.cu)\\n\" \n    \"kernel void im2col(\\n\" \n    \"    const int n,\\n\" \n    \"    global float const * im_data, int im_offset,\\n\" \n    \"    global float* data_col) {\\n\" \n    \"  global const float *data_im = im_data + im_offset;\\n\" \n    \"\\n\" \n    \"  CL_KERNEL_LOOP(index, n) {\\n\" \n    \"    int w_out = index % {{colSize}};\\n\" \n    \"    index \/= {{colSize}};\\n\" \n    \"    int h_out = index % {{colSize}};\\n\" \n    \"    int channel_in = index \/ {{colSize}};\\n\" \n    \"    int channel_out = channel_in * {{filterSize}} * {{filterSize}};\\n\" \n    \"    int h_in = h_out * {{stride}} - {{padding}};\\n\" \n    \"    int w_in = w_out * {{stride}} - {{padding}};\\n\" \n    \"    data_col += (channel_out * {{colSize}} + h_out) * {{colSize}} + w_out;\\n\" \n    \"    data_im += (channel_in * {{size}} + h_in) * {{size}} + w_in;\\n\" \n    \"    for (int i = 0; i < {{filterSize}}; ++i) {\\n\" \n    \"      for (int j = 0; j < {{filterSize}}; ++j) {\\n\" \n    \"        int h = h_in + i;\\n\" \n    \"        int w = w_in + j;\\n\" \n    \"        *data_col = (h >= 0 && w >= 0 && h < {{size}} && w < {{size}}) ?\\n\" \n    \"          data_im[i * {{size}} + j] : 0;\\n\" \n    \"        data_col += {{colSize}} * {{colSize}};\\n\" \n    \"      }\\n\" \n    \"    }\\n\" \n    \"  }\\n\" \n    \"}\\n\" \n    \"\\n\" \n    \"kernel void col2im(\\n\" \n    \"    const int n,\\n\" \n    \"    global float const *data_col,\\n\" \n    \"    global float* im_data, int im_offset) {\\n\" \n    \"  global float *data_im = im_data + im_offset;\\n\" \n    \"\\n\" \n    \"  for (int index = get_group_id(0) * get_local_size(0) + get_local_id(0); index < (n); index += get_local_size(0) * get_num_groups(0)) {\\n\" \n    \"    float val = 0;\\n\" \n    \"    int w = index % {{size}} + {{padding}};\\n\" \n    \"    int h = (index \/ {{size}}) % {{size}} + {{padding}};\\n\" \n    \"    int c = index \/ ({{size}} * {{size}});\\n\" \n    \"    \/\/ compute the start and end of the output\\n\" \n    \"    int w_col_start = (w < {{filterSize}}) ? 0 : (w - {{filterSize}}) \/ {{stride}} + 1;\\n\" \n    \"    int w_col_end = min(w \/ {{stride}} + 1, {{colSize}});\\n\" \n    \"    int h_col_start = (h < {{filterSize}}) ? 0 : (h - {{filterSize}}) \/ {{stride}} + 1;\\n\" \n    \"    int h_col_end = min(h \/ {{stride}} + 1, {{colSize}});\\n\" \n    \"\\n\" \n    \"    int offset = (c * {{filterSize}} * {{filterSize}} + h * {{filterSize}} + w) * {{colSize}} * {{colSize}};\\n\" \n    \"    int coeff_h_col = (1 - {{stride}} * {{filterSize}} * {{colSize}}) * {{colSize}};\\n\" \n    \"    int coeff_w_col = (1 - {{stride}} * {{colSize}} * {{colSize}});\\n\" \n    \"    for (int h_col = h_col_start; h_col < h_col_end; ++h_col) {\\n\" \n    \"      for (int w_col = w_col_start; w_col < w_col_end; ++w_col) {\\n\" \n    \"        val += data_col[offset + h_col * coeff_h_col + w_col * coeff_w_col];\\n\" \n    \"      }\\n\" \n    \"    }\\n\" \n    \"    data_im[index] = val;\\n\" \n    \"  }\\n\" \n    \"}\\n\" \n    \"\\n\" \n    \"\";\n    \/\/ [[[end]]]\n    return kernelSource;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"core\/HierarchicalEA.hpp\"\n#include \"exception\/NodeAlreadyExistsException.hpp\"\n#include \"exception\/InvalidNodeException.hpp\"\n#include \"exception\/NoNodesException.hpp\"\n#include \"exception\/NoEvolutionOrderException.hpp\"\n\n#include <iostream>\n#include <algorithm>\n\nHierarchicalEA::HierarchicalEA(int maxEpochs) {\n\tthis->maxEpochs = maxEpochs;\n}\n\nHierarchicalEA::~HierarchicalEA() {}\n\nvoid HierarchicalEA::addNode(PopulationNode * node, string name, bool print) {\n\tfor (int i = 0; i < nodeNames.size(); i++) {\n\t\tif (nodeNames[i] == name or nodes[i] == node) {\n\t\t\tthrow NodeAlreadyExistsException();\n\t\t}\n\t}\n\tnodes.push_back(node);\n\tnodeNames.push_back(name);\n\tif (print) nodesToPrint.push_back(name);\n}\n\nvoid HierarchicalEA::removeNode(string name) {\n\tfor (int i = 0; i < nodeNames.size(); i++) {\n\t\tstring nodeName = nodeNames[i];\n\t\tif (nodeName == name) {\n\t\t\tnodeNames.erase(nodeNames.begin()+i);\n\t\t\tnodes.erase(nodes.begin()+i);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor (int i = 0; i < nodesToPrint.size(); i++) {\n\t\tif ((nodesToPrint[i]) == name) {\n\t\t\tnodesToPrint.erase(nodesToPrint.begin()+i);\n\t\t}\n\t}\n}\n\nvoid HierarchicalEA::checkNodesExist(vector<string> names) {\n\tfor (int i = 0; i < names.size(); i++) {\n\t\tbool exists = false;\n\n\t\tfor (int k = 0; k < nodeNames.size(); k++) {\n\t\t\tif (nodeNames[k] == names[i]) exists = true;\n\t\t}\n\n\t\tif (!exists) throw InvalidNodeException();\n\t}\n}\n\nvoid HierarchicalEA::setNodesToPrint(vector<string> names) {\n\tcheckNodesExist(names);\n\tnodesToPrint.clear();\n\tnodesToPrint = names;\n}\n\nvoid HierarchicalEA::setEvolutionOrder(vector<string> names) {\n\tcheckNodesExist(names);\n\tevolutionOrder.clear();\n\tevolutionOrder = names;\n}\n\nvoid HierarchicalEA::buildNodeSet(\n\tvector<string> targetNames,\n\tvector<PopulationNode *> * targetSet\n) {\n\tif (nodes.empty()) throw NoNodesException();\n\tcheckNodesExist(targetNames);\n\n\tfor (int i = 0; i < targetNames.size(); i++) {\n\t\tstring name = targetNames[i];\n\t\tfor (int k = 0; k < nodeNames.size(); k++) {\n\t\t\tstring realName = nodeNames[k];\n\t\t\tif (name == realName) {\n\t\t\t\ttargetSet->push_back(nodes[k]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid HierarchicalEA::buildEvolutionNodes() {\n\tif (evolutionOrder.empty()) throw NoEvolutionOrderException();\n\tevolutionNodes.clear();\n\tbuildNodeSet(evolutionOrder, &evolutionNodes);\n}\n\nvoid HierarchicalEA::buildPrintNodes() {\n\tprintNodes.clear();\n\tbuildNodeSet(nodesToPrint, &printNodes);\n}\n\nbool HierarchicalEA::done(int currentEpoch) {\n\tbool done = true;\n\tif (currentEpoch >= maxEpochs - 1) {\n\t\tcout << \"Hierarchical EA ended because maximum epoch count was reached.\\n\";\n\t\treturn done;\n\t}\n\n\tfor (int i = 0; i < evolutionNodes.size(); i++) {\n\t\tif (!evolutionNodes[i]->done()) {\n\t\t\tdone = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (done) cout << \"Hierarchical EA ended because all population nodes reported reaching their specified ending conditions.\\n\";\n\n\treturn done;\n}\n\nvoid HierarchicalEA::run(bool verbose) {\n\tbuildEvolutionNodes();\n\tbuildPrintNodes();\n\tcout << \"Before:\\n\";\n\tcout << string(80, '=') << \"\\n\";\n\tfor (int i = 0; i < printNodes.size(); i++) {\n\t\tcout << \"Node \" << nodesToPrint[i] << \":\\n\";\n\t\tcout << printNodes[i]->toString();\n\t\tcout << string(80, '-') << \"\\n\";\n\t}\n\n\tfor (int i = 0; i < maxEpochs; i++) {\n\t\tfor (int k = 0; k < evolutionNodes.size(); k++) {\n\t\t\tif (!evolutionNodes[k]->done()) {\n\t\t\t\tevolutionNodes[k]->runGenerations();\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Because humans count from 1, we add 1 to our epoch counter\n\t\tcout << \"After epoch \" << i+1 << \":\\n\";\n\t\tcout << string(80, '=') << \"\\n\";\n\t\tfor (int k = 0; k < printNodes.size(); k++) {\n\t\t\tcout << \"Node \" << nodesToPrint[k] << \":\\n\";\n\t\t\tcout << printNodes[k]->toString();\n\t\t\tcout << string(80, '-') << \"\\n\";\n\t\t}\n\n\t\tif (done(i)) break;\n\t}\n}\n<commit_msg>[HierarchicalEA]: Added TODO<commit_after>#include \"core\/HierarchicalEA.hpp\"\n#include \"exception\/NodeAlreadyExistsException.hpp\"\n#include \"exception\/InvalidNodeException.hpp\"\n#include \"exception\/NoNodesException.hpp\"\n#include \"exception\/NoEvolutionOrderException.hpp\"\n\n#include <iostream>\n#include <algorithm>\n\nHierarchicalEA::HierarchicalEA(int maxEpochs) {\n\tthis->maxEpochs = maxEpochs;\n}\n\nHierarchicalEA::~HierarchicalEA() {}\n\nvoid HierarchicalEA::addNode(PopulationNode * node, string name, bool print) {\n\tfor (int i = 0; i < nodeNames.size(); i++) {\n\t\tif (nodeNames[i] == name or nodes[i] == node) {\n\t\t\tthrow NodeAlreadyExistsException();\n\t\t}\n\t}\n\tnodes.push_back(node);\n\tnodeNames.push_back(name);\n\tif (print) nodesToPrint.push_back(name);\n}\n\nvoid HierarchicalEA::removeNode(string name) {\n\tfor (int i = 0; i < nodeNames.size(); i++) {\n\t\tstring nodeName = nodeNames[i];\n\t\tif (nodeName == name) {\n\t\t\tnodeNames.erase(nodeNames.begin()+i);\n\t\t\tnodes.erase(nodes.begin()+i);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor (int i = 0; i < nodesToPrint.size(); i++) {\n\t\tif ((nodesToPrint[i]) == name) {\n\t\t\tnodesToPrint.erase(nodesToPrint.begin()+i);\n\t\t}\n\t}\n}\n\nvoid HierarchicalEA::checkNodesExist(vector<string> names) {\n\tfor (int i = 0; i < names.size(); i++) {\n\t\tbool exists = false;\n\n\t\tfor (int k = 0; k < nodeNames.size(); k++) {\n\t\t\tif (nodeNames[k] == names[i]) exists = true;\n\t\t}\n\n\t\tif (!exists) throw InvalidNodeException();\n\t}\n}\n\nvoid HierarchicalEA::setNodesToPrint(vector<string> names) {\n\tcheckNodesExist(names);\n\tnodesToPrint.clear();\n\tnodesToPrint = names;\n}\n\nvoid HierarchicalEA::setEvolutionOrder(vector<string> names) {\n\tcheckNodesExist(names);\n\tevolutionOrder.clear();\n\tevolutionOrder = names;\n}\n\nvoid HierarchicalEA::buildNodeSet(\n\tvector<string> targetNames,\n\tvector<PopulationNode *> * targetSet\n) {\n\tif (nodes.empty()) throw NoNodesException();\n\tcheckNodesExist(targetNames);\n\n\tfor (int i = 0; i < targetNames.size(); i++) {\n\t\tstring name = targetNames[i];\n\t\tfor (int k = 0; k < nodeNames.size(); k++) {\n\t\t\tstring realName = nodeNames[k];\n\t\t\tif (name == realName) {\n\t\t\t\ttargetSet->push_back(nodes[k]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid HierarchicalEA::buildEvolutionNodes() {\n\tif (evolutionOrder.empty()) throw NoEvolutionOrderException();\n\tevolutionNodes.clear();\n\tbuildNodeSet(evolutionOrder, &evolutionNodes);\n}\n\nvoid HierarchicalEA::buildPrintNodes() {\n\tprintNodes.clear();\n\tbuildNodeSet(nodesToPrint, &printNodes);\n}\n\nbool HierarchicalEA::done(int currentEpoch) {\n\tbool done = true;\n\tif (currentEpoch >= maxEpochs - 1) {\n\t\tcout << \"Hierarchical EA ended because maximum epoch count was reached.\\n\";\n\t\treturn done;\n\t}\n\n\tfor (int i = 0; i < evolutionNodes.size(); i++) {\n\t\tif (!evolutionNodes[i]->done()) {\n\t\t\tdone = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (done) cout << \"Hierarchical EA ended because all population nodes reported reaching their specified ending conditions.\\n\";\n\n\treturn done;\n}\n\n\/\/ TODO: Make verbosity option actually mean something\nvoid HierarchicalEA::run(bool verbose) {\n\tbuildEvolutionNodes();\n\tbuildPrintNodes();\n\tcout << \"Before:\\n\";\n\tcout << string(80, '=') << \"\\n\";\n\tfor (int i = 0; i < printNodes.size(); i++) {\n\t\tcout << \"Node \" << nodesToPrint[i] << \":\\n\";\n\t\tcout << printNodes[i]->toString();\n\t\tcout << string(80, '-') << \"\\n\";\n\t}\n\n\tfor (int i = 0; i < maxEpochs; i++) {\n\t\tfor (int k = 0; k < evolutionNodes.size(); k++) {\n\t\t\tif (!evolutionNodes[k]->done()) {\n\t\t\t\tevolutionNodes[k]->runGenerations();\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Because humans count from 1, we add 1 to our epoch counter\n\t\tcout << \"After epoch \" << i+1 << \":\\n\";\n\t\tcout << string(80, '=') << \"\\n\";\n\t\tfor (int k = 0; k < printNodes.size(); k++) {\n\t\t\tcout << \"Node \" << nodesToPrint[k] << \":\\n\";\n\t\t\tcout << printNodes[k]->toString();\n\t\t\tcout << string(80, '-') << \"\\n\";\n\t\t}\n\n\t\tif (done(i)) break;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <stdexcept>\n#include <memory>\n#include <cmath>\n#include <cassert>\n#include <iostream>\n\n#include \"gamestates\/playstate.hh\"\n#include \"gamestates\/endstate.hh\"\n#include \"settings.hh\"\n#include \"map_reader.hh\"\n#include \"player.hh\"\n#include \"mouse.hh\"\n#include \"map.hh\"\n#include \"text_drawer.hh\"\n#include \"turrets\/basic.hh\"\n#include \"turrets\/sniper.hh\"\n#include \"turrets\/super.hh\"\n#include \"mobs\/foot_soldier.hh\"\n#include \"mobs\/horse_soldier.hh\"\n#include \"mobs\/tank_soldier.hh\"\n#include \"pathfinding.hh\"\n\nPlayState::PlayState(std::string map)\n         : turret_{nullptr}\n{\n    if (!MapReader::set_size(map))\n        throw std::logic_error(\"Could not load map '\" + map + \"'.\");\n    Map::init();\n    Map::init_draw(100, 100);\n    Map::init_draw(0, 50);\n    if (!MapReader::read_map(map))\n        throw std::logic_error(\"Error reading map '\" + map + \"'.\");\n    Player::init(500, 10, std::chrono::system_clock::now());\n    this->levels.push_back(Level(\"resources\/levels\/1.td42\"));\n    this->levels.push_back(Level(\"resources\/levels\/2.td42\"));\n    this->levels.push_back(Level(\"resources\/levels\/3.td42\"));\n    this->levels.push_back(Level(\"resources\/levels\/4.td42\"));\n    this->levels.push_back(Level(\"resources\/levels\/5.td42\"));\n    ms_before_next_level = 100;\n    ms_before_next_mob = TIME_BETWEEN_MOBS;\n}\n\nvoid PlayState::insert_mode(std::shared_ptr<Turret> t)\n{\n    turret_ = t;\n    t->set_opacity(100);\n}\n\nvoid PlayState::exit_insert_mode()\n{\n    turret_ = nullptr;\n    ms_before_next_level = 100;\n}\n\nvoid PlayState::exit_insert_mode_and_create()\n{\n    if (turret_ != nullptr)\n    {\n        if (!Player::remove_money(turret_->get_cost()))\n        {\n            turret_ = nullptr;\n            return;\n        }\n        auto pos = turret_->get_pos();\n        if (pos.first < 0 || pos.first >= Map::width || pos.second < 0\n                || pos.second >= Map::height\n                || Map::cells[pos.first][pos.second].type != CellType::Empty)\n        {\n            turret_ = nullptr;\n            return;\n        }\n        Map::cells[pos.first][pos.second].type = CellType::Tower;\n        turret_->set_opacity(255);\n        Map::turrets.push_front(turret_);\n        turret_ = nullptr;\n        for (auto& enemy : Map::ennemies)\n            enemy->update_pathfinding();\n    }\n}\n\nvoid PlayState::draw(sf::RenderWindow& w)\n{\n    if (turret_ != nullptr)\n    {\n        auto pos = Mouse::get_mouse_pos(w);\n        unsigned px;\n        unsigned py;\n        Map::screen_to_map(pos.first, pos.second, px, py);\n        turret_->set_pos(px, py);\n    }\n    Map::draw(w, turret_);\n    TextDrawer::display_time(w);\n    TextDrawer::display_lifes(w);\n    TextDrawer::display_money(w);\n    TextDrawer::display_mouse_coords(w);\n    TextDrawer::display_mouse_coords_on_map(w);\n}\n\nvoid PlayState::update(unsigned elapsed_ms)\n{\n    if (this->levels.size() == 0)\n    {\n        GameState::stack.pop_back();\n        auto ptr = std::make_shared<EndState>();\n        GameState::stack.push_back(ptr);\n    }\n    else if (ms_before_next_level <= 0)\n    {\n        if (ms_before_next_mob <= 0)\n        {\n            if (!this->levels.front().make_mob())\n            {\n                std::cout << \"NEW LEVEL\" << std::endl;\n                this->levels.pop_front();\n                ms_before_next_level = TIME_BETWEEN_LEVELS;\n            }\n            else\n                ms_before_next_mob = TIME_BETWEEN_MOBS;\n        }\n        else\n            ms_before_next_mob -= elapsed_ms;\n    }\n    else\n        ms_before_next_level -= elapsed_ms;\n    for (std::list<std::shared_ptr<Mob>>::iterator i = Map::ennemies.begin();\n            i != Map::ennemies.end();)\n    {\n        if ((*i)->dead())\n            i = Map::ennemies.erase(i);\n        else\n        {\n            (*i)->move();\n            auto pos = (*i)->get_pos();\n            float dx = fabs(pos.first - Map::finish_mobs.first);\n            float dy = fabs(pos.second - Map::finish_mobs.second);\n            if (dx < 0.02f && dy < 0.02f)\n            {\n                (*i)->harakiri();\n                if (!Player::remove_a_life())\n                {\n                    std::cout << \"U LOST!\" << std::endl;\n                    GameState::stack.pop_back();\n                    auto ptr = std::make_shared<EndState>();\n                    GameState::stack.push_back(ptr);\n                }\n                i = Map::ennemies.erase(i);\n            }\n            else\n                ++i;\n        }\n    }\n    for (std::shared_ptr<Turret> turret : Map::turrets)\n        turret->attack(elapsed_ms);\n    ++elapsed_ms;\n}\n<commit_msg>Now we can lost<commit_after>#include <stdexcept>\n#include <memory>\n#include <cmath>\n#include <cassert>\n#include <iostream>\n\n#include \"gamestates\/playstate.hh\"\n#include \"gamestates\/endstate.hh\"\n#include \"settings.hh\"\n#include \"map_reader.hh\"\n#include \"player.hh\"\n#include \"mouse.hh\"\n#include \"map.hh\"\n#include \"text_drawer.hh\"\n#include \"turrets\/basic.hh\"\n#include \"turrets\/sniper.hh\"\n#include \"turrets\/super.hh\"\n#include \"mobs\/foot_soldier.hh\"\n#include \"mobs\/horse_soldier.hh\"\n#include \"mobs\/tank_soldier.hh\"\n#include \"pathfinding.hh\"\n\nPlayState::PlayState(std::string map)\n         : turret_{nullptr}\n{\n    if (!MapReader::set_size(map))\n        throw std::logic_error(\"Could not load map '\" + map + \"'.\");\n    Map::init();\n    Map::init_draw(100, 100);\n    Map::init_draw(0, 50);\n    if (!MapReader::read_map(map))\n        throw std::logic_error(\"Error reading map '\" + map + \"'.\");\n    Player::init(500, 10, std::chrono::system_clock::now());\n    this->levels.push_back(Level(\"resources\/levels\/1.td42\"));\n    this->levels.push_back(Level(\"resources\/levels\/2.td42\"));\n    this->levels.push_back(Level(\"resources\/levels\/3.td42\"));\n    this->levels.push_back(Level(\"resources\/levels\/4.td42\"));\n    this->levels.push_back(Level(\"resources\/levels\/5.td42\"));\n    ms_before_next_level = 100;\n    ms_before_next_mob = TIME_BETWEEN_MOBS;\n}\n\nvoid PlayState::insert_mode(std::shared_ptr<Turret> t)\n{\n    turret_ = t;\n    t->set_opacity(100);\n}\n\nvoid PlayState::exit_insert_mode()\n{\n    turret_ = nullptr;\n    ms_before_next_level = 100;\n}\n\nvoid PlayState::exit_insert_mode_and_create()\n{\n    if (turret_ != nullptr)\n    {\n        if (!Player::remove_money(turret_->get_cost()))\n        {\n            turret_ = nullptr;\n            return;\n        }\n        auto pos = turret_->get_pos();\n        if (pos.first < 0 || pos.first >= Map::width || pos.second < 0\n                || pos.second >= Map::height\n                || Map::cells[pos.first][pos.second].type != CellType::Empty)\n        {\n            turret_ = nullptr;\n            return;\n        }\n        Map::cells[pos.first][pos.second].type = CellType::Tower;\n        turret_->set_opacity(255);\n        Map::turrets.push_front(turret_);\n        turret_ = nullptr;\n        for (auto& enemy : Map::ennemies)\n            enemy->update_pathfinding();\n    }\n}\n\nvoid PlayState::draw(sf::RenderWindow& w)\n{\n    if (turret_ != nullptr)\n    {\n        auto pos = Mouse::get_mouse_pos(w);\n        unsigned px;\n        unsigned py;\n        Map::screen_to_map(pos.first, pos.second, px, py);\n        turret_->set_pos(px, py);\n    }\n    Map::draw(w, turret_);\n    TextDrawer::display_time(w);\n    TextDrawer::display_lifes(w);\n    TextDrawer::display_money(w);\n    TextDrawer::display_mouse_coords(w);\n    TextDrawer::display_mouse_coords_on_map(w);\n}\n\nbool is_arrived(float x1, float x2, float y1, float y2)\n{\n    int ix1 = x1;\n    int ix2 = x2;\n    int iy1 = y1;\n    int iy2 = y2;\n    if (ix1 == ix2 && iy1 == iy2)\n        return true;\n    float dx = fabs(x1 - x2);\n    float dy = fabs(y1 - y2);\n    return dx < 0.2f && dy < 0.2f;\n}\n\nvoid PlayState::update(unsigned elapsed_ms)\n{\n    if (this->levels.size() == 0)\n    {\n        GameState::stack.pop_back();\n        auto ptr = std::make_shared<EndState>();\n        GameState::stack.push_back(ptr);\n    }\n    else if (ms_before_next_level <= 0)\n    {\n        if (ms_before_next_mob <= 0)\n        {\n            if (!this->levels.front().make_mob())\n            {\n                std::cout << \"NEW LEVEL\" << std::endl;\n                this->levels.pop_front();\n                ms_before_next_level = TIME_BETWEEN_LEVELS;\n            }\n            else\n                ms_before_next_mob = TIME_BETWEEN_MOBS;\n        }\n        else\n            ms_before_next_mob -= elapsed_ms;\n    }\n    else\n        ms_before_next_level -= elapsed_ms;\n    for (std::list<std::shared_ptr<Mob>>::iterator i = Map::ennemies.begin();\n            i != Map::ennemies.end();)\n    {\n        if ((*i)->dead())\n            i = Map::ennemies.erase(i);\n        else\n        {\n            (*i)->move();\n            auto pos = (*i)->get_pos();\n            if (is_arrived(pos.first, Map::finish_mobs.first,\n                           pos.second, Map::finish_mobs.second))\n            {\n                std::cout << \"xd\" << std::endl;\n                (*i)->harakiri();\n                if (!Player::remove_a_life())\n                {\n                    GameState::stack.pop_back();\n                    auto ptr = std::make_shared<EndState>();\n                    GameState::stack.push_back(ptr);\n                }\n                i = Map::ennemies.erase(i);\n            }\n            else\n                ++i;\n        }\n    }\n    for (std::shared_ptr<Turret> turret : Map::turrets)\n        turret->attack(elapsed_ms);\n    ++elapsed_ms;\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 \"webkit\/plugins\/ppapi\/ppb_flash_impl.h\"\n\n#include <string>\n#include <vector>\n\n#include \"base\/message_loop.h\"\n#include \"base\/time.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ppapi\/c\/dev\/ppb_font_dev.h\"\n#include \"ppapi\/c\/private\/ppb_flash.h\"\n#include \"ppapi\/shared_impl\/time_conversion.h\"\n#include \"ppapi\/shared_impl\/var.h\"\n#include \"ppapi\/thunk\/enter.h\"\n#include \"ppapi\/thunk\/ppb_image_data_api.h\"\n#include \"skia\/ext\/platform_canvas.h\"\n#include \"third_party\/skia\/include\/core\/SkCanvas.h\"\n#include \"third_party\/skia\/include\/core\/SkMatrix.h\"\n#include \"third_party\/skia\/include\/core\/SkPaint.h\"\n#include \"third_party\/skia\/include\/core\/SkPoint.h\"\n#include \"third_party\/skia\/include\/core\/SkTemplates.h\"\n#include \"third_party\/skia\/include\/core\/SkTypeface.h\"\n#include \"webkit\/plugins\/ppapi\/common.h\"\n#include \"webkit\/plugins\/ppapi\/host_globals.h\"\n#include \"webkit\/plugins\/ppapi\/plugin_delegate.h\"\n#include \"webkit\/plugins\/ppapi\/plugin_module.h\"\n#include \"webkit\/plugins\/ppapi\/ppapi_plugin_instance.h\"\n#include \"webkit\/plugins\/ppapi\/ppb_url_request_info_impl.h\"\n#include \"webkit\/plugins\/ppapi\/resource_helper.h\"\n#include \"webkit\/plugins\/ppapi\/ppb_image_data_impl.h\"\n\nusing ppapi::PPTimeToTime;\nusing ppapi::StringVar;\nusing ppapi::thunk::EnterResource;\nusing ppapi::thunk::PPB_ImageData_API;\nusing ppapi::thunk::PPB_URLRequestInfo_API;\n\nnamespace webkit {\nnamespace ppapi {\n\nnamespace {\n\nvoid SetInstanceAlwaysOnTop(PP_Instance pp_instance, PP_Bool on_top) {\n  PluginInstance* instance = HostGlobals::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return;\n  instance->set_always_on_top(PPBoolToBool(on_top));\n}\n\n\nPP_Bool DrawGlyphs(PP_Instance,\n                   PP_Resource pp_image_data,\n                   const PP_FontDescription_Dev* font_desc,\n                   uint32_t color,\n                   const PP_Point* position,\n                   const PP_Rect* clip,\n                   const float transformation[3][3],\n                   PP_Bool allow_subpixel_aa,\n                   uint32_t glyph_count,\n                   const uint16_t glyph_indices[],\n                   const PP_Point glyph_advances[]) {\n  EnterResource<PPB_ImageData_API> enter(pp_image_data, true);\n  if (enter.failed())\n    return PP_FALSE;\n  PPB_ImageData_Impl* image_resource =\n      static_cast<PPB_ImageData_Impl*>(enter.object());\n\n  ImageDataAutoMapper mapper(image_resource);\n  if (!mapper.is_valid())\n    return PP_FALSE;\n\n  \/\/ Set up the typeface.\n  StringVar* face_name = StringVar::FromPPVar(font_desc->face);\n  if (!face_name)\n    return PP_FALSE;\n  int style = SkTypeface::kNormal;\n  if (font_desc->weight >= PP_FONTWEIGHT_BOLD)\n    style |= SkTypeface::kBold;\n  if (font_desc->italic)\n    style |= SkTypeface::kItalic;\n  SkTypeface* typeface =\n      SkTypeface::CreateFromName(face_name->value().c_str(),\n                                 static_cast<SkTypeface::Style>(style));\n  if (!typeface)\n    return PP_FALSE;\n\n  \/\/ Set up the canvas.\n  SkCanvas* canvas = image_resource->mapped_canvas();\n  canvas->save();\n\n  \/\/ Clip is applied in pixels before the transform.\n  SkRect clip_rect = { clip->point.x, clip->point.y,\n                       clip->point.x + clip->size.width,\n                       clip->point.y + clip->size.height };\n  canvas->clipRect(clip_rect);\n\n  \/\/ -- Do not return early below this. The canvas needs restoring and the\n  \/\/ typeface will leak if it's not assigned to the paint (it's refcounted and\n  \/\/ the refcount is currently 0).\n\n  \/\/ Convert & set the matrix.\n  SkMatrix matrix;\n  matrix.set(SkMatrix::kMScaleX, SkFloatToScalar(transformation[0][0]));\n  matrix.set(SkMatrix::kMSkewX,  SkFloatToScalar(transformation[0][1]));\n  matrix.set(SkMatrix::kMTransX, SkFloatToScalar(transformation[0][2]));\n  matrix.set(SkMatrix::kMSkewY,  SkFloatToScalar(transformation[1][0]));\n  matrix.set(SkMatrix::kMScaleY, SkFloatToScalar(transformation[1][1]));\n  matrix.set(SkMatrix::kMTransY, SkFloatToScalar(transformation[1][2]));\n  matrix.set(SkMatrix::kMPersp0, SkFloatToScalar(transformation[2][0]));\n  matrix.set(SkMatrix::kMPersp1, SkFloatToScalar(transformation[2][1]));\n  matrix.set(SkMatrix::kMPersp2, SkFloatToScalar(transformation[2][2]));\n  canvas->concat(matrix);\n\n  SkPaint paint;\n  paint.setColor(color);\n  paint.setTextEncoding(SkPaint::kGlyphID_TextEncoding);\n  paint.setAntiAlias(true);\n  paint.setHinting(SkPaint::kFull_Hinting);\n  paint.setTextSize(SkIntToScalar(font_desc->size));\n  paint.setTypeface(typeface);  \/\/ Takes a ref and manages lifetime.\n  if (allow_subpixel_aa) {\n    paint.setSubpixelText(true);\n    paint.setLCDRenderText(true);\n  }\n\n  SkScalar x = SkIntToScalar(position->x);\n  SkScalar y = SkIntToScalar(position->y);\n\n  \/\/ Build up the skia advances.\n  if (glyph_count == 0)\n    return PP_TRUE;\n  std::vector<SkPoint> storage;\n  storage.resize(glyph_count);\n  SkPoint* sk_positions = &storage[0];\n  for (uint32_t i = 0; i < glyph_count; i++) {\n    sk_positions[i].set(x, y);\n    x += SkFloatToScalar(glyph_advances[i].x);\n    y += SkFloatToScalar(glyph_advances[i].y);\n  }\n\n  canvas->drawPosText(glyph_indices, glyph_count * 2, sk_positions, paint);\n\n  canvas->restore();\n  return PP_TRUE;\n}\n\nPP_Bool DrawGlyphs11(PP_Instance instance,\n                     PP_Resource pp_image_data,\n                     const PP_FontDescription_Dev* font_desc,\n                     uint32_t color,\n                     PP_Point position,\n                     PP_Rect clip,\n                     const float transformation[3][3],\n                     uint32_t glyph_count,\n                     const uint16_t glyph_indices[],\n                     const PP_Point glyph_advances[]) {\n  return DrawGlyphs(instance, pp_image_data, font_desc, color, &position,\n                    &clip, transformation, PP_TRUE, glyph_count,\n                    glyph_indices, glyph_advances);\n}\n\nPP_Var GetProxyForURL(PP_Instance pp_instance, const char* url) {\n  PluginInstance* instance = HostGlobals::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return PP_MakeUndefined();\n\n  GURL gurl(url);\n  if (!gurl.is_valid())\n    return PP_MakeUndefined();\n\n  std::string proxy_host = instance->delegate()->ResolveProxy(gurl);\n  if (proxy_host.empty())\n    return PP_MakeUndefined();  \/\/ No proxy.\n  return StringVar::StringToPPVar(proxy_host);\n}\n\nint32_t Navigate(PP_Resource request_id,\n                 const char* target,\n                 PP_Bool from_user_action) {\n  EnterResource<PPB_URLRequestInfo_API> enter(request_id, true);\n  if (enter.failed())\n    return PP_ERROR_BADRESOURCE;\n  PPB_URLRequestInfo_Impl* request =\n      static_cast<PPB_URLRequestInfo_Impl*>(enter.object());\n\n  if (!target)\n    return PP_ERROR_BADARGUMENT;\n\n  PluginInstance* plugin_instance = ResourceHelper::GetPluginInstance(request);\n  if (!plugin_instance)\n    return PP_ERROR_FAILED;\n  return plugin_instance->Navigate(request, target,\n                                   PP_ToBool(from_user_action));\n}\n\nint32_t Navigate11(PP_Resource request_id,\n                   const char* target,\n                   bool from_user_action) {\n  return Navigate(request_id, target, PP_FromBool(from_user_action));\n}\n\nvoid RunMessageLoop(PP_Instance instance) {\n  bool old_state = MessageLoop::current()->NestableTasksAllowed();\n  MessageLoop::current()->SetNestableTasksAllowed(true);\n  MessageLoop::current()->Run();\n  MessageLoop::current()->SetNestableTasksAllowed(old_state);\n}\n\nvoid QuitMessageLoop(PP_Instance instance) {\n  MessageLoop::current()->QuitNow();\n}\n\ndouble GetLocalTimeZoneOffset(PP_Instance pp_instance, PP_Time t) {\n  PluginInstance* instance = HostGlobals::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return 0.0;\n\n  \/\/ Evil hack. The time code handles exact \"0\" values as special, and produces\n  \/\/ a \"null\" Time object. This will represent some date hundreds of years ago\n  \/\/ and will give us funny results at 1970 (there are some tests where this\n  \/\/ comes up, but it shouldn't happen in real life). To work around this\n  \/\/ special handling, we just need to give it some nonzero value.\n  if (t == 0.0)\n    t = 0.0000000001;\n\n  \/\/ We can't do the conversion here because on Linux, the localtime calls\n  \/\/ require filesystem access prohibited by the sandbox.\n  return instance->delegate()->GetLocalTimeZoneOffset(PPTimeToTime(t));\n}\n\nPP_Var GetCommandLineArgs(PP_Module pp_module) {\n  PluginModule* module = HostGlobals::Get()->GetModule(pp_module);\n  if (!module)\n    return PP_MakeUndefined();\n\n  PluginInstance* instance = module->GetSomeInstance();\n  if (!instance)\n    return PP_MakeUndefined();\n\n  std::string args = instance->delegate()->GetFlashCommandLineArgs();\n  return StringVar::StringToPPVar(args);\n}\n\nvoid PreLoadFontWin(const void* logfontw) {\n  \/\/ Not implemented in-process.\n}\n\nconst PPB_Flash_11 ppb_flash_11 = {\n  &SetInstanceAlwaysOnTop,\n  &DrawGlyphs11,\n  &GetProxyForURL,\n  &Navigate11,\n  &RunMessageLoop,\n  &QuitMessageLoop,\n  &GetLocalTimeZoneOffset,\n  &GetCommandLineArgs\n};\n\nconst PPB_Flash ppb_flash_12 = {\n  &SetInstanceAlwaysOnTop,\n  &DrawGlyphs,\n  &GetProxyForURL,\n  &Navigate,\n  &RunMessageLoop,\n  &QuitMessageLoop,\n  &GetLocalTimeZoneOffset,\n  &GetCommandLineArgs,\n  &PreLoadFontWin\n};\n\n}  \/\/ namespace\n\n\/\/ static\nconst PPB_Flash_11* PPB_Flash_Impl::GetInterface11() {\n  return &ppb_flash_11;\n}\n\n\/\/ static\nconst PPB_Flash* PPB_Flash_Impl::GetInterface12() {\n  return &ppb_flash_12;\n}\n\n}  \/\/ namespace ppapi\n}  \/\/ namespace webkit\n<commit_msg>Fix leak of the typeface when doing DrawGlyphs for Flash.<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 \"webkit\/plugins\/ppapi\/ppb_flash_impl.h\"\n\n#include <string>\n#include <vector>\n\n#include \"base\/message_loop.h\"\n#include \"base\/time.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ppapi\/c\/dev\/ppb_font_dev.h\"\n#include \"ppapi\/c\/private\/ppb_flash.h\"\n#include \"ppapi\/shared_impl\/time_conversion.h\"\n#include \"ppapi\/shared_impl\/var.h\"\n#include \"ppapi\/thunk\/enter.h\"\n#include \"ppapi\/thunk\/ppb_image_data_api.h\"\n#include \"skia\/ext\/platform_canvas.h\"\n#include \"third_party\/skia\/include\/core\/SkCanvas.h\"\n#include \"third_party\/skia\/include\/core\/SkMatrix.h\"\n#include \"third_party\/skia\/include\/core\/SkPaint.h\"\n#include \"third_party\/skia\/include\/core\/SkPoint.h\"\n#include \"third_party\/skia\/include\/core\/SkTemplates.h\"\n#include \"third_party\/skia\/include\/core\/SkTypeface.h\"\n#include \"webkit\/plugins\/ppapi\/common.h\"\n#include \"webkit\/plugins\/ppapi\/host_globals.h\"\n#include \"webkit\/plugins\/ppapi\/plugin_delegate.h\"\n#include \"webkit\/plugins\/ppapi\/plugin_module.h\"\n#include \"webkit\/plugins\/ppapi\/ppapi_plugin_instance.h\"\n#include \"webkit\/plugins\/ppapi\/ppb_url_request_info_impl.h\"\n#include \"webkit\/plugins\/ppapi\/resource_helper.h\"\n#include \"webkit\/plugins\/ppapi\/ppb_image_data_impl.h\"\n\nusing ppapi::PPTimeToTime;\nusing ppapi::StringVar;\nusing ppapi::thunk::EnterResource;\nusing ppapi::thunk::PPB_ImageData_API;\nusing ppapi::thunk::PPB_URLRequestInfo_API;\n\nnamespace webkit {\nnamespace ppapi {\n\nnamespace {\n\nvoid SetInstanceAlwaysOnTop(PP_Instance pp_instance, PP_Bool on_top) {\n  PluginInstance* instance = HostGlobals::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return;\n  instance->set_always_on_top(PPBoolToBool(on_top));\n}\n\n\nPP_Bool DrawGlyphs(PP_Instance,\n                   PP_Resource pp_image_data,\n                   const PP_FontDescription_Dev* font_desc,\n                   uint32_t color,\n                   const PP_Point* position,\n                   const PP_Rect* clip,\n                   const float transformation[3][3],\n                   PP_Bool allow_subpixel_aa,\n                   uint32_t glyph_count,\n                   const uint16_t glyph_indices[],\n                   const PP_Point glyph_advances[]) {\n  EnterResource<PPB_ImageData_API> enter(pp_image_data, true);\n  if (enter.failed())\n    return PP_FALSE;\n  PPB_ImageData_Impl* image_resource =\n      static_cast<PPB_ImageData_Impl*>(enter.object());\n\n  ImageDataAutoMapper mapper(image_resource);\n  if (!mapper.is_valid())\n    return PP_FALSE;\n\n  \/\/ Set up the typeface.\n  StringVar* face_name = StringVar::FromPPVar(font_desc->face);\n  if (!face_name)\n    return PP_FALSE;\n  int style = SkTypeface::kNormal;\n  if (font_desc->weight >= PP_FONTWEIGHT_BOLD)\n    style |= SkTypeface::kBold;\n  if (font_desc->italic)\n    style |= SkTypeface::kItalic;\n  SkTypeface* typeface =\n      SkTypeface::CreateFromName(face_name->value().c_str(),\n                                 static_cast<SkTypeface::Style>(style));\n  if (!typeface)\n    return PP_FALSE;\n  SkAutoUnref aur(typeface);\n\n  \/\/ Set up the canvas.\n  SkCanvas* canvas = image_resource->mapped_canvas();\n  SkAutoCanvasRestore acr(canvas, true);\n\n  \/\/ Clip is applied in pixels before the transform.\n  SkRect clip_rect = { clip->point.x, clip->point.y,\n                       clip->point.x + clip->size.width,\n                       clip->point.y + clip->size.height };\n  canvas->clipRect(clip_rect);\n\n  \/\/ Convert & set the matrix.\n  SkMatrix matrix;\n  matrix.set(SkMatrix::kMScaleX, SkFloatToScalar(transformation[0][0]));\n  matrix.set(SkMatrix::kMSkewX,  SkFloatToScalar(transformation[0][1]));\n  matrix.set(SkMatrix::kMTransX, SkFloatToScalar(transformation[0][2]));\n  matrix.set(SkMatrix::kMSkewY,  SkFloatToScalar(transformation[1][0]));\n  matrix.set(SkMatrix::kMScaleY, SkFloatToScalar(transformation[1][1]));\n  matrix.set(SkMatrix::kMTransY, SkFloatToScalar(transformation[1][2]));\n  matrix.set(SkMatrix::kMPersp0, SkFloatToScalar(transformation[2][0]));\n  matrix.set(SkMatrix::kMPersp1, SkFloatToScalar(transformation[2][1]));\n  matrix.set(SkMatrix::kMPersp2, SkFloatToScalar(transformation[2][2]));\n  canvas->concat(matrix);\n\n  SkPaint paint;\n  paint.setColor(color);\n  paint.setTextEncoding(SkPaint::kGlyphID_TextEncoding);\n  paint.setAntiAlias(true);\n  paint.setHinting(SkPaint::kFull_Hinting);\n  paint.setTextSize(SkIntToScalar(font_desc->size));\n  paint.setTypeface(typeface);  \/\/ Takes a ref and manages lifetime.\n  if (allow_subpixel_aa) {\n    paint.setSubpixelText(true);\n    paint.setLCDRenderText(true);\n  }\n\n  SkScalar x = SkIntToScalar(position->x);\n  SkScalar y = SkIntToScalar(position->y);\n\n  \/\/ Build up the skia advances.\n  if (glyph_count == 0)\n    return PP_TRUE;\n  std::vector<SkPoint> storage;\n  storage.resize(glyph_count);\n  SkPoint* sk_positions = &storage[0];\n  for (uint32_t i = 0; i < glyph_count; i++) {\n    sk_positions[i].set(x, y);\n    x += SkFloatToScalar(glyph_advances[i].x);\n    y += SkFloatToScalar(glyph_advances[i].y);\n  }\n\n  canvas->drawPosText(glyph_indices, glyph_count * 2, sk_positions, paint);\n\n  return PP_TRUE;\n}\n\nPP_Bool DrawGlyphs11(PP_Instance instance,\n                     PP_Resource pp_image_data,\n                     const PP_FontDescription_Dev* font_desc,\n                     uint32_t color,\n                     PP_Point position,\n                     PP_Rect clip,\n                     const float transformation[3][3],\n                     uint32_t glyph_count,\n                     const uint16_t glyph_indices[],\n                     const PP_Point glyph_advances[]) {\n  return DrawGlyphs(instance, pp_image_data, font_desc, color, &position,\n                    &clip, transformation, PP_TRUE, glyph_count,\n                    glyph_indices, glyph_advances);\n}\n\nPP_Var GetProxyForURL(PP_Instance pp_instance, const char* url) {\n  PluginInstance* instance = HostGlobals::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return PP_MakeUndefined();\n\n  GURL gurl(url);\n  if (!gurl.is_valid())\n    return PP_MakeUndefined();\n\n  std::string proxy_host = instance->delegate()->ResolveProxy(gurl);\n  if (proxy_host.empty())\n    return PP_MakeUndefined();  \/\/ No proxy.\n  return StringVar::StringToPPVar(proxy_host);\n}\n\nint32_t Navigate(PP_Resource request_id,\n                 const char* target,\n                 PP_Bool from_user_action) {\n  EnterResource<PPB_URLRequestInfo_API> enter(request_id, true);\n  if (enter.failed())\n    return PP_ERROR_BADRESOURCE;\n  PPB_URLRequestInfo_Impl* request =\n      static_cast<PPB_URLRequestInfo_Impl*>(enter.object());\n\n  if (!target)\n    return PP_ERROR_BADARGUMENT;\n\n  PluginInstance* plugin_instance = ResourceHelper::GetPluginInstance(request);\n  if (!plugin_instance)\n    return PP_ERROR_FAILED;\n  return plugin_instance->Navigate(request, target,\n                                   PP_ToBool(from_user_action));\n}\n\nint32_t Navigate11(PP_Resource request_id,\n                   const char* target,\n                   bool from_user_action) {\n  return Navigate(request_id, target, PP_FromBool(from_user_action));\n}\n\nvoid RunMessageLoop(PP_Instance instance) {\n  bool old_state = MessageLoop::current()->NestableTasksAllowed();\n  MessageLoop::current()->SetNestableTasksAllowed(true);\n  MessageLoop::current()->Run();\n  MessageLoop::current()->SetNestableTasksAllowed(old_state);\n}\n\nvoid QuitMessageLoop(PP_Instance instance) {\n  MessageLoop::current()->QuitNow();\n}\n\ndouble GetLocalTimeZoneOffset(PP_Instance pp_instance, PP_Time t) {\n  PluginInstance* instance = HostGlobals::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return 0.0;\n\n  \/\/ Evil hack. The time code handles exact \"0\" values as special, and produces\n  \/\/ a \"null\" Time object. This will represent some date hundreds of years ago\n  \/\/ and will give us funny results at 1970 (there are some tests where this\n  \/\/ comes up, but it shouldn't happen in real life). To work around this\n  \/\/ special handling, we just need to give it some nonzero value.\n  if (t == 0.0)\n    t = 0.0000000001;\n\n  \/\/ We can't do the conversion here because on Linux, the localtime calls\n  \/\/ require filesystem access prohibited by the sandbox.\n  return instance->delegate()->GetLocalTimeZoneOffset(PPTimeToTime(t));\n}\n\nPP_Var GetCommandLineArgs(PP_Module pp_module) {\n  PluginModule* module = HostGlobals::Get()->GetModule(pp_module);\n  if (!module)\n    return PP_MakeUndefined();\n\n  PluginInstance* instance = module->GetSomeInstance();\n  if (!instance)\n    return PP_MakeUndefined();\n\n  std::string args = instance->delegate()->GetFlashCommandLineArgs();\n  return StringVar::StringToPPVar(args);\n}\n\nvoid PreLoadFontWin(const void* logfontw) {\n  \/\/ Not implemented in-process.\n}\n\nconst PPB_Flash_11 ppb_flash_11 = {\n  &SetInstanceAlwaysOnTop,\n  &DrawGlyphs11,\n  &GetProxyForURL,\n  &Navigate11,\n  &RunMessageLoop,\n  &QuitMessageLoop,\n  &GetLocalTimeZoneOffset,\n  &GetCommandLineArgs\n};\n\nconst PPB_Flash ppb_flash_12 = {\n  &SetInstanceAlwaysOnTop,\n  &DrawGlyphs,\n  &GetProxyForURL,\n  &Navigate,\n  &RunMessageLoop,\n  &QuitMessageLoop,\n  &GetLocalTimeZoneOffset,\n  &GetCommandLineArgs,\n  &PreLoadFontWin\n};\n\n}  \/\/ namespace\n\n\/\/ static\nconst PPB_Flash_11* PPB_Flash_Impl::GetInterface11() {\n  return &ppb_flash_11;\n}\n\n\/\/ static\nconst PPB_Flash* PPB_Flash_Impl::GetInterface12() {\n  return &ppb_flash_12;\n}\n\n}  \/\/ namespace ppapi\n}  \/\/ namespace webkit\n<|endoftext|>"}
{"text":"<commit_before>#include <set>\n#include <vector>\n\n#include \"entitysystem.h\"\n#include \"cmapclient.h\"\n#include \"cmapserver.h\"\n#include \"connection.h\"\n#include \"systems\/chatsystem.h\"\n#include \"systems\/inventorysystem.h\"\n#include \"systems\/luasystem.h\"\n#include \"systems\/mapsystem.h\"\n#include \"systems\/movementsystem.h\"\n#include \"systems\/partysystem.h\"\n#include \"systems\/updatesystem.h\"\n\nusing namespace RoseCommon;\nEntitySystem::EntitySystem(CMapServer *server) : systemManager_(*this), server_(server) {\n  systemManager_.add<Systems::MovementSystem>();\n  systemManager_.add<Systems::UpdateSystem>();\n  systemManager_.add<Systems::ChatSystem>();\n  systemManager_.add<Systems::InventorySystem>();\n  systemManager_.add<Systems::PartySystem>();\n  systemManager_.add<Systems::MapSystem>();\n  systemManager_.add<Systems::LuaSystem>();\n}\nEntityManager& EntitySystem::getEntityManager() { return entityManager_; }\n\nEntity EntitySystem::buildItemEntity(Entity creator, RoseCommon::Item&& item) {\n  Entity e = create();\n  e.assign<Item>(std::move(item));\n  auto pos = creator.component<Position>();\n  e.assign<Position>(pos->x_, pos->y_, pos->map_, 0);\n  auto basic = e.assign<BasicInfo>();\n  basic->ownerId_ = creator.component<BasicInfo>()->id_;\n  basic->id_ = id_manager_.get_free_id();\n  itemToEntity_[basic->id_] = e;\n  return e;\n}\n\nvoid EntitySystem::registerEntity(Entity entity) {\n  if (!entity) return;\n  auto basic = entity.component<BasicInfo>();\n  if (!basic || basic->name_ == \"\" || !basic->id_) return;\n  nameToEntity_[basic->name_] = entity;\n  idToEntity_[basic->id_] = entity;\n}\n\nEntity EntitySystem::getItemEntity(uint32_t id) { return itemToEntity_[id]; }\n\nEntity EntitySystem::getEntity(const std::string& name) { return nameToEntity_[name]; }\n\nEntity EntitySystem::getEntity(uint32_t charId) { return idToEntity_[charId]; }\n\nvoid EntitySystem::update(double dt) {\n  std::lock_guard<std::mutex> lock(access_);\n  for (auto& it : create_commands_) {\n    it->execute(*this);\n  }\n  create_commands_.clear();\n  while (toDispatch_.size()) {\n    auto tmp = std::move(toDispatch_.front());\n    systemManager_.dispatch(tmp.first, *tmp.second);\n    toDispatch_.pop();\n  }\n  systemManager_.update(dt);\n  for (auto& it : delete_commands_) {\n    it->execute(*this);\n  }\n  delete_commands_.clear();\n}\n\nvoid EntitySystem::destroy(Entity entity) {\n  if (!entity) return;\n  std::unique_ptr<CommandBase> ptr{new Command([entity] (EntitySystem &) {\n      if (!entity) return;\n      if (auto client = getClient(entity); client)\n        CMapServer::SendPacket(client, CMapServer::eSendType::EVERYONE_BUT_ME,\n                               *makePacket<ePacketType::PAKWC_REMOVE_OBJECT>(entity));\n      else\n        CMapServer::SendPacket({}, CMapServer::eSendType::EVERYONE,\n                               *makePacket<ePacketType::PAKWC_REMOVE_OBJECT>(entity));\n      saveCharacter(entity.component<CharacterInfo>()->charId_, entity);\n      auto basic = entity.component<BasicInfo>();\n      nameToEntity_.erase(basic->name_);\n      idToEntity_.erase(basic->id_);\n      id_manager_.release_id(basic->id_);\n      it.destroy();\n    })};\n  std::lock_guard<std::mutex> lock(access_);\n  create_commands_.emplace_back(std::move(ptr));\n}\n\nEntity EntitySystem::create() { return entityManager_.create(); }\n\nbool EntitySystem::isNearby(Entity a, Entity b) {\n  return true;  \/\/ FIXME : actually implement the sight calculation instead of the distance\n  if (!a || !b) return false;\n  auto posa = a.component<Position>();\n  auto posb = b.component<Position>();\n  if (!posa || !posb) return false;  \/\/ FIXME : is it a bug if there is no position?\n  if (posa->map_ != posb->map_) return false;\n  double dist = (posa->x_ - posb->x_) * (posa->x_ - posb->x_) + (posa->y_ - posb->y_) * (posa->y_ - posb->y_);\n  if (dist > NEARBY_DIST) return false;\n  return true;\n}\n\nbool EntitySystem::dispatch(Entity entity, std::unique_ptr<RoseCommon::CRosePacket> packet) {\n  if (!entity) return false;\n  if (systemManager_.wouldDispatch(*packet)) {\n    std::lock_guard<std::mutex> lock(access_);\n    toDispatch_.emplace(std::make_pair(entity, std::move(packet)));\n    return true;\n  }\n  return false;\n}\n\nEntity EntitySystem::loadCharacter(uint32_t charId, bool platinium) {\n  auto conn = Core::connectionPool.getConnection(Core::osirose);\n  Core::CharacterTable characters{};\n  Core::InventoryTable inventoryTable{};\n  Core::SkillTable skillsTable{};\n\n  auto charRes = conn(sqlpp::select(sqlpp::count(characters.id), sqlpp::all_of(characters))\n                          .from(characters)\n                          .where(characters.id == charId));\n\n  std::lock_guard<std::mutex> lock(access_);\n  auto entity = create();\n  if (static_cast<long>(charRes.front().count) != 1L) {\n    entity.destroy();\n    return Entity();\n  }\n  const auto& charRow = charRes.front();\n\n  entity.assign<Position>(charRow);\n  entity.assign<BasicInfo>(charRow, id_manager_.get_free_id());\n  entity.assign<Stats>(charRow);\n  entity.assign<AdvancedInfo>(charRow);\n  entity.assign<CharacterGraphics>(charRow);\n  entity.assign<CharacterInfo>(charRow, platinium, charId);\n\n  \/\/ TODO : write the pat initialization code\n  auto skills = entity.assign<Skills>();\n  auto skillRes =\n      conn(sqlpp::select(skillsTable.id, skillsTable.level).from(skillsTable).where(skillsTable.charId == charId));\n  skills->loadFromResult(skillRes);\n\n  \/\/ TODO : write the hotbar table and loading code\n  entity.assign<Hotbar>();\n  entity.assign<StatusEffects>();\n  entity.assign<RidingItems>();\n  entity.assign<BulletItems>();\n\n  \/\/ TODO : write the inventory code\n  \/\/ auto luaSystem = systemManager_.get<Systems::LuaSystem>();\n  auto inventory = entity.assign<Inventory>();\n\n  auto invRes =\n      conn(sqlpp::select(sqlpp::all_of(inventoryTable)).from(inventoryTable).where(inventoryTable.charId == charId));\n  inventory->loadFromResult(invRes, get<Systems::InventorySystem>());\n\n  Systems::UpdateSystem::calculateSpeed(entity);\n\n  entity.assign<Quests>();\n\n  Core::WishTable wish{};\n  auto wishRes = conn(sqlpp::select(sqlpp::all_of(wish)).from(wish).where(wish.charId == charId));\n  auto wishlist = entity.assign<Wishlist>();\n  wishlist->loadFromResult(wishRes, get<Systems::InventorySystem>());\n\n  \/\/ auto lua = entity.assign<EntityAPI>();\n\n  \/\/ luaSystem->loadScript(entity, \"function onInit()\\ndisplay('test')\\nend\");\n  \/\/ lua->onInit();\n\n  registerEntity(entity);\n  return entity;\n}\n\nvoid EntitySystem::saveCharacter(uint32_t charId, Entity entity) {\n  if (!entity) return;\n  auto conn = Core::connectionPool.getConnection(Core::osirose);\n  Core::CharacterTable characters{};\n\n  using sqlpp::parameter;\n\n  auto update = sqlpp::dynamic_update(conn.get(), characters).dynamic_set().where(characters.id == charId);\n  entity.component<Position>()->commitToUpdate<decltype(characters)>(update);\n  entity.component<BasicInfo>()->commitToUpdate<decltype(characters)>(update);\n  entity.component<Stats>()->commitToUpdate<decltype(characters)>(update);\n  entity.component<AdvancedInfo>()->commitToUpdate<decltype(characters)>(update);\n  \/\/ entity.component<CharacterGraphics>()->commitToUpdate(update);\n  entity.component<CharacterInfo>()->commitToUpdate<decltype(characters)>(update);\n  \/\/ entity.component<Hotbar>()->commitToUpdate(update);\n  \/\/ entity.component<StatusEffects>()->commitToUpdate(update);\n  \/\/ entity.component<RidingItems>()->commitToUpdate(update);\n  \/\/ entity.component<BulletItems>()->commitToUpdate(update);\n\n  conn->run(update);\n\n  \/\/ entity.component<Skills>()->commitToUpdate(updateSkills);\n\n  Core::InventoryTable inv{};\n  auto invRes = conn(sqlpp::select(sqlpp::all_of(inv)).from(inv).where(inv.charId == charId));\n\n  const auto& items = entity.component<Inventory>()->items_;\n\n  std::vector<size_t> toDelete;\n  std::vector<size_t> toUpdate;\n  std::set<size_t> modified;\n  std::vector<size_t> toInsert;\n\n  for (const auto& row : invRes) {\n    if (row.slot >= Inventory::maxItems)\n      toDelete.emplace_back(row.slot);  \/\/ FIXME: that should never happen\n    else if (!items[row.slot])\n      toDelete.emplace_back(row.slot);\n    else if (items[row.slot] != Item(row))\n      toUpdate.emplace_back(row.slot);\n    modified.insert(row.slot);\n  }\n  size_t i = 0;\n  for (const auto& item : items) {\n    if (item && modified.find(i) == modified.end()) toInsert.emplace_back(i);\n    ++i;\n  }\n\n  for (auto it : toDelete) conn(sqlpp::remove_from(inv).where(inv.charId == charId and inv.slot == it));\n  for (auto it : toUpdate) {\n    auto update = sqlpp::dynamic_update(conn.get(), inv).dynamic_set().where(inv.charId == charId and inv.slot == it);\n    items[it].commitToUpdate<decltype(inv)>(update);\n    conn->run(update);\n  }\n  for (auto it : toInsert) {\n    auto insert = sqlpp::dynamic_insert_into(conn.get(), inv).dynamic_set();\n    items[it].commitToInsert<decltype(inv)>(insert);\n    insert.insert_list.add(inv.slot = it);\n    insert.insert_list.add(inv.charId = charId);\n    conn->run(insert);\n  }\n}\n\nEntity EntitySystem::create_warpgate(std::string alias, int dest_map_id, float dest_x, float dest_y, float dest_z,\n                    int map_id, float x, float y, float z, float angle,\n                    float x_scale, float y_scale, float z_scale) {\n  return {};\n}\n\nEntity EntitySystem::create_npc(std::string npc_lua, int npc_id, int map_id, float x, float y, float z, float angle) {\n    Entity e = create();\n    std::unique_ptr<CommandBase> ptr{new Command([npc_lua, npc_id, map_id, x, y, z, angle, e] (EntitySystem &es) mutable {\n      if (!e) return;\n      e.assign<BasicInfo>(es.id_manager_.get_free_id());\n      e.assign<AdvancedInfo>();\n      e.assign<CharacterInfo>();\n\n      uint16_t dialog_id = 0;\n      if (!npc_lua.empty()) {\n        dialog_id = std::stoi(npc_lua);\n      }\n      e.assign<Npc>(npc_id, dialog_id);\n      auto pos = e.assign<Position>(x * 100, y * 100, map_id, 0);\n\n      pos->z_ = static_cast<uint16_t>(z);\n      pos->angle_ = angle;\n      \/\/e.assign<EntityApi>();\n    })};\n    create_commands_.emplace_back(std::move(ptr));\n    return e;\n}\n\nEntity EntitySystem::create_spawner(std::string alias, int mob_id, int mob_count,\n                   int spawner_limit, int spawner_interval, int spawner_range,\n                   int map_id, float x, float y, float z) {\n  return {};\n}\n\nvoid EntitySystem::bulk_destroy(const std::vector<Entity>& s) {\n  std::lock_guard<std::mutex> lock(access_);\n  toDestroy_.insert(toDestroy_.end(), s.begin(), s.end());\n}\n\nLuaScript::ScriptLoader& EntitySystem::get_script_loader() noexcept {\n  return server_->get_script_loader();\n}\n<commit_msg>Update entitysystem.cpp<commit_after>#include <set>\n#include <vector>\n\n#include \"entitysystem.h\"\n#include \"cmapclient.h\"\n#include \"cmapserver.h\"\n#include \"connection.h\"\n#include \"systems\/chatsystem.h\"\n#include \"systems\/inventorysystem.h\"\n#include \"systems\/luasystem.h\"\n#include \"systems\/mapsystem.h\"\n#include \"systems\/movementsystem.h\"\n#include \"systems\/partysystem.h\"\n#include \"systems\/updatesystem.h\"\n\nusing namespace RoseCommon;\nEntitySystem::EntitySystem(CMapServer *server) : systemManager_(*this), server_(server) {\n  systemManager_.add<Systems::MovementSystem>();\n  systemManager_.add<Systems::UpdateSystem>();\n  systemManager_.add<Systems::ChatSystem>();\n  systemManager_.add<Systems::InventorySystem>();\n  systemManager_.add<Systems::PartySystem>();\n  systemManager_.add<Systems::MapSystem>();\n  systemManager_.add<Systems::LuaSystem>();\n}\nEntityManager& EntitySystem::getEntityManager() { return entityManager_; }\n\nEntity EntitySystem::buildItemEntity(Entity creator, RoseCommon::Item&& item) {\n  Entity e = create();\n  e.assign<Item>(std::move(item));\n  auto pos = creator.component<Position>();\n  e.assign<Position>(pos->x_, pos->y_, pos->map_, 0);\n  auto basic = e.assign<BasicInfo>();\n  basic->ownerId_ = creator.component<BasicInfo>()->id_;\n  basic->id_ = id_manager_.get_free_id();\n  itemToEntity_[basic->id_] = e;\n  return e;\n}\n\nvoid EntitySystem::registerEntity(Entity entity) {\n  if (!entity) return;\n  auto basic = entity.component<BasicInfo>();\n  if (!basic || basic->name_ == \"\" || !basic->id_) return;\n  nameToEntity_[basic->name_] = entity;\n  idToEntity_[basic->id_] = entity;\n}\n\nEntity EntitySystem::getItemEntity(uint32_t id) { return itemToEntity_[id]; }\n\nEntity EntitySystem::getEntity(const std::string& name) { return nameToEntity_[name]; }\n\nEntity EntitySystem::getEntity(uint32_t charId) { return idToEntity_[charId]; }\n\nvoid EntitySystem::update(double dt) {\n  std::lock_guard<std::mutex> lock(access_);\n  for (auto& it : create_commands_) {\n    it->execute(*this);\n  }\n  create_commands_.clear();\n  while (toDispatch_.size()) {\n    auto tmp = std::move(toDispatch_.front());\n    systemManager_.dispatch(tmp.first, *tmp.second);\n    toDispatch_.pop();\n  }\n  systemManager_.update(dt);\n  for (auto& it : delete_commands_) {\n    it->execute(*this);\n  }\n  delete_commands_.clear();\n}\n\nvoid EntitySystem::destroy(Entity entity) {\n  if (!entity) return;\n  std::unique_ptr<CommandBase> ptr{new Command([entity] (EntitySystem &) {\n      if (!entity) return;\n      if (auto client = getClient(entity); client)\n        CMapServer::SendPacket(client, CMapServer::eSendType::EVERYONE_BUT_ME,\n                               *makePacket<ePacketType::PAKWC_REMOVE_OBJECT>(entity));\n      else\n        CMapServer::SendPacket({}, CMapServer::eSendType::EVERYONE,\n                               *makePacket<ePacketType::PAKWC_REMOVE_OBJECT>(entity));\n      saveCharacter(entity.component<CharacterInfo>()->charId_, entity);\n      auto basic = entity.component<BasicInfo>();\n      nameToEntity_.erase(basic->name_);\n      idToEntity_.erase(basic->id_);\n      id_manager_.release_id(basic->id_);\n      it.destroy();\n    })};\n  std::lock_guard<std::mutex> lock(access_);\n  create_commands_.emplace_back(std::move(ptr));\n}\n\nEntity EntitySystem::create() { return entityManager_.create(); }\n\nbool EntitySystem::isNearby(Entity a, Entity b) {\n  return true;  \/\/ FIXME : actually implement the sight calculation instead of the distance\n  if (!a || !b) return false;\n  auto posa = a.component<Position>();\n  auto posb = b.component<Position>();\n  if (!posa || !posb) return false;  \/\/ FIXME : is it a bug if there is no position?\n  if (posa->map_ != posb->map_) return false;\n  double dist = (posa->x_ - posb->x_) * (posa->x_ - posb->x_) + (posa->y_ - posb->y_) * (posa->y_ - posb->y_);\n  if (dist > NEARBY_DIST) return false;\n  return true;\n}\n\nbool EntitySystem::dispatch(Entity entity, std::unique_ptr<RoseCommon::CRosePacket> packet) {\n  if (!entity) return false;\n  if (systemManager_.wouldDispatch(*packet)) {\n    std::lock_guard<std::mutex> lock(access_);\n    toDispatch_.emplace(std::make_pair(entity, std::move(packet)));\n    return true;\n  }\n  return false;\n}\n\nEntity EntitySystem::loadCharacter(uint32_t charId, bool platinium) {\n  auto conn = Core::connectionPool.getConnection(Core::osirose);\n  Core::CharacterTable characters{};\n  Core::InventoryTable inventoryTable{};\n  Core::SkillTable skillsTable{};\n\n  auto charRes = conn(sqlpp::select(sqlpp::count(characters.id), sqlpp::all_of(characters))\n                          .from(characters)\n                          .where(characters.id == charId));\n\n  std::lock_guard<std::mutex> lock(access_);\n  auto entity = create();\n  if (static_cast<long>(charRes.front().count) != 1L) {\n    entity.destroy();\n    return Entity();\n  }\n  const auto& charRow = charRes.front();\n\n  entity.assign<Position>(charRow);\n  entity.assign<BasicInfo>(charRow, id_manager_.get_free_id());\n  entity.assign<Stats>(charRow);\n  entity.assign<AdvancedInfo>(charRow);\n  entity.assign<CharacterGraphics>(charRow);\n  entity.assign<CharacterInfo>(charRow, platinium, charId);\n\n  \/\/ TODO : write the pat initialization code\n  auto skills = entity.assign<Skills>();\n  auto skillRes =\n      conn(sqlpp::select(skillsTable.id, skillsTable.level).from(skillsTable).where(skillsTable.charId == charId));\n  skills->loadFromResult(skillRes);\n\n  \/\/ TODO : write the hotbar table and loading code\n  entity.assign<Hotbar>();\n  entity.assign<StatusEffects>();\n  entity.assign<RidingItems>();\n  entity.assign<BulletItems>();\n\n  \/\/ TODO : write the inventory code\n  \/\/ auto luaSystem = systemManager_.get<Systems::LuaSystem>();\n  auto inventory = entity.assign<Inventory>();\n\n  auto invRes =\n      conn(sqlpp::select(sqlpp::all_of(inventoryTable)).from(inventoryTable).where(inventoryTable.charId == charId));\n  inventory->loadFromResult(invRes, get<Systems::InventorySystem>());\n\n  Systems::UpdateSystem::calculateSpeed(entity);\n\n  entity.assign<Quests>();\n\n  Core::WishTable wish{};\n  auto wishRes = conn(sqlpp::select(sqlpp::all_of(wish)).from(wish).where(wish.charId == charId));\n  auto wishlist = entity.assign<Wishlist>();\n  wishlist->loadFromResult(wishRes, get<Systems::InventorySystem>());\n\n  \/\/ auto lua = entity.assign<EntityAPI>();\n\n  \/\/ luaSystem->loadScript(entity, \"function onInit()\\ndisplay('test')\\nend\");\n  \/\/ lua->onInit();\n\n  registerEntity(entity);\n  return entity;\n}\n\nvoid EntitySystem::saveCharacter(uint32_t charId, Entity entity) {\n  if (!entity) return;\n  auto conn = Core::connectionPool.getConnection(Core::osirose);\n  Core::CharacterTable characters{};\n\n  using sqlpp::parameter;\n\n  auto update = sqlpp::dynamic_update(conn.get(), characters).dynamic_set().where(characters.id == charId);\n  entity.component<Position>()->commitToUpdate<decltype(characters)>(update);\n  entity.component<BasicInfo>()->commitToUpdate<decltype(characters)>(update);\n  entity.component<Stats>()->commitToUpdate<decltype(characters)>(update);\n  entity.component<AdvancedInfo>()->commitToUpdate<decltype(characters)>(update);\n  \/\/ entity.component<CharacterGraphics>()->commitToUpdate(update);\n  entity.component<CharacterInfo>()->commitToUpdate<decltype(characters)>(update);\n  \/\/ entity.component<Hotbar>()->commitToUpdate(update);\n  \/\/ entity.component<StatusEffects>()->commitToUpdate(update);\n  \/\/ entity.component<RidingItems>()->commitToUpdate(update);\n  \/\/ entity.component<BulletItems>()->commitToUpdate(update);\n\n  conn->run(update);\n\n  \/\/ entity.component<Skills>()->commitToUpdate(updateSkills);\n\n  Core::InventoryTable inv{};\n  auto invRes = conn(sqlpp::select(sqlpp::all_of(inv)).from(inv).where(inv.charId == charId));\n\n  const auto& items = entity.component<Inventory>()->items_;\n\n  std::vector<size_t> toDelete;\n  std::vector<size_t> toUpdate;\n  std::set<size_t> modified;\n  std::vector<size_t> toInsert;\n\n  for (const auto& row : invRes) {\n    if (row.slot >= Inventory::maxItems)\n      toDelete.emplace_back(row.slot);  \/\/ FIXME: that should never happen\n    else if (!items[row.slot])\n      toDelete.emplace_back(row.slot);\n    else if (items[row.slot] != Item(row))\n      toUpdate.emplace_back(row.slot);\n    modified.insert(row.slot);\n  }\n  size_t i = 0;\n  for (const auto& item : items) {\n    if (item && modified.find(i) == modified.end()) toInsert.emplace_back(i);\n    ++i;\n  }\n\n  for (auto it : toDelete) conn(sqlpp::remove_from(inv).where(inv.charId == charId and inv.slot == it));\n  for (auto it : toUpdate) {\n    auto update = sqlpp::dynamic_update(conn.get(), inv).dynamic_set().where(inv.charId == charId and inv.slot == it);\n    items[it].commitToUpdate<decltype(inv)>(update);\n    conn->run(update);\n  }\n  for (auto it : toInsert) {\n    auto insert = sqlpp::dynamic_insert_into(conn.get(), inv).dynamic_set();\n    items[it].commitToInsert<decltype(inv)>(insert);\n    insert.insert_list.add(inv.slot = it);\n    insert.insert_list.add(inv.charId = charId);\n    conn->run(insert);\n  }\n}\n\nEntity EntitySystem::create_warpgate(std::string alias, int dest_map_id, float dest_x, float dest_y, float dest_z,\n                    int map_id, float x, float y, float z, float angle,\n                    float x_scale, float y_scale, float z_scale) {\n  return {};\n}\n\nEntity EntitySystem::create_npc(std::string npc_lua, int npc_id, int map_id, float x, float y, float z, float angle) {\n    Entity e = create();\n    std::unique_ptr<CommandBase> ptr{new Command([npc_lua, npc_id, map_id, x, y, z, angle, e] (EntitySystem &es) mutable {\n      if (!e) return;\n      e.assign<BasicInfo>(es.id_manager_.get_free_id());\n      e.assign<AdvancedInfo>();\n      e.assign<CharacterInfo>();\n\n      uint16_t dialog_id = 0;\n      if (!npc_lua.empty()) {\n        dialog_id = std::stoi(npc_lua);\n      }\n      e.assign<Npc>(npc_id, dialog_id);\n      auto pos = e.assign<Position>(x * 100, y * 100, map_id, 0);\n\n      pos->z_ = static_cast<uint16_t>(z);\n      pos->angle_ = angle;\n      \/\/e.assign<EntityApi>();\n    })};\n    create_commands_.emplace_back(std::move(ptr));\n    return e;\n}\n\nEntity EntitySystem::create_spawner(std::string alias, int mob_id, int mob_count,\n                   int spawner_limit, int spawner_interval, int spawner_range,\n                   int map_id, float x, float y, float z) {\n  return {};\n}\n\nvoid EntitySystem::bulk_destroy(const std::vector<Entity>& s) {\n  std::lock_guard<std::mutex> lock(access_);\n  toDestroy_.insert(toDestroy_.end(), s.begin(), s.end());\n}\n\nLuaScript::ScriptLoader& EntitySystem::get_script_loader() noexcept {\n  return server_->get_script_loader();\n}\n\nvoid EntitySystem::SendPacket(const std::shared_ptr<CMapClient>& sender, CMapServer::eSendType type,\n                            CRosePacket& _buffer) {\n  server_->SendPacket(sender, type, _buffer);\n}\n\nvoid EntitySystem::SendPacket(const CMapClient& sender, CMapServer::eSendType type, CRosePacket& _buffer) {\n  server_->SendPacket(sender, type, _buffer);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <string>\n#include <iostream>\nusing namespace std;\n\nint main(int _argc, char *_argv[])\n{\n\tif (_argc < 3)\n\t{\n\t\tcerr << \"Generator: No n provded\" << endl;\n\t\treturn -1;\n\t}\n\tsrand(stoi(_argv[1]));\n\tint n = stoi(string(_argv[2]));\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tputchar((rand()%('z' - 'a' + 1)) + 'a');\n\t}\n\treturn rand();\n}\n<commit_msg>Update generator.cpp<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <string>\n#include <iostream>\nusing namespace std;\n\nint main(int _argc, char *_argv[])\n{\n\tif (_argc < 3)\n\t{\n\t\tcerr << \"Generator: No n provided\" << endl;\n\t\treturn -1;\n\t}\n\tsrand(stoi(_argv[1]));\n\tint n = stoi(string(_argv[2]));\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tputchar((rand()%('z' - 'a' + 1)) + 'a');\n\t}\n\treturn rand();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"numeric\/numeric_type.h\"\n#include \"numeric\/numeric_op.h\"\n#include \"numeric\/wide_op.h\"\n\n#include \"iroha\/test_util.h\"\n\n#include <assert.h>\n#include <iostream>\n\nusing namespace iroha;\nusing namespace std;\n\nnamespace {\n\nclass Tool {\npublic:\n  static uint64_t GetValue(const Numeric &n, int idx) {\n    ASSERT(n.type_.IsWide());\n    return n.GetArray().value_[idx];\n  }\n};\n\n}  \/\/ namespace\n\nvoid Shift() {\n  TEST_CASE(\"Shift\");\n  Numeric n;\n  n.type_.SetWidth(512);\n  Op::Clear(n.type_, n.GetMutableArray());\n  n.SetValue0(0xfffffffffffffff0ULL);\n  cout << \"n=\" << n.Format() << \"\\n\";\n  ASSERT_EQ(0xfffffffffffffff0UL, n.GetValue0());\n  ASSERT_EQ(0, Tool::GetValue(n, 1));\n\n  Numeric m;\n  m.type_.SetWidth(512);\n  Op::Clear(m.type_, m.GetMutableArray());\n  \/\/ Left\n  cout << \"Left Shift\\n\";\n  WideOp::Shift(n.GetArray(), 1, true, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 1));\n\n  WideOp::Shift(n.GetArray(), 64, true, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(0, Tool::GetValue(m, 0));\n  ASSERT_EQ(Tool::GetValue(n, 0), Tool::GetValue(m, 1));\n\n  WideOp::Shift(n.GetArray(), 65, true, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 2));\n\n  WideOp::Shift(n.GetArray(), 385, true, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 7));\n\n  \/\/ Right\n  cout << \"Right Shift\\n\";\n  n = m;\n  WideOp::Shift(n.GetArray(), 0, false, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 7));\n\n  WideOp::Shift(n.GetArray(), 64, false, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 6));\n\n  WideOp::Shift(n.GetArray(), 65, false, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(0xfffffffffffffff0ULL, Tool::GetValue(m, 5));\n}\n\nvoid Concat() {\n  TEST_CASE(\"Concat\");\n  Numeric m, n;\n  m.type_.SetWidth(64);\n  m.SetValue0(0x5555555555555550ULL);\n  n.type_.SetWidth(63);\n  n.SetValue0(0x5555555555555550ULL);\n  Numeric r;\n  Op::Concat(m.GetArray(), m.type_, n.GetArray(), n.type_,\n\t     r.GetMutableArray(), &r.type_);\n  cout << \"r=\" << r.Format() << \"\\n\";\n  ASSERT(r.type_.GetWidth() == 127);\n  ASSERT_EQ(0x5555555555555550ULL, Tool::GetValue(r, 0));\n  ASSERT_EQ(0x2aaaaaaaaaaaaaa8ULL, Tool::GetValue(r, 1));\n}\n\nvoid Fixup() {\n  TEST_CASE(\"Fixup\");\n  Numeric n;\n  n.type_.SetWidth(68);\n  n.SetValue0(0xfffffffffffffff0ULL);\n  Numeric m;\n  WideOp::Shift(n.GetArray(), 16, true, m.GetMutableArray());\n  m.type_ = n.type_;\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(65535, Tool::GetValue(m, 1));\n\n  Op::FixupWidth(m.type_, &m);\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(15, Tool::GetValue(m, 1));\n}\n\nvoid Basic() {\n  TEST_CASE(\"Basic\");\n  Numeric n;\n  n.type_.SetWidth(64);\n  n.type_.SetIsSigned(true);\n  n.SetValue0(0xfffffffffffffff0ULL);\n  cout << \"n=\" << n.Format() << \"\\n\";\n  n.SetValue0(15);\n  cout << \"n=\" << n.Format() << \"\\n\";\n\n  Numeric w;\n  w.type_.SetWidth(512);\n  Op::Clear(w.type_, w.GetMutableArray());\n  cout << \"w=\" << w.Format() << \"\\n\";\n  ASSERT(Op::IsZero(w.type_, w.GetArray()));\n}\n\nvoid ExtraWide() {\n  TEST_CASE(\"ExtraWide\");\n  Numeric n;\n  Numeric::Clear(n.type_, n.GetMutableArray());\n  n.SetValue0(2);\n  n.type_.SetWidth(1024);\n  Numeric::MayExpandStorage(nullptr, &n);\n  ASSERT(n.GetValue0() == 2);\n\n  Numeric nn;\n  nn.type_.SetWidth(768);\n  Numeric::MayPopulateStorage(nn.type_, nullptr, nn.GetMutableArray());\n\n  Op::SelectBits(n.GetArray(), n.type_,\n\t\t 768, 1, nn.GetMutableArray(), nullptr);\n  ASSERT(nn.GetValue0() == 1);\n}\n\nint main(int argc, char **argv) {\n  cout << \"sizeof(width)=\" << sizeof(NumericWidth) << \"\\n\";\n  cout << \"sizeof(numeric)=\" << sizeof(Numeric) << \"\\n\";\n\n  Basic();\n  Shift();\n  Concat();\n  Fixup();\n  ExtraWide();\n\n  return 0;\n}\n<commit_msg>Fix valgrid complaints in numeric_test.<commit_after>#include \"numeric\/numeric_type.h\"\n#include \"numeric\/numeric_op.h\"\n#include \"numeric\/wide_op.h\"\n\n#include \"iroha\/test_util.h\"\n\n#include <assert.h>\n#include <iostream>\n\nusing namespace iroha;\nusing namespace std;\n\nnamespace {\n\nclass Tool {\npublic:\n  static uint64_t GetValue(const Numeric &n, int idx) {\n    ASSERT(n.type_.IsWide());\n    return n.GetArray().value_[idx];\n  }\n};\n\n}  \/\/ namespace\n\nvoid Shift() {\n  TEST_CASE(\"Shift\");\n  Numeric n;\n  n.type_.SetWidth(512);\n  Op::Clear(n.type_, n.GetMutableArray());\n  n.SetValue0(0xfffffffffffffff0ULL);\n  cout << \"n=\" << n.Format() << \"\\n\";\n  ASSERT_EQ(0xfffffffffffffff0UL, n.GetValue0());\n  ASSERT_EQ(0, Tool::GetValue(n, 1));\n\n  Numeric m;\n  m.type_.SetWidth(512);\n  Op::Clear(m.type_, m.GetMutableArray());\n  \/\/ Left\n  cout << \"Left Shift\\n\";\n  WideOp::Shift(n.GetArray(), 1, true, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 1));\n\n  WideOp::Shift(n.GetArray(), 64, true, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(0, Tool::GetValue(m, 0));\n  ASSERT_EQ(Tool::GetValue(n, 0), Tool::GetValue(m, 1));\n\n  WideOp::Shift(n.GetArray(), 65, true, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 2));\n\n  WideOp::Shift(n.GetArray(), 385, true, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 7));\n\n  \/\/ Right\n  cout << \"Right Shift\\n\";\n  n = m;\n  WideOp::Shift(n.GetArray(), 0, false, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 7));\n\n  WideOp::Shift(n.GetArray(), 64, false, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(1, Tool::GetValue(m, 6));\n\n  WideOp::Shift(n.GetArray(), 65, false, m.GetMutableArray());\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(0xfffffffffffffff0ULL, Tool::GetValue(m, 5));\n}\n\nvoid Concat() {\n  TEST_CASE(\"Concat\");\n  Numeric m, n;\n  Numeric::Clear(m.type_, m.GetMutableArray());\n  m.type_.SetWidth(64);\n  m.SetValue0(0x5555555555555550ULL);\n  Numeric::Clear(n.type_, n.GetMutableArray());\n  n.type_.SetWidth(63);\n  n.SetValue0(0x5555555555555550ULL);\n  Numeric r;\n  Op::Concat(m.GetArray(), m.type_, n.GetArray(), n.type_,\n\t     r.GetMutableArray(), &r.type_);\n  cout << \"r=\" << r.Format() << \"\\n\";\n  ASSERT(r.type_.GetWidth() == 127);\n  ASSERT_EQ(0x5555555555555550ULL, Tool::GetValue(r, 0));\n  ASSERT_EQ(0x2aaaaaaaaaaaaaa8ULL, Tool::GetValue(r, 1));\n}\n\nvoid Fixup() {\n  TEST_CASE(\"Fixup\");\n  Numeric n;\n  Numeric::Clear(n.type_, n.GetMutableArray());\n  n.type_.SetWidth(68);\n  n.SetValue0(0xfffffffffffffff0ULL);\n  Numeric m;\n  WideOp::Shift(n.GetArray(), 16, true, m.GetMutableArray());\n  m.type_ = n.type_;\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(65535, Tool::GetValue(m, 1));\n\n  Op::FixupWidth(m.type_, &m);\n  cout << \"m=\" << m.Format() << \"\\n\";\n  ASSERT_EQ(15, Tool::GetValue(m, 1));\n}\n\nvoid Basic() {\n  TEST_CASE(\"Basic\");\n  Numeric n;\n  n.type_.SetWidth(64);\n  n.type_.SetIsSigned(true);\n  n.SetValue0(0xfffffffffffffff0ULL);\n  cout << \"n=\" << n.Format() << \"\\n\";\n  n.SetValue0(15);\n  cout << \"n=\" << n.Format() << \"\\n\";\n\n  Numeric w;\n  w.type_.SetWidth(512);\n  Op::Clear(w.type_, w.GetMutableArray());\n  cout << \"w=\" << w.Format() << \"\\n\";\n  ASSERT(Op::IsZero(w.type_, w.GetArray()));\n}\n\nvoid ExtraWide() {\n  TEST_CASE(\"ExtraWide\");\n  Numeric n;\n  Numeric::Clear(n.type_, n.GetMutableArray());\n  n.SetValue0(2);\n  n.type_.SetWidth(1024);\n  Numeric::MayExpandStorage(nullptr, &n);\n  ASSERT(n.GetValue0() == 2);\n\n  Numeric nn;\n  nn.type_.SetWidth(768);\n  Numeric::MayPopulateStorage(nn.type_, nullptr, nn.GetMutableArray());\n\n  Op::SelectBits(n.GetArray(), n.type_,\n\t\t 768, 1, nn.GetMutableArray(), nullptr);\n  ASSERT(nn.GetValue0() == 1);\n}\n\nint main(int argc, char **argv) {\n  cout << \"sizeof(width)=\" << sizeof(NumericWidth) << \"\\n\";\n  cout << \"sizeof(numeric)=\" << sizeof(Numeric) << \"\\n\";\n\n  Basic();\n  Shift();\n  Concat();\n  Fixup();\n  ExtraWide();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tThis file is part of the E_Rendering library.\n\tCopyright (C) 2009-2012 Benjamin Eikel <benjamin@eikel.org>\n\tCopyright (C) 2009-2012 Claudius Jähn <claudius@uni-paderborn.de>\n\tCopyright (C) 2009-2012 Ralf Petring <ralf@petring.net>\n\t\n\tThis library is subject to the terms of the Mozilla Public License, v. 2.0.\n\tYou should have received a copy of the MPL along with this library; see the \n\tfile LICENSE. If not, you can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n*\/\n#include \"E_MeshBuilder.h\"\n\n#include \"..\/Mesh\/E_Mesh.h\"\n#include \"..\/Mesh\/E_VertexDescription.h\"\n#include \"..\/Texture\/E_Texture.h\"\n\n#include <E_Geometry\/E_Vec2.h>\n#include <E_Geometry\/E_Vec3.h>\n#include <E_Geometry\/E_Matrix4x4.h>\n#include <E_Geometry\/E_SRT.h>\n#include <E_Geometry\/E_Sphere.h>\n#include <E_Geometry\/E_Box.h>\n#include <E_Util\/Graphics\/E_Color.h>\n#include <E_Util\/Graphics\/E_Bitmap.h>\n#include <E_Util\/Graphics\/E_PixelAccessor.h>\n#include <Rendering\/Mesh\/VertexAttributeIds.h>\n#include <Rendering\/MeshUtils\/MeshUtils.h>\n\n#include <EScript\/Basics.h>\n#include <EScript\/StdObjects.h>\n\n#include <cmath>\n\nusing namespace Rendering;\nusing namespace Rendering::MeshUtils;\n\nnamespace E_Rendering {\n\t\n\/\/! (static)\nEScript::Type * E_MeshBuilder::getTypeObject() {\n\t\/\/ E_MeshBuilder ---|> Object\n\tstatic EScript::ERef<EScript::Type> typeObject = new EScript::Type(EScript::Object::getTypeObject());\n\treturn typeObject.get();\n}\n\n\/\/! initMembers\nvoid E_MeshBuilder::init(EScript::Namespace & lib) {\n\tEScript::Type * typeObject = getTypeObject();\n\tdeclareConstant(&lib,getClassName(),typeObject);\n\n\t\/\/ (static)\n\t\/\/! @name Deprecated\n\t\/\/! @{\n\n\t\/\/!\t[ESF] (static) Mesh Rendering.MeshBuilder.createArrow(Number radius, Number length)\n\t\/\/! @deprecated use Rendering.createArrow(...) instead.\n\tES_FUN(typeObject,\"createArrow\", 2, 2, (MeshBuilder::createArrow(parameter[0].toFloat(), parameter[1].toFloat())))\n\n\t\/\/! [ESF] (static) Mesh Rendering.MeshBuilder.createCone(Number radius, Number height, Number segments)\n\t\/\/! @deprecated use Rendering.createCone(...) instead.\n\tES_FUN(typeObject,\"createCone\", 3, 3, (MeshBuilder::createCone(parameter[0].toFloat(), parameter[1].toFloat(), parameter[2].to<uint32_t>(rt))))\n\n\t\/\/! [ESF] (static) Mesh Rendering.MeshBuilder.createConicalFrustum(Number radiusBottom, Number radiusTop, Number height, Number segments)\n\t\/\/! @deprecated use Rendering.createConicalFrustum(...) instead.\n\tES_FUN(typeObject,\"createConicalFrustum\", 4, 4, (MeshBuilder::createConicalFrustum(parameter[0].toFloat(), parameter[1].toFloat(), parameter[2].toFloat(), parameter[3].to<uint32_t>(rt))))\n\n\t\/\/! [ESF] (static) Mesh Rendering.MeshBuilder.createDiscSector(Number radius, Number segments, Number angle)\n\t\/\/! @deprecated use Rendering.createDiscSector(...) instead.\n\tES_FUNCTION(typeObject,\"createDiscSector\",2,3,{\n\t\tif (parameter.count() == 2) {\n\t\t\treturn EScript::create(MeshBuilder::createDiscSector(parameter[0].toFloat(), parameter[1].to<uint32_t>(rt)));\n\t\t} else {\n\t\t\treturn EScript::create(MeshBuilder::createDiscSector(parameter[0].toFloat(), parameter[1].to<uint32_t>(rt), parameter[2].toFloat()));\n\t\t}\n\t})\n\n\t\/*! [ESF] (static) Mesh Rendering.MeshBuilder.createDome(radius=100,\n\t\t\t\t\t\t\t\tint horiRes = 40, int vertRes = 40,\n\t\t\t\t\t\t\t\tdouble halfSphereFraction = 1.0,\n\t\t\t\t\t\t\t\tdouble imagePercentage = 1.0)\n\t\t\t\t\t\t\t\t @deprecated use Rendering.createDome(...) instead. *\/\n\tES_FUN(typeObject,\"createDome\",0,5,(MeshBuilder::createDome(\n\t\t\t\tparameter[0].toFloat(100.0),\n\t\t\t\tparameter[1].toInt(40),\n\t\t\t\tparameter[2].toInt(40),\n\t\t\t\tparameter[3].toFloat(1.0),\n\t\t\t\tparameter[4].toFloat(1.0))))\n\n\t\/\/!\t[ESF] (static) Mesh Rendering.MeshBuilder.createRectangle([VertexDescription],width,height)\n\t\/\/! @deprecated use Rendering.createRectangle(...) instead.\n\tES_FUNCTION(typeObject, \"createRectangle\", 2, 3, {\n\t\tif (parameter.count() == 3) {\n\t\t\treturn EScript::create(MeshBuilder::createRectangle(parameter[0].to<const VertexDescription&>(rt),parameter[1].toFloat(), parameter[2].toFloat()));\n\t\t} else {\n\t\t\tRendering::VertexDescription vertexDescription;\n\t\t\tvertexDescription.appendPosition3D();\n\t\t\tvertexDescription.appendNormalFloat();\n\t\t\tvertexDescription.appendColorRGBFloat();\n\t\t\tvertexDescription.appendTexCoord();\n\t\t\treturn EScript::create(MeshBuilder::createRectangle(vertexDescription,parameter[0].toFloat(), parameter[1].toFloat()));\n\t\t}\n\t})\n\n\t\/\/! [ESF] (static) Mesh Rendering.MeshBuilder.createRingSector(Number innerRadius, Number outerRadius, Number segments, Number angle)\n\t\/\/! @deprecated use Rendering.createRingSector(...) instead.\n\tES_FUNCTION(typeObject,\"createRingSector\",3,4,{\n\t\tif (parameter.count() == 3) {\n\t\t\treturn EScript::create(MeshBuilder::createRingSector(parameter[0].toFloat(), parameter[1].toFloat(), parameter[2].to<uint32_t>(rt)));\n\t\t} else {\n\t\t\treturn EScript::create(MeshBuilder::createRingSector(parameter[0].toFloat(), parameter[1].toFloat(), parameter[2].to<uint32_t>(rt), parameter[3].toFloat()));\n\t\t}\n\t})\n\n\t\/\/!\t[ESF] (static) Mesh Rendering.MeshBuilder.createSphere(Number, Number)\n\t\/\/! @deprecated use Rendering.(...) instead.\n\tES_FUNCTION(typeObject, \"createSphere\", 2, 2, {\n\t\tRendering::VertexDescription vertexDescription;\n\t\tvertexDescription.appendPosition3D();\n\t\tvertexDescription.appendNormalFloat();\n\t\tvertexDescription.appendColorRGBFloat();\n\t\tvertexDescription.appendTexCoord();\n\t\treturn EScript::create(MeshBuilder::createSphere(vertexDescription, parameter[0].to<uint32_t>(rt), parameter[1].to<uint32_t>(rt)));\n\t})\n\n\t\/\/!\t[ESF] (static) Mesh Rendering.MeshBuilder.createBox(Box)\n\t\/\/! @deprecated use Rendering.(...) instead.\n\tES_FUNCTION(typeObject, \"createBox\", 1, 1, {\n\t\tRendering::VertexDescription vertexDescription;\n\t\tvertexDescription.appendPosition3D();\n\t\tvertexDescription.appendNormalFloat();\n\t\tvertexDescription.appendColorRGBFloat();\n\t\tvertexDescription.appendTexCoord();\n\t\treturn EScript::create(MeshBuilder::createBox(vertexDescription, parameter[0].to<Geometry::Box>(rt)));\n\t})\n\n\t\/\/ EXPERIMENTAL!!!!!!!!!!!!!!\n\t\/\/!\t[ESMF] new Rendering.MeshBuilder.createMeshFromBitmaps(Util.Bitmap depth[, Util.Bitmap color[, Util.Bitmap normals]])\n\t\/\/! @deprecated use Rendering.createMeshFromBitmaps(...) instead.\n\tES_FUNCTION(typeObject,\"createMeshFromBitmaps\",1,3,{\n\t\tUtil::Reference<Util::Bitmap> depth = parameter[0].to<Util::Reference<Util::Bitmap>>(rt);\n\t\tUtil::Reference<Util::Bitmap> color;\n\t\tUtil::Reference<Util::Bitmap> normal;\n\n\t\tRendering::VertexDescription vertexDescription;\n\t\tvertexDescription.appendPosition3D();\n\t\tif(parameter.count()>1){\n\t\t\tcolor = parameter[1].to<Util::Reference<Util::Bitmap>>(rt);\n\t\t\tvertexDescription.appendColorRGBAByte();\n\t\t}\n\t\tif(parameter.count()>2){\n\t\t\tnormal = parameter[2].to<Util::Reference<Util::Bitmap>>(rt);\n\t\t\tvertexDescription.appendNormalByte();\n\t\t}\n\t\tMesh * m=MeshBuilder::createMeshFromBitmaps(vertexDescription,\n\t\t\t\t\t\t\t\t\t\t\t\t\tstd::move(depth), \n\t\t\t\t\t\t\t\t\t\t\t\t\tstd::move(color), \n\t\t\t\t\t\t\t\t\t\t\t\t\tstd::move(normal));\n\t\tif(m)\n\t\t\treturn EScript::create(m);\n\t\telse return nullptr;\n\t})\n\n\t\/\/!\t[ESF] (static) Mesh Rendering.MeshBuilder.createHexGrid(VertexDescription, Number width, Number height, Number rows, Number columns)\n\t\/\/! @deprecated use Rendering.createHexGrid(...) instead.\n\tES_FUN(typeObject,\"createHexGrid\", 5, 5,(\n\t\tMeshBuilder::createHexGrid(parameter[0].to<const VertexDescription&>(rt), parameter[1].toFloat(), parameter[2].toFloat(), parameter[3].toUInt(), parameter[4].toUInt())\n\t))\n\t\/\/ ----\n\t\n\t\/\/!\t[ESF] (static) Mesh Rendering.MeshBuilder.createVoxelMesh(VertexDescription, Util.PixelAccessor voxelBitmap, Number depth)\n\t\/\/! @deprecated use Rendering.createVoxelMesh(...) instead.\n\tES_FUN(typeObject,\"createVoxelMesh\", 3, 3,(\n\t\tMeshBuilder::createVoxelMesh(parameter[0].to<const VertexDescription&>(rt), parameter[1].to<Util::PixelAccessor&>(rt), parameter[2].toUInt())\n\t))\n\t\/\/ ----\n\n\t\/\/!\t[ESF] (static) Mesh Rendering.MeshBuilder.createTorus(Number, Number, Number, Number)\n\t\/\/! @deprecated use Rendering.createTorus(...) instead.\n\tES_FUNCTION(typeObject, \"createTorus\", 4, 4, {\n\t\tRendering::VertexDescription vertexDescription;\n\t\tvertexDescription.appendPosition3D();\n\t\tvertexDescription.appendNormalFloat();\n\t\tvertexDescription.appendColorRGBFloat();\n\t\tvertexDescription.appendTexCoord();\n\t\treturn EScript::create(MeshBuilder::createTorus(vertexDescription, parameter[0].toFloat(), parameter[1].toFloat(), parameter[2].toUInt(), parameter[3].toUInt()));\n\t})\n\t\/\/! @}\n\t\t\n\t\/\/ --------------------------------------------------\n\n\t\/\/!\t[ESMF] new Rendering.MeshBuilder( [VertexDescription] )\n\tES_CONSTRUCTOR(typeObject,0,1, {\n\t\tif(parameter.count()==0)\n\t\t\treturn EScript::create(new MeshBuilder);\n\t\telse\n\t\t\treturn EScript::create(new MeshBuilder(parameter[0].to<const VertexDescription&>(rt)));\n\t})\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addIndex( idx )\n\tES_MFUN(typeObject,MeshBuilder,\"addIndex\",1,1,\n\t\t\t\t(thisObj->addIndex( parameter[0].to<uint32_t>(rt)),thisEObj))\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addQuad( idx,idx,idx,idx )\n\tES_MFUN(typeObject,MeshBuilder,\"addQuad\",4,4,\n\t\t\t\t(thisObj->addQuad( parameter[0].to<uint32_t>(rt),parameter[1].to<uint32_t>(rt),parameter[2].to<uint32_t>(rt),parameter[3].to<uint32_t>(rt)),thisEObj))\n\t\t\t\t\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addSphere( Sphere,inclinationSegments,azimuthSegments )\n\t\/\/ES_MFUN(typeObject,MeshBuilder,\"addSphere\",3,3,\n\t\/\/\t\t\t(MeshBuilder::addSphere(*thisObj,parameter[0].to<Geometry::Sphere_f>(rt),parameter[1].to<uint32_t>(rt),parameter[2].to<uint32_t>(rt)),thisEObj))\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addBox( Box )\n\t\/\/ES_MFUN(typeObject,MeshBuilder,\"addBox\",1,1,\n\t\/\/\t\t\t(MeshBuilder::addBox(*thisObj,parameter[0].to<Geometry::Box>(rt)),thisEObj))\n\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addTriangle( idx,idx,idx )\n\tES_MFUN(typeObject,MeshBuilder,\"addTriangle\",3,3,\n\t\t\t\t(thisObj->addTriangle( parameter[0].to<uint32_t>(rt),parameter[1].to<uint32_t>(rt),parameter[2].to<uint32_t>(rt)),thisEObj))\n\n\t\/\/!\t[ESMF] Number MeshBuilder.addVertex( [Vec3f pos ,Vec3 normal, float r, g, b, a, float u, v )\n\tES_MFUNCTION(typeObject,MeshBuilder,\"addVertex\",0,8,{\n\t\tuint32_t index=0;\n\t\tif(parameter.count() == 8) {\n\t\t\tindex=thisObj->addVertex(\n\t\t\t\t\tparameter[0].to<Geometry::Vec3>(rt), \/\/ pos\n\t\t\t\t\tparameter[1].to<Geometry::Vec3>(rt), \/\/ normal\n\t\t\t\t\tparameter[2].toFloat(),\tparameter[3].toFloat(),\tparameter[4].toFloat(), parameter[5].toFloat(),\t \/\/ color\n\t\t\t\t\tparameter[6].toFloat(),\tparameter[7].toFloat()); \/\/ tex0\n\t\t}\n\t\telse {\n\t\t\tassertParamCount(rt,parameter.count(),0,0);\n\t\t\tindex=thisObj->addVertex();\n\t\t}\n\t\treturn index;\n\t})\n\t\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addMesh( Mesh )\n\tES_MFUN(typeObject,MeshBuilder,\"addMesh\",1,1,\n\t\t\t\t(thisObj->addMesh(parameter[0].to<Rendering::Mesh*>(rt)),thisEObj))\n\n\t\/\/!\t[ESMF] E_Mesh MeshBuilder.buildMesh()\n\tES_MFUN(typeObject,MeshBuilder, \"buildMesh\", 0, 0, thisObj->buildMesh())\n\n\t\/\/! int MeshBuilder.getNextIndex()\n\tES_MFUN(typeObject,MeshBuilder,\"getNextIndex\",0,0,thisObj->getNextIndex())\n\t\n\t\/\/! Matrix4x4 MeshBuilder.getTransformation()\n\tES_MFUN(typeObject,MeshBuilder,\"getTransformation\",0,0,thisObj->getTransformation())\n\n\t\/\/! bool MeshBuilder.isEmpty()\n\tES_MFUN(typeObject,MeshBuilder,\"isEmpty\",0,0,thisObj->isEmpty())\n\t\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.position( Vec3, [String attribute] )\n\tES_MFUN(typeObject,MeshBuilder,\"position\",1,2,\n\t\t\t\t( thisObj->position( parameter[0].to<Geometry::Vec3>(rt), parameter[1].toString(VertexAttributeIds::POSITION.toString())),thisEObj))\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.position2D(Vec2, [String attribute])\n\tES_MFUN(typeObject,MeshBuilder, \"position2D\", 1, 2,\n\t\t\t\t (thisObj->position(parameter[0].to<Geometry::Vec2>(rt), parameter[1].toString(VertexAttributeIds::POSITION.toString())),thisEObj))\n\t\t\t\t \n \t\/\/!\t[ESMF] thisEObj MeshBuilder.position4D(Vec4, [String attribute])\n \tES_MFUN(typeObject,MeshBuilder, \"position4D\", 1, 2,\n \t\t\t\t (thisObj->position(parameter[0].to<Geometry::Vec4>(rt), parameter[1].toString(VertexAttributeIds::POSITION.toString())),thisEObj))\n\n \t\/\/!\t[ESMF] thisEObj MeshBuilder.normal( Vec3, [String attribute] )\n \tES_MFUN(typeObject,MeshBuilder,\"normal\",1,2,\n \t\t\t\t( thisObj->normal( parameter[0].to<Geometry::Vec3>(rt), parameter[1].toString(VertexAttributeIds::NORMAL.toString())),thisEObj))\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.color( Color4f | Color4ub, [String attribute] )\n\tES_MFUN(typeObject,MeshBuilder,\"color\",1,2,\n\t\t\t\t( thisObj->color(parameter[0].to<Util::Color4f>(rt), parameter[1].toString(VertexAttributeIds::COLOR.toString())),thisEObj))\n\t\t\t\t \n\t\/\/!\t[ESMF] thisEObj MeshBuilder.texCoord0( Vec2, [String attribute] )\n\tES_MFUN(typeObject,MeshBuilder,\"texCoord0\",1,2,\n\t\t\t\t( thisObj->texCoord0( parameter[0].to<Geometry::Vec2>(rt), parameter[1].toString(VertexAttributeIds::TEXCOORD0.toString())),thisEObj))\n\t\t\t\n\t\/\/! [ESMF] thisEObj MeshBuilder.value(Number value, String attribute)\n\tES_MFUN(typeObject,MeshBuilder,\"value\",2,2,(thisObj->value(parameter[0].toFloat(), parameter[1].toString()),thisEObj))\n\n\t\/\/! [ESMF] thisEObj MeshBuilder.values(Array values, String attribute)\n\tES_MFUNCTION(typeObject,MeshBuilder,\"values\",2,2,{\n\t\tEScript::Array * a=parameter[0].to<EScript::Array*>(rt);\n\t\tstd::vector<float> values;\n\t\tfor(auto v : *a)\n\t\t\tvalues.push_back(v.toFloat());\n\t\tthisObj->values(values, parameter[1].toString());\n\t\treturn thisEObj;\n\t})\n\t\t\n\t\/\/! [ESMF] thisEObj MeshBuilder.valueUInt(Number value, String attribute)\n\tES_MFUN(typeObject,MeshBuilder,\"valueUInt\",2,2,(thisObj->value(parameter[0].toUInt(), parameter[1].toString()),thisEObj))\n\n\t\/\/! [ESMF] thisEObj MeshBuilder.valuesUInt(Array values, String attribute)\n\tES_MFUNCTION(typeObject,MeshBuilder,\"valuesUInt\",2,2,{\n\t\tEScript::Array * a=parameter[0].to<EScript::Array*>(rt);\n\t\tstd::vector<uint32_t> values;\n\t\tfor(auto v : *a)\n\t\t\tvalues.push_back(v.toUInt());\n\t\tthisObj->values(values, parameter[1].toString());\n\t\treturn thisEObj;\n\t})\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.setTransformation( Matrix4x4 | SRT )\n\tES_MFUNCTION(typeObject,MeshBuilder,\"setTransformation\",1,1,{\n\t\tE_Geometry::E_Matrix4x4 * em = parameter[0].toType<E_Geometry::E_Matrix4x4>();\n\t\tif(em){\n\t\t\tthisObj->setTransformation(em->ref());\n\t\t}else{\n\t\t\tthisObj->setTransformation(parameter[0].to<const Geometry::SRT&>(rt));\n\t\t}\n\t\treturn thisEObj;\n\t})\n\t\t\t\t\n\n}\n\n}\n<commit_msg>removed bindings for deprecated functions<commit_after>\/*\n\tThis file is part of the E_Rendering library.\n\tCopyright (C) 2009-2012 Benjamin Eikel <benjamin@eikel.org>\n\tCopyright (C) 2009-2012 Claudius Jähn <claudius@uni-paderborn.de>\n\tCopyright (C) 2009-2012 Ralf Petring <ralf@petring.net>\n\t\n\tThis library is subject to the terms of the Mozilla Public License, v. 2.0.\n\tYou should have received a copy of the MPL along with this library; see the \n\tfile LICENSE. If not, you can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n*\/\n#include \"E_MeshBuilder.h\"\n\n#include \"..\/Mesh\/E_Mesh.h\"\n#include \"..\/Mesh\/E_VertexDescription.h\"\n#include \"..\/Texture\/E_Texture.h\"\n\n#include <E_Geometry\/E_Vec2.h>\n#include <E_Geometry\/E_Vec3.h>\n#include <E_Geometry\/E_Matrix4x4.h>\n#include <E_Geometry\/E_SRT.h>\n#include <E_Geometry\/E_Sphere.h>\n#include <E_Geometry\/E_Box.h>\n#include <E_Util\/Graphics\/E_Color.h>\n#include <E_Util\/Graphics\/E_Bitmap.h>\n#include <E_Util\/Graphics\/E_PixelAccessor.h>\n#include <Rendering\/Mesh\/VertexAttributeIds.h>\n#include <Rendering\/MeshUtils\/MeshUtils.h>\n\n#include <EScript\/Basics.h>\n#include <EScript\/StdObjects.h>\n\n#include <cmath>\n\nusing namespace Rendering;\nusing namespace Rendering::MeshUtils;\n\nnamespace E_Rendering {\n\t\n\/\/! (static)\nEScript::Type * E_MeshBuilder::getTypeObject() {\n\t\/\/ E_MeshBuilder ---|> Object\n\tstatic EScript::ERef<EScript::Type> typeObject = new EScript::Type(EScript::Object::getTypeObject());\n\treturn typeObject.get();\n}\n\n\/\/! initMembers\nvoid E_MeshBuilder::init(EScript::Namespace & lib) {\n\tEScript::Type * typeObject = getTypeObject();\n\tdeclareConstant(&lib,getClassName(),typeObject);\n\t\n\t\/\/!\t[ESMF] new Rendering.MeshBuilder( [VertexDescription] )\n\tES_CONSTRUCTOR(typeObject,0,1, {\n\t\tif(parameter.count()==0)\n\t\t\treturn EScript::create(new MeshBuilder);\n\t\telse\n\t\t\treturn EScript::create(new MeshBuilder(parameter[0].to<const VertexDescription&>(rt)));\n\t})\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addIndex( idx )\n\tES_MFUN(typeObject,MeshBuilder,\"addIndex\",1,1,\n\t\t\t\t(thisObj->addIndex( parameter[0].to<uint32_t>(rt)),thisEObj))\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addQuad( idx,idx,idx,idx )\n\tES_MFUN(typeObject,MeshBuilder,\"addQuad\",4,4,\n\t\t\t\t(thisObj->addQuad( parameter[0].to<uint32_t>(rt),parameter[1].to<uint32_t>(rt),parameter[2].to<uint32_t>(rt),parameter[3].to<uint32_t>(rt)),thisEObj))\n\t\t\t\t\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addSphere( Sphere,inclinationSegments,azimuthSegments )\n\t\/\/ES_MFUN(typeObject,MeshBuilder,\"addSphere\",3,3,\n\t\/\/\t\t\t(MeshBuilder::addSphere(*thisObj,parameter[0].to<Geometry::Sphere_f>(rt),parameter[1].to<uint32_t>(rt),parameter[2].to<uint32_t>(rt)),thisEObj))\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addBox( Box )\n\t\/\/ES_MFUN(typeObject,MeshBuilder,\"addBox\",1,1,\n\t\/\/\t\t\t(MeshBuilder::addBox(*thisObj,parameter[0].to<Geometry::Box>(rt)),thisEObj))\n\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addTriangle( idx,idx,idx )\n\tES_MFUN(typeObject,MeshBuilder,\"addTriangle\",3,3,\n\t\t\t\t(thisObj->addTriangle( parameter[0].to<uint32_t>(rt),parameter[1].to<uint32_t>(rt),parameter[2].to<uint32_t>(rt)),thisEObj))\n\n\t\/\/!\t[ESMF] Number MeshBuilder.addVertex()\n\tES_MFUN(typeObject,MeshBuilder,\"addVertex\",0,0, thisObj->addVertex())\n\t\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.addMesh( Mesh )\n\tES_MFUN(typeObject,MeshBuilder,\"addMesh\",1,1,\n\t\t\t\t(thisObj->addMesh(parameter[0].to<Rendering::Mesh*>(rt)),thisEObj))\n\n\t\/\/!\t[ESMF] E_Mesh MeshBuilder.buildMesh()\n\tES_MFUN(typeObject,MeshBuilder, \"buildMesh\", 0, 0, thisObj->buildMesh())\n\n\t\/\/! int MeshBuilder.getNextIndex()\n\tES_MFUN(typeObject,MeshBuilder,\"getNextIndex\",0,0,thisObj->getNextIndex())\n\t\n\t\/\/! Matrix4x4 MeshBuilder.getTransformation()\n\tES_MFUN(typeObject,MeshBuilder,\"getTransformation\",0,0,thisObj->getTransformation())\n\n\t\/\/! bool MeshBuilder.isEmpty()\n\tES_MFUN(typeObject,MeshBuilder,\"isEmpty\",0,0,thisObj->isEmpty())\n\t\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.position( Vec3, [String attribute] )\n\tES_MFUN(typeObject,MeshBuilder,\"position\",1,2,\n\t\t\t\t( thisObj->position( parameter[0].to<Geometry::Vec3>(rt), parameter[1].toString(VertexAttributeIds::POSITION.toString())),thisEObj))\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.position2D(Vec2, [String attribute])\n\tES_MFUN(typeObject,MeshBuilder, \"position2D\", 1, 2,\n\t\t\t\t (thisObj->position(parameter[0].to<Geometry::Vec2>(rt), parameter[1].toString(VertexAttributeIds::POSITION.toString())),thisEObj))\n\t\t\t\t \n \t\/\/!\t[ESMF] thisEObj MeshBuilder.position4D(Vec4, [String attribute])\n \tES_MFUN(typeObject,MeshBuilder, \"position4D\", 1, 2,\n \t\t\t\t (thisObj->position(parameter[0].to<Geometry::Vec4>(rt), parameter[1].toString(VertexAttributeIds::POSITION.toString())),thisEObj))\n\n \t\/\/!\t[ESMF] thisEObj MeshBuilder.normal( Vec3, [String attribute] )\n \tES_MFUN(typeObject,MeshBuilder,\"normal\",1,2,\n \t\t\t\t( thisObj->normal( parameter[0].to<Geometry::Vec3>(rt), parameter[1].toString(VertexAttributeIds::NORMAL.toString())),thisEObj))\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.color( Color4f | Color4ub, [String attribute] )\n\tES_MFUN(typeObject,MeshBuilder,\"color\",1,2,\n\t\t\t\t( thisObj->color(parameter[0].to<Util::Color4f>(rt), parameter[1].toString(VertexAttributeIds::COLOR.toString())),thisEObj))\n\t\t\t\t \n\t\/\/!\t[ESMF] thisEObj MeshBuilder.texCoord0( Vec2, [String attribute] )\n\tES_MFUN(typeObject,MeshBuilder,\"texCoord0\",1,2,\n\t\t\t\t( thisObj->texCoord0( parameter[0].to<Geometry::Vec2>(rt), parameter[1].toString(VertexAttributeIds::TEXCOORD0.toString())),thisEObj))\n\t\t\t\n\t\/\/! [ESMF] thisEObj MeshBuilder.value(Number value, String attribute)\n\tES_MFUN(typeObject,MeshBuilder,\"value\",2,2,(thisObj->value(parameter[0].toFloat(), parameter[1].toString()),thisEObj))\n\n\t\/\/! [ESMF] thisEObj MeshBuilder.values(Array values, String attribute)\n\tES_MFUNCTION(typeObject,MeshBuilder,\"values\",2,2,{\n\t\tEScript::Array * a=parameter[0].to<EScript::Array*>(rt);\n\t\tstd::vector<float> values;\n\t\tfor(auto v : *a)\n\t\t\tvalues.push_back(v.toFloat());\n\t\tthisObj->values(values, parameter[1].toString());\n\t\treturn thisEObj;\n\t})\n\t\t\n\t\/\/! [ESMF] thisEObj MeshBuilder.valueUInt(Number value, String attribute)\n\tES_MFUN(typeObject,MeshBuilder,\"valueUInt\",2,2,(thisObj->value(parameter[0].toUInt(), parameter[1].toString()),thisEObj))\n\n\t\/\/! [ESMF] thisEObj MeshBuilder.valuesUInt(Array values, String attribute)\n\tES_MFUNCTION(typeObject,MeshBuilder,\"valuesUInt\",2,2,{\n\t\tEScript::Array * a=parameter[0].to<EScript::Array*>(rt);\n\t\tstd::vector<uint32_t> values;\n\t\tfor(auto v : *a)\n\t\t\tvalues.push_back(v.toUInt());\n\t\tthisObj->values(values, parameter[1].toString());\n\t\treturn thisEObj;\n\t})\n\n\t\/\/!\t[ESMF] thisEObj MeshBuilder.setTransformation( Matrix4x4 | SRT )\n\tES_MFUNCTION(typeObject,MeshBuilder,\"setTransformation\",1,1,{\n\t\tE_Geometry::E_Matrix4x4 * em = parameter[0].toType<E_Geometry::E_Matrix4x4>();\n\t\tif(em){\n\t\t\tthisObj->setTransformation(em->ref());\n\t\t}else{\n\t\t\tthisObj->setTransformation(parameter[0].to<const Geometry::SRT&>(rt));\n\t\t}\n\t\treturn thisEObj;\n\t})\n\t\t\t\t\n\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Align doxygen asterisks.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Author: Enrico Guiraud, Danilo Piparo CERN  09\/2018\n\n\/*************************************************************************\n * Copyright (C) 1995-2018, 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#ifndef ROOT_RFILTER\n#define ROOT_RFILTER\n\n#include \"ROOT\/RDF\/ColumnReaderUtils.hxx\"\n#include \"ROOT\/RDF\/RColumnReaderBase.hxx\"\n#include \"ROOT\/RDF\/RCutFlowReport.hxx\"\n#include \"ROOT\/RDF\/Utils.hxx\"\n#include \"ROOT\/RDF\/RFilterBase.hxx\"\n#include \"ROOT\/RDF\/RLoopManager.hxx\"\n#include \"ROOT\/TypeTraits.hxx\"\n#include \"RtypesCore.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <utility> \/\/ std::index_sequence\n#include <vector>\n\nnamespace ROOT {\n\nnamespace Internal {\nnamespace RDF {\nusing namespace ROOT::Detail::RDF;\n\n\/\/ fwd decl for RFilter\nnamespace GraphDrawing {\nstd::shared_ptr<GraphNode>\nCreateFilterNode(const RFilterBase *filterPtr, std::unordered_map<void *, std::shared_ptr<GraphNode>> &visitedMap);\n\nstd::shared_ptr<GraphNode> AddDefinesToGraph(std::shared_ptr<GraphNode> node,\n                                             const RDFInternal::RColumnRegister &colRegister,\n                                             const std::vector<std::string> &prevNodeDefines,\n                                             std::unordered_map<void *, std::shared_ptr<GraphNode>> &visitedMap);\n} \/\/ ns GraphDrawing\n\n} \/\/ ns RDF\n} \/\/ ns Internal\n\nnamespace Detail {\nnamespace RDF {\nusing namespace ROOT::TypeTraits;\nnamespace RDFGraphDrawing = ROOT::Internal::RDF::GraphDrawing;\n\ntemplate <typename FilterF, typename PrevNode>\nclass R__CLING_PTRCHECK(off) RFilter final : public RFilterBase {\n   using ColumnTypes_t = typename CallableTraits<FilterF>::arg_types;\n   using TypeInd_t = std::make_index_sequence<ColumnTypes_t::list_size>;\n\n   FilterF fFilter;\n   \/\/\/ Column readers per slot and per input column\n   std::vector<std::array<std::unique_ptr<RColumnReaderBase>, ColumnTypes_t::list_size>> fValues;\n   const std::shared_ptr<PrevNode> fPrevNodePtr;\n   PrevNode &fPrevNode;\n\n   std::unordered_map<std::string, std::shared_ptr<RFilterBase>> fVariedFilters;\n\npublic:\n   RFilter(FilterF f, const ROOT::RDF::ColumnNames_t &columns, std::shared_ptr<PrevNode> pd,\n           const RDFInternal::RColumnRegister &colRegister, std::string_view name = \"\",\n           const std::string &variationName = \"nominal\")\n      : RFilterBase(pd->GetLoopManagerUnchecked(), name, pd->GetLoopManagerUnchecked()->GetNSlots(), colRegister,\n                    columns, pd->GetVariations(), variationName),\n        fFilter(std::move(f)), fValues(pd->GetLoopManagerUnchecked()->GetNSlots()), fPrevNodePtr(std::move(pd)),\n        fPrevNode(*fPrevNodePtr)\n   {\n   }\n\n   RFilter(const RFilter &) = delete;\n   RFilter &operator=(const RFilter &) = delete;\n   ~RFilter() {\n      \/\/ must Deregister objects from the RLoopManager here, before the fPrevNode data member is destroyed:\n      \/\/ otherwise if fPrevNode is the RLoopManager, it will be destroyed before the calls to Deregister happen.\n      fColRegister.Clear(); \/\/ triggers RDefine deregistration\n      fLoopManager->Deregister(this);\n   }\n\n   bool CheckFilters(unsigned int slot, Long64_t entry) final\n   {\n      if (entry != fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()]) {\n         if (!fPrevNode.CheckFilters(slot, entry)) {\n            \/\/ a filter upstream returned false, cache the result\n            fLastResult[slot * RDFInternal::CacheLineStep<int>()] = false;\n         } else {\n            \/\/ evaluate this filter, cache the result\n            auto passed = CheckFilterHelper(slot, entry, ColumnTypes_t{}, TypeInd_t{});\n            passed ? ++fAccepted[slot * RDFInternal::CacheLineStep<ULong64_t>()]\n                   : ++fRejected[slot * RDFInternal::CacheLineStep<ULong64_t>()];\n            fLastResult[slot * RDFInternal::CacheLineStep<int>()] = passed;\n         }\n         fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()] = entry;\n      }\n      return fLastResult[slot * RDFInternal::CacheLineStep<int>()];\n   }\n\n   template <typename... ColTypes, std::size_t... S>\n   bool CheckFilterHelper(unsigned int slot, Long64_t entry, TypeList<ColTypes...>, std::index_sequence<S...>)\n   {\n      \/\/ silence \"unused parameter\" warnings in gcc\n      (void)slot;\n      (void)entry;\n      return fFilter(fValues[slot][S]->template Get<ColTypes>(entry)...);\n   }\n\n   void InitSlot(TTreeReader *r, unsigned int slot) final\n   {\n      RDFInternal::RColumnReadersInfo info{fColumnNames, fColRegister, fIsDefine.data(), fLoopManager->GetDSValuePtrs(),\n                                           fLoopManager->GetDataSource()};\n      fValues[slot] = RDFInternal::MakeColumnReaders(slot, r, ColumnTypes_t{}, info, fVariation);\n      fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()] = -1;\n   }\n\n   \/\/ recursive chain of `Report`s\n   void Report(ROOT::RDF::RCutFlowReport &rep) const final { PartialReport(rep); }\n\n   void PartialReport(ROOT::RDF::RCutFlowReport &rep) const final\n   {\n      fPrevNode.PartialReport(rep);\n      FillReport(rep);\n   }\n\n   void StopProcessing() final\n   {\n      ++fNStopsReceived;\n      if (fNStopsReceived == fNChildren)\n         fPrevNode.StopProcessing();\n   }\n\n   void IncrChildrenCount() final\n   {\n      ++fNChildren;\n      \/\/ propagate \"children activation\" upstream. named filters do the propagation via `TriggerChildrenCount`.\n      if (fNChildren == 1 && fName.empty())\n         fPrevNode.IncrChildrenCount();\n   }\n\n   void TriggerChildrenCount() final\n   {\n      assert(!fName.empty()); \/\/ this method is to only be called on named filters\n      fPrevNode.IncrChildrenCount();\n   }\n\n   void AddFilterName(std::vector<std::string> &filters)\n   {\n      fPrevNode.AddFilterName(filters);\n      auto name = (HasName() ? fName : \"Unnamed Filter\");\n      filters.push_back(name);\n   }\n\n   \/\/\/ Clean-up operations to be performed at the end of a task.\n   void FinalizeSlot(unsigned int slot) final\n   {\n      for (auto &v : fValues[slot])\n         v.reset();\n   }\n\n   std::shared_ptr<RDFGraphDrawing::GraphNode>\n   GetGraph(std::unordered_map<void *, std::shared_ptr<RDFGraphDrawing::GraphNode>> &visitedMap)\n   {\n      \/\/ Recursively call for the previous node.\n      auto prevNode = fPrevNode.GetGraph(visitedMap);\n      auto prevColumns = prevNode->GetDefinedColumns();\n\n      auto thisNode = RDFGraphDrawing::CreateFilterNode(this, visitedMap);\n\n      \/* If the returned node is not new, there is no need to perform any other operation.\n       * This is a likely scenario when building the entire graph in which branches share\n       * some nodes. *\/\n      if (!thisNode->GetIsNew()) {\n         return thisNode;\n      }\n\n      auto upmostNode = AddDefinesToGraph(thisNode, fColRegister, prevColumns, visitedMap);\n\n      \/\/ Keep track of the columns defined up to this point.\n      thisNode->AddDefinedColumns(fColRegister.GetNames());\n\n      upmostNode->SetPrevNode(prevNode);\n      return thisNode;\n   }\n\n   \/\/\/ Return a clone of this Filter that works with values in the variationName \"universe\".\n   std::shared_ptr<RNodeBase> GetVariedFilter(const std::string &variationName) final\n   {\n      auto it = fVariedFilters.find(variationName);\n      if (it != fVariedFilters.end())\n         return it->second;\n\n      auto prevNode = fPrevNodePtr;\n      if ((void *)fPrevNodePtr.get() != (void *)fLoopManager && variationName != \"nominal\")\n         prevNode = std::static_pointer_cast<PrevNode>(prevNode->GetVariedFilter(variationName));\n\n      \/\/ the varied filters get a copy of the callable object.\n      \/\/ TODO document this\n      auto variedFilter = std::unique_ptr<RFilterBase>(\n         new RFilter(fFilter, fColumnNames, std::move(prevNode), fColRegister, fName, variationName));\n      fLoopManager->Book(variedFilter.get());\n      auto e = fVariedFilters.insert({variationName, std::move(variedFilter)});\n      return e.first->second;\n   }\n};\n\n} \/\/ ns RDF\n} \/\/ ns Detail\n} \/\/ ns ROOT\n\n#endif \/\/ ROOT_RFILTER\n<commit_msg>[DF] Simplify GetVariedFilter<commit_after>\/\/ Author: Enrico Guiraud, Danilo Piparo CERN  09\/2018\n\n\/*************************************************************************\n * Copyright (C) 1995-2018, 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#ifndef ROOT_RFILTER\n#define ROOT_RFILTER\n\n#include \"ROOT\/RDF\/ColumnReaderUtils.hxx\"\n#include \"ROOT\/RDF\/RColumnReaderBase.hxx\"\n#include \"ROOT\/RDF\/RCutFlowReport.hxx\"\n#include \"ROOT\/RDF\/Utils.hxx\"\n#include \"ROOT\/RDF\/RFilterBase.hxx\"\n#include \"ROOT\/RDF\/RLoopManager.hxx\"\n#include \"ROOT\/TypeTraits.hxx\"\n#include \"RtypesCore.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <utility> \/\/ std::index_sequence\n#include <vector>\n\nnamespace ROOT {\n\nnamespace Internal {\nnamespace RDF {\nusing namespace ROOT::Detail::RDF;\n\n\/\/ fwd decl for RFilter\nnamespace GraphDrawing {\nstd::shared_ptr<GraphNode>\nCreateFilterNode(const RFilterBase *filterPtr, std::unordered_map<void *, std::shared_ptr<GraphNode>> &visitedMap);\n\nstd::shared_ptr<GraphNode> AddDefinesToGraph(std::shared_ptr<GraphNode> node,\n                                             const RDFInternal::RColumnRegister &colRegister,\n                                             const std::vector<std::string> &prevNodeDefines,\n                                             std::unordered_map<void *, std::shared_ptr<GraphNode>> &visitedMap);\n} \/\/ ns GraphDrawing\n\n} \/\/ ns RDF\n} \/\/ ns Internal\n\nnamespace Detail {\nnamespace RDF {\nusing namespace ROOT::TypeTraits;\nnamespace RDFGraphDrawing = ROOT::Internal::RDF::GraphDrawing;\n\ntemplate <typename FilterF, typename PrevNode>\nclass R__CLING_PTRCHECK(off) RFilter final : public RFilterBase {\n   using ColumnTypes_t = typename CallableTraits<FilterF>::arg_types;\n   using TypeInd_t = std::make_index_sequence<ColumnTypes_t::list_size>;\n\n   FilterF fFilter;\n   \/\/\/ Column readers per slot and per input column\n   std::vector<std::array<std::unique_ptr<RColumnReaderBase>, ColumnTypes_t::list_size>> fValues;\n   const std::shared_ptr<PrevNode> fPrevNodePtr;\n   PrevNode &fPrevNode;\n\n   std::unordered_map<std::string, std::shared_ptr<RFilterBase>> fVariedFilters;\n\npublic:\n   RFilter(FilterF f, const ROOT::RDF::ColumnNames_t &columns, std::shared_ptr<PrevNode> pd,\n           const RDFInternal::RColumnRegister &colRegister, std::string_view name = \"\",\n           const std::string &variationName = \"nominal\")\n      : RFilterBase(pd->GetLoopManagerUnchecked(), name, pd->GetLoopManagerUnchecked()->GetNSlots(), colRegister,\n                    columns, pd->GetVariations(), variationName),\n        fFilter(std::move(f)), fValues(pd->GetLoopManagerUnchecked()->GetNSlots()), fPrevNodePtr(std::move(pd)),\n        fPrevNode(*fPrevNodePtr)\n   {\n   }\n\n   RFilter(const RFilter &) = delete;\n   RFilter &operator=(const RFilter &) = delete;\n   ~RFilter() {\n      \/\/ must Deregister objects from the RLoopManager here, before the fPrevNode data member is destroyed:\n      \/\/ otherwise if fPrevNode is the RLoopManager, it will be destroyed before the calls to Deregister happen.\n      fColRegister.Clear(); \/\/ triggers RDefine deregistration\n      fLoopManager->Deregister(this);\n   }\n\n   bool CheckFilters(unsigned int slot, Long64_t entry) final\n   {\n      if (entry != fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()]) {\n         if (!fPrevNode.CheckFilters(slot, entry)) {\n            \/\/ a filter upstream returned false, cache the result\n            fLastResult[slot * RDFInternal::CacheLineStep<int>()] = false;\n         } else {\n            \/\/ evaluate this filter, cache the result\n            auto passed = CheckFilterHelper(slot, entry, ColumnTypes_t{}, TypeInd_t{});\n            passed ? ++fAccepted[slot * RDFInternal::CacheLineStep<ULong64_t>()]\n                   : ++fRejected[slot * RDFInternal::CacheLineStep<ULong64_t>()];\n            fLastResult[slot * RDFInternal::CacheLineStep<int>()] = passed;\n         }\n         fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()] = entry;\n      }\n      return fLastResult[slot * RDFInternal::CacheLineStep<int>()];\n   }\n\n   template <typename... ColTypes, std::size_t... S>\n   bool CheckFilterHelper(unsigned int slot, Long64_t entry, TypeList<ColTypes...>, std::index_sequence<S...>)\n   {\n      \/\/ silence \"unused parameter\" warnings in gcc\n      (void)slot;\n      (void)entry;\n      return fFilter(fValues[slot][S]->template Get<ColTypes>(entry)...);\n   }\n\n   void InitSlot(TTreeReader *r, unsigned int slot) final\n   {\n      RDFInternal::RColumnReadersInfo info{fColumnNames, fColRegister, fIsDefine.data(), fLoopManager->GetDSValuePtrs(),\n                                           fLoopManager->GetDataSource()};\n      fValues[slot] = RDFInternal::MakeColumnReaders(slot, r, ColumnTypes_t{}, info, fVariation);\n      fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()] = -1;\n   }\n\n   \/\/ recursive chain of `Report`s\n   void Report(ROOT::RDF::RCutFlowReport &rep) const final { PartialReport(rep); }\n\n   void PartialReport(ROOT::RDF::RCutFlowReport &rep) const final\n   {\n      fPrevNode.PartialReport(rep);\n      FillReport(rep);\n   }\n\n   void StopProcessing() final\n   {\n      ++fNStopsReceived;\n      if (fNStopsReceived == fNChildren)\n         fPrevNode.StopProcessing();\n   }\n\n   void IncrChildrenCount() final\n   {\n      ++fNChildren;\n      \/\/ propagate \"children activation\" upstream. named filters do the propagation via `TriggerChildrenCount`.\n      if (fNChildren == 1 && fName.empty())\n         fPrevNode.IncrChildrenCount();\n   }\n\n   void TriggerChildrenCount() final\n   {\n      assert(!fName.empty()); \/\/ this method is to only be called on named filters\n      fPrevNode.IncrChildrenCount();\n   }\n\n   void AddFilterName(std::vector<std::string> &filters)\n   {\n      fPrevNode.AddFilterName(filters);\n      auto name = (HasName() ? fName : \"Unnamed Filter\");\n      filters.push_back(name);\n   }\n\n   \/\/\/ Clean-up operations to be performed at the end of a task.\n   void FinalizeSlot(unsigned int slot) final\n   {\n      for (auto &v : fValues[slot])\n         v.reset();\n   }\n\n   std::shared_ptr<RDFGraphDrawing::GraphNode>\n   GetGraph(std::unordered_map<void *, std::shared_ptr<RDFGraphDrawing::GraphNode>> &visitedMap)\n   {\n      \/\/ Recursively call for the previous node.\n      auto prevNode = fPrevNode.GetGraph(visitedMap);\n      auto prevColumns = prevNode->GetDefinedColumns();\n\n      auto thisNode = RDFGraphDrawing::CreateFilterNode(this, visitedMap);\n\n      \/* If the returned node is not new, there is no need to perform any other operation.\n       * This is a likely scenario when building the entire graph in which branches share\n       * some nodes. *\/\n      if (!thisNode->GetIsNew()) {\n         return thisNode;\n      }\n\n      auto upmostNode = AddDefinesToGraph(thisNode, fColRegister, prevColumns, visitedMap);\n\n      \/\/ Keep track of the columns defined up to this point.\n      thisNode->AddDefinedColumns(fColRegister.GetNames());\n\n      upmostNode->SetPrevNode(prevNode);\n      return thisNode;\n   }\n\n   \/\/\/ Return a clone of this Filter that works with values in the variationName \"universe\".\n   std::shared_ptr<RNodeBase> GetVariedFilter(const std::string &variationName) final\n   {\n      \/\/ nobody should ask for a varied filter for the nominal variation: they can just\n      \/\/ use the nominal filter!\n      assert(variationName != \"nominal\");\n\n      auto it = fVariedFilters.find(variationName);\n      if (it != fVariedFilters.end())\n         return it->second;\n\n      auto prevNode = fPrevNodePtr;\n      if ((void *)fPrevNodePtr.get() != (void *)fLoopManager)\n         prevNode = std::static_pointer_cast<PrevNode>(prevNode->GetVariedFilter(variationName));\n\n      \/\/ the varied filters get a copy of the callable object.\n      \/\/ TODO document this\n      auto variedFilter = std::unique_ptr<RFilterBase>(\n         new RFilter(fFilter, fColumnNames, std::move(prevNode), fColRegister, fName, variationName));\n      fLoopManager->Book(variedFilter.get());\n      auto e = fVariedFilters.insert({variationName, std::move(variedFilter)});\n      return e.first->second;\n   }\n};\n\n} \/\/ ns RDF\n} \/\/ ns Detail\n} \/\/ ns ROOT\n\n#endif \/\/ ROOT_RFILTER\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Author: Enrico Guiraud, Danilo Piparo CERN  09\/2018\n\n\/*************************************************************************\n * Copyright (C) 1995-2018, 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#ifndef ROOT_RFILTER\n#define ROOT_RFILTER\n\n#include \"ROOT\/RDF\/ColumnReaderUtils.hxx\"\n#include \"ROOT\/RDF\/RColumnReaderBase.hxx\"\n#include \"ROOT\/RDF\/RCutFlowReport.hxx\"\n#include \"ROOT\/RDF\/Utils.hxx\"\n#include \"ROOT\/RDF\/RFilterBase.hxx\"\n#include \"ROOT\/RDF\/RLoopManager.hxx\"\n#include \"ROOT\/TypeTraits.hxx\"\n#include \"RtypesCore.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <utility> \/\/ std::index_sequence\n#include <vector>\n\nnamespace ROOT {\n\nnamespace Internal {\nnamespace RDF {\nusing namespace ROOT::Detail::RDF;\n\n\/\/ fwd decl for RFilter\nnamespace GraphDrawing {\nstd::shared_ptr<GraphNode>\nCreateFilterNode(const RFilterBase *filterPtr, std::unordered_map<void *, std::shared_ptr<GraphNode>> &visitedMap);\n\nstd::shared_ptr<GraphNode> AddDefinesToGraph(std::shared_ptr<GraphNode> node,\n                                             const RDFInternal::RColumnRegister &colRegister,\n                                             const std::vector<std::string> &prevNodeDefines,\n                                             std::unordered_map<void *, std::shared_ptr<GraphNode>> &visitedMap);\n} \/\/ ns GraphDrawing\n\n} \/\/ ns RDF\n} \/\/ ns Internal\n\nnamespace Detail {\nnamespace RDF {\nusing namespace ROOT::TypeTraits;\nnamespace RDFGraphDrawing = ROOT::Internal::RDF::GraphDrawing;\n\ntemplate <typename FilterF, typename PrevNode>\nclass R__CLING_PTRCHECK(off) RFilter final : public RFilterBase {\n   using ColumnTypes_t = typename CallableTraits<FilterF>::arg_types;\n   using TypeInd_t = std::make_index_sequence<ColumnTypes_t::list_size>;\n\n   FilterF fFilter;\n   \/\/\/ Column readers per slot and per input column\n   std::vector<std::array<std::unique_ptr<RColumnReaderBase>, ColumnTypes_t::list_size>> fValues;\n   const std::shared_ptr<PrevNode> fPrevNodePtr;\n   PrevNode &fPrevNode;\n\n   std::unordered_map<std::string, std::shared_ptr<RFilterBase>> fVariedFilters;\n\npublic:\n   RFilter(FilterF f, const ROOT::RDF::ColumnNames_t &columns, std::shared_ptr<PrevNode> pd,\n           const RDFInternal::RColumnRegister &colRegister, std::string_view name = \"\",\n           const std::string &variationName = \"nominal\")\n      : RFilterBase(pd->GetLoopManagerUnchecked(), name, pd->GetLoopManagerUnchecked()->GetNSlots(), colRegister,\n                    columns, pd->GetVariations(), variationName),\n        fFilter(std::move(f)), fValues(pd->GetLoopManagerUnchecked()->GetNSlots()), fPrevNodePtr(std::move(pd)),\n        fPrevNode(*fPrevNodePtr)\n   {\n   }\n\n   RFilter(const RFilter &) = delete;\n   RFilter &operator=(const RFilter &) = delete;\n   ~RFilter() {\n      \/\/ must Deregister objects from the RLoopManager here, before the fPrevNode data member is destroyed:\n      \/\/ otherwise if fPrevNode is the RLoopManager, it will be destroyed before the calls to Deregister happen.\n      fColRegister.Clear(); \/\/ triggers RDefine deregistration\n      fLoopManager->Deregister(this);\n   }\n\n   bool CheckFilters(unsigned int slot, Long64_t entry) final\n   {\n      if (entry != fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()]) {\n         if (!fPrevNode.CheckFilters(slot, entry)) {\n            \/\/ a filter upstream returned false, cache the result\n            fLastResult[slot * RDFInternal::CacheLineStep<int>()] = false;\n         } else {\n            \/\/ evaluate this filter, cache the result\n            auto passed = CheckFilterHelper(slot, entry, ColumnTypes_t{}, TypeInd_t{});\n            passed ? ++fAccepted[slot * RDFInternal::CacheLineStep<ULong64_t>()]\n                   : ++fRejected[slot * RDFInternal::CacheLineStep<ULong64_t>()];\n            fLastResult[slot * RDFInternal::CacheLineStep<int>()] = passed;\n         }\n         fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()] = entry;\n      }\n      return fLastResult[slot * RDFInternal::CacheLineStep<int>()];\n   }\n\n   template <typename... ColTypes, std::size_t... S>\n   bool CheckFilterHelper(unsigned int slot, Long64_t entry, TypeList<ColTypes...>, std::index_sequence<S...>)\n   {\n      \/\/ silence \"unused parameter\" warnings in gcc\n      (void)slot;\n      (void)entry;\n      return fFilter(fValues[slot][S]->template Get<ColTypes>(entry)...);\n   }\n\n   void InitSlot(TTreeReader *r, unsigned int slot) final\n   {\n      RDFInternal::RColumnReadersInfo info{fColumnNames, fColRegister, fIsDefine.data(), fLoopManager->GetDSValuePtrs(),\n                                           fLoopManager->GetDataSource()};\n      fValues[slot] = RDFInternal::MakeColumnReaders(slot, r, ColumnTypes_t{}, info, fVariation);\n      fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()] = -1;\n   }\n\n   \/\/ recursive chain of `Report`s\n   void Report(ROOT::RDF::RCutFlowReport &rep) const final { PartialReport(rep); }\n\n   void PartialReport(ROOT::RDF::RCutFlowReport &rep) const final\n   {\n      fPrevNode.PartialReport(rep);\n      FillReport(rep);\n   }\n\n   void StopProcessing() final\n   {\n      ++fNStopsReceived;\n      if (fNStopsReceived == fNChildren)\n         fPrevNode.StopProcessing();\n   }\n\n   void IncrChildrenCount() final\n   {\n      ++fNChildren;\n      \/\/ propagate \"children activation\" upstream. named filters do the propagation via `TriggerChildrenCount`.\n      if (fNChildren == 1 && fName.empty())\n         fPrevNode.IncrChildrenCount();\n   }\n\n   void TriggerChildrenCount() final\n   {\n      assert(!fName.empty()); \/\/ this method is to only be called on named filters\n      fPrevNode.IncrChildrenCount();\n   }\n\n   void AddFilterName(std::vector<std::string> &filters)\n   {\n      fPrevNode.AddFilterName(filters);\n      auto name = (HasName() ? fName : \"Unnamed Filter\");\n      filters.push_back(name);\n   }\n\n   \/\/\/ Clean-up operations to be performed at the end of a task.\n   void FinalizeSlot(unsigned int slot) final\n   {\n      for (auto &v : fValues[slot])\n         v.reset();\n   }\n\n   std::shared_ptr<RDFGraphDrawing::GraphNode>\n   GetGraph(std::unordered_map<void *, std::shared_ptr<RDFGraphDrawing::GraphNode>> &visitedMap)\n   {\n      \/\/ Recursively call for the previous node.\n      auto prevNode = fPrevNode.GetGraph(visitedMap);\n      auto prevColumns = prevNode->GetDefinedColumns();\n\n      auto thisNode = RDFGraphDrawing::CreateFilterNode(this, visitedMap);\n\n      \/* If the returned node is not new, there is no need to perform any other operation.\n       * This is a likely scenario when building the entire graph in which branches share\n       * some nodes. *\/\n      if (!thisNode->GetIsNew()) {\n         return thisNode;\n      }\n\n      auto upmostNode = AddDefinesToGraph(thisNode, fColRegister, prevColumns, visitedMap);\n\n      \/\/ Keep track of the columns defined up to this point.\n      thisNode->AddDefinedColumns(fColRegister.GetNames());\n\n      upmostNode->SetPrevNode(prevNode);\n      return thisNode;\n   }\n\n   \/\/\/ Return a clone of this Filter that works with values in the variationName \"universe\".\n   std::shared_ptr<RNodeBase> GetVariedFilter(const std::string &variationName) final\n   {\n      \/\/ nobody should ask for a varied filter for the nominal variation: they can just\n      \/\/ use the nominal filter!\n      assert(variationName != \"nominal\");\n\n      auto it = fVariedFilters.find(variationName);\n      if (it != fVariedFilters.end())\n         return it->second;\n\n      auto prevNode = fPrevNodePtr;\n      if ((void *)fPrevNodePtr.get() != (void *)fLoopManager)\n         prevNode = std::static_pointer_cast<PrevNode>(prevNode->GetVariedFilter(variationName));\n\n      \/\/ the varied filters get a copy of the callable object.\n      \/\/ TODO document this\n      auto variedFilter = std::unique_ptr<RFilterBase>(\n         new RFilter(fFilter, fColumnNames, std::move(prevNode), fColRegister, fName, variationName));\n      fLoopManager->Book(variedFilter.get());\n      auto e = fVariedFilters.insert({variationName, std::move(variedFilter)});\n      return e.first->second;\n   }\n};\n\n} \/\/ ns RDF\n} \/\/ ns Detail\n} \/\/ ns ROOT\n\n#endif \/\/ ROOT_RFILTER\n<commit_msg>[DF] Compare pointers to base rather than pointers to void<commit_after>\/\/ Author: Enrico Guiraud, Danilo Piparo CERN  09\/2018\n\n\/*************************************************************************\n * Copyright (C) 1995-2018, 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#ifndef ROOT_RFILTER\n#define ROOT_RFILTER\n\n#include \"ROOT\/RDF\/ColumnReaderUtils.hxx\"\n#include \"ROOT\/RDF\/RColumnReaderBase.hxx\"\n#include \"ROOT\/RDF\/RCutFlowReport.hxx\"\n#include \"ROOT\/RDF\/Utils.hxx\"\n#include \"ROOT\/RDF\/RFilterBase.hxx\"\n#include \"ROOT\/RDF\/RLoopManager.hxx\"\n#include \"ROOT\/TypeTraits.hxx\"\n#include \"RtypesCore.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <utility> \/\/ std::index_sequence\n#include <vector>\n\nnamespace ROOT {\n\nnamespace Internal {\nnamespace RDF {\nusing namespace ROOT::Detail::RDF;\n\n\/\/ fwd decl for RFilter\nnamespace GraphDrawing {\nstd::shared_ptr<GraphNode>\nCreateFilterNode(const RFilterBase *filterPtr, std::unordered_map<void *, std::shared_ptr<GraphNode>> &visitedMap);\n\nstd::shared_ptr<GraphNode> AddDefinesToGraph(std::shared_ptr<GraphNode> node,\n                                             const RDFInternal::RColumnRegister &colRegister,\n                                             const std::vector<std::string> &prevNodeDefines,\n                                             std::unordered_map<void *, std::shared_ptr<GraphNode>> &visitedMap);\n} \/\/ ns GraphDrawing\n\n} \/\/ ns RDF\n} \/\/ ns Internal\n\nnamespace Detail {\nnamespace RDF {\nusing namespace ROOT::TypeTraits;\nnamespace RDFGraphDrawing = ROOT::Internal::RDF::GraphDrawing;\n\ntemplate <typename FilterF, typename PrevNode>\nclass R__CLING_PTRCHECK(off) RFilter final : public RFilterBase {\n   using ColumnTypes_t = typename CallableTraits<FilterF>::arg_types;\n   using TypeInd_t = std::make_index_sequence<ColumnTypes_t::list_size>;\n\n   FilterF fFilter;\n   \/\/\/ Column readers per slot and per input column\n   std::vector<std::array<std::unique_ptr<RColumnReaderBase>, ColumnTypes_t::list_size>> fValues;\n   const std::shared_ptr<PrevNode> fPrevNodePtr;\n   PrevNode &fPrevNode;\n\n   std::unordered_map<std::string, std::shared_ptr<RFilterBase>> fVariedFilters;\n\npublic:\n   RFilter(FilterF f, const ROOT::RDF::ColumnNames_t &columns, std::shared_ptr<PrevNode> pd,\n           const RDFInternal::RColumnRegister &colRegister, std::string_view name = \"\",\n           const std::string &variationName = \"nominal\")\n      : RFilterBase(pd->GetLoopManagerUnchecked(), name, pd->GetLoopManagerUnchecked()->GetNSlots(), colRegister,\n                    columns, pd->GetVariations(), variationName),\n        fFilter(std::move(f)), fValues(pd->GetLoopManagerUnchecked()->GetNSlots()), fPrevNodePtr(std::move(pd)),\n        fPrevNode(*fPrevNodePtr)\n   {\n   }\n\n   RFilter(const RFilter &) = delete;\n   RFilter &operator=(const RFilter &) = delete;\n   ~RFilter() {\n      \/\/ must Deregister objects from the RLoopManager here, before the fPrevNode data member is destroyed:\n      \/\/ otherwise if fPrevNode is the RLoopManager, it will be destroyed before the calls to Deregister happen.\n      fColRegister.Clear(); \/\/ triggers RDefine deregistration\n      fLoopManager->Deregister(this);\n   }\n\n   bool CheckFilters(unsigned int slot, Long64_t entry) final\n   {\n      if (entry != fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()]) {\n         if (!fPrevNode.CheckFilters(slot, entry)) {\n            \/\/ a filter upstream returned false, cache the result\n            fLastResult[slot * RDFInternal::CacheLineStep<int>()] = false;\n         } else {\n            \/\/ evaluate this filter, cache the result\n            auto passed = CheckFilterHelper(slot, entry, ColumnTypes_t{}, TypeInd_t{});\n            passed ? ++fAccepted[slot * RDFInternal::CacheLineStep<ULong64_t>()]\n                   : ++fRejected[slot * RDFInternal::CacheLineStep<ULong64_t>()];\n            fLastResult[slot * RDFInternal::CacheLineStep<int>()] = passed;\n         }\n         fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()] = entry;\n      }\n      return fLastResult[slot * RDFInternal::CacheLineStep<int>()];\n   }\n\n   template <typename... ColTypes, std::size_t... S>\n   bool CheckFilterHelper(unsigned int slot, Long64_t entry, TypeList<ColTypes...>, std::index_sequence<S...>)\n   {\n      \/\/ silence \"unused parameter\" warnings in gcc\n      (void)slot;\n      (void)entry;\n      return fFilter(fValues[slot][S]->template Get<ColTypes>(entry)...);\n   }\n\n   void InitSlot(TTreeReader *r, unsigned int slot) final\n   {\n      RDFInternal::RColumnReadersInfo info{fColumnNames, fColRegister, fIsDefine.data(), fLoopManager->GetDSValuePtrs(),\n                                           fLoopManager->GetDataSource()};\n      fValues[slot] = RDFInternal::MakeColumnReaders(slot, r, ColumnTypes_t{}, info, fVariation);\n      fLastCheckedEntry[slot * RDFInternal::CacheLineStep<Long64_t>()] = -1;\n   }\n\n   \/\/ recursive chain of `Report`s\n   void Report(ROOT::RDF::RCutFlowReport &rep) const final { PartialReport(rep); }\n\n   void PartialReport(ROOT::RDF::RCutFlowReport &rep) const final\n   {\n      fPrevNode.PartialReport(rep);\n      FillReport(rep);\n   }\n\n   void StopProcessing() final\n   {\n      ++fNStopsReceived;\n      if (fNStopsReceived == fNChildren)\n         fPrevNode.StopProcessing();\n   }\n\n   void IncrChildrenCount() final\n   {\n      ++fNChildren;\n      \/\/ propagate \"children activation\" upstream. named filters do the propagation via `TriggerChildrenCount`.\n      if (fNChildren == 1 && fName.empty())\n         fPrevNode.IncrChildrenCount();\n   }\n\n   void TriggerChildrenCount() final\n   {\n      assert(!fName.empty()); \/\/ this method is to only be called on named filters\n      fPrevNode.IncrChildrenCount();\n   }\n\n   void AddFilterName(std::vector<std::string> &filters)\n   {\n      fPrevNode.AddFilterName(filters);\n      auto name = (HasName() ? fName : \"Unnamed Filter\");\n      filters.push_back(name);\n   }\n\n   \/\/\/ Clean-up operations to be performed at the end of a task.\n   void FinalizeSlot(unsigned int slot) final\n   {\n      for (auto &v : fValues[slot])\n         v.reset();\n   }\n\n   std::shared_ptr<RDFGraphDrawing::GraphNode>\n   GetGraph(std::unordered_map<void *, std::shared_ptr<RDFGraphDrawing::GraphNode>> &visitedMap)\n   {\n      \/\/ Recursively call for the previous node.\n      auto prevNode = fPrevNode.GetGraph(visitedMap);\n      auto prevColumns = prevNode->GetDefinedColumns();\n\n      auto thisNode = RDFGraphDrawing::CreateFilterNode(this, visitedMap);\n\n      \/* If the returned node is not new, there is no need to perform any other operation.\n       * This is a likely scenario when building the entire graph in which branches share\n       * some nodes. *\/\n      if (!thisNode->GetIsNew()) {\n         return thisNode;\n      }\n\n      auto upmostNode = AddDefinesToGraph(thisNode, fColRegister, prevColumns, visitedMap);\n\n      \/\/ Keep track of the columns defined up to this point.\n      thisNode->AddDefinedColumns(fColRegister.GetNames());\n\n      upmostNode->SetPrevNode(prevNode);\n      return thisNode;\n   }\n\n   \/\/\/ Return a clone of this Filter that works with values in the variationName \"universe\".\n   std::shared_ptr<RNodeBase> GetVariedFilter(const std::string &variationName) final\n   {\n      \/\/ nobody should ask for a varied filter for the nominal variation: they can just\n      \/\/ use the nominal filter!\n      assert(variationName != \"nominal\");\n\n      auto it = fVariedFilters.find(variationName);\n      if (it != fVariedFilters.end())\n         return it->second;\n\n      auto prevNode = fPrevNodePtr;\n      if (static_cast<RNodeBase *>(fPrevNodePtr.get()) != static_cast<RNodeBase *>(fLoopManager))\n         prevNode = std::static_pointer_cast<PrevNode>(prevNode->GetVariedFilter(variationName));\n\n      \/\/ the varied filters get a copy of the callable object.\n      \/\/ TODO document this\n      auto variedFilter = std::unique_ptr<RFilterBase>(\n         new RFilter(fFilter, fColumnNames, std::move(prevNode), fColRegister, fName, variationName));\n      fLoopManager->Book(variedFilter.get());\n      auto e = fVariedFilters.insert({variationName, std::move(variedFilter)});\n      return e.first->second;\n   }\n};\n\n} \/\/ ns RDF\n} \/\/ ns Detail\n} \/\/ ns ROOT\n\n#endif \/\/ ROOT_RFILTER\n<|endoftext|>"}
{"text":"<commit_before>\/\/ XDRFileMarshaller.cc\n\n\/\/ -*- mode: c++; c-basic-offset:4 -*-\n\n\/\/ This file is part of libdap, A C++ implementation of the OPeNDAP Data\n\/\/ Access Protocol.\n\n\/\/ Copyright (c) 2002,2003 OPeNDAP, Inc.\n\/\/ Author: Patrick West <pwest@ucar.edu>\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\/\/ You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.\n\n\/\/ (c) COPYRIGHT URI\/MIT 1994-1999\n\/\/ Please read the full copyright statement in the file COPYRIGHT_URI.\n\/\/\n\/\/ Authors:\n\/\/      pwest       Patrick West <pwest@ucar.edu>\n\n#include \"XDRFileMarshaller.h\"\n\n#include \"Vector.h\"\n#include \"util.h\"\n#include \"InternalErr.h\"\n\nnamespace libdap {\n\nXDRFileMarshaller::XDRFileMarshaller( FILE *out )\n    : _sink( 0 )\n{\n    _sink = new_xdrstdio( out, XDR_ENCODE ) ;\n}\n\nXDRFileMarshaller::XDRFileMarshaller()\n    : Marshaller(),\n      _sink( 0 )\n{\n    throw InternalErr( __FILE__, __LINE__, \"Default constructor not implemented.\" ) ;\n}\n\nXDRFileMarshaller::XDRFileMarshaller( const XDRFileMarshaller &m )\n    : Marshaller( m ),\n      _sink( 0 )\n{\n    throw InternalErr( __FILE__, __LINE__, \"Copy constructor not implemented.\" ) ;\n}\n\nXDRFileMarshaller &\nXDRFileMarshaller::operator=( const XDRFileMarshaller & )\n{\n    throw InternalErr( __FILE__, __LINE__, \"Copy operator not implemented.\" ) ;\n\n    return *this ;\n}\n\nXDRFileMarshaller::~XDRFileMarshaller( )\n{\n    delete_xdrstdio( _sink ) ;\n}\n\nvoid\nXDRFileMarshaller::put_byte( dods_byte val )\n{\n    if( !xdr_char( _sink, (char *)&val ) )\n        throw Error(\"Network I\/O Error. Could not send byte data.\\nThis may be due to a bug in DODS, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_int16( dods_int16 val )\n{\n    if( !XDR_INT16( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send int 16 data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_int32( dods_int32 val )\n{\n#ifdef _MSC_VER\n    if( !XDR_INT32( _sink, (int *)&val ) )\n#else\n    if( !XDR_INT32( _sink, &val ) )\n#endif\n        throw Error(\"Network I\/O Error. Could not read int 32 data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_float32( dods_float32 val )\n{\n    if( !xdr_float( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send float 32 data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_float64( dods_float64 val )\n{\n    if( !xdr_double( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send float 64 data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_uint16( dods_uint16 val )\n{\n    if( !XDR_UINT16( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send uint 16 data. This may be due to a\\nbug in libdap or a problem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_uint32( dods_uint32 val )\n{\n    if( !XDR_UINT32( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send uint 32 data. This may be due to a\\nbug in libdap or a problem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_str( const string &val )\n{\n    const char *out_tmp = val.c_str() ;\n\n    if( !xdr_string( _sink, (char **)&out_tmp, max_str_len) )\n        throw Error(\"Network I\/O Error. Could not send string data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_url( const string &val )\n{\n    put_str( val ) ;\n}\n\nvoid\nXDRFileMarshaller::put_opaque( char *val, unsigned int len )\n{\n    if( !xdr_opaque( _sink, val, len ) )\n        throw Error(\"Network I\/O Error. Could not send opaque data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_int( int val )\n{\n    if( !xdr_int( _sink, &val) )\n\tthrow Error(\"Network I\/O Error(1). This may be due to a bug in libdap or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_vector( char *val, int num, Vector & )\n{\n    if (!val)\n\tthrow InternalErr(__FILE__, __LINE__,\n\t\t\t  \"Buffer pointer is not set.\");\n\n    put_int( num ) ;\n\n    if( !xdr_bytes( _sink, (char **)&val,\n\t\t    (unsigned int *) &num,\n\t\t    DODS_MAX_ARRAY) )\n    {\n\tthrow Error(\"Network I\/O Error(2). This may be due to a bug in libdap or a\\nproblem with the network connection.\");\n    }\n}\n\nvoid\nXDRFileMarshaller::put_vector( char *val, int num, int width, Vector &vec )\n{\n    if (!val)\n\tthrow InternalErr(__FILE__, __LINE__,\n\t\t\t  \"Buffer pointer is not set.\");\n\n    put_int( num ) ;\n\n    BaseType *var = vec.var() ;\n    if( !xdr_array( _sink, (char **)&val,\n\t\t    (unsigned int *) & num,\n\t\t    DODS_MAX_ARRAY, width,\n\t\t    XDRUtils::xdr_coder( var->type() ) ) )\n    {\n\tthrow Error(\"Network I\/O Error(2). This may be due to a bug in libdap or a\\nproblem with the network connection.\");\n    }\n}\n\nvoid\nXDRFileMarshaller::dump(ostream &strm) const\n{\n    strm << DapIndent::LMarg << \"XDRFileMarshaller::dump - (\"\n         << (void *)this << \")\" << endl ;\n}\n\n} \/\/ namespace libdap\n\n<commit_msg>Added patch from Anna Nokolov.<commit_after>\/\/ XDRFileMarshaller.cc\n\n\/\/ -*- mode: c++; c-basic-offset:4 -*-\n\n\/\/ This file is part of libdap, A C++ implementation of the OPeNDAP Data\n\/\/ Access Protocol.\n\n\/\/ Copyright (c) 2002,2003 OPeNDAP, Inc.\n\/\/ Author: Patrick West <pwest@ucar.edu>\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\/\/ You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.\n\n\/\/ (c) COPYRIGHT URI\/MIT 1994-1999\n\/\/ Please read the full copyright statement in the file COPYRIGHT_URI.\n\/\/\n\/\/ Authors:\n\/\/      pwest       Patrick West <pwest@ucar.edu>\n\n#include \"XDRFileMarshaller.h\"\n\n#include \"Vector.h\"\n#include \"util.h\"\n#include \"InternalErr.h\"\n\nnamespace libdap {\n\nXDRFileMarshaller::XDRFileMarshaller( FILE *out )\n    : _sink( 0 )\n{\n    _sink = new_xdrstdio( out, XDR_ENCODE ) ;\n}\n\nXDRFileMarshaller::XDRFileMarshaller()\n    : Marshaller(),\n      _sink( 0 )\n{\n    throw InternalErr( __FILE__, __LINE__, \"Default constructor not implemented.\" ) ;\n}\n\nXDRFileMarshaller::XDRFileMarshaller( const XDRFileMarshaller &m )\n    : Marshaller( m ),\n      _sink( 0 )\n{\n    throw InternalErr( __FILE__, __LINE__, \"Copy constructor not implemented.\" ) ;\n}\n\nXDRFileMarshaller &\nXDRFileMarshaller::operator=( const XDRFileMarshaller & )\n{\n    throw InternalErr( __FILE__, __LINE__, \"Copy operator not implemented.\" ) ;\n\n    return *this ;\n}\n\nXDRFileMarshaller::~XDRFileMarshaller( )\n{\n    delete_xdrstdio( _sink ) ;\n}\n\nvoid\nXDRFileMarshaller::put_byte( dods_byte val )\n{\n    if( !xdr_char( _sink, (char *)&val ) )\n        throw Error(\"Network I\/O Error. Could not send byte data.\\nThis may be due to a bug in DODS, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_int16( dods_int16 val )\n{\n    if( !XDR_INT16( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send int 16 data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_int32( dods_int32 val )\n{\n#ifdef _MSC_VER\n    if( !XDR_INT32( _sink, (int *)&val ) )\n#else\n    if( !XDR_INT32( _sink, &val ) )\n#endif\n        throw Error(\"Network I\/O Error. Could not read int 32 data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_float32( dods_float32 val )\n{\n    if( !xdr_float( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send float 32 data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_float64( dods_float64 val )\n{\n    if( !xdr_double( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send float 64 data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_uint16( dods_uint16 val )\n{\n    if( !XDR_UINT16( _sink, &val ) )\n        throw Error(\"Network I\/O Error. Could not send uint 16 data. This may be due to a\\nbug in libdap or a problem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_uint32( dods_uint32 val )\n{\n#ifdef _MSC_VER\n    if( !XDR_UINT32( _sink, (unsigned int *)&val ) )\n#else\n  \tif( !XDR_UINT32( _sink, &val ) )\n#endif\n        throw Error(\"Network I\/O Error. Could not send uint 32 data. This may be due to a\\nbug in libdap or a problem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_str( const string &val )\n{\n    const char *out_tmp = val.c_str() ;\n\n    if( !xdr_string( _sink, (char **)&out_tmp, max_str_len) )\n        throw Error(\"Network I\/O Error. Could not send string data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_url( const string &val )\n{\n    put_str( val ) ;\n}\n\nvoid\nXDRFileMarshaller::put_opaque( char *val, unsigned int len )\n{\n    if( !xdr_opaque( _sink, val, len ) )\n        throw Error(\"Network I\/O Error. Could not send opaque data.\\nThis may be due to a bug in libdap, on the server or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_int( int val )\n{\n    if( !xdr_int( _sink, &val) )\n\tthrow Error(\"Network I\/O Error(1). This may be due to a bug in libdap or a\\nproblem with the network connection.\");\n}\n\nvoid\nXDRFileMarshaller::put_vector( char *val, int num, Vector & )\n{\n    if (!val)\n\tthrow InternalErr(__FILE__, __LINE__,\n\t\t\t  \"Buffer pointer is not set.\");\n\n    put_int( num ) ;\n\n    if( !xdr_bytes( _sink, (char **)&val,\n\t\t    (unsigned int *) &num,\n\t\t    DODS_MAX_ARRAY) )\n    {\n\tthrow Error(\"Network I\/O Error(2). This may be due to a bug in libdap or a\\nproblem with the network connection.\");\n    }\n}\n\nvoid\nXDRFileMarshaller::put_vector( char *val, int num, int width, Vector &vec )\n{\n    if (!val)\n\tthrow InternalErr(__FILE__, __LINE__,\n\t\t\t  \"Buffer pointer is not set.\");\n\n    put_int( num ) ;\n\n    BaseType *var = vec.var() ;\n    if( !xdr_array( _sink, (char **)&val,\n\t\t    (unsigned int *) & num,\n\t\t    DODS_MAX_ARRAY, width,\n\t\t    XDRUtils::xdr_coder( var->type() ) ) )\n    {\n\tthrow Error(\"Network I\/O Error(2). This may be due to a bug in libdap or a\\nproblem with the network connection.\");\n    }\n}\n\nvoid\nXDRFileMarshaller::dump(ostream &strm) const\n{\n    strm << DapIndent::LMarg << \"XDRFileMarshaller::dump - (\"\n         << (void *)this << \")\" << endl ;\n}\n\n} \/\/ namespace libdap\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: init.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: obo $ $Date: 2004-11-17 10:21: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 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#include \"svxdlg.hxx\"\n#include \"dialogs.hrc\"\n\n#include \"vos\/mutex.hxx\"\n#include <vcl\/edit.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/dialog.hxx>\n#include <vcl\/msgbox.hxx>\n\n\/\/ ------------------------------------------------------------------------\n\/\/Sonderzeichen einfuegen fuer Edits\n\nString GetSpecialCharsForEdit(Window* pParent, const Font& rFont)\n{\n    String sRet;\n    SvxAbstractDialogFactory* pFact = SvxAbstractDialogFactory::Create();\n    if(pFact)\n    {\n        AbstractSvxCharacterMap* aDlg = pFact->CreateSvxCharacterMap( pParent, ResId(RID_SVXDLG_CHARMAP) );\n        aDlg->DisableFontSelection();\n        aDlg->SetCharFont(rFont);\n        if ( aDlg->Execute() == RET_OK )\n            sRet = aDlg->GetChar();\n        delete aDlg;\n    }\n    return sRet;\n}\n\n\/\/ ------------------------------------------------------------------------\n\nclass Initialize\n{\n    public:\n        Initialize();\n        ~Initialize();\n};\n\n\/\/ ------------------------------------------------------------------------\n\nInitialize::Initialize()\n{\n#if 0 \/\/ commented out since it does not work in nonoffice scenario\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    \/\/ Set special characters callback on vcl edit control\n    Edit::SetGetSpecialCharsFunction(&GetSpecialCharsForEdit);\n#endif\n}\n\n\/\/ ------------------------------------------------------------------------\n\nInitialize::~Initialize()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nInitialize aInit;\n<commit_msg>INTEGRATION: CWS cd02 (1.2.106); FILE MERGED 2005\/01\/11 12:44:42 cd 1.2.106.1: #i33483# Make svx based function extern 'C'<commit_after>\/*************************************************************************\n *\n *  $RCSfile: init.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: kz $ $Date: 2005-01-13 18:52: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 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#include \"svxdlg.hxx\"\n#include \"dialogs.hrc\"\n\n#include \"vos\/mutex.hxx\"\n#include <vcl\/edit.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/dialog.hxx>\n#include <vcl\/msgbox.hxx>\n\n\/\/ ------------------------------------------------------------------------\n\/\/Sonderzeichen einfuegen fuer Edits\n\nextern \"C\" String GetSpecialCharsForEdit(Window* pParent, const Font& rFont)\n{\n    String sRet;\n    SvxAbstractDialogFactory* pFact = SvxAbstractDialogFactory::Create();\n    if(pFact)\n    {\n        AbstractSvxCharacterMap* aDlg = pFact->CreateSvxCharacterMap( pParent, ResId(RID_SVXDLG_CHARMAP) );\n        aDlg->DisableFontSelection();\n        aDlg->SetCharFont(rFont);\n        if ( aDlg->Execute() == RET_OK )\n            sRet = aDlg->GetChar();\n        delete aDlg;\n    }\n    return sRet;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  air.hpp\n\/\/  OpenTsiolkovsky\n\/\/\n\/\/  Created by Takahiro Inagawa on 2015\/11\/23.\n\/\/  Copyright © 2015 Takahiro Inagawa. All rights reserved.\n\/\/\n\n#ifndef air_hpp\n#define air_hpp\n\n#include <stdio.h>\n#include \"..\/lib\/Eigen\/Core\"\n\nusing namespace std;\nusing namespace Eigen;\n\nclass Air{\nprivate:\n    double g = 9.80655;\n    double gamma = 1.4;\n    double R = 287.0531;\n    \/\/    height of atmospheric layer\n    int HAL[8] = {0, 11000, 20000, 32000, 47000, 51000, 71000, 84852};\n    \/\/    Lapse Rate Kelvin per meter\n    double LR[8] = {-0.0065, 0.0, 0.001, 0.0028, 0, -0.0028, -0.002, 0.0};\n    \/\/    Tempareture Kelvin\n    double T0[8] = {288.15, 216.65, 216.65, 228.65, 270.65, 270.65, 214.65, 186.95};\n    \/\/    Pressure Pa\n    double P0[8] = {101325, 22632, 5474.9, 868.02, 110.91, 66.939, 3.9564, 0.3734};\n    int k = 0;\n    \npublic:\n    double temperature = 300;\n    double airspeed = 1200;\n    double pressure = 101300;\n    double density = 1.2;\n    Air altitude(double altitude);\n    Air altitude_with_variation(double altitude, double input_percent);\n    double coef_density_variance(double altitude, double input_percent);\n    \n};\n\ndouble linear_interp1_from_y(double y, vector<double> x_array, vector<double> y_array);\nvoid test_air();\n\n#endif \/* air_hpp *\/\n<commit_msg>#include <vector><commit_after>\/\/\n\/\/  air.hpp\n\/\/  OpenTsiolkovsky\n\/\/\n\/\/  Created by Takahiro Inagawa on 2015\/11\/23.\n\/\/  Copyright © 2015 Takahiro Inagawa. All rights reserved.\n\/\/\n\n#ifndef air_hpp\n#define air_hpp\n\n#include <stdio.h>\n#include <vector>\n#include \"..\/lib\/Eigen\/Core\"\n\nusing namespace std;\nusing namespace Eigen;\n\nclass Air{\nprivate:\n    double g = 9.80655;\n    double gamma = 1.4;\n    double R = 287.0531;\n    \/\/    height of atmospheric layer\n    int HAL[8] = {0, 11000, 20000, 32000, 47000, 51000, 71000, 84852};\n    \/\/    Lapse Rate Kelvin per meter\n    double LR[8] = {-0.0065, 0.0, 0.001, 0.0028, 0, -0.0028, -0.002, 0.0};\n    \/\/    Tempareture Kelvin\n    double T0[8] = {288.15, 216.65, 216.65, 228.65, 270.65, 270.65, 214.65, 186.95};\n    \/\/    Pressure Pa\n    double P0[8] = {101325, 22632, 5474.9, 868.02, 110.91, 66.939, 3.9564, 0.3734};\n    int k = 0;\n    \npublic:\n    double temperature = 300;\n    double airspeed = 1200;\n    double pressure = 101300;\n    double density = 1.2;\n    Air altitude(double altitude);\n    Air altitude_with_variation(double altitude, double input_percent);\n    double coef_density_variance(double altitude, double input_percent);\n    \n};\n\ndouble linear_interp1_from_y(double y, vector<double> x_array, vector<double> y_array);\nvoid test_air();\n\n#endif \/* air_hpp *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"channel.hpp\"\n\n#include \"user_channel\/channel_layer.hpp\"\n\n#include <arpa\/inet.h>\n\n#include <boost\/process\/child.hpp>\n#include <fstream>\n#include <ipmid\/types.hpp>\n#include <ipmid\/utils.hpp>\n#include <phosphor-logging\/elog-errors.hpp>\n#include <phosphor-logging\/log.hpp>\n#include <set>\n#include <string>\n#include <xyz\/openbmc_project\/Common\/error.hpp>\n\nusing namespace phosphor::logging;\nusing namespace sdbusplus::xyz::openbmc_project::Common::Error;\n\nnamespace cipher\n{\n\n\/** @brief Get the supported Cipher records\n *\n * The cipher records are read from the JSON file and converted into\n * 1. cipher suite record format mentioned in the IPMI specification. The\n * records can be either OEM or standard cipher. Each json entry is parsed and\n * converted into the cipher record format and pushed into the vector.\n * 2. Algorithms listed in vector format\n *\n * @return pair of vector containing 1. all the cipher suite records. 2.\n * Algorithms supported\n *\n *\/\nstd::pair<std::vector<uint8_t>, std::vector<uint8_t>> getCipherRecords()\n{\n    std::vector<uint8_t> cipherRecords;\n    std::vector<uint8_t> supportedAlgorithmRecords;\n    \/\/ create set to get the unique supported algorithms\n    std::set<uint8_t> supportedAlgorithmSet;\n\n    std::ifstream jsonFile(configFile);\n    if (!jsonFile.is_open())\n    {\n        log<level::ERR>(\"Channel Cipher suites file not found\");\n        elog<InternalFailure>();\n    }\n\n    auto data = Json::parse(jsonFile, nullptr, false);\n    if (data.is_discarded())\n    {\n        log<level::ERR>(\"Parsing channel cipher suites JSON failed\");\n        elog<InternalFailure>();\n    }\n\n    for (const auto& record : data)\n    {\n        if (record.find(oem) != record.end())\n        {\n            \/\/ OEM cipher suite - 0xC1\n            cipherRecords.push_back(oemCipherSuite);\n            \/\/ Cipher Suite ID\n            cipherRecords.push_back(record.value(cipher, 0));\n            \/\/ OEM IANA - 3 bytes\n            cipherRecords.push_back(record.value(oem, 0));\n            cipherRecords.push_back(record.value(oem, 0) >> 8);\n            cipherRecords.push_back(record.value(oem, 0) >> 16);\n        }\n        else\n        {\n            \/\/ Standard cipher suite - 0xC0\n            cipherRecords.push_back(stdCipherSuite);\n            \/\/ Cipher Suite ID\n            cipherRecords.push_back(record.value(cipher, 0));\n        }\n\n        \/\/ Authentication algorithm number\n        cipherRecords.push_back(record.value(auth, 0));\n        supportedAlgorithmSet.insert(record.value(auth, 0));\n\n        \/\/ Integrity algorithm number\n        cipherRecords.push_back(record.value(integrity, 0) | integrityTag);\n        supportedAlgorithmSet.insert(record.value(integrity, 0) | integrityTag);\n\n        \/\/ Confidentiality algorithm number\n        cipherRecords.push_back(record.value(conf, 0) | confTag);\n        supportedAlgorithmSet.insert(record.value(conf, 0) | confTag);\n    }\n\n    \/\/ copy the set to supportedAlgorithmRecord which is vector based.\n    std::copy(supportedAlgorithmSet.begin(), supportedAlgorithmSet.end(),\n              std::back_inserter(supportedAlgorithmRecords));\n\n    return std::make_pair(cipherRecords, supportedAlgorithmRecords);\n}\n\n} \/\/ namespace cipher\n\n\/** @brief this command is used to look up what authentication, integrity,\n *  confidentiality algorithms are supported.\n *\n *  @ param ctx - context pointer\n *  @ param channelNumber - channel number\n *  @ param payloadType - payload type\n *  @ param listIndex - list index\n *  @ param algoSelectBit - list algorithms\n *\n *  @returns ipmi completion code plus response data\n *  - rspChannel - channel number for authentication algorithm.\n *  - rspRecords - cipher suite records.\n **\/\nipmi::RspType<uint8_t,             \/\/ Channel Number\n              std::vector<uint8_t> \/\/ Cipher Records\n              >\n    getChannelCipherSuites(ipmi::Context::ptr ctx, uint4_t channelNumber,\n                           uint4_t reserved1, uint8_t payloadType,\n                           uint6_t listIndex, uint1_t reserved2,\n                           uint1_t algoSelectBit)\n{\n    static std::vector<uint8_t> cipherRecords;\n    static std::vector<uint8_t> supportedAlgorithms;\n    static auto recordInit = false;\n\n    uint8_t rspChannel = ipmi::convertCurrentChannelNum(\n        static_cast<uint8_t>(channelNumber), ctx->channel);\n\n    if (!ipmi::isValidChannel(rspChannel) || reserved1 != 0 || reserved2 != 0)\n    {\n        return ipmi::responseInvalidFieldRequest();\n    }\n\n    if (!recordInit)\n    {\n        try\n        {\n            std::tie(cipherRecords, supportedAlgorithms) =\n                cipher::getCipherRecords();\n            recordInit = true;\n        }\n        catch (const std::exception& e)\n        {\n            return ipmi::responseUnspecifiedError();\n        }\n    }\n\n    const std::vector<uint8_t>& records =\n        algoSelectBit ? cipherRecords : supportedAlgorithms;\n    static constexpr auto respSize = 16;\n\n    \/\/ Session support is available in active LAN channels.\n    if ((ipmi::getChannelSessionSupport(rspChannel) ==\n         ipmi::EChannelSessSupported::none) ||\n        !(ipmi::doesDeviceExist(rspChannel)))\n    {\n        log<level::DEBUG>(\"Get channel cipher suites - Device does not exist\");\n        return ipmi::responseInvalidFieldRequest();\n    }\n\n    \/\/ List index(00h-3Fh), 0h selects the first set of 16, 1h selects the next\n    \/\/ set of 16 and so on.\n\n    \/\/ Calculate the number of record data bytes to be returned.\n    auto start =\n        std::min(static_cast<size_t>(listIndex) * respSize, records.size());\n    auto end = std::min((static_cast<size_t>(listIndex) * respSize) + respSize,\n                        records.size());\n    auto size = end - start;\n\n    std::vector<uint8_t> rspRecords;\n    std::copy_n(records.data() + start, size, std::back_inserter(rspRecords));\n\n    return ipmi::responseSuccess(rspChannel, rspRecords);\n}\n\ntemplate <typename... ArgTypes>\nstatic int executeCmd(const char* path, ArgTypes&&... tArgs)\n{\n    boost::process::child execProg(path, const_cast<char*>(tArgs)...);\n    execProg.wait();\n    return execProg.exit_code();\n}\n\n\/** @brief Enable the network IPMI service on the specified ethernet interface.\n *\n *  @param[in] intf - ethernet interface on which to enable IPMI\n *\/\nvoid enableNetworkIPMI(const std::string& intf)\n{\n    \/\/ Check if there is a iptable filter to drop IPMI packets for the\n    \/\/ interface.\n    auto retCode =\n        executeCmd(\"\/usr\/sbin\/iptables\", \"-C\", \"INPUT\", \"-p\", \"udp\", \"-i\",\n                   intf.c_str(), \"--dport\", \"623\", \"-j\", \"DROP\");\n\n    \/\/ If the iptable filter exists, delete the filter.\n    if (!retCode)\n    {\n        auto response =\n            executeCmd(\"\/usr\/sbin\/iptables\", \"-D\", \"INPUT\", \"-p\", \"udp\", \"-i\",\n                       intf.c_str(), \"--dport\", \"623\", \"-j\", \"DROP\");\n\n        if (response)\n        {\n            log<level::ERR>(\"Dropping the iptables filter failed\",\n                            entry(\"INTF=%s\", intf.c_str()),\n                            entry(\"RETURN_CODE:%d\", response));\n        }\n    }\n}\n\n\/** @brief Disable the network IPMI service on the specified ethernet interface.\n *\n *  @param[in] intf - ethernet interface on which to disable IPMI\n *\/\nvoid disableNetworkIPMI(const std::string& intf)\n{\n    \/\/ Check if there is a iptable filter to drop IPMI packets for the\n    \/\/ interface.\n    auto retCode =\n        executeCmd(\"\/usr\/sbin\/iptables\", \"-C\", \"INPUT\", \"-p\", \"udp\", \"-i\",\n                   intf.c_str(), \"--dport\", \"623\", \"-j\", \"DROP\");\n\n    \/\/ If the iptable filter does not exist, add filter to drop network IPMI\n    \/\/ packets\n    if (retCode)\n    {\n        auto response =\n            executeCmd(\"\/usr\/sbin\/iptables\", \"-I\", \"INPUT\", \"-p\", \"udp\", \"-i\",\n                       intf.c_str(), \"--dport\", \"623\", \"-j\", \"DROP\");\n\n        if (response)\n        {\n            log<level::ERR>(\"Inserting iptables filter failed\",\n                            entry(\"INTF=%s\", intf.c_str()),\n                            entry(\"RETURN_CODE:%d\", response));\n        }\n    }\n}\n<commit_msg>channel:Fix get channel ciphersuite - payloadtypes<commit_after>#include \"channel.hpp\"\n\n#include \"user_channel\/channel_layer.hpp\"\n\n#include <arpa\/inet.h>\n\n#include <boost\/process\/child.hpp>\n#include <fstream>\n#include <ipmid\/types.hpp>\n#include <ipmid\/utils.hpp>\n#include <phosphor-logging\/elog-errors.hpp>\n#include <phosphor-logging\/log.hpp>\n#include <set>\n#include <string>\n#include <xyz\/openbmc_project\/Common\/error.hpp>\n\nusing namespace phosphor::logging;\nusing namespace sdbusplus::xyz::openbmc_project::Common::Error;\n\nnamespace cipher\n{\n\n\/** @brief Get the supported Cipher records\n *\n * The cipher records are read from the JSON file and converted into\n * 1. cipher suite record format mentioned in the IPMI specification. The\n * records can be either OEM or standard cipher. Each json entry is parsed and\n * converted into the cipher record format and pushed into the vector.\n * 2. Algorithms listed in vector format\n *\n * @return pair of vector containing 1. all the cipher suite records. 2.\n * Algorithms supported\n *\n *\/\nstd::pair<std::vector<uint8_t>, std::vector<uint8_t>> getCipherRecords()\n{\n    std::vector<uint8_t> cipherRecords;\n    std::vector<uint8_t> supportedAlgorithmRecords;\n    \/\/ create set to get the unique supported algorithms\n    std::set<uint8_t> supportedAlgorithmSet;\n\n    std::ifstream jsonFile(configFile);\n    if (!jsonFile.is_open())\n    {\n        log<level::ERR>(\"Channel Cipher suites file not found\");\n        elog<InternalFailure>();\n    }\n\n    auto data = Json::parse(jsonFile, nullptr, false);\n    if (data.is_discarded())\n    {\n        log<level::ERR>(\"Parsing channel cipher suites JSON failed\");\n        elog<InternalFailure>();\n    }\n\n    for (const auto& record : data)\n    {\n        if (record.find(oem) != record.end())\n        {\n            \/\/ OEM cipher suite - 0xC1\n            cipherRecords.push_back(oemCipherSuite);\n            \/\/ Cipher Suite ID\n            cipherRecords.push_back(record.value(cipher, 0));\n            \/\/ OEM IANA - 3 bytes\n            cipherRecords.push_back(record.value(oem, 0));\n            cipherRecords.push_back(record.value(oem, 0) >> 8);\n            cipherRecords.push_back(record.value(oem, 0) >> 16);\n        }\n        else\n        {\n            \/\/ Standard cipher suite - 0xC0\n            cipherRecords.push_back(stdCipherSuite);\n            \/\/ Cipher Suite ID\n            cipherRecords.push_back(record.value(cipher, 0));\n        }\n\n        \/\/ Authentication algorithm number\n        cipherRecords.push_back(record.value(auth, 0));\n        supportedAlgorithmSet.insert(record.value(auth, 0));\n\n        \/\/ Integrity algorithm number\n        cipherRecords.push_back(record.value(integrity, 0) | integrityTag);\n        supportedAlgorithmSet.insert(record.value(integrity, 0) | integrityTag);\n\n        \/\/ Confidentiality algorithm number\n        cipherRecords.push_back(record.value(conf, 0) | confTag);\n        supportedAlgorithmSet.insert(record.value(conf, 0) | confTag);\n    }\n\n    \/\/ copy the set to supportedAlgorithmRecord which is vector based.\n    std::copy(supportedAlgorithmSet.begin(), supportedAlgorithmSet.end(),\n              std::back_inserter(supportedAlgorithmRecords));\n\n    return std::make_pair(cipherRecords, supportedAlgorithmRecords);\n}\n\n} \/\/ namespace cipher\n\n\/** @brief this command is used to look up what authentication, integrity,\n *  confidentiality algorithms are supported.\n *\n *  @ param ctx - context pointer\n *  @ param channelNumber - channel number\n *  @ param payloadType - payload type\n *  @ param listIndex - list index\n *  @ param algoSelectBit - list algorithms\n *\n *  @returns ipmi completion code plus response data\n *  - rspChannel - channel number for authentication algorithm.\n *  - rspRecords - cipher suite records.\n **\/\nipmi::RspType<uint8_t,             \/\/ Channel Number\n              std::vector<uint8_t> \/\/ Cipher Records\n              >\n    getChannelCipherSuites(ipmi::Context::ptr ctx, uint4_t channelNumber,\n                           uint4_t reserved1, uint8_t payloadType,\n                           uint6_t listIndex, uint1_t reserved2,\n                           uint1_t algoSelectBit)\n{\n    static std::vector<uint8_t> cipherRecords;\n    static std::vector<uint8_t> supportedAlgorithms;\n    static auto recordInit = false;\n\n    uint8_t rspChannel = ipmi::convertCurrentChannelNum(\n        static_cast<uint8_t>(channelNumber), ctx->channel);\n\n    if (!ipmi::isValidChannel(rspChannel) || reserved1 != 0 || reserved2 != 0)\n    {\n        return ipmi::responseInvalidFieldRequest();\n    }\n    if (!ipmi::isValidPayloadType(static_cast<ipmi::PayloadType>(payloadType)))\n    {\n        log<level::DEBUG>(\"Get channel cipher suites - Invalid payload type\");\n        constexpr uint8_t ccPayloadTypeNotSupported = 0x80;\n        return ipmi::response(ccPayloadTypeNotSupported);\n    }\n\n    if (!recordInit)\n    {\n        try\n        {\n            std::tie(cipherRecords, supportedAlgorithms) =\n                cipher::getCipherRecords();\n            recordInit = true;\n        }\n        catch (const std::exception& e)\n        {\n            return ipmi::responseUnspecifiedError();\n        }\n    }\n\n    const std::vector<uint8_t>& records =\n        algoSelectBit ? cipherRecords : supportedAlgorithms;\n    static constexpr auto respSize = 16;\n\n    \/\/ Session support is available in active LAN channels.\n    if ((ipmi::getChannelSessionSupport(rspChannel) ==\n         ipmi::EChannelSessSupported::none) ||\n        !(ipmi::doesDeviceExist(rspChannel)))\n    {\n        log<level::DEBUG>(\"Get channel cipher suites - Device does not exist\");\n        return ipmi::responseInvalidFieldRequest();\n    }\n\n    \/\/ List index(00h-3Fh), 0h selects the first set of 16, 1h selects the next\n    \/\/ set of 16 and so on.\n\n    \/\/ Calculate the number of record data bytes to be returned.\n    auto start =\n        std::min(static_cast<size_t>(listIndex) * respSize, records.size());\n    auto end = std::min((static_cast<size_t>(listIndex) * respSize) + respSize,\n                        records.size());\n    auto size = end - start;\n\n    std::vector<uint8_t> rspRecords;\n    std::copy_n(records.data() + start, size, std::back_inserter(rspRecords));\n\n    return ipmi::responseSuccess(rspChannel, rspRecords);\n}\n\ntemplate <typename... ArgTypes>\nstatic int executeCmd(const char* path, ArgTypes&&... tArgs)\n{\n    boost::process::child execProg(path, const_cast<char*>(tArgs)...);\n    execProg.wait();\n    return execProg.exit_code();\n}\n\n\/** @brief Enable the network IPMI service on the specified ethernet interface.\n *\n *  @param[in] intf - ethernet interface on which to enable IPMI\n *\/\nvoid enableNetworkIPMI(const std::string& intf)\n{\n    \/\/ Check if there is a iptable filter to drop IPMI packets for the\n    \/\/ interface.\n    auto retCode =\n        executeCmd(\"\/usr\/sbin\/iptables\", \"-C\", \"INPUT\", \"-p\", \"udp\", \"-i\",\n                   intf.c_str(), \"--dport\", \"623\", \"-j\", \"DROP\");\n\n    \/\/ If the iptable filter exists, delete the filter.\n    if (!retCode)\n    {\n        auto response =\n            executeCmd(\"\/usr\/sbin\/iptables\", \"-D\", \"INPUT\", \"-p\", \"udp\", \"-i\",\n                       intf.c_str(), \"--dport\", \"623\", \"-j\", \"DROP\");\n\n        if (response)\n        {\n            log<level::ERR>(\"Dropping the iptables filter failed\",\n                            entry(\"INTF=%s\", intf.c_str()),\n                            entry(\"RETURN_CODE:%d\", response));\n        }\n    }\n}\n\n\/** @brief Disable the network IPMI service on the specified ethernet interface.\n *\n *  @param[in] intf - ethernet interface on which to disable IPMI\n *\/\nvoid disableNetworkIPMI(const std::string& intf)\n{\n    \/\/ Check if there is a iptable filter to drop IPMI packets for the\n    \/\/ interface.\n    auto retCode =\n        executeCmd(\"\/usr\/sbin\/iptables\", \"-C\", \"INPUT\", \"-p\", \"udp\", \"-i\",\n                   intf.c_str(), \"--dport\", \"623\", \"-j\", \"DROP\");\n\n    \/\/ If the iptable filter does not exist, add filter to drop network IPMI\n    \/\/ packets\n    if (retCode)\n    {\n        auto response =\n            executeCmd(\"\/usr\/sbin\/iptables\", \"-I\", \"INPUT\", \"-p\", \"udp\", \"-i\",\n                       intf.c_str(), \"--dport\", \"623\", \"-j\", \"DROP\");\n\n        if (response)\n        {\n            log<level::ERR>(\"Inserting iptables filter failed\",\n                            entry(\"INTF=%s\", intf.c_str()),\n                            entry(\"RETURN_CODE:%d\", response));\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Mathematics Copyright (c) 2005 - 2013 G-Truc Creation (www.g-truc.net)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Created : 2005-12-21\n\/\/ Updated : 2007-08-14\n\/\/ Licence : This source is under MIT License\n\/\/ File    : glm\/gtx\/euler_angles.inl\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace glm\n{\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleX\n\t(\n\t\tvalType const & angleX\n\t)\n\t{\n\t\tvalType cosX = glm::cos(angleX);\n\t\tvalType sinX = glm::sin(angleX);\n\t\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tvalType(1), valType(0), valType(0), valType(0),\n\t\t\tvalType(0), cosX,\t\tsinX,\t\tvalType(0),\n\t\t\tvalType(0),-sinX,\t\tcosX,\t\tvalType(0),\n\t\t\tvalType(0), valType(0), valType(0), valType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleY\n\t(\n\t\tvalType const & angleY\n\t)\n\t{\n\t\tvalType cosY = glm::cos(angleY);\n\t\tvalType sinY = glm::sin(angleY);\n\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tcosY,\t\tvalType(0),\tsinY,\t\tvalType(0),\n\t\t\tvalType(0),\tvalType(1),\tvalType(0), valType(0),\n\t\t\t-sinY,\t\tvalType(0),\tcosY,\t\tvalType(0),\n\t\t\tvalType(0),\tvalType(0),\tvalType(0), valType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleZ\n\t(\n\t\tvalType const & angleZ\n\t)\n\t{\n\t\tvalType cosZ = glm::cos(angleZ); \n\t\tvalType sinZ = glm::sin(angleZ);\n\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tcosZ,\t\tsinZ,\t\tvalType(0), valType(0),\n\t\t\t-sinZ,\t\tcosZ,\t\tvalType(0), valType(0),\n\t\t\tvalType(0),\tvalType(0),\tvalType(1), valType(0),\n\t\t\tvalType(0),\tvalType(0),\tvalType(0), valType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleXY\n\t(\n\t\tvalType const & angleX, \n\t\tvalType const & angleY\n\t)\n\t{\n\t\tvalType cosX = glm::cos(angleX);\n\t\tvalType sinX = glm::sin(angleX);\n\t\tvalType cosY = glm::cos(angleY);\n\t\tvalType sinY = glm::sin(angleY);\n\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tcosY,\t\t-sinX * sinY,\tcosX * sinY,\tvalType(0),\n\t\t\tvalType(0), cosX,\t\t\tsinX,\t\t\tvalType(0),\n\t\t\t-sinY ,\t\t-sinX * cosY,\tcosX * cosY,\tvalType(0),\n\t\t\tvalType(0), valType(0),     valType(0),\t\tvalType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleYX\n\t(\n\t\tvalType const & angleY, \n\t\tvalType const & angleX\n\t)\n\t{\n\t\tvalType cosX = glm::cos(angleX); \n\t\tvalType sinX = glm::sin(angleX); \n\t\tvalType cosY = glm::cos(angleY); \n\t\tvalType sinY = glm::sin(angleY);\n\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tcosY,\t\t\tvalType(0),\t\tsinY,\t\t\tvalType(0),\n\t\t\t-sinX * sinY,\tcosX,\t\t\tsinX * cosY,\tvalType(0),\n\t\t\t-cosX * sinY,\t-sinX,\t\t\tcosX * cosY,\tvalType(0),\n\t\t\tvalType(0),\t\tvalType(0),\t\tvalType(0),\t\tvalType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleXZ\n\t(\n\t\tvalType const & angleX, \n\t\tvalType const & angleZ\n\t)\n\t{\n\t\treturn eulerAngleX(angleX) * eulerAngleZ(angleZ);\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleZX\n\t(\n\t\tvalType const & angleZ, \n\t\tvalType const & angleX\n\t)\n\t{\n\t\treturn eulerAngleZ(angleZ) * eulerAngleX(angleX);\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleYXZ\n\t(\n\t\tvalType const & yaw, \n\t\tvalType const & pitch, \n\t\tvalType const & roll\n\t)\n\t{\n\t\tvalType tmp_ch = glm::cos(yaw);\n\t\tvalType tmp_sh = glm::sin(yaw);\n\t\tvalType tmp_cp = glm::cos(pitch);\n\t\tvalType tmp_sp = glm::sin(pitch);\n\t\tvalType tmp_cb = glm::cos(roll);\n\t\tvalType tmp_sb = glm::sin(roll);\n\n\t\tdetail::tmat4x4<valType> Result;\n\t\tResult[0][0] = tmp_ch * tmp_cb + tmp_sh * tmp_sp * tmp_sb;\n\t\tResult[0][1] = tmp_sb * tmp_cp;\n\t\tResult[0][2] = -tmp_sh * tmp_cb + tmp_ch * tmp_sp * tmp_sb;\n\t\tResult[0][3] = valType(0);\n\t\tResult[1][0] = -tmp_ch * tmp_sb + tmp_sh * tmp_sp * tmp_cb;\n\t\tResult[1][1] = tmp_cb * tmp_cp;\n\t\tResult[1][2] = tmp_sb * tmp_sh + tmp_ch * tmp_sp * tmp_cb;\n\t\tResult[1][3] = valType(0);\n\t\tResult[2][0] = tmp_sh * tmp_cp;\n\t\tResult[2][1] = -tmp_sp;\n\t\tResult[2][2] = tmp_ch * tmp_cp;\n\t\tResult[2][3] = valType(0);\n\t\tResult[3][0] = valType(0);\n\t\tResult[3][1] = valType(0);\n\t\tResult[3][2] = valType(0);\n\t\tResult[3][3] = valType(1);\n\t\treturn Result;\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> yawPitchRoll\n\t(\n\t\tvalType const & yaw, \n\t\tvalType const & pitch, \n\t\tvalType const & roll\n\t)\n\t{\n\t\tvalType tmp_ch = glm::cos(yaw);\n\t\tvalType tmp_sh = glm::sin(yaw);\n\t\tvalType tmp_cp = glm::cos(pitch);\n\t\tvalType tmp_sp = glm::sin(pitch);\n\t\tvalType tmp_cb = glm::cos(roll);\n\t\tvalType tmp_sb = glm::sin(roll);\n\n\t\tdetail::tmat4x4<valType> Result;\n\t\tResult[0][0] = tmp_ch * tmp_cb + tmp_sh * tmp_sp * tmp_sb;\n\t\tResult[0][1] = tmp_sb * tmp_cp;\n\t\tResult[0][2] = -tmp_sh * tmp_cb + tmp_ch * tmp_sp * tmp_sb;\n\t\tResult[0][3] = valType(0);\n\t\tResult[1][0] = -tmp_ch * tmp_sb + tmp_sh * tmp_sp * tmp_cb;\n\t\tResult[1][1] = tmp_cb * tmp_cp;\n\t\tResult[1][2] = tmp_sb * tmp_sh + tmp_ch * tmp_sp * tmp_cb;\n\t\tResult[1][3] = valType(0);\n\t\tResult[2][0] = tmp_sh * tmp_cp;\n\t\tResult[2][1] = -tmp_sp;\n\t\tResult[2][2] = tmp_ch * tmp_cp;\n\t\tResult[2][3] = valType(0);\n\t\tResult[3][0] = valType(0);\n\t\tResult[3][1] = valType(0);\n\t\tResult[3][2] = valType(0);\n\t\tResult[3][3] = valType(1);\n\t\treturn Result;\n\t}\n\n\ttemplate <typename valType>\n\tGLM_FUNC_QUALIFIER detail::tmat2x2<valType> orientate2\n\t(\n\t\tvalType const & angle\n\t)\n\t{\n\t\tvalType c = glm::cos(angle);\n\t\tvalType s = glm::sin(angle);\n\n\t\tdetail::tmat2x2<valType> Result;\n\t\tResult[0][0] = c;\n\t\tResult[0][1] = s;\n\t\tResult[1][0] = -s;\n\t\tResult[1][1] = c;\n\t\treturn Result;\n\t}\n\n\ttemplate <typename valType>\n\tGLM_FUNC_QUALIFIER detail::tmat3x3<valType> orientate3\n\t(\n\t\tvalType const & angle\n\t)\n\t{\n\t\tvalType c = glm::cos(angle);\n\t\tvalType s = glm::sin(angle);\n\n\t\tdetail::tmat3x3<valType> Result;\n\t\tResult[0][0] = c;\n\t\tResult[0][1] = s;\n\t\tResult[0][2] = 0.0f;\n\t\tResult[1][0] = -s;\n\t\tResult[1][1] = c;\n\t\tResult[1][2] = 0.0f;\n\t\tResult[2][0] = 0.0f;\n\t\tResult[2][1] = 0.0f;\n\t\tResult[2][2] = 1.0f;\n\t\treturn Result;\n\t}\n\n\ttemplate <typename valType>\n\tGLM_FUNC_QUALIFIER detail::tmat3x3<valType> orientate3\n\t(\n\t\tdetail::tvec3<valType> const & angles\n\t)\n\t{\n\t\treturn detail::tmat3x3<valType>(yawPitchRoll(angles.x, angles.y, angles.z));\n\t}\n\n\ttemplate <typename valType>\n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> orientate4\n\t(\n\t\tdetail::tvec3<valType> const & angles\n\t)\n\t{\n\t\treturn yawPitchRoll(angles.z, angles.x, angles.y);\n\t}\n}\/\/namespace glm\n<commit_msg>Fixed eulerAngleY rotation orientation<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Mathematics Copyright (c) 2005 - 2013 G-Truc Creation (www.g-truc.net)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Created : 2005-12-21\n\/\/ Updated : 2007-08-14\n\/\/ Licence : This source is under MIT License\n\/\/ File    : glm\/gtx\/euler_angles.inl\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace glm\n{\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleX\n\t(\n\t\tvalType const & angleX\n\t)\n\t{\n\t\tvalType cosX = glm::cos(angleX);\n\t\tvalType sinX = glm::sin(angleX);\n\t\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tvalType(1), valType(0), valType(0), valType(0),\n\t\t\tvalType(0), cosX,\t\tsinX,\t\tvalType(0),\n\t\t\tvalType(0),-sinX,\t\tcosX,\t\tvalType(0),\n\t\t\tvalType(0), valType(0), valType(0), valType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleY\n\t(\n\t\tvalType const & angleY\n\t)\n\t{\n\t\tvalType cosY = glm::cos(angleY);\n\t\tvalType sinY = glm::sin(angleY);\n\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tcosY,\t\tvalType(0),-sinY,\t\tvalType(0),\n\t\t\tvalType(0),\tvalType(1),\tvalType(0), valType(0),\n\t\t\tsinY,\t\tvalType(0),\tcosY,\t\tvalType(0),\n\t\t\tvalType(0),\tvalType(0),\tvalType(0), valType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleZ\n\t(\n\t\tvalType const & angleZ\n\t)\n\t{\n\t\tvalType cosZ = glm::cos(angleZ); \n\t\tvalType sinZ = glm::sin(angleZ);\n\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tcosZ,\t\tsinZ,\t\tvalType(0), valType(0),\n\t\t\t-sinZ,\t\tcosZ,\t\tvalType(0), valType(0),\n\t\t\tvalType(0),\tvalType(0),\tvalType(1), valType(0),\n\t\t\tvalType(0),\tvalType(0),\tvalType(0), valType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleXY\n\t(\n\t\tvalType const & angleX, \n\t\tvalType const & angleY\n\t)\n\t{\n\t\tvalType cosX = glm::cos(angleX);\n\t\tvalType sinX = glm::sin(angleX);\n\t\tvalType cosY = glm::cos(angleY);\n\t\tvalType sinY = glm::sin(angleY);\n\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tcosY,\t\t-sinX * sinY,\tcosX * sinY,\tvalType(0),\n\t\t\tvalType(0), cosX,\t\t\tsinX,\t\t\tvalType(0),\n\t\t\t-sinY ,\t\t-sinX * cosY,\tcosX * cosY,\tvalType(0),\n\t\t\tvalType(0), valType(0),     valType(0),\t\tvalType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleYX\n\t(\n\t\tvalType const & angleY, \n\t\tvalType const & angleX\n\t)\n\t{\n\t\tvalType cosX = glm::cos(angleX); \n\t\tvalType sinX = glm::sin(angleX); \n\t\tvalType cosY = glm::cos(angleY); \n\t\tvalType sinY = glm::sin(angleY);\n\n\t\treturn detail::tmat4x4<valType>(\n\t\t\tcosY,\t\t\tvalType(0),\t\tsinY,\t\t\tvalType(0),\n\t\t\t-sinX * sinY,\tcosX,\t\t\tsinX * cosY,\tvalType(0),\n\t\t\t-cosX * sinY,\t-sinX,\t\t\tcosX * cosY,\tvalType(0),\n\t\t\tvalType(0),\t\tvalType(0),\t\tvalType(0),\t\tvalType(1));\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleXZ\n\t(\n\t\tvalType const & angleX, \n\t\tvalType const & angleZ\n\t)\n\t{\n\t\treturn eulerAngleX(angleX) * eulerAngleZ(angleZ);\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleZX\n\t(\n\t\tvalType const & angleZ, \n\t\tvalType const & angleX\n\t)\n\t{\n\t\treturn eulerAngleZ(angleZ) * eulerAngleX(angleX);\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> eulerAngleYXZ\n\t(\n\t\tvalType const & yaw, \n\t\tvalType const & pitch, \n\t\tvalType const & roll\n\t)\n\t{\n\t\tvalType tmp_ch = glm::cos(yaw);\n\t\tvalType tmp_sh = glm::sin(yaw);\n\t\tvalType tmp_cp = glm::cos(pitch);\n\t\tvalType tmp_sp = glm::sin(pitch);\n\t\tvalType tmp_cb = glm::cos(roll);\n\t\tvalType tmp_sb = glm::sin(roll);\n\n\t\tdetail::tmat4x4<valType> Result;\n\t\tResult[0][0] = tmp_ch * tmp_cb + tmp_sh * tmp_sp * tmp_sb;\n\t\tResult[0][1] = tmp_sb * tmp_cp;\n\t\tResult[0][2] = -tmp_sh * tmp_cb + tmp_ch * tmp_sp * tmp_sb;\n\t\tResult[0][3] = valType(0);\n\t\tResult[1][0] = -tmp_ch * tmp_sb + tmp_sh * tmp_sp * tmp_cb;\n\t\tResult[1][1] = tmp_cb * tmp_cp;\n\t\tResult[1][2] = tmp_sb * tmp_sh + tmp_ch * tmp_sp * tmp_cb;\n\t\tResult[1][3] = valType(0);\n\t\tResult[2][0] = tmp_sh * tmp_cp;\n\t\tResult[2][1] = -tmp_sp;\n\t\tResult[2][2] = tmp_ch * tmp_cp;\n\t\tResult[2][3] = valType(0);\n\t\tResult[3][0] = valType(0);\n\t\tResult[3][1] = valType(0);\n\t\tResult[3][2] = valType(0);\n\t\tResult[3][3] = valType(1);\n\t\treturn Result;\n\t}\n\n\ttemplate <typename valType> \n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> yawPitchRoll\n\t(\n\t\tvalType const & yaw, \n\t\tvalType const & pitch, \n\t\tvalType const & roll\n\t)\n\t{\n\t\tvalType tmp_ch = glm::cos(yaw);\n\t\tvalType tmp_sh = glm::sin(yaw);\n\t\tvalType tmp_cp = glm::cos(pitch);\n\t\tvalType tmp_sp = glm::sin(pitch);\n\t\tvalType tmp_cb = glm::cos(roll);\n\t\tvalType tmp_sb = glm::sin(roll);\n\n\t\tdetail::tmat4x4<valType> Result;\n\t\tResult[0][0] = tmp_ch * tmp_cb + tmp_sh * tmp_sp * tmp_sb;\n\t\tResult[0][1] = tmp_sb * tmp_cp;\n\t\tResult[0][2] = -tmp_sh * tmp_cb + tmp_ch * tmp_sp * tmp_sb;\n\t\tResult[0][3] = valType(0);\n\t\tResult[1][0] = -tmp_ch * tmp_sb + tmp_sh * tmp_sp * tmp_cb;\n\t\tResult[1][1] = tmp_cb * tmp_cp;\n\t\tResult[1][2] = tmp_sb * tmp_sh + tmp_ch * tmp_sp * tmp_cb;\n\t\tResult[1][3] = valType(0);\n\t\tResult[2][0] = tmp_sh * tmp_cp;\n\t\tResult[2][1] = -tmp_sp;\n\t\tResult[2][2] = tmp_ch * tmp_cp;\n\t\tResult[2][3] = valType(0);\n\t\tResult[3][0] = valType(0);\n\t\tResult[3][1] = valType(0);\n\t\tResult[3][2] = valType(0);\n\t\tResult[3][3] = valType(1);\n\t\treturn Result;\n\t}\n\n\ttemplate <typename valType>\n\tGLM_FUNC_QUALIFIER detail::tmat2x2<valType> orientate2\n\t(\n\t\tvalType const & angle\n\t)\n\t{\n\t\tvalType c = glm::cos(angle);\n\t\tvalType s = glm::sin(angle);\n\n\t\tdetail::tmat2x2<valType> Result;\n\t\tResult[0][0] = c;\n\t\tResult[0][1] = s;\n\t\tResult[1][0] = -s;\n\t\tResult[1][1] = c;\n\t\treturn Result;\n\t}\n\n\ttemplate <typename valType>\n\tGLM_FUNC_QUALIFIER detail::tmat3x3<valType> orientate3\n\t(\n\t\tvalType const & angle\n\t)\n\t{\n\t\tvalType c = glm::cos(angle);\n\t\tvalType s = glm::sin(angle);\n\n\t\tdetail::tmat3x3<valType> Result;\n\t\tResult[0][0] = c;\n\t\tResult[0][1] = s;\n\t\tResult[0][2] = 0.0f;\n\t\tResult[1][0] = -s;\n\t\tResult[1][1] = c;\n\t\tResult[1][2] = 0.0f;\n\t\tResult[2][0] = 0.0f;\n\t\tResult[2][1] = 0.0f;\n\t\tResult[2][2] = 1.0f;\n\t\treturn Result;\n\t}\n\n\ttemplate <typename valType>\n\tGLM_FUNC_QUALIFIER detail::tmat3x3<valType> orientate3\n\t(\n\t\tdetail::tvec3<valType> const & angles\n\t)\n\t{\n\t\treturn detail::tmat3x3<valType>(yawPitchRoll(angles.x, angles.y, angles.z));\n\t}\n\n\ttemplate <typename valType>\n\tGLM_FUNC_QUALIFIER detail::tmat4x4<valType> orientate4\n\t(\n\t\tdetail::tvec3<valType> const & angles\n\t)\n\t{\n\t\treturn yawPitchRoll(angles.z, angles.x, angles.y);\n\t}\n}\/\/namespace glm\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Icon themes DAGView<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"rectangle_renderer_component.h\"\n#include <cassert>\n\nnamespace bowtie\n{\n\nnamespace\n{\n\nRectangleRendererComponentData initialize_data(void* buffer, unsigned size)\n{\n\tRectangleRendererComponentData new_data;\n\tnew_data.color = (Color*)buffer;\n\tnew_data.rect = (Rect*)(new_data.color + size);\n\tnew_data.render_handle = (RenderResourceHandle*)(new_data.rect + size);\n\treturn new_data;\n}\n\nvoid grow(RectangleRendererComponent& c, Allocator& allocator)\n{\n\tconst unsigned new_capacity = c.capacity == 0 ? 8 : c.capacity * 2;\n\tconst unsigned bytes = new_capacity * rectangle_renderer_component::component_size;\n\tvoid* buffer = allocator.allocate(bytes);\n\n\tauto new_data = initialize_data(buffer, new_capacity);\n\n\tmemcpy(new_data.color, c.data.color, c.num * sizeof(Color));\n\tmemcpy(new_data.rect, c.data.rect, c.num * sizeof(Rect));\n\tmemcpy(new_data.render_handle, c.data.render_handle, c.num * sizeof(RenderResourceHandle));\n\n\tc.data = new_data;\n\n\tallocator.deallocate(c.buffer);\n\tc.buffer = buffer;\n\tc.capacity = new_capacity;\n}\n\nvoid mark_dirty(RectangleRendererComponent& c, Entity e)\n{\n\tauto entity_index = hash::get(c.map, e, 0u);\n\n\tif (c.last_dirty_index != (unsigned)-1 && entity_index <= c.last_dirty_index)\n\t\treturn;\n\n\tauto current_dirty_index = ++c.last_dirty_index;\n\n\tif (current_dirty_index == entity_index)\n\t\treturn;\n\n\tauto color_at_index = c.data.color[current_dirty_index];\n\tauto rect_at_index = c.data.rect[current_dirty_index];\n\tauto render_handle_at_index = c.data.render_handle[current_dirty_index];\n\tc.data.color[current_dirty_index] = rectangle_renderer_component::color(c, e);\n\tc.data.rect[current_dirty_index] = rectangle_renderer_component::rect(c, e);\n\tc.data.render_handle[current_dirty_index] = rectangle_renderer_component::render_handle(c, e);\n\tc.data.color[entity_index] = color_at_index;\n\tc.data.rect[entity_index] = rect_at_index;\n\tc.data.render_handle[entity_index] = render_handle_at_index;\n}\n\n}\n\nnamespace rectangle_renderer_component\n{\n\nvoid init(RectangleRendererComponent& c, Allocator& allocator)\n{\n\tmemset(&c, 0, sizeof(RectangleRendererComponent));\n\tc.map = hash::create<unsigned>(allocator);\n\tc.last_dirty_index = (unsigned)-1;\n}\n\nvoid deinit(RectangleRendererComponent& c, Allocator& allocator)\n{\n\thash::deinit(c.map);\n\tallocator.deallocate(c.buffer);\n}\n\nvoid create(RectangleRendererComponent& c, Entity e, Allocator& allocator)\n{\n\tif (c.num >= c.capacity)\n\t\tgrow(c, allocator);\n\n\tunsigned i = c.num++;\n\thash::set(c.map, e, i);\n\tc.data.color[i] = Color(1, 1, 1, 1);\n\tc.data.rect[i] = Rect();\n\tc.data.render_handle[i] = RenderResourceHandle::NotInitialized;\n}\n\nvoid destroy(RectangleRendererComponent& c, Entity e)\n{\n\tunsigned i = hash::get(c.map, e, 0u);\n\thash::remove(c.map, e);\n\t--c.num;\n\n\tif (i == c.num)\n\t\treturn;\n\t\t\n\tc.data.color[i] = c.data.color[c.num];\n\tc.data.rect[i] = c.data.rect[c.num];\n\tc.data.render_handle[i] = c.data.render_handle[c.num];\n}\n\nvoid set_rect(RectangleRendererComponent& c, Entity e, const Rect& rect)\n{\t\n\tc.data.rect[hash::get(c.map, e)] = rect;\n\tmark_dirty(c, e);\n}\n\nconst Rect& rect(RectangleRendererComponent& c, Entity e)\n{\n\treturn c.data.rect[hash::get(c.map, e)];\n}\n\nvoid set_color(RectangleRendererComponent& c, Entity e, const Color& color)\n{\n\tc.data.color[hash::get(c.map, e)] = color;\n\tmark_dirty(c, e);\n}\n\nconst Color& color(RectangleRendererComponent& c, Entity e)\n{\n\treturn c.data.color[hash::get(c.map, e)];\n}\n\nvoid set_render_handle(RectangleRendererComponent& c, Entity e, RenderResourceHandle render_handle)\n{\n\tc.data.render_handle[hash::get(c.map, e)] = render_handle;\n}\n\nRenderResourceHandle render_handle(RectangleRendererComponent& c, Entity e)\n{\n\treturn c.data.render_handle[hash::get(c.map, e)];\n}\n\nRectangleRendererComponentData* copy_data(RectangleRendererComponent& c, Entity e, Allocator& allocator)\n{\n\tRectangleRendererComponentData* data = (RectangleRendererComponentData*)allocator.allocate(sizeof(RectangleRendererComponentData));\n\t*data = initialize_data(allocator.allocate(component_size), 1);\n\t*data->color = color(c, e);\n\t*data->rect = rect(c, e);\n\t*data->render_handle = render_handle(c, e);\n\treturn data;\n}\n\nRectangleRendererComponentData* copy_dirty_data(RectangleRendererComponent& c, Allocator& allocator)\n{\n\tRectangleRendererComponentData* data = (RectangleRendererComponentData*)allocator.allocate(sizeof(RectangleRendererComponentData));\n\tauto num_dirty = c.last_dirty_index + 1;\n\t*data = initialize_data(allocator.allocate(component_size), num_dirty);\n\tmemcpy(data->color, c.data.color, sizeof(Color) * num_dirty);\n\tmemcpy(data->rect, c.data.rect, sizeof(Rect) * num_dirty);\n\tmemcpy(data->render_handle, c.data.render_handle, sizeof(RenderResourceHandle) * num_dirty);\n\treturn data;\n}\n\n} \/\/ rectangle_renderer_component\n\n} \/\/ namespace bowtie\n<commit_msg>Revised growing of rect component.<commit_after>#pragma once\n\n#include \"rectangle_renderer_component.h\"\n#include <cassert>\n\nnamespace bowtie\n{\n\nnamespace\n{\n\nRectangleRendererComponentData initialize_data(void* buffer, unsigned size)\n{\n\tRectangleRendererComponentData new_data;\n\tnew_data.color = (Color*)buffer;\n\tnew_data.rect = (Rect*)(new_data.color + size);\n\tnew_data.render_handle = (RenderResourceHandle*)(new_data.rect + size);\n\treturn new_data;\n}\n\nvoid grow(RectangleRendererComponent& c, Allocator& allocator)\n{\n\tconst unsigned new_capacity = c.capacity == 0 ? 8 : c.capacity * 2;\n\tconst unsigned bytes = new_capacity * rectangle_renderer_component::component_size;\n\tvoid* buffer = allocator.allocate(bytes);\n\n\tauto new_data = initialize_data(buffer, new_capacity);\n\tmemcpy(new_data.color, c.data.color, c.num * sizeof(Color));\n\tmemcpy(new_data.rect, c.data.rect, c.num * sizeof(Rect));\n\tmemcpy(new_data.render_handle, c.data.render_handle, c.num * sizeof(RenderResourceHandle));\n\tc.data = new_data;\n\n\tallocator.deallocate(c.buffer);\n\tc.buffer = buffer;\n\tc.capacity = new_capacity;\n}\n\nvoid mark_dirty(RectangleRendererComponent& c, Entity e)\n{\n\tauto entity_index = hash::get(c.map, e, 0u);\n\n\tif (c.last_dirty_index != (unsigned)-1 && entity_index <= c.last_dirty_index)\n\t\treturn;\n\n\tauto current_dirty_index = ++c.last_dirty_index;\n\n\tif (current_dirty_index == entity_index)\n\t\treturn;\n\n\tauto color_at_index = c.data.color[current_dirty_index];\n\tauto rect_at_index = c.data.rect[current_dirty_index];\n\tauto render_handle_at_index = c.data.render_handle[current_dirty_index];\n\tc.data.color[current_dirty_index] = c.data.color[entity_index];\n\tc.data.rect[current_dirty_index] = c.data.rect[entity_index];\n\tc.data.render_handle[current_dirty_index] = c.data.render_handle[entity_index];\n\tc.data.color[entity_index] = color_at_index;\n\tc.data.rect[entity_index] = rect_at_index;\n\tc.data.render_handle[entity_index] = render_handle_at_index;\n}\n\n}\n\nnamespace rectangle_renderer_component\n{\n\nvoid init(RectangleRendererComponent& c, Allocator& allocator)\n{\n\tmemset(&c, 0, sizeof(RectangleRendererComponent));\n\tc.map = hash::create<unsigned>(allocator);\n\tc.last_dirty_index = (unsigned)-1;\n}\n\nvoid deinit(RectangleRendererComponent& c, Allocator& allocator)\n{\n\thash::deinit(c.map);\n\tallocator.deallocate(c.buffer);\n}\n\nvoid create(RectangleRendererComponent& c, Entity e, Allocator& allocator)\n{\n\tif (c.num >= c.capacity)\n\t\tgrow(c, allocator);\n\n\tunsigned i = c.num++;\n\thash::set(c.map, e, i);\n\tc.data.color[i] = Color(1, 1, 1, 1);\n\tc.data.rect[i] = Rect();\n\tc.data.render_handle[i] = RenderResourceHandle::NotInitialized;\n}\n\nvoid destroy(RectangleRendererComponent& c, Entity e)\n{\n\tunsigned i = hash::get(c.map, e, 0u);\n\thash::remove(c.map, e);\n\t--c.num;\n\n\tif (i == c.num)\n\t\treturn;\n\t\t\n\tc.data.color[i] = c.data.color[c.num];\n\tc.data.rect[i] = c.data.rect[c.num];\n\tc.data.render_handle[i] = c.data.render_handle[c.num];\n}\n\nvoid set_rect(RectangleRendererComponent& c, Entity e, const Rect& rect)\n{\t\n\tc.data.rect[hash::get(c.map, e)] = rect;\n\tmark_dirty(c, e);\n}\n\nconst Rect& rect(RectangleRendererComponent& c, Entity e)\n{\n\treturn c.data.rect[hash::get(c.map, e)];\n}\n\nvoid set_color(RectangleRendererComponent& c, Entity e, const Color& color)\n{\n\tc.data.color[hash::get(c.map, e)] = color;\n\tmark_dirty(c, e);\n}\n\nconst Color& color(RectangleRendererComponent& c, Entity e)\n{\n\treturn c.data.color[hash::get(c.map, e)];\n}\n\nvoid set_render_handle(RectangleRendererComponent& c, Entity e, RenderResourceHandle render_handle)\n{\n\tc.data.render_handle[hash::get(c.map, e)] = render_handle;\n}\n\nRenderResourceHandle render_handle(RectangleRendererComponent& c, Entity e)\n{\n\treturn c.data.render_handle[hash::get(c.map, e)];\n}\n\nRectangleRendererComponentData* copy_data(RectangleRendererComponent& c, Entity e, Allocator& allocator)\n{\n\tRectangleRendererComponentData* data = (RectangleRendererComponentData*)allocator.allocate(sizeof(RectangleRendererComponentData));\n\t*data = initialize_data(allocator.allocate(component_size), 1);\n\t*data->color = color(c, e);\n\t*data->rect = rect(c, e);\n\t*data->render_handle = render_handle(c, e);\n\treturn data;\n}\n\nRectangleRendererComponentData* copy_dirty_data(RectangleRendererComponent& c, Allocator& allocator)\n{\n\tRectangleRendererComponentData* data = (RectangleRendererComponentData*)allocator.allocate(sizeof(RectangleRendererComponentData));\n\tauto num_dirty = c.last_dirty_index + 1;\n\t*data = initialize_data(allocator.allocate(component_size), num_dirty);\n\tmemcpy(data->color, c.data.color, sizeof(Color) * num_dirty);\n\tmemcpy(data->rect, c.data.rect, sizeof(Rect) * num_dirty);\n\tmemcpy(data->render_handle, c.data.render_handle, sizeof(RenderResourceHandle) * num_dirty);\n\treturn data;\n}\n\n} \/\/ rectangle_renderer_component\n\n} \/\/ namespace bowtie\n<|endoftext|>"}
{"text":"<commit_before>\n#include <fstream>\n#include <memory>\n\n#include <pangolin\/image\/typed_image.h>\n\n#ifdef HAVE_ZSTD\n#  include <zstd.h>\n#endif\n\nnamespace pangolin {\n\n#pragma pack(push, 1)\nstruct zstd_image_header\n{\n    char magic[4];\n    char fmt[16];\n    size_t w, h;\n};\n#pragma pack(pop)\n\nvoid SaveZstd(const Image<unsigned char>& image, const pangolin::PixelFormat& fmt, std::ostream& out, int compression_level)\n{\n#ifdef HAVE_ZSTD\n    \/\/ Write out header, uncompressed\n    zstd_image_header header;\n    strncpy(header.magic,\"ZSTD\",4);\n    strncpy(header.fmt, fmt.format.c_str(), sizeof(header.fmt));\n    header.w = image.w;\n    header.h = image.h;\n    out.write((char*)&header, sizeof(header));\n\n    \/\/ Write out image data\n    const size_t output_buffer_size = ZSTD_CStreamOutSize();\n    std::unique_ptr<char[]> output_buffer(new char[output_buffer_size]);\n\n    ZSTD_CStream* const cstream = ZSTD_createCStream();\n    if (cstream==nullptr) {\n        throw std::runtime_error(\"ZSTD_createCStream() error\");\n    }\n\n    size_t const initResult = ZSTD_initCStream(cstream, compression_level);\n    if (ZSTD_isError(initResult)) {\n        throw std::runtime_error(FormatString(\"ZSTD_initCStream() error : %\", ZSTD_getErrorName(initResult)));\n    }\n\n    const size_t row_size_bytes = (fmt.bpp * image.w)\/8;\n\n    for(size_t y=0; y < image.h; ++y) {\n        ZSTD_inBuffer input = { image.RowPtr(y), row_size_bytes, 0 };\n\n        while (input.pos < input.size) {\n            ZSTD_outBuffer output = { output_buffer.get(), output_buffer_size, 0 };\n            size_t left_to_read = ZSTD_compressStream(cstream, &output , &input);\n            if (ZSTD_isError(left_to_read)) {\n                throw std::runtime_error(FormatString(\"ZSTD_compressStream() error : %\", ZSTD_getErrorName(left_to_read)));\n            }\n            out.write(output_buffer.get(), output.pos);\n        }\n    }\n\n    ZSTD_outBuffer output = { output_buffer.get(), output_buffer_size, 0 };\n    size_t const remainingToFlush = ZSTD_endStream(cstream, &output);   \/* close frame *\/\n    if (remainingToFlush) {\n        throw std::runtime_error(\"not fully flushed\");\n    }\n    out.write(output_buffer.get(), output.pos);\n\n    ZSTD_freeCStream(cstream);\n#else\n    PANGOLIN_UNUSED(image);\n    PANGOLIN_UNUSED(fmt);\n    PANGOLIN_UNUSED(out);\n    PANGOLIN_UNUSED(compression_level);\n    throw std::runtime_error(\"Rebuild Pangolin for ZSTD support.\");\n#endif \/\/ HAVE_ZSTD\n}\n\nTypedImage LoadZstd(std::istream& in)\n{\n#ifdef HAVE_ZSTD\n    \/\/ Read in header, uncompressed\n    zstd_image_header header;\n    in.read( (char*)&header, sizeof(header));\n\n    TypedImage img(header.w, header.h, PixelFormatFromString(header.fmt));\n\n    const size_t input_buffer_size = ZSTD_DStreamInSize();\n    std::unique_ptr<char[]> input_buffer(new char[input_buffer_size]);\n\n    ZSTD_DStream* dstream = ZSTD_createDStream();\n    if(!dstream) {\n        throw std::runtime_error(\"ZSTD_createDStream() error\");\n    }\n\n    size_t read_size_hint = ZSTD_initDStream(dstream);\n    if (ZSTD_isError(read_size_hint)) {\n        throw std::runtime_error(FormatString(\"ZSTD_initDStream() error : % \\n\", ZSTD_getErrorName(read_size_hint)));\n    }\n\n    \/\/ Image represents our fixed buffer.\n    ZSTD_outBuffer output = { img.ptr, img.SizeBytes(), 0 };\n\n    while(read_size_hint)\n    {\n        const size_t read = in.readsome(input_buffer.get(), read_size_hint);\n        ZSTD_inBuffer input = { input_buffer.get(), read, 0 };\n        while (input.pos < input.size) {\n            read_size_hint = ZSTD_decompressStream(dstream, &output , &input);\n            if (ZSTD_isError(read_size_hint)) {\n                throw std::runtime_error(FormatString(\"ZSTD_decompressStream() error : %\", ZSTD_getErrorName(read_size_hint)));\n            }\n        }\n    }\n\n    ZSTD_freeDStream(dstream);\n\n    return img;\n#else\n    PANGOLIN_UNUSED(in);\n    throw std::runtime_error(\"Rebuild Pangolin for ZSTD support.\");\n#endif \/\/ HAVE_ZSTD\n}\n\n}\n<commit_msg>Image: fix for zstd inf loop bug.<commit_after>\n#include <fstream>\n#include <memory>\n\n#include <pangolin\/image\/typed_image.h>\n\n#ifdef HAVE_ZSTD\n#  include <zstd.h>\n#endif\n\nnamespace pangolin {\n\n#pragma pack(push, 1)\nstruct zstd_image_header\n{\n    char magic[4];\n    char fmt[16];\n    size_t w, h;\n};\n#pragma pack(pop)\n\nvoid SaveZstd(const Image<unsigned char>& image, const pangolin::PixelFormat& fmt, std::ostream& out, int compression_level)\n{\n#ifdef HAVE_ZSTD\n    \/\/ Write out header, uncompressed\n    zstd_image_header header;\n    strncpy(header.magic,\"ZSTD\",4);\n    strncpy(header.fmt, fmt.format.c_str(), sizeof(header.fmt));\n    header.w = image.w;\n    header.h = image.h;\n    out.write((char*)&header, sizeof(header));\n\n    \/\/ Write out image data\n    const size_t output_buffer_size = ZSTD_CStreamOutSize();\n    std::unique_ptr<char[]> output_buffer(new char[output_buffer_size]);\n\n    ZSTD_CStream* const cstream = ZSTD_createCStream();\n    if (cstream==nullptr) {\n        throw std::runtime_error(\"ZSTD_createCStream() error\");\n    }\n\n    size_t const initResult = ZSTD_initCStream(cstream, compression_level);\n    if (ZSTD_isError(initResult)) {\n        throw std::runtime_error(FormatString(\"ZSTD_initCStream() error : %\", ZSTD_getErrorName(initResult)));\n    }\n\n    const size_t row_size_bytes = (fmt.bpp * image.w)\/8;\n\n    for(size_t y=0; y < image.h; ++y) {\n        ZSTD_inBuffer input = { image.RowPtr(y), row_size_bytes, 0 };\n\n        while (input.pos < input.size) {\n            ZSTD_outBuffer output = { output_buffer.get(), output_buffer_size, 0 };\n            size_t left_to_read = ZSTD_compressStream(cstream, &output , &input);\n            if (ZSTD_isError(left_to_read)) {\n                throw std::runtime_error(FormatString(\"ZSTD_compressStream() error : %\", ZSTD_getErrorName(left_to_read)));\n            }\n            out.write(output_buffer.get(), output.pos);\n        }\n    }\n\n    ZSTD_outBuffer output = { output_buffer.get(), output_buffer_size, 0 };\n    size_t const remainingToFlush = ZSTD_endStream(cstream, &output);   \/* close frame *\/\n    if (remainingToFlush) {\n        throw std::runtime_error(\"not fully flushed\");\n    }\n    out.write(output_buffer.get(), output.pos);\n\n    ZSTD_freeCStream(cstream);\n#else\n    PANGOLIN_UNUSED(image);\n    PANGOLIN_UNUSED(fmt);\n    PANGOLIN_UNUSED(out);\n    PANGOLIN_UNUSED(compression_level);\n    throw std::runtime_error(\"Rebuild Pangolin for ZSTD support.\");\n#endif \/\/ HAVE_ZSTD\n}\n\nTypedImage LoadZstd(std::istream& in)\n{\n#ifdef HAVE_ZSTD\n    \/\/ Read in header, uncompressed\n    zstd_image_header header;\n    in.read( (char*)&header, sizeof(header));\n\n    TypedImage img(header.w, header.h, PixelFormatFromString(header.fmt));\n\n    const size_t input_buffer_size = ZSTD_DStreamInSize();\n    std::unique_ptr<char[]> input_buffer(new char[input_buffer_size]);\n\n    ZSTD_DStream* dstream = ZSTD_createDStream();\n    if(!dstream) {\n        throw std::runtime_error(\"ZSTD_createDStream() error\");\n    }\n\n    size_t read_size_hint = ZSTD_initDStream(dstream);\n    if (ZSTD_isError(read_size_hint)) {\n        throw std::runtime_error(FormatString(\"ZSTD_initDStream() error : % \\n\", ZSTD_getErrorName(read_size_hint)));\n    }\n\n    \/\/ Image represents our fixed buffer.\n    ZSTD_outBuffer output = { img.ptr, img.SizeBytes(), 0 };\n\n    while(read_size_hint)\n    {\n        in.read(input_buffer.get(), read_size_hint);\n        ZSTD_inBuffer input = { input_buffer.get(), read_size_hint, 0 };\n        while (input.pos < input.size) {\n            read_size_hint = ZSTD_decompressStream(dstream, &output , &input);\n            if (ZSTD_isError(read_size_hint)) {\n                throw std::runtime_error(FormatString(\"ZSTD_decompressStream() error : %\", ZSTD_getErrorName(read_size_hint)));\n            }\n        }\n    }\n\n    ZSTD_freeDStream(dstream);\n\n    return img;\n#else\n    PANGOLIN_UNUSED(in);\n    throw std::runtime_error(\"Rebuild Pangolin for ZSTD support.\");\n#endif \/\/ HAVE_ZSTD\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2010-2011, 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 \"IECore\/TriangulateOp.h\"\n#include \"IECore\/FileNameParameter.h\"\n\n#include \"IECoreRI\/GXEvaluator.h\"\n#include \"IECoreRI\/Renderer.h\"\n#include \"IECoreRI\/ScopedContext.h\"\n\nusing namespace std;\nusing namespace IECore;\nusing namespace IECoreRI;\n\nGXEvaluator::GXEvaluator( const IECore::Primitive *primitive )\n{\n\tRtContextHandle prevContext = RiGetContext();\n\tRiBegin( 0 );\n\tm_context = RiGetContext();\n\t\n\tRendererPtr renderer = new IECoreRI::Renderer();\n\tRtObjectHandle objectHandle = RiObjectBegin();\n\t\n\t\tprimitive->render( renderer );\n\t\n\tRiObjectEnd();\n\t\n\tm_geo = GxGetGeometry( objectHandle );\n\n\tRiContext( prevContext );\n\t\n\tfor( PrimitiveVariableMap::const_iterator it=primitive->variables.begin(); it!=primitive->variables.end(); it++ )\n\t{\n\t\tif( !it->second.data )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tIECore::TypeId type = it->second.data->typeId();\n\t\tif( type!=V3fVectorDataTypeId && type!=Color3fVectorDataTypeId && type!=FloatVectorDataTypeId )\n\t\t{\n\t\t\tm_primitiveVariableTypes[it->first] = InvalidTypeId;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_primitiveVariableTypes[it->first] = type;\n\t\t}\n\t}\n\tm_primitiveVariableTypes[\"N\"] = V3fVectorDataTypeId;     \/\/ these can be queried even if a primitive variable\n\tm_primitiveVariableTypes[\"Ng\"] = V3fVectorDataTypeId;    \/\/ of that name hasn't been supplied.\n\tm_primitiveVariableTypes[\"dPdu\"] = V3fVectorDataTypeId;\n\tm_primitiveVariableTypes[\"dPdv\"] = V3fVectorDataTypeId;\n}\n\nGXEvaluator::~GXEvaluator()\n{\n\tRtContextHandle c = RiGetContext();\n\tRiContext( m_context );\n\tRiEnd();\n\tif( c!=m_context )\n\t{\n\t\tRiContext( c );\n\t}\n}\n\nunsigned GXEvaluator::numFaces() const\n{\n\tScopedContext context( m_context );\n\treturn GxGetFaceCount( m_geo );\n}\n\ntemplate<typename T>\nstatic DataPtr evaluatePrimitiveVariable( std::vector<GxSurfacePoint> &points, const std::string &primVarName )\n{\n\ttypename T::Ptr result = new T;\n\tresult->writable().resize( points.size() );\n\tif( points.size() )\n\t{\n\t\tGxEvaluateSurface( points.size(), &(points[0]), primVarName.c_str(), result->baseSize() \/ points.size(), result->baseWritable() );\n\t}\n\treturn result;\n}\n\nIECore::CompoundDataPtr GXEvaluator::evaluate( const IECore::IntVectorData *faceIndices, const IECore::FloatVectorData *u, const IECore::FloatVectorData *v, const std::vector<std::string> &primVarNames ) const\n{\n\t\/\/ do some basic validation of our input\n\n\tsize_t numPoints = faceIndices->readable().size();\n\tif( u->readable().size() != numPoints || v->readable().size() != numPoints )\n\t{\n\t\tthrow InvalidArgumentException( \"faceIndices, u and v must all have the same length\" );\n\t}\n\t\n\tvalidatePrimVarNames( primVarNames );\n\t\n\t\/\/ create surface points\n\tScopedContext context( m_context );\n\n\tconst std::vector<int> faceIndicesReadable = faceIndices->readable();\n\tconst std::vector<float> uReadable = u->readable();\n\tconst std::vector<float> vReadable = v->readable();\n\t\n\tstd::vector<GxSurfacePoint> surfacePoints( numPoints );\n\tfor( unsigned i=0; i<numPoints; i++ )\n\t{\n\t\tint status = GxCreateSurfacePoint( m_geo, faceIndicesReadable[i], uReadable[i], vReadable[i], 0.0f, &(surfacePoints[i]) );\n\t\tif( status==RIE_RANGE )\n\t\t{\n\t\t\tfor( unsigned j=0; j<i; j++ )\n\t\t\t{\n\t\t\t\tGxFreeSurfacePoint( surfacePoints[j] );\t\t\t\t\n\t\t\t}\n\t\t\tthrow InvalidArgumentException( boost::str( boost::format( \"faceIndex %d out of range\" ) % faceIndicesReadable[i] ) );\n\t\t}\n\t}\n\n\t\/\/ query all the primvars\n\n\tIECore::CompoundDataPtr result = new IECore::CompoundData;\n\tfor( vector<string>::const_iterator it=primVarNames.begin(); it!=primVarNames.end(); it++ )\n\t{\n\t\tswitch( m_primitiveVariableTypes.find( *it )->second )\n\t\t{\n\t\t\tcase FloatVectorDataTypeId :\n\t\t\t\tresult->writable()[*it] = evaluatePrimitiveVariable<FloatVectorData>( surfacePoints, *it );\n\t\t\t\tbreak;\n\t\t\tcase V3fVectorDataTypeId :\n\t\t\t\tresult->writable()[*it] = evaluatePrimitiveVariable<V3fVectorData>( surfacePoints, *it );\n\t\t\t\tbreak;\n\t\t\tcase Color3fVectorDataTypeId :\n\t\t\t\tresult->writable()[*it] = evaluatePrimitiveVariable<Color3fVectorData>( surfacePoints, *it );\n\t\t\t\tbreak;\n\t\t\tdefault :\n\t\t\t\tassert( 0 ); \/\/ shouldnt be here as we checked types earlier\n\t\t}\n\t}\n\n\t\/\/ clean up\n\n\tfor( unsigned i=0; i<numPoints; i++ )\n\t{\n\t\tGxFreeSurfacePoint( surfacePoints[i] );\n\t}\n\t\n\treturn result;\n}\n\nIECore::CompoundDataPtr GXEvaluator::evaluate( const IECore::FloatVectorData *s, const IECore::FloatVectorData *t, const std::vector<std::string> &primVarNames ) const\n{\n\tsize_t numPoints = s->readable().size();\n\tif( t->readable().size() != numPoints )\n\t{\n\t\tthrow InvalidArgumentException( \"s and t must have the same length\" );\n\t}\n\t\t\n\tbuildSTEvaluator();\n\t\n\tMeshPrimitiveEvaluator::ResultPtr evaluatorResult = staticPointerCast<MeshPrimitiveEvaluator::Result>( m_stEvaluator->createResult() );\n\tIntVectorDataPtr fData = new IntVectorData;\n\tFloatVectorDataPtr uData = new FloatVectorData;\n\tFloatVectorDataPtr vData = new FloatVectorData;\n\tBoolVectorDataPtr statusData = new BoolVectorData;\n\tstd::vector<int> &fWritable = fData->writable(); fWritable.resize( numPoints );\n\tstd::vector<float> &uWritable = uData->writable(); uWritable.resize( numPoints );\n\tstd::vector<float> &vWritable = vData->writable(); vWritable.resize( numPoints );\n\tstd::vector<bool> &statusWritable = statusData->writable(); statusWritable.resize( numPoints );\n\t\n\tconst std::vector<float> &sReadable = s->readable();\n\tconst std::vector<float> &tReadable = t->readable();\n\t\n\tconst PrimitiveVariable &uPrimVar = m_stEvaluator->primitive()->variables.find( \"u\" )->second;\n\tconst PrimitiveVariable &vPrimVar = m_stEvaluator->primitive()->variables.find( \"v\" )->second;\n\tfor( size_t i=0; i<numPoints; i++ )\n\t{\n\t\tbool success = m_stEvaluator->pointAtUV( Imath::V2f( sReadable[i], tReadable[i] ), evaluatorResult );\n\t\t\/\/ dividing by 2 maps from the triangle index to the original face index of the mesh before it\n\t\t\/\/ was triangulated - we can guarantee this because the original mesh was all quads.\n\t\tfWritable[i] = success ? evaluatorResult->triangleIndex() \/ 2 : 0;\n\t\tuWritable[i] = success ? evaluatorResult->floatPrimVar( uPrimVar ) : 0;\n\t\tvWritable[i] = success ? evaluatorResult->floatPrimVar( vPrimVar ) : 0;\n\t\tstatusWritable[i] = success;\n\t}\n\n\tCompoundDataPtr result = evaluate( fData, uData, vData, primVarNames );\n\tresult->writable()[\"gxStatus\"] = statusData;\n\t\n\treturn result;\n}\n\nvoid GXEvaluator::validatePrimVarNames( const std::vector<std::string> &primVarNames ) const\n{\n\tfor( vector<string>::const_iterator it=primVarNames.begin(); it!=primVarNames.end(); it++ )\n\t{\n\t\tPrimitiveVariableTypeMap::const_iterator pvIt = m_primitiveVariableTypes.find( *it );\n\t\tif( pvIt == m_primitiveVariableTypes.end() )\n\t\t{\n\t\t\tthrow InvalidArgumentException( boost::str( boost::format( \"Primitive variable \\\"%s\\\" does not exist\" ) % *it ) );\n\t\t}\n\t\tif( pvIt->second==InvalidTypeId )\n\t\t{\n\t\t\tthrow InvalidArgumentException( boost::str( boost::format( \"Primitive variable \\\"%s\\\" has unsupported type\" ) % *it ) );\n\t\t}\n\t}\n}\n\nvoid GXEvaluator::buildSTEvaluator() const\n{\n\tMutex::scoped_lock lock( m_stEvaluatorMutex, false ); \/\/ read only lock\n\tif( m_stEvaluator )\n\t{\n\t\treturn;\n\t}\n\tlock.upgrade_to_writer();\n\tif( m_stEvaluator )\n\t{\n\t\treturn;\n\t}\n\t\t\n\tsize_t nFaces = numFaces();\n\tsize_t nVertices = nFaces * 4;\n\t\n\tIntVectorDataPtr faceIndicesData = new IntVectorData;\n\tFloatVectorDataPtr uData = new FloatVectorData;\n\tFloatVectorDataPtr vData = new FloatVectorData;\n\tstd::vector<int> &faceIndicesWritable = faceIndicesData->writable(); faceIndicesWritable.resize( nVertices );\n\tstd::vector<float> &uWritable = uData->writable(); uWritable.resize( nVertices );\n\tstd::vector<float> &vWritable = vData->writable(); vWritable.resize( nVertices );\n\t\n\tsize_t vi = 0;\n\tfor( size_t fi=0; fi<nFaces; fi++ )\n\t{\n\t\tfaceIndicesWritable[vi] = fi;\n\t\tfaceIndicesWritable[vi+1] = fi;\n\t\tfaceIndicesWritable[vi+2] = fi;\n\t\tfaceIndicesWritable[vi+3] = fi;\n\t\tuWritable[vi] = 0;\n\t\tuWritable[vi+1] = 0;\n\t\tuWritable[vi+2] = 1;\n\t\tuWritable[vi+3] = 1;\n\t\tvWritable[vi] = 0;\n\t\tvWritable[vi+1] = 1;\n\t\tvWritable[vi+2] = 1;\n\t\tvWritable[vi+3] = 0;\n\t\tvi += 4;\n\t}\n\t\n\tstd::vector<std::string> primVarNames;\n\tprimVarNames.push_back( \"P\" );\n\tprimVarNames.push_back( \"s\" );\n\tprimVarNames.push_back( \"t\" );\n\tCompoundDataPtr vertexData = evaluate( faceIndicesData, uData, vData, primVarNames );\n\t\n\tIntVectorDataPtr verticesPerFaceData = new IntVectorData;\n\tIntVectorDataPtr vertexIdsData = new IntVectorData;\n\tstd::vector<int> &verticesPerFace = verticesPerFaceData->writable(); verticesPerFace.resize( nFaces, 4 );\n\tstd::vector<int> &vertexIds = vertexIdsData->writable(); vertexIds.resize( nVertices );\n\tfor( size_t i=0; i<nVertices; i++ )\n\t{\n\t\tvertexIds[i] = i;\n\t}\n\tMeshPrimitivePtr mesh = new MeshPrimitive( verticesPerFaceData, vertexIdsData );\n\tmesh->variables[\"P\"] = PrimitiveVariable( PrimitiveVariable::Vertex, vertexData->member<V3fVectorData>( \"P\" ) );\n\tmesh->variables[\"s\"] = PrimitiveVariable( PrimitiveVariable::FaceVarying, vertexData->member<FloatVectorData>( \"s\" ) );\n\tmesh->variables[\"t\"] = PrimitiveVariable( PrimitiveVariable::FaceVarying, vertexData->member<FloatVectorData>( \"t\" ) );\n\tmesh->variables[\"u\"] = PrimitiveVariable( PrimitiveVariable::Vertex, uData );\n\tmesh->variables[\"v\"] = PrimitiveVariable( PrimitiveVariable::Vertex, vData );\n\t\n\tTriangulateOpPtr op = new TriangulateOp();\n\top->inputParameter()->setValue( mesh );\n\top->copyParameter()->setTypedValue( false );\n\top->throwExceptionsParameter()->setTypedValue( false );\n\top->operate();\n\t\n\tm_stEvaluator = new MeshPrimitiveEvaluator( mesh );\n}\n<commit_msg>Fixing memory leak.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2010-2011, 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 \"IECore\/TriangulateOp.h\"\n#include \"IECore\/FileNameParameter.h\"\n\n#include \"IECoreRI\/GXEvaluator.h\"\n#include \"IECoreRI\/Renderer.h\"\n#include \"IECoreRI\/ScopedContext.h\"\n\nusing namespace std;\nusing namespace IECore;\nusing namespace IECoreRI;\n\nGXEvaluator::GXEvaluator( const IECore::Primitive *primitive )\n{\n\tRtContextHandle prevContext = RiGetContext();\n\tRiBegin( 0 );\n\tm_context = RiGetContext();\n\t\n\tRendererPtr renderer = new IECoreRI::Renderer();\n\tRtObjectHandle objectHandle = RiObjectBegin();\n\t\n\t\tprimitive->render( renderer );\n\t\n\tRiObjectEnd();\n\t\n\tm_geo = GxGetGeometry( objectHandle );\n\n\tRiContext( prevContext );\n\t\n\tfor( PrimitiveVariableMap::const_iterator it=primitive->variables.begin(); it!=primitive->variables.end(); it++ )\n\t{\n\t\tif( !it->second.data )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tIECore::TypeId type = it->second.data->typeId();\n\t\tif( type!=V3fVectorDataTypeId && type!=Color3fVectorDataTypeId && type!=FloatVectorDataTypeId )\n\t\t{\n\t\t\tm_primitiveVariableTypes[it->first] = InvalidTypeId;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_primitiveVariableTypes[it->first] = type;\n\t\t}\n\t}\n\tm_primitiveVariableTypes[\"N\"] = V3fVectorDataTypeId;     \/\/ these can be queried even if a primitive variable\n\tm_primitiveVariableTypes[\"Ng\"] = V3fVectorDataTypeId;    \/\/ of that name hasn't been supplied.\n\tm_primitiveVariableTypes[\"dPdu\"] = V3fVectorDataTypeId;\n\tm_primitiveVariableTypes[\"dPdv\"] = V3fVectorDataTypeId;\n}\n\nGXEvaluator::~GXEvaluator()\n{\n\tRtContextHandle c = RiGetContext();\n\tRiContext( m_context );\n\tGxFreeGeometry( m_geo );\n\tRiEnd();\n\tif( c!=m_context )\n\t{\n\t\tRiContext( c );\n\t}\n}\n\nunsigned GXEvaluator::numFaces() const\n{\n\tScopedContext context( m_context );\n\treturn GxGetFaceCount( m_geo );\n}\n\ntemplate<typename T>\nstatic DataPtr evaluatePrimitiveVariable( std::vector<GxSurfacePoint> &points, const std::string &primVarName )\n{\n\ttypename T::Ptr result = new T;\n\tresult->writable().resize( points.size() );\n\tif( points.size() )\n\t{\n\t\tGxEvaluateSurface( points.size(), &(points[0]), primVarName.c_str(), result->baseSize() \/ points.size(), result->baseWritable() );\n\t}\n\treturn result;\n}\n\nIECore::CompoundDataPtr GXEvaluator::evaluate( const IECore::IntVectorData *faceIndices, const IECore::FloatVectorData *u, const IECore::FloatVectorData *v, const std::vector<std::string> &primVarNames ) const\n{\n\t\/\/ do some basic validation of our input\n\n\tsize_t numPoints = faceIndices->readable().size();\n\tif( u->readable().size() != numPoints || v->readable().size() != numPoints )\n\t{\n\t\tthrow InvalidArgumentException( \"faceIndices, u and v must all have the same length\" );\n\t}\n\t\n\tvalidatePrimVarNames( primVarNames );\n\t\n\t\/\/ create surface points\n\tScopedContext context( m_context );\n\n\tconst std::vector<int> faceIndicesReadable = faceIndices->readable();\n\tconst std::vector<float> uReadable = u->readable();\n\tconst std::vector<float> vReadable = v->readable();\n\t\n\tstd::vector<GxSurfacePoint> surfacePoints( numPoints );\n\tfor( unsigned i=0; i<numPoints; i++ )\n\t{\n\t\tint status = GxCreateSurfacePoint( m_geo, faceIndicesReadable[i], uReadable[i], vReadable[i], 0.0f, &(surfacePoints[i]) );\n\t\tif( status==RIE_RANGE )\n\t\t{\n\t\t\tfor( unsigned j=0; j<i; j++ )\n\t\t\t{\n\t\t\t\tGxFreeSurfacePoint( surfacePoints[j] );\t\t\t\t\n\t\t\t}\n\t\t\tthrow InvalidArgumentException( boost::str( boost::format( \"faceIndex %d out of range\" ) % faceIndicesReadable[i] ) );\n\t\t}\n\t}\n\n\t\/\/ query all the primvars\n\n\tIECore::CompoundDataPtr result = new IECore::CompoundData;\n\tfor( vector<string>::const_iterator it=primVarNames.begin(); it!=primVarNames.end(); it++ )\n\t{\n\t\tswitch( m_primitiveVariableTypes.find( *it )->second )\n\t\t{\n\t\t\tcase FloatVectorDataTypeId :\n\t\t\t\tresult->writable()[*it] = evaluatePrimitiveVariable<FloatVectorData>( surfacePoints, *it );\n\t\t\t\tbreak;\n\t\t\tcase V3fVectorDataTypeId :\n\t\t\t\tresult->writable()[*it] = evaluatePrimitiveVariable<V3fVectorData>( surfacePoints, *it );\n\t\t\t\tbreak;\n\t\t\tcase Color3fVectorDataTypeId :\n\t\t\t\tresult->writable()[*it] = evaluatePrimitiveVariable<Color3fVectorData>( surfacePoints, *it );\n\t\t\t\tbreak;\n\t\t\tdefault :\n\t\t\t\tassert( 0 ); \/\/ shouldnt be here as we checked types earlier\n\t\t}\n\t}\n\n\t\/\/ clean up\n\n\tfor( unsigned i=0; i<numPoints; i++ )\n\t{\n\t\tGxFreeSurfacePoint( surfacePoints[i] );\n\t}\n\t\n\treturn result;\n}\n\nIECore::CompoundDataPtr GXEvaluator::evaluate( const IECore::FloatVectorData *s, const IECore::FloatVectorData *t, const std::vector<std::string> &primVarNames ) const\n{\n\tsize_t numPoints = s->readable().size();\n\tif( t->readable().size() != numPoints )\n\t{\n\t\tthrow InvalidArgumentException( \"s and t must have the same length\" );\n\t}\n\t\t\n\tbuildSTEvaluator();\n\t\n\tMeshPrimitiveEvaluator::ResultPtr evaluatorResult = staticPointerCast<MeshPrimitiveEvaluator::Result>( m_stEvaluator->createResult() );\n\tIntVectorDataPtr fData = new IntVectorData;\n\tFloatVectorDataPtr uData = new FloatVectorData;\n\tFloatVectorDataPtr vData = new FloatVectorData;\n\tBoolVectorDataPtr statusData = new BoolVectorData;\n\tstd::vector<int> &fWritable = fData->writable(); fWritable.resize( numPoints );\n\tstd::vector<float> &uWritable = uData->writable(); uWritable.resize( numPoints );\n\tstd::vector<float> &vWritable = vData->writable(); vWritable.resize( numPoints );\n\tstd::vector<bool> &statusWritable = statusData->writable(); statusWritable.resize( numPoints );\n\t\n\tconst std::vector<float> &sReadable = s->readable();\n\tconst std::vector<float> &tReadable = t->readable();\n\t\n\tconst PrimitiveVariable &uPrimVar = m_stEvaluator->primitive()->variables.find( \"u\" )->second;\n\tconst PrimitiveVariable &vPrimVar = m_stEvaluator->primitive()->variables.find( \"v\" )->second;\n\tfor( size_t i=0; i<numPoints; i++ )\n\t{\n\t\tbool success = m_stEvaluator->pointAtUV( Imath::V2f( sReadable[i], tReadable[i] ), evaluatorResult );\n\t\t\/\/ dividing by 2 maps from the triangle index to the original face index of the mesh before it\n\t\t\/\/ was triangulated - we can guarantee this because the original mesh was all quads.\n\t\tfWritable[i] = success ? evaluatorResult->triangleIndex() \/ 2 : 0;\n\t\tuWritable[i] = success ? evaluatorResult->floatPrimVar( uPrimVar ) : 0;\n\t\tvWritable[i] = success ? evaluatorResult->floatPrimVar( vPrimVar ) : 0;\n\t\tstatusWritable[i] = success;\n\t}\n\n\tCompoundDataPtr result = evaluate( fData, uData, vData, primVarNames );\n\tresult->writable()[\"gxStatus\"] = statusData;\n\t\n\treturn result;\n}\n\nvoid GXEvaluator::validatePrimVarNames( const std::vector<std::string> &primVarNames ) const\n{\n\tfor( vector<string>::const_iterator it=primVarNames.begin(); it!=primVarNames.end(); it++ )\n\t{\n\t\tPrimitiveVariableTypeMap::const_iterator pvIt = m_primitiveVariableTypes.find( *it );\n\t\tif( pvIt == m_primitiveVariableTypes.end() )\n\t\t{\n\t\t\tthrow InvalidArgumentException( boost::str( boost::format( \"Primitive variable \\\"%s\\\" does not exist\" ) % *it ) );\n\t\t}\n\t\tif( pvIt->second==InvalidTypeId )\n\t\t{\n\t\t\tthrow InvalidArgumentException( boost::str( boost::format( \"Primitive variable \\\"%s\\\" has unsupported type\" ) % *it ) );\n\t\t}\n\t}\n}\n\nvoid GXEvaluator::buildSTEvaluator() const\n{\n\tMutex::scoped_lock lock( m_stEvaluatorMutex, false ); \/\/ read only lock\n\tif( m_stEvaluator )\n\t{\n\t\treturn;\n\t}\n\tlock.upgrade_to_writer();\n\tif( m_stEvaluator )\n\t{\n\t\treturn;\n\t}\n\t\t\n\tsize_t nFaces = numFaces();\n\tsize_t nVertices = nFaces * 4;\n\t\n\tIntVectorDataPtr faceIndicesData = new IntVectorData;\n\tFloatVectorDataPtr uData = new FloatVectorData;\n\tFloatVectorDataPtr vData = new FloatVectorData;\n\tstd::vector<int> &faceIndicesWritable = faceIndicesData->writable(); faceIndicesWritable.resize( nVertices );\n\tstd::vector<float> &uWritable = uData->writable(); uWritable.resize( nVertices );\n\tstd::vector<float> &vWritable = vData->writable(); vWritable.resize( nVertices );\n\t\n\tsize_t vi = 0;\n\tfor( size_t fi=0; fi<nFaces; fi++ )\n\t{\n\t\tfaceIndicesWritable[vi] = fi;\n\t\tfaceIndicesWritable[vi+1] = fi;\n\t\tfaceIndicesWritable[vi+2] = fi;\n\t\tfaceIndicesWritable[vi+3] = fi;\n\t\tuWritable[vi] = 0;\n\t\tuWritable[vi+1] = 0;\n\t\tuWritable[vi+2] = 1;\n\t\tuWritable[vi+3] = 1;\n\t\tvWritable[vi] = 0;\n\t\tvWritable[vi+1] = 1;\n\t\tvWritable[vi+2] = 1;\n\t\tvWritable[vi+3] = 0;\n\t\tvi += 4;\n\t}\n\t\n\tstd::vector<std::string> primVarNames;\n\tprimVarNames.push_back( \"P\" );\n\tprimVarNames.push_back( \"s\" );\n\tprimVarNames.push_back( \"t\" );\n\tCompoundDataPtr vertexData = evaluate( faceIndicesData, uData, vData, primVarNames );\n\t\n\tIntVectorDataPtr verticesPerFaceData = new IntVectorData;\n\tIntVectorDataPtr vertexIdsData = new IntVectorData;\n\tstd::vector<int> &verticesPerFace = verticesPerFaceData->writable(); verticesPerFace.resize( nFaces, 4 );\n\tstd::vector<int> &vertexIds = vertexIdsData->writable(); vertexIds.resize( nVertices );\n\tfor( size_t i=0; i<nVertices; i++ )\n\t{\n\t\tvertexIds[i] = i;\n\t}\n\tMeshPrimitivePtr mesh = new MeshPrimitive( verticesPerFaceData, vertexIdsData );\n\tmesh->variables[\"P\"] = PrimitiveVariable( PrimitiveVariable::Vertex, vertexData->member<V3fVectorData>( \"P\" ) );\n\tmesh->variables[\"s\"] = PrimitiveVariable( PrimitiveVariable::FaceVarying, vertexData->member<FloatVectorData>( \"s\" ) );\n\tmesh->variables[\"t\"] = PrimitiveVariable( PrimitiveVariable::FaceVarying, vertexData->member<FloatVectorData>( \"t\" ) );\n\tmesh->variables[\"u\"] = PrimitiveVariable( PrimitiveVariable::Vertex, uData );\n\tmesh->variables[\"v\"] = PrimitiveVariable( PrimitiveVariable::Vertex, vData );\n\t\n\tTriangulateOpPtr op = new TriangulateOp();\n\top->inputParameter()->setValue( mesh );\n\top->copyParameter()->setTypedValue( false );\n\top->throwExceptionsParameter()->setTypedValue( false );\n\top->operate();\n\t\n\tm_stEvaluator = new MeshPrimitiveEvaluator( mesh );\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __TIME_ELAPSED_HPP__\n#define\t__TIME_ELAPSED_HPP__\n\n#include <chrono>\n#include <iostream>\n#include <iomanip>\n#include <string>\n\n#ifdef NO_TIME_ELAPSED_MEASUREMENT\n#  define\tTIME_ELAPSED_N(n,body)\t\t\t\t\ttime_elapsed_impl_noop<n>([&]{body;})\n#  define\tTIME_ELAPSED_EXP_N(n,body)\t\t\t\ttime_elapsed_impl_noop<n>([&]{body;})\n#  define\tTIME_ELAPSED_MARKER_N(n,marker,body)\ttime_elapsed_impl_noop<n>([&]{body;})\n#else\n#  define\tTIME_ELAPSED_N(n,body)\t\t\t\t\ttime_elapsed_impl1<n>([&]{body;},__FILE__,__LINE__)\n#  define\tTIME_ELAPSED_EXP_N(n,body)\t\t\t\ttime_elapsed_impl2<n>([&]{body;},#body)\n#  define\tTIME_ELAPSED_MARKER_N(n,marker,body)\ttime_elapsed_impl_core<n>([&]{body;},marker)\n#endif\n\n#define\tTIME_ELAPSED(body)\t\t\t\t\t\t\tTIME_ELAPSED_N(1,body)\n#define\tTIME_ELAPSED_EXP(body)\t\t\t\t\t\tTIME_ELAPSED_EXP_N(1,body)\n#define\tTIME_ELAPSED_MARKER(marker,body)\t\t\tTIME_ELAPSED_MARKER_N(1,marker,body)\n\n#define\tTIME_ELAPSED_HEADER\t\t\t\t\t\t\t\"ElapsedTime: \"\n#define\tTIME_ELAPSED_HEADER_WIDTH\t\t\t\t\t48\n\n\ntemplate <const int count, typename BlockBody>\ninline void time_elapsed_impl_core(BlockBody body, const std::string& header, std::ostream &o = std::cout)\n{\n\tusing namespace std;\n\tusing namespace std::chrono;\n\n\tauto t0 = high_resolution_clock::now();\n\n\tfor (int i = 0; i < count; i++)\n\t\tbody();\n\n\tauto t1 = high_resolution_clock::now();\n\n\n\t\/\/ Now, print out the elapsed time with its header\n\tauto prev_flags = o.flags();\n\tauto prev_precision = o.precision();\n\tauto prev_width = o.width();\n\n\to << left << setw(TIME_ELAPSED_HEADER_WIDTH) << (TIME_ELAPSED_HEADER + header);\n\to << \"cnt:\" << setw(8) << count;\n\to << setw(12) << right << fixed << setprecision(3)\n\t\t<< (float)duration_cast<microseconds>(t1 - t0).count()\/1000 << \" msec\" << endl;\n\n\to.width(prev_width);\n\to.precision(prev_precision);\n\to.flags(prev_flags);\n}\n\ntemplate <const int count, typename BlockBody>\ninline void time_elapsed_impl_noop(BlockBody body, std::ostream &o = std::cout)\n{\n\tfor (int i = 0; i < count; i++)\n\t\tbody();\n}\n\ntemplate <int count, typename BlockBody>\ninline void time_elapsed_impl1(BlockBody body, const char * const path, const int lno, std::ostream &o = std::cout)\n{\n\tstd::string basename{ path + std::string(path).find_last_of(\"\\\\\/\") + 1 };\n\ttime_elapsed_impl_core<count>(body, basename + \" at L.\" + std::to_string(lno), o);\n}\n\ntemplate <int count, typename BlockBody>\ninline void time_elapsed_impl2(BlockBody body, const char * const bodystr, std::ostream &o = std::cout)\n{\n\tstd::string heading{ std::string(bodystr).substr(0,TIME_ELAPSED_HEADER_WIDTH - sizeof(TIME_ELAPSED_HEADER) - 2)\t};\n\ttime_elapsed_impl_core<count>(body, heading, o);\n}\n\n#endif \/\/ !__TIME_ELAPSED_HPP__\n<commit_msg>Fix a bug that a comma passed to the macro arguments will trigger C4002<commit_after>#ifndef __TIME_ELAPSED_HPP__\n#define\t__TIME_ELAPSED_HPP__\n\n#include <chrono>\n#include <iostream>\n#include <iomanip>\n#include <string>\n\n#ifdef NO_TIME_ELAPSED_MEASUREMENT\n#  define\tTIME_ELAPSED_N(n,...)\t\t\t\t\ttime_elapsed_impl_noop<n>([&]{__VA_ARGS__;})\n#  define\tTIME_ELAPSED_EXP_N(n,...)\t\t\t\ttime_elapsed_impl_noop<n>([&]{__VA_ARGS__;})\n#  define\tTIME_ELAPSED_MARKER_N(n,marker,...)\t\ttime_elapsed_impl_noop<n>([&]{__VA_ARGS__;})\n#else\n#  define\tTIME_ELAPSED_N(n,...)\t\t\t\t\ttime_elapsed_impl1<n>([&]{__VA_ARGS__;},__FILE__,__LINE__)\n#  define\tTIME_ELAPSED_EXP_N(n,...)\t\t\t\ttime_elapsed_impl2<n>([&]{__VA_ARGS__;},#__VA_ARGS__)\n#  define\tTIME_ELAPSED_MARKER_N(n,marker,...)\t\ttime_elapsed_impl_core<n>([&]{__VA_ARGS__;},marker)\n#endif\n\n#define\tTIME_ELAPSED(...)\t\t\t\t\t\t\tTIME_ELAPSED_N(1,__VA_ARGS__)\n#define\tTIME_ELAPSED_EXP(...)\t\t\t\t\t\tTIME_ELAPSED_EXP_N(1,__VA_ARGS__)\n#define\tTIME_ELAPSED_MARKER(marker,...)\t\t\t\tTIME_ELAPSED_MARKER_N(1,marker,__VA_ARGS__)\n\n#define\tTIME_ELAPSED_HEADER\t\t\t\t\t\t\t\"ElapsedTime: \"\n#define\tTIME_ELAPSED_HEADER_WIDTH\t\t\t\t\t48\n\n\ntemplate <const int count, typename BlockBody>\ninline void time_elapsed_impl_core(BlockBody body, const std::string& header, std::ostream &o = std::cout)\n{\n\tusing namespace std;\n\tusing namespace std::chrono;\n\n\tauto t0 = high_resolution_clock::now();\n\n\tfor (int i = 0; i < count; i++)\n\t\tbody();\n\n\tauto t1 = high_resolution_clock::now();\n\n\n\t\/\/ Now, print out the elapsed time with its header\n\tauto prev_flags = o.flags();\n\tauto prev_precision = o.precision();\n\tauto prev_width = o.width();\n\n\to << left << setw(TIME_ELAPSED_HEADER_WIDTH) << (TIME_ELAPSED_HEADER + header);\n\to << \"cnt:\" << setw(8) << count;\n\to << setw(12) << right << fixed << setprecision(3)\n\t\t<< (float)duration_cast<microseconds>(t1 - t0).count()\/1000 << \" msec\" << endl;\n\n\to.width(prev_width);\n\to.precision(prev_precision);\n\to.flags(prev_flags);\n}\n\ntemplate <const int count, typename BlockBody>\ninline void time_elapsed_impl_noop(BlockBody body, std::ostream &o = std::cout)\n{\n\tfor (int i = 0; i < count; i++)\n\t\tbody();\n}\n\ntemplate <int count, typename BlockBody>\ninline void time_elapsed_impl1(BlockBody body, const char * const path, const int lno, std::ostream &o = std::cout)\n{\n\tstd::string basename{ path + std::string(path).find_last_of(\"\\\\\/\") + 1 };\n\ttime_elapsed_impl_core<count>(body, basename + \" at L.\" + std::to_string(lno), o);\n}\n\ntemplate <int count, typename BlockBody>\ninline void time_elapsed_impl2(BlockBody body, const char * const bodystr, std::ostream &o = std::cout)\n{\n\tstd::string heading{ std::string(bodystr).substr(0,TIME_ELAPSED_HEADER_WIDTH - sizeof(TIME_ELAPSED_HEADER) - 2)\t};\n\ttime_elapsed_impl_core<count>(body, heading, o);\n}\n\n#endif \/\/ !__TIME_ELAPSED_HPP__\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by Kevin on 22\/10\/2016.\n\/\/\n\n#include <stdexcept>\n#include \"Timer.h\"\n\nusing namespace std;\nusing namespace Gameboy::CPU;\nusing namespace Gameboy::Timer;\n\nTimer::Timer(IInterruptible &p_interruptible)\n    : interruptible (p_interruptible),\n      timerReg (),\n      divClock (),\n      timerClock ()\n{}\n\n\/\/ Cpu speed is 4,194,304 Hz\nconst uint16_t Timer::ticksForSpeed[4] = {\n        1024, \/\/ 4096 Hz\n          16, \/\/ 262144 Hz\n          64, \/\/ 65536 Hz\n         256  \/\/ 16384 Hz\n};\n\nuint8_t Timer::getTimerSpeed() {\n    return static_cast<uint8_t>(timerReg[OffTAC] & 0x03);\n}\n\nbool Timer::isTimerEnabled() {\n    return (timerReg[OffTAC] & (1 << 2)) != 0;\n}\n\nbool Timer::next(uint32_t ticks) {\n    \/\/ Handle Div Register\n    divClock += ticks;\n    if (divClock >= ticksForSpeed[3]) {\n        divClock = 0;\n        ++timerReg[OffDIV];\n    }\n\n    \/\/ Handle Timer Register\n    if (isTimerEnabled()) {\n        timerClock += ticks;\n        if (timerClock >= ticksForSpeed[getTimerSpeed()]) {\n            timerClock = 0;\n            if (++timerReg[OffTIMA] == 0) {\n                \/\/ overflow - Load Module Value\n                timerReg[OffTIMA] = timerReg[OffTMA];\n                \/\/ interrupt\n                interruptible.requestInterrupt(TimerIrq);\n            }\n        }\n    } \/*else {\n        timerClock = 0; \/\/ Not sure about this, but I don't think so\n    }*\/\n\n    return true;\n}\n\nuint8_t Timer::read(uint16_t address) const {\n    if (address >= DIV && address <= TAC) {\n        return timerReg[address - DIV];\n    }\n    throw runtime_error(\"Wrong read address for Timer: \" + to_string(address));\n}\n\nvoid Timer::write(uint16_t address, uint8_t datum) {\n    if (address >= DIV && address <= TAC) {\n        const RegisterOffset offset = static_cast<RegisterOffset>(address - DIV);\n        switch (offset) {\n            case OffDIV:\n                timerReg[offset] = 0;\n                \/\/ divClock = 0; \/\/ Not sure about this, but I don't think so\n                break;\n            case OffTIMA:\n            case OffTMA:\n                timerReg[offset] = datum;\n                break;\n            case OffTAC:\n                timerReg[offset] = datum; \/\/static_cast<uint8_t>(datum & 0x07);\n                if (datum > 7) {\n                    throw runtime_error (\"Writing value: \" + to_string(datum) + \" to Timer Control Register\");\n                }\n                break;\n        }\n    } else {\n        throw runtime_error(\"Wrong write address for Timer: \" + to_string(address));\n    }\n}\n<commit_msg>Fix current Timer bugs<commit_after>\/\/\n\/\/ Created by Kevin on 22\/10\/2016.\n\/\/\n\n#include <stdexcept>\n#include \"Timer.h\"\n\nusing namespace std;\nusing namespace Gameboy::CPU;\nusing namespace Gameboy::Timer;\n\nTimer::Timer(IInterruptible &p_interruptible)\n    : interruptible (p_interruptible),\n      timerReg (),\n      divClock (),\n      timerClock ()\n{}\n\n\/\/ Cpu speed is 4,194,304 Hz\nconst uint16_t Timer::ticksForSpeed[4] = {\n        1024, \/\/ 4096 Hz\n          16, \/\/ 262144 Hz\n          64, \/\/ 65536 Hz\n         256  \/\/ 16384 Hz\n};\n\nuint8_t Timer::getTimerSpeed() {\n    return static_cast<uint8_t>(timerReg[OffTAC] & 0x03);\n}\n\nbool Timer::isTimerEnabled() {\n    return (timerReg[OffTAC] & (1 << 2)) != 0;\n}\n\nbool Timer::next(uint32_t ticks) {\n    \/\/ Handle Div Register\n    divClock += ticks;\n    if (divClock >= ticksForSpeed[3]) {\n        divClock -= ticksForSpeed[3];\n        ++timerReg[OffDIV];\n    }\n\n    \/\/ Handle Timer Register\n    if (isTimerEnabled()) {\n        timerClock += ticks;\n        uint16_t ticksFS = ticksForSpeed[getTimerSpeed()];\n        if (timerClock >= ticksFS) {\n            timerClock -= ticksFS;\n            if (++timerReg[OffTIMA] == 0) {\n                \/\/ overflow - Load Module Value\n                timerReg[OffTIMA] = timerReg[OffTMA];\n                \/\/ interrupt\n                interruptible.requestInterrupt(TimerIrq);\n            }\n        }\n    } \/*else {\n        timerClock = 0; \/\/ Not sure about this, but I don't think so\n    }*\/\n\n    return true;\n}\n\nuint8_t Timer::read(uint16_t address) const {\n    if (address >= DIV && address <= TAC) {\n        return timerReg[address - DIV];\n    }\n    throw runtime_error(\"Wrong read address for Timer: \" + to_string(address));\n}\n\nvoid Timer::write(uint16_t address, uint8_t datum) {\n    if (address >= DIV && address <= TAC) {\n        const RegisterOffset offset = static_cast<RegisterOffset>(address - DIV);\n        switch (offset) {\n            case OffDIV:\n                timerReg[offset] = 0;\n                divClock = 0; \/\/ Not sure about this, but I don't think so\n                break;\n            case OffTIMA:\n            case OffTMA:\n                timerReg[offset] = datum;\n                break;\n            case OffTAC:\n                timerReg[offset] = datum; \/\/static_cast<uint8_t>(datum & 0x07);\n                timerClock = 0;\n                if (datum > 7) {\n                    throw runtime_error (\"Writing value: \" + to_string(datum) + \" to Timer Control Register\");\n                }\n                break;\n        }\n    } else {\n        throw runtime_error(\"Wrong write address for Timer: \" + to_string(address));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2004, 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\/\/\n\/\/\tLow-level file input and output for OpenEXR\n\/\/\tbased on C++ standard iostreams.\n\/\/\n\/\/-----------------------------------------------------------------------------\n\n#include <ImfStdIO.h>\n#include <Iex.h>\n#include <errno.h>\n\nusing namespace std;\n\nnamespace Imf {\nnamespace {\n\nvoid\nclearError ()\n{\n    errno = 0;\n}\n\n\nbool\ncheckError (istream &is)\n{\n    if (!is)\n    {\n\tif (errno)\n\t    Iex::throwErrnoExc();\n\n#ifdef BROKEN_ISTREAM_HACK\n\t\/\/ HACK - this is a workaround for a bug in Apple's\n\t\/\/ implementation of istream::read.  It's present as of\n\t\/\/ OS X 10.2.3 and the December 2002 developer's tools.\n\t\/\/\n\t\/\/ When OpenEXR reaches the end of the file, Apple's\n\t\/\/ istream implementation mistakenly sets the stream's\n\t\/\/ failbit.  This hack clears the bits, but note that it\n\t\/\/ may cause problems if there is a legitimate error\n\t\/\/ condition.\n\t\n\tis.clear (std::ios_base::goodbit);\n#endif\t\n\treturn false;\n    }\n\n    return true;\n}\n\n\nvoid\ncheckError (ostream &os)\n{\n    if (!os)\n    {\n\tif (errno)\n\t    Iex::throwErrnoExc();\n\n\tthrow Iex::ErrnoExc (\"File output failed.\");\n    }\n}\n\n} \/\/ namespace\n\n\nStdIFStream::StdIFStream (const char fileName[]):\n    IStream (fileName),\n#ifndef HAVE_IOS_BASE\n    _is (new ifstream (fileName, ios::binary|ios::in)),\n#else\n    _is (new ifstream (fileName, ios_base::binary)),\n#endif\n    _deleteStream (true)\n{\n    if (!*_is)\n    {\n\tdelete _is;\n\tIex::throwErrnoExc();\n    }\n}\n\n    \nStdIFStream::StdIFStream (ifstream &is, const char fileName[]):\n    IStream (fileName),\n    _is (&is),\n    _deleteStream (false)\n{\n    \/\/ empty\n}\n\n\nStdIFStream::~StdIFStream ()\n{\n    if (_deleteStream)\n\tdelete _is;\n}\n\n\nbool\nStdIFStream::read (char c[\/*n*\/], int n)\n{\n    if (!*_is)\n\tthrow Iex::InputExc (\"Unexpected end of file.\");\n\n    clearError();\n    _is->read (c, n);\n    return checkError (*_is);\n}\n\n\nInt64\nStdIFStream::tellg ()\n{\n    return _is->tellg();\n}\n\n\nvoid\nStdIFStream::seekg (Int64 pos)\n{\n    _is->seekg (pos);\n    checkError (*_is);\n}\n\n\nvoid\nStdIFStream::clear ()\n{\n    _is->clear();\n}\n\n\nStdOFStream::StdOFStream (const char fileName[]):\n    OStream (fileName),\n#ifndef HAVE_IOS_BASE\n    _os (new ofstream (fileName, ios::binary)),\n#else\n    _os (new ofstream (fileName, ios_base::binary)),\n#endif\n    _deleteStream (true)\n{\n    if (!*_os)\n    {\n\tdelete _os;\n\tIex::throwErrnoExc();\n    }\n}\n\n\nStdOFStream::StdOFStream (ofstream &os, const char fileName[]):\n    OStream (fileName),\n    _os (&os),\n    _deleteStream (false)\n{\n    \/\/ empty\n}\n\n\nStdOFStream::~StdOFStream ()\n{\n    if (_deleteStream)\n\tdelete _os;\n}\n\n\nvoid\nStdOFStream::write (const char c[\/*n*\/], int n)\n{\n    clearError();\n    _os->write (c, n);\n    checkError (*_os);\n}\n\n\nInt64\nStdOFStream::tellp ()\n{\n    return _os->tellp();\n}\n\n\nvoid\nStdOFStream::seekp (Int64 pos)\n{\n    _os->seekp (pos);\n    checkError (*_os);\n}\n\n\nStdOSStream::StdOSStream (): OStream (\"(string)\")\n{\n    \/\/ empty\n}\n\n\nvoid\nStdOSStream::write (const char c[\/*n*\/], int n)\n{\n    clearError();\n    _os.write (c, n);\n    checkError (_os);\n}\n\n\nInt64\nStdOSStream::tellp ()\n{\n    return _os.tellp();\n}\n\n\nvoid\nStdOSStream::seekp (Int64 pos)\n{\n    _os.seekp (pos);\n    checkError (_os);\n}\n\n\n} \/\/ namespace Imf\n<commit_msg><commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2004, 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\/\/\n\/\/\tLow-level file input and output for OpenEXR\n\/\/\tbased on C++ standard iostreams.\n\/\/\n\/\/-----------------------------------------------------------------------------\n\n#include <ImfStdIO.h>\n#include <Iex.h>\n#include <errno.h>\n\nusing namespace std;\n\nnamespace Imf {\nnamespace {\n\nvoid\nclearError ()\n{\n    errno = 0;\n}\n\n\nbool\ncheckError (istream &is)\n{\n    if (!is)\n    {\n\tif (errno)\n\t    Iex::throwErrnoExc();\n\n#ifdef BROKEN_ISTREAM_HACK\n\t\/\/ HACK - this is a workaround for a bug in Apple's\n\t\/\/ implementation of istream::read.  It's present as of\n\t\/\/ OS X 10.2.3 and the December 2002 developer's tools.\n\t\/\/\n\t\/\/ When OpenEXR reaches the end of the file, Apple's\n\t\/\/ istream implementation mistakenly sets the stream's\n\t\/\/ failbit.  This hack clears the bits, but note that it\n\t\/\/ may cause problems if there is a legitimate error\n\t\/\/ condition.\n\t\n\tis.clear (std::ios_base::goodbit);\n#endif\t\n\treturn false;\n    }\n\n    return true;\n}\n\n\nvoid\ncheckError (ostream &os)\n{\n    if (!os)\n    {\n\tif (errno)\n\t    Iex::throwErrnoExc();\n\n\tthrow Iex::ErrnoExc (\"File output failed.\");\n    }\n}\n\n} \/\/ namespace\n\n\nStdIFStream::StdIFStream (const char fileName[]):\n    IStream (fileName),\n#ifndef HAVE_IOS_BASE\n    _is (new ifstream (fileName, ios::binary|ios::in)),\n#else\n    _is (new ifstream (fileName, ios_base::binary)),\n#endif\n    _deleteStream (true)\n{\n    if (!*_is)\n    {\n\tdelete _is;\n\tIex::throwErrnoExc();\n    }\n}\n\n    \nStdIFStream::StdIFStream (ifstream &is, const char fileName[]):\n    IStream (fileName),\n    _is (&is),\n    _deleteStream (false)\n{\n    \/\/ empty\n}\n\n\nStdIFStream::~StdIFStream ()\n{\n    if (_deleteStream)\n\tdelete _is;\n}\n\n\nbool\nStdIFStream::read (char c[\/*n*\/], int n)\n{\n    if (!*_is)\n\tthrow Iex::InputExc (\"Unexpected end of file.\");\n\n    clearError();\n    _is->read (c, n);\n    return checkError (*_is);\n}\n\n\nInt64\nStdIFStream::tellg ()\n{\n    return std::streamoff (_is->tellg());\n}\n\n\nvoid\nStdIFStream::seekg (Int64 pos)\n{\n    _is->seekg (pos);\n    checkError (*_is);\n}\n\n\nvoid\nStdIFStream::clear ()\n{\n    _is->clear();\n}\n\n\nStdOFStream::StdOFStream (const char fileName[]):\n    OStream (fileName),\n#ifndef HAVE_IOS_BASE\n    _os (new ofstream (fileName, ios::binary)),\n#else\n    _os (new ofstream (fileName, ios_base::binary)),\n#endif\n    _deleteStream (true)\n{\n    if (!*_os)\n    {\n\tdelete _os;\n\tIex::throwErrnoExc();\n    }\n}\n\n\nStdOFStream::StdOFStream (ofstream &os, const char fileName[]):\n    OStream (fileName),\n    _os (&os),\n    _deleteStream (false)\n{\n    \/\/ empty\n}\n\n\nStdOFStream::~StdOFStream ()\n{\n    if (_deleteStream)\n\tdelete _os;\n}\n\n\nvoid\nStdOFStream::write (const char c[\/*n*\/], int n)\n{\n    clearError();\n    _os->write (c, n);\n    checkError (*_os);\n}\n\n\nInt64\nStdOFStream::tellp ()\n{\n    return std::streamoff (_os->tellp());\n}\n\n\nvoid\nStdOFStream::seekp (Int64 pos)\n{\n    _os->seekp (pos);\n    checkError (*_os);\n}\n\n\nStdOSStream::StdOSStream (): OStream (\"(string)\")\n{\n    \/\/ empty\n}\n\n\nvoid\nStdOSStream::write (const char c[\/*n*\/], int n)\n{\n    clearError();\n    _os.write (c, n);\n    checkError (_os);\n}\n\n\nInt64\nStdOSStream::tellp ()\n{\n    return std::streamoff (_os.tellp());\n}\n\n\nvoid\nStdOSStream::seekp (Int64 pos)\n{\n    _os.seekp (pos);\n    checkError (_os);\n}\n\n\n} \/\/ namespace Imf\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of Magnum.\n\n    Copyright © 2010, 2011, 2012, 2013 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 <Utility\/Arguments.h>\n#include <Utility\/Debug.h>\n#include <corradeCompatibility.h>\n#ifdef CORRADE_TARGET_NACL\n#include <Utility\/NaClStreamBuffer.h>\n#endif\n\n#include \"AbstractShaderProgram.h\"\n#include \"Buffer.h\"\n#include \"BufferTexture.h\"\n#include \"Context.h\"\n#include \"DebugMessage.h\"\n#include \"Extensions.h\"\n#include \"Framebuffer.h\"\n#include \"Mesh.h\"\n#include \"Renderbuffer.h\"\n#include \"Shader.h\"\n#ifndef CORRADE_TARGET_NACL\n#include \"Platform\/WindowlessGlxApplication.h\"\n#else\n#include \"Platform\/WindowlessNaClApplication.h\"\n#endif\n\nnamespace Magnum {\n\nclass MagnumInfo: public Platform::WindowlessApplication {\n    public:\n        explicit MagnumInfo(const Arguments& arguments);\n\n        int exec() override { return 0; }\n};\n\nMagnumInfo::MagnumInfo(const Arguments& arguments): Platform::WindowlessApplication(arguments, nullptr) {\n    Utility::Arguments args;\n    args.addBooleanOption(\"all-extensions\")\n        .setHelp(\"all-extensions\", \"show extensions also for fully supported versions\")\n        .addBooleanOption(\"no-limits\")\n        .setHelp(\"no-limits\", \"don't display limits and implementation-defined values\")\n        .setHelp(\"Displays information about Magnum engine and OpenGL capabilities.\");\n\n    \/**\n     * @todo Make this work in NaCl, somehow the arguments aren't passed to\n     *      constructor but to Init() or whatnot\n     *\/\n    #ifndef CORRADE_TARGET_NACL\n    args.parse(arguments.argc, arguments.argv);\n    #endif\n\n    \/* Create context after parsing arguments, so the help can be displayed\n       without creating context *\/\n    createContext();\n    Context* c = Context::current();\n\n    \/* Pass debug output as messages to JavaScript *\/\n    #ifdef CORRADE_TARGET_NACL\n    Utility::NaClMessageStreamBuffer buffer(this);\n    std::ostream out(&buffer);\n    Debug::setOutput(&out);\n    #endif\n\n    Debug() << \"\";\n    Debug() << \"  +---------------------------------------------------------+\";\n    Debug() << \"  | Information about Magnum engine and OpenGL capabilities |\";\n    Debug() << \"  +---------------------------------------------------------+\";\n    Debug() << \"\";\n\n    Debug() << \"Used application: Platform::WindowlessGlxApplication\";\n    Debug() << \"Compilation flags:\";\n    #ifdef CORRADE_GCC46_COMPATIBILITY\n    Debug() << \"    CORRADE_GCC46_COMPATIBILITY\";\n    #endif\n    #ifdef CORRADE_GCC47_COMPATIBILITY\n    Debug() << \"    CORRADE_GCC47_COMPATIBILITY\";\n    #endif\n    #ifdef CORRADE_BUILD_DEPRECATED\n    Debug() << \"    CORRADE_BUILD_DEPRECATED\";\n    #endif\n    #ifdef CORRADE_BUILD_STATIC\n    Debug() << \"    CORRADE_BUILD_STATIC\";\n    #endif\n    #ifdef CORRADE_TARGET_NACL\n    Debug() << \"    CORRADE_TARGET_NACL\";\n    #endif\n    #ifdef CORRADE_TARGET_NACL_NEWLIB\n    Debug() << \"    CORRADE_TARGET_NACL_NEWLIB\";\n    #endif\n    #ifdef CORRADE_TARGET_NACL_GLIBC\n    Debug() << \"    CORRADE_TARGET_NACL_GLIBC\";\n    #endif\n    #ifdef CORRADE_TARGET_EMSCRIPTEN\n    Debug() << \"    CORRADE_TARGET_EMSCRIPTEN\";\n    #endif\n    #ifdef MAGNUM_BUILD_DEPRECATED\n    Debug() << \"    MAGNUM_BUILD_DEPRECATED\";\n    #endif\n    #ifdef MAGNUM_BUILD_STATIC\n    Debug() << \"    MAGNUM_BUILD_STATIC\";\n    #endif\n    #ifdef MAGNUM_TARGET_GLES\n    Debug() << \"    MAGNUM_TARGET_GLES\";\n    #endif\n    #ifdef MAGNUM_TARGET_GLES2\n    Debug() << \"    MAGNUM_TARGET_GLES2\";\n    #endif\n    #ifdef MAGNUM_TARGET_DESKTOP_GLES\n    Debug() << \"    MAGNUM_TARGET_DESKTOP_GLES\";\n    #endif\n    Debug() << \"\";\n\n    Debug() << \"Vendor:\" << c->vendorString();\n    Debug() << \"Renderer:\" << c->rendererString();\n    Debug() << \"OpenGL version:\" << c->version() << '(' + c->versionString() + ')';\n\n    Debug() << \"Supported GLSL versions:\";\n    const std::vector<std::string> shadingLanguageVersions = c->shadingLanguageVersionStrings();\n    for(const auto& version: shadingLanguageVersions)\n        Debug() << \"   \" << version;\n\n    Debug() << \"\";\n\n    \/* Get first future (not supported) version *\/\n    std::vector<Version> versions{\n        #ifndef MAGNUM_TARGET_GLES\n        Version::GL300,\n        Version::GL310,\n        Version::GL320,\n        Version::GL330,\n        Version::GL400,\n        Version::GL410,\n        Version::GL420,\n        Version::GL430,\n        Version::GL440,\n        #else\n        Version::GLES200,\n        Version::GLES300,\n        #endif\n        Version::None\n    };\n    std::size_t future = 0;\n\n    if(!args.isSet(\"all-extensions\"))\n        while(versions[future] != Version::None && c->isVersionSupported(versions[future]))\n            ++future;\n\n    \/* Display supported OpenGL extensions from unsupported versions *\/\n    for(std::size_t i = future; i != versions.size(); ++i) {\n        if(versions[i] != Version::None)\n            Debug() << versions[i] << \"extension support:\";\n        else Debug() << \"Vendor extension support:\";\n\n        for(const auto& extension: Extension::extensions(versions[i])) {\n            std::string extensionName = extension.string();\n            Debug d;\n            d << \"   \" << extensionName << std::string(60-extensionName.size(), ' ');\n            if(c->isExtensionSupported(extension))\n                d << \"SUPPORTED\";\n            else if(c->isVersionSupported(extension.requiredVersion()))\n                d << \"    -\";\n            else\n                d << \"   ---\";\n        }\n\n        Debug() << \"\";\n    }\n\n    if(args.isSet(\"no-limits\")) return;\n\n    \/* Limits and implementation-defined values *\/\n    #define _h(val) Debug() << \"\\n \" << Extensions::GL::val::string() + std::string(\":\");\n    #define _l(val) Debug() << \"   \" << #val << (sizeof(#val) > 64 ? \"\\n\" + std::string(68, ' ') : std::string(64 - sizeof(#val), ' ')) << val;\n\n    Debug() << \"Limits and implementation-defined values:\";\n    _l(AbstractFramebuffer::maxViewportSize())\n    _l(AbstractFramebuffer::maxDrawBuffers())\n    _l(Framebuffer::maxColorAttachments())\n    #ifndef MAGNUM_TARGET_GLES2\n    _l(Mesh::maxElementsIndices())\n    _l(Mesh::maxElementsVertices())\n    #endif\n    _l(Renderbuffer::maxSize())\n    _l(Renderbuffer::maxSamples())\n    _l(Shader::maxVertexOutputComponents())\n    _l(Shader::maxFragmentInputComponents())\n    _l(Shader::maxTextureImageUnits(Shader::Type::Vertex))\n    #ifndef MAGNUM_TARGET_GLES\n    _l(Shader::maxTextureImageUnits(Shader::Type::TessellationControl))\n    _l(Shader::maxTextureImageUnits(Shader::Type::TessellationEvaluation))\n    _l(Shader::maxTextureImageUnits(Shader::Type::Geometry))\n    _l(Shader::maxTextureImageUnits(Shader::Type::Compute))\n    #endif\n    _l(Shader::maxTextureImageUnits(Shader::Type::Fragment))\n    _l(Shader::maxCombinedTextureImageUnits())\n    _l(Shader::maxUniformComponents(Shader::Type::Vertex))\n    #ifndef MAGNUM_TARGET_GLES\n    _l(Shader::maxUniformComponents(Shader::Type::TessellationControl))\n    _l(Shader::maxUniformComponents(Shader::Type::TessellationEvaluation))\n    _l(Shader::maxUniformComponents(Shader::Type::Geometry))\n    _l(Shader::maxUniformComponents(Shader::Type::Compute))\n    #endif\n    _l(Shader::maxUniformComponents(Shader::Type::Fragment))\n    #ifndef MAGNUM_TARGET_GLES\n    _l(AbstractShaderProgram::maxUniformLocations())\n    #endif\n    _l(AbstractShaderProgram::maxVertexAttributes())\n    #ifndef MAGNUM_TARGET_GLES\n    _l(AbstractTexture::maxColorSamples())\n    _l(AbstractTexture::maxDepthSamples())\n    _l(AbstractTexture::maxIntegerSamples())\n    #endif\n\n    #ifndef MAGNUM_TARGET_GLES\n    if(c->isExtensionSupported<Extensions::GL::ARB::blend_func_extended>()) {\n        _h(ARB::blend_func_extended)\n\n        _l(AbstractFramebuffer::maxDualSourceDrawBuffers())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::compute_shader>()) {\n        _h(ARB::compute_shader)\n\n        _l(AbstractShaderProgram::maxComputeSharedMemorySize())\n        _l(AbstractShaderProgram::maxComputeWorkGroupInvocations())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::geometry_shader4>()) {\n        _h(ARB::geometry_shader4)\n\n        _l(Shader::maxGeometryInputComponents())\n        _l(Shader::maxGeometryOutputComponents())\n        _l(Shader::maxGeometryTotalOutputComponents())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::shader_atomic_counters>()) {\n        _h(ARB::shader_atomic_counters)\n\n        _l(Buffer::maxAtomicCounterBindings())\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::Vertex))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::TessellationControl))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::Geometry))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::Compute))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::Fragment))\n        _l(Shader::maxCombinedAtomicCounterBuffers())\n        _l(Shader::maxAtomicCounters(Shader::Type::Vertex))\n        _l(Shader::maxAtomicCounters(Shader::Type::TessellationControl))\n        _l(Shader::maxAtomicCounters(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxAtomicCounters(Shader::Type::Geometry))\n        _l(Shader::maxAtomicCounters(Shader::Type::Compute))\n        _l(Shader::maxAtomicCounters(Shader::Type::Fragment))\n        _l(Shader::maxCombinedAtomicCounters())\n        _l(AbstractShaderProgram::maxAtomicCounterBufferSize())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::shader_image_load_store>()) {\n        _h(ARB::shader_image_load_store)\n\n        _l(Shader::maxImageUniforms(Shader::Type::Vertex))\n        _l(Shader::maxImageUniforms(Shader::Type::TessellationControl))\n        _l(Shader::maxImageUniforms(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxImageUniforms(Shader::Type::Geometry))\n        _l(Shader::maxImageUniforms(Shader::Type::Compute))\n        _l(Shader::maxImageUniforms(Shader::Type::Fragment))\n        _l(Shader::maxCombinedImageUniforms())\n        _l(AbstractShaderProgram::maxCombinedShaderOutputResources())\n        _l(AbstractShaderProgram::maxImageUnits())\n        _l(AbstractShaderProgram::maxImageSamples())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::shader_storage_buffer_object>()) {\n        _h(ARB::shader_storage_buffer_object)\n\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::Vertex))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::TessellationControl))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::Geometry))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::Compute))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::Fragment))\n        _l(Shader::maxCombinedShaderStorageBlocks())\n        \/* AbstractShaderProgram::maxCombinedShaderOutputResources() already in shader_image_load_store *\/\n        _l(AbstractShaderProgram::maxShaderStorageBlockSize())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::tessellation_shader>()) {\n        _h(ARB::tessellation_shader)\n\n        _l(Buffer::shaderStorageOffsetAlignment())\n        _l(Buffer::maxShaderStorageBindings())\n        _l(Shader::maxTessellationControlInputComponents())\n        _l(Shader::maxTessellationControlOutputComponents())\n        _l(Shader::maxTessellationControlTotalOutputComponents())\n        _l(Shader::maxTessellationEvaluationInputComponents())\n        _l(Shader::maxTessellationEvaluationOutputComponents())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::texture_buffer_range>()) {\n        _h(ARB::texture_buffer_range)\n\n        _l(BufferTexture::offsetAlignment())\n    }\n    #endif\n\n    #ifndef MAGNUM_TARGET_GLES2\n    if(c->isExtensionSupported<Extensions::GL::ARB::uniform_buffer_object>()) {\n        _h(ARB::uniform_buffer_object)\n\n        _l(Shader::maxUniformBlocks(Shader::Type::Vertex))\n        _l(Shader::maxUniformBlocks(Shader::Type::TessellationControl))\n        _l(Shader::maxUniformBlocks(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxUniformBlocks(Shader::Type::Geometry))\n        _l(Shader::maxUniformBlocks(Shader::Type::Compute))\n        _l(Shader::maxUniformBlocks(Shader::Type::Fragment))\n        _l(Shader::maxCombinedUniformBlocks())\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::Vertex))\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::TessellationControl))\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::Geometry))\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::Compute))\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::Fragment))\n        _l(AbstractShaderProgram::maxUniformBlockSize())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::EXT::gpu_shader4>()) {\n        _h(EXT::gpu_shader4)\n\n        _l(Buffer::maxUniformBindings())\n        _l(AbstractShaderProgram::minTexelOffset())\n        _l(AbstractShaderProgram::maxTexelOffset())\n    }\n    #endif\n\n    if(c->isExtensionSupported<Extensions::GL::EXT::texture_filter_anisotropic>()) {\n        _h(EXT::texture_filter_anisotropic)\n\n        _l(Sampler::maxMaxAnisotropy())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::KHR::debug>()) {\n        _h(KHR::debug)\n\n        _l(AbstractObject::maxLabelLength())\n        _l(DebugMessage::maxLoggedMessages())\n        _l(DebugMessage::maxMessageLength())\n    }\n\n    #undef _l\n    #undef _h\n}\n\n}\n\nMAGNUM_WINDOWLESSAPPLICATION_MAIN(Magnum::MagnumInfo)\n<commit_msg>Platform: fixed compilation of magnum-info on ES3.<commit_after>\/*\n    This file is part of Magnum.\n\n    Copyright © 2010, 2011, 2012, 2013 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 <Utility\/Arguments.h>\n#include <Utility\/Debug.h>\n#include <corradeCompatibility.h>\n#ifdef CORRADE_TARGET_NACL\n#include <Utility\/NaClStreamBuffer.h>\n#endif\n\n#include \"AbstractShaderProgram.h\"\n#include \"Buffer.h\"\n#include \"BufferTexture.h\"\n#include \"Context.h\"\n#include \"DebugMessage.h\"\n#include \"Extensions.h\"\n#include \"Framebuffer.h\"\n#include \"Mesh.h\"\n#include \"Renderbuffer.h\"\n#include \"Shader.h\"\n#ifndef CORRADE_TARGET_NACL\n#include \"Platform\/WindowlessGlxApplication.h\"\n#else\n#include \"Platform\/WindowlessNaClApplication.h\"\n#endif\n\nnamespace Magnum {\n\nclass MagnumInfo: public Platform::WindowlessApplication {\n    public:\n        explicit MagnumInfo(const Arguments& arguments);\n\n        int exec() override { return 0; }\n};\n\nMagnumInfo::MagnumInfo(const Arguments& arguments): Platform::WindowlessApplication(arguments, nullptr) {\n    Utility::Arguments args;\n    args.addBooleanOption(\"all-extensions\")\n        .setHelp(\"all-extensions\", \"show extensions also for fully supported versions\")\n        .addBooleanOption(\"no-limits\")\n        .setHelp(\"no-limits\", \"don't display limits and implementation-defined values\")\n        .setHelp(\"Displays information about Magnum engine and OpenGL capabilities.\");\n\n    \/**\n     * @todo Make this work in NaCl, somehow the arguments aren't passed to\n     *      constructor but to Init() or whatnot\n     *\/\n    #ifndef CORRADE_TARGET_NACL\n    args.parse(arguments.argc, arguments.argv);\n    #endif\n\n    \/* Create context after parsing arguments, so the help can be displayed\n       without creating context *\/\n    createContext();\n    Context* c = Context::current();\n\n    \/* Pass debug output as messages to JavaScript *\/\n    #ifdef CORRADE_TARGET_NACL\n    Utility::NaClMessageStreamBuffer buffer(this);\n    std::ostream out(&buffer);\n    Debug::setOutput(&out);\n    #endif\n\n    Debug() << \"\";\n    Debug() << \"  +---------------------------------------------------------+\";\n    Debug() << \"  | Information about Magnum engine and OpenGL capabilities |\";\n    Debug() << \"  +---------------------------------------------------------+\";\n    Debug() << \"\";\n\n    Debug() << \"Used application: Platform::WindowlessGlxApplication\";\n    Debug() << \"Compilation flags:\";\n    #ifdef CORRADE_GCC46_COMPATIBILITY\n    Debug() << \"    CORRADE_GCC46_COMPATIBILITY\";\n    #endif\n    #ifdef CORRADE_GCC47_COMPATIBILITY\n    Debug() << \"    CORRADE_GCC47_COMPATIBILITY\";\n    #endif\n    #ifdef CORRADE_BUILD_DEPRECATED\n    Debug() << \"    CORRADE_BUILD_DEPRECATED\";\n    #endif\n    #ifdef CORRADE_BUILD_STATIC\n    Debug() << \"    CORRADE_BUILD_STATIC\";\n    #endif\n    #ifdef CORRADE_TARGET_NACL\n    Debug() << \"    CORRADE_TARGET_NACL\";\n    #endif\n    #ifdef CORRADE_TARGET_NACL_NEWLIB\n    Debug() << \"    CORRADE_TARGET_NACL_NEWLIB\";\n    #endif\n    #ifdef CORRADE_TARGET_NACL_GLIBC\n    Debug() << \"    CORRADE_TARGET_NACL_GLIBC\";\n    #endif\n    #ifdef CORRADE_TARGET_EMSCRIPTEN\n    Debug() << \"    CORRADE_TARGET_EMSCRIPTEN\";\n    #endif\n    #ifdef MAGNUM_BUILD_DEPRECATED\n    Debug() << \"    MAGNUM_BUILD_DEPRECATED\";\n    #endif\n    #ifdef MAGNUM_BUILD_STATIC\n    Debug() << \"    MAGNUM_BUILD_STATIC\";\n    #endif\n    #ifdef MAGNUM_TARGET_GLES\n    Debug() << \"    MAGNUM_TARGET_GLES\";\n    #endif\n    #ifdef MAGNUM_TARGET_GLES2\n    Debug() << \"    MAGNUM_TARGET_GLES2\";\n    #endif\n    #ifdef MAGNUM_TARGET_DESKTOP_GLES\n    Debug() << \"    MAGNUM_TARGET_DESKTOP_GLES\";\n    #endif\n    Debug() << \"\";\n\n    Debug() << \"Vendor:\" << c->vendorString();\n    Debug() << \"Renderer:\" << c->rendererString();\n    Debug() << \"OpenGL version:\" << c->version() << '(' + c->versionString() + ')';\n\n    Debug() << \"Supported GLSL versions:\";\n    const std::vector<std::string> shadingLanguageVersions = c->shadingLanguageVersionStrings();\n    for(const auto& version: shadingLanguageVersions)\n        Debug() << \"   \" << version;\n\n    Debug() << \"\";\n\n    \/* Get first future (not supported) version *\/\n    std::vector<Version> versions{\n        #ifndef MAGNUM_TARGET_GLES\n        Version::GL300,\n        Version::GL310,\n        Version::GL320,\n        Version::GL330,\n        Version::GL400,\n        Version::GL410,\n        Version::GL420,\n        Version::GL430,\n        Version::GL440,\n        #else\n        Version::GLES200,\n        Version::GLES300,\n        #endif\n        Version::None\n    };\n    std::size_t future = 0;\n\n    if(!args.isSet(\"all-extensions\"))\n        while(versions[future] != Version::None && c->isVersionSupported(versions[future]))\n            ++future;\n\n    \/* Display supported OpenGL extensions from unsupported versions *\/\n    for(std::size_t i = future; i != versions.size(); ++i) {\n        if(versions[i] != Version::None)\n            Debug() << versions[i] << \"extension support:\";\n        else Debug() << \"Vendor extension support:\";\n\n        for(const auto& extension: Extension::extensions(versions[i])) {\n            std::string extensionName = extension.string();\n            Debug d;\n            d << \"   \" << extensionName << std::string(60-extensionName.size(), ' ');\n            if(c->isExtensionSupported(extension))\n                d << \"SUPPORTED\";\n            else if(c->isVersionSupported(extension.requiredVersion()))\n                d << \"    -\";\n            else\n                d << \"   ---\";\n        }\n\n        Debug() << \"\";\n    }\n\n    if(args.isSet(\"no-limits\")) return;\n\n    \/* Limits and implementation-defined values *\/\n    #define _h(val) Debug() << \"\\n \" << Extensions::GL::val::string() + std::string(\":\");\n    #define _l(val) Debug() << \"   \" << #val << (sizeof(#val) > 64 ? \"\\n\" + std::string(68, ' ') : std::string(64 - sizeof(#val), ' ')) << val;\n\n    Debug() << \"Limits and implementation-defined values:\";\n    _l(AbstractFramebuffer::maxViewportSize())\n    _l(AbstractFramebuffer::maxDrawBuffers())\n    _l(Framebuffer::maxColorAttachments())\n    #ifndef MAGNUM_TARGET_GLES2\n    _l(Mesh::maxElementsIndices())\n    _l(Mesh::maxElementsVertices())\n    #endif\n    _l(Renderbuffer::maxSize())\n    _l(Renderbuffer::maxSamples())\n    _l(Shader::maxVertexOutputComponents())\n    _l(Shader::maxFragmentInputComponents())\n    _l(Shader::maxTextureImageUnits(Shader::Type::Vertex))\n    #ifndef MAGNUM_TARGET_GLES\n    _l(Shader::maxTextureImageUnits(Shader::Type::TessellationControl))\n    _l(Shader::maxTextureImageUnits(Shader::Type::TessellationEvaluation))\n    _l(Shader::maxTextureImageUnits(Shader::Type::Geometry))\n    _l(Shader::maxTextureImageUnits(Shader::Type::Compute))\n    #endif\n    _l(Shader::maxTextureImageUnits(Shader::Type::Fragment))\n    _l(Shader::maxCombinedTextureImageUnits())\n    _l(Shader::maxUniformComponents(Shader::Type::Vertex))\n    #ifndef MAGNUM_TARGET_GLES\n    _l(Shader::maxUniformComponents(Shader::Type::TessellationControl))\n    _l(Shader::maxUniformComponents(Shader::Type::TessellationEvaluation))\n    _l(Shader::maxUniformComponents(Shader::Type::Geometry))\n    _l(Shader::maxUniformComponents(Shader::Type::Compute))\n    #endif\n    _l(Shader::maxUniformComponents(Shader::Type::Fragment))\n    #ifndef MAGNUM_TARGET_GLES\n    _l(AbstractShaderProgram::maxUniformLocations())\n    #endif\n    _l(AbstractShaderProgram::maxVertexAttributes())\n    #ifndef MAGNUM_TARGET_GLES\n    _l(AbstractTexture::maxColorSamples())\n    _l(AbstractTexture::maxDepthSamples())\n    _l(AbstractTexture::maxIntegerSamples())\n    #endif\n\n    #ifndef MAGNUM_TARGET_GLES\n    if(c->isExtensionSupported<Extensions::GL::ARB::blend_func_extended>()) {\n        _h(ARB::blend_func_extended)\n\n        _l(AbstractFramebuffer::maxDualSourceDrawBuffers())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::compute_shader>()) {\n        _h(ARB::compute_shader)\n\n        _l(AbstractShaderProgram::maxComputeSharedMemorySize())\n        _l(AbstractShaderProgram::maxComputeWorkGroupInvocations())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::geometry_shader4>()) {\n        _h(ARB::geometry_shader4)\n\n        _l(Shader::maxGeometryInputComponents())\n        _l(Shader::maxGeometryOutputComponents())\n        _l(Shader::maxGeometryTotalOutputComponents())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::shader_atomic_counters>()) {\n        _h(ARB::shader_atomic_counters)\n\n        _l(Buffer::maxAtomicCounterBindings())\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::Vertex))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::TessellationControl))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::Geometry))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::Compute))\n        _l(Shader::maxAtomicCounterBuffers(Shader::Type::Fragment))\n        _l(Shader::maxCombinedAtomicCounterBuffers())\n        _l(Shader::maxAtomicCounters(Shader::Type::Vertex))\n        _l(Shader::maxAtomicCounters(Shader::Type::TessellationControl))\n        _l(Shader::maxAtomicCounters(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxAtomicCounters(Shader::Type::Geometry))\n        _l(Shader::maxAtomicCounters(Shader::Type::Compute))\n        _l(Shader::maxAtomicCounters(Shader::Type::Fragment))\n        _l(Shader::maxCombinedAtomicCounters())\n        _l(AbstractShaderProgram::maxAtomicCounterBufferSize())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::shader_image_load_store>()) {\n        _h(ARB::shader_image_load_store)\n\n        _l(Shader::maxImageUniforms(Shader::Type::Vertex))\n        _l(Shader::maxImageUniforms(Shader::Type::TessellationControl))\n        _l(Shader::maxImageUniforms(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxImageUniforms(Shader::Type::Geometry))\n        _l(Shader::maxImageUniforms(Shader::Type::Compute))\n        _l(Shader::maxImageUniforms(Shader::Type::Fragment))\n        _l(Shader::maxCombinedImageUniforms())\n        _l(AbstractShaderProgram::maxCombinedShaderOutputResources())\n        _l(AbstractShaderProgram::maxImageUnits())\n        _l(AbstractShaderProgram::maxImageSamples())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::shader_storage_buffer_object>()) {\n        _h(ARB::shader_storage_buffer_object)\n\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::Vertex))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::TessellationControl))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::Geometry))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::Compute))\n        _l(Shader::maxShaderStorageBlocks(Shader::Type::Fragment))\n        _l(Shader::maxCombinedShaderStorageBlocks())\n        \/* AbstractShaderProgram::maxCombinedShaderOutputResources() already in shader_image_load_store *\/\n        _l(AbstractShaderProgram::maxShaderStorageBlockSize())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::tessellation_shader>()) {\n        _h(ARB::tessellation_shader)\n\n        _l(Buffer::shaderStorageOffsetAlignment())\n        _l(Buffer::maxShaderStorageBindings())\n        _l(Shader::maxTessellationControlInputComponents())\n        _l(Shader::maxTessellationControlOutputComponents())\n        _l(Shader::maxTessellationControlTotalOutputComponents())\n        _l(Shader::maxTessellationEvaluationInputComponents())\n        _l(Shader::maxTessellationEvaluationOutputComponents())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::ARB::texture_buffer_range>()) {\n        _h(ARB::texture_buffer_range)\n\n        _l(BufferTexture::offsetAlignment())\n    }\n    #endif\n\n    \/** @todo Somehow sort the following into previous list for ES3 *\/\n\n    #ifndef MAGNUM_TARGET_GLES2\n    #ifndef MAGNUM_TARGET_GLES\n    if(c->isExtensionSupported<Extensions::GL::ARB::uniform_buffer_object>())\n    #endif\n    {\n        #ifndef MAGNUM_TARGET_GLES\n        _h(ARB::uniform_buffer_object)\n        #endif\n\n        _l(Shader::maxUniformBlocks(Shader::Type::Vertex))\n        #ifndef MAGNUM_TARGET_GLES\n        _l(Shader::maxUniformBlocks(Shader::Type::TessellationControl))\n        _l(Shader::maxUniformBlocks(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxUniformBlocks(Shader::Type::Geometry))\n        _l(Shader::maxUniformBlocks(Shader::Type::Compute))\n        #endif\n        _l(Shader::maxUniformBlocks(Shader::Type::Fragment))\n        _l(Shader::maxCombinedUniformBlocks())\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::Vertex))\n        #ifndef MAGNUM_TARGET_GLES\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::TessellationControl))\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::TessellationEvaluation))\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::Geometry))\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::Compute))\n        #endif\n        _l(Shader::maxCombinedUniformComponents(Shader::Type::Fragment))\n        _l(AbstractShaderProgram::maxUniformBlockSize())\n    }\n\n    #ifndef MAGNUM_TARGET_GLES\n    if(c->isExtensionSupported<Extensions::GL::EXT::gpu_shader4>())\n    #endif\n    {\n        #ifndef MAGNUM_TARGET_GLES\n        _h(EXT::gpu_shader4)\n        #endif\n\n        _l(Buffer::maxUniformBindings())\n        _l(AbstractShaderProgram::minTexelOffset())\n        _l(AbstractShaderProgram::maxTexelOffset())\n    }\n    #endif\n\n    if(c->isExtensionSupported<Extensions::GL::EXT::texture_filter_anisotropic>()) {\n        _h(EXT::texture_filter_anisotropic)\n\n        _l(Sampler::maxMaxAnisotropy())\n    }\n\n    if(c->isExtensionSupported<Extensions::GL::KHR::debug>()) {\n        _h(KHR::debug)\n\n        _l(AbstractObject::maxLabelLength())\n        _l(DebugMessage::maxLoggedMessages())\n        _l(DebugMessage::maxMessageLength())\n    }\n\n    #undef _l\n    #undef _h\n}\n\n}\n\nMAGNUM_WINDOWLESSAPPLICATION_MAIN(Magnum::MagnumInfo)\n<|endoftext|>"}
{"text":"<commit_before>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n#include \"UiDefines.h\"\n\n#include \"InworldSceneController.h\"\n#include \"ControlPanelManager.h\"\n\n#include \"Common\/AnchorLayoutManager.h\"\n\n#include \"Menus\/MenuManager.h\"\n\n#include \"View\/UiProxyWidget.h\"\n#include \"View\/UiWidgetProperties.h\"\n#include \"View\/CommunicationWidget.h\"\n\n#include \"Inworld\/ControlPanel\/SettingsWidget.h\"\n#include \"Inworld\/ControlPanel\/PersonalWidget.h\"\n\n#include <QRectF>\n#include <QGraphicsItem>\n#include <QGraphicsLinearLayout>\n#include <QGraphicsWidget>\n#include <QGraphicsView>\n#include <QGraphicsScene>\n\n#include \"MemoryLeakCheck.h\"\n\n#include <QDebug>\n\nnamespace UiServices\n{\n    InworldSceneController::InworldSceneController(Foundation::Framework *framework, QGraphicsView *ui_view) \n        : QObject(),\n          framework_(framework),\n          ui_view_(ui_view),\n          communication_widget_(0)\n    {\n        if (!ui_view_)\n            return;\n\n        \/\/ Store scene pointer\n        inworld_scene_ = ui_view_->scene();\n\n        \/\/ Init layout manager with scene\n        layout_manager_ = new CoreUi::AnchorLayoutManager(this, inworld_scene_);\n\n        \/\/ Init UI managers with layout manager\n        control_panel_manager_ = new CoreUi::ControlPanelManager(this, layout_manager_);\n        menu_manager_ = new CoreUi::MenuManager(this, layout_manager_);\n        \n        \/\/ Communication core UI\n        communication_widget_ = new CoreUi::CommunicationWidget();\n        layout_manager_->AddCornerAnchor(communication_widget_, Qt::BottomLeftCorner, Qt::BottomLeftCorner);\n\n        \/\/ Connect settings widget\n        connect(control_panel_manager_->GetSettingsWidget(), SIGNAL(NewUserInterfaceSettingsApplied(int, int)), SLOT(ApplyNewProxySettings(int, int)));\n\t\t\n\t\/\/apply new positions to active widgets when the inworld_scene_ is resized\n\tconnect(inworld_scene_, SIGNAL(sceneRectChanged(const QRectF)), this, SLOT(ApplyNewProxyPosition(const QRectF)));\n    }\n\n    InworldSceneController::~InworldSceneController()\n    {\n        SAFE_DELETE(communication_widget_);\n    }\n\n    \/*************** UI Scene Manager Public Services ***************\/\n\n    bool InworldSceneController::AddSettingsWidget(QWidget *settings_widget, const QString &tab_name) const\n    {\n        control_panel_manager_->GetSettingsWidget()->AddWidget(settings_widget, tab_name);\n        return true;\n    }\n\n    UiProxyWidget* InworldSceneController::AddWidgetToScene(QWidget *widget)\n    {\n        return AddWidgetToScene(widget, UiWidgetProperties(\"Unnamed Widget\", ModuleWidget));\n    }\n\n    UiProxyWidget* InworldSceneController::AddWidgetToScene(QWidget *widget, const UiServices::UiWidgetProperties &widget_properties)\n    {\n        UiProxyWidget *proxy_widget = new UiProxyWidget(widget, widget_properties);\n        if (AddProxyWidget(proxy_widget))\n            return proxy_widget;\n        else\n            return 0;\n    }\n\n    bool InworldSceneController::AddProxyWidget(UiServices::UiProxyWidget *proxy_widget)\n    {\n        if (!inworld_scene_)\n        {\n            SAFE_DELETE(proxy_widget);\n            return false;\n        }\n\n        \/\/ Add to scene\n        if (proxy_widget->isVisible())\n            proxy_widget->hide();\n        inworld_scene_->addItem(proxy_widget);\n\n        \/\/ Add to internal control list\n        if (!all_proxy_widgets_in_scene_.contains(proxy_widget))\n            all_proxy_widgets_in_scene_.append(proxy_widget);\n\n        \/\/ Add to menu structure if its needed\n        UiWidgetProperties properties = proxy_widget->GetWidgetProperties();\n        if (properties.IsShownInToolbar())\n        {\n            QString widget_name = properties.GetWidgetName();\n            if (widget_name == \"Inventory\")\n                control_panel_manager_->GetPersonalWidget()->SetInventoryWidget(proxy_widget);\n            else if (widget_name == \"Avatar Editor\")\n                control_panel_manager_->GetPersonalWidget()->SetAvatarWidget(proxy_widget);\n            else\n                menu_manager_->AddMenuItem(CoreUi::MenuManager::Root, proxy_widget, properties);\n\n            connect(proxy_widget, SIGNAL( BringProxyToFrontRequest(UiProxyWidget*) ), this, SLOT( BringProxyToFront(UiProxyWidget*) ));\n        }\n        return true;\n    }\n\n    void InworldSceneController::RemoveProxyWidgetFromScene(UiServices::UiProxyWidget *proxy_widget)\n    {\n        if (!inworld_scene_)\n            return;\n        \n        QString widget_name = proxy_widget->GetWidgetProperties().GetWidgetName();\n        if (widget_name != \"Inventory\" && widget_name != \"Avatar Editor\")\n            menu_manager_->RemoveMenuItem(CoreUi::MenuManager::Root, proxy_widget);\n        inworld_scene_->removeItem(proxy_widget);\n        all_proxy_widgets_in_scene_.removeOne(proxy_widget);\n    }\n\n    void InworldSceneController::RemoveProxyWidgetFromScene(QWidget *widget)\n    {\n        UiProxyWidget *proxy_widget = dynamic_cast<UiProxyWidget*>(widget->graphicsProxyWidget());\n        if (proxy_widget)\n            RemoveProxyWidgetFromScene(proxy_widget);\n    }\n\n    void InworldSceneController::BringProxyToFront(UiProxyWidget *widget) const\n    {\n        if (!inworld_scene_ || !inworld_scene_->isActive())\n            return;\n        inworld_scene_->setActiveWindow(widget);\n        inworld_scene_->setFocusItem(widget, Qt::ActiveWindowFocusReason);\n    }\n\n    void InworldSceneController::BringProxyToFront(QWidget *widget) const\n    {\n        if (!inworld_scene_)\n            return;\n        ShowProxyForWidget(widget);\n        inworld_scene_->setActiveWindow(widget->graphicsProxyWidget());\n        inworld_scene_->setFocusItem(widget->graphicsProxyWidget(), Qt::ActiveWindowFocusReason);\n    }\n\n    void InworldSceneController::ShowProxyForWidget(QWidget *widget) const\n    {\n        if (inworld_scene_)\n            widget->graphicsProxyWidget()->show();\n    }\n\n    void InworldSceneController::HideProxyForWidget(QWidget *widget) const\n    {\n        if (inworld_scene_)\n            widget->graphicsProxyWidget()->hide();\n    }\n\n    QObject *InworldSceneController::GetSettingsObject() const\n    {\n        return dynamic_cast<QObject *>(control_panel_manager_->GetSettingsWidget());\n    }\n\n    void InworldSceneController::SetFocusToChat() const\n    {\n        if (communication_widget_)\n            communication_widget_->SetFocusToChat();\n    }\n\n    \/\/ Don't touch, please\n\n    void InworldSceneController::SetWorldChatController(QObject *controller) const\n    {\n        if (communication_widget_)\n            communication_widget_->UpdateController(controller);\n    }\n\n    void InworldSceneController::SetImWidget(UiProxyWidget *im_proxy) const\n    {\n        if (communication_widget_)\n            communication_widget_->UpdateImWidget(im_proxy);\n    }\n\n    \/\/ Private\n\n    void InworldSceneController::ApplyNewProxySettings(int new_opacity, int new_animation_speed) const\n    {\n        foreach (UiProxyWidget *widget, all_proxy_widgets_in_scene_)\n        {\n            widget->SetUnfocusedOpacity(new_opacity);\n            widget->SetShowAnimationSpeed(new_animation_speed);\n        }\n    }\n\t\/\/Apply new proxy position\n    void InworldSceneController::ApplyNewProxyPosition(const QRectF &new_rect)\n\t{\n\t\tQPointF left_distance;\n\t\tQPointF right_distance;\n\t\tforeach (UiProxyWidget *widget, all_proxy_widgets_in_scene_)\n        \t{\n\t\t\tif(widget->isVisible())\n\t\t\t{\t\n\t\t\t\tleft_distance.setX(widget->x() \/ last_scene_rect.width() * new_rect.width());\n\t\t\t\tleft_distance.setY(widget->y() \/ last_scene_rect.height() * new_rect.height());\n\n\t\t\t\tright_distance.setX((widget->x() + widget->size().width()) \/ last_scene_rect.width() * new_rect.width());\n\t\t\t\tright_distance.setY((widget->y() + widget->size().height()) \/ last_scene_rect.height() * new_rect.height());\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(new_rect.contains(right_distance))\n\t\t\t{\n\t\t\t\tif(widget->size().width() < new_rect.width() && right_distance.x() > new_rect.width() \/ 2)\n\t\t\t\t{\n\t\t\t\t\twidget->setX(right_distance.x() - widget->size().width());\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\t\t\n\t\t\t\t\twidget->setX(left_distance.x());\n\t\t\t\t}\n\t\t\t}else\n\t\t\t{\n\t\t\t\twidget->setX(left_distance.x());\n\t\t\t}\n\t\t\n\t\t\tif(new_rect.contains(right_distance))\n\t\t\t{\n\t\t\t\tif(widget->size().height() < new_rect.height())\n\t\t\t\t{\n\t\t\t\t\twidget->setY(right_distance.y() - widget->size().height());\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\t\t\n\t\t\t\t\twidget->setY(left_distance.y());\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\twidget->setY(left_distance.y());\n\t\t\t}\n        \t}\n\t\tlast_scene_rect = new_rect;\n\t}\n}\n<commit_msg>Moving widgets when resizing modified. Few more conditions added.<commit_after>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n#include \"UiDefines.h\"\n\n#include \"InworldSceneController.h\"\n#include \"ControlPanelManager.h\"\n\n#include \"Common\/AnchorLayoutManager.h\"\n\n#include \"Menus\/MenuManager.h\"\n\n#include \"View\/UiProxyWidget.h\"\n#include \"View\/UiWidgetProperties.h\"\n#include \"View\/CommunicationWidget.h\"\n\n#include \"Inworld\/ControlPanel\/SettingsWidget.h\"\n#include \"Inworld\/ControlPanel\/PersonalWidget.h\"\n\n#include <QRectF>\n#include <QGraphicsItem>\n#include <QGraphicsLinearLayout>\n#include <QGraphicsWidget>\n#include <QGraphicsView>\n#include <QGraphicsScene>\n\n#include \"MemoryLeakCheck.h\"\n\nnamespace UiServices\n{\n    InworldSceneController::InworldSceneController(Foundation::Framework *framework, QGraphicsView *ui_view) \n        : QObject(),\n          framework_(framework),\n          ui_view_(ui_view),\n          communication_widget_(0)\n    {\n        if (!ui_view_)\n            return;\n\n        \/\/ Store scene pointer\n        inworld_scene_ = ui_view_->scene();\n\n        \/\/ Init layout manager with scene\n        layout_manager_ = new CoreUi::AnchorLayoutManager(this, inworld_scene_);\n\n        \/\/ Init UI managers with layout manager\n        control_panel_manager_ = new CoreUi::ControlPanelManager(this, layout_manager_);\n        menu_manager_ = new CoreUi::MenuManager(this, layout_manager_);\n        \n        \/\/ Communication core UI\n        communication_widget_ = new CoreUi::CommunicationWidget();\n        layout_manager_->AddCornerAnchor(communication_widget_, Qt::BottomLeftCorner, Qt::BottomLeftCorner);\n\n        \/\/ Connect settings widget\n        connect(control_panel_manager_->GetSettingsWidget(), SIGNAL(NewUserInterfaceSettingsApplied(int, int)), SLOT(ApplyNewProxySettings(int, int)));\n\t\t\n\t\/\/apply new positions to active widgets when the inworld_scene_ is resized\n\tconnect(inworld_scene_, SIGNAL(sceneRectChanged(const QRectF)), this, SLOT(ApplyNewProxyPosition(const QRectF)));\n    }\n\n    InworldSceneController::~InworldSceneController()\n    {\n        SAFE_DELETE(communication_widget_);\n    }\n\n    \/*************** UI Scene Manager Public Services ***************\/\n\n    bool InworldSceneController::AddSettingsWidget(QWidget *settings_widget, const QString &tab_name) const\n    {\n        control_panel_manager_->GetSettingsWidget()->AddWidget(settings_widget, tab_name);\n        return true;\n    }\n\n    UiProxyWidget* InworldSceneController::AddWidgetToScene(QWidget *widget)\n    {\n        return AddWidgetToScene(widget, UiWidgetProperties(\"Unnamed Widget\", ModuleWidget));\n    }\n\n    UiProxyWidget* InworldSceneController::AddWidgetToScene(QWidget *widget, const UiServices::UiWidgetProperties &widget_properties)\n    {\n        UiProxyWidget *proxy_widget = new UiProxyWidget(widget, widget_properties);\n        if (AddProxyWidget(proxy_widget))\n            return proxy_widget;\n        else\n            return 0;\n    }\n\n    bool InworldSceneController::AddProxyWidget(UiServices::UiProxyWidget *proxy_widget)\n    {\n        if (!inworld_scene_)\n        {\n            SAFE_DELETE(proxy_widget);\n            return false;\n        }\n\n        \/\/ Add to scene\n        if (proxy_widget->isVisible())\n            proxy_widget->hide();\n        inworld_scene_->addItem(proxy_widget);\n\n        \/\/ Add to internal control list\n        if (!all_proxy_widgets_in_scene_.contains(proxy_widget))\n            all_proxy_widgets_in_scene_.append(proxy_widget);\n\n        \/\/ Add to menu structure if its needed\n        UiWidgetProperties properties = proxy_widget->GetWidgetProperties();\n        if (properties.IsShownInToolbar())\n        {\n            QString widget_name = properties.GetWidgetName();\n            if (widget_name == \"Inventory\")\n                control_panel_manager_->GetPersonalWidget()->SetInventoryWidget(proxy_widget);\n            else if (widget_name == \"Avatar Editor\")\n                control_panel_manager_->GetPersonalWidget()->SetAvatarWidget(proxy_widget);\n            else\n                menu_manager_->AddMenuItem(CoreUi::MenuManager::Root, proxy_widget, properties);\n\n            connect(proxy_widget, SIGNAL( BringProxyToFrontRequest(UiProxyWidget*) ), this, SLOT( BringProxyToFront(UiProxyWidget*) ));\n        }\n        return true;\n    }\n\n    void InworldSceneController::RemoveProxyWidgetFromScene(UiServices::UiProxyWidget *proxy_widget)\n    {\n        if (!inworld_scene_)\n            return;\n        \n        QString widget_name = proxy_widget->GetWidgetProperties().GetWidgetName();\n        if (widget_name != \"Inventory\" && widget_name != \"Avatar Editor\")\n            menu_manager_->RemoveMenuItem(CoreUi::MenuManager::Root, proxy_widget);\n        inworld_scene_->removeItem(proxy_widget);\n        all_proxy_widgets_in_scene_.removeOne(proxy_widget);\n    }\n\n    void InworldSceneController::RemoveProxyWidgetFromScene(QWidget *widget)\n    {\n        UiProxyWidget *proxy_widget = dynamic_cast<UiProxyWidget*>(widget->graphicsProxyWidget());\n        if (proxy_widget)\n            RemoveProxyWidgetFromScene(proxy_widget);\n    }\n\n    void InworldSceneController::BringProxyToFront(UiProxyWidget *widget) const\n    {\n        if (!inworld_scene_ || !inworld_scene_->isActive())\n            return;\n        inworld_scene_->setActiveWindow(widget);\n        inworld_scene_->setFocusItem(widget, Qt::ActiveWindowFocusReason);\n    }\n\n    void InworldSceneController::BringProxyToFront(QWidget *widget) const\n    {\n        if (!inworld_scene_)\n            return;\n        ShowProxyForWidget(widget);\n        inworld_scene_->setActiveWindow(widget->graphicsProxyWidget());\n        inworld_scene_->setFocusItem(widget->graphicsProxyWidget(), Qt::ActiveWindowFocusReason);\n    }\n\n    void InworldSceneController::ShowProxyForWidget(QWidget *widget) const\n    {\n        if (inworld_scene_)\n            widget->graphicsProxyWidget()->show();\n    }\n\n    void InworldSceneController::HideProxyForWidget(QWidget *widget) const\n    {\n        if (inworld_scene_)\n            widget->graphicsProxyWidget()->hide();\n    }\n\n    QObject *InworldSceneController::GetSettingsObject() const\n    {\n        return dynamic_cast<QObject *>(control_panel_manager_->GetSettingsWidget());\n    }\n\n    void InworldSceneController::SetFocusToChat() const\n    {\n        if (communication_widget_)\n            communication_widget_->SetFocusToChat();\n    }\n\n    \/\/ Don't touch, please\n\n    void InworldSceneController::SetWorldChatController(QObject *controller) const\n    {\n        if (communication_widget_)\n            communication_widget_->UpdateController(controller);\n    }\n\n    void InworldSceneController::SetImWidget(UiProxyWidget *im_proxy) const\n    {\n        if (communication_widget_)\n            communication_widget_->UpdateImWidget(im_proxy);\n    }\n\n    \/\/ Private\n\n    void InworldSceneController::ApplyNewProxySettings(int new_opacity, int new_animation_speed) const\n    {\n        foreach (UiProxyWidget *widget, all_proxy_widgets_in_scene_)\n        {\n            widget->SetUnfocusedOpacity(new_opacity);\n            widget->SetShowAnimationSpeed(new_animation_speed);\n        }\n    }\n\n    \/\/Apply new proxy position\n    void InworldSceneController::ApplyNewProxyPosition(const QRectF &new_rect)\n\t{\n\t\tQPointF left_distance;\n\t\tQPointF right_distance;\n\t\tforeach (UiProxyWidget *widget, all_proxy_widgets_in_scene_)\n        \t{\n\t\t\tif(widget->isVisible())\n\t\t\t{\t\n\t\t\t\tleft_distance.setX(widget->x() \/ last_scene_rect.width() * new_rect.width());\n\t\t\t\tleft_distance.setY(widget->y() \/ last_scene_rect.height() * new_rect.height());\n\n\t\t\t\tright_distance.setX((widget->x() + widget->size().width()) \/ last_scene_rect.width() * new_rect.width());\n\t\t\t\tright_distance.setY((widget->y() + widget->size().height()) \/ last_scene_rect.height() * new_rect.height());\t\t\t\n\t\t\t}\n\t\t\n\t\t\tif(widget->size().width() < new_rect.width())\n\t\t\t{\n\t\t\t\tif(left_distance.x() > widget->size().width())\n\t\t\t\t{\n\t\t\t\t\tif(new_rect.width() > right_distance.x())\n\t\t\t\t\t{\n\t\t\t\t\t\twidget->setX(right_distance.x() - widget->size().width());\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\twidget->setX(left_distance.x());\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\twidget->setX(left_distance.x());\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\twidget->setX(left_distance.x());\n\t\t\t}\n\n\n\t\t\tif(widget->size().height() < new_rect.height())\n\t\t\t{\n\t\t\t\tif(left_distance.y() > widget->size().height())\n\t\t\t\t{\n\t\t\t\t\tif(new_rect.height() > right_distance.y())\n\t\t\t\t\t{\n\t\t\t\t\t\twidget->setY(right_distance.y() - widget->size().height());\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\twidget->setY(left_distance.y());\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\twidget->setY(left_distance.y());\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\twidget->setY(left_distance.y());\n\t\t\t}\n        \t}\n\t\tlast_scene_rect = new_rect;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\ngpe_scene_background_class.cpp\r\nThis file is part of:\r\nGAME PENCIL ENGINE\r\nhttps:\/\/create.pawbyte.com\r\nCopyright (c) 2014-2020 Nathan Hurde, Chase Lee.\r\n\r\nCopyright (c) 2014-2020 PawByte LLC.\r\nCopyright (c) 2014-2020 Game Pencil Engine contributors ( Contributors Page )\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 all\r\ncopies 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 THE\r\nSOFTWARE.\r\n\r\n-Game Pencil Engine <https:\/\/create.pawbyte.com>\r\n\r\n\r\n*\/\r\n\r\n\r\n#include \"gpe_scene_background_class.h\"\r\n\r\nGPE_SceneBackground::GPE_SceneBackground(GPE_GeneralResourceContainer *pFolder)\r\n{\r\n    branchType = BRANCH_TYPE_BACKGROUND;\r\n    iconTexture = guiRCM->texture_add( APP_DIRECTORY_NAME+\"resources\/gfx\/iconpacks\/fontawesome\/image.png\") ;\r\n\r\n    textureId = -1;\r\n    texRes = NULL;\r\n    inFront = false;\r\n    tileHori = false;\r\n    tileVert = false;\r\n    stretchBG = false;\r\n    bgXSpeed = 0;\r\n    bgYSpeed =0;\r\n    projectParentFolder = pFolder;\r\n\r\n    if( projectParentFolder!=NULL)\r\n    {\r\n        backgroundInEditor = new GPE_DropDown_Resouce_Menu( \"Background Texture\",projectParentFolder->find_resource_from_name(RESOURCE_TYPE_NAMES[RESOURCE_TYPE_TEXTURE]+\"s\"),-1,true);\r\n        backgroundInEditor->set_width(192);\r\n    }\r\n    else\r\n    {\r\n        backgroundInEditor = NULL;\r\n    }\r\n\r\n    bgHorSpeedField = new GPE_TextInputNumber(\"\",\"\");\r\n    bgHorSpeedField->set_string(\"0\");\r\n    bgHorSpeedField->set_label(\"H-Speed\");\r\n    bgHorSpeedField->scale_width( 0.4 );\r\n\r\n    bgVertSpeedField = new GPE_TextInputNumber(\"\",\"\");\r\n    bgVertSpeedField->set_string(\"0\");\r\n    bgVertSpeedField->set_label(\"V-Speed\");\r\n    bgVertSpeedField->scale_width( 0.4 );\r\n\r\n    checkTileHori = new GPE_CheckBoxBasic(\"Tile-Hori\",\"Repeat Tile Horizontally to fill the scene\" );\r\n    checkTileVert = new GPE_CheckBoxBasic(\"Tile-Vert\",\"Repeat Tile Vertically to fill the scene\" );\r\n    checkStretch = new GPE_CheckBoxBasic(\"Stretch BG\",\"Stretch across the entire scene\" );\r\n\r\n}\r\n\r\nGPE_SceneBackground::~GPE_SceneBackground()\r\n{\r\n\r\n}\r\n\r\nvoid GPE_SceneBackground::add_typed_elements()\r\n{\r\n    if( PANEL_INSPECTOR!=NULL )\r\n    {\r\n        PANEL_INSPECTOR->add_gui_element( backgroundInEditor, true );\r\n        PANEL_INSPECTOR->add_gui_element( bgHorSpeedField, false );\r\n        PANEL_INSPECTOR->add_gui_element( bgVertSpeedField, true );\r\n\r\n        PANEL_INSPECTOR->add_gui_element( checkTileHori, true );\r\n        PANEL_INSPECTOR->add_gui_element( checkTileVert, true );\r\n        PANEL_INSPECTOR->add_gui_element( checkStretch, true );\r\n    }\r\n}\r\n\r\nbool GPE_SceneBackground::build_intohtml5_file( std::ofstream * fileTarget, int leftTabAmount,  GPE_GeneralResourceContainer * localResTypeController )\r\n{\r\n    GPE_GeneralResourceContainer * allTexturesFolder = localResTypeController->find_resource_from_name(RESOURCE_TYPE_NAMES[RESOURCE_TYPE_TEXTURE]+\"s\");\r\n    if( allTexturesFolder == NULL)\r\n    {\r\n        GPE_SceneBasicClass::build_intohtml5_file( fileTarget, leftTabAmount+1, localResTypeController);\r\n        return false;\r\n    }\r\n    std::string nestedTabsStr = generate_tabs( leftTabAmount );\r\n     GPE_GeneralResourceContainer * tempBgResource = allTexturesFolder->find_resource_from_id( textureId);\r\n    if( tempBgResource!=NULL)\r\n    {\r\n        *fileTarget << nestedTabsStr << \"newBranch = _scn_temp_layer.scnStartBackgrounds.push( {bgTexId:\" <<int_to_string(tempBgResource->exportBuildGlobalId) << \",\";\r\n\r\n        *fileTarget << \"bgXPos: \" << int_to_string( xPos) << \",\";\r\n        *fileTarget << \"bgYPos: \" << int_to_string( yPos) << \",\";\r\n        *fileTarget << \"bgXSpeed: \" << int_to_string(bgXSpeed) << \",\";\r\n        *fileTarget << \"bgYSpeed: \" << int_to_string(bgYSpeed) << \",\";\r\n        *fileTarget << \"bgTileHori: \" << int_to_string(tileHori) << \",\";\r\n        *fileTarget << \"bgTileVert: \" << int_to_string(tileVert) << \",\";\r\n        *fileTarget << \"bgStartStretch: \" << int_to_string(stretchBG);\r\n        *fileTarget << \"} ); \\n\";\r\n    }\r\n    else\r\n    {\r\n        *fileTarget << nestedTabsStr << \"newBranch = _scn_temp_layer.scnStartBackground = -1; \\n\";\r\n    }\r\n    GPE_SceneBasicClass::build_intohtml5_file( fileTarget, leftTabAmount+1, localResTypeController);\r\n    return true;\r\n}\r\n\r\nvoid GPE_SceneBackground::calculate_size()\r\n{\r\n\r\n}\r\n\r\nvoid GPE_SceneBackground::process_elements()\r\n{\r\n    GPE_SceneBasicClass::process_elements();\r\n    textureId = backgroundInEditor->get_selected_id();\r\n    if(backgroundInEditor->get_selected_id() > 0)\r\n    {\r\n        bgXSpeed = bgHorSpeedField->get_held_number();\r\n        bgYSpeed = bgVertSpeedField->get_held_number();\r\n        tileHori =checkTileHori->is_clicked();\r\n        tileVert =checkTileVert->is_clicked();\r\n        stretchBG =checkStretch->is_clicked();\r\n    }\r\n}\r\n\r\nvoid GPE_SceneBackground::render_branch()\r\n{\r\n    if( spm->cSceneTexList == NULL )\r\n    {\r\n        return;\r\n    }\r\n    GPE_GeneralResourceContainer * texTypeContainer = spm->cSceneTexList->find_resource_from_id(textureId );\r\n    if( texTypeContainer!=NULL)\r\n    {\r\n        spm->tempRect->x = floor( (xPos*spm->zoomValue)- spm->cameraFloorXPos);\r\n        spm->tempRect->y = floor( (yPos*spm->zoomValue)- spm->cameraFloorYPos );\r\n        textureResource * texRes = (textureResource*) texTypeContainer->get_held_resource();\r\n\r\n        int bgXItr = 0, bgYItr= 0;\r\n        if( texRes!=NULL && texRes->textureInEditor!=NULL )\r\n        {\r\n            if( texRes->textureInEditor->get_width() >0 && texRes->textureInEditor->get_height() >0 )\r\n            {\r\n                spm->tempRect->x = floor( (xPos* spm->zoomValue)- spm->cameraFloorXPos );\r\n                spm->tempRect->y = floor( (yPos* spm->zoomValue)- spm->cameraFloorYPos );\r\n                if( stretchBG)\r\n                {\r\n                    texRes->textureInEditor->render_tex_resized( 0,0,spm->currentCamera->w,spm->currentCamera->h,NULL, branchColor->get_color(), branchAlpha->get_value()  );\r\n                }\r\n                else if(tileHori  )\r\n                {\r\n                    for( bgXItr = spm->tempRect->x; bgXItr <=( spm->sWidth)*spm->zoomValue; bgXItr+=texRes->textureInEditor->get_width()* spm->zoomValue )\r\n                    {\r\n                        if( tileVert)\r\n                        {\r\n                            for(bgYItr = spm->tempRect->y; bgYItr <= ( spm->sHeight )* spm->zoomValue; bgYItr+=texRes->textureInEditor->get_height()* spm->zoomValue )\r\n                            {\r\n                                texRes->textureInEditor->render_tex_scaled( floor(bgXItr),floor(bgYItr), spm->zoomValue, spm->zoomValue, NULL, branchColor->get_color(), branchAlpha->get_value() );\r\n                            }\r\n                        }\r\n                        else\r\n                        {\r\n                            texRes->textureInEditor->render_tex_scaled( floor( bgXItr ),floor(spm->tempRect->y), spm->zoomValue, spm->zoomValue, NULL, branchColor->get_color(), branchAlpha->get_value() );\r\n                        }\r\n                    }\r\n                }\r\n                else if(tileVert)\r\n                {\r\n                    for(bgYItr = spm->tempRect->y; bgYItr <=( spm->sHeight)*spm->zoomValue; bgYItr+=texRes->textureInEditor->get_height()* spm->zoomValue )\r\n                    {\r\n                        texRes->textureInEditor->render_tex_scaled( floor(spm->tempRect->x),floor( bgYItr ),spm->zoomValue ,spm->zoomValue,NULL, branchColor->get_color(), branchAlpha->get_value()  );\r\n                    }\r\n                }\r\n                else\r\n                {\r\n                    texRes->textureInEditor->render_tex_scaled( floor(spm->tempRect->x),floor(spm->tempRect->y), spm->zoomValue , spm->zoomValue ,NULL, branchColor->get_color(), branchAlpha->get_value()  );\r\n                }\r\n            }\r\n        }\r\n    }\r\n    GPE_SpecialMenu_Branch::render_branch();\r\n}\r\n\r\nbool GPE_SceneBackground::save_branch_data(std::ofstream * fileTarget, int nestedFoldersIn  )\r\n{\r\n    if( fileTarget!=NULL && fileTarget->is_open() )\r\n    {\r\n        std::string nestedTabsStr = generate_tabs( nestedFoldersIn );\r\n        *fileTarget << nestedTabsStr+\"   GPE_Background=\";\r\n        if( backgroundInEditor!=NULL)\r\n        {\r\n            *fileTarget << backgroundInEditor->get_selected_name() << \",\";\r\n        }\r\n        else\r\n        {\r\n            *fileTarget << \"-1,\";\r\n        }\r\n        if( xPosField!=NULL)\r\n        {\r\n            xPosField->make_valid_number(0);\r\n            *fileTarget <<  xPosField->get_held_number() << \",\";\r\n        }\r\n        else\r\n        {\r\n            *fileTarget << \"-1,\";\r\n        }\r\n        if( yPosField!=NULL)\r\n        {\r\n            yPosField->make_valid_number(0);\r\n            *fileTarget << yPosField->get_held_number() << \",\";\r\n        }\r\n        else\r\n        {\r\n            *fileTarget << \"-1,\";\r\n        }\r\n        if( bgHorSpeedField!=NULL)\r\n        {\r\n            bgHorSpeedField->make_valid_number(0);\r\n            *fileTarget << bgHorSpeedField->get_held_number() << \",\";\r\n        }\r\n        else\r\n        {\r\n            *fileTarget << \"-1,\";\r\n        }\r\n        if( bgVertSpeedField!=NULL)\r\n        {\r\n            bgVertSpeedField->make_valid_number(0);\r\n            *fileTarget << bgVertSpeedField->get_held_number() << \",\";\r\n        }\r\n        else\r\n        {\r\n            *fileTarget << \"-1,\";\r\n        }\r\n        if( checkTileHori!=NULL)\r\n        {\r\n            *fileTarget << checkTileHori->is_clicked() << \",\";\r\n        }\r\n        else\r\n        {\r\n            *fileTarget << \"-1,\";\r\n        }\r\n        if( checkTileVert!=NULL)\r\n        {\r\n            *fileTarget << checkTileVert->is_clicked() << \",\";\r\n        }\r\n        else\r\n        {\r\n            *fileTarget << \"-1,\";\r\n        }\r\n        if( checkStretch!=NULL)\r\n        {\r\n            *fileTarget << checkStretch->is_clicked() << \",\";\r\n        }\r\n        else\r\n        {\r\n            *fileTarget << \"-1,\";\r\n        }\r\n        *fileTarget << opName+\",\";\r\n        *fileTarget << \"\\n\";\r\n        GPE_SceneBasicClass::save_branch_data( fileTarget, nestedFoldersIn+1 );\r\n        return true;\r\n    }\r\n    return false;\r\n}\r\n<commit_msg>Delete gpe_scene_background_class.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkRendererSource.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1996 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#include \"vtkRendererSource.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkPixmap.h\"\n\nvtkRendererSource::vtkRendererSource()\n{\n  this->Input = NULL;\n}\n\nvoid vtkRendererSource::Execute()\n{\n  int numOutPts;\n  vtkPixmap *outScalars;\n  float x1,y1,x2,y2;\n  unsigned char *pixels;\n  int dims[3];\n  vtkStructuredPoints *output=(vtkStructuredPoints *)this->Output;\n\n  vtkDebugMacro(<<\"Converting points\");\n\n  if (this->Input == NULL )\n    {\n    vtkErrorMacro(<<\"Please specify a renderer as input!\");\n    return;\n    }\n\n  \/\/ calc the pixel range for the renderer\n  this->Input->SetViewPoint(-1,-1,0);\n  this->Input->ViewToDisplay();\n  x1 = this->Input->GetDisplayPoint()[0];\n  y1 = this->Input->GetDisplayPoint()[1];\n  this->Input->SetViewPoint(1,1,0);\n  this->Input->ViewToDisplay();\n  x2 = this->Input->GetDisplayPoint()[0];\n  y2 = this->Input->GetDisplayPoint()[1];\n\n  if (x1 < 0) x1 = 0;\n  if (y1 < 0) y1 = 0;\n  if (x2 >= (this->Input->GetRenderWindow())->GetSize()[0]) \n    {\n    x2 = (this->Input->GetRenderWindow())->GetSize()[0] - 1;\n    }\n  if (y2 >= (this->Input->GetRenderWindow())->GetSize()[1]) \n    {\n    y2 = (this->Input->GetRenderWindow())->GetSize()[1] - 1;\n    }\n\n  if (this->WholeWindow)\n    {\n    x1 = 0;\n    y1 = 0;\n    x2 = (this->Input->GetRenderWindow())->GetSize()[0] - 1;\n    y2 = (this->Input->GetRenderWindow())->GetSize()[1] - 1;\n    }\n  \n  \/\/ Get origin, aspect ratio and dimensions from this->Input\n  dims[0] = (int)(x2 - x1 + 1); dims[1] = (int)(y2 -y1 + 1); dims[2] = 1;\n  output->SetDimensions(dims);\n  output->SetAspectRatio(1,1,1);\n  output->SetOrigin(0,0,0);\n\n  \/\/ Allocate data.  Scalar type is FloatScalars.\n  numOutPts = dims[0] * dims[1];\n  outScalars = new vtkPixmap;\n\n  pixels = (this->Input->GetRenderWindow())->GetPixelData((int)x1,(int)y1,\n\t\t\t\t\t\t\t  (int)x2,(int)y2,1);\n\n  \/\/ copy scalars over\n  memcpy(outScalars->WritePtr(0,numOutPts),pixels,3*numOutPts);\n\n  \/\/ Update ourselves\n  output->GetPointData()->SetScalars(outScalars);\n  outScalars->Delete();\n\n  \/\/ free the memory\n  delete [] pixels;\n}\n\nvoid vtkRendererSource::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkStructuredPointsSource::PrintSelf(os,indent);\n\n  if ( this->Input )\n    {\n    os << indent << \"Input:\\n\";\n    this->Input->PrintSelf(os,indent.GetNextIndent());\n    }\n  else\n    {\n    os << indent << \"Input: (none)\\n\";\n    }\n}\n\n\nunsigned long vtkRendererSource::GetMTime()\n{\n  unsigned long mTime=this->MTime.GetMTime();\n  unsigned long transMTime;\n\n  if ( this->Input )\n    {\n    transMTime = this->Input->GetMTime();\n    mTime = ( transMTime > mTime ? transMTime : mTime );\n    }\n\n  return mTime;\n}\n<commit_msg>fixed quirk where viewport not taken<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkRendererSource.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1996 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#include \"vtkRendererSource.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkPixmap.h\"\n\nvtkRendererSource::vtkRendererSource()\n{\n  this->Input = NULL;\n}\n\nvoid vtkRendererSource::Execute()\n{\n  int numOutPts;\n  vtkPixmap *outScalars;\n  float x1,y1,x2,y2;\n  unsigned char *pixels;\n  int dims[3];\n  vtkStructuredPoints *output=(vtkStructuredPoints *)this->Output;\n\n  vtkDebugMacro(<<\"Converting points\");\n\n  if (this->Input == NULL )\n    {\n    vtkErrorMacro(<<\"Please specify a renderer as input!\");\n    return;\n    }\n\n  \/\/ calc the pixel range for the renderer\n  x1 = this->Input->GetViewport()[0]*\n    ((this->Input->GetRenderWindow())->GetSize()[0] - 1);\n  y1 = this->Input->GetViewport()[1]*\n    ((this->Input->GetRenderWindow())->GetSize()[1] - 1);\n  x2 = this->Input->GetViewport()[2]*\n    ((this->Input->GetRenderWindow())->GetSize()[0] - 1);\n  y2 = this->Input->GetViewport()[3]*\n    ((this->Input->GetRenderWindow())->GetSize()[1] - 1);\n\n  if (this->WholeWindow)\n    {\n    x1 = 0;\n    y1 = 0;\n    x2 = (this->Input->GetRenderWindow())->GetSize()[0] - 1;\n    y2 = (this->Input->GetRenderWindow())->GetSize()[1] - 1;\n    }\n  \n  \/\/ Get origin, aspect ratio and dimensions from this->Input\n  dims[0] = (int)(x2 - x1 + 1); dims[1] = (int)(y2 -y1 + 1); dims[2] = 1;\n  output->SetDimensions(dims);\n  output->SetAspectRatio(1,1,1);\n  output->SetOrigin(0,0,0);\n\n  \/\/ Allocate data.  Scalar type is FloatScalars.\n  numOutPts = dims[0] * dims[1];\n  outScalars = new vtkPixmap;\n\n  pixels = (this->Input->GetRenderWindow())->GetPixelData((int)x1,(int)y1,\n\t\t\t\t\t\t\t  (int)x2,(int)y2,1);\n\n  \/\/ copy scalars over\n  memcpy(outScalars->WritePtr(0,numOutPts),pixels,3*numOutPts);\n\n  \/\/ Update ourselves\n  output->GetPointData()->SetScalars(outScalars);\n  outScalars->Delete();\n\n  \/\/ free the memory\n  delete [] pixels;\n}\n\nvoid vtkRendererSource::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkStructuredPointsSource::PrintSelf(os,indent);\n\n  if ( this->Input )\n    {\n    os << indent << \"Input:\\n\";\n    this->Input->PrintSelf(os,indent.GetNextIndent());\n    }\n  else\n    {\n    os << indent << \"Input: (none)\\n\";\n    }\n}\n\n\nunsigned long vtkRendererSource::GetMTime()\n{\n  unsigned long mTime=this->MTime.GetMTime();\n  unsigned long transMTime;\n\n  if ( this->Input )\n    {\n    transMTime = this->Input->GetMTime();\n    mTime = ( transMTime > mTime ? transMTime : mTime );\n    }\n\n  return mTime;\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_Variant.h\"\n\n#ifdef _JNC_DYNAMIC_EXTENSION_LIB\n#\tinclude \"jnc_ExtensionLib.h\"\n#elif defined(_JNC_CORE)\n#\tinclude \"jnc_ct_Module.h\"\n#\tinclude \"jnc_rt_Runtime.h\"\n#endif\n\n#include \"jnc_Runtime.h\"\n\n\/\/..............................................................................\n\nJNC_EXTERN_C\nbool_t\njnc_Variant_create(\n\tjnc_Variant* variant,\n\tconst void* p,\n\tjnc_Type* type\n\t)\n{\n\tusing namespace jnc;\n\n\tsize_t size = type->getSize();\n\tif (size <= sizeof(jnc::DataPtr))\n\t{\n\t\tmemcpy(variant, p, size);\n\t\tvariant->m_type = type;\n\t\treturn true;\n\t}\n\n\tGcHeap* gcHeap = getCurrentThreadGcHeap();\n\tif (!gcHeap)\n\t\treturn err::fail(err::Error(\"not inside Jancy call-site\"));\n\n\tDataPtr ptr = gcHeap->tryAllocateData(type);\n\tif (!ptr.m_p)\n\t\treturn false;\n\n\tmemcpy(ptr.m_p, p, size);\n\tvariant->m_type = type->getDataPtrType(TypeKind_DataRef, DataPtrTypeKind_Normal, PtrTypeFlag_Const);\n\treturn true;\n}\n\n\/\/..............................................................................\n\n#ifdef _JNC_DYNAMIC_EXTENSION_LIB\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_cast(\n\tconst jnc_Variant* variant,\n\tjnc_Type* type,\n\tvoid* buffer\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_castFunc(variant, type, buffer);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_unaryOperator(\n\tconst jnc_Variant* variant,\n\tjnc_UnOpKind opKind,\n\tjnc_Variant* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_unaryOperatorFunc(variant, opKind, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_binaryOperator(\n\tconst jnc_Variant* variant,\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tjnc_Variant* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_binaryOperatorFunc(variant, variant2, opKind, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_relationalOperator(\n\tconst jnc_Variant* variant,\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tbool_t* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_relationalOperatorFunc(variant, variant2, opKind, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_getMember(\n\tconst jnc_Variant* variant,\n\tconst char* name,\n\tjnc_Variant* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_getMemberFunc(variant, name, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_setMember(\n\tjnc_Variant* variant,\n\tconst char* name,\n\tjnc_Variant value\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_setMemberFunc(variant, name, value);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_getElement(\n\tconst jnc_Variant* variant,\n\tsize_t index,\n\tjnc_Variant* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_getElementFunc(variant, index, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_setElement(\n\tjnc_Variant* variant,\n\tsize_t index,\n\tjnc_Variant value\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_setElementFunc(variant, index, value);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nsize_t\njnc_Variant_hash(const jnc_Variant* variant)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_hashFunc(variant);\n}\n\n#else \/\/ _JNC_DYNAMIC_EXTENSION_LIB\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_cast(\n\tconst jnc_Variant* variant,\n\tjnc_Type* type,\n\tvoid* buffer\n\t)\n{\n\tusing namespace jnc;\n\tct::Module* module = type->getModule();\n\n\tct::Value opValue(variant, module->m_typeMgr.getPrimitiveType(TypeKind_Variant));\n\tct::CastOperator* castOp = module->m_operatorMgr.getStdCastOperator(ct::StdCast_FromVariant);\n\n\tmemset(buffer, 0, type->getSize());\n\treturn castOp->constCast(opValue, type, buffer);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_unaryOperator(\n\tconst jnc_Variant* variant,\n\tjnc_UnOpKind opKind,\n\tjnc_Variant* resultVariant\n\t)\n{\n\tusing namespace jnc;\n\tct::Value opValue;\n\n\tif (variant->m_type)\n\t{\n\t\topValue.createConst(variant, variant->m_type);\n\t}\n\telse\n\t{\n\t\t*resultVariant = *variant;\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\tct::Value resultValue;\n\tbool result = module->m_operatorMgr.unaryOperator(\n\t\topKind,\n\t\topValue,\n\t\t&resultValue\n\t\t) &&\n\t\tmodule->m_operatorMgr.castOperator(&resultValue, TypeKind_Variant);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultVariant = *(Variant*)resultValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_binaryOperator(\n\tconst jnc_Variant* variant,\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tjnc_Variant* resultVariant\n\t)\n{\n\tusing namespace jnc;\n\tct::Value opValue1;\n\n\tif (variant->m_type)\n\t{\n\t\topValue1.createConst(variant, variant->m_type);\n\t}\n\telse if (variant2->m_type)\n\t{\n\t\topValue1.createConst(NULL, variant2->m_type);\n\t}\n\telse\n\t{\n\t\t*resultVariant = *variant;\n\t\treturn true;\n\t}\n\n\tct::Value opValue2;\n\n\tif (variant2->m_type)\n\t{\n\t\topValue2.createConst(variant2, variant2->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type);\n\t\topValue2.createConst(NULL, variant->m_type);\n\t}\n\n\tct::Module* module = opValue1.getType()->getModule();\n\n\tct::Value resultValue;\n\tbool result = module->m_operatorMgr.binaryOperator(\n\t\topKind,\n\t\topValue1,\n\t\topValue2,\n\t\t&resultValue\n\t\t) &&\n\t\tmodule->m_operatorMgr.castOperator(&resultValue, TypeKind_Variant);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultVariant = *(Variant*)resultValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_relationalOperator(\n\tconst jnc_Variant* variant,\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tbool_t* resultBool\n\t)\n{\n\tusing namespace jnc;\n\tASSERT(opKind >= BinOpKind_Eq && opKind <= BinOpKind_Ge);\n\n\tct::Value opValue1;\n\n\tif (variant->m_type)\n\t{\n\t\topValue1.createConst(variant, variant->m_type);\n\t}\n\telse if (variant2->m_type)\n\t{\n\t\topValue1.createConst(NULL, variant2->m_type);\n\t}\n\telse\n\t{\n\t\t*resultBool = opKind == jnc_BinOpKind_Eq;\n\t\treturn true;\n\t}\n\n\tct::Value opValue2;\n\n\tif (variant2->m_type)\n\t{\n\t\topValue2.createConst(variant2, variant2->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type);\n\t\topValue2.createConst(NULL, variant->m_type);\n\t}\n\n\tct::Module* module = opValue1.getType()->getModule();\n\n\tct::Value resultValue;\n\tbool result = module->m_operatorMgr.binaryOperator(\n\t\topKind,\n\t\topValue1,\n\t\topValue2,\n\t\t&resultValue\n\t\t) &&\n\t\tmodule->m_operatorMgr.castOperator(&resultValue, TypeKind_Bool);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultBool = *(bool*)resultValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_getMember(\n\tconst jnc_Variant* variant,\n\tconst char* name,\n\tjnc_Variant* resultVariant\n\t)\n{\n\tusing namespace jnc;\n\n\tif (!variant->m_type)\n\t{\n\t\terr::setError(\"cannot apply member operator to 'null'\");\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\tct::Value opValue(variant, variant->m_type);\n\tct::Value memberValue;\n\tbool result =\n\t\tmodule->m_operatorMgr.memberOperator(opValue, name, &memberValue) &&\n\t\tmodule->m_operatorMgr.castOperator(&memberValue, TypeKind_Variant);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultVariant = *(Variant*)memberValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_setMember(\n\tjnc_Variant* variant,\n\tconst char* name,\n\tjnc_Variant valueVariant\n\t)\n{\n\tusing namespace jnc;\n\n\tif (!variant->m_type)\n\t{\n\t\terr::setError(\"cannot apply member operator to 'null'\");\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\tct::Value opValue;\n\tif (variant->m_type->getTypeKindFlags() & TypeKindFlag_Ptr)\n\t{\n\t\topValue.createConst(variant, variant->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type->getSize() <= sizeof(DataPtr));\n\t\topValue.createConst(&variant, variant->m_type->getDataPtrType_c(TypeKind_DataRef));\n\t}\n\n\tct::Value opValue2(&valueVariant, module->m_typeMgr.getPrimitiveType(TypeKind_Variant));\n\tct::Value memberValue;\n\n\treturn\n\t\tmodule->m_operatorMgr.memberOperator(opValue, name, &memberValue) &&\n\t\tmodule->m_operatorMgr.binaryOperator(BinOpKind_Assign, memberValue, opValue2);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_getElement(\n\tconst jnc_Variant* variant,\n\tsize_t index,\n\tjnc_Variant* resultVariant\n\t)\n{\n\tusing namespace jnc;\n\n\tif (!variant->m_type)\n\t{\n\t\terr::setError(\"cannot apply index operator to 'null'\");\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\t\/\/ turning it into ref is only necessary because of current implementation of OperatorMgr::memberOperator (size_t)\n\n\tct::Value opValue;\n\tif (variant->m_type->getTypeKindFlags() & TypeKindFlag_Ptr)\n\t{\n\t\topValue.createConst(variant, variant->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type->getSize() <= sizeof(DataPtr));\n\t\topValue.createConst(&variant, variant->m_type->getDataPtrType_c(TypeKind_DataRef));\n\t}\n\n\tct::Value memberValue;\n\tbool result =\n\t\tmodule->m_operatorMgr.memberOperator(opValue, index, &memberValue) &&\n\t\tmodule->m_operatorMgr.castOperator(&memberValue, TypeKind_Variant);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultVariant = *(Variant*)memberValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_setElement(\n\tjnc_Variant* variant,\n\tsize_t index,\n\tjnc_Variant valueVariant\n\t)\n{\n\tusing namespace jnc;\n\n\tif (!variant->m_type)\n\t{\n\t\terr::setError(\"cannot apply index operator to 'null'\");\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\tct::Value opValue;\n\tif (variant->m_type->getTypeKindFlags() & TypeKindFlag_Ptr)\n\t{\n\t\topValue.createConst(variant, variant->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type->getSize() <= sizeof(DataPtr));\n\t\topValue.createConst(&variant, variant->m_type->getDataPtrType_c(TypeKind_DataRef));\n\t}\n\n\tct::Value opValue2(&valueVariant, module->m_typeMgr.getPrimitiveType(TypeKind_Variant));\n\tct::Value memberValue;\n\n\treturn\n\t\tmodule->m_operatorMgr.memberOperator(opValue, index, &memberValue) &&\n\t\tmodule->m_operatorMgr.binaryOperator(BinOpKind_Assign, memberValue, opValue2);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nsize_t\njnc_Variant_hash(const jnc_Variant* variant)\n{\n\tusing namespace jnc;\n\tif (!variant->m_type)\n\t\treturn 0;\n\n\tsize_t size = variant->m_type->getSize();\n\n\tif (variant->m_type->getTypeKindFlags() & TypeKindFlag_BigEndian)\n\t{\n\t\tuint64_t result = 0;\n\t\taxl::sl::swapByteOrder(&result, &variant->m_int64, size);\n\t\treturn (uintptr_t)result;\n\t}\n\n\tif (size <= sizeof(uintptr_t) || variant->m_type->getTypeKind() == TypeKind_DataPtr)\n\t\treturn variant->m_uintptr;\n\n\tconst void* p = size <= sizeof(DataPtr) ? &variant : variant->m_p;\n\treturn sl::djb2(p, size);\n}\n\n#endif \/\/ _JNC_DYNAMIC_EXTENSION_LIB\n\n\/\/..............................................................................\n\nbool\njnc::Variant::relationalOperator(\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tbool* result\n\t) const\n{\n\tbool_t intResult;\n\tif (!jnc_Variant_relationalOperator(this, variant2, opKind, &intResult))\n\t\treturn false;\n\n\t*result = intResult != 0;\n\treturn true;\n}\n\n\/\/..............................................................................\n<commit_msg>[jnc_api] fix: indirect variant didn't save the newly allocated data ptr<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_Variant.h\"\n\n#ifdef _JNC_DYNAMIC_EXTENSION_LIB\n#\tinclude \"jnc_ExtensionLib.h\"\n#elif defined(_JNC_CORE)\n#\tinclude \"jnc_ct_Module.h\"\n#\tinclude \"jnc_rt_Runtime.h\"\n#endif\n\n#include \"jnc_Runtime.h\"\n\n\/\/..............................................................................\n\nJNC_EXTERN_C\nbool_t\njnc_Variant_create(\n\tjnc_Variant* variant,\n\tconst void* p,\n\tjnc_Type* type\n\t)\n{\n\tusing namespace jnc;\n\n\tsize_t size = type->getSize();\n\tif (size <= sizeof(jnc::DataPtr))\n\t{\n\t\tmemcpy(variant, p, size);\n\t\tvariant->m_type = type;\n\t\treturn true;\n\t}\n\n\tGcHeap* gcHeap = getCurrentThreadGcHeap();\n\tif (!gcHeap)\n\t\treturn err::fail(err::Error(\"not inside Jancy call-site\"));\n\n\tDataPtr ptr = gcHeap->tryAllocateData(type);\n\tif (!ptr.m_p)\n\t\treturn false;\n\n\tmemcpy(ptr.m_p, p, size);\n\tvariant->m_type = type->getDataPtrType(TypeKind_DataRef, DataPtrTypeKind_Normal, PtrTypeFlag_Const);\n\tvariant->m_dataPtr = ptr;\n\treturn true;\n}\n\n\/\/..............................................................................\n\n#ifdef _JNC_DYNAMIC_EXTENSION_LIB\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_cast(\n\tconst jnc_Variant* variant,\n\tjnc_Type* type,\n\tvoid* buffer\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_castFunc(variant, type, buffer);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_unaryOperator(\n\tconst jnc_Variant* variant,\n\tjnc_UnOpKind opKind,\n\tjnc_Variant* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_unaryOperatorFunc(variant, opKind, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_binaryOperator(\n\tconst jnc_Variant* variant,\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tjnc_Variant* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_binaryOperatorFunc(variant, variant2, opKind, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_relationalOperator(\n\tconst jnc_Variant* variant,\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tbool_t* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_relationalOperatorFunc(variant, variant2, opKind, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_getMember(\n\tconst jnc_Variant* variant,\n\tconst char* name,\n\tjnc_Variant* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_getMemberFunc(variant, name, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_setMember(\n\tjnc_Variant* variant,\n\tconst char* name,\n\tjnc_Variant value\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_setMemberFunc(variant, name, value);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_getElement(\n\tconst jnc_Variant* variant,\n\tsize_t index,\n\tjnc_Variant* result\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_getElementFunc(variant, index, result);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_setElement(\n\tjnc_Variant* variant,\n\tsize_t index,\n\tjnc_Variant value\n\t)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_setElementFunc(variant, index, value);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nsize_t\njnc_Variant_hash(const jnc_Variant* variant)\n{\n\treturn jnc_g_dynamicExtensionLibHost->m_variantFuncTable->m_hashFunc(variant);\n}\n\n#else \/\/ _JNC_DYNAMIC_EXTENSION_LIB\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_cast(\n\tconst jnc_Variant* variant,\n\tjnc_Type* type,\n\tvoid* buffer\n\t)\n{\n\tusing namespace jnc;\n\tct::Module* module = type->getModule();\n\n\tct::Value opValue(variant, module->m_typeMgr.getPrimitiveType(TypeKind_Variant));\n\tct::CastOperator* castOp = module->m_operatorMgr.getStdCastOperator(ct::StdCast_FromVariant);\n\n\tmemset(buffer, 0, type->getSize());\n\treturn castOp->constCast(opValue, type, buffer);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_unaryOperator(\n\tconst jnc_Variant* variant,\n\tjnc_UnOpKind opKind,\n\tjnc_Variant* resultVariant\n\t)\n{\n\tusing namespace jnc;\n\tct::Value opValue;\n\n\tif (variant->m_type)\n\t{\n\t\topValue.createConst(variant, variant->m_type);\n\t}\n\telse\n\t{\n\t\t*resultVariant = *variant;\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\tct::Value resultValue;\n\tbool result = module->m_operatorMgr.unaryOperator(\n\t\topKind,\n\t\topValue,\n\t\t&resultValue\n\t\t) &&\n\t\tmodule->m_operatorMgr.castOperator(&resultValue, TypeKind_Variant);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultVariant = *(Variant*)resultValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_binaryOperator(\n\tconst jnc_Variant* variant,\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tjnc_Variant* resultVariant\n\t)\n{\n\tusing namespace jnc;\n\tct::Value opValue1;\n\n\tif (variant->m_type)\n\t{\n\t\topValue1.createConst(variant, variant->m_type);\n\t}\n\telse if (variant2->m_type)\n\t{\n\t\topValue1.createConst(NULL, variant2->m_type);\n\t}\n\telse\n\t{\n\t\t*resultVariant = *variant;\n\t\treturn true;\n\t}\n\n\tct::Value opValue2;\n\n\tif (variant2->m_type)\n\t{\n\t\topValue2.createConst(variant2, variant2->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type);\n\t\topValue2.createConst(NULL, variant->m_type);\n\t}\n\n\tct::Module* module = opValue1.getType()->getModule();\n\n\tct::Value resultValue;\n\tbool result = module->m_operatorMgr.binaryOperator(\n\t\topKind,\n\t\topValue1,\n\t\topValue2,\n\t\t&resultValue\n\t\t) &&\n\t\tmodule->m_operatorMgr.castOperator(&resultValue, TypeKind_Variant);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultVariant = *(Variant*)resultValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_relationalOperator(\n\tconst jnc_Variant* variant,\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tbool_t* resultBool\n\t)\n{\n\tusing namespace jnc;\n\tASSERT(opKind >= BinOpKind_Eq && opKind <= BinOpKind_Ge);\n\n\tct::Value opValue1;\n\n\tif (variant->m_type)\n\t{\n\t\topValue1.createConst(variant, variant->m_type);\n\t}\n\telse if (variant2->m_type)\n\t{\n\t\topValue1.createConst(NULL, variant2->m_type);\n\t}\n\telse\n\t{\n\t\t*resultBool = opKind == jnc_BinOpKind_Eq;\n\t\treturn true;\n\t}\n\n\tct::Value opValue2;\n\n\tif (variant2->m_type)\n\t{\n\t\topValue2.createConst(variant2, variant2->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type);\n\t\topValue2.createConst(NULL, variant->m_type);\n\t}\n\n\tct::Module* module = opValue1.getType()->getModule();\n\n\tct::Value resultValue;\n\tbool result = module->m_operatorMgr.binaryOperator(\n\t\topKind,\n\t\topValue1,\n\t\topValue2,\n\t\t&resultValue\n\t\t) &&\n\t\tmodule->m_operatorMgr.castOperator(&resultValue, TypeKind_Bool);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultBool = *(bool*)resultValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_getMember(\n\tconst jnc_Variant* variant,\n\tconst char* name,\n\tjnc_Variant* resultVariant\n\t)\n{\n\tusing namespace jnc;\n\n\tif (!variant->m_type)\n\t{\n\t\terr::setError(\"cannot apply member operator to 'null'\");\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\tct::Value opValue(variant, variant->m_type);\n\tct::Value memberValue;\n\tbool result =\n\t\tmodule->m_operatorMgr.memberOperator(opValue, name, &memberValue) &&\n\t\tmodule->m_operatorMgr.castOperator(&memberValue, TypeKind_Variant);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultVariant = *(Variant*)memberValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_setMember(\n\tjnc_Variant* variant,\n\tconst char* name,\n\tjnc_Variant valueVariant\n\t)\n{\n\tusing namespace jnc;\n\n\tif (!variant->m_type)\n\t{\n\t\terr::setError(\"cannot apply member operator to 'null'\");\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\tct::Value opValue;\n\tif (variant->m_type->getTypeKindFlags() & TypeKindFlag_Ptr)\n\t{\n\t\topValue.createConst(variant, variant->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type->getSize() <= sizeof(DataPtr));\n\t\topValue.createConst(&variant, variant->m_type->getDataPtrType_c(TypeKind_DataRef));\n\t}\n\n\tct::Value opValue2(&valueVariant, module->m_typeMgr.getPrimitiveType(TypeKind_Variant));\n\tct::Value memberValue;\n\n\treturn\n\t\tmodule->m_operatorMgr.memberOperator(opValue, name, &memberValue) &&\n\t\tmodule->m_operatorMgr.binaryOperator(BinOpKind_Assign, memberValue, opValue2);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_getElement(\n\tconst jnc_Variant* variant,\n\tsize_t index,\n\tjnc_Variant* resultVariant\n\t)\n{\n\tusing namespace jnc;\n\n\tif (!variant->m_type)\n\t{\n\t\terr::setError(\"cannot apply index operator to 'null'\");\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\t\/\/ turning it into ref is only necessary because of current implementation of OperatorMgr::memberOperator (size_t)\n\n\tct::Value opValue;\n\tif (variant->m_type->getTypeKindFlags() & TypeKindFlag_Ptr)\n\t{\n\t\topValue.createConst(variant, variant->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type->getSize() <= sizeof(DataPtr));\n\t\topValue.createConst(&variant, variant->m_type->getDataPtrType_c(TypeKind_DataRef));\n\t}\n\n\tct::Value memberValue;\n\tbool result =\n\t\tmodule->m_operatorMgr.memberOperator(opValue, index, &memberValue) &&\n\t\tmodule->m_operatorMgr.castOperator(&memberValue, TypeKind_Variant);\n\n\tif (!result)\n\t\treturn false;\n\n\t*resultVariant = *(Variant*)memberValue.getConstData();\n\treturn true;\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nbool_t\njnc_Variant_setElement(\n\tjnc_Variant* variant,\n\tsize_t index,\n\tjnc_Variant valueVariant\n\t)\n{\n\tusing namespace jnc;\n\n\tif (!variant->m_type)\n\t{\n\t\terr::setError(\"cannot apply index operator to 'null'\");\n\t\treturn true;\n\t}\n\n\tct::Module* module = variant->m_type->getModule();\n\n\tct::Value opValue;\n\tif (variant->m_type->getTypeKindFlags() & TypeKindFlag_Ptr)\n\t{\n\t\topValue.createConst(variant, variant->m_type);\n\t}\n\telse\n\t{\n\t\tASSERT(variant->m_type->getSize() <= sizeof(DataPtr));\n\t\topValue.createConst(&variant, variant->m_type->getDataPtrType_c(TypeKind_DataRef));\n\t}\n\n\tct::Value opValue2(&valueVariant, module->m_typeMgr.getPrimitiveType(TypeKind_Variant));\n\tct::Value memberValue;\n\n\treturn\n\t\tmodule->m_operatorMgr.memberOperator(opValue, index, &memberValue) &&\n\t\tmodule->m_operatorMgr.binaryOperator(BinOpKind_Assign, memberValue, opValue2);\n}\n\nJNC_EXTERN_C\nJNC_EXPORT_O\nsize_t\njnc_Variant_hash(const jnc_Variant* variant)\n{\n\tusing namespace jnc;\n\tif (!variant->m_type)\n\t\treturn 0;\n\n\tsize_t size = variant->m_type->getSize();\n\n\tif (variant->m_type->getTypeKindFlags() & TypeKindFlag_BigEndian)\n\t{\n\t\tuint64_t result = 0;\n\t\taxl::sl::swapByteOrder(&result, &variant->m_int64, size);\n\t\treturn (uintptr_t)result;\n\t}\n\n\tif (size <= sizeof(uintptr_t) || variant->m_type->getTypeKind() == TypeKind_DataPtr)\n\t\treturn variant->m_uintptr;\n\n\tconst void* p = size <= sizeof(DataPtr) ? &variant : variant->m_p;\n\treturn sl::djb2(p, size);\n}\n\n#endif \/\/ _JNC_DYNAMIC_EXTENSION_LIB\n\n\/\/..............................................................................\n\nbool\njnc::Variant::relationalOperator(\n\tconst jnc_Variant* variant2,\n\tjnc_BinOpKind opKind,\n\tbool* result\n\t) const\n{\n\tbool_t intResult;\n\tif (!jnc_Variant_relationalOperator(this, variant2, opKind, &intResult))\n\t\treturn false;\n\n\t*result = intResult != 0;\n\treturn true;\n}\n\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 FILES\n#include \"bluetoothlinkmanagerdevicediscoverer.h\"\n#include \"qbluetoothaddress.h\"\n#include \"qbluetoothdeviceinfo.h\"\n#include \"qbluetoothuuid.h\"\n\n#include <qstring.h>\n#ifdef EIR_SUPPORTED\n#include <arpa\/inet.h>\n#include <netinet\/in.h>\n#endif\n#include \"utils_symbian_p.h\"\n#include <qdebug.h>\n\nQTM_BEGIN_NAMESPACE\n\n\/*! \\internal\n    \\class BluetoothLinkManagerDeviceDiscoverer\n    \\brief The BluetoothLinkManagerDeviceDiscoverer class searches other bluetooth devices.\n\n    \\ingroup connectivity-bluetooth\n    \\inmodule QtConnectivity\n    \\internal\n\n    BluetoothLinkManagerDeviceDiscoverer is an Symbian ActiveObject derived class that discovers\n    other Bluetooth devices using \"BTLinkManager\" protocol.\n\n    When Bluetoothdevices are found signal deviceDiscovered(QBluetoothDeviceInfo &) is emitted. When\n    all devices are found (or none) signal deviceDiscoveryComplete() is emitted.\n\n    In case of an error signal linkManagerError(int error) is emitted. In the case of errorSignal\n    one should consider deleting this class and creating it again.\n*\/\n\n_LIT(KBTLinkManagerTxt,\"BTLinkManager\");\n\nBluetoothLinkManagerDeviceDiscoverer::BluetoothLinkManagerDeviceDiscoverer(RSocketServ &socketServer,QObject *parent)\n    : QObject(parent)\n    , CActive(CActive::EPriorityStandard)\n    , m_socketServer(socketServer)\n    , m_pendingCancel(false), m_pendingStart(false), m_discoveryType (0)\n{\n    TInt result;\n\n    \/* find Bluetooth protocol *\/\n    TProtocolDesc protocol;\n    result = m_socketServer.FindProtocol(KBTLinkManagerTxt(),protocol);\n    if (result == KErrNone) {\n        \/* Create and initialise an RHostResolver *\/\n        result = m_hostResolver.Open(m_socketServer, protocol.iAddrFamily, protocol.iProtocol);\n    }\n    \/\/ check possible error\n    if (result != KErrNone) {\n        setError(result);\n    }\n\n    \/\/add this active object to scheduler\n    CActiveScheduler::Add(this);\n}\n\nBluetoothLinkManagerDeviceDiscoverer::~BluetoothLinkManagerDeviceDiscoverer()\n{\n    \/\/ cancel active object\n    Cancel();\n    m_hostResolver.Close();\n}\n\/*!\n    Starts up device discovery. When devices are discovered signal deviceDiscovered is emitted.\n    After signal deviceDiscoveryComplete() is emitted new discovery request can be made.\n*\/\nvoid BluetoothLinkManagerDeviceDiscoverer::startDiscovery(const uint discoveryType)\n{\n    m_discoveryType = discoveryType;\n    \n    if(m_pendingCancel == true) {\n        m_pendingStart = true;\n        m_pendingCancel = false;  \n        return;\n    }\n    if (!IsActive()) {\n        m_addr.SetIAC( discoveryType );\n#ifdef EIR_SUPPORTED\n        m_addr.SetAction(KHostResInquiry | KHostResName | KHostResIgnoreCache | KHostResEir);\n#else\n        m_addr.SetAction(KHostResInquiry | KHostResName | KHostResIgnoreCache);\n#endif\n        m_hostResolver.GetByAddress(m_addr, m_entry, iStatus);\n        SetActive();\n    }\n}\n\nvoid BluetoothLinkManagerDeviceDiscoverer::stopDiscovery()\n{\n    m_pendingStart = false; \n    if (IsActive() && !m_pendingCancel) {\n        m_pendingCancel = true;\n        m_hostResolver.Cancel();\n    }\n}\n\n\/*!\n  Informs that our request has been prosessed and the data is available to be used.\n*\/\nvoid BluetoothLinkManagerDeviceDiscoverer::RunL()\n{\n    qDebug() << __PRETTY_FUNCTION__ << iStatus.Int();\n    switch (iStatus.Int()) {\n    case KErrNone:  \/\/ found device\n        if (m_pendingCancel && !m_pendingStart) {\n            m_pendingCancel = false;\n            emit canceled();\n        } else {\n            m_pendingCancel = false;\n            m_pendingStart = false;\n            \/\/ get next (possible) discovered device\n            m_hostResolver.Next(m_entry, iStatus);\n            SetActive();\n            emit deviceDiscovered(currentDeviceDataToQBluetoothDeviceInfo());\n        }\n        break;\n    case KErrHostResNoMoreResults:  \/\/ done with search\n        if (m_pendingCancel && !m_pendingStart){  \/\/ search was canceled prior to finishing\n            m_pendingCancel = false;\n            m_pendingStart = false;\n            emit canceled();\n        }\n        else if (m_pendingStart){  \/\/ search was restarted just prior to finishing\n            m_pendingStart = false;\n            m_pendingCancel = false;\n            startDiscovery(m_discoveryType);\n        } else {  \/\/ search completed normally\n            m_pendingStart = false;\n            m_pendingCancel = false;\n            emit deviceDiscoveryComplete();\n        }\n        break;\n    case KErrCancel:  \/\/ user canceled search\n        if (m_pendingStart){  \/\/ user activated search after cancel\n            m_pendingStart = false;\n            m_pendingCancel = false;\n            startDiscovery(m_discoveryType);\n        } else {  \/\/ standard user cancel case\n            m_pendingCancel = false;\n            emit canceled();\n        }\n        break;\n    default:\n        m_pendingStart = false;\n        m_pendingCancel = false;\n        setError(iStatus.Int());\n    }\n}\n\/*!\n  Cancel current request.\n*\/\nvoid BluetoothLinkManagerDeviceDiscoverer::DoCancel()\n{\n    m_hostResolver.Cancel();\n}\n\nTInt BluetoothLinkManagerDeviceDiscoverer::RunError(TInt aError)\n{\n    setError(aError);\n    return KErrNone;\n}\n\nbool BluetoothLinkManagerDeviceDiscoverer::isReallyActive() const\n{\n    if(m_pendingStart)\n        return true;\n    if(m_pendingCancel)\n        return false;\n    return IsActive();\n}\n\n\/*!\n    Transforms Symbian device name, address and service classes to QBluetootDeviceInfo.\n*\/\nQBluetoothDeviceInfo BluetoothLinkManagerDeviceDiscoverer::currentDeviceDataToQBluetoothDeviceInfo() const\n{\n    \/\/ extract device information from results and map them to QBluetoothDeviceInfo\n#ifdef EIR_SUPPORTED\n    TBluetoothNameRecordWrapper eir(m_entry());\n    TInt bufferlength = 0;\n    QString deviceName;\n    bufferlength = eir.GetDeviceNameLength();\n\n    if (bufferlength > 0) {\n        TBool nameComplete;\n        HBufC *deviceNameBuffer = HBufC::NewLC(bufferlength);\n        TPtr ptr = deviceNameBuffer->Des();\n        TInt error = eir.GetDeviceName(ptr,nameComplete);\n        if (error == KErrNone && nameComplete)\n            deviceName = QString::fromUtf16(ptr.Ptr(), ptr.Length()).toUpper();\n        CleanupStack::PopAndDestroy(deviceNameBuffer);\n    }\n\n    QList<QBluetoothUuid> serviceUidList;\n    RExtendedInquiryResponseUUIDContainer uuidContainer;\n    QBluetoothDeviceInfo::DataCompleteness completenes = QBluetoothDeviceInfo::DataUnavailable;\n\n    if (eir.GetServiceClassUuids(uuidContainer) == KErrNone) {\n        TInt uuidCount = uuidContainer.UUIDs().Count();\n        if (uuidCount > 0) {\n            for (int i = 0; i < uuidCount; ++i) {\n                TPtrC8 shortFormUUid(uuidContainer.UUIDs()[i].ShortestForm());\n                if (shortFormUUid.Size() == 2) {\n                    QBluetoothUuid uuid(ntohs(*reinterpret_cast<const quint16 *>(shortFormUUid.Ptr())));\n                    if (uuidContainer.GetCompleteness(RExtendedInquiryResponseUUIDContainer::EUUID16))\n                        completenes = QBluetoothDeviceInfo::DataComplete;\n                    else\n                        completenes = QBluetoothDeviceInfo::DataIncomplete;\n                    serviceUidList.append(uuid);\n                }else if (shortFormUUid.Size() == 4) {\n                    QBluetoothUuid uuid(ntohl(*reinterpret_cast<const quint32 *>(shortFormUUid.Ptr())));\n                    if (uuidContainer.GetCompleteness(RExtendedInquiryResponseUUIDContainer::EUUID32))\n                        completenes = QBluetoothDeviceInfo::DataComplete;\n                    else\n                        completenes = QBluetoothDeviceInfo::DataIncomplete;\n                    serviceUidList.append(uuid);\n                }else if (shortFormUUid.Size() == 16) {\n                    QBluetoothUuid uuid(*reinterpret_cast<const quint128 *>(shortFormUUid.Ptr()));\n                    if (uuidContainer.GetCompleteness(RExtendedInquiryResponseUUIDContainer::EUUID128))\n                        completenes = QBluetoothDeviceInfo::DataComplete;\n                    else\n                        completenes = QBluetoothDeviceInfo::DataIncomplete;\n                    serviceUidList.append(uuid);\n                }\n            }\n        }\n    }\n    uuidContainer.Close();\n\n    bufferlength = 0;\n    QByteArray manufacturerData;\n    bufferlength = eir.GetVendorSpecificDataLength();\n\n    if (bufferlength > 0) {\n        HBufC8 *msd = HBufC8::NewLC(bufferlength);\n        TPtr8 temp = msd->Des();\n        if (eir.GetVendorSpecificData(temp))\n            manufacturerData = s60Desc8ToQByteArray(temp);\n        CleanupStack::PopAndDestroy(msd);\n    }\n\n    \/\/ Get transmission power level\n    TInt8 transmissionPowerLevel = 0;\n    eir.GetTxPowerLevel(transmissionPowerLevel);\n\n    \/\/ unique address of the device\n    const TBTDevAddr symbianDeviceAddress = static_cast<TBTSockAddr> (m_entry().iAddr).BTAddr();\n    QBluetoothAddress bluetoothAddress = qTBTDevAddrToQBluetoothAddress(symbianDeviceAddress);\n\n    \/\/ format symbian major\/minor numbers\n    quint32 deviceClass = qTPackSymbianDeviceClass(m_addr);\n\n    QBluetoothDeviceInfo deviceInfo(bluetoothAddress, deviceName, deviceClass);\n\n    deviceInfo.setRssi(transmissionPowerLevel);\n    deviceInfo.setServiceUuids(serviceUidList, completenes);\n    deviceInfo.setManufacturerSpecificData(manufacturerData);\n#else\n    \/\/ device name\n    THostName symbianDeviceName = m_entry().iName;\n    QString deviceName = QString::fromUtf16(symbianDeviceName.Ptr(), symbianDeviceName.Length()).toUpper();\n\n    \/\/ unique address of the device\n    const TBTDevAddr symbianDeviceAddress = static_cast<TBTSockAddr> (m_entry().iAddr).BTAddr();\n    QBluetoothAddress bluetoothAddress = qTBTDevAddrToQBluetoothAddress(symbianDeviceAddress);\n\n    \/\/ format symbian major\/minor numbers\n    quint32 deviceClass = qTPackSymbianDeviceClass(m_addr);\n\n    QBluetoothDeviceInfo deviceInfo(bluetoothAddress, deviceName, deviceClass);\n\n    if (m_addr.Rssi())\n        deviceInfo.setRssi(m_addr.Rssi());\n#endif\n    if (!deviceInfo.rssi())\n        deviceInfo.setRssi(1);\n\n    deviceInfo.setCached(false);  \/\/TODO cache support missing from devicediscovery API\n    \/\/qDebug()<< \"Discovered device: name=\"<< deviceName <<\", address=\" << bluetoothAddress.toString() <<\", class=\" << deviceClass;\n    return deviceInfo;\n}\n\nvoid BluetoothLinkManagerDeviceDiscoverer::setError(int errorCode)\n{\n    qDebug() << __PRETTY_FUNCTION__ << \"errorCode=\" << errorCode;\n    QString errorString;\n    switch (errorCode) {\n        case KLinkManagerErrBase:\n            errorString.append(\"Link manager base error value or Insufficient baseband resources error value\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n        case KErrProxyWriteNotAvailable:\n            errorString.append(\"Proxy write not available error value\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n        case KErrReflexiveBluetoothLink:\n            errorString.append(\"Reflexive BT link error value\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n        case KErrPendingPhysicalLink:\n            errorString.append(\"Physical link connection already pending when trying to connect the physical link\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n        case KErrNotReady:\n            errorString.append(\"KErrNotReady\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n        case KErrCancel:\n            errorString.append(\"KErrCancel\");\n            qDebug() << \"emitting canceled\";\n            emit canceled();\n            break;\n        case KErrNone:\n            \/\/ do nothing\n            break;\n        default:\n            errorString.append(\"Symbian errorCode =\") + errorCode;\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n    }\n}\n#include \"moc_bluetoothlinkmanagerdevicediscoverer.cpp\"\n\nQTM_END_NAMESPACE\n<commit_msg>Fix device discovery in Symbian Bluetooth backend<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 FILES\n#include \"bluetoothlinkmanagerdevicediscoverer.h\"\n#include \"qbluetoothaddress.h\"\n#include \"qbluetoothdeviceinfo.h\"\n#include \"qbluetoothuuid.h\"\n\n#include <qstring.h>\n#ifdef EIR_SUPPORTED\n#include <arpa\/inet.h>\n#include <netinet\/in.h>\n#endif\n#include \"utils_symbian_p.h\"\n#include <qdebug.h>\n\nQTM_BEGIN_NAMESPACE\n\n\/*! \\internal\n    \\class BluetoothLinkManagerDeviceDiscoverer\n    \\brief The BluetoothLinkManagerDeviceDiscoverer class searches other bluetooth devices.\n\n    \\ingroup connectivity-bluetooth\n    \\inmodule QtConnectivity\n    \\internal\n\n    BluetoothLinkManagerDeviceDiscoverer is an Symbian ActiveObject derived class that discovers\n    other Bluetooth devices using \"BTLinkManager\" protocol.\n\n    When Bluetoothdevices are found signal deviceDiscovered(QBluetoothDeviceInfo &) is emitted. When\n    all devices are found (or none) signal deviceDiscoveryComplete() is emitted.\n\n    In case of an error signal linkManagerError(int error) is emitted. In the case of errorSignal\n    one should consider deleting this class and creating it again.\n*\/\n\n_LIT(KBTLinkManagerTxt,\"BTLinkManager\");\n\nBluetoothLinkManagerDeviceDiscoverer::BluetoothLinkManagerDeviceDiscoverer(RSocketServ &socketServer,QObject *parent)\n    : QObject(parent)\n    , CActive(CActive::EPriorityStandard)\n    , m_socketServer(socketServer)\n    , m_pendingCancel(false), m_pendingStart(false), m_discoveryType (0)\n{\n    TInt result;\n\n    \/* find Bluetooth protocol *\/\n    TProtocolDesc protocol;\n    result = m_socketServer.FindProtocol(KBTLinkManagerTxt(),protocol);\n    if (result == KErrNone) {\n        \/* Create and initialise an RHostResolver *\/\n        result = m_hostResolver.Open(m_socketServer, protocol.iAddrFamily, protocol.iProtocol);\n    }\n    \/\/ check possible error\n    if (result != KErrNone) {\n        setError(result);\n    }\n\n    \/\/add this active object to scheduler\n    CActiveScheduler::Add(this);\n}\n\nBluetoothLinkManagerDeviceDiscoverer::~BluetoothLinkManagerDeviceDiscoverer()\n{\n    \/\/ cancel active object\n    Cancel();\n    m_hostResolver.Close();\n}\n\/*!\n    Starts up device discovery. When devices are discovered signal deviceDiscovered is emitted.\n    After signal deviceDiscoveryComplete() is emitted new discovery request can be made.\n*\/\nvoid BluetoothLinkManagerDeviceDiscoverer::startDiscovery(const uint discoveryType)\n{\n    m_discoveryType = discoveryType;\n    \n    if(m_pendingCancel == true) {\n        m_pendingStart = true;\n        m_pendingCancel = false;  \n        return;\n    }\n    if (!IsActive()) {\n        m_addr.SetIAC( discoveryType );\n#ifdef EIR_SUPPORTED\n        m_addr.SetAction(KHostResInquiry | KHostResName | KHostResIgnoreCache | KHostResEir);\n#else\n        m_addr.SetAction(KHostResInquiry | KHostResName | KHostResIgnoreCache);\n#endif\n        m_hostResolver.GetByAddress(m_addr, m_entry, iStatus);\n        SetActive();\n    }\n}\n\nvoid BluetoothLinkManagerDeviceDiscoverer::stopDiscovery()\n{\n    m_pendingStart = false; \n    if (IsActive() && !m_pendingCancel) {\n        m_pendingCancel = true;\n        m_hostResolver.Cancel();\n    }\n}\n\n\/*!\n  Informs that our request has been prosessed and the data is available to be used.\n*\/\nvoid BluetoothLinkManagerDeviceDiscoverer::RunL()\n{\n    qDebug() << __PRETTY_FUNCTION__ << iStatus.Int();\n    switch (iStatus.Int()) {\n    case KErrNone:  \/\/ found device\n        if (m_pendingCancel && !m_pendingStart) {\n            m_pendingCancel = false;\n            emit canceled();\n        } else {\n            m_pendingCancel = false;\n            m_pendingStart = false;\n            \/\/ get next (possible) discovered device\n            m_hostResolver.Next(m_entry, iStatus);\n            SetActive();\n            emit deviceDiscovered(currentDeviceDataToQBluetoothDeviceInfo());\n        }\n        break;\n    case KErrHostResNoMoreResults:  \/\/ done with search\n        if (m_pendingCancel && !m_pendingStart){  \/\/ search was canceled prior to finishing\n            m_pendingCancel = false;\n            m_pendingStart = false;\n            emit canceled();\n        }\n        else if (m_pendingStart){  \/\/ search was restarted just prior to finishing\n            m_pendingStart = false;\n            m_pendingCancel = false;\n            startDiscovery(m_discoveryType);\n        } else {  \/\/ search completed normally\n            m_pendingStart = false;\n            m_pendingCancel = false;\n            emit deviceDiscoveryComplete();\n        }\n        break;\n    case KErrCancel:  \/\/ user canceled search\n        if (m_pendingStart){  \/\/ user activated search after cancel\n            m_pendingStart = false;\n            m_pendingCancel = false;\n            startDiscovery(m_discoveryType);\n        } else {  \/\/ standard user cancel case\n            m_pendingCancel = false;\n            emit canceled();\n        }\n        break;\n    default:\n        m_pendingStart = false;\n        m_pendingCancel = false;\n        setError(iStatus.Int());\n    }\n}\n\/*!\n  Cancel current request.\n*\/\nvoid BluetoothLinkManagerDeviceDiscoverer::DoCancel()\n{\n    m_hostResolver.Cancel();\n}\n\nTInt BluetoothLinkManagerDeviceDiscoverer::RunError(TInt aError)\n{\n    setError(aError);\n    return KErrNone;\n}\n\nbool BluetoothLinkManagerDeviceDiscoverer::isReallyActive() const\n{\n    if(m_pendingStart)\n        return true;\n    if(m_pendingCancel)\n        return false;\n    return IsActive();\n}\n\n\/*!\n    Transforms Symbian device name, address and service classes to QBluetootDeviceInfo.\n*\/\nQBluetoothDeviceInfo BluetoothLinkManagerDeviceDiscoverer::currentDeviceDataToQBluetoothDeviceInfo() const\n{\n    \/\/ extract device information from results and map them to QBluetoothDeviceInfo\n#ifdef EIR_SUPPORTED\n    TBluetoothNameRecordWrapper eir(m_entry());\n    TInt bufferlength = 0;\n    TInt err = KErrNone;\n    QString deviceName;\n    bufferlength = eir.GetDeviceNameLength();\n\n    if (bufferlength > 0) {\n        TBool nameComplete;\n        HBufC *deviceNameBuffer = 0;\n        TRAP(err,deviceNameBuffer = HBufC::NewLC(bufferlength));\n        if(err)\n            deviceName = QString();\n        else\n            {\n            TPtr ptr = deviceNameBuffer->Des();\n            err = eir.GetDeviceName(ptr,nameComplete);\n            if (err == KErrNone \/*&& nameComplete*\/)\n                {\n                if(!nameComplete)\n                    qWarning() << \"device name incomplete\";\n                \/\/ isn't it better to get an incomplete name than getting nothing?\n                deviceName = QString::fromUtf16(ptr.Ptr(), ptr.Length()).toUpper();\n                }\n            else\n                deviceName = QString();\n            CleanupStack::PopAndDestroy(deviceNameBuffer);\n            }\n    }\n\n    QList<QBluetoothUuid> serviceUidList;\n    RExtendedInquiryResponseUUIDContainer uuidContainer;\n    QBluetoothDeviceInfo::DataCompleteness completenes = QBluetoothDeviceInfo::DataUnavailable;\n\n    if (eir.GetServiceClassUuids(uuidContainer) == KErrNone) {\n        TInt uuidCount = uuidContainer.UUIDs().Count();\n        if (uuidCount > 0) {\n            for (int i = 0; i < uuidCount; ++i) {\n                TPtrC8 shortFormUUid(uuidContainer.UUIDs()[i].ShortestForm());\n                if (shortFormUUid.Size() == 2) {\n                    QBluetoothUuid uuid(ntohs(*reinterpret_cast<const quint16 *>(shortFormUUid.Ptr())));\n                    if (uuidContainer.GetCompleteness(RExtendedInquiryResponseUUIDContainer::EUUID16))\n                        completenes = QBluetoothDeviceInfo::DataComplete;\n                    else\n                        completenes = QBluetoothDeviceInfo::DataIncomplete;\n                    serviceUidList.append(uuid);\n                }else if (shortFormUUid.Size() == 4) {\n                    QBluetoothUuid uuid(ntohl(*reinterpret_cast<const quint32 *>(shortFormUUid.Ptr())));\n                    if (uuidContainer.GetCompleteness(RExtendedInquiryResponseUUIDContainer::EUUID32))\n                        completenes = QBluetoothDeviceInfo::DataComplete;\n                    else\n                        completenes = QBluetoothDeviceInfo::DataIncomplete;\n                    serviceUidList.append(uuid);\n                }else if (shortFormUUid.Size() == 16) {\n                    QBluetoothUuid uuid(*reinterpret_cast<const quint128 *>(shortFormUUid.Ptr()));\n                    if (uuidContainer.GetCompleteness(RExtendedInquiryResponseUUIDContainer::EUUID128))\n                        completenes = QBluetoothDeviceInfo::DataComplete;\n                    else\n                        completenes = QBluetoothDeviceInfo::DataIncomplete;\n                    serviceUidList.append(uuid);\n                }\n            }\n        }\n    }\n    uuidContainer.Close();\n\n    bufferlength = 0;\n    QByteArray manufacturerData;\n    bufferlength = eir.GetVendorSpecificDataLength();\n\n    if (bufferlength > 0) {\n        HBufC8 *msd = 0;\n        TRAP(err,HBufC8::NewLC(bufferlength));\n        if(err)\n            manufacturerData = QByteArray();\n        else\n            {\n            TPtr8 temp = msd->Des();\n            if (eir.GetVendorSpecificData(temp))\n                manufacturerData = s60Desc8ToQByteArray(temp);\n            else\n                manufacturerData = QByteArray();\n            CleanupStack::PopAndDestroy(msd);\n            }\n    }\n\n    \/\/ Get transmission power level\n    TInt8 transmissionPowerLevel = 0;\n    eir.GetTxPowerLevel(transmissionPowerLevel);\n\n    \/\/ unique address of the device\n    const TBTDevAddr symbianDeviceAddress = static_cast<TBTSockAddr> (m_entry().iAddr).BTAddr();\n    QBluetoothAddress bluetoothAddress = qTBTDevAddrToQBluetoothAddress(symbianDeviceAddress);\n\n    \/\/ format symbian major\/minor numbers\n    quint32 deviceClass = qTPackSymbianDeviceClass(m_addr);\n\n    QBluetoothDeviceInfo deviceInfo(bluetoothAddress, deviceName, deviceClass);\n\n    deviceInfo.setRssi(transmissionPowerLevel);\n    deviceInfo.setServiceUuids(serviceUidList, completenes);\n    deviceInfo.setManufacturerSpecificData(manufacturerData);\n#else\n    \/\/ device name\n    THostName symbianDeviceName = m_entry().iName;\n    QString deviceName = QString::fromUtf16(symbianDeviceName.Ptr(), symbianDeviceName.Length()).toUpper();\n\n    \/\/ unique address of the device\n    const TBTDevAddr symbianDeviceAddress = static_cast<TBTSockAddr> (m_entry().iAddr).BTAddr();\n    QBluetoothAddress bluetoothAddress = qTBTDevAddrToQBluetoothAddress(symbianDeviceAddress);\n\n    \/\/ format symbian major\/minor numbers\n    quint32 deviceClass = qTPackSymbianDeviceClass(m_addr);\n\n    QBluetoothDeviceInfo deviceInfo(bluetoothAddress, deviceName, deviceClass);\n\n    if (m_addr.Rssi())\n        deviceInfo.setRssi(m_addr.Rssi());\n#endif\n    if (!deviceInfo.rssi())\n        deviceInfo.setRssi(1);\n\n    deviceInfo.setCached(false);  \/\/TODO cache support missing from devicediscovery API\n    \/\/qDebug()<< \"Discovered device: name=\"<< deviceName <<\", address=\" << bluetoothAddress.toString() <<\", class=\" << deviceClass;\n    return deviceInfo;\n}\n\nvoid BluetoothLinkManagerDeviceDiscoverer::setError(int errorCode)\n{\n    qDebug() << __PRETTY_FUNCTION__ << \"errorCode=\" << errorCode;\n    QString errorString;\n    switch (errorCode) {\n        case KLinkManagerErrBase:\n            errorString.append(\"Link manager base error value or Insufficient baseband resources error value\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n        case KErrProxyWriteNotAvailable:\n            errorString.append(\"Proxy write not available error value\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n        case KErrReflexiveBluetoothLink:\n            errorString.append(\"Reflexive BT link error value\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n        case KErrPendingPhysicalLink:\n            errorString.append(\"Physical link connection already pending when trying to connect the physical link\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n        case KErrNotReady:\n            errorString.append(\"KErrNotReady\");\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n        case KErrCancel:\n            errorString.append(\"KErrCancel\");\n            qDebug() << \"emitting canceled\";\n            emit canceled();\n            break;\n        case KErrNone:\n            \/\/ do nothing\n            break;\n        default:\n            errorString = QString(\"Symbian errorCode = %1\").arg(errorCode);\n            emit linkManagerError(QBluetoothDeviceDiscoveryAgent::UnknownError, errorString);\n            break;\n    }\n}\n#include \"moc_bluetoothlinkmanagerdevicediscoverer.cpp\"\n\nQTM_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"types\/json_unmarshal_error.hpp\"\n#include <unordered_set>\n\nnamespace krbn {\nnamespace manipulator {\nnamespace modifier_definition {\nenum class modifier {\n  any,\n  caps_lock,\n  command,\n  control,\n  fn,\n  left_command,\n  left_control,\n  left_option,\n  left_shift,\n  option,\n  right_command,\n  right_control,\n  right_option,\n  right_shift,\n  shift,\n  end_,\n};\n\ninline void to_json(nlohmann::json& json, const modifier& value) {\n  switch (value) {\n    case modifier::any:\n      json = \"any\";\n      break;\n    case modifier::caps_lock:\n      json = \"caps_lock\";\n      break;\n    case modifier::command:\n      json = \"command\";\n      break;\n    case modifier::control:\n      json = \"control\";\n      break;\n    case modifier::fn:\n      json = \"fn\";\n      break;\n    case modifier::left_command:\n      json = \"left_command\";\n      break;\n    case modifier::left_control:\n      json = \"left_control\";\n      break;\n    case modifier::left_option:\n      json = \"left_option\";\n      break;\n    case modifier::left_shift:\n      json = \"left_shift\";\n      break;\n    case modifier::option:\n      json = \"option\";\n      break;\n    case modifier::right_command:\n      json = \"right_command\";\n      break;\n    case modifier::right_control:\n      json = \"right_control\";\n      break;\n    case modifier::right_option:\n      json = \"right_option\";\n      break;\n    case modifier::right_shift:\n      json = \"right_shift\";\n      break;\n    case modifier::shift:\n      json = \"shift\";\n      break;\n    case modifier::end_:\n      json = \"end_\";\n      break;\n    default:\n      json = nullptr;\n  }\n}\n\ninline void from_json(const nlohmann::json& json, modifier& value) {\n  if (!json.is_string()) {\n    throw json_unmarshal_error(fmt::format(\"modifier must be string, but is `{0}`\", json.dump()));\n  }\n\n  auto name = json.get<std::string>();\n  if (name == \"any\") {\n    value = modifier::any;\n  } else if (name == \"caps_lock\") {\n    value = modifier::caps_lock;\n  } else if (name == \"command\") {\n    value = modifier::command;\n  } else if (name == \"control\") {\n    value = modifier::control;\n  } else if (name == \"fn\") {\n    value = modifier::fn;\n  } else if (name == \"left_command\") {\n    value = modifier::left_command;\n  } else if (name == \"left_control\") {\n    value = modifier::left_control;\n  } else if (name == \"left_option\") {\n    value = modifier::left_option;\n  } else if (name == \"left_shift\") {\n    value = modifier::left_shift;\n  } else if (name == \"option\") {\n    value = modifier::option;\n  } else if (name == \"right_command\") {\n    value = modifier::right_command;\n  } else if (name == \"right_control\") {\n    value = modifier::right_control;\n  } else if (name == \"right_option\") {\n    value = modifier::right_option;\n  } else if (name == \"right_shift\") {\n    value = modifier::right_shift;\n  } else if (name == \"shift\") {\n    value = modifier::shift;\n  } else if (name == \"end_\") {\n    value = modifier::end_;\n  } else {\n    throw json_unmarshal_error(fmt::format(\"unknown modifier: `{0}`\", name));\n  }\n}\n\ninline std::ostream& operator<<(std::ostream& stream, const modifier& value) {\n  return stream << nlohmann::json(value);\n}\n\ntemplate <template <class T, class A> class container>\ninline std::ostream& operator<<(std::ostream& stream, const container<modifier, std::allocator<modifier>>& values) {\n  return stream << nlohmann::json(values);\n}\n\ntemplate <template <class T, class H, class K, class A> class container>\ninline std::ostream& operator<<(std::ostream& stream,\n                                const container<modifier,\n                                                std::hash<modifier>,\n                                                std::equal_to<modifier>,\n                                                std::allocator<modifier>>& values) {\n  return stream << nlohmann::json(values);\n}\n} \/\/ namespace modifier_definition\n} \/\/ namespace manipulator\n} \/\/ namespace krbn\n<commit_msg>update #include<commit_after>#pragma once\n\n#include \"types\/json_unmarshal_error.hpp\"\n#include <nlohmann\/json.hpp>\n#include <unordered_set>\n\nnamespace krbn {\nnamespace manipulator {\nnamespace modifier_definition {\nenum class modifier {\n  any,\n  caps_lock,\n  command,\n  control,\n  fn,\n  left_command,\n  left_control,\n  left_option,\n  left_shift,\n  option,\n  right_command,\n  right_control,\n  right_option,\n  right_shift,\n  shift,\n  end_,\n};\n\ninline void to_json(nlohmann::json& json, const modifier& value) {\n  switch (value) {\n    case modifier::any:\n      json = \"any\";\n      break;\n    case modifier::caps_lock:\n      json = \"caps_lock\";\n      break;\n    case modifier::command:\n      json = \"command\";\n      break;\n    case modifier::control:\n      json = \"control\";\n      break;\n    case modifier::fn:\n      json = \"fn\";\n      break;\n    case modifier::left_command:\n      json = \"left_command\";\n      break;\n    case modifier::left_control:\n      json = \"left_control\";\n      break;\n    case modifier::left_option:\n      json = \"left_option\";\n      break;\n    case modifier::left_shift:\n      json = \"left_shift\";\n      break;\n    case modifier::option:\n      json = \"option\";\n      break;\n    case modifier::right_command:\n      json = \"right_command\";\n      break;\n    case modifier::right_control:\n      json = \"right_control\";\n      break;\n    case modifier::right_option:\n      json = \"right_option\";\n      break;\n    case modifier::right_shift:\n      json = \"right_shift\";\n      break;\n    case modifier::shift:\n      json = \"shift\";\n      break;\n    case modifier::end_:\n      json = \"end_\";\n      break;\n    default:\n      json = nullptr;\n  }\n}\n\ninline void from_json(const nlohmann::json& json, modifier& value) {\n  if (!json.is_string()) {\n    throw json_unmarshal_error(fmt::format(\"modifier must be string, but is `{0}`\", json.dump()));\n  }\n\n  auto name = json.get<std::string>();\n  if (name == \"any\") {\n    value = modifier::any;\n  } else if (name == \"caps_lock\") {\n    value = modifier::caps_lock;\n  } else if (name == \"command\") {\n    value = modifier::command;\n  } else if (name == \"control\") {\n    value = modifier::control;\n  } else if (name == \"fn\") {\n    value = modifier::fn;\n  } else if (name == \"left_command\") {\n    value = modifier::left_command;\n  } else if (name == \"left_control\") {\n    value = modifier::left_control;\n  } else if (name == \"left_option\") {\n    value = modifier::left_option;\n  } else if (name == \"left_shift\") {\n    value = modifier::left_shift;\n  } else if (name == \"option\") {\n    value = modifier::option;\n  } else if (name == \"right_command\") {\n    value = modifier::right_command;\n  } else if (name == \"right_control\") {\n    value = modifier::right_control;\n  } else if (name == \"right_option\") {\n    value = modifier::right_option;\n  } else if (name == \"right_shift\") {\n    value = modifier::right_shift;\n  } else if (name == \"shift\") {\n    value = modifier::shift;\n  } else if (name == \"end_\") {\n    value = modifier::end_;\n  } else {\n    throw json_unmarshal_error(fmt::format(\"unknown modifier: `{0}`\", name));\n  }\n}\n\ninline std::ostream& operator<<(std::ostream& stream, const modifier& value) {\n  return stream << nlohmann::json(value);\n}\n\ntemplate <template <class T, class A> class container>\ninline std::ostream& operator<<(std::ostream& stream, const container<modifier, std::allocator<modifier>>& values) {\n  return stream << nlohmann::json(values);\n}\n\ntemplate <template <class T, class H, class K, class A> class container>\ninline std::ostream& operator<<(std::ostream& stream,\n                                const container<modifier,\n                                                std::hash<modifier>,\n                                                std::equal_to<modifier>,\n                                                std::allocator<modifier>>& values) {\n  return stream << nlohmann::json(values);\n}\n} \/\/ namespace modifier_definition\n} \/\/ namespace manipulator\n} \/\/ namespace krbn\n<|endoftext|>"}
{"text":"<commit_before>#include \"SymbianCallInitiator.h\"\n#include \"SymbianCallInitiatorPrivate.h\"\n#include \"SymbianCallObserverPrivate.h\"\n#include \"SymbianDTMFPrivate.h\"\n\nSymbianCallInitiator::SymbianCallInitiator (QObject *parent)\n: CalloutInitiator(parent)\n, dialer (NULL)\n, observer (NULL)\n, dtmfSender (NULL)\n{\n    iTelephony = CTelephony::NewL();\n    dtmfSender = new SymbianDTMFPrivate (this);\n    if (NULL != iTelephony) {\n        delete iTelephony;\n    }\n}\/\/SymbianCallInitiator::SymbianCallInitiator\n\nSymbianCallInitiator::~SymbianCallInitiator()\n{\n    if (NULL != observer) {\n        delete observer;\n    }\n    if (NULL != dialer) {\n        delete dialer;\n    }\n    if (NULL != dtmfSender) {\n        delete dtmfSender;\n    }\n}\/\/SymbianCallInitiator::~SymbianCallInitiator\n\nQString\nSymbianCallInitiator::name ()\n{\n    return \"Phone\";\n}\/\/SymbianCallInitiator::name\n\nQString\nSymbianCallInitiator::selfNumber ()\n{\n    return \"This phone's MSISDN\";\n}\/\/SymbianCallInitiator::selfNumber\n\nbool\nSymbianCallInitiator::isValid ()\n{\n    return true;\n}\/\/SymbianCallInitiator::isValid\n\nvoid\nSymbianCallInitiator::initiateCall (const QString &strDestination,\n                                    void *ctx \/*= NULL*\/)\n{\n    bool bOk = false;\n    m_Context = ctx;\n    do { \/\/ Begin cleanup block (not a loop)\n        if (NULL != dialer) {\n            qWarning (\"Call in progress. Ask again later.\");\n            break;  \/\/ false\n        }\n        if (NULL != observer) {\n            qWarning (\"observer was still alive. WTF?\");\n            delete observer;\n        }\n        observer = SymbianCallObserverPrivate::NewL (this);\n\n        QMutexLocker locker(&mutex);\n        strObservedNumber = strDestination;\n\n        dialer = SymbianCallInitiatorPrivate::NewL (this, strDestination);\n        if (NULL == dialer) {\n            qWarning (\"Could not dial out.\");\n            break;  \/\/ false\n        }\n        bOk = true;\n    } while (0); \/\/ End cleanup block (not a loop)\n    if (!bOk) {\n        emit callInitiated (false, m_Context);\n    }\n}\/\/SymbianCallInitiator::initiateCall\n\nvoid\nSymbianCallInitiator::callDone (SymbianCallInitiatorPrivate *self, int status)\n{\n    delete self;\n\n    QMutexLocker locker(&mutex);\n    strObservedNumber.clear ();\n\n    if (dialer == self) {\n        dialer = NULL;\n\n        if (NULL != observer) {\n            delete observer;\n            observer = NULL;\n        }\n    } else {\n        qWarning (\"Dialer does not match!!!\");\n    }\n\n    emit callInitiated ((status == KErrNone), m_Context);\n}\/\/SymbianCallInitiator::callDone\n\nvoid\nSymbianCallInitiator::onCallInitiated ()\n{\n    bool bObserving = false;\n    {\n        QMutexLocker locker(&mutex);\n        if (!strObservedNumber.isEmpty ()) {\n            bObserving = true;\n        }\n    }\n\n    if (bObserving) {\n        emit callDialed();\n    }\n}\/\/SymbianCallInitiator::onCallInitiated\n\nbool\nSymbianCallInitiator::sendDTMF (const QString &strTones)\n{\n    arrTones.clear ();\n    arrTones = strTones.split ('p');\n\n    nextDtmf ();\n    return true;\n}\/\/SymbianCallInitiator::sendDTMF\n\nvoid\nSymbianCallInitiator::onDtmfSent (SymbianDTMFPrivate *self, bool bSuccess)\n{\n    qDebug() << \"Send DTMF \" << (bSuccess ? \"suceeded\" : \"failed\");\n    QTimer::singleShot (1000, this, SLOT(nextDtmf ()));\n}\/\/SymbianCallInitiator::onDtmfSent\n\nvoid\nSymbianCallInitiator::nextDtmf()\n{\n    if (arrTones.isEmpty ()) {\n        qDebug (\"No more tones\");\n        return;\n    }\n\n    QString strTones = arrTones.first ();\n    arrTones.pop_front ();\n\n    if (strTones.isEmpty ()) {\n        qDebug (\"Blank tone\");\n        QTimer::singleShot (1000, this, SLOT(nextDtmf ()));\n    } else {\n        qDebug () << \"Current tone =\" << strTones;\n\n        dtmfSender->sendDTMF (strTones);\n    }\n}\/\/SymbianCallInitiator::nextDtmf\n<commit_msg>Bug: CTelephony object was freed immediately after being allocated.<commit_after>#include \"SymbianCallInitiator.h\"\n#include \"SymbianCallInitiatorPrivate.h\"\n#include \"SymbianCallObserverPrivate.h\"\n#include \"SymbianDTMFPrivate.h\"\n\nSymbianCallInitiator::SymbianCallInitiator (QObject *parent)\n: CalloutInitiator(parent)\n, dialer (NULL)\n, observer (NULL)\n, dtmfSender (NULL)\n{\n    iTelephony = CTelephony::NewL();\n    dtmfSender = new SymbianDTMFPrivate (this);\n}\/\/SymbianCallInitiator::SymbianCallInitiator\n\nSymbianCallInitiator::~SymbianCallInitiator()\n{\n    if (NULL != observer) {\n        delete observer;\n    }\n    if (NULL != dialer) {\n        delete dialer;\n    }\n    if (NULL != dtmfSender) {\n        delete dtmfSender;\n    }\n    if (NULL != iTelephony) {\n        delete iTelephony;\n    }\n}\/\/SymbianCallInitiator::~SymbianCallInitiator\n\nQString\nSymbianCallInitiator::name ()\n{\n    return \"Phone\";\n}\/\/SymbianCallInitiator::name\n\nQString\nSymbianCallInitiator::selfNumber ()\n{\n    return \"This phone's MSISDN\";\n}\/\/SymbianCallInitiator::selfNumber\n\nbool\nSymbianCallInitiator::isValid ()\n{\n    return true;\n}\/\/SymbianCallInitiator::isValid\n\nvoid\nSymbianCallInitiator::initiateCall (const QString &strDestination,\n                                    void *ctx \/*= NULL*\/)\n{\n    bool bOk = false;\n    m_Context = ctx;\n    do { \/\/ Begin cleanup block (not a loop)\n        if (NULL != dialer) {\n            qWarning (\"Call in progress. Ask again later.\");\n            break;  \/\/ false\n        }\n        if (NULL != observer) {\n            qWarning (\"observer was still alive. WTF?\");\n            delete observer;\n        }\n        observer = SymbianCallObserverPrivate::NewL (this);\n\n        QMutexLocker locker(&mutex);\n        strObservedNumber = strDestination;\n\n        dialer = SymbianCallInitiatorPrivate::NewL (this, strDestination);\n        if (NULL == dialer) {\n            delete observer;\n            observer = NULL;\n            qWarning (\"Could not dial out.\");\n            break;  \/\/ false\n        }\n        bOk = true;\n    } while (0); \/\/ End cleanup block (not a loop)\n    if (!bOk) {\n        emit callInitiated (false, m_Context);\n    }\n}\/\/SymbianCallInitiator::initiateCall\n\nvoid\nSymbianCallInitiator::callDone (SymbianCallInitiatorPrivate *self, int status)\n{\n    delete self;\n\n    QMutexLocker locker(&mutex);\n    strObservedNumber.clear ();\n\n    if (dialer == self) {\n        dialer = NULL;\n\n        if (NULL != observer) {\n            delete observer;\n            observer = NULL;\n        }\n    } else {\n        qWarning (\"Dialer does not match!!!\");\n    }\n\n    emit callInitiated ((status == KErrNone), m_Context);\n}\/\/SymbianCallInitiator::callDone\n\nvoid\nSymbianCallInitiator::onCallInitiated ()\n{\n    bool bObserving = false;\n    {\n        QMutexLocker locker(&mutex);\n        if (!strObservedNumber.isEmpty ()) {\n            bObserving = true;\n        }\n    }\n\n    if (bObserving) {\n        emit callDialed();\n    }\n}\/\/SymbianCallInitiator::onCallInitiated\n\nbool\nSymbianCallInitiator::sendDTMF (const QString &strTones)\n{\n    arrTones.clear ();\n    arrTones = strTones.split ('p');\n\n    nextDtmf ();\n    return true;\n}\/\/SymbianCallInitiator::sendDTMF\n\nvoid\nSymbianCallInitiator::onDtmfSent (SymbianDTMFPrivate *self, bool bSuccess)\n{\n    qDebug() << \"Send DTMF \" << (bSuccess ? \"suceeded\" : \"failed\");\n    QTimer::singleShot (1000, this, SLOT(nextDtmf ()));\n}\/\/SymbianCallInitiator::onDtmfSent\n\nvoid\nSymbianCallInitiator::nextDtmf()\n{\n    if (arrTones.isEmpty ()) {\n        qDebug (\"No more tones\");\n        return;\n    }\n\n    QString strTones = arrTones.first ();\n    arrTones.pop_front ();\n\n    if (strTones.isEmpty ()) {\n        qDebug (\"Blank tone\");\n        QTimer::singleShot (1000, this, SLOT(nextDtmf ()));\n    } else {\n        qDebug () << \"Current tone =\" << strTones;\n\n        dtmfSender->sendDTMF (strTones);\n    }\n}\/\/SymbianCallInitiator::nextDtmf\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#if !defined(XOBJECTFACTORY_HEADER_GUARD_1357924680)\n#define XOBJECTFACTORY_HEADER_GUARD_1357924680\n\n\n\n\/\/ Base include file.  Must be first.\n#include <XPath\/XPathDefinitions.hpp>\n\n\n\n#include <algorithm>\n#include <cassert>\n#include <set>\n\n\n\n#include <XPath\/XObject.hpp>\n\n\n\nclass XalanNode;\nclass MutableNodeRefList;\nclass NodeRefListBase;\nclass ResultTreeFragBase;\nclass XObject;\n\n\n\n\/**\n * This class handles the creation of XObjects and manages their lifetime.\n *\/\nclass XALAN_XPATH_EXPORT XObjectFactory\n{\npublic:\n\n\tXObjectFactory();\n\n\tvirtual\n\t~XObjectFactory();\n\n\n\t\/**\n\t * Return an XObject to the factory.\n\t * \n\t * @param theXObject The XObject to be returned\n\t * @return true if the object belongs to the factory, false if not.\n\t *\/\n\tbool\n\treturnObject(const XObject*\t\ttheXObject)\n\t{\n\t\treturn doReturnObject(theXObject);\n\t}\n\n\t\/**\n\t * Reset the instance.  This invalidates all existing instances created\n\t * with this XObjectFactory.\n\t *\/\n\tvirtual void\n\treset() = 0;\n\n\t\/**\n\t * Clone an XObject instance, and hold in the factory.\n\t *\n\t * @param theXObject the instance to clone\n\t * @return a clone of the instance.\n\t *\/\n\tvirtual XObject*\n\tclone(const XObject&\ttheXObject) = 0;\n\n\t\/**\n\t * Create a boolean XObject from a boolean value.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize true to use static objects rather than creating new\n\t *                  instances, default true\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateBoolean(\n\t\t\tbool\ttheValue,\n\t\t\tbool\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a node set XObject from a node list.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNodeSet(\n\t\t\tconst NodeRefListBase&\ttheValue,\n\t\t\tbool\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a node set XObject from a mutable node list.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNodeSet(\n\t\t\tconst MutableNodeRefList&\ttheValue,\n\t\t\tbool\t\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a node set XObject from a DOM node.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNodeSet(\n\t\t\tXalanNode&\ttheValue,\n\t\t\tbool\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a null XObject.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize true to use static objects rather than creating new\n\t *                  instances, default true\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNull(bool\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a numeric XObject from a number.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNumber(\n\t\t\tdouble\ttheValue,\n\t\t\tbool\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a string XObject from a string.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateString(\n\t\t\tconst XalanDOMString&\ttheValue,\n\t\t\tbool\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create an \"unknown\" XObject from a string.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateUnknown(\n\t\t\tconst XalanDOMString&\ttheValue,\n\t\t\tbool\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a result tree fragment XObject from a result tree fragment.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateResultTreeFrag(\n\t\t\tconst ResultTreeFragBase&\ttheValue,\n\t\t\tbool\t\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a span XObject from a node list.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateSpan(\n\t\t\tconst NodeRefListBase&\ttheValue,\n\t\t\tbool\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a span XObject from a mutable node list.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateSpan(\n\t\t\tconst MutableNodeRefList&\ttheValue,\n\t\t\tbool\t\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a span XObject from a DOM node.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateSpan(\n\t\t\tXalanNode&\ttheValue,\n\t\t\tbool\t\tfOptimize = true) = 0;\n\n\t\/**\n\t *\n\t * A public functor for use with stl algorithms.\n\t *\n\t *\/\n#if defined(XALAN_NO_NAMESPACES)\n\tstruct DeleteXObjectFunctor : public unary_function<const XObject*, void>\n#else\n\tstruct DeleteXObjectFunctor : public std::unary_function<const XObject*, void>\n#endif\n\t{\n\tpublic:\n\n\t\tDeleteXObjectFunctor(XObjectFactory&\ttheFactoryInstance) :\n\t\t\tm_factoryInstance(theFactoryInstance)\n\t\t{\n\t\t}\n\n\t\tresult_type\n\t\toperator()(argument_type\ttheXObject) const\n\t\t{\n\t\t\tm_factoryInstance.returnObject(theXObject);\n\t\t}\n\n\tprivate:\n\n\t\tXObjectFactory&\t\tm_factoryInstance;\n\t};\n\nprotected:\n\n\t\/**\n\t * Delete a FactoryObject instance.\n\t *\n\t * @param theXObject the XObject instance to delete.\n\t *\/\n\tvoid\n\tdeleteObject(const XObject*\t\ttheXObject) const\n\t{\n\t\tdelete theXObject;\n\t}\n\n\t\/**\n\t * Return an XObject to the factory.\n\t * \n\t * @param theXObject XObject to be returned\n\t * @param fInReset true when called during reset().\n\t *\/\n\n\tvirtual bool\n\tdoReturnObject(\n\t\t\tconst XObject*\ttheXObject,\n\t\t\tbool\t\t\tfInReset = false) = 0;\n\n\t\/**\n\t *\n\t * A functor for use with stl algorithms.\n\t *\n\t *\/\n#if defined(XALAN_NO_NAMESPACES)\n\tstruct ProtectedDeleteXObjectFunctor : public unary_function<const XObject*, void>\n#else\n\tstruct ProtectedDeleteXObjectFunctor : public std::unary_function<const XObject*, void>\n#endif\n\t{\n\tpublic:\n\n\t\tProtectedDeleteXObjectFunctor(\n\t\t\tXObjectFactory&\t\ttheFactoryInstance,\n\t\t\tbool\t\t\t\tfInReset) :\n\t\t\tm_factoryInstance(theFactoryInstance),\n\t\t\tm_fInReset(fInReset)\n\t\t{\n\t\t}\n\n\t\tresult_type\n\t\toperator()(argument_type\ttheXObject) const\n\t\t{\n\t\t\tm_factoryInstance.doReturnObject(theXObject,\n\t\t\t\t\t\t\t\t\t\t\t m_fInReset);\n\t\t}\n\n\tprivate:\n\n\t\tXObjectFactory&\t\tm_factoryInstance;\n\n\t\tconst bool\t\t\tm_fInReset;\n\t};\n\n\tfriend struct ProtectedDeleteXObjectFunctor;\n\nprivate:\n\n\t\/\/ Not implemented...\n\tXObjectFactory(const XObjectFactory&);\n\n\tXObjectFactory&\n\toperator=(const XObjectFactory&);\n\n\tbool\n\toperator==(const XObjectFactory&) const;\n};\n\n\n\n\/**\n * Manages the lifetime of an XObject instance.\n *\/\nclass XObjectGuard\n{\npublic:\n\n\t\/**\n\t * Construct an XObjectGuard instance from a factory object and an XObject.\n\t * \n\t * @param theFactory object that manages lifetime of XObjects\n\t * @param theXObject pointer to XObject managed\n\t *\/\n\tXObjectGuard(\n\t\t\tXObjectFactory&\t\ttheFactory,\n\t\t\tXObject*\t\t\ttheXObject) :\n\t\tm_factory(&theFactory),\n\t\tm_object(theXObject)\n\t{\n\t}\n\n\t\/\/ Note that copy construction transfers ownership, just\n\t\/\/ as std::auto_ptr.\n\tXObjectGuard(XObjectGuard&\ttheRHS)\n\t{\n\t\t\/\/ Release the current object...\n\t\trelease();\n\n\t\t\/\/ Copy the factory and object pointers...\n\t\tm_factory = theRHS.m_factory;\n\t\tm_object = theRHS.m_object;\n\n\t\t\/\/ The source object no longer points to\n\t\t\/\/ the object...\n\t\ttheRHS.m_factory = 0;\n\t\ttheRHS.m_object = 0;\n\t}\n\n\t~XObjectGuard()\n\t{\n\t\treset();\n\t}\n\n\t\/**\n\t * Retrieve the object pointer (must not be null)\n\t * \n\t * @return pointer to XObject\n\t *\/\n\tXObject*\n\toperator->() const\n\t{\n\t\tassert(m_object != 0);\n\n\t\treturn m_object;\n\t}\n\n\t\/**\n\t * Retrieve the object pointer (may be null)\n\t * \n\t * @return pointer to XObject\n\t *\/\n\tXObject*\n\tget() const\n\t{\n\t\treturn m_object;\n\t}\n\n\t\/**\n\t * Return the referenced object to the factory and set pointers to null.\n\t *\/\n\tvoid\n\treset()\n\t{\n\t\tif (m_object != 0)\n\t\t{\n\t\t\tassert(m_factory != 0);\n\n\t\t\tm_factory->returnObject(m_object);\n\n\t\t\tm_object = 0;\n\t\t}\n\n\t\tm_factory = 0;\n\t}\n\n\t\/**\n\t * Transfers ownership of XObject to caller\n\t * \n\t * @return pointer to XObject\n\t *\/\n\tXObject*\n\trelease()\n\t{\n\t\tXObject* const\ttheTemp = m_object;\n\n\t\tm_object = 0;\n\n\t\treturn theTemp;\n\t}\n\nprivate:\n\n\tXObjectGuard&\n\toperator=(const XObjectGuard&);\n\n\tbool\n\toperator==(const XObjectGuard&) const;\n\n\n\t\/\/ Data members...\n\tXObjectFactory*\t\tm_factory;\n    XObject*\t\t\tm_object;\n};\n\n\n\n#endif\t\/\/ XOBJECTFACTORY_HEADER_GUARD_1357924680\n<commit_msg>Enhancements to XObjectGuard.<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#if !defined(XOBJECTFACTORY_HEADER_GUARD_1357924680)\n#define XOBJECTFACTORY_HEADER_GUARD_1357924680\n\n\n\n\/\/ Base include file.  Must be first.\n#include <XPath\/XPathDefinitions.hpp>\n\n\n\n#include <algorithm>\n#include <cassert>\n#include <set>\n\n\n\n#include <XPath\/XObject.hpp>\n\n\n\nclass XalanNode;\nclass MutableNodeRefList;\nclass NodeRefListBase;\nclass ResultTreeFragBase;\nclass XObject;\n\n\n\n\/**\n * This class handles the creation of XObjects and manages their lifetime.\n *\/\nclass XALAN_XPATH_EXPORT XObjectFactory\n{\npublic:\n\n\tXObjectFactory();\n\n\tvirtual\n\t~XObjectFactory();\n\n\n\t\/**\n\t * Return an XObject to the factory.\n\t * \n\t * @param theXObject The XObject to be returned\n\t * @return true if the object belongs to the factory, false if not.\n\t *\/\n\tbool\n\treturnObject(const XObject*\t\ttheXObject)\n\t{\n\t\treturn doReturnObject(theXObject);\n\t}\n\n\t\/**\n\t * Reset the instance.  This invalidates all existing instances created\n\t * with this XObjectFactory.\n\t *\/\n\tvirtual void\n\treset() = 0;\n\n\t\/**\n\t * Clone an XObject instance, and hold in the factory.\n\t *\n\t * @param theXObject the instance to clone\n\t * @return a clone of the instance.\n\t *\/\n\tvirtual XObject*\n\tclone(const XObject&\ttheXObject) = 0;\n\n\t\/**\n\t * Create a boolean XObject from a boolean value.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize true to use static objects rather than creating new\n\t *                  instances, default true\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateBoolean(\n\t\t\tbool\ttheValue,\n\t\t\tbool\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a node set XObject from a node list.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNodeSet(\n\t\t\tconst NodeRefListBase&\ttheValue,\n\t\t\tbool\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a node set XObject from a mutable node list.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNodeSet(\n\t\t\tconst MutableNodeRefList&\ttheValue,\n\t\t\tbool\t\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a node set XObject from a DOM node.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNodeSet(\n\t\t\tXalanNode&\ttheValue,\n\t\t\tbool\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a null XObject.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize true to use static objects rather than creating new\n\t *                  instances, default true\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNull(bool\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a numeric XObject from a number.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateNumber(\n\t\t\tdouble\ttheValue,\n\t\t\tbool\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a string XObject from a string.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateString(\n\t\t\tconst XalanDOMString&\ttheValue,\n\t\t\tbool\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create an \"unknown\" XObject from a string.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateUnknown(\n\t\t\tconst XalanDOMString&\ttheValue,\n\t\t\tbool\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a result tree fragment XObject from a result tree fragment.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateResultTreeFrag(\n\t\t\tconst ResultTreeFragBase&\ttheValue,\n\t\t\tbool\t\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a span XObject from a node list.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateSpan(\n\t\t\tconst NodeRefListBase&\ttheValue,\n\t\t\tbool\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a span XObject from a mutable node list.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateSpan(\n\t\t\tconst MutableNodeRefList&\ttheValue,\n\t\t\tbool\t\t\t\t\t\tfOptimize = true) = 0;\n\n\t\/**\n\t * Create a span XObject from a DOM node.\n\t * \n\t * @param theValue  value used to create object\n\t * @param fOptimize not used\n\t * @return pointer to new object\n\t *\/\n\tvirtual XObject*\n\tcreateSpan(\n\t\t\tXalanNode&\ttheValue,\n\t\t\tbool\t\tfOptimize = true) = 0;\n\n\t\/**\n\t *\n\t * A public functor for use with stl algorithms.\n\t *\n\t *\/\n#if defined(XALAN_NO_NAMESPACES)\n\tstruct DeleteXObjectFunctor : public unary_function<const XObject*, void>\n#else\n\tstruct DeleteXObjectFunctor : public std::unary_function<const XObject*, void>\n#endif\n\t{\n\tpublic:\n\n\t\tDeleteXObjectFunctor(XObjectFactory&\ttheFactoryInstance) :\n\t\t\tm_factoryInstance(theFactoryInstance)\n\t\t{\n\t\t}\n\n\t\tresult_type\n\t\toperator()(argument_type\ttheXObject) const\n\t\t{\n\t\t\tm_factoryInstance.returnObject(theXObject);\n\t\t}\n\n\tprivate:\n\n\t\tXObjectFactory&\t\tm_factoryInstance;\n\t};\n\nprotected:\n\n\t\/**\n\t * Delete a FactoryObject instance.\n\t *\n\t * @param theXObject the XObject instance to delete.\n\t *\/\n\tvoid\n\tdeleteObject(const XObject*\t\ttheXObject) const\n\t{\n\t\tdelete theXObject;\n\t}\n\n\t\/**\n\t * Return an XObject to the factory.\n\t * \n\t * @param theXObject XObject to be returned\n\t * @param fInReset true when called during reset().\n\t *\/\n\n\tvirtual bool\n\tdoReturnObject(\n\t\t\tconst XObject*\ttheXObject,\n\t\t\tbool\t\t\tfInReset = false) = 0;\n\n\t\/**\n\t *\n\t * A functor for use with stl algorithms.\n\t *\n\t *\/\n#if defined(XALAN_NO_NAMESPACES)\n\tstruct ProtectedDeleteXObjectFunctor : public unary_function<const XObject*, void>\n#else\n\tstruct ProtectedDeleteXObjectFunctor : public std::unary_function<const XObject*, void>\n#endif\n\t{\n\tpublic:\n\n\t\tProtectedDeleteXObjectFunctor(\n\t\t\tXObjectFactory&\t\ttheFactoryInstance,\n\t\t\tbool\t\t\t\tfInReset) :\n\t\t\tm_factoryInstance(theFactoryInstance),\n\t\t\tm_fInReset(fInReset)\n\t\t{\n\t\t}\n\n\t\tresult_type\n\t\toperator()(argument_type\ttheXObject) const\n\t\t{\n\t\t\tm_factoryInstance.doReturnObject(theXObject,\n\t\t\t\t\t\t\t\t\t\t\t m_fInReset);\n\t\t}\n\n\tprivate:\n\n\t\tXObjectFactory&\t\tm_factoryInstance;\n\n\t\tconst bool\t\t\tm_fInReset;\n\t};\n\n\tfriend struct ProtectedDeleteXObjectFunctor;\n\nprivate:\n\n\t\/\/ Not implemented...\n\tXObjectFactory(const XObjectFactory&);\n\n\tXObjectFactory&\n\toperator=(const XObjectFactory&);\n\n\tbool\n\toperator==(const XObjectFactory&) const;\n};\n\n\n\n\/**\n * Manages the lifetime of an XObject instance.\n *\/\nclass XObjectGuard\n{\npublic:\n\n\t\/**\n\t * Construct an XObjectGuard instance from a factory object and an XObject.\n\t * \n\t * @param theFactory object that manages lifetime of XObjects\n\t * @param theXObject pointer to XObject managed\n\t *\/\n\tXObjectGuard(\n\t\t\tXObjectFactory&\t\ttheFactory,\n\t\t\tXObject*\t\t\ttheXObject) :\n\t\tm_factory(&theFactory),\n\t\tm_object(theXObject)\n\t{\n\t}\n\n\texplicit\n\tXObjectGuard() :\n\t\tm_factory(0),\n\t\tm_object(0)\n\t{\n\t}\n\n\t\/\/ Note that copy construction transfers ownership, just\n\t\/\/ as std::auto_ptr.\n\tXObjectGuard(XObjectGuard&\ttheRHS)\n\t{\n\t\t\/\/ Release the current object...\n\t\trelease();\n\n\t\t\/\/ Copy the factory and object pointers...\n\t\tm_factory = theRHS.m_factory;\n\t\tm_object = theRHS.m_object;\n\n\t\t\/\/ The source object no longer points to\n\t\t\/\/ the object...\n\t\ttheRHS.m_factory = 0;\n\t\ttheRHS.m_object = 0;\n\t}\n\n\t~XObjectGuard()\n\t{\n\t\treset();\n\t}\n\n\t\/\/ Note that assignment transfers ownership, just\n\t\/\/ as std::auto_ptr.\n\tXObjectGuard&\n\toperator=(XObjectGuard&\t\ttheRHS)\n\t{\n\t\tif (&theRHS != this)\n\t\t{\n\t\t\t\/\/ Release the current object...\n\t\t\trelease();\n\n\t\t\t\/\/ Copy the factory and object pointers...\n\t\t\tm_factory = theRHS.m_factory;\n\t\t\tm_object = theRHS.m_object;\n\n\t\t\t\/\/ The source object no longer points to\n\t\t\t\/\/ the object...\n\t\t\ttheRHS.m_factory = 0;\n\t\t\ttheRHS.m_object = 0;\n\t\t}\n\n\t\treturn *this;\n\t}\n\n\t\/**\n\t * Retrieve the object pointer (must not be null)\n\t * \n\t * @return pointer to XObject\n\t *\/\n\tXObject*\n\toperator->() const\n\t{\n\t\tassert(m_object != 0);\n\n\t\treturn m_object;\n\t}\n\n\t\/**\n\t * Retrieve the object pointer (may be null)\n\t * \n\t * @return pointer to XObject\n\t *\/\n\tXObject*\n\tget() const\n\t{\n\t\treturn m_object;\n\t}\n\n\t\/**\n\t * Return the referenced object to the factory and set the pointers to null.\n\t *\/\n\tvoid\n\treset()\n\t{\n\t\tif (m_object != 0)\n\t\t{\n\t\t\tassert(m_factory != 0);\n\n\t\t\tm_factory->returnObject(m_object);\n\n\t\t\tm_object = 0;\n\t\t}\n\n\t\tm_factory = 0;\n\t}\n\n\t\/**\n\t * Return the referenced object to the factory, if there is one,\n\t * and set the pointers to the new object and factory.\n\t *\/\n\tvoid\n\treset(\n\t\t\tXObjectFactory&\t\ttheFactory,\n\t\t\tXObject*\t\t\ttheXObject)\n\t{\n\t\tif (m_object != 0)\n\t\t{\n\t\t\tassert(m_factory != 0);\n\n\t\t\tm_factory->returnObject(m_object);\n\t\t}\n\n\t\tm_object = theXObject;\n\t\tm_factory = &theFactory;\n\t}\n\n\t\/**\n\t * Transfers ownership of XObject to caller\n\t * \n\t * @return pointer to XObject\n\t *\/\n\tXObject*\n\trelease()\n\t{\n\t\tXObject* const\ttheTemp = m_object;\n\n\t\tm_object = 0;\n\n\t\treturn theTemp;\n\t}\n\nprivate:\n\n\tbool\n\toperator==(const XObjectGuard&) const;\n\n\n\t\/\/ Data members...\n\tXObjectFactory*\t\tm_factory;\n    XObject*\t\t\tm_object;\n};\n\n\n\n#endif\t\/\/ XOBJECTFACTORY_HEADER_GUARD_1357924680\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 -triple x86_64-unknown-unknown -ast-dump %s | FileCheck -strict-whitespace %s\n\nvoid testArrayInitExpr()\n{\n    int a[10];\n    auto l = [a]{\n    };\n    \/\/ CHECK: |-ArrayInitLoopExpr 0x{{[^ ]*}} <col:15> 'int [10]'\n    \/\/ CHECK: | `-ArrayInitIndexExpr 0x{{[^ ]*}} <<invalid sloc>> 'unsigned long'\n}\n<commit_msg>Fix whitespace<commit_after>\/\/ RUN: %clang_cc1 -triple x86_64-unknown-unknown -ast-dump %s | FileCheck -strict-whitespace %s\n\nvoid testArrayInitExpr()\n{\n    int a[10];\n    auto l = [a]{\n    };\n    \/\/ CHECK: |-ArrayInitLoopExpr 0x{{[^ ]*}} <col:15> 'int [10]'\n    \/\/ CHECK: |     `-ArrayInitIndexExpr 0x{{[^ ]*}} <<invalid sloc>> 'unsigned long'\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++1y %s -o -\n\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++1y %s -fdefine-sized-deallocation -o -\n\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++11 -fsized-deallocation %s -o -\n\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++11 -fsized-deallocation -fdefine-sized-deallocation %s -o -\n\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++11 %s -o -\n\n\/\/ CHECK-UNSIZED-NOT: _ZdlPvm\n\/\/ CHECK-UNSIZED-NOT: _ZdaPvm\n\nvoid operator delete(void*, unsigned long) throw() __attribute__((alias(\"foo\")));\nextern \"C\" void foo(void*, unsigned long) {}\n\n\/\/ CHECK-DAG: @_ZdlPvm = alias void (i8*, i64)* @my_delete\n<commit_msg>Fix a test case.<commit_after>\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++1y -o - %s 2>&1 | FileCheck %s\n\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++1y -fdefine-sized-deallocation -o - %s 2>&1 | FileCheck %s\n\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++11 -fsized-deallocation -o - %s 2>&1 | FileCheck %s\n\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++11 -fsized-deallocation -fdefine-sized-deallocation -o - %s 2>&1 | FileCheck %s\n\/\/ RUN: %clang -cc1 -emit-llvm -triple x86_64-unknown-unknown -std=c++11 -o - %s 2>&1 | FileCheck %s\n\n\/\/ CHECK-UNSIZED-NOT: _ZdlPvm\n\/\/ CHECK-UNSIZED-NOT: _ZdaPvm\n\nvoid operator delete(void*, unsigned long) throw() __attribute__((alias(\"foo\")));\nextern \"C\" void foo(void*, unsigned long) {}\n\n\/\/ CHECK-DAG: @_ZdlPvm = alias void (i8*, i64)* @foo\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 -triple x86_64-pc-linux -std=c++11 -ast-dump -ast-dump-filter Test %s | FileCheck --strict-whitespace %s\n\nint TestLocation\n__attribute__((unused));\n\/\/ CHECK:      VarDecl{{.*}}TestLocation\n\/\/ CHECK-NEXT:   UnusedAttr 0x{{[^ ]*}} <line:[[@LINE-2]]:16>\n\nint TestIndent\n__attribute__((unused));\n\/\/ CHECK:      {{^}}VarDecl{{.*TestIndent[^()]*$}}\n\/\/ CHECK-NEXT: {{^}}`-UnusedAttr{{[^()]*$}}\n\nvoid TestAttributedStmt() {\n  switch (1) {\n  case 1:\n    [[clang::fallthrough]];\n  case 2:\n    ;\n  }\n}\n\/\/ CHECK:      FunctionDecl{{.*}}TestAttributedStmt\n\/\/ CHECK:      AttributedStmt\n\/\/ CHECK-NEXT:   FallThroughAttr\n\/\/ CHECK-NEXT:   NullStmt\n\n[[clang::warn_unused_result]] int TestCXX11DeclAttr();\n\/\/ CHECK:      FunctionDecl{{.*}}TestCXX11DeclAttr\n\/\/ CHECK-NEXT:   WarnUnusedResultAttr\n\nint TestAlignedNull __attribute__((aligned));\n\/\/ CHECK:      VarDecl{{.*}}TestAlignedNull\n\/\/ CHECK-NEXT:   AlignedAttr {{.*}} aligned\n\/\/ CHECK-NEXT:     <<<NULL>>>\n\nint TestAlignedExpr __attribute__((aligned(4)));\n\/\/ CHECK:      VarDecl{{.*}}TestAlignedExpr\n\/\/ CHECK-NEXT:   AlignedAttr {{.*}} aligned\n\/\/ CHECK-NEXT:     IntegerLiteral\n\nint TestEnum __attribute__((visibility(\"default\")));\n\/\/ CHECK:      VarDecl{{.*}}TestEnum\n\/\/ CHECK-NEXT:   VisibilityAttr{{.*}} Default\n\nclass __attribute__((lockable)) Mutex {\n} mu1, mu2;\nint TestExpr __attribute__((guarded_by(mu1)));\n\/\/ CHECK:      VarDecl{{.*}}TestExpr\n\/\/ CHECK-NEXT:   GuardedByAttr\n\/\/ CHECK-NEXT:     DeclRefExpr{{.*}}mu1\n\nclass Mutex TestVariadicExpr __attribute__((acquired_after(mu1, mu2)));\n\/\/ CHECK:      VarDecl{{.*}}TestVariadicExpr\n\/\/ CHECK:        AcquiredAfterAttr\n\/\/ CHECK-NEXT:     DeclRefExpr{{.*}}mu1\n\/\/ CHECK-NEXT:     DeclRefExpr{{.*}}mu2\n\nvoid function1(void *) {\n  int TestFunction __attribute__((cleanup(function1)));\n}\n\/\/ CHECK:      VarDecl{{.*}}TestFunction\n\/\/ CHECK-NEXT:   CleanupAttr{{.*}} Function{{.*}}function1\n\nvoid TestIdentifier(void *, int)\n__attribute__((pointer_with_type_tag(ident1,1,2)));\n\/\/ CHECK: FunctionDecl{{.*}}TestIdentifier\n\/\/ CHECK:   ArgumentWithTypeTagAttr{{.*}} pointer_with_type_tag ident1\n\nvoid TestBool(void *, int)\n__attribute__((pointer_with_type_tag(bool1,1,2)));\n\/\/ CHECK: FunctionDecl{{.*}}TestBool\n\/\/ CHECK:   ArgumentWithTypeTagAttr{{.*}}pointer_with_type_tag bool1 0 1 IsPointer\n\nvoid TestUnsigned(void *, int)\n__attribute__((pointer_with_type_tag(unsigned1,1,2)));\n\/\/ CHECK: FunctionDecl{{.*}}TestUnsigned\n\/\/ CHECK:   ArgumentWithTypeTagAttr{{.*}} pointer_with_type_tag unsigned1 0 1\n\nvoid TestInt(void) __attribute__((constructor(123)));\n\/\/ CHECK:      FunctionDecl{{.*}}TestInt\n\/\/ CHECK-NEXT:   ConstructorAttr{{.*}} 123\n\nint TestString __attribute__((alias(\"alias1\")));\n\/\/ CHECK:      VarDecl{{.*}}TestString\n\/\/ CHECK-NEXT:   AliasAttr{{.*}} \"alias1\"\n\nextern struct s1 TestType\n__attribute__((type_tag_for_datatype(ident1,int)));\n\/\/ CHECK:      VarDecl{{.*}}TestType\n\/\/ CHECK-NEXT:   TypeTagForDatatypeAttr{{.*}} int\n\nvoid TestLabel() {\nL: __attribute__((unused)) int i;\n\/\/ CHECK: LabelStmt{{.*}}'L'\n\/\/ CHECK: VarDecl{{.*}}i 'int'\n\/\/ CHECK-NEXT: UnusedAttr{{.*}}\n\nM: __attribute(()) int j;\n\/\/ CHECK: LabelStmt {{.*}} 'M'\n\/\/ CHECK-NEXT: DeclStmt\n\/\/ CHECK-NEXT: VarDecl {{.*}} j 'int'\n\nN: __attribute(()) ;\n\/\/ CHECK: LabelStmt {{.*}} 'N'\n\/\/ CHECK-NEXT: NullStmt\n}\n\nnamespace Test {\nextern \"C\" int printf(const char *format, ...);\n\/\/ CHECK: FunctionDecl{{.*}}printf\n\/\/ CHECK-NEXT: ParmVarDecl{{.*}}format{{.*}}'const char *'\n\/\/ CHECK-NEXT: FormatAttr{{.*}}printf 1 2 Implicit\n}<commit_msg>Adding a test case to ensure that type attributes applied to the decl-specifier are applied across all declarations in a group.<commit_after>\/\/ RUN: %clang_cc1 -triple x86_64-pc-linux -std=c++11 -ast-dump -ast-dump-filter Test %s | FileCheck --strict-whitespace %s\n\nint TestLocation\n__attribute__((unused));\n\/\/ CHECK:      VarDecl{{.*}}TestLocation\n\/\/ CHECK-NEXT:   UnusedAttr 0x{{[^ ]*}} <line:[[@LINE-2]]:16>\n\nint TestIndent\n__attribute__((unused));\n\/\/ CHECK:      {{^}}VarDecl{{.*TestIndent[^()]*$}}\n\/\/ CHECK-NEXT: {{^}}`-UnusedAttr{{[^()]*$}}\n\nvoid TestAttributedStmt() {\n  switch (1) {\n  case 1:\n    [[clang::fallthrough]];\n  case 2:\n    ;\n  }\n}\n\/\/ CHECK:      FunctionDecl{{.*}}TestAttributedStmt\n\/\/ CHECK:      AttributedStmt\n\/\/ CHECK-NEXT:   FallThroughAttr\n\/\/ CHECK-NEXT:   NullStmt\n\n[[clang::warn_unused_result]] int TestCXX11DeclAttr();\n\/\/ CHECK:      FunctionDecl{{.*}}TestCXX11DeclAttr\n\/\/ CHECK-NEXT:   WarnUnusedResultAttr\n\nint TestAlignedNull __attribute__((aligned));\n\/\/ CHECK:      VarDecl{{.*}}TestAlignedNull\n\/\/ CHECK-NEXT:   AlignedAttr {{.*}} aligned\n\/\/ CHECK-NEXT:     <<<NULL>>>\n\nint TestAlignedExpr __attribute__((aligned(4)));\n\/\/ CHECK:      VarDecl{{.*}}TestAlignedExpr\n\/\/ CHECK-NEXT:   AlignedAttr {{.*}} aligned\n\/\/ CHECK-NEXT:     IntegerLiteral\n\nint TestEnum __attribute__((visibility(\"default\")));\n\/\/ CHECK:      VarDecl{{.*}}TestEnum\n\/\/ CHECK-NEXT:   VisibilityAttr{{.*}} Default\n\nclass __attribute__((lockable)) Mutex {\n} mu1, mu2;\nint TestExpr __attribute__((guarded_by(mu1)));\n\/\/ CHECK:      VarDecl{{.*}}TestExpr\n\/\/ CHECK-NEXT:   GuardedByAttr\n\/\/ CHECK-NEXT:     DeclRefExpr{{.*}}mu1\n\nclass Mutex TestVariadicExpr __attribute__((acquired_after(mu1, mu2)));\n\/\/ CHECK:      VarDecl{{.*}}TestVariadicExpr\n\/\/ CHECK:        AcquiredAfterAttr\n\/\/ CHECK-NEXT:     DeclRefExpr{{.*}}mu1\n\/\/ CHECK-NEXT:     DeclRefExpr{{.*}}mu2\n\nvoid function1(void *) {\n  int TestFunction __attribute__((cleanup(function1)));\n}\n\/\/ CHECK:      VarDecl{{.*}}TestFunction\n\/\/ CHECK-NEXT:   CleanupAttr{{.*}} Function{{.*}}function1\n\nvoid TestIdentifier(void *, int)\n__attribute__((pointer_with_type_tag(ident1,1,2)));\n\/\/ CHECK: FunctionDecl{{.*}}TestIdentifier\n\/\/ CHECK:   ArgumentWithTypeTagAttr{{.*}} pointer_with_type_tag ident1\n\nvoid TestBool(void *, int)\n__attribute__((pointer_with_type_tag(bool1,1,2)));\n\/\/ CHECK: FunctionDecl{{.*}}TestBool\n\/\/ CHECK:   ArgumentWithTypeTagAttr{{.*}}pointer_with_type_tag bool1 0 1 IsPointer\n\nvoid TestUnsigned(void *, int)\n__attribute__((pointer_with_type_tag(unsigned1,1,2)));\n\/\/ CHECK: FunctionDecl{{.*}}TestUnsigned\n\/\/ CHECK:   ArgumentWithTypeTagAttr{{.*}} pointer_with_type_tag unsigned1 0 1\n\nvoid TestInt(void) __attribute__((constructor(123)));\n\/\/ CHECK:      FunctionDecl{{.*}}TestInt\n\/\/ CHECK-NEXT:   ConstructorAttr{{.*}} 123\n\nint TestString __attribute__((alias(\"alias1\")));\n\/\/ CHECK:      VarDecl{{.*}}TestString\n\/\/ CHECK-NEXT:   AliasAttr{{.*}} \"alias1\"\n\nextern struct s1 TestType\n__attribute__((type_tag_for_datatype(ident1,int)));\n\/\/ CHECK:      VarDecl{{.*}}TestType\n\/\/ CHECK-NEXT:   TypeTagForDatatypeAttr{{.*}} int\n\nvoid TestLabel() {\nL: __attribute__((unused)) int i;\n\/\/ CHECK: LabelStmt{{.*}}'L'\n\/\/ CHECK: VarDecl{{.*}}i 'int'\n\/\/ CHECK-NEXT: UnusedAttr{{.*}}\n\nM: __attribute(()) int j;\n\/\/ CHECK: LabelStmt {{.*}} 'M'\n\/\/ CHECK-NEXT: DeclStmt\n\/\/ CHECK-NEXT: VarDecl {{.*}} j 'int'\n\nN: __attribute(()) ;\n\/\/ CHECK: LabelStmt {{.*}} 'N'\n\/\/ CHECK-NEXT: NullStmt\n}\n\nnamespace Test {\nextern \"C\" int printf(const char *format, ...);\n\/\/ CHECK: FunctionDecl{{.*}}printf\n\/\/ CHECK-NEXT: ParmVarDecl{{.*}}format{{.*}}'const char *'\n\/\/ CHECK-NEXT: FormatAttr{{.*}}printf 1 2 Implicit\n}\n\nint __attribute__((cdecl)) TestOne(void), TestTwo(void);\n\/\/ CHECK: FunctionDecl{{.*}}TestOne{{.*}}__attribute__((cdecl))\n\/\/ CHECK: FunctionDecl{{.*}}TestTwo{{.*}}__attribute__((cdecl))\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include \"benchmark\/benchmark.h\"\n#include \"simple_graph\/list_graph.hpp\"\n#include \"simple_graph\/algorithm\/bellman_ford.hpp\"\n\nusing simple_graph::vertex_index_t;\n\nstatic void bench_bellman_ford(benchmark::State &state)\n{\n    simple_graph::ListGraph<true, int, ssize_t> g;\n    for (int i = 0; i < state.range_x(); ++i) {\n        g.add_vertex(simple_graph::Vertex<int>(i, i));\n    }\n    for (int i = 0; i < state.range_x() - 1; ++i) {\n        g.add_edge(simple_graph::Edge<ssize_t>(i, i + 1, 1));\n    }\n\n    while (state.KeepRunning()) {\n        std::vector<vertex_index_t> path;\n        benchmark::DoNotOptimize(simple_graph::bellman_ford(g, 0, state.range_x() - 1, &path));\n    }\n}\nBENCHMARK(bench_bellman_ford)->Range(1<<10, 1<<16);\n\nstatic void bench_bellman_ford_reversed(benchmark::State &state)\n{\n    simple_graph::ListGraph<true, int, ssize_t> g;\n    for (int i = 0; i < state.range_x(); ++i) {\n        g.add_vertex(simple_graph::Vertex<int>(i, i));\n    }\n    for (int i = 0; i < state.range_x() - 1; ++i) {\n        g.add_edge(simple_graph::Edge<ssize_t>(i + 1, i, 1));\n    }\n\n    while (state.KeepRunning()) {\n        std::vector<vertex_index_t> path;\n        benchmark::DoNotOptimize(simple_graph::bellman_ford(g, state.range_x() - 1, 0, &path));\n    }\n}\nBENCHMARK(bench_bellman_ford_reversed)->Range(1<<10, 1<<16);\n\nBENCHMARK_MAIN()\n<commit_msg>Add benchmark test for Bellman-Ford<commit_after>#include <algorithm>\n#include <iostream>\n#include \"benchmark\/benchmark.h\"\n#include \"simple_graph\/list_graph.hpp\"\n#include \"simple_graph\/algorithm\/bellman_ford.hpp\"\n\nusing simple_graph::vertex_index_t;\n\nstatic void bench_bellman_ford(benchmark::State &state)\n{\n    simple_graph::ListGraph<true, int, ssize_t> g;\n    for (int i = 0; i < state.range_x(); ++i) {\n        g.add_vertex(simple_graph::Vertex<int>(i, i));\n    }\n    for (int i = 0; i < state.range_x() - 1; ++i) {\n        g.add_edge(simple_graph::Edge<ssize_t>(i, i + 1, 1));\n    }\n\n    while (state.KeepRunning()) {\n        std::vector<vertex_index_t> path;\n        benchmark::DoNotOptimize(simple_graph::bellman_ford(g, 0, state.range_x() - 1, &path));\n    }\n}\nBENCHMARK(bench_bellman_ford)->Range(1<<10, 1<<16);\n\nstatic void bench_bellman_ford_reversed(benchmark::State &state)\n{\n    simple_graph::ListGraph<true, int, ssize_t> g;\n    for (int i = 0; i < state.range_x(); ++i) {\n        g.add_vertex(simple_graph::Vertex<int>(i, i));\n    }\n    for (int i = 0; i < state.range_x() - 1; ++i) {\n        g.add_edge(simple_graph::Edge<ssize_t>(i + 1, i, 1));\n    }\n\n    while (state.KeepRunning()) {\n        std::vector<vertex_index_t> path;\n        benchmark::DoNotOptimize(simple_graph::bellman_ford(g, state.range_x() - 1, 0, &path));\n    }\n}\nBENCHMARK(bench_bellman_ford_reversed)->Range(1<<10, 1<<16);\n\nstatic void bench_bellman_ford_random(benchmark::State &state)\n{\n    std::vector<vertex_index_t> vertices;\n    simple_graph::ListGraph<true, int, ssize_t> g;\n    for (int i = 0; i < state.range_x(); ++i) {\n        g.add_vertex(simple_graph::Vertex<int>(i, i));\n        vertices.push_back(i);\n    }\n    std::random_shuffle(vertices.begin(), vertices.end());\n    for (int i = 0; i < state.range_x() - 1; ++i) {\n        g.add_edge(simple_graph::Edge<ssize_t>(vertices[i], vertices[i + 1], 1));\n    }\n\n    while (state.KeepRunning()) {\n        std::vector<vertex_index_t> path;\n        benchmark::DoNotOptimize(simple_graph::bellman_ford(g, vertices[0], vertices[state.range_x() - 1], &path));\n    }\n}\nBENCHMARK(bench_bellman_ford_random)->Range(1<<10, 1<<13);\n\nBENCHMARK_MAIN()\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include \"Halide.h\"\n#include <iostream>\n\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n    Var x(\"x\"), y(\"y\");\n    Func f(\"f\"), g(\"g\"), h(\"h\");\n\n    printf(\"Defining function...\\n\");\n\n    f(x, y) = max(x, y);\n    g(x, y) = min(x, y);\n    h(x, y) = clamp(x+y, 20, 100);\n\n    Target target = get_jit_target_from_environment();\n    if (target.has_gpu_feature()) {\n        \/\/ Resolve why OpenCL used 32,1 tiling\n        f.gpu_tile(x, y, 8, 8);\n        g.gpu_tile(x, y, 8, 8);\n        h.gpu_tile(x, y, 8, 8);\n    }\n\n    printf(\"Realizing function...\\n\");\n\n    Image<int> imf = f.realize(32, 32, target);\n    Image<int> img = g.realize(32, 32, target);\n    Image<int> imh = h.realize(32, 32, target);\n\n    \/\/ Check the result was what we expected\n    for (int i = 0; i < 32; i++) {\n        for (int j = 0; j < 32; j++) {\n            if (imf(i, j) != (i > j ? i : j)) {\n                printf(\"imf[%d, %d] = %d\\n\", i, j, imf(i, j));\n                return -1;\n            }\n            if (img(i, j) != (i < j ? i : j)) {\n                printf(\"img[%d, %d] = %d\\n\", i, j, img(i, j));\n                return -1;\n            }\n            int href = i+j;\n            if (href < 20) href = 20;\n            if (href > 100) href = 100;\n            if (imh(i, j) != href) {\n                printf(\"imh[%d, %d] = %d (not %d)\\n\", i, j, imh(i, j), href);\n                return -1;\n            }\n        }\n    }\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n<commit_msg>Added hexagon schedule.<commit_after>#include <stdio.h>\n#include \"Halide.h\"\n#include <iostream>\n\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n    Var x(\"x\"), y(\"y\");\n    Func f(\"f\"), g(\"g\"), h(\"h\");\n\n    printf(\"Defining function...\\n\");\n\n    f(x, y) = max(x, y);\n    g(x, y) = min(x, y);\n    h(x, y) = clamp(x+y, 20, 100);\n\n    Target target = get_jit_target_from_environment();\n    if (target.has_gpu_feature()) {\n        \/\/ Resolve why OpenCL used 32,1 tiling\n        f.gpu_tile(x, y, 8, 8);\n        g.gpu_tile(x, y, 8, 8);\n        h.gpu_tile(x, y, 8, 8);\n    } else if (target.features_any_of({Target::HVX_64, Target::HVX_128})) {\n        f.hexagon().vectorize(x, 32);\n        g.hexagon().vectorize(x, 32);\n        h.hexagon().vectorize(x, 32);\n    }\n\n    printf(\"Realizing function...\\n\");\n\n    Image<int> imf = f.realize(32, 32, target);\n    Image<int> img = g.realize(32, 32, target);\n    Image<int> imh = h.realize(32, 32, target);\n\n    \/\/ Check the result was what we expected\n    for (int i = 0; i < 32; i++) {\n        for (int j = 0; j < 32; j++) {\n            if (imf(i, j) != (i > j ? i : j)) {\n                printf(\"imf[%d, %d] = %d\\n\", i, j, imf(i, j));\n                return -1;\n            }\n            if (img(i, j) != (i < j ? i : j)) {\n                printf(\"img[%d, %d] = %d\\n\", i, j, img(i, j));\n                return -1;\n            }\n            int href = i+j;\n            if (href < 20) href = 20;\n            if (href > 100) href = 100;\n            if (imh(i, j) != href) {\n                printf(\"imh[%d, %d] = %d (not %d)\\n\", i, j, imh(i, j), href);\n                return -1;\n            }\n        }\n    }\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright 2015 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 <memory>\n#include <mutex>\n#include <sstream>\n#include <string>\n#include <thread>\n#include <vector>\n\n#include <grpc++\/channel.h>\n#include <grpc++\/client_context.h>\n#include <grpc++\/server.h>\n#include <grpc++\/server_builder.h>\n#include <grpc\/grpc.h>\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/host_port.h>\n#include <grpc\/support\/log.h>\n#include <grpc\/support\/time.h>\n\n#include \"src\/core\/lib\/profiling\/timers.h\"\n#include \"src\/proto\/grpc\/testing\/services.grpc.pb.h\"\n#include \"test\/cpp\/qps\/client.h\"\n#include \"test\/cpp\/qps\/interarrival.h\"\n#include \"test\/cpp\/qps\/usage_timer.h\"\n\nnamespace grpc {\nnamespace testing {\n\nstatic std::unique_ptr<BenchmarkService::Stub> BenchmarkStubCreator(\n    std::shared_ptr<Channel> ch) {\n  return BenchmarkService::NewStub(ch);\n}\n\nclass SynchronousClient\n    : public ClientImpl<BenchmarkService::Stub, SimpleRequest> {\n public:\n  SynchronousClient(const ClientConfig& config)\n      : ClientImpl<BenchmarkService::Stub, SimpleRequest>(\n            config, BenchmarkStubCreator) {\n    num_threads_ =\n        config.outstanding_rpcs_per_channel() * config.client_channels();\n    responses_.resize(num_threads_);\n    SetupLoadTest(config, num_threads_);\n  }\n\n  virtual ~SynchronousClient(){};\n\n  virtual bool InitThreadFuncImpl(size_t thread_idx) = 0;\n  virtual bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) = 0;\n\n  void ThreadFunc(size_t thread_idx, Thread* t) override {\n    if (!InitThreadFuncImpl(thread_idx)) {\n      return;\n    }\n    for (;;) {\n      \/\/ run the loop body\n      HistogramEntry entry;\n      const bool thread_still_ok = ThreadFuncImpl(&entry, thread_idx);\n      t->UpdateHistogram(&entry);\n      if (!thread_still_ok) {\n        gpr_log(GPR_ERROR, \"Finishing client thread due to RPC error\");\n      }\n      if (!thread_still_ok || ThreadCompleted()) {\n        return;\n      }\n    }\n  }\n\n protected:\n  \/\/ WaitToIssue returns false if we realize that we need to break out\n  bool WaitToIssue(int thread_idx) {\n    if (!closed_loop_) {\n      const gpr_timespec next_issue_time = NextIssueTime(thread_idx);\n      \/\/ Avoid sleeping for too long continuously because we might\n      \/\/ need to terminate before then. This is an issue since\n      \/\/ exponential distribution can occasionally produce bad outliers\n      while (true) {\n        const gpr_timespec one_sec_delay =\n            gpr_time_add(gpr_now(GPR_CLOCK_MONOTONIC),\n                         gpr_time_from_seconds(1, GPR_TIMESPAN));\n        if (gpr_time_cmp(next_issue_time, one_sec_delay) <= 0) {\n          gpr_sleep_until(next_issue_time);\n          return true;\n        } else {\n          gpr_sleep_until(one_sec_delay);\n          if (gpr_atm_acq_load(&thread_pool_done_) != static_cast<gpr_atm>(0)) {\n            return false;\n          }\n        }\n      }\n    }\n    return true;\n  }\n\n  size_t num_threads_;\n  std::vector<SimpleResponse> responses_;\n};\n\nclass SynchronousUnaryClient final : public SynchronousClient {\n public:\n  SynchronousUnaryClient(const ClientConfig& config)\n      : SynchronousClient(config) {\n    StartThreads(num_threads_);\n  }\n  ~SynchronousUnaryClient() {}\n\n  bool InitThreadFuncImpl(size_t thread_idx) override { return true; }\n\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    if (!WaitToIssue(thread_idx)) {\n      return true;\n    }\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    double start = UsageTimer::Now();\n    GPR_TIMER_SCOPE(\"SynchronousUnaryClient::ThreadFunc\", 0);\n    grpc::ClientContext context;\n    grpc::Status s =\n        stub->UnaryCall(&context, request_, &responses_[thread_idx]);\n    if (s.ok()) {\n      entry->set_value((UsageTimer::Now() - start) * 1e9);\n    }\n    entry->set_status(s.error_code());\n    return true;\n  }\n\n private:\n  void DestroyMultithreading() override final { EndThreads(); }\n};\n\ntemplate <class StreamType>\nclass SynchronousStreamingClient : public SynchronousClient {\n public:\n  SynchronousStreamingClient(const ClientConfig& config)\n      : SynchronousClient(config),\n        context_(num_threads_),\n        stream_(num_threads_),\n        stream_mu_(num_threads_),\n        shutdown_(num_threads_),\n        messages_per_stream_(config.messages_per_stream()),\n        messages_issued_(num_threads_) {\n    StartThreads(num_threads_);\n  }\n  virtual ~SynchronousStreamingClient() {\n    OnAllStreams([](ClientContext* ctx, StreamType* s) -> bool {\n      \/\/ don't log any kind of error since we might have canceled it\n      s->Finish().IgnoreError();\n      return true;\n    });\n  }\n\n protected:\n  std::vector<grpc::ClientContext> context_;\n  std::vector<std::unique_ptr<StreamType>> stream_;\n  \/\/ stream_mu_ is only needed when changing an element of stream_ or context_\n  std::vector<std::mutex> stream_mu_;\n  struct Bool {\n    bool val;\n    Bool() : val(false) {}\n  };\n  std::vector<Bool> shutdown_;\n  const int messages_per_stream_;\n  std::vector<int> messages_issued_;\n\n  void FinishStream(HistogramEntry* entry, size_t thread_idx) {\n    Status s = stream_[thread_idx]->Finish();\n    \/\/ don't set the value since the stream is failed and shouldn't be timed\n    entry->set_status(s.error_code());\n    if (!s.ok()) {\n      gpr_log(GPR_ERROR, \"Stream %\" PRIuPTR \" received an error %s\", thread_idx,\n              s.error_message().c_str());\n    }\n    \/\/ Lock the stream_mu_ now because the client context could change\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    context_[thread_idx].~ClientContext();\n    new (&context_[thread_idx]) ClientContext();\n  }\n  void OnAllStreams(std::function<bool(ClientContext*, StreamType*)> cleaner) {\n    std::vector<std::thread> cleanup_threads;\n    for (size_t i = 0; i < num_threads_; i++) {\n      cleanup_threads.emplace_back([this, i, cleaner]() {\n        std::lock_guard<std::mutex> l(stream_mu_[i]);\n        if (stream_[i]) {\n          shutdown_[i].val = cleaner(&context_[i], stream_[i].get());\n        }\n      });\n    }\n    for (auto& th : cleanup_threads) {\n      th.join();\n    }\n  }\n\n private:\n  void DestroyMultithreading() override final {\n    OnAllStreams([](ClientContext* ctx, StreamType* s) -> bool {\n      ctx->TryCancel();\n      return true;\n    });\n    EndThreads();\n  }\n};\n\nclass SynchronousStreamingPingPongClient final\n    : public SynchronousStreamingClient<\n          grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>> {\n public:\n  SynchronousStreamingPingPongClient(const ClientConfig& config)\n      : SynchronousStreamingClient(config) {}\n  ~SynchronousStreamingPingPongClient() {\n    OnAllStreams(\n        [](ClientContext* ctx,\n           grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>* s) -> bool {\n          s->WritesDone();\n          return true;\n        });\n  }\n\n  bool InitThreadFuncImpl(size_t thread_idx) override {\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingCall(&context_[thread_idx]);\n    } else {\n      return false;\n    }\n    messages_issued_[thread_idx] = 0;\n    return true;\n  }\n\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    if (!WaitToIssue(thread_idx)) {\n      return true;\n    }\n    GPR_TIMER_SCOPE(\"SynchronousStreamingPingPongClient::ThreadFunc\", 0);\n    double start = UsageTimer::Now();\n    if (stream_[thread_idx]->Write(request_) &&\n        stream_[thread_idx]->Read(&responses_[thread_idx])) {\n      entry->set_value((UsageTimer::Now() - start) * 1e9);\n      \/\/ don't set the status since there isn't one yet\n      if ((messages_per_stream_ != 0) &&\n          (++messages_issued_[thread_idx] < messages_per_stream_)) {\n        return true;\n      } else if (messages_per_stream_ == 0) {\n        return true;\n      } else {\n        \/\/ Fall through to the below resetting code after finish\n      }\n    }\n    stream_[thread_idx]->WritesDone();\n    FinishStream(entry, thread_idx);\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingCall(&context_[thread_idx]);\n    } else {\n      stream_[thread_idx].reset();\n      return false;\n    }\n    messages_issued_[thread_idx] = 0;\n    return true;\n  }\n};\n\nclass SynchronousStreamingFromClientClient final\n    : public SynchronousStreamingClient<grpc::ClientWriter<SimpleRequest>> {\n public:\n  SynchronousStreamingFromClientClient(const ClientConfig& config)\n      : SynchronousStreamingClient(config), last_issue_(num_threads_) {}\n  ~SynchronousStreamingFromClientClient() {\n    OnAllStreams(\n        [](ClientContext* ctx, grpc::ClientWriter<SimpleRequest>* s) -> bool {\n          s->WritesDone();\n          return true;\n        });\n  }\n\n  bool InitThreadFuncImpl(size_t thread_idx) override {\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingFromClient(&context_[thread_idx],\n                                                      &responses_[thread_idx]);\n    } else {\n      return false;\n    }\n    last_issue_[thread_idx] = UsageTimer::Now();\n    return true;\n  }\n\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    \/\/ Figure out how to make histogram sensible if this is rate-paced\n    if (!WaitToIssue(thread_idx)) {\n      return true;\n    }\n    GPR_TIMER_SCOPE(\"SynchronousStreamingFromClientClient::ThreadFunc\", 0);\n    if (stream_[thread_idx]->Write(request_)) {\n      double now = UsageTimer::Now();\n      entry->set_value((now - last_issue_[thread_idx]) * 1e9);\n      last_issue_[thread_idx] = now;\n      return true;\n    }\n    stream_[thread_idx]->WritesDone();\n    FinishStream(entry, thread_idx);\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingFromClient(&context_[thread_idx],\n                                                      &responses_[thread_idx]);\n    } else {\n      stream_[thread_idx].reset();\n      return false;\n    }\n    return true;\n  }\n\n private:\n  std::vector<double> last_issue_;\n};\n\nclass SynchronousStreamingFromServerClient final\n    : public SynchronousStreamingClient<grpc::ClientReader<SimpleResponse>> {\n public:\n  SynchronousStreamingFromServerClient(const ClientConfig& config)\n      : SynchronousStreamingClient(config), last_recv_(num_threads_) {}\n  bool InitThreadFuncImpl(size_t thread_idx) override {\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] =\n          stub->StreamingFromServer(&context_[thread_idx], request_);\n    } else {\n      return false;\n    }\n    last_recv_[thread_idx] = UsageTimer::Now();\n    return true;\n  }\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    GPR_TIMER_SCOPE(\"SynchronousStreamingFromServerClient::ThreadFunc\", 0);\n    if (stream_[thread_idx]->Read(&responses_[thread_idx])) {\n      double now = UsageTimer::Now();\n      entry->set_value((now - last_recv_[thread_idx]) * 1e9);\n      last_recv_[thread_idx] = now;\n      return true;\n    }\n    FinishStream(entry, thread_idx);\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] =\n          stub->StreamingFromServer(&context_[thread_idx], request_);\n    } else {\n      stream_[thread_idx].reset();\n      return false;\n    }\n    return true;\n  }\n\n private:\n  std::vector<double> last_recv_;\n};\n\nclass SynchronousStreamingBothWaysClient final\n    : public SynchronousStreamingClient<\n          grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>> {\n public:\n  SynchronousStreamingBothWaysClient(const ClientConfig& config)\n      : SynchronousStreamingClient(config) {}\n  ~SynchronousStreamingBothWaysClient() {\n    OnAllStreams(\n        [](ClientContext* ctx,\n           grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>* s) -> bool {\n          s->WritesDone();\n          return true;\n        });\n  }\n\n  bool InitThreadFuncImpl(size_t thread_idx) override {\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingBothWays(&context_[thread_idx]);\n    } else {\n      return false;\n    }\n    return true;\n  }\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    \/\/ TODO (vjpai): Do this\n    return true;\n  }\n};\n\nstd::unique_ptr<Client> CreateSynchronousClient(const ClientConfig& config) {\n  switch (config.rpc_type()) {\n    case UNARY:\n      return std::unique_ptr<Client>(new SynchronousUnaryClient(config));\n    case STREAMING:\n      return std::unique_ptr<Client>(\n          new SynchronousStreamingPingPongClient(config));\n    case STREAMING_FROM_CLIENT:\n      return std::unique_ptr<Client>(\n          new SynchronousStreamingFromClientClient(config));\n    case STREAMING_FROM_SERVER:\n      return std::unique_ptr<Client>(\n          new SynchronousStreamingFromServerClient(config));\n    case STREAMING_BOTH_WAYS:\n      return std::unique_ptr<Client>(\n          new SynchronousStreamingBothWaysClient(config));\n    default:\n      assert(false);\n      return nullptr;\n  }\n}\n\n}  \/\/ namespace testing\n}  \/\/ namespace grpc\n<commit_msg>Remove some unneeded and spammy logs<commit_after>\/*\n *\n * Copyright 2015 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 <memory>\n#include <mutex>\n#include <sstream>\n#include <string>\n#include <thread>\n#include <vector>\n\n#include <grpc++\/channel.h>\n#include <grpc++\/client_context.h>\n#include <grpc++\/server.h>\n#include <grpc++\/server_builder.h>\n#include <grpc\/grpc.h>\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/host_port.h>\n#include <grpc\/support\/log.h>\n#include <grpc\/support\/time.h>\n\n#include \"src\/core\/lib\/profiling\/timers.h\"\n#include \"src\/proto\/grpc\/testing\/services.grpc.pb.h\"\n#include \"test\/cpp\/qps\/client.h\"\n#include \"test\/cpp\/qps\/interarrival.h\"\n#include \"test\/cpp\/qps\/usage_timer.h\"\n\nnamespace grpc {\nnamespace testing {\n\nstatic std::unique_ptr<BenchmarkService::Stub> BenchmarkStubCreator(\n    std::shared_ptr<Channel> ch) {\n  return BenchmarkService::NewStub(ch);\n}\n\nclass SynchronousClient\n    : public ClientImpl<BenchmarkService::Stub, SimpleRequest> {\n public:\n  SynchronousClient(const ClientConfig& config)\n      : ClientImpl<BenchmarkService::Stub, SimpleRequest>(\n            config, BenchmarkStubCreator) {\n    num_threads_ =\n        config.outstanding_rpcs_per_channel() * config.client_channels();\n    responses_.resize(num_threads_);\n    SetupLoadTest(config, num_threads_);\n  }\n\n  virtual ~SynchronousClient(){};\n\n  virtual bool InitThreadFuncImpl(size_t thread_idx) = 0;\n  virtual bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) = 0;\n\n  void ThreadFunc(size_t thread_idx, Thread* t) override {\n    if (!InitThreadFuncImpl(thread_idx)) {\n      return;\n    }\n    for (;;) {\n      \/\/ run the loop body\n      HistogramEntry entry;\n      const bool thread_still_ok = ThreadFuncImpl(&entry, thread_idx);\n      t->UpdateHistogram(&entry);\n      if (!thread_still_ok || ThreadCompleted()) {\n        return;\n      }\n    }\n  }\n\n protected:\n  \/\/ WaitToIssue returns false if we realize that we need to break out\n  bool WaitToIssue(int thread_idx) {\n    if (!closed_loop_) {\n      const gpr_timespec next_issue_time = NextIssueTime(thread_idx);\n      \/\/ Avoid sleeping for too long continuously because we might\n      \/\/ need to terminate before then. This is an issue since\n      \/\/ exponential distribution can occasionally produce bad outliers\n      while (true) {\n        const gpr_timespec one_sec_delay =\n            gpr_time_add(gpr_now(GPR_CLOCK_MONOTONIC),\n                         gpr_time_from_seconds(1, GPR_TIMESPAN));\n        if (gpr_time_cmp(next_issue_time, one_sec_delay) <= 0) {\n          gpr_sleep_until(next_issue_time);\n          return true;\n        } else {\n          gpr_sleep_until(one_sec_delay);\n          if (gpr_atm_acq_load(&thread_pool_done_) != static_cast<gpr_atm>(0)) {\n            return false;\n          }\n        }\n      }\n    }\n    return true;\n  }\n\n  size_t num_threads_;\n  std::vector<SimpleResponse> responses_;\n};\n\nclass SynchronousUnaryClient final : public SynchronousClient {\n public:\n  SynchronousUnaryClient(const ClientConfig& config)\n      : SynchronousClient(config) {\n    StartThreads(num_threads_);\n  }\n  ~SynchronousUnaryClient() {}\n\n  bool InitThreadFuncImpl(size_t thread_idx) override { return true; }\n\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    if (!WaitToIssue(thread_idx)) {\n      return true;\n    }\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    double start = UsageTimer::Now();\n    GPR_TIMER_SCOPE(\"SynchronousUnaryClient::ThreadFunc\", 0);\n    grpc::ClientContext context;\n    grpc::Status s =\n        stub->UnaryCall(&context, request_, &responses_[thread_idx]);\n    if (s.ok()) {\n      entry->set_value((UsageTimer::Now() - start) * 1e9);\n    }\n    entry->set_status(s.error_code());\n    return true;\n  }\n\n private:\n  void DestroyMultithreading() override final { EndThreads(); }\n};\n\ntemplate <class StreamType>\nclass SynchronousStreamingClient : public SynchronousClient {\n public:\n  SynchronousStreamingClient(const ClientConfig& config)\n      : SynchronousClient(config),\n        context_(num_threads_),\n        stream_(num_threads_),\n        stream_mu_(num_threads_),\n        shutdown_(num_threads_),\n        messages_per_stream_(config.messages_per_stream()),\n        messages_issued_(num_threads_) {\n    StartThreads(num_threads_);\n  }\n  virtual ~SynchronousStreamingClient() {\n    OnAllStreams([](ClientContext* ctx, StreamType* s) -> bool {\n      \/\/ don't log any kind of error since we might have canceled it\n      s->Finish().IgnoreError();\n      return true;\n    });\n  }\n\n protected:\n  std::vector<grpc::ClientContext> context_;\n  std::vector<std::unique_ptr<StreamType>> stream_;\n  \/\/ stream_mu_ is only needed when changing an element of stream_ or context_\n  std::vector<std::mutex> stream_mu_;\n  \/\/ use struct Bool rather than bool because vector<bool> is not concurrent\n  struct Bool {\n    bool val;\n    Bool() : val(false) {}\n  };\n  std::vector<Bool> shutdown_;\n  const int messages_per_stream_;\n  std::vector<int> messages_issued_;\n\n  void FinishStream(HistogramEntry* entry, size_t thread_idx) {\n    Status s = stream_[thread_idx]->Finish();\n    \/\/ don't set the value since the stream is failed and shouldn't be timed\n    entry->set_status(s.error_code());\n    if (!s.ok()) {\n      std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n      if (!shutdown_[thread_idx].val) {\n        gpr_log(GPR_ERROR, \"Stream %\" PRIuPTR \" received an error %s\",\n                thread_idx, s.error_message().c_str());\n      }\n    }\n    \/\/ Lock the stream_mu_ now because the client context could change\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    context_[thread_idx].~ClientContext();\n    new (&context_[thread_idx]) ClientContext();\n  }\n  void OnAllStreams(std::function<bool(ClientContext*, StreamType*)> cleaner) {\n    std::vector<std::thread> cleanup_threads;\n    for (size_t i = 0; i < num_threads_; i++) {\n      cleanup_threads.emplace_back([this, i, cleaner]() {\n        std::lock_guard<std::mutex> l(stream_mu_[i]);\n        if (stream_[i]) {\n          shutdown_[i].val = cleaner(&context_[i], stream_[i].get());\n        }\n      });\n    }\n    for (auto& th : cleanup_threads) {\n      th.join();\n    }\n  }\n\n private:\n  void DestroyMultithreading() override final {\n    OnAllStreams([](ClientContext* ctx, StreamType* s) -> bool {\n      ctx->TryCancel();\n      return true;\n    });\n    EndThreads();\n  }\n};\n\nclass SynchronousStreamingPingPongClient final\n    : public SynchronousStreamingClient<\n          grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>> {\n public:\n  SynchronousStreamingPingPongClient(const ClientConfig& config)\n      : SynchronousStreamingClient(config) {}\n  ~SynchronousStreamingPingPongClient() {\n    OnAllStreams(\n        [](ClientContext* ctx,\n           grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>* s) -> bool {\n          s->WritesDone();\n          return true;\n        });\n  }\n\n  bool InitThreadFuncImpl(size_t thread_idx) override {\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingCall(&context_[thread_idx]);\n    } else {\n      return false;\n    }\n    messages_issued_[thread_idx] = 0;\n    return true;\n  }\n\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    if (!WaitToIssue(thread_idx)) {\n      return true;\n    }\n    GPR_TIMER_SCOPE(\"SynchronousStreamingPingPongClient::ThreadFunc\", 0);\n    double start = UsageTimer::Now();\n    if (stream_[thread_idx]->Write(request_) &&\n        stream_[thread_idx]->Read(&responses_[thread_idx])) {\n      entry->set_value((UsageTimer::Now() - start) * 1e9);\n      \/\/ don't set the status since there isn't one yet\n      if ((messages_per_stream_ != 0) &&\n          (++messages_issued_[thread_idx] < messages_per_stream_)) {\n        return true;\n      } else if (messages_per_stream_ == 0) {\n        return true;\n      } else {\n        \/\/ Fall through to the below resetting code after finish\n      }\n    }\n    stream_[thread_idx]->WritesDone();\n    FinishStream(entry, thread_idx);\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingCall(&context_[thread_idx]);\n    } else {\n      stream_[thread_idx].reset();\n      return false;\n    }\n    messages_issued_[thread_idx] = 0;\n    return true;\n  }\n};\n\nclass SynchronousStreamingFromClientClient final\n    : public SynchronousStreamingClient<grpc::ClientWriter<SimpleRequest>> {\n public:\n  SynchronousStreamingFromClientClient(const ClientConfig& config)\n      : SynchronousStreamingClient(config), last_issue_(num_threads_) {}\n  ~SynchronousStreamingFromClientClient() {\n    OnAllStreams(\n        [](ClientContext* ctx, grpc::ClientWriter<SimpleRequest>* s) -> bool {\n          s->WritesDone();\n          return true;\n        });\n  }\n\n  bool InitThreadFuncImpl(size_t thread_idx) override {\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingFromClient(&context_[thread_idx],\n                                                      &responses_[thread_idx]);\n    } else {\n      return false;\n    }\n    last_issue_[thread_idx] = UsageTimer::Now();\n    return true;\n  }\n\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    \/\/ Figure out how to make histogram sensible if this is rate-paced\n    if (!WaitToIssue(thread_idx)) {\n      return true;\n    }\n    GPR_TIMER_SCOPE(\"SynchronousStreamingFromClientClient::ThreadFunc\", 0);\n    if (stream_[thread_idx]->Write(request_)) {\n      double now = UsageTimer::Now();\n      entry->set_value((now - last_issue_[thread_idx]) * 1e9);\n      last_issue_[thread_idx] = now;\n      return true;\n    }\n    stream_[thread_idx]->WritesDone();\n    FinishStream(entry, thread_idx);\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingFromClient(&context_[thread_idx],\n                                                      &responses_[thread_idx]);\n    } else {\n      stream_[thread_idx].reset();\n      return false;\n    }\n    return true;\n  }\n\n private:\n  std::vector<double> last_issue_;\n};\n\nclass SynchronousStreamingFromServerClient final\n    : public SynchronousStreamingClient<grpc::ClientReader<SimpleResponse>> {\n public:\n  SynchronousStreamingFromServerClient(const ClientConfig& config)\n      : SynchronousStreamingClient(config), last_recv_(num_threads_) {}\n  bool InitThreadFuncImpl(size_t thread_idx) override {\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] =\n          stub->StreamingFromServer(&context_[thread_idx], request_);\n    } else {\n      return false;\n    }\n    last_recv_[thread_idx] = UsageTimer::Now();\n    return true;\n  }\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    GPR_TIMER_SCOPE(\"SynchronousStreamingFromServerClient::ThreadFunc\", 0);\n    if (stream_[thread_idx]->Read(&responses_[thread_idx])) {\n      double now = UsageTimer::Now();\n      entry->set_value((now - last_recv_[thread_idx]) * 1e9);\n      last_recv_[thread_idx] = now;\n      return true;\n    }\n    FinishStream(entry, thread_idx);\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] =\n          stub->StreamingFromServer(&context_[thread_idx], request_);\n    } else {\n      stream_[thread_idx].reset();\n      return false;\n    }\n    return true;\n  }\n\n private:\n  std::vector<double> last_recv_;\n};\n\nclass SynchronousStreamingBothWaysClient final\n    : public SynchronousStreamingClient<\n          grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>> {\n public:\n  SynchronousStreamingBothWaysClient(const ClientConfig& config)\n      : SynchronousStreamingClient(config) {}\n  ~SynchronousStreamingBothWaysClient() {\n    OnAllStreams(\n        [](ClientContext* ctx,\n           grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>* s) -> bool {\n          s->WritesDone();\n          return true;\n        });\n  }\n\n  bool InitThreadFuncImpl(size_t thread_idx) override {\n    auto* stub = channels_[thread_idx % channels_.size()].get_stub();\n    std::lock_guard<std::mutex> l(stream_mu_[thread_idx]);\n    if (!shutdown_[thread_idx].val) {\n      stream_[thread_idx] = stub->StreamingBothWays(&context_[thread_idx]);\n    } else {\n      return false;\n    }\n    return true;\n  }\n  bool ThreadFuncImpl(HistogramEntry* entry, size_t thread_idx) override {\n    \/\/ TODO (vjpai): Do this\n    return true;\n  }\n};\n\nstd::unique_ptr<Client> CreateSynchronousClient(const ClientConfig& config) {\n  switch (config.rpc_type()) {\n    case UNARY:\n      return std::unique_ptr<Client>(new SynchronousUnaryClient(config));\n    case STREAMING:\n      return std::unique_ptr<Client>(\n          new SynchronousStreamingPingPongClient(config));\n    case STREAMING_FROM_CLIENT:\n      return std::unique_ptr<Client>(\n          new SynchronousStreamingFromClientClient(config));\n    case STREAMING_FROM_SERVER:\n      return std::unique_ptr<Client>(\n          new SynchronousStreamingFromServerClient(config));\n    case STREAMING_BOTH_WAYS:\n      return std::unique_ptr<Client>(\n          new SynchronousStreamingBothWaysClient(config));\n    default:\n      assert(false);\n      return nullptr;\n  }\n}\n\n}  \/\/ namespace testing\n}  \/\/ namespace grpc\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright(c) Andre Caron, 2009-2011\n\/\/\n\/\/ This document is covered by the an Open Source Initiative approved software\n\/\/ license.  A copy of the license should have been provided alongside\n\/\/ this software package (see \"license.txt\").  If not, the license is available\n\/\/ online at \"http:\/\/www.opensource.org\/licenses\/mit-license\".\n\n#include \"Client.hpp\"\n#include \"Server.hpp\"\n\n#include <iostream>\n\nnamespace {\n\n}\n\nint main ( int, char ** )\n{\n    demo::Client client_;\n    demo::Server server_;\n    \n      \/\/ negotiation.\n    client_ >> server_, server_ >> client_;\n    client_ >> server_, server_ >> client_;\n    std::cout << \"-----\" << std::endl;\n    \n      \/\/ exchange.\n#if 0\n    client_ << \"Hello, server!\";\n    client_ >> server_;\n    { std::string message;\n        server_ >> message;\n        std::cout << \"Server: data='\" << message << \"'.\" << std::endl;\n    }\n    std::cout << \"-----\" << std::endl;\n#endif\n    \n      \/\/ re-negotiation.\n#if 0\n    client_.renegotiate();\n    client_ >> server_, server_ >> client_;\n    client_ >> server_, server_ >> client_;\n    client_ >> server_, server_ >> client_;\n    std::cout << \"-----\" << std::endl;\n      \/\/ exchange.\n    server_ << \"Hello, client!\";\n    server_ >> client_;\n    { std::string message;\n        client_ >> message;\n        std::cout << \"Client: data='\" << message << \"'.\" << std::endl;\n    }\n    std::cout << \"-----\" << std::endl;\n#endif\n    \n      \/\/ re-negotiation.\n    server_.renegotiate();\n    server_ >> client_;\n    client_ >> server_, server_ >> client_;\n    client_ >> server_, server_ >> client_;\n    std::cout << \"-----\" << std::endl;\n    \n      \/\/ exchange.\n    server_ << \"Hello, client!\";\n    server_ >> client_;\n    { std::string message;\n        client_ >> message;\n        std::cout << \"Client: data='\" << message << \"'.\" << std::endl;\n    }\n    std::cout << \"-----\" << std::endl;\n    \n      \/\/ exchange.\n#if 0\n    client_ << \"Hello, server!\";\n    client_ >> server_;\n    { std::string message;\n        server_ >> message;\n        std::cout << \"Server: data='\" << message << \"'.\" << std::endl;\n    }\n    std::cout << \"-----\" << std::endl;\n#endif\n    \n      \/\/ shutdown.\n    server_.shutdown();\n    server_ >> client_;\n}\n\n#pragma comment ( lib, \"Crypt32.lib\" )\n#pragma comment ( lib, \"Secur32.lib\" )\n<commit_msg>Trailing '_' on variable names.<commit_after>\/\/ Copyright(c) Andre Caron, 2009-2011\n\/\/\n\/\/ This document is covered by the an Open Source Initiative approved software\n\/\/ license.  A copy of the license should have been provided alongside\n\/\/ this software package (see \"license.txt\").  If not, the license is available\n\/\/ online at \"http:\/\/www.opensource.org\/licenses\/mit-license\".\n\n#include \"Client.hpp\"\n#include \"Server.hpp\"\n\n#include <iostream>\n\nnamespace {\n\n}\n\nint main ( int, char ** )\n{\n    demo::Client client;\n    demo::Server server;\n    \n      \/\/ negotiation.\n    client >> server, server >> client;\n    client >> server, server >> client;\n    std::cout << \"-----\" << std::endl;\n    \n      \/\/ exchange.\n#if 0\n    client << \"Hello, server!\";\n    client >> server;\n    { std::string message;\n        server >> message;\n        std::cout << \"Server: data='\" << message << \"'.\" << std::endl;\n    }\n    std::cout << \"-----\" << std::endl;\n#endif\n    \n      \/\/ re-negotiation.\n#if 0\n    client.renegotiate();\n    client >> server, server >> client;\n    client >> server, server >> client;\n    client >> server, server >> client;\n    std::cout << \"-----\" << std::endl;\n      \/\/ exchange.\n    server << \"Hello, client!\";\n    server >> client;\n    { std::string message;\n        client >> message;\n        std::cout << \"Client: data='\" << message << \"'.\" << std::endl;\n    }\n    std::cout << \"-----\" << std::endl;\n#endif\n    \n      \/\/ re-negotiation.\n    server.renegotiate();\n    server >> client;\n    client >> server, server >> client;\n    client >> server, server >> client;\n    std::cout << \"-----\" << std::endl;\n    \n      \/\/ exchange.\n    server << \"Hello, client!\";\n    server >> client;\n    { std::string message;\n        client >> message;\n        std::cout << \"Client: data='\" << message << \"'.\" << std::endl;\n    }\n    std::cout << \"-----\" << std::endl;\n    \n      \/\/ exchange.\n#if 0\n    client << \"Hello, server!\";\n    client >> server;\n    { std::string message;\n        server >> message;\n        std::cout << \"Server: data='\" << message << \"'.\" << std::endl;\n    }\n    std::cout << \"-----\" << std::endl;\n#endif\n    \n      \/\/ shutdown.\n    server.shutdown();\n    server >> client;\n}\n\n#pragma comment ( lib, \"Crypt32.lib\" )\n#pragma comment ( lib, \"Secur32.lib\" )\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of the SPLINTER library.\n * Copyright (C) 2012 Bjarne Grimstad (bjarne.grimstad@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 <serializer.h>\n#include \"polynomialregression.h\"\n#include \"linearsolvers.h\"\n#include \"unsupported\/Eigen\/KroneckerProduct\"\n\nnamespace SPLINTER\n{\n\nPolynomialRegression::PolynomialRegression()\n{\n}\n\nPolynomialRegression::PolynomialRegression(const char *fileName)\n    : PolynomialRegression(std::string(fileName))\n{\n}\n\nPolynomialRegression::PolynomialRegression(const std::string fileName)\n{\n    load(fileName);\n}\n\nPolynomialRegression::PolynomialRegression(const DataTable &samples, unsigned int degree)\n    : PolynomialRegression(samples, std::vector<unsigned int>(samples.getNumVariables(), degree))\n{\n}\n\nPolynomialRegression::PolynomialRegression(const DataTable &samples, std::vector<unsigned int> degrees)\n    : degrees(degrees),\n      numVariables(samples.getNumVariables()),\n      numCoefficients(0)\n{\n    if (degrees.size() != numVariables)\n        throw Exception(\"PolynomialRegression::PolynomialRegression: Inconsistent input data!\");\n\n    \/\/ Check that a minimum number of samples is provided\n    numCoefficients = 1;\n    for (auto deg : degrees)\n        numCoefficients *= (deg+1);\n\n    if (numCoefficients > samples.getNumSamples())\n        throw Exception(\"PolynomialRegression::PolynomialRegression: Insufficient number of samples!\");\n\n    \/\/ Compute coefficients\n    computeCoefficients(samples);\n}\n\ndouble PolynomialRegression::eval(DenseVector x) const\n{\n    DenseMatrix monomials = evalMonomials(x);\n    DenseMatrix res = coefficients*monomials;\n    return res(0,0);\n}\n\nvoid PolynomialRegression::computeCoefficients(const DataTable &samples)\n{\n    \/\/ Left hand side\n    DenseMatrix X = computeDesignMatrix(samples);\n    DenseMatrix Xt = X.transpose();\n    DenseMatrix XtX = Xt*X;\n\n    \/\/ Right-hand side\n    auto yvec = samples.getVectorY();\n    DenseVector y(yvec.size());\n    for (unsigned int i = 0; i < yvec.size(); ++i)\n        y(i) = yvec.at(i);\n    DenseMatrix Xty = Xt*y;\n\n    \/\/ Solve for coefficients\n    DenseQR s;\n    if (!s.solve(XtX, Xty, coefficients))\n        throw Exception(\"PolynomialRegression::computeCoefficients: Failed to solve for coefficients.\");\n\n    \/\/ Transpose coefficients matrix\n    coefficients.transposeInPlace();\n}\n\n\/*\n * Computes Vandermonde matrix\n * TODO: centering and scaling can improve the numerical properties\n *\/\nDenseMatrix PolynomialRegression::computeDesignMatrix(const DataTable &samples) const\n{\n    DenseMatrix X = DenseMatrix::Zero(samples.getNumSamples(), numCoefficients);\n\n    unsigned int i = 0;\n    for (auto it = samples.cbegin(); it != samples.cend(); ++it, ++i)\n    {\n        \/\/ Get point x\n        auto xvec = it->getX();\n        DenseVector x(xvec.size());\n        for (unsigned int j = 0; j < xvec.size(); ++j)\n            x(j) = xvec.at(j);\n\n        \/\/ Evaluate monomials at x\n        DenseVector Xi = evalMonomials(x);\n        assert(Xi.cols() == numCoefficients);\n\n        \/\/ Add row to design matrix X\n        X.block(i,0,1,numCoefficients) = Xi.transpose();\n    }\n\n    return X;\n}\n\nDenseVector PolynomialRegression::evalMonomials(DenseVector x) const\n{\n    std::vector<DenseVector> powers;\n\n    for (unsigned int i = 0; i < numVariables; ++i)\n    {\n        unsigned int deg = degrees.at(i);\n        DenseVector powi = DenseVector::Zero(deg+1);\n        for (unsigned int j = 0; j <= deg; ++j)\n            powi(j) = std::pow(x(i), j);\n        powers.push_back(powi);\n    }\n\n    \/\/ Kronecker product of monovariable power basis\n    DenseVector monomials = DenseVector::Ones(1);\n\n    for (unsigned int i = 0; i < numVariables; ++i)\n    {\n        DenseVector temp = monomials;\n        monomials = kroneckerProduct(temp, powers.at(i));\n    }\n\n    assert(monomials.cols() == numCoefficients);\n\n    return monomials;\n}\n\nvoid PolynomialRegression::save(const std::string fileName) const\n{\n    Serializer s;\n    s.serialize(*this);\n    s.saveToFile(fileName);\n}\n\nvoid PolynomialRegression::load(const std::string fileName)\n{\n    Serializer s(fileName);\n    s.deserialize(*this);\n}\n\nconst std::string PolynomialRegression::getDescription() const\n{\n    std::string description(\"PolynomialRegression of degree\");\n\n    \/\/ See if all degrees are the same.\n    bool equal = true;\n    for(size_t i = 1; i < degrees.size(); ++i) {\n        equal = equal && (degrees.at(i) == degrees.at(i-1));\n    }\n\n    if(equal) {\n        description.append(\" \");\n        description.append(std::to_string(degrees.at(0)));\n\n    } else {\n        description.append(\"s (\");\n        for(size_t i = 0; i < degrees.size(); ++i) {\n            description.append(std::to_string(degrees.at(i)));\n            if(i + 1 < degrees.size()) {\n                description.append(\", \");\n            }\n        }\n        description.append(\")\");\n    }\n\n    return description;\n}\n\n} \/\/ namespace SPLINTER\n<commit_msg>Replace assertions with exceptions<commit_after>\/*\n * This file is part of the SPLINTER library.\n * Copyright (C) 2012 Bjarne Grimstad (bjarne.grimstad@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 <serializer.h>\n#include \"polynomialregression.h\"\n#include \"linearsolvers.h\"\n#include \"unsupported\/Eigen\/KroneckerProduct\"\n\nnamespace SPLINTER\n{\n\nPolynomialRegression::PolynomialRegression()\n{\n}\n\nPolynomialRegression::PolynomialRegression(const char *fileName)\n    : PolynomialRegression(std::string(fileName))\n{\n}\n\nPolynomialRegression::PolynomialRegression(const std::string fileName)\n{\n    load(fileName);\n}\n\nPolynomialRegression::PolynomialRegression(const DataTable &samples, unsigned int degree)\n    : PolynomialRegression(samples, std::vector<unsigned int>(samples.getNumVariables(), degree))\n{\n}\n\nPolynomialRegression::PolynomialRegression(const DataTable &samples, std::vector<unsigned int> degrees)\n    : degrees(degrees),\n      numVariables(samples.getNumVariables()),\n      numCoefficients(0)\n{\n    if (degrees.size() != numVariables)\n        throw Exception(\"PolynomialRegression::PolynomialRegression: Inconsistent input data!\");\n\n    \/\/ Check that a minimum number of samples is provided\n    numCoefficients = 1;\n    for (auto deg : degrees)\n        numCoefficients *= (deg+1);\n\n    if (numCoefficients > samples.getNumSamples())\n        throw Exception(\"PolynomialRegression::PolynomialRegression: Insufficient number of samples!\");\n\n    \/\/ Compute coefficients\n    computeCoefficients(samples);\n}\n\ndouble PolynomialRegression::eval(DenseVector x) const\n{\n    DenseMatrix monomials = evalMonomials(x);\n    DenseMatrix res = coefficients*monomials;\n    return res(0,0);\n}\n\nvoid PolynomialRegression::computeCoefficients(const DataTable &samples)\n{\n    \/\/ Left hand side\n    DenseMatrix X = computeDesignMatrix(samples);\n    DenseMatrix Xt = X.transpose();\n    DenseMatrix XtX = Xt*X;\n\n    \/\/ Right-hand side\n    auto yvec = samples.getVectorY();\n    DenseVector y(yvec.size());\n    for (unsigned int i = 0; i < yvec.size(); ++i)\n        y(i) = yvec.at(i);\n    DenseMatrix Xty = Xt*y;\n\n    \/\/ Solve for coefficients\n    DenseQR s;\n    if (!s.solve(XtX, Xty, coefficients))\n        throw Exception(\"PolynomialRegression::computeCoefficients: Failed to solve for coefficients.\");\n\n    \/\/ Transpose coefficients matrix\n    coefficients.transposeInPlace();\n}\n\n\/*\n * Computes Vandermonde matrix\n * TODO: centering and scaling can improve the numerical properties\n *\/\nDenseMatrix PolynomialRegression::computeDesignMatrix(const DataTable &samples) const\n{\n    DenseMatrix X = DenseMatrix::Zero(samples.getNumSamples(), numCoefficients);\n\n    unsigned int i = 0;\n    for (auto it = samples.cbegin(); it != samples.cend(); ++it, ++i)\n    {\n        \/\/ Get point x\n        auto xvec = it->getX();\n        DenseVector x(xvec.size());\n        for (unsigned int j = 0; j < xvec.size(); ++j)\n            x(j) = xvec.at(j);\n\n        \/\/ Evaluate monomials at x\n        DenseVector Xi = evalMonomials(x);\n\n        if (Xi.rows() != numCoefficients)\n        {\n            throw Exception(\"PolynomialRegression::computeDesignMatrix: Xi.rows() != numCoefficients.\");\n        }\n\n        \/\/ Add row to design matrix X\n        X.block(i,0,1,numCoefficients) = Xi.transpose();\n    }\n\n    return X;\n}\n\nDenseVector PolynomialRegression::evalMonomials(DenseVector x) const\n{\n    std::vector<DenseVector> powers;\n\n    for (unsigned int i = 0; i < numVariables; ++i)\n    {\n        unsigned int deg = degrees.at(i);\n        DenseVector powi = DenseVector::Zero(deg+1);\n        for (unsigned int j = 0; j <= deg; ++j)\n            powi(j) = std::pow(x(i), j);\n        powers.push_back(powi);\n    }\n\n    \/\/ Kronecker product of monovariable power basis\n    DenseVector monomials = DenseVector::Ones(1);\n\n    for (unsigned int i = 0; i < numVariables; ++i)\n    {\n        DenseVector temp = monomials;\n        monomials = kroneckerProduct(temp, powers.at(i));\n    }\n\n    if (monomials.rows() == numCoefficients)\n    {\n        throw Exception(\"PolynomialRegression::evalMonomials: monomials.rows() != numCoefficients.\");\n    }\n\n    return monomials;\n}\n\nvoid PolynomialRegression::save(const std::string fileName) const\n{\n    Serializer s;\n    s.serialize(*this);\n    s.saveToFile(fileName);\n}\n\nvoid PolynomialRegression::load(const std::string fileName)\n{\n    Serializer s(fileName);\n    s.deserialize(*this);\n}\n\nconst std::string PolynomialRegression::getDescription() const\n{\n    std::string description(\"PolynomialRegression of degree\");\n\n    \/\/ See if all degrees are the same.\n    bool equal = true;\n    for(size_t i = 1; i < degrees.size(); ++i) {\n        equal = equal && (degrees.at(i) == degrees.at(i-1));\n    }\n\n    if(equal) {\n        description.append(\" \");\n        description.append(std::to_string(degrees.at(0)));\n\n    } else {\n        description.append(\"s (\");\n        for(size_t i = 0; i < degrees.size(); ++i) {\n            description.append(std::to_string(degrees.at(i)));\n            if(i + 1 < degrees.size()) {\n                description.append(\", \");\n            }\n        }\n        description.append(\")\");\n    }\n\n    return description;\n}\n\n} \/\/ namespace SPLINTER\n<|endoftext|>"}
{"text":"<commit_before>\/\/ inc order weird for these guys\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n\n\/\/%deps(opengl, glfw)\n\n#include \"viewer\/gl_aliases.hh\"\n#include \"viewer\/primitives\/simple_geometry_primitives.hh\"\n#include \"viewer\/window_3d.hh\"\n#include \"viewer\/window_manager.hh\"\n\n#include \"eigen_helpers.hh\"\n\n#include <map>\n#include <thread>\n\nnamespace viewer {\nnamespace {\n\nvoid apply_view(const OrbitCamera &view, bool show_axes) {\n  glMatrixMode(GL_MODELVIEW);\n  glLoadIdentity();\n\n  glTransform(view.camera_from_anchor());\n  glScaled(view.zoom(), view.zoom(), view.zoom());\n  if (show_axes) {\n    draw_axes({SE3(), 0.1 \/ view.zoom(), 3.0});\n  }\n\n  glTransform(view.anchor_from_world());\n  if (show_axes) {\n    draw_axes({SE3(), 0.2 \/ view.zoom(), 3.0});\n  }\n}\n\nvoid prepare_to_render() {\n  \/\/\n  \/\/ Flag soup\n  \/\/\n\n  glShadeModel(GL_SMOOTH);\n\n  \/\/ Check depth when rendering\n  glEnable(GL_DEPTH_TEST);\n\n  \/\/ Turn on lighting\n  \/\/ glEnable(GL_LIGHTING);\n\n  glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n  glEnable(GL_BLEND);\n  glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n  glEnable(GL_SAMPLE_ALPHA_TO_COVERAGE);\n  glEnable(GL_LINE_SMOOTH);\n  glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\n\n  glEnable(GL_MULTISAMPLE);\n}\n\nvoid set_perspective(const GlSize &gl_size, bool ortho = false) {\n  glViewport(0, 0, gl_size.width, gl_size.height);\n  glMatrixMode(GL_PROJECTION);\n\n  glLoadIdentity();\n\n  constexpr double NEAR_CLIP = 0.001;\n  constexpr double FAR_CLIP = 1000.0;\n  const double aspect_ratio =\n      (static_cast<double>(gl_size.width) \/ static_cast<double>(gl_size.height));\n  if (ortho) {\n    glOrtho(-aspect_ratio, aspect_ratio, -1.0, 1.0, NEAR_CLIP, FAR_CLIP);\n  } else {\n    constexpr double FOV = 60.0;\n    gluPerspective(FOV, aspect_ratio, NEAR_CLIP, FAR_CLIP);\n  }\n}\n\n}  \/\/ namespace\n\nWindow3D::Window3D(const GlSize &gl_size) : gl_size_(gl_size) {\n  set_view_preset(ViewSetting::STANDARD);\n}\n\nvoid Window3D::set_view_preset(const ViewSetting &setting) {\n  switch (setting) {\n    case ViewSetting::STANDARD: {\n      set_target_from_world(SE3(SO3::exp(Eigen::Vector3d(-3.1415 * 0.5, 0.0, 0.0)),\n                                Eigen::Vector3d::Zero()));\n      break;\n    }\n    case ViewSetting::CAMERA: {\n      set_target_from_world(\n          SE3(SO3::exp(Eigen::Vector3d::Zero()), Eigen::Vector3d::Zero()));\n      break;\n    }\n  }\n}\n\nvoid Window3D::spin_until_step() {\n  while (!should_step_ && !should_continue_ && !should_close()) {\n    std::this_thread::sleep_for(std::chrono::milliseconds(10));\n  }\n\n  if (should_continue_ && !should_close()) {\n    std::this_thread::sleep_for(std::chrono::milliseconds(continue_ms_));\n  }\n\n  if (should_step_) {\n    should_step_ = false;\n  }\n}\n\nvoid Window3D::on_key(int key, int scancode, int action, int mods) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const char key_char = static_cast<char>(key);\n\n  if (action == GLFW_PRESS) {\n    \/\/\n    \/\/ Toggling\n    \/\/\n    if (key_mappings_.count(key_char) != 0) {\n      const std::string toggle_name = key_mappings_.at(key_char);\n      toggles_[toggle_name] = !toggles_[toggle_name];\n      const bool new_toggle_state = toggles_[toggle_name];\n      for (const auto &toggle_callback : toggle_callbacks_[toggle_name]) {\n        toggle_callback(new_toggle_state);\n      }\n    }\n\n    \/\/\n    \/\/ Navigation UI management\n    \/\/\n    if (key_char == 'N') {\n      should_step_ = true;\n    }\n\n    if (key_char == 'C') {\n      should_continue_ = !should_continue_;\n    }\n\n    if (key_char == 'O') {\n      orthogonal_projection_ = !orthogonal_projection_;\n    }\n    if (key_char == 'H') {\n      hide_axes_ = !hide_axes_;\n    }\n  }\n}\nvoid Window3D::on_mouse_button(int button, int action, int mods) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  mouse_pos_last_click_ = mouse_pos();\n}\n\nvoid Window3D::on_mouse_move(const WindowPoint &mouse_pos) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const bool shift = held_keys().count(GLFW_KEY_LEFT_SHIFT) == 1\n                         ? held_keys().at(GLFW_KEY_LEFT_SHIFT)\n                         : false;\n\n  const bool left = left_mouse_held() && !shift;\n  const bool right = right_mouse_held() || (shift && left_mouse_held());\n\n  \/\/ if (left || right) {\n  \/\/ glfwSetInputMode(get_window(), GLFW_CURSOR, GLFW_CURSOR_DISABLED);\n  \/\/ } else {\n  \/\/ glfwSetInputMode(get_window(), GLFW_CURSOR, GLFW_CURSOR_NORMAL);\n  \/\/ }\n\n  view_.apply_mouse(mouse_pos, mouse_pos_last_click_, left, right);\n\n  if (left || right) {\n    mouse_pos_last_click_ = mouse_pos;\n  }\n}\n\nvoid Window3D::on_scroll(const double amount) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n  view_.apply_scroll(amount);\n}\n\nvoid Window3D::resize(const GlSize &gl_size) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  glViewport(0, 0, gl_size.width, gl_size.height);\n  gl_size_ = gl_size;\n}\n\nvoid Window3D::draw_all_primitives() const {\n  for (const auto &primitive : primitives_) {\n    primitive->draw();\n  }\n}\n\nvoid Window3D::render() {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  \/\/\n  \/\/ Render cameras\n  \/\/\n  for (const auto &camera : cameras_) {\n    prepare_to_render();\n    camera->prepare_view();\n    draw_all_primitives();\n    camera->draw();\n  }\n\n  {  \/\/ Render main scene\n    set_perspective(gl_size_, orthogonal_projection_);\n    prepare_to_render();\n    apply_view(view_, !hide_axes_);\n    projection_ = Projection::get_from_current();\n    draw_all_primitives();\n  }\n\n  const double t_now = glfwGetTime();\n\n  const double dt = std::max(t_now - last_update_time_, 0.02);\n  view_.apply_keys(held_keys(), dt);\n  view_ = view_.simulate(dt);\n  last_update_time_ = t_now;\n\n  glFinish();\n}  \/\/ namespace viewer\n\nnamespace {\nstruct Window3DGlobalState {\n  std::map<std::string, std::shared_ptr<Window3D>> windows;\n};\n\nWindow3DGlobalState window_3d_state;\n\nWindow3DGlobalState &get_global_state() {\n  return window_3d_state;\n}\n}  \/\/ namespace\n\nstd::shared_ptr<Window3D> get_window3d(const std::string &title) {\n  const auto it = get_global_state().windows.find(title);\n  if (it != get_global_state().windows.end()) {\n    return it->second;\n  } else {\n    const GlSize gl_size(640, 640);\n    auto window = std::make_shared<Window3D>(gl_size);\n    get_global_state().windows[title] = window;\n    WindowManager::register_window(gl_size, window, title);\n    return window;\n  }\n}\n}  \/\/ namespace viewer\n<commit_msg>Small updates to window<commit_after>\/\/ inc order weird for these guys\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n\n\/\/%deps(opengl, glfw)\n\n#include \"viewer\/gl_aliases.hh\"\n#include \"viewer\/primitives\/simple_geometry_primitives.hh\"\n#include \"viewer\/window_3d.hh\"\n#include \"viewer\/window_manager.hh\"\n\n#include \"eigen_helpers.hh\"\n\n#include <map>\n#include <thread>\n\nnamespace viewer {\nnamespace {\n\nvoid apply_view(const OrbitCamera &view, bool show_axes) {\n  glMatrixMode(GL_MODELVIEW);\n  glLoadIdentity();\n\n  glTransform(view.camera_from_anchor());\n  glScaled(view.zoom(), view.zoom(), view.zoom());\n  if (show_axes) {\n    draw_axes({SE3(), 0.1 \/ view.zoom(), 3.0});\n  }\n\n  glTransform(view.anchor_from_world());\n  if (show_axes) {\n    draw_axes({SE3(), 0.2 \/ view.zoom(), 3.0});\n  }\n}\n\nvoid prepare_to_render() {\n  \/\/\n  \/\/ Flag soup\n  \/\/\n\n  glShadeModel(GL_SMOOTH);\n\n  \/\/ Check depth when rendering\n  glEnable(GL_DEPTH_TEST);\n\n  \/\/ Turn on lighting\n  \/\/ glEnable(GL_LIGHTING);\n\n  glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n  glEnable(GL_BLEND);\n  glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n  glEnable(GL_SAMPLE_ALPHA_TO_COVERAGE);\n  glEnable(GL_LINE_SMOOTH);\n  glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\n\n  glEnable(GL_MULTISAMPLE);\n}\n\nvoid set_perspective(const GlSize &gl_size, bool ortho = false) {\n  glViewport(0, 0, gl_size.width, gl_size.height);\n  glMatrixMode(GL_PROJECTION);\n\n  glLoadIdentity();\n\n  constexpr double NEAR_CLIP = 0.001;\n  constexpr double FAR_CLIP = 1000.0;\n  const double aspect_ratio =\n      (static_cast<double>(gl_size.width) \/ static_cast<double>(gl_size.height));\n  if (ortho) {\n    glOrtho(-aspect_ratio, aspect_ratio, -1.0, 1.0, NEAR_CLIP, FAR_CLIP);\n  } else {\n    constexpr double FOV = 60.0;\n    gluPerspective(FOV, aspect_ratio, NEAR_CLIP, FAR_CLIP);\n  }\n}\n\n}  \/\/ namespace\n\nWindow3D::Window3D(const GlSize &gl_size) : gl_size_(gl_size) {\n  set_view_preset(ViewSetting::STANDARD);\n}\n\nvoid Window3D::set_view_preset(const ViewSetting &setting) {\n  switch (setting) {\n    case ViewSetting::STANDARD: {\n      set_target_from_world(SE3(SO3::exp(Eigen::Vector3d(-3.1415 * 0.5, 0.0, 0.0)),\n                                Eigen::Vector3d::Zero()));\n      break;\n    }\n    case ViewSetting::CAMERA: {\n      set_target_from_world(\n          SE3(SO3::exp(Eigen::Vector3d::Zero()), Eigen::Vector3d::Zero()));\n      break;\n    }\n  }\n}\n\nvoid Window3D::spin_until_step() {\n  while (!should_step_ && !should_continue_ && !should_close()) {\n    std::this_thread::sleep_for(std::chrono::milliseconds(10));\n  }\n\n  if (should_continue_ && !should_close()) {\n    std::this_thread::sleep_for(std::chrono::milliseconds(continue_ms_));\n  }\n\n  if (should_step_) {\n    should_step_ = false;\n  }\n}\n\nvoid Window3D::on_key(int key, int scancode, int action, int mods) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const char key_char = static_cast<char>(key);\n\n  if (action == GLFW_PRESS) {\n    \/\/\n    \/\/ Toggling\n    \/\/\n    if (key_mappings_.count(key_char) != 0) {\n      const std::string toggle_name = key_mappings_.at(key_char);\n      toggles_[toggle_name] = !toggles_[toggle_name];\n      const bool new_toggle_state = toggles_[toggle_name];\n      for (const auto &toggle_callback : toggle_callbacks_[toggle_name]) {\n        toggle_callback(new_toggle_state);\n      }\n    }\n\n    \/\/\n    \/\/ Navigation UI management\n    \/\/\n    if (key_char == 'N') {\n      should_step_ = true;\n    }\n\n    if (key_char == 'C') {\n      should_continue_ = !should_continue_;\n    }\n\n    if (key_char == 'O') {\n      orthogonal_projection_ = !orthogonal_projection_;\n    }\n    if (key_char == 'H') {\n      hide_axes_ = !hide_axes_;\n    }\n  }\n}\nvoid Window3D::on_mouse_button(int button, int action, int mods) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const auto current_mouse_pos = mouse_pos();\n  const auto ray = projection_.unproject(current_mouse_pos);\n\n  \/\/\/\n  \/\/\/ TODO: Refactor this out!\n  \/\/\/\n  \/\/ click_callback_manager.handle_callbacks(ray);\n\n  mouse_pos_last_click_ = current_mouse_pos;\n}\n\nvoid Window3D::on_mouse_move(const WindowPoint &mouse_pos) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  const bool shift = held_keys().count(GLFW_KEY_LEFT_SHIFT) == 1\n                         ? held_keys().at(GLFW_KEY_LEFT_SHIFT)\n                         : false;\n\n  const bool left = left_mouse_held() && !shift;\n  const bool right = right_mouse_held() || (shift && left_mouse_held());\n\n  \/\/ if (left || right) {\n  \/\/ glfwSetInputMode(get_window(), GLFW_CURSOR, GLFW_CURSOR_DISABLED);\n  \/\/ } else {\n  \/\/ glfwSetInputMode(get_window(), GLFW_CURSOR, GLFW_CURSOR_NORMAL);\n  \/\/ }\n\n  view_.apply_mouse(mouse_pos, mouse_pos_last_click_, left, right);\n\n  if (left || right) {\n    mouse_pos_last_click_ = mouse_pos;\n  }\n}\n\nvoid Window3D::on_scroll(const double amount) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n  view_.apply_scroll(amount);\n}\n\nvoid Window3D::resize(const GlSize &gl_size) {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  glViewport(0, 0, gl_size.width, gl_size.height);\n  gl_size_ = gl_size;\n}\n\nvoid Window3D::draw_all_primitives() const {\n  for (const auto &primitive : primitives_) {\n    primitive->draw();\n  }\n}\n\nvoid Window3D::render() {\n  const std::lock_guard<std::mutex> lk(behavior_mutex_);\n\n  \/\/\n  \/\/ Render cameras\n  \/\/\n  for (const auto &camera : cameras_) {\n    prepare_to_render();\n    camera->prepare_view();\n    draw_all_primitives();\n    camera->draw();\n  }\n\n  {  \/\/ Render main scene\n    set_perspective(gl_size_, orthogonal_projection_);\n    prepare_to_render();\n    apply_view(view_, !hide_axes_);\n    projection_ = Projection::get_from_current();\n    draw_all_primitives();\n  }\n\n  const double t_now = glfwGetTime();\n\n  const double dt = std::max(t_now - last_update_time_, 0.02);\n  view_.apply_keys(held_keys(), dt);\n  view_ = view_.simulate(dt);\n  last_update_time_ = t_now;\n\n  glFinish();\n}  \/\/ namespace viewer\n\nnamespace {\nstruct Window3DGlobalState {\n  std::map<std::string, std::shared_ptr<Window3D>> windows;\n};\n\nWindow3DGlobalState window_3d_state;\n\nWindow3DGlobalState &get_global_state() {\n  return window_3d_state;\n}\n}  \/\/ namespace\n\nstd::shared_ptr<Window3D> get_window3d(const std::string &title) {\n  const auto it = get_global_state().windows.find(title);\n  if (it != get_global_state().windows.end()) {\n    return it->second;\n  } else {\n    const GlSize gl_size(640, 640);\n    auto window = std::make_shared<Window3D>(gl_size);\n    get_global_state().windows[title] = window;\n    WindowManager::register_window(gl_size, window, title);\n    return window;\n  }\n}\n}  \/\/ namespace viewer\n<|endoftext|>"}
{"text":"<commit_before>#ifndef BASE_STAIR_DETECTOR_H_\n#define BASE_STAIR_DETECTOR_H_\n\n#include <vector>\n#include <algorithm>\n\n#include <pcl\/visualization\/cloud_viewer.h>\n\n#include \"lepp2\/VideoObserver.hpp\"\n#include \"lepp2\/BaseSegmenter.hpp\"\n#include \"lepp2\/NoopSegmenter.hpp\"\n#include \"lepp2\/StairSegmenter.hpp\"\n#include \"lepp2\/StairAggregator.hpp\"\n#include \"lepp2\/ObjectApproximator.hpp\"\n#include \"lepp2\/MomentOfInertiaApproximator.hpp\"\n#include \"lepp2\/SplitApproximator.hpp\"\n\nusing namespace lepp;\n\n#include \"lepp2\/debug\/timer.hpp\"\n\ntemplate<class PointT>\nclass StairDetector : public lepp::VideoObserver<PointT> {\n\n  public:\n    StairDetector();\n    virtual ~StairDetector() {}\n\n    \/**\n     * VideoObserver interface method implementation.\n     *\/\n    virtual void notifyNewFrame(\n        int idx,\n        const typename pcl::PointCloud<PointT>::ConstPtr& point_cloud);\n    \/**\n       * Attaches a new ObstacleAggregator, which will be notified of newly detected\n       * obstacles by this detector.\n       *\/\n    void attachStairAggregator(boost::shared_ptr<StairAggregator<PointT> > aggregator);\n\n  protected:\n    \/\/\/ Helper typedefs to make the implementation cleaner\n    typedef pcl::PointCloud<PointT> PointCloudT;\n    typedef typename PointCloudT::Ptr PointCloudPtr;\n    typedef typename PointCloudT::ConstPtr CloudConstPtr;\n\n    \/**\n     * Notifies any observers about newly detected stairs.\n     *\/\n    void notifyStairs(std::vector<CloudConstPtr> stairs);\n\n  private:\n\n    typename pcl::PointCloud<PointT>::ConstPtr cloud_;\n\n    \/**\n     * Tracks all attached ObstacleAggregators that wish to be notified of newly\n     * detected obstacles.\n     *\/\n    std::vector<boost::shared_ptr<StairAggregator<PointT> > > aggregators;\n\n    boost::shared_ptr<BaseSegmenter<PointT> > segmenter_;\n    boost::shared_ptr<ObjectApproximator<PointT> > approximator_;\n\n    \/**\n     * Performs a new update of the obstacle approximations.\n     * Triggered when the detector is notified of a new frame (i.e. point cloud).\n     *\/\n    void update();\n};\n\ntemplate<class PointT>\nStairDetector<PointT>::StairDetector()\n    : approximator_(new SplitObjectApproximator<PointT>(\n        boost::shared_ptr<ObjectApproximator<PointT> >(\n          new MomentOfInertiaObjectApproximator<PointT>))),\n      segmenter_(new StairSegmenter<PointT>()) {\n}\n\ntemplate<class PointT>\nvoid StairDetector<PointT>::notifyNewFrame(\n    int id,\n    const typename pcl::PointCloud<PointT>::ConstPtr& point_cloud) {\n  cloud_ = point_cloud;\n  try {\n    update();\n  } catch (...) {\n    std::cerr << \"ObstacleDetector: Obstacle detection failed ...\" << std::endl;\n  }\n}\n\ntemplate<class PointT>\nvoid StairDetector<PointT>::update() {\n\n  Timer t;\n  t.start();\n  std::vector<CloudConstPtr> stairs(segmenter_->segment(cloud_));\n  t.stop();\n  std::cerr << \"Stair segmentation took \" << t.duration() << std::endl;\n\n  notifyStairs(stairs);\n\n\/\/  \/\/ Iteratively approximate the segments\n\/\/  size_t segment_count = segments.size();\n\/\/  std::vector<ObjectModelPtr> models;\n\/\/  for (size_t i = 0; i < segment_count; ++i) {\n\/\/    models.push_back(approximator_->approximate(segments[i]));\n\/\/  }\n\n\/\/  std::cerr << \"Obstacle detection took \" << t.duration() << std::endl;\n\/\/\n\/\/  notifyObstacles(models);\n}\n\ntemplate<class PointT>\nvoid StairDetector<PointT>::attachStairAggregator(\n    boost::shared_ptr<StairAggregator<PointT> > aggregator) {\n  aggregators.push_back(aggregator);\n}\n\ntemplate<class PointT>\nvoid StairDetector<PointT>::notifyStairs(std::vector<CloudConstPtr> stairs) {\n  size_t sz = aggregators.size();\n  for (size_t i = 0; i < sz; ++i) {\n    aggregators[i]->updateStairs(stairs);\n  }\n}\n\n#endif\n<commit_msg>Minor Cleanup StairDetector::update()<commit_after>#ifndef BASE_STAIR_DETECTOR_H_\n#define BASE_STAIR_DETECTOR_H_\n\n#include <vector>\n#include <algorithm>\n\n#include <pcl\/visualization\/cloud_viewer.h>\n\n#include \"lepp2\/VideoObserver.hpp\"\n#include \"lepp2\/BaseSegmenter.hpp\"\n#include \"lepp2\/NoopSegmenter.hpp\"\n#include \"lepp2\/StairSegmenter.hpp\"\n#include \"lepp2\/StairAggregator.hpp\"\n#include \"lepp2\/ObjectApproximator.hpp\"\n#include \"lepp2\/MomentOfInertiaApproximator.hpp\"\n#include \"lepp2\/SplitApproximator.hpp\"\n\nusing namespace lepp;\n\n#include \"lepp2\/debug\/timer.hpp\"\n\ntemplate<class PointT>\nclass StairDetector : public lepp::VideoObserver<PointT> {\n\n  public:\n    StairDetector();\n    virtual ~StairDetector() {}\n\n    \/**\n     * VideoObserver interface method implementation.\n     *\/\n    virtual void notifyNewFrame(\n        int idx,\n        const typename pcl::PointCloud<PointT>::ConstPtr& point_cloud);\n    \/**\n       * Attaches a new ObstacleAggregator, which will be notified of newly detected\n       * obstacles by this detector.\n       *\/\n    void attachStairAggregator(boost::shared_ptr<StairAggregator<PointT> > aggregator);\n\n  protected:\n    \/\/\/ Helper typedefs to make the implementation cleaner\n    typedef pcl::PointCloud<PointT> PointCloudT;\n    typedef typename PointCloudT::Ptr PointCloudPtr;\n    typedef typename PointCloudT::ConstPtr CloudConstPtr;\n\n    \/**\n     * Notifies any observers about newly detected stairs.\n     *\/\n    void notifyStairs(std::vector<CloudConstPtr> stairs);\n\n  private:\n\n    typename pcl::PointCloud<PointT>::ConstPtr cloud_;\n\n    \/**\n     * Tracks all attached ObstacleAggregators that wish to be notified of newly\n     * detected obstacles.\n     *\/\n    std::vector<boost::shared_ptr<StairAggregator<PointT> > > aggregators;\n\n    boost::shared_ptr<BaseSegmenter<PointT> > segmenter_;\n    boost::shared_ptr<ObjectApproximator<PointT> > approximator_;\n\n    \/**\n     * Performs a new update of the obstacle approximations.\n     * Triggered when the detector is notified of a new frame (i.e. point cloud).\n     *\/\n    void update();\n};\n\ntemplate<class PointT>\nStairDetector<PointT>::StairDetector()\n    : approximator_(new SplitObjectApproximator<PointT>(\n        boost::shared_ptr<ObjectApproximator<PointT> >(\n          new MomentOfInertiaObjectApproximator<PointT>))),\n      segmenter_(new StairSegmenter<PointT>()) {\n}\n\ntemplate<class PointT>\nvoid StairDetector<PointT>::notifyNewFrame(\n    int id,\n    const typename pcl::PointCloud<PointT>::ConstPtr& point_cloud) {\n  cloud_ = point_cloud;\n  try {\n    update();\n  } catch (...) {\n    std::cerr << \"ObstacleDetector: Obstacle detection failed ...\" << std::endl;\n  }\n}\n\ntemplate<class PointT>\nvoid StairDetector<PointT>::update() {\n\n  Timer t;\n  t.start();\n  std::vector<CloudConstPtr> stairs(segmenter_->segment(cloud_));\n  t.stop();\n  std::cerr << \"Stair segmentation took \" << t.duration() << std::endl;\n\n  t.start();\n  notifyStairs(stairs);\n  t.stop();\n  std::cerr << \"visualization took \" << t.duration() << std::endl;\n}\n\ntemplate<class PointT>\nvoid StairDetector<PointT>::attachStairAggregator(\n    boost::shared_ptr<StairAggregator<PointT> > aggregator) {\n  aggregators.push_back(aggregator);\n}\n\ntemplate<class PointT>\nvoid StairDetector<PointT>::notifyStairs(std::vector<CloudConstPtr> stairs) {\n  size_t sz = aggregators.size();\n  for (size_t i = 0; i < sz; ++i) {\n    aggregators[i]->updateStairs(stairs);\n  }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"gd.h\"\n#include \"vw.h\"\n#include \"lrq.h\"\n#include \"rand48.h\"\n#include <float.h>\n\nnamespace LRQ {\n\n  struct LRQstate {\n    vw* all;\n    bool lrindices[256];\n    size_t orig_size[256];\n    std::vector<std::string> lrpairs;\n    bool dropout;\n    uint64_t seed;\n    uint64_t initial_seed;\n  };\n}\n\nnamespace {\n  bool \n  valid_int (const char* s)\n    {\n      char* endptr;\n\n      int v = strtoul (s, &endptr, 0);\n      (void) v;\n\n      return (*s != '\\0' && *endptr == '\\0');\n    }\n\n  inline bool\n  cheesyrbit (uint64_t& seed)\n    {\n      return merand48 (seed) > 0.5;\n    }\n\n  inline float\n  cheesyrand (uint32_t x)\n    {\n      uint64_t seed = x;\n\n      return merand48 (seed);\n    }\n\n  inline bool\n  example_is_test (example* ec)\n    {\n      return ec->test_only || (((label_data*) ec->ld)->label == FLT_MAX);\n    }\n\n  void\n  reset_seed (void* d)\n    {\n      LRQ::LRQstate* lrq = (LRQ::LRQstate*) d;\n\n      if (lrq->all->bfgs)\n        lrq->seed = lrq->initial_seed;\n    }\n}\n\nnamespace LRQ {\n\n  void learn(void* d, learner& base, example* ec)\n  {\n    LRQstate* lrq = (LRQstate*) d;\n    vw& all = *lrq->all;\n\n    \/\/ Remember original features\n        \n    for (unsigned char* i = ec->indices.begin; i != ec->indices.end; ++i)\n      {\n        if (lrq->lrindices[*i])\n          lrq->orig_size[*i] = ec->atomics[*i].size ();\n      }\n\n    size_t which = ec->example_counter;\n    simple_prediction first_prediction;\n    float first_loss;\n    unsigned int maxiter = (all.training && ! example_is_test (ec)) ? 2 : 1;\n\n    bool do_dropout = lrq->dropout && all.training && ! example_is_test (ec);\n    float scale = (! lrq->dropout || do_dropout) ? 1.f : 0.5f;\n\n    for (unsigned int iter = 0; iter < maxiter; ++iter, ++which)\n      {\n        \/\/ Add left LRQ features, holding right LRQ features fixed\n        \/\/     and vice versa\n        \/\/ TODO: what happens with --lrq ab2 --lrq ac2\n        \/\/       i.e. namespace occurs multiple times (?)\n    \n        for (vector<string>::iterator i = lrq->lrpairs.begin ();\n             i != lrq->lrpairs.end ();\n             ++i)\n          {\n            unsigned char left = (*i)[which%2];\n            unsigned char right = (*i)[(which+1)%2];\n            unsigned int k = atoi (i->c_str () + 2);\n\n            for (unsigned int lfn = 0; lfn < lrq->orig_size[left]; ++lfn)\n              {\n                feature* lf = ec->atomics[left].begin + lfn;\n                float lfx = lf->x;\n                size_t lindex = lf->weight_index + ec->ft_offset;\n    \n                for (unsigned int n = 1; n <= k; ++n)\n                  {\n                    if (! do_dropout || cheesyrbit (lrq->seed))\n                      {\n                        uint32_t lwindex = (uint32_t)(lindex + n * all.reg.stride);\n\n                        float* lw = &all.reg.weight_vector[lwindex & all.reg.weight_mask];\n\n                        \/\/ perturb away from saddle point at (0, 0)\n                        if (all.training && ! example_is_test (ec) && *lw == 0)\n                          *lw = cheesyrand (lwindex);\n        \n                        for (unsigned int rfn = 0; \n                             rfn < lrq->orig_size[right]; \n                             ++rfn)\n                          {\n                            feature* rf = ec->atomics[right].begin + rfn;\n\n                            \/\/ NB: ec->ft_offset added by base learner\n                            float rfx = rf->x;\n                            size_t rindex = rf->weight_index;\n                            uint32_t rwindex = (uint32_t)(rindex + n * all.reg.stride);\n        \n                            feature lrq; \n                            lrq.x = scale * *lw * lfx * rfx;\n                            lrq.weight_index = rwindex; \n\n                            ec->atomics[right].push_back (lrq);\n\n                            if (all.audit)\n                              {\n                                char name[4] = { 'l', 'r', 'q', '\\0' };\n                                char subname[4] = { left, '^', right, '\\0' };\n                                audit_data ad = { name, subname, lrq.weight_index, lrq.x, false };\n                                ec->audit_features[right].push_back (ad);\n                              }\n                          }\n                      }\n                  }\n              }\n          }\n\n        base.learn(ec);\/\/Recursive Call\n\n        \/\/ Restore example\n\n        if (iter == 0)\n          {\n            first_prediction = ec->final_prediction;\n            first_loss = ec->loss;\n          }\n        else\n          {\n            ec->final_prediction = first_prediction;\n            ec->loss = first_loss;\n          }\n\n        for (vector<string>::iterator i = lrq->lrpairs.begin ();\n             i != lrq->lrpairs.end ();\n             ++i)\n          {\n            unsigned char right = (*i)[(which+1)%2];\n\n            ec->atomics[right].end = \n              ec->atomics[right].begin + lrq->orig_size[right];\n\n            if (all.audit)\n              ec->audit_features[right].end = \n                ec->audit_features[right].begin + lrq->orig_size[right];\n          }\n      }\n  }\n\n  learner* setup(vw& all, std::vector<std::string>&opts, po::variables_map& vm, po::variables_map& vm_file)\n  {\/\/parse and set arguments\n    LRQstate* lrq = (LRQstate*) calloc (1, sizeof (LRQstate));\n    unsigned int maxk = 0;\n    lrq->all = &all;\n\n    size_t random_seed = 0;\n    if (vm.count(\"random_seed\")) random_seed = vm[\"random_seed\"].as<size_t> ();\n    if (vm_file.count(\"random_seed\")) random_seed = vm_file[\"random_seed\"].as<size_t> ();\n\n    lrq->initial_seed = lrq->seed = random_seed | 8675309;\n    lrq->dropout = vm.count(\"lrqdropout\") || vm_file.count(\"lrqdropout\");\n\n    if (lrq->dropout && !vm_file.count(\"lrqdropout\"))\n      all.options_from_file.append(\"--lrqdropout\");\n\n    if (!vm_file.count(\"lrq\"))\n      {\n        lrq->lrpairs = vm[\"lrq\"].as<vector<string> > ();\n\n        \/\/ TODO: doesn't work for non-printable stuff\n        \n        stringstream ss;\n        for (vector<string>::iterator i = lrq->lrpairs.begin (); \n             i != lrq->lrpairs.end (); \n             ++i)\n          {\n            ss << \" --lrq \" << *i;\n          }\n\n        all.options_from_file.append(ss.str());\n      }\n    else\n      lrq->lrpairs = vm_file[\"lrq\"].as<vector<string> > ();\n\n    if (! all.quiet)\n      {\n        cerr << \"creating low rank quadratic features for pairs: \";\n        if (lrq->dropout)\n          cerr << \"(using dropout) \";\n      }\n\n    for (vector<string>::iterator i = lrq->lrpairs.begin (); \n         i != lrq->lrpairs.end (); \n         ++i)\n      {\n        if(!all.quiet){\n          if (( i->length() < 3 ) || ! valid_int (i->c_str () + 2)) {\n            cerr << endl << \"error, low-rank quadratic features must involve two sets and a rank.\\n\";\n            throw exception();\n          }\n          cerr << *i << \" \";\n        }\n        \/\/ TODO: colon-syntax\n        \n        unsigned int k = atoi (i->c_str () + 2);\n\n        lrq->lrindices[(int) (*i)[0]] = 1;\n        lrq->lrindices[(int) (*i)[1]] = 1;\n\n        maxk = max (maxk, k);\n      }\n\n    if(!all.quiet)\n      cerr<<endl;\n        \n    all.wpp = all.wpp * (1 + maxk);\n    learner* l = new learner(lrq, learn, all.l, 1 + maxk);\n    l->set_end_pass (reset_seed);\n\n    \/\/ TODO: leaks memory ?\n    return l;\n  }\n}\n<commit_msg>options save bugfix<commit_after>#include \"gd.h\"\n#include \"vw.h\"\n#include \"lrq.h\"\n#include \"rand48.h\"\n#include <float.h>\n\nnamespace LRQ {\n\n  struct LRQstate {\n    vw* all;\n    bool lrindices[256];\n    size_t orig_size[256];\n    std::vector<std::string> lrpairs;\n    bool dropout;\n    uint64_t seed;\n    uint64_t initial_seed;\n  };\n}\n\nnamespace {\n  bool \n  valid_int (const char* s)\n    {\n      char* endptr;\n\n      int v = strtoul (s, &endptr, 0);\n      (void) v;\n\n      return (*s != '\\0' && *endptr == '\\0');\n    }\n\n  inline bool\n  cheesyrbit (uint64_t& seed)\n    {\n      return merand48 (seed) > 0.5;\n    }\n\n  inline float\n  cheesyrand (uint32_t x)\n    {\n      uint64_t seed = x;\n\n      return merand48 (seed);\n    }\n\n  inline bool\n  example_is_test (example* ec)\n    {\n      return ec->test_only || (((label_data*) ec->ld)->label == FLT_MAX);\n    }\n\n  void\n  reset_seed (void* d)\n    {\n      LRQ::LRQstate* lrq = (LRQ::LRQstate*) d;\n\n      if (lrq->all->bfgs)\n        lrq->seed = lrq->initial_seed;\n    }\n}\n\nnamespace LRQ {\n\n  void learn(void* d, learner& base, example* ec)\n  {\n    LRQstate* lrq = (LRQstate*) d;\n    vw& all = *lrq->all;\n\n    \/\/ Remember original features\n        \n    for (unsigned char* i = ec->indices.begin; i != ec->indices.end; ++i)\n      {\n        if (lrq->lrindices[*i])\n          lrq->orig_size[*i] = ec->atomics[*i].size ();\n      }\n\n    size_t which = ec->example_counter;\n    simple_prediction first_prediction;\n    float first_loss;\n    unsigned int maxiter = (all.training && ! example_is_test (ec)) ? 2 : 1;\n\n    bool do_dropout = lrq->dropout && all.training && ! example_is_test (ec);\n    float scale = (! lrq->dropout || do_dropout) ? 1.f : 0.5f;\n\n    for (unsigned int iter = 0; iter < maxiter; ++iter, ++which)\n      {\n        \/\/ Add left LRQ features, holding right LRQ features fixed\n        \/\/     and vice versa\n        \/\/ TODO: what happens with --lrq ab2 --lrq ac2\n        \/\/       i.e. namespace occurs multiple times (?)\n    \n        for (vector<string>::iterator i = lrq->lrpairs.begin ();\n             i != lrq->lrpairs.end ();\n             ++i)\n          {\n            unsigned char left = (*i)[which%2];\n            unsigned char right = (*i)[(which+1)%2];\n            unsigned int k = atoi (i->c_str () + 2);\n\n            for (unsigned int lfn = 0; lfn < lrq->orig_size[left]; ++lfn)\n              {\n                feature* lf = ec->atomics[left].begin + lfn;\n                float lfx = lf->x;\n                size_t lindex = lf->weight_index + ec->ft_offset;\n    \n                for (unsigned int n = 1; n <= k; ++n)\n                  {\n                    if (! do_dropout || cheesyrbit (lrq->seed))\n                      {\n                        uint32_t lwindex = (uint32_t)(lindex + n * all.reg.stride);\n\n                        float* lw = &all.reg.weight_vector[lwindex & all.reg.weight_mask];\n\n                        \/\/ perturb away from saddle point at (0, 0)\n                        if (all.training && ! example_is_test (ec) && *lw == 0)\n                          *lw = cheesyrand (lwindex);\n        \n                        for (unsigned int rfn = 0; \n                             rfn < lrq->orig_size[right]; \n                             ++rfn)\n                          {\n                            feature* rf = ec->atomics[right].begin + rfn;\n\n                            \/\/ NB: ec->ft_offset added by base learner\n                            float rfx = rf->x;\n                            size_t rindex = rf->weight_index;\n                            uint32_t rwindex = (uint32_t)(rindex + n * all.reg.stride);\n        \n                            feature lrq; \n                            lrq.x = scale * *lw * lfx * rfx;\n                            lrq.weight_index = rwindex; \n\n                            ec->atomics[right].push_back (lrq);\n\n                            if (all.audit)\n                              {\n                                char name[4] = { 'l', 'r', 'q', '\\0' };\n                                char subname[4] = { left, '^', right, '\\0' };\n                                audit_data ad = { name, subname, lrq.weight_index, lrq.x, false };\n                                ec->audit_features[right].push_back (ad);\n                              }\n                          }\n                      }\n                  }\n              }\n          }\n\n        base.learn(ec);\/\/Recursive Call\n\n        \/\/ Restore example\n\n        if (iter == 0)\n          {\n            first_prediction = ec->final_prediction;\n            first_loss = ec->loss;\n          }\n        else\n          {\n            ec->final_prediction = first_prediction;\n            ec->loss = first_loss;\n          }\n\n        for (vector<string>::iterator i = lrq->lrpairs.begin ();\n             i != lrq->lrpairs.end ();\n             ++i)\n          {\n            unsigned char right = (*i)[(which+1)%2];\n\n            ec->atomics[right].end = \n              ec->atomics[right].begin + lrq->orig_size[right];\n\n            if (all.audit)\n              ec->audit_features[right].end = \n                ec->audit_features[right].begin + lrq->orig_size[right];\n          }\n      }\n  }\n\n  learner* setup(vw& all, std::vector<std::string>&opts, po::variables_map& vm, po::variables_map& vm_file)\n  {\/\/parse and set arguments\n    LRQstate* lrq = (LRQstate*) calloc (1, sizeof (LRQstate));\n    unsigned int maxk = 0;\n    lrq->all = &all;\n\n    size_t random_seed = 0;\n    if (vm.count(\"random_seed\")) random_seed = vm[\"random_seed\"].as<size_t> ();\n    if (vm_file.count(\"random_seed\")) random_seed = vm_file[\"random_seed\"].as<size_t> ();\n\n    lrq->initial_seed = lrq->seed = random_seed | 8675309;\n    lrq->dropout = vm.count(\"lrqdropout\") || vm_file.count(\"lrqdropout\");\n\n    if (lrq->dropout && !vm_file.count(\"lrqdropout\"))\n      all.options_from_file.append(\" --lrqdropout\");\n\n    if (!vm_file.count(\"lrq\"))\n      {\n        lrq->lrpairs = vm[\"lrq\"].as<vector<string> > ();\n\n        \/\/ TODO: doesn't work for non-printable stuff\n        \n        stringstream ss;\n        for (vector<string>::iterator i = lrq->lrpairs.begin (); \n             i != lrq->lrpairs.end (); \n             ++i)\n          {\n            ss << \" --lrq \" << *i;\n          }\n\n        all.options_from_file.append(ss.str());\n      }\n    else\n      lrq->lrpairs = vm_file[\"lrq\"].as<vector<string> > ();\n\n    if (! all.quiet)\n      {\n        cerr << \"creating low rank quadratic features for pairs: \";\n        if (lrq->dropout)\n          cerr << \"(using dropout) \";\n      }\n\n    for (vector<string>::iterator i = lrq->lrpairs.begin (); \n         i != lrq->lrpairs.end (); \n         ++i)\n      {\n        if(!all.quiet){\n          if (( i->length() < 3 ) || ! valid_int (i->c_str () + 2)) {\n            cerr << endl << \"error, low-rank quadratic features must involve two sets and a rank.\\n\";\n            throw exception();\n          }\n          cerr << *i << \" \";\n        }\n        \/\/ TODO: colon-syntax\n        \n        unsigned int k = atoi (i->c_str () + 2);\n\n        lrq->lrindices[(int) (*i)[0]] = 1;\n        lrq->lrindices[(int) (*i)[1]] = 1;\n\n        maxk = max (maxk, k);\n      }\n\n    if(!all.quiet)\n      cerr<<endl;\n        \n    all.wpp = all.wpp * (1 + maxk);\n    learner* l = new learner(lrq, learn, all.l, 1 + maxk);\n    l->set_end_pass (reset_seed);\n\n    \/\/ TODO: leaks memory ?\n    return l;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @file   generalAction.hpp\n\/\/\/ @brief  Defines the base class for any kind of action.\n\/\/\/ @author Enrico Fraccaroli\n\/\/\/ @date   Jul 13 2016\n\/\/\/ @copyright\n\/\/\/ Copyright (c) 2016 Enrico Fraccaroli <enrico.fraccaroli@gmail.com>\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 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#pragma once\n\n#include \"..\/production.hpp\"\n#include \"..\/building.hpp\"\n#include \"..\/defines.hpp\"\n#include \"..\/utils.hpp\"\n#include \"..\/item.hpp\"\n#include \"..\/opponent.hpp\"\n\n\/\/\/ The list of possible actions.\ntypedef enum class ActionTypes\n{\n    \/\/\/ The character is doing common action.\n    Wait,\n    \/\/\/ The character is moving to another location.\n    Move,\n    \/\/\/ The character is crafting something.\n    Crafting,\n    \/\/\/ The character is crafting something.\n    Building,\n    \/\/\/ The character is fighting.\n    Combat\n} ActionType;\n\n\/\/\/ The list of possible actions.\ntypedef enum class ActionStatus_t\n{\n    \/\/\/ The action is still running.\n    Running,\n    \/\/\/ The action has encountered an error.\n    Error\n} ActionStatus;\n\nclass GeneralAction\n{\n    protected:\n        \/\/\/ Actor of the action.\n        Character * actor;\n        \/\/\/ The time point in the future needed by the action to complete.\n        TimeClock actionCooldown;\n        \/\/\/ The status of the action.\n        ActionStatus actionStatus;\n\n    public:\n        \/\/\/ @brief Constructor.\n        GeneralAction(Character * _actor);\n\n        \/\/\/ @brief Constructor.\n        GeneralAction(Character * _actor, TimeClock _actionCooldown);\n\n        \/\/\/ @brief Destructor.\n        virtual ~GeneralAction();\n\n        \/\/\/ @brief Check if the cooldown of the action is elapsed.\n        \/\/\/ @return <b>True<\/b> if the time has passed,<br>\n        \/\/\/         <b>False<\/b> otherwise.\n        bool checkElapsed() const;\n\n        \/\/\/ @brief Checks the correctness of the action's values.\n        \/\/\/ @return <b>True<\/b> if it has correct values,<br>\n        \/\/\/         <b>False<\/b> otherwise.\n        virtual bool check() const;\n\n        \/\/\/ @brief Provides the type of the action.\n        \/\/\/ @return The type of action.\n        virtual ActionType getType() const;\n\n        \/\/\/ @brief Provides the description of the action.\n        \/\/\/ @return The string which describe the current action.\n        virtual std::string getDescription() const;\n\n        \/\/\/ @brief Stops the current action and returns a string which describe the intterruption.\n        \/\/\/ @return The stopping description.\n        virtual std::string stop();\n\n        \/\/\/ @brief Performs the current action.\n        \/\/\/ @return <b>True<\/b> if the action is finished,<br>\n        \/\/\/         <b>False<\/b> otherwise.\n        virtual bool perform();\n\n        ActionStatus getActionStatus() const;\n\n};\n\n\/\/\/ @addtogroup EnumToString\n\/\/\/ @{\n\n\/\/\/ Return the string describing the type of Action.\nstd::string GetActionTypeName(ActionType type);\n\n\/\/\/ @}\n<commit_msg>Add finish enum to ActionStatus<commit_after>\/\/\/ @file   generalAction.hpp\n\/\/\/ @brief  Defines the base class for any kind of action.\n\/\/\/ @author Enrico Fraccaroli\n\/\/\/ @date   Jul 13 2016\n\/\/\/ @copyright\n\/\/\/ Copyright (c) 2016 Enrico Fraccaroli <enrico.fraccaroli@gmail.com>\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 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#pragma once\n\n#include \"..\/production.hpp\"\n#include \"..\/building.hpp\"\n#include \"..\/defines.hpp\"\n#include \"..\/utils.hpp\"\n#include \"..\/item.hpp\"\n#include \"..\/opponent.hpp\"\n\n\/\/\/ The list of possible actions.\ntypedef enum class ActionTypes\n{\n    \/\/\/ The character is doing common action.\n    Wait,\n    \/\/\/ The character is moving to another location.\n    Move,\n    \/\/\/ The character is crafting something.\n    Crafting,\n    \/\/\/ The character is crafting something.\n    Building,\n    \/\/\/ The character is fighting.\n    Combat\n} ActionType;\n\n\/\/\/ The list of possible actions.\ntypedef enum class ActionStatus_t\n{\n    \/\/\/ The action is finished.\n    Finished,\n    \/\/\/ The action is still running.\n    Running,\n    \/\/\/ The action has encountered an error.\n    Error\n} ActionStatus;\n\nclass GeneralAction\n{\n    protected:\n        \/\/\/ Actor of the action.\n        Character * actor;\n        \/\/\/ The time point in the future needed by the action to complete.\n        TimeClock actionCooldown;\n\n    public:\n        \/\/\/ @brief Constructor.\n        GeneralAction(Character * _actor);\n\n        \/\/\/ @brief Constructor.\n        GeneralAction(Character * _actor, TimeClock _actionCooldown);\n\n        \/\/\/ @brief Destructor.\n        virtual ~GeneralAction();\n\n        \/\/\/ @brief Check if the cooldown of the action is elapsed.\n        \/\/\/ @return <b>True<\/b> if the time has passed,<br>\n        \/\/\/         <b>False<\/b> otherwise.\n        bool checkElapsed() const;\n\n        \/\/\/ @brief Checks the correctness of the action's values.\n        \/\/\/ @return <b>True<\/b> if it has correct values,<br>\n        \/\/\/         <b>False<\/b> otherwise.\n        virtual bool check() const;\n\n        \/\/\/ @brief Provides the type of the action.\n        \/\/\/ @return The type of action.\n        virtual ActionType getType() const;\n\n        \/\/\/ @brief Provides the description of the action.\n        \/\/\/ @return The string which describe the current action.\n        virtual std::string getDescription() const;\n\n        \/\/\/ @brief Stops the current action and returns a string which describe the intterruption.\n        \/\/\/ @return The stopping description.\n        virtual std::string stop();\n\n        \/\/\/ @brief Performs the current action.\n        \/\/\/ @return the status after performing the action.\n        virtual ActionStatus perform();\n};\n\n\/\/\/ @addtogroup EnumToString\n\/\/\/ @{\n\n\/\/\/ Return the string describing the type of Action.\nstd::string GetActionTypeName(ActionType type);\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 <libtorrent\/session.hpp>\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nvoid bind_session_settings()\n{\n    class_<session_settings>(\"session_settings\")\n        .def_readwrite(\"user_agent\", &session_settings::user_agent)\n        .def_readwrite(\"tracker_completion_timeout\", &session_settings::tracker_completion_timeout)\n        .def_readwrite(\"tracker_receive_timeout\", &session_settings::tracker_receive_timeout)\n        .def_readwrite(\"stop_tracker_timeout\", &session_settings::stop_tracker_timeout)\n        .def_readwrite(\"tracker_maximum_response_length\", &session_settings::tracker_maximum_response_length)\n        .def_readwrite(\"piece_timeout\", &session_settings::piece_timeout)\n        .def_readwrite(\"request_timeout\", &session_settings::request_timeout)\n        .def_readwrite(\"request_queue_time\", &session_settings::request_queue_time)\n        .def_readwrite(\"max_allowed_in_request_queue\", &session_settings::max_allowed_in_request_queue)\n        .def_readwrite(\"max_out_request_queue\", &session_settings::max_out_request_queue)\n        .def_readwrite(\"whole_pieces_threshold\", &session_settings::whole_pieces_threshold)\n        .def_readwrite(\"peer_timeout\", &session_settings::peer_timeout)\n        .def_readwrite(\"urlseed_timeout\", &session_settings::urlseed_timeout)\n        .def_readwrite(\"urlseed_pipeline_size\", &session_settings::urlseed_pipeline_size)\n        .def_readwrite(\"urlseed_wait_retry\", &session_settings::urlseed_wait_retry)\n        .def_readwrite(\"file_pool_size\", &session_settings::file_pool_size)\n        .def_readwrite(\"allow_multiple_connections_per_ip\", &session_settings::allow_multiple_connections_per_ip)\n        .def_readwrite(\"max_failcount\", &session_settings::max_failcount)\n        .def_readwrite(\"min_reconnect_time\", &session_settings::min_reconnect_time)\n        .def_readwrite(\"peer_connect_timeout\", &session_settings::peer_connect_timeout)\n        .def_readwrite(\"ignore_limits_on_local_network\", &session_settings::ignore_limits_on_local_network)\n        .def_readwrite(\"connection_speed\", &session_settings::connection_speed)\n        .def_readwrite(\"send_redundant_have\", &session_settings::send_redundant_have)\n        .def_readwrite(\"lazy_bitfields\", &session_settings::lazy_bitfields)\n        .def_readwrite(\"inactivity_timeout\", &session_settings::inactivity_timeout)\n        .def_readwrite(\"unchoke_interval\", &session_settings::unchoke_interval)\n        .def_readwrite(\"optimistic_unchoke_multiplier\", &session_settings::optimistic_unchoke_multiplier)\n        .def_readwrite(\"num_want\", &session_settings::num_want)\n        .def_readwrite(\"initial_picker_threshold\", &session_settings::initial_picker_threshold)\n        .def_readwrite(\"allowed_fast_set_size\", &session_settings::allowed_fast_set_size)\n        .def_readwrite(\"max_outstanding_disk_bytes_per_connection\", &session_settings::max_outstanding_disk_bytes_per_connection)\n        .def_readwrite(\"handshake_timeout\", &session_settings::handshake_timeout)\n#ifndef TORRENT_DISABLE_DHT\n        .def_readwrite(\"use_dht_as_fallback\", &session_settings::use_dht_as_fallback)\n#endif\n        .def_readwrite(\"free_torrent_hashes\", &session_settings::free_torrent_hashes)\n        .def_readwrite(\"upnp_ignore_nonrouters\", &session_settings::upnp_ignore_nonrouters)\n        .def_readwrite(\"send_buffer_watermark\", &session_settings::send_buffer_watermark)\n        .def_readwrite(\"auto_upload_slots\", &session_settings::auto_upload_slots)\n        .def_readwrite(\"auto_upload_slots_rate_based\", &session_settings::auto_upload_slots_rate_based)\n        .def_readwrite(\"use_parole_mode\", &session_settings::use_parole_mode)\n        .def_readwrite(\"cache_size\", &session_settings::cache_size)\n        .def_readwrite(\"cache_buffer_chunk_size\", &session_settings::cache_buffer_chunk_size)\n        .def_readwrite(\"cache_expiry\", &session_settings::cache_expiry)\n        .def_readwrite(\"use_read_cache\", &session_settings::use_read_cache)\n        .def_readwrite(\"disk_io_write_mode\", &session_settings::disk_io_write_mode)\n        .def_readwrite(\"disk_io_read_mode\", &session_settings::disk_io_read_mode)\n        .def_readwrite(\"coalesce_reads\", &session_settings::coalesce_reads)\n        .def_readwrite(\"coalesce_writes\", &session_settings:coalesce_writes)\n        .def_readwrite(\"outgoing_ports\", &session_settings::outgoing_ports)\n        .def_readwrite(\"peer_tos\", &session_settings::peer_tos)\n        .def_readwrite(\"active_downloads\", &session_settings::active_downloads)\n        .def_readwrite(\"active_seeds\", &session_settings::active_seeds)\n        .def_readwrite(\"active_limit\", &session_settings::active_limit)\n        .def_readwrite(\"auto_manage_prefer_seeds\", &session_settings::automanaged_prefer_seeds)\n        .def_readwrite(\"dont_count_slow_torrents\", &session_settings::dont_count_slow_torrents)\n        .def_readwrite(\"auto_manage_interval\", &session_settings::auto_manage_interval)\n        .def_readwrite(\"share_ratio_limit\", &session_settings::share_ratio_limit)\n        .def_readwrite(\"seed_time_ratio_limit\", &session_settings::seed_time_ratio_limit)\n        .def_readwrite(\"seed_time_limit\", &session_settings::seed_time_limit)\n        .def_readwrite(\"peer_turnover\", &session_settings::peer_turnover)\n        .def_readwrite(\"peer_turnover_cutoff\", &session_settings::peer_turnover_cutoff)\n        .def_readwrite(\"close_redundant_connections\", &session_settings::close_redundant_connections)\n        .def_readwrite(\"auto_scrape_interval\", &session_settings::auto_scrape_interval)\n        .def_readwrite(\"auto_scrape_min_interval\", &session_settings::auto_scrape_min_interval)\n        .def_readwrite(\"max_peerlist_size\", &session_settings::max_peerlist_size)\n        .def_readwrite(\"max_paused_peerlist_size\", &session_settings::max_paused_peerlist_size)\n        .def_readwrite(\"min_announce_interval\", &session_settings::min_announce_interval)\n        .def_readwrite(\"prioritize_partial_pieces\", &session_settings::prioritize_partial_pieces)\n        .def_readwrite(\"auto_manage_startup\", &session_settings::auto_manage_startup)\n        .def_readwrite(\"rate_limit_ip_overhead\", &session_settings::rate_limit_ip_overhead)\n        .def_readwrite(\"announce_to_all_trackers\", &session_settings::announce_to_all_trackers)\n        .def_readwrite(\"prefer_udp_trackers\", &session_settings::prefer_udp_trackers)\n        .def_readwrite(\"strict_super_seeding\", &session_settings::strict_super_seeding)\n        .def_readwrite(\"seeding_piece_quota\", &session_settings::seeding_piece_quota)\n        .def_readwrite(\"max_sparse_regions\", &session_settings::max_sparse_regions)\n#ifndef TORRENT_DISABLE_MLOCK\n        .def_readwrite(\"lock_disk_cache\", &session_settings::lock_disk_cache)\n#endif\n        .def_readwrite(\"max_rejects\", &session_settings::max_rejects)\n        .def_readwrite(\"recv_socket_buffer_size\", &session_settings::recv_socket_buffer_size)\n        .def_readwrite(\"send_socket_buffer_size\", &session_settings::send_socket_buffer_size)\n        .def_readwrite(\"optimize_hashing_for_speed\", &session_settings::optimize_hashing_for_speed)\n        .def_readwrite(\"file_checks_delay_per_block\", &session_settings::file_checks_delay_per_block)\n        .def_readwrite(\"disk_cache_algorithm\", &session_settings::disk_cache_algorithm)\n        .def_readwrite(\"read_cache_line_size\", &session_settings::read_cache_line_size)\n        .def_readwrite(\"write_cache_line_size\", &session_settings::write_cache_line_size)\n    ;\n\n    enum_<proxy_settings::proxy_type>(\"proxy_type\")\n        .value(\"none\", proxy_settings::none)\n        .value(\"socks4\", proxy_settings::socks4)\n        .value(\"socks5\", proxy_settings::socks5)\n        .value(\"socks5_pw\", proxy_settings::socks5_pw)\n        .value(\"http\", proxy_settings::http)\n        .value(\"http_pw\", proxy_settings::http_pw)\n    ;\n    \n    enum_<session_settings::disk_cache_algo_t(\"disk_cache_algo_t\")\n        .value(\"lru\", session_settings::disk_cache_algo_t::lru)\n        .value(\"largest_contiguous\", session_settings::disk_cache_algo_t::largest_contiguous)\n    ;\n    \n    enum_<session_settings::io_buffer_mode_t(\"io_buffer_mode_t\")\n        .value(\"enable_os_cache\", session_settings::io_buffer_mode_t::enable_os_cache)\n        .value(\"disable_os_cache_for_aligned_files\", session_settings::io_buffer_mode_t:disable_os_cache_for_aligned_files)\n        .value(\"disable_os_cache\", session_settings::io_buffer_mode_t::disable_os_cache)\n    ;\n     \n    class_<proxy_settings>(\"proxy_settings\")\n        .def_readwrite(\"hostname\", &proxy_settings::hostname)\n        .def_readwrite(\"port\", &proxy_settings::port)\n        .def_readwrite(\"password\", &proxy_settings::password)\n        .def_readwrite(\"username\", &proxy_settings::username)\n        .def_readwrite(\"type\", &proxy_settings::type)\n    ;\n\n#ifndef TORRENT_DISABLE_DHT\n    class_<dht_settings>(\"dht_settings\")\n        .def_readwrite(\"max_peers_reply\", dht_settings::max_peers_reply)\n        .def_readwrite(\"search_branching\", dht_settings::search_branching)\n        .def_readwrite(\"service_port\", dht_settings::service_port)\n        .def_readwrite(\"max_fail_count\", dht_settings::max_fail_count)\n    ;\n#endif\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n    enum_<pe_settings::enc_policy>(\"enc_policy\")\n        .value(\"forced\", pe_settings::forced)\n        .value(\"enabled\", pe_settings::enabled)\n        .value(\"disabled\", pe_settings::disabled)\n    ;\n\n    enum_<pe_settings::enc_level>(\"enc_level\")\n        .value(\"rc4\", pe_settings::rc4)\n        .value(\"plaintext\", pe_settings::plaintext)\n        .value(\"both\", pe_settings::both)\n    ;\n\n    class_<pe_settings>(\"pe_settings\")\n        .def_readwrite(\"out_enc_policy\", &pe_settings::out_enc_policy)\n        .def_readwrite(\"in_enc_policy\", &pe_settings::in_enc_policy)\n        .def_readwrite(\"allowed_enc_level\", &pe_settings::allowed_enc_level)\n        .def_readwrite(\"prefer_rc4\", &pe_settings::prefer_rc4)\n    ;\n#endif\n\n}\n<commit_msg>Fix typo<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 <libtorrent\/session.hpp>\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nvoid bind_session_settings()\n{\n    class_<session_settings>(\"session_settings\")\n        .def_readwrite(\"user_agent\", &session_settings::user_agent)\n        .def_readwrite(\"tracker_completion_timeout\", &session_settings::tracker_completion_timeout)\n        .def_readwrite(\"tracker_receive_timeout\", &session_settings::tracker_receive_timeout)\n        .def_readwrite(\"stop_tracker_timeout\", &session_settings::stop_tracker_timeout)\n        .def_readwrite(\"tracker_maximum_response_length\", &session_settings::tracker_maximum_response_length)\n        .def_readwrite(\"piece_timeout\", &session_settings::piece_timeout)\n        .def_readwrite(\"request_timeout\", &session_settings::request_timeout)\n        .def_readwrite(\"request_queue_time\", &session_settings::request_queue_time)\n        .def_readwrite(\"max_allowed_in_request_queue\", &session_settings::max_allowed_in_request_queue)\n        .def_readwrite(\"max_out_request_queue\", &session_settings::max_out_request_queue)\n        .def_readwrite(\"whole_pieces_threshold\", &session_settings::whole_pieces_threshold)\n        .def_readwrite(\"peer_timeout\", &session_settings::peer_timeout)\n        .def_readwrite(\"urlseed_timeout\", &session_settings::urlseed_timeout)\n        .def_readwrite(\"urlseed_pipeline_size\", &session_settings::urlseed_pipeline_size)\n        .def_readwrite(\"urlseed_wait_retry\", &session_settings::urlseed_wait_retry)\n        .def_readwrite(\"file_pool_size\", &session_settings::file_pool_size)\n        .def_readwrite(\"allow_multiple_connections_per_ip\", &session_settings::allow_multiple_connections_per_ip)\n        .def_readwrite(\"max_failcount\", &session_settings::max_failcount)\n        .def_readwrite(\"min_reconnect_time\", &session_settings::min_reconnect_time)\n        .def_readwrite(\"peer_connect_timeout\", &session_settings::peer_connect_timeout)\n        .def_readwrite(\"ignore_limits_on_local_network\", &session_settings::ignore_limits_on_local_network)\n        .def_readwrite(\"connection_speed\", &session_settings::connection_speed)\n        .def_readwrite(\"send_redundant_have\", &session_settings::send_redundant_have)\n        .def_readwrite(\"lazy_bitfields\", &session_settings::lazy_bitfields)\n        .def_readwrite(\"inactivity_timeout\", &session_settings::inactivity_timeout)\n        .def_readwrite(\"unchoke_interval\", &session_settings::unchoke_interval)\n        .def_readwrite(\"optimistic_unchoke_multiplier\", &session_settings::optimistic_unchoke_multiplier)\n        .def_readwrite(\"num_want\", &session_settings::num_want)\n        .def_readwrite(\"initial_picker_threshold\", &session_settings::initial_picker_threshold)\n        .def_readwrite(\"allowed_fast_set_size\", &session_settings::allowed_fast_set_size)\n        .def_readwrite(\"max_outstanding_disk_bytes_per_connection\", &session_settings::max_outstanding_disk_bytes_per_connection)\n        .def_readwrite(\"handshake_timeout\", &session_settings::handshake_timeout)\n#ifndef TORRENT_DISABLE_DHT\n        .def_readwrite(\"use_dht_as_fallback\", &session_settings::use_dht_as_fallback)\n#endif\n        .def_readwrite(\"free_torrent_hashes\", &session_settings::free_torrent_hashes)\n        .def_readwrite(\"upnp_ignore_nonrouters\", &session_settings::upnp_ignore_nonrouters)\n        .def_readwrite(\"send_buffer_watermark\", &session_settings::send_buffer_watermark)\n        .def_readwrite(\"auto_upload_slots\", &session_settings::auto_upload_slots)\n        .def_readwrite(\"auto_upload_slots_rate_based\", &session_settings::auto_upload_slots_rate_based)\n        .def_readwrite(\"use_parole_mode\", &session_settings::use_parole_mode)\n        .def_readwrite(\"cache_size\", &session_settings::cache_size)\n        .def_readwrite(\"cache_buffer_chunk_size\", &session_settings::cache_buffer_chunk_size)\n        .def_readwrite(\"cache_expiry\", &session_settings::cache_expiry)\n        .def_readwrite(\"use_read_cache\", &session_settings::use_read_cache)\n        .def_readwrite(\"disk_io_write_mode\", &session_settings::disk_io_write_mode)\n        .def_readwrite(\"disk_io_read_mode\", &session_settings::disk_io_read_mode)\n        .def_readwrite(\"coalesce_reads\", &session_settings::coalesce_reads)\n        .def_readwrite(\"coalesce_writes\", &session_settings:coalesce_writes)\n        .def_readwrite(\"outgoing_ports\", &session_settings::outgoing_ports)\n        .def_readwrite(\"peer_tos\", &session_settings::peer_tos)\n        .def_readwrite(\"active_downloads\", &session_settings::active_downloads)\n        .def_readwrite(\"active_seeds\", &session_settings::active_seeds)\n        .def_readwrite(\"active_limit\", &session_settings::active_limit)\n        .def_readwrite(\"auto_manage_prefer_seeds\", &session_settings::automanaged_prefer_seeds)\n        .def_readwrite(\"dont_count_slow_torrents\", &session_settings::dont_count_slow_torrents)\n        .def_readwrite(\"auto_manage_interval\", &session_settings::auto_manage_interval)\n        .def_readwrite(\"share_ratio_limit\", &session_settings::share_ratio_limit)\n        .def_readwrite(\"seed_time_ratio_limit\", &session_settings::seed_time_ratio_limit)\n        .def_readwrite(\"seed_time_limit\", &session_settings::seed_time_limit)\n        .def_readwrite(\"peer_turnover\", &session_settings::peer_turnover)\n        .def_readwrite(\"peer_turnover_cutoff\", &session_settings::peer_turnover_cutoff)\n        .def_readwrite(\"close_redundant_connections\", &session_settings::close_redundant_connections)\n        .def_readwrite(\"auto_scrape_interval\", &session_settings::auto_scrape_interval)\n        .def_readwrite(\"auto_scrape_min_interval\", &session_settings::auto_scrape_min_interval)\n        .def_readwrite(\"max_peerlist_size\", &session_settings::max_peerlist_size)\n        .def_readwrite(\"max_paused_peerlist_size\", &session_settings::max_paused_peerlist_size)\n        .def_readwrite(\"min_announce_interval\", &session_settings::min_announce_interval)\n        .def_readwrite(\"prioritize_partial_pieces\", &session_settings::prioritize_partial_pieces)\n        .def_readwrite(\"auto_manage_startup\", &session_settings::auto_manage_startup)\n        .def_readwrite(\"rate_limit_ip_overhead\", &session_settings::rate_limit_ip_overhead)\n        .def_readwrite(\"announce_to_all_trackers\", &session_settings::announce_to_all_trackers)\n        .def_readwrite(\"prefer_udp_trackers\", &session_settings::prefer_udp_trackers)\n        .def_readwrite(\"strict_super_seeding\", &session_settings::strict_super_seeding)\n        .def_readwrite(\"seeding_piece_quota\", &session_settings::seeding_piece_quota)\n        .def_readwrite(\"max_sparse_regions\", &session_settings::max_sparse_regions)\n#ifndef TORRENT_DISABLE_MLOCK\n        .def_readwrite(\"lock_disk_cache\", &session_settings::lock_disk_cache)\n#endif\n        .def_readwrite(\"max_rejects\", &session_settings::max_rejects)\n        .def_readwrite(\"recv_socket_buffer_size\", &session_settings::recv_socket_buffer_size)\n        .def_readwrite(\"send_socket_buffer_size\", &session_settings::send_socket_buffer_size)\n        .def_readwrite(\"optimize_hashing_for_speed\", &session_settings::optimize_hashing_for_speed)\n        .def_readwrite(\"file_checks_delay_per_block\", &session_settings::file_checks_delay_per_block)\n        .def_readwrite(\"disk_cache_algorithm\", &session_settings::disk_cache_algorithm)\n        .def_readwrite(\"read_cache_line_size\", &session_settings::read_cache_line_size)\n        .def_readwrite(\"write_cache_line_size\", &session_settings::write_cache_line_size)\n    ;\n\n    enum_<proxy_settings::proxy_type>(\"proxy_type\")\n        .value(\"none\", proxy_settings::none)\n        .value(\"socks4\", proxy_settings::socks4)\n        .value(\"socks5\", proxy_settings::socks5)\n        .value(\"socks5_pw\", proxy_settings::socks5_pw)\n        .value(\"http\", proxy_settings::http)\n        .value(\"http_pw\", proxy_settings::http_pw)\n    ;\n    \n    enum_<session_settings::disk_cache_algo_t(\"disk_cache_algo_t\")\n        .value(\"lru\", session_settings::disk_cache_algo_t::lru)\n        .value(\"largest_contiguous\", session_settings::disk_cache_algo_t::largest_contiguous)\n    ;\n    \n    enum_<session_settings::io_buffer_mode_t(\"io_buffer_mode_t\")\n        .value(\"enable_os_cache\", session_settings::io_buffer_mode_t::enable_os_cache)\n        .value(\"disable_os_cache_for_aligned_files\", session_settings::io_buffer_mode_t:disable_os_cache_for_aligned_files)\n        .value(\"disable_os_cache\", session_settings::io_buffer_mode_t::disable_os_cache)\n    ;\n     \n    class_<proxy_settings>(\"proxy_settings\")\n        .def_readwrite(\"hostname\", &proxy_settings::hostname)\n        .def_readwrite(\"port\", &proxy_settings::port)\n        .def_readwrite(\"password\", &proxy_settings::password)\n        .def_readwrite(\"username\", &proxy_settings::username)\n        .def_readwrite(\"type\", &proxy_settings::type)\n    ;\n\n#ifndef TORRENT_DISABLE_DHT\n    class_<dht_settings>(\"dht_settings\")\n        .def_readwrite(\"max_peers_reply\", &dht_settings::max_peers_reply)\n        .def_readwrite(\"search_branching\", &dht_settings::search_branching)\n        .def_readwrite(\"service_port\", &dht_settings::service_port)\n        .def_readwrite(\"max_fail_count\", &dht_settings::max_fail_count)\n    ;\n#endif\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n    enum_<pe_settings::enc_policy>(\"enc_policy\")\n        .value(\"forced\", pe_settings::forced)\n        .value(\"enabled\", pe_settings::enabled)\n        .value(\"disabled\", pe_settings::disabled)\n    ;\n\n    enum_<pe_settings::enc_level>(\"enc_level\")\n        .value(\"rc4\", pe_settings::rc4)\n        .value(\"plaintext\", pe_settings::plaintext)\n        .value(\"both\", pe_settings::both)\n    ;\n\n    class_<pe_settings>(\"pe_settings\")\n        .def_readwrite(\"out_enc_policy\", &pe_settings::out_enc_policy)\n        .def_readwrite(\"in_enc_policy\", &pe_settings::in_enc_policy)\n        .def_readwrite(\"allowed_enc_level\", &pe_settings::allowed_enc_level)\n        .def_readwrite(\"prefer_rc4\", &pe_settings::prefer_rc4)\n    ;\n#endif\n\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\nhttp:\/\/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 \"paddle\/framework\/op_registry.h\"\n#include \"paddle\/operators\/math\/math_function.h\"\n\nnamespace paddle {\nnamespace operators {\n\nusing Tensor = framework::Tensor;\nusing LoDTensor = framework::LoDTensor;\n\nclass BipartiteMatchOp : public framework::OperatorWithKernel {\n public:\n  using framework::OperatorWithKernel::OperatorWithKernel;\n\n  void InferShape(framework::InferShapeContext* ctx) const override {\n    PADDLE_ENFORCE(ctx->HasInput(\"DisMat\"),\n                   \"Input(DisMat) of BipartiteMatch should not be null.\");\n\n    auto dims = ctx->GetInputDim(\"DisMat\");\n    PADDLE_ENFORCE_EQ(dims.size(), 2, \"The rank of Input(DisMat) must be 2.\");\n\n    ctx->SetOutputDim(\"ColToRowMatchIndices\", dims);\n    ctx->SetOutputDim(\"ColToRowMatchDis\", dims);\n  }\n};\n\ntemplate <typename T>\nclass BipartiteMatchKernel : public framework::OpKernel<T> {\n public:\n  \/\/ The match_indices must be initialized to -1 at first.\n  \/\/ The match_dis must be initialized to 0 at first.\n  void BipartiteMatch(const Tensor& dis, int* match_indices,\n                      T* match_dis) const {\n    int64_t row = dis.dims()[0];\n    int64_t col = dis.dims()[1];\n    auto* dis_data = dis.data<T>();\n    std::vector<int> row_pool;\n    for (int i = 0; i < row; ++i) {\n      row_pool.push_back(i);\n    }\n    while (row_pool.size() > 0) {\n      int max_idx = -1;\n      int max_row_idx = -1;\n      T max_dis = -1;\n      for (int64_t j = 0; j < col; ++j) {\n        if (match_indices[j] != -1) {\n          continue;\n        }\n        for (int k = 0; k < row_pool.size(); ++k) {\n          int m = row_pool[k];\n          \/\/ distance is 0 between m-th row and j-th column\n          if (dis_data[m * col + j] < 1e-6) {\n            continue;\n          }\n          if (dis_data[m * col + j] > max_dis) {\n            max_idx = j;\n            max_row_idx = m;\n            max_dis = dis_data[m * col + j];\n          }\n        }\n      }\n      if (max_idx == -1) {\n        \/\/ Cannot find good match.\n        break;\n      } else {\n        PADDLE_ENFORCE_EQ(match_indices[max_idx], -1);\n        match_indices[max_idx] = max_row_idx;\n        match_dis[max_idx] = max_dis;\n        \/\/ Erase the row index.\n        row_pool.erase(\n            std::find(row_pool.begin(), row_pool.end(), max_row_idx));\n      }\n    }\n  }\n\n  void Compute(const framework::ExecutionContext& context) const override {\n    auto* dis_mat = context.Input<LoDTensor>(\"DisMat\");\n    auto* match_indices = context.Output<Tensor>(\"ColToRowMatchIndices\");\n    auto* match_dis = context.Output<Tensor>(\"ColToRowMatchDis\");\n\n    auto& dev_ctx = context.device_context<platform::CPUDeviceContext>();\n\n    auto col = dis_mat->dims()[1];\n\n    int64_t n = dis_mat->lod().size() == 0\n                    ? 1\n                    : static_cast<int64_t>(dis_mat->lod().back().size() - 1);\n    match_indices->mutable_data<int>({n, col}, context.GetPlace());\n    match_dis->mutable_data<T>({n, col}, context.GetPlace());\n\n    math::SetConstant<platform::CPUDeviceContext, int> iset;\n    iset(dev_ctx, match_indices, static_cast<int>(-1));\n    math::SetConstant<platform::CPUDeviceContext, T> tset;\n    tset(dev_ctx, match_dis, static_cast<T>(0));\n\n    int* indices = match_indices->data<int>();\n    T* dis = match_dis->data<T>();\n    if (n == 1) {\n      BipartiteMatch(*dis_mat, indices, dis);\n    } else {\n      auto lod = dis_mat->lod().back();\n      for (size_t i = 0; i < lod.size() - 1; ++i) {\n        Tensor one_ins = dis_mat->Slice(lod[i], lod[i + 1]);\n        BipartiteMatch(one_ins, indices + i * col, dis + i * col);\n      }\n    }\n  }\n};\n\nclass BipartiteMatchOpMaker : public framework::OpProtoAndCheckerMaker {\n public:\n  BipartiteMatchOpMaker(OpProto* proto, OpAttrChecker* op_checker)\n      : OpProtoAndCheckerMaker(proto, op_checker) {\n    AddInput(\n        \"DisMat\",\n        \"(LoDTensor or Tensor) this input is a 2-D LoDTensor with shape \"\n        \"[K, M]. It is pair-wise distance matrix between the entities \"\n        \"represented by each row and each column. For example, assumed one \"\n        \"entity is A with shape [K], another entity is B with shape [M]. The \"\n        \"DisMat[i][j] is the distance between A[i] and B[j]. The bigger \"\n        \"the distance is, the more similar the pairs are. Please note, \"\n        \"This tensor can contain LoD information to represent a batch of \"\n        \"inputs. One instance of this batch can contain different numbers of \"\n        \"entities.\");\n    AddOutput(\"ColToRowMatchIndices\",\n              \"(Tensor) A 2-D Tensor with shape [N, M] in int type. \"\n              \"N is the batch size. If ColToRowMatchIndices[i][j] is -1, it \"\n              \"means B[j] does not match any entity in i-th instance. \"\n              \"Otherwise, it means B[j] is matched to row \"\n              \"RowToColMatchIndices[i][j] in i-th instance. The row number of \"\n              \"i-th instance is saved in RowToColMatchIndices[i][j].\");\n    AddOutput(\"ColToRowMatchDis\",\n              \"(Tensor) A 2-D Tensor with shape [N, M] in float type. \"\n              \"N is batch size. If ColToRowMatchIndices[i][j] is -1, \"\n              \"ColToRowMatchDis[i][j] is also -1.0. Otherwise, assumed \"\n              \"RowToColMatchIndices[i][j] = d, and the row offsets of each \"\n              \"instance are called LoD. Then \"\n              \"ColToRowMatchDis[i][j] = DisMat[d+LoD[i]][j]\");\n    AddComment(R\"DOC(\nThis operator is a greedy bipartite matching algorithm, which is used to\nobtain the matching with the (greedy) maximum distance based on the input\ndistance matrix. There are two outputs to save matched indices and distance.\nAnd this operator only calculate matched indices from column to row.\nA simple description, this algothrim matched the best (maximum distance)\nrow entity to the column entity and the matched indices are not duplicated\nin each row of ColToRowMatchIndices. If the column entity is not matched\nany row entity, set -1 in ColToRowMatchIndices.\n\nPlease note that the input DisMat can be LoDTensor (with LoD) or Tensor.\nIf LoDTensor with LoD, the height of ColToRowMatchIndices is batch size.\nIf Tensor, the height of ColToRowMatchIndices is 1.\n\n)DOC\");\n  }\n};\n\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n\nnamespace ops = paddle::operators;\nREGISTER_OPERATOR(bipartite_match, ops::BipartiteMatchOp,\n                  ops::BipartiteMatchOpMaker,\n                  paddle::framework::EmptyGradOpMaker);\nREGISTER_OP_CPU_KERNEL(bipartite_match, ops::BipartiteMatchKernel<float>,\n                       ops::BipartiteMatchKernel<double>);\n<commit_msg>Update some comments and add more check.<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\nhttp:\/\/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 \"paddle\/framework\/op_registry.h\"\n#include \"paddle\/operators\/math\/math_function.h\"\n\nnamespace paddle {\nnamespace operators {\n\nusing Tensor = framework::Tensor;\nusing LoDTensor = framework::LoDTensor;\n\nconstexpr char kEPS = 1e-6;\n\nclass BipartiteMatchOp : public framework::OperatorWithKernel {\n public:\n  using framework::OperatorWithKernel::OperatorWithKernel;\n\n  void InferShape(framework::InferShapeContext* ctx) const override {\n    PADDLE_ENFORCE(ctx->HasInput(\"DisMat\"),\n                   \"Input(DisMat) of BipartiteMatch should not be null.\");\n\n    auto dims = ctx->GetInputDim(\"DisMat\");\n    PADDLE_ENFORCE_EQ(dims.size(), 2, \"The rank of Input(DisMat) must be 2.\");\n\n    ctx->SetOutputDim(\"ColToRowMatchIndices\", dims);\n    ctx->SetOutputDim(\"ColToRowMatchDis\", dims);\n  }\n};\n\ntemplate <typename T>\nclass BipartiteMatchKernel : public framework::OpKernel<T> {\n public:\n  \/\/ The match_indices must be initialized to -1 at first.\n  \/\/ The match_dist must be initialized to 0 at first.\n  void BipartiteMatch(const Tensor& dist, int* match_indices,\n                      T* match_dist) const {\n    PADDLE_ENFORCE_EQ(dist.dims().size(), 2, \"The rank of dist must be 2.\");\n    int64_t row = dist.dims()[0];\n    int64_t col = dist.dims()[1];\n    auto* dist_data = dist.data<T>();\n    std::vector<int> row_pool;\n    for (int i = 0; i < row; ++i) {\n      row_pool.push_back(i);\n    }\n    while (row_pool.size() > 0) {\n      int max_idx = -1;\n      int max_row_idx = -1;\n      T max_dist = -1;\n      for (int64_t j = 0; j < col; ++j) {\n        if (match_indices[j] != -1) {\n          continue;\n        }\n        for (int k = 0; k < row_pool.size(); ++k) {\n          int m = row_pool[k];\n          \/\/ distance is 0 between m-th row and j-th column\n          if (dist_data[m * col + j] < kEPS) {\n            continue;\n          }\n          if (dist_data[m * col + j] > max_dist) {\n            max_idx = j;\n            max_row_idx = m;\n            max_dist = dist_data[m * col + j];\n          }\n        }\n      }\n      if (max_idx == -1) {\n        \/\/ Cannot find good match.\n        break;\n      } else {\n        PADDLE_ENFORCE_EQ(match_indices[max_idx], -1);\n        match_indices[max_idx] = max_row_idx;\n        match_dist[max_idx] = max_dist;\n        \/\/ Erase the row index.\n        row_pool.erase(\n            std::find(row_pool.begin(), row_pool.end(), max_row_idx));\n      }\n    }\n  }\n\n  void Compute(const framework::ExecutionContext& context) const override {\n    auto* dist_mat = context.Input<LoDTensor>(\"DisMat\");\n    auto* match_indices = context.Output<Tensor>(\"ColToRowMatchIndices\");\n    auto* match_dist = context.Output<Tensor>(\"ColToRowMatchDis\");\n\n    auto& dev_ctx = context.device_context<platform::CPUDeviceContext>();\n\n    auto col = dist_mat->dims()[1];\n\n    int64_t n = dist_mat->lod().size() == 0UL\n                    ? 1\n                    : static_cast<int64_t>(dist_mat->lod().back().size() - 1);\n    if (dist_mat->lod().size()) {\n      PADDLE_ENFORCE_EQ(dist_mat->lod().size(), 1UL,\n                        \"Only support 1 level of LoD.\");\n    }\n    match_indices->mutable_data<int>({n, col}, context.GetPlace());\n    match_dist->mutable_data<T>({n, col}, context.GetPlace());\n\n    math::SetConstant<platform::CPUDeviceContext, int> iset;\n    iset(dev_ctx, match_indices, static_cast<int>(-1));\n    math::SetConstant<platform::CPUDeviceContext, T> tset;\n    tset(dev_ctx, match_dist, static_cast<T>(0));\n\n    int* indices = match_indices->data<int>();\n    T* dist = match_dist->data<T>();\n    if (n == 1) {\n      BipartiteMatch(*dist_mat, indices, dist);\n    } else {\n      auto lod = dist_mat->lod().back();\n      for (size_t i = 0; i < lod.size() - 1; ++i) {\n        Tensor one_ins = dist_mat->Slice(lod[i], lod[i + 1]);\n        BipartiteMatch(one_ins, indices + i * col, dist + i * col);\n      }\n    }\n  }\n};\n\nclass BipartiteMatchOpMaker : public framework::OpProtoAndCheckerMaker {\n public:\n  BipartiteMatchOpMaker(OpProto* proto, OpAttrChecker* op_checker)\n      : OpProtoAndCheckerMaker(proto, op_checker) {\n    AddInput(\n        \"DisMat\",\n        \"(LoDTensor or Tensor) this input is a 2-D LoDTensor with shape \"\n        \"[K, M]. It is pair-wise distance matrix between the entities \"\n        \"represented by each row and each column. For example, assumed one \"\n        \"entity is A with shape [K], another entity is B with shape [M]. The \"\n        \"DisMat[i][j] is the distance between A[i] and B[j]. The bigger \"\n        \"the distance is, the better macthing the pairs are. Please note, \"\n        \"This tensor can contain LoD information to represent a batch of \"\n        \"inputs. One instance of this batch can contain different numbers of \"\n        \"entities.\");\n    AddOutput(\"ColToRowMatchIndices\",\n              \"(Tensor) A 2-D Tensor with shape [N, M] in int type. \"\n              \"N is the batch size. If ColToRowMatchIndices[i][j] is -1, it \"\n              \"means B[j] does not match any entity in i-th instance. \"\n              \"Otherwise, it means B[j] is matched to row \"\n              \"ColToRowMatchIndices[i][j] in i-th instance. The row number of \"\n              \"i-th instance is saved in ColToRowMatchIndices[i][j].\");\n    AddOutput(\"ColToRowMatchDis\",\n              \"(Tensor) A 2-D Tensor with shape [N, M] in float type. \"\n              \"N is batch size. If ColToRowMatchIndices[i][j] is -1, \"\n              \"ColToRowMatchDis[i][j] is also -1.0. Otherwise, assumed \"\n              \"ColToRowMatchIndices[i][j] = d, and the row offsets of each \"\n              \"instance are called LoD. Then \"\n              \"ColToRowMatchDis[i][j] = DisMat[d+LoD[i]][j]\");\n    AddComment(R\"DOC(\nThis operator is a greedy bipartite matching algorithm, which is used to\nobtain the matching with the maximum distance based on the input\ndistance matrix. For input 2D matrix, the bipartite matching algorithm can\nfind the matched column for each row, also can find the matched row for\neach column. And this operator only calculate matched indices from column\nto row. For each instance, the number of matched indices is the number of\nof columns of the input ditance matrix.\n\nThere are two outputs to save matched indices and distance.\nA simple description, this algothrim matched the best (maximum distance)\nrow entity to the column entity and the matched indices are not duplicated\nin each row of ColToRowMatchIndices. If the column entity is not matched\nany row entity, set -1 in ColToRowMatchIndices.\n\nPlease note that the input DisMat can be LoDTensor (with LoD) or Tensor.\nIf LoDTensor with LoD, the height of ColToRowMatchIndices is batch size.\nIf Tensor, the height of ColToRowMatchIndices is 1.\n\n)DOC\");\n  }\n};\n\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n\nnamespace ops = paddle::operators;\nREGISTER_OPERATOR(bipartite_match, ops::BipartiteMatchOp,\n                  ops::BipartiteMatchOpMaker,\n                  paddle::framework::EmptyGradOpMaker);\nREGISTER_OP_CPU_KERNEL(bipartite_match, ops::BipartiteMatchKernel<float>,\n                       ops::BipartiteMatchKernel<double>);\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <iterator>\n\n#include <cstdlib> \/\/malloc, realloc\n#include <exception> \/\/bad_alloc\n#include <utility>\n\n#include <cassert>\n\nnamespace tyti {\ntemplate<typename T>\nclass any_iterator : std::iterator<std::bidirectional_iterator_tag, T>\n{\n    struct AbstractIterHolder\n    {\n        virtual ~AbstractIterHolder() {};\n        virtual void inc() = 0;\n        virtual void dec() = 0;\n        virtual const T* deref() = 0;\n        virtual bool equal_holder(const void* in) const = 0;\n        virtual bool equal(const void* in) const = 0;\n\n        virtual void copy_and_assign_to(void* dst) const = 0;\n        virtual size_t holder_size() = 0;\n    };\n\n    template<typename IterT>\n    struct IterHolder : public AbstractIterHolder\n    {\n    private:\n        IterT iter_;\n    public:\n        IterHolder(IterT t):iter_{std::move(t)}{}\n        ~IterHolder(){}\n        void inc() { ++iter_; }\n        void dec() { --iter_; }\n        const T* deref() { return &(*iter_); }\n        bool equal_holder(const void* in) const { return iter_ == reinterpret_cast<const IterHolder<IterT>*>(in)->iter_; }\n        bool equal(const void* in) const { return iter_ == *reinterpret_cast<const IterT*>(in); }\n        void copy_and_assign_to(void* dst) const { new (dst) IterHolder(iter_); }\n        size_t holder_size() { return sizeof(IterHolder<IterT>); }\n    };\n\n    \/\/ helper functions\n    inline void destruct()\n    {\n        ptr_->~AbstractIterHolder();\n    }\n\n    void check_allocation(size_t oldsize, size_t newsize)\n    {\n        if (oldsize < newsize)\n        {\n            ptr_ = reinterpret_cast<AbstractIterHolder*>(std::realloc(ptr_, newsize));\n            if (!ptr_)\n                throw std::bad_alloc();\n        }\n    }\n\n    \/\/ member variables\n    AbstractIterHolder* ptr_;\n\n    \/\/\/ Interface\npublic:\n    template <typename IterType, class = typename std::enable_if<!std::is_rvalue_reference<IterType>::value>::type>\n    explicit any_iterator(IterType _iter) \n        : ptr_(reinterpret_cast<AbstractIterHolder*>(std::malloc(sizeof(IterHolder<IterType>))))\n    {\n        if (!ptr_)\n            throw std::bad_alloc();\n        new (ptr_) IterHolder<IterType>(std::move(_iter));\n    }\n\n    any_iterator(const any_iterator& _iter)\n        : ptr_(reinterpret_cast<AbstractIterHolder*>(std::malloc(_iter.ptr_->holder_size())))\n    {\n        if (!ptr_)\n            throw std::bad_alloc();\n        _iter.ptr_->copy_and_assign_to(ptr_);\n    }\n\n    any_iterator(any_iterator&& _iter)\n        :ptr_(std::move(_iter.ptr_))\n    {\n        _iter.ptr_ = nullptr;\n    }\n\n    template <typename IterType, class = typename std::enable_if<!std::is_rvalue_reference<IterType>::value>::type >\n    const any_iterator& operator=(IterType _iter)\n    {\n        const size_t old_size = ptr_->holder_size();\n        destruct();\n        check_allocation(old_size, sizeof(IterHolder<IterType>));\n        new (ptr_) IterHolder<IterType>(std::move(_iter));\n        return *this;\n    }\n\n    const any_iterator& operator=(const any_iterator& _iter)\n    {\n        const size_t old_size = ptr_->holder_size();\n        destruct();\n        check_allocation(old_size, _iter.ptr_->holder_size());\n        _iter.ptr_->copy_and_assign_to(ptr_);\n        return *this;\n    }\n\n    const any_iterator& operator=(any_iterator&& _iter)\n    {\n        std::swap(ptr_, _iter.ptr_);\n        \/\/old ptr gets destructed via _iter\n        return *this;\n    }\n\n    ~any_iterator() \n    {\n        if (ptr_)\n        {\n            destruct();\n            std::free(ptr_);\n        }\n    }\n\n    bool operator==(const any_iterator& _rhs) const\n    {\n        if (typeid(*ptr_) != typeid(*_rhs.ptr_)) \/\/different types\n            return false;\n        return ptr_->equal_holder(_rhs.ptr_);\n    }\n\n    template <typename IterType>\n    bool operator==(const IterType& _rhs) const {\n        return ptr_->equal(reinterpret_cast<const void*>(&_rhs));\n    }\n\n    template <typename IterType>\n    bool operator!=(const IterType& _rhs) const{\n        return !operator==(_rhs);\n    }\n\n    \/\/\/ Standard pre-increment operator\n    any_iterator& operator++() {\n        ptr_->inc();\n        return *this;\n    }\n\n    \/\/\/ Standard post-increment operator\n    any_iterator operator++(int) {\n        any_iterator cpy(*this);\n        ptr_->inc();\n        return cpy;\n    }\n\n    \/\/\/ Standard pre-decrement operator\n    any_iterator& operator--() {\n        ptr_->dec();\n        return *this;\n    }\n\n    \/\/\/ Standard post-decrement operator\n    any_iterator operator--(int) {\n        any_iterator cpy(*this);\n        ptr_->dec();\n        return cpy;\n    }\n\n    const T& operator*() const {\n        return *ptr_->deref();\n    }\n\n    \/\/\/ Standard pointer operator.\n    const T* operator->() const {\n        return ptr_->deref();\n    }\n};\n\n} \/\/ end namespace tyti\n\ntemplate<typename IterT, typename T>\nbool operator==(const IterT&& _lhs, const tyti::any_iterator<T>&& _rhs)\n{\n    return _rhs.operator==(std::forward<IterT>(_lhs));\n}\n\ntemplate<typename IterT, typename T>\nbool operator!=(IterT&& _lhs, tyti::any_iterator<T>&& _rhs)\n{\n    return _rhs.operator!=(std::forward<IterT>(_lhs));\n}<commit_msg>non const deref<commit_after>#pragma once\n\n#include <iterator>\n\n#include <cstdlib> \/\/malloc, realloc\n#include <exception> \/\/bad_alloc\n#include <utility>\n\n#include <cassert>\n\nnamespace tyti {\ntemplate<typename T>\nclass any_iterator : std::iterator<std::bidirectional_iterator_tag, T>\n{\n    struct AbstractIterHolder\n    {\n        virtual ~AbstractIterHolder() {};\n        virtual void inc() = 0;\n        virtual void dec() = 0;\n        virtual T* deref() = 0;\n        virtual bool equal_holder(const void* in) const = 0;\n        virtual bool equal(const void* in) const = 0;\n\n        virtual void copy_and_assign_to(void* dst) const = 0;\n        virtual size_t holder_size() = 0;\n    };\n\n    template<typename IterT>\n    struct IterHolder : public AbstractIterHolder\n    {\n    private:\n        IterT iter_;\n    public:\n        IterHolder(IterT t):iter_{std::move(t)}{}\n        ~IterHolder(){}\n        void inc() { ++iter_; }\n        void dec() { --iter_; }\n        T* deref() { return &(*iter_); }\n        bool equal_holder(const void* in) const { return iter_ == reinterpret_cast<const IterHolder<IterT>*>(in)->iter_; }\n        bool equal(const void* in) const { return iter_ == *reinterpret_cast<const IterT*>(in); }\n        void copy_and_assign_to(void* dst) const { new (dst) IterHolder(iter_); }\n        size_t holder_size() { return sizeof(IterHolder<IterT>); }\n    };\n\n    \/\/ helper functions\n    inline void destruct()\n    {\n        ptr_->~AbstractIterHolder();\n    }\n\n    void check_allocation(size_t oldsize, size_t newsize)\n    {\n        if (oldsize < newsize)\n        {\n            ptr_ = reinterpret_cast<AbstractIterHolder*>(std::realloc(ptr_, newsize));\n            if (!ptr_)\n                throw std::bad_alloc();\n        }\n    }\n\n    \/\/ member variables\n    AbstractIterHolder* ptr_;\n\n    \/\/\/ Interface\npublic:\n    template <typename IterType, class = typename std::enable_if<!std::is_rvalue_reference<IterType>::value>::type>\n    explicit any_iterator(IterType _iter) \n        : ptr_(reinterpret_cast<AbstractIterHolder*>(std::malloc(sizeof(IterHolder<IterType>))))\n    {\n        if (!ptr_)\n            throw std::bad_alloc();\n        new (ptr_) IterHolder<IterType>(std::move(_iter));\n    }\n\n    any_iterator(const any_iterator& _iter)\n        : ptr_(reinterpret_cast<AbstractIterHolder*>(std::malloc(_iter.ptr_->holder_size())))\n    {\n        if (!ptr_)\n            throw std::bad_alloc();\n        _iter.ptr_->copy_and_assign_to(ptr_);\n    }\n\n    any_iterator(any_iterator&& _iter)\n        :ptr_(std::move(_iter.ptr_))\n    {\n        _iter.ptr_ = nullptr;\n    }\n\n    template <typename IterType, class = typename std::enable_if<!std::is_rvalue_reference<IterType>::value>::type >\n    const any_iterator& operator=(IterType _iter)\n    {\n        const size_t old_size = ptr_->holder_size();\n        destruct();\n        check_allocation(old_size, sizeof(IterHolder<IterType>));\n        new (ptr_) IterHolder<IterType>(std::move(_iter));\n        return *this;\n    }\n\n    const any_iterator& operator=(const any_iterator& _iter)\n    {\n        const size_t old_size = ptr_->holder_size();\n        destruct();\n        check_allocation(old_size, _iter.ptr_->holder_size());\n        _iter.ptr_->copy_and_assign_to(ptr_);\n        return *this;\n    }\n\n    const any_iterator& operator=(any_iterator&& _iter)\n    {\n        std::swap(ptr_, _iter.ptr_);\n        \/\/old ptr gets destructed via _iter\n        return *this;\n    }\n\n    ~any_iterator() \n    {\n        if (ptr_)\n        {\n            destruct();\n            std::free(ptr_);\n        }\n    }\n\n    bool operator==(const any_iterator& _rhs) const\n    {\n        if (typeid(*ptr_) != typeid(*_rhs.ptr_)) \/\/different types\n            return false;\n        return ptr_->equal_holder(_rhs.ptr_);\n    }\n\n    template <typename IterType>\n    bool operator==(const IterType& _rhs) const {\n        return ptr_->equal(reinterpret_cast<const void*>(&_rhs));\n    }\n\n    template <typename IterType>\n    bool operator!=(const IterType& _rhs) const{\n        return !operator==(_rhs);\n    }\n\n    \/\/\/ Standard pre-increment operator\n    any_iterator& operator++() {\n        ptr_->inc();\n        return *this;\n    }\n\n    \/\/\/ Standard post-increment operator\n    any_iterator operator++(int) {\n        any_iterator cpy(*this);\n        ptr_->inc();\n        return cpy;\n    }\n\n    \/\/\/ Standard pre-decrement operator\n    any_iterator& operator--() {\n        ptr_->dec();\n        return *this;\n    }\n\n    \/\/\/ Standard post-decrement operator\n    any_iterator operator--(int) {\n        any_iterator cpy(*this);\n        ptr_->dec();\n        return cpy;\n    }\n\n    const T& operator*() const {\n        return *ptr_->deref();\n    }\n\n    T& operator*() {\n        return *ptr_->deref();\n    }\n\n    \/\/\/ Standard pointer operator.\n    const T* operator->() const {\n        return ptr_->deref();\n    }\n\n    T* operator->() {\n        return ptr_->deref();\n    }\n};\n\n} \/\/ end namespace tyti\n\ntemplate<typename IterT, typename T>\nbool operator==(const IterT&& _lhs, const tyti::any_iterator<T>&& _rhs)\n{\n    return _rhs.operator==(std::forward<IterT>(_lhs));\n}\n\ntemplate<typename IterT, typename T>\nbool operator!=(IterT&& _lhs, tyti::any_iterator<T>&& _rhs)\n{\n    return _rhs.operator!=(std::forward<IterT>(_lhs));\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ cpsm - fuzzy path matcher\n\/\/ Copyright (C) 2015 Jamie Liu\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#define PY_SSIZE_T_CLEAN\n#include <Python.h>\n\n#include <algorithm>\n#include <memory>\n#include <string>\n\n#include <boost\/utility\/string_ref.hpp>\n\n#include \"ctrlp_util.h\"\n#include \"match.h\"\n#include \"matcher.h\"\n\nnamespace {\n\nstruct PyObjectDeleter {\n  void operator()(PyObject* const p) const {\n    Py_DECREF(p);\n  }\n};\n\n\/\/ Reference-owning, self-releasing PyObject smart pointer.\ntypedef std::unique_ptr<PyObject, PyObjectDeleter> PyObjectPtr;\n\n} \/\/ namespace\n\nextern \"C\" {\n\nstatic PyObject* cpsm_ctrlp_match(PyObject* self, PyObject* args,\n                                  PyObject* kwargs) {\n  static char const* kwlist[] = {\"items\", \"query\", \"limit\", \"mmode\", \"ispath\",\n                                 \"crfile\", nullptr};\n  PyObject* items_obj;\n  char const* query_data;\n  Py_ssize_t query_size;\n  int limit = -1;\n  char const* mmode_data = nullptr;\n  Py_ssize_t mmode_size = 0;\n  int is_path = 0;\n  char const* cur_file_data = nullptr;\n  Py_ssize_t cur_file_size = 0;\n  if (!PyArg_ParseTupleAndKeywords(\n          args, kwargs, \"Os#|is#is#\", const_cast<char**>(kwlist), &items_obj,\n          &query_data, &query_size, &limit, &mmode_data, &mmode_size, &is_path,\n          &cur_file_data, &cur_file_size)) {\n    return nullptr;\n  }\n\n  try {\n    cpsm::MatcherOpts mopts;\n    mopts.cur_file = std::string(cur_file_data, cur_file_size);\n    mopts.is_path = is_path;\n    mopts.item_substr_fn = cpsm::match_mode_item_substr_fn(\n        boost::string_ref(mmode_data, mmode_size));\n    cpsm::Matcher matcher(std::string(query_data, query_size),\n                          std::move(mopts));\n    std::vector<cpsm::Match> matches;\n    PyObjectPtr items_iter(PyObject_GetIter(items_obj));\n    if (!items_iter) {\n      return nullptr;\n    }\n    PyObjectPtr item_obj(PyIter_Next(items_iter.get()));\n    while (item_obj) {\n      char* item_data;\n      Py_ssize_t item_size;\n      if (PyString_AsStringAndSize(item_obj.get(), &item_data, &item_size) < 0) {\n        return nullptr;\n      }\n      boost::string_ref item(item_data, item_size);\n      matcher.append_match(item, matches);\n      item_obj.reset(PyIter_Next(items_iter.get()));\n    }\n    std::sort(matches.begin(), matches.end());\n    if (limit >= 0 && matches.size() > std::size_t(limit)) {\n      matches.resize(limit);\n    }\n\n    PyObjectPtr matches_list(PyList_New(0));\n    if (!matches_list) {\n      return nullptr;\n    }\n    for (auto const& match : matches) {\n      PyObjectPtr match_str(\n          PyString_FromStringAndSize(match.item().data(), match.item().size()));\n      if (!match_str) {\n        return nullptr;\n      }\n      if (PyList_Append(matches_list.get(), match_str.get()) < 0) {\n        return nullptr;\n      }\n    }\n    return matches_list.release();\n  } catch (std::exception const& ex) {\n    PyErr_SetString(PyExc_RuntimeError, ex.what());\n    return nullptr;\n  }\n}\n\nstatic PyMethodDef cpsm_methods[] = {\n    {\"ctrlp_match\", reinterpret_cast<PyCFunction>(cpsm_ctrlp_match),\n     METH_VARARGS | METH_KEYWORDS,\n     \"Match strings with a CtrlP-compatible interface\"},\n    {nullptr, nullptr, 0, nullptr}};\n\nPyMODINIT_FUNC initcpsm() {\n  Py_InitModule(\"cpsm\", cpsm_methods);\n}\n\n}\n<commit_msg>Fix python_extension_main.cc license<commit_after>\/\/ cpsm - fuzzy path matcher\n\/\/ Copyright (C) 2015 Jamie Liu\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#define PY_SSIZE_T_CLEAN\n#include <Python.h>\n\n#include <algorithm>\n#include <memory>\n#include <string>\n\n#include <boost\/utility\/string_ref.hpp>\n\n#include \"ctrlp_util.h\"\n#include \"match.h\"\n#include \"matcher.h\"\n\nnamespace {\n\nstruct PyObjectDeleter {\n  void operator()(PyObject* const p) const {\n    Py_DECREF(p);\n  }\n};\n\n\/\/ Reference-owning, self-releasing PyObject smart pointer.\ntypedef std::unique_ptr<PyObject, PyObjectDeleter> PyObjectPtr;\n\n} \/\/ namespace\n\nextern \"C\" {\n\nstatic PyObject* cpsm_ctrlp_match(PyObject* self, PyObject* args,\n                                  PyObject* kwargs) {\n  static char const* kwlist[] = {\"items\", \"query\", \"limit\", \"mmode\", \"ispath\",\n                                 \"crfile\", nullptr};\n  PyObject* items_obj;\n  char const* query_data;\n  Py_ssize_t query_size;\n  int limit = -1;\n  char const* mmode_data = nullptr;\n  Py_ssize_t mmode_size = 0;\n  int is_path = 0;\n  char const* cur_file_data = nullptr;\n  Py_ssize_t cur_file_size = 0;\n  if (!PyArg_ParseTupleAndKeywords(\n          args, kwargs, \"Os#|is#is#\", const_cast<char**>(kwlist), &items_obj,\n          &query_data, &query_size, &limit, &mmode_data, &mmode_size, &is_path,\n          &cur_file_data, &cur_file_size)) {\n    return nullptr;\n  }\n\n  try {\n    cpsm::MatcherOpts mopts;\n    mopts.cur_file = std::string(cur_file_data, cur_file_size);\n    mopts.is_path = is_path;\n    mopts.item_substr_fn = cpsm::match_mode_item_substr_fn(\n        boost::string_ref(mmode_data, mmode_size));\n    cpsm::Matcher matcher(std::string(query_data, query_size),\n                          std::move(mopts));\n    std::vector<cpsm::Match> matches;\n    PyObjectPtr items_iter(PyObject_GetIter(items_obj));\n    if (!items_iter) {\n      return nullptr;\n    }\n    PyObjectPtr item_obj(PyIter_Next(items_iter.get()));\n    while (item_obj) {\n      char* item_data;\n      Py_ssize_t item_size;\n      if (PyString_AsStringAndSize(item_obj.get(), &item_data, &item_size) < 0) {\n        return nullptr;\n      }\n      boost::string_ref item(item_data, item_size);\n      matcher.append_match(item, matches);\n      item_obj.reset(PyIter_Next(items_iter.get()));\n    }\n    std::sort(matches.begin(), matches.end());\n    if (limit >= 0 && matches.size() > std::size_t(limit)) {\n      matches.resize(limit);\n    }\n\n    PyObjectPtr matches_list(PyList_New(0));\n    if (!matches_list) {\n      return nullptr;\n    }\n    for (auto const& match : matches) {\n      PyObjectPtr match_str(\n          PyString_FromStringAndSize(match.item().data(), match.item().size()));\n      if (!match_str) {\n        return nullptr;\n      }\n      if (PyList_Append(matches_list.get(), match_str.get()) < 0) {\n        return nullptr;\n      }\n    }\n    return matches_list.release();\n  } catch (std::exception const& ex) {\n    PyErr_SetString(PyExc_RuntimeError, ex.what());\n    return nullptr;\n  }\n}\n\nstatic PyMethodDef cpsm_methods[] = {\n    {\"ctrlp_match\", reinterpret_cast<PyCFunction>(cpsm_ctrlp_match),\n     METH_VARARGS | METH_KEYWORDS,\n     \"Match strings with a CtrlP-compatible interface\"},\n    {nullptr, nullptr, 0, nullptr}};\n\nPyMODINIT_FUNC initcpsm() {\n  Py_InitModule(\"cpsm\", cpsm_methods);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Filename: ffmpegVirtualFile.cxx\n\/\/ Created by: jyelon (02Jul07)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) Carnegie Mellon University.  All rights reserved.\n\/\/\n\/\/ All use of this software is subject to the terms of the revised BSD\n\/\/ license.  You should have received a copy of this license along\n\/\/ with this source code in a file named \"LICENSE.\"\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"pandabase.h\"\n\n#ifdef HAVE_FFMPEG\n\n#include \"config_movies.h\"\n#include \"ffmpegVirtualFile.h\"\n#include \"virtualFileSystem.h\"\n\nextern \"C\" {\n  #include \"libavcodec\/avcodec.h\"\n  #include \"libavformat\/avformat.h\"\n}\n\n#ifndef AVSEEK_SIZE\n  #define AVSEEK_SIZE 0x10000\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::Constructor\n\/\/       Access: Public\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nFfmpegVirtualFile::\nFfmpegVirtualFile() : \n  _format_context(NULL),\n  _in(NULL),\n  _owns_in(false)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::Destructor\n\/\/       Access: Public\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nFfmpegVirtualFile::\n~FfmpegVirtualFile() {\n  close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::Copy Constructor\n\/\/       Access: Private\n\/\/  Description: These objects are not meant to be copied.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nFfmpegVirtualFile::\nFfmpegVirtualFile(const FfmpegVirtualFile &copy) {\n  nassertv(false);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::Copy Assignment Operator\n\/\/       Access: Private\n\/\/  Description: These objects are not meant to be copied.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid FfmpegVirtualFile::\noperator = (const FfmpegVirtualFile &copy) {\n  nassertv(false);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::open_vfs\n\/\/       Access: Public\n\/\/  Description: Opens the movie file via Panda's VFS.  Returns true\n\/\/               on success, false on failure.  If successful, use\n\/\/               get_format_context() to get the open file handle.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool FfmpegVirtualFile::\nopen_vfs(const Filename &filename) {\n  close();\n\n  if (ffmpeg_cat.is_debug()) {\n    ffmpeg_cat.debug()\n      << \"ffmpeg open_vfs(\" << filename << \")\\n\";\n  }\n\n  VirtualFileSystem *vfs = VirtualFileSystem::get_global_ptr();\n  Filename fname = filename;\n  fname.set_binary();\n  PT(VirtualFile) vfile = vfs->get_file(fname);\n  if (vfile == NULL) {\n    return false;\n  }\n\n  _in = vfile->open_read_file(true);\n  if (_in == NULL) {\n    return false;\n  }\n\n  _owns_in = true;\n  _start = 0;\n  _size = vfile->get_file_size(_in);\n\n  \/\/ I tried to use av_open_input_stream(), but it (a) required a lot\n  \/\/ of low-level stream analysis calls that really should be\n  \/\/ automatic (and are automatic in av_open_input_file()), and (b)\n  \/\/ was broken on the ffmpeg build I happened to grab.  Screw it,\n  \/\/ clearly av_open_input_file() is the preferred and more\n  \/\/ heavily-exercised interface.  So we'll continue to use url\n  \/\/ synthesis as a hacky hook into this interface.\n\n  \/\/ Nowadays we synthesize a \"url\" that references this pointer.\n  ostringstream strm;\n  strm << \"pandavfs:\/\/\" << (void *)this;\n  string url = strm.str();\n\n  \/\/ Now we can open the stream.\n  int result = \n    av_open_input_file(&_format_context, url.c_str(), NULL, 0, NULL);\n  if (result < 0) {\n    close();\n    return false;\n  }\n\n  return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::open_subfile\n\/\/       Access: Public\n\/\/  Description: Opens the movie file directly from a file on disk\n\/\/               (does not go through the VFS).  Returns true on\n\/\/               success, false on failure.  If successful, use\n\/\/               get_format_context() to get the open file handle.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool FfmpegVirtualFile::\nopen_subfile(const SubfileInfo &info) {\n  close();\n\n  Filename fname = info.get_filename();\n  fname.set_binary();\n  if (!fname.open_read(_file_in)) {\n    return false;\n  }\n  if (ffmpeg_cat.is_debug()) {\n    ffmpeg_cat.debug()\n      << \"ffmpeg open_subfile(\" << fname << \")\\n\";\n  }\n\n  _in = &_file_in;\n  _owns_in = false;\n  _start = info.get_start();\n  _size = info.get_size();\n\n  _in->seekg(_start);\n\n  \/\/ I tried to use av_open_input_stream(), but it (a) required a lot\n  \/\/ of low-level ffmpeg calls that really shouldn't be part of the\n  \/\/ public API (and which aren't necessary with av_open_input_file()\n  \/\/ because they happen implicitly there), and (b) was completely\n  \/\/ broken on the ffmpeg build I happened to grab.  Screw it; clearly\n  \/\/ av_open_input_file() is the preferred and more heavily-exercised\n  \/\/ interface.  So we'll use it, even though it requires a bit of a\n  \/\/ hack.\n\n  \/\/ The hack is that we synthesize a \"url\" that references this\n  \/\/ pointer, then open that url.  This calls pandavfs_open(), which\n  \/\/ decodes the pointer and stores it for future callbacks.\n  ostringstream strm;\n  strm << \"pandavfs:\/\/\" << (void *)this;\n  string url = strm.str();\n\n  \/\/ Now we can open the stream.\n  int result = \n    av_open_input_file(&_format_context, url.c_str(), NULL, 0, NULL);\n  if (result < 0) {\n    close();\n    return false;\n  }\n\n  return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::close\n\/\/       Access: Public\n\/\/  Description: Explicitly closes the opened file.  This is also\n\/\/               called implicitly by the destructor if necessary.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid FfmpegVirtualFile::\nclose() {\n  if (_format_context != NULL) {\n    av_close_input_file(_format_context);\n    _format_context = NULL;\n  }\n\n  if (_owns_in) {\n    nassertv(_in != NULL);\n    VirtualFileSystem::close_read_file(_in);\n    _owns_in = false;\n  }\n  _in = NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::register_protocol\n\/\/       Access: Public, Static\n\/\/  Description: Should be called at startup to attach the appropriate\n\/\/               hooks between Panda and FFMpeg.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid FfmpegVirtualFile::\nregister_protocol() {\n  static bool initialized = false;\n  if (initialized) {\n    return;\n  }\n\n  \/\/ Here's a good place to call this global ffmpeg initialization\n  \/\/ function.\n  av_register_all();\n  \n  \/\/ And this one.\n#if LIBAVFORMAT_VERSION_INT >= 0x351400\n  avformat_network_init();\n#endif\n\n  static URLProtocol protocol;\n  protocol.name = \"pandavfs\";\n  protocol.url_open  = pandavfs_open;\n  protocol.url_read  = pandavfs_read;\n\n#if LIBAVFORMAT_VERSION_INT < 3425280\n  protocol.url_write = (int (*)(URLContext *, unsigned char *, int))pandavfs_write;\n#else\n  protocol.url_write = pandavfs_write;\n#endif\n\n  protocol.url_seek  = pandavfs_seek;\n  protocol.url_close = pandavfs_close;\n#if LIBAVFORMAT_VERSION_INT < 3415296\n  ::register_protocol(&protocol);\n#elif LIBAVFORMAT_VERSION_MAJOR < 53\n  av_register_protocol(&protocol);\n#else\n  av_register_protocol2(&protocol, sizeof(protocol));\n#endif\n\n  \/\/ Let's also register the logging to Panda's notify callback.\n  av_log_set_callback(&log_callback);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_open\n\/\/       Access: Private, Static\n\/\/  Description: A callback to \"open\" a virtual file.  Actually, all\n\/\/               this does is assign the pointer back to the\n\/\/               FfmpegVirtualFile instance.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint FfmpegVirtualFile::\npandavfs_open(URLContext *h, const char *filename, int flags) {\n  filename += 11; \/\/ Skip over \"pandavfs:\/\/\"\n  istringstream strm(filename);\n  void *ptr = 0;\n  strm >> ptr;\n\n  FfmpegVirtualFile *self = (FfmpegVirtualFile *)ptr;\n  h->priv_data = self;\n  return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_read\n\/\/       Access: Private, Static\n\/\/  Description: A callback to read a virtual file.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint FfmpegVirtualFile::\npandavfs_read(URLContext *h, unsigned char *buf, int size) {\n  FfmpegVirtualFile *self = (FfmpegVirtualFile *)(h->priv_data);\n  istream *in = self->_in;\n\n  \/\/ Since we may be simulating a subset of the opened stream, don't\n  \/\/ allow it to read past the \"end\".\n  streampos remaining = self->_start + (streampos)self->_size - in->tellg();\n  if (remaining < size) {\n    if (remaining <= 0) {\n      return 0;\n    }\n\n    size = (int)remaining;\n  }\n\n  in->read((char *)buf, size);\n  int gc = in->gcount();\n  in->clear();\n\n  return gc;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_write\n\/\/       Access: Private, Static\n\/\/  Description: A callback to write a virtual file.  Unimplemented,\n\/\/               because we use ffmpeg for playback only, not for\n\/\/               encoding video streams.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint FfmpegVirtualFile::\npandavfs_write(URLContext *h, const unsigned char *buf, int size) {\n  ffmpeg_cat.warning()\n    << \"ffmpeg is trying to write to the VFS.\\n\";\n  return -1;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_seek\n\/\/       Access: Private, Static\n\/\/  Description: A callback to change the read position on an istream.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint64_t FfmpegVirtualFile::\npandavfs_seek(URLContext *h, int64_t pos, int whence) {\n  FfmpegVirtualFile *self = (FfmpegVirtualFile *)(h->priv_data);\n  istream *in = self->_in;\n\n  switch(whence) {\n  case SEEK_SET: \n    in->seekg(self->_start + (streampos)pos, ios::beg); \n    break;\n\n  case SEEK_CUR: \n    in->seekg(pos, ios::cur); \n    break;\n\n  case SEEK_END: \n    \/\/ For seeks relative to the end, we actually compute the end\n    \/\/ based on _start + _size, and then use ios::beg.\n    in->seekg(self->_start + (streampos)self->_size + (streampos)pos, ios::beg); \n    break;\n\n  case AVSEEK_SIZE: \n    return self->_size; \n\n  default:\n    ffmpeg_cat.error() \n      << \"Illegal parameter to seek in ffmpegVirtualFile\\n\";\n    in->clear();\n    return -1;\n  }\n\n  in->clear();\n  return in->tellg() - self->_start;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_close\n\/\/       Access: Private, Static\n\/\/  Description: A hook to \"close\" a panda VFS file.  Actually it only\n\/\/               clears the associated pointer.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint FfmpegVirtualFile::\npandavfs_close(URLContext *h) {\n  \/\/FfmpegVirtualFile *self = (FfmpegVirtualFile *)(h->priv_data);\n  h->priv_data = 0;\n  return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::log_callback\n\/\/       Access: Private, Static\n\/\/  Description: These callbacks are made when ffmpeg wants to write a\n\/\/               log entry; it redirects into Panda's notify.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid FfmpegVirtualFile::\nlog_callback(void *ptr, int level, const char *fmt, va_list v1) {\n  NotifySeverity severity;\n#ifdef AV_LOG_PANIC\n  if (level <= AV_LOG_PANIC) {\n    severity = NS_fatal;\n  } else\n#endif\n  if (level <= AV_LOG_ERROR) {\n    severity = NS_error;\n#ifdef AV_LOG_WARNING\n  } else if (level <= AV_LOG_WARNING) {\n    severity = NS_warning;\n#endif\n  } else if (level <= AV_LOG_INFO) {\n    severity = NS_info;\n#ifdef AV_LOG_VERBOSE\n  } else if (level <= AV_LOG_VERBOSE) {\n    severity = NS_debug;\n#endif\n  } else \/* level <= AV_LOG_DEBUG *\/ {\n    severity = NS_spam;\n  }\n\n  if (ffmpeg_cat.is_on(severity)) {\n    static const size_t buffer_size = 4096;\n    char *buffer = (char *)alloca(buffer_size);\n    vsnprintf(buffer, buffer_size, fmt, v1);\n    nassertv(strlen(buffer) < buffer_size);\n    ffmpeg_cat.out(severity, true)\n      << buffer;\n  }\n}\n\n#endif \/\/ HAVE_FFMPEG\n<commit_msg>New ffmpeg function<commit_after>\/\/ Filename: ffmpegVirtualFile.cxx\n\/\/ Created by: jyelon (02Jul07)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) Carnegie Mellon University.  All rights reserved.\n\/\/\n\/\/ All use of this software is subject to the terms of the revised BSD\n\/\/ license.  You should have received a copy of this license along\n\/\/ with this source code in a file named \"LICENSE.\"\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"pandabase.h\"\n\n#ifdef HAVE_FFMPEG\n\n#include \"config_movies.h\"\n#include \"ffmpegVirtualFile.h\"\n#include \"virtualFileSystem.h\"\n\nextern \"C\" {\n  #include \"libavcodec\/avcodec.h\"\n  #include \"libavformat\/avformat.h\"\n}\n\n#ifndef AVSEEK_SIZE\n  #define AVSEEK_SIZE 0x10000\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::Constructor\n\/\/       Access: Public\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nFfmpegVirtualFile::\nFfmpegVirtualFile() : \n  _format_context(NULL),\n  _in(NULL),\n  _owns_in(false)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::Destructor\n\/\/       Access: Public\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nFfmpegVirtualFile::\n~FfmpegVirtualFile() {\n  close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::Copy Constructor\n\/\/       Access: Private\n\/\/  Description: These objects are not meant to be copied.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nFfmpegVirtualFile::\nFfmpegVirtualFile(const FfmpegVirtualFile &copy) {\n  nassertv(false);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::Copy Assignment Operator\n\/\/       Access: Private\n\/\/  Description: These objects are not meant to be copied.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid FfmpegVirtualFile::\noperator = (const FfmpegVirtualFile &copy) {\n  nassertv(false);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::open_vfs\n\/\/       Access: Public\n\/\/  Description: Opens the movie file via Panda's VFS.  Returns true\n\/\/               on success, false on failure.  If successful, use\n\/\/               get_format_context() to get the open file handle.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool FfmpegVirtualFile::\nopen_vfs(const Filename &filename) {\n  close();\n\n  if (ffmpeg_cat.is_debug()) {\n    ffmpeg_cat.debug()\n      << \"ffmpeg open_vfs(\" << filename << \")\\n\";\n  }\n\n  VirtualFileSystem *vfs = VirtualFileSystem::get_global_ptr();\n  Filename fname = filename;\n  fname.set_binary();\n  PT(VirtualFile) vfile = vfs->get_file(fname);\n  if (vfile == NULL) {\n    return false;\n  }\n\n  _in = vfile->open_read_file(true);\n  if (_in == NULL) {\n    return false;\n  }\n\n  _owns_in = true;\n  _start = 0;\n  _size = vfile->get_file_size(_in);\n\n  \/\/ I tried to use av_open_input_stream(), but it (a) required a lot\n  \/\/ of low-level stream analysis calls that really should be\n  \/\/ automatic (and are automatic in av_open_input_file()), and (b)\n  \/\/ was broken on the ffmpeg build I happened to grab.  Screw it,\n  \/\/ clearly av_open_input_file() is the preferred and more\n  \/\/ heavily-exercised interface.  So we'll continue to use url\n  \/\/ synthesis as a hacky hook into this interface.\n\n  \/\/ Nowadays we synthesize a \"url\" that references this pointer.\n  ostringstream strm;\n  strm << \"pandavfs:\/\/\" << (void *)this;\n  string url = strm.str();\n\n  \/\/ Now we can open the stream.\n  int result = \n    avformat_open_input(&_format_context, url.c_str(), NULL, NULL);\n  if (result < 0) {\n    _format_context = NULL;\n    close();\n    return false;\n  }\n\n  return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::open_subfile\n\/\/       Access: Public\n\/\/  Description: Opens the movie file directly from a file on disk\n\/\/               (does not go through the VFS).  Returns true on\n\/\/               success, false on failure.  If successful, use\n\/\/               get_format_context() to get the open file handle.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool FfmpegVirtualFile::\nopen_subfile(const SubfileInfo &info) {\n  close();\n\n  Filename fname = info.get_filename();\n  fname.set_binary();\n  if (!fname.open_read(_file_in)) {\n    return false;\n  }\n  if (ffmpeg_cat.is_debug()) {\n    ffmpeg_cat.debug()\n      << \"ffmpeg open_subfile(\" << fname << \")\\n\";\n  }\n\n  _in = &_file_in;\n  _owns_in = false;\n  _start = info.get_start();\n  _size = info.get_size();\n\n  _in->seekg(_start);\n\n  \/\/ I tried to use av_open_input_stream(), but it (a) required a lot\n  \/\/ of low-level ffmpeg calls that really shouldn't be part of the\n  \/\/ public API (and which aren't necessary with av_open_input_file()\n  \/\/ because they happen implicitly there), and (b) was completely\n  \/\/ broken on the ffmpeg build I happened to grab.  Screw it; clearly\n  \/\/ av_open_input_file() is the preferred and more heavily-exercised\n  \/\/ interface.  So we'll use it, even though it requires a bit of a\n  \/\/ hack.\n\n  \/\/ The hack is that we synthesize a \"url\" that references this\n  \/\/ pointer, then open that url.  This calls pandavfs_open(), which\n  \/\/ decodes the pointer and stores it for future callbacks.\n  ostringstream strm;\n  strm << \"pandavfs:\/\/\" << (void *)this;\n  string url = strm.str();\n\n  \/\/ Now we can open the stream.\n  int result = \n    avformat_open_input(&_format_context, url.c_str(), NULL, NULL);\n  if (result < 0) {\n    _format_context = NULL;\n    close();\n    return false;\n  }\n\n  return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::close\n\/\/       Access: Public\n\/\/  Description: Explicitly closes the opened file.  This is also\n\/\/               called implicitly by the destructor if necessary.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid FfmpegVirtualFile::\nclose() {\n  if (_format_context != NULL) {\n    av_close_input_file(_format_context);\n    _format_context = NULL;\n  }\n\n  if (_owns_in) {\n    nassertv(_in != NULL);\n    VirtualFileSystem::close_read_file(_in);\n    _owns_in = false;\n  }\n  _in = NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::register_protocol\n\/\/       Access: Public, Static\n\/\/  Description: Should be called at startup to attach the appropriate\n\/\/               hooks between Panda and FFMpeg.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid FfmpegVirtualFile::\nregister_protocol() {\n  static bool initialized = false;\n  if (initialized) {\n    return;\n  }\n\n  \/\/ Here's a good place to call this global ffmpeg initialization\n  \/\/ function.\n  av_register_all();\n  \n  \/\/ And this one.\n#if LIBAVFORMAT_VERSION_INT >= 0x351400\n  avformat_network_init();\n#endif\n\n  static URLProtocol protocol;\n  protocol.name = \"pandavfs\";\n  protocol.url_open  = pandavfs_open;\n  protocol.url_read  = pandavfs_read;\n\n#if LIBAVFORMAT_VERSION_INT < 3425280\n  protocol.url_write = (int (*)(URLContext *, unsigned char *, int))pandavfs_write;\n#else\n  protocol.url_write = pandavfs_write;\n#endif\n\n  protocol.url_seek  = pandavfs_seek;\n  protocol.url_close = pandavfs_close;\n#if LIBAVFORMAT_VERSION_INT < 3415296\n  ::register_protocol(&protocol);\n#elif LIBAVFORMAT_VERSION_MAJOR < 53\n  av_register_protocol(&protocol);\n#else\n  av_register_protocol2(&protocol, sizeof(protocol));\n#endif\n\n  \/\/ Let's also register the logging to Panda's notify callback.\n  av_log_set_callback(&log_callback);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_open\n\/\/       Access: Private, Static\n\/\/  Description: A callback to \"open\" a virtual file.  Actually, all\n\/\/               this does is assign the pointer back to the\n\/\/               FfmpegVirtualFile instance.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint FfmpegVirtualFile::\npandavfs_open(URLContext *h, const char *filename, int flags) {\n  filename += 11; \/\/ Skip over \"pandavfs:\/\/\"\n  istringstream strm(filename);\n  void *ptr = 0;\n  strm >> ptr;\n\n  FfmpegVirtualFile *self = (FfmpegVirtualFile *)ptr;\n  h->priv_data = self;\n  return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_read\n\/\/       Access: Private, Static\n\/\/  Description: A callback to read a virtual file.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint FfmpegVirtualFile::\npandavfs_read(URLContext *h, unsigned char *buf, int size) {\n  FfmpegVirtualFile *self = (FfmpegVirtualFile *)(h->priv_data);\n  istream *in = self->_in;\n\n  \/\/ Since we may be simulating a subset of the opened stream, don't\n  \/\/ allow it to read past the \"end\".\n  streampos remaining = self->_start + (streampos)self->_size - in->tellg();\n  if (remaining < size) {\n    if (remaining <= 0) {\n      return 0;\n    }\n\n    size = (int)remaining;\n  }\n\n  in->read((char *)buf, size);\n  int gc = in->gcount();\n  in->clear();\n\n  return gc;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_write\n\/\/       Access: Private, Static\n\/\/  Description: A callback to write a virtual file.  Unimplemented,\n\/\/               because we use ffmpeg for playback only, not for\n\/\/               encoding video streams.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint FfmpegVirtualFile::\npandavfs_write(URLContext *h, const unsigned char *buf, int size) {\n  ffmpeg_cat.warning()\n    << \"ffmpeg is trying to write to the VFS.\\n\";\n  return -1;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_seek\n\/\/       Access: Private, Static\n\/\/  Description: A callback to change the read position on an istream.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint64_t FfmpegVirtualFile::\npandavfs_seek(URLContext *h, int64_t pos, int whence) {\n  FfmpegVirtualFile *self = (FfmpegVirtualFile *)(h->priv_data);\n  istream *in = self->_in;\n\n  switch(whence) {\n  case SEEK_SET: \n    in->seekg(self->_start + (streampos)pos, ios::beg); \n    break;\n\n  case SEEK_CUR: \n    in->seekg(pos, ios::cur); \n    break;\n\n  case SEEK_END: \n    \/\/ For seeks relative to the end, we actually compute the end\n    \/\/ based on _start + _size, and then use ios::beg.\n    in->seekg(self->_start + (streampos)self->_size + (streampos)pos, ios::beg); \n    break;\n\n  case AVSEEK_SIZE: \n    return self->_size; \n\n  default:\n    ffmpeg_cat.error() \n      << \"Illegal parameter to seek in ffmpegVirtualFile\\n\";\n    in->clear();\n    return -1;\n  }\n\n  in->clear();\n  return in->tellg() - self->_start;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::pandavfs_close\n\/\/       Access: Private, Static\n\/\/  Description: A hook to \"close\" a panda VFS file.  Actually it only\n\/\/               clears the associated pointer.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint FfmpegVirtualFile::\npandavfs_close(URLContext *h) {\n  \/\/FfmpegVirtualFile *self = (FfmpegVirtualFile *)(h->priv_data);\n  h->priv_data = 0;\n  return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: FfmpegVirtualFile::log_callback\n\/\/       Access: Private, Static\n\/\/  Description: These callbacks are made when ffmpeg wants to write a\n\/\/               log entry; it redirects into Panda's notify.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid FfmpegVirtualFile::\nlog_callback(void *ptr, int level, const char *fmt, va_list v1) {\n  NotifySeverity severity;\n#ifdef AV_LOG_PANIC\n  if (level <= AV_LOG_PANIC) {\n    severity = NS_fatal;\n  } else\n#endif\n  if (level <= AV_LOG_ERROR) {\n    severity = NS_error;\n#ifdef AV_LOG_WARNING\n  } else if (level <= AV_LOG_WARNING) {\n    severity = NS_warning;\n#endif\n  } else if (level <= AV_LOG_INFO) {\n    severity = NS_info;\n#ifdef AV_LOG_VERBOSE\n  } else if (level <= AV_LOG_VERBOSE) {\n    severity = NS_debug;\n#endif\n  } else \/* level <= AV_LOG_DEBUG *\/ {\n    severity = NS_spam;\n  }\n\n  if (ffmpeg_cat.is_on(severity)) {\n    static const size_t buffer_size = 4096;\n    char *buffer = (char *)alloca(buffer_size);\n    vsnprintf(buffer, buffer_size, fmt, v1);\n    nassertv(strlen(buffer) < buffer_size);\n    ffmpeg_cat.out(severity, true)\n      << buffer;\n  }\n}\n\n#endif \/\/ HAVE_FFMPEG\n<|endoftext|>"}
{"text":"<commit_before>#include \"datalayer.h\"\n#include \"persons.h\"\n#include \"sortings.h\"\n\n#include <string>\n#include <vector>\n#include <fstream>\n#include <string>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nDataLayer::DataLayer()\n{\n   \/\/ loadFromFile();\n}\nvector<Persons> DataLayer::getVector()\n{\n    return people;\n}\n\nvoid DataLayer::loadFromFile()\n{\n\n    Persons p;\n    ifstream inStream;\n\n    inStream.open(\"science.txt\");\n\n    if(!inStream.is_open())\n    {\n        cout << \"We could not find the text file!.\" << endl;\n    }\n    if(inStream.is_open())\n        cout << \"Right\" << endl;\n    while(inStream >> p)\n    {\n     \/\/\/       cout << p;\n\n        addPerson(p);\n\n    }\n    inStream.close();\n }\n\nvoid DataLayer::saveToFile()\n{\n    fstream out;\n\n    out.open(\"textFile.txt\");\n\n    for (size_t i = 0; i < people.size(); i++)\n    {\n        out << people[i] << endl;\n    }\n\n    out.close();\n}\n\nvoid DataLayer::addPerson(const Persons& p) {\n    people.push_back(p);\n}\n\nvoid DataLayer::listPersons()\n{\n\n}\n\nbool sortByName2(const Persons &lhs, const Persons &rhs) { return lhs.getName() < rhs.getName(); } \/\/reyndi að nota klasaföll, en það vill þýðandinn ekki.\nbool sortByGender2(const Persons &lhs, const Persons &rhs) { return lhs.getGender() < rhs.getGender(); }\nbool sortByBirthYear2(const Persons &lhs, const Persons &rhs) { return lhs.getBirthYear() < rhs.getBirthYear(); }\nbool sortByDeathYear2(const Persons &lhs, const Persons &rhs) { return lhs.getDeathYear() < rhs.getDeathYear(); }\n\nvoid DataLayer::sortByName()\n{\n    sort(people.begin(), people.end(), sortByName2);\n}\n\nvoid DataLayer::sortByBirthYear()\n{\n    sort(people.begin(), people.end(), sortByBirthYear2);\n}\n\nvoid DataLayer::sortByDeathYear()\n{\n    sort(people.begin(), people.end(), sortByDeathYear2);\n}\n\nvoid DataLayer::sortByGender()\n{\n    sort(people.begin(), people.end(), sortByGender2);\n}\n<commit_msg>laga sma<commit_after>#include \"datalayer.h\"\n#include \"persons.h\"\n#include \"sortings.h\"\n\n#include <string>\n#include <vector>\n#include <fstream>\n#include <string>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nDataLayer::DataLayer()\n{\n   \/\/ loadFromFile();\n}\nvector<Persons> DataLayer::getVector()\n{\n    return people;\n}\n\nvoid DataLayer::loadFromFile()\n{\n\n    Persons p;\n    ifstream inStream;\n\n    inStream.open(\"science.txt\");\n\n    if(!inStream.is_open())\n    {\n        cout << \"We could not find the text file!.\" << endl;\n    }\n\n    while(inStream >> p)\n    {\n     \/\/\/       cout << p;\n\n        addPerson(p);\n\n    }\n    inStream.close();\n }\n\nvoid DataLayer::saveToFile()\n{\n    fstream out;\n\n    out.open(\"textFile.txt\");\n\n    for (size_t i = 0; i < people.size(); i++)\n    {\n        out << people[i] << endl;\n    }\n\n    out.close();\n}\n\nvoid DataLayer::addPerson(const Persons& p) {\n    people.push_back(p);\n}\n\nvoid DataLayer::listPersons()\n{\n\n}\n\nbool sortByName2(const Persons &lhs, const Persons &rhs) { return lhs.getName() < rhs.getName(); } \/\/reyndi að nota klasaföll, en það vill þýðandinn ekki.\nbool sortByGender2(const Persons &lhs, const Persons &rhs) { return lhs.getGender() < rhs.getGender(); }\nbool sortByBirthYear2(const Persons &lhs, const Persons &rhs) { return lhs.getBirthYear() < rhs.getBirthYear(); }\nbool sortByDeathYear2(const Persons &lhs, const Persons &rhs) { return lhs.getDeathYear() < rhs.getDeathYear(); }\n\nvoid DataLayer::sortByName()\n{\n    sort(people.begin(), people.end(), sortByName2);\n}\n\nvoid DataLayer::sortByBirthYear()\n{\n    sort(people.begin(), people.end(), sortByBirthYear2);\n}\n\nvoid DataLayer::sortByDeathYear()\n{\n    sort(people.begin(), people.end(), sortByDeathYear2);\n}\n\nvoid DataLayer::sortByGender()\n{\n    sort(people.begin(), people.end(), sortByGender2);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2015 Cloudius Systems\n *\/\n\n#include \"commitlog.hh\"\n#include <db\/commitlog\/commitlog.hh>\n#include \"api\/api-doc\/commitlog.json.hh\"\n#include <vector>\n\nnamespace api {\n\nvoid set_commitlog(http_context& ctx, routes& r) {\n    httpd::commitlog_json::get_active_segment_names.set(r,\n            [&ctx](std::unique_ptr<request> req) {\n        auto res = make_shared<std::vector<sstring>>();\n        return ctx.db.map_reduce([res](std::vector<sstring> names) {\n            res->insert(res->end(), names.begin(), names.end());\n        }, [](database& db) {\n            if (db.commitlog() == nullptr) {\n                return make_ready_future<std::vector<sstring>>(std::vector<sstring>());\n            }\n            return make_ready_future<std::vector<sstring>>(db.commitlog()->get_active_segment_names());\n        }).then([res] {\n            return make_ready_future<json::json_return_type>(*res.get());\n        });\n    });\n\n    \/\/ We currently do not support archive segments\n    httpd::commitlog_json::get_archiving_segment_names.set(r, [](const_req req) {\n        std::vector<sstring> res;\n        return res;\n    });\n\n    httpd::commitlog_json::get_completed_tasks.set(r, [](std::unique_ptr<request> req) {\n        \/\/TBD\n        return make_ready_future<json::json_return_type>(0);\n    });\n\n    httpd::commitlog_json::get_pending_tasks.set(r, [](std::unique_ptr<request> req) {\n        \/\/TBD\n        return make_ready_future<json::json_return_type>(0);\n    });\n\n    httpd::commitlog_json::get_total_commit_log_size.set(r, [](std::unique_ptr<request> req) {\n        \/\/TBD\n        return make_ready_future<json::json_return_type>(0);\n    });\n}\n\n}\n<commit_msg>Commitlog API: Implement some more metrics accessors<commit_after>\/*\n * Copyright 2015 Cloudius Systems\n *\/\n\n#include \"commitlog.hh\"\n#include <db\/commitlog\/commitlog.hh>\n#include \"api\/api-doc\/commitlog.json.hh\"\n#include <vector>\n\nnamespace api {\n\ntemplate<typename Func>\nstatic auto acquire_cl_metric(http_context& ctx, Func&& func) {\n    typedef std::result_of_t<Func(db::commitlog *)> ret_type;\n\n    return ctx.db.map_reduce0([func = std::forward<Func>(func)](database& db) {\n        if (db.commitlog() == nullptr) {\n            return make_ready_future<ret_type>();\n        }\n        return make_ready_future<ret_type>(func(db.commitlog()));\n    }, ret_type(), std::plus<ret_type>()).then([](ret_type res) {\n        return make_ready_future<json::json_return_type>(res);\n    });\n}\n\nvoid set_commitlog(http_context& ctx, routes& r) {\n    httpd::commitlog_json::get_active_segment_names.set(r,\n            [&ctx](std::unique_ptr<request> req) {\n        auto res = make_shared<std::vector<sstring>>();\n        return ctx.db.map_reduce([res](std::vector<sstring> names) {\n            res->insert(res->end(), names.begin(), names.end());\n        }, [](database& db) {\n            if (db.commitlog() == nullptr) {\n                return make_ready_future<std::vector<sstring>>(std::vector<sstring>());\n            }\n            return make_ready_future<std::vector<sstring>>(db.commitlog()->get_active_segment_names());\n        }).then([res] {\n            return make_ready_future<json::json_return_type>(*res.get());\n        });\n    });\n\n    \/\/ We currently do not support archive segments\n    httpd::commitlog_json::get_archiving_segment_names.set(r, [](const_req req) {\n        std::vector<sstring> res;\n        return res;\n    });\n\n    httpd::commitlog_json::get_completed_tasks.set(r, [&ctx](std::unique_ptr<request> req) {\n        return acquire_cl_metric(ctx, std::bind(&db::commitlog::get_completed_tasks, std::placeholders::_1));\n    });\n\n    httpd::commitlog_json::get_pending_tasks.set(r, [&ctx](std::unique_ptr<request> req) {\n        return acquire_cl_metric(ctx, std::bind(&db::commitlog::get_pending_tasks, std::placeholders::_1));\n    });\n\n    httpd::commitlog_json::get_total_commit_log_size.set(r, [&ctx](std::unique_ptr<request> req) {\n        return acquire_cl_metric(ctx, std::bind(&db::commitlog::get_total_size, std::placeholders::_1));\n    });\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The LevelDB 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. See the AUTHORS file for names of contributors.\n\n#include \"db\/builder.h\"\n\n#include \"db\/filename.h\"\n#include \"db\/dbformat.h\"\n#include \"db\/table_cache.h\"\n#include \"db\/version_edit.h\"\n#include \"leveldb\/db.h\"\n#include \"leveldb\/env.h\"\n#include \"leveldb\/iterator.h\"\n\nnamespace leveldb {\n\nStatus BuildTable(const std::string& dbname,\n                  Env* env,\n                  const Options& options,\n                  TableCache* table_cache,\n                  Iterator* iter,\n                  FileMetaData* meta) {\n  Status s;\n  meta->file_size = 0;\n  iter->SeekToFirst();\n\n  std::string fname = TableFileName(dbname, meta->number);\n  if (iter->Valid()) {\n    WritableFile* file;\n    s = env->NewWritableFile(fname, &file);\n    if (!s.ok()) {\n      return s;\n    }\n\n    TableBuilder* builder = new TableBuilder(options, file);\n    meta->smallest.DecodeFrom(iter->key());\n    for (; iter->Valid(); iter->Next()) {\n      Slice key = iter->key();\n      meta->largest.DecodeFrom(key);\n      builder->Add(key, iter->value());\n    }\n\n    \/\/ Finish and check for builder errors\n    if (s.ok()) {\n      s = builder->Finish();\n      if (s.ok()) {\n        meta->file_size = builder->FileSize();\n        assert(meta->file_size > 0);\n      }\n    } else {\n      builder->Abandon();\n    }\n    delete builder;\n\n    \/\/ Finish and check for file errors\n    if (s.ok()) {\n      s = file->Sync();\n    }\n    if (s.ok()) {\n      s = file->Close();\n    }\n    delete file;\n    file = NULL;\n\n    if (s.ok()) {\n      \/\/ Verify that the table is usable\n      Iterator* it = table_cache->NewIterator(ReadOptions(),\n                                              meta->number,\n                                              meta->file_size);\n      s = it->status();\n      delete it;\n    }\n  }\n\n  \/\/ Check for input iterator errors\n  if (!iter->status().ok()) {\n    s = iter->status();\n  }\n\n  if (s.ok() && meta->file_size > 0) {\n    \/\/ Keep it\n  } else {\n    env->DeleteFile(fname);\n  }\n  return s;\n}\n\n}  \/\/ namespace leveldb\n<commit_msg>Remove confusing and unnecessary if.<commit_after>\/\/ Copyright (c) 2011 The LevelDB 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. See the AUTHORS file for names of contributors.\n\n#include \"db\/builder.h\"\n\n#include \"db\/filename.h\"\n#include \"db\/dbformat.h\"\n#include \"db\/table_cache.h\"\n#include \"db\/version_edit.h\"\n#include \"leveldb\/db.h\"\n#include \"leveldb\/env.h\"\n#include \"leveldb\/iterator.h\"\n\nnamespace leveldb {\n\nStatus BuildTable(const std::string& dbname,\n                  Env* env,\n                  const Options& options,\n                  TableCache* table_cache,\n                  Iterator* iter,\n                  FileMetaData* meta) {\n  Status s;\n  meta->file_size = 0;\n  iter->SeekToFirst();\n\n  std::string fname = TableFileName(dbname, meta->number);\n  if (iter->Valid()) {\n    WritableFile* file;\n    s = env->NewWritableFile(fname, &file);\n    if (!s.ok()) {\n      return s;\n    }\n\n    TableBuilder* builder = new TableBuilder(options, file);\n    meta->smallest.DecodeFrom(iter->key());\n    for (; iter->Valid(); iter->Next()) {\n      Slice key = iter->key();\n      meta->largest.DecodeFrom(key);\n      builder->Add(key, iter->value());\n    }\n\n    \/\/ Finish and check for builder errors\n    s = builder->Finish();\n    if (s.ok()) {\n      meta->file_size = builder->FileSize();\n      assert(meta->file_size > 0);\n    }\n    delete builder;\n\n    \/\/ Finish and check for file errors\n    if (s.ok()) {\n      s = file->Sync();\n    }\n    if (s.ok()) {\n      s = file->Close();\n    }\n    delete file;\n    file = NULL;\n\n    if (s.ok()) {\n      \/\/ Verify that the table is usable\n      Iterator* it = table_cache->NewIterator(ReadOptions(),\n                                              meta->number,\n                                              meta->file_size);\n      s = it->status();\n      delete it;\n    }\n  }\n\n  \/\/ Check for input iterator errors\n  if (!iter->status().ok()) {\n    s = iter->status();\n  }\n\n  if (s.ok() && meta->file_size > 0) {\n    \/\/ Keep it\n  } else {\n    env->DeleteFile(fname);\n  }\n  return s;\n}\n\n}  \/\/ namespace leveldb\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Author: Brendan Le Foll <brendan.le.foll@intel.com>\n * Copyright (c) 2014 Intel Corporation.\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#pragma once\n\n#include \"spi.h\"\n#include \"types.hpp\"\n#include <stdexcept>\n\nnamespace mraa\n{\n\n\/**\n * MRAA SPI Modes\n *\/\ntypedef enum {\n    SPI_MODE0 = 0, \/**< CPOL = 0, CPHA = 0, Clock idle low, data is clocked in on rising edge,\n                      output data (change) on falling edge *\/\n    SPI_MODE1 = 1, \/**< CPOL = 0, CPHA = 1, Clock idle low, data is clocked in on falling edge,\n                      output data (change) on rising edge *\/\n    SPI_MODE2 = 2, \/**< CPOL = 1, CPHA = 0, Clock idle low, data is clocked in on falling edge,\n                      output data (change) on rising edge *\/\n    SPI_MODE3 = 3, \/**< CPOL = 1, CPHA = 1, Clock idle low, data is clocked in on rising, edge\n                      output data (change) on falling edge *\/\n} Spi_Mode;\n\n\n\/**\n* @brief API to Serial Peripheral Interface\n*\n* This file defines the SPI interface for libmraa\n*\n* @snippet Spi-pot.cpp Interesting\n*\/\nclass Spi\n{\n  public:\n    \/**\n     * Initialise SPI object using the board mapping to set muxes\n     *\n     * @param bus to use, as listed in the platform definition, normally 0\n     *\/\n    Spi(int bus)\n    {\n        m_spi = mraa_spi_init(bus);\n\n        if (m_spi == NULL) {\n            throw std::invalid_argument(\"Error initialising SPI bus\");\n        }\n    }\n\n    \/**\n     * Closes spi bus\n     *\/\n    ~Spi()\n    {\n        mraa_spi_stop(m_spi);\n    }\n\n    \/**\n     * Set the SPI device mode. see spidev0-3\n     *\n     * @param mode the mode. See Linux spidev doc\n     * @return Result of operation\n     *\/\n    Result\n    mode(Spi_Mode mode)\n    {\n        return (Result) mraa_spi_mode(m_spi, (mraa_spi_mode_t) mode);\n    }\n\n    \/**\n     * Set the SPI device operating clock frequency\n     *\n     * @param hz the frequency to set in hz\n     * @return Result of operation\n     *\/\n    Result\n    frequency(int hz)\n    {\n        return (Result) mraa_spi_frequency(m_spi, hz);\n    }\n\n    \/**\n     * Write single byte to the SPI device\n     *\n     * @param data the byte to send\n     * @return data received on the miso line or -1 in case of error\n     *\/\n    int\n    writeByte(uint8_t data)\n    {\n        return mraa_spi_write(m_spi, (uint8_t) data);\n    }\n\n    \/**\n     * Write single byte to the SPI device\n     *\n     * @param data the byte to send\n     * @return data received on the miso line\n     *\/\n    uint16_t\n    write_word(uint16_t data)\n    {\n        return mraa_spi_write_word(m_spi, (uint16_t) data);\n    }\n\n    \/**\n     * Write buffer of bytes to SPI device The pointer return has to be\n     * free'd by the caller. It will return a NULL pointer in cases of\n     * error\n     *\n     * @param txBuf buffer to send\n     * @param length size of buffer to send\n     * @return uint8_t* data received on the miso line. Same length as passed in\n     *\/\n    uint8_t*\n    write(uint8_t* txBuf, int length)\n    {\n        return mraa_spi_write_buf(m_spi, txBuf, length);\n    }\n\n#ifndef SWIG\n    \/**\n     * Write buffer of bytes to SPI device The pointer return has to be\n     * free'd by the caller. It will return a NULL pointer in cases of\n     * error\n     *\n     * @param txBuf buffer to send\n     * @param length size of buffer (in bytes) to send\n     * @return uint8_t* data received on the miso line. Same length as passed in\n     *\/\n    uint16_t*\n    write_word(uint16_t* txBuf, int length)\n    {\n        return mraa_spi_write_buf_word(m_spi, txBuf, length);\n    }\n#endif\n\n#ifndef SWIG\n    \/**\n     * Transfer data to and from SPI device Receive pointer may be null if\n     * return data is not needed.\n     *\n     * @param txBuf buffer to send\n     * @param rxBuf buffer to optionally receive data from spi device\n     * @param length size of buffer to send\n     * @return Result of operation\n     *\/\n    Result\n    transfer(uint8_t* txBuf, uint8_t* rxBuf, int length)\n    {\n        return (Result) mraa_spi_transfer_buf(m_spi, txBuf, rxBuf, length);\n    }\n\n    \/**\n     * Transfer data to and from SPI device Receive pointer may be null if\n     * return data is not needed.\n     *\n     * @param txBuf buffer to send\n     * @param rxBuf buffer to optionally receive data from spi device\n     * @param length size of buffer to send\n     * @return Result of operation\n     *\/\n    Result\n    transfer_word(uint16_t* txBuf, uint16_t* rxBuf, int length)\n    {\n        return (Result) mraa_spi_transfer_buf_word(m_spi, txBuf, rxBuf, length);\n    }\n#endif\n\n    \/**\n     * Change the SPI lsb mode\n     *\n     * @param lsb Use least significant bit transmission - 0 for msbi\n     * @return Result of operation\n     *\/\n    Result\n    lsbmode(bool lsb)\n    {\n        return (Result) mraa_spi_lsbmode(m_spi, (mraa_boolean_t) lsb);\n    }\n\n    \/**\n     * Set bits per mode on transaction, default is 8\n     *\n     * @param bits bits per word\n     * @return Result of operation\n     *\/\n    Result\n    bitPerWord(unsigned int bits)\n    {\n        return (Result) mraa_spi_bit_per_word(m_spi, bits);\n    }\n\n  private:\n    mraa_spi_context m_spi;\n};\n}\n<commit_msg>Spi: Constructor with chip select added in cpp header<commit_after>\/*\n * Author: Brendan Le Foll <brendan.le.foll@intel.com>\n * Copyright (c) 2014 Intel Corporation.\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#pragma once\n\n#include \"spi.h\"\n#include \"types.hpp\"\n#include <stdexcept>\n\nnamespace mraa\n{\n\n\/**\n * MRAA SPI Modes\n *\/\ntypedef enum {\n    SPI_MODE0 = 0, \/**< CPOL = 0, CPHA = 0, Clock idle low, data is clocked in on rising edge,\n                      output data (change) on falling edge *\/\n    SPI_MODE1 = 1, \/**< CPOL = 0, CPHA = 1, Clock idle low, data is clocked in on falling edge,\n                      output data (change) on rising edge *\/\n    SPI_MODE2 = 2, \/**< CPOL = 1, CPHA = 0, Clock idle low, data is clocked in on falling edge,\n                      output data (change) on rising edge *\/\n    SPI_MODE3 = 3, \/**< CPOL = 1, CPHA = 1, Clock idle low, data is clocked in on rising, edge\n                      output data (change) on falling edge *\/\n} Spi_Mode;\n\n\n\/**\n* @brief API to Serial Peripheral Interface\n*\n* This file defines the SPI interface for libmraa\n*\n* @snippet Spi-pot.cpp Interesting\n*\/\nclass Spi\n{\n  public:\n    \/**\n     * Initialise SPI object using the board mapping to set muxes\n     *\n     * @param bus to use, as listed in the platform definition, normally 0\n     *\/\n    Spi(int bus)\n    {\n        m_spi = mraa_spi_init(bus);\n\n        if (m_spi == NULL) {\n            throw std::invalid_argument(\"Error initialising SPI bus\");\n        }\n    }\n\n    Spi(int bus, int cs)\n    {\n        m_spi = mraa_spi_init_raw(bus, cs);\n\n        if (m_spi == NULL) {\n            throw std::invalid_argument(\"Error initialising SPI bus\");\n        }\n    }\n\n    \/**\n     * Closes spi bus\n     *\/\n    ~Spi()\n    {\n        mraa_spi_stop(m_spi);\n    }\n\n    \/**\n     * Set the SPI device mode. see spidev0-3\n     *\n     * @param mode the mode. See Linux spidev doc\n     * @return Result of operation\n     *\/\n    Result\n    mode(Spi_Mode mode)\n    {\n        return (Result) mraa_spi_mode(m_spi, (mraa_spi_mode_t) mode);\n    }\n\n    \/**\n     * Set the SPI device operating clock frequency\n     *\n     * @param hz the frequency to set in hz\n     * @return Result of operation\n     *\/\n    Result\n    frequency(int hz)\n    {\n        return (Result) mraa_spi_frequency(m_spi, hz);\n    }\n\n    \/**\n     * Write single byte to the SPI device\n     *\n     * @param data the byte to send\n     * @return data received on the miso line or -1 in case of error\n     *\/\n    int\n    writeByte(uint8_t data)\n    {\n        return mraa_spi_write(m_spi, (uint8_t) data);\n    }\n\n    \/**\n     * Write single byte to the SPI device\n     *\n     * @param data the byte to send\n     * @return data received on the miso line\n     *\/\n    uint16_t\n    write_word(uint16_t data)\n    {\n        return mraa_spi_write_word(m_spi, (uint16_t) data);\n    }\n\n    \/**\n     * Write buffer of bytes to SPI device The pointer return has to be\n     * free'd by the caller. It will return a NULL pointer in cases of\n     * error\n     *\n     * @param txBuf buffer to send\n     * @param length size of buffer to send\n     * @return uint8_t* data received on the miso line. Same length as passed in\n     *\/\n    uint8_t*\n    write(uint8_t* txBuf, int length)\n    {\n        return mraa_spi_write_buf(m_spi, txBuf, length);\n    }\n\n#ifndef SWIG\n    \/**\n     * Write buffer of bytes to SPI device The pointer return has to be\n     * free'd by the caller. It will return a NULL pointer in cases of\n     * error\n     *\n     * @param txBuf buffer to send\n     * @param length size of buffer (in bytes) to send\n     * @return uint8_t* data received on the miso line. Same length as passed in\n     *\/\n    uint16_t*\n    write_word(uint16_t* txBuf, int length)\n    {\n        return mraa_spi_write_buf_word(m_spi, txBuf, length);\n    }\n#endif\n\n#ifndef SWIG\n    \/**\n     * Transfer data to and from SPI device Receive pointer may be null if\n     * return data is not needed.\n     *\n     * @param txBuf buffer to send\n     * @param rxBuf buffer to optionally receive data from spi device\n     * @param length size of buffer to send\n     * @return Result of operation\n     *\/\n    Result\n    transfer(uint8_t* txBuf, uint8_t* rxBuf, int length)\n    {\n        return (Result) mraa_spi_transfer_buf(m_spi, txBuf, rxBuf, length);\n    }\n\n    \/**\n     * Transfer data to and from SPI device Receive pointer may be null if\n     * return data is not needed.\n     *\n     * @param txBuf buffer to send\n     * @param rxBuf buffer to optionally receive data from spi device\n     * @param length size of buffer to send\n     * @return Result of operation\n     *\/\n    Result\n    transfer_word(uint16_t* txBuf, uint16_t* rxBuf, int length)\n    {\n        return (Result) mraa_spi_transfer_buf_word(m_spi, txBuf, rxBuf, length);\n    }\n#endif\n\n    \/**\n     * Change the SPI lsb mode\n     *\n     * @param lsb Use least significant bit transmission - 0 for msbi\n     * @return Result of operation\n     *\/\n    Result\n    lsbmode(bool lsb)\n    {\n        return (Result) mraa_spi_lsbmode(m_spi, (mraa_boolean_t) lsb);\n    }\n\n    \/**\n     * Set bits per mode on transaction, default is 8\n     *\n     * @param bits bits per word\n     * @return Result of operation\n     *\/\n    Result\n    bitPerWord(unsigned int bits)\n    {\n        return (Result) mraa_spi_bit_per_word(m_spi, bits);\n    }\n\n  private:\n    mraa_spi_context m_spi;\n};\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- TypeContextInfo.cpp ----------------------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2019 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\/IDE\/TypeContextInfo.h\"\n#include \"ExprContextAnalysis.h\"\n#include \"swift\/AST\/GenericEnvironment.h\"\n#include \"swift\/AST\/NameLookup.h\"\n#include \"swift\/AST\/USRGeneration.h\"\n#include \"swift\/Parse\/CodeCompletionCallbacks.h\"\n#include \"swift\/Sema\/IDETypeChecking.h\"\n#include \"clang\/AST\/Attr.h\"\n#include \"clang\/AST\/Decl.h\"\n\nusing namespace swift;\nusing namespace ide;\n\nclass ContextInfoCallbacks : public CodeCompletionCallbacks {\n  TypeContextInfoConsumer &Consumer;\n  SourceLoc Loc;\n  Expr *ParsedExpr = nullptr;\n  DeclContext *CurDeclContext = nullptr;\n\n  void getImplicitMembers(Type T, SmallVectorImpl<ValueDecl *> &Result);\n\npublic:\n  ContextInfoCallbacks(Parser &P, TypeContextInfoConsumer &Consumer)\n      : CodeCompletionCallbacks(P), Consumer(Consumer) {}\n\n  void completeExpr() override{};\n\n  \/\/ Ignore callbacks for suffix completions\n  \/\/ {\n  void completeDotExpr(Expr *E, SourceLoc DotLoc) override{};\n  void completePostfixExpr(Expr *E, bool hasSpace) override{};\n  void completeExprSuper(SuperRefExpr *SRE) override{};\n  void completeExprSuperDot(SuperRefExpr *SRE) override{};\n  \/\/ }\n\n  \/\/ Ignore non-expression callbacks.\n  \/\/ {\n  void completeInPrecedenceGroup(SyntaxKind SK) override{};\n  void completePoundAvailablePlatform() override{};\n  void completeExprKeyPath(KeyPathExpr *KPE, SourceLoc DotLoc) override {}\n  void completeTypeSimpleBeginning() override {}\n  void completeTypeIdentifierWithDot(IdentTypeRepr *ITR) override {}\n  void completeTypeIdentifierWithoutDot(IdentTypeRepr *ITR) override {}\n  void completeDeclAttrKeyword(Decl *D, bool Sil, bool Param) override {}\n  void completeDeclAttrParam(DeclAttrKind DK, int Index) override {}\n  void completeNominalMemberBeginning(\n      SmallVectorImpl<StringRef> &Keywords) override {}\n  void completeImportDecl(\n      std::vector<std::pair<Identifier, SourceLoc>> &Path) override {}\n  void completeAfterPoundExpr(CodeCompletionExpr *E,\n                              Optional<StmtKind> ParentKind) override {}\n  void completeAfterPoundDirective() override {}\n  void completePlatformCondition() override {}\n  void completeGenericParams(TypeLoc TL) override {}\n  void completeAfterIfStmt(bool hasElse) override {}\n  void completeAccessorBeginning() override{};\n  \/\/ }\n\n  void completeStmtOrExpr() override{};\n  void completePostfixExprBeginning(CodeCompletionExpr *E) override;\n  void completeForEachSequenceBeginning(CodeCompletionExpr *E) override;\n  void completeCaseStmtBeginning() override;\n\n  void completeAssignmentRHS(AssignExpr *E) override{};\n  void completeCallArg(CodeCompletionExpr *E) override;\n  void completeReturnStmt(CodeCompletionExpr *E) override;\n  void completeYieldStmt(CodeCompletionExpr *E,\n                         Optional<unsigned> yieldIndex) override;\n\n  void completeUnresolvedMember(CodeCompletionExpr *E,\n                                SourceLoc DotLoc) override;\n  void completeCaseStmtDotPrefix() override;\n\n  void completePostfixExprParen(Expr *E, Expr *CodeCompletionE) override{};\n\n  void doneParsing() override;\n};\n\nvoid ContextInfoCallbacks::completePostfixExprBeginning(CodeCompletionExpr *E) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\n\nvoid ContextInfoCallbacks::completeForEachSequenceBeginning(\n    CodeCompletionExpr *E) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\nvoid ContextInfoCallbacks::completeCallArg(CodeCompletionExpr *E) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\nvoid ContextInfoCallbacks::completeReturnStmt(CodeCompletionExpr *E) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\nvoid ContextInfoCallbacks::completeYieldStmt(CodeCompletionExpr *E,\n                                             Optional<unsigned> yieldIndex) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\nvoid ContextInfoCallbacks::completeUnresolvedMember(CodeCompletionExpr *E,\n                                                    SourceLoc DotLoc) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\n\nvoid ContextInfoCallbacks::completeCaseStmtBeginning() {\n  \/\/ TODO: Implement?\n}\nvoid ContextInfoCallbacks::completeCaseStmtDotPrefix() {\n  \/\/ TODO: Implement?\n}\n\nvoid ContextInfoCallbacks::doneParsing() {\n  if (!ParsedExpr)\n    return;\n\n  typeCheckContextUntil(\n      CurDeclContext,\n      CurDeclContext->getASTContext().SourceMgr.getCodeCompletionLoc());\n\n  ExprContextInfo Info(CurDeclContext, ParsedExpr);\n\n  llvm::SmallSet<CanType, 2> seenTypes;\n  SmallVector<TypeContextInfoItem, 2> results;\n\n  for (auto T : Info.getPossibleTypes()) {\n    if (T->is<ErrorType>() || T->is<UnresolvedType>())\n      continue;\n    if (auto env = CurDeclContext->getGenericEnvironmentOfContext())\n      T = env->mapTypeIntoContext(T);\n\n    \/\/ TODO: Do we need '.none' for Optionals?\n    auto objT = T->lookThroughAllOptionalTypes();\n\n    if (!seenTypes.insert(objT->getCanonicalType()).second)\n      continue;\n\n    results.emplace_back(T);\n    auto &item = results.back();\n    getImplicitMembers(objT, item.ImplicitMembers);\n  }\n\n  Consumer.handleResults(results);\n}\n\nvoid ContextInfoCallbacks::getImplicitMembers(\n    Type T, SmallVectorImpl<ValueDecl *> &Result) {\n\n  if (!T->mayHaveMembers())\n    return;\n\n  class LocalConsumer : public VisibleDeclConsumer {\n    DeclContext *DC;\n    LazyResolver *TypeResolver;\n    ModuleDecl *CurModule;\n    Type T;\n    SmallVectorImpl<ValueDecl *> &Result;\n\n    bool canBeImplictMember(ValueDecl *VD) {\n      if (VD->isOperator())\n        return false;\n\n      if (!VD->hasInterfaceType()) {\n        TypeResolver->resolveDeclSignature(VD);\n        if (!VD->hasInterfaceType())\n          return false;\n      }\n\n      \/\/ Enum element decls can always be referenced by implicit member\n      \/\/ expression.\n      if (isa<EnumElementDecl>(VD))\n        return true;\n\n      \/\/ Static properties which is convertible to 'Self'.\n      if (isa<VarDecl>(VD) && VD->isStatic()) {\n        auto declTy = T->getTypeOfMember(CurModule, VD);\n        if (declTy->isEqual(T) || swift::isConvertibleTo(declTy, T, *DC))\n          return true;\n      }\n\n      return false;\n    }\n\n  public:\n    LocalConsumer(DeclContext *DC, Type T, SmallVectorImpl<ValueDecl *> &Result)\n        : DC(DC), TypeResolver(DC->getASTContext().getLazyResolver()),\n          CurModule(DC->getParentModule()), T(T), Result(Result) {}\n\n    void foundDecl(ValueDecl *VD, DeclVisibilityKind Reason) {\n      if (canBeImplictMember(VD) && !VD->shouldHideFromEditor())\n        Result.push_back(VD);\n    }\n\n  } LocalConsumer(CurDeclContext, T, Result);\n\n  lookupVisibleMemberDecls(LocalConsumer, MetatypeType::get(T), CurDeclContext,\n                           CurDeclContext->getASTContext().getLazyResolver(),\n                           \/*includeInstanceMembers=*\/false);\n}\n\nvoid PrintingTypeContextInfoConsumer::handleResults(\n    ArrayRef<TypeContextInfoItem> results) {\n  OS << \"-----BEGIN TYPE CONTEXT INFO-----\\n\";\n  for (auto resultItem : results) {\n    OS << \"- TypeName: \";\n    resultItem.ExpectedTy.print(OS);\n    OS << \"\\n\";\n\n    OS << \"  TypeUSR: \";\n    printTypeUSR(resultItem.ExpectedTy, OS);\n    OS << \"\\n\";\n\n    OS << \"  ImplicitMembers:\";\n    if (resultItem.ImplicitMembers.empty())\n      OS << \" []\";\n    OS << \"\\n\";\n    for (auto VD : resultItem.ImplicitMembers) {\n      OS << \"   - \";\n\n      OS << \"Name: \";\n      VD->getFullName().print(OS);\n      OS << \"\\n\";\n\n      StringRef BriefDoc = VD->getBriefComment();\n      if (!BriefDoc.empty()) {\n        OS << \"     DocBrief: \\\"\";\n        OS << VD->getBriefComment();\n        OS << \"\\\"\\n\";\n      }\n    }\n  }\n  OS << \"-----END TYPE CONTEXT INFO-----\\n\";\n}\n\nCodeCompletionCallbacksFactory *swift::ide::makeTypeContextInfoCallbacksFactory(\n    TypeContextInfoConsumer &Consumer) {\n\n  \/\/ CC callback factory which produces 'ContextInfoCallbacks'.\n  class ContextInfoCallbacksFactoryImpl\n      : public CodeCompletionCallbacksFactory {\n    TypeContextInfoConsumer &Consumer;\n\n  public:\n    ContextInfoCallbacksFactoryImpl(TypeContextInfoConsumer &Consumer)\n        : Consumer(Consumer) {}\n\n    CodeCompletionCallbacks *createCodeCompletionCallbacks(Parser &P) override {\n      return new ContextInfoCallbacks(P, Consumer);\n    }\n  };\n\n  return new ContextInfoCallbacksFactoryImpl(Consumer);\n}\n<commit_msg>[IDE] Code style: space between 'override' and '{}'<commit_after>\/\/===--- TypeContextInfo.cpp ----------------------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2019 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\/IDE\/TypeContextInfo.h\"\n#include \"ExprContextAnalysis.h\"\n#include \"swift\/AST\/GenericEnvironment.h\"\n#include \"swift\/AST\/NameLookup.h\"\n#include \"swift\/AST\/USRGeneration.h\"\n#include \"swift\/Parse\/CodeCompletionCallbacks.h\"\n#include \"swift\/Sema\/IDETypeChecking.h\"\n#include \"clang\/AST\/Attr.h\"\n#include \"clang\/AST\/Decl.h\"\n\nusing namespace swift;\nusing namespace ide;\n\nclass ContextInfoCallbacks : public CodeCompletionCallbacks {\n  TypeContextInfoConsumer &Consumer;\n  SourceLoc Loc;\n  Expr *ParsedExpr = nullptr;\n  DeclContext *CurDeclContext = nullptr;\n\n  void getImplicitMembers(Type T, SmallVectorImpl<ValueDecl *> &Result);\n\npublic:\n  ContextInfoCallbacks(Parser &P, TypeContextInfoConsumer &Consumer)\n      : CodeCompletionCallbacks(P), Consumer(Consumer) {}\n\n  void completeExpr() override{};\n\n  \/\/ Ignore callbacks for suffix completions\n  \/\/ {\n  void completeDotExpr(Expr *E, SourceLoc DotLoc) override {};\n  void completePostfixExpr(Expr *E, bool hasSpace) override {};\n  void completeExprSuper(SuperRefExpr *SRE) override {};\n  void completeExprSuperDot(SuperRefExpr *SRE) override {};\n  \/\/ }\n\n  \/\/ Ignore non-expression callbacks.\n  \/\/ {\n  void completeInPrecedenceGroup(SyntaxKind SK) override {};\n  void completePoundAvailablePlatform() override {};\n  void completeExprKeyPath(KeyPathExpr *KPE, SourceLoc DotLoc) override {}\n  void completeTypeSimpleBeginning() override {}\n  void completeTypeIdentifierWithDot(IdentTypeRepr *ITR) override {}\n  void completeTypeIdentifierWithoutDot(IdentTypeRepr *ITR) override {}\n  void completeDeclAttrKeyword(Decl *D, bool Sil, bool Param) override {}\n  void completeDeclAttrParam(DeclAttrKind DK, int Index) override {}\n  void completeNominalMemberBeginning(\n      SmallVectorImpl<StringRef> &Keywords) override {}\n  void completeImportDecl(\n      std::vector<std::pair<Identifier, SourceLoc>> &Path) override {}\n  void completeAfterPoundExpr(CodeCompletionExpr *E,\n                              Optional<StmtKind> ParentKind) override {}\n  void completeAfterPoundDirective() override {}\n  void completePlatformCondition() override {}\n  void completeGenericParams(TypeLoc TL) override {}\n  void completeAfterIfStmt(bool hasElse) override {}\n  void completeAccessorBeginning() override {};\n  \/\/ }\n\n  void completeStmtOrExpr() override {};\n  void completePostfixExprBeginning(CodeCompletionExpr *E) override;\n  void completeForEachSequenceBeginning(CodeCompletionExpr *E) override;\n  void completeCaseStmtBeginning() override;\n\n  void completeAssignmentRHS(AssignExpr *E) override {};\n  void completeCallArg(CodeCompletionExpr *E) override;\n  void completeReturnStmt(CodeCompletionExpr *E) override;\n  void completeYieldStmt(CodeCompletionExpr *E,\n                         Optional<unsigned> yieldIndex) override;\n\n  void completeUnresolvedMember(CodeCompletionExpr *E,\n                                SourceLoc DotLoc) override;\n  void completeCaseStmtDotPrefix() override;\n\n  void completePostfixExprParen(Expr *E, Expr *CodeCompletionE) override{};\n\n  void doneParsing() override;\n};\n\nvoid ContextInfoCallbacks::completePostfixExprBeginning(CodeCompletionExpr *E) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\n\nvoid ContextInfoCallbacks::completeForEachSequenceBeginning(\n    CodeCompletionExpr *E) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\nvoid ContextInfoCallbacks::completeCallArg(CodeCompletionExpr *E) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\nvoid ContextInfoCallbacks::completeReturnStmt(CodeCompletionExpr *E) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\nvoid ContextInfoCallbacks::completeYieldStmt(CodeCompletionExpr *E,\n                                             Optional<unsigned> yieldIndex) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\nvoid ContextInfoCallbacks::completeUnresolvedMember(CodeCompletionExpr *E,\n                                                    SourceLoc DotLoc) {\n  CurDeclContext = P.CurDeclContext;\n  ParsedExpr = E;\n}\n\nvoid ContextInfoCallbacks::completeCaseStmtBeginning() {\n  \/\/ TODO: Implement?\n}\nvoid ContextInfoCallbacks::completeCaseStmtDotPrefix() {\n  \/\/ TODO: Implement?\n}\n\nvoid ContextInfoCallbacks::doneParsing() {\n  if (!ParsedExpr)\n    return;\n\n  typeCheckContextUntil(\n      CurDeclContext,\n      CurDeclContext->getASTContext().SourceMgr.getCodeCompletionLoc());\n\n  ExprContextInfo Info(CurDeclContext, ParsedExpr);\n\n  llvm::SmallSet<CanType, 2> seenTypes;\n  SmallVector<TypeContextInfoItem, 2> results;\n\n  for (auto T : Info.getPossibleTypes()) {\n    if (T->is<ErrorType>() || T->is<UnresolvedType>())\n      continue;\n    if (auto env = CurDeclContext->getGenericEnvironmentOfContext())\n      T = env->mapTypeIntoContext(T);\n\n    \/\/ TODO: Do we need '.none' for Optionals?\n    auto objT = T->lookThroughAllOptionalTypes();\n\n    if (!seenTypes.insert(objT->getCanonicalType()).second)\n      continue;\n\n    results.emplace_back(T);\n    auto &item = results.back();\n    getImplicitMembers(objT, item.ImplicitMembers);\n  }\n\n  Consumer.handleResults(results);\n}\n\nvoid ContextInfoCallbacks::getImplicitMembers(\n    Type T, SmallVectorImpl<ValueDecl *> &Result) {\n\n  if (!T->mayHaveMembers())\n    return;\n\n  class LocalConsumer : public VisibleDeclConsumer {\n    DeclContext *DC;\n    LazyResolver *TypeResolver;\n    ModuleDecl *CurModule;\n    Type T;\n    SmallVectorImpl<ValueDecl *> &Result;\n\n    bool canBeImplictMember(ValueDecl *VD) {\n      if (VD->isOperator())\n        return false;\n\n      if (!VD->hasInterfaceType()) {\n        TypeResolver->resolveDeclSignature(VD);\n        if (!VD->hasInterfaceType())\n          return false;\n      }\n\n      \/\/ Enum element decls can always be referenced by implicit member\n      \/\/ expression.\n      if (isa<EnumElementDecl>(VD))\n        return true;\n\n      \/\/ Static properties which is convertible to 'Self'.\n      if (isa<VarDecl>(VD) && VD->isStatic()) {\n        auto declTy = T->getTypeOfMember(CurModule, VD);\n        if (declTy->isEqual(T) || swift::isConvertibleTo(declTy, T, *DC))\n          return true;\n      }\n\n      return false;\n    }\n\n  public:\n    LocalConsumer(DeclContext *DC, Type T, SmallVectorImpl<ValueDecl *> &Result)\n        : DC(DC), TypeResolver(DC->getASTContext().getLazyResolver()),\n          CurModule(DC->getParentModule()), T(T), Result(Result) {}\n\n    void foundDecl(ValueDecl *VD, DeclVisibilityKind Reason) {\n      if (canBeImplictMember(VD) && !VD->shouldHideFromEditor())\n        Result.push_back(VD);\n    }\n\n  } LocalConsumer(CurDeclContext, T, Result);\n\n  lookupVisibleMemberDecls(LocalConsumer, MetatypeType::get(T), CurDeclContext,\n                           CurDeclContext->getASTContext().getLazyResolver(),\n                           \/*includeInstanceMembers=*\/false);\n}\n\nvoid PrintingTypeContextInfoConsumer::handleResults(\n    ArrayRef<TypeContextInfoItem> results) {\n  OS << \"-----BEGIN TYPE CONTEXT INFO-----\\n\";\n  for (auto resultItem : results) {\n    OS << \"- TypeName: \";\n    resultItem.ExpectedTy.print(OS);\n    OS << \"\\n\";\n\n    OS << \"  TypeUSR: \";\n    printTypeUSR(resultItem.ExpectedTy, OS);\n    OS << \"\\n\";\n\n    OS << \"  ImplicitMembers:\";\n    if (resultItem.ImplicitMembers.empty())\n      OS << \" []\";\n    OS << \"\\n\";\n    for (auto VD : resultItem.ImplicitMembers) {\n      OS << \"   - \";\n\n      OS << \"Name: \";\n      VD->getFullName().print(OS);\n      OS << \"\\n\";\n\n      StringRef BriefDoc = VD->getBriefComment();\n      if (!BriefDoc.empty()) {\n        OS << \"     DocBrief: \\\"\";\n        OS << VD->getBriefComment();\n        OS << \"\\\"\\n\";\n      }\n    }\n  }\n  OS << \"-----END TYPE CONTEXT INFO-----\\n\";\n}\n\nCodeCompletionCallbacksFactory *swift::ide::makeTypeContextInfoCallbacksFactory(\n    TypeContextInfoConsumer &Consumer) {\n\n  \/\/ CC callback factory which produces 'ContextInfoCallbacks'.\n  class ContextInfoCallbacksFactoryImpl\n      : public CodeCompletionCallbacksFactory {\n    TypeContextInfoConsumer &Consumer;\n\n  public:\n    ContextInfoCallbacksFactoryImpl(TypeContextInfoConsumer &Consumer)\n        : Consumer(Consumer) {}\n\n    CodeCompletionCallbacks *createCodeCompletionCallbacks(Parser &P) override {\n      return new ContextInfoCallbacks(P, Consumer);\n    }\n  };\n\n  return new ContextInfoCallbacksFactoryImpl(Consumer);\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 \"qdocumentgallery.h\"\n\n#include \"qabstractgallery_p.h\"\n\n#include \"qgallerycontainerrequest.h\"\n#include \"qgallerycopyrequest.h\"\n#include \"qgallerycountrequest.h\"\n#include \"qgalleryfilterrequest.h\"\n#include \"qgalleryitemrequest.h\"\n#include \"qgallerymoverequest.h\"\n#include \"qgalleryremoverequest.h\"\n#include \"qgalleryurlrequest.h\"\n\n#include \"qgalleryerrorresponse_p.h\"\n#include \"qgallerytrackeraggregatelistresponse_p.h\"\n#include \"qgallerytrackercountresponse_p.h\"\n#include \"qgallerytrackerfilecopyresponse_p.h\"\n#include \"qgallerytrackerfilelistresponse_p.h\"\n#include \"qgallerytrackerfilemoveresponse_p.h\"\n#include \"qgallerytrackerfileremoveresponse_p.h\"\n#include \"qgallerytrackerschema_p.h\"\n#include \"qgallerytrackerurlresponse_p.h\"\n\n#include <QtDBus\/qdbusmetatype.h>\n\nQTM_BEGIN_NAMESPACE\n\nclass QDocumentGalleryPrivate : public QAbstractGalleryPrivate\n{\npublic:\n    QGalleryAbstractResponse *createItemResponse(QGalleryItemRequest *request);\n    QGalleryAbstractResponse *createUrlResponse(QGalleryUrlRequest *request);\n    QGalleryAbstractResponse *createContainerResponse(QGalleryContainerRequest *request);\n    QGalleryAbstractResponse *createFilterResponse(QGalleryFilterRequest *request);\n    QGalleryAbstractResponse *createCountResponse(QGalleryCountRequest *request);\n    QGalleryAbstractResponse *createCopyResponse(QGalleryCopyRequest *request);\n    QGalleryAbstractResponse *createMoveResponse(QGalleryMoveRequest *request);\n    QGalleryAbstractResponse *createRemoveResponse(QGalleryRemoveRequest *request);\n\nprivate:\n    QGalleryDBusInterfacePointer metaDataInterface();\n    QGalleryDBusInterfacePointer searchInterface();\n    QGalleryDBusInterfacePointer fileInterface();\n\n    QGalleryDBusInterfacePointer metaDataService;\n    QGalleryDBusInterfacePointer searchService;\n    QGalleryDBusInterfacePointer fileService;\n};\n\nQGalleryDBusInterfacePointer QDocumentGalleryPrivate::metaDataInterface()\n{\n    if (!metaDataService) {\n        metaDataService = new QGalleryDBusInterface(\n                QLatin1String(\"org.freedesktop.Tracker\"),\n                QLatin1String(\"\/org\/freedesktop\/Tracker\/Metadata\"),\n                QLatin1String(\"org.freedesktop.Tracker.Metadata\"));\n    }\n    return metaDataService;\n}\n\nQGalleryDBusInterfacePointer QDocumentGalleryPrivate::searchInterface()\n{\n    if (!searchService) {\n        searchService = new QGalleryDBusInterface(\n                QLatin1String(\"org.freedesktop.Tracker\"),\n                QLatin1String(\"\/org\/freedesktop\/Tracker\/Search\"),\n                QLatin1String(\"org.freedesktop.Tracker.Search\"));\n    }\n    return searchService;\n}\n\nQGalleryDBusInterfacePointer QDocumentGalleryPrivate::fileInterface()\n{\n    if (!fileService) {\n        fileService = new QGalleryDBusInterface(\n                QLatin1String(\"org.freedesktop.Tracker\"),\n                QLatin1String(\"\/org\/freedesktop\/Tracker\/Files\"),\n                QLatin1String(\"org.freedesktop.Tracker.Files\"));\n    }\n    return fileService;\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createItemResponse(QGalleryItemRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.resolveItemType(request->itemId());\n\n    QString query = schema.buildIdQuery(&result, request->itemId());\n\n    if (result != QGalleryAbstractRequest::Succeeded) {\n        qWarning(\"Invalid Query %d, %s\", result, qPrintable(query));\n    } else {\n        QGalleryAbstractResponse *response = 0;\n        if (schema.isFileType()) {\n            response = new QGalleryTrackerFileListResponse(\n                    searchInterface(),\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    QStringList(),\n                    1);\n            response->setCursorPosition(0);\n        } else if (schema.isAggregateType()) {\n            response = new QGalleryTrackerAggregateListResponse(\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    QStringList(),\n                    1);\n            response->setCursorPosition(0);\n        } else {\n            result = QGalleryAbstractRequest::InvalidItemError;\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createUrlResponse(\n        QGalleryUrlRequest *request)\n{\n    return new QGalleryTrackerUrlResponse(fileInterface(), request->itemUrl(), request->create());\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createContainerResponse(\n        QGalleryContainerRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(request->itemType());\n\n    QString query = schema.buildContainerQuery(&result, request->containerId());\n\n    if (result != QGalleryAbstractRequest::Succeeded) {\n        qWarning(\"Invalid Query %d, %s\", result, qPrintable(query));\n    } else {\n        QGalleryAbstractResponse *response = 0;\n        if (schema.isFileType()) {\n            response = new QGalleryTrackerFileListResponse(\n                    searchInterface(),\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    request->sortPropertyNames(),\n                    request->minimumPagedItems());\n            response->setCursorPosition(request->initialCursorPosition());\n\n            return response;\n        } else if (schema.isAggregateType()) {\n            response = new QGalleryTrackerAggregateListResponse(\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    request->sortPropertyNames(),\n                    request->minimumPagedItems());\n            response->setCursorPosition(request->initialCursorPosition());\n\n            return response;\n        } else {\n            result = QGalleryAbstractRequest::ItemTypeError;\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createFilterResponse(\n        QGalleryFilterRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(request->itemType());\n\n    QString query = schema.buildFilterQuery(&result, request->containerId(), request->filter());\n\n    if (result != QGalleryAbstractRequest::Succeeded) {\n        qWarning(\"Invalid Query %d, %s\", result, qPrintable(query));\n    } else {\n        if (schema.isFileType()) {\n            QGalleryAbstractResponse *response = new QGalleryTrackerFileListResponse(\n                    searchInterface(),\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    request->sortPropertyNames(),\n                    request->minimumPagedItems());\n            response->setCursorPosition(request->initialCursorPosition());\n\n            return response;\n        } else if (schema.isAggregateType()) {\n            QGalleryAbstractResponse *response = new QGalleryTrackerAggregateListResponse(\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    request->sortPropertyNames(),\n                    request->minimumPagedItems());\n            response->setCursorPosition(request->initialCursorPosition());\n\n            return response;\n        } else {\n            result = QGalleryAbstractRequest::ItemTypeError;\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createCountResponse(\n        QGalleryCountRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(request->itemType());\n\n    QString query = schema.buildFilterQuery(&result, request->containerId(), request->filter());\n\n    if (result != QGalleryAbstractRequest::Succeeded) {\n        qWarning(\"Invalid Query %d, %s\", result, qPrintable(query));\n    } else if (schema.isFileType() || schema.isAggregateType()) {\n        return new QGalleryTrackerCountResponse(metaDataInterface(), schema, query);\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createCopyResponse(QGalleryCopyRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(QDocumentGallery::File);\n\n    QStringList fileNames = schema.urisFromItemIds(&result, request->itemIds());\n\n    if (fileNames.isEmpty()) {\n        if (result == QGalleryAbstractRequest::Succeeded)\n            result = QGalleryAbstractRequest::InvalidItemError;\n    } else {\n        QString destinationPath = schema.uriFromItemId(&result, request->destinationId());\n\n        if (destinationPath.isEmpty()) {\n            result = QGalleryAbstractRequest::InvalidDestinationError;\n        } else {\n            return new QGalleryTrackerFileCopyResponse(\n                    metaDataInterface(),\n                    schema,\n                    request->propertyNames(),\n                    fileNames,\n                    destinationPath);\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createMoveResponse(QGalleryMoveRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(QDocumentGallery::File);\n\n    QStringList fileNames = schema.urisFromItemIds(&result, request->itemIds());\n\n    if (fileNames.isEmpty()) {\n        if (result == QGalleryAbstractRequest::Succeeded)\n            result = QGalleryAbstractRequest::InvalidItemError;\n    } else {\n        QString destinationPath = schema.uriFromItemId(&result, request->destinationId());\n\n        if (destinationPath.isEmpty()) {\n            result = QGalleryAbstractRequest::InvalidDestinationError;\n        } else {\n            return new QGalleryTrackerFileMoveResponse(\n                    metaDataInterface(),\n                    schema,\n                    request->propertyNames(),\n                    fileNames,\n                    destinationPath);\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createRemoveResponse(\n        QGalleryRemoveRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(QDocumentGallery::File);\n\n    QStringList fileNames = schema.urisFromItemIds(&result, request->itemIds());\n\n    if (fileNames.isEmpty()) {\n        if (result == QGalleryAbstractRequest::Succeeded)\n            result = QGalleryAbstractRequest::InvalidItemError;\n    } else {\n        return new QGalleryTrackerFileRemoveResponse(\n                metaDataInterface(),\n                schema,\n                request->propertyNames(),\n                fileNames);\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQDocumentGallery::QDocumentGallery(QObject *parent)\n    : QAbstractGallery(*new QDocumentGalleryPrivate, parent)\n{\n    qDBusRegisterMetaType<QVector<QStringList> >();\n}\n\nQDocumentGallery::~QDocumentGallery()\n{\n}\n\nbool QDocumentGallery::isRequestSupported(QGalleryAbstractRequest::Type type) const\n{\n    switch (type) {\n    case QGalleryAbstractRequest::Item:\n    case QGalleryAbstractRequest::Url:\n    case QGalleryAbstractRequest::Container:\n    case QGalleryAbstractRequest::Filter:\n    case QGalleryAbstractRequest::Count:\n    case QGalleryAbstractRequest::Copy:\n    case QGalleryAbstractRequest::Move:\n    case QGalleryAbstractRequest::Remove:\n        return true;\n    default:\n        return false;\n    }\n}\n\nQStringList QDocumentGallery::itemTypes() const\n{\n    return QStringList();\n}\n\nQGalleryAbstractResponse *QDocumentGallery::createResponse(QGalleryAbstractRequest *request)\n{\n    Q_D(QDocumentGallery);\n\n    switch (request->type()) {\n    case QGalleryAbstractRequest::Item:\n        return d->createItemResponse(static_cast<QGalleryItemRequest *>(request));\n    case QGalleryAbstractRequest::Url:\n        return d->createUrlResponse(static_cast<QGalleryUrlRequest *>(request));\n    case QGalleryAbstractRequest::Container:\n        return d->createContainerResponse(static_cast<QGalleryContainerRequest *>(request));\n    case QGalleryAbstractRequest::Filter:\n        return d->createFilterResponse(static_cast<QGalleryFilterRequest *>(request));\n    case QGalleryAbstractRequest::Count:\n        return d->createCountResponse(static_cast<QGalleryCountRequest *>(request));\n    case QGalleryAbstractRequest::Copy:\n        return d->createCopyResponse(static_cast<QGalleryCopyRequest *>(request));\n    case QGalleryAbstractRequest::Move:\n        return d->createMoveResponse(static_cast<QGalleryMoveRequest *>(request));\n    case QGalleryAbstractRequest::Remove:\n        return d->createRemoveResponse(static_cast<QGalleryRemoveRequest *>(request));\n    default:\n        return 0;\n    }\n}\n\n#include \"moc_qdocumentgallery.cpp\"\n\nQTM_END_NAMESPACE\n\n<commit_msg>Fix item response not returning any results.<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 \"qdocumentgallery.h\"\n\n#include \"qabstractgallery_p.h\"\n\n#include \"qgallerycontainerrequest.h\"\n#include \"qgallerycopyrequest.h\"\n#include \"qgallerycountrequest.h\"\n#include \"qgalleryfilterrequest.h\"\n#include \"qgalleryitemrequest.h\"\n#include \"qgallerymoverequest.h\"\n#include \"qgalleryremoverequest.h\"\n#include \"qgalleryurlrequest.h\"\n\n#include \"qgalleryerrorresponse_p.h\"\n#include \"qgallerytrackeraggregatelistresponse_p.h\"\n#include \"qgallerytrackercountresponse_p.h\"\n#include \"qgallerytrackerfilecopyresponse_p.h\"\n#include \"qgallerytrackerfilelistresponse_p.h\"\n#include \"qgallerytrackerfilemoveresponse_p.h\"\n#include \"qgallerytrackerfileremoveresponse_p.h\"\n#include \"qgallerytrackerschema_p.h\"\n#include \"qgallerytrackerurlresponse_p.h\"\n\n#include <QtDBus\/qdbusmetatype.h>\n\nQTM_BEGIN_NAMESPACE\n\nclass QDocumentGalleryPrivate : public QAbstractGalleryPrivate\n{\npublic:\n    QGalleryAbstractResponse *createItemResponse(QGalleryItemRequest *request);\n    QGalleryAbstractResponse *createUrlResponse(QGalleryUrlRequest *request);\n    QGalleryAbstractResponse *createContainerResponse(QGalleryContainerRequest *request);\n    QGalleryAbstractResponse *createFilterResponse(QGalleryFilterRequest *request);\n    QGalleryAbstractResponse *createCountResponse(QGalleryCountRequest *request);\n    QGalleryAbstractResponse *createCopyResponse(QGalleryCopyRequest *request);\n    QGalleryAbstractResponse *createMoveResponse(QGalleryMoveRequest *request);\n    QGalleryAbstractResponse *createRemoveResponse(QGalleryRemoveRequest *request);\n\nprivate:\n    QGalleryDBusInterfacePointer metaDataInterface();\n    QGalleryDBusInterfacePointer searchInterface();\n    QGalleryDBusInterfacePointer fileInterface();\n\n    QGalleryDBusInterfacePointer metaDataService;\n    QGalleryDBusInterfacePointer searchService;\n    QGalleryDBusInterfacePointer fileService;\n};\n\nQGalleryDBusInterfacePointer QDocumentGalleryPrivate::metaDataInterface()\n{\n    if (!metaDataService) {\n        metaDataService = new QGalleryDBusInterface(\n                QLatin1String(\"org.freedesktop.Tracker\"),\n                QLatin1String(\"\/org\/freedesktop\/Tracker\/Metadata\"),\n                QLatin1String(\"org.freedesktop.Tracker.Metadata\"));\n    }\n    return metaDataService;\n}\n\nQGalleryDBusInterfacePointer QDocumentGalleryPrivate::searchInterface()\n{\n    if (!searchService) {\n        searchService = new QGalleryDBusInterface(\n                QLatin1String(\"org.freedesktop.Tracker\"),\n                QLatin1String(\"\/org\/freedesktop\/Tracker\/Search\"),\n                QLatin1String(\"org.freedesktop.Tracker.Search\"));\n    }\n    return searchService;\n}\n\nQGalleryDBusInterfacePointer QDocumentGalleryPrivate::fileInterface()\n{\n    if (!fileService) {\n        fileService = new QGalleryDBusInterface(\n                QLatin1String(\"org.freedesktop.Tracker\"),\n                QLatin1String(\"\/org\/freedesktop\/Tracker\/Files\"),\n                QLatin1String(\"org.freedesktop.Tracker.Files\"));\n    }\n    return fileService;\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createItemResponse(QGalleryItemRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.resolveItemType(request->itemId());\n\n    QString query = schema.buildIdQuery(&result, request->itemId());\n\n    if (result != QGalleryAbstractRequest::Succeeded) {\n        qWarning(\"Invalid Query %d, %s\", result, qPrintable(query));\n    } else {\n        QGalleryAbstractResponse *response = 0;\n        if (schema.isFileType()) {\n            response = new QGalleryTrackerFileListResponse(\n                    searchInterface(),\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    QStringList(),\n                    1);\n            response->setCursorPosition(0);\n\n            return response;\n        } else if (schema.isAggregateType()) {\n            response = new QGalleryTrackerAggregateListResponse(\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    QStringList(),\n                    1);\n            response->setCursorPosition(0);\n\n            return response;\n        } else {\n            result = QGalleryAbstractRequest::InvalidItemError;\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createUrlResponse(\n        QGalleryUrlRequest *request)\n{\n    return new QGalleryTrackerUrlResponse(fileInterface(), request->itemUrl(), request->create());\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createContainerResponse(\n        QGalleryContainerRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(request->itemType());\n\n    QString query = schema.buildContainerQuery(&result, request->containerId());\n\n    if (result != QGalleryAbstractRequest::Succeeded) {\n        qWarning(\"Invalid Query %d, %s\", result, qPrintable(query));\n    } else {\n        QGalleryAbstractResponse *response = 0;\n        if (schema.isFileType()) {\n            response = new QGalleryTrackerFileListResponse(\n                    searchInterface(),\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    request->sortPropertyNames(),\n                    request->minimumPagedItems());\n            response->setCursorPosition(request->initialCursorPosition());\n\n            return response;\n        } else if (schema.isAggregateType()) {\n            response = new QGalleryTrackerAggregateListResponse(\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    request->sortPropertyNames(),\n                    request->minimumPagedItems());\n            response->setCursorPosition(request->initialCursorPosition());\n\n            return response;\n        } else {\n            result = QGalleryAbstractRequest::ItemTypeError;\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createFilterResponse(\n        QGalleryFilterRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(request->itemType());\n\n    QString query = schema.buildFilterQuery(&result, request->containerId(), request->filter());\n\n    if (result != QGalleryAbstractRequest::Succeeded) {\n        qWarning(\"Invalid Query %d, %s\", result, qPrintable(query));\n    } else {\n        if (schema.isFileType()) {\n            QGalleryAbstractResponse *response = new QGalleryTrackerFileListResponse(\n                    searchInterface(),\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    request->sortPropertyNames(),\n                    request->minimumPagedItems());\n            response->setCursorPosition(request->initialCursorPosition());\n\n            return response;\n        } else if (schema.isAggregateType()) {\n            QGalleryAbstractResponse *response = new QGalleryTrackerAggregateListResponse(\n                    metaDataInterface(),\n                    schema,\n                    query,\n                    request->propertyNames(),\n                    request->sortPropertyNames(),\n                    request->minimumPagedItems());\n            response->setCursorPosition(request->initialCursorPosition());\n\n            return response;\n        } else {\n            result = QGalleryAbstractRequest::ItemTypeError;\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createCountResponse(\n        QGalleryCountRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(request->itemType());\n\n    QString query = schema.buildFilterQuery(&result, request->containerId(), request->filter());\n\n    if (result != QGalleryAbstractRequest::Succeeded) {\n        qWarning(\"Invalid Query %d, %s\", result, qPrintable(query));\n    } else if (schema.isFileType() || schema.isAggregateType()) {\n        return new QGalleryTrackerCountResponse(metaDataInterface(), schema, query);\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createCopyResponse(QGalleryCopyRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(QDocumentGallery::File);\n\n    QStringList fileNames = schema.urisFromItemIds(&result, request->itemIds());\n\n    if (fileNames.isEmpty()) {\n        if (result == QGalleryAbstractRequest::Succeeded)\n            result = QGalleryAbstractRequest::InvalidItemError;\n    } else {\n        QString destinationPath = schema.uriFromItemId(&result, request->destinationId());\n\n        if (destinationPath.isEmpty()) {\n            result = QGalleryAbstractRequest::InvalidDestinationError;\n        } else {\n            return new QGalleryTrackerFileCopyResponse(\n                    metaDataInterface(),\n                    schema,\n                    request->propertyNames(),\n                    fileNames,\n                    destinationPath);\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createMoveResponse(QGalleryMoveRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(QDocumentGallery::File);\n\n    QStringList fileNames = schema.urisFromItemIds(&result, request->itemIds());\n\n    if (fileNames.isEmpty()) {\n        if (result == QGalleryAbstractRequest::Succeeded)\n            result = QGalleryAbstractRequest::InvalidItemError;\n    } else {\n        QString destinationPath = schema.uriFromItemId(&result, request->destinationId());\n\n        if (destinationPath.isEmpty()) {\n            result = QGalleryAbstractRequest::InvalidDestinationError;\n        } else {\n            return new QGalleryTrackerFileMoveResponse(\n                    metaDataInterface(),\n                    schema,\n                    request->propertyNames(),\n                    fileNames,\n                    destinationPath);\n        }\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQGalleryAbstractResponse *QDocumentGalleryPrivate::createRemoveResponse(\n        QGalleryRemoveRequest *request)\n{\n    int result = QGalleryAbstractRequest::Succeeded;\n\n    QGalleryTrackerSchema schema;\n    schema.setItemType(QDocumentGallery::File);\n\n    QStringList fileNames = schema.urisFromItemIds(&result, request->itemIds());\n\n    if (fileNames.isEmpty()) {\n        if (result == QGalleryAbstractRequest::Succeeded)\n            result = QGalleryAbstractRequest::InvalidItemError;\n    } else {\n        return new QGalleryTrackerFileRemoveResponse(\n                metaDataInterface(),\n                schema,\n                request->propertyNames(),\n                fileNames);\n    }\n\n    return new QGalleryErrorResponse(result);\n}\n\nQDocumentGallery::QDocumentGallery(QObject *parent)\n    : QAbstractGallery(*new QDocumentGalleryPrivate, parent)\n{\n    qDBusRegisterMetaType<QVector<QStringList> >();\n}\n\nQDocumentGallery::~QDocumentGallery()\n{\n}\n\nbool QDocumentGallery::isRequestSupported(QGalleryAbstractRequest::Type type) const\n{\n    switch (type) {\n    case QGalleryAbstractRequest::Item:\n    case QGalleryAbstractRequest::Url:\n    case QGalleryAbstractRequest::Container:\n    case QGalleryAbstractRequest::Filter:\n    case QGalleryAbstractRequest::Count:\n    case QGalleryAbstractRequest::Copy:\n    case QGalleryAbstractRequest::Move:\n    case QGalleryAbstractRequest::Remove:\n        return true;\n    default:\n        return false;\n    }\n}\n\nQStringList QDocumentGallery::itemTypes() const\n{\n    return QStringList();\n}\n\nQGalleryAbstractResponse *QDocumentGallery::createResponse(QGalleryAbstractRequest *request)\n{\n    Q_D(QDocumentGallery);\n\n    switch (request->type()) {\n    case QGalleryAbstractRequest::Item:\n        return d->createItemResponse(static_cast<QGalleryItemRequest *>(request));\n    case QGalleryAbstractRequest::Url:\n        return d->createUrlResponse(static_cast<QGalleryUrlRequest *>(request));\n    case QGalleryAbstractRequest::Container:\n        return d->createContainerResponse(static_cast<QGalleryContainerRequest *>(request));\n    case QGalleryAbstractRequest::Filter:\n        return d->createFilterResponse(static_cast<QGalleryFilterRequest *>(request));\n    case QGalleryAbstractRequest::Count:\n        return d->createCountResponse(static_cast<QGalleryCountRequest *>(request));\n    case QGalleryAbstractRequest::Copy:\n        return d->createCopyResponse(static_cast<QGalleryCopyRequest *>(request));\n    case QGalleryAbstractRequest::Move:\n        return d->createMoveResponse(static_cast<QGalleryMoveRequest *>(request));\n    case QGalleryAbstractRequest::Remove:\n        return d->createRemoveResponse(static_cast<QGalleryRemoveRequest *>(request));\n    default:\n        return 0;\n    }\n}\n\n#include \"moc_qdocumentgallery.cpp\"\n\nQTM_END_NAMESPACE\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- LocalTypeData.cpp - Local type data search -----------------------===\/\/\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 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\/\/  This file implements routines for finding and caching local type data\n\/\/  for a search.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"LocalTypeData.h\"\n#include \"Fulfillment.h\"\n#include \"GenMeta.h\"\n#include \"GenProto.h\"\n#include \"IRGenDebugInfo.h\"\n#include \"IRGenFunction.h\"\n#include \"IRGenModule.h\"\n#include \"swift\/AST\/IRGenOptions.h\"\n#include \"swift\/SIL\/SILModule.h\"\n\nusing namespace swift;\nusing namespace irgen;\n\nLocalTypeDataKey LocalTypeDataKey::getCachingKey() const {\n  return { Type, Kind.getCachingKind() };\n}\n\nLocalTypeDataKind LocalTypeDataKind::getCachingKind() const {\n  \/\/ Most local type data kinds are already canonical.\n  if (!isConcreteProtocolConformance()) return *this;\n\n  \/\/ Map protocol conformances to their root normal conformance.\n  auto conformance = getConcreteProtocolConformance();\n  return forConcreteProtocolWitnessTable(\n                                     conformance->getRootNormalConformance());\n}\n\nLocalTypeDataCache &IRGenFunction::getOrCreateLocalTypeData() {\n  \/\/ Lazily allocate it.\n  if (LocalTypeData) return *LocalTypeData;\n  LocalTypeData = new LocalTypeDataCache();\n  return *LocalTypeData;\n}\n\nvoid IRGenFunction::destroyLocalTypeData() {\n  delete LocalTypeData;\n}\n\nunsigned LocalTypeDataCache::CacheEntry::cost() const {\n  switch (getKind()) {\n  case Kind::Concrete:\n    return static_cast<const ConcreteCacheEntry*>(this)->cost();\n  case Kind::Abstract:\n    return static_cast<const AbstractCacheEntry*>(this)->cost();\n  }\n  llvm_unreachable(\"bad cache entry kind\");\n}\n\nvoid LocalTypeDataCache::CacheEntry::erase() const {\n  switch (getKind()) {\n  case Kind::Concrete:\n    delete static_cast<const ConcreteCacheEntry*>(this);\n    return;\n  case Kind::Abstract:\n    delete static_cast<const AbstractCacheEntry*>(this);\n    return;\n  }\n  llvm_unreachable(\"bad cache entry kind\");\n}\n\nllvm::Value *IRGenFunction::getLocalTypeData(CanType type,\n                                             LocalTypeDataKind kind) {\n  assert(LocalTypeData);\n  return LocalTypeData->get(*this, LocalTypeDataCache::getKey(type, kind));\n}\n\nllvm::Value *IRGenFunction::tryGetConcreteLocalTypeData(LocalTypeDataKey key) {\n  if (!LocalTypeData) return nullptr;\n  return LocalTypeData->tryGet(*this, key, \/*allow abstract*\/ false);\n}\n\nllvm::Value *IRGenFunction::tryGetLocalTypeData(LocalTypeDataKey key) {\n  if (!LocalTypeData) return nullptr;\n  return LocalTypeData->tryGet(*this, key);\n}\n\nllvm::Value *LocalTypeDataCache::tryGet(IRGenFunction &IGF, Key key,\n                                        bool allowAbstract) {\n  auto it = Map.find(key);\n  if (it == Map.end()) return nullptr;\n  auto &chain = it->second;\n\n  CacheEntry *best = nullptr;\n  Optional<unsigned> bestCost;\n\n  CacheEntry *next = chain.Root, *nextPrev = nullptr;\n  while (next) {\n    CacheEntry *cur = next, *curPrev = nextPrev;\n    nextPrev = cur;\n    next = cur->getNext();\n\n    \/\/ Ignore abstract entries if so requested.\n    if (!allowAbstract && cur->getKind() != CacheEntry::Kind::Concrete)\n      continue;\n\n    \/\/ Ignore unacceptable entries.\n    if (!IGF.isActiveDominancePointDominatedBy(cur->DefinitionPoint))\n      continue;\n\n    \/\/ If there's a collision, compare by cost, ignoring higher-cost entries.\n    if (best) {\n      \/\/ Compute the cost of the best entry if we haven't done so already.\n      \/\/ If that's zero, go ahead and short-circuit out.\n      if (!bestCost) {\n        bestCost = best->cost();\n        if (*bestCost == 0) break;\n      }\n\n      auto curCost = cur->cost();\n      if (curCost >= *bestCost) continue;\n\n      \/\/ Replace the best cost and fall through.\n      bestCost = curCost;\n    }\n    best = cur;\n  }\n\n  \/\/ If we didn't find anything, we're done.\n  if (!best) return nullptr;\n\n  \/\/ Okay, we've found the best entry available.\n  switch (best->getKind()) {\n\n  \/\/ For concrete caches, this is easy.\n  case CacheEntry::Kind::Concrete:\n    return static_cast<ConcreteCacheEntry*>(best)->Value;\n\n  \/\/ For abstract caches, we need to follow a path.\n  case CacheEntry::Kind::Abstract: {\n    auto entry = static_cast<AbstractCacheEntry*>(best);\n\n    \/\/ Follow the path.\n    auto &source = AbstractSources[entry->SourceIndex];\n    auto result = entry->follow(IGF, source);\n\n    \/\/ Following the path automatically caches at every point along it,\n    \/\/ including the end.\n    assert(chain.Root->DefinitionPoint == IGF.getActiveDominancePoint());\n    assert(chain.Root->getKind() == CacheEntry::Kind::Concrete);\n\n    return result;\n  }\n\n  }\n  llvm_unreachable(\"bad cache entry kind\");\n}\n\nllvm::Value *\nLocalTypeDataCache::AbstractCacheEntry::follow(IRGenFunction &IGF,\n                                               AbstractSource &source) const {\n  switch (source.getKind()) {\n  case AbstractSource::Kind::TypeMetadata:\n    return Path.followFromTypeMetadata(IGF, source.getType(),\n                                       source.getValue(), nullptr);\n\n  case AbstractSource::Kind::ProtocolWitnessTable:\n    return Path.followFromWitnessTable(IGF, source.getType(),\n                                       source.getProtocolConformance(),\n                                       source.getValue(), nullptr);\n  }\n  llvm_unreachable(\"bad source kind\");\n}\n\nstatic void maybeEmitDebugInfoForLocalTypeData(IRGenFunction &IGF,\n                                               LocalTypeDataKey key,\n                                               llvm::Value *data) {\n  \/\/ Only if debug info is enabled.\n  if (!IGF.IGM.DebugInfo) return;\n\n  \/\/ Only for type metadata.\n  if (key.Kind != LocalTypeDataKind::forTypeMetadata()) return;\n\n  \/\/ Only for archetypes, and not for opened archetypes.\n  auto type = dyn_cast<ArchetypeType>(key.Type);\n  if (!type) return;\n  if (type->getOpenedExistentialType()) return;\n\n  \/\/ At -O0, create an alloca to keep the type alive.\n  auto name = type->getFullName();\n  if (!IGF.IGM.IRGen.Opts.Optimize) {\n    auto temp = IGF.createAlloca(data->getType(), IGF.IGM.getPointerAlignment(),\n                                 name);\n    IGF.Builder.CreateStore(data, temp);\n    data = temp.getAddress();\n  }\n\n  \/\/ Emit debug info for the metadata.\n  IGF.IGM.DebugInfo->emitTypeMetadata(IGF, data, name);\n}\n\nvoid IRGenFunction::setScopedLocalTypeData(LocalTypeDataKey key,\n                                           llvm::Value *data) {\n  maybeEmitDebugInfoForLocalTypeData(*this, key, data);\n\n  \/\/ Register with the active ConditionalDominanceScope if necessary.\n  bool isConditional = isConditionalDominancePoint();\n  if (isConditional) {\n    registerConditionalLocalTypeDataKey(key);\n  }\n\n  getOrCreateLocalTypeData().addConcrete(getActiveDominancePoint(),\n                                         isConditional, key, data);\n}\n\nvoid IRGenFunction::setUnscopedLocalTypeData(LocalTypeDataKey key,\n                                             llvm::Value *data) {\n  maybeEmitDebugInfoForLocalTypeData(*this, key, data);\n\n  \/\/ This is supportable, but it would require ensuring that we add the\n  \/\/ entry after any conditional entries; otherwise the stack discipline\n  \/\/ will get messed up.\n  assert(!isConditionalDominancePoint() &&\n         \"adding unscoped local type data while in conditional scope\");\n  getOrCreateLocalTypeData().addConcrete(DominancePoint::universal(),\n                                         \/*conditional*\/ false, key, data);\n}\n\nvoid IRGenFunction::bindLocalTypeDataFromTypeMetadata(CanType type,\n                                                      IsExact_t isExact,\n                                                      llvm::Value *metadata) {\n  \/\/ Remember that we have this type metadata concretely.\n  if (isExact) {\n    if (!metadata->hasName()) setTypeMetadataName(IGM, metadata, type);\n    setScopedLocalTypeData(type, LocalTypeDataKind::forTypeMetadata(), metadata);\n  }\n\n  \/\/ Don't bother adding abstract fulfillments at a conditional dominance\n  \/\/ point; we're too likely to throw them all away.\n  if (isConditionalDominancePoint())\n    return;\n\n  getOrCreateLocalTypeData()\n    .addAbstractForTypeMetadata(*this, type, isExact, metadata);\n}\n\nvoid LocalTypeDataCache::addAbstractForTypeMetadata(IRGenFunction &IGF,\n                                                    CanType type,\n                                                    IsExact_t isExact,\n                                                    llvm::Value *metadata) {\n  \/\/ Look for anything at all that's fulfilled by this.  If we don't find\n  \/\/ anything, stop.\n  FulfillmentMap fulfillments;\n  if (!fulfillments.searchTypeMetadata(IGF.IGM, type, isExact,\n                                       \/*source*\/ 0, MetadataPath(),\n                                       FulfillmentMap::Everything())) {\n    return;\n  }\n\n  addAbstractForFulfillments(IGF, std::move(fulfillments),\n                             [&]() -> AbstractSource {\n    return AbstractSource(type, metadata);\n  });\n}\n\nvoid LocalTypeDataCache::\naddAbstractForFulfillments(IRGenFunction &IGF, FulfillmentMap &&fulfillments,\n                           llvm::function_ref<AbstractSource()> createSource) {\n  \/\/ Add the source lazily.\n  Optional<unsigned> sourceIndex;\n  auto getSourceIndex = [&]() -> unsigned {\n    if (!sourceIndex) {\n      AbstractSources.emplace_back(createSource());\n      sourceIndex = AbstractSources.size() - 1;\n    }\n    return *sourceIndex;\n  };\n\n  for (auto &fulfillment : fulfillments) {\n    CanType type = CanType(fulfillment.first.first);\n    LocalTypeDataKind localDataKind;\n\n    \/\/ For now, ignore witness-table fulfillments when they're not for\n    \/\/ archetypes.\n    if (ProtocolDecl *protocol = fulfillment.first.second) {\n      if (auto archetype = dyn_cast<ArchetypeType>(type)) {\n        auto conformsTo = archetype->getConformsTo();\n        auto it = std::find(conformsTo.begin(), conformsTo.end(), protocol);\n        if (it == conformsTo.end()) continue;\n        localDataKind = LocalTypeDataKind::forAbstractProtocolWitnessTable(*it);\n      } else {\n        continue;\n      }\n\n    } else {\n      \/\/ Ignore type metadata fulfillments for non-dependent types that\n      \/\/ we can produce very cheaply.  We don't want to end up emitting\n      \/\/ the type metadata for Int by chasing through N layers of metadata\n      \/\/ just because that path happens to be in the cache.\n      if (!type->hasArchetype() &&\n          isTypeMetadataAccessTrivial(IGF.IGM, type)) {\n        continue;\n      }\n\n      localDataKind = LocalTypeDataKind::forTypeMetadata();\n    }\n\n    \/\/ Find the chain for the key.\n    auto key = getKey(type, localDataKind);\n    auto &chain = Map[key];\n\n    \/\/ Check whether there's already an entry that's at least as good as the\n    \/\/ fulfillment.\n    Optional<unsigned> fulfillmentCost;\n    auto getFulfillmentCost = [&]() -> unsigned {\n      if (!fulfillmentCost)\n        fulfillmentCost = fulfillment.second.Path.cost();\n      return *fulfillmentCost;\n    };\n\n    bool isConditional = IGF.isConditionalDominancePoint();\n\n    bool foundBetter = false;\n    for (CacheEntry *cur = chain.Root, *last = nullptr; cur;\n         last = cur, cur = cur->getNext()) {\n      \/\/ Ensure the entry is acceptable.\n      if (!IGF.isActiveDominancePointDominatedBy(cur->DefinitionPoint))\n        continue;\n\n      \/\/ Ensure that the entry isn't better than the fulfillment.\n      auto curCost = cur->cost();\n      if (curCost == 0 || curCost <= getFulfillmentCost()) {\n        foundBetter = true;\n        break;\n      }\n\n      \/\/ If the entry is defined at the current point, (1) we know there\n      \/\/ won't be a better entry and (2) we should remove it.\n      if (cur->DefinitionPoint == IGF.getActiveDominancePoint() &&\n          !isConditional) {\n        \/\/ Splice it out of the chain.\n        assert(!cur->isConditional());\n        chain.eraseEntry(last, cur);\n        break;\n      }\n    }\n    if (foundBetter) continue;\n\n    \/\/ Okay, make a new entry.\n\n    \/\/ Register with the conditional dominance scope if necessary.\n    if (isConditional) {\n      IGF.registerConditionalLocalTypeDataKey(key);\n    }\n\n    \/\/ Allocate the new entry.\n    auto newEntry = new AbstractCacheEntry(IGF.getActiveDominancePoint(),\n                                           isConditional,\n                                           getSourceIndex(),\n                                           std::move(fulfillment.second.Path));\n\n    \/\/ Add it to the front of the chain.\n    chain.push_front(newEntry);\n  }\n}\n\nvoid LocalTypeDataCache::dump() const {\n  auto &out = llvm::errs();\n\n  if (Map.empty()) {\n    out << \"(empty)\\n\";\n    return;\n  }\n\n  for (auto &mapEntry : Map) {\n    mapEntry.first.print(out);\n    out << \" => [\";\n\n    if (mapEntry.second.Root) out << \"\\n\";\n    for (auto cur = mapEntry.second.Root; cur; cur = cur->getNext()) {\n      out << \"  (\";\n      if (cur->DefinitionPoint.isUniversal()) out << \"universal\";\n      else out << cur->DefinitionPoint.as<void>();\n      out << \") \";\n\n      if (cur->isConditional()) out << \"conditional \";\n\n      switch (cur->getKind()) {\n      case CacheEntry::Kind::Concrete: {\n        auto entry = static_cast<const ConcreteCacheEntry*>(cur);\n        out << \"concrete: \" << entry->Value << \"\\n  \";\n        if (!isa<llvm::Instruction>(entry->Value)) out << \"  \";\n        entry->Value->dump();\n        break;\n      }\n\n      case CacheEntry::Kind::Abstract: {\n        auto entry = static_cast<const AbstractCacheEntry*>(cur);\n        out << \"abstract: source=\" << entry->SourceIndex << \"\\n\";\n        break;\n      }\n      }\n    }\n    out << \"]\\n\";\n  }\n}\n\nvoid LocalTypeDataKey::dump() const {\n  print(llvm::errs());\n}\n\nvoid LocalTypeDataKey::print(llvm::raw_ostream &out) const {\n  out << \"(\" << Type.getPointer()\n      << \" (\" << Type << \"), \";\n  Kind.print(out);\n  out << \")\";\n}\n\nvoid LocalTypeDataKind::dump() const {\n  print(llvm::errs());\n}\nvoid LocalTypeDataKind::print(llvm::raw_ostream &out) const {\n  if (isConcreteProtocolConformance()) {\n    out << \"ConcreteConformance(\";\n    getConcreteProtocolConformance()->printName(out);\n    out << \")\";\n  } else if (isAbstractProtocolConformance()) {\n    out << \"AbstractConformance(\"\n        << getAbstractProtocolConformance()->getName()\n        << \")\";\n  } else if (Value == TypeMetadata) {\n    out << \"TypeMetadata\";\n  } else if (Value == ValueWitnessTable) {\n    out << \"ValueWitnessTable\";\n  } else {\n    assert(isSingletonKind());\n    ValueWitness witness = ValueWitness(Value - ValueWitnessBase);\n    out << getValueWitnessName(witness);\n  }\n}\n\nIRGenFunction::ConditionalDominanceScope::~ConditionalDominanceScope() {\n  IGF.ConditionalDominance = OldScope;\n\n  \/\/ Remove any conditional entries from the chains that were added in this\n  \/\/ scope.\n  for (auto &key : RegisteredKeys) {\n    IGF.LocalTypeData->eraseConditional(key);\n  }\n}\n\nvoid LocalTypeDataCache::eraseConditional(ArrayRef<LocalTypeDataKey> keys) {\n  for (auto &key : keys) {\n    auto &chain = Map[key];\n\n    \/\/ Our ability to simply delete the front of the chain relies on an\n    \/\/ assumption that (1) conditional additions always go to the front of\n    \/\/ the chain and (2) we never add something unconditionally while in\n    \/\/ an unconditional scope.\n    assert(chain.Root);\n    assert(chain.Root->isConditional());\n    chain.eraseEntry(nullptr, chain.Root);\n  }\n}\n<commit_msg>[gardening] Remove written, but never read variable. Found with clang-tidy.<commit_after>\/\/===--- LocalTypeData.cpp - Local type data search -----------------------===\/\/\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 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\/\/  This file implements routines for finding and caching local type data\n\/\/  for a search.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"LocalTypeData.h\"\n#include \"Fulfillment.h\"\n#include \"GenMeta.h\"\n#include \"GenProto.h\"\n#include \"IRGenDebugInfo.h\"\n#include \"IRGenFunction.h\"\n#include \"IRGenModule.h\"\n#include \"swift\/AST\/IRGenOptions.h\"\n#include \"swift\/SIL\/SILModule.h\"\n\nusing namespace swift;\nusing namespace irgen;\n\nLocalTypeDataKey LocalTypeDataKey::getCachingKey() const {\n  return { Type, Kind.getCachingKind() };\n}\n\nLocalTypeDataKind LocalTypeDataKind::getCachingKind() const {\n  \/\/ Most local type data kinds are already canonical.\n  if (!isConcreteProtocolConformance()) return *this;\n\n  \/\/ Map protocol conformances to their root normal conformance.\n  auto conformance = getConcreteProtocolConformance();\n  return forConcreteProtocolWitnessTable(\n                                     conformance->getRootNormalConformance());\n}\n\nLocalTypeDataCache &IRGenFunction::getOrCreateLocalTypeData() {\n  \/\/ Lazily allocate it.\n  if (LocalTypeData) return *LocalTypeData;\n  LocalTypeData = new LocalTypeDataCache();\n  return *LocalTypeData;\n}\n\nvoid IRGenFunction::destroyLocalTypeData() {\n  delete LocalTypeData;\n}\n\nunsigned LocalTypeDataCache::CacheEntry::cost() const {\n  switch (getKind()) {\n  case Kind::Concrete:\n    return static_cast<const ConcreteCacheEntry*>(this)->cost();\n  case Kind::Abstract:\n    return static_cast<const AbstractCacheEntry*>(this)->cost();\n  }\n  llvm_unreachable(\"bad cache entry kind\");\n}\n\nvoid LocalTypeDataCache::CacheEntry::erase() const {\n  switch (getKind()) {\n  case Kind::Concrete:\n    delete static_cast<const ConcreteCacheEntry*>(this);\n    return;\n  case Kind::Abstract:\n    delete static_cast<const AbstractCacheEntry*>(this);\n    return;\n  }\n  llvm_unreachable(\"bad cache entry kind\");\n}\n\nllvm::Value *IRGenFunction::getLocalTypeData(CanType type,\n                                             LocalTypeDataKind kind) {\n  assert(LocalTypeData);\n  return LocalTypeData->get(*this, LocalTypeDataCache::getKey(type, kind));\n}\n\nllvm::Value *IRGenFunction::tryGetConcreteLocalTypeData(LocalTypeDataKey key) {\n  if (!LocalTypeData) return nullptr;\n  return LocalTypeData->tryGet(*this, key, \/*allow abstract*\/ false);\n}\n\nllvm::Value *IRGenFunction::tryGetLocalTypeData(LocalTypeDataKey key) {\n  if (!LocalTypeData) return nullptr;\n  return LocalTypeData->tryGet(*this, key);\n}\n\nllvm::Value *LocalTypeDataCache::tryGet(IRGenFunction &IGF, Key key,\n                                        bool allowAbstract) {\n  auto it = Map.find(key);\n  if (it == Map.end()) return nullptr;\n  auto &chain = it->second;\n\n  CacheEntry *best = nullptr;\n  Optional<unsigned> bestCost;\n\n  CacheEntry *next = chain.Root, *nextPrev = nullptr;\n  while (next) {\n    CacheEntry *cur = next;\n    nextPrev = cur;\n    next = cur->getNext();\n\n    \/\/ Ignore abstract entries if so requested.\n    if (!allowAbstract && cur->getKind() != CacheEntry::Kind::Concrete)\n      continue;\n\n    \/\/ Ignore unacceptable entries.\n    if (!IGF.isActiveDominancePointDominatedBy(cur->DefinitionPoint))\n      continue;\n\n    \/\/ If there's a collision, compare by cost, ignoring higher-cost entries.\n    if (best) {\n      \/\/ Compute the cost of the best entry if we haven't done so already.\n      \/\/ If that's zero, go ahead and short-circuit out.\n      if (!bestCost) {\n        bestCost = best->cost();\n        if (*bestCost == 0) break;\n      }\n\n      auto curCost = cur->cost();\n      if (curCost >= *bestCost) continue;\n\n      \/\/ Replace the best cost and fall through.\n      bestCost = curCost;\n    }\n    best = cur;\n  }\n\n  \/\/ If we didn't find anything, we're done.\n  if (!best) return nullptr;\n\n  \/\/ Okay, we've found the best entry available.\n  switch (best->getKind()) {\n\n  \/\/ For concrete caches, this is easy.\n  case CacheEntry::Kind::Concrete:\n    return static_cast<ConcreteCacheEntry*>(best)->Value;\n\n  \/\/ For abstract caches, we need to follow a path.\n  case CacheEntry::Kind::Abstract: {\n    auto entry = static_cast<AbstractCacheEntry*>(best);\n\n    \/\/ Follow the path.\n    auto &source = AbstractSources[entry->SourceIndex];\n    auto result = entry->follow(IGF, source);\n\n    \/\/ Following the path automatically caches at every point along it,\n    \/\/ including the end.\n    assert(chain.Root->DefinitionPoint == IGF.getActiveDominancePoint());\n    assert(chain.Root->getKind() == CacheEntry::Kind::Concrete);\n\n    return result;\n  }\n\n  }\n  llvm_unreachable(\"bad cache entry kind\");\n}\n\nllvm::Value *\nLocalTypeDataCache::AbstractCacheEntry::follow(IRGenFunction &IGF,\n                                               AbstractSource &source) const {\n  switch (source.getKind()) {\n  case AbstractSource::Kind::TypeMetadata:\n    return Path.followFromTypeMetadata(IGF, source.getType(),\n                                       source.getValue(), nullptr);\n\n  case AbstractSource::Kind::ProtocolWitnessTable:\n    return Path.followFromWitnessTable(IGF, source.getType(),\n                                       source.getProtocolConformance(),\n                                       source.getValue(), nullptr);\n  }\n  llvm_unreachable(\"bad source kind\");\n}\n\nstatic void maybeEmitDebugInfoForLocalTypeData(IRGenFunction &IGF,\n                                               LocalTypeDataKey key,\n                                               llvm::Value *data) {\n  \/\/ Only if debug info is enabled.\n  if (!IGF.IGM.DebugInfo) return;\n\n  \/\/ Only for type metadata.\n  if (key.Kind != LocalTypeDataKind::forTypeMetadata()) return;\n\n  \/\/ Only for archetypes, and not for opened archetypes.\n  auto type = dyn_cast<ArchetypeType>(key.Type);\n  if (!type) return;\n  if (type->getOpenedExistentialType()) return;\n\n  \/\/ At -O0, create an alloca to keep the type alive.\n  auto name = type->getFullName();\n  if (!IGF.IGM.IRGen.Opts.Optimize) {\n    auto temp = IGF.createAlloca(data->getType(), IGF.IGM.getPointerAlignment(),\n                                 name);\n    IGF.Builder.CreateStore(data, temp);\n    data = temp.getAddress();\n  }\n\n  \/\/ Emit debug info for the metadata.\n  IGF.IGM.DebugInfo->emitTypeMetadata(IGF, data, name);\n}\n\nvoid IRGenFunction::setScopedLocalTypeData(LocalTypeDataKey key,\n                                           llvm::Value *data) {\n  maybeEmitDebugInfoForLocalTypeData(*this, key, data);\n\n  \/\/ Register with the active ConditionalDominanceScope if necessary.\n  bool isConditional = isConditionalDominancePoint();\n  if (isConditional) {\n    registerConditionalLocalTypeDataKey(key);\n  }\n\n  getOrCreateLocalTypeData().addConcrete(getActiveDominancePoint(),\n                                         isConditional, key, data);\n}\n\nvoid IRGenFunction::setUnscopedLocalTypeData(LocalTypeDataKey key,\n                                             llvm::Value *data) {\n  maybeEmitDebugInfoForLocalTypeData(*this, key, data);\n\n  \/\/ This is supportable, but it would require ensuring that we add the\n  \/\/ entry after any conditional entries; otherwise the stack discipline\n  \/\/ will get messed up.\n  assert(!isConditionalDominancePoint() &&\n         \"adding unscoped local type data while in conditional scope\");\n  getOrCreateLocalTypeData().addConcrete(DominancePoint::universal(),\n                                         \/*conditional*\/ false, key, data);\n}\n\nvoid IRGenFunction::bindLocalTypeDataFromTypeMetadata(CanType type,\n                                                      IsExact_t isExact,\n                                                      llvm::Value *metadata) {\n  \/\/ Remember that we have this type metadata concretely.\n  if (isExact) {\n    if (!metadata->hasName()) setTypeMetadataName(IGM, metadata, type);\n    setScopedLocalTypeData(type, LocalTypeDataKind::forTypeMetadata(), metadata);\n  }\n\n  \/\/ Don't bother adding abstract fulfillments at a conditional dominance\n  \/\/ point; we're too likely to throw them all away.\n  if (isConditionalDominancePoint())\n    return;\n\n  getOrCreateLocalTypeData()\n    .addAbstractForTypeMetadata(*this, type, isExact, metadata);\n}\n\nvoid LocalTypeDataCache::addAbstractForTypeMetadata(IRGenFunction &IGF,\n                                                    CanType type,\n                                                    IsExact_t isExact,\n                                                    llvm::Value *metadata) {\n  \/\/ Look for anything at all that's fulfilled by this.  If we don't find\n  \/\/ anything, stop.\n  FulfillmentMap fulfillments;\n  if (!fulfillments.searchTypeMetadata(IGF.IGM, type, isExact,\n                                       \/*source*\/ 0, MetadataPath(),\n                                       FulfillmentMap::Everything())) {\n    return;\n  }\n\n  addAbstractForFulfillments(IGF, std::move(fulfillments),\n                             [&]() -> AbstractSource {\n    return AbstractSource(type, metadata);\n  });\n}\n\nvoid LocalTypeDataCache::\naddAbstractForFulfillments(IRGenFunction &IGF, FulfillmentMap &&fulfillments,\n                           llvm::function_ref<AbstractSource()> createSource) {\n  \/\/ Add the source lazily.\n  Optional<unsigned> sourceIndex;\n  auto getSourceIndex = [&]() -> unsigned {\n    if (!sourceIndex) {\n      AbstractSources.emplace_back(createSource());\n      sourceIndex = AbstractSources.size() - 1;\n    }\n    return *sourceIndex;\n  };\n\n  for (auto &fulfillment : fulfillments) {\n    CanType type = CanType(fulfillment.first.first);\n    LocalTypeDataKind localDataKind;\n\n    \/\/ For now, ignore witness-table fulfillments when they're not for\n    \/\/ archetypes.\n    if (ProtocolDecl *protocol = fulfillment.first.second) {\n      if (auto archetype = dyn_cast<ArchetypeType>(type)) {\n        auto conformsTo = archetype->getConformsTo();\n        auto it = std::find(conformsTo.begin(), conformsTo.end(), protocol);\n        if (it == conformsTo.end()) continue;\n        localDataKind = LocalTypeDataKind::forAbstractProtocolWitnessTable(*it);\n      } else {\n        continue;\n      }\n\n    } else {\n      \/\/ Ignore type metadata fulfillments for non-dependent types that\n      \/\/ we can produce very cheaply.  We don't want to end up emitting\n      \/\/ the type metadata for Int by chasing through N layers of metadata\n      \/\/ just because that path happens to be in the cache.\n      if (!type->hasArchetype() &&\n          isTypeMetadataAccessTrivial(IGF.IGM, type)) {\n        continue;\n      }\n\n      localDataKind = LocalTypeDataKind::forTypeMetadata();\n    }\n\n    \/\/ Find the chain for the key.\n    auto key = getKey(type, localDataKind);\n    auto &chain = Map[key];\n\n    \/\/ Check whether there's already an entry that's at least as good as the\n    \/\/ fulfillment.\n    Optional<unsigned> fulfillmentCost;\n    auto getFulfillmentCost = [&]() -> unsigned {\n      if (!fulfillmentCost)\n        fulfillmentCost = fulfillment.second.Path.cost();\n      return *fulfillmentCost;\n    };\n\n    bool isConditional = IGF.isConditionalDominancePoint();\n\n    bool foundBetter = false;\n    for (CacheEntry *cur = chain.Root, *last = nullptr; cur;\n         last = cur, cur = cur->getNext()) {\n      \/\/ Ensure the entry is acceptable.\n      if (!IGF.isActiveDominancePointDominatedBy(cur->DefinitionPoint))\n        continue;\n\n      \/\/ Ensure that the entry isn't better than the fulfillment.\n      auto curCost = cur->cost();\n      if (curCost == 0 || curCost <= getFulfillmentCost()) {\n        foundBetter = true;\n        break;\n      }\n\n      \/\/ If the entry is defined at the current point, (1) we know there\n      \/\/ won't be a better entry and (2) we should remove it.\n      if (cur->DefinitionPoint == IGF.getActiveDominancePoint() &&\n          !isConditional) {\n        \/\/ Splice it out of the chain.\n        assert(!cur->isConditional());\n        chain.eraseEntry(last, cur);\n        break;\n      }\n    }\n    if (foundBetter) continue;\n\n    \/\/ Okay, make a new entry.\n\n    \/\/ Register with the conditional dominance scope if necessary.\n    if (isConditional) {\n      IGF.registerConditionalLocalTypeDataKey(key);\n    }\n\n    \/\/ Allocate the new entry.\n    auto newEntry = new AbstractCacheEntry(IGF.getActiveDominancePoint(),\n                                           isConditional,\n                                           getSourceIndex(),\n                                           std::move(fulfillment.second.Path));\n\n    \/\/ Add it to the front of the chain.\n    chain.push_front(newEntry);\n  }\n}\n\nvoid LocalTypeDataCache::dump() const {\n  auto &out = llvm::errs();\n\n  if (Map.empty()) {\n    out << \"(empty)\\n\";\n    return;\n  }\n\n  for (auto &mapEntry : Map) {\n    mapEntry.first.print(out);\n    out << \" => [\";\n\n    if (mapEntry.second.Root) out << \"\\n\";\n    for (auto cur = mapEntry.second.Root; cur; cur = cur->getNext()) {\n      out << \"  (\";\n      if (cur->DefinitionPoint.isUniversal()) out << \"universal\";\n      else out << cur->DefinitionPoint.as<void>();\n      out << \") \";\n\n      if (cur->isConditional()) out << \"conditional \";\n\n      switch (cur->getKind()) {\n      case CacheEntry::Kind::Concrete: {\n        auto entry = static_cast<const ConcreteCacheEntry*>(cur);\n        out << \"concrete: \" << entry->Value << \"\\n  \";\n        if (!isa<llvm::Instruction>(entry->Value)) out << \"  \";\n        entry->Value->dump();\n        break;\n      }\n\n      case CacheEntry::Kind::Abstract: {\n        auto entry = static_cast<const AbstractCacheEntry*>(cur);\n        out << \"abstract: source=\" << entry->SourceIndex << \"\\n\";\n        break;\n      }\n      }\n    }\n    out << \"]\\n\";\n  }\n}\n\nvoid LocalTypeDataKey::dump() const {\n  print(llvm::errs());\n}\n\nvoid LocalTypeDataKey::print(llvm::raw_ostream &out) const {\n  out << \"(\" << Type.getPointer()\n      << \" (\" << Type << \"), \";\n  Kind.print(out);\n  out << \")\";\n}\n\nvoid LocalTypeDataKind::dump() const {\n  print(llvm::errs());\n}\nvoid LocalTypeDataKind::print(llvm::raw_ostream &out) const {\n  if (isConcreteProtocolConformance()) {\n    out << \"ConcreteConformance(\";\n    getConcreteProtocolConformance()->printName(out);\n    out << \")\";\n  } else if (isAbstractProtocolConformance()) {\n    out << \"AbstractConformance(\"\n        << getAbstractProtocolConformance()->getName()\n        << \")\";\n  } else if (Value == TypeMetadata) {\n    out << \"TypeMetadata\";\n  } else if (Value == ValueWitnessTable) {\n    out << \"ValueWitnessTable\";\n  } else {\n    assert(isSingletonKind());\n    ValueWitness witness = ValueWitness(Value - ValueWitnessBase);\n    out << getValueWitnessName(witness);\n  }\n}\n\nIRGenFunction::ConditionalDominanceScope::~ConditionalDominanceScope() {\n  IGF.ConditionalDominance = OldScope;\n\n  \/\/ Remove any conditional entries from the chains that were added in this\n  \/\/ scope.\n  for (auto &key : RegisteredKeys) {\n    IGF.LocalTypeData->eraseConditional(key);\n  }\n}\n\nvoid LocalTypeDataCache::eraseConditional(ArrayRef<LocalTypeDataKey> keys) {\n  for (auto &key : keys) {\n    auto &chain = Map[key];\n\n    \/\/ Our ability to simply delete the front of the chain relies on an\n    \/\/ assumption that (1) conditional additions always go to the front of\n    \/\/ the chain and (2) we never add something unconditionally while in\n    \/\/ an unconditional scope.\n    assert(chain.Root);\n    assert(chain.Root->isConditional());\n    chain.eraseEntry(nullptr, chain.Root);\n  }\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\/Lex\/Preprocessor.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include <sstream>\nusing namespace clang;\n\nvoid html::EscapeText(Rewriter& R, unsigned FileID,\n                      bool EscapeSpaces, bool ReplaceTabs) {\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  RewriteBuffer &RB = R.getEditBuffer(FileID);\n  \n  for (unsigned FilePos = 0; C != FileEnd ; ++C, ++FilePos) {\n      \n    switch (*C) {\n    default: break;\n      \n    case ' ':\n      if (EscapeSpaces)\n        RB.ReplaceText(FilePos, 1, \"&nbsp;\", 6);\n      break;\n\n    case '\\t':\n      if (!ReplaceTabs)\n        break;\n      if (EscapeSpaces)\n        RB.ReplaceText(FilePos, 1, \"&nbsp;&nbsp;&nbsp;&nbsp;\", 6*4);\n      else\n        RB.ReplaceText(FilePos, 1, \"    \", 4);\n      break;\n      \n    case '<':\n      RB.ReplaceText(FilePos, 1, \"&lt;\", 4);\n      break;\n      \n    case '>':\n      RB.ReplaceText(FilePos, 1, \"&gt;\", 4);\n      break;\n      \n    case '&':\n      RB.ReplaceText(FilePos, 1, \"&amp;\", 5);\n      break;\n    }\n  }\n}\n\nstd::string html::EscapeText(const std::string& s, bool EscapeSpaces,\n                             bool ReplaceTabs) {\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    switch (c) {\n    default:\n      os << c; break;\n      \n    case ' ':\n      if (EscapeSpaces) os << \"&nbsp;\";\n      else os << ' ';\n      break;\n      \n      case '\\t':\n        if (ReplaceTabs)\n          for (unsigned i = 0; i < 4; ++i)\n            os << \"&nbsp;\";\n        else \n          os << c;\n      \n        break;\n      \n      case '<': os << \"&lt;\"; break;\n      case '>': os << \"&gt;\"; break;\n      case '&': os << \"&amp;\"; break;\n    }\n  }\n  \n  return os.str();\n}\n\nstatic void AddLineNumber(RewriteBuffer &RB, unsigned LineNo,\n                          unsigned B, unsigned E) {\n  llvm::SmallString<100> Str;\n  Str += \"<tr><td class=\\\"num\\\" id=\\\"LN\";\n  Str.append_uint(LineNo);\n  Str += \"\\\">\";\n  Str.append_uint(LineNo);\n  Str += \"<\/td><td class=\\\"line\\\">\";\n  \n  if (B == E) { \/\/ Handle empty lines.\n    Str += \" <\/td><\/tr>\";\n    RB.InsertTextBefore(B, &Str[0], Str.size());\n  } else {\n    RB.InsertTextBefore(B, &Str[0], Str.size());\n    RB.InsertTextBefore(E, \"<\/td><\/tr>\", strlen(\"<\/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  RewriteBuffer &RB = R.getEditBuffer(FileID);\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(RB, LineNo, LineStartPos, LineEndPos);\n  }\n  \n  \/\/ Add one big table tag that surrounds all of the code.\n  RB.InsertTextBefore(0, \"<table class=\\\"code\\\">\\n\",\n                      strlen(\"<table class=\\\"code\\\">\\n\"));\n  \n  RB.InsertTextAfter(FileEnd - FileBeg, \"<\/table>\", strlen(\"<\/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  R.InsertCStrBefore(StartLoc,\n      \"<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:14pt }\\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      \" .comment { color: #A0A0A0 }\\n\"\n      \" .keyword { color: #FF00FF }\\n\"\n      \" .directive { color: #FFFF00 }\\n\"\n      \" .macro { color: #FF0000; background-color:#FFC0C0 }\\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      \" table.simpletable {\\n\"\n      \"   padding: 5px;\\n\"\n      \"   font-size:12pt;\\n\"\n      \"   margin:20px;\\n\"\n      \"   border-collapse: collapse; border-spacing: 0px;\\n\"\n      \" }\\n\"\n      \" td.rowname {\\n\"\n      \"   text-align:right; font-weight:bold; color:#444444;\\n\"\n      \"   padding-right:2ex; }\\n\"\n      \"<\/style>\\n<\/head>\\n<body>\");\n\n  \/\/ Generate footer\n  \n  R.InsertCStrAfter(EndLoc, \"<\/body><\/html>\\n\");\n}\n\n\/\/\/ SyntaxHighlight - Relex the specified FileID and annotate the HTML with\n\/\/\/ information about keywords, macro expansions etc.  This uses the macro\n\/\/\/ table state from the end of the file, so it won't be perfectly perfect,\n\/\/\/ but it will be reasonably close.\nvoid html::SyntaxHighlight(Rewriter &R, unsigned FileID, Preprocessor &PP) {\n  RewriteBuffer &RB = R.getEditBuffer(FileID);\n\n  \/\/ Inform the preprocessor that we want to retain comments as tokens, so we \n  \/\/ can highlight them.\n  PP.SetCommentRetentionState(true, false);\n \n  \/\/ Start parsing the specified input file.\n  PP.EnterMainSourceFile();\n\n  \/\/ Lex all the tokens in raw mode, to avoid entering #includes or expanding\n  \/\/ macros.\n  const SourceManager &SourceMgr = PP.getSourceManager();\n  Token Tok;\n  PP.LexUnexpandedToken(Tok);\n  \n  \/\/ Skip tokens from the predefine buffer or whatever else.\n  \/\/ Consume all of the tokens that come from the predefines buffer.  Those\n  \/\/ should not be emitted into the output and are guaranteed to be at the\n  \/\/ start.\n  while (Tok.isNot(tok::eof) && Tok.getLocation().isFileID() &&\n         SourceMgr.getCanonicalFileID(Tok.getLocation()) != FileID)\n    PP.LexUnexpandedToken(Tok);\n\n  while (Tok.isNot(tok::eof)) {\n    \/\/ Since we are lexing unexpanded tokens, all tokens are from the main\n    \/\/ FileID.\n    unsigned TokOffs = SourceMgr.getFullFilePos(Tok.getLocation());\n    unsigned TokLen = Tok.getLength();\n    switch (Tok.getKind()) {\n    default:\n      \/\/ If this is a pp-identifier, but not a real identifier it must be a\n      \/\/ keyword.\n      if (Tok.getIdentifierInfo() && Tok.isNot(tok::identifier)) {\n        RB.InsertTextAfter(TokOffs, \"<span class='keyword'>\",\n                           strlen(\"<span class='keyword'>\"));\n        RB.InsertTextBefore(TokOffs+TokLen, \"<\/span>\", strlen(\"<\/span>\"));\n      }\n      break;\n    case tok::comment:\n      RB.InsertTextAfter(TokOffs, \"<span class='comment'>\",\n                         strlen(\"<span class='comment'>\"));\n      RB.InsertTextBefore(TokOffs+TokLen, \"<\/span>\", strlen(\"<\/span>\"));\n      break;\n    case tok::hash:\n      \/\/ FIXME: This isn't working because we're not in raw mode in the lexer.\n      \/\/ Just cons up our own lexer here?\n        \n      \/\/ If this is a preprocessor directive, all tokens to end of line are too.\n      if (Tok.isAtStartOfLine()) {\n        RB.InsertTextAfter(TokOffs, \"<span class='directive'>\",\n                           strlen(\"<span class='directive'>\"));\n        \/\/ Find end of line.  This is a hack.\n        const char *LineEnd = SourceMgr.getCharacterData(Tok.getLocation());\n        unsigned TokEnd = TokOffs+strcspn(LineEnd, \"\\n\\r\");\n        RB.InsertTextBefore(TokEnd, \"<\/span>\", strlen(\"<\/span>\"));\n      }\n      break;\n    }\n    \n    PP.LexUnexpandedToken(Tok);\n  }\n  PP.SetCommentRetentionState(false, false);\n}\n\n\/\/\/ HighlightMacros - This uses the macro table state from the end of the\n\/\/\/ file, to reexpand macros and insert (into the HTML) information about the\n\/\/\/ macro expansions.  This won't be perfectly perfect, but it will be\n\/\/\/ reasonably close.\nvoid html::HighlightMacros(Rewriter &R, unsigned FileID, Preprocessor &PP) {\n  RewriteBuffer &RB = R.getEditBuffer(FileID);\n  \n  \/\/ Inform the preprocessor that we don't want comments.\n  PP.SetCommentRetentionState(false, false);\n  \n  \/\/ Start parsing the specified input file.\n  PP.EnterMainSourceFile();\n  \n  \/\/ Lex all the tokens.\n  const SourceManager &SourceMgr = PP.getSourceManager();\n  Token Tok;\n  PP.Lex(Tok);\n  while (Tok.isNot(tok::eof)) {\n    \/\/ Ignore non-macro tokens.\n    if (!Tok.getLocation().isMacroID()) {\n      PP.Lex(Tok);\n      continue;\n    }\n    \n    \/\/ Ignore tokens whose logical location was not the main file.\n    SourceLocation LLoc = SourceMgr.getLogicalLoc(Tok.getLocation());\n    std::pair<unsigned, unsigned> LLocInfo = \n      SourceMgr.getDecomposedFileLoc(LLoc);\n    \n    if (LLocInfo.first != FileID) {\n      PP.Lex(Tok);\n      continue;\n    }\n    \n    \/\/ Okay, we have the first token of a macro expansion: highlight the\n    \/\/ instantiation.\n  \n    \/\/ Get the size of current macro call itself.\n    \/\/ FIXME: This should highlight the args of a function-like\n    \/\/ macro, using a heuristic.\n    unsigned TokLen = Lexer::MeasureTokenLength(LLoc, SourceMgr);\n    \n    unsigned TokOffs = LLocInfo.second;\n    RB.InsertTextAfter(TokOffs, \"<span class='macro'>\",\n                       strlen(\"<span class='macro'>\"));\n    RB.InsertTextBefore(TokOffs+TokLen, \"<\/span>\", strlen(\"<\/span>\"));\n    \n    \/\/ Okay, eat this token, getting the next one.\n    PP.Lex(Tok);\n    \n    \/\/ Skip all the rest of the tokens that are part of this macro\n    \/\/ instantiation.  It would be really nice to pop up a window with all the\n    \/\/ spelling of the tokens or something.\n    while (!Tok.is(tok::eof) &&\n           SourceMgr.getLogicalLoc(Tok.getLocation()) == LLoc)\n      PP.Lex(Tok);\n  }\n}\n\n\n<commit_msg>switch from relexing with the preprocessor to do syntax highlighting to relexing with the Lexer.  This is cheaper and gives us some advantages.  For now we start highlighting preprocessor directives (which need improvement), and disable  comments.  Comments to be restored later.<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\/Lex\/Preprocessor.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include <sstream>\nusing namespace clang;\n\nvoid html::EscapeText(Rewriter& R, unsigned FileID,\n                      bool EscapeSpaces, bool ReplaceTabs) {\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  RewriteBuffer &RB = R.getEditBuffer(FileID);\n  \n  for (unsigned FilePos = 0; C != FileEnd ; ++C, ++FilePos) {\n      \n    switch (*C) {\n    default: break;\n      \n    case ' ':\n      if (EscapeSpaces)\n        RB.ReplaceText(FilePos, 1, \"&nbsp;\", 6);\n      break;\n\n    case '\\t':\n      if (!ReplaceTabs)\n        break;\n      if (EscapeSpaces)\n        RB.ReplaceText(FilePos, 1, \"&nbsp;&nbsp;&nbsp;&nbsp;\", 6*4);\n      else\n        RB.ReplaceText(FilePos, 1, \"    \", 4);\n      break;\n      \n    case '<':\n      RB.ReplaceText(FilePos, 1, \"&lt;\", 4);\n      break;\n      \n    case '>':\n      RB.ReplaceText(FilePos, 1, \"&gt;\", 4);\n      break;\n      \n    case '&':\n      RB.ReplaceText(FilePos, 1, \"&amp;\", 5);\n      break;\n    }\n  }\n}\n\nstd::string html::EscapeText(const std::string& s, bool EscapeSpaces,\n                             bool ReplaceTabs) {\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    switch (c) {\n    default:\n      os << c; break;\n      \n    case ' ':\n      if (EscapeSpaces) os << \"&nbsp;\";\n      else os << ' ';\n      break;\n      \n      case '\\t':\n        if (ReplaceTabs)\n          for (unsigned i = 0; i < 4; ++i)\n            os << \"&nbsp;\";\n        else \n          os << c;\n      \n        break;\n      \n      case '<': os << \"&lt;\"; break;\n      case '>': os << \"&gt;\"; break;\n      case '&': os << \"&amp;\"; break;\n    }\n  }\n  \n  return os.str();\n}\n\nstatic void AddLineNumber(RewriteBuffer &RB, unsigned LineNo,\n                          unsigned B, unsigned E) {\n  llvm::SmallString<100> Str;\n  Str += \"<tr><td class=\\\"num\\\" id=\\\"LN\";\n  Str.append_uint(LineNo);\n  Str += \"\\\">\";\n  Str.append_uint(LineNo);\n  Str += \"<\/td><td class=\\\"line\\\">\";\n  \n  if (B == E) { \/\/ Handle empty lines.\n    Str += \" <\/td><\/tr>\";\n    RB.InsertTextBefore(B, &Str[0], Str.size());\n  } else {\n    RB.InsertTextBefore(B, &Str[0], Str.size());\n    RB.InsertTextBefore(E, \"<\/td><\/tr>\", strlen(\"<\/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  RewriteBuffer &RB = R.getEditBuffer(FileID);\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(RB, LineNo, LineStartPos, LineEndPos);\n  }\n  \n  \/\/ Add one big table tag that surrounds all of the code.\n  RB.InsertTextBefore(0, \"<table class=\\\"code\\\">\\n\",\n                      strlen(\"<table class=\\\"code\\\">\\n\"));\n  \n  RB.InsertTextAfter(FileEnd - FileBeg, \"<\/table>\", strlen(\"<\/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  R.InsertCStrBefore(StartLoc,\n      \"<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:14pt }\\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      \" .comment { color: #A0A0A0 }\\n\"\n      \" .keyword { color: #FF00FF }\\n\"\n      \" .directive { color: #FFFF00 }\\n\"\n      \" .macro { color: #FF0000; background-color:#FFC0C0 }\\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      \" table.simpletable {\\n\"\n      \"   padding: 5px;\\n\"\n      \"   font-size:12pt;\\n\"\n      \"   margin:20px;\\n\"\n      \"   border-collapse: collapse; border-spacing: 0px;\\n\"\n      \" }\\n\"\n      \" td.rowname {\\n\"\n      \"   text-align:right; font-weight:bold; color:#444444;\\n\"\n      \"   padding-right:2ex; }\\n\"\n      \"<\/style>\\n<\/head>\\n<body>\");\n\n  \/\/ Generate footer\n  \n  R.InsertCStrAfter(EndLoc, \"<\/body><\/html>\\n\");\n}\n\n\/\/\/ SyntaxHighlight - Relex the specified FileID and annotate the HTML with\n\/\/\/ information about keywords, macro expansions etc.  This uses the macro\n\/\/\/ table state from the end of the file, so it won't be perfectly perfect,\n\/\/\/ but it will be reasonably close.\nvoid html::SyntaxHighlight(Rewriter &R, unsigned FileID, Preprocessor &PP) {\n  RewriteBuffer &RB = R.getEditBuffer(FileID);\n\n  const SourceManager &SourceMgr = PP.getSourceManager();\n  std::pair<const char*, const char*> File = SourceMgr.getBufferData(FileID);\n  const char *BufferStart = File.first;\n  \n  Lexer L(SourceLocation::getFileLoc(FileID, 0), PP.getLangOptions(),\n          File.first, File.second);\n  \n  \/\/ Inform the preprocessor that we want to retain comments as tokens, so we \n  \/\/ can highlight them.\n  \/\/PP.SetCommentRetentionState(true, false);\n \n  \/\/ Lex all the tokens in raw mode, to avoid entering #includes or expanding\n  \/\/ macros.\n  Token Tok;\n  L.LexRawToken(Tok);\n  \n  while (Tok.isNot(tok::eof)) {\n    \/\/ Since we are lexing unexpanded tokens, all tokens are from the main\n    \/\/ FileID.\n    unsigned TokOffs = SourceMgr.getFullFilePos(Tok.getLocation());\n    unsigned TokLen = Tok.getLength();\n    switch (Tok.getKind()) {\n    default: break;\n    case tok::identifier: {\n      \/\/ Fill in Result.IdentifierInfo, looking up the identifier in the\n      \/\/ identifier table.\n      IdentifierInfo *II = PP.LookUpIdentifierInfo(Tok, BufferStart+TokOffs);\n        \n      \/\/ If this is a pp-identifier, for a keyword, highlight it as such.\n      if (II->getTokenID() != tok::identifier) {\n        RB.InsertTextAfter(TokOffs, \"<span class='keyword'>\",\n                           strlen(\"<span class='keyword'>\"));\n        RB.InsertTextBefore(TokOffs+TokLen, \"<\/span>\", strlen(\"<\/span>\"));\n      }\n      break;\n    }\n    case tok::comment:\n      RB.InsertTextAfter(TokOffs, \"<span class='comment'>\",\n                         strlen(\"<span class='comment'>\"));\n      RB.InsertTextBefore(TokOffs+TokLen, \"<\/span>\", strlen(\"<\/span>\"));\n      break;\n    case tok::hash:\n      \/\/ FIXME: This isn't working because we're not in raw mode in the lexer.\n      \/\/ Just cons up our own lexer here?\n        \n      \/\/ If this is a preprocessor directive, all tokens to end of line are too.\n      if (Tok.isAtStartOfLine()) {\n        RB.InsertTextAfter(TokOffs, \"<span class='directive'>\",\n                           strlen(\"<span class='directive'>\"));\n        \/\/ Find end of line.  This is a hack.\n        const char *LineEnd = SourceMgr.getCharacterData(Tok.getLocation());\n        unsigned TokEnd = TokOffs+strcspn(LineEnd, \"\\n\\r\");\n        RB.InsertTextBefore(TokEnd, \"<\/span>\", strlen(\"<\/span>\"));\n      }\n      break;\n    }\n    \n    L.LexRawToken(Tok);\n  }\n}\n\n\/\/\/ HighlightMacros - This uses the macro table state from the end of the\n\/\/\/ file, to reexpand macros and insert (into the HTML) information about the\n\/\/\/ macro expansions.  This won't be perfectly perfect, but it will be\n\/\/\/ reasonably close.\nvoid html::HighlightMacros(Rewriter &R, unsigned FileID, Preprocessor &PP) {\n  RewriteBuffer &RB = R.getEditBuffer(FileID);\n  \n  \/\/ Inform the preprocessor that we don't want comments.\n  PP.SetCommentRetentionState(false, false);\n  \n  \/\/ Start parsing the specified input file.\n  PP.EnterMainSourceFile();\n  \n  \/\/ Lex all the tokens.\n  const SourceManager &SourceMgr = PP.getSourceManager();\n  Token Tok;\n  PP.Lex(Tok);\n  while (Tok.isNot(tok::eof)) {\n    \/\/ Ignore non-macro tokens.\n    if (!Tok.getLocation().isMacroID()) {\n      PP.Lex(Tok);\n      continue;\n    }\n    \n    \/\/ Ignore tokens whose logical location was not the main file.\n    SourceLocation LLoc = SourceMgr.getLogicalLoc(Tok.getLocation());\n    std::pair<unsigned, unsigned> LLocInfo = \n      SourceMgr.getDecomposedFileLoc(LLoc);\n    \n    if (LLocInfo.first != FileID) {\n      PP.Lex(Tok);\n      continue;\n    }\n    \n    \/\/ Okay, we have the first token of a macro expansion: highlight the\n    \/\/ instantiation.\n  \n    \/\/ Get the size of current macro call itself.\n    \/\/ FIXME: This should highlight the args of a function-like\n    \/\/ macro, using a heuristic.\n    unsigned TokLen = Lexer::MeasureTokenLength(LLoc, SourceMgr);\n    \n    unsigned TokOffs = LLocInfo.second;\n    RB.InsertTextAfter(TokOffs, \"<span class='macro'>\",\n                       strlen(\"<span class='macro'>\"));\n    RB.InsertTextBefore(TokOffs+TokLen, \"<\/span>\", strlen(\"<\/span>\"));\n    \n    \/\/ Okay, eat this token, getting the next one.\n    PP.Lex(Tok);\n    \n    \/\/ Skip all the rest of the tokens that are part of this macro\n    \/\/ instantiation.  It would be really nice to pop up a window with all the\n    \/\/ spelling of the tokens or something.\n    while (!Tok.is(tok::eof) &&\n           SourceMgr.getLogicalLoc(Tok.getLocation()) == LLoc)\n      PP.Lex(Tok);\n  }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/TODO: 0 size state != rule-local feature, i.e. still may depend on source span loc\/context.  identify truly rule-local features so if we want they can be added to grammar rules (minor speedup)\n\n#include <boost\/lexical_cast.hpp>\n#include \"ff.h\"\n\n#include \"tdict.h\"\n#include \"hg.h\"\n\nusing namespace std;\n\nFeatureFunction::~FeatureFunction() {}\n\n\nvoid FeatureFunction::FinalTraversalFeatures(const void* ant_state,\n                                             SparseVector<double>* features) const {\n  (void) ant_state;\n  (void) features;\n}\n\nstring FeatureFunction::usage_helper(std::string const& name,std::string const& params,std::string const& details,bool sp,bool sd) {\n  string r=name;\n  if (sp) {\n    r+=\": \";\n    r+=params;\n  }\n  if (sd) {\n    r+=\"\\n\";\n    r+=details;\n  }\n  return r;\n}\n\nFeatureFunction::Features FeatureFunction::single_feature(WordID feat) {\n  return Features(1,feat);\n}\n\nFeatureFunction::Features ModelSet::all_features(std::ostream *warn,bool warn0) {\n  typedef FeatureFunction::Features FFS;\n  FFS ffs;\n#define WARNFF(x) do { if (warn) { *warn << \"WARNING: \"<< x ; *warn<<endl; } } while(0)\n  typedef std::map<WordID,string> FFM;\n  FFM ff_from;\n  for (unsigned i=0;i<models_.size();++i) {\n    FeatureFunction const& ff=*models_[i];\n    string const& ffname=ff.name;\n    FFS si=ff.features();\n    if (si.empty()) {\n      WARNFF(ffname<<\" doesn't yet report any feature IDs - implement features() method?\");\n    }\n    unsigned n0=0;\n    for (unsigned j=0;j<si.size();++j) {\n      WordID fid=si[j];\n      if (!fid) ++n0;\n      if (fid >= weights_.size())\n        weights_.resize(fid+1);\n      if (warn0 || fid) {\n        pair<FFM::iterator,bool> i_new=ff_from.insert(FFM::value_type(fid,ffname));\n        if (i_new.second) {\n          if (fid)\n            ffs.push_back(fid);\n          else\n            WARNFF(\"Feature id 0 for \"<<ffname<<\" (models[\"<<i<<\"]) - probably no weight provided.  Don't freeze feature ids to see the name\");\n        } else {\n          WARNFF(ffname<<\" (models[\"<<i<<\"]) tried to define feature \"<<FD::Convert(fid)<<\" already defined earlier by \"<<i_new.first->second);\n        }\n      }\n    }\n    if (n0)\n      WARNFF(ffname<<\" (models[\"<<i<<\"]) had \"<<n0<<\" unused features (--no_freeze_feature_set to see them)\");\n  }\n  return ffs;\n#undef WARNFF\n}\n\nvoid ModelSet::show_features(std::ostream &out,std::ostream &warn,bool warn_zero_wt)\n{\n  typedef FeatureFunction::Features FFS;\n  FFS ffs=all_features(&warn);\n  out << \"Weight  Feature\\n\";\n  for (unsigned i=0;i<ffs.size();++i) {\n    WordID fid=ffs[i];\n    string const& fname=FD::Convert(fid);\n    double wt=weights_[fid];\n    if (warn_zero_wt && wt==0)\n      warn<<\"WARNING: \"<<fname<<\" has 0 weight.\"<<endl;\n    out << wt << \"  \" << fname<<endl;\n  }\n\n}\n\n\/\/ Hiero and Joshua use log_10(e) as the value, so I do to\nWordPenalty::WordPenalty(const string& param) :\n    fid_(FD::Convert(\"WordPenalty\")),\n    value_(-1.0 \/ log(10)) {\n  if (!param.empty()) {\n    cerr << \"Warning WordPenalty ignoring parameter: \" << param << endl;\n  }\n}\n\nvoid WordPenalty::TraversalFeaturesImpl(const SentenceMetadata& smeta,\n                                        const Hypergraph::Edge& edge,\n                                        const std::vector<const void*>& ant_states,\n                                        SparseVector<double>* features,\n                                        SparseVector<double>* estimated_features,\n                                        void* state) const {\n  (void) smeta;\n  (void) ant_states;\n  (void) state;\n  (void) estimated_features;\n  features->set_value(fid_, edge.rule_->EWords() * value_);\n}\n\nSourceWordPenalty::SourceWordPenalty(const string& param) :\n    fid_(FD::Convert(\"SourceWordPenalty\")),\n    value_(-1.0 \/ log(10)) {\n  if (!param.empty()) {\n    cerr << \"Warning SourceWordPenalty ignoring parameter: \" << param << endl;\n  }\n}\n\nFeatureFunction::Features SourceWordPenalty::features() const {\n  return single_feature(fid_);\n}\n\nFeatureFunction::Features WordPenalty::features() const {\n  return single_feature(fid_);\n}\n\n\nvoid SourceWordPenalty::TraversalFeaturesImpl(const SentenceMetadata& smeta,\n                                        const Hypergraph::Edge& edge,\n                                        const std::vector<const void*>& ant_states,\n                                        SparseVector<double>* features,\n                                        SparseVector<double>* estimated_features,\n                                        void* state) const {\n  (void) smeta;\n  (void) ant_states;\n  (void) state;\n  (void) estimated_features;\n  features->set_value(fid_, edge.rule_->FWords() * value_);\n}\n\nArityPenalty::ArityPenalty(const std::string& param) :\n    value_(-1.0 \/ log(10)) {\n  string fname = \"Arity_\";\n  unsigned MAX=DEFAULT_MAX_ARITY;\n  using namespace boost;\n  if (!param.empty())\n    MAX=lexical_cast<unsigned>(param);\n  for (unsigned i = 0; i <= MAX; ++i) {\n    WordID fid=FD::Convert(fname+lexical_cast<string>(i));\n    fids_.push_back(fid);\n  }\n  while (!fids_.empty() && fids_.back()==0) fids_.pop_back(); \/\/ pretty up features vector in case FD was frozen.  doesn't change anything\n}\n\nFeatureFunction::Features ArityPenalty::features() const {\n  return Features(fids_.begin(),fids_.end());\n}\n\nvoid ArityPenalty::TraversalFeaturesImpl(const SentenceMetadata& smeta,\n                                         const Hypergraph::Edge& edge,\n                                         const std::vector<const void*>& ant_states,\n                                         SparseVector<double>* features,\n                                         SparseVector<double>* estimated_features,\n                                         void* state) const {\n  (void) smeta;\n  (void) ant_states;\n  (void) state;\n  (void) estimated_features;\n  unsigned a=edge.Arity();\n  features->set_value(a<fids_.size()?fids_[a]:0, value_);\n}\n\nModelSet::ModelSet(const vector<double>& w, const vector<const FeatureFunction*>& models) :\n    models_(models),\n    weights_(w),\n    state_size_(0),\n    model_state_pos_(models.size()) {\n  for (int i = 0; i < models_.size(); ++i) {\n    model_state_pos_[i] = state_size_;\n    state_size_ += models_[i]->NumBytesContext();\n  }\n}\n\nvoid ModelSet::AddFeaturesToEdge(const SentenceMetadata& smeta,\n                                 const Hypergraph& \/* hg *\/,\n                                 const vector<string>& node_states,\n                                 Hypergraph::Edge* edge,\n                                 string* context,\n                                 prob_t* combination_cost_estimate) const {\n  context->resize(state_size_);\n  memset(&(*context)[0], 0, state_size_);\n  SparseVector<double> est_vals;  \/\/ only computed if combination_cost_estimate is non-NULL\n  if (combination_cost_estimate) *combination_cost_estimate = prob_t::One();\n  for (int i = 0; i < models_.size(); ++i) {\n    const FeatureFunction& ff = *models_[i];\n    void* cur_ff_context = NULL;\n    vector<const void*> ants(edge->tail_nodes_.size());\n    bool has_context = ff.NumBytesContext() > 0;\n    if (has_context) {\n      int spos = model_state_pos_[i];\n      cur_ff_context = &(*context)[spos];\n      for (int i = 0; i < ants.size(); ++i) {\n        ants[i] = &node_states[edge->tail_nodes_[i]][spos];\n      }\n    }\n    ff.TraversalFeatures(smeta, *edge, ants, &edge->feature_values_, &est_vals, cur_ff_context);\n  }\n  if (combination_cost_estimate)\n    combination_cost_estimate->logeq(est_vals.dot(weights_));\n  edge->edge_prob_.logeq(edge->feature_values_.dot(weights_));\n}\n\nvoid ModelSet::AddFinalFeatures(const std::string& state, Hypergraph::Edge* edge) const {\n  assert(1 == edge->rule_->Arity());\n\n  for (int i = 0; i < models_.size(); ++i) {\n    const FeatureFunction& ff = *models_[i];\n    const void* ant_state = NULL;\n    bool has_context = ff.NumBytesContext() > 0;\n    if (has_context) {\n      int spos = model_state_pos_[i];\n      ant_state = &state[spos];\n    }\n    ff.FinalTraversalFeatures(ant_state, &edge->feature_values_);\n  }\n  edge->edge_prob_.logeq(edge->feature_values_.dot(weights_));\n}\n\n<commit_msg>warn 0 fid if warn 0 wt<commit_after>\/\/TODO: 0 size state != rule-local feature, i.e. still may depend on source span loc\/context.  identify truly rule-local features so if we want they can be added to grammar rules (minor speedup)\n\n#include <boost\/lexical_cast.hpp>\n#include \"ff.h\"\n\n#include \"tdict.h\"\n#include \"hg.h\"\n\nusing namespace std;\n\nFeatureFunction::~FeatureFunction() {}\n\n\nvoid FeatureFunction::FinalTraversalFeatures(const void* ant_state,\n                                             SparseVector<double>* features) const {\n  (void) ant_state;\n  (void) features;\n}\n\nstring FeatureFunction::usage_helper(std::string const& name,std::string const& params,std::string const& details,bool sp,bool sd) {\n  string r=name;\n  if (sp) {\n    r+=\": \";\n    r+=params;\n  }\n  if (sd) {\n    r+=\"\\n\";\n    r+=details;\n  }\n  return r;\n}\n\nFeatureFunction::Features FeatureFunction::single_feature(WordID feat) {\n  return Features(1,feat);\n}\n\nFeatureFunction::Features ModelSet::all_features(std::ostream *warn,bool warn0) {\n  typedef FeatureFunction::Features FFS;\n  FFS ffs;\n#define WARNFF(x) do { if (warn) { *warn << \"WARNING: \"<< x ; *warn<<endl; } } while(0)\n  typedef std::map<WordID,string> FFM;\n  FFM ff_from;\n  for (unsigned i=0;i<models_.size();++i) {\n    FeatureFunction const& ff=*models_[i];\n    string const& ffname=ff.name;\n    FFS si=ff.features();\n    if (si.empty()) {\n      WARNFF(ffname<<\" doesn't yet report any feature IDs - implement features() method?\");\n    }\n    unsigned n0=0;\n    for (unsigned j=0;j<si.size();++j) {\n      WordID fid=si[j];\n      if (!fid) ++n0;\n      if (fid >= weights_.size())\n        weights_.resize(fid+1);\n      if (warn0 || fid) {\n        pair<FFM::iterator,bool> i_new=ff_from.insert(FFM::value_type(fid,ffname));\n        if (i_new.second) {\n          if (fid)\n            ffs.push_back(fid);\n          else\n            WARNFF(\"Feature id 0 for \"<<ffname<<\" (models[\"<<i<<\"]) - probably no weight provided.  Don't freeze feature ids to see the name\");\n        } else {\n          WARNFF(ffname<<\" (models[\"<<i<<\"]) tried to define feature \"<<FD::Convert(fid)<<\" already defined earlier by \"<<i_new.first->second);\n        }\n      }\n    }\n    if (n0)\n      WARNFF(ffname<<\" (models[\"<<i<<\"]) had \"<<n0<<\" unused features (--no_freeze_feature_set to see them)\");\n  }\n  return ffs;\n#undef WARNFF\n}\n\nvoid ModelSet::show_features(std::ostream &out,std::ostream &warn,bool warn_zero_wt)\n{\n  typedef FeatureFunction::Features FFS;\n  FFS ffs=all_features(&warn,warn_zero_wt);\n  out << \"Weight  Feature\\n\";\n  for (unsigned i=0;i<ffs.size();++i) {\n    WordID fid=ffs[i];\n    string const& fname=FD::Convert(fid);\n    double wt=weights_[fid];\n    if (warn_zero_wt && wt==0)\n      warn<<\"WARNING: \"<<fname<<\" has 0 weight.\"<<endl;\n    out << wt << \"  \" << fname<<endl;\n  }\n\n}\n\n\/\/ Hiero and Joshua use log_10(e) as the value, so I do to\nWordPenalty::WordPenalty(const string& param) :\n    fid_(FD::Convert(\"WordPenalty\")),\n    value_(-1.0 \/ log(10)) {\n  if (!param.empty()) {\n    cerr << \"Warning WordPenalty ignoring parameter: \" << param << endl;\n  }\n}\n\nvoid WordPenalty::TraversalFeaturesImpl(const SentenceMetadata& smeta,\n                                        const Hypergraph::Edge& edge,\n                                        const std::vector<const void*>& ant_states,\n                                        SparseVector<double>* features,\n                                        SparseVector<double>* estimated_features,\n                                        void* state) const {\n  (void) smeta;\n  (void) ant_states;\n  (void) state;\n  (void) estimated_features;\n  features->set_value(fid_, edge.rule_->EWords() * value_);\n}\n\nSourceWordPenalty::SourceWordPenalty(const string& param) :\n    fid_(FD::Convert(\"SourceWordPenalty\")),\n    value_(-1.0 \/ log(10)) {\n  if (!param.empty()) {\n    cerr << \"Warning SourceWordPenalty ignoring parameter: \" << param << endl;\n  }\n}\n\nFeatureFunction::Features SourceWordPenalty::features() const {\n  return single_feature(fid_);\n}\n\nFeatureFunction::Features WordPenalty::features() const {\n  return single_feature(fid_);\n}\n\n\nvoid SourceWordPenalty::TraversalFeaturesImpl(const SentenceMetadata& smeta,\n                                        const Hypergraph::Edge& edge,\n                                        const std::vector<const void*>& ant_states,\n                                        SparseVector<double>* features,\n                                        SparseVector<double>* estimated_features,\n                                        void* state) const {\n  (void) smeta;\n  (void) ant_states;\n  (void) state;\n  (void) estimated_features;\n  features->set_value(fid_, edge.rule_->FWords() * value_);\n}\n\nArityPenalty::ArityPenalty(const std::string& param) :\n    value_(-1.0 \/ log(10)) {\n  string fname = \"Arity_\";\n  unsigned MAX=DEFAULT_MAX_ARITY;\n  using namespace boost;\n  if (!param.empty())\n    MAX=lexical_cast<unsigned>(param);\n  for (unsigned i = 0; i <= MAX; ++i) {\n    WordID fid=FD::Convert(fname+lexical_cast<string>(i));\n    fids_.push_back(fid);\n  }\n  while (!fids_.empty() && fids_.back()==0) fids_.pop_back(); \/\/ pretty up features vector in case FD was frozen.  doesn't change anything\n}\n\nFeatureFunction::Features ArityPenalty::features() const {\n  return Features(fids_.begin(),fids_.end());\n}\n\nvoid ArityPenalty::TraversalFeaturesImpl(const SentenceMetadata& smeta,\n                                         const Hypergraph::Edge& edge,\n                                         const std::vector<const void*>& ant_states,\n                                         SparseVector<double>* features,\n                                         SparseVector<double>* estimated_features,\n                                         void* state) const {\n  (void) smeta;\n  (void) ant_states;\n  (void) state;\n  (void) estimated_features;\n  unsigned a=edge.Arity();\n  features->set_value(a<fids_.size()?fids_[a]:0, value_);\n}\n\nModelSet::ModelSet(const vector<double>& w, const vector<const FeatureFunction*>& models) :\n    models_(models),\n    weights_(w),\n    state_size_(0),\n    model_state_pos_(models.size()) {\n  for (int i = 0; i < models_.size(); ++i) {\n    model_state_pos_[i] = state_size_;\n    state_size_ += models_[i]->NumBytesContext();\n  }\n}\n\nvoid ModelSet::AddFeaturesToEdge(const SentenceMetadata& smeta,\n                                 const Hypergraph& \/* hg *\/,\n                                 const vector<string>& node_states,\n                                 Hypergraph::Edge* edge,\n                                 string* context,\n                                 prob_t* combination_cost_estimate) const {\n  context->resize(state_size_);\n  memset(&(*context)[0], 0, state_size_);\n  SparseVector<double> est_vals;  \/\/ only computed if combination_cost_estimate is non-NULL\n  if (combination_cost_estimate) *combination_cost_estimate = prob_t::One();\n  for (int i = 0; i < models_.size(); ++i) {\n    const FeatureFunction& ff = *models_[i];\n    void* cur_ff_context = NULL;\n    vector<const void*> ants(edge->tail_nodes_.size());\n    bool has_context = ff.NumBytesContext() > 0;\n    if (has_context) {\n      int spos = model_state_pos_[i];\n      cur_ff_context = &(*context)[spos];\n      for (int i = 0; i < ants.size(); ++i) {\n        ants[i] = &node_states[edge->tail_nodes_[i]][spos];\n      }\n    }\n    ff.TraversalFeatures(smeta, *edge, ants, &edge->feature_values_, &est_vals, cur_ff_context);\n  }\n  if (combination_cost_estimate)\n    combination_cost_estimate->logeq(est_vals.dot(weights_));\n  edge->edge_prob_.logeq(edge->feature_values_.dot(weights_));\n}\n\nvoid ModelSet::AddFinalFeatures(const std::string& state, Hypergraph::Edge* edge) const {\n  assert(1 == edge->rule_->Arity());\n\n  for (int i = 0; i < models_.size(); ++i) {\n    const FeatureFunction& ff = *models_[i];\n    const void* ant_state = NULL;\n    bool has_context = ff.NumBytesContext() > 0;\n    if (has_context) {\n      int spos = model_state_pos_[i];\n      ant_state = &state[spos];\n    }\n    ff.FinalTraversalFeatures(ant_state, &edge->feature_values_);\n  }\n  edge->edge_prob_.logeq(edge->feature_values_.dot(weights_));\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2005-2019 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 \"otbConfigurationManager.h\"\n\n#include \"otbMacro.h\"\n#include \"otbLogger.h\"\n\n#include \"itkMultiThreader.h\"\n#include \"itksys\/SystemTools.hxx\"\n\n#ifdef _OPENMP\n#include <omp.h>\n#endif\n\n#include <cstdlib>\n#include <algorithm>\n#include <string>\n\nnamespace otb\n{\n\nstd::string ConfigurationManager::GetDEMDirectory()\n{\n  std::string svalue;\n  itksys::SystemTools::GetEnv(\"OTB_DEM_DIRECTORY\",svalue);\n  return svalue;\n}\n\nstd::string ConfigurationManager::GetGeoidFile()\n{\n  std::string svalue;\n  itksys::SystemTools::GetEnv(\"OTB_GEOID_FILE\",svalue);\n  return svalue;\n}\n\nConfigurationManager::RAMValueType ConfigurationManager::GetMaxRAMHint()\n{\n  std::string max_ram_hint;\n  if (itksys::SystemTools::GetEnv(\"OTB_MAX_RAM_HINT\", max_ram_hint))\n  {\n    return std::stoul(max_ram_hint);\n  }\n  else\n  {\n    \/\/ Default value\n    return 256;\n  }\n}\n\nitk::LoggerBase::PriorityLevelType ConfigurationManager::GetLoggerLevel()\n{\n  std::string svalue;\n\n  \/\/ Default value is INFO\n  itk::LoggerBase::PriorityLevelType level = itk::LoggerBase::INFO;\n  \n  if(itksys::SystemTools::GetEnv(\"OTB_LOGGER_LEVEL\",svalue))\n    {\n    if(svalue.compare(\"DEBUG\") == 0)\n      {\n      level = itk::LoggerBase::DEBUG;\n      }\n    else if(svalue.compare(\"INFO\") == 0)\n      {\n      level = itk::LoggerBase::INFO;\n      }\n    else if(svalue.compare(\"WARNING\") == 0)\n      {\n      level = itk::LoggerBase::WARNING;\n      }\n    else if(svalue.compare(\"CRITICAL\") == 0)\n      {\n      level = itk::LoggerBase::CRITICAL;\n      }\n    else\n      {\n      otbLogMacro(Error,<<\"Unknown value for OTB_LOGGER_LEVEL_MACRO. Possible values are DEBUG, INFO, WARNING, CRITICAL.\");\n      }\n    }\n  return level;\n}\n\nint ConfigurationManager::InitOpenMPThreads()\n{\n  int ret = 1;\n#ifdef _OPENMP\n  ret = itk::MultiThreader::GetGlobalDefaultNumberOfThreads();\n  omp_set_num_threads(ret);\n#endif\n  return ret;\n}\n\n}\n<commit_msg>ENH: allow setting on windows with \"\"<commit_after>\/*\n * Copyright (C) 2005-2019 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 \"otbConfigurationManager.h\"\n\n#include \"otbMacro.h\"\n#include \"otbLogger.h\"\n\n#include \"itkMultiThreader.h\"\n#include \"itksys\/SystemTools.hxx\"\n\n#ifdef _OPENMP\n#include <omp.h>\n#endif\n\n#include <cstdlib>\n#include <algorithm>\n#include <string>\n\nnamespace otb\n{\n\nstd::string ConfigurationManager::GetDEMDirectory()\n{\n  std::string svalue;\n  itksys::SystemTools::GetEnv(\"OTB_DEM_DIRECTORY\",svalue);\n  return svalue;\n}\n\nstd::string ConfigurationManager::GetGeoidFile()\n{\n  std::string svalue;\n  itksys::SystemTools::GetEnv(\"OTB_GEOID_FILE\",svalue);\n  return svalue;\n}\n\nConfigurationManager::RAMValueType ConfigurationManager::GetMaxRAMHint()\n{\n  std::string max_ram_hint;\n  if (itksys::SystemTools::GetEnv(\"OTB_MAX_RAM_HINT\", max_ram_hint))\n  {\n    return std::stoul(max_ram_hint);\n  }\n  else\n  {\n    \/\/ Default value\n    return 256;\n  }\n}\n\nitk::LoggerBase::PriorityLevelType ConfigurationManager::GetLoggerLevel()\n{\n  std::string svalue;\n\n  \/\/ Default value is INFO\n  itk::LoggerBase::PriorityLevelType level = itk::LoggerBase::INFO;\n  itksys::SystemTools::GetEnv(\"OTB_LOGGER_LEVEL\",svalue);\n  \/\/ on windows a variable set with set EX=\"\" will keep the \"\". We need\n  \/\/ to remove them.\n  svalue = svalue.substr( svalue.find_first_not_of(\"\\\"\") , \n                          svalue.find_last_not_of(\"\\\"\"));\n\n  if( !svalue.empty() )\n    {\n    if(svalue.compare(\"DEBUG\") == 0)\n      {\n      level = itk::LoggerBase::DEBUG;\n      }\n    else if(svalue.compare(\"INFO\") == 0)\n      {\n      level = itk::LoggerBase::INFO;\n      }\n    else if(svalue.compare(\"WARNING\") == 0)\n      {\n      level = itk::LoggerBase::WARNING;\n      }\n    else if(svalue.compare(\"CRITICAL\") == 0)\n      {\n      level = itk::LoggerBase::CRITICAL;\n      }\n    else\n      {\n      otbLogMacro(Warning,<<\"Unknown value for OTB_LOGGER_LEVEL_MACRO (\"\n        <<svalue<<\"). Possible values are DEBUG, INFO, WARNING, CRITICAL. \"\n        <<\"Level set to INFO.\");\n      }\n    }\n  return level;\n}\n\nint ConfigurationManager::InitOpenMPThreads()\n{\n  int ret = 1;\n#ifdef _OPENMP\n  ret = itk::MultiThreader::GetGlobalDefaultNumberOfThreads();\n  omp_set_num_threads(ret);\n#endif\n  return ret;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n This file is part of MMOServer. For more information, visit http:\/\/swganh.com\n \n Copyright (c) 2006 - 2010 The SWG:ANH Team\n\n MMOServer 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 MMOServer is distributed in the hope that it 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 MMOServer.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"anh\/service\/datastore.h\"\n\n#include <memory>\n#include <sstream>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <glog\/logging.h>\n\n#include <cppconn\/exception.h>\n#include <cppconn\/connection.h>\n#include <cppconn\/prepared_statement.h>\n#include <cppconn\/resultset.h>\n\n#include \"anh\/service\/service_description.h\"\n\nusing namespace anh::service;\nusing namespace boost::posix_time;\nusing namespace std;\n\nDatastore::Datastore(shared_ptr<sql::Connection> connection) \n    : connection_(connection)\n{}\n\nDatastore::~Datastore() {}\n\nstd::shared_ptr<Galaxy> Datastore::findGalaxyByName(const std::string& name) const {\n    shared_ptr<Galaxy> galaxy = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"SELECT * FROM galaxy \"\n            \"WHERE name = ? LIMIT 1\"));\n\n        statement->setString(1, name);\n\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n\n        \/\/ if no results are found return a nullptr\n        if (!result->next()) {\n            return nullptr;\n        }\n\n        galaxy = make_shared<Galaxy>(\n            result->getUInt(\"id\"),\n            result->getUInt(\"primary_id\"),\n            result->getString(\"name\"),\n            result->getString(\"version\"),\n            static_cast<Galaxy::StatusType>(result->getInt(\"status\")),\n            result->getString(\"created_at\"),\n            result->getString(\"updated_at\"));\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return galaxy;\n}\n\nstd::shared_ptr<Galaxy> Datastore::createGalaxy(\n    const std::string& name,\n    const std::string& version) const \n{\n    shared_ptr<Galaxy> galaxy = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"INSERT INTO galaxy(name, version, created_at, status, updated_at) \"\n            \"VALUES(?, ?, ?, NOW(), NOW())\"));\n\n        statement->setString(1, name);\n        statement->setString(2, version);\n        statement->setInt(3, 0);\n\n        \/\/ if the statement fails to service return a nullptr\n        if (statement->executeUpdate() <= 0) {\n            return nullptr;\n        }\n\n        statement.reset(connection_->prepareStatement(\n            \"SELECT * FROM galaxy WHERE id = LAST_INSERT_ID()\"));\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n\n        if (!result->next()) {\n            return nullptr;\n        }\n\n        galaxy = make_shared<Galaxy>(\n            result->getUInt(\"id\"),\n            result->getUInt(\"primary_id\"),\n            result->getString(\"name\"),    \n            result->getString(\"version\"),\n            static_cast<Galaxy::StatusType>(result->getInt(\"status\")),\n            result->getString(\"created_at\"),\n            result->getString(\"updated_at\"));\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return galaxy;\n}\nvoid Datastore::saveGalaxyStatus(int32_t galaxy_id, int32_t status) const\n{\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"update galaxy set status = ? \"\n            \"where id = ?\"));\n\n        statement->setInt(1, status);\n        statement->setInt(2, galaxy_id);\n\n        statement->executeUpdate();\n\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n}\n\nstd::shared_ptr<ServiceDescription> Datastore::createService(const Galaxy& galaxy, const std::string& name, const std::string& type, const std::string& version, const std::string& address, uint16_t tcp_port, uint16_t udp_port, uint16_t ping_port) const {\n    shared_ptr<ServiceDescription> service = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"INSERT INTO service (galaxy_id, \"\n                                 \"name, \"\n                                 \"type, \"\n                                 \"version, \"\n                                 \"address, \"\n                                 \"tcp_port, \"\n                                 \"udp_port, \"\n                                 \"ping_port, \"\n                                 \"status, \"\n                                 \"last_pulse, \"\n                                 \"created_at, \"\n                                 \"updated_at) \"\n            \"VALUES(?, ?, ?, ?, INET_ATON(?), ?, ?, ?, ?, NOW(), NOW(), NOW())\"));\n        \n        uint32_t galaxy_id = galaxy.id();\n\n        statement->setInt(1, galaxy_id);\n        statement->setString(2, name);\n        statement->setString(3, type);\n        statement->setString(4, version);\n        statement->setString(5, address);\n        statement->setUInt(6, static_cast<uint32_t>(tcp_port));\n        statement->setUInt(7, static_cast<uint32_t>(udp_port));\n        statement->setUInt(8, static_cast<uint32_t>(ping_port));\n        statement->setInt(9, static_cast<int32_t>(-1));\n        \n        if (! (statement->executeUpdate() > 0)) {\n            return nullptr;\n        }\n        \n        statement.reset(connection_->prepareStatement(\n            \"SELECT id, galaxy_id, name, type, version, INET_NTOA(address) as address_string, tcp_port, udp_port, ping_port, status, CONVERT(TIMESTAMP(last_pulse), CHAR) as last_pulse_timestamp \"\n            \"FROM service WHERE id = LAST_INSERT_ID()\"));\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n        \n        if (!result->next()) {\n            return nullptr;\n        }\n    \n        service = make_shared<ServiceDescription>(\n            result->getUInt(\"id\"),\n            result->getUInt(\"galaxy_id\"),\n            result->getString(\"name\"),\n            result->getString(\"type\"),\n            result->getString(\"version\"),\n            result->getString(\"address_string\"),\n            result->getUInt(\"tcp_port\"),\n            result->getUInt(\"udp_port\"),\n            result->getUInt(\"ping_port\")\n            );\n        \n        service->status(result->getInt(\"status\"));\n        service->last_pulse(result->getString(\"last_pulse_timestamp\"));\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return service;\n}\n\nvoid Datastore::saveService(const ServiceDescription& service) const {\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"UPDATE service SET address = INET_ATON(?), tcp_port = ?, udp_port = ?, ping_port = ?, status = ?, last_pulse = ? WHERE id = ?\"));\n        \n        statement->setString(1, service.address());\n        statement->setUInt(2, service.tcp_port());\n        statement->setUInt(3, service.udp_port());\n        statement->setUInt(4, service.ping_port());\n        statement->setInt(5, service.status());\n        statement->setString(6, prepareTimestampForStorage(service.last_pulse()));\n        statement->setUInt(7, service.id());\n        statement->executeUpdate();\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n}\n\nstd::shared_ptr<Galaxy> Datastore::findGalaxyById(uint32_t id) const {\n    std::shared_ptr<Galaxy> galaxy = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"SELECT * FROM galaxy \"\n            \"WHERE id = ? LIMIT 1\"));\n\n        statement->setUInt(1, id);\n\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n\n        \/\/ if the statement fails to service return a nullptr\n        if (!result->next()) {\n            return nullptr;\n        }\n\n        galaxy = make_shared<Galaxy>(\n            result->getUInt(\"id\"),\n            result->getUInt(\"primary_id\"),\n            result->getString(\"name\"),\n            result->getString(\"version\"),\n            static_cast<Galaxy::StatusType>(result->getInt(\"status\")),\n            result->getString(\"created_at\"),\n            result->getString(\"updated_at\"));\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return galaxy;\n}\n\nstd::shared_ptr<ServiceDescription> Datastore::findServiceById(uint32_t id) const {\n    shared_ptr<ServiceDescription> service = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"SELECT * FROM service \"\n            \"WHERE id = ? LIMIT 1\"));\n\n        statement->setUInt(1, id);\n\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n\n        \/\/ if the statement fails to service return a nullptr\n        if (result->next()) {                \n            service = make_shared<ServiceDescription>(\n                result->getUInt(\"id\"),\n                result->getUInt(\"galaxy_id\"),\n                result->getString(\"name\"),\n                result->getString(\"type\"),\n                result->getString(\"version\"),\n                result->getString(\"address_string\"),\n                result->getUInt(\"tcp_port\"),\n                result->getUInt(\"udp_port\"),\n                result->getUInt(\"ping_port\")\n                );\n\n            service->status(result->getInt(\"status\"));\n            service->last_pulse(result->getString(\"last_pulse_timestamp\"));\n        }\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return service;\n}\n\nbool Datastore::deleteServiceById(uint32_t id) const {\n    bool deleted = false;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"DELETE FROM service WHERE id = ? \"\n        ));\n\n        statement->setUInt(1, id);\n\n        deleted = statement->executeUpdate() > 0;\n\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return deleted;\n}\n\nlist<Galaxy> Datastore::getGalaxyList() const {\n    std::list<Galaxy> galaxy_list;\n    \n    try {\n        std::unique_ptr<sql::Statement> statement(connection_->createStatement());\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery(\n            \"SELECT * FROM galaxy ORDER BY galaxy.name\"));\n\n        \/\/ Loop through the results and create a map entry for each.\n        while (result->next()) {\n            galaxy_list.push_back(Galaxy(\n                result->getUInt(\"id\"),\n                result->getUInt(\"primary_id\"),\n                result->getString(\"name\"),\n                result->getString(\"version\"),\n                static_cast<Galaxy::StatusType>(result->getInt(\"status\")),\n                result->getString(\"created_at\"),\n                result->getString(\"updated_at\")));\n        }\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return galaxy_list;\n}\n\nlist<ServiceDescription> Datastore::getServiceList(uint32_t galaxy_id) const { \n    std::list<ServiceDescription> service_list;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"SELECT id, galaxy_id, name, type, version, address, tcp_port, udp_port, ping_port, status, TIMESTAMP(last_pulse) as last_pulse_timestamp \"\n            \"FROM service WHERE galaxy_id = ? ORDER BY service.type\"));\n\n        statement->setUInt(1, galaxy_id);\n        \n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n                   \n        \/\/ Loop through the results and create a map entry for each.\n        while (result->next()) {\n            ServiceDescription service(\n                result->getUInt(\"id\"),\n                result->getUInt(\"galaxy_id\"),\n                result->getString(\"name\"),\n                result->getString(\"type\"),\n                result->getString(\"version\"),\n                result->getString(\"address\"),\n                result->getUInt(\"tcp_port\"),\n                result->getUInt(\"udp_port\"),\n                result->getUInt(\"ping_port\"));\n            service.status(result->getInt(\"status\"));\n            service.last_pulse(result->getString(\"last_pulse_timestamp\"));\n            \n            service_list.push_back(move(service));\n        }\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return service_list;\n}\n\nstd::string Datastore::prepareTimestampForStorage(const std::string& timestamp) const {    \n    std::stringstream ss;\n    \n    boost::posix_time::time_facet* facet = new boost::posix_time::time_facet(\"%Y%m%d%H%M%S%F\");    \n    ss.imbue(std::locale(ss.getloc(), facet));\n    \n    ss << boost::posix_time::time_from_string(timestamp);\n    \n    return ss.str();\n}\n<commit_msg>fixed error in last pull request.<commit_after>\/*\n This file is part of MMOServer. For more information, visit http:\/\/swganh.com\n \n Copyright (c) 2006 - 2010 The SWG:ANH Team\n\n MMOServer 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 MMOServer is distributed in the hope that it 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 MMOServer.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"anh\/service\/datastore.h\"\n\n#include <memory>\n#include <sstream>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <glog\/logging.h>\n\n#include <cppconn\/exception.h>\n#include <cppconn\/connection.h>\n#include <cppconn\/prepared_statement.h>\n#include <cppconn\/resultset.h>\n\n#include \"anh\/service\/service_description.h\"\n\nusing namespace anh::service;\nusing namespace boost::posix_time;\nusing namespace std;\n\nDatastore::Datastore(shared_ptr<sql::Connection> connection) \n    : connection_(connection)\n{}\n\nDatastore::~Datastore() {}\n\nstd::shared_ptr<Galaxy> Datastore::findGalaxyByName(const std::string& name) const {\n    shared_ptr<Galaxy> galaxy = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"SELECT * FROM galaxy \"\n            \"WHERE name = ? LIMIT 1\"));\n\n        statement->setString(1, name);\n\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n\n        \/\/ if no results are found return a nullptr\n        if (!result->next()) {\n            return nullptr;\n        }\n\n        galaxy = make_shared<Galaxy>(\n            result->getUInt(\"id\"),\n            result->getUInt(\"primary_id\"),\n            result->getString(\"name\"),\n            result->getString(\"version\"),\n            static_cast<Galaxy::StatusType>(result->getInt(\"status\")),\n            result->getString(\"created_at\"),\n            result->getString(\"updated_at\"));\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return galaxy;\n}\n\nstd::shared_ptr<Galaxy> Datastore::createGalaxy(\n    const std::string& name,\n    const std::string& version) const \n{\n    shared_ptr<Galaxy> galaxy = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"INSERT INTO galaxy(name, version, status, created_at, updated_at) \"\n            \"VALUES(?, ?, ?, NOW(), NOW())\"));\n\n        statement->setString(1, name);\n        statement->setString(2, version);\n        statement->setInt(3, 0);\n\n        \/\/ if the statement fails to service return a nullptr\n        if (statement->executeUpdate() <= 0) {\n            return nullptr;\n        }\n\n        statement.reset(connection_->prepareStatement(\n            \"SELECT * FROM galaxy WHERE id = LAST_INSERT_ID()\"));\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n\n        if (!result->next()) {\n            return nullptr;\n        }\n\n        galaxy = make_shared<Galaxy>(\n            result->getUInt(\"id\"),\n            result->getUInt(\"primary_id\"),\n            result->getString(\"name\"),    \n            result->getString(\"version\"),\n            static_cast<Galaxy::StatusType>(result->getInt(\"status\")),\n            result->getString(\"created_at\"),\n            result->getString(\"updated_at\"));\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return galaxy;\n}\nvoid Datastore::saveGalaxyStatus(int32_t galaxy_id, int32_t status) const\n{\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"update galaxy set status = ? \"\n            \"where id = ?\"));\n\n        statement->setInt(1, status);\n        statement->setInt(2, galaxy_id);\n\n        statement->executeUpdate();\n\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n}\n\nstd::shared_ptr<ServiceDescription> Datastore::createService(const Galaxy& galaxy, const std::string& name, const std::string& type, const std::string& version, const std::string& address, uint16_t tcp_port, uint16_t udp_port, uint16_t ping_port) const {\n    shared_ptr<ServiceDescription> service = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"INSERT INTO service (galaxy_id, \"\n                                 \"name, \"\n                                 \"type, \"\n                                 \"version, \"\n                                 \"address, \"\n                                 \"tcp_port, \"\n                                 \"udp_port, \"\n                                 \"ping_port, \"\n                                 \"status, \"\n                                 \"last_pulse, \"\n                                 \"created_at, \"\n                                 \"updated_at) \"\n            \"VALUES(?, ?, ?, ?, INET_ATON(?), ?, ?, ?, ?, NOW(), NOW(), NOW())\"));\n        \n        uint32_t galaxy_id = galaxy.id();\n\n        statement->setInt(1, galaxy_id);\n        statement->setString(2, name);\n        statement->setString(3, type);\n        statement->setString(4, version);\n        statement->setString(5, address);\n        statement->setUInt(6, static_cast<uint32_t>(tcp_port));\n        statement->setUInt(7, static_cast<uint32_t>(udp_port));\n        statement->setUInt(8, static_cast<uint32_t>(ping_port));\n        statement->setInt(9, static_cast<int32_t>(-1));\n        \n        if (! (statement->executeUpdate() > 0)) {\n            return nullptr;\n        }\n        \n        statement.reset(connection_->prepareStatement(\n            \"SELECT id, galaxy_id, name, type, version, INET_NTOA(address) as address_string, tcp_port, udp_port, ping_port, status, CONVERT(TIMESTAMP(last_pulse), CHAR) as last_pulse_timestamp \"\n            \"FROM service WHERE id = LAST_INSERT_ID()\"));\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n        \n        if (!result->next()) {\n            return nullptr;\n        }\n    \n        service = make_shared<ServiceDescription>(\n            result->getUInt(\"id\"),\n            result->getUInt(\"galaxy_id\"),\n            result->getString(\"name\"),\n            result->getString(\"type\"),\n            result->getString(\"version\"),\n            result->getString(\"address_string\"),\n            result->getUInt(\"tcp_port\"),\n            result->getUInt(\"udp_port\"),\n            result->getUInt(\"ping_port\")\n            );\n        \n        service->status(result->getInt(\"status\"));\n        service->last_pulse(result->getString(\"last_pulse_timestamp\"));\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return service;\n}\n\nvoid Datastore::saveService(const ServiceDescription& service) const {\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"UPDATE service SET address = INET_ATON(?), tcp_port = ?, udp_port = ?, ping_port = ?, status = ?, last_pulse = ? WHERE id = ?\"));\n        \n        statement->setString(1, service.address());\n        statement->setUInt(2, service.tcp_port());\n        statement->setUInt(3, service.udp_port());\n        statement->setUInt(4, service.ping_port());\n        statement->setInt(5, service.status());\n        statement->setString(6, prepareTimestampForStorage(service.last_pulse()));\n        statement->setUInt(7, service.id());\n        statement->executeUpdate();\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n}\n\nstd::shared_ptr<Galaxy> Datastore::findGalaxyById(uint32_t id) const {\n    std::shared_ptr<Galaxy> galaxy = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"SELECT * FROM galaxy \"\n            \"WHERE id = ? LIMIT 1\"));\n\n        statement->setUInt(1, id);\n\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n\n        \/\/ if the statement fails to service return a nullptr\n        if (!result->next()) {\n            return nullptr;\n        }\n\n        galaxy = make_shared<Galaxy>(\n            result->getUInt(\"id\"),\n            result->getUInt(\"primary_id\"),\n            result->getString(\"name\"),\n            result->getString(\"version\"),\n            static_cast<Galaxy::StatusType>(result->getInt(\"status\")),\n            result->getString(\"created_at\"),\n            result->getString(\"updated_at\"));\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return galaxy;\n}\n\nstd::shared_ptr<ServiceDescription> Datastore::findServiceById(uint32_t id) const {\n    shared_ptr<ServiceDescription> service = nullptr;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"SELECT * FROM service \"\n            \"WHERE id = ? LIMIT 1\"));\n\n        statement->setUInt(1, id);\n\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n\n        \/\/ if the statement fails to service return a nullptr\n        if (result->next()) {                \n            service = make_shared<ServiceDescription>(\n                result->getUInt(\"id\"),\n                result->getUInt(\"galaxy_id\"),\n                result->getString(\"name\"),\n                result->getString(\"type\"),\n                result->getString(\"version\"),\n                result->getString(\"address_string\"),\n                result->getUInt(\"tcp_port\"),\n                result->getUInt(\"udp_port\"),\n                result->getUInt(\"ping_port\")\n                );\n\n            service->status(result->getInt(\"status\"));\n            service->last_pulse(result->getString(\"last_pulse_timestamp\"));\n        }\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return service;\n}\n\nbool Datastore::deleteServiceById(uint32_t id) const {\n    bool deleted = false;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"DELETE FROM service WHERE id = ? \"\n        ));\n\n        statement->setUInt(1, id);\n\n        deleted = statement->executeUpdate() > 0;\n\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return deleted;\n}\n\nlist<Galaxy> Datastore::getGalaxyList() const {\n    std::list<Galaxy> galaxy_list;\n    \n    try {\n        std::unique_ptr<sql::Statement> statement(connection_->createStatement());\n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery(\n            \"SELECT * FROM galaxy ORDER BY galaxy.name\"));\n\n        \/\/ Loop through the results and create a map entry for each.\n        while (result->next()) {\n            galaxy_list.push_back(Galaxy(\n                result->getUInt(\"id\"),\n                result->getUInt(\"primary_id\"),\n                result->getString(\"name\"),\n                result->getString(\"version\"),\n                static_cast<Galaxy::StatusType>(result->getInt(\"status\")),\n                result->getString(\"created_at\"),\n                result->getString(\"updated_at\")));\n        }\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return galaxy_list;\n}\n\nlist<ServiceDescription> Datastore::getServiceList(uint32_t galaxy_id) const { \n    std::list<ServiceDescription> service_list;\n\n    try {\n        std::unique_ptr<sql::PreparedStatement> statement(connection_->prepareStatement(\n            \"SELECT id, galaxy_id, name, type, version, address, tcp_port, udp_port, ping_port, status, TIMESTAMP(last_pulse) as last_pulse_timestamp \"\n            \"FROM service WHERE galaxy_id = ? ORDER BY service.type\"));\n\n        statement->setUInt(1, galaxy_id);\n        \n        std::unique_ptr<sql::ResultSet> result(statement->executeQuery());\n                   \n        \/\/ Loop through the results and create a map entry for each.\n        while (result->next()) {\n            ServiceDescription service(\n                result->getUInt(\"id\"),\n                result->getUInt(\"galaxy_id\"),\n                result->getString(\"name\"),\n                result->getString(\"type\"),\n                result->getString(\"version\"),\n                result->getString(\"address\"),\n                result->getUInt(\"tcp_port\"),\n                result->getUInt(\"udp_port\"),\n                result->getUInt(\"ping_port\"));\n            service.status(result->getInt(\"status\"));\n            service.last_pulse(result->getString(\"last_pulse_timestamp\"));\n            \n            service_list.push_back(move(service));\n        }\n    } catch(sql::SQLException &e) {\n        DLOG(ERROR) << \"SQLException at \" << __FILE__ << \" (\" << __LINE__ << \": \" << __FUNCTION__ << \")\";\n        DLOG(ERROR) << \"MySQL Error: (\" << e.getErrorCode() << \": \" << e.getSQLState() << \") \" << e.what();\n    }\n\n    return service_list;\n}\n\nstd::string Datastore::prepareTimestampForStorage(const std::string& timestamp) const {    \n    std::stringstream ss;\n    \n    boost::posix_time::time_facet* facet = new boost::posix_time::time_facet(\"%Y%m%d%H%M%S%F\");    \n    ss.imbue(std::locale(ss.getloc(), facet));\n    \n    ss << boost::posix_time::time_from_string(timestamp);\n    \n    return ss.str();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"wandererchunk.h\"\n\n#include <QMutex>\n#include <QImage>\n#include <QColor>\n#include <QGLWidget>\n#include <math.h>\n#include \"..\/lib_paysages\/camera.h\"\n#include \"..\/lib_paysages\/color.h\"\n#include \"..\/lib_paysages\/euclid.h\"\n#include \"..\/lib_paysages\/tools.h\"\n\nWandererChunk::WandererChunk(Renderer* renderer, double x, double z, double size, int nbchunks)\n{\n    _renderer = renderer;\n    \n    _startx = x;\n    _startz = z;\n    _size = size;\n    _overall_step = size * (double)nbchunks;\n    _restart_needed = false;\n    \n    priority = 0.0;\n    \n    _tessellation_max_size = 32;\n    _tessellation = new double[(_tessellation_max_size + 1) * (_tessellation_max_size + 1)];\n    _tessellation_current_size = 0;\n    _tessellation_step = _size \/ (double)_tessellation_max_size;\n    \n    _texture_max_size = 128;\n    _texture_current_size = 0;\n    _texture = new QImage(1, 1, QImage::Format_ARGB32);\n    _texture_id = 0;\n    _texture_changed = false;\n    \n    maintain();\n}\n\nWandererChunk::~WandererChunk()\n{\n    _lock_data.lock();\n    delete _texture;\n    delete [] _tessellation;\n    _lock_data.unlock();\n}\n\nvoid WandererChunk::render(QGLWidget* widget)\n{\n    _lock_data.lock();\n    \n    if (_texture_changed)\n    {\n        _texture_changed = false;\n        if (_texture_id)\n        {\n            widget->deleteTexture(_texture_id);\n        }\n        \/\/ TODO Only do the scale if not power-of-two textures are unsupported by GPU\n        _texture_id = widget->bindTexture(_texture->scaled(_texture_current_size, _texture_current_size, Qt::IgnoreAspectRatio, Qt::SmoothTransformation));\n        \/\/_texture_id = widget->bindTexture(*_texture);\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    else\n    {\n        glBindTexture(GL_TEXTURE_2D, _texture_id);\n    }\n\n    int tessellation_size = _tessellation_current_size;\n    double tsize = 1.0 \/ (double)_tessellation_max_size;\n    \n    _lock_data.unlock();\n    \n    if (tessellation_size == 0)\n    {\n        return;\n    }\n\n    int tessellation_inc = _tessellation_max_size \/ (double)tessellation_size;\n    for (int j = 0; j < _tessellation_max_size; j += tessellation_inc)\n    {\n        glBegin(GL_QUAD_STRIP);\n        for (int i = 0; i <= _tessellation_max_size; i += tessellation_inc)\n        {\n            glTexCoord2d(tsize * (double)i, 1.0 - tsize * (double)j);\n            glVertex3d(_startx + _tessellation_step * (double)i, _tessellation[j * (_tessellation_max_size + 1) + i], _startz + _tessellation_step * (double)j);\n            glTexCoord2d(tsize * (double)i, 1.0 - tsize * (double)(j + tessellation_inc));\n            glVertex3d(_startx + _tessellation_step * (double)i, _tessellation[(j + tessellation_inc) * (_tessellation_max_size + 1) + i], _startz + _tessellation_step * (double)(j + tessellation_inc));\n        }\n        glEnd();\n    }\n}\n\nvoid WandererChunk::updatePriority(CameraDefinition* camera)\n{\n    \/\/ Compute new priority\n    _lock_data.lock();\n    if (camera->location.x > _startx + _overall_step * 0.5)\n    {\n        _startx += _overall_step;\n        _restart_needed = true;\n    }\n    if (camera->location.z > _startz + _overall_step * 0.5)\n    {\n        _startz += _overall_step;\n        _restart_needed = true;\n    }\n    if (camera->location.x < _startx - _overall_step * 0.5)\n    {\n        _startx -= _overall_step;\n        _restart_needed = true;\n    }\n    if (camera->location.z < _startz - _overall_step * 0.5)\n    {\n        _startz -= _overall_step;\n        _restart_needed = true;\n    }\n    \n    if (_restart_needed || _texture_current_size <= 1)\n    {\n        priority = 1000.0;\n    }\n    else if (_tessellation_current_size == _tessellation_max_size && _texture_current_size == _texture_max_size)\n    {\n        priority = -1000.0;\n    }\n    else\n    {\n        double distance, wanted_size;\n        Vector3 center;\n        \n        center = getCenter();\n        \n        distance = v3Norm(v3Sub(camera->location, center));\n        distance = distance < 0.1 ? 0.1 : distance;\n        wanted_size = (int)ceil(120.0 - distance \/ 3.0);\n        \n        priority = wanted_size - _texture_current_size;\n        \/*else if (distance < 30.0 && _texture_current_size < _texture_max_size \/ 8)\n        {\n            priority += 75.0;\n        }\n        else if (distance < 15.0 && _texture_current_size < _texture_max_size)\n        {\n            priority += 50.0;\n        }\n        else if (distance < 30.0 && _texture_current_size < _texture_max_size \/ 2)\n        {\n            priority += 25.0;\n        }*\/\n        \n        if (!cameraIsBoxInView(camera, center, _size, _size, 40.0))\n        {\n            priority -= 100.0;\n        }\n    }\n    _lock_data.unlock();\n}\n\nbool WandererChunk::maintain()\n{\n    if (_restart_needed)\n    {\n        _restart_needed = false;\n\n        _lock_data.lock();\n        _texture_current_size = 0;\n        _tessellation_current_size = 0;\n        _lock_data.unlock();\n    }\n    \n    if (_tessellation_current_size < _tessellation_max_size || _texture_current_size < _texture_max_size)\n    {\n        \/\/ Improve heightmap resolution\n        if (_tessellation_current_size < _tessellation_max_size)\n        {\n            int new_tessellation_size = _tessellation_current_size ? _tessellation_current_size * 4 : 2;\n            int old_tessellation_inc = _tessellation_current_size ? _tessellation_max_size \/ _tessellation_current_size : 1;\n            int new_tessellation_inc = _tessellation_max_size \/ new_tessellation_size;\n            for (int j = 0; j <= _tessellation_max_size; j += new_tessellation_inc)\n            {\n                for (int i = 0; i <= _tessellation_max_size; i += new_tessellation_inc)\n                {\n                    if (_tessellation_current_size == 0 || i % old_tessellation_inc != 0 || j % old_tessellation_inc != 0)\n                    {\n                        double height = _renderer->getTerrainHeight(_renderer, _startx + _tessellation_step * (double)i, _startz + _tessellation_step * (double)j);\n                        _tessellation[j * (_tessellation_max_size + 1) + i] = height;\n                    }\n                }\n            }\n            \n            _lock_data.lock();\n            _tessellation_current_size = new_tessellation_size;\n            _lock_data.unlock();\n        }\n\n        \/\/ Improve texture resolution\n        if (_texture_current_size < _texture_max_size)\n        {\n            int new_texture_size = _texture_current_size ? _texture_current_size * 2 : 1;\n            double step_size = _texture_current_size ? _size \/ (double)(new_texture_size) : 0.1;\n            \/\/QImage* new_image = new QImage(new_texture_size, new_texture_size, QImage::Format_ARGB32);\n            QImage* new_image = new QImage(_texture->scaled(new_texture_size + 1, new_texture_size + 1, Qt::IgnoreAspectRatio, Qt::FastTransformation));\n            for (int j = 0; j <= new_texture_size; j++)\n            {\n                for (int i = 0; i <= new_texture_size; i++)\n                {\n                    if (_texture_current_size <= 1 || i % 2 != 0 || j % 2 != 0)\n                    {\n                        Vector3 location = {_startx + step_size * (double)i, 0.0, _startz + step_size * (double)j};\n                        Color color = _renderer->applyTextures(_renderer, location, step_size);\n                        new_image->setPixel(i, j, colorTo32BitRGBA(&color));\n                    }\n                }\n            }\n            \n            _lock_data.lock();\n            delete _texture;\n            _texture = new_image;\n            _texture_current_size = new_texture_size;\n            _texture_changed = true;\n            _lock_data.unlock();\n        }\n\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nVector3 WandererChunk::getCenter()\n{\n    Vector3 result;\n    \n    result.x = _startx + _size \/ 2.0;\n    result.y = 0.0;\n    result.z = _startz + _size \/ 2.0;\n    \n    return result;\n}\n<commit_msg>paysages : Fixed textures color in 3d explorer.<commit_after>#include \"wandererchunk.h\"\n\n#include <QMutex>\n#include <QImage>\n#include <QColor>\n#include <QGLWidget>\n#include <math.h>\n#include \"..\/lib_paysages\/camera.h\"\n#include \"..\/lib_paysages\/color.h\"\n#include \"..\/lib_paysages\/euclid.h\"\n#include \"..\/lib_paysages\/tools.h\"\n\nWandererChunk::WandererChunk(Renderer* renderer, double x, double z, double size, int nbchunks)\n{\n    _renderer = renderer;\n    \n    _startx = x;\n    _startz = z;\n    _size = size;\n    _overall_step = size * (double)nbchunks;\n    _restart_needed = false;\n    \n    priority = 0.0;\n    \n    _tessellation_max_size = 32;\n    _tessellation = new double[(_tessellation_max_size + 1) * (_tessellation_max_size + 1)];\n    _tessellation_current_size = 0;\n    _tessellation_step = _size \/ (double)_tessellation_max_size;\n    \n    _texture_max_size = 128;\n    _texture_current_size = 0;\n    _texture = new QImage(1, 1, QImage::Format_ARGB32);\n    _texture_id = 0;\n    _texture_changed = false;\n    \n    maintain();\n}\n\nWandererChunk::~WandererChunk()\n{\n    _lock_data.lock();\n    delete _texture;\n    delete [] _tessellation;\n    _lock_data.unlock();\n}\n\nvoid WandererChunk::render(QGLWidget* widget)\n{\n    _lock_data.lock();\n    \n    if (_texture_changed)\n    {\n        _texture_changed = false;\n        if (_texture_id)\n        {\n            widget->deleteTexture(_texture_id);\n        }\n        \/\/ TODO Only do the scale if not power-of-two textures are unsupported by GPU\n        _texture_id = widget->bindTexture(_texture->scaled(_texture_current_size, _texture_current_size, Qt::IgnoreAspectRatio, Qt::SmoothTransformation));\n        \/\/_texture_id = widget->bindTexture(*_texture);\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    else\n    {\n        glBindTexture(GL_TEXTURE_2D, _texture_id);\n    }\n\n    int tessellation_size = _tessellation_current_size;\n    double tsize = 1.0 \/ (double)_tessellation_max_size;\n    \n    _lock_data.unlock();\n    \n    if (tessellation_size == 0)\n    {\n        return;\n    }\n\n    int tessellation_inc = _tessellation_max_size \/ (double)tessellation_size;\n    for (int j = 0; j < _tessellation_max_size; j += tessellation_inc)\n    {\n        glBegin(GL_QUAD_STRIP);\n        for (int i = 0; i <= _tessellation_max_size; i += tessellation_inc)\n        {\n            glTexCoord2d(tsize * (double)i, 1.0 - tsize * (double)j);\n            glVertex3d(_startx + _tessellation_step * (double)i, _tessellation[j * (_tessellation_max_size + 1) + i], _startz + _tessellation_step * (double)j);\n            glTexCoord2d(tsize * (double)i, 1.0 - tsize * (double)(j + tessellation_inc));\n            glVertex3d(_startx + _tessellation_step * (double)i, _tessellation[(j + tessellation_inc) * (_tessellation_max_size + 1) + i], _startz + _tessellation_step * (double)(j + tessellation_inc));\n        }\n        glEnd();\n    }\n}\n\nvoid WandererChunk::updatePriority(CameraDefinition* camera)\n{\n    \/\/ Compute new priority\n    _lock_data.lock();\n    if (camera->location.x > _startx + _overall_step * 0.5)\n    {\n        _startx += _overall_step;\n        _restart_needed = true;\n    }\n    if (camera->location.z > _startz + _overall_step * 0.5)\n    {\n        _startz += _overall_step;\n        _restart_needed = true;\n    }\n    if (camera->location.x < _startx - _overall_step * 0.5)\n    {\n        _startx -= _overall_step;\n        _restart_needed = true;\n    }\n    if (camera->location.z < _startz - _overall_step * 0.5)\n    {\n        _startz -= _overall_step;\n        _restart_needed = true;\n    }\n    \n    if (_restart_needed || _texture_current_size <= 1)\n    {\n        priority = 1000.0;\n    }\n    else if (_tessellation_current_size == _tessellation_max_size && _texture_current_size == _texture_max_size)\n    {\n        priority = -1000.0;\n    }\n    else\n    {\n        double distance, wanted_size;\n        Vector3 center;\n        \n        center = getCenter();\n        \n        distance = v3Norm(v3Sub(camera->location, center));\n        distance = distance < 0.1 ? 0.1 : distance;\n        wanted_size = (int)ceil(120.0 - distance \/ 3.0);\n        \n        priority = wanted_size - _texture_current_size;\n        \/*else if (distance < 30.0 && _texture_current_size < _texture_max_size \/ 8)\n        {\n            priority += 75.0;\n        }\n        else if (distance < 15.0 && _texture_current_size < _texture_max_size)\n        {\n            priority += 50.0;\n        }\n        else if (distance < 30.0 && _texture_current_size < _texture_max_size \/ 2)\n        {\n            priority += 25.0;\n        }*\/\n        \n        if (!cameraIsBoxInView(camera, center, _size, _size, 40.0))\n        {\n            priority -= 100.0;\n        }\n    }\n    _lock_data.unlock();\n}\n\nbool WandererChunk::maintain()\n{\n    if (_restart_needed)\n    {\n        _restart_needed = false;\n\n        _lock_data.lock();\n        _texture_current_size = 0;\n        _tessellation_current_size = 0;\n        _lock_data.unlock();\n    }\n    \n    if (_tessellation_current_size < _tessellation_max_size || _texture_current_size < _texture_max_size)\n    {\n        \/\/ Improve heightmap resolution\n        if (_tessellation_current_size < _tessellation_max_size)\n        {\n            int new_tessellation_size = _tessellation_current_size ? _tessellation_current_size * 4 : 2;\n            int old_tessellation_inc = _tessellation_current_size ? _tessellation_max_size \/ _tessellation_current_size : 1;\n            int new_tessellation_inc = _tessellation_max_size \/ new_tessellation_size;\n            for (int j = 0; j <= _tessellation_max_size; j += new_tessellation_inc)\n            {\n                for (int i = 0; i <= _tessellation_max_size; i += new_tessellation_inc)\n                {\n                    if (_tessellation_current_size == 0 || i % old_tessellation_inc != 0 || j % old_tessellation_inc != 0)\n                    {\n                        double height = _renderer->getTerrainHeight(_renderer, _startx + _tessellation_step * (double)i, _startz + _tessellation_step * (double)j);\n                        _tessellation[j * (_tessellation_max_size + 1) + i] = height;\n                    }\n                }\n            }\n            \n            _lock_data.lock();\n            _tessellation_current_size = new_tessellation_size;\n            _lock_data.unlock();\n        }\n\n        \/\/ Improve texture resolution\n        if (_texture_current_size < _texture_max_size)\n        {\n            int new_texture_size = _texture_current_size ? _texture_current_size * 2 : 1;\n            double step_size = _texture_current_size ? _size \/ (double)(new_texture_size) : 0.1;\n            \/\/QImage* new_image = new QImage(new_texture_size, new_texture_size, QImage::Format_ARGB32);\n            QImage* new_image = new QImage(_texture->scaled(new_texture_size + 1, new_texture_size + 1, Qt::IgnoreAspectRatio, Qt::FastTransformation));\n            for (int j = 0; j <= new_texture_size; j++)\n            {\n                for (int i = 0; i <= new_texture_size; i++)\n                {\n                    if (_texture_current_size <= 1 || i % 2 != 0 || j % 2 != 0)\n                    {\n                        Vector3 location = {_startx + step_size * (double)i, 0.0, _startz + step_size * (double)j};\n                        Color color = _renderer->applyTextures(_renderer, location, step_size);\n                        new_image->setPixel(i, j, colorTo32BitBGRA(&color));\n                    }\n                }\n            }\n            \n            _lock_data.lock();\n            delete _texture;\n            _texture = new_image;\n            _texture_current_size = new_texture_size;\n            _texture_changed = true;\n            _lock_data.unlock();\n        }\n\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nVector3 WandererChunk::getCenter()\n{\n    Vector3 result;\n    \n    result.x = _startx + _size \/ 2.0;\n    result.y = 0.0;\n    result.z = _startz + _size \/ 2.0;\n    \n    return result;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"addresstablemodel.h\"\n#include \"guiutil.h\"\n#include \"walletmodel.h\"\n#include \"bitcoinunits.h\"\n#include \"optionsmodel.h\"\n#include \"guiconstants.h\"\n\n#include \"wallet.h\"\n#include \"base58.h\"\n\n#include <QFont>\n#include <QColor>\n#include <QTimer>\n\nconst QString AddressTableModel::Send = \"S\";\nconst QString AddressTableModel::Receive = \"R\";\n\nstruct AddressTableEntry\n{\n    enum Type {\n        Sending,\n        Receiving\n    };\n\n    Type type;\n    QString label;\n    QString address;\n    int64 amount;\n\n    AddressTableEntry() {}\n    AddressTableEntry(Type type, const QString &label, const QString &address):\n        type(type), label(label), address(address) {}\n    AddressTableEntry(Type type, const QString &label, const QString &address, uint64 amount):\n        type(type), label(label), address(address), amount(amount) {}\n};\n\nstruct AddressTableEntryLessThan\n{\n    bool operator()(const AddressTableEntry &a, const AddressTableEntry &b) const\n    {\n        return a.address < b.address;\n    }\n    bool operator()(const AddressTableEntry &a, const QString &b) const\n    {\n        return a.address < b;\n    }\n    bool operator()(const QString &a, const AddressTableEntry &b) const\n    {\n        return a < b.address;\n    }\n};\n\n\/\/ Private implementation\nclass AddressTablePriv\n{\npublic:\n    CWallet *wallet;\n    QList<AddressTableEntry> cachedAddressTable;\n    AddressTableModel *parent;\n\n    AddressTablePriv(CWallet *wallet, AddressTableModel *parent):\n        wallet(wallet), parent(parent) {}\n\n    void refreshAddressTable()\n    {\n        cachedAddressTable.clear();\n        {\n            LOCK(wallet->cs_wallet);\n            std::map<QString, std::vector<COutput> > mapCoins;\n            parent->walletModel->listCoins(mapCoins);\n            BOOST_FOREACH(const PAIRTYPE(CTxDestination, std::string)& item, wallet->mapAddressBook)\n            {\n                const CBitcoinAddress& address = item.first;\n                const std::string& strName = item.second;\n                bool fMine = IsMine(*wallet, address.Get());\n                CKeyID addressCKeyID;\n                address.GetKeyID(addressCKeyID);\n                int64 amount=0;\n                BOOST_FOREACH(PAIRTYPE(QString, std::vector<COutput>) coins, mapCoins)\n                {\n                    QString sWalletAddress = coins.first;\n                    if(sWalletAddress.contains(QString(address.ToString().c_str()),Qt::CaseSensitive))\n                    {\n                      BOOST_FOREACH(const COutput& out, coins.second)\n                      {\n                          amount += out.tx->vout[out.i].nValue;\n                      }\n                    }\n                }\n                cachedAddressTable.append(AddressTableEntry(fMine ? AddressTableEntry::Receiving : AddressTableEntry::Sending,\n                                  QString::fromStdString(strName),\n                                  QString::fromStdString(address.ToString()),\n                                  amount));\n            }\n        }\n    }\n\n    void updateEntry(const QString &address, const QString &label, bool isMine, int status)\n    {\n        \/\/ Find address \/ label in model\n        QList<AddressTableEntry>::iterator lower = qLowerBound(\n            cachedAddressTable.begin(), cachedAddressTable.end(), address, AddressTableEntryLessThan());\n        QList<AddressTableEntry>::iterator upper = qUpperBound(\n            cachedAddressTable.begin(), cachedAddressTable.end(), address, AddressTableEntryLessThan());\n        int lowerIndex = (lower - cachedAddressTable.begin());\n        int upperIndex = (upper - cachedAddressTable.begin());\n        bool inModel = (lower != upper);\n        AddressTableEntry::Type newEntryType = isMine ? AddressTableEntry::Receiving : AddressTableEntry::Sending;\n\n        switch(status)\n        {\n        case CT_NEW:\n            if(inModel)\n            {\n                OutputDebugStringF(\"Warning: AddressTablePriv::updateEntry: Got CT_NOW, but entry is already in model\\n\");\n                break;\n            }\n            parent->beginInsertRows(QModelIndex(), lowerIndex, lowerIndex);\n            cachedAddressTable.insert(lowerIndex, AddressTableEntry(newEntryType, label, address));\n            parent->endInsertRows();\n            break;\n        case CT_UPDATED:\n            if(!inModel)\n            {\n                OutputDebugStringF(\"Warning: AddressTablePriv::updateEntry: Got CT_UPDATED, but entry is not in model\\n\");\n                break;\n            }\n            lower->type = newEntryType;\n            lower->label = label;\n            parent->emitDataChanged(lowerIndex);\n            break;\n        case CT_DELETED:\n            if(!inModel)\n            {\n                OutputDebugStringF(\"Warning: AddressTablePriv::updateEntry: Got CT_DELETED, but entry is not in model\\n\");\n                break;\n            }\n            parent->beginRemoveRows(QModelIndex(), lowerIndex, upperIndex-1);\n            cachedAddressTable.erase(lower, upper);\n            parent->endRemoveRows();\n            break;\n        }\n    }\n\n    int size()\n    {\n        return cachedAddressTable.size();\n    }\n\n    AddressTableEntry *index(int idx)\n    {\n        if(idx >= 0 && idx < cachedAddressTable.size())\n        {\n            return &cachedAddressTable[idx];\n        }\n        else\n        {\n            return 0;\n        }\n    }\n};\n\nAddressTableModel::AddressTableModel(CWallet *wallet, WalletModel *parent) :\n    QAbstractTableModel(parent),walletModel(parent),wallet(wallet),priv(0)\n{\n    columns << tr(\"Label\") << tr(\"Address\") << tr(\"Amount\");\n    priv = new AddressTablePriv(wallet, this);\n    priv->refreshAddressTable();\n\n    QTimer *timer = new QTimer(this);\n    connect(timer, SIGNAL(timeout()), this, SLOT(refreshAddressTable()));\n    timer->start(MODEL_UPDATE_DELAY);\n}\n\nAddressTableModel::~AddressTableModel()\n{\n    delete priv;\n}\n\nvoid AddressTableModel::refreshAddressTable()\n{\n  priv->refreshAddressTable();\n}\n\nint AddressTableModel::rowCount(const QModelIndex &parent) const\n{\n    Q_UNUSED(parent);\n    return priv->size();\n}\n\nint AddressTableModel::columnCount(const QModelIndex &parent) const\n{\n    Q_UNUSED(parent);\n    return columns.length();\n}\n\nQVariant AddressTableModel::data(const QModelIndex &index, int role) const\n{\n    if(!index.isValid())\n        return QVariant();\n\n    AddressTableEntry *rec = static_cast<AddressTableEntry*>(index.internalPointer());\n\n    if(role == Qt::DisplayRole || role == Qt::EditRole)\n    {\n        switch(index.column())\n        {\n        case Label:\n            if(rec->label.isEmpty() && role == Qt::DisplayRole)\n            {\n                return tr(\"(no label)\");\n            }\n            else\n            {\n                return rec->label;\n            }\n        case Address:\n            return rec->address;\n        case Amount:\n            int unit = walletModel->getOptionsModel()->getDisplayUnit();\n            return BitcoinUnits::format(unit, rec->amount);\n        }\n    }\n    else if (role == Qt::FontRole)\n    {\n        QFont font;\n        if(index.column() == Address)\n        {\n            font = GUIUtil::bitcoinAddressFont();\n        }\n        return font;\n    }\n    else if (role == TypeRole)\n    {\n        switch(rec->type)\n        {\n        case AddressTableEntry::Sending:\n            return Send;\n        case AddressTableEntry::Receiving:\n            return Receive;\n        default: break;\n        }\n    }\n    return QVariant();\n}\n\nbool AddressTableModel::setData(const QModelIndex & index, const QVariant & value, int role)\n{\n    if(!index.isValid())\n        return false;\n    AddressTableEntry *rec = static_cast<AddressTableEntry*>(index.internalPointer());\n\n    editStatus = OK;\n\n    if(role == Qt::EditRole)\n    {\n        switch(index.column())\n        {\n        case Label:\n            wallet->SetAddressBookName(CBitcoinAddress(rec->address.toStdString()).Get(), value.toString().toStdString());\n            rec->label = value.toString();\n            break;\n        case Address:\n            \/\/ Refuse to set invalid address, set error status and return false\n            if(!walletModel->validateAddress(value.toString()))\n            {\n                editStatus = INVALID_ADDRESS;\n                return false;\n            }\n            \/\/ Double-check that we're not overwriting a receiving address\n            if(rec->type == AddressTableEntry::Sending)\n            {\n                {\n                    LOCK(wallet->cs_wallet);\n                    \/\/ Remove old entry\n                    wallet->DelAddressBookName(CBitcoinAddress(rec->address.toStdString()).Get());\n                    \/\/ Add new entry with new address\n                    wallet->SetAddressBookName(CBitcoinAddress(value.toString().toStdString()).Get(), rec->label.toStdString());\n                }\n            }\n            break;\n        }\n\n        return true;\n    }\n    return false;\n}\n\nQVariant AddressTableModel::headerData(int section, Qt::Orientation orientation, int role) const\n{\n    if(orientation == Qt::Horizontal)\n    {\n        if(role == Qt::DisplayRole)\n        {\n            return columns[section];\n        }\n    }\n    return QVariant();\n}\n\nQt::ItemFlags AddressTableModel::flags(const QModelIndex & index) const\n{\n    if(!index.isValid())\n        return 0;\n    AddressTableEntry *rec = static_cast<AddressTableEntry*>(index.internalPointer());\n\n    Qt::ItemFlags retval = Qt::ItemIsSelectable | Qt::ItemIsEnabled;\n    \/\/ Can edit address and label for sending addresses,\n    \/\/ and only label for receiving addresses.\n    if(rec->type == AddressTableEntry::Sending ||\n      (rec->type == AddressTableEntry::Receiving && index.column()==Label))\n    {\n        retval |= Qt::ItemIsEditable;\n    }\n    return retval;\n}\n\nQModelIndex AddressTableModel::index(int row, int column, const QModelIndex & parent) const\n{\n    Q_UNUSED(parent);\n    AddressTableEntry *data = priv->index(row);\n    if(data)\n    {\n        return createIndex(row, column, priv->index(row));\n    }\n    else\n    {\n        return QModelIndex();\n    }\n}\n\nvoid AddressTableModel::updateEntry(const QString &address, const QString &label, bool isMine, int status)\n{\n    \/\/ Update address book model from Bitcoin core\n    priv->updateEntry(address, label, isMine, status);\n}\n\nQString AddressTableModel::addRow(const QString &type, const QString &label, const QString &address)\n{\n    std::string strLabel = label.toStdString();\n    std::string strAddress = address.toStdString();\n\n    editStatus = OK;\n\n    if(type == Send)\n    {\n        if(!walletModel->validateAddress(address))\n        {\n            editStatus = INVALID_ADDRESS;\n            return QString();\n        }\n        \/\/ Check for duplicate addresses\n        {\n            LOCK(wallet->cs_wallet);\n            if(wallet->mapAddressBook.count(CBitcoinAddress(strAddress).Get()))\n            {\n                editStatus = DUPLICATE_ADDRESS;\n                return QString();\n            }\n        }\n    }\n    else if(type == Receive)\n    {\n        \/\/ Generate a new address to associate with given label\n        WalletModel::UnlockContext ctx(walletModel->requestUnlock());\n        if(!ctx.isValid())\n        {\n            \/\/ Unlock wallet failed or was cancelled\n            editStatus = WALLET_UNLOCK_FAILURE;\n            return QString();\n        }\n        CPubKey newKey;\n        if(!wallet->GetKeyFromPool(newKey, true))\n        {\n            editStatus = KEY_GENERATION_FAILURE;\n            return QString();\n        }\n        strAddress = CBitcoinAddress(newKey.GetID()).ToString();\n    }\n    else\n    {\n        return QString();\n    }\n    \/\/ Add entry\n    {\n        LOCK(wallet->cs_wallet);\n        wallet->SetAddressBookName(CBitcoinAddress(strAddress).Get(), strLabel);\n    }\n    return QString::fromStdString(strAddress);\n}\n\nbool AddressTableModel::removeRows(int row, int count, const QModelIndex & parent)\n{\n    Q_UNUSED(parent);\n    AddressTableEntry *rec = priv->index(row);\n    if(count != 1 || !rec || rec->type == AddressTableEntry::Receiving)\n    {\n        \/\/ Can only remove one row at a time, and cannot remove rows not in model.\n        \/\/ Also refuse to remove receiving addresses.\n        return false;\n    }\n    {\n        LOCK(wallet->cs_wallet);\n        wallet->DelAddressBookName(CBitcoinAddress(rec->address.toStdString()).Get());\n    }\n    return true;\n}\n\n\/* Look up label for address in address book, if not found return empty string.\n *\/\nQString AddressTableModel::labelForAddress(const QString &address) const\n{\n    {\n        LOCK(wallet->cs_wallet);\n        CBitcoinAddress address_parsed(address.toStdString());\n        std::map<CTxDestination, std::string>::iterator mi = wallet->mapAddressBook.find(address_parsed.Get());\n        if (mi != wallet->mapAddressBook.end())\n        {\n            return QString::fromStdString(mi->second);\n        }\n    }\n    return QString();\n}\n\nint AddressTableModel::lookupAddress(const QString &address) const\n{\n    QModelIndexList lst = match(index(0, Address, QModelIndex()),\n                                Qt::EditRole, address, 1, Qt::MatchExactly);\n    if(lst.isEmpty())\n    {\n        return -1;\n    }\n    else\n    {\n        return lst.at(0).row();\n    }\n}\n\nvoid AddressTableModel::emitDataChanged(int idx)\n{\n    emit dataChanged(index(idx, 0, QModelIndex()), index(idx, columns.length()-1, QModelIndex()));\n}\n<commit_msg>Fix bug where Address book and Receive address can get swapped<commit_after>#include \"addresstablemodel.h\"\n#include \"guiutil.h\"\n#include \"walletmodel.h\"\n#include \"bitcoinunits.h\"\n#include \"optionsmodel.h\"\n#include \"guiconstants.h\"\n\n#include \"wallet.h\"\n#include \"base58.h\"\n\n#include <QFont>\n#include <QColor>\n#include <QTimer>\n\nconst QString AddressTableModel::Send = \"S\";\nconst QString AddressTableModel::Receive = \"R\";\n\nstruct AddressTableEntry\n{\n    enum Type {\n        Sending,\n        Receiving\n    };\n\n    Type type;\n    bool updated;\n    QString label;\n    QString address;\n    int64 amount;\n\n    AddressTableEntry() {}\n    AddressTableEntry(Type type, const QString &label, const QString &address):\n        type(type), label(label), address(address) {}\n    AddressTableEntry(Type type, const QString &label, const QString &address, uint64 amount):\n        type(type), label(label), address(address), amount(amount) {}\n};\n\nstruct AddressTableEntryLessThan\n{\n    bool operator()(const AddressTableEntry &a, const AddressTableEntry &b) const\n    {\n        return a.address < b.address;\n    }\n    bool operator()(const AddressTableEntry &a, const QString &b) const\n    {\n        return a.address < b;\n    }\n    bool operator()(const QString &a, const AddressTableEntry &b) const\n    {\n        return a < b.address;\n    }\n};\n\n\/\/ Private implementation\nclass AddressTablePriv\n{\npublic:\n    CWallet *wallet;\n    QList<AddressTableEntry> cachedAddressTable;\n    AddressTableModel *parent;\n\n    AddressTablePriv(CWallet *wallet, AddressTableModel *parent):\n        wallet(wallet), parent(parent) {}\n\n    void refreshAddressTable()\n    {\n        for(int i=0;i<cachedAddressTable.size();i++)\n        {\n          cachedAddressTable[i].updated=false;\n        }\n\n        {\n            LOCK(wallet->cs_wallet);\n            std::map<QString, std::vector<COutput> > mapCoins;\n            parent->walletModel->listCoins(mapCoins);\n            BOOST_FOREACH(const PAIRTYPE(CTxDestination, std::string)& item, wallet->mapAddressBook)\n            {\n                const CBitcoinAddress& address = item.first;\n                const std::string& strName = item.second;\n                bool fMine = IsMine(*wallet, address.Get());\n                CKeyID addressCKeyID;\n                address.GetKeyID(addressCKeyID);\n                int64 amount=0;\n                BOOST_FOREACH(PAIRTYPE(QString, std::vector<COutput>) coins, mapCoins)\n                {\n                    QString sWalletAddress = coins.first;\n                    if(sWalletAddress.contains(QString(address.ToString().c_str()),Qt::CaseSensitive))\n                    {\n                      BOOST_FOREACH(const COutput& out, coins.second)\n                      {\n                          amount += out.tx->vout[out.i].nValue;\n                      }\n                    }\n                }\n                \/\/update existing entries\n                bool found=false;\n                for(int i=0;i<cachedAddressTable.size();i++)\n                {\n                  if(cachedAddressTable.at(i).address==QString::fromStdString(address.ToString()))\n                  {\n                    cachedAddressTable[i].label=QString::fromStdString(strName);\n                    cachedAddressTable[i].amount=amount;\n                    cachedAddressTable[i].updated=true;\n                    found=true;\n                    break;\n                  }\n                }\n                \/\/add new entries\n                if(!found)\n                {\n                  cachedAddressTable.append(AddressTableEntry(fMine ? AddressTableEntry::Receiving : AddressTableEntry::Sending,\n                                  QString::fromStdString(strName),\n                                  QString::fromStdString(address.ToString()),\n                                  amount));\n                  cachedAddressTable.last().updated=true;\n                }\n            }\n        }\n        \/\/remove deleted entries\n        for(int i=cachedAddressTable.size()-1;i>0;i--)\n        {\n          if(!cachedAddressTable.at(i).updated)\n          {\n            cachedAddressTable.removeAt(i);\n          }\n        }\n    }\n\n    void updateEntry(const QString &address, const QString &label, bool isMine, int status)\n    {\n        \/\/ Find address \/ label in model\n        QList<AddressTableEntry>::iterator lower = qLowerBound(\n            cachedAddressTable.begin(), cachedAddressTable.end(), address, AddressTableEntryLessThan());\n        QList<AddressTableEntry>::iterator upper = qUpperBound(\n            cachedAddressTable.begin(), cachedAddressTable.end(), address, AddressTableEntryLessThan());\n        int lowerIndex = (lower - cachedAddressTable.begin());\n        int upperIndex = (upper - cachedAddressTable.begin());\n        bool inModel = (lower != upper);\n        AddressTableEntry::Type newEntryType = isMine ? AddressTableEntry::Receiving : AddressTableEntry::Sending;\n\n        switch(status)\n        {\n        case CT_NEW:\n            if(inModel)\n            {\n                OutputDebugStringF(\"Warning: AddressTablePriv::updateEntry: Got CT_NOW, but entry is already in model\\n\");\n                break;\n            }\n            parent->beginInsertRows(QModelIndex(), lowerIndex, lowerIndex);\n            cachedAddressTable.insert(lowerIndex, AddressTableEntry(newEntryType, label, address));\n            parent->endInsertRows();\n            break;\n        case CT_UPDATED:\n            if(!inModel)\n            {\n                OutputDebugStringF(\"Warning: AddressTablePriv::updateEntry: Got CT_UPDATED, but entry is not in model\\n\");\n                break;\n            }\n            lower->type = newEntryType;\n            lower->label = label;\n            parent->emitDataChanged(lowerIndex);\n            break;\n        case CT_DELETED:\n            if(!inModel)\n            {\n                OutputDebugStringF(\"Warning: AddressTablePriv::updateEntry: Got CT_DELETED, but entry is not in model\\n\");\n                break;\n            }\n            parent->beginRemoveRows(QModelIndex(), lowerIndex, upperIndex-1);\n            cachedAddressTable.erase(lower, upper);\n            parent->endRemoveRows();\n            break;\n        }\n    }\n\n    int size()\n    {\n        return cachedAddressTable.size();\n    }\n\n    AddressTableEntry *index(int idx)\n    {\n        if(idx >= 0 && idx < cachedAddressTable.size())\n        {\n            return &cachedAddressTable[idx];\n        }\n        else\n        {\n            return 0;\n        }\n    }\n};\n\nAddressTableModel::AddressTableModel(CWallet *wallet, WalletModel *parent) :\n    QAbstractTableModel(parent),walletModel(parent),wallet(wallet),priv(0)\n{\n    columns << tr(\"Label\") << tr(\"Address\") << tr(\"Amount\");\n    priv = new AddressTablePriv(wallet, this);\n    priv->refreshAddressTable();\n\n    QTimer *timer = new QTimer(this);\n    connect(timer, SIGNAL(timeout()), this, SLOT(refreshAddressTable()));\n    timer->start(MODEL_UPDATE_DELAY);\n}\n\nAddressTableModel::~AddressTableModel()\n{\n    delete priv;\n}\n\nvoid AddressTableModel::refreshAddressTable()\n{\n  priv->refreshAddressTable();\n}\n\nint AddressTableModel::rowCount(const QModelIndex &parent) const\n{\n    Q_UNUSED(parent);\n    return priv->size();\n}\n\nint AddressTableModel::columnCount(const QModelIndex &parent) const\n{\n    Q_UNUSED(parent);\n    return columns.length();\n}\n\nQVariant AddressTableModel::data(const QModelIndex &index, int role) const\n{\n    if(!index.isValid())\n        return QVariant();\n\n    AddressTableEntry *rec = static_cast<AddressTableEntry*>(index.internalPointer());\n\n    if(role == Qt::DisplayRole || role == Qt::EditRole)\n    {\n        switch(index.column())\n        {\n        case Label:\n            if(rec->label.isEmpty() && role == Qt::DisplayRole)\n            {\n                return tr(\"(no label)\");\n            }\n            else\n            {\n                return rec->label;\n            }\n        case Address:\n            return rec->address;\n        case Amount:\n            int unit = walletModel->getOptionsModel()->getDisplayUnit();\n            return BitcoinUnits::format(unit, rec->amount);\n        }\n    }\n    else if (role == Qt::FontRole)\n    {\n        QFont font;\n        if(index.column() == Address)\n        {\n            font = GUIUtil::bitcoinAddressFont();\n        }\n        return font;\n    }\n    else if (role == TypeRole)\n    {\n        switch(rec->type)\n        {\n        case AddressTableEntry::Sending:\n            return Send;\n        case AddressTableEntry::Receiving:\n            return Receive;\n        default: break;\n        }\n    }\n    return QVariant();\n}\n\nbool AddressTableModel::setData(const QModelIndex & index, const QVariant & value, int role)\n{\n    if(!index.isValid())\n        return false;\n    AddressTableEntry *rec = static_cast<AddressTableEntry*>(index.internalPointer());\n\n    editStatus = OK;\n\n    if(role == Qt::EditRole)\n    {\n        switch(index.column())\n        {\n        case Label:\n            wallet->SetAddressBookName(CBitcoinAddress(rec->address.toStdString()).Get(), value.toString().toStdString());\n            rec->label = value.toString();\n            break;\n        case Address:\n            \/\/ Refuse to set invalid address, set error status and return false\n            if(!walletModel->validateAddress(value.toString()))\n            {\n                editStatus = INVALID_ADDRESS;\n                return false;\n            }\n            \/\/ Double-check that we're not overwriting a receiving address\n            if(rec->type == AddressTableEntry::Sending)\n            {\n                {\n                    LOCK(wallet->cs_wallet);\n                    \/\/ Remove old entry\n                    wallet->DelAddressBookName(CBitcoinAddress(rec->address.toStdString()).Get());\n                    \/\/ Add new entry with new address\n                    wallet->SetAddressBookName(CBitcoinAddress(value.toString().toStdString()).Get(), rec->label.toStdString());\n                }\n            }\n            break;\n        }\n\n        return true;\n    }\n    return false;\n}\n\nQVariant AddressTableModel::headerData(int section, Qt::Orientation orientation, int role) const\n{\n    if(orientation == Qt::Horizontal)\n    {\n        if(role == Qt::DisplayRole)\n        {\n            return columns[section];\n        }\n    }\n    return QVariant();\n}\n\nQt::ItemFlags AddressTableModel::flags(const QModelIndex & index) const\n{\n    if(!index.isValid())\n        return 0;\n    AddressTableEntry *rec = static_cast<AddressTableEntry*>(index.internalPointer());\n\n    Qt::ItemFlags retval = Qt::ItemIsSelectable | Qt::ItemIsEnabled;\n    \/\/ Can edit address and label for sending addresses,\n    \/\/ and only label for receiving addresses.\n    if(rec->type == AddressTableEntry::Sending ||\n      (rec->type == AddressTableEntry::Receiving && index.column()==Label))\n    {\n        retval |= Qt::ItemIsEditable;\n    }\n    return retval;\n}\n\nQModelIndex AddressTableModel::index(int row, int column, const QModelIndex & parent) const\n{\n    Q_UNUSED(parent);\n    AddressTableEntry *data = priv->index(row);\n    if(data)\n    {\n        return createIndex(row, column, priv->index(row));\n    }\n    else\n    {\n        return QModelIndex();\n    }\n}\n\nvoid AddressTableModel::updateEntry(const QString &address, const QString &label, bool isMine, int status)\n{\n    \/\/ Update address book model from Bitcoin core\n    priv->updateEntry(address, label, isMine, status);\n}\n\nQString AddressTableModel::addRow(const QString &type, const QString &label, const QString &address)\n{\n    std::string strLabel = label.toStdString();\n    std::string strAddress = address.toStdString();\n\n    editStatus = OK;\n\n    if(type == Send)\n    {\n        if(!walletModel->validateAddress(address))\n        {\n            editStatus = INVALID_ADDRESS;\n            return QString();\n        }\n        \/\/ Check for duplicate addresses\n        {\n            LOCK(wallet->cs_wallet);\n            if(wallet->mapAddressBook.count(CBitcoinAddress(strAddress).Get()))\n            {\n                editStatus = DUPLICATE_ADDRESS;\n                return QString();\n            }\n        }\n    }\n    else if(type == Receive)\n    {\n        \/\/ Generate a new address to associate with given label\n        WalletModel::UnlockContext ctx(walletModel->requestUnlock());\n        if(!ctx.isValid())\n        {\n            \/\/ Unlock wallet failed or was cancelled\n            editStatus = WALLET_UNLOCK_FAILURE;\n            return QString();\n        }\n        CPubKey newKey;\n        if(!wallet->GetKeyFromPool(newKey, true))\n        {\n            editStatus = KEY_GENERATION_FAILURE;\n            return QString();\n        }\n        strAddress = CBitcoinAddress(newKey.GetID()).ToString();\n    }\n    else\n    {\n        return QString();\n    }\n    \/\/ Add entry\n    {\n        LOCK(wallet->cs_wallet);\n        wallet->SetAddressBookName(CBitcoinAddress(strAddress).Get(), strLabel);\n    }\n    return QString::fromStdString(strAddress);\n}\n\nbool AddressTableModel::removeRows(int row, int count, const QModelIndex & parent)\n{\n    Q_UNUSED(parent);\n    AddressTableEntry *rec = priv->index(row);\n    if(count != 1 || !rec || rec->type == AddressTableEntry::Receiving)\n    {\n        \/\/ Can only remove one row at a time, and cannot remove rows not in model.\n        \/\/ Also refuse to remove receiving addresses.\n        return false;\n    }\n    {\n        LOCK(wallet->cs_wallet);\n        wallet->DelAddressBookName(CBitcoinAddress(rec->address.toStdString()).Get());\n    }\n    return true;\n}\n\n\/* Look up label for address in address book, if not found return empty string.\n *\/\nQString AddressTableModel::labelForAddress(const QString &address) const\n{\n    {\n        LOCK(wallet->cs_wallet);\n        CBitcoinAddress address_parsed(address.toStdString());\n        std::map<CTxDestination, std::string>::iterator mi = wallet->mapAddressBook.find(address_parsed.Get());\n        if (mi != wallet->mapAddressBook.end())\n        {\n            return QString::fromStdString(mi->second);\n        }\n    }\n    return QString();\n}\n\nint AddressTableModel::lookupAddress(const QString &address) const\n{\n    QModelIndexList lst = match(index(0, Address, QModelIndex()),\n                                Qt::EditRole, address, 1, Qt::MatchExactly);\n    if(lst.isEmpty())\n    {\n        return -1;\n    }\n    else\n    {\n        return lst.at(0).row();\n    }\n}\n\nvoid AddressTableModel::emitDataChanged(int idx)\n{\n    emit dataChanged(index(idx, 0, QModelIndex()), index(idx, columns.length()-1, QModelIndex()));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\n    Copyright (C) 2014 Pedro Côrte-Real\n    Copyright (C) 2017 Roman Lebedev\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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"decoders\/SimpleTiffDecoder.h\"\n#include \"common\/Point.h\"                 \/\/ for iPoint2D\n#include \"common\/RawImage.h\"              \/\/ for RawImage, RawImageData\n#include \"decoders\/RawDecoderException.h\" \/\/ for RawDecoderException (ptr o...\n#include \"io\/Buffer.h\"                    \/\/ for Buffer\n#include \"tiff\/TiffEntry.h\"               \/\/ for TiffEntry\n#include \"tiff\/TiffIFD.h\"                 \/\/ for TiffIFD\n#include \"tiff\/TiffTag.h\"                 \/\/ for TiffTag::IMAGELENGTH, Tiff...\n\nnamespace rawspeed {\n\nvoid SimpleTiffDecoder::prepareForRawDecoding() {\n  raw = getIFDWithLargestImage();\n  width = raw->getEntry(IMAGEWIDTH)->getU32();\n  height = raw->getEntry(IMAGELENGTH)->getU32();\n  off = raw->getEntry(STRIPOFFSETS)->getU32();\n  c2 = raw->getEntry(STRIPBYTECOUNTS)->getU32();\n\n  if (off > mFile->getSize())\n    ThrowRDE(\"Offset is out of bounds\");\n\n  if (c2 > mFile->getSize() - off) {\n    mRaw->setError(\n        \"Warning: byte count larger than file size, file probably truncated.\");\n  }\n\n  mRaw->dim = iPoint2D(width, height);\n  mRaw->createData();\n}\n\n} \/\/ namespace rawspeed\n<commit_msg>SimpleTiffDecoder::prepareForRawDecoding(): better error handling<commit_after>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\n    Copyright (C) 2014 Pedro Côrte-Real\n    Copyright (C) 2017 Roman Lebedev\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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"decoders\/SimpleTiffDecoder.h\"\n#include \"common\/Point.h\"                 \/\/ for iPoint2D\n#include \"common\/RawImage.h\"              \/\/ for RawImage, RawImageData\n#include \"decoders\/RawDecoderException.h\" \/\/ for RawDecoderException (ptr o...\n#include \"io\/Buffer.h\"                    \/\/ for Buffer\n#include \"tiff\/TiffEntry.h\"               \/\/ for TiffEntry\n#include \"tiff\/TiffIFD.h\"                 \/\/ for TiffIFD\n#include \"tiff\/TiffTag.h\"                 \/\/ for TiffTag::IMAGELENGTH, Tiff...\n\nnamespace rawspeed {\n\nvoid SimpleTiffDecoder::prepareForRawDecoding() {\n  raw = getIFDWithLargestImage();\n  width = raw->getEntry(IMAGEWIDTH)->getU32();\n  height = raw->getEntry(IMAGELENGTH)->getU32();\n  off = raw->getEntry(STRIPOFFSETS)->getU32();\n  c2 = raw->getEntry(STRIPBYTECOUNTS)->getU32();\n\n  if (!mFile->isValid(off, c2))\n    ThrowRDE(\"Image is truncated.\");\n\n  if (0 == width || 0 == height)\n    ThrowRDE(\"Image has zero size.\");\n\n  mRaw->dim = iPoint2D(width, height);\n  mRaw->createData();\n}\n\n} \/\/ namespace rawspeed\n<|endoftext|>"}
{"text":"<commit_before>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\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* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include <net\/CURLNetRequest.h>\n#include <common\/PosixThreadImpl.h>\n\n#include \"rhodes\/JNINetRequest.h\"\n#include \"rhodes\/RhoClassFactory.h\"\n#include \"rhodes\/sslimpl.h\"\n#include \"rhodes\/rhocryptimpl.h\"\n#include \"rhodes\/SecurityTokenGenerator.h\"\n\nstatic rho::common::CRhoClassFactory g_rhoClassFactory;\nrho::common::IRhoClassFactory* rho_get_RhoClassFactory()\n{\n    return &g_rhoClassFactory;\n}\n\nnamespace rho\n{\nnamespace common\n{\n\nnet::INetRequestImpl* CRhoClassFactory::createNetRequestImpl()\n{\n    \/\/return new net::CURLNetRequest();\n    return new net::JNINetRequest();\n}\n\nIRhoThreadImpl *CRhoClassFactory::createThreadImpl()\n{\n    return new CPosixThreadImpl();\n}\n\nIRhoCrypt *CRhoClassFactory::createRhoCrypt()\n{\n    return new CRhoCryptImpl;\n}\n\nconst ISecurityTokenGenerator* CRhoClassFactory::createSecurityTokenGenerator()\n{\n    static SecurityTokenGenerator global_generator;\n    return &global_generator;\n}\n\n} \/\/ namespace common\n} \/\/ namespace rho\n\n<commit_msg>new property android_net_curl, by deafault 1<commit_after>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\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* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include <net\/CURLNetRequest.h>\n#include <common\/PosixThreadImpl.h>\n\n#include \"rhodes\/JNINetRequest.h\"\n#include \"rhodes\/RhoClassFactory.h\"\n#include \"rhodes\/sslimpl.h\"\n#include \"rhodes\/rhocryptimpl.h\"\n#include \"rhodes\/SecurityTokenGenerator.h\"\n\nstatic rho::common::CRhoClassFactory g_rhoClassFactory;\nrho::common::IRhoClassFactory* rho_get_RhoClassFactory()\n{\n    return &g_rhoClassFactory;\n}\n\nnamespace rho\n{\nnamespace common\n{\n\nnet::INetRequestImpl* CRhoClassFactory::createNetRequestImpl()\n{\n    bool prop_exists = rho_conf_is_property_exists(\"android_net_curl\");\n    if(!prop_exists)\n        rho_conf_setInt(\"android_net_curl\", 1);\n        \n    if (rho_conf_getInt(\"android_net_curl\")) \n        return new net::CURLNetRequest();\n    else\n        return new net::JNINetRequest();\n}\n\nIRhoThreadImpl *CRhoClassFactory::createThreadImpl()\n{\n    return new CPosixThreadImpl();\n}\n\nIRhoCrypt *CRhoClassFactory::createRhoCrypt()\n{\n    return new CRhoCryptImpl;\n}\n\nconst ISecurityTokenGenerator* CRhoClassFactory::createSecurityTokenGenerator()\n{\n    static SecurityTokenGenerator global_generator;\n    return &global_generator;\n}\n\n} \/\/ namespace common\n} \/\/ namespace rho\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 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\/\/ ospcommon\n#include \"ospcommon\/tasking\/parallel_for.h\"\n#include \"common\/Data.h\"\n\/\/ ospray\n#include \"DistributedRaycast.h\"\n#include \"..\/..\/common\/DistributedModel.h\"\n#include \"..\/MPILoadBalancer.h\"\n#include \"..\/..\/fb\/DistributedFrameBuffer.h\"\n\/\/ ispc exports\n#include \"DistributedRaycast_ispc.h\"\n\nnamespace ospray {\n  namespace mpi {\n\n    struct RegionInfo\n    {\n      int currentRegion;\n      bool *regionVisible;\n\n      RegionInfo() : currentRegion(0), regionVisible(nullptr) {}\n    };\n\n    \/\/ DistributedRaycastRenderer definitions \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    DistributedRaycastRenderer::DistributedRaycastRenderer()\n    {\n      ispcEquivalent = ispc::DistributedRaycastRenderer_create(this);\n    }\n\n    void DistributedRaycastRenderer::commit()\n    {\n      Renderer::commit();\n      if (!dynamic_cast<DistributedModel*>(model)) {\n        throw std::runtime_error(\"DistributedRaycastRender must use a DistributedModel from \"\n                                 \"the MPIDistributedDevice\");\n      }\n    }\n\n    float DistributedRaycastRenderer::renderFrame(FrameBuffer *fb,\n                                                  const uint32 channelFlags)\n    {\n      using namespace mpicommon;\n\n      auto *dfb = dynamic_cast<DistributedFrameBuffer *>(fb);\n      dfb->setFrameMode(DistributedFrameBuffer::ALPHA_BLEND);\n      dfb->startNewFrame(errorThreshold);\n      dfb->beginFrame();\n\n      DistributedModel *distribModel = dynamic_cast<DistributedModel*>(model);\n      ispc::DistributedRaycastRenderer_setRegions(ispcEquivalent,\n          (ispc::box3f*)distribModel->myRegions.data(),\n          distribModel->myRegions.size(),\n          (ispc::box3f*)distribModel->othersRegions.data(),\n          distribModel->othersRegions.size());\n\n      const size_t numRegions = distribModel->myRegions.size()\n        + distribModel->othersRegions.size();\n\n      beginFrame(dfb);\n\n      tasking::parallel_for(dfb->getTotalTiles(), [&](int taskIndex) {\n        const size_t numTiles_x = fb->getNumTiles().x;\n        const size_t tile_y = taskIndex \/ numTiles_x;\n        const size_t tile_x = taskIndex - tile_y*numTiles_x;\n        const vec2i tileID(tile_x, tile_y);\n        const int32 accumID = fb->accumID(tileID);\n        const bool tileOwner = (taskIndex % numGlobalRanks()) == globalRank();\n\n        if (dfb->tileError(tileID) <= errorThreshold) {\n          return;\n        }\n\n        \/\/ The first 0..myRegions.size() - 1 entries are for my regions,\n        \/\/ the following entries are for other nodes regions\n        RegionInfo regionInfo;\n        regionInfo.regionVisible = STACK_BUFFER(bool, numRegions);\n        std::fill(regionInfo.regionVisible, regionInfo.regionVisible + numRegions, false);\n\n        Tile __aligned(64) tile(tileID, dfb->size, accumID);\n\n        \/\/ We use the task of rendering the first region to also fill out the block visiblility list\n        const int NUM_JOBS = (TILE_SIZE * TILE_SIZE) \/ RENDERTILE_PIXELS_PER_JOB;\n        tasking::parallel_for(NUM_JOBS, [&](int tIdx) {\n          renderTile(&regionInfo, tile, tIdx);\n        });\n\n        if (regionInfo.regionVisible[0]) {\n          tile.generation = 1;\n          tile.children = 0;\n          fb->setTile(tile);\n        }\n\n        \/\/ If we own the tile send the background color and the count of children for the\n        \/\/ number of regions projecting to it that will be sent.\n        if (tileOwner) {\n          tile.generation = 0;\n          tile.children = std::count(regionInfo.regionVisible, regionInfo.regionVisible + numRegions, true);\n          std::fill(tile.r, tile.r + TILE_SIZE * TILE_SIZE, bgColor.x);\n          std::fill(tile.g, tile.g + TILE_SIZE * TILE_SIZE, bgColor.y);\n          std::fill(tile.b, tile.b + TILE_SIZE * TILE_SIZE, bgColor.z);\n          std::fill(tile.a, tile.a + TILE_SIZE * TILE_SIZE, 1.0);\n          std::fill(tile.z, tile.z + TILE_SIZE * TILE_SIZE, std::numeric_limits<float>::infinity());\n          fb->setTile(tile);\n        }\n\n        \/\/ Render the rest of our regions that project to this tile and ship them off\n        tile.generation = 1;\n        tile.children = 0;\n        for (size_t bid = 1; bid < distribModel->myRegions.size(); ++bid) {\n          if (!regionInfo.regionVisible[bid]) {\n            continue;\n          }\n          regionInfo.currentRegion = bid;\n          tasking::parallel_for(NUM_JOBS, [&](int tIdx) {\n            renderTile(&regionInfo, tile, tIdx);\n          });\n          fb->setTile(tile);\n        }\n      });\n\n      dfb->waitUntilFinished();\n      endFrame(nullptr, channelFlags);\n\n      return dfb->endFrame(errorThreshold);\n    }\n\n    std::string DistributedRaycastRenderer::toString() const\n    {\n      return \"ospray::mpi::DistributedRaycastRenderer\";\n    }\n\n    OSP_REGISTER_RENDERER(DistributedRaycastRenderer, mpi_raycast);\n\n  } \/\/ ::ospray::mpi\n} \/\/ ::ospray\n\n<commit_msg>Use the bg color opacity as well for the background tile the owner sends<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 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\/\/ ospcommon\n#include \"ospcommon\/tasking\/parallel_for.h\"\n#include \"common\/Data.h\"\n\/\/ ospray\n#include \"DistributedRaycast.h\"\n#include \"..\/..\/common\/DistributedModel.h\"\n#include \"..\/MPILoadBalancer.h\"\n#include \"..\/..\/fb\/DistributedFrameBuffer.h\"\n\/\/ ispc exports\n#include \"DistributedRaycast_ispc.h\"\n\nnamespace ospray {\n  namespace mpi {\n\n    struct RegionInfo\n    {\n      int currentRegion;\n      bool *regionVisible;\n\n      RegionInfo() : currentRegion(0), regionVisible(nullptr) {}\n    };\n\n    \/\/ DistributedRaycastRenderer definitions \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    DistributedRaycastRenderer::DistributedRaycastRenderer()\n    {\n      ispcEquivalent = ispc::DistributedRaycastRenderer_create(this);\n    }\n\n    void DistributedRaycastRenderer::commit()\n    {\n      Renderer::commit();\n      if (!dynamic_cast<DistributedModel*>(model)) {\n        throw std::runtime_error(\"DistributedRaycastRender must use a DistributedModel from \"\n                                 \"the MPIDistributedDevice\");\n      }\n    }\n\n    float DistributedRaycastRenderer::renderFrame(FrameBuffer *fb,\n                                                  const uint32 channelFlags)\n    {\n      using namespace mpicommon;\n\n      auto *dfb = dynamic_cast<DistributedFrameBuffer *>(fb);\n      dfb->setFrameMode(DistributedFrameBuffer::ALPHA_BLEND);\n      dfb->startNewFrame(errorThreshold);\n      dfb->beginFrame();\n\n      DistributedModel *distribModel = dynamic_cast<DistributedModel*>(model);\n      ispc::DistributedRaycastRenderer_setRegions(ispcEquivalent,\n          (ispc::box3f*)distribModel->myRegions.data(),\n          distribModel->myRegions.size(),\n          (ispc::box3f*)distribModel->othersRegions.data(),\n          distribModel->othersRegions.size());\n\n      const size_t numRegions = distribModel->myRegions.size()\n        + distribModel->othersRegions.size();\n\n      beginFrame(dfb);\n\n      tasking::parallel_for(dfb->getTotalTiles(), [&](int taskIndex) {\n        const size_t numTiles_x = fb->getNumTiles().x;\n        const size_t tile_y = taskIndex \/ numTiles_x;\n        const size_t tile_x = taskIndex - tile_y*numTiles_x;\n        const vec2i tileID(tile_x, tile_y);\n        const int32 accumID = fb->accumID(tileID);\n        const bool tileOwner = (taskIndex % numGlobalRanks()) == globalRank();\n\n        if (dfb->tileError(tileID) <= errorThreshold) {\n          return;\n        }\n\n        \/\/ The first 0..myRegions.size() - 1 entries are for my regions,\n        \/\/ the following entries are for other nodes regions\n        RegionInfo regionInfo;\n        regionInfo.regionVisible = STACK_BUFFER(bool, numRegions);\n        std::fill(regionInfo.regionVisible, regionInfo.regionVisible + numRegions, false);\n\n        Tile __aligned(64) tile(tileID, dfb->size, accumID);\n\n        \/\/ We use the task of rendering the first region to also fill out the block visiblility list\n        const int NUM_JOBS = (TILE_SIZE * TILE_SIZE) \/ RENDERTILE_PIXELS_PER_JOB;\n        tasking::parallel_for(NUM_JOBS, [&](int tIdx) {\n          renderTile(&regionInfo, tile, tIdx);\n        });\n\n        if (regionInfo.regionVisible[0]) {\n          tile.generation = 1;\n          tile.children = 0;\n          fb->setTile(tile);\n        }\n\n        \/\/ If we own the tile send the background color and the count of children for the\n        \/\/ number of regions projecting to it that will be sent.\n        if (tileOwner) {\n          tile.generation = 0;\n          tile.children = std::count(regionInfo.regionVisible, regionInfo.regionVisible + numRegions, true);\n          std::fill(tile.r, tile.r + TILE_SIZE * TILE_SIZE, bgColor.x);\n          std::fill(tile.g, tile.g + TILE_SIZE * TILE_SIZE, bgColor.y);\n          std::fill(tile.b, tile.b + TILE_SIZE * TILE_SIZE, bgColor.z);\n          std::fill(tile.a, tile.a + TILE_SIZE * TILE_SIZE, bgColor.w);\n          std::fill(tile.z, tile.z + TILE_SIZE * TILE_SIZE, std::numeric_limits<float>::infinity());\n          fb->setTile(tile);\n        }\n\n        \/\/ Render the rest of our regions that project to this tile and ship them off\n        tile.generation = 1;\n        tile.children = 0;\n        for (size_t bid = 1; bid < distribModel->myRegions.size(); ++bid) {\n          if (!regionInfo.regionVisible[bid]) {\n            continue;\n          }\n          regionInfo.currentRegion = bid;\n          tasking::parallel_for(NUM_JOBS, [&](int tIdx) {\n            renderTile(&regionInfo, tile, tIdx);\n          });\n          fb->setTile(tile);\n        }\n      });\n\n      dfb->waitUntilFinished();\n      endFrame(nullptr, channelFlags);\n\n      return dfb->endFrame(errorThreshold);\n    }\n\n    std::string DistributedRaycastRenderer::toString() const\n    {\n      return \"ospray::mpi::DistributedRaycastRenderer\";\n    }\n\n    OSP_REGISTER_RENDERER(DistributedRaycastRenderer, mpi_raycast);\n\n  } \/\/ ::ospray::mpi\n} \/\/ ::ospray\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    this->ct->sendMessage(new PingreqMessage());\n    gettimeofday(&(this->timeOfPing), NULL);\n    return NO_ERROR;\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    int64_t len = this->ct->sendMessage(new ConnectMessage(this->keepAlive, this->ID, this->cleanSession, this->will, this->user));\n    if (len == -1) {\n        \/\/return ; \/\/ TODO: transport error?\n    }\n    std::thread t(readLoop, this);\n    t.join();\n    this->readThread = &t;\n    return NO_ERROR;\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 (false) {\n            } \/\/ has suffix of '#' and '+'\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    case 1:\n        return this->sendMessage(new PubackMessage(m->fh->packetID));\n    case 2:\n        return this->sendMessage(new PubrecMessage(m->fh->packetID));\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    \/\/ TODO: implement duration base connection management\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>add condition<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    this->ct->sendMessage(new PingreqMessage());\n    gettimeofday(&(this->timeOfPing), NULL);\n    return NO_ERROR;\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    int64_t len = this->ct->sendMessage(new ConnectMessage(this->keepAlive, this->ID, this->cleanSession, this->will, this->user));\n    if (len == -1) {\n        \/\/return ; \/\/ TODO: transport error?\n    }\n    std::thread t(readLoop, this);\n    t.join();\n    this->readThread = &t;\n    return NO_ERROR;\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    case 1:\n        return this->sendMessage(new PubackMessage(m->fh->packetID));\n    case 2:\n        return this->sendMessage(new PubrecMessage(m->fh->packetID));\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    \/\/ TODO: implement duration base connection management\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 * Copyright (C) 2007, 2008 Apple Inc. All rights reserved.\n * Copyright (C) 2007 Staikos Computing Services Inc. <info@staikos.net>\n * Copyright (C) 2007 Trolltech ASA\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 \"PlatformScrollBar.h\"\n\n#include \"EventHandler.h\"\n#include \"FrameView.h\"\n#include \"Frame.h\"\n#include \"GraphicsContext.h\"\n#include \"IntRect.h\"\n#include \"PlatformMouseEvent.h\"\n#include \"ScrollbarTheme.h\"\n\n#include <QApplication>\n#include <QDebug>\n#include <QPainter>\n#include <QStyle>\n#include <QMenu>\n\nusing namespace std;\n\nstatic QString tr(const char* text)\n{\n    return QCoreApplication::translate(\"QWebPage\", text);\n}\n\nnamespace WebCore {\n\nPlatformScrollbar::PlatformScrollbar(ScrollbarClient* client, ScrollbarOrientation orientation, ScrollbarControlSize size\n    : Scrollbar(client, orientation, size)\n{\n}\n\nbool PlatformScrollbar::handleContextMenuEvent(const PlatformMouseEvent& event)\n{\n#ifndef QT_NO_CONTEXTMENU\n    bool horizontal = (m_orientation == HorizontalScrollbar);\n\n    QMenu menu;\n    QAction* actScrollHere = menu.addAction(tr(\"Scroll here\"));\n    menu.addSeparator();\n\n    QAction* actScrollTop = menu.addAction(horizontal ? tr(\"Left edge\") : tr(\"Top\"));\n    QAction* actScrollBottom = menu.addAction(horizontal ? tr(\"Right edge\") : tr(\"Bottom\"));\n    menu.addSeparator();\n\n    QAction* actPageUp = menu.addAction(horizontal ? tr(\"Page left\") : tr(\"Page up\"));\n    QAction* actPageDown = menu.addAction(horizontal ? tr(\"Page right\") : tr(\"Page down\"));\n    menu.addSeparator();\n\n    QAction* actScrollUp = menu.addAction(horizontal ? tr(\"Scroll left\") : tr(\"Scroll up\"));\n    QAction* actScrollDown = menu.addAction(horizontal ? tr(\"Scroll right\") : tr(\"Scroll down\"));\n\n    const QPoint globalPos = QPoint(event.globalX(), event.globalY());\n    QAction* actionSelected = menu.exec(globalPos);\n\n    if (actionSelected == 0)\n        \/* Do nothing *\/ ;\n    else if (actionSelected == actScrollHere) {\n        const QPoint pos = convertFromContainingWindow(event.pos());\n        setValue(pixelPosToRangeValue(horizontal ? pos.x() : pos.y()));\n    } else if (actionSelected == actScrollTop)\n        setValue(0);\n    else if (actionSelected == actScrollBottom)\n        setValue(m_totalSize - m_visibleSize);\n    else if (actionSelected == actPageUp)\n        scroll(horizontal ? ScrollLeft: ScrollUp, ScrollByPage, 1);\n    else if (actionSelected == actPageDown)\n        scroll(horizontal ? ScrollRight : ScrollDown, ScrollByPage, 1);\n    else if (actionSelected == actScrollUp)\n        scroll(horizontal ? ScrollLeft : ScrollUp, ScrollByLine, 1);\n    else if (actionSelected == actScrollDown)\n        scroll(horizontal ? ScrollRight : ScrollDown, ScrollByLine, 1);\n#endif \/\/ QT_NO_CONTEXTMENU\n    return true;\n}\n\nvoid PlatformScrollbar::invalidate()\n{\n    \/\/ Get the root widget.\n    ScrollView* outermostView = topLevel();\n    if (!outermostView)\n        return;\n    IntRect windowRect = convertToContainingWindow(IntRect(0, 0, width(), height()));\n    outermostView->addToDirtyRegion(windowRect);\n}\n\n}\n\n\/\/ vim: ts=4 sw=4 et\n<commit_msg>Fix Qt build bustage in PlatformScrollbarQt.cpp<commit_after>\/*\n * Copyright (C) 2007, 2008 Apple Inc. All rights reserved.\n * Copyright (C) 2007 Staikos Computing Services Inc. <info@staikos.net>\n * Copyright (C) 2007 Trolltech ASA\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 \"PlatformScrollBar.h\"\n\n#include \"EventHandler.h\"\n#include \"FrameView.h\"\n#include \"Frame.h\"\n#include \"GraphicsContext.h\"\n#include \"IntRect.h\"\n#include \"PlatformMouseEvent.h\"\n#include \"ScrollbarTheme.h\"\n\n#include <QApplication>\n#include <QDebug>\n#include <QPainter>\n#include <QStyle>\n#include <QMenu>\n\nusing namespace std;\n\nstatic QString tr(const char* text)\n{\n    return QCoreApplication::translate(\"QWebPage\", text);\n}\n\nnamespace WebCore {\n\nPlatformScrollbar::PlatformScrollbar(ScrollbarClient* client, ScrollbarOrientation orientation, ScrollbarControlSize size)\n    : Scrollbar(client, orientation, size)\n{\n}\n\nbool PlatformScrollbar::handleContextMenuEvent(const PlatformMouseEvent& event)\n{\n#ifndef QT_NO_CONTEXTMENU\n    bool horizontal = (m_orientation == HorizontalScrollbar);\n\n    QMenu menu;\n    QAction* actScrollHere = menu.addAction(tr(\"Scroll here\"));\n    menu.addSeparator();\n\n    QAction* actScrollTop = menu.addAction(horizontal ? tr(\"Left edge\") : tr(\"Top\"));\n    QAction* actScrollBottom = menu.addAction(horizontal ? tr(\"Right edge\") : tr(\"Bottom\"));\n    menu.addSeparator();\n\n    QAction* actPageUp = menu.addAction(horizontal ? tr(\"Page left\") : tr(\"Page up\"));\n    QAction* actPageDown = menu.addAction(horizontal ? tr(\"Page right\") : tr(\"Page down\"));\n    menu.addSeparator();\n\n    QAction* actScrollUp = menu.addAction(horizontal ? tr(\"Scroll left\") : tr(\"Scroll up\"));\n    QAction* actScrollDown = menu.addAction(horizontal ? tr(\"Scroll right\") : tr(\"Scroll down\"));\n\n    const QPoint globalPos = QPoint(event.globalX(), event.globalY());\n    QAction* actionSelected = menu.exec(globalPos);\n\n    if (actionSelected == 0)\n        \/* Do nothing *\/ ;\n    else if (actionSelected == actScrollHere) {\n        const QPoint pos = convertFromContainingWindow(event.pos());\n        setValue(pixelPosToRangeValue(horizontal ? pos.x() : pos.y()));\n    } else if (actionSelected == actScrollTop)\n        setValue(0);\n    else if (actionSelected == actScrollBottom)\n        setValue(m_totalSize - m_visibleSize);\n    else if (actionSelected == actPageUp)\n        scroll(horizontal ? ScrollLeft: ScrollUp, ScrollByPage, 1);\n    else if (actionSelected == actPageDown)\n        scroll(horizontal ? ScrollRight : ScrollDown, ScrollByPage, 1);\n    else if (actionSelected == actScrollUp)\n        scroll(horizontal ? ScrollLeft : ScrollUp, ScrollByLine, 1);\n    else if (actionSelected == actScrollDown)\n        scroll(horizontal ? ScrollRight : ScrollDown, ScrollByLine, 1);\n#endif \/\/ QT_NO_CONTEXTMENU\n    return true;\n}\n\nvoid PlatformScrollbar::invalidate()\n{\n    \/\/ Get the root widget.\n    ScrollView* outermostView = topLevel();\n    if (!outermostView)\n        return;\n    IntRect windowRect = convertToContainingWindow(IntRect(0, 0, width(), height()));\n    outermostView->addToDirtyRegion(windowRect);\n}\n\n}\n\n\/\/ vim: ts=4 sw=4 et\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: formattributes.cxx,v $\n *\n *  $Revision: 1.20 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 15:14:38 $\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_xmloff.hxx\"\n\n#ifndef _XMLOFF_FORMATTRIBUTES_HXX_\n#include \"formattributes.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include <xmloff\/xmluconv.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace xmloff\n{\n\/\/.........................................................................\n\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::beans;\n\n\n    \/\/=====================================================================\n    \/\/= OAttributeMetaData\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getCommonControlAttributeName(sal_Int32 _nId)\n    {\n        switch (_nId)\n        {\n            case CCA_NAME:              return \"name\";\n            case CCA_SERVICE_NAME:      return \"control-implementation\";\n            case CCA_BUTTON_TYPE:       return \"button-type\";\n            case CCA_CONTROL_ID:        return \"id\";\n            case CCA_CURRENT_SELECTED:  return \"current-selected\";\n            case CCA_CURRENT_VALUE:     return \"current-value\";\n            case CCA_DISABLED:          return \"disabled\";\n            case CCA_DROPDOWN:          return \"dropdown\";\n            case CCA_FOR:               return \"for\";\n            case CCA_IMAGE_DATA:        return \"image-data\";\n            case CCA_LABEL:             return \"label\";\n            case CCA_MAX_LENGTH:        return \"max-length\";\n            case CCA_PRINTABLE:         return \"printable\";\n            case CCA_READONLY:          return \"readonly\";\n            case CCA_SELECTED:          return \"selected\";\n            case CCA_SIZE:              return \"size\";\n            case CCA_TAB_INDEX:         return \"tab-index\";\n            case CCA_TARGET_FRAME:      return \"target-frame\";\n            case CCA_TARGET_LOCATION:   return \"href\";      \/\/ the only special thing here: TargetLocation is represented by an xlink:href attribute\n            case CCA_TAB_STOP:          return \"tab-stop\";\n            case CCA_TITLE:             return \"title\";\n            case CCA_VALUE:             return \"value\";\n            case CCA_ORIENTATION:       return \"orientation\";\n            case CCA_VISUAL_EFFECT:     return \"visual-effect\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getCommonControlAttributeName: invalid id (maybe you or-ed two flags?)!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getCommonControlAttributeNamespace(sal_Int32 _nId)\n    {\n        if (CCA_TARGET_LOCATION == _nId)\n            return XML_NAMESPACE_XLINK;\n\n        if (CCA_TARGET_FRAME == _nId)\n            return XML_NAMESPACE_OFFICE;\n\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getFormAttributeName(FormAttributes _eAttrib)\n    {\n        switch (_eAttrib)\n        {\n            case faName:                return \"name\";\n            case faServiceName:         return \"service-name\";\n            case faAction:              return \"href\";      \/\/ the only special thing here: Action is represented by an xlink:href attribute\n            case faEnctype:             return \"enctype\";\n            case faMethod:              return \"method\";\n            case faTargetFrame:         return \"target-frame\";\n            case faAllowDeletes:        return \"allow-deletes\";\n            case faAllowInserts:        return \"allow-inserts\";\n            case faAllowUpdates:        return \"allow-updates\";\n            case faApplyFilter:         return \"apply-filter\";\n            case faCommand:             return \"command\";\n            case faCommandType:         return \"command-type\";\n            case faEscapeProcessing:    return \"escape-processing\";\n            case faDatasource:          return \"datasource\";\n            case faConnectionResource:  return \"connection-resource\";\n            case faDetailFiels:         return \"detail-fields\";\n            case faFilter:              return \"filter\";\n            case faIgnoreResult:        return \"ignore-result\";\n            case faMasterFields:        return \"master-fields\";\n            case faNavigationMode:      return \"navigation-mode\";\n            case faOrder:               return \"order\";\n            case faTabbingCycle:        return \"tab-cycle\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getFormAttributeName: invalid id!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getFormAttributeNamespace(FormAttributes _eAttrib)\n    {\n        if (faAction == _eAttrib)\n            return XML_NAMESPACE_XLINK;\n\n        if (faTargetFrame == _eAttrib)\n            return XML_NAMESPACE_OFFICE;\n\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getDatabaseAttributeName(sal_Int32 _nId)\n    {\n        switch (_nId)\n        {\n            case DA_BOUND_COLUMN:       return \"bound-column\";\n            case DA_CONVERT_EMPTY:      return \"convert-empty-to-null\";\n            case DA_DATA_FIELD:         return \"data-field\";\n            case DA_LIST_SOURCE:        return \"list-source\";\n            case DA_LIST_SOURCE_TYPE:   return \"list-source-type\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getDatabaseAttributeName: invalid id (maybe you or-ed two flags?)!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getDatabaseAttributeNamespace(sal_Int32 \/*_nId*\/)\n    {\n        \/\/ nothing special here\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getBindingAttributeName(sal_Int32 _nId)\n    {\n        switch (_nId)\n        {\n            case BA_LINKED_CELL:       return \"linked-cell\";\n            case BA_LIST_LINKING_TYPE: return \"list-linkage-type\";\n            case BA_LIST_CELL_RANGE:   return \"source-cell-range\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getBindingAttributeName: invalid id (maybe you or-ed two flags?)!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getBindingAttributeNamespace(sal_Int32)\n    {\n        \/\/ nothing special here\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getSpecialAttributeName(sal_Int32 _nId)\n    {\n        switch (_nId)\n        {\n            case SCA_ECHO_CHAR:             return \"echo-char\";\n            case SCA_MAX_VALUE:             return \"max-value\";\n            case SCA_MIN_VALUE:             return \"min-value\";\n            case SCA_VALIDATION:            return \"validation\";\n            case SCA_MULTI_LINE:            return \"multi-line\";\n            case SCA_AUTOMATIC_COMPLETION:  return \"auto-complete\";\n            case SCA_MULTIPLE:              return \"multiple\";\n            case SCA_DEFAULT_BUTTON:        return \"default-button\";\n            case SCA_CURRENT_STATE:         return \"current-state\";\n            case SCA_IS_TRISTATE:           return \"is-tristate\";\n            case SCA_STATE:                 return \"state\";\n            case SCA_COLUMN_STYLE_NAME:     return \"text-style-name\";\n            case SCA_STEP_SIZE:             return \"step-size\";\n            case SCA_PAGE_STEP_SIZE:        return \"page-step-size\";\n            case SCA_REPEAT_DELAY:          return \"delay-for-repeat\";\n            case SCA_TOGGLE:                return \"toggle\";\n            case SCA_FOCUS_ON_CLICK:        return \"focus-on-click\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getSpecialAttributeName: invalid id (maybe you or-ed two flags?)!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getSpecialAttributeNamespace(sal_Int32 \/*_nId*\/)\n    {\n        \/\/ nothing special here\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getOfficeFormsAttributeName(OfficeFormsAttributes _eAttrib)\n    {\n        switch (_eAttrib)\n        {\n            case ofaAutomaticFocus:     return \"automatic-focus\";\n            case ofaApplyDesignMode:    return \"apply-design-mode\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getOfficeFormsAttributeName: invalid id!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getOfficeFormsAttributeNamespace(OfficeFormsAttributes \/* _eAttrib *\/)\n    {\n        \/\/ nothing special here\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/=====================================================================\n    \/\/= OAttribute2Property\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    OAttribute2Property::OAttribute2Property()\n    {\n    }\n\n    \/\/---------------------------------------------------------------------\n    OAttribute2Property::~OAttribute2Property()\n    {\n    }\n\n    \/\/---------------------------------------------------------------------\n    const OAttribute2Property::AttributeAssignment* OAttribute2Property::getAttributeTranslation(\n            const ::rtl::OUString& _rAttribName)\n    {\n        ConstAttributeAssignmentsIterator aPos = m_aKnownProperties.find(_rAttribName);\n        if (m_aKnownProperties.end() != aPos)\n            return &aPos->second;\n        return NULL;\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addStringProperty(\n        const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n        const sal_Char* _pAttributeDefault)\n    {\n        implAdd(_pAttributeName, _rPropertyName, ::getCppuType( static_cast< ::rtl::OUString* >(NULL) ),\n            _pAttributeDefault ? ::rtl::OUString::createFromAscii(_pAttributeDefault) : ::rtl::OUString());\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addBooleanProperty(\n        const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n        const sal_Bool _bAttributeDefault, const sal_Bool _bInverseSemantics)\n    {\n        ::rtl::OUStringBuffer aDefault;\n        SvXMLUnitConverter::convertBool(aDefault, _bAttributeDefault);\n        AttributeAssignment& aAssignment = implAdd(_pAttributeName, _rPropertyName, ::getBooleanCppuType(), aDefault.makeStringAndClear());\n        aAssignment.bInverseSemantics = _bInverseSemantics;\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addInt16Property(\n        const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n        const sal_Int16 _nAttributeDefault)\n    {\n        ::rtl::OUStringBuffer aDefault;\n        SvXMLUnitConverter::convertNumber(aDefault, (sal_Int32)_nAttributeDefault);\n        implAdd(_pAttributeName, _rPropertyName, ::getCppuType( static_cast< sal_Int16* >(NULL) ), aDefault.makeStringAndClear());\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addInt32Property(\n        const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n        const sal_Int32 _nAttributeDefault)\n    {\n        ::rtl::OUStringBuffer aDefault;\n        SvXMLUnitConverter::convertNumber( aDefault, _nAttributeDefault );\n        implAdd( _pAttributeName, _rPropertyName, ::getCppuType( static_cast< sal_Int32* >(NULL) ), aDefault.makeStringAndClear() );\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addEnumProperty(\n            const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n            const sal_uInt16 _nAttributeDefault, const SvXMLEnumMapEntry* _pValueMap,\n            const ::com::sun::star::uno::Type* _pType)\n    {\n        ::rtl::OUStringBuffer aDefault;\n        SvXMLUnitConverter::convertEnum(aDefault, _nAttributeDefault, _pValueMap);\n        AttributeAssignment& aAssignment = implAdd(_pAttributeName, _rPropertyName,\n            _pType ? *_pType : ::getCppuType( static_cast< sal_Int32* >(NULL) ),\n                \/\/ this assumes that the setPropertyValue for enums can handle int32's ....\n            aDefault.makeStringAndClear());\n        aAssignment.pEnumMap = _pValueMap;\n    }\n\n    \/\/---------------------------------------------------------------------\n    OAttribute2Property::AttributeAssignment& OAttribute2Property::implAdd(\n            const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n            const ::com::sun::star::uno::Type& _rType, const ::rtl::OUString& \/*_rDefaultString*\/)\n    {\n        OSL_ENSURE(m_aKnownProperties.end() == m_aKnownProperties.find(::rtl::OUString::createFromAscii(_pAttributeName)),\n            \"OAttribute2Property::implAdd: already have this attribute!\");\n\n        ::rtl::OUString sAttributeName = ::rtl::OUString::createFromAscii(_pAttributeName);\n\n        AttributeAssignment aAssignment;\n        aAssignment.sAttributeName = sAttributeName;\n        aAssignment.sPropertyName = _rPropertyName;\n        aAssignment.aPropertyType = _rType;\n\n        \/\/ redundance, the accessor is stored in aAssignment.sAttributeName, too\n        return m_aKnownProperties[sAttributeName] = aAssignment;\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace xmloff\n\/\/.........................................................................\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.20.162); FILE MERGED 2008\/04\/01 16:09:46 thb 1.20.162.3: #i85898# Stripping all external header guards 2008\/04\/01 13:04:50 thb 1.20.162.2: #i85898# Stripping all external header guards 2008\/03\/31 16:28:12 rt 1.20.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: formattributes.cxx,v $\n * $Revision: 1.21 $\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_xmloff.hxx\"\n#include \"formattributes.hxx\"\n#include \"xmlnmspe.hxx\"\n#include <xmloff\/xmluconv.hxx>\n#include <rtl\/ustrbuf.hxx>\n\n\/\/.........................................................................\nnamespace xmloff\n{\n\/\/.........................................................................\n\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::beans;\n\n\n    \/\/=====================================================================\n    \/\/= OAttributeMetaData\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getCommonControlAttributeName(sal_Int32 _nId)\n    {\n        switch (_nId)\n        {\n            case CCA_NAME:              return \"name\";\n            case CCA_SERVICE_NAME:      return \"control-implementation\";\n            case CCA_BUTTON_TYPE:       return \"button-type\";\n            case CCA_CONTROL_ID:        return \"id\";\n            case CCA_CURRENT_SELECTED:  return \"current-selected\";\n            case CCA_CURRENT_VALUE:     return \"current-value\";\n            case CCA_DISABLED:          return \"disabled\";\n            case CCA_DROPDOWN:          return \"dropdown\";\n            case CCA_FOR:               return \"for\";\n            case CCA_IMAGE_DATA:        return \"image-data\";\n            case CCA_LABEL:             return \"label\";\n            case CCA_MAX_LENGTH:        return \"max-length\";\n            case CCA_PRINTABLE:         return \"printable\";\n            case CCA_READONLY:          return \"readonly\";\n            case CCA_SELECTED:          return \"selected\";\n            case CCA_SIZE:              return \"size\";\n            case CCA_TAB_INDEX:         return \"tab-index\";\n            case CCA_TARGET_FRAME:      return \"target-frame\";\n            case CCA_TARGET_LOCATION:   return \"href\";      \/\/ the only special thing here: TargetLocation is represented by an xlink:href attribute\n            case CCA_TAB_STOP:          return \"tab-stop\";\n            case CCA_TITLE:             return \"title\";\n            case CCA_VALUE:             return \"value\";\n            case CCA_ORIENTATION:       return \"orientation\";\n            case CCA_VISUAL_EFFECT:     return \"visual-effect\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getCommonControlAttributeName: invalid id (maybe you or-ed two flags?)!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getCommonControlAttributeNamespace(sal_Int32 _nId)\n    {\n        if (CCA_TARGET_LOCATION == _nId)\n            return XML_NAMESPACE_XLINK;\n\n        if (CCA_TARGET_FRAME == _nId)\n            return XML_NAMESPACE_OFFICE;\n\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getFormAttributeName(FormAttributes _eAttrib)\n    {\n        switch (_eAttrib)\n        {\n            case faName:                return \"name\";\n            case faServiceName:         return \"service-name\";\n            case faAction:              return \"href\";      \/\/ the only special thing here: Action is represented by an xlink:href attribute\n            case faEnctype:             return \"enctype\";\n            case faMethod:              return \"method\";\n            case faTargetFrame:         return \"target-frame\";\n            case faAllowDeletes:        return \"allow-deletes\";\n            case faAllowInserts:        return \"allow-inserts\";\n            case faAllowUpdates:        return \"allow-updates\";\n            case faApplyFilter:         return \"apply-filter\";\n            case faCommand:             return \"command\";\n            case faCommandType:         return \"command-type\";\n            case faEscapeProcessing:    return \"escape-processing\";\n            case faDatasource:          return \"datasource\";\n            case faConnectionResource:  return \"connection-resource\";\n            case faDetailFiels:         return \"detail-fields\";\n            case faFilter:              return \"filter\";\n            case faIgnoreResult:        return \"ignore-result\";\n            case faMasterFields:        return \"master-fields\";\n            case faNavigationMode:      return \"navigation-mode\";\n            case faOrder:               return \"order\";\n            case faTabbingCycle:        return \"tab-cycle\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getFormAttributeName: invalid id!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getFormAttributeNamespace(FormAttributes _eAttrib)\n    {\n        if (faAction == _eAttrib)\n            return XML_NAMESPACE_XLINK;\n\n        if (faTargetFrame == _eAttrib)\n            return XML_NAMESPACE_OFFICE;\n\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getDatabaseAttributeName(sal_Int32 _nId)\n    {\n        switch (_nId)\n        {\n            case DA_BOUND_COLUMN:       return \"bound-column\";\n            case DA_CONVERT_EMPTY:      return \"convert-empty-to-null\";\n            case DA_DATA_FIELD:         return \"data-field\";\n            case DA_LIST_SOURCE:        return \"list-source\";\n            case DA_LIST_SOURCE_TYPE:   return \"list-source-type\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getDatabaseAttributeName: invalid id (maybe you or-ed two flags?)!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getDatabaseAttributeNamespace(sal_Int32 \/*_nId*\/)\n    {\n        \/\/ nothing special here\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getBindingAttributeName(sal_Int32 _nId)\n    {\n        switch (_nId)\n        {\n            case BA_LINKED_CELL:       return \"linked-cell\";\n            case BA_LIST_LINKING_TYPE: return \"list-linkage-type\";\n            case BA_LIST_CELL_RANGE:   return \"source-cell-range\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getBindingAttributeName: invalid id (maybe you or-ed two flags?)!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getBindingAttributeNamespace(sal_Int32)\n    {\n        \/\/ nothing special here\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getSpecialAttributeName(sal_Int32 _nId)\n    {\n        switch (_nId)\n        {\n            case SCA_ECHO_CHAR:             return \"echo-char\";\n            case SCA_MAX_VALUE:             return \"max-value\";\n            case SCA_MIN_VALUE:             return \"min-value\";\n            case SCA_VALIDATION:            return \"validation\";\n            case SCA_MULTI_LINE:            return \"multi-line\";\n            case SCA_AUTOMATIC_COMPLETION:  return \"auto-complete\";\n            case SCA_MULTIPLE:              return \"multiple\";\n            case SCA_DEFAULT_BUTTON:        return \"default-button\";\n            case SCA_CURRENT_STATE:         return \"current-state\";\n            case SCA_IS_TRISTATE:           return \"is-tristate\";\n            case SCA_STATE:                 return \"state\";\n            case SCA_COLUMN_STYLE_NAME:     return \"text-style-name\";\n            case SCA_STEP_SIZE:             return \"step-size\";\n            case SCA_PAGE_STEP_SIZE:        return \"page-step-size\";\n            case SCA_REPEAT_DELAY:          return \"delay-for-repeat\";\n            case SCA_TOGGLE:                return \"toggle\";\n            case SCA_FOCUS_ON_CLICK:        return \"focus-on-click\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getSpecialAttributeName: invalid id (maybe you or-ed two flags?)!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getSpecialAttributeNamespace(sal_Int32 \/*_nId*\/)\n    {\n        \/\/ nothing special here\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/---------------------------------------------------------------------\n    const sal_Char* OAttributeMetaData::getOfficeFormsAttributeName(OfficeFormsAttributes _eAttrib)\n    {\n        switch (_eAttrib)\n        {\n            case ofaAutomaticFocus:     return \"automatic-focus\";\n            case ofaApplyDesignMode:    return \"apply-design-mode\";\n            default:\n                OSL_ENSURE(sal_False, \"OAttributeMetaData::getOfficeFormsAttributeName: invalid id!\");\n        }\n        return \"\";\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_uInt16 OAttributeMetaData::getOfficeFormsAttributeNamespace(OfficeFormsAttributes \/* _eAttrib *\/)\n    {\n        \/\/ nothing special here\n        return XML_NAMESPACE_FORM;\n    }\n\n    \/\/=====================================================================\n    \/\/= OAttribute2Property\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    OAttribute2Property::OAttribute2Property()\n    {\n    }\n\n    \/\/---------------------------------------------------------------------\n    OAttribute2Property::~OAttribute2Property()\n    {\n    }\n\n    \/\/---------------------------------------------------------------------\n    const OAttribute2Property::AttributeAssignment* OAttribute2Property::getAttributeTranslation(\n            const ::rtl::OUString& _rAttribName)\n    {\n        ConstAttributeAssignmentsIterator aPos = m_aKnownProperties.find(_rAttribName);\n        if (m_aKnownProperties.end() != aPos)\n            return &aPos->second;\n        return NULL;\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addStringProperty(\n        const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n        const sal_Char* _pAttributeDefault)\n    {\n        implAdd(_pAttributeName, _rPropertyName, ::getCppuType( static_cast< ::rtl::OUString* >(NULL) ),\n            _pAttributeDefault ? ::rtl::OUString::createFromAscii(_pAttributeDefault) : ::rtl::OUString());\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addBooleanProperty(\n        const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n        const sal_Bool _bAttributeDefault, const sal_Bool _bInverseSemantics)\n    {\n        ::rtl::OUStringBuffer aDefault;\n        SvXMLUnitConverter::convertBool(aDefault, _bAttributeDefault);\n        AttributeAssignment& aAssignment = implAdd(_pAttributeName, _rPropertyName, ::getBooleanCppuType(), aDefault.makeStringAndClear());\n        aAssignment.bInverseSemantics = _bInverseSemantics;\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addInt16Property(\n        const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n        const sal_Int16 _nAttributeDefault)\n    {\n        ::rtl::OUStringBuffer aDefault;\n        SvXMLUnitConverter::convertNumber(aDefault, (sal_Int32)_nAttributeDefault);\n        implAdd(_pAttributeName, _rPropertyName, ::getCppuType( static_cast< sal_Int16* >(NULL) ), aDefault.makeStringAndClear());\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addInt32Property(\n        const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n        const sal_Int32 _nAttributeDefault)\n    {\n        ::rtl::OUStringBuffer aDefault;\n        SvXMLUnitConverter::convertNumber( aDefault, _nAttributeDefault );\n        implAdd( _pAttributeName, _rPropertyName, ::getCppuType( static_cast< sal_Int32* >(NULL) ), aDefault.makeStringAndClear() );\n    }\n\n    \/\/---------------------------------------------------------------------\n    void OAttribute2Property::addEnumProperty(\n            const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n            const sal_uInt16 _nAttributeDefault, const SvXMLEnumMapEntry* _pValueMap,\n            const ::com::sun::star::uno::Type* _pType)\n    {\n        ::rtl::OUStringBuffer aDefault;\n        SvXMLUnitConverter::convertEnum(aDefault, _nAttributeDefault, _pValueMap);\n        AttributeAssignment& aAssignment = implAdd(_pAttributeName, _rPropertyName,\n            _pType ? *_pType : ::getCppuType( static_cast< sal_Int32* >(NULL) ),\n                \/\/ this assumes that the setPropertyValue for enums can handle int32's ....\n            aDefault.makeStringAndClear());\n        aAssignment.pEnumMap = _pValueMap;\n    }\n\n    \/\/---------------------------------------------------------------------\n    OAttribute2Property::AttributeAssignment& OAttribute2Property::implAdd(\n            const sal_Char* _pAttributeName, const ::rtl::OUString& _rPropertyName,\n            const ::com::sun::star::uno::Type& _rType, const ::rtl::OUString& \/*_rDefaultString*\/)\n    {\n        OSL_ENSURE(m_aKnownProperties.end() == m_aKnownProperties.find(::rtl::OUString::createFromAscii(_pAttributeName)),\n            \"OAttribute2Property::implAdd: already have this attribute!\");\n\n        ::rtl::OUString sAttributeName = ::rtl::OUString::createFromAscii(_pAttributeName);\n\n        AttributeAssignment aAssignment;\n        aAssignment.sAttributeName = sAttributeName;\n        aAssignment.sPropertyName = _rPropertyName;\n        aAssignment.aPropertyType = _rType;\n\n        \/\/ redundance, the accessor is stored in aAssignment.sAttributeName, too\n        return m_aKnownProperties[sAttributeName] = aAssignment;\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace xmloff\n\/\/.........................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* MPI Add, Subtract, Word Multiply\n* (C) 1999-2010,2016 Jack Lloyd\n*     2006 Luca Piccarreta\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/internal\/mp_core.h>\n#include <botan\/internal\/mp_asmi.h>\n#include <botan\/internal\/ct_utils.h>\n#include <botan\/exceptn.h>\n#include <botan\/mem_ops.h>\n\nnamespace Botan {\n\n\/*\n* If cond == 0, does nothing.\n* If cond > 0, swaps x[0:size] with y[0:size]\n* Runs in constant time\n*\/\nvoid bigint_cnd_swap(word cnd, word x[], word y[], size_t size)\n   {\n   const word mask = CT::expand_mask(cnd);\n\n   for(size_t i = 0; i != size; ++i)\n      {\n      word a = x[i];\n      word b = y[i];\n      x[i] = CT::select(mask, b, a);\n      y[i] = CT::select(mask, a, b);\n      }\n   }\n\n\/*\n* If cond > 0 adds x[0:size] to y[0:size] and returns carry\n* Runs in constant time\n*\/\nword bigint_cnd_add(word cnd, word x[], const word y[], size_t size)\n   {\n   const word mask = CT::expand_mask(cnd);\n\n   word carry = 0;\n   for(size_t i = 0; i != size; ++i)\n      {\n      \/*\n      Here we are relying on asm version of word_add being\n      a single addcl or equivalent. Fix this.\n      *\/\n      const word z = word_add(x[i], y[i], &carry);\n      x[i] = CT::select(mask, z, x[i]);\n      }\n\n   return carry & mask;\n   }\n\n\/*\n* If cond > 0 subs x[0:size] to y[0:size] and returns borrow\n* Runs in constant time\n*\/\nword bigint_cnd_sub(word cnd, word x[], const word y[], size_t size)\n   {\n   const word mask = CT::expand_mask(cnd);\n\n   word carry = 0;\n   for(size_t i = 0; i != size; ++i)\n      {\n      const word z = word_sub(x[i], y[i], &carry);\n      x[i] = CT::select(mask, z, x[i]);\n      }\n\n   return carry & mask;\n   }\n\nvoid bigint_cnd_abs(word cnd, word x[], size_t size)\n   {\n   const word mask = CT::expand_mask(cnd);\n\n   word carry = mask & 1;\n   for(size_t i = 0; i != size; ++i)\n      {\n      const word z = word_add(~x[i], 0, &carry);\n      x[i] = CT::select(mask, z, x[i]);\n      }\n   }\n\n\/*\n* Two Operand Addition, No Carry\n*\/\nword bigint_add2_nc(word x[], size_t x_size, const word y[], size_t y_size)\n   {\n   word carry = 0;\n\n   BOTAN_ASSERT(x_size >= y_size, \"Expected sizes\");\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      carry = word8_add2(x + i, y + i, carry);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      x[i] = word_add(x[i], y[i], &carry);\n\n   for(size_t i = y_size; i != x_size; ++i)\n      x[i] = word_add(x[i], 0, &carry);\n\n   return carry;\n   }\n\n\/*\n* Three Operand Addition, No Carry\n*\/\nword bigint_add3_nc(word z[], const word x[], size_t x_size,\n                              const word y[], size_t y_size)\n   {\n   if(x_size < y_size)\n      { return bigint_add3_nc(z, y, y_size, x, x_size); }\n\n   word carry = 0;\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      carry = word8_add3(z + i, x + i, y + i, carry);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      z[i] = word_add(x[i], y[i], &carry);\n\n   for(size_t i = y_size; i != x_size; ++i)\n      z[i] = word_add(x[i], 0, &carry);\n\n   return carry;\n   }\n\n\/*\n* Two Operand Addition\n*\/\nvoid bigint_add2(word x[], size_t x_size, const word y[], size_t y_size)\n   {\n   if(bigint_add2_nc(x, x_size, y, y_size))\n      x[x_size] += 1;\n   }\n\n\/*\n* Three Operand Addition\n*\/\nvoid bigint_add3(word z[], const word x[], size_t x_size,\n                           const word y[], size_t y_size)\n   {\n   z[(x_size > y_size ? x_size : y_size)] +=\n      bigint_add3_nc(z, x, x_size, y, y_size);\n   }\n\n\/*\n* Two Operand Subtraction\n*\/\nword bigint_sub2(word x[], size_t x_size, const word y[], size_t y_size)\n   {\n   word borrow = 0;\n\n   BOTAN_ASSERT(x_size >= y_size, \"Expected sizes\");\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      borrow = word8_sub2(x + i, y + i, borrow);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      x[i] = word_sub(x[i], y[i], &borrow);\n\n   for(size_t i = y_size; i != x_size; ++i)\n      x[i] = word_sub(x[i], 0, &borrow);\n\n   return borrow;\n   }\n\n\/*\n* Two Operand Subtraction x = y - x\n*\/\nvoid bigint_sub2_rev(word x[],  const word y[], size_t y_size)\n   {\n   word borrow = 0;\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      borrow = word8_sub2_rev(x + i, y + i, borrow);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      x[i] = word_sub(y[i], x[i], &borrow);\n\n   BOTAN_ASSERT(!borrow, \"y must be greater than x\");\n   }\n\n\/*\n* Three Operand Subtraction\n*\/\nword bigint_sub3(word z[], const word x[], size_t x_size,\n                           const word y[], size_t y_size)\n   {\n   word borrow = 0;\n\n   BOTAN_ASSERT(x_size >= y_size, \"Expected sizes\");\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      borrow = word8_sub3(z + i, x + i, y + i, borrow);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      z[i] = word_sub(x[i], y[i], &borrow);\n\n   for(size_t i = y_size; i != x_size; ++i)\n      z[i] = word_sub(x[i], 0, &borrow);\n\n   return borrow;\n   }\n\n\/*\n* Two Operand Linear Multiply\n*\/\nvoid bigint_linmul2(word x[], size_t x_size, word y)\n   {\n   const size_t blocks = x_size - (x_size % 8);\n\n   word carry = 0;\n\n   for(size_t i = 0; i != blocks; i += 8)\n      carry = word8_linmul2(x + i, y, carry);\n\n   for(size_t i = blocks; i != x_size; ++i)\n      x[i] = word_madd2(x[i], y, &carry);\n\n   x[x_size] = carry;\n   }\n\n\/*\n* Three Operand Linear Multiply\n*\/\nvoid bigint_linmul3(word z[], const word x[], size_t x_size, word y)\n   {\n   const size_t blocks = x_size - (x_size % 8);\n\n   word carry = 0;\n\n   for(size_t i = 0; i != blocks; i += 8)\n      carry = word8_linmul3(z + i, x + i, y, carry);\n\n   for(size_t i = blocks; i != x_size; ++i)\n      z[i] = word_madd2(x[i], y, &carry);\n\n   z[x_size] = carry;\n   }\n\n\/*\n* Single Operand Left Shift\n*\/\nvoid bigint_shl1(word x[], size_t x_size, size_t word_shift, size_t bit_shift)\n   {\n   if(word_shift)\n      {\n      copy_mem(x + word_shift, x, x_size);\n      clear_mem(x, word_shift);\n      }\n\n   if(bit_shift)\n      {\n      word carry = 0;\n      for(size_t j = word_shift; j != x_size + word_shift + 1; ++j)\n         {\n         word temp = x[j];\n         x[j] = (temp << bit_shift) | carry;\n         carry = (temp >> (MP_WORD_BITS - bit_shift));\n         }\n      }\n   }\n\n\/*\n* Single Operand Right Shift\n*\/\nvoid bigint_shr1(word x[], size_t x_size, size_t word_shift, size_t bit_shift)\n   {\n   if(x_size < word_shift)\n      {\n      clear_mem(x, x_size);\n      return;\n      }\n\n   if(word_shift)\n      {\n      copy_mem(x, x + word_shift, x_size - word_shift);\n      clear_mem(x + x_size - word_shift, word_shift);\n      }\n\n   if(bit_shift)\n      {\n      word carry = 0;\n\n      size_t top = x_size - word_shift;\n\n      while(top >= 4)\n         {\n         word w = x[top-1];\n         x[top-1] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         w = x[top-2];\n         x[top-2] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         w = x[top-3];\n         x[top-3] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         w = x[top-4];\n         x[top-4] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         top -= 4;\n         }\n\n      while(top)\n         {\n         word w = x[top-1];\n         x[top-1] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         top--;\n         }\n      }\n   }\n\n\/*\n* Two Operand Left Shift\n*\/\nvoid bigint_shl2(word y[], const word x[], size_t x_size,\n                 size_t word_shift, size_t bit_shift)\n   {\n   for(size_t j = 0; j != x_size; ++j)\n      y[j + word_shift] = x[j];\n   if(bit_shift)\n      {\n      word carry = 0;\n      for(size_t j = word_shift; j != x_size + word_shift + 1; ++j)\n         {\n         word w = y[j];\n         y[j] = (w << bit_shift) | carry;\n         carry = (w >> (MP_WORD_BITS - bit_shift));\n         }\n      }\n   }\n\n\/*\n* Two Operand Right Shift\n*\/\nvoid bigint_shr2(word y[], const word x[], size_t x_size,\n                 size_t word_shift, size_t bit_shift)\n   {\n   if(x_size < word_shift) return;\n\n   for(size_t j = 0; j != x_size - word_shift; ++j)\n      y[j] = x[j + word_shift];\n   if(bit_shift)\n      {\n      word carry = 0;\n      for(size_t j = x_size - word_shift; j > 0; --j)\n         {\n         word w = y[j-1];\n         y[j-1] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n         }\n      }\n   }\n\n\/*\n* Compare two MP integers\n*\/\nint32_t bigint_cmp(const word x[], size_t x_size,\n                  const word y[], size_t y_size)\n   {\n   if(x_size < y_size) { return (-bigint_cmp(y, y_size, x, x_size)); }\n\n   while(x_size > y_size)\n      {\n      if(x[x_size-1])\n         return 1;\n      x_size--;\n      }\n\n   for(size_t i = x_size; i > 0; --i)\n      {\n      if(x[i-1] > y[i-1])\n         return 1;\n      if(x[i-1] < y[i-1])\n         return -1;\n      }\n\n   return 0;\n   }\n\n\/*\n* Do a 2-word\/1-word Division\n*\/\nword bigint_divop(word n1, word n0, word d)\n   {\n   if(d == 0)\n      throw Invalid_Argument(\"bigint_divop divide by zero\");\n\n   word high = n1 % d, quotient = 0;\n\n   for(size_t i = 0; i != MP_WORD_BITS; ++i)\n      {\n      word high_top_bit = (high & MP_WORD_TOP_BIT);\n\n      high <<= 1;\n      high |= (n0 >> (MP_WORD_BITS-1-i)) & 1;\n      quotient <<= 1;\n\n      if(high_top_bit || high >= d)\n         {\n         high -= d;\n         quotient |= 1;\n         }\n      }\n\n   return quotient;\n   }\n\n\/*\n* Do a 2-word\/1-word Modulo\n*\/\nword bigint_modop(word n1, word n0, word d)\n   {\n   word z = bigint_divop(n1, n0, d);\n   word dummy = 0;\n   z = word_madd2(z, d, &dummy);\n   return (n0-z);\n   }\n\n}\n<commit_msg>Use dword for bigint_divop if available<commit_after>\/*\n* MPI Add, Subtract, Word Multiply\n* (C) 1999-2010,2016 Jack Lloyd\n*     2006 Luca Piccarreta\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/internal\/mp_core.h>\n#include <botan\/internal\/mp_asmi.h>\n#include <botan\/internal\/ct_utils.h>\n#include <botan\/exceptn.h>\n#include <botan\/mem_ops.h>\n\nnamespace Botan {\n\n\/*\n* If cond == 0, does nothing.\n* If cond > 0, swaps x[0:size] with y[0:size]\n* Runs in constant time\n*\/\nvoid bigint_cnd_swap(word cnd, word x[], word y[], size_t size)\n   {\n   const word mask = CT::expand_mask(cnd);\n\n   for(size_t i = 0; i != size; ++i)\n      {\n      word a = x[i];\n      word b = y[i];\n      x[i] = CT::select(mask, b, a);\n      y[i] = CT::select(mask, a, b);\n      }\n   }\n\n\/*\n* If cond > 0 adds x[0:size] to y[0:size] and returns carry\n* Runs in constant time\n*\/\nword bigint_cnd_add(word cnd, word x[], const word y[], size_t size)\n   {\n   const word mask = CT::expand_mask(cnd);\n\n   word carry = 0;\n   for(size_t i = 0; i != size; ++i)\n      {\n      \/*\n      Here we are relying on asm version of word_add being\n      a single addcl or equivalent. Fix this.\n      *\/\n      const word z = word_add(x[i], y[i], &carry);\n      x[i] = CT::select(mask, z, x[i]);\n      }\n\n   return carry & mask;\n   }\n\n\/*\n* If cond > 0 subs x[0:size] to y[0:size] and returns borrow\n* Runs in constant time\n*\/\nword bigint_cnd_sub(word cnd, word x[], const word y[], size_t size)\n   {\n   const word mask = CT::expand_mask(cnd);\n\n   word carry = 0;\n   for(size_t i = 0; i != size; ++i)\n      {\n      const word z = word_sub(x[i], y[i], &carry);\n      x[i] = CT::select(mask, z, x[i]);\n      }\n\n   return carry & mask;\n   }\n\nvoid bigint_cnd_abs(word cnd, word x[], size_t size)\n   {\n   const word mask = CT::expand_mask(cnd);\n\n   word carry = mask & 1;\n   for(size_t i = 0; i != size; ++i)\n      {\n      const word z = word_add(~x[i], 0, &carry);\n      x[i] = CT::select(mask, z, x[i]);\n      }\n   }\n\n\/*\n* Two Operand Addition, No Carry\n*\/\nword bigint_add2_nc(word x[], size_t x_size, const word y[], size_t y_size)\n   {\n   word carry = 0;\n\n   BOTAN_ASSERT(x_size >= y_size, \"Expected sizes\");\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      carry = word8_add2(x + i, y + i, carry);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      x[i] = word_add(x[i], y[i], &carry);\n\n   for(size_t i = y_size; i != x_size; ++i)\n      x[i] = word_add(x[i], 0, &carry);\n\n   return carry;\n   }\n\n\/*\n* Three Operand Addition, No Carry\n*\/\nword bigint_add3_nc(word z[], const word x[], size_t x_size,\n                              const word y[], size_t y_size)\n   {\n   if(x_size < y_size)\n      { return bigint_add3_nc(z, y, y_size, x, x_size); }\n\n   word carry = 0;\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      carry = word8_add3(z + i, x + i, y + i, carry);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      z[i] = word_add(x[i], y[i], &carry);\n\n   for(size_t i = y_size; i != x_size; ++i)\n      z[i] = word_add(x[i], 0, &carry);\n\n   return carry;\n   }\n\n\/*\n* Two Operand Addition\n*\/\nvoid bigint_add2(word x[], size_t x_size, const word y[], size_t y_size)\n   {\n   if(bigint_add2_nc(x, x_size, y, y_size))\n      x[x_size] += 1;\n   }\n\n\/*\n* Three Operand Addition\n*\/\nvoid bigint_add3(word z[], const word x[], size_t x_size,\n                           const word y[], size_t y_size)\n   {\n   z[(x_size > y_size ? x_size : y_size)] +=\n      bigint_add3_nc(z, x, x_size, y, y_size);\n   }\n\n\/*\n* Two Operand Subtraction\n*\/\nword bigint_sub2(word x[], size_t x_size, const word y[], size_t y_size)\n   {\n   word borrow = 0;\n\n   BOTAN_ASSERT(x_size >= y_size, \"Expected sizes\");\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      borrow = word8_sub2(x + i, y + i, borrow);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      x[i] = word_sub(x[i], y[i], &borrow);\n\n   for(size_t i = y_size; i != x_size; ++i)\n      x[i] = word_sub(x[i], 0, &borrow);\n\n   return borrow;\n   }\n\n\/*\n* Two Operand Subtraction x = y - x\n*\/\nvoid bigint_sub2_rev(word x[],  const word y[], size_t y_size)\n   {\n   word borrow = 0;\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      borrow = word8_sub2_rev(x + i, y + i, borrow);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      x[i] = word_sub(y[i], x[i], &borrow);\n\n   BOTAN_ASSERT(!borrow, \"y must be greater than x\");\n   }\n\n\/*\n* Three Operand Subtraction\n*\/\nword bigint_sub3(word z[], const word x[], size_t x_size,\n                           const word y[], size_t y_size)\n   {\n   word borrow = 0;\n\n   BOTAN_ASSERT(x_size >= y_size, \"Expected sizes\");\n\n   const size_t blocks = y_size - (y_size % 8);\n\n   for(size_t i = 0; i != blocks; i += 8)\n      borrow = word8_sub3(z + i, x + i, y + i, borrow);\n\n   for(size_t i = blocks; i != y_size; ++i)\n      z[i] = word_sub(x[i], y[i], &borrow);\n\n   for(size_t i = y_size; i != x_size; ++i)\n      z[i] = word_sub(x[i], 0, &borrow);\n\n   return borrow;\n   }\n\n\/*\n* Two Operand Linear Multiply\n*\/\nvoid bigint_linmul2(word x[], size_t x_size, word y)\n   {\n   const size_t blocks = x_size - (x_size % 8);\n\n   word carry = 0;\n\n   for(size_t i = 0; i != blocks; i += 8)\n      carry = word8_linmul2(x + i, y, carry);\n\n   for(size_t i = blocks; i != x_size; ++i)\n      x[i] = word_madd2(x[i], y, &carry);\n\n   x[x_size] = carry;\n   }\n\n\/*\n* Three Operand Linear Multiply\n*\/\nvoid bigint_linmul3(word z[], const word x[], size_t x_size, word y)\n   {\n   const size_t blocks = x_size - (x_size % 8);\n\n   word carry = 0;\n\n   for(size_t i = 0; i != blocks; i += 8)\n      carry = word8_linmul3(z + i, x + i, y, carry);\n\n   for(size_t i = blocks; i != x_size; ++i)\n      z[i] = word_madd2(x[i], y, &carry);\n\n   z[x_size] = carry;\n   }\n\n\/*\n* Single Operand Left Shift\n*\/\nvoid bigint_shl1(word x[], size_t x_size, size_t word_shift, size_t bit_shift)\n   {\n   if(word_shift)\n      {\n      copy_mem(x + word_shift, x, x_size);\n      clear_mem(x, word_shift);\n      }\n\n   if(bit_shift)\n      {\n      word carry = 0;\n      for(size_t j = word_shift; j != x_size + word_shift + 1; ++j)\n         {\n         word temp = x[j];\n         x[j] = (temp << bit_shift) | carry;\n         carry = (temp >> (MP_WORD_BITS - bit_shift));\n         }\n      }\n   }\n\n\/*\n* Single Operand Right Shift\n*\/\nvoid bigint_shr1(word x[], size_t x_size, size_t word_shift, size_t bit_shift)\n   {\n   if(x_size < word_shift)\n      {\n      clear_mem(x, x_size);\n      return;\n      }\n\n   if(word_shift)\n      {\n      copy_mem(x, x + word_shift, x_size - word_shift);\n      clear_mem(x + x_size - word_shift, word_shift);\n      }\n\n   if(bit_shift)\n      {\n      word carry = 0;\n\n      size_t top = x_size - word_shift;\n\n      while(top >= 4)\n         {\n         word w = x[top-1];\n         x[top-1] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         w = x[top-2];\n         x[top-2] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         w = x[top-3];\n         x[top-3] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         w = x[top-4];\n         x[top-4] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         top -= 4;\n         }\n\n      while(top)\n         {\n         word w = x[top-1];\n         x[top-1] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n\n         top--;\n         }\n      }\n   }\n\n\/*\n* Two Operand Left Shift\n*\/\nvoid bigint_shl2(word y[], const word x[], size_t x_size,\n                 size_t word_shift, size_t bit_shift)\n   {\n   for(size_t j = 0; j != x_size; ++j)\n      y[j + word_shift] = x[j];\n   if(bit_shift)\n      {\n      word carry = 0;\n      for(size_t j = word_shift; j != x_size + word_shift + 1; ++j)\n         {\n         word w = y[j];\n         y[j] = (w << bit_shift) | carry;\n         carry = (w >> (MP_WORD_BITS - bit_shift));\n         }\n      }\n   }\n\n\/*\n* Two Operand Right Shift\n*\/\nvoid bigint_shr2(word y[], const word x[], size_t x_size,\n                 size_t word_shift, size_t bit_shift)\n   {\n   if(x_size < word_shift) return;\n\n   for(size_t j = 0; j != x_size - word_shift; ++j)\n      y[j] = x[j + word_shift];\n   if(bit_shift)\n      {\n      word carry = 0;\n      for(size_t j = x_size - word_shift; j > 0; --j)\n         {\n         word w = y[j-1];\n         y[j-1] = (w >> bit_shift) | carry;\n         carry = (w << (MP_WORD_BITS - bit_shift));\n         }\n      }\n   }\n\n\/*\n* Compare two MP integers\n*\/\nint32_t bigint_cmp(const word x[], size_t x_size,\n                  const word y[], size_t y_size)\n   {\n   if(x_size < y_size) { return (-bigint_cmp(y, y_size, x, x_size)); }\n\n   while(x_size > y_size)\n      {\n      if(x[x_size-1])\n         return 1;\n      x_size--;\n      }\n\n   for(size_t i = x_size; i > 0; --i)\n      {\n      if(x[i-1] > y[i-1])\n         return 1;\n      if(x[i-1] < y[i-1])\n         return -1;\n      }\n\n   return 0;\n   }\n\n\/*\n* Do a 2-word\/1-word Division\n*\/\nword bigint_divop(word n1, word n0, word d)\n   {\n   if(d == 0)\n      throw Invalid_Argument(\"bigint_divop divide by zero\");\n\n#if defined(BOTAN_HAS_MP_DWORD)\n   return ((static_cast<dword>(n1) << MP_WORD_BITS) | n0) \/ d;\n#else\n\n   word high = n1 % d, quotient = 0;\n\n   for(size_t i = 0; i != MP_WORD_BITS; ++i)\n      {\n      word high_top_bit = (high & MP_WORD_TOP_BIT);\n\n      high <<= 1;\n      high |= (n0 >> (MP_WORD_BITS-1-i)) & 1;\n      quotient <<= 1;\n\n      if(high_top_bit || high >= d)\n         {\n         high -= d;\n         quotient |= 1;\n         }\n      }\n\n   return quotient;\n#endif\n   }\n\n\/*\n* Do a 2-word\/1-word Modulo\n*\/\nword bigint_modop(word n1, word n0, word d)\n   {\n   word z = bigint_divop(n1, n0, d);\n   word dummy = 0;\n   z = word_madd2(z, d, &dummy);\n   return (n0-z);\n   }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2015-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 \"medialibrary\/IMediaLibrary.h\"\n#include \"mocks\/NoopCallback.h\"\n\n#include <iostream>\n#include <condition_variable>\n#include <mutex>\n\nint main( int argc, char** argv )\n{\n    if ( argc < 2 )\n    {\n        std::cerr << \"usage: \" << argv[0] << \" <entrypoint>\" << std::endl;\n        return 1;\n    }\n\n    for ( auto i = 0; i < 1000; ++i )\n    {\n        auto testCb = std::make_unique<mock::NoopCallback>();\n        std::unique_ptr<medialibrary::IMediaLibrary> ml( NewMediaLibrary() );\n        ml->initialize( \"\/tmp\/test.db\", \"\/tmp\/ml_folder\", testCb.get() );\n        ml->start();\n        ml->discover( argv[1] );\n        ml->reload();\n    }\n    return 0;\n}\n<commit_msg>tests: fast_teardown: Ensure the discoverer thread is started<commit_after>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2015-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 \"medialibrary\/IMediaLibrary.h\"\n#include \"mocks\/NoopCallback.h\"\n#include \"utils\/Filename.h\"\n#include \"compat\/Mutex.h\"\n#include \"compat\/ConditionVariable.h\"\n\n#include <iostream>\n#include <unistd.h>\n\nclass FastTearDownCb : public mock::NoopCallback\n{\npublic:\n    FastTearDownCb()\n        : m_started( false )\n    {\n    }\n\n    void prepareWait()\n    {\n        m_mutex.lock();\n        m_started = false;\n    }\n\n    virtual void onDiscoveryProgress( const std::string& ) override\n    {\n        {\n            std::lock_guard<compat::Mutex> lock( m_mutex );\n            m_started = true;\n        }\n        m_cond.notify_all();\n    }\n\n    void waitForDiscoveryStarted()\n    {\n        std::unique_lock<compat::Mutex> lock( m_mutex, std::adopt_lock );\n        m_cond.wait_for( lock, std::chrono::seconds{ 5 }, [this](){\n            return m_started == true;\n        });\n    }\n\nprivate:\n    compat::Mutex m_mutex;\n    compat::ConditionVariable m_cond;\n    bool m_started;\n};\n\nint main( int argc, char** argv )\n{\n    if ( argc < 2 )\n    {\n        std::cerr << \"usage: \" << argv[0] << \" <entrypoint>\" << std::endl;\n        return 1;\n    }\n    auto entryPoint = utils::file::toMrl( argv[1] );\n\n    for ( auto i = 0; i < 1000; ++i )\n    {\n        auto testCb = std::make_unique<FastTearDownCb>();\n        std::unique_ptr<medialibrary::IMediaLibrary> ml( NewMediaLibrary() );\n        ml->initialize( \"\/tmp\/test.db\", \"\/tmp\/ml_folder\", testCb.get() );\n        testCb->prepareWait();\n        ml->start();\n        ml->discover( entryPoint );\n        ml->reload();\n        testCb->waitForDiscoveryStarted();\n    }\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * HLLib\r\n * Copyright (C) 2006-2010 Ryan Gregg\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\r\n * version.\r\n *\/\r\n\r\n#include \"HLLib.h\"\r\n#include \"BSPFile.h\"\r\n#include \"Streams.h\"\r\n\r\nusing namespace HLLib;\r\n\r\n#define HL_BSP_LUMP_ENTITIES\t\t0\r\n#define HL_BSP_LUMP_TEXTUREDATA\t\t2\r\n#define HL_BSP_MIPMAP_COUNT\t\t\t4\r\n\r\nconst char *CBSPFile::lpAttributeNames[] = { \"Version\" };\r\nconst char *CBSPFile::lpItemAttributeNames[] = { \"Width\", \"Height\", \"Palette Entries\" };\r\n\r\nCBSPFile::CBSPFile() : CPackage(), pHeaderView(0), pTextureView(0), pHeader(0), pTextureHeader(0)\r\n{\r\n\r\n}\r\n\r\nCBSPFile::~CBSPFile()\r\n{\r\n\tthis->Close();\r\n}\r\n\r\nHLPackageType CBSPFile::GetType() const\r\n{\r\n\treturn HL_PACKAGE_BSP;\r\n}\r\n\r\nconst hlChar *CBSPFile::GetExtension() const\r\n{\r\n\treturn \"bsp\";\r\n}\r\n\r\nconst hlChar *CBSPFile::GetDescription() const\r\n{\r\n\treturn \"Half-Life Level\";\r\n}\r\n\r\nhlBool CBSPFile::MapDataStructures()\r\n{\r\n\tif(sizeof(BSPHeader) > this->pMapping->GetMappingSize())\r\n\t{\r\n\t\tLastError.SetErrorMessage(\"Invalid file: the file map is too small for it's header.\");\r\n\t\treturn hlFalse;\r\n\t}\r\n\r\n\tif(!this->pMapping->Map(this->pHeaderView, 0, sizeof(BSPHeader)))\r\n\t{\r\n\t\treturn hlFalse;\r\n\t}\r\n\tthis->pHeader = static_cast<const BSPHeader *>(this->pHeaderView->GetView());\r\n\r\n\tif(this->pHeader->uiVersion != 30)\r\n\t{\r\n\t\tLastError.SetErrorMessageFormated(\"Invalid BSP version (v%u): you have a version of a BSP file that HLLib does not know how to read. Check for product updates.\", this->pHeader->uiVersion);\r\n\t\treturn hlFalse;\r\n\t}\r\n\r\n\tif(!this->pMapping->Map(this->pTextureView, this->pHeader->lpLumps[HL_BSP_LUMP_TEXTUREDATA].uiOffset, this->pHeader->lpLumps[HL_BSP_LUMP_TEXTUREDATA].uiLength))\r\n\t{\r\n\t\treturn hlFalse;\r\n\t}\r\n\tthis->pTextureHeader = static_cast<const BSPTextureHeader *>(this->pTextureView->GetView());\r\n\r\n\treturn hlTrue;\r\n}\r\n\r\nhlVoid CBSPFile::UnmapDataStructures()\r\n{\r\n\tthis->pTextureHeader = 0;\r\n\tthis->pMapping->Unmap(this->pTextureView);\r\n\r\n\tthis->pHeader = 0;\r\n\tthis->pMapping->Unmap(this->pHeaderView);\r\n}\r\n\r\nCDirectoryFolder *CBSPFile::CreateRoot()\r\n{\r\n\tCDirectoryFolder *pRoot = new CDirectoryFolder(this);\r\n\r\n\thlChar lpFileName[256];\r\n\r\n\tif(this->pHeader->lpLumps[HL_BSP_LUMP_ENTITIES].uiLength != 0)\r\n\t{\r\n\t\tthis->GetFileName(lpFileName, sizeof(lpFileName) - 4);\r\n\t\tif(*lpFileName == '\\0')\r\n\t\t{\r\n\t\t\tpRoot->AddFile(\"entities.ent\", this->pTextureHeader->uiTextureCount);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tstrcat(lpFileName, \".ent\");\r\n\t\t\tpRoot->AddFile(lpFileName, this->pTextureHeader->uiTextureCount);\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ Loop through each texture in the BSP file.\r\n\tfor(hlUInt i = 0; i < this->pTextureHeader->uiTextureCount; i++)\r\n\t{\r\n\t\tif(this->pTextureHeader->lpOffsets[i] == -1)\r\n\t\t{\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\tconst BSPTexture *pTexture = (const BSPTexture *)((const hlByte *)this->pTextureHeader + this->pTextureHeader->lpOffsets[i]);\r\n\r\n\t\tif(pTexture->lpOffsets[0] == 0)\r\n\t\t{\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\tsprintf(lpFileName, \"%s.bmp\", pTexture->lpName);\r\n\r\n\t\t\/\/ Add the lump as a bitmap.\r\n\t\tpRoot->AddFile(lpFileName, i);\r\n\t}\r\n\r\n\treturn pRoot;\r\n}\r\n\r\nhlUInt CBSPFile::GetAttributeCountInternal() const\r\n{\r\n\treturn HL_BSP_PACKAGE_COUNT;\r\n}\r\n\r\nconst hlChar *CBSPFile::GetAttributeNameInternal(HLPackageAttribute eAttribute) const\r\n{\r\n\tif(eAttribute < HL_BSP_PACKAGE_COUNT)\r\n\t{\r\n\t\treturn this->lpAttributeNames[eAttribute];\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n\r\nhlBool CBSPFile::GetAttributeInternal(HLPackageAttribute eAttribute, HLAttribute &Attribute) const\r\n{\r\n\tswitch(eAttribute)\r\n\t{\r\n\tcase HL_BSP_PACKAGE_VERSION:\r\n\t\thlAttributeSetUnsignedInteger(&Attribute, this->lpAttributeNames[eAttribute], this->pHeader->uiVersion, hlFalse);\r\n\t\treturn hlTrue;\r\n\tdefault:\r\n\t\treturn hlFalse;\r\n\t}\r\n}\r\n\r\nhlUInt CBSPFile::GetItemAttributeCountInternal() const\r\n{\r\n\treturn HL_BSP_ITEM_COUNT;\r\n}\r\n\r\nconst hlChar *CBSPFile::GetItemAttributeNameInternal(HLPackageAttribute eAttribute) const\r\n{\r\n\tif(eAttribute < HL_BSP_ITEM_COUNT)\r\n\t{\r\n\t\treturn this->lpItemAttributeNames[eAttribute];\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n\r\nhlBool CBSPFile::GetItemAttributeInternal(const CDirectoryItem *pItem, HLPackageAttribute eAttribute, HLAttribute &Attribute) const\r\n{\r\n\tswitch(pItem->GetType())\r\n\t{\r\n\t\tcase HL_ITEM_FILE:\r\n\t\t{\r\n\t\t\tconst CDirectoryFile *pFile = static_cast<const CDirectoryFile *>(pItem);\r\n\t\t\tif(pFile->GetID() < this->pTextureHeader->uiTextureCount)\r\n\t\t\t{\r\n\t\t\t\tswitch(eAttribute)\r\n\t\t\t\t{\r\n\t\t\t\t\tcase HL_BSP_ITEM_WIDTH:\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\thlUInt uiWidth = 0, uiHeight = 0, uiPaletteSize = 0;\r\n\t\t\t\t\t\tthis->GetLumpInfo(*pFile, uiWidth, uiHeight, uiPaletteSize, hlFalse);\r\n\t\t\t\t\t\thlAttributeSetUnsignedInteger(&Attribute, this->lpItemAttributeNames[eAttribute], uiWidth, hlFalse);\r\n\t\t\t\t\t\treturn hlTrue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tcase HL_BSP_ITEM_HEIGHT:\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\thlUInt uiWidth = 0, uiHeight = 0, uiPaletteSize = 0;\r\n\t\t\t\t\t\tthis->GetLumpInfo(*pFile, uiWidth, uiHeight, uiPaletteSize, hlFalse);\r\n\t\t\t\t\t\thlAttributeSetUnsignedInteger(&Attribute, this->lpItemAttributeNames[eAttribute], uiHeight, hlFalse);\r\n\t\t\t\t\t\treturn hlTrue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tcase HL_BSP_ITEM_PALETTE_ENTRIES:\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\thlUInt uiWidth = 0, uiHeight = 0, uiPaletteSize = 0;\r\n\t\t\t\t\t\tthis->GetLumpInfo(*pFile, uiWidth, uiHeight, uiPaletteSize, hlFalse);\r\n\t\t\t\t\t\thlAttributeSetUnsignedInteger(&Attribute, this->lpItemAttributeNames[eAttribute], uiPaletteSize, hlFalse);\r\n\t\t\t\t\t\treturn hlTrue;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\treturn hlFalse;\r\n}\r\n\r\nhlBool CBSPFile::GetFileSizeInternal(const CDirectoryFile *pFile, hlUInt &uiSize) const\r\n{\r\n\tif(pFile->GetID() < this->pTextureHeader->uiTextureCount)\r\n\t{\r\n\t\thlUInt uiWidth, uiHeight, uiPaletteSize;\r\n\t\tif(!this->GetLumpInfo(*pFile, uiWidth, uiHeight, uiPaletteSize))\r\n\t\t{\r\n\t\t\treturn hlFalse;\r\n\t\t}\r\n\r\n\t\tuiSize = sizeof(BITMAPFILEHEADER) + sizeof(BITMAPINFOHEADER) + uiPaletteSize * 4 + uiWidth * uiHeight;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tuiSize = this->pHeader->lpLumps[HL_BSP_LUMP_ENTITIES].uiLength - 1;\r\n\t}\r\n\r\n\treturn hlTrue;\r\n}\r\n\r\nhlBool CBSPFile::GetFileSizeOnDiskInternal(const CDirectoryFile *pFile, hlUInt &uiSize) const\r\n{\r\n\tif(pFile->GetID() < this->pTextureHeader->uiTextureCount)\r\n\t{\r\n\t\thlUInt uiWidth, uiHeight, uiPaletteSize;\r\n\t\tif(!this->GetLumpInfo(*pFile, uiWidth, uiHeight, uiPaletteSize))\r\n\t\t{\r\n\t\t\treturn hlFalse;\r\n\t\t}\r\n\r\n\t\thlUInt uiPixelSize = 0;\r\n\t\tfor(hlUInt i = 0; i < HL_BSP_MIPMAP_COUNT; i++)\r\n\t\t{\r\n\t\t\t\/\/if(pTexture->lpOffsets[i] != 0)\r\n\t\t\t{\r\n\t\t\t\tuiPixelSize += (uiWidth >> i) * (uiHeight >> i);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tuiSize = sizeof(BSPTexture) + uiPixelSize + sizeof(hlUInt16) + uiPaletteSize * 3;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tuiSize = this->pHeader->lpLumps[HL_BSP_LUMP_ENTITIES].uiLength - 1;\r\n\t}\r\n\r\n\treturn hlTrue;\r\n}\r\n\r\nhlBool CBSPFile::CreateStreamInternal(const CDirectoryFile *pFile, Streams::IStream *&pStream) const\r\n{\r\n\tif(pFile->GetID() < this->pTextureHeader->uiTextureCount)\r\n\t{\r\n\t\thlUInt uiWidth, uiHeight, uiPaletteSize;\r\n\t\tconst hlByte *lpPalette, *lpPixels;\r\n\r\n\t\tif(!this->GetLumpInfo(*pFile, uiWidth, uiHeight, uiPaletteSize, lpPalette, lpPixels))\r\n\t\t{\r\n\t\t\treturn hlFalse;\r\n\t\t}\r\n\r\n\t\thlUInt uiBufferSize = sizeof(BITMAPFILEHEADER) + sizeof(BITMAPINFOHEADER) + uiPaletteSize * 4 + uiWidth * uiHeight;\r\n\t\thlByte *lpBuffer = new hlByte[uiBufferSize];\r\n\r\n\t\t\/\/\r\n\t\t\/\/ Allocate data.\r\n\t\t\/\/\r\n\r\n\t\tBITMAPFILEHEADER *pFileHeader = (BITMAPFILEHEADER *)lpBuffer;\r\n\t\tBITMAPINFOHEADER *pInfoHeader = (BITMAPINFOHEADER *)((hlByte *)pFileHeader + sizeof(BITMAPFILEHEADER));\r\n\t\thlByte *lpPaletteData = (hlByte *)pInfoHeader + sizeof(BITMAPINFOHEADER);\r\n\t\thlByte *lpPixelData = lpPaletteData + uiPaletteSize * 4;\r\n\r\n\t\tmemset(pFileHeader, 0, sizeof(BITMAPFILEHEADER));\r\n\t\tmemset(pInfoHeader, 0, sizeof(BITMAPINFOHEADER));\r\n\r\n\t\t\/\/\r\n\t\t\/\/ Fill in headers.\r\n\t\t\/\/\r\n\r\n\t\tpFileHeader->bfType = ('M' << 8) | 'B';\r\n\t\tpFileHeader->bfSize = sizeof(BITMAPFILEHEADER) + sizeof(BITMAPINFOHEADER) + uiPaletteSize * 4 + uiWidth * uiHeight;\r\n\t\tpFileHeader->bfOffBits = sizeof(BITMAPFILEHEADER) + sizeof(BITMAPINFOHEADER) + uiPaletteSize * 4;\r\n\r\n\t\tpInfoHeader->biSize = sizeof(BITMAPINFOHEADER);\r\n\t\tpInfoHeader->biWidth = uiWidth;\r\n\t\tpInfoHeader->biHeight = uiHeight;\r\n\t\tpInfoHeader->biPlanes = 1;\r\n\t\tpInfoHeader->biBitCount = 8;\r\n\t\tpInfoHeader->biSizeImage = 0;\r\n\t\tpInfoHeader->biClrUsed = uiPaletteSize;\r\n\t\tpInfoHeader->biClrImportant = uiPaletteSize;\r\n\r\n\t\t\/\/\r\n\t\t\/\/ Fill in Palette data.\r\n\t\t\/\/\r\n\r\n\t\tfor(hlUInt i = 0; i < uiPaletteSize; i++)\r\n\t\t{\r\n\t\t\tlpPaletteData[i * 4 + 0] = lpPalette[i * 3 + 2];\r\n\t\t\tlpPaletteData[i * 4 + 1] = lpPalette[i * 3 + 1];\r\n\t\t\tlpPaletteData[i * 4 + 2] = lpPalette[i * 3 + 0];\r\n\t\t\tlpPaletteData[i * 4 + 3] = 0;\r\n\t\t}\r\n\r\n\t\t\/\/\r\n\t\t\/\/ Fill in Index data.\r\n\t\t\/\/\r\n\r\n\t\tfor(hlUInt i = 0; i < uiWidth; i++)\r\n\t\t{\r\n\t\t\tfor(hlUInt j = 0; j < uiHeight; j++)\r\n\t\t\t{\r\n\t\t\t\tlpPixelData[i + (uiHeight - 1 - j) * uiWidth] = lpPixels[i + j * uiWidth];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpStream = new Streams::CMemoryStream(lpBuffer, uiBufferSize);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpStream = new Streams::CMappingStream(*this->pMapping, this->pHeader->lpLumps[HL_BSP_LUMP_ENTITIES].uiOffset, this->pHeader->lpLumps[HL_BSP_LUMP_ENTITIES].uiLength - 1);\r\n\t}\r\n\r\n\treturn hlTrue;\r\n}\r\n\r\nhlVoid CBSPFile::ReleaseStreamInternal(Streams::IStream &Stream) const\r\n{\r\n\tif(Stream.GetType() == HL_STREAM_MEMORY)\r\n\t{\r\n\t\tdelete [](hlByte *)static_cast<Streams::CMemoryStream &>(Stream).GetBuffer();\r\n\t}\r\n}\r\n\r\nhlVoid CBSPFile::GetFileName(hlChar *lpBuffer, hlUInt uiBufferSize)\r\n{\r\n\tif(lpBuffer == 0 || uiBufferSize == 0)\r\n\t{\r\n\t\treturn;\r\n\t}\r\n\r\n\tconst hlChar *lpMappingName = this->pMapping->GetFileName();\r\n\r\n\tif(lpMappingName == 0 && *lpMappingName == '\\0')\r\n\t{\r\n\t\t*lpBuffer = '\\0';\r\n\t\treturn;\r\n\t}\r\n\r\n\tconst hlChar *lpForward = strrchr(lpMappingName, '\\\\');\r\n\tconst hlChar *lpBackward = strrchr(lpMappingName, '\/');\r\n\tconst hlChar *lpStart = lpForward > lpBackward ? lpForward : lpBackward;\r\n\r\n\tif(lpStart == 0)\r\n\t{\r\n\t\tlpStart = lpMappingName;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tlpStart++;\r\n\t}\r\n\r\n\tconst hlChar *lpEnd = strrchr(lpStart, '.');\r\n\r\n\tif(lpEnd == 0)\r\n\t{\r\n\t\tlpEnd = lpStart + strlen(lpStart);\r\n\t}\r\n\r\n\tif((hlUInt)(lpEnd - lpStart) + 1 < uiBufferSize)\r\n\t{\r\n\t\tuiBufferSize = (hlUInt)(lpEnd - lpStart) + 1;\r\n\t}\r\n\r\n\tstrncpy(lpBuffer, lpStart, uiBufferSize);\r\n\tlpBuffer[uiBufferSize - 1] = '\\0';\r\n}\r\n\r\nhlBool CBSPFile::GetLumpInfo(const CDirectoryFile &File, hlUInt &uiWidth, hlUInt &uiHeight, hlUInt &uiPaletteSize, hlUInt uiMipmap) const\r\n{\r\n\tif(uiMipmap >= HL_BSP_MIPMAP_COUNT)\r\n\t{\r\n\t\tLastError.SetErrorMessageFormated(\"Error reading texture: invalid mipmap level %u.\", uiMipmap);\r\n\t\treturn hlFalse;\r\n\t}\r\n\r\n\tconst BSPTexture *pTexture = (const BSPTexture *)((const hlByte *)this->pTextureHeader + this->pTextureHeader->lpOffsets[File.GetID()]);\r\n\r\n\tuiWidth = pTexture->uiWidth;\r\n\tuiHeight = pTexture->uiHeight;\r\n\r\n\thlUInt uiPixelSize = 0;\r\n\tfor(hlUInt i = 0; i < HL_BSP_MIPMAP_COUNT; i++)\r\n\t{\r\n\t\tif(pTexture->lpOffsets[i] != 0)\r\n\t\t{\r\n\t\t\tuiPixelSize += (uiWidth >> i) * (uiHeight >> i);\r\n\t\t}\r\n\t}\r\n\r\n\tconst hlByte *lpData = (const hlByte *)pTexture + pTexture->lpOffsets[0];\r\n\r\n\tuiPaletteSize = (hlUInt)*(const hlUInt16 *)(lpData + uiPixelSize);\r\n\r\n\tswitch(uiMipmap)\r\n\t{\r\n\tcase 1:\r\n\t\tuiWidth \/= 2;\r\n\t\tuiHeight \/= 2;\r\n\t\tbreak;\r\n\tcase 2:\r\n\t\tuiWidth \/= 4;\r\n\t\tuiHeight \/= 4;\r\n\t\tbreak;\r\n\tcase 3:\r\n\t\tuiWidth \/= 8;\r\n\t\tuiHeight \/= 8;\r\n\t\tbreak;\r\n\t}\r\n\r\n\treturn hlTrue;\r\n}\r\n\r\nhlBool CBSPFile::GetLumpInfo(const CDirectoryFile &File, hlUInt &uiWidth, hlUInt &uiHeight, hlUInt &uiPaletteSize, const hlByte *&lpPalette, const hlByte *&lpPixels, hlUInt uiMipmap) const\r\n{\r\n\tif(uiMipmap > 3)\r\n\t{\r\n\t\tLastError.SetErrorMessageFormated(\"Error reading texture: invalid mipmap level %u.\", uiMipmap);\r\n\t\treturn hlFalse;\r\n\t}\r\n\r\n\tconst BSPTexture *pTexture = (const BSPTexture *)((const hlByte *)this->pTextureHeader + this->pTextureHeader->lpOffsets[File.GetID()]);\r\n\r\n\tuiWidth = pTexture->uiWidth;\r\n\tuiHeight = pTexture->uiHeight;\r\n\r\n\thlUInt uiPixelSize = 0;\r\n\tfor(hlUInt i = 0; i < HL_BSP_MIPMAP_COUNT; i++)\r\n\t{\r\n\t\tif(pTexture->lpOffsets[i] != 0)\r\n\t\t{\r\n\t\t\tuiPixelSize += (uiWidth >> i) * (uiHeight >> i);\r\n\t\t}\r\n\t}\r\n\r\n\tlpPixels = (const hlByte *)pTexture + pTexture->lpOffsets[uiMipmap];\r\n\r\n\tuiPaletteSize = (hlUInt)*(const hlUInt16 *)(((const hlByte *)pTexture + pTexture->lpOffsets[0]) + uiPixelSize);\r\n\r\n\tlpPalette = ((const hlByte *)pTexture + pTexture->lpOffsets[0]) + uiPixelSize + sizeof(hlUInt16);\r\n\r\n\tswitch(uiMipmap)\r\n\t{\r\n\tcase 1:\r\n\t\tuiWidth \/= 2;\r\n\t\tuiHeight \/= 2;\r\n\t\tbreak;\r\n\tcase 2:\r\n\t\tuiWidth \/= 4;\r\n\t\tuiHeight \/= 4;\r\n\t\tbreak;\r\n\tcase 3:\r\n\t\tuiWidth \/= 8;\r\n\t\tuiHeight \/= 8;\r\n\t\tbreak;\r\n\t}\r\n\r\n\treturn hlTrue;\r\n}\r\n<commit_msg>Delete BSPFile.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * @file laplace.hpp\n * @author Zhihao Lou\n *\n * Laplace (double exponential) distribution used in SA.\n *\/\n\n#ifndef __MLPACK_CORE_OPTIMIZER_SA_LAPLACE_DISTRIBUTION_HPP\n#define __MLPACK_CORE_OPTIMIZER_SA_LAPLACE_DISTRIBUTION_HPP\n\nnamespace mlpack {\nnamespace distribution {\n\n\/**\n * The multivariate Laplace distribution centered at 0 has pdf\n *\n * \\f[\n * f(x|\\theta) = \\frac{1}{2 \\theta}\\exp\\left(-\\frac{\\|x - \\mu\\|}{\\theta}\\right)\n * \\f]\n *\n * given scale parameter \\f$\\theta\\f$ and mean \\f$\\mu\\f$.  This implementation\n * assumes a diagonal covariance, but a rewrite to support arbitrary covariances\n * is possible.\n *\n * See the following paper for more information on the non-diagonal-covariance\n * Laplace distribution and estimation techniques:\n *\n * @code\n * @article{eltoft2006multivariate,\n *   title={{On the Multivariate Laplace Distribution}},\n *   author={Eltoft, Torbj\\orn and Kim, Taesu and Lee, Te-Won},\n *   journal={IEEE Signal Processing Letters},\n *   volume={13},\n *   number={5},\n *   pages={300--304},\n *   year={2006}\n * }\n * @endcode\n *\n * Note that because of the diagonal covariance restriction, much of the algebra\n * in the paper above becomes simplified, and the PDF takes roughly the same\n * form as the univariate case.\n *\/\nclass LaplaceDistribution\n{\n public:\n  \/**\n   * Default constructor, which creates a Laplace distribution with zero\n   * dimension and zero scale parameter.\n   *\/\n  LaplaceDistribution() : scale(0) { }\n\n  \/**\n   * Construct the Laplace distribution with the given scale and dimensionality.\n   * The mean is initialized to zero.\n   *\n   * @param dimensionality Dimensionality of distribution.\n   * @param scale Scale of distribution.\n   *\/\n  LaplaceDistribution(const size_t dimensionality, const double scale) :\n      mean(arma::zeros<arma::vec>(dimensionality)), scale(scale) { }\n\n  \/**\n   * Construct the Laplace distribution with the given mean and scale parameter.\n   *\n   * @param mean Mean of distribution.\n   * @param scale Scale of distribution.\n   *\/\n  LaplaceDistribution(const arma::vec& mean, const double scale) :\n      mean(mean), scale(scale) { }\n\n  \/\/! Return the dimensionality of this distribution.\n  size_t Dimensionality() const { return mean.n_elem; }\n\n  \/**\n   * Return the probability of the given observation.\n   *\/\n  double Probability(const arma::vec& observation) const;\n\n  \/**\n   * Return a randomly generated observation according to the probability\n   * distribution defined by this object.  This is inlined for speed.\n   *\n   * @return Random observation from this Laplace distribution.\n   *\/\n  arma::vec Random() const\n  {\n    arma::vec result(mean.n_elem);\n    result.randu();\n\n    \/\/ Convert from uniform distribution to Laplace distribution.\n    return mean - scale * sign(result) % arma::log(1 - 2.0 * (result - 0.5));\n  }\n\n  \/**\n   * Estimate the Laplace distribution directly from the given observations.\n   *\n   * @param observations List of observations.\n   *\/\n  void Estimate(const arma::mat& observations);\n\n  \/**\n   * Estimate the Laplace distribution from the given observations, taking into\n   * account the probability of each observation actually being from this\n   * distribution.\n   *\/\n  void Estimate(const arma::mat& observations,\n                const arma::vec& probabilities);\n\n  \/\/! Return the mean.\n  const arma::vec& Mean() const { return mean; }\n  \/\/! Modify the mean.\n  arma::vec& Mean() { return mean; }\n\n  \/\/! Return the scale parameter.\n  double Scale() const { return scale; }\n  \/\/! Modify the scale parameter.\n  double& Scale() { return scale; }\n\n  \/\/! Return a string representation of the object.\n  std::string ToString() const;\n\n private:\n  \/\/! Mean of the distribution.\n  arma::vec mean;\n  \/\/! Scale parameter of the distribution.\n  double scale;\n\n};\n\n}; \/\/ namespace distribution\n}; \/\/ namespace mlpack\n\n#endif\n<commit_msg>Explicitly use arma::sign().<commit_after>\/*\n * @file laplace.hpp\n * @author Zhihao Lou\n *\n * Laplace (double exponential) distribution used in SA.\n *\/\n\n#ifndef __MLPACK_CORE_OPTIMIZER_SA_LAPLACE_DISTRIBUTION_HPP\n#define __MLPACK_CORE_OPTIMIZER_SA_LAPLACE_DISTRIBUTION_HPP\n\nnamespace mlpack {\nnamespace distribution {\n\n\/**\n * The multivariate Laplace distribution centered at 0 has pdf\n *\n * \\f[\n * f(x|\\theta) = \\frac{1}{2 \\theta}\\exp\\left(-\\frac{\\|x - \\mu\\|}{\\theta}\\right)\n * \\f]\n *\n * given scale parameter \\f$\\theta\\f$ and mean \\f$\\mu\\f$.  This implementation\n * assumes a diagonal covariance, but a rewrite to support arbitrary covariances\n * is possible.\n *\n * See the following paper for more information on the non-diagonal-covariance\n * Laplace distribution and estimation techniques:\n *\n * @code\n * @article{eltoft2006multivariate,\n *   title={{On the Multivariate Laplace Distribution}},\n *   author={Eltoft, Torbj\\orn and Kim, Taesu and Lee, Te-Won},\n *   journal={IEEE Signal Processing Letters},\n *   volume={13},\n *   number={5},\n *   pages={300--304},\n *   year={2006}\n * }\n * @endcode\n *\n * Note that because of the diagonal covariance restriction, much of the algebra\n * in the paper above becomes simplified, and the PDF takes roughly the same\n * form as the univariate case.\n *\/\nclass LaplaceDistribution\n{\n public:\n  \/**\n   * Default constructor, which creates a Laplace distribution with zero\n   * dimension and zero scale parameter.\n   *\/\n  LaplaceDistribution() : scale(0) { }\n\n  \/**\n   * Construct the Laplace distribution with the given scale and dimensionality.\n   * The mean is initialized to zero.\n   *\n   * @param dimensionality Dimensionality of distribution.\n   * @param scale Scale of distribution.\n   *\/\n  LaplaceDistribution(const size_t dimensionality, const double scale) :\n      mean(arma::zeros<arma::vec>(dimensionality)), scale(scale) { }\n\n  \/**\n   * Construct the Laplace distribution with the given mean and scale parameter.\n   *\n   * @param mean Mean of distribution.\n   * @param scale Scale of distribution.\n   *\/\n  LaplaceDistribution(const arma::vec& mean, const double scale) :\n      mean(mean), scale(scale) { }\n\n  \/\/! Return the dimensionality of this distribution.\n  size_t Dimensionality() const { return mean.n_elem; }\n\n  \/**\n   * Return the probability of the given observation.\n   *\/\n  double Probability(const arma::vec& observation) const;\n\n  \/**\n   * Return a randomly generated observation according to the probability\n   * distribution defined by this object.  This is inlined for speed.\n   *\n   * @return Random observation from this Laplace distribution.\n   *\/\n  arma::vec Random() const\n  {\n    arma::vec result(mean.n_elem);\n    result.randu();\n\n    \/\/ Convert from uniform distribution to Laplace distribution.\n    return mean - scale * arma::sign(result) % arma::log(1 - 2.0 * (result -\n        0.5));\n  }\n\n  \/**\n   * Estimate the Laplace distribution directly from the given observations.\n   *\n   * @param observations List of observations.\n   *\/\n  void Estimate(const arma::mat& observations);\n\n  \/**\n   * Estimate the Laplace distribution from the given observations, taking into\n   * account the probability of each observation actually being from this\n   * distribution.\n   *\/\n  void Estimate(const arma::mat& observations,\n                const arma::vec& probabilities);\n\n  \/\/! Return the mean.\n  const arma::vec& Mean() const { return mean; }\n  \/\/! Modify the mean.\n  arma::vec& Mean() { return mean; }\n\n  \/\/! Return the scale parameter.\n  double Scale() const { return scale; }\n  \/\/! Modify the scale parameter.\n  double& Scale() { return scale; }\n\n  \/\/! Return a string representation of the object.\n  std::string ToString() const;\n\n private:\n  \/\/! Mean of the distribution.\n  arma::vec mean;\n  \/\/! Scale parameter of the distribution.\n  double scale;\n\n};\n\n}; \/\/ namespace distribution\n}; \/\/ namespace mlpack\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file sparse_autoencoder_test.cpp\n * @author Siddharth Agrawal\n *\n * Test the SparseAutoencoder class.\n *\/\n#include <mlpack\/methods\/sparse_autoencoder\/sparse_autoencoder_function.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/activation_functions\/logistic_function.hpp>\n\n#include <mlpack\/core.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/layer\/base_layer.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n#include \"old_boost_test_definitions.hpp\"\n\nusing namespace mlpack;\nusing namespace arma;\n\nusing SigmoidLayer = nn::SigmoidLayer<nn::LogisticFunction>;\n\n\/\/sparse autoencoder function\nusing SAEF = nn::SparseAutoencoderFunction<SigmoidLayer, SigmoidLayer>;\n\/\/sparse autoencoder function greedy\nusing SAEFG = nn::SparseAutoencoderFunction<SigmoidLayer, SigmoidLayer, std::true_type>;\n\nBOOST_AUTO_TEST_SUITE(SparseAutoencoderTest2);\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionEvaluate)\n{\n  const size_t vSize = 5;\n  const size_t hSize = 3;\n  const size_t r = 2 * hSize + 1;\n  const size_t c = vSize + 1;\n\n  \/\/ Simple fake dataset.\n  arma::mat data1(\"0.1 0.2 0.3 0.4 0.5;\"\n                  \"0.1 0.2 0.3 0.4 0.5;\"\n                  \"0.1 0.2 0.3 0.4 0.5;\"\n                  \"0.1 0.2 0.3 0.4 0.5;\"\n                  \"0.1 0.2 0.3 0.4 0.5\");\n  \/\/ Transpose of the above dataset.\n  arma::mat data2 = data1.t();\n\n  \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n  \/\/ ignored.\n  SAEF saf1(data1, vSize, hSize, 0, 0);\n\n  \/\/ Test using first dataset. Values were calculated using Octave.\n  BOOST_REQUIRE_CLOSE(saf1.Evaluate(arma::ones(r, c)), 1.190472606540, 1e-5);\n  BOOST_REQUIRE_CLOSE(saf1.Evaluate(arma::zeros(r, c)), 0.150000000000, 1e-5);\n  BOOST_REQUIRE_CLOSE(saf1.Evaluate(-arma::ones(r, c)), 0.048800332266, 1e-5);\n\n  \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n  \/\/ ignored.\n  SAEF saf2(data2, vSize, hSize, 0, 0);\n\n  \/\/ Test using second dataset. Values were calculated using Octave.\n  BOOST_REQUIRE_CLOSE(saf2.Evaluate(arma::ones(r, c)), 1.197585812647, 1e-5);\n  BOOST_REQUIRE_CLOSE(saf2.Evaluate(arma::zeros(r, c)), 0.150000000000, 1e-5);\n  BOOST_REQUIRE_CLOSE(saf2.Evaluate(-arma::ones(r, c)), 0.063466617408, 1e-5);\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionRandomEvaluate)\n{\n  const size_t points = 1000;\n  const size_t trials = 50;\n  const size_t vSize = 20;\n  const size_t hSize = 10;\n  const size_t l1 = hSize;\n  const size_t l2 = vSize;\n  const size_t l3 = 2 * hSize;\n\n  \/\/ Initialize a random dataset.\n  arma::mat data;\n  data.randu(vSize, points);\n\n  \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n  \/\/ ignored.\n  SAEF saf(data, vSize, hSize, 0, 0);\n\n  \/\/ Run a number of trials.\n  for (size_t i = 0; i < trials; i++)\n  {\n    \/\/ Create a random set of parameters.\n    arma::mat parameters;\n    parameters.randu(l3 + 1, l2 + 1);\n\n    double reconstructionError = 0;\n\n    \/\/ Compute error for each training example.\n    for (size_t j = 0; j < points; j++)\n    {\n      arma::mat hiddenLayer, outputLayer, diff;\n\n      hiddenLayer = 1.0 \/\n                   (1 + arma::exp(-(parameters.submat(0, 0, l1 - 1, l2 - 1) *\n                                  data.col(j) + parameters.submat(0, l2, l1 - 1, l2))));\n      outputLayer = 1.0 \/\n                    (1 + arma::exp(-(parameters.submat(l1, 0, l3 - 1,l2 - 1).t()\n                                   * hiddenLayer + parameters.submat(l3, 0, l3, l2 - 1).t())));\n      diff = outputLayer - data.col(j);\n\n      reconstructionError += 0.5 * arma::sum(arma::sum(diff % diff));\n    }\n    reconstructionError \/= points;\n\n    \/\/ Compare with the value returned by the function.\n    BOOST_REQUIRE_CLOSE(saf.Evaluate(parameters), reconstructionError, 1e-5);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionRegularizationEvaluate)\n{\n  const size_t points = 1000;\n  const size_t trials = 50;\n  const size_t vSize = 20;\n  const size_t hSize = 10;\n  const size_t l2 = vSize;\n  const size_t l3 = 2 * hSize;\n\n  \/\/ Initialize a random dataset.\n  arma::mat data;\n  data.randu(vSize, points);\n\n  \/\/ 3 objects for comparing regularization costs.\n  SAEF safNoReg(data, vSize, hSize, 0, 0);\n  SAEF safSmallReg(data, vSize, hSize, 0.5, 0);\n  SAEF safBigReg(data, vSize, hSize, 20, 0);\n\n  \/\/ Run a number of trials.\n  for (size_t i = 0; i < trials; i++)\n  {\n    \/\/ Create a random set of parameters.\n    arma::mat parameters;\n    parameters.randu(l3 + 1, l2 + 1);\n\n    double wL2SquaredNorm;\n\n    wL2SquaredNorm = arma::accu(parameters.submat(0, 0, l3 - 1, l2 - 1) %\n                                parameters.submat(0, 0, l3 - 1, l2 - 1));\n\n    \/\/ Calculate regularization terms.\n    const double smallRegTerm = 0.25 * wL2SquaredNorm;\n    const double bigRegTerm = 10 * wL2SquaredNorm;\n\n    BOOST_REQUIRE_CLOSE(safNoReg.Evaluate(parameters) + smallRegTerm,\n                        safSmallReg.Evaluate(parameters), 1e-5);\n    BOOST_REQUIRE_CLOSE(safNoReg.Evaluate(parameters) + bigRegTerm,\n                        safBigReg.Evaluate(parameters), 1e-5);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionKLDivergenceEvaluate)\n{\n  const size_t points = 1000;\n  const size_t trials = 50;\n  const size_t vSize = 20;\n  const size_t hSize = 10;\n  const size_t l1 = hSize;\n  const size_t l2 = vSize;\n  const size_t l3 = 2 * hSize;\n\n  const double rho = 0.01;\n\n  \/\/ Initialize a random dataset.\n  arma::mat data;\n  data.randu(vSize, points);\n\n  \/\/ 3 objects for comparing divergence costs.\n  SAEF safNoDiv(data, vSize, hSize, 0, 0, rho);\n  SAEF safSmallDiv(data, vSize, hSize, 0, 5, rho);\n  SAEF safBigDiv(data, vSize, hSize, 0, 20, rho);\n\n  \/\/ Run a number of trials.\n  for(size_t i = 0; i < trials; i++)\n  {\n    \/\/ Create a random set of parameters.\n    arma::mat parameters;\n    parameters.randu(l3 + 1, l2 + 1);\n\n    arma::mat rhoCap;\n    rhoCap.zeros(hSize, 1);\n\n    \/\/ Compute hidden layer activations for each example.\n    for (size_t j = 0; j < points; j++)\n    {\n      arma::mat hiddenLayer;\n\n      hiddenLayer = 1.0 \/ (1 +\n                           arma::exp(-(parameters.submat(0, 0, l1 - 1, l2 - 1) *\n                                       data.col(j) + parameters.submat(0, l2, l1 - 1, l2))));\n      rhoCap += hiddenLayer;\n    }\n    rhoCap \/= points;\n\n    \/\/ Calculate divergence terms.\n    const double smallDivTerm = 5 * arma::accu(rho * arma::log(rho \/ rhoCap) +\n                                               (1 - rho) * arma::log((1 - rho) \/ (1 - rhoCap)));\n    const double bigDivTerm = 20 * arma::accu(rho * arma::log(rho \/ rhoCap) +\n                                              (1 - rho) * arma::log((1 - rho) \/ (1 - rhoCap)));\n\n    BOOST_REQUIRE_CLOSE(safNoDiv.Evaluate(parameters) + smallDivTerm,\n                        safSmallDiv.Evaluate(parameters), 1e-5);\n    BOOST_REQUIRE_CLOSE(safNoDiv.Evaluate(parameters) + bigDivTerm,\n                        safBigDiv.Evaluate(parameters), 1e-5);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionGradient)\n{\n  const size_t points = 1000;\n  const size_t vSize = 20;\n  const size_t hSize = 10;\n  const size_t l2 = vSize;\n  const size_t l3 = 2 * hSize;\n\n  \/\/ Initialize a random dataset.\n  arma::mat data;\n  data.randu(vSize, points);\n\n  \/\/ 3 objects for 3 terms in the cost function. Each term contributes towards\n  \/\/ the gradient and thus need to be checked independently.\n  SAEFG saf1(data, vSize, hSize, 0, 0);\n  SAEFG saf2(data, vSize, hSize, 20, 0);\n  SAEFG saf3(data, vSize, hSize, 20, 20);\n\n  \/\/ Create a random set of parameters.\n  arma::mat parameters;\n  parameters.randu(l3 + 1, l2 + 1);\n\n  \/\/ Get gradients for the current parameters.\n  arma::mat gradient1, gradient2, gradient3;\n  saf1.Gradient(parameters, gradient1);\n  saf2.Gradient(parameters, gradient2);\n  saf3.Gradient(parameters, gradient3);\n\n  \/\/ Perturbation constant.\n  const double epsilon = 0.0001;\n  double costPlus1, costMinus1, numGradient1;\n  double costPlus2, costMinus2, numGradient2;\n  double costPlus3, costMinus3, numGradient3;\n\n  \/\/ For each parameter.\n  for (size_t i = 0; i <= l3; i++)\n  {\n    for (size_t j = 0; j <= l2; j++)\n    {\n      \/\/ Perturb parameter with a positive constant and get costs.\n      parameters(i, j) += epsilon;\n      costPlus1 = saf1.Evaluate(parameters);\n      costPlus2 = saf2.Evaluate(parameters);\n      costPlus3 = saf3.Evaluate(parameters);\n\n      \/\/ Perturb parameter with a negative constant and get costs.\n      parameters(i, j) -= 2 * epsilon;\n      costMinus1 = saf1.Evaluate(parameters);\n      costMinus2 = saf2.Evaluate(parameters);\n      costMinus3 = saf3.Evaluate(parameters);\n\n      \/\/ Compute numerical gradients using the costs calculated above.\n      numGradient1 = (costPlus1 - costMinus1) \/ (2 * epsilon);\n      numGradient2 = (costPlus2 - costMinus2) \/ (2 * epsilon);\n      numGradient3 = (costPlus3 - costMinus3) \/ (2 * epsilon);\n\n      \/\/ Restore the parameter value.\n      parameters(i, j) += epsilon;\n\n      \/\/ Compare numerical and backpropagation gradient values.\n      BOOST_REQUIRE_CLOSE(numGradient1, gradient1(i, j), 1e-2);\n      BOOST_REQUIRE_CLOSE(numGradient2, gradient2(i, j), 1e-2);\n      BOOST_REQUIRE_CLOSE(numGradient3, gradient3(i, j), 1e-2);\n    }\n  }\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<commit_msg>add test case for move<commit_after>\/**\n * @file sparse_autoencoder_test.cpp\n * @author Siddharth Agrawal\n *\n * Test the SparseAutoencoder class.\n *\/\n#include <mlpack\/methods\/sparse_autoencoder\/sparse_autoencoder.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/sparse_autoencoder_function.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/activation_functions\/logistic_function.hpp>\n\n#include <mlpack\/core.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/layer\/base_layer.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n#include \"old_boost_test_definitions.hpp\"\n\nusing namespace mlpack;\nusing namespace arma;\n\nusing SigmoidLayer = nn::SigmoidLayer<nn::LogisticFunction>;\n\n\/\/sparse autoencoder function\nusing SAEF = nn::SparseAutoencoderFunction<SigmoidLayer, SigmoidLayer>;\n\/\/sparse autoencoder function greedy\nusing SAEFG = nn::SparseAutoencoderFunction<SigmoidLayer, SigmoidLayer, std::true_type>;\n\nBOOST_AUTO_TEST_SUITE(SparseAutoencoderTest2);\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionEvaluate)\n{\n  const size_t vSize = 5;\n  const size_t hSize = 3;\n  const size_t r = 2 * hSize + 1;\n  const size_t c = vSize + 1;\n\n  \/\/ Simple fake dataset.\n  arma::mat data1(\"0.1 0.2 0.3 0.4 0.5;\"\n                  \"0.1 0.2 0.3 0.4 0.5;\"\n                  \"0.1 0.2 0.3 0.4 0.5;\"\n                  \"0.1 0.2 0.3 0.4 0.5;\"\n                  \"0.1 0.2 0.3 0.4 0.5\");\n  \/\/ Transpose of the above dataset.\n  arma::mat data2 = data1.t();\n\n  \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n  \/\/ ignored.\n  SAEF saf1(data1, vSize, hSize, 0, 0);\n\n  \/\/ Test using first dataset. Values were calculated using Octave.\n  BOOST_REQUIRE_CLOSE(saf1.Evaluate(arma::ones(r, c)), 1.190472606540, 1e-5);\n  BOOST_REQUIRE_CLOSE(saf1.Evaluate(arma::zeros(r, c)), 0.150000000000, 1e-5);\n  BOOST_REQUIRE_CLOSE(saf1.Evaluate(-arma::ones(r, c)), 0.048800332266, 1e-5);\n\n  \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n  \/\/ ignored.\n  SAEF saf2(data2, vSize, hSize, 0, 0);\n\n  \/\/ Test using second dataset. Values were calculated using Octave.\n  BOOST_REQUIRE_CLOSE(saf2.Evaluate(arma::ones(r, c)), 1.197585812647, 1e-5);\n  BOOST_REQUIRE_CLOSE(saf2.Evaluate(arma::zeros(r, c)), 0.150000000000, 1e-5);\n  BOOST_REQUIRE_CLOSE(saf2.Evaluate(-arma::ones(r, c)), 0.063466617408, 1e-5);\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionRandomEvaluate)\n{\n  const size_t points = 1000;\n  const size_t trials = 50;\n  const size_t vSize = 20;\n  const size_t hSize = 10;\n  const size_t l1 = hSize;\n  const size_t l2 = vSize;\n  const size_t l3 = 2 * hSize;\n\n  \/\/ Initialize a random dataset.\n  arma::mat data;\n  data.randu(vSize, points);\n\n  \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n  \/\/ ignored.\n  SAEF saf(data, vSize, hSize, 0, 0);\n\n  \/\/ Run a number of trials.\n  for (size_t i = 0; i < trials; i++)\n  {\n    \/\/ Create a random set of parameters.\n    arma::mat parameters;\n    parameters.randu(l3 + 1, l2 + 1);\n\n    double reconstructionError = 0;\n\n    \/\/ Compute error for each training example.\n    for (size_t j = 0; j < points; j++)\n    {\n      arma::mat hiddenLayer, outputLayer, diff;\n\n      hiddenLayer = 1.0 \/\n                   (1 + arma::exp(-(parameters.submat(0, 0, l1 - 1, l2 - 1) *\n                                  data.col(j) + parameters.submat(0, l2, l1 - 1, l2))));\n      outputLayer = 1.0 \/\n                    (1 + arma::exp(-(parameters.submat(l1, 0, l3 - 1,l2 - 1).t()\n                                   * hiddenLayer + parameters.submat(l3, 0, l3, l2 - 1).t())));\n      diff = outputLayer - data.col(j);\n\n      reconstructionError += 0.5 * arma::sum(arma::sum(diff % diff));\n    }\n    reconstructionError \/= points;\n\n    \/\/ Compare with the value returned by the function.\n    BOOST_REQUIRE_CLOSE(saf.Evaluate(parameters), reconstructionError, 1e-5);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionRegularizationEvaluate)\n{\n  const size_t points = 1000;\n  const size_t trials = 50;\n  const size_t vSize = 20;\n  const size_t hSize = 10;\n  const size_t l2 = vSize;\n  const size_t l3 = 2 * hSize;\n\n  \/\/ Initialize a random dataset.\n  arma::mat data;\n  data.randu(vSize, points);\n\n  \/\/ 3 objects for comparing regularization costs.\n  SAEF safNoReg(data, vSize, hSize, 0, 0);\n  SAEF safSmallReg(data, vSize, hSize, 0.5, 0);\n  SAEF safBigReg(data, vSize, hSize, 20, 0);\n\n  \/\/ Run a number of trials.\n  for (size_t i = 0; i < trials; i++)\n  {\n    \/\/ Create a random set of parameters.\n    arma::mat parameters;\n    parameters.randu(l3 + 1, l2 + 1);\n\n    double wL2SquaredNorm;\n\n    wL2SquaredNorm = arma::accu(parameters.submat(0, 0, l3 - 1, l2 - 1) %\n                                parameters.submat(0, 0, l3 - 1, l2 - 1));\n\n    \/\/ Calculate regularization terms.\n    const double smallRegTerm = 0.25 * wL2SquaredNorm;\n    const double bigRegTerm = 10 * wL2SquaredNorm;\n\n    BOOST_REQUIRE_CLOSE(safNoReg.Evaluate(parameters) + smallRegTerm,\n                        safSmallReg.Evaluate(parameters), 1e-5);\n    BOOST_REQUIRE_CLOSE(safNoReg.Evaluate(parameters) + bigRegTerm,\n                        safBigReg.Evaluate(parameters), 1e-5);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionKLDivergenceEvaluate)\n{\n  const size_t points = 1000;\n  const size_t trials = 50;\n  const size_t vSize = 20;\n  const size_t hSize = 10;\n  const size_t l1 = hSize;\n  const size_t l2 = vSize;\n  const size_t l3 = 2 * hSize;\n\n  const double rho = 0.01;\n\n  \/\/ Initialize a random dataset.\n  arma::mat data;\n  data.randu(vSize, points);\n\n  \/\/ 3 objects for comparing divergence costs.\n  SAEF safNoDiv(data, vSize, hSize, 0, 0, rho);\n  SAEF safSmallDiv(data, vSize, hSize, 0, 5, rho);\n  SAEF safBigDiv(data, vSize, hSize, 0, 20, rho);\n\n  \/\/ Run a number of trials.\n  for(size_t i = 0; i < trials; i++)\n  {\n    \/\/ Create a random set of parameters.\n    arma::mat parameters;\n    parameters.randu(l3 + 1, l2 + 1);\n\n    arma::mat rhoCap;\n    rhoCap.zeros(hSize, 1);\n\n    \/\/ Compute hidden layer activations for each example.\n    for (size_t j = 0; j < points; j++)\n    {\n      arma::mat hiddenLayer;\n\n      hiddenLayer = 1.0 \/ (1 +\n                           arma::exp(-(parameters.submat(0, 0, l1 - 1, l2 - 1) *\n                                       data.col(j) + parameters.submat(0, l2, l1 - 1, l2))));\n      rhoCap += hiddenLayer;\n    }\n    rhoCap \/= points;\n\n    \/\/ Calculate divergence terms.\n    const double smallDivTerm = 5 * arma::accu(rho * arma::log(rho \/ rhoCap) +\n                                               (1 - rho) * arma::log((1 - rho) \/ (1 - rhoCap)));\n    const double bigDivTerm = 20 * arma::accu(rho * arma::log(rho \/ rhoCap) +\n                                              (1 - rho) * arma::log((1 - rho) \/ (1 - rhoCap)));\n\n    BOOST_REQUIRE_CLOSE(safNoDiv.Evaluate(parameters) + smallDivTerm,\n                        safSmallDiv.Evaluate(parameters), 1e-5);\n    BOOST_REQUIRE_CLOSE(safNoDiv.Evaluate(parameters) + bigDivTerm,\n                        safBigDiv.Evaluate(parameters), 1e-5);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionGradient)\n{\n  const size_t points = 1000;\n  const size_t vSize = 20;\n  const size_t hSize = 10;\n  const size_t l2 = vSize;\n  const size_t l3 = 2 * hSize;\n\n  \/\/ Initialize a random dataset.\n  arma::mat data;\n  data.randu(vSize, points);\n\n  \/\/ 3 objects for 3 terms in the cost function. Each term contributes towards\n  \/\/ the gradient and thus need to be checked independently.\n  SAEFG saf1(data, vSize, hSize, 0, 0);\n  SAEFG saf2(data, vSize, hSize, 20, 0);\n  SAEFG saf3(data, vSize, hSize, 20, 20);\n\n  \/\/ Create a random set of parameters.\n  arma::mat parameters;\n  parameters.randu(l3 + 1, l2 + 1);\n\n  \/\/ Get gradients for the current parameters.\n  arma::mat gradient1, gradient2, gradient3;\n  saf1.Gradient(parameters, gradient1);\n  saf2.Gradient(parameters, gradient2);\n  saf3.Gradient(parameters, gradient3);\n\n  \/\/ Perturbation constant.\n  const double epsilon = 0.0001;\n  double costPlus1, costMinus1, numGradient1;\n  double costPlus2, costMinus2, numGradient2;\n  double costPlus3, costMinus3, numGradient3;\n\n  \/\/ For each parameter.\n  for (size_t i = 0; i <= l3; i++)\n  {\n    for (size_t j = 0; j <= l2; j++)\n    {\n      \/\/ Perturb parameter with a positive constant and get costs.\n      parameters(i, j) += epsilon;\n      costPlus1 = saf1.Evaluate(parameters);\n      costPlus2 = saf2.Evaluate(parameters);\n      costPlus3 = saf3.Evaluate(parameters);\n\n      \/\/ Perturb parameter with a negative constant and get costs.\n      parameters(i, j) -= 2 * epsilon;\n      costMinus1 = saf1.Evaluate(parameters);\n      costMinus2 = saf2.Evaluate(parameters);\n      costMinus3 = saf3.Evaluate(parameters);\n\n      \/\/ Compute numerical gradients using the costs calculated above.\n      numGradient1 = (costPlus1 - costMinus1) \/ (2 * epsilon);\n      numGradient2 = (costPlus2 - costMinus2) \/ (2 * epsilon);\n      numGradient3 = (costPlus3 - costMinus3) \/ (2 * epsilon);\n\n      \/\/ Restore the parameter value.\n      parameters(i, j) += epsilon;\n\n      \/\/ Compare numerical and backpropagation gradient values.\n      BOOST_REQUIRE_CLOSE(numGradient1, gradient1(i, j), 1e-2);\n      BOOST_REQUIRE_CLOSE(numGradient2, gradient2(i, j), 1e-2);\n      BOOST_REQUIRE_CLOSE(numGradient3, gradient3(i, j), 1e-2);\n    }\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderMoveTest)\n{\n  using SAE = mlpack::nn::SparseAutoencoder<>;\n  SAE sae1(2, 2);  \n  SAE sae2(std::move(sae1));\n  BOOST_REQUIRE(sae1.Parameters().n_elem == 0);\n  BOOST_REQUIRE(sae1.VisibleSize(), sae2.VisibleSize());\n  BOOST_REQUIRE(sae1.HiddenSize(), sae2.HiddenSize());\n  BOOST_REQUIRE_CLOSE(sae1.Lambda(), sae2.Lambda(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sae1.Beta(), sae2.Beta(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sae1.Rho(), sae2.Rho(), 1e-5);\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015 Project Vogue. 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 \"elang\/optimizer\/scheduler\/visual_schedule.h\"\n\n#include \"base\/strings\/stringprintf.h\"\n#include \"elang\/optimizer\/function.h\"\n#include \"elang\/optimizer\/nodes.h\"\n#include \"elang\/optimizer\/opcode.h\"\n#include \"elang\/optimizer\/scheduler\/basic_block.h\"\n#include \"elang\/optimizer\/scheduler\/control_flow_graph.h\"\n#include \"elang\/optimizer\/scheduler\/schedule.h\"\n\nnamespace elang {\nnamespace optimizer {\n\nnamespace {\nbase::StringPiece PrefixOf(Node* node) {\n  if (node->IsControl())\n    return \"%c\";\n  if (node->IsEffect())\n    return \"%e\";\n  if (node->IsTuple())\n    return \"%t\";\n  return \"%r\";\n}\n}  \/\/ namespace\n\nstd::ostream& operator<<(std::ostream& ostream, const VisualSchedule& wrapper) {\n  ostream << \"digraph IR {\" << std::endl\n          << \"  concentrate=false\" << std::endl\n          << \"  node [fontname=monospace fontsize=10]\" << std::endl\n          << \"  overlap=false\" << std::endl\n          << \"  rankdir=\\\"TB\\\"\" << std::endl\n          << \"  ranksep=\\\"0.2 equally\\\"\" << std::endl\n          << \"  splines=true\" << std::endl\n          << std::endl;\n\n  auto& schedule = *wrapper.schedule;\n  auto last = static_cast<const Node*>(nullptr);\n  for (auto const node : schedule.nodes()) {\n    if (node->IsBlockStart()) {\n      ostream << \"  subgraph cluster_\" << node->id() << \" {\" << std::endl;\n      last = nullptr;\n    }\n    ostream << \"    node\" << node->id() << \" [shape=record \"\n            << \"label=\\\"{{\" << PrefixOf(node) << node->id() << \"=\"\n            << node->mnemonic();\n    for (auto const input : node->inputs())\n      ostream << \"|\" << PrefixOf(input) << input->id();\n    ostream << \"}}\\\"]\" << std::endl;\n    if (last) {\n      ostream << \"    node\" << last->id() << \" -> node\" << node->id()\n              << std::endl;\n    }\n    last = node;\n    if (node->IsBlockEnd())\n      ostream << \"  }\" << std::endl;\n  }\n\n  ostream << std::endl\n          << \"  \/\/ Edges\" << std::endl;\n  for (auto const node : schedule.nodes()) {\n    if (!node->IsBlockStart())\n      continue;\n    auto position = 0;\n    auto const to = node->id();\n    for (auto const input : node->inputs()) {\n      auto const from = input->id();\n      ostream << \"  node\" << from << \" -> node\" << to;\n      if (position && node->opcode() == Opcode::Loop)\n        ostream << \" [color=red constraint=false]\";\n      ostream << std::endl;\n      ++position;\n    }\n  }\n  return ostream << \"}\" << std::endl;\n}\n\nVisualSchedule AsVisual(const Schedule& schedule) {\n  return VisualSchedule{&schedule};\n}\n\n}  \/\/ namespace optimizer\n}  \/\/ namespace elang\n<commit_msg>elang\/optimizer\/scheduler: Utilize \"\\l\" syntax of Graphviz label value for |VisualScheudle|.<commit_after>\/\/ Copyright 2015 Project Vogue. 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 <unordered_map>\n\n#include \"elang\/optimizer\/scheduler\/visual_schedule.h\"\n\n#include \"base\/strings\/stringprintf.h\"\n#include \"elang\/optimizer\/function.h\"\n#include \"elang\/optimizer\/nodes.h\"\n#include \"elang\/optimizer\/opcode.h\"\n#include \"elang\/optimizer\/scheduler\/basic_block.h\"\n#include \"elang\/optimizer\/scheduler\/control_flow_graph.h\"\n#include \"elang\/optimizer\/scheduler\/schedule.h\"\n\nnamespace elang {\nnamespace optimizer {\n\nnamespace {\nbase::StringPiece PrefixOf(Node* node) {\n  if (node->IsControl())\n    return \"%c\";\n  if (node->IsEffect())\n    return \"%e\";\n  if (node->IsTuple())\n    return \"%t\";\n  return \"%r\";\n}\n}  \/\/ namespace\n\nstd::ostream& operator<<(std::ostream& ostream, const VisualSchedule& wrapper) {\n  ostream << \"digraph IR {\" << std::endl\n          << \"  concentrate=false\" << std::endl\n          << \"  node [fontname=monospace fontsize=10]\" << std::endl\n          << \"  overlap=false\" << std::endl\n          << \"  rankdir=\\\"TB\\\"\" << std::endl\n          << \"  ranksep=\\\"0.8 equally\\\"\" << std::endl\n          << \"  splines=true\" << std::endl\n          << \"  node [shape=box]\" << std::endl\n          << std::endl;\n  std::unordered_map<Node*, Node*> end_to_start_map;\n  Node* start_node = nullptr;\n  auto& schedule = *wrapper.schedule;\n  for (auto const node : schedule.nodes()) {\n    if (node->IsBlockStart()) {\n      ostream << \" node\" << node->id() << \" [label=\\\"\";\n      start_node = node;\n    } else {\n      DCHECK(start_node);\n    }\n    ostream << PrefixOf(node) << node->id() << \"=\" << node->mnemonic();\n    for (auto const input : node->inputs())\n      ostream << \" \" << PrefixOf(input) << input->id();\n    ostream << \"\\\\l\";\n    if (!node->IsBlockEnd())\n      continue;\n    ostream << \"\\\"]\" << std::endl;\n    end_to_start_map.insert(std::make_pair(node, start_node));\n    start_node = nullptr;\n  }\n\n  ostream << std::endl << \"  \/\/ Edges\" << std::endl;\n  for (auto const node : schedule.nodes()) {\n    if (!node->IsBlockStart())\n      continue;\n    auto position = 0;\n    auto const to = node;\n    for (auto const input : node->inputs()) {\n      auto const it = end_to_start_map.find(input);\n      DCHECK(it != end_to_start_map.end());\n      auto const from = it->second;\n      auto const is_back_edge = position && node->opcode() == Opcode::Loop;\n      auto const port = is_back_edge ? \":w\" : \"\";\n      ostream << \"  node\" << from->id() << port << \" -> node\" << to->id()\n              << port;\n      if (is_back_edge)\n        ostream << \" [color=red constraint=false]\";\n      ostream << std::endl;\n      ++position;\n    }\n  }\n  return ostream << \"}\" << std::endl;\n}\n\nVisualSchedule AsVisual(const Schedule& schedule) {\n  return VisualSchedule{&schedule};\n}\n\n}  \/\/ namespace optimizer\n}  \/\/ namespace elang\n<|endoftext|>"}
{"text":"<commit_before>\/*------------------------------------------------------------------------\n * Vulkan Conformance Tests\n * ------------------------\n *\n * Copyright (c) 2019 Google LLC\n * Copyright (c) 2019 The Khronos Group 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 \"vktAmberTestCase.hpp\"\n#include \"vktTestGroupUtil.hpp\"\n\nnamespace vkt\n{\nnamespace cts_amber\n{\n\nclass AmberIndexFileParser\n{\n\tchar*\t\t\t\tm_buf;\n\tsize_t\t\t\t\tm_idx;\n\tsize_t\t\t\t\tm_len;\n\tstatic const int\tm_fieldLen = 256;\n\tchar\t\t\t\tm_scratch[m_fieldLen];\n\tchar\t\t\t\tm_filenameField[m_fieldLen];\n\tchar\t\t\t\tm_testnameField[m_fieldLen];\n\tchar\t\t\t\tm_descField[m_fieldLen];\n\n\tbool isWhitespace (char c)\n\t{\n\t\tif (c == ' '  ||\n\t\t\tc == '\\t' ||\n\t\t\tc == '\\r' ||\n\t\t\tc == '\\n')\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid skipWhitespace (void)\n\t{\n\t\twhile (m_idx < m_len && isWhitespace(m_buf[m_idx]))\n\t\t\tm_idx++;\n\t}\n\n\tvoid accept (char c)\n\t{\n\t\tif (m_buf[m_idx] == c)\n\t\t\tm_idx++;\n\t}\n\n\tvoid expect (char c)\n\t{\n\t\tif (m_buf[m_idx] != c || m_idx >= m_len)\n\t\t\tTCU_THROW(ResourceError, \"Error parsing amber index file\");\n\n\t\tm_idx++;\n\t}\n\n\tvoid captureString (char* field)\n\t{\n\t\tint i = 0;\n\n\t\twhile (m_idx < m_len && i < m_fieldLen && m_buf[m_idx] != '\"')\n\t\t{\n\t\t\tfield[i] = m_buf[m_idx];\n\t\t\ti++;\n\t\t\tm_idx++;\n\t\t}\n\n\t\tfield[i] = 0;\n\t\tm_idx++;\n\t}\n\n\tchar* loadFile (const char* filename, size_t& len)\n\t{\n\t\tFILE* f = fopen(filename, \"rb\");\n\n\t\tif (f == 0)\n\t\t{\n\t\t\tstd::string error(\"Unable to open index file \");\n\t\t\terror.append(filename);\n\t\t\tTCU_THROW(ResourceError, error.c_str());\n\t\t}\n\n\t\tfseek(f, 0, SEEK_END);\n\t\tlen = ftell(f);\n\t\tfseek(f, 0, SEEK_SET);\n\t\tchar* buf = new char[len + 1];\n\n\t\tif (fread(buf, 1, len, f) != len)\n\t\t{\n\t\t\tdelete[] buf;\n\t\t\tfclose(f);\n\t\t\tstd::string error(\"File i\/o error reading index file \");\n\t\t\terror.append(filename);\n\t\t\tTCU_THROW(ResourceError, error.c_str());\n\t\t}\n\n\t\tbuf[len] = 0;\n\t\tfclose(f);\n\t\treturn buf;\n\t}\n\npublic:\n\tAmberIndexFileParser (const char* filename, const char* category)\n\t{\n\t\tstd::string\tindexFilename(\"vulkan\/amber\/\");\n\t\tindexFilename.append(category);\n\t\tindexFilename.append(\"\/\");\n\t\tindexFilename.append(filename);\n\n\t\tm_buf = loadFile(indexFilename.c_str(), m_len);\n\t\tm_idx = 0;\n\t}\n\n\t~AmberIndexFileParser (void)\n\t{\n\t\tdelete[] m_buf;\n\t}\n\n\tAmberTestCase* parse (const char* category, tcu::TestContext& testCtx)\n\t{\n\t\t\/\/ Format:\n\t\t\/\/ {\"filename\",\"test name\",\"description\"[,requirement[,requirement[,requirement..]]]}[,]\n\t\t\/\/ Things inside [] are optional. Whitespace is allowed everywhere.\n\t\t\/\/\n\t\t\/\/ For example, test without requirements might be:\n\t\t\/\/ {\"testname.amber\",\"test name\",\"test description\"},\n\n\t\tif (m_idx < m_len)\n\t\t{\n\t\t\tskipWhitespace();\n\t\t\texpect('{');\n\t\t\tskipWhitespace();\n\t\t\texpect('\"');\n\t\t\tcaptureString(m_filenameField);\n\t\t\tskipWhitespace();\n\t\t\texpect(',');\n\t\t\tskipWhitespace();\n\t\t\texpect('\"');\n\t\t\tcaptureString(m_testnameField);\n\t\t\tskipWhitespace();\n\t\t\texpect(',');\n\t\t\tskipWhitespace();\n\t\t\texpect('\"');\n\t\t\tcaptureString(m_descField);\n\t\t\tskipWhitespace();\n\n\t\t\tstd::string testFilename(\"vulkan\/amber\/\");\n\t\t\ttestFilename.append(category);\n\t\t\ttestFilename.append(\"\/\");\n\t\t\ttestFilename.append(m_filenameField);\n\t\t\tAmberTestCase *testCase = new AmberTestCase(testCtx, m_testnameField, m_descField, testFilename);\n\n\t\t\twhile (m_idx < m_len && m_buf[m_idx] == ',')\n\t\t\t{\n\t\t\t\taccept(',');\n\t\t\t\tskipWhitespace();\n\t\t\t\texpect('\"');\n\t\t\t\tcaptureString(m_scratch);\n\t\t\t\tskipWhitespace();\n\t\t\t\ttestCase->addRequirement(m_scratch);\n\t\t\t}\n\n\t\t\texpect('}');\n\t\t\tskipWhitespace();\n\t\t\taccept(',');\n\t\t\tskipWhitespace();\n\t\t\treturn testCase;\n\t\t}\n\t\treturn 0;\n\t}\n};\n\nvoid createAmberTestsFromIndexFile (tcu::TestContext& testCtx, tcu::TestCaseGroup* group, const std::string filename, const char* category)\n{\n\tAmberTestCase*\t\t\ttestCase = 0;\n\tAmberIndexFileParser\tparser(filename.c_str(), category);\n\n\tdo\n\t{\n\t\ttestCase = parser.parse(category, testCtx);\n\t\tif (testCase)\n\t\t{\n\t\t\tgroup->addChild(testCase);\n\t\t}\n\t} while (testCase);\n}\n\nAmberTestCase* createAmberTestCase (tcu::TestContext&\t\t\t\ttestCtx,\n\t\t\t\t\t\t\t\t\tconst char*\t\t\t\t\t\tname,\n\t\t\t\t\t\t\t\t\tconst char*\t\t\t\t\t\tdescription,\n\t\t\t\t\t\t\t\t\tconst char*\t\t\t\t\t\tcategory,\n\t\t\t\t\t\t\t\t\tconst std::string&\t\t\t\tfilename,\n\t\t\t\t\t\t\t\t\tconst std::vector<std::string>\trequirements)\n{\n\t\/\/ shader_test files are saved in <path>\/external\/vulkancts\/data\/vulkan\/amber\/<categoryname>\/\n\tstd::string readFilename(\"vulkan\/amber\/\");\n\treadFilename.append(category);\n\treadFilename.append(\"\/\");\n\treadFilename.append(filename);\n\n\tAmberTestCase *testCase = new AmberTestCase(testCtx, name, description, readFilename);\n\n\tfor (auto req : requirements)\n\t\ttestCase->addRequirement(req);\n\n\treturn testCase;\n}\n\n} \/\/ cts_amber\n} \/\/ vkt\n<commit_msg>Fix amber index parser for archive dir<commit_after>\/*------------------------------------------------------------------------\n * Vulkan Conformance Tests\n * ------------------------\n *\n * Copyright (c) 2019 Google LLC\n * Copyright (c) 2019 The Khronos Group 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 \"vktAmberTestCase.hpp\"\n#include \"vktTestGroupUtil.hpp\"\n#include \"vktTestCaseUtil.hpp\"\n#include \"tcuResource.hpp\"\n\n\nnamespace vkt\n{\nnamespace cts_amber\n{\n\nclass AmberIndexFileParser\n{\n\tstd::string\t\t\tm_str;\n\tsize_t\t\t\t\tm_idx;\n\tsize_t\t\t\t\tm_len;\n\tstatic const int\tm_fieldLen = 256;\n\tchar\t\t\t\tm_scratch[m_fieldLen];\n\tchar\t\t\t\tm_filenameField[m_fieldLen];\n\tchar\t\t\t\tm_testnameField[m_fieldLen];\n\tchar\t\t\t\tm_descField[m_fieldLen];\n\n\tbool isWhitespace (char c)\n\t{\n\t\tif (c == ' '  ||\n\t\t\tc == '\\t' ||\n\t\t\tc == '\\r' ||\n\t\t\tc == '\\n')\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid skipWhitespace (void)\n\t{\n\t\twhile (m_idx < m_len && isWhitespace(m_str[m_idx]))\n\t\t\tm_idx++;\n\t}\n\n\tvoid accept (char c)\n\t{\n\t\tif (m_str[m_idx] == c)\n\t\t\tm_idx++;\n\t}\n\n\tvoid expect (char c)\n\t{\n\t\tif (m_str[m_idx] != c || m_idx >= m_len)\n\t\t\tTCU_THROW(ResourceError, \"Error parsing amber index file\");\n\n\t\tm_idx++;\n\t}\n\n\tvoid captureString (char* field)\n\t{\n\t\tint i = 0;\n\n\t\twhile (m_idx < m_len && i < m_fieldLen && m_str[m_idx] != '\"')\n\t\t{\n\t\t\tfield[i] = m_str[m_idx];\n\t\t\ti++;\n\t\t\tm_idx++;\n\t\t}\n\n\t\tfield[i] = 0;\n\t\tm_idx++;\n\t}\n\n\npublic:\n\tAmberIndexFileParser (tcu::TestContext& testCtx, const char* filename, const char* category)\n\t{\n\t\tstd::string\tindexFilename(\"vulkan\/amber\/\");\n\t\tindexFilename.append(category);\n\t\tindexFilename.append(\"\/\");\n\t\tindexFilename.append(filename);\n\n\t\tm_str = ShaderSourceProvider::getSource(testCtx.getArchive(), indexFilename.c_str());\n\t\tm_len = m_str.length();\n\t\tm_idx = 0;\n\t}\n\n\t~AmberIndexFileParser (void) { }\n\n\tAmberTestCase* parse (const char* category, tcu::TestContext& testCtx)\n\t{\n\t\t\/\/ Format:\n\t\t\/\/ {\"filename\",\"test name\",\"description\"[,requirement[,requirement[,requirement..]]]}[,]\n\t\t\/\/ Things inside [] are optional. Whitespace is allowed everywhere.\n\t\t\/\/\n\t\t\/\/ For example, test without requirements might be:\n\t\t\/\/ {\"testname.amber\",\"test name\",\"test description\"},\n\n\t\tif (m_idx < m_len)\n\t\t{\n\t\t\tskipWhitespace();\n\t\t\texpect('{');\n\t\t\tskipWhitespace();\n\t\t\texpect('\"');\n\t\t\tcaptureString(m_filenameField);\n\t\t\tskipWhitespace();\n\t\t\texpect(',');\n\t\t\tskipWhitespace();\n\t\t\texpect('\"');\n\t\t\tcaptureString(m_testnameField);\n\t\t\tskipWhitespace();\n\t\t\texpect(',');\n\t\t\tskipWhitespace();\n\t\t\texpect('\"');\n\t\t\tcaptureString(m_descField);\n\t\t\tskipWhitespace();\n\n\t\t\tstd::string testFilename(\"vulkan\/amber\/\");\n\t\t\ttestFilename.append(category);\n\t\t\ttestFilename.append(\"\/\");\n\t\t\ttestFilename.append(m_filenameField);\n\t\t\tAmberTestCase *testCase = new AmberTestCase(testCtx, m_testnameField, m_descField, testFilename);\n\n\t\t\twhile (m_idx < m_len && m_str[m_idx] == ',')\n\t\t\t{\n\t\t\t\taccept(',');\n\t\t\t\tskipWhitespace();\n\t\t\t\texpect('\"');\n\t\t\t\tcaptureString(m_scratch);\n\t\t\t\tskipWhitespace();\n\t\t\t\ttestCase->addRequirement(m_scratch);\n\t\t\t}\n\n\t\t\texpect('}');\n\t\t\tskipWhitespace();\n\t\t\taccept(',');\n\t\t\tskipWhitespace();\n\t\t\treturn testCase;\n\t\t}\n\t\treturn 0;\n\t}\n};\n\nvoid createAmberTestsFromIndexFile (tcu::TestContext& testCtx, tcu::TestCaseGroup* group, const std::string filename, const char* category)\n{\n\tAmberTestCase*\t\t\ttestCase = 0;\n\tAmberIndexFileParser\tparser(testCtx, filename.c_str(), category);\n\n\tdo\n\t{\n\t\ttestCase = parser.parse(category, testCtx);\n\t\tif (testCase)\n\t\t{\n\t\t\tgroup->addChild(testCase);\n\t\t}\n\t} while (testCase);\n}\n\nAmberTestCase* createAmberTestCase (tcu::TestContext&\t\t\t\ttestCtx,\n\t\t\t\t\t\t\t\t\tconst char*\t\t\t\t\t\tname,\n\t\t\t\t\t\t\t\t\tconst char*\t\t\t\t\t\tdescription,\n\t\t\t\t\t\t\t\t\tconst char*\t\t\t\t\t\tcategory,\n\t\t\t\t\t\t\t\t\tconst std::string&\t\t\t\tfilename,\n\t\t\t\t\t\t\t\t\tconst std::vector<std::string>\trequirements)\n{\n\t\/\/ shader_test files are saved in <path>\/external\/vulkancts\/data\/vulkan\/amber\/<categoryname>\/\n\tstd::string readFilename(\"vulkan\/amber\/\");\n\treadFilename.append(category);\n\treadFilename.append(\"\/\");\n\treadFilename.append(filename);\n\n\tAmberTestCase *testCase = new AmberTestCase(testCtx, name, description, readFilename);\n\n\tfor (auto req : requirements)\n\t\ttestCase->addRequirement(req);\n\n\treturn testCase;\n}\n\n} \/\/ cts_amber\n} \/\/ vkt\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#ifndef PCL_FILTERS_IMPL_STATISTICAL_OUTLIER_REMOVAL_H_\n#define PCL_FILTERS_IMPL_STATISTICAL_OUTLIER_REMOVAL_H_\n\n#include \"pcl\/filters\/statistical_outlier_removal.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::StatisticalOutlierRemoval<PointT>::applyFilter (PointCloud &output)\n{\n  if (std_mul_ == 0.0)\n  {\n    PCL_ERROR (\"[pcl::%s::applyFilter] Standard deviation multiplier not set!\\n\", getClassName ().c_str ());\n    output.width = output.height = 0;\n    output.points.clear ();\n    return;\n  }\n\n  \/\/ Initialize the spatial locator\n  \/\/initTree (spatial_locator_type_, tree_, k_);\n\n  \/\/ TODO: fix this\n  tree_.reset (new KdTreeFLANN<PointT> ());\n\n  \/\/ Send the input dataset to the spatial locator\n  tree_->setInputCloud (input_);\n\n  \/\/ Allocate enough space to hold the results\n  std::vector<int> nn_indices (mean_k_);\n  std::vector<float> nn_dists (mean_k_);\n\n  std::vector<float> distances (indices_->size ());\n  \/\/ Go over all the points and calculate the mean or smallest distance\n  for (size_t cp = 0; cp < indices_->size (); ++cp)\n  {\n    if (!pcl_isfinite (input_->points[(*indices_)[cp]].x) ||\n        !pcl_isfinite (input_->points[(*indices_)[cp]].y) ||\n        !pcl_isfinite (input_->points[(*indices_)[cp]].z))\n    {\n      distances[cp] = 0;\n      continue;\n    }\n\n    if (tree_->nearestKSearch ((*indices_)[cp], mean_k_, nn_indices, nn_dists) == 0)\n    {\n      distances[cp] = 0;\n      PCL_WARN (\"[pcl::%s::applyFilter] Searching for the closest %d neighbors failed.\\n\", getClassName ().c_str (), mean_k_);\n      continue;\n    }\n\n    \/\/ Minimum distance (if mean_k_ == 2) or mean distance\n    double dist_sum = 0;\n    for (int j = 1; j < mean_k_; ++j)\n      dist_sum += sqrt (nn_dists[j]);\n    distances[cp] = dist_sum \/ (mean_k_-1);\n  }\n\n  \/\/ Estimate the mean and the standard deviation of the distance vector\n  double mean, stddev;\n  getMeanStd (distances, mean, stddev);\n  double distance_threshold = mean + std_mul_ * stddev; \/\/ a distance that is bigger than this signals an outlier\n\n  output.points.resize (input_->points.size ());      \/\/ reserve enough space\n  removed_indices_->resize (input_->points.size ());\n  \n  \/\/ Build a new cloud by neglecting outliers\n  int nr_p = 0;\n  int nr_removed_p = 0;\n  \n  for (size_t cp = 0; cp < indices_->size (); ++cp)\n  {\n    if (negative_)\n    {\n      if (distances[cp] <= distance_threshold)\n      {\n        if (extract_removed_indices_)\n        {\n          (*removed_indices_)[nr_removed_p] = cp;\n          nr_removed_p++;\n        }\n        continue;\n      }\n    }\n    else\n    {\n      if (distances[cp] > distance_threshold)\n      {\n        if (extract_removed_indices_)\n        {\n          (*removed_indices_)[nr_removed_p] = cp;\n          nr_removed_p++;\n        }\n        continue;\n      }\n    }\n\n    output.points[nr_p++] = input_->points[(*indices_)[cp]];\n  }\n\n  output.points.resize (nr_p);\n  output.width  = nr_p;\n  output.height = 1;\n  output.is_dense = true; \/\/ nearestKSearch filters invalid points\n\n  removed_indices_->resize (nr_removed_p);\n}\n\n#define PCL_INSTANTIATE_StatisticalOutlierRemoval(T) template class PCL_EXPORTS pcl::StatisticalOutlierRemoval<T>;\n\n#endif    \/\/ PCL_FILTERS_IMPL_STATISTICAL_OUTLIER_REMOVAL_H_\n\n<commit_msg>we do not care for the results to be sorted when using StatisticalAnalysis outlier removal<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#ifndef PCL_FILTERS_IMPL_STATISTICAL_OUTLIER_REMOVAL_H_\n#define PCL_FILTERS_IMPL_STATISTICAL_OUTLIER_REMOVAL_H_\n\n#include \"pcl\/filters\/statistical_outlier_removal.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::StatisticalOutlierRemoval<PointT>::applyFilter (PointCloud &output)\n{\n  if (std_mul_ == 0.0)\n  {\n    PCL_ERROR (\"[pcl::%s::applyFilter] Standard deviation multiplier not set!\\n\", getClassName ().c_str ());\n    output.width = output.height = 0;\n    output.points.clear ();\n    return;\n  }\n\n  \/\/ Initialize the spatial locator\n  \/\/initTree (spatial_locator_type_, tree_, k_);\n\n  \/\/ TODO: fix this\n  tree_.reset (new KdTreeFLANN<PointT> (false));\n\n  \/\/ Send the input dataset to the spatial locator\n  tree_->setInputCloud (input_);\n\n  \/\/ Allocate enough space to hold the results\n  std::vector<int> nn_indices (mean_k_);\n  std::vector<float> nn_dists (mean_k_);\n\n  std::vector<float> distances (indices_->size ());\n  \/\/ Go over all the points and calculate the mean or smallest distance\n  for (size_t cp = 0; cp < indices_->size (); ++cp)\n  {\n    if (!pcl_isfinite (input_->points[(*indices_)[cp]].x) ||\n        !pcl_isfinite (input_->points[(*indices_)[cp]].y) ||\n        !pcl_isfinite (input_->points[(*indices_)[cp]].z))\n    {\n      distances[cp] = 0;\n      continue;\n    }\n\n    if (tree_->nearestKSearch ((*indices_)[cp], mean_k_, nn_indices, nn_dists) == 0)\n    {\n      distances[cp] = 0;\n      PCL_WARN (\"[pcl::%s::applyFilter] Searching for the closest %d neighbors failed.\\n\", getClassName ().c_str (), mean_k_);\n      continue;\n    }\n\n    \/\/ Minimum distance (if mean_k_ == 2) or mean distance\n    double dist_sum = 0;\n    for (int j = 1; j < mean_k_; ++j)\n      dist_sum += sqrt (nn_dists[j]);\n    distances[cp] = dist_sum \/ (mean_k_-1);\n  }\n\n  \/\/ Estimate the mean and the standard deviation of the distance vector\n  double mean, stddev;\n  getMeanStd (distances, mean, stddev);\n  double distance_threshold = mean + std_mul_ * stddev; \/\/ a distance that is bigger than this signals an outlier\n\n  output.points.resize (input_->points.size ());      \/\/ reserve enough space\n  removed_indices_->resize (input_->points.size ());\n  \n  \/\/ Build a new cloud by neglecting outliers\n  int nr_p = 0;\n  int nr_removed_p = 0;\n  \n  for (size_t cp = 0; cp < indices_->size (); ++cp)\n  {\n    if (negative_)\n    {\n      if (distances[cp] <= distance_threshold)\n      {\n        if (extract_removed_indices_)\n        {\n          (*removed_indices_)[nr_removed_p] = cp;\n          nr_removed_p++;\n        }\n        continue;\n      }\n    }\n    else\n    {\n      if (distances[cp] > distance_threshold)\n      {\n        if (extract_removed_indices_)\n        {\n          (*removed_indices_)[nr_removed_p] = cp;\n          nr_removed_p++;\n        }\n        continue;\n      }\n    }\n\n    output.points[nr_p++] = input_->points[(*indices_)[cp]];\n  }\n\n  output.points.resize (nr_p);\n  output.width  = nr_p;\n  output.height = 1;\n  output.is_dense = true; \/\/ nearestKSearch filters invalid points\n\n  removed_indices_->resize (nr_removed_p);\n}\n\n#define PCL_INSTANTIATE_StatisticalOutlierRemoval(T) template class PCL_EXPORTS pcl::StatisticalOutlierRemoval<T>;\n\n#endif    \/\/ PCL_FILTERS_IMPL_STATISTICAL_OUTLIER_REMOVAL_H_\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"Green_Enemy.h\"\n#include\"j1Enemy.h\"\n#include<math.h>\n#include\"j1Map.h\"\n#include\"j1Pathfinding.h\"\n#include\"j1Player.h\"\nGreen_Enemy::Green_Enemy():Enemy(enemyType::green_enemy)\n{\n\tthis->sprites_vector = App->enemy->enemy_perf->sprites_vector;\n\tthis->entity_texture = App->enemy->enemy_perf->entity_texture;\n\tthis->ChangeAnimation(1);\n}\nGreen_Enemy::Green_Enemy(const Green_Enemy& g_enemy) :Enemy(enemyType::green_enemy)\n{\n\tthis->collider = g_enemy.collider;\n\tthis->logic_height = g_enemy.logic_height;\n\tthis->sprites_vector = App->enemy->enemy_perf->sprites_vector;\n\n}\n\nGreen_Enemy::~Green_Enemy()\n{\n}\n\nvoid Green_Enemy::Action()\n{\n\ttile_pos.x = pix_world_pos.x \/ 16;\n\ttile_pos.y = pix_world_pos.y \/ 16;\n\tif (player_in_range == nullptr) {\n\t\tiPoint actual_tile = pix_world_pos;\n\t\tif (passedtile == true) {\n\t\t\ttemp_point = array_pos;\n\t\t\tarray_pos = App->enemy->CalculatePath(this);\n\t\t\tif (array_pos == temp_point) {\n\t\t\t\tPath_Enemy.clear();\n\t\t\t}\n\n\t\t}\n\n\t\tint x = ((array_pos.x) - temp_point.x);\n\n\n\t\tint y = ((array_pos.y) - temp_point.y);\n\n\n\t\tpix_world_pos.x += x;\n\t\tpix_world_pos.y += y;\n\n\t\tif (x == 1) {\n\t\t\tEnemy_Orientation = OrientationEnemy::right_enemy;\n\t\t}\n\t\telse if (x == -1) {\n\t\t\tEnemy_Orientation = OrientationEnemy::left_enemy;\n\t\t}\n\t\telse if (y == 1) {\n\t\t\tEnemy_Orientation = OrientationEnemy::down_enemy;\n\t\t}\n\t\telse if (y == -1) {\n\t\t\tEnemy_Orientation = OrientationEnemy::up_enemy;\n\t\t}\n\n\n\t\tif ((actual_tile.x \/ 16) == array_pos.x && (actual_tile.y \/ 16) == array_pos.y) {\n\t\t\tpassedtile = true;\n\t\t}\n\t\telse {\n\t\t\tpassedtile = false;\n\t\t}\n\t}\n\telse {\n\t\t\n\n\t}\n}\n\nvoid Green_Enemy::Rang_Player()\n{\n\n\tiPoint dist;\n\tdist.x = App->player->Link->pos.x - this->pix_world_pos.x;\n\tdist.y = App->player->Link->pos.y - this->pix_world_pos.y;\n\tiPoint dist2;\n\tdist2.x = App->player->Zelda->pos.x - pix_world_pos.x;\n\tdist2.y = App->player->Zelda->pos.y - pix_world_pos.y;\n\n\t\tif (sqrt((dist.x*dist.x) + (dist.y*dist.y)) < RANG && enemy_doing_script==false) {\n\t\t\tplayer_in_range = App->player->Link;\n\t\t\t\/\/green_enemy_path.clear();\n\t\t\tif (tile_pos != iPoint(0, 0)) {\n\t\t\t\tif (App->pathfinding->SimpleAstar(tile_pos, player_in_range->tilepos) != nullptr) {\n\t\t\t\t\tgreen_enemy_path = *App->pathfinding->SimpleAstar(tile_pos, player_in_range->tilepos);\n\t\t\t\t}\n\t\t\t\tif (green_enemy_path.size()) {\n\t\t\t\t\tApp->pathfinding->Move(this, player_in_range);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\telse if (sqrt((dist2.x*dist2.x) + (dist2.y*dist2.y)) < RANG  && enemy_doing_script == false) {\n\t\t\tplayer_in_range = App->player->Zelda;\n\t\t\t\/\/green_enemy_path.clear();\n\t\t\tif (tile_pos != iPoint(0, 0)) {\n\t\t\t\tif (App->pathfinding->SimpleAstar(tile_pos, player_in_range->tilepos) != nullptr) {\n\t\t\t\t\tgreen_enemy_path = *App->pathfinding->SimpleAstar(tile_pos, player_in_range->tilepos);\n\t\t\t\t}\n\t\t\t\tif (green_enemy_path.size()) {\n\t\t\t\t\tApp->pathfinding->Move(this, player_in_range);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\n\n\n\t\/*\n\t\telse {\n\t\t\tplayer_in_range = nullptr;\n\t\t\t\/\/App->pathfinding->last_path.clear();\n\t\t\tgreen_enemy_path.clear();\n\t\t}\n\t\t*\/\n\t\t\n\t\n\n}\n\n\n<commit_msg>Enemies don't follow player if is in second level<commit_after>#include \"Green_Enemy.h\"\n#include\"j1Enemy.h\"\n#include<math.h>\n#include\"j1Map.h\"\n#include\"j1Pathfinding.h\"\n#include\"j1Player.h\"\nGreen_Enemy::Green_Enemy():Enemy(enemyType::green_enemy)\n{\n\tthis->sprites_vector = App->enemy->enemy_perf->sprites_vector;\n\tthis->entity_texture = App->enemy->enemy_perf->entity_texture;\n\tthis->ChangeAnimation(1);\n}\nGreen_Enemy::Green_Enemy(const Green_Enemy& g_enemy) :Enemy(enemyType::green_enemy)\n{\n\tthis->collider = g_enemy.collider;\n\tthis->logic_height = g_enemy.logic_height;\n\tthis->sprites_vector = App->enemy->enemy_perf->sprites_vector;\n\n}\n\nGreen_Enemy::~Green_Enemy()\n{\n}\n\nvoid Green_Enemy::Action()\n{\n\ttile_pos.x = pix_world_pos.x \/ 16;\n\ttile_pos.y = pix_world_pos.y \/ 16;\n\tif (player_in_range == nullptr) {\n\t\tiPoint actual_tile = pix_world_pos;\n\t\tif (passedtile == true) {\n\t\t\ttemp_point = array_pos;\n\t\t\tarray_pos = App->enemy->CalculatePath(this);\n\t\t\tif (array_pos == temp_point) {\n\t\t\t\tPath_Enemy.clear();\n\t\t\t}\n\n\t\t}\n\n\t\tint x = ((array_pos.x) - temp_point.x);\n\n\n\t\tint y = ((array_pos.y) - temp_point.y);\n\n\n\t\tpix_world_pos.x += x;\n\t\tpix_world_pos.y += y;\n\n\t\tif (x == 1) {\n\t\t\tEnemy_Orientation = OrientationEnemy::right_enemy;\n\t\t}\n\t\telse if (x == -1) {\n\t\t\tEnemy_Orientation = OrientationEnemy::left_enemy;\n\t\t}\n\t\telse if (y == 1) {\n\t\t\tEnemy_Orientation = OrientationEnemy::down_enemy;\n\t\t}\n\t\telse if (y == -1) {\n\t\t\tEnemy_Orientation = OrientationEnemy::up_enemy;\n\t\t}\n\n\n\t\tif ((actual_tile.x \/ 16) == array_pos.x && (actual_tile.y \/ 16) == array_pos.y) {\n\t\t\tpassedtile = true;\n\t\t}\n\t\telse {\n\t\t\tpassedtile = false;\n\t\t}\n\t}\n\telse {\n\t\t\n\n\t}\n}\n\nvoid Green_Enemy::Rang_Player()\n{\n\n\tiPoint dist;\n\tdist.x = App->player->Link->pos.x - this->pix_world_pos.x;\n\tdist.y = App->player->Link->pos.y - this->pix_world_pos.y;\n\tiPoint dist2;\n\tdist2.x = App->player->Zelda->pos.x - pix_world_pos.x;\n\tdist2.y = App->player->Zelda->pos.y - pix_world_pos.y;\n\n\t\tif (sqrt((dist.x*dist.x) + (dist.y*dist.y)) < RANG && enemy_doing_script==false) {\n\t\t\tplayer_in_range = App->player->Link;\n\t\t\t\/\/green_enemy_path.clear();\n\t\t\tif (tile_pos != iPoint(0, 0)) {\n\t\t\t\tif (App->pathfinding->SimpleAstar(tile_pos, player_in_range->tilepos) != nullptr && player_in_range->GetLogicHeightPlayer()==0) {\n\t\t\t\t\tgreen_enemy_path = *App->pathfinding->SimpleAstar(tile_pos, player_in_range->tilepos);\n\t\t\t\t}\n\t\t\t\tif (green_enemy_path.size()) {\n\t\t\t\t\tApp->pathfinding->Move(this, player_in_range);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\telse if (sqrt((dist2.x*dist2.x) + (dist2.y*dist2.y)) < RANG  && enemy_doing_script == false) {\n\t\t\tplayer_in_range = App->player->Zelda;\n\t\t\t\/\/green_enemy_path.clear();\n\t\t\tif (tile_pos != iPoint(0, 0)) {\n\t\t\t\tif (App->pathfinding->SimpleAstar(tile_pos, player_in_range->tilepos) != nullptr && player_in_range->GetLogicHeightPlayer() == 0) {\n\t\t\t\t\tgreen_enemy_path = *App->pathfinding->SimpleAstar(tile_pos, player_in_range->tilepos);\n\t\t\t\t}\n\t\t\t\tif (green_enemy_path.size()) {\n\t\t\t\t\tApp->pathfinding->Move(this, player_in_range);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\n\n\n\t\/*\n\t\telse {\n\t\t\tplayer_in_range = nullptr;\n\t\t\t\/\/App->pathfinding->last_path.clear();\n\t\t\tgreen_enemy_path.clear();\n\t\t}\n\t\t*\/\n\t\t\n\t\n\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The rule of zero\n\n#include <memory>\n#include <vector>\n\nclass foo\n{\n\tprivate:\n\t\tint x = 10;\n\t\tstd::vector<int> v = {1, 2, 3, 4, 5};\n};\n\nclass bar\n{\n\tpublic:\n\t\tstd::unique_ptr<int> p = std::make_unique<int>(5);\n};\n\n\/\/ Utilise the value semantics of existing types to avoid having to\n\/\/ implement custom copy and move operations.\n\/\/ \n\/\/ The *rule of zero* states that we can avoid writing any custom\n\/\/ copy\/move constructors, assignment operators, or destructors by\n\/\/ using existing types that support the appropriate copy\/move\n\/\/ semantics.\n\/\/ \n\/\/ The class `foo` on [6-11], for example, does not perform any\n\/\/ manual memory management, yet correctly supports copies and\n\/\/ moves without any memory leaks. The defaulted copy\/move\n\/\/ constructors and assignment operators will simply copy or move\n\/\/ each member. For the `int` `x` ([9]), this will copy its value.\n\/\/ For `v` ([10]), which is a [`std::vector`](cpp\/container\/vector),\n\/\/ all of its elements will be copied over.\n\/\/ \n\/\/ The class `bar` on [13-17] is not copyable by default because it\n\/\/ has a [`std::unique_ptr`](cpp\/memory\/unique_ptr) member which\n\/\/ itself is not copyable. However, it correctly supports move\n\/\/ operations, which will transfer ownership of the dynamically\n\/\/ allocated resource.\n\nint main()\n{\n\tfoo f1;\n\tfoo f2 = f1;\n\n\tbar b1;\n\tbar b2 = std::move(b2);\n}\n<commit_msg>Fix bug in rule of zero sample<commit_after>\/\/ The rule of zero\n\n#include <memory>\n#include <vector>\n\nclass foo\n{\n\tprivate:\n\t\tint x = 10;\n\t\tstd::vector<int> v = {1, 2, 3, 4, 5};\n};\n\nclass bar\n{\n\tpublic:\n\t\tstd::unique_ptr<int> p = std::make_unique<int>(5);\n};\n\n\/\/ Utilise the value semantics of existing types to avoid having to\n\/\/ implement custom copy and move operations.\n\/\/ \n\/\/ The *rule of zero* states that we can avoid writing any custom\n\/\/ copy\/move constructors, assignment operators, or destructors by\n\/\/ using existing types that support the appropriate copy\/move\n\/\/ semantics.\n\/\/ \n\/\/ The class `foo` on [6-11], for example, does not perform any\n\/\/ manual memory management, yet correctly supports copies and\n\/\/ moves without any memory leaks. The defaulted copy\/move\n\/\/ constructors and assignment operators will simply copy or move\n\/\/ each member. For the `int` `x` ([9]), this will copy its value.\n\/\/ For `v` ([10]), which is a [`std::vector`](cpp\/container\/vector),\n\/\/ all of its elements will be copied over.\n\/\/ \n\/\/ The class `bar` on [13-17] is not copyable by default because it\n\/\/ has a [`std::unique_ptr`](cpp\/memory\/unique_ptr) member which\n\/\/ itself is not copyable. However, it correctly supports move\n\/\/ operations, which will transfer ownership of the dynamically\n\/\/ allocated resource.\n\nint main()\n{\n\tfoo f1;\n\tfoo f2 = f1;\n\n\tbar b1;\n\tbar b2 = std::move(b1);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n**\n** Copyright (C) 2009-2011 Kyle Lutz <kyle.r.lutz@gmail.com>\n** All rights reserved.\n**\n** This file is a part of the chemkit project. For more information\n** see <http:\/\/www.chemkit.org>.\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 the\n**     documentation and\/or other materials provided with the distribution.\n**   * Neither the name of the chemkit project 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******************************************************************************\/\n\n#include <string>\n#include <iostream>\n\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/algorithm\/string.hpp>\n\n#include <chemkit\/chemkit.h>\n#include <chemkit\/moleculefile.h>\n\nvoid printHelp(char *argv[], const boost::program_options::options_description &options)\n{\n    std::cout << \"Usage: \" << argv[0] << \" [OPTIONS] inputFile outputFile\\n\";\n    std::cout << \"\\n\";\n    std::cout << \"Converts a chemical input file to a new file with\\n\";\n    std::cout << \"a different file format.\\n\";\n    std::cout << \"\\n\";\n    std::cout << \"Options:\\n\";\n    std::cout << options << \"\\n\";\n}\n\nint main(int argc, char *argv[])\n{\n    std::string inputFileName;\n    std::string inputFormatName;\n    std::string outputFileName;\n    std::string outputFormatName;\n\n    boost::program_options::options_description options;\n    options.add_options()\n        (\"input-file\",\n            boost::program_options::value<std::string>(&inputFileName),\n            \"The input file.\")\n        (\"output-file\",\n            boost::program_options::value<std::string>(&outputFileName),\n            \"The output file.\")\n        (\"input-format,i\",\n            boost::program_options::value<std::string>(&inputFormatName),\n            \"Sets the input format.\")\n        (\"output-format,o\",\n            boost::program_options::value<std::string>(&outputFormatName),\n            \"Sets the output format.\")\n        (\"help,h\",\n            \"Shows this help message\");\n\n    boost::program_options::positional_options_description positionalOptions;\n    positionalOptions.add(\"input-file\", 1).add(\"output-file\", 1);\n\n    boost::program_options::variables_map variables;\n    boost::program_options::store(\n        boost::program_options::command_line_parser(argc, argv)\n            .options(options)\n            .positional(positionalOptions).run(),\n        variables);\n    boost::program_options::notify(variables);\n\n    if(variables.count(\"help\")){\n        printHelp(argv, options);\n        return 0;\n    }\n    else if(inputFileName.empty()){\n        printHelp(argv, options);\n        std::cerr << \"Error: No input file specified.\" << std::endl;\n        return -1;\n    }\n    else if(outputFileName.empty()){\n        printHelp(argv, options);\n        std::cerr << \"Error: No output file specified.\" << std::endl;\n        return -1;\n    }\n\n    \/\/ read input\n    chemkit::MoleculeFile inputFile(inputFileName);\n    if(!inputFormatName.empty()){\n        inputFile.setFormat(inputFormatName);\n    }\n\n    bool ok = inputFile.read();\n    if(!ok){\n        std::cerr << \"Error: Failed to read input file: \" << inputFile.errorString() << std::endl;\n        return -1;\n    }\n\n    \/\/ write output\n    if(outputFormatName.empty()){\n        ok = inputFile.write(outputFileName);\n    }\n    else{\n        ok = inputFile.write(outputFileName, outputFormatName);\n    }\n\n    if(!ok){\n        std::cerr << \"Error: failed to write output file: \" << inputFile.errorString() << std::endl;\n        return -1;\n    }\n\n    return 0;\n}\n<commit_msg>Add support for using stdin\/stdout in chemkit-convert<commit_after>\/******************************************************************************\n**\n** Copyright (C) 2009-2011 Kyle Lutz <kyle.r.lutz@gmail.com>\n** All rights reserved.\n**\n** This file is a part of the chemkit project. For more information\n** see <http:\/\/www.chemkit.org>.\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 the\n**     documentation and\/or other materials provided with the distribution.\n**   * Neither the name of the chemkit project 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******************************************************************************\/\n\n#include <string>\n#include <iostream>\n\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/algorithm\/string.hpp>\n\n#include <chemkit\/chemkit.h>\n#include <chemkit\/moleculefile.h>\n\nvoid printHelp(char *argv[], const boost::program_options::options_description &options)\n{\n    std::cout << \"Usage: \" << argv[0] << \" [OPTIONS] inputFile outputFile\\n\";\n    std::cout << \"\\n\";\n    std::cout << \"Converts a chemical input file to a new file with\\n\";\n    std::cout << \"a different file format.\\n\";\n    std::cout << \"\\n\";\n    std::cout << \"Options:\\n\";\n    std::cout << options << \"\\n\";\n}\n\nint main(int argc, char *argv[])\n{\n    std::string inputFileName;\n    std::string inputFormatName;\n    std::string outputFileName;\n    std::string outputFormatName;\n\n    boost::program_options::options_description options;\n    options.add_options()\n        (\"input-file\",\n            boost::program_options::value<std::string>(&inputFileName),\n            \"The input file.\")\n        (\"output-file\",\n            boost::program_options::value<std::string>(&outputFileName),\n            \"The output file.\")\n        (\"input-format,i\",\n            boost::program_options::value<std::string>(&inputFormatName),\n            \"Sets the input format.\")\n        (\"output-format,o\",\n            boost::program_options::value<std::string>(&outputFormatName),\n            \"Sets the output format.\")\n        (\"help,h\",\n            \"Shows this help message\");\n\n    boost::program_options::positional_options_description positionalOptions;\n    positionalOptions.add(\"input-file\", 1).add(\"output-file\", 1);\n\n    boost::program_options::variables_map variables;\n    boost::program_options::store(\n        boost::program_options::command_line_parser(argc, argv)\n            .options(options)\n            .positional(positionalOptions).run(),\n        variables);\n    boost::program_options::notify(variables);\n\n    if(variables.count(\"help\")){\n        printHelp(argv, options);\n        return 0;\n    }\n    else if(inputFileName.empty()){\n        printHelp(argv, options);\n        std::cerr << \"Error: No input file specified.\" << std::endl;\n        return -1;\n    }\n    else if(outputFileName.empty()){\n        printHelp(argv, options);\n        std::cerr << \"Error: No output file specified.\" << std::endl;\n        return -1;\n    }\n\n    \/\/ read input\n    chemkit::MoleculeFile inputFile;\n    if(!inputFormatName.empty()){\n        inputFile.setFormat(inputFormatName);\n    }\n\n    bool ok = false;\n    if(inputFileName == \"-\"){\n        ok = inputFile.read(std::cin);\n    }\n    else{\n        ok = inputFile.read(inputFileName);\n    }\n\n    if(!ok){\n        std::cerr << \"Error: Failed to read input file: \" << inputFile.errorString() << std::endl;\n        return -1;\n    }\n\n    \/\/ write output\n    if(outputFormatName.empty()){\n        ok = inputFile.write(outputFileName);\n    }\n    else{\n        if(outputFileName == \"-\"){\n            ok = inputFile.write(std::cout, outputFormatName);\n        }\n        else{\n            ok = inputFile.write(outputFileName, outputFormatName);\n        }\n    }\n\n    if(!ok){\n        std::cerr << \"Error: failed to write output file: \" << inputFile.errorString() << std::endl;\n        return -1;\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2017 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 \"partition_version.hh\"\n#include \"flat_mutation_reader.hh\"\n\nstruct partition_snapshot_reader_dummy_accounter {\n   void operator()(const clustering_row& cr) {}\n   void operator()(const static_row& sr) {}\n   void operator()(const range_tombstone& rt) {}\n   void operator()(const partition_start& ph) {}\n   void operator()(const partition_end& eop) {}\n};\nextern partition_snapshot_reader_dummy_accounter no_accounter;\n\ninline void maybe_merge_versions(lw_shared_ptr<partition_snapshot>& snp,\n                                 logalloc::region& lsa_region,\n                                 logalloc::allocating_section& read_section) {\n    if (!snp.owned()) {\n        return;\n    }\n    \/\/ If no one else is using this particular snapshot try to merge partition\n    \/\/ versions.\n    with_allocator(lsa_region.allocator(), [&snp, &lsa_region, &read_section] {\n        return with_linearized_managed_bytes([&snp, &lsa_region, &read_section] {\n            try {\n                \/\/ Allocating sections require the region to be reclaimable\n                \/\/ which means that they cannot be nested.\n                \/\/ It is, however, possible, that if the snapshot is taken\n                \/\/ inside an allocating section and then an exception is thrown\n                \/\/ this function will be called to clean up even though we\n                \/\/ still will be in the context of the allocating section.\n                if (lsa_region.reclaiming_enabled()) {\n                    read_section(lsa_region, [&snp] {\n                        snp->merge_partition_versions();\n                    });\n                }\n            } catch (...) { }\n            snp = {};\n        });\n    });\n}\n\ntemplate <typename MemoryAccounter = partition_snapshot_reader_dummy_accounter>\nclass partition_snapshot_flat_reader : public flat_mutation_reader::impl, public MemoryAccounter {\n    struct rows_position {\n        mutation_partition::rows_type::const_iterator _position;\n        mutation_partition::rows_type::const_iterator _end;\n    };\n\n    class heap_compare {\n        rows_entry::compare _cmp;\n    public:\n        explicit heap_compare(const schema& s) : _cmp(s) { }\n        bool operator()(const rows_position& a, const rows_position& b) {\n            return _cmp(*b._position, *a._position);\n        }\n    };\nprivate:\n    \/\/ Keeps shared pointer to the container we read mutation from to make sure\n    \/\/ that its lifetime is appropriately extended.\n    boost::any _container_guard;\n\n    query::clustering_key_filter_ranges _ck_ranges;\n    query::clustering_row_ranges::const_iterator _current_ck_range;\n    query::clustering_row_ranges::const_iterator _ck_range_end;\n    bool _in_ck_range = false;\n\n    rows_entry::compare _cmp;\n    position_in_partition::equal_compare _eq;\n    heap_compare _heap_cmp;\n\n    lw_shared_ptr<partition_snapshot> _snapshot;\n    stdx::optional<position_in_partition> _last_entry;\n\n    std::vector<rows_position> _clustering_rows;\n\n    range_tombstone_stream _range_tombstones;\n\n    logalloc::region& _lsa_region;\n    logalloc::allocating_section& _read_section;\n\n    MemoryAccounter& mem_accounter() {\n        return *this;\n    }\n\n    partition_snapshot::change_mark _change_mark;\nprivate:\n    void refresh_iterators() {\n        _clustering_rows.clear();\n\n        if (!_in_ck_range) {\n            if (_current_ck_range == _ck_range_end) {\n                _end_of_stream = true;\n                return;\n            }\n            for (auto&& v : _snapshot->versions()) {\n                _range_tombstones.apply(v.partition().row_tombstones(), *_current_ck_range);\n            }\n        }\n\n        for (auto&& v : _snapshot->versions()) {\n            auto cr_end = v.partition().upper_bound(*_schema, *_current_ck_range);\n            auto cr = [&] () -> mutation_partition::rows_type::const_iterator {\n                if (_in_ck_range) {\n                    return v.partition().clustered_rows().upper_bound(*_last_entry, _cmp);\n                } else {\n                    return v.partition().lower_bound(*_schema, *_current_ck_range);\n                }\n            }();\n\n            if (cr != cr_end) {\n                _clustering_rows.emplace_back(rows_position { cr, cr_end });\n            }\n        }\n\n        _in_ck_range = true;\n        boost::range::make_heap(_clustering_rows, _heap_cmp);\n    }\n\n    \/\/ Valid if has_more_rows()\n    const rows_entry& pop_clustering_row() {\n        boost::range::pop_heap(_clustering_rows, _heap_cmp);\n        auto& current = _clustering_rows.back();\n        const rows_entry& e = *current._position;\n        current._position = std::next(current._position);\n        if (current._position == current._end) {\n            _clustering_rows.pop_back();\n        } else {\n            boost::range::push_heap(_clustering_rows, _heap_cmp);\n        }\n        return e;\n    }\n\n    \/\/ Valid if has_more_rows()\n    const rows_entry& peek_row() const {\n        return *_clustering_rows.front()._position;\n    }\n\n    bool has_more_rows() const {\n        return !_clustering_rows.empty();\n    }\n\n    mutation_fragment_opt read_static_row() {\n        _last_entry = position_in_partition(position_in_partition::static_row_tag_t());\n        return mutation_fragment(_snapshot->static_row());\n    }\n\n    mutation_fragment_opt read_next() {\n        while (has_more_rows()) {\n            auto mf = _range_tombstones.get_next(peek_row());\n            if (mf) {\n                return mf;\n            }\n            const rows_entry& e = pop_clustering_row();\n            if (e.dummy()) {\n                continue;\n            }\n            clustering_row result = e;\n            while (has_more_rows() && _eq(peek_row().position(), result.position())) {\n                result.apply(*_schema, pop_clustering_row());\n            }\n            _last_entry = position_in_partition(result.position());\n            return mutation_fragment(std::move(result));\n        }\n        return _range_tombstones.get_next(position_in_partition_view::for_range_end(*_current_ck_range));\n    }\n\n    void emplace_mutation_fragment(mutation_fragment&& mfopt) {\n        mfopt.visit(mem_accounter());\n        push_mutation_fragment(std::move(mfopt));\n    }\n\n    void do_fill_buffer() {\n        if (!_last_entry) {\n            auto mfopt = read_static_row();\n            if (mfopt) {\n                emplace_mutation_fragment(std::move(*mfopt));\n            }\n        }\n\n        auto mark = _snapshot->get_change_mark();\n        if (!_in_ck_range || mark != _change_mark) {\n            refresh_iterators();\n            _change_mark = mark;\n        }\n\n        while (!is_end_of_stream() && !is_buffer_full()) {\n            auto mfopt = read_next();\n            if (mfopt) {\n                emplace_mutation_fragment(std::move(*mfopt));\n            } else {\n                _in_ck_range = false;\n                _current_ck_range = std::next(_current_ck_range);\n                refresh_iterators();\n            }\n        }\n        if (is_end_of_stream()) {\n            push_mutation_fragment(partition_end());\n        }\n    }\n\n    static tombstone tomb(partition_snapshot& snp) {\n        tombstone t;\n        for (auto& v : snp.versions()) {\n            t.apply(v.partition().partition_tombstone());\n        }\n        return t;\n    }\npublic:\n    template <typename... Args>\n    partition_snapshot_flat_reader(schema_ptr s, dht::decorated_key dk, lw_shared_ptr<partition_snapshot> snp,\n                              query::clustering_key_filter_ranges crr,\n                              logalloc::region& region, logalloc::allocating_section& read_section,\n                              boost::any pointer_to_container, Args&&... args)\n        : impl(std::move(s))\n        , MemoryAccounter(std::forward<Args>(args)...)\n        , _container_guard(std::move(pointer_to_container))\n        , _ck_ranges(std::move(crr))\n        , _current_ck_range(_ck_ranges.begin())\n        , _ck_range_end(_ck_ranges.end())\n        , _cmp(*_schema)\n        , _eq(*_schema)\n        , _heap_cmp(*_schema)\n        , _snapshot(snp)\n        , _range_tombstones(*_schema)\n        , _lsa_region(region)\n        , _read_section(read_section) {\n        push_mutation_fragment(partition_start(std::move(dk), tomb(*snp)));\n        do_fill_buffer();\n    }\n\n    ~partition_snapshot_flat_reader() {\n        maybe_merge_versions(_snapshot, _lsa_region, _read_section);\n    }\n\n    virtual future<> fill_buffer() override {\n        return _read_section(_lsa_region, [&] {\n            return with_linearized_managed_bytes([&] {\n                do_fill_buffer();\n                return make_ready_future<>();\n            });\n        });\n    }\n    virtual void next_partition() override {\n        clear_buffer_to_next_partition();\n        if (is_buffer_empty()) {\n            _end_of_stream = true;\n        }\n    }\n    virtual future<> fast_forward_to(const dht::partition_range& pr) override {\n        throw std::runtime_error(\"This reader can't be fast forwarded to another partition.\");\n    };\n    virtual future<> fast_forward_to(position_range cr) override {\n        throw std::runtime_error(\"This reader can't be fast forwarded to another position.\");\n    };\n};\n\ntemplate <typename MemoryAccounter, typename... Args>\ninline flat_mutation_reader\nmake_partition_snapshot_flat_reader(schema_ptr s,\n                                    dht::decorated_key dk,\n                                    query::clustering_key_filter_ranges crr,\n                                    lw_shared_ptr<partition_snapshot> snp,\n                                    logalloc::region& region,\n                                    logalloc::allocating_section& read_section,\n                                    boost::any pointer_to_container,\n                                    streamed_mutation::forwarding fwd,\n                                    Args&&... args)\n{\n    auto res = make_flat_mutation_reader<partition_snapshot_flat_reader<MemoryAccounter>>(std::move(s), std::move(dk),\n            snp, std::move(crr), region, read_section, std::move(pointer_to_container), std::forward<Args>(args)...);\n    if (fwd) {\n        return make_forwardable(std::move(res)); \/\/ FIXME: optimize\n    } else {\n        return std::move(res);\n    }\n}\n\ninline flat_mutation_reader\nmake_partition_snapshot_flat_reader(schema_ptr s,\n                                    dht::decorated_key dk,\n                                    query::clustering_key_filter_ranges crr,\n                                    lw_shared_ptr<partition_snapshot> snp,\n                                    logalloc::region& region,\n                                    logalloc::allocating_section& read_section,\n                                    boost::any pointer_to_container,\n                                    streamed_mutation::forwarding fwd)\n{\n    return make_partition_snapshot_flat_reader<partition_snapshot_reader_dummy_accounter>(std::move(s),\n            std::move(dk), std::move(crr), std::move(snp), region, read_section, std::move(pointer_to_container), fwd);\n}\n<commit_msg>partition_snapshot_reader: Don't push empty static rows<commit_after>\/*\n * Copyright (C) 2017 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 \"partition_version.hh\"\n#include \"flat_mutation_reader.hh\"\n\nstruct partition_snapshot_reader_dummy_accounter {\n   void operator()(const clustering_row& cr) {}\n   void operator()(const static_row& sr) {}\n   void operator()(const range_tombstone& rt) {}\n   void operator()(const partition_start& ph) {}\n   void operator()(const partition_end& eop) {}\n};\nextern partition_snapshot_reader_dummy_accounter no_accounter;\n\ninline void maybe_merge_versions(lw_shared_ptr<partition_snapshot>& snp,\n                                 logalloc::region& lsa_region,\n                                 logalloc::allocating_section& read_section) {\n    if (!snp.owned()) {\n        return;\n    }\n    \/\/ If no one else is using this particular snapshot try to merge partition\n    \/\/ versions.\n    with_allocator(lsa_region.allocator(), [&snp, &lsa_region, &read_section] {\n        return with_linearized_managed_bytes([&snp, &lsa_region, &read_section] {\n            try {\n                \/\/ Allocating sections require the region to be reclaimable\n                \/\/ which means that they cannot be nested.\n                \/\/ It is, however, possible, that if the snapshot is taken\n                \/\/ inside an allocating section and then an exception is thrown\n                \/\/ this function will be called to clean up even though we\n                \/\/ still will be in the context of the allocating section.\n                if (lsa_region.reclaiming_enabled()) {\n                    read_section(lsa_region, [&snp] {\n                        snp->merge_partition_versions();\n                    });\n                }\n            } catch (...) { }\n            snp = {};\n        });\n    });\n}\n\ntemplate <typename MemoryAccounter = partition_snapshot_reader_dummy_accounter>\nclass partition_snapshot_flat_reader : public flat_mutation_reader::impl, public MemoryAccounter {\n    struct rows_position {\n        mutation_partition::rows_type::const_iterator _position;\n        mutation_partition::rows_type::const_iterator _end;\n    };\n\n    class heap_compare {\n        rows_entry::compare _cmp;\n    public:\n        explicit heap_compare(const schema& s) : _cmp(s) { }\n        bool operator()(const rows_position& a, const rows_position& b) {\n            return _cmp(*b._position, *a._position);\n        }\n    };\nprivate:\n    \/\/ Keeps shared pointer to the container we read mutation from to make sure\n    \/\/ that its lifetime is appropriately extended.\n    boost::any _container_guard;\n\n    query::clustering_key_filter_ranges _ck_ranges;\n    query::clustering_row_ranges::const_iterator _current_ck_range;\n    query::clustering_row_ranges::const_iterator _ck_range_end;\n    bool _in_ck_range = false;\n\n    rows_entry::compare _cmp;\n    position_in_partition::equal_compare _eq;\n    heap_compare _heap_cmp;\n\n    lw_shared_ptr<partition_snapshot> _snapshot;\n    stdx::optional<position_in_partition> _last_entry;\n\n    std::vector<rows_position> _clustering_rows;\n\n    range_tombstone_stream _range_tombstones;\n\n    logalloc::region& _lsa_region;\n    logalloc::allocating_section& _read_section;\n\n    MemoryAccounter& mem_accounter() {\n        return *this;\n    }\n\n    partition_snapshot::change_mark _change_mark;\nprivate:\n    void refresh_iterators() {\n        _clustering_rows.clear();\n\n        if (!_in_ck_range) {\n            if (_current_ck_range == _ck_range_end) {\n                _end_of_stream = true;\n                return;\n            }\n            for (auto&& v : _snapshot->versions()) {\n                _range_tombstones.apply(v.partition().row_tombstones(), *_current_ck_range);\n            }\n        }\n\n        for (auto&& v : _snapshot->versions()) {\n            auto cr_end = v.partition().upper_bound(*_schema, *_current_ck_range);\n            auto cr = [&] () -> mutation_partition::rows_type::const_iterator {\n                if (_in_ck_range) {\n                    return v.partition().clustered_rows().upper_bound(*_last_entry, _cmp);\n                } else {\n                    return v.partition().lower_bound(*_schema, *_current_ck_range);\n                }\n            }();\n\n            if (cr != cr_end) {\n                _clustering_rows.emplace_back(rows_position { cr, cr_end });\n            }\n        }\n\n        _in_ck_range = true;\n        boost::range::make_heap(_clustering_rows, _heap_cmp);\n    }\n\n    \/\/ Valid if has_more_rows()\n    const rows_entry& pop_clustering_row() {\n        boost::range::pop_heap(_clustering_rows, _heap_cmp);\n        auto& current = _clustering_rows.back();\n        const rows_entry& e = *current._position;\n        current._position = std::next(current._position);\n        if (current._position == current._end) {\n            _clustering_rows.pop_back();\n        } else {\n            boost::range::push_heap(_clustering_rows, _heap_cmp);\n        }\n        return e;\n    }\n\n    \/\/ Valid if has_more_rows()\n    const rows_entry& peek_row() const {\n        return *_clustering_rows.front()._position;\n    }\n\n    bool has_more_rows() const {\n        return !_clustering_rows.empty();\n    }\n\n    mutation_fragment_opt read_static_row() {\n        _last_entry = position_in_partition(position_in_partition::static_row_tag_t());\n        auto sr = _snapshot->static_row();\n        if (!sr.empty()) {\n            return mutation_fragment(std::move(sr));\n        }\n        return stdx::nullopt;\n    }\n\n    mutation_fragment_opt read_next() {\n        while (has_more_rows()) {\n            auto mf = _range_tombstones.get_next(peek_row());\n            if (mf) {\n                return mf;\n            }\n            const rows_entry& e = pop_clustering_row();\n            if (e.dummy()) {\n                continue;\n            }\n            clustering_row result = e;\n            while (has_more_rows() && _eq(peek_row().position(), result.position())) {\n                result.apply(*_schema, pop_clustering_row());\n            }\n            _last_entry = position_in_partition(result.position());\n            return mutation_fragment(std::move(result));\n        }\n        return _range_tombstones.get_next(position_in_partition_view::for_range_end(*_current_ck_range));\n    }\n\n    void emplace_mutation_fragment(mutation_fragment&& mfopt) {\n        mfopt.visit(mem_accounter());\n        push_mutation_fragment(std::move(mfopt));\n    }\n\n    void do_fill_buffer() {\n        if (!_last_entry) {\n            auto mfopt = read_static_row();\n            if (mfopt) {\n                emplace_mutation_fragment(std::move(*mfopt));\n            }\n        }\n\n        auto mark = _snapshot->get_change_mark();\n        if (!_in_ck_range || mark != _change_mark) {\n            refresh_iterators();\n            _change_mark = mark;\n        }\n\n        while (!is_end_of_stream() && !is_buffer_full()) {\n            auto mfopt = read_next();\n            if (mfopt) {\n                emplace_mutation_fragment(std::move(*mfopt));\n            } else {\n                _in_ck_range = false;\n                _current_ck_range = std::next(_current_ck_range);\n                refresh_iterators();\n            }\n        }\n        if (is_end_of_stream()) {\n            push_mutation_fragment(partition_end());\n        }\n    }\n\n    static tombstone tomb(partition_snapshot& snp) {\n        tombstone t;\n        for (auto& v : snp.versions()) {\n            t.apply(v.partition().partition_tombstone());\n        }\n        return t;\n    }\npublic:\n    template <typename... Args>\n    partition_snapshot_flat_reader(schema_ptr s, dht::decorated_key dk, lw_shared_ptr<partition_snapshot> snp,\n                              query::clustering_key_filter_ranges crr,\n                              logalloc::region& region, logalloc::allocating_section& read_section,\n                              boost::any pointer_to_container, Args&&... args)\n        : impl(std::move(s))\n        , MemoryAccounter(std::forward<Args>(args)...)\n        , _container_guard(std::move(pointer_to_container))\n        , _ck_ranges(std::move(crr))\n        , _current_ck_range(_ck_ranges.begin())\n        , _ck_range_end(_ck_ranges.end())\n        , _cmp(*_schema)\n        , _eq(*_schema)\n        , _heap_cmp(*_schema)\n        , _snapshot(snp)\n        , _range_tombstones(*_schema)\n        , _lsa_region(region)\n        , _read_section(read_section) {\n        push_mutation_fragment(partition_start(std::move(dk), tomb(*snp)));\n        do_fill_buffer();\n    }\n\n    ~partition_snapshot_flat_reader() {\n        maybe_merge_versions(_snapshot, _lsa_region, _read_section);\n    }\n\n    virtual future<> fill_buffer() override {\n        return _read_section(_lsa_region, [&] {\n            return with_linearized_managed_bytes([&] {\n                do_fill_buffer();\n                return make_ready_future<>();\n            });\n        });\n    }\n    virtual void next_partition() override {\n        clear_buffer_to_next_partition();\n        if (is_buffer_empty()) {\n            _end_of_stream = true;\n        }\n    }\n    virtual future<> fast_forward_to(const dht::partition_range& pr) override {\n        throw std::runtime_error(\"This reader can't be fast forwarded to another partition.\");\n    };\n    virtual future<> fast_forward_to(position_range cr) override {\n        throw std::runtime_error(\"This reader can't be fast forwarded to another position.\");\n    };\n};\n\ntemplate <typename MemoryAccounter, typename... Args>\ninline flat_mutation_reader\nmake_partition_snapshot_flat_reader(schema_ptr s,\n                                    dht::decorated_key dk,\n                                    query::clustering_key_filter_ranges crr,\n                                    lw_shared_ptr<partition_snapshot> snp,\n                                    logalloc::region& region,\n                                    logalloc::allocating_section& read_section,\n                                    boost::any pointer_to_container,\n                                    streamed_mutation::forwarding fwd,\n                                    Args&&... args)\n{\n    auto res = make_flat_mutation_reader<partition_snapshot_flat_reader<MemoryAccounter>>(std::move(s), std::move(dk),\n            snp, std::move(crr), region, read_section, std::move(pointer_to_container), std::forward<Args>(args)...);\n    if (fwd) {\n        return make_forwardable(std::move(res)); \/\/ FIXME: optimize\n    } else {\n        return std::move(res);\n    }\n}\n\ninline flat_mutation_reader\nmake_partition_snapshot_flat_reader(schema_ptr s,\n                                    dht::decorated_key dk,\n                                    query::clustering_key_filter_ranges crr,\n                                    lw_shared_ptr<partition_snapshot> snp,\n                                    logalloc::region& region,\n                                    logalloc::allocating_section& read_section,\n                                    boost::any pointer_to_container,\n                                    streamed_mutation::forwarding fwd)\n{\n    return make_partition_snapshot_flat_reader<partition_snapshot_reader_dummy_accounter>(std::move(s),\n            std::move(dk), std::move(crr), std::move(snp), region, read_section, std::move(pointer_to_container), fwd);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"arch\/linux\/coroutines.hpp\"\n#include \"arch\/linux\/thread_pool.hpp\"\n#include \"config\/args.hpp\"\n#include <stdio.h>\n#include <sys\/mman.h>\n#include <ucontext.h>\n\n#ifdef VALGRIND\n#include <valgrind\/valgrind.h>\n#endif\n\n#ifndef NDEBUG\n#include <cxxabi.h>   \/\/ For __cxa_current_exception_type (see below)\n#endif\n\nperfmon_counter_t pm_active_coroutines(\"active_coroutines\"),\n                  pm_allocated_coroutines(\"allocated_coroutines\");\n\nsize_t coro_stack_size = COROUTINE_STACK_SIZE; \/\/Default, setable by command-line parameter\n\n\/* We have a custom implementation of swapcontext() that doesn't swap the floating-point\nregisters, the SSE registers, or the signal mask. This is for performance reasons. *\/\n\nextern \"C\" {\n    extern int lightweight_swapcontext(ucontext_t *oucp, const ucontext_t *ucp);\n}\n\n\/* The register definitions and the definition of lightweight_swapcontext itself are\nderived from GLibC, which is covered under the LGPL. *\/\n\n\/* These are the byte offsets of various fields in the GLibC ucontext_t type. To be\nmore portable, maybe we should define our own makecontext()\/getcontext()\/setcontext()\nas well; right now we're tied tightly to GLibC. *\/\n#define oRBP \"120\"\n#define oRSP \"160\"\n#define oRBX \"128\"\n#define oR12 \"72\"\n#define oR13 \"80\"\n#define oR14 \"88\"\n#define oR15 \"96\"\n#define oRIP \"168\"\n\nasm(\n    \".section .text\\n\"\n    \".globl lightweight_swapcontext\\n\"\n    \"lightweight_swapcontext:\\n\"\n\n    \/* Save the preserved registers and the return address *\/\n    \"\\tmovq\\t%rbx, \"oRBX\"(%rdi)\\n\"\n    \"\\tmovq\\t%rbp, \"oRBP\"(%rdi)\\n\"\n    \"\\tmovq\\t%r12, \"oR12\"(%rdi)\\n\"\n    \"\\tmovq\\t%r13, \"oR13\"(%rdi)\\n\"\n    \"\\tmovq\\t%r14, \"oR14\"(%rdi)\\n\"\n    \"\\tmovq\\t%r15, \"oR15\"(%rdi)\\n\"\n    \"\\tmovq\\t(%rsp), %rcx\\n\"\n    \"\\tmovq\\t%rcx, \"oRIP\"(%rdi)\\n\"\n    \"\\tleaq\\t8(%rsp), %rcx\\n\"        \/* Exclude the return address.  *\/\n    \"\\tmovq\\t%rcx, \"oRSP\"(%rdi)\\n\"\n\n    \/* Load the new stack pointer and the preserved registers.  *\/\n    \"\\tmovq\\t\"oRSP\"(%rsi), %rsp\\n\"\n    \"\\tmovq\\t\"oRBX\"(%rsi), %rbx\\n\"\n    \"\\tmovq\\t\"oRBP\"(%rsi), %rbp\\n\"\n    \"\\tmovq\\t\"oR12\"(%rsi), %r12\\n\"\n    \"\\tmovq\\t\"oR13\"(%rsi), %r13\\n\"\n    \"\\tmovq\\t\"oR14\"(%rsi), %r14\\n\"\n    \"\\tmovq\\t\"oR15\"(%rsi), %r15\\n\"\n\n    \/* The following ret should return to the address set with\n    getcontext.  Therefore push the address on the stack.  *\/\n    \"\\tmovq\\t\"oRIP\"(%rsi), %rcx\\n\"\n    \"\\tpushq\\t%rcx\\n\"\n    \"\\txorl\\t%eax, %eax\\n\"\n    \"\\tret\\n\"\n);\n\n\/* coro_context_t is only used internally within the coroutine logic. For performance reasons,\nwe recycle stacks and ucontexts; the coro_context_t represents a stack and a ucontext. *\/\n\nstruct coro_context_t :\n    public intrusive_list_node_t<coro_context_t>\n{\n    coro_context_t();\n\n    \/* The run() function is at the bottom of every coro_context_t's call stack. It repeatedly\n    waits for a coroutine to run and then calls that coroutine's run() method. *\/\n    static void run();\n\n    ~coro_context_t();\n\n    \/* The guts of the coro_context_t *\/\n    void *stack;\n    ucontext_t env;\n#ifdef VALGRIND\n    unsigned int valgrind_stack_id;\n#endif\n};\n\n\/* The coroutine we're currently in, if any. NULL if we are in the main context. *\/\nstatic __thread coro_t *current_coro = NULL;\n\n\/* The main context. *\/\nstatic __thread ucontext_t scheduler;\n\n\/* A list of coro_context_t objects that are not in use. *\/\nstatic __thread intrusive_list_t<coro_context_t> *free_contexts = NULL;\n\n\/* coro_globals_t *\/\n\ncoro_globals_t::coro_globals_t()\n{\n    rassert(!current_coro);\n\n    rassert(free_contexts == NULL);\n    free_contexts = new intrusive_list_t<coro_context_t>;\n}\n\ncoro_globals_t::~coro_globals_t()\n{\n    rassert(!current_coro);\n\n    \/* Destroy remaining coroutines *\/\n    while (coro_context_t *s = free_contexts->head()) {\n        free_contexts->remove(s);\n        delete s;\n    }\n\n    delete free_contexts;\n    free_contexts = NULL;\n}\n\n\/* coro_context_t *\/\n\ncoro_context_t::coro_context_t()\n{\n    pm_allocated_coroutines++;\n\n    stack = malloc_aligned(coro_stack_size, getpagesize());\n\n    \/* Protect the end of the stack so that we crash when we get a stack overflow instead of\n    corrupting memory. *\/\n    mprotect(stack, getpagesize(), PROT_NONE);\n\n    \/* Register our stack with Valgrind so that it understands what's going on and doesn't\n    create spurious errors *\/\n#ifdef VALGRIND\n    valgrind_stack_id = VALGRIND_STACK_REGISTER(stack, (intptr_t)stack + coro_stack_size);\n#endif\n\n    getcontext(&env);   \/* Why do we call getcontext() here? *\/\n\n    env.uc_stack.ss_sp = stack;\n    env.uc_stack.ss_size = coro_stack_size;\n    env.uc_stack.ss_flags = 0;\n    env.uc_link = NULL;\n\n    \/* run() is the main worker loop for a coroutine. *\/\n    makecontext(&env, &coro_context_t::run, 0);\n}\n\nvoid coro_context_t::run() {\n\n    coro_context_t *self = current_coro->context;\n\n    \/* Make sure we're on the right stack. *\/\n#ifndef NDEBUG\n    char dummy;\n    rassert(&dummy >= (char*)self->stack);\n    rassert(&dummy < (char*)self->stack + coro_stack_size);\n#endif\n\n    while (true) {\n\n        current_coro->run();\n\n        current_coro = NULL;\n        lightweight_swapcontext(&self->env, &scheduler);\n    }\n}\n\ncoro_context_t::~coro_context_t() {\n\n#ifdef VALGRIND\n    VALGRIND_STACK_DEREGISTER(valgrind_stack_id);\n#endif\n\n    mprotect(stack, getpagesize(), PROT_READ|PROT_WRITE); \/\/Undo protections changes\n\n    free(stack);\n\n    pm_allocated_coroutines--;\n}\n\n\/* coro_t *\/\n\ncoro_t::coro_t(deed_t *deed) :\n    deed(deed),\n    current_thread(linux_thread_pool_t::thread_id),\n    notified(false)\n{\n\n    pm_active_coroutines++;\n\n    \/* Find us a stack *\/\n    if (free_contexts->size() == 0) {\n        context = new coro_context_t();\n    } else {\n        context = free_contexts->tail();\n        free_contexts->remove(context);\n    }\n\n    \/* Eventually our run() method will be called within the coroutine. *\/\n    notify();\n}\n\ncoro_t::~coro_t() {\n\n    \/* Return the context to the free-contexts list *\/\n    free_contexts->push_back(context);\n\n    pm_active_coroutines--;\n}\n\nvoid coro_t::run() {\n\n    rassert(current_coro == this);\n\n    (*deed)();\n\n    delete this;\n}\n\ncoro_t *coro_t::self() {   \/* class method *\/\n    return current_coro;\n}\n\nvoid coro_t::wait() {   \/* class method *\/\n\n#ifndef NDEBUG\n    \/* It's not safe to wait() in a catch clause of an exception handler. We use the non-standard\n    GCC-only interface \"cxxabi.h\" to figure out if we're in the catch clause of an exception\n    handler. In C++0x we will be able to use std::current_exception() instead. *\/\n    rassert(!abi::__cxa_current_exception_type());\n#endif\n\n    rassert(current_coro != NULL);\n    coro_context_t *context = current_coro->context;\n    current_coro = NULL;\n    lightweight_swapcontext(&context->env, &scheduler);\n    rassert(current_coro != NULL);\n}\n\nvoid coro_t::notify() {\n\n    rassert(!notified);\n    notified = true;\n\n    \/* notify() doesn't switch to the coroutine immediately; instead, it just pushes\n    the coroutine onto the event queue. *\/\n\n    \/* current_thread is the thread that the coroutine lives on, which may or may not be the\n    same as get_thread_id(). *\/\n    linux_thread_pool_t::thread->message_hub.store_message(current_thread, this);\n}\n\nvoid coro_t::move_to_thread(int thread) {   \/* class method *\/\n    self()->current_thread = thread;\n    self()->notify();\n    wait();\n}\n\nvoid coro_t::on_thread_switch() {\n\n    rassert(notified);\n    notified = false;\n\n    rassert(current_coro == NULL);\n    current_coro = this;\n    lightweight_swapcontext(&scheduler, &context->env);\n    rassert(current_coro == NULL);\n}\n\nvoid coro_t::set_coroutine_stack_size(size_t size) {\n    coro_stack_size = size;\n}\n\n\/* Called by SIGSEGV handler to identify segfaults that come from overflowing a coroutine's\nstack. Could also in theory be used by a function to check if it's about to overflow\nthe stack. *\/\n\nbool is_coroutine_stack_overflow(void *addr) {\n    void *base = (void *)floor_aligned((intptr_t)addr, getpagesize());\n    return current_coro && current_coro->context->stack == base;\n}\n<commit_msg>Do nothing when move_to_thread()ing to the current thread.<commit_after>#include \"arch\/linux\/coroutines.hpp\"\n#include \"arch\/linux\/thread_pool.hpp\"\n#include \"config\/args.hpp\"\n#include <stdio.h>\n#include <sys\/mman.h>\n#include <ucontext.h>\n\n#ifdef VALGRIND\n#include <valgrind\/valgrind.h>\n#endif\n\n#ifndef NDEBUG\n#include <cxxabi.h>   \/\/ For __cxa_current_exception_type (see below)\n#endif\n\nperfmon_counter_t pm_active_coroutines(\"active_coroutines\"),\n                  pm_allocated_coroutines(\"allocated_coroutines\");\n\nsize_t coro_stack_size = COROUTINE_STACK_SIZE; \/\/Default, setable by command-line parameter\n\n\/* We have a custom implementation of swapcontext() that doesn't swap the floating-point\nregisters, the SSE registers, or the signal mask. This is for performance reasons. *\/\n\nextern \"C\" {\n    extern int lightweight_swapcontext(ucontext_t *oucp, const ucontext_t *ucp);\n}\n\n\/* The register definitions and the definition of lightweight_swapcontext itself are\nderived from GLibC, which is covered under the LGPL. *\/\n\n\/* These are the byte offsets of various fields in the GLibC ucontext_t type. To be\nmore portable, maybe we should define our own makecontext()\/getcontext()\/setcontext()\nas well; right now we're tied tightly to GLibC. *\/\n#define oRBP \"120\"\n#define oRSP \"160\"\n#define oRBX \"128\"\n#define oR12 \"72\"\n#define oR13 \"80\"\n#define oR14 \"88\"\n#define oR15 \"96\"\n#define oRIP \"168\"\n\nasm(\n    \".section .text\\n\"\n    \".globl lightweight_swapcontext\\n\"\n    \"lightweight_swapcontext:\\n\"\n\n    \/* Save the preserved registers and the return address *\/\n    \"\\tmovq\\t%rbx, \"oRBX\"(%rdi)\\n\"\n    \"\\tmovq\\t%rbp, \"oRBP\"(%rdi)\\n\"\n    \"\\tmovq\\t%r12, \"oR12\"(%rdi)\\n\"\n    \"\\tmovq\\t%r13, \"oR13\"(%rdi)\\n\"\n    \"\\tmovq\\t%r14, \"oR14\"(%rdi)\\n\"\n    \"\\tmovq\\t%r15, \"oR15\"(%rdi)\\n\"\n    \"\\tmovq\\t(%rsp), %rcx\\n\"\n    \"\\tmovq\\t%rcx, \"oRIP\"(%rdi)\\n\"\n    \"\\tleaq\\t8(%rsp), %rcx\\n\"        \/* Exclude the return address.  *\/\n    \"\\tmovq\\t%rcx, \"oRSP\"(%rdi)\\n\"\n\n    \/* Load the new stack pointer and the preserved registers.  *\/\n    \"\\tmovq\\t\"oRSP\"(%rsi), %rsp\\n\"\n    \"\\tmovq\\t\"oRBX\"(%rsi), %rbx\\n\"\n    \"\\tmovq\\t\"oRBP\"(%rsi), %rbp\\n\"\n    \"\\tmovq\\t\"oR12\"(%rsi), %r12\\n\"\n    \"\\tmovq\\t\"oR13\"(%rsi), %r13\\n\"\n    \"\\tmovq\\t\"oR14\"(%rsi), %r14\\n\"\n    \"\\tmovq\\t\"oR15\"(%rsi), %r15\\n\"\n\n    \/* The following ret should return to the address set with\n    getcontext.  Therefore push the address on the stack.  *\/\n    \"\\tmovq\\t\"oRIP\"(%rsi), %rcx\\n\"\n    \"\\tpushq\\t%rcx\\n\"\n    \"\\txorl\\t%eax, %eax\\n\"\n    \"\\tret\\n\"\n);\n\n\/* coro_context_t is only used internally within the coroutine logic. For performance reasons,\nwe recycle stacks and ucontexts; the coro_context_t represents a stack and a ucontext. *\/\n\nstruct coro_context_t :\n    public intrusive_list_node_t<coro_context_t>\n{\n    coro_context_t();\n\n    \/* The run() function is at the bottom of every coro_context_t's call stack. It repeatedly\n    waits for a coroutine to run and then calls that coroutine's run() method. *\/\n    static void run();\n\n    ~coro_context_t();\n\n    \/* The guts of the coro_context_t *\/\n    void *stack;\n    ucontext_t env;\n#ifdef VALGRIND\n    unsigned int valgrind_stack_id;\n#endif\n};\n\n\/* The coroutine we're currently in, if any. NULL if we are in the main context. *\/\nstatic __thread coro_t *current_coro = NULL;\n\n\/* The main context. *\/\nstatic __thread ucontext_t scheduler;\n\n\/* A list of coro_context_t objects that are not in use. *\/\nstatic __thread intrusive_list_t<coro_context_t> *free_contexts = NULL;\n\n\/* coro_globals_t *\/\n\ncoro_globals_t::coro_globals_t()\n{\n    rassert(!current_coro);\n\n    rassert(free_contexts == NULL);\n    free_contexts = new intrusive_list_t<coro_context_t>;\n}\n\ncoro_globals_t::~coro_globals_t()\n{\n    rassert(!current_coro);\n\n    \/* Destroy remaining coroutines *\/\n    while (coro_context_t *s = free_contexts->head()) {\n        free_contexts->remove(s);\n        delete s;\n    }\n\n    delete free_contexts;\n    free_contexts = NULL;\n}\n\n\/* coro_context_t *\/\n\ncoro_context_t::coro_context_t()\n{\n    pm_allocated_coroutines++;\n\n    stack = malloc_aligned(coro_stack_size, getpagesize());\n\n    \/* Protect the end of the stack so that we crash when we get a stack overflow instead of\n    corrupting memory. *\/\n    mprotect(stack, getpagesize(), PROT_NONE);\n\n    \/* Register our stack with Valgrind so that it understands what's going on and doesn't\n    create spurious errors *\/\n#ifdef VALGRIND\n    valgrind_stack_id = VALGRIND_STACK_REGISTER(stack, (intptr_t)stack + coro_stack_size);\n#endif\n\n    getcontext(&env);   \/* Why do we call getcontext() here? *\/\n\n    env.uc_stack.ss_sp = stack;\n    env.uc_stack.ss_size = coro_stack_size;\n    env.uc_stack.ss_flags = 0;\n    env.uc_link = NULL;\n\n    \/* run() is the main worker loop for a coroutine. *\/\n    makecontext(&env, &coro_context_t::run, 0);\n}\n\nvoid coro_context_t::run() {\n\n    coro_context_t *self = current_coro->context;\n\n    \/* Make sure we're on the right stack. *\/\n#ifndef NDEBUG\n    char dummy;\n    rassert(&dummy >= (char*)self->stack);\n    rassert(&dummy < (char*)self->stack + coro_stack_size);\n#endif\n\n    while (true) {\n\n        current_coro->run();\n\n        current_coro = NULL;\n        lightweight_swapcontext(&self->env, &scheduler);\n    }\n}\n\ncoro_context_t::~coro_context_t() {\n\n#ifdef VALGRIND\n    VALGRIND_STACK_DEREGISTER(valgrind_stack_id);\n#endif\n\n    mprotect(stack, getpagesize(), PROT_READ|PROT_WRITE); \/\/Undo protections changes\n\n    free(stack);\n\n    pm_allocated_coroutines--;\n}\n\n\/* coro_t *\/\n\ncoro_t::coro_t(deed_t *deed) :\n    deed(deed),\n    current_thread(linux_thread_pool_t::thread_id),\n    notified(false)\n{\n\n    pm_active_coroutines++;\n\n    \/* Find us a stack *\/\n    if (free_contexts->size() == 0) {\n        context = new coro_context_t();\n    } else {\n        context = free_contexts->tail();\n        free_contexts->remove(context);\n    }\n\n    \/* Eventually our run() method will be called within the coroutine. *\/\n    notify();\n}\n\ncoro_t::~coro_t() {\n\n    \/* Return the context to the free-contexts list *\/\n    free_contexts->push_back(context);\n\n    pm_active_coroutines--;\n}\n\nvoid coro_t::run() {\n\n    rassert(current_coro == this);\n\n    (*deed)();\n\n    delete this;\n}\n\ncoro_t *coro_t::self() {   \/* class method *\/\n    return current_coro;\n}\n\nvoid coro_t::wait() {   \/* class method *\/\n\n#ifndef NDEBUG\n    \/* It's not safe to wait() in a catch clause of an exception handler. We use the non-standard\n    GCC-only interface \"cxxabi.h\" to figure out if we're in the catch clause of an exception\n    handler. In C++0x we will be able to use std::current_exception() instead. *\/\n    rassert(!abi::__cxa_current_exception_type());\n#endif\n\n    rassert(current_coro != NULL);\n    coro_context_t *context = current_coro->context;\n    current_coro = NULL;\n    lightweight_swapcontext(&context->env, &scheduler);\n    rassert(current_coro != NULL);\n}\n\nvoid coro_t::notify() {\n\n    rassert(!notified);\n    notified = true;\n\n    \/* notify() doesn't switch to the coroutine immediately; instead, it just pushes\n    the coroutine onto the event queue. *\/\n\n    \/* current_thread is the thread that the coroutine lives on, which may or may not be the\n    same as get_thread_id(). *\/\n    linux_thread_pool_t::thread->message_hub.store_message(current_thread, this);\n}\n\nvoid coro_t::move_to_thread(int thread) {   \/* class method *\/\n    if (thread == self()->current_thread) {\n        \/\/ If we're trying to switch to the thread we're currently on, do nothing.\n        return;\n    }\n    self()->current_thread = thread;\n    self()->notify();\n    wait();\n}\n\nvoid coro_t::on_thread_switch() {\n\n    rassert(notified);\n    notified = false;\n\n    rassert(current_coro == NULL);\n    current_coro = this;\n    lightweight_swapcontext(&scheduler, &context->env);\n    rassert(current_coro == NULL);\n}\n\nvoid coro_t::set_coroutine_stack_size(size_t size) {\n    coro_stack_size = size;\n}\n\n\/* Called by SIGSEGV handler to identify segfaults that come from overflowing a coroutine's\nstack. Could also in theory be used by a function to check if it's about to overflow\nthe stack. *\/\n\nbool is_coroutine_stack_overflow(void *addr) {\n    void *base = (void *)floor_aligned((intptr_t)addr, getpagesize());\n    return current_coro && current_coro->context->stack == base;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\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: Gabe Black\n *\/\n\n#ifndef __ARCH_SPARC_ISA_TRAITS_HH__\n#define __ARCH_SPARC_ISA_TRAITS_HH__\n\n#include \"arch\/sparc\/types.hh\"\n#include \"base\/misc.hh\"\n#include \"config\/full_system.hh\"\n#include \"sim\/host.hh\"\n\nclass ThreadContext;\nclass FastCPU;\n\/\/class FullCPU;\nclass Checkpoint;\n\nclass StaticInst;\nclass StaticInstPtr;\n\nnamespace BigEndianGuest {}\n\n#if FULL_SYSTEM\n#include \"arch\/sparc\/isa_fullsys_traits.hh\"\n#endif\n\nnamespace SparcISA\n{\n    class RegFile;\n\n    \/\/This makes sure the big endian versions of certain functions are used.\n    using namespace BigEndianGuest;\n\n    \/\/ SPARC has a delay slot\n    #define ISA_HAS_DELAY_SLOT 1\n\n    \/\/ SPARC NOP (sethi %(hi(0), g0)\n    const MachInst NoopMachInst = 0x01000000;\n\n    const int NumRegularIntRegs = 32;\n    const int NumMicroIntRegs = 1;\n    const int NumIntRegs =\n        NumRegularIntRegs +\n        NumMicroIntRegs;\n    const int NumFloatRegs = 64;\n    const int NumMiscRegs = 40;\n\n    \/\/ These enumerate all the registers for dependence tracking.\n    enum DependenceTags {\n        \/\/ 0..31 are the integer regs 0..31\n        \/\/ 32..95 are the FP regs 0..31, i.e. use (reg + FP_Base_DepTag)\n        FP_Base_DepTag = NumIntRegs,\n        Ctrl_Base_DepTag = NumIntRegs + NumFloatRegs,\n        \/\/XXX These are here solely to get compilation and won't work\n        Fpcr_DepTag = 0,\n        Uniq_DepTag = 0\n    };\n\n\n    \/\/ MAXTL - maximum trap level\n    const int MaxPTL = 2;\n    const int MaxTL  = 6;\n    const int MaxGL  = 3;\n    const int MaxPGL = 2;\n\n    \/\/ NWINDOWS - number of register windows, can be 3 to 32\n    const int NWindows = 8;\n\n    \/\/ semantically meaningful register indices\n    const int ZeroReg = 0;\t\/\/ architecturally meaningful\n    \/\/ the rest of these depend on the ABI\n    const int StackPointerReg = 14;\n    const int ReturnAddressReg = 31; \/\/ post call, precall is 15\n    const int ReturnValueReg = 8; \/\/ Post return, 24 is pre-return.\n    const int FramePointerReg = 30;\n    const int ArgumentReg0 = 8;\n    const int ArgumentReg1 = 9;\n    const int ArgumentReg2 = 10;\n    const int ArgumentReg3 = 11;\n    const int ArgumentReg4 = 12;\n    const int ArgumentReg5 = 13;\n    \/\/ Some OS syscall use a second register (o1) to return a second value\n    const int SyscallPseudoReturnReg = ArgumentReg1;\n\n    \/\/XXX These numbers are bogus\n    const int MaxInstSrcRegs = 8;\n    const int MaxInstDestRegs = 9;\n\n    \/\/8K. This value is implmentation specific; and should probably\n    \/\/be somewhere else.\n    const int LogVMPageSize = 13;\n    const int VMPageSize = (1 << LogVMPageSize);\n\n    \/\/Why does both the previous set of constants and this one exist?\n    const int PageShift = 13;\n    const int PageBytes = ULL(1) << PageShift;\n\n    const int BranchPredAddrShiftAmt = 2;\n\n    const int MachineBytes = 8;\n    const int WordBytes = 4;\n    const int HalfwordBytes = 2;\n    const int ByteBytes = 1;\n\n    void serialize(std::ostream & os);\n\n    void unserialize(Checkpoint *cp, const std::string &section);\n\n    StaticInstPtr decodeInst(ExtMachInst);\n\n    \/\/ return a no-op instruction... used for instruction fetch faults\n    extern const MachInst NoopMachInst;\n}\n\n#endif \/\/ __ARCH_SPARC_ISA_TRAITS_HH__\n<commit_msg>Fixed up DepTags a little. I think NumMicroIntRegs shouldn't be added to Ctrl_Base_DepTag.<commit_after>\/*\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: Gabe Black\n *\/\n\n#ifndef __ARCH_SPARC_ISA_TRAITS_HH__\n#define __ARCH_SPARC_ISA_TRAITS_HH__\n\n#include \"arch\/sparc\/types.hh\"\n#include \"base\/misc.hh\"\n#include \"config\/full_system.hh\"\n#include \"sim\/host.hh\"\n\nclass ThreadContext;\nclass FastCPU;\n\/\/class FullCPU;\nclass Checkpoint;\n\nclass StaticInst;\nclass StaticInstPtr;\n\nnamespace BigEndianGuest {}\n\n#if FULL_SYSTEM\n#include \"arch\/sparc\/isa_fullsys_traits.hh\"\n#endif\n\nnamespace SparcISA\n{\n    class RegFile;\n\n    \/\/This makes sure the big endian versions of certain functions are used.\n    using namespace BigEndianGuest;\n\n    \/\/ SPARC has a delay slot\n    #define ISA_HAS_DELAY_SLOT 1\n\n    \/\/ SPARC NOP (sethi %(hi(0), g0)\n    const MachInst NoopMachInst = 0x01000000;\n\n    const int NumRegularIntRegs = 32;\n    const int NumMicroIntRegs = 1;\n    const int NumIntRegs =\n        NumRegularIntRegs +\n        NumMicroIntRegs;\n    const int NumFloatRegs = 64;\n    const int NumMiscRegs = 40;\n\n    \/\/ These enumerate all the registers for dependence tracking.\n    enum DependenceTags {\n        \/\/ 0..31 are the integer regs 0..31\n        \/\/ 32..95 are the FP regs 0..31, i.e. use (reg + FP_Base_DepTag)\n        FP_Base_DepTag = NumIntRegs,\n        Ctrl_Base_DepTag = NumIntRegs + NumMicroIntRegs + NumFloatRegs,\n    };\n\n\n    \/\/ MAXTL - maximum trap level\n    const int MaxPTL = 2;\n    const int MaxTL  = 6;\n    const int MaxGL  = 3;\n    const int MaxPGL = 2;\n\n    \/\/ NWINDOWS - number of register windows, can be 3 to 32\n    const int NWindows = 8;\n\n    \/\/ semantically meaningful register indices\n    const int ZeroReg = 0;\t\/\/ architecturally meaningful\n    \/\/ the rest of these depend on the ABI\n    const int StackPointerReg = 14;\n    const int ReturnAddressReg = 31; \/\/ post call, precall is 15\n    const int ReturnValueReg = 8; \/\/ Post return, 24 is pre-return.\n    const int FramePointerReg = 30;\n    const int ArgumentReg0 = 8;\n    const int ArgumentReg1 = 9;\n    const int ArgumentReg2 = 10;\n    const int ArgumentReg3 = 11;\n    const int ArgumentReg4 = 12;\n    const int ArgumentReg5 = 13;\n    \/\/ Some OS syscall use a second register (o1) to return a second value\n    const int SyscallPseudoReturnReg = ArgumentReg1;\n\n    \/\/XXX These numbers are bogus\n    const int MaxInstSrcRegs = 8;\n    const int MaxInstDestRegs = 9;\n\n    \/\/8K. This value is implmentation specific; and should probably\n    \/\/be somewhere else.\n    const int LogVMPageSize = 13;\n    const int VMPageSize = (1 << LogVMPageSize);\n\n    \/\/Why does both the previous set of constants and this one exist?\n    const int PageShift = 13;\n    const int PageBytes = ULL(1) << PageShift;\n\n    const int BranchPredAddrShiftAmt = 2;\n\n    const int MachineBytes = 8;\n    const int WordBytes = 4;\n    const int HalfwordBytes = 2;\n    const int ByteBytes = 1;\n\n    void serialize(std::ostream & os);\n\n    void unserialize(Checkpoint *cp, const std::string &section);\n\n    StaticInstPtr decodeInst(ExtMachInst);\n\n    \/\/ return a no-op instruction... used for instruction fetch faults\n    extern const MachInst NoopMachInst;\n}\n\n#endif \/\/ __ARCH_SPARC_ISA_TRAITS_HH__\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 <boost\/range\/iterator_range.hpp>\n\n#include \"bytes.hh\"\n#include \"core\/unaligned.hh\"\n#include \"hashing.hh\"\n#include \"seastar\/core\/simple-stream.hh\"\n\/**\n * Utility for writing data into a buffer when its final size is not known up front.\n *\n * Internally the data is written into a chain of chunks allocated on-demand.\n * No resizing of previously written data happens.\n *\n *\/\nclass bytes_ostream {\npublic:\n    using size_type = bytes::size_type;\n    using value_type = bytes::value_type;\n    static constexpr size_type max_chunk_size() { return 16 * 1024; }\nprivate:\n    static_assert(sizeof(value_type) == 1, \"value_type is assumed to be one byte long\");\n    struct chunk {\n        \/\/ FIXME: group fragment pointers to reduce pointer chasing when packetizing\n        std::unique_ptr<chunk> next;\n        ~chunk() {\n            auto p = std::move(next);\n            while (p) {\n                \/\/ Avoid recursion when freeing chunks\n                auto p_next = std::move(p->next);\n                p = std::move(p_next);\n            }\n        }\n        size_type offset; \/\/ Also means \"size\" after chunk is closed\n        size_type size;\n        value_type data[0];\n        void operator delete(void* ptr) { free(ptr); }\n    };\n    \/\/ FIXME: consider increasing chunk size as the buffer grows\n    static constexpr size_type chunk_size{512};\nprivate:\n    std::unique_ptr<chunk> _begin;\n    chunk* _current;\n    size_type _size;\npublic:\n    class fragment_iterator : public std::iterator<std::input_iterator_tag, bytes_view> {\n        chunk* _current;\n    public:\n        fragment_iterator(chunk* current) : _current(current) {}\n        fragment_iterator(const fragment_iterator&) = default;\n        fragment_iterator& operator=(const fragment_iterator&) = default;\n        bytes_view operator*() const {\n            return { _current->data, _current->offset };\n        }\n        bytes_view operator->() const {\n            return *(*this);\n        }\n        fragment_iterator& operator++() {\n            _current = _current->next.get();\n            return *this;\n        }\n        fragment_iterator operator++(int) {\n            fragment_iterator tmp(*this);\n            ++(*this);\n            return tmp;\n        }\n        bool operator==(const fragment_iterator& other) const {\n            return _current == other._current;\n        }\n        bool operator!=(const fragment_iterator& other) const {\n            return _current != other._current;\n        }\n    };\nprivate:\n    inline size_type current_space_left() const {\n        if (!_current) {\n            return 0;\n        }\n        return _current->size - _current->offset;\n    }\n    \/\/ Figure out next chunk size.\n    \/\/   - must be enough for data_size\n    \/\/   - must be at least chunk_size\n    \/\/   - try to double each time to prevent too many allocations\n    \/\/   - do not exceed max_chunk_size\n    size_type next_alloc_size(size_t data_size) const {\n        auto next_size = _current\n                ? _current->size * 2\n                : chunk_size;\n        next_size = std::min(next_size, max_chunk_size());\n        \/\/ FIXME: check for overflow?\n        return std::max<size_type>(next_size, data_size + sizeof(chunk));\n    }\n    \/\/ Makes room for a contiguous region of given size.\n    \/\/ The region is accounted for as already written.\n    \/\/ size must not be zero.\n    value_type* alloc(size_type size) {\n        if (size <= current_space_left()) {\n            auto ret = _current->data + _current->offset;\n            _current->offset += size;\n            _size += size;\n            return ret;\n        } else {\n            auto alloc_size = next_alloc_size(size);\n            auto space = malloc(alloc_size);\n            if (!space) {\n                throw std::bad_alloc();\n            }\n            auto new_chunk = std::unique_ptr<chunk>(new (space) chunk());\n            new_chunk->offset = size;\n            new_chunk->size = alloc_size - sizeof(chunk);\n            if (_current) {\n                _current->next = std::move(new_chunk);\n                _current = _current->next.get();\n            } else {\n                _begin = std::move(new_chunk);\n                _current = _begin.get();\n            }\n            _size += size;\n            return _current->data;\n        };\n    }\npublic:\n    bytes_ostream() noexcept\n        : _begin()\n        , _current(nullptr)\n        , _size(0)\n    { }\n\n    bytes_ostream(bytes_ostream&& o) noexcept\n        : _begin(std::move(o._begin))\n        , _current(o._current)\n        , _size(o._size)\n    {\n        o._current = nullptr;\n        o._size = 0;\n    }\n\n    bytes_ostream(const bytes_ostream& o)\n        : _begin()\n        , _current(nullptr)\n        , _size(0)\n    {\n        append(o);\n    }\n\n    bytes_ostream& operator=(const bytes_ostream& o) {\n        if (this != &o) {\n            auto x = bytes_ostream(o);\n            *this = std::move(x);\n        }\n        return *this;\n    }\n\n    bytes_ostream& operator=(bytes_ostream&& o) noexcept {\n        if (this != &o) {\n            this->~bytes_ostream();\n            new (this) bytes_ostream(std::move(o));\n        }\n        return *this;\n    }\n\n    template <typename T>\n    struct place_holder {\n        value_type* ptr;\n        \/\/ makes the place_holder looks like a stream\n        seastar::simple_output_stream get_stream() {\n            return seastar::simple_output_stream(reinterpret_cast<char*>(ptr), sizeof(T));\n        }\n    };\n\n    \/\/ Returns a place holder for a value to be written later.\n    template <typename T>\n    inline\n    std::enable_if_t<std::is_fundamental<T>::value, place_holder<T>>\n    write_place_holder() {\n        return place_holder<T>{alloc(sizeof(T))};\n    }\n\n    value_type* write_place_holder(size_type size) {\n        return alloc(size);\n    }\n\n    \/\/ Writes given sequence of bytes\n    inline void write(bytes_view v) {\n        if (v.empty()) {\n            return;\n        }\n\n        auto this_size = std::min(v.size(), size_t(current_space_left()));\n        if (this_size) {\n            memcpy(_current->data + _current->offset, v.begin(), this_size);\n            _current->offset += this_size;\n            _size += this_size;\n            v.remove_prefix(this_size);\n        }\n\n        while (!v.empty()) {\n            auto this_size = std::min(v.size(), size_t(max_chunk_size()));\n            std::copy_n(v.begin(), this_size, alloc(this_size));\n            v.remove_prefix(this_size);\n        }\n    }\n\n    void write(const char* ptr, size_t size) {\n        write(bytes_view(reinterpret_cast<const signed char*>(ptr), size));\n    }\n\n    bool is_linearized() const {\n        return !_begin || !_begin->next;\n    }\n\n    \/\/ Call only when is_linearized()\n    bytes_view view() const {\n        assert(is_linearized());\n        if (!_current) {\n            return bytes_view();\n        }\n\n        return bytes_view(_current->data, _size);\n    }\n\n    \/\/ Makes the underlying storage contiguous and returns a view to it.\n    \/\/ Invalidates all previously created placeholders.\n    bytes_view linearize() {\n        if (is_linearized()) {\n            return view();\n        }\n\n        auto space = malloc(_size + sizeof(chunk));\n        if (!space) {\n            throw std::bad_alloc();\n        }\n\n        auto new_chunk = std::unique_ptr<chunk>(new (space) chunk());\n        new_chunk->offset = _size;\n        new_chunk->size = _size;\n\n        auto dst = new_chunk->data;\n        auto r = _begin.get();\n        while (r) {\n            auto next = r->next.get();\n            dst = std::copy_n(r->data, r->offset, dst);\n            r = next;\n        }\n\n        _current = new_chunk.get();\n        _begin = std::move(new_chunk);\n        return bytes_view(_current->data, _size);\n    }\n\n    \/\/ Returns the amount of bytes written so far\n    size_type size() const {\n        return _size;\n    }\n\n    bool empty() const {\n        return _size == 0;\n    }\n\n    void reserve(size_t size) {\n        \/\/ FIXME: implement\n    }\n\n    void append(const bytes_ostream& o) {\n        for (auto&& bv : o.fragments()) {\n            write(bv);\n        }\n    }\n\n    \/\/ begin() and end() form an input range to bytes_view representing fragments.\n    \/\/ Any modification of this instance invalidates iterators.\n    fragment_iterator begin() const { return { _begin.get() }; }\n    fragment_iterator end() const { return { nullptr }; }\n\n    boost::iterator_range<fragment_iterator> fragments() const {\n        return { begin(), end() };\n    }\n\n    struct position {\n        chunk* _chunk;\n        size_type _offset;\n    };\n\n    position pos() const {\n        return { _current, _current ? _current->offset : 0 };\n    }\n\n    \/\/ Returns the amount of bytes written since given position.\n    \/\/ \"pos\" must be valid.\n    size_type written_since(position pos) {\n        chunk* c = pos._chunk;\n        if (!c) {\n            return _size;\n        }\n        size_type total = c->offset - pos._offset;\n        c = c->next.get();\n        while (c) {\n            total += c->offset;\n            c = c->next.get();\n        }\n        return total;\n    }\n\n    \/\/ Rollbacks all data written after \"pos\".\n    \/\/ Invalidates all placeholders and positions created after \"pos\".\n    void retract(position pos) {\n        if (!pos._chunk) {\n            *this = {};\n            return;\n        }\n        _size -= written_since(pos);\n        _current = pos._chunk;\n        _current->next = nullptr;\n        _current->offset = pos._offset;\n    }\n\n    void reduce_chunk_count() {\n        \/\/ FIXME: This is a simplified version. It linearizes the whole buffer\n        \/\/ if its size is below max_chunk_size. We probably could also gain\n        \/\/ some read performance by doing \"real\" reduction, i.e. merging\n        \/\/ all chunks until all but the last one is max_chunk_size.\n        if (size() < max_chunk_size()) {\n            linearize();\n        }\n    }\n\n    bool operator==(const bytes_ostream& other) const {\n        auto as = fragments().begin();\n        auto as_end = fragments().end();\n        auto bs = other.fragments().begin();\n        auto bs_end = other.fragments().end();\n\n        auto a = *as++;\n        auto b = *bs++;\n        while (!a.empty() || !b.empty()) {\n            auto now = std::min(a.size(), b.size());\n            if (!std::equal(a.begin(), a.begin() + now, b.begin(), b.begin() + now)) {\n                return false;\n            }\n            a.remove_prefix(now);\n            if (a.empty() && as != as_end) {\n                a = *as++;\n            }\n            b.remove_prefix(now);\n            if (b.empty() && bs != bs_end) {\n                b = *bs++;\n            }\n        }\n        return true;\n    }\n\n    bool operator!=(const bytes_ostream& other) const {\n        return !(*this == other);\n    }\n};\n\ntemplate<>\nstruct appending_hash<bytes_ostream> {\n    template<typename Hasher>\n    void operator()(Hasher& h, const bytes_ostream& b) const {\n        for (auto&& frag : b.fragments()) {\n            feed_hash(h, frag);\n        }\n    }\n};\n<commit_msg>bytes_ostream: make fragment_iterator default constructible<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 <boost\/range\/iterator_range.hpp>\n\n#include \"bytes.hh\"\n#include \"core\/unaligned.hh\"\n#include \"hashing.hh\"\n#include \"seastar\/core\/simple-stream.hh\"\n\/**\n * Utility for writing data into a buffer when its final size is not known up front.\n *\n * Internally the data is written into a chain of chunks allocated on-demand.\n * No resizing of previously written data happens.\n *\n *\/\nclass bytes_ostream {\npublic:\n    using size_type = bytes::size_type;\n    using value_type = bytes::value_type;\n    static constexpr size_type max_chunk_size() { return 16 * 1024; }\nprivate:\n    static_assert(sizeof(value_type) == 1, \"value_type is assumed to be one byte long\");\n    struct chunk {\n        \/\/ FIXME: group fragment pointers to reduce pointer chasing when packetizing\n        std::unique_ptr<chunk> next;\n        ~chunk() {\n            auto p = std::move(next);\n            while (p) {\n                \/\/ Avoid recursion when freeing chunks\n                auto p_next = std::move(p->next);\n                p = std::move(p_next);\n            }\n        }\n        size_type offset; \/\/ Also means \"size\" after chunk is closed\n        size_type size;\n        value_type data[0];\n        void operator delete(void* ptr) { free(ptr); }\n    };\n    \/\/ FIXME: consider increasing chunk size as the buffer grows\n    static constexpr size_type chunk_size{512};\nprivate:\n    std::unique_ptr<chunk> _begin;\n    chunk* _current;\n    size_type _size;\npublic:\n    class fragment_iterator : public std::iterator<std::input_iterator_tag, bytes_view> {\n        chunk* _current = nullptr;\n    public:\n        fragment_iterator() = default;\n        fragment_iterator(chunk* current) : _current(current) {}\n        fragment_iterator(const fragment_iterator&) = default;\n        fragment_iterator& operator=(const fragment_iterator&) = default;\n        bytes_view operator*() const {\n            return { _current->data, _current->offset };\n        }\n        bytes_view operator->() const {\n            return *(*this);\n        }\n        fragment_iterator& operator++() {\n            _current = _current->next.get();\n            return *this;\n        }\n        fragment_iterator operator++(int) {\n            fragment_iterator tmp(*this);\n            ++(*this);\n            return tmp;\n        }\n        bool operator==(const fragment_iterator& other) const {\n            return _current == other._current;\n        }\n        bool operator!=(const fragment_iterator& other) const {\n            return _current != other._current;\n        }\n    };\nprivate:\n    inline size_type current_space_left() const {\n        if (!_current) {\n            return 0;\n        }\n        return _current->size - _current->offset;\n    }\n    \/\/ Figure out next chunk size.\n    \/\/   - must be enough for data_size\n    \/\/   - must be at least chunk_size\n    \/\/   - try to double each time to prevent too many allocations\n    \/\/   - do not exceed max_chunk_size\n    size_type next_alloc_size(size_t data_size) const {\n        auto next_size = _current\n                ? _current->size * 2\n                : chunk_size;\n        next_size = std::min(next_size, max_chunk_size());\n        \/\/ FIXME: check for overflow?\n        return std::max<size_type>(next_size, data_size + sizeof(chunk));\n    }\n    \/\/ Makes room for a contiguous region of given size.\n    \/\/ The region is accounted for as already written.\n    \/\/ size must not be zero.\n    value_type* alloc(size_type size) {\n        if (size <= current_space_left()) {\n            auto ret = _current->data + _current->offset;\n            _current->offset += size;\n            _size += size;\n            return ret;\n        } else {\n            auto alloc_size = next_alloc_size(size);\n            auto space = malloc(alloc_size);\n            if (!space) {\n                throw std::bad_alloc();\n            }\n            auto new_chunk = std::unique_ptr<chunk>(new (space) chunk());\n            new_chunk->offset = size;\n            new_chunk->size = alloc_size - sizeof(chunk);\n            if (_current) {\n                _current->next = std::move(new_chunk);\n                _current = _current->next.get();\n            } else {\n                _begin = std::move(new_chunk);\n                _current = _begin.get();\n            }\n            _size += size;\n            return _current->data;\n        };\n    }\npublic:\n    bytes_ostream() noexcept\n        : _begin()\n        , _current(nullptr)\n        , _size(0)\n    { }\n\n    bytes_ostream(bytes_ostream&& o) noexcept\n        : _begin(std::move(o._begin))\n        , _current(o._current)\n        , _size(o._size)\n    {\n        o._current = nullptr;\n        o._size = 0;\n    }\n\n    bytes_ostream(const bytes_ostream& o)\n        : _begin()\n        , _current(nullptr)\n        , _size(0)\n    {\n        append(o);\n    }\n\n    bytes_ostream& operator=(const bytes_ostream& o) {\n        if (this != &o) {\n            auto x = bytes_ostream(o);\n            *this = std::move(x);\n        }\n        return *this;\n    }\n\n    bytes_ostream& operator=(bytes_ostream&& o) noexcept {\n        if (this != &o) {\n            this->~bytes_ostream();\n            new (this) bytes_ostream(std::move(o));\n        }\n        return *this;\n    }\n\n    template <typename T>\n    struct place_holder {\n        value_type* ptr;\n        \/\/ makes the place_holder looks like a stream\n        seastar::simple_output_stream get_stream() {\n            return seastar::simple_output_stream(reinterpret_cast<char*>(ptr), sizeof(T));\n        }\n    };\n\n    \/\/ Returns a place holder for a value to be written later.\n    template <typename T>\n    inline\n    std::enable_if_t<std::is_fundamental<T>::value, place_holder<T>>\n    write_place_holder() {\n        return place_holder<T>{alloc(sizeof(T))};\n    }\n\n    value_type* write_place_holder(size_type size) {\n        return alloc(size);\n    }\n\n    \/\/ Writes given sequence of bytes\n    inline void write(bytes_view v) {\n        if (v.empty()) {\n            return;\n        }\n\n        auto this_size = std::min(v.size(), size_t(current_space_left()));\n        if (this_size) {\n            memcpy(_current->data + _current->offset, v.begin(), this_size);\n            _current->offset += this_size;\n            _size += this_size;\n            v.remove_prefix(this_size);\n        }\n\n        while (!v.empty()) {\n            auto this_size = std::min(v.size(), size_t(max_chunk_size()));\n            std::copy_n(v.begin(), this_size, alloc(this_size));\n            v.remove_prefix(this_size);\n        }\n    }\n\n    void write(const char* ptr, size_t size) {\n        write(bytes_view(reinterpret_cast<const signed char*>(ptr), size));\n    }\n\n    bool is_linearized() const {\n        return !_begin || !_begin->next;\n    }\n\n    \/\/ Call only when is_linearized()\n    bytes_view view() const {\n        assert(is_linearized());\n        if (!_current) {\n            return bytes_view();\n        }\n\n        return bytes_view(_current->data, _size);\n    }\n\n    \/\/ Makes the underlying storage contiguous and returns a view to it.\n    \/\/ Invalidates all previously created placeholders.\n    bytes_view linearize() {\n        if (is_linearized()) {\n            return view();\n        }\n\n        auto space = malloc(_size + sizeof(chunk));\n        if (!space) {\n            throw std::bad_alloc();\n        }\n\n        auto new_chunk = std::unique_ptr<chunk>(new (space) chunk());\n        new_chunk->offset = _size;\n        new_chunk->size = _size;\n\n        auto dst = new_chunk->data;\n        auto r = _begin.get();\n        while (r) {\n            auto next = r->next.get();\n            dst = std::copy_n(r->data, r->offset, dst);\n            r = next;\n        }\n\n        _current = new_chunk.get();\n        _begin = std::move(new_chunk);\n        return bytes_view(_current->data, _size);\n    }\n\n    \/\/ Returns the amount of bytes written so far\n    size_type size() const {\n        return _size;\n    }\n\n    bool empty() const {\n        return _size == 0;\n    }\n\n    void reserve(size_t size) {\n        \/\/ FIXME: implement\n    }\n\n    void append(const bytes_ostream& o) {\n        for (auto&& bv : o.fragments()) {\n            write(bv);\n        }\n    }\n\n    \/\/ begin() and end() form an input range to bytes_view representing fragments.\n    \/\/ Any modification of this instance invalidates iterators.\n    fragment_iterator begin() const { return { _begin.get() }; }\n    fragment_iterator end() const { return { nullptr }; }\n\n    boost::iterator_range<fragment_iterator> fragments() const {\n        return { begin(), end() };\n    }\n\n    struct position {\n        chunk* _chunk;\n        size_type _offset;\n    };\n\n    position pos() const {\n        return { _current, _current ? _current->offset : 0 };\n    }\n\n    \/\/ Returns the amount of bytes written since given position.\n    \/\/ \"pos\" must be valid.\n    size_type written_since(position pos) {\n        chunk* c = pos._chunk;\n        if (!c) {\n            return _size;\n        }\n        size_type total = c->offset - pos._offset;\n        c = c->next.get();\n        while (c) {\n            total += c->offset;\n            c = c->next.get();\n        }\n        return total;\n    }\n\n    \/\/ Rollbacks all data written after \"pos\".\n    \/\/ Invalidates all placeholders and positions created after \"pos\".\n    void retract(position pos) {\n        if (!pos._chunk) {\n            *this = {};\n            return;\n        }\n        _size -= written_since(pos);\n        _current = pos._chunk;\n        _current->next = nullptr;\n        _current->offset = pos._offset;\n    }\n\n    void reduce_chunk_count() {\n        \/\/ FIXME: This is a simplified version. It linearizes the whole buffer\n        \/\/ if its size is below max_chunk_size. We probably could also gain\n        \/\/ some read performance by doing \"real\" reduction, i.e. merging\n        \/\/ all chunks until all but the last one is max_chunk_size.\n        if (size() < max_chunk_size()) {\n            linearize();\n        }\n    }\n\n    bool operator==(const bytes_ostream& other) const {\n        auto as = fragments().begin();\n        auto as_end = fragments().end();\n        auto bs = other.fragments().begin();\n        auto bs_end = other.fragments().end();\n\n        auto a = *as++;\n        auto b = *bs++;\n        while (!a.empty() || !b.empty()) {\n            auto now = std::min(a.size(), b.size());\n            if (!std::equal(a.begin(), a.begin() + now, b.begin(), b.begin() + now)) {\n                return false;\n            }\n            a.remove_prefix(now);\n            if (a.empty() && as != as_end) {\n                a = *as++;\n            }\n            b.remove_prefix(now);\n            if (b.empty() && bs != bs_end) {\n                b = *bs++;\n            }\n        }\n        return true;\n    }\n\n    bool operator!=(const bytes_ostream& other) const {\n        return !(*this == other);\n    }\n};\n\ntemplate<>\nstruct appending_hash<bytes_ostream> {\n    template<typename Hasher>\n    void operator()(Hasher& h, const bytes_ostream& b) const {\n        for (auto&& frag : b.fragments()) {\n            feed_hash(h, frag);\n        }\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/phoenix_operator.hpp>\n#include <boost\/spirit\/include\/qi_parse.hpp>\n#include <boost\/spirit\/include\/phoenix_function.hpp>\n#include <boost\/fusion\/include\/std_pair.hpp>\n\n#include \"parser.h\"\n\nParser::Parser()\n{\n}\n\nnamespace qi = boost::spirit::qi;\nnamespace ascii = boost::spirit::ascii;\nnamespace phx = boost::phoenix;\n\n\/\/ this function object is used for star'ing elements from within the parser\n\/\/ the templates achieve, that this can be used for every type (hopefully a semiring)\n\/\/ TODO: enforce that T is subclass of Semiring!\nstruct star_impl\n{\n\ttemplate <typename T> struct result { typedef T type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\ttemplate <typename T>\n\tT operator()(T& s) const \/\/ this function does the actual work\n\t{\n\t\treturn s.star();\n\t}\n};\nconst phx::function<star_impl> star;\n\nstruct free_var_impl\n{\n\ttemplate <typename T>\n\tstruct result { typedef FreeSemiring type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\t\/\/template <typename T>\n\tconst FreeSemiring operator()(std::string& s) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element with the given var\n\t\treturn FreeSemiring(Var::getVar(s));\n\t}\n};\nconst phx::function<free_var_impl> free_var;\n\nstruct rexp_var_impl\n{\n\ttemplate <typename T>\n\tstruct result { typedef CommutativeRExp type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\t\/\/template <typename T>\n\tconst CommutativeRExp operator()(std::string& s) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element with the given var\n\t\treturn CommutativeRExp(Var::getVar(s));\n\t}\n};\nconst phx::function<rexp_var_impl> rexp_var;\n\nstruct polyrexp_impl\n{\n\ttemplate <typename T,typename U>\n\tstruct result { typedef Polynomial<CommutativeRExp> type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\tconst Polynomial<CommutativeRExp> operator()(CommutativeRExp& s, std::vector<std::string>& v) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element with the given var\n\t\tstd::vector<VarPtr> vars;\n\t\tfor(auto it = v.begin(); it != v.end(); ++it)\n\t\t\tvars.push_back(Var::getVar(*it));\n\t\treturn Polynomial<CommutativeRExp>({Monomial<CommutativeRExp>(s,vars)});\n\t}\n};\nconst phx::function<polyrexp_impl> polyrexp;\n\nstruct polyrexp2_impl\n{\n\ttemplate <typename T>\n\tstruct result { typedef Polynomial<CommutativeRExp> type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\tconst Polynomial<CommutativeRExp> operator()(std::string& s) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element without a variable\n\t\treturn Polynomial<CommutativeRExp>({Monomial<CommutativeRExp>(CommutativeRExp(Var::getVar(s)),{})});\n\t}\n};\nconst phx::function<polyrexp2_impl> polyrexp2;\n\nstruct polyvar_impl\n{\n\ttemplate <typename T>\n\tstruct result { typedef Polynomial<CommutativeRExp> type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\tconst Polynomial<CommutativeRExp> operator()(std::string& var) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element with the given var\n\t\tif(var == \"1\") \/\/ special case for the one-element\n\t\t\treturn Polynomial<CommutativeRExp>::one();\n\t\telse\n\t\t\treturn Polynomial<CommutativeRExp>({Monomial<CommutativeRExp>(CommutativeRExp::one(),{Var::getVar(var)})});\n\t}\n};\nconst phx::function<polyvar_impl> polyvar;\n\n\/\/ some boost::qi methods for pushing values through our parser\nusing qi::_val;\nusing qi::_1;\nusing qi::_2;\nusing qi::lit;\nusing qi::lexeme;\nusing qi::eps;\n\ntemplate <typename Iterator, typename Skipper>\nstruct float_parser : qi::grammar<Iterator, FloatSemiring(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\tfloat_parser() : float_parser::base_type(expression)\n\t{\n\t\t\/\/ what does a float expression look like?\n\t\texpression = term [_val  = _1] >> *( '+' >> term [_val = _val + _1] );\n\t\tterm = starfactor [_val = _1] >> *( 'x' >> starfactor [_val = _val * _1] );\n\t\tstarfactor = factor [_val = _1] >> -(lit('*'))[_val = star(_val)];\n\t\tfactor =\n\t\t\tqi::float_ [_val = _1] |\n\t\t\t'(' >> expression [_val = _1] >> ')';\n\t}\n\n\t\/\/ this declare the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, FloatSemiring(), Skipper> expression;\n\tqi::rule<Iterator, FloatSemiring(), Skipper> term;\n\tqi::rule<Iterator, FloatSemiring(), Skipper> starfactor;\n\tqi::rule<Iterator, FloatSemiring(), Skipper> factor;\n\n};\n\ntemplate <typename Iterator, typename Skipper>\nstruct free_parser : qi::grammar<Iterator, FreeSemiring(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\tfree_parser() : free_parser::base_type(expression)\n\t{\n\t\t\/\/ what does a free semiring term look like?\n\t\texpression = term [_val  = _1] >> *( '+' >> term [_val = _val + _1] );\n\t\tterm = starfactor [_val = _1] >> *( '.' >> starfactor [_val = _val * _1] );\n\t\tstarfactor = factor [_val = _1] >> -(lit('*'))[_val = star(_val)];\n\t\tfactor =\n\t\t\tqi::as_string[lexeme[+qi::alpha]] [_val = free_var(_1)] |\n\t\t\t'(' >> expression [_val = _1] >> ')';\n\t}\n\n\t\/\/ this declare the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, FreeSemiring(), Skipper> expression;\n\tqi::rule<Iterator, FreeSemiring(), Skipper> term;\n\tqi::rule<Iterator, FreeSemiring(), Skipper> starfactor;\n\tqi::rule<Iterator, FreeSemiring(), Skipper> factor;\n};\n\ntemplate <typename Iterator, typename Skipper>\nstruct rexp_parser : qi::grammar<Iterator, CommutativeRExp(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\trexp_parser() : rexp_parser::base_type(expression)\n\t{\n\t\t\/\/ what does a commutative regular expression term look like?\n\t\texpression = term [_val  = _1] >> *( '+' >> term [_val = _val + _1] );\n\t\tterm = starfactor [_val = _1] >> *( '.' >> starfactor [_val = _val * _1] );\n\t\tstarfactor = factor [_val = _1] >> -(lit('*'))[_val = star(_val)];\n\t\tfactor =\n\t\t\tqi::as_string[lexeme[+qi::alpha]] [_val = rexp_var(_1)] |\n\t\t\t'(' >> expression [_val = _1] >> ')';\n\t}\n\n\t\/\/ this declare the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, CommutativeRExp(), Skipper> expression;\n\tqi::rule<Iterator, CommutativeRExp(), Skipper> term;\n\tqi::rule<Iterator, CommutativeRExp(), Skipper> starfactor;\n\tqi::rule<Iterator, CommutativeRExp(), Skipper> factor;\n};\n\ntemplate <typename Iterator, typename Skipper>\nstruct polyrexp_parser : qi::grammar<Iterator, Polynomial<CommutativeRExp>(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\tpolyrexp_parser() : polyrexp_parser::base_type(expression)\n\t{\n\t\t\/\/ what does a polynomial in the commutative regular expression semiring look like?\n\t\texpression = term [_val  = _1] >> *( '+' >> term [_val = _val + _1] );\n\t\tterm = ( rexp >> *( '.' >> var) )[_val = polyrexp(_1, _2)];\n\t\tvar = +qi::as_string[lexeme[+qi::upper]] [_val = _1];\n\t\t\/\/var = +qi::as_string[lexeme['<' >> +(ascii::char_ - '>') >> '>']] [_val = _1];\n\t}\n\n\t\/\/ this declare the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> expression;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> term;\n\tqi::rule<Iterator, std::string(), Skipper> var;\n\trexp_parser<Iterator, Skipper> rexp;\n};\n\n\/\/FIXME: empty lines in the input-file lead to a segfault :)\n\/\/TODO: allow rules going over multiple lines\n\ntemplate <typename Iterator, typename Skipper>\nstruct grammar_parser : qi::grammar<Iterator, std::pair<std::string, Polynomial<CommutativeRExp>>(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\tgrammar_parser() : grammar_parser::base_type(rule)\n\t{\n\t\t\/\/ what does a polynomial in the commutative regular expression semiring look like?\n\t\trule %= (varidentifier >> lexeme[\"::=\"] >> expression);\n\t\texpression = term [_val = _1] >> *('|' >> expression [_val = _val + _1]); \/\/ addition\n\t\tterm = \teps [_val = Polynomial<CommutativeRExp>::one()] >> \/\/ set _val to be the one-element of the semiring\n\t\t\t*(\n\t\t\t\t('(' >> expression >> ')') [_val = _val * _1] |\n\t\t\t\tliteral\t[_val = _val * _1] |\n\t\t\t\tvar\t[_val = _val * _1]  ); \/\/ multiplication\n\t\t\/\/literal = '\"' >> literalidentifier [_val = polyrexp2(_1)] >> '\"';\n\t\tliteral = sidentifier [_val = polyrexp2(_1)] |\n\t\t\t\t'\"' >> literalidentifier [_val = polyrexp2(_1)] >> '\"';\n\t\tvar = varidentifier[_val = polyvar(_1)];\n\t\tliteralidentifier = qi::as_string[lexeme[+(ascii::char_ - '\"' - '|' -'('- ')' - ascii::space - '<' - '>')]];\n\t\tsidentifier = qi::as_string[lexeme[(ascii::char_ - '\"' - '|' -'('- ')' - ascii::space - '<' - '>')]];\n\t\t\/\/varidentifier = qi::as_string[lexeme[+(ascii::char_ - ':' - '=' - '|' - '(' - ')' - ascii::space)]];\n\t\tvaridentifier = qi::as_string[lexeme['<' >> +(ascii::char_ - '>') >> '>']];\n\t}\n\n\t\/\/ this declares the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, std::pair<std::string, Polynomial<CommutativeRExp>>(), Skipper> rule;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> expression;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> term;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> var;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> literal;\n\tqi::rule<Iterator, std::string(), Skipper> varidentifier;\n\tqi::rule<Iterator, std::string(), Skipper> literalidentifier;\n\tqi::rule<Iterator, std::string(), Skipper> sidentifier;\n};\n\ntypedef std::string::const_iterator iterator_type;\n\nFloatSemiring Parser::parse_float(std::string input)\n{\n\ttypedef float_parser<iterator_type, qi::space_type> float_parser;\n\tfloat_parser floater;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tFloatSemiring result;\n\tif(!(qi::phrase_parse(iter, end, floater, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\treturn result;\n}\n\n\nFreeSemiring Parser::parse_free(std::string input)\n{\n\ttypedef free_parser<iterator_type, qi::space_type> free_parser;\n\tfree_parser freeer;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tFreeSemiring result;\n\tif(!(qi::phrase_parse(iter, end, freeer, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\treturn result;\n}\n\nCommutativeRExp Parser::parse_rexp(std::string input)\n{\n\ttypedef rexp_parser<iterator_type, qi::space_type> rexp_parser;\n\trexp_parser rexper;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tCommutativeRExp result;\n\tif(!(qi::phrase_parse(iter, end, rexper, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\treturn result;\n}\n\nPolynomial<CommutativeRExp> Parser::parse_polyrexp(std::string input)\n{\n\ttypedef polyrexp_parser<iterator_type, qi::space_type> polyrexp_parser;\n\tpolyrexp_parser polyrexper;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tPolynomial<CommutativeRExp> result;\n\tif(!(qi::phrase_parse(iter, end, polyrexper, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\n\treturn result;\n}\n\nstd::pair<VarPtr, Polynomial<CommutativeRExp>> Parser::parse_grammar(std::string input)\n{\n\ttypedef grammar_parser<iterator_type, qi::space_type> grammar_parser;\n\tgrammar_parser grammarer;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tstd::pair<std::string, Polynomial<CommutativeRExp>> result;\n\tif(!(qi::phrase_parse(iter, end, grammarer, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\treturn std::pair<VarPtr, Polynomial<CommutativeRExp>>(Var::getVar(result.first), result.second);\n}\n<commit_msg>fixed small parser-bug... literals may be multiple-char literals enclosed in \"...\" or single char lits<commit_after>#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/phoenix_operator.hpp>\n#include <boost\/spirit\/include\/qi_parse.hpp>\n#include <boost\/spirit\/include\/phoenix_function.hpp>\n#include <boost\/fusion\/include\/std_pair.hpp>\n\n#include \"parser.h\"\n\nParser::Parser()\n{\n}\n\nnamespace qi = boost::spirit::qi;\nnamespace ascii = boost::spirit::ascii;\nnamespace phx = boost::phoenix;\n\n\/\/ this function object is used for star'ing elements from within the parser\n\/\/ the templates achieve, that this can be used for every type (hopefully a semiring)\n\/\/ TODO: enforce that T is subclass of Semiring!\nstruct star_impl\n{\n\ttemplate <typename T> struct result { typedef T type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\ttemplate <typename T>\n\tT operator()(T& s) const \/\/ this function does the actual work\n\t{\n\t\treturn s.star();\n\t}\n};\nconst phx::function<star_impl> star;\n\nstruct free_var_impl\n{\n\ttemplate <typename T>\n\tstruct result { typedef FreeSemiring type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\t\/\/template <typename T>\n\tconst FreeSemiring operator()(std::string& s) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element with the given var\n\t\treturn FreeSemiring(Var::getVar(s));\n\t}\n};\nconst phx::function<free_var_impl> free_var;\n\nstruct rexp_var_impl\n{\n\ttemplate <typename T>\n\tstruct result { typedef CommutativeRExp type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\t\/\/template <typename T>\n\tconst CommutativeRExp operator()(std::string& s) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element with the given var\n\t\treturn CommutativeRExp(Var::getVar(s));\n\t}\n};\nconst phx::function<rexp_var_impl> rexp_var;\n\nstruct polyrexp_impl\n{\n\ttemplate <typename T,typename U>\n\tstruct result { typedef Polynomial<CommutativeRExp> type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\tconst Polynomial<CommutativeRExp> operator()(CommutativeRExp& s, std::vector<std::string>& v) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element with the given var\n\t\tstd::vector<VarPtr> vars;\n\t\tfor(auto it = v.begin(); it != v.end(); ++it)\n\t\t\tvars.push_back(Var::getVar(*it));\n\t\treturn Polynomial<CommutativeRExp>({Monomial<CommutativeRExp>(s,vars)});\n\t}\n};\nconst phx::function<polyrexp_impl> polyrexp;\n\nstruct polyrexp2_impl\n{\n\ttemplate <typename T>\n\tstruct result { typedef Polynomial<CommutativeRExp> type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\tconst Polynomial<CommutativeRExp> operator()(std::string& s) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element without a variable\n\t\treturn Polynomial<CommutativeRExp>({Monomial<CommutativeRExp>(CommutativeRExp(Var::getVar(s)),{})});\n\t}\n};\nconst phx::function<polyrexp2_impl> polyrexp2;\n\nstruct polyvar_impl\n{\n\ttemplate <typename T>\n\tstruct result { typedef Polynomial<CommutativeRExp> type; }; \/\/ needed because this is how boost knows of what type the result will be\n\n\tconst Polynomial<CommutativeRExp> operator()(std::string& var) const \/\/ this function does the actual work\n\t{\n\t\t\/\/ create an element with the given var\n\t\tif(var == \"1\") \/\/ special case for the one-element\n\t\t\treturn Polynomial<CommutativeRExp>::one();\n\t\telse\n\t\t\treturn Polynomial<CommutativeRExp>({Monomial<CommutativeRExp>(CommutativeRExp::one(),{Var::getVar(var)})});\n\t}\n};\nconst phx::function<polyvar_impl> polyvar;\n\n\/\/ some boost::qi methods for pushing values through our parser\nusing qi::_val;\nusing qi::_1;\nusing qi::_2;\nusing qi::lit;\nusing qi::lexeme;\nusing qi::eps;\n\ntemplate <typename Iterator, typename Skipper>\nstruct float_parser : qi::grammar<Iterator, FloatSemiring(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\tfloat_parser() : float_parser::base_type(expression)\n\t{\n\t\t\/\/ what does a float expression look like?\n\t\texpression = term [_val  = _1] >> *( '+' >> term [_val = _val + _1] );\n\t\tterm = starfactor [_val = _1] >> *( 'x' >> starfactor [_val = _val * _1] );\n\t\tstarfactor = factor [_val = _1] >> -(lit('*'))[_val = star(_val)];\n\t\tfactor =\n\t\t\tqi::float_ [_val = _1] |\n\t\t\t'(' >> expression [_val = _1] >> ')';\n\t}\n\n\t\/\/ this declare the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, FloatSemiring(), Skipper> expression;\n\tqi::rule<Iterator, FloatSemiring(), Skipper> term;\n\tqi::rule<Iterator, FloatSemiring(), Skipper> starfactor;\n\tqi::rule<Iterator, FloatSemiring(), Skipper> factor;\n\n};\n\ntemplate <typename Iterator, typename Skipper>\nstruct free_parser : qi::grammar<Iterator, FreeSemiring(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\tfree_parser() : free_parser::base_type(expression)\n\t{\n\t\t\/\/ what does a free semiring term look like?\n\t\texpression = term [_val  = _1] >> *( '+' >> term [_val = _val + _1] );\n\t\tterm = starfactor [_val = _1] >> *( '.' >> starfactor [_val = _val * _1] );\n\t\tstarfactor = factor [_val = _1] >> -(lit('*'))[_val = star(_val)];\n\t\tfactor =\n\t\t\tqi::as_string[lexeme[+qi::alpha]] [_val = free_var(_1)] |\n\t\t\t'(' >> expression [_val = _1] >> ')';\n\t}\n\n\t\/\/ this declare the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, FreeSemiring(), Skipper> expression;\n\tqi::rule<Iterator, FreeSemiring(), Skipper> term;\n\tqi::rule<Iterator, FreeSemiring(), Skipper> starfactor;\n\tqi::rule<Iterator, FreeSemiring(), Skipper> factor;\n};\n\ntemplate <typename Iterator, typename Skipper>\nstruct rexp_parser : qi::grammar<Iterator, CommutativeRExp(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\trexp_parser() : rexp_parser::base_type(expression)\n\t{\n\t\t\/\/ what does a commutative regular expression term look like?\n\t\texpression = term [_val  = _1] >> *( '+' >> term [_val = _val + _1] );\n\t\tterm = starfactor [_val = _1] >> *( '.' >> starfactor [_val = _val * _1] );\n\t\tstarfactor = factor [_val = _1] >> -(lit('*'))[_val = star(_val)];\n\t\tfactor =\n\t\t\tqi::as_string[lexeme[+qi::alpha]] [_val = rexp_var(_1)] |\n\t\t\t'(' >> expression [_val = _1] >> ')';\n\t}\n\n\t\/\/ this declare the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, CommutativeRExp(), Skipper> expression;\n\tqi::rule<Iterator, CommutativeRExp(), Skipper> term;\n\tqi::rule<Iterator, CommutativeRExp(), Skipper> starfactor;\n\tqi::rule<Iterator, CommutativeRExp(), Skipper> factor;\n};\n\ntemplate <typename Iterator, typename Skipper>\nstruct polyrexp_parser : qi::grammar<Iterator, Polynomial<CommutativeRExp>(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\tpolyrexp_parser() : polyrexp_parser::base_type(expression)\n\t{\n\t\t\/\/ what does a polynomial in the commutative regular expression semiring look like?\n\t\texpression = term [_val  = _1] >> *( '+' >> term [_val = _val + _1] );\n\t\tterm = ( rexp >> *( '.' >> var) )[_val = polyrexp(_1, _2)];\n\t\tvar = +qi::as_string[lexeme[+qi::upper]] [_val = _1];\n\t\t\/\/var = +qi::as_string[lexeme['<' >> +(ascii::char_ - '>') >> '>']] [_val = _1];\n\t}\n\n\t\/\/ this declare the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> expression;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> term;\n\tqi::rule<Iterator, std::string(), Skipper> var;\n\trexp_parser<Iterator, Skipper> rexp;\n};\n\n\/\/FIXME: empty lines in the input-file lead to a segfault :)\n\/\/TODO: allow rules going over multiple lines\n\ntemplate <typename Iterator, typename Skipper>\nstruct grammar_parser : qi::grammar<Iterator, std::pair<std::string, Polynomial<CommutativeRExp>>(), Skipper>\n{\n\t\/\/ specify the parser rules, term is the start rule (and in this case the only rule)\n\tgrammar_parser() : grammar_parser::base_type(rule)\n\t{\n\t\t\/\/ what does a polynomial in the commutative regular expression semiring look like?\n\t\trule %= (varidentifier >> lexeme[\"::=\"] >> expression);\n\t\texpression = term [_val = _1] >> *('|' >> expression [_val = _val + _1]); \/\/ addition\n\t\tterm = \teps [_val = Polynomial<CommutativeRExp>::one()] >> \/\/ set _val to be the one-element of the semiring\n\t\t\t*(\n\t\t\t\t('(' >> expression >> ')') [_val = _val * _1] |\n\t\t\t\tvar\t[_val = _val * _1]   | \/\/ multiplication\n                literal\t[_val = _val * _1] );\n\t\t\/\/literal = '\"' >> literalidentifier [_val = polyrexp2(_1)] >> '\"';\n\t\tliteral = '\"' >> literalidentifier [_val = polyrexp2(_1)] >> '\"' | sidentifier [_val = polyrexp2(_1)];\n\n\t\tvar = varidentifier[_val = polyvar(_1)];\n\t\tliteralidentifier = qi::as_string[lexeme[+(ascii::char_ -'\"')] ];\n\t\tsidentifier = qi::as_string[lexeme[(ascii::char_ - '\"' - '|' -'('- ')' - ascii::space - '<' - '>')]];\n\t\t\/\/varidentifier = qi::as_string[lexeme[+(ascii::char_ - ':' - '=' - '|' - '(' - ')' - ascii::space)]];\n\t\tvaridentifier = qi::as_string[lexeme['<' >> +(ascii::char_ - '>') >> '>']];\n\t}\n\n\t\/\/ this declares the available rules and the respecting return types of our parser\n\tqi::rule<Iterator, std::pair<std::string, Polynomial<CommutativeRExp>>(), Skipper> rule;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> expression;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> term;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> var;\n\tqi::rule<Iterator, Polynomial<CommutativeRExp>(), Skipper> literal;\n\tqi::rule<Iterator, std::string(), Skipper> varidentifier;\n\tqi::rule<Iterator, std::string(), Skipper> literalidentifier;\n\tqi::rule<Iterator, std::string(), Skipper> sidentifier;\n};\n\ntypedef std::string::const_iterator iterator_type;\n\nFloatSemiring Parser::parse_float(std::string input)\n{\n\ttypedef float_parser<iterator_type, qi::space_type> float_parser;\n\tfloat_parser floater;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tFloatSemiring result;\n\tif(!(qi::phrase_parse(iter, end, floater, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\treturn result;\n}\n\n\nFreeSemiring Parser::parse_free(std::string input)\n{\n\ttypedef free_parser<iterator_type, qi::space_type> free_parser;\n\tfree_parser freeer;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tFreeSemiring result;\n\tif(!(qi::phrase_parse(iter, end, freeer, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\treturn result;\n}\n\nCommutativeRExp Parser::parse_rexp(std::string input)\n{\n\ttypedef rexp_parser<iterator_type, qi::space_type> rexp_parser;\n\trexp_parser rexper;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tCommutativeRExp result;\n\tif(!(qi::phrase_parse(iter, end, rexper, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\treturn result;\n}\n\nPolynomial<CommutativeRExp> Parser::parse_polyrexp(std::string input)\n{\n\ttypedef polyrexp_parser<iterator_type, qi::space_type> polyrexp_parser;\n\tpolyrexp_parser polyrexper;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tPolynomial<CommutativeRExp> result;\n\tif(!(qi::phrase_parse(iter, end, polyrexper, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\n\treturn result;\n}\n\nstd::pair<VarPtr, Polynomial<CommutativeRExp>> Parser::parse_grammar(std::string input)\n{\n\ttypedef grammar_parser<iterator_type, qi::space_type> grammar_parser;\n\tgrammar_parser grammarer;\n\n\titerator_type iter = input.begin();\n\titerator_type end = input.end();\n\n\tstd::pair<std::string, Polynomial<CommutativeRExp>> result;\n\tif(!(qi::phrase_parse(iter, end, grammarer, qi::space, result) && iter == end))\n\t\tstd::cout << \"bad input, failed at: \" << std::string(iter, end) << std::endl;\n\n\treturn std::pair<VarPtr, Polynomial<CommutativeRExp>>(Var::getVar(result.first), result.second);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * c7a\/api\/sort.hpp\n *\n * Part of Project c7a.\n *\n * Copyright (C) 2015 Alexander Noe <aleexnoe@gmail.com>\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef C7A_API_SORT_HEADER\n#define C7A_API_SORT_HEADER\n\n#include <c7a\/api\/context.hpp>\n#include <c7a\/api\/dia.hpp>\n#include <c7a\/api\/function_stack.hpp>\n#include <c7a\/common\/logger.hpp>\n#include <c7a\/net\/collective_communication.hpp>\n#include <c7a\/net\/flow_control_channel.hpp>\n#include <c7a\/net\/flow_control_manager.hpp>\n#include <c7a\/net\/group.hpp>\n\n#include <cmath>\n\nnamespace c7a {\nnamespace api {\n\nnamespace {\n\ntemplate <typename ValueType>\nstruct TreeBuilder\n{\n\n    ValueType * tree_;\n    ValueType * samples_;\n    size_t    index_;\n    size_t    ssplitter;\n\n    TreeBuilder(ValueType* splitter_tree, \/\/ Target: tree. Size of 'number of splitter'\n                ValueType* samples,       \/\/ Source: sorted splitters. Size of 'number of splitter'\n                size_t ssplitter)         \/\/ Number of splitter\n        : tree_(splitter_tree),\n          samples_(samples),\n          index_(0),\n          ssplitter(ssplitter) {\n        recurse(samples, samples + ssplitter, 1);\n    }\n\n    ssize_t   snum(ValueType* s) const {\n        return (ssize_t)(s - samples_);\n    }\n\n    ValueType recurse(ValueType* lo, ValueType* hi, unsigned int treeidx) {\n\n        \/\/ pick middle element as splitter\n        ValueType* mid = lo + (ssize_t)(hi - lo) \/ 2;\n\n        ValueType mykey = tree_[treeidx] = *mid;\n\n        ValueType* midlo = mid, * midhi = mid + 1;\n\n        if (2 * treeidx < ssplitter)\n        {\n            recurse(lo, midlo, 2 * treeidx + 0);\n\n            return recurse(midhi, hi, 2 * treeidx + 1);\n        }\n        else\n        {\n            return mykey;\n        }\n    }\n};\t\n\ntemplate <class T1, typename CompareFunction>\nstruct BucketEmitter\n{\n    static bool Equal(CompareFunction compare_function, const T1& ele1, const T1& ele2) {\n        return !(compare_function(ele1, ele2) || compare_function(ele2, ele1));\n    }\n\n\tstatic size_t RoundDown(size_t ele, size_t by) {\n\t\treturn ((ele) & ~((by) - 1));\n\t}\n\n    static void emitToBuckets(\n        const T1* const a,\n        const size_t n,\n        const T1* const treearr, \/\/ Tree. sizeof |splitter|\n        size_t k,                \/\/ Number of buckets\n        size_t logK,\n        std::vector<data::BlockWriter>& emitters,\n        size_t actual_k,\n        CompareFunction compare_function,\n        const T1* const sorted_splitters,\n        size_t prefix_elem,\n        size_t total_elem) {\n\n        const size_t stepsize = 2;\n\n        size_t i = 0;\n        for ( ; i < RoundDown(n, stepsize); i += stepsize)\n        {\n\n            size_t j0 = 1;\n            const T1& el0 = a[i];\n            size_t j1 = 1;\n            const T1& el1 = a[i + 1];\n\n            for (size_t l = 0; l < logK; l++)\n            {\n\n                j0 = j0 * 2 + !(compare_function(el0, treearr[j0]));\n                j1 = j1 * 2 + !(compare_function(el1, treearr[j1]));\n            }\n\n            size_t b0 = j0 - k;\n            size_t b1 = j1 - k;\n\n            \/\/TODO(an): Remove this ugly workaround as soon as emitters are movable.\n            \/\/Move emitter[actual_k] to emitter[splitter_count] before calling this.\n            if (b0 >= actual_k) {\n                b0 = actual_k - 1;\n            }\n\n            while (b0 && Equal(compare_function, el0, sorted_splitters[b0 - 1])\n                   && (prefix_elem + i) * actual_k > b0 * total_elem) {\n                b0--;\n            }\n            emitters[b0](el0);\n            if (b1 >= actual_k) {\n                b1 = actual_k - 1;\n            }\n            while (b1 && Equal(compare_function, el1, sorted_splitters[b1 - 1])\n                   && (prefix_elem + i + 1) * actual_k > b1 * total_elem) {\n                b1--;\n            }\n            emitters[b1](el1);\n        }\n        for ( ; i < n; i++)\n        {\n\n            size_t j = 1;\n            for (size_t l = 0; l < logK; l++)\n            {\n                j = j * 2 + !(compare_function(a[i], treearr[j]));\n            }\n            size_t b = j - k;\n\n            if (b >= actual_k) {\n                b = actual_k - 1;\n            }\n            while (b && Equal(compare_function, a[i], sorted_splitters[b - 1])\n                   && (prefix_elem + i) * actual_k > b * total_elem) {\n                b--;\n            }\n            emitters[b](a[i]);\n        }\n    }\n};\n\n}\n\n\/\/! \\addtogroup api Interface\n\/\/! \\{\n\n\/*!\n * A DIANode which performs a Sort operation. Sort sorts a DIA according to a given\n * compare function\n *\n * \\tparam ValueType Type of DIA elements\n * \\tparam Stack Function stack, which contains the chained lambdas between the last and this DIANode.\n * \\tparam CompareFunction Type of the compare function\n *\/\ntemplate <typename ValueType, typename ParentStack, typename CompareFunction>\nclass SortNode : public DOpNode<ValueType>\n{\n    static const bool debug = false;\n\n    using Super = DOpNode<ValueType>;\n    using Super::context_;\n    using Super::result_file_;\n\n    using ParentInput = typename ParentStack::Input;\n\npublic:\n    \/*!\n     * Constructor for a sort node.\n     *\n     * \\param ctx Context for this operation\n     * \\param parent Previous DIANode in the computation chain\n     * \\param parent_stack Stack of lambda functions between parent and this node\n     * \\param compare_function Function comparing two elements.\n     *\/\n    SortNode(Context& ctx,\n             std::shared_ptr<DIANode<ParentInput> > parent,\n             const ParentStack& parent_stack,\n             CompareFunction compare_function)\n        : DOpNode<ValueType>(ctx, { parent }, \"Sort\"),\n          compare_function_(compare_function),\n          channel_id_samples_(ctx.data_manager().GetNewChannel()),\n          emitters_samples_(channel_id_samples_->OpenWriters()),\n          channel_id_data_(ctx.data_manager().GetNewChannel()),\n          emitters_data_(channel_id_data_->OpenWriters()),\n          parent_(parent)\n    {\n        \/\/ Hook PreOp(s)\n        auto pre_op_fn = [ = ](const ValueType& input) {\n                             PreOp(input);\n                         };\n\n        lop_chain_ = parent_stack.push(pre_op_fn).emit();\n\n        parent_->RegisterChild(lop_chain_);\n    }\n\n    virtual ~SortNode() {        \n        parent_->UnregisterChild(lop_chain_);\n    }\n\n    \/\/! Executes the sum operation.\n    void Execute() override {\n        this->StartExecutionTimer();\n        MainOp();\n        this->StopExecutionTimer();\n    }\n\n    \/*!\n     * Produces an 'empty' function stack, which only contains the identity\n     * emitter function.\n     *\n     * \\return Empty function stack\n     *\/\n    auto ProduceStack() {\n        \/\/ Hook Identity\n        auto id_fn = [ = ](ValueType t, auto emit_func) {\n                         return emit_func(t);\n                     };\n\n        return MakeFunctionStack<ValueType>(id_fn);\n    }\n\n    \/*!\n     * Returns \"[SortNode]\" as a string.\n     * \\return \"[SortNode]\"\n     *\/\n    std::string ToString() override {\n        return \"[SortNode] Id:\" + result_file_.ToString();\n    }\n\nprivate:\n    \/\/! The sum function which is applied to two elements.\n    CompareFunction compare_function_;\n    \/\/! Local data\n    std::vector<ValueType> data_;\n\n    \/\/!Emitter to send samples to process 0\n    data::ChannelPtr channel_id_samples_;\n    std::vector<data::BlockWriter> emitters_samples_;\n\n    \/\/!Emitters to send data to other workers specified by splitters.\n    data::ChannelPtr channel_id_data_;\n    std::vector<data::BlockWriter> emitters_data_;\n\n    \/\/epsilon\n    double desired_imbalance = 0.25;\n    \n    std::shared_ptr<DIANode<ParentInput>> parent_; \n    common::delegate<void(ParentInput)> lop_chain_; \n\n    void PreOp(ValueType input) {\n        data_.push_back(input);\n    }\n\n    void FindAndSendSplitters(std::vector<ValueType>& splitters) {\n        \/\/Get samples from other workers\n        size_t num_workers = context_.number_worker();\n        size_t samplesize = std::ceil(log2((double)data_.size()) *\n                                      (1 \/ (desired_imbalance *\n                                            desired_imbalance)));\n\n        std::vector<ValueType> samples;\n        samples.reserve(samplesize * num_workers);\n        auto reader = channel_id_samples_->OpenReader();\n\n        while (reader.HasNext()) {\n            samples.push_back(reader.template Next<ValueType>());\n        }\n\n        \/\/Find splitters\n        std::sort(samples.begin(), samples.end(), compare_function_);\n\n        size_t splitting_size = samples.size() \/ num_workers;\n\n        \/\/Send splitters to other workers\n        for (size_t i = 1; i < num_workers; i++) {\n            splitters.push_back(samples[i * splitting_size]);\n            for (size_t j = 1; j < num_workers; j++) {\n                emitters_samples_[j](samples[i * splitting_size]);\n            }\n        }\n\n        for (size_t j = 1; j < num_workers; j++) {\n            emitters_samples_[j].Close();\n        }\n    }\n\n    void MainOp() {\n        net::FlowControlChannel& channel = context_.flow_control_channel();\n\n        size_t prefix_elem = channel.PrefixSum(data_.size());\n        size_t total_elem = channel.AllReduce(data_.size());\n        \n        size_t num_workers = context_.number_worker();\n        size_t samplesize = std::ceil(log2((double)total_elem) *\n                                      (1 \/ (desired_imbalance * desired_imbalance)));\n\n        LOG << prefix_elem << \" elements, out of \" << total_elem;\n\n        std::random_device random_device;\n        std::default_random_engine generator(random_device());\n        std::uniform_int_distribution<int> distribution(0, data_.size() - 1);\n\n        \/\/Send samples to worker 0\n        for (size_t i = 0; i < samplesize; i++) {\n            size_t sample = distribution(generator);\n            emitters_samples_[0](data_[sample]);\n        }\n        emitters_samples_[0].Close();\n\n        \/\/Get the ceiling of log(num_workers), as SSSS needs 2^n buckets.\n        double log_workers = std::log2(num_workers);\n        const bool powof2 = (std::ceil(log_workers) - log_workers) < 0.0000001;\n        size_t ceil_log = std::ceil(log_workers);\n        size_t workers_algo = 1 << ceil_log;\n        size_t splitter_count_algo = workers_algo - 1;\n\n        std::vector<ValueType> splitters;\n        splitters.reserve(workers_algo);\n\n        if (context_.rank() == 0) {\n            FindAndSendSplitters(splitters);\n        }\n        else {\n            \/\/Close unused emitters\n            for (size_t j = 1; j < num_workers; j++) {\n                emitters_samples_[j].Close();\n            }\n            auto reader = channel_id_samples_->OpenReader();\n            while (reader.HasNext()) {\n                splitters.push_back(reader.template Next<ValueType>());\n            }\n        }\n\n        \/\/code from SS2NPartition, slightly altered\n\n        ValueType* splitter_tree = new ValueType[workers_algo + 1];\n\n        if (!powof2) {\n            for (size_t i = num_workers; i < workers_algo; i++) {\n                splitters.push_back(splitters.back());\n            }\n        }\n\n        TreeBuilder<ValueType>(splitter_tree,\n                                     splitters.data(),\n                                     splitter_count_algo);\n\n        BucketEmitter<ValueType, CompareFunction>::emitToBuckets(\n            data_.data(),\n            data_.size(),\n            splitter_tree, \/\/ Tree. sizeof |splitter|\n            workers_algo,  \/\/ Number of buckets\n            ceil_log,\n            emitters_data_,\n            num_workers,\n            compare_function_,\n            splitters.data(),\n            prefix_elem,\n            total_elem);\n\n        \/\/end of SS2N\n\n        for (size_t i = 0; i < emitters_data_.size(); i++) {\n            emitters_data_[i].Close();\n        }\n\n        data_.clear();\n\n        auto reader = channel_id_data_->OpenReader();\n\n        while (reader.HasNext()) {\n            data_.push_back(reader.template Next<ValueType>());\n        }\n\n\t\tLOG << \"node \" << context_.rank() << \" : \" << data_.size();\n\n        std::sort(data_.begin(), data_.end(), compare_function_);\n\n        for (size_t i = 0; i < data_.size(); i++) {\n            for (auto func : DIANode<ValueType>::callbacks_) {\n                func(data_[i]);\n            }\n        }\n        std::vector<ValueType>().swap(data_);\n    }\n\n    void PostOp() { }\n};\n\ntemplate <typename ValueType, typename Stack>\ntemplate <typename CompareFunction>\nauto DIARef<ValueType, Stack>::Sort(const CompareFunction &compare_function) const {\n\n    using SortResultNode\n              = SortNode<ValueType, Stack, CompareFunction>;\n\n    static_assert(\n        std::is_same<\n            typename common::FunctionTraits<CompareFunction>::template arg<0>,\n            ValueType>::value ||\n        std::is_same<CompareFunction, std::less<ValueType> >::value,\n        \"CompareFunction has the wrong input type\");\n\n    static_assert(\n        std::is_same<\n            typename common::FunctionTraits<CompareFunction>::template arg<1>,\n            ValueType>::value ||\n        std::is_same<CompareFunction, std::less<ValueType> >::value,\n        \"CompareFunction has the wrong input type\");\n\n    static_assert(\n        std::is_same<\n            typename common::FunctionTraits<CompareFunction>::result_type,\n            bool>::value ||\n        std::is_same<CompareFunction, std::less<ValueType> >::value,\n        \"CompareFunction has the wrong output type (should be bool)\");\n\n    auto shared_node\n        = std::make_shared<SortResultNode>(node_->context(),\n                                           node_,\n                                           stack_,\n                                           compare_function);\n\n    auto sort_stack = shared_node->ProduceStack();\n\n    return DIARef<ValueType, decltype(sort_stack)>(\n        std::move(shared_node), sort_stack);\n}\n\n\/\/! \\}\n} \/\/ namespace api\n} \/\/ namespace c7a\n\n#endif \/\/ !C7A_API_SORT_HEADER\n\n\/******************************************************************************\/\n<commit_msg>Simplifying sort treebuilder.<commit_after>\/*******************************************************************************\n * c7a\/api\/sort.hpp\n *\n * Part of Project c7a.\n *\n * Copyright (C) 2015 Alexander Noe <aleexnoe@gmail.com>\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef C7A_API_SORT_HEADER\n#define C7A_API_SORT_HEADER\n\n#include <c7a\/api\/context.hpp>\n#include <c7a\/api\/dia.hpp>\n#include <c7a\/api\/function_stack.hpp>\n#include <c7a\/common\/logger.hpp>\n#include <c7a\/net\/collective_communication.hpp>\n#include <c7a\/net\/flow_control_channel.hpp>\n#include <c7a\/net\/flow_control_manager.hpp>\n#include <c7a\/net\/group.hpp>\n\n#include <cmath>\n\nnamespace c7a {\nnamespace api {\n\n\/\/! \\addtogroup api Interface\n\/\/! \\{\n\nnamespace sort_local {\n\ntemplate <typename ValueType>\nstruct TreeBuilder\n{\n    ValueType * tree_;\n    ValueType * samples_;\n    size_t    index_ = 0;\n    size_t    ssplitter;\n\n    \/*!\n     * Target: tree. Size of 'number of splitter'\n     * Source: sorted splitters. Size of 'number of splitter'\n     * Number of splitter\n     *\/\n    TreeBuilder(ValueType* splitter_tree,\n                ValueType* samples,\n                size_t ssplitter)\n        : tree_(splitter_tree),\n          samples_(samples),\n          ssplitter(ssplitter) {\n        recurse(samples, samples + ssplitter, 1);\n    }\n\n    void recurse(ValueType* lo, ValueType* hi, unsigned int treeidx) {\n\n        \/\/ pick middle element as splitter\n        ValueType* mid = lo + (ssize_t)(hi - lo) \/ 2;\n        tree_[treeidx] = *mid;\n\n        ValueType* midlo = mid, * midhi = mid + 1;\n\n        if (2 * treeidx < ssplitter)\n        {\n            recurse(lo, midlo, 2 * treeidx + 0);\n            recurse(midhi, hi, 2 * treeidx + 1);\n        }\n    }\n};\n\ntemplate <class T1, typename CompareFunction>\nstruct BucketEmitter\n{\n    static bool Equal(CompareFunction compare_function, const T1& ele1, const T1& ele2) {\n        return !(compare_function(ele1, ele2) || compare_function(ele2, ele1));\n    }\n\n        static size_t RoundDown(size_t ele, size_t by) {\n                return ((ele) & ~((by) - 1));\n        }\n\n    static void emitToBuckets(\n        const T1* const a,\n        const size_t n,\n        const T1* const treearr, \/\/ Tree. sizeof |splitter|\n        size_t k,                \/\/ Number of buckets\n        size_t logK,\n        std::vector<data::BlockWriter>& emitters,\n        size_t actual_k,\n        CompareFunction compare_function,\n        const T1* const sorted_splitters,\n        size_t prefix_elem,\n        size_t total_elem) {\n\n        const size_t stepsize = 2;\n\n        size_t i = 0;\n        for ( ; i < RoundDown(n, stepsize); i += stepsize)\n        {\n\n            size_t j0 = 1;\n            const T1& el0 = a[i];\n            size_t j1 = 1;\n            const T1& el1 = a[i + 1];\n\n            for (size_t l = 0; l < logK; l++)\n            {\n\n                j0 = j0 * 2 + !(compare_function(el0, treearr[j0]));\n                j1 = j1 * 2 + !(compare_function(el1, treearr[j1]));\n            }\n\n            size_t b0 = j0 - k;\n            size_t b1 = j1 - k;\n\n            \/\/TODO(an): Remove this ugly workaround as soon as emitters are movable.\n            \/\/Move emitter[actual_k] to emitter[splitter_count] before calling this.\n            if (b0 >= actual_k) {\n                b0 = actual_k - 1;\n            }\n\n            while (b0 && Equal(compare_function, el0, sorted_splitters[b0 - 1])\n                   && (prefix_elem + i) * actual_k > b0 * total_elem) {\n                b0--;\n            }\n            emitters[b0](el0);\n            if (b1 >= actual_k) {\n                b1 = actual_k - 1;\n            }\n            while (b1 && Equal(compare_function, el1, sorted_splitters[b1 - 1])\n                   && (prefix_elem + i + 1) * actual_k > b1 * total_elem) {\n                b1--;\n            }\n            emitters[b1](el1);\n        }\n        for ( ; i < n; i++)\n        {\n\n            size_t j = 1;\n            for (size_t l = 0; l < logK; l++)\n            {\n                j = j * 2 + !(compare_function(a[i], treearr[j]));\n            }\n            size_t b = j - k;\n\n            if (b >= actual_k) {\n                b = actual_k - 1;\n            }\n            while (b && Equal(compare_function, a[i], sorted_splitters[b - 1])\n                   && (prefix_elem + i) * actual_k > b * total_elem) {\n                b--;\n            }\n            emitters[b](a[i]);\n        }\n    }\n};\n\n} \/\/ namespace sort_local\n\n\/*!\n * A DIANode which performs a Sort operation. Sort sorts a DIA according to a given\n * compare function\n *\n * \\tparam ValueType Type of DIA elements\n * \\tparam Stack Function stack, which contains the chained lambdas between the last and this DIANode.\n * \\tparam CompareFunction Type of the compare function\n *\/\ntemplate <typename ValueType, typename ParentStack, typename CompareFunction>\nclass SortNode : public DOpNode<ValueType>\n{\n    static const bool debug = false;\n\n    using Super = DOpNode<ValueType>;\n    using Super::context_;\n    using Super::result_file_;\n\n    using ParentInput = typename ParentStack::Input;\n\npublic:\n    \/*!\n     * Constructor for a sort node.\n     *\n     * \\param ctx Context for this operation\n     * \\param parent Previous DIANode in the computation chain\n     * \\param parent_stack Stack of lambda functions between parent and this node\n     * \\param compare_function Function comparing two elements.\n     *\/\n    SortNode(Context& ctx,\n             std::shared_ptr<DIANode<ParentInput> > parent,\n             const ParentStack& parent_stack,\n             CompareFunction compare_function)\n        : DOpNode<ValueType>(ctx, { parent }, \"Sort\"),\n          compare_function_(compare_function),\n          channel_id_samples_(ctx.data_manager().GetNewChannel()),\n          emitters_samples_(channel_id_samples_->OpenWriters()),\n          channel_id_data_(ctx.data_manager().GetNewChannel()),\n          emitters_data_(channel_id_data_->OpenWriters()),\n          parent_(parent)\n    {\n        \/\/ Hook PreOp(s)\n        auto pre_op_fn = [ = ](const ValueType& input) {\n                             PreOp(input);\n                         };\n\n        lop_chain_ = parent_stack.push(pre_op_fn).emit();\n\n        parent_->RegisterChild(lop_chain_);\n    }\n\n    virtual ~SortNode() {\n        parent_->UnregisterChild(lop_chain_);\n    }\n\n    \/\/! Executes the sum operation.\n    void Execute() override {\n        this->StartExecutionTimer();\n        MainOp();\n        this->StopExecutionTimer();\n    }\n\n    \/*!\n     * Produces an 'empty' function stack, which only contains the identity\n     * emitter function.\n     *\n     * \\return Empty function stack\n     *\/\n    auto ProduceStack() {\n        \/\/ Hook Identity\n        auto id_fn = [ = ](ValueType t, auto emit_func) {\n                         return emit_func(t);\n                     };\n\n        return MakeFunctionStack<ValueType>(id_fn);\n    }\n\n    \/*!\n     * Returns \"[SortNode]\" as a string.\n     * \\return \"[SortNode]\"\n     *\/\n    std::string ToString() override {\n        return \"[SortNode] Id:\" + result_file_.ToString();\n    }\n\nprivate:\n    \/\/! The sum function which is applied to two elements.\n    CompareFunction compare_function_;\n    \/\/! Local data\n    std::vector<ValueType> data_;\n\n    \/\/!Emitter to send samples to process 0\n    data::ChannelPtr channel_id_samples_;\n    std::vector<data::BlockWriter> emitters_samples_;\n\n    \/\/!Emitters to send data to other workers specified by splitters.\n    data::ChannelPtr channel_id_data_;\n    std::vector<data::BlockWriter> emitters_data_;\n\n    \/\/epsilon\n    double desired_imbalance = 0.25;\n\n    std::shared_ptr<DIANode<ParentInput>> parent_;\n    common::delegate<void(ParentInput)> lop_chain_;\n\n    void PreOp(ValueType input) {\n        data_.push_back(input);\n    }\n\n    void FindAndSendSplitters(std::vector<ValueType>& splitters) {\n        \/\/Get samples from other workers\n        size_t num_workers = context_.number_worker();\n        size_t samplesize = std::ceil(log2((double)data_.size()) *\n                                      (1 \/ (desired_imbalance *\n                                            desired_imbalance)));\n\n        std::vector<ValueType> samples;\n        samples.reserve(samplesize * num_workers);\n        auto reader = channel_id_samples_->OpenReader();\n\n        while (reader.HasNext()) {\n            samples.push_back(reader.template Next<ValueType>());\n        }\n\n        \/\/Find splitters\n        std::sort(samples.begin(), samples.end(), compare_function_);\n\n        size_t splitting_size = samples.size() \/ num_workers;\n\n        \/\/Send splitters to other workers\n        for (size_t i = 1; i < num_workers; i++) {\n            splitters.push_back(samples[i * splitting_size]);\n            for (size_t j = 1; j < num_workers; j++) {\n                emitters_samples_[j](samples[i * splitting_size]);\n            }\n        }\n\n        for (size_t j = 1; j < num_workers; j++) {\n            emitters_samples_[j].Close();\n        }\n    }\n\n    void MainOp() {\n        net::FlowControlChannel& channel = context_.flow_control_channel();\n\n        size_t prefix_elem = channel.PrefixSum(data_.size());\n        size_t total_elem = channel.AllReduce(data_.size());\n\n        size_t num_workers = context_.number_worker();\n        size_t samplesize = std::ceil(log2((double)total_elem) *\n                                      (1 \/ (desired_imbalance * desired_imbalance)));\n\n        LOG << prefix_elem << \" elements, out of \" << total_elem;\n\n        std::random_device random_device;\n        std::default_random_engine generator(random_device());\n        std::uniform_int_distribution<int> distribution(0, data_.size() - 1);\n\n        \/\/Send samples to worker 0\n        for (size_t i = 0; i < samplesize; i++) {\n            size_t sample = distribution(generator);\n            emitters_samples_[0](data_[sample]);\n        }\n        emitters_samples_[0].Close();\n\n        \/\/Get the ceiling of log(num_workers), as SSSS needs 2^n buckets.\n        double log_workers = std::log2(num_workers);\n        const bool powof2 = (std::ceil(log_workers) - log_workers) < 0.0000001;\n        size_t ceil_log = std::ceil(log_workers);\n        size_t workers_algo = 1 << ceil_log;\n        size_t splitter_count_algo = workers_algo - 1;\n\n        std::vector<ValueType> splitters;\n        splitters.reserve(workers_algo);\n\n        if (context_.rank() == 0) {\n            FindAndSendSplitters(splitters);\n        }\n        else {\n            \/\/Close unused emitters\n            for (size_t j = 1; j < num_workers; j++) {\n                emitters_samples_[j].Close();\n            }\n            auto reader = channel_id_samples_->OpenReader();\n            while (reader.HasNext()) {\n                splitters.push_back(reader.template Next<ValueType>());\n            }\n        }\n\n        \/\/code from SS2NPartition, slightly altered\n\n        ValueType* splitter_tree = new ValueType[workers_algo + 1];\n\n        if (!powof2) {\n            for (size_t i = num_workers; i < workers_algo; i++) {\n                splitters.push_back(splitters.back());\n            }\n        }\n\n        sort_local::TreeBuilder<ValueType>(splitter_tree,\n                                     splitters.data(),\n                                     splitter_count_algo);\n\n        sort_local::BucketEmitter<ValueType, CompareFunction>::emitToBuckets(\n            data_.data(),\n            data_.size(),\n            splitter_tree, \/\/ Tree. sizeof |splitter|\n            workers_algo,  \/\/ Number of buckets\n            ceil_log,\n            emitters_data_,\n            num_workers,\n            compare_function_,\n            splitters.data(),\n            prefix_elem,\n            total_elem);\n\n        \/\/end of SS2N\n\n        for (size_t i = 0; i < emitters_data_.size(); i++) {\n            emitters_data_[i].Close();\n        }\n\n        data_.clear();\n\n        auto reader = channel_id_data_->OpenReader();\n\n        while (reader.HasNext()) {\n            data_.push_back(reader.template Next<ValueType>());\n        }\n\n                LOG << \"node \" << context_.rank() << \" : \" << data_.size();\n\n        std::sort(data_.begin(), data_.end(), compare_function_);\n\n        for (size_t i = 0; i < data_.size(); i++) {\n            for (auto func : DIANode<ValueType>::callbacks_) {\n                func(data_[i]);\n            }\n        }\n        std::vector<ValueType>().swap(data_);\n    }\n\n    void PostOp() { }\n};\n\ntemplate <typename ValueType, typename Stack>\ntemplate <typename CompareFunction>\nauto DIARef<ValueType, Stack>::Sort(const CompareFunction &compare_function) const {\n\n    using SortResultNode\n              = SortNode<ValueType, Stack, CompareFunction>;\n\n    static_assert(\n        std::is_same<\n            typename common::FunctionTraits<CompareFunction>::template arg<0>,\n            ValueType>::value ||\n        std::is_same<CompareFunction, std::less<ValueType> >::value,\n        \"CompareFunction has the wrong input type\");\n\n    static_assert(\n        std::is_same<\n            typename common::FunctionTraits<CompareFunction>::template arg<1>,\n            ValueType>::value ||\n        std::is_same<CompareFunction, std::less<ValueType> >::value,\n        \"CompareFunction has the wrong input type\");\n\n    static_assert(\n        std::is_same<\n            typename common::FunctionTraits<CompareFunction>::result_type,\n            bool>::value ||\n        std::is_same<CompareFunction, std::less<ValueType> >::value,\n        \"CompareFunction has the wrong output type (should be bool)\");\n\n    auto shared_node\n        = std::make_shared<SortResultNode>(node_->context(),\n                                           node_,\n                                           stack_,\n                                           compare_function);\n\n    auto sort_stack = shared_node->ProduceStack();\n\n    return DIARef<ValueType, decltype(sort_stack)>(\n        std::move(shared_node), sort_stack);\n}\n\n\/\/! \\}\n} \/\/ namespace api\n} \/\/ namespace c7a\n\n#endif \/\/ !C7A_API_SORT_HEADER\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 \"parser.h\"\n\n#include \"engine.h\"\n#include \"exception.h\"\n#include \"filter.h\"\n#include \"grantlee_version.h\"\n#include \"nodebuiltins_p.h\"\n#include \"taglibraryinterface.h\"\n#include \"template.h\"\n#include \"template_p.h\"\n\n#include <QtCore\/QFile>\n\nusing namespace Grantlee;\n\nnamespace Grantlee\n{\n\nclass ParserPrivate\n{\npublic:\n  ParserPrivate( Parser *parser, const QList<Token> &tokenList )\n      : q_ptr( parser ),\n      m_tokenList( tokenList ) {\n\n  }\n\n  NodeList extendNodeList( NodeList list, Node *node );\n\n  \/**\n    Parses the template to create a Nodelist.\n    The given @p parent is the parent of each node in the returned list.\n  *\/\n  NodeList parse( QObject *parent, const QStringList &stopAt = QStringList() );\n\n  void openLibrary( TagLibraryInterface * library );\n  Q_DECLARE_PUBLIC( Parser )\n  Parser * const q_ptr;\n\n  QList<Token> m_tokenList;\n\n  QHash<QString, AbstractNodeFactory*> m_nodeFactories;\n  QHash<QString, Filter::Ptr> m_filters;\n\n  NodeList m_nodeList;\n};\n\n}\n\nvoid ParserPrivate::openLibrary( TagLibraryInterface *library )\n{\n  Q_Q( Parser );\n  QHashIterator<QString, AbstractNodeFactory*> nodeIt( library->nodeFactories() );\n\n  TemplateImpl *ti = qobject_cast<TemplateImpl *>( q->parent() );\n\n  Engine const *cengine = ti->engine();\n  if ( !cengine )\n    return;\n  Engine *engine = const_cast<Engine *>( cengine );\n\n  while ( nodeIt.hasNext() ) {\n    nodeIt.next();\n    nodeIt.value()->setEngine( engine );\n    m_nodeFactories.insert( nodeIt.key(), nodeIt.value() );\n  }\n  QHashIterator<QString, Filter*> filterIt( library->filters() );\n  while ( filterIt.hasNext() ) {\n    filterIt.next();\n    Filter::Ptr f = Filter::Ptr( filterIt.value() );\n    m_filters.insert( filterIt.key(), f );\n  }\n}\n\nParser::Parser( const QList<Token> &tokenList, QObject *parent )\n    : QObject( parent ), d_ptr( new ParserPrivate( this, tokenList ) )\n{\n  Q_D( Parser );\n\n  TemplateImpl *ti = qobject_cast<TemplateImpl *>( parent );\n\n  Engine const *cengine = ti->engine();\n  if ( !cengine )\n    return;\n  Engine *engine = const_cast<Engine *>( cengine );\n  engine->loadDefaultLibraries();\n  Q_FOREACH( const QString &libraryName, engine->defaultLibraries() ) {\n    TagLibraryInterface *library = engine->loadLibrary( libraryName );\n    if ( !library )\n      continue;\n    d->openLibrary( library );\n  }\n}\n\nParser::~Parser()\n{\n  \/\/ Don't delete filters here because filters must out-live the parser in the\n  \/\/ filter expressions.\n  qDeleteAll( d_ptr->m_nodeFactories );\n  delete d_ptr;\n}\n\n\nvoid Parser::setTokens( const QList< Token >& tokenList )\n{\n  Q_D( Parser );\n  d->m_tokenList = tokenList;\n}\n\n\nvoid Parser::loadLib( const QString &name )\n{\n  Q_D( Parser );\n  TemplateImpl *ti = qobject_cast<TemplateImpl *>( parent() );\n  Engine const *cengine = ti->engine();\n  if ( !cengine )\n    return;\n  Engine *engine = const_cast<Engine *>( cengine );\n  TagLibraryInterface *library = engine->loadLibrary( name );\n  if ( !library )\n    return;\n  d->openLibrary( library );\n}\n\nNodeList ParserPrivate::extendNodeList( NodeList list, Node *node )\n{\n  if ( node->mustBeFirst() && list.containsNonText() ) {\n    throw Grantlee::Exception( TagSyntaxError, QString::fromLatin1(\n        \"Node appeared twice in template: %1\" ).arg( QLatin1String( node->metaObject()->className() ) ) );\n  }\n\n  list.append( node );\n  return list;\n}\n\nvoid Parser::skipPast( const QString &tag )\n{\n  while ( hasNextToken() ) {\n    const Token token = takeNextToken();\n    if ( token.tokenType == BlockToken && token.content.trimmed() == tag )\n      return;\n  }\n  throw Grantlee::Exception( UnclosedBlockTagError, QString::fromLatin1( \"No closing tag found for %1\" ).arg( tag ) );\n}\n\nFilter::Ptr Parser::getFilter( const QString &name ) const\n{\n  Q_D( const Parser );\n  if ( !d->m_filters.contains( name ) )\n    throw Grantlee::Exception( UnknownFilterError, QString::fromLatin1( \"Unknown filter: %1\" ).arg( name ) );\n  return d->m_filters.value( name );\n}\n\nNodeList Parser::parse( Node *parent, const QString &stopAt )\n{\n  Q_D( Parser );\n  return d->parse( parent, QStringList() << stopAt );\n}\n\nNodeList Parser::parse( TemplateImpl *parent, const QStringList &stopAt )\n{\n  Q_D( Parser );\n  return d->parse( parent, stopAt );\n}\n\nNodeList Parser::parse( Node *parent, const QStringList &stopAt )\n{\n  Q_D( Parser );\n  return d->parse( parent, stopAt );\n}\n\nNodeList ParserPrivate::parse( QObject *parent, const QStringList &stopAt )\n{\n  Q_Q( Parser );\n  NodeList nodeList;\n\n  while ( q->hasNextToken() ) {\n    const Token token = q->takeNextToken();\n    if ( token.tokenType == TextToken ) {\n      nodeList = extendNodeList( nodeList, new TextNode( token.content, parent ) );\n    } else if ( token.tokenType == VariableToken ) {\n      if ( token.content.isEmpty() ) {\n        \/\/ Error. Empty variable\n        QString message;\n        message = QString::fromLatin1( \"Empty variable before \\\"%1\\\", line %2, %3\" ).arg( q->takeNextToken().content.left( 20 ) ).arg( token.linenumber ).arg( q->parent()->objectName() );\n        throw Grantlee::Exception( EmptyVariableError, message );\n      }\n\n      FilterExpression filterExpression;\n      try {\n        filterExpression = FilterExpression( token.content, q );\n      } catch ( Grantlee::Exception e ) {\n        throw Grantlee::Exception( e.errorCode(), QString::fromLatin1( \"%1, line %2, %3\" ).arg( e.what() )\n                                                                              .arg( token.linenumber )\n                                                                              .arg( q->parent()->objectName() ) );\n      }\n\n      nodeList = extendNodeList( nodeList, new VariableNode( filterExpression, parent ) );\n    } else {\n      Q_ASSERT( token.tokenType == BlockToken );\n      if ( stopAt.contains( token.content ) ) {\n        \/\/ put the token back.\n        q->prependToken( token );\n        return nodeList;\n      }\n\n      const QStringList tagContents = token.content.split( QLatin1Char( ' ' ) );\n      if ( tagContents.size() == 0 ) {\n        QString message;\n        if ( q->hasNextToken() )\n          message = QString::fromLatin1( \"Empty block tag before \\\"%1\\\", line %2, %3\" ).arg( token.content.left( 20 ) ).arg( token.linenumber ).arg( q->parent()->objectName() );\n        else\n          message = QLatin1String( \"Empty block tag at end of input.\" );\n\n        throw Grantlee::Exception( EmptyBlockTagError, message );\n      }\n      const QString command = tagContents.first();\n      AbstractNodeFactory *nodeFactory = m_nodeFactories[command];\n\n      \/\/ unknown tag.\n      if ( !nodeFactory ) {\n        throw Grantlee::Exception( InvalidBlockTagError, QString::fromLatin1( \"Unknown tag: \\\"%1\\\", line %2, %3\" ).arg( command ).arg( token.linenumber ).arg( q->parent()->objectName() ) );\n      }\n\n      \/\/ TODO: Make getNode take a Token instead?\n      Node *n;\n      try {\n        n = nodeFactory->getNode( token.content, q );\n      } catch ( Grantlee::Exception e ) {\n        throw Grantlee::Exception( e.errorCode(), QString::fromLatin1( \"%1, line %2, %3\" ).arg( e.what() )\n                                                                              .arg( token.linenumber )\n                                                                              .arg( q->parent()->objectName() ) );\n      }\n      if ( !n ) {\n        throw Grantlee::Exception( EmptyBlockTagError, QString::fromLatin1( \"Failed to get node from %1, line %2, %3\" ).arg( command ).arg( token.linenumber ).arg( q->parent()->objectName() ) );\n      }\n\n      n->setParent( parent );\n\n      nodeList = extendNodeList( nodeList, n );\n    }\n  }\n\n  if ( !stopAt.isEmpty() ) {\n    const QString message = QString::fromLatin1( \"Unclosed tag in template %1. Expected one of: (%2)\" ).arg( q->parent()->objectName() ).arg( stopAt.join( QChar::fromLatin1( ' ' ) ) );\n    throw Grantlee::Exception( UnclosedBlockTagError, message );\n  }\n\n  return nodeList;\n\n}\n\nbool Parser::hasNextToken() const\n{\n  Q_D( const Parser );\n  return !d->m_tokenList.isEmpty();\n}\n\nToken Parser::takeNextToken()\n{\n  Q_D( Parser );\n  return d->m_tokenList.takeFirst();\n}\n\nvoid Parser::removeNextToken()\n{\n  Q_D( Parser );\n  if ( !d->m_tokenList.isEmpty() )\n    d->m_tokenList.removeFirst();;\n}\n\nvoid Parser::prependToken( const Token &token )\n{\n  Q_D( Parser );\n  d->m_tokenList.prepend( token );\n}\n\n#include \"parser.moc\"\n\n<commit_msg>Remove dead code. The parser must be a child of the engine.<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 \"parser.h\"\n\n#include \"engine.h\"\n#include \"exception.h\"\n#include \"filter.h\"\n#include \"grantlee_version.h\"\n#include \"nodebuiltins_p.h\"\n#include \"taglibraryinterface.h\"\n#include \"template.h\"\n#include \"template_p.h\"\n\n#include <QtCore\/QFile>\n\nusing namespace Grantlee;\n\nnamespace Grantlee\n{\n\nclass ParserPrivate\n{\npublic:\n  ParserPrivate( Parser *parser, const QList<Token> &tokenList )\n      : q_ptr( parser ),\n      m_tokenList( tokenList ) {\n\n  }\n\n  NodeList extendNodeList( NodeList list, Node *node );\n\n  \/**\n    Parses the template to create a Nodelist.\n    The given @p parent is the parent of each node in the returned list.\n  *\/\n  NodeList parse( QObject *parent, const QStringList &stopAt = QStringList() );\n\n  void openLibrary( TagLibraryInterface * library );\n  Q_DECLARE_PUBLIC( Parser )\n  Parser * const q_ptr;\n\n  QList<Token> m_tokenList;\n\n  QHash<QString, AbstractNodeFactory*> m_nodeFactories;\n  QHash<QString, Filter::Ptr> m_filters;\n\n  NodeList m_nodeList;\n};\n\n}\n\nvoid ParserPrivate::openLibrary( TagLibraryInterface *library )\n{\n  Q_Q( Parser );\n  QHashIterator<QString, AbstractNodeFactory*> nodeIt( library->nodeFactories() );\n\n  TemplateImpl *ti = qobject_cast<TemplateImpl *>( q->parent() );\n\n  Engine const *cengine = ti->engine();\n  Q_ASSERT( cengine );\n  Engine *engine = const_cast<Engine *>( cengine );\n\n  while ( nodeIt.hasNext() ) {\n    nodeIt.next();\n    nodeIt.value()->setEngine( engine );\n    m_nodeFactories.insert( nodeIt.key(), nodeIt.value() );\n  }\n  QHashIterator<QString, Filter*> filterIt( library->filters() );\n  while ( filterIt.hasNext() ) {\n    filterIt.next();\n    Filter::Ptr f = Filter::Ptr( filterIt.value() );\n    m_filters.insert( filterIt.key(), f );\n  }\n}\n\nParser::Parser( const QList<Token> &tokenList, QObject *parent )\n    : QObject( parent ), d_ptr( new ParserPrivate( this, tokenList ) )\n{\n  Q_D( Parser );\n\n  TemplateImpl *ti = qobject_cast<TemplateImpl *>( parent );\n\n  Engine const *cengine = ti->engine();\n  Q_ASSERT( cengine );\n\n  Engine *engine = const_cast<Engine *>( cengine );\n  engine->loadDefaultLibraries();\n  Q_FOREACH( const QString &libraryName, engine->defaultLibraries() ) {\n    TagLibraryInterface *library = engine->loadLibrary( libraryName );\n    if ( !library )\n      continue;\n    d->openLibrary( library );\n  }\n}\n\nParser::~Parser()\n{\n  \/\/ Don't delete filters here because filters must out-live the parser in the\n  \/\/ filter expressions.\n  qDeleteAll( d_ptr->m_nodeFactories );\n  delete d_ptr;\n}\n\n\nvoid Parser::setTokens( const QList< Token >& tokenList )\n{\n  Q_D( Parser );\n  d->m_tokenList = tokenList;\n}\n\n\nvoid Parser::loadLib( const QString &name )\n{\n  Q_D( Parser );\n  TemplateImpl *ti = qobject_cast<TemplateImpl *>( parent() );\n  Engine const *cengine = ti->engine();\n  Q_ASSERT( cengine );\n  Engine *engine = const_cast<Engine *>( cengine );\n  TagLibraryInterface *library = engine->loadLibrary( name );\n  if ( !library )\n    return;\n  d->openLibrary( library );\n}\n\nNodeList ParserPrivate::extendNodeList( NodeList list, Node *node )\n{\n  if ( node->mustBeFirst() && list.containsNonText() ) {\n    throw Grantlee::Exception( TagSyntaxError, QString::fromLatin1(\n        \"Node appeared twice in template: %1\" ).arg( QLatin1String( node->metaObject()->className() ) ) );\n  }\n\n  list.append( node );\n  return list;\n}\n\nvoid Parser::skipPast( const QString &tag )\n{\n  while ( hasNextToken() ) {\n    const Token token = takeNextToken();\n    if ( token.tokenType == BlockToken && token.content.trimmed() == tag )\n      return;\n  }\n  throw Grantlee::Exception( UnclosedBlockTagError, QString::fromLatin1( \"No closing tag found for %1\" ).arg( tag ) );\n}\n\nFilter::Ptr Parser::getFilter( const QString &name ) const\n{\n  Q_D( const Parser );\n  if ( !d->m_filters.contains( name ) )\n    throw Grantlee::Exception( UnknownFilterError, QString::fromLatin1( \"Unknown filter: %1\" ).arg( name ) );\n  return d->m_filters.value( name );\n}\n\nNodeList Parser::parse( Node *parent, const QString &stopAt )\n{\n  Q_D( Parser );\n  return d->parse( parent, QStringList() << stopAt );\n}\n\nNodeList Parser::parse( TemplateImpl *parent, const QStringList &stopAt )\n{\n  Q_D( Parser );\n  return d->parse( parent, stopAt );\n}\n\nNodeList Parser::parse( Node *parent, const QStringList &stopAt )\n{\n  Q_D( Parser );\n  return d->parse( parent, stopAt );\n}\n\nNodeList ParserPrivate::parse( QObject *parent, const QStringList &stopAt )\n{\n  Q_Q( Parser );\n  NodeList nodeList;\n\n  while ( q->hasNextToken() ) {\n    const Token token = q->takeNextToken();\n    if ( token.tokenType == TextToken ) {\n      nodeList = extendNodeList( nodeList, new TextNode( token.content, parent ) );\n    } else if ( token.tokenType == VariableToken ) {\n      if ( token.content.isEmpty() ) {\n        \/\/ Error. Empty variable\n        QString message;\n        message = QString::fromLatin1( \"Empty variable before \\\"%1\\\", line %2, %3\" ).arg( q->takeNextToken().content.left( 20 ) ).arg( token.linenumber ).arg( q->parent()->objectName() );\n        throw Grantlee::Exception( EmptyVariableError, message );\n      }\n\n      FilterExpression filterExpression;\n      try {\n        filterExpression = FilterExpression( token.content, q );\n      } catch ( Grantlee::Exception e ) {\n        throw Grantlee::Exception( e.errorCode(), QString::fromLatin1( \"%1, line %2, %3\" ).arg( e.what() )\n                                                                              .arg( token.linenumber )\n                                                                              .arg( q->parent()->objectName() ) );\n      }\n\n      nodeList = extendNodeList( nodeList, new VariableNode( filterExpression, parent ) );\n    } else {\n      Q_ASSERT( token.tokenType == BlockToken );\n      if ( stopAt.contains( token.content ) ) {\n        \/\/ put the token back.\n        q->prependToken( token );\n        return nodeList;\n      }\n\n      const QStringList tagContents = token.content.split( QLatin1Char( ' ' ) );\n      if ( tagContents.size() == 0 ) {\n        QString message;\n        if ( q->hasNextToken() )\n          message = QString::fromLatin1( \"Empty block tag before \\\"%1\\\", line %2, %3\" ).arg( token.content.left( 20 ) ).arg( token.linenumber ).arg( q->parent()->objectName() );\n        else\n          message = QLatin1String( \"Empty block tag at end of input.\" );\n\n        throw Grantlee::Exception( EmptyBlockTagError, message );\n      }\n      const QString command = tagContents.first();\n      AbstractNodeFactory *nodeFactory = m_nodeFactories[command];\n\n      \/\/ unknown tag.\n      if ( !nodeFactory ) {\n        throw Grantlee::Exception( InvalidBlockTagError, QString::fromLatin1( \"Unknown tag: \\\"%1\\\", line %2, %3\" ).arg( command ).arg( token.linenumber ).arg( q->parent()->objectName() ) );\n      }\n\n      \/\/ TODO: Make getNode take a Token instead?\n      Node *n;\n      try {\n        n = nodeFactory->getNode( token.content, q );\n      } catch ( Grantlee::Exception e ) {\n        throw Grantlee::Exception( e.errorCode(), QString::fromLatin1( \"%1, line %2, %3\" ).arg( e.what() )\n                                                                              .arg( token.linenumber )\n                                                                              .arg( q->parent()->objectName() ) );\n      }\n      if ( !n ) {\n        throw Grantlee::Exception( EmptyBlockTagError, QString::fromLatin1( \"Failed to get node from %1, line %2, %3\" ).arg( command ).arg( token.linenumber ).arg( q->parent()->objectName() ) );\n      }\n\n      n->setParent( parent );\n\n      nodeList = extendNodeList( nodeList, n );\n    }\n  }\n\n  if ( !stopAt.isEmpty() ) {\n    const QString message = QString::fromLatin1( \"Unclosed tag in template %1. Expected one of: (%2)\" ).arg( q->parent()->objectName() ).arg( stopAt.join( QChar::fromLatin1( ' ' ) ) );\n    throw Grantlee::Exception( UnclosedBlockTagError, message );\n  }\n\n  return nodeList;\n\n}\n\nbool Parser::hasNextToken() const\n{\n  Q_D( const Parser );\n  return !d->m_tokenList.isEmpty();\n}\n\nToken Parser::takeNextToken()\n{\n  Q_D( Parser );\n  return d->m_tokenList.takeFirst();\n}\n\nvoid Parser::removeNextToken()\n{\n  Q_D( Parser );\n  if ( !d->m_tokenList.isEmpty() )\n    d->m_tokenList.removeFirst();;\n}\n\nvoid Parser::prependToken( const Token &token )\n{\n  Q_D( Parser );\n  d->m_tokenList.prepend( token );\n}\n\n#include \"parser.moc\"\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  calcPWP.cpp\n\/\/  \n\/\/\n\/\/  Created by Evan McCartney-Melstad on 1\/10\/15.\n\/\/\n\/\/\n\n#include \"calcPWP.h\"\n#include <iostream>\n#include <vector>\n#include <fstream>\n#include <thread>\n#include <string>\n\n\nint calcPWPfromBinaryFile (std::string binaryFile, unsigned long long int numLoci, const int numIndividuals, std::string outFile, int numThreads) {\n    \n    \/\/****MODIFY THIS TO ONLY READ IN N LOCI AT A TIME, INSTEAD OF USING THE ENTIRE FILE****\n    \n    std::cout << \"Number of threads: \" << numThreads << std::endl;\n    std::streampos size;\n    std::ifstream file (binaryFile, std::ios::in|std::ios::binary|std::ios::ate);\n    \/\/ifstream file (\"test500k.binary8bitunsigned\", ios::in|ios::binary|ios::ate);\n    if (file.is_open()) {\n        size = file.tellg(); \/\/ Just a variable that shows position of stream--at end since ios::ate, so it's the file size. PROBABLY WON'T WORK FOR FILES LARGER THAN ~ 2GB!\n        file.seekg (0, std::ios::beg); \/\/ Go back to the beginning of the file\n        \/\/file.read((char*)readCounts, size); \/\/ cast to a char* to give to file.read\n        \n        \/\/unsigned char* readCounts;\n        \/\/readCounts = new unsigned char[size];\n        std::vector<unsigned char> readCounts(size);\n        file.read((char*) &readCounts[0], size);\n        file.close();\n        \n        std::cout << \"the entire file content is in memory\" << std::endl;\n        std::cout << \"the total size of the file is \" << size << std::endl;\n        std::cout << \"the number of elements in the readCounts vector is: \" << readCounts.size() << std::endl; \/\/ Will give the total size bytes divided by the size of one element--so it gives the number of elements\n        \n        \/* We are going to split the loci between numThreads threads. Each thread will modify two multidimensional\n         vectors of the forms std::vector< std::vector<long double> > pwp(numIndividuals, std::vector<long double>(numIndividuals,0))    and   std::vector< std::vector<unsigned long long int> > weightings(numIndividuals, std::vector<unsigned long long int>(numIndividuals,0))\n         \n         First, we'll generate all of these vectors, which apparently in C++ needs to be constructed of a\n         vector of two-dimensional vectors...\n         *\/\n        std::vector<std::vector<std::vector<long double>>> pwpThreads(numThreads, std::vector<std::vector<long double>> (numIndividuals, std::vector<long double> (numIndividuals,0) ) ); \/\/pwpThreads[0] is the first 2D array for the first thread, etc...\n        std::vector<std::vector<std::vector<unsigned long long int>>> weightingsThreads(numThreads, std::vector<std::vector<unsigned long long int> > (numIndividuals, std::vector<unsigned long long int> (numIndividuals,0) ) );\n        \n        std::cout << \"Initialized the 3d vectors\" << std::endl;\n        \n        \/\/ Now we need to determine how many loci for each thread. If we want to use the entire binary file, instead of numLoci loci, then change this to lociPerThread = (size\/(numIndividuals*2))\/numThreads\n        \/\/unsigned long long int lociPerThread = numLoci \/ numThreads;\n        \n        \/\/unsigned long long int lociPerThread = (readCounts.size()-1)\/numThreads; \/\/ loci starts with 0, so need to subtract 1 from numLoci\n        unsigned long long int lociPerThread;\n        if (numLoci == 0) {\n            lociPerThread = (unsigned long long)(size\/(numIndividuals*2))\/(unsigned long long)numThreads;\n        } else {\n            lociPerThread = (unsigned long long)numLoci\/(unsigned long long)numThreads;\n        }\n        \n        \n        \n\n        std::cout << \"Initialized lociPerThread with \" << numLoci << std::endl;\n        \n        std::vector<std::thread> threadsVec;\n        for (int threadRunning = 0; threadRunning < numThreads; threadRunning++) {\n            std::cout << \"Got to the function call. Running thread # \" << threadRunning << std::endl;\n            unsigned long long int firstLocus = (unsigned long long int) threadRunning * lociPerThread;\n            unsigned long long int finishingLocus = ((unsigned long long int) threadRunning * lociPerThread) + lociPerThread - (unsigned long long)1.0;\n            std::cout << \"Set firstLocus to \" << firstLocus << \" and finishingLocus to \" << finishingLocus << std::endl;\n            \n            threadsVec.push_back(std::thread(calcPWPforRange, firstLocus, finishingLocus, numIndividuals, std::ref(readCounts), std::ref(pwpThreads[threadRunning]), std::ref(weightingsThreads[threadRunning])));\n        }\n        \n        \/\/ Wait on threads to finish\n        for (int i = 0; i < numThreads; ++i) {\n            threadsVec[i].join();\n            std::cout << \"Joined thread \" << i << std::endl;\n        }\n        std::cout << \"All threads completed running\" << std::endl;\n        \n        \n        \n        \/\/ Now aggregate the results of the threads and print final results\n        std::vector<std::vector<long double>> weightingsSum(numIndividuals, std::vector<long double>(numIndividuals,0));\n        std::vector<std::vector<long double>> pwpSum(numIndividuals, std::vector<long double>(numIndividuals,0));\n        \n        for (int tortoise = 0; tortoise < numIndividuals; tortoise++) {\n            for (int comparisonTortoise = 0; comparisonTortoise <= tortoise; comparisonTortoise++) {\n                for (int threadVector = 0; threadVector < numThreads; threadVector++) {\n                    weightingsSum[tortoise][comparisonTortoise] += weightingsThreads[threadVector][tortoise][comparisonTortoise];\n                    pwpSum[tortoise][comparisonTortoise] += pwpThreads[threadVector][tortoise][comparisonTortoise];\n                }\n            }\n        }\n        \n        \n        \n        std::cout << \"Finished summing the threads vectors\" << std::endl;\n        \n        \n        \/\/ Now print out the final output to the pairwise pi file:\n        std::ofstream pwpOUT (outFile);\n        int rowCounter = 0;\n        if (!pwpOUT) {\n            std::cerr << \"Crap, \" << outFile << \"didn't open!\" << std::endl;\n        } else {\n            for (int tortoise=0; tortoise < numIndividuals; tortoise++) {\n                for (int comparisonTortoise = 0; comparisonTortoise <= tortoise; comparisonTortoise++) {\n                    rowCounter++;\n                    \n                    \/\/std::cout << \"Made it past the beginning of the last end for loop\" << std::endl;\n                    \/\/std::cout << \"Tortoise numbers: \" << tortoise << \" and \" << comparisonTortoise << std::endl;\n                    if (weightingsSum[tortoise][comparisonTortoise] > 0) {\n                        \/\/std::cout << weightings[tortoise][comparisonTortoise] << std::endl;\n                        \/\/std::cout << pwp[tortoise][comparisonTortoise] \/ weightings[tortoise][comparisonTortoise] << std::endl;\n                        std::cout << std::fixed;\n                        std::cout << \"Weightings for tortoise \" << tortoise << \" and comparisonTortoise \" << comparisonTortoise << \" : \" << weightingsSum[tortoise][comparisonTortoise] << std::endl;\n                        std::cout << \"PWP for tortoise \" << tortoise << \" and comparisonTortoise \" << comparisonTortoise << \" : \" << pwpSum[tortoise][comparisonTortoise] << std::endl;\n                        std::cout << std::scientific;\n                        pwpOUT << pwpSum[tortoise][comparisonTortoise] \/ weightingsSum[tortoise][comparisonTortoise] << std::endl;\n                    } else {\n                        pwpOUT << \"NA\" << std::endl;\n                    }\n                }\n            }\n        }\n    } else std::cout << \"Unable to open file\";\n    \n    return 0;\n}\n\n\n\/\/int calcPWPforRange (unsigned long long startingLocus, unsigned long long endingLocus, int numIndividuals, const std::vector<BYTE>& mainReadCountVector, std::vector< std::vector<long double> > & threadPWP, std::vector< std::vector<long double> > & threadWeightings) {\nint calcPWPforRange (unsigned long long startingLocus, unsigned long long endingLocus, int numIndividuals, std::vector<unsigned char>& mainReadCountVector, std::vector<std::vector<long double>>& threadPWP, std::vector<std::vector<unsigned long long int>>& threadWeightings) {\n     \n     std::cout << \"Calculating PWP for the following locus range: \" << startingLocus << \" to \" << endingLocus << std::endl;\n     for( unsigned long long locus = startingLocus; locus < endingLocus; locus++) {\n     \/\/std::cout << \"Processing locus # \" << locus << std::endl;\n         if (locus % 100000 == 0) {\n             std::cout << locus << \" loci processed through calcPWPfromBinaryFile\" << std::endl;\n         }\n     \n         unsigned long long coverages[numIndividuals];\n         long double *majorAlleleFreqs = new long double[numIndividuals]; \/\/ This will hold the major allele frequencies for that locus for each tortoise\n        \n         for( int tortoise = 0; tortoise < numIndividuals; tortoise++ ) {\n             unsigned long long majorIndex = locus * (numIndividuals*2) + 2 * tortoise;\n             unsigned long long minorIndex = locus * (numIndividuals*2) + 2 * tortoise + 1;\n             \n             coverages[tortoise] = int(mainReadCountVector[majorIndex]) + int(mainReadCountVector[minorIndex]); \/\/ Hold the coverages for each locus\n             if ( coverages[tortoise] > 0 ) {\n                 \/\/std::cout << \"Made it to line 222 for locus \" << locus << std::endl;\n                 majorAlleleFreqs[tortoise] = (long double)mainReadCountVector[majorIndex] \/ (long double)coverages[tortoise]; \/\/ Not necessarily an int, but could be 0 or 1\n\n                 if (coverages[tortoise] > 1) {\n                     unsigned long long locusWeighting = (unsigned long long) (coverages[tortoise]*(coverages[tortoise]-1));\n                     threadWeightings[tortoise][tortoise] += (unsigned long long)locusWeighting; \/\/ This is an int--discrete number of reads\n     \n                     \/\/threadPWP[tortoise][tortoise] += (long double)(locusWeighting) * ((long double)2.0 * majorAlleleFreqs[tortoise] * ((long double)(coverages[tortoise]) - (long double)(mainReadCountVector[majorIndex]))) \/ (long double)((coverages[tortoise])-(long double)1.0);\n                     \n                     \/\/Cancel out the \"coverages[tortoise]-1\"\n                     \/\/threadPWP[tortoise][tortoise] += (long double)(coverages[tortoise]) * ((long double)2.0 * majorAlleleFreqs[tortoise] * ((long double)(coverages[tortoise]) - (long double)(mainReadCountVector[majorIndex])));\n                     threadPWP[tortoise][tortoise] += (long double)(locusWeighting) * ((long double)2.0 * majorAlleleFreqs[tortoise] * ((long double)(coverages[tortoise]) - (long double)(mainReadCountVector[majorIndex])) \/ (long double)((coverages[tortoise]-1)));\n                                          \n                     \/\/threadPWP[tortoise][tortoise] += locusWeighting*(2*majorAlleleFreqs[tortoise] * (coverages[tortoise]-majorReadCounts)) \/ (coverages[tortoise]-1)\n                 }\n     \n                 for( int comparisonTortoise = 0; comparisonTortoise < tortoise; comparisonTortoise++) {\n                     if (coverages[comparisonTortoise] > 0) {\n                         long double locusWeighting = (long double)coverages[tortoise] * (long double)(coverages[comparisonTortoise]-1.0);\n                         \n                         threadWeightings[tortoise][comparisonTortoise] += locusWeighting;\n                         \n                         threadPWP[tortoise][comparisonTortoise] += (long double)locusWeighting * (majorAlleleFreqs[tortoise] * ((long double)1.0-majorAlleleFreqs[comparisonTortoise]) + majorAlleleFreqs[comparisonTortoise] * ((long double)1.0-majorAlleleFreqs[tortoise]));\n                    }\n                }\n            }\n        }\n        delete[] majorAlleleFreqs; \/\/ Needed to avoid memory leaks\n    }\n    std::cout << \"Finished thread ending on locus \" << endingLocus << std::endl;\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<commit_msg>Minor changes<commit_after>\/\/\n\/\/  calcPWP.cpp\n\/\/  \n\/\/\n\/\/  Created by Evan McCartney-Melstad on 1\/10\/15.\n\/\/\n\/\/\n\n#include \"calcPWP.h\"\n#include <iostream>\n#include <vector>\n#include <fstream>\n#include <thread>\n#include <string>\n\n\nint calcPWPfromBinaryFile (std::string binaryFile, unsigned long long int numLoci, const int numIndividuals, std::string outFile, int numThreads) {\n    \n    \/\/****MODIFY THIS TO ONLY READ IN N LOCI AT A TIME, INSTEAD OF USING THE ENTIRE FILE****\n    \n    std::cout << \"Number of threads: \" << numThreads << std::endl;\n    std::streampos size;\n    std::ifstream file (binaryFile, std::ios::in|std::ios::binary|std::ios::ate);\n    \/\/ifstream file (\"test500k.binary8bitunsigned\", ios::in|ios::binary|ios::ate);\n    if (file.is_open()) {\n        size = file.tellg(); \/\/ Just a variable that shows position of stream--at end since ios::ate, so it's the file size. PROBABLY WON'T WORK FOR FILES LARGER THAN ~ 2GB!\n        file.seekg (0, std::ios::beg); \/\/ Go back to the beginning of the file\n        \/\/file.read((char*)readCounts, size); \/\/ cast to a char* to give to file.read\n        \n        \/\/unsigned char* readCounts;\n        \/\/readCounts = new unsigned char[size];\n        std::vector<unsigned char> readCounts(size);\n        file.read((char*) &readCounts[0], size);\n        file.close();\n        \n        std::cout << \"the entire file content is in memory\" << std::endl;\n        std::cout << \"the total size of the file is \" << size << std::endl;\n        std::cout << \"the number of elements in the readCounts vector is: \" << readCounts.size() << std::endl; \/\/ Will give the total size bytes divided by the size of one element--so it gives the number of elements\n        \n        \/* We are going to split the loci between numThreads threads. Each thread will modify two multidimensional\n         vectors of the forms std::vector< std::vector<long double> > pwp(numIndividuals, std::vector<long double>(numIndividuals,0))    and   std::vector< std::vector<unsigned long long int> > weightings(numIndividuals, std::vector<unsigned long long int>(numIndividuals,0))\n         \n         First, we'll generate all of these vectors, which apparently in C++ needs to be constructed of a\n         vector of two-dimensional vectors...\n         *\/\n        std::vector<std::vector<std::vector<long double>>> pwpThreads(numThreads, std::vector<std::vector<long double>> (numIndividuals, std::vector<long double> (numIndividuals,0) ) ); \/\/pwpThreads[0] is the first 2D array for the first thread, etc...\n        std::vector<std::vector<std::vector<unsigned long long int>>> weightingsThreads(numThreads, std::vector<std::vector<unsigned long long int> > (numIndividuals, std::vector<unsigned long long int> (numIndividuals,0) ) );\n        \n        std::cout << \"Initialized the 3d vectors\" << std::endl;\n        \n        \/\/ Now we need to determine how many loci for each thread. If we want to use the entire binary file, instead of numLoci loci, then change this to lociPerThread = (size\/(numIndividuals*2))\/numThreads\n        \/\/unsigned long long int lociPerThread = numLoci \/ numThreads;\n        \n        \/\/unsigned long long int lociPerThread = (readCounts.size()-1)\/numThreads; \/\/ loci starts with 0, so need to subtract 1 from numLoci\n        unsigned long long int lociPerThread;\n        if (numLoci == 0) {\n            lociPerThread = (unsigned long long)(size\/(numIndividuals*2))\/(unsigned long long)numThreads;\n        } else {\n            lociPerThread = (unsigned long long)numLoci\/(unsigned long long)numThreads;\n        }\n        \n        \n        \n\n        std::cout << \"Initialized lociPerThread with \" << numLoci << std::endl;\n        \n        std::vector<std::thread> threadsVec;\n        for (int threadRunning = 0; threadRunning < numThreads; threadRunning++) {\n            std::cout << \"Got to the function call. Running thread # \" << threadRunning << std::endl;\n            unsigned long long int firstLocus = (unsigned long long int) threadRunning * lociPerThread;\n            unsigned long long int finishingLocus = ((unsigned long long int) threadRunning * lociPerThread) + lociPerThread - (unsigned long long)1.0;\n            std::cout << \"Set firstLocus to \" << firstLocus << \" and finishingLocus to \" << finishingLocus << std::endl;\n            \n            threadsVec.push_back(std::thread(calcPWPforRange, firstLocus, finishingLocus, numIndividuals, std::ref(readCounts), std::ref(pwpThreads[threadRunning]), std::ref(weightingsThreads[threadRunning])));\n        }\n        \n        \/\/ Wait on threads to finish\n        for (int i = 0; i < numThreads; ++i) {\n            threadsVec[i].join();\n            std::cout << \"Joined thread \" << i << std::endl;\n        }\n        std::cout << \"All threads completed running\" << std::endl;\n        \n        \n        \n        \/\/ Now aggregate the results of the threads and print final results\n        std::vector<std::vector<long double>> weightingsSum(numIndividuals, std::vector<long double>(numIndividuals,0));\n        std::vector<std::vector<long double>> pwpSum(numIndividuals, std::vector<long double>(numIndividuals,0));\n        \n        for (int tortoise = 0; tortoise < numIndividuals; tortoise++) {\n            for (int comparisonTortoise = 0; comparisonTortoise <= tortoise; comparisonTortoise++) {\n                for (int threadVector = 0; threadVector < numThreads; threadVector++) {\n                    weightingsSum[tortoise][comparisonTortoise] += weightingsThreads[threadVector][tortoise][comparisonTortoise];\n                    pwpSum[tortoise][comparisonTortoise] += pwpThreads[threadVector][tortoise][comparisonTortoise];\n                }\n            }\n        }\n        \n        \n        \n        std::cout << \"Finished summing the threads vectors\" << std::endl;\n        \n        \n        \/\/ Now print out the final output to the pairwise pi file:\n        std::ofstream pwpOUT (outFile);\n        int rowCounter = 0;\n        if (!pwpOUT) {\n            std::cerr << \"Crap, \" << outFile << \"didn't open!\" << std::endl;\n        } else {\n            for (int tortoise=0; tortoise < numIndividuals; tortoise++) {\n                for (int comparisonTortoise = 0; comparisonTortoise <= tortoise; comparisonTortoise++) {\n                    rowCounter++;\n                    \n                    \/\/std::cout << \"Made it past the beginning of the last end for loop\" << std::endl;\n                    \/\/std::cout << \"Tortoise numbers: \" << tortoise << \" and \" << comparisonTortoise << std::endl;\n                    if (weightingsSum[tortoise][comparisonTortoise] > 0) {\n                        \/\/std::cout << weightings[tortoise][comparisonTortoise] << std::endl;\n                        \/\/std::cout << pwp[tortoise][comparisonTortoise] \/ weightings[tortoise][comparisonTortoise] << std::endl;\n                        std::cout << std::fixed;\n                        std::cout << \"Weightings for tortoise \" << tortoise << \" and comparisonTortoise \" << comparisonTortoise << \" : \" << weightingsSum[tortoise][comparisonTortoise] << std::endl;\n                        std::cout << \"PWP for tortoise \" << tortoise << \" and comparisonTortoise \" << comparisonTortoise << \" : \" << pwpSum[tortoise][comparisonTortoise] << std::endl;\n                        std::cout << std::scientific;\n                        pwpOUT << pwpSum[tortoise][comparisonTortoise] \/ weightingsSum[tortoise][comparisonTortoise] << std::endl;\n                    } else {\n                        pwpOUT << \"NA\" << std::endl;\n                    }\n                }\n            }\n        }\n    } else std::cout << \"Unable to open file\";\n    \n    return 0;\n}\n\n\n\/\/int calcPWPforRange (unsigned long long startingLocus, unsigned long long endingLocus, int numIndividuals, const std::vector<BYTE>& mainReadCountVector, std::vector< std::vector<long double> > & threadPWP, std::vector< std::vector<long double> > & threadWeightings) {\nint calcPWPforRange (unsigned long long startingLocus, unsigned long long endingLocus, int numIndividuals, std::vector<unsigned char>& mainReadCountVector, std::vector<std::vector<long double>>& threadPWP, std::vector<std::vector<unsigned long long int>>& threadWeightings) {\n     \n     std::cout << \"Calculating PWP for the following locus range: \" << startingLocus << \" to \" << endingLocus << std::endl;\n     for( unsigned long long locus = startingLocus; locus < endingLocus; locus++) {\n     \/\/std::cout << \"Processing locus # \" << locus << std::endl;\n         if (locus % 100000 == 0) {\n             std::cout << locus << \" loci processed through calcPWPfromBinaryFile\" << std::endl;\n         }\n     \n         unsigned long long coverages[numIndividuals];\n         long double *majorAlleleFreqs = new long double[numIndividuals]; \/\/ This will hold the major allele frequencies for that locus for each tortoise\n        \n         for( int tortoise = 0; tortoise < numIndividuals; tortoise++ ) {\n             unsigned long long majorIndex = locus * (numIndividuals*2) + 2 * tortoise;\n             unsigned long long minorIndex = locus * (numIndividuals*2) + 2 * tortoise + 1;\n             \n             coverages[tortoise] = int(mainReadCountVector[majorIndex]) + int(mainReadCountVector[minorIndex]); \/\/ Hold the coverages for each locus\n             if ( coverages[tortoise] > 0 ) {\n                 \/\/std::cout << \"Made it to line 222 for locus \" << locus << std::endl;\n                 majorAlleleFreqs[tortoise] = (long double)mainReadCountVector[majorIndex] \/ (long double)coverages[tortoise]; \/\/ Not necessarily an int, but could be 0 or 1\n\n                 if (coverages[tortoise] > 1) {\n                     unsigned long long locusWeighting = (unsigned long long) (coverages[tortoise]*(coverages[tortoise]-1));\n                     threadWeightings[tortoise][tortoise] += (unsigned long long)locusWeighting; \/\/ This is an int--discrete number of reads\n     \n                     \/\/threadPWP[tortoise][tortoise] += (long double)(locusWeighting) * ((long double)2.0 * majorAlleleFreqs[tortoise] * ((long double)(coverages[tortoise]) - (long double)(mainReadCountVector[majorIndex]))) \/ (long double)((coverages[tortoise])-(long double)1.0);\n                     \n                     \/\/Cancel out the \"coverages[tortoise]-1\"\n                     \/\/threadPWP[tortoise][tortoise] += (long double)(coverages[tortoise]) * ((long double)2.0 * majorAlleleFreqs[tortoise] * ((long double)(coverages[tortoise]) - (long double)(mainReadCountVector[majorIndex])));\n                     threadPWP[tortoise][tortoise] += (long double)(locusWeighting) * ((long double)2.0 * majorAlleleFreqs[tortoise] * ((long double)(coverages[tortoise]) - (long double)(mainReadCountVector[majorIndex])) \/ (long double)((coverages[tortoise]-1)));\n                     \n                     \/\/threadPWP[tortoise][tortoise] += locusWeighting*(2*majorAlleleFreqs[tortoise] * (coverages[tortoise]-majorReadCounts)) \/ (coverages[tortoise]-1)\n                 }\n     \n                 for( int comparisonTortoise = 0; comparisonTortoise < tortoise; comparisonTortoise++) {\n                     if (coverages[comparisonTortoise] > 0) {\n                         long double locusWeighting = (long double)coverages[tortoise] * (long double)(coverages[comparisonTortoise]);\n                         \n                         threadWeightings[tortoise][comparisonTortoise] += locusWeighting;\n                         \n                         threadPWP[tortoise][comparisonTortoise] += (long double)locusWeighting * (majorAlleleFreqs[tortoise] * ((long double)1.0-majorAlleleFreqs[comparisonTortoise]) + majorAlleleFreqs[comparisonTortoise] * ((long double)1.0-majorAlleleFreqs[tortoise]));\n                    }\n                }\n            }\n        }\n        delete[] majorAlleleFreqs; \/\/ Needed to avoid memory leaks\n    }\n    std::cout << \"Finished thread ending on locus \" << endingLocus << std::endl;\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _GUARD_CAST_HPP_\n#define _GUARD_CAST_HPP_\n\n#include <limits>\n\n#include \"bpmodule\/pragma.h\"\n#include \"bpmodule\/exception\/MathException.hpp\"\n#include \"bpmodule\/mangle\/Mangle.hpp\"\n\n\nnamespace bpmodule {\nnamespace math {\n\n\n\n\/*! Perform a safe cast between integer types or between floating point types\n *\n * Checks for overflows and underflows.\n *\n * Cannot be used to convert integer <-> floating point. Use round_cast instead.\n *\n * \\throw bpmodule::exception::MathException if there is a problem (overflow, underflow, etc)\n *\/\ntemplate<typename Target, typename Source>\nTarget numeric_cast(Source s)\n{\n    static_assert(  ( std::is_integral<Source>::value && std::is_integral<Target>::value) ||\n                    ( std::is_floating_point<Source>::value && std::is_floating_point<Target>::value),\n                    \"Attempting to perform integer <-> floating point conversion using numeric_cast. Consider round_cast\");\n\n\n    \/\/ check for overflow, underflow\n    if(s > std::numeric_limits<Source>::max())\n        throw exception::MathException(\"Error in numeric_cast\",\n                                       \"desc\", \"source value overflows target type\",\n                                       \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                       \"fpto\", mangle::DemangleCppType<Target>());\n\n    if(s < std::numeric_limits<Source>::lowest())\n        throw exception::MathException(\"Error in numeric_cast\",\n                                       \"desc\", \"source value underflows target type\",\n                                       \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                       \"fpto\", mangle::DemangleCppType<Target>());\n\n\n    \/\/ if both are integral types, checking for overflow\/underflow\n    \/\/ is all that's needed\n    if(std::is_integral<Source>::value && std::is_integral<Target>::value)\n        return static_cast<Target>(s);\n\n\n    \/\/ if both are floating point\n    \/\/ we have to check that the conversion is valid\n    \/\/ Hackish way, but convert to target and back, then compare\n    if(std::is_floating_point<Source>::value && std::is_floating_point<Target>::value)\n    {\n        \/\/ check for overflow and underflow\n        Target t = static_cast<Target>(s);\n        Source s2 = static_cast<Source>(t);\n\n        \/\/ ignore this warning -- we are doing it on purpose\n        PRAGMA_WARNING_PUSH\n        PRAGMA_WARNING_IGNORE_FP_EQUALITY\n        if(s == s2)\n            return t;\n        else\n            throw exception::MathException(\"Error in numeric_cast\",\n                                           \"desc\", \"Floating point conversion results in loss of precision\",\n                                           \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                           \"fpto\", mangle::DemangleCppType<Target>());\n        PRAGMA_WARNING_POP\n    }\n\n    throw std::logic_error(\"numeric_cast unhandled types\");\n}\n\n\n\n\/*! \\brief Convert between integer and floating point types, with rounding\n *\n * \\todo NYI\n *\/\ntemplate<typename Target, typename Source>\nTarget round_cast(Source s)\n{\n    static_assert(std::is_same<Source, Target>::value, \"TODO: round_cast between different types\");\n    return s;\n}\n\n\n\n\n} \/\/ close namespace math\n} \/\/ close namespace bpmodule\n\n\n#endif\n<commit_msg>Expand checking in math::numeric_cast<commit_after>#ifndef _GUARD_CAST_HPP_\n#define _GUARD_CAST_HPP_\n\n#include <limits>\n\n#include \"bpmodule\/pragma.h\"\n#include \"bpmodule\/exception\/MathException.hpp\"\n#include \"bpmodule\/mangle\/Mangle.hpp\"\n\n\nnamespace bpmodule {\nnamespace math {\n\n\n\n\/*! Perform a safe cast between integer types or between floating point types\n *\n * Checks for overflows and underflows, as well as loss of precision with floating\n * point conversions.\n *\n * Cannot be used to convert integer <-> floating point. Use round_cast instead.\n *\n * \\throw bpmodule::exception::MathException if there is a problem (overflow, underflow, etc)\n *\/\ntemplate<typename Target, typename Source>\nTarget numeric_cast(Source s)\n{\n    static_assert(  ( std::is_integral<Source>::value && std::is_integral<Target>::value) ||\n                    ( std::is_floating_point<Source>::value && std::is_floating_point<Target>::value),\n                    \"Attempting to perform integer <-> floating point conversion using numeric_cast. Consider round_cast\");\n\n    \/\/ no casting\n    if(std::is_same<Target, Source>::value)\n        return static_cast<Target>(s);  \/\/ cast to make compiler warnings go away\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ this is written with branching so that the limits checking isn't always done\n    \/\/ (ie, going from short->int should be pretty much optimized out)\n    \/\/\n    \/\/ Actually, most branching shown here should be optimized out at compile\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ for integers\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    if(std::is_integral<Source>::value && std::is_integral<Target>::value)\n    {\n        \/\/ both are signed or unsigned\n        if(std::is_signed<Source>::value == std::is_signed<Target>::value)\n        {\n            \/\/ going from smaller to larger type - ok\n            if(std::numeric_limits<Target>::digits >= std::numeric_limits<Source>::digits)\n                return static_cast<Target>(s);\n            else\n            {\n                \/\/ source is larger type than target. check limits\n                Source tmax = static_cast<Source>(std::numeric_limits<Target>::max());\n                Source tmin = static_cast<Source>(std::numeric_limits<Target>::lowest());\n                if(s > tmax)\n                    throw exception::MathException(\"Error in numeric_cast\",\n                                                   \"desc\", \"source value overflows target type\",\n                                                   \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                                   \"fpto\", mangle::DemangleCppType<Target>());\n                else if(s < tmin)\n                    throw exception::MathException(\"Error in numeric_cast\",\n                                                   \"desc\", \"source value underflows target type\",\n                                                   \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                                   \"fpto\", mangle::DemangleCppType<Target>());\n\n                else \/\/ safe!\n                    return static_cast<Target>(s);\n\n            }\n        }\n        else if(std::is_signed<Source>::value) \/\/ Source is signed, Target is unsigned\n        {\n            if(s < 0)\n                throw exception::MathException(\"Error in numeric_cast\",\n                                               \"desc\", \"source value underflows target type\",\n                                               \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                               \"fpto\", mangle::DemangleCppType<Target>());\n\n            \n            \/\/ going from smaller to larger type - ok (since s >= 0)\n            if(std::numeric_limits<Target>::digits >= std::numeric_limits<Source>::digits)\n                return static_cast<Target>(s);\n            else\n            {\n                \/\/ source is larger type than target. check other limit\n                \/\/ casting to Source type should be ok since sizeof(Source) > sizeof(Target)\n                Source tmax = static_cast<Source>(std::numeric_limits<Target>::max());\n                if(s > tmax)\n                    throw exception::MathException(\"Error in numeric_cast\",\n                                                   \"desc\", \"source value overflows target type\",\n                                                   \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                                   \"fpto\", mangle::DemangleCppType<Target>());\n\n                else \/\/ safe!\n                    return static_cast<Target>(s);\n\n            }\n        }\n        else  \/\/ Source is unsigned, target is signed\n        {\n            \/\/ going from smaller to larger type - ok\n            \/\/ (since numeric_limits::digits reports bits without sign bit)\n            if(std::numeric_limits<Target>::digits >= std::numeric_limits<Source>::digits)\n                return static_cast<Target>(s);\n            else\n            {\n                \/\/ source is larger type than target. check max limit\n                \/\/ casting to Source type should be ok since sizeof(Source) > sizeof(Target)\n                Source tmax = static_cast<Source>(std::numeric_limits<Target>::max());\n                if(s > tmax)\n                    throw exception::MathException(\"Error in numeric_cast\",\n                                                   \"desc\", \"source value overflows target type\",\n                                                   \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                                   \"fpto\", mangle::DemangleCppType<Target>());\n\n                else \/\/ safe!\n                    return static_cast<Target>(s);\n\n            }\n        }\n    }\n\n\n\n    \/\/ if both are floating point\n    \/\/ we have to check that the conversion is valid\n    else if(std::is_floating_point<Source>::value && std::is_floating_point<Target>::value)\n    {\n        \/\/ Hackish way, but convert to target and back, then compare\n        \/\/ check for overflow and underflow\n        Target t = static_cast<Target>(s);\n        Source s2 = static_cast<Source>(t);\n\n        \/\/ ignore this warning -- we are doing it on purpose\n        PRAGMA_WARNING_PUSH\n        PRAGMA_WARNING_IGNORE_FP_EQUALITY\n        if(s == s2)\n            return t;\n        else\n            throw exception::MathException(\"Error in numeric_cast\",\n                                           \"desc\", \"Floating point conversion results in loss of precision\",\n                                           \"fpfrom\", mangle::DemangleCppType<Source>(),\n                                           \"fpto\", mangle::DemangleCppType<Target>());\n        PRAGMA_WARNING_POP\n    }\n\n    else\n        throw std::logic_error(\"numeric_cast unhandled types\");\n}\n\n\n\n\/*! \\brief Convert between integer and floating point types, with rounding\n *\n * \\todo NYI\n *\/\ntemplate<typename Target, typename Source>\nTarget round_cast(Source s)\n{\n    static_assert(std::is_same<Source, Target>::value, \"TODO: round_cast between different types\");\n    return s;\n}\n\n\n\n\n} \/\/ close namespace math\n} \/\/ close namespace bpmodule\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KOrganizer.\n\n    Copyright (c) 1999 Preston Brown <pbrown@kde.org>\n    Copyright (c) 2000,2001 Cornelius Schumacher <schumacher@kde.org>\n    Copyright (C) 2003-2004 Reinhold Kainhofer <reinhold@kainhofer.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; 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 <qlistview.h>\n#include <qlayout.h>\n#include <qpopupmenu.h>\n#include <qcursor.h>\n\n#include <klocale.h>\n#include <kdebug.h>\n#include <kiconloader.h>\n#include <kglobal.h>\n\n#include <libkcal\/calendar.h>\n#include <libkcal\/incidenceformatter.h>\n\n#include \"koglobals.h\"\n#include \"koprefs.h\"\n#include \"koincidencetooltip.h\"\n#include \"koeventpopupmenu.h\"\n\n#include \"kolistview.h\"\n#include \"kolistview.moc\"\n\n\nKOListViewToolTip::KOListViewToolTip( QWidget* parent,\n                                      KListView* lv )\n  :QToolTip(parent)\n{\n  eventlist=lv;\n}\n\nvoid KOListViewToolTip::maybeTip( const QPoint & pos)\n{\n  QRect r;\n  QListViewItem *it = eventlist->itemAt(pos);\n  KOListViewItem *i = static_cast<KOListViewItem*>(it);\n\n  if( i && KOPrefs::instance()->mEnableToolTips ) {\n    \/* Calculate the rectangle. *\/\n    r=eventlist->itemRect( it );\n    \/* Show the tip *\/\n    QString tipText( IncidenceFormatter::toolTipString( i->data() ) );\n    if ( !tipText.isEmpty() ) {\n      tip(r, tipText);\n    }\n  }\n\n}\n\n\/**\n  This class provides the initialization of a KOListViewItem for calendar\n  components using the Incidence::Visitor.\n*\/\nclass KOListView::ListItemVisitor : public IncidenceBase::Visitor\n{\n  public:\n    ListItemVisitor( KOListViewItem *item ) : mItem( item ) {}\n    ~ListItemVisitor() {}\n\n    bool visit( Event * );\n    bool visit( Todo * );\n    bool visit( Journal * );\n\n  private:\n    KOListViewItem *mItem;\n};\n\nbool KOListView::ListItemVisitor::visit( Event *e )\n{\n  mItem->setText(0,e->summary());\n  if ( e->isAlarmEnabled() ) {\n    static const QPixmap alarmPxmp = KOGlobals::self()->smallIcon( \"bell\" );\n    mItem->setPixmap(1,alarmPxmp);\n    mItem->setSortKey(1,\"1\");\n  }\n  else\n    mItem->setSortKey(1,\"0\");\n\n  if ( e->doesRecur() ) {\n    static const QPixmap recurPxmp = KOGlobals::self()->smallIcon( \"recur\" );\n    mItem->setPixmap(2,recurPxmp);\n    mItem->setSortKey(2,\"1\");\n  }\n  else\n    mItem->setSortKey(2,\"0\");\n\n  static const QPixmap eventPxmp = KOGlobals::self()->smallIcon( \"appointment\" );\n  mItem->setPixmap(0, eventPxmp);\n\n  mItem->setText( 3,e->dtStartDateStr());\n  if (e->doesFloat()) mItem->setText(4, \"---\"); else mItem->setText( 4, e->dtStartTimeStr() );\n  mItem->setText( 5,e->dtEndDateStr());\n  if (e->doesFloat()) mItem->setText(6, \"---\"); else mItem->setText( 6, e->dtEndTimeStr() );\n  mItem->setText( 7,e->categoriesStr());\n\n  QString key = e->dtStart().toString(Qt::ISODate);\n  mItem->setSortKey(3,key);\n\n  key = e->dtEnd().toString(Qt::ISODate);\n  mItem->setSortKey(5,key);\n\n  return true;\n}\n\nbool KOListView::ListItemVisitor::visit(Todo *t)\n{\n  static const QPixmap todoPxmp = KOGlobals::self()->smallIcon( \"todo\" );\n  static const QPixmap todoDonePxmp = KOGlobals::self()->smallIcon( \"checkedbox\" );\n  mItem->setPixmap(0, t->isCompleted() ? todoDonePxmp : todoPxmp );\n  mItem->setText(0,t->summary());\n  if ( t->isAlarmEnabled() ) {\n    static const QPixmap alarmPxmp = KOGlobals::self()->smallIcon( \"bell\" );\n    mItem->setPixmap(1,alarmPxmp);\n    mItem->setSortKey(1, \"1\");\n  }\n  else\n    mItem->setSortKey(1, \"0\");\n\n  if ( t->doesRecur() ) {\n    static const QPixmap recurPxmp = KOGlobals::self()->smallIcon( \"recur\" );\n    mItem->setPixmap(2,recurPxmp);\n    mItem->setSortKey(2, \"1\");\n  }\n  else\n    mItem->setSortKey(2, \"0\");\n\n  if (t->hasStartDate()) {\n    mItem->setText(3,t->dtStartDateStr());\n    mItem->setSortKey(3,t->dtStart().toString(Qt::ISODate));\n    if (t->doesFloat()) {\n      mItem->setText(4,\"---\");\n    } else {\n      mItem->setText(4,t->dtStartTimeStr());\n    }\n  } else {\n    mItem->setText(3,\"---\");\n    mItem->setText(4,\"---\");\n  }\n\n  if (t->hasDueDate()) {\n    mItem->setText(5,t->dtDueDateStr());\n    if (t->doesFloat()) {\n      mItem->setText(6,\"---\");\n    } else {\n      mItem->setText(6,t->dtDueTimeStr());\n    }\n  } else {\n    mItem->setText(5,\"---\");\n    mItem->setText(6,\"---\");\n  }\n  mItem->setText(7,t->categoriesStr());\n\n  mItem->setSortKey(5,t->dtDue().toString(Qt::ISODate));\n\n  return true;\n}\n\nbool KOListView::ListItemVisitor::visit( Journal *t )\n{\n  static const QPixmap jrnalPxmp = KOGlobals::self()->smallIcon( \"journal\" );\n  mItem->setPixmap( 0, jrnalPxmp );\n  if ( t->summary().isEmpty() ) {\n    mItem->setText( 0, t->description().section( \"\\n\", 0, 0 ) );\n  } else {\n    mItem->setText( 0, t->summary() );\n  }\n  mItem->setText( 3, t->dtStartDateStr() );\n\n  mItem->setSortKey( 3, t->dtStart().toString( Qt::ISODate ) );\n\n  return true;\n}\n\nKOListView::KOListView( Calendar *calendar, QWidget *parent,\n                        const char *name)\n  : KOEventView(calendar, parent, name)\n{\n  mActiveItem = 0;\n\n  mListView = new KListView(this);\n  mListView->addColumn(i18n(\"Summary\"));\n  mListView->addColumn(i18n(\"Reminder\")); \/\/ alarm set?\n  mListView->addColumn(i18n(\"Recurs\")); \/\/ recurs?\n  mListView->addColumn(i18n(\"Start Date\"));\n  mListView->setColumnAlignment(3,AlignHCenter);\n  mListView->addColumn(i18n(\"Start Time\"));\n  mListView->setColumnAlignment(4,AlignHCenter);\n  mListView->addColumn(i18n(\"End Date\"));\n  mListView->setColumnAlignment(5,AlignHCenter);\n  mListView->addColumn(i18n(\"End Time\"));\n  mListView->setColumnAlignment(6,AlignHCenter);\n  mListView->addColumn(i18n(\"Categories\"));\n\n  QBoxLayout *layoutTop = new QVBoxLayout(this);\n  layoutTop->addWidget(mListView);\n\n  mPopupMenu = eventPopup();\n\/*\n  mPopupMenu->insertSeparator();\n  mPopupMenu->insertItem(i18n(\"Show Dates\"), this,\n                      SLOT(showDates()));\n  mPopupMenu->insertItem(i18n(\"Hide Dates\"), this,\n                      SLOT(hideDates()));\n*\/\n\n  QObject::connect( mListView, SIGNAL( doubleClicked( QListViewItem * ) ),\n                    SLOT( defaultItemAction( QListViewItem * ) ) );\n  QObject::connect( mListView, SIGNAL( returnPressed( QListViewItem * ) ),\n                    SLOT( defaultItemAction( QListViewItem * ) ) );\n  QObject::connect( mListView, SIGNAL( rightButtonClicked ( QListViewItem *,\n                                                            const QPoint &,\n                                                            int ) ),\n                    SLOT( popupMenu( QListViewItem *, const QPoint &, int ) ) );\n  QObject::connect( mListView, SIGNAL( selectionChanged() ),\n                    SLOT( processSelectionChange() ) );\n\n\/\/  setMinimumSize(100,100);\n  mListView->restoreLayout(KOGlobals::self()->config(),\"KOListView Layout\");\n\n  new KOListViewToolTip( mListView->viewport(), mListView );\n\n  mSelectedDates.append( QDate::currentDate() );\n}\n\nKOListView::~KOListView()\n{\n  delete mPopupMenu;\n}\n\nint KOListView::maxDatesHint()\n{\n  return 0;\n}\n\nint KOListView::currentDateCount()\n{\n  return mSelectedDates.count();\n}\n\nIncidence::List KOListView::selectedIncidences()\n{\n  Incidence::List eventList;\n\n  QListViewItem *item = mListView->selectedItem();\n  if (item) eventList.append(((KOListViewItem *)item)->data());\n\n  return eventList;\n}\n\nDateList KOListView::selectedDates()\n{\n  return mSelectedDates;\n}\n\nvoid KOListView::showDates(bool show)\n{\n  \/\/ Shouldn't we set it to a value greater 0? When showDates is called with\n  \/\/ show == true at first, then the columnwidths are set to zero.\n  static int oldColWidth1 = 0;\n  static int oldColWidth3 = 0;\n\n  if (!show) {\n    oldColWidth1 = mListView->columnWidth(1);\n    oldColWidth3 = mListView->columnWidth(3);\n    mListView->setColumnWidth(1, 0);\n    mListView->setColumnWidth(3, 0);\n  } else {\n    mListView->setColumnWidth(1, oldColWidth1);\n    mListView->setColumnWidth(3, oldColWidth3);\n  }\n  mListView->repaint();\n}\n\nvoid KOListView::showDates()\n{\n  showDates(true);\n}\n\nvoid KOListView::hideDates()\n{\n  showDates(false);\n}\n\nvoid KOListView::updateView()\n{\n  kdDebug(5850) << \"KOListView::updateView() does nothing\" << endl;\n}\n\nvoid KOListView::showDates(const QDate &start, const QDate &end)\n{\n  clear();\n\n  QDate date = start;\n  while( date <= end ) {\n    addIncidences( calendar()->incidences(date) );\n    mSelectedDates.append( date );\n    date = date.addDays( 1 );\n  }\n\n  emit incidenceSelected( 0 );\n}\n\nvoid KOListView::addIncidences( const Incidence::List &incidenceList )\n{\n  Incidence::List::ConstIterator it;\n  for( it = incidenceList.begin(); it != incidenceList.end(); ++it ) {\n    addIncidence( *it );\n  }\n}\n\nvoid KOListView::addIncidence(Incidence *incidence)\n{\n  if ( mUidDict.find( incidence->uid() ) ) return;\n\n  mUidDict.insert( incidence->uid(), incidence );\n\n  KOListViewItem *item = new KOListViewItem( incidence, mListView );\n  ListItemVisitor v(item);\n  if (incidence->accept(v)) return;\n  else delete item;\n}\n\nvoid KOListView::showIncidences( const Incidence::List &incidenceList )\n{\n  clear();\n\n  addIncidences( incidenceList );\n\n  \/\/ After new creation of list view no events are selected.\n  emit incidenceSelected( 0 );\n}\n\nvoid KOListView::changeIncidenceDisplay(Incidence *incidence, int action)\n{\n  KOListViewItem *item;\n  QDate f = mSelectedDates.first();\n  QDate l = mSelectedDates.last();\n\n  QDate date;\n  if ( incidence->type() == \"Todo\" )\n    date = static_cast<Todo *>(incidence)->dtDue().date();\n  else\n    date = incidence->dtStart().date();\n\n  switch(action) {\n    case KOGlobals::INCIDENCEADDED: {\n      if ( date >= f && date <= l )\n        addIncidence( incidence );\n      break;\n    }\n    case KOGlobals::INCIDENCEEDITED: {\n      item = getItemForIncidence(incidence);\n      if (item) {\n        delete item;\n        mUidDict.remove( incidence->uid() );\n      }\n      if ( date >= f && date <= l )\n        addIncidence( incidence );\n    }\n    break;\n    case KOGlobals::INCIDENCEDELETED: {\n      item = getItemForIncidence(incidence);\n      if (item)\n        delete item;\n      break;\n    }\n    default:\n      kdDebug(5850) << \"KOListView::changeIncidenceDisplay(): Illegal action \" << action << endl;\n  }\n}\n\nKOListViewItem *KOListView::getItemForIncidence(Incidence *incidence)\n{\n  KOListViewItem *item = (KOListViewItem *)mListView->firstChild();\n  while (item) {\n\/\/    kdDebug(5850) << \"Item \" << item->text(0) << \" found\" << endl;\n    if (item->data() == incidence) return item;\n    item = (KOListViewItem *)item->nextSibling();\n  }\n  return 0;\n}\n\nvoid KOListView::defaultItemAction(QListViewItem *i)\n{\n  KOListViewItem *item = static_cast<KOListViewItem *>( i );\n  if ( item ) defaultAction( item->data() );\n}\n\nvoid KOListView::popupMenu(QListViewItem *item,const QPoint &,int)\n{\n  mActiveItem = (KOListViewItem *)item;\n  if (mActiveItem) {\n    Incidence *incidence = mActiveItem->data();\n    \/\/ FIXME: For recurring incidences we don't know the date of this\n    \/\/ occurrence, there's no reference to it at all!\n    mPopupMenu->showIncidencePopup( incidence, QDate() );\n  }\n  else {\n    showNewEventPopup();\n  }\n}\n\nvoid KOListView::readSettings(KConfig *config)\n{\n  mListView->restoreLayout(config,\"KOListView Layout\");\n}\n\nvoid KOListView::writeSettings(KConfig *config)\n{\n  mListView->saveLayout(config,\"KOListView Layout\");\n}\n\nvoid KOListView::processSelectionChange()\n{\n  kdDebug(5850) << \"KOListView::processSelectionChange()\" << endl;\n\n  KOListViewItem *item =\n    static_cast<KOListViewItem *>( mListView->selectedItem() );\n\n  if ( !item ) {\n    emit incidenceSelected( 0 );\n  } else {\n    emit incidenceSelected( item->data() );\n  }\n}\n\nvoid KOListView::clearSelection()\n{\n  mListView->selectAll( false );\n}\n\nvoid KOListView::clear()\n{\n  mSelectedDates.clear();\n  mListView->clear();\n  mUidDict.clear();\n}\n<commit_msg>Backport of SVN commit 632254 by kainhofe:<commit_after>\/*\n    This file is part of KOrganizer.\n\n    Copyright (c) 1999 Preston Brown <pbrown@kde.org>\n    Copyright (c) 2000,2001 Cornelius Schumacher <schumacher@kde.org>\n    Copyright (C) 2003-2004 Reinhold Kainhofer <reinhold@kainhofer.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; 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 <qlistview.h>\n#include <qlayout.h>\n#include <qpopupmenu.h>\n#include <qcursor.h>\n\n#include <klocale.h>\n#include <kdebug.h>\n#include <kiconloader.h>\n#include <kglobal.h>\n\n#include <libkcal\/calendar.h>\n#include <libkcal\/incidenceformatter.h>\n\n#include \"koglobals.h\"\n#include \"koprefs.h\"\n#include \"koincidencetooltip.h\"\n#include \"koeventpopupmenu.h\"\n\n#include \"kolistview.h\"\n#include \"kolistview.moc\"\n\n\nKOListViewToolTip::KOListViewToolTip( QWidget* parent,\n                                      KListView* lv )\n  :QToolTip(parent)\n{\n  eventlist=lv;\n}\n\nvoid KOListViewToolTip::maybeTip( const QPoint & pos)\n{\n  QRect r;\n  QListViewItem *it = eventlist->itemAt(pos);\n  KOListViewItem *i = static_cast<KOListViewItem*>(it);\n\n  if( i && KOPrefs::instance()->mEnableToolTips ) {\n    \/* Calculate the rectangle. *\/\n    r=eventlist->itemRect( it );\n    \/* Show the tip *\/\n    QString tipText( IncidenceFormatter::toolTipString( i->data() ) );\n    if ( !tipText.isEmpty() ) {\n      tip(r, tipText);\n    }\n  }\n\n}\n\n\/**\n  This class provides the initialization of a KOListViewItem for calendar\n  components using the Incidence::Visitor.\n*\/\nclass KOListView::ListItemVisitor : public IncidenceBase::Visitor\n{\n  public:\n    ListItemVisitor( KOListViewItem *item ) : mItem( item ) {}\n    ~ListItemVisitor() {}\n\n    bool visit( Event * );\n    bool visit( Todo * );\n    bool visit( Journal * );\n\n  private:\n    KOListViewItem *mItem;\n};\n\nbool KOListView::ListItemVisitor::visit( Event *e )\n{\n  mItem->setText(0,e->summary());\n  if ( e->isAlarmEnabled() ) {\n    static const QPixmap alarmPxmp = KOGlobals::self()->smallIcon( \"bell\" );\n    mItem->setPixmap(1,alarmPxmp);\n    mItem->setSortKey(1,\"1\");\n  }\n  else\n    mItem->setSortKey(1,\"0\");\n\n  if ( e->doesRecur() ) {\n    static const QPixmap recurPxmp = KOGlobals::self()->smallIcon( \"recur\" );\n    mItem->setPixmap(2,recurPxmp);\n    mItem->setSortKey(2,\"1\");\n  }\n  else\n    mItem->setSortKey(2,\"0\");\n\n  static const QPixmap eventPxmp = KOGlobals::self()->smallIcon( \"appointment\" );\n  mItem->setPixmap(0, eventPxmp);\n\n  mItem->setText( 3,e->dtStartDateStr());\n  mItem->setSortKey( 3, e->dtStart().toString(Qt::ISODate));\n  if (e->doesFloat()) mItem->setText(4, \"---\"); else {\n    mItem->setText( 4, e->dtStartTimeStr() );\n    mItem->setSortKey( 4,e->dtStart().time().toString(Qt::ISODate));\n  }\n  mItem->setText( 5,e->dtEndDateStr());\n  mItem->setSortKey( 5, e->dtEnd().toString(Qt::ISODate));\n  if (e->doesFloat()) mItem->setText(6, \"---\"); else {\n    mItem->setText( 6, e->dtEndTimeStr() );\n    mItem->setSortKey( 6, e->dtEnd().time().toString(Qt::ISODate));\n  }\n  mItem->setText( 7,e->categoriesStr());\n\n  return true;\n}\n\nbool KOListView::ListItemVisitor::visit(Todo *t)\n{\n  static const QPixmap todoPxmp = KOGlobals::self()->smallIcon( \"todo\" );\n  static const QPixmap todoDonePxmp = KOGlobals::self()->smallIcon( \"checkedbox\" );\n  mItem->setPixmap(0, t->isCompleted() ? todoDonePxmp : todoPxmp );\n  mItem->setText(0,t->summary());\n  if ( t->isAlarmEnabled() ) {\n    static const QPixmap alarmPxmp = KOGlobals::self()->smallIcon( \"bell\" );\n    mItem->setPixmap(1,alarmPxmp);\n    mItem->setSortKey(1, \"1\");\n  }\n  else\n    mItem->setSortKey(1, \"0\");\n\n  if ( t->doesRecur() ) {\n    static const QPixmap recurPxmp = KOGlobals::self()->smallIcon( \"recur\" );\n    mItem->setPixmap(2,recurPxmp);\n    mItem->setSortKey(2, \"1\");\n  }\n  else\n    mItem->setSortKey(2, \"0\");\n\n  if (t->hasStartDate()) {\n    mItem->setText(3,t->dtStartDateStr());\n    mItem->setSortKey(3,t->dtStart().toString(Qt::ISODate));\n    if (t->doesFloat()) {\n      mItem->setText(4,\"---\");\n    } else {\n      mItem->setText(4,t->dtStartTimeStr());\n      mItem->setSortKey( 4, t->dtStart().time().toString(Qt::ISODate) );\n    }\n  } else {\n    mItem->setText(3,\"---\");\n    mItem->setText(4,\"---\");\n  }\n\n  if (t->hasDueDate()) {\n    mItem->setText(5,t->dtDueDateStr());\n    mItem->setSortKey( 5, t->dtDue().toString(Qt::ISODate) );\n    if (t->doesFloat()) {\n      mItem->setText(6,\"---\");\n    } else {\n      mItem->setText(6,t->dtDueTimeStr());\n      mItem->setSortKey( 6, t->dtDue().time().toString(Qt::ISODate) );\n    }\n  } else {\n    mItem->setText(5,\"---\");\n    mItem->setText(6,\"---\");\n  }\n  mItem->setText(7,t->categoriesStr());\n\n\n  return true;\n}\n\nbool KOListView::ListItemVisitor::visit( Journal *t )\n{\n  static const QPixmap jrnalPxmp = KOGlobals::self()->smallIcon( \"journal\" );\n  mItem->setPixmap( 0, jrnalPxmp );\n  if ( t->summary().isEmpty() ) {\n    mItem->setText( 0, t->description().section( \"\\n\", 0, 0 ) );\n  } else {\n    mItem->setText( 0, t->summary() );\n  }\n  mItem->setText( 3, t->dtStartDateStr() );\n  mItem->setSortKey( 3, t->dtStart().toString( Qt::ISODate ) );\n\n  return true;\n}\n\nKOListView::KOListView( Calendar *calendar, QWidget *parent,\n                        const char *name)\n  : KOEventView(calendar, parent, name)\n{\n  mActiveItem = 0;\n\n  mListView = new KListView(this);\n  mListView->addColumn(i18n(\"Summary\"));\n  mListView->addColumn(i18n(\"Reminder\")); \/\/ alarm set?\n  mListView->addColumn(i18n(\"Recurs\")); \/\/ recurs?\n  mListView->addColumn(i18n(\"Start Date\"));\n  mListView->setColumnAlignment(3,AlignHCenter);\n  mListView->addColumn(i18n(\"Start Time\"));\n  mListView->setColumnAlignment(4,AlignHCenter);\n  mListView->addColumn(i18n(\"End Date\"));\n  mListView->setColumnAlignment(5,AlignHCenter);\n  mListView->addColumn(i18n(\"End Time\"));\n  mListView->setColumnAlignment(6,AlignHCenter);\n  mListView->addColumn(i18n(\"Categories\"));\n\n  QBoxLayout *layoutTop = new QVBoxLayout(this);\n  layoutTop->addWidget(mListView);\n\n  mPopupMenu = eventPopup();\n\/*\n  mPopupMenu->insertSeparator();\n  mPopupMenu->insertItem(i18n(\"Show Dates\"), this,\n                      SLOT(showDates()));\n  mPopupMenu->insertItem(i18n(\"Hide Dates\"), this,\n                      SLOT(hideDates()));\n*\/\n\n  QObject::connect( mListView, SIGNAL( doubleClicked( QListViewItem * ) ),\n                    SLOT( defaultItemAction( QListViewItem * ) ) );\n  QObject::connect( mListView, SIGNAL( returnPressed( QListViewItem * ) ),\n                    SLOT( defaultItemAction( QListViewItem * ) ) );\n  QObject::connect( mListView, SIGNAL( rightButtonClicked ( QListViewItem *,\n                                                            const QPoint &,\n                                                            int ) ),\n                    SLOT( popupMenu( QListViewItem *, const QPoint &, int ) ) );\n  QObject::connect( mListView, SIGNAL( selectionChanged() ),\n                    SLOT( processSelectionChange() ) );\n\n\/\/  setMinimumSize(100,100);\n  mListView->restoreLayout(KOGlobals::self()->config(),\"KOListView Layout\");\n\n  new KOListViewToolTip( mListView->viewport(), mListView );\n\n  mSelectedDates.append( QDate::currentDate() );\n}\n\nKOListView::~KOListView()\n{\n  delete mPopupMenu;\n}\n\nint KOListView::maxDatesHint()\n{\n  return 0;\n}\n\nint KOListView::currentDateCount()\n{\n  return mSelectedDates.count();\n}\n\nIncidence::List KOListView::selectedIncidences()\n{\n  Incidence::List eventList;\n\n  QListViewItem *item = mListView->selectedItem();\n  if (item) eventList.append(((KOListViewItem *)item)->data());\n\n  return eventList;\n}\n\nDateList KOListView::selectedDates()\n{\n  return mSelectedDates;\n}\n\nvoid KOListView::showDates(bool show)\n{\n  \/\/ Shouldn't we set it to a value greater 0? When showDates is called with\n  \/\/ show == true at first, then the columnwidths are set to zero.\n  static int oldColWidth1 = 0;\n  static int oldColWidth3 = 0;\n\n  if (!show) {\n    oldColWidth1 = mListView->columnWidth(1);\n    oldColWidth3 = mListView->columnWidth(3);\n    mListView->setColumnWidth(1, 0);\n    mListView->setColumnWidth(3, 0);\n  } else {\n    mListView->setColumnWidth(1, oldColWidth1);\n    mListView->setColumnWidth(3, oldColWidth3);\n  }\n  mListView->repaint();\n}\n\nvoid KOListView::showDates()\n{\n  showDates(true);\n}\n\nvoid KOListView::hideDates()\n{\n  showDates(false);\n}\n\nvoid KOListView::updateView()\n{\n  kdDebug(5850) << \"KOListView::updateView() does nothing\" << endl;\n}\n\nvoid KOListView::showDates(const QDate &start, const QDate &end)\n{\n  clear();\n\n  QDate date = start;\n  while( date <= end ) {\n    addIncidences( calendar()->incidences(date) );\n    mSelectedDates.append( date );\n    date = date.addDays( 1 );\n  }\n\n  emit incidenceSelected( 0 );\n}\n\nvoid KOListView::addIncidences( const Incidence::List &incidenceList )\n{\n  Incidence::List::ConstIterator it;\n  for( it = incidenceList.begin(); it != incidenceList.end(); ++it ) {\n    addIncidence( *it );\n  }\n}\n\nvoid KOListView::addIncidence(Incidence *incidence)\n{\n  if ( mUidDict.find( incidence->uid() ) ) return;\n\n  mUidDict.insert( incidence->uid(), incidence );\n\n  KOListViewItem *item = new KOListViewItem( incidence, mListView );\n  ListItemVisitor v(item);\n  if (incidence->accept(v)) return;\n  else delete item;\n}\n\nvoid KOListView::showIncidences( const Incidence::List &incidenceList )\n{\n  clear();\n\n  addIncidences( incidenceList );\n\n  \/\/ After new creation of list view no events are selected.\n  emit incidenceSelected( 0 );\n}\n\nvoid KOListView::changeIncidenceDisplay(Incidence *incidence, int action)\n{\n  KOListViewItem *item;\n  QDate f = mSelectedDates.first();\n  QDate l = mSelectedDates.last();\n\n  QDate date;\n  if ( incidence->type() == \"Todo\" )\n    date = static_cast<Todo *>(incidence)->dtDue().date();\n  else\n    date = incidence->dtStart().date();\n\n  switch(action) {\n    case KOGlobals::INCIDENCEADDED: {\n      if ( date >= f && date <= l )\n        addIncidence( incidence );\n      break;\n    }\n    case KOGlobals::INCIDENCEEDITED: {\n      item = getItemForIncidence(incidence);\n      if (item) {\n        delete item;\n        mUidDict.remove( incidence->uid() );\n      }\n      if ( date >= f && date <= l )\n        addIncidence( incidence );\n    }\n    break;\n    case KOGlobals::INCIDENCEDELETED: {\n      item = getItemForIncidence(incidence);\n      if (item)\n        delete item;\n      break;\n    }\n    default:\n      kdDebug(5850) << \"KOListView::changeIncidenceDisplay(): Illegal action \" << action << endl;\n  }\n}\n\nKOListViewItem *KOListView::getItemForIncidence(Incidence *incidence)\n{\n  KOListViewItem *item = (KOListViewItem *)mListView->firstChild();\n  while (item) {\n\/\/    kdDebug(5850) << \"Item \" << item->text(0) << \" found\" << endl;\n    if (item->data() == incidence) return item;\n    item = (KOListViewItem *)item->nextSibling();\n  }\n  return 0;\n}\n\nvoid KOListView::defaultItemAction(QListViewItem *i)\n{\n  KOListViewItem *item = static_cast<KOListViewItem *>( i );\n  if ( item ) defaultAction( item->data() );\n}\n\nvoid KOListView::popupMenu(QListViewItem *item,const QPoint &,int)\n{\n  mActiveItem = (KOListViewItem *)item;\n  if (mActiveItem) {\n    Incidence *incidence = mActiveItem->data();\n    \/\/ FIXME: For recurring incidences we don't know the date of this\n    \/\/ occurrence, there's no reference to it at all!\n    mPopupMenu->showIncidencePopup( incidence, QDate() );\n  }\n  else {\n    showNewEventPopup();\n  }\n}\n\nvoid KOListView::readSettings(KConfig *config)\n{\n  mListView->restoreLayout(config,\"KOListView Layout\");\n}\n\nvoid KOListView::writeSettings(KConfig *config)\n{\n  mListView->saveLayout(config,\"KOListView Layout\");\n}\n\nvoid KOListView::processSelectionChange()\n{\n  kdDebug(5850) << \"KOListView::processSelectionChange()\" << endl;\n\n  KOListViewItem *item =\n    static_cast<KOListViewItem *>( mListView->selectedItem() );\n\n  if ( !item ) {\n    emit incidenceSelected( 0 );\n  } else {\n    emit incidenceSelected( item->data() );\n  }\n}\n\nvoid KOListView::clearSelection()\n{\n  mListView->selectAll( false );\n}\n\nvoid KOListView::clear()\n{\n  mSelectedDates.clear();\n  mListView->clear();\n  mUidDict.clear();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Copyright (c) 2013 Adam Roben <adam@roben.org>. 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 \"browser\/inspectable_web_contents_impl.h\"\n\n#include \"browser\/browser_client.h\"\n#include \"browser\/browser_context.h\"\n#include \"browser\/browser_main_parts.h\"\n#include \"browser\/inspectable_web_contents_delegate.h\"\n#include \"browser\/inspectable_web_contents_view.h\"\n\n#include \"base\/json\/json_reader.h\"\n#include \"base\/prefs\/pref_registry_simple.h\"\n#include \"base\/prefs\/pref_service.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"content\/public\/browser\/devtools_agent_host.h\"\n#include \"content\/public\/browser\/devtools_client_host.h\"\n#include \"content\/public\/browser\/devtools_http_handler.h\"\n#include \"content\/public\/browser\/devtools_manager.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"content\/public\/browser\/render_frame_host.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n\nnamespace brightray {\n\nnamespace {\n\nconst char kChromeUIDevToolsURL[] = \"chrome-devtools:\/\/devtools\/devtools.html?can_dock=true\";\nconst char kDevToolsBoundsPref[] = \"brightray.devtools.bounds\";\n\nconst char kFrontendHostId[] = \"id\";\nconst char kFrontendHostMethod[] = \"method\";\nconst char kFrontendHostParams[] = \"params\";\n\nvoid RectToDictionary(const gfx::Rect& bounds, base::DictionaryValue* dict) {\n  dict->SetInteger(\"x\", bounds.x());\n  dict->SetInteger(\"y\", bounds.y());\n  dict->SetInteger(\"width\", bounds.width());\n  dict->SetInteger(\"height\", bounds.height());\n}\n\nvoid DictionaryToRect(const base::DictionaryValue& dict, gfx::Rect* bounds) {\n  int x = 0, y = 0, width = 800, height = 600;\n  dict.GetInteger(\"x\", &x);\n  dict.GetInteger(\"y\", &y);\n  dict.GetInteger(\"width\", &width);\n  dict.GetInteger(\"height\", &height);\n  *bounds = gfx::Rect(x, y, width, height);\n}\n\n}  \/\/ namespace\n\n\/\/ Implemented separately on each platform.\nInspectableWebContentsView* CreateInspectableContentsView(\n    InspectableWebContentsImpl* inspectable_web_contents_impl);\n\nvoid InspectableWebContentsImpl::RegisterPrefs(PrefRegistrySimple* registry) {\n  auto bounds_dict = make_scoped_ptr(new base::DictionaryValue);\n  RectToDictionary(gfx::Rect(0, 0, 800, 600), bounds_dict.get());\n  registry->RegisterDictionaryPref(kDevToolsBoundsPref, bounds_dict.release());\n}\n\nInspectableWebContentsImpl::InspectableWebContentsImpl(\n    content::WebContents* web_contents)\n    : web_contents_(web_contents),\n      delegate_(nullptr) {\n  auto context = static_cast<BrowserContext*>(web_contents_->GetBrowserContext());\n  auto bounds_dict = context->prefs()->GetDictionary(kDevToolsBoundsPref);\n  if (bounds_dict)\n    DictionaryToRect(*bounds_dict, &devtools_bounds_);\n\n  view_.reset(CreateInspectableContentsView(this));\n}\n\nInspectableWebContentsImpl::~InspectableWebContentsImpl() {\n}\n\nInspectableWebContentsView* InspectableWebContentsImpl::GetView() const {\n  return view_.get();\n}\n\ncontent::WebContents* InspectableWebContentsImpl::GetWebContents() const {\n  return web_contents_.get();\n}\n\nvoid InspectableWebContentsImpl::ShowDevTools() {\n  \/\/ Show devtools only after it has done loading, this is to make sure the\n  \/\/ SetIsDocked is called *BEFORE* ShowDevTools.\n  if (!devtools_web_contents_) {\n    embedder_message_dispatcher_.reset(\n        new DevToolsEmbedderMessageDispatcher(this));\n\n    auto create_params = content::WebContents::CreateParams(\n        web_contents_->GetBrowserContext());\n    devtools_web_contents_.reset(content::WebContents::Create(create_params));\n\n    Observe(devtools_web_contents_.get());\n    devtools_web_contents_->SetDelegate(this);\n\n    agent_host_ = content::DevToolsAgentHost::GetOrCreateFor(\n        web_contents_->GetRenderViewHost());\n    frontend_host_.reset(\n        content::DevToolsClientHost::CreateDevToolsFrontendHost(\n            devtools_web_contents_.get(), this));\n    content::DevToolsManager::GetInstance()->RegisterDevToolsClientHostFor(\n        agent_host_, frontend_host_.get());\n\n    GURL devtools_url(kChromeUIDevToolsURL);\n    devtools_web_contents_->GetController().LoadURL(\n        devtools_url,\n        content::Referrer(),\n        content::PAGE_TRANSITION_AUTO_TOPLEVEL,\n        std::string());\n  } else {\n    view_->ShowDevTools();\n  }\n}\n\nvoid InspectableWebContentsImpl::CloseDevTools() {\n  if (devtools_web_contents_) {\n    view_->CloseDevTools();\n    devtools_web_contents_.reset();\n    web_contents_->GetView()->Focus();\n  }\n}\n\nbool InspectableWebContentsImpl::IsDevToolsViewShowing() {\n  return devtools_web_contents_ && view_->IsDevToolsViewShowing();\n}\n\ngfx::Rect InspectableWebContentsImpl::GetDevToolsBounds() const {\n  return devtools_bounds_;\n}\n\nvoid InspectableWebContentsImpl::SaveDevToolsBounds(const gfx::Rect& bounds) {\n  auto context = static_cast<BrowserContext*>(web_contents_->GetBrowserContext());\n  base::DictionaryValue bounds_dict;\n  RectToDictionary(bounds, &bounds_dict);\n  context->prefs()->Set(kDevToolsBoundsPref, bounds_dict);\n  devtools_bounds_ = bounds;\n}\n\nvoid InspectableWebContentsImpl::ActivateWindow() {\n}\n\nvoid InspectableWebContentsImpl::CloseWindow() {\n  CloseDevTools();\n}\n\nvoid InspectableWebContentsImpl::SetContentsResizingStrategy(\n    const gfx::Insets& insets, const gfx::Size& min_size) {\n  DevToolsContentsResizingStrategy strategy(insets, min_size);\n  if (contents_resizing_strategy_.Equals(strategy))\n    return;\n\n  contents_resizing_strategy_.CopyFrom(strategy);\n  view_->SetContentsResizingStrategy(contents_resizing_strategy_);\n}\n\nvoid InspectableWebContentsImpl::InspectElementCompleted() {\n}\n\nvoid InspectableWebContentsImpl::MoveWindow(int x, int y) {\n}\n\nvoid InspectableWebContentsImpl::SetIsDocked(bool docked) {\n  view_->SetIsDocked(docked);\n}\n\nvoid InspectableWebContentsImpl::OpenInNewTab(const std::string& url) {\n}\n\nvoid InspectableWebContentsImpl::SaveToFile(\n    const std::string& url, const std::string& content, bool save_as) {\n  if (delegate_)\n    delegate_->DevToolsSaveToFile(url, content, save_as);\n}\n\nvoid InspectableWebContentsImpl::AppendToFile(\n    const std::string& url, const std::string& content) {\n  if (delegate_)\n    delegate_->DevToolsAppendToFile(url, content);\n}\n\nvoid InspectableWebContentsImpl::RequestFileSystems() {\n    devtools_web_contents()->GetMainFrame()->ExecuteJavaScript(\n        base::ASCIIToUTF16(\"InspectorFrontendAPI.fileSystemsLoaded([])\"));\n}\n\nvoid InspectableWebContentsImpl::AddFileSystem() {\n}\n\nvoid InspectableWebContentsImpl::RemoveFileSystem(\n    const std::string& file_system_path) {\n}\n\nvoid InspectableWebContentsImpl::UpgradeDraggedFileSystemPermissions(\n    const std::string& file_system_url) {\n}\n\nvoid InspectableWebContentsImpl::IndexPath(\n    int request_id, const std::string& file_system_path) {\n}\n\nvoid InspectableWebContentsImpl::StopIndexing(int request_id) {\n}\n\nvoid InspectableWebContentsImpl::SearchInPath(\n    int request_id,\n    const std::string& file_system_path,\n    const std::string& query) {\n}\n\nvoid InspectableWebContentsImpl::ZoomIn() {\n}\n\nvoid InspectableWebContentsImpl::ZoomOut() {\n}\n\nvoid InspectableWebContentsImpl::ResetZoom() {\n}\n\nvoid InspectableWebContentsImpl::DispatchOnEmbedder(\n    const std::string& message) {\n  std::string method;\n  base::ListValue empty_params;\n  base::ListValue* params = &empty_params;\n\n  base::DictionaryValue* dict = NULL;\n  scoped_ptr<base::Value> parsed_message(base::JSONReader::Read(message));\n  if (!parsed_message ||\n      !parsed_message->GetAsDictionary(&dict) ||\n      !dict->GetString(kFrontendHostMethod, &method) ||\n      (dict->HasKey(kFrontendHostParams) &&\n          !dict->GetList(kFrontendHostParams, &params))) {\n    LOG(ERROR) << \"Invalid message was sent to embedder: \" << message;\n    return;\n  }\n\n  int id = 0;\n  dict->GetInteger(kFrontendHostId, &id);\n\n  std::string error = embedder_message_dispatcher_->Dispatch(method, params);\n  if (id) {\n    std::string ack = base::StringPrintf(\n        \"InspectorFrontendAPI.embedderMessageAck(%d, \\\"%s\\\");\", id, error.c_str());\n    devtools_web_contents()->GetMainFrame()->ExecuteJavaScript(base::UTF8ToUTF16(ack));\n  }\n}\n\nvoid InspectableWebContentsImpl::InspectedContentsClosing() {\n}\n\nvoid InspectableWebContentsImpl::AboutToNavigateRenderView(\n    content::RenderViewHost* render_view_host) {\n  content::DevToolsClientHost::SetupDevToolsFrontendClient(\n      web_contents()->GetRenderViewHost());\n}\n\nvoid InspectableWebContentsImpl::DidFinishLoad(int64 frame_id,\n                                               const GURL& validated_url,\n                                               bool is_main_frame,\n                                               content::RenderViewHost*) {\n  if (!is_main_frame)\n    return;\n\n  view_->ShowDevTools();\n}\n\nvoid InspectableWebContentsImpl::WebContentsDestroyed(content::WebContents*) {\n  content::DevToolsManager::GetInstance()->ClientHostClosing(\n      frontend_host_.get());\n  Observe(nullptr);\n  agent_host_ = nullptr;\n  frontend_host_.reset();\n}\n\nvoid InspectableWebContentsImpl::HandleKeyboardEvent(\n    content::WebContents* source,\n    const content::NativeWebKeyboardEvent& event) {\n  auto delegate = web_contents_->GetDelegate();\n  if (delegate)\n    delegate->HandleKeyboardEvent(source, event);\n}\n\n}  \/\/ namespace brightray\n<commit_msg>Separate the message parsing into a new function.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Copyright (c) 2013 Adam Roben <adam@roben.org>. 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 \"browser\/inspectable_web_contents_impl.h\"\n\n#include \"browser\/browser_client.h\"\n#include \"browser\/browser_context.h\"\n#include \"browser\/browser_main_parts.h\"\n#include \"browser\/inspectable_web_contents_delegate.h\"\n#include \"browser\/inspectable_web_contents_view.h\"\n\n#include \"base\/json\/json_reader.h\"\n#include \"base\/prefs\/pref_registry_simple.h\"\n#include \"base\/prefs\/pref_service.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"content\/public\/browser\/devtools_agent_host.h\"\n#include \"content\/public\/browser\/devtools_client_host.h\"\n#include \"content\/public\/browser\/devtools_http_handler.h\"\n#include \"content\/public\/browser\/devtools_manager.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"content\/public\/browser\/render_frame_host.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n\nnamespace brightray {\n\nnamespace {\n\nconst char kChromeUIDevToolsURL[] = \"chrome-devtools:\/\/devtools\/devtools.html?can_dock=true\";\nconst char kDevToolsBoundsPref[] = \"brightray.devtools.bounds\";\n\nconst char kFrontendHostId[] = \"id\";\nconst char kFrontendHostMethod[] = \"method\";\nconst char kFrontendHostParams[] = \"params\";\n\nvoid RectToDictionary(const gfx::Rect& bounds, base::DictionaryValue* dict) {\n  dict->SetInteger(\"x\", bounds.x());\n  dict->SetInteger(\"y\", bounds.y());\n  dict->SetInteger(\"width\", bounds.width());\n  dict->SetInteger(\"height\", bounds.height());\n}\n\nvoid DictionaryToRect(const base::DictionaryValue& dict, gfx::Rect* bounds) {\n  int x = 0, y = 0, width = 800, height = 600;\n  dict.GetInteger(\"x\", &x);\n  dict.GetInteger(\"y\", &y);\n  dict.GetInteger(\"width\", &width);\n  dict.GetInteger(\"height\", &height);\n  *bounds = gfx::Rect(x, y, width, height);\n}\n\nbool ParseMessage(const std::string& message,\n                  std::string* method,\n                  base::ListValue* params,\n                  int* id) {\n  scoped_ptr<base::Value> parsed_message(base::JSONReader::Read(message));\n  if (!parsed_message)\n    return false;\n\n  base::DictionaryValue* dict = NULL;\n  if (!parsed_message->GetAsDictionary(&dict))\n    return false;\n  if (!dict->GetString(kFrontendHostMethod, method))\n    return false;\n\n  \/\/ \"params\" is optional.\n  if (dict->HasKey(kFrontendHostParams)) {\n    base::ListValue* internal_params;\n    if (dict->GetList(kFrontendHostParams, &internal_params))\n      params->Swap(internal_params);\n    else\n      return false;\n  }\n\n  *id = 0;\n  dict->GetInteger(kFrontendHostId, id);\n  return true;\n}\n\n}  \/\/ namespace\n\n\/\/ Implemented separately on each platform.\nInspectableWebContentsView* CreateInspectableContentsView(\n    InspectableWebContentsImpl* inspectable_web_contents_impl);\n\nvoid InspectableWebContentsImpl::RegisterPrefs(PrefRegistrySimple* registry) {\n  auto bounds_dict = make_scoped_ptr(new base::DictionaryValue);\n  RectToDictionary(gfx::Rect(0, 0, 800, 600), bounds_dict.get());\n  registry->RegisterDictionaryPref(kDevToolsBoundsPref, bounds_dict.release());\n}\n\nInspectableWebContentsImpl::InspectableWebContentsImpl(\n    content::WebContents* web_contents)\n    : web_contents_(web_contents),\n      delegate_(nullptr) {\n  auto context = static_cast<BrowserContext*>(web_contents_->GetBrowserContext());\n  auto bounds_dict = context->prefs()->GetDictionary(kDevToolsBoundsPref);\n  if (bounds_dict)\n    DictionaryToRect(*bounds_dict, &devtools_bounds_);\n\n  view_.reset(CreateInspectableContentsView(this));\n}\n\nInspectableWebContentsImpl::~InspectableWebContentsImpl() {\n}\n\nInspectableWebContentsView* InspectableWebContentsImpl::GetView() const {\n  return view_.get();\n}\n\ncontent::WebContents* InspectableWebContentsImpl::GetWebContents() const {\n  return web_contents_.get();\n}\n\nvoid InspectableWebContentsImpl::ShowDevTools() {\n  \/\/ Show devtools only after it has done loading, this is to make sure the\n  \/\/ SetIsDocked is called *BEFORE* ShowDevTools.\n  if (!devtools_web_contents_) {\n    embedder_message_dispatcher_.reset(\n        new DevToolsEmbedderMessageDispatcher(this));\n\n    auto create_params = content::WebContents::CreateParams(\n        web_contents_->GetBrowserContext());\n    devtools_web_contents_.reset(content::WebContents::Create(create_params));\n\n    Observe(devtools_web_contents_.get());\n    devtools_web_contents_->SetDelegate(this);\n\n    agent_host_ = content::DevToolsAgentHost::GetOrCreateFor(\n        web_contents_->GetRenderViewHost());\n    frontend_host_.reset(\n        content::DevToolsClientHost::CreateDevToolsFrontendHost(\n            devtools_web_contents_.get(), this));\n    content::DevToolsManager::GetInstance()->RegisterDevToolsClientHostFor(\n        agent_host_, frontend_host_.get());\n\n    GURL devtools_url(kChromeUIDevToolsURL);\n    devtools_web_contents_->GetController().LoadURL(\n        devtools_url,\n        content::Referrer(),\n        content::PAGE_TRANSITION_AUTO_TOPLEVEL,\n        std::string());\n  } else {\n    view_->ShowDevTools();\n  }\n}\n\nvoid InspectableWebContentsImpl::CloseDevTools() {\n  if (devtools_web_contents_) {\n    view_->CloseDevTools();\n    devtools_web_contents_.reset();\n    web_contents_->GetView()->Focus();\n  }\n}\n\nbool InspectableWebContentsImpl::IsDevToolsViewShowing() {\n  return devtools_web_contents_ && view_->IsDevToolsViewShowing();\n}\n\ngfx::Rect InspectableWebContentsImpl::GetDevToolsBounds() const {\n  return devtools_bounds_;\n}\n\nvoid InspectableWebContentsImpl::SaveDevToolsBounds(const gfx::Rect& bounds) {\n  auto context = static_cast<BrowserContext*>(web_contents_->GetBrowserContext());\n  base::DictionaryValue bounds_dict;\n  RectToDictionary(bounds, &bounds_dict);\n  context->prefs()->Set(kDevToolsBoundsPref, bounds_dict);\n  devtools_bounds_ = bounds;\n}\n\nvoid InspectableWebContentsImpl::ActivateWindow() {\n}\n\nvoid InspectableWebContentsImpl::CloseWindow() {\n  CloseDevTools();\n}\n\nvoid InspectableWebContentsImpl::SetContentsResizingStrategy(\n    const gfx::Insets& insets, const gfx::Size& min_size) {\n  DevToolsContentsResizingStrategy strategy(insets, min_size);\n  if (contents_resizing_strategy_.Equals(strategy))\n    return;\n\n  contents_resizing_strategy_.CopyFrom(strategy);\n  view_->SetContentsResizingStrategy(contents_resizing_strategy_);\n}\n\nvoid InspectableWebContentsImpl::InspectElementCompleted() {\n}\n\nvoid InspectableWebContentsImpl::MoveWindow(int x, int y) {\n}\n\nvoid InspectableWebContentsImpl::SetIsDocked(bool docked) {\n  view_->SetIsDocked(docked);\n}\n\nvoid InspectableWebContentsImpl::OpenInNewTab(const std::string& url) {\n}\n\nvoid InspectableWebContentsImpl::SaveToFile(\n    const std::string& url, const std::string& content, bool save_as) {\n  if (delegate_)\n    delegate_->DevToolsSaveToFile(url, content, save_as);\n}\n\nvoid InspectableWebContentsImpl::AppendToFile(\n    const std::string& url, const std::string& content) {\n  if (delegate_)\n    delegate_->DevToolsAppendToFile(url, content);\n}\n\nvoid InspectableWebContentsImpl::RequestFileSystems() {\n    devtools_web_contents()->GetMainFrame()->ExecuteJavaScript(\n        base::ASCIIToUTF16(\"InspectorFrontendAPI.fileSystemsLoaded([])\"));\n}\n\nvoid InspectableWebContentsImpl::AddFileSystem() {\n}\n\nvoid InspectableWebContentsImpl::RemoveFileSystem(\n    const std::string& file_system_path) {\n}\n\nvoid InspectableWebContentsImpl::UpgradeDraggedFileSystemPermissions(\n    const std::string& file_system_url) {\n}\n\nvoid InspectableWebContentsImpl::IndexPath(\n    int request_id, const std::string& file_system_path) {\n}\n\nvoid InspectableWebContentsImpl::StopIndexing(int request_id) {\n}\n\nvoid InspectableWebContentsImpl::SearchInPath(\n    int request_id,\n    const std::string& file_system_path,\n    const std::string& query) {\n}\n\nvoid InspectableWebContentsImpl::ZoomIn() {\n}\n\nvoid InspectableWebContentsImpl::ZoomOut() {\n}\n\nvoid InspectableWebContentsImpl::ResetZoom() {\n}\n\nvoid InspectableWebContentsImpl::DispatchOnEmbedder(\n    const std::string& message) {\n  std::string method;\n  base::ListValue params;\n  int id;\n  if (!ParseMessage(message, &method, &params, &id)) {\n    LOG(ERROR) << \"Invalid message was sent to embedder: \" << message;\n    return;\n  }\n\n  std::string error = embedder_message_dispatcher_->Dispatch(method, &params);\n  if (id) {\n    std::string ack = base::StringPrintf(\n        \"InspectorFrontendAPI.embedderMessageAck(%d, \\\"%s\\\");\", id, error.c_str());\n    devtools_web_contents()->GetMainFrame()->ExecuteJavaScript(base::UTF8ToUTF16(ack));\n  }\n}\n\nvoid InspectableWebContentsImpl::InspectedContentsClosing() {\n}\n\nvoid InspectableWebContentsImpl::AboutToNavigateRenderView(\n    content::RenderViewHost* render_view_host) {\n  content::DevToolsClientHost::SetupDevToolsFrontendClient(\n      web_contents()->GetRenderViewHost());\n}\n\nvoid InspectableWebContentsImpl::DidFinishLoad(int64 frame_id,\n                                               const GURL& validated_url,\n                                               bool is_main_frame,\n                                               content::RenderViewHost*) {\n  if (!is_main_frame)\n    return;\n\n  view_->ShowDevTools();\n}\n\nvoid InspectableWebContentsImpl::WebContentsDestroyed(content::WebContents*) {\n  content::DevToolsManager::GetInstance()->ClientHostClosing(\n      frontend_host_.get());\n  Observe(nullptr);\n  agent_host_ = nullptr;\n  frontend_host_.reset();\n}\n\nvoid InspectableWebContentsImpl::HandleKeyboardEvent(\n    content::WebContents* source,\n    const content::NativeWebKeyboardEvent& event) {\n  auto delegate = web_contents_->GetDelegate();\n  if (delegate)\n    delegate->HandleKeyboardEvent(source, event);\n}\n\n}  \/\/ namespace brightray\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\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 Apple Computer, Inc. (\"Apple\") 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 APPLE AND ITS CONTRIBUTORS \"AS IS\" AND ANY\n * 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 APPLE OR ITS CONTRIBUTORS 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 \"config.h\"\n\n#if ENABLE(WEB_AUDIO)\n\n#include \"core\/platform\/audio\/ReverbConvolverStage.h\"\n\n#include \"core\/platform\/audio\/ReverbAccumulationBuffer.h\"\n#include \"core\/platform\/audio\/ReverbConvolver.h\"\n#include \"core\/platform\/audio\/ReverbInputBuffer.h\"\n#include \"core\/platform\/audio\/VectorMath.h\"\n#include \"wtf\/OwnPtr.h\"\n#include \"wtf\/PassOwnPtr.h\"\n\nnamespace WebCore {\n\nusing namespace VectorMath;\n\nReverbConvolverStage::ReverbConvolverStage(const float* impulseResponse, size_t, size_t reverbTotalLatency, size_t stageOffset, size_t stageLength,\n                                           size_t fftSize, size_t renderPhase, size_t renderSliceSize, ReverbAccumulationBuffer* accumulationBuffer, bool directMode)\n    : m_accumulationBuffer(accumulationBuffer)\n    , m_accumulationReadIndex(0)\n    , m_inputReadIndex(0)\n    , m_directMode(directMode)\n{\n    ASSERT(impulseResponse);\n    ASSERT(accumulationBuffer);\n\n    if (!m_directMode) {\n        m_fftKernel = adoptPtr(new FFTFrame(fftSize));\n        m_fftKernel->doPaddedFFT(impulseResponse + stageOffset, stageLength);\n        m_fftConvolver = adoptPtr(new FFTConvolver(fftSize));\n    } else {\n        m_directKernel = adoptPtr(new AudioFloatArray(fftSize \/ 2));\n        m_directKernel->copyToRange(impulseResponse + stageOffset, 0, fftSize \/ 2);\n        m_directConvolver = adoptPtr(new DirectConvolver(renderSliceSize));\n    }\n    m_temporaryBuffer.allocate(renderSliceSize);\n\n    \/\/ The convolution stage at offset stageOffset needs to have a corresponding delay to cancel out the offset.\n    size_t totalDelay = stageOffset + reverbTotalLatency;\n\n    \/\/ But, the FFT convolution itself incurs fftSize \/ 2 latency, so subtract this out...\n    size_t halfSize = fftSize \/ 2;\n    if (!m_directMode) {\n        ASSERT(totalDelay >= halfSize);\n        if (totalDelay >= halfSize)\n            totalDelay -= halfSize;\n    }\n\n    \/\/ We divide up the total delay, into pre and post delay sections so that we can schedule at exactly the moment when the FFT will happen.\n    \/\/ This is coordinated with the other stages, so they don't all do their FFTs at the same time...\n    int maxPreDelayLength = std::min(halfSize, totalDelay);\n    m_preDelayLength = totalDelay > 0 ? renderPhase % maxPreDelayLength : 0;\n    if (m_preDelayLength > totalDelay)\n        m_preDelayLength = 0;\n\n    m_postDelayLength = totalDelay - m_preDelayLength;\n    m_preReadWriteIndex = 0;\n    m_framesProcessed = 0; \/\/ total frames processed so far\n\n    size_t delayBufferSize = m_preDelayLength < fftSize ? fftSize : m_preDelayLength;\n    delayBufferSize = delayBufferSize < renderSliceSize ? renderSliceSize : delayBufferSize;\n    m_preDelayBuffer.allocate(delayBufferSize);\n}\n\nvoid ReverbConvolverStage::processInBackground(ReverbConvolver* convolver, size_t framesToProcess)\n{\n    ReverbInputBuffer* inputBuffer = convolver->inputBuffer();\n    float* source = inputBuffer->directReadFrom(&m_inputReadIndex, framesToProcess);\n    process(source, framesToProcess);\n}\n\nvoid ReverbConvolverStage::process(const float* source, size_t framesToProcess)\n{\n    ASSERT(source);\n    if (!source)\n        return;\n\n    \/\/ Deal with pre-delay stream : note special handling of zero delay.\n\n    const float* preDelayedSource;\n    float* preDelayedDestination;\n    float* temporaryBuffer;\n    bool isTemporaryBufferSafe = false;\n    if (m_preDelayLength > 0) {\n        \/\/ Handles both the read case (call to process() ) and the write case (memcpy() )\n        bool isPreDelaySafe = m_preReadWriteIndex + framesToProcess <= m_preDelayBuffer.size();\n        ASSERT(isPreDelaySafe);\n        if (!isPreDelaySafe)\n            return;\n\n        isTemporaryBufferSafe = framesToProcess <= m_temporaryBuffer.size();\n\n        preDelayedDestination = m_preDelayBuffer.data() + m_preReadWriteIndex;\n        preDelayedSource = preDelayedDestination;\n        temporaryBuffer = m_temporaryBuffer.data();\n    } else {\n        \/\/ Zero delay\n        preDelayedDestination = 0;\n        preDelayedSource = source;\n        temporaryBuffer = m_preDelayBuffer.data();\n\n        isTemporaryBufferSafe = framesToProcess <= m_preDelayBuffer.size();\n    }\n\n    ASSERT(isTemporaryBufferSafe);\n    if (!isTemporaryBufferSafe)\n        return;\n\n    if (m_framesProcessed < m_preDelayLength) {\n        \/\/ For the first m_preDelayLength frames don't process the convolver, instead simply buffer in the pre-delay.\n        \/\/ But while buffering the pre-delay, we still need to update our index.\n        m_accumulationBuffer->updateReadIndex(&m_accumulationReadIndex, framesToProcess);\n    } else {\n        \/\/ Now, run the convolution (into the delay buffer).\n        \/\/ An expensive FFT will happen every fftSize \/ 2 frames.\n        \/\/ We process in-place here...\n        if (!m_directMode)\n            m_fftConvolver->process(m_fftKernel.get(), preDelayedSource, temporaryBuffer, framesToProcess);\n        else\n            m_directConvolver->process(m_directKernel.get(), preDelayedSource, temporaryBuffer, framesToProcess);\n\n        \/\/ Now accumulate into reverb's accumulation buffer.\n        m_accumulationBuffer->accumulate(temporaryBuffer, framesToProcess, &m_accumulationReadIndex, m_postDelayLength);\n    }\n\n    \/\/ Finally copy input to pre-delay.\n    if (m_preDelayLength > 0) {\n        memcpy(preDelayedDestination, source, sizeof(float) * framesToProcess);\n        m_preReadWriteIndex += framesToProcess;\n\n        ASSERT(m_preReadWriteIndex <= m_preDelayLength);\n        if (m_preReadWriteIndex >= m_preDelayLength)\n            m_preReadWriteIndex = 0;\n    }\n\n    m_framesProcessed += framesToProcess;\n}\n\nvoid ReverbConvolverStage::reset()\n{\n    if (!m_directMode)\n        m_fftConvolver->reset();\n    else\n        m_directConvolver->reset();\n    m_preDelayBuffer.zero();\n    m_accumulationReadIndex = 0;\n    m_inputReadIndex = 0;\n    m_framesProcessed = 0;\n}\n\n} \/\/ namespace WebCore\n\n#endif \/\/ ENABLE(WEB_AUDIO)\n<commit_msg>Don't read past the end of the impulseResponse array<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\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 Apple Computer, Inc. (\"Apple\") 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 APPLE AND ITS CONTRIBUTORS \"AS IS\" AND ANY\n * 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 APPLE OR ITS CONTRIBUTORS 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 \"config.h\"\n\n#if ENABLE(WEB_AUDIO)\n\n#include \"core\/platform\/audio\/ReverbConvolverStage.h\"\n\n#include \"core\/platform\/audio\/ReverbAccumulationBuffer.h\"\n#include \"core\/platform\/audio\/ReverbConvolver.h\"\n#include \"core\/platform\/audio\/ReverbInputBuffer.h\"\n#include \"core\/platform\/audio\/VectorMath.h\"\n#include \"wtf\/OwnPtr.h\"\n#include \"wtf\/PassOwnPtr.h\"\n\nnamespace WebCore {\n\nusing namespace VectorMath;\n\nReverbConvolverStage::ReverbConvolverStage(const float* impulseResponse, size_t, size_t reverbTotalLatency, size_t stageOffset, size_t stageLength,\n                                           size_t fftSize, size_t renderPhase, size_t renderSliceSize, ReverbAccumulationBuffer* accumulationBuffer, bool directMode)\n    : m_accumulationBuffer(accumulationBuffer)\n    , m_accumulationReadIndex(0)\n    , m_inputReadIndex(0)\n    , m_directMode(directMode)\n{\n    ASSERT(impulseResponse);\n    ASSERT(accumulationBuffer);\n\n    if (!m_directMode) {\n        m_fftKernel = adoptPtr(new FFTFrame(fftSize));\n        m_fftKernel->doPaddedFFT(impulseResponse + stageOffset, stageLength);\n        m_fftConvolver = adoptPtr(new FFTConvolver(fftSize));\n    } else {\n        ASSERT(!stageOffset);\n        ASSERT(stageLength <= fftSize \/ 2);\n\n        m_directKernel = adoptPtr(new AudioFloatArray(fftSize \/ 2));\n        m_directKernel->copyToRange(impulseResponse, 0, stageLength);\n        m_directConvolver = adoptPtr(new DirectConvolver(renderSliceSize));\n    }\n    m_temporaryBuffer.allocate(renderSliceSize);\n\n    \/\/ The convolution stage at offset stageOffset needs to have a corresponding delay to cancel out the offset.\n    size_t totalDelay = stageOffset + reverbTotalLatency;\n\n    \/\/ But, the FFT convolution itself incurs fftSize \/ 2 latency, so subtract this out...\n    size_t halfSize = fftSize \/ 2;\n    if (!m_directMode) {\n        ASSERT(totalDelay >= halfSize);\n        if (totalDelay >= halfSize)\n            totalDelay -= halfSize;\n    }\n\n    \/\/ We divide up the total delay, into pre and post delay sections so that we can schedule at exactly the moment when the FFT will happen.\n    \/\/ This is coordinated with the other stages, so they don't all do their FFTs at the same time...\n    int maxPreDelayLength = std::min(halfSize, totalDelay);\n    m_preDelayLength = totalDelay > 0 ? renderPhase % maxPreDelayLength : 0;\n    if (m_preDelayLength > totalDelay)\n        m_preDelayLength = 0;\n\n    m_postDelayLength = totalDelay - m_preDelayLength;\n    m_preReadWriteIndex = 0;\n    m_framesProcessed = 0; \/\/ total frames processed so far\n\n    size_t delayBufferSize = m_preDelayLength < fftSize ? fftSize : m_preDelayLength;\n    delayBufferSize = delayBufferSize < renderSliceSize ? renderSliceSize : delayBufferSize;\n    m_preDelayBuffer.allocate(delayBufferSize);\n}\n\nvoid ReverbConvolverStage::processInBackground(ReverbConvolver* convolver, size_t framesToProcess)\n{\n    ReverbInputBuffer* inputBuffer = convolver->inputBuffer();\n    float* source = inputBuffer->directReadFrom(&m_inputReadIndex, framesToProcess);\n    process(source, framesToProcess);\n}\n\nvoid ReverbConvolverStage::process(const float* source, size_t framesToProcess)\n{\n    ASSERT(source);\n    if (!source)\n        return;\n\n    \/\/ Deal with pre-delay stream : note special handling of zero delay.\n\n    const float* preDelayedSource;\n    float* preDelayedDestination;\n    float* temporaryBuffer;\n    bool isTemporaryBufferSafe = false;\n    if (m_preDelayLength > 0) {\n        \/\/ Handles both the read case (call to process() ) and the write case (memcpy() )\n        bool isPreDelaySafe = m_preReadWriteIndex + framesToProcess <= m_preDelayBuffer.size();\n        ASSERT(isPreDelaySafe);\n        if (!isPreDelaySafe)\n            return;\n\n        isTemporaryBufferSafe = framesToProcess <= m_temporaryBuffer.size();\n\n        preDelayedDestination = m_preDelayBuffer.data() + m_preReadWriteIndex;\n        preDelayedSource = preDelayedDestination;\n        temporaryBuffer = m_temporaryBuffer.data();\n    } else {\n        \/\/ Zero delay\n        preDelayedDestination = 0;\n        preDelayedSource = source;\n        temporaryBuffer = m_preDelayBuffer.data();\n\n        isTemporaryBufferSafe = framesToProcess <= m_preDelayBuffer.size();\n    }\n\n    ASSERT(isTemporaryBufferSafe);\n    if (!isTemporaryBufferSafe)\n        return;\n\n    if (m_framesProcessed < m_preDelayLength) {\n        \/\/ For the first m_preDelayLength frames don't process the convolver, instead simply buffer in the pre-delay.\n        \/\/ But while buffering the pre-delay, we still need to update our index.\n        m_accumulationBuffer->updateReadIndex(&m_accumulationReadIndex, framesToProcess);\n    } else {\n        \/\/ Now, run the convolution (into the delay buffer).\n        \/\/ An expensive FFT will happen every fftSize \/ 2 frames.\n        \/\/ We process in-place here...\n        if (!m_directMode)\n            m_fftConvolver->process(m_fftKernel.get(), preDelayedSource, temporaryBuffer, framesToProcess);\n        else\n            m_directConvolver->process(m_directKernel.get(), preDelayedSource, temporaryBuffer, framesToProcess);\n\n        \/\/ Now accumulate into reverb's accumulation buffer.\n        m_accumulationBuffer->accumulate(temporaryBuffer, framesToProcess, &m_accumulationReadIndex, m_postDelayLength);\n    }\n\n    \/\/ Finally copy input to pre-delay.\n    if (m_preDelayLength > 0) {\n        memcpy(preDelayedDestination, source, sizeof(float) * framesToProcess);\n        m_preReadWriteIndex += framesToProcess;\n\n        ASSERT(m_preReadWriteIndex <= m_preDelayLength);\n        if (m_preReadWriteIndex >= m_preDelayLength)\n            m_preReadWriteIndex = 0;\n    }\n\n    m_framesProcessed += framesToProcess;\n}\n\nvoid ReverbConvolverStage::reset()\n{\n    if (!m_directMode)\n        m_fftConvolver->reset();\n    else\n        m_directConvolver->reset();\n    m_preDelayBuffer.zero();\n    m_accumulationReadIndex = 0;\n    m_inputReadIndex = 0;\n    m_framesProcessed = 0;\n}\n\n} \/\/ namespace WebCore\n\n#endif \/\/ ENABLE(WEB_AUDIO)\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Language:  C++\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 <iostream>\n\/\/ This file has been generated by BuildHeaderTest.tcl\n\/\/ Test to include each header file for Insight\n\n#include \"itkAnisotropicFourthOrderLevelSetImageFilter.txx\"\n#include \"itkAntiAliasBinaryImageFilter.txx\"\n#include \"itkAutomaticTopologyMeshSource.txx\"\n#include \"itkBalloonForceFilter.txx\"\n#include \"itkBayesianClassifierImageFilter.txx\"\n#include \"itkBayesianClassifierInitializationImageFilter.txx\"\n#include \"itkBinaryMask3DMeshSource.txx\"\n#include \"itkBinaryMedialNodeMetric.txx\"\n#include \"itkBinaryMinMaxCurvatureFlowFunction.txx\"\n#include \"itkBinaryMinMaxCurvatureFlowImageFilter.txx\"\n#include \"itkBinaryPruningImageFilter.txx\"\n#include \"itkBinaryThinningImageFilter.txx\"\n#include \"itkBioCell.txx\"\n#include \"itkBioCellBase.h\"\n#include \"itkBioCellularAggregate.txx\"\n#include \"itkBioCellularAggregateBase.h\"\n#include \"itkBioGene.h\"\n#include \"itkBioGeneNetwork.h\"\n#include \"itkBioGenome.h\"\n#include \"itkCannySegmentationLevelSetFunction.txx\"\n#include \"itkCannySegmentationLevelSetImageFilter.txx\"\n#include \"itkClassifierBase.txx\"\n#include \"itkCollidingFrontsImageFilter.txx\"\n#include \"itkCompareHistogramImageToImageMetric.txx\"\n#include \"itkConnectedRegionsMeshFilter.txx\"\n#include \"itkCoreAtomImageToUnaryCorrespondenceMatrixProcess.txx\"\n#include \"itkCorrelationCoefficientHistogramImageToImageMetric.txx\"\n#include \"itkCurvatureFlowFunction.txx\"\n#include \"itkCurvatureFlowImageFilter.txx\"\n#include \"itkCurvatureRegistrationFilter.txx\"\n#include \"itkCurvesLevelSetFunction.txx\"\n#include \"itkCurvesLevelSetImageFilter.txx\"\n#include \"itkDeformableMesh3DFilter.txx\"\n#include \"itkDeformableSimplexMesh3DBalloonForceFilter.txx\"\n#include \"itkDeformableSimplexMesh3DFilter.txx\"\n#include \"itkDeformableSimplexMesh3DGradientConstraintForceFilter.txx\"\n#include \"itkDemonsRegistrationFilter.txx\"\n#include \"itkDemonsRegistrationFunction.txx\"\n#include \"itkEuclideanDistancePointMetric.txx\"\n#include \"itkExtensionVelocitiesImageFilter.txx\"\n#include \"itkFEMFiniteDifferenceFunctionLoad.txx\"\n#include \"itkFEMRegistrationFilter.txx\"\n#if defined(USE_FFTWF) || defined(USE_FFTWD)\n#include \"itkFFTComplexConjugateToRealImageFilter.txx\"\n#include \"itkFFTRealToComplexConjugateImageFilter.txx\"\n#include \"itkFFTWCommon.h\"\n#include \"itkFFTWComplexConjugateToRealImageFilter.txx\"\n#include \"itkFFTWRealToComplexConjugateImageFilter.txx\"\n#endif\n#include \"itkFastChamferDistanceImageFilter.txx\"\n#include \"itkFastMarchingExtensionImageFilter.txx\"\n#include \"itkFastMarchingImageFilter.txx\"\n#include \"itkFastMarchingUpwindGradientImageFilter.txx\"\n#include \"itkFastSymmetricForcesDemonsRegistrationFunction.txx\"\n#include \"itkGeodesicActiveContourLevelSetFunction.txx\"\n#include \"itkGeodesicActiveContourLevelSetImageFilter.txx\"\n#include \"itkGeodesicActiveContourShapePriorLevelSetFunction.txx\"\n#include \"itkGeodesicActiveContourShapePriorLevelSetImageFilter.txx\"\n#include \"itkGradientDifferenceImageToImageMetric.txx\"\n#include \"itkGradientVectorFlowImageFilter.txx\"\n#include \"itkHistogramAlgorithmBase.txx\"\n#include \"itkHistogramImageToImageMetric.txx\"\n#include \"itkHistogramMatchingImageFilter.txx\"\n#include \"itkImageClassifierBase.txx\"\n#include \"itkImageGaussianModelEstimator.txx\"\n#include \"itkImageKmeansModelEstimator.txx\"\n#include \"itkImageModelEstimatorBase.txx\"\n#include \"itkImageMomentsCalculator.txx\"\n#include \"itkImagePCADecompositionCalculator.txx\"\n#include \"itkImagePCAShapeModelEstimator.txx\"\n#include \"itkImageRegistrationMethod.txx\"\n#include \"itkImageShapeModelEstimatorBase.txx\"\n#include \"itkImageToImageMetric.txx\"\n#include \"itkImageToSpatialObjectMetric.txx\"\n#include \"itkImageToSpatialObjectRegistrationMethod.txx\"\n#include \"itkIsoContourDistanceImageFilter.txx\"\n#include \"itkIsolatedWatershedImageFilter.txx\"\n#include \"itkIsotropicFourthOrderLevelSetImageFilter.txx\"\n#include \"itkKLMRegionGrowImageFilter.txx\"\n#include \"itkKalmanLinearEstimator.h\"\n#include \"itkKappaStatisticImageToImageMetric.txx\"\n#include \"itkKullbackLeiblerCompareHistogramImageToImageMetric.txx\"\n#include \"itkLabelVotingImageFilter.txx\"\n#include \"itkLaplacianSegmentationLevelSetFunction.txx\"\n#include \"itkLaplacianSegmentationLevelSetImageFilter.txx\"\n#include \"itkLevelSetMotionRegistrationFilter.txx\"\n#include \"itkLevelSetMotionRegistrationFunction.txx\"\n#include \"itkLevelSetNeighborhoodExtractor.txx\"\n#include \"itkLevelSetVelocityNeighborhoodExtractor.txx\"\n#include \"itkMIRegistrationFunction.txx\"\n#include \"itkMRASlabIdentifier.txx\"\n#include \"itkMRFImageFilter.txx\"\n#include \"itkMRIBiasFieldCorrectionFilter.txx\"\n#include \"itkMatchCardinalityImageToImageMetric.txx\"\n#include \"itkMattesMutualInformationImageToImageMetric.txx\"\n#include \"itkMeanReciprocalSquareDifferenceImageToImageMetric.txx\"\n#include \"itkMeanReciprocalSquareDifferencePointSetToImageMetric.txx\"\n#include \"itkMeanSquareRegistrationFunction.txx\"\n#include \"itkMeanSquaresHistogramImageToImageMetric.txx\"\n#include \"itkMeanSquaresImageToImageMetric.txx\"\n#include \"itkMeanSquaresPointSetToImageMetric.txx\"\n#include \"itkMedialNodePairCorrespondenceProcess.txx\"\n#include \"itkMedialNodeTripletCorrespondenceProcess.txx\"\n#include \"itkMinMaxCurvatureFlowFunction.txx\"\n#include \"itkMinMaxCurvatureFlowImageFilter.txx\"\n#include \"itkMultiResolutionImageRegistrationMethod.txx\"\n#include \"itkMultiResolutionPDEDeformableRegistration.txx\"\n#include \"itkMultiResolutionPyramidImageFilter.txx\"\n#include \"itkMutualInformationHistogramImageToImageMetric.txx\"\n#include \"itkMutualInformationImageToImageMetric.txx\"\n#include \"itkNCCRegistrationFunction.txx\"\n#include \"itkNarrowBandCurvesLevelSetImageFilter.txx\"\n#include \"itkNarrowBandLevelSetImageFilter.txx\"\n#include \"itkNarrowBandThresholdSegmentationLevelSetImageFilter.txx\"\n#include \"itkNormalizedCorrelationImageToImageMetric.txx\"\n#include \"itkNormalizedCorrelationPointSetToImageMetric.txx\"\n#include \"itkNormalizedMutualInformationHistogramImageToImageMetric.txx\"\n#include \"itkOrthogonalSwath2DPathFilter.txx\"\n#include \"itkOtsuMultipleThresholdsCalculator.txx\"\n#include \"itkOtsuMultipleThresholdsImageFilter.txx\"\n#include \"itkOtsuThresholdImageCalculator.txx\"\n#include \"itkOtsuThresholdImageFilter.txx\"\n#include \"itkPDEDeformableRegistrationFilter.txx\"\n#include \"itkPDEDeformableRegistrationFunction.h\"\n#include \"itkPointSetToImageMetric.txx\"\n#include \"itkPointSetToImageRegistrationMethod.txx\"\n#include \"itkPointSetToPointSetMetric.txx\"\n#include \"itkPointSetToPointSetRegistrationMethod.txx\"\n#include \"itkPointSetToSpatialObjectDemonsRegistration.txx\"\n#include \"itkRGBGibbsPriorFilter.txx\"\n#include \"itkRayCastInterpolateImageFunction.txx\"\n#include \"itkRecursiveMultiResolutionPyramidImageFilter.txx\"\n#include \"itkRegionGrowImageFilter.txx\"\n#include \"itkRegularSphereMeshSource.txx\"\n#include \"itkReinitializeLevelSetImageFilter.txx\"\n#include \"itkSCSLComplexConjugateToRealImageFilter.txx\"\n#include \"itkSCSLRealToComplexConjugateImageFilter.txx\"\n#include \"itkSTAPLEImageFilter.txx\"\n#include \"itkScalarImageKmeansImageFilter.txx\"\n#include \"itkSegmentationLevelSetImageFilter.txx\"\n#include \"itkShapeDetectionLevelSetFunction.txx\"\n#include \"itkShapeDetectionLevelSetImageFilter.txx\"\n#include \"itkShapePriorMAPCostFunction.txx\"\n#include \"itkShapePriorMAPCostFunctionBase.txx\"\n#include \"itkShapePriorSegmentationLevelSetFunction.txx\"\n#include \"itkShapePriorSegmentationLevelSetImageFilter.txx\"\n#include \"itkSimplexMeshVolumeCalculator.txx\"\n#include \"itkSphereMeshSource.txx\"\n#include \"itkStructHashFunction.h\"\n#include \"itkSymmetricForcesDemonsRegistrationFilter.txx\"\n#include \"itkSymmetricForcesDemonsRegistrationFunction.txx\"\n#include \"itkThresholdMaximumConnectedComponentsImageFilter.txx\"\n#include \"itkThresholdSegmentationLevelSetFunction.txx\"\n#include \"itkThresholdSegmentationLevelSetImageFilter.txx\"\n#include \"itkUnaryMedialNodeMetric.txx\"\n#include \"itkUnsharpMaskLevelSetImageFilter.txx\"\n#include \"itkVectorThresholdSegmentationLevelSetFunction.txx\"\n#include \"itkVectorThresholdSegmentationLevelSetImageFilter.txx\"\n#include \"itkVnlFFTComplexConjugateToRealImageFilter.txx\"\n#include \"itkVnlFFTRealToComplexConjugateImageFilter.txx\"\n#include \"itkVoronoiDiagram2D.txx\"\n#include \"itkVoronoiDiagram2DGenerator.txx\"\n#include \"itkVoronoiPartitioningImageFilter.txx\"\n#include \"itkVoronoiSegmentationImageFilter.txx\"\n#include \"itkVoronoiSegmentationImageFilterBase.txx\"\n#include \"itkVoronoiSegmentationRGBImageFilter.txx\"\n#include \"itkWatershedBoundary.txx\"\n#include \"itkWatershedBoundaryResolver.txx\"\n#include \"itkWatershedEquivalenceRelabeler.txx\"\n#include \"itkWatershedImageFilter.txx\"\n#include \"itkWatershedMiniPipelineProgressCommand.h\"\n#include \"itkWatershedRelabeler.txx\"\n#include \"itkWatershedSegmentTable.txx\"\n#include \"itkWatershedSegmentTree.txx\"\n#include \"itkWatershedSegmentTreeGenerator.txx\"\n#include \"itkWatershedSegmenter.txx\"\n#include \"vnl_fft_3d.h\"\n\nint main ( int , char*  )\n{\n  \n  return EXIT_SUCCESS;\n}\n\n<commit_msg>COMP: Fixing signature of the main() method.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Language:  C++\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 <iostream>\n\/\/ This file has been generated by BuildHeaderTest.tcl\n\/\/ Test to include each header file for Insight\n\n#include \"itkAnisotropicFourthOrderLevelSetImageFilter.txx\"\n#include \"itkAntiAliasBinaryImageFilter.txx\"\n#include \"itkAutomaticTopologyMeshSource.txx\"\n#include \"itkBalloonForceFilter.txx\"\n#include \"itkBayesianClassifierImageFilter.txx\"\n#include \"itkBayesianClassifierInitializationImageFilter.txx\"\n#include \"itkBinaryMask3DMeshSource.txx\"\n#include \"itkBinaryMedialNodeMetric.txx\"\n#include \"itkBinaryMinMaxCurvatureFlowFunction.txx\"\n#include \"itkBinaryMinMaxCurvatureFlowImageFilter.txx\"\n#include \"itkBinaryPruningImageFilter.txx\"\n#include \"itkBinaryThinningImageFilter.txx\"\n#include \"itkBioCell.txx\"\n#include \"itkBioCellBase.h\"\n#include \"itkBioCellularAggregate.txx\"\n#include \"itkBioCellularAggregateBase.h\"\n#include \"itkBioGene.h\"\n#include \"itkBioGeneNetwork.h\"\n#include \"itkBioGenome.h\"\n#include \"itkCannySegmentationLevelSetFunction.txx\"\n#include \"itkCannySegmentationLevelSetImageFilter.txx\"\n#include \"itkClassifierBase.txx\"\n#include \"itkCollidingFrontsImageFilter.txx\"\n#include \"itkCompareHistogramImageToImageMetric.txx\"\n#include \"itkConnectedRegionsMeshFilter.txx\"\n#include \"itkCoreAtomImageToUnaryCorrespondenceMatrixProcess.txx\"\n#include \"itkCorrelationCoefficientHistogramImageToImageMetric.txx\"\n#include \"itkCurvatureFlowFunction.txx\"\n#include \"itkCurvatureFlowImageFilter.txx\"\n#include \"itkCurvatureRegistrationFilter.txx\"\n#include \"itkCurvesLevelSetFunction.txx\"\n#include \"itkCurvesLevelSetImageFilter.txx\"\n#include \"itkDeformableMesh3DFilter.txx\"\n#include \"itkDeformableSimplexMesh3DBalloonForceFilter.txx\"\n#include \"itkDeformableSimplexMesh3DFilter.txx\"\n#include \"itkDeformableSimplexMesh3DGradientConstraintForceFilter.txx\"\n#include \"itkDemonsRegistrationFilter.txx\"\n#include \"itkDemonsRegistrationFunction.txx\"\n#include \"itkEuclideanDistancePointMetric.txx\"\n#include \"itkExtensionVelocitiesImageFilter.txx\"\n#include \"itkFEMFiniteDifferenceFunctionLoad.txx\"\n#include \"itkFEMRegistrationFilter.txx\"\n#if defined(USE_FFTWF) || defined(USE_FFTWD)\n#include \"itkFFTComplexConjugateToRealImageFilter.txx\"\n#include \"itkFFTRealToComplexConjugateImageFilter.txx\"\n#include \"itkFFTWCommon.h\"\n#include \"itkFFTWComplexConjugateToRealImageFilter.txx\"\n#include \"itkFFTWRealToComplexConjugateImageFilter.txx\"\n#endif\n#include \"itkFastChamferDistanceImageFilter.txx\"\n#include \"itkFastMarchingExtensionImageFilter.txx\"\n#include \"itkFastMarchingImageFilter.txx\"\n#include \"itkFastMarchingUpwindGradientImageFilter.txx\"\n#include \"itkFastSymmetricForcesDemonsRegistrationFunction.txx\"\n#include \"itkGeodesicActiveContourLevelSetFunction.txx\"\n#include \"itkGeodesicActiveContourLevelSetImageFilter.txx\"\n#include \"itkGeodesicActiveContourShapePriorLevelSetFunction.txx\"\n#include \"itkGeodesicActiveContourShapePriorLevelSetImageFilter.txx\"\n#include \"itkGradientDifferenceImageToImageMetric.txx\"\n#include \"itkGradientVectorFlowImageFilter.txx\"\n#include \"itkHistogramAlgorithmBase.txx\"\n#include \"itkHistogramImageToImageMetric.txx\"\n#include \"itkHistogramMatchingImageFilter.txx\"\n#include \"itkImageClassifierBase.txx\"\n#include \"itkImageGaussianModelEstimator.txx\"\n#include \"itkImageKmeansModelEstimator.txx\"\n#include \"itkImageModelEstimatorBase.txx\"\n#include \"itkImageMomentsCalculator.txx\"\n#include \"itkImagePCADecompositionCalculator.txx\"\n#include \"itkImagePCAShapeModelEstimator.txx\"\n#include \"itkImageRegistrationMethod.txx\"\n#include \"itkImageShapeModelEstimatorBase.txx\"\n#include \"itkImageToImageMetric.txx\"\n#include \"itkImageToSpatialObjectMetric.txx\"\n#include \"itkImageToSpatialObjectRegistrationMethod.txx\"\n#include \"itkIsoContourDistanceImageFilter.txx\"\n#include \"itkIsolatedWatershedImageFilter.txx\"\n#include \"itkIsotropicFourthOrderLevelSetImageFilter.txx\"\n#include \"itkKLMRegionGrowImageFilter.txx\"\n#include \"itkKalmanLinearEstimator.h\"\n#include \"itkKappaStatisticImageToImageMetric.txx\"\n#include \"itkKullbackLeiblerCompareHistogramImageToImageMetric.txx\"\n#include \"itkLabelVotingImageFilter.txx\"\n#include \"itkLaplacianSegmentationLevelSetFunction.txx\"\n#include \"itkLaplacianSegmentationLevelSetImageFilter.txx\"\n#include \"itkLevelSetMotionRegistrationFilter.txx\"\n#include \"itkLevelSetMotionRegistrationFunction.txx\"\n#include \"itkLevelSetNeighborhoodExtractor.txx\"\n#include \"itkLevelSetVelocityNeighborhoodExtractor.txx\"\n#include \"itkMIRegistrationFunction.txx\"\n#include \"itkMRASlabIdentifier.txx\"\n#include \"itkMRFImageFilter.txx\"\n#include \"itkMRIBiasFieldCorrectionFilter.txx\"\n#include \"itkMatchCardinalityImageToImageMetric.txx\"\n#include \"itkMattesMutualInformationImageToImageMetric.txx\"\n#include \"itkMeanReciprocalSquareDifferenceImageToImageMetric.txx\"\n#include \"itkMeanReciprocalSquareDifferencePointSetToImageMetric.txx\"\n#include \"itkMeanSquareRegistrationFunction.txx\"\n#include \"itkMeanSquaresHistogramImageToImageMetric.txx\"\n#include \"itkMeanSquaresImageToImageMetric.txx\"\n#include \"itkMeanSquaresPointSetToImageMetric.txx\"\n#include \"itkMedialNodePairCorrespondenceProcess.txx\"\n#include \"itkMedialNodeTripletCorrespondenceProcess.txx\"\n#include \"itkMinMaxCurvatureFlowFunction.txx\"\n#include \"itkMinMaxCurvatureFlowImageFilter.txx\"\n#include \"itkMultiResolutionImageRegistrationMethod.txx\"\n#include \"itkMultiResolutionPDEDeformableRegistration.txx\"\n#include \"itkMultiResolutionPyramidImageFilter.txx\"\n#include \"itkMutualInformationHistogramImageToImageMetric.txx\"\n#include \"itkMutualInformationImageToImageMetric.txx\"\n#include \"itkNCCRegistrationFunction.txx\"\n#include \"itkNarrowBandCurvesLevelSetImageFilter.txx\"\n#include \"itkNarrowBandLevelSetImageFilter.txx\"\n#include \"itkNarrowBandThresholdSegmentationLevelSetImageFilter.txx\"\n#include \"itkNormalizedCorrelationImageToImageMetric.txx\"\n#include \"itkNormalizedCorrelationPointSetToImageMetric.txx\"\n#include \"itkNormalizedMutualInformationHistogramImageToImageMetric.txx\"\n#include \"itkOrthogonalSwath2DPathFilter.txx\"\n#include \"itkOtsuMultipleThresholdsCalculator.txx\"\n#include \"itkOtsuMultipleThresholdsImageFilter.txx\"\n#include \"itkOtsuThresholdImageCalculator.txx\"\n#include \"itkOtsuThresholdImageFilter.txx\"\n#include \"itkPDEDeformableRegistrationFilter.txx\"\n#include \"itkPDEDeformableRegistrationFunction.h\"\n#include \"itkPointSetToImageMetric.txx\"\n#include \"itkPointSetToImageRegistrationMethod.txx\"\n#include \"itkPointSetToPointSetMetric.txx\"\n#include \"itkPointSetToPointSetRegistrationMethod.txx\"\n#include \"itkPointSetToSpatialObjectDemonsRegistration.txx\"\n#include \"itkRGBGibbsPriorFilter.txx\"\n#include \"itkRayCastInterpolateImageFunction.txx\"\n#include \"itkRecursiveMultiResolutionPyramidImageFilter.txx\"\n#include \"itkRegionGrowImageFilter.txx\"\n#include \"itkRegularSphereMeshSource.txx\"\n#include \"itkReinitializeLevelSetImageFilter.txx\"\n#include \"itkSCSLComplexConjugateToRealImageFilter.txx\"\n#include \"itkSCSLRealToComplexConjugateImageFilter.txx\"\n#include \"itkSTAPLEImageFilter.txx\"\n#include \"itkScalarImageKmeansImageFilter.txx\"\n#include \"itkSegmentationLevelSetImageFilter.txx\"\n#include \"itkShapeDetectionLevelSetFunction.txx\"\n#include \"itkShapeDetectionLevelSetImageFilter.txx\"\n#include \"itkShapePriorMAPCostFunction.txx\"\n#include \"itkShapePriorMAPCostFunctionBase.txx\"\n#include \"itkShapePriorSegmentationLevelSetFunction.txx\"\n#include \"itkShapePriorSegmentationLevelSetImageFilter.txx\"\n#include \"itkSimplexMeshVolumeCalculator.txx\"\n#include \"itkSphereMeshSource.txx\"\n#include \"itkStructHashFunction.h\"\n#include \"itkSymmetricForcesDemonsRegistrationFilter.txx\"\n#include \"itkSymmetricForcesDemonsRegistrationFunction.txx\"\n#include \"itkThresholdMaximumConnectedComponentsImageFilter.txx\"\n#include \"itkThresholdSegmentationLevelSetFunction.txx\"\n#include \"itkThresholdSegmentationLevelSetImageFilter.txx\"\n#include \"itkUnaryMedialNodeMetric.txx\"\n#include \"itkUnsharpMaskLevelSetImageFilter.txx\"\n#include \"itkVectorThresholdSegmentationLevelSetFunction.txx\"\n#include \"itkVectorThresholdSegmentationLevelSetImageFilter.txx\"\n#include \"itkVnlFFTComplexConjugateToRealImageFilter.txx\"\n#include \"itkVnlFFTRealToComplexConjugateImageFilter.txx\"\n#include \"itkVoronoiDiagram2D.txx\"\n#include \"itkVoronoiDiagram2DGenerator.txx\"\n#include \"itkVoronoiPartitioningImageFilter.txx\"\n#include \"itkVoronoiSegmentationImageFilter.txx\"\n#include \"itkVoronoiSegmentationImageFilterBase.txx\"\n#include \"itkVoronoiSegmentationRGBImageFilter.txx\"\n#include \"itkWatershedBoundary.txx\"\n#include \"itkWatershedBoundaryResolver.txx\"\n#include \"itkWatershedEquivalenceRelabeler.txx\"\n#include \"itkWatershedImageFilter.txx\"\n#include \"itkWatershedMiniPipelineProgressCommand.h\"\n#include \"itkWatershedRelabeler.txx\"\n#include \"itkWatershedSegmentTable.txx\"\n#include \"itkWatershedSegmentTree.txx\"\n#include \"itkWatershedSegmentTreeGenerator.txx\"\n#include \"itkWatershedSegmenter.txx\"\n#include \"vnl_fft_3d.h\"\n\nint main ( int , char ** )\n{\n  \n  return EXIT_SUCCESS;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"builtin\/channel.hpp\"\n#include \"builtin\/list.hpp\"\n#include \"builtin\/symbol.hpp\"\n#include \"builtin\/thread.hpp\"\n\n#include \"vm.hpp\"\n#include \"objectmemory.hpp\"\n#include \"event.hpp\"\n\n#include <cxxtest\/TestSuite.h>\n#include <sys\/time.h>\n\nusing namespace rubinius;\n\nclass TestChannel : public CxxTest::TestSuite {\n  public:\n\n  VM* state;\n  Channel* chan;\n\n  void setUp() {\n    state = new VM();\n    chan = Channel::create(state);\n  }\n\n  void tearDown() {\n    delete state;\n  }\n\n  void test_channel_fields() {\n    TS_ASSERT_EQUALS(2U, Channel::fields);\n  }\n\n  void test_create() {\n    TS_ASSERT(kind_of<Channel>(chan));\n    TS_ASSERT(kind_of<List>(chan->waiting()));\n  }\n\n  void test_send_then_receive() {\n    Task* task = Task::create(state, 10);\n\n    state->globals.current_task.set(task);\n\n    TS_ASSERT(chan->value()->nil_p());\n    chan->send(state, Qtrue);\n\n    TS_ASSERT(kind_of<List>(chan->value()));\n    List* lst = as<List>(chan->value());\n    TS_ASSERT_EQUALS(lst->size(), 1U);\n    TS_ASSERT_EQUALS(lst->locate(state, 0), Qtrue);\n\n    chan->receive(state);\n    TS_ASSERT_EQUALS(task->calculate_sp(), 0);\n    TS_ASSERT_EQUALS(task->stack_top(), Qtrue);\n    TS_ASSERT_EQUALS(lst->size(), 0U);\n  }\n\n  void test_receive_causes_deadlock() {\n    Task* task = Task::create(state, 10);\n\n    state->globals.current_task.set(task);\n\n    Thread* thread = Thread::create(state);\n    state->globals.current_thread.set(thread);\n\n    bool thrown = false;\n    try {\n      chan->receive(state);\n    } catch(DeadLock& e) {\n      thrown = true;\n    }\n\n    TS_ASSERT(thrown);\n  }\n\n  void test_receive_causes_thread_switch() {\n    Thread* other = Thread::create(state);\n\n    Thread* orig = G(current_thread);\n\n    state->queue_thread(other);\n\n    chan->receive(state);\n    TS_ASSERT_EQUALS(G(current_thread), other);\n    TS_ASSERT_EQUALS(orig->get_ivar(state, state->symbol(\"@sleep\")), Qtrue);\n  }\n\n  void test_receive_causes_event_block() {\n    ChannelCallback cb(state, chan);\n    event::Timer* timer = new event::Timer(state, &cb, 0.2);\n\n    Thread* orig = G(current_thread);\n    state->events->start(timer);\n\n    OBJECT* stack = G(current_task)->current_stack();\n\n    TS_ASSERT(!state->wait_events);\n    chan->receive(state);\n\n    TS_ASSERT_EQUALS(chan->waiting()->locate(state, 0), G(current_thread));\n\n    TS_ASSERT(state->wait_events);\n    state->events->run_and_wait();\n\n    TS_ASSERT(chan->waiting()->empty_p());\n    \n    TS_ASSERT_EQUALS(G(current_thread), orig);\n    TS_ASSERT_EQUALS(G(current_task)->calculate_sp(), 0);\n    TS_ASSERT_EQUALS(stack[0], Qnil);\n  }\n\n  void test_receive_polls_events() {\n    ChannelCallback cb(state, chan);\n    event::Timer* timer = new event::Timer(state, &cb, 0.2);\n\n    Thread* orig = G(current_thread);\n    state->events->start(timer);\n\n    OBJECT* stack = G(current_task)->current_stack();\n\n    TS_ASSERT(!state->wait_events);\n    usleep(300000);\n    chan->receive(state);\n    TS_ASSERT(!state->wait_events);\n\n    TS_ASSERT(chan->waiting()->empty_p());\n\n    TS_ASSERT_EQUALS(G(current_thread), orig);\n    TS_ASSERT_EQUALS(G(current_task)->calculate_sp(), 0);\n    TS_ASSERT_EQUALS(stack[0], Qnil);\n  }\n\n  void test_has_readers_p() {\n    TS_ASSERT(!chan->has_readers_p());\n    chan->waiting()->append(state, G(current_thread));\n    TS_ASSERT(chan->has_readers_p());\n  }\n\n  void compare_intervals(struct timeval start, struct timeval finish,\n                         suseconds_t expected, suseconds_t delta) {\n    time_t sec = finish.tv_sec - start.tv_sec;\n    suseconds_t actual = sec * 1000000 - start.tv_usec + finish.tv_usec;\n    TS_ASSERT_DELTA(expected, actual, delta);\n  }\n\n  void compare_interval_in_range(struct timeval start, struct timeval finish, \n\t\t\t\t suseconds_t tmin, suseconds_t tmax) {\n    time_t sec = finish.tv_sec - start.tv_sec;\n    suseconds_t actual = sec * 1000000 - start.tv_usec + finish.tv_usec;\n    TS_ASSERT_LESS_THAN(tmin, actual);\n    TS_ASSERT_LESS_THAN(actual,tmax);\n  }\n\n  void test_send_in_microseconds() {\n    struct timeval start, finish;\n\n    Thread* orig = G(current_thread);\n    SYMBOL done = state->symbol(\"done\");\n    gettimeofday(&start, NULL);\n\n    OBJECT* stack = G(current_task)->current_stack();\n\n    OBJECT ret = Channel::send_in_microseconds(state, chan, Fixnum::from(100000), done);\n    usleep(200000);\n    chan->receive(state);\n\n    gettimeofday(&finish, NULL);\n    TS_ASSERT(ret->nil_p());\n    TS_ASSERT_EQUALS(G(current_thread), orig);\n    TS_ASSERT_EQUALS(done, stack[0]);\n    compare_interval_in_range(start,finish,200000U,250000U);\n  }\n\n  void test_send_in_seconds() {\n    Float* point_one = Float::create(state, 0.1);\n    struct timeval start, finish;\n\n    Thread* orig = G(current_thread);\n    SYMBOL done = state->symbol(\"done\");\n    gettimeofday(&start, NULL);\n\n    OBJECT* stack = G(current_task)->current_stack();\n\n    OBJECT ret = Channel::send_in_seconds(state, chan, point_one, done);\n    usleep(201000);\n    chan->receive(state);\n\n    gettimeofday(&finish, NULL);\n    TS_ASSERT(ret->nil_p());\n    TS_ASSERT_EQUALS(G(current_thread), orig);\n    TS_ASSERT_EQUALS(done, stack[0]);\n    compare_intervals(start, finish, 201000U, 350U);\n  }\n};\n<commit_msg>switched all interval tests to range tests<commit_after>#include \"builtin\/channel.hpp\"\n#include \"builtin\/list.hpp\"\n#include \"builtin\/symbol.hpp\"\n#include \"builtin\/thread.hpp\"\n\n#include \"vm.hpp\"\n#include \"objectmemory.hpp\"\n#include \"event.hpp\"\n\n#include <cxxtest\/TestSuite.h>\n#include <sys\/time.h>\n\nusing namespace rubinius;\n\nclass TestChannel : public CxxTest::TestSuite {\n  public:\n\n  VM* state;\n  Channel* chan;\n\n  void setUp() {\n    state = new VM();\n    chan = Channel::create(state);\n  }\n\n  void tearDown() {\n    delete state;\n  }\n\n  void test_channel_fields() {\n    TS_ASSERT_EQUALS(2U, Channel::fields);\n  }\n\n  void test_create() {\n    TS_ASSERT(kind_of<Channel>(chan));\n    TS_ASSERT(kind_of<List>(chan->waiting()));\n  }\n\n  void test_send_then_receive() {\n    Task* task = Task::create(state, 10);\n\n    state->globals.current_task.set(task);\n\n    TS_ASSERT(chan->value()->nil_p());\n    chan->send(state, Qtrue);\n\n    TS_ASSERT(kind_of<List>(chan->value()));\n    List* lst = as<List>(chan->value());\n    TS_ASSERT_EQUALS(lst->size(), 1U);\n    TS_ASSERT_EQUALS(lst->locate(state, 0), Qtrue);\n\n    chan->receive(state);\n    TS_ASSERT_EQUALS(task->calculate_sp(), 0);\n    TS_ASSERT_EQUALS(task->stack_top(), Qtrue);\n    TS_ASSERT_EQUALS(lst->size(), 0U);\n  }\n\n  void test_receive_causes_deadlock() {\n    Task* task = Task::create(state, 10);\n\n    state->globals.current_task.set(task);\n\n    Thread* thread = Thread::create(state);\n    state->globals.current_thread.set(thread);\n\n    bool thrown = false;\n    try {\n      chan->receive(state);\n    } catch(DeadLock& e) {\n      thrown = true;\n    }\n\n    TS_ASSERT(thrown);\n  }\n\n  void test_receive_causes_thread_switch() {\n    Thread* other = Thread::create(state);\n\n    Thread* orig = G(current_thread);\n\n    state->queue_thread(other);\n\n    chan->receive(state);\n    TS_ASSERT_EQUALS(G(current_thread), other);\n    TS_ASSERT_EQUALS(orig->get_ivar(state, state->symbol(\"@sleep\")), Qtrue);\n  }\n\n  void test_receive_causes_event_block() {\n    ChannelCallback cb(state, chan);\n    event::Timer* timer = new event::Timer(state, &cb, 0.2);\n\n    Thread* orig = G(current_thread);\n    state->events->start(timer);\n\n    OBJECT* stack = G(current_task)->current_stack();\n\n    TS_ASSERT(!state->wait_events);\n    chan->receive(state);\n\n    TS_ASSERT_EQUALS(chan->waiting()->locate(state, 0), G(current_thread));\n\n    TS_ASSERT(state->wait_events);\n    state->events->run_and_wait();\n\n    TS_ASSERT(chan->waiting()->empty_p());\n    \n    TS_ASSERT_EQUALS(G(current_thread), orig);\n    TS_ASSERT_EQUALS(G(current_task)->calculate_sp(), 0);\n    TS_ASSERT_EQUALS(stack[0], Qnil);\n  }\n\n  void test_receive_polls_events() {\n    ChannelCallback cb(state, chan);\n    event::Timer* timer = new event::Timer(state, &cb, 0.2);\n\n    Thread* orig = G(current_thread);\n    state->events->start(timer);\n\n    OBJECT* stack = G(current_task)->current_stack();\n\n    TS_ASSERT(!state->wait_events);\n    usleep(300000);\n    chan->receive(state);\n    TS_ASSERT(!state->wait_events);\n\n    TS_ASSERT(chan->waiting()->empty_p());\n\n    TS_ASSERT_EQUALS(G(current_thread), orig);\n    TS_ASSERT_EQUALS(G(current_task)->calculate_sp(), 0);\n    TS_ASSERT_EQUALS(stack[0], Qnil);\n  }\n\n  void test_has_readers_p() {\n    TS_ASSERT(!chan->has_readers_p());\n    chan->waiting()->append(state, G(current_thread));\n    TS_ASSERT(chan->has_readers_p());\n  }\n\n  void compare_interval_in_range(struct timeval start, struct timeval finish, \n\t\t\t\t suseconds_t tmin, suseconds_t tmax) {\n    time_t sec = finish.tv_sec - start.tv_sec;\n    suseconds_t actual = sec * 1000000 - start.tv_usec + finish.tv_usec;\n    TS_ASSERT_LESS_THAN(tmin, actual);\n    TS_ASSERT_LESS_THAN(actual,tmax);\n  }\n\n  void test_send_in_microseconds() {\n    struct timeval start, finish;\n\n    Thread* orig = G(current_thread);\n    SYMBOL done = state->symbol(\"done\");\n    gettimeofday(&start, NULL);\n\n    OBJECT* stack = G(current_task)->current_stack();\n\n    OBJECT ret = Channel::send_in_microseconds(state, chan, Fixnum::from(100000), done);\n    usleep(200000);\n    chan->receive(state);\n\n    gettimeofday(&finish, NULL);\n    TS_ASSERT(ret->nil_p());\n    TS_ASSERT_EQUALS(G(current_thread), orig);\n    TS_ASSERT_EQUALS(done, stack[0]);\n    compare_interval_in_range(start,finish,200000U,250000U);\n  }\n\n  void test_send_in_seconds() {\n    Float* point_one = Float::create(state, 0.1);\n    struct timeval start, finish;\n\n    Thread* orig = G(current_thread);\n    SYMBOL done = state->symbol(\"done\");\n    gettimeofday(&start, NULL);\n\n    OBJECT* stack = G(current_task)->current_stack();\n\n    OBJECT ret = Channel::send_in_seconds(state, chan, point_one, done);\n    usleep(201000);\n    chan->receive(state);\n\n    gettimeofday(&finish, NULL);\n    TS_ASSERT(ret->nil_p());\n    TS_ASSERT_EQUALS(G(current_thread), orig);\n    TS_ASSERT_EQUALS(done, stack[0]);\n    compare_interval_in_range(start, finish, 201000U, 251000U);\n  }\n};\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/\/ Simplified version of https:\/\/github.com\/joboccara\/NamedType\n\/\/ Also see https:\/\/github.com\/Enhex\/phantom_type\n\n\/\/ ----------------------------------------------------------------------\n\n#include <type_traits>\n\nnamespace acmacs\n{\n    template <typename T, typename Tag> class named_t\n    {\n      public:\n        using value_type = T;\n        template <typename TT> using is_not_reference_t = typename std::enable_if<!std::is_reference<TT>::value, void>::type;\n\n        explicit constexpr named_t(const T& value) : value_(value) {}\n        template <typename T_ = T, typename = is_not_reference_t<T_>> explicit constexpr named_t(T&& value) : value_(std::move(value)) {}\n\n        constexpr T& get() { return value_; }\n        constexpr T const& get() const { return value_; }\n        explicit constexpr operator T&() noexcept { return value_; }\n        explicit constexpr operator const T&() const noexcept { return value_; }\n\n      private:\n        T value_;\n    };\n    \n} \/\/ namespace acmacs\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>named-type<commit_after>#pragma once\n\n#include <iostream>\n\n\/\/ Simplified version of https:\/\/github.com\/joboccara\/NamedType\n\/\/ Also see https:\/\/github.com\/Enhex\/phantom_type\n\n\/\/ ----------------------------------------------------------------------\n\n#include <type_traits>\n\nnamespace acmacs\n{\n    template <typename T, typename Tag> class named_t\n    {\n      public:\n        using value_type = T;\n        template <typename TT> using is_not_reference_t = typename std::enable_if<!std::is_reference<TT>::value, void>::type;\n\n        explicit constexpr named_t(const T& value) : value_(value) {}\n        template <typename T_ = T, typename = is_not_reference_t<T_>> explicit constexpr named_t(T&& value) : value_(std::move(value)) {}\n\n        constexpr T& get() noexcept { return value_; }\n        constexpr T const& get() const noexcept { return value_; }\n        explicit constexpr operator T&() noexcept { return value_; }\n        explicit constexpr operator const T&() const noexcept { return value_; }\n\n        template <typename T1, typename Tag1> constexpr bool operator==(const named_t<T1, Tag1>& rhs) const noexcept { return get() == rhs.get(); }\n        template <typename T1, typename Tag1> constexpr bool operator!=(const named_t<T1, Tag1>& rhs) const noexcept { return !operator==(rhs); }\n        template <typename T1, typename Tag1> constexpr bool operator< (const named_t<T1, Tag1>& rhs) const noexcept { return get() < rhs.get(); }\n\n      private:\n        T value_;\n    };\n\n    template <typename T, typename Tag> inline std::ostream& operator<<(std::ostream& out, const named_t<T, Tag>& named) { return out << named.get(); }\n    \n} \/\/ namespace acmacs\n\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <exception>\n#include <regex>\n#include <iostream>\n\n#include \"acmacs-base\/throw.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace virus_name\n{\n    namespace _internal\n    {\n#pragma GCC diagnostic push\n#ifdef __clang__\n#pragma GCC diagnostic ignored \"-Wglobal-constructors\"\n#pragma GCC diagnostic ignored \"-Wexit-time-destructors\"\n#endif\n\n        const std::regex cdc{\"^([A-Z][A-Z][A-Z]?) \"};\n\n        constexpr const char* re_international_name = \"^(?:([AB][^\/]*)\/)?(?:([^\/]+)\/)?([^\/]{2,})\/0*([^\/]+)\/(19|20)?(\\\\d\\\\d)\";\n        constexpr const char* re_reassortant_passage = \"(?:(?:\\\\s+|__)(.+))?\";\n\n          \/\/ [1] - type+subtype, [2] - host, [3] - location, [4] - isolation-number (omitting leading zeros), [5] - century, [6] - year (2 last digit), [7] - reassortant and passage\n          \/\/ const std::regex international{\"^([AB][^\/]*)\/(?:([^\/]+)\/)?([^\/]+)\/0*([^\/]+)\/(19|20)?(\\\\d\\\\d)(?:(?:\\\\s+|__)(.+))?$\"};\n        const std::regex international{std::string(re_international_name) + re_reassortant_passage + \"$\"};\n        const std::regex international_name{re_international_name};\n\n#pragma GCC diagnostic pop\n\n        inline std::string make_year(const std::smatch& m)\n        {\n            std::string year;\n            if (m[5].length())\n                year = m[5].str() + m[6].str();\n            else if (m[6].str()[0] > '2')\n                year = \"19\" + m[6].str();\n            else\n                year = \"20\" + m[6].str();\n            return year;\n        }\n\n        constexpr const size_t international_name_suffix_size = 9; \/\/ len(lo\/isolation-number\/year) >= 9\n\n        inline std::string location_human(std::string name, size_t prefix_size)\n        {\n            const auto end = name.find('\/', prefix_size);\n            return name.substr(prefix_size, end - prefix_size);\n        }\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    class Unrecognized : public std::runtime_error { public: using std::runtime_error::runtime_error; };\n\n\/\/ ----------------------------------------------------------------------\n\n    std::string normalize(std::string name);\n\n\/\/ ----------------------------------------------------------------------\n\n    std::string normalize(std::string name);\n\n    using location_func_t = std::string (*)(std::string);\n\n      \/\/ returned cdc abbreviation starts with #\n    inline std::string location(std::string name)\n    {\n        using namespace _internal;\n        std::string location;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            location = m[3].str();\n        else if (std::regex_search(name, m, cdc))\n            location = \"#\" + m[1].str();\n        else\n            THROW(Unrecognized{\"No location in \" + name}, std::string{});\n        return location;\n    }\n\n      \/\/ Faster version of location() for A(H3N2)\/ and A(H1N1)\/ names without host field\n    inline std::string location_human_a(std::string name)\n    {\n        constexpr const size_t prefix_size = 8;\n        return (name.size() > (prefix_size + _internal::international_name_suffix_size) && name[prefix_size - 1] == '\/') ?  _internal::location_human(name, prefix_size) : location(name);\n    }\n\n      \/\/ Faster version of location() for B\/ names without host field\n    inline std::string location_human_b(std::string name)\n    {\n        constexpr const size_t prefix_size = 2;\n        return (name.size() > (prefix_size + _internal::international_name_suffix_size) && name[prefix_size - 1] == '\/') ?  _internal::location_human(name, prefix_size) : location(name);\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    inline std::string virus_type(std::string name)\n    {\n        using namespace _internal;\n        std::string virus_type;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            virus_type = m[1].str();\n        else\n            THROW(Unrecognized{\"No virus_type in \" + name}, std::string{});\n        return virus_type;\n\n    } \/\/ AntigenSerum::virus_type\n\n\/\/ ----------------------------------------------------------------------\n\n    inline std::string year(std::string name)\n    {\n        using namespace _internal;\n        std::string year;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            year = make_year(m);\n        else\n            THROW(Unrecognized{\"No year in \" + name}, std::string{});\n        return year;\n\n    } \/\/ AntigenSerum::year\n\n\/\/ ----------------------------------------------------------------------\n\n    inline void split(std::string name, std::string& virus_type, std::string& host, std::string& location, std::string& isolation, std::string& year, std::string& passage)\n    {\n        std::smatch m;\n        if (std::regex_match(name, m, _internal::international)) {\n            virus_type = m[1].str();\n            host = m[2].str();\n            location = m[3].str();\n            isolation = m[4].str();\n            year = _internal::make_year(m);\n            passage = m[7].str();\n        }\n        else\n            THROW_OR_VOID(Unrecognized{\"Cannot split \" + name});\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n      \/\/ Extracts virus name without passage, reassortant, extra,\n      \/\/ etc. and calculates match threshold (to use with\n      \/\/ acmacs_chart::Antigens::find_by_name_matching), match threshold is a square\n      \/\/ of virus name length.\n    inline size_t match_threshold(std::string name)\n    {\n        size_t result = 0;\n        std::smatch m;\n        if (std::regex_search(name, m, _internal::international_name)) {\n              \/\/ find end of year (m[6])\n            const auto end_of_year_offset = static_cast<size_t>(m[6].second - name.begin());\n            result = end_of_year_offset * end_of_year_offset;\n              \/\/ std::cerr << \"INFO: match_threshold: end_of_year_offset:\" << end_of_year_offset << \" name:\" << name << std::endl;\n        }\n        return result;\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>virus_name::name(full_name)<commit_after>#pragma once\n\n#include <exception>\n#include <regex>\n#include <iostream>\n\n#include \"acmacs-base\/throw.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace virus_name\n{\n    namespace _internal\n    {\n#pragma GCC diagnostic push\n#ifdef __clang__\n#pragma GCC diagnostic ignored \"-Wglobal-constructors\"\n#pragma GCC diagnostic ignored \"-Wexit-time-destructors\"\n#endif\n\n        const std::regex cdc{\"^([A-Z][A-Z][A-Z]?) \"};\n\n        constexpr const char* re_international_name = \"^(?:([AB][^\/]*)\/)?(?:([^\/]+)\/)?([^\/]{2,})\/0*([^\/]+)\/(19|20)?(\\\\d\\\\d)\";\n        constexpr const char* re_reassortant_passage = \"(?:(?:\\\\s+|__)(.+))?\";\n\n          \/\/ [1] - type+subtype, [2] - host, [3] - location, [4] - isolation-number (omitting leading zeros), [5] - century, [6] - year (2 last digit), [7] - reassortant and passage\n          \/\/ const std::regex international{\"^([AB][^\/]*)\/(?:([^\/]+)\/)?([^\/]+)\/0*([^\/]+)\/(19|20)?(\\\\d\\\\d)(?:(?:\\\\s+|__)(.+))?$\"};\n        const std::regex international{std::string(re_international_name) + re_reassortant_passage + \"$\"};\n        const std::regex international_name{re_international_name};\n\n        const std::regex passage_after_name{\" (MDCK|SIAT|MK|E|X)[X\\\\?\\\\d]\"}; \/\/ to extract cdc name only! NOT to extract passage!\n\n#pragma GCC diagnostic pop\n\n        inline std::string make_year(const std::smatch& m)\n        {\n            std::string year;\n            if (m[5].length())\n                year = m[5].str() + m[6].str();\n            else if (m[6].str()[0] > '2')\n                year = \"19\" + m[6].str();\n            else\n                year = \"20\" + m[6].str();\n            return year;\n        }\n\n        constexpr const size_t international_name_suffix_size = 9; \/\/ len(lo\/isolation-number\/year) >= 9\n\n        inline std::string location_human(std::string name, size_t prefix_size)\n        {\n            const auto end = name.find('\/', prefix_size);\n            return name.substr(prefix_size, end - prefix_size);\n        }\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    class Unrecognized : public std::runtime_error { public: using std::runtime_error::runtime_error; };\n\n\/\/ ----------------------------------------------------------------------\n\n    std::string normalize(std::string name);\n\n\/\/ ----------------------------------------------------------------------\n\n      \/\/ Extracts virus name without passage, reassortant, extra, etc.\n    inline std::string_view name(const std::string& aFullName) \/\/ pass by reference! because we return string_view to it\n    {\n        std::smatch m;\n        if (std::regex_search(aFullName, m, _internal::international_name)) {\n            return {aFullName.data(), static_cast<size_t>(m.length())};\n        }\n        else if (std::regex_search(aFullName, m, _internal::passage_after_name)) { \/\/ works for cdc name without extra and without reassortant (cdc names usually do not have reassortant)\n            return {aFullName.data(), static_cast<size_t>(m.position())};\n        }\n        else {\n            return aFullName;   \/\/ failed to split, perhaps cdc name without passage\n        }\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    using location_func_t = std::string (*)(std::string);\n\n      \/\/ returned cdc abbreviation starts with #\n    inline std::string location(std::string name)\n    {\n        using namespace _internal;\n        std::string location;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            location = m[3].str();\n        else if (std::regex_search(name, m, cdc))\n            location = \"#\" + m[1].str();\n        else\n            THROW(Unrecognized{\"No location in \" + name}, std::string{});\n        return location;\n    }\n\n      \/\/ Faster version of location() for A(H3N2)\/ and A(H1N1)\/ names without host field\n    inline std::string location_human_a(std::string name)\n    {\n        constexpr const size_t prefix_size = 8;\n        return (name.size() > (prefix_size + _internal::international_name_suffix_size) && name[prefix_size - 1] == '\/') ?  _internal::location_human(name, prefix_size) : location(name);\n    }\n\n      \/\/ Faster version of location() for B\/ names without host field\n    inline std::string location_human_b(std::string name)\n    {\n        constexpr const size_t prefix_size = 2;\n        return (name.size() > (prefix_size + _internal::international_name_suffix_size) && name[prefix_size - 1] == '\/') ?  _internal::location_human(name, prefix_size) : location(name);\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    inline std::string_view virus_type(const std::string& name) \/\/ pass by reference! because we return string_view to it\n    {\n        std::smatch m;\n        if (std::regex_match(name, m, _internal::international))\n            return {name.data() + m.position(1), static_cast<size_t>(m.length(1))};\n        THROW(Unrecognized(\"No virus_type in \" + name), std::string_view(name.data(), 0U));\n\n    } \/\/ AntigenSerum::virus_type\n\n\/\/ ----------------------------------------------------------------------\n\n    inline std::string year(std::string name)\n    {\n        std::smatch m;\n        if (std::regex_match(name, m, _internal::international))\n            return _internal::make_year(m);\n        THROW(Unrecognized(\"No year in \" + name), std::string{});\n\n    } \/\/ AntigenSerum::year\n\n\/\/ ----------------------------------------------------------------------\n\n    inline void split(std::string name, std::string& virus_type, std::string& host, std::string& location, std::string& isolation, std::string& year, std::string& passage)\n    {\n        std::smatch m;\n        if (std::regex_match(name, m, _internal::international)) {\n            virus_type = m[1].str();\n            host = m[2].str();\n            location = m[3].str();\n            isolation = m[4].str();\n            year = _internal::make_year(m);\n            passage = m[7].str();\n        }\n        else\n            THROW_OR_VOID(Unrecognized{\"Cannot split \" + name});\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n      \/\/ Extracts virus name without passage, reassortant, extra,\n      \/\/ etc. and calculates match threshold (to use with\n      \/\/ acmacs_chart::Antigens::find_by_name_matching), match threshold is a square\n      \/\/ of virus name length.\n    inline size_t match_threshold(std::string name)\n    {\n        size_t result = 0;\n        std::smatch m;\n        if (std::regex_search(name, m, _internal::international_name)) {\n              \/\/ find end of year (m[6])\n            const auto end_of_year_offset = static_cast<size_t>(m[6].second - name.begin());\n            result = end_of_year_offset * end_of_year_offset;\n              \/\/ std::cerr << \"INFO: match_threshold: end_of_year_offset:\" << end_of_year_offset << \" name:\" << name << std::endl;\n        }\n        return result;\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>#include <bits\/stdc++.h>\nusing namespace std;\nint iteration(vector<int> array, int n){\n\tint iter = array.size();\n\tint t_ele = array[0];\n\tarray.erase(array.begin());\n\tarray.push_back(n);\n\tint cnt = array.size();\n\tfor(int i=0;i<t_ele-cnt;i++){\n\t\tint e;\n\t\tcin >> e;\n\t\tarray.push_back(e);\n\t}\n\n\tvector<int> temp(array.size(),0);\n\tfor(int i=0;i<iter;i++){\n\t\tadjacent_difference(array.begin(),array.end(),temp.begin());\n\t\tarray = temp;\n\t\tif(array.size()>1)\t\n\t\t\tarray.erase(array.begin());\n\t}\n\treturn accumulate(array.begin(),array.end(),0);\n}\n\nint main(){\n\tint n;\n\tvector<int> vec;\n\tcin >> n;\t\/\/no of iterations\n\tfor(int i=0;i<n;i++){\t\/\/first ele is number of elements\n\t\tint temp;\n\t\tcin >> temp;\n\t\tvec.push_back(temp);\n\t}\n\n\tcin >> n;\t\/\/iteration+1th number\n\tcout << iteration(vec, n);\n}\n<commit_msg>changed bat script to throw away unneeded output<commit_after>#include <bits\/stdc++.h>\nusing namespace std;\nnt iteration(vector<int> array, int n){\n\tint iter = array.size();\n\tint t_ele = array[0];\n\tarray.erase(array.begin());\n\tarray.push_back(n);\n\tint cnt = array.size();\n\tfor(int i=0;i<t_ele-cnt;i++){\n\t\tint e;\n\t\tcin >> e;\n\t\tarray.push_back(e);\n\t}\n\n\tvector<int> temp(array.size(),0);\n\tfor(int i=0;i<iter;i++){\n\t\tadjacent_difference(array.begin(),array.end(),temp.begin());\n\t\tarray = temp;\n\t\tif(array.size()>1)\t\n\t\t\tarray.erase(array.begin());\n\t}\n\treturn accumulate(array.begin(),array.end(),0);\n}\n\nint main(){\n\tint n;\n\tvector<int> vec;\n\tcin >> n;\t\/\/no of iterations\n\tfor(int i=0;i<n;i++){\t\/\/first ele is number of elements\n\t\tint temp;\n\t\tcin >> temp;\n\t\tvec.push_back(temp);\n\t}\n\n\tcin >> n;\t\/\/iteration+1th number\n\tcout << iteration(vec, n);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 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 \"bitcoinrpc.h\"\n#include \"main.h\"\n#include <atomic>\n\n#include <algorithm>\n\nusing namespace json_spirit;\nusing namespace std;\n\nextern void TxToJSON(const CTransaction& tx, const uint256 hashBlock, json_spirit::Object& entry);\nextern enum Checkpoints::CPMode CheckpointsMode;\n\ndouble GetDifficulty(const CBlockIndex* blockindex)\n{\n    \/\/ Floating point number that is a multiple of the minimum difficulty,\n    \/\/ minimum difficulty = 1.0.\n    if (blockindex == NULL) {\n        if (pindexBest == NULL)\n            return 1.0;\n        else\n            blockindex = GetLastBlockIndex(pindexBest.get(), false);\n    }\n\n    int nShift = (blockindex->nBits >> 24) & 0xff;\n\n    double dDiff = (double)0x0000ffff \/ (double)(blockindex->nBits & 0x00ffffff);\n\n    while (nShift < 29) {\n        dDiff *= 256.0;\n        nShift++;\n    }\n    while (nShift > 29) {\n        dDiff \/= 256.0;\n        nShift--;\n    }\n\n    return dDiff;\n}\n\ndouble GetPoWMHashPS()\n{\n    if (boost::atomic_load(&pindexBest)->nHeight >= LAST_POW_BLOCK)\n        return 0;\n\n    int     nPoWInterval          = 72;\n    int64_t nTargetSpacingWorkMin = 30, nTargetSpacingWork = 30;\n\n    CBlockIndexSmartPtr pindex         = boost::atomic_load(&pindexGenesisBlock);\n    CBlockIndexSmartPtr pindexPrevWork = boost::atomic_load(&pindexGenesisBlock);\n\n    while (pindex) {\n        if (pindex->IsProofOfWork()) {\n            int64_t nActualSpacingWork = pindex->GetBlockTime() - pindexPrevWork->GetBlockTime();\n            nTargetSpacingWork =\n                ((nPoWInterval - 1) * nTargetSpacingWork + nActualSpacingWork + nActualSpacingWork) \/\n                (nPoWInterval + 1);\n            nTargetSpacingWork = max(nTargetSpacingWork, nTargetSpacingWorkMin);\n            pindexPrevWork     = pindex;\n        }\n\n        pindex = atomic_load(&pindex->pnext);\n    }\n\n    return GetDifficulty() * 4294.967296 \/ nTargetSpacingWork;\n}\n\ndouble GetPoSKernelPS()\n{\n    int    nPoSInterval          = 72;\n    double dStakeKernelsTriedAvg = 0;\n    int    nStakesHandled = 0, nStakesTime = 0;\n\n    CBlockIndexSmartPtr pindex = pindexBest;\n\n    CBlockIndexSmartPtr pindexPrevStake = nullptr;\n\n    while (pindex && nStakesHandled < nPoSInterval) {\n        if (pindex->IsProofOfStake()) {\n            dStakeKernelsTriedAvg += GetDifficulty(pindex.get()) * 4294967296.0;\n            nStakesTime += pindexPrevStake ? (pindexPrevStake->nTime - pindex->nTime) : 0;\n            pindexPrevStake = pindex;\n            nStakesHandled++;\n        }\n\n        pindex = pindex->pprev;\n    }\n\n    return nStakesTime ? dStakeKernelsTriedAvg \/ nStakesTime : 0;\n}\n\nObject blockToJSON(const CBlock& block, const CBlockIndex* blockindex, bool fPrintTransactionDetail)\n{\n    Object result;\n    result.push_back(Pair(\"hash\", block.GetHash().GetHex()));\n    CMerkleTx txGen(block.vtx[0]);\n    txGen.SetMerkleBranch(&block);\n    result.push_back(Pair(\"confirmations\", (int)txGen.GetDepthInMainChain()));\n    result.push_back(Pair(\"size\", (int)::GetSerializeSize(block, SER_NETWORK, PROTOCOL_VERSION)));\n    result.push_back(Pair(\"height\", blockindex->nHeight));\n    result.push_back(Pair(\"version\", block.nVersion));\n    result.push_back(Pair(\"merkleroot\", block.hashMerkleRoot.GetHex()));\n    result.push_back(Pair(\"mint\", ValueFromAmount(blockindex->nMint)));\n    result.push_back(Pair(\"time\", (int64_t)block.GetBlockTime()));\n    result.push_back(Pair(\"nonce\", (uint64_t)block.nNonce));\n    result.push_back(Pair(\"bits\", strprintf(\"%08x\", block.nBits)));\n    result.push_back(Pair(\"difficulty\", GetDifficulty(blockindex)));\n    result.push_back(Pair(\"blocktrust\", leftTrim(blockindex->GetBlockTrust().GetHex(), '0')));\n    result.push_back(Pair(\"chaintrust\", leftTrim(blockindex->nChainTrust.GetHex(), '0')));\n    if (blockindex->pprev)\n        result.push_back(Pair(\"previousblockhash\", blockindex->pprev->GetBlockHash().GetHex()));\n    if (blockindex->pnext)\n        result.push_back(Pair(\"nextblockhash\", blockindex->pnext->GetBlockHash().GetHex()));\n\n    result.push_back(Pair(\n        \"flags\", strprintf(\"%s%s\", blockindex->IsProofOfStake() ? \"proof-of-stake\" : \"proof-of-work\",\n                           blockindex->GeneratedStakeModifier() ? \" stake-modifier\" : \"\")));\n    result.push_back(Pair(\"proofhash\", blockindex->hashProof.GetHex()));\n    result.push_back(Pair(\"entropybit\", (int)blockindex->GetStakeEntropyBit()));\n    result.push_back(Pair(\"modifier\", strprintf(\"%016\" PRIx64, blockindex->nStakeModifier)));\n    result.push_back(Pair(\"modifierchecksum\", strprintf(\"%08x\", blockindex->nStakeModifierChecksum)));\n    Array txinfo;\n    BOOST_FOREACH (const CTransaction& tx, block.vtx) {\n        if (fPrintTransactionDetail) {\n            Object entry;\n\n            TxToJSON(tx, 0, entry);\n\n            txinfo.push_back(entry);\n        } else\n            txinfo.push_back(tx.GetHash().GetHex());\n    }\n\n    result.push_back(Pair(\"tx\", txinfo));\n\n    if (block.IsProofOfStake())\n        result.push_back(Pair(\"signature\", HexStr(block.vchBlockSig.begin(), block.vchBlockSig.end())));\n\n    return result;\n}\n\nValue getbestblockhash(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getbestblockhash\\n\"\n                            \"Returns the hash of the best block in the longest block chain.\");\n\n    return hashBestChain.GetHex();\n}\n\nValue getblockcount(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getblockcount\\n\"\n                            \"Returns the number of blocks in the longest block chain.\");\n\n    return nBestHeight.load();\n}\n\nValue getdifficulty(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getdifficulty\\n\"\n                            \"Returns the difficulty as a multiple of the minimum difficulty.\");\n\n    Object obj;\n    obj.push_back(Pair(\"proof-of-work\", GetDifficulty()));\n    obj.push_back(Pair(\"proof-of-stake\", GetDifficulty(GetLastBlockIndex(pindexBest.get(), true))));\n    obj.push_back(Pair(\"search-interval\", (int)nLastCoinStakeSearchInterval));\n    return obj;\n}\n\nValue settxfee(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 1 || AmountFromValue(params[0]) < MIN_TX_FEE)\n        throw runtime_error(\"settxfee <amount>\\n\"\n                            \"<amount> is a real and is rounded to the nearest 0.01\");\n\n    nTransactionFee = AmountFromValue(params[0]);\n    nTransactionFee = (nTransactionFee \/ MIN_TX_FEE) * MIN_TX_FEE; \/\/ round to nearest 0.0001\n\n    return true;\n}\n\nValue getrawmempool(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getrawmempool\\n\"\n                            \"Returns all transaction ids in memory pool.\");\n\n    vector<uint256> vtxid;\n    mempool.queryHashes(vtxid);\n\n    Array a;\n    BOOST_FOREACH (const uint256& hash, vtxid)\n        a.push_back(hash.ToString());\n\n    return a;\n}\n\nValue getblockhash(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 1)\n        throw runtime_error(\"getblockhash <index>\\n\"\n                            \"Returns hash of block in best-block-chain at <index>.\");\n\n    int nHeight = params[0].get_int();\n    if (nHeight < 0 || nHeight > nBestHeight)\n        throw runtime_error(\"Block number out of range.\");\n\n    CBlockIndexSmartPtr pblockindex = FindBlockByHeight(nHeight);\n    return pblockindex->phashBlock->GetHex();\n}\n\n\/\/ Experimentally deprecated in an effort to support the getblock() call electrum requires\n\/\/ Value getblock(const Array& params, bool fHelp)\n\/\/ {\n\/\/     if (fHelp || params.size() < 1 || params.size() > 2)\n\/\/         throw runtime_error(\n\/\/             \"getblock <hash> [txinfo]\\n\"\n\/\/             \"txinfo optional to print more detailed tx info\\n\"\n\/\/             \"Returns details of a block with given block-hash.\");\n\n\/\/     std::string strHash = params[0].get_str();\n\/\/     uint256 hash(strHash);\n\n\/\/     if (mapBlockIndex.count(hash) == 0)\n\/\/         throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, \"Block not found\");\n\n\/\/     CBlock block;\n\/\/     CBlockIndex* pblockindex = mapBlockIndex[hash];\n\/\/     block.ReadFromDisk(pblockindex, true);\n\n\/\/     return blockToJSON(block, pblockindex, params.size() > 1 ? params[1].get_bool() : false);\n\/\/ }\n\nValue getblock(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 3)\n        throw runtime_error(\n            \"getblock <hash> [verbose=true] [showtxns=false]\\n\"\n            \"If verbose is false, returns a string that is serialized, hex-encoded data for block \"\n            \"<hash>.\\n\"\n            \"If verbose is true, returns an Object with information about block <hash> .\\n\"\n            \"If verbose is true and showtxns is true, also returns Object about each transaction.\");\n\n    std::string strHash = params[0].get_str();\n    uint256     hash(strHash);\n\n    bool fVerbose = true;\n    if (params.size() > 1)\n        fVerbose = params[1].get_bool();\n\n    bool fShowTxns = false;\n    if (params.size() > 2)\n        fShowTxns = params[2].get_bool();\n\n    if (mapBlockIndex.count(hash) == 0)\n        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, \"Block not found\");\n\n    CBlock       block;\n    CBlockIndex* pblockindex = boost::atomic_load(&mapBlockIndex[hash]).get();\n    block.ReadFromDisk(pblockindex, true);\n\n    if (!fVerbose) {\n        CDataStream ssBlock(SER_NETWORK, PROTOCOL_VERSION);\n        ssBlock << block;\n        std::string strHex = HexStr(ssBlock.begin(), ssBlock.end());\n        return strHex;\n    }\n\n    return blockToJSON(block, pblockindex, fShowTxns);\n}\n\nValue getblockbynumber(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 2)\n        throw runtime_error(\"getblockbynumber <number> [txinfo]\\n\"\n                            \"txinfo optional to print more detailed tx info\\n\"\n                            \"Returns details of a block with given block-number.\");\n\n    int nHeight = params[0].get_int();\n    if (nHeight < 0 || nHeight > nBestHeight)\n        throw runtime_error(\"Block number out of range.\");\n\n    CBlock              block;\n    CBlockIndexSmartPtr pblockindex = boost::atomic_load(&mapBlockIndex[hashBestChain]);\n    while (pblockindex->nHeight > nHeight)\n        pblockindex = pblockindex->pprev;\n\n    uint256 hash = *pblockindex->phashBlock;\n\n    pblockindex = boost::atomic_load(&mapBlockIndex[hash]);\n    block.ReadFromDisk(pblockindex.get(), true);\n\n    return blockToJSON(block, pblockindex.get(), params.size() > 1 ? params[1].get_bool() : false);\n}\n\n\/\/ ppcoin: get information of sync-checkpoint\nValue getcheckpoint(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getcheckpoint\\n\"\n                            \"Show info of synchronized checkpoint.\\n\");\n\n    Object       result;\n    CBlockIndex* pindexCheckpoint;\n\n    result.push_back(Pair(\"synccheckpoint\", Checkpoints::hashSyncCheckpoint.ToString().c_str()));\n    pindexCheckpoint = boost::atomic_load(&mapBlockIndex[Checkpoints::hashSyncCheckpoint]).get();\n    result.push_back(Pair(\"height\", pindexCheckpoint->nHeight));\n    result.push_back(Pair(\"timestamp\", DateTimeStrFormat(pindexCheckpoint->GetBlockTime()).c_str()));\n\n    \/\/ Check that the block satisfies synchronized checkpoint\n    if (CheckpointsMode == Checkpoints::STRICT)\n        result.push_back(Pair(\"policy\", \"strict\"));\n\n    if (CheckpointsMode == Checkpoints::ADVISORY)\n        result.push_back(Pair(\"policy\", \"advisory\"));\n\n    if (CheckpointsMode == Checkpoints::PERMISSIVE)\n        result.push_back(Pair(\"policy\", \"permissive\"));\n\n    if (mapArgs.exists(\"-checkpointkey\"))\n        result.push_back(Pair(\"checkpointmaster\", true));\n\n    return result;\n}\n\nValue exportblockchain(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 1)\n        throw runtime_error(\"exportblockchain <path-dir>\\n\"\n                            \"Exports the blockchain bootstrap.dat file to <path-dir>.\\n\"\n                            \"<path-dir> must be a directory that exists.\");\n\n    boost::filesystem::path bdir(params[0].get_str());\n    if (!boost::filesystem::exists(bdir))\n        throw runtime_error(\"Directory \" + bdir.string() + \" does not exist.\");\n\n    boost::filesystem::path filename = bdir \/ \"bootstrap.dat\";\n\n    boost::promise<void>       finished;\n    boost::unique_future<void> finished_future = finished.get_future();\n    std::atomic<bool>          stopped{false};\n    std::atomic<double>        progress{false};\n    boost::thread              exporterThread(boost::bind(&ExportBootstrapBlockchain, filename.string(),\n                                             boost::ref(stopped), boost::ref(progress),\n                                             boost::ref(finished)));\n    exporterThread.detach();\n\n    printf(\"Export blockchain to path started in another thread. Writing to path: %s\\n\",\n           filename.string().c_str());\n\n    int progVal            = 0;\n    int lastPrintedProgVal = -1;\n    while (!finished_future.is_ready()) {\n        progVal = static_cast<int>(progress.load() * 100);\n        if (progVal > lastPrintedProgVal) {\n            printf(\"Export blockchain progress: %i%%\\n\", progVal);\n            lastPrintedProgVal = progVal;\n        }\n        boost::this_thread::sleep_for(boost::chrono::milliseconds(10));\n        if (fShutdown) {\n            stopped.store(true);\n        }\n    }\n\n    finished_future.get(); \/\/ throws, but that's compatible with exception handle in this function\n\n    printf(\"Export blockchain to path %s is done.\\n\", filename.string().c_str());\n\n    return Value();\n}\n<commit_msg>Added RPC options for exporting the blockchain with orphans<commit_after>\/\/ Copyright (c) 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 \"bitcoinrpc.h\"\n#include \"main.h\"\n#include <atomic>\n\n#include <algorithm>\n\nusing namespace json_spirit;\nusing namespace std;\n\nextern void TxToJSON(const CTransaction& tx, const uint256 hashBlock, json_spirit::Object& entry);\nextern enum Checkpoints::CPMode CheckpointsMode;\n\ndouble GetDifficulty(const CBlockIndex* blockindex)\n{\n    \/\/ Floating point number that is a multiple of the minimum difficulty,\n    \/\/ minimum difficulty = 1.0.\n    if (blockindex == NULL) {\n        if (pindexBest == NULL)\n            return 1.0;\n        else\n            blockindex = GetLastBlockIndex(pindexBest.get(), false);\n    }\n\n    int nShift = (blockindex->nBits >> 24) & 0xff;\n\n    double dDiff = (double)0x0000ffff \/ (double)(blockindex->nBits & 0x00ffffff);\n\n    while (nShift < 29) {\n        dDiff *= 256.0;\n        nShift++;\n    }\n    while (nShift > 29) {\n        dDiff \/= 256.0;\n        nShift--;\n    }\n\n    return dDiff;\n}\n\ndouble GetPoWMHashPS()\n{\n    if (boost::atomic_load(&pindexBest)->nHeight >= LAST_POW_BLOCK)\n        return 0;\n\n    int     nPoWInterval          = 72;\n    int64_t nTargetSpacingWorkMin = 30, nTargetSpacingWork = 30;\n\n    CBlockIndexSmartPtr pindex         = boost::atomic_load(&pindexGenesisBlock);\n    CBlockIndexSmartPtr pindexPrevWork = boost::atomic_load(&pindexGenesisBlock);\n\n    while (pindex) {\n        if (pindex->IsProofOfWork()) {\n            int64_t nActualSpacingWork = pindex->GetBlockTime() - pindexPrevWork->GetBlockTime();\n            nTargetSpacingWork =\n                ((nPoWInterval - 1) * nTargetSpacingWork + nActualSpacingWork + nActualSpacingWork) \/\n                (nPoWInterval + 1);\n            nTargetSpacingWork = max(nTargetSpacingWork, nTargetSpacingWorkMin);\n            pindexPrevWork     = pindex;\n        }\n\n        pindex = atomic_load(&pindex->pnext);\n    }\n\n    return GetDifficulty() * 4294.967296 \/ nTargetSpacingWork;\n}\n\ndouble GetPoSKernelPS()\n{\n    int    nPoSInterval          = 72;\n    double dStakeKernelsTriedAvg = 0;\n    int    nStakesHandled = 0, nStakesTime = 0;\n\n    CBlockIndexSmartPtr pindex = pindexBest;\n\n    CBlockIndexSmartPtr pindexPrevStake = nullptr;\n\n    while (pindex && nStakesHandled < nPoSInterval) {\n        if (pindex->IsProofOfStake()) {\n            dStakeKernelsTriedAvg += GetDifficulty(pindex.get()) * 4294967296.0;\n            nStakesTime += pindexPrevStake ? (pindexPrevStake->nTime - pindex->nTime) : 0;\n            pindexPrevStake = pindex;\n            nStakesHandled++;\n        }\n\n        pindex = pindex->pprev;\n    }\n\n    return nStakesTime ? dStakeKernelsTriedAvg \/ nStakesTime : 0;\n}\n\nObject blockToJSON(const CBlock& block, const CBlockIndex* blockindex, bool fPrintTransactionDetail)\n{\n    Object result;\n    result.push_back(Pair(\"hash\", block.GetHash().GetHex()));\n    CMerkleTx txGen(block.vtx[0]);\n    txGen.SetMerkleBranch(&block);\n    result.push_back(Pair(\"confirmations\", (int)txGen.GetDepthInMainChain()));\n    result.push_back(Pair(\"size\", (int)::GetSerializeSize(block, SER_NETWORK, PROTOCOL_VERSION)));\n    result.push_back(Pair(\"height\", blockindex->nHeight));\n    result.push_back(Pair(\"version\", block.nVersion));\n    result.push_back(Pair(\"merkleroot\", block.hashMerkleRoot.GetHex()));\n    result.push_back(Pair(\"mint\", ValueFromAmount(blockindex->nMint)));\n    result.push_back(Pair(\"time\", (int64_t)block.GetBlockTime()));\n    result.push_back(Pair(\"nonce\", (uint64_t)block.nNonce));\n    result.push_back(Pair(\"bits\", strprintf(\"%08x\", block.nBits)));\n    result.push_back(Pair(\"difficulty\", GetDifficulty(blockindex)));\n    result.push_back(Pair(\"blocktrust\", leftTrim(blockindex->GetBlockTrust().GetHex(), '0')));\n    result.push_back(Pair(\"chaintrust\", leftTrim(blockindex->nChainTrust.GetHex(), '0')));\n    if (blockindex->pprev)\n        result.push_back(Pair(\"previousblockhash\", blockindex->pprev->GetBlockHash().GetHex()));\n    if (blockindex->pnext)\n        result.push_back(Pair(\"nextblockhash\", blockindex->pnext->GetBlockHash().GetHex()));\n\n    result.push_back(Pair(\n        \"flags\", strprintf(\"%s%s\", blockindex->IsProofOfStake() ? \"proof-of-stake\" : \"proof-of-work\",\n                           blockindex->GeneratedStakeModifier() ? \" stake-modifier\" : \"\")));\n    result.push_back(Pair(\"proofhash\", blockindex->hashProof.GetHex()));\n    result.push_back(Pair(\"entropybit\", (int)blockindex->GetStakeEntropyBit()));\n    result.push_back(Pair(\"modifier\", strprintf(\"%016\" PRIx64, blockindex->nStakeModifier)));\n    result.push_back(Pair(\"modifierchecksum\", strprintf(\"%08x\", blockindex->nStakeModifierChecksum)));\n    Array txinfo;\n    BOOST_FOREACH (const CTransaction& tx, block.vtx) {\n        if (fPrintTransactionDetail) {\n            Object entry;\n\n            TxToJSON(tx, 0, entry);\n\n            txinfo.push_back(entry);\n        } else\n            txinfo.push_back(tx.GetHash().GetHex());\n    }\n\n    result.push_back(Pair(\"tx\", txinfo));\n\n    if (block.IsProofOfStake())\n        result.push_back(Pair(\"signature\", HexStr(block.vchBlockSig.begin(), block.vchBlockSig.end())));\n\n    return result;\n}\n\nValue getbestblockhash(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getbestblockhash\\n\"\n                            \"Returns the hash of the best block in the longest block chain.\");\n\n    return hashBestChain.GetHex();\n}\n\nValue getblockcount(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getblockcount\\n\"\n                            \"Returns the number of blocks in the longest block chain.\");\n\n    return nBestHeight.load();\n}\n\nValue getdifficulty(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getdifficulty\\n\"\n                            \"Returns the difficulty as a multiple of the minimum difficulty.\");\n\n    Object obj;\n    obj.push_back(Pair(\"proof-of-work\", GetDifficulty()));\n    obj.push_back(Pair(\"proof-of-stake\", GetDifficulty(GetLastBlockIndex(pindexBest.get(), true))));\n    obj.push_back(Pair(\"search-interval\", (int)nLastCoinStakeSearchInterval));\n    return obj;\n}\n\nValue settxfee(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 1 || AmountFromValue(params[0]) < MIN_TX_FEE)\n        throw runtime_error(\"settxfee <amount>\\n\"\n                            \"<amount> is a real and is rounded to the nearest 0.01\");\n\n    nTransactionFee = AmountFromValue(params[0]);\n    nTransactionFee = (nTransactionFee \/ MIN_TX_FEE) * MIN_TX_FEE; \/\/ round to nearest 0.0001\n\n    return true;\n}\n\nValue getrawmempool(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getrawmempool\\n\"\n                            \"Returns all transaction ids in memory pool.\");\n\n    vector<uint256> vtxid;\n    mempool.queryHashes(vtxid);\n\n    Array a;\n    BOOST_FOREACH (const uint256& hash, vtxid)\n        a.push_back(hash.ToString());\n\n    return a;\n}\n\nValue getblockhash(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 1)\n        throw runtime_error(\"getblockhash <index>\\n\"\n                            \"Returns hash of block in best-block-chain at <index>.\");\n\n    int nHeight = params[0].get_int();\n    if (nHeight < 0 || nHeight > nBestHeight)\n        throw runtime_error(\"Block number out of range.\");\n\n    CBlockIndexSmartPtr pblockindex = FindBlockByHeight(nHeight);\n    return pblockindex->phashBlock->GetHex();\n}\n\n\/\/ Experimentally deprecated in an effort to support the getblock() call electrum requires\n\/\/ Value getblock(const Array& params, bool fHelp)\n\/\/ {\n\/\/     if (fHelp || params.size() < 1 || params.size() > 2)\n\/\/         throw runtime_error(\n\/\/             \"getblock <hash> [txinfo]\\n\"\n\/\/             \"txinfo optional to print more detailed tx info\\n\"\n\/\/             \"Returns details of a block with given block-hash.\");\n\n\/\/     std::string strHash = params[0].get_str();\n\/\/     uint256 hash(strHash);\n\n\/\/     if (mapBlockIndex.count(hash) == 0)\n\/\/         throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, \"Block not found\");\n\n\/\/     CBlock block;\n\/\/     CBlockIndex* pblockindex = mapBlockIndex[hash];\n\/\/     block.ReadFromDisk(pblockindex, true);\n\n\/\/     return blockToJSON(block, pblockindex, params.size() > 1 ? params[1].get_bool() : false);\n\/\/ }\n\nValue getblock(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 3)\n        throw runtime_error(\n            \"getblock <hash> [verbose=true] [showtxns=false]\\n\"\n            \"If verbose is false, returns a string that is serialized, hex-encoded data for block \"\n            \"<hash>.\\n\"\n            \"If verbose is true, returns an Object with information about block <hash> .\\n\"\n            \"If verbose is true and showtxns is true, also returns Object about each transaction.\");\n\n    std::string strHash = params[0].get_str();\n    uint256     hash(strHash);\n\n    bool fVerbose = true;\n    if (params.size() > 1)\n        fVerbose = params[1].get_bool();\n\n    bool fShowTxns = false;\n    if (params.size() > 2)\n        fShowTxns = params[2].get_bool();\n\n    if (mapBlockIndex.count(hash) == 0)\n        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, \"Block not found\");\n\n    CBlock       block;\n    CBlockIndex* pblockindex = boost::atomic_load(&mapBlockIndex[hash]).get();\n    block.ReadFromDisk(pblockindex, true);\n\n    if (!fVerbose) {\n        CDataStream ssBlock(SER_NETWORK, PROTOCOL_VERSION);\n        ssBlock << block;\n        std::string strHex = HexStr(ssBlock.begin(), ssBlock.end());\n        return strHex;\n    }\n\n    return blockToJSON(block, pblockindex, fShowTxns);\n}\n\nValue getblockbynumber(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 2)\n        throw runtime_error(\"getblockbynumber <number> [txinfo]\\n\"\n                            \"txinfo optional to print more detailed tx info\\n\"\n                            \"Returns details of a block with given block-number.\");\n\n    int nHeight = params[0].get_int();\n    if (nHeight < 0 || nHeight > nBestHeight)\n        throw runtime_error(\"Block number out of range.\");\n\n    CBlock              block;\n    CBlockIndexSmartPtr pblockindex = boost::atomic_load(&mapBlockIndex[hashBestChain]);\n    while (pblockindex->nHeight > nHeight)\n        pblockindex = pblockindex->pprev;\n\n    uint256 hash = *pblockindex->phashBlock;\n\n    pblockindex = boost::atomic_load(&mapBlockIndex[hash]);\n    block.ReadFromDisk(pblockindex.get(), true);\n\n    return blockToJSON(block, pblockindex.get(), params.size() > 1 ? params[1].get_bool() : false);\n}\n\n\/\/ ppcoin: get information of sync-checkpoint\nValue getcheckpoint(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\"getcheckpoint\\n\"\n                            \"Show info of synchronized checkpoint.\\n\");\n\n    Object       result;\n    CBlockIndex* pindexCheckpoint;\n\n    result.push_back(Pair(\"synccheckpoint\", Checkpoints::hashSyncCheckpoint.ToString().c_str()));\n    pindexCheckpoint = boost::atomic_load(&mapBlockIndex[Checkpoints::hashSyncCheckpoint]).get();\n    result.push_back(Pair(\"height\", pindexCheckpoint->nHeight));\n    result.push_back(Pair(\"timestamp\", DateTimeStrFormat(pindexCheckpoint->GetBlockTime()).c_str()));\n\n    \/\/ Check that the block satisfies synchronized checkpoint\n    if (CheckpointsMode == Checkpoints::STRICT)\n        result.push_back(Pair(\"policy\", \"strict\"));\n\n    if (CheckpointsMode == Checkpoints::ADVISORY)\n        result.push_back(Pair(\"policy\", \"advisory\"));\n\n    if (CheckpointsMode == Checkpoints::PERMISSIVE)\n        result.push_back(Pair(\"policy\", \"permissive\"));\n\n    if (mapArgs.exists(\"-checkpointkey\"))\n        result.push_back(Pair(\"checkpointmaster\", true));\n\n    return result;\n}\n\nValue exportblockchain(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 2) {\n        throw runtime_error(\n            \"exportblockchain <path-dir> [breadth or depth]\\n\"\n            \"Exports the blockchain bootstrap.dat file to <path-dir>.\\n\"\n            \"<path-dir> must be a directory that exists. Ignoring the last parameter \"\n            \"will export a linear version of the blockchain. If you need orphan chains, \"\n            \"you can choose whether traversal is going to be breadth-firsth or depth-first.\");\n    }\n    if (params.size() == 2 && params[1].get_str() != \"breadth\" && params[1].get_str() != \"depth\") {\n        throw runtime_error(\"The second parameter can only be depth or breadth\");\n    }\n\n    boost::optional<GraphTraverseType> graphTraverseType;\n    if (params.size() == 2) {\n        if (params[1].get_str() == \"breadth\") {\n            graphTraverseType = GraphTraverseType::BreadthFirst;\n        } else if (params[1].get_str() == \"depth\") {\n            graphTraverseType = GraphTraverseType::DepthFirst;\n        } else {\n            graphTraverseType.reset();\n        }\n    }\n\n    boost::filesystem::path bdir(params[0].get_str());\n    if (!boost::filesystem::exists(bdir))\n        throw runtime_error(\"Directory \" + bdir.string() + \" does not exist.\");\n\n    boost::filesystem::path filename = bdir \/ \"bootstrap.dat\";\n\n    boost::promise<void>       finished;\n    boost::unique_future<void> finished_future = finished.get_future();\n    std::atomic<bool>          stopped{false};\n    std::atomic<double>        progress{false};\n\n    if (graphTraverseType != boost::none) {\n        \/\/ with orphans\n        boost::thread exporterThread(\n            boost::bind(&ExportBootstrapBlockchainWithOrphans, filename.string(), boost::ref(stopped),\n                        boost::ref(progress), boost::ref(finished), graphTraverseType.value()));\n        exporterThread.detach();\n    } else {\n        \/\/ without orphans\n        boost::thread exporterThread(boost::bind(&ExportBootstrapBlockchain, filename.string(),\n                                                 boost::ref(stopped), boost::ref(progress),\n                                                 boost::ref(finished)));\n        exporterThread.detach();\n    }\n\n    printf(\"Export blockchain to path started in another thread. Writing to path: %s\\n\",\n           filename.string().c_str());\n\n    int progVal            = 0;\n    int lastPrintedProgVal = -1;\n    while (!finished_future.is_ready()) {\n        progVal = static_cast<int>(progress.load() * 100);\n        if (progVal > lastPrintedProgVal) {\n            printf(\"Export blockchain progress: %i%%\\n\", progVal);\n            lastPrintedProgVal = progVal;\n        }\n        boost::this_thread::sleep_for(boost::chrono::milliseconds(10));\n        if (fShutdown) {\n            stopped.store(true);\n        }\n    }\n\n    finished_future.get(); \/\/ throws, but that's compatible with exception handle in this function\n\n    printf(\"Export blockchain to path %s is done.\\n\", filename.string().c_str());\n\n    return Value();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  ex10_07.cpp\n\/\/  Exercise 10.7\n\/\/\n\/\/  Created by pezy on 12\/9\/14.\n\/\/\n\/\/  @Brief  Determine if there are any errors in the following programs and, if so, correct the error(s)\n\n#include <iostream>\n#include <vector>\n#include <list>\n#include <algorithm>\n\nusing std::vector; using std::cout; using std::endl; using std::list; using std::cin; using std::fill_n;\n\ntemplate<typename Sequence>\nvoid print(Sequence const& seq)\n{\n    for (const auto& i : seq)\n        cout << i << \" \";\n    cout << endl;\n}\n\nint main()\n{\n    \/\/ (a)\n    vector<int> vec;\n    list<int> lst;\n    int i;\n    while (cin >> i)\n        lst.push_back(i);\n    vec.resize(lst.size());\n    \/\/ ^ Fixed: added this statement\n    \/\/ Cause Algorithms that write to a destination iterator assume\n    \/\/ the destination is large enough to hold the number of elements being written.\n    copy(lst.cbegin(), lst.cend(), vec.begin());\n    \n    \/\/ (b)\n    vector<int> v;\n    v.reserve(10);\n    fill_n(v.begin(), 10, 0);\n    \/\/ ^ (b)No error, but not any sense. v.size() still equal zero.\n    \/\/ Fixed: 1. use `v.resize(10);`\n    \/\/    or  2. use `fill_n(std::back_inserter(v), 10, 0)`\n    \n    print(v);\n    print(vec);\n}\n<commit_msg>Update ex10_07.cpp<commit_after>\/\/\n\/\/  ex10_07.cpp\n\/\/  Exercise 10.7\n\/\/\n\/\/  Created by pezy on 12\/9\/14.\n\/\/\n\/\/  @Brief  Determine if there are any errors in the following programs and, if so, correct the error(s)\n\n#include <iostream>\n#include <vector>\n#include <list>\n#include <algorithm>\n\nusing std::vector; using std::cout; using std::endl; using std::list; using std::cin; using std::fill_n;\n\ntemplate<typename Sequence>\nvoid print(Sequence const& seq)\n{\n    for (const auto& i : seq)\n        cout << i << \" \";\n    cout << endl;\n}\n\nint main()\n{\n    \/\/ (a)\n    vector<int> vec;\n    list<int> lst;\n    int i;\n    while (cin >> i)\n        lst.push_back(i);\n\n    copy(lst.cbegin(), lst.cend(), back_inserter(vec));\n    \/\/ Fixed: the vec.begin() was replaced by a back_inserter iterator, capable of\n    \/\/ insert new elements automatically at the end of the container.\n    \n    \/\/ (b)\n    vector<int> v;\n    v.reserve(10);\n    fill_n(v.begin(), 10, 0);\n    \/\/ ^ (b)No error, but not any sense. v.size() still equal zero.\n    \/\/ Fixed: 1. use `v.resize(10);`\n    \/\/    or  2. use `fill_n(std::back_inserter(v), 10, 0)`\n    \n    print(v);\n    print(vec);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/! @Alan\n\/\/! Exercise 10.11:\n\/\/! Write a program that uses stable_sort and isShorter to sort a vector passed\n\/\/! to your version of elimDups.\n\/\/! Print the vector to verify that your program is correct.\n\/\/!\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <list>\n\n\/\/! print a container like vector,deque, list,etc.\ntemplate <typename Sequence> inline std::ostream& println(Sequence const& seq)\n{\n    for (auto const& elem : seq) std::cout << elem << \" \";\n    std::cout << std::endl;\n\n    return std::cout;\n}\n\ninline bool is_shorter(std::string const& lhs, std::string const& rhs)\n{\n    return lhs.size() < rhs.size();\n}\n\nvoid elimdups(std::vector<std::string>& vs)\n{\n    std::sort(vs.begin(), vs.end());\n    auto new_end = std::unique(vs.begin(), vs.end());\n    vs.erase(new_end, vs.end());\n}\n\nint main()\n{\n    std::vector<std::string> v{\"1234\", \"1234\", \"1234\", \"Hi\", \"alan\", \"wang\"};\n    elimdups(v);\n    std::stable_sort(v.begin(), v.end(), is_shorter);\n    std::cout << \"ex10.11 :\\n\";\n    println(v);\n\n    return 0;\n}\n\/\/! output\n\/\/ ex10.11 :\n\/\/ Hi 1234 alan\n<commit_msg>Update ex10_11.cpp<commit_after>\/\/! @Alan\n\/\/! Exercise 10.11:\n\/\/! Write a program that uses stable_sort and isShorter to sort a vector passed\n\/\/! to your version of elimDups.\n\/\/! Print the vector to verify that your program is correct.\n\/\/!\n\n#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\n\n\/\/! print a container like vector, deque, list, etc.\ntemplate <typename Sequence>\ninline void println(const Sequence &seq)\n{\n    for(const auto &elem : seq)\n        cout<<elem<<\" \";\n    cout<<endl;\n}\n\ninline bool is_shorter(const string &lhs, const string &rhs)\n{\n    return lhs.size()<rhs.size();\n}\n\nvoid elimdups(vector<string> &svec)\n{\n    sort(svec.begin(), svec.end());\n    auto new_end=unique(svec.begin(), svec.end());\n    svec.erase(new_end, svec.end());\n}\n\nint main()\n{\n    vector<string> svec{\"1234\", \"1234\", \"1234\", \"Hi\", \"alan\", \"wang\"};\n    elimdups(svec);\n    stable_sort(svec.begin(), svec.end(), is_shorter);\n    cout<<\"ex10.11 :\\n\";\n    println(svec);\n}\n\n\/\/! output\n\/\/ ex10.11 :\n\/\/ Hi 1234 alan\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/\/ (Possibly augmented) matrix implementation, represented as a vector of sparse rows.\n\n#include <algorithm>\n#include <utility>\n#include <initializer_list>\n#include <iterator>\n#include <stdexcept>\n#include <vector>\n\nnamespace msparse {\n\nstruct msparse_error: std::runtime_error {\n    msparse_error(const std::string &what): std::runtime_error(what) {}\n};\n\nconstexpr unsigned row_npos = unsigned(-1);\n\n\/\/ `msparse::row` represents one sparse matrix row as a vector of\n\/\/ (column, value) pairs, ordered by (unsigned) column. `row_npos`\n\/\/ is used to represent an invalid column number.\n\ntemplate <typename X>\nclass row {\npublic:\n    struct entry {\n        unsigned col;\n        X value;\n    };\n    static constexpr unsigned npos = row_npos;\n\nprivate:\n    std::vector<entry> data_;\n\n    \/\/ Entries must have strictly monotonically increasing column numbers.\n    bool check_invariant() const {\n        for (unsigned i = 1; i<data_.size(); ++i) {\n            if (data_[i].col<=data_[i-1].col) return false;\n        }\n        return true;\n    }\n\npublic:\n    row() = default;\n    row(const row&) = default;\n\n    row(std::initializer_list<entry> il): data_(il) {\n        if (!check_invariant())\n            throw msparse_error(\"improper row element list\");\n    }\n\n    template <typename InIter>\n    row(InIter b, InIter e): data_(b, e) {\n        if (!check_invariant())\n            throw msparse_error(\"improper row element list\");\n    }\n\n    unsigned size() const { return data_.size(); }\n    bool empty() const { return size()==0; }\n\n    \/\/ Iterators present row as sequence of `entry` objects.\n    auto begin() -> decltype(data_.begin()) { return data_.begin(); }\n    auto begin() const -> decltype(data_.cbegin()) { return data_.cbegin(); }\n    auto end() -> decltype(data_.end()) { return data_.end(); }\n    auto end() const -> decltype(data_.cend()) { return data_.cend(); }\n\n    \/\/ Return column of first (left-most) entry.\n    unsigned mincol() const {\n        return empty()? npos: data_.front().col;\n    }\n\n    \/\/ Return column of first entry with column greater than `c`.\n    unsigned mincol_after(unsigned c) const {\n        auto i = std::upper_bound(data_.begin(), data_.end(), c,\n            [](unsigned a, const entry& b) { return a<b.col; });\n\n        return i==data_.end()? npos: i->col;\n    }\n\n    \/\/ Return column of last (right-most) entry.\n    unsigned maxcol() const {\n        return empty()? npos: data_.back().col;\n    }\n\n    \/\/ As opposed to [] indexing (see below), retrieve `i'th entry from\n    \/\/ the list of entries.\n    const entry& get(unsigned i) const {\n        return data_[i];\n    }\n\n    void push_back(const entry& e) {\n        if (!empty() && e.col <= data_.back().col)\n            throw msparse_error(\"cannot push_back row elements out of order\");\n        data_.push_back(e);\n    }\n\n    \/\/ Return index into entry list which has column `c`.\n    unsigned index(unsigned c) const {\n        auto i = std::lower_bound(data_.begin(), data_.end(), c,\n            [](const entry& a, unsigned b) { return a.col<b; });\n\n        return (i==data_.end() || i->col!=c)? npos: std::distance(data_.begin(), i);\n    }\n\n    \/\/ Remove all entries from column `c` onwards.\n    void truncate(unsigned c) {\n        auto i = std::lower_bound(data_.begin(), data_.end(), c,\n            [](const entry& a, unsigned b) { return a.col<b; });\n        data_.erase(i, data_.end());\n    }\n\n    \/\/ Return value at column `c`; if no entry in row, return default-constructed `X`,\n    \/\/ i.e. 0 for numeric types.\n    X operator[](unsigned c) const {\n        auto i = index(c);\n        return i==npos? X{}: data_[i].value;\n    }\n\n    \/\/ Proxy object to allow assigning elements with the syntax `row[c] = value`.\n    struct assign_proxy {\n        row<X>& row_;\n        unsigned c;\n\n        assign_proxy(row<X>& r, unsigned c): row_(r), c(c) {}\n\n        operator X() const { return const_cast<const row<X>&>(row_)[c]; }\n        assign_proxy& operator=(const X& x) {\n            auto i = std::lower_bound(row_.data_.begin(), row_.data_.end(), c,\n                [](const entry& a, unsigned b) { return a.col<b; });\n\n            if (i==row_.data_.end() || i->col!=c) {\n                row_.data_.insert(i, {c, x});\n            }\n            else if (x == X{}) {\n                row_.data_.erase(i);\n            }\n            else {\n                i->value = x;\n            }\n\n            return *this;\n        }\n    };\n\n    assign_proxy operator[](unsigned c) {\n        return assign_proxy{*this, c};\n    }\n};\n\n\/\/ `msparse::matrix` represents a matrix by a size (number of rows,\n\/\/ columns) and vector of sparse `mspase::row` rows.\n\/\/\n\/\/ The matrix may also be 'augmented', with columns corresponding to a second\n\/\/ matrix appended on the right.\n\ntemplate <typename X>\nclass matrix {\nprivate:\n    std::vector<row<X>> rows;\n    unsigned cols = 0;\n    unsigned aug = row_npos;\n\npublic:\n    static constexpr unsigned npos = row_npos;\n\n    matrix() = default;\n    matrix(unsigned n, unsigned c): rows(n), cols(c) {}\n\n    row<X>& operator[](unsigned i) { return rows[i]; }\n    const row<X>& operator[](unsigned i) const { return rows[i]; }\n\n    unsigned size() const { return rows.size(); }\n    unsigned nrow() const { return size(); }\n    unsigned ncol() const { return cols; }\n\n    \/\/ First column corresponding to the augmented submatrix.\n    unsigned augcol() const { return aug; }\n\n    bool empty() const { return size()==0; }\n    bool augmented() const { return aug!=npos; }\n\n    \/\/ Add a column on the right as part of the augmented submatrix.\n    \/\/ The new entries are provided by a (full, dense representation)\n    \/\/ sequence of values.\n    template <typename Seq>\n    void augment(const Seq& col_dense) {\n        unsigned r = 0;\n        for (const auto& v: col_dense) {\n            if (r>=rows.size()) throw msparse_error(\"augmented column size mismatch\");\n            rows[r++].push_back({cols, v});\n        }\n        if (aug==npos) aug=cols;\n        ++cols;\n    }\n\n    \/\/ Remove all augmented columns.\n    void diminish() {\n        if (aug==npos) return;\n        for (auto& row: rows) row.truncate(aug);\n        cols = aug;\n        aug = npos;\n    }\n};\n\n} \/\/ namespace msparse\n<commit_msg>Fix compilation with Clang 3.9 (#172)<commit_after>#pragma once\n\n\/\/ (Possibly augmented) matrix implementation, represented as a vector of sparse rows.\n\n#include <algorithm>\n#include <utility>\n#include <initializer_list>\n#include <iterator>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nnamespace msparse {\n\nstruct msparse_error: std::runtime_error {\n    msparse_error(const std::string &what): std::runtime_error(what) {}\n};\n\nconstexpr unsigned row_npos = unsigned(-1);\n\n\/\/ `msparse::row` represents one sparse matrix row as a vector of\n\/\/ (column, value) pairs, ordered by (unsigned) column. `row_npos`\n\/\/ is used to represent an invalid column number.\n\ntemplate <typename X>\nclass row {\npublic:\n    struct entry {\n        unsigned col;\n        X value;\n    };\n    static constexpr unsigned npos = row_npos;\n\nprivate:\n    std::vector<entry> data_;\n\n    \/\/ Entries must have strictly monotonically increasing column numbers.\n    bool check_invariant() const {\n        for (unsigned i = 1; i<data_.size(); ++i) {\n            if (data_[i].col<=data_[i-1].col) return false;\n        }\n        return true;\n    }\n\npublic:\n    row() = default;\n    row(const row&) = default;\n\n    row(std::initializer_list<entry> il): data_(il) {\n        if (!check_invariant())\n            throw msparse_error(\"improper row element list\");\n    }\n\n    template <typename InIter>\n    row(InIter b, InIter e): data_(b, e) {\n        if (!check_invariant())\n            throw msparse_error(\"improper row element list\");\n    }\n\n    unsigned size() const { return data_.size(); }\n    bool empty() const { return size()==0; }\n\n    \/\/ Iterators present row as sequence of `entry` objects.\n    auto begin() -> decltype(data_.begin()) { return data_.begin(); }\n    auto begin() const -> decltype(data_.cbegin()) { return data_.cbegin(); }\n    auto end() -> decltype(data_.end()) { return data_.end(); }\n    auto end() const -> decltype(data_.cend()) { return data_.cend(); }\n\n    \/\/ Return column of first (left-most) entry.\n    unsigned mincol() const {\n        return empty()? npos: data_.front().col;\n    }\n\n    \/\/ Return column of first entry with column greater than `c`.\n    unsigned mincol_after(unsigned c) const {\n        auto i = std::upper_bound(data_.begin(), data_.end(), c,\n            [](unsigned a, const entry& b) { return a<b.col; });\n\n        return i==data_.end()? npos: i->col;\n    }\n\n    \/\/ Return column of last (right-most) entry.\n    unsigned maxcol() const {\n        return empty()? npos: data_.back().col;\n    }\n\n    \/\/ As opposed to [] indexing (see below), retrieve `i'th entry from\n    \/\/ the list of entries.\n    const entry& get(unsigned i) const {\n        return data_[i];\n    }\n\n    void push_back(const entry& e) {\n        if (!empty() && e.col <= data_.back().col)\n            throw msparse_error(\"cannot push_back row elements out of order\");\n        data_.push_back(e);\n    }\n\n    \/\/ Return index into entry list which has column `c`.\n    unsigned index(unsigned c) const {\n        auto i = std::lower_bound(data_.begin(), data_.end(), c,\n            [](const entry& a, unsigned b) { return a.col<b; });\n\n        return (i==data_.end() || i->col!=c)? npos: std::distance(data_.begin(), i);\n    }\n\n    \/\/ Remove all entries from column `c` onwards.\n    void truncate(unsigned c) {\n        auto i = std::lower_bound(data_.begin(), data_.end(), c,\n            [](const entry& a, unsigned b) { return a.col<b; });\n        data_.erase(i, data_.end());\n    }\n\n    \/\/ Return value at column `c`; if no entry in row, return default-constructed `X`,\n    \/\/ i.e. 0 for numeric types.\n    X operator[](unsigned c) const {\n        auto i = index(c);\n        return i==npos? X{}: data_[i].value;\n    }\n\n    \/\/ Proxy object to allow assigning elements with the syntax `row[c] = value`.\n    struct assign_proxy {\n        row<X>& row_;\n        unsigned c;\n\n        assign_proxy(row<X>& r, unsigned c): row_(r), c(c) {}\n\n        operator X() const { return const_cast<const row<X>&>(row_)[c]; }\n        assign_proxy& operator=(const X& x) {\n            auto i = std::lower_bound(row_.data_.begin(), row_.data_.end(), c,\n                [](const entry& a, unsigned b) { return a.col<b; });\n\n            if (i==row_.data_.end() || i->col!=c) {\n                row_.data_.insert(i, {c, x});\n            }\n            else if (x == X{}) {\n                row_.data_.erase(i);\n            }\n            else {\n                i->value = x;\n            }\n\n            return *this;\n        }\n    };\n\n    assign_proxy operator[](unsigned c) {\n        return assign_proxy{*this, c};\n    }\n};\n\n\/\/ `msparse::matrix` represents a matrix by a size (number of rows,\n\/\/ columns) and vector of sparse `mspase::row` rows.\n\/\/\n\/\/ The matrix may also be 'augmented', with columns corresponding to a second\n\/\/ matrix appended on the right.\n\ntemplate <typename X>\nclass matrix {\nprivate:\n    std::vector<row<X>> rows;\n    unsigned cols = 0;\n    unsigned aug = row_npos;\n\npublic:\n    static constexpr unsigned npos = row_npos;\n\n    matrix() = default;\n    matrix(unsigned n, unsigned c): rows(n), cols(c) {}\n\n    row<X>& operator[](unsigned i) { return rows[i]; }\n    const row<X>& operator[](unsigned i) const { return rows[i]; }\n\n    unsigned size() const { return rows.size(); }\n    unsigned nrow() const { return size(); }\n    unsigned ncol() const { return cols; }\n\n    \/\/ First column corresponding to the augmented submatrix.\n    unsigned augcol() const { return aug; }\n\n    bool empty() const { return size()==0; }\n    bool augmented() const { return aug!=npos; }\n\n    \/\/ Add a column on the right as part of the augmented submatrix.\n    \/\/ The new entries are provided by a (full, dense representation)\n    \/\/ sequence of values.\n    template <typename Seq>\n    void augment(const Seq& col_dense) {\n        unsigned r = 0;\n        for (const auto& v: col_dense) {\n            if (r>=rows.size()) throw msparse_error(\"augmented column size mismatch\");\n            rows[r++].push_back({cols, v});\n        }\n        if (aug==npos) aug=cols;\n        ++cols;\n    }\n\n    \/\/ Remove all augmented columns.\n    void diminish() {\n        if (aug==npos) return;\n        for (auto& row: rows) row.truncate(aug);\n        cols = aug;\n        aug = npos;\n    }\n};\n\n} \/\/ namespace msparse\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of QMime\n**\n** Based on Qt Creator source code\n**\n** Qt Creator Copyright (c) 2011 Nokia Corporation and\/or its subsidiary(-ies).\n**\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** Public License version 2.1 requirements will be met:\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n**************************************************************************\/\n\n#include \"qmimetype.h\"\n#include \"qmimetype_p.h\"\n#include \"qmimedatabase_p.h\"\n#include \"qmimeprovider_p.h\"\n\n#include \"qmimeglobpattern_p.h\"\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QLocale>\n\nQT_BEGIN_NAMESPACE\n\nQMimeTypePrivate::QMimeTypePrivate()\n{}\n\nQMimeTypePrivate::QMimeTypePrivate(const QMimeType &other)\n        : name(other.d->name)\n        \/\/, comment(other.d->comment)\n        , localeComments(other.d->localeComments)\n        , genericIconName(other.d->genericIconName)\n        , iconName(other.d->iconName)\n        , globPatterns(other.d->globPatterns)\n{}\n\nvoid QMimeTypePrivate::clear()\n{\n    name.clear();\n    \/\/comment.clear();\n    localeComments.clear();\n    genericIconName.clear();\n    iconName.clear();\n    globPatterns.clear();\n}\n\nbool QMimeTypePrivate::operator==(const QMimeTypePrivate &other) const\n{\n    return name == other.name &&\n            \/\/comment == other.comment &&\n            localeComments == other.localeComments &&\n            genericIconName == other.genericIconName &&\n            iconName == other.iconName &&\n            globPatterns == other.globPatterns;\n}\n\nvoid QMimeTypePrivate::addGlobPattern(const QString &pattern)\n{\n    globPatterns.append(pattern);\n}\n\n\/\/ TODO rewrite this docu!\n\/*!\n    \\class QMimeType\n\n    \\brief MIME type data used in Qt Creator\n\n    Contains most information from standard MIME type XML database files.\n\n    In addition, the class provides a list of suffixes and a concept of the\n    'preferred suffix' (derived from glob patterns). This is used for example\n    to be able to configure the suffix used for C++-files in Qt Creator.\n\n    MIME XML looks like:\n    \\code\n    <?xml version=\"1.0\" encoding=\"UTF-8\"?>\n    <mime-info xmlns=\"http:\/\/www.freedesktop.org\/standards\/shared-mime-info\">\n    <!-- MIME types must match the desktop file associations -->\n      <mime-type type=\"application\/vnd.nokia.qt.qmakeprofile\">\n        <comment xml:lang=\"en\">Qt qmake Profile<\/comment>\n        <glob pattern=\"*.pro\" weight=\"50\"\/>\n      <\/mime-type>\n    <\/mime-info>\n    \\endcode\n\n    \\sa QMimeDatabase\n *\/\n\n\/*!\n    \\fn QMimeType::QMimeType();\n    \\brief Initializes the attributes with default values that indicate an invalid MIME type.\n *\/\nQMimeType::QMimeType() :\n        d(new QMimeTypePrivate())\n{}\n\n\/*!\n    \\fn QMimeType::QMimeType(const QMimeType &other);\n    \\brief Initializes the attributes with the data of another MIME type.\n    \\a other The other MIME type the data of which is copied\n *\/\nQMimeType::QMimeType(const QMimeType &other) :\n        d(other.d)\n{}\n\n#if !defined(Q_COMPILER_RVALUE_REFS) || TEST_COMPILER_RVALUE_REFS == 0\n\/*!\n    \\fn QMimeType &QMimeType::operator=(const QMimeType &other);\n    \\brief Assigns the data of another MIME type.\n    \\a other The other MIME type the data of which is assigned\n *\/\nQMimeType &QMimeType::operator=(const QMimeType &other)\n{\n    if (d != other.d)\n        d = other.d;\n    return *this;\n}\n#endif\n\n#ifdef Q_COMPILER_RVALUE_REFS\n\/*!\n    \\fn QMimeType::QMimeType(QMimeType &&other);\n    \\brief Moves the data of another rvalue MIME type into the attributes.\n    \\a other The other rvalue MIME type the data of which is moved\n *\/\nQMimeType::QMimeType(QMimeType &&other) :\n        d(std::move(other.d))\n{}\n#endif\n\nQMimeType::QMimeType(const QMimeTypePrivate &dd) :\n        d(new QMimeTypePrivate(dd))\n{}\n\n\/*!\n    \\fn QMimeType::~QMimeType();\n    \\brief Releases the d.\n *\/\nQMimeType::~QMimeType()\n{}\n\n\/*!\n    \\fn bool QMimeType::operator==(const QMimeType &other) const;\n    \\brief Tests for equality with another MIME type.\n    \\a other The other MIME type that is to be compared with\n    Returns if the other MIME type is equal.\n *\/\nbool QMimeType::operator==(const QMimeType &other) const\n{\n    return d == other.d || *d == *other.d;\n}\n\n\/*!\n    \\fn bool QMimeType::operator!=(const QMimeType &other) const;\n    \\brief Tests for non-equality with another MIME type.\n    \\a other The other MIME type that is to be compared with\n    Returns if the other MIME type is not equal.\n *\/\n\n\/*!\n    \\fn bool QMimeType::isValid() const;\n    \\brief Returns true if the MIME type is valid, otherwise returns false.\n    A valid MIME type has a non-empty name().\n    The invalid MIME type is the default-constructed QMimeType.\n *\/\nbool QMimeType::isValid() const\n{\n    return !d->name.isEmpty();\n}\n\n\/*!\n    Returns true if this MIME type is the default MIME type which\n    applies to all files: application\/octet-stream.\n *\/\nbool QMimeType::isDefault() const\n{\n    return d->name == QMimeDatabasePrivate::instance()->defaultMimeType();\n}\n\n\/*!\n    \\fn QString QMimeType::name() const;\n    \\brief Returns the name of the MIME type.\n *\/\nQString QMimeType::name() const\n{\n    return d->name;\n}\n\n#if 0\n\/*!\n    \\fn QStringList QMimeType::aliases() const;\n    \\brief Returns the aliases of the MIME type.\n *\/\n\/\/ What is the use case for this? [apart from mimetypeviewer.cpp ...]\nQStringList QMimeType::aliases() const\n{\n    return d->aliases;\n}\n#endif\n\n\/*!\n    \\fn QString QMimeType::comment() const;\n    \\brief Returns the description of the MIME type to be displayed on user interfaces.\n\n    The system language (QLocale::system().name()) is used to select the appropriate translation.\n    Another language can be specified by setting the \\a localName argument.\n *\/\nQString QMimeType::comment(const QString& localeName) const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadMimeTypePrivate(*d);\n\n    QStringList languageList;\n    if (!localeName.isEmpty())\n        languageList << localeName;\n    languageList << QLocale::system().name();\n    languageList << QLocale::system().uiLanguages();\n    Q_FOREACH(const QString& lang, languageList) {\n        const QString comm = d->localeComments.value(lang);\n        if (!comm.isEmpty())\n            return comm;\n        const int pos = lang.indexOf(QLatin1Char('_'));\n        if (pos != -1) {\n            \/\/ \"pt_BR\" not found? try just \"pt\"\n            const QString shortLang = lang.left(pos);\n            const QString commShort = d->localeComments.value(shortLang);\n            if (!commShort.isEmpty())\n                return commShort;\n        }\n    }\n\n    \/\/ Use d->name as fallback, but this is only used by filterString()\n    return d->name;\n}\n\n\/*!\n    \\fn QString QMimeType::genericIconName() const;\n    \\brief Returns the file name of an icon image that represents the MIME type.\n *\/\nQString QMimeType::genericIconName() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadGenericIcon(*d);\n    return d->genericIconName;\n}\n\n\/*!\n    \\fn QString QMimeType::iconName() const;\n    \\brief Returns the file name of an icon image that represents the MIME type.\n *\/\nQString QMimeType::iconName() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadIcon(*d);\n    if (d->iconName.isEmpty()) {\n        \/\/ Make default icon name from the mimetype name\n        d->iconName = name();\n        const int slashindex = d->iconName.indexOf(QLatin1Char('\/'));\n        if (slashindex != -1)\n            d->iconName[slashindex] = QLatin1Char('-');\n    }\n    return d->iconName;\n}\n\nQStringList QMimeType::globPatterns() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadMimeTypePrivate(*d);\n    return d->globPatterns;\n}\n\nQStringList QMimeType::parentMimeTypes() const\n{\n    return QMimeDatabasePrivate::instance()->provider()->parents(d->name);\n}\n\nstatic void collectParentMimeTypes(const QString& mime, QStringList& allParents)\n{\n    QStringList parents = QMimeDatabasePrivate::instance()->provider()->parents(mime);\n    foreach(const QString& parent, parents) {\n        \/\/ I would use QSet, but since order matters I better not\n        if (!allParents.contains(parent))\n            allParents.append(parent);\n    }\n    \/\/ We want a breadth-first search, so that the least-specific parent (octet-stream) is last\n    \/\/ This means iterating twice, unfortunately.\n    foreach(const QString& parent, parents) {\n        collectParentMimeTypes(parent, allParents);\n    }\n}\n\nQStringList QMimeType::allParentMimeTypes() const\n{\n    QStringList allParents;\n    const QString canonical = d->name;\n    if (!canonical.isEmpty())\n        allParents.append(canonical);\n    collectParentMimeTypes(d->name, allParents);\n\n    return allParents;\n}\n\n\/*!\n    \\fn QStringList QMimeType::suffixes() const;\n    \\brief Returns the known suffixes for the MIME type.\n *\/\nQStringList QMimeType::suffixes() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadMimeTypePrivate(*d);\n\n    QStringList result;\n    foreach (const QString& pattern, d->globPatterns) {\n        \/\/ Not a simple suffix if if looks like: README or *. or *.* or *.JP*G or *.JP?\n        if (pattern.startsWith(QLatin1String(\"*.\")) &&\n            pattern.length() > 2 &&\n            pattern.indexOf(QLatin1Char('*'), 2) < 0 && pattern.indexOf(QLatin1Char('?'), 2) < 0) {\n            const QString suffix = pattern.mid(2);\n            result.append(suffix);\n        }\n    }\n\n    return result;\n}\n\n\/*!\n    \\fn QString QMimeType::preferredSuffix() const;\n    \\brief Returns the preferred suffix for the MIME type.\n *\/\nQString QMimeType::preferredSuffix() const\n{\n    const QStringList suffixList = suffixes();\n    return suffixList.isEmpty() ? QString() : suffixList.at(0);\n}\n\n\/*!\n    Returns a filter string usable for a file dialog.\n*\/\nQString QMimeType::filterString() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadMimeTypePrivate(*d);\n    QString filter;\n\n    if (!d->globPatterns.empty()) { \/\/ !Binary files\n        filter += comment() + QLatin1String(\" (\");\n        for (int i = 0; i < d->globPatterns.size(); ++i) {\n            if (i != 0)\n                filter += QLatin1Char(' ');\n            filter += d->globPatterns.at(i);\n        }\n        filter +=  QLatin1Char(')');\n    }\n\n    return filter;\n}\n\n\/*!\n    Returns true if this mimetype is \\a mimeTypeName, or inherits \\a mimeTypeName,\n    or \\a mimeTypeName is an alias for this mimetype.\n *\/\nbool QMimeType::inherits(const QString &mimeTypeName) const\n{\n    if (d->name == mimeTypeName)\n        return true;\n    return QMimeDatabasePrivate::instance()->inherits(d->name, mimeTypeName);\n}\n\n\nQT_END_NAMESPACE\n<commit_msg>Adjust comment<commit_after>\/**************************************************************************\n**\n** This file is part of QMime\n**\n** Based on Qt Creator source code\n**\n** Qt Creator Copyright (c) 2011 Nokia Corporation and\/or its subsidiary(-ies).\n**\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** Public License version 2.1 requirements will be met:\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n**************************************************************************\/\n\n#include \"qmimetype.h\"\n#include \"qmimetype_p.h\"\n#include \"qmimedatabase_p.h\"\n#include \"qmimeprovider_p.h\"\n\n#include \"qmimeglobpattern_p.h\"\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QLocale>\n\nQT_BEGIN_NAMESPACE\n\nQMimeTypePrivate::QMimeTypePrivate()\n{}\n\nQMimeTypePrivate::QMimeTypePrivate(const QMimeType &other)\n        : name(other.d->name)\n        \/\/, comment(other.d->comment)\n        , localeComments(other.d->localeComments)\n        , genericIconName(other.d->genericIconName)\n        , iconName(other.d->iconName)\n        , globPatterns(other.d->globPatterns)\n{}\n\nvoid QMimeTypePrivate::clear()\n{\n    name.clear();\n    \/\/comment.clear();\n    localeComments.clear();\n    genericIconName.clear();\n    iconName.clear();\n    globPatterns.clear();\n}\n\nbool QMimeTypePrivate::operator==(const QMimeTypePrivate &other) const\n{\n    return name == other.name &&\n            \/\/comment == other.comment &&\n            localeComments == other.localeComments &&\n            genericIconName == other.genericIconName &&\n            iconName == other.iconName &&\n            globPatterns == other.globPatterns;\n}\n\nvoid QMimeTypePrivate::addGlobPattern(const QString &pattern)\n{\n    globPatterns.append(pattern);\n}\n\n\/\/ TODO rewrite this docu!\n\/*!\n    \\class QMimeType\n\n    \\brief MIME type data used in Qt Creator\n\n    Contains most information from standard MIME type XML database files.\n\n    In addition, the class provides a list of suffixes and a concept of the\n    'preferred suffix' (derived from glob patterns). This is used for example\n    to be able to configure the suffix used for C++-files in Qt Creator.\n\n    MIME XML looks like:\n    \\code\n    <?xml version=\"1.0\" encoding=\"UTF-8\"?>\n    <mime-info xmlns=\"http:\/\/www.freedesktop.org\/standards\/shared-mime-info\">\n    <!-- MIME types must match the desktop file associations -->\n      <mime-type type=\"application\/vnd.nokia.qt.qmakeprofile\">\n        <comment xml:lang=\"en\">Qt qmake Profile<\/comment>\n        <glob pattern=\"*.pro\" weight=\"50\"\/>\n      <\/mime-type>\n    <\/mime-info>\n    \\endcode\n\n    \\sa QMimeDatabase\n *\/\n\n\/*!\n    \\fn QMimeType::QMimeType();\n    \\brief Initializes the attributes with default values that indicate an invalid MIME type.\n *\/\nQMimeType::QMimeType() :\n        d(new QMimeTypePrivate())\n{}\n\n\/*!\n    \\fn QMimeType::QMimeType(const QMimeType &other);\n    \\brief Initializes the attributes with the data of another MIME type.\n    \\a other The other MIME type the data of which is copied\n *\/\nQMimeType::QMimeType(const QMimeType &other) :\n        d(other.d)\n{}\n\n#if !defined(Q_COMPILER_RVALUE_REFS) || TEST_COMPILER_RVALUE_REFS == 0\n\/*!\n    \\fn QMimeType &QMimeType::operator=(const QMimeType &other);\n    \\brief Assigns the data of another MIME type.\n    \\a other The other MIME type the data of which is assigned\n *\/\nQMimeType &QMimeType::operator=(const QMimeType &other)\n{\n    if (d != other.d)\n        d = other.d;\n    return *this;\n}\n#endif\n\n#ifdef Q_COMPILER_RVALUE_REFS\n\/*!\n    \\fn QMimeType::QMimeType(QMimeType &&other);\n    \\brief Moves the data of another rvalue MIME type into the attributes.\n    \\a other The other rvalue MIME type the data of which is moved\n *\/\nQMimeType::QMimeType(QMimeType &&other) :\n        d(std::move(other.d))\n{}\n#endif\n\nQMimeType::QMimeType(const QMimeTypePrivate &dd) :\n        d(new QMimeTypePrivate(dd))\n{}\n\n\/*!\n    \\fn QMimeType::~QMimeType();\n    \\brief Releases the d.\n *\/\nQMimeType::~QMimeType()\n{}\n\n\/*!\n    \\fn bool QMimeType::operator==(const QMimeType &other) const;\n    \\brief Tests for equality with another MIME type.\n    \\a other The other MIME type that is to be compared with\n    Returns if the other MIME type is equal.\n *\/\nbool QMimeType::operator==(const QMimeType &other) const\n{\n    return d == other.d || *d == *other.d;\n}\n\n\/*!\n    \\fn bool QMimeType::operator!=(const QMimeType &other) const;\n    \\brief Tests for non-equality with another MIME type.\n    \\a other The other MIME type that is to be compared with\n    Returns if the other MIME type is not equal.\n *\/\n\n\/*!\n    \\fn bool QMimeType::isValid() const;\n    \\brief Returns true if the MIME type is valid, otherwise returns false.\n    A valid MIME type has a non-empty name().\n    The invalid MIME type is the default-constructed QMimeType.\n *\/\nbool QMimeType::isValid() const\n{\n    return !d->name.isEmpty();\n}\n\n\/*!\n    Returns true if this MIME type is the default MIME type which\n    applies to all files: application\/octet-stream.\n *\/\nbool QMimeType::isDefault() const\n{\n    return d->name == QMimeDatabasePrivate::instance()->defaultMimeType();\n}\n\n\/*!\n    \\fn QString QMimeType::name() const;\n    \\brief Returns the name of the MIME type.\n *\/\nQString QMimeType::name() const\n{\n    return d->name;\n}\n\n#if 0\n\/*!\n    \\fn QStringList QMimeType::aliases() const;\n    \\brief Returns the aliases of the MIME type.\n *\/\n\/\/ What is the use case for this? [apart from mimetypeviewer.cpp ...]\nQStringList QMimeType::aliases() const\n{\n    return d->aliases;\n}\n#endif\n\n\/*!\n    \\fn QString QMimeType::comment() const;\n    \\brief Returns the description of the MIME type to be displayed on user interfaces.\n\n    The system language (QLocale::system().name()) is used to select the appropriate translation.\n    Another language can be specified by setting the \\a localName argument.\n *\/\nQString QMimeType::comment(const QString& localeName) const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadMimeTypePrivate(*d);\n\n    QStringList languageList;\n    if (!localeName.isEmpty())\n        languageList << localeName;\n    languageList << QLocale::system().name();\n    languageList << QLocale::system().uiLanguages();\n    Q_FOREACH(const QString& lang, languageList) {\n        const QString comm = d->localeComments.value(lang);\n        if (!comm.isEmpty())\n            return comm;\n        const int pos = lang.indexOf(QLatin1Char('_'));\n        if (pos != -1) {\n            \/\/ \"pt_BR\" not found? try just \"pt\"\n            const QString shortLang = lang.left(pos);\n            const QString commShort = d->localeComments.value(shortLang);\n            if (!commShort.isEmpty())\n                return commShort;\n        }\n    }\n\n    \/\/ Use the mimetype name as fallback\n    return d->name;\n}\n\n\/*!\n    \\fn QString QMimeType::genericIconName() const;\n    \\brief Returns the file name of an icon image that represents the MIME type.\n *\/\nQString QMimeType::genericIconName() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadGenericIcon(*d);\n    return d->genericIconName;\n}\n\n\/*!\n    \\fn QString QMimeType::iconName() const;\n    \\brief Returns the file name of an icon image that represents the MIME type.\n *\/\nQString QMimeType::iconName() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadIcon(*d);\n    if (d->iconName.isEmpty()) {\n        \/\/ Make default icon name from the mimetype name\n        d->iconName = name();\n        const int slashindex = d->iconName.indexOf(QLatin1Char('\/'));\n        if (slashindex != -1)\n            d->iconName[slashindex] = QLatin1Char('-');\n    }\n    return d->iconName;\n}\n\nQStringList QMimeType::globPatterns() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadMimeTypePrivate(*d);\n    return d->globPatterns;\n}\n\nQStringList QMimeType::parentMimeTypes() const\n{\n    return QMimeDatabasePrivate::instance()->provider()->parents(d->name);\n}\n\nstatic void collectParentMimeTypes(const QString& mime, QStringList& allParents)\n{\n    QStringList parents = QMimeDatabasePrivate::instance()->provider()->parents(mime);\n    foreach(const QString& parent, parents) {\n        \/\/ I would use QSet, but since order matters I better not\n        if (!allParents.contains(parent))\n            allParents.append(parent);\n    }\n    \/\/ We want a breadth-first search, so that the least-specific parent (octet-stream) is last\n    \/\/ This means iterating twice, unfortunately.\n    foreach(const QString& parent, parents) {\n        collectParentMimeTypes(parent, allParents);\n    }\n}\n\nQStringList QMimeType::allParentMimeTypes() const\n{\n    QStringList allParents;\n    const QString canonical = d->name;\n    if (!canonical.isEmpty())\n        allParents.append(canonical);\n    collectParentMimeTypes(d->name, allParents);\n\n    return allParents;\n}\n\n\/*!\n    \\fn QStringList QMimeType::suffixes() const;\n    \\brief Returns the known suffixes for the MIME type.\n *\/\nQStringList QMimeType::suffixes() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadMimeTypePrivate(*d);\n\n    QStringList result;\n    foreach (const QString& pattern, d->globPatterns) {\n        \/\/ Not a simple suffix if if looks like: README or *. or *.* or *.JP*G or *.JP?\n        if (pattern.startsWith(QLatin1String(\"*.\")) &&\n            pattern.length() > 2 &&\n            pattern.indexOf(QLatin1Char('*'), 2) < 0 && pattern.indexOf(QLatin1Char('?'), 2) < 0) {\n            const QString suffix = pattern.mid(2);\n            result.append(suffix);\n        }\n    }\n\n    return result;\n}\n\n\/*!\n    \\fn QString QMimeType::preferredSuffix() const;\n    \\brief Returns the preferred suffix for the MIME type.\n *\/\nQString QMimeType::preferredSuffix() const\n{\n    const QStringList suffixList = suffixes();\n    return suffixList.isEmpty() ? QString() : suffixList.at(0);\n}\n\n\/*!\n    Returns a filter string usable for a file dialog.\n*\/\nQString QMimeType::filterString() const\n{\n    QMimeDatabasePrivate::instance()->provider()->loadMimeTypePrivate(*d);\n    QString filter;\n\n    if (!d->globPatterns.empty()) { \/\/ !Binary files\n        filter += comment() + QLatin1String(\" (\");\n        for (int i = 0; i < d->globPatterns.size(); ++i) {\n            if (i != 0)\n                filter += QLatin1Char(' ');\n            filter += d->globPatterns.at(i);\n        }\n        filter +=  QLatin1Char(')');\n    }\n\n    return filter;\n}\n\n\/*!\n    Returns true if this mimetype is \\a mimeTypeName, or inherits \\a mimeTypeName,\n    or \\a mimeTypeName is an alias for this mimetype.\n *\/\nbool QMimeType::inherits(const QString &mimeTypeName) const\n{\n    if (d->name == mimeTypeName)\n        return true;\n    return QMimeDatabasePrivate::instance()->inherits(d->name, mimeTypeName);\n}\n\n\nQT_END_NAMESPACE\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 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 \"mainwindow.h\"\n\n#include \"lib\/models\/gameitemsmodel.h\"\n\n#include \"input\/inputmanager.h\"\n\n#include \"engine\/game.h\"\n#include \"engine\/gameproject.h\"\n#include \"engine\/scene.h\"\n#include \"graphics\/renderwidget.h\"\n\n#include <KDE\/KPushButton>\n#include <KDE\/KFileDialog>\n#include <KDE\/KUrl>\n#include <KDE\/KLocalizedString>\n#include <KDE\/KMenuBar>\n#include <KDE\/KToolBar>\n#include <KDE\/KStatusBar>\n#include <KDE\/KAction>\n#include <KDE\/KActionCollection>\n#include <KDE\/KStandardAction>\n#include <KDE\/KConfig>\n#include <KDE\/KShortcutsDialog>\n#include <KDE\/KEditToolBar>\n\n#include <QtGui\/QStatusBar>\n#include <QtGui\/QListView>\n#include <QtGui\/QVBoxLayout>\n#include <QtGui\/QLabel>\n#include <QtCore\/QTimer>\n#include <QtCore\/QDebug>\n\nusing namespace GluonKDEPlayer;\n\nclass MainWindow::MainWindowPrivate\n{\n    public:\n        MainWindowPrivate() {}\n\n        GluonGraphics::RenderWidget* widget;\n\n        QString title;\n        QString fileName;\n\n        int msecElapsed;\n        int frameCount;\n};\n\nMainWindow::MainWindow(const QString& filename )\n    : KXmlGuiWindow()\n    , d( new MainWindowPrivate )\n    , m_gamesOverlay( new GamesOverlay( this ) )\n    , m_layout( new QGridLayout )\n    , m_project( new GluonEngine::GameProject )\n{\n    setCentralWidget( m_gamesOverlay );\n    setupActions();\n    setupGUI();\n    showGames();\n}\n\nMainWindow::~MainWindow ( )\n{\n}\n\nvoid MainWindow::setupActions()\n{\n    KStandardAction::quit( this, SLOT( close() ), actionCollection() );\n    KStandardAction::showMenubar( menuBar(), SLOT(setVisible(bool)), actionCollection());\n    KStandardAction::showStatusbar( statusBar(), SLOT(setVisible(bool)), actionCollection());\n    setStandardToolBarMenuEnabled(true);\n    createStandardStatusBarAction();\n\n    KStandardAction::keyBindings(this, SLOT(optionsConfigureKeys()), actionCollection()); \/\/ options_configure_keybinding\n    KStandardAction::configureToolbars(this, SLOT(optionsConfigureToolbars()), actionCollection()); \/\/ options_configure_toolbars\n\n    m_recentFiles = KStandardAction::openRecent( this, SLOT( openProject( KUrl ) ), actionCollection() );\n    \/\/ d->recentFiles->loadEntries( KGlobal::config()->group( \"Recent Files\" ) );\n\n    KAction* login = new KAction( KIcon( \"im-user\" ), i18n( \"Login\" ), actionCollection() );\n    actionCollection()->addAction( \"community_login\", login );\n    connect( login, SIGNAL( triggered( bool ) ), SLOT( mLogin() ) );\n\n    KAction* logout = new KAction( KIcon( \"media-playback-start\" ), i18n( \"Logout\" ), actionCollection() );\n    actionCollection()->addAction( \"community_logout\", logout );\n    connect( logout, SIGNAL( triggered( bool ) ), SLOT( mLogout() ) );\n\n    KAction* details = new KAction( KIcon( \"media-playback-start\" ), i18n( \"Details\" ), actionCollection() );\n    actionCollection()->addAction( \"community_details\", details );\n    connect( details, SIGNAL( triggered( bool ) ), SLOT( mDetails() ) );\n\n    KAction* registration = new KAction( KIcon( \"list-add-user\" ), i18n( \"Registration\" ), actionCollection() );\n    actionCollection()->addAction( \"community_registration\", registration );\n    connect( registration, SIGNAL( triggered( bool ) ), SLOT( mRegistration() ) );\n\n    KAction* forgottenPassword = new KAction( KIcon( \"help-hint\" ), i18n( \"Forgotten password\" ), actionCollection() );\n    actionCollection()->addAction( \"community_forgotten_password\", forgottenPassword );\n    connect( forgottenPassword, SIGNAL( triggered( bool ) ), SLOT( mForgottenPassword() ) );\n\n    KAction* play = new KAction( KIcon( \"media-playback-start\" ), i18n( \"Play Game\" ), actionCollection() );\n    actionCollection()->addAction( \"playGame\", play );\n    connect( play, SIGNAL( triggered( bool ) ), SLOT( openProject() ) );\n\n    KAction* pause = new KAction( KIcon( \"media-playback-pause\" ), i18n( \"Pause Game\" ), actionCollection() );\n    actionCollection()->addAction( \"pauseGame\", pause );\n    connect( pause, SIGNAL( triggered( bool ) ), SLOT( pauseGame() ) );\n\n    KAction* stop = new KAction( KIcon( \"media-playback-stop\" ), i18n( \"Stop Game\" ), actionCollection() );\n    actionCollection()->addAction( \"stopGame\", stop );\n    connect( stop, SIGNAL( triggered( bool ) ), SLOT( stopGame() ) );\n\n    KStandardAction::quit(kapp, SLOT(quit()), actionCollection());\n}\n\nvoid MainWindow::startGame( )\n{\n    GluonCore::GluonObjectFactory::instance()->loadPlugins();\n\n    m_project->loadFromFile( m_gameFileName );\n\n    setWindowFilePath( m_gameFileName );\n    d->title = windowTitle();\n\n    GluonEngine::Game::instance()->setGameProject( m_project );\n    GluonEngine::Game::instance()->setCurrentScene( m_project->entryPoint() );\n\n    setFocus();\n\n    \/\/ if( GluonEngine::Game::instance()->isRunning() )\n    \/\/ {\n        \/\/ GluonEngine::Game::instance()->setPause( false );\n        \/\/ stateChanged( \"paused\", StateReverse );\n    \/\/ }\n    \/\/ else\n    \/\/ {\n        \/\/ stateChanged( \"playing\" );\n\n        \/\/ QString currentSceneName = GluonEngine::Game::instance()->currentScene()->fullyQualifiedName();\n        \/\/ saveProject();\n\n        \/\/Set the focus to the entire window, so that we do not accidentally trigger actions\n        \/\/ setFocus();\n\n        \/\/Start the game loop\n        \/\/Note that this starts an infinite loop in Game\n        GluonEngine::Game::instance()->runGame();\n        QApplication::instance()->exit();\n        \/\/This happens after we exit the game loop\n        \/\/ stateChanged( \"playing\", StateReverse );\n\n        \/\/ openProject( d->fileName );\n        \/\/ GluonEngine::Game::instance()->setCurrentScene( currentSceneName );\n        \/\/ GluonEngine::Game::instance()->initializeAll();\n    \/\/ }\n}\n\nvoid MainWindow::pauseGame()\n{\n    GluonEngine::Game::instance()->setPause( true );\n    stateChanged( \"paused\" );\n}\n\nvoid MainWindow::stopGame()\n{\n    GluonEngine::Game::instance()->stopGame();\n}\n\n\/\/ void MainWindow::saveProperties(KConfigGroup &config)\n\/\/ {\n    \/\/ if (!m_part)\n        \/\/ loadPart();\n\n    \/\/ m_part->saveProperties(config);\n    \/\/ config.writeEntry(\"docked\", isHidden());\n\/\/ }\n\n\/\/ void MainWindow::readProperties(const KConfigGroup & config)\n\/\/ {\n    \/\/ if (!m_part)\n        \/\/ loadPart();\n    \/\/ m_part->readProperties(config);\n    \/\/ setVisible( !Settings::showTrayIcon() || !config.readEntry(\"docked\", false) );\n\/\/ }\n\n\/\/ TODO: move to part?\nvoid MainWindow::optionsConfigureKeys()\n{\n    KShortcutsDialog dlg( KShortcutsEditor::AllActions,\n    KShortcutsEditor::LetterShortcutsAllowed, this );\n\n    dlg.addCollection(actionCollection());\n    \/\/ if (m_part)\n        \/\/ dlg.addCollection(m_part->actionCollection());\n\n    dlg.configure();\n}\n\n\/\/ TODO: move to part?\n void MainWindow::optionsConfigureToolbars()\n{\n    \/\/ saveMainWindowSettings(KGlobal::config().data()->group( autoSaveGroup()) );\n    \/\/ KEditToolBar dlg(factory());\n    \/\/ connect(&dlg, SIGNAL(newToolBarConfig()),\n            \/\/ this, SLOT(applyNewToolbarConfig()));\n    \/\/ dlg.exec();\n}\n\nvoid MainWindow::mLogin( )\n{\n}\n\nvoid MainWindow::mLogout( )\n{\n}\n\nvoid MainWindow::mHome()\n{\n}\n\nvoid MainWindow::mDetails()\n{\n}\n\nvoid MainWindow::mRegistration()\n{\n}\n\nvoid MainWindow::mForgottenPassword()\n{\n}\n\nvoid MainWindow::closeEvent( QCloseEvent* event )\n{\n    GluonEngine::Game::instance()->stopGame();\n    QWidget::closeEvent( event );\n}\n\nvoid MainWindow::resizeEvent( QResizeEvent* event )\n{\n    m_viewportWidth = event->size().width();\n    m_viewportHeight = event->size().height();\n    glViewport( 0, 0, m_viewportWidth, m_viewportHeight );\n}\n\nvoid MainWindow::showGames()\n{\n    m_gamesOverlay->setGeometry( geometry() );\n    connect( m_gamesOverlay, SIGNAL( gameToPlaySelected( QModelIndex ) ), SLOT( setProject( QModelIndex ) ) );\n}\n\nvoid MainWindow::setProject( const QModelIndex& index )\n{\n    m_gameFileName = index.data(GluonPlayer::GameItemsModel::ProjectFileNameRole).toString();\n    m_gamesOverlay->hide();\n    openProject();\n}\n\nvoid MainWindow::openProject()\n{\n    if( m_gameFileName.isEmpty() )\n    {\n        return;\n    }\n\n    d->widget = new GluonGraphics::RenderWidget( this );\n    setCentralWidget( d->widget );\n\n    connect( GluonEngine::Game::instance(), SIGNAL( painted( int ) ), d->widget, SLOT( updateGL() ) );\n    connect( GluonEngine::Game::instance(), SIGNAL( painted( int ) ), SLOT( countFrames( int ) ) );\n    connect( GluonEngine::Game::instance(), SIGNAL( updated( int ) ), SLOT( updateTitle( int ) ) );\n\n    GluonInput::InputManager::instance()->setFilteredObject(d->widget);\n    QTimer::singleShot( 1000, this, SLOT( startGame() ) );\n}\n\nvoid MainWindow::activated( QModelIndex index )\n{\n    if( index.isValid() )\n    {\n    }\n}\n\nvoid MainWindow::updateTitle( int msec )\n{\n    d->msecElapsed += msec;\n\n    static int fps = 0;\n    if( d->msecElapsed > 1000 )\n    {\n        fps = d->frameCount;\n        d->frameCount = 0;\n        d->msecElapsed = 0;\n    }\n\n    setWindowTitle( d->title + QString( \" (%1 FPS)\" ).arg( fps ) );\n}\n\nvoid MainWindow::countFrames( int \/* time *\/ )\n{\n    d->frameCount++;\n}\n\n<commit_msg>Fix the simple user input issue in the kdeext player.<commit_after>\/*****************************************************************************\n * This file is part of the Gluon Development Platform                       *\n * Copyright (c) 2011 Laszlo Papp <djszapi@archlinux.us>                     *\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 \"mainwindow.h\"\n\n#include \"lib\/models\/gameitemsmodel.h\"\n\n#include \"input\/inputmanager.h\"\n\n#include \"engine\/game.h\"\n#include \"engine\/gameproject.h\"\n#include \"engine\/scene.h\"\n#include \"graphics\/renderwidget.h\"\n\n#include <KDE\/KPushButton>\n#include <KDE\/KFileDialog>\n#include <KDE\/KUrl>\n#include <KDE\/KLocalizedString>\n#include <KDE\/KMenuBar>\n#include <KDE\/KToolBar>\n#include <KDE\/KStatusBar>\n#include <KDE\/KAction>\n#include <KDE\/KActionCollection>\n#include <KDE\/KStandardAction>\n#include <KDE\/KConfig>\n#include <KDE\/KShortcutsDialog>\n#include <KDE\/KEditToolBar>\n\n#include <QtGui\/QStatusBar>\n#include <QtGui\/QListView>\n#include <QtGui\/QVBoxLayout>\n#include <QtGui\/QLabel>\n#include <QtCore\/QTimer>\n#include <QtCore\/QDebug>\n\nusing namespace GluonKDEPlayer;\n\nclass MainWindow::MainWindowPrivate\n{\n    public:\n        MainWindowPrivate() {}\n\n        GluonGraphics::RenderWidget* widget;\n\n        QString title;\n        QString fileName;\n\n        int msecElapsed;\n        int frameCount;\n};\n\nMainWindow::MainWindow(const QString& filename )\n    : KXmlGuiWindow()\n    , d( new MainWindowPrivate )\n    , m_gamesOverlay( new GamesOverlay( this ) )\n    , m_layout( new QGridLayout )\n    , m_project( new GluonEngine::GameProject )\n{\n    setCentralWidget( m_gamesOverlay );\n    setupActions();\n    setupGUI();\n    showGames();\n}\n\nMainWindow::~MainWindow ( )\n{\n}\n\nvoid MainWindow::setupActions()\n{\n    KStandardAction::quit( this, SLOT( close() ), actionCollection() );\n    KStandardAction::showMenubar( menuBar(), SLOT(setVisible(bool)), actionCollection());\n    KStandardAction::showStatusbar( statusBar(), SLOT(setVisible(bool)), actionCollection());\n    setStandardToolBarMenuEnabled(true);\n    createStandardStatusBarAction();\n\n    KStandardAction::keyBindings(this, SLOT(optionsConfigureKeys()), actionCollection()); \/\/ options_configure_keybinding\n    KStandardAction::configureToolbars(this, SLOT(optionsConfigureToolbars()), actionCollection()); \/\/ options_configure_toolbars\n\n    m_recentFiles = KStandardAction::openRecent( this, SLOT( openProject( KUrl ) ), actionCollection() );\n    \/\/ d->recentFiles->loadEntries( KGlobal::config()->group( \"Recent Files\" ) );\n\n    KAction* login = new KAction( KIcon( \"im-user\" ), i18n( \"Login\" ), actionCollection() );\n    actionCollection()->addAction( \"community_login\", login );\n    connect( login, SIGNAL( triggered( bool ) ), SLOT( mLogin() ) );\n\n    KAction* logout = new KAction( KIcon( \"media-playback-start\" ), i18n( \"Logout\" ), actionCollection() );\n    actionCollection()->addAction( \"community_logout\", logout );\n    connect( logout, SIGNAL( triggered( bool ) ), SLOT( mLogout() ) );\n\n    KAction* details = new KAction( KIcon( \"media-playback-start\" ), i18n( \"Details\" ), actionCollection() );\n    actionCollection()->addAction( \"community_details\", details );\n    connect( details, SIGNAL( triggered( bool ) ), SLOT( mDetails() ) );\n\n    KAction* registration = new KAction( KIcon( \"list-add-user\" ), i18n( \"Registration\" ), actionCollection() );\n    actionCollection()->addAction( \"community_registration\", registration );\n    connect( registration, SIGNAL( triggered( bool ) ), SLOT( mRegistration() ) );\n\n    KAction* forgottenPassword = new KAction( KIcon( \"help-hint\" ), i18n( \"Forgotten password\" ), actionCollection() );\n    actionCollection()->addAction( \"community_forgotten_password\", forgottenPassword );\n    connect( forgottenPassword, SIGNAL( triggered( bool ) ), SLOT( mForgottenPassword() ) );\n\n    KAction* play = new KAction( KIcon( \"media-playback-start\" ), i18n( \"Play Game\" ), actionCollection() );\n    actionCollection()->addAction( \"playGame\", play );\n    connect( play, SIGNAL( triggered( bool ) ), SLOT( openProject() ) );\n\n    KAction* pause = new KAction( KIcon( \"media-playback-pause\" ), i18n( \"Pause Game\" ), actionCollection() );\n    actionCollection()->addAction( \"pauseGame\", pause );\n    connect( pause, SIGNAL( triggered( bool ) ), SLOT( pauseGame() ) );\n\n    KAction* stop = new KAction( KIcon( \"media-playback-stop\" ), i18n( \"Stop Game\" ), actionCollection() );\n    actionCollection()->addAction( \"stopGame\", stop );\n    connect( stop, SIGNAL( triggered( bool ) ), SLOT( stopGame() ) );\n\n    KStandardAction::quit(kapp, SLOT(quit()), actionCollection());\n}\n\nvoid MainWindow::startGame( )\n{\n    GluonCore::GluonObjectFactory::instance()->loadPlugins();\n\n    m_project->loadFromFile( m_gameFileName );\n\n    setWindowFilePath( m_gameFileName );\n    d->title = windowTitle();\n\n    GluonEngine::Game::instance()->setGameProject( m_project );\n    GluonEngine::Game::instance()->setCurrentScene( m_project->entryPoint() );\n\n    d->widget->setFocus();\n\n    \/\/ if( GluonEngine::Game::instance()->isRunning() )\n    \/\/ {\n        \/\/ GluonEngine::Game::instance()->setPause( false );\n        \/\/ stateChanged( \"paused\", StateReverse );\n    \/\/ }\n    \/\/ else\n    \/\/ {\n        \/\/ stateChanged( \"playing\" );\n\n        \/\/ QString currentSceneName = GluonEngine::Game::instance()->currentScene()->fullyQualifiedName();\n        \/\/ saveProject();\n\n        \/\/Set the focus to the entire window, so that we do not accidentally trigger actions\n        \/\/ setFocus();\n\n        \/\/Start the game loop\n        \/\/Note that this starts an infinite loop in Game\n        GluonEngine::Game::instance()->runGame();\n        QApplication::instance()->exit();\n        \/\/This happens after we exit the game loop\n        \/\/ stateChanged( \"playing\", StateReverse );\n\n        \/\/ openProject( d->fileName );\n        \/\/ GluonEngine::Game::instance()->setCurrentScene( currentSceneName );\n        \/\/ GluonEngine::Game::instance()->initializeAll();\n    \/\/ }\n}\n\nvoid MainWindow::pauseGame()\n{\n    GluonEngine::Game::instance()->setPause( true );\n    stateChanged( \"paused\" );\n}\n\nvoid MainWindow::stopGame()\n{\n    GluonEngine::Game::instance()->stopGame();\n}\n\n\/\/ void MainWindow::saveProperties(KConfigGroup &config)\n\/\/ {\n    \/\/ if (!m_part)\n        \/\/ loadPart();\n\n    \/\/ m_part->saveProperties(config);\n    \/\/ config.writeEntry(\"docked\", isHidden());\n\/\/ }\n\n\/\/ void MainWindow::readProperties(const KConfigGroup & config)\n\/\/ {\n    \/\/ if (!m_part)\n        \/\/ loadPart();\n    \/\/ m_part->readProperties(config);\n    \/\/ setVisible( !Settings::showTrayIcon() || !config.readEntry(\"docked\", false) );\n\/\/ }\n\n\/\/ TODO: move to part?\nvoid MainWindow::optionsConfigureKeys()\n{\n    KShortcutsDialog dlg( KShortcutsEditor::AllActions,\n    KShortcutsEditor::LetterShortcutsAllowed, this );\n\n    dlg.addCollection(actionCollection());\n    \/\/ if (m_part)\n        \/\/ dlg.addCollection(m_part->actionCollection());\n\n    dlg.configure();\n}\n\n\/\/ TODO: move to part?\n void MainWindow::optionsConfigureToolbars()\n{\n    \/\/ saveMainWindowSettings(KGlobal::config().data()->group( autoSaveGroup()) );\n    \/\/ KEditToolBar dlg(factory());\n    \/\/ connect(&dlg, SIGNAL(newToolBarConfig()),\n            \/\/ this, SLOT(applyNewToolbarConfig()));\n    \/\/ dlg.exec();\n}\n\nvoid MainWindow::mLogin( )\n{\n}\n\nvoid MainWindow::mLogout( )\n{\n}\n\nvoid MainWindow::mHome()\n{\n}\n\nvoid MainWindow::mDetails()\n{\n}\n\nvoid MainWindow::mRegistration()\n{\n}\n\nvoid MainWindow::mForgottenPassword()\n{\n}\n\nvoid MainWindow::closeEvent( QCloseEvent* event )\n{\n    GluonEngine::Game::instance()->stopGame();\n    QWidget::closeEvent( event );\n}\n\nvoid MainWindow::resizeEvent( QResizeEvent* event )\n{\n    m_viewportWidth = event->size().width();\n    m_viewportHeight = event->size().height();\n    glViewport( 0, 0, m_viewportWidth, m_viewportHeight );\n}\n\nvoid MainWindow::showGames()\n{\n    m_gamesOverlay->setGeometry( geometry() );\n    connect( m_gamesOverlay, SIGNAL( gameToPlaySelected( QModelIndex ) ), SLOT( setProject( QModelIndex ) ) );\n}\n\nvoid MainWindow::setProject( const QModelIndex& index )\n{\n    m_gameFileName = index.data(GluonPlayer::GameItemsModel::ProjectFileNameRole).toString();\n    m_gamesOverlay->hide();\n    openProject();\n}\n\nvoid MainWindow::openProject()\n{\n    if( m_gameFileName.isEmpty() )\n    {\n        return;\n    }\n\n    d->widget = new GluonGraphics::RenderWidget( this );\n    setCentralWidget( d->widget );\n\n    connect( GluonEngine::Game::instance(), SIGNAL( painted( int ) ), d->widget, SLOT( updateGL() ) );\n    connect( GluonEngine::Game::instance(), SIGNAL( painted( int ) ), SLOT( countFrames( int ) ) );\n    connect( GluonEngine::Game::instance(), SIGNAL( updated( int ) ), SLOT( updateTitle( int ) ) );\n\n    GluonInput::InputManager::instance()->setFilteredObject(d->widget);\n    QTimer::singleShot( 1000, this, SLOT( startGame() ) );\n}\n\nvoid MainWindow::activated( QModelIndex index )\n{\n    if( index.isValid() )\n    {\n    }\n}\n\nvoid MainWindow::updateTitle( int msec )\n{\n    d->msecElapsed += msec;\n\n    static int fps = 0;\n    if( d->msecElapsed > 1000 )\n    {\n        fps = d->frameCount;\n        d->frameCount = 0;\n        d->msecElapsed = 0;\n    }\n\n    setWindowTitle( d->title + QString( \" (%1 FPS)\" ).arg( fps ) );\n}\n\nvoid MainWindow::countFrames( int \/* time *\/ )\n{\n    d->frameCount++;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2011, James Webber.\n\/\/ Distributed under a 3-clause BSD license.  See COPYING.\n\n#ifndef UTIL_ASSERTS_HPP_45mln30x\n#define UTIL_ASSERTS_HPP_45mln30x\n\n#include <iostream>\n#include <cstdlib>\n#include <cstring>\n\n#include \"btrace_defines.hpp\"\n#include \"..\/btrace\/assert.hpp\"\n\nnamespace asserts {\n  namespace detail {\n    template<class T> T *check_pointer(int line, const char *file, T *p, const char *code) {\n      if (p == NULL) {\n        std::cerr\n          << \"nerve: \" << file << \":\" << line << \":\\n\"\n          << \"  expression: '\" << code << \"'\\n\"\n          << \"  must yield a non-null pointer\" << std::endl;\n        std::abort();\n      }\n      return p;\n    }\n  }\n}\n\n\/\/! \\ingroup grp_asserts\n\/\/! Abort with a sensible message.\n#define NERVE_ABORT(msg__)\\\n  do {\\\n    std::cerr << \"nerve: aborting: \" << msg__ << std::endl;\\\n    std::abort();\\\n  } while (false);\n\n\n\/\/! \\ingroup grp_asserts\n\/\/! Assertion with message.\n#define NERVE_ASSERT(code__, msg__) BTRACE_ASSERT(code__, msg__)\n\n\/\/! \\ingroup grp_asserts\n\/\/! Alias.\n#define NERVE_ASSERT_PTR(var__) NERVE_ASSERT(var__ != NULL, #var__ \" must not be null\")\n\n\/\/! \\ingroup grp_asserts\n\/\/! Check the pointer is non-null and return it.\n#define NERVE_CHECK_PTR(expr__) BTRACE_ASSERT_PTR(expr__)\n\n\/\/! \\ingroup grp_asserts\n\/\/! Assertion with message but don't abort afterwards.\n#define NERVE_WASSERT(code__, msg__)\\\n  do {\\\n    if (! (code__)) {\\\n      std::cerr << \"nerve: assert: '\" << #code__ << \"': \" << msg__ << std::endl;\\\n    }\\\n  } while(false);\n\n\/\/! \\ingroup grp_asserts\n\/\/! Something is not implemented\n#define NERVE_NIMPL(what__)\\\n  do {\\\n    std::cerr << __FILE__ << \":\" << __LINE__ << \": warning: \" << std::endl;\\\n    std::cerr << \"  in \" << __PRETTY_FUNCTION__ << std::endl;\\\n    std::cerr << \"  not implemented: \" << what__ << std::endl;\\\n  } while (false);\n\n\/\/! \\ingroup grp_asserts\n\/\/! Wipe memory.\n#define NERVE_WIPE(p__, size__) std::memset(p__, 0, size__)\n\n#endif\n<commit_msg>Tidy up asserts a little more.<commit_after>\/\/ Copyright (C) 2011, James Webber.\n\/\/ Distributed under a 3-clause BSD license.  See COPYING.\n\n#ifndef UTIL_ASSERTS_HPP_45mln30x\n#define UTIL_ASSERTS_HPP_45mln30x\n\n#include <iostream>\n#include <cstdlib>\n#include <cstring>\n\n#include \"btrace_defines.hpp\"\n#include \"..\/btrace\/assert.hpp\"\n\n\/\/! \\ingroup grp_asserts\n\/\/! Abort with a sensible message.\n#define NERVE_ABORT(msg__)\\\n  do {\\\n    std::cerr << \"nerve: aborting: \" << msg__ << std::endl;\\\n    std::abort();\\\n  } while (false);\n\n\/\/! \\ingroup grp_asserts\n\/\/! Assertion with message.\n#define NERVE_ASSERT(code__, msg__) BTRACE_ASSERT(code__, msg__)\n\n\/\/! \\ingroup grp_asserts\n\/\/! Alias.\n#define NERVE_ASSERT_PTR(var__) NERVE_ASSERT(var__ != NULL, #var__ \" must not be null\")\n\n\/\/! \\ingroup grp_asserts\n\/\/! Check the pointer is non-null and return it.\n#define NERVE_CHECK_PTR(expr__) BTRACE_ASSERT_PTR(expr__)\n\n\/\/! \\ingroup grp_asserts\n\/\/! Assertion with message but don't abort afterwards.\n#define NERVE_WASSERT(code__, msg__)\\\n  do {\\\n    if (! (code__)) {\\\n      std::cerr << \"nerve: assert: '\" << #code__ << \"': \" << msg__ << std::endl;\\\n    }\\\n  } while(false);\n\n\/\/! \\ingroup grp_asserts\n\/\/! Something is not implemented\n#define NERVE_NIMPL(what__)\\\n  do {\\\n    std::cerr << __FILE__ << \":\" << __LINE__ << \": warning: \" << std::endl;\\\n    std::cerr << \"  in \" << __PRETTY_FUNCTION__ << std::endl;\\\n    std::cerr << \"  not implemented: \" << what__ << std::endl;\\\n  } while (false);\n\n\/\/! \\ingroup grp_asserts\n\/\/! Wipe memory.\n#ifndef NERVE_DEVELOPER\n#  error \"Need NERVE_DEVELOPER.\"\n#elif NERVE_DEVELOPER\n#  define NERVE_WIPE(p__, size__) std::memset(p__, 0, size__)\n#else\n#  define NERVE_WIPE(p__, size__)\n#endif\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 Luke San Antonio\n * All rights reserved.\n *\/\n#include \"server_protocol.h\"\n#include \"..\/common\/log.h\"\nnamespace redc { namespace net\n{\n  void init_server(Server_Context& ctx) noexcept\n  {\n    ctx.host = std::move(*make_server_host(ctx.port, ctx.max_peers).ok());\n  }\n\n  void step_remote_client(Server_Context& ctx,\n                          Client_State_And_Buffer& client,\n                          ENetEvent const& event) noexcept\n  {\n    \/\/ We can assume we got a recieve event I guess.\n    switch(client.state)\n    {\n      case Remote_Client_State::Version:\n      {\n        \/\/ Recieve version\n        if(!recieve_data(client.version, event.packet))\n        {\n          \/\/ Err, ignore:\n          break;\n        }\n\n        \/\/ Make sure the version is correct\n        Version_Okay versions_okay;\n        versions_okay.protocol =\n          client.version.protocol_version == CLIENT_PROTOCOL_VERSION;\n        versions_okay.client = client.version.client_version == 1;\n\n        \/\/ Inform the client\n        send_data(versions_okay, event.peer);\n\n        if(!versions_okay.protocol || !versions_okay.client)\n        {\n          if(!versions_okay.protocol && versions_okay.client)\n          {\n            log_i(\"Rejecting client (game version = %) because we don't know \"\n                  \"protocol version %\",\n                  client.version.client_version,\n                  client.version.protocol_version);\n          }\n          else if(versions_okay.protocol && !versions_okay.client)\n          {\n            log_i(\"Rejecting client (protocol version = %) because we don't \"\n                  \"know game client version %\",\n                  client.version.protocol_version,\n                  client.version.client_version);\n          }\n          else if(!versions_okay.protocol && !versions_okay.client)\n          {\n            log_i(\"Rejecting client because we don't know protocol version % \"\n                  \"or game client version %\",\n                  client.version.protocol_version,\n                  client.version.client_version);\n          }\n\n          \/\/ Disconnect the peer and jump ship.\n          enet_peer_disconnect_later(event.peer, 0);\n\n          break;\n        }\n\n        client.state = Remote_Client_State::Name;\n\n        break;\n      }\n      case Remote_Client_State::Name:\n      {\n        if(!recieve_data(client.player_name, event.packet)) break;\n\n        send_data(ctx.info, event.peer);\n        client.state = Remote_Client_State::Inventory;\n\n        break;\n      }\n      case Remote_Client_State::Inventory:\n      {\n        \/\/ Failed to read inventory\n        if(!recieve_data(client.inventory, event.packet)) break;\n\n        send_data(true, event.peer);\n        client.state = Remote_Client_State::Team_Id;\n\n        break;\n      }\n      case Remote_Client_State::Team_Id:\n      {\n        \/\/ Failed to read team id.\n        if(!recieve_data(client.team, event.packet)) break;\n\n        Spawn_Information spawn_info;\n\n        \/\/ TODO: Fill in spawn information\n\n        send_data(spawn_info, event.peer);\n        client.state = Remote_Client_State::Playing;\n\n        break;\n      }\n      case Remote_Client_State::Playing:\n      default:\n      {\n        Input cur_input;\n        if(!recieve_data(cur_input, event.packet))\n        {\n          \/\/ Possibly handle other types of packets.\n          break;\n        }\n\n        client.inputs.push_back(cur_input);\n\n        break;\n      }\n    }\n  }\n\n  Client_Vector_Iter find_client_by_peer(Client_Vector& cts,\n                                         ENetPeer* peer) noexcept\n  {\n    return std::find_if(std::begin(cts), std::end(cts),\n      [&peer](auto& client_state)\n      {\n        return client_state.peer == peer;\n      });\n  }\n\n  void step_server(Server_Context& ctx, ENetEvent const& event) noexcept\n  {\n    switch(event.type)\n    {\n      case ENET_EVENT_TYPE_CONNECT:\n      {\n        \/\/ Oh boy!\n        Client_State_And_Buffer client;\n\n        \/\/ We only know this information, we'll fill out the rest later.\n        client.peer = event.peer;\n        client.state = Remote_Client_State::Version;\n\n        \/\/ Keep track of it, of course\n        ctx.clients.push_back(std::move(client));\n\n        \/\/ At this point we will recieve it's version info.\n        break;\n      }\n      case ENET_EVENT_TYPE_RECEIVE:\n      {\n        \/\/ Progress the state of the client. Jesus Christ that scares me.\n        \/\/ Abstract that, obviously!\n\n        auto client_find = find_client_by_peer(ctx.clients, event.peer);\n\n        \/\/ Find the corect client state and buffer object that will tell us\n        \/\/ what we are actually recieving\n        if(client_find == ctx.clients.end())\n        {\n          \/\/ I don't know when this would happen. Something went quite wrong\n          log_e(\"Recieving data from unknown client - ignoring!\");\n          break;\n        }\n\n        \/\/ Recieve whatever we need to recieve, etc.\n        step_remote_client(ctx, *client_find, event);\n\n        \/\/ Don't forget to destory the packet!\n        enet_packet_destroy(event.packet);\n\n        break;\n      }\n      case ENET_EVENT_TYPE_DISCONNECT:\n      default:\n      {\n        log_i(\"Disconnect event\");\n\n        \/\/ TODO:\n        \/\/ Find an iterator to the right client and remove it from the list of\n        \/\/ clients.\n        auto client_find = find_client_by_peer(ctx.clients, event.peer);\n\n        if(client_find == ctx.clients.end())\n        {\n          \/\/ wat\n        }\n        else\n        {\n          \/\/ Remove it from our clients list.\n          ctx.clients.erase(client_find);\n          \/\/ No need to remove it from teams but we do have to notify everyone\n          \/\/ that this player no longer exists.\n        }\n\n        break;\n      }\n    }\n  }\n} }\n<commit_msg>Fix typos<commit_after>\/*\n * Copyright (C) 2015 Luke San Antonio\n * All rights reserved.\n *\/\n#include \"server_protocol.h\"\n#include \"..\/common\/log.h\"\nnamespace redc { namespace net\n{\n  void init_server(Server_Context& ctx) noexcept\n  {\n    ctx.host = std::move(*make_server_host(ctx.port, ctx.max_peers).ok());\n  }\n\n  void step_remote_client(Server_Context& ctx,\n                          Client_State_And_Buffer& client,\n                          ENetEvent const& event) noexcept\n  {\n    \/\/ We can assume we got a receive event I guess.\n    switch(client.state)\n    {\n      case Remote_Client_State::Version:\n      {\n        \/\/ Receive version\n        if(!recieve_data(client.version, event.packet))\n        {\n          \/\/ Err, ignore:\n          break;\n        }\n\n        \/\/ Make sure the version is correct\n        Version_Okay versions_okay;\n        versions_okay.protocol =\n          client.version.protocol_version == CLIENT_PROTOCOL_VERSION;\n        versions_okay.client = client.version.client_version == 1;\n\n        \/\/ Inform the client\n        send_data(versions_okay, event.peer);\n\n        if(!versions_okay.protocol || !versions_okay.client)\n        {\n          if(!versions_okay.protocol && versions_okay.client)\n          {\n            log_i(\"Rejecting client (game version = %) because we don't know \"\n                  \"protocol version %\",\n                  client.version.client_version,\n                  client.version.protocol_version);\n          }\n          else if(versions_okay.protocol && !versions_okay.client)\n          {\n            log_i(\"Rejecting client (protocol version = %) because we don't \"\n                  \"know game client version %\",\n                  client.version.protocol_version,\n                  client.version.client_version);\n          }\n          else if(!versions_okay.protocol && !versions_okay.client)\n          {\n            log_i(\"Rejecting client because we don't know protocol version % \"\n                  \"or game client version %\",\n                  client.version.protocol_version,\n                  client.version.client_version);\n          }\n\n          \/\/ Disconnect the peer and jump ship.\n          enet_peer_disconnect_later(event.peer, 0);\n\n          break;\n        }\n\n        client.state = Remote_Client_State::Name;\n\n        break;\n      }\n      case Remote_Client_State::Name:\n      {\n        if(!recieve_data(client.player_name, event.packet)) break;\n\n        send_data(ctx.info, event.peer);\n        client.state = Remote_Client_State::Inventory;\n\n        break;\n      }\n      case Remote_Client_State::Inventory:\n      {\n        \/\/ Failed to read inventory\n        if(!recieve_data(client.inventory, event.packet)) break;\n\n        send_data(true, event.peer);\n        client.state = Remote_Client_State::Team_Id;\n\n        break;\n      }\n      case Remote_Client_State::Team_Id:\n      {\n        \/\/ Failed to read team id.\n        if(!recieve_data(client.team, event.packet)) break;\n\n        Spawn_Information spawn_info;\n\n        \/\/ TODO: Fill in spawn information\n\n        send_data(spawn_info, event.peer);\n        client.state = Remote_Client_State::Playing;\n\n        break;\n      }\n      case Remote_Client_State::Playing:\n      default:\n      {\n        Input cur_input;\n        if(!recieve_data(cur_input, event.packet))\n        {\n          \/\/ Possibly handle other types of packets.\n          break;\n        }\n\n        client.inputs.push_back(cur_input);\n\n        break;\n      }\n    }\n  }\n\n  Client_Vector_Iter find_client_by_peer(Client_Vector& cts,\n                                         ENetPeer* peer) noexcept\n  {\n    return std::find_if(std::begin(cts), std::end(cts),\n      [&peer](auto& client_state)\n      {\n        return client_state.peer == peer;\n      });\n  }\n\n  void step_server(Server_Context& ctx, ENetEvent const& event) noexcept\n  {\n    switch(event.type)\n    {\n      case ENET_EVENT_TYPE_CONNECT:\n      {\n        \/\/ Oh boy!\n        Client_State_And_Buffer client;\n\n        \/\/ We only know this information, we'll fill out the rest later.\n        client.peer = event.peer;\n        client.state = Remote_Client_State::Version;\n\n        \/\/ Keep track of it, of course\n        ctx.clients.push_back(std::move(client));\n\n        \/\/ At this point we will receive it's version info.\n        break;\n      }\n      case ENET_EVENT_TYPE_RECEIVE:\n      {\n        \/\/ Progress the state of the client. Jesus Christ that scares me.\n        \/\/ Abstract that, obviously!\n\n        auto client_find = find_client_by_peer(ctx.clients, event.peer);\n\n        \/\/ Find the correct client state and buffer object that will tell us\n        \/\/ what we are actually receiving\n        if(client_find == ctx.clients.end())\n        {\n          \/\/ I don't know when this would happen. Something went quite wrong\n          log_e(\"Receiving data from unknown client - ignoring!\");\n          break;\n        }\n\n        \/\/ Receive whatever we need to receive, etc.\n        step_remote_client(ctx, *client_find, event);\n\n        \/\/ Don't forget to destroy the packet!\n        enet_packet_destroy(event.packet);\n\n        break;\n      }\n      case ENET_EVENT_TYPE_DISCONNECT:\n      default:\n      {\n        log_i(\"Disconnect event\");\n\n        \/\/ TODO:\n        \/\/ Find an iterator to the right client and remove it from the list of\n        \/\/ clients.\n        auto client_find = find_client_by_peer(ctx.clients, event.peer);\n\n        if(client_find == ctx.clients.end())\n        {\n          \/\/ wat\n          \/\/ RIP\n          \/\/ A client we don't know just disconnected from us.\n        }\n        else\n        {\n          \/\/ Remove it from our clients list.\n          ctx.clients.erase(client_find);\n          \/\/ No need to remove it from teams but we do have to notify everyone\n          \/\/ that this player no longer exists.\n        }\n\n        break;\n      }\n    }\n  }\n} }\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2015 In Cheol, Kang\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 \"tcp_acceptor.h\"\n\n#include \"event\/event.h\"\n#include \"event\/event_dispatcher.h\"\n\nnamespace eznetpp {\nnamespace net {\nnamespace tcp {\n\ntcp_acceptor::tcp_acceptor(void) {\n}\n\ntcp_acceptor::~tcp_acceptor(void) {\n}\n\nint tcp_acceptor::open(int port, int backlog) {\n  int ret = bind_and_listen(port, backlog);\n\n  if (ret != 0)\n    return ret;\n\n  set_nonblocking();\n  set_reuseaddr();\n\n  return 0;\n}\n\nvoid tcp_acceptor::recv(void) {\n  struct sockaddr_in client_addr;\n  socklen_t client_addr_len = sizeof(client_addr);\n\n  int sock_fd = ::accept(_sd, (struct sockaddr *)&client_addr, &client_addr_len);\n  _last_errno = errno;\n\n  if (sock_fd == -1) {\n    if (errno == EAGAIN || errno == EWOULDBLOCK) {\n      return;\n    }\n  }\n\n  eznetpp::event::event_dispatcher::instance().push_event(new eznetpp::event::io_event\n      (eznetpp::event::event_type::tcp_accept, sock_fd, inet_ntoa(client_addr.sin_addr), ntohs(client_addr.sin_port), this));\n}\n\nvoid tcp_acceptor::close(void) {\n  ::close(_sd);\n  _sd = -1;\n\n  eznetpp::event::event_dispatcher::instance().push_event(\n      new eznetpp::event::io_event(eznetpp::event::event_type::close, this));\n}\n\nint tcp_acceptor::bind_and_listen(int port, int backlog) {\n  struct sockaddr_in server_addr;\n  bzero(&server_addr, sizeof(server_addr));\n  server_addr.sin_family = AF_INET;\n  server_addr.sin_addr.s_addr = htonl(INADDR_ANY); \n  server_addr.sin_port = htons(port);\n\n  int ret = ::bind(_sd, (struct sockaddr *)&server_addr, sizeof(server_addr));\n\n  if (ret != 0) {\n    eznetpp::util::logger::instance().log(eznetpp::util::logger::log_level::error\n                           , __FILE__, __FUNCTION__, __LINE__\n                           , \"::bind() error(%d)\", errno);\n\n    ::close(_sd);\n    _sd = -1;\n    return errno;\n  }\n\n  ret = ::listen(_sd, backlog);\n\n  if (ret != 0) {\n    eznetpp::util::logger::instance().log(eznetpp::util::logger::log_level::error\n                           , __FILE__, __FUNCTION__, __LINE__\n                           , \"::listen() error(%d)\", errno);\n\n    ::close(_sd);\n    _sd = -1;\n    return errno;\n  }\n\n  return 0;\n}\n\n\n}  \/\/ namespace tcp\n}  \/\/ namespace net\n}  \/\/ namespace eznetpp\n<commit_msg>Modify the code to improve the performance for accepting the client<commit_after>\/* Copyright (c) 2015 In Cheol, Kang\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 \"tcp_acceptor.h\"\n\n#include \"event\/event.h\"\n#include \"event\/event_dispatcher.h\"\n\nnamespace eznetpp {\nnamespace net {\nnamespace tcp {\n\ntcp_acceptor::tcp_acceptor(void) {\n}\n\ntcp_acceptor::~tcp_acceptor(void) {\n}\n\nint tcp_acceptor::open(int port, int backlog) {\n  int ret = bind_and_listen(port, backlog);\n\n  if (ret != 0)\n    return ret;\n\n  set_nonblocking();\n  set_reuseaddr();\n\n  return 0;\n}\n\nvoid tcp_acceptor::recv(void) {\n  while (1) {\n    struct sockaddr_in client_addr;\n    socklen_t client_addr_len = sizeof(client_addr);\n\n    int sock_fd = ::accept(_sd, (struct sockaddr *)&client_addr, &client_addr_len);\n    _last_errno = errno;\n\n    if (sock_fd == -1) {\n      if (errno == EAGAIN || errno == EWOULDBLOCK) {\n        break;\n      }\n    }\n\n    eznetpp::event::event_dispatcher::instance().push_event(new eznetpp::event::io_event\n        (eznetpp::event::event_type::tcp_accept, sock_fd, inet_ntoa(client_addr.sin_addr), ntohs(client_addr.sin_port), this));\n  }\n}\n\nvoid tcp_acceptor::close(void) {\n  ::close(_sd);\n  _sd = -1;\n\n  eznetpp::event::event_dispatcher::instance().push_event(\n      new eznetpp::event::io_event(eznetpp::event::event_type::close, this));\n}\n\nint tcp_acceptor::bind_and_listen(int port, int backlog) {\n  struct sockaddr_in server_addr;\n  bzero(&server_addr, sizeof(server_addr));\n  server_addr.sin_family = AF_INET;\n  server_addr.sin_addr.s_addr = htonl(INADDR_ANY); \n  server_addr.sin_port = htons(port);\n\n  int ret = ::bind(_sd, (struct sockaddr *)&server_addr, sizeof(server_addr));\n\n  if (ret != 0) {\n    eznetpp::util::logger::instance().log(eznetpp::util::logger::log_level::error\n                           , __FILE__, __FUNCTION__, __LINE__\n                           , \"::bind() error(%d)\", errno);\n\n    ::close(_sd);\n    _sd = -1;\n    return errno;\n  }\n\n  ret = ::listen(_sd, backlog);\n\n  if (ret != 0) {\n    eznetpp::util::logger::instance().log(eznetpp::util::logger::log_level::error\n                           , __FILE__, __FUNCTION__, __LINE__\n                           , \"::listen() error(%d)\", errno);\n\n    ::close(_sd);\n    _sd = -1;\n    return errno;\n  }\n\n  return 0;\n}\n\n\n}  \/\/ namespace tcp\n}  \/\/ namespace net\n}  \/\/ namespace eznetpp\n<|endoftext|>"}
{"text":"<commit_before>#include \"API.hpp\"\n#include \"ros\/ros.h\"\n#include <ros\/console.h>\n#include \"api_application\/Announce.h\"\n#include <vector> \n\nclass API\n{\n    public:\n\tAPI(int argc, char **argv)\n\t{\n\t\tidCounter = 0;\n\t\tros::init(argc, argv, \"api_server\");\n\t\tros::NodeHandle n;\n\t\tros::ServiceServer service = n.advertiseService(\"announce\", API::announce);\n\t\tROS_INFO(\"Ready to deliver IDs.\");\n\t\tros::spin();\n\t\treturn 0;\n\t}\n\t\n\tbool announce(api_application::Announce::Request &req, api_application::Announce::Response &res)\n\t{\n\t    res.id = idCounter++;\n\t    switch (req.type) {\n\t\tcase 0:\n\t\t    cameras.push_back({res.id, req.camera_id});\n\t\t    break;\n\t\tcase 1:\n\t\t    quadcopters.push_back(res.id);\n\t\t    break;\n\t\tcase 2:\n\t\t    controllers.push_back(res.id);\n\t\t    break;\n\t\tcase 3:\n\t\t    positions.push_back(res.id);\n\t\t    break;\n\t\tdefault:\n\t\t    ROS_ERROR(\"Malformed register attempt!\");\n\t\t    res.id = -1;\n\t\t    return false;\n\t    }\n\t    ROS_INFO(\"Registered new module with type %d and id %d\", req.type, res.id);\n\t    return true;\n\t}\n\t\n\tprivate:\n\t    int idCounter;\n\t    \n\t    \/\/the ids of modules by category\n\t    std::vector<int[2]> cameras; \/\/first value is the module id, second the camera id\n\t    std::vector<int> quadcopters;\n\t    std::vector<int> controllers;\n\t    std::vector<int> positions;\n};<commit_msg>Corrected callback function<commit_after>#include \"API.hpp\"\n#include \"ros\/ros.h\"\n#include <ros\/console.h>\n#include \"api_application\/Announce.h\"\n#include <vector> \n\nclass API\n{\n    public:\n\tAPI(int argc, char **argv)\n\t{\n\t\tidCounter = 0;\n\t\tros::init(argc, argv, \"api_server\");\n\t\tros::NodeHandle n;\n\t\tros::ServiceServer service = n.advertiseService(\"announce\", &API::announce, this);\n\t\tROS_INFO(\"Ready to deliver IDs.\");\n\t\tros::spin();\n\t}\n\t\n\tbool announce(api_application::Announce::Request &req, api_application::Announce::Response &res)\n\t{\n\t    res.id = idCounter++;\n\t    switch (req.type) {\n\t\tcase 0:\n\t\t    cameras.push_back({res.id, req.camera_id});\n\t\t    break;\n\t\tcase 1:\n\t\t    quadcopters.push_back(res.id);\n\t\t    break;\n\t\tcase 2:\n\t\t    controllers.push_back(res.id);\n\t\t    break;\n\t\tcase 3:\n\t\t    positions.push_back(res.id);\n\t\t    break;\n\t\tdefault:\n\t\t    ROS_ERROR(\"Malformed register attempt!\");\n\t\t    res.id = -1;\n\t\t    return false;\n\t    }\n\t    ROS_INFO(\"Registered new module with type %d and id %d\", req.type, res.id);\n\t    return true;\n\t}\n\t\n\tprivate:\n\t    int idCounter;\n\t    \n\t    \/\/the ids of modules by category\n\t    std::vector<int[2]> cameras; \/\/first value is the module id, second the camera id\n\t    std::vector<int> quadcopters;\n\t    std::vector<int> controllers;\n\t    std::vector<int> positions;\n};<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2014-2017 Kacper Kasper <kacperkasper@gmail.com>\n * All rights reserved. Distributed under the terms of the MIT license.\n *\/\n\n#include \"App.h\"\n\n#include <AboutWindow.h>\n#include <Alert.h>\n#include <Catalog.h>\n#include <Directory.h>\n#include <Entry.h>\n#include <File.h>\n#include <FindDirectory.h>\n#include <Path.h>\n\n#include <string>\n#include <vector>\n\n#include \"AppPreferencesWindow.h\"\n#include \"EditorWindow.h\"\n#include \"FindWindow.h\"\n#include \"Preferences.h\"\n#include \"Styler.h\"\n#include \"QuitAlert.h\"\n\n\n#undef B_TRANSLATION_CONTEXT\n#define B_TRANSLATION_CONTEXT \"App\"\n\n\nApp::App()\n\t:\n\tBApplication(gAppMime),\n\tfLastActiveWindow(nullptr),\n\tfAppPreferencesWindow(nullptr),\n\tfFindWindow(nullptr),\n\tfPreferences(nullptr)\n{\n}\n\n\nApp::~App()\n{\n\tEditorWindow* window;\n\twhile(fWindows.CountItems() > 0) {\n\t\twindow = fWindows.RemoveItemAt(0);\n\t\tif(fWindows.CountItems() == 0) {\n\t\t\tfPreferences->fWindowRect = window->Frame();\n\t\t}\n\t\tif(window->LockLooper())\n\t\t{\n\t\t\twindow->Quit();\n\t\t}\n\t}\n\n\tfPreferences->Save(fPreferencesFile.Path());\n\tdelete fPreferences;\n}\n\n\nvoid\nApp::Init()\n{\n\tBPath settingsPath;\n\tfind_directory(B_USER_SETTINGS_DIRECTORY, &settingsPath);\n\tsettingsPath.Append(gAppName);\n\tBDirectory preferencesDir(settingsPath.Path());\n\tif(preferencesDir.InitCheck() == B_ENTRY_NOT_FOUND) {\n\t\tpreferencesDir.CreateDirectory(settingsPath.Path(), &preferencesDir);\n\t}\n\n\tfPreferencesFile.SetTo(&preferencesDir, \"settings\");\n\tfPreferences = new Preferences();\n\tfPreferences->Load(fPreferencesFile.Path());\n\tfPreferences->fSettingsPath = settingsPath;\n\tEditorWindow::SetPreferences(fPreferences);\n\n\tLanguages::LoadLanguages();\n}\n\n\nvoid\nApp::AboutRequested()\n{\n\tconst char* specialThanks[] = {\n\t\tB_TRANSLATE(\"Neil Hodgson, for Scintilla editing component and SciTE editor.\"),\n\t\tnullptr\n\t};\n\n\tBAboutWindow* window = new BAboutWindow(gAppName, gAppMime);\n\twindow->AddCopyright(2016, \"Kacper Kasper\");\n\twindow->AddDescription(\n\t\tB_TRANSLATE(\"Code editor for Haiku based on Scintilla editing component.\"));\n\twindow->AddSpecialThanks(specialThanks);\n\twindow->AddExtraInfo(B_TRANSLATE(\"Distributed on MIT license terms.\"));\n\twindow->Show();\n}\n\n\nbool\nApp::QuitRequested()\n{\n\tBObjectList<EditorWindow> unsaved;\n\tstd::vector<std::string> unsavedPaths;\n\tEditorWindow* current;\n\tfor(int i = 0; current = fWindows.ItemAt(i); ++i) {\n\t\tif(current->IsModified()) {\n\t\t\tunsaved.AddItem(current);\n\t\t\tunsavedPaths.push_back(std::string(current->OpenedFilePath()));\n\t\t}\n\t}\n\tif(unsaved.IsEmpty()) {\n\t\treturn true;\n\t}\n\tQuitAlert* quitAlert = new QuitAlert(unsavedPaths);\n\tauto filesToSave = quitAlert->Go();\n\tif(filesToSave.empty()) {\n\t\tfLastActiveWindow->Activate();\n\t\treturn false;\n\t}\n\tfor(int i = 0; current = unsaved.ItemAt(i); ++i) {\n\t\tif(filesToSave[i] == false) continue;\n\t\tBMessage reply;\n\t\tBMessage save(SAVE_FILE);\n\t\tBMessenger messenger((BWindow*) current);\n\t\tmessenger.SendMessage(&save, &reply);\n\t\t\t\/\/ FIXME: this is smelly\n\t}\n\treturn true;\n}\n\n\nvoid\nApp::ReadyToRun()\n{\n\tif(CountWindows() == 0) {\n\t\tPostMessage(WINDOW_NEW);\n\t}\n}\n\n\nvoid\nApp::ArgvReceived(int32 argc, char** argv)\n{\n\tentry_ref ref;\n\tBEntry entry;\n\tfor(int32 i = 1; i < argc; ++i) {\n\t\tSci_Position line = -1;\n\t\tSci_Position column = -1;\n\t\tBString argument(argv[i]);\n\t\tBString filename;\n\t\tBString lineStr, columnStr;\n\t\t\/\/ first :\n\t\tint32 pos = argument.FindFirst(':');\n\t\tif(pos != B_ERROR) {\n\t\t\targument.CopyInto(filename, 0, pos);\n\t\t\t\/\/ second :\n\t\t\tint32 pos2 = argument.FindFirst(':', pos + 1);\n\t\t\tif(pos2 != B_ERROR) {\n\t\t\t\targument.CopyInto(lineStr, pos + 1, pos2);\n\t\t\t\targument.CopyInto(columnStr, pos2 + 1, argument.Length());\n\t\t\t} else {\n\t\t\t\targument.CopyInto(lineStr, pos + 1, argument.Length());\n\t\t\t}\n\t\t\tline = strtol(lineStr.String(), nullptr, 10) - 1;\n\t\t\tcolumn = strtol(columnStr.String(), nullptr, 10) - 1;\n\t\t} else {\n\t\t\tfilename = argument;\n\t\t}\n\t\tentry.SetTo(filename);\n\t\tentry.GetRef(&ref);\n\t\tEditorWindow* window = new EditorWindow();\n\t\twindow->OpenFile(&ref, line, column);\n\t\twindow->Show();\n\t\tfWindows.AddItem(window);\n\t}\n}\n\n\nvoid\nApp::RefsReceived(BMessage* message)\n{\n\tint32 count;\n\tif(message->GetInfo(\"refs\", nullptr, &count) != B_OK) {\n\t\treturn;\n\t}\n\tentry_ref ref;\n\tfor(int32 i = 0; i < count; ++i) {\n\t\tif(message->FindRef(\"refs\", i, &ref) == B_OK) {\n\t\t\tEditorWindow* window = new EditorWindow();\n\t\t\twindow->OpenFile(&ref);\n\t\t\twindow->Show();\n\t\t\tfWindows.AddItem(window);\n\t\t}\n\t}\n}\n\n\nvoid\nApp::MessageReceived(BMessage* message)\n{\n\tswitch(message->what) {\n\tcase ACTIVE_WINDOW_CHANGED: {\n\t\tif(message->FindPointer(\"window\", (void**) &fLastActiveWindow) != B_OK) {\n\t\t\tfLastActiveWindow = nullptr;\n\t\t}\n\t} break;\n\tcase APP_PREFERENCES_CHANGED: {\n\t\tfor(uint32 i = 0, count = fWindows.CountItems(); i < count; i++) {\n\t\t\tBMessenger messenger((BWindow*) fWindows.ItemAt(i));\n\t\t\tmessenger.SendMessage(message);\n\t\t}\n\t} break;\n\tcase APP_PREFERENCES_QUITTING: {\n\t\tfAppPreferencesWindow = nullptr;\n\t} break;\n\tcase FINDWINDOW_FIND:\n\tcase FINDWINDOW_REPLACE:\n\tcase FINDWINDOW_REPLACEFIND:\n\tcase FINDWINDOW_REPLACEALL: {\n\t\t\/\/ TODO: == nullptr should never happen, alert if it somehow does?\n\t\tif(fLastActiveWindow != nullptr) {\n\t\t\tBMessenger messenger((BWindow*) fLastActiveWindow);\n\t\t\tmessenger.SendMessage(message);\n\t\t}\n\t} break;\n\tcase FINDWINDOW_QUITTING: {\n\t\tfFindWindow = nullptr;\n\t} break;\n\tcase MAINMENU_EDIT_APP_PREFERENCES: {\n\t\tif(fAppPreferencesWindow == nullptr) {\n\t\t\tfAppPreferencesWindow = new AppPreferencesWindow(fPreferences);\n\t\t}\n\t\tfAppPreferencesWindow->Show();\n\t\tfAppPreferencesWindow->Activate();\n\t} break;\n\tcase MAINMENU_SEARCH_FINDREPLACE: {\n\t\tif(fFindWindow == nullptr) {\n\t\t\tfFindWindow = new FindWindow();\n\t\t}\n\t\tfFindWindow->Show();\n\t\tfFindWindow->Activate();\n\t} break;\n\tcase WINDOW_NEW: {\n\t\tEditorWindow* window = new EditorWindow();\n\t\twindow->Show();\n\t\tfWindows.AddItem(window);\n\t} break;\n\tcase WINDOW_CLOSE: {\n\t\tEditorWindow* window;\n\t\tif(message->FindPointer(\"window\", (void**) &window) == B_OK) {\n\t\t\tfWindows.RemoveItem(window);\n\t\t}\n\t\tif(fWindows.CountItems() == 0) {\n\t\t\tfPreferences->fWindowRect = window->Frame();\n\t\t\tQuit();\n\t\t}\n\t} break;\n\tdefault:\n\t\tBApplication::MessageReceived(message);\n\tbreak;\n\t}\n}\n<commit_msg>Handle parameters from \/bin\/open.<commit_after>\/*\n * Copyright 2014-2017 Kacper Kasper <kacperkasper@gmail.com>\n * All rights reserved. Distributed under the terms of the MIT license.\n *\/\n\n#include \"App.h\"\n\n#include <AboutWindow.h>\n#include <Alert.h>\n#include <Catalog.h>\n#include <Directory.h>\n#include <Entry.h>\n#include <File.h>\n#include <FindDirectory.h>\n#include <Path.h>\n\n#include <string>\n#include <vector>\n\n#include \"AppPreferencesWindow.h\"\n#include \"EditorWindow.h\"\n#include \"FindWindow.h\"\n#include \"Preferences.h\"\n#include \"Styler.h\"\n#include \"QuitAlert.h\"\n\n\n#undef B_TRANSLATION_CONTEXT\n#define B_TRANSLATION_CONTEXT \"App\"\n\n\nApp::App()\n\t:\n\tBApplication(gAppMime),\n\tfLastActiveWindow(nullptr),\n\tfAppPreferencesWindow(nullptr),\n\tfFindWindow(nullptr),\n\tfPreferences(nullptr)\n{\n}\n\n\nApp::~App()\n{\n\tEditorWindow* window;\n\twhile(fWindows.CountItems() > 0) {\n\t\twindow = fWindows.RemoveItemAt(0);\n\t\tif(fWindows.CountItems() == 0) {\n\t\t\tfPreferences->fWindowRect = window->Frame();\n\t\t}\n\t\tif(window->LockLooper())\n\t\t{\n\t\t\twindow->Quit();\n\t\t}\n\t}\n\n\tfPreferences->Save(fPreferencesFile.Path());\n\tdelete fPreferences;\n}\n\n\nvoid\nApp::Init()\n{\n\tBPath settingsPath;\n\tfind_directory(B_USER_SETTINGS_DIRECTORY, &settingsPath);\n\tsettingsPath.Append(gAppName);\n\tBDirectory preferencesDir(settingsPath.Path());\n\tif(preferencesDir.InitCheck() == B_ENTRY_NOT_FOUND) {\n\t\tpreferencesDir.CreateDirectory(settingsPath.Path(), &preferencesDir);\n\t}\n\n\tfPreferencesFile.SetTo(&preferencesDir, \"settings\");\n\tfPreferences = new Preferences();\n\tfPreferences->Load(fPreferencesFile.Path());\n\tfPreferences->fSettingsPath = settingsPath;\n\tEditorWindow::SetPreferences(fPreferences);\n\n\tLanguages::LoadLanguages();\n}\n\n\nvoid\nApp::AboutRequested()\n{\n\tconst char* specialThanks[] = {\n\t\tB_TRANSLATE(\"Neil Hodgson, for Scintilla editing component and SciTE editor.\"),\n\t\tnullptr\n\t};\n\n\tBAboutWindow* window = new BAboutWindow(gAppName, gAppMime);\n\twindow->AddCopyright(2016, \"Kacper Kasper\");\n\twindow->AddDescription(\n\t\tB_TRANSLATE(\"Code editor for Haiku based on Scintilla editing component.\"));\n\twindow->AddSpecialThanks(specialThanks);\n\twindow->AddExtraInfo(B_TRANSLATE(\"Distributed on MIT license terms.\"));\n\twindow->Show();\n}\n\n\nbool\nApp::QuitRequested()\n{\n\tBObjectList<EditorWindow> unsaved;\n\tstd::vector<std::string> unsavedPaths;\n\tEditorWindow* current;\n\tfor(int i = 0; current = fWindows.ItemAt(i); ++i) {\n\t\tif(current->IsModified()) {\n\t\t\tunsaved.AddItem(current);\n\t\t\tunsavedPaths.push_back(std::string(current->OpenedFilePath()));\n\t\t}\n\t}\n\tif(unsaved.IsEmpty()) {\n\t\treturn true;\n\t}\n\tQuitAlert* quitAlert = new QuitAlert(unsavedPaths);\n\tauto filesToSave = quitAlert->Go();\n\tif(filesToSave.empty()) {\n\t\tfLastActiveWindow->Activate();\n\t\treturn false;\n\t}\n\tfor(int i = 0; current = unsaved.ItemAt(i); ++i) {\n\t\tif(filesToSave[i] == false) continue;\n\t\tBMessage reply;\n\t\tBMessage save(SAVE_FILE);\n\t\tBMessenger messenger((BWindow*) current);\n\t\tmessenger.SendMessage(&save, &reply);\n\t\t\t\/\/ FIXME: this is smelly\n\t}\n\treturn true;\n}\n\n\nvoid\nApp::ReadyToRun()\n{\n\tif(CountWindows() == 0) {\n\t\tPostMessage(WINDOW_NEW);\n\t}\n}\n\n\nvoid\nApp::ArgvReceived(int32 argc, char** argv)\n{\n\tentry_ref ref;\n\tBEntry entry;\n\tfor(int32 i = 1; i < argc; ++i) {\n\t\tSci_Position line = -1;\n\t\tSci_Position column = -1;\n\t\tBString argument(argv[i]);\n\t\tBString filename;\n\t\tBString lineStr, columnStr;\n\t\t\/\/ first :\n\t\tint32 pos = argument.FindFirst(':');\n\t\tif(pos != B_ERROR) {\n\t\t\targument.CopyInto(filename, 0, pos);\n\t\t\t\/\/ second :\n\t\t\tint32 pos2 = argument.FindFirst(':', pos + 1);\n\t\t\tif(pos2 != B_ERROR) {\n\t\t\t\targument.CopyInto(lineStr, pos + 1, pos2);\n\t\t\t\targument.CopyInto(columnStr, pos2 + 1, argument.Length());\n\t\t\t} else {\n\t\t\t\targument.CopyInto(lineStr, pos + 1, argument.Length());\n\t\t\t}\n\t\t\tline = strtol(lineStr.String(), nullptr, 10) - 1;\n\t\t\tcolumn = strtol(columnStr.String(), nullptr, 10) - 1;\n\t\t} else {\n\t\t\tfilename = argument;\n\t\t}\n\t\tentry.SetTo(filename);\n\t\tentry.GetRef(&ref);\n\t\tEditorWindow* window = new EditorWindow();\n\t\twindow->OpenFile(&ref, line, column);\n\t\twindow->Show();\n\t\tfWindows.AddItem(window);\n\t}\n}\n\n\nvoid\nApp::RefsReceived(BMessage* message)\n{\n\tint32 count;\n\tif(message->GetInfo(\"refs\", nullptr, &count) != B_OK) {\n\t\treturn;\n\t}\n\tentry_ref ref;\n\tfor(int32 i = 0; i < count; ++i) {\n\t\tif(message->FindRef(\"refs\", i, &ref) == B_OK) {\n\t\t\tSci_Position line = message->GetInt32(\"be:line\", 0) - 1;\n\t\t\tSci_Position column = message->GetInt32(\"be:column\", 0) - 1;\n\t\t\tEditorWindow* window = new EditorWindow();\n\t\t\twindow->OpenFile(&ref, line, column);\n\t\t\twindow->Show();\n\t\t\tfWindows.AddItem(window);\n\t\t}\n\t}\n}\n\n\nvoid\nApp::MessageReceived(BMessage* message)\n{\n\tswitch(message->what) {\n\tcase ACTIVE_WINDOW_CHANGED: {\n\t\tif(message->FindPointer(\"window\", (void**) &fLastActiveWindow) != B_OK) {\n\t\t\tfLastActiveWindow = nullptr;\n\t\t}\n\t} break;\n\tcase APP_PREFERENCES_CHANGED: {\n\t\tfor(uint32 i = 0, count = fWindows.CountItems(); i < count; i++) {\n\t\t\tBMessenger messenger((BWindow*) fWindows.ItemAt(i));\n\t\t\tmessenger.SendMessage(message);\n\t\t}\n\t} break;\n\tcase APP_PREFERENCES_QUITTING: {\n\t\tfAppPreferencesWindow = nullptr;\n\t} break;\n\tcase FINDWINDOW_FIND:\n\tcase FINDWINDOW_REPLACE:\n\tcase FINDWINDOW_REPLACEFIND:\n\tcase FINDWINDOW_REPLACEALL: {\n\t\t\/\/ TODO: == nullptr should never happen, alert if it somehow does?\n\t\tif(fLastActiveWindow != nullptr) {\n\t\t\tBMessenger messenger((BWindow*) fLastActiveWindow);\n\t\t\tmessenger.SendMessage(message);\n\t\t}\n\t} break;\n\tcase FINDWINDOW_QUITTING: {\n\t\tfFindWindow = nullptr;\n\t} break;\n\tcase MAINMENU_EDIT_APP_PREFERENCES: {\n\t\tif(fAppPreferencesWindow == nullptr) {\n\t\t\tfAppPreferencesWindow = new AppPreferencesWindow(fPreferences);\n\t\t}\n\t\tfAppPreferencesWindow->Show();\n\t\tfAppPreferencesWindow->Activate();\n\t} break;\n\tcase MAINMENU_SEARCH_FINDREPLACE: {\n\t\tif(fFindWindow == nullptr) {\n\t\t\tfFindWindow = new FindWindow();\n\t\t}\n\t\tfFindWindow->Show();\n\t\tfFindWindow->Activate();\n\t} break;\n\tcase WINDOW_NEW: {\n\t\tEditorWindow* window = new EditorWindow();\n\t\twindow->Show();\n\t\tfWindows.AddItem(window);\n\t} break;\n\tcase WINDOW_CLOSE: {\n\t\tEditorWindow* window;\n\t\tif(message->FindPointer(\"window\", (void**) &window) == B_OK) {\n\t\t\tfWindows.RemoveItem(window);\n\t\t}\n\t\tif(fWindows.CountItems() == 0) {\n\t\t\tfPreferences->fWindowRect = window->Frame();\n\t\t\tQuit();\n\t\t}\n\t} break;\n\tdefault:\n\t\tBApplication::MessageReceived(message);\n\tbreak;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- c-basic-offset: 2 -*- *\/\n\/* Copyright(C) 2012 Brazil\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#include <groonga\/tokenizer.h>\n\n#include <kytea\/kytea.h>\n\n#include <string.h>\n\n#include <string>\n#include <vector>\n\nnamespace {\n\ngrn_plugin_mutex *kytea_mutex = NULL;\nkytea::KyteaConfig *kytea_config = NULL;\nkytea::Kytea *kytea_tagger = NULL;\nkytea::StringUtil *kytea_util = NULL;\n\nvoid kytea_init(grn_ctx *ctx);\nvoid kytea_fin(grn_ctx *ctx);\n\nvoid kytea_init(grn_ctx *ctx) {\n  if ((kytea_mutex != NULL) || (kytea_config != NULL) ||\n      (kytea_tagger != NULL) || (kytea_util != NULL)) {\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] TokenKytea is already initialized\");\n    return;\n  }\n\n  kytea_mutex = grn_plugin_mutex_create(ctx);\n  if (kytea_mutex == NULL) {\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_NO_MEMORY_AVAILABLE,\n                     \"[tokenizer] grn_plugin_mutex_create() failed\");\n    return;\n  }\n\n  kytea::KyteaConfig * const config = static_cast<kytea::KyteaConfig *>(\n      GRN_PLUGIN_MALLOC(ctx, sizeof(kytea::KyteaConfig)));\n  if (config != NULL) try {\n    new (config) kytea::KyteaConfig;\n    kytea_config = config;\n    try {\n      kytea_config->setDebug(0);\n      kytea_config->setOnTraining(false);\n      kytea_config->parseRunCommandLine(0, NULL);\n    } catch (...) {\n      kytea_fin(ctx);\n      GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                       \"[tokenizer] kytea::KyteaConfig settings failed\");\n      return;\n    }\n  } catch (...) {\n    GRN_PLUGIN_FREE(ctx, config);\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] kytea::KyteaConfig initialization failed\");\n    return;\n  } else {\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_NO_MEMORY_AVAILABLE,\n                     \"[tokenizer] memory allocation to kytea::KyteaConfig failed\");\n    return;\n  }\n\n  kytea::Kytea * const tagger = static_cast<kytea::Kytea *>(\n      GRN_PLUGIN_MALLOC(ctx, sizeof(kytea::Kytea)));\n  if (tagger != NULL) try {\n    new (tagger) kytea::Kytea;\n    kytea_tagger = tagger;\n    try {\n      kytea_tagger->readModel(kytea_config->getModelFile().c_str());\n    } catch (...) {\n      kytea_fin(ctx);\n      GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                       \"[tokenizer] kytea::Kytea::readModel() failed\");\n      return;\n    }\n  } catch (...) {\n    GRN_PLUGIN_FREE(ctx, tagger);\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] kytea::Kytea initialization failed\");\n    return;\n  } else {\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_NO_MEMORY_AVAILABLE,\n                     \"[tokenizer] memory allocation to kytea::Kytea failed\");\n    return;\n  }\n\n  try {\n    kytea_util = kytea_tagger->getStringUtil();\n  } catch (...) {\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] kytea::Kytea::getStringUtil() failed\");\n    return;\n  }\n}\n\nvoid kytea_fin(grn_ctx *ctx) {\n  kytea_util = NULL;\n\n  if (kytea_tagger != NULL) {\n    kytea_tagger->~Kytea();\n    GRN_PLUGIN_FREE(ctx, kytea_tagger);\n    kytea_tagger = NULL;\n  }\n\n  if (kytea_config != NULL) {\n    kytea_config->~KyteaConfig();\n    GRN_PLUGIN_FREE(ctx, kytea_config);\n    kytea_config = NULL;\n  }\n\n  if (kytea_mutex != NULL) {\n    grn_plugin_mutex_destroy(ctx, kytea_mutex);\n    kytea_mutex = NULL;\n  }\n}\n\nstruct grn_tokenizer_kytea {\n  grn_tokenizer_query *query;\n  kytea::KyteaSentence sentence;\n  std::vector<std::string> tokens;\n  std::size_t id;\n  grn_tokenizer_token token;\n\n  grn_tokenizer_kytea() : query(NULL), sentence(), tokens(), id(0), token() {}\n  ~grn_tokenizer_kytea() {}\n};\n\nvoid grn_tokenizer_kytea_init(grn_ctx *ctx, grn_tokenizer_kytea *tokenizer) {\n  new (tokenizer) grn_tokenizer_kytea;\n  grn_tokenizer_token_init(ctx, &tokenizer->token);\n}\n\nvoid grn_tokenizer_kytea_fin(grn_ctx *ctx, grn_tokenizer_kytea *tokenizer) {\n  grn_tokenizer_token_fin(ctx, &tokenizer->token);\n  if (tokenizer->query != NULL) {\n    grn_tokenizer_query_destroy(ctx, tokenizer->query);\n  }\n  tokenizer->~grn_tokenizer_kytea();\n}\n\ngrn_obj *grn_kytea_init(grn_ctx *ctx, int num_args, grn_obj **args,\n                        grn_user_data *user_data) {\n  grn_tokenizer_query * const query =\n      grn_tokenizer_query_create(ctx, num_args, args);\n  if (query == NULL) {\n    return NULL;\n  }\n\n  grn_tokenizer_kytea * const tokenizer = static_cast<grn_tokenizer_kytea *>(\n      GRN_PLUGIN_MALLOC(ctx, sizeof(grn_tokenizer_kytea)));\n  if (!tokenizer) {\n    grn_tokenizer_query_destroy(ctx, query);\n    GRN_PLUGIN_ERROR(ctx, GRN_NO_MEMORY_AVAILABLE,\n                     \"[tokenizer] memory allocation to grn_tokenizer_kytea failed\");\n    return NULL;\n  }\n\n  try {\n    grn_tokenizer_kytea_init(ctx, tokenizer);\n  } catch (...) {\n    grn_tokenizer_query_destroy(ctx, query);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] tokenizer initialization failed\");\n    return NULL;\n  }\n\n  tokenizer->query = query;\n\n  grn_obj *normalized_query = query->normalized_query;\n  const char *normalized_string;\n  unsigned int normalized_string_length;\n  grn_string_get_normalized(ctx,\n                            normalized_query,\n                            &normalized_string,\n                            &normalized_string_length,\n                            NULL);\n\n  grn_plugin_mutex_lock(ctx, kytea_mutex);\n  try {\n    const std::string str(normalized_string, normalized_string_length);\n    const kytea::KyteaString &surface_str = kytea_util->mapString(str);\n    const kytea::KyteaString &normalized_str = kytea_util->normalize(surface_str);\n    tokenizer->sentence = kytea::KyteaSentence(surface_str, normalized_str);\n    kytea_tagger->calculateWS(tokenizer->sentence);\n  } catch (...) {\n    grn_plugin_mutex_unlock(ctx, kytea_mutex);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] tokenization failed\");\n    return NULL;\n  }\n  grn_plugin_mutex_unlock(ctx, kytea_mutex);\n\n  try {\n    for (std::size_t i = 0; i < tokenizer->sentence.words.size(); ++i) {\n      const std::string &token =\n          kytea_util->showString(tokenizer->sentence.words[i].surface);\n      const char *ptr = token.c_str();\n      unsigned int left = static_cast<unsigned int>(token.length());\n      while (left > 0) {\n        const int char_length =\n            grn_tokenizer_charlen(ctx, ptr, left, query->encoding);\n        if ((char_length == 0) ||\n            (grn_tokenizer_isspace(ctx, ptr, left, query->encoding) != 0)) {\n          break;\n        }\n        ptr += char_length;\n        left -= char_length;\n      }\n      if (left == 0) {\n        tokenizer->tokens.push_back(token);\n      }\n    }\n  } catch (...) {\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] adjustment failed\");\n    return NULL;\n  }\n\n  user_data->ptr = tokenizer;\n  return NULL;\n}\n\ngrn_obj *grn_kytea_next(grn_ctx *ctx, int num_args, grn_obj **args,\n                        grn_user_data *user_data) {\n  grn_tokenizer_kytea * const tokenizer =\n      static_cast<grn_tokenizer_kytea *>(user_data->ptr);\n  const grn_tokenizer_status status =\n      ((tokenizer->id + 1) < tokenizer->tokens.size()) ?\n          GRN_TOKENIZER_CONTINUE : GRN_TOKENIZER_LAST;\n  if (tokenizer->id < tokenizer->tokens.size()) {\n    const std::string &token = tokenizer->tokens[tokenizer->id++];\n    grn_tokenizer_token_push(ctx, &tokenizer->token,\n                             token.c_str(), token.length(), status);\n  } else {\n    grn_tokenizer_token_push(ctx, &tokenizer->token, \"\", 0, status);\n  }\n  return NULL;\n}\n\ngrn_obj *grn_kytea_fin(grn_ctx *ctx, int num_args, grn_obj **args,\n                       grn_user_data *user_data) {\n  grn_tokenizer_kytea * const tokenizer =\n      static_cast<grn_tokenizer_kytea *>(user_data->ptr);\n  if (tokenizer != NULL) {\n    grn_tokenizer_kytea_fin(ctx, tokenizer);\n    GRN_PLUGIN_FREE(ctx, tokenizer);\n  }\n  return NULL;\n}\n\n}  \/\/ namespace\n\nextern \"C\" {\n\n\/*\n  GRN_PLUGIN_INIT() is called to initialize this plugin. Note that an error\n  code must be set in `ctx->rc' on failure.\n *\/\ngrn_rc GRN_PLUGIN_INIT(grn_ctx *ctx) {\n  kytea_init(ctx);\n  return ctx->rc;\n}\n\n\/*\n  GRN_PLUGIN_REGISTER() registers this plugin to the database associated with\n  `ctx'. The registration requires the plugin name and the functions to be\n  called for tokenization.\n *\/\ngrn_rc GRN_PLUGIN_REGISTER(grn_ctx *ctx) {\n  return grn_tokenizer_register(ctx, \"TokenKytea\", 10, grn_kytea_init,\n                                grn_kytea_next, grn_kytea_fin);\n}\n\n\/*\n  GRN_PLUGIN_FIN() is called to finalize the plugin that was initialized by\n  GRN_PLUGIN_INIT().\n *\/\ngrn_rc GRN_PLUGIN_FIN(grn_ctx *ctx) {\n  kytea_fin(ctx);\n  return GRN_SUCCESS;\n}\n\n}  \/\/ extern \"C\"\n<commit_msg>kytea: support tokenized delimiter<commit_after>\/* -*- c-basic-offset: 2 -*- *\/\n\/* Copyright(C) 2012 Brazil\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#include <groonga\/tokenizer.h>\n\n#include <kytea\/kytea.h>\n\n#include <string.h>\n\n#include <string>\n#include <vector>\n\nnamespace {\n\ngrn_plugin_mutex *kytea_mutex = NULL;\nkytea::KyteaConfig *kytea_config = NULL;\nkytea::Kytea *kytea_tagger = NULL;\nkytea::StringUtil *kytea_util = NULL;\n\nvoid kytea_init(grn_ctx *ctx);\nvoid kytea_fin(grn_ctx *ctx);\n\nvoid kytea_init(grn_ctx *ctx) {\n  if ((kytea_mutex != NULL) || (kytea_config != NULL) ||\n      (kytea_tagger != NULL) || (kytea_util != NULL)) {\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] TokenKytea is already initialized\");\n    return;\n  }\n\n  kytea_mutex = grn_plugin_mutex_create(ctx);\n  if (kytea_mutex == NULL) {\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_NO_MEMORY_AVAILABLE,\n                     \"[tokenizer] grn_plugin_mutex_create() failed\");\n    return;\n  }\n\n  kytea::KyteaConfig * const config = static_cast<kytea::KyteaConfig *>(\n      GRN_PLUGIN_MALLOC(ctx, sizeof(kytea::KyteaConfig)));\n  if (config != NULL) try {\n    new (config) kytea::KyteaConfig;\n    kytea_config = config;\n    try {\n      kytea_config->setDebug(0);\n      kytea_config->setOnTraining(false);\n      kytea_config->parseRunCommandLine(0, NULL);\n    } catch (...) {\n      kytea_fin(ctx);\n      GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                       \"[tokenizer] kytea::KyteaConfig settings failed\");\n      return;\n    }\n  } catch (...) {\n    GRN_PLUGIN_FREE(ctx, config);\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] kytea::KyteaConfig initialization failed\");\n    return;\n  } else {\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_NO_MEMORY_AVAILABLE,\n                     \"[tokenizer] memory allocation to kytea::KyteaConfig failed\");\n    return;\n  }\n\n  kytea::Kytea * const tagger = static_cast<kytea::Kytea *>(\n      GRN_PLUGIN_MALLOC(ctx, sizeof(kytea::Kytea)));\n  if (tagger != NULL) try {\n    new (tagger) kytea::Kytea;\n    kytea_tagger = tagger;\n    try {\n      kytea_tagger->readModel(kytea_config->getModelFile().c_str());\n    } catch (...) {\n      kytea_fin(ctx);\n      GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                       \"[tokenizer] kytea::Kytea::readModel() failed\");\n      return;\n    }\n  } catch (...) {\n    GRN_PLUGIN_FREE(ctx, tagger);\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] kytea::Kytea initialization failed\");\n    return;\n  } else {\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_NO_MEMORY_AVAILABLE,\n                     \"[tokenizer] memory allocation to kytea::Kytea failed\");\n    return;\n  }\n\n  try {\n    kytea_util = kytea_tagger->getStringUtil();\n  } catch (...) {\n    kytea_fin(ctx);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] kytea::Kytea::getStringUtil() failed\");\n    return;\n  }\n}\n\nvoid kytea_fin(grn_ctx *ctx) {\n  kytea_util = NULL;\n\n  if (kytea_tagger != NULL) {\n    kytea_tagger->~Kytea();\n    GRN_PLUGIN_FREE(ctx, kytea_tagger);\n    kytea_tagger = NULL;\n  }\n\n  if (kytea_config != NULL) {\n    kytea_config->~KyteaConfig();\n    GRN_PLUGIN_FREE(ctx, kytea_config);\n    kytea_config = NULL;\n  }\n\n  if (kytea_mutex != NULL) {\n    grn_plugin_mutex_destroy(ctx, kytea_mutex);\n    kytea_mutex = NULL;\n  }\n}\n\nstruct grn_tokenizer_kytea {\n  grn_tokenizer_query *query;\n  kytea::KyteaSentence sentence;\n  std::vector<std::string> tokens;\n  std::size_t id;\n  grn_tokenizer_token token;\n  bool have_tokenized_delimiter;\n  const char *rest_query_string;\n  unsigned int rest_query_string_length;\n\n  grn_tokenizer_kytea() :\n    query(NULL),\n    sentence(),\n    tokens(),\n    id(0),\n    token(),\n    have_tokenized_delimiter(false),\n    rest_query_string(NULL)\n  {\n  }\n  ~grn_tokenizer_kytea() {}\n};\n\nvoid grn_tokenizer_kytea_init(grn_ctx *ctx, grn_tokenizer_kytea *tokenizer) {\n  new (tokenizer) grn_tokenizer_kytea;\n  grn_tokenizer_token_init(ctx, &tokenizer->token);\n}\n\nvoid grn_tokenizer_kytea_fin(grn_ctx *ctx, grn_tokenizer_kytea *tokenizer) {\n  grn_tokenizer_token_fin(ctx, &tokenizer->token);\n  if (tokenizer->query != NULL) {\n    grn_tokenizer_query_destroy(ctx, tokenizer->query);\n  }\n  tokenizer->~grn_tokenizer_kytea();\n}\n\ngrn_obj *grn_kytea_init(grn_ctx *ctx, int num_args, grn_obj **args,\n                        grn_user_data *user_data) {\n  grn_tokenizer_query * const query =\n      grn_tokenizer_query_create(ctx, num_args, args);\n  if (query == NULL) {\n    return NULL;\n  }\n\n  grn_tokenizer_kytea * const tokenizer = static_cast<grn_tokenizer_kytea *>(\n      GRN_PLUGIN_MALLOC(ctx, sizeof(grn_tokenizer_kytea)));\n  if (!tokenizer) {\n    grn_tokenizer_query_destroy(ctx, query);\n    GRN_PLUGIN_ERROR(ctx, GRN_NO_MEMORY_AVAILABLE,\n                     \"[tokenizer] memory allocation to grn_tokenizer_kytea failed\");\n    return NULL;\n  }\n\n  try {\n    grn_tokenizer_kytea_init(ctx, tokenizer);\n  } catch (...) {\n    grn_tokenizer_query_destroy(ctx, query);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] tokenizer initialization failed\");\n    return NULL;\n  }\n\n  tokenizer->query = query;\n\n  grn_obj *normalized_query = query->normalized_query;\n  const char *normalized_string;\n  unsigned int normalized_string_length;\n  grn_string_get_normalized(ctx,\n                            normalized_query,\n                            &normalized_string,\n                            &normalized_string_length,\n                            NULL);\n  tokenizer->have_tokenized_delimiter =\n    grn_tokenizer_have_tokenized_delimiter(ctx,\n                                           normalized_string,\n                                           normalized_string_length,\n                                           query->encoding);\n\n  if (tokenizer->have_tokenized_delimiter) {\n    tokenizer->rest_query_string = normalized_string;\n    tokenizer->rest_query_string_length = normalized_string_length;\n  } else {\n  grn_plugin_mutex_lock(ctx, kytea_mutex);\n  try {\n    const std::string str(normalized_string, normalized_string_length);\n    const kytea::KyteaString &surface_str = kytea_util->mapString(str);\n    const kytea::KyteaString &normalized_str = kytea_util->normalize(surface_str);\n    tokenizer->sentence = kytea::KyteaSentence(surface_str, normalized_str);\n    kytea_tagger->calculateWS(tokenizer->sentence);\n  } catch (...) {\n    grn_plugin_mutex_unlock(ctx, kytea_mutex);\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] tokenization failed\");\n    return NULL;\n  }\n  grn_plugin_mutex_unlock(ctx, kytea_mutex);\n\n  try {\n    for (std::size_t i = 0; i < tokenizer->sentence.words.size(); ++i) {\n      const std::string &token =\n          kytea_util->showString(tokenizer->sentence.words[i].surface);\n      const char *ptr = token.c_str();\n      unsigned int left = static_cast<unsigned int>(token.length());\n      while (left > 0) {\n        const int char_length =\n            grn_tokenizer_charlen(ctx, ptr, left, query->encoding);\n        if ((char_length == 0) ||\n            (grn_tokenizer_isspace(ctx, ptr, left, query->encoding) != 0)) {\n          break;\n        }\n        ptr += char_length;\n        left -= char_length;\n      }\n      if (left == 0) {\n        tokenizer->tokens.push_back(token);\n      }\n    }\n  } catch (...) {\n    GRN_PLUGIN_ERROR(ctx, GRN_TOKENIZER_ERROR,\n                     \"[tokenizer] adjustment failed\");\n    return NULL;\n  }\n  }\n\n  user_data->ptr = tokenizer;\n  return NULL;\n}\n\ngrn_obj *grn_kytea_next(grn_ctx *ctx, int num_args, grn_obj **args,\n                        grn_user_data *user_data) {\n  grn_tokenizer_kytea * const tokenizer =\n      static_cast<grn_tokenizer_kytea *>(user_data->ptr);\n\n  if (tokenizer->have_tokenized_delimiter) {\n    unsigned int rest_query_string_length =\n      tokenizer->rest_query_string_length;\n    const char *rest_query_string =\n      grn_tokenizer_tokenized_delimiter_next(ctx,\n                                             &(tokenizer->token),\n                                             tokenizer->rest_query_string,\n                                             rest_query_string_length,\n                                             tokenizer->query->encoding);\n    if (rest_query_string) {\n      tokenizer->rest_query_string_length -=\n        rerest_query_string - tokenizer->rest_query_string;\n    }\n    tokenizer->rest_query_string = rest_query_string;\n  } else {\n  const grn_tokenizer_status status =\n      ((tokenizer->id + 1) < tokenizer->tokens.size()) ?\n          GRN_TOKENIZER_CONTINUE : GRN_TOKENIZER_LAST;\n  if (tokenizer->id < tokenizer->tokens.size()) {\n    const std::string &token = tokenizer->tokens[tokenizer->id++];\n    grn_tokenizer_token_push(ctx, &tokenizer->token,\n                             token.c_str(), token.length(), status);\n  } else {\n    grn_tokenizer_token_push(ctx, &tokenizer->token, \"\", 0, status);\n  }\n  }\n\n  return NULL;\n}\n\ngrn_obj *grn_kytea_fin(grn_ctx *ctx, int num_args, grn_obj **args,\n                       grn_user_data *user_data) {\n  grn_tokenizer_kytea * const tokenizer =\n      static_cast<grn_tokenizer_kytea *>(user_data->ptr);\n  if (tokenizer != NULL) {\n    grn_tokenizer_kytea_fin(ctx, tokenizer);\n    GRN_PLUGIN_FREE(ctx, tokenizer);\n  }\n  return NULL;\n}\n\n}  \/\/ namespace\n\nextern \"C\" {\n\n\/*\n  GRN_PLUGIN_INIT() is called to initialize this plugin. Note that an error\n  code must be set in `ctx->rc' on failure.\n *\/\ngrn_rc GRN_PLUGIN_INIT(grn_ctx *ctx) {\n  kytea_init(ctx);\n  return ctx->rc;\n}\n\n\/*\n  GRN_PLUGIN_REGISTER() registers this plugin to the database associated with\n  `ctx'. The registration requires the plugin name and the functions to be\n  called for tokenization.\n *\/\ngrn_rc GRN_PLUGIN_REGISTER(grn_ctx *ctx) {\n  return grn_tokenizer_register(ctx, \"TokenKytea\", 10, grn_kytea_init,\n                                grn_kytea_next, grn_kytea_fin);\n}\n\n\/*\n  GRN_PLUGIN_FIN() is called to finalize the plugin that was initialized by\n  GRN_PLUGIN_INIT().\n *\/\ngrn_rc GRN_PLUGIN_FIN(grn_ctx *ctx) {\n  kytea_fin(ctx);\n  return GRN_SUCCESS;\n}\n\n}  \/\/ extern \"C\"\n<|endoftext|>"}
{"text":"<commit_before>\/** \\copyright\n * Copyright (c) 2015, 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 ConfigEntry.hxx\n *\n * Configuration option reader classes.\n *\n * @author Balazs Racz\n * @date 31 May 2015\n *\/\n\n#ifndef _NMRANET_CONFIGENTRY_HXX_\n#define _NMRANET_CONFIGENTRY_HXX_\n\n#include <sys\/types.h>\n#include <stdint.h>\n#include <endian.h>\n\n#include \"nmranet\/ConfigRenderer.hxx\"\n\nnamespace nmranet\n{\n\n\/\/\/ Class representing a particular location in the configuration space. All\n\/\/\/ typed configuration objects (atoms as well as groups) will be subclasses of\n\/\/\/ this.\nclass ConfigReference\n{\npublic:\n    \/\/\/ Initializes the config reference from a configuration space offset.\n    \/\/\/\n    \/\/\/ @param offset is the integer offset (0-based) in the address space for\n    \/\/\/ configuration.\n    constexpr explicit ConfigReference(unsigned offset)\n        : offset_(offset)\n    {\n    }\n\n    \/\/\/ Initializes the config reference from an existing config reference.\n    \/\/\/\n    \/\/\/ @param ref is the existing (or saved) config reference.\n    constexpr explicit ConfigReference(const ConfigReference &ref)\n        : offset_(ref.offset())\n    {\n    }\n\n    constexpr unsigned offset() const\n    {\n        return offset_;\n    }\n\nprotected:\n    \/\/\/ zero-based offset from the beginning of the configuration file.\n    unsigned offset_;\n};\n\n\/\/\/\n\/\/\/ Base class for individual configuration entries. Defines helper methods for\n\/\/\/ reading and writing.\n\/\/\/\nclass ConfigEntryBase : public ConfigReference\n{\npublic:\n    INHERIT_CONSTEXPR_CONSTRUCTOR(ConfigEntryBase, ConfigReference)\n\n    static constexpr GroupConfigOptions group_opts()\n    {\n        return GroupConfigOptions();\n    }\n\nprotected:\n    \/\/\/ Reads a given typed variable from the configuration file. DOes not do\n    \/\/\/ any binary conversion (only reads raw data).\n    \/\/\/\n    \/\/\/ @param fd file to read data from.\n    \/\/\/\n    \/\/\/ @return the raw value read from the configuration file.\n    \/\/\/\n    template <class T> T raw_read(int fd) const\n    {\n        T ret;\n        repeated_read(fd, &ret, sizeof(T));\n        return ret;\n    }\n\n    \/\/\/ Writes a given typed variable to the configuration file. Does not do\n    \/\/\/ any binary conversion.\n    \/\/\/\n    \/\/\/ @param fd file to write data to.\n    \/\/\/\n    \/\/\/ @param value the raw value to write to the configuration file.\n    \/\/\/\n    template <class T> void raw_write(int fd, const T &value) const\n    {\n        repeated_write(fd, &value, sizeof(T));\n    }\n\n    \/\/\/ Performs a reliable read from the given FD. Crashes if the read fails.\n    \/\/\/\n    \/\/\/ @param fd the file to read data from\n    \/\/\/ @param buf the location to write data to\n    \/\/\/ @param size how many bytes to read\n    \/\/\/\n    void repeated_read(int fd, void *buf, size_t size) const;\n\n    \/\/\/ Performs a reliable write to the given FD. Crashes if the write fails.\n    \/\/\/\n    \/\/\/ @param fd the file to write data to\n    \/\/\/ @param buf the location of the data to write\n    \/\/\/ @param size how many bytes to write\n    \/\/\/\n    void repeated_write(int fd, const void *buf, size_t size) const;\n};\n\n\/\/\/ Implementation class for numeric configuration entries, templated by the\n\/\/\/ integer type.\ntemplate <class TR> class NumericConfigEntry : public ConfigEntryBase\n{\npublic:\n    INHERIT_CONSTEXPR_CONSTRUCTOR(NumericConfigEntry, ConfigEntryBase)\n\n    \/\/\/ Performs endian conversion.\n    \/\/\/\n    \/\/\/ @param d network-byte-order data\n    \/\/\/\n    \/\/\/ @return host-byte-order data\n    \/\/\/\n    static uint8_t endian_convert(uint8_t d)\n    {\n        return d;\n    }\n    \/\/\/ Performs endian conversion.\n    \/\/\/\n    \/\/\/ @param d network-byte-order data\n    \/\/\/\n    \/\/\/ @return host-byte-order data\n    \/\/\/\n    static uint16_t endian_convert(uint16_t d)\n    {\n        return be16toh(d);\n    }\n    \/\/\/ Performs endian conversion.\n    \/\/\/\n    \/\/\/ @param d network-byte-order data\n    \/\/\/\n    \/\/\/ @return host-byte-order data\n    \/\/\/\n    static uint32_t endian_convert(uint32_t d)\n    {\n        return be32toh(d);\n    }\n    \/\/\/ Performs endian conversion.\n    \/\/\/\n    \/\/\/ @param d network-byte-order data\n    \/\/\/\n    \/\/\/ @return host-byte-order data\n    \/\/\/\n    static uint64_t endian_convert(uint64_t d)\n    {\n        return be64toh(d);\n    }\n\n    \/\/\/ Storage bytes occupied by the instance in the config file.\n    \/\/\/\n    \/\/\/ @return number of bytes that the config parser offset will be\n    \/\/\/ incremented by this entry.\n    \/\/\/\n    static constexpr unsigned size()\n    {\n        return sizeof(TR);\n    }\n\n    constexpr unsigned end_offset()\n    {\n        return offset() + size();\n    }\n\n    constexpr AtomConfigRenderer config_renderer() const\n    {\n        return AtomConfigRenderer(\"int\", size());\n    }\n\n    \/\/\/ Reads the data from the configuration file.\n    \/\/\/\n    \/\/\/ @param fd file descriptor of the config file.\n    \/\/\/\n    \/\/\/ @return value of the configuration atom that *this represents.\n    \/\/\/\n    TR read(int fd) const\n    {\n        return endian_convert(raw_read<TR>(fd));\n    }\n\n    \/\/\/ Writes the data to the configuration file.\n    \/\/\/\n    \/\/\/ @param fd file descriptor of the config file.\n    \/\/\/\n    \/\/\/ @param value of the configuration atom that should be written.\n    \/\/\/\n    void write(int fd, TR d) const\n    {\n        raw_write(fd, endian_convert(d));\n    }\n};\n\nusing Uint8ConfigEntry = NumericConfigEntry<uint8_t>;\nusing Uint16ConfigEntry = NumericConfigEntry<uint16_t>;\nusing Uint32ConfigEntry = NumericConfigEntry<uint32_t>;\nusing Uint64ConfigEntry = NumericConfigEntry<uint64_t>;\n\n\/\/\/ Implementation class for event ID configuration entries.\nclass EventConfigEntry : public Uint64ConfigEntry\n{\npublic:\n    template <typename T>\n    constexpr EventConfigEntry(T t)\n        : Uint64ConfigEntry(t)\n    {\n    }\n\n    constexpr AtomConfigRenderer config_renderer() const\n    {\n        return AtomConfigRenderer(\"eventid\", AtomConfigRenderer::SKIP_SIZE);\n    }\n};\n\n\/\/\/ Implementation class for string configuration entries. The template\n\/\/\/ argument is the string size (total space in bytes used in the configuration\n\/\/\/ space including the NULL character).\ntemplate <unsigned SIZE> class StringConfigEntry : public ConfigEntryBase\n{\npublic:\n    INHERIT_CONSTEXPR_CONSTRUCTOR(StringConfigEntry, ConfigEntryBase)\n\n    \/\/\/ Storage bytes occupied by the instance in the config file.\n    \/\/\/\n    \/\/\/ @return number of bytes that the config parser offset will be\n    \/\/\/ incremented by this entry.\n    \/\/\/\n    static constexpr unsigned size()\n    {\n        return SIZE;\n    }\n\n    static constexpr unsigned end_offset()\n    {\n        return offset() + size();\n    }\n\n    constexpr AtomConfigRenderer config_renderer() const\n    {\n        return AtomConfigRenderer(\"string\", size());\n    }\n\n    string read(int fd) const\n    {\n        string s(size(), '\\0');\n        repeated_read(fd, &s[0], size());\n        size_t real_len = strlen(s.c_str());\n        s.resize(real_len);\n        return s;\n    }\n};\n\n} \/\/ namespace nmranet\n\n#endif \/\/ _NMRANET_CONFIGENTRY_HXX_\n<commit_msg>Makes the renderers static members.<commit_after>\/** \\copyright\n * Copyright (c) 2015, 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 ConfigEntry.hxx\n *\n * Configuration option reader classes.\n *\n * @author Balazs Racz\n * @date 31 May 2015\n *\/\n\n#ifndef _NMRANET_CONFIGENTRY_HXX_\n#define _NMRANET_CONFIGENTRY_HXX_\n\n#include <sys\/types.h>\n#include <stdint.h>\n#include <endian.h>\n\n#include \"nmranet\/ConfigRenderer.hxx\"\n\nnamespace nmranet\n{\n\n\/\/\/ Class representing a particular location in the configuration space. All\n\/\/\/ typed configuration objects (atoms as well as groups) will be subclasses of\n\/\/\/ this.\nclass ConfigReference\n{\npublic:\n    \/\/\/ Initializes the config reference from a configuration space offset.\n    \/\/\/\n    \/\/\/ @param offset is the integer offset (0-based) in the address space for\n    \/\/\/ configuration.\n    constexpr explicit ConfigReference(unsigned offset)\n        : offset_(offset)\n    {\n    }\n\n    \/\/\/ Initializes the config reference from an existing config reference.\n    \/\/\/\n    \/\/\/ @param ref is the existing (or saved) config reference.\n    constexpr explicit ConfigReference(const ConfigReference &ref)\n        : offset_(ref.offset())\n    {\n    }\n\n    constexpr unsigned offset() const\n    {\n        return offset_;\n    }\n\nprotected:\n    \/\/\/ zero-based offset from the beginning of the configuration file.\n    unsigned offset_;\n};\n\n\/\/\/\n\/\/\/ Base class for individual configuration entries. Defines helper methods for\n\/\/\/ reading and writing.\n\/\/\/\nclass ConfigEntryBase : public ConfigReference\n{\npublic:\n    INHERIT_CONSTEXPR_CONSTRUCTOR(ConfigEntryBase, ConfigReference)\n\n    static constexpr GroupConfigOptions group_opts()\n    {\n        return GroupConfigOptions();\n    }\n\nprotected:\n    \/\/\/ Reads a given typed variable from the configuration file. DOes not do\n    \/\/\/ any binary conversion (only reads raw data).\n    \/\/\/\n    \/\/\/ @param fd file to read data from.\n    \/\/\/\n    \/\/\/ @return the raw value read from the configuration file.\n    \/\/\/\n    template <class T> T raw_read(int fd) const\n    {\n        T ret;\n        repeated_read(fd, &ret, sizeof(T));\n        return ret;\n    }\n\n    \/\/\/ Writes a given typed variable to the configuration file. Does not do\n    \/\/\/ any binary conversion.\n    \/\/\/\n    \/\/\/ @param fd file to write data to.\n    \/\/\/\n    \/\/\/ @param value the raw value to write to the configuration file.\n    \/\/\/\n    template <class T> void raw_write(int fd, const T &value) const\n    {\n        repeated_write(fd, &value, sizeof(T));\n    }\n\n    \/\/\/ Performs a reliable read from the given FD. Crashes if the read fails.\n    \/\/\/\n    \/\/\/ @param fd the file to read data from\n    \/\/\/ @param buf the location to write data to\n    \/\/\/ @param size how many bytes to read\n    \/\/\/\n    void repeated_read(int fd, void *buf, size_t size) const;\n\n    \/\/\/ Performs a reliable write to the given FD. Crashes if the write fails.\n    \/\/\/\n    \/\/\/ @param fd the file to write data to\n    \/\/\/ @param buf the location of the data to write\n    \/\/\/ @param size how many bytes to write\n    \/\/\/\n    void repeated_write(int fd, const void *buf, size_t size) const;\n};\n\n\/\/\/ Implementation class for numeric configuration entries, templated by the\n\/\/\/ integer type.\ntemplate <class TR> class NumericConfigEntry : public ConfigEntryBase\n{\npublic:\n    INHERIT_CONSTEXPR_CONSTRUCTOR(NumericConfigEntry, ConfigEntryBase)\n\n    \/\/\/ Performs endian conversion.\n    \/\/\/\n    \/\/\/ @param d network-byte-order data\n    \/\/\/\n    \/\/\/ @return host-byte-order data\n    \/\/\/\n    static uint8_t endian_convert(uint8_t d)\n    {\n        return d;\n    }\n    \/\/\/ Performs endian conversion.\n    \/\/\/\n    \/\/\/ @param d network-byte-order data\n    \/\/\/\n    \/\/\/ @return host-byte-order data\n    \/\/\/\n    static uint16_t endian_convert(uint16_t d)\n    {\n        return be16toh(d);\n    }\n    \/\/\/ Performs endian conversion.\n    \/\/\/\n    \/\/\/ @param d network-byte-order data\n    \/\/\/\n    \/\/\/ @return host-byte-order data\n    \/\/\/\n    static uint32_t endian_convert(uint32_t d)\n    {\n        return be32toh(d);\n    }\n    \/\/\/ Performs endian conversion.\n    \/\/\/\n    \/\/\/ @param d network-byte-order data\n    \/\/\/\n    \/\/\/ @return host-byte-order data\n    \/\/\/\n    static uint64_t endian_convert(uint64_t d)\n    {\n        return be64toh(d);\n    }\n\n    \/\/\/ Storage bytes occupied by the instance in the config file.\n    \/\/\/\n    \/\/\/ @return number of bytes that the config parser offset will be\n    \/\/\/ incremented by this entry.\n    \/\/\/\n    static constexpr unsigned size()\n    {\n        return sizeof(TR);\n    }\n\n    constexpr unsigned end_offset()\n    {\n        return offset() + size();\n    }\n\n    static constexpr AtomConfigRenderer config_renderer()\n    {\n        return AtomConfigRenderer(\"int\", size());\n    }\n\n    \/\/\/ Reads the data from the configuration file.\n    \/\/\/\n    \/\/\/ @param fd file descriptor of the config file.\n    \/\/\/\n    \/\/\/ @return value of the configuration atom that *this represents.\n    \/\/\/\n    TR read(int fd) const\n    {\n        return endian_convert(raw_read<TR>(fd));\n    }\n\n    \/\/\/ Writes the data to the configuration file.\n    \/\/\/\n    \/\/\/ @param fd file descriptor of the config file.\n    \/\/\/\n    \/\/\/ @param value of the configuration atom that should be written.\n    \/\/\/\n    void write(int fd, TR d) const\n    {\n        raw_write(fd, endian_convert(d));\n    }\n};\n\nusing Uint8ConfigEntry = NumericConfigEntry<uint8_t>;\nusing Uint16ConfigEntry = NumericConfigEntry<uint16_t>;\nusing Uint32ConfigEntry = NumericConfigEntry<uint32_t>;\nusing Uint64ConfigEntry = NumericConfigEntry<uint64_t>;\n\n\/\/\/ Implementation class for event ID configuration entries.\nclass EventConfigEntry : public Uint64ConfigEntry\n{\npublic:\n    template <typename T>\n    constexpr EventConfigEntry(T t)\n        : Uint64ConfigEntry(t)\n    {\n    }\n\n    static constexpr AtomConfigRenderer config_renderer()\n    {\n        return AtomConfigRenderer(\"eventid\", AtomConfigRenderer::SKIP_SIZE);\n    }\n};\n\n\/\/\/ Implementation class for string configuration entries. The template\n\/\/\/ argument is the string size (total space in bytes used in the configuration\n\/\/\/ space including the NULL character).\ntemplate <unsigned SIZE> class StringConfigEntry : public ConfigEntryBase\n{\npublic:\n    INHERIT_CONSTEXPR_CONSTRUCTOR(StringConfigEntry, ConfigEntryBase)\n\n    \/\/\/ Storage bytes occupied by the instance in the config file.\n    \/\/\/\n    \/\/\/ @return number of bytes that the config parser offset will be\n    \/\/\/ incremented by this entry.\n    \/\/\/\n    static constexpr unsigned size()\n    {\n        return SIZE;\n    }\n\n    static constexpr unsigned end_offset()\n    {\n        return offset() + size();\n    }\n\n    static constexpr AtomConfigRenderer config_renderer()\n    {\n        return AtomConfigRenderer(\"string\", size());\n    }\n\n    string read(int fd) const\n    {\n        string s(size(), '\\0');\n        repeated_read(fd, &s[0], size());\n        size_t real_len = strlen(s.c_str());\n        s.resize(real_len);\n        return s;\n    }\n};\n\n} \/\/ namespace nmranet\n\n#endif \/\/ _NMRANET_CONFIGENTRY_HXX_\n<|endoftext|>"}
{"text":"<commit_before>#include \"tgbot\/Bot.h\"\n\n#include \"tgbot\/EventBroadcaster.h\"\n\n#if __cplusplus < 201402L \nnamespace std {\n    template<class T> struct _Unique_if {\n        typedef unique_ptr<T> _Single_object;\n    };\n\n    template<class T> struct _Unique_if<T[]> {\n        typedef unique_ptr<T[]> _Unknown_bound;\n    };\n\n    template<class T, size_t N> struct _Unique_if<T[N]> {\n        typedef void _Known_bound;\n    };\n\n    template<class T, class... Args>\n        typename _Unique_if<T>::_Single_object\n        make_unique(Args&&... args) {\n            return unique_ptr<T>(new T(std::forward<Args>(args)...));\n        }\n\n    template<class T>\n        typename _Unique_if<T>::_Unknown_bound\n        make_unique(size_t n) {\n            typedef typename remove_extent<T>::type U;\n            return unique_ptr<T>(new U[n]());\n        }\n\n    template<class T, class... Args>\n        typename _Unique_if<T>::_Known_bound\n        make_unique(Args&&...) = delete;\n}\n#endif\n\nnamespace TgBot {\n\nBot::Bot(std::string token, const HttpClient& httpClient)\n    : _token(std::move(token))\n    , _api(_token, httpClient)\n    , _eventBroadcaster(std::make_unique<EventBroadcaster>())\n    , _eventHandler(getEvents()) {\n}\n\n}\n<commit_msg>Fix build error in versions below MSVC 12.0<commit_after>#include \"tgbot\/Bot.h\"\n\n#include \"tgbot\/EventBroadcaster.h\"\n\n#if __cplusplus == 201103L\nnamespace std {\n    template<typename T>\n    inline std::unique_ptr<T> make_unique() {\n        return std::unique_ptr<T>(new T());\n    }\n}\n#endif\n\nnamespace TgBot {\n\nBot::Bot(std::string token, const HttpClient& httpClient)\n    : _token(std::move(token))\n    , _api(_token, httpClient)\n    , _eventBroadcaster(std::make_unique<EventBroadcaster>())\n    , _eventHandler(getEvents()) {\n}\n\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\nImplementation of the Region class\n\nMethods related to parameters are in Region_parameters.cpp\nMethods related to inputs and outputs are in Region_io.cpp\n\n*\/\n\n#include <iostream>\n#include <stdexcept>\n#include <set>\n#include <string>\n#include <nupic\/engine\/Region.hpp>\n#include <nupic\/engine\/RegionImpl.hpp>\n#include <nupic\/engine\/RegionImplFactory.hpp>\n#include <nupic\/engine\/Spec.hpp>\n#include <nupic\/utils\/Log.hpp>\n#include <nupic\/engine\/Input.hpp>\n#include <nupic\/engine\/Output.hpp>\n#include <nupic\/engine\/Link.hpp>\n#include <nupic\/ntypes\/NodeSet.hpp>\n#include <nupic\/os\/Timer.hpp>\n#include <nupic\/proto\/RegionProto.capnp.h>\n\nnamespace nupic\n{\n\n  class GenericRegisteredRegionImpl;\n\n  \/\/ Create region from parameter spec\n  Region::Region(std::string name,\n                 const std::string& nodeType,\n                 const std::string& nodeParams,\n                 Network * network) :\n    name_(std::move(name)),\n    type_(nodeType),\n    initialized_(false),\n    enabledNodes_(nullptr),\n    network_(network)\n  {\n    \/\/ Set region info before creating the RegionImpl so that the\n    \/\/ Impl has access to the region info in its constructor.\n    RegionImplFactory & factory = RegionImplFactory::getInstance();\n    spec_ = factory.getSpec(nodeType);\n\n    \/\/ Dimensions start off as unspecified, but if\n    \/\/ the RegionImpl only supports a single node, we\n    \/\/ can immediately set the dimensions.\n    if (spec_->singleNodeOnly)\n      dims_.push_back(1);\n    \/\/ else dims_ = []\n\n    impl_ = factory.createRegionImpl(nodeType, nodeParams, this);\n    createInputsAndOutputs_();\n\n  }\n\n  \/\/ Deserialize region\n  Region::Region(std::string name,\n                 const std::string& nodeType,\n                 const Dimensions& dimensions,\n                 BundleIO& bundle,\n                 Network * network) :\n    name_(std::move(name)),\n    type_(nodeType),\n    initialized_(false),\n    enabledNodes_(nullptr),\n    network_(network)\n  {\n    \/\/ Set region info before creating the RegionImpl so that the\n    \/\/ Impl has access to the region info in its constructor.\n    RegionImplFactory & factory = RegionImplFactory::getInstance();\n    spec_ = factory.getSpec(nodeType);\n\n    \/\/ Dimensions start off as unspecified, but if\n    \/\/ the RegionImpl only supports a single node, we\n    \/\/ can immediately set the dimensions.\n    if (spec_->singleNodeOnly)\n      if (!dimensions.isDontcare() && !dimensions.isUnspecified() &&\n          !dimensions.isOnes())\n        NTA_THROW << \"Attempt to deserialize region of type \" << nodeType\n                  << \" with dimensions \" << dimensions\n                  << \" but region supports exactly one node.\";\n\n    dims_ = dimensions;\n\n    impl_ = factory.deserializeRegionImpl(nodeType, bundle, this);\n    createInputsAndOutputs_();\n  }\n\n  Region::Region(std::string name, RegionProto::Reader& proto,\n                 Network* network) :\n    name_(std::move(name)),\n    type_(proto.getNodeType().cStr()),\n    initialized_(false),\n    enabledNodes_(nullptr),\n    network_(network)\n  {\n    read(proto);\n  }\n\n  Network * Region::getNetwork()\n  {\n    return network_;\n  }\n\n  void Region::createInputsAndOutputs_()\n  {\n\n    \/\/ Create all the outputs for this node type. By default outputs are zero size\n    for (size_t i = 0; i < spec_->outputs.getCount(); ++i)\n    {\n      const std::pair<std::string, OutputSpec> & p = spec_->outputs.getByIndex(i);\n      std::string outputName = p.first;\n      const OutputSpec & os = p.second;\n      auto output = new Output(*this, os.dataType, os.regionLevel);\n      outputs_[outputName] = output;\n      \/\/ keep track of name in the output also -- see note in Region.hpp\n      output->setName(outputName);\n    }\n\n    \/\/ Create all the inputs for this node type.\n    for (size_t i = 0; i < spec_->inputs.getCount(); ++i)\n    {\n      const std::pair<std::string, InputSpec> & p = spec_->inputs.getByIndex(i);\n      std::string inputName = p.first;\n      const InputSpec &is = p.second;\n\n      auto input = new Input(*this, is.dataType, is.regionLevel);\n      inputs_[inputName] = input;\n      \/\/ keep track of name in the input also -- see note in Region.hpp\n      input->setName(inputName);\n    }\n  }\n\n\n  bool Region::hasOutgoingLinks() const\n  {\n    for (const auto & elem : outputs_)\n    {\n      if (elem.second->hasOutgoingLinks())\n      {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  Region::~Region()\n  {\n    \/\/ If there are any links connected to our outputs, this will fail.\n    \/\/ We should catch this error in the Network class and give the\n    \/\/ user a good error message (regions may be removed either in\n    \/\/ Network::removeRegion or Network::~Network())\n    for (auto & elem : outputs_)\n    {\n      delete elem.second;\n      elem.second = nullptr;\n    }\n\n    for (auto & elem : inputs_)\n    {\n      delete elem.second;\n      elem.second = nullptr;\n    }\n\n    delete impl_;\n    delete enabledNodes_;\n\n  }\n\n\n\n  void\n  Region::initialize()\n  {\n\n    if (initialized_)\n      return;\n\n    impl_->initialize();\n    initialized_ = true;\n  }\n\n  bool\n  Region::isInitialized() const\n  {\n    return initialized_;\n  }\n\n  const std::string&\n  Region::getName() const\n  {\n    return name_;\n  }\n\n  const std::string&\n  Region::getType() const\n  {\n    return type_;\n  }\n\n  const Spec*\n  Region::getSpec() const\n  {\n    return spec_;\n  }\n\n  const Spec*\n  Region::getSpecFromType(const std::string& nodeType)\n  {\n    RegionImplFactory & factory = RegionImplFactory::getInstance();\n    return factory.getSpec(nodeType);\n  }\n\n  void\n  Region::registerPyRegion(const std::string module, const std::string className)\n  {\n    RegionImplFactory::registerPyRegion(module, className);\n  }\n\n  void\n  Region::registerCPPRegion(const std::string name, GenericRegisteredRegionImpl* wrapper)\n  {\n    RegionImplFactory::registerCPPRegion(name, wrapper);\n  }\n\n  const Dimensions&\n  Region::getDimensions() const\n  {\n    return dims_;\n  }\n\n  void\n  Region::enable()\n  {\n    NTA_THROW << \"Region::enable not implemented (region name: \" << getName() << \")\";\n  }\n\n\n  void\n  Region::disable()\n  {\n    NTA_THROW << \"Region::disable not implemented (region name: \" << getName() << \")\";\n  }\n\n  std::string\n  Region::executeCommand(const std::vector<std::string>& args)\n  {\n    std::string retVal;\n    if (args.size() < 1)\n    {\n      NTA_THROW << \"Invalid empty command specified\";\n    }\n\n\n    if (profilingEnabled_)\n      executeTimer_.start();\n\n    retVal = impl_->executeCommand(args, (UInt64)(-1));\n\n    if (profilingEnabled_)\n      executeTimer_.stop();\n\n    return retVal;\n  }\n\n\n  void\n  Region::compute()\n  {\n    if (!initialized_)\n      NTA_THROW << \"Region \" << getName() << \" unable to compute because not initialized\";\n\n    if (profilingEnabled_)\n      computeTimer_.start();\n\n    impl_->compute();\n\n    if (profilingEnabled_)\n      computeTimer_.stop();\n\n    return;\n  }\n\n\n\n  \/**\n   * These internal methods are called by Network as\n   * part of initialization.\n   *\/\n\n  size_t\n  Region::evaluateLinks()\n  {\n    int nIncompleteLinks = 0;\n    for (auto & elem : inputs_)\n    {\n      nIncompleteLinks += (elem.second)->evaluateLinks();\n    }\n    return nIncompleteLinks;\n  }\n\n  std::string\n  Region::getLinkErrors() const\n  {\n\n    std::stringstream ss;\n    for (const auto & elem : inputs_)\n    {\n      const std::vector<Link*>& links = elem.second->getLinks();\n      for (const auto & link : links)\n      {\n        if ( (link)->getSrcDimensions().isUnspecified() ||\n             (link)->getDestDimensions().isUnspecified())\n        {\n          ss << (link)->toString() << \"\\n\";\n        }\n      }\n    }\n\n    return ss.str();\n  }\n\n  size_t Region::getNodeOutputElementCount(const std::string& name)\n  {\n    \/\/ Use output count if specified in nodespec, otherwise\n    \/\/ ask the Impl\n    NTA_CHECK(spec_->outputs.contains(name));\n    size_t count = spec_->outputs.getByName(name).count;\n    if(count == 0)\n    {\n      try\n      {\n        count = impl_->getNodeOutputElementCount(name);\n      } catch(Exception& e) {\n        NTA_THROW << \"Internal error -- the size for the output \" << name <<\n                     \"is unknown. : \" << e.what();\n      }\n    }\n\n    return count;\n  }\n\n  void Region::initOutputs()\n  {\n    \/\/ Some outputs are optional. These outputs will have 0 elementCount in the node\n    \/\/ spec and also return 0 from impl->getNodeOutputElementCount(). These outputs still\n    \/\/ appear in the output map, but with an array size of 0.\n\n\n    for (auto & elem : outputs_)\n    {\n      const std::string& name = elem.first;\n\n      size_t count = 0;\n      try\n      {\n        count = getNodeOutputElementCount(name);\n      } catch (nupic::Exception& e) {\n        NTA_THROW << \"Internal error -- unable to get size of output \"\n                  << name << \" : \" << e.what();\n      }\n      elem.second->initialize(count);\n    }\n  }\n\n  void Region::initInputs() const\n  {\n    auto i = inputs_.begin();\n    for (; i != inputs_.end(); i++)\n    {\n      i->second->initialize();\n    }\n  }\n\n\n\n\n\n  void\n  Region::setDimensions(Dimensions& newDims)\n  {\n    \/\/ Can only set dimensions one time\n    if (dims_ == newDims)\n      return;\n\n    if (dims_.isUnspecified())\n    {\n      if (newDims.isDontcare())\n      {\n        NTA_THROW << \"Invalid attempt to set region dimensions to dontcare value\";\n      }\n\n      if (! newDims.isValid())\n      {\n        NTA_THROW << \"Attempt to set region dimensions to invalid value:\"\n                  << newDims.toString();\n      }\n\n      dims_ = newDims;\n      dimensionInfo_ = \"Specified explicitly in setDimensions()\";\n    } else {\n      NTA_THROW << \"Attempt to set dimensions of region \" << getName()\n                << \" to \" << newDims.toString()\n                << \" but region already has dimensions \" << dims_.toString();\n    }\n\n    \/\/ can only create the enabled node set after we know the number of dimensions\n    setupEnabledNodeSet();\n\n  }\n\n  void Region::setupEnabledNodeSet()\n  {\n    NTA_CHECK(dims_.isValid());\n\n    if (enabledNodes_ != nullptr)\n    {\n      delete enabledNodes_;\n    }\n\n    size_t nnodes = dims_.getCount();\n    enabledNodes_ = new NodeSet(nnodes);\n\n    enabledNodes_->allOn();\n  }\n\n  const NodeSet& Region::getEnabledNodes() const\n  {\n    if (enabledNodes_ == nullptr)\n    {\n      NTA_THROW << \"Attempt to access enabled nodes set before region has been initialized\";\n    }\n    return *enabledNodes_;\n  }\n\n\n  void\n  Region::setDimensionInfo(const std::string& info)\n  {\n    dimensionInfo_ = info;\n  }\n\n  const std::string&\n  Region::getDimensionInfo() const\n  {\n    return dimensionInfo_;\n  }\n\n  void\n  Region::removeAllIncomingLinks()\n  {\n    InputMap::const_iterator i = inputs_.begin();\n    for (; i != inputs_.end(); i++)\n    {\n      std::vector<Link*> links = i->second->getLinks();\n      for (auto & links_link : links)\n      {\n        i->second->removeLink(links_link);\n\n      }\n    }\n\n  }\n\n  void\n  Region::uninitialize()\n  {\n    initialized_ = false;\n  }\n\n  void\n  Region::setPhases(std::set<UInt32>& phases)\n  {\n    phases_ = phases;\n  }\n\n  std::set<UInt32>&\n  Region::getPhases()\n  {\n    return phases_;\n  }\n\n  void\n  Region::serializeImpl(BundleIO& bundle)\n  {\n    impl_->serialize(bundle);\n  }\n\n  void Region::write(RegionProto::Builder& proto) const\n  {\n    auto dimensionsProto = proto.initDimensions(dims_.size());\n    for (UInt i = 0; i < dims_.size(); ++i)\n    {\n      dimensionsProto.set(i, dims_[i]);\n    }\n    auto phasesProto = proto.initPhases(phases_.size());\n    UInt i = 0;\n    for (auto elem : phases_)\n    {\n      phasesProto.set(i++, elem);\n    }\n    proto.setNodeType(type_);\n    auto implProto = proto.getRegionImpl();\n    impl_->write(implProto);\n  }\n\n  void Region::read(RegionProto::Reader& proto)\n  {\n    dims_.clear();\n    for (auto elem : proto.getDimensions())\n    {\n      dims_.push_back(elem);\n    }\n\n    phases_.clear();\n    for (auto elem : proto.getPhases())\n    {\n      phases_.insert(elem);\n    }\n\n    auto implProto = proto.getRegionImpl();\n    RegionImplFactory& factory = RegionImplFactory::getInstance();\n    impl_ = factory.deserializeRegionImpl(\n        proto.getNodeType().cStr(), implProto, this);\n  }\n\n  void\n  Region::enableProfiling()\n  {\n    profilingEnabled_ = true;\n  }\n\n  void\n  Region::disableProfiling()\n  {\n    profilingEnabled_ = false;\n  }\n\n  void\n  Region::resetProfiling()\n  {\n    computeTimer_.reset();\n    executeTimer_.reset();\n  }\n\n  const Timer& Region::getComputeTimer() const\n  {\n    return computeTimer_;\n  }\n\n  const Timer& Region::getExecuteTimer() const\n  {\n    return executeTimer_;\n  }\n\n}\n<commit_msg>More string fixes for Windoes.<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\nImplementation of the Region class\n\nMethods related to parameters are in Region_parameters.cpp\nMethods related to inputs and outputs are in Region_io.cpp\n\n*\/\n\n#include <iostream>\n#include <stdexcept>\n#include <set>\n#include <string>\n#include <nupic\/engine\/Region.hpp>\n#include <nupic\/engine\/RegionImpl.hpp>\n#include <nupic\/engine\/RegionImplFactory.hpp>\n#include <nupic\/engine\/Spec.hpp>\n#include <nupic\/utils\/Log.hpp>\n#include <nupic\/engine\/Input.hpp>\n#include <nupic\/engine\/Output.hpp>\n#include <nupic\/engine\/Link.hpp>\n#include <nupic\/ntypes\/NodeSet.hpp>\n#include <nupic\/os\/Timer.hpp>\n#include <nupic\/proto\/RegionProto.capnp.h>\n\nnamespace nupic\n{\n\n  class GenericRegisteredRegionImpl;\n\n  \/\/ Create region from parameter spec\n  Region::Region(std::string name,\n                 const std::string& nodeType,\n                 const std::string& nodeParams,\n                 Network * network) :\n    name_(std::move(name)),\n    type_(nodeType),\n    initialized_(false),\n    enabledNodes_(nullptr),\n    network_(network)\n  {\n    \/\/ Set region info before creating the RegionImpl so that the\n    \/\/ Impl has access to the region info in its constructor.\n    RegionImplFactory & factory = RegionImplFactory::getInstance();\n    spec_ = factory.getSpec(nodeType);\n\n    \/\/ Dimensions start off as unspecified, but if\n    \/\/ the RegionImpl only supports a single node, we\n    \/\/ can immediately set the dimensions.\n    if (spec_->singleNodeOnly)\n      dims_.push_back(1);\n    \/\/ else dims_ = []\n\n    impl_ = factory.createRegionImpl(nodeType, nodeParams, this);\n    createInputsAndOutputs_();\n\n  }\n\n  \/\/ Deserialize region\n  Region::Region(std::string name,\n                 const std::string& nodeType,\n                 const Dimensions& dimensions,\n                 BundleIO& bundle,\n                 Network * network) :\n    name_(std::move(name)),\n    type_(nodeType),\n    initialized_(false),\n    enabledNodes_(nullptr),\n    network_(network)\n  {\n    \/\/ Set region info before creating the RegionImpl so that the\n    \/\/ Impl has access to the region info in its constructor.\n    RegionImplFactory & factory = RegionImplFactory::getInstance();\n    spec_ = factory.getSpec(nodeType);\n\n    \/\/ Dimensions start off as unspecified, but if\n    \/\/ the RegionImpl only supports a single node, we\n    \/\/ can immediately set the dimensions.\n    if (spec_->singleNodeOnly)\n      if (!dimensions.isDontcare() && !dimensions.isUnspecified() &&\n          !dimensions.isOnes())\n        NTA_THROW << \"Attempt to deserialize region of type \" << nodeType\n                  << \" with dimensions \" << dimensions\n                  << \" but region supports exactly one node.\";\n\n    dims_ = dimensions;\n\n    impl_ = factory.deserializeRegionImpl(nodeType, bundle, this);\n    createInputsAndOutputs_();\n  }\n\n  Region::Region(std::string name, RegionProto::Reader& proto,\n                 Network* network) :\n    name_(std::move(name)),\n    type_(proto.getNodeType().cStr()),\n    initialized_(false),\n    enabledNodes_(nullptr),\n    network_(network)\n  {\n    read(proto);\n  }\n\n  Network * Region::getNetwork()\n  {\n    return network_;\n  }\n\n  void Region::createInputsAndOutputs_()\n  {\n\n    \/\/ Create all the outputs for this node type. By default outputs are zero size\n    for (size_t i = 0; i < spec_->outputs.getCount(); ++i)\n    {\n      const std::pair<std::string, OutputSpec> & p = spec_->outputs.getByIndex(i);\n      std::string outputName = p.first;\n      const OutputSpec & os = p.second;\n      auto output = new Output(*this, os.dataType, os.regionLevel);\n      outputs_[outputName] = output;\n      \/\/ keep track of name in the output also -- see note in Region.hpp\n      output->setName(outputName);\n    }\n\n    \/\/ Create all the inputs for this node type.\n    for (size_t i = 0; i < spec_->inputs.getCount(); ++i)\n    {\n      const std::pair<std::string, InputSpec> & p = spec_->inputs.getByIndex(i);\n      std::string inputName = p.first;\n      const InputSpec &is = p.second;\n\n      auto input = new Input(*this, is.dataType, is.regionLevel);\n      inputs_[inputName] = input;\n      \/\/ keep track of name in the input also -- see note in Region.hpp\n      input->setName(inputName);\n    }\n  }\n\n\n  bool Region::hasOutgoingLinks() const\n  {\n    for (const auto & elem : outputs_)\n    {\n      if (elem.second->hasOutgoingLinks())\n      {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  Region::~Region()\n  {\n    \/\/ If there are any links connected to our outputs, this will fail.\n    \/\/ We should catch this error in the Network class and give the\n    \/\/ user a good error message (regions may be removed either in\n    \/\/ Network::removeRegion or Network::~Network())\n    for (auto & elem : outputs_)\n    {\n      delete elem.second;\n      elem.second = nullptr;\n    }\n\n    for (auto & elem : inputs_)\n    {\n      delete elem.second;\n      elem.second = nullptr;\n    }\n\n    delete impl_;\n    delete enabledNodes_;\n\n  }\n\n\n\n  void\n  Region::initialize()\n  {\n\n    if (initialized_)\n      return;\n\n    impl_->initialize();\n    initialized_ = true;\n  }\n\n  bool\n  Region::isInitialized() const\n  {\n    return initialized_;\n  }\n\n  const std::string&\n  Region::getName() const\n  {\n    return name_;\n  }\n\n  const std::string&\n  Region::getType() const\n  {\n    return type_;\n  }\n\n  const Spec*\n  Region::getSpec() const\n  {\n    return spec_;\n  }\n\n  const Spec*\n  Region::getSpecFromType(const std::string& nodeType)\n  {\n    RegionImplFactory & factory = RegionImplFactory::getInstance();\n    return factory.getSpec(nodeType);\n  }\n\n  void\n  Region::registerPyRegion(const std::string module, const std::string className)\n  {\n    RegionImplFactory::registerPyRegion(module, className);\n  }\n\n  void\n  Region::registerCPPRegion(const std::string name, GenericRegisteredRegionImpl* wrapper)\n  {\n    RegionImplFactory::registerCPPRegion(name, wrapper);\n  }\n\n  const Dimensions&\n  Region::getDimensions() const\n  {\n    return dims_;\n  }\n\n  void\n  Region::enable()\n  {\n    NTA_THROW << \"Region::enable not implemented (region name: \" << getName() << \")\";\n  }\n\n\n  void\n  Region::disable()\n  {\n    NTA_THROW << \"Region::disable not implemented (region name: \" << getName() << \")\";\n  }\n\n  std::string\n  Region::executeCommand(const std::vector<std::string>& args)\n  {\n    std::string retVal;\n    if (args.size() < 1)\n    {\n      NTA_THROW << \"Invalid empty command specified\";\n    }\n\n\n    if (profilingEnabled_)\n      executeTimer_.start();\n\n    retVal = impl_->executeCommand(args, (UInt64)(-1));\n\n    if (profilingEnabled_)\n      executeTimer_.stop();\n\n    return retVal;\n  }\n\n\n  void\n  Region::compute()\n  {\n    if (!initialized_)\n      NTA_THROW << \"Region \" << getName() << \" unable to compute because not initialized\";\n\n    if (profilingEnabled_)\n      computeTimer_.start();\n\n    impl_->compute();\n\n    if (profilingEnabled_)\n      computeTimer_.stop();\n\n    return;\n  }\n\n\n\n  \/**\n   * These internal methods are called by Network as\n   * part of initialization.\n   *\/\n\n  size_t\n  Region::evaluateLinks()\n  {\n    int nIncompleteLinks = 0;\n    for (auto & elem : inputs_)\n    {\n      nIncompleteLinks += (elem.second)->evaluateLinks();\n    }\n    return nIncompleteLinks;\n  }\n\n  std::string\n  Region::getLinkErrors() const\n  {\n\n    std::stringstream ss;\n    for (const auto & elem : inputs_)\n    {\n      const std::vector<Link*>& links = elem.second->getLinks();\n      for (const auto & link : links)\n      {\n        if ( (link)->getSrcDimensions().isUnspecified() ||\n             (link)->getDestDimensions().isUnspecified())\n        {\n          ss << (link)->toString() << \"\\n\";\n        }\n      }\n    }\n\n    return ss.str();\n  }\n\n  size_t Region::getNodeOutputElementCount(const std::string& name)\n  {\n    \/\/ Use output count if specified in nodespec, otherwise\n    \/\/ ask the Impl\n    NTA_CHECK(spec_->outputs.contains(name));\n    size_t count = spec_->outputs.getByName(name).count;\n    if(count == 0)\n    {\n      try\n      {\n        count = impl_->getNodeOutputElementCount(name);\n      } catch(Exception& e) {\n        NTA_THROW << \"Internal error -- the size for the output \" << name <<\n                     \"is unknown. : \" << e.what();\n      }\n    }\n\n    return count;\n  }\n\n  void Region::initOutputs()\n  {\n    \/\/ Some outputs are optional. These outputs will have 0 elementCount in the node\n    \/\/ spec and also return 0 from impl->getNodeOutputElementCount(). These outputs still\n    \/\/ appear in the output map, but with an array size of 0.\n\n\n    for (auto & elem : outputs_)\n    {\n      const std::string& name = elem.first;\n\n      size_t count = 0;\n      try\n      {\n        count = getNodeOutputElementCount(name);\n      } catch (nupic::Exception& e) {\n        NTA_THROW << \"Internal error -- unable to get size of output \"\n                  << name << \" : \" << e.what();\n      }\n      elem.second->initialize(count);\n    }\n  }\n\n  void Region::initInputs() const\n  {\n    auto i = inputs_.begin();\n    for (; i != inputs_.end(); i++)\n    {\n      i->second->initialize();\n    }\n  }\n\n\n\n\n\n  void\n  Region::setDimensions(Dimensions& newDims)\n  {\n    \/\/ Can only set dimensions one time\n    if (dims_ == newDims)\n      return;\n\n    if (dims_.isUnspecified())\n    {\n      if (newDims.isDontcare())\n      {\n        NTA_THROW << \"Invalid attempt to set region dimensions to dontcare value\";\n      }\n\n      if (! newDims.isValid())\n      {\n        NTA_THROW << \"Attempt to set region dimensions to invalid value:\"\n                  << newDims.toString();\n      }\n\n      dims_ = newDims;\n      dimensionInfo_ = \"Specified explicitly in setDimensions()\";\n    } else {\n      NTA_THROW << \"Attempt to set dimensions of region \" << getName()\n                << \" to \" << newDims.toString()\n                << \" but region already has dimensions \" << dims_.toString();\n    }\n\n    \/\/ can only create the enabled node set after we know the number of dimensions\n    setupEnabledNodeSet();\n\n  }\n\n  void Region::setupEnabledNodeSet()\n  {\n    NTA_CHECK(dims_.isValid());\n\n    if (enabledNodes_ != nullptr)\n    {\n      delete enabledNodes_;\n    }\n\n    size_t nnodes = dims_.getCount();\n    enabledNodes_ = new NodeSet(nnodes);\n\n    enabledNodes_->allOn();\n  }\n\n  const NodeSet& Region::getEnabledNodes() const\n  {\n    if (enabledNodes_ == nullptr)\n    {\n      NTA_THROW << \"Attempt to access enabled nodes set before region has been initialized\";\n    }\n    return *enabledNodes_;\n  }\n\n\n  void\n  Region::setDimensionInfo(const std::string& info)\n  {\n    dimensionInfo_ = info;\n  }\n\n  const std::string&\n  Region::getDimensionInfo() const\n  {\n    return dimensionInfo_;\n  }\n\n  void\n  Region::removeAllIncomingLinks()\n  {\n    InputMap::const_iterator i = inputs_.begin();\n    for (; i != inputs_.end(); i++)\n    {\n      std::vector<Link*> links = i->second->getLinks();\n      for (auto & links_link : links)\n      {\n        i->second->removeLink(links_link);\n\n      }\n    }\n\n  }\n\n  void\n  Region::uninitialize()\n  {\n    initialized_ = false;\n  }\n\n  void\n  Region::setPhases(std::set<UInt32>& phases)\n  {\n    phases_ = phases;\n  }\n\n  std::set<UInt32>&\n  Region::getPhases()\n  {\n    return phases_;\n  }\n\n  void\n  Region::serializeImpl(BundleIO& bundle)\n  {\n    impl_->serialize(bundle);\n  }\n\n  void Region::write(RegionProto::Builder& proto) const\n  {\n    auto dimensionsProto = proto.initDimensions(dims_.size());\n    for (UInt i = 0; i < dims_.size(); ++i)\n    {\n      dimensionsProto.set(i, dims_[i]);\n    }\n    auto phasesProto = proto.initPhases(phases_.size());\n    UInt i = 0;\n    for (auto elem : phases_)\n    {\n      phasesProto.set(i++, elem);\n    }\n    proto.setNodeType(type_.c_str());\n    auto implProto = proto.getRegionImpl();\n    impl_->write(implProto);\n  }\n\n  void Region::read(RegionProto::Reader& proto)\n  {\n    dims_.clear();\n    for (auto elem : proto.getDimensions())\n    {\n      dims_.push_back(elem);\n    }\n\n    phases_.clear();\n    for (auto elem : proto.getPhases())\n    {\n      phases_.insert(elem);\n    }\n\n    auto implProto = proto.getRegionImpl();\n    RegionImplFactory& factory = RegionImplFactory::getInstance();\n    impl_ = factory.deserializeRegionImpl(\n        proto.getNodeType().cStr(), implProto, this);\n  }\n\n  void\n  Region::enableProfiling()\n  {\n    profilingEnabled_ = true;\n  }\n\n  void\n  Region::disableProfiling()\n  {\n    profilingEnabled_ = false;\n  }\n\n  void\n  Region::resetProfiling()\n  {\n    computeTimer_.reset();\n    executeTimer_.reset();\n  }\n\n  const Timer& Region::getComputeTimer() const\n  {\n    return computeTimer_;\n  }\n\n  const Timer& Region::getExecuteTimer() const\n  {\n    return executeTimer_;\n  }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <map>\n#include <iostream>\n\n#include \"Core.hpp\"\n#include \"FileSystem.hpp\"\n#include \"Util.hpp\"\n#include \"Index.hpp\"\n\n#ifdef WIN32\n#include <Windows.h>\n#endif\n\nnamespace Sit {\nnamespace Core {\n\nvoid Init()\n{\n\tusing namespace boost::filesystem;\n\ttry {\n\t\tcreate_directories(\".sit\/\");\n#ifdef WIN32\n\t\tSetFileAttributes(L\".sit\", FILE_ATTRIBUTE_HIDDEN);\n#endif\n\t\tcreate_directories(\".sit\/hook\");\n\t\tcreate_directories(\".sit\/objects\");\n\t\tcreate_directories(\".sit\/info\");\n\t\tcreate_directories(\".sit\/log\");\n\t\tcreate_directories(\".sit\/objects\");\n\t\tcreate_directories(\".sit\/objects\/info\");\n\t\tcreate_directories(\".sit\/objects\/pack\");\n\t\tcreate_directories(\".sit\/refs\");\n\t\tcreate_directories(\".sit\/refs\/heads\");\n\t\tcreate_directories(\".sit\/refs\/tags\");\n\n\t\tofstream HEAD(\".sit\/HEAD\");\n\t\tHEAD << \"refs\/heads\/master\" << std::endl;\n\t\tHEAD.close();\n\t} catch (const boost::filesystem::filesystem_error &fe) {\n\t\tstd::cerr << fe.what() << std::endl;\n\t} catch (const std::exception &stdEc) {\n\t\tstd::cerr << stdEc.what() << std::endl;\n\t}\n}\n\nstd::string AddFile(const boost::filesystem::path &file)\n{\n\tif (FileSystem::IsDirectory(file)) {\n\t\treturn \"\";\n\t}\n\ttry {\n\t\tauto fileSize = boost::filesystem::file_size(file);\n\t\tif (fileSize > 102400) {\n\t\t\tstd::cerr << \"Warning : Try to add a file larger than 100MB\" << std::endl;\n\t\t}\n\t\tif (fileSize > 204800) {\n\t\t\tthrow Sit::Util::SitException(\"Fatal: Try to add a file larger than 200MB\", file.string());\n\t\t}\n\t\tstd::string sha1Value = Sit::Util::SHA1sum(FileSystem::Read(file));\n\t\tboost::filesystem::path dstFile(FileSystem::OBJECTS_DIR \/ sha1Value.substr(0, 2) \/ sha1Value.substr(2));\n\t\tFileSystem::SafeCopyFile(file, dstFile);\n\t\tstd::cout << file << \" added.\" << std::endl;\n\t\treturn sha1Value;\n\t} catch (const boost::filesystem::filesystem_error &fe) {\n\t\tstd::cerr << fe.what() << std::endl;\n\t} catch (const std::exception &stdEc) {\n\t\tstd::cerr << stdEc.what() << std::endl;\n\t}\n\treturn std::string(\"\");\n}\n\nvoid Add(const boost::filesystem::path &path)\n{\n\tIndex::Load();\n\n\tauto fileList = FileSystem::ListRecursive(path);\n\tfor (auto &file : fileList) {\n\t\tif (FileSystem::IsDirectory(file)) {\n\t\t\tcontinue;\n\t\t}\n\t\tIndex::Insert(file, AddFile(file));\n\t}\n\n\tIndex::Save();\n}\n\nvoid Rm(const boost::filesystem::path &path)\n{\n\tIndex::Load();\n\tstd::cout << \"Removed \" << Index::Remove(path) << \" files\" << std::endl;\n\tIndex::Save();\n}\n}\n}<commit_msg>fix a bug when check file size<commit_after>#include <map>\n#include <iostream>\n\n#include \"Core.hpp\"\n#include \"FileSystem.hpp\"\n#include \"Util.hpp\"\n#include \"Index.hpp\"\n\n#ifdef WIN32\n#include <Windows.h>\n#endif\n\nnamespace Sit {\nnamespace Core {\n\nvoid Init()\n{\n\tusing namespace boost::filesystem;\n\ttry {\n\t\tcreate_directories(\".sit\/\");\n#ifdef WIN32\n\t\tSetFileAttributes(L\".sit\", FILE_ATTRIBUTE_HIDDEN);\n#endif\n\t\tcreate_directories(\".sit\/hook\");\n\t\tcreate_directories(\".sit\/objects\");\n\t\tcreate_directories(\".sit\/info\");\n\t\tcreate_directories(\".sit\/log\");\n\t\tcreate_directories(\".sit\/objects\");\n\t\tcreate_directories(\".sit\/objects\/info\");\n\t\tcreate_directories(\".sit\/objects\/pack\");\n\t\tcreate_directories(\".sit\/refs\");\n\t\tcreate_directories(\".sit\/refs\/heads\");\n\t\tcreate_directories(\".sit\/refs\/tags\");\n\n\t\tofstream HEAD(\".sit\/HEAD\");\n\t\tHEAD << \"refs\/heads\/master\" << std::endl;\n\t\tHEAD.close();\n\t} catch (const boost::filesystem::filesystem_error &fe) {\n\t\tstd::cerr << fe.what() << std::endl;\n\t} catch (const std::exception &stdEc) {\n\t\tstd::cerr << stdEc.what() << std::endl;\n\t}\n}\n\nstd::string AddFile(const boost::filesystem::path &file)\n{\n\tif (FileSystem::IsDirectory(file)) {\n\t\treturn \"\";\n\t}\n\ttry {\n\t\tauto fileSize = boost::filesystem::file_size(file);\n\t\tif (fileSize > (100 << 20)) {\n\t\t\tstd::cerr << \"Warning : Try to add a file larger than 100MB\" << std::endl;\n\t\t}\n\t\tif (fileSize > (200 << 20)) {\n\t\t\tthrow Sit::Util::SitException(\"Fatal: Try to add a file larger than 200MB\", file.string());\n\t\t}\n\t\tstd::string sha1Value = Sit::Util::SHA1sum(FileSystem::Read(file));\n\t\tboost::filesystem::path dstFile(FileSystem::OBJECTS_DIR \/ sha1Value.substr(0, 2) \/ sha1Value.substr(2));\n\t\tFileSystem::SafeCopyFile(file, dstFile);\n\t\tstd::cout << file << \" added.\" << std::endl;\n\t\treturn sha1Value;\n\t} catch (const boost::filesystem::filesystem_error &fe) {\n\t\tstd::cerr << fe.what() << std::endl;\n\t} catch (const std::exception &stdEc) {\n\t\tstd::cerr << stdEc.what() << std::endl;\n\t}\n\treturn std::string(\"\");\n}\n\nvoid Add(const boost::filesystem::path &path)\n{\n\tIndex::Load();\n\n\tauto fileList = FileSystem::ListRecursive(path);\n\tfor (auto &file : fileList) {\n\t\tif (FileSystem::IsDirectory(file)) {\n\t\t\tcontinue;\n\t\t}\n\t\tIndex::Insert(file, AddFile(file));\n\t}\n\n\tIndex::Save();\n}\n\nvoid Rm(const boost::filesystem::path &path)\n{\n\tIndex::Load();\n\tstd::cout << \"Removed \" << Index::Remove(path) << \" files\" << std::endl;\n\tIndex::Save();\n}\n}\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n* The MIT License (MIT)\n*\n* Copyright (c) 2015 vmolsa <ville.molsa@gmail.com> (http:\/\/github.com\/vmolsa)\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#include \"nan.h\"\n#include \"Core.h\"\n\n#include \"talk\/app\/webrtc\/peerconnectionfactoryproxy.h\"\n#include \"talk\/app\/webrtc\/proxy.h\"\n\n#include \"webrtc\/base\/cpumonitor.h\"\n\n#ifdef WIN32\n#include \"webrtc\/base\/win32socketinit.h\"\n#include \"webrtc\/base\/win32socketserver.h\"\n#else\n#include \"webrtc\/base\/physicalsocketserver.h\"\n#endif\n\nusing namespace v8;\nusing namespace WebRTC;\n\nclass ThreadPool {\n  public:\n    static void Init() {\n      rtc::CpuSampler info;\n      \n      if (info.Init()) {\n        _instances = info.GetCurrentCpus();\n      } else {\n        _instances = 1;\n      }\n       \n      _pool = new ThreadPool[_instances];\n    }\n    \n    static void Dispose() {\n      delete [] _pool;\n    }\n  \n    static ThreadPool *GetPool() {\n      int selected = _instances - 1;\n      size_t count = _pool[_instances - 1]._count;\n      \n      for (int index = 0; index < _instances; index++) {\n        if (count >= _pool[index]._count) {\n          selected = index;\n          count = _pool[index]._count;\n        }\n      }\n      \n      return &_pool[selected];\n    }\n  \n    rtc::Thread *GetWorker() {\n      return _worker;\n    }\n    \n    void Inc() {\n      _count++;\n    }\n    \n    void Dec() {\n      _count--;\n    }\n    \n  private:\n    ThreadPool() : _count(0), _worker(new rtc::Thread()) {\n      _worker->Start();\n    }\n    \n    virtual ~ThreadPool() {\n      _worker->Stop();\n      delete _worker;\n    }\n    \n  protected:\n    size_t _count;\n    rtc::Thread* _worker;\n    static ThreadPool* _pool;\n    static int _instances;\n};\n\nThreadPool* ThreadPool::_pool;\nint ThreadPool::_instances;\n\nclass ThreadConstructor {\n  public:\n    ThreadConstructor() : _pool(ThreadPool::GetPool()) { \n      _pool->Inc();\n    }\n    \n    virtual ~ThreadConstructor() {\n      _pool->Dec();\n    }\n    \n    rtc::Thread *Current() const {\n      return _pool->GetWorker();\n    }\n     \n  protected:\n    ThreadPool* _pool;\n};\n\nclass PeerConnectionFactory : public ThreadConstructor, public webrtc::PeerConnectionFactory {\n  public:\n    PeerConnectionFactory() :\n      webrtc::PeerConnectionFactory(rtc::Thread::Current(), ThreadConstructor::Current(), NULL, NULL, NULL)\n    { }    \n};\n\n#ifdef WIN32\n  rtc::Win32Thread* _signal;\n#else \n  rtc::Thread* _signal;\n#endif \n\nrtc::scoped_refptr<webrtc::PeerConnectionFactoryInterface> _factory;\nrtc::scoped_ptr<cricket::DeviceManagerInterface> _manager;\n\nvoid Core::Init() {\n  LOG(LS_INFO) << __PRETTY_FUNCTION__;\n  \n#ifdef WIN32\n  rtc::EnsureWinsockInit();\n#endif\n  rtc::InitializeSSL();\n\n#ifdef WIN32\n  _signal = new rtc::Win32Thread();\n#else \n  _signal = new rtc::Thread();\n#endif\n  _signal->Start();\n\n  rtc::ThreadManager::Instance()->SetCurrentThread(_signal);\n  \n  if (rtc::ThreadManager::Instance()->CurrentThread() != _signal) {\n    LOG(LS_ERROR) << \"Internal Thread Error!\";\n    abort();\n  }\n\n  ThreadPool::Init();\n\n  _factory = Core::CreateFactory();\n  _manager.reset(cricket::DeviceManagerFactory::Create());\n\n  if (!_manager->Init()) {\n    _manager.release();\n  }\n}\n\nvoid Core::Dispose() {\n  LOG(LS_INFO) << __PRETTY_FUNCTION__;\n\n#if (NODE_MODULE_VERSION < NODE_0_12_MODULE_VERSION)\n  V8::LowMemoryNotification();\n#else\n  Isolate* isolate = Isolate::GetCurrent();\n  isolate->LowMemoryNotification();\n#endif\n  \n  _factory.release();\n\n  if (_manager.get()) {\n    _manager->Terminate();\n  }\n\n  _manager.release();\n  \n  ThreadPool::Dispose();\n  \n  _signal->Stop(); \n  delete _signal;\n}\n\nrtc::scoped_refptr<webrtc::PeerConnectionFactoryInterface> Core::CreateFactory() {\n  rtc::scoped_refptr<PeerConnectionFactory> factory(new rtc::RefCountedObject<PeerConnectionFactory>());\n  \n  webrtc::MethodCall0<PeerConnectionFactory, bool> call(factory.get(), &webrtc::PeerConnectionFactory::Initialize);\n  bool result = call.Marshal(factory->signaling_thread());\n  \n  if (!result) {\n    return NULL;\n  }\n  \n  return webrtc::PeerConnectionFactoryProxy::Create(factory->signaling_thread(), factory);\n}\n\nwebrtc::PeerConnectionFactoryInterface* Core::GetFactory() {\n  LOG(LS_INFO) << __PRETTY_FUNCTION__;\n  \n  return _factory.get();\n}\n\ncricket::DeviceManagerInterface* Core::GetManager() {\n  LOG(LS_INFO) << __PRETTY_FUNCTION__;\n  \n  return _manager.get();\n}<commit_msg>Update Core<commit_after>\/*\n* The MIT License (MIT)\n*\n* Copyright (c) 2015 vmolsa <ville.molsa@gmail.com> (http:\/\/github.com\/vmolsa)\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#include \"nan.h\"\n#include \"Core.h\"\n\n#include \"talk\/app\/webrtc\/peerconnectionfactoryproxy.h\"\n#include \"talk\/app\/webrtc\/proxy.h\"\n\n#include \"webrtc\/base\/cpumonitor.h\"\n\n#ifdef WIN32\n#include \"webrtc\/base\/win32socketinit.h\"\n#include \"webrtc\/base\/win32socketserver.h\"\n#else\n#include \"webrtc\/base\/physicalsocketserver.h\"\n#endif\n\nusing namespace v8;\nusing namespace WebRTC;\n\nclass ThreadPool {\n  public:\n    static void Init() {\n      rtc::CpuSampler info;\n      \n      if (info.Init()) {\n        _instances = info.GetCurrentCpus();\n      } else {\n        _instances = 1;\n      }\n       \n      _pool = new ThreadPool[_instances];\n    }\n    \n    static void Dispose() {\n      delete [] _pool;\n    }\n  \n    static ThreadPool *GetPool() {\n      int selected = _instances - 1;\n      size_t count = _pool[_instances - 1]._count;\n      \n      for (int index = 0; index < _instances; index++) {\n        if (count >= _pool[index]._count) {\n          selected = index;\n          count = _pool[index]._count;\n        }\n      }\n      \n      return &_pool[selected];\n    }\n  \n    rtc::Thread *GetWorker() {\n      return _worker;\n    }\n    \n    void Inc() {\n      _count++;\n    }\n    \n    void Dec() {\n      _count--;\n    }\n    \n  private:\n    ThreadPool() : _count(0), _worker(new rtc::Thread()) {\n      _worker->Start();\n    }\n    \n    virtual ~ThreadPool() {\n      _worker->Stop();\n      delete _worker;\n    }\n    \n  protected:\n    size_t _count;\n    rtc::Thread* _worker;\n    static ThreadPool* _pool;\n    static int _instances;\n};\n\nThreadPool* ThreadPool::_pool;\nint ThreadPool::_instances;\n\nclass ThreadConstructor {\n  public:\n    ThreadConstructor() : _pool(ThreadPool::GetPool()) { \n      _pool->Inc();\n    }\n    \n    virtual ~ThreadConstructor() {\n      _pool->Dec();\n    }\n    \n    rtc::Thread *Current() const {\n      return _pool->GetWorker();\n    }\n     \n  protected:\n    ThreadPool* _pool;\n};\n\nclass PeerConnectionFactory : public ThreadConstructor, public webrtc::PeerConnectionFactory {\n  public:\n    PeerConnectionFactory() :\n      webrtc::PeerConnectionFactory(rtc::Thread::Current(), ThreadConstructor::Current(), NULL, NULL, NULL)\n    { }    \n};\n\nrtc::Thread* _signal;\nrtc::scoped_refptr<webrtc::PeerConnectionFactoryInterface> _factory;\nrtc::scoped_ptr<cricket::DeviceManagerInterface> _manager;\n\nvoid Core::Init() {\n  LOG(LS_INFO) << __PRETTY_FUNCTION__;\n  \n#ifdef WIN32\n  rtc::EnsureWinsockInit();\n#endif\n  rtc::InitializeSSL();\n\n  _signal = new rtc::Thread();\n  _signal->Start();\n\n  rtc::ThreadManager::Instance()->SetCurrentThread(_signal);\n  \n  if (rtc::ThreadManager::Instance()->CurrentThread() != _signal) {\n    LOG(LS_ERROR) << \"Internal Thread Error!\";\n    abort();\n  }\n\n  ThreadPool::Init();\n\n  _factory = Core::CreateFactory();\n  _manager.reset(cricket::DeviceManagerFactory::Create());\n\n  if (!_manager->Init()) {\n    _manager.release();\n  }\n}\n\nvoid Core::Dispose() {\n  LOG(LS_INFO) << __PRETTY_FUNCTION__;\n\n#if (NODE_MODULE_VERSION < NODE_0_12_MODULE_VERSION)\n  V8::LowMemoryNotification();\n#else\n  Isolate* isolate = Isolate::GetCurrent();\n  isolate->LowMemoryNotification();\n#endif\n  \n  _factory.release();\n\n  if (_manager.get()) {\n    _manager->Terminate();\n  }\n\n  _manager.release();\n  \n  ThreadPool::Dispose();\n  \n  _signal->Stop(); \n  delete _signal;\n}\n\nrtc::scoped_refptr<webrtc::PeerConnectionFactoryInterface> Core::CreateFactory() {\n  rtc::scoped_refptr<PeerConnectionFactory> factory(new rtc::RefCountedObject<PeerConnectionFactory>());\n  \n  webrtc::MethodCall0<PeerConnectionFactory, bool> call(factory.get(), &webrtc::PeerConnectionFactory::Initialize);\n  bool result = call.Marshal(factory->signaling_thread());\n  \n  if (!result) {\n    return NULL;\n  }\n  \n  return webrtc::PeerConnectionFactoryProxy::Create(factory->signaling_thread(), factory);\n}\n\nwebrtc::PeerConnectionFactoryInterface* Core::GetFactory() {\n  LOG(LS_INFO) << __PRETTY_FUNCTION__;\n  \n  return _factory.get();\n}\n\ncricket::DeviceManagerInterface* Core::GetManager() {\n  LOG(LS_INFO) << __PRETTY_FUNCTION__;\n  \n  return _manager.get();\n}<|endoftext|>"}
{"text":"<commit_before>\/*++\nCopyright (c) 2013 Microsoft Corporation\n\nModule Name:\n\n    weighted_maxsat.cpp\n\nAbstract:\n    Weighted MAXSAT module\n\nAuthor:\n\n    Anh-Dung Phan (t-anphan) 2013-10-16\n\nNotes:\n\n--*\/\n\n#include \"weighted_maxsat.h\"\n#include \"smt_theory.h\"\n#include \"smt_context.h\"\n#include \"ast_pp.h\"\n\nnamespace smt {\n\n    class theory_weighted_maxsat : public theory {\n        app_ref_vector           m_vars;       \/\/ Auxiliary variables per soft clause\n        expr_ref_vector          m_fmls;       \/\/ Formulas per soft clause\n        app_ref                  m_min_cost_atom; \/\/ atom tracking modified lower bound\n        bool_var                 m_min_cost_bv;   \/\/ max cost Boolean variable\n        vector<rational>         m_weights;    \/\/ weights of theory variables.\n        svector<theory_var>      m_costs;      \/\/ set of asserted theory variables\n        svector<theory_var>      m_cost_save;  \/\/ set of asserted theory variables\n        rational                 m_cost;       \/\/ current sum of asserted costs\n        rational                 m_min_cost;   \/\/ current maximal cost assignment.\n        u_map<theory_var>        m_bool2var;   \/\/ bool_var -> theory_var\n        svector<bool_var>        m_var2bool;   \/\/ theory_var -> bool_var\n    public:\n        theory_weighted_maxsat(ast_manager& m):\n            theory(m.mk_family_id(\"weighted_maxsat\")),\n            m_vars(m),\n            m_fmls(m),\n            m_min_cost_atom(m)\n        {}\n\n        \/**\n           \\brief return the complement of variables that are currently assigned.\n        *\/\n        void get_assignment(expr_ref_vector& result) {\n            result.reset();\n            std::sort(m_cost_save.begin(), m_cost_save.end());\n            for (unsigned i = 0, j = 0; i < m_vars.size(); ++i) {\n                if (j < m_cost_save.size() && m_cost_save[j] == i) {\n                    ++j;\n                }\n                else {\n                    result.push_back(m_fmls[i].get());\n                }\n            }\n        }\n\n        virtual void init_search_eh() {\n            context & ctx = get_context();\n            ast_manager& m = get_manager();\n            m_var2bool.reset();\n            for (unsigned i = 0; i < m_vars.size(); ++i) {\n                app* var = m_vars[i].get();  \n                bool_var bv;\n                enode* x;\n                if (!ctx.e_internalized(var)) {\n                    x = ctx.mk_enode(var, false, true, true);\n                }\n                else {\n                    x = ctx.get_enode(var);\n                }\n                if (ctx.b_internalized(var)) {\n                    bv = ctx.get_bool_var(var);\n                }\n                else {\n                    bv = ctx.mk_bool_var(var);\n                }\n                ctx.set_var_theory(bv, get_id());\n                ctx.set_enode_flag(bv, true);\n                theory_var v = mk_var(x);\n                ctx.attach_th_var(x, this, v);\n                m_bool2var.insert(bv, v);\n                SASSERT(v == m_var2bool.size());\n                m_var2bool.push_back(bv);\n                SASSERT(ctx.bool_var2enode(bv));\n            }\n            if (m_min_cost_atom) {\n                app* var = m_min_cost_atom;\n                if (!ctx.e_internalized(var)) {\n                    ctx.mk_enode(var, false, true, true);\n                }\n                if (ctx.b_internalized(var)) {\n                    m_min_cost_bv = ctx.get_bool_var(var);\n                }\n                else {\n                    m_min_cost_bv = ctx.mk_bool_var(var);\n                }                \n                ctx.set_enode_flag(m_min_cost_bv, true);\n            }\n        }\n\n        void assert_weighted(expr* fml, rational const& w) {\n            context & ctx = get_context();\n            ast_manager& m = get_manager();\n            app_ref var(m), wfml(m);\n            var = m.mk_fresh_const(\"w\", m.mk_bool_sort());\n            wfml = m.mk_or(var, fml);\n            ctx.assert_expr(wfml);\n            m_weights.push_back(w);\n            m_vars.push_back(var);\n            m_fmls.push_back(fml);\n            m_min_cost += w;\n        }\n\n        rational const& get_min_cost() const { \n            return m_min_cost; \n        }\n\n        expr* set_min_cost(rational const& c) { \n            ast_manager& m = get_manager();\n            std::ostringstream strm;\n            strm << \"cost <= \" << c;\n            m_min_cost = c; \n            m_min_cost_atom = m.mk_fresh_const(strm.str().c_str(), m.mk_bool_sort());\n            return m_min_cost_atom;\n        }\n\n        bool found_solution() const {\n            return !m_cost_save.empty();\n        }\n\n        virtual void assign_eh(bool_var v, bool is_true) {\n            IF_VERBOSE(3, verbose_stream() << \"Assign \" << v << \" \" << is_true << \"\\n\";);\n            if (is_true) {\n                context& ctx = get_context();\n                theory_var tv = m_bool2var[v];\n                rational const& w = m_weights[tv];\n                ctx.push_trail(value_trail<context, rational>(m_cost));\n                ctx.push_trail(push_back_vector<context, svector<theory_var> >(m_costs));\n                m_cost += w;\n                m_costs.push_back(tv);\n                if (m_cost > m_min_cost) {\n                    block(false);\n                }\n            }\n        }\n\n        virtual final_check_status final_check_eh() {\n            if (block(true)) {\n                return FC_DONE;\n            }\n            return FC_CONTINUE;\n        }\n\n        virtual bool use_diseqs() const { \n            return false;\n        }\n\n        virtual bool build_models() const { \n            return false;\n        }\n\n        void reset() {\n            reset_eh();\n        }\n\n        virtual void reset_eh() {\n            theory::reset_eh();\n            m_vars.reset();\n            m_fmls.reset();\n            m_weights.reset();\n            m_costs.reset();\n            m_min_cost.reset();\n            m_cost.reset();\n            m_cost_save.reset();\n            m_bool2var.reset();\n            m_var2bool.reset();\n            m_min_cost_atom = 0;\n        }\n\n        virtual theory * mk_fresh(context * new_ctx) { return alloc(theory_weighted_maxsat, new_ctx->get_manager()); }\n        virtual bool internalize_atom(app * atom, bool gate_ctx) { return false; }\n        virtual bool internalize_term(app * term) { return false; }\n        virtual void new_eq_eh(theory_var v1, theory_var v2) { }\n        virtual void new_diseq_eh(theory_var v1, theory_var v2) { }\n\n\n    private:\n       \n        class compare_cost {\n            theory_weighted_maxsat& m_th;\n        public:\n            compare_cost(theory_weighted_maxsat& t):m_th(t) {}\n            bool operator() (theory_var v, theory_var w) const { \n                return m_th.m_weights[v] > m_th.m_weights[w]; \n            }\n        };\n\n        bool block(bool is_final) {\n            if (m_vars.empty()) {\n                return true;\n            }\n            ast_manager& m = get_manager();\n            context& ctx = get_context();\n            literal_vector lits;\n            compare_cost compare_cost(*this);\n            svector<theory_var> costs(m_costs);\n            std::sort(costs.begin(), costs.end(), compare_cost);\n            rational weight(0);\n            for (unsigned i = 0; i < costs.size() && weight < m_min_cost; ++i) {\n                weight += m_weights[costs[i]];\n                lits.push_back(~literal(m_var2bool[costs[i]]));\n            }\n            if (m_min_cost_atom) {\n                lits.push_back(~literal(m_min_cost_bv));\n            }\n            IF_VERBOSE(2,\n                       verbose_stream() << \"block: \";\n                       for (unsigned i = 0; i < lits.size(); ++i) {\n                           expr_ref tmp(m);\n                           ctx.literal2expr(lits[i], tmp);\n                           verbose_stream() << tmp << \" \";\n                       }\n                       verbose_stream() << \"\\n\";\n                       );\n\n            ctx.mk_th_axiom(get_id(), lits.size(), lits.c_ptr());\n            if (is_final && m_cost < m_min_cost) {\n                m_min_cost = weight;\n                m_cost_save.reset();\n                m_cost_save.append(m_costs);\n            }\n            return false;\n        }                \n    };\n\n}\n\nnamespace opt {\n\n    \/**\n       Iteratively increase cost until there is an assignment during\n       final_check that satisfies min_cost.\n\n       Takes: log (n \/ log(n)) iterations\n    *\/\n\n    static lbool iterative_weighted_maxsat(opt_solver& s, smt::theory_weighted_maxsat& wth) {\n        ast_manager& m = s.get_context().get_manager();\n        rational cost = wth.get_min_cost();\n        rational log_cost(1), tmp(1);\n        while (tmp < cost) {\n            ++log_cost;\n            tmp *= rational(2);\n        }\n        expr_ref_vector bounds(m);\n        expr_ref bound(m);\n        lbool result = l_false;\n        while (log_cost <= cost && !wth.found_solution() && result != l_undef) {\n            std::cout << \"cost: \" << log_cost << \"\\n\";\n            bound = wth.set_min_cost(log_cost);\n            bounds.push_back(bound);\n            result = s.check_sat_core(1,bounds.c_ptr()+bounds.size()-1);\n            log_cost *= rational(2);\n        }\n        return result;\n    }\n\n\n    struct wmaxsmt::imp {\n        ast_manager&     m;\n        opt_solver&      s;\n        expr_ref_vector  m_soft;\n        expr_ref_vector  m_assignment;\n        vector<rational> m_weights;\n        rational         m_upper;\n\n        imp(ast_manager& m, opt_solver& s, expr_ref_vector& soft_constraints, vector<rational> const& weights):\n            m(m), s(s), m_soft(soft_constraints), m_assignment(m), m_weights(weights)\n        {}\n        ~imp() {}\n\n        smt::theory_weighted_maxsat* get_theory() const {\n            smt::context& ctx = s.get_context();                        \n            smt::theory_id th_id = m.get_family_id(\"weighted_maxsat\");\n            smt::theory* th = ctx.get_theory(th_id);               \n            if (th) {\n                return dynamic_cast<smt::theory_weighted_maxsat*>(th);\n            }\n            else {\n                return 0;\n            }\n        }\n\n        smt::theory_weighted_maxsat& ensure_theory() {\n            smt::theory_weighted_maxsat* wth = get_theory();\n            if (wth) {\n                wth->reset();\n            }\n            else {\n                wth = alloc(smt::theory_weighted_maxsat, m);\n                s.get_context().register_plugin(wth);\n            }\n            return *wth;\n        }\n\n        \/**\n           Takes solver with hard constraints added.\n           Returns a maximal satisfying subset of weighted soft_constraints\n           that are still consistent with the solver state.\n        *\/\n        \n        lbool operator()() {\n            TRACE(\"opt\", tout << \"weighted maxsat\\n\";);\n            smt::theory_weighted_maxsat& wth = ensure_theory();\n            lbool result;\n            {\n                solver::scoped_push _s(s);\n                for (unsigned i = 0; i < m_soft.size(); ++i) {\n                    wth.assert_weighted(m_soft[i].get(), m_weights[i]);\n                }\n                result = s.check_sat_core(0,0);\n                \n                wth.get_assignment(m_assignment);\n                if (!m_assignment.empty() && result == l_false) {\n                    result = l_true;\n                }\n            }\n            m_upper = wth.get_min_cost();\n            TRACE(\"opt\", tout << \"min cost: \" << m_upper << \"\\n\";);\n            wth.reset();\n            return result;            \n        }        \n\n        rational get_lower() const {\n            return rational(0);\n        }\n\n        rational get_upper() const {\n            return m_upper;\n        }\n    };\n\n    wmaxsmt::wmaxsmt(ast_manager& m, opt_solver& s, expr_ref_vector& soft_constraints, vector<rational> const& weights) {\n        m_imp = alloc(imp, m, s, soft_constraints, weights);\n    }\n\n    wmaxsmt::~wmaxsmt() {\n        dealloc(m_imp);\n    }\n    \n    lbool wmaxsmt::operator()() {\n        return (*m_imp)();\n    }\n    rational wmaxsmt::get_lower() const {\n        return m_imp->get_lower();\n    }\n    rational wmaxsmt::get_upper() const {\n        return m_imp->get_upper();\n    }\n    rational wmaxsmt::get_value() const {\n        return m_imp->get_upper();\n    }\n    expr_ref_vector wmaxsmt::get_assignment() const {\n        return m_imp->m_assignment;\n    }\n    void wmaxsmt::set_cancel(bool f) {\n        \/\/ no-op\n    }\n    void wmaxsmt::collect_statistics(statistics& st) const {\n        \/\/ no-op\n    }\n\n\n    \n\n};\n\n<commit_msg>fix bug exposed by lia2maxsmt4<commit_after>\/*++\nCopyright (c) 2013 Microsoft Corporation\n\nModule Name:\n\n    weighted_maxsat.cpp\n\nAbstract:\n    Weighted MAXSAT module\n\nAuthor:\n\n    Anh-Dung Phan (t-anphan) 2013-10-16\n\nNotes:\n\n--*\/\n\n#include \"weighted_maxsat.h\"\n#include \"smt_theory.h\"\n#include \"smt_context.h\"\n#include \"ast_pp.h\"\n\nnamespace smt {\n\n    class theory_weighted_maxsat : public theory {\n        app_ref_vector           m_vars;       \/\/ Auxiliary variables per soft clause\n        expr_ref_vector          m_fmls;       \/\/ Formulas per soft clause\n        app_ref                  m_min_cost_atom; \/\/ atom tracking modified lower bound\n        bool_var                 m_min_cost_bv;   \/\/ max cost Boolean variable\n        vector<rational>         m_weights;    \/\/ weights of theory variables.\n        svector<theory_var>      m_costs;      \/\/ set of asserted theory variables\n        svector<theory_var>      m_cost_save;  \/\/ set of asserted theory variables\n        rational                 m_cost;       \/\/ current sum of asserted costs\n        rational                 m_min_cost;   \/\/ current maximal cost assignment.\n        u_map<theory_var>        m_bool2var;   \/\/ bool_var -> theory_var\n        svector<bool_var>        m_var2bool;   \/\/ theory_var -> bool_var\n    public:\n        theory_weighted_maxsat(ast_manager& m):\n            theory(m.mk_family_id(\"weighted_maxsat\")),\n            m_vars(m),\n            m_fmls(m),\n            m_min_cost_atom(m)\n        {}\n\n        \/**\n           \\brief return the complement of variables that are currently assigned.\n        *\/\n        void get_assignment(expr_ref_vector& result) {\n            result.reset();\n            std::sort(m_cost_save.begin(), m_cost_save.end());\n            for (unsigned i = 0, j = 0; i < m_vars.size(); ++i) {\n                if (j < m_cost_save.size() && m_cost_save[j] == i) {\n                    ++j;\n                }\n                else {\n                    result.push_back(m_fmls[i].get());\n                }\n            }\n        }\n\n        virtual void init_search_eh() {\n            context & ctx = get_context();\n            ast_manager& m = get_manager();\n            m_var2bool.reset();\n            for (unsigned i = 0; i < m_vars.size(); ++i) {\n                app* var = m_vars[i].get();  \n                bool_var bv;\n                enode* x;\n                if (!ctx.e_internalized(var)) {\n                    x = ctx.mk_enode(var, false, true, true);\n                }\n                else {\n                    x = ctx.get_enode(var);\n                }\n                if (ctx.b_internalized(var)) {\n                    bv = ctx.get_bool_var(var);\n                }\n                else {\n                    bv = ctx.mk_bool_var(var);\n                }\n                ctx.set_var_theory(bv, get_id());\n                ctx.set_enode_flag(bv, true);\n                theory_var v = mk_var(x);\n                ctx.attach_th_var(x, this, v);\n                m_bool2var.insert(bv, v);\n                SASSERT(v == m_var2bool.size());\n                m_var2bool.push_back(bv);\n                SASSERT(ctx.bool_var2enode(bv));\n\n                lbool asgn = ctx.get_assignment(bv);\n                if (asgn == l_true) {\n                    assign_eh(bv, true);\n                }\n\n            }\n            if (m_min_cost_atom) {\n                app* var = m_min_cost_atom;\n                if (!ctx.e_internalized(var)) {\n                    ctx.mk_enode(var, false, true, true);\n                }\n                if (ctx.b_internalized(var)) {\n                    m_min_cost_bv = ctx.get_bool_var(var);\n                }\n                else {\n                    m_min_cost_bv = ctx.mk_bool_var(var);\n                }                \n                ctx.set_enode_flag(m_min_cost_bv, true);\n            }\n        }\n\n        void assert_weighted(expr* fml, rational const& w) {\n            context & ctx = get_context();\n            ast_manager& m = get_manager();\n            app_ref var(m), wfml(m);\n            var = m.mk_fresh_const(\"w\", m.mk_bool_sort());\n            wfml = m.mk_or(var, fml);\n            ctx.assert_expr(wfml);\n            m_weights.push_back(w);\n            m_vars.push_back(var);\n            m_fmls.push_back(fml);\n            m_min_cost += w;\n        }\n\n        rational const& get_min_cost() const { \n            return m_min_cost; \n        }\n\n        expr* set_min_cost(rational const& c) { \n            ast_manager& m = get_manager();\n            std::ostringstream strm;\n            strm << \"cost <= \" << c;\n            m_min_cost = c; \n            m_min_cost_atom = m.mk_fresh_const(strm.str().c_str(), m.mk_bool_sort());\n            return m_min_cost_atom;\n        }\n\n        bool found_solution() const {\n            return !m_cost_save.empty();\n        }\n\n        virtual void assign_eh(bool_var v, bool is_true) {\n            IF_VERBOSE(3, verbose_stream() << \"Assign \" << v << \" \" << is_true << \"\\n\";);\n            if (is_true) {\n                context& ctx = get_context();\n                theory_var tv = m_bool2var[v];\n                rational const& w = m_weights[tv];\n                ctx.push_trail(value_trail<context, rational>(m_cost));\n                ctx.push_trail(push_back_vector<context, svector<theory_var> >(m_costs));\n                m_cost += w;\n                m_costs.push_back(tv);\n                if (m_cost > m_min_cost) {\n                    block(false);\n                }\n            }\n        }\n\n        virtual final_check_status final_check_eh() {\n            if (block(true)) {\n                return FC_DONE;\n            }\n            return FC_CONTINUE;\n        }\n\n        virtual bool use_diseqs() const { \n            return false;\n        }\n\n        virtual bool build_models() const { \n            return false;\n        }\n\n        void reset() {\n            reset_eh();\n        }\n\n        virtual void reset_eh() {\n            theory::reset_eh();\n            m_vars.reset();\n            m_fmls.reset();\n            m_weights.reset();\n            m_costs.reset();\n            m_min_cost.reset();\n            m_cost.reset();\n            m_cost_save.reset();\n            m_bool2var.reset();\n            m_var2bool.reset();\n            m_min_cost_atom = 0;\n        }\n\n        virtual theory * mk_fresh(context * new_ctx) { return alloc(theory_weighted_maxsat, new_ctx->get_manager()); }\n        virtual bool internalize_atom(app * atom, bool gate_ctx) { return false; }\n        virtual bool internalize_term(app * term) { return false; }\n        virtual void new_eq_eh(theory_var v1, theory_var v2) { }\n        virtual void new_diseq_eh(theory_var v1, theory_var v2) { }\n\n\n    private:\n       \n        class compare_cost {\n            theory_weighted_maxsat& m_th;\n        public:\n            compare_cost(theory_weighted_maxsat& t):m_th(t) {}\n            bool operator() (theory_var v, theory_var w) const { \n                return m_th.m_weights[v] > m_th.m_weights[w]; \n            }\n        };\n\n        bool block(bool is_final) {\n            if (m_vars.empty()) {\n                return true;\n            }\n            ast_manager& m = get_manager();\n            context& ctx = get_context();\n            literal_vector lits;\n            compare_cost compare_cost(*this);\n            svector<theory_var> costs(m_costs);\n            std::sort(costs.begin(), costs.end(), compare_cost);\n            rational weight(0);\n            for (unsigned i = 0; i < costs.size() && weight < m_min_cost; ++i) {\n                weight += m_weights[costs[i]];\n                lits.push_back(~literal(m_var2bool[costs[i]]));\n            }\n            if (m_min_cost_atom) {\n                lits.push_back(~literal(m_min_cost_bv));\n            }\n            IF_VERBOSE(2,\n                       verbose_stream() << \"block: \";\n                       for (unsigned i = 0; i < lits.size(); ++i) {\n                           expr_ref tmp(m);\n                           ctx.literal2expr(lits[i], tmp);\n                           verbose_stream() << tmp << \" \";\n                       }\n                       verbose_stream() << \"\\n\";\n                       );\n\n            ctx.mk_th_axiom(get_id(), lits.size(), lits.c_ptr());\n            if (is_final && m_cost < m_min_cost) {\n                m_min_cost = weight;\n                m_cost_save.reset();\n                m_cost_save.append(m_costs);\n            }\n            return false;\n        }                \n    };\n\n}\n\nnamespace opt {\n\n    \/**\n       Iteratively increase cost until there is an assignment during\n       final_check that satisfies min_cost.\n\n       Takes: log (n \/ log(n)) iterations\n    *\/\n\n    static lbool iterative_weighted_maxsat(opt_solver& s, smt::theory_weighted_maxsat& wth) {\n        ast_manager& m = s.get_context().get_manager();\n        rational cost = wth.get_min_cost();\n        rational log_cost(1), tmp(1);\n        while (tmp < cost) {\n            ++log_cost;\n            tmp *= rational(2);\n        }\n        expr_ref_vector bounds(m);\n        expr_ref bound(m);\n        lbool result = l_false;\n        while (log_cost <= cost && !wth.found_solution() && result != l_undef) {\n            std::cout << \"cost: \" << log_cost << \"\\n\";\n            bound = wth.set_min_cost(log_cost);\n            bounds.push_back(bound);\n            result = s.check_sat_core(1,bounds.c_ptr()+bounds.size()-1);\n            log_cost *= rational(2);\n        }\n        return result;\n    }\n\n\n    struct wmaxsmt::imp {\n        ast_manager&     m;\n        opt_solver&      s;\n        expr_ref_vector  m_soft;\n        expr_ref_vector  m_assignment;\n        vector<rational> m_weights;\n        rational         m_upper;\n\n        imp(ast_manager& m, opt_solver& s, expr_ref_vector& soft_constraints, vector<rational> const& weights):\n            m(m), s(s), m_soft(soft_constraints), m_assignment(m), m_weights(weights)\n        {}\n        ~imp() {}\n\n        smt::theory_weighted_maxsat* get_theory() const {\n            smt::context& ctx = s.get_context();                        \n            smt::theory_id th_id = m.get_family_id(\"weighted_maxsat\");\n            smt::theory* th = ctx.get_theory(th_id);               \n            if (th) {\n                return dynamic_cast<smt::theory_weighted_maxsat*>(th);\n            }\n            else {\n                return 0;\n            }\n        }\n\n        smt::theory_weighted_maxsat& ensure_theory() {\n            smt::theory_weighted_maxsat* wth = get_theory();\n            if (wth) {\n                wth->reset();\n            }\n            else {\n                wth = alloc(smt::theory_weighted_maxsat, m);\n                s.get_context().register_plugin(wth);\n            }\n            return *wth;\n        }\n\n        \/**\n           Takes solver with hard constraints added.\n           Returns a maximal satisfying subset of weighted soft_constraints\n           that are still consistent with the solver state.\n        *\/\n        \n        lbool operator()() {\n            TRACE(\"opt\", tout << \"weighted maxsat\\n\";);\n            smt::theory_weighted_maxsat& wth = ensure_theory();\n            lbool result;\n            {\n                solver::scoped_push _s(s);\n                for (unsigned i = 0; i < m_soft.size(); ++i) {\n                    wth.assert_weighted(m_soft[i].get(), m_weights[i]);\n                }\n                result = s.check_sat_core(0,0);\n                \n                wth.get_assignment(m_assignment);\n                if (!m_assignment.empty() && result == l_false) {\n                    result = l_true;\n                }\n            }\n            m_upper = wth.get_min_cost();\n            TRACE(\"opt\", tout << \"min cost: \" << m_upper << \"\\n\";);\n            wth.reset();\n            return result;            \n        }        \n\n        rational get_lower() const {\n            return rational(0);\n        }\n\n        rational get_upper() const {\n            return m_upper;\n        }\n    };\n\n    wmaxsmt::wmaxsmt(ast_manager& m, opt_solver& s, expr_ref_vector& soft_constraints, vector<rational> const& weights) {\n        m_imp = alloc(imp, m, s, soft_constraints, weights);\n    }\n\n    wmaxsmt::~wmaxsmt() {\n        dealloc(m_imp);\n    }\n    \n    lbool wmaxsmt::operator()() {\n        return (*m_imp)();\n    }\n    rational wmaxsmt::get_lower() const {\n        return m_imp->get_lower();\n    }\n    rational wmaxsmt::get_upper() const {\n        return m_imp->get_upper();\n    }\n    rational wmaxsmt::get_value() const {\n        return m_imp->get_upper();\n    }\n    expr_ref_vector wmaxsmt::get_assignment() const {\n        return m_imp->m_assignment;\n    }\n    void wmaxsmt::set_cancel(bool f) {\n        \/\/ no-op\n    }\n    void wmaxsmt::collect_statistics(statistics& st) const {\n        \/\/ no-op\n    }\n\n\n    \n\n};\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\n#include <osquery\/filesystem.h>\n#include <osquery\/tables.h>\n\nnamespace fs = boost::filesystem;\nnamespace pt = boost::property_tree;\n\nnamespace osquery {\nnamespace tables {\n\n\/\/\/ Each home directory will include custom extensions.\n#define kSafariExtensionsPath \"\/Library\/Safari\/Extensions\/\"\n\n#define kSafariPluginsPath \"\/Library\/Internet Plug-Ins\/\"\n\n\/\/\/ Safari extensions will not load unless they have the expected pattern.\n#define kSafariExtensionsPattern \"%.safariextz\"\n\nconst std::map<std::string, std::string> kSafariPluginKeys = {\n    {\"WebPluginName\", \"name\"},\n    {\"CFBundleIdentifier\", \"identifier\"},\n    {\"CFBundleShortVersionString\", \"version\"},\n    {\"DTPlatformBuild\", \"sdk\"},\n    {\"WebPluginDescription\", \"description\"},\n    {\"CFBundleDevelopmentRegion\", \"development_region\"},\n    {\"LSRequiresNativeExecution\", \"native\"},\n};\n\nvoid genSafariPlugin(const std::string& path, QueryData& results) {\n  Row r;\n  pt::ptree tree;\n  if (osquery::parsePlist(path + \"\/Contents\/Info.plist\", tree).ok()) {\n    \/\/ Plugin did not include an Info.plist, or it was invalid\n    for (const auto& it : kSafariPluginKeys) {\n      try {\n        r[it.second] = tree.get<std::string>(it.first);\n      } catch (const pt::ptree_error& e) {\n        r[it.second] = \"\";\n      }\n\n      \/\/ Convert Plist bool-types to an integer.\n      if (r[it.second] == \"true\" || r[it.second] == \"YES\" ||\n          r[it.first] == \"Yes\") {\n        r[it.second] = INTEGER(1);\n      } else if (r[it.second] == \"false\" || r[it.second] == \"NO\" ||\n                 r[it.second] == \"No\") {\n        r[it.second] = INTEGER(0);\n      }\n    }\n  }\n\n  if (r.at(\"is_native\").size() == 0) {\n    \/\/ The default case for native execution is false.\n    r[\"is_native\"] = \"0\";\n  }\n\n  r[\"path\"] = path;\n  results.push_back(r);\n}\n\nQueryData genSafariPlugins(QueryContext& context) {\n  QueryData results;\n\n  std::vector<std::string> bundles;\n  if (listDirectoriesInDirectory(kSafariPluginsPath, bundles).ok()) {\n    for (const auto& dir : bundles) {\n      genSafariPlugin(dir, results);\n    }\n  }\n\n  auto homes = osquery::getHomeDirectories();\n  for (const auto& home : homes) {\n    bundles.clear();\n    if (listDirectoriesInDirectory(home \/ kSafariPluginsPath, bundles).ok()) {\n      for (const auto& dir : bundles) {\n        genSafariPlugin(dir, results);\n      }\n    }\n  }\n\n  return results;\n}\n\nvoid genSafariExtension(const std::string& path, QueryData& results) {\n  Row r;\n  r[\"name\"] = fs::path(path).stem().string();\n  r[\"path\"] = path;\n  results.push_back(r);\n}\n\nQueryData genSafariExtensions(QueryContext& context) {\n  QueryData results;\n\n  auto homes = osquery::getHomeDirectories();\n  for (const auto& home : homes) {\n    auto dir = home \/ kSafariExtensionsPath;\n    \/\/ Check that an extensions directory exists.\n    if (!pathExists(dir).ok()) {\n      continue;\n    }\n\n    \/\/ Glob the extension files.\n    std::vector<std::string> paths;\n    if (!resolveFilePattern(dir \/ kSafariExtensionsPattern, paths).ok()) {\n      continue;\n    }\n\n    for (const auto& extension_path : paths) {\n      genSafariExtension(extension_path, results);\n    }\n  }\n\n  return results;\n}\n}\n}\n<commit_msg>[Fix #869] Rename safari_plugins is_native<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\n#include <osquery\/filesystem.h>\n#include <osquery\/tables.h>\n\nnamespace fs = boost::filesystem;\nnamespace pt = boost::property_tree;\n\nnamespace osquery {\nnamespace tables {\n\n\/\/\/ Each home directory will include custom extensions.\n#define kSafariExtensionsPath \"\/Library\/Safari\/Extensions\/\"\n\n#define kSafariPluginsPath \"\/Library\/Internet Plug-Ins\/\"\n\n\/\/\/ Safari extensions will not load unless they have the expected pattern.\n#define kSafariExtensionsPattern \"%.safariextz\"\n\nconst std::map<std::string, std::string> kSafariPluginKeys = {\n    {\"WebPluginName\", \"name\"},\n    {\"CFBundleIdentifier\", \"identifier\"},\n    {\"CFBundleShortVersionString\", \"version\"},\n    {\"DTPlatformBuild\", \"sdk\"},\n    {\"WebPluginDescription\", \"description\"},\n    {\"CFBundleDevelopmentRegion\", \"development_region\"},\n    {\"LSRequiresNativeExecution\", \"native\"},\n};\n\nvoid genSafariPlugin(const std::string& path, QueryData& results) {\n  Row r;\n  pt::ptree tree;\n  if (osquery::parsePlist(path + \"\/Contents\/Info.plist\", tree).ok()) {\n    \/\/ Plugin did not include an Info.plist, or it was invalid\n    for (const auto& it : kSafariPluginKeys) {\n      try {\n        r[it.second] = tree.get<std::string>(it.first);\n      } catch (const pt::ptree_error& e) {\n        r[it.second] = \"\";\n      }\n\n      \/\/ Convert Plist bool-types to an integer.\n      if (r[it.second] == \"true\" || r[it.second] == \"YES\" ||\n          r[it.first] == \"Yes\") {\n        r[it.second] = INTEGER(1);\n      } else if (r[it.second] == \"false\" || r[it.second] == \"NO\" ||\n                 r[it.second] == \"No\") {\n        r[it.second] = INTEGER(0);\n      }\n    }\n  }\n\n  if (r.count(\"native\") == 0 || r.at(\"native\").size() == 0) {\n    \/\/ The default case for native execution is false.\n    r[\"native\"] = \"0\";\n  }\n\n  r[\"path\"] = path;\n  results.push_back(r);\n}\n\nQueryData genSafariPlugins(QueryContext& context) {\n  QueryData results;\n\n  std::vector<std::string> bundles;\n  if (listDirectoriesInDirectory(kSafariPluginsPath, bundles).ok()) {\n    for (const auto& dir : bundles) {\n      genSafariPlugin(dir, results);\n    }\n  }\n\n  auto homes = osquery::getHomeDirectories();\n  for (const auto& home : homes) {\n    bundles.clear();\n    if (listDirectoriesInDirectory(home \/ kSafariPluginsPath, bundles).ok()) {\n      for (const auto& dir : bundles) {\n        genSafariPlugin(dir, results);\n      }\n    }\n  }\n\n  return results;\n}\n\nvoid genSafariExtension(const std::string& path, QueryData& results) {\n  Row r;\n  r[\"name\"] = fs::path(path).stem().string();\n  r[\"path\"] = path;\n  results.push_back(r);\n}\n\nQueryData genSafariExtensions(QueryContext& context) {\n  QueryData results;\n\n  auto homes = osquery::getHomeDirectories();\n  for (const auto& home : homes) {\n    auto dir = home \/ kSafariExtensionsPath;\n    \/\/ Check that an extensions directory exists.\n    if (!pathExists(dir).ok()) {\n      continue;\n    }\n\n    \/\/ Glob the extension files.\n    std::vector<std::string> paths;\n    if (!resolveFilePattern(dir \/ kSafariExtensionsPattern, paths).ok()) {\n      continue;\n    }\n\n    for (const auto& extension_path : paths) {\n      genSafariExtension(extension_path, results);\n    }\n  }\n\n  return results;\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ctext.h\"\n\nconst ctext_config config_default = {\n  .m_tabstop = CTEXT_DEFAULT_TABSTOP,\n  .m_scrollback = CTEXT_DEFAULT_SCROLLBACK,\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_APPEND_TOP,\n  .m_on_event = CTEXT_DEFAULT_ON_EVENT\n};\n\nchar really_large_buffer[64000] = {0};\n\nctext::ctext(WINDOW *win = 0, ctext_config *config = 0)\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\nint8_t ctext::set_config(ctext_config *config)\n{\n  memcpy(&this->m_config, config, sizeof(ctext_config));\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\nsize_t ctext::clear(size_t amount = 0)\n{\n  if(amount == 0) \n  {\n    this->m_buffer.clear();\n  }\n  else\n  {\n    this->m_buffer.erase(this->m_buffer.begin(), this->m_buffer.begin() + amount);\n  }\n\n  if (this->m_config.m_on_event)\n  {\n    this->m_config.m_on_event(this, ctext_event::CLEAR);\n  }\n\n  return this->render();\n}\n\nint8_t ctext::direct_scroll(size_t x, size_t y)\n{\n  if(this->m_config.m_bounding_box) \n  {\n    x = max(0, x);\n    y = max(0, y);\n    x = min(x, this->m_max_x);\n    y = min(y, this->m_max_y);\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_event::SCROLL);\n  }\n\n  return 0;\n}\n\nint8_t ctext::scroll_to(size_t x, size_t y)\n{\n  this->direct_scroll(x, y);\n  return this->render();\n}\n\nint8_t ctext::get_offset(size_t*x, size_t*y)\n{\n  *x = this->m_pos_x;\n  *y = this->m_pos_y;\n\n  return 0;\n}\n\nint8_t get_size(size_t*x, size_t*y)\n{\n  *x = this->m_max_x;\n  *y = this->m_max_y;\n  return 0;\n}\n\nint8_t ctext::up(size_t amount = 1) \n{\n  return this->down(-amount);\n}\n\nint8_t ctext::down(size_t amount = 1) \n{\n  return this->scroll_to(this->m_pos_x, this->m_pos_y + amount);\n}\n\nint8_t ctext::left(size_t amount = 1) \n{\n  return this->right(-amount);\n}\n\nint8_t ctext:right(size_t amount = 1) \n{\n  return this->scroll_to(this->m_pos_x + amount, this->m_pos_y);\n}\n\nint8_t ctext::printf(const char*format, ...) \n{\n  this->render();\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  \/\/ The actual scroll back, which is what\n  \/\/ people expect in this feature is the \n  \/\/ configured scrollback + the window height.\n  size_t actual_scroll_back = this->m_win_height + this->m_config.m_scrollback;\n\n  if(this->m_buffer.size() > actual_scroll_back)\n  {\n    this->m_buffer.erase(this->m_buffer.begin(), this->m_buffer().size() - actual_scroll_back);\n  }\n  \n  this->m_max_x = 0;  \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  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(this->m_max_x, (*it).size());\n    }\n  }\n \n  \/\/ this is practically free so we'll just do it.\n  this->m_max_y = this->m_buffer().size();\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  return this->direct_scroll(this->m_pos_x, this->m_pos_y);\n  return 0;\n}\n\nint8_t ctext::printf(const char*format, ...)\n{\n  va_list args;\n  va_start(args, fmt);\n  vsprintf(really_large_buffer, args);\n  va_end(args);\n\n  this->m_buffer.push_back(really_large_buffer);\n\n  if (this->m_config.m_on_event)\n  {\n    this->m_config.m_on_event(this, ctext_event::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(this->m_buffer.size() - this->m_win_height, 0);\n  }\n\n  return this->render();\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  int32_t width = 0, height = 0;\n  getmaxyx(this->m_win, height, width);\n\n  \/\/ By this time, if we are bounded by a box,\n}\n<commit_msg>implementation complete, now time to compile<commit_after>#include \"ctext.h\"\n\nconst ctext_config config_default = {\n  .m_tabstop = CTEXT_DEFAULT_TABSTOP,\n  .m_scrollback = CTEXT_DEFAULT_SCROLLBACK,\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_APPEND_TOP,\n  .m_on_event = CTEXT_DEFAULT_ON_EVENT\n};\n\nchar really_large_buffer[64000] = {0};\n\nctext::ctext(WINDOW *win = 0, ctext_config *config = 0)\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\nint8_t ctext::set_config(ctext_config *config)\n{\n  memcpy(&this->m_config, config, sizeof(ctext_config));\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\nsize_t ctext::clear(size_t amount = 0)\n{\n  if(amount == 0) \n  {\n    this->m_buffer.clear();\n  }\n  else\n  {\n    this->m_buffer.erase(this->m_buffer.begin(), this->m_buffer.begin() + amount);\n  }\n\n  if (this->m_config.m_on_event)\n  {\n    this->m_config.m_on_event(this, ctext_event::CLEAR);\n  }\n\n  return this->render();\n}\n\nint8_t ctext::direct_scroll(size_t x, size_t y)\n{\n  if(this->m_config.m_bounding_box) \n  {\n    x = max(0, x);\n    y = max(0, y);\n    x = min(x, this->m_max_x);\n    y = min(y, this->m_max_y);\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_event::SCROLL);\n  }\n\n  return 0;\n}\n\nint8_t ctext::scroll_to(size_t x, size_t y)\n{\n  this->direct_scroll(x, y);\n  return this->render();\n}\n\nint8_t ctext::get_offset(size_t*x, size_t*y)\n{\n  *x = this->m_pos_x;\n  *y = this->m_pos_y;\n\n  return 0;\n}\n\nint8_t get_size(size_t*x, size_t*y)\n{\n  *x = this->m_max_x;\n  *y = this->m_max_y;\n\n  return 0;\n}\n\nint8_t ctext::up(size_t amount = 1) \n{\n  return this->down(-amount);\n}\n\nint8_t ctext::down(size_t amount = 1) \n{\n  return this->scroll_to(this->m_pos_x, this->m_pos_y + amount);\n}\n\nint8_t ctext::left(size_t amount = 1) \n{\n  return this->right(-amount);\n}\n\nint8_t ctext:right(size_t amount = 1) \n{\n  return this->scroll_to(this->m_pos_x + amount, this->m_pos_y);\n}\n\nint8_t ctext::printf(const char*format, ...) \n{\n  this->render();\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  \/\/ The actual scroll back, which is what\n  \/\/ people expect in this feature is the \n  \/\/ configured scrollback + the window height.\n  size_t actual_scroll_back = this->m_win_height + this->m_config.m_scrollback;\n\n  if(this->m_buffer.size() > actual_scroll_back)\n  {\n    this->m_buffer.erase(this->m_buffer.begin(), this->m_buffer().size() - actual_scroll_back);\n  }\n  \n  this->m_max_x = 0;  \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  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(this->m_max_x, (*it).size());\n    }\n  }\n \n  \/\/ this is practically free so we'll just do it.\n  this->m_max_y = this->m_buffer().size();\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  return this->direct_scroll(this->m_pos_x, this->m_pos_y);\n}\n\nint8_t ctext::printf(const char*format, ...)\n{\n  va_list args;\n  va_start(args, fmt);\n  vsprintf(really_large_buffer, args);\n  va_end(args);\n\n  this->m_buffer.push_back(really_large_buffer);\n\n  if (this->m_config.m_on_event)\n  {\n    this->m_config.m_on_event(this, ctext_event::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(this->m_buffer.size() - this->m_win_height, 0);\n  }\n\n  return this->render();\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  size_t start_char = max(0, this->m_pos_y);\n  size_t offset = start_char;\n  \/\/ the endchar will be in the substr\n  \n  \/\/ We start as m_pos_x in our list and move up to\n  \/\/ m_pos_x + 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  size_t line = 0;\n\n  \/\/ start at the beginning of the buffer.\n  size_t index = this->m_pos_x;\n  size_t directionality = +1;\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_x + this->m_win_height;\n  }\n\n  while(line < this->m_win_height)\n  {\n    \/\/ Reset the offset.\n    offset = start_char;\n\n    index += directionality;\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      wstring to_add = this->m_buffer[index].substr(start_char, this->m_win_width);\n      mvwaddwstr(this->m_win, line, 0, to_add);\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        start_char += this->m_win_width;\n\n        \/\/ substring into this character now at this advanced position\n        to_add = this->m_buffer[index].substr(start_char, this->m_win_width);\n        \n        \/\/ and add it to the screen\n        mvwaddwstr(this->m_win, line, 0, to_add);\n      }\n    }\n    line++;\n  }\n\n  wrefresh(this->m_win);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <config.h>\n#include <ostream>\n#include <sstream>\n#include <memory>\n#include <logger\/davix_logger_internal.h>\n#include <httprequest.hpp>\n#include <posix\/davposix.hpp>\n#include <posix\/davix_stat.hpp>\n#include <status\/davixstatusrequest.hpp>\n#include <fileops\/fileutils.hpp>\n\nstatic const std::string simple_listing(\"<propfind xmlns=\\\"DAV:\\\"><prop><\/prop><\/propfind>\");\n\nstatic const std::string stat_listing(\"<propfind xmlns=\\\"DAV:\\\"><prop><getlastmodified\/><creationdate\/><getcontentlength\/><resourcetype><collection\/><\/resourcetype><mode\/><\/prop><\/propfind>\");\n\n\nstruct Davix_dir_handle{\n\n    Davix_dir_handle(Davix::HttpRequest* _req, Davix::DavPropXMLParser * _parser):\n        request(_req),\n        parser(_parser),\n        dir_info((struct dirent*) calloc(1,sizeof(struct dirent) + NAME_MAX +1)),\n        dir_offset(0){\n\n    }\n\n   ~Davix_dir_handle(){\n        delete request;\n        delete parser;\n        free(dir_info);\n    }\n\n   Davix::HttpRequest* request;\n   Davix::DavPropXMLParser * parser;\n   struct dirent* dir_info;\n   off_t dir_offset;\n\nprivate:\n   Davix_dir_handle(const Davix_dir_handle & );\n   Davix_dir_handle & operator=(const Davix_dir_handle & );\n};\n\n\nnamespace Davix{\n\ntypedef Davix_dir_handle DIR_handle;\n\nstatic void fill_dirent_from_filestat(struct dirent * d, const FileProperties & f){\n    strlcpy(d->d_name, f.filename.c_str(), NAME_MAX);\n}\n\nint incremental_propfind_listdir_parsing(HttpRequest* req, DavPropXMLParser * parser, size_t s_buff, const char* scope, DavixError** err){\n  \/\/  std::cout << \"time 1 pre-fecth\" << time(NULL) << std::endl;\n    DavixError* tmp_err=NULL;\n\n    char buffer[s_buff+1];\n    const ssize_t ret_s_buff= req->readBlock(buffer, s_buff, &tmp_err);\n    if(ret_s_buff >= 0){\n        buffer[ret_s_buff]= '\\0';\n        DAVIX_DEBUG(\"chunk parse : result content : %s\", buffer);\n        if( parser->parseChuck(buffer, ret_s_buff) < 0){\n            DavixError::propagateError(err, parser->getLastErr());\n            return -1;\n        }\n    }\n\n    \/\/std::cout << \"time 3 post-parse\" << time(NULL) << std::endl;\n    if(tmp_err)\n        DavixError::propagateError(err, tmp_err);\n    return ret_s_buff;\n}\n\n\n\n\nvoid configure_req_for_listdir(HttpRequest* req){\n    req->addHeaderField(\"Depth\",\"1\");\n    req->setRequestMethod(\"PROPFIND\");\n}\n\nDAVIX_DIR* DavPosix::internal_opendirpp(const RequestParams* _params, const char * scope, const std::string & body, const std::string & url, DavixError** err ){\n    ssize_t s_resu;\n    DAVIX_DIR* r = NULL;\n    int ret =-1;\n    DavixError* tmp_err=NULL;\n    RequestParams params(_params);\n\n\n    \/\/ create a new connexion + parser for this opendir\n    HttpRequest* http_req = static_cast<HttpRequest*>(context->createRequest(url, &tmp_err));\n    if(http_req){\n        configure_req_for_listdir(http_req);\n        std::auto_ptr<DIR_handle> res(  new DIR_handle(http_req, new DavPropXMLParser()));\n        time_t timestamp_timeout = time(NULL) + _timeout;\n\n        http_req->setParameters(params);\n        DavPropXMLParser* parser = res->parser;\n        \/\/ setup the handle for simple listing only\n        http_req->setRequestBodyString(body);\n\n\n        if( (ret = http_req->beginRequest(&tmp_err)) == 0){ \/\/ start req\n\n\n            if( ( ret = davixRequestToFileStatus(http_req,davix_scope_directory_listing_str(), &tmp_err)) == 0){\n\n                    size_t prop_size = 0;\n                    do{ \/\/ parse the begining of the request until the first property -> directory property\n                       if( (s_resu = incremental_propfind_listdir_parsing(http_req, parser, this->_s_buff, scope, &tmp_err)) <0)\n                           break;\n\n                       prop_size = parser->getProperties().size();\n                       if(s_resu < _s_buff && prop_size <1){ \/\/ verify request status : if req done + no data -> error\n                           DavixError::setupError(&tmp_err, davix_scope_directory_listing_str(), StatusCode::WebDavPropertiesParsingError, \"request answer incorrect, not a valid webdav request\");\n                           break;\n                       }\n                       if(timestamp_timeout < time(NULL)){\n                           DavixError::setupError(&tmp_err, davix_scope_directory_listing_str(), StatusCode::OperationTimeout, \"operation timeout triggered while directory listing\");\n                           break;\n                       }\n\n                    }while( prop_size < 1); \/\/ leave is end of req & no data\n\n                    if(!tmp_err){\n                        if( S_ISDIR(parser->getProperties().at(0).mode) == false){\n                             DavixError::setupError(&tmp_err, davix_scope_directory_listing_str(), StatusCode::IsNotADirectory, url + \" is not a collection or a directory, impossible to list\");\n                        }else{\n                            parser->getProperties().pop_front(); \/\/ suppress the parent directory infos...\n                            r = res.release(); \/\/ success : take ownership of the pointer\n                        }\n                    }\n            }\n        }\n    }\n\n    if(tmp_err)\n        DavixError::propagateError(err, tmp_err);\n    return (DAVIX_DIR*) r;\n}\n\n\nDAVIX_DIR* DavPosix::opendir(const RequestParams* params, const std::string &url, DavixError** err){\n\n    DAVIX_DEBUG(\" -> davix_opendir\");\n    DAVIX_DIR* r = internal_opendirpp(params, \"Core::opendir\",simple_listing, url, err);\n\n    DAVIX_DEBUG(\" <- davix_opendir\");\n    return (DAVIX_DIR*) r;\n}\n\nDAVIX_DIR* DavPosix::opendirpp(const RequestParams* params, const std::string &url, DavixError** err){\n\n    DAVIX_DEBUG(\" -> davix_opendirpp\");\n    DAVIX_DIR* r = internal_opendirpp(params, \"Core::opendir\",stat_listing, url, err);\n\n    DAVIX_DEBUG(\" <- davix_opendirpp\");\n    return (DAVIX_DIR*) r;\n}\n\n\nstruct dirent* DavPosix::readdir(DAVIX_DIR * d, DavixError** err){\n    DIR_handle* handle = static_cast<DIR_handle*>(d);\n    DavixError* tmp_err=NULL;\n    DAVIX_DEBUG(\" -> davix_readdir\");\n\n    if( d==NULL){\n        DavixError::setupError(err, davix_scope_directory_listing_str(), StatusCode::InvalidFileHandle,  \"Invalid file descriptor for DAVIX_DIR*\");\n        return NULL;\n    }\n\n\n    HttpRequest *req = handle->request; \/\/ setup env again\n    DavPropXMLParser* parser = handle->parser;\n    off_t read_offset = handle->dir_offset+1;\n    size_t prop_size = parser->getProperties().size();\n    size_t s_resu = _s_buff;\n\n    while( prop_size == 0\n          && s_resu > 0){ \/\/ request not complete and current data too smalls\n        \/\/ continue the parsing until one more result\n       if( (s_resu = incremental_propfind_listdir_parsing(req, parser, this->_s_buff, \"Davix::readdir\", &tmp_err)) <0)\n           break;\n\n       prop_size = parser->getProperties().size();\n    }\n    if(!tmp_err){\n        if(prop_size == 0) \/\/ end of the request, end of the story\n            return NULL;\n        fill_dirent_from_filestat(handle->dir_info, parser->getProperties().front());\n        handle->dir_offset = read_offset;\n        parser->getProperties().pop_front(); \/\/ clean the current element\n        DAVIX_DEBUG(\" <- davix_readdir\");\n        return handle->dir_info;\n    }\n\n\n    if(tmp_err)\n        DavixError::propagateError(err, tmp_err);\n    return NULL;\n}\n\nstruct dirent* DavPosix::readdirpp(DAVIX_DIR * d, struct stat *st, DavixError** err){\n    DAVIX_DEBUG(\" -> davix_readdirpp\");\n\n    if( d==NULL){\n        DavixError::setupError(err, davix_scope_directory_listing_str(), StatusCode::InvalidFileHandle,  \"Invalid file descriptor for DAVIX_DIR*\");\n        return NULL;\n    }\n\n    DIR_handle* handle = static_cast<DIR_handle*>(d);\n    struct dirent* ret = NULL;\n    DavixError* tmp_err=NULL;\n\n    HttpRequest* req = handle->request; \/\/ setup env again\n    DavPropXMLParser* parser = handle->parser;\n    off_t read_offset = handle->dir_offset+1;\n    size_t prop_size = parser->getProperties().size();\n    size_t s_resu = _s_buff;\n\n    while( prop_size == 0\n          && s_resu > 0){ \/\/ request not complete and current data too smalls\n        \/\/ continue the parsing until one more result\n       if( (s_resu = incremental_propfind_listdir_parsing(req, parser, this->_s_buff, \"Davix::readdirpp\", &tmp_err)) <0)\n           break;\n\n       prop_size = parser->getProperties().size();\n    }\n\n    if(!tmp_err){\n        if(prop_size == 0){\n            ret= NULL; \/\/ end of the request, end of the story\n        }else{\n            fill_dirent_from_filestat(handle->dir_info, parser->getProperties().front());\n            handle->dir_offset = read_offset;\n            fill_stat_from_fileproperties(st, parser->getProperties().front());\n            parser->getProperties().pop_front(); \/\/ clean the current element\n            ret= handle->dir_info;\n        }\n        DAVIX_DEBUG(\" <- davix_readdirpp\");\n    }\n\n    if(tmp_err)\n        DavixError::propagateError(err, tmp_err);\n    return ret;\n}\n\n\nint DavPosix::closedirpp(DAVIX_DIR * d, DavixError** err){\n    int ret =-1;\n    if( d==NULL){\n        Davix::DavixError::setupError(err,davix_scope_directory_listing_str(),Davix::StatusCode::InvalidFileHandle, \"Invalid file descriptor for DAVIX_DIR*\");\n   }else{\n        delete (static_cast<DIR_handle*>(d));\n        ret =0;\n    }\n    return ret;\n}\n\nint DavPosix::closedir(DAVIX_DIR * d, DavixError** err){\n    return closedirpp(d,err);\n}\n\n} \/\/ namespace Davix\n\n\n\n\n\n\n\n\n\n\n\n\nDAVIX_C_DECL_BEGIN\n\nDAVIX_DIR* davix_posix_opendir(davix_sess_t sess, davix_params_t _params, const char* url,  davix_error_t* err){\n    davix_return_val_if_fail(sess != NULL, NULL);\n    DAVIX_DIR* ret = NULL;\n\n\n    Davix::DavPosix p((Davix::Context*)(sess));\n    Davix::RequestParams * params = (Davix::RequestParams*) (_params);\n    ret= p.opendir(params,url, (Davix::DavixError**) err);\n\n    return ret;\n}\n\n\n\nint davix_posix_closedir(davix_sess_t sess, DAVIX_DIR* d, davix_error_t* err){\n    davix_return_val_if_fail(sess != NULL,-1);\n\n    Davix::DavPosix p((Davix::Context*)(sess));\n\n\n    return p.closedir(d,(Davix::DavixError**) err);\n\n}\n\n\nstruct dirent* davix_posix_readdir(davix_sess_t sess, DAVIX_DIR* d, davix_error_t* err){\n    davix_return_val_if_fail(sess != NULL,NULL);\n\n    struct dirent* ret = NULL;\n    Davix::DavPosix p((Davix::Context*)(sess));\n\n    if(d){\n        ret= p.readdir(d, (Davix::DavixError**) err);\n    }\n\n    return ret;\n}\n\n\nDAVIX_C_DECL_END\n\n\n\n<commit_msg>- fix bad opendir request content<commit_after>#include <config.h>\n#include <ostream>\n#include <sstream>\n#include <memory>\n#include <logger\/davix_logger_internal.h>\n#include <httprequest.hpp>\n#include <posix\/davposix.hpp>\n#include <posix\/davix_stat.hpp>\n#include <status\/davixstatusrequest.hpp>\n#include <fileops\/fileutils.hpp>\n\nstatic const std::string simple_listing(\"<propfind xmlns=\\\"DAV:\\\"><prop><resourcetype><collection\/><\/resourcetype><\/prop><\/propfind>\");\n\nstatic const std::string stat_listing(\"<propfind xmlns=\\\"DAV:\\\"><prop><getlastmodified\/><creationdate\/><getcontentlength\/><resourcetype><collection\/><\/resourcetype><mode\/><\/prop><\/propfind>\");\n\n\nstruct Davix_dir_handle{\n\n    Davix_dir_handle(Davix::HttpRequest* _req, Davix::DavPropXMLParser * _parser):\n        request(_req),\n        parser(_parser),\n        dir_info((struct dirent*) calloc(1,sizeof(struct dirent) + NAME_MAX +1)),\n        dir_offset(0){\n\n    }\n\n   ~Davix_dir_handle(){\n        delete request;\n        delete parser;\n        free(dir_info);\n    }\n\n   Davix::HttpRequest* request;\n   Davix::DavPropXMLParser * parser;\n   struct dirent* dir_info;\n   off_t dir_offset;\n\nprivate:\n   Davix_dir_handle(const Davix_dir_handle & );\n   Davix_dir_handle & operator=(const Davix_dir_handle & );\n};\n\n\nnamespace Davix{\n\ntypedef Davix_dir_handle DIR_handle;\n\nstatic void fill_dirent_from_filestat(struct dirent * d, const FileProperties & f){\n    strlcpy(d->d_name, f.filename.c_str(), NAME_MAX);\n}\n\nint incremental_propfind_listdir_parsing(HttpRequest* req, DavPropXMLParser * parser, size_t s_buff, const char* scope, DavixError** err){\n  \/\/  std::cout << \"time 1 pre-fecth\" << time(NULL) << std::endl;\n    DavixError* tmp_err=NULL;\n\n    char buffer[s_buff+1];\n    const ssize_t ret_s_buff= req->readBlock(buffer, s_buff, &tmp_err);\n    if(ret_s_buff >= 0){\n        buffer[ret_s_buff]= '\\0';\n        DAVIX_DEBUG(\"chunk parse : result content : %s\", buffer);\n        if( parser->parseChuck(buffer, ret_s_buff) < 0){\n            DavixError::propagateError(err, parser->getLastErr());\n            return -1;\n        }\n    }\n\n    \/\/std::cout << \"time 3 post-parse\" << time(NULL) << std::endl;\n    if(tmp_err)\n        DavixError::propagateError(err, tmp_err);\n    return ret_s_buff;\n}\n\n\n\n\nvoid configure_req_for_listdir(HttpRequest* req){\n    req->addHeaderField(\"Depth\",\"1\");\n    req->setRequestMethod(\"PROPFIND\");\n}\n\nDAVIX_DIR* DavPosix::internal_opendirpp(const RequestParams* _params, const char * scope, const std::string & body, const std::string & url, DavixError** err ){\n    ssize_t s_resu;\n    DAVIX_DIR* r = NULL;\n    int ret =-1;\n    DavixError* tmp_err=NULL;\n    RequestParams params(_params);\n\n\n    \/\/ create a new connexion + parser for this opendir\n    HttpRequest* http_req = static_cast<HttpRequest*>(context->createRequest(url, &tmp_err));\n    if(http_req){\n        configure_req_for_listdir(http_req);\n        std::auto_ptr<DIR_handle> res(  new DIR_handle(http_req, new DavPropXMLParser()));\n        time_t timestamp_timeout = time(NULL) + _timeout;\n\n        http_req->setParameters(params);\n        DavPropXMLParser* parser = res->parser;\n        \/\/ setup the handle for simple listing only\n        http_req->setRequestBodyString(body);\n\n\n        if( (ret = http_req->beginRequest(&tmp_err)) == 0){ \/\/ start req\n\n\n            if( ( ret = davixRequestToFileStatus(http_req,davix_scope_directory_listing_str(), &tmp_err)) == 0){\n\n                    size_t prop_size = 0;\n                    do{ \/\/ parse the begining of the request until the first property -> directory property\n                       if( (s_resu = incremental_propfind_listdir_parsing(http_req, parser, this->_s_buff, scope, &tmp_err)) <0)\n                           break;\n\n                       prop_size = parser->getProperties().size();\n                       if(s_resu < _s_buff && prop_size <1){ \/\/ verify request status : if req done + no data -> error\n                           DavixError::setupError(&tmp_err, davix_scope_directory_listing_str(), StatusCode::WebDavPropertiesParsingError, \"request answer incorrect, not a valid webdav request\");\n                           break;\n                       }\n                       if(timestamp_timeout < time(NULL)){\n                           DavixError::setupError(&tmp_err, davix_scope_directory_listing_str(), StatusCode::OperationTimeout, \"operation timeout triggered while directory listing\");\n                           break;\n                       }\n\n                    }while( prop_size < 1); \/\/ leave is end of req & no data\n\n                    if(!tmp_err){\n                        if( S_ISDIR(parser->getProperties().at(0).mode) == false){\n                             DavixError::setupError(&tmp_err, davix_scope_directory_listing_str(), StatusCode::IsNotADirectory, url + \" is not a collection or a directory, impossible to list\");\n                        }else{\n                            parser->getProperties().pop_front(); \/\/ suppress the parent directory infos...\n                            r = res.release(); \/\/ success : take ownership of the pointer\n                        }\n                    }\n            }\n        }\n    }\n\n    if(tmp_err)\n        DavixError::propagateError(err, tmp_err);\n    return (DAVIX_DIR*) r;\n}\n\n\nDAVIX_DIR* DavPosix::opendir(const RequestParams* params, const std::string &url, DavixError** err){\n\n    DAVIX_DEBUG(\" -> davix_opendir\");\n    DAVIX_DIR* r = internal_opendirpp(params, \"Core::opendir\",simple_listing, url, err);\n\n    DAVIX_DEBUG(\" <- davix_opendir\");\n    return (DAVIX_DIR*) r;\n}\n\nDAVIX_DIR* DavPosix::opendirpp(const RequestParams* params, const std::string &url, DavixError** err){\n\n    DAVIX_DEBUG(\" -> davix_opendirpp\");\n    DAVIX_DIR* r = internal_opendirpp(params, \"Core::opendir\",stat_listing, url, err);\n\n    DAVIX_DEBUG(\" <- davix_opendirpp\");\n    return (DAVIX_DIR*) r;\n}\n\n\nstruct dirent* DavPosix::readdir(DAVIX_DIR * d, DavixError** err){\n    DIR_handle* handle = static_cast<DIR_handle*>(d);\n    DavixError* tmp_err=NULL;\n    DAVIX_DEBUG(\" -> davix_readdir\");\n\n    if( d==NULL){\n        DavixError::setupError(err, davix_scope_directory_listing_str(), StatusCode::InvalidFileHandle,  \"Invalid file descriptor for DAVIX_DIR*\");\n        return NULL;\n    }\n\n\n    HttpRequest *req = handle->request; \/\/ setup env again\n    DavPropXMLParser* parser = handle->parser;\n    off_t read_offset = handle->dir_offset+1;\n    size_t prop_size = parser->getProperties().size();\n    size_t s_resu = _s_buff;\n\n    while( prop_size == 0\n          && s_resu > 0){ \/\/ request not complete and current data too smalls\n        \/\/ continue the parsing until one more result\n       if( (s_resu = incremental_propfind_listdir_parsing(req, parser, this->_s_buff, \"Davix::readdir\", &tmp_err)) <0)\n           break;\n\n       prop_size = parser->getProperties().size();\n    }\n    if(!tmp_err){\n        if(prop_size == 0) \/\/ end of the request, end of the story\n            return NULL;\n        fill_dirent_from_filestat(handle->dir_info, parser->getProperties().front());\n        handle->dir_offset = read_offset;\n        parser->getProperties().pop_front(); \/\/ clean the current element\n        DAVIX_DEBUG(\" <- davix_readdir\");\n        return handle->dir_info;\n    }\n\n\n    if(tmp_err)\n        DavixError::propagateError(err, tmp_err);\n    return NULL;\n}\n\nstruct dirent* DavPosix::readdirpp(DAVIX_DIR * d, struct stat *st, DavixError** err){\n    DAVIX_DEBUG(\" -> davix_readdirpp\");\n\n    if( d==NULL){\n        DavixError::setupError(err, davix_scope_directory_listing_str(), StatusCode::InvalidFileHandle,  \"Invalid file descriptor for DAVIX_DIR*\");\n        return NULL;\n    }\n\n    DIR_handle* handle = static_cast<DIR_handle*>(d);\n    struct dirent* ret = NULL;\n    DavixError* tmp_err=NULL;\n\n    HttpRequest* req = handle->request; \/\/ setup env again\n    DavPropXMLParser* parser = handle->parser;\n    off_t read_offset = handle->dir_offset+1;\n    size_t prop_size = parser->getProperties().size();\n    size_t s_resu = _s_buff;\n\n    while( prop_size == 0\n          && s_resu > 0){ \/\/ request not complete and current data too smalls\n        \/\/ continue the parsing until one more result\n       if( (s_resu = incremental_propfind_listdir_parsing(req, parser, this->_s_buff, \"Davix::readdirpp\", &tmp_err)) <0)\n           break;\n\n       prop_size = parser->getProperties().size();\n    }\n\n    if(!tmp_err){\n        if(prop_size == 0){\n            ret= NULL; \/\/ end of the request, end of the story\n        }else{\n            fill_dirent_from_filestat(handle->dir_info, parser->getProperties().front());\n            handle->dir_offset = read_offset;\n            fill_stat_from_fileproperties(st, parser->getProperties().front());\n            parser->getProperties().pop_front(); \/\/ clean the current element\n            ret= handle->dir_info;\n        }\n        DAVIX_DEBUG(\" <- davix_readdirpp\");\n    }\n\n    if(tmp_err)\n        DavixError::propagateError(err, tmp_err);\n    return ret;\n}\n\n\nint DavPosix::closedirpp(DAVIX_DIR * d, DavixError** err){\n    int ret =-1;\n    if( d==NULL){\n        Davix::DavixError::setupError(err,davix_scope_directory_listing_str(),Davix::StatusCode::InvalidFileHandle, \"Invalid file descriptor for DAVIX_DIR*\");\n   }else{\n        delete (static_cast<DIR_handle*>(d));\n        ret =0;\n    }\n    return ret;\n}\n\nint DavPosix::closedir(DAVIX_DIR * d, DavixError** err){\n    return closedirpp(d,err);\n}\n\n} \/\/ namespace Davix\n\n\n\n\n\n\n\n\n\n\n\n\nDAVIX_C_DECL_BEGIN\n\nDAVIX_DIR* davix_posix_opendir(davix_sess_t sess, davix_params_t _params, const char* url,  davix_error_t* err){\n    davix_return_val_if_fail(sess != NULL, NULL);\n    DAVIX_DIR* ret = NULL;\n\n\n    Davix::DavPosix p((Davix::Context*)(sess));\n    Davix::RequestParams * params = (Davix::RequestParams*) (_params);\n    ret= p.opendir(params,url, (Davix::DavixError**) err);\n\n    return ret;\n}\n\n\n\nint davix_posix_closedir(davix_sess_t sess, DAVIX_DIR* d, davix_error_t* err){\n    davix_return_val_if_fail(sess != NULL,-1);\n\n    Davix::DavPosix p((Davix::Context*)(sess));\n\n\n    return p.closedir(d,(Davix::DavixError**) err);\n\n}\n\n\nstruct dirent* davix_posix_readdir(davix_sess_t sess, DAVIX_DIR* d, davix_error_t* err){\n    davix_return_val_if_fail(sess != NULL,NULL);\n\n    struct dirent* ret = NULL;\n    Davix::DavPosix p((Davix::Context*)(sess));\n\n    if(d){\n        ret= p.readdir(d, (Davix::DavixError**) err);\n    }\n\n    return ret;\n}\n\n\nDAVIX_C_DECL_END\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file  nthPrime.cpp\n\/\/\/\n\/\/\/ Copyright (C) 2017 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 <primesieve\/config.hpp>\n#include <primesieve\/PrimeSieve.hpp>\n#include <primesieve\/pmath.hpp>\n#include <primesieve.hpp>\n\n#include <stdint.h>\n#include <algorithm>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n\nusing namespace std;\nusing namespace primesieve;\n\nnamespace {\n\nvoid checkLimit(uint64_t start)\n{\n  if (start >= get_max_stop())\n    throw primesieve_error(\"nth prime > 2^64\");\n}\n\nvoid checkLowerLimit(uint64_t stop)\n{\n  if (stop == 0)\n    throw primesieve_error(\"nth prime < 2 is impossible, n is too small\");\n}\n\nbool sieveBackwards(int64_t n, int64_t count, uint64_t stop)\n{\n  return (count >= n) &&\n        !(count == n && stop < 2);\n}\n\n\/\/ Prime count approximation\nint64_t pix(int64_t n)\n{\n  double x = (double) n;\n  double logx = log(max(4.0, x));\n  double pix = x \/ logx;\n  return (int64_t) pix;\n}\n\nuint64_t nthPrimeDist(int64_t n, int64_t count, uint64_t start)\n{\n  double x = (double) (n - count);\n\n  x = abs(x);\n  x = max(x, 4.0);\n\n  \/\/ rough pi(x) approximation\n  double logx = log(x);\n  double loglogx = log(logx);\n  double pix = x * (logx + loglogx - 1);\n\n  \/\/ correct start if sieving backwards to get\n  \/\/ a more accurate approximation\n  if (count >= n)\n    start -= (uint64_t) pix;\n\n  \/\/ approximate the nth prime using:\n  \/\/ start + n * log(start + pi(n) \/ loglog(n))\n  double startPix = start + pix \/ loglogx;\n  startPix = max(4.0, startPix);\n  double logStartPix = log(startPix);\n  double dist = max(pix, x * logStartPix);\n\n  \/\/ ensure start + dist <= nth prime\n  if (count < n)\n    dist -= sqrt(dist) * log(logStartPix) * 2;\n  \/\/ ensure start + dist >= nth prime\n  if (count > n)\n    dist += sqrt(dist) * log(logStartPix) * 2;\n\n  \/\/ if n is very small:\n  \/\/ ensure (start + dist) >= nth prime\n  double maxPrimeGap = logStartPix * logStartPix;\n  dist = max(dist, maxPrimeGap);\n\n  return (uint64_t) dist;\n}\n\n} \/\/ namespace\n\nnamespace primesieve {\n\nuint64_t PrimeSieve::nthPrime(uint64_t n)\n{\n  return nthPrime(0, n);\n}\n\nuint64_t PrimeSieve::nthPrime(int64_t n, uint64_t start)\n{\n  setStart(start);\n  auto t1 = chrono::system_clock::now();\n\n  if (n == 0)\n    n = 1; \/\/ like Mathematica\n  else if (n > 0)\n    start = checkedAdd(start, 1);\n  else if (n < 0)\n    start = checkedSub(start, 1);\n\n  uint64_t stop = start;\n  uint64_t dist = nthPrimeDist(n, 0, start);\n  uint64_t nthPrimeGuess = checkedAdd(start, dist);\n\n  int64_t count = 0;\n  int64_t tinyN = 100000;\n  tinyN = max(tinyN, pix(isqrt(nthPrimeGuess)));\n\n  while ((n - count) > tinyN ||\n         sieveBackwards(n, count, stop))\n  {\n    if (count < n)\n    {\n      checkLimit(start);\n      dist = nthPrimeDist(n, count, start);\n      stop = checkedAdd(start, dist);\n      count += countPrimes(start, stop);\n      start = checkedAdd(stop, 1);\n    }\n    if (sieveBackwards(n, count, stop))\n    {\n      checkLowerLimit(stop);\n      dist = nthPrimeDist(n, count, stop);\n      start = checkedSub(start, dist);\n      count -= countPrimes(start, stop);\n      stop = checkedSub(start, 1);\n    }\n  }\n\n  if (n < 0)\n    count -= 1;\n\n  \/\/ here start < nth prime,\n  \/\/ hence we can sieve forward the remaining\n  \/\/ distance and find the nth prime\n  assert(count < n);\n\n  try\n  {\n    checkLimit(start);\n    dist = nthPrimeDist(n, count, start) * 2;\n    start = checkedSub(start, 1);\n    stop = checkedAdd(start, dist);\n    uint64_t prime = 0;\n    for (primesieve::iterator it(start, stop); count < n; count++)\n      prime = it.next_prime();\n\n    auto t2 = chrono::system_clock::now();\n    chrono::duration<double> seconds = t2 - t1;\n    seconds_ = seconds.count();\n\n    return prime;\n  }\n  catch (primesieve_error&) { }\n\n  throw primesieve_error(\"nth prime > 2^64\");\n}\n\n} \/\/ namespace\n<commit_msg>Fix undefined-behavior<commit_after>\/\/\/\n\/\/\/ @file  nthPrime.cpp\n\/\/\/\n\/\/\/ Copyright (C) 2017 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 <primesieve\/config.hpp>\n#include <primesieve\/PrimeSieve.hpp>\n#include <primesieve\/pmath.hpp>\n#include <primesieve.hpp>\n\n#include <stdint.h>\n#include <algorithm>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n\nusing namespace std;\nusing namespace primesieve;\n\nnamespace {\n\nvoid checkLimit(uint64_t start)\n{\n  if (start >= get_max_stop())\n    throw primesieve_error(\"nth prime > 2^64\");\n}\n\nvoid checkLowerLimit(uint64_t stop)\n{\n  if (stop == 0)\n    throw primesieve_error(\"nth prime < 2 is impossible, n is too small\");\n}\n\nbool sieveBackwards(int64_t n, int64_t count, uint64_t stop)\n{\n  return (count >= n) &&\n        !(count == n && stop < 2);\n}\n\n\/\/ Prime count approximation\nint64_t pix(int64_t n)\n{\n  double x = (double) n;\n  double logx = log(max(4.0, x));\n  double pix = x \/ logx;\n  return (int64_t) pix;\n}\n\nuint64_t nthPrimeDist(int64_t n, int64_t count, uint64_t start)\n{\n  double x = (double) (n - count);\n\n  x = abs(x);\n  x = max(x, 4.0);\n\n  \/\/ rough pi(x) approximation\n  double logx = log(x);\n  double loglogx = log(logx);\n  double pix = x * (logx + loglogx - 1);\n\n  \/\/ correct start if sieving backwards to get\n  \/\/ a more accurate approximation\n  if (count >= n)\n    start -= (uint64_t) pix;\n\n  \/\/ approximate the nth prime using:\n  \/\/ start + n * log(start + pi(n) \/ loglog(n))\n  double startPix = start + pix \/ loglogx;\n  startPix = max(4.0, startPix);\n  double logStartPix = log(startPix);\n  double dist = max(pix, x * logStartPix);\n\n  \/\/ ensure start + dist <= nth prime\n  if (count < n)\n    dist -= sqrt(dist) * log(logStartPix) * 2;\n  \/\/ ensure start + dist >= nth prime\n  if (count > n)\n    dist += sqrt(dist) * log(logStartPix) * 2;\n\n  \/\/ if n is very small:\n  \/\/ ensure (start + dist) >= nth prime\n  double maxPrimeGap = logStartPix * logStartPix;\n  dist = max(dist, maxPrimeGap);\n\n  return (uint64_t) dist;\n}\n\n} \/\/ namespace\n\nnamespace primesieve {\n\nuint64_t PrimeSieve::nthPrime(uint64_t n)\n{\n  return nthPrime(0, n);\n}\n\nuint64_t PrimeSieve::nthPrime(int64_t n, uint64_t start)\n{\n  setStart(start);\n  auto t1 = chrono::system_clock::now();\n\n  if (n == 0)\n    n = 1; \/\/ like Mathematica\n  else if (n > 0)\n    start = checkedAdd(start, 1);\n  else if (n < 0)\n    start = checkedSub(start, 1);\n\n  uint64_t stop = start;\n  uint64_t dist = nthPrimeDist(n, 0, start);\n  uint64_t nthPrimeGuess = checkedAdd(start, dist);\n\n  int64_t count = 0;\n  int64_t tinyN = 100000;\n  tinyN = max(tinyN, pix(isqrt(nthPrimeGuess)));\n\n  while ((n - count) > tinyN ||\n         sieveBackwards(n, count, stop))\n  {\n    if (count < n)\n    {\n      checkLimit(start);\n      dist = nthPrimeDist(n, count, start);\n      stop = checkedAdd(start, dist);\n      count += countPrimes(start, stop);\n      start = checkedAdd(stop, 1);\n    }\n    if (sieveBackwards(n, count, stop))\n    {\n      checkLowerLimit(stop);\n      dist = nthPrimeDist(n, count, stop);\n      start = checkedSub(start, dist);\n      count -= (int64_t) countPrimes(start, stop);\n      stop = checkedSub(start, 1);\n    }\n  }\n\n  if (n < 0)\n    count -= 1;\n\n  \/\/ here start < nth prime,\n  \/\/ hence we can sieve forward the remaining\n  \/\/ distance and find the nth prime\n  assert(count < n);\n\n  try\n  {\n    checkLimit(start);\n    dist = nthPrimeDist(n, count, start) * 2;\n    start = checkedSub(start, 1);\n    stop = checkedAdd(start, dist);\n    uint64_t prime = 0;\n    for (primesieve::iterator it(start, stop); count < n; count++)\n      prime = it.next_prime();\n\n    auto t2 = chrono::system_clock::now();\n    chrono::duration<double> seconds = t2 - t1;\n    seconds_ = seconds.count();\n\n    return prime;\n  }\n  catch (primesieve_error&) { }\n\n  throw primesieve_error(\"nth prime > 2^64\");\n}\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/   Copyright (c) 2018 PaddlePaddle 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 \"paddle\/fluid\/framework\/details\/broadcast_op_handle.h\"\n#include \"paddle\/fluid\/framework\/details\/container_cast.h\"\n#include \"paddle\/fluid\/framework\/details\/variable_visitor.h\"\n#include \"paddle\/fluid\/platform\/profiler.h\"\n\nnamespace paddle {\nnamespace framework {\nnamespace details {\n\nvoid BroadcastOpHandle::RunImpl() {\n  platform::RecordEvent record_event(Name(), dev_ctxes_.begin()->second);\n\n  if (places_.size() == 1) return;\n\n  \/\/ The input and output may have dummy vars.\n  VarHandle *in_var_handle;\n  {\n    auto in_var_handles = DynamicCast<VarHandle>(inputs_);\n    PADDLE_ENFORCE_EQ(in_var_handles.size(), 1,\n                      \"The number of input should be one.\");\n    in_var_handle = in_var_handles[0];\n  }\n\n  auto out_var_handles = DynamicCast<VarHandle>(outputs_);\n\n  PADDLE_ENFORCE_EQ(\n      out_var_handles.size(), places_.size(),\n      \"The number of output should equal to the number of places.\");\n\n  WaitInputVarGenerated();\n\n  std::vector<const Scope *> var_scopes;\n  for (auto *s : local_scopes_) {\n    var_scopes.emplace_back(s->FindVar(kLocalExecScopeName)->Get<Scope *>());\n  }\n\n  BroadcastOneVar(*in_var_handle, out_var_handles, var_scopes);\n}\n\nvoid BroadcastOpHandle::BroadcastOneVar(\n    const VarHandle &in_var_handle,\n    const std::vector<VarHandle *> &out_var_handles,\n    const std::vector<const Scope *> &var_scopes) {\n  auto *in_var =\n      var_scopes.at(in_var_handle.scope_idx_)->FindVar(in_var_handle.name_);\n  PADDLE_ENFORCE_NOT_NULL(in_var);\n  Tensor &in_tensor = VariableVisitor::GetMutableTensor(in_var);\n  if (!in_tensor.IsInitialized()) {\n    VLOG(3) << \"in var \" << in_var_handle->name_ << \"not inited, return!\";\n    return;\n  }\n\n  InitOutputValue(in_var_handle, out_var_handles);\n\n  if (platform::is_cpu_place(in_tensor.place())) {\n    for (auto *out_var_handle : out_var_handles) {\n      if (out_var_handle->IsTheSameVar(in_var_handle)) {\n        continue;\n      }\n      auto &out_p = out_var_handle->place_;\n      auto *out_var = var_scopes.at(out_var_handle->scope_idx_)\n                          ->FindVar(out_var_handle->name_);\n\n      RunAndRecordEvent(out_p, [in_tensor, out_var] {\n        paddle::framework::TensorCopy(\n            in_tensor, platform::CPUPlace(),\n            &VariableVisitor::GetMutableTensor(out_var));\n      });\n    }\n  } else {\n#ifdef PADDLE_WITH_CUDA\n    VarHandle *out_handle = nullptr;\n    int root_id = boost::get<platform::CUDAPlace>(in_tensor.place()).device;\n    std::vector<std::function<void()>> broadcast_calls;\n\n    int type = platform::ToNCCLDataType(in_tensor.type());\n    size_t numel = static_cast<size_t>(in_tensor.numel());\n\n    for (auto out_var_handle : out_var_handles) {\n      Variable *out_var = var_scopes.at(out_var_handle->scope_idx_)\n                              ->FindVar(out_var_handle->name_);\n\n      int dst_id =\n          boost::get<platform::CUDAPlace>(out_var_handle->place_).device;\n\n      auto &nccl_ctx = nccl_ctxs_->at(dst_id);\n\n      void *send_recv_buffer = nullptr;\n      if (root_id == dst_id) {\n        send_recv_buffer = const_cast<void *>(in_tensor.data<void>());\n        out_handle = out_var_handle;\n      } else {\n        send_recv_buffer = VariableVisitor::GetMutableTensor(out_var)\n                               .Resize(in_tensor.dims())\n                               .mutable_data(out_var_handle->place_);\n      }\n\n      broadcast_calls.emplace_back(\n          [send_recv_buffer, numel, type, root_id, &nccl_ctx] {\n            PADDLE_ENFORCE(platform::dynload::ncclBcast(\n                send_recv_buffer, numel, static_cast<ncclDataType_t>(type),\n                root_id, nccl_ctx.comm_, nccl_ctx.stream()));\n          });\n    }\n\n    this->RunAndRecordEvent([&] {\n      {\n        platform::NCCLGroupGuard guard;\n        for (auto &call : broadcast_calls) {\n          call();\n        }\n      }\n\n      if (!out_handle->IsTheSameVar(in_var_handle)) {\n        auto out_var = var_scopes.at(in_var_handle.scope_idx_)\n                           ->FindVar(out_var_handles[0]->name_);\n        paddle::framework::TensorCopy(\n            in_tensor, in_var_handle.place_,\n            *(dev_ctxes_.at(in_var_handle.place_)),\n            &VariableVisitor::GetMutableTensor(out_var));\n      }\n    });\n#else\n    PADDLE_THROW(\"CUDA is not enabled.\");\n#endif\n  }\n}\n\nvoid BroadcastOpHandle::InitOutputValue(\n    const VarHandle &in_var_handle,\n    const std::vector<VarHandle *> &out_var_handles) const {\n  std::vector<const Scope *> var_scopes;\n  for (auto *s : local_scopes_) {\n    var_scopes.emplace_back(s->FindVar(kLocalExecScopeName)->Get<Scope *>());\n  }\n  auto *in_var =\n      var_scopes.at(in_var_handle.scope_idx_)->FindVar(in_var_handle.name_);\n\n  Tensor &in_tensor = VariableVisitor::GetMutableTensor(in_var);\n\n  \/\/ NOTE: The tensors' Place of input and output must be all on GPU or all on\n  \/\/ CPU.\n  for (auto *out_var_handle : out_var_handles) {\n    if (out_var_handle->IsTheSameVar(in_var_handle)) {\n      continue;\n    }\n    auto t_out_p = out_var_handle->place_;\n    auto *out_var = var_scopes.at(out_var_handle->scope_idx_)\n                        ->FindVar(out_var_handle->name_);\n    PADDLE_ENFORCE_NOT_NULL(out_var);\n    if (is_gpu_place(in_tensor.place())) {\n      PADDLE_ENFORCE(platform::is_gpu_place(t_out_p),\n                     \"Places of input and output must be all on GPU.\");\n    } else {\n      t_out_p = platform::CPUPlace();\n    }\n    VariableVisitor::ShareDimsAndLoD(*in_var, out_var);\n    VariableVisitor::GetMutableTensor(out_var).mutable_data(t_out_p,\n                                                            in_tensor.type());\n  }\n}\n\nstd::string BroadcastOpHandle::Name() const { return \"broadcast\"; }\n}  \/\/ namespace details\n}  \/\/ namespace framework\n}  \/\/ namespace paddle\n<commit_msg>fix compile, optimize code test=develop<commit_after>\/\/   Copyright (c) 2018 PaddlePaddle 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 \"paddle\/fluid\/framework\/details\/broadcast_op_handle.h\"\n#include \"paddle\/fluid\/framework\/details\/container_cast.h\"\n#include \"paddle\/fluid\/framework\/details\/variable_visitor.h\"\n#include \"paddle\/fluid\/platform\/profiler.h\"\n\nnamespace paddle {\nnamespace framework {\nnamespace details {\n\nvoid BroadcastOpHandle::RunImpl() {\n  platform::RecordEvent record_event(Name(), dev_ctxes_.begin()->second);\n\n  if (places_.size() == 1) return;\n\n  \/\/ The input and output may have dummy vars.\n  VarHandle *in_var_handle;\n  {\n    auto in_var_handles = DynamicCast<VarHandle>(inputs_);\n    PADDLE_ENFORCE_EQ(in_var_handles.size(), 1,\n                      \"The number of input should be one.\");\n    in_var_handle = in_var_handles[0];\n  }\n\n  auto out_var_handles = DynamicCast<VarHandle>(outputs_);\n\n  PADDLE_ENFORCE_EQ(\n      out_var_handles.size(), places_.size(),\n      \"The number of output should equal to the number of places.\");\n\n  WaitInputVarGenerated();\n\n  std::vector<const Scope *> var_scopes;\n  for (auto *s : local_scopes_) {\n    var_scopes.emplace_back(s->FindVar(kLocalExecScopeName)->Get<Scope *>());\n  }\n\n  BroadcastOneVar(*in_var_handle, out_var_handles, var_scopes);\n}\n\nvoid BroadcastOpHandle::BroadcastOneVar(\n    const VarHandle &in_var_handle,\n    const std::vector<VarHandle *> &out_var_handles,\n    const std::vector<const Scope *> &var_scopes) {\n  auto *in_var =\n      var_scopes.at(in_var_handle.scope_idx_)->FindVar(in_var_handle.name_);\n  PADDLE_ENFORCE_NOT_NULL(in_var);\n  Tensor &in_tensor = VariableVisitor::GetMutableTensor(in_var);\n  if (UNLIKELY(!in_tensor.IsInitialized())) {\n    VLOG(3) << \"in var \" << in_var_handle.name_ << \"not inited, return!\";\n    return;\n  }\n\n  InitOutputValue(in_var_handle, out_var_handles);\n\n  if (platform::is_cpu_place(in_tensor.place())) {\n    for (auto *out_var_handle : out_var_handles) {\n      if (out_var_handle->IsTheSameVar(in_var_handle)) {\n        continue;\n      }\n      auto &out_p = out_var_handle->place_;\n      auto *out_var = var_scopes.at(out_var_handle->scope_idx_)\n                          ->FindVar(out_var_handle->name_);\n\n      RunAndRecordEvent(out_p, [in_tensor, out_var] {\n        paddle::framework::TensorCopy(\n            in_tensor, platform::CPUPlace(),\n            &VariableVisitor::GetMutableTensor(out_var));\n      });\n    }\n  } else {\n#ifdef PADDLE_WITH_CUDA\n    VarHandle *out_handle = nullptr;\n    int root_id = boost::get<platform::CUDAPlace>(in_tensor.place()).device;\n    std::vector<std::function<void()>> broadcast_calls;\n\n    int type = platform::ToNCCLDataType(in_tensor.type());\n    size_t numel = static_cast<size_t>(in_tensor.numel());\n\n    for (auto out_var_handle : out_var_handles) {\n      Variable *out_var = var_scopes.at(out_var_handle->scope_idx_)\n                              ->FindVar(out_var_handle->name_);\n\n      int dst_id =\n          boost::get<platform::CUDAPlace>(out_var_handle->place_).device;\n\n      auto &nccl_ctx = nccl_ctxs_->at(dst_id);\n\n      void *send_recv_buffer = nullptr;\n      if (root_id == dst_id) {\n        send_recv_buffer = const_cast<void *>(in_tensor.data<void>());\n        out_handle = out_var_handle;\n      } else {\n        send_recv_buffer = VariableVisitor::GetMutableTensor(out_var)\n                               .Resize(in_tensor.dims())\n                               .mutable_data(out_var_handle->place_);\n      }\n\n      broadcast_calls.emplace_back(\n          [send_recv_buffer, numel, type, root_id, &nccl_ctx] {\n            PADDLE_ENFORCE(platform::dynload::ncclBcast(\n                send_recv_buffer, numel, static_cast<ncclDataType_t>(type),\n                root_id, nccl_ctx.comm_, nccl_ctx.stream()));\n          });\n    }\n\n    this->RunAndRecordEvent([&] {\n      {\n        platform::NCCLGroupGuard guard;\n        for (auto &call : broadcast_calls) {\n          call();\n        }\n      }\n\n      if (!out_handle->IsTheSameVar(in_var_handle)) {\n        auto out_var = var_scopes.at(in_var_handle.scope_idx_)\n                           ->FindVar(out_var_handles[0]->name_);\n        paddle::framework::TensorCopy(\n            in_tensor, in_var_handle.place_,\n            *(dev_ctxes_.at(in_var_handle.place_)),\n            &VariableVisitor::GetMutableTensor(out_var));\n      }\n    });\n#else\n    PADDLE_THROW(\"CUDA is not enabled.\");\n#endif\n  }\n}\n\nvoid BroadcastOpHandle::InitOutputValue(\n    const VarHandle &in_var_handle,\n    const std::vector<VarHandle *> &out_var_handles) const {\n  std::vector<const Scope *> var_scopes;\n  for (auto *s : local_scopes_) {\n    var_scopes.emplace_back(s->FindVar(kLocalExecScopeName)->Get<Scope *>());\n  }\n  auto *in_var =\n      var_scopes.at(in_var_handle.scope_idx_)->FindVar(in_var_handle.name_);\n\n  Tensor &in_tensor = VariableVisitor::GetMutableTensor(in_var);\n\n  \/\/ NOTE: The tensors' Place of input and output must be all on GPU or all on\n  \/\/ CPU.\n  for (auto *out_var_handle : out_var_handles) {\n    if (out_var_handle->IsTheSameVar(in_var_handle)) {\n      continue;\n    }\n    auto t_out_p = out_var_handle->place_;\n    auto *out_var = var_scopes.at(out_var_handle->scope_idx_)\n                        ->FindVar(out_var_handle->name_);\n    PADDLE_ENFORCE_NOT_NULL(out_var);\n    if (is_gpu_place(in_tensor.place())) {\n      PADDLE_ENFORCE(platform::is_gpu_place(t_out_p),\n                     \"Places of input and output must be all on GPU.\");\n    } else {\n      t_out_p = platform::CPUPlace();\n    }\n    VariableVisitor::ShareDimsAndLoD(*in_var, out_var);\n    VariableVisitor::GetMutableTensor(out_var).mutable_data(t_out_p,\n                                                            in_tensor.type());\n  }\n}\n\nstd::string BroadcastOpHandle::Name() const { return \"broadcast\"; }\n}  \/\/ namespace details\n}  \/\/ namespace framework\n}  \/\/ namespace paddle\n<|endoftext|>"}
{"text":"<commit_before>#include \"naoqi_planner.h\"\n\n\n\nnamespace naoqi_planner {\n  using namespace naoqi_sensor_utils;\n  \n  NAOqiPlanner::NAOqiPlanner(qi::SessionPtr session){\n    _session = session;\n    if (! _session)\n      throw std::runtime_error(\"Error: No memory service provided\");\n\n    _use_gui = false;\n    _what_to_show = Map;\n\n    _restart = true;\n\n    _have_goal = false;\n    _goal = Eigen::Vector2i(0,0);\n    _robot_pose = Eigen::Vector3f(0.,0.,0.);\n\n    _prev_v = 0.0; _prev_w = 0.0;\n  }\n\n  void NAOqiPlanner::initGUI(){\n    _use_gui=true;\n    cv::namedWindow( \"pepper_planner\", 0 );\n    cv::setMouseCallback( \"pepper_planner\", &NAOqiPlanner::onMouse, this );\n    std::cerr << \"GUI initialized\" << std::endl;\n  }\n\n  void NAOqiPlanner::onMouse( int event, int x, int y, int, void* v)\n  {\n    NAOqiPlanner* n=reinterpret_cast<NAOqiPlanner*>(v);\n    \n    if( event == cv::EVENT_LBUTTONDOWN ) {\n      std::cerr << \"Left Click!\" << std::endl;\n      n->_goal = Eigen::Vector2i(y,x);\n      n->_have_goal = true;\n      std::cerr << \"Setting goal: \" << n->_goal.transpose() << std::endl;\n    }\n    \n  }\n\n  void NAOqiPlanner::handleGUIInput(){\n    if (! _use_gui)\n      return;\n\n    char key=cv::waitKey(10);\n    switch(key) {\n    case 'm':\n      if (_what_to_show == Map)\n\tbreak;\n      std::cerr << \"Switching view to map\" << std::endl;\n      _what_to_show = Map;\n      break;\n    case 'd': \n      if (_what_to_show == Distance)\n\tbreak;\n      std::cerr << \"Switching view to distance map\" << std::endl;\n      _what_to_show = Distance;\n      break;\n    case 'c': \n      if (_what_to_show == Cost)\n\tbreak;\n      std::cerr << \"Switching view to cost map\" << std::endl;\n      _what_to_show = Cost;\n      break;\n    case 'r':\n      std::cerr << \"Resetting\" << std::endl;\n      _restart = true;\n      _have_goal = false;\n      \/\/Removing obstacles\n      {\n\tint occ_threshold = (1.0 - _occ_threshold) * 255;\n\tint free_threshold = (1.0 - _free_threshold) * 255;\n\tgrayMap2indices(_indices_image, _map_image, occ_threshold, free_threshold);\n      }\n    default:;\n    }\n  }\n\n\n  void NAOqiPlanner::handleGUIDisplay() {\n    if (_use_gui) {\n      FloatImage shown_image;\n      switch(_what_to_show){\n      case Map:\n\tshown_image.create(_indices_image.rows, _indices_image.cols);\n\tfor (int r=0; r<_indices_image.rows; ++r) {\n\t  int* src_ptr=_indices_image.ptr<int>(r);\n\t  float* dest_ptr=shown_image.ptr<float>(r);\n\t  for (int c=0; c<_indices_image.cols; ++c, ++src_ptr, ++dest_ptr){\n\t    if (*src_ptr<-1)\n\t      *dest_ptr = .5f;\n\t    else if (*src_ptr == -1)\n\t      *dest_ptr = 1.f;\n\t    else\n\t      *dest_ptr=0.f;\n\t  }\n\t}\n\tbreak;\n\t\n      case Distance:\n\tshown_image=_distance_image*(1.\/_safety_region);\n\tbreak;\n      case Cost:\n\tshown_image=_cost_image*(1.f\/_max_cost);\n\tbreak;\n      }\n      \n      \/\/cv::namedWindow(\"indices_img\", 0);\n      \/\/cv::imshow(\"indices_img\", _indices_image);\n\n      \/\/ Drawing goal\n      if (_have_goal)\n\tcv::circle(shown_image, cv::Point(_goal.y(), _goal.x()), 3, cv::Scalar(0.0f));\n\n      \/\/ Drawing current pose\n      cv::rectangle(shown_image,\n\t\t    cv::Point(_robot_pose_image.y()+2, _robot_pose_image.x()-2),\n\t\t    cv::Point(_robot_pose_image.y()-2, _robot_pose_image.x()+2),\n\t\t    cv::Scalar(0.0f));\n\n\n      \/\/Draw path\n      if (_robot_pose_image.x()>=0 && _have_goal){\n\tPathMapCell* current=&_path_map(_robot_pose_image.x(), _robot_pose_image.y());\n\twhile (current&& current->parent && current->parent!=current) {\n\t  PathMapCell* parent=current->parent;\n\t  cv::line(shown_image,\n\t\t   cv::Point(current->c, current->r),\n\t\t   cv::Point(parent->c, parent->r),\n\t\t   cv::Scalar(0.0f));\n\t  current = current->parent;\n\t}\n      }\n\n      \n      cv::imshow(\"pepper_planner\", shown_image);\n    }  \n    \n  }\n  \n  void NAOqiPlanner::readMap(const std::string mapname){\n    std::cerr << \"Reading map\" << mapname << std::endl;\n  \n    \/\/ reading map info\n    SimpleYAMLParser parser;\n    parser.load(mapname);\n    std::cerr << \"Dirname: \" << dirname(strdup(mapname.c_str())) << std::endl;\n    \n    std::string map_image_name = parser.getValue(\"image\");\n    _map_resolution = parser.getValueAsFloat(\"resolution\");\n    _map_inverse_resolution = 1.\/_map_resolution;\n    _occ_threshold = parser.getValueAsFloat(\"occupied_thresh\");\n    _free_threshold = parser.getValueAsFloat(\"free_thresh\");\n    _map_origin = parser.getValueAsVector3f(\"origin\");\n    _map_origin_transform_inverse = v2t(_map_origin).inverse();\n    \n    std::cerr << \"MAP NAME: \" << map_image_name << std::endl;\n    std::cerr << \"RESOLUTION: \" << _map_resolution << std::endl;\n    std::cerr << \"ORIGIN: \" << _map_origin.transpose() << std::endl;\n    std::cerr << \"OCC THRESHOLD: \" << _occ_threshold << std::endl;\n    std::cerr << \"FREE THRESHOLD: \" << _free_threshold << std::endl;\n      \n    std::string full_path_map_image = std::string(dirname(strdup(mapname.c_str())))+\"\/\"+map_image_name;\n    std::cerr << \"Opening image\" << full_path_map_image << std::endl;\n  \n    _map_image = cv::imread(full_path_map_image, CV_LOAD_IMAGE_GRAYSCALE);\n    std::cerr << \"Image read: (\" << _map_image.rows << \"x\" << _map_image.cols << \")\" << std::endl;\n\n    int occ_threshold = (1.0 - _occ_threshold) * 255;\n    int free_threshold = (1.0 - _free_threshold) * 255;\n    grayMap2indices(_indices_image, _map_image, occ_threshold, free_threshold);\n  }\n\n\n  void NAOqiPlanner::subscribeServices(){\n    qi::AnyObject memory_service = _session->service(\"ALMemory\");\n    qi::AnyObject motion_service = _session->service(\"ALMotion\");\n    \n    _stop_thread=false;\n    _servicesMonitorThread = std::thread(&NAOqiPlanner::servicesMonitorThread, this, memory_service, motion_service);\n    std::cerr << \"Planner Services Monitor Thread launched.\" << std::endl;\n  }\n\n  void NAOqiPlanner::unsubscribeServices(){\n    _stop_thread=true;\n    _servicesMonitorThread.join();\n  }\n  \n  void NAOqiPlanner::servicesMonitorThread(qi::AnyObject memory_service, qi::AnyObject motion_service) {\n    while (!_stop_thread){\n      qi::SteadyClock::time_point time_start = qi::SteadyClock::now();\n\n      \/\/get robot localization\n      qi::AnyValue value = memory_service.call<qi::AnyValue>(\"getData\", \"NAOqiLocalizer\/RobotPose\");\n      srrg_core::FloatVector robot_pose_floatvector = value.toList<float>();\n      _robot_pose = srrg_core::fromFloatVector3f(robot_pose_floatvector);\n      std::cerr << \"Robot pose map: \" << _robot_pose.transpose() << std::endl;\n\n      Eigen::Isometry2f robot_pose_transform=_map_origin_transform_inverse*v2t(_robot_pose);\n      Eigen::Vector3f robot_pose_vector=t2v(robot_pose_transform);\n\n      _robot_pose_image = world2grid(Eigen::Vector2f(robot_pose_vector.x(), robot_pose_vector.y()));\n      \n      \n      \/\/get laser\n      Vector2fVector laserpoints = getLaser(memory_service);\n      Vector2iVector obstacle_points;\n      for (size_t i=0; i<laserpoints.size(); i++){\n\tEigen::Vector2f lp=robot_pose_transform* laserpoints[i];\n\tint r = lp.x()*_map_inverse_resolution;\n\tint c = lp.y()*_map_inverse_resolution;\n\tif (! _distance_map.inside(r,c))\n\t  continue;\n\tobstacle_points.push_back(Eigen::Vector2i(r,c));\n      }\n      \n      \/\/here I'll do something map + loc + laser + goal -> path\n      \n      if (_restart){\n\t_dmap_calculator.setMaxDistance(_safety_region\/_map_resolution);\n\t_dmap_calculator.setIndicesImage(_indices_image);\n\t_dmap_calculator.setOutputPathMap(_distance_map);\n\t_dmap_calculator.init();\n\t_restart = false;\n      }\n      _dmap_calculator.setPoints(obstacle_points);\n\n      \n      _dmap_calculator.compute();\n      _distance_image = _dmap_calculator.distanceImage()*_map_resolution;\n\n      distances2cost(_cost_image, _distance_image, _robot_radius, _safety_region, _min_cost, _max_cost);\n\n      if (_have_goal){\n\t_path_calculator.setMaxCost(_max_cost-1);\n\t_path_calculator.setCostMap(_cost_image);\n\t_path_calculator.setOutputPathMap(_path_map);\n\tVector2iVector goals;\n\tgoals.push_back(_goal);\n\t_path_calculator.goals() = goals;\n\t_path_calculator.compute();\n\n\t_path.clear();\n\n\n\t\/\/ Filling path\n\tstd::ofstream ofs (\"path.dat\", std::ofstream::out);\n\tPathMapCell* current=&_path_map(_robot_pose_image.x(), _robot_pose_image.y());\n\twhile (current&& current->parent && current->parent!=current) {\n\t  PathMapCell* parent=current->parent;\n\t  _path.push_back(Eigen::Vector2i(current->r, current->c));\n\t  ofs << current->r << current->c << std::endl;\n\t  \n\t  current = current->parent;\n\t}\n\n\tfloat linear_vel, angular_vel;\n\tcomputeControlToWaypoint(linear_vel, angular_vel);\n\t\/\/apply vels\n\tstd::cerr << \"Applying vels: \" << linear_vel  << \" \" << angular_vel << std::endl;\n\tmotion_service.call<void>(\"move\", linear_vel,0,angular_vel);\n\n\t\n      } \/\/else nothing to compute\n      \n      handleGUIDisplay();\n    \n      handleGUIInput();\n    \n\n      \n      qi::SteadyClock::time_point time_end = qi::SteadyClock::now();\n      qi::MilliSeconds ms = boost::chrono::duration_cast<qi::MilliSeconds>(time_end - time_start);\n      std::cerr << \"Cycle \" << qi::to_string(ms) << std::endl;\n    \n      usleep(200000);\n    }\n    std::cout << \"Planner Monitor Thread finished.\" << std::endl;\n\n  }\n\n\n  void NAOqiPlanner::computeControlToWaypoint(float& v, float& w) {\n    if (!_path.size()){\n      v = 0.0;\n      w = 0.0;\n      \n      _prev_v = v;\n      _prev_w = w;\n      return;\n    }\n\n    \/\/ Next waypoint naive computation.\n    float nextwp_distance = 1.0; \/\/meters\n    int num_cells = nextwp_distance * _map_inverse_resolution;\n\n    Eigen::Vector2i nextwp;\n    bool isLastWp = false;\n    if (_path.size() > num_cells)\n      nextwp = _path[num_cells];\n    else{\n      nextwp = _path[_path.size()-1];\n      isLastWp = true;\n    }\n\n    Eigen::Vector2f nextwp_world = grid2world(nextwp);\n    Eigen::Vector2f robot_pose_xy(_robot_pose.x(), _robot_pose.y());\n    Eigen::Vector2f distance_goal = nextwp_world - robot_pose_xy;\n    float angle_goal = normalize(atan2(distance_goal.y(),distance_goal.x()) - _robot_pose.z());\n    float goal_distance_threshold = 0.3;\n    if (distance_goal.norm() < goal_distance_threshold){\n      std::cerr << \">>>>>>>>>>Arrived to goal: \" << nextwp.transpose() << std::endl;\n      if (isLastWp){\n\tstd::cerr << \">>>>>>>>>>Arrived to last goal\" << std::endl;\n\tv = 0.0;\n\tw = 0.0;\n\t\n\t_prev_v = v;\n\t_prev_w = w;\n\t_have_goal = false;\n\treturn;\n      }\n    }else {\n      std::cerr << \"Distance to goal: \" << distance_goal.norm() << std::endl;\n      std::cerr << \"Angle to goal: \" << angle_goal << std::endl;\n    }\n\n    float force = 1.5;\n    Eigen::Vector2f F(force*cos(angle_goal), force*sin(angle_goal));\n\n    \/\/Constants definition\n    float f = 1.0;\n    float b = 1.975;\n    float k_i = 0.95;\n    float h = 2.05;\n    float T = 0.2;\n    \n    \/\/limiting force\n    if (F.norm() > f){\n      float angleF = atan2(F.y(), F.x());\n      F.x() = cos(angleF)*f;\n      F.y() = sin(angleF)*f;\n    }\n\n    v = (F.x() * T + _prev_v) \/ (1 + 2*b*T);\n    if (v < 0)\n      v = 0;\n    w = (k_i *h * F.y() * T + _prev_w) \/ (1 + 2*b*k_i*T);\n    if (w < 1e-4)\n      w = 0;\n\n    _prev_v = v;\n    _prev_w = w;\n\n  }\n\n\n  \n\n  \n\n}\n<commit_msg>rotation-only behaviour<commit_after>#include \"naoqi_planner.h\"\n\n\n\nnamespace naoqi_planner {\n  using namespace naoqi_sensor_utils;\n  \n  NAOqiPlanner::NAOqiPlanner(qi::SessionPtr session){\n    _session = session;\n    if (! _session)\n      throw std::runtime_error(\"Error: No memory service provided\");\n\n    _use_gui = false;\n    _what_to_show = Map;\n\n    _restart = true;\n\n    _have_goal = false;\n    _goal = Eigen::Vector2i(0,0);\n    _robot_pose = Eigen::Vector3f(0.,0.,0.);\n\n    _prev_v = 0.0; _prev_w = 0.0;\n  }\n\n  void NAOqiPlanner::initGUI(){\n    _use_gui=true;\n    cv::namedWindow( \"pepper_planner\", 0 );\n    cv::setMouseCallback( \"pepper_planner\", &NAOqiPlanner::onMouse, this );\n    std::cerr << \"GUI initialized\" << std::endl;\n  }\n\n  void NAOqiPlanner::onMouse( int event, int x, int y, int, void* v)\n  {\n    NAOqiPlanner* n=reinterpret_cast<NAOqiPlanner*>(v);\n    \n    if( event == cv::EVENT_LBUTTONDOWN ) {\n      std::cerr << \"Left Click!\" << std::endl;\n      n->_goal = Eigen::Vector2i(y,x);\n      n->_have_goal = true;\n      std::cerr << \"Setting goal: \" << n->_goal.transpose() << std::endl;\n    }\n    \n  }\n\n  void NAOqiPlanner::handleGUIInput(){\n    if (! _use_gui)\n      return;\n\n    char key=cv::waitKey(10);\n    switch(key) {\n    case 'm':\n      if (_what_to_show == Map)\n\tbreak;\n      std::cerr << \"Switching view to map\" << std::endl;\n      _what_to_show = Map;\n      break;\n    case 'd': \n      if (_what_to_show == Distance)\n\tbreak;\n      std::cerr << \"Switching view to distance map\" << std::endl;\n      _what_to_show = Distance;\n      break;\n    case 'c': \n      if (_what_to_show == Cost)\n\tbreak;\n      std::cerr << \"Switching view to cost map\" << std::endl;\n      _what_to_show = Cost;\n      break;\n    case 'r':\n      std::cerr << \"Resetting\" << std::endl;\n      _restart = true;\n      _have_goal = false;\n      \/\/Removing obstacles\n      {\n\tint occ_threshold = (1.0 - _occ_threshold) * 255;\n\tint free_threshold = (1.0 - _free_threshold) * 255;\n\tgrayMap2indices(_indices_image, _map_image, occ_threshold, free_threshold);\n      }\n    default:;\n    }\n  }\n\n\n  void NAOqiPlanner::handleGUIDisplay() {\n    if (_use_gui) {\n      FloatImage shown_image;\n      switch(_what_to_show){\n      case Map:\n\tshown_image.create(_indices_image.rows, _indices_image.cols);\n\tfor (int r=0; r<_indices_image.rows; ++r) {\n\t  int* src_ptr=_indices_image.ptr<int>(r);\n\t  float* dest_ptr=shown_image.ptr<float>(r);\n\t  for (int c=0; c<_indices_image.cols; ++c, ++src_ptr, ++dest_ptr){\n\t    if (*src_ptr<-1)\n\t      *dest_ptr = .5f;\n\t    else if (*src_ptr == -1)\n\t      *dest_ptr = 1.f;\n\t    else\n\t      *dest_ptr=0.f;\n\t  }\n\t}\n\tbreak;\n\t\n      case Distance:\n\tshown_image=_distance_image*(1.\/_safety_region);\n\tbreak;\n      case Cost:\n\tshown_image=_cost_image*(1.f\/_max_cost);\n\tbreak;\n      }\n      \n      \/\/cv::namedWindow(\"indices_img\", 0);\n      \/\/cv::imshow(\"indices_img\", _indices_image);\n\n      \/\/ Drawing goal\n      if (_have_goal)\n\tcv::circle(shown_image, cv::Point(_goal.y(), _goal.x()), 3, cv::Scalar(0.0f));\n\n      \/\/ Drawing current pose\n      cv::rectangle(shown_image,\n\t\t    cv::Point(_robot_pose_image.y()+2, _robot_pose_image.x()-2),\n\t\t    cv::Point(_robot_pose_image.y()-2, _robot_pose_image.x()+2),\n\t\t    cv::Scalar(0.0f));\n\n\n      \/\/Draw path\n      if (_robot_pose_image.x()>=0 && _have_goal){\n\tPathMapCell* current=&_path_map(_robot_pose_image.x(), _robot_pose_image.y());\n\twhile (current&& current->parent && current->parent!=current) {\n\t  PathMapCell* parent=current->parent;\n\t  cv::line(shown_image,\n\t\t   cv::Point(current->c, current->r),\n\t\t   cv::Point(parent->c, parent->r),\n\t\t   cv::Scalar(0.0f));\n\t  current = current->parent;\n\t}\n      }\n\n      \n      cv::imshow(\"pepper_planner\", shown_image);\n    }  \n    \n  }\n  \n  void NAOqiPlanner::readMap(const std::string mapname){\n    std::cerr << \"Reading map\" << mapname << std::endl;\n  \n    \/\/ reading map info\n    SimpleYAMLParser parser;\n    parser.load(mapname);\n    std::cerr << \"Dirname: \" << dirname(strdup(mapname.c_str())) << std::endl;\n    \n    std::string map_image_name = parser.getValue(\"image\");\n    _map_resolution = parser.getValueAsFloat(\"resolution\");\n    _map_inverse_resolution = 1.\/_map_resolution;\n    _occ_threshold = parser.getValueAsFloat(\"occupied_thresh\");\n    _free_threshold = parser.getValueAsFloat(\"free_thresh\");\n    _map_origin = parser.getValueAsVector3f(\"origin\");\n    _map_origin_transform_inverse = v2t(_map_origin).inverse();\n    \n    std::cerr << \"MAP NAME: \" << map_image_name << std::endl;\n    std::cerr << \"RESOLUTION: \" << _map_resolution << std::endl;\n    std::cerr << \"ORIGIN: \" << _map_origin.transpose() << std::endl;\n    std::cerr << \"OCC THRESHOLD: \" << _occ_threshold << std::endl;\n    std::cerr << \"FREE THRESHOLD: \" << _free_threshold << std::endl;\n      \n    std::string full_path_map_image = std::string(dirname(strdup(mapname.c_str())))+\"\/\"+map_image_name;\n    std::cerr << \"Opening image\" << full_path_map_image << std::endl;\n  \n    _map_image = cv::imread(full_path_map_image, CV_LOAD_IMAGE_GRAYSCALE);\n    std::cerr << \"Image read: (\" << _map_image.rows << \"x\" << _map_image.cols << \")\" << std::endl;\n\n    int occ_threshold = (1.0 - _occ_threshold) * 255;\n    int free_threshold = (1.0 - _free_threshold) * 255;\n    grayMap2indices(_indices_image, _map_image, occ_threshold, free_threshold);\n  }\n\n\n  void NAOqiPlanner::subscribeServices(){\n    qi::AnyObject memory_service = _session->service(\"ALMemory\");\n    qi::AnyObject motion_service = _session->service(\"ALMotion\");\n    \n    _stop_thread=false;\n    _servicesMonitorThread = std::thread(&NAOqiPlanner::servicesMonitorThread, this, memory_service, motion_service);\n    std::cerr << \"Planner Services Monitor Thread launched.\" << std::endl;\n  }\n\n  void NAOqiPlanner::unsubscribeServices(){\n    _stop_thread=true;\n    _servicesMonitorThread.join();\n  }\n  \n  void NAOqiPlanner::servicesMonitorThread(qi::AnyObject memory_service, qi::AnyObject motion_service) {\n    while (!_stop_thread){\n      qi::SteadyClock::time_point time_start = qi::SteadyClock::now();\n\n      \/\/get robot localization\n      qi::AnyValue value = memory_service.call<qi::AnyValue>(\"getData\", \"NAOqiLocalizer\/RobotPose\");\n      srrg_core::FloatVector robot_pose_floatvector = value.toList<float>();\n      _robot_pose = srrg_core::fromFloatVector3f(robot_pose_floatvector);\n      std::cerr << \"Robot pose map: \" << _robot_pose.transpose() << std::endl;\n\n      Eigen::Isometry2f robot_pose_transform=_map_origin_transform_inverse*v2t(_robot_pose);\n      Eigen::Vector3f robot_pose_vector=t2v(robot_pose_transform);\n\n      _robot_pose_image = world2grid(Eigen::Vector2f(robot_pose_vector.x(), robot_pose_vector.y()));\n      \n      \n      \/\/get laser\n      Vector2fVector laserpoints = getLaser(memory_service);\n      Vector2iVector obstacle_points;\n      for (size_t i=0; i<laserpoints.size(); i++){\n\tEigen::Vector2f lp=robot_pose_transform* laserpoints[i];\n\tint r = lp.x()*_map_inverse_resolution;\n\tint c = lp.y()*_map_inverse_resolution;\n\tif (! _distance_map.inside(r,c))\n\t  continue;\n\tobstacle_points.push_back(Eigen::Vector2i(r,c));\n      }\n      \n      \/\/here I'll do something map + loc + laser + goal -> path\n      \n      if (_restart){\n\t_dmap_calculator.setMaxDistance(_safety_region\/_map_resolution);\n\t_dmap_calculator.setIndicesImage(_indices_image);\n\t_dmap_calculator.setOutputPathMap(_distance_map);\n\t_dmap_calculator.init();\n\t_restart = false;\n      }\n      _dmap_calculator.setPoints(obstacle_points);\n\n      \n      _dmap_calculator.compute();\n      _distance_image = _dmap_calculator.distanceImage()*_map_resolution;\n\n      distances2cost(_cost_image, _distance_image, _robot_radius, _safety_region, _min_cost, _max_cost);\n\n      if (_have_goal){\n\t_path_calculator.setMaxCost(_max_cost-1);\n\t_path_calculator.setCostMap(_cost_image);\n\t_path_calculator.setOutputPathMap(_path_map);\n\tVector2iVector goals;\n\tgoals.push_back(_goal);\n\t_path_calculator.goals() = goals;\n\t_path_calculator.compute();\n\n\t_path.clear();\n\n\n\t\/\/ Filling path\n\tstd::ofstream ofs (\"path.dat\", std::ofstream::out);\n\tPathMapCell* current=&_path_map(_robot_pose_image.x(), _robot_pose_image.y());\n\twhile (current&& current->parent && current->parent!=current) {\n\t  PathMapCell* parent=current->parent;\n\t  _path.push_back(Eigen::Vector2i(current->r, current->c));\n\t  ofs << current->r << current->c << std::endl;\n\t  \n\t  current = current->parent;\n\t}\n\n\tfloat linear_vel, angular_vel;\n\tcomputeControlToWaypoint(linear_vel, angular_vel);\n\t\/\/apply vels\n\tstd::cerr << \"Applying vels: \" << linear_vel  << \" \" << angular_vel << std::endl;\n\tmotion_service.call<void>(\"move\", linear_vel,0,angular_vel);\n\n\t\n      } \/\/else nothing to compute\n      \n      handleGUIDisplay();\n    \n      handleGUIInput();\n    \n\n      \n      qi::SteadyClock::time_point time_end = qi::SteadyClock::now();\n      qi::MilliSeconds ms = boost::chrono::duration_cast<qi::MilliSeconds>(time_end - time_start);\n      std::cerr << \"Cycle \" << qi::to_string(ms) << std::endl;\n    \n      usleep(200000);\n    }\n    std::cout << \"Planner Monitor Thread finished.\" << std::endl;\n\n  }\n\n\n  void NAOqiPlanner::computeControlToWaypoint(float& v, float& w) {\n    if (!_path.size()){\n      v = 0.0;\n      w = 0.0;\n      \n      _prev_v = v;\n      _prev_w = w;\n      return;\n    }\n\n    \/\/ Next waypoint naive computation.\n    float nextwp_distance = 1.0; \/\/meters\n    int num_cells = nextwp_distance * _map_inverse_resolution;\n\n    Eigen::Vector2i nextwp;\n    bool isLastWp = false;\n    if (_path.size() > num_cells)\n      nextwp = _path[num_cells];\n    else{\n      nextwp = _path[_path.size()-1];\n      isLastWp = true;\n    }\n\n    Eigen::Vector2f nextwp_world = grid2world(nextwp);\n    Eigen::Vector2f robot_pose_xy(_robot_pose.x(), _robot_pose.y());\n    Eigen::Vector2f distance_goal = nextwp_world - robot_pose_xy;\n    float angle_goal = normalize(atan2(distance_goal.y(),distance_goal.x()) - _robot_pose.z());\n    float goal_distance_threshold = 0.3;\n    if (distance_goal.norm() < goal_distance_threshold){\n      std::cerr << \">>>>>>>>>>Arrived to goal: \" << nextwp.transpose() << std::endl;\n      if (isLastWp){\n\tstd::cerr << \">>>>>>>>>>Arrived to last goal\" << std::endl;\n\tv = 0.0;\n\tw = 0.0;\n\t\n\t_prev_v = v;\n\t_prev_w = w;\n\t_have_goal = false;\n\treturn;\n      }\n    }else {\n      std::cerr << \"Distance to goal: \" << distance_goal.norm() << std::endl;\n      std::cerr << \"Angle to goal: \" << angle_goal << std::endl;\n    }\n\n    float force = 1.5;\n    Eigen::Vector2f F(force*cos(angle_goal), force*sin(angle_goal));\n\n    \/\/Constants definition\n    float f = 1.0;\n    float b = 1.975;\n    float k_i = 0.95;\n    float h = 2.05;\n    float T = 0.2;\n    \n    \/\/limiting force\n    if (F.norm() > f){\n      float angleF = atan2(F.y(), F.x());\n      F.x() = cos(angleF)*f;\n      F.y() = sin(angleF)*f;\n    }\n\n    v = (F.x() * T + _prev_v) \/ (1 + 2*b*T);\n    if (v < 0)\n      v = 0;\n    w = (k_i *h * F.y() * T + _prev_w) \/ (1 + 2*b*k_i*T);\n    if (w < 1e-4)\n      w = 0;\n\n    \/\/ Switch to rotation-only behaviour\n    float max_angle_goal = 0.3;\n    if (fabs(angle_goal) > max_angle_goal)\n      v = 0;\n    \n\n    _prev_v = v;\n    _prev_w = w;\n\n  }\n\n\n  \n\n  \n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"wallettests.h\"\n\n#include \"qt\/bitcoinamountfield.h\"\n#include \"qt\/callback.h\"\n#include \"qt\/optionsmodel.h\"\n#include \"qt\/platformstyle.h\"\n#include \"qt\/qvalidatedlineedit.h\"\n#include \"qt\/sendcoinsdialog.h\"\n#include \"qt\/sendcoinsentry.h\"\n#include \"qt\/transactiontablemodel.h\"\n#include \"qt\/transactionview.h\"\n#include \"qt\/walletmodel.h\"\n#include \"test\/test_bitcoin.h\"\n#include \"validation.h\"\n#include \"wallet\/wallet.h\"\n\n#include <QAbstractButton>\n#include <QAction>\n#include <QApplication>\n#include <QCheckBox>\n#include <QPushButton>\n#include <QTimer>\n#include <QVBoxLayout>\n\nnamespace\n{\n\/\/! Press \"Ok\" button in message box dialog.\nvoid ConfirmMessage(QString* text = nullptr)\n{\n    QTimer::singleShot(0, makeCallback([text](Callback* callback) {\n        for (QWidget* widget : QApplication::topLevelWidgets()) {\n            if (widget->inherits(\"QMessageBox\")) {\n                QMessageBox* messageBox = qobject_cast<QMessageBox*>(widget);\n                if (text) *text = messageBox->text();\n                messageBox->defaultButton()->click();\n            }\n        }\n        delete callback;\n    }), SLOT(call()));\n}\n\n\/\/! Press \"Yes\" or \"Cancel\" buttons in modal send confirmation dialog.\nvoid ConfirmSend(QString* text = nullptr, bool cancel = false)\n{\n    QTimer::singleShot(0, makeCallback([text, cancel](Callback* callback) {\n        for (QWidget* widget : QApplication::topLevelWidgets()) {\n            if (widget->inherits(\"SendConfirmationDialog\")) {\n                SendConfirmationDialog* dialog = qobject_cast<SendConfirmationDialog*>(widget);\n                if (text) *text = dialog->text();\n                QAbstractButton* button = dialog->button(cancel ? QMessageBox::Cancel : QMessageBox::Yes);\n                button->setEnabled(true);\n                button->click();\n            }\n        }\n        delete callback;\n    }), SLOT(call()));\n}\n\n\/\/! Send coins to address and return txid.\nuint256 SendCoins(CWallet& wallet, SendCoinsDialog& sendCoinsDialog, const CBitcoinAddress& address, CAmount amount, bool rbf)\n{\n    QVBoxLayout* entries = sendCoinsDialog.findChild<QVBoxLayout*>(\"entries\");\n    SendCoinsEntry* entry = qobject_cast<SendCoinsEntry*>(entries->itemAt(0)->widget());\n    entry->findChild<QValidatedLineEdit*>(\"payTo\")->setText(QString::fromStdString(address.ToString()));\n    entry->findChild<BitcoinAmountField*>(\"payAmount\")->setValue(amount);\n    sendCoinsDialog.findChild<QFrame*>(\"frameFee\")\n        ->findChild<QFrame*>(\"frameFeeSelection\")\n        ->findChild<QCheckBox*>(\"optInRBF\")\n        ->setCheckState(rbf ? Qt::Checked : Qt::Unchecked);\n    uint256 txid;\n    boost::signals2::scoped_connection c(wallet.NotifyTransactionChanged.connect([&txid](CWallet*, const uint256& hash, ChangeType status) {\n        if (status == CT_NEW) txid = hash;\n    }));\n    ConfirmSend();\n    QMetaObject::invokeMethod(&sendCoinsDialog, \"on_sendButton_clicked\");\n    return txid;\n}\n\n\/\/! Find index of txid in transaction list.\nQModelIndex FindTx(const QAbstractItemModel& model, const uint256& txid)\n{\n    QString hash = QString::fromStdString(txid.ToString());\n    int rows = model.rowCount({});\n    for (int row = 0; row < rows; ++row) {\n        QModelIndex index = model.index(row, 0, {});\n        if (model.data(index, TransactionTableModel::TxHashRole) == hash) {\n            return index;\n        }\n    }\n    return {};\n}\n\n\/\/! Invoke bumpfee on txid and check results.\nvoid BumpFee(TransactionView& view, const uint256& txid, bool expectDisabled, std::string expectError, bool cancel)\n{\n    QTableView* table = view.findChild<QTableView*>(\"transactionView\");\n    QModelIndex index = FindTx(*table->selectionModel()->model(), txid);\n    QVERIFY2(index.isValid(), \"Could not find BumpFee txid\");\n\n    \/\/ Select row in table, invoke context menu, and make sure bumpfee action is\n    \/\/ enabled or disabled as expected.\n    QAction* action = view.findChild<QAction*>(\"bumpFeeAction\");\n    table->selectionModel()->select(index, QItemSelectionModel::ClearAndSelect | QItemSelectionModel::Rows);\n    action->setEnabled(expectDisabled);\n    table->customContextMenuRequested({});\n    QCOMPARE(action->isEnabled(), !expectDisabled);\n\n    action->setEnabled(true);\n    QString text;\n    if (expectError.empty()) {\n        ConfirmSend(&text, cancel);\n    } else {\n        ConfirmMessage(&text);\n    }\n    action->trigger();\n    QVERIFY(text.indexOf(QString::fromStdString(expectError)) != -1);\n}\n\n\/\/! Simple qt wallet tests.\n\/\/\n\/\/ Test widgets can be debugged interactively calling show() on them and\n\/\/ manually running the event loop, e.g.:\n\/\/\n\/\/     sendCoinsDialog.show();\n\/\/     QEventLoop().exec();\n\/\/\n\/\/ This also requires overriding the default minimal Qt platform:\n\/\/\n\/\/     src\/qt\/test\/test_bitcoin-qt -platform xcb      # Linux\n\/\/     src\/qt\/test\/test_bitcoin-qt -platform windows  # Windows\n\/\/     src\/qt\/test\/test_bitcoin-qt -platform cocoa    # macOS\nvoid TestSendCoins()\n{\n    \/\/ Set up wallet and chain with 105 blocks (5 mature blocks for spending).\n    TestChain100Setup test;\n    for (int i = 0; i < 5; ++i) {\n        test.CreateAndProcessBlock({}, GetScriptForRawPubKey(test.coinbaseKey.GetPubKey()));\n    }\n    bitdb.MakeMock();\n    std::unique_ptr<CWalletDBWrapper> dbw(new CWalletDBWrapper(&bitdb, \"wallet_test.dat\"));\n    CWallet wallet(std::move(dbw));\n    bool firstRun;\n    wallet.LoadWallet(firstRun);\n    {\n        LOCK(wallet.cs_wallet);\n        wallet.SetAddressBook(test.coinbaseKey.GetPubKey().GetID(), \"\", \"receive\");\n        wallet.AddKeyPubKey(test.coinbaseKey, test.coinbaseKey.GetPubKey());\n    }\n    wallet.ScanForWalletTransactions(chainActive.Genesis(), true);\n    wallet.SetBroadcastTransactions(true);\n\n    \/\/ Create widgets for sending coins and listing transactions.\n    std::unique_ptr<const PlatformStyle> platformStyle(PlatformStyle::instantiate(\"other\"));\n    SendCoinsDialog sendCoinsDialog(platformStyle.get());\n    TransactionView transactionView(platformStyle.get());\n    OptionsModel optionsModel;\n    WalletModel walletModel(platformStyle.get(), &wallet, &optionsModel);\n    sendCoinsDialog.setModel(&walletModel);\n    transactionView.setModel(&walletModel);\n\n    \/\/ Send two transactions, and verify they are added to transaction list.\n    TransactionTableModel* transactionTableModel = walletModel.getTransactionTableModel();\n    QCOMPARE(transactionTableModel->rowCount({}), 105);\n    uint256 txid1 = SendCoins(wallet, sendCoinsDialog, CBitcoinAddress(CKeyID()), 5 * COIN, false \/* rbf *\/);\n    uint256 txid2 = SendCoins(wallet, sendCoinsDialog, CBitcoinAddress(CKeyID()), 10 * COIN, true \/* rbf *\/);\n    QCOMPARE(transactionTableModel->rowCount({}), 107);\n    QVERIFY(FindTx(*transactionTableModel, txid1).isValid());\n    QVERIFY(FindTx(*transactionTableModel, txid2).isValid());\n\n    \/\/ Call bumpfee. Test disabled, canceled, enabled, then failing cases.\n    BumpFee(transactionView, txid1, true \/* expect disabled *\/, \"not BIP 125 replaceable\" \/* expected error *\/, false \/* cancel *\/);\n    BumpFee(transactionView, txid2, false \/* expect disabled *\/, {} \/* expected error *\/, true \/* cancel *\/);\n    BumpFee(transactionView, txid2, false \/* expect disabled *\/, {} \/* expected error *\/, false \/* cancel *\/);\n    BumpFee(transactionView, txid2, false \/* expect disabled *\/, \"already bumped\" \/* expected error *\/, false \/* cancel *\/);\n\n    bitdb.Flush(true);\n    bitdb.Reset();\n}\n\n}\n\nvoid WalletTests::walletTests()\n{\n    TestSendCoins();\n}\n<commit_msg>Fix broken q4 test build<commit_after>#include \"wallettests.h\"\n\n#include \"qt\/bitcoinamountfield.h\"\n#include \"qt\/callback.h\"\n#include \"qt\/optionsmodel.h\"\n#include \"qt\/platformstyle.h\"\n#include \"qt\/qvalidatedlineedit.h\"\n#include \"qt\/sendcoinsdialog.h\"\n#include \"qt\/sendcoinsentry.h\"\n#include \"qt\/transactiontablemodel.h\"\n#include \"qt\/transactionview.h\"\n#include \"qt\/walletmodel.h\"\n#include \"test\/test_bitcoin.h\"\n#include \"validation.h\"\n#include \"wallet\/wallet.h\"\n\n#include <QAbstractButton>\n#include <QAction>\n#include <QApplication>\n#include <QCheckBox>\n#include <QPushButton>\n#include <QTimer>\n#include <QVBoxLayout>\n\nnamespace\n{\n\/\/! Press \"Ok\" button in message box dialog.\nvoid ConfirmMessage(QString* text = nullptr)\n{\n    QTimer::singleShot(0, makeCallback([text](Callback* callback) {\n        for (QWidget* widget : QApplication::topLevelWidgets()) {\n            if (widget->inherits(\"QMessageBox\")) {\n                QMessageBox* messageBox = qobject_cast<QMessageBox*>(widget);\n                if (text) *text = messageBox->text();\n                messageBox->defaultButton()->click();\n            }\n        }\n        delete callback;\n    }), SLOT(call()));\n}\n\n\/\/! Press \"Yes\" or \"Cancel\" buttons in modal send confirmation dialog.\nvoid ConfirmSend(QString* text = nullptr, bool cancel = false)\n{\n    QTimer::singleShot(0, makeCallback([text, cancel](Callback* callback) {\n        for (QWidget* widget : QApplication::topLevelWidgets()) {\n            if (widget->inherits(\"SendConfirmationDialog\")) {\n                SendConfirmationDialog* dialog = qobject_cast<SendConfirmationDialog*>(widget);\n                if (text) *text = dialog->text();\n                QAbstractButton* button = dialog->button(cancel ? QMessageBox::Cancel : QMessageBox::Yes);\n                button->setEnabled(true);\n                button->click();\n            }\n        }\n        delete callback;\n    }), SLOT(call()));\n}\n\n\/\/! Send coins to address and return txid.\nuint256 SendCoins(CWallet& wallet, SendCoinsDialog& sendCoinsDialog, const CBitcoinAddress& address, CAmount amount, bool rbf)\n{\n    QVBoxLayout* entries = sendCoinsDialog.findChild<QVBoxLayout*>(\"entries\");\n    SendCoinsEntry* entry = qobject_cast<SendCoinsEntry*>(entries->itemAt(0)->widget());\n    entry->findChild<QValidatedLineEdit*>(\"payTo\")->setText(QString::fromStdString(address.ToString()));\n    entry->findChild<BitcoinAmountField*>(\"payAmount\")->setValue(amount);\n    sendCoinsDialog.findChild<QFrame*>(\"frameFee\")\n        ->findChild<QFrame*>(\"frameFeeSelection\")\n        ->findChild<QCheckBox*>(\"optInRBF\")\n        ->setCheckState(rbf ? Qt::Checked : Qt::Unchecked);\n    uint256 txid;\n    boost::signals2::scoped_connection c(wallet.NotifyTransactionChanged.connect([&txid](CWallet*, const uint256& hash, ChangeType status) {\n        if (status == CT_NEW) txid = hash;\n    }));\n    ConfirmSend();\n    QMetaObject::invokeMethod(&sendCoinsDialog, \"on_sendButton_clicked\");\n    return txid;\n}\n\n\/\/! Find index of txid in transaction list.\nQModelIndex FindTx(const QAbstractItemModel& model, const uint256& txid)\n{\n    QString hash = QString::fromStdString(txid.ToString());\n    int rows = model.rowCount({});\n    for (int row = 0; row < rows; ++row) {\n        QModelIndex index = model.index(row, 0, {});\n        if (model.data(index, TransactionTableModel::TxHashRole) == hash) {\n            return index;\n        }\n    }\n    return {};\n}\n\n\/\/! Request context menu (call method that is public in qt5, but protected in qt4).\nvoid RequestContextMenu(QWidget* widget)\n{\n    class Qt4Hack : public QWidget\n    {\n    public:\n        using QWidget::customContextMenuRequested;\n    };\n    static_cast<Qt4Hack*>(widget)->customContextMenuRequested({});\n}\n\n\/\/! Invoke bumpfee on txid and check results.\nvoid BumpFee(TransactionView& view, const uint256& txid, bool expectDisabled, std::string expectError, bool cancel)\n{\n    QTableView* table = view.findChild<QTableView*>(\"transactionView\");\n    QModelIndex index = FindTx(*table->selectionModel()->model(), txid);\n    QVERIFY2(index.isValid(), \"Could not find BumpFee txid\");\n\n    \/\/ Select row in table, invoke context menu, and make sure bumpfee action is\n    \/\/ enabled or disabled as expected.\n    QAction* action = view.findChild<QAction*>(\"bumpFeeAction\");\n    table->selectionModel()->select(index, QItemSelectionModel::ClearAndSelect | QItemSelectionModel::Rows);\n    action->setEnabled(expectDisabled);\n    RequestContextMenu(table);\n    QCOMPARE(action->isEnabled(), !expectDisabled);\n\n    action->setEnabled(true);\n    QString text;\n    if (expectError.empty()) {\n        ConfirmSend(&text, cancel);\n    } else {\n        ConfirmMessage(&text);\n    }\n    action->trigger();\n    QVERIFY(text.indexOf(QString::fromStdString(expectError)) != -1);\n}\n\n\/\/! Simple qt wallet tests.\n\/\/\n\/\/ Test widgets can be debugged interactively calling show() on them and\n\/\/ manually running the event loop, e.g.:\n\/\/\n\/\/     sendCoinsDialog.show();\n\/\/     QEventLoop().exec();\n\/\/\n\/\/ This also requires overriding the default minimal Qt platform:\n\/\/\n\/\/     src\/qt\/test\/test_bitcoin-qt -platform xcb      # Linux\n\/\/     src\/qt\/test\/test_bitcoin-qt -platform windows  # Windows\n\/\/     src\/qt\/test\/test_bitcoin-qt -platform cocoa    # macOS\nvoid TestSendCoins()\n{\n    \/\/ Set up wallet and chain with 105 blocks (5 mature blocks for spending).\n    TestChain100Setup test;\n    for (int i = 0; i < 5; ++i) {\n        test.CreateAndProcessBlock({}, GetScriptForRawPubKey(test.coinbaseKey.GetPubKey()));\n    }\n    bitdb.MakeMock();\n    std::unique_ptr<CWalletDBWrapper> dbw(new CWalletDBWrapper(&bitdb, \"wallet_test.dat\"));\n    CWallet wallet(std::move(dbw));\n    bool firstRun;\n    wallet.LoadWallet(firstRun);\n    {\n        LOCK(wallet.cs_wallet);\n        wallet.SetAddressBook(test.coinbaseKey.GetPubKey().GetID(), \"\", \"receive\");\n        wallet.AddKeyPubKey(test.coinbaseKey, test.coinbaseKey.GetPubKey());\n    }\n    wallet.ScanForWalletTransactions(chainActive.Genesis(), true);\n    wallet.SetBroadcastTransactions(true);\n\n    \/\/ Create widgets for sending coins and listing transactions.\n    std::unique_ptr<const PlatformStyle> platformStyle(PlatformStyle::instantiate(\"other\"));\n    SendCoinsDialog sendCoinsDialog(platformStyle.get());\n    TransactionView transactionView(platformStyle.get());\n    OptionsModel optionsModel;\n    WalletModel walletModel(platformStyle.get(), &wallet, &optionsModel);\n    sendCoinsDialog.setModel(&walletModel);\n    transactionView.setModel(&walletModel);\n\n    \/\/ Send two transactions, and verify they are added to transaction list.\n    TransactionTableModel* transactionTableModel = walletModel.getTransactionTableModel();\n    QCOMPARE(transactionTableModel->rowCount({}), 105);\n    uint256 txid1 = SendCoins(wallet, sendCoinsDialog, CBitcoinAddress(CKeyID()), 5 * COIN, false \/* rbf *\/);\n    uint256 txid2 = SendCoins(wallet, sendCoinsDialog, CBitcoinAddress(CKeyID()), 10 * COIN, true \/* rbf *\/);\n    QCOMPARE(transactionTableModel->rowCount({}), 107);\n    QVERIFY(FindTx(*transactionTableModel, txid1).isValid());\n    QVERIFY(FindTx(*transactionTableModel, txid2).isValid());\n\n    \/\/ Call bumpfee. Test disabled, canceled, enabled, then failing cases.\n    BumpFee(transactionView, txid1, true \/* expect disabled *\/, \"not BIP 125 replaceable\" \/* expected error *\/, false \/* cancel *\/);\n    BumpFee(transactionView, txid2, false \/* expect disabled *\/, {} \/* expected error *\/, true \/* cancel *\/);\n    BumpFee(transactionView, txid2, false \/* expect disabled *\/, {} \/* expected error *\/, false \/* cancel *\/);\n    BumpFee(transactionView, txid2, false \/* expect disabled *\/, \"already bumped\" \/* expected error *\/, false \/* cancel *\/);\n\n    bitdb.Flush(true);\n    bitdb.Reset();\n}\n\n}\n\nvoid WalletTests::walletTests()\n{\n    TestSendCoins();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n\n#include <realm\/array_integer.hpp>\n#include <realm\/column.hpp>\n#include <realm\/impl\/destroy_guard.hpp>\n\nusing namespace realm;\n\n\/\/ Find max and min value, but break search if difference exceeds 'maxdiff' (in which case *min and *max is set to 0)\n\/\/ Useful for counting-sort functions\ntemplate<size_t w>\nbool ArrayInteger::minmax(size_t from, size_t to, uint64_t maxdiff, int64_t *min, int64_t *max) const\n{\n    int64_t min2;\n    int64_t max2;\n    size_t t;\n\n    max2 = Array::get<w>(from);\n    min2 = max2;\n\n    for (t = from + 1; t < to; t++) {\n        int64_t v = Array::get<w>(t);\n        \/\/ Utilizes that range test is only needed if max2 or min2 were changed\n        if (v < min2) {\n            min2 = v;\n            if (uint64_t(max2 - min2) > maxdiff)\n                break;\n        }\n        else if (v > max2) {\n            max2 = v;\n            if (uint64_t(max2 - min2) > maxdiff)\n                break;\n        }\n    }\n\n    if (t < to) {\n        *max = 0;\n        *min = 0;\n        return false;\n    }\n    else {\n        *max = max2;\n        *min = min2;\n        return true;\n    }\n}\n\n\nstd::vector<int64_t> ArrayInteger::to_vector() const\n{\n    std::vector<int64_t> v;\n    const size_t count = size();\n    for (size_t t = 0; t < count; ++t)\n        v.push_back(Array::get(t));\n    return v;\n}\n\nMemRef ArrayIntNull::create_array(Type type, bool context_flag, size_t size, value_type value, Allocator& alloc)\n{\n    int64_t val = value.value_or(0);\n    MemRef r = Array::create(type, context_flag, wtype_Bits, size + 1, val, alloc); \/\/ Throws\n    ArrayIntNull arr(alloc);\n    _impl::DestroyGuard<ArrayIntNull> dg(&arr);\n    arr.Array::init_from_mem(r);\n    if (value) {\n        if (arr.m_width == 64) {\n            int_fast64_t null_value = val ^ 1; \/\/ Just anything different from value.\n            arr.Array::set(0, null_value); \/\/ Throws\n        }\n        else {\n            arr.Array::set(0, arr.m_ubound); \/\/ Throws\n        }\n    }\n    dg.release();\n    return r;\n}\n\nvoid ArrayIntNull::init_from_ref(ref_type ref) noexcept\n{\n    REALM_ASSERT_DEBUG(ref);\n    char* header = m_alloc.translate(ref);\n    init_from_mem(MemRef{header, ref});\n}\n\nvoid ArrayIntNull::init_from_mem(MemRef mem) noexcept\n{\n    Array::init_from_mem(mem);\n\n    if (m_size == 0) {\n        \/\/ This can only happen when mem is being reused from another\n        \/\/ array (which happens when shrinking the B+tree), so we need\n        \/\/ to add the \"magic\" null value to the beginning.\n\n        \/\/ Since init_* functions are noexcept, but insert() isn't, we\n        \/\/ need to ensure that insert() will not allocate.\n        REALM_ASSERT(m_capacity != 0);\n        Array::insert(0, m_ubound);\n    }\n}\n\nvoid ArrayIntNull::init_from_parent() noexcept\n{\n    init_from_ref(get_ref_from_parent());\n}\n\nnamespace {\n    int64_t next_null_candidate(int64_t previous_candidate) {\n        uint64_t x = static_cast<uint64_t>(previous_candidate);\n        \/\/ Increment by a prime number. This guarantees that we will\n        \/\/ eventually hit every possible integer in the 2^64 range.\n        x += 0xfffffffbULL;\n        return util::from_twos_compl<int64_t>(x);\n    }\n}\n\nint_fast64_t ArrayIntNull::choose_random_null(int64_t incoming)\n{\n    \/\/ We just need any number -- it could have been `rand()`, but\n    \/\/ random numbers are hard, and we don't want to risk locking mutices\n    \/\/ or saving state. The top of the stack should be \"random enough\".\n    int64_t candidate = reinterpret_cast<int64_t>(&candidate);\n\n    while (true) {\n        candidate = next_null_candidate(candidate);\n        if (candidate == incoming) {\n            continue;\n        }\n        if (can_use_as_null(candidate)) {\n            return candidate;\n        }\n    }\n}\n\nbool ArrayIntNull::can_use_as_null(int64_t candidate)\n{\n    return find_first(candidate) == npos;\n}\n\nvoid ArrayIntNull::replace_nulls_with(int64_t new_null)\n{\n    int64_t old_null = Array::get(0);\n    Array::set(0, new_null);\n    size_t i = 1;\n    while (true) {\n        size_t found = Array::find_first(old_null, i);\n        if (found < Array::size()) {\n            Array::set(found, new_null);\n            i = found + 1;\n        }\n        else {\n            break;\n        }\n    }\n}\n\n\nvoid ArrayIntNull::avoid_null_collision(int64_t value)\n{\n    if (m_width == 64) {\n        if (value == null_value()) {\n            int_fast64_t new_null = choose_random_null(value);\n            replace_nulls_with(new_null);\n        }\n    }\n    else {\n        if (value < m_lbound || value >= m_ubound) {\n            size_t new_width = bit_width(value);\n            int64_t new_upper_bound = Array::ubound_for_width(new_width);\n\n            \/\/ We're using upper bound as magic NULL value, so we have to check\n            \/\/ explicitly that the incoming value doesn't happen to be the new\n            \/\/ NULL value. If it is, we upgrade one step further.\n            if (new_width < 64 && value == new_upper_bound) {\n                new_width = (new_width == 0 ? 1 : new_width * 2);\n                new_upper_bound = Array::ubound_for_width(new_width);\n            }\n\n            int64_t new_null;\n            if (new_width == 64) {\n                \/\/ Width will be upgraded to 64, so we need to pick a random NULL.\n                new_null = choose_random_null(value);\n            }\n            else {\n                new_null = new_upper_bound;\n            }\n\n            replace_nulls_with(new_null); \/\/ Expands array\n        }\n    }\n}\n\nvoid ArrayIntNull::find_all(IntegerColumn* result, value_type value, size_t col_offset, size_t begin, size_t end) const\n{\n    \/\/ FIXME: We can't use the fast Array::find_all here, because it would put the wrong indices\n    \/\/ in the result column. Since find_all may be invoked many times for different leaves in the\n    \/\/ B+tree with the same result column, we also can't simply adjust indices after finding them\n    \/\/ (because then the first indices would be adjusted multiple times for each subsequent leaf)\n\n    if (end == npos) {\n        end = size();\n    }\n\n    for (size_t i = begin; i < end; ++i) {\n        if (get(i) == value) {\n            result->add(col_offset + i);\n        }\n    }\n}\n\n\nvoid ArrayIntNull::get_chunk(size_t ndx, value_type res[8]) const noexcept\n{\n    int64_t tmp[8];\n    Array::get_chunk(ndx + 1, tmp);\n    int64_t null = null_value();\n    for (size_t i = 0; i < 8; ++i) {\n        res[i] = tmp[i] == null ? util::Optional<int64_t>() : tmp[i];\n    }\n}\n\nnamespace {\n\n\/\/ FIXME: Move this logic to BpTree.\nstruct ArrayIntNullLeafInserter {\n    static ref_type leaf_insert(Allocator& alloc, ArrayIntNull& self, size_t ndx, util::Optional<int64_t> value, Array::TreeInsertBase& state)\n    {\n        size_t leaf_size = self.size();\n        REALM_ASSERT_DEBUG(leaf_size <= REALM_MAX_BPNODE_SIZE);\n        if (leaf_size < ndx)\n            ndx = leaf_size;\n        if (REALM_LIKELY(leaf_size < REALM_MAX_BPNODE_SIZE)) {\n            self.insert(ndx, value); \/\/ Throws\n            return 0; \/\/ Leaf was not split\n        }\n\n        \/\/ Split leaf node\n        ArrayIntNull new_leaf(alloc);\n        new_leaf.create(Array::type_Normal); \/\/ Throws\n        if (ndx == leaf_size) {\n            new_leaf.add(value); \/\/ Throws\n            state.m_split_offset = ndx;\n        }\n        else {\n            for (size_t i = ndx; i < leaf_size; ++i) {\n                new_leaf.add(self.get(i)); \/\/ Throws\n            }\n            self.truncate(ndx); \/\/ Throws\n            self.add(value); \/\/ Throws\n            state.m_split_offset = ndx + 1;\n        }\n        state.m_split_size = leaf_size + 1;\n        return new_leaf.get_ref();\n    }\n};\n\n} \/\/ anonymous namespace\n\nref_type ArrayIntNull::bptree_leaf_insert(size_t ndx, value_type value, Array::TreeInsertBase& state)\n{\n    return ArrayIntNullLeafInserter::leaf_insert(get_alloc(), *this, ndx, value, state);\n}\n\nMemRef ArrayIntNull::slice(size_t offset, size_t size, Allocator& target_alloc) const\n{\n    \/\/ NOTE: It would be nice to consolidate this with Array::slice somehow.\n\n    REALM_ASSERT(is_attached());\n\n    Array slice(target_alloc);\n    _impl::DeepArrayDestroyGuard dg(&slice);\n    Type type = get_type();\n    slice.create(type, m_context_flag); \/\/ Throws\n    slice.add(null_value());\n\n    size_t begin = offset + 1;\n    size_t end   = offset + size + 1;\n    for (size_t i = begin; i != end; ++i) {\n        int_fast64_t value = Array::get(i);\n        slice.add(value); \/\/ Throws\n    }\n    dg.release();\n    return slice.get_mem();\n}\n\nMemRef ArrayIntNull::slice_and_clone_children(size_t offset, size_t size, Allocator& target_alloc) const\n{\n    \/\/ NOTE: It would be nice to consolidate this with Array::slice_and_clone_children somehow.\n\n    REALM_ASSERT(is_attached());\n    REALM_ASSERT(!has_refs());\n    return slice(offset, size, target_alloc);\n}\n<commit_msg>Added FIXME<commit_after>#include <vector>\n\n#include <realm\/array_integer.hpp>\n#include <realm\/column.hpp>\n#include <realm\/impl\/destroy_guard.hpp>\n\nusing namespace realm;\n\n\/\/ Find max and min value, but break search if difference exceeds 'maxdiff' (in which case *min and *max is set to 0)\n\/\/ Useful for counting-sort functions\ntemplate<size_t w>\nbool ArrayInteger::minmax(size_t from, size_t to, uint64_t maxdiff, int64_t *min, int64_t *max) const\n{\n    int64_t min2;\n    int64_t max2;\n    size_t t;\n\n    max2 = Array::get<w>(from);\n    min2 = max2;\n\n    for (t = from + 1; t < to; t++) {\n        int64_t v = Array::get<w>(t);\n        \/\/ Utilizes that range test is only needed if max2 or min2 were changed\n        if (v < min2) {\n            min2 = v;\n            if (uint64_t(max2 - min2) > maxdiff)\n                break;\n        }\n        else if (v > max2) {\n            max2 = v;\n            if (uint64_t(max2 - min2) > maxdiff)\n                break;\n        }\n    }\n\n    if (t < to) {\n        *max = 0;\n        *min = 0;\n        return false;\n    }\n    else {\n        *max = max2;\n        *min = min2;\n        return true;\n    }\n}\n\n\nstd::vector<int64_t> ArrayInteger::to_vector() const\n{\n    std::vector<int64_t> v;\n    const size_t count = size();\n    for (size_t t = 0; t < count; ++t)\n        v.push_back(Array::get(t));\n    return v;\n}\n\nMemRef ArrayIntNull::create_array(Type type, bool context_flag, size_t size, value_type value, Allocator& alloc)\n{\n    int64_t val = value.value_or(0);\n    MemRef r = Array::create(type, context_flag, wtype_Bits, size + 1, val, alloc); \/\/ Throws\n    ArrayIntNull arr(alloc);\n    _impl::DestroyGuard<ArrayIntNull> dg(&arr);\n    arr.Array::init_from_mem(r);\n    if (value) {\n        if (arr.m_width == 64) {\n            int_fast64_t null_value = val ^ 1; \/\/ Just anything different from value.\n            arr.Array::set(0, null_value); \/\/ Throws\n        }\n        else {\n            arr.Array::set(0, arr.m_ubound); \/\/ Throws\n        }\n    }\n    dg.release();\n    return r;\n}\n\nvoid ArrayIntNull::init_from_ref(ref_type ref) noexcept\n{\n    REALM_ASSERT_DEBUG(ref);\n    char* header = m_alloc.translate(ref);\n    init_from_mem(MemRef{header, ref});\n}\n\nvoid ArrayIntNull::init_from_mem(MemRef mem) noexcept\n{\n    Array::init_from_mem(mem);\n\n    if (m_size == 0) {\n        \/\/ This can only happen when mem is being reused from another\n        \/\/ array (which happens when shrinking the B+tree), so we need\n        \/\/ to add the \"magic\" null value to the beginning.\n\n        \/\/ Since init_* functions are noexcept, but insert() isn't, we\n        \/\/ need to ensure that insert() will not allocate.\n        REALM_ASSERT(m_capacity != 0);\n        Array::insert(0, m_ubound);\n    }\n}\n\nvoid ArrayIntNull::init_from_parent() noexcept\n{\n    init_from_ref(get_ref_from_parent());\n}\n\nnamespace {\n    int64_t next_null_candidate(int64_t previous_candidate) {\n        uint64_t x = static_cast<uint64_t>(previous_candidate);\n        \/\/ Increment by a prime number. This guarantees that we will\n        \/\/ eventually hit every possible integer in the 2^64 range.\n        x += 0xfffffffbULL;\n        return util::from_twos_compl<int64_t>(x);\n    }\n}\n\nint_fast64_t ArrayIntNull::choose_random_null(int64_t incoming)\n{\n    \/\/ We just need any number -- it could have been `rand()`, but\n    \/\/ random numbers are hard, and we don't want to risk locking mutices\n    \/\/ or saving state. The top of the stack should be \"random enough\".\n    int64_t candidate = reinterpret_cast<int64_t>(&candidate);\n\n    while (true) {\n        candidate = next_null_candidate(candidate);\n        if (candidate == incoming) {\n            continue;\n        }\n        if (can_use_as_null(candidate)) {\n            return candidate;\n        }\n    }\n}\n\nbool ArrayIntNull::can_use_as_null(int64_t candidate)\n{\n    return find_first(candidate) == npos;\n}\n\nvoid ArrayIntNull::replace_nulls_with(int64_t new_null)\n{\n    int64_t old_null = Array::get(0);\n    Array::set(0, new_null);\n    size_t i = 1;\n    while (true) {\n        size_t found = Array::find_first(old_null, i);\n        if (found < Array::size()) {\n            Array::set(found, new_null);\n            i = found + 1;\n        }\n        else {\n            break;\n        }\n    }\n}\n\n\nvoid ArrayIntNull::avoid_null_collision(int64_t value)\n{\n    if (m_width == 64) {\n        if (value == null_value()) {\n            int_fast64_t new_null = choose_random_null(value);\n            replace_nulls_with(new_null);\n        }\n    }\n    else {\n        if (value < m_lbound || value >= m_ubound) {\n            size_t new_width = bit_width(value);\n            int64_t new_upper_bound = Array::ubound_for_width(new_width);\n\n            \/\/ We're using upper bound as magic NULL value, so we have to check\n            \/\/ explicitly that the incoming value doesn't happen to be the new\n            \/\/ NULL value. If it is, we upgrade one step further.\n            if (new_width < 64 && value == new_upper_bound) {\n                new_width = (new_width == 0 ? 1 : new_width * 2);\n                new_upper_bound = Array::ubound_for_width(new_width);\n            }\n\n            int64_t new_null;\n            if (new_width == 64) {\n                \/\/ Width will be upgraded to 64, so we need to pick a random NULL.\n                new_null = choose_random_null(value);\n            }\n            else {\n                new_null = new_upper_bound;\n            }\n\n            replace_nulls_with(new_null); \/\/ Expands array\n        }\n    }\n}\n\nvoid ArrayIntNull::find_all(IntegerColumn* result, value_type value, size_t col_offset, size_t begin, size_t end) const\n{\n    \/\/ FIXME: We can't use the fast Array::find_all here, because it would put the wrong indices\n    \/\/ in the result column. Since find_all may be invoked many times for different leaves in the\n    \/\/ B+tree with the same result column, we also can't simply adjust indices after finding them\n    \/\/ (because then the first indices would be adjusted multiple times for each subsequent leaf)\n\n    if (end == npos) {\n        end = size();\n    }\n\n    for (size_t i = begin; i < end; ++i) {\n        if (get(i) == value) {\n            result->add(col_offset + i);\n        }\n    }\n}\n\n\nvoid ArrayIntNull::get_chunk(size_t ndx, value_type res[8]) const noexcept\n{\n    \/\/ FIXME: Optimize this\n    int64_t tmp[8];\n    Array::get_chunk(ndx + 1, tmp);\n    int64_t null = null_value();\n    for (size_t i = 0; i < 8; ++i) {\n        res[i] = tmp[i] == null ? util::Optional<int64_t>() : tmp[i];\n    }\n}\n\nnamespace {\n\n\/\/ FIXME: Move this logic to BpTree.\nstruct ArrayIntNullLeafInserter {\n    static ref_type leaf_insert(Allocator& alloc, ArrayIntNull& self, size_t ndx, util::Optional<int64_t> value, Array::TreeInsertBase& state)\n    {\n        size_t leaf_size = self.size();\n        REALM_ASSERT_DEBUG(leaf_size <= REALM_MAX_BPNODE_SIZE);\n        if (leaf_size < ndx)\n            ndx = leaf_size;\n        if (REALM_LIKELY(leaf_size < REALM_MAX_BPNODE_SIZE)) {\n            self.insert(ndx, value); \/\/ Throws\n            return 0; \/\/ Leaf was not split\n        }\n\n        \/\/ Split leaf node\n        ArrayIntNull new_leaf(alloc);\n        new_leaf.create(Array::type_Normal); \/\/ Throws\n        if (ndx == leaf_size) {\n            new_leaf.add(value); \/\/ Throws\n            state.m_split_offset = ndx;\n        }\n        else {\n            for (size_t i = ndx; i < leaf_size; ++i) {\n                new_leaf.add(self.get(i)); \/\/ Throws\n            }\n            self.truncate(ndx); \/\/ Throws\n            self.add(value); \/\/ Throws\n            state.m_split_offset = ndx + 1;\n        }\n        state.m_split_size = leaf_size + 1;\n        return new_leaf.get_ref();\n    }\n};\n\n} \/\/ anonymous namespace\n\nref_type ArrayIntNull::bptree_leaf_insert(size_t ndx, value_type value, Array::TreeInsertBase& state)\n{\n    return ArrayIntNullLeafInserter::leaf_insert(get_alloc(), *this, ndx, value, state);\n}\n\nMemRef ArrayIntNull::slice(size_t offset, size_t size, Allocator& target_alloc) const\n{\n    \/\/ NOTE: It would be nice to consolidate this with Array::slice somehow.\n\n    REALM_ASSERT(is_attached());\n\n    Array slice(target_alloc);\n    _impl::DeepArrayDestroyGuard dg(&slice);\n    Type type = get_type();\n    slice.create(type, m_context_flag); \/\/ Throws\n    slice.add(null_value());\n\n    size_t begin = offset + 1;\n    size_t end   = offset + size + 1;\n    for (size_t i = begin; i != end; ++i) {\n        int_fast64_t value = Array::get(i);\n        slice.add(value); \/\/ Throws\n    }\n    dg.release();\n    return slice.get_mem();\n}\n\nMemRef ArrayIntNull::slice_and_clone_children(size_t offset, size_t size, Allocator& target_alloc) const\n{\n    \/\/ NOTE: It would be nice to consolidate this with Array::slice_and_clone_children somehow.\n\n    REALM_ASSERT(is_attached());\n    REALM_ASSERT(!has_refs());\n    return slice(offset, size, target_alloc);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of Android File Transfer For Linux.\n    Copyright (C) 2015  Vladimir Menshakov\n\n    Android File Transfer For Linux is free software: you can redistribute\n    it and\/or modify it under the terms of the GNU General Public License\n    as published by the Free Software Foundation, either version 3 of the\n    License, or (at your option) any later version.\n\n    Android File Transfer For Linux is distributed in the hope that it will\n    be useful, but WITHOUT ANY WARRANTY; without even the implied warranty\n    of 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 Android File Transfer For Linux.\n    If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <mtp\/ByteArray.h>\n#include <mtp\/log.h>\n#include <sstream>\n\nnamespace mtp\n{\n\n\tvoid HexDump(const std::string &prefix, const ByteArray &data, bool force)\n\t{\n\t\tif (!g_debug && !force)\n\t\t\treturn;\n\n\t\tstd::stringstream ss;\n\t\tss << prefix << \"[\" << data.size() << \"]:\\n\";\n\t\tsize_t i;\n\t\tfor(i = 0; i < data.size(); ++i)\n\t\t{\n\t\t\tbool first = ((i & 0xf) == 0);\n\t\t\tbool last = ((i & 0xf) == 0x0f);\n\t\t\tif (first)\n\t\t\t\tss << hex(i, 8) << \": \";\n\n\t\t\tss << hex(data[i], 2);\n\t\t\tif (last)\n\t\t\t\tss << \"\\n\";\n\t\t\telse\n\t\t\t\tss << \" \";\n\t\t}\n\t\tif (i & 0xf)\n\t\t\tss << \"\\n\";\n\n\t\tdebug(ss.str());\n\t}\n}\n<commit_msg>fixed non-working force flag in hexdump<commit_after>\/*\n    This file is part of Android File Transfer For Linux.\n    Copyright (C) 2015  Vladimir Menshakov\n\n    Android File Transfer For Linux is free software: you can redistribute\n    it and\/or modify it under the terms of the GNU General Public License\n    as published by the Free Software Foundation, either version 3 of the\n    License, or (at your option) any later version.\n\n    Android File Transfer For Linux is distributed in the hope that it will\n    be useful, but WITHOUT ANY WARRANTY; without even the implied warranty\n    of 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 Android File Transfer For Linux.\n    If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <mtp\/ByteArray.h>\n#include <mtp\/log.h>\n#include <sstream>\n\nnamespace mtp\n{\n\n\tvoid HexDump(const std::string &prefix, const ByteArray &data, bool force)\n\t{\n\t\tif (!g_debug && !force)\n\t\t\treturn;\n\n\t\tstd::stringstream ss;\n\t\tss << prefix << \"[\" << data.size() << \"]:\\n\";\n\t\tsize_t i;\n\t\tfor(i = 0; i < data.size(); ++i)\n\t\t{\n\t\t\tbool first = ((i & 0xf) == 0);\n\t\t\tbool last = ((i & 0xf) == 0x0f);\n\t\t\tif (first)\n\t\t\t\tss << hex(i, 8) << \": \";\n\n\t\t\tss << hex(data[i], 2);\n\t\t\tif (last)\n\t\t\t\tss << \"\\n\";\n\t\t\telse\n\t\t\t\tss << \" \";\n\t\t}\n\t\tif (i & 0xf)\n\t\t\tss << \"\\n\";\n\n\t\terror(ss.str());\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sstream>\n#include <tgbot\/methods\/api.h>\n#include <tgbot\/utils\/https.h>\n#include <jsoncpp\/json\/json.h>\n#include <tgbot\/bot.h>\n\nusing namespace tgbot::methods;\nusing namespace tgbot::utils;\n\nstatic inline void allowedUpdatesToString(const std::vector<api_types::UpdateType>& updates,\n                                    std::stringstream& stream) {\n    stream << \"[\";\n    for (auto const &update : updates) {\n        switch (update) {\n            case api_types::UpdateType::MESSAGE:\n                stream << \"\\\"message\\\",\";\n                break;\n            case api_types::UpdateType::CALLBACK_QUERY:\n                stream << \"\\\"callback_query\\\",\";\n                break;\n            case api_types::UpdateType::INLINE_QUERY :\n                stream << \"\\\"inline_query\\\",\";\n                break;\n            case api_types::UpdateType::CHOSEN_INLINE_RESULT:\n                stream << \"\\\"chosen_inline_result\\\",\";\n                break;\n            case api_types::UpdateType::PRE_CHECKOUT_QUERY:\n                stream << \"\\\"pre_checkout_query\\\",\";\n                break;\n            case api_types::UpdateType::SHIPPING_QUERY:\n                stream << \"\\\"shipping_query\\\",\";\n                break;\n            case api_types::UpdateType::EDITED_CHANNEL_POST:\n                stream << \"\\\"edited_channel_post\\\",\";\n                break;\n            case api_types::UpdateType::EDITED_MESSAGE:\n                stream << \"\\\"edited_message\\\",\";\n                break;\n            case api_types::UpdateType::CHANNEL_POST:\n                stream << \"\\\"channel_post\\\",\";\n                break;\n        }\n    }\n}\n\nstatic inline void removeComma(const std::stringstream& stream, std::string& target) {\n    std::string &&req = stream.str();\n    char &endpos = req.at(req.size() - 1);\n    if (endpos == ',')\n        endpos = ']';\n    target = req;\n}\n\n\/\/Api constructors\n\n\/\/Webhook, no further action\ntgbot::methods::Api::Api(const std::string& token) :\n    baseApi(\"https:\/\/api.telegram.org\/bot\" + token)\n{}\n\n\/\/Webhook\ntgbot::methods::Api::Api(const std::string& token,\n\t\tconst std::string& url,\n\t\tconst int& maxConnections,\n\t\tconst std::vector<api_types::UpdateType>& allowedUpdates) :\n            baseApi(\"https:\/\/api.telegram.org\/bot\" + token) {\n\n        if(!setWebhook(url,maxConnections,allowedUpdates))\n            throw TelegramException(\"Unable to set webhook\");\n}\n\n\/\/Webhook with cert\ntgbot::methods::Api::Api(const std::string& token,\n\t\tconst std::string& url,\n\t\tconst std::string& certificate,\n\t\tconst int& maxConnections,\n\t\tconst std::vector<api_types::UpdateType>& allowedUpdates) :\n            baseApi(\"https:\/\/api.telegram.org\/bot\" + token) {\n\n        if(!setWebhook(url,certificate,maxConnections,allowedUpdates))\n            throw TelegramException(\"Unable to set webhook\");\n}\n\n\/\/HTTP Long polling\ntgbot::methods::Api::Api(const std::string &token,\n\t\tconst std::vector<api_types::UpdateType> &allowedUpdates,\n\t\tconst int &timeout,\n\t\tconst int &limit) :\n\t        baseApi(\"https:\/\/api.telegram.org\/bot\" + token),\n\t        currentOffset(0) {\n\n\t\tstd::stringstream fullApiRequest;\n\t\tfullApiRequest << baseApi << \"\/getUpdates?limit=\" << limit << \"&timeout=\" << timeout;\n\n\t\tif (allowedUpdates.size()) {\n            fullApiRequest << \"&allowed_updates=\";\n\t\t\tallowedUpdatesToString(allowedUpdates,fullApiRequest);\n\t\t\tremoveComma(fullApiRequest,updateApiRequest);\n\t\t} else \n\t\t\tupdateApiRequest = fullApiRequest.str();\n}\n\n\/\/\n\/\/API implementations\n\/\/\n\n\/\/getUpdates (internal usage)\nint tgbot::methods::Api::getUpdates(void *c, std::vector<api_types::Update>& updates) {\n\tstd::stringstream updatesRequest;\n\tupdatesRequest << updateApiRequest << \"&offset=\" << currentOffset;\n\n\tJson::Value rootUpdate;\n\tJson::Reader parser;\n\n\tparser.parse(utils::http::get(c, updatesRequest.str()), rootUpdate);\n\n\tif (!rootUpdate.get(\"ok\", \"\").asBool())\n\t\tthrow TelegramException(rootUpdate.get(\"description\", \"\").asCString());\n\n\tJson::Value valueUpdates = rootUpdate.get(\"result\", \"\");\n\tconst int& updatesCount = valueUpdates.size();\n\tif (!updatesCount)\n\t\treturn 0;\n\n\tfor (auto const &singleUpdate : valueUpdates)\n\t\tupdates.emplace_back(singleUpdate);\n\n\tcurrentOffset = 1 + valueUpdates[updatesCount - 1].get(\"update_id\", \"\").asInt64();\n\n\treturn updatesCount;\n}\n\n\/\/\n\/\/ Availible API Methods\n\/\/\n\n\/\/setWebhook\nbool tgbot::methods::Api::setWebhook(const std::string &url, const int &maxConnections,\n                                     const std::vector<api_types::UpdateType> &allowedUpdates) {\n    std::stringstream request;\n    request << baseApi << \"\/setWebhook?url=\" << url << \"&max_connections=\" << maxConnections;\n\n    std::string setWebhookRequest;\n    if (allowedUpdates.size()) {\n        request << \"&allowed_updates=\";\n        allowedUpdatesToString(allowedUpdates,request);\n        removeComma(request,setWebhookRequest);\n    } else\n        setWebhookRequest = request.str();\n\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,setWebhookRequest),value);\n    curl_easy_cleanup(inst);\n\n    bool isOk = value.get(\"ok\",\"\").asBool();\n    if(isOk)\n        urlWebhook = url;\n\n    return isOk;\n}\n\nbool tgbot::methods::Api::setWebhook(const std::string &url, const std::string &certificate,\n                                     const int &maxConnections,\n                                     const std::vector<api_types::UpdateType> &allowedUpdates) {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    if(!allowedUpdates.size())\n        reader.parse(http::multiPartUpload(inst, baseApi + \"\/setWebhook\", certificate, url, maxConnections),\n                     value);\n    else {\n        std::stringstream request;\n        std::string final;\n\n        allowedUpdatesToString(allowedUpdates, request);\n        removeComma(request, final);\n\n        reader.parse(http::multiPartUpload(inst, baseApi + \"\/setWebhook\", certificate, url, maxConnections, final),\n                     value);\n    }\n\n    curl_easy_cleanup(inst);\n\n    bool isOk = value.get(\"ok\",\"\").asBool();\n    if(isOk)\n        urlWebhook = url;\n\n    return isOk;\n}\n\n\/\/deleteWebhook\nbool tgbot::methods::Api::deleteWebhook() const {\n    CURL* inst = http::curlEasyInit();\n    bool isOk = (http::get(inst,baseApi + \"\/deleteWebhook\").find(\"\\\"ok\\\":true\") != std::string::npos);\n    curl_easy_cleanup(inst);\n    return isOk;\n}\n\n\/\/getWebhookInfo\napi_types::WebhookInfo tgbot::methods::Api::getWebhookInfo() const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getWebhookInfo\"), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::WebhookInfo(value.get(\"result\",\"\"));\n}\n\n\/\/getMe\napi_types::User tgbot::methods::Api::getMe() const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getMe\"), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::User(value.get(\"result\",\"\"));\n}\n\n\/\/getChat\napi_types::Chat tgbot::methods::Api::getChat(const std::string &chatId) const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getChat?chat_id=\" + chatId), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::Chat(value.get(\"result\",\"\"));\n}\n\n\/\/getChatMembersCount\nunsigned tgbot::methods::Api::getChatMembersCount(const std::string &chatId) const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getChatMembersCount?chat_id=\" + chatId), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return value.get(\"result\",\"\").asUInt();\n}\n\n\/\/getFile\napi_types::File tgbot::methods::Api::getFile(const std::string &fileId) const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getFile?file_id=\" + fileId), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::File(value.get(\"result\",\"\").asUInt());\n}\n\n\/\/getChatMember\napi_types::ChatMember tgbot::methods::Api::getChatMember(const std::string &chatId, const int &userId) const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    std::stringstream url;\n    url << baseApi << \"\/getFile?chat_id=\" << chatId << \"&user_id=\" << userId;\n\n    reader.parse(http::get(inst,url.str()), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::ChatMember(value.get(\"result\",\"\").asUInt());\n}<commit_msg>Added some methods<commit_after>#include <sstream>\n#include <tgbot\/methods\/api.h>\n#include <tgbot\/utils\/https.h>\n#include <jsoncpp\/json\/json.h>\n#include <tgbot\/bot.h>\n\nusing namespace tgbot::methods;\nusing namespace tgbot::utils;\n\nstatic inline void allowedUpdatesToString(const std::vector<api_types::UpdateType>& updates,\n                                    std::stringstream& stream) {\n    stream << \"[\";\n    for (auto const &update : updates) {\n        switch (update) {\n            case api_types::UpdateType::MESSAGE:\n                stream << \"\\\"message\\\",\";\n                break;\n            case api_types::UpdateType::CALLBACK_QUERY:\n                stream << \"\\\"callback_query\\\",\";\n                break;\n            case api_types::UpdateType::INLINE_QUERY :\n                stream << \"\\\"inline_query\\\",\";\n                break;\n            case api_types::UpdateType::CHOSEN_INLINE_RESULT:\n                stream << \"\\\"chosen_inline_result\\\",\";\n                break;\n            case api_types::UpdateType::PRE_CHECKOUT_QUERY:\n                stream << \"\\\"pre_checkout_query\\\",\";\n                break;\n            case api_types::UpdateType::SHIPPING_QUERY:\n                stream << \"\\\"shipping_query\\\",\";\n                break;\n            case api_types::UpdateType::EDITED_CHANNEL_POST:\n                stream << \"\\\"edited_channel_post\\\",\";\n                break;\n            case api_types::UpdateType::EDITED_MESSAGE:\n                stream << \"\\\"edited_message\\\",\";\n                break;\n            case api_types::UpdateType::CHANNEL_POST:\n                stream << \"\\\"channel_post\\\",\";\n                break;\n        }\n    }\n}\n\nstatic inline void removeComma(const std::stringstream& stream, std::string& target) {\n    std::string &&req = stream.str();\n    char &endpos = req.at(req.size() - 1);\n    if (endpos == ',')\n        endpos = ']';\n    target = req;\n}\n\n\/\/Api constructors\n\n\/\/Webhook, no further action\ntgbot::methods::Api::Api(const std::string& token) :\n    baseApi(\"https:\/\/api.telegram.org\/bot\" + token)\n{}\n\n\/\/Webhook\ntgbot::methods::Api::Api(const std::string& token,\n\t\tconst std::string& url,\n\t\tconst int& maxConnections,\n\t\tconst std::vector<api_types::UpdateType>& allowedUpdates) :\n            baseApi(\"https:\/\/api.telegram.org\/bot\" + token) {\n\n        if(!setWebhook(url,maxConnections,allowedUpdates))\n            throw TelegramException(\"Unable to set webhook\");\n}\n\n\/\/Webhook with cert\ntgbot::methods::Api::Api(const std::string& token,\n\t\tconst std::string& url,\n\t\tconst std::string& certificate,\n\t\tconst int& maxConnections,\n\t\tconst std::vector<api_types::UpdateType>& allowedUpdates) :\n            baseApi(\"https:\/\/api.telegram.org\/bot\" + token) {\n\n        if(!setWebhook(url,certificate,maxConnections,allowedUpdates))\n            throw TelegramException(\"Unable to set webhook\");\n}\n\n\/\/HTTP Long polling\ntgbot::methods::Api::Api(const std::string &token,\n\t\tconst std::vector<api_types::UpdateType> &allowedUpdates,\n\t\tconst int &timeout,\n\t\tconst int &limit) :\n\t        baseApi(\"https:\/\/api.telegram.org\/bot\" + token),\n\t        currentOffset(0) {\n\n\t\tstd::stringstream fullApiRequest;\n\t\tfullApiRequest << baseApi << \"\/getUpdates?limit=\" << limit << \"&timeout=\" << timeout;\n\n\t\tif (allowedUpdates.size()) {\n            fullApiRequest << \"&allowed_updates=\";\n\t\t\tallowedUpdatesToString(allowedUpdates,fullApiRequest);\n\t\t\tremoveComma(fullApiRequest,updateApiRequest);\n\t\t} else \n\t\t\tupdateApiRequest = fullApiRequest.str();\n}\n\n\/\/\n\/\/API implementations\n\/\/\n\n\/\/getUpdates (internal usage)\nint tgbot::methods::Api::getUpdates(void *c, std::vector<api_types::Update>& updates) {\n\tstd::stringstream updatesRequest;\n\tupdatesRequest << updateApiRequest << \"&offset=\" << currentOffset;\n\n\tJson::Value rootUpdate;\n\tJson::Reader parser;\n\n\tparser.parse(utils::http::get(c, updatesRequest.str()), rootUpdate);\n\n\tif (!rootUpdate.get(\"ok\", \"\").asBool())\n\t\tthrow TelegramException(rootUpdate.get(\"description\", \"\").asCString());\n\n\tJson::Value valueUpdates = rootUpdate.get(\"result\", \"\");\n\tconst int& updatesCount = valueUpdates.size();\n\tif (!updatesCount)\n\t\treturn 0;\n\n\tfor (auto const &singleUpdate : valueUpdates)\n\t\tupdates.emplace_back(singleUpdate);\n\n\tcurrentOffset = 1 + valueUpdates[updatesCount - 1].get(\"update_id\", \"\").asInt64();\n\n\treturn updatesCount;\n}\n\n\/\/\n\/\/ Availible API Methods\n\/\/\n\n\/\/setWebhook\nbool tgbot::methods::Api::setWebhook(const std::string &url, const int &maxConnections,\n                                     const std::vector<api_types::UpdateType> &allowedUpdates) {\n    std::stringstream request;\n    request << baseApi << \"\/setWebhook?url=\" << url << \"&max_connections=\" << maxConnections;\n\n    std::string setWebhookRequest;\n    if (allowedUpdates.size()) {\n        request << \"&allowed_updates=\";\n        allowedUpdatesToString(allowedUpdates,request);\n        removeComma(request,setWebhookRequest);\n    } else\n        setWebhookRequest = request.str();\n\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,setWebhookRequest),value);\n    curl_easy_cleanup(inst);\n\n    bool isOk = value.get(\"ok\",\"\").asBool();\n    if(isOk)\n        urlWebhook = url;\n\n    return isOk;\n}\n\nbool tgbot::methods::Api::setWebhook(const std::string &url, const std::string &certificate,\n                                     const int &maxConnections,\n                                     const std::vector<api_types::UpdateType> &allowedUpdates) {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    if(!allowedUpdates.size())\n        reader.parse(http::multiPartUpload(inst, baseApi + \"\/setWebhook\", certificate, url, maxConnections),\n                     value);\n    else {\n        std::stringstream request;\n        std::string final;\n\n        allowedUpdatesToString(allowedUpdates, request);\n        removeComma(request, final);\n\n        reader.parse(http::multiPartUpload(inst, baseApi + \"\/setWebhook\", certificate, url, maxConnections, final),\n                     value);\n    }\n\n    curl_easy_cleanup(inst);\n\n    bool isOk = value.get(\"ok\",\"\").asBool();\n    if(isOk)\n        urlWebhook = url;\n\n    return isOk;\n}\n\n\/\/deleteWebhook\nbool tgbot::methods::Api::deleteWebhook() const {\n    CURL* inst = http::curlEasyInit();\n    bool isOk = (http::get(inst,baseApi + \"\/deleteWebhook\").find(\"\\\"ok\\\":true\") != std::string::npos);\n    curl_easy_cleanup(inst);\n    return isOk;\n}\n\n\/\/getWebhookInfo\napi_types::WebhookInfo tgbot::methods::Api::getWebhookInfo() const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getWebhookInfo\"), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::WebhookInfo(value.get(\"result\",\"\"));\n}\n\n\/\/getMe\napi_types::User tgbot::methods::Api::getMe() const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getMe\"), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::User(value.get(\"result\",\"\"));\n}\n\n\/\/getChat\napi_types::Chat tgbot::methods::Api::getChat(const std::string &chatId) const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getChat?chat_id=\" + chatId), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::Chat(value.get(\"result\",\"\"));\n}\n\n\/\/getChatMembersCount\nunsigned tgbot::methods::Api::getChatMembersCount(const std::string &chatId) const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getChatMembersCount?chat_id=\" + chatId), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return value.get(\"result\",\"\").asUInt();\n}\n\n\/\/getFile\napi_types::File tgbot::methods::Api::getFile(const std::string &fileId) const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    reader.parse(http::get(inst,baseApi + \"\/getFile?file_id=\" + fileId), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::File(value.get(\"result\",\"\").asUInt());\n}\n\n\/\/getChatMember\napi_types::ChatMember tgbot::methods::Api::getChatMember(const std::string &chatId, const int &userId) const {\n    CURL* inst = http::curlEasyInit();\n    Json::Value value;\n    Json::Reader reader;\n\n    std::stringstream url;\n    url << baseApi << \"\/getChatMember?chat_id=\" << chatId << \"&user_id=\" << userId;\n\n    reader.parse(http::get(inst,url.str()), value);\n    curl_easy_cleanup(inst);\n\n    if(!value.get(\"ok\",\"\").asBool())\n        throw TelegramException(value.get(\"description\",\"\").asCString());\n\n    return api_types::ChatMember(value.get(\"result\",\"\").asUInt());\n}<|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include <iostream>\n#include <functional>\n#include <system_error>\n#include <vector>\n\n#include <cstring>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <libcgroup.h>\n\n#include <fcntl.h>\n#include <sched.h>\n#include <signal.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <syscall.h>\n#include <pwd.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <sys\/mount.h>\n#include <sys\/wait.h>\n\n#include \"sandbox.h\"\n#include \"utils.h\"\n#include \"cgroup.h\"\n#include \"semaphore.h\"\n#include \"pipe.h\"\n\nnamespace fs = boost::filesystem;\nusing std::string;\nusing std::vector;\nusing boost::format;\n\n\/\/ Make sure fd 0,1,2 exists.\nstatic void RedirectIO(const string &std_input, const string &std_output,\n                       const string &std_error, int nullfd)\n{\n    int inputfd, outputfd, errorfd;\n    if (std_input != \"\")\n    {\n        inputfd = Ensure(open(std_input.c_str(), O_RDONLY));\n    }\n    else\n    {\n        inputfd = nullfd;\n    }\n    Ensure(dup2(inputfd, STDIN_FILENO));\n\n    if (std_output != \"\")\n    {\n        outputfd = Ensure(open(std_output.c_str(), O_WRONLY | O_TRUNC | O_CREAT,\n                               S_IWUSR | S_IRUSR | S_IRGRP | S_IWGRP));\n    }\n    else\n    {\n        outputfd = nullfd;\n    }\n    Ensure(dup2(outputfd, STDOUT_FILENO));\n\n    if (std_error != \"\")\n    {\n        if (std_error == std_output)\n        {\n            errorfd = outputfd;\n        }\n        else\n        {\n            errorfd = Ensure(open(std_error.c_str(), O_WRONLY | O_TRUNC | O_CREAT,\n                                  S_IWUSR | S_IRUSR | S_IRGRP | S_IWGRP));\n        }\n    }\n    else\n    {\n        errorfd = nullfd;\n    }\n    Ensure(dup2(errorfd, STDERR_FILENO));\n}\n\nstruct ExecutionParameter\n{\n    const SandboxParameter &parameter;\n\n    PosixSemaphore semaphore1, semaphore2;\n    \/\/ This pipe is used to forward error message from the child process to the parent.\n    PosixPipe pipefd;\n\n    ExecutionParameter(const SandboxParameter &param, int pipeOptions) : parameter(param),\n                                                                         semaphore1(true, 0),\n                                                                         semaphore2(true, 0),\n                                                                         pipefd(pipeOptions)\n    {\n    }\n};\n\nstatic int ChildProcess(void *param_ptr)\n{\n    ExecutionParameter &execParam = *reinterpret_cast<ExecutionParameter *>(param_ptr);\n    \/\/ We obtain a full copy of parameters here. The arguments may be destoryed after some time.\n    SandboxParameter parameter = execParam.parameter;\n\n    try\n    {\n        Ensure(close(execParam.pipefd[0]));\n        passwd *newUser = nullptr;\n        if (parameter.userName != \"\")\n        {\n            \/\/ Get the user info before chroot, or it will be unable to open \/etc\/passwd\n            newUser = CheckNull(getpwnam(parameter.userName.c_str()));\n        }\n\n        int nullfd = Ensure(open(\"\/dev\/null\", O_RDWR));\n        if (parameter.redirectBeforeChroot)\n        {\n            RedirectIO(parameter.stdinRedirection, parameter.stdoutRedirection,\n                       parameter.stderrRedirection, nullfd);\n        }\n\n        \/\/ TODO: choose a better place for the temp path.\n        fs::path tempRoot(\"\/tmp\");\n        Ensure(mount(\"none\", \"\/\", NULL, MS_REC | MS_PRIVATE, NULL)); \/\/ Make root private\n        Ensure(mount(parameter.chrootDirectory.string().c_str(), tempRoot.string().c_str(), \"\", MS_BIND | MS_REC, \"\"));\n        Ensure(mount(\"\", tempRoot.string().c_str(), \"\", MS_BIND | MS_REMOUNT | MS_RDONLY | MS_REC, \"\"));\n\n        for (MountInfo &info : parameter.mounts)\n        {\n            fs::path target = tempRoot \/ info.dst;\n            Ensure(mount(info.src.string().c_str(), target.string().c_str(), \"\", MS_BIND | MS_REC, \"\"));\n            if (info.limit == 0)\n            {\n                Ensure(mount(\"\", target.string().c_str(), \"\", MS_BIND | MS_REMOUNT | MS_RDONLY | MS_REC, \"\"));\n            }\n            else if (info.limit != -1)\n            {\n                \/\/ TODO: implement.\n            }\n        }\n\n        Ensure(chroot(tempRoot.string().c_str()));\n        Ensure(chdir(parameter.workingDirectory.string().c_str()));\n\n        if (parameter.mountProc)\n        {\n            Ensure(mount(\"proc\", \"\/proc\", \"proc\", 0, NULL));\n        }\n        if (!parameter.redirectBeforeChroot)\n        {\n            RedirectIO(parameter.stdinRedirection, parameter.stdoutRedirection,\n                       parameter.stderrRedirection, nullfd);\n        }\n\n        const char *newHostname = \"BraveNewWorld\";\n        Ensure(sethostname(newHostname, strlen(newHostname)));\n\n        if (newUser != nullptr)\n        {\n            Ensure(setgid(newUser->pw_gid));\n            Ensure(setuid(newUser->pw_uid));\n        }\n\n        vector<char *> params = StringToPtr(parameter.executableParameters),\n                       envi = StringToPtr(parameter.environmentVariables);\n\n        int temp = -1;\n        \/\/ Inform the parent that no exception occurred.\n        Ensure(write(execParam.pipefd[1], &temp, sizeof(int)));\n\n        \/\/ Inform our parent that we are ready to go.\n        execParam.semaphore1.Post();\n        \/\/ Wait for parent's reply.\n        execParam.semaphore2.Wait();\n\n        Ensure(execve(parameter.executablePath.c_str(), &params[0], &envi[0]));\n\n        \/\/ If execve returns, then we meet an error.\n        raise(SIGABRT);\n        return 255;\n    }\n    catch (std::exception &err)\n    {\n        \/\/ TODO: implement error handling\n        \/\/ abort(); \/\/ This will cause segmentation fault.\n        \/\/ throw;\n        \/\/ return 222;\n\n        const char *errMessage = err.what();\n        int len = strlen(errMessage);\n        try\n        {\n            Ensure(write(execParam.pipefd[1], &len, sizeof(int)));\n            Ensure(write(execParam.pipefd[1], errMessage, len));\n            Ensure(close(execParam.pipefd[1]));\n            execParam.semaphore1.Post();\n            return 126;\n        }\n        catch (...)\n        {\n            return 125;\n        }\n    }\n    catch (...)\n    {\n        return 125;\n    }\n}\n\n\/\/ The child stack is only used before `execve`, so it does not need much space.\nconst int childStackSize = 1024 * 700;\npid_t StartSandbox(const SandboxParameter &parameter\n                   \/* ,std::function<void(pid_t)> reportPid*\/) \/\/ Let's use some fancy C++11 feature.\n{\n    pid_t container_pid = -1;\n    try\n    {\n        \/\/ char* childStack = new char[childStackSize];\n        std::vector<char> childStack(childStackSize); \/\/ I don't want to call `delete`\n\n        ExecutionParameter execParam(parameter, O_CLOEXEC | O_NONBLOCK);\n\n        container_pid = Ensure(clone(ChildProcess, &*childStack.end(),\n                                     CLONE_NEWNET | CLONE_NEWUTS | CLONE_NEWPID | CLONE_NEWNS | SIGCHLD,\n                                     const_cast<void *>(reinterpret_cast<const void *>(&execParam))));\n\n        CgroupInfo memInfo(\"memory\", parameter.cgroupName),\n            cpuInfo(\"cpuacct\", parameter.cgroupName),\n            pidInfo(\"pids\", parameter.cgroupName);\n\n        vector<CgroupInfo *> infos = {&memInfo, &cpuInfo, &pidInfo};\n        for (auto &item : infos)\n        {\n            CreateGroup(*item);\n            KillGroupMembers(*item);\n            WriteGroupProperty(*item, \"tasks\", container_pid);\n        }\n\n#define WRITE_WITH_CHECK(__where, __name, __value)                  \\\n    {                                                               \\\n        if ((__value) >= 0)                                         \\\n        {                                                           \\\n            WriteGroupProperty((__where), (__name), (__value));     \\\n        }                                                           \\\n        else                                                        \\\n        {                                                           \\\n            WriteGroupProperty((__where), (__name), string(\"max\")); \\\n        }                                                           \\\n    }\n\n        \/\/ Forcibly clear any memory usage by cache.\n        WriteGroupProperty(memInfo, \"memory.force_empty\", 0);\n        WriteGroupProperty(memInfo, \"memory.memsw.limit_in_bytes\", -1);\n        WriteGroupProperty(memInfo, \"memory.limit_in_bytes\", -1);\n        WRITE_WITH_CHECK(memInfo, \"memory.limit_in_bytes\", parameter.memoryLimit);\n        WRITE_WITH_CHECK(memInfo, \"memory.memsw.limit_in_bytes\", parameter.memoryLimit);\n        WRITE_WITH_CHECK(pidInfo, \"pids.max\", parameter.processLimit);\n\n        \/\/ Wait for at most 100ms. If the child process hasn't posted the semaphore,\n        \/\/ We will assume that the child has already dead.\n        bool waitResult = execParam.semaphore1.TimedWait(100);\n\n        int errLen, bytesRead = read(execParam.pipefd[0], &errLen, sizeof(int));\n        \/\/ Child will be killed once the error has been thrown.\n        if (!waitResult || bytesRead == 0 || bytesRead == -1)\n        {\n            \/\/ No information available.\n            throw std::runtime_error(\"The child process has exited unexpectedly.\");\n        }\n        else if (errLen != -1) \/\/ -1 indicates OK.\n        {\n            vector<char> buf(errLen);\n            Ensure(read(execParam.pipefd[0], &*buf.begin(), errLen));\n            string errstr(buf.begin(), buf.end());\n            throw std::runtime_error((format(\"The child process has reported the following error: %1%\") % errstr).str());\n        }\n\n        \/\/ Clear usage stats.\n        WriteGroupProperty(memInfo, \"memory.memsw.max_usage_in_bytes\", 0);\n        WriteGroupProperty(cpuInfo, \"cpuacct.usage\", 0);\n\n        \/\/ Continue the child.\n        execParam.semaphore2.Post();\n\n        \/\/ Wait for 1ms to prevent the child stack deallocated before execve.\n        \/\/ TODO: Find a better way to handle this.\n        usleep(1000);\n\n        return container_pid;\n    }\n    catch (std::exception &ex)\n    {\n        \/\/ Do the cleanups; we don't care whether these operations are successful.\n        if (container_pid != -1)\n        {\n            (void)kill(container_pid, SIGKILL);\n            (void)waitpid(container_pid, NULL, WNOHANG);\n        }\n        throw;\n    }\n}\n\nExecutionResult\nSBWaitForProcess(pid_t pid)\n{\n    ExecutionResult result;\n    int status;\n    Ensure(waitpid(pid, &status, 0));\n    if (WIFEXITED(status))\n    {\n        result.Status = EXITED;\n        result.Code = WEXITSTATUS(status);\n    }\n    else if (WIFSIGNALED(status))\n    {\n        result.Status = SIGNALED;\n        result.Code = WTERMSIG(status);\n    }\n    return result;\n}<commit_msg>Fix potential execution freeze on `setuid'<commit_after>#include <string>\n#include <iostream>\n#include <functional>\n#include <system_error>\n#include <vector>\n\n#include <cstring>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <libcgroup.h>\n\n#include <fcntl.h>\n#include <sched.h>\n#include <signal.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <syscall.h>\n#include <pwd.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <sys\/mount.h>\n#include <sys\/wait.h>\n\n#include \"sandbox.h\"\n#include \"utils.h\"\n#include \"cgroup.h\"\n#include \"semaphore.h\"\n#include \"pipe.h\"\n\nnamespace fs = boost::filesystem;\nusing std::string;\nusing std::vector;\nusing boost::format;\n\n\/\/ Make sure fd 0,1,2 exists.\nstatic void RedirectIO(const string &std_input, const string &std_output,\n                       const string &std_error, int nullfd)\n{\n    int inputfd, outputfd, errorfd;\n    if (std_input != \"\")\n    {\n        inputfd = Ensure(open(std_input.c_str(), O_RDONLY));\n    }\n    else\n    {\n        inputfd = nullfd;\n    }\n    Ensure(dup2(inputfd, STDIN_FILENO));\n\n    if (std_output != \"\")\n    {\n        outputfd = Ensure(open(std_output.c_str(), O_WRONLY | O_TRUNC | O_CREAT,\n                               S_IWUSR | S_IRUSR | S_IRGRP | S_IWGRP));\n    }\n    else\n    {\n        outputfd = nullfd;\n    }\n    Ensure(dup2(outputfd, STDOUT_FILENO));\n\n    if (std_error != \"\")\n    {\n        if (std_error == std_output)\n        {\n            errorfd = outputfd;\n        }\n        else\n        {\n            errorfd = Ensure(open(std_error.c_str(), O_WRONLY | O_TRUNC | O_CREAT,\n                                  S_IWUSR | S_IRUSR | S_IRGRP | S_IWGRP));\n        }\n    }\n    else\n    {\n        errorfd = nullfd;\n    }\n    Ensure(dup2(errorfd, STDERR_FILENO));\n}\n\nstruct ExecutionParameter\n{\n    const SandboxParameter &parameter;\n\n    PosixSemaphore semaphore1, semaphore2;\n    \/\/ This pipe is used to forward error message from the child process to the parent.\n    PosixPipe pipefd;\n\n    ExecutionParameter(const SandboxParameter &param, int pipeOptions) : parameter(param),\n                                                                         semaphore1(true, 0),\n                                                                         semaphore2(true, 0),\n                                                                         pipefd(pipeOptions)\n    {\n    }\n};\n\nstatic int ChildProcess(void *param_ptr)\n{\n    ExecutionParameter &execParam = *reinterpret_cast<ExecutionParameter *>(param_ptr);\n    \/\/ We obtain a full copy of parameters here. The arguments may be destoryed after some time.\n    SandboxParameter parameter = execParam.parameter;\n\n    try\n    {\n        Ensure(close(execParam.pipefd[0]));\n        passwd *newUser = nullptr;\n        if (parameter.userName != \"\")\n        {\n            \/\/ Get the user info before chroot, or it will be unable to open \/etc\/passwd\n            newUser = CheckNull(getpwnam(parameter.userName.c_str()));\n        }\n\n        int nullfd = Ensure(open(\"\/dev\/null\", O_RDWR));\n        if (parameter.redirectBeforeChroot)\n        {\n            RedirectIO(parameter.stdinRedirection, parameter.stdoutRedirection,\n                       parameter.stderrRedirection, nullfd);\n        }\n\n        \/\/ TODO: choose a better place for the temp path.\n        fs::path tempRoot(\"\/tmp\");\n        Ensure(mount(\"none\", \"\/\", NULL, MS_REC | MS_PRIVATE, NULL)); \/\/ Make root private\n        Ensure(mount(parameter.chrootDirectory.string().c_str(), tempRoot.string().c_str(), \"\", MS_BIND | MS_REC, \"\"));\n        Ensure(mount(\"\", tempRoot.string().c_str(), \"\", MS_BIND | MS_REMOUNT | MS_RDONLY | MS_REC, \"\"));\n\n        for (MountInfo &info : parameter.mounts)\n        {\n            fs::path target = tempRoot \/ info.dst;\n            Ensure(mount(info.src.string().c_str(), target.string().c_str(), \"\", MS_BIND | MS_REC, \"\"));\n            if (info.limit == 0)\n            {\n                Ensure(mount(\"\", target.string().c_str(), \"\", MS_BIND | MS_REMOUNT | MS_RDONLY | MS_REC, \"\"));\n            }\n            else if (info.limit != -1)\n            {\n                \/\/ TODO: implement.\n            }\n        }\n\n        Ensure(chroot(tempRoot.string().c_str()));\n        Ensure(chdir(parameter.workingDirectory.string().c_str()));\n\n        if (parameter.mountProc)\n        {\n            Ensure(mount(\"proc\", \"\/proc\", \"proc\", 0, NULL));\n        }\n        if (!parameter.redirectBeforeChroot)\n        {\n            RedirectIO(parameter.stdinRedirection, parameter.stdoutRedirection,\n                       parameter.stderrRedirection, nullfd);\n        }\n\n        const char *newHostname = \"BraveNewWorld\";\n        Ensure(sethostname(newHostname, strlen(newHostname)));\n\n        if (newUser != nullptr)\n        {\n            Ensure(syscall(SYS_setgid, newUser->pw_gid));\n            Ensure(syscall(SYS_setuid, newUser->pw_uid));\n        }\n\n        vector<char *> params = StringToPtr(parameter.executableParameters),\n                       envi = StringToPtr(parameter.environmentVariables);\n\n        int temp = -1;\n        \/\/ Inform the parent that no exception occurred.\n        Ensure(write(execParam.pipefd[1], &temp, sizeof(int)));\n\n        \/\/ Inform our parent that we are ready to go.\n        execParam.semaphore1.Post();\n        \/\/ Wait for parent's reply.\n        execParam.semaphore2.Wait();\n\n        Ensure(execve(parameter.executablePath.c_str(), &params[0], &envi[0]));\n\n        \/\/ If execve returns, then we meet an error.\n        raise(SIGABRT);\n        return 255;\n    }\n    catch (std::exception &err)\n    {\n        \/\/ TODO: implement error handling\n        \/\/ abort(); \/\/ This will cause segmentation fault.\n        \/\/ throw;\n        \/\/ return 222;\n\n        const char *errMessage = err.what();\n        int len = strlen(errMessage);\n        try\n        {\n            Ensure(write(execParam.pipefd[1], &len, sizeof(int)));\n            Ensure(write(execParam.pipefd[1], errMessage, len));\n            Ensure(close(execParam.pipefd[1]));\n            execParam.semaphore1.Post();\n            return 126;\n        }\n        catch (...)\n        {\n            return 125;\n        }\n    }\n    catch (...)\n    {\n        return 125;\n    }\n}\n\n\/\/ The child stack is only used before `execve`, so it does not need much space.\nconst int childStackSize = 1024 * 700;\npid_t StartSandbox(const SandboxParameter &parameter\n                   \/* ,std::function<void(pid_t)> reportPid*\/) \/\/ Let's use some fancy C++11 feature.\n{\n    pid_t container_pid = -1;\n    try\n    {\n        \/\/ char* childStack = new char[childStackSize];\n        std::vector<char> childStack(childStackSize); \/\/ I don't want to call `delete`\n\n        ExecutionParameter execParam(parameter, O_CLOEXEC | O_NONBLOCK);\n\n        container_pid = Ensure(clone(ChildProcess, &*childStack.end(),\n                                     CLONE_NEWNET | CLONE_NEWUTS | CLONE_NEWPID | CLONE_NEWNS | SIGCHLD,\n                                     const_cast<void *>(reinterpret_cast<const void *>(&execParam))));\n\n        CgroupInfo memInfo(\"memory\", parameter.cgroupName),\n            cpuInfo(\"cpuacct\", parameter.cgroupName),\n            pidInfo(\"pids\", parameter.cgroupName);\n\n        vector<CgroupInfo *> infos = {&memInfo, &cpuInfo, &pidInfo};\n        for (auto &item : infos)\n        {\n            CreateGroup(*item);\n            KillGroupMembers(*item);\n            WriteGroupProperty(*item, \"tasks\", container_pid);\n        }\n\n#define WRITE_WITH_CHECK(__where, __name, __value)                  \\\n    {                                                               \\\n        if ((__value) >= 0)                                         \\\n        {                                                           \\\n            WriteGroupProperty((__where), (__name), (__value));     \\\n        }                                                           \\\n        else                                                        \\\n        {                                                           \\\n            WriteGroupProperty((__where), (__name), string(\"max\")); \\\n        }                                                           \\\n    }\n\n        \/\/ Forcibly clear any memory usage by cache.\n        WriteGroupProperty(memInfo, \"memory.force_empty\", 0);\n        WriteGroupProperty(memInfo, \"memory.memsw.limit_in_bytes\", -1);\n        WriteGroupProperty(memInfo, \"memory.limit_in_bytes\", -1);\n        WRITE_WITH_CHECK(memInfo, \"memory.limit_in_bytes\", parameter.memoryLimit);\n        WRITE_WITH_CHECK(memInfo, \"memory.memsw.limit_in_bytes\", parameter.memoryLimit);\n        WRITE_WITH_CHECK(pidInfo, \"pids.max\", parameter.processLimit);\n\n        \/\/ Wait for at most 100ms. If the child process hasn't posted the semaphore,\n        \/\/ We will assume that the child has already dead.\n        bool waitResult = execParam.semaphore1.TimedWait(100);\n\n        int errLen, bytesRead = read(execParam.pipefd[0], &errLen, sizeof(int));\n        \/\/ Child will be killed once the error has been thrown.\n        if (!waitResult || bytesRead == 0 || bytesRead == -1)\n        {\n            \/\/ No information available.\n            throw std::runtime_error(\"The child process has exited unexpectedly.\");\n        }\n        else if (errLen != -1) \/\/ -1 indicates OK.\n        {\n            vector<char> buf(errLen);\n            Ensure(read(execParam.pipefd[0], &*buf.begin(), errLen));\n            string errstr(buf.begin(), buf.end());\n            throw std::runtime_error((format(\"The child process has reported the following error: %1%\") % errstr).str());\n        }\n\n        \/\/ Clear usage stats.\n        WriteGroupProperty(memInfo, \"memory.memsw.max_usage_in_bytes\", 0);\n        WriteGroupProperty(cpuInfo, \"cpuacct.usage\", 0);\n\n        \/\/ Continue the child.\n        execParam.semaphore2.Post();\n\n        \/\/ Wait for 1ms to prevent the child stack deallocated before execve.\n        \/\/ TODO: Find a better way to handle this.\n        usleep(1000);\n\n        return container_pid;\n    }\n    catch (std::exception &ex)\n    {\n        \/\/ Do the cleanups; we don't care whether these operations are successful.\n        if (container_pid != -1)\n        {\n            (void)kill(container_pid, SIGKILL);\n            (void)waitpid(container_pid, NULL, WNOHANG);\n        }\n        throw;\n    }\n}\n\nExecutionResult\nSBWaitForProcess(pid_t pid)\n{\n    ExecutionResult result;\n    int status;\n    Ensure(waitpid(pid, &status, 0));\n    if (WIFEXITED(status))\n    {\n        result.Status = EXITED;\n        result.Code = WEXITSTATUS(status);\n    }\n    else if (WIFSIGNALED(status))\n    {\n        result.Status = SIGNALED;\n        result.Code = WTERMSIG(status);\n    }\n    return result;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of signon\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Alberto Mardegan <alberto.mardegan@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n *\/\n\n#include \"pluginproxy.h\"\n\n#include <sys\/types.h>\n#include <pwd.h>\n\n#include <QStringList>\n#include <QThreadStorage>\n#include <QThread>\n#include <QDataStream>\n\n#include \"signond-common.h\"\n#include \"SignOn\/uisessiondata_priv.h\"\n#include \"SignOn\/signonplugincommon.h\"\n\n\/*\n *   TODO: remove the \"SignOn\/authpluginif.h\" include below after the removal\n *         of the deprecated error handling (needed here only for the deprecated\n *         AuthPluginError::PLUGIN_ERROR_GENERAL).\n *\/\n#include \"SignOn\/authpluginif.h\"\n\n\/\/TODO get this from config\n#define REMOTEPLUGIN_BIN_PATH QLatin1String(\"\/usr\/bin\/signonpluginprocess\")\n#define PLUGINPROCESS_START_TIMEOUT 5000\n#define PLUGINPROCESS_STOP_TIMEOUT 1000\n\nnamespace SignonDaemonNS {\n\n    \/* ---------------------- PluginProcess ---------------------- *\/\n\n    PluginProcess::PluginProcess(QObject *parent) : QProcess(parent)\n    {\n    }\n\n    PluginProcess::~PluginProcess()\n    {\n    }\n\n    void PluginProcess::setupChildProcess()\n    {\n        \/\/ Drop all root privileges in the child process and switch to signon user\n#ifndef NO_SIGNON_USER\n        \/\/get uid and gid\n        struct passwd *passwdRecord = getpwnam(\"signon\");\n        if ( !passwdRecord ){\n            fprintf(stderr, \"failed to get user: signon\\n\");\n            emit QProcess::finished(2, QProcess::NormalExit);\n            exit(2);\n        }\n#ifdef SIGNOND_TRACE\n        \/\/this is run in remote plugin process, so trace should go to stderr\n        fprintf(stderr, \"got user: %s with uid: %d\\n\", passwdRecord->pw_name, passwdRecord->pw_uid);\n#endif\n        if (( ::setgid(passwdRecord->pw_gid))\n                || (::setuid(passwdRecord->pw_uid))\n                || (::getuid() != passwdRecord->pw_uid)\n                ) {\n            fprintf(stderr, \"failed to set user: %s with uid: %d\", passwdRecord->pw_name, passwdRecord->pw_uid);\n            emit QProcess::finished(2, QProcess::NormalExit);\n            exit(2);\n        }\n #endif\n    }\n\n    \/* ---------------------- PluginProxy ---------------------- *\/\n\n    PluginProxy::PluginProxy(QString type, QObject *parent)\n            : QObject(parent)\n    {\n        TRACE();\n\n        m_type = type;\n        m_isProcessing = false;\n        m_isResultObtained = false;\n        m_currentResultOperation = -1;\n        m_process = new PluginProcess(this);\n\n        connect(m_process, SIGNAL(readyReadStandardError()), this, SLOT(onReadStandardError()));\n\n        \/*\n         * TODO: some error handling should be added here, at least remove of current\n         * request data from the top of the queue and reply an error code\n         * *\/\n        connect(m_process, SIGNAL(finished(int, QProcess::ExitStatus)), this, SLOT(onExit(int, QProcess::ExitStatus)));\n        connect(m_process, SIGNAL(error(QProcess::ProcessError)), this, SLOT(onError(QProcess::ProcessError)));\n\n        m_blobIOHandler = new BlobIOHandler(m_process, m_process, this);\n\n        connect(m_blobIOHandler,\n                SIGNAL(dataReceived(const QVariantMap &)),\n                this,\n                SLOT(sessionDataReceived(const QVariantMap &)));\n\n        QSocketNotifier *readNotifier =\n            new QSocketNotifier(STDIN_FILENO, QSocketNotifier::Read, this);\n\n        readNotifier->setEnabled(false);\n        m_blobIOHandler->setReadChannelSocketNotifier(readNotifier);\n    }\n\n    PluginProxy::~PluginProxy()\n    {\n        if (m_process != NULL &&\n            m_process->state() != QProcess::NotRunning)\n        {\n            if (m_isProcessing)\n                cancel();\n\n            stop();\n\n            if (!m_process->waitForFinished(PLUGINPROCESS_STOP_TIMEOUT)) {\n                qCritical() << \"The signon plugin does not react on demand to stop: need to kill it!!!\";\n                m_process->kill();\n\n                if (!m_process->waitForFinished(PLUGINPROCESS_STOP_TIMEOUT))\n                {\n                    if (m_process->pid()) {\n                        qCritical() << \"The signon plugin seems to ignore kill(), killing it from command line\";\n                        QString killProcessCommand(QString::fromLatin1(\"kill -9 %1\").arg(m_process->pid()));\n                        QProcess::execute(killProcessCommand);\n                    }\n                }\n            }\n        }\n    }\n\n    PluginProxy* PluginProxy::createNewPluginProxy(const QString &type)\n    {\n        PluginProxy *pp = new PluginProxy(type);\n\n        QStringList args = QStringList() << pp->m_type;\n        pp->m_process->start(REMOTEPLUGIN_BIN_PATH, args);\n\n        QByteArray tmp;\n\n        if (!pp->waitForStarted(PLUGINPROCESS_START_TIMEOUT)) {\n            TRACE() << \"The process cannot be started\";\n            delete pp;\n            return NULL;\n        }\n\n        if (!pp->readOnReady(tmp, PLUGINPROCESS_START_TIMEOUT)) {\n            TRACE() << \"The process cannot load plugin\";\n            delete pp;\n            return NULL;\n        }\n\n        pp->m_type = pp->queryType();\n        pp->m_mechanisms = pp->queryMechanisms();\n\n        connect(pp->m_process, SIGNAL(readyRead()), pp, SLOT(onReadStandardOutput()));\n\n        TRACE() << \"The process is started\";\n        return pp;\n    }\n\n   bool PluginProxy::process(const QString &cancelKey, const QVariantMap &inData, const QString &mechanism)\n   {\n        if (!restartIfRequired())\n            return false;\n\n        m_isResultObtained = false;\n        m_cancelKey = cancelKey;\n        QVariant value = inData.value(SSOUI_KEY_UIPOLICY);\n        m_uiPolicy = value.toInt();\n\n        QDataStream in(m_process);\n        in << (quint32)PLUGIN_OP_PROCESS;\n        in << mechanism;\n\n        m_blobIOHandler->sendData(inData);\n\n        m_isProcessing = true;\n        return true;\n    }\n\n   bool PluginProxy::processUi(const QString &cancelKey, const QVariantMap &inData)\n   {\n        TRACE();\n\n        if (!restartIfRequired())\n            return false;\n\n        m_cancelKey = cancelKey;\n\n        QDataStream in(m_process);\n\n        in << (quint32)PLUGIN_OP_PROCESS_UI;\n\n        m_blobIOHandler->sendData(inData);\n\n        m_isProcessing = true;\n\n        return true;\n    }\n\n   bool PluginProxy::processRefresh(const QString &cancelKey, const QVariantMap &inData)\n   {\n        TRACE();\n\n        if (!restartIfRequired())\n            return false;\n\n        m_cancelKey = cancelKey;\n\n        QDataStream in(m_process);\n\n        in << (quint32)PLUGIN_OP_REFRESH;\n\n        m_blobIOHandler->sendData(inData);\n\n        m_isProcessing = true;\n\n        return true;\n    }\n\n   void PluginProxy::cancel()\n   {\n       TRACE();\n       QDataStream in(m_process);\n       in << (quint32)PLUGIN_OP_CANCEL;\n    }\n\n   void PluginProxy::stop()\n   {\n       TRACE();\n       QDataStream in(m_process);\n       in << (quint32)PLUGIN_OP_STOP;\n    }\n\n    bool PluginProxy::readOnReady(QByteArray &buffer, int timeout)\n    {\n        bool ready = m_process->waitForReadyRead(timeout);\n\n        if (ready) {\n            if (!m_process->bytesAvailable())\n                return false;\n\n            while (m_process->bytesAvailable())\n                buffer += m_process->readAllStandardOutput();\n        }\n\n        return ready;\n    }\n\n    bool PluginProxy::isProcessing()\n    {\n        return m_isProcessing;\n    }\n\n    void PluginProxy::blobIOError()\n    {\n        TRACE();\n        disconnect(m_blobIOHandler, SIGNAL(error()), this, SLOT(blobIOError()));\n        stop();\n\n        connect(m_process, SIGNAL(readyRead()), this, SLOT(onReadStandardOutput()));\n        emit processError(\n            m_cancelKey,\n            (int)Error::InternalServer,\n            QLatin1String(\"Failed to I\/O session data to\/from the authentication plugin.\"));\n    }\n\n    bool PluginProxy::isResultOperationCodeValid(const int opCode) const\n    {\n        if (opCode == PLUGIN_RESPONSE_RESULT\n            || opCode == PLUGIN_RESPONSE_STORE\n            || opCode == PLUGIN_RESPONSE_ERROR\n            || opCode == PLUGIN_RESPONSE_SIGNAL\n            || opCode == PLUGIN_RESPONSE_UI\n            || opCode == PLUGIN_RESPONSE_REFRESHED) return true;\n\n        return false;\n    }\n\n    void PluginProxy::onReadStandardOutput()\n    {\n        disconnect(m_process, SIGNAL(readyRead()), this, SLOT(onReadStandardOutput()));\n\n        if (!m_process->bytesAvailable()) {\n            qCritical() << \"No information available on process\";\n            m_isProcessing = false;\n            emit processError(m_cancelKey, Error::InternalServer, QString());\n            return;\n        }\n\n        QDataStream reader(m_process);\n        reader >> m_currentResultOperation;\n\n        TRACE() << \"PROXY RESULT OPERATION:\" << m_currentResultOperation;\n\n        if (!isResultOperationCodeValid(m_currentResultOperation)) {\n            TRACE() << \"Unknown operation code - skipping.\";\n\n            \/\/flushing the stdin channel\n            Q_UNUSED(m_process->readAllStandardOutput());\n\n            connect(m_process, SIGNAL(readyRead()), this, SLOT(onReadStandardOutput()));\n            return;\n        }\n\n        if (m_currentResultOperation != PLUGIN_RESPONSE_SIGNAL\n            && m_currentResultOperation != PLUGIN_RESPONSE_ERROR) {\n\n            connect(m_blobIOHandler, SIGNAL(error()),\n                    this, SLOT(blobIOError()));\n\n            int expectedDataSize = 0;\n            reader >> expectedDataSize;\n            TRACE() << \"PROXY EXPECTED DATA SIZE:\" << expectedDataSize;\n\n            m_blobIOHandler->receiveData(expectedDataSize);\n        } else {\n            handlePluginResponse(m_currentResultOperation);\n        }\n    }\n\n    void PluginProxy::sessionDataReceived(const QVariantMap &map)\n    {\n        handlePluginResponse(m_currentResultOperation, map);\n    }\n\n    void PluginProxy::handlePluginResponse(const quint32 resultOperation,\n                                           const QVariantMap &sessionDataMap)\n    {\n        TRACE() << resultOperation;\n\n        if (resultOperation == PLUGIN_RESPONSE_RESULT) {\n            TRACE() << \"PLUGIN_RESPONSE_RESULT\";\n\n            m_isProcessing = false;\n\n            if (!m_isResultObtained)\n                emit processResultReply(m_cancelKey, sessionDataMap);\n            else\n                BLAME() << \"Unexpected plugin response: \";\n\n            m_isResultObtained = true;\n        } else if (resultOperation == PLUGIN_RESPONSE_STORE) {\n            TRACE() << \"PLUGIN_RESPONSE_STORE\";\n\n            if (!m_isResultObtained)\n                emit processStore(m_cancelKey, sessionDataMap);\n            else\n                BLAME() << \"Unexpected plugin store: \";\n\n        } else if (resultOperation == PLUGIN_RESPONSE_UI) {\n            TRACE() << \"PLUGIN_RESPONSE_UI\";\n\n            if (!m_isResultObtained) {\n                bool allowed = true;\n\n                if (m_uiPolicy == NoUserInteractionPolicy)\n                    allowed = false;\n\n                if (m_uiPolicy == ValidationPolicy) {\n                    bool credentialsQueried =\n                        (sessionDataMap.contains(SSOUI_KEY_QUERYUSERNAME)\n                        || sessionDataMap.contains(SSOUI_KEY_QUERYPASSWORD));\n\n                    bool captchaQueried  =\n                        (sessionDataMap.contains(SSOUI_KEY_CAPTCHAIMG)\n                         || sessionDataMap.contains(SSOUI_KEY_CAPTCHAURL));\n\n                    if (credentialsQueried && !captchaQueried)\n                        allowed = false;\n                }\n\n                if (!allowed) {\n                    \/\/set error and return;\n                    TRACE() << \"ui policy prevented ui launch\";\n\n                    QVariantMap nonConstMap = sessionDataMap;\n                    nonConstMap.insert(SSOUI_KEY_ERROR, QUERY_ERROR_FORBIDDEN);\n                    processUi(m_cancelKey, nonConstMap);\n                } else {\n                    TRACE() << \"open ui\";\n                    emit processUiRequest(m_cancelKey, sessionDataMap);\n                }\n            } else {\n                BLAME() << \"Unexpected plugin ui response: \";\n            }\n        } else if (resultOperation == PLUGIN_RESPONSE_REFRESHED) {\n            TRACE() << \"PLUGIN_RESPONSE_REFRESHED\";\n\n            if (!m_isResultObtained)\n                emit processRefreshRequest(m_cancelKey, sessionDataMap);\n            else\n                BLAME() << \"Unexpected plugin ui response: \";\n        } else if (resultOperation == PLUGIN_RESPONSE_ERROR) {\n            TRACE() << \"PLUGIN_RESPONSE_ERROR\";\n            quint32 err;\n            QString errorMessage;\n\n            QDataStream stream(m_process);\n            stream >> err;\n            stream >> errorMessage;\n            m_isProcessing = false;\n\n            if (!m_isResultObtained)\n                emit processError(m_cancelKey, (int)err, errorMessage);\n            else\n                BLAME() << \"Unexpected plugin error: \" << errorMessage;\n\n            m_isResultObtained = true;\n        } else if (resultOperation == PLUGIN_RESPONSE_SIGNAL) {\n            TRACE() << \"PLUGIN_RESPONSE_SIGNAL\";\n            quint32 state;\n            QString message;\n\n            QDataStream stream(m_process);\n            stream >> state;\n            stream >> message;\n\n            if (!m_isResultObtained)\n                emit stateChanged(m_cancelKey, (int)state, message);\n            else\n                BLAME() << \"Unexpected plugin signal: \" << state << message;\n        }\n\n        connect(m_process, SIGNAL(readyRead()), this, SLOT(onReadStandardOutput()));\n    }\n\n    void PluginProxy::onReadStandardError()\n    {\n        QString ba = QString::fromLatin1(m_process->readAllStandardError());\n    }\n\n    void PluginProxy::onExit(int exitCode, QProcess::ExitStatus exitStatus)\n    {\n        TRACE() << \"Plugin process exit with code \" << exitCode << \" : \" << exitStatus;\n\n        if (m_isProcessing || exitStatus == QProcess::CrashExit) {\n            qCritical() << \"Challenge produces CRASH!\";\n            emit processError(m_cancelKey, Error::InternalServer, QLatin1String(\"plugin processed crashed\"));\n        }\n        if (exitCode == 2) {\n            TRACE() << \"plugin process terminated because cannot change user\";\n        }\n\n        m_isProcessing = false;\n    }\n\n    void PluginProxy::onError(QProcess::ProcessError err)\n    {\n        TRACE() << \"Error: \" << err;\n    }\n\n    QString PluginProxy::queryType()\n    {\n        TRACE();\n\n        if (!restartIfRequired())\n            return QString();\n\n        QDataStream ds(m_process);\n        ds << (quint32)PLUGIN_OP_TYPE;\n\n        QByteArray typeBa, buffer;\n        bool result;\n\n        if ((result = readOnReady(buffer, PLUGINPROCESS_START_TIMEOUT))) {\n            QDataStream out(buffer);\n            out >> typeBa;\n        } else\n            qCritical(\"PluginProxy returned NULL result\");\n\n        return QString::fromLatin1(typeBa);\n    }\n\n    QStringList PluginProxy::queryMechanisms()\n    {\n        TRACE();\n\n        if (!restartIfRequired())\n            return QStringList();\n\n        QDataStream in(m_process);\n        in << (quint32)PLUGIN_OP_MECHANISMS;\n\n        QByteArray buffer;\n        QStringList strList;\n        bool result;\n\n        if ((result = readOnReady(buffer, PLUGINPROCESS_START_TIMEOUT))) {\n            QVariant mechanismsVar;\n            QDataStream out(buffer);\n\n            out >> mechanismsVar;\n            QVariantList varList = mechanismsVar.toList();\n\n            for (int i = 0; i < varList.count(); i++)\n                    strList << varList.at(i).toString();\n\n            TRACE() << strList;\n        } else\n            qCritical(\"PluginProxy returned NULL result\");\n\n        return strList;\n    }\n\n    bool PluginProxy::waitForStarted(int timeout)\n    {\n        return m_process->waitForStarted(timeout);\n    }\n\n    bool PluginProxy::waitForFinished(int timeout)\n    {\n        return m_process->waitForFinished(timeout);\n    }\n\n    bool PluginProxy::restartIfRequired()\n    {\n        if (m_process->state() == QProcess::NotRunning) {\n            TRACE() << \"RESTART REQUIRED\";\n            m_process->start(REMOTEPLUGIN_BIN_PATH, QStringList(m_type));\n\n            QByteArray tmp;\n            if (!waitForStarted(PLUGINPROCESS_START_TIMEOUT) || !readOnReady(tmp, PLUGINPROCESS_START_TIMEOUT))\n                return false;\n        }\n        return true;\n    }\n\n} \/\/namespace SignonDaemonNS\n<commit_msg>export SSO_DEBUG=1 when starting the plugins<commit_after>\/*\n * This file is part of signon\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Alberto Mardegan <alberto.mardegan@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n *\/\n\n#include \"pluginproxy.h\"\n\n#include <sys\/types.h>\n#include <pwd.h>\n\n#include <QStringList>\n#include <QThreadStorage>\n#include <QThread>\n#include <QDataStream>\n\n#include \"signond-common.h\"\n#include \"SignOn\/uisessiondata_priv.h\"\n#include \"SignOn\/signonplugincommon.h\"\n\n\/*\n *   TODO: remove the \"SignOn\/authpluginif.h\" include below after the removal\n *         of the deprecated error handling (needed here only for the deprecated\n *         AuthPluginError::PLUGIN_ERROR_GENERAL).\n *\/\n#include \"SignOn\/authpluginif.h\"\n\n\/\/TODO get this from config\n#define REMOTEPLUGIN_BIN_PATH QLatin1String(\"\/usr\/bin\/signonpluginprocess\")\n#define PLUGINPROCESS_START_TIMEOUT 5000\n#define PLUGINPROCESS_STOP_TIMEOUT 1000\n\nnamespace SignonDaemonNS {\n\n    \/* ---------------------- PluginProcess ---------------------- *\/\n\n    PluginProcess::PluginProcess(QObject *parent) : QProcess(parent)\n    {\n    }\n\n    PluginProcess::~PluginProcess()\n    {\n    }\n\n    void PluginProcess::setupChildProcess()\n    {\n        \/\/ Drop all root privileges in the child process and switch to signon user\n#ifndef NO_SIGNON_USER\n        \/\/get uid and gid\n        struct passwd *passwdRecord = getpwnam(\"signon\");\n        if ( !passwdRecord ){\n            fprintf(stderr, \"failed to get user: signon\\n\");\n            emit QProcess::finished(2, QProcess::NormalExit);\n            exit(2);\n        }\n#ifdef SIGNOND_TRACE\n        \/\/this is run in remote plugin process, so trace should go to stderr\n        fprintf(stderr, \"got user: %s with uid: %d\\n\", passwdRecord->pw_name, passwdRecord->pw_uid);\n#endif\n        if (( ::setgid(passwdRecord->pw_gid))\n                || (::setuid(passwdRecord->pw_uid))\n                || (::getuid() != passwdRecord->pw_uid)\n                ) {\n            fprintf(stderr, \"failed to set user: %s with uid: %d\", passwdRecord->pw_name, passwdRecord->pw_uid);\n            emit QProcess::finished(2, QProcess::NormalExit);\n            exit(2);\n        }\n #endif\n    }\n\n    \/* ---------------------- PluginProxy ---------------------- *\/\n\n    PluginProxy::PluginProxy(QString type, QObject *parent)\n            : QObject(parent)\n    {\n        TRACE();\n\n        m_type = type;\n        m_isProcessing = false;\n        m_isResultObtained = false;\n        m_currentResultOperation = -1;\n        m_process = new PluginProcess(this);\n\n#ifdef SIGNOND_TRACE\n        if (debugEnabled()) {\n            QProcessEnvironment env = QProcessEnvironment::systemEnvironment();\n            env.insert(QLatin1String(\"SSO_DEBUG\"), QLatin1String(\"1\"));\n            m_process->setProcessEnvironment(env);\n        }\n#endif\n\n        connect(m_process, SIGNAL(readyReadStandardError()), this, SLOT(onReadStandardError()));\n\n        \/*\n         * TODO: some error handling should be added here, at least remove of current\n         * request data from the top of the queue and reply an error code\n         * *\/\n        connect(m_process, SIGNAL(finished(int, QProcess::ExitStatus)), this, SLOT(onExit(int, QProcess::ExitStatus)));\n        connect(m_process, SIGNAL(error(QProcess::ProcessError)), this, SLOT(onError(QProcess::ProcessError)));\n\n        m_blobIOHandler = new BlobIOHandler(m_process, m_process, this);\n\n        connect(m_blobIOHandler,\n                SIGNAL(dataReceived(const QVariantMap &)),\n                this,\n                SLOT(sessionDataReceived(const QVariantMap &)));\n\n        QSocketNotifier *readNotifier =\n            new QSocketNotifier(STDIN_FILENO, QSocketNotifier::Read, this);\n\n        readNotifier->setEnabled(false);\n        m_blobIOHandler->setReadChannelSocketNotifier(readNotifier);\n    }\n\n    PluginProxy::~PluginProxy()\n    {\n        if (m_process != NULL &&\n            m_process->state() != QProcess::NotRunning)\n        {\n            if (m_isProcessing)\n                cancel();\n\n            stop();\n\n            if (!m_process->waitForFinished(PLUGINPROCESS_STOP_TIMEOUT)) {\n                qCritical() << \"The signon plugin does not react on demand to stop: need to kill it!!!\";\n                m_process->kill();\n\n                if (!m_process->waitForFinished(PLUGINPROCESS_STOP_TIMEOUT))\n                {\n                    if (m_process->pid()) {\n                        qCritical() << \"The signon plugin seems to ignore kill(), killing it from command line\";\n                        QString killProcessCommand(QString::fromLatin1(\"kill -9 %1\").arg(m_process->pid()));\n                        QProcess::execute(killProcessCommand);\n                    }\n                }\n            }\n        }\n    }\n\n    PluginProxy* PluginProxy::createNewPluginProxy(const QString &type)\n    {\n        PluginProxy *pp = new PluginProxy(type);\n\n        QStringList args = QStringList() << pp->m_type;\n        pp->m_process->start(REMOTEPLUGIN_BIN_PATH, args);\n\n        QByteArray tmp;\n\n        if (!pp->waitForStarted(PLUGINPROCESS_START_TIMEOUT)) {\n            TRACE() << \"The process cannot be started\";\n            delete pp;\n            return NULL;\n        }\n\n        if (!pp->readOnReady(tmp, PLUGINPROCESS_START_TIMEOUT)) {\n            TRACE() << \"The process cannot load plugin\";\n            delete pp;\n            return NULL;\n        }\n\n        pp->m_type = pp->queryType();\n        pp->m_mechanisms = pp->queryMechanisms();\n\n        connect(pp->m_process, SIGNAL(readyRead()), pp, SLOT(onReadStandardOutput()));\n\n        TRACE() << \"The process is started\";\n        return pp;\n    }\n\n   bool PluginProxy::process(const QString &cancelKey, const QVariantMap &inData, const QString &mechanism)\n   {\n        if (!restartIfRequired())\n            return false;\n\n        m_isResultObtained = false;\n        m_cancelKey = cancelKey;\n        QVariant value = inData.value(SSOUI_KEY_UIPOLICY);\n        m_uiPolicy = value.toInt();\n\n        QDataStream in(m_process);\n        in << (quint32)PLUGIN_OP_PROCESS;\n        in << mechanism;\n\n        m_blobIOHandler->sendData(inData);\n\n        m_isProcessing = true;\n        return true;\n    }\n\n   bool PluginProxy::processUi(const QString &cancelKey, const QVariantMap &inData)\n   {\n        TRACE();\n\n        if (!restartIfRequired())\n            return false;\n\n        m_cancelKey = cancelKey;\n\n        QDataStream in(m_process);\n\n        in << (quint32)PLUGIN_OP_PROCESS_UI;\n\n        m_blobIOHandler->sendData(inData);\n\n        m_isProcessing = true;\n\n        return true;\n    }\n\n   bool PluginProxy::processRefresh(const QString &cancelKey, const QVariantMap &inData)\n   {\n        TRACE();\n\n        if (!restartIfRequired())\n            return false;\n\n        m_cancelKey = cancelKey;\n\n        QDataStream in(m_process);\n\n        in << (quint32)PLUGIN_OP_REFRESH;\n\n        m_blobIOHandler->sendData(inData);\n\n        m_isProcessing = true;\n\n        return true;\n    }\n\n   void PluginProxy::cancel()\n   {\n       TRACE();\n       QDataStream in(m_process);\n       in << (quint32)PLUGIN_OP_CANCEL;\n    }\n\n   void PluginProxy::stop()\n   {\n       TRACE();\n       QDataStream in(m_process);\n       in << (quint32)PLUGIN_OP_STOP;\n    }\n\n    bool PluginProxy::readOnReady(QByteArray &buffer, int timeout)\n    {\n        bool ready = m_process->waitForReadyRead(timeout);\n\n        if (ready) {\n            if (!m_process->bytesAvailable())\n                return false;\n\n            while (m_process->bytesAvailable())\n                buffer += m_process->readAllStandardOutput();\n        }\n\n        return ready;\n    }\n\n    bool PluginProxy::isProcessing()\n    {\n        return m_isProcessing;\n    }\n\n    void PluginProxy::blobIOError()\n    {\n        TRACE();\n        disconnect(m_blobIOHandler, SIGNAL(error()), this, SLOT(blobIOError()));\n        stop();\n\n        connect(m_process, SIGNAL(readyRead()), this, SLOT(onReadStandardOutput()));\n        emit processError(\n            m_cancelKey,\n            (int)Error::InternalServer,\n            QLatin1String(\"Failed to I\/O session data to\/from the authentication plugin.\"));\n    }\n\n    bool PluginProxy::isResultOperationCodeValid(const int opCode) const\n    {\n        if (opCode == PLUGIN_RESPONSE_RESULT\n            || opCode == PLUGIN_RESPONSE_STORE\n            || opCode == PLUGIN_RESPONSE_ERROR\n            || opCode == PLUGIN_RESPONSE_SIGNAL\n            || opCode == PLUGIN_RESPONSE_UI\n            || opCode == PLUGIN_RESPONSE_REFRESHED) return true;\n\n        return false;\n    }\n\n    void PluginProxy::onReadStandardOutput()\n    {\n        disconnect(m_process, SIGNAL(readyRead()), this, SLOT(onReadStandardOutput()));\n\n        if (!m_process->bytesAvailable()) {\n            qCritical() << \"No information available on process\";\n            m_isProcessing = false;\n            emit processError(m_cancelKey, Error::InternalServer, QString());\n            return;\n        }\n\n        QDataStream reader(m_process);\n        reader >> m_currentResultOperation;\n\n        TRACE() << \"PROXY RESULT OPERATION:\" << m_currentResultOperation;\n\n        if (!isResultOperationCodeValid(m_currentResultOperation)) {\n            TRACE() << \"Unknown operation code - skipping.\";\n\n            \/\/flushing the stdin channel\n            Q_UNUSED(m_process->readAllStandardOutput());\n\n            connect(m_process, SIGNAL(readyRead()), this, SLOT(onReadStandardOutput()));\n            return;\n        }\n\n        if (m_currentResultOperation != PLUGIN_RESPONSE_SIGNAL\n            && m_currentResultOperation != PLUGIN_RESPONSE_ERROR) {\n\n            connect(m_blobIOHandler, SIGNAL(error()),\n                    this, SLOT(blobIOError()));\n\n            int expectedDataSize = 0;\n            reader >> expectedDataSize;\n            TRACE() << \"PROXY EXPECTED DATA SIZE:\" << expectedDataSize;\n\n            m_blobIOHandler->receiveData(expectedDataSize);\n        } else {\n            handlePluginResponse(m_currentResultOperation);\n        }\n    }\n\n    void PluginProxy::sessionDataReceived(const QVariantMap &map)\n    {\n        handlePluginResponse(m_currentResultOperation, map);\n    }\n\n    void PluginProxy::handlePluginResponse(const quint32 resultOperation,\n                                           const QVariantMap &sessionDataMap)\n    {\n        TRACE() << resultOperation;\n\n        if (resultOperation == PLUGIN_RESPONSE_RESULT) {\n            TRACE() << \"PLUGIN_RESPONSE_RESULT\";\n\n            m_isProcessing = false;\n\n            if (!m_isResultObtained)\n                emit processResultReply(m_cancelKey, sessionDataMap);\n            else\n                BLAME() << \"Unexpected plugin response: \";\n\n            m_isResultObtained = true;\n        } else if (resultOperation == PLUGIN_RESPONSE_STORE) {\n            TRACE() << \"PLUGIN_RESPONSE_STORE\";\n\n            if (!m_isResultObtained)\n                emit processStore(m_cancelKey, sessionDataMap);\n            else\n                BLAME() << \"Unexpected plugin store: \";\n\n        } else if (resultOperation == PLUGIN_RESPONSE_UI) {\n            TRACE() << \"PLUGIN_RESPONSE_UI\";\n\n            if (!m_isResultObtained) {\n                bool allowed = true;\n\n                if (m_uiPolicy == NoUserInteractionPolicy)\n                    allowed = false;\n\n                if (m_uiPolicy == ValidationPolicy) {\n                    bool credentialsQueried =\n                        (sessionDataMap.contains(SSOUI_KEY_QUERYUSERNAME)\n                        || sessionDataMap.contains(SSOUI_KEY_QUERYPASSWORD));\n\n                    bool captchaQueried  =\n                        (sessionDataMap.contains(SSOUI_KEY_CAPTCHAIMG)\n                         || sessionDataMap.contains(SSOUI_KEY_CAPTCHAURL));\n\n                    if (credentialsQueried && !captchaQueried)\n                        allowed = false;\n                }\n\n                if (!allowed) {\n                    \/\/set error and return;\n                    TRACE() << \"ui policy prevented ui launch\";\n\n                    QVariantMap nonConstMap = sessionDataMap;\n                    nonConstMap.insert(SSOUI_KEY_ERROR, QUERY_ERROR_FORBIDDEN);\n                    processUi(m_cancelKey, nonConstMap);\n                } else {\n                    TRACE() << \"open ui\";\n                    emit processUiRequest(m_cancelKey, sessionDataMap);\n                }\n            } else {\n                BLAME() << \"Unexpected plugin ui response: \";\n            }\n        } else if (resultOperation == PLUGIN_RESPONSE_REFRESHED) {\n            TRACE() << \"PLUGIN_RESPONSE_REFRESHED\";\n\n            if (!m_isResultObtained)\n                emit processRefreshRequest(m_cancelKey, sessionDataMap);\n            else\n                BLAME() << \"Unexpected plugin ui response: \";\n        } else if (resultOperation == PLUGIN_RESPONSE_ERROR) {\n            TRACE() << \"PLUGIN_RESPONSE_ERROR\";\n            quint32 err;\n            QString errorMessage;\n\n            QDataStream stream(m_process);\n            stream >> err;\n            stream >> errorMessage;\n            m_isProcessing = false;\n\n            if (!m_isResultObtained)\n                emit processError(m_cancelKey, (int)err, errorMessage);\n            else\n                BLAME() << \"Unexpected plugin error: \" << errorMessage;\n\n            m_isResultObtained = true;\n        } else if (resultOperation == PLUGIN_RESPONSE_SIGNAL) {\n            TRACE() << \"PLUGIN_RESPONSE_SIGNAL\";\n            quint32 state;\n            QString message;\n\n            QDataStream stream(m_process);\n            stream >> state;\n            stream >> message;\n\n            if (!m_isResultObtained)\n                emit stateChanged(m_cancelKey, (int)state, message);\n            else\n                BLAME() << \"Unexpected plugin signal: \" << state << message;\n        }\n\n        connect(m_process, SIGNAL(readyRead()), this, SLOT(onReadStandardOutput()));\n    }\n\n    void PluginProxy::onReadStandardError()\n    {\n        QString ba = QString::fromLatin1(m_process->readAllStandardError());\n    }\n\n    void PluginProxy::onExit(int exitCode, QProcess::ExitStatus exitStatus)\n    {\n        TRACE() << \"Plugin process exit with code \" << exitCode << \" : \" << exitStatus;\n\n        if (m_isProcessing || exitStatus == QProcess::CrashExit) {\n            qCritical() << \"Challenge produces CRASH!\";\n            emit processError(m_cancelKey, Error::InternalServer, QLatin1String(\"plugin processed crashed\"));\n        }\n        if (exitCode == 2) {\n            TRACE() << \"plugin process terminated because cannot change user\";\n        }\n\n        m_isProcessing = false;\n    }\n\n    void PluginProxy::onError(QProcess::ProcessError err)\n    {\n        TRACE() << \"Error: \" << err;\n    }\n\n    QString PluginProxy::queryType()\n    {\n        TRACE();\n\n        if (!restartIfRequired())\n            return QString();\n\n        QDataStream ds(m_process);\n        ds << (quint32)PLUGIN_OP_TYPE;\n\n        QByteArray typeBa, buffer;\n        bool result;\n\n        if ((result = readOnReady(buffer, PLUGINPROCESS_START_TIMEOUT))) {\n            QDataStream out(buffer);\n            out >> typeBa;\n        } else\n            qCritical(\"PluginProxy returned NULL result\");\n\n        return QString::fromLatin1(typeBa);\n    }\n\n    QStringList PluginProxy::queryMechanisms()\n    {\n        TRACE();\n\n        if (!restartIfRequired())\n            return QStringList();\n\n        QDataStream in(m_process);\n        in << (quint32)PLUGIN_OP_MECHANISMS;\n\n        QByteArray buffer;\n        QStringList strList;\n        bool result;\n\n        if ((result = readOnReady(buffer, PLUGINPROCESS_START_TIMEOUT))) {\n            QVariant mechanismsVar;\n            QDataStream out(buffer);\n\n            out >> mechanismsVar;\n            QVariantList varList = mechanismsVar.toList();\n\n            for (int i = 0; i < varList.count(); i++)\n                    strList << varList.at(i).toString();\n\n            TRACE() << strList;\n        } else\n            qCritical(\"PluginProxy returned NULL result\");\n\n        return strList;\n    }\n\n    bool PluginProxy::waitForStarted(int timeout)\n    {\n        return m_process->waitForStarted(timeout);\n    }\n\n    bool PluginProxy::waitForFinished(int timeout)\n    {\n        return m_process->waitForFinished(timeout);\n    }\n\n    bool PluginProxy::restartIfRequired()\n    {\n        if (m_process->state() == QProcess::NotRunning) {\n            TRACE() << \"RESTART REQUIRED\";\n            m_process->start(REMOTEPLUGIN_BIN_PATH, QStringList(m_type));\n\n            QByteArray tmp;\n            if (!waitForStarted(PLUGINPROCESS_START_TIMEOUT) || !readOnReady(tmp, PLUGINPROCESS_START_TIMEOUT))\n                return false;\n        }\n        return true;\n    }\n\n} \/\/namespace SignonDaemonNS\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n\n#include \"simulation.h\"\n\n#include \"codes\/bch.h\"\n#include \"codes\/rs.h\"\n\nstatic std::vector<decoder> decoders{\n  cyclic::primitive_bch<5, dmin<7>, cyclic::berlekamp_massey_tag>(),\n  cyclic::primitive_bch<5, dmin<7>, cyclic::peterson_gorenstein_zierler_tag>(),\n  cyclic::primitive_bch<5, dmin<7>, cyclic::euklid_tag>(),\n  cyclic::primitive_bch<5, dmin<7>, min_sum_tag<50> >(),\n  cyclic::primitive_bch<5, dmin<7>,\n                        normalized_min_sum_tag<50, std::ratio<8, 10> > >(),\n  cyclic::primitive_bch<5, dmin<7>,\n                        offset_min_sum_tag<50, std::ratio<1, 100> > >(),\n  cyclic::primitive_bch<5, dmin<7>, self_correcting_1_min_sum_tag<50> >(),\n  cyclic::primitive_bch<5, dmin<7>, self_correcting_2_min_sum_tag<50> >(),\n  cyclic::primitive_bch<5, dmin<7>, normalized_2d_min_sum_tag<50> >(),\n};\n\nint main() {\n  for (const auto &decoder : decoders) {\n    std::cout << decoder.to_string() << std::endl;\n  }\n  thread_pool p;\n  for (const auto &decoder : decoders)\n    p.push(bitflip_simulation(decoder, 6));\n}\n\n<commit_msg>Ignore global-ctor\/exit-time dtor warning<commit_after>#include <vector>\n\n#include \"simulation.h\"\n\n#include \"codes\/bch.h\"\n#include \"codes\/rs.h\"\n\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wexit-time-destructors\"\n#pragma clang diagnostic ignored \"-Wglobal-constructors\"\n\nstatic std::vector<decoder> decoders{\n  cyclic::primitive_bch<5, dmin<7>, cyclic::berlekamp_massey_tag>(),\n  cyclic::primitive_bch<5, dmin<7>, cyclic::peterson_gorenstein_zierler_tag>(),\n  cyclic::primitive_bch<5, dmin<7>, cyclic::euklid_tag>(),\n  cyclic::primitive_bch<5, dmin<7>, min_sum_tag<50> >(),\n  cyclic::primitive_bch<5, dmin<7>,\n                        normalized_min_sum_tag<50, std::ratio<8, 10> > >(),\n  cyclic::primitive_bch<5, dmin<7>,\n                        offset_min_sum_tag<50, std::ratio<1, 100> > >(),\n  cyclic::primitive_bch<5, dmin<7>, self_correcting_1_min_sum_tag<50> >(),\n  cyclic::primitive_bch<5, dmin<7>, self_correcting_2_min_sum_tag<50> >(),\n  cyclic::primitive_bch<5, dmin<7>, normalized_2d_min_sum_tag<50> >(),\n};\n\n#pragma clang diagnostic pop\n\nint main() {\n  for (const auto &decoder : decoders) {\n    std::cout << decoder.to_string() << std::endl;\n  }\n  thread_pool p;\n  for (const auto &decoder : decoders)\n    p.push(bitflip_simulation(decoder, 6));\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016-2017 John T. Foster, Katy L. Hanson\n\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\n\/\/    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"IGESControl_Reader.hxx\"\n#include \"TColStd_HSequenceOfTransient.hxx\"\n#include \"TopoDS_Shape.hxx\"\n\n#include \"Teuchos_RCP.hpp\"\n\n#include \"tadiga_IGES_geometry.h\"\n\ntadiga::IgesGeometry::IgesGeometry(\n    const Teuchos::RCP<const Teuchos::Comm<int>>& kComm,\n    const Teuchos::RCP<Teuchos::ParameterList>& kGeometryParameters)\n    : kComm_(kComm) {\n    const auto kFileName = kGeometryParameters->get<std::string>(\"File Name\");\n\n    \/\/ Open IGES Reader from OpenCASCADE\n    const auto kIgesReader = Teuchos::rcp(new IGESControl_Reader);\n    const auto status = kIgesReader->ReadFile(kFileName.c_str());\n\n    \/\/ TODO(johntfoster@gmail.com): Check the status of the file\n\n    Handle(TColStd_HSequenceOfTransient) myList =\n        kIgesReader->GiveList(\"iges-faces\");\n    \/\/ selects all IGES faces in the file and puts them into a list  called\n    \/\/ \/\/MyList,\n\n    const auto kIgesFaces = myList->Length();\n    const auto kTransFaces = kIgesReader->TransferList(myList);\n    \/\/ translates MyList,\n\n    std::cout << \"IGES Faces: \" << kIgesFaces\n              << \"   Transferred:\" << kTransFaces << std::endl;\n\n    TopoDS_Shape sh = kIgesReader->OneShape();\n};\n<commit_msg>Change myList to myFacesList<commit_after>\/\/ Copyright 2016-2017 John T. Foster, Katy L. Hanson\n\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\n\/\/    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"IGESControl_Reader.hxx\"\n#include \"TColStd_HSequenceOfTransient.hxx\"\n#include \"TopoDS_Shape.hxx\"\n\n#include \"Teuchos_RCP.hpp\"\n\n#include \"tadiga_IGES_geometry.h\"\n\ntadiga::IgesGeometry::IgesGeometry(\n    const Teuchos::RCP<const Teuchos::Comm<int>>& kComm,\n    const Teuchos::RCP<Teuchos::ParameterList>& kGeometryParameters)\n    : kComm_(kComm) {\n    const auto kFileName = kGeometryParameters->get<std::string>(\"File Name\");\n\n    \/\/ Open IGES Reader from OpenCASCADE\n    const auto kIgesReader = Teuchos::rcp(new IGESControl_Reader);\n    const auto status = kIgesReader->ReadFile(kFileName.c_str());\n\n    \/\/ TODO(johntfoster@gmail.com): Check the status of the file\n\n    Handle(TColStd_HSequenceOfTransient) myFacesList =\n        kIgesReader->GiveList(\"iges-faces\");\n    \/\/ selects all IGES faces in the file and puts them into a list  called\n    \/\/ \/\/MyList,\n\n    const auto kIgesFaces = myFacesList->Length();\n    const auto kTransFaces = kIgesReader->TransferList(myFacesList);\n    \/\/ translates MyList,\n\n    std::cout << \"IGES Faces: \" << kIgesFaces\n              << \"   Transferred:\" << kTransFaces << std::endl;\n\n    TopoDS_Shape sh = kIgesReader->OneShape();\n};\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- *\/\n\/*\n * This file is part of the libetonyek 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 <boost\/make_shared.hpp>\n\n#include <cppunit\/TestFixture.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n\n#include \"IWAMessage.h\"\n#include \"IWORKMemoryStream.h\"\n\nusing namespace libetonyek;\n\nusing std::size_t;\nusing std::string;\n\nnamespace test\n{\n\nnamespace\n{\n\nRVNGInputStreamPtr_t makeStream(const unsigned char *const bytes, const unsigned long length)\n{\n  return boost::make_shared<IWORKMemoryStream>(bytes, length);\n}\n\n}\n\nclass IWAMessageTest : public CPPUNIT_NS::TestFixture\n{\npublic:\n  virtual void setUp();\n  virtual void tearDown();\n\nprivate:\n  CPPUNIT_TEST_SUITE(IWAMessageTest);\n  CPPUNIT_TEST(testSimple);\n  CPPUNIT_TEST(testNestedMessage);\n  CPPUNIT_TEST(testMissingFields);\n  CPPUNIT_TEST(testRepeated);\n  CPPUNIT_TEST(testPacked);\n  CPPUNIT_TEST(testInvalidInput);\n  CPPUNIT_TEST_SUITE_END();\n\nprivate:\n  void testSimple();\n  void testNestedMessage();\n  void testMissingFields();\n  void testRepeated();\n  void testPacked();\n  void testInvalidInput();\n};\n\nvoid IWAMessageTest::setUp()\n{\n}\n\nvoid IWAMessageTest::tearDown()\n{\n}\n\n#define BYTES(b) (reinterpret_cast<const unsigned char *>(b)), (sizeof(b) - 1)\n\nvoid IWAMessageTest::testSimple()\n{\n  {\n    CPPUNIT_ASSERT_NO_THROW(IWAMessage(makeStream(BYTES(\"\\x8\\x4\")), 2));\n    IWAMessage msg(makeStream(BYTES(\"\\x8\\x4\")), 2);\n    CPPUNIT_ASSERT_NO_THROW(msg.uint64(1));\n    CPPUNIT_ASSERT(msg.uint64(1));\n    CPPUNIT_ASSERT_EQUAL(uint64_t(4), msg.uint64(1).get());\n  }\n\n  {\n    const RVNGInputStreamPtr_t input(\n      makeStream(BYTES(\n                   \"\\x8\\x4\" \/\/ 1: uint64 = 4\n                   \"\\x11\\x2\\x0\\x0\\x0\\x0\\x0\\x0\\x0\" \/\/ 2: fixed64 = 2\n                   \"\\x1a\\x5hello\" \/\/ 3: string = \"hello\"\n                   \"\\x25\\x20\\x0\\x0\\x0\" \/\/ 4: fixed32 = 32\n                 ))\n    );\n    IWAMessage msg(input, 23);\n    CPPUNIT_ASSERT_NO_THROW(msg.uint64(1));\n    CPPUNIT_ASSERT(msg.uint64(1));\n    CPPUNIT_ASSERT_EQUAL(uint64_t(4), msg.uint64(1).get());\n    CPPUNIT_ASSERT_NO_THROW(msg.fixed64(2));\n    CPPUNIT_ASSERT(msg.fixed64(2));\n    CPPUNIT_ASSERT_EQUAL(uint64_t(2), msg.fixed64(2).get());\n    CPPUNIT_ASSERT_NO_THROW(msg.string(3));\n    CPPUNIT_ASSERT(msg.string(3));\n    CPPUNIT_ASSERT_EQUAL(string(\"hello\"), msg.string(3).get());\n  }\n}\n\nvoid IWAMessageTest::testNestedMessage()\n{\n  \/\/ TODO: add\n}\n\n\nvoid IWAMessageTest::testMissingFields()\n{\n  IWAMessage msg(makeStream(BYTES(\"\\x8\\x4\")), 2);\n  CPPUNIT_ASSERT_NO_THROW(msg.string(4));\n  CPPUNIT_ASSERT(!msg.string(4));\n  CPPUNIT_ASSERT_NO_THROW(msg.fixed64(2));\n  CPPUNIT_ASSERT(!msg.fixed64(2));\n  CPPUNIT_ASSERT_NO_THROW(msg.message(8));\n  CPPUNIT_ASSERT(!msg.message(8));\n}\n\nvoid IWAMessageTest::testRepeated()\n{\n  IWAMessage msg(makeStream(BYTES(\"\\x8\\x4\\x8\\x8\\x8\\x10\")), 6);\n  CPPUNIT_ASSERT_NO_THROW(msg.uint64(1));\n  CPPUNIT_ASSERT_EQUAL(size_t(3), msg.uint64(1).size());\n  CPPUNIT_ASSERT_EQUAL(uint64_t(4), msg.uint64(1)[0]);\n  CPPUNIT_ASSERT_EQUAL(uint64_t(8), msg.uint64(1)[1]);\n  CPPUNIT_ASSERT_EQUAL(uint64_t(16), msg.uint64(1)[2]);\n}\n\nvoid IWAMessageTest::testPacked()\n{\n  IWAMessage msg(makeStream(BYTES(\"\\xa\\x3\\x1\\x2\\x3\")), 5);\n  CPPUNIT_ASSERT_NO_THROW(msg.uint64(1));\n  CPPUNIT_ASSERT_EQUAL(size_t(3), msg.uint64(1).size());\n  CPPUNIT_ASSERT_EQUAL(uint64_t(1), msg.uint64(1)[0]);\n  CPPUNIT_ASSERT_EQUAL(uint64_t(2), msg.uint64(1)[1]);\n  CPPUNIT_ASSERT_EQUAL(uint64_t(3), msg.uint64(1)[2]);\n}\n\nvoid IWAMessageTest::testInvalidInput()\n{\n  \/\/ TODO: add\n}\n\n#undef BYTES\n\nCPPUNIT_TEST_SUITE_REGISTRATION(IWAMessageTest);\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<commit_msg>add test for nested messages<commit_after>\/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- *\/\n\/*\n * This file is part of the libetonyek 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 <boost\/make_shared.hpp>\n\n#include <cppunit\/TestFixture.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n\n#include \"IWAMessage.h\"\n#include \"IWORKMemoryStream.h\"\n\nusing namespace libetonyek;\n\nusing std::size_t;\nusing std::string;\n\nnamespace test\n{\n\nnamespace\n{\n\nRVNGInputStreamPtr_t makeStream(const unsigned char *const bytes, const unsigned long length)\n{\n  return boost::make_shared<IWORKMemoryStream>(bytes, length);\n}\n\n}\n\nclass IWAMessageTest : public CPPUNIT_NS::TestFixture\n{\npublic:\n  virtual void setUp();\n  virtual void tearDown();\n\nprivate:\n  CPPUNIT_TEST_SUITE(IWAMessageTest);\n  CPPUNIT_TEST(testSimple);\n  CPPUNIT_TEST(testNestedMessage);\n  CPPUNIT_TEST(testMissingFields);\n  CPPUNIT_TEST(testRepeated);\n  CPPUNIT_TEST(testPacked);\n  CPPUNIT_TEST(testInvalidInput);\n  CPPUNIT_TEST_SUITE_END();\n\nprivate:\n  void testSimple();\n  void testNestedMessage();\n  void testMissingFields();\n  void testRepeated();\n  void testPacked();\n  void testInvalidInput();\n};\n\nvoid IWAMessageTest::setUp()\n{\n}\n\nvoid IWAMessageTest::tearDown()\n{\n}\n\n#define BYTES(b) (reinterpret_cast<const unsigned char *>(b)), (sizeof(b) - 1)\n\nvoid IWAMessageTest::testSimple()\n{\n  {\n    CPPUNIT_ASSERT_NO_THROW(IWAMessage(makeStream(BYTES(\"\\x8\\x4\")), 2));\n    IWAMessage msg(makeStream(BYTES(\"\\x8\\x4\")), 2);\n    CPPUNIT_ASSERT_NO_THROW(msg.uint64(1));\n    CPPUNIT_ASSERT(msg.uint64(1));\n    CPPUNIT_ASSERT_EQUAL(uint64_t(4), msg.uint64(1).get());\n  }\n\n  {\n    const RVNGInputStreamPtr_t input(\n      makeStream(BYTES(\n                   \"\\x8\\x4\" \/\/ 1: uint64 = 4\n                   \"\\x11\\x2\\x0\\x0\\x0\\x0\\x0\\x0\\x0\" \/\/ 2: fixed64 = 2\n                   \"\\x1a\\x5hello\" \/\/ 3: string = \"hello\"\n                   \"\\x25\\x20\\x0\\x0\\x0\" \/\/ 4: fixed32 = 32\n                 ))\n    );\n    IWAMessage msg(input, 23);\n    CPPUNIT_ASSERT_NO_THROW(msg.uint64(1));\n    CPPUNIT_ASSERT(msg.uint64(1));\n    CPPUNIT_ASSERT_EQUAL(uint64_t(4), msg.uint64(1).get());\n    CPPUNIT_ASSERT_NO_THROW(msg.fixed64(2));\n    CPPUNIT_ASSERT(msg.fixed64(2));\n    CPPUNIT_ASSERT_EQUAL(uint64_t(2), msg.fixed64(2).get());\n    CPPUNIT_ASSERT_NO_THROW(msg.string(3));\n    CPPUNIT_ASSERT(msg.string(3));\n    CPPUNIT_ASSERT_EQUAL(string(\"hello\"), msg.string(3).get());\n  }\n}\n\nvoid IWAMessageTest::testNestedMessage()\n{\n  IWAMessage msg(makeStream(BYTES(\"\\xa\\x6\\x8\\x4\\x12\\x2\\x10\\xa\")), 8); \/\/ {1: {1: uint32, 2: {2: uint32}}}\n  CPPUNIT_ASSERT_NO_THROW(msg.message(1));\n  CPPUNIT_ASSERT_NO_THROW(msg.message(1).get().uint32(1));\n  CPPUNIT_ASSERT_EQUAL(4u, msg.message(1).get().uint32(1).get());\n  CPPUNIT_ASSERT_NO_THROW(msg.message(1).get().message(2));\n  CPPUNIT_ASSERT_NO_THROW(msg.message(1).get().message(2).get().uint32(2));\n  CPPUNIT_ASSERT_EQUAL(10u, msg.message(1).get().message(2).get().uint32(2).get());\n}\n\n\nvoid IWAMessageTest::testMissingFields()\n{\n  IWAMessage msg(makeStream(BYTES(\"\\x8\\x4\")), 2);\n  CPPUNIT_ASSERT_NO_THROW(msg.string(4));\n  CPPUNIT_ASSERT(!msg.string(4));\n  CPPUNIT_ASSERT_NO_THROW(msg.fixed64(2));\n  CPPUNIT_ASSERT(!msg.fixed64(2));\n  CPPUNIT_ASSERT_NO_THROW(msg.message(8));\n  CPPUNIT_ASSERT(!msg.message(8));\n}\n\nvoid IWAMessageTest::testRepeated()\n{\n  IWAMessage msg(makeStream(BYTES(\"\\x8\\x4\\x8\\x8\\x8\\x10\")), 6);\n  CPPUNIT_ASSERT_NO_THROW(msg.uint64(1));\n  CPPUNIT_ASSERT_EQUAL(size_t(3), msg.uint64(1).size());\n  CPPUNIT_ASSERT_EQUAL(uint64_t(4), msg.uint64(1)[0]);\n  CPPUNIT_ASSERT_EQUAL(uint64_t(8), msg.uint64(1)[1]);\n  CPPUNIT_ASSERT_EQUAL(uint64_t(16), msg.uint64(1)[2]);\n}\n\nvoid IWAMessageTest::testPacked()\n{\n  IWAMessage msg(makeStream(BYTES(\"\\xa\\x3\\x1\\x2\\x3\")), 5);\n  CPPUNIT_ASSERT_NO_THROW(msg.uint64(1));\n  CPPUNIT_ASSERT_EQUAL(size_t(3), msg.uint64(1).size());\n  CPPUNIT_ASSERT_EQUAL(uint64_t(1), msg.uint64(1)[0]);\n  CPPUNIT_ASSERT_EQUAL(uint64_t(2), msg.uint64(1)[1]);\n  CPPUNIT_ASSERT_EQUAL(uint64_t(3), msg.uint64(1)[2]);\n}\n\nvoid IWAMessageTest::testInvalidInput()\n{\n  \/\/ TODO: add\n}\n\n#undef BYTES\n\nCPPUNIT_TEST_SUITE_REGISTRATION(IWAMessageTest);\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/test\/unit_test.hpp>\n\n#include \"base58.h\"\n\nBOOST_AUTO_TEST_SUITE(base58_tests)\n\n\/\/ TODO:\n\/\/ EncodeBase58Check\n\/\/ DecodeBase58Check\n\/\/ CBase58Data\n\/\/    bool SetString(const char* psz)\n    \/\/ bool SetString(const std::string& str)\n    \/\/ std::string ToString() const\n    \/\/ int CompareTo(const CBase58Data& b58) const\n    \/\/ bool operator==(const CBase58Data& b58) const\n    \/\/ bool operator<=(const CBase58Data& b58) const\n    \/\/ bool operator>=(const CBase58Data& b58) const\n    \/\/ bool operator< (const CBase58Data& b58) const\n    \/\/ bool operator> (const CBase58Data& b58) const\n\n\/\/ CBitcoinAddress\n    \/\/ bool SetHash160(const uint160& hash160)\n    \/\/ bool SetPubKey(const std::vector<unsigned char>& vchPubKey)\n    \/\/ bool IsValid() const\n    \/\/ CBitcoinAddress()\n    \/\/ CBitcoinAddress(uint160 hash160In)\n    \/\/ CBitcoinAddress(const std::vector<unsigned char>& vchPubKey)\n    \/\/ CBitcoinAddress(const std::string& strAddress)\n    \/\/ CBitcoinAddress(const char* pszAddress)\n    \/\/ uint160 GetHash160() const\n\n#define U(x) (reinterpret_cast<const unsigned char*>(x))\nstatic struct {\n    const unsigned char *data;\n    int size;\n} vstrIn[] = {\n{U(\"\"), 0},\n{U(\"\\x61\"), 1},\n{U(\"\\x62\\x62\\x62\"), 3},\n{U(\"\\x63\\x63\\x63\"), 3},\n{U(\"\\x73\\x69\\x6d\\x70\\x6c\\x79\\x20\\x61\\x20\\x6c\\x6f\\x6e\\x67\\x20\\x73\\x74\\x72\\x69\\x6e\\x67\"), 20},\n{U(\"\\x00\\xeb\\x15\\x23\\x1d\\xfc\\xeb\\x60\\x92\\x58\\x86\\xb6\\x7d\\x06\\x52\\x99\\x92\\x59\\x15\\xae\\xb1\\x72\\xc0\\x66\\x47\"), 25},\n{U(\"\\x51\\x6b\\x6f\\xcd\\x0f\"), 5},\n{U(\"\\xbf\\x4f\\x89\\x00\\x1e\\x67\\x02\\x74\\xdd\"), 9},\n{U(\"\\x57\\x2e\\x47\\x94\"), 4},\n{U(\"\\xec\\xac\\x89\\xca\\xd9\\x39\\x23\\xc0\\x23\\x21\"), 10},\n{U(\"\\x10\\xc8\\x51\\x1e\"), 4},\n{U(\"\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\"), 10},\n};\n\nconst char *vstrOut[] = {\n\"\",\n\"2g\",\n\"a3gV\",\n\"aPEr\",\n\"2cFupjhnEsSn59qHXstmK2ffpLv2\",\n\"1NS17iag9jJgTHD1VXjvLCEnZuQ3rJDE9L\",\n\"ABnLTmg\",\n\"3SEo3LWLoPntC\",\n\"3EFU7m\",\n\"EJDM8drfXA6uyA\",\n\"Rt5zm\",\n\"1111111111\"\n};\n\nBOOST_AUTO_TEST_CASE(base58_EncodeBase58)\n{\n    for (unsigned int i=0; i<sizeof(vstrIn)\/sizeof(vstrIn[0]); i++)\n    {\n        BOOST_CHECK_EQUAL(EncodeBase58(vstrIn[i].data, vstrIn[i].data + vstrIn[i].size), vstrOut[i]);\n    }\n}\n\nBOOST_AUTO_TEST_CASE(base58_DecodeBase58)\n{\n    std::vector<unsigned char> result;\n    for (unsigned int i=0; i<sizeof(vstrIn)\/sizeof(vstrIn[0]); i++)\n    {\n        std::vector<unsigned char> expected(vstrIn[i].data, vstrIn[i].data + vstrIn[i].size);\n        BOOST_CHECK(DecodeBase58(vstrOut[i], result));\n        BOOST_CHECK_EQUAL_COLLECTIONS(result.begin(), result.end(), expected.begin(), expected.end());\n    }\n    BOOST_CHECK(!DecodeBase58(\"invalid\", result));\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Delete base58_tests.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"transactionrecord.h\"\n\n#include \"wallet.h\"\n#include \"base58.h\"\n\n\/* Return positive answer if transaction should be shown in list.\n *\/\nbool TransactionRecord::showTransaction(const CWalletTx &wtx)\n{\n    if (wtx.IsCoinBase())\n    {\n        \/\/ Ensures we show generated coins \/ mined transactions at depth 1\n        if (!wtx.IsInMainChain())\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet *wallet, const CWalletTx &wtx)\n{\n    QList<TransactionRecord> parts;\n    int64 nTime = wtx.GetTxTime();\n    int64 nCredit = wtx.GetCredit(true);\n    int64 nDebit = wtx.GetDebit();\n    int64 nNet = nCredit - nDebit;\n    uint256 hash = wtx.GetHash();\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n\n    if (nNet > 0 || wtx.IsCoinBase() || wtx.IsCoinStake())\n    {\n        \/\/\n        \/\/ Credit\n        \/\/\n        BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n        {\n            if(wallet->IsMine(txout))\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n                sub.credit = txout.nValue;\n                if (ExtractDestination(txout.scriptPubKey, address) && IsMine(*wallet, address))\n                {\n                    \/\/ Received by Bitcoin Address\n                    sub.type = TransactionRecord::RecvWithAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n                if (wtx.IsCoinBase())\n                {\n                    \/\/ Generated (proof-of-work)\n                    sub.type = TransactionRecord::Generated;\n                }\n                if (wtx.IsCoinStake())\n                {\n                    \/\/ Generated (proof-of-stake)\n                    sub.type = TransactionRecord::Generated;\n                    if (nNet > 0)\n                        sub.credit = nNet;\n                    else\n                    {\n                        int64 nUnmatured = 0;\n                        BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n                            nUnmatured += wallet->GetCredit(txout);\n                        sub.credit = nUnmatured - nDebit;\n                    }\n                    parts.append(sub);\n                    return parts; \/\/ last coinstake output\n                }\n                parts.append(sub);\n            }\n        }\n    }\n    else\n    {\n        bool fAllFromMe = true;\n        BOOST_FOREACH(const CTxIn& txin, wtx.vin)\n            fAllFromMe = fAllFromMe && wallet->IsMine(txin);\n\n        bool fAllToMe = true;\n        BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n            fAllToMe = fAllToMe && wallet->IsMine(txout);\n\n        if (fAllFromMe && fAllToMe)\n        {\n            \/\/ Payment to self\n            int64 nChange = wtx.GetChange();\n\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::SendToSelf, \"\",\n                            -(nDebit - nChange), nCredit - nChange));\n        }\n        else if (fAllFromMe)\n        {\n            \/\/\n            \/\/ Debit\n            \/\/\n            int64 nTxFee = nDebit - wtx.GetValueOut();\n\n            for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++)\n            {\n                const CTxOut& txout = wtx.vout[nOut];\n                TransactionRecord sub(hash, nTime);\n                sub.idx = parts.size();\n\n                if(wallet->IsMine(txout))\n                {\n                    \/\/ Ignore parts sent to self, as this is usually the change\n                    \/\/ from a transaction sent back to our own address.\n                    continue;\n                }\n\n                CTxDestination address;\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    \/\/ Sent to Bitcoin Address\n                    sub.type = TransactionRecord::SendToAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::SendToOther;\n                    sub.address = mapValue[\"to\"];\n                }\n\n                int64 nValue = txout.nValue;\n                \/* Add fee to first output *\/\n                if (nTxFee > 0)\n                {\n                    nValue += nTxFee;\n                    nTxFee = 0;\n                }\n                sub.debit = -nValue;\n\n                parts.append(sub);\n            }\n        }\n        else\n        {\n            \/\/\n            \/\/ Mixed debit transaction, can't break down payees\n            \/\/\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0));\n        }\n    }\n    return parts;\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx &wtx)\n{\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    status.countsForBalance = wtx.IsTrusted() && !(wtx.GetBlocksToMaturity() > 0);\n    status.depth = wtx.GetDepthInMainChain();\n    status.cur_num_blocks = nBestHeight;\n\n    if (!wtx.IsFinal())\n    {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD)\n        {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = nBestHeight - wtx.nLockTime;\n        }\n        else\n        {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n\n    \/\/ For generated transactions, determine maturity\n    else if(type == TransactionRecord::Generated)\n    {\n        if (wtx.GetBlocksToMaturity() > 0)\n        {\n            status.status = TransactionStatus::Immature;\n\n            if (wtx.IsInMainChain())\n            {\n                status.matures_in = wtx.GetBlocksToMaturity();\n\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.status = TransactionStatus::MaturesWarning;\n            }\n            else\n            {\n                status.status = TransactionStatus::NotAccepted;\n            }\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n    else\n    {\n        if (status.depth < 0)\n        {\n            status.status = TransactionStatus::Conflicted;\n        }\n        else if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n        {\n            status.status = TransactionStatus::Offline;\n        }\n        else if (status.depth == 0)\n        {\n            status.status = TransactionStatus::Unconfirmed;\n        }\n        else if (status.depth < RecommendedNumConfirmations)\n        {\n            status.status = TransactionStatus::Confirming;\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    return status.cur_num_blocks != nBestHeight;\n}\n\nstd::string TransactionRecord::getTxID()\n{\n    return hash.ToString() + strprintf(\"-%03d\", idx);\n}\n\n<commit_msg>adjust trans record process<commit_after>#include \"transactionrecord.h\"\n\n#include \"wallet.h\"\n#include \"base58.h\"\n\n\/* Return positive answer if transaction should be shown in list.\n *\/\nbool TransactionRecord::showTransaction(const CWalletTx &wtx)\n{\n    if (wtx.IsCoinBase())\n    {\n        \/\/ Ensures we show generated coins \/ mined transactions at depth 1\n        if (!wtx.IsInMainChain())\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet *wallet, const CWalletTx &wtx)\n{\n    QList<TransactionRecord> parts;\n    int64 nTime = wtx.GetTxTime();\n    int64 nCredit = wtx.GetCredit(true);\n    int64 nDebit = wtx.GetDebit();\n    int64 nNet = nCredit - nDebit;\n    uint256 hash = wtx.GetHash();\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n\n    if (nNet > 0 || wtx.IsCoinBase() || wtx.IsCoinStake())\n    {\n        \/\/\n        \/\/ Credit\n        \/\/\n        BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n        {\n            if(wallet->IsMine(txout))\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n                sub.credit = txout.nValue;\n                if (ExtractDestination(txout.scriptPubKey, address) && IsMine(*wallet, address))\n                {\n                    \/\/ Received by Bitcoin Address\n                    sub.type = TransactionRecord::RecvWithAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n                if (wtx.IsCoinStake())\n                {\n                    \/\/ Generated (proof-of-stake)\n                    sub.type = TransactionRecord::Generated;\n                    if (nNet > 0)\n                        sub.credit = nNet;\n                    else\n                    {\n                        int64 nUnmatured = 0;\n                        BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n                            nUnmatured += wallet->GetCredit(txout);\n                        sub.credit = nUnmatured - nDebit;\n                    }\n                    parts.append(sub);\n                    return parts; \/\/ last coinstake output\n                }\n                if (wtx.IsCoinBase())\n                {\n                    \/\/ Generated (proof-of-work)\n                    sub.type = TransactionRecord::Generated;\n                }\n                parts.append(sub);\n            }\n        }\n    }\n    else\n    {\n        bool fAllFromMe = true;\n        BOOST_FOREACH(const CTxIn& txin, wtx.vin)\n            fAllFromMe = fAllFromMe && wallet->IsMine(txin);\n\n        bool fAllToMe = true;\n        BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n            fAllToMe = fAllToMe && wallet->IsMine(txout);\n\n        if (fAllFromMe && fAllToMe)\n        {\n            \/\/ Payment to self\n            int64 nChange = wtx.GetChange();\n\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::SendToSelf, \"\",\n                            -(nDebit - nChange), nCredit - nChange));\n        }\n        else if (fAllFromMe)\n        {\n            \/\/\n            \/\/ Debit\n            \/\/\n            int64 nTxFee = nDebit - wtx.GetValueOut();\n\n            for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++)\n            {\n                const CTxOut& txout = wtx.vout[nOut];\n                TransactionRecord sub(hash, nTime);\n                sub.idx = parts.size();\n\n                if(wallet->IsMine(txout))\n                {\n                    \/\/ Ignore parts sent to self, as this is usually the change\n                    \/\/ from a transaction sent back to our own address.\n                    continue;\n                }\n\n                CTxDestination address;\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    \/\/ Sent to Bitcoin Address\n                    sub.type = TransactionRecord::SendToAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::SendToOther;\n                    sub.address = mapValue[\"to\"];\n                }\n\n                int64 nValue = txout.nValue;\n                \/* Add fee to first output *\/\n                if (nTxFee > 0)\n                {\n                    nValue += nTxFee;\n                    nTxFee = 0;\n                }\n                sub.debit = -nValue;\n\n                parts.append(sub);\n            }\n        }\n        else\n        {\n            \/\/\n            \/\/ Mixed debit transaction, can't break down payees\n            \/\/\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0));\n        }\n    }\n    return parts;\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx &wtx)\n{\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    status.countsForBalance = wtx.IsTrusted() && !(wtx.GetBlocksToMaturity() > 0);\n    status.depth = wtx.GetDepthInMainChain();\n    status.cur_num_blocks = nBestHeight;\n\n    if (!wtx.IsFinal())\n    {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD)\n        {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = nBestHeight - wtx.nLockTime;\n        }\n        else\n        {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n\n    \/\/ For generated transactions, determine maturity\n    else if(type == TransactionRecord::Generated)\n    {\n        if (wtx.GetBlocksToMaturity() > 0)\n        {\n            status.status = TransactionStatus::Immature;\n\n            if (wtx.IsInMainChain())\n            {\n                status.matures_in = wtx.GetBlocksToMaturity();\n\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.status = TransactionStatus::MaturesWarning;\n            }\n            else\n            {\n                status.status = TransactionStatus::NotAccepted;\n            }\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n    else\n    {\n        if (status.depth < 0)\n        {\n            status.status = TransactionStatus::Conflicted;\n        }\n        else if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n        {\n            status.status = TransactionStatus::Offline;\n        }\n        else if (status.depth == 0)\n        {\n            status.status = TransactionStatus::Unconfirmed;\n        }\n        else if (status.depth < RecommendedNumConfirmations)\n        {\n            status.status = TransactionStatus::Confirming;\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    return status.cur_num_blocks != nBestHeight;\n}\n\nstd::string TransactionRecord::getTxID()\n{\n    return hash.ToString() + strprintf(\"-%03d\", idx);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Dash developers\n\/\/ Copyright (c) 2015-2017 The PIVX 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 \"transactionrecord.h\"\n\n#include \"base58.h\"\n#include \"obfuscation.h\"\n#include \"swifttx.h\"\n#include \"timedata.h\"\n#include \"wallet.h\"\n\n#include <stdint.h>\n\n\/* Return positive answer if transaction should be shown in list.\n *\/\nbool TransactionRecord::showTransaction(const CWalletTx& wtx)\n{\n    if (wtx.IsCoinBase()) {\n        \/\/ Ensures we show generated coins \/ mined transactions at depth 1\n        if (!wtx.IsInMainChain()) {\n            return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet* wallet, const CWalletTx& wtx)\n{\n    QList<TransactionRecord> parts;\n    int64_t nTime = wtx.GetComputedTxTime();\n    CAmount nCredit = wtx.GetCredit(ISMINE_ALL);\n    CAmount nDebit = wtx.GetDebit(ISMINE_ALL);\n    CAmount nNet = nCredit - nDebit;\n    uint256 hash = wtx.GetHash();\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n    bool fZSpendFromMe = false;\n\n    if (wtx.IsZerocoinSpend()) {\n        \/\/ a zerocoin spend that was created by this wallet\n        libzerocoin::CoinSpend zcspend = TxInToZerocoinSpend(wtx.vin[0]);\n        fZSpendFromMe = wallet->IsMyZerocoinSpend(zcspend.getCoinSerialNumber());\n    }\n\n    if (wtx.IsCoinStake()) {\n        TransactionRecord sub(hash, nTime);\n        CTxDestination address;\n        if (!wtx.IsZerocoinSpend() && !ExtractDestination(wtx.vout[1].scriptPubKey, address))\n            return parts;\n\n        if (wtx.IsZerocoinSpend() && (fZSpendFromMe || wallet->zpivTracker->HasMintTx(hash))) {\n            \/\/zPIV stake reward\n            sub.involvesWatchAddress = false;\n            sub.type = TransactionRecord::StakeZPIV;\n            sub.address = mapValue[\"zerocoinmint\"];\n            sub.credit = 0;\n            for (const CTxOut& out : wtx.vout) {\n                if (out.IsZerocoinMint())\n                    sub.credit += out.nValue;\n            }\n            sub.debit -= wtx.vin[0].nSequence * COIN;\n        } else if (isminetype mine = wallet->IsMine(wtx.vout[1])) {\n            \/\/ PIV stake reward\n            sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n            sub.type = TransactionRecord::StakeMint;\n            sub.address = CBitcoinAddress(address).ToString();\n            sub.credit = nNet;\n        } else {\n            \/\/Masternode reward\n            CTxDestination destMN;\n            int nIndexMN = wtx.vout.size() - 1;\n            if (ExtractDestination(wtx.vout[nIndexMN].scriptPubKey, destMN) && IsMine(*wallet, destMN)) {\n                isminetype mine = wallet->IsMine(wtx.vout[nIndexMN]);\n                sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n                sub.type = TransactionRecord::MNReward;\n                sub.address = CBitcoinAddress(destMN).ToString();\n                sub.credit = wtx.vout[nIndexMN].nValue;\n            }\n        }\n\n        parts.append(sub);\n    } else if (wtx.IsZerocoinSpend()) {\n        \/\/zerocoin spend outputs\n        bool fFeeAssigned = false;\n        for (const CTxOut txout : wtx.vout) {\n            \/\/ change that was reminted as zerocoins\n            if (txout.IsZerocoinMint()) {\n                \/\/ do not display record if this isn't from our wallet\n                if (!fZSpendFromMe)\n                    continue;\n\n                TransactionRecord sub(hash, nTime);\n                sub.type = TransactionRecord::ZerocoinSpend_Change_zPiv;\n                sub.address = mapValue[\"zerocoinmint\"];\n                if (!fFeeAssigned) {\n                    sub.debit -= (wtx.GetZerocoinSpent() - wtx.GetValueOut());\n                    fFeeAssigned = true;\n                }\n                sub.idx = parts.size();\n                parts.append(sub);\n                continue;\n            }\n\n            string strAddress = \"\";\n            CTxDestination address;\n            if (ExtractDestination(txout.scriptPubKey, address))\n                strAddress = CBitcoinAddress(address).ToString();\n\n            \/\/ a zerocoinspend that was sent to an address held by this wallet\n            isminetype mine = wallet->IsMine(txout);\n            if (mine) {\n                TransactionRecord sub(hash, nTime);\n                sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n                if (fZSpendFromMe) {\n                    sub.type = TransactionRecord::ZerocoinSpend_FromMe;\n                } else {\n                    sub.type = TransactionRecord::RecvFromZerocoinSpend;\n                    sub.credit = txout.nValue;\n                }\n                sub.address = mapValue[\"recvzerocoinspend\"];\n                if (strAddress != \"\")\n                    sub.address = strAddress;\n                sub.idx = parts.size();\n                parts.append(sub);\n                continue;\n            }\n\n            \/\/ spend is not from us, so do not display the spend side of the record\n            if (!fZSpendFromMe)\n                continue;\n\n            \/\/ zerocoin spend that was sent to someone else\n            TransactionRecord sub(hash, nTime);\n            sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n            sub.debit = -txout.nValue;\n            sub.type = TransactionRecord::ZerocoinSpend;\n            sub.address = mapValue[\"zerocoinspend\"];\n            if (strAddress != \"\")\n                sub.address = strAddress;\n            sub.idx = parts.size();\n            parts.append(sub);\n        }\n    } else if (nNet > 0 || wtx.IsCoinBase()) {\n        \/\/\n        \/\/ Credit\n        \/\/\n        BOOST_FOREACH (const CTxOut& txout, wtx.vout) {\n            isminetype mine = wallet->IsMine(txout);\n            if (mine) {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n                sub.credit = txout.nValue;\n                sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n                if (ExtractDestination(txout.scriptPubKey, address) && IsMine(*wallet, address)) {\n                    \/\/ Received by PIVX Address\n                    sub.type = TransactionRecord::RecvWithAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                } else {\n                    \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n                if (wtx.IsCoinBase()) {\n                    \/\/ Generated\n                    sub.type = TransactionRecord::Generated;\n                }\n\n                parts.append(sub);\n            }\n        }\n    } else {\n        bool fAllFromMeDenom = true;\n        int nFromMe = 0;\n        bool involvesWatchAddress = false;\n        isminetype fAllFromMe = ISMINE_SPENDABLE;\n        BOOST_FOREACH (const CTxIn& txin, wtx.vin) {\n            if (wallet->IsMine(txin)) {\n                fAllFromMeDenom = fAllFromMeDenom && wallet->IsDenominated(txin);\n                nFromMe++;\n            }\n            isminetype mine = wallet->IsMine(txin);\n            if (mine & ISMINE_WATCH_ONLY) involvesWatchAddress = true;\n            if (fAllFromMe > mine) fAllFromMe = mine;\n        }\n\n        isminetype fAllToMe = ISMINE_SPENDABLE;\n        bool fAllToMeDenom = true;\n        int nToMe = 0;\n        BOOST_FOREACH (const CTxOut& txout, wtx.vout) {\n            if (wallet->IsMine(txout)) {\n                fAllToMeDenom = fAllToMeDenom && wallet->IsDenominatedAmount(txout.nValue);\n                nToMe++;\n            }\n            isminetype mine = wallet->IsMine(txout);\n            if (mine & ISMINE_WATCH_ONLY) involvesWatchAddress = true;\n            if (fAllToMe > mine) fAllToMe = mine;\n        }\n\n        if (fAllFromMeDenom && fAllToMeDenom && nFromMe * nToMe) {\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::ObfuscationDenominate, \"\", -nDebit, nCredit));\n            parts.last().involvesWatchAddress = false; \/\/ maybe pass to TransactionRecord as constructor argument\n        } else if (fAllFromMe && fAllToMe) {\n            \/\/ Payment to self\n            \/\/ TODO: this section still not accurate but covers most cases,\n            \/\/ might need some additional work however\n\n            TransactionRecord sub(hash, nTime);\n            \/\/ Payment to self by default\n            sub.type = TransactionRecord::SendToSelf;\n            sub.address = \"\";\n\n            if (mapValue[\"DS\"] == \"1\") {\n                sub.type = TransactionRecord::Obfuscated;\n                CTxDestination address;\n                if (ExtractDestination(wtx.vout[0].scriptPubKey, address)) {\n                    \/\/ Sent to PIVX Address\n                    sub.address = CBitcoinAddress(address).ToString();\n                } else {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.address = mapValue[\"to\"];\n                }\n            } else {\n                for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++) {\n                    const CTxOut& txout = wtx.vout[nOut];\n                    sub.idx = parts.size();\n\n                    if (wallet->IsCollateralAmount(txout.nValue)) sub.type = TransactionRecord::ObfuscationMakeCollaterals;\n                    if (wallet->IsDenominatedAmount(txout.nValue)) sub.type = TransactionRecord::ObfuscationCreateDenominations;\n                    if (nDebit - wtx.GetValueOut() == OBFUSCATION_COLLATERAL) sub.type = TransactionRecord::ObfuscationCollateralPayment;\n                }\n            }\n\n            CAmount nChange = wtx.GetChange();\n\n            sub.debit = -(nDebit - nChange);\n            sub.credit = nCredit - nChange;\n            parts.append(sub);\n            parts.last().involvesWatchAddress = involvesWatchAddress; \/\/ maybe pass to TransactionRecord as constructor argument\n        } else if (fAllFromMe || wtx.IsZerocoinMint()) {\n            \/\/\n            \/\/ Debit\n            \/\/\n            CAmount nTxFee = nDebit - wtx.GetValueOut();\n\n            for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++) {\n                const CTxOut& txout = wtx.vout[nOut];\n                TransactionRecord sub(hash, nTime);\n                sub.idx = parts.size();\n                sub.involvesWatchAddress = involvesWatchAddress;\n\n                if (wallet->IsMine(txout)) {\n                    \/\/ Ignore parts sent to self, as this is usually the change\n                    \/\/ from a transaction sent back to our own address.\n                    continue;\n                }\n\n                CTxDestination address;\n                if (ExtractDestination(txout.scriptPubKey, address)) {\n                    \/\/This is most likely only going to happen when resyncing deterministic wallet without the knowledge of the\n                    \/\/private keys that the change was sent to. Do not display a \"sent to\" here.\n                    if (wtx.IsZerocoinMint())\n                        continue;\n                    \/\/ Sent to PIVX Address\n                    sub.type = TransactionRecord::SendToAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                } else if (txout.IsZerocoinMint()){\n                    sub.type = TransactionRecord::ZerocoinMint;\n                    sub.address = mapValue[\"zerocoinmint\"];\n                    sub.credit += txout.nValue;\n                } else {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::SendToOther;\n                    sub.address = mapValue[\"to\"];\n                }\n\n                if (mapValue[\"DS\"] == \"1\") {\n                    sub.type = TransactionRecord::Obfuscated;\n                }\n\n                CAmount nValue = txout.nValue;\n                \/* Add fee to first output *\/\n                if (nTxFee > 0) {\n                    nValue += nTxFee;\n                    nTxFee = 0;\n                }\n                sub.debit = -nValue;\n\n                parts.append(sub);\n            }\n        } else {\n            \/\/\n            \/\/ Mixed debit transaction, can't break down payees\n            \/\/\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0));\n            parts.last().involvesWatchAddress = involvesWatchAddress;\n        }\n    }\n\n    return parts;\n}\n\nbool IsZPIVType(TransactionRecord::Type type)\n{\n    switch (type) {\n        case TransactionRecord::StakeZPIV:\n        case TransactionRecord::ZerocoinMint:\n        case TransactionRecord::ZerocoinSpend:\n        case TransactionRecord::RecvFromZerocoinSpend:\n        case TransactionRecord::ZerocoinSpend_Change_zPiv:\n        case TransactionRecord::ZerocoinSpend_FromMe:\n            return true;\n        default:\n            return false;\n    }\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx& wtx)\n{\n    AssertLockHeld(cs_main);\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    BlockMap::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    \/\/status.countsForBalance = wtx.IsTrusted() && !(wtx.GetBlocksToMaturity() > 0);\n    status.depth = wtx.GetDepthInMainChain();\n\n    \/\/Determine the depth of the block\n    int nBlocksToMaturity = wtx.GetBlocksToMaturity();\n\n    status.countsForBalance = wtx.IsTrusted() && !(nBlocksToMaturity > 0);\n    status.cur_num_blocks = chainActive.Height();\n    status.cur_num_ix_locks = nCompleteTXLocks;\n\n    if (!IsFinalTx(wtx, chainActive.Height() + 1)) {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD) {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = wtx.nLockTime - chainActive.Height();\n        } else {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n    \/\/ For generated transactions, determine maturity\n    else if (type == TransactionRecord::Generated || type == TransactionRecord::StakeMint || type == TransactionRecord::StakeZPIV || type == TransactionRecord::MNReward) {\n        if (nBlocksToMaturity > 0) {\n            status.status = TransactionStatus::Immature;\n            status.matures_in = nBlocksToMaturity;\n\n            if (pindex && chainActive.Contains(pindex)) {\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.status = TransactionStatus::MaturesWarning;\n            } else {\n                status.status = TransactionStatus::NotAccepted;\n            }\n        } else {\n            status.status = TransactionStatus::Confirmed;\n            status.matures_in = 0;\n        }\n    } else {\n        if (status.depth < 0) {\n            status.status = TransactionStatus::Conflicted;\n        } else if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0) {\n            status.status = TransactionStatus::Offline;\n        } else if (status.depth == 0) {\n            status.status = TransactionStatus::Unconfirmed;\n        } else if (status.depth < RecommendedNumConfirmations) {\n            status.status = TransactionStatus::Confirming;\n        } else {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    AssertLockHeld(cs_main);\n    return status.cur_num_blocks != chainActive.Height() || status.cur_num_ix_locks != nCompleteTXLocks;\n}\n\nQString TransactionRecord::getTxID() const\n{\n    return QString::fromStdString(hash.ToString());\n}\n\nint TransactionRecord::getOutputIndex() const\n{\n    return idx;\n}\n<commit_msg>[Qt] Fix another instance of a wayward eye<commit_after>\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Dash developers\n\/\/ Copyright (c) 2015-2017 The PIVX 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 \"transactionrecord.h\"\n\n#include \"base58.h\"\n#include \"obfuscation.h\"\n#include \"swifttx.h\"\n#include \"timedata.h\"\n#include \"wallet.h\"\n\n#include <stdint.h>\n\n\/* Return positive answer if transaction should be shown in list.\n *\/\nbool TransactionRecord::showTransaction(const CWalletTx& wtx)\n{\n    if (wtx.IsCoinBase()) {\n        \/\/ Ensures we show generated coins \/ mined transactions at depth 1\n        if (!wtx.IsInMainChain()) {\n            return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet* wallet, const CWalletTx& wtx)\n{\n    QList<TransactionRecord> parts;\n    int64_t nTime = wtx.GetComputedTxTime();\n    CAmount nCredit = wtx.GetCredit(ISMINE_ALL);\n    CAmount nDebit = wtx.GetDebit(ISMINE_ALL);\n    CAmount nNet = nCredit - nDebit;\n    uint256 hash = wtx.GetHash();\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n    bool fZSpendFromMe = false;\n\n    if (wtx.IsZerocoinSpend()) {\n        \/\/ a zerocoin spend that was created by this wallet\n        libzerocoin::CoinSpend zcspend = TxInToZerocoinSpend(wtx.vin[0]);\n        fZSpendFromMe = wallet->IsMyZerocoinSpend(zcspend.getCoinSerialNumber());\n    }\n\n    if (wtx.IsCoinStake()) {\n        TransactionRecord sub(hash, nTime);\n        CTxDestination address;\n        if (!wtx.IsZerocoinSpend() && !ExtractDestination(wtx.vout[1].scriptPubKey, address))\n            return parts;\n\n        if (wtx.IsZerocoinSpend() && (fZSpendFromMe || wallet->zpivTracker->HasMintTx(hash))) {\n            \/\/zPIV stake reward\n            sub.involvesWatchAddress = false;\n            sub.type = TransactionRecord::StakeZPIV;\n            sub.address = mapValue[\"zerocoinmint\"];\n            sub.credit = 0;\n            for (const CTxOut& out : wtx.vout) {\n                if (out.IsZerocoinMint())\n                    sub.credit += out.nValue;\n            }\n            sub.debit -= wtx.vin[0].nSequence * COIN;\n        } else if (isminetype mine = wallet->IsMine(wtx.vout[1])) {\n            \/\/ PIV stake reward\n            sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n            sub.type = TransactionRecord::StakeMint;\n            sub.address = CBitcoinAddress(address).ToString();\n            sub.credit = nNet;\n        } else {\n            \/\/Masternode reward\n            CTxDestination destMN;\n            int nIndexMN = wtx.vout.size() - 1;\n            if (ExtractDestination(wtx.vout[nIndexMN].scriptPubKey, destMN) && IsMine(*wallet, destMN)) {\n                isminetype mine = wallet->IsMine(wtx.vout[nIndexMN]);\n                sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n                sub.type = TransactionRecord::MNReward;\n                sub.address = CBitcoinAddress(destMN).ToString();\n                sub.credit = wtx.vout[nIndexMN].nValue;\n            }\n        }\n\n        parts.append(sub);\n    } else if (wtx.IsZerocoinSpend()) {\n        \/\/zerocoin spend outputs\n        bool fFeeAssigned = false;\n        for (const CTxOut txout : wtx.vout) {\n            \/\/ change that was reminted as zerocoins\n            if (txout.IsZerocoinMint()) {\n                \/\/ do not display record if this isn't from our wallet\n                if (!fZSpendFromMe)\n                    continue;\n\n                isminetype mine = wallet->IsMine(txout);\n                TransactionRecord sub(hash, nTime);\n                sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n                sub.type = TransactionRecord::ZerocoinSpend_Change_zPiv;\n                sub.address = mapValue[\"zerocoinmint\"];\n                if (!fFeeAssigned) {\n                    sub.debit -= (wtx.GetZerocoinSpent() - wtx.GetValueOut());\n                    fFeeAssigned = true;\n                }\n                sub.idx = parts.size();\n                parts.append(sub);\n                continue;\n            }\n\n            string strAddress = \"\";\n            CTxDestination address;\n            if (ExtractDestination(txout.scriptPubKey, address))\n                strAddress = CBitcoinAddress(address).ToString();\n\n            \/\/ a zerocoinspend that was sent to an address held by this wallet\n            isminetype mine = wallet->IsMine(txout);\n            if (mine) {\n                TransactionRecord sub(hash, nTime);\n                sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n                if (fZSpendFromMe) {\n                    sub.type = TransactionRecord::ZerocoinSpend_FromMe;\n                } else {\n                    sub.type = TransactionRecord::RecvFromZerocoinSpend;\n                    sub.credit = txout.nValue;\n                }\n                sub.address = mapValue[\"recvzerocoinspend\"];\n                if (strAddress != \"\")\n                    sub.address = strAddress;\n                sub.idx = parts.size();\n                parts.append(sub);\n                continue;\n            }\n\n            \/\/ spend is not from us, so do not display the spend side of the record\n            if (!fZSpendFromMe)\n                continue;\n\n            \/\/ zerocoin spend that was sent to someone else\n            TransactionRecord sub(hash, nTime);\n            sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n            sub.debit = -txout.nValue;\n            sub.type = TransactionRecord::ZerocoinSpend;\n            sub.address = mapValue[\"zerocoinspend\"];\n            if (strAddress != \"\")\n                sub.address = strAddress;\n            sub.idx = parts.size();\n            parts.append(sub);\n        }\n    } else if (nNet > 0 || wtx.IsCoinBase()) {\n        \/\/\n        \/\/ Credit\n        \/\/\n        BOOST_FOREACH (const CTxOut& txout, wtx.vout) {\n            isminetype mine = wallet->IsMine(txout);\n            if (mine) {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n                sub.credit = txout.nValue;\n                sub.involvesWatchAddress = mine & ISMINE_WATCH_ONLY;\n                if (ExtractDestination(txout.scriptPubKey, address) && IsMine(*wallet, address)) {\n                    \/\/ Received by PIVX Address\n                    sub.type = TransactionRecord::RecvWithAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                } else {\n                    \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n                if (wtx.IsCoinBase()) {\n                    \/\/ Generated\n                    sub.type = TransactionRecord::Generated;\n                }\n\n                parts.append(sub);\n            }\n        }\n    } else {\n        bool fAllFromMeDenom = true;\n        int nFromMe = 0;\n        bool involvesWatchAddress = false;\n        isminetype fAllFromMe = ISMINE_SPENDABLE;\n        BOOST_FOREACH (const CTxIn& txin, wtx.vin) {\n            if (wallet->IsMine(txin)) {\n                fAllFromMeDenom = fAllFromMeDenom && wallet->IsDenominated(txin);\n                nFromMe++;\n            }\n            isminetype mine = wallet->IsMine(txin);\n            if (mine & ISMINE_WATCH_ONLY) involvesWatchAddress = true;\n            if (fAllFromMe > mine) fAllFromMe = mine;\n        }\n\n        isminetype fAllToMe = ISMINE_SPENDABLE;\n        bool fAllToMeDenom = true;\n        int nToMe = 0;\n        BOOST_FOREACH (const CTxOut& txout, wtx.vout) {\n            if (wallet->IsMine(txout)) {\n                fAllToMeDenom = fAllToMeDenom && wallet->IsDenominatedAmount(txout.nValue);\n                nToMe++;\n            }\n            isminetype mine = wallet->IsMine(txout);\n            if (mine & ISMINE_WATCH_ONLY) involvesWatchAddress = true;\n            if (fAllToMe > mine) fAllToMe = mine;\n        }\n\n        if (fAllFromMeDenom && fAllToMeDenom && nFromMe * nToMe) {\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::ObfuscationDenominate, \"\", -nDebit, nCredit));\n            parts.last().involvesWatchAddress = false; \/\/ maybe pass to TransactionRecord as constructor argument\n        } else if (fAllFromMe && fAllToMe) {\n            \/\/ Payment to self\n            \/\/ TODO: this section still not accurate but covers most cases,\n            \/\/ might need some additional work however\n\n            TransactionRecord sub(hash, nTime);\n            \/\/ Payment to self by default\n            sub.type = TransactionRecord::SendToSelf;\n            sub.address = \"\";\n\n            if (mapValue[\"DS\"] == \"1\") {\n                sub.type = TransactionRecord::Obfuscated;\n                CTxDestination address;\n                if (ExtractDestination(wtx.vout[0].scriptPubKey, address)) {\n                    \/\/ Sent to PIVX Address\n                    sub.address = CBitcoinAddress(address).ToString();\n                } else {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.address = mapValue[\"to\"];\n                }\n            } else {\n                for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++) {\n                    const CTxOut& txout = wtx.vout[nOut];\n                    sub.idx = parts.size();\n\n                    if (wallet->IsCollateralAmount(txout.nValue)) sub.type = TransactionRecord::ObfuscationMakeCollaterals;\n                    if (wallet->IsDenominatedAmount(txout.nValue)) sub.type = TransactionRecord::ObfuscationCreateDenominations;\n                    if (nDebit - wtx.GetValueOut() == OBFUSCATION_COLLATERAL) sub.type = TransactionRecord::ObfuscationCollateralPayment;\n                }\n            }\n\n            CAmount nChange = wtx.GetChange();\n\n            sub.debit = -(nDebit - nChange);\n            sub.credit = nCredit - nChange;\n            parts.append(sub);\n            parts.last().involvesWatchAddress = involvesWatchAddress; \/\/ maybe pass to TransactionRecord as constructor argument\n        } else if (fAllFromMe || wtx.IsZerocoinMint()) {\n            \/\/\n            \/\/ Debit\n            \/\/\n            CAmount nTxFee = nDebit - wtx.GetValueOut();\n\n            for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++) {\n                const CTxOut& txout = wtx.vout[nOut];\n                TransactionRecord sub(hash, nTime);\n                sub.idx = parts.size();\n                sub.involvesWatchAddress = involvesWatchAddress;\n\n                if (wallet->IsMine(txout)) {\n                    \/\/ Ignore parts sent to self, as this is usually the change\n                    \/\/ from a transaction sent back to our own address.\n                    continue;\n                }\n\n                CTxDestination address;\n                if (ExtractDestination(txout.scriptPubKey, address)) {\n                    \/\/This is most likely only going to happen when resyncing deterministic wallet without the knowledge of the\n                    \/\/private keys that the change was sent to. Do not display a \"sent to\" here.\n                    if (wtx.IsZerocoinMint())\n                        continue;\n                    \/\/ Sent to PIVX Address\n                    sub.type = TransactionRecord::SendToAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                } else if (txout.IsZerocoinMint()){\n                    sub.type = TransactionRecord::ZerocoinMint;\n                    sub.address = mapValue[\"zerocoinmint\"];\n                    sub.credit += txout.nValue;\n                } else {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::SendToOther;\n                    sub.address = mapValue[\"to\"];\n                }\n\n                if (mapValue[\"DS\"] == \"1\") {\n                    sub.type = TransactionRecord::Obfuscated;\n                }\n\n                CAmount nValue = txout.nValue;\n                \/* Add fee to first output *\/\n                if (nTxFee > 0) {\n                    nValue += nTxFee;\n                    nTxFee = 0;\n                }\n                sub.debit = -nValue;\n\n                parts.append(sub);\n            }\n        } else {\n            \/\/\n            \/\/ Mixed debit transaction, can't break down payees\n            \/\/\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0));\n            parts.last().involvesWatchAddress = involvesWatchAddress;\n        }\n    }\n\n    return parts;\n}\n\nbool IsZPIVType(TransactionRecord::Type type)\n{\n    switch (type) {\n        case TransactionRecord::StakeZPIV:\n        case TransactionRecord::ZerocoinMint:\n        case TransactionRecord::ZerocoinSpend:\n        case TransactionRecord::RecvFromZerocoinSpend:\n        case TransactionRecord::ZerocoinSpend_Change_zPiv:\n        case TransactionRecord::ZerocoinSpend_FromMe:\n            return true;\n        default:\n            return false;\n    }\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx& wtx)\n{\n    AssertLockHeld(cs_main);\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    BlockMap::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    \/\/status.countsForBalance = wtx.IsTrusted() && !(wtx.GetBlocksToMaturity() > 0);\n    status.depth = wtx.GetDepthInMainChain();\n\n    \/\/Determine the depth of the block\n    int nBlocksToMaturity = wtx.GetBlocksToMaturity();\n\n    status.countsForBalance = wtx.IsTrusted() && !(nBlocksToMaturity > 0);\n    status.cur_num_blocks = chainActive.Height();\n    status.cur_num_ix_locks = nCompleteTXLocks;\n\n    if (!IsFinalTx(wtx, chainActive.Height() + 1)) {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD) {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = wtx.nLockTime - chainActive.Height();\n        } else {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n    \/\/ For generated transactions, determine maturity\n    else if (type == TransactionRecord::Generated || type == TransactionRecord::StakeMint || type == TransactionRecord::StakeZPIV || type == TransactionRecord::MNReward) {\n        if (nBlocksToMaturity > 0) {\n            status.status = TransactionStatus::Immature;\n            status.matures_in = nBlocksToMaturity;\n\n            if (pindex && chainActive.Contains(pindex)) {\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.status = TransactionStatus::MaturesWarning;\n            } else {\n                status.status = TransactionStatus::NotAccepted;\n            }\n        } else {\n            status.status = TransactionStatus::Confirmed;\n            status.matures_in = 0;\n        }\n    } else {\n        if (status.depth < 0) {\n            status.status = TransactionStatus::Conflicted;\n        } else if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0) {\n            status.status = TransactionStatus::Offline;\n        } else if (status.depth == 0) {\n            status.status = TransactionStatus::Unconfirmed;\n        } else if (status.depth < RecommendedNumConfirmations) {\n            status.status = TransactionStatus::Confirming;\n        } else {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    AssertLockHeld(cs_main);\n    return status.cur_num_blocks != chainActive.Height() || status.cur_num_ix_locks != nCompleteTXLocks;\n}\n\nQString TransactionRecord::getTxID() const\n{\n    return QString::fromStdString(hash.ToString());\n}\n\nint TransactionRecord::getOutputIndex() const\n{\n    return idx;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Dash 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 \"transactionrecord.h\"\n\n#include \"base58.h\"\n#include \"timedata.h\"\n#include \"wallet.h\"\n#include \"darksend.h\"\n#include \"instantx.h\"\n\n#include <stdint.h>\n\n\/* Return positive answer if transaction should be shown in list.\n *\/\nbool TransactionRecord::showTransaction(const CWalletTx &wtx)\n{\n    if (wtx.IsCoinBase())\n    {\n        \/\/ Ensures we show generated coins \/ mined transactions at depth 1\n        if (!wtx.IsInMainChain())\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet *wallet, const CWalletTx &wtx)\n{\n    QList<TransactionRecord> parts;\n    int64_t nTime = wtx.GetTxTime();\n    CAmount nCredit = wtx.GetCredit(ISMINE_ALL);\n    CAmount nDebit = wtx.GetDebit(ISMINE_ALL);\n    CAmount nNet = nCredit - nDebit;\n    uint256 hash = wtx.GetHash();\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n\n    if (nNet > 0 || wtx.IsCoinBase())\n    {\n        \/\/\n        \/\/ Credit\n        \/\/\n        BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n        {\n            isminetype mine = wallet->IsMine(txout);\n            if(mine)\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n                sub.credit = txout.nValue;\n                sub.involvesWatchAddress = mine == ISMINE_WATCH_ONLY;\n                if (ExtractDestination(txout.scriptPubKey, address) && IsMine(*wallet, address))\n                {\n                    \/\/ Received by Dash Address\n                    sub.type = TransactionRecord::RecvWithAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n                if (wtx.IsCoinBase())\n                {\n                    \/\/ Generated\n                    sub.type = TransactionRecord::Generated;\n                }\n\n                parts.append(sub);\n            }\n        }\n    }\n    else\n    {\n        bool fAllFromMeDenom = true;\n        int nFromMe = 0;\n        bool involvesWatchAddress = false;\n        isminetype fAllFromMe = ISMINE_SPENDABLE;\n        BOOST_FOREACH(const CTxIn& txin, wtx.vin)\n        {\n            if(wallet->IsMine(txin)) {\n                fAllFromMeDenom = fAllFromMeDenom && wallet->IsDenominated(txin);\n                nFromMe++;\n            }\n            isminetype mine = wallet->IsMine(txin);\n            if(mine == ISMINE_WATCH_ONLY) involvesWatchAddress = true;\n            if(fAllFromMe > mine) fAllFromMe = mine;\n        }\n\n        isminetype fAllToMe = ISMINE_SPENDABLE;\n        bool fAllToMeDenom = true;\n        int nToMe = 0;\n        BOOST_FOREACH(const CTxOut& txout, wtx.vout) {\n            if(wallet->IsMine(txout)) {\n                fAllToMeDenom = fAllToMeDenom && wallet->IsDenominatedAmount(txout.nValue);\n                nToMe++;\n            }\n            isminetype mine = wallet->IsMine(txout);\n            if(mine == ISMINE_WATCH_ONLY) involvesWatchAddress = true;\n            if(fAllToMe > mine) fAllToMe = mine;\n        }\n\n        if(fAllFromMeDenom && fAllToMeDenom && nFromMe * nToMe) {\n            TransactionRecord sub(hash, nTime);\n            sub.type = TransactionRecord::DarksendDenominate;\n            parts.append(TransactionRecord(hash, nTime, sub.type, \"\", -nDebit, nCredit));\n        }\n        else if (fAllFromMe && fAllToMe)\n        {\n            \/\/ Payment to self\n            \/\/ TODO: this section still not accurate but covers most cases,\n            \/\/ might need some additional work however\n\n            TransactionRecord sub(hash, nTime);\n            \/\/ Payment to self by default\n            sub.type = TransactionRecord::SendToSelf;\n            sub.address = \"\";\n\n            if(mapValue[\"DS\"] == \"1\")\n            {\n                sub.type = TransactionRecord::Darksent;\n                CTxDestination address;\n                if (ExtractDestination(wtx.vout[0].scriptPubKey, address))\n                {\n                    \/\/ Sent to Dash Address\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.address = mapValue[\"to\"];\n                }\n            }\n            else\n            {\n                for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++)\n                {\n                    const CTxOut& txout = wtx.vout[nOut];\n                    sub.idx = parts.size();\n\n                    if(wallet->IsCollateralAmount(txout.nValue)) sub.type = TransactionRecord::DarksendMakeCollaterals;\n                    if(wallet->IsDenominatedAmount(txout.nValue)) sub.type = TransactionRecord::DarksendCreateDenominations;\n                    if(nDebit - wtx.GetValueOut() == DARKSEND_COLLATERAL) sub.type = TransactionRecord::DarksendCollateralPayment;\n                }\n            }\n\n            CAmount nChange = wtx.GetChange();\n\n            sub.debit = -(nDebit - nChange);\n            sub.credit = nCredit - nChange;\n            parts.append(sub);\n            parts.last().involvesWatchAddress = involvesWatchAddress;   \/\/ maybe pass to TransactionRecord as constructor argument\n        }\n        else if (fAllFromMe)\n        {\n            \/\/\n            \/\/ Debit\n            \/\/\n            CAmount nTxFee = nDebit - wtx.GetValueOut();\n\n            for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++)\n            {\n                const CTxOut& txout = wtx.vout[nOut];\n                TransactionRecord sub(hash, nTime);\n                sub.idx = parts.size();\n                sub.involvesWatchAddress = involvesWatchAddress;\n\n                if(wallet->IsMine(txout))\n                {\n                    \/\/ Ignore parts sent to self, as this is usually the change\n                    \/\/ from a transaction sent back to our own address.\n                    continue;\n                }\n\n                CTxDestination address;\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    \/\/ Sent to Dash Address\n                    sub.type = TransactionRecord::SendToAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::SendToOther;\n                    sub.address = mapValue[\"to\"];\n                }\n\n                if(mapValue[\"DS\"] == \"1\")\n                {\n                    sub.type = TransactionRecord::Darksent;\n                }\n\n                CAmount nValue = txout.nValue;\n                \/* Add fee to first output *\/\n                if (nTxFee > 0)\n                {\n                    nValue += nTxFee;\n                    nTxFee = 0;\n                }\n                sub.debit = -nValue;\n\n                parts.append(sub);\n            }\n        }\n        else\n        {\n            \/\/\n            \/\/ Mixed debit transaction, can't break down payees\n            \/\/\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0));\n            parts.last().involvesWatchAddress = involvesWatchAddress;\n        }\n    }\n\n    return parts;\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx &wtx)\n{\n    AssertLockHeld(cs_main);\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    BlockMap::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    status.countsForBalance = wtx.IsTrusted() && !(wtx.GetBlocksToMaturity() > 0);\n    status.depth = wtx.GetDepthInMainChain();\n    status.cur_num_blocks = chainActive.Height();\n    status.cur_num_ix_locks = nCompleteTXLocks;\n\n    if (!IsFinalTx(wtx, chainActive.Height() + 1))\n    {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD)\n        {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = wtx.nLockTime - chainActive.Height();\n        }\n        else\n        {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n    \/\/ For generated transactions, determine maturity\n    else if(type == TransactionRecord::Generated)\n    {\n        if (wtx.GetBlocksToMaturity() > 0)\n        {\n            status.status = TransactionStatus::Immature;\n\n            if (wtx.IsInMainChain())\n            {\n                status.matures_in = wtx.GetBlocksToMaturity();\n\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.status = TransactionStatus::MaturesWarning;\n            }\n            else\n            {\n                status.status = TransactionStatus::NotAccepted;\n            }\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n    else\n    {\n        if (status.depth < 0)\n        {\n            status.status = TransactionStatus::Conflicted;\n        }\n        else if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n        {\n            status.status = TransactionStatus::Offline;\n        }\n        else if (status.depth == 0)\n        {\n            status.status = TransactionStatus::Unconfirmed;\n        }\n        else if (status.depth < RecommendedNumConfirmations)\n        {\n            status.status = TransactionStatus::Confirming;\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    AssertLockHeld(cs_main);\n    return status.cur_num_blocks != chainActive.Height() || status.cur_num_ix_locks != nCompleteTXLocks;\n}\n\nQString TransactionRecord::getTxID() const\n{\n    return formatSubTxId(hash, idx);\n}\n\nQString TransactionRecord::formatSubTxId(const uint256 &hash, int vout)\n{\n    return QString::fromStdString(hash.ToString() + strprintf(\"-%03d\", vout));\n}\n\n<commit_msg>fix DSdenom\/watchonly<commit_after>\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Dash 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 \"transactionrecord.h\"\n\n#include \"base58.h\"\n#include \"timedata.h\"\n#include \"wallet.h\"\n#include \"darksend.h\"\n#include \"instantx.h\"\n\n#include <stdint.h>\n\n\/* Return positive answer if transaction should be shown in list.\n *\/\nbool TransactionRecord::showTransaction(const CWalletTx &wtx)\n{\n    if (wtx.IsCoinBase())\n    {\n        \/\/ Ensures we show generated coins \/ mined transactions at depth 1\n        if (!wtx.IsInMainChain())\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet *wallet, const CWalletTx &wtx)\n{\n    QList<TransactionRecord> parts;\n    int64_t nTime = wtx.GetTxTime();\n    CAmount nCredit = wtx.GetCredit(ISMINE_ALL);\n    CAmount nDebit = wtx.GetDebit(ISMINE_ALL);\n    CAmount nNet = nCredit - nDebit;\n    uint256 hash = wtx.GetHash();\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n\n    if (nNet > 0 || wtx.IsCoinBase())\n    {\n        \/\/\n        \/\/ Credit\n        \/\/\n        BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n        {\n            isminetype mine = wallet->IsMine(txout);\n            if(mine)\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n                sub.credit = txout.nValue;\n                sub.involvesWatchAddress = mine == ISMINE_WATCH_ONLY;\n                if (ExtractDestination(txout.scriptPubKey, address) && IsMine(*wallet, address))\n                {\n                    \/\/ Received by Dash Address\n                    sub.type = TransactionRecord::RecvWithAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n                if (wtx.IsCoinBase())\n                {\n                    \/\/ Generated\n                    sub.type = TransactionRecord::Generated;\n                }\n\n                parts.append(sub);\n            }\n        }\n    }\n    else\n    {\n        bool fAllFromMeDenom = true;\n        int nFromMe = 0;\n        bool involvesWatchAddress = false;\n        isminetype fAllFromMe = ISMINE_SPENDABLE;\n        BOOST_FOREACH(const CTxIn& txin, wtx.vin)\n        {\n            if(wallet->IsMine(txin)) {\n                fAllFromMeDenom = fAllFromMeDenom && wallet->IsDenominated(txin);\n                nFromMe++;\n            }\n            isminetype mine = wallet->IsMine(txin);\n            if(mine == ISMINE_WATCH_ONLY) involvesWatchAddress = true;\n            if(fAllFromMe > mine) fAllFromMe = mine;\n        }\n\n        isminetype fAllToMe = ISMINE_SPENDABLE;\n        bool fAllToMeDenom = true;\n        int nToMe = 0;\n        BOOST_FOREACH(const CTxOut& txout, wtx.vout) {\n            if(wallet->IsMine(txout)) {\n                fAllToMeDenom = fAllToMeDenom && wallet->IsDenominatedAmount(txout.nValue);\n                nToMe++;\n            }\n            isminetype mine = wallet->IsMine(txout);\n            if(mine == ISMINE_WATCH_ONLY) involvesWatchAddress = true;\n            if(fAllToMe > mine) fAllToMe = mine;\n        }\n\n        if(fAllFromMeDenom && fAllToMeDenom && nFromMe * nToMe) {\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::DarksendDenominate, \"\", -nDebit, nCredit));\n            parts.last().involvesWatchAddress = false;   \/\/ maybe pass to TransactionRecord as constructor argument\n        }\n        else if (fAllFromMe && fAllToMe)\n        {\n            \/\/ Payment to self\n            \/\/ TODO: this section still not accurate but covers most cases,\n            \/\/ might need some additional work however\n\n            TransactionRecord sub(hash, nTime);\n            \/\/ Payment to self by default\n            sub.type = TransactionRecord::SendToSelf;\n            sub.address = \"\";\n\n            if(mapValue[\"DS\"] == \"1\")\n            {\n                sub.type = TransactionRecord::Darksent;\n                CTxDestination address;\n                if (ExtractDestination(wtx.vout[0].scriptPubKey, address))\n                {\n                    \/\/ Sent to Dash Address\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.address = mapValue[\"to\"];\n                }\n            }\n            else\n            {\n                for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++)\n                {\n                    const CTxOut& txout = wtx.vout[nOut];\n                    sub.idx = parts.size();\n\n                    if(wallet->IsCollateralAmount(txout.nValue)) sub.type = TransactionRecord::DarksendMakeCollaterals;\n                    if(wallet->IsDenominatedAmount(txout.nValue)) sub.type = TransactionRecord::DarksendCreateDenominations;\n                    if(nDebit - wtx.GetValueOut() == DARKSEND_COLLATERAL) sub.type = TransactionRecord::DarksendCollateralPayment;\n                }\n            }\n\n            CAmount nChange = wtx.GetChange();\n\n            sub.debit = -(nDebit - nChange);\n            sub.credit = nCredit - nChange;\n            parts.append(sub);\n            parts.last().involvesWatchAddress = involvesWatchAddress;   \/\/ maybe pass to TransactionRecord as constructor argument\n        }\n        else if (fAllFromMe)\n        {\n            \/\/\n            \/\/ Debit\n            \/\/\n            CAmount nTxFee = nDebit - wtx.GetValueOut();\n\n            for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++)\n            {\n                const CTxOut& txout = wtx.vout[nOut];\n                TransactionRecord sub(hash, nTime);\n                sub.idx = parts.size();\n                sub.involvesWatchAddress = involvesWatchAddress;\n\n                if(wallet->IsMine(txout))\n                {\n                    \/\/ Ignore parts sent to self, as this is usually the change\n                    \/\/ from a transaction sent back to our own address.\n                    continue;\n                }\n\n                CTxDestination address;\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    \/\/ Sent to Dash Address\n                    sub.type = TransactionRecord::SendToAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::SendToOther;\n                    sub.address = mapValue[\"to\"];\n                }\n\n                if(mapValue[\"DS\"] == \"1\")\n                {\n                    sub.type = TransactionRecord::Darksent;\n                }\n\n                CAmount nValue = txout.nValue;\n                \/* Add fee to first output *\/\n                if (nTxFee > 0)\n                {\n                    nValue += nTxFee;\n                    nTxFee = 0;\n                }\n                sub.debit = -nValue;\n\n                parts.append(sub);\n            }\n        }\n        else\n        {\n            \/\/\n            \/\/ Mixed debit transaction, can't break down payees\n            \/\/\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0));\n            parts.last().involvesWatchAddress = involvesWatchAddress;\n        }\n    }\n\n    return parts;\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx &wtx)\n{\n    AssertLockHeld(cs_main);\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    BlockMap::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    status.countsForBalance = wtx.IsTrusted() && !(wtx.GetBlocksToMaturity() > 0);\n    status.depth = wtx.GetDepthInMainChain();\n    status.cur_num_blocks = chainActive.Height();\n    status.cur_num_ix_locks = nCompleteTXLocks;\n\n    if (!IsFinalTx(wtx, chainActive.Height() + 1))\n    {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD)\n        {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = wtx.nLockTime - chainActive.Height();\n        }\n        else\n        {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n    \/\/ For generated transactions, determine maturity\n    else if(type == TransactionRecord::Generated)\n    {\n        if (wtx.GetBlocksToMaturity() > 0)\n        {\n            status.status = TransactionStatus::Immature;\n\n            if (wtx.IsInMainChain())\n            {\n                status.matures_in = wtx.GetBlocksToMaturity();\n\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.status = TransactionStatus::MaturesWarning;\n            }\n            else\n            {\n                status.status = TransactionStatus::NotAccepted;\n            }\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n    else\n    {\n        if (status.depth < 0)\n        {\n            status.status = TransactionStatus::Conflicted;\n        }\n        else if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n        {\n            status.status = TransactionStatus::Offline;\n        }\n        else if (status.depth == 0)\n        {\n            status.status = TransactionStatus::Unconfirmed;\n        }\n        else if (status.depth < RecommendedNumConfirmations)\n        {\n            status.status = TransactionStatus::Confirming;\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    AssertLockHeld(cs_main);\n    return status.cur_num_blocks != chainActive.Height() || status.cur_num_ix_locks != nCompleteTXLocks;\n}\n\nQString TransactionRecord::getTxID() const\n{\n    return formatSubTxId(hash, idx);\n}\n\nQString TransactionRecord::formatSubTxId(const uint256 &hash, int vout)\n{\n    return QString::fromStdString(hash.ToString() + strprintf(\"-%03d\", vout));\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"transactionrecord.h\"\n\n#include \"headers.h\"\n\n\/* Return positive answer if transaction should be shown in list.\n *\/\nbool TransactionRecord::showTransaction(const CWalletTx &wtx)\n{\n    if (wtx.IsCoinBase())\n    {\n        \/\/ Don't show generated coin until confirmed by at least one block after it\n        \/\/ so we don't get the user's hopes up until it looks like it's probably accepted.\n        \/\/\n        \/\/ It is not an error when generated blocks are not accepted.  By design,\n        \/\/ some percentage of blocks, like 10% or more, will end up not accepted.\n        \/\/ This is the normal mechanism by which the network copes with latency.\n        \/\/\n        \/\/ We display regular transactions right away before any confirmation\n        \/\/ because they can always get into some block eventually.  Generated coins\n        \/\/ are special because if their block is not accepted, they are not valid.\n        \/\/\n        if (wtx.GetDepthInMainChain() < 2)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet *wallet, const CWalletTx &wtx)\n{\n    QList<TransactionRecord> parts;\n    int64 nTime = wtx.nTimeDisplayed = wtx.GetTxTime();\n    int64 nCredit = wtx.GetCredit(true);\n    int64 nDebit = wtx.GetDebit();\n    int64 nNet = nCredit - nDebit;\n    uint256 hash = wtx.GetHash();\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n\n    if (showTransaction(wtx))\n    {\n        if (nNet > 0 || wtx.IsCoinBase())\n        {\n            \/\/\n            \/\/ Credit\n            \/\/\n            TransactionRecord sub(hash, nTime);\n\n            sub.credit = nNet;\n\n            if (wtx.IsCoinBase())\n            {\n                \/\/ Generated\n                sub.type = TransactionRecord::Generated;\n\n                if (nCredit == 0)\n                {\n                    int64 nUnmatured = 0;\n                    BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n                        nUnmatured += wallet->GetCredit(txout);\n                    sub.credit = nUnmatured;\n                }\n            }\n            else\n            {\n                bool foundAddress = false;\n                \/\/ Received by Bitcoin Address\n                BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n                {\n                    if(wallet->IsMine(txout))\n                    {\n                        CBitcoinAddress address;\n                        if (ExtractAddress(txout.scriptPubKey, address) && wallet->HaveKey(address))\n                        {\n                            sub.type = TransactionRecord::RecvWithAddress;\n                            sub.address = address.ToString();\n                            foundAddress = true;\n                            break;\n                        }\n                    }\n                }\n                if(!foundAddress)\n                {\n                    \/\/ Received by IP connection, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n            }\n            parts.append(sub);\n        }\n        else\n        {\n            bool fAllFromMe = true;\n            BOOST_FOREACH(const CTxIn& txin, wtx.vin)\n                fAllFromMe = fAllFromMe && wallet->IsMine(txin);\n\n            bool fAllToMe = true;\n            BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n                fAllToMe = fAllToMe && wallet->IsMine(txout);\n\n            if (fAllFromMe && fAllToMe)\n            {\n                \/\/ Payment to self\n                int64 nChange = wtx.GetChange();\n\n                parts.append(TransactionRecord(hash, nTime, TransactionRecord::SendToSelf, \"\",\n                                -(nDebit - nChange), nCredit - nChange));\n            }\n            else if (fAllFromMe)\n            {\n                \/\/\n                \/\/ Debit\n                \/\/\n                int64 nTxFee = nDebit - wtx.GetValueOut();\n\n                for (int nOut = 0; nOut < wtx.vout.size(); nOut++)\n                {\n                    const CTxOut& txout = wtx.vout[nOut];\n                    TransactionRecord sub(hash, nTime);\n                    sub.idx = parts.size();\n\n                    if(wallet->IsMine(txout))\n                    {\n                        \/\/ Ignore parts sent to self, as this is usually the change\n                        \/\/ from a transaction sent back to our own address.\n                        continue;\n                    }\n\n                    CBitcoinAddress address;\n                    if (ExtractAddress(txout.scriptPubKey, address))\n                    {\n                        \/\/ Sent to Bitcoin Address\n                        sub.type = TransactionRecord::SendToAddress;\n                        sub.address = address.ToString();\n                    }\n                    else\n                    {\n                        \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                        sub.type = TransactionRecord::SendToOther;\n                        sub.address = mapValue[\"to\"];\n                    }\n\n                    int64 nValue = txout.nValue;\n                    \/* Add fee to first output *\/\n                    if (nTxFee > 0)\n                    {\n                        nValue += nTxFee;\n                        nTxFee = 0;\n                    }\n                    sub.debit = -nValue;\n\n                    parts.append(sub);\n                }\n            }\n            else\n            {\n                \/\/\n                \/\/ Mixed debit transaction, can't break down payees\n                \/\/\n                bool fAllMine = true;\n                BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n                    fAllMine = fAllMine && wallet->IsMine(txout);\n                BOOST_FOREACH(const CTxIn& txin, wtx.vin)\n                    fAllMine = fAllMine && wallet->IsMine(txin);\n\n                parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0));\n            }\n        }\n    }\n\n    return parts;\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx &wtx)\n{\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    status.confirmed = wtx.IsConfirmed();\n    status.depth = wtx.GetDepthInMainChain();\n    status.cur_num_blocks = nBestHeight;\n\n    if (!wtx.IsFinal())\n    {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD)\n        {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = nBestHeight - wtx.nLockTime;\n        }\n        else\n        {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n    else\n    {\n        if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n        {\n            status.status = TransactionStatus::Offline;\n        }\n        else if (status.depth < NumConfirmations)\n        {\n            status.status = TransactionStatus::Unconfirmed;\n        }\n        else\n        {\n            status.status = TransactionStatus::HaveConfirmations;\n        }\n    }\n\n    \/\/ For generated transactions, determine maturity\n    if(type == TransactionRecord::Generated)\n    {\n        int64 nCredit = wtx.GetCredit(true);\n        if (nCredit == 0)\n        {\n            status.maturity = TransactionStatus::Immature;\n\n            if (wtx.IsInMainChain())\n            {\n                status.matures_in = wtx.GetBlocksToMaturity();\n\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.maturity = TransactionStatus::MaturesWarning;\n            }\n            else\n            {\n                status.maturity = TransactionStatus::NotAccepted;\n            }\n        }\n        else\n        {\n            status.maturity = TransactionStatus::Mature;\n        }\n    }\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    return status.cur_num_blocks != nBestHeight;\n}\n\nstd::string TransactionRecord::getTxID()\n{\n    return hash.ToString() + strprintf(\"-%03d\", idx);\n}\n\n<commit_msg>Restructure credit transaction decomposition (solves issue #689)<commit_after>#include \"transactionrecord.h\"\n\n#include \"headers.h\"\n\n\/* Return positive answer if transaction should be shown in list.\n *\/\nbool TransactionRecord::showTransaction(const CWalletTx &wtx)\n{\n    if (wtx.IsCoinBase())\n    {\n        \/\/ Don't show generated coin until confirmed by at least one block after it\n        \/\/ so we don't get the user's hopes up until it looks like it's probably accepted.\n        \/\/\n        \/\/ It is not an error when generated blocks are not accepted.  By design,\n        \/\/ some percentage of blocks, like 10% or more, will end up not accepted.\n        \/\/ This is the normal mechanism by which the network copes with latency.\n        \/\/\n        \/\/ We display regular transactions right away before any confirmation\n        \/\/ because they can always get into some block eventually.  Generated coins\n        \/\/ are special because if their block is not accepted, they are not valid.\n        \/\/\n        if (wtx.GetDepthInMainChain() < 2)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet *wallet, const CWalletTx &wtx)\n{\n    QList<TransactionRecord> parts;\n    int64 nTime = wtx.nTimeDisplayed = wtx.GetTxTime();\n    int64 nCredit = wtx.GetCredit(true);\n    int64 nDebit = wtx.GetDebit();\n    int64 nNet = nCredit - nDebit;\n    uint256 hash = wtx.GetHash();\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n\n    if (showTransaction(wtx))\n    {\n        if (nNet > 0 || wtx.IsCoinBase())\n        {\n            \/\/\n            \/\/ Credit\n            \/\/\n            BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n            {\n                if(wallet->IsMine(txout))\n                {\n                    TransactionRecord sub(hash, nTime);\n                    CBitcoinAddress address;\n                    sub.idx = parts.size(); \/\/ sequence number\n                    sub.credit = txout.nValue;\n                    if (wtx.IsCoinBase())\n                    {\n                        \/\/ Generated\n                        sub.type = TransactionRecord::Generated;\n                    }\n                    else if (ExtractAddress(txout.scriptPubKey, address) && wallet->HaveKey(address))\n                    {\n                        \/\/ Received by Bitcoin Address\n                        sub.type = TransactionRecord::RecvWithAddress;\n                        sub.address = address.ToString();\n                    }\n                    else\n                    {\n                        \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                        sub.type = TransactionRecord::RecvFromOther;\n                        sub.address = mapValue[\"from\"];\n                    }\n\n                    parts.append(sub);\n                }\n            }\n        }\n        else\n        {\n            bool fAllFromMe = true;\n            BOOST_FOREACH(const CTxIn& txin, wtx.vin)\n                fAllFromMe = fAllFromMe && wallet->IsMine(txin);\n\n            bool fAllToMe = true;\n            BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n                fAllToMe = fAllToMe && wallet->IsMine(txout);\n\n            if (fAllFromMe && fAllToMe)\n            {\n                \/\/ Payment to self\n                int64 nChange = wtx.GetChange();\n\n                parts.append(TransactionRecord(hash, nTime, TransactionRecord::SendToSelf, \"\",\n                                -(nDebit - nChange), nCredit - nChange));\n            }\n            else if (fAllFromMe)\n            {\n                \/\/\n                \/\/ Debit\n                \/\/\n                int64 nTxFee = nDebit - wtx.GetValueOut();\n\n                for (int nOut = 0; nOut < wtx.vout.size(); nOut++)\n                {\n                    const CTxOut& txout = wtx.vout[nOut];\n                    TransactionRecord sub(hash, nTime);\n                    sub.idx = parts.size();\n\n                    if(wallet->IsMine(txout))\n                    {\n                        \/\/ Ignore parts sent to self, as this is usually the change\n                        \/\/ from a transaction sent back to our own address.\n                        continue;\n                    }\n\n                    CBitcoinAddress address;\n                    if (ExtractAddress(txout.scriptPubKey, address))\n                    {\n                        \/\/ Sent to Bitcoin Address\n                        sub.type = TransactionRecord::SendToAddress;\n                        sub.address = address.ToString();\n                    }\n                    else\n                    {\n                        \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                        sub.type = TransactionRecord::SendToOther;\n                        sub.address = mapValue[\"to\"];\n                    }\n\n                    int64 nValue = txout.nValue;\n                    \/* Add fee to first output *\/\n                    if (nTxFee > 0)\n                    {\n                        nValue += nTxFee;\n                        nTxFee = 0;\n                    }\n                    sub.debit = -nValue;\n\n                    parts.append(sub);\n                }\n            }\n            else\n            {\n                \/\/\n                \/\/ Mixed debit transaction, can't break down payees\n                \/\/\n                bool fAllMine = true;\n                BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n                    fAllMine = fAllMine && wallet->IsMine(txout);\n                BOOST_FOREACH(const CTxIn& txin, wtx.vin)\n                    fAllMine = fAllMine && wallet->IsMine(txin);\n\n                parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0));\n            }\n        }\n    }\n\n    return parts;\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx &wtx)\n{\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    status.confirmed = wtx.IsConfirmed();\n    status.depth = wtx.GetDepthInMainChain();\n    status.cur_num_blocks = nBestHeight;\n\n    if (!wtx.IsFinal())\n    {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD)\n        {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = nBestHeight - wtx.nLockTime;\n        }\n        else\n        {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n    else\n    {\n        if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n        {\n            status.status = TransactionStatus::Offline;\n        }\n        else if (status.depth < NumConfirmations)\n        {\n            status.status = TransactionStatus::Unconfirmed;\n        }\n        else\n        {\n            status.status = TransactionStatus::HaveConfirmations;\n        }\n    }\n\n    \/\/ For generated transactions, determine maturity\n    if(type == TransactionRecord::Generated)\n    {\n        int64 nCredit = wtx.GetCredit(true);\n        if (nCredit == 0)\n        {\n            status.maturity = TransactionStatus::Immature;\n\n            if (wtx.IsInMainChain())\n            {\n                status.matures_in = wtx.GetBlocksToMaturity();\n\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.maturity = TransactionStatus::MaturesWarning;\n            }\n            else\n            {\n                status.maturity = TransactionStatus::NotAccepted;\n            }\n        }\n        else\n        {\n            status.maturity = TransactionStatus::Mature;\n        }\n    }\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    return status.cur_num_blocks != nBestHeight;\n}\n\nstd::string TransactionRecord::getTxID()\n{\n    return hash.ToString() + strprintf(\"-%03d\", idx);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* (C) 2014,2015 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include \"tests.h\"\n\n#if defined(BOTAN_HAS_BCRYPT)\n  #include <botan\/bcrypt.h>\n#endif\n\n#if defined(BOTAN_HAS_PASSHASH9)\n  #include <botan\/passhash9.h>\n#endif\n\nnamespace Botan_Tests {\n\nnamespace {\n\n#if defined(BOTAN_HAS_BCRYPT)\nclass Bcrypt_Tests : public Text_Based_Test\n   {\n   public:\n      Bcrypt_Tests() : Text_Based_Test(\"bcrypt.vec\", \"Password,Passhash\") {}\n\n      Test::Result run_one_test(const std::string&, const VarMap& vars) override\n         {\n         \/\/ Encoded as binary so we can test binary inputs\n         const std::vector<uint8_t> password_vec = get_req_bin(vars, \"Password\");\n         const std::string password(reinterpret_cast<const char*>(password_vec.data()),\n                                    password_vec.size());\n\n         const std::string passhash = get_req_str(vars, \"Passhash\");\n\n         Test::Result result(\"bcrypt\");\n         result.test_eq(\"correct hash accepted\", Botan::check_bcrypt(password, passhash), true);\n\n         const size_t max_level = (Test::run_long_tests() ? 18 : 11);\n\n         for(size_t level = 1; level <= max_level; ++level)\n            {\n            const std::string gen_hash = generate_bcrypt(password, Test::rng(), level);\n            result.test_eq(\"generated hash accepted\", Botan::check_bcrypt(password, gen_hash), true);\n            }\n\n         return result;\n         }\n   };\n\nBOTAN_REGISTER_TEST(\"bcrypt\", Bcrypt_Tests);\n\n#endif\n\n#if defined(BOTAN_HAS_PASSHASH9)\nclass Passhash9_Tests : public Text_Based_Test\n   {\n   public:\n      Passhash9_Tests() : Text_Based_Test(\"passhash9.vec\", \"Password,Passhash\") {}\n\n      Test::Result run_one_test(const std::string&, const VarMap& vars) override\n         {\n         \/\/ Encoded as binary so we can test binary inputs\n         const std::vector<uint8_t> password_vec = get_req_bin(vars, \"Password\");\n         const std::string password(reinterpret_cast<const char*>(password_vec.data()),\n                                    password_vec.size());\n\n         const std::string passhash = get_req_str(vars, \"Passhash\");\n\n         Test::Result result(\"passhash9\");\n         result.test_eq(\"correct hash accepted\", Botan::check_passhash9(password, passhash), true);\n\n         for(uint8_t alg_id = 0; alg_id <= 4; ++alg_id)\n            {\n            const std::string gen_hash = Botan::generate_passhash9(password, Test::rng(), 2, alg_id);\n\n            if(!result.test_eq(\"generated hash accepted\", Botan::check_passhash9(password, gen_hash), true))\n               {\n               result.test_note(\"hash was \" + gen_hash);\n               }\n            }\n\n         const size_t max_level = (Test::run_long_tests() ? 16 : 8);\n\n         for(size_t level = 1; level <= max_level; ++level)\n            {\n            const std::string gen_hash = Botan::generate_passhash9(password, Test::rng(), level);\n            if(!result.test_eq(\"generated hash accepted\", Botan::check_passhash9(password, gen_hash), true))\n               {\n               result.test_note(\"hash was \" + gen_hash);\n               }\n            }\n\n         return result;\n         }\n   };\n\nBOTAN_REGISTER_TEST(\"passhash9\", Passhash9_Tests);\n\n#endif\n\n}\n\n}\n<commit_msg>Travis did not like these long tests<commit_after>\/*\n* (C) 2014,2015 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include \"tests.h\"\n\n#if defined(BOTAN_HAS_BCRYPT)\n  #include <botan\/bcrypt.h>\n#endif\n\n#if defined(BOTAN_HAS_PASSHASH9)\n  #include <botan\/passhash9.h>\n#endif\n\nnamespace Botan_Tests {\n\nnamespace {\n\n#if defined(BOTAN_HAS_BCRYPT)\nclass Bcrypt_Tests : public Text_Based_Test\n   {\n   public:\n      Bcrypt_Tests() : Text_Based_Test(\"bcrypt.vec\", \"Password,Passhash\") {}\n\n      Test::Result run_one_test(const std::string&, const VarMap& vars) override\n         {\n         \/\/ Encoded as binary so we can test binary inputs\n         const std::vector<uint8_t> password_vec = get_req_bin(vars, \"Password\");\n         const std::string password(reinterpret_cast<const char*>(password_vec.data()),\n                                    password_vec.size());\n\n         const std::string passhash = get_req_str(vars, \"Passhash\");\n\n         Test::Result result(\"bcrypt\");\n         result.test_eq(\"correct hash accepted\", Botan::check_bcrypt(password, passhash), true);\n\n         const size_t max_level = (Test::run_long_tests() ? 14 : 11);\n\n         for(size_t level = 1; level <= max_level; ++level)\n            {\n            const std::string gen_hash = generate_bcrypt(password, Test::rng(), level);\n            result.test_eq(\"generated hash accepted\", Botan::check_bcrypt(password, gen_hash), true);\n            }\n\n         return result;\n         }\n   };\n\nBOTAN_REGISTER_TEST(\"bcrypt\", Bcrypt_Tests);\n\n#endif\n\n#if defined(BOTAN_HAS_PASSHASH9)\nclass Passhash9_Tests : public Text_Based_Test\n   {\n   public:\n      Passhash9_Tests() : Text_Based_Test(\"passhash9.vec\", \"Password,Passhash\") {}\n\n      Test::Result run_one_test(const std::string&, const VarMap& vars) override\n         {\n         \/\/ Encoded as binary so we can test binary inputs\n         const std::vector<uint8_t> password_vec = get_req_bin(vars, \"Password\");\n         const std::string password(reinterpret_cast<const char*>(password_vec.data()),\n                                    password_vec.size());\n\n         const std::string passhash = get_req_str(vars, \"Passhash\");\n\n         Test::Result result(\"passhash9\");\n         result.test_eq(\"correct hash accepted\", Botan::check_passhash9(password, passhash), true);\n\n         for(uint8_t alg_id = 0; alg_id <= 4; ++alg_id)\n            {\n            const std::string gen_hash = Botan::generate_passhash9(password, Test::rng(), 2, alg_id);\n\n            if(!result.test_eq(\"generated hash accepted\", Botan::check_passhash9(password, gen_hash), true))\n               {\n               result.test_note(\"hash was \" + gen_hash);\n               }\n            }\n\n         const size_t max_level = (Test::run_long_tests() ? 14 : 8);\n\n         for(size_t level = 1; level <= max_level; ++level)\n            {\n            const std::string gen_hash = Botan::generate_passhash9(password, Test::rng(), level);\n            if(!result.test_eq(\"generated hash accepted\", Botan::check_passhash9(password, gen_hash), true))\n               {\n               result.test_note(\"hash was \" + gen_hash);\n               }\n            }\n\n         return result;\n         }\n   };\n\nBOTAN_REGISTER_TEST(\"passhash9\", Passhash9_Tests);\n\n#endif\n\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef diff_hh_INCLUDED\n#define diff_hh_INCLUDED\n\n\/\/ Implementation of the linear space variant of the algorithm described in\n\/\/ \"An O(ND) Difference Algorithm and Its Variations\"\n\/\/ (http:\/\/xmailserver.org\/diff2.pdf)\n\n#include \"array_view.hh\"\n#include \"vector.hh\"\n\n#include <functional>\n#include <iterator>\n\nnamespace Kakoune\n{\n\nstruct Snake{ int x, y, u, v; bool add; };\n\ntemplate<typename Iterator, typename Equal>\nSnake find_end_snake_of_further_reaching_dpath(Iterator a, int N, Iterator b, int M,\n                                               const int* V, const int D, const int k, Equal eq)\n{\n    const bool add = k == -D or (k != D and V[k-1] < V[k+1]);\n\n    \/\/ if diagonal on the right goes further along x than diagonal on the left,\n    \/\/ then we take a vertical edge from it to this diagonal, hence x = V[k+1]\n    \/\/ else, we take an horizontal edge from our left diagonal,x = V[k-1]+1\n    const int x = add ? V[k+1] : V[k-1]+1;\n    \/\/ we are by construction on diagonal k, so our position along b (y) is x - k.\n    const int y = x - k;\n\n    int u = x, v = y;\n    \/\/ follow end snake along diagonal k\n    while (u < N and v < M and eq(a[u], b[v]))\n        ++u, ++v;\n\n    return { x, y, u, v, add };\n}\n\nstruct SnakeLen : Snake\n{\n    SnakeLen(Snake s, bool reverse, int d) : Snake(s), reverse(reverse), d(d) {}\n    const bool reverse;\n    const int d;\n};\n\ntemplate<typename Iterator, typename Equal>\nSnakeLen find_middle_snake(Iterator a, int N, Iterator b, int M,\n                           int* V1, int* V2, Equal eq)\n{\n    const int delta = N - M;\n    V1[1] = 0;\n    V2[1] = 0;\n\n    std::reverse_iterator<Iterator> ra{a + N}, rb{b + M};\n\n    for (int D = 0; D <= (M + N + 1) \/ 2; ++D)\n    {\n        for (int k1 = -D; k1 <= D; k1 += 2)\n        {\n            auto p = find_end_snake_of_further_reaching_dpath(a, N, b, M, V1, D, k1, eq);\n            V1[k1] = p.u;\n\n            const int k2 = -(k1 - delta);\n            if ((delta % 2 != 0) and -(D-1) <= k2 and k2 <= (D-1))\n            {\n                if (V1[k1] + V2[k2] >= N)\n                    return { p, false, 2 * D - 1 };\/\/ return last snake on forward path\n            }\n        }\n\n        for (int k2 = -D; k2 <= D; k2 += 2)\n        {\n            auto p = find_end_snake_of_further_reaching_dpath(ra, N, rb, M, V2, D, k2, eq);\n            V2[k2] = p.u;\n\n            const int k1 = -(k2 - delta);\n            if ((delta % 2 == 0) and -D <= k1 and k1 <= D)\n            {\n                if (V1[k1] + V2[k2] >= N)\n                    return { { N - p.u, M - p.v, N - p.x , M - p.y, p.add } , true, 2 * D };\/\/ return last snake on reverse path\n            }\n        }\n    }\n\n    kak_assert(false);\n    return { {}, false, 0 };\n}\n\nstruct Diff\n{\n    enum { Keep, Add, Remove } mode;\n    int len;\n    int posB;\n};\n\ninline void append_diff(Vector<Diff>& diffs, Diff diff)\n{\n    if (diff.len == 0)\n        return;\n\n    if (not diffs.empty() and diffs.back().mode == diff.mode\n        and (diff.mode != Diff::Add or\n             diffs.back().posB + diffs.back().len == diff.posB))\n        diffs.back().len += diff.len;\n    else\n        diffs.push_back(diff);\n}\n\ntemplate<typename Iterator, typename Equal>\nvoid find_diff_rec(Iterator a, int begA, int endA,\n                   Iterator b, int begB, int endB,\n                   int* V1, int* V2, Equal eq, Vector<Diff>& diffs)\n{\n    int prefix_len = 0;\n    while (begA != endA and begB != endB and a[begA] == b[begB])\n         ++begA, ++begB, ++prefix_len;\n\n    int suffix_len = 0;\n    while (begA != endA and begB != endB and a[endA-1] == b[endB-1])\n        --endA, --endB, ++suffix_len;\n\n    append_diff(diffs, {Diff::Keep, prefix_len, 0});\n\n    const auto lenA = endA - begA, lenB = endB - begB;\n\n    if (lenA == 0)\n        append_diff(diffs, {Diff::Add, lenB, begB});\n    else if (lenB == 0)\n        append_diff(diffs, {Diff::Remove, lenA, 0});\n    else\n    {\n        auto snake = find_middle_snake(a + begA, lenA, b + begB, lenB, V1, V2, eq);\n        kak_assert(snake.d > 0 and snake.u <= lenA and snake.v <= lenB);\n        const bool recurse = snake.d > 1;\n\n        if (recurse)\n            find_diff_rec(a, begA, begA + snake.x - (snake.reverse ? 0 : (snake.add ? 0 : 1)),\n                          b, begB, begB + snake.y - (snake.reverse ? 0 : (snake.add ? 1 : 0)),\n                          V1, V2, eq, diffs);\n\n        if (not snake.reverse)\n            append_diff(diffs, snake.add ? Diff{Diff::Add, 1, begB + snake.y - 1}\n                                         : Diff{Diff::Remove, 1, 0});\n\n        append_diff(diffs, {Diff::Keep, snake.u - snake.x, 0});\n\n        if (snake.reverse)\n            append_diff(diffs, snake.add ? Diff{Diff::Add, 1, begB + snake.v}\n                                         : Diff{Diff::Remove, 1, 0});\n\n        if (recurse)\n            find_diff_rec(a, begA + snake.u + (snake.reverse ? (snake.add ? 0 : 1) : 0), endA,\n                          b, begB + snake.v + (snake.reverse ? (snake.add ? 1 : 0) : 0), endB,\n                          V1, V2, eq, diffs);\n    }\n\n    append_diff(diffs, {Diff::Keep, suffix_len, 0});\n}\n\ntemplate<typename Iterator, typename Equal = std::equal_to<typename std::iterator_traits<Iterator>::value_type>>\nVector<Diff> find_diff(Iterator a, int N, Iterator b, int M, Equal eq = Equal{})\n{\n    const int max = 2 * (N + M) + 1;\n    Vector<int> data(2*max);\n    Vector<Diff> diffs;\n    find_diff_rec(a, 0, N, b, 0, M, &data[N+M], &data[max + N+M], eq, diffs);\n\n    return diffs;\n}\n\n}\n\n#endif \/\/ diff_hh_INCLUDED\n<commit_msg>Use the provided equal functor for prefix\/suffix detection in diff<commit_after>#ifndef diff_hh_INCLUDED\n#define diff_hh_INCLUDED\n\n\/\/ Implementation of the linear space variant of the algorithm described in\n\/\/ \"An O(ND) Difference Algorithm and Its Variations\"\n\/\/ (http:\/\/xmailserver.org\/diff2.pdf)\n\n#include \"array_view.hh\"\n#include \"vector.hh\"\n\n#include <functional>\n#include <iterator>\n\nnamespace Kakoune\n{\n\nstruct Snake{ int x, y, u, v; bool add; };\n\ntemplate<typename Iterator, typename Equal>\nSnake find_end_snake_of_further_reaching_dpath(Iterator a, int N, Iterator b, int M,\n                                               const int* V, const int D, const int k, Equal eq)\n{\n    const bool add = k == -D or (k != D and V[k-1] < V[k+1]);\n\n    \/\/ if diagonal on the right goes further along x than diagonal on the left,\n    \/\/ then we take a vertical edge from it to this diagonal, hence x = V[k+1]\n    \/\/ else, we take an horizontal edge from our left diagonal,x = V[k-1]+1\n    const int x = add ? V[k+1] : V[k-1]+1;\n    \/\/ we are by construction on diagonal k, so our position along b (y) is x - k.\n    const int y = x - k;\n\n    int u = x, v = y;\n    \/\/ follow end snake along diagonal k\n    while (u < N and v < M and eq(a[u], b[v]))\n        ++u, ++v;\n\n    return { x, y, u, v, add };\n}\n\nstruct SnakeLen : Snake\n{\n    SnakeLen(Snake s, bool reverse, int d) : Snake(s), reverse(reverse), d(d) {}\n    const bool reverse;\n    const int d;\n};\n\ntemplate<typename Iterator, typename Equal>\nSnakeLen find_middle_snake(Iterator a, int N, Iterator b, int M,\n                           int* V1, int* V2, Equal eq)\n{\n    const int delta = N - M;\n    V1[1] = 0;\n    V2[1] = 0;\n\n    std::reverse_iterator<Iterator> ra{a + N}, rb{b + M};\n\n    for (int D = 0; D <= (M + N + 1) \/ 2; ++D)\n    {\n        for (int k1 = -D; k1 <= D; k1 += 2)\n        {\n            auto p = find_end_snake_of_further_reaching_dpath(a, N, b, M, V1, D, k1, eq);\n            V1[k1] = p.u;\n\n            const int k2 = -(k1 - delta);\n            if ((delta % 2 != 0) and -(D-1) <= k2 and k2 <= (D-1))\n            {\n                if (V1[k1] + V2[k2] >= N)\n                    return { p, false, 2 * D - 1 };\/\/ return last snake on forward path\n            }\n        }\n\n        for (int k2 = -D; k2 <= D; k2 += 2)\n        {\n            auto p = find_end_snake_of_further_reaching_dpath(ra, N, rb, M, V2, D, k2, eq);\n            V2[k2] = p.u;\n\n            const int k1 = -(k2 - delta);\n            if ((delta % 2 == 0) and -D <= k1 and k1 <= D)\n            {\n                if (V1[k1] + V2[k2] >= N)\n                    return { { N - p.u, M - p.v, N - p.x , M - p.y, p.add } , true, 2 * D };\/\/ return last snake on reverse path\n            }\n        }\n    }\n\n    kak_assert(false);\n    return { {}, false, 0 };\n}\n\nstruct Diff\n{\n    enum { Keep, Add, Remove } mode;\n    int len;\n    int posB;\n};\n\ninline void append_diff(Vector<Diff>& diffs, Diff diff)\n{\n    if (diff.len == 0)\n        return;\n\n    if (not diffs.empty() and diffs.back().mode == diff.mode\n        and (diff.mode != Diff::Add or\n             diffs.back().posB + diffs.back().len == diff.posB))\n        diffs.back().len += diff.len;\n    else\n        diffs.push_back(diff);\n}\n\ntemplate<typename Iterator, typename Equal>\nvoid find_diff_rec(Iterator a, int begA, int endA,\n                   Iterator b, int begB, int endB,\n                   int* V1, int* V2, Equal eq, Vector<Diff>& diffs)\n{\n    int prefix_len = 0;\n    while (begA != endA and begB != endB and eq(a[begA], b[begB]))\n         ++begA, ++begB, ++prefix_len;\n\n    int suffix_len = 0;\n    while (begA != endA and begB != endB and eq(a[endA-1], b[endB-1]))\n        --endA, --endB, ++suffix_len;\n\n    append_diff(diffs, {Diff::Keep, prefix_len, 0});\n\n    const auto lenA = endA - begA, lenB = endB - begB;\n\n    if (lenA == 0)\n        append_diff(diffs, {Diff::Add, lenB, begB});\n    else if (lenB == 0)\n        append_diff(diffs, {Diff::Remove, lenA, 0});\n    else\n    {\n        auto snake = find_middle_snake(a + begA, lenA, b + begB, lenB, V1, V2, eq);\n        kak_assert(snake.d > 0 and snake.u <= lenA and snake.v <= lenB);\n        const bool recurse = snake.d > 1;\n\n        if (recurse)\n            find_diff_rec(a, begA, begA + snake.x - (snake.reverse ? 0 : (snake.add ? 0 : 1)),\n                          b, begB, begB + snake.y - (snake.reverse ? 0 : (snake.add ? 1 : 0)),\n                          V1, V2, eq, diffs);\n\n        if (not snake.reverse)\n            append_diff(diffs, snake.add ? Diff{Diff::Add, 1, begB + snake.y - 1}\n                                         : Diff{Diff::Remove, 1, 0});\n\n        append_diff(diffs, {Diff::Keep, snake.u - snake.x, 0});\n\n        if (snake.reverse)\n            append_diff(diffs, snake.add ? Diff{Diff::Add, 1, begB + snake.v}\n                                         : Diff{Diff::Remove, 1, 0});\n\n        if (recurse)\n            find_diff_rec(a, begA + snake.u + (snake.reverse ? (snake.add ? 0 : 1) : 0), endA,\n                          b, begB + snake.v + (snake.reverse ? (snake.add ? 1 : 0) : 0), endB,\n                          V1, V2, eq, diffs);\n    }\n\n    append_diff(diffs, {Diff::Keep, suffix_len, 0});\n}\n\ntemplate<typename Iterator, typename Equal = std::equal_to<typename std::iterator_traits<Iterator>::value_type>>\nVector<Diff> find_diff(Iterator a, int N, Iterator b, int M, Equal eq = Equal{})\n{\n    const int max = 2 * (N + M) + 1;\n    Vector<int> data(2*max);\n    Vector<Diff> diffs;\n    find_diff_rec(a, 0, N, b, 0, M, &data[N+M], &data[max + N+M], eq, diffs);\n\n    return diffs;\n}\n\n}\n\n#endif \/\/ diff_hh_INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2010,\n * François Bleibel,\n * Olivier Stasse,\n *\n * CNRS\/AIST\n *\n * This file is part of sot-core.\n * sot-core 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 3 of\n * the License, or (at your option) any later version.\n * sot-core 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\n * GNU Lesser General Public License for more details.  You should\n * have received a copy of the GNU Lesser General Public License along\n * with sot-core.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n\/* --------------------------------------------------------------------- *\/\n\/* --- INCLUDE --------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\n\/* --- SOT --- *\/\n#include <sot\/core\/periodic-call.hh>\n#include <dynamic-graph\/pool.h>\n#include <sot\/core\/debug.hh>\n#include <sot\/core\/exception-tools.hh>\n#include <algorithm>\n#include <dynamic-graph\/python\/interpreter.hh>\n#include <dynamic-graph\/all-commands.h>\n#include <dynamic-graph\/exception-factory.h>\n\nusing namespace std;\nusing namespace dynamicgraph::sot;\n\n\/* --------------------------------------------------------------------- *\/\n\/* --- CLASS ----------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\n\n\nPeriodicCall::\nPeriodicCall( void )\n  : signalMap()\n    ,cmdList()\n    ,innerTime( 0 )\n  ,py_sh( NULL )\n{\n\n}\n\nvoid PeriodicCall::\nsetPyInterpreter( dynamicgraph::python::Interpreter* ptr )\n{ py_sh = ptr; }\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\nvoid PeriodicCall::\naddSignal( const std::string &name, SignalBase<int>& sig )\n{\n  signalMap[ name ] = &sig;\n  return ;\n}\n\nvoid PeriodicCall::\naddSignal( const std::string& sigpath )\n{\n  istringstream sigISS( sigpath );\n  SignalBase<int>& signal = PoolStorage::getInstance()->getSignal( sigISS );\n  addSignal( sigpath,signal );\n  return ;\n}\n\nvoid PeriodicCall::\nrmSignal( const std::string &name )\n{\n  signalMap.erase( name );\n  return ;\n}\n\n\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\nvoid PeriodicCall::\naddCmd( const std::string& cmdLine )\n{\n  cmdList.push_back( cmdLine );\n  return ;\n}\n\nvoid PeriodicCall::\nrmCmd( const std::string& args )\n{\n  CmdListType::iterator iter = std::find( cmdList.begin(),cmdList.end(),args);\n  if( cmdList.end()!=iter ) { cmdList.erase( iter ); }\n  return ;\n}\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\nvoid PeriodicCall::\nrunSignals( const int& t )\n{\n  for( SignalMapType::iterator iter = signalMap.begin();\n       signalMap.end()!=iter; ++iter )\n    {\n      (*iter).second ->recompute( t );\n    }\n  return ;\n}\n\nvoid PeriodicCall::\nrunCmds( void )\n{\n  if( NULL==py_sh )\n    {\n      ExceptionTools( ExceptionTools::PY_SHELL_PTR,\"Python interpreter not set.\" );\n    }\n\n  for( CmdListType::const_iterator iter = cmdList.begin();\n       cmdList.end()!=iter; ++iter )\n    {\n      py_sh->python( *iter );\n    }\n  return ;\n}\n\nvoid PeriodicCall::\nrun( const int & t )\n{\n  runSignals( t ); runCmds();\n  return ;\n}\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\n\nvoid PeriodicCall::\ndisplay( std::ostream& os ) const\n{\n  os <<\"  (t=\" << innerTime << \")\" <<endl;\n\n  os<<\" -> SIGNALS:\"<<endl;\n  for( SignalMapType::const_iterator iter = signalMap.begin();\n       signalMap.end()!=iter; ++iter )\n    {\n      os << \" - \" << (*iter).first << endl;\n    }\n\n  os<<\" -> CMDS:\"<<endl;\n  for( CmdListType::const_iterator iter = cmdList.begin();\n       cmdList.end()!=iter; ++iter )\n    {\n      os << \" - \" <<  (*iter) << endl;\n    }\n\n}\n\nstatic std::string readLineStr( istringstream& args )\n{\n  stringbuf* pbuf=args.rdbuf();\n  const unsigned int size = pbuf->in_avail();\n  char * buffer = new char[ size+1 ];\n  pbuf->sgetn( buffer,size );\n\n  buffer[size]='\\0';\n  std::string res( buffer );\n  delete [] buffer;\n  return res;\n}\n\nbool PeriodicCall::\ncommandLine( const std::string& cmdLine,\n\t     std::istringstream& cmdArgs,\n\t     std::ostream& os )\n{\n  if( cmdLine == \"help\" )\n    {\n      os << \"PeriodicCall:\"<<endl\n\t <<\"  - addSignal\/rmSignal  <int> \" <<endl\n\t <<\"  - addCmd\/rmCmd  \" <<endl\n\t <<\"  - runSignal\/runCmd \" <<endl\n\t <<\"  - run\" <<endl;\n    }\n  else if( cmdLine == \"addSignal\" )\n    {\n      std::string sigpath; cmdArgs >> std::skipws >> sigpath;\n      addSignal( sigpath );\n    }\n  else if( cmdLine == \"rmSignal\" )\n    {\n      std::string sigpath; cmdArgs >> std::skipws >> sigpath;\n      rmSignal( sigpath );\n    }\n  else if( cmdLine == \"runSignals\" )\n    {      runSignals( innerTime++ );    }\n\n  else if( cmdLine == \"addCmd\" )\n    {      addCmd( readLineStr(cmdArgs) );    }\n  else if( cmdLine == \"rmCmd\" )\n    {      rmCmd( readLineStr(cmdArgs) );    }\n  else if( cmdLine == \"runCmds\" )\n    {      runCmds();    }\n\n  else if( cmdLine == \"run\" )\n    {      run( innerTime++ );    }\n  else if( cmdLine == \"clear\" )\n    {     clear();    }\n  else if( cmdLine == \"print\" )\n    { display(os) ; }\n  else { return false; }\n  return true;\n}\n\n#define ADD_COMMAND( name,def )                                     \\\nif (commandMap.count(prefix+name) != 0) {                            \\\n  DG_THROW ExceptionFactory(ExceptionFactory::OBJECT_CONFLICT,        \\\n\t\t\t    \"Command \" + prefix+name +\t               \\\n\t\t\t    \" already registered in Entity.\");          \\\n }                                                                       \\\ncommandMap.insert( std::make_pair( prefix+name,def ) )\n\n\nvoid PeriodicCall::addSpecificCommands(Entity& ent,\n\t\t\t\t       Entity::CommandMap_t& commandMap,\n\t\t\t\t       const std::string& prefix )\n{\n  using namespace dynamicgraph::command;\n\n  \/* Explicit typage to help the compiler. *\/\n  boost::function< void( const std::string& ) >\n    addSignal  = boost::bind( &PeriodicCall::addSignal, this,_1 ),\n    rmSignal = boost::bind( &PeriodicCall::rmSignal, this,_1 );\n  boost::function< void( void ) >\n    clear  = boost::bind( &PeriodicCall::clear, this );\n  boost::function< void( std::ostream& ) >\n    disp  = boost::bind( &PeriodicCall::display, this,_1 );\n\n   ADD_COMMAND(\"addSignal\",\n   \t      makeCommandVoid1(ent,addSignal,\n   \t\t\t       docCommandVoid1(\"Add the signal to the refresh list\",\n   \t\t\t\t\t       \"string (sig name)\")));\n   ADD_COMMAND(\"rmSignal\",\n\t       makeCommandVoid1(ent,rmSignal,\n\t\t\t\tdocCommandVoid1(\"Remove the signal to the refresh list\",\n\t\t\t\t\t\t\"string (sig name)\")));\n   ADD_COMMAND(\"clear\",\n\t       makeCommandVoid0(ent,clear,\n\t\t\t\tdocCommandVoid0(\"Clear all signals and commands from the refresh list.\")));\n\n   ADD_COMMAND(\"disp\",\n\t       makeCommandVerbose(ent,disp,\n\t\t\t\t  docCommandVerbose(\"Print the list of to-refresh signals and commands.\")));\n\n}\n\n\n\n\n\n\n\/*\n * Local variables:\n * c-basic-offset: 2\n * End:\n *\/\n\n<commit_msg>Corrected the call to the former syntax of the pool.<commit_after>\/*\n * Copyright 2010,\n * François Bleibel,\n * Olivier Stasse,\n *\n * CNRS\/AIST\n *\n * This file is part of sot-core.\n * sot-core 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 3 of\n * the License, or (at your option) any later version.\n * sot-core 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\n * GNU Lesser General Public License for more details.  You should\n * have received a copy of the GNU Lesser General Public License along\n * with sot-core.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n\/* --------------------------------------------------------------------- *\/\n\/* --- INCLUDE --------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\n\/* --- SOT --- *\/\n#include <sot\/core\/periodic-call.hh>\n#include <dynamic-graph\/pool.h>\n#include <sot\/core\/debug.hh>\n#include <sot\/core\/exception-tools.hh>\n#include <algorithm>\n#include <dynamic-graph\/python\/interpreter.hh>\n#include <dynamic-graph\/all-commands.h>\n#include <dynamic-graph\/exception-factory.h>\n\nusing namespace std;\nusing namespace dynamicgraph::sot;\n\n\/* --------------------------------------------------------------------- *\/\n\/* --- CLASS ----------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\n\n\nPeriodicCall::\nPeriodicCall( void )\n  : signalMap()\n    ,cmdList()\n    ,innerTime( 0 )\n  ,py_sh( NULL )\n{\n\n}\n\nvoid PeriodicCall::\nsetPyInterpreter( dynamicgraph::python::Interpreter* ptr )\n{ py_sh = ptr; }\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\nvoid PeriodicCall::\naddSignal( const std::string &name, SignalBase<int>& sig )\n{\n  signalMap[ name ] = &sig;\n  return ;\n}\n\nvoid PeriodicCall::\naddSignal( const std::string& sigpath )\n{\n  istringstream sigISS( sigpath );\n  SignalBase<int>& signal = ::dynamicgraph::PoolStorage::getInstance()->getSignal( sigISS );\n  addSignal( sigpath,signal );\n  return ;\n}\n\nvoid PeriodicCall::\nrmSignal( const std::string &name )\n{\n  signalMap.erase( name );\n  return ;\n}\n\n\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\nvoid PeriodicCall::\naddCmd( const std::string& cmdLine )\n{\n  cmdList.push_back( cmdLine );\n  return ;\n}\n\nvoid PeriodicCall::\nrmCmd( const std::string& args )\n{\n  CmdListType::iterator iter = std::find( cmdList.begin(),cmdList.end(),args);\n  if( cmdList.end()!=iter ) { cmdList.erase( iter ); }\n  return ;\n}\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\nvoid PeriodicCall::\nrunSignals( const int& t )\n{\n  for( SignalMapType::iterator iter = signalMap.begin();\n       signalMap.end()!=iter; ++iter )\n    {\n      (*iter).second ->recompute( t );\n    }\n  return ;\n}\n\nvoid PeriodicCall::\nrunCmds( void )\n{\n  if( NULL==py_sh )\n    {\n      ExceptionTools( ExceptionTools::PY_SHELL_PTR,\"Python interpreter not set.\" );\n    }\n\n  for( CmdListType::const_iterator iter = cmdList.begin();\n       cmdList.end()!=iter; ++iter )\n    {\n      py_sh->python( *iter );\n    }\n  return ;\n}\n\nvoid PeriodicCall::\nrun( const int & t )\n{\n  runSignals( t ); runCmds();\n  return ;\n}\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\n\nvoid PeriodicCall::\ndisplay( std::ostream& os ) const\n{\n  os <<\"  (t=\" << innerTime << \")\" <<endl;\n\n  os<<\" -> SIGNALS:\"<<endl;\n  for( SignalMapType::const_iterator iter = signalMap.begin();\n       signalMap.end()!=iter; ++iter )\n    {\n      os << \" - \" << (*iter).first << endl;\n    }\n\n  os<<\" -> CMDS:\"<<endl;\n  for( CmdListType::const_iterator iter = cmdList.begin();\n       cmdList.end()!=iter; ++iter )\n    {\n      os << \" - \" <<  (*iter) << endl;\n    }\n\n}\n\nstatic std::string readLineStr( istringstream& args )\n{\n  stringbuf* pbuf=args.rdbuf();\n  const unsigned int size = pbuf->in_avail();\n  char * buffer = new char[ size+1 ];\n  pbuf->sgetn( buffer,size );\n\n  buffer[size]='\\0';\n  std::string res( buffer );\n  delete [] buffer;\n  return res;\n}\n\nbool PeriodicCall::\ncommandLine( const std::string& cmdLine,\n\t     std::istringstream& cmdArgs,\n\t     std::ostream& os )\n{\n  if( cmdLine == \"help\" )\n    {\n      os << \"PeriodicCall:\"<<endl\n\t <<\"  - addSignal\/rmSignal  <int> \" <<endl\n\t <<\"  - addCmd\/rmCmd  \" <<endl\n\t <<\"  - runSignal\/runCmd \" <<endl\n\t <<\"  - run\" <<endl;\n    }\n  else if( cmdLine == \"addSignal\" )\n    {\n      std::string sigpath; cmdArgs >> std::skipws >> sigpath;\n      addSignal( sigpath );\n    }\n  else if( cmdLine == \"rmSignal\" )\n    {\n      std::string sigpath; cmdArgs >> std::skipws >> sigpath;\n      rmSignal( sigpath );\n    }\n  else if( cmdLine == \"runSignals\" )\n    {      runSignals( innerTime++ );    }\n\n  else if( cmdLine == \"addCmd\" )\n    {      addCmd( readLineStr(cmdArgs) );    }\n  else if( cmdLine == \"rmCmd\" )\n    {      rmCmd( readLineStr(cmdArgs) );    }\n  else if( cmdLine == \"runCmds\" )\n    {      runCmds();    }\n\n  else if( cmdLine == \"run\" )\n    {      run( innerTime++ );    }\n  else if( cmdLine == \"clear\" )\n    {     clear();    }\n  else if( cmdLine == \"print\" )\n    { display(os) ; }\n  else { return false; }\n  return true;\n}\n\n#define ADD_COMMAND( name,def )                                     \\\nif (commandMap.count(prefix+name) != 0) {                            \\\n  DG_THROW ExceptionFactory(ExceptionFactory::OBJECT_CONFLICT,        \\\n\t\t\t    \"Command \" + prefix+name +\t               \\\n\t\t\t    \" already registered in Entity.\");          \\\n }                                                                       \\\ncommandMap.insert( std::make_pair( prefix+name,def ) )\n\n\nvoid PeriodicCall::addSpecificCommands(Entity& ent,\n\t\t\t\t       Entity::CommandMap_t& commandMap,\n\t\t\t\t       const std::string& prefix )\n{\n  using namespace dynamicgraph::command;\n\n  \/* Explicit typage to help the compiler. *\/\n  boost::function< void( const std::string& ) >\n    addSignal  = boost::bind( &PeriodicCall::addSignal, this,_1 ),\n    rmSignal = boost::bind( &PeriodicCall::rmSignal, this,_1 );\n  boost::function< void( void ) >\n    clear  = boost::bind( &PeriodicCall::clear, this );\n  boost::function< void( std::ostream& ) >\n    disp  = boost::bind( &PeriodicCall::display, this,_1 );\n\n   ADD_COMMAND(\"addSignal\",\n   \t      makeCommandVoid1(ent,addSignal,\n   \t\t\t       docCommandVoid1(\"Add the signal to the refresh list\",\n   \t\t\t\t\t       \"string (sig name)\")));\n   ADD_COMMAND(\"rmSignal\",\n\t       makeCommandVoid1(ent,rmSignal,\n\t\t\t\tdocCommandVoid1(\"Remove the signal to the refresh list\",\n\t\t\t\t\t\t\"string (sig name)\")));\n   ADD_COMMAND(\"clear\",\n\t       makeCommandVoid0(ent,clear,\n\t\t\t\tdocCommandVoid0(\"Clear all signals and commands from the refresh list.\")));\n\n   ADD_COMMAND(\"disp\",\n\t       makeCommandVerbose(ent,disp,\n\t\t\t\t  docCommandVerbose(\"Print the list of to-refresh signals and commands.\")));\n\n}\n\n\n\n\n\n\n\/*\n * Local variables:\n * c-basic-offset: 2\n * End:\n *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  Adplug - Replayer for many OPL2\/OPL3 audio file formats.\n  Copyright (C) 1999 - 2006 Simon Peter, <dn.tlp@gmx.net>, et al.\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  dtm.cpp - DTM loader by Riven the Mage <riven@ok.ru>\n*\/\n\/*\n  NOTE: Panning (Ex) effect is ignored.\n*\/\n\n#include <algorithm>\n#include <cstring>\n#include \"dtm.h\"\n\n\/* -------- Public Methods -------------------------------- *\/\n\nCPlayer *CdtmLoader::factory(Copl *newopl)\n{\n  return new CdtmLoader(newopl);\n}\n\nbool CdtmLoader::load(const std::string &filename, const CFileProvider &fp)\n{\n  static const unsigned char conv_inst[11] = {\n    2, 1, 10, 9, 4, 3, 6, 5, 0, 8, 7\n  };\n  static const unsigned short conv_note[12] = {\n    0x16B, 0x181, 0x198, 0x1B0, 0x1CA, 0x1E5,\n    0x202, 0x220, 0x241, 0x263, 0x287, 0x2AE\n  };\n\n  binistream *f = fp.open(filename);\n  if (!f) return false;\n\n  \/\/ read header\n  f->readString(header.id, sizeof(header.id));\n  header.version = f->readInt(1);\n  f->readString(header.title, sizeof(header.title));\n  f->readString(header.author, sizeof(header.author));\n  \/\/ Ensure title and author are NUL terminated. We may overwrite the\n  \/\/ last character because the arrays are too short.\n  header.author[sizeof(header.author) - 1] =\n    header.title[sizeof(header.title) - 1] = 0;\n  header.numpat = f->readInt(1);\n  header.numinst = f->readInt(1) + 1;\n\n  \/\/ check header\n  if (memcmp(header.id, \"DeFy DTM \", 9) || \/\/ signature exists?\n      header.version != 0x10 || \/\/ good version?\n      header.numinst > MAX_INST ||\n      header.numinst < N_CHAN || \/\/ need a default instrument for each channel\n      f->error()) {\n    fp.close (f);\n    return false;\n  }\n\n  \/\/ load description\n  memset(desc, 0, sizeof(desc));\n\n  char *bufstr = desc;\n\n  for (int i = 0; i < DESC_ROWS; i++) {\n      \/\/ get line length\n      unsigned char bufstr_length = f->readInt(1);\n\n      if (bufstr_length > DESC_COLS) {\n        \/\/ \"desc\" is too small to hold DESC_ROWS lines with DESC_COLS chars\n        \/\/ each plus DESC_ROWS newlines and a NUL terminator. Accept a line\n        \/\/ length of DESC_COLS anyway and truncate the last line if necessary.\n        \/\/ Maybe we should grow desc or allocate it dynamically instead.\n\tfp.close(f);\n\treturn false;\n      }\n\n      int max_length = desc + sizeof(desc) - 1 - bufstr;\n      int discard = bufstr_length > max_length ? bufstr_length - max_length : 0;\n      bufstr_length -= discard;\n\n      \/\/ read line\n      if (bufstr_length) {\n\t  f->readString(bufstr,bufstr_length);\n\n\t  for (int j = 0; j < bufstr_length; j++)\n\t    if (!bufstr[j])\n\t      bufstr[j] = 0x20;\n          bufstr += bufstr_length;\n\n\t  if (discard)\n            f->ignore(discard);\n      }\n      if (bufstr_length < max_length)\n        *(bufstr++) = '\\n';\n  }\n  *bufstr = 0;\n\n  \/\/ init CmodPlayer\n  realloc_instruments(header.numinst);\n  realloc_order(N_ORD);\n  realloc_patterns(header.numpat, N_ROW, N_CHAN);\n  init_notetable(conv_note);\n  init_trackord();\n\n  \/\/ load instruments\n  for (int i = 0; i < header.numinst; i++) {\n      unsigned char name_length = f->readInt(1);\n\n      if (name_length)\n\tf->readString(instruments[i].name, name_length);\n\n      instruments[i].name[name_length] = 0;\n\n      f->readString((char *)instruments[i].data, sizeof(instruments[i].data));\n\n      for (int j = 0; j < sizeof(conv_inst); j++)\n\tinst[i].data[conv_inst[j]] = instruments[i].data[j];\n  }\n\n  \/\/ load order\n  f->readString((char *)order, N_ORD);\n\n  \/\/ load tracks\n  dtm_event pattern[N_ROW][N_CHAN];\n  nop = header.numpat;\n  for (int t = 0, i = 0; i < nop; i++) {\n      unsigned short packed_length = f->readInt(2);\n      unsigned char *packed_pattern = new unsigned char [packed_length];\n\n      f->readString((char *)packed_pattern, packed_length);\n\n      long unpacked_length = unpack_pattern(packed_pattern, packed_length,\n\t\t\t            (unsigned char *)pattern, sizeof(pattern));\n      delete [] packed_pattern;\n\n      if (unpacked_length != sizeof(pattern)) {\n\t  fp.close(f);\n\t  return false;\n      }\n\n      \/\/ convert pattern\n      for (int j = 0; j < N_CHAN; j++, t++) {\n\t  for (int k = 0; k < N_ROW; k++) {\n\t      dtm_event *event = &pattern[k][j];\n\n\t      \/\/ instrument\n\t      if (event->byte0 == 0x80) {\n\t\t  if (event->byte1 <= 0x80)\n\t\t    tracks[t][k].inst = event->byte1 + 1;\n\t      }\n\n\t      \/\/ note + effect\n\t      else {\n\t\t  tracks[t][k].note = event->byte0;\n\n\t\t  if ((event->byte0 != 0) && (event->byte0 != 127))\n\t\t    tracks[t][k].note++;\n\n\t\t  \/\/ convert effects\n\t\t  unsigned char ev_param = event->byte1 & 0x0F;\n\t\t  switch (event->byte1 >> 4) {\n\t\t    case 0x0: \/\/ pattern break\n\t\t      if (ev_param == 1)\n\t\t\ttracks[t][k].command = 13;\n\t\t      break;\n\n\t\t    case 0x1: \/\/ freq. slide up\n\t\t      tracks[t][k].command = 28;\n\t\t      tracks[t][k].param1 = ev_param;\n\t\t      break;\n\n\t\t    case 0x2: \/\/ freq. slide down\n\t\t      tracks[t][k].command = 28;\n\t\t      tracks[t][k].param2 = ev_param;\n\t\t      break;\n\n\t\t    case 0xA: \/\/ set carrier volume\n\t\t    case 0xC: \/\/ set instrument volume\n\t\t      tracks[t][k].command = 22;\n\t\t      tracks[t][k].param1 = (0x3F - ev_param) >> 4; \/\/ always 3\n\t\t      tracks[t][k].param2 = (0x3F - ev_param) & 0xF;\n\t\t      break;\n\n\t\t    case 0xB: \/\/ set modulator volume\n\t\t      tracks[t][k].command = 21;\n\t\t      tracks[t][k].param1 = (0x3F - ev_param) >> 4; \/\/ always 3\n\t\t      tracks[t][k].param2 = (0x3F - ev_param) & 0xF;\n\t\t      break;\n\n\t\t    case 0xE: \/\/ set panning\n\t\t      break;\n\n\t\t    case 0xF: \/\/ set speed\n\t\t      tracks[t][k].command = 13;\n\t\t      tracks[t][k].param2 = ev_param;\n\t\t      break;\n\t\t  }\n\t      }\n\t  }\n      }\n  }\n\n  if (f->error()) {\n      fp.close(f);\n      return false;\n  }\n  fp.close(f);\n\n  \/\/ order length\n  for (int i = 0; i < N_ORD; i++) {\n      if (order[i] & 0x80) {\n\t  length = i;\n\n\t  if (order[i] == 0xFF)\n\t    restartpos = 0;\n\t  else\n\t    restartpos = order[i] - 0x80;\n\n\t  break;\n      }\n  }\n\n  \/\/ initial speed\n  initspeed = 2;\n\n  rewind(0);\n\n  return true;\n}\n\nvoid CdtmLoader::rewind(int subsong)\n{\n  CmodPlayer::rewind(subsong);\n\n  \/\/ default instruments\n  for (int i = 0; i < N_CHAN; i++) {\n      channel[i].inst = i;\n\n      channel[i].vol1 = 63 - (inst[i].data[10] & 63);\n      channel[i].vol2 = 63 - (inst[i].data[9] & 63);\n  }\n}\n\nfloat CdtmLoader::getrefresh()\n{\n  return 18.2f;\n}\n\nstd::string CdtmLoader::gettype()\n{\n  return std::string(\"DeFy Adlib Tracker\");\n}\n\nstd::string CdtmLoader::gettitle()\n{\n  return std::string(header.title);\n}\n\nstd::string CdtmLoader::getauthor()\n{\n  return std::string(header.author);\n}\n\nstd::string CdtmLoader::getdesc()\n{\n  return std::string(desc);\n}\n\nstd::string CdtmLoader::getinstrument(unsigned int n)\n{\n  return n < header.numinst ? std::string(instruments[n].name) : std::string();\n}\n\nunsigned int CdtmLoader::getinstruments()\n{\n  return header.numinst;\n}\n\n\/* -------- Private Methods ------------------------------- *\/\n\nlong CdtmLoader::unpack_pattern(unsigned char *ibuf, long ilen,\n\t\t\t\tunsigned char *obuf, long olen)\n{\n  long input_length = 0;\n  long output_length = 0;\n\n  \/\/ RLE\n  while (input_length < ilen) {\n    long repeat_counter = 1;\n    unsigned char repeat_byte = ibuf[input_length++];\n\n    if ((repeat_byte & 0xF0) == 0xD0) {\n      if (input_length == ilen) break; \/\/ truncated input\n\n      repeat_counter = repeat_byte & 15;\n      repeat_byte = ibuf[input_length++];\n    }\n\n    repeat_counter = std::min(repeat_counter, olen - output_length);\n    memset(obuf + output_length, repeat_byte, repeat_counter);\n    output_length += repeat_counter;\n  }\n\n  return output_length;\n}\n<commit_msg>dtm.cpp: Add more checks during load()<commit_after>\/*\n  Adplug - Replayer for many OPL2\/OPL3 audio file formats.\n  Copyright (C) 1999 - 2006 Simon Peter, <dn.tlp@gmx.net>, et al.\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  dtm.cpp - DTM loader by Riven the Mage <riven@ok.ru>\n*\/\n\/*\n  NOTE: Panning (Ex) effect is ignored.\n*\/\n\n#include <algorithm>\n#include <cstring>\n#include \"dtm.h\"\n\n\/* -------- Public Methods -------------------------------- *\/\n\nCPlayer *CdtmLoader::factory(Copl *newopl)\n{\n  return new CdtmLoader(newopl);\n}\n\nbool CdtmLoader::load(const std::string &filename, const CFileProvider &fp)\n{\n  static const unsigned char conv_inst[11] = {\n    2, 1, 10, 9, 4, 3, 6, 5, 0, 8, 7\n  };\n  static const unsigned short conv_note[12] = {\n    0x16B, 0x181, 0x198, 0x1B0, 0x1CA, 0x1E5,\n    0x202, 0x220, 0x241, 0x263, 0x287, 0x2AE\n  };\n\n  binistream *f = fp.open(filename);\n  if (!f) return false;\n\n  \/\/ read header\n  f->readString(header.id, sizeof(header.id));\n  header.version = f->readInt(1);\n  f->readString(header.title, sizeof(header.title));\n  f->readString(header.author, sizeof(header.author));\n  \/\/ Ensure title and author are NUL terminated. We may overwrite the\n  \/\/ last character because the arrays are too short.\n  header.author[sizeof(header.author) - 1] =\n    header.title[sizeof(header.title) - 1] = 0;\n  header.numpat = f->readInt(1);\n  header.numinst = f->readInt(1) + 1;\n\n  \/\/ check header\n  if (memcmp(header.id, \"DeFy DTM \", 9) || \/\/ signature exists?\n      header.version != 0x10 || \/\/ good version?\n      header.numinst > MAX_INST ||\n      header.numinst < N_CHAN || \/\/ need a default instrument for each channel\n      header.numpat == 0 ||\n      f->error()) {\n    fp.close (f);\n    return false;\n  }\n\n  \/\/ load description\n  memset(desc, 0, sizeof(desc));\n\n  char *bufstr = desc;\n\n  for (int i = 0; i < DESC_ROWS; i++) {\n      \/\/ get line length\n      unsigned char bufstr_length = f->readInt(1);\n\n      if (bufstr_length > DESC_COLS) {\n        \/\/ \"desc\" is too small to hold DESC_ROWS lines with DESC_COLS chars\n        \/\/ each plus DESC_ROWS newlines and a NUL terminator. Accept a line\n        \/\/ length of DESC_COLS anyway and truncate the last line if necessary.\n        \/\/ Maybe we should grow desc or allocate it dynamically instead.\n\tfp.close(f);\n\treturn false;\n      }\n\n      int max_length = desc + sizeof(desc) - 1 - bufstr;\n      int discard = bufstr_length > max_length ? bufstr_length - max_length : 0;\n      bufstr_length -= discard;\n\n      \/\/ read line\n      if (bufstr_length) {\n\t  f->readString(bufstr,bufstr_length);\n\n\t  for (int j = 0; j < bufstr_length; j++)\n\t    if (!bufstr[j])\n\t      bufstr[j] = 0x20;\n          bufstr += bufstr_length;\n\n\t  if (discard)\n            f->ignore(discard);\n      }\n      if (bufstr_length < max_length)\n        *(bufstr++) = '\\n';\n  }\n  *bufstr = 0;\n\n  \/\/ init CmodPlayer\n  realloc_instruments(header.numinst);\n  realloc_order(N_ORD);\n  realloc_patterns(header.numpat, N_ROW, N_CHAN);\n  init_notetable(conv_note);\n  init_trackord();\n\n  \/\/ load instruments\n  for (int i = 0; i < header.numinst; i++) {\n      unsigned char name_length = f->readInt(1);\n\n      if (name_length >= sizeof(instruments[i].name)) {\n\tfp.close(f);\n\treturn false; \/\/ or truncate the name instead?\n      }\n\n      if (name_length)\n\tf->readString(instruments[i].name, name_length);\n\n      instruments[i].name[name_length] = 0;\n\n      f->readString((char *)instruments[i].data, sizeof(instruments[i].data));\n\n      for (int j = 0; j < sizeof(conv_inst); j++)\n\tinst[i].data[conv_inst[j]] = instruments[i].data[j];\n  }\n\n  \/\/ load order\n  f->readString((char *)order, N_ORD);\n\n  \/\/ load tracks\n  dtm_event pattern[N_ROW][N_CHAN];\n  nop = header.numpat;\n  for (int t = 0, i = 0; i < nop; i++) {\n      unsigned short packed_length = f->readInt(2);\n      unsigned char *packed_pattern = new unsigned char [packed_length];\n\n      f->readString((char *)packed_pattern, packed_length);\n\n      long unpacked_length = unpack_pattern(packed_pattern, packed_length,\n\t\t\t            (unsigned char *)pattern, sizeof(pattern));\n      delete [] packed_pattern;\n\n      if (unpacked_length != sizeof(pattern)) {\n\t  fp.close(f);\n\t  return false;\n      }\n\n      \/\/ convert pattern\n      for (int j = 0; j < N_CHAN; j++, t++) {\n\t  for (int k = 0; k < N_ROW; k++) {\n\t      dtm_event *event = &pattern[k][j];\n\n\t      \/\/ instrument\n\t      if (event->byte0 == 0x80) {\n\t\tif (event->byte1 < header.numinst) \/\/ not <= 0x80 !\n\t\t    tracks[t][k].inst = event->byte1 + 1;\n\t      }\n\n\t      \/\/ note + effect\n\t      else {\n\t\t  tracks[t][k].note = event->byte0;\n\n\t\t  if ((event->byte0 != 0) && (event->byte0 != 127))\n\t\t    tracks[t][k].note++;\n\n\t\t  \/\/ convert effects\n\t\t  unsigned char ev_param = event->byte1 & 0x0F;\n\t\t  switch (event->byte1 >> 4) {\n\t\t    case 0x0: \/\/ pattern break\n\t\t      if (ev_param == 1)\n\t\t\ttracks[t][k].command = 13;\n\t\t      break;\n\n\t\t    case 0x1: \/\/ freq. slide up\n\t\t      tracks[t][k].command = 28;\n\t\t      tracks[t][k].param1 = ev_param;\n\t\t      break;\n\n\t\t    case 0x2: \/\/ freq. slide down\n\t\t      tracks[t][k].command = 28;\n\t\t      tracks[t][k].param2 = ev_param;\n\t\t      break;\n\n\t\t    case 0xA: \/\/ set carrier volume\n\t\t    case 0xC: \/\/ set instrument volume\n\t\t      tracks[t][k].command = 22;\n\t\t      tracks[t][k].param1 = (0x3F - ev_param) >> 4; \/\/ always 3\n\t\t      tracks[t][k].param2 = (0x3F - ev_param) & 0xF;\n\t\t      break;\n\n\t\t    case 0xB: \/\/ set modulator volume\n\t\t      tracks[t][k].command = 21;\n\t\t      tracks[t][k].param1 = (0x3F - ev_param) >> 4; \/\/ always 3\n\t\t      tracks[t][k].param2 = (0x3F - ev_param) & 0xF;\n\t\t      break;\n\n\t\t    case 0xE: \/\/ set panning\n\t\t      break;\n\n\t\t    case 0xF: \/\/ set speed\n\t\t      tracks[t][k].command = 13;\n\t\t      tracks[t][k].param2 = ev_param;\n\t\t      break;\n\t\t  }\n\t      }\n\t  }\n      }\n  }\n\n  if (f->error()) {\n      fp.close(f);\n      return false;\n  }\n  fp.close(f);\n\n  \/\/ order length\n  length = N_ORD;\n  for (int i = 0; i < N_ORD; i++) {\n      if (order[i] & 0x80) {\n\t  length = i;\n\n\t  if (order[i] == 0xFF)\n\t    restartpos = 0;\n\t  else\n\t    restartpos = order[i] - 0x80;\n\n\t  if (restartpos >= i) \/\/ bad restart position or empty order list\n\t    return false;\n\n\t  break;\n      } else if (order[i] >= nop) {\n\treturn false;\n      }\n  }\n\n  \/\/ initial speed\n  initspeed = 2;\n\n  rewind(0);\n\n  return true;\n}\n\nvoid CdtmLoader::rewind(int subsong)\n{\n  CmodPlayer::rewind(subsong);\n\n  \/\/ default instruments\n  for (int i = 0; i < N_CHAN; i++) {\n      channel[i].inst = i;\n\n      channel[i].vol1 = 63 - (inst[i].data[10] & 63);\n      channel[i].vol2 = 63 - (inst[i].data[9] & 63);\n  }\n}\n\nfloat CdtmLoader::getrefresh()\n{\n  return 18.2f;\n}\n\nstd::string CdtmLoader::gettype()\n{\n  return std::string(\"DeFy Adlib Tracker\");\n}\n\nstd::string CdtmLoader::gettitle()\n{\n  return std::string(header.title);\n}\n\nstd::string CdtmLoader::getauthor()\n{\n  return std::string(header.author);\n}\n\nstd::string CdtmLoader::getdesc()\n{\n  return std::string(desc);\n}\n\nstd::string CdtmLoader::getinstrument(unsigned int n)\n{\n  return n < header.numinst ? std::string(instruments[n].name) : std::string();\n}\n\nunsigned int CdtmLoader::getinstruments()\n{\n  return header.numinst;\n}\n\n\/* -------- Private Methods ------------------------------- *\/\n\nlong CdtmLoader::unpack_pattern(unsigned char *ibuf, long ilen,\n\t\t\t\tunsigned char *obuf, long olen)\n{\n  long input_length = 0;\n  long output_length = 0;\n\n  \/\/ RLE\n  while (input_length < ilen) {\n    long repeat_counter = 1;\n    unsigned char repeat_byte = ibuf[input_length++];\n\n    if ((repeat_byte & 0xF0) == 0xD0) {\n      if (input_length == ilen) break; \/\/ truncated input\n\n      repeat_counter = repeat_byte & 15;\n      repeat_byte = ibuf[input_length++];\n    }\n\n    repeat_counter = std::min(repeat_counter, olen - output_length);\n    memset(obuf + output_length, repeat_byte, repeat_counter);\n    output_length += repeat_counter;\n  }\n\n  return output_length;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n    @brief Implementation\n\n    @date 2016\n\n    @author\n    Sensics, Inc.\n    <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 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 \"TrackedBody.h\"\n#include \"ApplyIMUToState.h\"\n#include \"TrackedBodyIMU.h\"\n#include \"TrackedBodyTarget.h\"\n#include \"TrackingSystem.h\"\n#include \"BodyTargetInterface.h\"\n#include \"StateHistory.h\"\n#include \"HistoryContainer.h\"\n#include \"CannedIMUMeasurement.h\"\n\n\/\/ Library\/third-party includes\n#include <osvr\/Kalman\/FlexibleKalmanFilter.h>\n#include <boost\/optional.hpp>\n\n#include <util\/Stride.h>\n\n\/\/ Standard includes\n#include <iostream>\n\nnamespace osvr {\nnamespace vbtracker {\n    using BodyStateHistoryEntry = StateHistoryEntry<BodyState>;\n\n    struct TrackedBody::Impl {\n\n        HistoryContainer<BodyStateHistoryEntry> stateHistory;\n        HistoryContainer<CannedIMUMeasurement> imuMeasurements;\n    };\n    TrackedBody::TrackedBody(TrackingSystem &system, BodyId id)\n        : m_system(system), m_id(id), m_impl(new Impl) {\n        using StateVec = kalman::types::DimVector<BodyState>;\n        \/\/\/ Set error covariance matrix diagonal to large values for safety.\n        m_state.setErrorCovariance(StateVec::Constant(10).asDiagonal());\n\n        m_processModel.setDamping(getParams().linearVelocityDecayCoefficient,\n                                  getParams().angularVelocityDecayCoefficient);\n        m_processModel.setNoiseAutocorrelation(\n            kalman::types::Vector<6>(getParams().processNoiseAutocorrelation));\n    }\n\n    TrackedBody::~TrackedBody() {}\n\n    TrackedBodyIMU *\n    TrackedBody::createIntegratedIMU(double orientationVariance,\n                                     double angularVelocityVariance) {\n        if (m_imu) {\n            \/\/ already have an IMU!\n            return nullptr;\n        }\n        m_imu.reset(new TrackedBodyIMU{*this, orientationVariance,\n                                       angularVelocityVariance});\n        return m_imu.get();\n    }\n\n    TrackedBodyTarget *\n    TrackedBody::createTarget(Eigen::Vector3d const &targetToBody,\n                              TargetSetupData const &setupData) {\n        if (m_target) {\n            \/\/ already have a target!\n            \/\/\/ @todo handle multiple targets!\n            return nullptr;\n        }\n        \/\/\/ The target will always be target 0...\n        m_target.reset(\n            new TrackedBodyTarget{*this, BodyTargetInterface{getState()},\n                                  targetToBody, setupData, TargetId{0}});\n        return m_target.get();\n    }\n\n    ConfigParams const &TrackedBody::getParams() const {\n        return m_system.getParams();\n    }\n\n    BodyId TrackedBody::getId() const { return m_id; }\n    osvr::util::time::TimeValue TrackedBody::getStateTime() const {\n        return m_stateTime;\n    }\n\n    bool TrackedBody::getStateAtOrBefore(\n        osvr::util::time::TimeValue const &desiredTime,\n        osvr::util::time::TimeValue &outTime, BodyState &outState) {\n        auto it = m_impl->stateHistory.closest_not_newer(desiredTime);\n        if (m_impl->stateHistory.end() == it) {\n            \/\/\/ couldn't find such a state.\n            return false;\n        }\n        outTime = it->first;\n        it->second.restore(outState);\n        return true;\n    }\n\n    inline boost::optional<osvr::util::time::TimeValue>\n    getOldestPossibleMeasurementSource(TrackedBody const &body) {\n        boost::optional<osvr::util::time::TimeValue> oldest;\n        \/\/\/ Little lambda to set `oldest` if we haven't recorded a timestamp or\n        \/\/\/ if the given timestamp is older.\n        auto updateOldest = [&oldest](util::time::TimeValue const &timestamp) {\n            if (!oldest || timestamp < *oldest) {\n                oldest = timestamp;\n            }\n        };\n\n        body.forEachTarget([&updateOldest](TrackedBodyTarget const &target) {\n            \/\/\/ If we haven't recorded a timestamp or the current target has\n            \/\/\/ an older timestamp\n            updateOldest(target.getLastUpdate());\n        });\n\n        if (body.hasIMU()) {\n            \/\/\/ If we haven't recorded a timestamp or the IMU has an older\n            \/\/\/ timestamp\n            updateOldest(body.getIMU().getLastUpdate());\n        }\n        return oldest;\n    }\n\n    void TrackedBody::pruneHistory() {\n        if (m_impl->stateHistory.empty()) {\n            \/\/ can't prune an empty structure\n            return;\n        }\n        auto oldestOptional = getOldestPossibleMeasurementSource(*this);\n        if (!oldestOptional) {\n            \/\/ No timestamp yet - don't prune anything out yet.\n            return;\n        }\n        auto oldest = *oldestOptional;\n        if (m_impl->stateHistory.newest_timestamp() < oldest) {\n            \/\/ It would be a strange set of circumstances to bring this about,\n            \/\/ but we don't want to go from a non-empty history to an empty one.\n            \/\/ So in this case, we want to make sure we have at least one entry\n            \/\/ left over in the state history. Here's a quick way of doing that.\n            oldest = m_impl->stateHistory.newest_timestamp();\n        }\n\n        m_impl->stateHistory.pop_before(oldest);\n\n        m_impl->imuMeasurements.pop_before(oldest);\n    }\n\n    void TrackedBody::replaceStateSnapshot(\n        osvr::util::time::TimeValue const &origTime,\n        osvr::util::time::TimeValue const &newTime, BodyState const &newState) {\n#if !(defined(OSVR_UVBI_ASSUME_SINGLE_CAMERA) &&                               \\\n      defined(OSVR_UVBI_ASSUME_CAMERA_ALWAYS_SLOWER))\n#error \"Current code assumes that all we have to replay is IMU measurements.\"\n#endif \/\/ !(defined(OSVR_UVBI_ASSUME_SINGLE_CAMERA) &&\n        \/\/ defined(OSVR_UVBI_ASSUME_CAMERA_ALWAYS_SLOWER))\n\n        \/\/\/ Clear off the state we're about to invalidate.\n        auto numPopped = m_impl->stateHistory.pop_after(origTime);\n        \/\/\/ @todo number popped should be the same (or very nearly) as the\n        \/\/\/ number of IMU measurements we replay.\n\n        \/\/\/ Put on the new state estimate we just computed.\n        m_state = newState;\n        m_stateTime = newTime;\n        if (m_impl->stateHistory.is_valid_to_push_newest(m_stateTime)) {\n            pushState();\n        }\n\n        \/\/\/ Replay the IMU measurements timestamped later than our estimate\n        auto numReplayed = std::size_t{0};\n        for (auto &imuHist :\n             m_impl->imuMeasurements.get_range_newer_than(newTime)) {\n            applyIMUMeasurement(imuHist.first, imuHist.second);\n            ++numReplayed;\n        }\n#if 0\n        static ::util::Stride s{43};\n        if (++s) {\n#endif\n        if (numPopped != numReplayed) {\n            std::cout << \"Popped \" << numPopped << \", replayed \" << numReplayed\n                      << \"\\n\";\n        }\n    }\n\n    void TrackedBody::pushState() {\n        m_impl->stateHistory.push_newest(m_stateTime,\n                                         BodyStateHistoryEntry{m_state});\n    }\n\n    void TrackedBody::incorporateNewMeasurementFromIMU(\n        util::time::TimeValue const &tv, CannedIMUMeasurement const &meas) {\n        if (!getSystem().isRoomCalibrationComplete()) {\n            \/\/\/ If room calibration is incomplete, don't handle this locally. If\n            \/\/\/ it's an orientation, hand it to the tracking system to hand off\n            \/\/\/ to the room calibrator.\n            if (meas.orientationValid()) {\n                Eigen::Quaterniond quat;\n                meas.restoreQuat(quat);\n                getSystem().calibrationHandleIMUData(getId(), tv, quat);\n            }\n            return;\n        }\n\n        if (!m_impl->imuMeasurements.is_valid_to_push_newest(tv)) {\n            \/\/ This one is out of order from the IMU!\n            \/\/\/ @todo handle this better\n            throw std::runtime_error(\"Got out of order timestamps from IMU!\");\n        }\n\n        applyIMUMeasurement(tv, meas);\n\n        m_impl->imuMeasurements.push_newest(tv, meas);\n    }\n\n    void TrackedBody::applyIMUMeasurement(util::time::TimeValue const &tv,\n                                          CannedIMUMeasurement const &meas) {\n        \/\/ Only apply and push new stuff\n        if (m_impl->stateHistory.is_valid_to_push_newest(tv)) {\n            applyIMUToState(getSystem(), m_stateTime, m_state, m_processModel,\n                            tv, meas);\n            m_stateTime = tv;\n            pushState();\n        }\n    }\n\n    bool TrackedBody::hasPoseEstimate() const {\n        \/\/\/ @todo handle IMU here.\n        auto ret = false;\n        forEachTarget([&ret](TrackedBodyTarget &target) {\n            ret = ret || target.hasPoseEstimate();\n        });\n        return ret;\n    }\n\n} \/\/ namespace vbtracker\n} \/\/ namespace osvr\n<commit_msg>Adjust debugging message in tracked body<commit_after>\/** @file\n    @brief Implementation\n\n    @date 2016\n\n    @author\n    Sensics, Inc.\n    <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 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 \"TrackedBody.h\"\n#include \"ApplyIMUToState.h\"\n#include \"TrackedBodyIMU.h\"\n#include \"TrackedBodyTarget.h\"\n#include \"TrackingSystem.h\"\n#include \"BodyTargetInterface.h\"\n#include \"StateHistory.h\"\n#include \"HistoryContainer.h\"\n#include \"CannedIMUMeasurement.h\"\n\n\/\/ Library\/third-party includes\n#include <osvr\/Kalman\/FlexibleKalmanFilter.h>\n#include <boost\/optional.hpp>\n\n#include <util\/Stride.h>\n\n\/\/ Standard includes\n#include <iostream>\n\nnamespace osvr {\nnamespace vbtracker {\n    using BodyStateHistoryEntry = StateHistoryEntry<BodyState>;\n\n    struct TrackedBody::Impl {\n\n        HistoryContainer<BodyStateHistoryEntry> stateHistory;\n        HistoryContainer<CannedIMUMeasurement> imuMeasurements;\n    };\n    TrackedBody::TrackedBody(TrackingSystem &system, BodyId id)\n        : m_system(system), m_id(id), m_impl(new Impl) {\n        using StateVec = kalman::types::DimVector<BodyState>;\n        \/\/\/ Set error covariance matrix diagonal to large values for safety.\n        m_state.setErrorCovariance(StateVec::Constant(10).asDiagonal());\n\n        m_processModel.setDamping(getParams().linearVelocityDecayCoefficient,\n                                  getParams().angularVelocityDecayCoefficient);\n        m_processModel.setNoiseAutocorrelation(\n            kalman::types::Vector<6>(getParams().processNoiseAutocorrelation));\n    }\n\n    TrackedBody::~TrackedBody() {}\n\n    TrackedBodyIMU *\n    TrackedBody::createIntegratedIMU(double orientationVariance,\n                                     double angularVelocityVariance) {\n        if (m_imu) {\n            \/\/ already have an IMU!\n            return nullptr;\n        }\n        m_imu.reset(new TrackedBodyIMU{*this, orientationVariance,\n                                       angularVelocityVariance});\n        return m_imu.get();\n    }\n\n    TrackedBodyTarget *\n    TrackedBody::createTarget(Eigen::Vector3d const &targetToBody,\n                              TargetSetupData const &setupData) {\n        if (m_target) {\n            \/\/ already have a target!\n            \/\/\/ @todo handle multiple targets!\n            return nullptr;\n        }\n        \/\/\/ The target will always be target 0...\n        m_target.reset(\n            new TrackedBodyTarget{*this, BodyTargetInterface{getState()},\n                                  targetToBody, setupData, TargetId{0}});\n        return m_target.get();\n    }\n\n    ConfigParams const &TrackedBody::getParams() const {\n        return m_system.getParams();\n    }\n\n    BodyId TrackedBody::getId() const { return m_id; }\n    osvr::util::time::TimeValue TrackedBody::getStateTime() const {\n        return m_stateTime;\n    }\n\n    bool TrackedBody::getStateAtOrBefore(\n        osvr::util::time::TimeValue const &desiredTime,\n        osvr::util::time::TimeValue &outTime, BodyState &outState) {\n        auto it = m_impl->stateHistory.closest_not_newer(desiredTime);\n        if (m_impl->stateHistory.end() == it) {\n            \/\/\/ couldn't find such a state.\n            return false;\n        }\n        outTime = it->first;\n        it->second.restore(outState);\n        return true;\n    }\n\n    inline boost::optional<osvr::util::time::TimeValue>\n    getOldestPossibleMeasurementSource(TrackedBody const &body) {\n        boost::optional<osvr::util::time::TimeValue> oldest;\n        \/\/\/ Little lambda to set `oldest` if we haven't recorded a timestamp or\n        \/\/\/ if the given timestamp is older.\n        auto updateOldest = [&oldest](util::time::TimeValue const &timestamp) {\n            if (!oldest || timestamp < *oldest) {\n                oldest = timestamp;\n            }\n        };\n\n        body.forEachTarget([&updateOldest](TrackedBodyTarget const &target) {\n            \/\/\/ If we haven't recorded a timestamp or the current target has\n            \/\/\/ an older timestamp\n            updateOldest(target.getLastUpdate());\n        });\n\n        if (body.hasIMU()) {\n            \/\/\/ If we haven't recorded a timestamp or the IMU has an older\n            \/\/\/ timestamp\n            updateOldest(body.getIMU().getLastUpdate());\n        }\n        return oldest;\n    }\n\n    void TrackedBody::pruneHistory() {\n        if (m_impl->stateHistory.empty()) {\n            \/\/ can't prune an empty structure\n            return;\n        }\n        auto oldestOptional = getOldestPossibleMeasurementSource(*this);\n        if (!oldestOptional) {\n            \/\/ No timestamp yet - don't prune anything out yet.\n            return;\n        }\n        auto oldest = *oldestOptional;\n        if (m_impl->stateHistory.newest_timestamp() < oldest) {\n            \/\/ It would be a strange set of circumstances to bring this about,\n            \/\/ but we don't want to go from a non-empty history to an empty one.\n            \/\/ So in this case, we want to make sure we have at least one entry\n            \/\/ left over in the state history. Here's a quick way of doing that.\n            oldest = m_impl->stateHistory.newest_timestamp();\n        }\n\n        m_impl->stateHistory.pop_before(oldest);\n\n        m_impl->imuMeasurements.pop_before(oldest);\n    }\n\n    void TrackedBody::replaceStateSnapshot(\n        osvr::util::time::TimeValue const &origTime,\n        osvr::util::time::TimeValue const &newTime, BodyState const &newState) {\n#if !(defined(OSVR_UVBI_ASSUME_SINGLE_CAMERA) &&                               \\\n      defined(OSVR_UVBI_ASSUME_CAMERA_ALWAYS_SLOWER))\n#error \"Current code assumes that all we have to replay is IMU measurements.\"\n#endif \/\/ !(defined(OSVR_UVBI_ASSUME_SINGLE_CAMERA) &&\n        \/\/ defined(OSVR_UVBI_ASSUME_CAMERA_ALWAYS_SLOWER))\n\n        \/\/\/ Clear off the state we're about to invalidate.\n        auto numPopped = m_impl->stateHistory.pop_after(origTime);\n        \/\/\/ @todo number popped should be the same (or very nearly) as the\n        \/\/\/ number of IMU measurements we replay.\n\n        \/\/\/ Put on the new state estimate we just computed.\n        m_state = newState;\n        m_stateTime = newTime;\n        if (m_impl->stateHistory.is_valid_to_push_newest(m_stateTime)) {\n            pushState();\n        }\n\n        \/\/\/ Replay the IMU measurements timestamped later than our estimate\n        auto numReplayed = std::size_t{0};\n        for (auto &imuHist :\n             m_impl->imuMeasurements.get_range_newer_than(newTime)) {\n            applyIMUMeasurement(imuHist.first, imuHist.second);\n            ++numReplayed;\n        }\n#if 0\n        static ::util::Stride s{43};\n        if (++s) {\n#else\n        if (numPopped != numReplayed) {\n#endif\n            std::cout << \"Popped \" << numPopped << \", replayed \" << numReplayed\n                      << \"\\n\";\n        }\n    }\n\n    void TrackedBody::pushState() {\n        m_impl->stateHistory.push_newest(m_stateTime,\n                                         BodyStateHistoryEntry{m_state});\n    }\n\n    void TrackedBody::incorporateNewMeasurementFromIMU(\n        util::time::TimeValue const &tv, CannedIMUMeasurement const &meas) {\n        if (!getSystem().isRoomCalibrationComplete()) {\n            \/\/\/ If room calibration is incomplete, don't handle this locally. If\n            \/\/\/ it's an orientation, hand it to the tracking system to hand off\n            \/\/\/ to the room calibrator.\n            if (meas.orientationValid()) {\n                Eigen::Quaterniond quat;\n                meas.restoreQuat(quat);\n                getSystem().calibrationHandleIMUData(getId(), tv, quat);\n            }\n            return;\n        }\n\n        if (!m_impl->imuMeasurements.is_valid_to_push_newest(tv)) {\n            \/\/ This one is out of order from the IMU!\n            \/\/\/ @todo handle this better\n            throw std::runtime_error(\"Got out of order timestamps from IMU!\");\n        }\n\n        applyIMUMeasurement(tv, meas);\n\n        m_impl->imuMeasurements.push_newest(tv, meas);\n    }\n\n    void TrackedBody::applyIMUMeasurement(util::time::TimeValue const &tv,\n                                          CannedIMUMeasurement const &meas) {\n        \/\/ Only apply and push new stuff\n        if (m_impl->stateHistory.is_valid_to_push_newest(tv)) {\n            applyIMUToState(getSystem(), m_stateTime, m_state, m_processModel,\n                            tv, meas);\n            m_stateTime = tv;\n            pushState();\n        }\n    }\n\n    bool TrackedBody::hasPoseEstimate() const {\n        \/\/\/ @todo handle IMU here.\n        auto ret = false;\n        forEachTarget([&ret](TrackedBodyTarget &target) {\n            ret = ret || target.hasPoseEstimate();\n        });\n        return ret;\n    }\n\n} \/\/ namespace vbtracker\n} \/\/ namespace osvr\n<|endoftext|>"}
{"text":"<commit_before>#include \"LoginResponse.h\"\n\n<commit_msg>Add known data for LoginResponse PacketBuilder<commit_after>#include \"LoginResponse.h\"\n#include \"..\/..\/data\/PSO2String.h\"\n\nLoginResponsePacket::LoginResponsePacket(std::u16string loginErr, std::u16string blockName) : loginErr(loginErr), blockName(blockName) {}\n\nLoginResponsePacket::~LoginResponsePacket() {}\n\nPacketData LoginResponsePacket::build() {\n    Polaris::Data::PSO2String pso2LoginErr = Polaris::Data::CreatePSO2String(loginErr, 0xB6, 0x8BA4);\n    PacketHeader header(sizeof(PacketHeader) + 4 + pso2LoginErr.dataLength + 0xC + 0x40 + 0xB0 + 0xC ,0x11, 0x1, 0x0, 0x0);\n    PacketData packetData(header.length);\n    packetData.appendData(&header, sizeof(PacketHeader));\n    packetData.appendBytes(0, 4); \/\/ Unknown uint8 + uint8[3]\n    packetData.appendData(&pso2LoginErr.magicValue, 4);\n    packetData.appendData(pso2LoginErr.utf16string.data(), pso2LoginErr.dataLength);\n    packetData.appendBytes(0, 0xC); \/\/ Unknown uint8[0xC]\n    packetData.appendData(blockName.data(), blockName.size() * 2);\n    if (blockName.size() * 2 < 0x40) { \/\/TODO Verify block name isn't too big\n        packetData.appendBytes(0, 0x40 - (blockName.size() * 2)); \/\/ Because fixed length\n    }\n    packetData.appendBytes(0, 0xB0); \/\/ Unknown float32[0x2C] ... Likely important!\n    packetData.appendBytes(0, 0xC); \/\/ Unknown uint8[0xC]\n\n\n    return packetData;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <functional>\n#include <cstdio>\nusing namespace std;\n\nvoid rotation(int x, int y, int a, int b)\n{\n\tint x1 = -y + a + b;\n\tint y1 = x - a + b;\n\tcout << x1 << \" \" << y1 << endl;\n\n\tint x2 = -y1 + a + b;\n\tint y2 = x1 - a + b;\n\tcout << x2 << \" \" << y2 << endl;\n\n\tint x3 = -y2 + a + b;\n\tint y3 = x2 - a + b;\n\tcout << x3 << \" \" << y3 << endl;\n\n\tint x4 = -y3 + a + b;\n\tint y4 = x3 - a + b;\n\tcout << x4 << \" \" << y4 << endl;\n\treturn;\n}\n\nbool FormSquare(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4)\n{\n\tvector<int> dist;\n\tint d;\n\td = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n\tdist.push_back(d);\n\n\td = (x1 - x3) * (x1 - x3) + (y1 - y3) * (y1 - y3);\n\tdist.push_back(d);\n\n\td = (x1 - x4) * (x1 - x4) + (y1 - y4) * (y1 - y4);\n\tdist.push_back(d);\n\n\td = (x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3);\n\tdist.push_back(d);\n\n\td = (x2 - x4) * (x2 - x4) + (y2 - y4) * (y2 - y4);\n\tdist.push_back(d);\n\n\td = (x3 - x4) * (x3 - x4) + (y3 - y4) * (y3 - y4);\n\tdist.push_back(d);\n\n\tsort(dist.begin(), dist.end());\n\n\tif (dist[0] == dist[1] && dist[1] == dist[2] && dist[2] == dist[3] &&\n\t\t\tdist[4] == dist[5] && dist[0] < dist[4])\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\nint main()\n{\n\t\/\/rotation(-1, 1, 0, 0);\n\t\/\/freopen(\"input.txt\", \"r\", stdin);\n\tint n;\n\tcin >> n;\n\tfor (int k = 0; k < n; ++k)\n\t{\n\t\t\/\/cout << \"point \" << k+1 << endl;\n\t\tvector<vector<pair<int, int> > > v(4);\n\t\tfor (int i = 0; i < 4; ++i)\n\t\t{\n\t\t\tint x, y, a, b;\n\t\t\tcin >> x >> y >> a >> b;\n\n\t\t\t\/\/ no roration\n\t\t\tv[i].push_back(make_pair(x, y));\n\t\t\t\n\t\t\t\/\/ rotation once\n\t\t\tint x1 = -y + a + b;\n\t\t\tint y1 = x - a + b;\n\t\t\tv[i].push_back(make_pair(x1, y1));\n\n\t\t\t\/\/ rotation twice\n\t\t\tint x2 = -y1 + a + b;\n\t\t\tint y2 = x1 - a + b;\n\t\t\tv[i].push_back(make_pair(x2, y2));\n\n\t\t\t\/\/ rotation three times\n\t\t\tint x3 = -y2 + a + b;\n\t\t\tint y3 = x2 - a + b;\n\t\t\tv[i].push_back(make_pair(x3, y3));\n\t\t}\n\n\t\tbool flag = false;\n\t\tint ans = 300000;\n\t\tfor (int j1 = 0; j1 < 4; ++j1)\n\t\t{\n\t\t\tint x1 = v[0][j1].first;\n\t\t\tint y1 = v[0][j1].second;\n\n\t\t\tfor (int j2 = 0; j2 < 4; ++j2)\n\t\t\t{\n\t\t\t\tint x2 = v[1][j2].first;\n\t\t\t\tint y2 = v[1][j2].second;\n\t\t\t\tfor (int j3 = 0; j3 < 4; ++j3)\n\t\t\t\t{\n\t\t\t\t\tint x3 = v[2][j3].first;\n\t\t\t\t\tint y3 = v[2][j3].second;\n\t\t\t\t\tfor (int j4 = 0; j4 < 4; ++j4)\n\t\t\t\t\t{\n\t\t\t\t\t\tint x4 = v[3][j4].first;\n\t\t\t\t\t\tint y4 = v[3][j4].second;\n\t\t\t\t\t\t\/*\n\t\t\t\t\t\t\tif (j1 + j2 + j3 + j4 == 3) \n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcout << j1 << \" \" << j2 << \" \" << j3 << \" \" << j4 << endl;\n\t\t\t\t\t\t\t\tcout << x1 << \" \" << y1 << endl;\n\t\t\t\t\t\t\t\tcout << x2 << \" \" << y2 << endl;\n\t\t\t\t\t\t\t\tcout << x3 << \" \" << y3 << endl;\n\t\t\t\t\t\t\t\tcout << x4 << \" \" << y4 << endl;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t*\/\n\t\t\t\t\t\tif (FormSquare(x1,y1,x2,y2,x3,y3,x4,y4))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\tans = min(j1+j2+j3+j4, ans);\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\tif (flag) cout << ans << endl;\n\t\telse cout << -1 << endl;\n\t}\n\n\treturn 0;\n}\n<commit_msg>int overflow, shold use longlong to avoid the square computation overflow, what a shame, shame !<commit_after>#include <iostream>\n#include <string>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <functional>\n#include <cstdio>\nusing namespace std;\n\nvoid rotation(int x, int y, int a, int b)\n{\n\tint x1 = -y + a + b;\n\tint y1 = x - a + b;\n\tcout << x1 << \" \" << y1 << endl;\n\n\tint x2 = -y1 + a + b;\n\tint y2 = x1 - a + b;\n\tcout << x2 << \" \" << y2 << endl;\n\n\tint x3 = -y2 + a + b;\n\tint y3 = x2 - a + b;\n\tcout << x3 << \" \" << y3 << endl;\n\n\tint x4 = -y3 + a + b;\n\tint y4 = x3 - a + b;\n\tcout << x4 << \" \" << y4 << endl;\n\treturn;\n}\n\nbool FormSquare(long long x1, long long y1, long long x2, long long y2, long long x3, long long y3, long long x4, long long y4)\n{\n\tvector<long long> dist;\n\tlong long d;\n\td = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n\tdist.push_back(d);\n\n\td = (x1 - x3) * (x1 - x3) + (y1 - y3) * (y1 - y3);\n\tdist.push_back(d);\n\n\td = (x1 - x4) * (x1 - x4) + (y1 - y4) * (y1 - y4);\n\tdist.push_back(d);\n\n\td = (x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3);\n\tdist.push_back(d);\n\n\td = (x2 - x4) * (x2 - x4) + (y2 - y4) * (y2 - y4);\n\tdist.push_back(d);\n\n\td = (x3 - x4) * (x3 - x4) + (y3 - y4) * (y3 - y4);\n\tdist.push_back(d);\n\n\tsort(dist.begin(), dist.end());\n\n\tif (dist[0] == dist[1] && dist[1] == dist[2] && dist[2] == dist[3] &&\n\t\t\tdist[4] == dist[5] && dist[0] < dist[4])\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\nint main()\n{\n\t\/\/rotation(-1, 1, 0, 0);\n\t\/\/freopen(\"input.in\", \"r\", stdin);\n\tint n;\n\tcin >> n;\n\tfor (int k = 0; k < n; ++k)\n\t{\n\t\t\/\/cout << \"point \" << k+1 << endl;\n\t\tvector<vector<pair<int, int> > > v(4);\n\t\tfor (int i = 0; i < 4; ++i)\n\t\t{\n\t\t\tint x, y, a, b;\n\t\t\tcin >> x >> y >> a >> b;\n\n\t\t\t\/\/ no roration\n\t\t\tv[i].push_back(make_pair(x, y));\n\t\t\t\n\t\t\t\/\/ rotation once\n\t\t\tint x1 = -y + a + b;\n\t\t\tint y1 = x - a + b;\n\t\t\tv[i].push_back(make_pair(x1, y1));\n\n\t\t\t\/\/ rotation twice\n\t\t\tint x2 = -y1 + a + b;\n\t\t\tint y2 = x1 - a + b;\n\t\t\tv[i].push_back(make_pair(x2, y2));\n\n\t\t\t\/\/ rotation three times\n\t\t\tint x3 = -y2 + a + b;\n\t\t\tint y3 = x2 - a + b;\n\t\t\tv[i].push_back(make_pair(x3, y3));\n\t\t}\n\n\t\tbool flag = false;\n\t\tint ans = 300000;\n\t\tfor (int j1 = 0; j1 < 4; ++j1)\n\t\t{\n\t\t\tint x1 = v[0][j1].first;\n\t\t\tint y1 = v[0][j1].second;\n\n\t\t\tfor (int j2 = 0; j2 < 4; ++j2)\n\t\t\t{\n\t\t\t\tint x2 = v[1][j2].first;\n\t\t\t\tint y2 = v[1][j2].second;\n\t\t\t\tfor (int j3 = 0; j3 < 4; ++j3)\n\t\t\t\t{\n\t\t\t\t\tint x3 = v[2][j3].first;\n\t\t\t\t\tint y3 = v[2][j3].second;\n\t\t\t\t\tfor (int j4 = 0; j4 < 4; ++j4)\n\t\t\t\t\t{\n\t\t\t\t\t\tint x4 = v[3][j4].first;\n\t\t\t\t\t\tint y4 = v[3][j4].second;\n\t\t\t\t\t\t\/*\n\t\t\t\t\t\t\tif (j1 + j2 + j3 + j4 == 8) \n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcout << \"The rotations times---\" << endl;\n\t\t\t\t\t\t\t\tcout << j1 << \" \" << j2 << \" \" << j3 << \" \" << j4 << endl;\n\t\t\t\t\t\t\t\tcout << \"The four points:---\" << endl;\n\t\t\t\t\t\t\t\tcout << x1 << \" \" << y1 << endl;\n\t\t\t\t\t\t\t\tcout << x2 << \" \" << y2 << endl;\n\t\t\t\t\t\t\t\tcout << x3 << \" \" << y3 << endl;\n\t\t\t\t\t\t\t\tcout << x4 << \" \" << y4 << endl;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t*\/\n\t\t\t\t\t\tif (FormSquare(x1,y1,x2,y2,x3,y3,x4,y4))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\tans = min(j1+j2+j3+j4, ans);\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\tif (flag) cout << ans << endl;\n\t\telse cout << -1 << endl;\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* posixtools.node: A node.JS addon to add useful tools for creating *nix servers\n* dervied from daemon.node, unicorn\n*\n* Copyright 2011 (c) <todd>\n*\n* Under MIT License. See LICENSE file.\n*\n*\/\n\n#include <v8.h>\n#include <node.h>\n#include <unistd.h>\n#include <stdlib.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <pwd.h>\n#include <errno.h>\n#include <string.h>\n#include <sys\/socket.h>\n\n#define PID_MAXLEN 10\n\nusing namespace v8;\nusing namespace node;\n\n\/\/\n\/\/ Add fork method to allow forking node.js process\n\/\/\nstatic Handle<Value> Fork(const Arguments& args) {\n  HandleScope scope;\n  pid_t sid, pid;\n  int i, new_fd;\n\n  pid = fork();\n  \/\/ http:\/\/www.unixguide.net\/unix\/programming\/1.1.2.shtml\n  \/\/ vfork really isn't necessary... use fork\n\n  if (pid < 0)      exit(1);\n\n  if (pid == 0) {\n    \/\/ Child process: We need to tell libev that we are forking because\n    \/\/ kqueue can't deal with this gracefully.\n    \/\/\n    \/\/ See: http:\/\/pod.tst.eu\/http:\/\/cvs.schmorp.de\/libev\/ev.pod#code_ev_fork_code_the_audacity_to_re\n    \/\/printf(\"eio req: %d, threads: %d, pending: %d, ready: %d\\n\", eio_nreqs(), eio_nthreads(), eio_npending(), eio_nready());\n    ev_default_fork();\n#if HAVE_SRANDDEV == 1\n    sranddev();\n#else\n    srand(time(NULL));\n#endif\n\n    return scope.Close(Number::New(pid));\n\n  }\n\n  return scope.Close(Number::New(pid));\n}\nstatic Handle<Value> SetSocketOpts(const Arguments& args) {\n  HandleScope scope;\n  int flags = 1;\n  int r;\n  int fd = args[0]->ToInteger()->Value();\n\n  if ((r=setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, (void *)&flags, sizeof(flags))) < 0) { \n    fprintf(stderr, \"setsockopt(error): %d, %d:%s\\n\", r, errno, strerror(errno));\n  }\n\n  return scope.Close(Number::New(r));\n}\nstatic Handle<Value> Dup2(const Arguments& args) {\n  HandleScope scope;\n  int flags = 1;\n  int r;\n  int fd1 = args[0]->ToInteger()->Value();\n  int fd2 = args[1]->ToInteger()->Value();\n\n  if ((r=dup2(fd1, fd2)) < 0) { \n    fprintf(stderr, \"dup2(error): %d, %d:%s\\n\", r, errno, strerror(errno));\n    return ThrowException(Exception::Error(String::New(\"dup2 error\")));\n  }\n\n  return scope.Close(Number::New(r));\n}\n\/\/\n\/\/  execve(const char *path, char *const argv[], char *const envp[]);\n\/\/\n\/\/ see: man 2 execve\n\/\/\n\/\/ some of this implementation is borrowed by reference to node_child_process.cc\nstatic Handle<Value> Execve(const Arguments& args) {\n  HandleScope scope;\n\n  if (args.Length() != 3 || \n      !args[0]->IsString() ||\n      !args[1]->IsArray() ||\n      !args[2]->IsArray()) {\n    fprintf(stderr, \"args.Length: %d, %d, %d, %d\\n\", args.Length(), args[0]->IsString(), args[1]->IsArray(), args[2]->IsArray());\n    return ThrowException(Exception::Error(String::New(\"Bad Arguments, expected: path, argv[], envp[]\")));\n  }\n\n  int i;\n  String::Utf8Value file(args[0]->ToString());\n  \/\/ Copy arguments args[1] and args[2] into a c-string array called argv.\n  \/\/ The array must be null terminated, and the first element must be\n  \/\/ the name of the executable -- hence the complication.\n  Local<Array> argv_handle = Local<Array>::Cast(args[1]);\n  Local<Array> envp_handle = Local<Array>::Cast(args[2]);\n\n  \/\/ setup argv\n  int argc = argv_handle->Length();\n  int argv_length = argc + 1 + 1;\n  char **argv = new char*[argv_length]; \/\/ heap allocated to detect errors\n  argv[0] = strdup(*file); \/\/ + 1 for file\n  argv[argv_length-1] = NULL;  \/\/ + 1 for NULL;\n  for (i = 0; i < argc; ++i) {\n    String::Utf8Value arg(argv_handle->Get(Integer::New(i))->ToString());\n    argv[i+1] = strdup(*arg);\n  }\n\n  \/\/ setup env\n  int envc = envp_handle->Length();\n  char **envp = new char*[envc+1];\n  envp[envc] = NULL; \/\/ + 1 for NULL;\n  for (i = 0; i < envc; ++i) {\n    String::Utf8Value env(envp_handle->Get(Integer::New(i))->ToString());\n    envp[i] = strdup(*env);\n  }\n  fprintf(stderr, \"execute file: %s\\n\", *file);\n\n  int r = execve(*file, argv, envp);\n\n  \/\/ return's only on error\n  return ThrowException(Exception::Error(String::New(\"Execve failed!\")));\n}\n\n\/\/ set the fd to close on a call to exec\nstatic Handle<Value> FdCloseOnExec(const Arguments& args) {\n  HandleScope scope;\n  if (!args[0]->IsNumber()) {\n    return ThrowException(Exception::Error(String::New(\"When setting a umask it must be an integer\")));\n  }\n  int fd = args[0]->ToInteger()->Value();\n  int flags = fcntl(fd, F_GETFD, 0);\n\n  return scope.Close(Number::New(fcntl(fd, F_SETFD, flags | FD_CLOEXEC)));\n}\n\/\/ set the fd to stay open after an exec call\nstatic Handle<Value> FdOpenOnExec(const Arguments& args) {\n  HandleScope scope;\n  if (!args[0]->IsNumber()) {\n    return ThrowException(Exception::Error(String::New(\"When setting a umask it must be an integer\")));\n  }\n  int fd = args[0]->ToInteger()->Value();\n  int flags = fcntl(fd, F_GETFD, 0);\n\n  \n  return scope.Close(Number::New(fcntl(fd, F_SETFD, flags & ~FD_CLOEXEC)));\n}\n\n\/\/\n\/\/ Add getpid at least until process.pid returns the actual pid via getpid call this is necessary work around\n\/\/\nstatic Handle<Value> GetPid(const Arguments& args) {\n  HandleScope scope;\n  return scope.Close(Number::New(getpid()));\n}\n\n\/\/\n\/\/ Add getppid get our parent process id\n\/\/\nstatic Handle<Value> GetPPid(const Arguments& args) {\n  HandleScope scope;\n  return scope.Close(Number::New(getppid()));\n}\n\nstatic Handle<Value> SetSid(const Arguments& args) {\n  HandleScope scope;\n  return scope.Close(Number::New(setsid()));\n}\n\nstatic Handle<Value> Umask(const Arguments& args) {\n  HandleScope scope;\n  if (!args[0]->IsNumber()) {\n    return ThrowException(Exception::Error(String::New(\"When setting a umask it must be an integer\")));\n  }\n  int mask = args[0]->ToInteger()->Value();\n  return scope.Close(Number::New(umask(mask)));\n}\n\nstatic Handle<Value> IsAlive(const Arguments& args) {\n  HandleScope scope;\n  int status;\n  int pid = args[0]->ToInteger()->Value();\n  int r = waitpid(pid, &status, WNOHANG | WUNTRACED);\n\/\/  fprintf(stderr, \"%d, %d:%s\\n\", r, errno, strerror(errno));\n\/\/  fflush(stderr);\n  if (r == -1) { return scope.Close(Boolean::New(false)); }\n  return scope.Close(Boolean::New(true));\n}\n\n\/\/\n\/\/ reopen stdout, stdin, stderr\n\/\/ stdout and stderr may be reopened to a path or \/dev\/null\n\/\/ stdin is always reopened to \/dev\/null\n\/\/\n\/\/   fork.reopen_stdio(\"\/path\/to\/stdout\", \"\/path\/to\/stderr\");\n\/\/\nstatic Handle<Value> ReOpenStdIO(const Arguments& args) {\n  HandleScope scope;\n  if (!args[0]->IsString() || !args[1]->IsString()) {\n    return ThrowException(Exception::Error(String::New(\"Must provide a path to reopen STDOUT and STDERR\")));\n  }\n  String::Utf8Value stdout_path(args[0]->ToString());\n  String::Utf8Value stderr_path(args[1]->ToString());\n\n  stdin  = freopen(\"\/dev\/null\", \"r\", stdin);\n  stdout = freopen(*stdout_path, \"a\", stdout);\n  stderr = freopen(*stderr_path, \"a\", stderr);\n\n  if (stdout && stderr) {\n    return scope.Close(Number::New(1));\n  }\n  else {\n    return ThrowException(Exception::Error(String::New(\"Error unable to reopen stdout and stderr\")));\n  }\n}\n\n\/\/\n\/\/ Initialize this add-on\n\/\/\nextern \"C\" void init(Handle<Object> target) {\n  HandleScope scope;\n  \n  NODE_SET_METHOD(target, \"fork\", Fork);\n  NODE_SET_METHOD(target, \"getpid\", GetPid);\n  NODE_SET_METHOD(target, \"setsid\", SetSid);\n  NODE_SET_METHOD(target, \"reopen_stdio\", ReOpenStdIO);\n  NODE_SET_METHOD(target, \"umask\", Umask);\n  NODE_SET_METHOD(target, \"isalive\", IsAlive);\n  NODE_SET_METHOD(target, \"getppid\", GetPPid);\n  NODE_SET_METHOD(target, \"fd_close_on_exec\", FdCloseOnExec);\n  NODE_SET_METHOD(target, \"fd_open_on_exec\", FdOpenOnExec);\n  NODE_SET_METHOD(target, \"execve\", Execve);\n  NODE_SET_METHOD(target, \"set_socket_opts\", SetSocketOpts);\n  NODE_SET_METHOD(target, \"dup2\", Dup2);\n}\n<commit_msg>a reference<commit_after>\/*\n* posixtools.node: A node.JS addon to add useful tools for creating *nix servers\n* dervied from daemon.node, unicorn\n*\n* Copyright 2011 (c) <todd>\n*\n* Under MIT License. See LICENSE file.\n*\n*\/\n\n#include <v8.h>\n#include <node.h>\n#include <unistd.h>\n#include <stdlib.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <pwd.h>\n#include <errno.h>\n#include <string.h>\n#include <sys\/socket.h>\n\n#define PID_MAXLEN 10\n\nusing namespace v8;\nusing namespace node;\n\n\/\/\n\/\/ Add fork method to allow forking node.js process\n\/\/\nstatic Handle<Value> Fork(const Arguments& args) {\n  HandleScope scope;\n  pid_t sid, pid;\n  int i, new_fd;\n\n  pid = fork();\n  \/\/ http:\/\/www.unixguide.net\/unix\/programming\/1.1.2.shtml\n  \/\/ vfork really isn't necessary... use fork\n\n  if (pid < 0)      exit(1);\n\n  if (pid == 0) {\n    \/\/ Child process: We need to tell libev that we are forking because\n    \/\/ kqueue can't deal with this gracefully.\n    \/\/\n    \/\/ See: http:\/\/pod.tst.eu\/http:\/\/cvs.schmorp.de\/libev\/ev.pod#code_ev_fork_code_the_audacity_to_re\n    \/\/printf(\"eio req: %d, threads: %d, pending: %d, ready: %d\\n\", eio_nreqs(), eio_nthreads(), eio_npending(), eio_nready());\n    ev_default_fork();\n#if HAVE_SRANDDEV == 1\n    sranddev();\n#else\n    srand(time(NULL));\n#endif\n\n    return scope.Close(Number::New(pid));\n\n  }\n\n  return scope.Close(Number::New(pid));\n}\nstatic Handle<Value> SetSocketOpts(const Arguments& args) {\n  HandleScope scope;\n  int flags = 1;\n  int r;\n  int fd = args[0]->ToInteger()->Value();\n\n  if ((r=setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, (void *)&flags, sizeof(flags))) < 0) { \n    fprintf(stderr, \"setsockopt(error): %d, %d:%s\\n\", r, errno, strerror(errno));\n  }\n\n  return scope.Close(Number::New(r));\n}\nstatic Handle<Value> Dup2(const Arguments& args) {\n  HandleScope scope;\n  int flags = 1;\n  int r;\n  int fd1 = args[0]->ToInteger()->Value();\n  int fd2 = args[1]->ToInteger()->Value();\n\n  if ((r=dup2(fd1, fd2)) < 0) { \n    fprintf(stderr, \"dup2(error): %d, %d:%s\\n\", r, errno, strerror(errno));\n    return ThrowException(Exception::Error(String::New(\"dup2 error\")));\n  }\n\n  return scope.Close(Number::New(r));\n}\n\/\/\n\/\/  execve(const char *path, char *const argv[], char *const envp[]);\n\/\/\n\/\/ see: man 2 execve\n\/\/\n\/\/ some of this implementation is borrowed by reference to node_child_process.cc\nstatic Handle<Value> Execve(const Arguments& args) {\n  HandleScope scope;\n\n  if (args.Length() != 3 || \n      !args[0]->IsString() ||\n      !args[1]->IsArray() ||\n      !args[2]->IsArray()) {\n    fprintf(stderr, \"args.Length: %d, %d, %d, %d\\n\", args.Length(), args[0]->IsString(), args[1]->IsArray(), args[2]->IsArray());\n    return ThrowException(Exception::Error(String::New(\"Bad Arguments, expected: path, argv[], envp[]\")));\n  }\n\n  int i;\n  String::Utf8Value file(args[0]->ToString());\n  \/\/ Copy arguments args[1] and args[2] into a c-string array called argv.\n  \/\/ The array must be null terminated, and the first element must be\n  \/\/ the name of the executable -- hence the complication.\n  Local<Array> argv_handle = Local<Array>::Cast(args[1]);\n  Local<Array> envp_handle = Local<Array>::Cast(args[2]);\n\n  \/\/ setup argv\n  int argc = argv_handle->Length();\n  int argv_length = argc + 1 + 1;\n  char **argv = new char*[argv_length]; \/\/ heap allocated to detect errors\n  argv[0] = strdup(*file); \/\/ + 1 for file\n  argv[argv_length-1] = NULL;  \/\/ + 1 for NULL;\n  for (i = 0; i < argc; ++i) {\n    String::Utf8Value arg(argv_handle->Get(Integer::New(i))->ToString());\n    argv[i+1] = strdup(*arg);\n  }\n\n  \/\/ setup env\n  int envc = envp_handle->Length();\n  char **envp = new char*[envc+1];\n  envp[envc] = NULL; \/\/ + 1 for NULL;\n  for (i = 0; i < envc; ++i) {\n    String::Utf8Value env(envp_handle->Get(Integer::New(i))->ToString());\n    envp[i] = strdup(*env);\n  }\n  fprintf(stderr, \"execute file: %s\\n\", *file);\n\n  int r = execve(*file, argv, envp);\n\n  \/\/ return's only on error\n  return ThrowException(Exception::Error(String::New(\"Execve failed!\")));\n}\n\n\/\/ set the fd to close on a call to exec\nstatic Handle<Value> FdCloseOnExec(const Arguments& args) {\n  HandleScope scope;\n  if (!args[0]->IsNumber()) {\n    return ThrowException(Exception::Error(String::New(\"When setting a umask it must be an integer\")));\n  }\n  int fd = args[0]->ToInteger()->Value();\n  int flags = fcntl(fd, F_GETFD, 0);\n\n  return scope.Close(Number::New(fcntl(fd, F_SETFD, flags | FD_CLOEXEC)));\n}\n\n\/\/ set the fd to stay open after an exec call\n\/\/ see: http:\/\/www.gnu.org\/s\/hello\/manual\/libc\/Descriptor-Flags.html\nstatic Handle<Value> FdOpenOnExec(const Arguments& args) {\n  HandleScope scope;\n  if (!args[0]->IsNumber()) {\n    return ThrowException(Exception::Error(String::New(\"When setting a umask it must be an integer\")));\n  }\n  int fd = args[0]->ToInteger()->Value();\n  int flags = fcntl(fd, F_GETFD, 0);\n\n  \n  return scope.Close(Number::New(fcntl(fd, F_SETFD, flags & ~FD_CLOEXEC)));\n}\n\n\/\/\n\/\/ Add getpid at least until process.pid returns the actual pid via getpid call this is necessary work around\n\/\/\nstatic Handle<Value> GetPid(const Arguments& args) {\n  HandleScope scope;\n  return scope.Close(Number::New(getpid()));\n}\n\n\/\/\n\/\/ Add getppid get our parent process id\n\/\/\nstatic Handle<Value> GetPPid(const Arguments& args) {\n  HandleScope scope;\n  return scope.Close(Number::New(getppid()));\n}\n\nstatic Handle<Value> SetSid(const Arguments& args) {\n  HandleScope scope;\n  return scope.Close(Number::New(setsid()));\n}\n\nstatic Handle<Value> Umask(const Arguments& args) {\n  HandleScope scope;\n  if (!args[0]->IsNumber()) {\n    return ThrowException(Exception::Error(String::New(\"When setting a umask it must be an integer\")));\n  }\n  int mask = args[0]->ToInteger()->Value();\n  return scope.Close(Number::New(umask(mask)));\n}\n\nstatic Handle<Value> IsAlive(const Arguments& args) {\n  HandleScope scope;\n  int status;\n  int pid = args[0]->ToInteger()->Value();\n  int r = waitpid(pid, &status, WNOHANG | WUNTRACED);\n\/\/  fprintf(stderr, \"%d, %d:%s\\n\", r, errno, strerror(errno));\n\/\/  fflush(stderr);\n  if (r == -1) { return scope.Close(Boolean::New(false)); }\n  return scope.Close(Boolean::New(true));\n}\n\n\/\/\n\/\/ reopen stdout, stdin, stderr\n\/\/ stdout and stderr may be reopened to a path or \/dev\/null\n\/\/ stdin is always reopened to \/dev\/null\n\/\/\n\/\/   fork.reopen_stdio(\"\/path\/to\/stdout\", \"\/path\/to\/stderr\");\n\/\/\nstatic Handle<Value> ReOpenStdIO(const Arguments& args) {\n  HandleScope scope;\n  if (!args[0]->IsString() || !args[1]->IsString()) {\n    return ThrowException(Exception::Error(String::New(\"Must provide a path to reopen STDOUT and STDERR\")));\n  }\n  String::Utf8Value stdout_path(args[0]->ToString());\n  String::Utf8Value stderr_path(args[1]->ToString());\n\n  stdin  = freopen(\"\/dev\/null\", \"r\", stdin);\n  stdout = freopen(*stdout_path, \"a\", stdout);\n  stderr = freopen(*stderr_path, \"a\", stderr);\n\n  if (stdout && stderr) {\n    return scope.Close(Number::New(1));\n  }\n  else {\n    return ThrowException(Exception::Error(String::New(\"Error unable to reopen stdout and stderr\")));\n  }\n}\n\n\/\/\n\/\/ Initialize this add-on\n\/\/\nextern \"C\" void init(Handle<Object> target) {\n  HandleScope scope;\n  \n  NODE_SET_METHOD(target, \"fork\", Fork);\n  NODE_SET_METHOD(target, \"getpid\", GetPid);\n  NODE_SET_METHOD(target, \"setsid\", SetSid);\n  NODE_SET_METHOD(target, \"reopen_stdio\", ReOpenStdIO);\n  NODE_SET_METHOD(target, \"umask\", Umask);\n  NODE_SET_METHOD(target, \"isalive\", IsAlive);\n  NODE_SET_METHOD(target, \"getppid\", GetPPid);\n  NODE_SET_METHOD(target, \"fd_close_on_exec\", FdCloseOnExec);\n  NODE_SET_METHOD(target, \"fd_open_on_exec\", FdOpenOnExec);\n  NODE_SET_METHOD(target, \"execve\", Execve);\n  NODE_SET_METHOD(target, \"set_socket_opts\", SetSocketOpts);\n  NODE_SET_METHOD(target, \"dup2\", Dup2);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n#include <cstdlib>\n#include <iomanip>\n#include <vector>\n\n#include <MultiRegions\/ExpList.h>\n#include <MultiRegions\/ExpList1D.h>\n#include <MultiRegions\/ExpList2D.h>\n#include <MultiRegions\/ExpList2DHomogeneous1D.h>\n#include <MultiRegions\/ExpList3DHomogeneous1D.h>\n#include <MultiRegions\/ExpList3DHomogeneous2D.h>\nusing namespace Nektar;\n\nint main(int argc, char *argv[])\n{\n    int i,j,k;\n\n    if(argc != 6)\n    {\n        fprintf(stderr,\n                \"Usage: Fld2DTo2D5 2dmeshfile 2dfieldfile 3dmeshfile 3dfieldfile outfield\\n\");\n        exit(1);\n    }\n    string datasave(argv[5]);\n    \n    string mesh2d(argv[1]);\n    string mesh3d(argv[3]);\n    \n    \/\/ create 2d session\n    LibUtilities::SessionReaderSharedPtr vSession2d\n            = LibUtilities::SessionReader::CreateInstance(2, argv);\n    std::vector<std::string> filenames;\n    filenames.push_back(mesh3d);\n    \/\/ create 3D session\n    LibUtilities::SessionReaderSharedPtr vSession3d\n            = LibUtilities::SessionReader::CreateInstance(2, argv, filenames, vSession2d->GetComm());\n    \n    SpatialDomains::MeshGraphSharedPtr graphShPt2d = SpatialDomains::MeshGraph::Read(vSession2d);\n    SpatialDomains::MeshGraphSharedPtr graphShPt3d = SpatialDomains::MeshGraph::Read(vSession3d);\n    \/\/ 2D\n    string field2dfile(argv[2]);\n    vector<LibUtilities::FieldDefinitionsSharedPtr> field2ddef;\n    vector<vector<NekDouble> > field2ddata;\n    LibUtilities::Import(field2dfile,field2ddef,field2ddata);\n    \/\/ 3D\n    string field3dfile(argv[4]);\n    vector<LibUtilities::FieldDefinitionsSharedPtr> field3ddef;\n    vector<vector<NekDouble> > field3ddata;\n    LibUtilities::Import(field3dfile,field3ddef,field3ddata);\n    vector<vector<NekDouble> > field3ddatanew(field3ddef.size());\n    \/\/ Set up Expansion information\n    vector< vector<LibUtilities::PointsType> > pointstype2d;\n    vector< vector<LibUtilities::PointsType> > pointstype3d;\n    for(i = 0; i < field2ddef.size(); ++i)\n    {\n        vector<LibUtilities::PointsType> ptype2d;\n        for(j = 0; j < 2; ++j)\n        {\n            ptype2d.push_back(LibUtilities::ePolyEvenlySpaced);\n        }\n        pointstype2d.push_back(ptype2d);\n    }\n    graphShPt2d->SetExpansions(field2ddef,pointstype2d);\n    for(i = 0; i < field3ddef.size(); ++i)\n    {\n        vector<LibUtilities::PointsType> ptype3d;\n        for(j = 0; j < 2; ++j)\n        {\n            ptype3d.push_back(LibUtilities::ePolyEvenlySpaced);\n        }\n        pointstype3d.push_back(ptype3d);\n    }\n    graphShPt3d->SetExpansions(field3ddef,pointstype3d);\n    bool useFFT = false;\n    bool dealiasing = false;\n    \/\/ Define Expansion\n    int nfields2d = field2ddef[0]->m_fields.size();\n    int nfields3d = field3ddef[0]->m_fields.size();\n    \/\/ Gen 2d\n    Array<OneD, MultiRegions::ExpListSharedPtr> Exp2d(nfields2d);\n    MultiRegions::ExpList2DSharedPtr Exp2D;\n    Exp2D = MemoryManager<MultiRegions::ExpList2D>::AllocateSharedPtr(vSession2d,graphShPt2d);\n    Exp2d[0] =  Exp2D;\n    for(i = 1; i < nfields2d; ++i)\n    {\n        Exp2d[i] = MemoryManager<MultiRegions::ExpList2D>::AllocateSharedPtr(*Exp2D);\n    }\n    \/\/ Gen 3d\n    Array<OneD, MultiRegions::ExpListSharedPtr> Exp3d(nfields3d);\n    MultiRegions::ExpList3DHomogeneous1DSharedPtr Exp3DH1;\n    \/\/ Define Homogeneous expansion\n    int nplanes; \n    vSession3d->LoadParameter(\"HomModesZ\",nplanes,field3ddef[0]->m_numModes[2]);\n    \/\/ nplanes + 1 points\n    const LibUtilities::PointsKey Pkey(nplanes,LibUtilities::ePolyEvenlySpaced);\n    const LibUtilities::BasisKey  Bkey(field3ddef[0]->m_basis[2],nplanes,Pkey);\n    NekDouble lz = field3ddef[0]->m_homogeneousLengths[0];\n    Exp3DH1 = MemoryManager<MultiRegions::ExpList3DHomogeneous1D>::AllocateSharedPtr(vSession3d,Bkey,lz,useFFT,dealiasing,graphShPt3d);\n    Exp3d[0] = Exp3DH1;\n    for(j = 1; j < nfields3d; ++j)\n    {\t\n          Exp3d[j] = MemoryManager<MultiRegions::ExpList3DHomogeneous1D>::AllocateSharedPtr(*Exp3DH1);\n    }\n    \n    k=0;\n    for(j = 0; j < nfields2d-1; ++j)\n    {\t\n       \tfor(int i = 0; i < field2ddata.size(); ++i)\n       \t{\n                   Exp2d[j]->ExtractDataToCoeffs(\n                                        field2ddef[i],\n\t\t                                field2ddata[i],\n\t\t                                field2ddef[i]->m_fields[j],\n\t\t                                Exp3d[j]->GetPlane(k)->UpdateCoeffs());            \n        }\n    }\n    Array<OneD, Array<OneD, NekDouble> > fieldcoeffs(vSession3d->GetVariables().size());\n    for(j = 0; j < fieldcoeffs.num_elements(); ++j)\n    {\n        fieldcoeffs[j] = Exp3d[j]->UpdateCoeffs();\n        for(int i = 0; i < field3ddef.size(); ++i)\n    \t{\n          Exp3d[0]->AppendFieldData(field3ddef[i], field3ddatanew[i],fieldcoeffs[j]);\n    \t}\n    }\n    LibUtilities::Write(datasave,field3ddef,field3ddatanew);\n    return 0;\n}\n\/\/ Only for 2d to 2d5 Hui Xu 23 Aug 2013\n<commit_msg>Added new pressure field<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <iomanip>\n#include <vector>\n\n#include <MultiRegions\/ExpList.h>\n#include <MultiRegions\/ExpList1D.h>\n#include <MultiRegions\/ExpList2D.h>\n#include <MultiRegions\/ExpList2DHomogeneous1D.h>\n#include <MultiRegions\/ExpList3DHomogeneous1D.h>\n#include <MultiRegions\/ExpList3DHomogeneous2D.h>\nusing namespace Nektar;\n\nint main(int argc, char *argv[])\n{\n    int i,j,k;\n\n    if(argc != 6)\n    {\n        fprintf(stderr,\n                \"Usage: Fld2DTo2D5 2dmeshfile 2dfieldfile 3dmeshfile 3dfieldfile outfield\\n\");\n        exit(1);\n    }\n    string datasave(argv[5]);\n    \n    string mesh2d(argv[1]);\n    string mesh3d(argv[3]);\n    \n    \/\/create 2d session\n    LibUtilities::SessionReaderSharedPtr vSession2d\n            = LibUtilities::SessionReader::CreateInstance(2, argv);\n    std::vector<std::string> filenames;\n    filenames.push_back(mesh3d);\n    \/\/create 3D session\n    LibUtilities::SessionReaderSharedPtr vSession3d\n            = LibUtilities::SessionReader::CreateInstance(2, argv, filenames, vSession2d->GetComm());\n    \n    SpatialDomains::MeshGraphSharedPtr graphShPt2d = SpatialDomains::MeshGraph::Read(vSession2d);\n    SpatialDomains::MeshGraphSharedPtr graphShPt3d = SpatialDomains::MeshGraph::Read(vSession3d);\n    \/\/2D\n    string field2dfile(argv[2]);\n    vector<LibUtilities::FieldDefinitionsSharedPtr> field2ddef;\n    vector<vector<NekDouble> > field2ddata;\n    LibUtilities::Import(field2dfile,field2ddef,field2ddata);\n    \/\/3D\n    string field3dfile(argv[4]);\n    vector<LibUtilities::FieldDefinitionsSharedPtr> field3ddef;\n    vector<vector<NekDouble> > field3ddata;\n    LibUtilities::Import(field3dfile,field3ddef,field3ddata);\n    vector<vector<NekDouble> > field3ddatanew(field3ddef.size());\n    \/\/ Set up Expansion information\n    vector< vector<LibUtilities::PointsType> > pointstype2d;\n    vector< vector<LibUtilities::PointsType> > pointstype3d;\n    for(i = 0; i < field2ddef.size(); ++i)\n    {\n        vector<LibUtilities::PointsType> ptype2d;\n        for(j = 0; j < 2; ++j)\n        {\n            ptype2d.push_back(LibUtilities::ePolyEvenlySpaced);\n        }\n        pointstype2d.push_back(ptype2d);\n    }\n    graphShPt2d->SetExpansions(field2ddef,pointstype2d);\n    for(i = 0; i < field3ddef.size(); ++i)\n    {\n        vector<LibUtilities::PointsType> ptype3d;\n        for(j = 0; j < 2; ++j)\n        {\n            ptype3d.push_back(LibUtilities::ePolyEvenlySpaced);\n        }\n        pointstype3d.push_back(ptype3d);\n    }\n    graphShPt3d->SetExpansions(field3ddef,pointstype3d);\n    bool useFFT = false;\n    bool dealiasing = false;\n    \/\/ Define Expansion\n    \/\/int expdim2d  = graphShPt2d->GetMeshDimension();\n    int nfields2d = field2ddef[0]->m_fields.size();\n    \/\/int expdim3d  = graphShPt3d->GetMeshDimension();\n    int nfields3d = field3ddef[0]->m_fields.size();\n    \/\/Gen 2d\n    Array<OneD, MultiRegions::ExpListSharedPtr> Exp2d(nfields2d);\n    MultiRegions::ExpList2DSharedPtr Exp2D;\n    Exp2D = MemoryManager<MultiRegions::ExpList2D>::AllocateSharedPtr(vSession2d,graphShPt2d);\n    Exp2d[0] =  Exp2D;\n    for(i = 1; i < nfields2d; ++i)\n    {\n        Exp2d[i] = MemoryManager<MultiRegions::ExpList2D>::AllocateSharedPtr(*Exp2D);\n    }\n    \/\/Gen 3d\n    Array<OneD, MultiRegions::ExpListSharedPtr> Exp3d(nfields3d);\n    MultiRegions::ExpList3DHomogeneous1DSharedPtr Exp3DH1;\n    \/\/ Define Homogeneous expansion\n    int nplanes; \n    \/\/vSession3d->LoadParameter(\"HomModesZ\",nplanes,field3ddef[0]->m_numModes[2]);\n    nplanes = field3ddef[0]->m_numModes[2];\n    cout<< nplanes << endl;\n    \/\/ nplanes + 1 points\n    const LibUtilities::PointsKey Pkey(nplanes,LibUtilities::ePolyEvenlySpaced);\n    const LibUtilities::BasisKey  Bkey(field3ddef[0]->m_basis[2],nplanes,Pkey);\n    NekDouble lz = field3ddef[0]->m_homogeneousLengths[0];\n    Exp3DH1 = MemoryManager<MultiRegions::ExpList3DHomogeneous1D>::AllocateSharedPtr(vSession3d,Bkey,lz,useFFT,dealiasing,graphShPt3d);\n    Exp3d[0] = Exp3DH1;\n    for(j = 1; j < nfields3d; ++j)\n    {\t\n          Exp3d[j] = MemoryManager<MultiRegions::ExpList3DHomogeneous1D>::AllocateSharedPtr(*Exp3DH1);\n    }\n    \n    k=0;\n    for(j = 0; j < nfields2d; ++j)\n    {\t\n        if (j< nfields2d-1)\n        {\n       \t\tfor(int i = 0; i < field2ddata.size(); ++i)\n       \t\t{\n                   Exp2d[j]->ExtractDataToCoeffs(\n                                                field2ddef[i],\n\t\t                                field2ddata[i],\n\t\t                                field2ddef[i]->m_fields[j],\n\t\t                                Exp3d[j]->GetPlane(k)->UpdateCoeffs());            \n        \t}\n        }\n        if (j==nfields2d-1)\n        {\n\t\tfor(int i = 0; i < field2ddata.size(); ++i)\n                {\n                   Exp2d[j]->ExtractDataToCoeffs(\n                                                field2ddef[i],\n                                                field2ddata[i],\n                                                field2ddef[i]->m_fields[j],\n                                                Exp3d[j+1]->GetPlane(k)->UpdateCoeffs());\n                }\n        }\n    }\n    Array<OneD, Array<OneD, NekDouble> > fieldcoeffs(vSession3d->GetVariables().size());\n    for(j = 0; j < fieldcoeffs.num_elements(); ++j)\n    {\n        fieldcoeffs[j] = Exp3d[j]->UpdateCoeffs();\n        for(int i = 0; i < field3ddef.size(); ++i)\n    \t{\n          Exp3d[0]->AppendFieldData(field3ddef[i], field3ddatanew[i],fieldcoeffs[j]);\n    \t}\n    }\n    LibUtilities::Write(datasave,field3ddef,field3ddatanew);\n    return 0;\n}\n\/\/ Only for 2d to 2d5 Hui Xu 23 Aug 2013\n<|endoftext|>"}
{"text":"<commit_before>\/*=====================================================================\nQGroundControl Open Source Ground Control Station\n\n(c) 2009, 2010 QGROUNDCONTROL PROJECT <http:\/\/www.qgroundcontrol.org>\n\nThis file is part of the QGROUNDCONTROL project\n\n    QGROUNDCONTROL 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    QGROUNDCONTROL is distributed in the hope that it 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 QGROUNDCONTROL. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n======================================================================*\/\n\n\/**\n * @file\n *   @brief Implementation of class MainWindow\n *   @author Your Name here\n *\/\n\n#include \"ArduPilotMegaMAV.h\"\n#include \"QsLog.h\"\n#include \"GAudioOutput.h\"\n\n#ifndef MAVLINK_MSG_ID_MOUNT_CONFIGURE\n#include \"ardupilotmega\/mavlink_msg_mount_configure.h\"\n#endif\n\n#ifndef MAVLINK_MSG_ID_MOUNT_CONTROL\n#include \"ardupilotmega\/mavlink_msg_mount_control.h\"\n#endif\n\n#include <QString>\n#include <QDir>\n#include <QDesktopServices>\n\nCustomMode::CustomMode()\n{\n}\n\nCustomMode::CustomMode(int aMode)\n{\n    m_mode = aMode;\n}\n\nint CustomMode::modeAsInt()\n{\n    return m_mode;\n}\n\nQString CustomMode::operator <<(int aMode)\n{\n    return QString::number(aMode);\n}\n\n\nApmPlane::ApmPlane(planeMode aMode)\n{\n    CustomMode(static_cast<int>(aMode));\n}\n\nApmPlane::planeMode ApmPlane::mode()\n{\n    return static_cast<ApmPlane::planeMode>(m_mode);\n}\n\nQString ApmPlane::stringForMode(int aMode)\n{\n    switch(static_cast<planeMode>(aMode)) {\n    case MANUAL:\n        return \"Manual\";\n        break;\n    case CIRCLE:\n        return \"Circle\";\n        break;\n    case STABILIZE:\n        return \"Stabilize\";\n        break;\n    case TRAINING:\n        return \"Training\";\n        break;\n    case FLY_BY_WIRE_A:\n        return \"Fly-By-Wire B\";\n        break;\n    case FLY_BY_WIRE_B:\n        return \"Fly-By-Wire B\";\n        break;\n    case AUTO:\n        return \"Auto\";\n        break;\n    case RTL:\n        return \"Return to Launch\";\n        break;\n    case LOITER:\n        return \"Loiter\";\n        break;\n    case GUIDED:\n        return \"Guided\";\n        break;\n    case INITIALIZING:\n        return \"Initializing\";\n        break;\n    default:\n        return \"Undefined\";\n    }\n}\n\nApmCopter::ApmCopter(copterMode aMode)\n{\n     CustomMode(static_cast<int>(aMode));\n}\n\nApmCopter::copterMode ApmCopter::mode()\n{\n    return static_cast<ApmCopter::copterMode>(m_mode);\n}\n\nQString ApmCopter::stringForMode(int aMode) {\n    switch(static_cast<copterMode>(aMode)) {\n    case STABILIZE:\n        return \"Stabilize\";\n        break;\n    case ACRO:\n        return \"Acro\";\n        break;\n    case ALT_HOLD:\n        return \"Altitude Hold\";\n        break;\n    case AUTO:\n        return \"Auto\";\n        break;\n    case GUIDED:\n        return \"Guided\";\n        break;\n    case LOITER:\n        return \"Loiter\";\n        break;\n    case RTL:\n        return \"Return to Launch\";\n        break;\n    case CIRCLE:\n        return \"Circle\";\n        break;\n    case POSITION:\n        return \"Position\";\n        break;\n    case LAND:\n        return \"Land\";\n        break;\n    case OF_LOITER:\n        return \"OF Loiter\";\n        break;\n    case TOY_A:\n        return \"Toy A\";\n        break;\n    case TOY_M:\n        return \"Toy M\";\n        break;\n    case SPORT:\n        return \"Sport\";\n        break;\n    default:\n        return \"Undefined\";\n    }\n}\n\nApmRover::ApmRover(roverMode aMode)\n{\n     CustomMode(static_cast<int>(aMode));\n}\n\nApmRover::roverMode ApmRover::mode()\n{\n    return static_cast<ApmRover::roverMode>(m_mode);\n}\n\nQString ApmRover::stringForMode(int aMode) {\n    switch(static_cast<roverMode>(aMode)) {\n    case MANUAL:\n        return \"Manual\";\n        break;\n    case LEARNING:\n        return \"Learning\";\n        break;\n    case STEERING:\n        return \"Steering\";\n        break;\n    case HOLD:\n        return \"Hold\";\n        break;\n    case AUTO:\n        return \"Auto\";\n        break;\n    case RTL:\n        return \"Return to Launch\";\n        break;\n    case GUIDED:\n        return \"Guided\";\n        break;\n    case INITIALIZING:\n        return \"Initializing\";\n        break;\n    default:\n        return \"Undefined\";\n    }\n}\n\n\n\nArduPilotMegaMAV::ArduPilotMegaMAV(MAVLinkProtocol* mavlink, int id) :\n    UAS(mavlink, id)\/\/,\n    \/\/ place other initializers here\n{\n    \/\/This does not seem to work. Manually request each stream type at a specified rate.\n    \/\/ Ask for all streams at 4 Hz\n    \/\/enableAllDataTransmission(4);\n    txReqTimer = new QTimer(this);\n    connect(txReqTimer,SIGNAL(timeout()),this,SLOT(RequestAllDataStreams()));\n\n    QTimer::singleShot(5000,this,SLOT(RequestAllDataStreams())); \/\/Send an initial TX request in 5 seconds.\n\n    txReqTimer->start(10000); \/\/Resend the TX requests every 10 seconds.\n\n    connect(this,SIGNAL(connected()),this,SLOT(uasConnected()));\n    connect(this,SIGNAL(disconnected()),this,SLOT(uasDisconnected()));\n\n    connect(this, SIGNAL(textMessageReceived(int,int,int,QString)),\n            this, SLOT(textMessageReceived(int,int,int,QString)));\n\n    connect(this, SIGNAL(heartbeatTimeout(bool,uint)),\n            this, SLOT(heartbeatTimeout(bool,uint)));\n}\n\nvoid ArduPilotMegaMAV::RequestAllDataStreams()\n{\n    QLOG_TRACE() << \"APM:RequestAllDataRates\";\n    enableExtendedSystemStatusTransmission(2);\n\n    enablePositionTransmission(3);\n\n    enableExtra1Transmission(10);\n\n    enableExtra2Transmission(10);\n\n    enableExtra3Transmission(2);\n\n    enableRawSensorDataTransmission(2);\n\n    enableRCChannelDataTransmission(2);\n}\n\nvoid ArduPilotMegaMAV::uasConnected()\n{\n    QLOG_INFO() << \"ArduPilotMegaMAV APM Connected\";\n    QTimer::singleShot(500,this,SLOT(RequestAllDataStreams())); \/\/Send an initial TX request in 0.5 seconds.\n    createNewMAVLinkLog(type);\n}\n\nvoid ArduPilotMegaMAV::uasDisconnected()\n{\n    QLOG_INFO() << \"ArduPilotMegaMAV APM disconnected\";\n    mavlink->stopLogging();\n}\n\nvoid ArduPilotMegaMAV::createNewMAVLinkLog(uint8_t type)\n{\n    QString subDir;\n\n    \/\/ This creates a log in subdir based on the vehicle\n    \/\/ first detected. When connecting to multiple vehicles\n    \/\/ it will not log message based on each specific.\n    switch(type) {\n    case MAV_TYPE_TRICOPTER:\n        subDir = \"\/tricopter\/\";\n        break;\n\n    case MAV_TYPE_QUADROTOR:\n        subDir = \"\/quadcopter\/\";\n        break;\n\n    case MAV_TYPE_HEXAROTOR:\n        subDir = \"\/hexcopter\/\";\n        break;\n\n    case MAV_TYPE_OCTOROTOR:\n        subDir = \"\/octocopter\/\";\n        break;\n\n    case MAV_TYPE_GROUND_ROVER:\n        subDir = \"\/rover\/\";\n        break;\n\n    case MAV_TYPE_HELICOPTER:\n        subDir = \"\/helicopter\/\";\n        break;\n\n    case MAV_TYPE_FIXED_WING:\n        subDir = \"\/plane\/\";\n        break;\n\n    default:\n        subDir = \"\/\";\n    }\n\n    QString logFileName =  QGC::MAVLinkLogDirectory() + QGC::fileNameAsTime();\n    QLOG_DEBUG() << \"start new MAVLink Log:\" << logFileName;\n    mavlink->startLogging(logFileName);\n}\n\n\/**\n * This function is called by MAVLink once a complete, uncorrupted (CRC check valid)\n * mavlink packet is received.\n *\n * @param link Hardware link the message came from (e.g. \/dev\/ttyUSB0 or UDP port).\n *             messages can be sent back to the system via this link\n * @param message MAVLink message, as received from the MAVLink protocol stack\n *\/\nvoid ArduPilotMegaMAV::receiveMessage(LinkInterface* link, mavlink_message_t message)\n{\n    \/\/ Let UAS handle the default message set\n    UAS::receiveMessage(link, message);\n\n    if (message.sysid == uasId) {\n        \/\/ Handle your special messages\n        switch (message.msgid) {\n        case MAVLINK_MSG_ID_HEARTBEAT:\n        {\n            \/\/QLOG_DEBUG() << \"ARDUPILOT RECEIVED HEARTBEAT\";\n            break;\n        }\n        default:\n            \/\/QLOG_DEBUG() << \"\\nARDUPILOT RECEIVED MESSAGE WITH ID\" << message.msgid;\n            break;\n        }\n    }\n}\nvoid ArduPilotMegaMAV::setMountConfigure(unsigned char mode, bool stabilize_roll,bool stabilize_pitch,bool stabilize_yaw)\n{\n    \/\/Only supported by APM\n    mavlink_message_t msg;\n    mavlink_msg_mount_configure_pack(255,1,&msg,this->uasId,1,mode,stabilize_roll,stabilize_pitch,stabilize_yaw);\n    sendMessage(msg);\n}\nvoid ArduPilotMegaMAV::setMountControl(double pa,double pb,double pc,bool islatlong)\n{\n    mavlink_message_t msg;\n    if (islatlong)\n    {\n        mavlink_msg_mount_control_pack(255,1,&msg,this->uasId,1,pa*10000000.0,pb*10000000.0,pc*10000000.0,0);\n    }\n    else\n    {\n        mavlink_msg_mount_control_pack(255,1,&msg,this->uasId,1,pa,pb,pc,0);\n    }\n    sendMessage(msg);\n}\n\nvoid ArduPilotMegaMAV::armSystem()\n{\n    QLOG_INFO() << \"APM ARM System\";\n    mavlink_message_t msg;\n    mavlink_msg_command_long_pack(mavlink->getSystemId(),\n                                  mavlink->getComponentId(),\n                                  &msg,\n                                  getUASID(),                    \/\/ uint8_t target_system,\n                                  MAV_COMP_ID_SYSTEM_CONTROL,    \/\/ uint8_t target_component\n                                  MAV_CMD_COMPONENT_ARM_DISARM,    \/\/ uint16_t command,\n                                  1,                \/\/ uint8_t confirmation,\n                                  1.0,             \/\/ float param1,\n                                  0,                \/\/ float param2,\n                                  0,                \/\/ float param3,\n                                  0,                \/\/ float param4,\n                                  0,                \/\/ float param5,\n                                  0,                \/\/ float param6,\n                                  0                 \/\/ float param7)\n                                  );\n    sendMessage(msg);\n}\n\nvoid ArduPilotMegaMAV::disarmSystem()\n{\n    QLOG_INFO() << \"APM DISARM System\";\n    mavlink_message_t msg;\n    mavlink_msg_command_long_pack(mavlink->getSystemId(),\n                                  mavlink->getComponentId(),\n                                  &msg,\n                                  getUASID(),                    \/\/ uint8_t target_system,\n                                  MAV_COMP_ID_SYSTEM_CONTROL,    \/\/ uint8_t target_component\n                                  MAV_CMD_COMPONENT_ARM_DISARM,    \/\/ uint16_t command,\n                                  1,                \/\/ uint8_t confirmation,\n                                  0.0,             \/\/ float param1,\n                                  0,                \/\/ float param2,\n                                  0,                \/\/ float param3,\n                                  0,                \/\/ float param4,\n                                  0,                \/\/ float param5,\n                                  0,                \/\/ float param6,\n                                  0                 \/\/ float param7)\n                                  );\n    sendMessage(msg);\n}\n\nQString ArduPilotMegaMAV::getCustomModeText()\n{\n    QLOG_DEBUG() << \"APM: getCustomModeText()\";\n    QString customModeString;\n\n    int systemType = getSystemType();\n            switch(systemType) {\n        case MAV_TYPE_FIXED_WING:\n            customModeString = ApmPlane::stringForMode(custom_mode);\n            break;\n\n        case MAV_TYPE_QUADROTOR:\n        case MAV_TYPE_OCTOROTOR:\n        case MAV_TYPE_HELICOPTER:\n        case MAV_TYPE_TRICOPTER:\n            customModeString = ApmCopter::stringForMode(custom_mode);\n            break;\n\n        case MAV_TYPE_GROUND_ROVER:\n            customModeString = ApmCopter::stringForMode(custom_mode);\n            break;\n\n        default:\n            QLOG_WARN() << \"APM: Unsupported System Type \" << systemType;\n            customModeString = tr(\"APM UNKOWN\");\n        }\n    return customModeString;\n}\n\nQString ArduPilotMegaMAV::getCustomModeAudioText()\n{\n    QLOG_DEBUG() << \"APM: getCustomModeAudioText()\";\n\n    QString returnString = tr(\"and mode is \");\n    return returnString + getCustomModeText();\n}\n\nvoid ArduPilotMegaMAV::textMessageReceived(int \/*uasid*\/, int \/*componentid*\/, int severity, QString text)\n{\n    QLOG_DEBUG() << \"APM: Text Message rx'd\" << text;\n    if (text.startsWith(\"PreArm:\")) {\n        \/\/ Speak the PreArm warning\n        QString audioString = \"Pre-arm check:\" + text.remove(\"PreArm:\");\n        GAudioOutput::instance()->say(audioString, severity);\n    } else if (text.startsWith(\"Arm:\")){\n        QString audioString = \"Please press and hold safety switch\";\n        GAudioOutput::instance()->say(audioString, severity);\n    }\n}\n\nvoid ArduPilotMegaMAV::heartbeatTimeout(bool timeout, unsigned int \/*ms*\/)\n{\n    if(timeout == false) {\n        QLOG_DEBUG() << \"Send requestall data streams when heartbeat restarts\";\n        \/\/ Request data, as this means we have reconnected\n        \/\/ Send an request in .5 seconds.\n        QTimer::singleShot(500,this,SLOT(RequestAllDataStreams()));\n    }\n}\n\nvoid ArduPilotMegaMAV::playCustomModeChangedAudioMessage()\n{\n    QString phrase;\n\n    phrase = \"Mode changed to \" + getCustomModeText() + \" for system \" + QString::number(getUASID());\n    QLOG_DEBUG() << \"APM say:\" << phrase;\n    GAudioOutput::instance()->say(phrase.toLower());\n}\n\nvoid ArduPilotMegaMAV::playArmStateChangedAudioMessage(bool armedState)\n{\n    QString armedPhrase(\"disarmed\");\n\n    if (armedState){\n        armedPhrase = \"armed\";\n    }\n\n    QLOG_DEBUG() << \"APM say:\" << armedPhrase;\n    GAudioOutput::instance()->say(QString(\"system %1 is %2\").arg(QString::number(getUASID()),armedPhrase));\n}\n\n<commit_msg>Typo for Fly-By-Wire A reported as B for APM:Plane<commit_after>\/*=====================================================================\nQGroundControl Open Source Ground Control Station\n\n(c) 2009, 2010 QGROUNDCONTROL PROJECT <http:\/\/www.qgroundcontrol.org>\n\nThis file is part of the QGROUNDCONTROL project\n\n    QGROUNDCONTROL 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    QGROUNDCONTROL is distributed in the hope that it 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 QGROUNDCONTROL. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n======================================================================*\/\n\n\/**\n * @file\n *   @brief Implementation of class MainWindow\n *   @author Your Name here\n *\/\n\n#include \"ArduPilotMegaMAV.h\"\n#include \"QsLog.h\"\n#include \"GAudioOutput.h\"\n\n#ifndef MAVLINK_MSG_ID_MOUNT_CONFIGURE\n#include \"ardupilotmega\/mavlink_msg_mount_configure.h\"\n#endif\n\n#ifndef MAVLINK_MSG_ID_MOUNT_CONTROL\n#include \"ardupilotmega\/mavlink_msg_mount_control.h\"\n#endif\n\n#include <QString>\n#include <QDir>\n#include <QDesktopServices>\n\nCustomMode::CustomMode()\n{\n}\n\nCustomMode::CustomMode(int aMode)\n{\n    m_mode = aMode;\n}\n\nint CustomMode::modeAsInt()\n{\n    return m_mode;\n}\n\nQString CustomMode::operator <<(int aMode)\n{\n    return QString::number(aMode);\n}\n\n\nApmPlane::ApmPlane(planeMode aMode)\n{\n    CustomMode(static_cast<int>(aMode));\n}\n\nApmPlane::planeMode ApmPlane::mode()\n{\n    return static_cast<ApmPlane::planeMode>(m_mode);\n}\n\nQString ApmPlane::stringForMode(int aMode)\n{\n    switch(static_cast<planeMode>(aMode)) {\n    case MANUAL:\n        return \"Manual\";\n        break;\n    case CIRCLE:\n        return \"Circle\";\n        break;\n    case STABILIZE:\n        return \"Stabilize\";\n        break;\n    case TRAINING:\n        return \"Training\";\n        break;\n    case FLY_BY_WIRE_A:\n        return \"Fly-By-Wire A\";\n        break;\n    case FLY_BY_WIRE_B:\n        return \"Fly-By-Wire B\";\n        break;\n    case AUTO:\n        return \"Auto\";\n        break;\n    case RTL:\n        return \"Return to Launch\";\n        break;\n    case LOITER:\n        return \"Loiter\";\n        break;\n    case GUIDED:\n        return \"Guided\";\n        break;\n    case INITIALIZING:\n        return \"Initializing\";\n        break;\n    default:\n        return \"Undefined\";\n    }\n}\n\nApmCopter::ApmCopter(copterMode aMode)\n{\n     CustomMode(static_cast<int>(aMode));\n}\n\nApmCopter::copterMode ApmCopter::mode()\n{\n    return static_cast<ApmCopter::copterMode>(m_mode);\n}\n\nQString ApmCopter::stringForMode(int aMode) {\n    switch(static_cast<copterMode>(aMode)) {\n    case STABILIZE:\n        return \"Stabilize\";\n        break;\n    case ACRO:\n        return \"Acro\";\n        break;\n    case ALT_HOLD:\n        return \"Altitude Hold\";\n        break;\n    case AUTO:\n        return \"Auto\";\n        break;\n    case GUIDED:\n        return \"Guided\";\n        break;\n    case LOITER:\n        return \"Loiter\";\n        break;\n    case RTL:\n        return \"Return to Launch\";\n        break;\n    case CIRCLE:\n        return \"Circle\";\n        break;\n    case POSITION:\n        return \"Position\";\n        break;\n    case LAND:\n        return \"Land\";\n        break;\n    case OF_LOITER:\n        return \"OF Loiter\";\n        break;\n    case TOY_A:\n        return \"Toy A\";\n        break;\n    case TOY_M:\n        return \"Toy M\";\n        break;\n    case SPORT:\n        return \"Sport\";\n        break;\n    default:\n        return \"Undefined\";\n    }\n}\n\nApmRover::ApmRover(roverMode aMode)\n{\n     CustomMode(static_cast<int>(aMode));\n}\n\nApmRover::roverMode ApmRover::mode()\n{\n    return static_cast<ApmRover::roverMode>(m_mode);\n}\n\nQString ApmRover::stringForMode(int aMode) {\n    switch(static_cast<roverMode>(aMode)) {\n    case MANUAL:\n        return \"Manual\";\n        break;\n    case LEARNING:\n        return \"Learning\";\n        break;\n    case STEERING:\n        return \"Steering\";\n        break;\n    case HOLD:\n        return \"Hold\";\n        break;\n    case AUTO:\n        return \"Auto\";\n        break;\n    case RTL:\n        return \"Return to Launch\";\n        break;\n    case GUIDED:\n        return \"Guided\";\n        break;\n    case INITIALIZING:\n        return \"Initializing\";\n        break;\n    default:\n        return \"Undefined\";\n    }\n}\n\n\n\nArduPilotMegaMAV::ArduPilotMegaMAV(MAVLinkProtocol* mavlink, int id) :\n    UAS(mavlink, id)\/\/,\n    \/\/ place other initializers here\n{\n    \/\/This does not seem to work. Manually request each stream type at a specified rate.\n    \/\/ Ask for all streams at 4 Hz\n    \/\/enableAllDataTransmission(4);\n    txReqTimer = new QTimer(this);\n    connect(txReqTimer,SIGNAL(timeout()),this,SLOT(RequestAllDataStreams()));\n\n    QTimer::singleShot(5000,this,SLOT(RequestAllDataStreams())); \/\/Send an initial TX request in 5 seconds.\n\n    txReqTimer->start(10000); \/\/Resend the TX requests every 10 seconds.\n\n    connect(this,SIGNAL(connected()),this,SLOT(uasConnected()));\n    connect(this,SIGNAL(disconnected()),this,SLOT(uasDisconnected()));\n\n    connect(this, SIGNAL(textMessageReceived(int,int,int,QString)),\n            this, SLOT(textMessageReceived(int,int,int,QString)));\n\n    connect(this, SIGNAL(heartbeatTimeout(bool,uint)),\n            this, SLOT(heartbeatTimeout(bool,uint)));\n}\n\nvoid ArduPilotMegaMAV::RequestAllDataStreams()\n{\n    QLOG_TRACE() << \"APM:RequestAllDataRates\";\n    enableExtendedSystemStatusTransmission(2);\n\n    enablePositionTransmission(3);\n\n    enableExtra1Transmission(10);\n\n    enableExtra2Transmission(10);\n\n    enableExtra3Transmission(2);\n\n    enableRawSensorDataTransmission(2);\n\n    enableRCChannelDataTransmission(2);\n}\n\nvoid ArduPilotMegaMAV::uasConnected()\n{\n    QLOG_INFO() << \"ArduPilotMegaMAV APM Connected\";\n    QTimer::singleShot(500,this,SLOT(RequestAllDataStreams())); \/\/Send an initial TX request in 0.5 seconds.\n    createNewMAVLinkLog(type);\n}\n\nvoid ArduPilotMegaMAV::uasDisconnected()\n{\n    QLOG_INFO() << \"ArduPilotMegaMAV APM disconnected\";\n    mavlink->stopLogging();\n}\n\nvoid ArduPilotMegaMAV::createNewMAVLinkLog(uint8_t type)\n{\n    QString subDir;\n\n    \/\/ This creates a log in subdir based on the vehicle\n    \/\/ first detected. When connecting to multiple vehicles\n    \/\/ it will not log message based on each specific.\n    switch(type) {\n    case MAV_TYPE_TRICOPTER:\n        subDir = \"\/tricopter\/\";\n        break;\n\n    case MAV_TYPE_QUADROTOR:\n        subDir = \"\/quadcopter\/\";\n        break;\n\n    case MAV_TYPE_HEXAROTOR:\n        subDir = \"\/hexcopter\/\";\n        break;\n\n    case MAV_TYPE_OCTOROTOR:\n        subDir = \"\/octocopter\/\";\n        break;\n\n    case MAV_TYPE_GROUND_ROVER:\n        subDir = \"\/rover\/\";\n        break;\n\n    case MAV_TYPE_HELICOPTER:\n        subDir = \"\/helicopter\/\";\n        break;\n\n    case MAV_TYPE_FIXED_WING:\n        subDir = \"\/plane\/\";\n        break;\n\n    default:\n        subDir = \"\/\";\n    }\n\n    QString logFileName =  QGC::MAVLinkLogDirectory() + QGC::fileNameAsTime();\n    QLOG_DEBUG() << \"start new MAVLink Log:\" << logFileName;\n    mavlink->startLogging(logFileName);\n}\n\n\/**\n * This function is called by MAVLink once a complete, uncorrupted (CRC check valid)\n * mavlink packet is received.\n *\n * @param link Hardware link the message came from (e.g. \/dev\/ttyUSB0 or UDP port).\n *             messages can be sent back to the system via this link\n * @param message MAVLink message, as received from the MAVLink protocol stack\n *\/\nvoid ArduPilotMegaMAV::receiveMessage(LinkInterface* link, mavlink_message_t message)\n{\n    \/\/ Let UAS handle the default message set\n    UAS::receiveMessage(link, message);\n\n    if (message.sysid == uasId) {\n        \/\/ Handle your special messages\n        switch (message.msgid) {\n        case MAVLINK_MSG_ID_HEARTBEAT:\n        {\n            \/\/QLOG_DEBUG() << \"ARDUPILOT RECEIVED HEARTBEAT\";\n            break;\n        }\n        default:\n            \/\/QLOG_DEBUG() << \"\\nARDUPILOT RECEIVED MESSAGE WITH ID\" << message.msgid;\n            break;\n        }\n    }\n}\nvoid ArduPilotMegaMAV::setMountConfigure(unsigned char mode, bool stabilize_roll,bool stabilize_pitch,bool stabilize_yaw)\n{\n    \/\/Only supported by APM\n    mavlink_message_t msg;\n    mavlink_msg_mount_configure_pack(255,1,&msg,this->uasId,1,mode,stabilize_roll,stabilize_pitch,stabilize_yaw);\n    sendMessage(msg);\n}\nvoid ArduPilotMegaMAV::setMountControl(double pa,double pb,double pc,bool islatlong)\n{\n    mavlink_message_t msg;\n    if (islatlong)\n    {\n        mavlink_msg_mount_control_pack(255,1,&msg,this->uasId,1,pa*10000000.0,pb*10000000.0,pc*10000000.0,0);\n    }\n    else\n    {\n        mavlink_msg_mount_control_pack(255,1,&msg,this->uasId,1,pa,pb,pc,0);\n    }\n    sendMessage(msg);\n}\n\nvoid ArduPilotMegaMAV::armSystem()\n{\n    QLOG_INFO() << \"APM ARM System\";\n    mavlink_message_t msg;\n    mavlink_msg_command_long_pack(mavlink->getSystemId(),\n                                  mavlink->getComponentId(),\n                                  &msg,\n                                  getUASID(),                    \/\/ uint8_t target_system,\n                                  MAV_COMP_ID_SYSTEM_CONTROL,    \/\/ uint8_t target_component\n                                  MAV_CMD_COMPONENT_ARM_DISARM,    \/\/ uint16_t command,\n                                  1,                \/\/ uint8_t confirmation,\n                                  1.0,             \/\/ float param1,\n                                  0,                \/\/ float param2,\n                                  0,                \/\/ float param3,\n                                  0,                \/\/ float param4,\n                                  0,                \/\/ float param5,\n                                  0,                \/\/ float param6,\n                                  0                 \/\/ float param7)\n                                  );\n    sendMessage(msg);\n}\n\nvoid ArduPilotMegaMAV::disarmSystem()\n{\n    QLOG_INFO() << \"APM DISARM System\";\n    mavlink_message_t msg;\n    mavlink_msg_command_long_pack(mavlink->getSystemId(),\n                                  mavlink->getComponentId(),\n                                  &msg,\n                                  getUASID(),                    \/\/ uint8_t target_system,\n                                  MAV_COMP_ID_SYSTEM_CONTROL,    \/\/ uint8_t target_component\n                                  MAV_CMD_COMPONENT_ARM_DISARM,    \/\/ uint16_t command,\n                                  1,                \/\/ uint8_t confirmation,\n                                  0.0,             \/\/ float param1,\n                                  0,                \/\/ float param2,\n                                  0,                \/\/ float param3,\n                                  0,                \/\/ float param4,\n                                  0,                \/\/ float param5,\n                                  0,                \/\/ float param6,\n                                  0                 \/\/ float param7)\n                                  );\n    sendMessage(msg);\n}\n\nQString ArduPilotMegaMAV::getCustomModeText()\n{\n    QLOG_DEBUG() << \"APM: getCustomModeText()\";\n    QString customModeString;\n\n    int systemType = getSystemType();\n            switch(systemType) {\n        case MAV_TYPE_FIXED_WING:\n            customModeString = ApmPlane::stringForMode(custom_mode);\n            break;\n\n        case MAV_TYPE_QUADROTOR:\n        case MAV_TYPE_OCTOROTOR:\n        case MAV_TYPE_HELICOPTER:\n        case MAV_TYPE_TRICOPTER:\n            customModeString = ApmCopter::stringForMode(custom_mode);\n            break;\n\n        case MAV_TYPE_GROUND_ROVER:\n            customModeString = ApmCopter::stringForMode(custom_mode);\n            break;\n\n        default:\n            QLOG_WARN() << \"APM: Unsupported System Type \" << systemType;\n            customModeString = tr(\"APM UNKOWN\");\n        }\n    return customModeString;\n}\n\nQString ArduPilotMegaMAV::getCustomModeAudioText()\n{\n    QLOG_DEBUG() << \"APM: getCustomModeAudioText()\";\n\n    QString returnString = tr(\"and mode is \");\n    return returnString + getCustomModeText();\n}\n\nvoid ArduPilotMegaMAV::textMessageReceived(int \/*uasid*\/, int \/*componentid*\/, int severity, QString text)\n{\n    QLOG_DEBUG() << \"APM: Text Message rx'd\" << text;\n    if (text.startsWith(\"PreArm:\")) {\n        \/\/ Speak the PreArm warning\n        QString audioString = \"Pre-arm check:\" + text.remove(\"PreArm:\");\n        GAudioOutput::instance()->say(audioString, severity);\n    } else if (text.startsWith(\"Arm:\")){\n        QString audioString = \"Please press and hold safety switch\";\n        GAudioOutput::instance()->say(audioString, severity);\n    }\n}\n\nvoid ArduPilotMegaMAV::heartbeatTimeout(bool timeout, unsigned int \/*ms*\/)\n{\n    if(timeout == false) {\n        QLOG_DEBUG() << \"Send requestall data streams when heartbeat restarts\";\n        \/\/ Request data, as this means we have reconnected\n        \/\/ Send an request in .5 seconds.\n        QTimer::singleShot(500,this,SLOT(RequestAllDataStreams()));\n    }\n}\n\nvoid ArduPilotMegaMAV::playCustomModeChangedAudioMessage()\n{\n    QString phrase;\n\n    phrase = \"Mode changed to \" + getCustomModeText() + \" for system \" + QString::number(getUASID());\n    QLOG_DEBUG() << \"APM say:\" << phrase;\n    GAudioOutput::instance()->say(phrase.toLower());\n}\n\nvoid ArduPilotMegaMAV::playArmStateChangedAudioMessage(bool armedState)\n{\n    QString armedPhrase(\"disarmed\");\n\n    if (armedState){\n        armedPhrase = \"armed\";\n    }\n\n    QLOG_DEBUG() << \"APM say:\" << armedPhrase;\n    GAudioOutput::instance()->say(QString(\"system %1 is %2\").arg(QString::number(getUASID()),armedPhrase));\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"vtrc-rpc-channel-c.h\"\n\n#include \"google\/protobuf\/service.h\"\n#include \"google\/protobuf\/descriptor.h\"\n\n#include \"protocol\/vtrc-rpc-lowlevel.pb.h\"\n#include \"protocol\/vtrc-rpc-options.pb.h\"\n\n#include \"vtrc-common\/vtrc-connection-iface.h\"\n#include \"vtrc-common\/vtrc-call-context.h\"\n#include \"vtrc-common\/vtrc-protocol-layer.h\"\n#include \"vtrc-common\/vtrc-exception.h\"\n#include \"vtrc-common\/vtrc-closure-holder.h\"\n\n#include \"vtrc-chrono.h\"\n\nnamespace vtrc { namespace client {\n\n    namespace gpb = google::protobuf;\n\n    namespace {\n        typedef vtrc::shared_ptr <\n            vtrc_rpc::lowlevel_unit\n        > lowlevel_unit_sptr;\n        typedef vtrc_rpc::message_info message_info;\n\n        const unsigned direct_call_type = message_info::MESSAGE_CALL;\n        const unsigned callback_type    = message_info::MESSAGE_INSERTION_CALL;\n\n    }\n\n    struct rpc_channel_c::impl {\n\n        vtrc::weak_ptr<common::connection_iface> connection_;\n\n        rpc_channel_c *parent_;\n        const unsigned mess_type_;\n        const bool     disable_wait_;\n\n        impl(vtrc::shared_ptr<common::connection_iface> c,\n                              common::rpc_channel::options opts)\n            :connection_(c)\n            ,mess_type_(select_message_type(opts))\n            ,disable_wait_(select_message_wait(opts))\n        { }\n\n        unsigned select_message_type (common::rpc_channel::options opts) const\n        {\n            return (opts & common::rpc_channel::USE_CONTEXT_CALL)\n                   ? message_info::MESSAGE_INSERTION_CALL\n                   : message_info::MESSAGE_CALL;\n        }\n\n        bool select_message_wait (common::rpc_channel::options opts) const\n        {\n            return (opts & common::rpc_channel::DISABLE_WAIT);\n        }\n\n        common::protocol_layer &get_protocol(common::connection_iface_sptr &clk)\n        {\n            return parent_->get_protocol( *clk );\n        }\n\n        void send_message( lowlevel_unit_type &llu,\n                     const gpb::MethodDescriptor *method,\n                           gpb::RpcController *controller,\n                     const gpb::Message *  \/*  request  *\/,\n                           gpb::Message *      response,\n                           gpb::Closure *      done   )\n        {\n            common::closure_holder done_holder(done);\n            common::connection_iface_sptr clk(connection_.lock( ));\n\n            if( clk.get( ) == NULL ) {\n                if( controller )\n                    controller->SetFailed( \"Connection lost\" );\n                throw vtrc::common::exception( vtrc_errors::ERR_CHANNEL,\n                                               \"Connection lost\");\n            }\n\n            const vtrc_rpc::options &call_opt\n                            ( get_protocol( clk ).get_method_options(method) );\n\n            if( disable_wait_ )\n                llu.mutable_opt( )->set_wait( false );\n            else {\n                llu.mutable_opt( )->set_wait( call_opt.wait( ) );\n                llu.mutable_opt( )->set_accept_callbacks\n                                               ( call_opt.accept_callbacks( ) );\n            }\n\n            parent_->configure_message_for( clk, llu );\n            uint64_t call_id = llu.id( );\n\n            if( llu.opt( ).wait( ) ) {  \/\/\/ WAITABLE CALL\n\n                rpc_channel::context_holder ch( &get_protocol( clk ), &llu );\n                ch.ctx_->set_call_options( call_opt );\n                ch.ctx_->set_done_closure( done );\n\n                parent_->process_waitable_call( call_id, llu, response,\n                                                clk, call_opt );\n\n            } else {                    \/\/\/ NOT WAITABLE CALL\n                get_protocol( clk ).call_rpc_method( llu );\n            }\n\n        }\n\n    };\n\n    rpc_channel_c::rpc_channel_c( common::connection_iface_sptr c )\n        :common::rpc_channel(direct_call_type, callback_type)\n        ,impl_(new impl(c, common::rpc_channel::DEFAULT))\n    {\n        impl_->parent_ = this;\n    }\n\n    rpc_channel_c::rpc_channel_c( common::connection_iface_sptr c,\n                                  common::rpc_channel::options opts )\n        :common::rpc_channel(direct_call_type, callback_type)\n        ,impl_(new impl(c, opts))\n    {\n        impl_->parent_ = this;\n    }\n\n    rpc_channel_c::~rpc_channel_c( )\n    {\n        delete impl_;\n    }\n\n    void rpc_channel_c::configure_message_for(common::connection_iface_sptr c,\n                            common::rpc_channel::lowlevel_unit_type &llu) const\n    {\n        configure_message( c, impl_->mess_type_, llu );\n    }\n\n    void rpc_channel_c::send_message( lowlevel_unit_type &llu,\n                                const gpb::MethodDescriptor *method,\n                                      gpb::RpcController *controller,\n                                const gpb::Message *request,\n                                      gpb::Message *response,\n                                      gpb::Closure *done)\n    {\n        impl_->send_message( llu, method, controller, request, response, done );\n    }\n\n}}\n<commit_msg>examples<commit_after>#include \"vtrc-rpc-channel-c.h\"\n\n#include \"google\/protobuf\/service.h\"\n#include \"google\/protobuf\/descriptor.h\"\n\n#include \"protocol\/vtrc-rpc-lowlevel.pb.h\"\n#include \"protocol\/vtrc-rpc-options.pb.h\"\n\n#include \"vtrc-common\/vtrc-connection-iface.h\"\n#include \"vtrc-common\/vtrc-call-context.h\"\n#include \"vtrc-common\/vtrc-protocol-layer.h\"\n#include \"vtrc-common\/vtrc-exception.h\"\n#include \"vtrc-common\/vtrc-closure-holder.h\"\n\n#include \"vtrc-chrono.h\"\n\nnamespace vtrc { namespace client {\n\n    namespace gpb = google::protobuf;\n\n    namespace {\n        typedef vtrc::shared_ptr <\n            vtrc_rpc::lowlevel_unit\n        > lowlevel_unit_sptr;\n        typedef vtrc_rpc::message_info message_info;\n\n        const unsigned direct_call_type = message_info::MESSAGE_CALL;\n        const unsigned callback_type    = message_info::MESSAGE_INSERTION_CALL;\n\n    }\n\n    struct rpc_channel_c::impl {\n\n        vtrc::weak_ptr<common::connection_iface> connection_;\n\n        rpc_channel_c *parent_;\n        const unsigned mess_type_;\n        const bool     disable_wait_;\n\n        impl(vtrc::shared_ptr<common::connection_iface> c,\n                              common::rpc_channel::options opts)\n            :connection_(c)\n            ,mess_type_(select_message_type(opts))\n            ,disable_wait_(select_message_wait(opts))\n        { }\n\n        unsigned select_message_type (common::rpc_channel::options opts) const\n        {\n            return (opts & common::rpc_channel::USE_CONTEXT_CALL)\n                   ? message_info::MESSAGE_INSERTION_CALL\n                   : message_info::MESSAGE_CALL;\n        }\n\n        bool select_message_wait (common::rpc_channel::options opts) const\n        {\n            return (opts & common::rpc_channel::DISABLE_WAIT);\n        }\n\n        common::protocol_layer &get_protocol(common::connection_iface_sptr &clk)\n        {\n            return parent_->get_protocol( *clk );\n        }\n\n        void send_message( lowlevel_unit_type &llu,\n                     const gpb::MethodDescriptor *method,\n                           gpb::RpcController    *controller,\n                     const gpb::Message          * \/*  request  *\/,\n                           gpb::Message          *response,\n                           gpb::Closure          *done   )\n        {\n            common::closure_holder done_holder(done);\n            common::connection_iface_sptr clk(connection_.lock( ));\n\n            if( clk.get( ) == NULL ) {\n                if( controller )\n                    controller->SetFailed( \"Connection lost\" );\n                throw vtrc::common::exception( vtrc_errors::ERR_CHANNEL,\n                                               \"Connection lost\");\n            }\n\n            const vtrc_rpc::options &call_opt\n                            ( get_protocol( clk ).get_method_options(method) );\n\n            if( disable_wait_ )\n                llu.mutable_opt( )->set_wait( false );\n            else {\n                llu.mutable_opt( )->set_wait( call_opt.wait( ) );\n                llu.mutable_opt( )->set_accept_callbacks\n                                               ( call_opt.accept_callbacks( ) );\n            }\n\n            parent_->configure_message_for( clk, llu );\n            uint64_t call_id = llu.id( );\n\n            if( llu.opt( ).wait( ) ) {  \/\/\/ WAITABLE CALL\n\n                rpc_channel::context_holder ch( &get_protocol( clk ), &llu );\n                ch.ctx_->set_call_options( call_opt );\n                ch.ctx_->set_done_closure( done );\n\n                parent_->process_waitable_call( call_id, llu, response,\n                                                clk, call_opt );\n\n            } else {                    \/\/\/ NOT WAITABLE CALL\n                get_protocol( clk ).call_rpc_method( llu );\n            }\n\n        }\n\n    };\n\n    rpc_channel_c::rpc_channel_c( common::connection_iface_sptr c )\n        :common::rpc_channel(direct_call_type, callback_type)\n        ,impl_(new impl(c, common::rpc_channel::DEFAULT))\n    {\n        impl_->parent_ = this;\n    }\n\n    rpc_channel_c::rpc_channel_c( common::connection_iface_sptr c,\n                                  common::rpc_channel::options opts )\n        :common::rpc_channel(direct_call_type, callback_type)\n        ,impl_(new impl(c, opts))\n    {\n        impl_->parent_ = this;\n    }\n\n    rpc_channel_c::~rpc_channel_c( )\n    {\n        delete impl_;\n    }\n\n    void rpc_channel_c::configure_message_for(common::connection_iface_sptr c,\n                            common::rpc_channel::lowlevel_unit_type &llu) const\n    {\n        configure_message( c, impl_->mess_type_, llu );\n    }\n\n    void rpc_channel_c::send_message( lowlevel_unit_type &llu,\n                                const gpb::MethodDescriptor *method,\n                                      gpb::RpcController *controller,\n                                const gpb::Message *request,\n                                      gpb::Message *response,\n                                      gpb::Closure *done)\n    {\n        impl_->send_message( llu, method, controller, request, response, done );\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 \"config.h\"\n\n#include \"base\/compiler_specific.h\"\n\nMSVC_PUSH_WARNING_LEVEL(0);\n#include \"ContextMenu.h\"\n#include \"Document.h\"\n#include \"DocumentLoader.h\"\n#include \"Editor.h\"\n#include \"EventHandler.h\"\n#include \"FrameLoader.h\"\n#include \"FrameView.h\"\n#include \"HitTestResult.h\"\n#include \"KURL.h\"\n#include \"Widget.h\"\nMSVC_POP_WARNING();\n#undef LOG\n\n#include \"webkit\/glue\/context_menu_client_impl.h\"\n\n#include \"base\/string_util.h\"\n#include \"webkit\/glue\/context_menu.h\"\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webdocumentloader_impl.h\"\n#include \"webkit\/glue\/webview_impl.h\"\n\n#include \"base\/word_iterator.h\"\n\nnamespace {\n\n\/\/ Helper function to determine whether text is a single word or a sentence.\nbool IsASingleWord(const std::wstring& text) {\n  WordIterator iter(text, WordIterator::BREAK_WORD);\n  int word_count = 0;\n  if (!iter.Init()) return false;\n  while (iter.Advance()) {\n    if (iter.IsWord()) {\n      word_count++;\n      if (word_count > 1) \/\/ More than one word.\n        return false;\n    }\n  }\n  \n  \/\/ Check for 0 words.\n  if (!word_count)\n    return false;\n  \n  \/\/ Has a single word.\n  return true;\n}\n\n\/\/ Helper function to get misspelled word on which context menu \n\/\/ is to be evolked. This function also sets the word on which context menu\n\/\/ has been evoked to be the selected word, as required.\nstd::wstring GetMisspelledWord(const WebCore::ContextMenu* default_menu,\n                               WebCore::Frame* selected_frame) {\n  std::wstring misspelled_word_string;\n\n  \/\/ First select from selectedText to check for multiple word selection.\n  misspelled_word_string = CollapseWhitespace(\n      webkit_glue::StringToStdWString(selected_frame->selectedText()),\n      false);\n\n  \/\/ Don't provide suggestions for multiple words.\n  if (!misspelled_word_string.empty() && \n      !IsASingleWord(misspelled_word_string))\n    return L\"\";\n\n  WebCore::HitTestResult hit_test_result = selected_frame->eventHandler()->\n      hitTestResultAtPoint(default_menu->hitTestResult().point(), true);\n  WebCore::Node* inner_node = hit_test_result.innerNode();\n  WebCore::VisiblePosition pos(inner_node->renderer()->positionForPoint(\n      hit_test_result.localPoint()));\n\n  WebCore::Selection selection;\n  if (pos.isNotNull()) {\n    selection = WebCore::Selection(pos);\n    selection.expandUsingGranularity(WebCore::WordGranularity);\n  }\n      \n  if (selection.isRange()) { \n    selected_frame->setSelectionGranularity(WebCore::WordGranularity);\n  }\n        \n  if (selected_frame->shouldChangeSelection(selection))\n    selected_frame->selection()->setSelection(selection);\n       \n  misspelled_word_string = CollapseWhitespace(\n      webkit_glue::StringToStdWString(selected_frame->selectedText()),                  \n                                      false);\n  \n  return misspelled_word_string;\n}\n\n}  \/\/ namespace\n\nContextMenuClientImpl::~ContextMenuClientImpl() {\n}\n\nvoid ContextMenuClientImpl::contextMenuDestroyed() {\n  delete this;\n}\n\n\/\/ Figure out the URL of a page or subframe. Returns |page_type| as the type,\n\/\/ which indicates page or subframe, or ContextNode::NONE if the URL could not\n\/\/ be determined for some reason.\nstatic ContextNode GetTypeAndURLFromFrame(WebCore::Frame* frame,\n                                          GURL* url,\n                                          ContextNode page_node) {\n  ContextNode node;\n  if (frame) {\n    WebCore::DocumentLoader* dl = frame->loader()->documentLoader();\n    if (dl) {\n      WebDataSource* ds = static_cast<WebDocumentLoaderImpl*>(dl)->\n          GetDataSource();\n      if (ds) {\n        node = page_node;\n        *url = ds->HasUnreachableURL() ? ds->GetUnreachableURL()\n                                       : ds->GetRequest().GetURL();\n      }\n    }\n  }\n  return node;\n}\n\nWebCore::PlatformMenuDescription\n    ContextMenuClientImpl::getCustomMenuFromDefaultItems(\n        WebCore::ContextMenu* default_menu) {\n  \/\/ Displaying the context menu in this function is a big hack as we don't\n  \/\/ have context, i.e. whether this is being invoked via a script or in \n  \/\/ response to user input (Mouse event WM_RBUTTONDOWN,\n  \/\/ Keyboard events KeyVK_APPS, Shift+F10). Check if this is being invoked\n  \/\/ in response to the above input events before popping up the context menu.\n  if (!webview_->context_menu_allowed())\n    return NULL;\n\n  WebCore::HitTestResult r = default_menu->hitTestResult();\n  WebCore::Frame* selected_frame = r.innerNonSharedNode()->document()->frame();\n\n  WebCore::IntPoint menu_point =\n      selected_frame->view()->contentsToWindow(r.point());\n\n  ContextNode node;\n\n  \/\/ Links, Images and Image-Links take preference over all else.\n  WebCore::KURL link_url = r.absoluteLinkURL();\n  if (!link_url.isEmpty()) {\n    node.type |= ContextNode::LINK;\n  }\n  WebCore::KURL image_url = r.absoluteImageURL();\n  if (!image_url.isEmpty()) {\n    node.type |= ContextNode::IMAGE;\n  }\n\n  \/\/ If it's not a link, an image or an image link, show a selection menu or a\n  \/\/ more generic page menu.\n  std::wstring selection_text_string;\n  std::wstring misspelled_word_string;\n  GURL frame_url;\n  GURL page_url;\n  std::string security_info;\n  \n  std::wstring frame_encoding;\n  \/\/ Send the frame and page URLs in any case.\n  ContextNode frame_node = ContextNode(ContextNode::NONE);\n  ContextNode page_node =\n      GetTypeAndURLFromFrame(webview_->main_frame()->frame(),\n                             &page_url,\n                             ContextNode(ContextNode::PAGE));\n  if (selected_frame != webview_->main_frame()->frame()) {\n    frame_node = GetTypeAndURLFromFrame(selected_frame,\n                                        &frame_url,\n                                        ContextNode(ContextNode::FRAME));\n    frame_encoding = webkit_glue::StringToStdWString(\n        selected_frame->loader()->encoding());\n  }\n\n  if (r.isSelected()) {\n    node.type |= ContextNode::SELECTION;\n    selection_text_string = CollapseWhitespace(\n      webkit_glue::StringToStdWString(selected_frame->selectedText()),\n      false);\n  }\n\n  if (r.isContentEditable()) {\n    node.type |= ContextNode::EDITABLE;\n    if (webview_->GetFocusedWebCoreFrame()->editor()->\n        isContinuousSpellCheckingEnabled()) {\n      misspelled_word_string = GetMisspelledWord(default_menu,\n                                                 selected_frame);\n    }\n  }\n  \n  if (node.type == ContextNode::NONE) {\n    if (selected_frame != webview_->main_frame()->frame()) {\n      node = frame_node;\n    } else {\n      node = page_node;\n    }\n  }\n\n  \/\/ Now retrieve the security info.\n  WebCore::DocumentLoader* dl = selected_frame->loader()->documentLoader();\n  if (dl) {\n    WebDataSource* ds = static_cast<WebDocumentLoaderImpl*>(dl)->\n        GetDataSource();\n    if (ds) {\n      const WebResponse& response = ds->GetResponse();\n      security_info = response.GetSecurityInfo();\n    }\n  }\n\n  int edit_flags = ContextNode::CAN_DO_NONE;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canUndo())\n    edit_flags |= ContextNode::CAN_UNDO;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canRedo())\n    edit_flags |= ContextNode::CAN_REDO;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canCut())\n    edit_flags |= ContextNode::CAN_CUT;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canCopy())\n    edit_flags |= ContextNode::CAN_COPY;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canPaste())\n    edit_flags |= ContextNode::CAN_PASTE;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canDelete())\n    edit_flags |= ContextNode::CAN_DELETE;\n  \/\/ We can always select all...\n  edit_flags |= ContextNode::CAN_SELECT_ALL;\n\n  WebViewDelegate* d = webview_->delegate();\n  if (d) {\n    d->ShowContextMenu(webview_,\n                       node,\n                       menu_point.x(),\n                       menu_point.y(),\n                       webkit_glue::KURLToGURL(link_url),\n                       webkit_glue::KURLToGURL(image_url),\n                       page_url,\n                       frame_url,\n                       selection_text_string,\n                       misspelled_word_string,\n                       edit_flags,\n                       security_info);\n  }\n  return NULL;\n}\n\nvoid ContextMenuClientImpl::contextMenuItemSelected(\n    WebCore::ContextMenuItem*, const WebCore::ContextMenu*) {\n}\n\nvoid ContextMenuClientImpl::downloadURL(const WebCore::KURL&) {\n}\n\nvoid ContextMenuClientImpl::copyImageToClipboard(const WebCore::HitTestResult&) {\n}\n\nvoid ContextMenuClientImpl::searchWithGoogle(const WebCore::Frame*) {\n}\n\nvoid ContextMenuClientImpl::lookUpInDictionary(WebCore::Frame*) {\n}\n\nvoid ContextMenuClientImpl::speak(const WebCore::String&) {\n}\n\nvoid ContextMenuClientImpl::stopSpeaking() {\n}\n\nbool ContextMenuClientImpl::shouldIncludeInspectElementItem() {\n    return false;  \/\/ TODO(jackson): Eventually include the inspector context menu item\n}\n\n#if defined(OS_MACOSX)\nvoid ContextMenuClientImpl::searchWithSpotlight() {\n  \/\/ TODO(pinkerton): write this\n}\n#endif\n<commit_msg>Fix bug where right click in a text area selects empty space.<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 \"config.h\"\n\n#include \"base\/compiler_specific.h\"\n\nMSVC_PUSH_WARNING_LEVEL(0);\n#include \"ContextMenu.h\"\n#include \"Document.h\"\n#include \"DocumentLoader.h\"\n#include \"Editor.h\"\n#include \"EventHandler.h\"\n#include \"FrameLoader.h\"\n#include \"FrameView.h\"\n#include \"HitTestResult.h\"\n#include \"KURL.h\"\n#include \"Widget.h\"\nMSVC_POP_WARNING();\n#undef LOG\n\n#include \"webkit\/glue\/context_menu_client_impl.h\"\n\n#include \"base\/string_util.h\"\n#include \"webkit\/glue\/context_menu.h\"\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webdocumentloader_impl.h\"\n#include \"webkit\/glue\/webview_impl.h\"\n\n#include \"base\/word_iterator.h\"\n\nnamespace {\n\n\/\/ Helper function to determine whether text is a single word or a sentence.\nbool IsASingleWord(const std::wstring& text) {\n  WordIterator iter(text, WordIterator::BREAK_WORD);\n  int word_count = 0;\n  if (!iter.Init()) return false;\n  while (iter.Advance()) {\n    if (iter.IsWord()) {\n      word_count++;\n      if (word_count > 1) \/\/ More than one word.\n        return false;\n    }\n  }\n  \n  \/\/ Check for 0 words.\n  if (!word_count)\n    return false;\n  \n  \/\/ Has a single word.\n  return true;\n}\n\n\/\/ Helper function to get misspelled word on which context menu \n\/\/ is to be evolked. This function also sets the word on which context menu\n\/\/ has been evoked to be the selected word, as required.\nstd::wstring GetMisspelledWord(const WebCore::ContextMenu* default_menu,\n                               WebCore::Frame* selected_frame) {\n  std::wstring misspelled_word_string;\n\n  \/\/ First select from selectedText to check for multiple word selection.\n  misspelled_word_string = CollapseWhitespace(\n      webkit_glue::StringToStdWString(selected_frame->selectedText()),\n      false);\n\n  \/\/ Don't provide suggestions for multiple words.\n  if (!misspelled_word_string.empty() && \n      !IsASingleWord(misspelled_word_string))\n    return L\"\";\n\n  WebCore::HitTestResult hit_test_result = selected_frame->eventHandler()->\n      hitTestResultAtPoint(default_menu->hitTestResult().point(), true);\n  WebCore::Node* inner_node = hit_test_result.innerNode();\n  WebCore::VisiblePosition pos(inner_node->renderer()->positionForPoint(\n      hit_test_result.localPoint()));\n\n  WebCore::Selection selection;\n  if (pos.isNotNull()) {\n    selection = WebCore::Selection(pos);\n    selection.expandUsingGranularity(WebCore::WordGranularity);\n  }\n      \n  if (selection.isRange()) { \n    selected_frame->setSelectionGranularity(WebCore::WordGranularity);\n  }\n        \n  if (selected_frame->shouldChangeSelection(selection))\n    selected_frame->selection()->setSelection(selection);\n       \n  misspelled_word_string = CollapseWhitespace(\n      webkit_glue::StringToStdWString(selected_frame->selectedText()),                  \n                                      false);\n\n  \/\/ If misspelled word is empty, then that portion should not be selected.\n  \/\/ Set the selection to that position only, and do not expand.\n  if (misspelled_word_string.empty()) {\n    selection = WebCore::Selection(pos);\n    selected_frame->selection()->setSelection(selection);\n  }\n\n  return misspelled_word_string;\n}\n\n}  \/\/ namespace\n\nContextMenuClientImpl::~ContextMenuClientImpl() {\n}\n\nvoid ContextMenuClientImpl::contextMenuDestroyed() {\n  delete this;\n}\n\n\/\/ Figure out the URL of a page or subframe. Returns |page_type| as the type,\n\/\/ which indicates page or subframe, or ContextNode::NONE if the URL could not\n\/\/ be determined for some reason.\nstatic ContextNode GetTypeAndURLFromFrame(WebCore::Frame* frame,\n                                          GURL* url,\n                                          ContextNode page_node) {\n  ContextNode node;\n  if (frame) {\n    WebCore::DocumentLoader* dl = frame->loader()->documentLoader();\n    if (dl) {\n      WebDataSource* ds = static_cast<WebDocumentLoaderImpl*>(dl)->\n          GetDataSource();\n      if (ds) {\n        node = page_node;\n        *url = ds->HasUnreachableURL() ? ds->GetUnreachableURL()\n                                       : ds->GetRequest().GetURL();\n      }\n    }\n  }\n  return node;\n}\n\nWebCore::PlatformMenuDescription\n    ContextMenuClientImpl::getCustomMenuFromDefaultItems(\n        WebCore::ContextMenu* default_menu) {\n  \/\/ Displaying the context menu in this function is a big hack as we don't\n  \/\/ have context, i.e. whether this is being invoked via a script or in \n  \/\/ response to user input (Mouse event WM_RBUTTONDOWN,\n  \/\/ Keyboard events KeyVK_APPS, Shift+F10). Check if this is being invoked\n  \/\/ in response to the above input events before popping up the context menu.\n  if (!webview_->context_menu_allowed())\n    return NULL;\n\n  WebCore::HitTestResult r = default_menu->hitTestResult();\n  WebCore::Frame* selected_frame = r.innerNonSharedNode()->document()->frame();\n\n  WebCore::IntPoint menu_point =\n      selected_frame->view()->contentsToWindow(r.point());\n\n  ContextNode node;\n\n  \/\/ Links, Images and Image-Links take preference over all else.\n  WebCore::KURL link_url = r.absoluteLinkURL();\n  if (!link_url.isEmpty()) {\n    node.type |= ContextNode::LINK;\n  }\n  WebCore::KURL image_url = r.absoluteImageURL();\n  if (!image_url.isEmpty()) {\n    node.type |= ContextNode::IMAGE;\n  }\n\n  \/\/ If it's not a link, an image or an image link, show a selection menu or a\n  \/\/ more generic page menu.\n  std::wstring selection_text_string;\n  std::wstring misspelled_word_string;\n  GURL frame_url;\n  GURL page_url;\n  std::string security_info;\n  \n  std::wstring frame_encoding;\n  \/\/ Send the frame and page URLs in any case.\n  ContextNode frame_node = ContextNode(ContextNode::NONE);\n  ContextNode page_node =\n      GetTypeAndURLFromFrame(webview_->main_frame()->frame(),\n                             &page_url,\n                             ContextNode(ContextNode::PAGE));\n  if (selected_frame != webview_->main_frame()->frame()) {\n    frame_node = GetTypeAndURLFromFrame(selected_frame,\n                                        &frame_url,\n                                        ContextNode(ContextNode::FRAME));\n    frame_encoding = webkit_glue::StringToStdWString(\n        selected_frame->loader()->encoding());\n  }\n\n  if (r.isSelected()) {\n    node.type |= ContextNode::SELECTION;\n    selection_text_string = CollapseWhitespace(\n      webkit_glue::StringToStdWString(selected_frame->selectedText()),\n      false);\n  }\n\n  if (r.isContentEditable()) {\n    node.type |= ContextNode::EDITABLE;\n    if (webview_->GetFocusedWebCoreFrame()->editor()->\n        isContinuousSpellCheckingEnabled()) {\n      misspelled_word_string = GetMisspelledWord(default_menu,\n                                                 selected_frame);\n    }\n  }\n  \n  if (node.type == ContextNode::NONE) {\n    if (selected_frame != webview_->main_frame()->frame()) {\n      node = frame_node;\n    } else {\n      node = page_node;\n    }\n  }\n\n  \/\/ Now retrieve the security info.\n  WebCore::DocumentLoader* dl = selected_frame->loader()->documentLoader();\n  if (dl) {\n    WebDataSource* ds = static_cast<WebDocumentLoaderImpl*>(dl)->\n        GetDataSource();\n    if (ds) {\n      const WebResponse& response = ds->GetResponse();\n      security_info = response.GetSecurityInfo();\n    }\n  }\n\n  int edit_flags = ContextNode::CAN_DO_NONE;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canUndo())\n    edit_flags |= ContextNode::CAN_UNDO;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canRedo())\n    edit_flags |= ContextNode::CAN_REDO;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canCut())\n    edit_flags |= ContextNode::CAN_CUT;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canCopy())\n    edit_flags |= ContextNode::CAN_COPY;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canPaste())\n    edit_flags |= ContextNode::CAN_PASTE;\n  if (webview_->GetFocusedWebCoreFrame()->editor()->canDelete())\n    edit_flags |= ContextNode::CAN_DELETE;\n  \/\/ We can always select all...\n  edit_flags |= ContextNode::CAN_SELECT_ALL;\n\n  WebViewDelegate* d = webview_->delegate();\n  if (d) {\n    d->ShowContextMenu(webview_,\n                       node,\n                       menu_point.x(),\n                       menu_point.y(),\n                       webkit_glue::KURLToGURL(link_url),\n                       webkit_glue::KURLToGURL(image_url),\n                       page_url,\n                       frame_url,\n                       selection_text_string,\n                       misspelled_word_string,\n                       edit_flags,\n                       security_info);\n  }\n  return NULL;\n}\n\nvoid ContextMenuClientImpl::contextMenuItemSelected(\n    WebCore::ContextMenuItem*, const WebCore::ContextMenu*) {\n}\n\nvoid ContextMenuClientImpl::downloadURL(const WebCore::KURL&) {\n}\n\nvoid ContextMenuClientImpl::copyImageToClipboard(const WebCore::HitTestResult&) {\n}\n\nvoid ContextMenuClientImpl::searchWithGoogle(const WebCore::Frame*) {\n}\n\nvoid ContextMenuClientImpl::lookUpInDictionary(WebCore::Frame*) {\n}\n\nvoid ContextMenuClientImpl::speak(const WebCore::String&) {\n}\n\nvoid ContextMenuClientImpl::stopSpeaking() {\n}\n\nbool ContextMenuClientImpl::shouldIncludeInspectElementItem() {\n    return false;  \/\/ TODO(jackson): Eventually include the inspector context menu item\n}\n\n#if defined(OS_MACOSX)\nvoid ContextMenuClientImpl::searchWithSpotlight() {\n  \/\/ TODO(pinkerton): write this\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <stdio.h>\n#include <ctype.h>\n#include <cstring>\n#include <vector>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <stdlib.h>\n#include <sys\/wait.h>\nusing namespace std;\n\nbool conntest(string x){\n    int i = x.size() - 1;\n    int y = 0;\n    if(x == \"&&\" || x == \";\" || x == \"||\"){\n        \/\/cout << \"a\" << endl;\n        return true;\n    }\n    else if(x.at(i) == ';' || x.at(i) == '&'\n         || x.at(i) == '|')\n    {\n        return true;\n    }\n    else if(x.at(y) == ';' || x.at(y) == '|' || x.at(y) == '&'){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nbool endswith(string x){\n    int i = x.size() - 1;\n    if(x.at(i) == ';' || x.at(i) == '&'\n         || x.at(i) == '|')\n    {\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nint findend(string x){\n    for(int i = 0; i < x.size(); i++){\n        if(x.at(i) == '&' || x.at(i) == ';'\n            || x.at(i) == '|')\n        {\n            return i;\n        }\n    }\n    return -1;\n}\n\nbool beginswith(string x){\n    if(x.at(0) == ';' || x.at(0) == '&' || x.at(0) == '|'){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\n\nstring chopFront(string x, vector<string> &v){\n    if(x.at(0) == '&' && x.at(1) == '&'){\n        v.push_back(x.substr(2,x.size()-1));\n        return x.substr(0, 2);\n    }\n    else if(x.at(0) == '|' && x.at(1) == '|'){\n        v.push_back(x.substr(2,x.size()-1));\n        return x.substr(0, 2);\n    }\n    else{\n        v.push_back(x.substr(1,x.size()-1));\n        return x.substr(0, 1);\n    }\n}\n\nstring parse(string x, string& c, vector<string> &v){\n    if(x == \";\" || x == \"||\" || x == \"&&\"){\n        c = x;\n        return \"\";\n    }\n    if(x.at(0) == ';'){\n        c = x.at(0);\n        v.push_back(x.substr(1,x.size()-1));\n        return \"\";\n    }\n    else if(x.at(0) == '&' && x.at(1) == '&'){\n        c = x.substr(0,1);\n        v.push_back(x.substr(2, x.size()-1));\n        return \"\";\n    }\n    else if(x.at(0) == '|' && x.at(1) == '|'){\n        c = x.substr(0,1);\n        v.push_back(x.substr(2, x.size()-1));\n        return \"\";\n    }\n    else if(x.at(x.size()-1) = ';'){\n        c = x.at(0);\n        return x.substr(0, x.size()-1);\n    }\n}\n\n\nbool run(char str[]){\n    char* pch;\n    bool sucs;\n    string connector;\n    vector<string> cmd;\n    vector<string> addIn;\n    pch = strtok(str, \" \");\n\n    while(pch != \"exit\"){\n        if(pch == NULL || conntest(pch)){\n            if(pch != NULL){\n                    string tmp = pch;\n                    tmp = parse(tmp, connector, addIn);\n                    if(tmp != \"\"){\n                        cmd.push_back(tmp);\n                    }\n            }\n            int pid = fork();\n            if(pid == 0){\n                char* argc[cmd.size() + 1];\n                 for(int i = 0 ; i < cmd.size(); i++ ){\n                \t argc[i] = new char[cmd.at(i).size()];\n                \t strcpy(argc[i], cmd.at(i).c_str());\n                 }\n                 argc[cmd.size()] = NULL;\n                 if(-1 ==  execvp(argc[0], argc)){\n                    perror(\"execvp\");\n$ execvp: No such file or directory\n$\n                 }\n            }\n            else{\n                wait(NULL);\n\t            pch = strtok(NULL, \" \");\n\t            cmd.clear();\n                for(int i = 0; i < addIn.size(); i++){\n                    cmd.push_back(addIn.at(i));\n                }\n                addIn.clear();\n\t            if(pch == \"exit\"){\n\t                exit(1);\n                }\n                if(pch == NULL && cmd.size() == 0){\n\t                return true;\n                }\n            }\n       }\n       else{\n\t       if(pch != \" \"){\n               cmd.push_back(pch);\n           }\n           pch = strtok(NULL, \" \");\n\t       if(pch == \"exit\"){\n\t           exit(1);\n           }\n       }\n   }\n   return false;\n}\n\n\n\nint main(){\n   bool goon = true;\n   while(goon){\n       string input;\n       cout << \"$ \";\n       getline(cin, input);\n       char str[input.size()+1];\n       strcpy(str, input.c_str());\n       goon = run(str);\n   }\n   return 0;\n}\n<commit_msg>Updated hw0.cpp: allows for more command input cases<commit_after>#include <iostream>\n#include <stdio.h>\n#include <ctype.h>\n#include <cstring>\n#include <vector>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <stdlib.h>\n#include <sys\/wait.h>\nusing namespace std;\n\nbool conntest(string x){\n    int i = x.size() - 1;\n    int y = 0;\n    if(x == \"&&\" || x == \";\" || x == \"||\"){\n        return true;\n    }\n    else if(x.at(i) == ';' || x.at(i) == '&'\n         || x.at(i) == '|')\n    {\n        return true;\n    }\n    else if(x.at(y) == ';' || x.at(y) == '|' || x.at(y) == '&'){\n        return true;\n    }\n    else{\n        for(int i = 0; i < x.size(); i++){\n            if(x.at(i) == ';' || x.at(i) == '|' || x.at(i) == '&'){\n                return true;\n            }\n        }\n        return false;\n    }\n}\n\nstring parse(string x, string& c, vector<string> &v){\n    if(x == \";\" || x == \"||\" || x == \"&&\"){\n        c = x;\n        return \"\";\n    }\n    if(x.at(0) == ';'){\n        c = x.at(0);\n        v.push_back(x.substr(1,x.size()-1));\n        return \"\";\n    }\n    else if(x.at(0) == '&' && x.at(1) == '&'){\n        c = x.substr(0,1);\n        v.push_back(x.substr(2, x.size()-1));\n        return \"\";\n    }\n    else if(x.at(0) == '|' && x.at(1) == '|'){\n        c = x.substr(0,1);\n        v.push_back(x.substr(2, x.size()-1));\n        return \"\";\n    }\n    else if(x.at(x.size()-1) == ';'){\n        c = x.at(0);\n        return x.substr(0, x.size()-1);\n    }\n    else if(x.at(x.size()-2) == '|' && x.at(x.size()-1) == '|'){\n        c = x.substr(x.size()-2, x.size()-1);\n        return x.substr(0, x.size() - 2) ;\n    }\n    else if(x.at(x.size()-2) == '&' && x.at(x.size()-1) == '&'){\n        c = x.substr(x.size()-2, x.size()-1);\n        return x.substr(0, x.size() - 2) ;\n    }\n    else{\n        for(int i = 0; i < x.size(); i++){\n            if(x.at(i) == ';' || x.at(i) == '&' || x.at(i) == '|'){\n                if(x.at(i) == ';'){\n                    c = x.at(i);\n                    v.push_back(x.substr(i+1, x.size()-1));\n                    return x.substr(0, i);\n                }\n                else if(i != x.size() - 1 && (x.at(i) == '&' || x.at(i) == '|')){\n                    c = x.substr(i, i + 1);\n                    v.push_back(x.substr(i+2, x.size() -1));\n                    return x.substr(0, i);\n                }\n            }\n        }\n    }\n}\n\nbool run(char str[]){\n    char* pch;\n    bool sucs;\n    string connector;\n    vector<string> cmd;\n    vector<string> addIn;\n    pch = strtok(str, \" \");\n\n    while(pch != \"exit\"){\n        if(pch == NULL || conntest(pch)){\n            if(pch != NULL){\n                    string tmp = pch;\n                    tmp = parse(tmp, connector, addIn);\n                    if(tmp != \"\"){\n                        cmd.push_back(tmp);\n                    }\n            }\n            int pid = fork();\n            if(pid == 0){\n                char* argc[cmd.size() + 1];\n                 for(int i = 0 ; i < cmd.size(); i++ ){\n                \t argc[i] = new char[cmd.at(i).size()];\n                \t strcpy(argc[i], cmd.at(i).c_str());\n                 }\n                 argc[cmd.size()] = NULL;\n                 cout << cmd.at(0) << endl;\n                 if(-1 ==  execvp(argc[0], argc)){\n                    perror(\"execvp\");\n                    return false;\n                 }\n            }\n            else{\n                wait(NULL);\n\t            pch = strtok(NULL, \" \");\n\t            cmd.clear();\n                for(int i = 0; i < addIn.size(); i++){\n                    cmd.push_back(addIn.at(i));\n                }\n                addIn.clear();\n\t            if(pch == \"exit\"){\n\t                exit(1);\n                }\n                if(pch == NULL && cmd.size() == 0){\n\t                return true;\n                }\n            }\n       }\n       else{\n\t       if(pch != \" \"){\n               cmd.push_back(pch);\n           }\n           pch = strtok(NULL, \" \");\n\t       if(pch == \"exit\"){\n\t           exit(1);\n           }\n       }\n   }\n   return false;\n}\n\n\n\nint main(){\n   bool goon = true;\n   while(goon){\n       string input;\n       cout << \"$ \";\n       getline(cin, input);\n       char str[input.size()+1];\n       strcpy(str, input.c_str());\n       goon = run(str);\n   }\n   return 0;\n}\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 <iomanip>\n\n#include \"Log.h\"\n#include \"GradientTester.h\"\n\n#include \"NetGraphNode.h\"\n\nnamespace Conv {\n  \nvoid GradientTester::TestGradient ( NetGraph& graph, unsigned int skip_weights, bool fatal_fail ) {\n  const double epsilon = 0.005;\n  LOGDEBUG << \"Testing gradient. FeedForward...\";\n\tgraph.FeedForward();\n  LOGDEBUG << \"Testing gradient. BackPropagate...\";\n  graph.BackPropagate();\n  \n\tconst datum initial_loss = graph.AggregateLoss();\n\tunsigned int global_okay = 0;\n\tunsigned int global_tolerable = 0;\n\tunsigned int global_failed = 0;\n\tunsigned int global_weights = 0;\n\n  LOGDEBUG << \"Initial loss: \" << initial_loss;\n  LOGDEBUG << \"Using epsilon: \" << epsilon;\n  for(unsigned int l = 0; l < graph.GetNodes().size(); l++) {\n\t\tNetGraphNode* node = graph.GetNodes()[l];\n\t\tLayer* layer = node->layer;\n    for(unsigned int p = 0; p < layer->parameters().size(); p++) {\n\t\t\tCombinedTensor* const param = layer->parameters()[p];\n      LOGDEBUG << \"Testing layer \" << l << \" (\" << layer->GetLayerDescription() << \"), parameter set \" << p;\n      LOGDEBUG << param->data;\n      bool passed = true;\n      unsigned int okay = 0;\n      unsigned int tolerable = 0;\n      unsigned int failed = 0;\n      unsigned int total = 0;\n      for(unsigned int e = 0; e < param->data.elements(); e+=(skip_weights + 1))\n      {\n        total++;\n#ifdef BUILD_OPENCL\n\tparam->data.MoveToCPU();\n\tparam->delta.MoveToCPU();\n#endif\n\tconst datum old_param = param->data(e);\n\t\n\tparam->data[e] = old_param + epsilon;\n\tgraph.FeedForward();\n\tconst double plus_loss = graph.AggregateLoss();\n\t\n#ifdef BUILD_OPENCL\n\tparam->data.MoveToCPU();\n#endif\n\tparam->data[e] = old_param - epsilon;\ngraph.FeedForward();\n\tconst double minus_loss = graph.AggregateLoss();\n\t\n\tconst double delta = param->delta[e];\n\tconst double actual_delta = (plus_loss - minus_loss) \/ (2.0 * epsilon);\n\t\n\tconst double ratio = actual_delta \/ delta;\n\tif(ratio > 1.02 || ratio < 0.98) {\n\t  if(ratio > 1.2 || ratio < 0.8) {\n      if(passed) {\n\t      LOGWARN << \"delta analytic: \" << delta << \", numeric: \" << actual_delta << \", ratio: \" << ratio;\n      }\n\t    passed = false;\n\t    \/\/ std::cout << \"!\" << std::flush;\n\t\t\tfailed++;\n\t  } else {\n\t  \/\/ std::cout << \"#\" << std::flush;\n\t\ttolerable++;\n\t  }\n\t}\n\telse {\n\t  \/\/ std::cout << \".\" << std::flush;\n\t  okay++;\n\t}\n#ifdef BUILD_OPENCL\n\tparam->data.MoveToCPU();\n#endif\n\tparam->data[e] = old_param;\n      }\n      \/\/ std::cout << \"\\n\";\n      if(passed) {\n\tLOGDEBUG << \"Okay!\";\n      } else {\n\tLOGERROR << \"Failed!\";\n      }\n\t\t\tLOGDEBUG << okay << \" of \" << total << \" gradients okay (delta < 2%)\";\n\t\t\tLOGDEBUG << tolerable << \" of \" << total << \" gradients tolerable (delta < 20%)\";\n\t\t\tLOGDEBUG << failed << \" of \" << total << \" gradients failed (delta >= 20%)\";\n\t\t\tglobal_okay += okay;\n\t\t\tglobal_tolerable += tolerable;\n\t\t\tglobal_failed += failed;\n\t\t\tglobal_weights += total;\n    }\n  }\n\n\tLOGRESULT << global_okay << \" of \" << global_weights << \" tested gradients okay (delta < 2%)\" << LOGRESULTEND;\n\tLOGRESULT << global_tolerable << \" of \" << global_weights << \" tested gradients tolerable (delta < 20%)\" << LOGRESULTEND;\n\tLOGRESULT << global_failed << \" of \" << global_weights << \" tested gradients failed (delta >= 20%)\" << LOGRESULTEND;\n  \n  if (global_failed > 0 && fatal_fail) {\n    FATAL(\"Failed gradient check!\");\n  }\n  \n\n}\n  \nbool GradientTester::DoGradientTest(Conv::Layer* layer, Conv::Tensor& data, Conv::Tensor& delta, std::vector<Conv::CombinedTensor*>& outputs, Conv::datum epsilon, void (*WriteLossDeltas)(const std::vector<CombinedTensor*>&), datum (*CalculateLoss)(const std::vector<CombinedTensor*>&)) {\n  layer->FeedForward();\n  WriteLossDeltas(outputs);\n  layer->BackPropagate();\n  \n  unsigned int elements = data.elements();\n  unsigned int okay = 0;\n\n  \/\/ Weight gradient test\n  for (unsigned int w = 0; w < data.elements(); w++) {\n    const Conv::datum weight = data.data_ptr_const()[w];\n    const Conv::datum gradient = delta.data_ptr_const()[w];\n\n    \/\/ Using central diff\n    data.data_ptr()[w] = weight + epsilon;\n    layer->FeedForward();\n    const Conv::datum forward_loss = CalculateLoss(outputs);\n\n    data.data_ptr()[w] = weight - epsilon;\n    layer->FeedForward();\n    const Conv::datum backward_loss = CalculateLoss(outputs);\n\n    const Conv::datum fd_gradient = (forward_loss - backward_loss) \/ (2.0 * epsilon);\n    data.data_ptr()[w] = weight;\n\n    const Conv::datum ratio = fd_gradient \/ gradient;\n    if(ratio > 1.2 || ratio < 0.8) {\n      LOGDEBUG << \"BP Grad : \" << gradient;\n      LOGDEBUG << \"FD Grad : \" << fd_gradient;\n      LOGDEBUG << \"Ratio   : \" << ratio;\n      LOGDEBUG << \"Diff    : \" << gradient - fd_gradient;\n    } else {\n      okay++;\n    }\n  }\n  if(okay != elements) {\n    double success_rate = (double)okay\/(double)elements;\n    if(success_rate > 0.85)\n      return true;\n    else {\n      LOGERROR << okay << \" of \" << elements << \" gradients okay - \" << std::setprecision(3) << 100.0 * (double)okay\/(double)elements << \"%\";\n      return false;\n    }\n  } else {\n    return true;\n  }\n}\n\n\n}\n<commit_msg>GradientTester: Fixed missing OpenCL awareness<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 <iomanip>\n\n#include \"Log.h\"\n#include \"GradientTester.h\"\n\n#include \"NetGraphNode.h\"\n\nnamespace Conv {\n  \nvoid GradientTester::TestGradient ( NetGraph& graph, unsigned int skip_weights, bool fatal_fail ) {\n  const double epsilon = 0.005;\n  LOGDEBUG << \"Testing gradient. FeedForward...\";\n\tgraph.FeedForward();\n  LOGDEBUG << \"Testing gradient. BackPropagate...\";\n  graph.BackPropagate();\n  \n\tconst datum initial_loss = graph.AggregateLoss();\n\tunsigned int global_okay = 0;\n\tunsigned int global_tolerable = 0;\n\tunsigned int global_failed = 0;\n\tunsigned int global_weights = 0;\n\n  LOGDEBUG << \"Initial loss: \" << initial_loss;\n  LOGDEBUG << \"Using epsilon: \" << epsilon;\n  for(unsigned int l = 0; l < graph.GetNodes().size(); l++) {\n\t\tNetGraphNode* node = graph.GetNodes()[l];\n\t\tLayer* layer = node->layer;\n    for(unsigned int p = 0; p < layer->parameters().size(); p++) {\n\t\t\tCombinedTensor* const param = layer->parameters()[p];\n      LOGDEBUG << \"Testing layer \" << l << \" (\" << layer->GetLayerDescription() << \"), parameter set \" << p;\n      LOGDEBUG << param->data;\n      bool passed = true;\n      unsigned int okay = 0;\n      unsigned int tolerable = 0;\n      unsigned int failed = 0;\n      unsigned int total = 0;\n      for(unsigned int e = 0; e < param->data.elements(); e+=(skip_weights + 1))\n      {\n        total++;\n#ifdef BUILD_OPENCL\n\tparam->data.MoveToCPU();\n\tparam->delta.MoveToCPU();\n#endif\n\tconst datum old_param = param->data(e);\n\t\n\tparam->data[e] = old_param + epsilon;\n\tgraph.FeedForward();\n\tconst double plus_loss = graph.AggregateLoss();\n\t\n#ifdef BUILD_OPENCL\n\tparam->data.MoveToCPU();\n#endif\n\tparam->data[e] = old_param - epsilon;\ngraph.FeedForward();\n\tconst double minus_loss = graph.AggregateLoss();\n\t\n\tconst double delta = param->delta[e];\n\tconst double actual_delta = (plus_loss - minus_loss) \/ (2.0 * epsilon);\n\t\n\tconst double ratio = actual_delta \/ delta;\n\tif(ratio > 1.02 || ratio < 0.98) {\n\t  if(ratio > 1.2 || ratio < 0.8) {\n      if(passed) {\n\t      LOGWARN << \"delta analytic: \" << delta << \", numeric: \" << actual_delta << \", ratio: \" << ratio;\n      }\n\t    passed = false;\n\t    \/\/ std::cout << \"!\" << std::flush;\n\t\t\tfailed++;\n\t  } else {\n\t  \/\/ std::cout << \"#\" << std::flush;\n\t\ttolerable++;\n\t  }\n\t}\n\telse {\n\t  \/\/ std::cout << \".\" << std::flush;\n\t  okay++;\n\t}\n#ifdef BUILD_OPENCL\n\tparam->data.MoveToCPU();\n#endif\n\tparam->data[e] = old_param;\n      }\n      \/\/ std::cout << \"\\n\";\n      if(passed) {\n\tLOGDEBUG << \"Okay!\";\n      } else {\n\tLOGERROR << \"Failed!\";\n      }\n\t\t\tLOGDEBUG << okay << \" of \" << total << \" gradients okay (delta < 2%)\";\n\t\t\tLOGDEBUG << tolerable << \" of \" << total << \" gradients tolerable (delta < 20%)\";\n\t\t\tLOGDEBUG << failed << \" of \" << total << \" gradients failed (delta >= 20%)\";\n\t\t\tglobal_okay += okay;\n\t\t\tglobal_tolerable += tolerable;\n\t\t\tglobal_failed += failed;\n\t\t\tglobal_weights += total;\n    }\n  }\n\n\tLOGRESULT << global_okay << \" of \" << global_weights << \" tested gradients okay (delta < 2%)\" << LOGRESULTEND;\n\tLOGRESULT << global_tolerable << \" of \" << global_weights << \" tested gradients tolerable (delta < 20%)\" << LOGRESULTEND;\n\tLOGRESULT << global_failed << \" of \" << global_weights << \" tested gradients failed (delta >= 20%)\" << LOGRESULTEND;\n  \n  if (global_failed > 0 && fatal_fail) {\n    FATAL(\"Failed gradient check!\");\n  }\n  \n\n}\n  \nbool GradientTester::DoGradientTest(Conv::Layer* layer, Conv::Tensor& data, Conv::Tensor& delta, std::vector<Conv::CombinedTensor*>& outputs, Conv::datum epsilon, void (*WriteLossDeltas)(const std::vector<CombinedTensor*>&), datum (*CalculateLoss)(const std::vector<CombinedTensor*>&)) {\n  layer->FeedForward();\n  WriteLossDeltas(outputs);\n  layer->BackPropagate();\n  \n  unsigned int elements = data.elements();\n  unsigned int okay = 0;\n\n  \/\/ Weight gradient test\n  for (unsigned int w = 0; w < data.elements(); w++) {\n#ifdef BUILD_OPENCL\n    data.MoveToCPU();\n    delta.MoveToCPU();\n#endif\n    const Conv::datum weight = data.data_ptr_const()[w];\n    const Conv::datum gradient = delta.data_ptr_const()[w];\n\n    \/\/ Using central diff\n    data.data_ptr()[w] = weight + epsilon;\n    layer->FeedForward();\n    const Conv::datum forward_loss = CalculateLoss(outputs);\n\n#ifdef BUILD_OPENCL\n    data.MoveToCPU();\n#endif\n    data.data_ptr()[w] = weight - epsilon;\n    layer->FeedForward();\n    const Conv::datum backward_loss = CalculateLoss(outputs);\n\n    const Conv::datum fd_gradient = (forward_loss - backward_loss) \/ (2.0 * epsilon);\n\n#ifdef BUILD_OPENCL\n    data.MoveToCPU();\n#endif\n    data.data_ptr()[w] = weight;\n\n    const Conv::datum ratio = fd_gradient \/ gradient;\n    if(ratio > 1.2 || ratio < 0.8) {\n      LOGDEBUG << \"BP Grad : \" << gradient;\n      LOGDEBUG << \"FD Grad : \" << fd_gradient;\n      LOGDEBUG << \"Ratio   : \" << ratio;\n      LOGDEBUG << \"Diff    : \" << gradient - fd_gradient;\n    } else {\n      okay++;\n    }\n  }\n  if(okay != elements) {\n    double success_rate = (double)okay\/(double)elements;\n    if(success_rate > 0.85)\n      return true;\n    else {\n      LOGERROR << okay << \" of \" << elements << \" gradients okay - \" << std::setprecision(3) << 100.0 * (double)okay\/(double)elements << \"%\";\n      return false;\n    }\n  } else {\n    return true;\n  }\n}\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\r\n\/\/ Copyright (c) 2009-2012 The Bitcoin developers\r\n\/\/ Copyright (c) 2011-2012 Litecoin Developers\r\n\/\/ Copyright (c) 2014 CosineCoin Developers\r\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\r\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\r\n\r\n#include \"irc.h\"\r\n#include \"net.h\"\r\n#include \"strlcpy.h\"\r\n#include \"base58.h\"\r\n\r\nusing namespace std;\r\nusing namespace boost;\r\n\r\nint nGotIRCAddresses = 0;\r\n\r\nvoid ThreadIRCSeed2(void* parg);\r\nextern volatile bool fRequestShutdown;\r\n\r\n\r\n\r\n#pragma pack(push, 1)\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nstruct ircaddr {\r\n    struct in_addr ip;\r\n    short port;\r\n};\r\n#pragma pack(pop)\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nstring EncodeAddress(const CService& addr) {\r\n    struct ircaddr tmp;\r\n    if (addr.GetInAddr(&tmp.ip))\r\n    {\r\n        tmp.port = htons(addr.GetPort());\r\n\r\n        vector<unsigned char> vch(UBEGIN(tmp), UEND(tmp));\r\n        return string(\"u\") + EncodeBase58Check(vch);\r\n    }\r\n    return \"\";\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool DecodeAddress(string str, CService& addr) {\r\n    vector<unsigned char> vch;\r\n    if (!DecodeBase58Check(str.substr(1), vch))\r\n        return false;\r\n\r\n    struct ircaddr tmp;\r\n    if (vch.size() != sizeof(tmp))\r\n        return false;\r\n    memcpy(&tmp, &vch[0], sizeof(tmp));\r\n\r\n    addr = CService(tmp.ip, ntohs(tmp.port));\r\n    return true;\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nstatic bool Send(SOCKET hSocket, const char* pszSend) {\r\n    if (strstr(pszSend, \"PONG\") != pszSend)\r\n        printf(\"IRC SENDING: %s\\n\", pszSend);\r\n    const char* psz = pszSend;\r\n    const char* pszEnd = psz + strlen(psz);\r\n    while (psz < pszEnd)\r\n    {\r\n        int ret = send(hSocket, psz, pszEnd - psz, MSG_NOSIGNAL);\r\n        if (ret < 0)\r\n            return false;\r\n        psz += ret;\r\n    }\r\n    return true;\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool RecvLineIRC(SOCKET hSocket, string& strLine) {\r\n    loop\r\n    {\r\n        bool fRet = RecvLine(hSocket, strLine);\r\n        if (fRet)\r\n        {\r\n            if (fRequestShutdown)\r\n                return false;\r\n            vector<string> vWords;\r\n            ParseString(strLine, ' ', vWords);\r\n            if (vWords.size() >= 1 && vWords[0] == \"PING\")\r\n            {\r\n                strLine[1] = 'O';\r\n                strLine += '\\r';\r\n                Send(hSocket, strLine.c_str());\r\n                continue;\r\n            }\r\n        }\r\n        return fRet;\r\n    }\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nint RecvUntil(SOCKET hSocket, const char* psz1, const char* psz2=NULL, const char* psz3=NULL, const char* psz4=NULL) {\r\n    loop\r\n    {\r\n        string strLine;\r\n        strLine.reserve(10000);\r\n        if (!RecvLineIRC(hSocket, strLine))\r\n            return 0;\r\n        printf(\"IRC %s\\n\", strLine.c_str());\r\n        if (psz1 && strLine.find(psz1) != string::npos)\r\n            return 1;\r\n        if (psz2 && strLine.find(psz2) != string::npos)\r\n            return 2;\r\n        if (psz3 && strLine.find(psz3) != string::npos)\r\n            return 3;\r\n        if (psz4 && strLine.find(psz4) != string::npos)\r\n            return 4;\r\n    }\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool Wait(int nSeconds) {\r\n    if (fRequestShutdown)\r\n        return false;\r\n    printf(\"IRC waiting %d seconds to reconnect\\n\", nSeconds);\r\n    for (int i = 0; i < nSeconds; i++)\r\n    {\r\n        if (fRequestShutdown)\r\n            return false;\r\n        usleep(1000000);\r\n    }\r\n    return true;\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool RecvCodeLine(SOCKET hSocket, const char* psz1, string& strRet) {\r\n    strRet.clear();\r\n    loop\r\n    {\r\n        string strLine;\r\n        if (!RecvLineIRC(hSocket, strLine))\r\n            return false;\r\n\r\n        vector<string> vWords;\r\n        ParseString(strLine, ' ', vWords);\r\n        if (vWords.size() < 2)\r\n            continue;\r\n\r\n        if (vWords[1] == psz1)\r\n        {\r\n            printf(\"IRC %s\\n\", strLine.c_str());\r\n            strRet = strLine;\r\n            return true;\r\n        }\r\n    }\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool GetIPFromIRC(SOCKET hSocket, string strMyName, CNetAddr& ipRet) {\r\n    Send(hSocket, strprintf(\"USERHOST %s\\r\", strMyName.c_str()).c_str());\r\n\r\n    string strLine;\r\n    if (!RecvCodeLine(hSocket, \"302\", strLine))\r\n        return false;\r\n\r\n    vector<string> vWords;\r\n    ParseString(strLine, ' ', vWords);\r\n    if (vWords.size() < 4)\r\n        return false;\r\n\r\n    string str = vWords[3];\r\n    if (str.rfind(\"@\") == string::npos)\r\n        return false;\r\n    string strHost = str.substr(str.rfind(\"@\")+1);\r\n\r\n    \/\/ Hybrid IRC used by lfnet always returns IP when you userhost yourself,\r\n    \/\/ but in case another IRC is ever used this should work.\r\n    printf(\"GetIPFromIRC() got userhost %s\\n\", strHost.c_str());\r\n    CNetAddr addr(strHost, true);\r\n    if (!addr.IsValid())\r\n        return false;\r\n    ipRet = addr;\r\n\r\n    return true;\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nvoid ThreadIRCSeed() {\r\n    \/\/IMPLEMENT_RANDOMIZE_STACK(ThreadIRCSeed(parg));\r\n\r\n    \/\/ Make this thread recognisable as the IRC seeding thread\r\n    RenameThread(\"bitcoin-ircseed\");\r\n\r\n    try\r\n    {\r\n        ThreadIRCSeed2(NULL);\r\n    }\r\n    catch (std::exception& e) {\r\n        PrintExceptionContinue(&e, \"ThreadIRCSeed()\");\r\n    } catch (...) {\r\n        PrintExceptionContinue(NULL, \"ThreadIRCSeed()\");\r\n    }\r\n    printf(\"ThreadIRCSeed exited\\n\");\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nvoid ThreadIRCSeed2(void* parg) {\r\n    \/* Dont advertise on IRC if we don't allow incoming connections *\/\r\n    if (mapArgs.count(\"-connect\") || fNoListen)\r\n        return;\r\n\r\n    if (!GetBoolArg(\"-irc\", false))\r\n        return;\r\n\r\n    printf(\"ThreadIRCSeed started\\n\");\r\n    int nErrorWait = 10;\r\n    int nRetryWait = 10;\r\n\r\n    while (!fRequestShutdown)\r\n    {\r\n        CService addrConnect(\"92.243.23.21\", 6667); \/\/ irc.lfnet.org\r\n\r\n        CService addrIRC(\"irc.lfnet.org\", 6667, true);\r\n        if(addrIRC.IsValid()) {\r\n\t\t\tprintf(\"Set IRC server irc.lfnet.org\\n\");\r\n            addrConnect = addrIRC;\r\n\t\t}\r\n\r\n        SOCKET hSocket;\r\n        if (!ConnectSocket(addrConnect, hSocket))\r\n        {\r\n            printf(\"IRC connect failed\\n\");\r\n            nErrorWait = nErrorWait * 11 \/ 10;\r\n            if (Wait(nErrorWait += 60))\r\n                continue;\r\n            else\r\n                return;\r\n        }\r\n\r\n        if (!RecvUntil(hSocket, \"Found your hostname\", \"using your IP address instead\", \"Couldn't look up your hostname\", \"ignoring hostname\"))\r\n        {\r\n            closesocket(hSocket);\r\n            hSocket = INVALID_SOCKET;\r\n            nErrorWait = nErrorWait * 11 \/ 10;\r\n            if (Wait(nErrorWait += 60))\r\n                continue;\r\n            else\r\n                return;\r\n        }\r\n\r\n        CNetAddr addrIPv4(\"1.2.3.4\"); \/\/ arbitrary IPv4 address to make GetLocal prefer IPv4 addresses\r\n        CService addrLocal;\r\n        string strMyName;\r\n        if (GetLocal(addrLocal, &addrIPv4))\r\n            strMyName = EncodeAddress(GetLocalAddress(&addrConnect));\r\n        if (strMyName == \"\")\r\n            strMyName = strprintf(\"x%u\", (unsigned int)GetRand(1000000000));\r\n\r\n        Send(hSocket, strprintf(\"NICK %s\\r\", strMyName.c_str()).c_str());\r\n        Send(hSocket, strprintf(\"USER %s 8 * : %s\\r\", strMyName.c_str(), strMyName.c_str()).c_str());\r\n\r\n        int nRet = RecvUntil(hSocket, \" 004 \", \" 433 \");\r\n        if (nRet != 1)\r\n        {\r\n            closesocket(hSocket);\r\n            hSocket = INVALID_SOCKET;\r\n            if (nRet == 2)\r\n            {\r\n                printf(\"IRC name already in use\\n\");\r\n                Wait(10);\r\n                continue;\r\n            }\r\n            nErrorWait = nErrorWait * 11 \/ 10;\r\n            if (Wait(nErrorWait += 60))\r\n                continue;\r\n            else\r\n                return;\r\n        }\r\n        usleep(500000);\r\n\r\n        \/\/ Get our external IP from the IRC server and re-nick before joining the channel\r\n        CNetAddr addrFromIRC;\r\n        if (GetIPFromIRC(hSocket, strMyName, addrFromIRC))\r\n        {\r\n            printf(\"GetIPFromIRC() returned %s\\n\", addrFromIRC.ToString().c_str());\r\n            if (addrFromIRC.IsRoutable())\r\n            {\r\n                \/\/ IRC lets you to re-nick\r\n                AddLocal(addrFromIRC, LOCAL_IRC);\r\n                strMyName = EncodeAddress(GetLocalAddress(&addrConnect));\r\n                Send(hSocket, strprintf(\"NICK %s\\r\", strMyName.c_str()).c_str());\r\n            }\r\n        }\r\n        \r\n        if (fTestNet) {\r\n            Send(hSocket, \"JOIN #cosinecoinTEST1\\r\");\r\n            Send(hSocket, \"WHO #cosinecoinTEST2\\r\");\r\n        } else {\r\n            \/\/ randomly join #cosinecoin00-#cosinecoin99\r\n            int channel_number = GetRandInt(100);\r\n            channel_number = 0; \/\/ Litecoin: for now, just use one channel\r\n            Send(hSocket, strprintf(\"JOIN #cosinecoin%02d\\r\", channel_number).c_str());\r\n            Send(hSocket, strprintf(\"WHO #cosinecoin%02d\\r\", channel_number).c_str());\r\n        }\r\n\r\n        int64 nStart = GetTime();\r\n        string strLine;\r\n        strLine.reserve(10000);\r\n        while (!fRequestShutdown && RecvLineIRC(hSocket, strLine))\r\n        {\r\n            if (strLine.empty() || strLine.size() > 900 || strLine[0] != ':')\r\n                continue;\r\n\r\n            vector<string> vWords;\r\n            ParseString(strLine, ' ', vWords);\r\n            if (vWords.size() < 2)\r\n                continue;\r\n\r\n            char pszName[10000];\r\n            pszName[0] = '\\0';\r\n\r\n            if (vWords[1] == \"352\" && vWords.size() >= 8)\r\n            {\r\n                \/\/ index 7 is limited to 16 characters\r\n                \/\/ could get full length name at index 10, but would be different from join messages\r\n                strlcpy(pszName, vWords[7].c_str(), sizeof(pszName));\r\n                printf(\"IRC got who\\n\");\r\n            }\r\n\r\n            if (vWords[1] == \"JOIN\" && vWords[0].size() > 1)\r\n            {\r\n                \/\/ :username!username@50000007.F000000B.90000002.IP JOIN :#channelname\r\n                strlcpy(pszName, vWords[0].c_str() + 1, sizeof(pszName));\r\n                if (strchr(pszName, '!'))\r\n                    *strchr(pszName, '!') = '\\0';\r\n                printf(\"IRC got join\\n\");\r\n            }\r\n\r\n            if (pszName[0] == 'u')\r\n            {\r\n                CAddress addr;\r\n                if (DecodeAddress(pszName, addr))\r\n                {\r\n                    addr.nTime = GetAdjustedTime();\r\n                    if (addrman.Add(addr, addrConnect, 51 * 60))\r\n                        printf(\"IRC got new address: %s\\n\", addr.ToString().c_str());\r\n                    nGotIRCAddresses++;\r\n                }\r\n                else\r\n                {\r\n                    printf(\"IRC decode failed\\n\");\r\n                }\r\n            }\r\n        }\r\n        closesocket(hSocket);\r\n        hSocket = INVALID_SOCKET;\r\n\r\n        if (GetTime() - nStart > 20 * 60)\r\n        {\r\n            nErrorWait \/= 3;\r\n            nRetryWait \/= 3;\r\n        }\r\n\r\n        nRetryWait = nRetryWait * 11 \/ 10;\r\n        if (!Wait(nRetryWait += 60))\r\n            return;\r\n    }\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\n#ifdef TEST\r\nint main(int argc, char *argv[])\r\n{\r\n    WSADATA wsadata;\r\n    if (WSAStartup(MAKEWORD(2,2), &wsadata) != NO_ERROR)\r\n    {\r\n        printf(\"Error at WSAStartup()\\n\");\r\n        return false;\r\n    }\r\n\r\n    ThreadIRCSeed(NULL);\r\n\r\n    WSACleanup();\r\n    return 0;\r\n}\r\n#endif\r\n\r\n<commit_msg>trying something new with irc<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\r\n\/\/ Copyright (c) 2009-2012 The Bitcoin developers\r\n\/\/ Copyright (c) 2011-2012 Litecoin Developers\r\n\/\/ Copyright (c) 2014 CosineCoin Developers\r\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\r\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\r\n\r\n#include <netdb.h>\r\n#include \"irc.h\"\r\n#include \"net.h\"\r\n#include \"strlcpy.h\"\r\n#include \"base58.h\"\r\n\r\nusing namespace std;\r\nusing namespace boost;\r\n\r\nint nGotIRCAddresses = 0;\r\n\r\nvoid ThreadIRCSeed2(void* parg);\r\nextern volatile bool fRequestShutdown;\r\n\r\n\r\n\r\n#pragma pack(push, 1)\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nstruct ircaddr {\r\n    struct in_addr ip;\r\n    short port;\r\n};\r\n#pragma pack(pop)\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nstring EncodeAddress(const CService& addr) {\r\n    struct ircaddr tmp;\r\n    if (addr.GetInAddr(&tmp.ip))\r\n    {\r\n        tmp.port = htons(addr.GetPort());\r\n\r\n        vector<unsigned char> vch(UBEGIN(tmp), UEND(tmp));\r\n        return string(\"u\") + EncodeBase58Check(vch);\r\n    }\r\n    return \"\";\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool DecodeAddress(string str, CService& addr) {\r\n    vector<unsigned char> vch;\r\n    if (!DecodeBase58Check(str.substr(1), vch))\r\n        return false;\r\n\r\n    struct ircaddr tmp;\r\n    if (vch.size() != sizeof(tmp))\r\n        return false;\r\n    memcpy(&tmp, &vch[0], sizeof(tmp));\r\n\r\n    addr = CService(tmp.ip, ntohs(tmp.port));\r\n    return true;\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nstatic bool Send(SOCKET hSocket, const char* pszSend) {\r\n    if (strstr(pszSend, \"PONG\") != pszSend)\r\n        printf(\"IRC SENDING: %s\\n\", pszSend);\r\n    const char* psz = pszSend;\r\n    const char* pszEnd = psz + strlen(psz);\r\n    while (psz < pszEnd)\r\n    {\r\n        int ret = send(hSocket, psz, pszEnd - psz, MSG_NOSIGNAL);\r\n        if (ret < 0)\r\n            return false;\r\n        psz += ret;\r\n    }\r\n    return true;\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool RecvLineIRC(SOCKET hSocket, string& strLine) {\r\n    loop\r\n    {\r\n        bool fRet = RecvLine(hSocket, strLine);\r\n        if (fRet)\r\n        {\r\n            if (fRequestShutdown)\r\n                return false;\r\n            vector<string> vWords;\r\n            ParseString(strLine, ' ', vWords);\r\n            if (vWords.size() >= 1 && vWords[0] == \"PING\")\r\n            {\r\n                strLine[1] = 'O';\r\n                strLine += '\\r';\r\n                Send(hSocket, strLine.c_str());\r\n                continue;\r\n            }\r\n        }\r\n        return fRet;\r\n    }\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nint RecvUntil(SOCKET hSocket, const char* psz1, const char* psz2=NULL, const char* psz3=NULL, const char* psz4=NULL) {\r\n    loop\r\n    {\r\n        string strLine;\r\n        strLine.reserve(10000);\r\n        if (!RecvLineIRC(hSocket, strLine))\r\n            return 0;\r\n        printf(\"IRC %s\\n\", strLine.c_str());\r\n        if (psz1 && strLine.find(psz1) != string::npos)\r\n            return 1;\r\n        if (psz2 && strLine.find(psz2) != string::npos)\r\n            return 2;\r\n        if (psz3 && strLine.find(psz3) != string::npos)\r\n            return 3;\r\n        if (psz4 && strLine.find(psz4) != string::npos)\r\n            return 4;\r\n    }\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool Wait(int nSeconds) {\r\n    if (fRequestShutdown)\r\n        return false;\r\n    printf(\"IRC waiting %d seconds to reconnect\\n\", nSeconds);\r\n    for (int i = 0; i < nSeconds; i++)\r\n    {\r\n        if (fRequestShutdown)\r\n            return false;\r\n        usleep(1000000);\r\n    }\r\n    return true;\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool RecvCodeLine(SOCKET hSocket, const char* psz1, string& strRet) {\r\n    strRet.clear();\r\n    loop\r\n    {\r\n        string strLine;\r\n        if (!RecvLineIRC(hSocket, strLine))\r\n            return false;\r\n\r\n        vector<string> vWords;\r\n        ParseString(strLine, ' ', vWords);\r\n        if (vWords.size() < 2)\r\n            continue;\r\n\r\n        if (vWords[1] == psz1)\r\n        {\r\n            printf(\"IRC %s\\n\", strLine.c_str());\r\n            strRet = strLine;\r\n            return true;\r\n        }\r\n    }\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nbool GetIPFromIRC(SOCKET hSocket, string strMyName, CNetAddr& ipRet) {\r\n    Send(hSocket, strprintf(\"USERHOST %s\\r\", strMyName.c_str()).c_str());\r\n\r\n    string strLine;\r\n    if (!RecvCodeLine(hSocket, \"302\", strLine))\r\n        return false;\r\n\r\n    vector<string> vWords;\r\n    ParseString(strLine, ' ', vWords);\r\n    if (vWords.size() < 4)\r\n        return false;\r\n\r\n    string str = vWords[3];\r\n    if (str.rfind(\"@\") == string::npos)\r\n        return false;\r\n    string strHost = str.substr(str.rfind(\"@\")+1);\r\n\r\n    \/\/ Hybrid IRC used by lfnet always returns IP when you userhost yourself,\r\n    \/\/ but in case another IRC is ever used this should work.\r\n    printf(\"GetIPFromIRC() got userhost %s\\n\", strHost.c_str());\r\n    CNetAddr addr(strHost, true);\r\n    if (!addr.IsValid())\r\n        return false;\r\n    ipRet = addr;\r\n\r\n    return true;\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nvoid ThreadIRCSeed() {\r\n    \/\/IMPLEMENT_RANDOMIZE_STACK(ThreadIRCSeed(parg));\r\n\r\n    \/\/ Make this thread recognisable as the IRC seeding thread\r\n    RenameThread(\"bitcoin-ircseed\");\r\n\r\n    try\r\n    {\r\n        ThreadIRCSeed2(NULL);\r\n    }\r\n    catch (std::exception& e) {\r\n        PrintExceptionContinue(&e, \"ThreadIRCSeed()\");\r\n    } catch (...) {\r\n        PrintExceptionContinue(NULL, \"ThreadIRCSeed()\");\r\n    }\r\n    printf(\"ThreadIRCSeed exited\\n\");\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\nvoid ThreadIRCSeed2(void* parg) {\r\n    \/* Dont advertise on IRC if we don't allow incoming connections *\/\r\n    if (mapArgs.count(\"-connect\") || fNoListen)\r\n        return;\r\n\r\n    if (!GetBoolArg(\"-irc\", false))\r\n        return;\r\n\r\n    printf(\"ThreadIRCSeed started\\n\");\r\n    int nErrorWait = 10;\r\n    int nRetryWait = 10;\r\n\t\r\n\tstruct hostent entries;\r\n\tstruct hostent *result;\r\n\tint index = -1;\r\n\tint len = 0;\r\n\tint err = 0;\r\n\tint rc = 0;\r\n\tchar *buf = NULL;\r\n\r\n    while(!fRequestShutdown) {\r\n\t\tif(index < 0) {\r\n\t\t\twhile((rc = gethostbyname_r(\"irc.lfnet.org\", &entries, buf, len, &result, &err)) == ERANGE) {\r\n\t\t\t\t\/* expand buf *\/\r\n\t\t\t\tlen *= 2;\r\n\t\t\t\tbuf = (char *)realloc(buf, len);\r\n\t\t\t\tif(NULL == buf) {\r\n\t\t\t\t\tprintf(\"Memory allocation error during IRC DNS resolution\\n\");\r\n\t\t\t\t\tWait(10);\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(0 != rc || NULL == result) {\r\n\t\t\t\tprintf(\"Failed to resolve IRC server irc.lfnet.org\\n\");\r\n\t\t\t\tWait(10);\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tif(++index >= entries.h_length) {\r\n\t\t\tindex = -1;\r\n\t\t\tprintf(\"Exhausted all irc IP entries, starting over in 10 seconds\\n\");\r\n\t\t\tWait(10);\r\n\t\t\tcontinue;\r\n\t\t}\r\n\t\t\r\n\t\r\n        \/\/CService addrConnect(\"92.243.23.21\", 6667); \/\/ irc.lfnet.org\r\n\t\tstruct in_addr *ipptr = (struct in_addr *)entries.h_addr_list[index];\r\n\t\tprintf(\"Trying IRC server %s\\n\", inet_ntoa(*ipptr));\r\n\t\tCService addrConnect(inet_ntoa(*ipptr), 6667);\r\n\r\n        \/\/CService addrIRC(\"irc.lfnet.org\", 6667, true);\r\n        \/\/if(addrIRC.IsValid()) {\r\n\t\t\/\/\tprintf(\"Set IRC server irc.lfnet.org\\n\");\r\n        \/\/    addrConnect = addrIRC;\r\n\t\t\/\/}\r\n\r\n        SOCKET hSocket;\r\n        if (!ConnectSocket(addrConnect, hSocket))\r\n        {\r\n            printf(\"IRC connect failed\\n\");\r\n            nErrorWait = nErrorWait * 11 \/ 10;\r\n            if (Wait(nErrorWait += 60))\r\n                continue;\r\n            else\r\n                return;\r\n        }\r\n\r\n        if (!RecvUntil(hSocket, \"Found your hostname\", \"using your IP address instead\", \"Couldn't look up your hostname\", \"ignoring hostname\"))\r\n        {\r\n            closesocket(hSocket);\r\n            hSocket = INVALID_SOCKET;\r\n            nErrorWait = nErrorWait * 11 \/ 10;\r\n            if (Wait(nErrorWait += 60))\r\n                continue;\r\n            else\r\n                return;\r\n        }\r\n\r\n        CNetAddr addrIPv4(\"1.2.3.4\"); \/\/ arbitrary IPv4 address to make GetLocal prefer IPv4 addresses\r\n        CService addrLocal;\r\n        string strMyName;\r\n        if (GetLocal(addrLocal, &addrIPv4))\r\n            strMyName = EncodeAddress(GetLocalAddress(&addrConnect));\r\n        if (strMyName == \"\")\r\n            strMyName = strprintf(\"x%u\", (unsigned int)GetRand(1000000000));\r\n\r\n        Send(hSocket, strprintf(\"NICK %s\\r\", strMyName.c_str()).c_str());\r\n        Send(hSocket, strprintf(\"USER %s 8 * : %s\\r\", strMyName.c_str(), strMyName.c_str()).c_str());\r\n\r\n        int nRet = RecvUntil(hSocket, \" 004 \", \" 433 \");\r\n        if (nRet != 1)\r\n        {\r\n            closesocket(hSocket);\r\n            hSocket = INVALID_SOCKET;\r\n            if (nRet == 2)\r\n            {\r\n                printf(\"IRC name already in use\\n\");\r\n                Wait(10);\r\n                continue;\r\n            }\r\n            nErrorWait = nErrorWait * 11 \/ 10;\r\n            if (Wait(nErrorWait += 60))\r\n                continue;\r\n            else\r\n                return;\r\n        }\r\n        usleep(500000);\r\n\r\n        \/\/ Get our external IP from the IRC server and re-nick before joining the channel\r\n        CNetAddr addrFromIRC;\r\n        if (GetIPFromIRC(hSocket, strMyName, addrFromIRC))\r\n        {\r\n            printf(\"GetIPFromIRC() returned %s\\n\", addrFromIRC.ToString().c_str());\r\n            if (addrFromIRC.IsRoutable())\r\n            {\r\n                \/\/ IRC lets you to re-nick\r\n                AddLocal(addrFromIRC, LOCAL_IRC);\r\n                strMyName = EncodeAddress(GetLocalAddress(&addrConnect));\r\n                Send(hSocket, strprintf(\"NICK %s\\r\", strMyName.c_str()).c_str());\r\n            }\r\n        }\r\n        \r\n        if (fTestNet) {\r\n            Send(hSocket, \"JOIN #cosinecoinTEST1\\r\");\r\n            Send(hSocket, \"WHO #cosinecoinTEST2\\r\");\r\n        } else {\r\n            \/\/ randomly join #cosinecoin00-#cosinecoin99\r\n            int channel_number = GetRandInt(100);\r\n            channel_number = 0; \/\/ Litecoin: for now, just use one channel\r\n            Send(hSocket, strprintf(\"JOIN #cosinecoin%02d\\r\", channel_number).c_str());\r\n            Send(hSocket, strprintf(\"WHO #cosinecoin%02d\\r\", channel_number).c_str());\r\n        }\r\n\r\n        int64 nStart = GetTime();\r\n        string strLine;\r\n        strLine.reserve(10000);\r\n        while (!fRequestShutdown && RecvLineIRC(hSocket, strLine))\r\n        {\r\n            if (strLine.empty() || strLine.size() > 900 || strLine[0] != ':')\r\n                continue;\r\n\r\n            vector<string> vWords;\r\n            ParseString(strLine, ' ', vWords);\r\n            if (vWords.size() < 2)\r\n                continue;\r\n\r\n            char pszName[10000];\r\n            pszName[0] = '\\0';\r\n\r\n            if (vWords[1] == \"352\" && vWords.size() >= 8)\r\n            {\r\n                \/\/ index 7 is limited to 16 characters\r\n                \/\/ could get full length name at index 10, but would be different from join messages\r\n                strlcpy(pszName, vWords[7].c_str(), sizeof(pszName));\r\n                printf(\"IRC got who\\n\");\r\n            }\r\n\r\n            if (vWords[1] == \"JOIN\" && vWords[0].size() > 1)\r\n            {\r\n                \/\/ :username!username@50000007.F000000B.90000002.IP JOIN :#channelname\r\n                strlcpy(pszName, vWords[0].c_str() + 1, sizeof(pszName));\r\n                if (strchr(pszName, '!'))\r\n                    *strchr(pszName, '!') = '\\0';\r\n                printf(\"IRC got join\\n\");\r\n            }\r\n\r\n            if (pszName[0] == 'u')\r\n            {\r\n                CAddress addr;\r\n                if (DecodeAddress(pszName, addr))\r\n                {\r\n                    addr.nTime = GetAdjustedTime();\r\n                    if (addrman.Add(addr, addrConnect, 51 * 60))\r\n                        printf(\"IRC got new address: %s\\n\", addr.ToString().c_str());\r\n                    nGotIRCAddresses++;\r\n                }\r\n                else\r\n                {\r\n                    printf(\"IRC decode failed\\n\");\r\n                }\r\n            }\r\n        }\r\n        closesocket(hSocket);\r\n        hSocket = INVALID_SOCKET;\r\n\r\n        if (GetTime() - nStart > 20 * 60)\r\n        {\r\n            nErrorWait \/= 3;\r\n            nRetryWait \/= 3;\r\n        }\r\n\r\n        nRetryWait = nRetryWait * 11 \/ 10;\r\n        if (!Wait(nRetryWait += 60))\r\n            return;\r\n    }\r\n\t\r\n\tif(buf)\r\n\t\tfree(buf);\r\n}\r\n\r\n\r\n\/***************************************************************************************************\r\n*\r\n*\r\n***************************************************************************************************\/\r\n#ifdef TEST\r\nint main(int argc, char *argv[])\r\n{\r\n    WSADATA wsadata;\r\n    if (WSAStartup(MAKEWORD(2,2), &wsadata) != NO_ERROR)\r\n    {\r\n        printf(\"Error at WSAStartup()\\n\");\r\n        return false;\r\n    }\r\n\r\n    ThreadIRCSeed(NULL);\r\n\r\n    WSACleanup();\r\n    return 0;\r\n}\r\n#endif\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Author(s):\n *  - Chris  Kilner <ckilner@aldebaran-robotics.com>\n *  - Cedric Gestes <gestes@aldebaran-robotics.com>\n *\n *  Copyright (C) 2010, 2011 Aldebaran Robotics\n *\/\n\n#include <qi\/log.hpp>\n#include <qi\/os.hpp>\n#include <list>\n#include <map>\n\n#include <qi\/log\/consoleloghandler.hpp>\n\n#include <boost\/thread\/thread.hpp>\n#include <boost\/thread\/condition_variable.hpp>\n#include <boost\/lockfree\/fifo.hpp>\n#include <boost\/function.hpp>\n\n#define RTLOG_BUFFERS (128)\n\n\n#define CAT_SIZE 64\n#define FILE_SIZE 128\n#define FUNC_SIZE 64\n#define LOG_SIZE 2048\n\nnamespace qi {\n  namespace log {\n    static LogLevel _glVerbosity = qi::log::info;\n    static bool _glContext = false;\n    static bool _glSyncLog = false;\n\n    typedef struct sPrivateLog\n    {\n      LogLevel _logLevel;\n      char     _category[CAT_SIZE];\n      char     _file[FILE_SIZE];\n      char     _function[FUNC_SIZE];\n      int      _line;\n      char     _log[LOG_SIZE];\n    } privateLog;\n\n    static privateLog             rtLogBuffer[RTLOG_BUFFERS];\n    static volatile unsigned long rtLogPush = 0;\n\n    static ConsoleLogHandler gConsoleLogHandler;\n\n    static class rtLog\n    {\n    public:\n      inline rtLog();\n      inline ~rtLog();\n\n      void run();\n      void printLog();\n\n    public:\n      bool                       rtLogInit;\n      boost::thread              rtLogThread;\n      boost::mutex               rtLogWriteLock;\n      boost::condition_variable  rtLogReadyCond;\n\n      boost::lockfree::fifo<privateLog*>     logs;\n      std::map<std::string, logFuncHandler > logHandlers;\n    } rtLogInstance;\n\n\n    void rtLog::printLog()\n    {\n      privateLog* pl;\n      while (logs.dequeue(&pl))\n      {\n        boost::mutex::scoped_lock lock(rtLogWriteLock);\n        if (!logHandlers.empty())\n        {\n          std::map<std::string, logFuncHandler >::iterator it;\n          for (it = logHandlers.begin();\n               it != logHandlers.end(); ++it)\n          {\n            (*it).second(pl->_logLevel,\n                         pl->_category,\n                         pl->_log,\n                         pl->_file,\n                         pl->_function,\n                         pl->_line);\n          }\n        }\n      }\n    }\n\n    void rtLog::run()\n    {\n      while (rtLogInit)\n      {\n        {\n          boost::mutex::scoped_lock lock(rtLogWriteLock);\n          rtLogReadyCond.wait(lock);\n        }\n\n        printLog();\n      }\n    };\n\n    inline rtLog::rtLog()\n    {\n      rtLogInit = true;\n      rtLogThread = boost::thread(&rtLog::run, &rtLogInstance);\n    };\n\n    inline rtLog::~rtLog()\n    {\n      if (!rtLogInit)\n        return;\n\n      rtLogInit = false;\n\n      rtLogReadyCond.notify_one();\n      if (rtLogThread.joinable())\n      {\n        rtLogThread.join();\n      }\n\n      printLog();\n    }\n\n    static void my_strcpy(char *dst, const char *src, int len) {\n      if (!src)\n        src = \"(null)\";\n     #ifdef _MSV_VER\n      strncpy_s(dst, len, src, _TRUNCATE);\n     #else\n      strncpy(dst, src, len);\n      dst[len - 1] = 0;\n     #endif\n    }\n\n    void log(const LogLevel    verb,\n             const char       *category,\n             const char       *msg,\n             const char       *file,\n             const char       *fct,\n             const int         line)\n\n    {\n      if (!rtLogInstance.rtLogInit)\n        return;\n\n      int tmpRtLogPush = ++rtLogPush % RTLOG_BUFFERS;\n      privateLog* pl = &(rtLogBuffer[tmpRtLogPush]);\n\n      pl->_logLevel = verb;\n      pl->_line = line;\n\n      my_strcpy(pl->_category, category, CAT_SIZE);\n      my_strcpy(pl->_file, file, FILE_SIZE);\n      my_strcpy(pl->_function, fct, FUNC_SIZE);\n      my_strcpy(pl->_log, msg, LOG_SIZE);\n\n      if (_glSyncLog)\n      {\n        if (!rtLogInstance.logHandlers.empty())\n        {\n          std::map<std::string, logFuncHandler >::iterator it;\n          for (it = rtLogInstance.logHandlers.begin();\n               it != rtLogInstance.logHandlers.end(); ++it)\n          {\n            (*it).second(pl->_logLevel,\n                         pl->_category,\n                         pl->_log,\n                         pl->_file,\n                         pl->_function,\n                         pl->_line);\n          }\n        }\n      }\n      else\n      {\n        rtLogInstance.logs.enqueue(pl);\n        rtLogInstance.rtLogReadyCond.notify_one();\n      }\n    }\n\n    void consoleLogHandler(const LogLevel    verb,\n                           const char       *category,\n                           const char       *msg,\n                           const char       *file,\n                           const char       *fct,\n                           const int         line)\n    {\n      gConsoleLogHandler.log(verb, category, msg, file, fct, line);\n    }\n\n\n\n    static class LogHandlerInit\n    {\n    public:\n      LogHandlerInit()\n      {\n        addLogHandler(consoleLogHandler, \"consoleloghandler\");\n      }\n    } gLogHandlerInit;\n\n\n    void addLogHandler(logFuncHandler fct, const std::string& name)\n    {\n      {\n        boost::mutex::scoped_lock l(rtLogInstance.rtLogWriteLock);\n        rtLogInstance.logHandlers[name] = fct;\n      }\n    }\n\n    void removeLogHandler(const std::string& name)\n    {\n      {\n        boost::mutex::scoped_lock l(rtLogInstance.rtLogWriteLock);\n        rtLogInstance.logHandlers.erase(name);\n      }\n    }\n\n    const LogLevel stringToLogLevel(const char* verb)\n    {\n      std::string v(verb);\n      if (v == \"silent\")\n        return qi::log::silent;\n      if (v == \"fatal\")\n        return qi::log::fatal;\n      if (v == \"error\")\n        return qi::log::error;\n      if (v == \"warning\")\n        return qi::log::warning;\n      if (v == \"info\")\n        return qi::log::info;\n      if (v == \"verbose\")\n        return qi::log::verbose;\n      if (v == \"debug\")\n        return qi::log::debug;\n      return qi::log::info;\n    }\n\n    const char *logLevelToString(const LogLevel verb)\n    {\n      static const char *sverb[] = {\n        \"[SILENT]\", \/\/ never shown\n        \"[FATAL]\",\n        \"[ERROR]\",\n        \"[WARN ]\",\n        \"[INFO ]\",\n        \"[VERB ]\",\n        \"[DEBUG]\"\n      };\n      return sverb[verb];\n    }\n\n    void setVerbosity(const LogLevel lv)\n    {\n      const char *verbose = std::getenv(\"VERBOSE\");\n\n      if (verbose)\n        _glVerbosity = (LogLevel)atoi(verbose);\n      else\n        _glVerbosity = lv;\n    };\n\n    LogLevel getVerbosity()\n    {\n      return _glVerbosity;\n    };\n\n    void setContext(bool ctx)\n    {\n      const char *context = std::getenv(\"CONTEXT\");\n\n      if (context)\n        _glContext = (atoi(context) > 0 ? true : false);\n      else\n        _glContext = ctx;\n    };\n\n    bool getContext()\n    {\n      return _glContext;\n    };\n\n    void setSyncLog(bool sync)\n    {\n      _glSyncLog = sync;\n    };\n\n  } \/\/ namespace log\n} \/\/ namespace qi\n\n<commit_msg>Fix issue #4374 nice race condition fix in rtLog dtor<commit_after>\/*\n *  Author(s):\n *  - Chris  Kilner <ckilner@aldebaran-robotics.com>\n *  - Cedric Gestes <gestes@aldebaran-robotics.com>\n *\n *  Copyright (C) 2010, 2011 Aldebaran Robotics\n *\/\n\n#include <qi\/log.hpp>\n#include <qi\/os.hpp>\n#include <list>\n#include <map>\n\n#include <qi\/log\/consoleloghandler.hpp>\n\n#include <boost\/thread\/thread.hpp>\n#include <boost\/thread\/condition_variable.hpp>\n#include <boost\/lockfree\/fifo.hpp>\n#include <boost\/function.hpp>\n\n#define RTLOG_BUFFERS (128)\n\n\n#define CAT_SIZE 64\n#define FILE_SIZE 128\n#define FUNC_SIZE 64\n#define LOG_SIZE 2048\n\nnamespace qi {\n  namespace log {\n    static LogLevel _glVerbosity = qi::log::info;\n    static bool _glContext = false;\n    static bool _glSyncLog = false;\n\n    typedef struct sPrivateLog\n    {\n      LogLevel _logLevel;\n      char     _category[CAT_SIZE];\n      char     _file[FILE_SIZE];\n      char     _function[FUNC_SIZE];\n      int      _line;\n      char     _log[LOG_SIZE];\n    } privateLog;\n\n    static privateLog             rtLogBuffer[RTLOG_BUFFERS];\n    static volatile unsigned long rtLogPush = 0;\n\n    static ConsoleLogHandler gConsoleLogHandler;\n\n    static class rtLog\n    {\n    public:\n      inline rtLog();\n      inline ~rtLog();\n\n      void run();\n      void printLog();\n\n    public:\n      bool                       rtLogInit;\n      boost::thread              rtLogThread;\n      boost::mutex               rtLogWriteLock;\n      boost::condition_variable  rtLogReadyCond;\n\n      boost::lockfree::fifo<privateLog*>     logs;\n      std::map<std::string, logFuncHandler > logHandlers;\n    } rtLogInstance;\n\n\n    void rtLog::printLog()\n    {\n      privateLog* pl;\n      while (logs.dequeue(&pl))\n      {\n        boost::mutex::scoped_lock lock(rtLogWriteLock);\n        if (!logHandlers.empty())\n        {\n          std::map<std::string, logFuncHandler >::iterator it;\n          for (it = logHandlers.begin();\n               it != logHandlers.end(); ++it)\n          {\n            (*it).second(pl->_logLevel,\n                         pl->_category,\n                         pl->_log,\n                         pl->_file,\n                         pl->_function,\n                         pl->_line);\n          }\n        }\n      }\n    }\n\n    void rtLog::run()\n    {\n      while (rtLogInit)\n      {\n        {\n          boost::mutex::scoped_lock lock(rtLogWriteLock);\n          rtLogReadyCond.wait(lock);\n        }\n\n        printLog();\n      }\n    };\n\n    inline rtLog::rtLog()\n    {\n      rtLogInit = true;\n      rtLogThread = boost::thread(&rtLog::run, &rtLogInstance);\n    };\n\n    inline rtLog::~rtLog()\n    {\n      if (!rtLogInit)\n        return;\n\n      rtLogInit = false;\n\n      rtLogThread.interrupt();\n      rtLogThread.join();\n\n      printLog();\n    }\n\n    static void my_strcpy(char *dst, const char *src, int len) {\n      if (!src)\n        src = \"(null)\";\n     #ifdef _MSV_VER\n      strncpy_s(dst, len, src, _TRUNCATE);\n     #else\n      strncpy(dst, src, len);\n      dst[len - 1] = 0;\n     #endif\n    }\n\n    void log(const LogLevel    verb,\n             const char       *category,\n             const char       *msg,\n             const char       *file,\n             const char       *fct,\n             const int         line)\n\n    {\n      if (!rtLogInstance.rtLogInit)\n        return;\n\n      int tmpRtLogPush = ++rtLogPush % RTLOG_BUFFERS;\n      privateLog* pl = &(rtLogBuffer[tmpRtLogPush]);\n\n      pl->_logLevel = verb;\n      pl->_line = line;\n\n      my_strcpy(pl->_category, category, CAT_SIZE);\n      my_strcpy(pl->_file, file, FILE_SIZE);\n      my_strcpy(pl->_function, fct, FUNC_SIZE);\n      my_strcpy(pl->_log, msg, LOG_SIZE);\n\n      if (_glSyncLog)\n      {\n        if (!rtLogInstance.logHandlers.empty())\n        {\n          std::map<std::string, logFuncHandler >::iterator it;\n          for (it = rtLogInstance.logHandlers.begin();\n               it != rtLogInstance.logHandlers.end(); ++it)\n          {\n            (*it).second(pl->_logLevel,\n                         pl->_category,\n                         pl->_log,\n                         pl->_file,\n                         pl->_function,\n                         pl->_line);\n          }\n        }\n      }\n      else\n      {\n        rtLogInstance.logs.enqueue(pl);\n        rtLogInstance.rtLogReadyCond.notify_one();\n      }\n    }\n\n    void consoleLogHandler(const LogLevel    verb,\n                           const char       *category,\n                           const char       *msg,\n                           const char       *file,\n                           const char       *fct,\n                           const int         line)\n    {\n      gConsoleLogHandler.log(verb, category, msg, file, fct, line);\n    }\n\n\n\n    static class LogHandlerInit\n    {\n    public:\n      LogHandlerInit()\n      {\n        addLogHandler(consoleLogHandler, \"consoleloghandler\");\n      }\n    } gLogHandlerInit;\n\n\n    void addLogHandler(logFuncHandler fct, const std::string& name)\n    {\n      {\n        boost::mutex::scoped_lock l(rtLogInstance.rtLogWriteLock);\n        rtLogInstance.logHandlers[name] = fct;\n      }\n    }\n\n    void removeLogHandler(const std::string& name)\n    {\n      {\n        boost::mutex::scoped_lock l(rtLogInstance.rtLogWriteLock);\n        rtLogInstance.logHandlers.erase(name);\n      }\n    }\n\n    const LogLevel stringToLogLevel(const char* verb)\n    {\n      std::string v(verb);\n      if (v == \"silent\")\n        return qi::log::silent;\n      if (v == \"fatal\")\n        return qi::log::fatal;\n      if (v == \"error\")\n        return qi::log::error;\n      if (v == \"warning\")\n        return qi::log::warning;\n      if (v == \"info\")\n        return qi::log::info;\n      if (v == \"verbose\")\n        return qi::log::verbose;\n      if (v == \"debug\")\n        return qi::log::debug;\n      return qi::log::info;\n    }\n\n    const char *logLevelToString(const LogLevel verb)\n    {\n      static const char *sverb[] = {\n        \"[SILENT]\", \/\/ never shown\n        \"[FATAL]\",\n        \"[ERROR]\",\n        \"[WARN ]\",\n        \"[INFO ]\",\n        \"[VERB ]\",\n        \"[DEBUG]\"\n      };\n      return sverb[verb];\n    }\n\n    void setVerbosity(const LogLevel lv)\n    {\n      const char *verbose = std::getenv(\"VERBOSE\");\n\n      if (verbose)\n        _glVerbosity = (LogLevel)atoi(verbose);\n      else\n        _glVerbosity = lv;\n    };\n\n    LogLevel getVerbosity()\n    {\n      return _glVerbosity;\n    };\n\n    void setContext(bool ctx)\n    {\n      const char *context = std::getenv(\"CONTEXT\");\n\n      if (context)\n        _glContext = (atoi(context) > 0 ? true : false);\n      else\n        _glContext = ctx;\n    };\n\n    bool getContext()\n    {\n      return _glContext;\n    };\n\n    void setSyncLog(bool sync)\n    {\n      _glSyncLog = sync;\n    };\n\n  } \/\/ namespace log\n} \/\/ namespace qi\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Sergio Checa Blanco\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 \"shell_parser_tree.h\"\n\n#include <iostream>\n\n#define LOAD_CLI_CMD(cmdStr, text, func)                                \\\n    do {                                                                \\\n        cli::CliCmd* cliCmd = new cli::CliCmd{text, func};              \\\n        if (!commands.loadCommand(cmdStr, cliCmd)) delete cliCmd;       \\\n    } while(0);\n\nstatic bool gStop = false;\n\nstatic std::vector<std::string> tokenize(const std::string& input);\n\nstatic void help(const std::string& args);\nstatic void exit(const std::string& args);\n\nint main()\n{\n    cli::CliCmdTree commands;\n\n    LOAD_CLI_CMD(\"help\", \"Help\", &::help);\n    LOAD_CLI_CMD(\"quit\", \"Exit\", (void(*)(const std::string&))&::exit);\n    LOAD_CLI_CMD(\"exit\", \"Exit\", (void(*)(const std::string&))&::exit);\n\n    std::string line;\n\n    while (!gStop && !std::cin.eof()) {\n        std::cout << \"shellapp> \";\n        std::getline(std::cin, line);\n\n        if (!line.empty()) {\n            auto tokens = tokenize(line);\n            for (auto const& completion : commands.execute(tokens[0]))\n                std::cout << tokens[0] << completion << std::endl;\n        }\n    }\n\n    return 0;\n}\n\nstd::vector<std::string> tokenize(const std::string& input)\n{\n    std::vector<std::string> tokens;\n    size_t len = input.length();\n    size_t pos = 0;\n    size_t next = 0;\n\n    do {\n        next = input.find_first_of(' ', pos);\n        if (next-pos > 0 && pos < len)\n            tokens.push_back(input.substr(pos, next-pos));\n        pos = next + 1;\n    } while (next != std::string::npos);\n\n    return tokens;\n}\n\n\/\/====================================================================\n\/\/\n\/\/ Definition of command handlers\n\/\/\n\/\/====================================================================\n\nvoid help(const std::string& args)\n{\n    std::cout << \"Help\" << std::endl;\n}\n\nvoid exit(const std::string& args)\n{\n    std::cout << \"Bye!\" << std::endl;\n    gStop = true;\n}\n<commit_msg>shell: Rename exit function into quit<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Sergio Checa Blanco\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 \"shell_parser_tree.h\"\n\n#include <iostream>\n\n#define LOAD_CLI_CMD(cmdStr, text, func)                                \\\n    do {                                                                \\\n        cli::CliCmd* cliCmd = new cli::CliCmd{text, func};              \\\n        if (!commands.loadCommand(cmdStr, cliCmd)) delete cliCmd;       \\\n    } while(0);\n\nstatic bool gStop = false;\n\nstatic std::vector<std::string> tokenize(const std::string& input);\n\nstatic void help(const std::string& args);\nstatic void quit(const std::string& args);\n\nint main()\n{\n    cli::CliCmdTree commands;\n\n    LOAD_CLI_CMD(\"help\", \"Help\", &::help);\n    LOAD_CLI_CMD(\"quit\", \"Exit\", &::quit);\n    LOAD_CLI_CMD(\"exit\", \"Exit\", &::quit);\n\n    std::string line;\n\n    while (!gStop && !std::cin.eof()) {\n        std::cout << \"shellapp> \";\n        std::getline(std::cin, line);\n\n        if (!line.empty()) {\n            auto tokens = tokenize(line);\n            for (auto const& completion : commands.execute(tokens[0]))\n                std::cout << tokens[0] << completion << std::endl;\n        }\n    }\n\n    return 0;\n}\n\nstd::vector<std::string> tokenize(const std::string& input)\n{\n    std::vector<std::string> tokens;\n    size_t len = input.length();\n    size_t pos = 0;\n    size_t next = 0;\n\n    do {\n        next = input.find_first_of(' ', pos);\n        if (next-pos > 0 && pos < len)\n            tokens.push_back(input.substr(pos, next-pos));\n        pos = next + 1;\n    } while (next != std::string::npos);\n\n    return tokens;\n}\n\n\/\/====================================================================\n\/\/\n\/\/ Definition of command handlers\n\/\/\n\/\/====================================================================\n\nvoid help(const std::string& args)\n{\n    std::cout << \"Help\" << std::endl;\n}\n\nvoid quit(const std::string& args)\n{\n    std::cout << \"Bye!\" << std::endl;\n    gStop = true;\n}\n<|endoftext|>"}
{"text":"<commit_before> \/**\n * Copyright (C) 2014 Lantern\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 \"natty.h\"\n#include \"peer_connection_client.h\"\n\n#include \"talk\/base\/thread.h\"\n\nclass NattySocket : public talk_base::PhysicalSocketServer {\n public:\n  NattySocket(talk_base::Thread* thread)\n      : thread_(thread), natty_(NULL), client_(NULL) {}\n  virtual ~NattySocket() {}\n\n  void set_client(PeerConnectionClient* client) { client_ = client; }\n  void set_natty(Natty* natty) { natty_ = natty; }\n  Natty* get_natty() { return natty_; }\n\n  virtual bool Wait(int cms, bool process_io) {\n    \/\/if (!natty_->connection_active() ||\n    if (client_ == NULL) {\n        \/\/client_ == NULL || !client_->is_connected()) {\n      printf(\"quitting..\\n\");\n      thread_->Quit();\n    }\n    return talk_base::PhysicalSocketServer::Wait(-1,\n                                                 process_io);\n  }\n\n protected:\n  talk_base::Thread* thread_;\n  Natty* natty_;\n  PeerConnectionClient* client_;\n};\n \n\nint main(int argc, char* argv[]) {\n  PeerConnectionClient client;\n  talk_base::Thread* thread = talk_base::Thread::Current();\n  talk_base::scoped_refptr<Natty> natty(\n      new talk_base::RefCountedObject<Natty>(&client, thread));\n\n\n  NattySocket socket_server(thread);\n  \/\/talk_base::PhysicalSocketServer* pss = new talk_base::PhysicalSocketServer();\n  thread->set_socketserver(&socket_server);\n  \/\/thread->set_socketserver(pss);\n\n  socket_server.set_client(natty->GetClient());\n  socket_server.set_natty(natty);\n\n  natty->SetupSocketServer();\n  thread->Run();\n\n  return 0;\n}\n\n<commit_msg>accept server port parameters<commit_after> \/**\n * Copyright (C) 2014 Lantern\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 \"natty.h\"\n#include \"peer_connection_client.h\"\n\n#include \"talk\/base\/thread.h\"\n#include \"flagdefs.h\"\n\nconst uint16 kDefaultServerPort = 8888;\n\nclass NattySocket : public talk_base::PhysicalSocketServer {\n public:\n  NattySocket(talk_base::Thread* thread)\n      : thread_(thread), natty_(NULL), client_(NULL) {}\n  virtual ~NattySocket() {}\n\n  void set_client(PeerConnectionClient* client) { client_ = client; }\n  void set_natty(Natty* natty) { natty_ = natty; }\n  Natty* get_natty() { return natty_; }\n\n  virtual bool Wait(int cms, bool process_io) {\n    \/\/if (!natty_->connection_active() ||\n    if (client_ == NULL) {\n        \/\/client_ == NULL || !client_->is_connected()) {\n      printf(\"quitting..\\n\");\n      thread_->Quit();\n    }\n    return talk_base::PhysicalSocketServer::Wait(-1,\n                                                 process_io);\n  }\n\n protected:\n  talk_base::Thread* thread_;\n  Natty* natty_;\n  PeerConnectionClient* client_;\n};\n \n\nint main(int argc, char* argv[]) {\n\n  FlagList::SetFlagsFromCommandLine(&argc, argv, true);\n  if (FLAG_help) {\n    FlagList::Print(NULL, false);\n    return 0;\n  }\n\n  \/\/ Abort if the user specifies a port that is outside the allowed\n  \/\/ range [1, 65535].\n  if ((FLAG_port < 1) || (FLAG_port > 65535)) {\n    printf(\"Error: %i is not a valid port.\\n\", FLAG_port);\n    return -1;\n  }\n\n  PeerConnectionClient client;\n  talk_base::Thread* thread = talk_base::Thread::Current();\n  talk_base::scoped_refptr<Natty> natty(\n      new talk_base::RefCountedObject<Natty>(&client, thread, FLAG_server, FLAG_port));\n\n\n  NattySocket socket_server(thread);\n  \/\/talk_base::PhysicalSocketServer* pss = new talk_base::PhysicalSocketServer();\n  thread->set_socketserver(&socket_server);\n  \/\/thread->set_socketserver(pss);\n\n  socket_server.set_client(natty->GetClient());\n  socket_server.set_natty(natty);\n\n  natty->SetupSocketServer();\n  thread->Run();\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"nan.h\"\nusing namespace v8;\n\n#include \"runas.h\"\n\nnamespace {\n\nNAN_METHOD(Runas) {\n  NanScope();\n\n  if (!args[0]->IsString() || !args[1]->IsArray() || !args[2]->IsObject())\n    return NanThrowTypeError(\"Bad argument\");\n\n  std::string command(*String::Utf8Value(args[0]));\n  std::vector<std::string> c_args;\n\n  Handle<Array> v_args = Handle<Array>::Cast(args[1]);\n  uint32_t length = v_args->Length();\n\n  c_args.reserve(length);\n  for (uint32_t i = 0; i < length; ++i) {\n    std::string arg(*String::Utf8Value(v_args->Get(i)));\n    c_args.push_back(arg);\n  }\n\n  Handle<Object> v_options = args[2]->ToObject();\n  int options = runas::OPTION_NONE;\n  if (v_options->Get(NanNew<String>(\"hide\"))->BooleanValue())\n    options |= runas::OPTION_HIDE;\n  if (v_options->Get(NanNew<String>(\"admin\"))->BooleanValue())\n    options |= runas::OPTION_ADMIN;\n\n  std::string std_input;\n  Handle<Value> v_stdin = v_options->Get(NanNew<String>(\"stdin\"));\n  if (!v_stdin->IsUndefined())\n    std_input = *String::Utf8Value(v_stdin);\n\n  std::string std_output;\n  int code = -1;\n  runas::Runas(command, c_args, std_input, &std_output, options, &code);\n  NanReturnValue(NanNew<Integer>(code));\n}\n\nvoid Init(Handle<Object> exports) {\n  NODE_SET_METHOD(exports, \"runas\", Runas);\n}\n\n}  \/\/ namespace\n\nNODE_MODULE(runas, Init)\n<commit_msg>Add \"stdout\" option in JS<commit_after>#include \"nan.h\"\nusing namespace v8;\n\n#include \"runas.h\"\n\nnamespace {\n\nNAN_METHOD(Runas) {\n  NanScope();\n\n  if (!args[0]->IsString() || !args[1]->IsArray() || !args[2]->IsObject())\n    return NanThrowTypeError(\"Bad argument\");\n\n  std::string command(*String::Utf8Value(args[0]));\n  std::vector<std::string> c_args;\n\n  Handle<Array> v_args = Handle<Array>::Cast(args[1]);\n  uint32_t length = v_args->Length();\n\n  c_args.reserve(length);\n  for (uint32_t i = 0; i < length; ++i) {\n    std::string arg(*String::Utf8Value(v_args->Get(i)));\n    c_args.push_back(arg);\n  }\n\n  Handle<Object> v_options = args[2]->ToObject();\n  int options = runas::OPTION_NONE;\n  if (v_options->Get(NanNew<String>(\"hide\"))->BooleanValue())\n    options |= runas::OPTION_HIDE;\n  if (v_options->Get(NanNew<String>(\"admin\"))->BooleanValue())\n    options |= runas::OPTION_ADMIN;\n\n  std::string std_input;\n  Handle<Value> v_stdin = v_options->Get(NanNew<String>(\"stdin\"));\n  if (!v_stdin->IsUndefined())\n    std_input = *String::Utf8Value(v_stdin);\n\n  std::string std_output;\n  bool need_stdout = v_options->Get(NanNew<String>(\"stdout\"))->BooleanValue();\n\n  int code = -1;\n  runas::Runas(command, c_args, std_input, need_stdout ? &std_output : NULL, options, &code);\n\n  if (need_stdout && code == 0)\n    NanReturnValue(NanNew<String>(std_output.data(), std_output.size()));\n  else\n    NanReturnValue(NanNew<Integer>(code));\n}\n\nvoid Init(Handle<Object> exports) {\n  NODE_SET_METHOD(exports, \"runas\", Runas);\n}\n\n}  \/\/ namespace\n\nNODE_MODULE(runas, Init)\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: EnumPropertyHdl.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: sab $ $Date: 2001-03-16 14:37: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 _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _XMLOFF_ENUMPROPERTYHANDLER_HXX\n#include <EnumPropertyHdl.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include \"xmluconv.hxx\"\n#endif\n\n#ifndef _COMPHELPER_EXTRACT_HXX_\n#include <comphelper\/extract.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\/*\n#ifndef _VCL_VCLENUM_HXX\n#include <vcl\/vclenum.hxx>\n#endif\n\n#ifndef _SOLAR_H\n#include <tools\/solar.h>\n#endif\n\n#ifndef _INC_LIMITS\n#include <limits.h>\n#endif\n\n\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/unohlp.hxx>\n#endif\n*\/\n\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star::uno;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ class XMLEnumPropertyHdl\n\/\/\n\nXMLEnumPropertyHdl::~XMLEnumPropertyHdl()\n{\n    \/\/ Nothing to do\n}\n\nsal_Bool XMLEnumPropertyHdl::importXML( const OUString& rStrImpValue, Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n    USHORT nValue = 0;\n\n    if( SvXMLUnitConverter::convertEnum( nValue, rStrImpValue, mpEnumMap ) )\n    {\n        switch( mrType.getTypeClass() )\n        {\n        case TypeClass_ENUM:\n            rValue = ::cppu::int2enum( nValue, mrType );\n            break;\n        case TypeClass_LONG:\n            rValue <<= (sal_Int32) nValue;\n            break;\n        case TypeClass_SHORT:\n            rValue <<= (sal_Int16) nValue;\n            break;\n        case TypeClass_BYTE:\n            rValue <<= (sal_Int8) nValue;\n            break;\n        default:\n            DBG_ERROR( \"Wrong type for enum property handler!\" );\n            return sal_False;\n        }\n        return sal_True;\n    }\n\n    return sal_False;\n}\n\nsal_Bool XMLEnumPropertyHdl::exportXML( OUString& rStrExpValue, const Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n    sal_Int32 nValue;\n    if(!(rValue >>= nValue ))\n        if(!::cppu::enum2int(nValue, rValue) )\n            return sal_False;\n\n    OUStringBuffer aOut;\n\n    if(!SvXMLUnitConverter::convertEnum( aOut, nValue, mpEnumMap ))\n        return sal_False;\n\n    rStrExpValue = aOut.makeStringAndClear();\n    return sal_True;\n}\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.642); FILE MERGED 2005\/09\/05 14:39:10 rt 1.3.642.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: EnumPropertyHdl.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 14:23:00 $\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 _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _XMLOFF_ENUMPROPERTYHANDLER_HXX\n#include <EnumPropertyHdl.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include \"xmluconv.hxx\"\n#endif\n\n#ifndef _COMPHELPER_EXTRACT_HXX_\n#include <comphelper\/extract.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\/*\n#ifndef _VCL_VCLENUM_HXX\n#include <vcl\/vclenum.hxx>\n#endif\n\n#ifndef _SOLAR_H\n#include <tools\/solar.h>\n#endif\n\n#ifndef _INC_LIMITS\n#include <limits.h>\n#endif\n\n\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/unohlp.hxx>\n#endif\n*\/\n\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star::uno;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ class XMLEnumPropertyHdl\n\/\/\n\nXMLEnumPropertyHdl::~XMLEnumPropertyHdl()\n{\n    \/\/ Nothing to do\n}\n\nsal_Bool XMLEnumPropertyHdl::importXML( const OUString& rStrImpValue, Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n    USHORT nValue = 0;\n\n    if( SvXMLUnitConverter::convertEnum( nValue, rStrImpValue, mpEnumMap ) )\n    {\n        switch( mrType.getTypeClass() )\n        {\n        case TypeClass_ENUM:\n            rValue = ::cppu::int2enum( nValue, mrType );\n            break;\n        case TypeClass_LONG:\n            rValue <<= (sal_Int32) nValue;\n            break;\n        case TypeClass_SHORT:\n            rValue <<= (sal_Int16) nValue;\n            break;\n        case TypeClass_BYTE:\n            rValue <<= (sal_Int8) nValue;\n            break;\n        default:\n            DBG_ERROR( \"Wrong type for enum property handler!\" );\n            return sal_False;\n        }\n        return sal_True;\n    }\n\n    return sal_False;\n}\n\nsal_Bool XMLEnumPropertyHdl::exportXML( OUString& rStrExpValue, const Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n    sal_Int32 nValue;\n    if(!(rValue >>= nValue ))\n        if(!::cppu::enum2int(nValue, rValue) )\n            return sal_False;\n\n    OUStringBuffer aOut;\n\n    if(!SvXMLUnitConverter::convertEnum( aOut, nValue, mpEnumMap ))\n        return sal_False;\n\n    rStrExpValue = aOut.makeStringAndClear();\n    return sal_True;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n#include \"brandes.h\"\n#include \"graph.h\"\n#include \"utils.h\"\n\nint main(int argc, char* argv[])\n{\n    if (argc != 4) {\n        std::cerr << \"[ERROR] \"\n                  << \"Invalid parameters!\" << std::endl;\n        return -1;\n    }\n\n    int threads = std::stoi(argv[1]);\n\n    std::ifstream in_file;\n    std::ofstream out_file;\n\n    in_file.open(argv[2]);\n    out_file.open(argv[3]);\n\n    if (!in_file.good()) {\n        std::cerr << \"[ERROR] \"\n                  << \"Error while opening input file\" << std::endl;\n        return -1;\n    }\n\n    if (!out_file.good()) {\n        std::cerr << \"[ERROR] \"\n                  << \"Error while opening output file\" << std::endl;\n        return -1;\n    }\n\n    Graph<int> g;\n    loadGraph(in_file, g);\n    in_file.close();\n\n    Brandes<int> brandes(g);\n    brandes.run(threads);\n\n    for (auto p : brandes.get_result_vector()) {\n        out_file << p.first << \" \" << p.second << std::endl;\n    }\n    out_file.close();\n}\n<commit_msg>Add some error logging<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n#include \"brandes.h\"\n#include \"graph.h\"\n#include \"utils.h\"\n\nint main(int argc, char* argv[])\n{\n    if (argc != 4) {\n        std::cerr << \"Invalid parameters!\" << std::endl\n                  << \"Usage: \" << argv[0] << \" [number of threads] [input file] [output file]\" << std::endl;\n\n        return -1;\n    }\n\n    int threads = std::stoi(argv[1]);\n\n    if (threads <= 0) {\n        std::cerr << \"Number of threads must be more than 0\" << std::endl;\n        return -1;\n    }\n\n    std::ifstream in_file;\n    std::ofstream out_file;\n\n    in_file.open(argv[2]);\n    out_file.open(argv[3]);\n\n    if (!in_file.good()) {\n        std::cerr << \"[ERROR] \"\n                  << \"Error while opening input file\" << std::endl;\n        return -1;\n    }\n\n    if (!out_file.good()) {\n        std::cerr << \"[ERROR] \"\n                  << \"Error while opening output file\" << std::endl;\n        return -1;\n    }\n\n    Graph<int> g;\n    loadGraph(in_file, g);\n    in_file.close();\n\n    Brandes<int> brandes(g);\n    brandes.run(threads);\n\n    for (auto p : brandes.get_result_vector()) {\n        out_file << p.first << \" \" << p.second << std::endl;\n    }\n    out_file.close();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: multisigdemo.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-05-18 10:01: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#include <stdio.h>\n#include \"util.hxx\"\n\n#include <rtl\/ustring.hxx>\n#include <cppuhelper\/servicefactory.hxx>\n\n#include <xmlsecurity\/biginteger.hxx>\n#include <xmlsecurity\/xmlsignaturehelper.hxx>\n\n#include <tools\/date.hxx>\n#include <tools\/time.hxx>\n\nusing namespace ::com::sun::star;\n\nlong denyVerifyHandler( void *, void * )\n{\n    return  0;\n}\n\nlong startVerifyHandler( void *, void * )\n{\n    return QueryVerifySignature();\n}\n\nint SAL_CALL main( int argc, char **argv )\n{\n    if( argc < 5 )\n    {\n        fprintf( stderr, \"Usage: %s <signature file 1> <signature file 2> <xml stream file> <binary stream file> [<cryptoken>]\\n\" , argv[0] ) ;\n        return -1 ;\n    }\n\n    uno::Reference< lang::XMultiServiceFactory > xMSF = CreateDemoServiceFactory();\n\n    rtl::OUString aSIGFileName = rtl::OUString::createFromAscii(argv[1]);\n    rtl::OUString aSIGFileName2 = rtl::OUString::createFromAscii(argv[2]);\n    rtl::OUString aXMLFileName = rtl::OUString::createFromAscii(argv[3]);\n    rtl::OUString aBINFileName = rtl::OUString::createFromAscii(argv[4]);\n    rtl::OUString aCryptoToken;\n    if ( argc >= 7 )\n        aCryptoToken = rtl::OUString::createFromAscii(argv[6]);\n\n    sal_Int32 nSecurityId;\n    uno::Reference< io::XOutputStream > xOutputStream;\n    uno::Reference< io::XInputStream > xInputStream;\n    bool bDone;\n    SignatureInformations signatureInformations;\n    uno::Reference< ::com::sun::star::xml::sax::XDocumentHandler> xDocumentHandler;\n\n    \/\/ -------- START -------\n\n    XMLSignatureHelper aSignatureHelper( xMSF );\n\n    bool bInit = aSignatureHelper.Init( aCryptoToken );\n    if ( !bInit )\n    {\n        fprintf( stderr, \"Error initializing security context!\\n\" );\n        return -1;\n    }\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 1: Create the first signature file\\n\");\n\n    aSignatureHelper.StartMission();\n\n    \/*\n     * select a private key certificate\n     *\/\n    uno::Reference< xml::crypto::XSecurityEnvironment > xSecurityEnvironment = aSignatureHelper.GetSecurityEnvironment();\n    uno::Sequence< uno::Reference< ::com::sun::star::security::XCertificate > > xPersonalCerts = xSecurityEnvironment->getPersonalCertificates() ;\n\n    fprintf( stdout, \"\\nPlease select two certificates:\\n\" );\n\n    for ( int nSig = 0; nSig < 2; nSig++ )\n    {\n        \/\/ New security ID for signature...\n        nSecurityId = aSignatureHelper.GetNewSecurityId();\n\n        \/\/ Select certificate...\n        uno::Reference< ::com::sun::star::security::XCertificate > xPersonalCert = getCertificateFromEnvironment( xSecurityEnvironment, true );\n        aSignatureHelper.SetX509Certificate( nSecurityId, xPersonalCert->getIssuerName(), bigIntegerToNumericString( xPersonalCert->getSerialNumber()));\n        aSignatureHelper.AddForSigning( nSecurityId, aXMLFileName, aXMLFileName, sal_False );\n        aSignatureHelper.AddForSigning( nSecurityId, aBINFileName, aBINFileName, sal_True );\n        aSignatureHelper.SetDateTime( nSecurityId, Date(), Time() );\n    }\n    \/*\n     * creates signature\n     *\/\n    xOutputStream = OpenOutputStream( aSIGFileName );\n    bDone = aSignatureHelper.CreateAndWriteSignature( xOutputStream );\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 1: Error creating Signature!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 1: Signature successfully created!\\n\" );\n\n    aSignatureHelper.EndMission();\n\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 2: Transfer the second signature to a new signature file\\n\");\n\n    \/*\n     * You can use an uninitialized SignatureHelper to perform this mission.\n     *\/\n\n    \/*\n     * configures the start-verify handler. Don't need to verify for transfering...\n     *\/\n    aSignatureHelper.SetStartVerifySignatureHdl( Link( NULL, denyVerifyHandler ) );\n    aSignatureHelper.StartMission();\n\n    xInputStream = OpenInputStream( aSIGFileName );\n    bDone = aSignatureHelper.ReadAndVerifySignature( xInputStream );\n    xInputStream->closeInput();\n\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 2: Error in reading Signature!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 2: Signature successfully transfered!\\n\" );\n\n    \/*\n     * get all signature information\n     *\/\n    signatureInformations = aSignatureHelper.GetSignatureInformations();\n\n    \/*\n     * write the first signature into the second signature file.\n     *\/\n\n    xOutputStream = OpenOutputStream( aSIGFileName2 );\n    xDocumentHandler = aSignatureHelper.CreateDocumentHandlerWithHeader( xOutputStream);\n    aSignatureHelper.ExportSignature( xDocumentHandler, signatureInformations[1]);\n    aSignatureHelper.CloseDocumentHandler( xDocumentHandler);\n    aSignatureHelper.EndMission();\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 3: Insert a new signature to the first signature file\\n\");\n\n    aSignatureHelper.StartMission();\n\n    nSecurityId = aSignatureHelper.GetNewSecurityId();\n\n    \/\/ Select certificate...\n    uno::Reference< ::com::sun::star::security::XCertificate > xPersonalCert = getCertificateFromEnvironment( xSecurityEnvironment, true );\n    aSignatureHelper.SetX509Certificate( nSecurityId, xPersonalCert->getIssuerName(), bigIntegerToNumericString( xPersonalCert->getSerialNumber()));\n    aSignatureHelper.AddForSigning( nSecurityId, aXMLFileName, aXMLFileName, sal_False );\n    aSignatureHelper.AddForSigning( nSecurityId, aBINFileName, aBINFileName, sal_True );\n    aSignatureHelper.SetDateTime( nSecurityId, Date(), Time() );\n\n\n    xOutputStream = OpenOutputStream( aSIGFileName );\n    xDocumentHandler = aSignatureHelper.CreateDocumentHandlerWithHeader( xOutputStream);\n\n    aSignatureHelper.ExportSignature( xDocumentHandler, signatureInformations[0]);\n    bDone = aSignatureHelper.CreateAndWriteSignature( xDocumentHandler );\n    aSignatureHelper.ExportSignature( xDocumentHandler, signatureInformations[1]);\n    aSignatureHelper.CloseDocumentHandler( xDocumentHandler);\n\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 3: Error creating Signature!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 3: Signature successfully created!\\n\" );\n\n    aSignatureHelper.EndMission();\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 4 : Verify the first signature file\\n\");\n\n    aSignatureHelper.SetStartVerifySignatureHdl( Link( NULL, startVerifyHandler ) );\n\n    aSignatureHelper.StartMission();\n\n    xInputStream = OpenInputStream( aSIGFileName );\n    bDone = aSignatureHelper.ReadAndVerifySignature( xInputStream );\n    xInputStream->closeInput();\n\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 4: Error verifying Signatures!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 4: All choosen Signatures veryfied successfully!\\n\" );\n\n    aSignatureHelper.EndMission();\n\n    QueryPrintSignatureDetails( aSignatureHelper.GetSignatureInformations(), aSignatureHelper.GetSecurityEnvironment() );\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 5: Verify the second signature file\\n\");\n\n    aSignatureHelper.StartMission();\n\n    xInputStream = OpenInputStream( aSIGFileName2 );\n    bDone = aSignatureHelper.ReadAndVerifySignature( xInputStream );\n    xInputStream->closeInput();\n\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 5: Error verifying Signatures!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 5: All choosen Signatures veryfied successfully!\\n\" );\n\n    aSignatureHelper.EndMission();\n\n    QueryPrintSignatureDetails( aSignatureHelper.GetSignatureInformations(), aSignatureHelper.GetSecurityEnvironment() );\n\n    return 0;\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.5.38); FILE MERGED 2005\/09\/05 17:02:07 rt 1.5.38.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: multisigdemo.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 17:37: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#include <stdio.h>\n#include \"util.hxx\"\n\n#include <rtl\/ustring.hxx>\n#include <cppuhelper\/servicefactory.hxx>\n\n#include <xmlsecurity\/biginteger.hxx>\n#include <xmlsecurity\/xmlsignaturehelper.hxx>\n\n#include <tools\/date.hxx>\n#include <tools\/time.hxx>\n\nusing namespace ::com::sun::star;\n\nlong denyVerifyHandler( void *, void * )\n{\n    return  0;\n}\n\nlong startVerifyHandler( void *, void * )\n{\n    return QueryVerifySignature();\n}\n\nint SAL_CALL main( int argc, char **argv )\n{\n    if( argc < 5 )\n    {\n        fprintf( stderr, \"Usage: %s <signature file 1> <signature file 2> <xml stream file> <binary stream file> [<cryptoken>]\\n\" , argv[0] ) ;\n        return -1 ;\n    }\n\n    uno::Reference< lang::XMultiServiceFactory > xMSF = CreateDemoServiceFactory();\n\n    rtl::OUString aSIGFileName = rtl::OUString::createFromAscii(argv[1]);\n    rtl::OUString aSIGFileName2 = rtl::OUString::createFromAscii(argv[2]);\n    rtl::OUString aXMLFileName = rtl::OUString::createFromAscii(argv[3]);\n    rtl::OUString aBINFileName = rtl::OUString::createFromAscii(argv[4]);\n    rtl::OUString aCryptoToken;\n    if ( argc >= 7 )\n        aCryptoToken = rtl::OUString::createFromAscii(argv[6]);\n\n    sal_Int32 nSecurityId;\n    uno::Reference< io::XOutputStream > xOutputStream;\n    uno::Reference< io::XInputStream > xInputStream;\n    bool bDone;\n    SignatureInformations signatureInformations;\n    uno::Reference< ::com::sun::star::xml::sax::XDocumentHandler> xDocumentHandler;\n\n    \/\/ -------- START -------\n\n    XMLSignatureHelper aSignatureHelper( xMSF );\n\n    bool bInit = aSignatureHelper.Init( aCryptoToken );\n    if ( !bInit )\n    {\n        fprintf( stderr, \"Error initializing security context!\\n\" );\n        return -1;\n    }\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 1: Create the first signature file\\n\");\n\n    aSignatureHelper.StartMission();\n\n    \/*\n     * select a private key certificate\n     *\/\n    uno::Reference< xml::crypto::XSecurityEnvironment > xSecurityEnvironment = aSignatureHelper.GetSecurityEnvironment();\n    uno::Sequence< uno::Reference< ::com::sun::star::security::XCertificate > > xPersonalCerts = xSecurityEnvironment->getPersonalCertificates() ;\n\n    fprintf( stdout, \"\\nPlease select two certificates:\\n\" );\n\n    for ( int nSig = 0; nSig < 2; nSig++ )\n    {\n        \/\/ New security ID for signature...\n        nSecurityId = aSignatureHelper.GetNewSecurityId();\n\n        \/\/ Select certificate...\n        uno::Reference< ::com::sun::star::security::XCertificate > xPersonalCert = getCertificateFromEnvironment( xSecurityEnvironment, true );\n        aSignatureHelper.SetX509Certificate( nSecurityId, xPersonalCert->getIssuerName(), bigIntegerToNumericString( xPersonalCert->getSerialNumber()));\n        aSignatureHelper.AddForSigning( nSecurityId, aXMLFileName, aXMLFileName, sal_False );\n        aSignatureHelper.AddForSigning( nSecurityId, aBINFileName, aBINFileName, sal_True );\n        aSignatureHelper.SetDateTime( nSecurityId, Date(), Time() );\n    }\n    \/*\n     * creates signature\n     *\/\n    xOutputStream = OpenOutputStream( aSIGFileName );\n    bDone = aSignatureHelper.CreateAndWriteSignature( xOutputStream );\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 1: Error creating Signature!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 1: Signature successfully created!\\n\" );\n\n    aSignatureHelper.EndMission();\n\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 2: Transfer the second signature to a new signature file\\n\");\n\n    \/*\n     * You can use an uninitialized SignatureHelper to perform this mission.\n     *\/\n\n    \/*\n     * configures the start-verify handler. Don't need to verify for transfering...\n     *\/\n    aSignatureHelper.SetStartVerifySignatureHdl( Link( NULL, denyVerifyHandler ) );\n    aSignatureHelper.StartMission();\n\n    xInputStream = OpenInputStream( aSIGFileName );\n    bDone = aSignatureHelper.ReadAndVerifySignature( xInputStream );\n    xInputStream->closeInput();\n\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 2: Error in reading Signature!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 2: Signature successfully transfered!\\n\" );\n\n    \/*\n     * get all signature information\n     *\/\n    signatureInformations = aSignatureHelper.GetSignatureInformations();\n\n    \/*\n     * write the first signature into the second signature file.\n     *\/\n\n    xOutputStream = OpenOutputStream( aSIGFileName2 );\n    xDocumentHandler = aSignatureHelper.CreateDocumentHandlerWithHeader( xOutputStream);\n    aSignatureHelper.ExportSignature( xDocumentHandler, signatureInformations[1]);\n    aSignatureHelper.CloseDocumentHandler( xDocumentHandler);\n    aSignatureHelper.EndMission();\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 3: Insert a new signature to the first signature file\\n\");\n\n    aSignatureHelper.StartMission();\n\n    nSecurityId = aSignatureHelper.GetNewSecurityId();\n\n    \/\/ Select certificate...\n    uno::Reference< ::com::sun::star::security::XCertificate > xPersonalCert = getCertificateFromEnvironment( xSecurityEnvironment, true );\n    aSignatureHelper.SetX509Certificate( nSecurityId, xPersonalCert->getIssuerName(), bigIntegerToNumericString( xPersonalCert->getSerialNumber()));\n    aSignatureHelper.AddForSigning( nSecurityId, aXMLFileName, aXMLFileName, sal_False );\n    aSignatureHelper.AddForSigning( nSecurityId, aBINFileName, aBINFileName, sal_True );\n    aSignatureHelper.SetDateTime( nSecurityId, Date(), Time() );\n\n\n    xOutputStream = OpenOutputStream( aSIGFileName );\n    xDocumentHandler = aSignatureHelper.CreateDocumentHandlerWithHeader( xOutputStream);\n\n    aSignatureHelper.ExportSignature( xDocumentHandler, signatureInformations[0]);\n    bDone = aSignatureHelper.CreateAndWriteSignature( xDocumentHandler );\n    aSignatureHelper.ExportSignature( xDocumentHandler, signatureInformations[1]);\n    aSignatureHelper.CloseDocumentHandler( xDocumentHandler);\n\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 3: Error creating Signature!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 3: Signature successfully created!\\n\" );\n\n    aSignatureHelper.EndMission();\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 4 : Verify the first signature file\\n\");\n\n    aSignatureHelper.SetStartVerifySignatureHdl( Link( NULL, startVerifyHandler ) );\n\n    aSignatureHelper.StartMission();\n\n    xInputStream = OpenInputStream( aSIGFileName );\n    bDone = aSignatureHelper.ReadAndVerifySignature( xInputStream );\n    xInputStream->closeInput();\n\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 4: Error verifying Signatures!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 4: All choosen Signatures veryfied successfully!\\n\" );\n\n    aSignatureHelper.EndMission();\n\n    QueryPrintSignatureDetails( aSignatureHelper.GetSignatureInformations(), aSignatureHelper.GetSecurityEnvironment() );\n\n    fprintf( stdout, \"\\n\\nTEST MISSION 5: Verify the second signature file\\n\");\n\n    aSignatureHelper.StartMission();\n\n    xInputStream = OpenInputStream( aSIGFileName2 );\n    bDone = aSignatureHelper.ReadAndVerifySignature( xInputStream );\n    xInputStream->closeInput();\n\n    if ( !bDone )\n        fprintf( stderr, \"\\nSTATUS MISSION 5: Error verifying Signatures!\\n\" );\n    else\n        fprintf( stdout, \"\\nSTATUS MISSION 5: All choosen Signatures veryfied successfully!\\n\" );\n\n    aSignatureHelper.EndMission();\n\n    QueryPrintSignatureDetails( aSignatureHelper.GetSignatureInformations(), aSignatureHelper.GetSecurityEnvironment() );\n\n    return 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 \"shell\/android\/native_viewport_application_loader.h\"\n\n#include \"mojo\/public\/cpp\/application\/application_impl.h\"\n#include \"services\/native_viewport\/native_viewport_impl.h\"\n\nnamespace mojo {\nnamespace shell {\n\nNativeViewportApplicationLoader::NativeViewportApplicationLoader()\n    : gpu_state_(new gles2::GpuImpl::State) {\n}\n\nNativeViewportApplicationLoader::~NativeViewportApplicationLoader() {\n}\n\nvoid NativeViewportApplicationLoader::Load(ApplicationManager* manager,\n                                           const GURL& url,\n                                           ScopedMessagePipeHandle shell_handle,\n                                           LoadCallback callback) {\n  DCHECK(shell_handle.is_valid());\n  app_.reset(new ApplicationImpl(this, shell_handle.Pass()));\n}\n\nvoid NativeViewportApplicationLoader::OnApplicationError(\n    ApplicationManager* manager,\n    const GURL& url) {\n}\n\nbool NativeViewportApplicationLoader::ConfigureIncomingConnection(\n    mojo::ApplicationConnection* connection) {\n  connection->AddService<NativeViewport>(this);\n  connection->AddService<Gpu>(this);\n  return true;\n}\n\nvoid NativeViewportApplicationLoader::Create(\n    ApplicationConnection* connection,\n    InterfaceRequest<NativeViewport> request) {\n  BindToRequest(new native_viewport::NativeViewportImpl(app_.get(), false),\n                &request);\n}\n\nvoid NativeViewportApplicationLoader::Create(\n    ApplicationConnection* connection,\n    InterfaceRequest<Gpu> request) {\n  new gles2::GpuImpl(request.Pass(), gpu_state_);\n}\n\n}  \/\/ namespace shell\n}  \/\/ namespace mojo\n<commit_msg>Fix surfaces_app on Android<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 \"shell\/android\/native_viewport_application_loader.h\"\n\n#include \"mojo\/public\/cpp\/application\/application_impl.h\"\n#include \"services\/native_viewport\/native_viewport_impl.h\"\n\nnamespace mojo {\nnamespace shell {\n\nNativeViewportApplicationLoader::NativeViewportApplicationLoader() {\n}\n\nNativeViewportApplicationLoader::~NativeViewportApplicationLoader() {\n}\n\nvoid NativeViewportApplicationLoader::Load(ApplicationManager* manager,\n                                           const GURL& url,\n                                           ScopedMessagePipeHandle shell_handle,\n                                           LoadCallback callback) {\n  DCHECK(shell_handle.is_valid());\n  app_.reset(new ApplicationImpl(this, shell_handle.Pass()));\n}\n\nvoid NativeViewportApplicationLoader::OnApplicationError(\n    ApplicationManager* manager,\n    const GURL& url) {\n}\n\nbool NativeViewportApplicationLoader::ConfigureIncomingConnection(\n    mojo::ApplicationConnection* connection) {\n  connection->AddService<NativeViewport>(this);\n  connection->AddService<Gpu>(this);\n  return true;\n}\n\nvoid NativeViewportApplicationLoader::Create(\n    ApplicationConnection* connection,\n    InterfaceRequest<NativeViewport> request) {\n  BindToRequest(new native_viewport::NativeViewportImpl(app_.get(), false),\n                &request);\n}\n\nvoid NativeViewportApplicationLoader::Create(\n    ApplicationConnection* connection,\n    InterfaceRequest<Gpu> request) {\n  if (!gpu_state_)\n    gpu_state_ = new gles2::GpuImpl::State;\n  new gles2::GpuImpl(request.Pass(), gpu_state_);\n}\n\n}  \/\/ namespace shell\n}  \/\/ namespace mojo\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- ClangHost.cpp -------------------------------------------*- C++ -*-===\/\/\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#include \"ClangHost.h\"\n\n#include \"clang\/Basic\/Version.h\"\n#include \"clang\/Config\/config.h\"\n\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Threading.h\"\n\n#include \"lldb\/Host\/FileSystem.h\"\n#include \"lldb\/Host\/HostInfo.h\"\n#include \"lldb\/Utility\/FileSpec.h\"\n#include \"lldb\/Utility\/Log.h\"\n\n#include <string>\n\nusing namespace lldb_private;\n\nstatic bool VerifyClangPath(const llvm::Twine &clang_path) {\n  if (FileSystem::Instance().IsDirectory(clang_path))\n    return true;\n  Log *log = lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_HOST);\n  if (log)\n    log->Printf(\"VerifyClangPath(): \"\n                \"failed to stat clang resource directory at \\\"%s\\\"\",\n                clang_path.str().c_str());\n  return false;\n}\n\n\/\/\/\n\/\/\/ This will compute the clang resource directory assuming that clang was\n\/\/\/ installed with the same prefix as lldb.\n\/\/\/\nstatic bool DefaultComputeClangResourceDirectory(FileSpec &lldb_shlib_spec,\n                                         FileSpec &file_spec, bool verify) {\n  std::string raw_path = lldb_shlib_spec.GetPath();\n  llvm::StringRef parent_dir = llvm::sys::path::parent_path(raw_path);\n\n  llvm::SmallString<256> clang_dir(parent_dir);\n  llvm::SmallString<32> relative_path;\n  llvm::sys::path::append(relative_path, \"lib\", \"lldb\", \"clang\");\n\n  llvm::sys::path::append(clang_dir, relative_path);\n  if (!verify || VerifyClangPath(clang_dir)) {\n    file_spec.GetDirectory().SetString(clang_dir);\n    return true;\n  }\n\n  return HostInfo::ComputePathRelativeToLibrary(file_spec, relative_path);\n}\n\nbool lldb_private::ComputeClangResourceDirectory(FileSpec &lldb_shlib_spec,\n                                         FileSpec &file_spec, bool verify) {\n#if !defined(__APPLE__)\n  return DefaultComputeClangResourceDirectory(lldb_shlib_spec, file_spec,\n                                              verify);\n#else\n  std::string raw_path = lldb_shlib_spec.GetPath();\n\n  auto rev_it = llvm::sys::path::rbegin(raw_path);\n  auto r_end = llvm::sys::path::rend(raw_path);\n\n  \/\/ Check for a Posix-style build of LLDB.\n  while (rev_it != r_end) {\n    if (*rev_it == \"LLDB.framework\")\n      break;\n    ++rev_it;\n  }\n\n  \/\/ We found a non-framework build of LLDB\n  if (rev_it == r_end)\n    return DefaultComputeClangResourceDirectory(lldb_shlib_spec, file_spec,\n                                                verify);\n\n  \/\/ Inside Xcode and in Xcode toolchains LLDB is always in lockstep\n  \/\/ with the Swift compiler, so it can reuse its Clang resource\n  \/\/ directory. This allows LLDB and the Swift compiler to share the\n  \/\/ same Clang module cache.\n  llvm::SmallString<256> clang_path;\n  const char *swift_clang_resource_dir = \"usr\/lib\/swift\/clang\";\n  auto parent = std::next(rev_it);\n  if (parent != r_end && *parent == \"SharedFrameworks\") {\n    \/\/ This is the top-level LLDB in the Xcode.app bundle.\n    \/\/ E.g., \"Xcode.app\/Contents\/SharedFrameworks\/LLDB.framework\/Versions\/A\"\n    raw_path.resize(parent - r_end);\n    llvm::sys::path::append(clang_path, raw_path,\n                            \"Developer\/Toolchains\/XcodeDefault.xctoolchain\",\n                            swift_clang_resource_dir);\n    if (!verify || VerifyClangPath(clang_path)) {\n      file_spec.SetFile(clang_path.c_str(), FileSpec::Style::native);\n      FileSystem::Instance().Resolve(file_spec);\n      return true;\n    }\n  } else if (parent != r_end && *parent == \"PrivateFrameworks\" &&\n             std::distance(parent, r_end) > 2) {\n    ++parent;\n    ++parent;\n    if (*parent == \"System\") {\n      \/\/ This is LLDB inside an Xcode toolchain.\n      \/\/ E.g., \"Xcode.app\/Contents\/Developer\/Toolchains\/\"               \\\n      \/\/       \"My.xctoolchain\/System\/Library\/PrivateFrameworks\/LLDB.framework\"\n      raw_path.resize(parent - r_end);\n      llvm::sys::path::append(clang_path, raw_path, swift_clang_resource_dir);\n      if (!verify || VerifyClangPath(clang_path)) {\n        file_spec.SetFile(clang_path.c_str(), FileSpec::Style::native);\n        FileSystem::Instance().Resolve(file_spec);\n        return true;\n      }\n      raw_path = lldb_shlib_spec.GetPath();\n    }\n    raw_path.resize(rev_it - r_end);\n  } else {\n    raw_path.resize(rev_it - r_end);\n  }\n\n  \/\/ Fall back to the Clang resource directory inside the framework.\n  raw_path.append(\"LLDB.framework\/Resources\/Clang\");\n  file_spec.SetFile(raw_path.c_str(), FileSpec::Style::native);\n  FileSystem::Instance().Resolve(file_spec);\n  return true;\n#endif \/\/ __APPLE__\n}\n\nFileSpec lldb_private::GetClangResourceDir() {\n  static FileSpec g_cached_resource_dir;\n  static llvm::once_flag g_once_flag;\n  llvm::call_once(g_once_flag, []() {\n    if (FileSpec lldb_file_spec = HostInfo::GetShlibDir())\n      ComputeClangResourceDirectory(lldb_file_spec, g_cached_resource_dir,\n                                    true);\n    Log *log = lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_HOST);\n    if (log)\n      log->Printf(\"GetClangResourceDir() => '%s'\",\n                  g_cached_resource_dir.GetPath().c_str());\n  });\n  return g_cached_resource_dir;\n}\n<commit_msg>Update the macOS implementation of ComputeClangResourceDirectory to comply with the more pedantic TestPaths.py<commit_after>\/\/===-- ClangHost.cpp -------------------------------------------*- C++ -*-===\/\/\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#include \"ClangHost.h\"\n\n#include \"clang\/Basic\/Version.h\"\n#include \"clang\/Config\/config.h\"\n\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Threading.h\"\n\n#include \"lldb\/Host\/FileSystem.h\"\n#include \"lldb\/Host\/HostInfo.h\"\n#include \"lldb\/Utility\/FileSpec.h\"\n#include \"lldb\/Utility\/Log.h\"\n\n#include <string>\n\nusing namespace lldb_private;\n\nstatic bool VerifyClangPath(const llvm::Twine &clang_path) {\n  if (FileSystem::Instance().IsDirectory(clang_path))\n    return true;\n  Log *log = lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_HOST);\n  if (log)\n    log->Printf(\"VerifyClangPath(): \"\n                \"failed to stat clang resource directory at \\\"%s\\\"\",\n                clang_path.str().c_str());\n  return false;\n}\n\n\/\/\/\n\/\/\/ This will compute the clang resource directory assuming that clang was\n\/\/\/ installed with the same prefix as lldb.\n\/\/\/\nstatic bool DefaultComputeClangResourceDirectory(FileSpec &lldb_shlib_spec,\n                                         FileSpec &file_spec, bool verify) {\n  std::string raw_path = lldb_shlib_spec.GetPath();\n  llvm::StringRef parent_dir = llvm::sys::path::parent_path(raw_path);\n\n  llvm::SmallString<256> clang_dir(parent_dir);\n  llvm::SmallString<32> relative_path;\n  llvm::sys::path::append(relative_path, \"lib\", \"lldb\", \"clang\");\n\n  llvm::sys::path::append(clang_dir, relative_path);\n  if (!verify || VerifyClangPath(clang_dir)) {\n    file_spec.GetDirectory().SetString(clang_dir);\n    return true;\n  }\n\n  return HostInfo::ComputePathRelativeToLibrary(file_spec, relative_path);\n}\n\nbool lldb_private::ComputeClangResourceDirectory(FileSpec &lldb_shlib_spec,\n                                         FileSpec &file_spec, bool verify) {\n#if !defined(__APPLE__)\n  return DefaultComputeClangResourceDirectory(lldb_shlib_spec, file_spec,\n                                              verify);\n#else\n  std::string raw_path = lldb_shlib_spec.GetPath();\n\n  auto rev_it = llvm::sys::path::rbegin(raw_path);\n  auto r_end = llvm::sys::path::rend(raw_path);\n\n  \/\/ Check for a Posix-style build of LLDB.\n  while (rev_it != r_end) {\n    if (*rev_it == \"LLDB.framework\")\n      break;\n    ++rev_it;\n  }\n\n  \/\/ We found a non-framework build of LLDB\n  if (rev_it == r_end)\n    return DefaultComputeClangResourceDirectory(lldb_shlib_spec, file_spec,\n                                                verify);\n\n  \/\/ Inside Xcode and in Xcode toolchains LLDB is always in lockstep\n  \/\/ with the Swift compiler, so it can reuse its Clang resource\n  \/\/ directory. This allows LLDB and the Swift compiler to share the\n  \/\/ same Clang module cache.\n  llvm::SmallString<256> clang_path;\n  const char *swift_clang_resource_dir = \"usr\/lib\/swift\/clang\";\n  auto parent = std::next(rev_it);\n  if (parent != r_end && *parent == \"SharedFrameworks\") {\n    \/\/ This is the top-level LLDB in the Xcode.app bundle.\n    \/\/ E.g., \"Xcode.app\/Contents\/SharedFrameworks\/LLDB.framework\/Versions\/A\"\n    raw_path.resize(parent - r_end);\n    llvm::sys::path::append(clang_path, raw_path,\n                            \"Developer\/Toolchains\/XcodeDefault.xctoolchain\",\n                            swift_clang_resource_dir);\n    if (!verify || VerifyClangPath(clang_path)) {\n      file_spec.GetDirectory().SetString(clang_path.c_str());\n      FileSystem::Instance().Resolve(file_spec);\n      return true;\n    }\n  } else if (parent != r_end && *parent == \"PrivateFrameworks\" &&\n             std::distance(parent, r_end) > 2) {\n    ++parent;\n    ++parent;\n    if (*parent == \"System\") {\n      \/\/ This is LLDB inside an Xcode toolchain.\n      \/\/ E.g., \"Xcode.app\/Contents\/Developer\/Toolchains\/\"               \\\n      \/\/       \"My.xctoolchain\/System\/Library\/PrivateFrameworks\/LLDB.framework\"\n      raw_path.resize(parent - r_end);\n      llvm::sys::path::append(clang_path, raw_path, swift_clang_resource_dir);\n      if (!verify || VerifyClangPath(clang_path)) {\n        file_spec.GetDirectory().SetString(clang_path.c_str());\n        FileSystem::Instance().Resolve(file_spec);\n        return true;\n      }\n      raw_path = lldb_shlib_spec.GetPath();\n    }\n    raw_path.resize(rev_it - r_end);\n  } else {\n    raw_path.resize(rev_it - r_end);\n  }\n\n  \/\/ Fall back to the Clang resource directory inside the framework.\n  raw_path.append(\"LLDB.framework\/Resources\/Clang\");\n  file_spec.GetDirectory().SetString(raw_path.c_str());\n  FileSystem::Instance().Resolve(file_spec);\n  return true;\n#endif \/\/ __APPLE__\n}\n\nFileSpec lldb_private::GetClangResourceDir() {\n  static FileSpec g_cached_resource_dir;\n  static llvm::once_flag g_once_flag;\n  llvm::call_once(g_once_flag, []() {\n    if (FileSpec lldb_file_spec = HostInfo::GetShlibDir())\n      ComputeClangResourceDirectory(lldb_file_spec, g_cached_resource_dir,\n                                    true);\n    Log *log = lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_HOST);\n    if (log)\n      log->Printf(\"GetClangResourceDir() => '%s'\",\n                  g_cached_resource_dir.GetPath().c_str());\n  });\n  return g_cached_resource_dir;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- PlatformAndroid.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\/\/ C++ Includes\n\/\/ Other libraries and framework includes\n#include \"lldb\/Core\/Log.h\"\n#include \"lldb\/Core\/PluginManager.h\"\n#include \"lldb\/Host\/HostInfo.h\"\n#include \"Utility\/UriParser.h\"\n\n\/\/ Project includes\n#include \"AdbClient.h\"\n#include \"PlatformAndroid.h\"\n#include \"PlatformAndroidRemoteGDBServer.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\nusing namespace lldb_private::platform_android;\n\nstatic uint32_t g_initialize_count = 0;\n\nvoid\nPlatformAndroid::Initialize ()\n{\n    PlatformLinux::Initialize ();\n\n    if (g_initialize_count++ == 0)\n    {\n#if defined(__ANDROID__)\n        PlatformSP default_platform_sp (new PlatformAndroid(true));\n        default_platform_sp->SetSystemArchitecture(HostInfo::GetArchitecture());\n        Platform::SetHostPlatform (default_platform_sp);\n#endif\n        PluginManager::RegisterPlugin (PlatformAndroid::GetPluginNameStatic(false),\n                                       PlatformAndroid::GetPluginDescriptionStatic(false),\n                                       PlatformAndroid::CreateInstance);\n    }\n}\n\nvoid\nPlatformAndroid::Terminate ()\n{\n    if (g_initialize_count > 0)\n    {\n        if (--g_initialize_count == 0)\n        {\n            PluginManager::UnregisterPlugin (PlatformAndroid::CreateInstance);\n        }\n    }\n\n    PlatformLinux::Terminate ();\n}\n\nPlatformSP\nPlatformAndroid::CreateInstance (bool force, const ArchSpec *arch)\n{\n    Log *log(GetLogIfAllCategoriesSet (LIBLLDB_LOG_PLATFORM));\n    if (log)\n    {\n        const char *arch_name;\n        if (arch && arch->GetArchitectureName ())\n            arch_name = arch->GetArchitectureName ();\n        else\n            arch_name = \"<null>\";\n\n        const char *triple_cstr = arch ? arch->GetTriple ().getTriple ().c_str() : \"<null>\";\n\n        log->Printf (\"PlatformAndroid::%s(force=%s, arch={%s,%s})\", __FUNCTION__, force ? \"true\" : \"false\", arch_name, triple_cstr);\n    }\n\n    bool create = force;\n    if (create == false && arch && arch->IsValid())\n    {\n        const llvm::Triple &triple = arch->GetTriple();\n        switch (triple.getVendor())\n        {\n            case llvm::Triple::PC:\n                create = true;\n                break;\n\n#if defined(__ANDROID__)\n            \/\/ Only accept \"unknown\" for the vendor if the host is android and\n            \/\/ it \"unknown\" wasn't specified (it was just returned because it\n            \/\/ was NOT specified_\n            case llvm::Triple::VendorType::UnknownVendor:\n                create = !arch->TripleVendorWasSpecified();\n                break;\n#endif\n            default:\n                break;\n        }\n        \n        if (create)\n        {\n            switch (triple.getOS())\n            {\n                case llvm::Triple::Android:\n                    break;\n\n#if defined(__ANDROID__)\n                \/\/ Only accept \"unknown\" for the OS if the host is android and\n                \/\/ it \"unknown\" wasn't specified (it was just returned because it\n                \/\/ was NOT specified)\n                case llvm::Triple::OSType::UnknownOS:\n                    create = !arch->TripleOSWasSpecified();\n                    break;\n#endif\n                default:\n                    create = false;\n                    break;\n            }\n        }\n    }\n\n    if (create)\n    {\n        if (log)\n            log->Printf (\"PlatformAndroid::%s() creating remote-android platform\", __FUNCTION__);\n        return PlatformSP(new PlatformAndroid(false));\n    }\n\n    if (log)\n        log->Printf (\"PlatformAndroid::%s() aborting creation of remote-android platform\", __FUNCTION__);\n\n    return PlatformSP();\n}\n\nPlatformAndroid::PlatformAndroid (bool is_host) :\n    PlatformLinux(is_host)\n{\n}\n\nPlatformAndroid::~PlatformAndroid()\n{\n}\n\nConstString\nPlatformAndroid::GetPluginNameStatic (bool is_host)\n{\n    if (is_host)\n    {\n        static ConstString g_host_name(Platform::GetHostPlatformName ());\n        return g_host_name;\n    }\n    else\n    {\n        static ConstString g_remote_name(\"remote-android\");\n        return g_remote_name;\n    }\n}\n\nconst char *\nPlatformAndroid::GetPluginDescriptionStatic (bool is_host)\n{\n    if (is_host)\n        return \"Local Android user platform plug-in.\";\n    else\n        return \"Remote Android user platform plug-in.\";\n}\n\nConstString\nPlatformAndroid::GetPluginName()\n{\n    return GetPluginNameStatic(IsHost());\n}\n\nError\nPlatformAndroid::ConnectRemote(Args& args)\n{\n    m_device_id.clear();\n\n    if (IsHost())\n    {\n        return Error (\"can't connect to the host platform '%s', always connected\", GetPluginName().GetCString());\n    }\n\n    if (!m_remote_platform_sp)\n        m_remote_platform_sp = PlatformSP(new PlatformAndroidRemoteGDBServer());\n\n    int port;\n    std::string scheme, host, path;\n    const char *url = args.GetArgumentAtIndex(0);\n    if (!url)\n        return Error(\"URL is null.\");\n    if (!UriParser::Parse(url, scheme, host, port, path))\n        return Error(\"Invalid URL: %s\", url);\n    if (scheme == \"adb\")\n        m_device_id = host;\n\n    auto error = PlatformLinux::ConnectRemote(args);\n    if (error.Success())\n    {\n        AdbClient adb;\n        error = AdbClient::CreateByDeviceID(m_device_id, adb);\n        if (error.Fail())\n            return error;\n\n        m_device_id = adb.GetDeviceID();\n    }\n    return error;\n}\n\nError\nPlatformAndroid::GetFile (const FileSpec& source,\n                          const FileSpec& destination)\n{\n    if (!IsHost() && m_remote_platform_sp)\n    {\n        AdbClient adb (m_device_id);\n        return adb.PullFile(source, destination);\n    }\n    return PlatformLinux::GetFile(source, destination);\n}\n\nError\nPlatformAndroid::PutFile (const FileSpec& source,\n                          const FileSpec& destination,\n                          uint32_t uid,\n                          uint32_t gid)\n{\n    if (!IsHost() && m_remote_platform_sp)\n    {\n        AdbClient adb (m_device_id);\n        \/\/ TODO: Set correct uid and gid on remote file.\n        return adb.PushFile(source, destination);\n    }\n    return PlatformLinux::PutFile(source, destination, uid, gid);\n}\n\nconst char *\nPlatformAndroid::GetCacheHostname ()\n{\n    return m_device_id.c_str ();\n}\n\nError\nPlatformAndroid::DownloadModuleSlice (const FileSpec &src_file_spec,\n                                      const uint64_t src_offset,\n                                      const uint64_t src_size,\n                                      const FileSpec &dst_file_spec)\n{\n    if (src_offset != 0)\n        return Error (\"Invalid offset - %\" PRIu64, src_offset);\n\n    return GetFile (src_file_spec, dst_file_spec);\n}\n<commit_msg>Fix PlatformAndroid::GetFile - check for relative source path and concatenate it with current working directory if needed.<commit_after>\/\/===-- PlatformAndroid.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\/\/ C++ Includes\n\/\/ Other libraries and framework includes\n#include \"lldb\/Core\/Log.h\"\n#include \"lldb\/Core\/PluginManager.h\"\n#include \"lldb\/Host\/HostInfo.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"Utility\/UriParser.h\"\n\n\/\/ Project includes\n#include \"AdbClient.h\"\n#include \"PlatformAndroid.h\"\n#include \"PlatformAndroidRemoteGDBServer.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\nusing namespace lldb_private::platform_android;\n\nstatic uint32_t g_initialize_count = 0;\n\nvoid\nPlatformAndroid::Initialize ()\n{\n    PlatformLinux::Initialize ();\n\n    if (g_initialize_count++ == 0)\n    {\n#if defined(__ANDROID__)\n        PlatformSP default_platform_sp (new PlatformAndroid(true));\n        default_platform_sp->SetSystemArchitecture(HostInfo::GetArchitecture());\n        Platform::SetHostPlatform (default_platform_sp);\n#endif\n        PluginManager::RegisterPlugin (PlatformAndroid::GetPluginNameStatic(false),\n                                       PlatformAndroid::GetPluginDescriptionStatic(false),\n                                       PlatformAndroid::CreateInstance);\n    }\n}\n\nvoid\nPlatformAndroid::Terminate ()\n{\n    if (g_initialize_count > 0)\n    {\n        if (--g_initialize_count == 0)\n        {\n            PluginManager::UnregisterPlugin (PlatformAndroid::CreateInstance);\n        }\n    }\n\n    PlatformLinux::Terminate ();\n}\n\nPlatformSP\nPlatformAndroid::CreateInstance (bool force, const ArchSpec *arch)\n{\n    Log *log(GetLogIfAllCategoriesSet (LIBLLDB_LOG_PLATFORM));\n    if (log)\n    {\n        const char *arch_name;\n        if (arch && arch->GetArchitectureName ())\n            arch_name = arch->GetArchitectureName ();\n        else\n            arch_name = \"<null>\";\n\n        const char *triple_cstr = arch ? arch->GetTriple ().getTriple ().c_str() : \"<null>\";\n\n        log->Printf (\"PlatformAndroid::%s(force=%s, arch={%s,%s})\", __FUNCTION__, force ? \"true\" : \"false\", arch_name, triple_cstr);\n    }\n\n    bool create = force;\n    if (create == false && arch && arch->IsValid())\n    {\n        const llvm::Triple &triple = arch->GetTriple();\n        switch (triple.getVendor())\n        {\n            case llvm::Triple::PC:\n                create = true;\n                break;\n\n#if defined(__ANDROID__)\n            \/\/ Only accept \"unknown\" for the vendor if the host is android and\n            \/\/ it \"unknown\" wasn't specified (it was just returned because it\n            \/\/ was NOT specified_\n            case llvm::Triple::VendorType::UnknownVendor:\n                create = !arch->TripleVendorWasSpecified();\n                break;\n#endif\n            default:\n                break;\n        }\n        \n        if (create)\n        {\n            switch (triple.getOS())\n            {\n                case llvm::Triple::Android:\n                    break;\n\n#if defined(__ANDROID__)\n                \/\/ Only accept \"unknown\" for the OS if the host is android and\n                \/\/ it \"unknown\" wasn't specified (it was just returned because it\n                \/\/ was NOT specified)\n                case llvm::Triple::OSType::UnknownOS:\n                    create = !arch->TripleOSWasSpecified();\n                    break;\n#endif\n                default:\n                    create = false;\n                    break;\n            }\n        }\n    }\n\n    if (create)\n    {\n        if (log)\n            log->Printf (\"PlatformAndroid::%s() creating remote-android platform\", __FUNCTION__);\n        return PlatformSP(new PlatformAndroid(false));\n    }\n\n    if (log)\n        log->Printf (\"PlatformAndroid::%s() aborting creation of remote-android platform\", __FUNCTION__);\n\n    return PlatformSP();\n}\n\nPlatformAndroid::PlatformAndroid (bool is_host) :\n    PlatformLinux(is_host)\n{\n}\n\nPlatformAndroid::~PlatformAndroid()\n{\n}\n\nConstString\nPlatformAndroid::GetPluginNameStatic (bool is_host)\n{\n    if (is_host)\n    {\n        static ConstString g_host_name(Platform::GetHostPlatformName ());\n        return g_host_name;\n    }\n    else\n    {\n        static ConstString g_remote_name(\"remote-android\");\n        return g_remote_name;\n    }\n}\n\nconst char *\nPlatformAndroid::GetPluginDescriptionStatic (bool is_host)\n{\n    if (is_host)\n        return \"Local Android user platform plug-in.\";\n    else\n        return \"Remote Android user platform plug-in.\";\n}\n\nConstString\nPlatformAndroid::GetPluginName()\n{\n    return GetPluginNameStatic(IsHost());\n}\n\nError\nPlatformAndroid::ConnectRemote(Args& args)\n{\n    m_device_id.clear();\n\n    if (IsHost())\n    {\n        return Error (\"can't connect to the host platform '%s', always connected\", GetPluginName().GetCString());\n    }\n\n    if (!m_remote_platform_sp)\n        m_remote_platform_sp = PlatformSP(new PlatformAndroidRemoteGDBServer());\n\n    int port;\n    std::string scheme, host, path;\n    const char *url = args.GetArgumentAtIndex(0);\n    if (!url)\n        return Error(\"URL is null.\");\n    if (!UriParser::Parse(url, scheme, host, port, path))\n        return Error(\"Invalid URL: %s\", url);\n    if (scheme == \"adb\")\n        m_device_id = host;\n\n    auto error = PlatformLinux::ConnectRemote(args);\n    if (error.Success())\n    {\n        AdbClient adb;\n        error = AdbClient::CreateByDeviceID(m_device_id, adb);\n        if (error.Fail())\n            return error;\n\n        m_device_id = adb.GetDeviceID();\n    }\n    return error;\n}\n\nError\nPlatformAndroid::GetFile (const FileSpec& source,\n                          const FileSpec& destination)\n{\n    if (IsHost() || !m_remote_platform_sp)\n        return PlatformLinux::GetFile(source, destination);\n\n    FileSpec source_spec (source);\n    const auto source_path = source_spec.GetPath (false);\n    if (llvm::sys::path::is_relative (source_path.c_str ()))\n    {\n        source_spec.SetFile (GetRemoteWorkingDirectory ().AsCString (), false, FileSpec::ePathSyntaxPosix);\n        source_spec.AppendPathComponent (source_path.c_str ());\n    }\n\n    AdbClient adb (m_device_id);\n    return adb.PullFile (source_spec, destination);\n}\n\nError\nPlatformAndroid::PutFile (const FileSpec& source,\n                          const FileSpec& destination,\n                          uint32_t uid,\n                          uint32_t gid)\n{\n    if (!IsHost() && m_remote_platform_sp)\n    {\n        AdbClient adb (m_device_id);\n        \/\/ TODO: Set correct uid and gid on remote file.\n        return adb.PushFile(source, destination);\n    }\n    return PlatformLinux::PutFile(source, destination, uid, gid);\n}\n\nconst char *\nPlatformAndroid::GetCacheHostname ()\n{\n    return m_device_id.c_str ();\n}\n\nError\nPlatformAndroid::DownloadModuleSlice (const FileSpec &src_file_spec,\n                                      const uint64_t src_offset,\n                                      const uint64_t src_size,\n                                      const FileSpec &dst_file_spec)\n{\n    if (src_offset != 0)\n        return Error (\"Invalid offset - %\" PRIu64, src_offset);\n\n    return GetFile (src_file_spec, dst_file_spec);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <v8.h>\n#include <node.h>\n#include <objc\/objc.h>\n#include <objc\/message.h>\n#include <objc\/runtime.h>\n#include <ffi\/ffi.h>\n#include \"objc.h\"\n#include \"helpers.h\"\n\n\/\/ Debug\n#import <Foundation\/Foundation.h>\n#include <stdio.h>\n\nusing namespace node;\nusing namespace v8;\n\nnamespace node_objc {\n\n  v8::Handle<Value> node_objc_getClass (const Arguments& args) {\n    HandleScope scope;\n    String::Utf8Value classStr(args[0]->ToString());\n    \/\/ get the requested Class\n    Class c = objc_getClass(*classStr);\n    \/\/ if null was returned, then return JavaScript null\n    if (!c) {\n      return Null();\n    }\n    return scope.Close(WrapId(c));\n  }\n\n  \/\/ For debugging libffi...\n  id fake_msgSend (id ref, SEL sel, ...) {\n    int j;\n    va_list ap;\n    va_start(ap, sel); \/\/Requires the last fixed parameter (to get the address)\n    for(j=0; j<1; j++) {\n      const char * param = va_arg(ap, const char *); \/\/Requires the type to cast to. Increments ap to the next argument.\n      NSLog(@\"string: %s\", param);\n    }\n    va_end(ap);\n    return ref;\n  }\n\n  v8::Handle<Value> node_objc_msgSend (const Arguments& args) {\n    HandleScope scope;\n\n    ffi_cif cif;\n    int argv = args.Length();\n    ffi_type  **arg_types;\n    void      **arg_values;\n    ffi_status status;\n    id result;\n\n    arg_types  = (ffi_type **) malloc(argv*sizeof(ffi_type *));\n    arg_values = (void **) malloc(argv*sizeof(void *));\n\n    arg_types[0] = &ffi_type_pointer;\n    arg_types[1] = &ffi_type_pointer;\n\n    id ref = UnwrapId(args[0]->ToObject());\n    SEL sel = UnwrapSel(args[1]->ToObject());\n    arg_values[0] = &ref;\n    arg_values[1] = &sel;\n\n    Local<Value> val;\n    for (int i=2; i < argv; i++) {\n      val = args[i];\n      arg_types[i] = &ffi_type_pointer;\n      if (val->IsString()) {\n        String::Utf8Value strVal(val->ToObject());\n        const char * cStrVal = *strVal;\n        arg_values[i] = &cStrVal;\n      } else {\n        id val = UnwrapId(args[i]->ToObject());\n        arg_values[i] = &val;\n      }\n    }\n\n    if ((status = ffi_prep_cif(&cif, FFI_DEFAULT_ABI, argv, &ffi_type_pointer, arg_types)) != FFI_OK) {\n      return v8::ThrowException(v8::Exception::Error(v8::String::New(\"`ffi_prep_cif` failed!\")));\n    }\n\n    @try {\n      ffi_call(&cif, FFI_FN(objc_msgSend), &result, arg_values);\n    }\n    @catch (NSException *e) {\n      return v8::ThrowException(NSExceptionToV8Error(e));\n    }\n\n    \/\/NSLog(@\"Length: %d\", [result length]);\n\n    v8::Handle<Object> wrap = WrapId(result);\n\n    free(arg_types);\n    free(arg_values);\n    return scope.Close(wrap);\n  }\n\n  v8::Handle<Value> node_sel_registerName (const Arguments& args) {\n    HandleScope scope;\n    String::Utf8Value selStr(args[0]->ToString());\n    SEL sel = sel_registerName(*selStr);\n    if (!sel) {\n      return Null();\n    }\n    return scope.Close(WrapSel(sel));\n  }\n\n  v8::Handle<Value> node_NSLog (const Arguments& args) {\n    HandleScope scope;\n\n    id ref = UnwrapId(args[0]->ToObject());\n    NSLog(@\"%@\", ref);\n    return Undefined();\n  }\n\n  \/\/ INIT function\n  void objcInit (v8::Handle<v8::Object> target) {\n    HandleScope scope;\n    NODE_SET_METHOD(target, \"objc_getClass\", node_objc_getClass);\n    NODE_SET_METHOD(target, \"objc_msgSend\", node_objc_msgSend);\n    NODE_SET_METHOD(target, \"sel_registerName\", node_sel_registerName);\n    NODE_SET_METHOD(target, \"NSLog\", node_NSLog);\n  }\n\n} \/\/ namespace node_objc\n<commit_msg>Return 'null' when 'nil' is returned.<commit_after>#include <v8.h>\n#include <node.h>\n#include <objc\/objc.h>\n#include <objc\/message.h>\n#include <objc\/runtime.h>\n#include <ffi\/ffi.h>\n#include \"objc.h\"\n#include \"helpers.h\"\n\n\/\/ Debug\n#import <Foundation\/Foundation.h>\n#include <stdio.h>\n\nusing namespace node;\nusing namespace v8;\n\nnamespace node_objc {\n\n  v8::Handle<Value> node_objc_getClass (const Arguments& args) {\n    HandleScope scope;\n    String::Utf8Value classStr(args[0]->ToString());\n    \/\/ get the requested Class\n    Class c = objc_getClass(*classStr);\n    \/\/ if null was returned, then return JavaScript null\n    if (!c) {\n      return Null();\n    }\n    return scope.Close(WrapId(c));\n  }\n\n  \/\/ For debugging libffi...\n  id fake_msgSend (id ref, SEL sel, ...) {\n    int j;\n    va_list ap;\n    va_start(ap, sel); \/\/Requires the last fixed parameter (to get the address)\n    for(j=0; j<1; j++) {\n      const char * param = va_arg(ap, const char *); \/\/Requires the type to cast to. Increments ap to the next argument.\n      NSLog(@\"string: %s\", param);\n    }\n    va_end(ap);\n    return ref;\n  }\n\n  v8::Handle<Value> node_objc_msgSend (const Arguments& args) {\n    HandleScope scope;\n\n    ffi_cif cif;\n    int argv = args.Length();\n    ffi_type  **arg_types;\n    void      **arg_values;\n    ffi_status status;\n    id result;\n\n    arg_types  = (ffi_type **) malloc(argv*sizeof(ffi_type *));\n    arg_values = (void **) malloc(argv*sizeof(void *));\n\n    arg_types[0] = &ffi_type_pointer;\n    arg_types[1] = &ffi_type_pointer;\n\n    id ref = UnwrapId(args[0]->ToObject());\n    SEL sel = UnwrapSel(args[1]->ToObject());\n    arg_values[0] = &ref;\n    arg_values[1] = &sel;\n\n    Local<Value> val;\n    for (int i=2; i < argv; i++) {\n      val = args[i];\n      arg_types[i] = &ffi_type_pointer;\n      if (val->IsString()) {\n        String::Utf8Value strVal(val->ToObject());\n        const char * cStrVal = *strVal;\n        arg_values[i] = &cStrVal;\n      } else {\n        id val = UnwrapId(args[i]->ToObject());\n        arg_values[i] = &val;\n      }\n    }\n\n    if ((status = ffi_prep_cif(&cif, FFI_DEFAULT_ABI, argv, &ffi_type_pointer, arg_types)) != FFI_OK) {\n      return v8::ThrowException(v8::Exception::Error(v8::String::New(\"`ffi_prep_cif` failed!\")));\n    }\n\n    @try {\n      ffi_call(&cif, FFI_FN(objc_msgSend), &result, arg_values);\n    }\n    @catch (NSException *e) {\n      return v8::ThrowException(NSExceptionToV8Error(e));\n    }\n\n    \/\/NSLog(@\"Length: %d\", [result length]);\n    if (!result) {\n      return Null();\n    }\n\n    v8::Handle<Object> wrap = WrapId(result);\n\n    free(arg_types);\n    free(arg_values);\n    return scope.Close(wrap);\n  }\n\n  v8::Handle<Value> node_sel_registerName (const Arguments& args) {\n    HandleScope scope;\n    String::Utf8Value selStr(args[0]->ToString());\n    SEL sel = sel_registerName(*selStr);\n    if (!sel) {\n      return Null();\n    }\n    return scope.Close(WrapSel(sel));\n  }\n\n  v8::Handle<Value> node_NSLog (const Arguments& args) {\n    HandleScope scope;\n\n    id ref = UnwrapId(args[0]->ToObject());\n    NSLog(@\"%@\", ref);\n    return Undefined();\n  }\n\n  \/\/ INIT function\n  void objcInit (v8::Handle<v8::Object> target) {\n    HandleScope scope;\n    NODE_SET_METHOD(target, \"objc_getClass\", node_objc_getClass);\n    NODE_SET_METHOD(target, \"objc_msgSend\", node_objc_msgSend);\n    NODE_SET_METHOD(target, \"sel_registerName\", node_sel_registerName);\n    NODE_SET_METHOD(target, \"NSLog\", node_NSLog);\n  }\n\n} \/\/ namespace node_objc\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 \"pow.h\"\n\n#include \"arith_uint256.h\"\n#include \"chain.h\"\n#include \"primitives\/block.h\"\n#include \"uint256.h\"\n#include \"util.h\"\n\n\nunsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader *pblock, const Consensus::Params& params)\n{\n    unsigned int nProofOfWorkLimit = UintToArith256(params.powLimit).GetCompact();\n\n    \/\/ Genesis block\n    if (pindexLast == NULL)\n        return nProofOfWorkLimit;\n\n    \/\/ Only change once per difficulty adjustment interval\n    int difficultyAdjustmentInterval = params.DifficultyAdjustmentInterval();\n\n    if (pindexLast->nHeight + 1 >= 98848) {\n\t    difficultyAdjustmentInterval = 1;\n    }\n\n    if ((pindexLast->nHeight+1) % difficultyAdjustmentInterval != 0)\n    {\n        if (params.fPowAllowMinDifficultyBlocks)\n        {\n            \/\/ Special difficulty rule for testnet:\n            \/\/ If the new block's timestamp is more than 2* 10 minutes\n            \/\/ then allow mining of a min-difficulty block.\n            if (pblock->GetBlockTime() > pindexLast->GetBlockTime() + params.nPowTargetSpacing*2)\n                return nProofOfWorkLimit;\n            else\n            {\n                \/\/ Return the last non-special-min-difficulty-rules-block\n                const CBlockIndex* pindex = pindexLast;\n                while (pindex->pprev && pindex->nHeight % difficultyAdjustmentInterval != 0 && pindex->nBits == nProofOfWorkLimit)\n                    pindex = pindex->pprev;\n                return pindex->nBits;\n            }\n        }\n        return pindexLast->nBits;\n    }\n\n    \/\/ Go back by what we want to be 14 days worth of blocks\n    \/\/ bridgecoin: This fixes an issue where a 51% attack can change difficulty at will.\n    \/\/ Go back the full period unless it's the first retarget after genesis. Code courtesy of Art Forz\n    \n\n\n    int blockstogoback = difficultyAdjustmentInterval-1;\n    if ((pindexLast->nHeight+1) != difficultyAdjustmentInterval)\n        blockstogoback = difficultyAdjustmentInterval;\n\n    \/\/ Go back by what we want to be 14 days worth of blocks\n    const CBlockIndex* pindexFirst = pindexLast;\n    for (int i = 0; pindexFirst && i < blockstogoback; i++)\n        pindexFirst = pindexFirst->pprev;\n\n    assert(pindexFirst);\n\n    return CalculateNextWorkRequired(pindexLast, pindexFirst->GetBlockTime(), params);\n}\n\nunsigned int static DarkGravityWave(const CBlockIndex* pindexLast, const Consensus::Params& params) {\n    \/* current difficulty formula, dash - DarkGravity v3, written by Evan Duffield - evan@dash.org *\/\n    const CBlockIndex *BlockLastSolved = pindexLast;\n    const CBlockIndex *BlockReading = pindexLast;\n    int64_t nActualTimespan = 0;\n    int64_t LastBlockTime = 0;\n    int64_t PastBlocksMin = 24;\n    int64_t PastBlocksMax = 24;\n    int64_t CountBlocks = 0;\n    arith_uint256 PastDifficultyAverage;\n    arith_uint256 PastDifficultyAveragePrev;\n\n    if (BlockLastSolved == NULL || BlockLastSolved->nHeight == 0 || BlockLastSolved->nHeight < PastBlocksMin) {\n        return UintToArith256(params.powLimit).GetCompact();\n    }\n\n    for (unsigned int i = 1; BlockReading && BlockReading->nHeight > 0; i++) {\n        if (PastBlocksMax > 0 && i > PastBlocksMax) { break; }\n        CountBlocks++;\n\n        if(CountBlocks <= PastBlocksMin) {\n            if (CountBlocks == 1) { PastDifficultyAverage.SetCompact(BlockReading->nBits); }\n            else { PastDifficultyAverage = ((PastDifficultyAveragePrev * CountBlocks) + (arith_uint256().SetCompact(BlockReading->nBits))) \/ (CountBlocks + 1); }\n            PastDifficultyAveragePrev = PastDifficultyAverage;\n        }\n\n        if(LastBlockTime > 0){\n            int64_t Diff = (LastBlockTime - BlockReading->GetBlockTime());\n            nActualTimespan += Diff;\n        }\n        LastBlockTime = BlockReading->GetBlockTime();\n\n        if (BlockReading->pprev == NULL) { assert(BlockReading); break; }\n        BlockReading = BlockReading->pprev;\n    }\n\n    arith_uint256 bnNew(PastDifficultyAverage);\n\n    int64_t _nTargetTimespan = CountBlocks * params.nPowTargetSpacing;\n\n    if (nActualTimespan < _nTargetTimespan\/3)\n        nActualTimespan = _nTargetTimespan\/3;\n    if (nActualTimespan > _nTargetTimespan*3)\n        nActualTimespan = _nTargetTimespan*3;\n\n    \/\/ Retarget\n    bnNew *= nActualTimespan;\n    bnNew \/= _nTargetTimespan;\n\n    if (bnNew > UintToArith256(params.powLimit)){\n        bnNew = UintToArith256(params.powLimit);\n    }\n\n    return bnNew.GetCompact();\n}\n\n\nunsigned int CalculateNextWorkRequired(const CBlockIndex* pindexLast, int64_t nFirstBlockTime, const Consensus::Params& params)\n{\n    if (params.fPowNoRetargeting)\n        return pindexLast->nBits;\n\n    unsigned int retarget = DIFF_DGW;\n    if (pindexLast->nHeight + 1 >= 98848) retarget = DIFF_DGW;\n    else retarget = DIFF_BTC;\n   \n\n\n\tif (retarget == DIFF_BTC) {\n\n\t    \/\/ Limit adjustment step\n\t    int64_t nActualTimespan = pindexLast->GetBlockTime() - nFirstBlockTime;\n\t    if (nActualTimespan < params.nPowTargetTimespan\/4)\n\t        nActualTimespan = params.nPowTargetTimespan\/4;\n\t    if (nActualTimespan > params.nPowTargetTimespan*4)\n\t        nActualTimespan = params.nPowTargetTimespan*4;\n\n\t    \/\/ Retarget\n\t    arith_uint256 bnNew;\n\t    arith_uint256 bnOld;\n\t    bnNew.SetCompact(pindexLast->nBits);\n\t    bnOld = bnNew;\n\t    \/\/ bridgecoin: intermediate uint256 can overflow by 1 bit\n\t    bool fShift = bnNew.bits() > 235;\n\t    if (fShift)\n\t        bnNew >>= 1;\n\t    bnNew *= nActualTimespan;\n\t    bnNew \/= params.nPowTargetTimespan;\n\t    if (fShift)\n\t        bnNew <<= 1;\n\n\t    const arith_uint256 bnPowLimit = UintToArith256(params.powLimit);\n\t    if (bnNew > bnPowLimit)\n\t        bnNew = bnPowLimit;\n\n\n\t    const CBlockIndex *BlockLastSolved = pindexLast;\n\n\t\/\/    LogPrintf(\"After: %08x %s\\n\", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());\n\t    return bnNew.GetCompact();\n\t}\n\telse if (retarget == DIFF_DGW)\n        {\n\t\treturn DarkGravityWave(pindexLast, params);\n        }\n\treturn DarkGravityWave(pindexLast, params);\n\n}\n\nbool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params& params)\n{\n    bool fNegative;\n    bool fOverflow;\n    arith_uint256 bnTarget;\n\n    bnTarget.SetCompact(nBits, &fNegative, &fOverflow);\n\n    \/\/ Check range\n    if (fNegative || bnTarget == 0 || fOverflow || bnTarget > UintToArith256(params.powLimit))\n        return false;\n\n    \/\/ Check proof of work matches claimed amount\n    if (UintToArith256(hash) > bnTarget)\n        return false;\n\n    return true;\n}\n<commit_msg>Adjust block number to hard fork later<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 \"pow.h\"\n\n#include \"arith_uint256.h\"\n#include \"chain.h\"\n#include \"primitives\/block.h\"\n#include \"uint256.h\"\n#include \"util.h\"\n\n\nunsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader *pblock, const Consensus::Params& params)\n{\n    unsigned int nProofOfWorkLimit = UintToArith256(params.powLimit).GetCompact();\n\n    \/\/ Genesis block\n    if (pindexLast == NULL)\n        return nProofOfWorkLimit;\n\n    \/\/ Only change once per difficulty adjustment interval\n    int difficultyAdjustmentInterval = params.DifficultyAdjustmentInterval();\n\n    if (pindexLast->nHeight + 1 >= 99111) {\n\t    difficultyAdjustmentInterval = 1;\n    }\n\n    if ((pindexLast->nHeight+1) % difficultyAdjustmentInterval != 0)\n    {\n        if (params.fPowAllowMinDifficultyBlocks)\n        {\n            \/\/ Special difficulty rule for testnet:\n            \/\/ If the new block's timestamp is more than 2* 10 minutes\n            \/\/ then allow mining of a min-difficulty block.\n            if (pblock->GetBlockTime() > pindexLast->GetBlockTime() + params.nPowTargetSpacing*2)\n                return nProofOfWorkLimit;\n            else\n            {\n                \/\/ Return the last non-special-min-difficulty-rules-block\n                const CBlockIndex* pindex = pindexLast;\n                while (pindex->pprev && pindex->nHeight % difficultyAdjustmentInterval != 0 && pindex->nBits == nProofOfWorkLimit)\n                    pindex = pindex->pprev;\n                return pindex->nBits;\n            }\n        }\n        return pindexLast->nBits;\n    }\n\n    \/\/ Go back by what we want to be 14 days worth of blocks\n    \/\/ bridgecoin: This fixes an issue where a 51% attack can change difficulty at will.\n    \/\/ Go back the full period unless it's the first retarget after genesis. Code courtesy of Art Forz\n    \n\n\n    int blockstogoback = difficultyAdjustmentInterval-1;\n    if ((pindexLast->nHeight+1) != difficultyAdjustmentInterval)\n        blockstogoback = difficultyAdjustmentInterval;\n\n    \/\/ Go back by what we want to be 14 days worth of blocks\n    const CBlockIndex* pindexFirst = pindexLast;\n    for (int i = 0; pindexFirst && i < blockstogoback; i++)\n        pindexFirst = pindexFirst->pprev;\n\n    assert(pindexFirst);\n\n    return CalculateNextWorkRequired(pindexLast, pindexFirst->GetBlockTime(), params);\n}\n\nunsigned int static DarkGravityWave(const CBlockIndex* pindexLast, const Consensus::Params& params) {\n    \/* current difficulty formula, dash - DarkGravity v3, written by Evan Duffield - evan@dash.org *\/\n    const CBlockIndex *BlockLastSolved = pindexLast;\n    const CBlockIndex *BlockReading = pindexLast;\n    int64_t nActualTimespan = 0;\n    int64_t LastBlockTime = 0;\n    int64_t PastBlocksMin = 24;\n    int64_t PastBlocksMax = 24;\n    int64_t CountBlocks = 0;\n    arith_uint256 PastDifficultyAverage;\n    arith_uint256 PastDifficultyAveragePrev;\n\n    if (BlockLastSolved == NULL || BlockLastSolved->nHeight == 0 || BlockLastSolved->nHeight < PastBlocksMin) {\n        return UintToArith256(params.powLimit).GetCompact();\n    }\n\n    for (unsigned int i = 1; BlockReading && BlockReading->nHeight > 0; i++) {\n        if (PastBlocksMax > 0 && i > PastBlocksMax) { break; }\n        CountBlocks++;\n\n        if(CountBlocks <= PastBlocksMin) {\n            if (CountBlocks == 1) { PastDifficultyAverage.SetCompact(BlockReading->nBits); }\n            else { PastDifficultyAverage = ((PastDifficultyAveragePrev * CountBlocks) + (arith_uint256().SetCompact(BlockReading->nBits))) \/ (CountBlocks + 1); }\n            PastDifficultyAveragePrev = PastDifficultyAverage;\n        }\n\n        if(LastBlockTime > 0){\n            int64_t Diff = (LastBlockTime - BlockReading->GetBlockTime());\n            nActualTimespan += Diff;\n        }\n        LastBlockTime = BlockReading->GetBlockTime();\n\n        if (BlockReading->pprev == NULL) { assert(BlockReading); break; }\n        BlockReading = BlockReading->pprev;\n    }\n\n    arith_uint256 bnNew(PastDifficultyAverage);\n\n    int64_t _nTargetTimespan = CountBlocks * params.nPowTargetSpacing;\n\n    if (nActualTimespan < _nTargetTimespan\/3)\n        nActualTimespan = _nTargetTimespan\/3;\n    if (nActualTimespan > _nTargetTimespan*3)\n        nActualTimespan = _nTargetTimespan*3;\n\n    \/\/ Retarget\n    bnNew *= nActualTimespan;\n    bnNew \/= _nTargetTimespan;\n\n    if (bnNew > UintToArith256(params.powLimit)){\n        bnNew = UintToArith256(params.powLimit);\n    }\n\n    return bnNew.GetCompact();\n}\n\n\nunsigned int CalculateNextWorkRequired(const CBlockIndex* pindexLast, int64_t nFirstBlockTime, const Consensus::Params& params)\n{\n    if (params.fPowNoRetargeting)\n        return pindexLast->nBits;\n\n    unsigned int retarget = DIFF_DGW;\n    if (pindexLast->nHeight + 1 >= 99111) retarget = DIFF_DGW;\n    else retarget = DIFF_BTC;\n   \n\n\n\tif (retarget == DIFF_BTC) {\n\n\t    \/\/ Limit adjustment step\n\t    int64_t nActualTimespan = pindexLast->GetBlockTime() - nFirstBlockTime;\n\t    if (nActualTimespan < params.nPowTargetTimespan\/4)\n\t        nActualTimespan = params.nPowTargetTimespan\/4;\n\t    if (nActualTimespan > params.nPowTargetTimespan*4)\n\t        nActualTimespan = params.nPowTargetTimespan*4;\n\n\t    \/\/ Retarget\n\t    arith_uint256 bnNew;\n\t    arith_uint256 bnOld;\n\t    bnNew.SetCompact(pindexLast->nBits);\n\t    bnOld = bnNew;\n\t    \/\/ bridgecoin: intermediate uint256 can overflow by 1 bit\n\t    bool fShift = bnNew.bits() > 235;\n\t    if (fShift)\n\t        bnNew >>= 1;\n\t    bnNew *= nActualTimespan;\n\t    bnNew \/= params.nPowTargetTimespan;\n\t    if (fShift)\n\t        bnNew <<= 1;\n\n\t    const arith_uint256 bnPowLimit = UintToArith256(params.powLimit);\n\t    if (bnNew > bnPowLimit)\n\t        bnNew = bnPowLimit;\n\n\n\t    const CBlockIndex *BlockLastSolved = pindexLast;\n\n\t\/\/    LogPrintf(\"After: %08x %s\\n\", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());\n\t    return bnNew.GetCompact();\n\t}\n\telse if (retarget == DIFF_DGW)\n        {\n\t\treturn DarkGravityWave(pindexLast, params);\n        }\n\treturn DarkGravityWave(pindexLast, params);\n\n}\n\nbool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params& params)\n{\n    bool fNegative;\n    bool fOverflow;\n    arith_uint256 bnTarget;\n\n    bnTarget.SetCompact(nBits, &fNegative, &fOverflow);\n\n    \/\/ Check range\n    if (fNegative || bnTarget == 0 || fOverflow || bnTarget > UintToArith256(params.powLimit))\n        return false;\n\n    \/\/ Check proof of work matches claimed amount\n    if (UintToArith256(hash) > bnTarget)\n        return false;\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <side.hh>\n\n#include <map>\n#include <boost\/assign.hpp>\n\n#include <scroom\/assertions.hh>\n\n\nnamespace\n{\n  std::array<int, 9> Identity =\n    {\n      0, 1, 2,\n      3, 4, 5,\n      6, 7, 8,\n    };\n  \n  std::array<int, 9> RotateHalf =\n    {\n      8, 7, 6,\n      5, 4, 3,\n      2, 1, 0,\n    };\n\n  std::array<int, 9> RotateLeft =\n    {\n      2, 5, 8,\n      1, 4, 7,\n      0, 3, 6,\n    };\n\n  std::array<int, 9> RotateRight =\n    {\n      6, 3, 0,\n      7, 4, 1,\n      8, 5, 2,\n    };\n\n  std::array<int, 9> transform(std::array<int, 9> const& transformation, std::array<int, 9> const& data)\n  {\n    std::array<int, 9> result;\n    for(int i=0; i<9; i++)\n      result[i] = data[transformation[i]];\n    return result;\n  }\n}\n\nnamespace Rubik\n{\n  Orientation& Orientation::top(int t)\n  {\n    top_ = t;\n    return *this;\n  }\n  \n  Orientation& Orientation::bottom(int b)\n  {\n    bottom_ = b;\n    return *this;\n  }\n\n  Orientation& Orientation::left(int l)\n  {\n    left_ = l;\n    return *this;\n  }\n\n  Orientation& Orientation::right(int r)\n  {\n    right_ = r;\n    return *this;\n  }\n\n  int Orientation::top() const\n  {\n    return *top_;\n  }\n  \n  int Orientation::bottom() const\n  {\n    return *bottom_;\n  }\n  \n  int Orientation::left() const\n  {\n    return *left_;\n  }\n  \n  int Orientation::right() const\n  {\n    return *right_;\n  }\n\n  std::array<int, 9> Orientation::transformation(int top) const\n  {\n    std::map<int, std::array<int, 9> const> const transformations = boost::assign::map_list_of\n      (this->top(), Identity)\n      (this->left(), RotateRight)\n      (this->bottom(), RotateHalf)\n      (this->right(), RotateLeft);\n\n    return transformations.at(top);\n  }\n\n  Orientation top(int t)\n  {\n    Orientation o;\n    return o.top(t);\n  }\n  \n  Orientation bottom(int b)\n  {\n    Orientation o;\n    return o.bottom(b);\n  }\n\n  Orientation left(int l)\n  {\n    Orientation o;\n    return o.left(l);\n  }\n\n  Orientation right(int r)\n  {\n    Orientation o;\n    return o.right(r);\n  }\n\n  Side::Ptr Side::create(Side::Data const& data, Orientation const& orientation)\n  {\n    return Ptr(new Side(data, orientation));\n  }\n\n  Side::Side(Side::Data const& data, Orientation const& orientation)\n    : data_(data), orientation_(orientation)\n  {}\n\n  Side::Data Side::data()\n  {\n    return data_;\n  }\n\n  Side::Data Side::data(int top)\n  {\n    return transform(orientation_.transformation(top), data_);\n  }\n\n  Side::Row Side::topRow(int top)\n  {\n    Side::Data data = this->data(top);\n    Side::Row result = {data[0], data[1], data[2]};\n\n    return result;\n  }\n\n  std::ostream& operator<<(std::ostream& os, Side::Data const& data)\n  {\n    os << std::endl\n       << '[' << data[0] << ' ' << data[1] << ' ' << data[2] << ']' << std::endl\n       << '[' << data[3] << ' ' << data[4] << ' ' << data[5] << ']' << std::endl\n       << '[' << data[6] << ' ' << data[7] << ' ' << data[8] << ']' << std::endl;\n    \n    return os;\n  }\n\n  std::ostream& operator<<(std::ostream& os, Orientation const& o)\n  {\n    os << '('\n       << \"Top: \" << o.top_ << \", \"\n       << \"Left: \" << o.left_ << \", \"\n       << \"Bottom: \" << o.bottom_ << \", \"\n       << \"Right: \" << o.right_\n       << ')';\n\n    return os;\n  }\n}\n\n<commit_msg>Refactor: Use transform() function to determine top row<commit_after>#include <side.hh>\n\n#include <map>\n#include <boost\/assign.hpp>\n\n#include <scroom\/assertions.hh>\n\n\nnamespace\n{\n  std::array<int, 9> Identity =\n    {\n      0, 1, 2,\n      3, 4, 5,\n      6, 7, 8,\n    };\n  \n  std::array<int, 9> RotateHalf =\n    {\n      8, 7, 6,\n      5, 4, 3,\n      2, 1, 0,\n    };\n\n  std::array<int, 9> RotateLeft =\n    {\n      2, 5, 8,\n      1, 4, 7,\n      0, 3, 6,\n    };\n\n  std::array<int, 9> RotateRight =\n    {\n      6, 3, 0,\n      7, 4, 1,\n      8, 5, 2,\n    };\n\n  std::array<int, 3> TopRow = {0, 1, 2};\n\n  template<unsigned long n>\n  std::array<int, n> transform(std::array<int, n> const& transformation, std::array<int, 9> const& data)\n  {\n    std::array<int, n> result;\n    for(int i=0; i<n; i++)\n      result[i] = data[transformation[i]];\n    return result;\n  }\n}\n\nnamespace Rubik\n{\n  Orientation& Orientation::top(int t)\n  {\n    top_ = t;\n    return *this;\n  }\n  \n  Orientation& Orientation::bottom(int b)\n  {\n    bottom_ = b;\n    return *this;\n  }\n\n  Orientation& Orientation::left(int l)\n  {\n    left_ = l;\n    return *this;\n  }\n\n  Orientation& Orientation::right(int r)\n  {\n    right_ = r;\n    return *this;\n  }\n\n  int Orientation::top() const\n  {\n    return *top_;\n  }\n  \n  int Orientation::bottom() const\n  {\n    return *bottom_;\n  }\n  \n  int Orientation::left() const\n  {\n    return *left_;\n  }\n  \n  int Orientation::right() const\n  {\n    return *right_;\n  }\n\n  std::array<int, 9> Orientation::transformation(int top) const\n  {\n    std::map<int, std::array<int, 9> const> const transformations = boost::assign::map_list_of\n      (this->top(), Identity)\n      (this->left(), RotateRight)\n      (this->bottom(), RotateHalf)\n      (this->right(), RotateLeft);\n\n    return transformations.at(top);\n  }\n\n  Orientation top(int t)\n  {\n    Orientation o;\n    return o.top(t);\n  }\n  \n  Orientation bottom(int b)\n  {\n    Orientation o;\n    return o.bottom(b);\n  }\n\n  Orientation left(int l)\n  {\n    Orientation o;\n    return o.left(l);\n  }\n\n  Orientation right(int r)\n  {\n    Orientation o;\n    return o.right(r);\n  }\n\n  Side::Ptr Side::create(Side::Data const& data, Orientation const& orientation)\n  {\n    return Ptr(new Side(data, orientation));\n  }\n\n  Side::Side(Side::Data const& data, Orientation const& orientation)\n    : data_(data), orientation_(orientation)\n  {}\n\n  Side::Data Side::data()\n  {\n    return data_;\n  }\n\n  Side::Data Side::data(int top)\n  {\n    return transform(orientation_.transformation(top), data_);\n  }\n\n  Side::Row Side::topRow(int top)\n  {\n    Side::Data data = this->data(top);\n    Side::Row result = transform(TopRow, data);\n\n    return result;\n  }\n\n  std::ostream& operator<<(std::ostream& os, Side::Data const& data)\n  {\n    os << std::endl\n       << '[' << data[0] << ' ' << data[1] << ' ' << data[2] << ']' << std::endl\n       << '[' << data[3] << ' ' << data[4] << ' ' << data[5] << ']' << std::endl\n       << '[' << data[6] << ' ' << data[7] << ' ' << data[8] << ']' << std::endl;\n    \n    return os;\n  }\n\n  std::ostream& operator<<(std::ostream& os, Orientation const& o)\n  {\n    os << '('\n       << \"Top: \" << o.top_ << \", \"\n       << \"Left: \" << o.left_ << \", \"\n       << \"Bottom: \" << o.bottom_ << \", \"\n       << \"Right: \" << o.right_\n       << ')';\n\n    return os;\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: trace.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: ihi $ $Date: 2006-08-28 15:00: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#ifndef _TRACE_HXX_\n#include \"trace.hxx\"\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#if defined(DBG_UTIL)\n\n\/\/==============================================================================\n\n\/\/------------------------------------------------------------------------------\n::vos::OMutex Tracer::s_aMapSafety;\nmap< ::vos::OThread::TThreadIdentifier, INT32, ::std::less< ::vos::OThread::TThreadIdentifier > >\n        Tracer::s_aThreadIndents;\n\n\/\/------------------------------------------------------------------------------\nTracer::Tracer(const char* _pBlockDescription)\n    :m_sBlockDescription(_pBlockDescription)\n{\n    ::vos::OGuard aGuard(s_aMapSafety);\n    INT32 nIndent = s_aThreadIndents[ ::vos::OThread::getCurrentIdentifier() ]++;\n\n    ByteString sIndent;\n    while (nIndent--)\n        sIndent += '\\t';\n\n    ByteString sThread( ByteString::CreateFromInt32( (INT32)::vos::OThread::getCurrentIdentifier() ) );\n    sThread += '\\t';\n\n    ByteString sMessage(sThread);\n    sMessage += sIndent;\n    sMessage += m_sBlockDescription;\n    sMessage += \" {\";\n    DBG_TRACE(sMessage.GetBuffer());\n}\n\n\/\/------------------------------------------------------------------------------\nTracer::~Tracer()\n{\n    ::vos::OGuard aGuard(s_aMapSafety);\n    INT32 nIndent = --s_aThreadIndents[ ::vos::OThread::getCurrentIdentifier() ];\n\n    ByteString sIndent;\n    while (nIndent--)\n        sIndent += '\\t';\n\n    ByteString sThread( ByteString::CreateFromInt32( (INT32)::vos::OThread::getCurrentIdentifier() ) );\n    sThread += '\\t';\n\n    ByteString sMessage(sThread);\n    sMessage += sIndent;\n    sMessage += \"} \/\/ \";\n    sMessage += m_sBlockDescription;\n    DBG_TRACE(sMessage.GetBuffer());\n}\n\n\/\/------------------------------------------------------------------------------\nvoid Tracer::TraceString(const char* _pMessage)\n{\n    ::vos::OGuard aGuard(s_aMapSafety);\n    INT32 nIndent = s_aThreadIndents[ ::vos::OThread::getCurrentIdentifier() ];\n\n    ByteString sIndent;\n    while (nIndent--)\n        sIndent += '\\t';\n\n    ByteString sThread( ByteString::CreateFromInt32( (INT32)::vos::OThread::getCurrentIdentifier() ) );\n    sThread += '\\t';\n\n    ByteString sMessage(sThread);\n    sMessage += sIndent;\n    sMessage += m_sBlockDescription;\n    sMessage += \": \";\n    sMessage += _pMessage;\n    DBG_TRACE(sMessage.GetBuffer());\n}\n\n\/\/------------------------------------------------------------------------------\nvoid Tracer::TraceString1StringParam(const char* _pMessage, const char* _pParam)\n{\n    ::vos::OGuard aGuard(s_aMapSafety);\n    INT32 nIndent = s_aThreadIndents[ ::vos::OThread::getCurrentIdentifier() ];\n\n    ByteString sIndent;\n    while (nIndent--)\n        sIndent += '\\t';\n\n    ByteString sThread( ByteString::CreateFromInt32( (INT32)::vos::OThread::getCurrentIdentifier() ) );\n    sThread += '\\t';\n\n    ByteString sMessage(sThread);\n    sMessage += sIndent;\n    sMessage += m_sBlockDescription;\n    sMessage += \": \";\n    sMessage += _pMessage;\n    DBG_TRACE1(sMessage.GetBuffer(), _pParam);\n}\n#endif\n<commit_msg>INTEGRATION: CWS pchfix02 (1.4.48); FILE MERGED 2006\/09\/01 17:46:46 kaib 1.4.48.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: trace.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 05:02: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_svx.hxx\"\n#ifndef _TRACE_HXX_\n#include \"trace.hxx\"\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#if defined(DBG_UTIL)\n\n\/\/==============================================================================\n\n\/\/------------------------------------------------------------------------------\n::vos::OMutex Tracer::s_aMapSafety;\nmap< ::vos::OThread::TThreadIdentifier, INT32, ::std::less< ::vos::OThread::TThreadIdentifier > >\n        Tracer::s_aThreadIndents;\n\n\/\/------------------------------------------------------------------------------\nTracer::Tracer(const char* _pBlockDescription)\n    :m_sBlockDescription(_pBlockDescription)\n{\n    ::vos::OGuard aGuard(s_aMapSafety);\n    INT32 nIndent = s_aThreadIndents[ ::vos::OThread::getCurrentIdentifier() ]++;\n\n    ByteString sIndent;\n    while (nIndent--)\n        sIndent += '\\t';\n\n    ByteString sThread( ByteString::CreateFromInt32( (INT32)::vos::OThread::getCurrentIdentifier() ) );\n    sThread += '\\t';\n\n    ByteString sMessage(sThread);\n    sMessage += sIndent;\n    sMessage += m_sBlockDescription;\n    sMessage += \" {\";\n    DBG_TRACE(sMessage.GetBuffer());\n}\n\n\/\/------------------------------------------------------------------------------\nTracer::~Tracer()\n{\n    ::vos::OGuard aGuard(s_aMapSafety);\n    INT32 nIndent = --s_aThreadIndents[ ::vos::OThread::getCurrentIdentifier() ];\n\n    ByteString sIndent;\n    while (nIndent--)\n        sIndent += '\\t';\n\n    ByteString sThread( ByteString::CreateFromInt32( (INT32)::vos::OThread::getCurrentIdentifier() ) );\n    sThread += '\\t';\n\n    ByteString sMessage(sThread);\n    sMessage += sIndent;\n    sMessage += \"} \/\/ \";\n    sMessage += m_sBlockDescription;\n    DBG_TRACE(sMessage.GetBuffer());\n}\n\n\/\/------------------------------------------------------------------------------\nvoid Tracer::TraceString(const char* _pMessage)\n{\n    ::vos::OGuard aGuard(s_aMapSafety);\n    INT32 nIndent = s_aThreadIndents[ ::vos::OThread::getCurrentIdentifier() ];\n\n    ByteString sIndent;\n    while (nIndent--)\n        sIndent += '\\t';\n\n    ByteString sThread( ByteString::CreateFromInt32( (INT32)::vos::OThread::getCurrentIdentifier() ) );\n    sThread += '\\t';\n\n    ByteString sMessage(sThread);\n    sMessage += sIndent;\n    sMessage += m_sBlockDescription;\n    sMessage += \": \";\n    sMessage += _pMessage;\n    DBG_TRACE(sMessage.GetBuffer());\n}\n\n\/\/------------------------------------------------------------------------------\nvoid Tracer::TraceString1StringParam(const char* _pMessage, const char* _pParam)\n{\n    ::vos::OGuard aGuard(s_aMapSafety);\n    INT32 nIndent = s_aThreadIndents[ ::vos::OThread::getCurrentIdentifier() ];\n\n    ByteString sIndent;\n    while (nIndent--)\n        sIndent += '\\t';\n\n    ByteString sThread( ByteString::CreateFromInt32( (INT32)::vos::OThread::getCurrentIdentifier() ) );\n    sThread += '\\t';\n\n    ByteString sMessage(sThread);\n    sMessage += sIndent;\n    sMessage += m_sBlockDescription;\n    sMessage += \": \";\n    sMessage += _pMessage;\n    DBG_TRACE1(sMessage.GetBuffer(), _pParam);\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fmitems.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 22:53: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#pragma hdrstop\n#ifndef _SVX_FMITEMS_HXX\n#include \"fmitems.hxx\"\n#endif\n\n#include <svxids.hrc>\n\n#ifndef _STREAM_HXX \/\/autogen\n#include <tools\/stream.hxx>\n#endif\n\n\/\/========================================================================\n\/\/ class FmInterfaceItem\n\/\/========================================================================\nTYPEINIT1(FmInterfaceItem, SfxPoolItem);\n\n\/\/------------------------------------------------------------------------------\nint FmInterfaceItem::operator==( const SfxPoolItem& rAttr ) const\n{\n    DBG_ASSERT( SfxPoolItem::operator==(rAttr), \"unequal types\" );\n    return( xInterface == ((FmInterfaceItem&)rAttr).GetInterface() );\n}\n\n\/\/------------------------------------------------------------------------------\nSfxPoolItem* FmInterfaceItem::Clone( SfxItemPool* ) const\n{\n    return new FmInterfaceItem( *this );\n}\n\n\/\/------------------------------------------------------------------------------\nSvStream& FmInterfaceItem::Store( SvStream& rStrm , sal_uInt16 nItemVersion ) const\n{\n    return rStrm;\n}\n\n\/\/------------------------------------------------------------------------------\nSfxPoolItem* FmInterfaceItem::Create( SvStream& rStrm, sal_uInt16 ) const\n{\n    return new FmInterfaceItem( *this );\n}\n\n\n\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.4.220); FILE MERGED 2006\/02\/15 13:28:04 fs 1.4.220.1: #i55991# warning-free code<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fmitems.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 15:54:52 $\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 _SVX_FMITEMS_HXX\n#include \"fmitems.hxx\"\n#endif\n\n#include <svxids.hrc>\n\n#ifndef _STREAM_HXX \/\/autogen\n#include <tools\/stream.hxx>\n#endif\n\n\/\/========================================================================\n\/\/ class FmInterfaceItem\n\/\/========================================================================\nTYPEINIT1(FmInterfaceItem, SfxPoolItem);\n\n\/\/------------------------------------------------------------------------------\nint FmInterfaceItem::operator==( const SfxPoolItem& rAttr ) const\n{\n    DBG_ASSERT( SfxPoolItem::operator==(rAttr), \"unequal types\" );\n    return( xInterface == ((FmInterfaceItem&)rAttr).GetInterface() );\n}\n\n\/\/------------------------------------------------------------------------------\nSfxPoolItem* FmInterfaceItem::Clone( SfxItemPool* ) const\n{\n    return new FmInterfaceItem( *this );\n}\n\n\/\/------------------------------------------------------------------------------\nSvStream& FmInterfaceItem::Store( SvStream& rStrm , sal_uInt16 \/*nItemVersion*\/ ) const\n{\n    DBG_ERROR( \"FmInterfaceItem::Store: not implemented!\" );\n    return rStrm;\n}\n\n\/\/------------------------------------------------------------------------------\nSfxPoolItem* FmInterfaceItem::Create( SvStream& \/*rStrm*\/, sal_uInt16 ) const\n{\n    DBG_ERROR( \"FmInterfaceItem::Create: not implemented!\" );\n    return new FmInterfaceItem( *this );\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\nThis is an example for our Monochrome OLEDs based on SSD1306 drivers\n  Pick one up today in the adafruit shop!\n  ------> http:\/\/www.adafruit.com\/category\/63_98\n\nThis example is for a 128x64 size display using SPI to communicate\n4 or 5 pins are required to interface\n\nAdafruit invests time and resources providing this open source code,\nplease support Adafruit and open-source hardware by purchasing\nproducts from Adafruit!\n\nWritten by Limor Fried\/Ladyada  for Adafruit Industries.\nBSD license, check license.txt for more information\nAll text above, and the splash screen must be included in any redistribution\n*********************************************************************\/\n\n#include <SPI.h>\n#include <Wire.h>\n#include <Adafruit_GFX.h>\n#include <Adafruit_SSD1306.h>\n\n\/\/ If using software SPI (the default case):\n\/*\n#define OLED_MOSI   9\n#define OLED_CLK   10\n#define OLED_DC    11\n#define OLED_CS    12\n#define OLED_RESET 13\nAdafruit_SSD1306 display(OLED_MOSI, OLED_CLK, OLED_DC, OLED_RESET, OLED_CS);\n*\/\n\/\/ Uncomment this block to use hardware SPI\n#define OLED_DC     6\n#define OLED_CS     7\n#define OLED_RESET  8\nAdafruit_SSD1306 display(OLED_DC, OLED_RESET, OLED_CS);\n\n\n#define NUMFLAKES 10\n#define XPOS 0\n#define YPOS 1\n#define DELTAY 2\n\n#define LOGO16_GLCD_HEIGHT 16\n#define LOGO16_GLCD_WIDTH  16\nstatic const unsigned char PROGMEM logo16_glcd_bmp[] =\n{ B00000000, B11000000,\n  B00000001, B11000000,\n  B00000001, B11000000,\n  B00000011, B11100000,\n  B11110011, B11100000,\n  B11111110, B11111000,\n  B01111110, B11111111,\n  B00110011, B10011111,\n  B00011111, B11111100,\n  B00001101, B01110000,\n  B00011011, B10100000,\n  B00111111, B11100000,\n  B00111111, B11110000,\n  B01111100, B11110000,\n  B01110000, B01110000,\n  B00000000, B00110000 };\n\n\/\/#if (SSD1306_LCDHEIGHT != 64)\n\/\/#error(\"Height incorrect, please fix Adafruit_SSD1306.h!\");\n\/\/#endif\n\nvoid setup()   {\n  Serial.begin(9600);\n\n  \/\/ by default, we'll generate the high voltage from the 3.3v line internally! (neat!)\n  display.begin(SSD1306_SWITCHCAPVCC);\n  \/\/ init done\n\n  \/\/ Show image buffer on the display hardware.\n  \/\/ Since the buffer is intialized with an Adafruit splashscreen\n  \/\/ internally, this will display the splashscreen.\n  display.display();\n  delay(2000);\n\n  \/\/ Clear the buffer.\n  display.clearDisplay();\n\n  \/\/ draw a single pixel\n  display.drawPixel(10, 10, WHITE);\n  \/\/ Show the display buffer on the hardware.\n  \/\/ NOTE: You _must_ call display after making any drawing commands\n  \/\/ to make them visible on the display hardware!\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n\n\n  \/\/ draw a white circle, 10 pixel radius\n  display.fillCircle(display.width()\/2, display.height()\/2, 10, WHITE);\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n\n\n  \/\/ text display tests\n  display.setTextSize(1);\n  display.setTextColor(WHITE);\n  display.setCursor(0,0);\n  display.println(\"Hello, world!\");\n  display.setTextColor(BLACK, WHITE); \/\/ 'inverted' text\n  display.println(3.141592);\n  display.setTextSize(2);\n  display.setTextColor(WHITE);\n  display.print(\"0x\"); display.println(0xDEADBEEF, HEX);\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ miniature bitmap display\n  display.drawBitmap(30, 16,  logo16_glcd_bmp, 16, 16, 1);\n  display.display();\n\n  \/\/ invert the display\n  display.invertDisplay(true);\n  delay(1000);\n  display.invertDisplay(false);\n  delay(1000);\n  display.clearDisplay();\n\n\n}\n\n\n\n\nvoid testdrawbitmap(const uint8_t *bitmap, uint8_t w, uint8_t h) {\n  uint8_t icons[NUMFLAKES][3];\n\n  \/\/ initialize\n  for (uint8_t f=0; f< NUMFLAKES; f++) {\n    icons[f][XPOS] = random(display.width());\n    icons[f][YPOS] = 0;\n    icons[f][DELTAY] = random(5) + 1;\n\n    Serial.print(\"x: \");\n    Serial.print(icons[f][XPOS], DEC);\n    Serial.print(\" y: \");\n    Serial.print(icons[f][YPOS], DEC);\n    Serial.print(\" dy: \");\n    Serial.println(icons[f][DELTAY], DEC);\n  }\n\n  while (1) {\n    \/\/ draw each icon\n    for (uint8_t f=0; f< NUMFLAKES; f++) {\n      display.drawBitmap(icons[f][XPOS], icons[f][YPOS], bitmap, w, h, WHITE);\n    }\n    display.display();\n    delay(200);\n\n    \/\/ then erase it + move it\n    for (uint8_t f=0; f< NUMFLAKES; f++) {\n      display.drawBitmap(icons[f][XPOS], icons[f][YPOS], bitmap, w, h, BLACK);\n      \/\/ move it\n      icons[f][YPOS] += icons[f][DELTAY];\n      \/\/ if its gone, reinit\n      if (icons[f][YPOS] > display.height()) {\n        icons[f][XPOS] = random(display.width());\n        icons[f][YPOS] = 0;\n        icons[f][DELTAY] = random(5) + 1;\n      }\n    }\n   }\n}\n\n\nvoid testdrawchar(void) {\n  display.setTextSize(1);\n  display.setTextColor(WHITE);\n  display.setCursor(0,0);\n\n  for (uint8_t i=0; i < 168; i++) {\n    if (i == '\\n') continue;\n    display.write(i);\n    if ((i > 0) && (i % 21 == 0))\n      display.println();\n  }\n  display.display();\n}\n\nvoid testdrawcircle(void) {\n  for (int16_t i=0; i<display.height(); i+=2) {\n    display.drawCircle(display.width()\/2, display.height()\/2, i, WHITE);\n    display.display();\n  }\n}\n\nvoid testfillrect(void) {\n  uint8_t color = 1;\n  for (int16_t i=0; i<display.height()\/2; i+=3) {\n    \/\/ alternate colors\n    display.fillRect(i, i, display.width()-i*2, display.height()-i*2, color%2);\n    display.display();\n    color++;\n  }\n}\n\nvoid testdrawtriangle(void) {\n  for (int16_t i=0; i<min(display.width(),display.height())\/2; i+=5) {\n    display.drawTriangle(display.width()\/2, display.height()\/2-i,\n                     display.width()\/2-i, display.height()\/2+i,\n                     display.width()\/2+i, display.height()\/2+i, WHITE);\n    display.display();\n  }\n}\n\nvoid testfilltriangle(void) {\n  uint8_t color = WHITE;\n  for (int16_t i=min(display.width(),display.height())\/2; i>0; i-=5) {\n    display.fillTriangle(display.width()\/2, display.height()\/2-i,\n                     display.width()\/2-i, display.height()\/2+i,\n                     display.width()\/2+i, display.height()\/2+i, WHITE);\n    if (color == WHITE) color = BLACK;\n    else color = WHITE;\n    display.display();\n  }\n}\n\nvoid testdrawroundrect(void) {\n  for (int16_t i=0; i<display.height()\/2-2; i+=2) {\n    display.drawRoundRect(i, i, display.width()-2*i, display.height()-2*i, display.height()\/4, WHITE);\n    display.display();\n  }\n}\n\nvoid testfillroundrect(void) {\n  uint8_t color = WHITE;\n  for (int16_t i=0; i<display.height()\/2-2; i+=2) {\n    display.fillRoundRect(i, i, display.width()-2*i, display.height()-2*i, display.height()\/4, color);\n    if (color == WHITE) color = BLACK;\n    else color = WHITE;\n    display.display();\n  }\n}\n\nvoid testdrawrect(void) {\n  for (int16_t i=0; i<display.height()\/2; i+=2) {\n    display.drawRect(i, i, display.width()-2*i, display.height()-2*i, WHITE);\n    display.display();\n  }\n}\n\nvoid testdrawline() {\n  for (int16_t i=0; i<display.width(); i+=4) {\n    display.drawLine(0, 0, i, display.height()-1, WHITE);\n    display.display();\n  }\n  for (int16_t i=0; i<display.height(); i+=4) {\n    display.drawLine(0, 0, display.width()-1, i, WHITE);\n    display.display();\n  }\n  delay(250);\n\n  display.clearDisplay();\n  for (int16_t i=0; i<display.width(); i+=4) {\n    display.drawLine(0, display.height()-1, i, 0, WHITE);\n    display.display();\n  }\n  for (int16_t i=display.height()-1; i>=0; i-=4) {\n    display.drawLine(0, display.height()-1, display.width()-1, i, WHITE);\n    display.display();\n  }\n  delay(250);\n\n  display.clearDisplay();\n  for (int16_t i=display.width()-1; i>=0; i-=4) {\n    display.drawLine(display.width()-1, display.height()-1, i, 0, WHITE);\n    display.display();\n  }\n  for (int16_t i=display.height()-1; i>=0; i-=4) {\n    display.drawLine(display.width()-1, display.height()-1, 0, i, WHITE);\n    display.display();\n  }\n  delay(250);\n\n  display.clearDisplay();\n  for (int16_t i=0; i<display.height(); i+=4) {\n    display.drawLine(display.width()-1, 0, 0, i, WHITE);\n    display.display();\n  }\n  for (int16_t i=0; i<display.width(); i+=4) {\n    display.drawLine(display.width()-1, 0, i, display.height()-1, WHITE);\n    display.display();\n  }\n  delay(250);\n}\n\nvoid testscrolltext(void) {\n  display.setTextSize(2);\n  display.setTextColor(WHITE);\n  display.setCursor(10,0);\n  display.clearDisplay();\n  display.println(\"scroll\");\n  display.display();\n\n  display.startscrollright(0x00, 0x0F);\n  delay(2000);\n  display.stopscroll();\n  delay(1000);\n  display.startscrollleft(0x00, 0x0F);\n  delay(2000);\n  display.stopscroll();\n  delay(1000);\n  display.startscrolldiagright(0x00, 0x07);\n  delay(2000);\n  display.startscrolldiagleft(0x00, 0x07);\n  delay(2000);\n  display.stopscroll();\n\n\n}\nvoid loop() {\n  \/\/ draw many lines\n  testdrawline();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw rectangles\n  testdrawrect();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw multiple rectangles\n  testfillrect();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw mulitple circles\n  testdrawcircle();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  testdrawroundrect();\n  delay(2000);\n  display.clearDisplay();\n\n  testfillroundrect();\n  delay(2000);\n  display.clearDisplay();\n\n  testdrawtriangle();\n  delay(2000);\n  display.clearDisplay();\n\n  testfilltriangle();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw the first ~12 characters in the font\n  testdrawchar();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw scrolling text\n  testscrolltext();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw a bitmap icon and 'animate' movement\n  testdrawbitmap(logo16_glcd_bmp, LOGO16_GLCD_HEIGHT, LOGO16_GLCD_WIDTH);\n\n}\n<commit_msg>SoftSPI v0.02<commit_after>\/*********************************************************************\nThis is an example for our Monochrome OLEDs based on SSD1306 drivers\n  Pick one up today in the adafruit shop!\n  ------> http:\/\/www.adafruit.com\/category\/63_98\n\nThis example is for a 128x64 size display using SPI to communicate\n4 or 5 pins are required to interface\n\nAdafruit invests time and resources providing this open source code,\nplease support Adafruit and open-source hardware by purchasing\nproducts from Adafruit!\n\nWritten by Limor Fried\/Ladyada  for Adafruit Industries.\nBSD license, check license.txt for more information\nAll text above, and the splash screen must be included in any redistribution\n*********************************************************************\/\n\n#include <SPI.h>\n#include <Wire.h>\n#include <Adafruit_GFX.h>\n#include <Adafruit_SSD1306.h>\n\n\/\/ If using software SPI (the default case):\n\n#define OLED_MOSI   9\n#define OLED_CLK   10\n#define OLED_DC    11\n#define OLED_CS    12\n#define OLED_RESET 13\nAdafruit_SSD1306 display(OLED_MOSI, OLED_CLK, OLED_DC, OLED_RESET, OLED_CS);\n\/*\n\/\/ Uncomment this block to use hardware SPI\n#define OLED_DC     6\n#define OLED_CS     7\n#define OLED_RESET  8\nAdafruit_SSD1306 display(OLED_DC, OLED_RESET, OLED_CS);\n*\/\n\n#define NUMFLAKES 10\n#define XPOS 0\n#define YPOS 1\n#define DELTAY 2\n\n#define LOGO16_GLCD_HEIGHT 16\n#define LOGO16_GLCD_WIDTH  16\nstatic const unsigned char PROGMEM logo16_glcd_bmp[] =\n{ B00000000, B11000000,\n  B00000001, B11000000,\n  B00000001, B11000000,\n  B00000011, B11100000,\n  B11110011, B11100000,\n  B11111110, B11111000,\n  B01111110, B11111111,\n  B00110011, B10011111,\n  B00011111, B11111100,\n  B00001101, B01110000,\n  B00011011, B10100000,\n  B00111111, B11100000,\n  B00111111, B11110000,\n  B01111100, B11110000,\n  B01110000, B01110000,\n  B00000000, B00110000 };\n\n\/\/#if (SSD1306_LCDHEIGHT != 64)\n\/\/#error(\"Height incorrect, please fix Adafruit_SSD1306.h!\");\n\/\/#endif\n\nvoid setup()   {\n  Serial.begin(9600);\n\n  \/\/ by default, we'll generate the high voltage from the 3.3v line internally! (neat!)\n  display.begin(SSD1306_SWITCHCAPVCC);\n  \/\/ init done\n\n  \/\/ Show image buffer on the display hardware.\n  \/\/ Since the buffer is intialized with an Adafruit splashscreen\n  \/\/ internally, this will display the splashscreen.\n  display.display();\n  delay(2000);\n\n  \/\/ Clear the buffer.\n  display.clearDisplay();\n\n  \/\/ draw a single pixel\n  display.drawPixel(10, 10, WHITE);\n  \/\/ Show the display buffer on the hardware.\n  \/\/ NOTE: You _must_ call display after making any drawing commands\n  \/\/ to make them visible on the display hardware!\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n\n\n  \/\/ draw a white circle, 10 pixel radius\n  display.fillCircle(display.width()\/2, display.height()\/2, 10, WHITE);\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n\n\n  \/\/ text display tests\n  display.setTextSize(1);\n  display.setTextColor(WHITE);\n  display.setCursor(0,0);\n  display.println(\"Hello, world!\");\n  display.setTextColor(BLACK, WHITE); \/\/ 'inverted' text\n  display.println(3.141592);\n  display.setTextSize(2);\n  display.setTextColor(WHITE);\n  display.print(\"0x\"); display.println(0xDEADBEEF, HEX);\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ miniature bitmap display\n  display.drawBitmap(30, 16,  logo16_glcd_bmp, 16, 16, 1);\n  display.display();\n\n  \/\/ invert the display\n  display.invertDisplay(true);\n  delay(1000);\n  display.invertDisplay(false);\n  delay(1000);\n  display.clearDisplay();\n\n\n}\n\n\n\n\nvoid testdrawbitmap(const uint8_t *bitmap, uint8_t w, uint8_t h) {\n  uint8_t icons[NUMFLAKES][3];\n\n  \/\/ initialize\n  for (uint8_t f=0; f< NUMFLAKES; f++) {\n    icons[f][XPOS] = random(display.width());\n    icons[f][YPOS] = 0;\n    icons[f][DELTAY] = random(5) + 1;\n\n    Serial.print(\"x: \");\n    Serial.print(icons[f][XPOS], DEC);\n    Serial.print(\" y: \");\n    Serial.print(icons[f][YPOS], DEC);\n    Serial.print(\" dy: \");\n    Serial.println(icons[f][DELTAY], DEC);\n  }\n\n  while (1) {\n    \/\/ draw each icon\n    for (uint8_t f=0; f< NUMFLAKES; f++) {\n      display.drawBitmap(icons[f][XPOS], icons[f][YPOS], bitmap, w, h, WHITE);\n    }\n    display.display();\n    delay(200);\n\n    \/\/ then erase it + move it\n    for (uint8_t f=0; f< NUMFLAKES; f++) {\n      display.drawBitmap(icons[f][XPOS], icons[f][YPOS], bitmap, w, h, BLACK);\n      \/\/ move it\n      icons[f][YPOS] += icons[f][DELTAY];\n      \/\/ if its gone, reinit\n      if (icons[f][YPOS] > display.height()) {\n        icons[f][XPOS] = random(display.width());\n        icons[f][YPOS] = 0;\n        icons[f][DELTAY] = random(5) + 1;\n      }\n    }\n   }\n}\n\n\nvoid testdrawchar(void) {\n  display.setTextSize(1);\n  display.setTextColor(WHITE);\n  display.setCursor(0,0);\n\n  for (uint8_t i=0; i < 168; i++) {\n    if (i == '\\n') continue;\n    display.write(i);\n    if ((i > 0) && (i % 21 == 0))\n      display.println();\n  }\n  display.display();\n}\n\nvoid testdrawcircle(void) {\n  for (int16_t i=0; i<display.height(); i+=2) {\n    display.drawCircle(display.width()\/2, display.height()\/2, i, WHITE);\n    display.display();\n  }\n}\n\nvoid testfillrect(void) {\n  uint8_t color = 1;\n  for (int16_t i=0; i<display.height()\/2; i+=3) {\n    \/\/ alternate colors\n    display.fillRect(i, i, display.width()-i*2, display.height()-i*2, color%2);\n    display.display();\n    color++;\n  }\n}\n\nvoid testdrawtriangle(void) {\n  for (int16_t i=0; i<min(display.width(),display.height())\/2; i+=5) {\n    display.drawTriangle(display.width()\/2, display.height()\/2-i,\n                     display.width()\/2-i, display.height()\/2+i,\n                     display.width()\/2+i, display.height()\/2+i, WHITE);\n    display.display();\n  }\n}\n\nvoid testfilltriangle(void) {\n  uint8_t color = WHITE;\n  for (int16_t i=min(display.width(),display.height())\/2; i>0; i-=5) {\n    display.fillTriangle(display.width()\/2, display.height()\/2-i,\n                     display.width()\/2-i, display.height()\/2+i,\n                     display.width()\/2+i, display.height()\/2+i, WHITE);\n    if (color == WHITE) color = BLACK;\n    else color = WHITE;\n    display.display();\n  }\n}\n\nvoid testdrawroundrect(void) {\n  for (int16_t i=0; i<display.height()\/2-2; i+=2) {\n    display.drawRoundRect(i, i, display.width()-2*i, display.height()-2*i, display.height()\/4, WHITE);\n    display.display();\n  }\n}\n\nvoid testfillroundrect(void) {\n  uint8_t color = WHITE;\n  for (int16_t i=0; i<display.height()\/2-2; i+=2) {\n    display.fillRoundRect(i, i, display.width()-2*i, display.height()-2*i, display.height()\/4, color);\n    if (color == WHITE) color = BLACK;\n    else color = WHITE;\n    display.display();\n  }\n}\n\nvoid testdrawrect(void) {\n  for (int16_t i=0; i<display.height()\/2; i+=2) {\n    display.drawRect(i, i, display.width()-2*i, display.height()-2*i, WHITE);\n    display.display();\n  }\n}\n\nvoid testdrawline() {\n  for (int16_t i=0; i<display.width(); i+=4) {\n    display.drawLine(0, 0, i, display.height()-1, WHITE);\n    display.display();\n  }\n  for (int16_t i=0; i<display.height(); i+=4) {\n    display.drawLine(0, 0, display.width()-1, i, WHITE);\n    display.display();\n  }\n  delay(250);\n\n  display.clearDisplay();\n  for (int16_t i=0; i<display.width(); i+=4) {\n    display.drawLine(0, display.height()-1, i, 0, WHITE);\n    display.display();\n  }\n  for (int16_t i=display.height()-1; i>=0; i-=4) {\n    display.drawLine(0, display.height()-1, display.width()-1, i, WHITE);\n    display.display();\n  }\n  delay(250);\n\n  display.clearDisplay();\n  for (int16_t i=display.width()-1; i>=0; i-=4) {\n    display.drawLine(display.width()-1, display.height()-1, i, 0, WHITE);\n    display.display();\n  }\n  for (int16_t i=display.height()-1; i>=0; i-=4) {\n    display.drawLine(display.width()-1, display.height()-1, 0, i, WHITE);\n    display.display();\n  }\n  delay(250);\n\n  display.clearDisplay();\n  for (int16_t i=0; i<display.height(); i+=4) {\n    display.drawLine(display.width()-1, 0, 0, i, WHITE);\n    display.display();\n  }\n  for (int16_t i=0; i<display.width(); i+=4) {\n    display.drawLine(display.width()-1, 0, i, display.height()-1, WHITE);\n    display.display();\n  }\n  delay(250);\n}\n\nvoid testscrolltext(void) {\n  display.setTextSize(2);\n  display.setTextColor(WHITE);\n  display.setCursor(10,0);\n  display.clearDisplay();\n  display.println(\"scroll\");\n  display.display();\n\n  display.startscrollright(0x00, 0x0F);\n  delay(2000);\n  display.stopscroll();\n  delay(1000);\n  display.startscrollleft(0x00, 0x0F);\n  delay(2000);\n  display.stopscroll();\n  delay(1000);\n  display.startscrolldiagright(0x00, 0x07);\n  delay(2000);\n  display.startscrolldiagleft(0x00, 0x07);\n  delay(2000);\n  display.stopscroll();\n\n\n}\nvoid loop() {\n  \/\/ draw many lines\n  testdrawline();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw rectangles\n  testdrawrect();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw multiple rectangles\n  testfillrect();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw mulitple circles\n  testdrawcircle();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  testdrawroundrect();\n  delay(2000);\n  display.clearDisplay();\n\n  testfillroundrect();\n  delay(2000);\n  display.clearDisplay();\n\n  testdrawtriangle();\n  delay(2000);\n  display.clearDisplay();\n\n  testfilltriangle();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw the first ~12 characters in the font\n  testdrawchar();\n  display.display();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw scrolling text\n  testscrolltext();\n  delay(2000);\n  display.clearDisplay();\n\n  \/\/ draw a bitmap icon and 'animate' movement\n  testdrawbitmap(logo16_glcd_bmp, LOGO16_GLCD_HEIGHT, LOGO16_GLCD_WIDTH);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fmpgeimp.hxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 23:17:39 $\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 _SVX_FMUNOPGE_HXX\n#define _SVX_FMUNOPGE_HXX\n\n#ifndef _COM_SUN_STAR_SDBC_XDATASOURCE_HPP_\n#include <com\/sun\/star\/sdbc\/XDataSource.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FORM_XFORMCOMPONENT_HPP_\n#include <com\/sun\/star\/form\/XFormComponent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FORM_XFORM_HPP_\n#include <com\/sun\/star\/form\/XForm.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMECONTAINER_HPP_\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n\n#ifndef _COMPHELPER_UNO3_HXX_\n#include <comphelper\/uno3.hxx>\n#endif\n\n#ifndef INCLUDED_SVXDLLAPI_H\n#include \"svx\/dllapi.h\"\n#endif\n\nclass SvStream;\n\/\/BFS01class SdrIOHeader;\nclass FmFormObj;\nclass FmFormPage;\nclass SdrObject;\n\n\/\/FORWARD_DECLARE_INTERFACE(uno,Reference)\nFORWARD_DECLARE_INTERFACE(io,XObjectOutputStream)\nFORWARD_DECLARE_INTERFACE(io,XObjectInputStream)\nFORWARD_DECLARE_INTERFACE(container,XIndexContainer)\n\nclass SdrObjList;\n\nDECLARE_LIST(FmObjectList, FmFormObj*);\n\n\/\/==================================================================\n\/\/ FmFormPageImpl\n\/\/ lauscht an allen Containern, um festzustellen, wann Objecte\n\/\/ eingefuegt worden sind und wann diese entfernt wurden\n\/\/==================================================================\n\nclass SVX_DLLPRIVATE FmFormPageImpl\n{\n    friend class FmFormPage;\n    friend class FmFormObj;\n    friend class FmXFormShell;\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm>                xCurrentForm;\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer>  m_xForms;\n    FmFormPage*             pPage;\n\n    sal_Bool        m_bFirstActivation  : 1;\n    sal_Bool        m_bAttemptedFormCreation : 2;\n\nprotected:\n    FmFormPageImpl(FmFormPage* _pPage);\n    FmFormPageImpl(FmFormPage* _pPage, const FmFormPageImpl& rImpl);\n    ~FmFormPageImpl();\n\n    void Init();\n\npublic:\n    \/\/  nur wichtig fuer den DesignMode\n    void setCurForm(::com::sun::star::uno::Reference< ::com::sun::star::form::XForm> xForm);\n    ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm> getDefaultForm();\n\n    \/** inserts a form component into the form component hierarchy\n\n        If the given component does not yet belong into the form hierarchy, a suitable place for\n        it is found, using <member>findFormForDataSource<\/member>, if possible.\n\n        If no sutiable form is found, a new one is created, and also inserted into the\n        hierarchy.\n    *\/\n    ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm> placeInFormComponentHierarchy(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormComponent>& rContent,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>& rDatabase = ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>(),\n        const ::rtl::OUString& rDBTitle = ::rtl::OUString(),\n        const ::rtl::OUString& rCursorSource = ::rtl::OUString(),\n        sal_Int32 nCommandType = 0\n    );\n\n    \/\/ activation handling\n    inline  sal_Bool    hasEverBeenActivated( ) const { return !m_bFirstActivation; }\n    inline  void        setHasBeenActivated( ) { m_bFirstActivation = sal_False; }\n\nprotected:\n    \/\/ lesen und schreiben der Objecte\n\/\/BFS01 void WriteData(SvStream& rOut) const; \/\/\n\/\/BFS01 void ReadData(const SdrIOHeader& rHead, SvStream& rIn); \/\/\n\n    void write(const ::com::sun::star::uno::Reference< ::com::sun::star::io::XObjectOutputStream>& OutStream) const;\n    void read(const ::com::sun::star::uno::Reference< ::com::sun::star::io::XObjectInputStream>& InStream);\n\n    const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer>& getForms( bool _bForceCreate = true );\n\n    void fillList(FmObjectList& rList, const SdrObjList& rObjList, sal_Bool bConnected) const;\n\n    \/** finds a form with a given data source signature\n        @param rForm\n            the form to start the search with. This form, including all possible sub forms,\n            will be examined\n        @param rDatabase\n            the data source which to which the found form must be bound\n        @param rCommand\n            the desired Command property value of the sought-after form\n        @param nCommandType\n            the desired CommandType property value of the sought-after form\n    *\/\n    ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm> findFormForDataSource(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm>& rForm,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>& rDatabase,\n        const ::rtl::OUString& rCommand,\n        sal_Int32 nCommandType\n    );\n\n    ::rtl::OUString getDefaultName(\n                        sal_Int16 _nClassId,\n                        const ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm>& _rxControls,\n                        const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XServiceInfo >& _rxObject\n                    ) const;\n\nprivate:\n    \/** validates whether <member>xCurrentForm<\/member> is still valid and to be used\n\n        There are situations where our current form becomes invalid, without us noticing this. Thus,\n        every method which accesses <member>xCurrentForm<\/member> should beforehand validate the current\n        form by calling this method.\n\n        If <member>xCurrentForm<\/member> is not valid anymore, it is reset to <NULL\/>.\n\n        @since #i40086#\n    *\/\n    void    validateCurForm();\n\npublic:\n\n    static UniString getDefaultName(\n                        sal_Int16 nClassId,\n                        const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XServiceInfo >& _rxObject\n                    );\n\n    ::rtl::OUString setUniqueName(const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormComponent>& xFormComponent, const ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm>& xControls);\n    ::rtl::OUString getUniqueName(const ::rtl::OUString& rName, const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess>& xNamedSet) const;\n};\n\n\n#endif \/\/ _SVX_FMUNOPGE_HXX\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.14.220); FILE MERGED 2006\/02\/17 15:24:48 cl 1.14.220.1: warning free code changes<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fmpgeimp.hxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 16:05: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#ifndef _SVX_FMUNOPGE_HXX\n#define _SVX_FMUNOPGE_HXX\n\n#ifndef _COM_SUN_STAR_SDBC_XDATASOURCE_HPP_\n#include <com\/sun\/star\/sdbc\/XDataSource.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FORM_XFORMCOMPONENT_HPP_\n#include <com\/sun\/star\/form\/XFormComponent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FORM_XFORM_HPP_\n#include <com\/sun\/star\/form\/XForm.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMECONTAINER_HPP_\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n\n#ifndef _COMPHELPER_UNO3_HXX_\n#include <comphelper\/uno3.hxx>\n#endif\n\n#ifndef INCLUDED_SVXDLLAPI_H\n#include \"svx\/dllapi.h\"\n#endif\n\nclass SvStream;\n\/\/BFS01class SdrIOHeader;\nclass FmFormObj;\nclass FmFormPage;\nclass SdrObject;\n\n\/\/FORWARD_DECLARE_INTERFACE(uno,Reference)\nFORWARD_DECLARE_INTERFACE(io,XObjectOutputStream)\nFORWARD_DECLARE_INTERFACE(io,XObjectInputStream)\nFORWARD_DECLARE_INTERFACE(container,XIndexContainer)\n\nclass SdrObjList;\n\nDECLARE_LIST(FmObjectList, FmFormObj*)\n\n\/\/==================================================================\n\/\/ FmFormPageImpl\n\/\/ lauscht an allen Containern, um festzustellen, wann Objecte\n\/\/ eingefuegt worden sind und wann diese entfernt wurden\n\/\/==================================================================\n\nclass SVX_DLLPRIVATE FmFormPageImpl\n{\n    friend class FmFormPage;\n    friend class FmFormObj;\n    friend class FmXFormShell;\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm>                xCurrentForm;\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer>  m_xForms;\n    FmFormPage*             pPage;\n\n    sal_Bool        m_bFirstActivation  : 1;\n    sal_Bool        m_bAttemptedFormCreation : 2;\n\nprotected:\n    FmFormPageImpl(FmFormPage* _pPage);\n    FmFormPageImpl(FmFormPage* _pPage, const FmFormPageImpl& rImpl);\n    ~FmFormPageImpl();\n\n    void Init();\n\npublic:\n    \/\/  nur wichtig fuer den DesignMode\n    void setCurForm(::com::sun::star::uno::Reference< ::com::sun::star::form::XForm> xForm);\n    ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm> getDefaultForm();\n\n    \/** inserts a form component into the form component hierarchy\n\n        If the given component does not yet belong into the form hierarchy, a suitable place for\n        it is found, using <member>findFormForDataSource<\/member>, if possible.\n\n        If no sutiable form is found, a new one is created, and also inserted into the\n        hierarchy.\n    *\/\n    ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm> placeInFormComponentHierarchy(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormComponent>& rContent,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>& rDatabase = ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>(),\n        const ::rtl::OUString& rDBTitle = ::rtl::OUString(),\n        const ::rtl::OUString& rCursorSource = ::rtl::OUString(),\n        sal_Int32 nCommandType = 0\n    );\n\n    \/\/ activation handling\n    inline  sal_Bool    hasEverBeenActivated( ) const { return !m_bFirstActivation; }\n    inline  void        setHasBeenActivated( ) { m_bFirstActivation = sal_False; }\n\nprotected:\n    \/\/ lesen und schreiben der Objecte\n\/\/BFS01 void WriteData(SvStream& rOut) const; \/\/\n\/\/BFS01 void ReadData(const SdrIOHeader& rHead, SvStream& rIn); \/\/\n\n    void write(const ::com::sun::star::uno::Reference< ::com::sun::star::io::XObjectOutputStream>& OutStream) const;\n    void read(const ::com::sun::star::uno::Reference< ::com::sun::star::io::XObjectInputStream>& InStream);\n\n    const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer>& getForms( bool _bForceCreate = true );\n\n    void fillList(FmObjectList& rList, const SdrObjList& rObjList, sal_Bool bConnected) const;\n\n    \/** finds a form with a given data source signature\n        @param rForm\n            the form to start the search with. This form, including all possible sub forms,\n            will be examined\n        @param rDatabase\n            the data source which to which the found form must be bound\n        @param rCommand\n            the desired Command property value of the sought-after form\n        @param nCommandType\n            the desired CommandType property value of the sought-after form\n    *\/\n    ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm> findFormForDataSource(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm>& rForm,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>& rDatabase,\n        const ::rtl::OUString& rCommand,\n        sal_Int32 nCommandType\n    );\n\n    ::rtl::OUString getDefaultName(\n                        sal_Int16 _nClassId,\n                        const ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm>& _rxControls,\n                        const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XServiceInfo >& _rxObject\n                    ) const;\n\nprivate:\n    \/** validates whether <member>xCurrentForm<\/member> is still valid and to be used\n\n        There are situations where our current form becomes invalid, without us noticing this. Thus,\n        every method which accesses <member>xCurrentForm<\/member> should beforehand validate the current\n        form by calling this method.\n\n        If <member>xCurrentForm<\/member> is not valid anymore, it is reset to <NULL\/>.\n\n        @since #i40086#\n    *\/\n    void    validateCurForm();\n\npublic:\n\n    static UniString getDefaultName(\n                        sal_Int16 nClassId,\n                        const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XServiceInfo >& _rxObject\n                    );\n\n    ::rtl::OUString setUniqueName(const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormComponent>& xFormComponent, const ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm>& xControls);\n    ::rtl::OUString getUniqueName(const ::rtl::OUString& rName, const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess>& xNamedSet) const;\n};\n\n\n#endif \/\/ _SVX_FMUNOPGE_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cption.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-27 11:56: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 _CPTION_HXX\n#define _CPTION_HXX\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 _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 _GROUP_HXX \/\/autogen\n#include <vcl\/group.hxx>\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n#ifndef _ACTCTRL_HXX \/\/autogen\n#include <actctrl.hxx>\n#endif\n\n\n#ifndef _COM_SUN_STAR_CONTAINER_XENUMERATIONACCESS_HPP_\n#include <com\/sun\/star\/container\/XEnumerationAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XHIERARCHICALNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XHierarchicalNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCONTENTENUMERATIONACCESS_HPP_\n#include <com\/sun\/star\/container\/XContentEnumerationAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XENUMERATION_HPP_\n#include <com\/sun\/star\/container\/XEnumeration.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XELEMENTACCESS_HPP_\n#include <com\/sun\/star\/container\/XElementAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XINDEXACCESS_HPP_\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMED_HPP_\n#include <com\/sun\/star\/container\/XNamed.hpp>\n#endif\n\nclass SwFldMgr;\nclass SwView;\n\n#include <wrtsh.hxx>\n#include \"optload.hxx\"\n#include \"swlbox.hxx\"\n\n\nclass SwCaptionDialog : public SvxStandardDialog\n{\n    class CategoryBox : public ComboBox\n    {\n    public:\n        CategoryBox( Window* pParent, const ResId& rResId )\n            : ComboBox( pParent, rResId )\n        {}\n\n        virtual long    PreNotify( NotifyEvent& rNEvt );\n    };\n\n    FixedText    aTextText;\n    Edit         aTextEdit;\n    FixedLine    aSettingsFL;\n    FixedText    aCategoryText;\n    CategoryBox  aCategoryBox;\n    FixedText    aFormatText;\n    ListBox      aFormatBox;\n    FixedText    aSepText;\n    Edit         aSepEdit;\n    FixedText    aPosText;\n    ListBox      aPosBox;\n    OKButton     aOKButton;\n    CancelButton aCancelButton;\n    HelpButton   aHelpButton;\n    PushButton   aAutoCaptionButton;\n    PushButton   aOptionButton;\n\n    String       sNone;\n\n    SwCaptionPreview    aPrevWin;\n\n    SwView       &rView; \/\/Suchen per aktive ::com::sun::star::sdbcx::View vermeiden.\n    SwFldMgr     *pMgr;      \/\/Ptr um das include zu sparen\n    SelectionType eType;\n\n    String       sCharacterStyle;\n    String       sObjectName;\n    bool         bCopyAttributes;\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >    xNameAccess;\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNamed >         xNamed;\n\n    DECL_LINK( SelectHdl, ListBox * );\n    DECL_LINK( ModifyHdl, Edit * );\n    DECL_LINK( OptionHdl, Button * );\n    DECL_LINK( CaptionHdl, PushButton*);\n\n    virtual void Apply();\n\n    void    DrawSample();\n    void    CheckButtonWidth();\n\npublic:\n     SwCaptionDialog( Window *pParent, SwView &rV );\n    ~SwCaptionDialog();\n};\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS os107 (1.9.76); FILE MERGED 2007\/11\/07 10:19:37 os 1.9.76.1: #i61007# caption localisable<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cption.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: ihi $ $Date: 2007-11-21 18:23: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 _CPTION_HXX\n#define _CPTION_HXX\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 _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 _GROUP_HXX \/\/autogen\n#include <vcl\/group.hxx>\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n#ifndef _ACTCTRL_HXX \/\/autogen\n#include <actctrl.hxx>\n#endif\n\n\n#ifndef _COM_SUN_STAR_CONTAINER_XENUMERATIONACCESS_HPP_\n#include <com\/sun\/star\/container\/XEnumerationAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XHIERARCHICALNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XHierarchicalNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCONTENTENUMERATIONACCESS_HPP_\n#include <com\/sun\/star\/container\/XContentEnumerationAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XENUMERATION_HPP_\n#include <com\/sun\/star\/container\/XEnumeration.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XELEMENTACCESS_HPP_\n#include <com\/sun\/star\/container\/XElementAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XINDEXACCESS_HPP_\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMED_HPP_\n#include <com\/sun\/star\/container\/XNamed.hpp>\n#endif\n\nclass SwFldMgr;\nclass SwView;\n\n#include <wrtsh.hxx>\n#include \"optload.hxx\"\n#include \"swlbox.hxx\"\n\n\nclass SwCaptionDialog : public SvxStandardDialog\n{\n    class CategoryBox : public ComboBox\n    {\n    public:\n        CategoryBox( Window* pParent, const ResId& rResId )\n            : ComboBox( pParent, rResId )\n        {}\n\n        virtual long    PreNotify( NotifyEvent& rNEvt );\n    };\n\n    FixedText    aTextText;\n    Edit         aTextEdit;\n    FixedLine    aSettingsFL;\n    FixedText    aCategoryText;\n    CategoryBox  aCategoryBox;\n    FixedText    aFormatText;\n    ListBox      aFormatBox;\n    \/\/#i61007# order of captions\n    FixedText    aNumberingSeparatorFT;\n    Edit         aNumberingSeparatorED;\n    FixedText    aSepText;\n    Edit         aSepEdit;\n    FixedText    aPosText;\n    ListBox      aPosBox;\n    OKButton     aOKButton;\n    CancelButton aCancelButton;\n    HelpButton   aHelpButton;\n    PushButton   aAutoCaptionButton;\n    PushButton   aOptionButton;\n\n    String       sNone;\n\n    SwCaptionPreview    aPrevWin;\n\n    SwView       &rView; \/\/Suchen per aktive ::com::sun::star::sdbcx::View vermeiden.\n    SwFldMgr     *pMgr;      \/\/Ptr um das include zu sparen\n    SelectionType eType;\n\n    String       sCharacterStyle;\n    String       sObjectName;\n    bool         bCopyAttributes;\n    bool        bOrderNumberingFirst; \/\/#i61007# order of captions\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >    xNameAccess;\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNamed >         xNamed;\n\n    DECL_LINK( SelectHdl, ListBox * );\n    DECL_LINK( ModifyHdl, Edit * );\n    DECL_LINK( OptionHdl, Button * );\n    DECL_LINK( CaptionHdl, PushButton*);\n\n    virtual void Apply();\n\n    void    DrawSample();\n    void    CheckButtonWidth();\n    void    ApplyCaptionOrder(); \/\/#i61007# order of captions\n\npublic:\n     SwCaptionDialog( Window *pParent, SwView &rV );\n    ~SwCaptionDialog();\n};\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: dbtree.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2004-08-12 13:03:54 $\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 _DBTREE_HXX\n#define _DBTREE_HXX\n\n#ifndef _SVTREEBOX_HXX\n#include <svtools\/svtreebx.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\nnamespace com{namespace sun{namespace star{namespace container{\n    class XNameAccess;\n}}}}\n\n#ifndef _SWTYPES_HXX\n#include <swtypes.hxx>\n#endif\n#ifndef _SWUNODEF_HXX\n#include <swunodef.hxx>\n#endif\nclass SwDBTreeList_Impl;\nclass SwWrtShell;\nclass SwDBTreeList : public SvTreeListBox\n{\n    ImageList       aImageList;\n    ImageList       aImageListHC;\n    Image           aDBBMP;\n    Image           aTableBMP;\n    Image           aQueryBMP;\n\n    String          sDefDBName;\n    BOOL            bInitialized;\n    BOOL            bShowColumns;\n\n    SwDBTreeList_Impl* pImpl;\n\n    DECL_LINK( DBCompare, SvSortData* );\n\n    void            InitTreeList();\n    virtual void    RequestingChilds( SvLBoxEntry* pParent );\n\n    virtual sal_Int8 AcceptDrop( const AcceptDropEvent& rEvt );\n    virtual void    StartDrag( sal_Int8 nAction, const Point& rPosPixel );\n\npublic:\n     SwDBTreeList( Window* pParent, const ResId& rResId,\n                    SwWrtShell* pSh,\n                    const String& rDefDBName = aEmptyStr,\n                    const BOOL bShowCol = FALSE );\n    virtual ~SwDBTreeList();\n\n    String  GetDBName( String& rTableName, String& rColumnName, BOOL* pbIsTable = 0);\n    void    Select( const String& rDBName, const String& rTableName,\n                    const String& rColumnName );\n\n    void    ShowColumns(BOOL bShowCol);\n    void    SetWrtShell(SwWrtShell& rSh);\n\n    void    AddDataSource(const String& rSource);\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS tune03 (1.7.268); FILE MERGED 2004\/08\/09 21:49:49 mhu 1.7.268.2: RESYNC: (1.7-1.8); FILE MERGED 2004\/07\/19 19:11:26 mhu 1.7.268.1: #i29979# Added SW_DLLPUBLIC\/PRIVATE (see swdllapi.h) to exported symbols\/classes.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: dbtree.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: rt $ $Date: 2004-08-23 08:58: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 _DBTREE_HXX\n#define _DBTREE_HXX\n\n#ifndef _SVTREEBOX_HXX\n#include <svtools\/svtreebx.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n\nnamespace com{namespace sun{namespace star{namespace container{\n    class XNameAccess;\n}}}}\n\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n#ifndef _SWTYPES_HXX\n#include <swtypes.hxx>\n#endif\n#ifndef _SWUNODEF_HXX\n#include <swunodef.hxx>\n#endif\n\nclass SwDBTreeList_Impl;\nclass SwWrtShell;\n\nclass SW_DLLPUBLIC SwDBTreeList : public SvTreeListBox\n{\n    ImageList       aImageList;\n    ImageList       aImageListHC;\n    Image           aDBBMP;\n    Image           aTableBMP;\n    Image           aQueryBMP;\n\n    String          sDefDBName;\n    BOOL            bInitialized;\n    BOOL            bShowColumns;\n\n    SwDBTreeList_Impl* pImpl;\n\n    SW_DLLPRIVATE DECL_LINK( DBCompare, SvSortData* );\n\n    SW_DLLPRIVATE void          InitTreeList();\n    SW_DLLPRIVATE virtual void  RequestingChilds( SvLBoxEntry* pParent );\n\n    SW_DLLPRIVATE virtual sal_Int8 AcceptDrop( const AcceptDropEvent& rEvt );\n    SW_DLLPRIVATE virtual void  StartDrag( sal_Int8 nAction, const Point& rPosPixel );\n\npublic:\n     SwDBTreeList( Window* pParent, const ResId& rResId,\n                    SwWrtShell* pSh,\n                    const String& rDefDBName = aEmptyStr,\n                    const BOOL bShowCol = FALSE );\n    virtual ~SwDBTreeList();\n\n    String  GetDBName( String& rTableName, String& rColumnName, BOOL* pbIsTable = 0);\n    void    Select( const String& rDBName, const String& rTableName,\n                    const String& rColumnName );\n\n    void    ShowColumns(BOOL bShowCol);\n    void    SetWrtShell(SwWrtShell& rSh);\n\n    void    AddDataSource(const String& rSource);\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include <string.h>\n#include <signal.h>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <thread>\n#include <set>\n#include \"msg_filter.hpp\"\n#include \"io_policy\/line.hpp\"\n#include \"io_policy\/sysv_mq.hpp\"\n#include \"io_policy\/tcp.hpp\"\n#include \"sub_entry.hpp\"\n#include \"util.hpp\"\n\nusing namespace std;\nusing namespace wissbi;\n\nbool run = true;\n\nvoid exit_signal_handler(int signum) {\n    run = false;\n}\n\nint main(int argc, char* argv[]){\n    signal(SIGINT, exit_signal_handler);\n    signal(SIGTERM, exit_signal_handler);\n\n    if(getenv(\"WISSBI_PID_FILE\") != NULL) {\n        ofstream ofs(getenv(\"WISSBI_PID_FILE\"));\n        ofs << getpid() << endl;\n    }\n\n    int serv = socket(AF_INET, SOCK_STREAM, 0);\n    sockaddr serv_addr;\n    util::ConnectStringToSockaddr(\"0.0.0.0:0\", reinterpret_cast<sockaddr_in*>(&serv_addr));\n    if(-1 == ::bind(serv, &serv_addr, sizeof(serv_addr))) {\n        cerr << \"bind error\" << endl;\n        return -1;\n    }\n    if(-1 == listen(serv, 10)) {\n        cerr << \"listen error\" << endl;\n        return -1;\n    }\n    socklen_t len = sizeof(serv_addr);;\n    getsockname(serv, &serv_addr, &len);\n    cerr <<\"after listen port \"<<ntohs(((sockaddr_in*)&serv_addr)->sin_port)<<endl;\n\n    ostringstream tmp;\n    tmp << util::GetHostIP() << \":\" << ntohs(((sockaddr_in*)&serv_addr)->sin_port);\n    \n    SubEntry sub_entry(getenv(\"WISSBI_META_DIR\") != NULL ? getenv(\"WISSBI_META_DIR\") : \"\/var\/lib\/wissbi\", argv[1], tmp.str());\n\n    MsgFilter<io_policy::SysvMq, io_policy::Line> output_writer;\n    output_writer.mq_init(\"\");\n    output_writer.auto_flush();\n    thread* output_th = new thread([&output_writer](){\n        output_writer.FilterLoop();\n    });\n\n    struct timeval tv;\n    tv.tv_sec = 1;\n    tv.tv_usec = 0;\n    setsockopt(serv, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv));\n  \n    while(run) {\n        sockaddr other_addr;\n        socklen_t len;\n        int res = accept(serv, &other_addr, &len);\n        if(res > 0){\n            cerr << \"connected \" << res << endl;\n            struct timeval tv;\n            tv.tv_sec = 0;\n            tv.tv_usec = 0;\n            setsockopt(res, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv)); \n            thread([res]{\n                MsgFilter<io_policy::TCP, io_policy::SysvMq> filter;\n                filter.mq_init(\"\");\n                filter.set_cleanup(false);\n                filter.AttachConnectedSock(res);\n                filter.FilterLoop();\n            }).detach();\n        }\n        sub_entry.renew();\n    }\n\n    return 0;\n}\n\n<commit_msg>make wissbi-sub support length message format<commit_after>#include <string.h>\n#include <signal.h>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <thread>\n#include <set>\n#include \"msg_filter.hpp\"\n#include \"io_policy\/line.hpp\"\n#include \"io_policy\/length.hpp\"\n#include \"io_policy\/sysv_mq.hpp\"\n#include \"io_policy\/tcp.hpp\"\n#include \"sub_entry.hpp\"\n#include \"util.hpp\"\n\nusing namespace std;\nusing namespace wissbi;\n\nbool run = true;\n\nvoid exit_signal_handler(int signum) {\n    run = false;\n}\n\ntemplate<class OutputWriter>\nvoid run_sub(const std::string& src) {\n    int serv = socket(AF_INET, SOCK_STREAM, 0);\n    sockaddr serv_addr;\n    util::ConnectStringToSockaddr(\"0.0.0.0:0\", reinterpret_cast<sockaddr_in*>(&serv_addr));\n    if(-1 == ::bind(serv, &serv_addr, sizeof(serv_addr))) {\n        cerr << \"bind error\" << endl;\n        throw std::runtime_error(\"bind error\");\n    }\n    if(-1 == listen(serv, 10)) {\n        cerr << \"listen error\" << endl;\n        throw std::runtime_error(\"listen error\");\n    }\n    socklen_t len = sizeof(serv_addr);;\n    getsockname(serv, &serv_addr, &len);\n    cerr <<\"after listen port \"<<ntohs(((sockaddr_in*)&serv_addr)->sin_port)<<endl;\n\n    ostringstream tmp;\n    tmp << util::GetHostIP() << \":\" << ntohs(((sockaddr_in*)&serv_addr)->sin_port);\n    \n    SubEntry sub_entry(getenv(\"WISSBI_META_DIR\") != NULL ? getenv(\"WISSBI_META_DIR\") : \"\/var\/lib\/wissbi\", src, tmp.str());\n\n    OutputWriter output_writer;\n    output_writer.mq_init(\"\");\n    output_writer.auto_flush();\n    thread* output_th = new thread([&output_writer](){\n        output_writer.FilterLoop();\n    });\n\n    struct timeval tv;\n    tv.tv_sec = 1;\n    tv.tv_usec = 0;\n    setsockopt(serv, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv));\n  \n    while(run) {\n        sockaddr other_addr;\n        socklen_t len;\n        int res = accept(serv, &other_addr, &len);\n        if(res > 0){\n            cerr << \"connected \" << res << endl;\n            struct timeval tv;\n            tv.tv_sec = 0;\n            tv.tv_usec = 0;\n            setsockopt(res, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv)); \n            thread([res]{\n                MsgFilter<io_policy::TCP, io_policy::SysvMq> filter;\n                filter.mq_init(\"\");\n                filter.set_cleanup(false);\n                filter.AttachConnectedSock(res);\n                filter.FilterLoop();\n            }).detach();\n        }\n        sub_entry.renew();\n    }\n}\n\nint main(int argc, char* argv[]){\n    signal(SIGINT, exit_signal_handler);\n    signal(SIGTERM, exit_signal_handler);\n\n    std::string src(argv[1]);\n\n    if(getenv(\"WISSBI_PID_FILE\") != NULL) {\n        ofstream ofs(getenv(\"WISSBI_PID_FILE\"));\n        ofs << getpid() << endl;\n    }\n\n    char* msg_format = getenv(\"WISSBI_MESSAGE_FORMAT\");\n    if(msg_format) {\n        if(std::string(msg_format) == \"line\") {\n            run_sub<MsgFilter<io_policy::SysvMq, io_policy::Line>>(src);\n        }\n        else if(std::string(msg_format) == \"length\") {\n            run_sub<MsgFilter<io_policy::SysvMq, io_policy::Length>>(src);\n        }\n        else {\n            std::cerr << \"unknown message format: \" << msg_format << std::endl;\n            return 1;\n        }\n    }\n    else {\n        run_sub<MsgFilter<io_policy::SysvMq, io_policy::Line>>(src);\n    }\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: frmmgr.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: kz $ $Date: 2004-05-18 15:00: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#ifndef _FRMMGR_HXX\n#define _FRMMGR_HXX\n\n#include \"swtypes.hxx\"\n#include \"frmatr.hxx\"\n\n#ifndef _SVX_SVXENUM_HXX \/\/autogen\n#include <svx\/svxenum.hxx>\n#endif\n#ifndef _GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n#ifndef _FMTFSIZE_HXX \/\/autogen\n#include <fmtfsize.hxx>\n#endif\n#ifndef _FMTSRND_HXX \/\/autogen\n#include <fmtsrnd.hxx>\n#endif\n#ifndef _FMTORNT_HXX \/\/autogen\n#include <fmtornt.hxx>\n#endif\n#ifndef _FMTANCHR_HXX \/\/autogen\n#include <fmtanchr.hxx>\n#endif\n\nclass   SwWrtShell;\nstruct  SwFrmValid;\n\nclass   SwFmt;\nclass   SwFmtCol;\n\nconst SwTwips   DFLT_WIDTH      = MM50 * 4;\nconst SwTwips   DFLT_HEIGHT     = MM50;\n\n#define FULL_ATTRSET    0xffff\n\n#define FRMMGR_TYPE_NONE    0x00\n#define FRMMGR_TYPE_TEXT    0x01\n#define FRMMGR_TYPE_GRF     0x02\n#define FRMMGR_TYPE_OLE     0x04\n#define FRMMGR_TYPE_LABEL   0x08\n#define FRMMGR_TYPE_ENVELP  0x10\n\nclass SwFlyFrmAttrMgr\n{\n    SfxItemSet  aSet;\n    Point       aAbsPos;\n    SwWrtShell  *pOwnSh;\n\n    BOOL        bAbsPos,\n                bNewFrm;\n    BOOL        bIsInVertical;\n\n    \/\/ interne Verrechnung fuer Umrandung\n    SwTwips             CalcTopSpace();\n    SwTwips             CalcBottomSpace();\n    SwTwips             CalcLeftSpace();\n    SwTwips             CalcRightSpace();\n\n    void _UpdateFlyFrm();   \/\/Nacharbeit nach Einfuegen oder Update\n\npublic:\n    SwFlyFrmAttrMgr( BOOL bNew, SwWrtShell* pSh, BYTE nType );\n\n    \/\/CopyCtor fuer die Dialoge, zum Pruefen der Metrics\n    SwFlyFrmAttrMgr( BOOL bNew, SwWrtShell *pSh, const SfxItemSet &rSet );\n\n    inline SwWrtShell*  GetShell() { return pOwnSh; }\n\n    void                SetAnchor(RndStdIds eId);\n    inline RndStdIds    GetAnchor()  const;\n\n    void                SetHorzOrientation(SwHoriOrient eOrient);\n    void                SetVertOrientation(SvxFrameVertOrient eOrient);\n\n    \/\/ Absolute Position\n    void                SetAbsPos(const Point& rLPoint);\n\n    \/\/ Relative Position vom Anker\n    void                SetPos(const Point& rLPoint);\n    inline Point        GetPos() const;\n\n    \/\/ Groesse\n    void                SetSize(const Size& rLSize);\n    inline const Size&  GetSize() const;\n    void                SetFrmSize(const SwFmtFrmSize& rFrmSize);\n\n    inline USHORT       GetHeightPercent() const;\n\n    void                SetHeightSizeType(SwFrmSize eType);\n\n    \/\/ Abstand zum Inhalt\n    void                SetLRSpace( long nLeft  = LONG_MAX,\n                                    long nRight = LONG_MAX );\n    void                SetULSpace( long nTop   = LONG_MAX,\n                                    long nBottom= LONG_MAX );\n\n    void                SetWrapType(SwSurround eSurround);\n\n    void                SetAnchorOnly(BOOL bSet);\n    void                SetContour( BOOL bSet);\n    void                SetTransparent(BOOL bTrans);\n\n    void                ProtectPosSize(BOOL bProt);\n\n    void                SetCol( const SwFmtCol &rCol);\n\n    \/\/ Attribute aendern und erfragen\n    void                UpdateAttrMgr();\n    void                UpdateFlyFrm();\n\n    \/\/ neuen Rahmen erzeugen\n    BOOL                InsertFlyFrm();\n    void                InsertFlyFrm(RndStdIds      eAnchorType,\n                                   const Point    &rPos,\n                                   const Size     &rSize,\n                                   BOOL           bAbsPos = FALSE);\n\n    \/\/ Metriken pruefen und  aendern\n    void                ValidateMetrics(SwFrmValid& rVal, BOOL bOnlyPercentRefValue = FALSE);\n\n    void                DelAttr(USHORT nId);\n\n    \/\/ Set rausreichen\n    inline const SfxItemSet &GetAttrSet() const { return aSet; }\n    inline       SfxItemSet &GetAttrSet()       { return aSet; }\n    void                     SetAttrSet(const SfxItemSet& rSet);\n\n    inline const SwFmtVertOrient &GetVertOrient() const;\n    inline const SwFmtHoriOrient &GetHoriOrient() const;\n    inline const SvxShadowItem   &GetShadow() const;\n    inline const SvxBoxItem      &GetBox() const;\n    inline const SwFmtSurround   &GetSurround() const;\n    inline const SwFmtFrmSize    &GetFrmSize() const;\n\n    long CalcWidthSpace();\n    long CalcHeightSpace();\n\n    long CalcWidthBorder()  { return CalcLeftSpace()+CalcRightSpace(); }\n    long CalcHeightBorder() { return CalcTopSpace()+CalcBottomSpace(); }\n};\n\n\/*--------------------------------------------------------------------\n    Beschreibung: Validierung von Metriken\n --------------------------------------------------------------------*\/\n\n\/\/ OD 18.09.2003 #i18732# - extend by new member <bFollowTextFlow>\n\/\/ OD 12.11.2003 #i22341# - extend by new member <pToCharCntntPos>\nstruct SwFrmValid\n{\n    RndStdIds           eArea;\n    SwHoriOrient        eHori;\n    SvxFrameVertOrient  eVert;\n    SwRelationOrient    eHRel;\n    SwRelationOrient    eVRel;\n    BOOL                bAutoHeight;\n    BOOL                bAutoWidth;\n    BOOL                bMirror;\n    \/\/ OD 18.09.2003 #i18732#\n    bool                bFollowTextFlow;\n    \/\/ OD 12.11.2003 #i22341# - proposed content position of character for\n    \/\/ to character anchored objects horizontal\/vertical aligned at character\n    \/\/ respectively vertical aligned at top of line\n    const SwPosition* pToCharCntntPos;\n\n    SwTwips nHPos;\n    SwTwips nMaxHPos;\n    SwTwips nMinHPos;\n\n    SwTwips nVPos;\n    SwTwips nMaxVPos;\n    SwTwips nMinVPos;\n\n    SwTwips nWidth;\n    SwTwips nMinWidth;\n    SwTwips nMaxWidth;\n\n    SwTwips nHeight;\n    SwTwips nMinHeight;\n    SwTwips nMaxHeight;\n\n    Size    aPercentSize;   \/\/ Size fuer 100%-Wert\n\n    SwFrmValid();\n};\n\n\ninline const Size& SwFlyFrmAttrMgr::GetSize() const\n{\n    return ((SwFmtFrmSize&)aSet.Get(RES_FRM_SIZE)).GetSize();\n}\n\ninline const SwFmtVertOrient &SwFlyFrmAttrMgr::GetVertOrient() const\n{\n    return ((SwFmtVertOrient&)aSet.Get(RES_VERT_ORIENT));\n}\ninline const SwFmtHoriOrient &SwFlyFrmAttrMgr::GetHoriOrient() const\n{\n    return ((SwFmtHoriOrient &)aSet.Get(RES_HORI_ORIENT));\n}\ninline const SwFmtFrmSize& SwFlyFrmAttrMgr::GetFrmSize() const\n{\n    return ((SwFmtFrmSize&)aSet.Get(RES_FRM_SIZE));\n}\ninline const SvxShadowItem &SwFlyFrmAttrMgr::GetShadow() const\n{\n    return ((SvxShadowItem&)aSet.Get(RES_SHADOW));\n}\ninline const SvxBoxItem &SwFlyFrmAttrMgr::GetBox() const\n{\n    return ((SvxBoxItem&)aSet.Get(RES_BOX));\n}\ninline const SwFmtSurround &SwFlyFrmAttrMgr::GetSurround() const\n{\n    return ((SwFmtSurround&)aSet.Get(RES_SURROUND));\n}\n\ninline Point SwFlyFrmAttrMgr::GetPos() const\n{\n    return Point( GetHoriOrient().GetPos(), GetVertOrient().GetPos() );\n}\n\ninline RndStdIds SwFlyFrmAttrMgr::GetAnchor()  const\n{\n    return ((SwFmtAnchor&)aSet.Get(RES_ANCHOR)).GetAnchorId();\n}\n\ninline USHORT SwFlyFrmAttrMgr::GetHeightPercent() const\n{\n    return GetFrmSize().GetHeightPercent();\n}\n\n#endif\n<commit_msg>INTEGRATION: CWS swdrawpositioning (1.3.82); FILE MERGED 2004\/06\/21 08:03:18 od 1.3.82.3: RESYNC: (1.4-1.5); FILE MERGED resolve merge conflict. 2004\/03\/30 15:02:05 os 1.3.82.2: #i26173# SwFrmMgr::ValidateMetrics changed 2004\/03\/08 09:05:55 os 1.3.82.1: #i26173# draw positioning TabPage in svx created -> strings moved to svx<commit_after>\/*************************************************************************\n *\n *  $RCSfile: frmmgr.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hjs $ $Date: 2004-06-28 13:49:33 $\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 _FRMMGR_HXX\n#define _FRMMGR_HXX\n\n#include \"swtypes.hxx\"\n#include \"frmatr.hxx\"\n\n#ifndef _SVX_SVXENUM_HXX \/\/autogen\n#include <svx\/svxenum.hxx>\n#endif\n#ifndef _GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n#ifndef _FMTFSIZE_HXX \/\/autogen\n#include <fmtfsize.hxx>\n#endif\n#ifndef _FMTSRND_HXX \/\/autogen\n#include <fmtsrnd.hxx>\n#endif\n#ifndef _FMTORNT_HXX \/\/autogen\n#include <fmtornt.hxx>\n#endif\n#ifndef _FMTANCHR_HXX \/\/autogen\n#include <fmtanchr.hxx>\n#endif\n\nclass   SwWrtShell;\nstruct  SvxSwFrameValidation;\nstruct  SwPosition;\n\n\nclass   SwFmt;\nclass   SwFmtCol;\n\nconst SwTwips   DFLT_WIDTH      = MM50 * 4;\nconst SwTwips   DFLT_HEIGHT     = MM50;\n\n#define FULL_ATTRSET    0xffff\n\n#define FRMMGR_TYPE_NONE    0x00\n#define FRMMGR_TYPE_TEXT    0x01\n#define FRMMGR_TYPE_GRF     0x02\n#define FRMMGR_TYPE_OLE     0x04\n#define FRMMGR_TYPE_LABEL   0x08\n#define FRMMGR_TYPE_ENVELP  0x10\n\nclass SwFlyFrmAttrMgr\n{\n    SfxItemSet  aSet;\n    Point       aAbsPos;\n    SwWrtShell  *pOwnSh;\n\n    BOOL        bAbsPos,\n                bNewFrm;\n    BOOL        bIsInVertical;\n\n    \/\/ interne Verrechnung fuer Umrandung\n    SwTwips             CalcTopSpace();\n    SwTwips             CalcBottomSpace();\n    SwTwips             CalcLeftSpace();\n    SwTwips             CalcRightSpace();\n\n    void _UpdateFlyFrm();   \/\/Nacharbeit nach Einfuegen oder Update\n\npublic:\n    SwFlyFrmAttrMgr( BOOL bNew, SwWrtShell* pSh, BYTE nType );\n\n    \/\/CopyCtor fuer die Dialoge, zum Pruefen der Metrics\n    SwFlyFrmAttrMgr( BOOL bNew, SwWrtShell *pSh, const SfxItemSet &rSet );\n\n    inline SwWrtShell*  GetShell() { return pOwnSh; }\n\n    void                SetAnchor(RndStdIds eId);\n    inline RndStdIds    GetAnchor()  const;\n\n    void                SetHorzOrientation(SwHoriOrient eOrient);\n    void                SetVertOrientation(SvxFrameVertOrient eOrient);\n\n    \/\/ Absolute Position\n    void                SetAbsPos(const Point& rLPoint);\n\n    \/\/ Relative Position vom Anker\n    void                SetPos(const Point& rLPoint);\n    inline Point        GetPos() const;\n\n    \/\/ Groesse\n    void                SetSize(const Size& rLSize);\n    inline const Size&  GetSize() const;\n    void                SetFrmSize(const SwFmtFrmSize& rFrmSize);\n\n    inline USHORT       GetHeightPercent() const;\n\n    void                SetHeightSizeType(SwFrmSize eType);\n\n    \/\/ Abstand zum Inhalt\n    void                SetLRSpace( long nLeft  = LONG_MAX,\n                                    long nRight = LONG_MAX );\n    void                SetULSpace( long nTop   = LONG_MAX,\n                                    long nBottom= LONG_MAX );\n\n    void                SetWrapType(SwSurround eSurround);\n\n    void                SetAnchorOnly(BOOL bSet);\n    void                SetContour( BOOL bSet);\n    void                SetTransparent(BOOL bTrans);\n\n    void                ProtectPosSize(BOOL bProt);\n\n    void                SetCol( const SwFmtCol &rCol);\n\n    \/\/ Attribute aendern und erfragen\n    void                UpdateAttrMgr();\n    void                UpdateFlyFrm();\n\n    \/\/ neuen Rahmen erzeugen\n    BOOL                InsertFlyFrm();\n    void                InsertFlyFrm(RndStdIds      eAnchorType,\n                                   const Point    &rPos,\n                                   const Size     &rSize,\n                                   BOOL           bAbsPos = FALSE);\n\n    \/\/ Metriken pruefen und  aendern\n    void                ValidateMetrics(SvxSwFrameValidation& rVal,\n                            const SwPosition* pToCharCntntPos,\n                            BOOL bOnlyPercentRefValue = FALSE);\n\n    void                DelAttr(USHORT nId);\n\n    \/\/ Set rausreichen\n    inline const SfxItemSet &GetAttrSet() const { return aSet; }\n    inline       SfxItemSet &GetAttrSet()       { return aSet; }\n    void                     SetAttrSet(const SfxItemSet& rSet);\n\n    inline const SwFmtVertOrient &GetVertOrient() const;\n    inline const SwFmtHoriOrient &GetHoriOrient() const;\n    inline const SvxShadowItem   &GetShadow() const;\n    inline const SvxBoxItem      &GetBox() const;\n    inline const SwFmtSurround   &GetSurround() const;\n    inline const SwFmtFrmSize    &GetFrmSize() const;\n\n    long CalcWidthSpace();\n    long CalcHeightSpace();\n\n    long CalcWidthBorder()  { return CalcLeftSpace()+CalcRightSpace(); }\n    long CalcHeightBorder() { return CalcTopSpace()+CalcBottomSpace(); }\n};\n\ninline const Size& SwFlyFrmAttrMgr::GetSize() const\n{\n    return ((SwFmtFrmSize&)aSet.Get(RES_FRM_SIZE)).GetSize();\n}\n\ninline const SwFmtVertOrient &SwFlyFrmAttrMgr::GetVertOrient() const\n{\n    return ((SwFmtVertOrient&)aSet.Get(RES_VERT_ORIENT));\n}\ninline const SwFmtHoriOrient &SwFlyFrmAttrMgr::GetHoriOrient() const\n{\n    return ((SwFmtHoriOrient &)aSet.Get(RES_HORI_ORIENT));\n}\ninline const SwFmtFrmSize& SwFlyFrmAttrMgr::GetFrmSize() const\n{\n    return ((SwFmtFrmSize&)aSet.Get(RES_FRM_SIZE));\n}\ninline const SvxShadowItem &SwFlyFrmAttrMgr::GetShadow() const\n{\n    return ((SvxShadowItem&)aSet.Get(RES_SHADOW));\n}\ninline const SvxBoxItem &SwFlyFrmAttrMgr::GetBox() const\n{\n    return ((SvxBoxItem&)aSet.Get(RES_BOX));\n}\ninline const SwFmtSurround &SwFlyFrmAttrMgr::GetSurround() const\n{\n    return ((SwFmtSurround&)aSet.Get(RES_SURROUND));\n}\n\ninline Point SwFlyFrmAttrMgr::GetPos() const\n{\n    return Point( GetHoriOrient().GetPos(), GetVertOrient().GetPos() );\n}\n\ninline RndStdIds SwFlyFrmAttrMgr::GetAnchor()  const\n{\n    return ((SwFmtAnchor&)aSet.Get(RES_ANCHOR)).GetAnchorId();\n}\n\ninline USHORT SwFlyFrmAttrMgr::GetHeightPercent() const\n{\n    return GetFrmSize().GetHeightPercent();\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include<iostream>\n#include<vector>\n#include<cstdio>\n#include<string>\n#include<thread>\n#include<dirent.h>\n#include<chrono>\n#include<sys\/socket.h>\n#include<netinet\/in.h>\n#include<sys\/types.h>\n#include<arpa\/inet.h>\n#include<fcntl.h>\n#include<unistd.h>\n#include<cstdlib>\n#include<sys\/wait.h>\n#include<string.h>\n#include<mutex>\n#define SUCCESS 0\n#define FAILURE 1\n#define BCAST_PORT 5000\n#define REQ_LISTNER_PORT 6000\n#define MAX_SIZE 1024\n#define CLI_ID \"101\"\n#define TOKEN \"#\"\n#define PORT 54545\nstd::mutex listner_mutex;\n\nvoid file_bcast()\n{\n\t\/\/Current Client Socket\n\tint bcast_sockfd;\n\t\n\tbcast_sockfd = socket(AF_INET, SOCK_DGRAM, 0);\n\n\tstruct sockaddr_in new_addr;\n\tmemset(&new_addr, 0, sizeof(new_addr));\n\tnew_addr.sin_family = AF_INET;\n\tnew_addr.sin_port = PORT;\n\tnew_addr.sin_addr.s_addr = htonl(INADDR_ANY);\n\n\twhile(1)\n\t{\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(5000));\n\t\tDIR *dir;\n\t\tstruct dirent *ent;\n\t\tchar fs_data[MAX_SIZE];\n\t\tmemset(fs_data, 0, MAX_SIZE);\n\t\tstrcpy(fs_data, CLI_ID);\n\n\t\tif ((dir = opendir (\".\/\")) != NULL) \n\t\t{\n  \t\t\twhile((ent = readdir (dir)) != NULL)\n \t\t\t{\n\t\t\t\tif (!strcmp(ent->d_name, \".\") || !strcmp(ent->d_name, \"..\"))\n          \t\t\t{continue;}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstrcat(fs_data, TOKEN);\n  \t\t\t\t\tstrcat(fs_data, ent->d_name);\n          \t\t\t}\n\t\t\t}\n\t\t}\n  \t\tclosedir (dir);\n\t\tstd::cout << fs_data << std::endl;\t\t\n\t\tsendto(bcast_sockfd, fs_data, strlen(fs_data), 0, (struct sockaddr *)&new_addr, sizeof(struct sockaddr_in)); \n\n\n\n\t}\n}\n\n\n\nint main(int argc, char **argv)\n{\n\t\n\tstd::thread broadcaster(file_bcast);\n\/\/\tstd::thread listener(bcast_listener);\n\tbroadcaster.detach();\n\n\/\/\tlistener.detach();\n\twhile(1){}\n\n\treturn SUCCESS;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<commit_msg>Base app<commit_after>#include<iostream>\n#include<vector>\n#include<cstdio>\n#include<string>\n#include<thread>\n#include<dirent.h>\n#include<chrono>\n#include<sys\/socket.h>\n#include<netinet\/in.h>\n#include<sys\/types.h>\n#include<arpa\/inet.h>\n#include<fcntl.h>\n#include<unistd.h>\n#include<cstdlib>\n#include<sys\/wait.h>\n#include<string.h>\n#include<mutex>\n#define SUCCESS 0\n#define FAILURE 1\n#define MAX_SIZE 1024\n#define CLI_ID \"101\"\n#define TOKEN \"#\"\n#define BCAST_PORT 6000\n#define LISTENER_PORT 54545\n\nvoid fs_bcast()\n{\n\t\/\/Current Client Socket\n\tint bcast_sockfd;\n\t\n\tbcast_sockfd = socket(AF_INET, SOCK_DGRAM, 0);\n\n\tstruct sockaddr_in new_addr;\n\tmemset(&new_addr, 0, sizeof(new_addr));\n\tnew_addr.sin_family = AF_INET;\n\tnew_addr.sin_port = BCAST_PORT;\n\tnew_addr.sin_addr.s_addr = htonl(INADDR_ANY);\n\n\twhile(1)\n\t{\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(5000));\n\t\tDIR *dir;\n\t\tstruct dirent *ent;\n\t\tchar fs_data[MAX_SIZE];\n\t\tmemset(fs_data, 0, MAX_SIZE);\n\t\tstrcpy(fs_data, CLI_ID);\n\t\tif ((dir = opendir (\".\/\")) != NULL) \n\t\t{\n  \t\t\twhile((ent = readdir (dir)) != NULL)\n \t\t\t{\n\t\t\t\tif (!strcmp(ent->d_name, \".\") || !strcmp(ent->d_name, \"..\"))\n          \t\t\t{continue;}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstrcat(fs_data, TOKEN);\n  \t\t\t\t\tstrcat(fs_data, ent->d_name);\n          \t\t\t}\n\t\t\t}\n\t\t}\n  \t\tclosedir (dir);\n\t\tstd::cout << fs_data << std::endl;\t\t\n\t\tsendto(bcast_sockfd, fs_data, strlen(fs_data), 0, (struct sockaddr *)&new_addr, sizeof(struct sockaddr_in)); \n\t}\n}\n\n\nvoid bcast_listener()\n{\n\tint sockfd;\n\tstd::cout<<\"Hello\"<<std::endl;\n\tstruct sockaddr_in new_addr;\n\tstruct sockaddr_in cli_addr;\n\tunsigned slen = sizeof(cli_addr);\n\n\tsockfd = socket(AF_INET, SOCK_DGRAM, 0);\n\n\tmemset(&new_addr, 0, sizeof(new_addr));\n\tnew_addr.sin_family = AF_INET;\n\tnew_addr.sin_port = LISTENER_PORT;\n\tnew_addr.sin_addr.s_addr = htonl(INADDR_ANY);\n\n\tint bind_status = bind(sockfd, (struct sockaddr*)&new_addr, sizeof(new_addr));\n\n\twhile(1)\n\t{\n\t\tchar bcast_buffer[1024];\n\t\tmemset(bcast_buffer, 0, sizeof(bcast_buffer));\n\t\trecvfrom(sockfd, bcast_buffer, sizeof(bcast_buffer)-1, 0, (sockaddr *)&cli_addr, &slen);\n\t\tstd::cout << \"Listening..\" <<std::endl;\n\t\tstd::cout << \"GOT FS\" << bcast_buffer << std::endl;\n\t}\n}\n\n\n\nint main(int argc, char **argv)\n{\n\t\n\tstd::thread broadcaster(fs_bcast);\n\tstd::thread listener(bcast_listener);\n\tbroadcaster.detach();\n\tlistener.detach();\n\twhile(1){}\n\treturn SUCCESS;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\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: popbox.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: vg $ $Date: 2007-10-22 15:22: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 _POPBOX_HXX\n#define _POPBOX_HXX\n\n\n#ifndef _TOOLBOX_HXX\n#include <vcl\/toolbox.hxx>\n#endif\n#ifndef _TRANSFER_HXX\n#include <svtools\/transfer.hxx>\n#endif\n\nclass SwNavigationPI;\n\nclass SwHelpToolBox: public ToolBox, public DropTargetHelper\n{\n    Link aDoubleClickLink;\n    Link aRightClickLink;       \/\/ Link bekommt MouseEvent als Parameter !!!\n\n    using ToolBox::DoubleClick;\n\nprotected:\n    virtual void MouseButtonDown(const MouseEvent &rEvt);\n    virtual long DoubleClick(ToolBox *);\n    virtual sal_Int8    AcceptDrop( const AcceptDropEvent& rEvt );\n    virtual sal_Int8    ExecuteDrop( const ExecuteDropEvent& rEvt );\n\npublic:\n    SwHelpToolBox(SwNavigationPI* pParent, const ResId &);\n    ~SwHelpToolBox();\n    void SetDoubleClickLink(const Link &);      \/\/ inline\n    void SetRightClickLink(const Link &);       \/\/ inline\n};\n\ninline void SwHelpToolBox::SetDoubleClickLink(const Link &rLink) {\n    aDoubleClickLink = rLink;\n}\n\ninline void SwHelpToolBox::SetRightClickLink(const Link &rLink) {\n    aRightClickLink = rLink;\n}\n\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.216); FILE MERGED 2008\/04\/01 15:59:18 thb 1.6.216.2: #i85898# Stripping all external header guards 2008\/03\/31 16:58:38 rt 1.6.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: popbox.hxx,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#ifndef _POPBOX_HXX\n#define _POPBOX_HXX\n\n\n#ifndef _TOOLBOX_HXX\n#include <vcl\/toolbox.hxx>\n#endif\n#include <svtools\/transfer.hxx>\n\nclass SwNavigationPI;\n\nclass SwHelpToolBox: public ToolBox, public DropTargetHelper\n{\n    Link aDoubleClickLink;\n    Link aRightClickLink;       \/\/ Link bekommt MouseEvent als Parameter !!!\n\n    using ToolBox::DoubleClick;\n\nprotected:\n    virtual void MouseButtonDown(const MouseEvent &rEvt);\n    virtual long DoubleClick(ToolBox *);\n    virtual sal_Int8    AcceptDrop( const AcceptDropEvent& rEvt );\n    virtual sal_Int8    ExecuteDrop( const ExecuteDropEvent& rEvt );\n\npublic:\n    SwHelpToolBox(SwNavigationPI* pParent, const ResId &);\n    ~SwHelpToolBox();\n    void SetDoubleClickLink(const Link &);      \/\/ inline\n    void SetRightClickLink(const Link &);       \/\/ inline\n};\n\ninline void SwHelpToolBox::SetDoubleClickLink(const Link &rLink) {\n    aDoubleClickLink = rLink;\n}\n\ninline void SwHelpToolBox::SetRightClickLink(const Link &rLink) {\n    aRightClickLink = rLink;\n}\n\n\n#endif\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 <sstream>\n#include <thread>\n#include <chrono>\n\n#include \"uci.h\"\n#include \"position.h\"\n#include \"move.h\"\n#include \"search.h\"\n\nstatic SearchController sc;\n\nnamespace UCI\n{\n    namespace Extension\n    {\n        void print()\n        {\n            print_position(sc.pos);\n        }\n\n        void perft(std::stringstream &ss)\n        {\n            int depth = 0;\n            ss >> depth;\n            if(depth < 1) {depth = 1;}\n\n            std::uint64_t nodes = 0ULL;\n            for(int i = 1; i <= depth; ++i)\n            {\n                auto start = std::chrono::high_resolution_clock::now();\n                nodes = perft(sc.pos, i);\n                auto finish = std::chrono::high_resolution_clock::now();\n                std::chrono::duration<double> elapsed = finish - start;\n\n                std::cout << \"info\"\n                          << \" depth \" << i\n                          << \" nodes \" << nodes\n                          << \" time \" << static_cast<int>(elapsed.count()*1000)\n                          << \" nps \" << static_cast<int>(nodes\/elapsed.count())\n                          << std::endl;\n            }\n\n            std::cout << \"nodes \" << nodes << std::endl;\n        }\n\n        void ttperft(std::stringstream &ss)\n        {\n            int depth = 0;\n            ss >> depth;\n            if(depth < 1) {depth = 1;}\n\n            std::uint64_t nodes = 0ULL;\n            for(int i = 1; i <= depth; ++i)\n            {\n                auto start = std::chrono::high_resolution_clock::now();\n                nodes = perft_tt(&sc.tt, sc.pos, i);\n                auto finish = std::chrono::high_resolution_clock::now();\n                std::chrono::duration<double> elapsed = finish - start;\n\n                std::cout << \"info\"\n                          << \" depth \" << i\n                          << \" nodes \" << nodes\n                          << \" time \" << static_cast<int>(elapsed.count()*1000)\n                          << \" nps \" << static_cast<int>(nodes\/elapsed.count())\n                          << std::endl;\n            }\n\n            std::cout << \"nodes \" << nodes << std::endl;\n        }\n    }\n\n    void ucinewgame()\n    {\n        parse_fen_to_position(\n            \"rnbqkbnr\/pppppppp\/8\/8\/8\/8\/PPPPPPPP\/RNBQKBNR w KQkq - 0 1\",\n            sc.pos\n        );\n        tt_clear(&sc.tt);\n    }\n\n    void isready()\n    {\n        std::cout << \"readyok\" << std::endl;\n    }\n\n    \/\/ setoption name Some Name value Some Value\n    void setoption(std::stringstream &ss)\n    {\n        std::string word;\n        std::string name = \"\";\n        std::string value = \"\";\n\n        if (ss >> word && word != \"name\") {\n            return;\n        }\n\n        \/\/ Collect the name\n        while (ss >> word && word != \"value\") {\n            if (name != \"\") {name += \" \";}\n            name += word;\n        }\n\n        \/\/ Collect the value\n        while (ss >> word) {\n            if (value != \"\") {value += \" \";}\n            value += word;\n        }\n\n        \/\/ Set the option\n        if (name != \"\" && value != \"\") {\n            \/\/ TODO:\n            \/\/ Set the option if found\n        }\n    }\n\n    void go(std::stringstream &ss)\n    {\n        sc.max_depth = MAX_PLY;\n        sc.moves_per_session = 0;\n        sc.increment = 0;\n        sc.search_start_time = 0;\n        sc.search_end_time = 0;\n        sc.movetime = 0;\n\n        int wtime = -1;\n        int btime = -1;\n        int winc = -1;\n        int binc = -1;\n\n        std::string word;\n        while (ss >> word) {\n            if (word == \"wtime\")          {ss >> wtime;}\n            else if (word == \"btime\")     {ss >> btime;}\n            else if (word == \"winc\")      {ss >> winc;}\n            else if (word == \"binc\")      {ss >> binc;}\n            else if (word == \"depth\")     {ss >> sc.max_depth;}\n            else if (word == \"movetime\")  {ss >> sc.movetime;}\n            else if (word == \"movestogo\") {ss >> sc.moves_per_session;}\n        }\n\n        if (sc.pos.flipped) {\n            sc.our_clock = btime;\n            sc.increment = binc;\n        } else {\n            sc.our_clock = wtime;\n            sc.increment = winc;\n        }\n\n        std::thread search(search_thread, &sc);\n        search.detach();\n    }\n\n    void moves(std::stringstream &ss)\n    {\n        std::string word;\n        while (ss >> word) {\n            Move move;\n            if (!lan_to_move(sc.pos, word.c_str(), move)) {\n                return;\n            }\n\n            char move_str[5];\n            move_to_lan(move_str, move);\n\n            if (sc.pos.flipped) {\n                move = flip_move(move);\n            }\n\n            make_move(sc.pos, move);\n        }\n    }\n\n    void position(std::stringstream &ss)\n    {\n        std::string fen = \"\";\n\n        std::string word;\n        while (ss >> word && word != \"moves\") {\n            if (word == \"startpos\") {\n                fen = \"rnbqkbnr\/pppppppp\/8\/8\/8\/8\/PPPPPPPP\/RNBQKBNR w KQkq - 0 1\";\n            } else if (word != \"fen\") {\n                fen += word;\n            }\n        }\n\n        if (fen != \"\") {\n            parse_fen_to_position(fen.c_str(), sc.pos);\n        }\n\n        moves(ss);\n    }\n\n    void listen()\n    {\n        std::cout << \"id name Monochrome\" << std::endl;\n        std::cout << \"id author flok Gikoskos kz04px mkchan ZirconiumX\" << std::endl;\n        std::cout << \"uciok\" << std::endl;\n\n        std::string word;\n        std::string line;\n        while (true) {\n            std::getline(std::cin, line);\n            std::stringstream ss {line};\n            ss >> word;\n\n            if (word == \"isready\")         {isready(); break;}\n            else if (word == \"setoption\")  {setoption(ss);}\n            else if (word == \"quit\")       {return;}\n        }\n\n        tt_create(&sc.tt, 128);\n        ucinewgame();\n\n        bool quit = false;\n        while (!quit) {\n            std::getline(std::cin, line);\n            std::stringstream ss {line};\n            ss >> word;\n\n            if (word == \"isready\")         {isready();}\n            else if (word == \"ucinewgame\") {ucinewgame();}\n            else if (word == \"position\")   {position(ss);}\n            else if (word == \"go\")         {go(ss);}\n            else if (word == \"print\")      {Extension::print();}\n            else if (word == \"perft\")      {Extension::perft(ss);}\n            else if (word == \"ttperft\")    {Extension::ttperft(ss);}\n            else if (word == \"moves\")      {moves(ss);}\n            else if (word == \"quit\")       {quit = true;}\n        }\n    }\n}\n<commit_msg>Parsing fix<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 <sstream>\n#include <thread>\n#include <chrono>\n\n#include \"uci.h\"\n#include \"position.h\"\n#include \"move.h\"\n#include \"search.h\"\n\nstatic SearchController sc;\n\nnamespace UCI\n{\n    namespace Extension\n    {\n        void print()\n        {\n            print_position(sc.pos);\n        }\n\n        void perft(std::stringstream &ss)\n        {\n            int depth = 0;\n            ss >> depth;\n            if(depth < 1) {depth = 1;}\n\n            std::uint64_t nodes = 0ULL;\n            for(int i = 1; i <= depth; ++i)\n            {\n                auto start = std::chrono::high_resolution_clock::now();\n                nodes = perft(sc.pos, i);\n                auto finish = std::chrono::high_resolution_clock::now();\n                std::chrono::duration<double> elapsed = finish - start;\n\n                std::cout << \"info\"\n                          << \" depth \" << i\n                          << \" nodes \" << nodes\n                          << \" time \" << static_cast<int>(elapsed.count()*1000)\n                          << \" nps \" << static_cast<int>(nodes\/elapsed.count())\n                          << std::endl;\n            }\n\n            std::cout << \"nodes \" << nodes << std::endl;\n        }\n\n        void ttperft(std::stringstream &ss)\n        {\n            int depth = 0;\n            ss >> depth;\n            if(depth < 1) {depth = 1;}\n\n            std::uint64_t nodes = 0ULL;\n            for(int i = 1; i <= depth; ++i)\n            {\n                auto start = std::chrono::high_resolution_clock::now();\n                nodes = perft_tt(&sc.tt, sc.pos, i);\n                auto finish = std::chrono::high_resolution_clock::now();\n                std::chrono::duration<double> elapsed = finish - start;\n\n                std::cout << \"info\"\n                          << \" depth \" << i\n                          << \" nodes \" << nodes\n                          << \" time \" << static_cast<int>(elapsed.count()*1000)\n                          << \" nps \" << static_cast<int>(nodes\/elapsed.count())\n                          << std::endl;\n            }\n\n            std::cout << \"nodes \" << nodes << std::endl;\n        }\n    }\n\n    void ucinewgame()\n    {\n        parse_fen_to_position(\n            \"rnbqkbnr\/pppppppp\/8\/8\/8\/8\/PPPPPPPP\/RNBQKBNR w KQkq - 0 1\",\n            sc.pos\n        );\n        tt_clear(&sc.tt);\n    }\n\n    void isready()\n    {\n        std::cout << \"readyok\" << std::endl;\n    }\n\n    \/\/ setoption name Some Name value Some Value\n    void setoption(std::stringstream &ss)\n    {\n        std::string word;\n        std::string name = \"\";\n        std::string value = \"\";\n\n        if (ss >> word && word != \"name\") {\n            return;\n        }\n\n        \/\/ Collect the name\n        while (ss >> word && word != \"value\") {\n            if (name != \"\") {name += \" \";}\n            name += word;\n        }\n\n        \/\/ Collect the value\n        while (ss >> word) {\n            if (value != \"\") {value += \" \";}\n            value += word;\n        }\n\n        \/\/ Set the option\n        if (name != \"\" && value != \"\") {\n            \/\/ TODO:\n            \/\/ Set the option if found\n        }\n    }\n\n    void go(std::stringstream &ss)\n    {\n        sc.max_depth = MAX_PLY;\n        sc.moves_per_session = 0;\n        sc.increment = 0;\n        sc.search_start_time = 0;\n        sc.search_end_time = 0;\n        sc.movetime = 0;\n\n        int wtime = -1;\n        int btime = -1;\n        int winc = -1;\n        int binc = -1;\n\n        std::string word;\n        while (ss >> word) {\n            if (word == \"wtime\")          {ss >> wtime;}\n            else if (word == \"btime\")     {ss >> btime;}\n            else if (word == \"winc\")      {ss >> winc;}\n            else if (word == \"binc\")      {ss >> binc;}\n            else if (word == \"depth\")     {ss >> sc.max_depth;}\n            else if (word == \"movetime\")  {ss >> sc.movetime;}\n            else if (word == \"movestogo\") {ss >> sc.moves_per_session;}\n        }\n\n        if (sc.pos.flipped) {\n            sc.our_clock = btime;\n            sc.increment = binc;\n        } else {\n            sc.our_clock = wtime;\n            sc.increment = winc;\n        }\n\n        std::thread search(search_thread, &sc);\n        search.detach();\n    }\n\n    void moves(std::stringstream &ss)\n    {\n        std::string word;\n        while (ss >> word) {\n            Move move;\n            if (!lan_to_move(sc.pos, word.c_str(), move)) {\n                return;\n            }\n\n            char move_str[5];\n            move_to_lan(move_str, move);\n\n            if (sc.pos.flipped) {\n                move = flip_move(move);\n            }\n\n            make_move(sc.pos, move);\n        }\n    }\n\n    void position(std::stringstream &ss)\n    {\n        std::string fen = \"\";\n\n        std::string word;\n        while (ss >> word && word != \"moves\") {\n            if (word == \"startpos\") {\n                fen = \"rnbqkbnr\/pppppppp\/8\/8\/8\/8\/PPPPPPPP\/RNBQKBNR w KQkq - 0 1\";\n            } else if (word != \"fen\") {\n                if (fen != \"\") {fen += \" \";}\n                fen += word;\n            }\n        }\n\n        if (fen != \"\") {\n            parse_fen_to_position(fen.c_str(), sc.pos);\n        }\n\n        moves(ss);\n    }\n\n    void listen()\n    {\n        std::cout << \"id name Monochrome\" << std::endl;\n        std::cout << \"id author flok Gikoskos kz04px mkchan ZirconiumX\" << std::endl;\n        std::cout << \"uciok\" << std::endl;\n\n        std::string word;\n        std::string line;\n        while (true) {\n            std::getline(std::cin, line);\n            std::stringstream ss {line};\n            ss >> word;\n\n            if (word == \"isready\")         {isready(); break;}\n            else if (word == \"setoption\")  {setoption(ss);}\n            else if (word == \"quit\")       {return;}\n        }\n\n        tt_create(&sc.tt, 128);\n        ucinewgame();\n\n        bool quit = false;\n        while (!quit) {\n            std::getline(std::cin, line);\n            std::stringstream ss {line};\n            ss >> word;\n\n            if (word == \"isready\")         {isready();}\n            else if (word == \"ucinewgame\") {ucinewgame();}\n            else if (word == \"position\")   {position(ss);}\n            else if (word == \"go\")         {go(ss);}\n            else if (word == \"print\")      {Extension::print();}\n            else if (word == \"perft\")      {Extension::perft(ss);}\n            else if (word == \"ttperft\")    {Extension::ttperft(ss);}\n            else if (word == \"moves\")      {moves(ss);}\n            else if (word == \"quit\")       {quit = true;}\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <uri>\n#include <regex>\n#include <iostream>\n\nusing namespace uri;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst URI::Span_t URI::zero_span_;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nURI::URI(const char* uri)\n  : URI{std::string{uri}}\n{}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nURI::URI(const std::string& uri)\n  : uri_str_{uri}\n  , port_{}\n{\n  parse(uri_str_);\n  load_queries();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::scheme() const {\n  static std::string scheme;\n\n  if (scheme.empty()) {\n    scheme = uri_str_.substr(scheme_.begin, scheme_.end);\n  }\n\n  return scheme;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::userinfo() const {\n  static std::string userinfo;\n\n  if (userinfo.empty()) {\n    userinfo = uri_str_.substr(userinfo_.begin, userinfo_.end);\n  }\n\n  return userinfo;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::host() const {\n  static std::string host;\n\n  if (host.empty()) {\n    host = uri_str_.substr(host_.begin, host_.end);\n  }\n\n  return host;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::port_str() const {\n  static std::string port;\n\n  if (port.empty()) {\n    port = uri_str_.substr(port_str_.begin, port_str_.end);\n  }\n\n  return port;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nuint16_t URI::port() const noexcept {\n  if (not port_) {\n    port_ = port_str_.begin ? static_cast<uint16_t>(std::stoi(port_str())) : 0;\n  }\n  return port_;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::path() const {\n  static std::string path;\n\n  if (path.empty()) {\n    path = uri_str_.substr(path_.begin, path_.end);\n  }\n\n  return path;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::query() const {\n  static std::string query;\n\n  if (query.empty()){\n    query = uri_str_.substr(query_.begin, query_.end);\n  }\n\n  return query;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::fragment() const {\n  static std::string fragment;\n\n  if (fragment.empty()) {\n    fragment = uri_str_.substr(fragment_.begin, fragment_.end);\n  }\n\n  return fragment;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string URI::query(const std::string& key) {\n  static std::string no_entry_value;\n  auto target = queries_.find(key);\n  return (target not_eq queries_.end()) ? decode(target->second) : no_entry_value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string URI::to_string() const{\n  return uri_str_;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nURI::operator std::string () const {\n  return uri_str_;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid URI::parse(const std::string& uri) {\n  static const std::regex uri_pattern_matcher\n  {\n    \"^([a-zA-z]+[\\\\w\\\\+\\\\-\\\\.]+)?(\\\\:\/\/)?\" \/\/< scheme\n    \"(([^:@]+)(\\\\:([^@]+))?@)?\"            \/\/< username && password\n    \"([^\/:?#]+)?(\\\\:(\\\\d+))?\"              \/\/< hostname && port\n    \"([^?#]+)\"                             \/\/< path\n    \"(\\\\?([^#]*))?\"                        \/\/< query\n    \"(#(.*))?$\"                            \/\/< fragment\n  };\n\n  static std::smatch uri_parts;\n\n  if (std::regex_match(uri, uri_parts, uri_pattern_matcher)) {\n    path_     = Span_t(uri_parts.position(10), uri_parts.length(10));\n\n    scheme_   = uri_parts.length(1)  ? Span_t(uri_parts.position(1),  uri_parts.length(1))  : zero_span_;\n    userinfo_ = uri_parts.length(3)  ? Span_t(uri_parts.position(3),  uri_parts.length(3))  : zero_span_;\n    host_     = uri_parts.length(7)  ? Span_t(uri_parts.position(7),  uri_parts.length(7))  : zero_span_;\n    port_str_ = uri_parts.length(9)  ? Span_t(uri_parts.position(9),  uri_parts.length(9))  : zero_span_;\n    query_    = uri_parts.length(11) ? Span_t(uri_parts.position(11), uri_parts.length(11)) : zero_span_;\n    fragment_ = uri_parts.length(13) ? Span_t(uri_parts.position(13), uri_parts.length(13)) : zero_span_;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid URI::load_queries() {\n  static const std::regex queries_matcher {\"[^?=&]+\"};\n\n  auto& queries = query();\n\n  auto position = std::sregex_iterator(queries.begin(), queries.end(), queries_matcher);\n  auto end      = std::sregex_iterator();\n\n  while (position not_eq end) {\n    auto key = (*position).str();\n\n    if ((++position) not_eq end) {\n      queries_[key] = (*position++).str();\n      continue;\n    } else {\n      queries_[key];\n    }\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::ostream& uri::operator<< (std::ostream& out, const URI& uri) {\n  return out << uri.to_string();\n}\n<commit_msg>Renamed queries_matcher to queries_tokenizer<commit_after>#include <uri>\n#include <regex>\n#include <iostream>\n\nusing namespace uri;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst URI::Span_t URI::zero_span_;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nURI::URI(const char* uri)\n  : URI{std::string{uri}}\n{}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nURI::URI(const std::string& uri)\n  : uri_str_{uri}\n  , port_{}\n{\n  parse(uri_str_);\n  load_queries();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::scheme() const {\n  static std::string scheme;\n\n  if (scheme.empty()) {\n    scheme = uri_str_.substr(scheme_.begin, scheme_.end);\n  }\n\n  return scheme;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::userinfo() const {\n  static std::string userinfo;\n\n  if (userinfo.empty()) {\n    userinfo = uri_str_.substr(userinfo_.begin, userinfo_.end);\n  }\n\n  return userinfo;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::host() const {\n  static std::string host;\n\n  if (host.empty()) {\n    host = uri_str_.substr(host_.begin, host_.end);\n  }\n\n  return host;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::port_str() const {\n  static std::string port;\n\n  if (port.empty()) {\n    port = uri_str_.substr(port_str_.begin, port_str_.end);\n  }\n\n  return port;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nuint16_t URI::port() const noexcept {\n  if (not port_) {\n    port_ = port_str_.begin ? static_cast<uint16_t>(std::stoi(port_str())) : 0;\n  }\n  return port_;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::path() const {\n  static std::string path;\n\n  if (path.empty()) {\n    path = uri_str_.substr(path_.begin, path_.end);\n  }\n\n  return path;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::query() const {\n  static std::string query;\n\n  if (query.empty()){\n    query = uri_str_.substr(query_.begin, query_.end);\n  }\n\n  return query;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst std::string& URI::fragment() const {\n  static std::string fragment;\n\n  if (fragment.empty()) {\n    fragment = uri_str_.substr(fragment_.begin, fragment_.end);\n  }\n\n  return fragment;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string URI::query(const std::string& key) {\n  static std::string no_entry_value;\n  auto target = queries_.find(key);\n  return (target not_eq queries_.end()) ? decode(target->second) : no_entry_value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string URI::to_string() const{\n  return uri_str_;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nURI::operator std::string () const {\n  return uri_str_;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid URI::parse(const std::string& uri) {\n  static const std::regex uri_pattern_matcher\n  {\n    \"^([a-zA-z]+[\\\\w\\\\+\\\\-\\\\.]+)?(\\\\:\/\/)?\" \/\/< scheme\n    \"(([^:@]+)(\\\\:([^@]+))?@)?\"            \/\/< username && password\n    \"([^\/:?#]+)?(\\\\:(\\\\d+))?\"              \/\/< hostname && port\n    \"([^?#]+)\"                             \/\/< path\n    \"(\\\\?([^#]*))?\"                        \/\/< query\n    \"(#(.*))?$\"                            \/\/< fragment\n  };\n\n  static std::smatch uri_parts;\n\n  if (std::regex_match(uri, uri_parts, uri_pattern_matcher)) {\n    path_     = Span_t(uri_parts.position(10), uri_parts.length(10));\n\n    scheme_   = uri_parts.length(1)  ? Span_t(uri_parts.position(1),  uri_parts.length(1))  : zero_span_;\n    userinfo_ = uri_parts.length(3)  ? Span_t(uri_parts.position(3),  uri_parts.length(3))  : zero_span_;\n    host_     = uri_parts.length(7)  ? Span_t(uri_parts.position(7),  uri_parts.length(7))  : zero_span_;\n    port_str_ = uri_parts.length(9)  ? Span_t(uri_parts.position(9),  uri_parts.length(9))  : zero_span_;\n    query_    = uri_parts.length(11) ? Span_t(uri_parts.position(11), uri_parts.length(11)) : zero_span_;\n    fragment_ = uri_parts.length(13) ? Span_t(uri_parts.position(13), uri_parts.length(13)) : zero_span_;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid URI::load_queries() {\n  static const std::regex queries_tokenizer {\"[^?=&]+\"};\n\n  auto& queries = query();\n\n  auto position = std::sregex_iterator(queries.begin(), queries.end(), queries_tokenizer);\n  auto end      = std::sregex_iterator();\n\n  while (position not_eq end) {\n    auto key = (*position).str();\n\n    if ((++position) not_eq end) {\n      queries_[key] = (*position++).str();\n      continue;\n    } else {\n      queries_[key];\n    }\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::ostream& uri::operator<< (std::ostream& out, const URI& uri) {\n  return out << uri.to_string();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/-----------------------------------------------------------------------bl-\n\/\/--------------------------------------------------------------------------\n\/\/ \n\/\/ GRINS - General Reacting Incompressible Navier-Stokes \n\/\/\n\/\/ Copyright (C) 2010-2013 The PECOS Development Team\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the Version 2.1 GNU Lesser General\n\/\/ Public License 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,\n\/\/ Boston, MA  02110-1301  USA\n\/\/\n\/\/-----------------------------------------------------------------------el-\n\n\n\/\/ This class\n#include \"grins\/inc_navier_stokes_bc_handling.h\"\n\n\/\/ GRINS\n#include \"grins\/parabolic_profile.h\"\n\n\/\/ libMesh\n#include \"libmesh\/zero_function.h\"\n#include \"libmesh\/dirichlet_boundaries.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/fem_system.h\"\n\nnamespace GRINS\n{\n\n  IncompressibleNavierStokesBCHandling::IncompressibleNavierStokesBCHandling(const std::string& physics_name,\n\t\t\t\t\t\t\t\t\t     const GetPot& input)\n    : BCHandlingBase(physics_name),\n      _flow_vars(input)\n  {\n    std::string id_str = \"Physics\/\"+_physics_name+\"\/bc_ids\";\n    std::string bc_str = \"Physics\/\"+_physics_name+\"\/bc_types\";\n    std::string var_str = \"Physics\/\"+_physics_name+\"\/bc_variables\";\n    std::string val_str = \"Physics\/\"+_physics_name+\"\/bc_values\";\n\n    this->read_bc_data( input, id_str, bc_str, var_str, val_str );\n\n    return;\n  }\n\n  IncompressibleNavierStokesBCHandling::~IncompressibleNavierStokesBCHandling()\n  {\n    return;\n  }\n\n  int IncompressibleNavierStokesBCHandling::string_to_int( const std::string& bc_type ) const\n  {\n    int bc_type_out;\n\n    if( bc_type == \"no_slip\" )\n      bc_type_out = NO_SLIP;\n\n    else if( bc_type == \"prescribed_vel\" )\n      bc_type_out = PRESCRIBED_VELOCITY;\n\n    else if( bc_type == \"parabolic_profile\" )\n      bc_type_out = PARABOLIC_PROFILE;\n\n    else if( bc_type == \"general_velocity\" )\n      bc_type_out = GENERAL_VELOCITY;\n\n    else\n      {\n\t\/\/ Call base class to detect any physics-common boundary conditions\n\tbc_type_out = BCHandlingBase::string_to_int( bc_type );\n      }\n\n    return bc_type_out;\n  }\n\n  void IncompressibleNavierStokesBCHandling::init_bc_data( const libMesh::FEMSystem& system )\n  {\n    _flow_vars.init(const_cast<libMesh::FEMSystem*>(&system));\n\n    return;\n  }\n\n  void IncompressibleNavierStokesBCHandling::init_bc_types( const BoundaryID bc_id, \n\t\t\t\t\t\t\t    const std::string& bc_id_string, \n\t\t\t\t\t\t\t    const int bc_type, \n\t\t\t\t\t                    const std::string& bc_vars, \n\t\t\t\t\t\t\t    const std::string& bc_value, \n\t\t\t\t\t\t\t    const GetPot& input )\n  {\n    switch(bc_type)\n      {\n      case(NO_SLIP):\n\t{\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t}\n\tbreak;\n      case(PRESCRIBED_VELOCITY):\n\t{\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t\n\t  \/* Force the user to specify 3 velocity components regardless of dimension.\n\t     This should make it easier to keep things correct if we want to have \n\t     2D flow not be in the x-y plane. *\/\n\t  int n_vel_comps = input.vector_variable_size(\"Physics\/\"+_physics_name+\"\/bound_vel_\"+bc_id_string);\n\t  if( n_vel_comps != 3 )\n\t    {\n\t      std::cerr << \"Error: Must specify 3 velocity components when inputting\"\n\t\t\t<< std::endl\n\t\t\t<< \"       prescribed velocities. Found \" << n_vel_comps\n\t\t\t<< \" velocity components.\"\n\t\t\t<< std::endl;\n\t      libmesh_error();\n\t    }\n\t\n\t  this->set_dirichlet_bc_value( bc_id, \n\t\t\t\t\tinput(\"Physics\/\"+_physics_name+\"\/bound_vel_\"+bc_id_string, 0.0, 0 ),\n\t\t\t\t\t0 );\n\n\t  this->set_dirichlet_bc_value( bc_id, \n\t\t\t\t\tinput(\"Physics\/\"+_physics_name+\"\/bound_vel_\"+bc_id_string, 0.0, 1 ),\n\t\t\t\t\t1 );\n\n\t  this->set_dirichlet_bc_value( bc_id, \n\t\t\t\t\tinput(\"Physics\/\"+_physics_name+\"\/bound_vel_\"+bc_id_string, 0.0, 2 ),\n\t\t\t\t\t2 );\n\t}\n\tbreak;\n      case(PARABOLIC_PROFILE):\n\t{\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t\n\t  \/\/ Make sure all 6 components are there\n\t  if( input.vector_variable_size(\"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string) != 6 )\n\t    {\n\t      std::cerr << \"Error: Must specify 6 components when inputting\"\n\t\t\t<< std::endl\n\t\t\t<< \"       coefficients for a parabolic profile. Found \" \n\t\t\t<< input.vector_variable_size(\"Physics\/\"+_physics_name+\"\/parabolic_profile_\"+bc_id_string)\n\t\t\t<< \" components.\"\n\t\t\t<< std::endl;\n\t      libmesh_error();\n\t    }\n\n\t  libMesh::Real a = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 0 );\n\t  libMesh::Real b = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 1 );\n\t  libMesh::Real c = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 2 );\n\t  libMesh::Real d = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 3 );\n\t  libMesh::Real e = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 4 );\n\t  libMesh::Real f = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 5 );\n\n\t  std::string var = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_var_\"+bc_id_string, \"DIE!\" );\n\t\n\t  if( var == \"DIE!\" )\n\t    {\n\t      std::cerr << \"Error: Mush specify a variable name to which apply parabolic profile through parabolic_profile_var input option.\" << std::endl;\n\t      libmesh_error();\n\t    }\n\n\t  DBCContainer cont;\n\t  cont.add_var_name( var );\n\t  cont.add_bc_id( bc_id );\n\n\t  std::tr1::shared_ptr<libMesh::FunctionBase<libMesh::Number> > func( new ParabolicProfile(a,b,c,d,e,f) );\n\t  cont.set_func( func );\n\t  this->attach_dirichlet_bound_func( cont );\n\t\n\t  \/\/ Set specified components of Dirichlet data to zero\n\t  std::string fix_var = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_fix_\"+bc_id_string, \"DIE!\" );\n\n\t  if( fix_var == \"DIE!\" )\n\t    {\n\t      std::cerr << \"Error: Mush specify a variable name to fix for parabolic profile through parabolic_profile_fix input option.\" << std::endl;\n\t      libmesh_error();\n\t    }\n\n\t  DBCContainer cont_fix;\n\t  cont_fix.add_var_name( fix_var );\n\t  cont_fix.add_bc_id( bc_id );\n\n          std::tr1::shared_ptr<libMesh::FunctionBase<libMesh::Number> >\n            func_fix( new libMesh::ZeroFunction<libMesh::Number>() );\n\t  cont_fix.set_func( func_fix );\n\t  this->attach_dirichlet_bound_func( cont_fix );\n\t}\n\tbreak;\n\n      case(GENERAL_VELOCITY):\n\t{\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t}\n\tbreak;\n\n      case(AXISYMMETRIC):\n        {\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t}\n\tbreak;\n\n      default:\n\t{\n\t  \/\/ Call base class to detect any physics-common boundary conditions\n\t  BCHandlingBase::init_bc_types( bc_id, bc_id_string, bc_type,\n                                         bc_vars, bc_value, input );\n\t}\n      } \/\/ End switch(bc_type)\n  \n    return;\n  }\n\n  void IncompressibleNavierStokesBCHandling::user_init_dirichlet_bcs( libMesh::FEMSystem* system,\n\t\t\t\t\t\t\t\t      libMesh::DofMap& dof_map,\n\t\t\t\t\t\t\t\t      BoundaryID bc_id,\n\t\t\t\t\t\t\t\t      BCType bc_type ) const\n  {\n    int dim = system->get_mesh().mesh_dimension();\n\n    VariableIndex u_var = _flow_vars.u_var();\n    VariableIndex v_var = _flow_vars.v_var();\n    VariableIndex w_var = -1;\n    if( dim == 3 )\n      w_var = _flow_vars.w_var();\n\n    switch( bc_type )\n      {\n      case(NO_SLIP):\n\t{\n\t  std::set<BoundaryID> dbc_ids;\n\t  dbc_ids.insert(bc_id);\n\t\n\t  std::vector<VariableIndex> dbc_vars;\n\t  dbc_vars.push_back(u_var);\n\t  dbc_vars.push_back(v_var);\n\t  if(dim == 3)\n\t    dbc_vars.push_back(w_var);\n\t\n          libMesh::ZeroFunction<libMesh::Number> zero;\n\t\n\t  libMesh::DirichletBoundary no_slip_dbc(dbc_ids, \n\t\t\t\t\t\t dbc_vars, \n\t\t\t\t\t\t &zero );\n\t\n\t  dof_map.add_dirichlet_boundary( no_slip_dbc );\n\t}\n\tbreak;\n      case(PRESCRIBED_VELOCITY):\n\t{\n\t  std::set<BoundaryID> dbc_ids;\n\t  dbc_ids.insert(bc_id);\n\t\n\t  std::vector<VariableIndex> dbc_vars;\n\t\n\t  \/\/ This is inefficient, but it shouldn't matter because\n\t  \/\/ everything gets cached on the libMesh side so it should\n\t  \/\/ only affect performance at startup.\n\t  {\n\t    dbc_vars.push_back(u_var);\n            libMesh::ConstFunction<libMesh::Number>\n              vel_func( this->get_dirichlet_bc_value(bc_id,0) );\n\t  \n\t    libMesh::DirichletBoundary vel_dbc(dbc_ids, \n\t\t\t\t\t       dbc_vars, \n\t\t\t\t\t       &vel_func );\n\t  \n\t    dof_map.add_dirichlet_boundary( vel_dbc );\n\t    dbc_vars.clear();\n\t  }\n\t\n\t  {\n\t    dbc_vars.push_back(v_var);\n            libMesh::ConstFunction<libMesh::Number>\n              vel_func( this->get_dirichlet_bc_value(bc_id,1) );\n\t  \n\t    libMesh::DirichletBoundary vel_dbc(dbc_ids, \n\t\t\t\t\t       dbc_vars, \n\t\t\t\t\t       &vel_func );\n\t  \n\t    dof_map.add_dirichlet_boundary( vel_dbc );\n\t    dbc_vars.clear();\n\t  }\n\t  if( dim == 3 )\n\t    {\n\t      dbc_vars.push_back(w_var);\n              libMesh::ConstFunction<libMesh::Number>\n                vel_func( this->get_dirichlet_bc_value(bc_id,2) );\n\t    \n\t      libMesh::DirichletBoundary vel_dbc(dbc_ids, \n\t\t\t\t\t\t dbc_vars, \n\t\t\t\t\t\t &vel_func );\n\t    \n\t      dof_map.add_dirichlet_boundary( vel_dbc );\n\t    }  \n\t}\n\tbreak;\n      case(PARABOLIC_PROFILE):\n\t\/\/ This case is handled init_dirichlet_bc_func_objs\n\tbreak;\n\n      case(GENERAL_VELOCITY):\n\t\/\/ This case is handled in the init_dirichlet_bc_func_objs\n\tbreak;\n\n      case(AXISYMMETRIC):\n\t{\n\t  std::set<BoundaryID> dbc_ids;\n\t  dbc_ids.insert(bc_id);\n\t\n\t  std::vector<VariableIndex> dbc_vars;\n\t  dbc_vars.push_back(u_var);\n\t\n          libMesh::ZeroFunction<libMesh::Number> zero;\n\t\n\t  libMesh::DirichletBoundary no_slip_dbc( dbc_ids, \n\t\t\t\t\t\t  dbc_vars, \n\t\t\t\t\t\t  &zero );\n\t\n\t  dof_map.add_dirichlet_boundary( no_slip_dbc );\n\t}\n      break;\n\n      default:\n\t{\n\t  std::cerr << \"Invalid BCType \" << bc_type << std::endl;\n\t  libmesh_error();\n\t}\n      \n      }\/\/ end switch\n\n    return;\n  }\n\n} \/\/ namespace GRINS\n<commit_msg>We can't add z-component of BC if LIBMESH_DIM < 3<commit_after>\/\/-----------------------------------------------------------------------bl-\n\/\/--------------------------------------------------------------------------\n\/\/ \n\/\/ GRINS - General Reacting Incompressible Navier-Stokes \n\/\/\n\/\/ Copyright (C) 2010-2013 The PECOS Development Team\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the Version 2.1 GNU Lesser General\n\/\/ Public License 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,\n\/\/ Boston, MA  02110-1301  USA\n\/\/\n\/\/-----------------------------------------------------------------------el-\n\n\n\/\/ This class\n#include \"grins\/inc_navier_stokes_bc_handling.h\"\n\n\/\/ GRINS\n#include \"grins\/parabolic_profile.h\"\n\n\/\/ libMesh\n#include \"libmesh\/zero_function.h\"\n#include \"libmesh\/dirichlet_boundaries.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/fem_system.h\"\n\nnamespace GRINS\n{\n\n  IncompressibleNavierStokesBCHandling::IncompressibleNavierStokesBCHandling(const std::string& physics_name,\n\t\t\t\t\t\t\t\t\t     const GetPot& input)\n    : BCHandlingBase(physics_name),\n      _flow_vars(input)\n  {\n    std::string id_str = \"Physics\/\"+_physics_name+\"\/bc_ids\";\n    std::string bc_str = \"Physics\/\"+_physics_name+\"\/bc_types\";\n    std::string var_str = \"Physics\/\"+_physics_name+\"\/bc_variables\";\n    std::string val_str = \"Physics\/\"+_physics_name+\"\/bc_values\";\n\n    this->read_bc_data( input, id_str, bc_str, var_str, val_str );\n\n    return;\n  }\n\n  IncompressibleNavierStokesBCHandling::~IncompressibleNavierStokesBCHandling()\n  {\n    return;\n  }\n\n  int IncompressibleNavierStokesBCHandling::string_to_int( const std::string& bc_type ) const\n  {\n    int bc_type_out;\n\n    if( bc_type == \"no_slip\" )\n      bc_type_out = NO_SLIP;\n\n    else if( bc_type == \"prescribed_vel\" )\n      bc_type_out = PRESCRIBED_VELOCITY;\n\n    else if( bc_type == \"parabolic_profile\" )\n      bc_type_out = PARABOLIC_PROFILE;\n\n    else if( bc_type == \"general_velocity\" )\n      bc_type_out = GENERAL_VELOCITY;\n\n    else\n      {\n\t\/\/ Call base class to detect any physics-common boundary conditions\n\tbc_type_out = BCHandlingBase::string_to_int( bc_type );\n      }\n\n    return bc_type_out;\n  }\n\n  void IncompressibleNavierStokesBCHandling::init_bc_data( const libMesh::FEMSystem& system )\n  {\n    _flow_vars.init(const_cast<libMesh::FEMSystem*>(&system));\n\n    return;\n  }\n\n  void IncompressibleNavierStokesBCHandling::init_bc_types( const BoundaryID bc_id, \n\t\t\t\t\t\t\t    const std::string& bc_id_string, \n\t\t\t\t\t\t\t    const int bc_type, \n\t\t\t\t\t                    const std::string& bc_vars, \n\t\t\t\t\t\t\t    const std::string& bc_value, \n\t\t\t\t\t\t\t    const GetPot& input )\n  {\n    switch(bc_type)\n      {\n      case(NO_SLIP):\n\t{\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t}\n\tbreak;\n      case(PRESCRIBED_VELOCITY):\n\t{\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t\n\t  \/* Force the user to specify 3 velocity components regardless of dimension.\n\t     This should make it easier to keep things correct if we want to have \n\t     2D flow not be in the x-y plane. *\/\n\t  int n_vel_comps = input.vector_variable_size(\"Physics\/\"+_physics_name+\"\/bound_vel_\"+bc_id_string);\n\t  if( n_vel_comps != 3 )\n\t    {\n\t      std::cerr << \"Error: Must specify 3 velocity components when inputting\"\n\t\t\t<< std::endl\n\t\t\t<< \"       prescribed velocities. Found \" << n_vel_comps\n\t\t\t<< \" velocity components.\"\n\t\t\t<< std::endl;\n\t      libmesh_error();\n\t    }\n\t\n\t  this->set_dirichlet_bc_value( bc_id, \n\t\t\t\t\tinput(\"Physics\/\"+_physics_name+\"\/bound_vel_\"+bc_id_string, 0.0, 0 ),\n\t\t\t\t\t0 );\n\n\t  this->set_dirichlet_bc_value( bc_id, \n\t\t\t\t\tinput(\"Physics\/\"+_physics_name+\"\/bound_vel_\"+bc_id_string, 0.0, 1 ),\n\t\t\t\t\t1 );\n\n#if LIBMESH_DIM > 2\n\t  this->set_dirichlet_bc_value( bc_id, \n\t\t\t\t\tinput(\"Physics\/\"+_physics_name+\"\/bound_vel_\"+bc_id_string, 0.0, 2 ),\n\t\t\t\t\t2 );\n#endif\n\t}\n\tbreak;\n      case(PARABOLIC_PROFILE):\n\t{\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t\n\t  \/\/ Make sure all 6 components are there\n\t  if( input.vector_variable_size(\"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string) != 6 )\n\t    {\n\t      std::cerr << \"Error: Must specify 6 components when inputting\"\n\t\t\t<< std::endl\n\t\t\t<< \"       coefficients for a parabolic profile. Found \" \n\t\t\t<< input.vector_variable_size(\"Physics\/\"+_physics_name+\"\/parabolic_profile_\"+bc_id_string)\n\t\t\t<< \" components.\"\n\t\t\t<< std::endl;\n\t      libmesh_error();\n\t    }\n\n\t  libMesh::Real a = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 0 );\n\t  libMesh::Real b = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 1 );\n\t  libMesh::Real c = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 2 );\n\t  libMesh::Real d = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 3 );\n\t  libMesh::Real e = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 4 );\n\t  libMesh::Real f = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_coeffs_\"+bc_id_string, 0.0, 5 );\n\n\t  std::string var = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_var_\"+bc_id_string, \"DIE!\" );\n\t\n\t  if( var == \"DIE!\" )\n\t    {\n\t      std::cerr << \"Error: Mush specify a variable name to which apply parabolic profile through parabolic_profile_var input option.\" << std::endl;\n\t      libmesh_error();\n\t    }\n\n\t  DBCContainer cont;\n\t  cont.add_var_name( var );\n\t  cont.add_bc_id( bc_id );\n\n\t  std::tr1::shared_ptr<libMesh::FunctionBase<libMesh::Number> > func( new ParabolicProfile(a,b,c,d,e,f) );\n\t  cont.set_func( func );\n\t  this->attach_dirichlet_bound_func( cont );\n\t\n\t  \/\/ Set specified components of Dirichlet data to zero\n\t  std::string fix_var = input( \"Physics\/\"+_physics_name+\"\/parabolic_profile_fix_\"+bc_id_string, \"DIE!\" );\n\n\t  if( fix_var == \"DIE!\" )\n\t    {\n\t      std::cerr << \"Error: Mush specify a variable name to fix for parabolic profile through parabolic_profile_fix input option.\" << std::endl;\n\t      libmesh_error();\n\t    }\n\n\t  DBCContainer cont_fix;\n\t  cont_fix.add_var_name( fix_var );\n\t  cont_fix.add_bc_id( bc_id );\n\n          std::tr1::shared_ptr<libMesh::FunctionBase<libMesh::Number> >\n            func_fix( new libMesh::ZeroFunction<libMesh::Number>() );\n\t  cont_fix.set_func( func_fix );\n\t  this->attach_dirichlet_bound_func( cont_fix );\n\t}\n\tbreak;\n\n      case(GENERAL_VELOCITY):\n\t{\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t}\n\tbreak;\n\n      case(AXISYMMETRIC):\n        {\n\t  this->set_dirichlet_bc_type( bc_id, bc_type );\n\t}\n\tbreak;\n\n      default:\n\t{\n\t  \/\/ Call base class to detect any physics-common boundary conditions\n\t  BCHandlingBase::init_bc_types( bc_id, bc_id_string, bc_type,\n                                         bc_vars, bc_value, input );\n\t}\n      } \/\/ End switch(bc_type)\n  \n    return;\n  }\n\n  void IncompressibleNavierStokesBCHandling::user_init_dirichlet_bcs( libMesh::FEMSystem* system,\n\t\t\t\t\t\t\t\t      libMesh::DofMap& dof_map,\n\t\t\t\t\t\t\t\t      BoundaryID bc_id,\n\t\t\t\t\t\t\t\t      BCType bc_type ) const\n  {\n    int dim = system->get_mesh().mesh_dimension();\n\n    VariableIndex u_var = _flow_vars.u_var();\n    VariableIndex v_var = _flow_vars.v_var();\n    VariableIndex w_var = -1;\n    if( dim == 3 )\n      w_var = _flow_vars.w_var();\n\n    switch( bc_type )\n      {\n      case(NO_SLIP):\n\t{\n\t  std::set<BoundaryID> dbc_ids;\n\t  dbc_ids.insert(bc_id);\n\t\n\t  std::vector<VariableIndex> dbc_vars;\n\t  dbc_vars.push_back(u_var);\n\t  dbc_vars.push_back(v_var);\n\t  if(dim == 3)\n\t    dbc_vars.push_back(w_var);\n\t\n          libMesh::ZeroFunction<libMesh::Number> zero;\n\t\n\t  libMesh::DirichletBoundary no_slip_dbc(dbc_ids, \n\t\t\t\t\t\t dbc_vars, \n\t\t\t\t\t\t &zero );\n\t\n\t  dof_map.add_dirichlet_boundary( no_slip_dbc );\n\t}\n\tbreak;\n      case(PRESCRIBED_VELOCITY):\n\t{\n\t  std::set<BoundaryID> dbc_ids;\n\t  dbc_ids.insert(bc_id);\n\t\n\t  std::vector<VariableIndex> dbc_vars;\n\t\n\t  \/\/ This is inefficient, but it shouldn't matter because\n\t  \/\/ everything gets cached on the libMesh side so it should\n\t  \/\/ only affect performance at startup.\n\t  {\n\t    dbc_vars.push_back(u_var);\n            libMesh::ConstFunction<libMesh::Number>\n              vel_func( this->get_dirichlet_bc_value(bc_id,0) );\n\t  \n\t    libMesh::DirichletBoundary vel_dbc(dbc_ids, \n\t\t\t\t\t       dbc_vars, \n\t\t\t\t\t       &vel_func );\n\t  \n\t    dof_map.add_dirichlet_boundary( vel_dbc );\n\t    dbc_vars.clear();\n\t  }\n\t\n\t  {\n\t    dbc_vars.push_back(v_var);\n            libMesh::ConstFunction<libMesh::Number>\n              vel_func( this->get_dirichlet_bc_value(bc_id,1) );\n\t  \n\t    libMesh::DirichletBoundary vel_dbc(dbc_ids, \n\t\t\t\t\t       dbc_vars, \n\t\t\t\t\t       &vel_func );\n\t  \n\t    dof_map.add_dirichlet_boundary( vel_dbc );\n\t    dbc_vars.clear();\n\t  }\n\t  if( dim == 3 )\n\t    {\n\t      dbc_vars.push_back(w_var);\n              libMesh::ConstFunction<libMesh::Number>\n                vel_func( this->get_dirichlet_bc_value(bc_id,2) );\n\t    \n\t      libMesh::DirichletBoundary vel_dbc(dbc_ids, \n\t\t\t\t\t\t dbc_vars, \n\t\t\t\t\t\t &vel_func );\n\t    \n\t      dof_map.add_dirichlet_boundary( vel_dbc );\n\t    }  \n\t}\n\tbreak;\n      case(PARABOLIC_PROFILE):\n\t\/\/ This case is handled init_dirichlet_bc_func_objs\n\tbreak;\n\n      case(GENERAL_VELOCITY):\n\t\/\/ This case is handled in the init_dirichlet_bc_func_objs\n\tbreak;\n\n      case(AXISYMMETRIC):\n\t{\n\t  std::set<BoundaryID> dbc_ids;\n\t  dbc_ids.insert(bc_id);\n\t\n\t  std::vector<VariableIndex> dbc_vars;\n\t  dbc_vars.push_back(u_var);\n\t\n          libMesh::ZeroFunction<libMesh::Number> zero;\n\t\n\t  libMesh::DirichletBoundary no_slip_dbc( dbc_ids, \n\t\t\t\t\t\t  dbc_vars, \n\t\t\t\t\t\t  &zero );\n\t\n\t  dof_map.add_dirichlet_boundary( no_slip_dbc );\n\t}\n      break;\n\n      default:\n\t{\n\t  std::cerr << \"Invalid BCType \" << bc_type << std::endl;\n\t  libmesh_error();\n\t}\n      \n      }\/\/ end switch\n\n    return;\n  }\n\n} \/\/ namespace GRINS\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <sstream>\n#include <string>\n\n#include \"blackhole\/attribute.hpp\"\n#include \"blackhole\/error.hpp\"\n#include \"blackhole\/formatter\/map\/value.hpp\"\n\nnamespace blackhole {\n\nnamespace formatter {\n\nnamespace string {\n\nstatic const char VARIADIC_KEY_PREFIX[] = \"...\";\nstatic const std::size_t VARIADIC_KEY_PRFFIX_LENGTH = std::strlen(VARIADIC_KEY_PREFIX);\n\nnamespace builder {\n\nstruct variadic_t {\n    typedef log::attribute::scope_underlying_type scope_underlying_type;\n\n    const std::string placeholder;\n\n    void operator ()(std::ostringstream& stream, const mapping::value_t&, const log::attributes_t& attributes) const {\n        for (auto pit = placeholder.begin() + string::VARIADIC_KEY_PRFFIX_LENGTH; pit != placeholder.end(); ++pit) {\n            const scope_underlying_type scope = *pit - '0';\n\n            for (auto it = attributes.begin(); it != attributes.end(); it++) {\n                const std::string& name = it->first;\n                const log::attribute_t& attribute = it->second;\n                if (static_cast<scope_underlying_type>(attribute.scope) & scope) {\n                    \/\/!@todo: Implement visitor to properly format int attributes (without quotes).\n                    if (it != attributes.begin()) {\n                        stream << \", \";\n                    }\n                    stream << \"'\" << name << \"': '\" << attribute.value << \"'\";\n                }\n            }\n        }\n    }\n};\n\n} \/\/ namespace builder\n\n} \/\/ namespace string\n\n} \/\/ namespace formatter\n\n} \/\/ namespace blackhole\n<commit_msg>Returning proper variadic joiner algorithm.<commit_after>#pragma once\n\n#include <sstream>\n#include <string>\n\n#include <boost\/algorithm\/string.hpp>\n\n#include \"blackhole\/attribute.hpp\"\n#include \"blackhole\/error.hpp\"\n#include \"blackhole\/formatter\/map\/value.hpp\"\n\nnamespace blackhole {\n\nnamespace formatter {\n\nnamespace string {\n\nstatic const char VARIADIC_KEY_PREFIX[] = \"...\";\nstatic const std::size_t VARIADIC_KEY_PRFFIX_LENGTH = std::strlen(VARIADIC_KEY_PREFIX);\n\nnamespace builder {\n\nstruct variadic_t {\n    typedef log::attribute::scope_underlying_type scope_underlying_type;\n\n    const std::string placeholder;\n\n    void operator ()(std::ostringstream& stream, const mapping::value_t&, const log::attributes_t& attributes) const {\n        std::vector<std::string> passed;\n        passed.reserve(attributes.size());\n\n        for (auto pit = placeholder.begin() + string::VARIADIC_KEY_PRFFIX_LENGTH; pit != placeholder.end(); ++pit) {\n            const scope_underlying_type scope = *pit - '0';\n\n            for (auto it = attributes.begin(); it != attributes.end(); it++) {\n                const std::string& name = it->first;\n                const log::attribute_t& attribute = it->second;\n                if (static_cast<scope_underlying_type>(attribute.scope) & scope) {\n                    \/\/!@todo: Implement visitor to properly format int attributes (without quotes).\n                    std::ostringstream stream;\n                    stream << \"'\" << name << \"': '\" << attribute.value << \"'\";\n                    passed.push_back(stream.str());\n                }\n            }\n        }\n        stream << boost::algorithm::join(passed, \", \");\n    }\n};\n\n} \/\/ namespace builder\n\n} \/\/ namespace string\n\n} \/\/ namespace formatter\n\n} \/\/ namespace blackhole\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2013 Andreas Pohl <apohl79 at gmail.com>\n *\n * This file is part of libtasks.\n * \n * libtasks 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 * libtasks is distributed in the hope that it 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 libtasks.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <tasks\/logging.h>\n#include <sys\/socket.h>\n#include <cstdlib>\n\n#include <tasks\/net\/uwsgi_request.h>\n#include <tasks\/net\/socket.h>\n\nnamespace tasks {\nnamespace net {\n\nstd::string uwsgi_request::NO_VAL;\n\nbool uwsgi_request::read_header(int fd) {\n    socket sock(fd);\n    bool success = false;\n    try {\n        std::size_t bytes = sock.read((char*) &m_header, sizeof(m_header));\n        if (bytes == sizeof(m_header)) {\n            success = true;\n            tdbg(\"uwsgi_request::read_header: read header successfully, \" << bytes << \" bytes\" << std::endl);\n        } else {\n            terr(\"uwsgi_request::read_header: error reading header\" << std::endl);\n        }\n    } catch (socket_exception e) {\n        terr(\"uwsgi_request::read_header: \" << e.what() << std::endl);\n    }\n    return success;\n}\n\nbool uwsgi_request::read_vars(int fd) {\n    socket sock(fd);\n    bool success = true;\n    try {\n        std::size_t bytes = sock.read(m_data_buffer.ptr_write(), m_data_buffer.to_write());\n        if (bytes > 0) {\n            m_data_buffer.move_ptr_write(bytes);\n            tdbg(\"uwsgi_request::read_vars: read data successfully, \" << bytes << \" bytes\" << std::endl);\n        }\n        if (!m_data_buffer.to_write()) {\n            if (UWSGI_VARS == m_header.modifier1) {\n                success = parse_vars();\n                if (success) {\n                    \/\/ Check if a http body needs to be read\n                    std::string content_len_s = var(\"CONTENT_LENGTH\");\n                    if (NO_VAL != content_len_s) {\n                        std::size_t content_len_i = std::atoi(content_len_s.c_str());\n                        m_content_buffer.set_size(content_len_i);\n                        m_state = READ_CONTENT;\n                    } else {\n                        m_state = DONE;\n                    }\n                }\n            }\n        }\n    } catch (socket_exception e) {\n        terr(\"uwsgi_request::read_vars: \" << e.what() << std::endl);\n        success = false;\n    }\n    return success;\n}\n\nbool uwsgi_request::read_content(int fd) {\n    socket sock(fd);\n    bool success = true;\n    try {\n        std::size_t bytes = sock.read(m_content_buffer.ptr_write(), m_content_buffer.to_write());\n        if (bytes > 0) {\n            m_content_buffer.move_ptr_write(bytes);\n            tdbg(\"uwsgi_request::read_content: read data successfully, \" << bytes << \" bytes\" << std::endl);\n        }\n    } catch (socket_exception e) {\n        terr(\"uwsgi_request::read_content: \" << e.what() << std::endl);\n        success = false;\n    }\n    if (success && !m_content_buffer.to_write()) {\n        m_state = DONE;\n        \/\/ Move the pointer the start to enable reading from the buffer. \n        \/\/m_content_buffer.move_ptr_abs(0);\n    }\n    return success;\n}\n\nbool uwsgi_request::read_data(int fd) {\n    bool success = true;\n    if (READY == m_state) {\n        m_state = READ_HEADER;\n        if (success = read_header(fd)) {\n            m_state = READ_DATA;\n            m_data_buffer.set_size(m_header.datasize);\n        }\n    }\n    if (success && READ_DATA == m_state) {\n        success = read_vars(fd);\n    }\n    if (success && READ_CONTENT == m_state) {\n        success = read_content(fd);\n    }\n    return success;\n}\n\nbool uwsgi_request::parse_vars() {\n    std::size_t pos = 0;\n    while (pos < m_data_buffer.size()) {\n        uint16_t key_len= *((uint16_t*) m_data_buffer.ptr(pos));\n        uint16_t key_start = pos + 2;\n        uint16_t val_len = *((uint16_t*) m_data_buffer.ptr(key_start + key_len));\n        uint16_t val_start = key_start + key_len + 2;\n        if (key_len && val_len) {\n            m_vars.insert(std::make_pair(std::string(m_data_buffer.ptr(key_start), key_len),\n                                         std::string(m_data_buffer.ptr(val_start), val_len)));\n        }\n        pos = val_start + val_len;\n    }\n    return true;\n}\n\n} \/\/ net\n} \/\/ tasks\n<commit_msg>uwsgi_request.cpp: Fixed clang warning<commit_after>\/*\n * Copyright (c) 2013 Andreas Pohl <apohl79 at gmail.com>\n *\n * This file is part of libtasks.\n * \n * libtasks 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 * libtasks is distributed in the hope that it 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 libtasks.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <tasks\/logging.h>\n#include <sys\/socket.h>\n#include <cstdlib>\n\n#include <tasks\/net\/uwsgi_request.h>\n#include <tasks\/net\/socket.h>\n\nnamespace tasks {\nnamespace net {\n\nstd::string uwsgi_request::NO_VAL;\n\nbool uwsgi_request::read_header(int fd) {\n    socket sock(fd);\n    bool success = false;\n    try {\n        std::size_t bytes = sock.read((char*) &m_header, sizeof(m_header));\n        if (bytes == sizeof(m_header)) {\n            success = true;\n            tdbg(\"uwsgi_request::read_header: read header successfully, \" << bytes << \" bytes\" << std::endl);\n        } else {\n            terr(\"uwsgi_request::read_header: error reading header\" << std::endl);\n        }\n    } catch (socket_exception e) {\n        terr(\"uwsgi_request::read_header: \" << e.what() << std::endl);\n    }\n    return success;\n}\n\nbool uwsgi_request::read_vars(int fd) {\n    socket sock(fd);\n    bool success = true;\n    try {\n        std::size_t bytes = sock.read(m_data_buffer.ptr_write(), m_data_buffer.to_write());\n        if (bytes > 0) {\n            m_data_buffer.move_ptr_write(bytes);\n            tdbg(\"uwsgi_request::read_vars: read data successfully, \" << bytes << \" bytes\" << std::endl);\n        }\n        if (!m_data_buffer.to_write()) {\n            if (UWSGI_VARS == m_header.modifier1) {\n                success = parse_vars();\n                if (success) {\n                    \/\/ Check if a http body needs to be read\n                    std::string content_len_s = var(\"CONTENT_LENGTH\");\n                    if (NO_VAL != content_len_s) {\n                        std::size_t content_len_i = std::atoi(content_len_s.c_str());\n                        m_content_buffer.set_size(content_len_i);\n                        m_state = READ_CONTENT;\n                    } else {\n                        m_state = DONE;\n                    }\n                }\n            }\n        }\n    } catch (socket_exception e) {\n        terr(\"uwsgi_request::read_vars: \" << e.what() << std::endl);\n        success = false;\n    }\n    return success;\n}\n\nbool uwsgi_request::read_content(int fd) {\n    socket sock(fd);\n    bool success = true;\n    try {\n        std::size_t bytes = sock.read(m_content_buffer.ptr_write(), m_content_buffer.to_write());\n        if (bytes > 0) {\n            m_content_buffer.move_ptr_write(bytes);\n            tdbg(\"uwsgi_request::read_content: read data successfully, \" << bytes << \" bytes\" << std::endl);\n        }\n    } catch (socket_exception e) {\n        terr(\"uwsgi_request::read_content: \" << e.what() << std::endl);\n        success = false;\n    }\n    if (success && !m_content_buffer.to_write()) {\n        m_state = DONE;\n        \/\/ Move the pointer the start to enable reading from the buffer. \n        \/\/m_content_buffer.move_ptr_abs(0);\n    }\n    return success;\n}\n\nbool uwsgi_request::read_data(int fd) {\n    bool success = true;\n    if (READY == m_state) {\n        m_state = READ_HEADER;\n        if ((success = read_header(fd))) {\n            m_state = READ_DATA;\n            m_data_buffer.set_size(m_header.datasize);\n        }\n    }\n    if (success && READ_DATA == m_state) {\n        success = read_vars(fd);\n    }\n    if (success && READ_CONTENT == m_state) {\n        success = read_content(fd);\n    }\n    return success;\n}\n\nbool uwsgi_request::parse_vars() {\n    std::size_t pos = 0;\n    while (pos < m_data_buffer.size()) {\n        uint16_t key_len= *((uint16_t*) m_data_buffer.ptr(pos));\n        uint16_t key_start = pos + 2;\n        uint16_t val_len = *((uint16_t*) m_data_buffer.ptr(key_start + key_len));\n        uint16_t val_start = key_start + key_len + 2;\n        if (key_len && val_len) {\n            m_vars.insert(std::make_pair(std::string(m_data_buffer.ptr(key_start), key_len),\n                                         std::string(m_data_buffer.ptr(val_start), val_len)));\n        }\n        pos = val_start + val_len;\n    }\n    return true;\n}\n\n} \/\/ net\n} \/\/ tasks\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 \"util.h\"\n\n#include <stdarg.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#include <vector>\n\n#ifdef _WIN32\n#include <direct.h>  \/\/ _mkdir\n#endif\n\nvoid Fatal(const char* msg, ...) {\n  va_list ap;\n  fprintf(stderr, \"ninja: FATAL: \");\n  va_start(ap, msg);\n  vfprintf(stderr, msg, ap);\n  va_end(ap);\n  fprintf(stderr, \"\\n\");\n  exit(1);\n}\n\nvoid Warning(const char* msg, ...) {\n  va_list ap;\n  fprintf(stderr, \"ninja: WARNING: \");\n  va_start(ap, msg);\n  vfprintf(stderr, msg, ap);\n  va_end(ap);\n  fprintf(stderr, \"\\n\");\n}\n\nvoid Error(const char* msg, ...) {\n  va_list ap;\n  fprintf(stderr, \"ninja: error: \");\n  va_start(ap, msg);\n  vfprintf(stderr, msg, ap);\n  va_end(ap);\n  fprintf(stderr, \"\\n\");\n}\n\nbool CanonicalizePath(string* path, string* err) {\n  \/\/ WARNING: this function is performance-critical; please benchmark\n  \/\/ any changes you make to it.\n\n  \/\/ We don't want to allocate memory if necessary; a previous version\n  \/\/ of this function modified |path| as it went, which meant we\n  \/\/ needed to keep a copy of it around for including in a potential\n  \/\/ error message.\n  \/\/\n  \/\/ Instead, we find all path components within the path, then fix\n  \/\/ them up to eliminate \"foo\/..\" pairs and \".\" components.  Finally,\n  \/\/ we overwrite path with these new substrings (since the path only\n  \/\/ ever gets shorter, we can just use memmove within it).\n\n  const int kMaxPathComponents = 20;\n  const char* starts[kMaxPathComponents];  \/\/ Starts of path components.\n  int lens[kMaxPathComponents];  \/\/ Lengths of path components.\n\n  int parts_count = 0;  \/\/ Number of entries in starts\/lens.\n  int slash_count = 0;  \/\/ Number of components in the original path.\n  for (string::size_type start = 0; start < path->size(); ++start) {\n    string::size_type end = path->find('\/', start);\n    if (end == string::npos)\n      end = path->size();\n    if (end > start) {\n      if (parts_count == kMaxPathComponents) {\n        *err = \"can't canonicalize path '\" + *path + \"'; too many \"\n            \"path components\";\n        return false;\n      }\n      starts[parts_count] = path->data() + start;\n      lens[parts_count] = end - start;\n      ++parts_count;\n    }\n    ++slash_count;\n    start = end;\n  }\n\n  int i = 0;\n  while (i < parts_count) {\n    const char* start = starts[i];\n    int len = lens[i];\n    if (start[0] == '.') {\n      int strip_components = 0;\n      if (len == 1) {\n        \/\/ \".\"; strip this component.\n        strip_components = 1;\n      } else if (len == 2 && start[1] == '.') {\n        \/\/ \"..\"; strip this and the previous component.\n        if (i == 0) {\n          *err = \"can't canonicalize path '\" + *path + \"' that reaches \"\n            \"above its directory\";\n          return false;\n        }\n        strip_components = 2;\n        --i;\n      }\n\n      if (strip_components) {\n        \/\/ Shift arrays backwards to remove bad path components.\n        int entries_to_move = parts_count - i - strip_components;\n        memmove(starts + i, starts + i + strip_components,\n                sizeof(starts[0]) * entries_to_move);\n        memmove(lens + i, lens + i + strip_components,\n                sizeof(lens[0]) * entries_to_move);\n        parts_count -= strip_components;\n        continue;\n      }\n    }\n    ++i;\n  }\n\n  if (parts_count == slash_count)\n    return true;  \/\/ Nothing to do.\n\n  char* p = (char*)path->data();\n  for (i = 0; i < parts_count; ++i) {\n    if (p > path->data())\n      *p++ = '\/';\n    int len = lens[i];\n    memmove(p, starts[i], len);\n    p += len;\n  }\n  path->resize(p - path->data());\n\n  return true;\n}\n\nint MakeDir(const string& path) {\n#ifdef _WIN32\n  return _mkdir(path.c_str());\n#else\n  return mkdir(path.c_str(), 0777);\n#endif\n}\n<commit_msg>Needed more path components to build Chrome. One path component in an uncommon sub-library ended up with 27 slashes in it.<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 \"util.h\"\n\n#include <stdarg.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#include <vector>\n\n#ifdef _WIN32\n#include <direct.h>  \/\/ _mkdir\n#endif\n\nvoid Fatal(const char* msg, ...) {\n  va_list ap;\n  fprintf(stderr, \"ninja: FATAL: \");\n  va_start(ap, msg);\n  vfprintf(stderr, msg, ap);\n  va_end(ap);\n  fprintf(stderr, \"\\n\");\n  exit(1);\n}\n\nvoid Warning(const char* msg, ...) {\n  va_list ap;\n  fprintf(stderr, \"ninja: WARNING: \");\n  va_start(ap, msg);\n  vfprintf(stderr, msg, ap);\n  va_end(ap);\n  fprintf(stderr, \"\\n\");\n}\n\nvoid Error(const char* msg, ...) {\n  va_list ap;\n  fprintf(stderr, \"ninja: error: \");\n  va_start(ap, msg);\n  vfprintf(stderr, msg, ap);\n  va_end(ap);\n  fprintf(stderr, \"\\n\");\n}\n\nbool CanonicalizePath(string* path, string* err) {\n  \/\/ WARNING: this function is performance-critical; please benchmark\n  \/\/ any changes you make to it.\n\n  \/\/ We don't want to allocate memory if necessary; a previous version\n  \/\/ of this function modified |path| as it went, which meant we\n  \/\/ needed to keep a copy of it around for including in a potential\n  \/\/ error message.\n  \/\/\n  \/\/ Instead, we find all path components within the path, then fix\n  \/\/ them up to eliminate \"foo\/..\" pairs and \".\" components.  Finally,\n  \/\/ we overwrite path with these new substrings (since the path only\n  \/\/ ever gets shorter, we can just use memmove within it).\n\n  const int kMaxPathComponents = 30;\n  const char* starts[kMaxPathComponents];  \/\/ Starts of path components.\n  int lens[kMaxPathComponents];  \/\/ Lengths of path components.\n\n  int parts_count = 0;  \/\/ Number of entries in starts\/lens.\n  int slash_count = 0;  \/\/ Number of components in the original path.\n  for (string::size_type start = 0; start < path->size(); ++start) {\n    string::size_type end = path->find('\/', start);\n    if (end == string::npos)\n      end = path->size();\n    if (end > start) {\n      if (parts_count == kMaxPathComponents) {\n        *err = \"can't canonicalize path '\" + *path + \"'; too many \"\n            \"path components\";\n        return false;\n      }\n      starts[parts_count] = path->data() + start;\n      lens[parts_count] = end - start;\n      ++parts_count;\n    }\n    ++slash_count;\n    start = end;\n  }\n\n  int i = 0;\n  while (i < parts_count) {\n    const char* start = starts[i];\n    int len = lens[i];\n    if (start[0] == '.') {\n      int strip_components = 0;\n      if (len == 1) {\n        \/\/ \".\"; strip this component.\n        strip_components = 1;\n      } else if (len == 2 && start[1] == '.') {\n        \/\/ \"..\"; strip this and the previous component.\n        if (i == 0) {\n          *err = \"can't canonicalize path '\" + *path + \"' that reaches \"\n            \"above its directory\";\n          return false;\n        }\n        strip_components = 2;\n        --i;\n      }\n\n      if (strip_components) {\n        \/\/ Shift arrays backwards to remove bad path components.\n        int entries_to_move = parts_count - i - strip_components;\n        memmove(starts + i, starts + i + strip_components,\n                sizeof(starts[0]) * entries_to_move);\n        memmove(lens + i, lens + i + strip_components,\n                sizeof(lens[0]) * entries_to_move);\n        parts_count -= strip_components;\n        continue;\n      }\n    }\n    ++i;\n  }\n\n  if (parts_count == slash_count)\n    return true;  \/\/ Nothing to do.\n\n  char* p = (char*)path->data();\n  for (i = 0; i < parts_count; ++i) {\n    if (p > path->data())\n      *p++ = '\/';\n    int len = lens[i];\n    memmove(p, starts[i], len);\n    p += len;\n  }\n  path->resize(p - path->data());\n\n  return true;\n}\n\nint MakeDir(const string& path) {\n#ifdef _WIN32\n  return _mkdir(path.c_str());\n#else\n  return mkdir(path.c_str(), 0777);\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  yosys -- Yosys Open SYnthesis Suite\n *\n *  Copyright (C) 2012 Clifford Wolf <clifford@clifford.at>\n *  Copyright (C) 2018 Clifford Wolf <dave@ds0.me>\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 \"kernel\/rtlil.h\"\n#include \"kernel\/log.h\"\n\nUSING_YOSYS_NAMESPACE\nPRIVATE_NAMESPACE_BEGIN\n\nstruct SynthEcp5Pass : public ScriptPass\n{\n\tSynthEcp5Pass() : ScriptPass(\"synth_ecp5\", \"synthesis for ECP5 FPGAs\") { }\n\n\tvoid help() YS_OVERRIDE\n\t{\n\t\t\/\/   |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|\n\t\tlog(\"\\n\");\n\t\tlog(\"    synth_ecp5 [options]\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"This command runs synthesis for ECP5 FPGAs.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -top <module>\\n\");\n\t\tlog(\"        use the specified module as top module\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -blif <file>\\n\");\n\t\tlog(\"        write the design to the specified BLIF file. writing of an output file\\n\");\n\t\tlog(\"        is omitted if this parameter is not specified.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -edif <file>\\n\");\n\t\tlog(\"        write the design to the specified EDIF file. writing of an output file\\n\");\n\t\tlog(\"        is omitted if this parameter is not specified.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -json <file>\\n\");\n\t\tlog(\"        write the design to the specified JSON file. writing of an output file\\n\");\n\t\tlog(\"        is omitted if this parameter is not specified.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -run <from_label>:<to_label>\\n\");\n\t\tlog(\"        only run the commands between the labels (see below). an empty\\n\");\n\t\tlog(\"        from label is synonymous to 'begin', and empty to label is\\n\");\n\t\tlog(\"        synonymous to the end of the command list.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -noflatten\\n\");\n\t\tlog(\"        do not flatten design before synthesis\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -retime\\n\");\n\t\tlog(\"        run 'abc' with -dff option\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -noccu2\\n\");\n\t\tlog(\"        do not use CCU2 cells in output netlist\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -nodffe\\n\");\n\t\tlog(\"        do not use flipflops with CE in output netlist\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -nobram\\n\");\n\t\tlog(\"        do not use BRAM cells in output netlist\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -nodram\\n\");\n\t\tlog(\"        do not use distributed RAM cells in output netlist\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -nomux\\n\");\n\t\tlog(\"        do not use PFU muxes to implement LUTs larger than LUT4s\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -abc2\\n\");\n\t\tlog(\"        run two passes of 'abc' for slightly improved logic density\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -vpr\\n\");\n\t\tlog(\"        generate an output netlist (and BLIF file) suitable for VPR\\n\");\n\t\tlog(\"        (this feature is experimental and incomplete)\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"The following commands are executed by this synthesis command:\\n\");\n\t\thelp_script();\n\t\tlog(\"\\n\");\n\t}\n\n\tstring top_opt, blif_file, edif_file, json_file;\n\tbool noccu2, nodffe, nobram, nodram, nomux, flatten, retime, abc2, vpr;\n\n\tvoid clear_flags() YS_OVERRIDE\n\t{\n\t\ttop_opt = \"-auto-top\";\n\t\tblif_file = \"\";\n\t\tedif_file = \"\";\n\t\tjson_file = \"\";\n\t\tnoccu2 = false;\n\t\tnodffe = false;\n\t\tnobram = false;\n\t\tnodram = false;\n\t\tnomux = false;\n\t\tflatten = true;\n\t\tretime = false;\n\t\tabc2 = false;\n\t\tvpr = false;\n\t}\n\n\tvoid execute(std::vector<std::string> args, RTLIL::Design *design) YS_OVERRIDE\n\t{\n\t\tstring run_from, run_to;\n\t\tclear_flags();\n\n\t\tsize_t argidx;\n\t\tfor (argidx = 1; argidx < args.size(); argidx++)\n\t\t{\n\t\t\tif (args[argidx] == \"-top\" && argidx+1 < args.size()) {\n\t\t\t\ttop_opt = \"-top \" + args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-blif\" && argidx+1 < args.size()) {\n\t\t\t\tblif_file = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-edif\" && argidx+1 < args.size()) {\n\t\t\t\tedif_file = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-json\" && argidx+1 < args.size()) {\n\t\t\t\tjson_file = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-run\" && argidx+1 < args.size()) {\n\t\t\t\tsize_t pos = args[argidx+1].find(':');\n\t\t\t\tif (pos == std::string::npos)\n\t\t\t\t\tbreak;\n\t\t\t\trun_from = args[++argidx].substr(0, pos);\n\t\t\t\trun_to = args[argidx].substr(pos+1);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-flatten\") {\n\t\t\t\tflatten = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-noflatten\") {\n\t\t\t\tflatten = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-retime\") {\n\t\t\t\tretime = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-noccu2\") {\n\t\t\t\tnoccu2 = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-nodffe\") {\n\t\t\t\tnodffe = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-nobram\") {\n\t\t\t\tnobram = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-nodram\") {\n\t\t\t\tnodram = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-nomux\") {\n\t\t\t\tnomux = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-abc2\") {\n\t\t\t\tabc2 = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-vpr\") {\n\t\t\t\tvpr = true;\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\tif (!design->full_selection())\n\t\t\tlog_cmd_error(\"This command only operates on fully selected designs!\\n\");\n\n\t\tlog_header(design, \"Executing SYNTH_ECP5 pass.\\n\");\n\t\tlog_push();\n\n\t\trun_script(design, run_from, run_to);\n\n\t\tlog_pop();\n\t}\n\n\tvoid script() YS_OVERRIDE\n\t{\n\t\tif (check_label(\"begin\"))\n\t\t{\n\t\t\trun(\"read_verilog -lib +\/ecp5\/cells_sim.v +\/ecp5\/cells_bb.v\");\n\t\t\trun(stringf(\"hierarchy -check %s\", help_mode ? \"-top <top>\" : top_opt.c_str()));\n\t\t}\n\n\t\tif (flatten && check_label(\"flatten\", \"(unless -noflatten)\"))\n\t\t{\n\t\t\trun(\"proc\");\n\t\t\trun(\"flatten\");\n\t\t\trun(\"tribuf -logic\");\n\t\t\trun(\"deminout\");\n\t\t}\n\n\t\tif (check_label(\"coarse\"))\n\t\t{\n\t\t\trun(\"synth -run coarse\");\n\t\t}\n\n\t\tif (!nobram && check_label(\"bram\", \"(skip if -nobram)\"))\n\t\t{\n\t\t\trun(\"memory_bram -rules +\/ecp5\/bram.txt\");\n\t\t\trun(\"techmap -map +\/ecp5\/brams_map.v\");\n\t\t}\n\n\t\tif (!nodram && check_label(\"dram\", \"(skip if -nodram)\"))\n\t\t{\n\t\t\trun(\"memory_bram -rules +\/ecp5\/dram.txt\");\n\t\t\trun(\"techmap -map +\/ecp5\/drams_map.v\");\n\t\t}\n\n\t\tif (check_label(\"fine\"))\n\t\t{\n\t\t\trun(\"opt -fast -mux_undef -undriven -fine\");\n\t\t\trun(\"memory_map\");\n\t\t\trun(\"opt -undriven -fine\");\n\t\t\tif (noccu2)\n\t\t\t\trun(\"techmap\");\n\t\t\telse\n\t\t\t\trun(\"techmap -map +\/techmap.v -map +\/ecp5\/arith_map.v\");\n\t\t\tif (retime || help_mode)\n\t\t\t\trun(\"abc -dff\", \"(only if -retime)\");\n\t\t}\n\n\t\tif (check_label(\"map_ffs\"))\n\t\t{\n\t\t\trun(\"dffsr2dff\");\n\t\t\trun(\"dff2dffs\");\n\t\t\trun(\"opt_clean\");\n\t\t\tif (!nodffe)\n\t\t\t\trun(\"dff2dffe -direct-match $_DFF_* -direct-match $__DFFS_*\");\n\t\t\trun(\"techmap -D NO_LUT -map +\/ecp5\/cells_map.v\");\n\t\t\trun(\"opt_expr -undriven -mux_undef\");\n\t\t\trun(\"simplemap\");\n\t\t\trun(\"ecp5_ffinit\");\n\t\t}\n\n\t\tif (check_label(\"map_luts\"))\n\t\t{\n\t\t\tif (abc2 || help_mode) {\n\t\t\t\trun(\"abc\", \"      (only if -abc2)\");\n\t\t\t}\n\t\t\trun(\"techmap -map +\/ecp5\/latches_map.v\");\n\t\t\tif (nomux)\n\t\t\t\trun(\"abc -lut 4 -dress\");\n\t\t\telse\n\t\t\t\trun(\"abc -lut 4:7 -dress\");\n\t\t\trun(\"clean\");\n\t\t}\n\n\t\tif (check_label(\"map_cells\"))\n\t\t{\n\t\t\tif (vpr)\n\t\t\t\trun(\"techmap -D NO_LUT -map +\/ecp5\/cells_map.v\");\n\t\t\telse\n\t\t\t\trun(\"techmap -map +\/ecp5\/cells_map.v\", \"(with -D NO_LUT in vpr mode)\");\n\n\t\t\trun(\"clean\");\n\t\t}\n\n\t\tif (check_label(\"check\"))\n\t\t{\n\t\t\trun(\"hierarchy -check\");\n\t\t\trun(\"stat\");\n\t\t\trun(\"check -noinit\");\n\t\t}\n\n\t\tif (check_label(\"blif\"))\n\t\t{\n\t\t\tif (!blif_file.empty() || help_mode) {\n\t\t\t\tif (vpr || help_mode) {\n\t\t\t\t\trun(stringf(\"opt_clean -purge\"),\n\t\t\t\t\t\t\t\"                                 (vpr mode)\");\n\t\t\t\t\trun(stringf(\"write_blif -attr -cname -conn -param %s\",\n\t\t\t\t\t\t\thelp_mode ? \"<file-name>\" : blif_file.c_str()),\n\t\t\t\t\t\t\t\" (vpr mode)\");\n\t\t\t\t}\n\t\t\t\tif (!vpr)\n\t\t\t\t\trun(stringf(\"write_blif -gates -attr -param %s\",\n\t\t\t\t\t\t\thelp_mode ? \"<file-name>\" : blif_file.c_str()),\n\t\t\t\t\t\t\t\"       (non-vpr mode)\");\n\t\t\t}\n\t\t}\n\n\t\tif (check_label(\"edif\"))\n\t\t{\n\t\t\tif (!edif_file.empty() || help_mode)\n\t\t\t\trun(stringf(\"write_edif %s\", help_mode ? \"<file-name>\" : edif_file.c_str()));\n\t\t}\n\n\t\tif (check_label(\"json\"))\n\t\t{\n\t\t\tif (!json_file.empty() || help_mode)\n\t\t\t\trun(stringf(\"write_json %s\", help_mode ? \"<file-name>\" : json_file.c_str()));\n\t\t}\n\t}\n} SynthEcp5Pass;\n\nPRIVATE_NAMESPACE_END\n<commit_msg>synth_ecp5 rename -nomux to -nowidelut, but preserve former<commit_after>\/*\n *  yosys -- Yosys Open SYnthesis Suite\n *\n *  Copyright (C) 2012 Clifford Wolf <clifford@clifford.at>\n *  Copyright (C) 2018 Clifford Wolf <dave@ds0.me>\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 \"kernel\/rtlil.h\"\n#include \"kernel\/log.h\"\n\nUSING_YOSYS_NAMESPACE\nPRIVATE_NAMESPACE_BEGIN\n\nstruct SynthEcp5Pass : public ScriptPass\n{\n\tSynthEcp5Pass() : ScriptPass(\"synth_ecp5\", \"synthesis for ECP5 FPGAs\") { }\n\n\tvoid help() YS_OVERRIDE\n\t{\n\t\t\/\/   |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|\n\t\tlog(\"\\n\");\n\t\tlog(\"    synth_ecp5 [options]\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"This command runs synthesis for ECP5 FPGAs.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -top <module>\\n\");\n\t\tlog(\"        use the specified module as top module\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -blif <file>\\n\");\n\t\tlog(\"        write the design to the specified BLIF file. writing of an output file\\n\");\n\t\tlog(\"        is omitted if this parameter is not specified.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -edif <file>\\n\");\n\t\tlog(\"        write the design to the specified EDIF file. writing of an output file\\n\");\n\t\tlog(\"        is omitted if this parameter is not specified.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -json <file>\\n\");\n\t\tlog(\"        write the design to the specified JSON file. writing of an output file\\n\");\n\t\tlog(\"        is omitted if this parameter is not specified.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -run <from_label>:<to_label>\\n\");\n\t\tlog(\"        only run the commands between the labels (see below). an empty\\n\");\n\t\tlog(\"        from label is synonymous to 'begin', and empty to label is\\n\");\n\t\tlog(\"        synonymous to the end of the command list.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -noflatten\\n\");\n\t\tlog(\"        do not flatten design before synthesis\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -retime\\n\");\n\t\tlog(\"        run 'abc' with -dff option\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -noccu2\\n\");\n\t\tlog(\"        do not use CCU2 cells in output netlist\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -nodffe\\n\");\n\t\tlog(\"        do not use flipflops with CE in output netlist\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -nobram\\n\");\n\t\tlog(\"        do not use BRAM cells in output netlist\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -nodram\\n\");\n\t\tlog(\"        do not use distributed RAM cells in output netlist\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -nowidelut\\n\");\n\t\tlog(\"        do not use PFU muxes to implement LUTs larger than LUT4s\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -abc2\\n\");\n\t\tlog(\"        run two passes of 'abc' for slightly improved logic density\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"    -vpr\\n\");\n\t\tlog(\"        generate an output netlist (and BLIF file) suitable for VPR\\n\");\n\t\tlog(\"        (this feature is experimental and incomplete)\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"The following commands are executed by this synthesis command:\\n\");\n\t\thelp_script();\n\t\tlog(\"\\n\");\n\t}\n\n\tstring top_opt, blif_file, edif_file, json_file;\n\tbool noccu2, nodffe, nobram, nodram, nowidelut, flatten, retime, abc2, vpr;\n\n\tvoid clear_flags() YS_OVERRIDE\n\t{\n\t\ttop_opt = \"-auto-top\";\n\t\tblif_file = \"\";\n\t\tedif_file = \"\";\n\t\tjson_file = \"\";\n\t\tnoccu2 = false;\n\t\tnodffe = false;\n\t\tnobram = false;\n\t\tnodram = false;\n\t\tnowidelut = false;\n\t\tflatten = true;\n\t\tretime = false;\n\t\tabc2 = false;\n\t\tvpr = false;\n\t}\n\n\tvoid execute(std::vector<std::string> args, RTLIL::Design *design) YS_OVERRIDE\n\t{\n\t\tstring run_from, run_to;\n\t\tclear_flags();\n\n\t\tsize_t argidx;\n\t\tfor (argidx = 1; argidx < args.size(); argidx++)\n\t\t{\n\t\t\tif (args[argidx] == \"-top\" && argidx+1 < args.size()) {\n\t\t\t\ttop_opt = \"-top \" + args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-blif\" && argidx+1 < args.size()) {\n\t\t\t\tblif_file = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-edif\" && argidx+1 < args.size()) {\n\t\t\t\tedif_file = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-json\" && argidx+1 < args.size()) {\n\t\t\t\tjson_file = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-run\" && argidx+1 < args.size()) {\n\t\t\t\tsize_t pos = args[argidx+1].find(':');\n\t\t\t\tif (pos == std::string::npos)\n\t\t\t\t\tbreak;\n\t\t\t\trun_from = args[++argidx].substr(0, pos);\n\t\t\t\trun_to = args[argidx].substr(pos+1);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-flatten\") {\n\t\t\t\tflatten = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-noflatten\") {\n\t\t\t\tflatten = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-retime\") {\n\t\t\t\tretime = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-noccu2\") {\n\t\t\t\tnoccu2 = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-nodffe\") {\n\t\t\t\tnodffe = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-nobram\") {\n\t\t\t\tnobram = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-nodram\") {\n\t\t\t\tnodram = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-nowidelut\" || args[argidx] == \"-nomux\") {\n\t\t\t\tnowidelut = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-abc2\") {\n\t\t\t\tabc2 = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-vpr\") {\n\t\t\t\tvpr = true;\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\tif (!design->full_selection())\n\t\t\tlog_cmd_error(\"This command only operates on fully selected designs!\\n\");\n\n\t\tlog_header(design, \"Executing SYNTH_ECP5 pass.\\n\");\n\t\tlog_push();\n\n\t\trun_script(design, run_from, run_to);\n\n\t\tlog_pop();\n\t}\n\n\tvoid script() YS_OVERRIDE\n\t{\n\t\tif (check_label(\"begin\"))\n\t\t{\n\t\t\trun(\"read_verilog -lib +\/ecp5\/cells_sim.v +\/ecp5\/cells_bb.v\");\n\t\t\trun(stringf(\"hierarchy -check %s\", help_mode ? \"-top <top>\" : top_opt.c_str()));\n\t\t}\n\n\t\tif (flatten && check_label(\"flatten\", \"(unless -noflatten)\"))\n\t\t{\n\t\t\trun(\"proc\");\n\t\t\trun(\"flatten\");\n\t\t\trun(\"tribuf -logic\");\n\t\t\trun(\"deminout\");\n\t\t}\n\n\t\tif (check_label(\"coarse\"))\n\t\t{\n\t\t\trun(\"synth -run coarse\");\n\t\t}\n\n\t\tif (!nobram && check_label(\"bram\", \"(skip if -nobram)\"))\n\t\t{\n\t\t\trun(\"memory_bram -rules +\/ecp5\/bram.txt\");\n\t\t\trun(\"techmap -map +\/ecp5\/brams_map.v\");\n\t\t}\n\n\t\tif (!nodram && check_label(\"dram\", \"(skip if -nodram)\"))\n\t\t{\n\t\t\trun(\"memory_bram -rules +\/ecp5\/dram.txt\");\n\t\t\trun(\"techmap -map +\/ecp5\/drams_map.v\");\n\t\t}\n\n\t\tif (check_label(\"fine\"))\n\t\t{\n\t\t\trun(\"opt -fast -mux_undef -undriven -fine\");\n\t\t\trun(\"memory_map\");\n\t\t\trun(\"opt -undriven -fine\");\n\t\t\tif (noccu2)\n\t\t\t\trun(\"techmap\");\n\t\t\telse\n\t\t\t\trun(\"techmap -map +\/techmap.v -map +\/ecp5\/arith_map.v\");\n\t\t\tif (retime || help_mode)\n\t\t\t\trun(\"abc -dff\", \"(only if -retime)\");\n\t\t}\n\n\t\tif (check_label(\"map_ffs\"))\n\t\t{\n\t\t\trun(\"dffsr2dff\");\n\t\t\trun(\"dff2dffs\");\n\t\t\trun(\"opt_clean\");\n\t\t\tif (!nodffe)\n\t\t\t\trun(\"dff2dffe -direct-match $_DFF_* -direct-match $__DFFS_*\");\n\t\t\trun(\"techmap -D NO_LUT -map +\/ecp5\/cells_map.v\");\n\t\t\trun(\"opt_expr -undriven -mux_undef\");\n\t\t\trun(\"simplemap\");\n\t\t\trun(\"ecp5_ffinit\");\n\t\t}\n\n\t\tif (check_label(\"map_luts\"))\n\t\t{\n\t\t\tif (abc2 || help_mode) {\n\t\t\t\trun(\"abc\", \"      (only if -abc2)\");\n\t\t\t}\n\t\t\trun(\"techmap -map +\/ecp5\/latches_map.v\");\n\t\t\tif (nowidelut)\n\t\t\t\trun(\"abc -lut 4 -dress\");\n\t\t\telse\n\t\t\t\trun(\"abc -lut 4:7 -dress\");\n\t\t\trun(\"clean\");\n\t\t}\n\n\t\tif (check_label(\"map_cells\"))\n\t\t{\n\t\t\tif (vpr)\n\t\t\t\trun(\"techmap -D NO_LUT -map +\/ecp5\/cells_map.v\");\n\t\t\telse\n\t\t\t\trun(\"techmap -map +\/ecp5\/cells_map.v\", \"(with -D NO_LUT in vpr mode)\");\n\n\t\t\trun(\"clean\");\n\t\t}\n\n\t\tif (check_label(\"check\"))\n\t\t{\n\t\t\trun(\"hierarchy -check\");\n\t\t\trun(\"stat\");\n\t\t\trun(\"check -noinit\");\n\t\t}\n\n\t\tif (check_label(\"blif\"))\n\t\t{\n\t\t\tif (!blif_file.empty() || help_mode) {\n\t\t\t\tif (vpr || help_mode) {\n\t\t\t\t\trun(stringf(\"opt_clean -purge\"),\n\t\t\t\t\t\t\t\"                                 (vpr mode)\");\n\t\t\t\t\trun(stringf(\"write_blif -attr -cname -conn -param %s\",\n\t\t\t\t\t\t\thelp_mode ? \"<file-name>\" : blif_file.c_str()),\n\t\t\t\t\t\t\t\" (vpr mode)\");\n\t\t\t\t}\n\t\t\t\tif (!vpr)\n\t\t\t\t\trun(stringf(\"write_blif -gates -attr -param %s\",\n\t\t\t\t\t\t\thelp_mode ? \"<file-name>\" : blif_file.c_str()),\n\t\t\t\t\t\t\t\"       (non-vpr mode)\");\n\t\t\t}\n\t\t}\n\n\t\tif (check_label(\"edif\"))\n\t\t{\n\t\t\tif (!edif_file.empty() || help_mode)\n\t\t\t\trun(stringf(\"write_edif %s\", help_mode ? \"<file-name>\" : edif_file.c_str()));\n\t\t}\n\n\t\tif (check_label(\"json\"))\n\t\t{\n\t\t\tif (!json_file.empty() || help_mode)\n\t\t\t\trun(stringf(\"write_json %s\", help_mode ? \"<file-name>\" : json_file.c_str()));\n\t\t}\n\t}\n} SynthEcp5Pass;\n\nPRIVATE_NAMESPACE_END\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"var.hpp\"\n\ngenotype::~genotype(){}\n\nzvar::~zvar(){}\n\nvoid zvar::setPopName(string  popName){\n  name = popName;\n}\n\npooled::~pooled(){}\n\ndouble pooled::bound(double v){\n  if(v <= 0.00001){\n    return  0.00001;\n  }\n  if(v >= 0.99999){\n    return 0.99999;\n  }\n  return v;\n}\n\ngl::~gl(){}\n\ngl::gl(void){\n  nalt  = 0;\n  nref  = 0;\n  af    = 0;\n  nhomr = 0;\n  nhoma = 0;\n  nhet  = 0;\n  ngeno = 0;\n  fis   = 0;\n  hfrq  = 0;\n\n  alpha = 0.01;\n  beta  = 0.01;\n}\n\npl::~pl(){}\n\npl::pl(void){\n  nalt  = 0;\n  nref  = 0;\n  af    = 0;\n  nhomr = 0;\n  nhoma = 0;\n  nhet  = 0;\n  ngeno = 0;\n  fis   = 0;\n  hfrq  = 0;\n\n  alpha = 0.01;\n  beta  = 0.01;\n\n}\n\ngp::~gp(){}\n\ngp::gp(void){\n  nalt  = 0;\n  nref  = 0;\n  af    = 0;\n  nhomr = 0;\n  nhoma = 0;\n  nhet  = 0;\n  ngeno = 0;\n  fis   = 0;\n  hfrq  = 0;\n\n  alpha = 0.01;\n  beta  = 0.01;\n\n}\n\ngt::~gt(){}\n\ngt::gt(void){\n  nalt  = 0;\n  nref  = 0;\n  af    = 0;\n  nhomr = 0;\n  nhoma = 0;\n  nhet  = 0;\n  ngeno = 0;\n  fis   = 0;\n  hfrq  = 0;\n\n  alpha = 0.01;\n  beta  = 0.01;\n\n}\n\npooled::pooled(void){\n\n  npop   = 0;\n  afsum  = 0;\n  nalt   = 0;\n  nref   = 0;\n  af     = 0;\n  npop   = 0;\n  ntot   = 0;\n\n  alpha  = 0.01;\n  beta   = 0.01;\n\n}\n\n\/\/ polymorphism for GL and PL\n\ndouble gt::unphred(map< string, vector<string> > & geno, int index){\n  return -1;\n}\n\ndouble gl::unphred(map< string, vector<string> > & geno, int index){\n \n  double unphreded = atof(geno[\"GL\"][index].c_str());\n  return unphreded;\n}\n\ndouble gp::unphred(map< string, vector<string> > & geno, int index){\n \n  double unphreded = atof(geno[\"GP\"][index].c_str());\n  return log(unphreded) ;\n}\n\ndouble pl::unphred(map< string, vector<string> > & geno, int index){\n\n   double unphreded = atof(geno[\"PL\"][index].c_str());\n\n   unphreded = log(pow(10, (-unphreded\/10)));\n     \n   return unphreded;\n}\n\nvoid pooled::loadPop(vector< map< string, vector<string> > > & group, string seqid, long int position){\n  vector< map< string, vector<string> > >::iterator targ_it = group.begin();\n\n\n  for(; targ_it != group.end(); targ_it++){\n\n    string genotype = (*targ_it)[\"GT\"].front();\n\n    if(genotype == \".\/.\"){\n      continue;\n    }\n\n    string allelecounts = (*targ_it)[\"AD\"].front();\n\n    vector<string> ac   = (*targ_it)[\"AD\"];\n    \n    npop += 1;\n    \n\n    double af = atof(ac[1].c_str()) \/ ( atof(ac[0].c_str()) + atof(ac[1].c_str()) );\n\n    if(atof(ac[1].c_str()) == 0){\n      af = 0;\n    }\n    if(atof(ac[0].c_str()) == 0){\n      af = 1;\n    }\n        \n    afsum += af;\n\t\t\t\t \n    afs.push_back(af);\n\n    nrefs.push_back(atof(ac[0].c_str()));\n    nalts.push_back(atof(ac[1].c_str()));\n\n    nref += atof(ac[0].c_str());\n    ntot += atof(ac[0].c_str());\n    nalt += atof(ac[1].c_str());\n    ntot += atof(ac[1].c_str());\n  }\n  if(npop < 1){\n    af = -1;\n  }\n  else{\n    af = afsum \/ npop;\n  }\n}\n\nvoid genotype::estimatePosterior(void){\n\n  int ng = genoIndex.size();\n\n  for(int i = 0 ; i < ng; i++){\n\n    if(genoIndex[i] == -1){\n      continue;\n    }\n\n    double aa = genoLikelihoods[i][0] ;\n    double ab = genoLikelihoods[i][1] ;\n    double bb = genoLikelihoods[i][2] ;\n\n    alpha += exp(ab);\n    beta  += exp(ab);\n\n    alpha += 2 * exp(aa);\n    beta  += 2 * exp(bb);\n  }\n  \n  \n}\n\nvoid pooled::estimatePosterior(void){\n  \n  if(npop < 2){\n    cerr << \"FATAL: not enough pooled populations in the target or background\\n\";\n    exit(1);\n  }\n  \n  double xbar = af;\n  double ss = 0;\n  \n  for(int i = 0 ; i < npop; i++){\n    ss += pow(( afs[i] - xbar),2);\n  }\n  \n  double var = (1\/(npop-1))*ss;\n  \n  xbar = bound(xbar);\n  if(var < 0.01){\n    var = 0.01;\n  }\n  if(var < xbar*(1-xbar)){\n    alpha = xbar * (((xbar*(1-xbar))\/var) -1);\n    beta  = (1 - xbar) * (((xbar*(1-xbar))\/var) -1);\n  }\n  else{\n    alpha = -1;\n    beta  = -1;\n  }\n}\n\nvoid genotype::loadPop( vector< map< string, vector<string> > >& group, string seqid, long int position){\n\n  seqid = seqid;\n  pos   = position  ;\n\n  vector< map< string, vector<string> > >::iterator targ_it = group.begin();\n\n  for(; targ_it != group.end(); targ_it++){\n        \n    string genotype = (*targ_it)[\"GT\"].front();\n\n    if(genotype == \".\/0\" || genotype == \".\/1\" || genotype == \".\"){\n      genotype = \".\/.\";\n    }\n\n    gts.push_back(genotype);\n\n    vector<double> phreds;\n    vector<double> phredsCDF;\n\n    double sum  = 0;\n    if(genotype != \".\/.\"){\n\n      double pa  =  unphred( (*targ_it), 0)  ;\n      double pab =  unphred( (*targ_it), 1)  ;\n      double pbb =  unphred( (*targ_it), 2)  ;\n\n      double norm = log(exp(pa) + exp(pab) + exp(pbb))  ;\n\n      phreds.push_back(pa  - norm);\n      phreds.push_back(pab - norm);\n      phreds.push_back(pbb - norm);\n\n    \n      sum += exp(pa - norm);\n      \/\/      cerr << sum << endl;\n      phredsCDF.push_back(sum);\n      sum += exp(pab - norm);\n      \/\/      cerr << sum << endl;\n      phredsCDF.push_back(sum);\n      sum += exp(pbb - norm);\n      \/\/      cerr << sum << endl;\n      \/\/      cerr << endl;\n      phredsCDF.push_back(sum);\n    }\n    else{\n      phreds.push_back(log(1\/3));\n      phreds.push_back(log(1\/3));\n      phreds.push_back(log(1\/3));\n      phredsCDF.push_back(1\/3);\n      phredsCDF.push_back(2\/3);\n      phredsCDF.push_back(1);\n    }\n\n    genoLikelihoods.push_back(phreds);\n    genoLikelihoodsCDF.push_back(phredsCDF);\n\n    \n    while(1){\n      if(genotype == \".\/.\"){\n        genoIndex.push_back(-1);\n        break;\n      }\n      if(genotype == \"0\/0\"){\n        ngeno += 1;\n        nhomr += 1;\n        nref  += 2;\n        genoIndex.push_back(0);\n        break;\n      }\n      if(genotype == \"0\/1\"){\n        ngeno += 1;\n        nhet  += 1;\n        nref  += 1;\n        nalt  += 1;\n        genoIndex.push_back(1);\n        break;\n      }\n      if(genotype == \"1\/0\"){\n        ngeno += 1;\n        nhet  += 1;\n\tnref  += 1;\n        nalt  += 1;\n        genoIndex.push_back(1);\n        break;\n      }\n      if(genotype == \"1\/1\"){\n\tngeno += 1;\n        nhoma += 1;\n        nalt  += 2;\n        genoIndex.push_back(2);\n        break;\n      }\n      if(genotype == \"0|0\"){\n        ngeno += 1;\n        nhomr += 1;\n        nref  += 2;\n        genoIndex.push_back(0);\n        break;\n      }\n      if(genotype == \"0|1\"){\n        ngeno += 1;\n        nhet  += 1;\n        nref  += 1;\n        nalt  += 1;\n        genoIndex.push_back(1);\n        break;\n      }\n      if(genotype == \"1|0\"){\n        ngeno += 1;\n        nhet  += 1;\n        nref  += 1;\n        nalt  += 1;\n        genoIndex.push_back(1);\n        break;\n      }\n      if(genotype == \"1|1\"){\n        ngeno += 1;\n        nhoma += 1;\n        nalt  += 2;\n        genoIndex.push_back(2);\n        break;\n      }\n      cerr << \"FATAL: unknown genotype: \" << genotype << endl;\n      exit(1);\n    }\n  }\n  if(nalt == 0 && nref == 0){\n    af = -1;\n  }\n  else{\n    af  = (nalt \/ (nref + nalt));\n\n    if(nhet > 0){\n      fis = ( 1 - ((nhet\/ngeno) \/ (2*af*(1 - af))));\n    }\n    else{\n      fis = 1;\n    }\n    if(fis < 0){\n      fis = 0.00001;\n    }\n  }\n  hfrq = nhet \/ ngeno;\n  npop = ngeno;\n}\n<commit_msg>Copyright header<commit_after>\/*\n    vcflib C++ library for parsing and manipulating VCF files\n\n    Copyright © 2010-2020 Erik Garrison\n    Copyright © 2020      Pjotr Prins\n    Copyright © 2014      Zev N. Kronenberg\n\n    This software is published under the MIT License. See the LICENSE file.\n*\/\n\n#include \"var.hpp\"\n\ngenotype::~genotype(){}\n\nzvar::~zvar(){}\n\nvoid zvar::setPopName(string  popName){\n  name = popName;\n}\n\npooled::~pooled(){}\n\ndouble pooled::bound(double v){\n  if(v <= 0.00001){\n    return  0.00001;\n  }\n  if(v >= 0.99999){\n    return 0.99999;\n  }\n  return v;\n}\n\ngl::~gl(){}\n\ngl::gl(void){\n  nalt  = 0;\n  nref  = 0;\n  af    = 0;\n  nhomr = 0;\n  nhoma = 0;\n  nhet  = 0;\n  ngeno = 0;\n  fis   = 0;\n  hfrq  = 0;\n\n  alpha = 0.01;\n  beta  = 0.01;\n}\n\npl::~pl(){}\n\npl::pl(void){\n  nalt  = 0;\n  nref  = 0;\n  af    = 0;\n  nhomr = 0;\n  nhoma = 0;\n  nhet  = 0;\n  ngeno = 0;\n  fis   = 0;\n  hfrq  = 0;\n\n  alpha = 0.01;\n  beta  = 0.01;\n\n}\n\ngp::~gp(){}\n\ngp::gp(void){\n  nalt  = 0;\n  nref  = 0;\n  af    = 0;\n  nhomr = 0;\n  nhoma = 0;\n  nhet  = 0;\n  ngeno = 0;\n  fis   = 0;\n  hfrq  = 0;\n\n  alpha = 0.01;\n  beta  = 0.01;\n\n}\n\ngt::~gt(){}\n\ngt::gt(void){\n  nalt  = 0;\n  nref  = 0;\n  af    = 0;\n  nhomr = 0;\n  nhoma = 0;\n  nhet  = 0;\n  ngeno = 0;\n  fis   = 0;\n  hfrq  = 0;\n\n  alpha = 0.01;\n  beta  = 0.01;\n\n}\n\npooled::pooled(void){\n\n  npop   = 0;\n  afsum  = 0;\n  nalt   = 0;\n  nref   = 0;\n  af     = 0;\n  npop   = 0;\n  ntot   = 0;\n\n  alpha  = 0.01;\n  beta   = 0.01;\n\n}\n\n\/\/ polymorphism for GL and PL\n\ndouble gt::unphred(map< string, vector<string> > & geno, int index){\n  return -1;\n}\n\ndouble gl::unphred(map< string, vector<string> > & geno, int index){\n \n  double unphreded = atof(geno[\"GL\"][index].c_str());\n  return unphreded;\n}\n\ndouble gp::unphred(map< string, vector<string> > & geno, int index){\n \n  double unphreded = atof(geno[\"GP\"][index].c_str());\n  return log(unphreded) ;\n}\n\ndouble pl::unphred(map< string, vector<string> > & geno, int index){\n\n   double unphreded = atof(geno[\"PL\"][index].c_str());\n\n   unphreded = log(pow(10, (-unphreded\/10)));\n     \n   return unphreded;\n}\n\nvoid pooled::loadPop(vector< map< string, vector<string> > > & group, string seqid, long int position){\n  vector< map< string, vector<string> > >::iterator targ_it = group.begin();\n\n\n  for(; targ_it != group.end(); targ_it++){\n\n    string genotype = (*targ_it)[\"GT\"].front();\n\n    if(genotype == \".\/.\"){\n      continue;\n    }\n\n    string allelecounts = (*targ_it)[\"AD\"].front();\n\n    vector<string> ac   = (*targ_it)[\"AD\"];\n    \n    npop += 1;\n    \n\n    double af = atof(ac[1].c_str()) \/ ( atof(ac[0].c_str()) + atof(ac[1].c_str()) );\n\n    if(atof(ac[1].c_str()) == 0){\n      af = 0;\n    }\n    if(atof(ac[0].c_str()) == 0){\n      af = 1;\n    }\n        \n    afsum += af;\n\t\t\t\t \n    afs.push_back(af);\n\n    nrefs.push_back(atof(ac[0].c_str()));\n    nalts.push_back(atof(ac[1].c_str()));\n\n    nref += atof(ac[0].c_str());\n    ntot += atof(ac[0].c_str());\n    nalt += atof(ac[1].c_str());\n    ntot += atof(ac[1].c_str());\n  }\n  if(npop < 1){\n    af = -1;\n  }\n  else{\n    af = afsum \/ npop;\n  }\n}\n\nvoid genotype::estimatePosterior(void){\n\n  int ng = genoIndex.size();\n\n  for(int i = 0 ; i < ng; i++){\n\n    if(genoIndex[i] == -1){\n      continue;\n    }\n\n    double aa = genoLikelihoods[i][0] ;\n    double ab = genoLikelihoods[i][1] ;\n    double bb = genoLikelihoods[i][2] ;\n\n    alpha += exp(ab);\n    beta  += exp(ab);\n\n    alpha += 2 * exp(aa);\n    beta  += 2 * exp(bb);\n  }\n  \n  \n}\n\nvoid pooled::estimatePosterior(void){\n  \n  if(npop < 2){\n    cerr << \"FATAL: not enough pooled populations in the target or background\\n\";\n    exit(1);\n  }\n  \n  double xbar = af;\n  double ss = 0;\n  \n  for(int i = 0 ; i < npop; i++){\n    ss += pow(( afs[i] - xbar),2);\n  }\n  \n  double var = (1\/(npop-1))*ss;\n  \n  xbar = bound(xbar);\n  if(var < 0.01){\n    var = 0.01;\n  }\n  if(var < xbar*(1-xbar)){\n    alpha = xbar * (((xbar*(1-xbar))\/var) -1);\n    beta  = (1 - xbar) * (((xbar*(1-xbar))\/var) -1);\n  }\n  else{\n    alpha = -1;\n    beta  = -1;\n  }\n}\n\nvoid genotype::loadPop( vector< map< string, vector<string> > >& group, string seqid, long int position){\n\n  seqid = seqid;\n  pos   = position  ;\n\n  vector< map< string, vector<string> > >::iterator targ_it = group.begin();\n\n  for(; targ_it != group.end(); targ_it++){\n        \n    string genotype = (*targ_it)[\"GT\"].front();\n\n    if(genotype == \".\/0\" || genotype == \".\/1\" || genotype == \".\"){\n      genotype = \".\/.\";\n    }\n\n    gts.push_back(genotype);\n\n    vector<double> phreds;\n    vector<double> phredsCDF;\n\n    double sum  = 0;\n    if(genotype != \".\/.\"){\n\n      double pa  =  unphred( (*targ_it), 0)  ;\n      double pab =  unphred( (*targ_it), 1)  ;\n      double pbb =  unphred( (*targ_it), 2)  ;\n\n      double norm = log(exp(pa) + exp(pab) + exp(pbb))  ;\n\n      phreds.push_back(pa  - norm);\n      phreds.push_back(pab - norm);\n      phreds.push_back(pbb - norm);\n\n    \n      sum += exp(pa - norm);\n      \/\/      cerr << sum << endl;\n      phredsCDF.push_back(sum);\n      sum += exp(pab - norm);\n      \/\/      cerr << sum << endl;\n      phredsCDF.push_back(sum);\n      sum += exp(pbb - norm);\n      \/\/      cerr << sum << endl;\n      \/\/      cerr << endl;\n      phredsCDF.push_back(sum);\n    }\n    else{\n      phreds.push_back(log(1\/3));\n      phreds.push_back(log(1\/3));\n      phreds.push_back(log(1\/3));\n      phredsCDF.push_back(1\/3);\n      phredsCDF.push_back(2\/3);\n      phredsCDF.push_back(1);\n    }\n\n    genoLikelihoods.push_back(phreds);\n    genoLikelihoodsCDF.push_back(phredsCDF);\n\n    \n    while(1){\n      if(genotype == \".\/.\"){\n        genoIndex.push_back(-1);\n        break;\n      }\n      if(genotype == \"0\/0\"){\n        ngeno += 1;\n        nhomr += 1;\n        nref  += 2;\n        genoIndex.push_back(0);\n        break;\n      }\n      if(genotype == \"0\/1\"){\n        ngeno += 1;\n        nhet  += 1;\n        nref  += 1;\n        nalt  += 1;\n        genoIndex.push_back(1);\n        break;\n      }\n      if(genotype == \"1\/0\"){\n        ngeno += 1;\n        nhet  += 1;\n\tnref  += 1;\n        nalt  += 1;\n        genoIndex.push_back(1);\n        break;\n      }\n      if(genotype == \"1\/1\"){\n\tngeno += 1;\n        nhoma += 1;\n        nalt  += 2;\n        genoIndex.push_back(2);\n        break;\n      }\n      if(genotype == \"0|0\"){\n        ngeno += 1;\n        nhomr += 1;\n        nref  += 2;\n        genoIndex.push_back(0);\n        break;\n      }\n      if(genotype == \"0|1\"){\n        ngeno += 1;\n        nhet  += 1;\n        nref  += 1;\n        nalt  += 1;\n        genoIndex.push_back(1);\n        break;\n      }\n      if(genotype == \"1|0\"){\n        ngeno += 1;\n        nhet  += 1;\n        nref  += 1;\n        nalt  += 1;\n        genoIndex.push_back(1);\n        break;\n      }\n      if(genotype == \"1|1\"){\n        ngeno += 1;\n        nhoma += 1;\n        nalt  += 2;\n        genoIndex.push_back(2);\n        break;\n      }\n      cerr << \"FATAL: unknown genotype: \" << genotype << endl;\n      exit(1);\n    }\n  }\n  if(nalt == 0 && nref == 0){\n    af = -1;\n  }\n  else{\n    af  = (nalt \/ (nref + nalt));\n\n    if(nhet > 0){\n      fis = ( 1 - ((nhet\/ngeno) \/ (2*af*(1 - af))));\n    }\n    else{\n      fis = 1;\n    }\n    if(fis < 0){\n      fis = 0.00001;\n    }\n  }\n  hfrq = nhet \/ ngeno;\n  npop = ngeno;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <cmath>\n#include <chrono>\n#include <random>\n#include <vector>\n#include <cassert>\n#include <fstream>\n#include <iomanip>\n#include <numeric>\n#include <sstream>\n#include <iostream>\n#include <algorithm>\n\n#include \"caf\/all.hpp\"\n\n#include \"vast\/coder.hpp\"\n#include \"vast\/operator.hpp\"\n#include \"vast\/wah_bitmap.hpp\"\n#include \"vast\/bitmap_index.hpp\"\n\n#include \"vast\/concept\/printable\/stream.hpp\"\n#include \"vast\/concept\/printable\/to_string.hpp\"\n#include \"vast\/concept\/printable\/vast\/coder.hpp\"\n#include \"vast\/concept\/printable\/vast\/bitmap.hpp\"\n\nusing namespace std;\nusing namespace std::chrono;\nusing namespace caf;\nusing namespace vast;\n\nclass config : public actor_system_config {\npublic:\n  string filename = \"\";\n  uint32_t bound = 0;\n  bool print_results;\n  config() {\n    opt_group{custom_options_, \"global\"}\n    .add(filename, \"data-file,f\", \"File with test data (one value per line)\")\n    .add(bound, \"bound,b\", \"maximum value (0 will scan values)\")\n    .add(print_results, \"print,p\", \"print resulting bitmap index\");\n  }\n};\n\nvoid caf_main(actor_system&, const config& cfg) {\n  vector<uint32_t> values;\n  if (cfg.filename.empty()) {\n    values = {10,  7, 22,  6,  7,  1,  9, 42,  2,  5,\n              13,  3,  2,  1,  0,  1, 18, 18,  3, 13,\n               5,  9,  0,  3,  2, 19,  5, 23, 22, 10,\n               6, 22};\n  } else {\n    cout << \"Reading data from '\" << cfg.filename << \"' ... \" << flush;\n    ifstream source{cfg.filename, std::ios::in};\n    uint32_t next;\n    while (source >> next) {\n      values.push_back(next);\n    }\n  }\n  auto amount = values.size();\n  cout << \"'\" << amount << \"' values.\" << endl;\n  auto bound = cfg.bound;\n  if (bound == 0 && amount > 0) {\n    auto itr = max_element(values.begin(), values.end());\n    bound = *itr;\n  }\n  cout << \"Maximum value is '\" << bound << \"'.\" << endl;\n\n  \/*\n  \/\/ Extract key set\n  vector<uint32_t> keys = values;\n  std::sort(keys.begin(), keys.end());\n  auto last = std::unique(keys.begin(), keys.end());\n  keys.erase(last, end(keys));\n  *\/\n\n  auto start = high_resolution_clock::now();\n  bitmap_index<uint32_t, equality_coder<wah_bitmap>> bmi{bound + 1};\n  for (auto& val : values)\n    bmi.push_back(val);\n  auto stop = high_resolution_clock::now();\n\n  if (cfg.print_results) {\n    \/\/ print index by key\n    auto& coder = bmi.coder();\n    cout << coder << endl;\n    \/*\n    auto& storage = coder.storage();\n    for (auto& key : keys)\n      cout << \"Index for value \" << key << \":\" << endl\n           << storage[key] << endl;\n    *\/\n  }\n  cout << \"Time: '\"\n       << duration_cast<milliseconds>(stop - start).count()\n       << \"' ms\" << endl;\n}\n\nCAF_MAIN()\n<commit_msg>Remove ambiguity of std::vector and VAST define<commit_after>\n#include <cmath>\n#include <chrono>\n#include <random>\n#include <vector>\n#include <cassert>\n#include <fstream>\n#include <iomanip>\n#include <numeric>\n#include <sstream>\n#include <iostream>\n#include <algorithm>\n\n#include \"caf\/all.hpp\"\n\n#include \"vast\/coder.hpp\"\n#include \"vast\/operator.hpp\"\n#include \"vast\/wah_bitmap.hpp\"\n#include \"vast\/bitmap_index.hpp\"\n\n#include \"vast\/concept\/printable\/stream.hpp\"\n#include \"vast\/concept\/printable\/to_string.hpp\"\n#include \"vast\/concept\/printable\/vast\/coder.hpp\"\n#include \"vast\/concept\/printable\/vast\/bitmap.hpp\"\n\nusing namespace std;\nusing namespace std::chrono;\nusing namespace caf;\nusing namespace vast;\n\nclass config : public actor_system_config {\npublic:\n  string filename = \"\";\n  uint32_t bound = 0;\n  bool print_results;\n  config() {\n    opt_group{custom_options_, \"global\"}\n    .add(filename, \"data-file,f\", \"File with test data (one value per line)\")\n    .add(bound, \"bound,b\", \"maximum value (0 will scan values)\")\n    .add(print_results, \"print,p\", \"print resulting bitmap index\");\n  }\n};\n\nvoid caf_main(actor_system&, const config& cfg) {\n  std::vector<uint32_t> values;\n  if (cfg.filename.empty()) {\n    values = {10,  7, 22,  6,  7,  1,  9, 42,  2,  5,\n              13,  3,  2,  1,  0,  1, 18, 18,  3, 13,\n               5,  9,  0,  3,  2, 19,  5, 23, 22, 10,\n               6, 22};\n  } else {\n    cout << \"Reading data from '\" << cfg.filename << \"' ... \" << flush;\n    ifstream source{cfg.filename, std::ios::in};\n    uint32_t next;\n    while (source >> next) {\n      values.push_back(next);\n    }\n  }\n  auto amount = values.size();\n  cout << \"'\" << amount << \"' values.\" << endl;\n  auto bound = cfg.bound;\n  if (bound == 0 && amount > 0) {\n    auto itr = max_element(values.begin(), values.end());\n    bound = *itr;\n  }\n  cout << \"Maximum value is '\" << bound << \"'.\" << endl;\n\n  \/*\n  \/\/ Extract key set\n  vector<uint32_t> keys = values;\n  std::sort(keys.begin(), keys.end());\n  auto last = std::unique(keys.begin(), keys.end());\n  keys.erase(last, end(keys));\n  *\/\n\n  auto start = high_resolution_clock::now();\n  bitmap_index<uint32_t, equality_coder<wah_bitmap>> bmi{bound + 1};\n  for (auto& val : values)\n    bmi.push_back(val);\n  auto stop = high_resolution_clock::now();\n\n  if (cfg.print_results) {\n    \/\/ print index by key\n    auto& coder = bmi.coder();\n    cout << coder << endl;\n    \/*\n    auto& storage = coder.storage();\n    for (auto& key : keys)\n      cout << \"Index for value \" << key << \":\" << endl\n           << storage[key] << endl;\n    *\/\n  }\n  cout << \"Time: '\"\n       << duration_cast<milliseconds>(stop - start).count()\n       << \"' ms\" << endl;\n}\n\nCAF_MAIN()\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * NotebookCache.cpp\n *\n * Copyright (C) 2009-16 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 \"SessionRmdNotebook.hpp\"\n#include \"SessionRnbParser.hpp\"\n#include \"NotebookCache.hpp\"\n#include \"NotebookChunkDefs.hpp\"\n#include \"NotebookPaths.hpp\"\n#include \"NotebookOutput.hpp\"\n#include \"NotebookHtmlWidgets.hpp\"\n\n#include <boost\/foreach.hpp>\n\n#include <session\/SessionUserSettings.hpp>\n#include <session\/SessionModuleContext.hpp>\n#include <session\/SessionSourceDatabase.hpp>\n\n#include <core\/Algorithm.hpp>\n\n#include <r\/RExec.hpp>\n#include <r\/RRoutines.hpp>\n\n\/\/ The version identifier for the cache format. Changing this invalidates old\n\/\/ caches, and should be done only when making breaking changes to the \n\/\/ cache format.\n#define kCacheVersion \"1\"\n\n#define kCacheAgeThresholdMs 1000 * 60 * 60 * 24 * 2\n\nusing namespace rstudio::core;\n\nnamespace rstudio {\nnamespace session {\nnamespace modules {\nnamespace rmarkdown {\nnamespace notebook {\nnamespace {\n\n\/\/ it's much faster to load a notebook from its cache than it is to rehydrate\n\/\/ it from its .Rnb, so we keep it around even if the document is closed (as\n\/\/ it's somewhat common to open and close a document periodically over the \n\/\/ course of working on a project, and it's nice when it opens quickly).\n\/\/\n\/\/ however, we don't want to keep the cache around *forever* just in case we\n\/\/ might need it, as it can be quite large. as a compromise, an unused cache\n\/\/ hangs around for a couple of days, then gets automatically swept up by this\n\/\/ function.\nvoid cleanUnusedCaches()\n{\n   FilePath cacheRoot = notebookCacheRoot();\n   if (!cacheRoot.exists())\n      return;\n\n   std::vector<FilePath> caches;\n   Error error = cacheRoot.children(&caches);\n   if (error)\n   {\n      LOG_ERROR(error);\n      return;\n   }\n\n   std::string nbCtxId = notebookCtxId();\n   BOOST_FOREACH(const FilePath cache, caches)\n   {\n      \/\/ make sure this looks like a notebook cache\n      if (!cache.isDirectory())\n         continue;\n      std::vector<std::string> parts = core::algorithm::split(\n            cache.stem(), \"-\");\n      if (parts.size() < 2)\n         continue;\n\n      \/\/ get the path of the notebook associated with the cache\n      FilePath path;\n      error = notebookIdToPath(parts[0], &path);\n      if (error)\n      {\n         if (error.code() == boost::system::errc::no_such_file_or_directory)\n         {\n            \/\/ we have no idea what notebook this cache is for, so it's \n            \/\/ unusable; delete it\n            error = cache.remove();\n            if (error)\n               LOG_ERROR(error);\n         }\n         else \n         {\n            LOG_ERROR(error);\n         }\n\n         continue;\n      }\n\n      \/\/ is this document still open? if so, leave the cache alone.\n      std::string id;\n      source_database::getId(module_context::createAliasedPath(\n               FileInfo(path)), &id);\n      if (!id.empty())\n      {\n         continue;\n      }\n\n      std::vector<FilePath> contexts;\n      error = cache.complete(kCacheVersion).children(&contexts);\n      if (error)\n      {\n         LOG_ERROR(error);\n         continue;\n      }\n\n      BOOST_FOREACH(const FilePath context, contexts)\n      {\n         \/\/ skip if not our context or the saved context\n         if (context.filename() != kSavedCtx &&\n             context.filename() != nbCtxId)\n            continue;\n\n         \/\/ check the write time on the chunk defs file (updated when the doc is\n         \/\/ mutated or saved)\n         FilePath chunkDefs = context.complete(kNotebookChunkDefFilename);\n         if (!chunkDefs.exists())\n            continue;\n         if ((std::time(NULL) - chunkDefs.lastWriteTime()) > kCacheAgeThresholdMs) \n         {\n            \/\/ the cache is old and the document hasn't been opened in a while --\n            \/\/ remove it.\n            error = context.remove();\n            if (error)\n               LOG_ERROR(error);\n         }\n      }\n   }\n}\n\nError removeStaleSavedChunks(FilePath& docPath, FilePath& cachePath)\n{\n   Error error;\n   if (!cachePath.exists())\n      return Success();\n\n   \/\/ extract the set of chunk IDs from the definition files\n   json::Value oldDefs;\n   json::Value newDefs;\n   error = getChunkDefs(docPath, kSavedCtx, NULL, &oldDefs);\n   if (error)\n      return error;\n   error = getChunkDefs(docPath, notebookCtxId(), NULL, &newDefs);\n   if (error)\n      return error;\n\n   \/\/ ensure we got the arrays we expected\n   if (oldDefs.type() != json::ArrayType ||\n       newDefs.type() != json::ArrayType)\n      return Error(json::errc::ParseError, ERROR_LOCATION);\n\n   cleanChunks(cachePath, oldDefs.get_array(), newDefs.get_array());\n   return Success();\n}\n\nvoid onDocRemoved(const std::string& docId, const std::string& docPath)\n{\n   \/\/ always remove the uncommitted cache when the doc is closed; if it's \n   \/\/ opened again, the committed cache will be used to supply its outputs\n   FilePath cacheFolder = chunkCacheFolder(docPath, docId, notebookCtxId());\n   Error error = cacheFolder.removeIfExists();\n   if (error)\n      LOG_ERROR(error);\n}\n\nvoid onDocRenamed(const std::string& oldPath, \n                  boost::shared_ptr<source_database::SourceDocument> pDoc)\n{\n   Error error;\n   bool removeOldDir = false;\n\n   \/\/ compute cache folders and ignore if we can't safely adjust them\n   FilePath oldCacheDir = chunkCacheFolder(oldPath, pDoc->id());\n   FilePath newCacheDir = chunkCacheFolder(pDoc->path(), pDoc->id());\n   if (!oldCacheDir.exists() || newCacheDir.exists())\n      return;\n\n   \/\/ if the doc was previously unsaved, we can just move the whole folder \n   \/\/ to its newly saved location\n   if (oldPath.empty())\n   {\n      error = oldCacheDir.move(newCacheDir);\n      if (error) \n      {\n         \/\/ if we can't move the cache to the new location, we'll fall back to\n         \/\/ copy\/remove\n         removeOldDir = true;\n      }\n      else\n         return;\n   }\n\n   error = oldCacheDir.copyDirectoryRecursive(newCacheDir);\n   if (error)\n   {\n      LOG_ERROR(error);\n   }\n   else if (removeOldDir) \n   {\n      \/\/ remove old dir if we couldn't move the folder above\n      error = oldCacheDir.remove();\n      if (error)\n         LOG_ERROR(error);\n   }\n}\n\nvoid onDocAdded(const std::string& id)\n{\n   std::string path;\n   Error error = source_database::getPath(id, &path);\n   if (error)\n   {\n      LOG_ERROR(error);\n      return;\n   }\n\n   \/\/ ignore empty paths and non-R Markdown files\n   if (path.empty())\n      return;\n   FilePath docPath = module_context::resolveAliasedPath(path);\n   if (docPath.extensionLowerCase() != \".rmd\")\n      return;\n\n   FilePath cachePath = chunkCacheFolder(path, id);\n\n   \/\/ clean up incompatible cache versions (as we're about to invalidate them\n   \/\/ by mutating the document without updating them) \n   if (cachePath.exists())\n   {\n      std::vector<FilePath> versions;\n      cachePath.children(&versions);\n      BOOST_FOREACH(const FilePath& version, versions)\n      {\n         if (version.isDirectory() && version.filename() != kCacheVersion)\n         {\n            error = version.remove();\n            if (error)\n               LOG_ERROR(error);\n         }\n      }\n   }\n\n   \/\/ TODO: consider write times of document, cache, and .Rnb -- are there\n   \/\/ combinations which would suggest we should overwrite the cache with the\n   \/\/ contents of the notebook?\n}\n\nvoid onDocSaved(FilePath &path)\n{\n   Error error;\n   \/\/ ignore non-R Markdown saves\n   if (!path.hasExtensionLowerCase(\".rmd\"))\n      return;\n\n   \/\/ find cache folder (bail out if it doesn't exist)\n   FilePath cache = chunkCacheFolder(path, \"\", notebookCtxId());\n   if (!cache.exists())\n      return;\n\n   FilePath saved = chunkCacheFolder(path, \"\", kSavedCtx);\n   if (saved.exists())\n   {\n      \/\/ tidy up: remove any saved chunks that no longer exist\n      error = removeStaleSavedChunks(path, saved);\n      if (error)\n         LOG_ERROR(error);\n   }\n   else\n   {\n      \/\/ no saved context yet; ensure we have a place to put it\n      saved.ensureDirectory();\n   }\n\n   \/\/ move all the chunk definitions over to the saved context\n   std::vector<FilePath> children;\n   error = cache.children(&children);\n   if (error)\n   {\n      LOG_ERROR(error);\n      return;\n   }\n   BOOST_FOREACH(const FilePath source, children)\n   {\n      \/\/ compute the target path \n      FilePath target = saved.complete(source.filename());\n\n      if (source.filename() == kNotebookChunkDefFilename) \n      {\n         \/\/ the definitions should be copied (we always want them in both\n         \/\/ contexts)\n         error = target.removeIfExists();\n         if (!error)\n            error = source.copy(target);\n      }\n      else if (source.isDirectory())\n      {\n         \/\/ library folders should be merged and then removed, so we don't\n         \/\/ lose library contents \n         if (source.filename() == kChunkLibDir)\n         {\n            error = mergeLib(source, target);\n            if (!error)\n               error = source.remove();\n         }\n         else\n         {\n            \/\/ the chunk output folders should be moved; destroy the old copy\n            error = target.removeIfExists();\n            if (!error)\n               error = source.move(target);\n         }\n      }\n      else\n      {\n         \/\/ nothing besides the chunks.json and chunk folders should be here,\n         \/\/ so ignore other files\/content\n         continue;\n      }\n\n      if (error)\n         LOG_ERROR(error);\n   }\n}\n\nFilePath unsavedNotebookCache()\n{\n   return module_context::sessionScratchPath().childPath(\"unsaved-notebooks\");\n}\n\nSEXP rs_chunkCacheFolder(SEXP fileSEXP)\n{\n   std::string file = r::sexp::safeAsString(fileSEXP);\n   FilePath cacheFolder = chunkCacheFolder(file, \"\", kSavedCtx);\n   \n   r::sexp::Protect protect;\n   return r::sexp::create(cacheFolder.absolutePath(), &protect);\n}\n\n} \/\/ anonymous namespace\n\nFilePath notebookCacheRoot()\n{ \n   return module_context::sharedScratchPath().childPath(\"notebooks\");\n}\n\nFilePath chunkCacheFolder(const FilePath& path, const std::string& docId,\n      const std::string& nbCtxId)\n{\n   FilePath folder;\n   std::string stem;\n\n   if (path.empty()) \n   {\n      \/\/ the doc hasn't been saved, so keep its chunk output in the scratch\n      \/\/ path\n      folder = unsavedNotebookCache().childPath(docId)\n                                     .childPath(kCacheVersion);\n   }\n   else\n   {\n      std::string id;\n      Error error = notebookPathToId(path, &id);\n      if (error)\n         LOG_ERROR(error);\n      \n      folder = notebookCacheRoot().childPath(id + \"-\" + path.stem())\n                                  .childPath(kCacheVersion)\n                                  .childPath(nbCtxId);\n   }\n\n   return folder;\n}\n\nFilePath chunkCacheFolder(const std::string& docPath, const std::string& docId,\n      const std::string& nbCtxId)\n{\n   return chunkCacheFolder(\n         docPath.empty() ? FilePath() : \n                           module_context::resolveAliasedPath(docPath),\n         docId, nbCtxId);\n}\n\nFilePath chunkCacheFolder(const std::string& docPath, const std::string& docId)\n{\n   return chunkCacheFolder(docPath, docId, notebookCtxId());\n}\n\nError initCache()\n{\n   source_database::events().onDocRenamed.connect(onDocRenamed);\n   source_database::events().onDocRemoved.connect(onDocRemoved);\n   source_database::events().onDocAdded.connect(onDocAdded);\n\n   module_context::events().onSourceEditorFileSaved.connect(onDocSaved);\n\n   RS_REGISTER_CALL_METHOD(rs_chunkCacheFolder, 1);\n\n   module_context::scheduleDelayedWork(boost::posix_time::seconds(30),\n      cleanUnusedCaches, true);\n\n   return Success();\n}\n\n} \/\/ namespace notebook\n} \/\/ namespace rmarkdown\n} \/\/ namespace modules\n} \/\/ namespace session\n} \/\/ namespace rstudio\n\n<commit_msg>pass path to notebook save listener by value<commit_after>\/*\n * NotebookCache.cpp\n *\n * Copyright (C) 2009-16 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 \"SessionRmdNotebook.hpp\"\n#include \"SessionRnbParser.hpp\"\n#include \"NotebookCache.hpp\"\n#include \"NotebookChunkDefs.hpp\"\n#include \"NotebookPaths.hpp\"\n#include \"NotebookOutput.hpp\"\n#include \"NotebookHtmlWidgets.hpp\"\n\n#include <boost\/foreach.hpp>\n\n#include <session\/SessionUserSettings.hpp>\n#include <session\/SessionModuleContext.hpp>\n#include <session\/SessionSourceDatabase.hpp>\n\n#include <core\/Algorithm.hpp>\n\n#include <r\/RExec.hpp>\n#include <r\/RRoutines.hpp>\n\n\/\/ The version identifier for the cache format. Changing this invalidates old\n\/\/ caches, and should be done only when making breaking changes to the \n\/\/ cache format.\n#define kCacheVersion \"1\"\n\n#define kCacheAgeThresholdMs 1000 * 60 * 60 * 24 * 2\n\nusing namespace rstudio::core;\n\nnamespace rstudio {\nnamespace session {\nnamespace modules {\nnamespace rmarkdown {\nnamespace notebook {\nnamespace {\n\n\/\/ it's much faster to load a notebook from its cache than it is to rehydrate\n\/\/ it from its .Rnb, so we keep it around even if the document is closed (as\n\/\/ it's somewhat common to open and close a document periodically over the \n\/\/ course of working on a project, and it's nice when it opens quickly).\n\/\/\n\/\/ however, we don't want to keep the cache around *forever* just in case we\n\/\/ might need it, as it can be quite large. as a compromise, an unused cache\n\/\/ hangs around for a couple of days, then gets automatically swept up by this\n\/\/ function.\nvoid cleanUnusedCaches()\n{\n   FilePath cacheRoot = notebookCacheRoot();\n   if (!cacheRoot.exists())\n      return;\n\n   std::vector<FilePath> caches;\n   Error error = cacheRoot.children(&caches);\n   if (error)\n   {\n      LOG_ERROR(error);\n      return;\n   }\n\n   std::string nbCtxId = notebookCtxId();\n   BOOST_FOREACH(const FilePath cache, caches)\n   {\n      \/\/ make sure this looks like a notebook cache\n      if (!cache.isDirectory())\n         continue;\n      std::vector<std::string> parts = core::algorithm::split(\n            cache.stem(), \"-\");\n      if (parts.size() < 2)\n         continue;\n\n      \/\/ get the path of the notebook associated with the cache\n      FilePath path;\n      error = notebookIdToPath(parts[0], &path);\n      if (error)\n      {\n         if (error.code() == boost::system::errc::no_such_file_or_directory)\n         {\n            \/\/ we have no idea what notebook this cache is for, so it's \n            \/\/ unusable; delete it\n            error = cache.remove();\n            if (error)\n               LOG_ERROR(error);\n         }\n         else \n         {\n            LOG_ERROR(error);\n         }\n\n         continue;\n      }\n\n      \/\/ is this document still open? if so, leave the cache alone.\n      std::string id;\n      source_database::getId(module_context::createAliasedPath(\n               FileInfo(path)), &id);\n      if (!id.empty())\n      {\n         continue;\n      }\n\n      std::vector<FilePath> contexts;\n      error = cache.complete(kCacheVersion).children(&contexts);\n      if (error)\n      {\n         LOG_ERROR(error);\n         continue;\n      }\n\n      BOOST_FOREACH(const FilePath context, contexts)\n      {\n         \/\/ skip if not our context or the saved context\n         if (context.filename() != kSavedCtx &&\n             context.filename() != nbCtxId)\n            continue;\n\n         \/\/ check the write time on the chunk defs file (updated when the doc is\n         \/\/ mutated or saved)\n         FilePath chunkDefs = context.complete(kNotebookChunkDefFilename);\n         if (!chunkDefs.exists())\n            continue;\n         if ((std::time(NULL) - chunkDefs.lastWriteTime()) > kCacheAgeThresholdMs) \n         {\n            \/\/ the cache is old and the document hasn't been opened in a while --\n            \/\/ remove it.\n            error = context.remove();\n            if (error)\n               LOG_ERROR(error);\n         }\n      }\n   }\n}\n\nError removeStaleSavedChunks(FilePath& docPath, FilePath& cachePath)\n{\n   Error error;\n   if (!cachePath.exists())\n      return Success();\n\n   \/\/ extract the set of chunk IDs from the definition files\n   json::Value oldDefs;\n   json::Value newDefs;\n   error = getChunkDefs(docPath, kSavedCtx, NULL, &oldDefs);\n   if (error)\n      return error;\n   error = getChunkDefs(docPath, notebookCtxId(), NULL, &newDefs);\n   if (error)\n      return error;\n\n   \/\/ ensure we got the arrays we expected\n   if (oldDefs.type() != json::ArrayType ||\n       newDefs.type() != json::ArrayType)\n      return Error(json::errc::ParseError, ERROR_LOCATION);\n\n   cleanChunks(cachePath, oldDefs.get_array(), newDefs.get_array());\n   return Success();\n}\n\nvoid onDocRemoved(const std::string& docId, const std::string& docPath)\n{\n   \/\/ always remove the uncommitted cache when the doc is closed; if it's \n   \/\/ opened again, the committed cache will be used to supply its outputs\n   FilePath cacheFolder = chunkCacheFolder(docPath, docId, notebookCtxId());\n   Error error = cacheFolder.removeIfExists();\n   if (error)\n      LOG_ERROR(error);\n}\n\nvoid onDocRenamed(const std::string& oldPath, \n                  boost::shared_ptr<source_database::SourceDocument> pDoc)\n{\n   Error error;\n   bool removeOldDir = false;\n\n   \/\/ compute cache folders and ignore if we can't safely adjust them\n   FilePath oldCacheDir = chunkCacheFolder(oldPath, pDoc->id());\n   FilePath newCacheDir = chunkCacheFolder(pDoc->path(), pDoc->id());\n   if (!oldCacheDir.exists() || newCacheDir.exists())\n      return;\n\n   \/\/ if the doc was previously unsaved, we can just move the whole folder \n   \/\/ to its newly saved location\n   if (oldPath.empty())\n   {\n      error = oldCacheDir.move(newCacheDir);\n      if (error) \n      {\n         \/\/ if we can't move the cache to the new location, we'll fall back to\n         \/\/ copy\/remove\n         removeOldDir = true;\n      }\n      else\n         return;\n   }\n\n   error = oldCacheDir.copyDirectoryRecursive(newCacheDir);\n   if (error)\n   {\n      LOG_ERROR(error);\n   }\n   else if (removeOldDir) \n   {\n      \/\/ remove old dir if we couldn't move the folder above\n      error = oldCacheDir.remove();\n      if (error)\n         LOG_ERROR(error);\n   }\n}\n\nvoid onDocAdded(const std::string& id)\n{\n   std::string path;\n   Error error = source_database::getPath(id, &path);\n   if (error)\n   {\n      LOG_ERROR(error);\n      return;\n   }\n\n   \/\/ ignore empty paths and non-R Markdown files\n   if (path.empty())\n      return;\n   FilePath docPath = module_context::resolveAliasedPath(path);\n   if (docPath.extensionLowerCase() != \".rmd\")\n      return;\n\n   FilePath cachePath = chunkCacheFolder(path, id);\n\n   \/\/ clean up incompatible cache versions (as we're about to invalidate them\n   \/\/ by mutating the document without updating them) \n   if (cachePath.exists())\n   {\n      std::vector<FilePath> versions;\n      cachePath.children(&versions);\n      BOOST_FOREACH(const FilePath& version, versions)\n      {\n         if (version.isDirectory() && version.filename() != kCacheVersion)\n         {\n            error = version.remove();\n            if (error)\n               LOG_ERROR(error);\n         }\n      }\n   }\n\n   \/\/ TODO: consider write times of document, cache, and .Rnb -- are there\n   \/\/ combinations which would suggest we should overwrite the cache with the\n   \/\/ contents of the notebook?\n}\n\nvoid onDocSaved(FilePath path)\n{\n   Error error;\n   \/\/ ignore non-R Markdown saves\n   if (!path.hasExtensionLowerCase(\".rmd\"))\n      return;\n\n   \/\/ find cache folder (bail out if it doesn't exist)\n   FilePath cache = chunkCacheFolder(path, \"\", notebookCtxId());\n   if (!cache.exists())\n      return;\n\n   FilePath saved = chunkCacheFolder(path, \"\", kSavedCtx);\n   if (saved.exists())\n   {\n      \/\/ tidy up: remove any saved chunks that no longer exist\n      error = removeStaleSavedChunks(path, saved);\n      if (error)\n         LOG_ERROR(error);\n   }\n   else\n   {\n      \/\/ no saved context yet; ensure we have a place to put it\n      saved.ensureDirectory();\n   }\n\n   \/\/ move all the chunk definitions over to the saved context\n   std::vector<FilePath> children;\n   error = cache.children(&children);\n   if (error)\n   {\n      LOG_ERROR(error);\n      return;\n   }\n   BOOST_FOREACH(const FilePath source, children)\n   {\n      \/\/ compute the target path \n      FilePath target = saved.complete(source.filename());\n\n      if (source.filename() == kNotebookChunkDefFilename) \n      {\n         \/\/ the definitions should be copied (we always want them in both\n         \/\/ contexts)\n         error = target.removeIfExists();\n         if (!error)\n            error = source.copy(target);\n      }\n      else if (source.isDirectory())\n      {\n         \/\/ library folders should be merged and then removed, so we don't\n         \/\/ lose library contents \n         if (source.filename() == kChunkLibDir)\n         {\n            error = mergeLib(source, target);\n            if (!error)\n               error = source.remove();\n         }\n         else\n         {\n            \/\/ the chunk output folders should be moved; destroy the old copy\n            error = target.removeIfExists();\n            if (!error)\n               error = source.move(target);\n         }\n      }\n      else\n      {\n         \/\/ nothing besides the chunks.json and chunk folders should be here,\n         \/\/ so ignore other files\/content\n         continue;\n      }\n\n      if (error)\n         LOG_ERROR(error);\n   }\n}\n\nFilePath unsavedNotebookCache()\n{\n   return module_context::sessionScratchPath().childPath(\"unsaved-notebooks\");\n}\n\nSEXP rs_chunkCacheFolder(SEXP fileSEXP)\n{\n   std::string file = r::sexp::safeAsString(fileSEXP);\n   FilePath cacheFolder = chunkCacheFolder(file, \"\", kSavedCtx);\n   \n   r::sexp::Protect protect;\n   return r::sexp::create(cacheFolder.absolutePath(), &protect);\n}\n\n} \/\/ anonymous namespace\n\nFilePath notebookCacheRoot()\n{ \n   return module_context::sharedScratchPath().childPath(\"notebooks\");\n}\n\nFilePath chunkCacheFolder(const FilePath& path, const std::string& docId,\n      const std::string& nbCtxId)\n{\n   FilePath folder;\n   std::string stem;\n\n   if (path.empty()) \n   {\n      \/\/ the doc hasn't been saved, so keep its chunk output in the scratch\n      \/\/ path\n      folder = unsavedNotebookCache().childPath(docId)\n                                     .childPath(kCacheVersion);\n   }\n   else\n   {\n      std::string id;\n      Error error = notebookPathToId(path, &id);\n      if (error)\n         LOG_ERROR(error);\n      \n      folder = notebookCacheRoot().childPath(id + \"-\" + path.stem())\n                                  .childPath(kCacheVersion)\n                                  .childPath(nbCtxId);\n   }\n\n   return folder;\n}\n\nFilePath chunkCacheFolder(const std::string& docPath, const std::string& docId,\n      const std::string& nbCtxId)\n{\n   return chunkCacheFolder(\n         docPath.empty() ? FilePath() : \n                           module_context::resolveAliasedPath(docPath),\n         docId, nbCtxId);\n}\n\nFilePath chunkCacheFolder(const std::string& docPath, const std::string& docId)\n{\n   return chunkCacheFolder(docPath, docId, notebookCtxId());\n}\n\nError initCache()\n{\n   source_database::events().onDocRenamed.connect(onDocRenamed);\n   source_database::events().onDocRemoved.connect(onDocRemoved);\n   source_database::events().onDocAdded.connect(onDocAdded);\n\n   module_context::events().onSourceEditorFileSaved.connect(onDocSaved);\n\n   RS_REGISTER_CALL_METHOD(rs_chunkCacheFolder, 1);\n\n   module_context::scheduleDelayedWork(boost::posix_time::seconds(30),\n      cleanUnusedCaches, true);\n\n   return Success();\n}\n\n} \/\/ namespace notebook\n} \/\/ namespace rmarkdown\n} \/\/ namespace modules\n} \/\/ namespace session\n} \/\/ namespace rstudio\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"LikelihoodProfiler.h\"\n\n\/\/ from STL\n#include <set>\n\n\/\/ from ROOT\n#include \"TCanvas.h\"\n#include \"TGraph.h\"\n#include \"TH2D.h\" \n#include \"TAxis.h\"\n#include \"TStyle.h\"\n#include \"TColor.h\"\n\n\/\/ from RooFit\n#include \"RooFitResult.h\"\n\n\/\/ from DooCore\n#include <doocore\/io\/MsgStream.h>\n#include <doocore\/io\/Progress.h>\n#include <doocore\/lutils\/lutils.h>\n\n\/\/ from DooFit\n#include \"doofit\/fitter\/AbsFitter.h\"\n#include \"doofit\/toy\/ToyStudyStd\/ToyStudyStd.h\"\n\ndoofit::plotting::profiles::LikelihoodProfiler::LikelihoodProfiler()\n: num_samples_(30)\n{}\n\nstd::vector<double> doofit::plotting::profiles::LikelihoodProfiler::SetSamplePoint(unsigned int step) {\n  using namespace doocore::io;\n\n  std::vector<double> sample_vals;\n  int i(scan_vars_.size() - 1);\n\n  \/\/sdebug << \"step = \" << step << endmsg;\n\n  for (auto var : scan_vars_) {\n    int step_this = step\/std::pow(num_samples_,i);\n    step -= step_this*std::pow(num_samples_,i);\n    --i;\n\n    double val(start_vals_[var->GetName()] + 3*var->getError()*(-1.0 + 2.0\/static_cast<double>(num_samples_)*step_this));\n    var->setVal(val);\n    var->setConstant(true);\n\n    sample_vals.push_back(val);\n    \/\/sdebug << \"  \" << var->GetName() << \" = \" << step_this << \" @ \" << var->getVal() << endmsg;\n  }\n\n  return sample_vals;\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::Scan() {\n  using namespace doocore::io;\n\n  \/\/RooRealVar* parameter_scan = scan_vars_.front();\n\n  \/\/num_samples_                   = 12;\n  unsigned int num_dimensions    = scan_vars_.size();\n  unsigned int num_total_samples = std::pow(num_samples_,num_dimensions);\n  unsigned int step              = 0;\n\n  \/\/ double value_start = parameter_scan->getVal();\n  \/\/ double value_scan  = value_start - 5.0*parameter_scan->getError();\n\n  for (auto var : scan_vars_) {\n    start_vals_[var->GetName()] = var->getVal();\n  }\n\n  Progress p(\"Sampling likelihood\", num_total_samples);\n  while (step < num_total_samples) {\n    \/\/parameter_scan->setVal(value_scan);\n    \/\/parameter_scan->setConstant(true);\n\n    \/\/sinfo << \"PROFILE: \" << value_scan << endmsg;\n\n    std::vector<double> sample_vals(SetSamplePoint(step));\n\n    fitter_->set_shutup(true);\n    fitter_->Fit();  \n\n    fit_results_.push_back(fitter_->fit_result());\n\n    \/\/sinfo << fitter_->NegativeLogLikelihood() << endmsg;\n    \/\/value_scan += 1*parameter_scan->getError();\n    ++step;\n    ++p;\n  }  \n  p.Finish();\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::ReadFitResults(doofit::toy::ToyStudyStd& toy_study) {\n  using namespace doofit::toy;\n  using namespace doocore::io;\n\n  FitResultContainer fit_result_container(toy_study.GetFitResult());\n  const RooFitResult* fit_result(std::get<0>(fit_result_container));\n  \/\/ int i = 0;\n  while (fit_result != nullptr) { \/\/ && i < 10000) {\n    fit_results_.push_back(fit_result);\n\n    fit_result_container = toy_study.GetFitResult();\n    fit_result = std::get<0>(fit_result_container);\n    \/\/ ++i;\n  }\n}\n\nbool doofit::plotting::profiles::LikelihoodProfiler::FitResultOkay(const RooFitResult& fit_result) const {\n  using namespace doocore::io;\n  if (fit_result.covQual() < 2) {\n    return false;\n  } else if (fit_result.statusCodeHistory(0) < 0) {\n    return false;\n  } else {\n    return true;\n  }\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::PlotHandler(const std::string& plot_path) {\n  using namespace doocore::io;\n\n  std::map<std::string, std::vector<double>> val_scan;\n  std::vector<double> val_nll;\n\n  for (auto var : scan_vars_) {\n    RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(fit_results_.front()->constPars().find(var->GetName()));\n    scan_vars_titles_.push_back(var_fixed->GetTitle());\n  }\n\n  \/\/ int i = 0;\n  double min_nll(0.0);\n\n  Progress p(\"Processing read in fit results\", fit_results_.size());\n  for (auto result : fit_results_) {\n    if (FitResultOkay(*result)) {\n      for (auto var : scan_vars_) {\n        RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(result->constPars().find(var->GetName()));\n\n        if (var_fixed == nullptr) {\n          serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot find fixed parameter \" \n               << var->GetName() << \" in fit result!\" << endmsg;\n          throw;\n        }\n\n        val_scan[var->GetName()].push_back(var_fixed->getVal());\n      }\n\n      if (min_nll == 0.0 || min_nll > result->minNll()) {\n        min_nll = result->minNll();\n      }\n      val_nll.push_back(result->minNll());\n\n      ++p;\n    }\n  }\n  p.Finish();\n\n  for (auto &nll : val_nll) {\n    if (nll != 0.0) {\n      nll -= min_nll;\n    }\n  }\n\n  if (val_scan.size() == 1) {\n    doocore::lutils::setStyle();\n    gStyle->SetPadLeftMargin(0.12);\n    gStyle->SetTitleOffset(0.75, \"y\");\n  } else if (val_scan.size() == 2) {\n    doocore::lutils::setStyle(\"2d\");\n    \/\/gStyle->SetNumberContours(999);\n    \/\/gStyle->SetPadRightMargin(0.16);\n    gStyle->SetPadRightMargin(0.06);\n    gStyle->SetTitleOffset(0.75, \"z\");\n  }\n\n  TCanvas c(\"c\", \"c\", 800, 600);\n\n  if (val_scan.size() == 1) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n\n    TGraph graph(val_nll.size(), &val_x[0], &val_nll[0]);\n    graph.Draw(\"AP\");\n    graph.GetXaxis()->SetTitle(scan_vars_titles_.at(0).c_str());\n    graph.GetYaxis()->SetTitle(\"#DeltaLL\");\n    graph.SetMarkerStyle(1);\n    \/\/graph.SetMarkerSize(10);\n    graph.SetMarkerColor(kBlue+3);\n\n    \/\/c.SaveAs(\"profile.pdf\");\n    doocore::lutils::printPlot(&c, \"profile\", plot_path);\n  } else if (val_scan.size() == 2) {\n\n    const std::vector<double>& val_x = val_scan.begin()->second;\n    const std::vector<double>& val_y = val_scan.rbegin()->second;\n\n    auto minmax_x = std::minmax_element(val_x.begin(), val_x.end());\n    auto minmax_y = std::minmax_element(val_y.begin(), val_y.end());\n\n    Progress p_distinct(\"Counting distinct x and y values\", val_x.size()+val_y.size());\n    std::set<double> distinct_x, distinct_y;\n    for (auto x : val_x) {\n      distinct_x.insert(x);\n      ++p_distinct;\n    }\n    for (auto y : val_y) {\n      distinct_y.insert(y);\n      ++p_distinct;\n    }\n    p_distinct.Finish();\n\n    double min_nll(0.0), max_nll(0.0);\n    for (auto nll : val_nll) {\n      if (nll != 0 && (min_nll == 0.0 || nll < min_nll)) {\n        min_nll = nll;\n      }\n      if (nll != 0 && (max_nll == 0.0 || nll > max_nll)) {\n        max_nll = nll;\n      }\n    }\n\n    double min_x = *minmax_x.first  - (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double max_x = *minmax_x.second + (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double min_y = *minmax_y.first  - (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n    double max_y = *minmax_y.second + (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n\n    TH2D histogram(\"histogram\", \"histogram\", distinct_x.size(), min_x, max_x, distinct_y.size(), min_y, max_y);\n\n    \/\/ sdebug << \"histogram x: \" << *minmax_x.first << \" - \" <<  *minmax_x.second << endmsg;\n    \/\/ sdebug << \"histogram y: \" << *minmax_y.first << \" - \" <<  *minmax_y.second << endmsg;\n\n    Progress p_hist(\"Filling 2D profile histogram\", val_nll.size());\n    for (int i=0; i<val_nll.size(); ++i) {\n      \/\/ sdebug << val_x.at(i) << \", \" << val_y.at(i) << \" - \" << val_nll.at(i) << endmsg;\n      \/\/ sdebug << \"Bin: \" << histogram.FindBin(val_x.at(i), val_y.at(i)) << endmsg;\n      \n      int nbin_x, nbin_y, nbin_z;\n      histogram.GetBinXYZ(histogram.FindBin(val_x.at(i), val_y.at(i)), nbin_x, nbin_y, nbin_z);\n\n      \/\/ sdebug << \"Bin center x: \" << histogram.GetXaxis()->GetBinCenter(nbin_x) << endmsg;\n      \/\/ sdebug << \"Bin center y: \" << histogram.GetYaxis()->GetBinCenter(nbin_y) << endmsg;\n\n      histogram.SetBinContent(histogram.FindBin(val_x.at(i), val_y.at(i)), val_nll.at(i));\n      ++p_hist;\n    }\n\n    unsigned int num_interpolated_bins(0);\n    for (int i=1; i<=histogram.GetNbinsX(); ++i) {\n      for (int j=1; j<=histogram.GetNbinsY(); ++j) {\n        if (histogram.GetBinContent(i,j) == 0.0) {\n          int num_interpolation(0);\n          double interpolation(0.0);\n          for (int ii=std::max(i-1,1); ii<std::min(i+1,histogram.GetNbinsX()); ++ii) {\n            for (int jj=std::max(j-1,1); jj<std::min(j+1,histogram.GetNbinsY()); ++jj) {\n              if (histogram.GetBinContent(ii,jj) != 0.0) {\n                \/\/ sdebug << ii << \" - \" << jj << endmsg;\n                interpolation += histogram.GetBinContent(ii,jj);\n                ++num_interpolation;\n              }\n            }\n          }\n\n          interpolation \/= num_interpolation;\n          \/\/ sdebug << \"Bin (\" << i << \",\" << j << \") is zero. Will interpolate with \" <<  num_interpolation << \" bins to \" << interpolation << \".\" << endmsg;\n          histogram.SetBinContent(i,j, interpolation);\n          ++num_interpolated_bins;\n        }\n      }\n    }\n    sinfo << \"LikelihoodProfiler::PlotHandler(...): Number of interpolated bins: \" << num_interpolated_bins << endmsg;\n\n    p_hist.Finish();\n\n    std::vector<double> stops_cl;\n    std::vector<int> colours;\n\n    stops_cl.push_back(0.0);\n    colours.push_back(kGray+2);\n    stops_cl.push_back(2.30\/2.0);\n    colours.push_back(kBlue-8);\n\n    if (max_nll > 6.18\/2.0) {\n      stops_cl.push_back(6.18\/2.0);\n      colours.push_back(kYellow-8);\n    }\n    if (max_nll > 11.8\/2.0) {\n      stops_cl.push_back(11.8\/2.0);\n      colours.push_back(kRed-8);\n    }\n    if (max_nll > 18.4\/2.0) {\n      stops_cl.push_back(18.4\/2.0);\n      colours.push_back(kCyan-6);\n    }\n    \/\/ if (max_nll > 12.50) {\n    \/\/   stops_cl.push_back(12.50);\n    \/\/   colours.push_back(kGreen-5);\n    \/\/ }\n\n    \/\/ const Int_t NRGBs = 6;\n    \/\/ const Int_t NCont = 6;\n    \n    \/\/ Double_t stops[NRGBs] = { 0.00 , 0.50 , 2.00 , 4.50 , 8.00 , 12.5 };\n    \/\/ Double_t red[NRGBs]   = { 0.00 , 0.00 , 0.20 , 1.00 , 1.00 , 1.00 };\n    \/\/ Double_t green[NRGBs] = { 0.00 , 0.00 , 0.20 , 1.00 , 1.00 , 1.00 };\n    \/\/ Double_t blue[NRGBs]  = { 0.20 , 1.00 , 1.00 , 1.00 , 1.00 , 1.00 };\n    \/\/ TColor::CreateGradientColorTable(NRGBs, stops, red, green, blue, NCont);\n    \/\/ gStyle->SetNumberContours(NCont);\n    \/\/ gStyle->SetPaintTextFormat(\".1f\");\n\n\n    gStyle->SetPalette(colours.size(), colours.data());\n    histogram.SetContour(stops_cl.size(), stops_cl.data());\n\n    sinfo << \"LikelihoodProfiler::PlotHandler(): Drawing histogram.\" << endmsg;\n    histogram.Draw(\"CONT1\");\n    histogram.GetZaxis()->SetRangeUser(min_nll, max_nll);\n    histogram.SetXTitle(scan_vars_titles_.at(0).c_str());\n    histogram.SetYTitle(scan_vars_titles_.at(1).c_str());\n    histogram.SetZTitle(\"#DeltaLL\");\n\n    \/\/c.SaveAs(\"profile.pdf\");\n    sinfo << \"LikelihoodProfiler::PlotHandler(): Saving linear histograms to output files.\" << endmsg;\n    doocore::lutils::printPlot(&c, \"profile\", plot_path, true);\n    \/\/ sinfo << \"LikelihoodProfiler::PlotHandler(): Saving logarithmic histograms to output files.\" << endmsg;\n    \/\/ c.SetLogz(true);\n    \/\/ doocore::lutils::printPlot(&c, \"profile_log\", plot_path, true);\n    sinfo << \"LikelihoodProfiler::PlotHandler(): All done.\" << endmsg;\n  } else {\n    serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot (yet) plot 3D likelihood.\" << endmsg;\n    throw;\n  }\n}\n\n\n<commit_msg>LikelihoodProfiler: correct 2D confidence contour levels<commit_after>#include \"LikelihoodProfiler.h\"\n\n\/\/ from STL\n#include <set>\n\n\/\/ from ROOT\n#include \"TCanvas.h\"\n#include \"TGraph.h\"\n#include \"TH2D.h\" \n#include \"TAxis.h\"\n#include \"TStyle.h\"\n#include \"TColor.h\"\n\n\/\/ from RooFit\n#include \"RooFitResult.h\"\n\n\/\/ from DooCore\n#include <doocore\/io\/MsgStream.h>\n#include <doocore\/io\/Progress.h>\n#include <doocore\/lutils\/lutils.h>\n\n\/\/ from DooFit\n#include \"doofit\/fitter\/AbsFitter.h\"\n#include \"doofit\/toy\/ToyStudyStd\/ToyStudyStd.h\"\n\ndoofit::plotting::profiles::LikelihoodProfiler::LikelihoodProfiler()\n: num_samples_(30)\n{}\n\nstd::vector<double> doofit::plotting::profiles::LikelihoodProfiler::SetSamplePoint(unsigned int step) {\n  using namespace doocore::io;\n\n  std::vector<double> sample_vals;\n  int i(scan_vars_.size() - 1);\n\n  \/\/sdebug << \"step = \" << step << endmsg;\n\n  for (auto var : scan_vars_) {\n    int step_this = step\/std::pow(num_samples_,i);\n    step -= step_this*std::pow(num_samples_,i);\n    --i;\n\n    double val(start_vals_[var->GetName()] + 3*var->getError()*(-1.0 + 2.0\/static_cast<double>(num_samples_)*step_this));\n    var->setVal(val);\n    var->setConstant(true);\n\n    sample_vals.push_back(val);\n    \/\/sdebug << \"  \" << var->GetName() << \" = \" << step_this << \" @ \" << var->getVal() << endmsg;\n  }\n\n  return sample_vals;\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::Scan() {\n  using namespace doocore::io;\n\n  \/\/RooRealVar* parameter_scan = scan_vars_.front();\n\n  \/\/num_samples_                   = 12;\n  unsigned int num_dimensions    = scan_vars_.size();\n  unsigned int num_total_samples = std::pow(num_samples_,num_dimensions);\n  unsigned int step              = 0;\n\n  \/\/ double value_start = parameter_scan->getVal();\n  \/\/ double value_scan  = value_start - 5.0*parameter_scan->getError();\n\n  for (auto var : scan_vars_) {\n    start_vals_[var->GetName()] = var->getVal();\n  }\n\n  Progress p(\"Sampling likelihood\", num_total_samples);\n  while (step < num_total_samples) {\n    \/\/parameter_scan->setVal(value_scan);\n    \/\/parameter_scan->setConstant(true);\n\n    \/\/sinfo << \"PROFILE: \" << value_scan << endmsg;\n\n    std::vector<double> sample_vals(SetSamplePoint(step));\n\n    fitter_->set_shutup(true);\n    fitter_->Fit();  \n\n    fit_results_.push_back(fitter_->fit_result());\n\n    \/\/sinfo << fitter_->NegativeLogLikelihood() << endmsg;\n    \/\/value_scan += 1*parameter_scan->getError();\n    ++step;\n    ++p;\n  }  \n  p.Finish();\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::ReadFitResults(doofit::toy::ToyStudyStd& toy_study) {\n  using namespace doofit::toy;\n  using namespace doocore::io;\n\n  FitResultContainer fit_result_container(toy_study.GetFitResult());\n  const RooFitResult* fit_result(std::get<0>(fit_result_container));\n  \/\/ int i = 0;\n  while (fit_result != nullptr) { \/\/ && i < 10000) {\n    fit_results_.push_back(fit_result);\n\n    fit_result_container = toy_study.GetFitResult();\n    fit_result = std::get<0>(fit_result_container);\n    \/\/ ++i;\n  }\n}\n\nbool doofit::plotting::profiles::LikelihoodProfiler::FitResultOkay(const RooFitResult& fit_result) const {\n  using namespace doocore::io;\n  if (fit_result.covQual() < 2) {\n    return false;\n  } else if (fit_result.statusCodeHistory(0) < 0) {\n    return false;\n  } else {\n    return true;\n  }\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::PlotHandler(const std::string& plot_path) {\n  using namespace doocore::io;\n\n  std::map<std::string, std::vector<double>> val_scan;\n  std::vector<double> val_nll;\n\n  for (auto var : scan_vars_) {\n    RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(fit_results_.front()->constPars().find(var->GetName()));\n    scan_vars_titles_.push_back(var_fixed->GetTitle());\n  }\n\n  \/\/ int i = 0;\n  double min_nll(0.0);\n\n  Progress p(\"Processing read in fit results\", fit_results_.size());\n  for (auto result : fit_results_) {\n    if (FitResultOkay(*result)) {\n      for (auto var : scan_vars_) {\n        RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(result->constPars().find(var->GetName()));\n\n        if (var_fixed == nullptr) {\n          serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot find fixed parameter \" \n               << var->GetName() << \" in fit result!\" << endmsg;\n          throw;\n        }\n\n        val_scan[var->GetName()].push_back(var_fixed->getVal());\n      }\n\n      if (min_nll == 0.0 || min_nll > result->minNll()) {\n        min_nll = result->minNll();\n      }\n      val_nll.push_back(result->minNll());\n\n      ++p;\n    }\n  }\n  p.Finish();\n\n  for (auto &nll : val_nll) {\n    if (nll != 0.0) {\n      nll -= min_nll;\n    }\n  }\n\n  if (val_scan.size() == 1) {\n    doocore::lutils::setStyle();\n    gStyle->SetPadLeftMargin(0.12);\n    gStyle->SetTitleOffset(0.75, \"y\");\n  } else if (val_scan.size() == 2) {\n    doocore::lutils::setStyle(\"2d\");\n    \/\/gStyle->SetNumberContours(999);\n    \/\/gStyle->SetPadRightMargin(0.16);\n    gStyle->SetPadRightMargin(0.06);\n    gStyle->SetTitleOffset(0.75, \"z\");\n  }\n\n  TCanvas c(\"c\", \"c\", 800, 600);\n\n  if (val_scan.size() == 1) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n\n    TGraph graph(val_nll.size(), &val_x[0], &val_nll[0]);\n    graph.Draw(\"AP\");\n    graph.GetXaxis()->SetTitle(scan_vars_titles_.at(0).c_str());\n    graph.GetYaxis()->SetTitle(\"#DeltaLL\");\n    graph.SetMarkerStyle(1);\n    \/\/graph.SetMarkerSize(10);\n    graph.SetMarkerColor(kBlue+3);\n\n    \/\/c.SaveAs(\"profile.pdf\");\n    doocore::lutils::printPlot(&c, \"profile\", plot_path);\n  } else if (val_scan.size() == 2) {\n\n    const std::vector<double>& val_x = val_scan.begin()->second;\n    const std::vector<double>& val_y = val_scan.rbegin()->second;\n\n    auto minmax_x = std::minmax_element(val_x.begin(), val_x.end());\n    auto minmax_y = std::minmax_element(val_y.begin(), val_y.end());\n\n    Progress p_distinct(\"Counting distinct x and y values\", val_x.size()+val_y.size());\n    std::set<double> distinct_x, distinct_y;\n    for (auto x : val_x) {\n      distinct_x.insert(x);\n      ++p_distinct;\n    }\n    for (auto y : val_y) {\n      distinct_y.insert(y);\n      ++p_distinct;\n    }\n    p_distinct.Finish();\n\n    double min_nll(0.0), max_nll(0.0);\n    for (auto nll : val_nll) {\n      if (nll != 0 && (min_nll == 0.0 || nll < min_nll)) {\n        min_nll = nll;\n      }\n      if (nll != 0 && (max_nll == 0.0 || nll > max_nll)) {\n        max_nll = nll;\n      }\n    }\n\n    double min_x = *minmax_x.first  - (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double max_x = *minmax_x.second + (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double min_y = *minmax_y.first  - (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n    double max_y = *minmax_y.second + (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n\n    TH2D histogram(\"histogram\", \"histogram\", distinct_x.size(), min_x, max_x, distinct_y.size(), min_y, max_y);\n\n    \/\/ sdebug << \"histogram x: \" << *minmax_x.first << \" - \" <<  *minmax_x.second << endmsg;\n    \/\/ sdebug << \"histogram y: \" << *minmax_y.first << \" - \" <<  *minmax_y.second << endmsg;\n\n    Progress p_hist(\"Filling 2D profile histogram\", val_nll.size());\n    for (int i=0; i<val_nll.size(); ++i) {\n      \/\/ sdebug << val_x.at(i) << \", \" << val_y.at(i) << \" - \" << val_nll.at(i) << endmsg;\n      \/\/ sdebug << \"Bin: \" << histogram.FindBin(val_x.at(i), val_y.at(i)) << endmsg;\n      \n      int nbin_x, nbin_y, nbin_z;\n      histogram.GetBinXYZ(histogram.FindBin(val_x.at(i), val_y.at(i)), nbin_x, nbin_y, nbin_z);\n\n      \/\/ sdebug << \"Bin center x: \" << histogram.GetXaxis()->GetBinCenter(nbin_x) << endmsg;\n      \/\/ sdebug << \"Bin center y: \" << histogram.GetYaxis()->GetBinCenter(nbin_y) << endmsg;\n\n      histogram.SetBinContent(histogram.FindBin(val_x.at(i), val_y.at(i)), val_nll.at(i));\n      ++p_hist;\n    }\n\n    unsigned int num_interpolated_bins(0);\n    for (int i=1; i<=histogram.GetNbinsX(); ++i) {\n      for (int j=1; j<=histogram.GetNbinsY(); ++j) {\n        if (histogram.GetBinContent(i,j) == 0.0) {\n          int num_interpolation(0);\n          double interpolation(0.0);\n          for (int ii=std::max(i-1,1); ii<std::min(i+1,histogram.GetNbinsX()); ++ii) {\n            for (int jj=std::max(j-1,1); jj<std::min(j+1,histogram.GetNbinsY()); ++jj) {\n              if (histogram.GetBinContent(ii,jj) != 0.0) {\n                \/\/ sdebug << ii << \" - \" << jj << endmsg;\n                interpolation += histogram.GetBinContent(ii,jj);\n                ++num_interpolation;\n              }\n            }\n          }\n\n          interpolation \/= num_interpolation;\n          \/\/ sdebug << \"Bin (\" << i << \",\" << j << \") is zero. Will interpolate with \" <<  num_interpolation << \" bins to \" << interpolation << \".\" << endmsg;\n          histogram.SetBinContent(i,j, interpolation);\n          ++num_interpolated_bins;\n        }\n      }\n    }\n    sinfo << \"LikelihoodProfiler::PlotHandler(...): Number of interpolated bins: \" << num_interpolated_bins << endmsg;\n\n    p_hist.Finish();\n\n    std::vector<double> stops_cl;\n    std::vector<int> colours;\n\n    \/\/ 2D limits from Numerical Recipies Third Edition Sec 15.6 (p. 815)\n\n    stops_cl.push_back(0.0);\n    colours.push_back(kGray+2);\n    stops_cl.push_back(2.30\/2.0);\n    colours.push_back(kBlue-8);\n\n    if (max_nll > 6.18\/2.0) {\n      stops_cl.push_back(6.18\/2.0);\n      colours.push_back(kYellow-8);\n    }\n    if (max_nll > 11.8\/2.0) {\n      stops_cl.push_back(11.8\/2.0);\n      colours.push_back(kRed-8);\n    }\n    if (max_nll > 18.4\/2.0) {\n      stops_cl.push_back(18.4\/2.0);\n      colours.push_back(kCyan-6);\n    }\n    \/\/ if (max_nll > 12.50) {\n    \/\/   stops_cl.push_back(12.50);\n    \/\/   colours.push_back(kGreen-5);\n    \/\/ }\n\n    \/\/ const Int_t NRGBs = 6;\n    \/\/ const Int_t NCont = 6;\n    \n    \/\/ Double_t stops[NRGBs] = { 0.00 , 0.50 , 2.00 , 4.50 , 8.00 , 12.5 };\n    \/\/ Double_t red[NRGBs]   = { 0.00 , 0.00 , 0.20 , 1.00 , 1.00 , 1.00 };\n    \/\/ Double_t green[NRGBs] = { 0.00 , 0.00 , 0.20 , 1.00 , 1.00 , 1.00 };\n    \/\/ Double_t blue[NRGBs]  = { 0.20 , 1.00 , 1.00 , 1.00 , 1.00 , 1.00 };\n    \/\/ TColor::CreateGradientColorTable(NRGBs, stops, red, green, blue, NCont);\n    \/\/ gStyle->SetNumberContours(NCont);\n    \/\/ gStyle->SetPaintTextFormat(\".1f\");\n\n\n    gStyle->SetPalette(colours.size(), colours.data());\n    histogram.SetContour(stops_cl.size(), stops_cl.data());\n\n    sinfo << \"LikelihoodProfiler::PlotHandler(): Drawing histogram.\" << endmsg;\n    histogram.Draw(\"CONT1\");\n    histogram.GetZaxis()->SetRangeUser(min_nll, max_nll);\n    histogram.SetXTitle(scan_vars_titles_.at(0).c_str());\n    histogram.SetYTitle(scan_vars_titles_.at(1).c_str());\n    histogram.SetZTitle(\"#DeltaLL\");\n\n    \/\/c.SaveAs(\"profile.pdf\");\n    sinfo << \"LikelihoodProfiler::PlotHandler(): Saving linear histograms to output files.\" << endmsg;\n    doocore::lutils::printPlot(&c, \"profile\", plot_path, true);\n    \/\/ sinfo << \"LikelihoodProfiler::PlotHandler(): Saving logarithmic histograms to output files.\" << endmsg;\n    \/\/ c.SetLogz(true);\n    \/\/ doocore::lutils::printPlot(&c, \"profile_log\", plot_path, true);\n    sinfo << \"LikelihoodProfiler::PlotHandler(): All done.\" << endmsg;\n  } else {\n    serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot (yet) plot 3D likelihood.\" << endmsg;\n    throw;\n  }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"LikelihoodProfiler.h\"\n\n\/\/ from STL\n#include <set>\n\n\/\/ from ROOT\n#include \"TCanvas.h\"\n#include \"TGraph.h\"\n#include \"TH2D.h\" \n#include \"TAxis.h\"\n\n\/\/ from RooFit\n#include \"RooFitResult.h\"\n\n\/\/ from DooCore\n#include <doocore\/io\/MsgStream.h>\n#include <doocore\/io\/Progress.h>\n#include <doocore\/lutils\/lutils.h>\n\n\/\/ from DooFit\n#include \"doofit\/fitter\/AbsFitter.h\"\n#include \"doofit\/toy\/ToyStudyStd\/ToyStudyStd.h\"\n\ndoofit::plotting::profiles::LikelihoodProfiler::LikelihoodProfiler()\n: num_samples_(30)\n{}\n\nstd::vector<double> doofit::plotting::profiles::LikelihoodProfiler::SetSamplePoint(unsigned int step) {\n  using namespace doocore::io;\n\n  std::vector<double> sample_vals;\n  int i(scan_vars_.size() - 1);\n\n  \/\/sdebug << \"step = \" << step << endmsg;\n\n  for (auto var : scan_vars_) {\n    int step_this = step\/std::pow(num_samples_,i);\n    step -= step_this*std::pow(num_samples_,i);\n    --i;\n\n    double val(start_vals_[var->GetName()] + 3*var->getError()*(-1.0 + 2.0\/static_cast<double>(num_samples_)*step_this));\n    var->setVal(val);\n    var->setConstant(true);\n\n    sample_vals.push_back(val);\n    \/\/sdebug << \"  \" << var->GetName() << \" = \" << step_this << \" @ \" << var->getVal() << endmsg;\n  }\n\n  return sample_vals;\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::Scan() {\n  using namespace doocore::io;\n\n  \/\/RooRealVar* parameter_scan = scan_vars_.front();\n\n  \/\/num_samples_                   = 12;\n  unsigned int num_dimensions    = scan_vars_.size();\n  unsigned int num_total_samples = std::pow(num_samples_,num_dimensions);\n  unsigned int step              = 0;\n\n  \/\/ double value_start = parameter_scan->getVal();\n  \/\/ double value_scan  = value_start - 5.0*parameter_scan->getError();\n\n  for (auto var : scan_vars_) {\n    start_vals_[var->GetName()] = var->getVal();\n  }\n\n  Progress p(\"Sampling likelihood\", num_total_samples);\n  while (step < num_total_samples) {\n    \/\/parameter_scan->setVal(value_scan);\n    \/\/parameter_scan->setConstant(true);\n\n    \/\/sinfo << \"PROFILE: \" << value_scan << endmsg;\n\n    std::vector<double> sample_vals(SetSamplePoint(step));\n\n    fitter_->set_shutup(true);\n    fitter_->Fit();  \n\n    fit_results_.push_back(fitter_->fit_result());\n\n    \/\/sinfo << fitter_->NegativeLogLikelihood() << endmsg;\n    \/\/value_scan += 1*parameter_scan->getError();\n    ++step;\n    ++p;\n  }  \n  p.Finish();\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::ReadFitResults(doofit::toy::ToyStudyStd& toy_study) {\n  using namespace doofit::toy;\n\n  FitResultContainer fit_result_container(toy_study.GetFitResult());\n  const RooFitResult* fit_result(std::get<0>(fit_result_container));\n\n  while (fit_result != nullptr) {\n    fit_results_.push_back(fit_result);\n\n    fit_result_container = toy_study.GetFitResult();\n    fit_result = std::get<0>(fit_result_container);\n  }\n}\n\nbool doofit::plotting::profiles::LikelihoodProfiler::FitResultOkay(const RooFitResult& fit_result) const {\n  using namespace doocore::io;\n  if (fit_result.covQual() < 2) {\n    return false;\n  } else if (fit_result.statusCodeHistory(0) < 0) {\n    return false;\n  } else {\n    return true;\n  }\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::PlotHandler(const std::string& plot_path) {\n  using namespace doocore::io;\n\n  std::map<std::string, std::vector<double>> val_scan;\n  std::vector<double> val_nll;\n\n  doocore::lutils::setStyle(\"2d\");\n\n  for (auto var : scan_vars_) {\n    RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(fit_results_.front()->constPars().find(var->GetName()));\n    scan_vars_titles_.push_back(var_fixed->GetTitle());\n  }\n\n  for (auto result : fit_results_) {\n    if (FitResultOkay(*result)) {\n      for (auto var : scan_vars_) {\n        RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(result->constPars().find(var->GetName()));\n\n        if (var_fixed == nullptr) {\n          serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot find fixed parameter \" \n               << var->GetName() << \" in fit result!\" << endmsg;\n          throw;\n        }\n\n        val_scan[var->GetName()].push_back(var_fixed->getVal());\n      }\n\n      val_nll.push_back(result->minNll());\n    }\n  }\n\n  TCanvas c(\"c\", \"c\", 800, 600);\n\n  if (val_scan.size() == 1) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n\n    TGraph g(val_nll.size(), &val_x[0], &val_nll[0]);\n    g.Draw(\"AP\");\n    c.SaveAs(\"profile.pdf\");\n  } else if (val_scan.size() == 2) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n    const std::vector<double>& val_y = val_scan.rbegin()->second;\n\n    auto minmax_x = std::minmax_element(val_x.begin(), val_x.end());\n    auto minmax_y = std::minmax_element(val_y.begin(), val_y.end());\n\n    std::set<double> distinct_x, distinct_y;\n    for (auto x : val_x) {\n      distinct_x.insert(x);\n    }\n    for (auto y : val_y) {\n      distinct_y.insert(y);\n    }\n\n    double min_nll(0.0), max_nll(0.0);\n    for (auto nll : val_nll) {\n      if (nll != 0 && (min_nll == 0.0 || nll < min_nll)) {\n        min_nll = nll;\n      }\n      if (nll != 0 && (max_nll == 0.0 || nll > max_nll)) {\n        max_nll = nll;\n      }\n    }\n\n    double min_x = *minmax_x.first  - (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double max_x = *minmax_x.second + (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double min_y = *minmax_y.first  - (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n    double max_y = *minmax_y.second + (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n\n    TH2D histogram(\"histogram\", \"histogram\", distinct_x.size(), min_x, max_x, distinct_y.size(), min_y, max_y);\n\n    \/\/ sdebug << \"histogram x: \" << *minmax_x.first << \" - \" <<  *minmax_x.second << endmsg;\n    \/\/ sdebug << \"histogram y: \" << *minmax_y.first << \" - \" <<  *minmax_y.second << endmsg;\n\n    for (int i=0; i<val_nll.size(); ++i) {\n      \/\/ sdebug << val_x.at(i) << \", \" << val_y.at(i) << \" - \" << val_nll.at(i) << endmsg;\n      \/\/ sdebug << \"Bin: \" << histogram.FindBin(val_x.at(i), val_y.at(i)) << endmsg;\n      \n      int nbin_x, nbin_y, nbin_z;\n      histogram.GetBinXYZ(histogram.FindBin(val_x.at(i), val_y.at(i)), nbin_x, nbin_y, nbin_z);\n\n      \/\/ sdebug << \"Bin center x: \" << histogram.GetXaxis()->GetBinCenter(nbin_x) << endmsg;\n      \/\/ sdebug << \"Bin center y: \" << histogram.GetYaxis()->GetBinCenter(nbin_y) << endmsg;\n\n      histogram.SetBinContent(histogram.FindBin(val_x.at(i), val_y.at(i)), val_nll.at(i));\n    }\n\n    histogram.Draw(\"COLZ\");\n    histogram.GetZaxis()->SetRangeUser(min_nll, max_nll);\n    histogram.SetXTitle(scan_vars_titles_.at(0).c_str());\n    histogram.SetYTitle(scan_vars_titles_.at(1).c_str());\n\n    c.SaveAs(\"profile.pdf\");\n  } else {\n    serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot (yet) plot 3D likelihood.\" << endmsg;\n    throw;\n  }\n\n  \n}\n\n\n<commit_msg>LikelihoodProfiler: plotting improvements<commit_after>#include \"LikelihoodProfiler.h\"\n\n\/\/ from STL\n#include <set>\n\n\/\/ from ROOT\n#include \"TCanvas.h\"\n#include \"TGraph.h\"\n#include \"TH2D.h\" \n#include \"TAxis.h\"\n\n\/\/ from RooFit\n#include \"RooFitResult.h\"\n\n\/\/ from DooCore\n#include <doocore\/io\/MsgStream.h>\n#include <doocore\/io\/Progress.h>\n#include <doocore\/lutils\/lutils.h>\n\n\/\/ from DooFit\n#include \"doofit\/fitter\/AbsFitter.h\"\n#include \"doofit\/toy\/ToyStudyStd\/ToyStudyStd.h\"\n\ndoofit::plotting::profiles::LikelihoodProfiler::LikelihoodProfiler()\n: num_samples_(30)\n{}\n\nstd::vector<double> doofit::plotting::profiles::LikelihoodProfiler::SetSamplePoint(unsigned int step) {\n  using namespace doocore::io;\n\n  std::vector<double> sample_vals;\n  int i(scan_vars_.size() - 1);\n\n  \/\/sdebug << \"step = \" << step << endmsg;\n\n  for (auto var : scan_vars_) {\n    int step_this = step\/std::pow(num_samples_,i);\n    step -= step_this*std::pow(num_samples_,i);\n    --i;\n\n    double val(start_vals_[var->GetName()] + 3*var->getError()*(-1.0 + 2.0\/static_cast<double>(num_samples_)*step_this));\n    var->setVal(val);\n    var->setConstant(true);\n\n    sample_vals.push_back(val);\n    \/\/sdebug << \"  \" << var->GetName() << \" = \" << step_this << \" @ \" << var->getVal() << endmsg;\n  }\n\n  return sample_vals;\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::Scan() {\n  using namespace doocore::io;\n\n  \/\/RooRealVar* parameter_scan = scan_vars_.front();\n\n  \/\/num_samples_                   = 12;\n  unsigned int num_dimensions    = scan_vars_.size();\n  unsigned int num_total_samples = std::pow(num_samples_,num_dimensions);\n  unsigned int step              = 0;\n\n  \/\/ double value_start = parameter_scan->getVal();\n  \/\/ double value_scan  = value_start - 5.0*parameter_scan->getError();\n\n  for (auto var : scan_vars_) {\n    start_vals_[var->GetName()] = var->getVal();\n  }\n\n  Progress p(\"Sampling likelihood\", num_total_samples);\n  while (step < num_total_samples) {\n    \/\/parameter_scan->setVal(value_scan);\n    \/\/parameter_scan->setConstant(true);\n\n    \/\/sinfo << \"PROFILE: \" << value_scan << endmsg;\n\n    std::vector<double> sample_vals(SetSamplePoint(step));\n\n    fitter_->set_shutup(true);\n    fitter_->Fit();  \n\n    fit_results_.push_back(fitter_->fit_result());\n\n    \/\/sinfo << fitter_->NegativeLogLikelihood() << endmsg;\n    \/\/value_scan += 1*parameter_scan->getError();\n    ++step;\n    ++p;\n  }  \n  p.Finish();\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::ReadFitResults(doofit::toy::ToyStudyStd& toy_study) {\n  using namespace doofit::toy;\n\n  FitResultContainer fit_result_container(toy_study.GetFitResult());\n  const RooFitResult* fit_result(std::get<0>(fit_result_container));\n\n  while (fit_result != nullptr) {\n    fit_results_.push_back(fit_result);\n\n    fit_result_container = toy_study.GetFitResult();\n    fit_result = std::get<0>(fit_result_container);\n  }\n}\n\nbool doofit::plotting::profiles::LikelihoodProfiler::FitResultOkay(const RooFitResult& fit_result) const {\n  using namespace doocore::io;\n  if (fit_result.covQual() < 2) {\n    return false;\n  } else if (fit_result.statusCodeHistory(0) < 0) {\n    return false;\n  } else {\n    return true;\n  }\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::PlotHandler(const std::string& plot_path) {\n  using namespace doocore::io;\n\n  std::map<std::string, std::vector<double>> val_scan;\n  std::vector<double> val_nll;\n\n  doocore::lutils::setStyle(\"2d\");\n\n  for (auto var : scan_vars_) {\n    RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(fit_results_.front()->constPars().find(var->GetName()));\n    scan_vars_titles_.push_back(var_fixed->GetTitle());\n  }\n\n  double min_nll(0.0);\n  for (auto result : fit_results_) {\n    if (FitResultOkay(*result)) {\n      for (auto var : scan_vars_) {\n        RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(result->constPars().find(var->GetName()));\n\n        if (var_fixed == nullptr) {\n          serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot find fixed parameter \" \n               << var->GetName() << \" in fit result!\" << endmsg;\n          throw;\n        }\n\n        val_scan[var->GetName()].push_back(var_fixed->getVal());\n      }\n\n      if (min_nll == 0.0 || min_nll > result->minNll()) {\n        min_nll = result->minNll();\n      }\n      val_nll.push_back(result->minNll());\n    }\n  }\n\n  for (auto &nll : val_nll) {\n    if (nll != 0.0) {\n      nll -= min_nll;\n    }\n  }\n\n  TCanvas c(\"c\", \"c\", 800, 600);\n\n  if (val_scan.size() == 1) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n\n    TGraph graph(val_nll.size(), &val_x[0], &val_nll[0]);\n    graph.Draw(\"AP\");\n    graph.GetXaxis()->SetTitle(scan_vars_titles_.at(0).c_str());\n    graph.GetYaxis()->SetTitle(\"NLL\");\n    \/\/c.SaveAs(\"profile.pdf\");\n    doocore::lutils::printPlot(&c, \"profile\", plot_path);\n  } else if (val_scan.size() == 2) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n    const std::vector<double>& val_y = val_scan.rbegin()->second;\n\n    auto minmax_x = std::minmax_element(val_x.begin(), val_x.end());\n    auto minmax_y = std::minmax_element(val_y.begin(), val_y.end());\n\n    std::set<double> distinct_x, distinct_y;\n    for (auto x : val_x) {\n      distinct_x.insert(x);\n    }\n    for (auto y : val_y) {\n      distinct_y.insert(y);\n    }\n\n    double min_nll(0.0), max_nll(0.0);\n    for (auto nll : val_nll) {\n      if (nll != 0 && (min_nll == 0.0 || nll < min_nll)) {\n        min_nll = nll;\n      }\n      if (nll != 0 && (max_nll == 0.0 || nll > max_nll)) {\n        max_nll = nll;\n      }\n    }\n\n    double min_x = *minmax_x.first  - (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double max_x = *minmax_x.second + (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double min_y = *minmax_y.first  - (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n    double max_y = *minmax_y.second + (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n\n    TH2D histogram(\"histogram\", \"histogram\", distinct_x.size(), min_x, max_x, distinct_y.size(), min_y, max_y);\n\n    \/\/ sdebug << \"histogram x: \" << *minmax_x.first << \" - \" <<  *minmax_x.second << endmsg;\n    \/\/ sdebug << \"histogram y: \" << *minmax_y.first << \" - \" <<  *minmax_y.second << endmsg;\n\n    for (int i=0; i<val_nll.size(); ++i) {\n      \/\/ sdebug << val_x.at(i) << \", \" << val_y.at(i) << \" - \" << val_nll.at(i) << endmsg;\n      \/\/ sdebug << \"Bin: \" << histogram.FindBin(val_x.at(i), val_y.at(i)) << endmsg;\n      \n      int nbin_x, nbin_y, nbin_z;\n      histogram.GetBinXYZ(histogram.FindBin(val_x.at(i), val_y.at(i)), nbin_x, nbin_y, nbin_z);\n\n      \/\/ sdebug << \"Bin center x: \" << histogram.GetXaxis()->GetBinCenter(nbin_x) << endmsg;\n      \/\/ sdebug << \"Bin center y: \" << histogram.GetYaxis()->GetBinCenter(nbin_y) << endmsg;\n\n      histogram.SetBinContent(histogram.FindBin(val_x.at(i), val_y.at(i)), val_nll.at(i));\n    }\n\n    histogram.Draw(\"COLZ\");\n    histogram.GetZaxis()->SetRangeUser(min_nll, max_nll);\n    histogram.SetXTitle(scan_vars_titles_.at(0).c_str());\n    histogram.SetYTitle(scan_vars_titles_.at(1).c_str());\n    histogram.SetZTitle(\"#DeltaLL\");\n\n    \/\/c.SaveAs(\"profile.pdf\");\n    doocore::lutils::printPlot(&c, \"profile\", plot_path);\n  } else {\n    serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot (yet) plot 3D likelihood.\" << endmsg;\n    throw;\n  }\n\n  \n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"iCubProprioception\/BatchCADSuperimposer.h\"\n\n#include <exception>\n#include <utility>\n\n#include <iCub\/ctrl\/math.h>\n#include <yarp\/math\/Math.h>\n#include <yarp\/os\/LogStream.h>\n\nusing namespace yarp::dev;\nusing namespace yarp::math;\nusing namespace yarp::os;\nusing namespace yarp::sig;\nusing namespace iCub::ctrl;\nusing namespace iCub::iKin;\n\n\nBatchCADSuperimposer::BatchCADSuperimposer(const ConstString& project_name, const ConstString& robot, const ConstString& camera,\n                                           const SuperImpose::ObjFileMap& cad_hand, const ConstString& shader_path) :\nCADSuperimposer(project_name + \"\/BatchCADSuperimposer\", robot, camera, cad_hand, shader_path)\n{\n    yInfo() << log_ID_ << \"Invoked BatchCADSuperimposer (derived class) ctor...\";\n\n\n    \/* Port for the external pose *\/\n    if(!inport_pose_ext_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/pose:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for external pose!\";\n        throw std::runtime_error(\"Cannot open input port for external pose!\");\n    }\n    \n\n    \/* Port for the head encoders *\/\n    if(!inport_head_enc_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/head:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for head encoders!\";\n        throw std::runtime_error(\"Cannot open input port for head encoders!\");\n    }\n\n\n    \/* Port for the right arm encoders *\/\n    if(!inport_right_arm_enc_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/right_arm:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for right arm encoders!\";\n        throw std::runtime_error(\"Cannot open input port for right arm encoders!\");\n    }\n\n\n    \/* Port for the torso encoders *\/\n    if(!inport_torso_enc_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/torso:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for torso encoders!\";\n        throw std::runtime_error(\"Cannot open input port for torso encoders!\");\n    }\n\n\n    \/* Port for the right hand analogs *\/\n    if(!inport_right_hand_analogs_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/right_analogs:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for right hand analogs!\";\n        throw std::runtime_error(\"Cannot open input port for right hand analogs!\");\n    }\n\n\n    \/* Initialize right arm interface *\/\n    yInfo() << log_ID_ << \"Setting right arm interface.\";\n\n    right_arm_ = iCubArm(\"right\");\n\n    right_arm_.setAllConstraints(false);\n    right_arm_.releaseLink(0);\n    right_arm_.releaseLink(1);\n    right_arm_.releaseLink(2);\n\n\n    yInfo() << log_ID_ << \"...BatchCADSuperimposer ctor completed!\";\n}\n\n\nBatchCADSuperimposer::~BatchCADSuperimposer() noexcept { }\n\n\nvoid BatchCADSuperimposer::threadRelease()\n{\n    if (!inport_pose_ext_.isClosed())           inport_pose_ext_.close();\n    if (!inport_head_enc_.isClosed())           inport_head_enc_.close();\n    if (!inport_torso_enc_.isClosed())          inport_torso_enc_.close();\n    if (!inport_right_arm_enc_.isClosed())      inport_right_arm_enc_.close();\n    if (!inport_right_hand_analogs_.isClosed()) inport_right_hand_analogs_.close();\n\n    CADSuperimposer::threadRelease();\n}\n\n\nVector BatchCADSuperimposer::getEndEffectorPose()\n{\n    Vector* estimates_mean = inport_pose_ext_.read(synch_);\n\n    if (estimates_mean        != YARP_NULLPTR) ext_pose_copy_ = *estimates_mean;\n    if (ext_pose_copy_.size() == 0)            ext_pose_copy_ = *(inport_pose_ext_.read(true));\n\n    return ext_pose_copy_;\n}\n\n\nVector BatchCADSuperimposer::getHeadEncoders()\n{\n    return *(inport_head_enc_.read(true));\n}\n\n\nVector BatchCADSuperimposer::getRightArmEncoders()\n{\n    return *(inport_right_arm_enc_.read(true));\n}\n\n\n#if ICP_USE_ANALOGS == 1\nVector BatchCADSuperimposer::getRightHandAnalogs()\n{\n    return *(inport_right_hand_analogs_.read(true));\n}\n#endif\n\n\nVector BatchCADSuperimposer::getTorsoEncoders()\n{\n    Vector enc_torso = *(inport_torso_enc_.read(true));\n\n    std::swap(enc_torso(0), enc_torso(2));\n\n    return enc_torso;\n}\n\n\nvoid BatchCADSuperimposer::getExtraObjPoseMap(SuperImpose::ObjPoseMap& hand_pose)\n{\n    if (view_forearm_)\n    {\n        SuperImpose::ObjPose pose;\n\n        right_arm_.setAng(CTRL_DEG2RAD * readRootToEE());\n\n        Matrix H_forearm = right_arm_.getH(7, true);\n\n        Vector j_x = H_forearm.getCol(3).subVector(0, 2);\n        Vector j_o = dcm2axis(H_forearm);\n\n        pose.assign(j_x.data(), j_x.data()+3);\n        pose.insert(pose.end(), j_o.data(), j_o.data()+4);\n\n        hand_pose.emplace(\"forearm\", pose);\n    }\n}\n\n\nVector BatchCADSuperimposer::readRootToEE()\n{\n    Vector enc_arm = getRightArmEncoders();\n    \n    Vector root_ee_enc(10);\n    \n    root_ee_enc.setSubvector(0, getTorsoEncoders());\n    \n    for (size_t i = 0; i < 7; ++i)\n        root_ee_enc(i+3) = enc_arm(i);\n    \n    return root_ee_enc;\n}\n\n\nbool BatchCADSuperimposer::sync_input(const bool status)\n{\n    synch_ = status;\n\n    return true;\n}\n\n\nbool BatchCADSuperimposer::render_extra_mesh(const bool status)\n{\n    view_forearm_ = status;\n\n    return true;\n}\n<commit_msg>Clean up code<commit_after>#include \"iCubProprioception\/BatchCADSuperimposer.h\"\n\n#include <exception>\n#include <utility>\n\n#include <iCub\/ctrl\/math.h>\n#include <yarp\/math\/Math.h>\n#include <yarp\/os\/LogStream.h>\n\nusing namespace yarp::dev;\nusing namespace yarp::math;\nusing namespace yarp::os;\nusing namespace yarp::sig;\nusing namespace iCub::ctrl;\nusing namespace iCub::iKin;\n\n\nBatchCADSuperimposer::BatchCADSuperimposer(const ConstString& project_name, const ConstString& robot, const ConstString& camera,\n                                           const SuperImpose::ObjFileMap& cad_hand, const ConstString& shader_path) :\n    CADSuperimposer(project_name + \"\/BatchCADSuperimposer\", robot, camera, cad_hand, shader_path)\n{\n    yInfo() << log_ID_ << \"Invoked BatchCADSuperimposer (derived class) ctor...\";\n\n\n    \/* Port for the external pose *\/\n    if(!inport_pose_ext_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/pose:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for external pose!\";\n        throw std::runtime_error(\"Cannot open input port for external pose!\");\n    }\n    \n\n    \/* Port for the head encoders *\/\n    if(!inport_head_enc_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/head:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for head encoders!\";\n        throw std::runtime_error(\"Cannot open input port for head encoders!\");\n    }\n\n\n    \/* Port for the right arm encoders *\/\n    if(!inport_right_arm_enc_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/right_arm:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for right arm encoders!\";\n        throw std::runtime_error(\"Cannot open input port for right arm encoders!\");\n    }\n\n\n    \/* Port for the torso encoders *\/\n    if(!inport_torso_enc_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/torso:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for torso encoders!\";\n        throw std::runtime_error(\"Cannot open input port for torso encoders!\");\n    }\n\n\n    \/* Port for the right hand analogs *\/\n    if(!inport_right_hand_analogs_.open(\"\/\" + ID_ + \"\/\" + camera_ + \"\/right_analogs:i\"))\n    {\n        yError() << log_ID_ << \"Cannot open input port for right hand analogs!\";\n        throw std::runtime_error(\"Cannot open input port for right hand analogs!\");\n    }\n\n\n    \/* Initialize right arm interface *\/\n    yInfo() << log_ID_ << \"Setting right arm interface.\";\n\n    right_arm_ = iCubArm(\"right\");\n\n    right_arm_.setAllConstraints(false);\n    right_arm_.releaseLink(0);\n    right_arm_.releaseLink(1);\n    right_arm_.releaseLink(2);\n\n\n    yInfo() << log_ID_ << \"...BatchCADSuperimposer ctor completed!\";\n}\n\n\nBatchCADSuperimposer::~BatchCADSuperimposer() noexcept { }\n\n\nvoid BatchCADSuperimposer::threadRelease()\n{\n    if (!inport_pose_ext_.isClosed())           inport_pose_ext_.close();\n    if (!inport_head_enc_.isClosed())           inport_head_enc_.close();\n    if (!inport_torso_enc_.isClosed())          inport_torso_enc_.close();\n    if (!inport_right_arm_enc_.isClosed())      inport_right_arm_enc_.close();\n    if (!inport_right_hand_analogs_.isClosed()) inport_right_hand_analogs_.close();\n\n    CADSuperimposer::threadRelease();\n}\n\n\nVector BatchCADSuperimposer::getEndEffectorPose()\n{\n    Vector* estimates_mean = inport_pose_ext_.read(synch_);\n\n    if (estimates_mean        != YARP_NULLPTR) ext_pose_copy_ = *estimates_mean;\n    if (ext_pose_copy_.size() == 0)            ext_pose_copy_ = *(inport_pose_ext_.read(true));\n\n    return ext_pose_copy_;\n}\n\n\nVector BatchCADSuperimposer::getHeadEncoders()\n{\n    return *(inport_head_enc_.read(true));\n}\n\n\nVector BatchCADSuperimposer::getRightArmEncoders()\n{\n    return *(inport_right_arm_enc_.read(true));\n}\n\n\n#if ICP_USE_ANALOGS == 1\nVector BatchCADSuperimposer::getRightHandAnalogs()\n{\n    return *(inport_right_hand_analogs_.read(true));\n}\n#endif\n\n\nVector BatchCADSuperimposer::getTorsoEncoders()\n{\n    Vector enc_torso = *(inport_torso_enc_.read(true));\n\n    std::swap(enc_torso(0), enc_torso(2));\n\n    return enc_torso;\n}\n\n\nvoid BatchCADSuperimposer::getExtraObjPoseMap(SuperImpose::ObjPoseMap& hand_pose)\n{\n    if (view_forearm_)\n    {\n        SuperImpose::ObjPose pose;\n\n        right_arm_.setAng(CTRL_DEG2RAD * readRootToEE());\n\n        Matrix H_forearm = right_arm_.getH(7, true);\n\n        Vector j_x = H_forearm.getCol(3).subVector(0, 2);\n        Vector j_o = dcm2axis(H_forearm);\n\n        pose.assign(j_x.data(), j_x.data()+3);\n        pose.insert(pose.end(), j_o.data(), j_o.data()+4);\n\n        hand_pose.emplace(\"forearm\", pose);\n    }\n}\n\n\nVector BatchCADSuperimposer::readRootToEE()\n{\n    Vector enc_arm = getRightArmEncoders();\n    \n    Vector root_ee_enc(10);\n    \n    root_ee_enc.setSubvector(0, getTorsoEncoders());\n    \n    for (size_t i = 0; i < 7; ++i)\n        root_ee_enc(i+3) = enc_arm(i);\n    \n    return root_ee_enc;\n}\n\n\nbool BatchCADSuperimposer::sync_input(const bool status)\n{\n    synch_ = status;\n\n    return true;\n}\n\n\nbool BatchCADSuperimposer::render_extra_mesh(const bool status)\n{\n    view_forearm_ = status;\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2018 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 CollisionPrevention.cpp\n * CollisionPrevention controller.\n *\n *\/\n\n#include <CollisionPrevention\/CollisionPrevention.hpp>\nusing namespace matrix;\nusing namespace time_literals;\n\n\nCollisionPrevention::CollisionPrevention(ModuleParams *parent) :\n\tModuleParams(parent)\n{\n}\n\nCollisionPrevention::~CollisionPrevention()\n{\n\t\/\/unadvertise publishers\n\tif (_mavlink_log_pub != nullptr) {\n\t\torb_unadvertise(_mavlink_log_pub);\n\t}\n}\n\nvoid CollisionPrevention::_publishConstrainedSetpoint(const Vector2f &original_setpoint,\n\t\tconst Vector2f &adapted_setpoint)\n{\n\tcollision_constraints_s\tconstraints{};\t\/**< collision constraints message *\/\n\n\t\/\/fill in values\n\tconstraints.timestamp = hrt_absolute_time();\n\n\tconstraints.original_setpoint[0] = original_setpoint(0);\n\tconstraints.original_setpoint[1] = original_setpoint(1);\n\tconstraints.adapted_setpoint[0] = adapted_setpoint(0);\n\tconstraints.adapted_setpoint[1] = adapted_setpoint(1);\n\n\t\/\/ publish constraints\n\tif (_constraints_pub != nullptr) {\n\t\torb_publish(ORB_ID(collision_constraints), _constraints_pub, &constraints);\n\n\t} else {\n\t\t_constraints_pub = orb_advertise(ORB_ID(collision_constraints), &constraints);\n\t}\n}\n\nvoid CollisionPrevention::_publishObstacleDistance(obstacle_distance_s &obstacle)\n{\n\t\/\/ publish fused obtacle distance message with data from offboard obstacle_distance and distance sensor\n\tif (_obstacle_distance_pub != nullptr) {\n\t\torb_publish(ORB_ID(obstacle_distance_fused), _obstacle_distance_pub, &obstacle);\n\n\t} else {\n\t\t_obstacle_distance_pub = orb_advertise(ORB_ID(obstacle_distance_fused), &obstacle);\n\t}\n}\n\nvoid CollisionPrevention::_updateOffboardObstacleDistance(obstacle_distance_s &obstacle)\n{\n\t_sub_obstacle_distance.update();\n\tconst obstacle_distance_s &obstacle_distance = _sub_obstacle_distance.get();\n\n\t\/\/ Update with offboard data if the data is not stale\n\tif (hrt_elapsed_time(&obstacle_distance.timestamp) < RANGE_STREAM_TIMEOUT_US) {\n\t\tobstacle = obstacle_distance;\n\t}\n}\n\nvoid CollisionPrevention::_updateDistanceSensor(obstacle_distance_s &obstacle)\n{\n\tfor (unsigned i = 0; i < ORB_MULTI_MAX_INSTANCES; i++) {\n\t\tdistance_sensor_s distance_sensor;\n\t\t_sub_distance_sensor[i].copy(&distance_sensor);\n\n\t\t\/\/ consider only instaces with updated, valid data and orientations useful for collision prevention\n\t\tif ((hrt_elapsed_time(&distance_sensor.timestamp) < RANGE_STREAM_TIMEOUT_US) &&\n\t\t    (distance_sensor.orientation != distance_sensor_s::ROTATION_DOWNWARD_FACING) &&\n\t\t    (distance_sensor.orientation != distance_sensor_s::ROTATION_UPWARD_FACING)) {\n\n\n\t\t\tif (obstacle.increment > 0) {\n\t\t\t\t\/\/ data from companion\n\t\t\t\tobstacle.timestamp = math::max(obstacle.timestamp, distance_sensor.timestamp);\n\t\t\t\tobstacle.max_distance = math::max((int)obstacle.max_distance,\n\t\t\t\t\t\t\t\t  (int)distance_sensor.max_distance * 100);\n\t\t\t\tobstacle.min_distance = math::min((int)obstacle.min_distance,\n\t\t\t\t\t\t\t\t  (int)distance_sensor.min_distance * 100);\n\t\t\t\t\/\/ since the data from the companion are already in the distances data structure,\n\t\t\t\t\/\/ keep the increment that is sent\n\t\t\t\tobstacle.angle_offset = 0.f; \/\/companion not sending this field (needs mavros update)\n\n\t\t\t} else {\n\t\t\t\tobstacle.timestamp = distance_sensor.timestamp;\n\t\t\t\tobstacle.max_distance = distance_sensor.max_distance * 100; \/\/ convert to cm\n\t\t\t\tobstacle.min_distance = distance_sensor.min_distance * 100; \/\/ convert to cm\n\t\t\t\tmemset(&obstacle.distances[0], 0xff, sizeof(obstacle.distances));\n\t\t\t\tobstacle.increment = math::degrees(distance_sensor.h_fov);\n\t\t\t\tobstacle.angle_offset = 0.f;\n\t\t\t}\n\n\t\t\tif ((distance_sensor.current_distance > distance_sensor.min_distance) &&\n\t\t\t    (distance_sensor.current_distance < distance_sensor.max_distance)) {\n\n\t\t\t\tfloat sensor_yaw_body_rad = _sensorOrientationToYawOffset(distance_sensor, obstacle.angle_offset);\n\n\t\t\t\tmatrix::Quatf attitude = Quatf(_sub_vehicle_attitude.get().q);\n\t\t\t\t\/\/ convert the sensor orientation from body to local frame in the range [0, 360]\n\t\t\t\tfloat sensor_yaw_local_deg  = math::degrees(wrap_2pi(Eulerf(attitude).psi() + sensor_yaw_body_rad));\n\n\t\t\t\t\/\/ calculate the field of view boundary bin indices\n\t\t\t\tint lower_bound = (int)floor((sensor_yaw_local_deg  - math::degrees(distance_sensor.h_fov \/ 2.0f)) \/\n\t\t\t\t\t\t\t     obstacle.increment);\n\t\t\t\tint upper_bound = (int)floor((sensor_yaw_local_deg  + math::degrees(distance_sensor.h_fov \/ 2.0f)) \/\n\t\t\t\t\t\t\t     obstacle.increment);\n\n\t\t\t\t\/\/ if increment is lower than 5deg, use an offset\n\t\t\t\tconst int distances_array_size = sizeof(obstacle.distances) \/ sizeof(obstacle.distances[0]);\n\n\t\t\t\tif (((lower_bound < 0 || upper_bound < 0) || (lower_bound >= distances_array_size\n\t\t\t\t\t\t|| upper_bound >= distances_array_size)) && obstacle.increment < 5.f) {\n\t\t\t\t\tobstacle.angle_offset = sensor_yaw_local_deg ;\n\t\t\t\t\tupper_bound  = abs(upper_bound - lower_bound);\n\t\t\t\t\tlower_bound  = 0;\n\t\t\t\t}\n\n\t\t\t\t\/\/ rotate vehicle attitude into the sensor body frame\n\t\t\t\tmatrix::Quatf attitude_sensor_frame = attitude;\n\t\t\t\tattitude_sensor_frame.rotate(Vector3f(0.f, 0.f, sensor_yaw_body_rad));\n\t\t\t\tfloat attitude_sensor_frame_pitch = cosf(Eulerf(attitude_sensor_frame).theta());\n\n\t\t\t\tfor (int bin = lower_bound; bin <= upper_bound; ++bin) {\n\t\t\t\t\tint wrap_bin = bin;\n\n\t\t\t\t\tif (wrap_bin < 0) {\n\t\t\t\t\t\t\/\/ wrap bin index around the array\n\t\t\t\t\t\twrap_bin = (int)floor(360.f \/ obstacle.increment) + bin;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (wrap_bin >= distances_array_size) {\n\t\t\t\t\t\t\/\/ wrap bin index around the array\n\t\t\t\t\t\twrap_bin = bin - distances_array_size;\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ compensate measurement for vehicle tilt and convert to cm\n\t\t\t\t\tobstacle.distances[wrap_bin] = math::min((int)obstacle.distances[wrap_bin],\n\t\t\t\t\t\t\t\t       (int)(100 * distance_sensor.current_distance * attitude_sensor_frame_pitch));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t_publishObstacleDistance(obstacle);\n}\n\nvoid CollisionPrevention::_calculateConstrainedSetpoint(Vector2f &setpoint,\n\t\tconst Vector2f &curr_pos, const Vector2f &curr_vel)\n{\n\tobstacle_distance_s obstacle{};\n\t_updateOffboardObstacleDistance(obstacle);\n\t_updateDistanceSensor(obstacle);\n\n\tfloat setpoint_length = setpoint.norm();\n\n\tif (hrt_elapsed_time(&obstacle.timestamp) < RANGE_STREAM_TIMEOUT_US) {\n\t\tif (setpoint_length > 0.001f) {\n\n\t\t\tVector2f setpoint_dir = setpoint \/ setpoint_length;\n\t\t\tfloat vel_max = setpoint_length;\n\t\t\tint distances_array_size = sizeof(obstacle.distances) \/ sizeof(obstacle.distances[0]);\n\n\t\t\tfor (int i = 0; i < distances_array_size; i++) {\n\n\t\t\t\tif (obstacle.distances[i] < obstacle.max_distance &&\n\t\t\t\t    obstacle.distances[i] > obstacle.min_distance && (float)i * obstacle.increment < 360.f) {\n\t\t\t\t\tfloat distance = obstacle.distances[i] \/ 100.0f; \/\/convert to meters\n\t\t\t\t\tfloat angle = math::radians((float)i * obstacle.increment);\n\n\t\t\t\t\tif (obstacle.angle_offset > 0.f) {\n\t\t\t\t\t\tangle += math::radians(obstacle.angle_offset);\n\t\t\t\t\t}\n\n\t\t\t\t\tVector2f bin_direction = {cos(angle), sin(angle)};\n\t\t\t\t\tfloat curr_vel_parallel = math::max(0.f, curr_vel.dot(bin_direction));\n\n\t\t\t\t\t\/\/calculate max allowed velocity with a P-controller (same gain as in the position controller)\n\t\t\t\t\tfloat delay_distance = curr_vel_parallel * _param_mpc_col_prev_dly.get();\n\t\t\t\t\tfloat vel_max_posctrl = math::max(0.f,\n\t\t\t\t\t\t\t\t\t  _param_mpc_xy_p.get() * (distance - _param_mpc_col_prev_d.get() - delay_distance));\n\t\t\t\t\tVector2f  vel_max_vec = bin_direction * vel_max_posctrl;\n\t\t\t\t\tfloat vel_max_bin = vel_max_vec.dot(setpoint_dir);\n\t\t\t\t\tfloat vel_setpoint_bin = setpoint.dot(bin_direction);\n\n\t\t\t\t\t\/\/limit the velocity\n\t\t\t\t\t\/\/do not react to obstacles more than 70 degree off the given stick input\n\t\t\t\t\tif (vel_setpoint_bin > 0.94f * setpoint_length && vel_max_bin >= 0) {\n\t\t\t\t\t\tvel_max = math::min(vel_max, vel_max_bin);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsetpoint = setpoint_dir * vel_max;\n\t\t}\n\n\t} else {\n\t\t\/\/ if distance data are stale, switch to Loiter\n\t\t_publishVehicleCmdDoLoiter();\n\t\tmavlink_log_critical(&_mavlink_log_pub, \"No range data received, loitering.\");\n\t}\n}\n\nvoid CollisionPrevention::modifySetpoint(Vector2f &original_setpoint, const float max_speed,\n\t\tconst Vector2f &curr_pos, const Vector2f &curr_vel)\n{\n\t\/\/calculate movement constraints based on range data\n\tVector2f new_setpoint = original_setpoint;\n\t_calculateConstrainedSetpoint(new_setpoint, curr_pos, curr_vel);\n\n\t\/\/warn user if collision prevention starts to interfere\n\tbool currently_interfering = (new_setpoint(0) < original_setpoint(0) - 0.05f * max_speed\n\t\t\t\t      || new_setpoint(0) > original_setpoint(0) + 0.05f * max_speed\n\t\t\t\t      || new_setpoint(1) < original_setpoint(1) - 0.05f * max_speed\n\t\t\t\t      || new_setpoint(1) > original_setpoint(1) + 0.05f * max_speed);\n\n\tif (currently_interfering && (currently_interfering != _interfering)) {\n\t\tmavlink_log_critical(&_mavlink_log_pub, \"Collision Warning\");\n\t}\n\n\t_interfering = currently_interfering;\n\t_publishConstrainedSetpoint(original_setpoint, new_setpoint);\n\toriginal_setpoint = new_setpoint;\n}\n\nvoid CollisionPrevention::_publishVehicleCmdDoLoiter()\n{\n\tvehicle_command_s command{};\n\tcommand.command = vehicle_command_s::VEHICLE_CMD_DO_SET_MODE;\n\tcommand.param1 = (float)1; \/\/ base mode\n\tcommand.param3 = (float)0; \/\/ sub mode\n\tcommand.target_system = 1;\n\tcommand.target_component = 1;\n\tcommand.source_system = 1;\n\tcommand.source_component = 1;\n\tcommand.confirmation = false;\n\tcommand.from_external = false;\n\tcommand.param2 = (float)PX4_CUSTOM_MAIN_MODE_AUTO;\n\tcommand.param3 = (float)PX4_CUSTOM_SUB_MODE_AUTO_LOITER;\n\n\t\/\/ publish the vehicle command\n\tif (_pub_vehicle_command == nullptr) {\n\t\t_pub_vehicle_command = orb_advertise_queue(ORB_ID(vehicle_command), &command,\n\t\t\t\t       vehicle_command_s::ORB_QUEUE_LENGTH);\n\n\t} else {\n\t\torb_publish(ORB_ID(vehicle_command), _pub_vehicle_command, &command);\n\t}\n}\n<commit_msg>change size of reaction angle<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2018 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 CollisionPrevention.cpp\n * CollisionPrevention controller.\n *\n *\/\n\n#include <CollisionPrevention\/CollisionPrevention.hpp>\nusing namespace matrix;\nusing namespace time_literals;\n\n\nCollisionPrevention::CollisionPrevention(ModuleParams *parent) :\n\tModuleParams(parent)\n{\n}\n\nCollisionPrevention::~CollisionPrevention()\n{\n\t\/\/unadvertise publishers\n\tif (_mavlink_log_pub != nullptr) {\n\t\torb_unadvertise(_mavlink_log_pub);\n\t}\n}\n\nvoid CollisionPrevention::_publishConstrainedSetpoint(const Vector2f &original_setpoint,\n\t\tconst Vector2f &adapted_setpoint)\n{\n\tcollision_constraints_s\tconstraints{};\t\/**< collision constraints message *\/\n\n\t\/\/fill in values\n\tconstraints.timestamp = hrt_absolute_time();\n\n\tconstraints.original_setpoint[0] = original_setpoint(0);\n\tconstraints.original_setpoint[1] = original_setpoint(1);\n\tconstraints.adapted_setpoint[0] = adapted_setpoint(0);\n\tconstraints.adapted_setpoint[1] = adapted_setpoint(1);\n\n\t\/\/ publish constraints\n\tif (_constraints_pub != nullptr) {\n\t\torb_publish(ORB_ID(collision_constraints), _constraints_pub, &constraints);\n\n\t} else {\n\t\t_constraints_pub = orb_advertise(ORB_ID(collision_constraints), &constraints);\n\t}\n}\n\nvoid CollisionPrevention::_publishObstacleDistance(obstacle_distance_s &obstacle)\n{\n\t\/\/ publish fused obtacle distance message with data from offboard obstacle_distance and distance sensor\n\tif (_obstacle_distance_pub != nullptr) {\n\t\torb_publish(ORB_ID(obstacle_distance_fused), _obstacle_distance_pub, &obstacle);\n\n\t} else {\n\t\t_obstacle_distance_pub = orb_advertise(ORB_ID(obstacle_distance_fused), &obstacle);\n\t}\n}\n\nvoid CollisionPrevention::_updateOffboardObstacleDistance(obstacle_distance_s &obstacle)\n{\n\t_sub_obstacle_distance.update();\n\tconst obstacle_distance_s &obstacle_distance = _sub_obstacle_distance.get();\n\n\t\/\/ Update with offboard data if the data is not stale\n\tif (hrt_elapsed_time(&obstacle_distance.timestamp) < RANGE_STREAM_TIMEOUT_US) {\n\t\tobstacle = obstacle_distance;\n\t}\n}\n\nvoid CollisionPrevention::_updateDistanceSensor(obstacle_distance_s &obstacle)\n{\n\tfor (unsigned i = 0; i < ORB_MULTI_MAX_INSTANCES; i++) {\n\t\tdistance_sensor_s distance_sensor;\n\t\t_sub_distance_sensor[i].copy(&distance_sensor);\n\n\t\t\/\/ consider only instaces with updated, valid data and orientations useful for collision prevention\n\t\tif ((hrt_elapsed_time(&distance_sensor.timestamp) < RANGE_STREAM_TIMEOUT_US) &&\n\t\t    (distance_sensor.orientation != distance_sensor_s::ROTATION_DOWNWARD_FACING) &&\n\t\t    (distance_sensor.orientation != distance_sensor_s::ROTATION_UPWARD_FACING)) {\n\n\n\t\t\tif (obstacle.increment > 0) {\n\t\t\t\t\/\/ data from companion\n\t\t\t\tobstacle.timestamp = math::max(obstacle.timestamp, distance_sensor.timestamp);\n\t\t\t\tobstacle.max_distance = math::max((int)obstacle.max_distance,\n\t\t\t\t\t\t\t\t  (int)distance_sensor.max_distance * 100);\n\t\t\t\tobstacle.min_distance = math::min((int)obstacle.min_distance,\n\t\t\t\t\t\t\t\t  (int)distance_sensor.min_distance * 100);\n\t\t\t\t\/\/ since the data from the companion are already in the distances data structure,\n\t\t\t\t\/\/ keep the increment that is sent\n\t\t\t\tobstacle.angle_offset = 0.f; \/\/companion not sending this field (needs mavros update)\n\n\t\t\t} else {\n\t\t\t\tobstacle.timestamp = distance_sensor.timestamp;\n\t\t\t\tobstacle.max_distance = distance_sensor.max_distance * 100; \/\/ convert to cm\n\t\t\t\tobstacle.min_distance = distance_sensor.min_distance * 100; \/\/ convert to cm\n\t\t\t\tmemset(&obstacle.distances[0], 0xff, sizeof(obstacle.distances));\n\t\t\t\tobstacle.increment = math::degrees(distance_sensor.h_fov);\n\t\t\t\tobstacle.angle_offset = 0.f;\n\t\t\t}\n\n\t\t\tif ((distance_sensor.current_distance > distance_sensor.min_distance) &&\n\t\t\t    (distance_sensor.current_distance < distance_sensor.max_distance)) {\n\n\t\t\t\tfloat sensor_yaw_body_rad = _sensorOrientationToYawOffset(distance_sensor, obstacle.angle_offset);\n\n\t\t\t\tmatrix::Quatf attitude = Quatf(_sub_vehicle_attitude.get().q);\n\t\t\t\t\/\/ convert the sensor orientation from body to local frame in the range [0, 360]\n\t\t\t\tfloat sensor_yaw_local_deg  = math::degrees(wrap_2pi(Eulerf(attitude).psi() + sensor_yaw_body_rad));\n\n\t\t\t\t\/\/ calculate the field of view boundary bin indices\n\t\t\t\tint lower_bound = (int)floor((sensor_yaw_local_deg  - math::degrees(distance_sensor.h_fov \/ 2.0f)) \/\n\t\t\t\t\t\t\t     obstacle.increment);\n\t\t\t\tint upper_bound = (int)floor((sensor_yaw_local_deg  + math::degrees(distance_sensor.h_fov \/ 2.0f)) \/\n\t\t\t\t\t\t\t     obstacle.increment);\n\n\t\t\t\t\/\/ if increment is lower than 5deg, use an offset\n\t\t\t\tconst int distances_array_size = sizeof(obstacle.distances) \/ sizeof(obstacle.distances[0]);\n\n\t\t\t\tif (((lower_bound < 0 || upper_bound < 0) || (lower_bound >= distances_array_size\n\t\t\t\t\t\t|| upper_bound >= distances_array_size)) && obstacle.increment < 5.f) {\n\t\t\t\t\tobstacle.angle_offset = sensor_yaw_local_deg ;\n\t\t\t\t\tupper_bound  = abs(upper_bound - lower_bound);\n\t\t\t\t\tlower_bound  = 0;\n\t\t\t\t}\n\n\t\t\t\t\/\/ rotate vehicle attitude into the sensor body frame\n\t\t\t\tmatrix::Quatf attitude_sensor_frame = attitude;\n\t\t\t\tattitude_sensor_frame.rotate(Vector3f(0.f, 0.f, sensor_yaw_body_rad));\n\t\t\t\tfloat attitude_sensor_frame_pitch = cosf(Eulerf(attitude_sensor_frame).theta());\n\n\t\t\t\tfor (int bin = lower_bound; bin <= upper_bound; ++bin) {\n\t\t\t\t\tint wrap_bin = bin;\n\n\t\t\t\t\tif (wrap_bin < 0) {\n\t\t\t\t\t\t\/\/ wrap bin index around the array\n\t\t\t\t\t\twrap_bin = (int)floor(360.f \/ obstacle.increment) + bin;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (wrap_bin >= distances_array_size) {\n\t\t\t\t\t\t\/\/ wrap bin index around the array\n\t\t\t\t\t\twrap_bin = bin - distances_array_size;\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ compensate measurement for vehicle tilt and convert to cm\n\t\t\t\t\tobstacle.distances[wrap_bin] = math::min((int)obstacle.distances[wrap_bin],\n\t\t\t\t\t\t\t\t       (int)(100 * distance_sensor.current_distance * attitude_sensor_frame_pitch));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t_publishObstacleDistance(obstacle);\n}\n\nvoid CollisionPrevention::_calculateConstrainedSetpoint(Vector2f &setpoint,\n\t\tconst Vector2f &curr_pos, const Vector2f &curr_vel)\n{\n\tobstacle_distance_s obstacle{};\n\t_updateOffboardObstacleDistance(obstacle);\n\t_updateDistanceSensor(obstacle);\n\n\tfloat setpoint_length = setpoint.norm();\n\n\tif (hrt_elapsed_time(&obstacle.timestamp) < RANGE_STREAM_TIMEOUT_US) {\n\t\tif (setpoint_length > 0.001f) {\n\n\t\t\tVector2f setpoint_dir = setpoint \/ setpoint_length;\n\t\t\tfloat vel_max = setpoint_length;\n\t\t\tint distances_array_size = sizeof(obstacle.distances) \/ sizeof(obstacle.distances[0]);\n\n\t\t\tfor (int i = 0; i < distances_array_size; i++) {\n\n\t\t\t\tif (obstacle.distances[i] < obstacle.max_distance &&\n\t\t\t\t    obstacle.distances[i] > obstacle.min_distance && (float)i * obstacle.increment < 360.f) {\n\t\t\t\t\tfloat distance = obstacle.distances[i] \/ 100.0f; \/\/convert to meters\n\t\t\t\t\tfloat angle = math::radians((float)i * obstacle.increment);\n\n\t\t\t\t\tif (obstacle.angle_offset > 0.f) {\n\t\t\t\t\t\tangle += math::radians(obstacle.angle_offset);\n\t\t\t\t\t}\n\n\t\t\t\t\tVector2f bin_direction = {cos(angle), sin(angle)};\n\t\t\t\t\tfloat curr_vel_parallel = math::max(0.f, curr_vel.dot(bin_direction));\n\n\t\t\t\t\t\/\/calculate max allowed velocity with a P-controller (same gain as in the position controller)\n\t\t\t\t\tfloat delay_distance = curr_vel_parallel * _param_mpc_col_prev_dly.get();\n\t\t\t\t\tfloat vel_max_posctrl = math::max(0.f,\n\t\t\t\t\t\t\t\t\t  _param_mpc_xy_p.get() * (distance - _param_mpc_col_prev_d.get() - delay_distance));\n\t\t\t\t\tVector2f  vel_max_vec = bin_direction * vel_max_posctrl;\n\t\t\t\t\tfloat vel_max_bin = vel_max_vec.dot(setpoint_dir);\n\t\t\t\t\tfloat vel_setpoint_bin = setpoint.dot(bin_direction);\n\n\t\t\t\t\t\/\/limit the velocity\n\t\t\t\t\t\/\/do not react to obstacles more than 45 degree off the given stick input cos(45deg) = 0.71\n\t\t\t\t\tif (vel_setpoint_bin > 0.71f * setpoint_length && vel_max_bin >= 0) {\n\t\t\t\t\t\tvel_max = math::min(vel_max, vel_max_bin);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsetpoint = setpoint_dir * vel_max;\n\t\t}\n\n\t} else {\n\t\t\/\/ if distance data are stale, switch to Loiter\n\t\t_publishVehicleCmdDoLoiter();\n\t\tmavlink_log_critical(&_mavlink_log_pub, \"No range data received, loitering.\");\n\t}\n}\n\nvoid CollisionPrevention::modifySetpoint(Vector2f &original_setpoint, const float max_speed,\n\t\tconst Vector2f &curr_pos, const Vector2f &curr_vel)\n{\n\t\/\/calculate movement constraints based on range data\n\tVector2f new_setpoint = original_setpoint;\n\t_calculateConstrainedSetpoint(new_setpoint, curr_pos, curr_vel);\n\n\t\/\/warn user if collision prevention starts to interfere\n\tbool currently_interfering = (new_setpoint(0) < original_setpoint(0) - 0.05f * max_speed\n\t\t\t\t      || new_setpoint(0) > original_setpoint(0) + 0.05f * max_speed\n\t\t\t\t      || new_setpoint(1) < original_setpoint(1) - 0.05f * max_speed\n\t\t\t\t      || new_setpoint(1) > original_setpoint(1) + 0.05f * max_speed);\n\n\tif (currently_interfering && (currently_interfering != _interfering)) {\n\t\tmavlink_log_critical(&_mavlink_log_pub, \"Collision Warning\");\n\t}\n\n\t_interfering = currently_interfering;\n\t_publishConstrainedSetpoint(original_setpoint, new_setpoint);\n\toriginal_setpoint = new_setpoint;\n}\n\nvoid CollisionPrevention::_publishVehicleCmdDoLoiter()\n{\n\tvehicle_command_s command{};\n\tcommand.command = vehicle_command_s::VEHICLE_CMD_DO_SET_MODE;\n\tcommand.param1 = (float)1; \/\/ base mode\n\tcommand.param3 = (float)0; \/\/ sub mode\n\tcommand.target_system = 1;\n\tcommand.target_component = 1;\n\tcommand.source_system = 1;\n\tcommand.source_component = 1;\n\tcommand.confirmation = false;\n\tcommand.from_external = false;\n\tcommand.param2 = (float)PX4_CUSTOM_MAIN_MODE_AUTO;\n\tcommand.param3 = (float)PX4_CUSTOM_SUB_MODE_AUTO_LOITER;\n\n\t\/\/ publish the vehicle command\n\tif (_pub_vehicle_command == nullptr) {\n\t\t_pub_vehicle_command = orb_advertise_queue(ORB_ID(vehicle_command), &command,\n\t\t\t\t       vehicle_command_s::ORB_QUEUE_LENGTH);\n\n\t} else {\n\t\torb_publish(ORB_ID(vehicle_command), _pub_vehicle_command, &command);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\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* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include \"RhoLogSink.h\"\n\n#include \"common\/RhoFile.h\"\n#include \"common\/StringConverter.h\"\n#include \"common\/RhodesApp.h\"\n#include \"net\/RawSocket.h\"\n#include \"net\/URI.h\"\n\n#if defined( OS_SYMBIAN )\n#include <e32debug.h>\n#endif\n\nnamespace rho {\n\nCLogFileSink::CLogFileSink(const LogSettings& oSettings)\n    : m_pFile(0), m_pPosFile(0), m_oLogConf(oSettings), m_nCirclePos(-1), m_nFileLogSize(0)\n{\n\n}\n\nCLogFileSink::~CLogFileSink()\n{\n\tif(m_pFile)\n\t\tdelete m_pFile;\n}\n\n\nvoid CLogFileSink::writeLogMessage( String& strMsg ){\n    unsigned int len = strMsg.length();\n\n    if ( !m_pFile )\n        m_pFile = new common::CRhoFile();\n\n    if ( !m_pFile->isOpened() ){\n        m_pFile->open( getLogConf().getLogFilePath().c_str(), common::CRhoFile::OpenForAppend );\n        m_nFileLogSize = m_pFile->size();\n        loadLogPosition();\n    }\n\n    if ( getLogConf().getMaxLogFileSize() > 0 )\n    {\n        if ( ( m_nCirclePos >= 0 && m_nCirclePos + len > getLogConf().getMaxLogFileSize() ) || \n             ( m_nCirclePos < 0 && m_nFileLogSize + len > getLogConf().getMaxLogFileSize() ) )\n        {\n            m_pFile->movePosToStart();\n            m_nFileLogSize = 0;\n            m_nCirclePos = 0;\n        }\n    }\n\n    int nWritten = m_pFile->write( strMsg.c_str(), len );\n    m_pFile->flush();\n\n    if ( m_nCirclePos >= 0 )\n        m_nCirclePos += nWritten;\n    else\n        m_nFileLogSize += nWritten;\n\n    saveLogPosition();\n}\n\nint CLogFileSink::getCurPos()\n{\n    return m_nCirclePos >= 0 ? m_nCirclePos : m_nFileLogSize;\n}\n\nvoid CLogFileSink::clear(){\n    if ( m_pFile )    {\n        delete m_pFile;\n        m_pFile = NULL;\n    }\n\n    common::CRhoFile().deleteFile(getLogConf().getLogFilePath().c_str());\n    String strPosPath = getLogConf().getLogFilePath() + \"_pos\";\n    common::CRhoFile().deleteFile(strPosPath.c_str());\n}\n\nvoid CLogFileSink::loadLogPosition(){\n    if ( !m_pPosFile )\n        m_pPosFile = new common::CRhoFile();\n\n    if ( !m_pPosFile->isOpened() ){\n        String strPosPath = getLogConf().getLogFilePath() + \"_pos\";\n        m_pPosFile->open( strPosPath.c_str(), common::CRhoFile::OpenForReadWrite );\n    }\n\n    if ( !m_pPosFile->isOpened() )\n        return;\n\n    String strPos;\n    m_pPosFile->movePosToStart();\n    m_pPosFile->readString(strPos);\n    if ( strPos.length() == 0 )\n        return;\n\n    m_nCirclePos = atoi(strPos.c_str());\n    if ( m_nCirclePos < 0 || m_nCirclePos > (int)m_nFileLogSize )\n    \tm_nCirclePos = -1;\n    \n    if ( m_nCirclePos >= 0 )\n        m_pFile->setPosTo( m_nCirclePos );\n}\n\nvoid CLogFileSink::saveLogPosition(){\n    if ( m_nCirclePos < 0 )\n        return;\n\n    if ( m_nCirclePos > (int)getLogConf().getMaxLogFileSize() )\n    \treturn;\n    \n    String strPos = common::convertToStringA(m_nCirclePos);\n    for( int i = strPos.length(); i < 10; i++ )\n    \tstrPos += ' ';\n    \n    m_pPosFile->movePosToStart();\n    m_pPosFile->write( strPos.c_str(), strPos.length() );\n    m_pPosFile->flush();\n}\n\n#ifndef min\n#define min(a,b)            (((a) < (b)) ? (a) : (b))\n#endif\n\nvoid CLogOutputSink::writeLogMessage( String& strMsg )\n{\n    if ( strMsg.length() > 1 && strMsg[strMsg.length()-2] == '\\r' )\n        strMsg.erase(strMsg.length()-2,1);\n\n    const char* szMsg = strMsg.c_str(); \n\n#if defined( OS_WINDOWS_DESKTOP )\n\t\t::OutputDebugStringA(szMsg);\n#elif defined( OS_PLATFORM_MOTCE )\n\t\t::OutputDebugStringW(common::convertToStringW(strMsg).c_str());\n#elif defined(OS_WP8)\n\t\t::OutputDebugStringA(szMsg);\n#elif defined( OS_SYMBIAN )\n        TPtrC8 des((const TUint8*)szMsg);\n      \tRDebug::RawPrint(des);\n        return;\n#endif\n\n#if !defined( OS_PLATFORM_MOTCE )\n    for( int n = 0; n < (int)strMsg.length(); n+= 100 )\n        fwrite(szMsg+n, 1, min(100,strMsg.length()-n) , stdout );\n\n    fflush(stdout);\n#endif\n}\n\nCLogSocketSink::CLogSocketSink(const LogSettings& oSettings)\n{\n\tm_URL = oSettings.getLogURL();\n\n    CThreadQueue::setLogCategory(LogCategory(\"NO_LOGGING\"));\n    setPollInterval(QUEUE_POLL_INTERVAL_INFINITE);\n    start(epLow);\n}\n\nCLogSocketSink::~CLogSocketSink()\n{\n\t\/\/wait till all commands will be sent to server\n    CRhoThread::stop(2000);\n}\n\nvoid CLogSocketSink::setUrl(String url)\n{\n\tm_URL = url;\n}\n\nvoid CLogSocketSink::writeLogMessage( String& strMsg )\n{\n\taddQueueCommand(new LogCommand(m_URL.c_str(), strMsg.c_str()));\n}\n\nvoid CLogSocketSink::processCommand(IQueueCommand* pCmd)\n{\n    LogCommand *cmd = (LogCommand *)pCmd;\n    if (!cmd || (common::CRhodesApp::getInstance()==0))\n        return;\n#if defined(APP_BUILD_CAPABILITY_SHARED_RUNTIME)\n\n\tgetNet().doRequest( \"GET\", cmd->m_url+\"?LogSeverity=\"+cmd->m_body[0]+\"&LogComment=\"+net::URI::urlEncode(cmd->m_body), String(), 0, 0 );\n#else\n\tgetNet().doRequest( \"POST\", cmd->m_url, cmd->m_body, 0, 0 );\n#endif\n}\n        \n}\n<commit_msg>comment added<commit_after>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\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* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include \"RhoLogSink.h\"\n\n#include \"common\/RhoFile.h\"\n#include \"common\/StringConverter.h\"\n#include \"common\/RhodesApp.h\"\n#include \"net\/RawSocket.h\"\n#include \"net\/URI.h\"\n\n#if defined( OS_SYMBIAN )\n#include <e32debug.h>\n#endif\n\nnamespace rho {\n\nCLogFileSink::CLogFileSink(const LogSettings& oSettings)\n    : m_pFile(0), m_pPosFile(0), m_oLogConf(oSettings), m_nCirclePos(-1), m_nFileLogSize(0)\n{\n\n}\n\nCLogFileSink::~CLogFileSink()\n{\n\tif(m_pFile)\n\t\tdelete m_pFile;\n}\n\n\nvoid CLogFileSink::writeLogMessage( String& strMsg ){\n    unsigned int len = strMsg.length();\n\n    if ( !m_pFile )\n        m_pFile = new common::CRhoFile();\n\n    if ( !m_pFile->isOpened() ){\n        m_pFile->open( getLogConf().getLogFilePath().c_str(), common::CRhoFile::OpenForAppend );\n        m_nFileLogSize = m_pFile->size();\n        loadLogPosition();\n    }\n\n    if ( getLogConf().getMaxLogFileSize() > 0 )\n    {\n        if ( ( m_nCirclePos >= 0 && m_nCirclePos + len > getLogConf().getMaxLogFileSize() ) || \n             ( m_nCirclePos < 0 && m_nFileLogSize + len > getLogConf().getMaxLogFileSize() ) )\n        {\n            m_pFile->movePosToStart();\n            m_nFileLogSize = 0;\n            m_nCirclePos = 0;\n        }\n    }\n\n    int nWritten = m_pFile->write( strMsg.c_str(), len );\n    m_pFile->flush();\n\n    if ( m_nCirclePos >= 0 )\n        m_nCirclePos += nWritten;\n    else\n        m_nFileLogSize += nWritten;\n\n    saveLogPosition();\n}\n\nint CLogFileSink::getCurPos()\n{\n    return m_nCirclePos >= 0 ? m_nCirclePos : m_nFileLogSize;\n}\n\nvoid CLogFileSink::clear(){\n    if ( m_pFile )    {\n        delete m_pFile;\n        m_pFile = NULL;\n    }\n\n    common::CRhoFile().deleteFile(getLogConf().getLogFilePath().c_str());\n    String strPosPath = getLogConf().getLogFilePath() + \"_pos\";\n    common::CRhoFile().deleteFile(strPosPath.c_str());\n}\n\nvoid CLogFileSink::loadLogPosition(){\n    if ( !m_pPosFile )\n        m_pPosFile = new common::CRhoFile();\n\n    if ( !m_pPosFile->isOpened() ){\n        String strPosPath = getLogConf().getLogFilePath() + \"_pos\";\n        m_pPosFile->open( strPosPath.c_str(), common::CRhoFile::OpenForReadWrite );\n    }\n\n    if ( !m_pPosFile->isOpened() )\n        return;\n\n    String strPos;\n    m_pPosFile->movePosToStart();\n    m_pPosFile->readString(strPos);\n    if ( strPos.length() == 0 )\n        return;\n\n    m_nCirclePos = atoi(strPos.c_str());\n    if ( m_nCirclePos < 0 || m_nCirclePos > (int)m_nFileLogSize )\n    \tm_nCirclePos = -1;\n    \n    if ( m_nCirclePos >= 0 )\n        m_pFile->setPosTo( m_nCirclePos );\n}\n\nvoid CLogFileSink::saveLogPosition(){\n    if ( m_nCirclePos < 0 )\n        return;\n\n    if ( m_nCirclePos > (int)getLogConf().getMaxLogFileSize() )\n    \treturn;\n    \n    String strPos = common::convertToStringA(m_nCirclePos);\n    for( int i = strPos.length(); i < 10; i++ )\n    \tstrPos += ' ';\n    \n    m_pPosFile->movePosToStart();\n    m_pPosFile->write( strPos.c_str(), strPos.length() );\n    m_pPosFile->flush();\n}\n\n#ifndef min\n#define min(a,b)            (((a) < (b)) ? (a) : (b))\n#endif\n\nvoid CLogOutputSink::writeLogMessage( String& strMsg )\n{\n    if ( strMsg.length() > 1 && strMsg[strMsg.length()-2] == '\\r' )\n        strMsg.erase(strMsg.length()-2,1);\n\n    const char* szMsg = strMsg.c_str(); \n\n#if defined( OS_WINDOWS_DESKTOP )\n\t\t::OutputDebugStringA(szMsg);\n#elif defined( OS_PLATFORM_MOTCE )\n\t\t::OutputDebugStringW(common::convertToStringW(strMsg).c_str());\n#elif defined(OS_WP8)\n\t\t::OutputDebugStringA(szMsg);\n#elif defined( OS_SYMBIAN )\n        TPtrC8 des((const TUint8*)szMsg);\n      \tRDebug::RawPrint(des);\n        return;\n#endif\n\n#if !defined( OS_PLATFORM_MOTCE )\n    for( int n = 0; n < (int)strMsg.length(); n+= 100 )\n        fwrite(szMsg+n, 1, min(100,strMsg.length()-n) , stdout );\n\n    fflush(stdout);\n#endif\n}\n\nCLogSocketSink::CLogSocketSink(const LogSettings& oSettings)\n{\n\tm_URL = oSettings.getLogURL();\n\n    CThreadQueue::setLogCategory(LogCategory(\"NO_LOGGING\"));\n    setPollInterval(QUEUE_POLL_INTERVAL_INFINITE);\n    start(epLow);\n}\n\nCLogSocketSink::~CLogSocketSink()\n{\n\t\/\/wait till all commands will be sent to server\n    CRhoThread::stop(2000);\n}\n\nvoid CLogSocketSink::setUrl(String url)\n{\n\tm_URL = url;\n}\n\nvoid CLogSocketSink::writeLogMessage( String& strMsg )\n{\n\taddQueueCommand(new LogCommand(m_URL.c_str(), strMsg.c_str()));\n}\n\nvoid CLogSocketSink::processCommand(IQueueCommand* pCmd)\n{\n    LogCommand *cmd = (LogCommand *)pCmd;\n  \n    \/*\n      Checking CRhodesApp instance is needed because net request requires it to be valid.\n      If socket sink is initialized from ext manager, log messages could occur before app instance is set so we will crash.\n    *\/     \n    if (!cmd || (common::CRhodesApp::getInstance()==0))\n        return;\n#if defined(APP_BUILD_CAPABILITY_SHARED_RUNTIME)\n\n\tgetNet().doRequest( \"GET\", cmd->m_url+\"?LogSeverity=\"+cmd->m_body[0]+\"&LogComment=\"+net::URI::urlEncode(cmd->m_body), String(), 0, 0 );\n#else\n\tgetNet().doRequest( \"POST\", cmd->m_url, cmd->m_body, 0, 0 );\n#endif\n}\n        \n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright mogemimi. Distributed under the MIT license.\n\n#include \"pomdog\/gpu\/direct3d\/hlsl_compiling.h\"\n#include \"pomdog\/basic\/conditional_compilation.h\"\n#include \"pomdog\/content\/utility\/binary_reader.h\"\n#include \"pomdog\/filesystem\/file_system.h\"\n#include \"pomdog\/gpu\/backends\/shader_bytecode.h\"\n#include \"pomdog\/gpu\/backends\/shader_compile_options.h\"\n#include \"pomdog\/platform\/win32\/prerequisites_win32.h\"\n#include \"pomdog\/utility\/assert.h\"\n#include \"pomdog\/utility\/errors.h\"\n#include \"pomdog\/utility\/path_helper.h\"\n\nPOMDOG_SUPPRESS_WARNINGS_GENERATED_BY_STD_HEADERS_BEGIN\n#include <fstream>\n#include <string>\n#include <utility>\n#include <vector>\nPOMDOG_SUPPRESS_WARNINGS_GENERATED_BY_STD_HEADERS_END\n\nnamespace pomdog::gpu::detail::direct3d {\nnamespace {\n\n[[nodiscard]] std::string\nToString(const ShaderProfile& profile) noexcept\n{\n    std::string output;\n\n    switch (profile.PipelineStage) {\n    case ShaderPipelineStage::VertexShader:\n        output += \"vs_\";\n        break;\n    case ShaderPipelineStage::PixelShader:\n        output += \"ps_\";\n        break;\n    \/\/case ShaderPipelineStage::GeometryShader:\n    \/\/    output += \"gs_\";\n    \/\/    break;\n    \/\/case ShaderPipelineStage::DomainShader:\n    \/\/    output += \"ds_\";\n    \/\/    break;\n    \/\/case ShaderPipelineStage::ComputeShader:\n    \/\/    output += \"cs_\";\n    \/\/    break;\n    \/\/case ShaderPipelineStage::HullShader:\n    \/\/    output += \"hs_\";\n    \/\/    break;\n    }\n\n    output += std::to_string(profile.ShaderModel.Major);\n    output += '_';\n    output += std::to_string(profile.ShaderModel.Minor);\n    return output;\n}\n\nclass HLSLCodeInclude final : public ID3DInclude {\nprivate:\n    std::string currentDirectory;\n    std::vector<std::uint8_t> outputSource;\n    std::unique_ptr<Error> lastError;\n\npublic:\n    explicit HLSLCodeInclude(const std::string& curentDirectoryIn)\n        : currentDirectory(curentDirectoryIn)\n    {\n    }\n\n    HRESULT __stdcall Open(D3D_INCLUDE_TYPE includeType, LPCSTR pFileName, [[maybe_unused]] LPCVOID pParentData, LPCVOID* ppData, UINT* pBytes)\n    {\n        \/\/if (D3D10_INCLUDE_FORCE_DWORD == includeType) {\n        \/\/    return E_FAIL;\n        \/\/}\n\n        std::string includePath;\n        if (D3D_INCLUDE_LOCAL == includeType) {\n            includePath = PathHelper::Join(currentDirectory, pFileName);\n        }\n        else {\n            includePath = pFileName;\n        }\n\n        if (D3D_INCLUDE_LOCAL != includeType && D3D_INCLUDE_SYSTEM != includeType) {\n            return E_FAIL;\n        }\n\n#if 0\n#if defined(DEBUG) && !defined(NDEBUG)\n        if (D3D_INCLUDE_LOCAL == includeType) {\n            Log::Internal(\"ShaderInclude: Local\");\n        }\n        else if (D3D_INCLUDE_SYSTEM == includeType) {\n            Log::Internal(\"ShaderInclude: System\");\n        }\n        Log::Internal(StringHelper::Format(\"include shader file : %s\", includePath.c_str()));\n#endif\n#endif\n\n        std::ifstream stream{includePath, std::ifstream::binary};\n\n        if (!stream) {\n            lastError = errors::New(\"Could not find a shader source file: \" + includePath);\n            return E_FAIL;\n        }\n\n        auto [size, err] = FileSystem::GetFileSize(includePath);\n        if (err != nullptr) {\n            lastError = errors::New(\"failed to get file size: \" + includePath);\n            return E_FAIL;\n        }\n\n        if (size <= 0) {\n            lastError = errors::New(\"The file is too small: \" + includePath);\n            return E_FAIL;\n        }\n\n        outputSource = BinaryReader::ReadArray<std::uint8_t>(stream, size);\n\n        *ppData = outputSource.data();\n        *pBytes = static_cast<UINT>(outputSource.size());\n\n        return S_OK;\n    }\n\n    HRESULT __stdcall Close([[maybe_unused]] LPCVOID pData)\n    {\n        outputSource.clear();\n        return S_OK;\n    }\n\n    std::unique_ptr<Error>\n    MoveLastError() noexcept\n    {\n        return std::move(lastError);\n    }\n};\n\n[[nodiscard]] std::unique_ptr<Error>\nCompileFromShaderFile(\n    const ShaderBytecode& shaderBytecode,\n    const std::string& entrypoint,\n    const std::string& shaderProfile,\n    const std::string& currentDirectory,\n    const D3D_SHADER_MACRO* preprocessorMacros,\n    ID3DBlob** ppBlobOut)\n{\n    POMDOG_ASSERT(shaderBytecode.Code != nullptr);\n    POMDOG_ASSERT(shaderBytecode.ByteLength > 0);\n\n    DWORD shaderFlags = D3DCOMPILE_ENABLE_STRICTNESS;\n#if defined(DEBUG) && !defined(NDEBUG)\n    shaderFlags |= D3DCOMPILE_DEBUG;\n#endif\n\n    HLSLCodeInclude shaderInclude(currentDirectory);\n    Microsoft::WRL::ComPtr<ID3DBlob> errorBlob;\n\n    const auto hr = ::D3DCompile(\n        shaderBytecode.Code,\n        shaderBytecode.ByteLength,\n        nullptr,\n        preprocessorMacros,\n        &shaderInclude,\n        entrypoint.c_str(),\n        shaderProfile.c_str(),\n        shaderFlags,\n        0,\n        ppBlobOut,\n        &errorBlob);\n\n    if (auto err = shaderInclude.MoveLastError(); err != nullptr) {\n        return errors::Wrap(std::move(err), \"failed to compile shader\");\n    }\n\n    if (FAILED(hr)) {\n        if (errorBlob != nullptr) {\n            std::string str(reinterpret_cast<LPCSTR>(errorBlob->GetBufferPointer()), errorBlob->GetBufferSize());\n            return errors::New(\"failed to compile shader. error: \" + str);\n        }\n        return errors::New(\"D3DCompile() failed. HRESULT = \" + std::to_string(hr));\n    }\n\n    if (errorBlob != nullptr) {\n        std::string str(reinterpret_cast<LPCSTR>(errorBlob->GetBufferPointer()), errorBlob->GetBufferSize());\n        return errors::New(\"warning: \" + str);\n    }\n\n    return nullptr;\n}\n\n} \/\/ namespace\n\nstd::tuple<Microsoft::WRL::ComPtr<ID3DBlob>, std::unique_ptr<Error>>\nCompileHLSL(\n    const ShaderBytecode& shaderBytecode,\n    const ShaderCompileOptions& compileOptions) noexcept\n{\n    const auto target = ToString(compileOptions.Profile);\n    POMDOG_ASSERT(!target.empty());\n\n    std::vector<D3D_SHADER_MACRO> defines;\n    defines.reserve(compileOptions.PreprocessorMacros.size());\n\n    for (auto& macro : compileOptions.PreprocessorMacros) {\n        if (macro.Name.empty()) {\n            return std::make_tuple(nullptr, errors::New(\"macro.Name is empty\"));\n        }\n\n        D3D_SHADER_MACRO shaderMacro;\n        shaderMacro.Name = macro.Name.c_str();\n        shaderMacro.Definition = macro.Definition.empty() ? nullptr : macro.Definition.c_str();\n        defines.push_back(std::move(shaderMacro));\n    }\n\n    if (!defines.empty()) {\n        D3D_SHADER_MACRO shaderMacro;\n        shaderMacro.Name = nullptr;\n        shaderMacro.Definition = nullptr;\n        defines.push_back(std::move(shaderMacro));\n    }\n\n    Microsoft::WRL::ComPtr<ID3DBlob> codeBlob;\n    if (auto err = CompileFromShaderFile(shaderBytecode,\n            compileOptions.EntryPoint,\n            target,\n            compileOptions.CurrentDirectory,\n            (defines.empty() ? nullptr : defines.data()),\n            &codeBlob);\n        err != nullptr) {\n        return std::make_tuple(nullptr, errors::Wrap(std::move(err), \"CompileFromShaderFile() failed\"));\n    }\n\n    return std::make_tuple(std::move(codeBlob), nullptr);\n}\n\n} \/\/ namespace pomdog::gpu::detail::direct3d\n<commit_msg>Add missing using directive<commit_after>\/\/ Copyright mogemimi. Distributed under the MIT license.\n\n#include \"pomdog\/gpu\/direct3d\/hlsl_compiling.h\"\n#include \"pomdog\/basic\/conditional_compilation.h\"\n#include \"pomdog\/content\/utility\/binary_reader.h\"\n#include \"pomdog\/filesystem\/file_system.h\"\n#include \"pomdog\/gpu\/backends\/shader_bytecode.h\"\n#include \"pomdog\/gpu\/backends\/shader_compile_options.h\"\n#include \"pomdog\/platform\/win32\/prerequisites_win32.h\"\n#include \"pomdog\/utility\/assert.h\"\n#include \"pomdog\/utility\/errors.h\"\n#include \"pomdog\/utility\/path_helper.h\"\n\nPOMDOG_SUPPRESS_WARNINGS_GENERATED_BY_STD_HEADERS_BEGIN\n#include <fstream>\n#include <string>\n#include <utility>\n#include <vector>\nPOMDOG_SUPPRESS_WARNINGS_GENERATED_BY_STD_HEADERS_END\n\nusing pomdog::detail::BinaryReader;\n\nnamespace pomdog::gpu::detail::direct3d {\nnamespace {\n\n[[nodiscard]] std::string\nToString(const ShaderProfile& profile) noexcept\n{\n    std::string output;\n\n    switch (profile.PipelineStage) {\n    case ShaderPipelineStage::VertexShader:\n        output += \"vs_\";\n        break;\n    case ShaderPipelineStage::PixelShader:\n        output += \"ps_\";\n        break;\n    \/\/case ShaderPipelineStage::GeometryShader:\n    \/\/    output += \"gs_\";\n    \/\/    break;\n    \/\/case ShaderPipelineStage::DomainShader:\n    \/\/    output += \"ds_\";\n    \/\/    break;\n    \/\/case ShaderPipelineStage::ComputeShader:\n    \/\/    output += \"cs_\";\n    \/\/    break;\n    \/\/case ShaderPipelineStage::HullShader:\n    \/\/    output += \"hs_\";\n    \/\/    break;\n    }\n\n    output += std::to_string(profile.ShaderModel.Major);\n    output += '_';\n    output += std::to_string(profile.ShaderModel.Minor);\n    return output;\n}\n\nclass HLSLCodeInclude final : public ID3DInclude {\nprivate:\n    std::string currentDirectory;\n    std::vector<std::uint8_t> outputSource;\n    std::unique_ptr<Error> lastError;\n\npublic:\n    explicit HLSLCodeInclude(const std::string& curentDirectoryIn)\n        : currentDirectory(curentDirectoryIn)\n    {\n    }\n\n    HRESULT __stdcall Open(D3D_INCLUDE_TYPE includeType, LPCSTR pFileName, [[maybe_unused]] LPCVOID pParentData, LPCVOID* ppData, UINT* pBytes)\n    {\n        \/\/if (D3D10_INCLUDE_FORCE_DWORD == includeType) {\n        \/\/    return E_FAIL;\n        \/\/}\n\n        std::string includePath;\n        if (D3D_INCLUDE_LOCAL == includeType) {\n            includePath = PathHelper::Join(currentDirectory, pFileName);\n        }\n        else {\n            includePath = pFileName;\n        }\n\n        if (D3D_INCLUDE_LOCAL != includeType && D3D_INCLUDE_SYSTEM != includeType) {\n            return E_FAIL;\n        }\n\n#if 0\n#if defined(DEBUG) && !defined(NDEBUG)\n        if (D3D_INCLUDE_LOCAL == includeType) {\n            Log::Internal(\"ShaderInclude: Local\");\n        }\n        else if (D3D_INCLUDE_SYSTEM == includeType) {\n            Log::Internal(\"ShaderInclude: System\");\n        }\n        Log::Internal(StringHelper::Format(\"include shader file : %s\", includePath.c_str()));\n#endif\n#endif\n\n        std::ifstream stream{includePath, std::ifstream::binary};\n\n        if (!stream) {\n            lastError = errors::New(\"Could not find a shader source file: \" + includePath);\n            return E_FAIL;\n        }\n\n        auto [size, err] = FileSystem::GetFileSize(includePath);\n        if (err != nullptr) {\n            lastError = errors::New(\"failed to get file size: \" + includePath);\n            return E_FAIL;\n        }\n\n        if (size <= 0) {\n            lastError = errors::New(\"The file is too small: \" + includePath);\n            return E_FAIL;\n        }\n\n        outputSource = BinaryReader::ReadArray<std::uint8_t>(stream, size);\n\n        *ppData = outputSource.data();\n        *pBytes = static_cast<UINT>(outputSource.size());\n\n        return S_OK;\n    }\n\n    HRESULT __stdcall Close([[maybe_unused]] LPCVOID pData)\n    {\n        outputSource.clear();\n        return S_OK;\n    }\n\n    std::unique_ptr<Error>\n    MoveLastError() noexcept\n    {\n        return std::move(lastError);\n    }\n};\n\n[[nodiscard]] std::unique_ptr<Error>\nCompileFromShaderFile(\n    const ShaderBytecode& shaderBytecode,\n    const std::string& entrypoint,\n    const std::string& shaderProfile,\n    const std::string& currentDirectory,\n    const D3D_SHADER_MACRO* preprocessorMacros,\n    ID3DBlob** ppBlobOut)\n{\n    POMDOG_ASSERT(shaderBytecode.Code != nullptr);\n    POMDOG_ASSERT(shaderBytecode.ByteLength > 0);\n\n    DWORD shaderFlags = D3DCOMPILE_ENABLE_STRICTNESS;\n#if defined(DEBUG) && !defined(NDEBUG)\n    shaderFlags |= D3DCOMPILE_DEBUG;\n#endif\n\n    HLSLCodeInclude shaderInclude(currentDirectory);\n    Microsoft::WRL::ComPtr<ID3DBlob> errorBlob;\n\n    const auto hr = ::D3DCompile(\n        shaderBytecode.Code,\n        shaderBytecode.ByteLength,\n        nullptr,\n        preprocessorMacros,\n        &shaderInclude,\n        entrypoint.c_str(),\n        shaderProfile.c_str(),\n        shaderFlags,\n        0,\n        ppBlobOut,\n        &errorBlob);\n\n    if (auto err = shaderInclude.MoveLastError(); err != nullptr) {\n        return errors::Wrap(std::move(err), \"failed to compile shader\");\n    }\n\n    if (FAILED(hr)) {\n        if (errorBlob != nullptr) {\n            std::string str(reinterpret_cast<LPCSTR>(errorBlob->GetBufferPointer()), errorBlob->GetBufferSize());\n            return errors::New(\"failed to compile shader. error: \" + str);\n        }\n        return errors::New(\"D3DCompile() failed. HRESULT = \" + std::to_string(hr));\n    }\n\n    if (errorBlob != nullptr) {\n        std::string str(reinterpret_cast<LPCSTR>(errorBlob->GetBufferPointer()), errorBlob->GetBufferSize());\n        return errors::New(\"warning: \" + str);\n    }\n\n    return nullptr;\n}\n\n} \/\/ namespace\n\nstd::tuple<Microsoft::WRL::ComPtr<ID3DBlob>, std::unique_ptr<Error>>\nCompileHLSL(\n    const ShaderBytecode& shaderBytecode,\n    const ShaderCompileOptions& compileOptions) noexcept\n{\n    const auto target = ToString(compileOptions.Profile);\n    POMDOG_ASSERT(!target.empty());\n\n    std::vector<D3D_SHADER_MACRO> defines;\n    defines.reserve(compileOptions.PreprocessorMacros.size());\n\n    for (auto& macro : compileOptions.PreprocessorMacros) {\n        if (macro.Name.empty()) {\n            return std::make_tuple(nullptr, errors::New(\"macro.Name is empty\"));\n        }\n\n        D3D_SHADER_MACRO shaderMacro;\n        shaderMacro.Name = macro.Name.c_str();\n        shaderMacro.Definition = macro.Definition.empty() ? nullptr : macro.Definition.c_str();\n        defines.push_back(std::move(shaderMacro));\n    }\n\n    if (!defines.empty()) {\n        D3D_SHADER_MACRO shaderMacro;\n        shaderMacro.Name = nullptr;\n        shaderMacro.Definition = nullptr;\n        defines.push_back(std::move(shaderMacro));\n    }\n\n    Microsoft::WRL::ComPtr<ID3DBlob> codeBlob;\n    if (auto err = CompileFromShaderFile(shaderBytecode,\n            compileOptions.EntryPoint,\n            target,\n            compileOptions.CurrentDirectory,\n            (defines.empty() ? nullptr : defines.data()),\n            &codeBlob);\n        err != nullptr) {\n        return std::make_tuple(nullptr, errors::Wrap(std::move(err), \"CompileFromShaderFile() failed\"));\n    }\n\n    return std::make_tuple(std::move(codeBlob), nullptr);\n}\n\n} \/\/ namespace pomdog::gpu::detail::direct3d\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n\n  publish.cc - redis publisher class\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#include <sys\/time.h>\n#include <unistd.h>\n#include <iostream>\n#include <exception>\n#include <string.h>\n#include <memory>\n#include <ts\/ts.h>\n#include \"common.h\"\n#include \"publisher.h\"\n#include \"Config.h\"\n#include \"redis_auth.h\"\n\nvoid *\nRedisPublisher::start_worker_thread(void *arg)\n{\n  RedisPublisher *publisher = static_cast<RedisPublisher *>(arg);\n  publisher->runWorker();\n  return arg;\n}\n\nRedisPublisher::RedisPublisher(const std::string &conf)\n  : m_redisEndpointsStr(cDefaultRedisEndpoint),\n    m_endpointIndex(0),\n    m_numWorkers(cPubNumWorkerThreads),\n    m_redisConnectTimeout(cDefaultRedisConnectTimeout),\n    m_redisConnectTries(cDefaultRedisConnectTries),\n    m_redisPublishTries(cDefaultRedisPublishTries),\n    m_redisRetryDelay(cDefaultRedisRetryDelay),\n    m_maxQueuedMessages(cDefaultMaxQueuedMessages),\n    err(false)\n{\n  if (Config::getSingleton().loadConfig(conf)) {\n    Config::getSingleton().getValue(\"pubconfig\", \"PubNumWorkers\", m_numWorkers);\n    Config::getSingleton().getValue(\"redis\", \"RedisEndpoints\", m_redisEndpointsStr);\n    Config::getSingleton().getValue(\"redis\", \"RedisConnectTimeout\", m_redisConnectTimeout);\n    Config::getSingleton().getValue(\"pubconfig\", \"PubRedisPublishTries\", m_redisPublishTries);\n    Config::getSingleton().getValue(\"pubconfig\", \"PubRedisConnectTries\", m_redisConnectTries);\n    Config::getSingleton().getValue(\"redis\", \"RedisRetryDelay\", m_redisRetryDelay);\n    Config::getSingleton().getValue(\"pubconfig\", \"PubMaxQueuedMessages\", m_maxQueuedMessages);\n    Config::getSingleton().getValue(\"redis\", \"RedisConnectTimeout\", m_poolRedisConnectTimeout);\n  }\n\n  \/\/ get our psk to access session_reuse redis network.\n  char redis_auth_key[MAX_REDIS_KEYSIZE];\n  if (!(get_redis_auth_key(redis_auth_key, MAX_REDIS_KEYSIZE))) {\n    err = true;\n    TSError(\"RedisPublisher::RedisPublisher.Cannot get redis AUTH password.\");\n    redis_passwd.clear();\n  } else {\n    redis_passwd = redis_auth_key;\n    memset(redis_auth_key, 0, MAX_REDIS_KEYSIZE); \/\/ tidy up our stack\n  }\n\n  addto_endpoint_vector(m_redisEndpoints, m_redisEndpointsStr);\n\n  TSDebug(PLUGIN, \"RedisPublisher::RedisPublisher.NumWorkers= %d RedisConnectTimeout=%d\", m_numWorkers, m_redisConnectTimeout);\n  TSDebug(PLUGIN,\n          \"RedisPublisher::RedisPublisher.RedisPublishTries= %d RedisConnectTries=%d RedisRetryDelay=%d MaxQueuedMessages=%d\",\n          m_redisPublishTries, m_redisConnectTries, m_redisRetryDelay, m_maxQueuedMessages);\n\n  TSDebug(PLUGIN, \"RedisPublisher::RedisPublisher.Redis Publish endpoints are as follows:\");\n  for (std::vector<RedisEndpoint>::iterator it = m_redisEndpoints.begin(); it != m_redisEndpoints.end(); ++it) {\n    \/\/ LOGDEBUG(PUB, *it);\n    simple_pool *pool = simple_pool::create(it->m_hostname, it->m_port, m_poolRedisConnectTimeout);\n    pools.push_back(pool);\n  }\n\n  TSDebug(PLUGIN, \"RedisPublisher::RedisPublisher.PoolRedisConnectTimeout= %d\", m_poolRedisConnectTimeout);\n\n  ::sem_init(&m_workerSem, 0, 0);\n\n  if (m_redisEndpoints.size() > m_numWorkers) {\n    err = true;\n    TSError(\"RedisPublisher::RedisPublisher.Number of threads in the thread pool less than the number of redis endpoints\");\n  }\n\n  if (!err) {\n    for (int i = 0; i < static_cast<int>(m_numWorkers); i++) {\n      TSThreadCreate(RedisPublisher::start_worker_thread, static_cast<void *>(this));\n    }\n  }\n}\n\nbool\nRedisPublisher::is_good()\n{\n  return !err;\n}\n\n::redisContext *\nRedisPublisher::setup_connection(const RedisEndpoint &re)\n{\n  ::pthread_t my_id = ::pthread_self();\n  TSDebug(PLUGIN, \"RedisPublisher::setup_connection.called by threadId: %d\", static_cast<int>(my_id));\n\n  RedisContextPtr my_context;\n  struct ::timeval timeout;\n  timeout.tv_sec  = m_redisConnectTimeout \/ 1000;\n  timeout.tv_usec = (m_redisConnectTimeout % 1000) * 1000;\n\n  for (int i = 0; i < static_cast<int>(m_redisConnectTries); ++i) {\n    my_context.reset(::redisConnectWithTimeout(re.m_hostname.c_str(), re.m_port, timeout));\n    if (!my_context) {\n      TSError(\"RedisPublisher::setup_connection.connect to host: %s and port: %d fail count: %d threadId: %d\",\n              re.m_hostname.c_str(), re.m_port, i + 1, static_cast<int>(my_id));\n    } else if (my_context->err) {\n      TSError(\"RedisPublisher::setup_connection.connect to host: %s port: %d fail count: %d and threadId: %d\",\n              re.m_hostname.c_str(), re.m_port, i + 1, static_cast<int>(my_id));\n      my_context.reset(nullptr);\n    } else {\n      TSDebug(PLUGIN, \"RedisPublisher::setup_connection.threadId: %d  successfully connected to the redis instance\",\n              static_cast<int>(my_id));\n\n      redisReply *reply = static_cast<redisReply *>(redisCommand(my_context.get(), \"AUTH %s\", redis_passwd.c_str()));\n\n      if (reply == nullptr) {\n        TSError(\"RedisPublisher::setup_connection. Cannot AUTH redis server, no reply.\");\n        my_context.reset(nullptr);\n      } else if (reply->type == REDIS_REPLY_ERROR) {\n        TSError(\"RedisPublisher::setup_connection. Cannot AUTH redis server, error reply.\");\n        freeReplyObject(reply);\n        my_context.reset(nullptr);\n      } else {\n        TSDebug(PLUGIN, \"RedisPublisher::setup_connection. Successfully AUTH redis server.\");\n        freeReplyObject(reply);\n      }\n      break;\n    }\n\n    TSError(\"RedisPublisher::setup_connection.connect failed.will wait for: %d microseconds and try again.\", m_redisRetryDelay);\n    ::usleep(m_redisRetryDelay);\n  }\n\n  return my_context.release();\n}\n\n::redisReply *\nRedisPublisher::send_publish(RedisContextPtr &ctx, const RedisEndpoint &re, const Message &msg)\n{\n  ::pthread_t my_id = ::pthread_self();\n  TSDebug(PLUGIN, \"RedisPublisher::send_publish.called by threadId: %d\", static_cast<int>(my_id));\n\n  ::redisReply *current_reply(nullptr);\n\n  for (int i = 0; i < static_cast<int>(m_redisPublishTries); ++i) {\n    if (!ctx) {\n      ctx.reset(setup_connection(re));\n\n      if (!ctx) {\n        TSError(\"RedisPublisher::send_publish.Unable to setup a connection to the redis server: %s:%d .ThreadId: %d Try: %d\",\n                re.m_hostname.c_str(), re.m_port, static_cast<int>(my_id), (i + 1));\n        continue;\n      }\n    }\n\n    current_reply = static_cast<redisReply *>(::redisCommand(ctx.get(), \"PUBLISH %s %s\", msg.channel.c_str(), msg.data.c_str()));\n    if (!current_reply) {\n      TSError(\"RedisPublisher::send_publish.Unable to get a reply from the server for publish.ThreadId: %d Try: %d\",\n              static_cast<int>(my_id), (i + 1));\n      ctx.reset(nullptr); \/\/ Clean up previous attempt\n\n    } else if (REDIS_REPLY_ERROR == current_reply->type) {\n      TSError(\"RedisPublisher::send_publish.Server responded with error for publish.ThreadId: %d Try: %d\", static_cast<int>(my_id),\n              i + 1);\n      clear_reply(current_reply);\n      current_reply = nullptr;\n      ctx.reset(nullptr); \/\/ Clean up previous attempt\n    } else {\n      break;\n    }\n  }\n\n  return current_reply;\n}\n\nvoid\nRedisPublisher::clear_reply(::redisReply *reply)\n{\n  if (reply) {\n    ::freeReplyObject(reply);\n  }\n}\n\nvoid\nRedisPublisher::runWorker()\n{\n  m_endpointIndexMutex.lock();\n  RedisEndpoint &my_endpoint(m_redisEndpoints[m_endpointIndex]);\n\n  if (static_cast<int>(m_redisEndpoints.size() - 1) == m_endpointIndex) {\n    m_endpointIndex = 0;\n  } else {\n    ++m_endpointIndex;\n  }\n  m_endpointIndexMutex.unlock();\n\n  ::pthread_t my_id = ::pthread_self();\n  RedisContextPtr my_context;\n  ::redisReply *current_reply(nullptr);\n\n  while (true) {\n    ::sem_post(&m_workerSem);\n    int readyWorkers = 0;\n    ::sem_getvalue(&m_workerSem, &readyWorkers);\n\n    \/\/ LOGDEBUG(PUB, \"RedisPublisher::runWorker.Ready worker count: \" << readyWorkers);\n\n    m_messageQueueMutex.lock();\n\n    if (m_messageQueue.empty()) {\n      ::sem_wait(&m_workerSem);\n      m_messageQueueMutex.unlock();\n      usleep(1000);\n      continue;\n    }\n\n    Message &current_message(m_messageQueue.front());\n\n    m_messageQueueMutex.unlock();\n    ::sem_wait(&m_workerSem);\n\n    if (current_message.cleanup) {\n      TSDebug(PLUGIN, \"RedisPublisher::runWorker.Thread id: %d received the cleanup message. exiting!\", static_cast<int>(my_id));\n      break;\n    }\n    current_reply = send_publish(my_context, my_endpoint, current_message);\n\n    if (!current_reply) {\n      current_message.hosts_tried.insert(my_endpoint);\n      if (current_message.hosts_tried.size() < m_redisEndpoints.size()) {\n        \/\/ all endpoints are not tried\n        \/\/ someone else might be able to transmit\n        m_messageQueueMutex.lock();\n\n        if (!m_messageQueue.front().cleanup) {\n          m_messageQueue.push_front(current_message);\n        }\n\n        m_messageQueueMutex.unlock();\n      }\n    }\n\n    if (!current_message.cleanup) {\n      m_messageQueue.pop_front();\n    }\n\n    clear_reply(current_reply);\n    current_reply = nullptr;\n  }\n  my_context.reset(nullptr);\n  clear_reply(current_reply);\n\n  ::pthread_exit(nullptr);\n}\n\nint\nRedisPublisher::publish(const std::string &channel, const std::string &data)\n{\n  TSDebug(PLUGIN, \"RedisPublisher::publish.Publish request for channel: %s and message: \\\"%s\\\" received\", channel.c_str(),\n          data.c_str());\n\n  m_messageQueueMutex.lock();\n\n  m_messageQueue.emplace_back(channel, data);\n\n  if (m_maxQueuedMessages < m_messageQueue.size()) {\n    m_messageQueue.pop_front();\n  }\n  m_messageQueueMutex.unlock();\n\n  return SUCCESS;\n}\n\nint\nRedisPublisher::signal_cleanup()\n{\n  TSDebug(PLUGIN, \"RedisPublisher::signal_cleanup.called\");\n  Message cleanup_message(\"\", \"\", true);\n\n  m_messageQueueMutex.lock();\n\n  m_messageQueue.push_front(cleanup_message); \/\/ highest priority\n\n  m_messageQueueMutex.unlock();\n\n  return SUCCESS;\n}\n\nRedisPublisher::~RedisPublisher()\n{\n  TSDebug(PLUGIN, \"RedisPublisher::~RedisPublisher.called\");\n  RedisPublisher::signal_cleanup();\n\n  ::sem_destroy(&m_workerSem);\n}\n\nstd::string\nRedisPublisher::get_session(const std::string &channel)\n{\n  TSDebug(PLUGIN, \"RedisPublisher::get_session. Called by threadId: %d\", static_cast<int>(pthread_self()));\n  std::string ret;\n  uint32_t index    = get_hash_index(channel);\n  redisReply *reply = nullptr;\n  TSDebug(PLUGIN, \"RedisPublisher::get_session. Start to try to get session.\");\n  for (uint32_t i = 0; i < m_redisEndpoints.size(); i++) {\n    connection *conn = pools[index]->get();\n\n    if (conn) {\n      reply = static_cast<redisReply *>(redisCommand(conn->c_ptr(), \"GET %s\", channel.c_str()));\n      if (reply && reply->type == REDIS_REPLY_STRING) {\n        TSDebug(PLUGIN, \"RedisPublisher::get_session. Success to GET a value from redis server index: %d\", index);\n        pools[index]->put(conn);\n        ret = reply->str;\n        clear_reply(reply);\n        return ret;\n      }\n      pools[index]->put(conn);\n      clear_reply(reply);\n    }\n    TSError(\"RedisPublisher::get_session. Fail to GET a value from this redis server index: %d\", index);\n    index = get_next_index(index);\n    TSDebug(PLUGIN, \"RedisPublisher::get_session. Will try the next redis server: %d\", index);\n  }\n\n  TSError(\"RedisPublisher::get_session. Fail to GET a value from all redis servers!\");\n  return ret;\n}\n\nredisReply *\nRedisPublisher::set_session(const Message &msg)\n{\n  TSDebug(PLUGIN, \"RedisPublisher::set_session. Called by threadId: %d\", static_cast<int>(pthread_self()));\n  uint32_t index    = get_hash_index(msg.channel);\n  redisReply *reply = nullptr;\n  for (uint32_t i = 0; i < m_redisEndpoints.size(); i++) {\n    connection *conn = pools[index]->get();\n\n    if (conn) {\n      reply = static_cast<redisReply *>(redisCommand(conn->c_ptr(), \"SET %s %s\", msg.channel.c_str(), msg.data.c_str()));\n      if (reply && reply->type == REDIS_REPLY_STATUS && strcasecmp(reply->str, \"OK\") == 0) {\n        TSDebug(PLUGIN, \"RedisPublisher::set_session. Success to SET a value to redis server: %s:%d\",\n                m_redisEndpoints[index].m_hostname.c_str(), m_redisEndpoints[index].m_port);\n        pools[index]->put(conn);\n        return reply;\n      }\n      pools[index]->put(conn);\n      clear_reply(reply);\n    }\n    TSError(\"RedisPublisher::set_session. Fail to SET a value to this redis server %s:%d\",\n            m_redisEndpoints[index].m_hostname.c_str(), m_redisEndpoints[index].m_port);\n\n    index = get_next_index(index);\n    TSDebug(PLUGIN, \"RedisPublisher::set_session. Will try the next redis server: %s:%d\",\n            m_redisEndpoints[index].m_hostname.c_str(), m_redisEndpoints[index].m_port);\n  }\n\n  TSError(\"RedisPublisher::set_session. Fail to SET a value to all redis servers!\");\n  return nullptr;\n}\n<commit_msg>pop messages<commit_after>\/** @file\n\n  publish.cc - redis publisher class\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#include <sys\/time.h>\n#include <unistd.h>\n#include <iostream>\n#include <exception>\n#include <string.h>\n#include <memory>\n#include <ts\/ts.h>\n#include \"common.h\"\n#include \"publisher.h\"\n#include \"Config.h\"\n#include \"redis_auth.h\"\n\nvoid *\nRedisPublisher::start_worker_thread(void *arg)\n{\n  RedisPublisher *publisher = static_cast<RedisPublisher *>(arg);\n  publisher->runWorker();\n  return arg;\n}\n\nRedisPublisher::RedisPublisher(const std::string &conf)\n  : m_redisEndpointsStr(cDefaultRedisEndpoint),\n    m_endpointIndex(0),\n    m_numWorkers(cPubNumWorkerThreads),\n    m_redisConnectTimeout(cDefaultRedisConnectTimeout),\n    m_redisConnectTries(cDefaultRedisConnectTries),\n    m_redisPublishTries(cDefaultRedisPublishTries),\n    m_redisRetryDelay(cDefaultRedisRetryDelay),\n    m_maxQueuedMessages(cDefaultMaxQueuedMessages),\n    err(false)\n{\n  if (Config::getSingleton().loadConfig(conf)) {\n    Config::getSingleton().getValue(\"pubconfig\", \"PubNumWorkers\", m_numWorkers);\n    Config::getSingleton().getValue(\"redis\", \"RedisEndpoints\", m_redisEndpointsStr);\n    Config::getSingleton().getValue(\"redis\", \"RedisConnectTimeout\", m_redisConnectTimeout);\n    Config::getSingleton().getValue(\"pubconfig\", \"PubRedisPublishTries\", m_redisPublishTries);\n    Config::getSingleton().getValue(\"pubconfig\", \"PubRedisConnectTries\", m_redisConnectTries);\n    Config::getSingleton().getValue(\"redis\", \"RedisRetryDelay\", m_redisRetryDelay);\n    Config::getSingleton().getValue(\"pubconfig\", \"PubMaxQueuedMessages\", m_maxQueuedMessages);\n    Config::getSingleton().getValue(\"redis\", \"RedisConnectTimeout\", m_poolRedisConnectTimeout);\n  }\n\n  \/\/ get our psk to access session_reuse redis network.\n  char redis_auth_key[MAX_REDIS_KEYSIZE];\n  if (!(get_redis_auth_key(redis_auth_key, MAX_REDIS_KEYSIZE))) {\n    err = true;\n    TSError(\"RedisPublisher::RedisPublisher.Cannot get redis AUTH password.\");\n    redis_passwd.clear();\n  } else {\n    redis_passwd = redis_auth_key;\n    memset(redis_auth_key, 0, MAX_REDIS_KEYSIZE); \/\/ tidy up our stack\n  }\n\n  addto_endpoint_vector(m_redisEndpoints, m_redisEndpointsStr);\n\n  TSDebug(PLUGIN, \"RedisPublisher::RedisPublisher.NumWorkers= %d RedisConnectTimeout=%d\", m_numWorkers, m_redisConnectTimeout);\n  TSDebug(PLUGIN,\n          \"RedisPublisher::RedisPublisher.RedisPublishTries= %d RedisConnectTries=%d RedisRetryDelay=%d MaxQueuedMessages=%d\",\n          m_redisPublishTries, m_redisConnectTries, m_redisRetryDelay, m_maxQueuedMessages);\n\n  TSDebug(PLUGIN, \"RedisPublisher::RedisPublisher.Redis Publish endpoints are as follows:\");\n  for (std::vector<RedisEndpoint>::iterator it = m_redisEndpoints.begin(); it != m_redisEndpoints.end(); ++it) {\n    \/\/ LOGDEBUG(PUB, *it);\n    simple_pool *pool = simple_pool::create(it->m_hostname, it->m_port, m_poolRedisConnectTimeout);\n    pools.push_back(pool);\n  }\n\n  TSDebug(PLUGIN, \"RedisPublisher::RedisPublisher.PoolRedisConnectTimeout= %d\", m_poolRedisConnectTimeout);\n\n  ::sem_init(&m_workerSem, 0, 0);\n\n  if (m_redisEndpoints.size() > m_numWorkers) {\n    err = true;\n    TSError(\"RedisPublisher::RedisPublisher.Number of threads in the thread pool less than the number of redis endpoints\");\n  }\n\n  if (!err) {\n    for (int i = 0; i < static_cast<int>(m_numWorkers); i++) {\n      TSThreadCreate(RedisPublisher::start_worker_thread, static_cast<void *>(this));\n    }\n  }\n}\n\nbool\nRedisPublisher::is_good()\n{\n  return !err;\n}\n\n::redisContext *\nRedisPublisher::setup_connection(const RedisEndpoint &re)\n{\n  ::pthread_t my_id = ::pthread_self();\n  TSDebug(PLUGIN, \"RedisPublisher::setup_connection.called by threadId: %d\", static_cast<int>(my_id));\n\n  RedisContextPtr my_context;\n  struct ::timeval timeout;\n  timeout.tv_sec  = m_redisConnectTimeout \/ 1000;\n  timeout.tv_usec = (m_redisConnectTimeout % 1000) * 1000;\n\n  for (int i = 0; i < static_cast<int>(m_redisConnectTries); ++i) {\n    my_context.reset(::redisConnectWithTimeout(re.m_hostname.c_str(), re.m_port, timeout));\n    if (!my_context) {\n      TSError(\"RedisPublisher::setup_connection.connect to host: %s and port: %d fail count: %d threadId: %d\",\n              re.m_hostname.c_str(), re.m_port, i + 1, static_cast<int>(my_id));\n    } else if (my_context->err) {\n      TSError(\"RedisPublisher::setup_connection.connect to host: %s port: %d fail count: %d and threadId: %d\",\n              re.m_hostname.c_str(), re.m_port, i + 1, static_cast<int>(my_id));\n      my_context.reset(nullptr);\n    } else {\n      TSDebug(PLUGIN, \"RedisPublisher::setup_connection.threadId: %d  successfully connected to the redis instance\",\n              static_cast<int>(my_id));\n\n      redisReply *reply = static_cast<redisReply *>(redisCommand(my_context.get(), \"AUTH %s\", redis_passwd.c_str()));\n\n      if (reply == nullptr) {\n        TSError(\"RedisPublisher::setup_connection. Cannot AUTH redis server, no reply.\");\n        my_context.reset(nullptr);\n      } else if (reply->type == REDIS_REPLY_ERROR) {\n        TSError(\"RedisPublisher::setup_connection. Cannot AUTH redis server, error reply.\");\n        freeReplyObject(reply);\n        my_context.reset(nullptr);\n      } else {\n        TSDebug(PLUGIN, \"RedisPublisher::setup_connection. Successfully AUTH redis server.\");\n        freeReplyObject(reply);\n      }\n      break;\n    }\n\n    TSError(\"RedisPublisher::setup_connection.connect failed.will wait for: %d microseconds and try again.\", m_redisRetryDelay);\n    ::usleep(m_redisRetryDelay);\n  }\n\n  return my_context.release();\n}\n\n::redisReply *\nRedisPublisher::send_publish(RedisContextPtr &ctx, const RedisEndpoint &re, const Message &msg)\n{\n  ::pthread_t my_id = ::pthread_self();\n  TSDebug(PLUGIN, \"RedisPublisher::send_publish.called by threadId: %d\", static_cast<int>(my_id));\n\n  ::redisReply *current_reply(nullptr);\n\n  for (int i = 0; i < static_cast<int>(m_redisPublishTries); ++i) {\n    if (!ctx) {\n      ctx.reset(setup_connection(re));\n\n      if (!ctx) {\n        TSError(\"RedisPublisher::send_publish.Unable to setup a connection to the redis server: %s:%d .ThreadId: %d Try: %d\",\n                re.m_hostname.c_str(), re.m_port, static_cast<int>(my_id), (i + 1));\n        continue;\n      }\n    }\n\n    current_reply = static_cast<redisReply *>(::redisCommand(ctx.get(), \"PUBLISH %s %s\", msg.channel.c_str(), msg.data.c_str()));\n    if (!current_reply) {\n      TSError(\"RedisPublisher::send_publish.Unable to get a reply from the server for publish.ThreadId: %d Try: %d\",\n              static_cast<int>(my_id), (i + 1));\n      ctx.reset(nullptr); \/\/ Clean up previous attempt\n\n    } else if (REDIS_REPLY_ERROR == current_reply->type) {\n      TSError(\"RedisPublisher::send_publish.Server responded with error for publish.ThreadId: %d Try: %d\", static_cast<int>(my_id),\n              i + 1);\n      clear_reply(current_reply);\n      current_reply = nullptr;\n      ctx.reset(nullptr); \/\/ Clean up previous attempt\n    } else {\n      break;\n    }\n  }\n\n  return current_reply;\n}\n\nvoid\nRedisPublisher::clear_reply(::redisReply *reply)\n{\n  if (reply) {\n    ::freeReplyObject(reply);\n  }\n}\n\nvoid\nRedisPublisher::runWorker()\n{\n  m_endpointIndexMutex.lock();\n  RedisEndpoint &my_endpoint(m_redisEndpoints[m_endpointIndex]);\n\n  if (static_cast<int>(m_redisEndpoints.size() - 1) == m_endpointIndex) {\n    m_endpointIndex = 0;\n  } else {\n    ++m_endpointIndex;\n  }\n  m_endpointIndexMutex.unlock();\n\n  ::pthread_t my_id = ::pthread_self();\n  RedisContextPtr my_context;\n  ::redisReply *current_reply(nullptr);\n\n  while (true) {\n    ::sem_post(&m_workerSem);\n    int readyWorkers = 0;\n    ::sem_getvalue(&m_workerSem, &readyWorkers);\n\n    \/\/ LOGDEBUG(PUB, \"RedisPublisher::runWorker.Ready worker count: \" << readyWorkers);\n\n    m_messageQueueMutex.lock();\n\n    if (m_messageQueue.empty()) {\n      ::sem_wait(&m_workerSem);\n      m_messageQueueMutex.unlock();\n      usleep(1000);\n      continue;\n    }\n\n    Message &current_message(m_messageQueue.front());\n    if (!current_message.cleanup) {\n      m_messageQueue.pop_front();\n    }\n\n    m_messageQueueMutex.unlock();\n    ::sem_wait(&m_workerSem);\n\n    if (current_message.cleanup) {\n      TSDebug(PLUGIN, \"RedisPublisher::runWorker.Thread id: %d received the cleanup message. exiting!\", static_cast<int>(my_id));\n      break;\n    }\n    current_reply = send_publish(my_context, my_endpoint, current_message);\n\n    if (!current_reply) {\n      current_message.hosts_tried.insert(my_endpoint);\n      if (current_message.hosts_tried.size() < m_redisEndpoints.size()) {\n        \/\/ all endpoints are not tried\n        \/\/ someone else might be able to transmit\n        m_messageQueueMutex.lock();\n\n        if (!m_messageQueue.front().cleanup) {\n          m_messageQueue.push_front(current_message);\n        }\n\n        m_messageQueueMutex.unlock();\n      }\n    }\n\n    clear_reply(current_reply);\n    current_reply = nullptr;\n  }\n  my_context.reset(nullptr);\n  clear_reply(current_reply);\n\n  ::pthread_exit(nullptr);\n}\n\nint\nRedisPublisher::publish(const std::string &channel, const std::string &data)\n{\n  TSDebug(PLUGIN, \"RedisPublisher::publish.Publish request for channel: %s and message: \\\"%s\\\" received\", channel.c_str(),\n          data.c_str());\n\n  m_messageQueueMutex.lock();\n\n  m_messageQueue.emplace_back(channel, data);\n\n  if (m_maxQueuedMessages < m_messageQueue.size()) {\n    m_messageQueue.pop_front();\n  }\n  m_messageQueueMutex.unlock();\n\n  return SUCCESS;\n}\n\nint\nRedisPublisher::signal_cleanup()\n{\n  TSDebug(PLUGIN, \"RedisPublisher::signal_cleanup.called\");\n  Message cleanup_message(\"\", \"\", true);\n\n  m_messageQueueMutex.lock();\n\n  m_messageQueue.push_front(cleanup_message); \/\/ highest priority\n\n  m_messageQueueMutex.unlock();\n\n  return SUCCESS;\n}\n\nRedisPublisher::~RedisPublisher()\n{\n  TSDebug(PLUGIN, \"RedisPublisher::~RedisPublisher.called\");\n  RedisPublisher::signal_cleanup();\n\n  ::sem_destroy(&m_workerSem);\n}\n\nstd::string\nRedisPublisher::get_session(const std::string &channel)\n{\n  TSDebug(PLUGIN, \"RedisPublisher::get_session. Called by threadId: %d\", static_cast<int>(pthread_self()));\n  std::string ret;\n  uint32_t index    = get_hash_index(channel);\n  redisReply *reply = nullptr;\n  TSDebug(PLUGIN, \"RedisPublisher::get_session. Start to try to get session.\");\n  for (uint32_t i = 0; i < m_redisEndpoints.size(); i++) {\n    connection *conn = pools[index]->get();\n\n    if (conn) {\n      reply = static_cast<redisReply *>(redisCommand(conn->c_ptr(), \"GET %s\", channel.c_str()));\n      if (reply && reply->type == REDIS_REPLY_STRING) {\n        TSDebug(PLUGIN, \"RedisPublisher::get_session. Success to GET a value from redis server index: %d\", index);\n        pools[index]->put(conn);\n        ret = reply->str;\n        clear_reply(reply);\n        return ret;\n      }\n      pools[index]->put(conn);\n      clear_reply(reply);\n    }\n    TSError(\"RedisPublisher::get_session. Fail to GET a value from this redis server index: %d\", index);\n    index = get_next_index(index);\n    TSDebug(PLUGIN, \"RedisPublisher::get_session. Will try the next redis server: %d\", index);\n  }\n\n  TSError(\"RedisPublisher::get_session. Fail to GET a value from all redis servers!\");\n  return ret;\n}\n\nredisReply *\nRedisPublisher::set_session(const Message &msg)\n{\n  TSDebug(PLUGIN, \"RedisPublisher::set_session. Called by threadId: %d\", static_cast<int>(pthread_self()));\n  uint32_t index    = get_hash_index(msg.channel);\n  redisReply *reply = nullptr;\n  for (uint32_t i = 0; i < m_redisEndpoints.size(); i++) {\n    connection *conn = pools[index]->get();\n\n    if (conn) {\n      reply = static_cast<redisReply *>(redisCommand(conn->c_ptr(), \"SET %s %s\", msg.channel.c_str(), msg.data.c_str()));\n      if (reply && reply->type == REDIS_REPLY_STATUS && strcasecmp(reply->str, \"OK\") == 0) {\n        TSDebug(PLUGIN, \"RedisPublisher::set_session. Success to SET a value to redis server: %s:%d\",\n                m_redisEndpoints[index].m_hostname.c_str(), m_redisEndpoints[index].m_port);\n        pools[index]->put(conn);\n        return reply;\n      }\n      pools[index]->put(conn);\n      clear_reply(reply);\n    }\n    TSError(\"RedisPublisher::set_session. Fail to SET a value to this redis server %s:%d\",\n            m_redisEndpoints[index].m_hostname.c_str(), m_redisEndpoints[index].m_port);\n\n    index = get_next_index(index);\n    TSDebug(PLUGIN, \"RedisPublisher::set_session. Will try the next redis server: %s:%d\",\n            m_redisEndpoints[index].m_hostname.c_str(), m_redisEndpoints[index].m_port);\n  }\n\n  TSError(\"RedisPublisher::set_session. Fail to SET a value to all redis servers!\");\n  return nullptr;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"testing\/testing.hpp\"\n\n#include \"routing\/routing_integration_tests\/routing_test_tools.hpp\"\n\n#include \"..\/..\/indexer\/mercator.hpp\"\n\nusing namespace routing;\n\nnamespace\n{\n  \/\/ Restrictions tests. Check restrictions generation, if there are any errors.\n  UNIT_TEST(RestrictionTestNeatBaumanAndTTK)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n          integration::GetOsrmComponents(),\n          MercatorBounds::FromLatLon(55.77399, 37.68468), {0., 0.},\n          MercatorBounds::FromLatLon(55.77198, 37.68782), 900.);\n  }\n\n  UNIT_TEST(RestrictionTestNearMetroShodnenskaya)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n          integration::GetOsrmComponents(),\n          MercatorBounds::FromLatLon(55.85043, 37.43824), {0., 0.},\n          MercatorBounds::FromLatLon(55.85191, 37.43910), 510.\n          );\n  }\n\n  \/\/ Strange asserts near Cupertino test\n  UNIT_TEST(CaliforniaCupertinoFindPhantomAssertTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(37.33409, -122.03458), {0., 0.},\n        MercatorBounds::FromLatLon(37.33498, -122.03575), 1438.);\n  }\n\n  \/\/ ASSERT on pedestrian edges\n  UNIT_TEST(RussiaAssertHighwayClassOnPedestrianRouteInOSRM)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n          integration::GetOsrmComponents(),\n          MercatorBounds::FromLatLon(55.77787, 37.70405), {0., 0.},\n          MercatorBounds::FromLatLon(55.77682, 37.70391), 185.\n          );\n  }\n\n  \/\/ Geometry unpacking test.\n  UNIT_TEST(RussiaFerryToCrimeaLoadCrossGeometryTest)\n  {\n    \/\/ Forward\n    TRouteResult route = integration::CalculateRoute(\n                         integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.34123, 36.67679),\n                         {0., 0.}, MercatorBounds::FromLatLon(45.36479, 36.62194));\n    TEST_EQUAL(route.second, IRouter::NoError, ());\n    TEST_GREATER(route.first->GetPoly().GetSize(), 50, ());\n    \/\/ And backward case\n    route = integration::CalculateRoute(\n            integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.36479, 36.62194), {0., 0.},\n            MercatorBounds::FromLatLon(45.34123, 36.67679));\n    TEST_EQUAL(route.second, IRouter::NoError, ());\n    TEST_GREATER(route.first->GetPoly().GetSize(), 50, ());\n  }\n\n  UNIT_TEST(PriceIslandLoadCrossGeometryTest)\n  {\n    \/\/ Forward\n    TRouteResult route = integration::CalculateRoute(\n                         integration::GetOsrmComponents(), MercatorBounds::FromLatLon(46.16255,-63.81643),\n                         {0., 0.}, MercatorBounds::FromLatLon(46.25401, -63.70213));\n    TEST_EQUAL(route.second, IRouter::NoError, ());\n    TEST_GREATER(route.first->GetPoly().GetSize(), 29, ());\n    \/\/ And backward case\n    route = integration::CalculateRoute(\n            integration::GetOsrmComponents(), MercatorBounds::FromLatLon(46.25401, -63.70213), {0., 0.},\n            MercatorBounds::FromLatLon(46.16255,-63.81643));\n    TEST_EQUAL(route.second, IRouter::NoError, ());\n    TEST_GREATER(route.first->GetPoly().GetSize(), 29, ());\n  }\n\n  \/\/ Cross mwm tests.\n  UNIT_TEST(RussiaMoscowLeningradskiy39GerPanfilovtsev22RouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(integration::GetOsrmComponents(),\n                                                  {37.53758809983519, 67.536162466434234}, {0., 0.},\n                                                  {37.40993977728661, 67.644784047393685}, 14296.);\n  }\n\n  UNIT_TEST(RussiaMoscowGerPanfilovtsev22SolodchaPravdiRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), {37.409929478750627, 67.644798619710073}, {0., 0.},\n        {39.836562407458047, 65.774372510437971}, 239426.);\n  }\n\n  \/\/ TODO OSRM offers a possible turn to a pedestrian road in this test. It's fixing right now.\n  UNIT_TEST(UKRugbyStIvesRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), {-1.2653036222483705, 61.691304855049886}, {0., 0.},\n        {-5.4799407508360218, 58.242809563579847}, 455902.);\n  }\n\n  UNIT_TEST(RussiaMoscowLenigradskiy39ItalySienaCenterRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), {37.537596024929826, 67.536160359657288}, {0., 0.},\n        {11.327927635052676, 48.166256203616726}, 2870710.);\n  }\n\n  UNIT_TEST(RussiaMoscowFranceParisCenterRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(),\n        MercatorBounds::FromLatLon(55.75271, 37.62618), {0., 0.},\n        MercatorBounds::FromLatLon(48.86123, 2.34129), 2840940.);\n  }\n\n\/\/ @TODO This test is failed to create a route for the time being with data from 12.09.2015.\n\/\/ Now it's impossible to create a vehicle route from Paris to London.\n\/\/ The assumed reason is some tags of the tunnel were changed and we stop working with\n\/\/ the situation correctly.\n\/\/ At the same time OSRM manages to create routes through the tunnel.\n  UNIT_TEST(FranceParisCenternglandLondonCenterRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(),\n        MercatorBounds::FromLatLon(48.86123, 2.34129), {0., 0.},\n        MercatorBounds::FromLatLon(51.49884, -0.10438), 0.\/* Some unknown value*\/);\n  }\n\n  \/\/ Strange map edits in Africa borders. Routing not linked now.\n  \/*\n  UNIT_TEST(RussiaMoscowLenigradskiy39RepublicOfSouthAfricaCapeTownCenterRouteTest)\n  {\n    \/\/@todo put down a correct route length when router is fixed\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), {37.53754, 67.53622}, {0., 0.},\n        {18.54269, -36.09501}, 17873000.);\n  }*\/\n\n  UNIT_TEST(MoroccoToSahrawiCrossMwmTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(27.15587, -13.23059), {0., 0.},\n        MercatorBounds::FromLatLon(27.94049, -12.88800), 100864);\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(27.94049, -12.88800), {0., 0.},\n        MercatorBounds::FromLatLon(27.15587, -13.23059), 100864);\n  }\n\n  UNIT_TEST(ArbatBaliCrimeanCrossMwmTest)\n  {\n    \/\/ Forward case.\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.90668,34.87221), {0., 0.},\n        MercatorBounds::FromLatLon(45.35697, 35.36971), 75000.);\n    \/\/ Backward case.\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.35697, 35.36971), {0., 0.},\n        MercatorBounds::FromLatLon(45.90668,34.87221), 75000.);\n\n  }\n\n  UNIT_TEST(AlbaniaToMontenegroCrossTest)\n  {\n    \/\/ Road from Albania to Montenegro. Test turnaround finding at border (when start\/stop OSRM\n    \/\/ points are inside borders and one of segments has outside points).\n    \/\/ Forward\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(42.01535, 19.40044), {0., 0.},\n        MercatorBounds::FromLatLon(42.01201, 19.36286), 3674.);\n    \/\/ And backward case\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(42.01201, 19.36286), {0., 0.},\n        MercatorBounds::FromLatLon(42.01535, 19.40044), 3674.);\n  }\n\n  UNIT_TEST(CanadaBridgeCrossToEdwardIsland)\n  {\n    \/\/ Forward\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(46.13418, -63.84656), {0., 0.},\n        MercatorBounds::FromLatLon(46.26739,-63.63907), 23000.);\n    \/\/ And backward case\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(46.26739, -63.63907), {0., 0.},\n        MercatorBounds::FromLatLon(46.13418, -63.84656), 23000.);\n  }\n\n  UNIT_TEST(RussiaFerryToCrimea)\n  {\n    \/\/ Forward\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.38053, 36.73226), {0., 0.},\n        MercatorBounds::FromLatLon(45.36078, 36.60866), 13150.);\n    \/\/ And backward case\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.36078, 36.60866), {0., 0.},\n        MercatorBounds::FromLatLon(45.38053, 36.73226), 13110.);\n  }\n\n  UNIT_TEST(ParisCrossDestinationInForwardHeapCase)\n  {\n    \/\/ Forward\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(49.85015, 2.24296), {0., 0.},\n        MercatorBounds::FromLatLon(48.85860, 2.34784), 126000.);\n    \/\/ And backward case\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(48.85860, 2.34784), {0., 0.},\n        MercatorBounds::FromLatLon(49.85015, 2.24296), 126000.);\n  }\n\n  UNIT_TEST(RussiaSmolenskRussiaMoscowTimeTest)\n  {\n    TRouteResult const routeResult = integration::CalculateRoute(\n        integration::GetOsrmComponents(), {32.05489, 65.78463}, {0., 0.}, {37.60169, 67.45807});\n\n    Route const & route = *routeResult.first;\n    IRouter::ResultCode const result = routeResult.second;\n    TEST_EQUAL(result, IRouter::NoError, ());\n\n    integration::TestRouteTime(route, 17450.);\n  }\n\n  UNIT_TEST(RussiaMoscowLenigradskiy39GeroevPanfilovtsev22TimeTest)\n  {\n    TRouteResult const routeResult = integration::CalculateRoute(\n        integration::GetOsrmComponents(), {37.53804, 67.53647}, {0., 0.}, {37.40990, 67.64474});\n\n    Route const & route = *routeResult.first;\n    IRouter::ResultCode const result = routeResult.second;\n    TEST_EQUAL(result, IRouter::NoError, ());\n\n    integration::TestRouteTime(route, 910.);\n  }\n}  \/\/ namespace\n<commit_msg>Comment London ferry integration test.<commit_after>#include \"testing\/testing.hpp\"\n\n#include \"routing\/routing_integration_tests\/routing_test_tools.hpp\"\n\n#include \"..\/..\/indexer\/mercator.hpp\"\n\nusing namespace routing;\n\nnamespace\n{\n  \/\/ Restrictions tests. Check restrictions generation, if there are any errors.\n  UNIT_TEST(RestrictionTestNeatBaumanAndTTK)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n          integration::GetOsrmComponents(),\n          MercatorBounds::FromLatLon(55.77399, 37.68468), {0., 0.},\n          MercatorBounds::FromLatLon(55.77198, 37.68782), 900.);\n  }\n\n  UNIT_TEST(RestrictionTestNearMetroShodnenskaya)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n          integration::GetOsrmComponents(),\n          MercatorBounds::FromLatLon(55.85043, 37.43824), {0., 0.},\n          MercatorBounds::FromLatLon(55.85191, 37.43910), 510.\n          );\n  }\n\n  \/\/ Strange asserts near Cupertino test\n  UNIT_TEST(CaliforniaCupertinoFindPhantomAssertTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(37.33409, -122.03458), {0., 0.},\n        MercatorBounds::FromLatLon(37.33498, -122.03575), 1438.);\n  }\n\n  \/\/ ASSERT on pedestrian edges\n  UNIT_TEST(RussiaAssertHighwayClassOnPedestrianRouteInOSRM)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n          integration::GetOsrmComponents(),\n          MercatorBounds::FromLatLon(55.77787, 37.70405), {0., 0.},\n          MercatorBounds::FromLatLon(55.77682, 37.70391), 185.\n          );\n  }\n\n  \/\/ Geometry unpacking test.\n  UNIT_TEST(RussiaFerryToCrimeaLoadCrossGeometryTest)\n  {\n    \/\/ Forward\n    TRouteResult route = integration::CalculateRoute(\n                         integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.34123, 36.67679),\n                         {0., 0.}, MercatorBounds::FromLatLon(45.36479, 36.62194));\n    TEST_EQUAL(route.second, IRouter::NoError, ());\n    TEST_GREATER(route.first->GetPoly().GetSize(), 50, ());\n    \/\/ And backward case\n    route = integration::CalculateRoute(\n            integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.36479, 36.62194), {0., 0.},\n            MercatorBounds::FromLatLon(45.34123, 36.67679));\n    TEST_EQUAL(route.second, IRouter::NoError, ());\n    TEST_GREATER(route.first->GetPoly().GetSize(), 50, ());\n  }\n\n  UNIT_TEST(PriceIslandLoadCrossGeometryTest)\n  {\n    \/\/ Forward\n    TRouteResult route = integration::CalculateRoute(\n                         integration::GetOsrmComponents(), MercatorBounds::FromLatLon(46.16255,-63.81643),\n                         {0., 0.}, MercatorBounds::FromLatLon(46.25401, -63.70213));\n    TEST_EQUAL(route.second, IRouter::NoError, ());\n    TEST_GREATER(route.first->GetPoly().GetSize(), 29, ());\n    \/\/ And backward case\n    route = integration::CalculateRoute(\n            integration::GetOsrmComponents(), MercatorBounds::FromLatLon(46.25401, -63.70213), {0., 0.},\n            MercatorBounds::FromLatLon(46.16255,-63.81643));\n    TEST_EQUAL(route.second, IRouter::NoError, ());\n    TEST_GREATER(route.first->GetPoly().GetSize(), 29, ());\n  }\n\n  \/\/ Cross mwm tests.\n  UNIT_TEST(RussiaMoscowLeningradskiy39GerPanfilovtsev22RouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(integration::GetOsrmComponents(),\n                                                  {37.53758809983519, 67.536162466434234}, {0., 0.},\n                                                  {37.40993977728661, 67.644784047393685}, 14296.);\n  }\n\n  UNIT_TEST(RussiaMoscowGerPanfilovtsev22SolodchaPravdiRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), {37.409929478750627, 67.644798619710073}, {0., 0.},\n        {39.836562407458047, 65.774372510437971}, 239426.);\n  }\n\n  \/\/ TODO OSRM offers a possible turn to a pedestrian road in this test. It's fixing right now.\n  UNIT_TEST(UKRugbyStIvesRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), {-1.2653036222483705, 61.691304855049886}, {0., 0.},\n        {-5.4799407508360218, 58.242809563579847}, 455902.);\n  }\n\n  UNIT_TEST(RussiaMoscowLenigradskiy39ItalySienaCenterRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), {37.537596024929826, 67.536160359657288}, {0., 0.},\n        {11.327927635052676, 48.166256203616726}, 2870710.);\n  }\n\n  UNIT_TEST(RussiaMoscowFranceParisCenterRouteTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(),\n        MercatorBounds::FromLatLon(55.75271, 37.62618), {0., 0.},\n        MercatorBounds::FromLatLon(48.86123, 2.34129), 2840940.);\n  }\n\n\/\/ TODO(gardster) repair routing to London.\n\/\/ https:\/\/trello.com\/c\/WPSQUu9J\/1932-francepariscenternglandlondoncenterroutetest\n\/\/ OSRM routes through a OSM way with tag render:no. So we have no geometry in the\n\/\/ mwm and we can not obtain a cross section exit point.\n\/\/  UNIT_TEST(FranceParisCenternglandLondonCenterRouteTest)\n\/\/  {\n\/\/    integration::CalculateRouteAndTestRouteLength(\n\/\/        integration::GetOsrmComponents(),\n\/\/        MercatorBounds::FromLatLon(48.86123, 2.34129), {0., 0.},\n\/\/        MercatorBounds::FromLatLon(51.49884, -0.10438), 0.\/* Some unknown value*\/);\n\/\/  }\n\n  \/\/ Strange map edits in Africa borders. Routing not linked now.\n  \/*\n  UNIT_TEST(RussiaMoscowLenigradskiy39RepublicOfSouthAfricaCapeTownCenterRouteTest)\n  {\n    \/\/@todo put down a correct route length when router is fixed\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), {37.53754, 67.53622}, {0., 0.},\n        {18.54269, -36.09501}, 17873000.);\n  }*\/\n\n  UNIT_TEST(MoroccoToSahrawiCrossMwmTest)\n  {\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(27.15587, -13.23059), {0., 0.},\n        MercatorBounds::FromLatLon(27.94049, -12.88800), 100864);\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(27.94049, -12.88800), {0., 0.},\n        MercatorBounds::FromLatLon(27.15587, -13.23059), 100864);\n  }\n\n  UNIT_TEST(ArbatBaliCrimeanCrossMwmTest)\n  {\n    \/\/ Forward case.\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.90668,34.87221), {0., 0.},\n        MercatorBounds::FromLatLon(45.35697, 35.36971), 75000.);\n    \/\/ Backward case.\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.35697, 35.36971), {0., 0.},\n        MercatorBounds::FromLatLon(45.90668,34.87221), 75000.);\n\n  }\n\n  UNIT_TEST(AlbaniaToMontenegroCrossTest)\n  {\n    \/\/ Road from Albania to Montenegro. Test turnaround finding at border (when start\/stop OSRM\n    \/\/ points are inside borders and one of segments has outside points).\n    \/\/ Forward\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(42.01535, 19.40044), {0., 0.},\n        MercatorBounds::FromLatLon(42.01201, 19.36286), 3674.);\n    \/\/ And backward case\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(42.01201, 19.36286), {0., 0.},\n        MercatorBounds::FromLatLon(42.01535, 19.40044), 3674.);\n  }\n\n  UNIT_TEST(CanadaBridgeCrossToEdwardIsland)\n  {\n    \/\/ Forward\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(46.13418, -63.84656), {0., 0.},\n        MercatorBounds::FromLatLon(46.26739,-63.63907), 23000.);\n    \/\/ And backward case\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(46.26739, -63.63907), {0., 0.},\n        MercatorBounds::FromLatLon(46.13418, -63.84656), 23000.);\n  }\n\n  UNIT_TEST(RussiaFerryToCrimea)\n  {\n    \/\/ Forward\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.38053, 36.73226), {0., 0.},\n        MercatorBounds::FromLatLon(45.36078, 36.60866), 13150.);\n    \/\/ And backward case\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(45.36078, 36.60866), {0., 0.},\n        MercatorBounds::FromLatLon(45.38053, 36.73226), 13110.);\n  }\n\n  UNIT_TEST(ParisCrossDestinationInForwardHeapCase)\n  {\n    \/\/ Forward\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(49.85015, 2.24296), {0., 0.},\n        MercatorBounds::FromLatLon(48.85860, 2.34784), 126000.);\n    \/\/ And backward case\n    integration::CalculateRouteAndTestRouteLength(\n        integration::GetOsrmComponents(), MercatorBounds::FromLatLon(48.85860, 2.34784), {0., 0.},\n        MercatorBounds::FromLatLon(49.85015, 2.24296), 126000.);\n  }\n\n  UNIT_TEST(RussiaSmolenskRussiaMoscowTimeTest)\n  {\n    TRouteResult const routeResult = integration::CalculateRoute(\n        integration::GetOsrmComponents(), {32.05489, 65.78463}, {0., 0.}, {37.60169, 67.45807});\n\n    Route const & route = *routeResult.first;\n    IRouter::ResultCode const result = routeResult.second;\n    TEST_EQUAL(result, IRouter::NoError, ());\n\n    integration::TestRouteTime(route, 17450.);\n  }\n\n  UNIT_TEST(RussiaMoscowLenigradskiy39GeroevPanfilovtsev22TimeTest)\n  {\n    TRouteResult const routeResult = integration::CalculateRoute(\n        integration::GetOsrmComponents(), {37.53804, 67.53647}, {0., 0.}, {37.40990, 67.64474});\n\n    Route const & route = *routeResult.first;\n    IRouter::ResultCode const result = routeResult.second;\n    TEST_EQUAL(result, IRouter::NoError, ());\n\n    integration::TestRouteTime(route, 910.);\n  }\n}  \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n\n    Plugin to perform background fetches of certain content that would\n    otherwise not be cached. For example, Range: requests \/ responses.\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#include <stdio.h>\n#include <ts\/ts.h>\n#include <openssl\/ssl.h>\n#include <string>\n#include <map>\n#include <string.h>\n\nusing namespace std;\n\nconst char* PLUGIN_NAME = \"sni_proto_nego\";\nconst int MAX_BUFFER_SIZE = 1024;\nconst int MAX_FILE_PATH_SIZE = 1024;\nconst unsigned int MAX_PROTO_LIST_LEN = 100;\nconst unsigned int MAX_PROTO_NAME_LEN = 255;\n\ntypedef struct {\n  bool enableNpn;\n  unsigned int npn_proto_list_count;\n  unsigned char npn_proto_list [MAX_PROTO_LIST_LEN] [MAX_PROTO_NAME_LEN];\n} SNIProtoConfig;\n\ntypedef map<string, SNIProtoConfig> stringMap;\nstatic  stringMap _sniProtoMap;\n\nstatic\nbool read_config(char* config_file) {\n  char file_path[MAX_FILE_PATH_SIZE];\n  TSFile file;\n  if (config_file == NULL) {\n    TSError(\"invalid config file\");\n    return false;\n  }\n  TSDebug(PLUGIN_NAME, \"trying to open config file in this path: %s\", file_path);\n  file = TSfopen(config_file, \"r\");\n  if (file == NULL) {\n    snprintf(file_path, sizeof(file_path), \"%s\/%s\", TSInstallDirGet(), config_file);\n    file = TSfopen(file_path, \"r\");\n    if (file == NULL) {\n      TSError(\"Failed to open config file %s\", config_file);\n      return false;\n    }\n  }\n  char buffer[MAX_BUFFER_SIZE];\n  memset(buffer, 0, sizeof(buffer));\n  while (TSfgets(file, buffer, sizeof(buffer) - 1) != NULL) {\n    char *eol = 0;\n    \/\/ make sure line was not bigger than buffer\n    if ((eol = strchr(buffer, '\\n')) == NULL && (eol = strstr(buffer, \"\\r\\n\")) == NULL) {\n      TSError(\"sni_proto_nego line too long, did not get a good line in cfg, skipping, line: %s\", buffer);\n      memset(buffer, 0, sizeof(buffer));\n      continue;\n    }\n    \/\/ make sure line has something useful on it\n    if (eol - buffer < 2 || buffer[0] == '#') {\n      memset(buffer, 0, sizeof(buffer));\n      continue;\n    }\n    char* cfg = strtok(buffer, \"\\n\\r\\n\");\n\n    if (cfg != NULL) {\n        TSDebug(PLUGIN_NAME, \"setting SniProto based on string: %s\", cfg);\n\n        char* domain = strtok(buffer, \" \");\n        SNIProtoConfig sniProtoConfig = {1, 1};\n\n        if (domain) {\n          if ((*domain == '*') && (domain+1) && (*(domain+1)=='.')) {\n            domain += 2;\n            if (domain == NULL) {\n              continue;\n            }\n          }\n          char* sni_proto_config = strtok (NULL, \" \");\n          if (sni_proto_config) {\n            sniProtoConfig.enableNpn = atoi(sni_proto_config);\n            TSDebug(PLUGIN_NAME, \"npn_proto_config %d\", sniProtoConfig.enableNpn);\n            sni_proto_config = strtok (NULL, \" \");\n            \/\/ now get the npn proto advertisment list\n            sni_proto_config = strtok (NULL, \" \");\n            sniProtoConfig.npn_proto_list_count = 0;\n            while (sni_proto_config != NULL) {\n              char* proto = strtok(NULL, \"|\");\n              if ((proto == NULL) ||\n                  (sniProtoConfig.npn_proto_list_count >= MAX_PROTO_LIST_LEN) ||\n                  (strlen(proto) >= MAX_PROTO_NAME_LEN)) {\n                break;\n              }\n              _TSstrlcpy((char*)sniProtoConfig.npn_proto_list[sniProtoConfig.npn_proto_list_count++], proto, (strlen(proto) + 1));\n            }\n          }\n          _sniProtoMap.insert(make_pair(domain, sniProtoConfig));\n        }\n\n        memset(buffer, 0, sizeof(buffer));\n    }\n  }\n\n  TSfclose(file);\n\n  TSDebug(PLUGIN_NAME, \"Done parsing config\");\n\n  return true;\n}\n\n\nstatic void\ninit_sni_callback(void *sslNetVC)\n{\n  TSVConn ssl_vc = reinterpret_cast<TSVConn>(sslNetVC);\n  TSSslConnection sslobj = TSVConnSSLConnectionGet(ssl_vc);\n  SSL *ssl = reinterpret_cast<SSL *>(sslobj);\n  const char *serverName = SSL_get_servername(ssl, TLSEXT_NAMETYPE_host_name);\n  SSL_CTX * ctx = SSL_get_SSL_CTX(ssl);\n\n  if (serverName == NULL) {\n    TSDebug(PLUGIN_NAME, \"invalid ssl netVC %p, servername %s for ssl obj %p\", sslNetVC, serverName, ssl);\n    return;\n  }\n\n  TSDebug(PLUGIN_NAME, \"ssl netVC %p, servername %s for ssl obj %p\", sslNetVC, serverName, ssl);\n\n  stringMap::iterator it; \n  it=_sniProtoMap.find(serverName);\n\n  \/\/ check for wild-card domains\n  if(it==_sniProtoMap.end()) {\n    char* domain = strstr((char*)serverName, \".\");\n    if (domain && (domain+1)) {\n      it=_sniProtoMap.find(domain+1);  \n    }\n  }\n\n  if (it!=_sniProtoMap.end()) {\n    SNIProtoConfig sniProtoConfig = it->second; \n    if (!sniProtoConfig.enableNpn) {\n      TSDebug(PLUGIN_NAME, \"disabling NPN for serverName %s\", serverName);\n      SSL_CTX_set_next_protos_advertised_cb(ctx, NULL, NULL);\n    } else {\n      TSDebug(PLUGIN_NAME, \"setting NPN advertised list for %s\", serverName);\n      \/\/TSSslAdvertiseProtocolSet(ssl_vc, (const unsigned char **)sniProtoConfig.npn_proto_list, sniProtoConfig.npn_proto_list_count);\n    }\n  } else {\n    TSDebug(PLUGIN_NAME, \"setting NPN advertised list for %s\", serverName);\n    \/\/TSSslAdvertiseProtocolSet(ssl_vc, NULL, 0);\n  }\n}\n\nint\nSSLSniInitCallbackHandler(TSCont \/* cont *\/, TSEvent \/* id *\/, void* sslNetVC) {\n  init_sni_callback(sslNetVC);\n  return TS_EVENT_NONE;\n}\n\nvoid\nTSPluginInit(int argc, const char *argv[])\n{\n  (void) argc;\n  TSPluginRegistrationInfo info;\n\n  info.plugin_name = (char *)(\"sni_proto_nego\");\n  info.vendor_name = (char *)(\"ats\");\n\n  if (TSPluginRegister(TS_SDK_VERSION_3_0, &info) != TS_SUCCESS) {\n    TSError(\"Plugin registration failed.\");\n  }\n\n  char* config_file = (char*)\"conf\/sni_proto_nego\/sni_proto_nego.config\";\n\n  if (argc >= 2) {\n    config_file = (char*)argv[1];\n  }\n  \n  if (!read_config(config_file)) {\n    TSDebug(PLUGIN_NAME, \"nothing to do..\");\n    return;\n  }\n\n  TSCont cont = TSContCreate(SSLSniInitCallbackHandler, NULL);\n  TSHttpHookAdd(TS_SSL_SNI_HOOK, cont);\n}\n<commit_msg>fix build failure<commit_after>\/** @file\n\n    Plugin to perform background fetches of certain content that would\n    otherwise not be cached. For example, Range: requests \/ responses.\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#include <stdio.h>\n#include <ts\/ts.h>\n#include <openssl\/ssl.h>\n#include <string>\n#include <map>\n#include <string.h>\n\nusing namespace std;\n\nconst char* PLUGIN_NAME = \"sni_proto_nego\";\nconst int MAX_BUFFER_SIZE = 1024;\nconst int MAX_FILE_PATH_SIZE = 1024;\nconst unsigned int MAX_PROTO_LIST_LEN = 100;\nconst unsigned int MAX_PROTO_NAME_LEN = 255;\n\ntypedef struct {\n  bool enableNpn;\n  unsigned int npn_proto_list_count;\n  unsigned char npn_proto_list [MAX_PROTO_LIST_LEN] [MAX_PROTO_NAME_LEN];\n} SNIProtoConfig;\n\ntypedef map<string, SNIProtoConfig> stringMap;\nstatic  stringMap _sniProtoMap;\n\nstatic\nbool read_config(char* config_file) {\n  char file_path[MAX_FILE_PATH_SIZE];\n  TSFile file;\n  if (config_file == NULL) {\n    TSError(\"invalid config file\");\n    return false;\n  }\n  TSDebug(PLUGIN_NAME, \"trying to open config file in this path: %s\", file_path);\n  file = TSfopen(config_file, \"r\");\n  if (file == NULL) {\n    snprintf(file_path, sizeof(file_path), \"%s\/%s\", TSInstallDirGet(), config_file);\n    file = TSfopen(file_path, \"r\");\n    if (file == NULL) {\n      TSError(\"Failed to open config file %s\", config_file);\n      return false;\n    }\n  }\n  char buffer[MAX_BUFFER_SIZE];\n  memset(buffer, 0, sizeof(buffer));\n  while (TSfgets(file, buffer, sizeof(buffer) - 1) != NULL) {\n    char *eol = 0;\n    \/\/ make sure line was not bigger than buffer\n    if ((eol = strchr(buffer, '\\n')) == NULL && (eol = strstr(buffer, \"\\r\\n\")) == NULL) {\n      TSError(\"sni_proto_nego line too long, did not get a good line in cfg, skipping, line: %s\", buffer);\n      memset(buffer, 0, sizeof(buffer));\n      continue;\n    }\n    \/\/ make sure line has something useful on it\n    if (eol - buffer < 2 || buffer[0] == '#') {\n      memset(buffer, 0, sizeof(buffer));\n      continue;\n    }\n    char* cfg = strtok(buffer, \"\\n\\r\\n\");\n\n    if (cfg != NULL) {\n        TSDebug(PLUGIN_NAME, \"setting SniProto based on string: %s\", cfg);\n\n        char* domain = strtok(buffer, \" \");\n        SNIProtoConfig sniProtoConfig = {1, 1};\n\n        if (domain) {\n          if ((*domain == '*') && (domain+1) && (*(domain+1)=='.')) {\n            domain += 2;\n            if (domain == NULL) {\n              continue;\n            }\n          }\n          char* sni_proto_config = strtok (NULL, \" \");\n          if (sni_proto_config) {\n            sniProtoConfig.enableNpn = atoi(sni_proto_config);\n            TSDebug(PLUGIN_NAME, \"npn_proto_config %d\", sniProtoConfig.enableNpn);\n            sni_proto_config = strtok (NULL, \" \");\n            \/\/ now get the npn proto advertisment list\n            sni_proto_config = strtok (NULL, \" \");\n            sniProtoConfig.npn_proto_list_count = 0;\n            while (sni_proto_config != NULL) {\n              char* proto = strtok(NULL, \"|\");\n              if ((proto == NULL) ||\n                  (sniProtoConfig.npn_proto_list_count >= MAX_PROTO_LIST_LEN) ||\n                  (strlen(proto) >= MAX_PROTO_NAME_LEN)) {\n                break;\n              }\n              _TSstrlcpy((char*)sniProtoConfig.npn_proto_list[sniProtoConfig.npn_proto_list_count++], proto, (strlen(proto) + 1));\n            }\n          }\n          _sniProtoMap.insert(make_pair(domain, sniProtoConfig));\n        }\n\n        memset(buffer, 0, sizeof(buffer));\n    }\n  }\n\n  TSfclose(file);\n\n  TSDebug(PLUGIN_NAME, \"Done parsing config\");\n\n  return true;\n}\n\n\nstatic void\ninit_sni_callback(void *sslNetVC)\n{\n  TSVConn ssl_vc = reinterpret_cast<TSVConn>(sslNetVC);\n  TSSslConnection sslobj = TSVConnSSLConnectionGet(ssl_vc);\n  SSL *ssl = reinterpret_cast<SSL *>(sslobj);\n  const char *serverName = SSL_get_servername(ssl, TLSEXT_NAMETYPE_host_name);\n  SSL_CTX * ctx = SSL_get_SSL_CTX(ssl);\n\n  if (serverName == NULL) {\n    TSDebug(PLUGIN_NAME, \"invalid ssl netVC %p, servername %s for ssl obj %p\", sslNetVC, serverName, ssl);\n    return;\n  }\n\n  TSDebug(PLUGIN_NAME, \"ssl netVC %p, servername %s for ssl obj %p\", sslNetVC, serverName, ssl);\n\n  stringMap::iterator it; \n  it=_sniProtoMap.find(serverName);\n\n  \/\/ check for wild-card domains\n  if(it==_sniProtoMap.end()) {\n    char* domain = strstr((char*)serverName, \".\");\n    if (domain && (domain+1)) {\n      it=_sniProtoMap.find(domain+1);  \n    }\n  }\n\n  if (it!=_sniProtoMap.end()) {\n    SNIProtoConfig sniProtoConfig = it->second; \n    if (!sniProtoConfig.enableNpn) {\n#if TS_USE_TLS_NPN\n      TSDebug(PLUGIN_NAME, \"disabling NPN for serverName %s\", serverName);\n      SSL_CTX_set_next_protos_advertised_cb(ctx, NULL, NULL);\n#endif\n    } else {\n      TSDebug(PLUGIN_NAME, \"setting NPN advertised list for %s\", serverName);\n      \/\/TSSslAdvertiseProtocolSet(ssl_vc, (const unsigned char **)sniProtoConfig.npn_proto_list, sniProtoConfig.npn_proto_list_count);\n    }\n  } else {\n    TSDebug(PLUGIN_NAME, \"setting NPN advertised list for %s\", serverName);\n    \/\/TSSslAdvertiseProtocolSet(ssl_vc, NULL, 0);\n  }\n}\n\nint\nSSLSniInitCallbackHandler(TSCont \/* cont *\/, TSEvent \/* id *\/, void* sslNetVC) {\n  init_sni_callback(sslNetVC);\n  return TS_EVENT_NONE;\n}\n\nvoid\nTSPluginInit(int argc, const char *argv[])\n{\n  (void) argc;\n  TSPluginRegistrationInfo info;\n\n  info.plugin_name = (char *)(\"sni_proto_nego\");\n  info.vendor_name = (char *)(\"ats\");\n\n  if (TSPluginRegister(TS_SDK_VERSION_3_0, &info) != TS_SUCCESS) {\n    TSError(\"Plugin registration failed.\");\n  }\n\n  char* config_file = (char*)\"conf\/sni_proto_nego\/sni_proto_nego.config\";\n\n  if (argc >= 2) {\n    config_file = (char*)argv[1];\n  }\n  \n  if (!read_config(config_file)) {\n    TSDebug(PLUGIN_NAME, \"nothing to do..\");\n    return;\n  }\n\n  TSCont cont = TSContCreate(SSLSniInitCallbackHandler, NULL);\n  TSHttpHookAdd(TS_SSL_SNI_HOOK, cont);\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__ALLOCATOR__ALLOCATOR_DELETER_HPP_\n#define RCLCPP__ALLOCATOR__ALLOCATOR_DELETER_HPP_\n\n#include <memory>\n#include <stdexcept>\n\nnamespace rclcpp\n{\nnamespace allocator\n{\n\ntemplate<typename Allocator>\nclass AllocatorDeleter\n{\n  template<typename T>\n  using AllocRebind = typename std::allocator_traits<Allocator>::template rebind_alloc<T>;\n\npublic:\n  AllocatorDeleter()\n  : allocator_(nullptr)\n  {\n  }\n\n  explicit AllocatorDeleter(Allocator * a)\n  : allocator_(a)\n  {\n  }\n\n  template<typename T>\n  AllocatorDeleter(const AllocatorDeleter<T> & a)\n  {\n    allocator_ = a.get_allocator();\n  }\n\n  template<typename T>\n  void operator()(T * ptr)\n  {\n    std::allocator_traits<AllocRebind<T>>::destroy(*allocator_, ptr);\n    std::allocator_traits<AllocRebind<T>>::deallocate(*allocator_, ptr, 1);\n    ptr = nullptr;\n  }\n\n  Allocator * get_allocator() const\n  {\n    return allocator_;\n  }\n\n  void set_allocator(Allocator * alloc)\n  {\n    allocator_ = alloc;\n  }\n\nprivate:\n  Allocator * allocator_;\n};\n\ntemplate<typename Alloc, typename T, typename D>\nvoid set_allocator_for_deleter(D * deleter, Alloc * alloc)\n{\n  (void) alloc;\n  (void) deleter;\n  throw std::runtime_error(\"Reached unexpected template specialization\");\n}\n\ntemplate<typename T, typename U>\nvoid set_allocator_for_deleter(std::default_delete<T> * deleter, std::allocator<U> * alloc)\n{\n  (void) deleter;\n  (void) alloc;\n}\n\ntemplate<typename Alloc, typename T>\nvoid set_allocator_for_deleter(AllocatorDeleter<T> * deleter, Alloc * alloc)\n{\n  if (!deleter || !alloc) {\n    throw std::invalid_argument(\"Argument was NULL to set_allocator_for_deleter\");\n  }\n  deleter->set_allocator(alloc);\n}\n\ntemplate<typename Alloc, typename T>\nusing Deleter = typename std::conditional<\n  std::is_same<typename std::allocator_traits<Alloc>::template rebind_alloc<T>,\n  typename std::allocator<void>::template rebind<T>::other>::value,\n  std::default_delete<T>,\n  AllocatorDeleter<Alloc>\n  >::type;\n}  \/\/ namespace allocator\n}  \/\/ namespace rclcpp\n\n#endif  \/\/ RCLCPP__ALLOCATOR__ALLOCATOR_DELETER_HPP_\n<commit_msg>Remove use of std::allocator<>::rebind (#1678)<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__ALLOCATOR__ALLOCATOR_DELETER_HPP_\n#define RCLCPP__ALLOCATOR__ALLOCATOR_DELETER_HPP_\n\n#include <memory>\n#include <stdexcept>\n\nnamespace rclcpp\n{\nnamespace allocator\n{\n\ntemplate<typename Allocator>\nclass AllocatorDeleter\n{\n  template<typename T>\n  using AllocRebind = typename std::allocator_traits<Allocator>::template rebind_alloc<T>;\n\npublic:\n  AllocatorDeleter()\n  : allocator_(nullptr)\n  {\n  }\n\n  explicit AllocatorDeleter(Allocator * a)\n  : allocator_(a)\n  {\n  }\n\n  template<typename T>\n  AllocatorDeleter(const AllocatorDeleter<T> & a)\n  {\n    allocator_ = a.get_allocator();\n  }\n\n  template<typename T>\n  void operator()(T * ptr)\n  {\n    std::allocator_traits<AllocRebind<T>>::destroy(*allocator_, ptr);\n    std::allocator_traits<AllocRebind<T>>::deallocate(*allocator_, ptr, 1);\n    ptr = nullptr;\n  }\n\n  Allocator * get_allocator() const\n  {\n    return allocator_;\n  }\n\n  void set_allocator(Allocator * alloc)\n  {\n    allocator_ = alloc;\n  }\n\nprivate:\n  Allocator * allocator_;\n};\n\ntemplate<typename Alloc, typename T, typename D>\nvoid set_allocator_for_deleter(D * deleter, Alloc * alloc)\n{\n  (void) alloc;\n  (void) deleter;\n  throw std::runtime_error(\"Reached unexpected template specialization\");\n}\n\ntemplate<typename T, typename U>\nvoid set_allocator_for_deleter(std::default_delete<T> * deleter, std::allocator<U> * alloc)\n{\n  (void) deleter;\n  (void) alloc;\n}\n\ntemplate<typename Alloc, typename T>\nvoid set_allocator_for_deleter(AllocatorDeleter<T> * deleter, Alloc * alloc)\n{\n  if (!deleter || !alloc) {\n    throw std::invalid_argument(\"Argument was NULL to set_allocator_for_deleter\");\n  }\n  deleter->set_allocator(alloc);\n}\n\ntemplate<typename Alloc, typename T>\nusing Deleter = typename std::conditional<\n  std::is_same<typename std::allocator_traits<Alloc>::template rebind_alloc<T>,\n  std::allocator<T>>::value,\n  std::default_delete<T>,\n  AllocatorDeleter<Alloc>\n  >::type;\n}  \/\/ namespace allocator\n}  \/\/ namespace rclcpp\n\n#endif  \/\/ RCLCPP__ALLOCATOR__ALLOCATOR_DELETER_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- DisassemblerLLVM.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 \"DisassemblerLLVM.h\"\n\n#include \"llvm-c\/EnhancedDisassembly.h\"\n\n#include \"lldb\/Core\/Address.h\"\n#include \"lldb\/Core\/DataExtractor.h\"\n#include \"lldb\/Core\/Disassembler.h\"\n#include \"lldb\/Core\/Module.h\"\n#include \"lldb\/Core\/PluginManager.h\"\n#include \"lldb\/Core\/Stream.h\"\n#include \"lldb\/Core\/StreamString.h\"\n#include \"lldb\/Symbol\/SymbolContext.h\"\n\n#include \"lldb\/Target\/ExecutionContext.h\"\n#include \"lldb\/Target\/Process.h\"\n#include \"lldb\/Target\/RegisterContext.h\"\n#include \"lldb\/Target\/Target.h\"\n\n#include <memory>\n#include <string>\n\nusing namespace lldb;\nusing namespace lldb_private;\n\n\nstatic\nint DataExtractorByteReader(uint8_t *byte, uint64_t address, void *arg)\n{\n    DataExtractor &extractor = *((DataExtractor *)arg);\n\n    if (extractor.ValidOffset(address))\n    {\n        *byte = *(extractor.GetDataStart() + address);\n        return 0;\n    }\n    else\n    {\n        return -1;\n    }\n}\n\nnamespace {\n    struct RegisterReaderArg {\n        const lldb::addr_t instructionPointer;\n        const EDDisassemblerRef disassembler;\n\n        RegisterReaderArg(lldb::addr_t ip,\n                          EDDisassemblerRef dis) :\n            instructionPointer(ip),\n            disassembler(dis)\n        {\n        }\n    };\n}\n\nstatic int IPRegisterReader(uint64_t *value, unsigned regID, void* arg)\n{\n    uint64_t instructionPointer = ((RegisterReaderArg*)arg)->instructionPointer;\n    EDDisassemblerRef disassembler = ((RegisterReaderArg*)arg)->disassembler;\n\n    if(EDRegisterIsProgramCounter(disassembler, regID)) {\n        *value = instructionPointer;\n        return 0;\n    }\n\n    return -1;\n}\n\nDisassemblerLLVM::InstructionLLVM::InstructionLLVM (EDDisassemblerRef disassembler, const Address &addr) :\n    Instruction (addr),\n    m_disassembler (disassembler)\n{\n}\n\nDisassemblerLLVM::InstructionLLVM::~InstructionLLVM()\n{\n}\n\nstatic void\nPadString(Stream *s, const std::string &str, size_t width)\n{\n    int diff = width - str.length();\n\n    if (diff > 0)\n        s->Printf(\"%s%*.*s\", str.c_str(), diff, diff, \"\");\n    else\n        s->Printf(\"%s \", str.c_str());\n}\n\nvoid\nDisassemblerLLVM::InstructionLLVM::Dump\n(\n    Stream *s,\n    bool show_address,\n    const DataExtractor *bytes,\n    uint32_t bytes_offset,\n    const lldb_private::ExecutionContext* exe_ctx,\n    bool raw\n)\n{\n    const size_t opcodeColumnWidth = 7;\n    const size_t operandColumnWidth = 25;\n\n    ExecutionContextScope *exe_scope = NULL;\n    if (exe_ctx)\n        exe_scope = exe_ctx->GetBestExecutionContextScope();\n\n    \/\/ If we have an address, print it out\n    if (GetAddress().IsValid())\n    {\n        if (GetAddress().Dump (s, \n                               exe_scope, \n                               Address::DumpStyleLoadAddress, \n                               Address::DumpStyleModuleWithFileAddress,\n                               0))\n            s->PutCString(\":  \");\n    }\n\n    \/\/ If we are supposed to show bytes, \"bytes\" will be non-NULL.\n    if (bytes)\n    {\n        uint32_t bytes_dumped = bytes->Dump(s, bytes_offset, eFormatBytes, 1, EDInstByteSize(m_inst), UINT32_MAX, LLDB_INVALID_ADDRESS, 0, 0) - bytes_offset;\n        \/\/ Allow for 8 bytes of opcodes normally\n        const uint32_t default_num_opcode_bytes = 9;\n        if (bytes_dumped * 3 < (default_num_opcode_bytes*3))\n        {\n            uint32_t indent_level = (default_num_opcode_bytes*3) - (bytes_dumped * 3);\n            s->Printf(\"%*.*s\", indent_level, indent_level, \"\");\n        }\n    }\n\n    int numTokens = EDNumTokens(m_inst);\n\n    int currentOpIndex = -1;\n\n    std::auto_ptr<RegisterReaderArg> rra;\n    \n    if (!raw)\n    {\n        addr_t base_addr = LLDB_INVALID_ADDRESS;\n        if (exe_ctx && exe_ctx->target && !exe_ctx->target->GetSectionLoadList().IsEmpty())\n            base_addr = GetAddress().GetLoadAddress (exe_ctx->target);\n        if (base_addr == LLDB_INVALID_ADDRESS)\n            base_addr = GetAddress().GetFileAddress ();\n        \n        rra.reset(new RegisterReaderArg(base_addr + EDInstByteSize(m_inst), m_disassembler));\n    }\n\n    bool printTokenized = false;\n\n    if (numTokens != -1)\n    {\n        printTokenized = true;\n\n        \/\/ Handle the opcode column.\n\n        StreamString opcode;\n\n        int tokenIndex = 0;\n\n        EDTokenRef token;\n        const char *tokenStr;\n\n        if (EDGetToken(&token, m_inst, tokenIndex))\n            printTokenized = false;\n\n        if (!printTokenized || !EDTokenIsOpcode(token))\n            printTokenized = false;\n\n        if (!printTokenized || EDGetTokenString(&tokenStr, token))\n            printTokenized = false;\n\n        \/\/ Put the token string into our opcode string\n        opcode.PutCString(tokenStr);\n\n        \/\/ If anything follows, it probably starts with some whitespace.  Skip it.\n\n        tokenIndex++;\n\n        if (printTokenized && tokenIndex < numTokens)\n        {\n            if(!printTokenized || EDGetToken(&token, m_inst, tokenIndex))\n                printTokenized = false;\n\n            if(!printTokenized || !EDTokenIsWhitespace(token))\n                printTokenized = false;\n        }\n\n        tokenIndex++;\n\n        \/\/ Handle the operands and the comment.\n\n        StreamString operands;\n        StreamString comment;\n\n        if (printTokenized)\n        {\n            bool show_token;\n\n            for (; tokenIndex < numTokens; ++tokenIndex)\n            {\n                if (EDGetToken(&token, m_inst, tokenIndex))\n                    return;\n\n                if (raw)\n                {\n                    show_token = true;\n                }\n                else\n                {\n                    int operandIndex = EDOperandIndexForToken(token);\n\n                    if (operandIndex >= 0)\n                    {\n                        if (operandIndex != currentOpIndex)\n                        {\n                            show_token = true;\n\n                            currentOpIndex = operandIndex;\n                            EDOperandRef operand;\n\n                            if (!EDGetOperand(&operand, m_inst, currentOpIndex))\n                            {\n                                if (EDOperandIsMemory(operand))\n                                {\n                                    uint64_t operand_value;\n\n                                    if (!EDEvaluateOperand(&operand_value, operand, IPRegisterReader, rra.get()))\n                                    {\n                                        if (EDInstIsBranch(m_inst))\n                                        {\n                                            operands.Printf(\"0x%llx \", operand_value);\n                                            show_token = false;\n                                        }\n                                        else\n                                        {\n                                            \/\/ Put the address value into the comment\n                                            comment.Printf(\"0x%llx \", operand_value);\n                                        }\n\n                                        lldb_private::Address so_addr;\n                                        if (exe_ctx && exe_ctx->target && !exe_ctx->target->GetSectionLoadList().IsEmpty())\n                                        {\n                                            if (exe_ctx->target->GetSectionLoadList().ResolveLoadAddress (operand_value, so_addr))\n                                                so_addr.Dump(&comment, exe_scope, Address::DumpStyleResolvedDescriptionNoModule, Address::DumpStyleSectionNameOffset);\n                                        }\n                                        else\n                                        {\n                                            Module *module = GetAddress().GetModule();\n                                            if (module)\n                                            {\n                                                if (module->ResolveFileAddress (operand_value, so_addr))\n                                                    so_addr.Dump(&comment, exe_scope, Address::DumpStyleResolvedDescriptionNoModule, Address::DumpStyleSectionNameOffset);\n                                            }\n                                        }\n\n                                    } \/\/ EDEvaluateOperand\n                                } \/\/ EDOperandIsMemory\n                            } \/\/ EDGetOperand\n                        } \/\/ operandIndex != currentOpIndex\n                    } \/\/ operandIndex >= 0\n                } \/\/ else(raw)\n\n                if (show_token)\n                {\n                    if(EDGetTokenString(&tokenStr, token))\n                    {\n                        printTokenized = false;\n                        break;\n                    }\n\n                    operands.PutCString(tokenStr);\n                }\n            } \/\/ for (tokenIndex)\n\n            if (printTokenized)\n            {\n                if (operands.GetString().empty())\n                {\n                    s->PutCString(opcode.GetString().c_str());\n                }\n                else\n                {\n                    PadString(s, opcode.GetString(), opcodeColumnWidth);\n\n                    if (comment.GetString().empty())\n                    {\n                        s->PutCString(operands.GetString().c_str());\n                    }\n                    else\n                    {\n                        PadString(s, operands.GetString(), operandColumnWidth);\n\n                        s->PutCString(\"; \");\n                        s->PutCString(comment.GetString().c_str());\n                    } \/\/ else (comment.GetString().empty())\n                } \/\/ else (operands.GetString().empty())\n            } \/\/ printTokenized\n        } \/\/ for (tokenIndex)\n    } \/\/ numTokens != -1\n\n    if (!printTokenized)\n    {\n        const char *str;\n\n        if (EDGetInstString(&str, m_inst))\n            return;\n        else\n            s->PutCString(str);\n    }\n}\n\nbool\nDisassemblerLLVM::InstructionLLVM::DoesBranch() const\n{\n    return EDInstIsBranch(m_inst);\n}\n\nsize_t\nDisassemblerLLVM::InstructionLLVM::GetByteSize() const\n{\n    return EDInstByteSize(m_inst);\n}\n\nsize_t\nDisassemblerLLVM::InstructionLLVM::Extract(const DataExtractor &data, uint32_t data_offset)\n{\n    if (EDCreateInsts(&m_inst, 1, m_disassembler, DataExtractorByteReader, data_offset, (void*)(&data)))\n        return EDInstByteSize(m_inst);\n    else\n        return 0;\n}\n\nstatic inline const char *\nTripleForArchSpec (const ArchSpec &arch, char *triple, size_t triple_len)\n{\n    const char *arch_name = arch.AsCString();\n\n    if (arch_name)\n    {\n        snprintf(triple, triple_len, \"%s-unknown-unknown\", arch_name);\n        return triple;\n    }\n    return NULL;\n}\n\nstatic inline EDAssemblySyntax_t\nSyntaxForArchSpec (const ArchSpec &arch)\n{\n    const char *arch_name = arch.AsCString();\n\n    if (arch_name != NULL && \n       ((strcasestr (arch_name, \"i386\") == arch_name) || \n        (strcasestr (arch_name, \"x86_64\") == arch_name)))\n        return kEDAssemblySyntaxX86ATT;\n    \n    return (EDAssemblySyntax_t)0;   \/\/ default\n}\n\nDisassembler *\nDisassemblerLLVM::CreateInstance(const ArchSpec &arch)\n{\n    char triple[256];\n\n    if (TripleForArchSpec (arch, triple, sizeof(triple)))\n        return new DisassemblerLLVM(arch);\n    return NULL;\n}\n\nDisassemblerLLVM::DisassemblerLLVM(const ArchSpec &arch) :\n    Disassembler(arch)\n{\n    char triple[256];\n    if (TripleForArchSpec (arch, triple, sizeof(triple)))\n    {\n        assert(!EDGetDisassembler(&m_disassembler, triple, SyntaxForArchSpec (arch)) && \"No disassembler created!\");\n    }\n}\n\nDisassemblerLLVM::~DisassemblerLLVM()\n{\n}\n\nsize_t\nDisassemblerLLVM::DecodeInstructions\n(\n    const Address &base_addr,\n    const DataExtractor& data,\n    uint32_t data_offset,\n    uint32_t num_instructions\n)\n{\n    size_t total_inst_byte_size = 0;\n\n    m_instruction_list.Clear();\n\n    while (data.ValidOffset(data_offset) && num_instructions)\n    {\n        Address inst_addr (base_addr);\n        inst_addr.Slide(data_offset);\n        InstructionSP inst_sp (new InstructionLLVM(m_disassembler, inst_addr));\n\n        size_t inst_byte_size = inst_sp->Extract (data, data_offset);\n\n        if (inst_byte_size == 0)\n            break;\n\n        m_instruction_list.Append (inst_sp);\n\n        total_inst_byte_size += inst_byte_size;\n        data_offset += inst_byte_size;\n        num_instructions--;\n    }\n\n    return total_inst_byte_size;\n}\n\nvoid\nDisassemblerLLVM::Initialize()\n{\n    PluginManager::RegisterPlugin (GetPluginNameStatic(),\n                                   GetPluginDescriptionStatic(),\n                                   CreateInstance);\n}\n\nvoid\nDisassemblerLLVM::Terminate()\n{\n    PluginManager::UnregisterPlugin (CreateInstance);\n}\n\n\nconst char *\nDisassemblerLLVM::GetPluginNameStatic()\n{\n    return \"disassembler.llvm\";\n}\n\nconst char *\nDisassemblerLLVM::GetPluginDescriptionStatic()\n{\n    return \"Disassembler that uses LLVM opcode tables to disassemble i386 and x86_64.\";\n}\n\n\/\/------------------------------------------------------------------\n\/\/ PluginInterface protocol\n\/\/------------------------------------------------------------------\nconst char *\nDisassemblerLLVM::GetPluginName()\n{\n    return \"DisassemblerLLVM\";\n}\n\nconst char *\nDisassemblerLLVM::GetShortPluginName()\n{\n    return GetPluginNameStatic();\n}\n\nuint32_t\nDisassemblerLLVM::GetPluginVersion()\n{\n    return 1;\n}\n\nvoid\nDisassemblerLLVM::GetPluginCommandHelp (const char *command, Stream *strm)\n{\n}\n\nError\nDisassemblerLLVM::ExecutePluginCommand (Args &command, Stream *strm)\n{\n    Error error;\n    error.SetErrorString(\"No plug-in command are currently supported.\");\n    return error;\n}\n\nLog *\nDisassemblerLLVM::EnablePluginLogging (Stream *strm, Args &command)\n{\n    return NULL;\n}\n\n<commit_msg>Fixed a bug where the LLVM disassembler was ignoring the show_address parameter.<commit_after>\/\/===-- DisassemblerLLVM.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 \"DisassemblerLLVM.h\"\n\n#include \"llvm-c\/EnhancedDisassembly.h\"\n\n#include \"lldb\/Core\/Address.h\"\n#include \"lldb\/Core\/DataExtractor.h\"\n#include \"lldb\/Core\/Disassembler.h\"\n#include \"lldb\/Core\/Module.h\"\n#include \"lldb\/Core\/PluginManager.h\"\n#include \"lldb\/Core\/Stream.h\"\n#include \"lldb\/Core\/StreamString.h\"\n#include \"lldb\/Symbol\/SymbolContext.h\"\n\n#include \"lldb\/Target\/ExecutionContext.h\"\n#include \"lldb\/Target\/Process.h\"\n#include \"lldb\/Target\/RegisterContext.h\"\n#include \"lldb\/Target\/Target.h\"\n\n#include <memory>\n#include <string>\n\nusing namespace lldb;\nusing namespace lldb_private;\n\n\nstatic\nint DataExtractorByteReader(uint8_t *byte, uint64_t address, void *arg)\n{\n    DataExtractor &extractor = *((DataExtractor *)arg);\n\n    if (extractor.ValidOffset(address))\n    {\n        *byte = *(extractor.GetDataStart() + address);\n        return 0;\n    }\n    else\n    {\n        return -1;\n    }\n}\n\nnamespace {\n    struct RegisterReaderArg {\n        const lldb::addr_t instructionPointer;\n        const EDDisassemblerRef disassembler;\n\n        RegisterReaderArg(lldb::addr_t ip,\n                          EDDisassemblerRef dis) :\n            instructionPointer(ip),\n            disassembler(dis)\n        {\n        }\n    };\n}\n\nstatic int IPRegisterReader(uint64_t *value, unsigned regID, void* arg)\n{\n    uint64_t instructionPointer = ((RegisterReaderArg*)arg)->instructionPointer;\n    EDDisassemblerRef disassembler = ((RegisterReaderArg*)arg)->disassembler;\n\n    if(EDRegisterIsProgramCounter(disassembler, regID)) {\n        *value = instructionPointer;\n        return 0;\n    }\n\n    return -1;\n}\n\nDisassemblerLLVM::InstructionLLVM::InstructionLLVM (EDDisassemblerRef disassembler, const Address &addr) :\n    Instruction (addr),\n    m_disassembler (disassembler)\n{\n}\n\nDisassemblerLLVM::InstructionLLVM::~InstructionLLVM()\n{\n}\n\nstatic void\nPadString(Stream *s, const std::string &str, size_t width)\n{\n    int diff = width - str.length();\n\n    if (diff > 0)\n        s->Printf(\"%s%*.*s\", str.c_str(), diff, diff, \"\");\n    else\n        s->Printf(\"%s \", str.c_str());\n}\n\nvoid\nDisassemblerLLVM::InstructionLLVM::Dump\n(\n    Stream *s,\n    bool show_address,\n    const DataExtractor *bytes,\n    uint32_t bytes_offset,\n    const lldb_private::ExecutionContext* exe_ctx,\n    bool raw\n)\n{\n    const size_t opcodeColumnWidth = 7;\n    const size_t operandColumnWidth = 25;\n\n    ExecutionContextScope *exe_scope = NULL;\n    if (exe_ctx)\n        exe_scope = exe_ctx->GetBestExecutionContextScope();\n\n    \/\/ If we have an address, print it out\n    if (GetAddress().IsValid() && show_address)\n    {\n        if (GetAddress().Dump (s, \n                               exe_scope, \n                               Address::DumpStyleLoadAddress, \n                               Address::DumpStyleModuleWithFileAddress,\n                               0))\n            s->PutCString(\":  \");\n    }\n\n    \/\/ If we are supposed to show bytes, \"bytes\" will be non-NULL.\n    if (bytes)\n    {\n        uint32_t bytes_dumped = bytes->Dump(s, bytes_offset, eFormatBytes, 1, EDInstByteSize(m_inst), UINT32_MAX, LLDB_INVALID_ADDRESS, 0, 0) - bytes_offset;\n        \/\/ Allow for 8 bytes of opcodes normally\n        const uint32_t default_num_opcode_bytes = 9;\n        if (bytes_dumped * 3 < (default_num_opcode_bytes*3))\n        {\n            uint32_t indent_level = (default_num_opcode_bytes*3) - (bytes_dumped * 3);\n            s->Printf(\"%*.*s\", indent_level, indent_level, \"\");\n        }\n    }\n\n    int numTokens = EDNumTokens(m_inst);\n\n    int currentOpIndex = -1;\n\n    std::auto_ptr<RegisterReaderArg> rra;\n    \n    if (!raw)\n    {\n        addr_t base_addr = LLDB_INVALID_ADDRESS;\n        if (exe_ctx && exe_ctx->target && !exe_ctx->target->GetSectionLoadList().IsEmpty())\n            base_addr = GetAddress().GetLoadAddress (exe_ctx->target);\n        if (base_addr == LLDB_INVALID_ADDRESS)\n            base_addr = GetAddress().GetFileAddress ();\n        \n        rra.reset(new RegisterReaderArg(base_addr + EDInstByteSize(m_inst), m_disassembler));\n    }\n\n    bool printTokenized = false;\n\n    if (numTokens != -1)\n    {\n        printTokenized = true;\n\n        \/\/ Handle the opcode column.\n\n        StreamString opcode;\n\n        int tokenIndex = 0;\n\n        EDTokenRef token;\n        const char *tokenStr;\n\n        if (EDGetToken(&token, m_inst, tokenIndex))\n            printTokenized = false;\n\n        if (!printTokenized || !EDTokenIsOpcode(token))\n            printTokenized = false;\n\n        if (!printTokenized || EDGetTokenString(&tokenStr, token))\n            printTokenized = false;\n\n        \/\/ Put the token string into our opcode string\n        opcode.PutCString(tokenStr);\n\n        \/\/ If anything follows, it probably starts with some whitespace.  Skip it.\n\n        tokenIndex++;\n\n        if (printTokenized && tokenIndex < numTokens)\n        {\n            if(!printTokenized || EDGetToken(&token, m_inst, tokenIndex))\n                printTokenized = false;\n\n            if(!printTokenized || !EDTokenIsWhitespace(token))\n                printTokenized = false;\n        }\n\n        tokenIndex++;\n\n        \/\/ Handle the operands and the comment.\n\n        StreamString operands;\n        StreamString comment;\n\n        if (printTokenized)\n        {\n            bool show_token;\n\n            for (; tokenIndex < numTokens; ++tokenIndex)\n            {\n                if (EDGetToken(&token, m_inst, tokenIndex))\n                    return;\n\n                if (raw)\n                {\n                    show_token = true;\n                }\n                else\n                {\n                    int operandIndex = EDOperandIndexForToken(token);\n\n                    if (operandIndex >= 0)\n                    {\n                        if (operandIndex != currentOpIndex)\n                        {\n                            show_token = true;\n\n                            currentOpIndex = operandIndex;\n                            EDOperandRef operand;\n\n                            if (!EDGetOperand(&operand, m_inst, currentOpIndex))\n                            {\n                                if (EDOperandIsMemory(operand))\n                                {\n                                    uint64_t operand_value;\n\n                                    if (!EDEvaluateOperand(&operand_value, operand, IPRegisterReader, rra.get()))\n                                    {\n                                        if (EDInstIsBranch(m_inst))\n                                        {\n                                            operands.Printf(\"0x%llx \", operand_value);\n                                            show_token = false;\n                                        }\n                                        else\n                                        {\n                                            \/\/ Put the address value into the comment\n                                            comment.Printf(\"0x%llx \", operand_value);\n                                        }\n\n                                        lldb_private::Address so_addr;\n                                        if (exe_ctx && exe_ctx->target && !exe_ctx->target->GetSectionLoadList().IsEmpty())\n                                        {\n                                            if (exe_ctx->target->GetSectionLoadList().ResolveLoadAddress (operand_value, so_addr))\n                                                so_addr.Dump(&comment, exe_scope, Address::DumpStyleResolvedDescriptionNoModule, Address::DumpStyleSectionNameOffset);\n                                        }\n                                        else\n                                        {\n                                            Module *module = GetAddress().GetModule();\n                                            if (module)\n                                            {\n                                                if (module->ResolveFileAddress (operand_value, so_addr))\n                                                    so_addr.Dump(&comment, exe_scope, Address::DumpStyleResolvedDescriptionNoModule, Address::DumpStyleSectionNameOffset);\n                                            }\n                                        }\n\n                                    } \/\/ EDEvaluateOperand\n                                } \/\/ EDOperandIsMemory\n                            } \/\/ EDGetOperand\n                        } \/\/ operandIndex != currentOpIndex\n                    } \/\/ operandIndex >= 0\n                } \/\/ else(raw)\n\n                if (show_token)\n                {\n                    if(EDGetTokenString(&tokenStr, token))\n                    {\n                        printTokenized = false;\n                        break;\n                    }\n\n                    operands.PutCString(tokenStr);\n                }\n            } \/\/ for (tokenIndex)\n\n            if (printTokenized)\n            {\n                if (operands.GetString().empty())\n                {\n                    s->PutCString(opcode.GetString().c_str());\n                }\n                else\n                {\n                    PadString(s, opcode.GetString(), opcodeColumnWidth);\n\n                    if (comment.GetString().empty())\n                    {\n                        s->PutCString(operands.GetString().c_str());\n                    }\n                    else\n                    {\n                        PadString(s, operands.GetString(), operandColumnWidth);\n\n                        s->PutCString(\"; \");\n                        s->PutCString(comment.GetString().c_str());\n                    } \/\/ else (comment.GetString().empty())\n                } \/\/ else (operands.GetString().empty())\n            } \/\/ printTokenized\n        } \/\/ for (tokenIndex)\n    } \/\/ numTokens != -1\n\n    if (!printTokenized)\n    {\n        const char *str;\n\n        if (EDGetInstString(&str, m_inst))\n            return;\n        else\n            s->PutCString(str);\n    }\n}\n\nbool\nDisassemblerLLVM::InstructionLLVM::DoesBranch() const\n{\n    return EDInstIsBranch(m_inst);\n}\n\nsize_t\nDisassemblerLLVM::InstructionLLVM::GetByteSize() const\n{\n    return EDInstByteSize(m_inst);\n}\n\nsize_t\nDisassemblerLLVM::InstructionLLVM::Extract(const DataExtractor &data, uint32_t data_offset)\n{\n    if (EDCreateInsts(&m_inst, 1, m_disassembler, DataExtractorByteReader, data_offset, (void*)(&data)))\n        return EDInstByteSize(m_inst);\n    else\n        return 0;\n}\n\nstatic inline const char *\nTripleForArchSpec (const ArchSpec &arch, char *triple, size_t triple_len)\n{\n    const char *arch_name = arch.AsCString();\n\n    if (arch_name)\n    {\n        snprintf(triple, triple_len, \"%s-unknown-unknown\", arch_name);\n        return triple;\n    }\n    return NULL;\n}\n\nstatic inline EDAssemblySyntax_t\nSyntaxForArchSpec (const ArchSpec &arch)\n{\n    const char *arch_name = arch.AsCString();\n\n    if (arch_name != NULL && \n       ((strcasestr (arch_name, \"i386\") == arch_name) || \n        (strcasestr (arch_name, \"x86_64\") == arch_name)))\n        return kEDAssemblySyntaxX86ATT;\n    \n    return (EDAssemblySyntax_t)0;   \/\/ default\n}\n\nDisassembler *\nDisassemblerLLVM::CreateInstance(const ArchSpec &arch)\n{\n    char triple[256];\n\n    if (TripleForArchSpec (arch, triple, sizeof(triple)))\n        return new DisassemblerLLVM(arch);\n    return NULL;\n}\n\nDisassemblerLLVM::DisassemblerLLVM(const ArchSpec &arch) :\n    Disassembler(arch)\n{\n    char triple[256];\n    if (TripleForArchSpec (arch, triple, sizeof(triple)))\n    {\n        assert(!EDGetDisassembler(&m_disassembler, triple, SyntaxForArchSpec (arch)) && \"No disassembler created!\");\n    }\n}\n\nDisassemblerLLVM::~DisassemblerLLVM()\n{\n}\n\nsize_t\nDisassemblerLLVM::DecodeInstructions\n(\n    const Address &base_addr,\n    const DataExtractor& data,\n    uint32_t data_offset,\n    uint32_t num_instructions\n)\n{\n    size_t total_inst_byte_size = 0;\n\n    m_instruction_list.Clear();\n\n    while (data.ValidOffset(data_offset) && num_instructions)\n    {\n        Address inst_addr (base_addr);\n        inst_addr.Slide(data_offset);\n        InstructionSP inst_sp (new InstructionLLVM(m_disassembler, inst_addr));\n\n        size_t inst_byte_size = inst_sp->Extract (data, data_offset);\n\n        if (inst_byte_size == 0)\n            break;\n\n        m_instruction_list.Append (inst_sp);\n\n        total_inst_byte_size += inst_byte_size;\n        data_offset += inst_byte_size;\n        num_instructions--;\n    }\n\n    return total_inst_byte_size;\n}\n\nvoid\nDisassemblerLLVM::Initialize()\n{\n    PluginManager::RegisterPlugin (GetPluginNameStatic(),\n                                   GetPluginDescriptionStatic(),\n                                   CreateInstance);\n}\n\nvoid\nDisassemblerLLVM::Terminate()\n{\n    PluginManager::UnregisterPlugin (CreateInstance);\n}\n\n\nconst char *\nDisassemblerLLVM::GetPluginNameStatic()\n{\n    return \"disassembler.llvm\";\n}\n\nconst char *\nDisassemblerLLVM::GetPluginDescriptionStatic()\n{\n    return \"Disassembler that uses LLVM opcode tables to disassemble i386 and x86_64.\";\n}\n\n\/\/------------------------------------------------------------------\n\/\/ PluginInterface protocol\n\/\/------------------------------------------------------------------\nconst char *\nDisassemblerLLVM::GetPluginName()\n{\n    return \"DisassemblerLLVM\";\n}\n\nconst char *\nDisassemblerLLVM::GetShortPluginName()\n{\n    return GetPluginNameStatic();\n}\n\nuint32_t\nDisassemblerLLVM::GetPluginVersion()\n{\n    return 1;\n}\n\nvoid\nDisassemblerLLVM::GetPluginCommandHelp (const char *command, Stream *strm)\n{\n}\n\nError\nDisassemblerLLVM::ExecutePluginCommand (Args &command, Stream *strm)\n{\n    Error error;\n    error.SetErrorString(\"No plug-in command are currently supported.\");\n    return error;\n}\n\nLog *\nDisassemblerLLVM::EnablePluginLogging (Stream *strm, Args &command)\n{\n    return NULL;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- PDB.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 \"PDB.h\"\n#include \"Chunks.h\"\n#include \"Config.h\"\n#include \"Error.h\"\n#include \"SymbolTable.h\"\n#include \"Symbols.h\"\n#include \"llvm\/DebugInfo\/CodeView\/CVDebugRecord.h\"\n#include \"llvm\/DebugInfo\/CodeView\/CVTypeDumper.h\"\n#include \"llvm\/DebugInfo\/CodeView\/SymbolDumper.h\"\n#include \"llvm\/DebugInfo\/MSF\/ByteStream.h\"\n#include \"llvm\/DebugInfo\/MSF\/MSFBuilder.h\"\n#include \"llvm\/DebugInfo\/MSF\/MSFCommon.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/DbiStream.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/DbiStreamBuilder.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/InfoStream.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/InfoStreamBuilder.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/PDBFile.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/PDBFileBuilder.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/TpiStream.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/TpiStreamBuilder.h\"\n#include \"llvm\/Object\/COFF.h\"\n#include \"llvm\/Support\/Endian.h\"\n#include \"llvm\/Support\/FileOutputBuffer.h\"\n#include \"llvm\/Support\/ScopedPrinter.h\"\n#include <memory>\n\nusing namespace lld;\nusing namespace lld::coff;\nusing namespace llvm;\nusing namespace llvm::codeview;\nusing namespace llvm::support;\nusing namespace llvm::support::endian;\n\nusing llvm::object::coff_section;\n\nstatic ExitOnError ExitOnErr;\n\n\/\/ Returns a list of all SectionChunks.\nstatic std::vector<coff_section> getInputSections(SymbolTable *Symtab) {\n  std::vector<coff_section> V;\n  for (Chunk *C : Symtab->getChunks())\n    if (auto *SC = dyn_cast<SectionChunk>(C))\n      V.push_back(*SC->Header);\n  return V;\n}\n\nstatic SectionChunk *findByName(std::vector<SectionChunk *> &Sections,\n                                StringRef Name) {\n  for (SectionChunk *C : Sections)\n    if (C->getSectionName() == Name)\n      return C;\n  return nullptr;\n}\n\nstatic ArrayRef<uint8_t> getDebugT(ObjectFile *File) {\n  SectionChunk *Sec = findByName(File->getDebugChunks(), \".debug$T\");\n  if (!Sec)\n    return {};\n\n  \/\/ First 4 bytes are section magic.\n  ArrayRef<uint8_t> Data = Sec->getContents();\n  if (Data.size() < 4)\n    fatal(\".debug$T too short\");\n  if (read32le(Data.data()) != COFF::DEBUG_SECTION_MAGIC)\n    fatal(\".debug$T has an invalid magic\");\n  return Data.slice(4);\n}\n\nstatic void dumpDebugT(ScopedPrinter &W, ObjectFile *File) {\n  ArrayRef<uint8_t> Data = getDebugT(File);\n  if (Data.empty())\n    return;\n\n  msf::ByteStream Stream(Data);\n  CVTypeDumper TypeDumper(&W, false);\n  if (auto EC = TypeDumper.dump(Data))\n    fatal(EC, \"CVTypeDumper::dump failed\");\n}\n\nstatic void dumpDebugS(ScopedPrinter &W, ObjectFile *File) {\n  SectionChunk *Sec = findByName(File->getDebugChunks(), \".debug$S\");\n  if (!Sec)\n    return;\n\n  msf::ByteStream Stream(Sec->getContents());\n  CVSymbolArray Symbols;\n  msf::StreamReader Reader(Stream);\n  if (auto EC = Reader.readArray(Symbols, Reader.getLength()))\n    fatal(EC, \"StreamReader.readArray<CVSymbolArray> failed\");\n\n  CVTypeDumper TypeDumper(&W, false);\n  CVSymbolDumper SymbolDumper(W, TypeDumper, nullptr, false);\n  if (auto EC = SymbolDumper.dump(Symbols))\n    fatal(EC, \"CVSymbolDumper::dump failed\");\n}\n\n\/\/ Dump CodeView debug info. This is for debugging.\nstatic void dumpCodeView(SymbolTable *Symtab) {\n  ScopedPrinter W(outs());\n\n  for (ObjectFile *File : Symtab->ObjectFiles) {\n    dumpDebugT(W, File);\n    dumpDebugS(W, File);\n  }\n}\n\nstatic void addTypeInfo(SymbolTable *Symtab,\n                        pdb::TpiStreamBuilder &TpiBuilder) {\n  for (ObjectFile *File : Symtab->ObjectFiles) {\n    ArrayRef<uint8_t> Data = getDebugT(File);\n    if (Data.empty())\n      continue;\n\n    msf::ByteStream Stream(Data);\n    codeview::CVTypeArray Records;\n    msf::StreamReader Reader(Stream);\n    if (auto EC = Reader.readArray(Records, Reader.getLength()))\n      fatal(EC, \"Reader.readArray failed\");\n    for (const codeview::CVType &Rec : Records)\n      TpiBuilder.addTypeRecord(Rec);\n  }\n}\n\n\/\/ Creates a PDB file.\nvoid coff::createPDB(StringRef Path, SymbolTable *Symtab,\n                     ArrayRef<uint8_t> SectionTable,\n                     const llvm::codeview::DebugInfo *DI) {\n  if (Config->DumpPdb)\n    dumpCodeView(Symtab);\n\n  BumpPtrAllocator Alloc;\n  pdb::PDBFileBuilder Builder(Alloc);\n  ExitOnErr(Builder.initialize(4096)); \/\/ 4096 is blocksize\n\n  \/\/ Create streams in MSF for predefined streams, namely\n  \/\/ PDB, TPI, DBI and IPI.\n  for (int I = 0; I < (int)pdb::kSpecialStreamCount; ++I)\n    ExitOnErr(Builder.getMsfBuilder().addStream(0));\n\n  \/\/ Add an Info stream.\n  auto &InfoBuilder = Builder.getInfoBuilder();\n  InfoBuilder.setAge(DI->PDB70.Age);\n  InfoBuilder.setGuid(\n      *reinterpret_cast<const pdb::PDB_UniqueId *>(&DI->PDB70.Signature));\n  \/\/ Should be the current time, but set 0 for reproducibilty.\n  InfoBuilder.setSignature(0);\n  InfoBuilder.setVersion(pdb::PdbRaw_ImplVer::PdbImplVC70);\n\n  \/\/ Add an empty DPI stream.\n  auto &DbiBuilder = Builder.getDbiBuilder();\n  DbiBuilder.setVersionHeader(pdb::PdbDbiV110);\n\n  \/\/ Add an empty TPI stream.\n  auto &TpiBuilder = Builder.getTpiBuilder();\n  TpiBuilder.setVersionHeader(pdb::PdbTpiV80);\n  if (Config->DebugPdb)\n    addTypeInfo(Symtab, TpiBuilder);\n\n  \/\/ Add an empty IPI stream.\n  auto &IpiBuilder = Builder.getIpiBuilder();\n  IpiBuilder.setVersionHeader(pdb::PdbTpiV80);\n\n  \/\/ Add Section Contributions.\n  std::vector<pdb::SectionContrib> Contribs =\n      pdb::DbiStreamBuilder::createSectionContribs(getInputSections(Symtab));\n  DbiBuilder.setSectionContribs(Contribs);\n\n  \/\/ Add Section Map stream.\n  ArrayRef<object::coff_section> Sections = {\n      (const object::coff_section *)SectionTable.data(),\n      SectionTable.size() \/ sizeof(object::coff_section)};\n  std::vector<pdb::SecMapEntry> SectionMap =\n      pdb::DbiStreamBuilder::createSectionMap(Sections);\n  DbiBuilder.setSectionMap(SectionMap);\n\n  ExitOnErr(DbiBuilder.addModuleInfo(\"\", \"* Linker *\"));\n\n  \/\/ Add COFF section header stream.\n  ExitOnErr(\n      DbiBuilder.addDbgStream(pdb::DbgHeaderType::SectionHdr, SectionTable));\n\n  \/\/ Write to a file.\n  ExitOnErr(Builder.commit(Path));\n}\n<commit_msg>[CodeView] Finish decoupling TypeDatabase from TypeDumper.<commit_after>\/\/===- PDB.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 \"PDB.h\"\n#include \"Chunks.h\"\n#include \"Config.h\"\n#include \"Error.h\"\n#include \"SymbolTable.h\"\n#include \"Symbols.h\"\n#include \"llvm\/DebugInfo\/CodeView\/CVDebugRecord.h\"\n#include \"llvm\/DebugInfo\/CodeView\/CVTypeDumper.h\"\n#include \"llvm\/DebugInfo\/CodeView\/SymbolDumper.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeDatabase.h\"\n#include \"llvm\/DebugInfo\/CodeView\/TypeDumpVisitor.h\"\n#include \"llvm\/DebugInfo\/MSF\/ByteStream.h\"\n#include \"llvm\/DebugInfo\/MSF\/MSFBuilder.h\"\n#include \"llvm\/DebugInfo\/MSF\/MSFCommon.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/DbiStream.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/DbiStreamBuilder.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/InfoStream.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/InfoStreamBuilder.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/PDBFile.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/PDBFileBuilder.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/TpiStream.h\"\n#include \"llvm\/DebugInfo\/PDB\/Raw\/TpiStreamBuilder.h\"\n#include \"llvm\/Object\/COFF.h\"\n#include \"llvm\/Support\/Endian.h\"\n#include \"llvm\/Support\/FileOutputBuffer.h\"\n#include \"llvm\/Support\/ScopedPrinter.h\"\n#include <memory>\n\nusing namespace lld;\nusing namespace lld::coff;\nusing namespace llvm;\nusing namespace llvm::codeview;\nusing namespace llvm::support;\nusing namespace llvm::support::endian;\n\nusing llvm::object::coff_section;\n\nstatic ExitOnError ExitOnErr;\n\n\/\/ Returns a list of all SectionChunks.\nstatic std::vector<coff_section> getInputSections(SymbolTable *Symtab) {\n  std::vector<coff_section> V;\n  for (Chunk *C : Symtab->getChunks())\n    if (auto *SC = dyn_cast<SectionChunk>(C))\n      V.push_back(*SC->Header);\n  return V;\n}\n\nstatic SectionChunk *findByName(std::vector<SectionChunk *> &Sections,\n                                StringRef Name) {\n  for (SectionChunk *C : Sections)\n    if (C->getSectionName() == Name)\n      return C;\n  return nullptr;\n}\n\nstatic ArrayRef<uint8_t> getDebugT(ObjectFile *File) {\n  SectionChunk *Sec = findByName(File->getDebugChunks(), \".debug$T\");\n  if (!Sec)\n    return {};\n\n  \/\/ First 4 bytes are section magic.\n  ArrayRef<uint8_t> Data = Sec->getContents();\n  if (Data.size() < 4)\n    fatal(\".debug$T too short\");\n  if (read32le(Data.data()) != COFF::DEBUG_SECTION_MAGIC)\n    fatal(\".debug$T has an invalid magic\");\n  return Data.slice(4);\n}\n\nstatic void dumpDebugT(ScopedPrinter &W, ObjectFile *File) {\n  ArrayRef<uint8_t> Data = getDebugT(File);\n  if (Data.empty())\n    return;\n\n  TypeDatabase TDB;\n  TypeDumpVisitor TDV(TDB, &W, false);\n  CVTypeDumper TypeDumper(TDB);\n  if (auto EC = TypeDumper.dump(Data, TDV))\n    fatal(EC, \"CVTypeDumper::dump failed\");\n}\n\nstatic void dumpDebugS(ScopedPrinter &W, ObjectFile *File) {\n  SectionChunk *Sec = findByName(File->getDebugChunks(), \".debug$S\");\n  if (!Sec)\n    return;\n\n  msf::ByteStream Stream(Sec->getContents());\n  CVSymbolArray Symbols;\n  msf::StreamReader Reader(Stream);\n  if (auto EC = Reader.readArray(Symbols, Reader.getLength()))\n    fatal(EC, \"StreamReader.readArray<CVSymbolArray> failed\");\n\n  TypeDatabase TDB;\n  CVSymbolDumper SymbolDumper(W, TDB, nullptr, false);\n  if (auto EC = SymbolDumper.dump(Symbols))\n    fatal(EC, \"CVSymbolDumper::dump failed\");\n}\n\n\/\/ Dump CodeView debug info. This is for debugging.\nstatic void dumpCodeView(SymbolTable *Symtab) {\n  ScopedPrinter W(outs());\n\n  for (ObjectFile *File : Symtab->ObjectFiles) {\n    dumpDebugT(W, File);\n    dumpDebugS(W, File);\n  }\n}\n\nstatic void addTypeInfo(SymbolTable *Symtab,\n                        pdb::TpiStreamBuilder &TpiBuilder) {\n  for (ObjectFile *File : Symtab->ObjectFiles) {\n    ArrayRef<uint8_t> Data = getDebugT(File);\n    if (Data.empty())\n      continue;\n\n    msf::ByteStream Stream(Data);\n    codeview::CVTypeArray Records;\n    msf::StreamReader Reader(Stream);\n    if (auto EC = Reader.readArray(Records, Reader.getLength()))\n      fatal(EC, \"Reader.readArray failed\");\n    for (const codeview::CVType &Rec : Records)\n      TpiBuilder.addTypeRecord(Rec);\n  }\n}\n\n\/\/ Creates a PDB file.\nvoid coff::createPDB(StringRef Path, SymbolTable *Symtab,\n                     ArrayRef<uint8_t> SectionTable,\n                     const llvm::codeview::DebugInfo *DI) {\n  if (Config->DumpPdb)\n    dumpCodeView(Symtab);\n\n  BumpPtrAllocator Alloc;\n  pdb::PDBFileBuilder Builder(Alloc);\n  ExitOnErr(Builder.initialize(4096)); \/\/ 4096 is blocksize\n\n  \/\/ Create streams in MSF for predefined streams, namely\n  \/\/ PDB, TPI, DBI and IPI.\n  for (int I = 0; I < (int)pdb::kSpecialStreamCount; ++I)\n    ExitOnErr(Builder.getMsfBuilder().addStream(0));\n\n  \/\/ Add an Info stream.\n  auto &InfoBuilder = Builder.getInfoBuilder();\n  InfoBuilder.setAge(DI->PDB70.Age);\n  InfoBuilder.setGuid(\n      *reinterpret_cast<const pdb::PDB_UniqueId *>(&DI->PDB70.Signature));\n  \/\/ Should be the current time, but set 0 for reproducibilty.\n  InfoBuilder.setSignature(0);\n  InfoBuilder.setVersion(pdb::PdbRaw_ImplVer::PdbImplVC70);\n\n  \/\/ Add an empty DPI stream.\n  auto &DbiBuilder = Builder.getDbiBuilder();\n  DbiBuilder.setVersionHeader(pdb::PdbDbiV110);\n\n  \/\/ Add an empty TPI stream.\n  auto &TpiBuilder = Builder.getTpiBuilder();\n  TpiBuilder.setVersionHeader(pdb::PdbTpiV80);\n  if (Config->DebugPdb)\n    addTypeInfo(Symtab, TpiBuilder);\n\n  \/\/ Add an empty IPI stream.\n  auto &IpiBuilder = Builder.getIpiBuilder();\n  IpiBuilder.setVersionHeader(pdb::PdbTpiV80);\n\n  \/\/ Add Section Contributions.\n  std::vector<pdb::SectionContrib> Contribs =\n      pdb::DbiStreamBuilder::createSectionContribs(getInputSections(Symtab));\n  DbiBuilder.setSectionContribs(Contribs);\n\n  \/\/ Add Section Map stream.\n  ArrayRef<object::coff_section> Sections = {\n      (const object::coff_section *)SectionTable.data(),\n      SectionTable.size() \/ sizeof(object::coff_section)};\n  std::vector<pdb::SecMapEntry> SectionMap =\n      pdb::DbiStreamBuilder::createSectionMap(Sections);\n  DbiBuilder.setSectionMap(SectionMap);\n\n  ExitOnErr(DbiBuilder.addModuleInfo(\"\", \"* Linker *\"));\n\n  \/\/ Add COFF section header stream.\n  ExitOnErr(\n      DbiBuilder.addDbgStream(pdb::DbgHeaderType::SectionHdr, SectionTable));\n\n  \/\/ Write to a file.\n  ExitOnErr(Builder.commit(Path));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"stdsneezy.h\"\n#include \"obj_tool.h\"\n\nint task_lightfire(TBeing *ch, cmdTypeT cmd, const char *, int pulse, TRoom *, TObj *obj)\n{\n  TThing *t, *t2;\n  TMonster *guard;\n  TTool *flintsteel=NULL;\n  int found=0;\n\n  if (ch->utilityTaskCommand(cmd) || ch->nobrainerTaskCommand(cmd))\n    return FALSE;\n\n  \/\/ basic tasky safechecking\n  if (ch->isLinkdead() || (ch->in_room != ch->task->wasInRoom) || !obj){\n    act(\"You cease your pyrotechnic activity.\",\n        FALSE, ch, 0, 0, TO_CHAR);\n    act(\"$n stops trying to start a fire.\",\n        TRUE, ch, 0, 0, TO_ROOM);\n    ch->stopTask();\n    return FALSE; \/\/ returning FALSE lets command be interpreted\n  }\n\n  \/\/ make sure the thing we're trying to burn is still around\n  if((obj != ch->heldInPrimHand()) && (obj != ch->heldInSecHand())){\n    for (t = ch->roomp->getStuff(); t; t = t2) {\n      t2 = t->nextThing;\n      if(obj==dynamic_cast<TObj *>(t))\n        found=1;\n    }\n    if(!found){\n      act(\"You can't find $p and stop trying to light it on fire.\",\n          FALSE, ch, obj, 0, TO_CHAR);\n      act(\"$n stops trying to start a fire.\",\n          TRUE, ch, obj, 0, TO_ROOM);\n      ch->stopTask();\n      return FALSE; \/\/ returning FALSE lets command be interpreted\n    }\n  }\n\n  \/\/ find our tool here\n  if (!(t = get_thing_char_using(ch, \"flintsteel\", 0, FALSE, FALSE)) ||\n      !(flintsteel=dynamic_cast<TTool *>(t))){\n    ch->sendTo(\"You need to own some flint and steel to light that.\\n\\r\");\n    ch->stopTask();\n    return FALSE;\n  }\n\n  \/\/ check for guards that prevent\n  for (t = ch->roomp->getStuff(); t; t = t2) {\n    t2 = t->nextThing;\n    guard = dynamic_cast<TMonster *>(t);\n    if (!guard)\n      continue;\n    if (!guard->isPolice() || !guard->canSee(ch) ||\n         !guard->awake())\n      continue;\n    guard->doSay(\"Hey!  Cut that out, you trying to burn the place down?\");\n    act(\"You cease your pyrotechnic activity.\",\n        FALSE, ch, 0, 0, TO_CHAR);\n    act(\"$n stops trying to start a fire.\",\n        TRUE, ch, 0, 0, TO_ROOM);\n    ch->stopTask();\n    return FALSE;\n  }\n\n  if (ch->task->timeLeft < 0){\n    if(material_nums[obj->getMaterial()].flammability){\n      obj->setBurning(ch);\n\n      act(\"You set $p on fire.\",\n          FALSE, ch, obj, 0, TO_CHAR);\n      act(\"$n sets $p on fire.\",\n          TRUE, ch, obj, 0, TO_ROOM);\n    } else {\n      act(\"That $o doesn't seem to be flammable.\",\n          FALSE, ch, obj, 0, TO_CHAR);\n      act(\"$n stops trying to start a fire.\",\n          TRUE, ch, 0, 0, TO_ROOM);\n    }\n    ch->stopTask();\n    return FALSE;\n  }\n  switch (cmd) {\n  case CMD_TASK_CONTINUE:\n    \/\/ low flammability is very slow (10), wood is about 3\n      ch->task->calcNextUpdate(pulse, PULSE_MOBACT *\n             (10-(material_nums[obj->getMaterial()].flammability\/70)));\n\n      flintsteel->addToToolUses(-1);\n      if (flintsteel->getToolUses() <= 0) {\n        act(\"Oops, your $o has been used up.\",\n            FALSE, ch, flintsteel, 0, TO_CHAR);\n        act(\"$n looks startled as $e realizes that his $o has been used up.\",\n            FALSE, ch, flintsteel, 0, TO_ROOM);\n        ch->stopTask();\n        delete flintsteel;\n        return FALSE;\n      }\n\n      switch (ch->task->timeLeft) {\n      case 2:\n          act(\"You lay some thin <o>wood shavings<1> around the $o.\",\n              FALSE, ch, obj, 0, TO_CHAR);\n          act(\"$n lays some thin <o>wood shavings<1> around the $o.\",\n              TRUE, ch, obj, 0, TO_ROOM);\n          ch->task->timeLeft--;\n          break;\n      case 1:\n          act(\"You strike your $o, sending <Y>sparks<1> into the <o>wood shavings<1>.\",\n              FALSE, ch, flintsteel, 0, TO_CHAR);\n          act(\"$n strikes $s $o, sending <Y>sparks<1> into the <o>wood shavings<1>.\",\n              TRUE, ch, flintsteel, 0, TO_ROOM);\n          ch->task->timeLeft--;\n          break;\n      case 0:\n          act(\"You carefully fan the <r>flames<1> towards $p.\",\n              FALSE, ch, obj, 0, TO_CHAR);\n          act(\"$n carefully fans the <r>flames<1> towards $p.\",\n              TRUE, ch, obj, 0, TO_ROOM);\n          ch->task->timeLeft--;\n          break;\n      }\n      break;\n  case CMD_ABORT:\n  case CMD_STOP:\n      act(\"You cease your pyrotechnic activity.\",\n          FALSE, ch, 0, 0, TO_CHAR);\n      act(\"$n stops trying to start a fire.\",\n          TRUE, ch, 0, 0, TO_ROOM);\n      ch->stopTask();\n      break;\n  case CMD_TASK_FIGHTING:\n      ch->sendTo(\"You can't properly start a fire while under attack.\\n\\r\");\n      ch->stopTask();\n      break;\n  default:\n      if (cmd < MAX_CMD_LIST)\n        warn_busy(ch);\n      break;                    \/\/ eat the command\n  }\n  return TRUE;\n}\n\n<commit_msg>fixed crash bug when object being lit disappears<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"stdsneezy.h\"\n#include \"obj_tool.h\"\n\nint task_lightfire(TBeing *ch, cmdTypeT cmd, const char *, int pulse, TRoom *, TObj *obj)\n{\n  TThing *t, *t2;\n  TMonster *guard;\n  TTool *flintsteel=NULL;\n  int found=0;\n\n  if (ch->utilityTaskCommand(cmd) || ch->nobrainerTaskCommand(cmd))\n    return FALSE;\n\n  \/\/ basic tasky safechecking\n  if (ch->isLinkdead() || (ch->in_room != ch->task->wasInRoom) || !obj){\n    act(\"You cease your pyrotechnic activity.\",\n        FALSE, ch, 0, 0, TO_CHAR);\n    act(\"$n stops trying to start a fire.\",\n        TRUE, ch, 0, 0, TO_ROOM);\n    ch->stopTask();\n    return FALSE; \/\/ returning FALSE lets command be interpreted\n  }\n\n  \/\/ make sure the thing we're trying to burn is still around\n  if((obj != ch->heldInPrimHand()) && (obj != ch->heldInSecHand())){\n    for (t = ch->roomp->getStuff(); t; t = t2) {\n      t2 = t->nextThing;\n      if(obj==dynamic_cast<TObj *>(t))\n        found=1;\n    }\n    if(!found){\n      act(\"You can't find your target and stop trying to light it on fire.\",\n          FALSE, ch, 0, 0, TO_CHAR);\n      act(\"$n stops trying to start a fire.\",\n          TRUE, ch, 0, 0, TO_ROOM);\n      ch->stopTask();\n      return FALSE; \/\/ returning FALSE lets command be interpreted\n    }\n  }\n\n  \/\/ find our tool here\n  if (!(t = get_thing_char_using(ch, \"flintsteel\", 0, FALSE, FALSE)) ||\n      !(flintsteel=dynamic_cast<TTool *>(t))){\n    ch->sendTo(\"You need to own some flint and steel to light that.\\n\\r\");\n    ch->stopTask();\n    return FALSE;\n  }\n\n  \/\/ check for guards that prevent\n  for (t = ch->roomp->getStuff(); t; t = t2) {\n    t2 = t->nextThing;\n    guard = dynamic_cast<TMonster *>(t);\n    if (!guard)\n      continue;\n    if (!guard->isPolice() || !guard->canSee(ch) ||\n         !guard->awake())\n      continue;\n    guard->doSay(\"Hey!  Cut that out, you trying to burn the place down?\");\n    act(\"You cease your pyrotechnic activity.\",\n        FALSE, ch, 0, 0, TO_CHAR);\n    act(\"$n stops trying to start a fire.\",\n        TRUE, ch, 0, 0, TO_ROOM);\n    ch->stopTask();\n    return FALSE;\n  }\n\n  if (ch->task->timeLeft < 0){\n    if(material_nums[obj->getMaterial()].flammability){\n      obj->setBurning(ch);\n\n      act(\"You set $p on fire.\",\n          FALSE, ch, obj, 0, TO_CHAR);\n      act(\"$n sets $p on fire.\",\n          TRUE, ch, obj, 0, TO_ROOM);\n    } else {\n      act(\"That $o doesn't seem to be flammable.\",\n          FALSE, ch, obj, 0, TO_CHAR);\n      act(\"$n stops trying to start a fire.\",\n          TRUE, ch, 0, 0, TO_ROOM);\n    }\n    ch->stopTask();\n    return FALSE;\n  }\n  switch (cmd) {\n  case CMD_TASK_CONTINUE:\n    \/\/ low flammability is very slow (10), wood is about 3\n      ch->task->calcNextUpdate(pulse, PULSE_MOBACT *\n             (10-(material_nums[obj->getMaterial()].flammability\/70)));\n\n      flintsteel->addToToolUses(-1);\n      if (flintsteel->getToolUses() <= 0) {\n        act(\"Oops, your $o has been used up.\",\n            FALSE, ch, flintsteel, 0, TO_CHAR);\n        act(\"$n looks startled as $e realizes that his $o has been used up.\",\n            FALSE, ch, flintsteel, 0, TO_ROOM);\n        ch->stopTask();\n        delete flintsteel;\n        return FALSE;\n      }\n\n      switch (ch->task->timeLeft) {\n      case 2:\n          act(\"You lay some thin <o>wood shavings<1> around the $o.\",\n              FALSE, ch, obj, 0, TO_CHAR);\n          act(\"$n lays some thin <o>wood shavings<1> around the $o.\",\n              TRUE, ch, obj, 0, TO_ROOM);\n          ch->task->timeLeft--;\n          break;\n      case 1:\n          act(\"You strike your $o, sending <Y>sparks<1> into the <o>wood shavings<1>.\",\n              FALSE, ch, flintsteel, 0, TO_CHAR);\n          act(\"$n strikes $s $o, sending <Y>sparks<1> into the <o>wood shavings<1>.\",\n              TRUE, ch, flintsteel, 0, TO_ROOM);\n          ch->task->timeLeft--;\n          break;\n      case 0:\n          act(\"You carefully fan the <r>flames<1> towards $p.\",\n              FALSE, ch, obj, 0, TO_CHAR);\n          act(\"$n carefully fans the <r>flames<1> towards $p.\",\n              TRUE, ch, obj, 0, TO_ROOM);\n          ch->task->timeLeft--;\n          break;\n      }\n      break;\n  case CMD_ABORT:\n  case CMD_STOP:\n      act(\"You cease your pyrotechnic activity.\",\n          FALSE, ch, 0, 0, TO_CHAR);\n      act(\"$n stops trying to start a fire.\",\n          TRUE, ch, 0, 0, TO_ROOM);\n      ch->stopTask();\n      break;\n  case CMD_TASK_FIGHTING:\n      ch->sendTo(\"You can't properly start a fire while under attack.\\n\\r\");\n      ch->stopTask();\n      break;\n  default:\n      if (cmd < MAX_CMD_LIST)\n        warn_busy(ch);\n      break;                    \/\/ eat the command\n  }\n  return TRUE;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ITEMS.H\"\n\n#include \"CONTROL.H\"\n#include \"DRAW.H\"\n#include \"OBJECTS.H\"\n#ifdef PC_VERSION\n#include \"GAME.H\"\n#include \"INIT.H\"\n#else\n#include \"SETUP.H\"\n#endif\n#include \"SPECIFIC.H\"\n#include \"SPECTYPES.H\"\n#include <stddef.h>\n#include <assert.h>\n#include \"EFFECTS.H\"\n#include \"MALLOC.H\"\n#include \"EFFECT2.H\"\n#include \"LARA.H\"\n\nint level_items;\nshort next_item_free;\nshort next_item_active;\nshort GlobalPulleyFrigItem;\n\nvoid EffectNewRoom(short fx_num, short room_number)\/\/42320, 42774 (F)\n{\n\tif(InItemControlLoop)\n\t{\n\t\tItemNewRooms[ItemNewRoomNo][0] = fx_num;\n\t\tItemNewRooms[ItemNewRoomNo][1] = room_number;\n\t\tItemNewRoomNo++;\n\t}\n\telse\n\t{\n\t\tstruct FX_INFO* fx = &effects[fx_num];\n\t\tstruct room_info* r = &room[fx->room_number];\n\n\t\tif (r->fx_number == fx_num)\n\t\t{\n\t\t\tr->fx_number = fx->next_fx;\n\t\t}\n\t\telse if(r->fx_number != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = effects[r->fx_number].next_fx; linknum != -1; linknum = effects[linknum].next_fx)\n\t\t\t{\n\t\t\t\tif (linknum == fx_num)\n\t\t\t\t{\n\t\t\t\t\teffects[r->fx_number].next_fx = fx->next_fx;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfx->room_number = room_number;\n\t\tfx->next_fx = room[room_number].fx_number;\n\t\troom[room_number].fx_number = fx_num;\n\t}\n}\n\nvoid KillEffect(short fx_num)\/\/42178, 425CC (F)\n{\n\tif (InItemControlLoop)\n\t{\n\t\tItemNewRooms[ItemNewRoomNo][0] = fx_num | 0x8000;\n\t\tItemNewRoomNo++;\n\t}\n\telse\n\t{\n\t\tstruct FX_INFO* fx = &effects[fx_num];\t\t\n\n\t\tDetatchSpark(fx_num, 128);\n\n\t\tif (next_fx_active == fx_num)\n\t\t{\n\t\t\tnext_fx_active = fx->next_active;\n\t\t}\n\t\telse if (next_fx_active != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = effects[next_fx_active].next_active; linknum != -1; linknum = effects[linknum].next_active)\n\t\t\t{\n\t\t\t\tif (linknum == fx_num)\n\t\t\t\t{\n\t\t\t\t\teffects[linknum].next_active = fx->next_active;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (room[fx->room_number].fx_number == fx_num)\n\t\t{\n\t\t\troom[fx->room_number].fx_number = fx->next_fx;\n\t\t}\n\t\telse if (room[fx->room_number].fx_number != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = effects[room[fx->room_number].fx_number].next_fx; linknum != -1; linknum = effects[linknum].next_fx)\n\t\t\t{\n\t\t\t\tif (linknum == fx_num)\n\t\t\t\t{\n\t\t\t\t\teffects[room[fx->room_number].fx_number].next_fx = fx->next_fx;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfx->next_fx = next_fx_free;\n\t\tnext_fx_free = fx_num;\n\t}\n}\n\nshort CreateEffect(short room_num)\/\/420E0(<), 42534(<) (F)\n{\n\tstruct room_info* r;\n\tstruct FX_INFO* fx;\n\tshort fx_num = next_fx_free;\n\n\tif (next_fx_free != -1)\n\t{\n\t\tfx = &effects[next_fx_free];\n\t\tnext_fx_free = fx->object_number;\n\t\tr = &room[room_num];\n\t\tfx->room_number = room_num;\n\t\tfx->next_fx = r->fx_number;\n\t\tr->fx_number = fx_num;\n\t\tfx->next_active = next_fx_active;\n\t\tnext_fx_active = fx_num;\n\t\tfx->shade = GRAY555;\n\t}\n\n\treturn fx_num;\n}\n\nvoid InitialiseFXArray(int allocmem)\/\/4207C(<), 424D0(<) (F)\n{\n\tint i;\n\tstruct FX_INFO* fx;\n\n\tif (allocmem)\n\t\teffects = (struct FX_INFO*)game_malloc(24 * sizeof(struct FX_INFO));\n\n\tfx = effects;\n\tnext_fx_active = -1;\n\tnext_fx_free = 0;\n\tfor (i = 1; i <= 24; i++)\n\t{\n\t\tfx->next_fx = i++;\n\t\t++fx;\n\t}\n\tfx->next_fx = -1;\n}\n\nvoid AddActiveItem(short item_num)\/\/41FEC(<), 42440(<) (F)\n{\n\tstruct ITEM_INFO* item;\n\n\titem = &items[item_num];\n\n\titem->flags |= 0x20;\n\n\tif (objects[item->object_number].control == NULL)\/\/Bug: Always zero due to incomplete level data relocation\n\t{\n\t\titem->status = ITEM_INACTIVE;\n\t\treturn;\n\t}\n\n\tif (!item->active)\n\t{\n\t\titem->active = TRUE;\n\t\titem->next_active = next_item_active;\n\t\tnext_item_active = item_num;\n\t}\n}\n\nvoid RemoveDrawnItem(short item_num)\/\/41F48, 4239C (F)\n{\n\tstruct ITEM_INFO* item = &items[item_num];\n\n\tif (room[item->room_number].item_number == item_num)\n\t{\n\t\troom[item->room_number].item_number = item->next_item;\n\t}\n\telse if (room[item->room_number].item_number != -1)\n\t{\n\t\tshort linknum;\n\t\tfor (linknum = items[room[item->room_number].item_number].next_item; linknum != -1; linknum = items[linknum].next_item)\n\t\t{\n\t\t\tif (linknum == item_num)\n\t\t\t{\n\t\t\t\titems[linknum].next_item = items[item_num].next_item;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid RemoveActiveItem(short item_num)\/\/41E98, 422EC (F)\n{\n\tif (items[item_num].active)\n\t{\n\t\titems[item_num].active = FALSE;\n\n\t\tif (next_item_active == item_num)\n\t\t{\n\t\t\tnext_item_active = items[item_num].next_active;\n\t\t}\n\t\telse if(next_item_active != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = items[next_item_active].next_active; linknum != -1; linknum = items[linknum].next_active)\n\t\t\t{\n\t\t\t\tif (linknum == item_num)\n\t\t\t\t{\n\t\t\t\t\titems[linknum].next_active = items[item_num].next_active;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid InitialiseItem(short item_num)\/\/41BEC(<), 42040 (F)\n{\n\tstruct ITEM_INFO* item;\n\tstruct room_info* r;\n\tstruct FLOOR_INFO* floor;\n\t\n\titem = &items[item_num];\n\titem->anim_number = objects[item->object_number].anim_index;\n\titem->frame_number = anims[item->anim_number].frame_base;\n\n\titem->required_anim_state = 0;\n\titem->goal_anim_state = anims[item->anim_number].current_anim_state;\n\titem->current_anim_state = anims[item->anim_number].current_anim_state;\n\n\titem->pos.z_rot = 0;\n\titem->pos.x_rot = 0;\n\n\titem->fallspeed = 0;\n\titem->speed = 0;\n\n\titem->item_flags[3] = 0;\n\titem->item_flags[2] = 0;\n\titem->item_flags[1] = 0;\n\titem->item_flags[0] = 0;\n\n\titem->active = FALSE;\n\titem->status = ITEM_INACTIVE;\n\titem->gravity_status = FALSE;\n\titem->hit_status = FALSE;\n\titem->collidable = TRUE;\n\titem->looked_at = FALSE;\n\titem->dynamic_light = FALSE;\n\titem->poisoned = FALSE;\n\titem->ai_bits = 0;\n\titem->really_active = FALSE;\n\n\titem->timer = 0;\n\n\titem->hit_points = objects[item->object_number].hit_points;\n\t\n\tif (item->object_number == HK_ITEM || \n\t\titem->object_number == HK_AMMO_ITEM || \n\t\titem->object_number == CROSSBOW_ITEM || \n\t\titem->object_number == REVOLVER_ITEM)\n\t{\n\t\titem->mesh_bits = 1;\n\t}\n\telse\n\t{\n\t\titem->mesh_bits = 0xFFFFFFFF;\n\t}\n\n\titem->touch_bits = 0;\n\titem->after_death = 0;\n\titem->fired_weapon = 0;\n\titem->data = NULL;\n\n\tif (item->flags & IFLAG_INVISIBLE)\n\t{\n\t\titem->flags &= ~IFLAG_INVISIBLE;\n\t\titem->status = ITEM_INVISIBLE;\n\t}\n\telse if (objects[item->object_number].intelligent)\n\t{\n\t\titem->status = ITEM_INVISIBLE;\n\t}\n\n\tif ((item->flags & IFLAG_ACTIVATION_MASK) == IFLAG_ACTIVATION_MASK)\n\t{\n\t\titem->flags &= ~IFLAG_ACTIVATION_MASK;\n\t\titem->flags |= IFLAG_REVERSE;\n\t\tAddActiveItem(item_num);\n\t\titem->status = ITEM_ACTIVE;\n\t}\n\n\tr = &room[item->room_number];\n\n\titem->next_item = r->item_number;\n\tr->item_number = item_num;\n\n\tfloor = &r->floor[((item->pos.z_pos - r->z) \/ SECTOR(1)) + (((item->pos.x_pos - r->x) \/ SECTOR(1)) * r->x_size)];\n\n\titem->floor = floor->floor * 256;\n\titem->box_number = floor->box;\n\n\tif (objects[item->object_number].initialise != NULL)\n\t{\n\t\tobjects[item->object_number].initialise(item_num);\n\t}\n\n\titem->il.Light[3].pad = 0;\n\n#if PC_VERSION\n\tS_Warn(\"[InitialiseItem] - Unimplemented end of function!\\n\");\n#endif\n}\n\nshort CreateItem()\/\/41BAC(<), 42000(<) (F)\n{\n\tshort item_num = 0;\n\n\tif (next_item_free == -1) return -1;\n\n\titem_num = next_item_free;\n\titems[next_item_free].flags = 0;\n\tnext_item_free = items[next_item_free].next_item;\n\n\treturn item_num;\n}\n\nvoid KillItem(short item_num)\/\/41950, 41DA4 (F)\n{\n\tif (InItemControlLoop)\n\t{\n\t\tItemNewRooms[ItemNewRoomNo][0] = item_num | 0x8000;\n\t\tItemNewRoomNo++;\n\t}\n\telse\n\t{\n\t\tstruct ITEM_INFO* item = &items[item_num];\n\n\t\tDetatchSpark(item_num, 128);\n\n\t\titem->active = FALSE;\n\t\titem->really_active = FALSE;\n\n\t\tif (next_item_active == item_num)\n\t\t{\n\t\t\tnext_item_active = item->next_active;\n\t\t}\n\t\telse if (next_item_active != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = items[next_item_active].next_active; linknum != -1; linknum = items[linknum].next_active)\n\t\t\t{\n\t\t\t\tif (linknum == item_num)\n\t\t\t\t{\n\t\t\t\t\titems[linknum].next_active = item->next_active;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (item->room_number != 255)\n\t\t{\n\t\t\tif (room[item->room_number].item_number == item_num)\n\t\t\t{\n\t\t\t\troom[item->room_number].item_number = item->next_item;\n\t\t\t}\n\t\t\telse if (room[item->room_number].item_number != -1)\n\t\t\t{\n\t\t\t\tshort linknum;\n\t\t\t\tfor (linknum = items[room[item->room_number].item_number].next_item; linknum != -1; linknum = items[linknum].next_item)\n\t\t\t\t{\n\t\t\t\t\tif (linknum == item_num)\n\t\t\t\t\t{\n\t\t\t\t\t\titems[room[item->room_number].item_number].next_item = item->next_item;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (item == lara.target)\n\t\t{\n\t\t\tlara.target = NULL;\n\t\t}\n\n\t\tif (item_num >= level_items)\n\t\t{\n\t\t\titem->next_item = next_item_free;\n\t\t\tnext_item_free = item_num;\n\t\t}\n\t\telse\n\t\t{\n\t\t\titem->flags |= IFLAG_KILLED;\n\t\t}\n\t}\n}\n\nvoid InitialiseItemArray(int numitems)\/\/418E8(<), 41D3C(<) (F)\n{\n\tint i;\n\tstruct ITEM_INFO* item;\n\n\titem = &items[level_items];\n\tnext_item_active = -1;\n\tnext_item_free = level_items;\n\n\tif (level_items + 1 < numitems)\n\t{\n\t\tfor (i = level_items + 1; i < numitems; i++, item++)\n\t\t{\n\t\t\titem->next_item = i;\n\t\t\titem->active = FALSE;\n\t\t}\n\t}\n\n\titem->next_item = -1;\n\treturn;\n}\n\nvoid ItemNewRoom(short item_num, short room_number)\/\/7C608(<), 7E64C(<) (F)\n{\n\tif (InItemControlLoop)\n\t{\n\t\tItemNewRooms[ItemNewRoomNo][0] = item_num;\n\t\tItemNewRooms[ItemNewRoomNo][1] = room_number;\n\t\tItemNewRoomNo++;\n\t}\n\telse\n\t{\n\t\tstruct ITEM_INFO* item = &items[item_num];\n\n\t\tif (item->room_number != 255)\n\t\t{\n\t\t\tstruct room_info* r = &room[item->room_number];\n\n\t\t\tif (r->item_number == item_num)\n\t\t\t{\n\t\t\t\tr->item_number = item->next_item;\n\t\t\t}\n\t\t\telse if (r->item_number != -1)\n\t\t\t{\n\t\t\t\tshort linknum;\n\t\t\t\tfor (linknum = items[r->item_number].next_item; linknum != -1; linknum = items[linknum].next_item)\n\t\t\t\t{\n\t\t\t\t\tif (linknum == item_num)\n\t\t\t\t\t{\n\t\t\t\t\t\titems[r->item_number].next_item = item->next_item;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\titem->room_number = room_number;\n\t\titem->next_item = room[room_number].item_number;\n\t\troom[room_number].item_number = item_num;\n\t}\n}\n<commit_msg>impl end of function<commit_after>#include \"ITEMS.H\"\n\n#include \"CONTROL.H\"\n#include \"DRAW.H\"\n#include \"OBJECTS.H\"\n#ifdef PC_VERSION\n#include \"GAME.H\"\n#include \"INIT.H\"\n#else\n#include \"SETUP.H\"\n#endif\n#include \"SPECIFIC.H\"\n#include \"SPECTYPES.H\"\n#include <stddef.h>\n#include <assert.h>\n#include \"EFFECTS.H\"\n#include \"MALLOC.H\"\n#include \"EFFECT2.H\"\n#include \"LARA.H\"\n\nint level_items;\nshort next_item_free;\nshort next_item_active;\nshort GlobalPulleyFrigItem;\n\nvoid EffectNewRoom(short fx_num, short room_number)\/\/42320, 42774 (F)\n{\n\tif(InItemControlLoop)\n\t{\n\t\tItemNewRooms[ItemNewRoomNo][0] = fx_num;\n\t\tItemNewRooms[ItemNewRoomNo][1] = room_number;\n\t\tItemNewRoomNo++;\n\t}\n\telse\n\t{\n\t\tstruct FX_INFO* fx = &effects[fx_num];\n\t\tstruct room_info* r = &room[fx->room_number];\n\n\t\tif (r->fx_number == fx_num)\n\t\t{\n\t\t\tr->fx_number = fx->next_fx;\n\t\t}\n\t\telse if(r->fx_number != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = effects[r->fx_number].next_fx; linknum != -1; linknum = effects[linknum].next_fx)\n\t\t\t{\n\t\t\t\tif (linknum == fx_num)\n\t\t\t\t{\n\t\t\t\t\teffects[r->fx_number].next_fx = fx->next_fx;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfx->room_number = room_number;\n\t\tfx->next_fx = room[room_number].fx_number;\n\t\troom[room_number].fx_number = fx_num;\n\t}\n}\n\nvoid KillEffect(short fx_num)\/\/42178, 425CC (F)\n{\n\tif (InItemControlLoop)\n\t{\n\t\tItemNewRooms[ItemNewRoomNo][0] = fx_num | 0x8000;\n\t\tItemNewRoomNo++;\n\t}\n\telse\n\t{\n\t\tstruct FX_INFO* fx = &effects[fx_num];\t\t\n\n\t\tDetatchSpark(fx_num, 128);\n\n\t\tif (next_fx_active == fx_num)\n\t\t{\n\t\t\tnext_fx_active = fx->next_active;\n\t\t}\n\t\telse if (next_fx_active != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = effects[next_fx_active].next_active; linknum != -1; linknum = effects[linknum].next_active)\n\t\t\t{\n\t\t\t\tif (linknum == fx_num)\n\t\t\t\t{\n\t\t\t\t\teffects[linknum].next_active = fx->next_active;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (room[fx->room_number].fx_number == fx_num)\n\t\t{\n\t\t\troom[fx->room_number].fx_number = fx->next_fx;\n\t\t}\n\t\telse if (room[fx->room_number].fx_number != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = effects[room[fx->room_number].fx_number].next_fx; linknum != -1; linknum = effects[linknum].next_fx)\n\t\t\t{\n\t\t\t\tif (linknum == fx_num)\n\t\t\t\t{\n\t\t\t\t\teffects[room[fx->room_number].fx_number].next_fx = fx->next_fx;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfx->next_fx = next_fx_free;\n\t\tnext_fx_free = fx_num;\n\t}\n}\n\nshort CreateEffect(short room_num)\/\/420E0(<), 42534(<) (F)\n{\n\tstruct room_info* r;\n\tstruct FX_INFO* fx;\n\tshort fx_num = next_fx_free;\n\n\tif (next_fx_free != -1)\n\t{\n\t\tfx = &effects[next_fx_free];\n\t\tnext_fx_free = fx->object_number;\n\t\tr = &room[room_num];\n\t\tfx->room_number = room_num;\n\t\tfx->next_fx = r->fx_number;\n\t\tr->fx_number = fx_num;\n\t\tfx->next_active = next_fx_active;\n\t\tnext_fx_active = fx_num;\n\t\tfx->shade = GRAY555;\n\t}\n\n\treturn fx_num;\n}\n\nvoid InitialiseFXArray(int allocmem)\/\/4207C(<), 424D0(<) (F)\n{\n\tint i;\n\tstruct FX_INFO* fx;\n\n\tif (allocmem)\n\t\teffects = (struct FX_INFO*)game_malloc(24 * sizeof(struct FX_INFO));\n\n\tfx = effects;\n\tnext_fx_active = -1;\n\tnext_fx_free = 0;\n\tfor (i = 1; i <= 24; i++)\n\t{\n\t\tfx->next_fx = i++;\n\t\t++fx;\n\t}\n\tfx->next_fx = -1;\n}\n\nvoid AddActiveItem(short item_num)\/\/41FEC(<), 42440(<) (F)\n{\n\tstruct ITEM_INFO* item;\n\n\titem = &items[item_num];\n\n\titem->flags |= 0x20;\n\n\tif (objects[item->object_number].control == NULL)\/\/Bug: Always zero due to incomplete level data relocation\n\t{\n\t\titem->status = ITEM_INACTIVE;\n\t\treturn;\n\t}\n\n\tif (!item->active)\n\t{\n\t\titem->active = TRUE;\n\t\titem->next_active = next_item_active;\n\t\tnext_item_active = item_num;\n\t}\n}\n\nvoid RemoveDrawnItem(short item_num)\/\/41F48, 4239C (F)\n{\n\tstruct ITEM_INFO* item = &items[item_num];\n\n\tif (room[item->room_number].item_number == item_num)\n\t{\n\t\troom[item->room_number].item_number = item->next_item;\n\t}\n\telse if (room[item->room_number].item_number != -1)\n\t{\n\t\tshort linknum;\n\t\tfor (linknum = items[room[item->room_number].item_number].next_item; linknum != -1; linknum = items[linknum].next_item)\n\t\t{\n\t\t\tif (linknum == item_num)\n\t\t\t{\n\t\t\t\titems[linknum].next_item = items[item_num].next_item;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid RemoveActiveItem(short item_num)\/\/41E98, 422EC (F)\n{\n\tif (items[item_num].active)\n\t{\n\t\titems[item_num].active = FALSE;\n\n\t\tif (next_item_active == item_num)\n\t\t{\n\t\t\tnext_item_active = items[item_num].next_active;\n\t\t}\n\t\telse if(next_item_active != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = items[next_item_active].next_active; linknum != -1; linknum = items[linknum].next_active)\n\t\t\t{\n\t\t\t\tif (linknum == item_num)\n\t\t\t\t{\n\t\t\t\t\titems[linknum].next_active = items[item_num].next_active;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid InitialiseItem(short item_num)\/\/41BEC(<), 42040 (F)\n{\n\tstruct ITEM_INFO* item;\n\tstruct room_info* r;\n\tstruct FLOOR_INFO* floor;\n\t\n\titem = &items[item_num];\n\titem->anim_number = objects[item->object_number].anim_index;\n\titem->frame_number = anims[item->anim_number].frame_base;\n\n\titem->required_anim_state = 0;\n\titem->goal_anim_state = anims[item->anim_number].current_anim_state;\n\titem->current_anim_state = anims[item->anim_number].current_anim_state;\n\n\titem->pos.z_rot = 0;\n\titem->pos.x_rot = 0;\n\n\titem->fallspeed = 0;\n\titem->speed = 0;\n\n\titem->item_flags[3] = 0;\n\titem->item_flags[2] = 0;\n\titem->item_flags[1] = 0;\n\titem->item_flags[0] = 0;\n\n\titem->active = FALSE;\n\titem->status = ITEM_INACTIVE;\n\titem->gravity_status = FALSE;\n\titem->hit_status = FALSE;\n\titem->collidable = TRUE;\n\titem->looked_at = FALSE;\n\titem->dynamic_light = FALSE;\n\titem->poisoned = FALSE;\n\titem->ai_bits = 0;\n\titem->really_active = FALSE;\n\n\titem->timer = 0;\n\n\titem->hit_points = objects[item->object_number].hit_points;\n\t\n\tif (item->object_number == HK_ITEM || \n\t\titem->object_number == HK_AMMO_ITEM || \n\t\titem->object_number == CROSSBOW_ITEM || \n\t\titem->object_number == REVOLVER_ITEM)\n\t{\n\t\titem->mesh_bits = 1;\n\t}\n\telse\n\t{\n\t\titem->mesh_bits = 0xFFFFFFFF;\n\t}\n\n\titem->touch_bits = 0;\n\titem->after_death = 0;\n\titem->fired_weapon = 0;\n\titem->data = NULL;\n\n\tif (item->flags & IFLAG_INVISIBLE)\n\t{\n\t\titem->flags &= ~IFLAG_INVISIBLE;\n\t\titem->status = ITEM_INVISIBLE;\n\t}\n\telse if (objects[item->object_number].intelligent)\n\t{\n\t\titem->status = ITEM_INVISIBLE;\n\t}\n\n\tif ((item->flags & IFLAG_ACTIVATION_MASK) == IFLAG_ACTIVATION_MASK)\n\t{\n\t\titem->flags &= ~IFLAG_ACTIVATION_MASK;\n\t\titem->flags |= IFLAG_REVERSE;\n\t\tAddActiveItem(item_num);\n\t\titem->status = ITEM_ACTIVE;\n\t}\n\n\tr = &room[item->room_number];\n\n\titem->next_item = r->item_number;\n\tr->item_number = item_num;\n\n\tfloor = &r->floor[((item->pos.z_pos - r->z) \/ SECTOR(1)) + (((item->pos.x_pos - r->x) \/ SECTOR(1)) * r->x_size)];\n\n\titem->floor = floor->floor * 256;\n\titem->box_number = floor->box;\n\n\tif (objects[item->object_number].initialise != NULL)\n\t{\n\t\tobjects[item->object_number].initialise(item_num);\n\t}\n\n#if PSXENGINE\n\titem->il.Light[3].pad = 0;\n#endif\n\n#if PC_VERSION\n\titem->il.room_num = -1;\n\titem->light_room_num = -1;\n\n\titem->unk_thing = 0;\n\n\titem->num_lights_1 = 0;\n\titem->num_lights_2 = 0;\n\n\titem->il.room_ambient = r->ambient;\n\n\titem->ptr_lights_1 = item->lights_1;\n\titem->ptr_lights_2 = item->lights_2;\n#endif\n}\n\nshort CreateItem()\/\/41BAC(<), 42000(<) (F)\n{\n\tshort item_num = 0;\n\n\tif (next_item_free == -1) return -1;\n\n\titem_num = next_item_free;\n\titems[next_item_free].flags = 0;\n\tnext_item_free = items[next_item_free].next_item;\n\n\treturn item_num;\n}\n\nvoid KillItem(short item_num)\/\/41950, 41DA4 (F)\n{\n\tif (InItemControlLoop)\n\t{\n\t\tItemNewRooms[ItemNewRoomNo][0] = item_num | 0x8000;\n\t\tItemNewRoomNo++;\n\t}\n\telse\n\t{\n\t\tstruct ITEM_INFO* item = &items[item_num];\n\n\t\tDetatchSpark(item_num, 128);\n\n\t\titem->active = FALSE;\n\t\titem->really_active = FALSE;\n\n\t\tif (next_item_active == item_num)\n\t\t{\n\t\t\tnext_item_active = item->next_active;\n\t\t}\n\t\telse if (next_item_active != -1)\n\t\t{\n\t\t\tshort linknum;\n\t\t\tfor (linknum = items[next_item_active].next_active; linknum != -1; linknum = items[linknum].next_active)\n\t\t\t{\n\t\t\t\tif (linknum == item_num)\n\t\t\t\t{\n\t\t\t\t\titems[linknum].next_active = item->next_active;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (item->room_number != 255)\n\t\t{\n\t\t\tif (room[item->room_number].item_number == item_num)\n\t\t\t{\n\t\t\t\troom[item->room_number].item_number = item->next_item;\n\t\t\t}\n\t\t\telse if (room[item->room_number].item_number != -1)\n\t\t\t{\n\t\t\t\tshort linknum;\n\t\t\t\tfor (linknum = items[room[item->room_number].item_number].next_item; linknum != -1; linknum = items[linknum].next_item)\n\t\t\t\t{\n\t\t\t\t\tif (linknum == item_num)\n\t\t\t\t\t{\n\t\t\t\t\t\titems[room[item->room_number].item_number].next_item = item->next_item;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (item == lara.target)\n\t\t{\n\t\t\tlara.target = NULL;\n\t\t}\n\n\t\tif (item_num >= level_items)\n\t\t{\n\t\t\titem->next_item = next_item_free;\n\t\t\tnext_item_free = item_num;\n\t\t}\n\t\telse\n\t\t{\n\t\t\titem->flags |= IFLAG_KILLED;\n\t\t}\n\t}\n}\n\nvoid InitialiseItemArray(int numitems)\/\/418E8(<), 41D3C(<) (F)\n{\n\tint i;\n\tstruct ITEM_INFO* item;\n\n\titem = &items[level_items];\n\tnext_item_active = -1;\n\tnext_item_free = level_items;\n\n\tif (level_items + 1 < numitems)\n\t{\n\t\tfor (i = level_items + 1; i < numitems; i++, item++)\n\t\t{\n\t\t\titem->next_item = i;\n\t\t\titem->active = FALSE;\n\t\t}\n\t}\n\n\titem->next_item = -1;\n\treturn;\n}\n\nvoid ItemNewRoom(short item_num, short room_number)\/\/7C608(<), 7E64C(<) (F)\n{\n\tif (InItemControlLoop)\n\t{\n\t\tItemNewRooms[ItemNewRoomNo][0] = item_num;\n\t\tItemNewRooms[ItemNewRoomNo][1] = room_number;\n\t\tItemNewRoomNo++;\n\t}\n\telse\n\t{\n\t\tstruct ITEM_INFO* item = &items[item_num];\n\n\t\tif (item->room_number != 255)\n\t\t{\n\t\t\tstruct room_info* r = &room[item->room_number];\n\n\t\t\tif (r->item_number == item_num)\n\t\t\t{\n\t\t\t\tr->item_number = item->next_item;\n\t\t\t}\n\t\t\telse if (r->item_number != -1)\n\t\t\t{\n\t\t\t\tshort linknum;\n\t\t\t\tfor (linknum = items[r->item_number].next_item; linknum != -1; linknum = items[linknum].next_item)\n\t\t\t\t{\n\t\t\t\t\tif (linknum == item_num)\n\t\t\t\t\t{\n\t\t\t\t\t\titems[r->item_number].next_item = item->next_item;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\titem->room_number = room_number;\n\t\titem->next_item = room[room_number].item_number;\n\t\troom[room_number].item_number = item_num;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>Int_t LoadLib(const TString &libName)\n{\n  return gSystem->Load(libName);\n}\n<commit_msg>AliPhysics libraries might need system libraries<commit_after>Int_t LoadLib(const TString &libName)\n{\n  if (libName.Contains(\"PWGPP\") ||\n      libName.Contains(\"PWGUDdiffractive\")) {\n    \/\/ Might need system-installed libraries (e.g. libzmq.so)\n    gSystem->AddDynamicPath(\"\/lib:\/lib64:\/usr\/lib:\/usr\/lib64:\/usr\/local\/lib:\/usr\/local\/lib64:\/usr\/lib\/x86_64-linux-gnu\");\n  }\n\n  return gSystem->Load(libName);\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 \"Copyright (c) 2012-2013 Tokutek Inc.  All rights reserved.\"\n#ident \"$Id$\"\n\n#include \"backup_debug.h\"\n#include <stdio.h>\n\nnamespace HotBackup {\n\n\/\/ TODO: Set each flag with getenv...\nint BACKUP_TRACE_FLAGS = 0x0F;\nint BACKUP_WARN_FLAGS = 0x0F;\nint BACKUP_ERROR_FLAGS = 0x0F;\n\nvoid CopyTrace(const char *s, const char *arg) \n{\n    if(BACKUP_TRACE_FLAGS & COPY_FLAG) {\n        printf(\"TRACE: <COPY> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CopyWarn(const char *s, const char *arg)\n{\n    if(BACKUP_WARN_FLAGS & COPY_FLAG) {\n        printf(\"WARN: <COPY> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CopyError(const char *s, const char *arg)\n{\n    if(BACKUP_ERROR_FLAGS & COPY_FLAG) {\n        printf(\"ERROR: <COPY> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CaptureTrace(const char *s, const char *arg) \n{\n    if(BACKUP_TRACE_FLAGS & CAPUTRE_FLAG) {\n        printf(\"TRACE: <CAPTURE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CaptureTrace(const char *s, const int arg)\n{\n    if(BACKUP_TRACE_FLAGS & CAPUTRE_FLAG) {\n        printf(\"TRACE: <CAPTURE> %s %d\\n\", s, arg);\n    }\n}\n\nvoid CaptureWarn(const char *s, const char *arg)\n{\n    if(BACKUP_WARN_FLAGS & CAPUTRE_FLAG) {\n        printf(\"WARN: <CAPTURE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CaptureError(const char *s, const char *arg)\n{\n    if(BACKUP_ERROR_FLAGS & CAPUTRE_FLAG) {\n        printf(\"ERROR: <CAPTURE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CaptureError(const char *s, const int arg)\n{\n    if(BACKUP_ERROR_FLAGS & CAPUTRE_FLAG) {\n        printf(\"ERROR: <CAPTURE> %s %d\\n\", s, arg);\n    }\n}\n\nvoid InterposeTrace(const char *s, const char *arg) \n{\n    if(BACKUP_TRACE_FLAGS & INTERPOSE_FLAG) {\n        printf(\"TRACE: <INTERPOSE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid InterposeTrace(const char *s, const int arg) \n{\n    if(BACKUP_TRACE_FLAGS & INTERPOSE_FLAG) {\n        printf(\"TRACE: <INTERPOSE> %s %d\\n\", s, arg);\n    }\n}\n\nvoid InterposeWarn(const char *s, const char *arg)\n{\n    if(BACKUP_WARN_FLAGS & INTERPOSE_FLAG) {\n        printf(\"WARN: <INTERPOSE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid InterposeError(const char *s, const char *arg)\n{\n    if(BACKUP_ERROR_FLAGS & INTERPOSE_FLAG) {\n        printf(\"ERROR: <INTERPOSE> %s %s\\n\", s, arg);\n    }\n}\n\nstatic int PAUSE_POINTS = 0x00;\n\nbool should_pause(int flag)\n{\n    bool result = false;\n    switch (flag) {\n        case COPIER_BEFORE_READ:\n            result = COPIER_BEFORE_READ & PAUSE_POINTS;\n            break;\n        case COPIER_AFTER_READ_BEFORE_WRITE:\n            result = COPIER_AFTER_READ_BEFORE_WRITE & PAUSE_POINTS;\n            break;\n        case COPIER_AFTER_WRITE:\n            result = COPIER_AFTER_WRITE & PAUSE_POINTS;\n            break;\n        case MANAGER_IN_PREPARE:\n            result = MANAGER_IN_PREPARE;\n            break;\n        case MANAGER_IN_DISABLE:\n            result = MANAGER_IN_DISABLE;\n            break;\n        default:\n            break;\n    }\n\n    return result;\n}\n\nvoid toggle_pause_point(int flag)\n{\n    PAUSE_POINTS = PAUSE_POINTS ^ flag;\n}\n\n} \/\/ End of namespace.\n\n<commit_msg>Fixes #6510.  Add helgrind anotatoin to {{{PAUSE_POINT}}}.<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 \"Copyright (c) 2012-2013 Tokutek Inc.  All rights reserved.\"\n#ident \"$Id$\"\n\n#include \"backup_debug.h\"\n#include <stdio.h>\n#include <valgrind\/helgrind.h>\n\nnamespace HotBackup {\n\n\/\/ TODO: Set each flag with getenv...\nint BACKUP_TRACE_FLAGS = 0x0F;\nint BACKUP_WARN_FLAGS = 0x0F;\nint BACKUP_ERROR_FLAGS = 0x0F;\n\nvoid CopyTrace(const char *s, const char *arg) \n{\n    if(BACKUP_TRACE_FLAGS & COPY_FLAG) {\n        printf(\"TRACE: <COPY> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CopyWarn(const char *s, const char *arg)\n{\n    if(BACKUP_WARN_FLAGS & COPY_FLAG) {\n        printf(\"WARN: <COPY> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CopyError(const char *s, const char *arg)\n{\n    if(BACKUP_ERROR_FLAGS & COPY_FLAG) {\n        printf(\"ERROR: <COPY> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CaptureTrace(const char *s, const char *arg) \n{\n    if(BACKUP_TRACE_FLAGS & CAPUTRE_FLAG) {\n        printf(\"TRACE: <CAPTURE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CaptureTrace(const char *s, const int arg)\n{\n    if(BACKUP_TRACE_FLAGS & CAPUTRE_FLAG) {\n        printf(\"TRACE: <CAPTURE> %s %d\\n\", s, arg);\n    }\n}\n\nvoid CaptureWarn(const char *s, const char *arg)\n{\n    if(BACKUP_WARN_FLAGS & CAPUTRE_FLAG) {\n        printf(\"WARN: <CAPTURE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CaptureError(const char *s, const char *arg)\n{\n    if(BACKUP_ERROR_FLAGS & CAPUTRE_FLAG) {\n        printf(\"ERROR: <CAPTURE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid CaptureError(const char *s, const int arg)\n{\n    if(BACKUP_ERROR_FLAGS & CAPUTRE_FLAG) {\n        printf(\"ERROR: <CAPTURE> %s %d\\n\", s, arg);\n    }\n}\n\nvoid InterposeTrace(const char *s, const char *arg) \n{\n    if(BACKUP_TRACE_FLAGS & INTERPOSE_FLAG) {\n        printf(\"TRACE: <INTERPOSE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid InterposeTrace(const char *s, const int arg) \n{\n    if(BACKUP_TRACE_FLAGS & INTERPOSE_FLAG) {\n        printf(\"TRACE: <INTERPOSE> %s %d\\n\", s, arg);\n    }\n}\n\nvoid InterposeWarn(const char *s, const char *arg)\n{\n    if(BACKUP_WARN_FLAGS & INTERPOSE_FLAG) {\n        printf(\"WARN: <INTERPOSE> %s %s\\n\", s, arg);\n    }\n}\n\nvoid InterposeError(const char *s, const char *arg)\n{\n    if(BACKUP_ERROR_FLAGS & INTERPOSE_FLAG) {\n        printf(\"ERROR: <INTERPOSE> %s %s\\n\", s, arg);\n    }\n}\n\nstatic int PAUSE_POINTS = 0x00;\n\nbool should_pause(int flag)\n{\n    bool result = false;\n    switch (flag) {\n        case COPIER_BEFORE_READ:\n            result = COPIER_BEFORE_READ & PAUSE_POINTS;\n            break;\n        case COPIER_AFTER_READ_BEFORE_WRITE:\n            result = COPIER_AFTER_READ_BEFORE_WRITE & PAUSE_POINTS;\n            break;\n        case COPIER_AFTER_WRITE:\n            result = COPIER_AFTER_WRITE & PAUSE_POINTS;\n            break;\n        case MANAGER_IN_PREPARE:\n            result = MANAGER_IN_PREPARE;\n            break;\n        case MANAGER_IN_DISABLE:\n            result = MANAGER_IN_DISABLE;\n            break;\n        default:\n            break;\n    }\n\n    return result;\n}\n\nvoid toggle_pause_point(int flag)\n{\n    VALGRIND_HG_DISABLE_CHECKING(&PAUSE_POINTS, sizeof(PAUSE_POINTS));\n    PAUSE_POINTS = PAUSE_POINTS ^ flag;\n}\n\n} \/\/ End of namespace.\n\n<|endoftext|>"}
{"text":"<commit_before># pragma once\n# include <Siv3D.hpp>\n# include \"AscChoiceManager.hpp\"\n# include \"AscMessageManager.hpp\"\n# include \"AscSpriteManager.hpp\"\n\nnamespace asc\n{\n\tusing namespace s3d;\n\n\tusing Commnad = std::pair<int32, String>;\n\n\tclass Novel\n\t{\n\tprivate:\n\n\t\tbool m_isUpdating;\n\n\t\tint32 m_currentLine;\n\n\t\tArray<Commnad> m_commands;\n\n\t\tChoiceManager m_choiceManager;\n\n\t\tMessageManager m_messageManager;\n\n\t\tSpriteManager m_spriteManager;\n\n\t\tvoid clearManager()\n\t\t{\n\t\t\tm_messageManager.clear();\n\t\t\tm_spriteManager.clear();\n\t\t\tm_choiceManager.clear();\n\t\t}\n\n\t\tvoid execute()\n\t\t{\n\t\t\tswitch (m_commands[m_currentLine].first)\n\t\t\t{\n\t\t\t\/\/ Point\n\t\t\tcase 0:\n\t\t\t\tm_isUpdating = false;\n\t\t\t\treturn;\n\n\t\t\t\/\/ Text\n\t\t\tcase 1:\n\t\t\t\tm_messageManager.setText(m_commands[m_currentLine].second);\n\t\t\t\tm_messageManager.start();\n\t\t\t\tbreak;\n\n\t\t\t\/\/ Name\n\t\t\tcase 2:\n\t\t\t\tm_messageManager.setName(m_commands[m_currentLine].second);\n\t\t\t\tbreak;\n\n\t\t\t\/\/ AddSprite\n\t\t\tcase 3:\n\t\t\t\tm_spriteManager.add<Sprite>(m_commands[m_currentLine].second);\n\t\t\t\tbreak;\n\n\t\t\t\/\/ AddFixedSprite\n\t\t\tcase 4:\n\t\t\t\tm_spriteManager.add<FixedSprite>(m_commands[m_currentLine].second);\n\t\t\t\tbreak;\n\n\t\t\t\/\/ Choice\n\t\t\tcase 5:\n\t\t\t\tm_choiceManager.start(m_commands[m_currentLine].second);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tm_currentLine++;\n\t\t}\n\n\tpublic:\n\n\t\tNovel() :\n\t\t\tm_isUpdating(false),\n\t\t\tm_currentLine(0)\n\t\t{\n\t\t\tm_commands.push_back({ 0, L\"1\"});\n\t\t\tm_commands.push_back({ 3, L\"1,character1,0,0,640,720\" });\n\t\t\tm_commands.push_back({ 3, L\"3,character3,480,180,320,360\" });\n\t\t\tm_commands.push_back({ 1, L\"Characters\" });\n\t\t\tm_commands.push_back({ 0, L\"2\" });\n\t\t\tm_commands.push_back({ 1, L\"Only Text\" });\n\t\t\tm_commands.push_back({ 0, L\"3\" });\n\t\t\tm_commands.push_back({ 1, L\"Show Character?\" });\n\t\t\tm_commands.push_back({ 5, L\"1,Yes,2,No\" });\n\t\t\tm_commands.push_back({ 0, L\"4\" });\n\t\t\tm_commands.push_back({ 1, L\"Jump 2\" });\n\t\t\tm_commands.push_back({ 7, L\"2\" });\n\t\t\tm_commands.push_back({ 0, L\"-1\" });\n\t\t}\n\n\t\tvirtual ~Novel() = default;\n\n\t\tbool start(int32 seekPoint)\n\t\t{\n\t\t\tconst auto size = m_commands.size() - 1;\n\t\t\tfor (auto i = 0u; i < size; i++)\n\t\t\t{\n\t\t\t\tconst auto index = (m_currentLine + i) % m_commands.size();\n\n\t\t\t\tconst auto command = m_commands[index];\n\t\t\t\tif (\n\t\t\t\t\tcommand.first == 0 &&\n\t\t\t\t\tParse<int32>(command.second) == seekPoint\n\t\t\t\t)\n\t\t\t\t{\n\t\t\t\t\tclearManager();\n\t\t\t\t\tm_currentLine = index + 1;\n\t\t\t\t\tm_isUpdating = true;\n\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\n\t\tvoid update()\n\t\t{\n\t\t\twhile (\n\t\t\t\tm_isUpdating &&\n\t\t\t\t!m_messageManager.isUpdating() &&\n\t\t\t\t!m_choiceManager.isUpdating()\n\t\t\t)\n\t\t\t{\n\t\t\t\texecute();\n\t\t\t}\n\n\t\t\tm_messageManager.update();\n\t\t\tm_choiceManager.update();\n\t\t}\n\n\t\tbool isUpdating() const\n\t\t{\n\t\t\treturn m_isUpdating;\n\t\t}\n\n\t\tvoid draw() const\n\t\t{\n\t\t\tm_spriteManager.draw();\n\t\t\tm_messageManager.draw();\n\t\t\tm_choiceManager.draw();\n\t\t}\n\t};\n}<commit_msg>Implement Jump.<commit_after># pragma once\n# include <Siv3D.hpp>\n# include \"AscChoiceManager.hpp\"\n# include \"AscMessageManager.hpp\"\n# include \"AscSpriteManager.hpp\"\n\nnamespace asc\n{\n\tusing namespace s3d;\n\n\tusing Commnad = std::pair<int32, String>;\n\n\tclass Novel\n\t{\n\tprivate:\n\n\t\tbool m_isUpdating;\n\n\t\tint32 m_currentLine;\n\n\t\tArray<Commnad> m_commands;\n\n\t\tChoiceManager m_choiceManager;\n\n\t\tMessageManager m_messageManager;\n\n\t\tSpriteManager m_spriteManager;\n\n\t\tvoid clearManager()\n\t\t{\n\t\t\tm_messageManager.clear();\n\t\t\tm_spriteManager.clear();\n\t\t\tm_choiceManager.clear();\n\t\t}\n\n\t\tvoid execute()\n\t\t{\n\t\t\tswitch (m_commands[m_currentLine].first)\n\t\t\t{\n\t\t\t\/\/ Point\n\t\t\tcase 0:\n\t\t\t\tm_isUpdating = false;\n\t\t\t\treturn;\n\n\t\t\t\/\/ Text\n\t\t\tcase 1:\n\t\t\t\tm_messageManager.setText(m_commands[m_currentLine].second);\n\t\t\t\tm_messageManager.start();\n\t\t\t\tbreak;\n\n\t\t\t\/\/ Name\n\t\t\tcase 2:\n\t\t\t\tm_messageManager.setName(m_commands[m_currentLine].second);\n\t\t\t\tbreak;\n\n\t\t\t\/\/ AddSprite\n\t\t\tcase 3:\n\t\t\t\tm_spriteManager.add<Sprite>(m_commands[m_currentLine].second);\n\t\t\t\tbreak;\n\n\t\t\t\/\/ AddFixedSprite\n\t\t\tcase 4:\n\t\t\t\tm_spriteManager.add<FixedSprite>(m_commands[m_currentLine].second);\n\t\t\t\tbreak;\n\n\t\t\t\/\/ Choice\n\t\t\tcase 5:\n\t\t\t\tm_choiceManager.start(m_commands[m_currentLine].second);\n\t\t\t\tbreak;\n\n\t\t\t\/\/ Jump\n\t\t\tcase 7:\n\t\t\t\tstart(Parse<int32>(m_commands[m_currentLine].second));\n\t\t\t\treturn;\n\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tm_currentLine++;\n\t\t}\n\n\tpublic:\n\n\t\tNovel() :\n\t\t\tm_isUpdating(false),\n\t\t\tm_currentLine(0)\n\t\t{\n\t\t\tm_commands.push_back({ 0, L\"1\"});\n\t\t\tm_commands.push_back({ 3, L\"1,character1,0,0,640,720\" });\n\t\t\tm_commands.push_back({ 3, L\"3,character3,480,180,320,360\" });\n\t\t\tm_commands.push_back({ 1, L\"Characters\" });\n\t\t\tm_commands.push_back({ 0, L\"2\" });\n\t\t\tm_commands.push_back({ 1, L\"Only Text\" });\n\t\t\tm_commands.push_back({ 0, L\"3\" });\n\t\t\tm_commands.push_back({ 1, L\"Show Character?\" });\n\t\t\tm_commands.push_back({ 5, L\"1,Yes,2,No\" });\n\t\t\tm_commands.push_back({ 0, L\"4\" });\n\t\t\tm_commands.push_back({ 1, L\"Jump 2\" });\n\t\t\tm_commands.push_back({ 7, L\"2\" });\n\t\t\tm_commands.push_back({ 0, L\"-1\" });\n\t\t}\n\n\t\tvirtual ~Novel() = default;\n\n\t\tbool start(int32 seekPoint)\n\t\t{\n\t\t\tconst auto size = m_commands.size() - 1;\n\t\t\tfor (auto i = 0u; i < size; i++)\n\t\t\t{\n\t\t\t\tconst auto index = (m_currentLine + i) % m_commands.size();\n\n\t\t\t\tconst auto command = m_commands[index];\n\t\t\t\tif (\n\t\t\t\t\tcommand.first == 0 &&\n\t\t\t\t\tParse<int32>(command.second) == seekPoint\n\t\t\t\t)\n\t\t\t\t{\n\t\t\t\t\tclearManager();\n\t\t\t\t\tm_currentLine = index + 1;\n\t\t\t\t\tm_isUpdating = true;\n\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\n\t\tvoid update()\n\t\t{\n\t\t\twhile (\n\t\t\t\tm_isUpdating &&\n\t\t\t\t!m_messageManager.isUpdating() &&\n\t\t\t\t!m_choiceManager.isUpdating()\n\t\t\t)\n\t\t\t{\n\t\t\t\texecute();\n\t\t\t}\n\n\t\t\tm_messageManager.update();\n\t\t\tm_choiceManager.update();\n\t\t}\n\n\t\tbool isUpdating() const\n\t\t{\n\t\t\treturn m_isUpdating;\n\t\t}\n\n\t\tvoid draw() const\n\t\t{\n\t\t\tm_spriteManager.draw();\n\t\t\tm_messageManager.draw();\n\t\t\tm_choiceManager.draw();\n\t\t}\n\t};\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright AudioKit. All Rights Reserved. Revision History at http:\/\/github.com\/AudioKit\/AudioKit\/\n\n#pragma once\n\n#import <AVFoundation\/AVFoundation.h>\n#import \"AKInterop.h\"\n\ntypedef NS_ENUM(AUParameterAddress, AKSequencerEngineParameter) {\n    AKSequencerEngineParameterTempo,\n    AKSequencerEngineParameterLength,\n    AKSequencerEngineParameterMaximumPlayCount,\n    AKSequencerEngineParameterPosition,\n    AKSequencerEngineParameterLoopEnabled\n};\n\nAK_API AKDSPRef createAKSequencerEngineDSP(void);\n\n#ifndef __cplusplus\n\nvoid sequencerEngineAddMIDIEvent(AKDSPRef dsp, uint8_t status, uint8_t data1, uint8_t data2, double beat);\nvoid sequencerEngineAddMIDINote(AKDSPRef dsp, uint8_t noteNumber, uint8_t velocity, double beat, double duration);\nvoid sequencerEngineRemoveMIDIEvent(AKDSPRef dsp, double beat);\nvoid sequencerEngineRemoveMIDINote(AKDSPRef dsp, double beat);\nvoid sequencerEngineRemoveSpecificMIDINote(AKDSPRef dsp, double beat, uint8_t noteNumber);\nvoid sequencerEngineRemoveAllInstancesOf(AKDSPRef dsp, uint8_t noteNumber);\n\nvoid sequencerEngineStopPlayingNotes(AKDSPRef dsp);\nvoid sequencerEngineClear(AKDSPRef dsp);\n\nvoid sequencerEngineSetAUTarget(AKDSPRef dsp, AudioUnit audioUnit);\n\n#else\n\n#include \"AKDSPBase.hpp\"\n#include <vector>\n#include <stdio.h>\n\n#define NOTEON 0x90\n#define NOTEOFF 0x80\n\nclass AKSequencerEngineDSP : public AKDSPBase {\n    \n    struct MIDIEvent {\n        uint8_t status;\n        uint8_t data1;\n        uint8_t data2;\n        double beat;\n    };\n\n    struct MIDINote {\n        struct MIDIEvent noteOn;\n        struct MIDIEvent noteOff;\n    };\n    \npublic:\n\n    AKSequencerEngineDSP() {}\n\n    void setTargetAU(AudioUnit target) {\n        targetAU = target;\n    }\n\n    void seekTo(double position) {\n        positionInSamples = beatToSamples(position);\n    }\n\n    void setTempo(double newValue) {\n        double lastPosition = currentPositionInBeats(); \/\/ 1) save where we are before we manipulate time\n        tempo = newValue;                               \/\/ 2) manipulate time\n        seekTo(lastPosition);                           \/\/ 3) go back to where we were before time manipulation\n    }\n\n    void setStartPoint(float value) {\n        startPoint = value;\n    }\n\n    void addPlayingNote(MIDINote note, int offset) {\n        if (note.noteOn.data2 > 0) {\n            sendMidiData(note.noteOn.status, note.noteOn.data1, note.noteOn.data2, offset, note.noteOn.beat);\n            playingNotes.push_back(note);\n        } else {\n            sendMidiData(note.noteOff.status, note.noteOff.data1, note.noteOff.data2, offset, note.noteOn.beat);\n        }\n    }\n\n    void stopPlayingNote(MIDINote note, int offset, int index) {\n        sendMidiData(note.noteOff.status, note.noteOff.data1, note.noteOff.data2, offset, note.noteOff.beat);\n        playingNotes.erase(playingNotes.begin() + index);\n    }\n    \n    void setParameter(AUParameterAddress address, AUValue value, bool immediate) override {\n        switch (address) {\n            case AKSequencerEngineParameterTempo:\n                setTempo(value);\n                break;\n            case AKSequencerEngineParameterLength:\n                length = value;\n                break;\n            case AKSequencerEngineParameterMaximumPlayCount:\n                maximumPlayCount = value;\n                break;\n            case AKSequencerEngineParameterPosition:\n                seekTo(value);\n                break;\n            case AKSequencerEngineParameterLoopEnabled:\n                loopEnabled = value > 0.5f;\n                break;\n        }\n    }\n\n    AUValue getParameter(AUParameterAddress address) override {\n        switch (address) {\n            case AKSequencerEngineParameterTempo:\n                return tempo;\n            case AKSequencerEngineParameterLength:\n                return length;\n            case AKSequencerEngineParameterMaximumPlayCount:\n                return maximumPlayCount;\n                break;\n            case AKSequencerEngineParameterPosition:\n                return currentPositionInBeats();\n                break;\n            case AKSequencerEngineParameterLoopEnabled:\n                return loopEnabled ? 1.f : 0.f;\n            default:\n                return 0.f;\n        }\n    }\n\n    void process(AUAudioFrameCount frameCount, AUAudioFrameCount bufferOffset) override {\n        if (isStarted) {\n            if (positionInSamples >= lengthInSamples()){\n                if (!loopEnabled) { \/\/stop if played enough\n                    stop();\n                    return;\n                }\n            }\n            long currentStartSample = positionModulo();\n            long currentEndSample = currentStartSample + frameCount;\n            for (int i = 0; i < events.size(); i++) {\n                \/\/ go through every event\n                int triggerTime = beatToSamples(events[i].beat);\n                if (currentStartSample <= triggerTime && triggerTime < currentEndSample) {\n                    \/\/ this event is supposed to trigger between currentStartSample and currentEndSample\n                    int offset = (int)(triggerTime - currentStartSample);\n                    sendMidiData(events[i].status, events[i].data1, events[i].data2,\n                                 offset, events[i].beat);\n                } else if (currentEndSample > lengthInSamples() && loopEnabled) {\n                    \/\/ this buffer extends beyond the length of the loop and looping is on\n                    int loopRestartInBuffer = (int)(lengthInSamples() - currentStartSample);\n                    int samplesOfBufferForNewLoop = frameCount - loopRestartInBuffer;\n                    if (triggerTime < samplesOfBufferForNewLoop) {\n                        \/\/ this event would trigger early enough in the next loop that it should happen in this buffer\n                        \/\/ ie. this buffer contains events from the previous loop, and the next loop\n                        int offset = (int)triggerTime + loopRestartInBuffer;\n                        sendMidiData(events[i].status, events[i].data1, events[i].data2,\n                                     offset, events[i].beat);\n                    }\n                }\n            }\n\n            \/\/ Check the playing notes for note offs\n            int i = 0;\n            while (i < playingNotes.size()) {\n                int triggerTime = beatToSamples(playingNotes[i].noteOff.beat);\n                if (currentStartSample <= triggerTime && triggerTime < currentEndSample) {\n                    int offset = (int)(triggerTime - currentStartSample);\n                    stopPlayingNote(playingNotes[i], offset, i);\n                    continue;\n                }\n\n                if (currentEndSample > lengthInSamples() && loopEnabled) {\n                    int loopRestartInBuffer = (int)(lengthInSamples() - currentStartSample);\n                    int samplesOfBufferForNewLoop = frameCount - loopRestartInBuffer;\n                    if (triggerTime < samplesOfBufferForNewLoop) {\n                        int offset = (int)triggerTime + loopRestartInBuffer;\n                        stopPlayingNote(playingNotes[i], offset, i);\n                        continue;\n                    }\n                }\n                i++;\n            }\n\n            \/\/ Check scheduled notes for note ons\n            for (int i = 0; i < notes.size(); i++) {\n                int triggerTime = beatToSamples(notes[i].noteOn.beat);\n                if (currentStartSample <= triggerTime && triggerTime < currentEndSample) {\n                    int offset = (int)(triggerTime - currentStartSample);\n                    addPlayingNote(notes[i], offset);\n                } else if (currentEndSample > lengthInSamples() && loopEnabled) {\n                    int loopRestartInBuffer = (int)(lengthInSamples() - currentStartSample);\n                    int samplesOfBufferForNewLoop = frameCount - loopRestartInBuffer;\n                    if (triggerTime < samplesOfBufferForNewLoop) {\n                        int offset = (int)triggerTime + loopRestartInBuffer;\n                        addPlayingNote(notes[i], offset);\n                    }\n                }\n            }\n\n            positionInSamples += frameCount;\n        }\n        framesCounted += frameCount;\n    }\n\n    void removeNoteAt(double beat) {\n        for (int i = 0; i < notes.size(); i++) {\n            MIDINote note = notes[i];\n            if (note.noteOn.beat == beat) {\n                notes.erase(notes.begin()+i);\n            }\n        }\n    }\n    \n    void removeNoteAt(uint8_t noteToRemove, double beat) {\n        \n        for (int i = 0; i < notes.size(); i++) {\n            MIDINote note = notes[i];\n            if (note.noteOn.beat == beat && note.noteOn.data1 == noteToRemove) {\n                notes.erase(notes.begin()+i);\n            }\n        }\n    }\n    \n    void removeAllInstancesOf(uint8_t noteToRemove) {\n        \n         for (auto itr1 = notes.rbegin(); itr1 < notes.rend(); itr1++) {\n             if (itr1->noteOn.data1 == noteToRemove) {\n                   notes.erase((itr1 + 1).base());\n               }\n           }\n    }\n\n    void removeEventAt(double beat) {\n        for (int i = 0; i < events.size(); i++) {\n            MIDIEvent event = events[i];\n            if (event.beat == beat) {\n                events.erase(events.begin()+i);\n            }\n        }\n    }\n\n    void addMIDIEvent(uint8_t status, uint8_t data1, uint8_t data2, double beat) {\n        MIDIEvent newEvent;\n        newEvent.status = status;\n        newEvent.data1 = data1;\n        newEvent.data2 = data2;\n        newEvent.beat = beat;\n        events.push_back(newEvent);\n    }\n\n    void addMIDINote(uint8_t number, uint8_t velocity, double beat, double duration) {\n        MIDINote newNote;\n\n        newNote.noteOn.status = NOTEON;\n        newNote.noteOn.data1 = number;\n        newNote.noteOn.data2 = velocity;\n        newNote.noteOn.beat = beat;\n\n        newNote.noteOff.status = NOTEOFF;\n        newNote.noteOff.data1 = number;\n        newNote.noteOff.data2 = velocity;\n        newNote.noteOff.beat = beat + duration;\n\n        notes.push_back(newNote);\n    }\n\n    void clear() {\n        notes.clear();\n        events.clear();\n    }\n\n    void stopPlayingNotes() {\n        while (playingNotes.size() > 0) {\n            stopPlayingNote(playingNotes[0], 0, 0);\n        }\n    }\n\n    void sendMidiData(UInt8 status, UInt8 data1, UInt8 data2, double offset, double time) {\n\/\/        printf(\"%p: sending: %i %i %i at offset %f (%f beats)\\n\", &midiEndpoint, status, data1, data2, offset, time);\n        if (midiPort == 0 || midiEndpoint == 0) {\n            MusicDeviceMIDIEvent(targetAU, status, data1, data2, offset);\n        } else {\n            MIDIPacketList packetList;\n            packetList.numPackets = 1;\n            MIDIPacket* firstPacket = &packetList.packet[0];\n            firstPacket->length = 3;\n            firstPacket->data[0] = status;\n            firstPacket->data[1] = data1;\n            firstPacket->data[2] = data2;\n            firstPacket->timeStamp = offset;\n            MIDISend(midiPort, midiEndpoint, &packetList);\n        }\n    }\n\n    long lengthInSamples() {\n        return beatToSamples(length);\n    }\n\n    int beatToSamples(double beat) {\n        return (int)(beat \/ tempo * 60 * sampleRate);\n    }\n\n    long positionModulo() {\n        long length = lengthInSamples();\n        if (positionInSamples == 0 || length == 0) {\n            return 0;\n        } else if (positionInSamples < 0) {\n            return positionInSamples;\n        } else {\n            return positionInSamples % length;\n        }\n    }\n\n    double currentPositionInBeats() {\n        return (double)positionModulo() \/ sampleRate * (tempo \/ 60);\n    }\n\n    bool validTriggerTime(double beat) {\n        return true;\n    }\n\nprivate:\n\n    float startPoint = 0;\n    AudioUnit targetAU;\n    UInt64 framesCounted = 0;\n    long positionInSamples = 0;\n\npublic:\n    MIDIPortRef midiPort;\n    MIDIEndpointRef midiEndpoint;\n    std::vector<MIDIEvent> events;\n    std::vector<MIDINote> notes;\n    std::vector<MIDINote> playingNotes;\n    int maximumPlayCount = 0;\n    double length = 4.0;\n    double tempo = 120.0;\n    bool loopEnabled = true;\n    uint numberOfLoops = 0;\n};\n\n#endif\n<commit_msg>Cleanup.<commit_after>\/\/ Copyright AudioKit. All Rights Reserved. Revision History at http:\/\/github.com\/AudioKit\/AudioKit\/\n\n#pragma once\n\n#import <AVFoundation\/AVFoundation.h>\n#import \"AKInterop.h\"\n\ntypedef NS_ENUM(AUParameterAddress, AKSequencerEngineParameter) {\n    AKSequencerEngineParameterTempo,\n    AKSequencerEngineParameterLength,\n    AKSequencerEngineParameterMaximumPlayCount,\n    AKSequencerEngineParameterPosition,\n    AKSequencerEngineParameterLoopEnabled\n};\n\nAK_API AKDSPRef createAKSequencerEngineDSP(void);\n\nAK_API void sequencerEngineAddMIDIEvent(AKDSPRef dsp, uint8_t status, uint8_t data1, uint8_t data2, double beat);\nAK_API void sequencerEngineAddMIDINote(AKDSPRef dsp, uint8_t noteNumber, uint8_t velocity, double beat, double duration);\nAK_API void sequencerEngineRemoveMIDIEvent(AKDSPRef dsp, double beat);\nAK_API void sequencerEngineRemoveMIDINote(AKDSPRef dsp, double beat);\nAK_API void sequencerEngineRemoveSpecificMIDINote(AKDSPRef dsp, double beat, uint8_t noteNumber);\nAK_API void sequencerEngineRemoveAllInstancesOf(AKDSPRef dsp, uint8_t noteNumber);\n\nAK_API void sequencerEngineStopPlayingNotes(AKDSPRef dsp);\nAK_API void sequencerEngineClear(AKDSPRef dsp);\n\nAK_API void sequencerEngineSetAUTarget(AKDSPRef dsp, AudioUnit audioUnit);\n\n#ifdef __cplusplus\n\n#include \"AKDSPBase.hpp\"\n#include <vector>\n#include <stdio.h>\n\n#define NOTEON 0x90\n#define NOTEOFF 0x80\n\nclass AKSequencerEngineDSP : public AKDSPBase {\n    \n    struct MIDIEvent {\n        uint8_t status;\n        uint8_t data1;\n        uint8_t data2;\n        double beat;\n    };\n\n    struct MIDINote {\n        struct MIDIEvent noteOn;\n        struct MIDIEvent noteOff;\n    };\n    \npublic:\n\n    AKSequencerEngineDSP() {}\n\n    void setTargetAU(AudioUnit target) {\n        targetAU = target;\n    }\n\n    void seekTo(double position) {\n        positionInSamples = beatToSamples(position);\n    }\n\n    void setTempo(double newValue) {\n        double lastPosition = currentPositionInBeats(); \/\/ 1) save where we are before we manipulate time\n        tempo = newValue;                               \/\/ 2) manipulate time\n        seekTo(lastPosition);                           \/\/ 3) go back to where we were before time manipulation\n    }\n\n    void setStartPoint(float value) {\n        startPoint = value;\n    }\n\n    void addPlayingNote(MIDINote note, int offset) {\n        if (note.noteOn.data2 > 0) {\n            sendMidiData(note.noteOn.status, note.noteOn.data1, note.noteOn.data2, offset, note.noteOn.beat);\n            playingNotes.push_back(note);\n        } else {\n            sendMidiData(note.noteOff.status, note.noteOff.data1, note.noteOff.data2, offset, note.noteOn.beat);\n        }\n    }\n\n    void stopPlayingNote(MIDINote note, int offset, int index) {\n        sendMidiData(note.noteOff.status, note.noteOff.data1, note.noteOff.data2, offset, note.noteOff.beat);\n        playingNotes.erase(playingNotes.begin() + index);\n    }\n    \n    void setParameter(AUParameterAddress address, AUValue value, bool immediate) override {\n        switch (address) {\n            case AKSequencerEngineParameterTempo:\n                setTempo(value);\n                break;\n            case AKSequencerEngineParameterLength:\n                length = value;\n                break;\n            case AKSequencerEngineParameterMaximumPlayCount:\n                maximumPlayCount = value;\n                break;\n            case AKSequencerEngineParameterPosition:\n                seekTo(value);\n                break;\n            case AKSequencerEngineParameterLoopEnabled:\n                loopEnabled = value > 0.5f;\n                break;\n        }\n    }\n\n    AUValue getParameter(AUParameterAddress address) override {\n        switch (address) {\n            case AKSequencerEngineParameterTempo:\n                return tempo;\n            case AKSequencerEngineParameterLength:\n                return length;\n            case AKSequencerEngineParameterMaximumPlayCount:\n                return maximumPlayCount;\n                break;\n            case AKSequencerEngineParameterPosition:\n                return currentPositionInBeats();\n                break;\n            case AKSequencerEngineParameterLoopEnabled:\n                return loopEnabled ? 1.f : 0.f;\n            default:\n                return 0.f;\n        }\n    }\n\n    void process(AUAudioFrameCount frameCount, AUAudioFrameCount bufferOffset) override {\n        if (isStarted) {\n            if (positionInSamples >= lengthInSamples()){\n                if (!loopEnabled) { \/\/stop if played enough\n                    stop();\n                    return;\n                }\n            }\n            long currentStartSample = positionModulo();\n            long currentEndSample = currentStartSample + frameCount;\n            for (int i = 0; i < events.size(); i++) {\n                \/\/ go through every event\n                int triggerTime = beatToSamples(events[i].beat);\n                if (currentStartSample <= triggerTime && triggerTime < currentEndSample) {\n                    \/\/ this event is supposed to trigger between currentStartSample and currentEndSample\n                    int offset = (int)(triggerTime - currentStartSample);\n                    sendMidiData(events[i].status, events[i].data1, events[i].data2,\n                                 offset, events[i].beat);\n                } else if (currentEndSample > lengthInSamples() && loopEnabled) {\n                    \/\/ this buffer extends beyond the length of the loop and looping is on\n                    int loopRestartInBuffer = (int)(lengthInSamples() - currentStartSample);\n                    int samplesOfBufferForNewLoop = frameCount - loopRestartInBuffer;\n                    if (triggerTime < samplesOfBufferForNewLoop) {\n                        \/\/ this event would trigger early enough in the next loop that it should happen in this buffer\n                        \/\/ ie. this buffer contains events from the previous loop, and the next loop\n                        int offset = (int)triggerTime + loopRestartInBuffer;\n                        sendMidiData(events[i].status, events[i].data1, events[i].data2,\n                                     offset, events[i].beat);\n                    }\n                }\n            }\n\n            \/\/ Check the playing notes for note offs\n            int i = 0;\n            while (i < playingNotes.size()) {\n                int triggerTime = beatToSamples(playingNotes[i].noteOff.beat);\n                if (currentStartSample <= triggerTime && triggerTime < currentEndSample) {\n                    int offset = (int)(triggerTime - currentStartSample);\n                    stopPlayingNote(playingNotes[i], offset, i);\n                    continue;\n                }\n\n                if (currentEndSample > lengthInSamples() && loopEnabled) {\n                    int loopRestartInBuffer = (int)(lengthInSamples() - currentStartSample);\n                    int samplesOfBufferForNewLoop = frameCount - loopRestartInBuffer;\n                    if (triggerTime < samplesOfBufferForNewLoop) {\n                        int offset = (int)triggerTime + loopRestartInBuffer;\n                        stopPlayingNote(playingNotes[i], offset, i);\n                        continue;\n                    }\n                }\n                i++;\n            }\n\n            \/\/ Check scheduled notes for note ons\n            for (int i = 0; i < notes.size(); i++) {\n                int triggerTime = beatToSamples(notes[i].noteOn.beat);\n                if (currentStartSample <= triggerTime && triggerTime < currentEndSample) {\n                    int offset = (int)(triggerTime - currentStartSample);\n                    addPlayingNote(notes[i], offset);\n                } else if (currentEndSample > lengthInSamples() && loopEnabled) {\n                    int loopRestartInBuffer = (int)(lengthInSamples() - currentStartSample);\n                    int samplesOfBufferForNewLoop = frameCount - loopRestartInBuffer;\n                    if (triggerTime < samplesOfBufferForNewLoop) {\n                        int offset = (int)triggerTime + loopRestartInBuffer;\n                        addPlayingNote(notes[i], offset);\n                    }\n                }\n            }\n\n            positionInSamples += frameCount;\n        }\n        framesCounted += frameCount;\n    }\n\n    void removeNoteAt(double beat) {\n        for (int i = 0; i < notes.size(); i++) {\n            MIDINote note = notes[i];\n            if (note.noteOn.beat == beat) {\n                notes.erase(notes.begin()+i);\n            }\n        }\n    }\n    \n    void removeNoteAt(uint8_t noteToRemove, double beat) {\n        \n        for (int i = 0; i < notes.size(); i++) {\n            MIDINote note = notes[i];\n            if (note.noteOn.beat == beat && note.noteOn.data1 == noteToRemove) {\n                notes.erase(notes.begin()+i);\n            }\n        }\n    }\n    \n    void removeAllInstancesOf(uint8_t noteToRemove) {\n        \n         for (auto itr1 = notes.rbegin(); itr1 < notes.rend(); itr1++) {\n             if (itr1->noteOn.data1 == noteToRemove) {\n                   notes.erase((itr1 + 1).base());\n               }\n           }\n    }\n\n    void removeEventAt(double beat) {\n        for (int i = 0; i < events.size(); i++) {\n            MIDIEvent event = events[i];\n            if (event.beat == beat) {\n                events.erase(events.begin()+i);\n            }\n        }\n    }\n\n    void addMIDIEvent(uint8_t status, uint8_t data1, uint8_t data2, double beat) {\n        MIDIEvent newEvent;\n        newEvent.status = status;\n        newEvent.data1 = data1;\n        newEvent.data2 = data2;\n        newEvent.beat = beat;\n        events.push_back(newEvent);\n    }\n\n    void addMIDINote(uint8_t number, uint8_t velocity, double beat, double duration) {\n        MIDINote newNote;\n\n        newNote.noteOn.status = NOTEON;\n        newNote.noteOn.data1 = number;\n        newNote.noteOn.data2 = velocity;\n        newNote.noteOn.beat = beat;\n\n        newNote.noteOff.status = NOTEOFF;\n        newNote.noteOff.data1 = number;\n        newNote.noteOff.data2 = velocity;\n        newNote.noteOff.beat = beat + duration;\n\n        notes.push_back(newNote);\n    }\n\n    void clear() {\n        notes.clear();\n        events.clear();\n    }\n\n    void stopPlayingNotes() {\n        while (playingNotes.size() > 0) {\n            stopPlayingNote(playingNotes[0], 0, 0);\n        }\n    }\n\n    void sendMidiData(UInt8 status, UInt8 data1, UInt8 data2, double offset, double time) {\n\/\/        printf(\"%p: sending: %i %i %i at offset %f (%f beats)\\n\", &midiEndpoint, status, data1, data2, offset, time);\n        if (midiPort == 0 || midiEndpoint == 0) {\n            MusicDeviceMIDIEvent(targetAU, status, data1, data2, offset);\n        } else {\n            MIDIPacketList packetList;\n            packetList.numPackets = 1;\n            MIDIPacket* firstPacket = &packetList.packet[0];\n            firstPacket->length = 3;\n            firstPacket->data[0] = status;\n            firstPacket->data[1] = data1;\n            firstPacket->data[2] = data2;\n            firstPacket->timeStamp = offset;\n            MIDISend(midiPort, midiEndpoint, &packetList);\n        }\n    }\n\n    long lengthInSamples() {\n        return beatToSamples(length);\n    }\n\n    int beatToSamples(double beat) {\n        return (int)(beat \/ tempo * 60 * sampleRate);\n    }\n\n    long positionModulo() {\n        long length = lengthInSamples();\n        if (positionInSamples == 0 || length == 0) {\n            return 0;\n        } else if (positionInSamples < 0) {\n            return positionInSamples;\n        } else {\n            return positionInSamples % length;\n        }\n    }\n\n    double currentPositionInBeats() {\n        return (double)positionModulo() \/ sampleRate * (tempo \/ 60);\n    }\n\n    bool validTriggerTime(double beat) {\n        return true;\n    }\n\nprivate:\n\n    float startPoint = 0;\n    AudioUnit targetAU;\n    UInt64 framesCounted = 0;\n    long positionInSamples = 0;\n\npublic:\n    MIDIPortRef midiPort;\n    MIDIEndpointRef midiEndpoint;\n    std::vector<MIDIEvent> events;\n    std::vector<MIDINote> notes;\n    std::vector<MIDINote> playingNotes;\n    int maximumPlayCount = 0;\n    double length = 4.0;\n    double tempo = 120.0;\n    bool loopEnabled = true;\n    uint numberOfLoops = 0;\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 -emit-llvm %s -o -  | FileCheck %s\n\nnamespace Common {\nenum RenderMode {\n  kRenderEGA,\n  kRenderCGA\n};\nclass C;\nclass A {\n  A();\n  C *_vm;\n  unsigned char _highlightColorTableVGA[];\n  static const unsigned char b[];\n};\nclass B {\npublic:\n  Common::RenderMode _configRenderMode;\n};\nclass C : public B {};\nA::A() {\n  0 == Common::kRenderCGA || _vm->_configRenderMode == Common::kRenderEGA\n      ? b\n      : _highlightColorTableVGA;\n\/\/ Make sure the PHI value is casted correctly to the PHI type\n\/\/ CHECK: %cond-lvalue = phi [0 x i8]* [ bitcast ([1 x i8]* @_ZN6Common1A1bE to [0 x i8]*), %cond.true ], [ %_highlightColorTableVGA, %cond.false ]\n}\nconst unsigned char A::b[] = { 0 };\n}\n<commit_msg>Fix pr19841.cpp on release mode<commit_after>\/\/ RUN: %clang_cc1 -emit-llvm %s -o -  | FileCheck %s\n\nnamespace Common {\nenum RenderMode {\n  kRenderEGA,\n  kRenderCGA\n};\nclass C;\nclass A {\n  A();\n  C *_vm;\n  unsigned char _highlightColorTableVGA[];\n  static const unsigned char b[];\n};\nclass B {\npublic:\n  Common::RenderMode _configRenderMode;\n};\nclass C : public B {};\nA::A() {\n  0 == Common::kRenderCGA || _vm->_configRenderMode == Common::kRenderEGA\n      ? b\n      : _highlightColorTableVGA;\n\/\/ Make sure the PHI value is casted correctly to the PHI type\n\/\/ CHECK: %{{.*}} = phi [0 x i8]* [ bitcast ([1 x i8]* @_ZN6Common1A1bE to [0 x i8]*), %cond.true ], [ %{{.*}}, %cond.false ]\n}\nconst unsigned char A::b[] = { 0 };\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: canvascustomsprite.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: obo $ $Date: 2007-07-17 14:25: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_canvas.hxx\"\n\n#include <canvas\/debug.hxx>\n#include <canvas\/verbosetrace.hxx>\n\n#include <rtl\/math.hxx>\n\n#include <vcl\/outdev.hxx>\n#include <vcl\/bitmap.hxx>\n#include <vcl\/alpha.hxx>\n#include <vcl\/bitmapex.hxx>\n#include <vcl\/canvastools.hxx>\n\n#include <basegfx\/matrix\/b2dhommatrix.hxx>\n#include <basegfx\/point\/b2dpoint.hxx>\n#include <basegfx\/tools\/canvastools.hxx>\n#include <basegfx\/polygon\/b2dpolygon.hxx>\n#include <basegfx\/polygon\/b2dpolygontools.hxx>\n#include <basegfx\/polygon\/b2dpolypolygontools.hxx>\n#include <basegfx\/numeric\/ftools.hxx>\n\n#include <canvas\/canvastools.hxx>\n\n#include \"canvascustomsprite.hxx\"\n\n\nusing namespace ::com::sun::star;\n\n\nnamespace vclcanvas\n{\n\n    CanvasCustomSprite::CanvasCustomSprite( const geometry::RealSize2D& rSpriteSize,\n                                            const SpriteCanvasRef&      rSpriteCanvas,\n                                            bool                        bShowSpriteBounds ) :\n        mpSpriteCanvas( rSpriteCanvas )\n    {\n        ENSURE_AND_THROW( rSpriteCanvas.get() &&\n                          rSpriteCanvas->getOutDev(),\n                          \"CanvasCustomSprite::CanvasCustomSprite(): Invalid sprite canvas\" );\n\n        \/\/ setup back buffer\n        \/\/ -----------------\n\n        const ::Size aSize(\n            static_cast<sal_Int32>( ::std::max( 1.0,\n                                                ceil( rSpriteSize.Width ))),  \/\/ round up to nearest int,\n                                                                              \/\/ enforce sprite to have at\n                                                                               \/\/ least (1,1) pixel size\n            static_cast<sal_Int32>( ::std::max( 1.0,\n                                                ceil( rSpriteSize.Height ))) );\n\n        \/\/ create content backbuffer in screen depth\n        BackBufferSharedPtr pBackBuffer( new BackBuffer( *rSpriteCanvas->getOutDev() ) );\n        pBackBuffer->setSize( aSize );\n\n        \/\/ create mask backbuffer, with one bit color depth\n        BackBufferSharedPtr pBackBufferMask( new BackBuffer( *rSpriteCanvas->getOutDev(),\n                                                             true ) );\n        pBackBufferMask->setSize( aSize );\n\n        \/\/ TODO(F1): Implement alpha vdev (could prolly enable\n        \/\/ antialiasing again, then)\n\n        \/\/ disable font antialiasing (causes ugly shadows otherwise)\n        pBackBuffer->getVirDev().SetAntialiasing( ANTIALIASING_DISABLE_TEXT );\n        pBackBufferMask->getVirDev().SetAntialiasing( ANTIALIASING_DISABLE_TEXT );\n\n        \/\/ set mask vdev drawmode, such that everything is painted\n        \/\/ black. That leaves us with a binary image, white for\n        \/\/ background, black for painted content\n        pBackBufferMask->getVirDev().SetDrawMode( DRAWMODE_BLACKLINE | DRAWMODE_BLACKFILL | DRAWMODE_BLACKTEXT |\n                                                  DRAWMODE_BLACKGRADIENT | DRAWMODE_BLACKBITMAP );\n\n\n        \/\/ setup canvas helper\n        \/\/ -------------------\n\n        \/\/ always render into back buffer, don't preserve state (it's\n        \/\/ our private VDev, after all), have notion of alpha\n        maCanvasHelper.init( *rSpriteCanvas.get(),\n                             pBackBuffer,\n                             false,\n                             true );\n        maCanvasHelper.setBackgroundOutDev( pBackBufferMask );\n\n\n        \/\/ setup sprite helper\n        \/\/ -------------------\n\n        maSpriteHelper.init( rSpriteSize,\n                             rSpriteCanvas,\n                             pBackBuffer,\n                             pBackBufferMask,\n                             bShowSpriteBounds );\n\n        \/\/ clear sprite to 100% transparent\n        maCanvasHelper.clear();\n    }\n\n    void SAL_CALL CanvasCustomSprite::disposing()\n    {\n        tools::LocalGuard aGuard;\n\n        mpSpriteCanvas.clear();\n\n        \/\/ forward to parent\n        CanvasCustomSpriteBaseT::disposing();\n    }\n\n#define IMPLEMENTATION_NAME \"VCLCanvas.CanvasCustomSprite\"\n#define SERVICE_NAME \"com.sun.star.rendering.CanvasCustomSprite\"\n\n    ::rtl::OUString SAL_CALL CanvasCustomSprite::getImplementationName() throw( uno::RuntimeException )\n    {\n        return ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( IMPLEMENTATION_NAME ) );\n    }\n\n    sal_Bool SAL_CALL CanvasCustomSprite::supportsService( const ::rtl::OUString& ServiceName ) throw( uno::RuntimeException )\n    {\n        return ServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM ( SERVICE_NAME ) );\n    }\n\n    uno::Sequence< ::rtl::OUString > SAL_CALL CanvasCustomSprite::getSupportedServiceNames()  throw( uno::RuntimeException )\n    {\n        uno::Sequence< ::rtl::OUString > aRet(1);\n        aRet[0] = ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM ( SERVICE_NAME ) );\n\n        return aRet;\n    }\n\n    \/\/ Sprite\n    void CanvasCustomSprite::redraw( OutputDevice& rOutDev,\n                                     bool          bBufferedUpdate ) const\n    {\n        tools::LocalGuard aGuard;\n\n        redraw( rOutDev, maSpriteHelper.getPosPixel(), bBufferedUpdate );\n    }\n\n    void CanvasCustomSprite::redraw( OutputDevice&              rOutDev,\n                                     const ::basegfx::B2DPoint& rOrigOutputPos,\n                                     bool                       bBufferedUpdate ) const\n    {\n        tools::LocalGuard aGuard;\n\n        maSpriteHelper.redraw( rOutDev,\n                               rOrigOutputPos,\n                               mbSurfaceDirty,\n                               bBufferedUpdate );\n\n        mbSurfaceDirty = false;\n    }\n\n    bool CanvasCustomSprite::repaint( const GraphicObjectSharedPtr& rGrf,\n                                      const ::Point&                rPt,\n                                      const ::Size&                 rSz,\n                                      const GraphicAttr&            rAttr ) const\n    {\n        tools::LocalGuard aGuard;\n\n        mbSurfaceDirty = true;\n\n        return maCanvasHelper.repaint( rGrf, rPt, rSz, rAttr );\n    }\n\n}\n<commit_msg>INTEGRATION: CWS thbpp9_SRC680 (1.12.28); FILE MERGED 2007\/10\/17 21:14:36 thb 1.12.28.1: #i82485# Carry clips along, also for XCachedPrimitive repaints<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: canvascustomsprite.cxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-01 14:41: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_canvas.hxx\"\n\n#include <canvas\/debug.hxx>\n#include <canvas\/verbosetrace.hxx>\n\n#include <rtl\/math.hxx>\n\n#include <vcl\/outdev.hxx>\n#include <vcl\/bitmap.hxx>\n#include <vcl\/alpha.hxx>\n#include <vcl\/bitmapex.hxx>\n#include <vcl\/canvastools.hxx>\n\n#include <basegfx\/matrix\/b2dhommatrix.hxx>\n#include <basegfx\/point\/b2dpoint.hxx>\n#include <basegfx\/tools\/canvastools.hxx>\n#include <basegfx\/polygon\/b2dpolygon.hxx>\n#include <basegfx\/polygon\/b2dpolygontools.hxx>\n#include <basegfx\/polygon\/b2dpolypolygontools.hxx>\n#include <basegfx\/numeric\/ftools.hxx>\n\n#include <canvas\/canvastools.hxx>\n\n#include \"canvascustomsprite.hxx\"\n\n\nusing namespace ::com::sun::star;\n\n\nnamespace vclcanvas\n{\n\n    CanvasCustomSprite::CanvasCustomSprite( const geometry::RealSize2D& rSpriteSize,\n                                            const SpriteCanvasRef&      rSpriteCanvas,\n                                            bool                        bShowSpriteBounds ) :\n        mpSpriteCanvas( rSpriteCanvas )\n    {\n        ENSURE_AND_THROW( rSpriteCanvas.get() &&\n                          rSpriteCanvas->getOutDev(),\n                          \"CanvasCustomSprite::CanvasCustomSprite(): Invalid sprite canvas\" );\n\n        \/\/ setup back buffer\n        \/\/ -----------------\n\n        const ::Size aSize(\n            static_cast<sal_Int32>( ::std::max( 1.0,\n                                                ceil( rSpriteSize.Width ))),  \/\/ round up to nearest int,\n                                                                              \/\/ enforce sprite to have at\n                                                                               \/\/ least (1,1) pixel size\n            static_cast<sal_Int32>( ::std::max( 1.0,\n                                                ceil( rSpriteSize.Height ))) );\n\n        \/\/ create content backbuffer in screen depth\n        BackBufferSharedPtr pBackBuffer( new BackBuffer( *rSpriteCanvas->getOutDev() ) );\n        pBackBuffer->setSize( aSize );\n\n        \/\/ create mask backbuffer, with one bit color depth\n        BackBufferSharedPtr pBackBufferMask( new BackBuffer( *rSpriteCanvas->getOutDev(),\n                                                             true ) );\n        pBackBufferMask->setSize( aSize );\n\n        \/\/ TODO(F1): Implement alpha vdev (could prolly enable\n        \/\/ antialiasing again, then)\n\n        \/\/ disable font antialiasing (causes ugly shadows otherwise)\n        pBackBuffer->getVirDev().SetAntialiasing( ANTIALIASING_DISABLE_TEXT );\n        pBackBufferMask->getVirDev().SetAntialiasing( ANTIALIASING_DISABLE_TEXT );\n\n        \/\/ set mask vdev drawmode, such that everything is painted\n        \/\/ black. That leaves us with a binary image, white for\n        \/\/ background, black for painted content\n        pBackBufferMask->getVirDev().SetDrawMode( DRAWMODE_BLACKLINE | DRAWMODE_BLACKFILL | DRAWMODE_BLACKTEXT |\n                                                  DRAWMODE_BLACKGRADIENT | DRAWMODE_BLACKBITMAP );\n\n\n        \/\/ setup canvas helper\n        \/\/ -------------------\n\n        \/\/ always render into back buffer, don't preserve state (it's\n        \/\/ our private VDev, after all), have notion of alpha\n        maCanvasHelper.init( *rSpriteCanvas.get(),\n                             pBackBuffer,\n                             false,\n                             true );\n        maCanvasHelper.setBackgroundOutDev( pBackBufferMask );\n\n\n        \/\/ setup sprite helper\n        \/\/ -------------------\n\n        maSpriteHelper.init( rSpriteSize,\n                             rSpriteCanvas,\n                             pBackBuffer,\n                             pBackBufferMask,\n                             bShowSpriteBounds );\n\n        \/\/ clear sprite to 100% transparent\n        maCanvasHelper.clear();\n    }\n\n    void SAL_CALL CanvasCustomSprite::disposing()\n    {\n        tools::LocalGuard aGuard;\n\n        mpSpriteCanvas.clear();\n\n        \/\/ forward to parent\n        CanvasCustomSpriteBaseT::disposing();\n    }\n\n#define IMPLEMENTATION_NAME \"VCLCanvas.CanvasCustomSprite\"\n#define SERVICE_NAME \"com.sun.star.rendering.CanvasCustomSprite\"\n\n    ::rtl::OUString SAL_CALL CanvasCustomSprite::getImplementationName() throw( uno::RuntimeException )\n    {\n        return ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( IMPLEMENTATION_NAME ) );\n    }\n\n    sal_Bool SAL_CALL CanvasCustomSprite::supportsService( const ::rtl::OUString& ServiceName ) throw( uno::RuntimeException )\n    {\n        return ServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM ( SERVICE_NAME ) );\n    }\n\n    uno::Sequence< ::rtl::OUString > SAL_CALL CanvasCustomSprite::getSupportedServiceNames()  throw( uno::RuntimeException )\n    {\n        uno::Sequence< ::rtl::OUString > aRet(1);\n        aRet[0] = ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM ( SERVICE_NAME ) );\n\n        return aRet;\n    }\n\n    \/\/ Sprite\n    void CanvasCustomSprite::redraw( OutputDevice& rOutDev,\n                                     bool          bBufferedUpdate ) const\n    {\n        tools::LocalGuard aGuard;\n\n        redraw( rOutDev, maSpriteHelper.getPosPixel(), bBufferedUpdate );\n    }\n\n    void CanvasCustomSprite::redraw( OutputDevice&              rOutDev,\n                                     const ::basegfx::B2DPoint& rOrigOutputPos,\n                                     bool                       bBufferedUpdate ) const\n    {\n        tools::LocalGuard aGuard;\n\n        maSpriteHelper.redraw( rOutDev,\n                               rOrigOutputPos,\n                               mbSurfaceDirty,\n                               bBufferedUpdate );\n\n        mbSurfaceDirty = false;\n    }\n\n    bool CanvasCustomSprite::repaint( const GraphicObjectSharedPtr& rGrf,\n                                      const rendering::ViewState&   viewState,\n                                      const rendering::RenderState& renderState,\n                                      const ::Point&                rPt,\n                                      const ::Size&                 rSz,\n                                      const GraphicAttr&            rAttr ) const\n    {\n        tools::LocalGuard aGuard;\n\n        mbSurfaceDirty = true;\n\n        return maCanvasHelper.repaint( rGrf, viewState, renderState, rPt, rSz, rAttr );\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: RangeHighlighter.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: kz $ $Date: 2008-03-06 17:47: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_chart2.hxx\"\n\n#include \"RangeHighlighter.hxx\"\n#include \"WeakListenerAdapter.hxx\"\n#include \"ChartModelHelper.hxx\"\n#include \"DataSourceHelper.hxx\"\n#include \"ContainerHelper.hxx\"\n#include \"macros.hxx\"\n#include \"ObjectIdentifier.hxx\"\n\n#include <com\/sun\/star\/chart2\/XDataSeries.hpp>\n#include <com\/sun\/star\/chart\/ErrorBarStyle.hpp>\n\n#define PREFERED_DEFAULT_COLOR 0x0000ff\n\nusing namespace ::com::sun::star;\n\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Sequence;\nusing ::rtl::OUString;\n\nnamespace\n{\n\nvoid lcl_fillRanges(\n    Sequence< chart2::data::HighlightedRange > & rOutRanges,\n    Sequence< OUString > aRangeStrings,\n    sal_Int32 nPreferredColor = PREFERED_DEFAULT_COLOR,\n    sal_Int32 nIndex = -1 )\n{\n    rOutRanges.realloc( aRangeStrings.getLength());\n    for( sal_Int32 i=0; i<aRangeStrings.getLength(); ++i )\n    {\n        rOutRanges[i].RangeRepresentation = aRangeStrings[i];\n        rOutRanges[i].PreferredColor = nPreferredColor;\n        rOutRanges[i].AllowMerginigWithOtherRanges = sal_False;\n        rOutRanges[i].Index = nIndex;\n    }\n}\n\nsal_Int32 lcl_getColor( const Reference< beans::XPropertySet > & xProp )\n{\n    sal_Int32 nResult = PREFERED_DEFAULT_COLOR;\n\n    try\n    {\n        if( xProp.is())\n            xProp->getPropertyValue( C2U(\"Color\")) >>= nResult;\n    }\n    catch( const uno::Exception & ex )\n    {\n        ASSERT_EXCEPTION( ex );\n    }\n\n    return nResult;\n}\n\n} \/\/ anonymous namespace\n\nnamespace chart\n{\n\nRangeHighlighter::RangeHighlighter(\n    const Reference< view::XSelectionSupplier > & xSelectionSupplier ) :\n        impl::RangeHighlighter_Base( m_aMutex ),\n        m_xSelectionSupplier( xSelectionSupplier ),\n        m_nAddedListenerCount( 0 )\n{\n}\n\nRangeHighlighter::~RangeHighlighter()\n{}\n\n\/\/ ____ XRangeHighlighter ____\nSequence< chart2::data::HighlightedRange > SAL_CALL RangeHighlighter::getSelectedRanges()\n    throw (uno::RuntimeException)\n{\n    return m_aSelectedRanges;\n}\n\nvoid RangeHighlighter::determineRanges()\n{\n    m_aSelectedRanges.realloc( 0 );\n    if( m_xSelectionSupplier.is())\n    {\n        try\n        {\n            Reference< frame::XController > xController( m_xSelectionSupplier, uno::UNO_QUERY );\n            Reference< frame::XModel > xChartModel;\n            if( xController.is())\n                xChartModel.set( xController->getModel());\n\n            uno::Any aSelection( m_xSelectionSupplier->getSelection());\n            OUString aCID;\n            if(( aSelection >>= aCID ) &&\n               aCID.getLength() > 0 )\n            {\n                \/\/ @todo??: maybe getSelection() should return a model object rather than a CID\n\n                ObjectType eObjectType = ObjectIdentifier::getObjectType( aCID );\n                sal_Int32 nIndex = ObjectIdentifier::getIndexFromParticleOrCID( aCID );\n                Reference< chart2::XDataSeries > xDataSeries( ObjectIdentifier::getDataSeriesForCID( aCID, xChartModel ) );\n                if( OBJECTTYPE_LEGEND_ENTRY == eObjectType )\n                {\n                    OUString aParentParticel( ObjectIdentifier::getFullParentParticle( aCID ) );\n                    ObjectType eParentObjectType = ObjectIdentifier::getObjectType( aParentParticel );\n                    eObjectType = eParentObjectType;\n                    if( OBJECTTYPE_DATA_POINT == eObjectType )\n                        nIndex = ObjectIdentifier::getIndexFromParticleOrCID( aParentParticel );\n                }\n\n                if( OBJECTTYPE_DATA_POINT == eObjectType || OBJECTTYPE_DATA_LABEL == eObjectType )\n                {\n                    \/\/ Data Point\n                    fillRangesForDataPoint( xDataSeries, nIndex );\n                    return;\n                }\n                else if( OBJECTTYPE_DATA_ERRORS == eObjectType )\n                {\n                    \/\/ select error bar ranges, or data series, if the style is\n                    \/\/ not set to FROM_DATA\n                    fillRangesForErrorBars( ObjectIdentifier::getObjectPropertySet( aCID, xChartModel ), xDataSeries );\n                    return;\n                }\n                else if( xDataSeries.is() )\n                {\n                    \/\/ Data Series\n                    fillRangesForDataSeries( xDataSeries );\n                    return;\n                }\n                else if( OBJECTTYPE_AXIS == eObjectType )\n                {\n                    \/\/ Axis (Categories)\n                    Reference< chart2::XAxis > xAxis( ObjectIdentifier::getObjectPropertySet( aCID, xChartModel ), uno::UNO_QUERY );\n                    if( xAxis.is())\n                    {\n                        fillRangesForCategories( xAxis );\n                        return;\n                    }\n                }\n                else if( OBJECTTYPE_PAGE == eObjectType\n                         || OBJECTTYPE_DIAGRAM == eObjectType\n                         || OBJECTTYPE_DIAGRAM_WALL == eObjectType\n                         || OBJECTTYPE_DIAGRAM_FLOOR == eObjectType\n                    )\n                {\n                    \/\/ Diagram\n                    Reference< chart2::XDiagram > xDia( ObjectIdentifier::getDiagramForCID( aCID, xChartModel ) );\n                    if( xDia.is())\n                    {\n                        fillRangesForDiagram( xDia );\n                        return;\n                    }\n                }\n            }\n            else\n            {\n                \/\/if nothing is selected select all ranges\n                Reference< chart2::XChartDocument > xChartDoc( xChartModel, uno::UNO_QUERY_THROW );\n                fillRangesForDiagram( xChartDoc->getFirstDiagram() );\n                return;\n            }\n        }\n        catch( const uno::Exception & ex )\n        {\n            ASSERT_EXCEPTION( ex );\n        }\n    }\n}\n\nvoid RangeHighlighter::fillRangesForDiagram( const Reference< chart2::XDiagram > & xDiagram )\n{\n    Sequence< OUString > aSelectedRanges( DataSourceHelper::getUsedDataRanges( xDiagram ));\n    m_aSelectedRanges.realloc( aSelectedRanges.getLength());\n    \/\/ @todo: merge ranges\n    for( sal_Int32 i=0; i<aSelectedRanges.getLength(); ++i )\n    {\n        m_aSelectedRanges[i].RangeRepresentation = aSelectedRanges[i];\n        m_aSelectedRanges[i].Index = -1;\n        m_aSelectedRanges[i].PreferredColor = PREFERED_DEFAULT_COLOR;\n        m_aSelectedRanges[i].AllowMerginigWithOtherRanges = sal_True;\n    }\n}\n\nvoid RangeHighlighter::fillRangesForDataSeries( const uno::Reference< chart2::XDataSeries > & xSeries )\n{\n    sal_Int32 nPreferredColor = PREFERED_DEFAULT_COLOR;\n\/\/         lcl_getColor( Reference< beans::XPropertySet >( xSeries, uno::UNO_QUERY ));\n    Reference< chart2::data::XDataSource > xSource( xSeries, uno::UNO_QUERY );\n    if( xSource.is())\n        lcl_fillRanges( m_aSelectedRanges,\n                        ::chart::DataSourceHelper::getRangesFromDataSource( xSource ),\n                        nPreferredColor );\n}\n\nvoid RangeHighlighter::fillRangesForErrorBars(\n    const uno::Reference< beans::XPropertySet > & xErrorBar,\n    const uno::Reference< chart2::XDataSeries > & xSeries )\n{\n    \/\/ only show error bar ranges, if the style is set to FROM_DATA\n    bool bUsesRangesAsErrorBars = false;\n    try\n    {\n        sal_Int32 nStyle = ::com::sun::star::chart::ErrorBarStyle::NONE;\n        bUsesRangesAsErrorBars =\n            ( xErrorBar.is() &&\n              (xErrorBar->getPropertyValue( C2U(\"ErrorBarStyle\")) >>= nStyle) &&\n              nStyle == ::com::sun::star::chart::ErrorBarStyle::FROM_DATA );\n    }\n    catch( const uno::Exception & ex )\n    {\n        ASSERT_EXCEPTION( ex );\n    }\n\n    if( bUsesRangesAsErrorBars )\n    {\n        sal_Int32 nPreferredColor = PREFERED_DEFAULT_COLOR;\n        Reference< chart2::data::XDataSource > xSource( xErrorBar, uno::UNO_QUERY );\n        if( xSource.is())\n            lcl_fillRanges( m_aSelectedRanges,\n                            ::chart::DataSourceHelper::getRangesFromDataSource( xSource ),\n                            nPreferredColor );\n    }\n    else\n    {\n        fillRangesForDataSeries( xSeries );\n    }\n}\n\nvoid RangeHighlighter::fillRangesForCategories( const Reference< chart2::XAxis > & xAxis )\n{\n    if( ! xAxis.is())\n        return;\n    chart2::ScaleData aData( xAxis->getScaleData());\n    lcl_fillRanges( m_aSelectedRanges,\n                    DataSourceHelper::getRangesFromLabeledDataSequence( aData.Categories ));\n}\n\nvoid RangeHighlighter::fillRangesForDataPoint( const Reference< uno::XInterface > & xDataSeries, sal_Int32 nIndex )\n{\n    sal_Int32 nPreferredColor = PREFERED_DEFAULT_COLOR;\n\/\/         lcl_getColor( Reference< beans::XPropertySet >( xDataPoint, uno::UNO_QUERY ));\n    if( xDataSeries.is())\n    {\n        Reference< chart2::data::XDataSource > xSource( xDataSeries, uno::UNO_QUERY );\n        if( xSource.is() )\n        {\n            ::std::vector< chart2::data::HighlightedRange > aHilightedRanges;\n            Sequence< Reference< chart2::data::XLabeledDataSequence > > aLSeqSeq( xSource->getDataSequences());\n            for( sal_Int32 i=0; i<aLSeqSeq.getLength(); ++i )\n            {\n                Reference< chart2::data::XDataSequence > xLabel( aLSeqSeq[i]->getLabel());\n                Reference< chart2::data::XDataSequence > xValues( aLSeqSeq[i]->getValues());\n\n                if( xLabel.is())\n                    aHilightedRanges.push_back(\n                        chart2::data::HighlightedRange(\n                            xLabel->getSourceRangeRepresentation(),\n                            -1,\n                            nPreferredColor,\n                            sal_False ));\n                if( xValues.is())\n                    aHilightedRanges.push_back(\n                        chart2::data::HighlightedRange(\n                            xValues->getSourceRangeRepresentation(),\n                            nIndex,\n                            nPreferredColor,\n                            sal_False ));\n            }\n            m_aSelectedRanges = ContainerHelper::ContainerToSequence( aHilightedRanges );\n        }\n    }\n}\n\nvoid SAL_CALL RangeHighlighter::addSelectionChangeListener( const Reference< view::XSelectionChangeListener >& xListener )\n    throw (uno::RuntimeException)\n{\n    if(!xListener.is())\n        return;\n\n    if( m_nAddedListenerCount == 0 )\n        startListening();\n    rBHelper.addListener( ::getCppuType( & xListener ), xListener);\n    ++m_nAddedListenerCount;\n\n    \/\/bring the new listener up to the current state\n    lang::EventObject aEvent( static_cast< lang::XComponent* >( this ) );\n    xListener->selectionChanged( aEvent );\n}\n\nvoid SAL_CALL RangeHighlighter::removeSelectionChangeListener( const Reference< view::XSelectionChangeListener >& xListener )\n    throw (uno::RuntimeException)\n{\n    rBHelper.removeListener( ::getCppuType( & xListener ), xListener );\n    --m_nAddedListenerCount;\n    if( m_nAddedListenerCount == 0 )\n        stopListening();\n}\n\n\/\/ ____ XSelectionChangeListener ____\nvoid SAL_CALL RangeHighlighter::selectionChanged( const lang::EventObject& \/*aEvent*\/ )\n    throw (uno::RuntimeException)\n{\n    determineRanges();\n\n    \/\/ determine ranges of selected view objects\n    \/\/ if changed, fire an event\n    fireSelectionEvent();\n}\n\nvoid RangeHighlighter::fireSelectionEvent()\n{\n    ::cppu::OInterfaceContainerHelper* pIC = rBHelper.getContainer(\n        ::getCppuType((const uno::Reference< view::XSelectionChangeListener >*)0) );\n    if( pIC )\n    {\n        lang::EventObject aEvent( static_cast< lang::XComponent* >( this ) );\n        ::cppu::OInterfaceIteratorHelper aIt( *pIC );\n        while( aIt.hasMoreElements() )\n            (static_cast< view::XSelectionChangeListener*>(aIt.next()))->selectionChanged( aEvent );\n    }\n}\n\nvoid SAL_CALL RangeHighlighter::disposing( const lang::EventObject& Source )\n    throw (uno::RuntimeException)\n{\n    if( Source.Source == m_xSelectionSupplier )\n    {\n        m_xSelectionSupplier.clear();\n        m_aSelectedRanges.realloc( 0 );\n        fireSelectionEvent();\n    }\n}\n\nvoid RangeHighlighter::startListening()\n{\n    if( m_xSelectionSupplier.is())\n    {\n        if( ! m_xListener.is())\n        {\n            m_xListener.set( new WeakSelectionChangeListenerAdapter( this ));\n            determineRanges();\n        }\n        m_xSelectionSupplier->addSelectionChangeListener( m_xListener );\n    }\n}\n\nvoid RangeHighlighter::stopListening()\n{\n    if( m_xSelectionSupplier.is() && m_xListener.is())\n    {\n        m_xSelectionSupplier->removeSelectionChangeListener( m_xListener );\n        m_xListener.clear();\n    }\n}\n\n\n\/\/ ____ WeakComponentImplHelperBase ____\n\/\/ is called when dispose() is called at this component\nvoid SAL_CALL RangeHighlighter::disposing()\n{\n    \/\/ @todo: remove listener. Currently the controller shows an assertion\n    \/\/ because it is already disposed\n\/\/     stopListening();\n    m_xListener.clear();\n    m_xSelectionSupplier.clear();\n    m_nAddedListenerCount =  0;\n    m_aSelectedRanges.realloc( 0 );\n}\n\n} \/\/  namespace chart\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.20); FILE MERGED 2008\/03\/28 16:44:24 rt 1.5.20.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: RangeHighlighter.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_chart2.hxx\"\n\n#include \"RangeHighlighter.hxx\"\n#include \"WeakListenerAdapter.hxx\"\n#include \"ChartModelHelper.hxx\"\n#include \"DataSourceHelper.hxx\"\n#include \"ContainerHelper.hxx\"\n#include \"macros.hxx\"\n#include \"ObjectIdentifier.hxx\"\n\n#include <com\/sun\/star\/chart2\/XDataSeries.hpp>\n#include <com\/sun\/star\/chart\/ErrorBarStyle.hpp>\n\n#define PREFERED_DEFAULT_COLOR 0x0000ff\n\nusing namespace ::com::sun::star;\n\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Sequence;\nusing ::rtl::OUString;\n\nnamespace\n{\n\nvoid lcl_fillRanges(\n    Sequence< chart2::data::HighlightedRange > & rOutRanges,\n    Sequence< OUString > aRangeStrings,\n    sal_Int32 nPreferredColor = PREFERED_DEFAULT_COLOR,\n    sal_Int32 nIndex = -1 )\n{\n    rOutRanges.realloc( aRangeStrings.getLength());\n    for( sal_Int32 i=0; i<aRangeStrings.getLength(); ++i )\n    {\n        rOutRanges[i].RangeRepresentation = aRangeStrings[i];\n        rOutRanges[i].PreferredColor = nPreferredColor;\n        rOutRanges[i].AllowMerginigWithOtherRanges = sal_False;\n        rOutRanges[i].Index = nIndex;\n    }\n}\n\nsal_Int32 lcl_getColor( const Reference< beans::XPropertySet > & xProp )\n{\n    sal_Int32 nResult = PREFERED_DEFAULT_COLOR;\n\n    try\n    {\n        if( xProp.is())\n            xProp->getPropertyValue( C2U(\"Color\")) >>= nResult;\n    }\n    catch( const uno::Exception & ex )\n    {\n        ASSERT_EXCEPTION( ex );\n    }\n\n    return nResult;\n}\n\n} \/\/ anonymous namespace\n\nnamespace chart\n{\n\nRangeHighlighter::RangeHighlighter(\n    const Reference< view::XSelectionSupplier > & xSelectionSupplier ) :\n        impl::RangeHighlighter_Base( m_aMutex ),\n        m_xSelectionSupplier( xSelectionSupplier ),\n        m_nAddedListenerCount( 0 )\n{\n}\n\nRangeHighlighter::~RangeHighlighter()\n{}\n\n\/\/ ____ XRangeHighlighter ____\nSequence< chart2::data::HighlightedRange > SAL_CALL RangeHighlighter::getSelectedRanges()\n    throw (uno::RuntimeException)\n{\n    return m_aSelectedRanges;\n}\n\nvoid RangeHighlighter::determineRanges()\n{\n    m_aSelectedRanges.realloc( 0 );\n    if( m_xSelectionSupplier.is())\n    {\n        try\n        {\n            Reference< frame::XController > xController( m_xSelectionSupplier, uno::UNO_QUERY );\n            Reference< frame::XModel > xChartModel;\n            if( xController.is())\n                xChartModel.set( xController->getModel());\n\n            uno::Any aSelection( m_xSelectionSupplier->getSelection());\n            OUString aCID;\n            if(( aSelection >>= aCID ) &&\n               aCID.getLength() > 0 )\n            {\n                \/\/ @todo??: maybe getSelection() should return a model object rather than a CID\n\n                ObjectType eObjectType = ObjectIdentifier::getObjectType( aCID );\n                sal_Int32 nIndex = ObjectIdentifier::getIndexFromParticleOrCID( aCID );\n                Reference< chart2::XDataSeries > xDataSeries( ObjectIdentifier::getDataSeriesForCID( aCID, xChartModel ) );\n                if( OBJECTTYPE_LEGEND_ENTRY == eObjectType )\n                {\n                    OUString aParentParticel( ObjectIdentifier::getFullParentParticle( aCID ) );\n                    ObjectType eParentObjectType = ObjectIdentifier::getObjectType( aParentParticel );\n                    eObjectType = eParentObjectType;\n                    if( OBJECTTYPE_DATA_POINT == eObjectType )\n                        nIndex = ObjectIdentifier::getIndexFromParticleOrCID( aParentParticel );\n                }\n\n                if( OBJECTTYPE_DATA_POINT == eObjectType || OBJECTTYPE_DATA_LABEL == eObjectType )\n                {\n                    \/\/ Data Point\n                    fillRangesForDataPoint( xDataSeries, nIndex );\n                    return;\n                }\n                else if( OBJECTTYPE_DATA_ERRORS == eObjectType )\n                {\n                    \/\/ select error bar ranges, or data series, if the style is\n                    \/\/ not set to FROM_DATA\n                    fillRangesForErrorBars( ObjectIdentifier::getObjectPropertySet( aCID, xChartModel ), xDataSeries );\n                    return;\n                }\n                else if( xDataSeries.is() )\n                {\n                    \/\/ Data Series\n                    fillRangesForDataSeries( xDataSeries );\n                    return;\n                }\n                else if( OBJECTTYPE_AXIS == eObjectType )\n                {\n                    \/\/ Axis (Categories)\n                    Reference< chart2::XAxis > xAxis( ObjectIdentifier::getObjectPropertySet( aCID, xChartModel ), uno::UNO_QUERY );\n                    if( xAxis.is())\n                    {\n                        fillRangesForCategories( xAxis );\n                        return;\n                    }\n                }\n                else if( OBJECTTYPE_PAGE == eObjectType\n                         || OBJECTTYPE_DIAGRAM == eObjectType\n                         || OBJECTTYPE_DIAGRAM_WALL == eObjectType\n                         || OBJECTTYPE_DIAGRAM_FLOOR == eObjectType\n                    )\n                {\n                    \/\/ Diagram\n                    Reference< chart2::XDiagram > xDia( ObjectIdentifier::getDiagramForCID( aCID, xChartModel ) );\n                    if( xDia.is())\n                    {\n                        fillRangesForDiagram( xDia );\n                        return;\n                    }\n                }\n            }\n            else\n            {\n                \/\/if nothing is selected select all ranges\n                Reference< chart2::XChartDocument > xChartDoc( xChartModel, uno::UNO_QUERY_THROW );\n                fillRangesForDiagram( xChartDoc->getFirstDiagram() );\n                return;\n            }\n        }\n        catch( const uno::Exception & ex )\n        {\n            ASSERT_EXCEPTION( ex );\n        }\n    }\n}\n\nvoid RangeHighlighter::fillRangesForDiagram( const Reference< chart2::XDiagram > & xDiagram )\n{\n    Sequence< OUString > aSelectedRanges( DataSourceHelper::getUsedDataRanges( xDiagram ));\n    m_aSelectedRanges.realloc( aSelectedRanges.getLength());\n    \/\/ @todo: merge ranges\n    for( sal_Int32 i=0; i<aSelectedRanges.getLength(); ++i )\n    {\n        m_aSelectedRanges[i].RangeRepresentation = aSelectedRanges[i];\n        m_aSelectedRanges[i].Index = -1;\n        m_aSelectedRanges[i].PreferredColor = PREFERED_DEFAULT_COLOR;\n        m_aSelectedRanges[i].AllowMerginigWithOtherRanges = sal_True;\n    }\n}\n\nvoid RangeHighlighter::fillRangesForDataSeries( const uno::Reference< chart2::XDataSeries > & xSeries )\n{\n    sal_Int32 nPreferredColor = PREFERED_DEFAULT_COLOR;\n\/\/         lcl_getColor( Reference< beans::XPropertySet >( xSeries, uno::UNO_QUERY ));\n    Reference< chart2::data::XDataSource > xSource( xSeries, uno::UNO_QUERY );\n    if( xSource.is())\n        lcl_fillRanges( m_aSelectedRanges,\n                        ::chart::DataSourceHelper::getRangesFromDataSource( xSource ),\n                        nPreferredColor );\n}\n\nvoid RangeHighlighter::fillRangesForErrorBars(\n    const uno::Reference< beans::XPropertySet > & xErrorBar,\n    const uno::Reference< chart2::XDataSeries > & xSeries )\n{\n    \/\/ only show error bar ranges, if the style is set to FROM_DATA\n    bool bUsesRangesAsErrorBars = false;\n    try\n    {\n        sal_Int32 nStyle = ::com::sun::star::chart::ErrorBarStyle::NONE;\n        bUsesRangesAsErrorBars =\n            ( xErrorBar.is() &&\n              (xErrorBar->getPropertyValue( C2U(\"ErrorBarStyle\")) >>= nStyle) &&\n              nStyle == ::com::sun::star::chart::ErrorBarStyle::FROM_DATA );\n    }\n    catch( const uno::Exception & ex )\n    {\n        ASSERT_EXCEPTION( ex );\n    }\n\n    if( bUsesRangesAsErrorBars )\n    {\n        sal_Int32 nPreferredColor = PREFERED_DEFAULT_COLOR;\n        Reference< chart2::data::XDataSource > xSource( xErrorBar, uno::UNO_QUERY );\n        if( xSource.is())\n            lcl_fillRanges( m_aSelectedRanges,\n                            ::chart::DataSourceHelper::getRangesFromDataSource( xSource ),\n                            nPreferredColor );\n    }\n    else\n    {\n        fillRangesForDataSeries( xSeries );\n    }\n}\n\nvoid RangeHighlighter::fillRangesForCategories( const Reference< chart2::XAxis > & xAxis )\n{\n    if( ! xAxis.is())\n        return;\n    chart2::ScaleData aData( xAxis->getScaleData());\n    lcl_fillRanges( m_aSelectedRanges,\n                    DataSourceHelper::getRangesFromLabeledDataSequence( aData.Categories ));\n}\n\nvoid RangeHighlighter::fillRangesForDataPoint( const Reference< uno::XInterface > & xDataSeries, sal_Int32 nIndex )\n{\n    sal_Int32 nPreferredColor = PREFERED_DEFAULT_COLOR;\n\/\/         lcl_getColor( Reference< beans::XPropertySet >( xDataPoint, uno::UNO_QUERY ));\n    if( xDataSeries.is())\n    {\n        Reference< chart2::data::XDataSource > xSource( xDataSeries, uno::UNO_QUERY );\n        if( xSource.is() )\n        {\n            ::std::vector< chart2::data::HighlightedRange > aHilightedRanges;\n            Sequence< Reference< chart2::data::XLabeledDataSequence > > aLSeqSeq( xSource->getDataSequences());\n            for( sal_Int32 i=0; i<aLSeqSeq.getLength(); ++i )\n            {\n                Reference< chart2::data::XDataSequence > xLabel( aLSeqSeq[i]->getLabel());\n                Reference< chart2::data::XDataSequence > xValues( aLSeqSeq[i]->getValues());\n\n                if( xLabel.is())\n                    aHilightedRanges.push_back(\n                        chart2::data::HighlightedRange(\n                            xLabel->getSourceRangeRepresentation(),\n                            -1,\n                            nPreferredColor,\n                            sal_False ));\n                if( xValues.is())\n                    aHilightedRanges.push_back(\n                        chart2::data::HighlightedRange(\n                            xValues->getSourceRangeRepresentation(),\n                            nIndex,\n                            nPreferredColor,\n                            sal_False ));\n            }\n            m_aSelectedRanges = ContainerHelper::ContainerToSequence( aHilightedRanges );\n        }\n    }\n}\n\nvoid SAL_CALL RangeHighlighter::addSelectionChangeListener( const Reference< view::XSelectionChangeListener >& xListener )\n    throw (uno::RuntimeException)\n{\n    if(!xListener.is())\n        return;\n\n    if( m_nAddedListenerCount == 0 )\n        startListening();\n    rBHelper.addListener( ::getCppuType( & xListener ), xListener);\n    ++m_nAddedListenerCount;\n\n    \/\/bring the new listener up to the current state\n    lang::EventObject aEvent( static_cast< lang::XComponent* >( this ) );\n    xListener->selectionChanged( aEvent );\n}\n\nvoid SAL_CALL RangeHighlighter::removeSelectionChangeListener( const Reference< view::XSelectionChangeListener >& xListener )\n    throw (uno::RuntimeException)\n{\n    rBHelper.removeListener( ::getCppuType( & xListener ), xListener );\n    --m_nAddedListenerCount;\n    if( m_nAddedListenerCount == 0 )\n        stopListening();\n}\n\n\/\/ ____ XSelectionChangeListener ____\nvoid SAL_CALL RangeHighlighter::selectionChanged( const lang::EventObject& \/*aEvent*\/ )\n    throw (uno::RuntimeException)\n{\n    determineRanges();\n\n    \/\/ determine ranges of selected view objects\n    \/\/ if changed, fire an event\n    fireSelectionEvent();\n}\n\nvoid RangeHighlighter::fireSelectionEvent()\n{\n    ::cppu::OInterfaceContainerHelper* pIC = rBHelper.getContainer(\n        ::getCppuType((const uno::Reference< view::XSelectionChangeListener >*)0) );\n    if( pIC )\n    {\n        lang::EventObject aEvent( static_cast< lang::XComponent* >( this ) );\n        ::cppu::OInterfaceIteratorHelper aIt( *pIC );\n        while( aIt.hasMoreElements() )\n            (static_cast< view::XSelectionChangeListener*>(aIt.next()))->selectionChanged( aEvent );\n    }\n}\n\nvoid SAL_CALL RangeHighlighter::disposing( const lang::EventObject& Source )\n    throw (uno::RuntimeException)\n{\n    if( Source.Source == m_xSelectionSupplier )\n    {\n        m_xSelectionSupplier.clear();\n        m_aSelectedRanges.realloc( 0 );\n        fireSelectionEvent();\n    }\n}\n\nvoid RangeHighlighter::startListening()\n{\n    if( m_xSelectionSupplier.is())\n    {\n        if( ! m_xListener.is())\n        {\n            m_xListener.set( new WeakSelectionChangeListenerAdapter( this ));\n            determineRanges();\n        }\n        m_xSelectionSupplier->addSelectionChangeListener( m_xListener );\n    }\n}\n\nvoid RangeHighlighter::stopListening()\n{\n    if( m_xSelectionSupplier.is() && m_xListener.is())\n    {\n        m_xSelectionSupplier->removeSelectionChangeListener( m_xListener );\n        m_xListener.clear();\n    }\n}\n\n\n\/\/ ____ WeakComponentImplHelperBase ____\n\/\/ is called when dispose() is called at this component\nvoid SAL_CALL RangeHighlighter::disposing()\n{\n    \/\/ @todo: remove listener. Currently the controller shows an assertion\n    \/\/ because it is already disposed\n\/\/     stopListening();\n    m_xListener.clear();\n    m_xSelectionSupplier.clear();\n    m_nAddedListenerCount =  0;\n    m_aSelectedRanges.realloc( 0 );\n}\n\n} \/\/  namespace chart\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\/**\n * @author Marek Kotewicz <marek@ethdev.com>\n * @date 2014\n * Unit tests for the solidity compiler JSON Interface output.\n *\/\n\n#include <boost\/test\/unit_test.hpp>\n#include <libsolidity\/CompilerStack.h>\n#include <jsoncpp\/json\/json.h>\n#include <libdevcore\/Exceptions.h>\n\nnamespace dev\n{\nnamespace solidity\n{\nnamespace test\n{\n\nclass InterfaceChecker\n{\npublic:\n\tInterfaceChecker(): m_compilerStack(false) {}\n\n\tvoid checkInterface(std::string const& _code, std::string const& _expectedInterfaceString)\n\t{\n\t\ttry\n\t\t{\n\t\t\tm_compilerStack.parse(_code);\n\t\t}\n\t\tcatch(boost::exception const& _e)\n\t\t{\n\t\t\tauto msg = std::string(\"Parsing contract failed with: \") + boost::diagnostic_information(_e);\n\t\t\tBOOST_FAIL(msg);\n\t\t}\n\t\tstd::string generatedInterfaceString = m_compilerStack.getMetadata(\"\", DocumentationType::ABI_INTERFACE);\n\t\tJson::Value generatedInterface;\n\t\tm_reader.parse(generatedInterfaceString, generatedInterface);\n\t\tJson::Value expectedInterface;\n\t\tm_reader.parse(_expectedInterfaceString, expectedInterface);\n\t\tBOOST_CHECK_MESSAGE(expectedInterface == generatedInterface,\n\t\t\t\t\t\t\t\"Expected \" << _expectedInterfaceString <<\n\t\t\t\t\t\t\t\"\\n but got:\\n\" << generatedInterfaceString);\n\t}\n\nprivate:\n\tCompilerStack m_compilerStack;\n\tJson::Reader m_reader;\n};\n\nBOOST_FIXTURE_TEST_SUITE(SolidityABIJSON, InterfaceChecker)\n\nBOOST_AUTO_TEST_CASE(basic_test)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function f(uint a) returns(uint d) { return a * 7; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"f\",\n\t\t\"constant\": false,\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(empty_contract)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = \"[]\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(multiple_methods)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function f(uint a) returns(uint d) { return a * 7; }\\n\"\n\t\"  function g(uint b) returns(uint e) { return b * 8; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"f\",\n\t\t\"constant\": false,\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t},\n\t{\n\t\t\"name\": \"g\",\n\t\t\"constant\": false,\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"e\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(multiple_params)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function f(uint a, uint b) returns(uint d) { return a + b; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"f\",\n\t\t\"constant\": false,\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t},\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(multiple_methods_order)\n{\n\t\/\/ methods are expected to be in alpabetical order\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function f(uint a) returns(uint d) { return a * 7; }\\n\"\n\t\"  function c(uint b) returns(uint e) { return b * 8; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"c\",\n\t\t\"constant\": false,\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"e\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t},\n\t{\n\t\t\"name\": \"f\",\n\t\t\"constant\": false,\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(const_function)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function foo(uint a, uint b) returns(uint d) { return a + b; }\\n\"\n\t\"  function boo(uint32 a) constant returns(uint b) { return a * 4; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"foo\",\n\t\t\"constant\": false,\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t},\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t},\n\t{\n\t\t\"name\": \"boo\",\n\t\t\"constant\": true,\n\t\t\"inputs\": [{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint32\"\n\t\t}],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(exclude_fallback_function)\n{\n\tchar const* sourceCode = \"contract test { function() {} }\";\n\n\tchar const* interface = \"[]\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n}\n}\n}\n<commit_msg>updated json abi tests<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\/**\n * @author Marek Kotewicz <marek@ethdev.com>\n * @date 2014\n * Unit tests for the solidity compiler JSON Interface output.\n *\/\n\n#include <boost\/test\/unit_test.hpp>\n#include <libsolidity\/CompilerStack.h>\n#include <jsoncpp\/json\/json.h>\n#include <libdevcore\/Exceptions.h>\n\nnamespace dev\n{\nnamespace solidity\n{\nnamespace test\n{\n\nclass InterfaceChecker\n{\npublic:\n\tInterfaceChecker(): m_compilerStack(false) {}\n\n\tvoid checkInterface(std::string const& _code, std::string const& _expectedInterfaceString)\n\t{\n\t\ttry\n\t\t{\n\t\t\tm_compilerStack.parse(_code);\n\t\t}\n\t\tcatch(boost::exception const& _e)\n\t\t{\n\t\t\tauto msg = std::string(\"Parsing contract failed with: \") + boost::diagnostic_information(_e);\n\t\t\tBOOST_FAIL(msg);\n\t\t}\n\t\tstd::string generatedInterfaceString = m_compilerStack.getMetadata(\"\", DocumentationType::ABI_INTERFACE);\n\t\tJson::Value generatedInterface;\n\t\tm_reader.parse(generatedInterfaceString, generatedInterface);\n\t\tJson::Value expectedInterface;\n\t\tm_reader.parse(_expectedInterfaceString, expectedInterface);\n\t\tBOOST_CHECK_MESSAGE(expectedInterface == generatedInterface,\n\t\t\t\t\t\t\t\"Expected \" << _expectedInterfaceString <<\n\t\t\t\t\t\t\t\"\\n but got:\\n\" << generatedInterfaceString);\n\t}\n\nprivate:\n\tCompilerStack m_compilerStack;\n\tJson::Reader m_reader;\n};\n\nBOOST_FIXTURE_TEST_SUITE(SolidityABIJSON, InterfaceChecker)\n\nBOOST_AUTO_TEST_CASE(basic_test)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function f(uint a) returns(uint d) { return a * 7; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"f\",\n\t\t\"constant\": false,\n\t\t\"type\": \"function\",\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(empty_contract)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = \"[]\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(multiple_methods)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function f(uint a) returns(uint d) { return a * 7; }\\n\"\n\t\"  function g(uint b) returns(uint e) { return b * 8; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"f\",\n\t\t\"constant\": false,\n\t\t\"type\": \"function\",\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t},\n\t{\n\t\t\"name\": \"g\",\n\t\t\"constant\": false,\n\t\t\"type\": \"function\",\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"e\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(multiple_params)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function f(uint a, uint b) returns(uint d) { return a + b; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"f\",\n\t\t\"constant\": false,\n\t\t\"type\": \"function\",\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t},\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(multiple_methods_order)\n{\n\t\/\/ methods are expected to be in alpabetical order\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function f(uint a) returns(uint d) { return a * 7; }\\n\"\n\t\"  function c(uint b) returns(uint e) { return b * 8; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"c\",\n\t\t\"constant\": false,\n\t\t\"type\": \"function\",\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"e\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t},\n\t{\n\t\t\"name\": \"f\",\n\t\t\"constant\": false,\n\t\t\"type\": \"function\",\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(const_function)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\"  function foo(uint a, uint b) returns(uint d) { return a + b; }\\n\"\n\t\"  function boo(uint32 a) constant returns(uint b) { return a * 4; }\\n\"\n\t\"}\\n\";\n\n\tchar const* interface = R\"([\n\t{\n\t\t\"name\": \"foo\",\n\t\t\"constant\": false,\n\t\t\"type\": \"function\",\n\t\t\"inputs\": [\n\t\t{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint256\"\n\t\t},\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"d\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t},\n\t{\n\t\t\"name\": \"boo\",\n\t\t\"constant\": true,\n\t\t\"type\": \"function\",\n\t\t\"inputs\": [{\n\t\t\t\"name\": \"a\",\n\t\t\t\"type\": \"uint32\"\n\t\t}],\n\t\t\"outputs\": [\n\t\t{\n\t\t\t\"name\": \"b\",\n\t\t\t\"type\": \"uint256\"\n\t\t}\n\t\t]\n\t}\n\t])\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_CASE(exclude_fallback_function)\n{\n\tchar const* sourceCode = \"contract test { function() {} }\";\n\n\tchar const* interface = \"[]\";\n\n\tcheckInterface(sourceCode, interface);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\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 \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/snapshot_tab_helper.h\"\n#include \"chrome\/browser\/ui\/tab_contents\/tab_contents_wrapper.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/public\/browser\/navigation_controller.h\"\n#include \"content\/public\/browser\/notification_observer.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"net\/test\/test_server.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"ui\/base\/clipboard\/clipboard.h\"\n#include \"ui\/gfx\/codec\/png_codec.h\"\n#include \"ui\/gfx\/screen.h\"\n\nusing content::NavigationController;\nusing content::WebContents;\n\nnamespace {\n\n\/\/ Include things like browser frame and scrollbar and make sure we're bigger\n\/\/ than the test pdf document.\nstatic const int kBrowserWidth = 1000;\nstatic const int kBrowserHeight = 600;\n\nclass PDFBrowserTest : public InProcessBrowserTest,\n                       public content::NotificationObserver {\n public:\n  PDFBrowserTest()\n      : snapshot_different_(true),\n        next_dummy_search_value_(0),\n        load_stop_notification_count_(0) {\n    EnableDOMAutomation();\n\n    pdf_test_server_.reset(new net::TestServer(\n        net::TestServer::TYPE_HTTP,\n        net::TestServer::kLocalhost,\n        FilePath(FILE_PATH_LITERAL(\"pdf\/test\"))));\n  }\n\n protected:\n  \/\/ Use our own TestServer so that we can serve files from the pdf directory.\n  net::TestServer* pdf_test_server() { return pdf_test_server_.get(); }\n\n  int load_stop_notification_count() const {\n    return load_stop_notification_count_;\n  }\n\n  FilePath GetPDFTestDir() {\n    return FilePath(FilePath::kCurrentDirectory).AppendASCII(\"..\").\n        AppendASCII(\"..\").AppendASCII(\"..\").AppendASCII(\"pdf\").\n        AppendASCII(\"test\");\n  }\n\n  void Load() {\n    \/\/ Make sure to set the window size before rendering, as otherwise rendering\n    \/\/ to a smaller window and then expanding leads to slight anti-aliasing\n    \/\/ differences of the text and the pixel comparison fails.\n    gfx::Rect bounds(gfx::Rect(0, 0, kBrowserWidth, kBrowserHeight));\n    gfx::Rect screen_bounds = gfx::Screen::GetPrimaryMonitorBounds();\n    ASSERT_GT(screen_bounds.width(), kBrowserWidth);\n    ASSERT_GT(screen_bounds.height(), kBrowserHeight);\n    browser()->window()->SetBounds(bounds);\n\n    GURL url(ui_test_utils::GetTestUrl(\n        GetPDFTestDir(),\n        FilePath(FILE_PATH_LITERAL(\"pdf_browsertest.pdf\"))));\n    ui_test_utils::NavigateToURL(browser(), url);\n  }\n\n  void VerifySnapshot(const std::string& expected_filename) {\n    snapshot_different_ = true;\n    expected_filename_ = expected_filename;\n    TabContentsWrapper* wrapper =  browser()->GetSelectedTabContentsWrapper();\n    wrapper->snapshot_tab_helper()->CaptureSnapshot();\n    ui_test_utils::RegisterAndWait(\n        this,\n        chrome::NOTIFICATION_TAB_SNAPSHOT_TAKEN,\n        content::Source<WebContents>(wrapper->web_contents()));\n    ASSERT_FALSE(snapshot_different_) << \"Rendering didn't match, see result \"\n        \"at \" << snapshot_filename_.value().c_str();\n  }\n\n  void WaitForResponse() {\n    \/\/ Even if the plugin has loaded the data or scrolled, because of how\n    \/\/ pepper painting works, we might not have the data.  One way to force this\n    \/\/ to be flushed is to do a find operation, since on this two-page test\n    \/\/ document, it'll wait for us to flush the renderer message loop twice and\n    \/\/ also the browser's once, at which point we're guaranteed to have updated\n    \/\/ the backingstore.  Hacky, but it works.\n    \/\/ Note that we need to change the text each time, because if we don't the\n    \/\/ renderer code will think the second message is to go to next result, but\n    \/\/ there are none so the plugin will assert.\n\n    string16 query = UTF8ToUTF16(\n        std::string(\"xyzxyz\" + base::IntToString(next_dummy_search_value_++)));\n    ASSERT_EQ(0, ui_test_utils::FindInPage(\n        browser()->GetSelectedTabContentsWrapper(), query, true, false, NULL));\n  }\n\n private:\n  \/\/ content::NotificationObserver\n  virtual void Observe(int type,\n                       const content::NotificationSource& source,\n                       const content::NotificationDetails& details) {\n    if (type == chrome::NOTIFICATION_TAB_SNAPSHOT_TAKEN) {\n      MessageLoopForUI::current()->Quit();\n      FilePath reference = ui_test_utils::GetTestFilePath(\n          GetPDFTestDir(),\n          FilePath().AppendASCII(expected_filename_));\n      base::PlatformFileInfo info;\n      ASSERT_TRUE(file_util::GetFileInfo(reference, &info));\n      int size = static_cast<size_t>(info.size);\n      scoped_array<char> data(new char[size]);\n      ASSERT_EQ(size, file_util::ReadFile(reference, data.get(), size));\n\n      int w, h;\n      std::vector<unsigned char> decoded;\n      ASSERT_TRUE(gfx::PNGCodec::Decode(\n          reinterpret_cast<unsigned char*>(data.get()), size,\n          gfx::PNGCodec::FORMAT_BGRA, &decoded, &w, &h));\n      int32* ref_pixels = reinterpret_cast<int32*>(&decoded[0]);\n\n      const SkBitmap* bitmap = content::Details<const SkBitmap>(details).ptr();\n      int32* pixels = static_cast<int32*>(bitmap->getPixels());\n\n      \/\/ Get the background color, and use it to figure out the x-offsets in\n      \/\/ each image.  The reason is that depending on the theme in the OS, the\n      \/\/ same browser width can lead to slightly different plugin sizes, so the\n      \/\/ pdf content will start at different x offsets.\n      \/\/ Also note that the images we saved are cut off before the scrollbar, as\n      \/\/ that'll change depending on the theme, and also cut off vertically so\n      \/\/ that the ui controls don't show up, as those fade-in and so the timing\n      \/\/ will affect their transparency.\n      int32 bg_color = ref_pixels[0];\n      int ref_x_offset, snapshot_x_offset;\n      for (ref_x_offset = 0; ref_x_offset < w; ++ref_x_offset) {\n        if (ref_pixels[ref_x_offset] != bg_color)\n          break;\n      }\n\n      for (snapshot_x_offset = 0; snapshot_x_offset < bitmap->width();\n           ++snapshot_x_offset) {\n        if (pixels[snapshot_x_offset] != bg_color)\n          break;\n      }\n\n      int x_max = std::min(\n          w - ref_x_offset, bitmap->width() - snapshot_x_offset);\n      int y_max = std::min(h, bitmap->height());\n      int stride = bitmap->rowBytes();\n      snapshot_different_ = false;\n      for (int y = 0; y < y_max && !snapshot_different_; ++y) {\n        for (int x = 0; x < x_max && !snapshot_different_; ++x) {\n          if (pixels[y * stride \/ sizeof(int32) + x + snapshot_x_offset] !=\n              ref_pixels[y * w + x + ref_x_offset])\n            snapshot_different_ = true;\n        }\n      }\n\n      if (snapshot_different_) {\n        std::vector<unsigned char> png_data;\n        gfx::PNGCodec::EncodeBGRASkBitmap(*bitmap, false, &png_data);\n        if (file_util::CreateTemporaryFile(&snapshot_filename_)) {\n          file_util::WriteFile(snapshot_filename_,\n              reinterpret_cast<char*>(&png_data[0]), png_data.size());\n        }\n      }\n    } else if (type == content::NOTIFICATION_LOAD_STOP) {\n      load_stop_notification_count_++;\n    }\n  }\n\n  \/\/ True if the snapshot differed from the expected value.\n  bool snapshot_different_;\n  \/\/ Internal variable used to synchronize to the renderer.\n  int next_dummy_search_value_;\n  \/\/ The filename of the bitmap to compare the snapshot to.\n  std::string expected_filename_;\n  \/\/ If the snapshot is different, holds the location where it's saved.\n  FilePath snapshot_filename_;\n  \/\/ How many times we've seen chrome::LOAD_STOP.\n  int load_stop_notification_count_;\n\n  scoped_ptr<net::TestServer> pdf_test_server_;\n};\n\n#if defined(OS_CHROMEOS)\n\/\/ TODO(sanjeevr): http:\/\/crbug.com\/79837\n#define MAYBE_Basic DISABLED_Basic\n#else\n#define MAYBE_Basic Basic\n#endif\n\/\/ Tests basic PDF rendering.  This can be broken depending on bad merges with\n\/\/ the vendor, so it's important that we have basic sanity checking.\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, MAYBE_Basic) {\n  ASSERT_NO_FATAL_FAILURE(Load());\n  ASSERT_NO_FATAL_FAILURE(WaitForResponse());\n  \/\/ OS X uses CoreText, and FreeType renders slightly different on Linux and\n  \/\/ Win.\n#if defined(OS_MACOSX)\n  std::string expectation_file = \"pdf_browsertest_mac.png\";\n#elif defined(OS_LINUX)\n  std::string expectation_file = \"pdf_browsertest_linux.png\";\n#else\n  std::string expectation_file = \"pdf_browsertest.png\";\n#endif\n  ASSERT_NO_FATAL_FAILURE(VerifySnapshot(expectation_file));\n}\n\n#if defined(OS_CHROMEOS)\n\/\/ TODO(sanjeevr): http:\/\/crbug.com\/79837\n#define MAYBE_Scroll DISABLED_Scroll\n#else\n#define MAYBE_Scroll Scroll\n#endif\n\/\/ Tests that scrolling works.\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, MAYBE_Scroll) {\n  ASSERT_NO_FATAL_FAILURE(Load());\n\n  \/\/ We use wheel mouse event since that's the only one we can easily push to\n  \/\/ the renderer.  There's no way to push a cross-platform keyboard event at\n  \/\/ the moment.\n  WebKit::WebMouseWheelEvent wheel_event;\n  wheel_event.type = WebKit::WebInputEvent::MouseWheel;\n  wheel_event.deltaY = -200;\n  wheel_event.wheelTicksY = -2;\n  WebContents* web_contents = browser()->GetSelectedWebContents();\n  web_contents->GetRenderViewHost()->ForwardWheelEvent(wheel_event);\n  ASSERT_NO_FATAL_FAILURE(WaitForResponse());\n\n  int y_offset = 0;\n  ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractInt(\n      browser()->GetSelectedWebContents()->GetRenderViewHost(),\n      std::wstring(),\n      L\"window.domAutomationController.send(plugin.pageYOffset())\",\n      &y_offset));\n  ASSERT_GT(y_offset, 0);\n}\n\n#if defined(OS_CHROMEOS)\n\/\/ TODO(sanjeevr): http:\/\/crbug.com\/79837\n#define MAYBE_FindAndCopy DISABLED_FindAndCopy\n#else\n#define MAYBE_FindAndCopy FindAndCopy\n#endif\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, MAYBE_FindAndCopy) {\n  ASSERT_NO_FATAL_FAILURE(Load());\n  \/\/ Verifies that find in page works.\n  ASSERT_EQ(3, ui_test_utils::FindInPage(\n      browser()->GetSelectedTabContentsWrapper(), UTF8ToUTF16(\"adipiscing\"),\n      true, false, NULL));\n\n  \/\/ Verify that copying selected text works.\n  ui::Clipboard clipboard;\n  \/\/ Reset the clipboard first.\n  ui::Clipboard::ObjectMap objects;\n  ui::Clipboard::ObjectMapParams params;\n  params.push_back(std::vector<char>());\n  objects[ui::Clipboard::CBF_TEXT] = params;\n  clipboard.WriteObjects(ui::Clipboard::BUFFER_STANDARD, objects);\n\n  browser()->GetSelectedWebContents()->GetRenderViewHost()->Copy();\n  ASSERT_NO_FATAL_FAILURE(WaitForResponse());\n\n  std::string text;\n  clipboard.ReadAsciiText(ui::Clipboard::BUFFER_STANDARD, &text);\n  ASSERT_EQ(\"adipiscing\", text);\n}\n\n\/\/ Tests that loading async pdfs works correctly (i.e. document fully loads).\n\/\/ This also loads all documents that used to crash, to ensure we don't have\n\/\/ regressions.\n\/\/ Flaky as per http:\/\/crbug.com\/74548.\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, DISABLED_SLOW_Loading) {\n  ASSERT_TRUE(pdf_test_server()->Start());\n\n  NavigationController* controller =\n      &(browser()->GetSelectedWebContents()->GetController());\n  content::NotificationRegistrar registrar;\n  registrar.Add(this,\n                content::NOTIFICATION_LOAD_STOP,\n                content::Source<NavigationController>(controller));\n  std::string base_url = std::string(\"files\/\");\n\n  file_util::FileEnumerator file_enumerator(\n      ui_test_utils::GetTestFilePath(GetPDFTestDir(), FilePath()),\n      false,\n      file_util::FileEnumerator::FILES,\n      FILE_PATH_LITERAL(\"*.pdf\"));\n  for (FilePath file_path = file_enumerator.Next();\n       !file_path.empty();\n       file_path = file_enumerator.Next()) {\n    std::string filename = file_path.BaseName().MaybeAsASCII();\n    ASSERT_FALSE(filename.empty());\n\n#if defined(OS_POSIX)\n    if (filename == \"sample.pdf\")\n      continue;  \/\/ Crashes on Mac and Linux.  http:\/\/crbug.com\/63549\n#endif\n\n    LOG(WARNING) << \"PDFBrowserTest.Loading: \" << filename;\n\n    GURL url = pdf_test_server()->GetURL(base_url + filename);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    while (true) {\n      int last_count = load_stop_notification_count();\n      \/\/ We might get extraneous chrome::LOAD_STOP notifications when\n      \/\/ doing async loading.  This happens when the first loader is cancelled\n      \/\/ and before creating a byte-range request loader.\n      bool complete = false;\n      ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n          browser()->GetSelectedWebContents()->GetRenderViewHost(),\n          std::wstring(),\n          L\"window.domAutomationController.send(plugin.documentLoadComplete())\",\n          &complete));\n      if (complete)\n        break;\n\n      \/\/ Check if the LOAD_STOP notification could have come while we run a\n      \/\/ nested message loop for the JS call.\n      if (last_count != load_stop_notification_count())\n        continue;\n      ui_test_utils::WaitForLoadStop(browser()->GetSelectedWebContents());\n    }\n  }\n}\n\n\/\/ Flaky as per http:\/\/crbug.com\/74549.\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, DISABLED_OnLoadAndReload) {\n  ASSERT_TRUE(pdf_test_server()->Start());\n\n  GURL url = pdf_test_server()->GetURL(\"files\/onload_reload.html\");\n  ui_test_utils::NavigateToURL(browser(), url);\n\n  ui_test_utils::WindowedNotificationObserver observer(\n      content::NOTIFICATION_LOAD_STOP,\n      content::Source<NavigationController>(\n          &browser()->GetSelectedWebContents()->GetController()));\n  ASSERT_TRUE(ui_test_utils::ExecuteJavaScript(\n      browser()->GetSelectedWebContents()->GetRenderViewHost(),\n      std::wstring(),\n      L\"reloadPDF();\"));\n  observer.Wait();\n\n  ASSERT_EQ(\"success\", browser()->GetSelectedWebContents()->GetURL().query());\n}\n\n}  \/\/ namespace\n<commit_msg>Renable PDFBrowserTest.SLOW_Loading. See bug for more details.<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 \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/snapshot_tab_helper.h\"\n#include \"chrome\/browser\/ui\/tab_contents\/tab_contents_wrapper.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/public\/browser\/navigation_controller.h\"\n#include \"content\/public\/browser\/notification_observer.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"net\/test\/test_server.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"ui\/base\/clipboard\/clipboard.h\"\n#include \"ui\/gfx\/codec\/png_codec.h\"\n#include \"ui\/gfx\/screen.h\"\n\nusing content::NavigationController;\nusing content::WebContents;\n\nnamespace {\n\n\/\/ Include things like browser frame and scrollbar and make sure we're bigger\n\/\/ than the test pdf document.\nstatic const int kBrowserWidth = 1000;\nstatic const int kBrowserHeight = 600;\n\nclass PDFBrowserTest : public InProcessBrowserTest,\n                       public content::NotificationObserver {\n public:\n  PDFBrowserTest()\n      : snapshot_different_(true),\n        next_dummy_search_value_(0),\n        load_stop_notification_count_(0) {\n    EnableDOMAutomation();\n\n    pdf_test_server_.reset(new net::TestServer(\n        net::TestServer::TYPE_HTTP,\n        net::TestServer::kLocalhost,\n        FilePath(FILE_PATH_LITERAL(\"pdf\/test\"))));\n  }\n\n protected:\n  \/\/ Use our own TestServer so that we can serve files from the pdf directory.\n  net::TestServer* pdf_test_server() { return pdf_test_server_.get(); }\n\n  int load_stop_notification_count() const {\n    return load_stop_notification_count_;\n  }\n\n  FilePath GetPDFTestDir() {\n    return FilePath(FilePath::kCurrentDirectory).AppendASCII(\"..\").\n        AppendASCII(\"..\").AppendASCII(\"..\").AppendASCII(\"pdf\").\n        AppendASCII(\"test\");\n  }\n\n  void Load() {\n    \/\/ Make sure to set the window size before rendering, as otherwise rendering\n    \/\/ to a smaller window and then expanding leads to slight anti-aliasing\n    \/\/ differences of the text and the pixel comparison fails.\n    gfx::Rect bounds(gfx::Rect(0, 0, kBrowserWidth, kBrowserHeight));\n    gfx::Rect screen_bounds = gfx::Screen::GetPrimaryMonitorBounds();\n    ASSERT_GT(screen_bounds.width(), kBrowserWidth);\n    ASSERT_GT(screen_bounds.height(), kBrowserHeight);\n    browser()->window()->SetBounds(bounds);\n\n    GURL url(ui_test_utils::GetTestUrl(\n        GetPDFTestDir(),\n        FilePath(FILE_PATH_LITERAL(\"pdf_browsertest.pdf\"))));\n    ui_test_utils::NavigateToURL(browser(), url);\n  }\n\n  void VerifySnapshot(const std::string& expected_filename) {\n    snapshot_different_ = true;\n    expected_filename_ = expected_filename;\n    TabContentsWrapper* wrapper =  browser()->GetSelectedTabContentsWrapper();\n    wrapper->snapshot_tab_helper()->CaptureSnapshot();\n    ui_test_utils::RegisterAndWait(\n        this,\n        chrome::NOTIFICATION_TAB_SNAPSHOT_TAKEN,\n        content::Source<WebContents>(wrapper->web_contents()));\n    ASSERT_FALSE(snapshot_different_) << \"Rendering didn't match, see result \"\n        \"at \" << snapshot_filename_.value().c_str();\n  }\n\n  void WaitForResponse() {\n    \/\/ Even if the plugin has loaded the data or scrolled, because of how\n    \/\/ pepper painting works, we might not have the data.  One way to force this\n    \/\/ to be flushed is to do a find operation, since on this two-page test\n    \/\/ document, it'll wait for us to flush the renderer message loop twice and\n    \/\/ also the browser's once, at which point we're guaranteed to have updated\n    \/\/ the backingstore.  Hacky, but it works.\n    \/\/ Note that we need to change the text each time, because if we don't the\n    \/\/ renderer code will think the second message is to go to next result, but\n    \/\/ there are none so the plugin will assert.\n\n    string16 query = UTF8ToUTF16(\n        std::string(\"xyzxyz\" + base::IntToString(next_dummy_search_value_++)));\n    ASSERT_EQ(0, ui_test_utils::FindInPage(\n        browser()->GetSelectedTabContentsWrapper(), query, true, false, NULL));\n  }\n\n private:\n  \/\/ content::NotificationObserver\n  virtual void Observe(int type,\n                       const content::NotificationSource& source,\n                       const content::NotificationDetails& details) {\n    if (type == chrome::NOTIFICATION_TAB_SNAPSHOT_TAKEN) {\n      MessageLoopForUI::current()->Quit();\n      FilePath reference = ui_test_utils::GetTestFilePath(\n          GetPDFTestDir(),\n          FilePath().AppendASCII(expected_filename_));\n      base::PlatformFileInfo info;\n      ASSERT_TRUE(file_util::GetFileInfo(reference, &info));\n      int size = static_cast<size_t>(info.size);\n      scoped_array<char> data(new char[size]);\n      ASSERT_EQ(size, file_util::ReadFile(reference, data.get(), size));\n\n      int w, h;\n      std::vector<unsigned char> decoded;\n      ASSERT_TRUE(gfx::PNGCodec::Decode(\n          reinterpret_cast<unsigned char*>(data.get()), size,\n          gfx::PNGCodec::FORMAT_BGRA, &decoded, &w, &h));\n      int32* ref_pixels = reinterpret_cast<int32*>(&decoded[0]);\n\n      const SkBitmap* bitmap = content::Details<const SkBitmap>(details).ptr();\n      int32* pixels = static_cast<int32*>(bitmap->getPixels());\n\n      \/\/ Get the background color, and use it to figure out the x-offsets in\n      \/\/ each image.  The reason is that depending on the theme in the OS, the\n      \/\/ same browser width can lead to slightly different plugin sizes, so the\n      \/\/ pdf content will start at different x offsets.\n      \/\/ Also note that the images we saved are cut off before the scrollbar, as\n      \/\/ that'll change depending on the theme, and also cut off vertically so\n      \/\/ that the ui controls don't show up, as those fade-in and so the timing\n      \/\/ will affect their transparency.\n      int32 bg_color = ref_pixels[0];\n      int ref_x_offset, snapshot_x_offset;\n      for (ref_x_offset = 0; ref_x_offset < w; ++ref_x_offset) {\n        if (ref_pixels[ref_x_offset] != bg_color)\n          break;\n      }\n\n      for (snapshot_x_offset = 0; snapshot_x_offset < bitmap->width();\n           ++snapshot_x_offset) {\n        if (pixels[snapshot_x_offset] != bg_color)\n          break;\n      }\n\n      int x_max = std::min(\n          w - ref_x_offset, bitmap->width() - snapshot_x_offset);\n      int y_max = std::min(h, bitmap->height());\n      int stride = bitmap->rowBytes();\n      snapshot_different_ = false;\n      for (int y = 0; y < y_max && !snapshot_different_; ++y) {\n        for (int x = 0; x < x_max && !snapshot_different_; ++x) {\n          if (pixels[y * stride \/ sizeof(int32) + x + snapshot_x_offset] !=\n              ref_pixels[y * w + x + ref_x_offset])\n            snapshot_different_ = true;\n        }\n      }\n\n      if (snapshot_different_) {\n        std::vector<unsigned char> png_data;\n        gfx::PNGCodec::EncodeBGRASkBitmap(*bitmap, false, &png_data);\n        if (file_util::CreateTemporaryFile(&snapshot_filename_)) {\n          file_util::WriteFile(snapshot_filename_,\n              reinterpret_cast<char*>(&png_data[0]), png_data.size());\n        }\n      }\n    } else if (type == content::NOTIFICATION_LOAD_STOP) {\n      load_stop_notification_count_++;\n    }\n  }\n\n  \/\/ True if the snapshot differed from the expected value.\n  bool snapshot_different_;\n  \/\/ Internal variable used to synchronize to the renderer.\n  int next_dummy_search_value_;\n  \/\/ The filename of the bitmap to compare the snapshot to.\n  std::string expected_filename_;\n  \/\/ If the snapshot is different, holds the location where it's saved.\n  FilePath snapshot_filename_;\n  \/\/ How many times we've seen chrome::LOAD_STOP.\n  int load_stop_notification_count_;\n\n  scoped_ptr<net::TestServer> pdf_test_server_;\n};\n\n#if defined(OS_CHROMEOS)\n\/\/ TODO(sanjeevr): http:\/\/crbug.com\/79837\n#define MAYBE_Basic DISABLED_Basic\n#else\n#define MAYBE_Basic Basic\n#endif\n\/\/ Tests basic PDF rendering.  This can be broken depending on bad merges with\n\/\/ the vendor, so it's important that we have basic sanity checking.\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, MAYBE_Basic) {\n  ASSERT_NO_FATAL_FAILURE(Load());\n  ASSERT_NO_FATAL_FAILURE(WaitForResponse());\n  \/\/ OS X uses CoreText, and FreeType renders slightly different on Linux and\n  \/\/ Win.\n#if defined(OS_MACOSX)\n  std::string expectation_file = \"pdf_browsertest_mac.png\";\n#elif defined(OS_LINUX)\n  std::string expectation_file = \"pdf_browsertest_linux.png\";\n#else\n  std::string expectation_file = \"pdf_browsertest.png\";\n#endif\n  ASSERT_NO_FATAL_FAILURE(VerifySnapshot(expectation_file));\n}\n\n#if defined(OS_CHROMEOS)\n\/\/ TODO(sanjeevr): http:\/\/crbug.com\/79837\n#define MAYBE_Scroll DISABLED_Scroll\n#else\n#define MAYBE_Scroll Scroll\n#endif\n\/\/ Tests that scrolling works.\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, MAYBE_Scroll) {\n  ASSERT_NO_FATAL_FAILURE(Load());\n\n  \/\/ We use wheel mouse event since that's the only one we can easily push to\n  \/\/ the renderer.  There's no way to push a cross-platform keyboard event at\n  \/\/ the moment.\n  WebKit::WebMouseWheelEvent wheel_event;\n  wheel_event.type = WebKit::WebInputEvent::MouseWheel;\n  wheel_event.deltaY = -200;\n  wheel_event.wheelTicksY = -2;\n  WebContents* web_contents = browser()->GetSelectedWebContents();\n  web_contents->GetRenderViewHost()->ForwardWheelEvent(wheel_event);\n  ASSERT_NO_FATAL_FAILURE(WaitForResponse());\n\n  int y_offset = 0;\n  ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractInt(\n      browser()->GetSelectedWebContents()->GetRenderViewHost(),\n      std::wstring(),\n      L\"window.domAutomationController.send(plugin.pageYOffset())\",\n      &y_offset));\n  ASSERT_GT(y_offset, 0);\n}\n\n#if defined(OS_CHROMEOS)\n\/\/ TODO(sanjeevr): http:\/\/crbug.com\/79837\n#define MAYBE_FindAndCopy DISABLED_FindAndCopy\n#else\n#define MAYBE_FindAndCopy FindAndCopy\n#endif\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, MAYBE_FindAndCopy) {\n  ASSERT_NO_FATAL_FAILURE(Load());\n  \/\/ Verifies that find in page works.\n  ASSERT_EQ(3, ui_test_utils::FindInPage(\n      browser()->GetSelectedTabContentsWrapper(), UTF8ToUTF16(\"adipiscing\"),\n      true, false, NULL));\n\n  \/\/ Verify that copying selected text works.\n  ui::Clipboard clipboard;\n  \/\/ Reset the clipboard first.\n  ui::Clipboard::ObjectMap objects;\n  ui::Clipboard::ObjectMapParams params;\n  params.push_back(std::vector<char>());\n  objects[ui::Clipboard::CBF_TEXT] = params;\n  clipboard.WriteObjects(ui::Clipboard::BUFFER_STANDARD, objects);\n\n  browser()->GetSelectedWebContents()->GetRenderViewHost()->Copy();\n  ASSERT_NO_FATAL_FAILURE(WaitForResponse());\n\n  std::string text;\n  clipboard.ReadAsciiText(ui::Clipboard::BUFFER_STANDARD, &text);\n  ASSERT_EQ(\"adipiscing\", text);\n}\n\n\/\/ Tests that loading async pdfs works correctly (i.e. document fully loads).\n\/\/ This also loads all documents that used to crash, to ensure we don't have\n\/\/ regressions.\n\/\/ If it flakes, reopen http:\/\/crbug.com\/74548.\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, SLOW_Loading) {\n  ASSERT_TRUE(pdf_test_server()->Start());\n\n  NavigationController* controller =\n      &(browser()->GetSelectedWebContents()->GetController());\n  content::NotificationRegistrar registrar;\n  registrar.Add(this,\n                content::NOTIFICATION_LOAD_STOP,\n                content::Source<NavigationController>(controller));\n  std::string base_url = std::string(\"files\/\");\n\n  file_util::FileEnumerator file_enumerator(\n      ui_test_utils::GetTestFilePath(GetPDFTestDir(), FilePath()),\n      false,\n      file_util::FileEnumerator::FILES,\n      FILE_PATH_LITERAL(\"*.pdf\"));\n  for (FilePath file_path = file_enumerator.Next();\n       !file_path.empty();\n       file_path = file_enumerator.Next()) {\n    std::string filename = file_path.BaseName().MaybeAsASCII();\n    ASSERT_FALSE(filename.empty());\n\n#if defined(OS_POSIX)\n    if (filename == \"sample.pdf\")\n      continue;  \/\/ Crashes on Mac and Linux.  http:\/\/crbug.com\/63549\n#endif\n\n    LOG(WARNING) << \"PDFBrowserTest.Loading: \" << filename;\n\n    GURL url = pdf_test_server()->GetURL(base_url + filename);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    while (true) {\n      int last_count = load_stop_notification_count();\n      \/\/ We might get extraneous chrome::LOAD_STOP notifications when\n      \/\/ doing async loading.  This happens when the first loader is cancelled\n      \/\/ and before creating a byte-range request loader.\n      bool complete = false;\n      ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n          browser()->GetSelectedWebContents()->GetRenderViewHost(),\n          std::wstring(),\n          L\"window.domAutomationController.send(plugin.documentLoadComplete())\",\n          &complete));\n      if (complete)\n        break;\n\n      \/\/ Check if the LOAD_STOP notification could have come while we run a\n      \/\/ nested message loop for the JS call.\n      if (last_count != load_stop_notification_count())\n        continue;\n      ui_test_utils::WaitForLoadStop(browser()->GetSelectedWebContents());\n    }\n  }\n}\n\n\/\/ Flaky as per http:\/\/crbug.com\/74549.\nIN_PROC_BROWSER_TEST_F(PDFBrowserTest, DISABLED_OnLoadAndReload) {\n  ASSERT_TRUE(pdf_test_server()->Start());\n\n  GURL url = pdf_test_server()->GetURL(\"files\/onload_reload.html\");\n  ui_test_utils::NavigateToURL(browser(), url);\n\n  ui_test_utils::WindowedNotificationObserver observer(\n      content::NOTIFICATION_LOAD_STOP,\n      content::Source<NavigationController>(\n          &browser()->GetSelectedWebContents()->GetController()));\n  ASSERT_TRUE(ui_test_utils::ExecuteJavaScript(\n      browser()->GetSelectedWebContents()->GetRenderViewHost(),\n      std::wstring(),\n      L\"reloadPDF();\"));\n  observer.Wait();\n\n  ASSERT_EQ(\"success\", browser()->GetSelectedWebContents()->GetURL().query());\n}\n\n}  \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) Sjors Gielen, 2010\n * See LICENSE for license.\n *\/\n\n#include <config.h>\n#include \"pluginmanager.h\"\n#include \"testplugin.h\"\n#include \"perlplugin.h\"\n#include \"statistics.h\"\n#include \"database.h\"\n#include <IrcBuffer>\n#include <IrcSession>\n\nQDebug operator<<(QDebug dbg, const Context *c)\n{\n  dbg.nospace() << \"Context[\";\n  if( c == 0 ) {\n    dbg.nospace() << \"0\";\n  } else {\n    dbg.nospace() <<  \"n=\" << c->network\n                  << \",r=\" << c->receiver\n                  << \",s=\" << c->sender;\n  }\n  dbg.nospace() << \"]\";\n\n  return dbg.maybeSpace();\n}\n\n\/**\n * @brief Constructor.\n *\n * Does nothing.\n *\/\nPluginManager::PluginManager( Database *db )\n: QObject()\n, config_( 0 )\n, database_( db )\n, context_( 0 )\n, initialized_( false )\n{\n}\n\n\n\/**\n * @brief Destructor.\n *\/\nPluginManager::~PluginManager()\n{\n}\n\n\/**\n * @brief Clear the previously set context.\n * @see setContext(), context()\n *\/\nvoid PluginManager::clearContext()\n{\n  Q_ASSERT( context_ != 0 );\n  delete context_;\n  context_ = 0;\n}\n\n\/**\n * @brief Return the current call context.\n *\/\nconst Context *PluginManager::context() const\n{\n  return context_;\n}\n\n\/**\n * @brief Gets a property.\n * Name must be fully qualified. The nearest scope will be returned in s if\n * non-null.\n *\/\nQVariant PluginManager::get( const QString &name, Plugin::VariableScope *s  ) const\n{\n  Q_ASSERT( context_ != 0 );\n#warning TODO\n  if( s != NULL )\n    *s = Plugin::GlobalScope;\n  return database_->property( name, context_->network, context_->receiver, context_->sender );\n}\n\n\/**\n * @brief Initialises plugins.\n *\n * This method takes all configuration from the configuration file, tries to\n * find all modules and load all modules marked 'load on start' (in order of\n * priority), then calls\n * init() on them. If it fails to load and initialize a plugin, it prints an\n * error and, depending on the value of fatalError in the configfile, either\n * ignores the error or stops loading all plugins altogether and returning\n * an error.\n *\n * When the configuration reloads, this method is automatically called to\n * reload all plugins.\n *\/\nbool PluginManager::initialize()\n{\n  Q_ASSERT( config_ != 0 );\n  setContext(\"\");\n\n  Plugin *plugin = new TestPlugin( this );\n  plugin->init();\n  plugins_.append( plugin );\n\n  Plugin *plugin2 = new PerlPlugin( this );\n  plugin2->init();\n  plugins_.append( plugin2 );\n\n  Plugin *plugin3 = new Statistics( this );\n  plugin3->init();\n  plugins_.append( plugin3 );\n\n  clearContext();\n\n  initialized_ = true;\n  return true;\n}\n\n\n\n\/**\n * @returns whether this PluginManager is initialized.\n * @see initialize()\n *\/\nbool PluginManager::isInitialized() const\n{\n  return initialized_;\n}\n\n\n\n\/**\n * @brief Unloads all modules and resets this object.\n *\/\nvoid PluginManager::reset()\n{\n  \/\/ TODO\n}\n\n\/**\n * @brief Sets a property in the database on given scope.\n *\/\nvoid PluginManager::set( Plugin::VariableScope s, const QString &name, const QVariant &value )\n{\n  bool isSenderScope   =                    s & Plugin::SenderScope;\n  bool isReceiverScope = isSenderScope   || s & Plugin::ReceiverScope;\n  bool isNetworkScope  = isReceiverScope || s & Plugin::NetworkScope;\n\n  database_->setProperty( name, value,\n    isNetworkScope  ? context_->network  : QString(),\n    isReceiverScope ? context_->receiver : QString(),\n    isSenderScope   ? context_->sender   : QString() );\n}\n\n\/**\n * @brief Set the configuration of this object.\n * MUST be called before initialize().\n *\/\nvoid PluginManager::setConfig( Config *c )\n{\n  config_ = c;\n  connect( c,    SIGNAL( configReloaded() ),\n           this, SLOT(       initialize() ) );\n}\n\n\/**\n * @brief Set the context of this call.\n *\n * All PluginManager handlers call this method for later reference. For\n * example, the Database needs to look back at the current call, to save\n * variables in the correct scope.\n *\/\nvoid PluginManager::setContext(QString network, QString receiver, QString sender)\n{\n  Q_ASSERT( context_ == 0 );\n  context_ = new Context;\n  context_->network  = network;\n  context_->receiver = receiver;\n  context_->sender   = sender;\n}\n\n\n\n\/******* ADDITIONAL HANDLERS **********\/\n\n\/**\n * @brief welcomed() handler.\n *\n * This method is called when DaVinci finishes a handshake with the IRC server.\n *\/\nvoid PluginManager::welcomed( Network &n )\n{\n  setContext( n.config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->welcomed( n );\n  }\n  clearContext();\n}\n\n\/**\n * @brief connected() handler.\n *\n * This method is called when DaVinci connects to an IRC server, before authorization.\n *\/\nvoid PluginManager::connected( Network &n, const Server &s )\n{\n  setContext( n.config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->connected( n, s );\n  }\n  clearContext();\n}\n\n\/**\n * @brief Database getter.\n *\n * Returns the database for this PluginManager and set of plugins.\n *\/\nDatabase *PluginManager::database() const\n{\n  return database_;\n}\n\n\/**\n * @brief disconnected() handler.\n *\n * This method is called when the connection is broken between DaVinci and an IRC server.\n *\/\nvoid PluginManager::disconnected( Network &n )\n{\n  setContext( n.config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->disconnected( n );\n  }\n  clearContext();\n}\n\nvoid PluginManager::motdReceived ( const QString &motd, Irc::Buffer *b ) {\n  Network *n = Network::fromBuffer( b );\n  Q_ASSERT( n != 0 );\n  setContext( n->config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->motdReceived( *n, motd, b );\n  }\n  clearContext();\n}\n\n#define PLUGIN_EVENT_RELAY_1STR( EVENTNAME ) \\\nvoid PluginManager::EVENTNAME ( const QString &str, Irc::Buffer *b ) { \\\n  Network *n = Network::fromBuffer( b ); \\\n  Q_ASSERT( n != 0 ); \\\n  setContext( n->config()->name, b->receiver(), str ); \\\n  foreach( Plugin *p, plugins_ ) \\\n  { \\\n    p->EVENTNAME( *n, str, b ); \\\n  } \\\n  clearContext(); \\\n}\n\n#define PLUGIN_EVENT_RELAY_2STR( EVENTNAME ) \\\nvoid PluginManager::EVENTNAME ( const QString &str, const QString &str2, Irc::Buffer *b ) { \\\n  Network *n = Network::fromBuffer( b ); \\\n  Q_ASSERT( n != 0 ); \\\n  setContext( n->config()->name, b->receiver(), str ); \\\n  foreach( Plugin *p, plugins_ ) \\\n  { \\\n    p->EVENTNAME( *n, str, str2, b ); \\\n  } \\\n  clearContext(); \\\n}\n\n#define PLUGIN_EVENT_RELAY_3STR( EVENTNAME ) \\\nvoid PluginManager::EVENTNAME ( const QString &str, const QString &str2, \\\n                           const QString &str3, Irc::Buffer *b ) { \\\n  Network *n = Network::fromBuffer( b ); \\\n  Q_ASSERT( n != 0 ); \\\n  setContext( n->config()->name, b->receiver(), str ); \\\n  foreach( Plugin *p, plugins_ ) \\\n  { \\\n    p->EVENTNAME( *n, str, str2, str3, b ); \\\n  } \\\n  clearContext(); \\\n}\n\nPLUGIN_EVENT_RELAY_1STR( joined );\nPLUGIN_EVENT_RELAY_2STR( parted );\nPLUGIN_EVENT_RELAY_2STR( quit );\nPLUGIN_EVENT_RELAY_2STR( nickChanged );\nPLUGIN_EVENT_RELAY_3STR( modeChanged );\nPLUGIN_EVENT_RELAY_2STR( topicChanged );\nPLUGIN_EVENT_RELAY_3STR( invited );\nPLUGIN_EVENT_RELAY_3STR( kicked );\nPLUGIN_EVENT_RELAY_2STR( messageReceived );\nPLUGIN_EVENT_RELAY_2STR( noticeReceived );\nPLUGIN_EVENT_RELAY_2STR( ctcpRequestReceived );\nPLUGIN_EVENT_RELAY_2STR( ctcpReplyReceived );\nPLUGIN_EVENT_RELAY_2STR( ctcpActionReceived );\n\n#undef PLUGIN_EVENT_RELAY_1STR\n#undef PLUGIN_EVENT_RELAY_2STR\n#undef PLUGIN_EVENT_RELAY_3STR\n\nvoid PluginManager::numericMessageReceived( const QString &origin, uint code,\n                           const QStringList &params, Irc::Buffer *buffer )\n{\n  Network *n = Network::fromBuffer( buffer );\n  Q_ASSERT( n != 0 );\n  setContext( n->config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->numericMessageReceived( *n, origin, code, params, buffer );\n  }\n  clearContext();\n}\n\nvoid PluginManager::unknownMessageReceived( const QString &origin,\n                          const QStringList &params, Irc::Buffer *buffer )\n{\n  Network *n = Network::fromBuffer( buffer );\n  Q_ASSERT( n != 0 );\n  setContext( n->config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->unknownMessageReceived( *n, origin, params, buffer );\n  }\n  clearContext();\n}\n\n<commit_msg>make PluginManager ascii safe too.<commit_after>\/**\n * Copyright (c) Sjors Gielen, 2010\n * See LICENSE for license.\n *\/\n\n#include <config.h>\n#include \"pluginmanager.h\"\n#include \"testplugin.h\"\n#include \"perlplugin.h\"\n#include \"statistics.h\"\n#include \"database.h\"\n#include <IrcBuffer>\n#include <IrcSession>\n\nQDebug operator<<(QDebug dbg, const Context *c)\n{\n  dbg.nospace() << \"Context[\";\n  if( c == 0 ) {\n    dbg.nospace() << \"0\";\n  } else {\n    dbg.nospace() <<  \"n=\" << c->network\n                  << \",r=\" << c->receiver\n                  << \",s=\" << c->sender;\n  }\n  dbg.nospace() << \"]\";\n\n  return dbg.maybeSpace();\n}\n\n\/**\n * @brief Constructor.\n *\n * Does nothing.\n *\/\nPluginManager::PluginManager( Database *db )\n: QObject()\n, config_( 0 )\n, database_( db )\n, context_( 0 )\n, initialized_( false )\n{\n}\n\n\n\/**\n * @brief Destructor.\n *\/\nPluginManager::~PluginManager()\n{\n}\n\n\/**\n * @brief Clear the previously set context.\n * @see setContext(), context()\n *\/\nvoid PluginManager::clearContext()\n{\n  Q_ASSERT( context_ != 0 );\n  delete context_;\n  context_ = 0;\n}\n\n\/**\n * @brief Return the current call context.\n *\/\nconst Context *PluginManager::context() const\n{\n  return context_;\n}\n\n\/**\n * @brief Gets a property.\n * Name must be fully qualified. The nearest scope will be returned in s if\n * non-null.\n *\/\nQVariant PluginManager::get( const QString &name, Plugin::VariableScope *s  ) const\n{\n  Q_ASSERT( context_ != 0 );\n#warning TODO\n  if( s != NULL )\n    *s = Plugin::GlobalScope;\n  return database_->property( name, context_->network, context_->receiver, context_->sender );\n}\n\n\/**\n * @brief Initialises plugins.\n *\n * This method takes all configuration from the configuration file, tries to\n * find all modules and load all modules marked 'load on start' (in order of\n * priority), then calls\n * init() on them. If it fails to load and initialize a plugin, it prints an\n * error and, depending on the value of fatalError in the configfile, either\n * ignores the error or stops loading all plugins altogether and returning\n * an error.\n *\n * When the configuration reloads, this method is automatically called to\n * reload all plugins.\n *\/\nbool PluginManager::initialize()\n{\n  Q_ASSERT( config_ != 0 );\n  setContext(QString());\n\n  Plugin *plugin = new TestPlugin( this );\n  plugin->init();\n  plugins_.append( plugin );\n\n  Plugin *plugin2 = new PerlPlugin( this );\n  plugin2->init();\n  plugins_.append( plugin2 );\n\n  Plugin *plugin3 = new Statistics( this );\n  plugin3->init();\n  plugins_.append( plugin3 );\n\n  clearContext();\n\n  initialized_ = true;\n  return true;\n}\n\n\n\n\/**\n * @returns whether this PluginManager is initialized.\n * @see initialize()\n *\/\nbool PluginManager::isInitialized() const\n{\n  return initialized_;\n}\n\n\n\n\/**\n * @brief Unloads all modules and resets this object.\n *\/\nvoid PluginManager::reset()\n{\n  \/\/ TODO\n}\n\n\/**\n * @brief Sets a property in the database on given scope.\n *\/\nvoid PluginManager::set( Plugin::VariableScope s, const QString &name, const QVariant &value )\n{\n  bool isSenderScope   =                    s & Plugin::SenderScope;\n  bool isReceiverScope = isSenderScope   || s & Plugin::ReceiverScope;\n  bool isNetworkScope  = isReceiverScope || s & Plugin::NetworkScope;\n\n  database_->setProperty( name, value,\n    isNetworkScope  ? context_->network  : QString(),\n    isReceiverScope ? context_->receiver : QString(),\n    isSenderScope   ? context_->sender   : QString() );\n}\n\n\/**\n * @brief Set the configuration of this object.\n * MUST be called before initialize().\n *\/\nvoid PluginManager::setConfig( Config *c )\n{\n  config_ = c;\n  connect( c,    SIGNAL( configReloaded() ),\n           this, SLOT(       initialize() ) );\n}\n\n\/**\n * @brief Set the context of this call.\n *\n * All PluginManager handlers call this method for later reference. For\n * example, the Database needs to look back at the current call, to save\n * variables in the correct scope.\n *\/\nvoid PluginManager::setContext(QString network, QString receiver, QString sender)\n{\n  Q_ASSERT( context_ == 0 );\n  context_ = new Context;\n  context_->network  = network;\n  context_->receiver = receiver;\n  context_->sender   = sender;\n}\n\n\n\n\/******* ADDITIONAL HANDLERS **********\/\n\n\/**\n * @brief welcomed() handler.\n *\n * This method is called when DaVinci finishes a handshake with the IRC server.\n *\/\nvoid PluginManager::welcomed( Network &n )\n{\n  setContext( n.config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->welcomed( n );\n  }\n  clearContext();\n}\n\n\/**\n * @brief connected() handler.\n *\n * This method is called when DaVinci connects to an IRC server, before authorization.\n *\/\nvoid PluginManager::connected( Network &n, const Server &s )\n{\n  setContext( n.config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->connected( n, s );\n  }\n  clearContext();\n}\n\n\/**\n * @brief Database getter.\n *\n * Returns the database for this PluginManager and set of plugins.\n *\/\nDatabase *PluginManager::database() const\n{\n  return database_;\n}\n\n\/**\n * @brief disconnected() handler.\n *\n * This method is called when the connection is broken between DaVinci and an IRC server.\n *\/\nvoid PluginManager::disconnected( Network &n )\n{\n  setContext( n.config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->disconnected( n );\n  }\n  clearContext();\n}\n\nvoid PluginManager::motdReceived ( const QString &motd, Irc::Buffer *b ) {\n  Network *n = Network::fromBuffer( b );\n  Q_ASSERT( n != 0 );\n  setContext( n->config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->motdReceived( *n, motd, b );\n  }\n  clearContext();\n}\n\n#define PLUGIN_EVENT_RELAY_1STR( EVENTNAME ) \\\nvoid PluginManager::EVENTNAME ( const QString &str, Irc::Buffer *b ) { \\\n  Network *n = Network::fromBuffer( b ); \\\n  Q_ASSERT( n != 0 ); \\\n  setContext( n->config()->name, b->receiver(), str ); \\\n  foreach( Plugin *p, plugins_ ) \\\n  { \\\n    p->EVENTNAME( *n, str, b ); \\\n  } \\\n  clearContext(); \\\n}\n\n#define PLUGIN_EVENT_RELAY_2STR( EVENTNAME ) \\\nvoid PluginManager::EVENTNAME ( const QString &str, const QString &str2, Irc::Buffer *b ) { \\\n  Network *n = Network::fromBuffer( b ); \\\n  Q_ASSERT( n != 0 ); \\\n  setContext( n->config()->name, b->receiver(), str ); \\\n  foreach( Plugin *p, plugins_ ) \\\n  { \\\n    p->EVENTNAME( *n, str, str2, b ); \\\n  } \\\n  clearContext(); \\\n}\n\n#define PLUGIN_EVENT_RELAY_3STR( EVENTNAME ) \\\nvoid PluginManager::EVENTNAME ( const QString &str, const QString &str2, \\\n                           const QString &str3, Irc::Buffer *b ) { \\\n  Network *n = Network::fromBuffer( b ); \\\n  Q_ASSERT( n != 0 ); \\\n  setContext( n->config()->name, b->receiver(), str ); \\\n  foreach( Plugin *p, plugins_ ) \\\n  { \\\n    p->EVENTNAME( *n, str, str2, str3, b ); \\\n  } \\\n  clearContext(); \\\n}\n\nPLUGIN_EVENT_RELAY_1STR( joined );\nPLUGIN_EVENT_RELAY_2STR( parted );\nPLUGIN_EVENT_RELAY_2STR( quit );\nPLUGIN_EVENT_RELAY_2STR( nickChanged );\nPLUGIN_EVENT_RELAY_3STR( modeChanged );\nPLUGIN_EVENT_RELAY_2STR( topicChanged );\nPLUGIN_EVENT_RELAY_3STR( invited );\nPLUGIN_EVENT_RELAY_3STR( kicked );\nPLUGIN_EVENT_RELAY_2STR( messageReceived );\nPLUGIN_EVENT_RELAY_2STR( noticeReceived );\nPLUGIN_EVENT_RELAY_2STR( ctcpRequestReceived );\nPLUGIN_EVENT_RELAY_2STR( ctcpReplyReceived );\nPLUGIN_EVENT_RELAY_2STR( ctcpActionReceived );\n\n#undef PLUGIN_EVENT_RELAY_1STR\n#undef PLUGIN_EVENT_RELAY_2STR\n#undef PLUGIN_EVENT_RELAY_3STR\n\nvoid PluginManager::numericMessageReceived( const QString &origin, uint code,\n                           const QStringList &params, Irc::Buffer *buffer )\n{\n  Network *n = Network::fromBuffer( buffer );\n  Q_ASSERT( n != 0 );\n  setContext( n->config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->numericMessageReceived( *n, origin, code, params, buffer );\n  }\n  clearContext();\n}\n\nvoid PluginManager::unknownMessageReceived( const QString &origin,\n                          const QStringList &params, Irc::Buffer *buffer )\n{\n  Network *n = Network::fromBuffer( buffer );\n  Q_ASSERT( n != 0 );\n  setContext( n->config()->name );\n  foreach( Plugin *p, plugins_ )\n  {\n    p->unknownMessageReceived( *n, origin, params, buffer );\n  }\n  clearContext();\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\/views\/theme_background.h\"\n\n#include \"app\/gfx\/canvas.h\"\n#include \"chrome\/browser\/browser_theme_provider.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/view.h\"\n\nThemeBackground::ThemeBackground(BrowserView* browser_view)\n    : browser_view_(browser_view) {\n}\n\nvoid ThemeBackground::Paint(gfx::Canvas* canvas, views::View* view) const {\n  int image_name;\n  Browser* browser = browser_view_->browser();\n  if (browser->window()->IsActive()) {\n    image_name = browser->profile()->IsOffTheRecord() ?\n        IDR_THEME_FRAME_INCOGNITO : IDR_THEME_FRAME;\n  } else {\n    image_name = browser->profile()->IsOffTheRecord() ?\n        IDR_THEME_FRAME_INCOGNITO_INACTIVE : IDR_THEME_FRAME_INACTIVE;\n  }\n  ThemeProvider* theme = browser->profile()->GetThemeProvider();\n  SkBitmap* background = theme->GetBitmapNamed(image_name);\n\n  gfx::Point origin(0, 0);\n  views::View::ConvertPointToView(view,\n                                  browser_view_->frame()->GetFrameView(),\n                                  &origin);\n#if defined(OS_CHROMEOS)\n  const int kCustomFrameBackgroundVerticalOffset = 15;\n  \/\/ TODO(oshima): Remove this once we fully migrated to views.\n  \/\/ See http:\/\/crbug.com\/28580.\n  if (browser_view_->IsMaximized()) {\n    origin.Offset(0, kCustomFrameBackgroundVerticalOffset + 1);\n  }\n#endif\n  canvas->TileImageInt(*background,\n                       origin.x(), origin.y(), 0, 0,\n                       view->width(), view->height());\n}\n<commit_msg>Don't theme app\/popup window<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\/theme_background.h\"\n\n#include \"app\/gfx\/canvas.h\"\n#include \"app\/resource_bundle.h\"\n#include \"chrome\/browser\/browser_theme_provider.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"grit\/app_resources.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/view.h\"\n\nThemeBackground::ThemeBackground(BrowserView* browser_view)\n    : browser_view_(browser_view) {\n}\n\nvoid ThemeBackground::Paint(gfx::Canvas* canvas, views::View* view) const {\n  SkBitmap* background;\n\n  \/\/ Never theme app and popup windows.\n  if (!browser_view_->IsBrowserTypeNormal()) {\n    ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n    if (browser_view_->IsActive())\n      background = rb.GetBitmapNamed(IDR_FRAME);\n    else\n      background = rb.GetBitmapNamed(IDR_THEME_FRAME_INACTIVE);\n  } else {\n    Profile* profile = browser_view_->browser()->profile();\n    ThemeProvider* theme = profile->GetThemeProvider();\n    if (browser_view_->IsActive()) {\n      background = theme->GetBitmapNamed(\n          profile->IsOffTheRecord() ?\n          IDR_THEME_FRAME_INCOGNITO : IDR_THEME_FRAME);\n    } else {\n      background = theme->GetBitmapNamed(\n          profile->IsOffTheRecord() ?\n          IDR_THEME_FRAME_INCOGNITO_INACTIVE : IDR_THEME_FRAME_INACTIVE);\n    }\n  }\n\n  gfx::Point origin(0, 0);\n  views::View::ConvertPointToView(view,\n                                  browser_view_->frame()->GetFrameView(),\n                                  &origin);\n#if defined(OS_CHROMEOS)\n  const int kCustomFrameBackgroundVerticalOffset = 15;\n  \/\/ TODO(oshima): Remove this once we fully migrated to views.\n  \/\/ See http:\/\/crbug.com\/28580.\n  if (browser_view_->IsMaximized()) {\n    origin.Offset(0, kCustomFrameBackgroundVerticalOffset + 1);\n  }\n#endif\n  canvas->TileImageInt(*background,\n                       origin.x(), origin.y(), 0, 0,\n                       view->width(), view->height());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ CoinVault\n\/\/\n\/\/ requestpaymentdialogview.cpp\n\/\/\n\/\/ Copyright (c) 2013-2014 Eric Lombrozo\n\/\/\n\/\/ All Rights Reserved.\n\n#include \"requestpaymentdialog.h\"\n#include \"ui_requestpaymentdialog.h\"\n\n#include \"accountmodel.h\"\n#include \"coinparams.h\"\n#include \"numberformats.h\"\n#include \"currencyvalidator.h\"\n\n#include <QMessageBox>\n#include <QClipboard>\n#include <QRegExpValidator>\n\n#include <qrencode.h>\n\nRequestPaymentDialog::RequestPaymentDialog(AccountModel* accountModel, QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::RequestPaymentDialog),\n    accountModel_(accountModel)\n{\n    ui->setupUi(this);\n    connect(accountModel_, SIGNAL(updated(const QStringList&)), this, SLOT(setAccounts(const QStringList&)));\n\n    ui->invoiceAmountLineEdit->setValidator(new CurrencyValidator(getCoinParams().currency_max(), getCoinParams().currency_decimals()));\n}\n\nRequestPaymentDialog::~RequestPaymentDialog()\n{\n    delete ui;\n}\n\nvoid RequestPaymentDialog::setAccounts(const QStringList& accountNames)\n{\n    ui->accountComboBox->clear();\n    ui->accountComboBox->addItems(accountNames);\n}\n\nvoid RequestPaymentDialog::setQRCode(const QString& address)\n{\n    QRcode* qrcode = QRcode_encodeString(address.toUtf8().data(), 0, QR_ECLEVEL_H, QR_MODE_8, 1);\n    QImage qrImage(qrcode->width + 6, qrcode->width + 6, QImage::Format_RGB32);\n    qrImage.fill(0xffffff);\n    unsigned char* p = qrcode->data;\n    for (int y = 0; y < qrcode->width; y++)\n    {\n        for (int x = 0; x < qrcode->width; x++)\n        {\n            qrImage.setPixel(x + 3, y + 3, ((*p & 1) ? 0x000000 : 0xffffff));\n            p++;\n        }\n    }\n    QRcode_free(qrcode);\n\n    ui->qrLabel->setPixmap(QPixmap::fromImage(qrImage).scaled(ui->qrLabel->width(), ui->qrLabel->height()));\n}\n\nvoid RequestPaymentDialog::setCurrentAccount(const QString &accountName)\n{\n    ui->accountComboBox->setCurrentText(accountName);\n    clearInvoice();\n}\n\nvoid RequestPaymentDialog::clearInvoice()\n{\n        ui->invoiceDetailsLabelLineEdit->clear();\n        ui->invoiceDetailsAddressLineEdit->clear();\n        ui->invoiceDetailsScriptLineEdit->clear();\n        ui->invoiceDetailsUrlLineEdit->clear();\n        ui->qrLabel->clear();\n}\n\nvoid RequestPaymentDialog::on_newInvoiceButton_clicked()\n{\n    try {\n        QString accountName = ui->accountComboBox->currentText();\n        QString invoiceLabel = ui->invoiceLineEdit->text();\n        QString invoiceAmount = ui->invoiceAmountLineEdit->text();\n        auto pair = accountModel_->issueNewScript(accountName, invoiceLabel);\n        accountModel_->update();\n        ui->invoiceDetailsLabelLineEdit->setText(invoiceLabel);\n        ui->invoiceDetailsAddressLineEdit->setText(pair.first);\n        ui->invoiceDetailsScriptLineEdit->setText(QString::fromStdString(uchar_vector(pair.second).getHex()));\n        QString url = QString(getCoinParams().url_prefix()) + \":\" + pair.first;\n        int nParams = 0;\n        if (!invoiceLabel.isEmpty()) {\n            url += (nParams == 0) ? \"?\" : \"&\";\n            url += \"label=\";\n            url += invoiceLabel;\n            nParams++;\n        }\n        if (!invoiceAmount.isEmpty()) {\n            url += (nParams == 0) ? \"?\" : \"&\";\n            url += \"amount=\";\n            url += invoiceAmount;\n            nParams++;\n        }\n        ui->invoiceDetailsUrlLineEdit->setText(url);\n        setQRCode(pair.first);\n    }\n    catch (const std::exception& e) {\n        QMessageBox::critical(this, tr(\"Error\"), QString::fromStdString(e.what()));\n    }\n}\n\nvoid RequestPaymentDialog::on_addressClipboardButton_clicked()\n{\n    QApplication::clipboard()->setText(ui->invoiceDetailsAddressLineEdit->text());\n}\n\nvoid RequestPaymentDialog::on_scriptClipboardButton_clicked()\n{\n    QApplication::clipboard()->setText(ui->invoiceDetailsScriptLineEdit->text());\n}\n\nvoid RequestPaymentDialog::on_urlClipboardButton_clicked()\n{\n    QApplication::clipboard()->setText(ui->invoiceDetailsUrlLineEdit->text());\n}\n\nvoid RequestPaymentDialog::on_closeButton_clicked()\n{\n    this->close();\n}\n\n<commit_msg>Display currency symbol in invoice.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ CoinVault\n\/\/\n\/\/ requestpaymentdialogview.cpp\n\/\/\n\/\/ Copyright (c) 2013-2014 Eric Lombrozo\n\/\/\n\/\/ All Rights Reserved.\n\n#include \"requestpaymentdialog.h\"\n#include \"ui_requestpaymentdialog.h\"\n\n#include \"accountmodel.h\"\n#include \"coinparams.h\"\n#include \"numberformats.h\"\n#include \"currencyvalidator.h\"\n\n#include <QMessageBox>\n#include <QClipboard>\n#include <QRegExpValidator>\n\n#include <qrencode.h>\n\nRequestPaymentDialog::RequestPaymentDialog(AccountModel* accountModel, QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::RequestPaymentDialog),\n    accountModel_(accountModel)\n{\n    ui->setupUi(this);\n    connect(accountModel_, SIGNAL(updated(const QStringList&)), this, SLOT(setAccounts(const QStringList&)));\n\n    ui->invoiceAmountLabel->setText(tr(\"Amount\") + \" (\" + getCoinParams().currency_symbol() + \"):\");\n    ui->invoiceAmountLineEdit->setValidator(new CurrencyValidator(getCoinParams().currency_max(), getCoinParams().currency_decimals()));\n}\n\nRequestPaymentDialog::~RequestPaymentDialog()\n{\n    delete ui;\n}\n\nvoid RequestPaymentDialog::setAccounts(const QStringList& accountNames)\n{\n    ui->accountComboBox->clear();\n    ui->accountComboBox->addItems(accountNames);\n}\n\nvoid RequestPaymentDialog::setQRCode(const QString& address)\n{\n    QRcode* qrcode = QRcode_encodeString(address.toUtf8().data(), 0, QR_ECLEVEL_H, QR_MODE_8, 1);\n    QImage qrImage(qrcode->width + 6, qrcode->width + 6, QImage::Format_RGB32);\n    qrImage.fill(0xffffff);\n    unsigned char* p = qrcode->data;\n    for (int y = 0; y < qrcode->width; y++)\n    {\n        for (int x = 0; x < qrcode->width; x++)\n        {\n            qrImage.setPixel(x + 3, y + 3, ((*p & 1) ? 0x000000 : 0xffffff));\n            p++;\n        }\n    }\n    QRcode_free(qrcode);\n\n    ui->qrLabel->setPixmap(QPixmap::fromImage(qrImage).scaled(ui->qrLabel->width(), ui->qrLabel->height()));\n}\n\nvoid RequestPaymentDialog::setCurrentAccount(const QString &accountName)\n{\n    ui->accountComboBox->setCurrentText(accountName);\n    clearInvoice();\n}\n\nvoid RequestPaymentDialog::clearInvoice()\n{\n        ui->invoiceDetailsLabelLineEdit->clear();\n        ui->invoiceDetailsAddressLineEdit->clear();\n        ui->invoiceDetailsScriptLineEdit->clear();\n        ui->invoiceDetailsUrlLineEdit->clear();\n        ui->qrLabel->clear();\n}\n\nvoid RequestPaymentDialog::on_newInvoiceButton_clicked()\n{\n    try {\n        QString accountName = ui->accountComboBox->currentText();\n        QString invoiceLabel = ui->invoiceLineEdit->text();\n        QString invoiceAmount = ui->invoiceAmountLineEdit->text();\n        auto pair = accountModel_->issueNewScript(accountName, invoiceLabel);\n        accountModel_->update();\n        ui->invoiceDetailsLabelLineEdit->setText(invoiceLabel);\n        ui->invoiceDetailsAddressLineEdit->setText(pair.first);\n        ui->invoiceDetailsScriptLineEdit->setText(QString::fromStdString(uchar_vector(pair.second).getHex()));\n        QString url = QString(getCoinParams().url_prefix()) + \":\" + pair.first;\n        int nParams = 0;\n        if (!invoiceLabel.isEmpty()) {\n            url += (nParams == 0) ? \"?\" : \"&\";\n            url += \"label=\";\n            url += invoiceLabel;\n            nParams++;\n        }\n        if (!invoiceAmount.isEmpty()) {\n            url += (nParams == 0) ? \"?\" : \"&\";\n            url += \"amount=\";\n            url += invoiceAmount;\n            nParams++;\n        }\n        ui->invoiceDetailsUrlLineEdit->setText(url);\n        setQRCode(pair.first);\n    }\n    catch (const std::exception& e) {\n        QMessageBox::critical(this, tr(\"Error\"), QString::fromStdString(e.what()));\n    }\n}\n\nvoid RequestPaymentDialog::on_addressClipboardButton_clicked()\n{\n    QApplication::clipboard()->setText(ui->invoiceDetailsAddressLineEdit->text());\n}\n\nvoid RequestPaymentDialog::on_scriptClipboardButton_clicked()\n{\n    QApplication::clipboard()->setText(ui->invoiceDetailsScriptLineEdit->text());\n}\n\nvoid RequestPaymentDialog::on_urlClipboardButton_clicked()\n{\n    QApplication::clipboard()->setText(ui->invoiceDetailsUrlLineEdit->text());\n}\n\nvoid RequestPaymentDialog::on_closeButton_clicked()\n{\n    this->close();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2005 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#include \"PyBZDB.h\"\n\nnamespace Python\n{\n\nstatic void      BZDB_dealloc       (BZDB *bzdb);\nstatic PyObject *BZDB_getAttr       (BZDB *bzdb, char *name);\nstatic int       BZDB_setAttr       (BZDB *bzdb, char *name, PyObject *v);\nstatic PyObject *BZDB_repr          (BZDB *bzdb);\nstatic int       BZDB_length        (BZDB *bzdb);\nstatic PyObject *BZDB_subscript     (BZDB *bzdb, PyObject *key);\nstatic int       BZDB_ass_subscript (BZDB *bzdb, PyObject *key, PyObject *value);\n\nstatic PyMethodDef BZDB_methods[] = {\n\t{NULL, NULL, 0, NULL},\n};\n\nPyMappingMethods BZDB_mapping = {\n\t(inquiry) BZDB_length,\t\t\t\/\/ mp_length\n\t(binaryfunc) BZDB_subscript,\t\t\/\/ mp_subscript\n\t(objobjargproc) BZDB_ass_subscript,\t\/\/ mp_ass_subscript\n};\n\nPyTypeObject BZDB_Type = {\n\tPyObject_HEAD_INIT(NULL)\n\t0,\t\t\t\t\/\/ ob_size\n\t\"BZDB\",\t\t\t\t\/\/ tp_name\n\tsizeof (BZDB),\t\t\t\/\/ tp_basicsize\n\t0,\t\t\t\t\/\/ tp_itemsize\n\t(destructor) BZDB_dealloc,\t\/\/ tp_dealloc\n\t0,\t\t\t\t\/\/ tp_print\n\t0,\t\t\t\t\/\/ tp_getattr\n\t0,\t\t\t\t\/\/ tp_setattr\n\t0,\t\t\t\t\/\/ tp_compare\n\t(reprfunc) BZDB_repr,\t\t\/\/ tp_repr\n\t0,\t\t\t\t\/\/ tp_as_number\n\t0,\t\t\t\t\/\/ tp_as_sequence\n\t&BZDB_mapping,\t\t\t\/\/ tp_as_mapping\n\t0,\t\t\t\t\/\/ tp_as_hash\n\t0,\t\t\t\t\/\/ tp_call\n\t0,\t\t\t\t\/\/ tp_str\n\t0,\t\t\t\t\/\/ tp_getattro\n\t0,\t\t\t\t\/\/ tp_setattro\n\t0,\t\t\t\t\/\/ tp_flags\n\t0,\t\t\t\t\/\/ tp_doc\n};\n\nstatic void\nBZDB_dealloc (BZDB *bzdb)\n{\n}\n\nstatic PyObject *\nBZDB_getAttr (BZDB *bzdb, char *name)\n{\n}\n\nstatic int\nBZDB_setAttr (BZDB *bzdb, char *name, PyObject *v)\n{\n}\n\nstatic PyObject *\nBZDB_repr (BZDB *bzdb)\n{\n}\n\nstatic int\nBZDB_length (BZDB *bzdb)\n{\n}\n\nstatic PyObject *\nBZDB_subscript (BZDB *bzdb, PyObject *key)\n{\n}\n\nstatic int\nBZDB_ass_subscript (BZDB *bzdb, PyObject *key, PyObject *value)\n{\n}\n\n}\n<commit_msg>this might be how this is supposed to work...<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2005 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#include \"PyBZDB.h\"\n\nnamespace Python\n{\n\nstatic void      BZDB_dealloc       (BZDB *bzdb);\nstatic PyObject *BZDB_repr          (BZDB *bzdb);\nstatic int       BZDB_length        (BZDB *bzdb);\nstatic PyObject *BZDB_subscript     (BZDB *bzdb, PyObject *key);\nstatic int       BZDB_ass_subscript (BZDB *bzdb, PyObject *key, PyObject *value);\n\nstatic PyMethodDef BZDB_methods[] = {\n\t{NULL, NULL, 0, NULL},\n};\n\nPyMappingMethods BZDB_mapping = {\n\t(inquiry) BZDB_length,\t\t\t\/\/ mp_length\n\t(binaryfunc) BZDB_subscript,\t\t\/\/ mp_subscript\n\t(objobjargproc) BZDB_ass_subscript,\t\/\/ mp_ass_subscript\n};\n\nPyTypeObject BZDB_Type = {\n\tPyObject_HEAD_INIT(NULL)\n\t0,\t\t\t\t\/\/ ob_size\n\t\"BZDB\",\t\t\t\t\/\/ tp_name\n\tsizeof (BZDB),\t\t\t\/\/ tp_basicsize\n\t0,\t\t\t\t\/\/ tp_itemsize\n\t(destructor) BZDB_dealloc,\t\/\/ tp_dealloc\n\t0,\t\t\t\t\/\/ tp_print\n\t0,\t\t\t\t\/\/ tp_getattr\n\t0,\t\t\t\t\/\/ tp_setattr\n\t0,\t\t\t\t\/\/ tp_compare\n\t(reprfunc) BZDB_repr,\t\t\/\/ tp_repr\n\t0,\t\t\t\t\/\/ tp_as_number\n\t0,\t\t\t\t\/\/ tp_as_sequence\n\t&BZDB_mapping,\t\t\t\/\/ tp_as_mapping\n\t0,\t\t\t\t\/\/ tp_as_hash\n\t0,\t\t\t\t\/\/ tp_call\n\t0,\t\t\t\t\/\/ tp_str\n\t0,\t\t\t\t\/\/ tp_getattro\n\t0,\t\t\t\t\/\/ tp_setattro\n\t0,\t\t\t\t\/\/ tp_flags\n\t0,\t\t\t\t\/\/ tp_doc\n};\n\nPyObject *\nCreateBZDB ()\n{\n\tBZDB *bzdb = (BZDB *) PyObject_NEW (BZDB, &BZDB_Type);\n\treturn ((PyObject *) bzdb);\n}\n\nstatic void\nBZDB_dealloc (BZDB *bzdb)\n{\n\tPyObject_DEL (bzdb);\n}\n\nstatic PyObject *\nBZDB_repr (BZDB *bzdb)\n{\n}\n\nstatic int\nBZDB_length (BZDB *bzdb)\n{\n}\n\nstatic PyObject *\nBZDB_subscript (BZDB *bzdb, PyObject *key)\n{\n\tif (!PyString_Check (key)) {\n\t\t\/\/ FIXME - throw KeyError\n\t\treturn NULL;\n\t}\n\tchar *k = PyString_AsString (key);\n\treturn PyString_FromString (bz_getBZDString (k).c_str ());\n}\n\nstatic int\nBZDB_ass_subscript (BZDB *bzdb, PyObject *key, PyObject *value)\n{\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/SteamPy\n\n#include <steam\/steam_api.h>\n#include <steam\/isteamfriends.h>\n#include <steam\/isteamugc.h>\n\nextern \"C\"\n{\n\t__declspec(dllexport) bool SteamInit();\n\t__declspec(dllexport) const char* GetPersonaName();\n\t__declspec(dllexport) int GetFriendCount();\n\t__declspec(dllexport) const char* GetFriendNameByIndex(int index, int flag);\n\t__declspec(dllexport) int GetFriendStateByIndex(int index, int flag);\n\t__declspec(dllexport) int GetPersonaState();\n\t__declspec(dllexport) uint32 GetFriendGame(int index, int flag);\n\t__declspec(dllexport) bool IsFriendInGame(int index, int flag);\n\t__declspec(dllexport) void SetPersonaName(const char* newname);\n}\nbool SteamInit()\n{\n\treturn SteamAPI_Init();\n}\n\nconst char* GetPersonaName()\n{\n\treturn SteamFriends()->GetPersonaName();\n}\n\nint GetFriendCount(int flag)\n{\n\treturn SteamFriends()->GetFriendCount(flag);\n}\n\nconst char* GetFriendNameByIndex(int index, int flag)\n{\n\tconst char* name = SteamFriends()->GetFriendPersonaName(SteamFriends()->GetFriendByIndex(index, flag));\n\treturn name;\n}\n\nint GetFriendStateByIndex(int index, int flag)\n{\n\treturn SteamFriends()->GetFriendPersonaState(SteamFriends()->GetFriendByIndex(index, flag));\n}\n\nint GetPersonaState()\n{\n\treturn SteamFriends()->GetPersonaState();\n}\n\nuint32 GetFriendGame(int index, int flag)\n{\n\tFriendGameInfo_t* friendgame = new FriendGameInfo_t();\n\tSteamFriends()->GetFriendGamePlayed(SteamFriends()->GetFriendByIndex(index, flag), friendgame);\n\treturn friendgame->m_gameID.AppID();\n}\n\nbool IsFriendInGame(int index, int flag)\n{\n\treturn SteamFriends()->GetFriendGamePlayed(SteamFriends()->GetFriendByIndex(index, flag), new FriendGameInfo_t());\n}\n\nvoid SetPersonaName(const char* newname)\n{\n\tSteamFriends()->SetPersonaName(newname);\n}<commit_msg>linux<commit_after>\/\/SteamPy\n\n#include <steam\/steam_api.h>\n#include <steam\/isteamfriends.h>\n#include <steam\/isteamugc.h>\n\n#if defined _WIN32\n\t#define DLL_PUBLIC __declspec(dllexport)\n#else\n\t#define DLL_PUBLIC __attribute__ ((visibility(\"default\")))\n#endif\n\nextern \"C\"\n{\n\t__declspec(dllexport) bool SteamInit();\n\t__declspec(dllexport) const char* GetPersonaName();\n\t__declspec(dllexport) int GetFriendCount();\n\t__declspec(dllexport) const char* GetFriendNameByIndex(int index, int flag);\n\t__declspec(dllexport) int GetFriendStateByIndex(int index, int flag);\n\t__declspec(dllexport) int GetPersonaState();\n\t__declspec(dllexport) uint32 GetFriendGame(int index, int flag);\n\t__declspec(dllexport) bool IsFriendInGame(int index, int flag);\n\t__declspec(dllexport) void SetPersonaName(const char* newname);\n}\n\nbool SteamInit()\n{\n\treturn SteamAPI_Init();\n}\n\nconst char* GetPersonaName()\n{\n\treturn SteamFriends()->GetPersonaName();\n}\n\nint GetFriendCount(int flag)\n{\n\treturn SteamFriends()->GetFriendCount(flag);\n}\n\nconst char* GetFriendNameByIndex(int index, int flag)\n{\n\tconst char* name = SteamFriends()->GetFriendPersonaName(SteamFriends()->GetFriendByIndex(index, flag));\n\treturn name;\n}\n\nint GetFriendStateByIndex(int index, int flag)\n{\n\treturn SteamFriends()->GetFriendPersonaState(SteamFriends()->GetFriendByIndex(index, flag));\n}\n\nint GetPersonaState()\n{\n\treturn SteamFriends()->GetPersonaState();\n}\n\nuint32 GetFriendGame(int index, int flag)\n{\n\tFriendGameInfo_t* friendgame = new FriendGameInfo_t();\n\tSteamFriends()->GetFriendGamePlayed(SteamFriends()->GetFriendByIndex(index, flag), friendgame);\n\treturn friendgame->m_gameID.AppID();\n}\n\nbool IsFriendInGame(int index, int flag)\n{\n\treturn SteamFriends()->GetFriendGamePlayed(SteamFriends()->GetFriendByIndex(index, flag), new FriendGameInfo_t());\n}\n\nvoid SetPersonaName(const char* newname)\n{\n\tSteamFriends()->SetPersonaName(newname);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Utf8\/Utf16 Helper class\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2004-2012 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 Frank Celler\n\/\/\/ @author Achim Brandt\n\/\/\/ @author Copyright 2010-2012, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Utf8Helper.h\"\n\n#ifdef TRI_HAVE_ICU\n#include \"unicode\/normalizer2.h\"\n#include \"unicode\/ucasemap.h\"\n#else\n#include \"string.h\"\n#endif\n\n#include \"Logger\/Logger.h\"\n#include \"BasicsC\/strings.h\"\n\nusing namespace triagens::basics;\nusing namespace std;\n\n\nUtf8Helper Utf8Helper::DefaultUtf8Helper;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                      constructors and destructors\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @addtogroup UTF8\n\/\/\/ @{\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nUtf8Helper::Utf8Helper () : _coll(0) {\n  setCollatorLanguage(\"\");\n}\n\nUtf8Helper::Utf8Helper (const string& lang) : _coll(0) {\n  setCollatorLanguage(lang);\n}\n\nUtf8Helper::~Utf8Helper () {\n  if (_coll) {\n    delete _coll;\n  }\n}\n\n\/*\nint Utf8Helper::compareUtf8 (const char* left, size_t leftLength, const char* right, size_t rightLength) {\n#ifdef TRI_HAVE_ICU  \n  if (!_coll) {\n    LOGGER_ERROR << \"no Collator in Utf8Helper::compareUtf8()!\";\n    return 0;\n  }\n  \n  UErrorCode status = U_ZERO_ERROR;\n  int result = _coll->compareUTF8(StringPiece(left, leftLength), StringPiece(right, rightLength), status);\n  if(U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in Collator::compareUTF8(...): \" << u_errorName(status);\n    return 0;\n  }\n  return result;  \n#else\n  if (leftLength == rightLength) {\n    return memcmp((const void*)left, (const void*)right, leftLength);\n  }\n  \n  int result = memcmp((const void*)left, (const void*)right, leftLength < rightLength ? leftLength : rightLength);\n  \n  if (result == 0) {\n    if (leftLength < rightLength) {\n      return -1;\n    }\n    return 1;\n  }\n  return result;\n#endif\n}\n*\/\n\nint Utf8Helper::compareUtf8 (const char* left, const char* right) {\n#ifdef TRI_HAVE_ICU  \n  if (!_coll) {\n    LOGGER_ERROR << \"no Collator in Utf8Helper::compareUtf8()!\";\n    return (strcmp(left, right));\n  }\n  \n  UErrorCode status = U_ZERO_ERROR;\n  int result = _coll->compareUTF8(StringPiece(left), StringPiece(right), status);\n  if(U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in Collator::compareUTF8(...): \" << u_errorName(status);\n    return (strcmp(left, right));\n  }\n  \n  return result;\n#else\n  return (strcmp(left, right));\n#endif\n}\n\nint Utf8Helper::compareUtf16 (const uint16_t* left, size_t leftLength, const uint16_t* right, size_t rightLength) {  \n#ifdef TRI_HAVE_ICU \n  if (!_coll) {\n    LOGGER_ERROR << \"no Collator in Utf8Helper::compareUtf16()!\";\n#endif  \n    \n    if (leftLength == rightLength) {\n      return memcmp((const void*)left, (const void*)right, leftLength * 2);\n    }\n  \n    int result = memcmp((const void*)left, (const void*)right, leftLength < rightLength ? leftLength * 2 : rightLength * 2);\n  \n    if (result == 0) {\n      if (leftLength < rightLength) {\n        return -1;\n      }\n      return 1;\n    }\n    \n    return result;    \n#ifdef TRI_HAVE_ICU \n  }\n  \n  return _coll->compare((const UChar *)left, leftLength, (const UChar *)right, rightLength);\n#endif  \n}\n\nvoid Utf8Helper::setCollatorLanguage (const string& lang) {\n#ifdef TRI_HAVE_ICU\n  \n  UErrorCode status = U_ZERO_ERROR;   \n    \n  if (_coll) {\n    ULocDataLocaleType type = ULOC_ACTUAL_LOCALE;\n    const Locale& locale = _coll->getLocale(type, status);\n    \n    if(U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in Collator::getLocale(...): \" << u_errorName(status);\n      return;\n    }\n    if (lang == locale.getName()) {\n      return;\n    }\n  }\n  \n  Collator* coll;\n  if (lang == \"\") {\n    \/\/ get default collator for empty language\n    coll = Collator::createInstance(status); \n  }\n  else {\n    Locale locale(lang.c_str());\n    coll = Collator::createInstance(locale, status);     \n  }\n  \n  if(U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in Collator::createInstance(): \" << u_errorName(status);\n    if (coll) {\n      delete coll;\n    }\n    return;\n  }\n  \n  \/\/ set the default attributes for sorting:\n  coll->setAttribute(UCOL_CASE_FIRST, UCOL_UPPER_FIRST, status);  \/\/ A < a\n  coll->setAttribute(UCOL_NORMALIZATION_MODE, UCOL_OFF, status);  \/\/ no normalization\n  coll->setAttribute(UCOL_STRENGTH, UCOL_IDENTICAL, status);      \/\/ UCOL_IDENTICAL, UCOL_PRIMARY, UCOL_SECONDARY, UCOL_TERTIARY\n\n  if(U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in Collator::setAttribute(...): \" << u_errorName(status);\n    delete coll;\n    return;\n  }\n  \n  if (_coll) {\n    delete _coll;\n  }\n\n  _coll = coll;  \n#endif\n}\n\nstring Utf8Helper::getCollatorLanguage () {\n#ifdef TRI_HAVE_ICU\n  if (_coll) {\n    UErrorCode status = U_ZERO_ERROR;\n    ULocDataLocaleType type = ULOC_VALID_LOCALE;\n    const Locale& locale = _coll->getLocale(type, status);\n    \n    if(U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in Collator::getLocale(...): \" << u_errorName(status);\n      return \"\";\n    }\n    return locale.getLanguage();\n  }\n#endif\n  return \"\";\n}\n\nstring Utf8Helper::getCollatorCountry () {\n#ifdef TRI_HAVE_ICU\n  if (_coll) {\n    UErrorCode status = U_ZERO_ERROR;\n    ULocDataLocaleType type = ULOC_VALID_LOCALE;\n    const Locale& locale = _coll->getLocale(type, status);\n    \n    if(U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in Collator::getLocale(...): \" << u_errorName(status);\n      return \"\";\n    }\n    return locale.getCountry();\n  }\n#endif\n  return \"\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lowercase the characters in a UTF-8 string. \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstring Utf8Helper::toLowerCase (const string& src) {\n  int32_t utf8len = 0;\n  char* utf8 = tolower(TRI_UNKNOWN_MEM_ZONE, src.c_str(), src.length(), utf8len);\n  \n  string result(utf8, utf8len);\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, utf8);\n  return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lowercase the characters in a UTF-8 string.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar* Utf8Helper::tolower (TRI_memory_zone_t* zone, const char *src, int32_t srcLength, int32_t& dstLength) {\n  char* utf8_dest = 0;\n  \n  if (src == 0 || srcLength == 0) {\n    utf8_dest = (char*) TRI_Allocate(zone, sizeof(char), false);\n    utf8_dest[0] = '\\0';\n    dstLength = 0;\n    return utf8_dest;\n  }\n\n#ifdef TRI_HAVE_ICU  \n  uint32_t options = U_FOLD_CASE_DEFAULT;\n  UErrorCode status = U_ZERO_ERROR;\n  \n  string locale = getCollatorLanguage();\n  LocalUCaseMapPointer csm(ucasemap_open(locale.c_str(), options, &status));\n  \n  if (U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in ucasemap_open(...): \" << u_errorName(status);\n  }\n  else {    \n    utf8_dest = (char*) TRI_Allocate(zone, (srcLength+1) * sizeof(char), false);\n      \n    dstLength = ucasemap_utf8ToLower(csm.getAlias(),\n                    utf8_dest, \n                    srcLength + 1,\n                    src, \n                    srcLength, \n                    &status);\n    \n    if (status == U_BUFFER_OVERFLOW_ERROR) {\n        TRI_Free(zone, utf8_dest);\n        utf8_dest = (char*) TRI_Allocate(zone, (dstLength+1) * sizeof(char), false);\n      \n        dstLength = ucasemap_utf8ToLower(csm.getAlias(),\n                    utf8_dest, \n                    dstLength + 1,\n                    src, \n                    srcLength, \n                    &status);        \n    }\n\n    if (U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in ucasemap_utf8ToLower(...): \" << u_errorName(status);\n      TRI_Free(zone, utf8_dest);\n    }\n    else {\n      return utf8_dest;\n    }    \n  }\n#endif\n\n  utf8_dest = TRI_LowerAsciiStringZ(zone, src);\n  dstLength = strlen(utf8_dest);\n  return utf8_dest;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Uppercase the characters in a UTF-8 string. \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstring Utf8Helper::toUpperCase (const string& src) {\n  int32_t utf8len = 0;\n  char* utf8 = toupper(TRI_UNKNOWN_MEM_ZONE, src.c_str(), src.length(), utf8len);\n  \n  string result(utf8, utf8len);\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, utf8);\n  return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lowercase the characters in a UTF-8 string.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar* Utf8Helper::toupper (TRI_memory_zone_t* zone, const char *src, int32_t srcLength, int32_t& dstLength) {\n  char* utf8_dest = 0;\n  \n  if (src == 0 || srcLength == 0) {\n    utf8_dest = (char*) TRI_Allocate(zone, sizeof(char), false);\n    utf8_dest[0] = '\\0';\n    dstLength = 0;\n    return utf8_dest;\n  }\n\n#ifdef TRI_HAVE_ICU  \n  uint32_t options = U_FOLD_CASE_DEFAULT;\n  UErrorCode status = U_ZERO_ERROR;\n  \n  string locale = getCollatorLanguage();\n  LocalUCaseMapPointer csm(ucasemap_open(locale.c_str(), options, &status));\n  \n  if (U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in ucasemap_open(...): \" << u_errorName(status);\n  }\n  else {    \n    utf8_dest = (char*) TRI_Allocate(zone, (srcLength+1) * sizeof(char), false);\n      \n    dstLength = ucasemap_utf8ToUpper(csm.getAlias(),\n                    utf8_dest, \n                    srcLength,\n                    src, \n                    srcLength, \n                    &status);\n    \n    if (status == U_BUFFER_OVERFLOW_ERROR) {\n        TRI_Free(zone, utf8_dest);\n        dstLength = dstLength+1;\n        utf8_dest = (char*) TRI_Allocate(zone, dstLength * sizeof(char), false);\n      \n        dstLength = ucasemap_utf8ToUpper(csm.getAlias(),\n                    utf8_dest, \n                    dstLength,\n                    src, \n                    srcLength, \n                    &status);        \n    }\n\n    if (U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in ucasemap_utf8ToUpper(...): \" << u_errorName(status);\n      TRI_Free(zone, utf8_dest);\n    }\n    else {\n      return utf8_dest;\n    }    \n  }\n#endif\n\n  utf8_dest = TRI_LowerAsciiStringZ(zone, src);\n  dstLength = strlen(utf8_dest);\n  return utf8_dest;\n}\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief compare two utf16 strings\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint TR_compare_utf16 (const uint16_t* left, size_t leftLength, const uint16_t* right, size_t rightLength) {  \n  return Utf8Helper::DefaultUtf8Helper.compareUtf16(left, leftLength, right, rightLength);  \n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief compare two utf8 strings\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint TR_compare_utf8 (const char* left, const char* right) {  \n  return Utf8Helper::DefaultUtf8Helper.compareUtf8(left, right);  \n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lowercase the characters in a UTF-8 string (implemented in Basic\/Utf8Helper.cpp)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar* TR_tolower_utf8 (TRI_memory_zone_t* zone, const char *src, int32_t srcLength, int32_t* dstLength) {\n  return Utf8Helper::DefaultUtf8Helper.tolower(zone, src, srcLength, *dstLength);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Uppercase the characters in a UTF-8 string (implemented in Basic\/Utf8Helper.cpp)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar* TR_toupper_utf8 (TRI_memory_zone_t* zone, const char *src, int32_t srcLength, int32_t* dstLength) {\n  return Utf8Helper::DefaultUtf8Helper.toupper(zone, src, srcLength, *dstLength);  \n}\n\n#ifdef __cplusplus\n}\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"^\\\\(\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @addtogroup\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\\\\)\"\n\/\/ End:\n<commit_msg>bugfix<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Utf8\/Utf16 Helper class\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2004-2012 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 Frank Celler\n\/\/\/ @author Achim Brandt\n\/\/\/ @author Copyright 2010-2012, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Utf8Helper.h\"\n\n#ifdef TRI_HAVE_ICU\n#include \"unicode\/normalizer2.h\"\n#include \"unicode\/ucasemap.h\"\n#else\n#include \"string.h\"\n#endif\n\n#include \"Logger\/Logger.h\"\n#include \"BasicsC\/strings.h\"\n\nusing namespace triagens::basics;\nusing namespace std;\n\n\nUtf8Helper Utf8Helper::DefaultUtf8Helper;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                      constructors and destructors\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @addtogroup UTF8\n\/\/\/ @{\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nUtf8Helper::Utf8Helper () : _coll(0) {\n  setCollatorLanguage(\"\");\n}\n\nUtf8Helper::Utf8Helper (const string& lang) : _coll(0) {\n  setCollatorLanguage(lang);\n}\n\nUtf8Helper::~Utf8Helper () {\n  if (_coll) {\n    delete _coll;\n  }\n}\n\n\/*\nint Utf8Helper::compareUtf8 (const char* left, size_t leftLength, const char* right, size_t rightLength) {\n#ifdef TRI_HAVE_ICU  \n  if (!_coll) {\n    LOGGER_ERROR << \"no Collator in Utf8Helper::compareUtf8()!\";\n    return 0;\n  }\n  \n  UErrorCode status = U_ZERO_ERROR;\n  int result = _coll->compareUTF8(StringPiece(left, leftLength), StringPiece(right, rightLength), status);\n  if(U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in Collator::compareUTF8(...): \" << u_errorName(status);\n    return 0;\n  }\n  return result;  \n#else\n  if (leftLength == rightLength) {\n    return memcmp((const void*)left, (const void*)right, leftLength);\n  }\n  \n  int result = memcmp((const void*)left, (const void*)right, leftLength < rightLength ? leftLength : rightLength);\n  \n  if (result == 0) {\n    if (leftLength < rightLength) {\n      return -1;\n    }\n    return 1;\n  }\n  return result;\n#endif\n}\n*\/\n\nint Utf8Helper::compareUtf8 (const char* left, const char* right) {\n#ifdef TRI_HAVE_ICU  \n  if (!_coll) {\n    LOGGER_ERROR << \"no Collator in Utf8Helper::compareUtf8()!\";\n    return (strcmp(left, right));\n  }\n  \n  UErrorCode status = U_ZERO_ERROR;\n  int result = _coll->compareUTF8(StringPiece(left), StringPiece(right), status);\n  if(U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in Collator::compareUTF8(...): \" << u_errorName(status);\n    return (strcmp(left, right));\n  }\n  \n  return result;\n#else\n  return (strcmp(left, right));\n#endif\n}\n\nint Utf8Helper::compareUtf16 (const uint16_t* left, size_t leftLength, const uint16_t* right, size_t rightLength) {  \n#ifdef TRI_HAVE_ICU \n  if (!_coll) {\n    LOGGER_ERROR << \"no Collator in Utf8Helper::compareUtf16()!\";\n#endif  \n    \n    if (leftLength == rightLength) {\n      return memcmp((const void*)left, (const void*)right, leftLength * 2);\n    }\n  \n    int result = memcmp((const void*)left, (const void*)right, leftLength < rightLength ? leftLength * 2 : rightLength * 2);\n  \n    if (result == 0) {\n      if (leftLength < rightLength) {\n        return -1;\n      }\n      return 1;\n    }\n    \n    return result;    \n#ifdef TRI_HAVE_ICU \n  }\n  \n  return _coll->compare((const UChar *)left, leftLength, (const UChar *)right, rightLength);\n#endif  \n}\n\nvoid Utf8Helper::setCollatorLanguage (const string& lang) {\n#ifdef TRI_HAVE_ICU\n  \n  UErrorCode status = U_ZERO_ERROR;   \n    \n  if (_coll) {\n    ULocDataLocaleType type = ULOC_ACTUAL_LOCALE;\n    const Locale& locale = _coll->getLocale(type, status);\n    \n    if(U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in Collator::getLocale(...): \" << u_errorName(status);\n      return;\n    }\n    if (lang == locale.getName()) {\n      return;\n    }\n  }\n  \n  Collator* coll;\n  if (lang == \"\") {\n    \/\/ get default collator for empty language\n    coll = Collator::createInstance(status); \n  }\n  else {\n    Locale locale(lang.c_str());\n    coll = Collator::createInstance(locale, status);     \n  }\n  \n  if(U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in Collator::createInstance(): \" << u_errorName(status);\n    if (coll) {\n      delete coll;\n    }\n    return;\n  }\n  \n  \/\/ set the default attributes for sorting:\n  coll->setAttribute(UCOL_CASE_FIRST, UCOL_UPPER_FIRST, status);  \/\/ A < a\n  coll->setAttribute(UCOL_NORMALIZATION_MODE, UCOL_OFF, status);  \/\/ no normalization\n  coll->setAttribute(UCOL_STRENGTH, UCOL_IDENTICAL, status);      \/\/ UCOL_IDENTICAL, UCOL_PRIMARY, UCOL_SECONDARY, UCOL_TERTIARY\n\n  if(U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in Collator::setAttribute(...): \" << u_errorName(status);\n    delete coll;\n    return;\n  }\n  \n  if (_coll) {\n    delete _coll;\n  }\n\n  _coll = coll;  \n#endif\n}\n\nstring Utf8Helper::getCollatorLanguage () {\n#ifdef TRI_HAVE_ICU\n  if (_coll) {\n    UErrorCode status = U_ZERO_ERROR;\n    ULocDataLocaleType type = ULOC_VALID_LOCALE;\n    const Locale& locale = _coll->getLocale(type, status);\n    \n    if(U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in Collator::getLocale(...): \" << u_errorName(status);\n      return \"\";\n    }\n    return locale.getLanguage();\n  }\n#endif\n  return \"\";\n}\n\nstring Utf8Helper::getCollatorCountry () {\n#ifdef TRI_HAVE_ICU\n  if (_coll) {\n    UErrorCode status = U_ZERO_ERROR;\n    ULocDataLocaleType type = ULOC_VALID_LOCALE;\n    const Locale& locale = _coll->getLocale(type, status);\n    \n    if(U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in Collator::getLocale(...): \" << u_errorName(status);\n      return \"\";\n    }\n    return locale.getCountry();\n  }\n#endif\n  return \"\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lowercase the characters in a UTF-8 string. \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstring Utf8Helper::toLowerCase (const string& src) {\n  int32_t utf8len = 0;\n  char* utf8 = tolower(TRI_UNKNOWN_MEM_ZONE, src.c_str(), src.length(), utf8len);\n  \n  string result(utf8, utf8len);\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, utf8);\n  return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lowercase the characters in a UTF-8 string.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar* Utf8Helper::tolower (TRI_memory_zone_t* zone, const char *src, int32_t srcLength, int32_t& dstLength) {\n  char* utf8_dest = 0;\n  \n  if (src == 0 || srcLength == 0) {\n    utf8_dest = (char*) TRI_Allocate(zone, sizeof(char), false);\n    utf8_dest[0] = '\\0';\n    dstLength = 0;\n    return utf8_dest;\n  }\n\n#ifdef TRI_HAVE_ICU  \n  uint32_t options = U_FOLD_CASE_DEFAULT;\n  UErrorCode status = U_ZERO_ERROR;\n  \n  string locale = getCollatorLanguage();\n  LocalUCaseMapPointer csm(ucasemap_open(locale.c_str(), options, &status));\n  \n  if (U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in ucasemap_open(...): \" << u_errorName(status);\n  }\n  else {    \n    utf8_dest = (char*) TRI_Allocate(zone, (srcLength+1) * sizeof(char), false);\n      \n    dstLength = ucasemap_utf8ToLower(csm.getAlias(),\n                    utf8_dest, \n                    srcLength + 1,\n                    src, \n                    srcLength, \n                    &status);\n    \n    if (status == U_BUFFER_OVERFLOW_ERROR) {\n      status = U_ZERO_ERROR;\n      TRI_Free(zone, utf8_dest);\n      utf8_dest = (char*) TRI_Allocate(zone, (dstLength + 1) * sizeof(char), false);\n      \n      dstLength = ucasemap_utf8ToLower(csm.getAlias(),\n                    utf8_dest, \n                    dstLength + 1,\n                    src, \n                    srcLength, \n                    &status);        \n    }\n\n    if (U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in ucasemap_utf8ToLower(...): \" << u_errorName(status);\n      TRI_Free(zone, utf8_dest);\n    }\n    else {\n      return utf8_dest;\n    }    \n  }\n#endif\n\n  utf8_dest = TRI_LowerAsciiStringZ(zone, src);\n  dstLength = strlen(utf8_dest);\n  return utf8_dest;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Uppercase the characters in a UTF-8 string. \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstring Utf8Helper::toUpperCase (const string& src) {\n  int32_t utf8len = 0;\n  char* utf8 = toupper(TRI_UNKNOWN_MEM_ZONE, src.c_str(), src.length(), utf8len);\n  \n  string result(utf8, utf8len);\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, utf8);\n  return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lowercase the characters in a UTF-8 string.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar* Utf8Helper::toupper (TRI_memory_zone_t* zone, const char *src, int32_t srcLength, int32_t& dstLength) {\n  char* utf8_dest = 0;\n  \n  if (src == 0 || srcLength == 0) {\n    utf8_dest = (char*) TRI_Allocate(zone, sizeof(char), false);\n    utf8_dest[0] = '\\0';\n    dstLength = 0;\n    return utf8_dest;\n  }\n\n#ifdef TRI_HAVE_ICU  \n  uint32_t options = U_FOLD_CASE_DEFAULT;\n  UErrorCode status = U_ZERO_ERROR;\n  \n  string locale = getCollatorLanguage();\n  LocalUCaseMapPointer csm(ucasemap_open(locale.c_str(), options, &status));\n  \n  if (U_FAILURE(status)) {\n    LOGGER_ERROR << \"error in ucasemap_open(...): \" << u_errorName(status);\n  }\n  else {    \n    utf8_dest = (char*) TRI_Allocate(zone, (srcLength+1) * sizeof(char), false);\n      \n    dstLength = ucasemap_utf8ToUpper(csm.getAlias(),\n                    utf8_dest, \n                    srcLength,\n                    src, \n                    srcLength, \n                    &status);\n    \n    if (status == U_BUFFER_OVERFLOW_ERROR) {\n      status = U_ZERO_ERROR;\n      TRI_Free(zone, utf8_dest);\n      utf8_dest = (char*) TRI_Allocate(zone, (dstLength + 1) * sizeof(char), false);\n      \n      dstLength = ucasemap_utf8ToUpper(csm.getAlias(),\n                    utf8_dest, \n                    dstLength + 1,\n                    src, \n                    srcLength, \n                    &status);        \n    }\n\n    if (U_FAILURE(status)) {\n      LOGGER_ERROR << \"error in ucasemap_utf8ToUpper(...): \" << u_errorName(status);\n      TRI_Free(zone, utf8_dest);\n    }\n    else {\n      return utf8_dest;\n    }    \n  }\n#endif\n\n  utf8_dest = TRI_UpperAsciiStringZ(zone, src);\n  dstLength = strlen(utf8_dest);\n  return utf8_dest;\n}\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief compare two utf16 strings\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint TR_compare_utf16 (const uint16_t* left, size_t leftLength, const uint16_t* right, size_t rightLength) {  \n  return Utf8Helper::DefaultUtf8Helper.compareUtf16(left, leftLength, right, rightLength);  \n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief compare two utf8 strings\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint TR_compare_utf8 (const char* left, const char* right) {  \n  return Utf8Helper::DefaultUtf8Helper.compareUtf8(left, right);  \n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lowercase the characters in a UTF-8 string (implemented in Basic\/Utf8Helper.cpp)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar* TR_tolower_utf8 (TRI_memory_zone_t* zone, const char *src, int32_t srcLength, int32_t* dstLength) {\n  return Utf8Helper::DefaultUtf8Helper.tolower(zone, src, srcLength, *dstLength);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Uppercase the characters in a UTF-8 string (implemented in Basic\/Utf8Helper.cpp)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar* TR_toupper_utf8 (TRI_memory_zone_t* zone, const char *src, int32_t srcLength, int32_t* dstLength) {\n  return Utf8Helper::DefaultUtf8Helper.toupper(zone, src, srcLength, *dstLength);  \n}\n\n#ifdef __cplusplus\n}\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"^\\\\(\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @addtogroup\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\\\\)\"\n\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012 Sacha Refshauge\n *\n *\/\n\/\/ Qt 4.7+ \/ 5.0+ implementation of the framework.\n\/\/ Currently supports: Android, Symbian, Blackberry, Maemo\/Meego, Linux, Windows, Mac OSX\n\n#include <QApplication>\n#include <QUrl>\n#include <QDir>\n#include <QDesktopWidget>\n#include <QDesktopServices>\n#include <QLocale>\n#include <QThread>\n\n#if QT_VERSION > QT_VERSION_CHECK(5, 0, 0)\n#include <QStandardPaths>\n#ifdef QT_HAS_SYSTEMINFO\n#include <QScreenSaver>\n#endif\n#endif\n\n#ifdef __SYMBIAN32__\n#include <QSystemScreenSaver>\n#include <QFeedbackHapticsEffect>\n#include \"SymbianMediaKeys.h\"\n#endif\n#ifdef QT_HAS_SDL\n#include \"SDL\/SDLJoystick.h\"\n#include \"SDL_audio.h\"\n#endif\n#include \"QtMain.h\"\n#include \"math\/math_util.h\"\n\n#include <string.h>\n\nInputState* input_state;\n\n#ifdef QT_HAS_SDL\nextern void mixaudio(void *userdata, Uint8 *stream, int len) {\n\tNativeMix((short *)stream, len \/ 4);\n}\n#endif\n\nstd::string System_GetProperty(SystemProperty prop) {\n\tswitch (prop) {\n\tcase SYSPROP_NAME:\n#ifdef __SYMBIAN32__\n\t\treturn \"Qt:Symbian\";\n#elif defined(BLACKBERRY)\n\t\treturn \"Qt:Blackberry\";\n#elif defined(MAEMO)\n\t\treturn \"Qt:Maemo\";\n#elif defined(ANDROID)\n\t\treturn \"Qt:Android\";\n#elif defined(Q_OS_LINUX)\n\t\treturn \"Qt:Linux\";\n#elif defined(_WIN32)\n\t\treturn \"Qt:Windows\";\n#elif defined(Q_OS_MAC)\n\t\treturn \"Qt:Mac\";\n#else\n\t\treturn \"Qt\";\n#endif\n\tcase SYSPROP_LANGREGION:\n\t\treturn QLocale::system().name().toStdString();\n\tdefault:\n\t\treturn \"\";\n\t}\n}\n\nint System_GetPropertyInt(SystemProperty prop) {return -1;}\n\nvoid System_SendMessage(const char *command, const char *parameter) {\n\tif (!strcmp(command, \"finish\")) {\n\t\tqApp->exit(0);\n\t}\n}\n\nbool System_InputBoxGetString(const char *title, const char *defaultValue, char *outValue, size_t outLength)\n{\n\tQString text = emugl->InputBoxGetQString(QString(title), QString(defaultValue));\n\tif (text.isEmpty())\n\t\treturn false;\n\tstrcpy(outValue, text.toStdString().c_str());\n\treturn true;\n}\n\nvoid Vibrate(int length_ms) {\n\tif (length_ms == -1 || length_ms == -3)\n\t\tlength_ms = 50;\n\telse if (length_ms == -2)\n\t\tlength_ms = 25;\n\t\/\/ Symbian only for now\n#if defined(__SYMBIAN32__)\n\tQFeedbackHapticsEffect effect;\n\teffect.setIntensity(0.8);\n\teffect.setDuration(length_ms);\n\teffect.start();\n#endif\n}\n\nvoid LaunchBrowser(const char *url)\n{\n\tQDesktopServices::openUrl(QUrl(url));\n}\n\nfloat CalculateDPIScale()\n{\n\t\/\/ Sane default rather than check DPI\n#ifdef __SYMBIAN32__\n\treturn 1.4f;\n#elif defined(USING_GLES2)\n\treturn 1.2f;\n#else\n\treturn 1.0f;\n#endif\n}\n\nstatic int mainInternal(QApplication &a)\n{\n#ifdef MOBILE_DEVICE\n\temugl = new MainUI();\n\temugl->resize(pixel_xres, pixel_yres);\n\temugl->showFullScreen();\n#endif\n\tEnableFZ();\n\t\/\/ Disable screensaver\n#ifdef __SYMBIAN32__\n\tQSystemScreenSaver ssObject(emugl);\n\tssObject.setScreenSaverInhibit();\n\tQScopedPointer<SymbianMediaKeys> mediakeys(new SymbianMediaKeys());\n#elif defined(QT_HAS_SYSTEMINFO)\n\tQScreenSaver ssObject(emugl);\n\tssObject.setScreenSaverEnabled(false);\n#endif\n\n#ifdef QT_HAS_SDL\n\tSDLJoystick joy(true);\n\tjoy.startEventLoop();\n\tSDL_Init(SDL_INIT_AUDIO);\n\tSDL_AudioSpec fmt, ret_fmt;\n\tmemset(&fmt, 0, sizeof(fmt));\n\tfmt.freq = 44100;\n\tfmt.format = AUDIO_S16;\n\tfmt.channels = 2;\n\tfmt.samples = 2048;\n\tfmt.callback = &mixaudio;\n\tfmt.userdata = (void *)0;\n\n\tif (SDL_OpenAudio(&fmt, &ret_fmt) < 0) {\n\t\tELOG(\"Failed to open audio: %s\", SDL_GetError());\n\t} else {\n\t\tif (ret_fmt.samples != fmt.samples) \/\/ Notify, but still use it\n\t\t\tELOG(\"Output audio samples: %d (requested: %d)\", ret_fmt.samples, fmt.samples);\n\t\tif (ret_fmt.freq != fmt.freq || ret_fmt.format != fmt.format || ret_fmt.channels != fmt.channels) {\n\t\t\tELOG(\"Sound buffer format does not match requested format.\");\n\t\t\tELOG(\"Output audio freq: %d (requested: %d)\", ret_fmt.freq, fmt.freq);\n\t\t\tELOG(\"Output audio format: %d (requested: %d)\", ret_fmt.format, fmt.format);\n\t\t\tELOG(\"Output audio channels: %d (requested: %d)\", ret_fmt.channels, fmt.channels);\n\t\t\tELOG(\"Provided output format does not match requirement, turning audio off\");\n\t\t\tSDL_CloseAudio();\n\t\t}\n\t}\n\n\t\/\/ Audio must be unpaused _after_ NativeInit()\n\tSDL_PauseAudio(0);\n#else\n\tQScopedPointer<QThread> thread(new QThread);\n\tQScopedPointer<MainAudio> audio(new MainAudio());\n\taudio->moveToThread(thread.data());\n\tQObject::connect(thread.data(), SIGNAL(started()), audio.data(), SLOT(run()));\n\tthread->start();\n#endif\n\tint ret = a.exec();\n#ifndef QT_HAS_SDL\n\tthread->quit();\n#endif\n\treturn ret;\n}\n\n#ifndef QT_HAS_SDL\nQ_DECL_EXPORT\n#endif\nint main(int argc, char *argv[])\n{\n#if defined(Q_OS_LINUX) && !defined(MAEMO)\n\tQApplication::setAttribute(Qt::AA_X11InitThreads, true);\n#endif\n\tQApplication a(argc, argv);\n\tQSize res = QApplication::desktop()->screenGeometry().size();\n\tif (res.width() < res.height())\n\t\tres.transpose();\n\tpixel_xres = res.width();\n\tpixel_yres = res.height();\n\tg_dpi_scale = CalculateDPIScale();\n\tdp_xres = (int)(pixel_xres * g_dpi_scale); dp_yres = (int)(pixel_yres * g_dpi_scale);\n\tnet::Init();\n\tstd::string savegame_dir = \".\";\n\tstd::string assets_dir = \".\";\n#if QT_VERSION > QT_VERSION_CHECK(5, 0, 0)\n\tsavegame_dir = QStandardPaths::writableLocation(QStandardPaths::HomeLocation).toStdString();\n\tassets_dir = QStandardPaths::writableLocation(QStandardPaths::DataLocation).toStdString();\n#elif defined(__SYMBIAN32__)\n\tsavegame_dir = \"E:\/PPSSPP\";\n\tassets_dir = \"E:\/PPSSPP\";\n#elif defined(BLACKBERRY)\n\tsavegame_dir = \"\/accounts\/1000\/shared\/misc\";\n\tassets_dir = \"app\/native\/assets\";\n#elif defined(MAEMO)\n\tsavegame_dir = \"\/home\/user\/MyDocs\/PPSSPP\";\n\tassets_dir = \"\/opt\/PPSSPP\";\n#endif\n\tsavegame_dir += \"\/\";\n\tassets_dir += \"\/\";\n\tNativeInit(argc, (const char **)argv, savegame_dir.c_str(), assets_dir.c_str(), \"BADCOFFEE\");\n\n\tint ret = mainInternal(a);\n\n#ifndef MOBILE_DEVICE\n\texit(0);\n#endif\n\tNativeShutdownGraphics();\n#ifdef QT_HAS_SDL\n\tSDL_PauseAudio(1);\n\tSDL_CloseAudio();\n#endif\n\tNativeShutdown();\n\tnet::Shutdown();\n\treturn ret;\n}\n\n<commit_msg>Qt: Terminate the thread instead of quitting. Stops an annoying popup on OSX and should speed up exit on systems that didn't like the thread still running.<commit_after>\/*\n * Copyright (c) 2012 Sacha Refshauge\n *\n *\/\n\/\/ Qt 4.7+ \/ 5.0+ implementation of the framework.\n\/\/ Currently supports: Android, Symbian, Blackberry, Maemo\/Meego, Linux, Windows, Mac OSX\n\n#include <QApplication>\n#include <QUrl>\n#include <QDir>\n#include <QDesktopWidget>\n#include <QDesktopServices>\n#include <QLocale>\n#include <QThread>\n\n#if QT_VERSION > QT_VERSION_CHECK(5, 0, 0)\n#include <QStandardPaths>\n#ifdef QT_HAS_SYSTEMINFO\n#include <QScreenSaver>\n#endif\n#endif\n\n#ifdef __SYMBIAN32__\n#include <QSystemScreenSaver>\n#include <QFeedbackHapticsEffect>\n#include \"SymbianMediaKeys.h\"\n#endif\n#ifdef QT_HAS_SDL\n#include \"SDL\/SDLJoystick.h\"\n#include \"SDL_audio.h\"\n#endif\n#include \"QtMain.h\"\n#include \"math\/math_util.h\"\n\n#include <string.h>\n\nInputState* input_state;\n\n#ifdef QT_HAS_SDL\nextern void mixaudio(void *userdata, Uint8 *stream, int len) {\n\tNativeMix((short *)stream, len \/ 4);\n}\n#endif\n\nstd::string System_GetProperty(SystemProperty prop) {\n\tswitch (prop) {\n\tcase SYSPROP_NAME:\n#ifdef __SYMBIAN32__\n\t\treturn \"Qt:Symbian\";\n#elif defined(BLACKBERRY)\n\t\treturn \"Qt:Blackberry\";\n#elif defined(MAEMO)\n\t\treturn \"Qt:Maemo\";\n#elif defined(ANDROID)\n\t\treturn \"Qt:Android\";\n#elif defined(Q_OS_LINUX)\n\t\treturn \"Qt:Linux\";\n#elif defined(_WIN32)\n\t\treturn \"Qt:Windows\";\n#elif defined(Q_OS_MAC)\n\t\treturn \"Qt:Mac\";\n#else\n\t\treturn \"Qt\";\n#endif\n\tcase SYSPROP_LANGREGION:\n\t\treturn QLocale::system().name().toStdString();\n\tdefault:\n\t\treturn \"\";\n\t}\n}\n\nint System_GetPropertyInt(SystemProperty prop) {return -1;}\n\nvoid System_SendMessage(const char *command, const char *parameter) {\n\tif (!strcmp(command, \"finish\")) {\n\t\tqApp->exit(0);\n\t}\n}\n\nbool System_InputBoxGetString(const char *title, const char *defaultValue, char *outValue, size_t outLength)\n{\n\tQString text = emugl->InputBoxGetQString(QString(title), QString(defaultValue));\n\tif (text.isEmpty())\n\t\treturn false;\n\tstrcpy(outValue, text.toStdString().c_str());\n\treturn true;\n}\n\nvoid Vibrate(int length_ms) {\n\tif (length_ms == -1 || length_ms == -3)\n\t\tlength_ms = 50;\n\telse if (length_ms == -2)\n\t\tlength_ms = 25;\n\t\/\/ Symbian only for now\n#if defined(__SYMBIAN32__)\n\tQFeedbackHapticsEffect effect;\n\teffect.setIntensity(0.8);\n\teffect.setDuration(length_ms);\n\teffect.start();\n#endif\n}\n\nvoid LaunchBrowser(const char *url)\n{\n\tQDesktopServices::openUrl(QUrl(url));\n}\n\nfloat CalculateDPIScale()\n{\n\t\/\/ Sane default rather than check DPI\n#ifdef __SYMBIAN32__\n\treturn 1.4f;\n#elif defined(USING_GLES2)\n\treturn 1.2f;\n#else\n\treturn 1.0f;\n#endif\n}\n\nstatic int mainInternal(QApplication &a)\n{\n#ifdef MOBILE_DEVICE\n\temugl = new MainUI();\n\temugl->resize(pixel_xres, pixel_yres);\n\temugl->showFullScreen();\n#endif\n\tEnableFZ();\n\t\/\/ Disable screensaver\n#ifdef __SYMBIAN32__\n\tQSystemScreenSaver ssObject(emugl);\n\tssObject.setScreenSaverInhibit();\n\tQScopedPointer<SymbianMediaKeys> mediakeys(new SymbianMediaKeys());\n#elif defined(QT_HAS_SYSTEMINFO)\n\tQScreenSaver ssObject(emugl);\n\tssObject.setScreenSaverEnabled(false);\n#endif\n\n#ifdef QT_HAS_SDL\n\tSDLJoystick joy(true);\n\tjoy.startEventLoop();\n\tSDL_Init(SDL_INIT_AUDIO);\n\tSDL_AudioSpec fmt, ret_fmt;\n\tmemset(&fmt, 0, sizeof(fmt));\n\tfmt.freq = 44100;\n\tfmt.format = AUDIO_S16;\n\tfmt.channels = 2;\n\tfmt.samples = 2048;\n\tfmt.callback = &mixaudio;\n\tfmt.userdata = (void *)0;\n\n\tif (SDL_OpenAudio(&fmt, &ret_fmt) < 0) {\n\t\tELOG(\"Failed to open audio: %s\", SDL_GetError());\n\t} else {\n\t\tif (ret_fmt.samples != fmt.samples) \/\/ Notify, but still use it\n\t\t\tELOG(\"Output audio samples: %d (requested: %d)\", ret_fmt.samples, fmt.samples);\n\t\tif (ret_fmt.freq != fmt.freq || ret_fmt.format != fmt.format || ret_fmt.channels != fmt.channels) {\n\t\t\tELOG(\"Sound buffer format does not match requested format.\");\n\t\t\tELOG(\"Output audio freq: %d (requested: %d)\", ret_fmt.freq, fmt.freq);\n\t\t\tELOG(\"Output audio format: %d (requested: %d)\", ret_fmt.format, fmt.format);\n\t\t\tELOG(\"Output audio channels: %d (requested: %d)\", ret_fmt.channels, fmt.channels);\n\t\t\tELOG(\"Provided output format does not match requirement, turning audio off\");\n\t\t\tSDL_CloseAudio();\n\t\t}\n\t}\n\n\t\/\/ Audio must be unpaused _after_ NativeInit()\n\tSDL_PauseAudio(0);\n#else\n\tQScopedPointer<QThread> thread(new QThread);\n\tQScopedPointer<MainAudio> audio(new MainAudio());\n\taudio->moveToThread(thread.data());\n\tQObject::connect(thread.data(), SIGNAL(started()), audio.data(), SLOT(run()));\n\tthread->start();\n#endif\n\tint ret = a.exec();\n#ifndef QT_HAS_SDL\n\tthread->terminate();\n#endif\n\treturn ret;\n}\n\n#ifndef QT_HAS_SDL\nQ_DECL_EXPORT\n#endif\nint main(int argc, char *argv[])\n{\n#if defined(Q_OS_LINUX) && !defined(MAEMO)\n\tQApplication::setAttribute(Qt::AA_X11InitThreads, true);\n#endif\n\tQApplication a(argc, argv);\n\tQSize res = QApplication::desktop()->screenGeometry().size();\n\tif (res.width() < res.height())\n\t\tres.transpose();\n\tpixel_xres = res.width();\n\tpixel_yres = res.height();\n\tg_dpi_scale = CalculateDPIScale();\n\tdp_xres = (int)(pixel_xres * g_dpi_scale); dp_yres = (int)(pixel_yres * g_dpi_scale);\n\tnet::Init();\n\tstd::string savegame_dir = \".\";\n\tstd::string assets_dir = \".\";\n#if QT_VERSION > QT_VERSION_CHECK(5, 0, 0)\n\tsavegame_dir = QStandardPaths::writableLocation(QStandardPaths::HomeLocation).toStdString();\n\tassets_dir = QStandardPaths::writableLocation(QStandardPaths::DataLocation).toStdString();\n#elif defined(__SYMBIAN32__)\n\tsavegame_dir = \"E:\/PPSSPP\";\n\tassets_dir = \"E:\/PPSSPP\";\n#elif defined(BLACKBERRY)\n\tsavegame_dir = \"\/accounts\/1000\/shared\/misc\";\n\tassets_dir = \"app\/native\/assets\";\n#elif defined(MAEMO)\n\tsavegame_dir = \"\/home\/user\/MyDocs\/PPSSPP\";\n\tassets_dir = \"\/opt\/PPSSPP\";\n#endif\n\tsavegame_dir += \"\/\";\n\tassets_dir += \"\/\";\n\tNativeInit(argc, (const char **)argv, savegame_dir.c_str(), assets_dir.c_str(), \"BADCOFFEE\");\n\n\tint ret = mainInternal(a);\n\n#ifndef MOBILE_DEVICE\n\texit(0);\n#endif\n\tNativeShutdownGraphics();\n#ifdef QT_HAS_SDL\n\tSDL_PauseAudio(1);\n\tSDL_CloseAudio();\n#endif\n\tNativeShutdown();\n\tnet::Shutdown();\n\treturn ret;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- llvm\/CodeGen\/AsmStream.cpp - AsmStream Framework --------*- 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 instantiations of \"standard\" AsmOStreams.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/AsmStream.h\"\n\n#include <unistd.h>\n\nnamespace llvm {\n  raw_asm_fd_ostream asmouts(STDOUT_FILENO, false);\n  raw_asm_fd_ostream asmerrs(STDERR_FILENO, false);\n}\n<commit_msg><commit_after>\/\/===-- llvm\/CodeGen\/AsmStream.cpp - AsmStream Framework --------*- 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 instantiations of \"standard\" AsmOStreams.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/AsmStream.h\"\n\nnamespace llvm {\n  raw_asm_fd_ostream asmouts(STDOUT_FILENO, false);\n  raw_asm_fd_ostream asmerrs(STDERR_FILENO, false);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012 Sacha Refshauge\n *\n *\/\n\/\/ Qt 4.7+ \/ 5.0+ implementation of the framework.\n\/\/ Currently supports: Symbian, Blackberry, Maemo\/Meego, Linux, Windows, Mac OSX\n\n#include <QApplication>\n#include <QUrl>\n#include <QDir>\n#include <QDesktopWidget>\n#include <QDesktopServices>\n#include <QLocale>\n#include <QThread>\n\n#ifdef ANDROID\n#include <QStandardPaths>\n#endif\n\n#ifdef __SYMBIAN32__\n#include <e32std.h>\n#include <QSystemScreenSaver>\n#include <QFeedbackHapticsEffect>\n#include \"SymbianMediaKeys.h\"\n#endif\n#ifdef QT_HAS_SDL\n#include \"SDL\/SDLJoystick.h\"\n#endif\n#include \"QtMain.h\"\n\n#include <string.h>\n\nInputState* input_state;\n\nstd::string System_GetProperty(SystemProperty prop) {\n\tswitch (prop) {\n\tcase SYSPROP_NAME:\n#ifdef __SYMBIAN32__\n\t\treturn \"Qt:Symbian\";\n#elif defined(BLACKBERRY)\n\t\treturn \"Qt:Blackberry\";\n#elif defined(MAEMO)\n\t\treturn \"Qt:Maemo\";\n#elif defined(ANDROID)\n\t\treturn \"Qt:Android\";\n#elif defined(Q_OS_LINUX)\n\t\treturn \"Qt:Linux\";\n#elif defined(_WIN32)\n\t\treturn \"Qt:Windows\";\n#elif defined(Q_OS_MAC)\n\t\treturn \"Qt:Mac\";\n#else\n\t\treturn \"Qt\";\n#endif\n\tcase SYSPROP_LANGREGION:\n\t\treturn QLocale::system().name().toStdString();\n\tdefault:\n\t\treturn \"\";\n\t}\n}\n\nvoid System_SendMessage(const char *command, const char *parameter) {\n\tif (!strcmp(command, \"finish\")) {\n\t\tqApp->exit(0);\n\t}\n}\n\nbool System_InputBoxGetString(const char *title, const char *defaultValue, char *outValue, size_t outLength)\n{\n\tQString text = emugl->InputBoxGetQString(QString(title), QString(defaultValue));\n\tif (text.isEmpty())\n\t\treturn false;\n\tstrcpy(outValue, text.toStdString().c_str());\n\treturn true;\n}\n\nvoid Vibrate(int length_ms) {\n\tif (length_ms == -1 || length_ms == -3)\n\t\tlength_ms = 50;\n\telse if (length_ms == -2)\n\t\tlength_ms = 25;\n\t\/\/ Symbian only for now\n#if defined(__SYMBIAN32__)\n\tQFeedbackHapticsEffect effect;\n\teffect.setIntensity(0.8);\n\teffect.setDuration(length_ms);\n\teffect.start();\n#endif\n}\n\nvoid LaunchBrowser(const char *url)\n{\n\tQDesktopServices::openUrl(QUrl(url));\n}\n\nfloat CalculateDPIScale()\n{\n\t\/\/ Sane default rather than check DPI\n#ifdef __SYMBIAN32__\n\treturn 1.4f;\n#elif defined(USING_GLES2)\n\treturn 1.2f;\n#else\n\treturn 1.0f;\n#endif\n}\n\nstatic int mainInternal(QApplication &a)\n{\n#ifdef MOBILE_DEVICE\n\temugl = new MainUI();\n\temugl->resize(pixel_xres, pixel_yres);\n\temugl->showFullScreen();\n#endif\n#ifdef __SYMBIAN32__\n\t\/\/ Set RunFast hardware mode for VFPv2.\n\tUser::SetFloatingPointMode(EFpModeRunFast);\n\t\/\/ Disable screensaver\n\tQScopedPointer<QSystemScreenSaver> ssObject(new QSystemScreenSaver(emugl));\n\tssObject->setScreenSaverInhibit();\n\tQScopedPointer<SymbianMediaKeys> mediakeys(new SymbianMediaKeys());\n#endif\n\n\tQScopedPointer<QThread> thread(new QThread);\n\tQScopedPointer<MainAudio> audio(new MainAudio());\n\taudio->moveToThread(thread.data());\n\tQObject::connect(thread.data(), SIGNAL(started()), audio.data(), SLOT(run()));\n\tthread->start();\n\n#ifdef QT_HAS_SDL\n\tSDLJoystick joy(true);\n\tjoy.startEventLoop();\n#endif\n\tint ret = a.exec();\n\tthread->quit();\n\treturn ret;\n}\n\n#ifndef QT_HAS_SDL\nQ_DECL_EXPORT\n#endif\nint main(int argc, char *argv[])\n{\n#if defined(Q_OS_LINUX) && !defined(MAEMO)\n\tQApplication::setAttribute(Qt::AA_X11InitThreads, true);\n#endif\n\tQApplication a(argc, argv);\n\tQSize res = QApplication::desktop()->screenGeometry().size();\n\tif (res.width() < res.height())\n\t\tres.transpose();\n\tpixel_xres = res.width();\n\tpixel_yres = res.height();\n\tg_dpi_scale = CalculateDPIScale();\n\tdp_xres = (int)(pixel_xres * g_dpi_scale); dp_yres = (int)(pixel_yres * g_dpi_scale);\n\tnet::Init();\n#ifdef __SYMBIAN32__\n\tconst char *savegame_dir = \"E:\/PPSSPP\/\";\n\tconst char *assets_dir = \"E:\/PPSSPP\/\";\n#elif defined(BLACKBERRY)\n\tconst char *savegame_dir = \"\/accounts\/1000\/shared\/misc\/\";\n\tconst char *assets_dir = \"app\/native\/assets\/\";\n#elif defined(MAEMO)\n\tconst char *savegame_dir = \"\/home\/user\/MyDocs\/PPSSPP\/\";\n\tconst char *assets_dir = \"\/opt\/PPSSPP\/\";\n#elif defined(ANDROID)\n\tconst char *savegame_dir = QStandardPaths::standardLocations(QStandardPaths::HomeLocation).at(0).toStdString().c_str();\n\tconst char *assets_dir = QStandardPaths::standardLocations(QStandardPaths::GenericDataLocation).at(0).toStdString().c_str();\n\tsetenv(\"QT_USE_ANDROID_NATIVE_DIALOGS\", \"1\", 1); \/\/ Which Qt version does this need?\n#else\n\tconst char *savegame_dir = \".\/\";\n\tconst char *assets_dir = \".\/\";\n#endif\n\tNativeInit(argc, (const char **)argv, savegame_dir, assets_dir, \"BADCOFFEE\");\n\n\tint ret = mainInternal(a);\n\n\tNativeShutdown();\n\tnet::Shutdown();\n\treturn ret;\n}\n\n<commit_msg>Qt: Use SDL Audio where available. Should give consistent audio amongst Linux platforms.<commit_after>\/*\n * Copyright (c) 2012 Sacha Refshauge\n *\n *\/\n\/\/ Qt 4.7+ \/ 5.0+ implementation of the framework.\n\/\/ Currently supports: Symbian, Blackberry, Maemo\/Meego, Linux, Windows, Mac OSX\n\n#include <QApplication>\n#include <QUrl>\n#include <QDir>\n#include <QDesktopWidget>\n#include <QDesktopServices>\n#include <QLocale>\n#include <QThread>\n\n#ifdef ANDROID\n#include <QStandardPaths>\n#endif\n\n#ifdef __SYMBIAN32__\n#include <e32std.h>\n#include <QSystemScreenSaver>\n#include <QFeedbackHapticsEffect>\n#include \"SymbianMediaKeys.h\"\n#endif\n#ifdef QT_HAS_SDL\n#include \"SDL\/SDLJoystick.h\"\n#include \"SDL_audio.h\"\n#endif\n#include \"QtMain.h\"\n\n#include <string.h>\n\nInputState* input_state;\n\n#ifdef QT_HAS_SDL\nextern void mixaudio(void *userdata, Uint8 *stream, int len) {\n\tNativeMix((short *)stream, len \/ 4);\n}\n#endif\n\nstd::string System_GetProperty(SystemProperty prop) {\n\tswitch (prop) {\n\tcase SYSPROP_NAME:\n#ifdef __SYMBIAN32__\n\t\treturn \"Qt:Symbian\";\n#elif defined(BLACKBERRY)\n\t\treturn \"Qt:Blackberry\";\n#elif defined(MAEMO)\n\t\treturn \"Qt:Maemo\";\n#elif defined(ANDROID)\n\t\treturn \"Qt:Android\";\n#elif defined(Q_OS_LINUX)\n\t\treturn \"Qt:Linux\";\n#elif defined(_WIN32)\n\t\treturn \"Qt:Windows\";\n#elif defined(Q_OS_MAC)\n\t\treturn \"Qt:Mac\";\n#else\n\t\treturn \"Qt\";\n#endif\n\tcase SYSPROP_LANGREGION:\n\t\treturn QLocale::system().name().toStdString();\n\tdefault:\n\t\treturn \"\";\n\t}\n}\n\nvoid System_SendMessage(const char *command, const char *parameter) {\n\tif (!strcmp(command, \"finish\")) {\n\t\tqApp->exit(0);\n\t}\n}\n\nbool System_InputBoxGetString(const char *title, const char *defaultValue, char *outValue, size_t outLength)\n{\n\tQString text = emugl->InputBoxGetQString(QString(title), QString(defaultValue));\n\tif (text.isEmpty())\n\t\treturn false;\n\tstrcpy(outValue, text.toStdString().c_str());\n\treturn true;\n}\n\nvoid Vibrate(int length_ms) {\n\tif (length_ms == -1 || length_ms == -3)\n\t\tlength_ms = 50;\n\telse if (length_ms == -2)\n\t\tlength_ms = 25;\n\t\/\/ Symbian only for now\n#if defined(__SYMBIAN32__)\n\tQFeedbackHapticsEffect effect;\n\teffect.setIntensity(0.8);\n\teffect.setDuration(length_ms);\n\teffect.start();\n#endif\n}\n\nvoid LaunchBrowser(const char *url)\n{\n\tQDesktopServices::openUrl(QUrl(url));\n}\n\nfloat CalculateDPIScale()\n{\n\t\/\/ Sane default rather than check DPI\n#ifdef __SYMBIAN32__\n\treturn 1.4f;\n#elif defined(USING_GLES2)\n\treturn 1.2f;\n#else\n\treturn 1.0f;\n#endif\n}\n\nstatic int mainInternal(QApplication &a)\n{\n#ifdef MOBILE_DEVICE\n\temugl = new MainUI();\n\temugl->resize(pixel_xres, pixel_yres);\n\temugl->showFullScreen();\n#endif\n#ifdef __SYMBIAN32__\n\t\/\/ Set RunFast hardware mode for VFPv2.\n\tUser::SetFloatingPointMode(EFpModeRunFast);\n\t\/\/ Disable screensaver\n\tQScopedPointer<QSystemScreenSaver> ssObject(new QSystemScreenSaver(emugl));\n\tssObject->setScreenSaverInhibit();\n\tQScopedPointer<SymbianMediaKeys> mediakeys(new SymbianMediaKeys());\n#endif\n\n#ifdef QT_HAS_SDL\n\tSDLJoystick joy(true);\n\tjoy.startEventLoop();\n\tSDL_Init(SDL_INIT_AUDIO);\n\tSDL_AudioSpec fmt, ret_fmt;\n\tmemset(&fmt, 0, sizeof(fmt));\n\tfmt.freq = 44100;\n\tfmt.format = AUDIO_S16;\n\tfmt.channels = 2;\n\tfmt.samples = 2048;\n\tfmt.callback = &mixaudio;\n\tfmt.userdata = (void *)0;\n\n\tif (SDL_OpenAudio(&fmt, &ret_fmt) < 0) {\n\t\tELOG(\"Failed to open audio: %s\", SDL_GetError());\n\t} else {\n\t\tif (ret_fmt.freq != 44100 || ret_fmt.format != AUDIO_S16 || ret_fmt.channels != 2 || fmt.samples != 2048) {\n\t\t\tELOG(\"Sound buffer format does not match requested format.\");\n\t\t\tELOG(\"Output audio freq: %d (requested: %d)\", ret_fmt.freq, 44100);\n\t\t\tELOG(\"Output audio format: %d (requested: %d)\", ret_fmt.format, AUDIO_S16);\n\t\t\tELOG(\"Output audio channels: %d (requested: %d)\", ret_fmt.channels, 2);\n\t\t\tELOG(\"Output audio samples: %d (requested: %d)\", ret_fmt.samples, 2048);\n\t\t}\n\n\t\tif (ret_fmt.freq != 44100 || ret_fmt.format != AUDIO_S16 || ret_fmt.channels != 2) {\n\t\t\tELOG(\"Provided output format does not match requirement, turning audio off\");\n\t\t\tSDL_CloseAudio();\n\t\t} else {\n\t\t\tELOG(\"Provided output audio format is usable, thus using it\");\n\t\t}\n\t}\n\n\t\/\/ Audio must be unpaused _after_ NativeInit()\n\tSDL_PauseAudio(0);\n#else\n\tQScopedPointer<QThread> thread(new QThread);\n\tQScopedPointer<MainAudio> audio(new MainAudio());\n\taudio->moveToThread(thread.data());\n\tQObject::connect(thread.data(), SIGNAL(started()), audio.data(), SLOT(run()));\n\tthread->start();\n#endif\n\tint ret = a.exec();\n#ifndef QT_HAS_SDL\n\tthread->quit();\n#endif\n\treturn ret;\n}\n\n#ifndef QT_HAS_SDL\nQ_DECL_EXPORT\n#endif\nint main(int argc, char *argv[])\n{\n#if defined(Q_OS_LINUX) && !defined(MAEMO)\n\tQApplication::setAttribute(Qt::AA_X11InitThreads, true);\n#endif\n\tQApplication a(argc, argv);\n\tQSize res = QApplication::desktop()->screenGeometry().size();\n\tif (res.width() < res.height())\n\t\tres.transpose();\n\tpixel_xres = res.width();\n\tpixel_yres = res.height();\n\tg_dpi_scale = CalculateDPIScale();\n\tdp_xres = (int)(pixel_xres * g_dpi_scale); dp_yres = (int)(pixel_yres * g_dpi_scale);\n\tnet::Init();\n#ifdef __SYMBIAN32__\n\tconst char *savegame_dir = \"E:\/PPSSPP\/\";\n\tconst char *assets_dir = \"E:\/PPSSPP\/\";\n#elif defined(BLACKBERRY)\n\tconst char *savegame_dir = \"\/accounts\/1000\/shared\/misc\/\";\n\tconst char *assets_dir = \"app\/native\/assets\/\";\n#elif defined(MAEMO)\n\tconst char *savegame_dir = \"\/home\/user\/MyDocs\/PPSSPP\/\";\n\tconst char *assets_dir = \"\/opt\/PPSSPP\/\";\n#elif defined(ANDROID)\n\tconst char *savegame_dir = QStandardPaths::standardLocations(QStandardPaths::HomeLocation).at(0).toStdString().c_str();\n\tconst char *assets_dir = QStandardPaths::standardLocations(QStandardPaths::GenericDataLocation).at(0).toStdString().c_str();\n\tsetenv(\"QT_USE_ANDROID_NATIVE_DIALOGS\", \"1\", 1); \/\/ Which Qt version does this need?\n#else\n\tconst char *savegame_dir = \".\/\";\n\tconst char *assets_dir = \".\/\";\n#endif\n\tNativeInit(argc, (const char **)argv, savegame_dir, assets_dir, \"BADCOFFEE\");\n\n\tint ret = mainInternal(a);\n\n#ifndef MOBILE_DEVICE\n\texit(0);\n#endif\n\tNativeShutdownGraphics();\n\tSDL_PauseAudio(1);\n\tSDL_CloseAudio();\n\tNativeShutdown();\n\tnet::Shutdown();\n\treturn ret;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/** Copyright (C) 2016 European Spallation Source *\/\n\n#include <cspec\/CSPECData.h>\n#include <cspecgen\/CspecArgs.h>\n#include <cstring>\n#include <inttypes.h>\n#include <iostream>\n#include <libs\/include\/Socket.h>\n#include <libs\/include\/Timer.h>\n#include <libs\/include\/gccintel.h>\n#include <unistd.h>\n\nusing namespace std;\n\nconst int TSC_MHZ = 2900;\n\nint main(int argc, char *argv[]) {\n  DGArgs opts(argc, argv); \/\/ Parse command line opts\n\n  char buffer[9000];\n  unsigned int seqno = 1;\n\n  const int B1M = 1000000;\n  Socket::Endpoint local(\"0.0.0.0\", 0);\n  Socket::Endpoint remote(opts.dest_ip.c_str(), opts.port);\n\n  UDPClient DataSource(local, remote);\n  DataSource.buflen(opts.buflen);\n  DataSource.setbuffers(opts.sndbuf, 0);\n  DataSource.printbuffers();\n\n  CSPECData cspec;\n  int ndata = 100;\n  int size = cspec.generate(buffer, 9000, ndata);\n  assert(size == ndata * cspec.datasize);\n\n  uint64_t tx_total = 0;\n  uint64_t tx = 0;\n  uint64_t txp = 0;\n  uint64_t tsc0 = rdtsc();\n  uint64_t tsc1 = rdtsc();\n  uint64_t tsc;\n  for (;;) {\n    tsc = rdtsc();\n    if (unlikely((tx_total + tx) >= (long unsigned int)opts.txGB * 1000000000) {\n      cout << \"Sent \" << tx_total + tx << \" bytes.\" << endl;\n      cout << \"done\" << endl;\n      exit(0);\n    }\n\n    \/\/ Sleep to throttle down speed\n    if (unlikely((tsc - tsc1) >= TSC_MHZ * 10000)) {\n      usleep(opts.speed_level * 1000);\n      tsc1 = rdtsc();\n    }\n\n    \/\/ Send data\n    int wrsize = DataSource.send(buffer, size);\n    if (wrsize > 0) {\n      tx += wrsize;\n      txp++;\n      seqno++;\n    } else {\n      cout << \"unable to send\" << endl;\n    }\n\n    if (unlikely(((tsc - tsc0) \/ TSC_MHZ) >= opts.updint * 1000000)) {\n      tx_total += tx;\n      printf(\"Tx rate: %8.2f Mbps, tx %5\" PRIu64 \" MB (total: %7\" PRIu64\n             \" MB) %ld usecs\\n\",\n             tx * 8.0 \/ (((tsc - tsc0) \/ TSC_MHZ) \/ 1000000.0) \/ B1M, tx \/ B1M,\n             tx_total \/ B1M, ((tsc - tsc0) \/ TSC_MHZ));\n      tx = 0;\n      tsc0 = rdtsc();\n    }\n  }\n}\n<commit_msg>ooops missing parenthesis<commit_after>\/** Copyright (C) 2016 European Spallation Source *\/\n\n#include <cspec\/CSPECData.h>\n#include <cspecgen\/CspecArgs.h>\n#include <cstring>\n#include <inttypes.h>\n#include <iostream>\n#include <libs\/include\/Socket.h>\n#include <libs\/include\/Timer.h>\n#include <libs\/include\/gccintel.h>\n#include <unistd.h>\n\nusing namespace std;\n\nconst int TSC_MHZ = 2900;\n\nint main(int argc, char *argv[]) {\n  DGArgs opts(argc, argv); \/\/ Parse command line opts\n\n  char buffer[9000];\n  unsigned int seqno = 1;\n\n  const int B1M = 1000000;\n  Socket::Endpoint local(\"0.0.0.0\", 0);\n  Socket::Endpoint remote(opts.dest_ip.c_str(), opts.port);\n\n  UDPClient DataSource(local, remote);\n  DataSource.buflen(opts.buflen);\n  DataSource.setbuffers(opts.sndbuf, 0);\n  DataSource.printbuffers();\n\n  CSPECData cspec;\n  int ndata = 100;\n  int size = cspec.generate(buffer, 9000, ndata);\n  assert(size == ndata * cspec.datasize);\n\n  uint64_t tx_total = 0;\n  uint64_t tx = 0;\n  uint64_t txp = 0;\n  uint64_t tsc0 = rdtsc();\n  uint64_t tsc1 = rdtsc();\n  uint64_t tsc;\n  for (;;) {\n    tsc = rdtsc();\n    if (unlikely((tx_total + tx) >= (long unsigned int)opts.txGB * 1000000000)) {\n      cout << \"Sent \" << tx_total + tx << \" bytes.\" << endl;\n      cout << \"done\" << endl;\n      exit(0);\n    }\n\n    \/\/ Sleep to throttle down speed\n    if (unlikely((tsc - tsc1) >= TSC_MHZ * 10000)) {\n      usleep(opts.speed_level * 1000);\n      tsc1 = rdtsc();\n    }\n\n    \/\/ Send data\n    int wrsize = DataSource.send(buffer, size);\n    if (wrsize > 0) {\n      tx += wrsize;\n      txp++;\n      seqno++;\n    } else {\n      cout << \"unable to send\" << endl;\n    }\n\n    if (unlikely(((tsc - tsc0) \/ TSC_MHZ) >= opts.updint * 1000000)) {\n      tx_total += tx;\n      printf(\"Tx rate: %8.2f Mbps, tx %5\" PRIu64 \" MB (total: %7\" PRIu64\n             \" MB) %ld usecs\\n\",\n             tx * 8.0 \/ (((tsc - tsc0) \/ TSC_MHZ) \/ 1000000.0) \/ B1M, tx \/ B1M,\n             tx_total \/ B1M, ((tsc - tsc0) \/ TSC_MHZ));\n      tx = 0;\n      tsc0 = rdtsc();\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2003 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 __HASHMAP_HH__\n#define __HASHMAP_HH__\n\n#if defined(__GNUC__) && __GNUC__ >= 3\n#include <ext\/hash_map>\n#else\n#include <hash_map>\n#endif\n\n#include <string>\n\n#include \"sim\/host.hh\"\n\n#if defined(__GNUC__) && __GNUC__ >= 3\n    #define __hash_namespace __gnu_cxx\n#else\n    #define __hash_namespace std\n#endif\n\nnamespace m5 {\n    using ::__hash_namespace::hash_multimap;\n    using ::__hash_namespace::hash_map;\n    using ::__hash_namespace::hash;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Some default Hashing Functions\n\/\/\n\nnamespace __hash_namespace {\n    template<>\n    struct hash<uint64_t> {\n        size_t operator()(uint64_t r) const {\n            return r;\n        }\n    };\n\n    template<>\n    struct hash<Counter> {\n        size_t operator()(Counter r) const {\n            return r;\n        };\n    };\n\n    template<>\n    struct hash<std::string> {\n        size_t operator()(const std::string &s) const {\n            return(__stl_hash_string(s.c_str()));\n        }\n    };\n}\n\n\n#endif \/\/ __HASHMAP_HH__\n<commit_msg>Make the simulator compile on an Itanium.<commit_after>\/*\n * Copyright (c) 2003 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 __HASHMAP_HH__\n#define __HASHMAP_HH__\n\n#if defined(__GNUC__) && __GNUC__ >= 3\n#include <ext\/hash_map>\n#else\n#include <hash_map>\n#endif\n\n#include <string>\n\n#include \"sim\/host.hh\"\n\n#if defined(__GNUC__) && __GNUC__ >= 3\n    #define __hash_namespace __gnu_cxx\n#else\n    #define __hash_namespace std\n#endif\n\nnamespace m5 {\n    using ::__hash_namespace::hash_multimap;\n    using ::__hash_namespace::hash_map;\n    using ::__hash_namespace::hash;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Some default Hashing Functions\n\/\/\n\nnamespace __hash_namespace {\n#if !defined(__LP64__)\n    template<>\n    struct hash<uint64_t> {\n        size_t operator()(uint64_t r) const {\n            return r;\n        }\n    };\n\n    template<>\n    struct hash<int64_t> {\n        size_t operator()(int64_t r) const {\n            return r;\n        };\n    };\n#endif\n\n    template<>\n    struct hash<std::string> {\n        size_t operator()(const std::string &s) const {\n            return(__stl_hash_string(s.c_str()));\n        }\n    };\n}\n\n\n#endif \/\/ __HASHMAP_HH__\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\n#define NOMINMAX \/\/ fckng Windows\n\n#include \"vtrc-client\/vtrc-client.h\"\n#include \"vtrc-common\/vtrc-thread-pool.h\"\n#include \"vtrc-common\/vtrc-stub-wrapper.h\"\n#include \"vtrc-common\/vtrc-random-device.h\"\n\n#include \"protocol\/hello.pb.h\"\n\n#include \"boost\/lexical_cast.hpp\"\n\n#include \"openssl\/err.h\"\n#include \"openssl\/rand.h\"\n\n#if defined(X509_NAME)\n#undef X509_NAME\n#endif\n\n#include \"openssl\/ssl.h\"\n\n#include \"..\/protocol\/ssl-wrapper.h\"\n\nusing namespace vtrc;\n\nconst std::string CERTF = \"..\/server.crt\";\n\nnamespace {\n\n    typedef howto::hello_ssl_service_Stub   stub_type;\n    typedef common::stub_wrapper<stub_type> stub_wrap;\n\n    void on_connect( )\n    {\n        std::cout << \"connect...\";\n    }\n    void on_ready( )\n    {\n        std::cout << \"ready...\";\n    }\n    void on_disconnect( )\n    {\n        std::cout << \"disconnect...\";\n    }\n\n    void ssl_throw( const char *add )\n    {\n        std::string err(add);\n        err += \": \";\n        size_t final = err.size( );\n        err.resize( final + 1024 );\n        ERR_error_string_n(ERR_get_error( ), &err[final], err.size( ) - final );\n        throw std::runtime_error( err );\n    }\n}\n\nint verify_callback( X509_STORE_CTX *x509, void *\/*p*\/ )\n{\n    char subject[512];\n    int ver = X509_verify_cert(x509);\n    if( ver <= 0 ) {\n        int err = X509_STORE_CTX_get_error(x509);\n        char errorbuf[1024];\n        ERR_error_string_n(err, errorbuf, 1024);\n        std::cout << \"Cert is not valid \" << errorbuf << \"\\n\";\n    }\n    X509 *cc = X509_STORE_CTX_get_current_cert( x509 );\n    if( !cc ) {\n        ssl_throw(\"ds\");\n    }\n    X509_NAME *sn = X509_get_subject_name( cc );\n    X509_NAME_oneline(sn, subject, 256);\n    std::cout << \"Verify call: \" << subject << \"\\n\";\n\n    \/\/\/ we don't care, cuz \"Hello, world!\"\n    return 1;\n}\n\nclass my_ssl_wrapper: public ssl_wrapper_client {\npublic:\n    my_ssl_wrapper( )\n        :ssl_wrapper_client(TLSv1_2_client_method( ))\n    { }\nprivate:\n    void init_context( )\n    {\n        SSL_CTX_set_mode( get_context( ), SSL_MODE_AUTO_RETRY           );\n        SSL_CTX_set_mode( get_context( ), SSL_MODE_ENABLE_PARTIAL_WRITE );\n        SSL_CTX_set_mode( get_context( ), SSL_MODE_RELEASE_BUFFERS      );\n\n        SSL_CTX_set_cert_verify_callback( get_context( ), verify_callback, 0 );\n\n        int err = SSL_CTX_load_verify_locations( get_context( ),\n                                                 CERTF.c_str( ), 0 );\n        if( err == 0 ) {\n            ssl_throw(\"SSL_CTX_load_verify_locations\");\n        }\n    }\n};\n\nstd::string send_data( stub_wrap &stub, my_ssl_wrapper &ssl,\n                       const std::string &data, bool decode = true )\n{\n    howto::request_message  req;\n    howto::response_message res;\n\n    req.set_block( ssl.encrypt( data ) );\n    \/\/std::cout << \"packed: \" << req.block( ).size( ) << \"\\n\";\n\n    stub.call( &stub_type::send_block, &req, &res );\n    std::string result;\n    if( decode ) {\n        result = ssl.decrypt( res.block( ) );\n    } else {\n        ssl.get_in( ).write( res.block( ) );\n    }\n\/\/    std::cout << \"result: \" << result.size( ) << \" \"\n\/\/              << res.block( ).size( ) << \"\\n\";\n    return result;\n}\n\nvoid connect_handshake( stub_wrap &stub )\n{\n    my_ssl_wrapper ssl;\n    ssl.init( );\n    howto::request_message  req;\n    howto::response_message res;\n    std::string data;\n    while (!ssl.init_finished( )) {\n\n        std::string res_data = ssl.do_handshake( );\n\n        if( !res_data.empty( ) ) {\n            req.set_block( res_data );\n            stub.call( &stub_type::send_block, &req, &res );\n            data = res.block( );\n            if( !data.empty( ) ) { \/\/\n                ssl.get_in( ).write( data.c_str( ), data.size( ) );\n            }\n        }\n    }\n\n    std::cout << \"Init success!\\n\";\n\n    int i = 0;\n\n    std::cout << i++ << \": \" << send_data( stub, ssl, \"Hello, World1\" )\n              << \"\\n\";\n    std::cout << i++ << \": \" << send_data( stub, ssl, \"Hello, World2\", false )\n              << \"\\n\";\n    std::cout << i++ << \": \" << send_data( stub, ssl, \"Hello, World3\" )\n              << \"\\n\";\n\n    std::string test(41, '!');\n    std::cout << i++ << \": \" << send_data( stub, ssl, test ) << \"\\n\";\n}\n\nint main( int argc, const char **argv )\n{\n    common::thread_pool tp( 1 );\n\n    const char *address = \"127.0.0.1\";\n    unsigned short port = 56560;\n\n    if( argc > 2 ) {\n        address = argv[1];\n        port = boost::lexical_cast<unsigned short>( argv[2] );\n    } else if( argc > 1 ) {\n        port = boost::lexical_cast<unsigned short>( argv[1] );\n    }\n\n    vtrc::common::random_device rd(true);\n    std::string seed = rd.generate_block( 1024 );\n\n    RAND_seed( seed.c_str( ), seed.size( ) );\n\n    SSL_load_error_strings( );\n    SSLeay_add_ssl_algorithms( );\n\n    try {\n\n        client::vtrc_client_sptr cl =\n                         client::vtrc_client::create( tp.get_io_service( ) );\n\n        cl->on_connect_connect( on_connect );\n        cl->on_ready_connect( on_ready );\n        cl->on_disconnect_connect( on_disconnect );\n\n        std::cout <<  \"Connecting...\" << std::endl;\n\n        cl->connect( address, port );\n        std::cout << \"Ok\" << std::endl;\n\n        vtrc::unique_ptr<common::rpc_channel> channel(cl->create_channel( ));\n\n        stub_wrap hello(channel.get( ));\n\n        connect_handshake( hello );\n\n    } catch( const std::exception &ex ) {\n        std::cerr << \"Hello, world failed: \" << ex.what( ) << \"\\n\";\n    }\n\n    tp.stop( );\n    tp.join_all( );\n\n    \/\/\/ make valgrind happy.\n    google::protobuf::ShutdownProtobufLibrary( );\n\n    return 0;\n}\n<commit_msg>connection closure<commit_after>#include <iostream>\n\n#if !defined(NOMINMAX)\n#define NOMINMAX \/\/ fckng Windows\n#endif\n\n#include \"vtrc-client\/vtrc-client.h\"\n#include \"vtrc-common\/vtrc-thread-pool.h\"\n#include \"vtrc-common\/vtrc-stub-wrapper.h\"\n#include \"vtrc-common\/vtrc-random-device.h\"\n\n#include \"protocol\/hello.pb.h\"\n\n#include \"boost\/lexical_cast.hpp\"\n\n#include \"openssl\/err.h\"\n#include \"openssl\/rand.h\"\n\n#if defined(X509_NAME)\n#undef X509_NAME\n#endif\n\n#include \"openssl\/ssl.h\"\n\n#include \"..\/protocol\/ssl-wrapper.h\"\n\nusing namespace vtrc;\n\nconst std::string CERTF = \"..\/server.crt\";\n\nnamespace {\n\n    typedef howto::hello_ssl_service_Stub   stub_type;\n    typedef common::stub_wrapper<stub_type> stub_wrap;\n\n    void on_connect( )\n    {\n        std::cout << \"connect...\";\n    }\n    void on_ready( )\n    {\n        std::cout << \"ready...\";\n    }\n    void on_disconnect( )\n    {\n        std::cout << \"disconnect...\";\n    }\n\n    void ssl_throw( const char *add )\n    {\n        std::string err(add);\n        err += \": \";\n        size_t final = err.size( );\n        err.resize( final + 1024 );\n        ERR_error_string_n(ERR_get_error( ), &err[final], err.size( ) - final );\n        throw std::runtime_error( err );\n    }\n}\n\nint verify_callback( X509_STORE_CTX *x509, void *\/*p*\/ )\n{\n    char subject[512];\n    int ver = X509_verify_cert(x509);\n    if( ver <= 0 ) {\n        int err = X509_STORE_CTX_get_error(x509);\n        char errorbuf[1024];\n        ERR_error_string_n(err, errorbuf, 1024);\n        std::cout << \"Cert is not valid \" << errorbuf << \"\\n\";\n    }\n    X509 *cc = X509_STORE_CTX_get_current_cert( x509 );\n    if( !cc ) {\n        ssl_throw(\"ds\");\n    }\n    X509_NAME *sn = X509_get_subject_name( cc );\n    X509_NAME_oneline(sn, subject, 256);\n    std::cout << \"Verify call: \" << subject << \"\\n\";\n\n    \/\/\/ we don't care, cuz \"Hello, world!\"\n    return 1;\n}\n\nclass my_ssl_wrapper: public ssl_wrapper_client {\npublic:\n    my_ssl_wrapper( )\n        :ssl_wrapper_client(TLSv1_2_client_method( ))\n    { }\nprivate:\n    void init_context( )\n    {\n        SSL_CTX_set_mode( get_context( ), SSL_MODE_AUTO_RETRY           );\n        SSL_CTX_set_mode( get_context( ), SSL_MODE_ENABLE_PARTIAL_WRITE );\n        SSL_CTX_set_mode( get_context( ), SSL_MODE_RELEASE_BUFFERS      );\n\n        SSL_CTX_set_cert_verify_callback( get_context( ), verify_callback, 0 );\n\n        int err = SSL_CTX_load_verify_locations( get_context( ),\n                                                 CERTF.c_str( ), 0 );\n        if( err == 0 ) {\n            ssl_throw(\"SSL_CTX_load_verify_locations\");\n        }\n    }\n};\n\nstd::string send_data( stub_wrap &stub, my_ssl_wrapper &ssl,\n                       const std::string &data, bool decode = true )\n{\n    howto::request_message  req;\n    howto::response_message res;\n\n    req.set_block( ssl.encrypt( data ) );\n    \/\/std::cout << \"packed: \" << req.block( ).size( ) << \"\\n\";\n\n    stub.call( &stub_type::send_block, &req, &res );\n    std::string result;\n    if( decode ) {\n        result = ssl.decrypt( res.block( ) );\n    } else {\n        ssl.get_in( ).write( res.block( ) );\n    }\n\/\/    std::cout << \"result: \" << result.size( ) << \" \"\n\/\/              << res.block( ).size( ) << \"\\n\";\n    return result;\n}\n\nvoid connect_handshake( stub_wrap &stub )\n{\n    my_ssl_wrapper ssl;\n    ssl.init( );\n    howto::request_message  req;\n    howto::response_message res;\n    std::string data;\n    while (!ssl.init_finished( )) {\n\n        std::string res_data = ssl.do_handshake( );\n\n        if( !res_data.empty( ) ) {\n            req.set_block( res_data );\n            stub.call( &stub_type::send_block, &req, &res );\n            data = res.block( );\n            if( !data.empty( ) ) { \/\/\n                ssl.get_in( ).write( data.c_str( ), data.size( ) );\n            }\n        }\n    }\n\n    std::cout << \"Init success!\\n\";\n\n    int i = 0;\n\n    std::cout << i++ << \": \" << send_data( stub, ssl, \"Hello, World1\" )\n              << \"\\n\";\n    std::cout << i++ << \": \" << send_data( stub, ssl, \"Hello, World2\", false )\n              << \"\\n\";\n    std::cout << i++ << \": \" << send_data( stub, ssl, \"Hello, World3\" )\n              << \"\\n\";\n\n    std::string test(41, '!');\n    std::cout << i++ << \": \" << send_data( stub, ssl, test ) << \"\\n\";\n}\n\nint main( int argc, const char **argv )\n{\n    common::thread_pool tp( 1 );\n\n    const char *address = \"127.0.0.1\";\n    unsigned short port = 56560;\n\n    if( argc > 2 ) {\n        address = argv[1];\n        port = boost::lexical_cast<unsigned short>( argv[2] );\n    } else if( argc > 1 ) {\n        port = boost::lexical_cast<unsigned short>( argv[1] );\n    }\n\n    vtrc::common::random_device rd(true);\n    std::string seed = rd.generate_block( 1024 );\n\n    RAND_seed( seed.c_str( ), seed.size( ) );\n\n    SSL_load_error_strings( );\n    SSLeay_add_ssl_algorithms( );\n\n    try {\n\n        client::vtrc_client_sptr cl =\n                         client::vtrc_client::create( tp.get_io_service( ) );\n\n        cl->on_connect_connect( on_connect );\n        cl->on_ready_connect( on_ready );\n        cl->on_disconnect_connect( on_disconnect );\n\n        std::cout <<  \"Connecting...\" << std::endl;\n\n        cl->connect( address, port );\n        std::cout << \"Ok\" << std::endl;\n\n        vtrc::unique_ptr<common::rpc_channel> channel(cl->create_channel( ));\n\n        stub_wrap hello(channel.get( ));\n\n        connect_handshake( hello );\n\n    } catch( const std::exception &ex ) {\n        std::cerr << \"Hello, world failed: \" << ex.what( ) << \"\\n\";\n    }\n\n    tp.stop( );\n    tp.join_all( );\n\n    \/\/\/ make valgrind happy.\n    google::protobuf::ShutdownProtobufLibrary( );\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by manu343726 on 4\/08\/15.\n\/\/\n\n#ifndef CTTI_HASH_HPP\n#define CTTI_HASH_HPP\n\n#include <functional>\n#include \"detail\/hash.hpp\"\n#include \"detail\/pretty_function.hpp\"\n#include \"detail\/string.hpp\"\n\n#ifdef CTTI_DEBUG_ID_FUNCTIONS\n#include <iostream>\n#include <string>\n\n#ifndef CTTI_CONSTEXPR_ID\n#define CTTI_CONSTEXPR_ID\n#endif\n#else\n#ifndef CTTI_CONSTEXPR_ID\n#define CTTI_CONSTEXPR_ID constexpr\n#endif\n#endif\nnamespace ctti\n{\n    struct type_id_t\n    {\n        constexpr type_id_t(const detail::string& name) :\n            name_{name}\n        {}\n\n        type_id_t& operator=(const type_id_t&) = default;\n\n        constexpr detail::hash_t hash() const\n        {\n            return name_.hash();\n        }\n\n        \/\/ note: name().c_str() isn't null-terminated properly!\n        constexpr detail::string name() const\n        {\n            return name_;\n        }\n\n        friend constexpr bool operator==(const type_id_t& lhs, const type_id_t& rhs)\n        {\n            return lhs.hash() == rhs.hash();\n        }\n\n        friend constexpr bool operator!=(const type_id_t& lhs, const type_id_t& rhs)\n        {\n            return !(lhs == rhs);\n        }\n\n    private:\n        detail::string name_;\n    };\n\n    struct unnamed_type_id_t\n    {\n        constexpr unnamed_type_id_t(const detail::hash_t hash) :\n            _hash{hash}\n        {}\n\n        unnamed_type_id_t& operator=(const unnamed_type_id_t&) = default;\n\n        constexpr detail::hash_t hash() const\n        {\n\t\t\treturn _hash;\n        }\n\n        friend constexpr bool operator==(const unnamed_type_id_t& lhs, const unnamed_type_id_t& rhs)\n        {\n            return lhs.hash() == rhs.hash();\n        }\n\n        friend constexpr bool operator!=(const unnamed_type_id_t& lhs, const unnamed_type_id_t& rhs)\n        {\n            return !(lhs == rhs);\n        }\n\n    private:\n        detail::hash_t _hash;\n    };\n\n    using type_index = unnamed_type_id_t; \/\/ To mimic std::type_index when using maps\n\n\n    template<std::size_t N>\n    constexpr ctti::unnamed_type_id_t id_from_name(const char (&typeName)[N])\n    {\n        return detail::sid_hash(N - 1, typeName);\n    }\n\n    constexpr ctti::unnamed_type_id_t id_from_name(const char* typeName, std::size_t length)\n    {\n        return detail::sid_hash(length, typeName);\n    }\n\n    ctti::unnamed_type_id_t id_from_name(const std::string& typeName)\n    {\n        return detail::sid_hash(typeName.size(), typeName.data());\n    }\n\n    namespace detail\n    {\n        template<typename T>\n\tCTTI_CONSTEXPR_ID ctti::type_id_t type_id()\n        {\n            static_assert(CTTI_TYPE_ID_PRETTY_FUNCTION_END - CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN <= max_string_length, \"CTTI_PRETTY_FUNCTION out of range\");\n\n#ifdef CTTI_DEBUG_ID_FUNCTIONS\n            std::string name{ CTTI_TYPE_ID_PRETTY_FUNCTION + CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN, CTTI_TYPE_ID_PRETTY_FUNCTION_END - CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN - 1};\n\n            std::cout << \"PRETTY_FUNCTION: \" << CTTI_TYPE_ID_PRETTY_FUNCTION << std::endl;\n            std::cout << \"Range: [\" << CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN << \",\" << CTTI_TYPE_ID_PRETTY_FUNCTION_END << \")\" << std::endl;\n            std::cout << \"Name: \" << name << std::endl;\n#endif\n            \/\/ one-liner required by MSVC :(\n            return detail::make_string<CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN, CTTI_TYPE_ID_PRETTY_FUNCTION_END>(CTTI_TYPE_ID_PRETTY_FUNCTION);\n        }\n\n        template<typename T>\n        CTTI_CONSTEXPR_ID ctti::unnamed_type_id_t unnamed_type_id()\n        {\n            \/\/ one-liner required by MSVC :(\n            static_assert(CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN < CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END, \"CTTI unnamed type id wrong range\");\n\n#ifdef CTTI_DEBUG_ID_FUNCTIONS\n            std::string name{ CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION + CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN, CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END - CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN - 1};\n\n            std::cout << \"PRETTY_FUNCTION: \" << CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION << std::endl;\n            std::cout << \"Range: [\" << CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN << \",\" << CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END << \")\" << std::endl;\n            std::cout << \"Name: \" << name << std::endl;\n            std::cout << \"Name size: \" << name.size() << std::endl;\n            std::cout << \"Name size (computed from range): \" << (CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END - CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN - 1) << std::endl;\n\n            return id_from_name(name);\n#else\n            return id_from_name(\n                CTTI_TYPE_ID_PRETTY_FUNCTION + CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN,\n                CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END - CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN - 1\n            );\n#endif\n        }\n    }\n\n    \/**\n     * Returns type information at compile-time for a value\n     * of type T. Decay is applied to argument type first, use\n     * ctti::type_id<decltype(arg)>() to preserve references and cv qualifiers.\n     *\/\n    template<typename T>\n    constexpr type_id_t type_id(T&&)\n    {\n        return detail::type_id<typename std::decay<T>::type>();\n    }\n\n    \/**\n     * Returns type information at compile-time for type T.\n     *\/\n    template<typename T>\n    constexpr type_id_t type_id()\n    {\n        return detail::type_id<T>();\n    }\n\n    \/**\n     * Returns unnamed type information at compile-time for a value\n     * of type T. Decay is applied to argument type first, use\n     * ctti::type_id<decltype(arg)>() to preserve references and cv qualifiers.\n     *\/\n    template<typename T>\n    constexpr unnamed_type_id_t unnamed_type_id(T&&)\n    {\n        return detail::unnamed_type_id<typename std::decay<T>::type>();\n    }\n\n    \/**\n     * Returns unnamed type information at compile-time for type T.\n     *\/\n    template<typename T>\n    constexpr unnamed_type_id_t unnamed_type_id()\n    {\n        return detail::unnamed_type_id<T>();\n    }\n\n    \/\/assert commented out, GCC 5.2.0 ICE here.\n    \/\/static_assert(type_id<void>() == type_id<void>(), \"ctti::type_id_t instances must be constant expressions\");\n}\n\nnamespace std\n{\n    template<>\n    struct hash<ctti::type_id_t>\n    {\n        constexpr std::size_t operator()(const ctti::type_id_t& id) const\n        {\n            \/\/ quiet warning about possible loss of data\n            return std::size_t(id.hash());\n        }\n    };\n}\n\n#endif \/\/CTTI_HASH_HPP\n<commit_msg>std::hash specialization for ctti::unnamed_type_id<commit_after>\/\/\n\/\/ Created by manu343726 on 4\/08\/15.\n\/\/\n\n#ifndef CTTI_HASH_HPP\n#define CTTI_HASH_HPP\n\n#include <functional>\n#include \"detail\/hash.hpp\"\n#include \"detail\/pretty_function.hpp\"\n#include \"detail\/string.hpp\"\n\n#ifdef CTTI_DEBUG_ID_FUNCTIONS\n#include <iostream>\n#include <string>\n\n#ifndef CTTI_CONSTEXPR_ID\n#define CTTI_CONSTEXPR_ID\n#endif\n#else\n#ifndef CTTI_CONSTEXPR_ID\n#define CTTI_CONSTEXPR_ID constexpr\n#endif\n#endif\nnamespace ctti\n{\n    struct type_id_t\n    {\n        constexpr type_id_t(const detail::string& name) :\n            name_{name}\n        {}\n\n        type_id_t& operator=(const type_id_t&) = default;\n\n        constexpr detail::hash_t hash() const\n        {\n            return name_.hash();\n        }\n\n        \/\/ note: name().c_str() isn't null-terminated properly!\n        constexpr detail::string name() const\n        {\n            return name_;\n        }\n\n        friend constexpr bool operator==(const type_id_t& lhs, const type_id_t& rhs)\n        {\n            return lhs.hash() == rhs.hash();\n        }\n\n        friend constexpr bool operator!=(const type_id_t& lhs, const type_id_t& rhs)\n        {\n            return !(lhs == rhs);\n        }\n\n    private:\n        detail::string name_;\n    };\n\n    struct unnamed_type_id_t\n    {\n        constexpr unnamed_type_id_t(const detail::hash_t hash) :\n            _hash{hash}\n        {}\n\n        unnamed_type_id_t& operator=(const unnamed_type_id_t&) = default;\n\n        constexpr detail::hash_t hash() const\n        {\n\t\t\treturn _hash;\n        }\n\n        friend constexpr bool operator==(const unnamed_type_id_t& lhs, const unnamed_type_id_t& rhs)\n        {\n            return lhs.hash() == rhs.hash();\n        }\n\n        friend constexpr bool operator!=(const unnamed_type_id_t& lhs, const unnamed_type_id_t& rhs)\n        {\n            return !(lhs == rhs);\n        }\n\n    private:\n        detail::hash_t _hash;\n    };\n\n    using type_index = unnamed_type_id_t; \/\/ To mimic std::type_index when using maps\n\n\n    template<std::size_t N>\n    constexpr ctti::unnamed_type_id_t id_from_name(const char (&typeName)[N])\n    {\n        return detail::sid_hash(N - 1, typeName);\n    }\n\n    constexpr ctti::unnamed_type_id_t id_from_name(const char* typeName, std::size_t length)\n    {\n        return detail::sid_hash(length, typeName);\n    }\n\n    ctti::unnamed_type_id_t id_from_name(const std::string& typeName)\n    {\n        return detail::sid_hash(typeName.size(), typeName.data());\n    }\n\n    namespace detail\n    {\n        template<typename T>\n\tCTTI_CONSTEXPR_ID ctti::type_id_t type_id()\n        {\n            static_assert(CTTI_TYPE_ID_PRETTY_FUNCTION_END - CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN <= max_string_length, \"CTTI_PRETTY_FUNCTION out of range\");\n\n#ifdef CTTI_DEBUG_ID_FUNCTIONS\n            std::string name{ CTTI_TYPE_ID_PRETTY_FUNCTION + CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN, CTTI_TYPE_ID_PRETTY_FUNCTION_END - CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN - 1};\n\n            std::cout << \"PRETTY_FUNCTION: \" << CTTI_TYPE_ID_PRETTY_FUNCTION << std::endl;\n            std::cout << \"Range: [\" << CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN << \",\" << CTTI_TYPE_ID_PRETTY_FUNCTION_END << \")\" << std::endl;\n            std::cout << \"Name: \" << name << std::endl;\n#endif\n            \/\/ one-liner required by MSVC :(\n            return detail::make_string<CTTI_TYPE_ID_PRETTY_FUNCTION_BEGIN, CTTI_TYPE_ID_PRETTY_FUNCTION_END>(CTTI_TYPE_ID_PRETTY_FUNCTION);\n        }\n\n        template<typename T>\n        CTTI_CONSTEXPR_ID ctti::unnamed_type_id_t unnamed_type_id()\n        {\n            \/\/ one-liner required by MSVC :(\n            static_assert(CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN < CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END, \"CTTI unnamed type id wrong range\");\n\n#ifdef CTTI_DEBUG_ID_FUNCTIONS\n            std::string name{ CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION + CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN, CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END - CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN - 1};\n\n            std::cout << \"PRETTY_FUNCTION: \" << CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION << std::endl;\n            std::cout << \"Range: [\" << CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN << \",\" << CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END << \")\" << std::endl;\n            std::cout << \"Name: \" << name << std::endl;\n            std::cout << \"Name size: \" << name.size() << std::endl;\n            std::cout << \"Name size (computed from range): \" << (CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END - CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN - 1) << std::endl;\n\n            return id_from_name(name);\n#else\n            return id_from_name(\n                CTTI_TYPE_ID_PRETTY_FUNCTION + CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN,\n                CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_END - CTTI_UNNAMED_TYPE_ID_PRETTY_FUNCTION_BEGIN - 1\n            );\n#endif\n        }\n    }\n\n    \/**\n     * Returns type information at compile-time for a value\n     * of type T. Decay is applied to argument type first, use\n     * ctti::type_id<decltype(arg)>() to preserve references and cv qualifiers.\n     *\/\n    template<typename T>\n    constexpr type_id_t type_id(T&&)\n    {\n        return detail::type_id<typename std::decay<T>::type>();\n    }\n\n    \/**\n     * Returns type information at compile-time for type T.\n     *\/\n    template<typename T>\n    constexpr type_id_t type_id()\n    {\n        return detail::type_id<T>();\n    }\n\n    \/**\n     * Returns unnamed type information at compile-time for a value\n     * of type T. Decay is applied to argument type first, use\n     * ctti::type_id<decltype(arg)>() to preserve references and cv qualifiers.\n     *\/\n    template<typename T>\n    constexpr unnamed_type_id_t unnamed_type_id(T&&)\n    {\n        return detail::unnamed_type_id<typename std::decay<T>::type>();\n    }\n\n    \/**\n     * Returns unnamed type information at compile-time for type T.\n     *\/\n    template<typename T>\n    constexpr unnamed_type_id_t unnamed_type_id()\n    {\n        return detail::unnamed_type_id<T>();\n    }\n\n    \/\/assert commented out, GCC 5.2.0 ICE here.\n    \/\/static_assert(type_id<void>() == type_id<void>(), \"ctti::type_id_t instances must be constant expressions\");\n}\n\nnamespace std\n{\n    template<>\n    struct hash<ctti::type_id_t>\n    {\n        constexpr std::size_t operator()(const ctti::type_id_t& id) const\n        {\n            \/\/ quiet warning about possible loss of data\n            return std::size_t(id.hash());\n        }\n    };\n\n    template<>\n    struct hash<ctti::unnamed_type_id_t>\n    {\n        constexpr std::size_t operator()(const ctti::unnamed_type_id_t& id) const\n        {\n            \/\/ quiet warning about possible loss of data\n            return std::size_t(id.hash());\n        }\n    };\n}\n\n#endif \/\/CTTI_HASH_HPP\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#ifndef RAZ_SUBMESH_HPP\n#define RAZ_SUBMESH_HPP\n\n#include <memory>\n\n#include \"RaZ\/Render\/GraphicObjects.hpp\"\n\nnamespace Raz {\n\nenum class RenderMode : unsigned int {\n  POINT    = 0, \/\/ GL_POINTS\n  LINE     = 1, \/\/ GL_LINES\n  TRIANGLE = 4  \/\/ GL_TRIANGLES\n};\n\nclass Submesh;\nusing SubmeshPtr = std::unique_ptr<Submesh>;\n\nclass Submesh {\npublic:\n  Submesh() = default;\n  explicit Submesh(RenderMode renderMode) : m_renderMode{ renderMode } {}\n  Submesh(const Submesh&) = delete;\n  Submesh(Submesh&&) = default;\n\n  const VertexArray& getVao() const { return m_vao; }\n  const VertexBuffer& getVbo() const { return m_vbo; }\n  const ElementBuffer& getEbo() const { return m_vao.getEbo(); }\n  const std::vector<Vertex>& getVertices() const { return m_vbo.getVertices(); }\n  std::vector<Vertex>& getVertices() { return m_vbo.getVertices(); }\n  std::size_t getVertexCount() const { return m_vbo.getVertices().size(); }\n  const std::vector<unsigned int>& getIndices() const { return m_vao.getEbo().getIndices(); }\n  std::vector<unsigned int>& getIndices() { return m_vao.getEbo().getIndices(); }\n  std::size_t getIndexCount() const { return getEbo().getIndices().size(); }\n  RenderMode getRenderMode() const { return m_renderMode; }\n  std::size_t getMaterialIndex() const { return m_materialIndex; }\n\n  void setRenderMode(RenderMode renderMode) { m_renderMode = renderMode; }\n  void setMaterialIndex(std::size_t materialIndex) { m_materialIndex = materialIndex; }\n\n  template <typename... Args>\n  static SubmeshPtr create(Args&&... args) { return std::make_unique<Submesh>(std::forward<Args>(args)...); }\n\n  \/\/\/ Loads the submesh's data (vertices & indices) onto the graphics card.\n  void load() const;\n  \/\/\/ Draws the submesh in the scene.\n  void draw() const;\n\n  Submesh& operator=(const Submesh&) = delete;\n  Submesh& operator=(Submesh&&) = default;\n\nprivate:\n  void loadVertices() const;\n  void loadIndices() const;\n\n  VertexArray m_vao {};\n  VertexBuffer m_vbo {};\n  RenderMode m_renderMode = RenderMode::TRIANGLE;\n\n  std::size_t m_materialIndex {};\n};\n\n} \/\/ namespace Raz\n\n#endif \/\/ RAZ_SUBMESH_HPP\n<commit_msg>[Render\/Submesh] Reworked Submesh functions according to EBO changes<commit_after>#pragma once\n\n#ifndef RAZ_SUBMESH_HPP\n#define RAZ_SUBMESH_HPP\n\n#include <memory>\n\n#include \"RaZ\/Render\/GraphicObjects.hpp\"\n\nnamespace Raz {\n\nenum class RenderMode : unsigned int {\n  POINT    = 0, \/\/ GL_POINTS\n  LINE     = 1, \/\/ GL_LINES\n  TRIANGLE = 4  \/\/ GL_TRIANGLES\n};\n\nclass Submesh;\nusing SubmeshPtr = std::unique_ptr<Submesh>;\n\nclass Submesh {\npublic:\n  Submesh() = default;\n  explicit Submesh(RenderMode renderMode) : m_renderMode{ renderMode } {}\n  Submesh(const Submesh&) = delete;\n  Submesh(Submesh&&) noexcept = default;\n\n  const std::vector<Vertex>& getVertices() const { return m_vbo.getVertices(); }\n  std::vector<Vertex>& getVertices() { return m_vbo.getVertices(); }\n  std::size_t getVertexCount() const { return getVertices().size(); }\n  const std::vector<unsigned int>& getTriangleIndices() const { return m_vao.getEbo().getTriangleIndices(); }\n  std::vector<unsigned int>& getTriangleIndices() { return m_vao.getEbo().getTriangleIndices(); }\n  const std::vector<unsigned int>& getLineIndices() const { return m_vao.getEbo().getLineIndices(); }\n  std::vector<unsigned int>& getLineIndices() { return m_vao.getEbo().getLineIndices(); }\n  std::size_t getTriangleIndexCount() const { return getLineIndices().size(); }\n  std::size_t getLineIndexCount() const { return getLineIndices().size(); }\n  RenderMode getRenderMode() const { return m_renderMode; }\n  std::size_t getMaterialIndex() const { return m_materialIndex; }\n\n  void setRenderMode(RenderMode renderMode) { m_renderMode = renderMode; }\n  void setMaterialIndex(std::size_t materialIndex) { m_materialIndex = materialIndex; }\n\n  template <typename... Args>\n  static SubmeshPtr create(Args&&... args) { return std::make_unique<Submesh>(std::forward<Args>(args)...); }\n\n  \/\/\/ Loads the submesh's data (vertices & indices) onto the graphics card.\n  void load() const;\n  \/\/\/ Draws the submesh in the scene.\n  void draw() const;\n\n  Submesh& operator=(const Submesh&) = delete;\n  Submesh& operator=(Submesh&&) noexcept = default;\n\nprivate:\n  void loadVertices() const;\n  void loadIndices() const;\n\n  VertexArray m_vao {};\n  VertexBuffer m_vbo {};\n  RenderMode m_renderMode = RenderMode::TRIANGLE;\n\n  std::size_t m_materialIndex {};\n};\n\n} \/\/ namespace Raz\n\n#endif \/\/ RAZ_SUBMESH_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\/notification_provider.h\"\n\n#include \"base\/task.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/renderer\/render_thread.h\"\n#include \"chrome\/renderer\/render_view.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebNotificationPermissionCallback.h\"\n\nusing WebKit::WebNotification;\nusing WebKit::WebNotificationPresenter;\nusing WebKit::WebNotificationPermissionCallback;\nusing WebKit::WebString;\n\nNotificationProvider::NotificationProvider(RenderView* view)\n    : view_(view) {\n}\n\nbool NotificationProvider::show(const WebNotification& notification) {\n  int notification_id = manager_.RegisterNotification(notification);\n  if (notification.isHTML())\n    return ShowHTML(notification, notification_id);\n  else\n    return ShowText(notification, notification_id);\n}\n\nvoid NotificationProvider::cancel(const WebNotification& notification) {\n  int id;\n  bool id_found = manager_.GetId(notification, id);\n  \/\/ Won't be found if the notification has already been closed by the user.\n  if (id_found)\n    Send(new ViewHostMsg_CancelDesktopNotification(view_->routing_id(), id));\n}\n\nvoid NotificationProvider::objectDestroyed(\n    const WebNotification& notification) {\n  int id;\n  bool id_found = manager_.GetId(notification, id);\n  \/\/ Won't be found if the notification has already been closed by the user.\n  if (id_found)\n    manager_.UnregisterNotification(id);\n}\n\nWebNotificationPresenter::Permission NotificationProvider::checkPermission(\n    const WebString& origin) {\n  int permission;\n  Send(new ViewHostMsg_CheckNotificationPermission(view_->routing_id(),\n                                                   GURL(origin), &permission));\n  return static_cast<WebNotificationPresenter::Permission>(permission);\n}\n\nvoid NotificationProvider::requestPermission(\n    const WebString& origin, WebNotificationPermissionCallback* callback) {\n  \/\/ We only request permission in response to a user gesture.\n  if (!view_->webview()->mainFrame()->isProcessingUserGesture())\n    return;\n\n  int id = manager_.RegisterPermissionRequest(callback);\n\n  Send(new ViewHostMsg_RequestNotificationPermission(view_->routing_id(),\n                                                     GURL(origin), id));\n}\n\nbool NotificationProvider::OnMessageReceived(const IPC::Message& message) {\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(NotificationProvider, message)\n    IPC_MESSAGE_HANDLER(ViewMsg_PostDisplayToNotificationObject, OnDisplay);\n    IPC_MESSAGE_HANDLER(ViewMsg_PostErrorToNotificationObject, OnError);\n    IPC_MESSAGE_HANDLER(ViewMsg_PostCloseToNotificationObject, OnClose);\n    IPC_MESSAGE_HANDLER(ViewMsg_PermissionRequestDone,\n                        OnPermissionRequestComplete);\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nbool NotificationProvider::ShowHTML(const WebNotification& notification,\n                                    int id) {\n  \/\/ Disallow HTML notifications from non-HTTP schemes.\n  GURL url = notification.url();\n  if (!url.SchemeIs(chrome::kHttpScheme) && !url.SchemeIs(chrome::kHttpsScheme))\n    return false;\n\n  DCHECK(notification.isHTML());\n  return Send(new ViewHostMsg_ShowDesktopNotification(view_->routing_id(),\n              GURL(view_->webview()->mainFrame()->url()).GetOrigin(),\n              notification.url(), id));\n}\n\nbool NotificationProvider::ShowText(const WebNotification& notification,\n                                    int id) {\n  DCHECK(!notification.isHTML());\n  return Send(new ViewHostMsg_ShowDesktopNotificationText(view_->routing_id(),\n              GURL(view_->webview()->mainFrame()->url()).GetOrigin(),\n              GURL(notification.icon()),\n              notification.title(), notification.body(), id));\n}\n\nvoid NotificationProvider::OnDisplay(int id) {\n  WebNotification notification;\n  bool found = manager_.GetNotification(id, &notification);\n  \/\/ |found| may be false if the WebNotification went out of scope in\n  \/\/ the page before it was actually displayed to the user.\n  if (found)\n    notification.dispatchDisplayEvent();\n}\n\nvoid NotificationProvider::OnError(int id, const WebString& message) {\n  WebNotification notification;\n  bool found = manager_.GetNotification(id, &notification);\n  \/\/ |found| may be false if the WebNotification went out of scope in\n  \/\/ the page before the error occurred.\n  if (found)\n    notification.dispatchErrorEvent(message);\n}\n\nvoid NotificationProvider::OnClose(int id, bool by_user) {\n  WebNotification notification;\n  bool found = manager_.GetNotification(id, &notification);\n  \/\/ |found| may be false if the WebNotification went out of scope in\n  \/\/ the page before the associated toast was closed by the user.\n  if (found)\n    notification.dispatchCloseEvent(by_user);\n  manager_.UnregisterNotification(id);\n}\n\nvoid NotificationProvider::OnPermissionRequestComplete(int id) {\n  WebNotificationPermissionCallback* callback = manager_.GetCallback(id);\n  DCHECK(callback);\n  callback->permissionRequestComplete();\n  manager_.OnPermissionRequestComplete(id);\n}\n\nbool NotificationProvider::Send(IPC::Message* message) {\n  return RenderThread::current()->Send(message);\n}\n<commit_msg>Allow chrome-extension scheme in notification.<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\/notification_provider.h\"\n\n#include \"base\/task.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/renderer\/render_thread.h\"\n#include \"chrome\/renderer\/render_view.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebNotificationPermissionCallback.h\"\n\nusing WebKit::WebNotification;\nusing WebKit::WebNotificationPresenter;\nusing WebKit::WebNotificationPermissionCallback;\nusing WebKit::WebString;\n\nNotificationProvider::NotificationProvider(RenderView* view)\n    : view_(view) {\n}\n\nbool NotificationProvider::show(const WebNotification& notification) {\n  int notification_id = manager_.RegisterNotification(notification);\n  if (notification.isHTML())\n    return ShowHTML(notification, notification_id);\n  else\n    return ShowText(notification, notification_id);\n}\n\nvoid NotificationProvider::cancel(const WebNotification& notification) {\n  int id;\n  bool id_found = manager_.GetId(notification, id);\n  \/\/ Won't be found if the notification has already been closed by the user.\n  if (id_found)\n    Send(new ViewHostMsg_CancelDesktopNotification(view_->routing_id(), id));\n}\n\nvoid NotificationProvider::objectDestroyed(\n    const WebNotification& notification) {\n  int id;\n  bool id_found = manager_.GetId(notification, id);\n  \/\/ Won't be found if the notification has already been closed by the user.\n  if (id_found)\n    manager_.UnregisterNotification(id);\n}\n\nWebNotificationPresenter::Permission NotificationProvider::checkPermission(\n    const WebString& origin) {\n  int permission;\n  Send(new ViewHostMsg_CheckNotificationPermission(view_->routing_id(),\n                                                   GURL(origin), &permission));\n  return static_cast<WebNotificationPresenter::Permission>(permission);\n}\n\nvoid NotificationProvider::requestPermission(\n    const WebString& origin, WebNotificationPermissionCallback* callback) {\n  \/\/ We only request permission in response to a user gesture.\n  if (!view_->webview()->mainFrame()->isProcessingUserGesture())\n    return;\n\n  int id = manager_.RegisterPermissionRequest(callback);\n\n  Send(new ViewHostMsg_RequestNotificationPermission(view_->routing_id(),\n                                                     GURL(origin), id));\n}\n\nbool NotificationProvider::OnMessageReceived(const IPC::Message& message) {\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(NotificationProvider, message)\n    IPC_MESSAGE_HANDLER(ViewMsg_PostDisplayToNotificationObject, OnDisplay);\n    IPC_MESSAGE_HANDLER(ViewMsg_PostErrorToNotificationObject, OnError);\n    IPC_MESSAGE_HANDLER(ViewMsg_PostCloseToNotificationObject, OnClose);\n    IPC_MESSAGE_HANDLER(ViewMsg_PermissionRequestDone,\n                        OnPermissionRequestComplete);\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nbool NotificationProvider::ShowHTML(const WebNotification& notification,\n                                    int id) {\n  \/\/ Disallow HTML notifications from non-HTTP schemes.\n  GURL url = notification.url();\n  if (!url.SchemeIs(chrome::kHttpScheme) &&\n      !url.SchemeIs(chrome::kHttpsScheme) &&\n      !url.SchemeIs(chrome::kExtensionScheme))\n    return false;\n\n  DCHECK(notification.isHTML());\n  return Send(new ViewHostMsg_ShowDesktopNotification(view_->routing_id(),\n              GURL(view_->webview()->mainFrame()->url()).GetOrigin(),\n              notification.url(), id));\n}\n\nbool NotificationProvider::ShowText(const WebNotification& notification,\n                                    int id) {\n  DCHECK(!notification.isHTML());\n  return Send(new ViewHostMsg_ShowDesktopNotificationText(view_->routing_id(),\n              GURL(view_->webview()->mainFrame()->url()).GetOrigin(),\n              GURL(notification.icon()),\n              notification.title(), notification.body(), id));\n}\n\nvoid NotificationProvider::OnDisplay(int id) {\n  WebNotification notification;\n  bool found = manager_.GetNotification(id, &notification);\n  \/\/ |found| may be false if the WebNotification went out of scope in\n  \/\/ the page before it was actually displayed to the user.\n  if (found)\n    notification.dispatchDisplayEvent();\n}\n\nvoid NotificationProvider::OnError(int id, const WebString& message) {\n  WebNotification notification;\n  bool found = manager_.GetNotification(id, &notification);\n  \/\/ |found| may be false if the WebNotification went out of scope in\n  \/\/ the page before the error occurred.\n  if (found)\n    notification.dispatchErrorEvent(message);\n}\n\nvoid NotificationProvider::OnClose(int id, bool by_user) {\n  WebNotification notification;\n  bool found = manager_.GetNotification(id, &notification);\n  \/\/ |found| may be false if the WebNotification went out of scope in\n  \/\/ the page before the associated toast was closed by the user.\n  if (found)\n    notification.dispatchCloseEvent(by_user);\n  manager_.UnregisterNotification(id);\n}\n\nvoid NotificationProvider::OnPermissionRequestComplete(int id) {\n  WebNotificationPermissionCallback* callback = manager_.GetCallback(id);\n  DCHECK(callback);\n  callback->permissionRequestComplete();\n  manager_.OnPermissionRequestComplete(id);\n}\n\nbool NotificationProvider::Send(IPC::Message* message) {\n  return RenderThread::current()->Send(message);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Filename: drawableRegion.cxx\n\/\/ Created by:  drose (11Jul02)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) Carnegie Mellon University.  All rights reserved.\n\/\/\n\/\/ All use of this software is subject to the terms of the revised BSD\n\/\/ license.  You should have received a copy of this license along\n\/\/ with this source code in a file named \"LICENSE.\"\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"drawableRegion.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::Destructor\n\/\/       Access: Public, Virtual\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDrawableRegion::\n~DrawableRegion() {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::set_clear_active\n\/\/       Access: Published, Virtual\n\/\/  Description: Sets the clear-active flag for any bitplane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\nset_clear_active(int n, bool clear_active) {\n  nassertv((n >= 0)&&(n < RTP_COUNT));\n  _clear_active[n] = clear_active;\n  update_pixel_factor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::get_clear_active\n\/\/       Access: Published, Virtual\n\/\/  Description: Gets the clear-active flag for any bitplane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool DrawableRegion::\nget_clear_active(int n) const {\n  nassertr((n >= 0)&&(n < RTP_COUNT), false);\n  return _clear_active[n];\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::set_clear_value\n\/\/       Access: Published, Virtual\n\/\/  Description: Sets the clear value for any bitplane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\nset_clear_value(int n, const Colorf &clear_value) {\n  nassertv((n >= 0) && (n < RTP_COUNT));\n  _clear_value[n] = clear_value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::get_clear_value\n\/\/       Access: Published, Virtual\n\/\/  Description: Returns the clear value for any bitplane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst Colorf &DrawableRegion::\nget_clear_value(int n) const {\n  static Colorf blank(0.5,0.5,0.5,0.0);\n  nassertr((n >= 0) && (n < RTP_COUNT), blank);\n  return _clear_value[n];\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::disable_clears\n\/\/       Access: Published, Virtual\n\/\/  Description: Disables both the color and depth clear.  See\n\/\/               set_clear_color_active and set_clear_depth_active.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\ndisable_clears() {\n  for (int i = 0; i < RTP_COUNT; ++i) {\n    _clear_active[i] = false;\n  }\n  update_pixel_factor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::is_any_clear_active\n\/\/       Access: Published, Virtual\n\/\/  Description: Returns true if any of the clear types (so far there\n\/\/               are just color or depth) have been set active, or\n\/\/               false if none of them are active and there is no need\n\/\/               to clear.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool DrawableRegion::\nis_any_clear_active() const {\n  for (int i = 0; i < RTP_COUNT; ++i) {\n    if (get_clear_active(i)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::set_pixel_zoom\n\/\/       Access: Published, Virtual\n\/\/  Description: Sets the amount by which the pixels of the region are\n\/\/               scaled internally when filling the image interally.\n\/\/               Setting this number larger makes the pixels blockier,\n\/\/               but may make the rendering faster, particularly for\n\/\/               software renderers.  Setting this number to 2.0\n\/\/               reduces the number of pixels that have to be filled\n\/\/               by the renderer by a factor of 2.0.  It doesn't make\n\/\/               sense to set this lower than 1.0.\n\/\/\n\/\/               It is possible to set this on either individual\n\/\/               DisplayRegions or on overall GraphicsWindows, but you\n\/\/               will get better performance for setting it on the\n\/\/               window rather than its individual DisplayRegions.\n\/\/               Also, you may not set it on a DisplayRegion that\n\/\/               doesn't have both clear_color() and clear_depth()\n\/\/               enabled.\n\/\/\n\/\/               This property is only supported on renderers for\n\/\/               which it is particularly useful--currently, this is\n\/\/               the tinydisplay software renderer.  Other kinds of\n\/\/               renderers allow you to set this property, but ignore\n\/\/               it.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\nset_pixel_zoom(float pixel_zoom) {\n  _pixel_zoom = pixel_zoom;\n  update_pixel_factor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::supports_pixel_zoom\n\/\/       Access: Published, Virtual\n\/\/  Description: Returns true if a call to set_pixel_zoom() will be\n\/\/               respected, false if it will be ignored.  If this\n\/\/               returns false, then get_pixel_factor() will always\n\/\/               return 1.0, regardless of what value you specify for\n\/\/               set_pixel_zoom().\n\/\/\n\/\/               This may return false if the underlying renderer\n\/\/               doesn't support pixel zooming, or if you have called\n\/\/               this on a DisplayRegion that doesn't have both\n\/\/               set_clear_color() and set_clear_depth() enabled.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool DrawableRegion::\nsupports_pixel_zoom() const {\n  return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::get_renderbuffer_type\n\/\/       Access: Static, Published\n\/\/  Description: Returns the RenderBuffer::Type that corresponds\n\/\/               to a RenderTexturePlane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint DrawableRegion::\nget_renderbuffer_type(int rtp) {\n  switch(rtp) {\n  case RTP_stencil:        return RenderBuffer::T_stencil;\n  case RTP_depth:          return RenderBuffer::T_depth;\n  case RTP_depth_stencil:  return RenderBuffer::T_depth;\n  case RTP_color:          return RenderBuffer::T_color;\n  case RTP_aux_rgba_0:     return RenderBuffer::T_aux_rgba_0;\n  case RTP_aux_rgba_1:     return RenderBuffer::T_aux_rgba_1;\n  case RTP_aux_rgba_2:     return RenderBuffer::T_aux_rgba_2;\n  case RTP_aux_rgba_3:     return RenderBuffer::T_aux_rgba_3;\n  case RTP_aux_hrgba_0:    return RenderBuffer::T_aux_hrgba_0;\n  case RTP_aux_hrgba_1:    return RenderBuffer::T_aux_hrgba_1;\n  case RTP_aux_hrgba_2:    return RenderBuffer::T_aux_hrgba_2;\n  case RTP_aux_hrgba_3:    return RenderBuffer::T_aux_hrgba_3;\n  case RTP_aux_float_0:    return RenderBuffer::T_aux_float_0;\n  case RTP_aux_float_1:    return RenderBuffer::T_aux_float_1;\n  case RTP_aux_float_2:    return RenderBuffer::T_aux_float_2;\n  case RTP_aux_float_3:    return RenderBuffer::T_aux_float_3;\n  default:\n    display_cat.error() << \"DrawableRegion::get_renderbuffer_type unexpected case!\\n\";\n    return 0;\n  };\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::pixel_factor_changed\n\/\/       Access: Published, Virtual\n\/\/  Description: Called internally when the pixel factor changes.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\npixel_factor_changed() {\n}\n<commit_msg>fix comment<commit_after>\/\/ Filename: drawableRegion.cxx\n\/\/ Created by:  drose (11Jul02)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) Carnegie Mellon University.  All rights reserved.\n\/\/\n\/\/ All use of this software is subject to the terms of the revised BSD\n\/\/ license.  You should have received a copy of this license along\n\/\/ with this source code in a file named \"LICENSE.\"\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"drawableRegion.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::Destructor\n\/\/       Access: Public, Virtual\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDrawableRegion::\n~DrawableRegion() {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::set_clear_active\n\/\/       Access: Published, Virtual\n\/\/  Description: Sets the clear-active flag for any bitplane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\nset_clear_active(int n, bool clear_active) {\n  nassertv((n >= 0)&&(n < RTP_COUNT));\n  _clear_active[n] = clear_active;\n  update_pixel_factor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::get_clear_active\n\/\/       Access: Published, Virtual\n\/\/  Description: Gets the clear-active flag for any bitplane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool DrawableRegion::\nget_clear_active(int n) const {\n  nassertr((n >= 0)&&(n < RTP_COUNT), false);\n  return _clear_active[n];\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::set_clear_value\n\/\/       Access: Published, Virtual\n\/\/  Description: Sets the clear value for any bitplane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\nset_clear_value(int n, const Colorf &clear_value) {\n  nassertv((n >= 0) && (n < RTP_COUNT));\n  _clear_value[n] = clear_value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::get_clear_value\n\/\/       Access: Published, Virtual\n\/\/  Description: Returns the clear value for any bitplane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst Colorf &DrawableRegion::\nget_clear_value(int n) const {\n  static Colorf blank(0.5,0.5,0.5,0.0);\n  nassertr((n >= 0) && (n < RTP_COUNT), blank);\n  return _clear_value[n];\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::disable_clears\n\/\/       Access: Published, Virtual\n\/\/  Description: Disables both the color and depth clear.  See\n\/\/               set_clear_color_active and set_clear_depth_active.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\ndisable_clears() {\n  for (int i = 0; i < RTP_COUNT; ++i) {\n    _clear_active[i] = false;\n  }\n  update_pixel_factor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::is_any_clear_active\n\/\/       Access: Published, Virtual\n\/\/  Description: Returns true if any of the clear types (so far there\n\/\/               are just color or depth) have been set active, or\n\/\/               false if none of them are active and there is no need\n\/\/               to clear.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool DrawableRegion::\nis_any_clear_active() const {\n  for (int i = 0; i < RTP_COUNT; ++i) {\n    if (get_clear_active(i)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::set_pixel_zoom\n\/\/       Access: Published, Virtual\n\/\/  Description: Sets the amount by which the pixels of the region are\n\/\/               scaled internally when filling the image interally.\n\/\/               Setting this number larger makes the pixels blockier,\n\/\/               but may make the rendering faster, particularly for\n\/\/               software renderers.  Setting this number to 2.0\n\/\/               reduces the number of pixels that have to be filled\n\/\/               by the renderer by a factor of 2.0.  It doesn't make\n\/\/               sense to set this lower than 1.0.\n\/\/\n\/\/               It is possible to set this on either individual\n\/\/               DisplayRegions or on overall GraphicsWindows, but you\n\/\/               will get better performance for setting it on the\n\/\/               window rather than its individual DisplayRegions.\n\/\/               Also, you may not set it on a DisplayRegion that\n\/\/               doesn't have both clear_color() and clear_depth()\n\/\/               enabled.\n\/\/\n\/\/               This property is only supported on renderers for\n\/\/               which it is particularly useful--currently, this is\n\/\/               the tinydisplay software renderer.  Other kinds of\n\/\/               renderers allow you to set this property, but ignore\n\/\/               it.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\nset_pixel_zoom(float pixel_zoom) {\n  _pixel_zoom = pixel_zoom;\n  update_pixel_factor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::supports_pixel_zoom\n\/\/       Access: Published, Virtual\n\/\/  Description: Returns true if a call to set_pixel_zoom() will be\n\/\/               respected, false if it will be ignored.  If this\n\/\/               returns false, then get_pixel_factor() will always\n\/\/               return 1.0, regardless of what value you specify for\n\/\/               set_pixel_zoom().\n\/\/\n\/\/               This may return false if the underlying renderer\n\/\/               doesn't support pixel zooming, or if you have called\n\/\/               this on a DisplayRegion that doesn't have both\n\/\/               set_clear_color() and set_clear_depth() enabled.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool DrawableRegion::\nsupports_pixel_zoom() const {\n  return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::get_renderbuffer_type\n\/\/       Access: Static, Published\n\/\/  Description: Returns the RenderBuffer::Type that corresponds\n\/\/               to a RenderTexturePlane.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint DrawableRegion::\nget_renderbuffer_type(int rtp) {\n  switch(rtp) {\n  case RTP_stencil:        return RenderBuffer::T_stencil;\n  case RTP_depth:          return RenderBuffer::T_depth;\n  case RTP_depth_stencil:  return RenderBuffer::T_depth;\n  case RTP_color:          return RenderBuffer::T_color;\n  case RTP_aux_rgba_0:     return RenderBuffer::T_aux_rgba_0;\n  case RTP_aux_rgba_1:     return RenderBuffer::T_aux_rgba_1;\n  case RTP_aux_rgba_2:     return RenderBuffer::T_aux_rgba_2;\n  case RTP_aux_rgba_3:     return RenderBuffer::T_aux_rgba_3;\n  case RTP_aux_hrgba_0:    return RenderBuffer::T_aux_hrgba_0;\n  case RTP_aux_hrgba_1:    return RenderBuffer::T_aux_hrgba_1;\n  case RTP_aux_hrgba_2:    return RenderBuffer::T_aux_hrgba_2;\n  case RTP_aux_hrgba_3:    return RenderBuffer::T_aux_hrgba_3;\n  case RTP_aux_float_0:    return RenderBuffer::T_aux_float_0;\n  case RTP_aux_float_1:    return RenderBuffer::T_aux_float_1;\n  case RTP_aux_float_2:    return RenderBuffer::T_aux_float_2;\n  case RTP_aux_float_3:    return RenderBuffer::T_aux_float_3;\n  default:\n    display_cat.error() << \"DrawableRegion::get_renderbuffer_type unexpected case!\\n\";\n    return 0;\n  };\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: DrawableRegion::pixel_factor_changed\n\/\/       Access: Protected, Virtual\n\/\/  Description: Called internally when the pixel factor changes.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid DrawableRegion::\npixel_factor_changed() {\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2019 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * See the LICENSE.PROPRIETARY file in the top-level directory for licensing information.\n *\/\n\n#include \"alternator\/server.hh\"\n#include \"log.hh\"\n#include <seastar\/http\/function_handlers.hh>\n#include <seastar\/json\/json_elements.hh>\n#include <seastarx.hh>\n#include <boost\/algorithm\/string\/split.hpp>\n#include <boost\/algorithm\/string\/classification.hpp>\n#include \"error.hh\"\n\nstatic logging::logger slogger(\"alternator-server\");\n\nusing namespace httpd;\n\nnamespace alternator {\n\nstatic constexpr auto TARGET = \"X-Amz-Target\";\n\ninline std::vector<sstring> split(const sstring& text, const char* separator) {\n    if (text == \"\") {\n        return std::vector<sstring>();\n    }\n    std::vector<sstring> tokens;\n    return boost::split(tokens, text, boost::is_any_of(separator));\n}\n\n\/\/ DynamoDB HTTP error responses are structured as follows\n\/\/ https:\/\/docs.aws.amazon.com\/amazondynamodb\/latest\/developerguide\/Programming.Errors.html\n\/\/ Our handlers throw an exception to report an error. If the exception\n\/\/ is of type alternator::api_error, it unwrapped and properly reported to\n\/\/ the user directly. Other exceptions are unexpected, and reported as\n\/\/ Internal Server Error.\nclass api_handler : public handler_base {\npublic:\n    api_handler(const future_json_function& _handle) : _f_handle(\n         [_handle](std::unique_ptr<request> req, std::unique_ptr<reply> rep) {\n         return seastar::futurize_apply(_handle, std::move(req)).then_wrapped([rep = std::move(rep)](future<json::json_return_type> resf) mutable {\n             if (resf.failed()) {\n                 \/\/ Exceptions of type api_error are wrapped as JSON and\n                 \/\/ returned to the client as expected. Other types of\n                 \/\/ exceptions are unexpected, and returned to the user\n                 \/\/ as an internal server error:\n                 api_error ret;\n                 try {\n                     resf.get();\n                 } catch (api_error &ae) {\n                     ret = ae;\n                 } catch (...) {\n                     ret = api_error(\n                             \"Internal Server Error\",\n                             format(\"Internal server error: {}\", std::current_exception()),\n                             reply::status_type::internal_server_error);\n                 }\n                 \/\/ FIXME: what is this version number?\n                 rep->_content += \"{\\\"__type\\\":\\\"com.amazonaws.dynamodb.v20120810#\" + ret._type + \"\\\",\" +\n                         \"\\\"message\\\":\\\"\" + ret._msg + \"\\\"}\";\n                 rep->_status = ret._http_code;\n                 slogger.trace(\"api_handler error case: {}\", rep->_content);\n                 return make_ready_future<std::unique_ptr<reply>>(std::move(rep));\n             }\n             slogger.trace(\"api_handler success case\");\n             auto res = resf.get0();\n             if (res._body_writer) {\n                 rep->write_body(\"json\", std::move(res._body_writer));\n             } else {\n                 rep->_content += res._res;\n             }\n             return make_ready_future<std::unique_ptr<reply>>(std::move(rep));\n         });\n    }), _type(\"json\") { }\n\n    api_handler(const api_handler&) = default;\n    future<std::unique_ptr<reply>> handle(const sstring& path,\n            std::unique_ptr<request> req, std::unique_ptr<reply> rep) override {\n        return _f_handle(std::move(req), std::move(rep)).then(\n                [this](std::unique_ptr<reply> rep) {\n                    rep->done(_type);\n                    return make_ready_future<std::unique_ptr<reply>>(std::move(rep));\n                });\n    }\n\nprotected:\n    future_handler_function _f_handle;\n    sstring _type;\n};\n\nvoid server::set_routes(routes& r) {\n    using alternator_callback = std::function<future<json::json_return_type>(executor&, std::unique_ptr<request>)>;\n    std::unordered_map<std::string, alternator_callback> routes{\n        {\"CreateTable\", [] (executor& e, std::unique_ptr<request> req) { return e.create_table(req->content); }},\n        {\"DescribeTable\", [] (executor& e, std::unique_ptr<request> req) { return e.describe_table(req->content); }},\n        {\"DeleteTable\", [] (executor& e, std::unique_ptr<request> req) { return e.delete_table(req->content); }},\n        {\"PutItem\", [] (executor& e, std::unique_ptr<request> req) { return e.put_item(req->content); }},\n        {\"UpdateItem\", [] (executor& e, std::unique_ptr<request> req) { return e.update_item(req->content); }},\n        {\"GetItem\", [] (executor& e, std::unique_ptr<request> req) { return e.get_item(req->content); }},\n        {\"DeleteItem\", [] (executor& e, std::unique_ptr<request> req) { return e.delete_item(req->content); }},\n        {\"ListTables\", [] (executor& e, std::unique_ptr<request> req) { return e.list_tables(req->content); }},\n        {\"Scan\", [] (executor& e, std::unique_ptr<request> req) { return e.scan(req->content); }},\n        {\"DescribeEndpoints\", [] (executor& e, std::unique_ptr<request> req) { return e.describe_endpoints(req->content, req->get_header(\"Host\")); }},\n        {\"BatchWriteItem\", [] (executor& e, std::unique_ptr<request> req) { return e.batch_write_item(req->content); }},\n        {\"BatchGetItem\", [] (executor& e, std::unique_ptr<request> req) { return e.batch_get_item(req->content); }},\n        {\"Query\", [] (executor& e, std::unique_ptr<request> req) { return e.query(req->content); }},\n    };\n\n    api_handler* handler = new api_handler([this, routes = std::move(routes)](std::unique_ptr<request> req) -> future<json::json_return_type> {\n        _executor.local()._stats.total_operations++;\n        slogger.trace(\"Raw request: {} ({})\", req->content, req->content_length);\n        sstring target = req->get_header(TARGET);\n        std::vector<sstring> split_target = split(target, \".\");\n        \/\/NOTICE(sarna): Target consists of Dynamo API version folllowed by a dot '.' and operation type (e.g. CreateTable)\n        sstring op = split_target.empty() ? sstring() : split_target.back();\n\n        slogger.trace(\"Request type: {}\", op);\n        auto callback_it = routes.find(op);\n        if (callback_it == routes.end()) {\n            _executor.local()._stats.unsupported_operations++;\n            throw api_error(\"UnknownOperationException\",\n                    format(\"Unsupported operation {}\", op));\n        }\n        return callback_it->second(_executor.local(), std::move(req));\n    });\n\n    r.add(operation_type::POST, url(\"\/\"), handler);\n}\n\nfuture<> server::init(uint16_t port) {\n    return _executor.invoke_on_all([] (executor& e) {\n        return e.start();\n    }).then([this] {\n        return _control.start();\n    }).then([this] {\n        return _control.set_routes(std::bind(&server::set_routes, this, std::placeholders::_1));\n    }).then([this, port] {\n        return _control.listen(port);\n    }).then([port] {\n        slogger.info(\"Alternator HTTP server listening on port {}\", port);\n    }).handle_exception([port] (std::exception_ptr e) {\n        slogger.warn(\"Failed to set up Alternator HTTP server on port {}: {}\", port, e);\n    });\n}\n\n}\n\n<commit_msg>alternator: add handling rapidjson errors in the server<commit_after>\/*\n * Copyright 2019 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * See the LICENSE.PROPRIETARY file in the top-level directory for licensing information.\n *\/\n\n#include \"alternator\/server.hh\"\n#include \"log.hh\"\n#include <seastar\/http\/function_handlers.hh>\n#include <seastar\/json\/json_elements.hh>\n#include <seastarx.hh>\n#include <boost\/algorithm\/string\/split.hpp>\n#include <boost\/algorithm\/string\/classification.hpp>\n#include \"error.hh\"\n#include \"rjson.hh\"\n\nstatic logging::logger slogger(\"alternator-server\");\n\nusing namespace httpd;\n\nnamespace alternator {\n\nstatic constexpr auto TARGET = \"X-Amz-Target\";\n\ninline std::vector<sstring> split(const sstring& text, const char* separator) {\n    if (text == \"\") {\n        return std::vector<sstring>();\n    }\n    std::vector<sstring> tokens;\n    return boost::split(tokens, text, boost::is_any_of(separator));\n}\n\n\/\/ DynamoDB HTTP error responses are structured as follows\n\/\/ https:\/\/docs.aws.amazon.com\/amazondynamodb\/latest\/developerguide\/Programming.Errors.html\n\/\/ Our handlers throw an exception to report an error. If the exception\n\/\/ is of type alternator::api_error, it unwrapped and properly reported to\n\/\/ the user directly. Other exceptions are unexpected, and reported as\n\/\/ Internal Server Error.\nclass api_handler : public handler_base {\npublic:\n    api_handler(const future_json_function& _handle) : _f_handle(\n         [_handle](std::unique_ptr<request> req, std::unique_ptr<reply> rep) {\n         return seastar::futurize_apply(_handle, std::move(req)).then_wrapped([rep = std::move(rep)](future<json::json_return_type> resf) mutable {\n             if (resf.failed()) {\n                 \/\/ Exceptions of type api_error are wrapped as JSON and\n                 \/\/ returned to the client as expected. Other types of\n                 \/\/ exceptions are unexpected, and returned to the user\n                 \/\/ as an internal server error:\n                 api_error ret;\n                 try {\n                     resf.get();\n                 } catch (api_error &ae) {\n                     ret = ae;\n                 } catch (rjson::error & re) {\n                     ret = api_error(\"ValidationException\", re.what());\n                 } catch (...) {\n                     ret = api_error(\n                             \"Internal Server Error\",\n                             format(\"Internal server error: {}\", std::current_exception()),\n                             reply::status_type::internal_server_error);\n                 }\n                 \/\/ FIXME: what is this version number?\n                 rep->_content += \"{\\\"__type\\\":\\\"com.amazonaws.dynamodb.v20120810#\" + ret._type + \"\\\",\" +\n                         \"\\\"message\\\":\\\"\" + ret._msg + \"\\\"}\";\n                 rep->_status = ret._http_code;\n                 slogger.trace(\"api_handler error case: {}\", rep->_content);\n                 return make_ready_future<std::unique_ptr<reply>>(std::move(rep));\n             }\n             slogger.trace(\"api_handler success case\");\n             auto res = resf.get0();\n             if (res._body_writer) {\n                 rep->write_body(\"json\", std::move(res._body_writer));\n             } else {\n                 rep->_content += res._res;\n             }\n             return make_ready_future<std::unique_ptr<reply>>(std::move(rep));\n         });\n    }), _type(\"json\") { }\n\n    api_handler(const api_handler&) = default;\n    future<std::unique_ptr<reply>> handle(const sstring& path,\n            std::unique_ptr<request> req, std::unique_ptr<reply> rep) override {\n        return _f_handle(std::move(req), std::move(rep)).then(\n                [this](std::unique_ptr<reply> rep) {\n                    rep->done(_type);\n                    return make_ready_future<std::unique_ptr<reply>>(std::move(rep));\n                });\n    }\n\nprotected:\n    future_handler_function _f_handle;\n    sstring _type;\n};\n\nvoid server::set_routes(routes& r) {\n    using alternator_callback = std::function<future<json::json_return_type>(executor&, std::unique_ptr<request>)>;\n    std::unordered_map<std::string, alternator_callback> routes{\n        {\"CreateTable\", [] (executor& e, std::unique_ptr<request> req) { return e.create_table(req->content); }},\n        {\"DescribeTable\", [] (executor& e, std::unique_ptr<request> req) { return e.describe_table(req->content); }},\n        {\"DeleteTable\", [] (executor& e, std::unique_ptr<request> req) { return e.delete_table(req->content); }},\n        {\"PutItem\", [] (executor& e, std::unique_ptr<request> req) { return e.put_item(req->content); }},\n        {\"UpdateItem\", [] (executor& e, std::unique_ptr<request> req) { return e.update_item(req->content); }},\n        {\"GetItem\", [] (executor& e, std::unique_ptr<request> req) { return e.get_item(req->content); }},\n        {\"DeleteItem\", [] (executor& e, std::unique_ptr<request> req) { return e.delete_item(req->content); }},\n        {\"ListTables\", [] (executor& e, std::unique_ptr<request> req) { return e.list_tables(req->content); }},\n        {\"Scan\", [] (executor& e, std::unique_ptr<request> req) { return e.scan(req->content); }},\n        {\"DescribeEndpoints\", [] (executor& e, std::unique_ptr<request> req) { return e.describe_endpoints(req->content, req->get_header(\"Host\")); }},\n        {\"BatchWriteItem\", [] (executor& e, std::unique_ptr<request> req) { return e.batch_write_item(req->content); }},\n        {\"BatchGetItem\", [] (executor& e, std::unique_ptr<request> req) { return e.batch_get_item(req->content); }},\n        {\"Query\", [] (executor& e, std::unique_ptr<request> req) { return e.query(req->content); }},\n    };\n\n    api_handler* handler = new api_handler([this, routes = std::move(routes)](std::unique_ptr<request> req) -> future<json::json_return_type> {\n        _executor.local()._stats.total_operations++;\n        slogger.trace(\"Raw request: {} ({})\", req->content, req->content_length);\n        sstring target = req->get_header(TARGET);\n        std::vector<sstring> split_target = split(target, \".\");\n        \/\/NOTICE(sarna): Target consists of Dynamo API version folllowed by a dot '.' and operation type (e.g. CreateTable)\n        sstring op = split_target.empty() ? sstring() : split_target.back();\n\n        slogger.trace(\"Request type: {}\", op);\n        auto callback_it = routes.find(op);\n        if (callback_it == routes.end()) {\n            _executor.local()._stats.unsupported_operations++;\n            throw api_error(\"UnknownOperationException\",\n                    format(\"Unsupported operation {}\", op));\n        }\n        return callback_it->second(_executor.local(), std::move(req));\n    });\n\n    r.add(operation_type::POST, url(\"\/\"), handler);\n}\n\nfuture<> server::init(uint16_t port) {\n    return _executor.invoke_on_all([] (executor& e) {\n        return e.start();\n    }).then([this] {\n        return _control.start();\n    }).then([this] {\n        return _control.set_routes(std::bind(&server::set_routes, this, std::placeholders::_1));\n    }).then([this, port] {\n        return _control.listen(port);\n    }).then([port] {\n        slogger.info(\"Alternator HTTP server listening on port {}\", port);\n    }).handle_exception([port] (std::exception_ptr e) {\n        slogger.warn(\"Failed to set up Alternator HTTP server on port {}: {}\", port, e);\n    });\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************\/\n\/* drawpanel.cpp - fonctions des classes du type WinEDA_DrawPanel *\/\n\/******************************************************************\/\n\n#ifdef __GNUG__\n#pragma implementation\n#endif\n\n#include \"fctsys.h\"\n#include \"common.h\"\n\n\n\/* defines locaux *\/\n#define CURSOR_SIZE 12  \/* taille de la croix du curseur PCB *\/\n\n\/*******************************************************\/\n\/* Class BASE_SCREEN: classe de gestion d'un affichage *\/\n\/*******************************************************\/\nBASE_SCREEN::BASE_SCREEN( int idscreen, KICAD_T aType ) : \n    EDA_BaseStruct( aType )\n{\n    EEDrawList = NULL;   \/* Schematic items list *\/\n    m_Type     = idscreen;\n    m_ZoomList = NULL;\n    m_GridList = NULL;\n    m_UndoList = NULL;\n    m_RedoList = NULL;\n    m_UndoRedoCountMax = 1;\n    m_FirstRedraw = TRUE;\n    InitDatas();\n}\n\n\n\/******************************\/\nBASE_SCREEN::~BASE_SCREEN()\n\/******************************\/\n{\n    if( m_ZoomList )\n        free( m_ZoomList );\n    if( m_GridList )\n        free( m_GridList );\n    ClearUndoRedoList();\n}\n\n\n\/*******************************\/\nvoid BASE_SCREEN::InitDatas()\n\/*******************************\/\n{\n    m_SheetNumber = m_NumberOfSheet = 1;    \/* gestion hierarchie: Root: SheetNumber = 1 *\/\n    m_Zoom            = 32;\n    m_Grid            = wxSize( 50, 50 );   \/* pas de la grille *\/\n    m_UserGrid        = g_UserGrid;         \/* pas de la grille \"utilisateur\" *\/\n    m_UserGridIsON    = FALSE;\n    m_UserGridUnit    = g_UserGrid_Unit;\n    m_Diviseur_Grille = 1;\n    m_Center          = TRUE;\n\n    \/* offsets pour tracer le circuit sur l'ecran *\/\n    switch( m_Type ) \/\/ Init taille sheet par defaut\n    {\n    case SCHEMATIC_FRAME:\n        m_Center = FALSE;\n        m_CurrentSheet = &g_Sheet_A4;\n        break;\n\n    default:\n    case CVPCB_DISPLAY_FRAME:\n    case MODULE_EDITOR_FRAME:\n    case PCB_FRAME:\n        m_CurrentSheet = &g_Sheet_A4;\n        break;\n\n    case GERBER_FRAME:\n        m_CurrentSheet = &g_Sheet_GERBER;\n        break;\n    }\n\n    if( m_Center )\n    {\n        m_Curseur.x = m_Curseur.y = 0;\n        m_DrawOrg.x = -ReturnPageSize().x \/ 2;\n        m_DrawOrg.y = -ReturnPageSize().y \/ 2;\n    }\n    else\n    {\n        m_DrawOrg.x = m_DrawOrg.y = 0;\n        m_Curseur.x = ReturnPageSize().x \/ 2;\n        m_Curseur.y = ReturnPageSize().y \/ 2;\n    }\n\n    \/\/ DrawOrg est rendu multiple du zoom min :\n    m_DrawOrg.x -= m_DrawOrg.x % 256; \n    m_DrawOrg.y -= m_DrawOrg.y % 256;\n\n    m_O_Curseur = m_Curseur;\n\n    SetCurItem( NULL );\n\n    \/* indicateurs divers *\/\n    m_FlagRefreshReq = 0;               \/* indique que l'ecran doit redessine *\/\n    m_FlagModified   = 0;               \/\/ indique modif du PCB,utilise pour eviter une sortie sans sauvegarde\n    m_FlagSave = 1;                     \/\/ indique sauvegarde auto faite\n}\n\n\n\/******************************************************************\/\nwxPoint BASE_SCREEN::CursorRealPosition( const wxPoint& ScreenPos )\n\/******************************************************************\/\n{\n    wxPoint curpos;\n\n    curpos.x = ScreenPos.x* GetZoom();\n\n    curpos.y = ScreenPos.y* GetZoom();\n\n    curpos.x += m_DrawOrg.x;\n    curpos.y += m_DrawOrg.y;\n\n    return curpos;\n}\n\n\n\/***************************************\/\nint BASE_SCREEN::GetInternalUnits()\n\/***************************************\/\n{\n    switch( m_Type )\n    {\n    default:\n    case SCHEMATIC_FRAME:\n        return EESCHEMA_INTERNAL_UNIT;\n        break;\n\n    case GERBER_FRAME:\n    case CVPCB_DISPLAY_FRAME:\n    case MODULE_EDITOR_FRAME:\n    case PCB_FRAME:\n        return PCB_INTERNAL_UNIT;\n    }\n}\n\n\n\/*****************************************\/\nwxSize BASE_SCREEN::ReturnPageSize()\n\/*****************************************\/\n\n\/* Retourne en unites internes la taille de la feuille de dessin\n *  (la taille de la feuille est connue en 1\/1000 \")\n *\/\n{\n    wxSize PageSize;\n\n    switch( m_Type )\n    {\n    default:\n    case SCHEMATIC_FRAME:\n        PageSize = m_CurrentSheet->m_Size;\n        break;\n\n    case GERBER_FRAME:\n    case CVPCB_DISPLAY_FRAME:\n    case MODULE_EDITOR_FRAME:\n    case PCB_FRAME:\n        PageSize.x = m_CurrentSheet->m_Size.x * (PCB_INTERNAL_UNIT \/ 1000);\n        PageSize.y = m_CurrentSheet->m_Size.y * (PCB_INTERNAL_UNIT \/ 1000);\n        break;\n    }\n\n    return PageSize;\n}\n\n\n\/********************************************\/\nvoid BASE_SCREEN::SetZoomList( int* zoomlist )\n\/********************************************\/\n\n\/* init liste des zoom (NULL terminated)\n *\/\n{\n    int ii, nbitems, * zoom;\n\n    \/\/ Decompte des items\n    for( nbitems = 1, zoom = zoomlist;  ; zoom++, nbitems++ )\n    {\n        if( *zoom == 0 )\n            break;\n    }\n\n    \/\/ Init liste\n    if( m_ZoomList )\n        free( m_ZoomList );\n    m_ZoomList = (int*) MyZMalloc( nbitems * sizeof( int) );\n\n    for( ii = 0, zoom = zoomlist; ii < nbitems; zoom++, ii++ )\n    {\n        m_ZoomList[ii] = *zoom;\n    }\n}\n\n\n\/***********************************\/\nvoid BASE_SCREEN::SetFirstZoom()\n\/***********************************\/\n\/* ajuste le coeff de zoom a 1*\/\n{\n    m_Zoom = 1;\n}\n\n\n\/****************************\/\nint BASE_SCREEN::GetZoom()\n\/****************************\/\n\/* retourne le coeff de zoom *\/\n{\n    return m_Zoom;\n}\n\n\n\/***********************************\/\nvoid BASE_SCREEN::SetZoom( int coeff )\n\/***********************************\/\n\/* ajuste le coeff de zoom a coeff *\/\n{\n    m_Zoom = coeff;\n    if( m_Zoom < 1 )\n        m_Zoom = 1;\n}\n\n\n\/********************************\/\nvoid BASE_SCREEN::SetNextZoom()\n\/********************************\/\n\n\/* Selectionne le prochain coeff de zoom\n *\/\n{\n    m_Zoom *= 2;\n\n    if( m_ZoomList == NULL )\n        return;\n\n    int ii, zoom_max = 512;\n    for( ii = 0; m_ZoomList[ii] != 0; ii++ )\n        zoom_max = m_ZoomList[ii];\n\n    if( m_Zoom > zoom_max )\n        m_Zoom = zoom_max;\n}\n\n\n\/*************************************\/\nvoid BASE_SCREEN::SetPreviousZoom()\n\/*************************************\/\n\n\/* Selectionne le precedent coeff de zoom\n *\/\n{\n    m_Zoom \/= 2;\n    if( m_Zoom < 1 )\n        m_Zoom = 1;\n}\n\n\n\/**********************************\/\nvoid BASE_SCREEN::SetLastZoom()\n\/**********************************\/\n\n\/* ajuste le coeff de zoom au max\n *\/\n{\n    if( m_ZoomList == NULL )\n        return;\n    int ii;\n    for( ii = 0; m_ZoomList[ii] != 0; ii++ )\n        m_Zoom = m_ZoomList[ii];\n}\n\n\n\/********************************************\/\nvoid BASE_SCREEN::SetGridList( wxSize* gridlist )\n\/********************************************\/\n\n\/* init liste des zoom (NULL terminated)\n *\/\n{\n    int     ii, nbitems;\n    wxSize* grid;\n\n    \/\/ Decompte des items\n    for( nbitems = 0, grid = gridlist;  ; grid++, nbitems++ )\n    {\n        if( (grid->x <= 0) || (grid->y <= 0) )\n            break;\n    }\n\n    \/\/ Init liste\n    if( m_GridList )\n        free( m_GridList );\n    m_GridList = (wxSize*) MyZMalloc( nbitems * sizeof(wxSize) );\n\n    for( ii = 0, grid = gridlist; ii < nbitems; grid++, ii++ )\n    {\n        m_GridList[ii] = *grid;\n    }\n}\n\n\n\/**********************************************\/\nvoid BASE_SCREEN::SetGrid( const wxSize& size )\n\/**********************************************\/\n{\n    if( m_GridList == NULL )\n        return;\n\n    if( (size.x <= 0) || (size.y <= 0) )\n    {\n        m_UserGrid     = g_UserGrid;\n        m_UserGridIsON = TRUE;\n    }\n    else\n    {\n        m_Grid = size;\n        m_UserGridIsON = FALSE;\n    }\n}\n\n\n\/*********************************\/\nwxSize BASE_SCREEN::GetGrid()\n\/*********************************\/\n{\n    wxSize grid = m_Grid;\n    double xx, scale;\n\n    if( m_GridList == NULL )\n        return wxSize( 1, 1 );\n\n    if( m_UserGridIsON || m_Grid.x < 0 || m_Grid.y < 0 )\n    {\n        if( m_UserGridUnit == INCHES )\n            scale = 10000;\n        else\n            scale = 10000 \/ 25.4;\n        xx     = m_UserGrid.x * scale;\n        grid.x = (int) (xx + 0.5);\n        xx     = m_UserGrid.y * scale;\n        grid.y = (int) (xx + 0.5);\n    }\n    return grid;\n}\n\n\n\/*********************************\/\nvoid BASE_SCREEN::SetNextGrid()\n\/*********************************\/\n\n\/* Selectionne la prochaine grille\n *\/\n{\n    int ii;\n\n    if( m_GridList == NULL )\n        return;\n\n    for( ii = 0; ; ii++ )\n    {\n        if( m_GridList[ii].x <= 0 )\n            break;\n        if( (m_Grid.x == m_GridList[ii].x) && (m_Grid.y == m_GridList[ii].y) )\n            break;\n    }\n\n    if( (m_GridList[ii].x > 0) && (ii > 0) )\n        m_Grid = m_GridList[ii - 1];\n}\n\n\n\/*************************************\/\nvoid BASE_SCREEN::SetPreviousGrid()\n\/*************************************\/\n\n\/* Selectionne le precedent coeff de grille\n *\/\n{\n    int ii;\n\n    if( m_GridList == NULL )\n        return;\n\n    for( ii = 0; ; ii++ )\n    {\n        if( m_GridList[ii].x <= 0 )\n            break;\n        if( (m_Grid.x == m_GridList[ii].x) && (m_Grid.y == m_GridList[ii].y) )\n            break;\n    }\n\n    if( (m_GridList[ii].x > 0) && (m_GridList[ii + 1].x > 0) )\n        m_Grid = m_GridList[ii + 1];\n}\n\n\n\/**********************************\/\nvoid BASE_SCREEN::SetFirstGrid()\n\/**********************************\/\n\n\/* ajuste le coeff de grille a 1\n *\/\n{\n    if( m_GridList == NULL )\n        return;\n\n    int ii = 0;\n    while( m_GridList[ii].x > 0 )\n        ii++;\n\n    m_Grid = m_GridList[ii - 1];\n}\n\n\n\/**********************************\/\nvoid BASE_SCREEN::SetLastGrid()\n\/**********************************\/\n\n\/* ajuste le coeff de grille au max\n *\/\n{\n    if( m_GridList == NULL )\n        return;\n    m_Grid = m_GridList[0];\n}\n\n\n\/*****************************************\/\nvoid BASE_SCREEN::ClearUndoRedoList()\n\/*****************************************\/\n\n\/* free the undo and the redo lists\n *\/\n{\n    EDA_BaseStruct* nextitem;\n\n    while( m_UndoList )\n    {\n        nextitem = m_UndoList->Pnext;\n        delete m_UndoList;\n        m_UndoList = nextitem;\n    }\n\n    while( m_RedoList )\n    {\n        nextitem = m_RedoList->Pnext;\n        delete m_RedoList;\n        m_RedoList = nextitem;\n    }\n}\n\n\n\/***********************************************************\/\nvoid BASE_SCREEN::AddItemToUndoList( EDA_BaseStruct* newitem )\n\/************************************************************\/\n\n\/* Put newitem in head of undo list\n *  Deletes olds items if > count max.\n *\/\n{\n    int             ii;\n    EDA_BaseStruct* item, * nextitem;\n\n    if( newitem == NULL )\n        return;\n\n    newitem->Pnext = m_UndoList;\n    m_UndoList = newitem;\n\n    \/* Free first items, if count max reached *\/\n    for( ii = 0, item = m_UndoList; ii < m_UndoRedoCountMax; ii++ )\n    {\n        if( item->Pnext == NULL )\n            return;\n        item = item->Pnext;\n    }\n\n    if( item == NULL )\n        return;\n\n    nextitem    = item->Pnext;\n    item->Pnext = NULL; \/\/ Set end of chain\n\n    \/\/ Delete the extra  items\n    for( item = nextitem; item != NULL; item = nextitem )\n    {\n        nextitem = item->Pnext;\n        delete item;\n    }\n}\n\n\n\/***********************************************************\/\nvoid BASE_SCREEN::AddItemToRedoList( EDA_BaseStruct* newitem )\n\/***********************************************************\/\n{\n    int             ii;\n    EDA_BaseStruct* item, * nextitem;\n\n    if( newitem == NULL )\n        return;\n\n    newitem->Pnext = m_RedoList;\n    m_RedoList = newitem;\n    \/* Free first items, if count max reached *\/\n    for( ii = 0, item = m_RedoList; ii < m_UndoRedoCountMax; ii++ )\n    {\n        if( item->Pnext == NULL )\n            break;\n        item = item->Pnext;\n    }\n\n    if( item == NULL )\n        return;\n\n    nextitem    = item->Pnext;\n    item->Pnext = NULL; \/\/ Set end of chain\n\n    \/\/ Delete the extra items\n    for( item = nextitem; item != NULL; item = nextitem )\n    {\n        nextitem = item->Pnext;\n        delete item;\n    }\n}\n\n\n\/*****************************************************\/\nEDA_BaseStruct* BASE_SCREEN::GetItemFromUndoList()\n\/*****************************************************\/\n{\n    EDA_BaseStruct* item = m_UndoList;\n\n    if( item )\n        m_UndoList = item->Pnext;\n    return item;\n}\n\n\n\/******************************************************\/\nEDA_BaseStruct* BASE_SCREEN::GetItemFromRedoList()\n\/******************************************************\/\n{\n    EDA_BaseStruct* item = m_RedoList;\n\n    if( item )\n        m_RedoList = item->Pnext;\n    return item;\n}\n\n\nvoid BASE_SCREEN::SetCurItem( EDA_BaseStruct* aCurItem )\n{\n    \n#if defined(DEBUG)\n    printf( \"SetCurItem(%p)\\n\", aCurItem );\n#endif\n\n    m_CurrentItem = aCurItem; \n}\n<commit_msg>comment out debug printf<commit_after>\/******************************************************************\/\n\/* drawpanel.cpp - fonctions des classes du type WinEDA_DrawPanel *\/\n\/******************************************************************\/\n\n#ifdef __GNUG__\n#pragma implementation\n#endif\n\n#include \"fctsys.h\"\n#include \"common.h\"\n\n\n\/* defines locaux *\/\n#define CURSOR_SIZE 12  \/* taille de la croix du curseur PCB *\/\n\n\/*******************************************************\/\n\/* Class BASE_SCREEN: classe de gestion d'un affichage *\/\n\/*******************************************************\/\nBASE_SCREEN::BASE_SCREEN( int idscreen, KICAD_T aType ) : \n    EDA_BaseStruct( aType )\n{\n    EEDrawList = NULL;   \/* Schematic items list *\/\n    m_Type     = idscreen;\n    m_ZoomList = NULL;\n    m_GridList = NULL;\n    m_UndoList = NULL;\n    m_RedoList = NULL;\n    m_UndoRedoCountMax = 1;\n    m_FirstRedraw = TRUE;\n    InitDatas();\n}\n\n\n\/******************************\/\nBASE_SCREEN::~BASE_SCREEN()\n\/******************************\/\n{\n    if( m_ZoomList )\n        free( m_ZoomList );\n    if( m_GridList )\n        free( m_GridList );\n    ClearUndoRedoList();\n}\n\n\n\/*******************************\/\nvoid BASE_SCREEN::InitDatas()\n\/*******************************\/\n{\n    m_SheetNumber = m_NumberOfSheet = 1;    \/* gestion hierarchie: Root: SheetNumber = 1 *\/\n    m_Zoom            = 32;\n    m_Grid            = wxSize( 50, 50 );   \/* pas de la grille *\/\n    m_UserGrid        = g_UserGrid;         \/* pas de la grille \"utilisateur\" *\/\n    m_UserGridIsON    = FALSE;\n    m_UserGridUnit    = g_UserGrid_Unit;\n    m_Diviseur_Grille = 1;\n    m_Center          = TRUE;\n\n    \/* offsets pour tracer le circuit sur l'ecran *\/\n    switch( m_Type ) \/\/ Init taille sheet par defaut\n    {\n    case SCHEMATIC_FRAME:\n        m_Center = FALSE;\n        m_CurrentSheet = &g_Sheet_A4;\n        break;\n\n    default:\n    case CVPCB_DISPLAY_FRAME:\n    case MODULE_EDITOR_FRAME:\n    case PCB_FRAME:\n        m_CurrentSheet = &g_Sheet_A4;\n        break;\n\n    case GERBER_FRAME:\n        m_CurrentSheet = &g_Sheet_GERBER;\n        break;\n    }\n\n    if( m_Center )\n    {\n        m_Curseur.x = m_Curseur.y = 0;\n        m_DrawOrg.x = -ReturnPageSize().x \/ 2;\n        m_DrawOrg.y = -ReturnPageSize().y \/ 2;\n    }\n    else\n    {\n        m_DrawOrg.x = m_DrawOrg.y = 0;\n        m_Curseur.x = ReturnPageSize().x \/ 2;\n        m_Curseur.y = ReturnPageSize().y \/ 2;\n    }\n\n    \/\/ DrawOrg est rendu multiple du zoom min :\n    m_DrawOrg.x -= m_DrawOrg.x % 256; \n    m_DrawOrg.y -= m_DrawOrg.y % 256;\n\n    m_O_Curseur = m_Curseur;\n\n    SetCurItem( NULL );\n\n    \/* indicateurs divers *\/\n    m_FlagRefreshReq = 0;               \/* indique que l'ecran doit redessine *\/\n    m_FlagModified   = 0;               \/\/ indique modif du PCB,utilise pour eviter une sortie sans sauvegarde\n    m_FlagSave = 1;                     \/\/ indique sauvegarde auto faite\n}\n\n\n\/******************************************************************\/\nwxPoint BASE_SCREEN::CursorRealPosition( const wxPoint& ScreenPos )\n\/******************************************************************\/\n{\n    wxPoint curpos;\n\n    curpos.x = ScreenPos.x* GetZoom();\n\n    curpos.y = ScreenPos.y* GetZoom();\n\n    curpos.x += m_DrawOrg.x;\n    curpos.y += m_DrawOrg.y;\n\n    return curpos;\n}\n\n\n\/***************************************\/\nint BASE_SCREEN::GetInternalUnits()\n\/***************************************\/\n{\n    switch( m_Type )\n    {\n    default:\n    case SCHEMATIC_FRAME:\n        return EESCHEMA_INTERNAL_UNIT;\n        break;\n\n    case GERBER_FRAME:\n    case CVPCB_DISPLAY_FRAME:\n    case MODULE_EDITOR_FRAME:\n    case PCB_FRAME:\n        return PCB_INTERNAL_UNIT;\n    }\n}\n\n\n\/*****************************************\/\nwxSize BASE_SCREEN::ReturnPageSize()\n\/*****************************************\/\n\n\/* Retourne en unites internes la taille de la feuille de dessin\n *  (la taille de la feuille est connue en 1\/1000 \")\n *\/\n{\n    wxSize PageSize;\n\n    switch( m_Type )\n    {\n    default:\n    case SCHEMATIC_FRAME:\n        PageSize = m_CurrentSheet->m_Size;\n        break;\n\n    case GERBER_FRAME:\n    case CVPCB_DISPLAY_FRAME:\n    case MODULE_EDITOR_FRAME:\n    case PCB_FRAME:\n        PageSize.x = m_CurrentSheet->m_Size.x * (PCB_INTERNAL_UNIT \/ 1000);\n        PageSize.y = m_CurrentSheet->m_Size.y * (PCB_INTERNAL_UNIT \/ 1000);\n        break;\n    }\n\n    return PageSize;\n}\n\n\n\/********************************************\/\nvoid BASE_SCREEN::SetZoomList( int* zoomlist )\n\/********************************************\/\n\n\/* init liste des zoom (NULL terminated)\n *\/\n{\n    int ii, nbitems, * zoom;\n\n    \/\/ Decompte des items\n    for( nbitems = 1, zoom = zoomlist;  ; zoom++, nbitems++ )\n    {\n        if( *zoom == 0 )\n            break;\n    }\n\n    \/\/ Init liste\n    if( m_ZoomList )\n        free( m_ZoomList );\n    m_ZoomList = (int*) MyZMalloc( nbitems * sizeof( int) );\n\n    for( ii = 0, zoom = zoomlist; ii < nbitems; zoom++, ii++ )\n    {\n        m_ZoomList[ii] = *zoom;\n    }\n}\n\n\n\/***********************************\/\nvoid BASE_SCREEN::SetFirstZoom()\n\/***********************************\/\n\/* ajuste le coeff de zoom a 1*\/\n{\n    m_Zoom = 1;\n}\n\n\n\/****************************\/\nint BASE_SCREEN::GetZoom()\n\/****************************\/\n\/* retourne le coeff de zoom *\/\n{\n    return m_Zoom;\n}\n\n\n\/***********************************\/\nvoid BASE_SCREEN::SetZoom( int coeff )\n\/***********************************\/\n\/* ajuste le coeff de zoom a coeff *\/\n{\n    m_Zoom = coeff;\n    if( m_Zoom < 1 )\n        m_Zoom = 1;\n}\n\n\n\/********************************\/\nvoid BASE_SCREEN::SetNextZoom()\n\/********************************\/\n\n\/* Selectionne le prochain coeff de zoom\n *\/\n{\n    m_Zoom *= 2;\n\n    if( m_ZoomList == NULL )\n        return;\n\n    int ii, zoom_max = 512;\n    for( ii = 0; m_ZoomList[ii] != 0; ii++ )\n        zoom_max = m_ZoomList[ii];\n\n    if( m_Zoom > zoom_max )\n        m_Zoom = zoom_max;\n}\n\n\n\/*************************************\/\nvoid BASE_SCREEN::SetPreviousZoom()\n\/*************************************\/\n\n\/* Selectionne le precedent coeff de zoom\n *\/\n{\n    m_Zoom \/= 2;\n    if( m_Zoom < 1 )\n        m_Zoom = 1;\n}\n\n\n\/**********************************\/\nvoid BASE_SCREEN::SetLastZoom()\n\/**********************************\/\n\n\/* ajuste le coeff de zoom au max\n *\/\n{\n    if( m_ZoomList == NULL )\n        return;\n    int ii;\n    for( ii = 0; m_ZoomList[ii] != 0; ii++ )\n        m_Zoom = m_ZoomList[ii];\n}\n\n\n\/********************************************\/\nvoid BASE_SCREEN::SetGridList( wxSize* gridlist )\n\/********************************************\/\n\n\/* init liste des zoom (NULL terminated)\n *\/\n{\n    int     ii, nbitems;\n    wxSize* grid;\n\n    \/\/ Decompte des items\n    for( nbitems = 0, grid = gridlist;  ; grid++, nbitems++ )\n    {\n        if( (grid->x <= 0) || (grid->y <= 0) )\n            break;\n    }\n\n    \/\/ Init liste\n    if( m_GridList )\n        free( m_GridList );\n    m_GridList = (wxSize*) MyZMalloc( nbitems * sizeof(wxSize) );\n\n    for( ii = 0, grid = gridlist; ii < nbitems; grid++, ii++ )\n    {\n        m_GridList[ii] = *grid;\n    }\n}\n\n\n\/**********************************************\/\nvoid BASE_SCREEN::SetGrid( const wxSize& size )\n\/**********************************************\/\n{\n    if( m_GridList == NULL )\n        return;\n\n    if( (size.x <= 0) || (size.y <= 0) )\n    {\n        m_UserGrid     = g_UserGrid;\n        m_UserGridIsON = TRUE;\n    }\n    else\n    {\n        m_Grid = size;\n        m_UserGridIsON = FALSE;\n    }\n}\n\n\n\/*********************************\/\nwxSize BASE_SCREEN::GetGrid()\n\/*********************************\/\n{\n    wxSize grid = m_Grid;\n    double xx, scale;\n\n    if( m_GridList == NULL )\n        return wxSize( 1, 1 );\n\n    if( m_UserGridIsON || m_Grid.x < 0 || m_Grid.y < 0 )\n    {\n        if( m_UserGridUnit == INCHES )\n            scale = 10000;\n        else\n            scale = 10000 \/ 25.4;\n        xx     = m_UserGrid.x * scale;\n        grid.x = (int) (xx + 0.5);\n        xx     = m_UserGrid.y * scale;\n        grid.y = (int) (xx + 0.5);\n    }\n    return grid;\n}\n\n\n\/*********************************\/\nvoid BASE_SCREEN::SetNextGrid()\n\/*********************************\/\n\n\/* Selectionne la prochaine grille\n *\/\n{\n    int ii;\n\n    if( m_GridList == NULL )\n        return;\n\n    for( ii = 0; ; ii++ )\n    {\n        if( m_GridList[ii].x <= 0 )\n            break;\n        if( (m_Grid.x == m_GridList[ii].x) && (m_Grid.y == m_GridList[ii].y) )\n            break;\n    }\n\n    if( (m_GridList[ii].x > 0) && (ii > 0) )\n        m_Grid = m_GridList[ii - 1];\n}\n\n\n\/*************************************\/\nvoid BASE_SCREEN::SetPreviousGrid()\n\/*************************************\/\n\n\/* Selectionne le precedent coeff de grille\n *\/\n{\n    int ii;\n\n    if( m_GridList == NULL )\n        return;\n\n    for( ii = 0; ; ii++ )\n    {\n        if( m_GridList[ii].x <= 0 )\n            break;\n        if( (m_Grid.x == m_GridList[ii].x) && (m_Grid.y == m_GridList[ii].y) )\n            break;\n    }\n\n    if( (m_GridList[ii].x > 0) && (m_GridList[ii + 1].x > 0) )\n        m_Grid = m_GridList[ii + 1];\n}\n\n\n\/**********************************\/\nvoid BASE_SCREEN::SetFirstGrid()\n\/**********************************\/\n\n\/* ajuste le coeff de grille a 1\n *\/\n{\n    if( m_GridList == NULL )\n        return;\n\n    int ii = 0;\n    while( m_GridList[ii].x > 0 )\n        ii++;\n\n    m_Grid = m_GridList[ii - 1];\n}\n\n\n\/**********************************\/\nvoid BASE_SCREEN::SetLastGrid()\n\/**********************************\/\n\n\/* ajuste le coeff de grille au max\n *\/\n{\n    if( m_GridList == NULL )\n        return;\n    m_Grid = m_GridList[0];\n}\n\n\n\/*****************************************\/\nvoid BASE_SCREEN::ClearUndoRedoList()\n\/*****************************************\/\n\n\/* free the undo and the redo lists\n *\/\n{\n    EDA_BaseStruct* nextitem;\n\n    while( m_UndoList )\n    {\n        nextitem = m_UndoList->Pnext;\n        delete m_UndoList;\n        m_UndoList = nextitem;\n    }\n\n    while( m_RedoList )\n    {\n        nextitem = m_RedoList->Pnext;\n        delete m_RedoList;\n        m_RedoList = nextitem;\n    }\n}\n\n\n\/***********************************************************\/\nvoid BASE_SCREEN::AddItemToUndoList( EDA_BaseStruct* newitem )\n\/************************************************************\/\n\n\/* Put newitem in head of undo list\n *  Deletes olds items if > count max.\n *\/\n{\n    int             ii;\n    EDA_BaseStruct* item, * nextitem;\n\n    if( newitem == NULL )\n        return;\n\n    newitem->Pnext = m_UndoList;\n    m_UndoList = newitem;\n\n    \/* Free first items, if count max reached *\/\n    for( ii = 0, item = m_UndoList; ii < m_UndoRedoCountMax; ii++ )\n    {\n        if( item->Pnext == NULL )\n            return;\n        item = item->Pnext;\n    }\n\n    if( item == NULL )\n        return;\n\n    nextitem    = item->Pnext;\n    item->Pnext = NULL; \/\/ Set end of chain\n\n    \/\/ Delete the extra  items\n    for( item = nextitem; item != NULL; item = nextitem )\n    {\n        nextitem = item->Pnext;\n        delete item;\n    }\n}\n\n\n\/***********************************************************\/\nvoid BASE_SCREEN::AddItemToRedoList( EDA_BaseStruct* newitem )\n\/***********************************************************\/\n{\n    int             ii;\n    EDA_BaseStruct* item, * nextitem;\n\n    if( newitem == NULL )\n        return;\n\n    newitem->Pnext = m_RedoList;\n    m_RedoList = newitem;\n    \/* Free first items, if count max reached *\/\n    for( ii = 0, item = m_RedoList; ii < m_UndoRedoCountMax; ii++ )\n    {\n        if( item->Pnext == NULL )\n            break;\n        item = item->Pnext;\n    }\n\n    if( item == NULL )\n        return;\n\n    nextitem    = item->Pnext;\n    item->Pnext = NULL; \/\/ Set end of chain\n\n    \/\/ Delete the extra items\n    for( item = nextitem; item != NULL; item = nextitem )\n    {\n        nextitem = item->Pnext;\n        delete item;\n    }\n}\n\n\n\/*****************************************************\/\nEDA_BaseStruct* BASE_SCREEN::GetItemFromUndoList()\n\/*****************************************************\/\n{\n    EDA_BaseStruct* item = m_UndoList;\n\n    if( item )\n        m_UndoList = item->Pnext;\n    return item;\n}\n\n\n\/******************************************************\/\nEDA_BaseStruct* BASE_SCREEN::GetItemFromRedoList()\n\/******************************************************\/\n{\n    EDA_BaseStruct* item = m_RedoList;\n\n    if( item )\n        m_RedoList = item->Pnext;\n    return item;\n}\n\n\nvoid BASE_SCREEN::SetCurItem( EDA_BaseStruct* aCurItem )\n{\n    \n#if 0 && defined(DEBUG)\n    printf( \"SetCurItem(%p)\\n\", aCurItem );\n#endif\n\n    m_CurrentItem = aCurItem; \n}\n<|endoftext|>"}
{"text":"<commit_before>#include <archie\/alias.hpp>\n#include <vector>\n#include <array>\n#include <catch.hpp>\nnamespace {\nusing namespace archie;\n\nTEST_CASE(\"alias\", \"[alias]\") {\n  SECTION(\"ref\") {\n    int x = 0;\n    int y = 1;\n    auto a = alias(x);\n    REQUIRE(unwrap(a) == 0);\n    a = 2;\n    REQUIRE(x == 2);\n    a = rebind(y);\n    a = 3;\n    REQUIRE(x == 2);\n    REQUIRE(y == 3);\n  }\n  SECTION(\"const ref\") {\n    const int x = 0;\n    const int y = 1;\n    auto a = alias(x);\n    auto b = alias(x);\n    REQUIRE(unwrap(a) == 0);\n    a = rebind(y);\n    REQUIRE(unwrap(a) == 1);\n    a = rebind(b);\n    REQUIRE(unwrap(a) == 0);\n  }\n  SECTION(\"sorting\") {\n    std::array<int, 3> array = {{3, 1, 2}};\n    std::vector<alias_t<int>> vec;\n    vec.emplace_back(array[1]);\n    vec.emplace_back(array[2]);\n    vec.emplace_back(array[0]);\n    std::sort(std::begin(vec), std::end(vec));\n    REQUIRE(unwrap(vec[0]) == 3);\n    REQUIRE(unwrap(vec[1]) == 1);\n    REQUIRE(unwrap(vec[2]) == 2);\n    REQUIRE(array[0] == 3);\n    REQUIRE(array[1] == 1);\n    REQUIRE(array[2] == 2);\n    std::sort(std::begin(vec), std::end(vec),\n              [](auto const& lhs, auto const& rhs) { return unwrap(lhs) < unwrap(rhs); });\n    REQUIRE(unwrap(vec[0]) == 1);\n    REQUIRE(unwrap(vec[1]) == 2);\n    REQUIRE(unwrap(vec[2]) == 3);\n    REQUIRE(array[0] == 3);\n    REQUIRE(array[1] == 1);\n    REQUIRE(array[2] == 2);\n  }\n  SECTION(\"cross-const\") {\n    const int ci = 1;\n    int i = 2;\n    auto ca = alias(ci);\n    REQUIRE(unwrap(ca) == 1);\n    ca = rebind(i);\n    REQUIRE(unwrap(ca) == 2);\n  }\n  SECTION(\"function arg\") {\n    int x = 10;\n    int y = 12;\n    auto foo = [](alias_t<int> a, alias_t<int> b) {\n      if (unwrap(a) < unwrap(b)) {\n        auto tmp = a;\n        a = rebind(b);\n        b = rebind(tmp);\n      }\n      a = 42;\n      b = 7;\n    };\n    foo(ref(x), ref(y));\n    REQUIRE(x == 7);\n    REQUIRE(y == 42);\n  }\n  SECTION(\"assign\") {\n    auto x = 1u;\n    auto y = 2u;\n    auto a = alias(x);\n    REQUIRE(unwrap(a) == 1u);\n    a = y;\n    REQUIRE(unwrap(a) == 2u);\n    REQUIRE(x == 2u);\n    a = x;\n    REQUIRE(unwrap(a) == 2u);\n    a = std::move(x);\n    REQUIRE(unwrap(a) == 2u);\n  }\n  SECTION(\"cross-ctor\") {\n    struct A {\n      int x = 1;\n    };\n    struct B : A {\n      int y = 2;\n    };\n    B x;\n    alias_t<A> const a(x);\n    REQUIRE((*a).x == 1);\n    alias_t<A> b(alias(x));\n    REQUIRE(a->x == 1);\n  }\n  SECTION(\"deref\") {\n    struct Pos {\n      int x, y;\n    };\n    Pos p, q;\n    auto als = alias(p);\n    als->x = 1;\n    als->y = 2;\n    REQUIRE(p.x == 1);\n    REQUIRE(p.y == 2);\n    auto other = alias(p);\n    REQUIRE(als == other);\n    REQUIRE_FALSE(als != other);\n    auto aq = alias(q);\n    REQUIRE(std::addressof(p) > std::addressof(q));\n    REQUIRE(als > aq);\n    REQUIRE(als >= other);\n    REQUIRE(als >= aq);\n    REQUIRE(aq < als);\n    REQUIRE(other <= als);\n    REQUIRE(aq <= als);\n  }\n}\n}\n<commit_msg>fix alias test<commit_after>#include <archie\/alias.hpp>\n#include <vector>\n#include <array>\n#include <catch.hpp>\nnamespace {\nusing namespace archie;\n\nTEST_CASE(\"alias\", \"[alias]\") {\n  SECTION(\"ref\") {\n    int x = 0;\n    int y = 1;\n    auto a = alias(x);\n    REQUIRE(unwrap(a) == 0);\n    a = 2;\n    REQUIRE(x == 2);\n    a = rebind(y);\n    a = 3;\n    REQUIRE(x == 2);\n    REQUIRE(y == 3);\n  }\n  SECTION(\"const ref\") {\n    const int x = 0;\n    const int y = 1;\n    auto a = alias(x);\n    auto b = alias(x);\n    REQUIRE(unwrap(a) == 0);\n    a = rebind(y);\n    REQUIRE(unwrap(a) == 1);\n    a = rebind(b);\n    REQUIRE(unwrap(a) == 0);\n  }\n  SECTION(\"sorting\") {\n    std::array<int, 3> array = {{3, 1, 2}};\n    std::vector<alias_t<int>> vec;\n    vec.emplace_back(array[1]);\n    vec.emplace_back(array[2]);\n    vec.emplace_back(array[0]);\n    std::sort(std::begin(vec), std::end(vec));\n    REQUIRE(unwrap(vec[0]) == 3);\n    REQUIRE(unwrap(vec[1]) == 1);\n    REQUIRE(unwrap(vec[2]) == 2);\n    REQUIRE(array[0] == 3);\n    REQUIRE(array[1] == 1);\n    REQUIRE(array[2] == 2);\n    std::sort(std::begin(vec), std::end(vec),\n              [](auto const& lhs, auto const& rhs) { return unwrap(lhs) < unwrap(rhs); });\n    REQUIRE(unwrap(vec[0]) == 1);\n    REQUIRE(unwrap(vec[1]) == 2);\n    REQUIRE(unwrap(vec[2]) == 3);\n    REQUIRE(array[0] == 3);\n    REQUIRE(array[1] == 1);\n    REQUIRE(array[2] == 2);\n  }\n  SECTION(\"cross-const\") {\n    const int ci = 1;\n    int i = 2;\n    auto ca = alias(ci);\n    REQUIRE(unwrap(ca) == 1);\n    ca = rebind(i);\n    REQUIRE(unwrap(ca) == 2);\n  }\n  SECTION(\"function arg\") {\n    int x = 10;\n    int y = 12;\n    auto foo = [](alias_t<int> a, alias_t<int> b) {\n      if (unwrap(a) < unwrap(b)) {\n        auto tmp = a;\n        a = rebind(b);\n        b = rebind(tmp);\n      }\n      a = 42;\n      b = 7;\n    };\n    foo(ref(x), ref(y));\n    REQUIRE(x == 7);\n    REQUIRE(y == 42);\n  }\n  SECTION(\"assign\") {\n    auto x = 1u;\n    auto y = 2u;\n    auto a = alias(x);\n    REQUIRE(unwrap(a) == 1u);\n    a = y;\n    REQUIRE(unwrap(a) == 2u);\n    REQUIRE(x == 2u);\n    a = x;\n    REQUIRE(unwrap(a) == 2u);\n    a = std::move(x);\n    REQUIRE(unwrap(a) == 2u);\n  }\n  SECTION(\"cross-ctor\") {\n    struct A {\n      int x = 1;\n    };\n    struct B : A {\n      int y = 2;\n    };\n    B x;\n    alias_t<A> const a(x);\n    REQUIRE((*a).x == 1);\n    alias_t<A> b(alias(x));\n    REQUIRE(a->x == 1);\n  }\n  SECTION(\"deref\") {\n    struct Pos {\n      int x, y;\n    };\n    Pos p, q;\n    auto als = alias(p);\n    als->x = 1;\n    als->y = 2;\n    REQUIRE(p.x == 1);\n    REQUIRE(p.y == 2);\n    auto other = alias(p);\n    REQUIRE(als == other);\n    REQUIRE_FALSE(als != other);\n    auto aq = alias(q);\n    if (std::addressof(p) > std::addressof(q)) {\n      REQUIRE(als > aq);\n      REQUIRE(als >= other);\n      REQUIRE(als >= aq);\n      REQUIRE(aq < als);\n      REQUIRE(other <= als);\n      REQUIRE(aq <= als);\n    }\n  }\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/*****************************************************************************\n\/\/ Copyright 2017-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 \"ngraph\/runtime\/dynamic\/dynamic_backend.hpp\"\n#include \"ngraph\/graph_util.hpp\"\n#include \"ngraph\/pass\/manager.hpp\"\n#include \"ngraph\/pass\/shape_relevance.hpp\"\n#include \"ngraph\/specialize_shapes.hpp\"\n#include \"ngraph\/util.hpp\"\n\nusing namespace std;\nusing namespace ngraph;\n\nruntime::dynamic::DynamicBackend::DynamicBackend(shared_ptr<runtime::Backend> wrapped_backend)\n    : m_wrapped_backend(std::move(wrapped_backend))\n{\n}\n\nshared_ptr<runtime::Tensor>\n    runtime::dynamic::DynamicBackend::create_tensor(const element::Type& type, const Shape& shape)\n{\n    return m_wrapped_backend->create_tensor(type, shape);\n}\n\nshared_ptr<runtime::Tensor> runtime::dynamic::DynamicBackend::create_tensor(\n    const element::Type& type, const Shape& shape, void* memory_pointer)\n{\n    return m_wrapped_backend->create_tensor(type, shape, memory_pointer);\n}\n\nstd::shared_ptr<runtime::Tensor>\n    runtime::dynamic::DynamicBackend::create_dynamic_tensor(const element::Type& type,\n                                                            const PartialShape& shape)\n{\n    return make_shared<DynamicTensor>(type, shape, m_wrapped_backend);\n}\n\nshared_ptr<runtime::Executable>\n    runtime::dynamic::DynamicBackend::compile(shared_ptr<Function> function,\n                                              bool enable_performance_collection)\n{\n    return make_shared<runtime::dynamic::DynamicExecutable>(\n        function, m_wrapped_backend, enable_performance_collection);\n}\n\nruntime::dynamic::DynamicExecutable::DynamicExecutable(shared_ptr<Function> wrapped_function,\n                                                       shared_ptr<runtime::Backend> wrapped_backend,\n                                                       bool enable_performance_collection)\n    : m_wrapped_function(wrapped_function)\n    , m_wrapped_backend(wrapped_backend)\n    , m_enable_performance_collection(enable_performance_collection)\n{\n    pass::Manager passes;\n    passes.register_pass<pass::ShapeRelevance>();\n    passes.run_passes(m_wrapped_function);\n\n    set_parameters_and_results(*wrapped_function);\n}\n\nbool runtime::dynamic::DynamicExecutable::call(\n    const std::vector<std::shared_ptr<runtime::Tensor>>& outputs,\n    const std::vector<std::shared_ptr<runtime::Tensor>>& inputs)\n{\n    \/\/ TODO: Get cached executable out if it exists.\n    \/\/ We will cache on:\n    \/\/ (1) all shapes;\n    \/\/ (2) all values of shape-relevant input tensors.\n\n    std::vector<std::shared_ptr<runtime::Tensor>> wrapped_inputs;\n    std::vector<element::Type> arg_element_types;\n    std::vector<PartialShape> arg_shapes;\n\n    for (auto& input : inputs)\n    {\n        if (auto dynamic_tensor = std::dynamic_pointer_cast<runtime::dynamic::DynamicTensor>(input))\n        {\n            NGRAPH_CHECK(dynamic_tensor->has_storage());\n            arg_element_types.push_back(dynamic_tensor->get_wrapped_tensor()->get_element_type());\n            arg_shapes.push_back(dynamic_tensor->get_wrapped_tensor()->get_shape());\n            wrapped_inputs.push_back(dynamic_tensor->get_wrapped_tensor());\n        }\n        else\n        {\n            arg_element_types.push_back(input->get_element_type());\n            arg_shapes.push_back(input->get_shape());\n            wrapped_inputs.push_back(input);\n        }\n    }\n\n    \/\/ TODO: specialize_shapes needs to fill in values of shape-relevant params.\n    auto clone = specialize_shapes(m_wrapped_function, arg_element_types, arg_shapes);\n    \/\/ TODO: run constant folding and de-dynification on clone.\n    const ResultVector& results = clone->get_results();\n    NGRAPH_CHECK(results.size() == outputs.size());\n\n    std::vector<std::shared_ptr<runtime::Tensor>> wrapped_outputs;\n\n    auto results_it = results.begin();\n\n    for (auto& output : outputs)\n    {\n        if (auto dynamic_tensor =\n                std::dynamic_pointer_cast<runtime::dynamic::DynamicTensor>(output))\n        {\n            dynamic_tensor->make_storage((*results_it)->get_output_element_type(0),\n                                         (*results_it)->get_output_shape(0));\n            wrapped_outputs.push_back(dynamic_tensor->get_wrapped_tensor());\n        }\n        else\n        {\n            wrapped_outputs.push_back(output);\n        }\n    }\n\n    \/\/ TODO: Put compiled executable in the cache.\n    auto compiled_executable = m_wrapped_backend->compile(clone, m_enable_performance_collection);\n    auto result = compiled_executable->call(wrapped_outputs, wrapped_inputs);\n\n    return result;\n}\n\nruntime::dynamic::DynamicTensor::DynamicTensor(\n    const element::Type& element_type,\n    const PartialShape& shape,\n    const std::shared_ptr<runtime::Backend>& wrapped_backend)\n    : Tensor(make_shared<descriptor::Tensor>(element_type, shape, \"wrapped_dynamic\"))\n    , m_wrapped_tensor(nullptr)\n    , m_wrapped_backend(wrapped_backend)\n{\n}\n\nconst element::Type& runtime::dynamic::DynamicTensor::get_element_type() const\n{\n    if (m_wrapped_tensor == nullptr)\n    {\n        return m_descriptor->get_element_type();\n    }\n    else\n    {\n        return m_wrapped_tensor->get_element_type();\n    }\n}\n\nconst ngraph::Shape& runtime::dynamic::DynamicTensor::get_shape() const\n{\n    NGRAPH_CHECK(m_wrapped_tensor != nullptr,\n                 \"asked for shape of a dynamic tensor with no allocated storage\");\n    return m_wrapped_tensor->get_shape();\n}\n\nvoid runtime::dynamic::DynamicTensor::write(const void* p, size_t offset, size_t n)\n{\n    NGRAPH_CHECK(m_wrapped_tensor != nullptr,\n                 \"tried to write to a dynamic tensor with no allocated storage\");\n    m_wrapped_tensor->write(p, offset, n);\n}\n\nvoid runtime::dynamic::DynamicTensor::read(void* p, size_t offset, size_t n) const\n{\n    NGRAPH_CHECK(m_wrapped_tensor != nullptr,\n                 \"tried to read from a dynamic tensor with no allocated storage\");\n    m_wrapped_tensor->read(p, offset, n);\n}\n\nvoid runtime::dynamic::DynamicTensor::copy_from(const ngraph::runtime::Tensor& source)\n{\n    NGRAPH_CHECK(m_wrapped_tensor != nullptr,\n                 \"tried to copy_from to a dynamic tensor with no allocated storage\");\n    m_wrapped_tensor->copy_from(source);\n}\n\nbool runtime::dynamic::DynamicTensor::has_storage() const\n{\n    return m_wrapped_tensor != nullptr;\n}\n\nvoid runtime::dynamic::DynamicTensor::release_storage()\n{\n    m_wrapped_tensor = nullptr;\n}\n\nvoid runtime::dynamic::DynamicTensor::make_storage(const element::Type& element_type,\n                                                   const Shape& shape)\n{\n    NGRAPH_CHECK(element_type.is_static(), \"make_storage requires a static element type\");\n    NGRAPH_CHECK(get_element_type().is_dynamic() || get_element_type() == element_type,\n                 \"tried to make storage with element type \",\n                 element_type,\n                 \" which is incompatible with dynamic tensor element_type \",\n                 get_element_type());\n    NGRAPH_CHECK(get_partial_shape().relaxes(shape),\n                 \"tried to make storage with shape \",\n                 shape,\n                 \" which is incompatible with dynamic tensor shape \",\n                 get_partial_shape());\n    m_wrapped_tensor = m_wrapped_backend->create_tensor(element_type, shape);\n}\n\nconst std::shared_ptr<ngraph::runtime::Tensor>&\n    runtime::dynamic::DynamicTensor::get_wrapped_tensor() const\n{\n    return m_wrapped_tensor;\n}\n<commit_msg>Address Klocwork issue. Fix bug? (#2915)<commit_after>\/\/*****************************************************************************\n\/\/ Copyright 2017-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 \"ngraph\/runtime\/dynamic\/dynamic_backend.hpp\"\n#include \"ngraph\/graph_util.hpp\"\n#include \"ngraph\/pass\/manager.hpp\"\n#include \"ngraph\/pass\/shape_relevance.hpp\"\n#include \"ngraph\/specialize_shapes.hpp\"\n#include \"ngraph\/util.hpp\"\n\nusing namespace std;\nusing namespace ngraph;\n\nruntime::dynamic::DynamicBackend::DynamicBackend(shared_ptr<runtime::Backend> wrapped_backend)\n    : m_wrapped_backend(std::move(wrapped_backend))\n{\n}\n\nshared_ptr<runtime::Tensor>\n    runtime::dynamic::DynamicBackend::create_tensor(const element::Type& type, const Shape& shape)\n{\n    return m_wrapped_backend->create_tensor(type, shape);\n}\n\nshared_ptr<runtime::Tensor> runtime::dynamic::DynamicBackend::create_tensor(\n    const element::Type& type, const Shape& shape, void* memory_pointer)\n{\n    return m_wrapped_backend->create_tensor(type, shape, memory_pointer);\n}\n\nstd::shared_ptr<runtime::Tensor>\n    runtime::dynamic::DynamicBackend::create_dynamic_tensor(const element::Type& type,\n                                                            const PartialShape& shape)\n{\n    return make_shared<DynamicTensor>(type, shape, m_wrapped_backend);\n}\n\nshared_ptr<runtime::Executable>\n    runtime::dynamic::DynamicBackend::compile(shared_ptr<Function> function,\n                                              bool enable_performance_collection)\n{\n    return make_shared<runtime::dynamic::DynamicExecutable>(\n        function, m_wrapped_backend, enable_performance_collection);\n}\n\nruntime::dynamic::DynamicExecutable::DynamicExecutable(shared_ptr<Function> wrapped_function,\n                                                       shared_ptr<runtime::Backend> wrapped_backend,\n                                                       bool enable_performance_collection)\n    : m_wrapped_function(wrapped_function)\n    , m_wrapped_backend(wrapped_backend)\n    , m_enable_performance_collection(enable_performance_collection)\n{\n    pass::Manager passes;\n    passes.register_pass<pass::ShapeRelevance>();\n    passes.run_passes(m_wrapped_function);\n\n    set_parameters_and_results(*wrapped_function);\n}\n\nbool runtime::dynamic::DynamicExecutable::call(\n    const std::vector<std::shared_ptr<runtime::Tensor>>& outputs,\n    const std::vector<std::shared_ptr<runtime::Tensor>>& inputs)\n{\n    \/\/ TODO: Get cached executable out if it exists.\n    \/\/ We will cache on:\n    \/\/ (1) all shapes;\n    \/\/ (2) all values of shape-relevant input tensors.\n\n    std::vector<std::shared_ptr<runtime::Tensor>> wrapped_inputs;\n    std::vector<element::Type> arg_element_types;\n    std::vector<PartialShape> arg_shapes;\n\n    for (auto& input : inputs)\n    {\n        if (auto dynamic_tensor = std::dynamic_pointer_cast<runtime::dynamic::DynamicTensor>(input))\n        {\n            NGRAPH_CHECK(dynamic_tensor->has_storage());\n            arg_element_types.push_back(dynamic_tensor->get_wrapped_tensor()->get_element_type());\n            arg_shapes.push_back(dynamic_tensor->get_wrapped_tensor()->get_shape());\n            wrapped_inputs.push_back(dynamic_tensor->get_wrapped_tensor());\n        }\n        else\n        {\n            arg_element_types.push_back(input->get_element_type());\n            arg_shapes.push_back(input->get_shape());\n            wrapped_inputs.push_back(input);\n        }\n    }\n\n    \/\/ TODO: specialize_shapes needs to fill in values of shape-relevant params.\n    auto clone = specialize_shapes(m_wrapped_function, arg_element_types, arg_shapes);\n    \/\/ TODO: run constant folding and de-dynification on clone.\n    const ResultVector& results = clone->get_results();\n    NGRAPH_CHECK(results.size() == outputs.size());\n\n    std::vector<std::shared_ptr<runtime::Tensor>> wrapped_outputs;\n\n    for (size_t i = 0; i < outputs.size(); i++)\n    {\n        if (auto dynamic_tensor =\n                std::dynamic_pointer_cast<runtime::dynamic::DynamicTensor>(outputs[i]))\n        {\n            dynamic_tensor->make_storage(results[i]->get_output_element_type(0),\n                                         results[i]->get_output_shape(0));\n            wrapped_outputs.push_back(dynamic_tensor->get_wrapped_tensor());\n        }\n        else\n        {\n            wrapped_outputs.push_back(outputs[i]);\n        }\n    }\n\n    \/\/ TODO: Put compiled executable in the cache.\n    auto compiled_executable = m_wrapped_backend->compile(clone, m_enable_performance_collection);\n    auto result = compiled_executable->call(wrapped_outputs, wrapped_inputs);\n\n    return result;\n}\n\nruntime::dynamic::DynamicTensor::DynamicTensor(\n    const element::Type& element_type,\n    const PartialShape& shape,\n    const std::shared_ptr<runtime::Backend>& wrapped_backend)\n    : Tensor(make_shared<descriptor::Tensor>(element_type, shape, \"wrapped_dynamic\"))\n    , m_wrapped_tensor(nullptr)\n    , m_wrapped_backend(wrapped_backend)\n{\n}\n\nconst element::Type& runtime::dynamic::DynamicTensor::get_element_type() const\n{\n    if (m_wrapped_tensor == nullptr)\n    {\n        return m_descriptor->get_element_type();\n    }\n    else\n    {\n        return m_wrapped_tensor->get_element_type();\n    }\n}\n\nconst ngraph::Shape& runtime::dynamic::DynamicTensor::get_shape() const\n{\n    NGRAPH_CHECK(m_wrapped_tensor != nullptr,\n                 \"asked for shape of a dynamic tensor with no allocated storage\");\n    return m_wrapped_tensor->get_shape();\n}\n\nvoid runtime::dynamic::DynamicTensor::write(const void* p, size_t offset, size_t n)\n{\n    NGRAPH_CHECK(m_wrapped_tensor != nullptr,\n                 \"tried to write to a dynamic tensor with no allocated storage\");\n    m_wrapped_tensor->write(p, offset, n);\n}\n\nvoid runtime::dynamic::DynamicTensor::read(void* p, size_t offset, size_t n) const\n{\n    NGRAPH_CHECK(m_wrapped_tensor != nullptr,\n                 \"tried to read from a dynamic tensor with no allocated storage\");\n    m_wrapped_tensor->read(p, offset, n);\n}\n\nvoid runtime::dynamic::DynamicTensor::copy_from(const ngraph::runtime::Tensor& source)\n{\n    NGRAPH_CHECK(m_wrapped_tensor != nullptr,\n                 \"tried to copy_from to a dynamic tensor with no allocated storage\");\n    m_wrapped_tensor->copy_from(source);\n}\n\nbool runtime::dynamic::DynamicTensor::has_storage() const\n{\n    return m_wrapped_tensor != nullptr;\n}\n\nvoid runtime::dynamic::DynamicTensor::release_storage()\n{\n    m_wrapped_tensor = nullptr;\n}\n\nvoid runtime::dynamic::DynamicTensor::make_storage(const element::Type& element_type,\n                                                   const Shape& shape)\n{\n    NGRAPH_CHECK(element_type.is_static(), \"make_storage requires a static element type\");\n    NGRAPH_CHECK(get_element_type().is_dynamic() || get_element_type() == element_type,\n                 \"tried to make storage with element type \",\n                 element_type,\n                 \" which is incompatible with dynamic tensor element_type \",\n                 get_element_type());\n    NGRAPH_CHECK(get_partial_shape().relaxes(shape),\n                 \"tried to make storage with shape \",\n                 shape,\n                 \" which is incompatible with dynamic tensor shape \",\n                 get_partial_shape());\n    m_wrapped_tensor = m_wrapped_backend->create_tensor(element_type, shape);\n}\n\nconst std::shared_ptr<ngraph::runtime::Tensor>&\n    runtime::dynamic::DynamicTensor::get_wrapped_tensor() const\n{\n    return m_wrapped_tensor;\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\/renderer\/print_web_view_helper.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/gfx\/size.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/renderer\/render_view.h\"\n#include \"grit\/generated_resources.h\"\n#include \"printing\/units.h\"\n#include \"webkit\/api\/public\/WebScreenInfo.h\"\n#include \"webkit\/api\/public\/WebSize.h\"\n#include \"webkit\/glue\/webframe.h\"\n#include \"webkit\/glue\/weburlrequest.h\"\n\n#if defined(OS_WIN)\n#include \"chrome\/common\/gfx\/emf.h\"\n#include \"skia\/ext\/vector_canvas.h\"\n#endif\n\nnamespace {\n\n\/\/ Class that calls the Begin and End print functions on the frame and changes\n\/\/ the size of the view temporarily to support full page printing..\n\/\/ Do not serve any events in the time between construction and destruction of\n\/\/ this class because it will cause flicker.\nclass PrepareFrameAndViewForPrint {\n public:\n  PrepareFrameAndViewForPrint(const ViewMsg_Print_Params& print_params,\n                              WebFrame* frame,\n                              WebView* web_view)\n      : frame_(frame),\n        web_view_(web_view),\n        expected_pages_count_(0) {\n    print_canvas_size_.set_width(\n        printing::ConvertUnit(print_params.printable_size.width(),\n        static_cast<int>(print_params.dpi),\n        print_params.desired_dpi));\n    print_canvas_size_.set_height(\n        printing::ConvertUnit(print_params.printable_size.height(),\n        static_cast<int>(print_params.dpi),\n        print_params.desired_dpi));\n\n    \/\/ Layout page according to printer page size. Since WebKit shrinks the\n    \/\/ size of the page automatically (from 125% to 200%) we trick it to\n    \/\/ think the page is 125% larger so the size of the page is correct for\n    \/\/ minimum (default) scaling.\n    \/\/ This is important for sites that try to fill the page.\n    gfx::Size print_layout_size(print_canvas_size_);\n    print_layout_size.set_height(static_cast<int>(\n        static_cast<double>(print_layout_size.height()) * 1.25));\n\n    prev_view_size_ = web_view->GetSize();\n\n    web_view->Resize(print_layout_size);\n\n    frame->BeginPrint(print_canvas_size_, &expected_pages_count_);\n  }\n\n  int GetExpectedPageCount() const {\n    return expected_pages_count_;\n  }\n\n  gfx::Size GetPrintCanvasSize() const {\n    return print_canvas_size_;\n  }\n\n  ~PrepareFrameAndViewForPrint() {\n    frame_->EndPrint();\n    web_view_->Resize(prev_view_size_);\n  }\n\n private:\n  WebFrame* frame_;\n  WebView* web_view_;\n  gfx::Size print_canvas_size_;\n  gfx::Size prev_view_size_;\n  int expected_pages_count_;\n\n  DISALLOW_COPY_AND_ASSIGN(PrepareFrameAndViewForPrint);\n};\n\n}  \/\/ namespace\n\nvoid PrintWebViewHelper::SyncPrint(WebFrame* frame) {\n#if defined(OS_WIN)\n  \/\/ Retrieve the default print settings to calculate the expected number of\n  \/\/ pages.\n  ViewMsg_Print_Params default_settings;\n\n  IPC::SyncMessage* msg =\n      new ViewHostMsg_GetDefaultPrintSettings(routing_id(), &default_settings);\n  if (Send(msg)) {\n    msg = NULL;\n    \/\/ Check if the printer returned any settings, if the settings is empty, we\n    \/\/ can safely assume there are no printer drivers configured. So we safely\n    \/\/ terminate.\n    if (default_settings.IsEmpty()) {\n      RunJavaScriptAlert(frame,\n          l10n_util::GetString(IDS_DEFAULT_PRINTER_NOT_FOUND_WARNING_TITLE));\n      return;\n    }\n\n    \/\/ Continue only if the settings are valid.\n    if (default_settings.dpi && default_settings.document_cookie) {\n      int expected_pages_count = 0;\n\n      \/\/ Prepare once to calculate the estimated page count.  This must be in\n      \/\/ a scope for itself (see comments on PrepareFrameAndViewForPrint).\n      {\n        PrepareFrameAndViewForPrint prep_frame_view(default_settings,\n                                                    frame,\n                                                    frame->GetView());\n        expected_pages_count = prep_frame_view.GetExpectedPageCount();\n        DCHECK(expected_pages_count);\n      }\n\n      \/\/ Ask the browser to show UI to retrieve the final print settings.\n      ViewMsg_PrintPages_Params print_settings;\n      \/\/ host_window_ may be NULL at this point if the current window is a popup\n      \/\/ and the print() command has been issued from the parent. The receiver\n      \/\/ of this message has to deal with this.\n      msg = new ViewHostMsg_ScriptedPrint(routing_id(),\n                                          render_view_->host_window(),\n                                          default_settings.document_cookie,\n                                          expected_pages_count,\n                                          true,  \/\/ has_selection\n                                          &print_settings);\n      if (Send(msg)) {\n        msg = NULL;\n\n        \/\/ Printing selection only not supported yet.\n        if (print_settings.params.selection_only) {\n          NOTIMPLEMENTED();\n        }\n\n        \/\/ If the settings are invalid, early quit.\n        if (print_settings.params.dpi &&\n            print_settings.params.document_cookie) {\n          \/\/ Render the printed pages. It will implicitly revert the document to\n          \/\/ display CSS media type.\n          PrintPages(print_settings, frame);\n          \/\/ All went well.\n          return;\n        } else {\n          \/\/ The user cancelled.\n        }\n      } else {\n        \/\/ Send() failed.\n        NOTREACHED();\n      }\n    } else {\n      \/\/ The user cancelled.\n    }\n  } else {\n    \/\/ Send() failed.\n    NOTREACHED();\n  }\n  \/\/ TODO(maruel):  bug 1123882 Alert the user that printing failed.\n#else  \/\/ defined(OS_WIN)\n  \/\/ TODO(port): print not implemented\n  NOTIMPLEMENTED();\n#endif\n}\n\nvoid PrintWebViewHelper::PrintPages(const ViewMsg_PrintPages_Params& params,\n                                 WebFrame* frame) {\n  PrepareFrameAndViewForPrint prep_frame_view(params.params,\n                                              frame,\n                                              frame->GetView());\n  int page_count = prep_frame_view.GetExpectedPageCount();\n\n  Send(new ViewHostMsg_DidGetPrintedPagesCount(routing_id(),\n                                               params.params.document_cookie,\n                                               page_count));\n  if (page_count) {\n    ViewMsg_PrintPage_Params page_params;\n    page_params.params = params.params;\n    if (params.pages.empty()) {\n      for (int i = 0; i < page_count; ++i) {\n        page_params.page_number = i;\n        PrintPage(page_params, prep_frame_view.GetPrintCanvasSize(), frame);\n      }\n    } else {\n      for (size_t i = 0; i < params.pages.size(); ++i) {\n        page_params.page_number = params.pages[i];\n        PrintPage(page_params, prep_frame_view.GetPrintCanvasSize(), frame);\n      }\n    }\n  }\n}\n\nvoid PrintWebViewHelper::PrintPage(const ViewMsg_PrintPage_Params& params,\n                                const gfx::Size& canvas_size,\n                                WebFrame* frame) {\n#if defined(OS_WIN)\n  \/\/ Generate a memory-based EMF file. The EMF will use the current screen's\n  \/\/ DPI.\n  gfx::Emf emf;\n\n  emf.CreateDc(NULL, NULL);\n  HDC hdc = emf.hdc();\n  DCHECK(hdc);\n  skia::PlatformDeviceWin::InitializeDC(hdc);\n  \/\/ Since WebKit extends the page width depending on the magical shrink\n  \/\/ factor we make sure the canvas covers the worst case scenario\n  \/\/ (x2.0 currently).  PrintContext will then set the correct clipping region.\n  int size_x = static_cast<int>(canvas_size.width() * params.params.max_shrink);\n  int size_y = static_cast<int>(canvas_size.height() *\n      params.params.max_shrink);\n  \/\/ Calculate the dpi adjustment.\n  float shrink = static_cast<float>(canvas_size.width()) \/\n      params.params.printable_size.width();\n#if 0\n  \/\/ TODO(maruel): This code is kept for testing until the 100% GDI drawing\n  \/\/ code is stable. maruels use this code's output as a reference when the\n  \/\/ GDI drawing code fails.\n\n  \/\/ Mix of Skia and GDI based.\n  skia::PlatformCanvasWin canvas(size_x, size_y, true);\n  canvas.drawARGB(255, 255, 255, 255, SkPorterDuff::kSrc_Mode);\n  float webkit_shrink = frame->PrintPage(params.page_number, &canvas);\n  if (shrink <= 0) {\n    NOTREACHED() << \"Printing page \" << params.page_number << \" failed.\";\n  } else {\n    \/\/ Update the dpi adjustment with the \"page shrink\" calculated in webkit.\n    shrink \/= webkit_shrink;\n  }\n\n  \/\/ Create a BMP v4 header that we can serialize.\n  BITMAPV4HEADER bitmap_header;\n  gfx::CreateBitmapV4Header(size_x, size_y, &bitmap_header);\n  const SkBitmap& src_bmp = canvas.getDevice()->accessBitmap(true);\n  SkAutoLockPixels src_lock(src_bmp);\n  int retval = StretchDIBits(hdc,\n                             0,\n                             0,\n                             size_x, size_y,\n                             0, 0,\n                             size_x, size_y,\n                             src_bmp.getPixels(),\n                             reinterpret_cast<BITMAPINFO*>(&bitmap_header),\n                             DIB_RGB_COLORS,\n                             SRCCOPY);\n  DCHECK(retval != GDI_ERROR);\n#else\n  \/\/ 100% GDI based.\n  skia::VectorCanvas canvas(hdc, size_x, size_y);\n  float webkit_shrink = frame->PrintPage(params.page_number, &canvas);\n  if (shrink <= 0) {\n    NOTREACHED() << \"Printing page \" << params.page_number << \" failed.\";\n  } else {\n    \/\/ Update the dpi adjustment with the \"page shrink\" calculated in webkit.\n    shrink \/= webkit_shrink;\n  }\n#endif\n\n  \/\/ Done printing. Close the device context to retrieve the compiled EMF.\n  if (!emf.CloseDc()) {\n    NOTREACHED() << \"EMF failed\";\n  }\n\n  \/\/ Get the size of the compiled EMF.\n  unsigned buf_size = emf.GetDataSize();\n  DCHECK_GT(buf_size, 128u);\n  ViewHostMsg_DidPrintPage_Params page_params;\n  page_params.data_size = 0;\n  page_params.emf_data_handle = NULL;\n  page_params.page_number = params.page_number;\n  page_params.document_cookie = params.params.document_cookie;\n  page_params.actual_shrink = shrink;\n  base::SharedMemory shared_buf;\n\n  \/\/ http:\/\/msdn2.microsoft.com\/en-us\/library\/ms535522.aspx\n  \/\/ Windows 2000\/XP: When a page in a spooled file exceeds approximately 350\n  \/\/ MB, it can fail to print and not send an error message.\n  if (buf_size < 350*1024*1024) {\n    \/\/ Allocate a shared memory buffer to hold the generated EMF data.\n    if (shared_buf.Create(L\"\", false, false, buf_size) &&\n        shared_buf.Map(buf_size)) {\n      \/\/ Copy the bits into shared memory.\n      if (emf.GetData(shared_buf.memory(), buf_size)) {\n        page_params.emf_data_handle = shared_buf.handle();\n        page_params.data_size = buf_size;\n      } else {\n        NOTREACHED() << \"GetData() failed\";\n      }\n      shared_buf.Unmap();\n    } else {\n      NOTREACHED() << \"Buffer allocation failed\";\n    }\n  } else {\n    NOTREACHED() << \"Buffer too large: \" << buf_size;\n  }\n  emf.CloseEmf();\n  if (Send(new ViewHostMsg_DuplicateSection(routing_id(),\n                                            page_params.emf_data_handle,\n                                            &page_params.emf_data_handle))) {\n    Send(new ViewHostMsg_DidPrintPage(routing_id(), page_params));\n  }\n#else  \/\/ defined(OS_WIN)\n  \/\/ TODO(port) implement printing\n  NOTIMPLEMENTED();\n#endif\n}\n\nbool PrintWebViewHelper::Send(IPC::Message* msg) {\n  return render_view_->Send(msg);\n}\n\nint32 PrintWebViewHelper::routing_id() {\n  return render_view_->routing_id();\n}\n\nvoid PrintWebViewHelper::GetWindowRect(WebWidget* webwidget,\n                                    WebKit::WebRect* rect) {\n  NOTREACHED();\n}\n\nvoid PrintWebViewHelper::DidStopLoading(WebView* webview) {\n  NOTREACHED();\n}\n\nWebKit::WebScreenInfo PrintWebViewHelper::GetScreenInfo(WebWidget* webwidget) {\n  WebKit::WebScreenInfo info;\n  NOTREACHED();\n  return info;\n}\n\ngfx::NativeViewId PrintWebViewHelper::GetContainingView(WebWidget* webwidget) {\n  NOTREACHED();\n  return gfx::NativeViewId();\n}\n\nbool PrintWebViewHelper::IsHidden(WebWidget* webwidget) {\n  NOTREACHED();\n  return true;\n}\n<commit_msg>Revert has_selection flag back to false (was testing that this worked and forgot to change back in my last changelist).<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\/print_web_view_helper.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/gfx\/size.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/renderer\/render_view.h\"\n#include \"grit\/generated_resources.h\"\n#include \"printing\/units.h\"\n#include \"webkit\/api\/public\/WebScreenInfo.h\"\n#include \"webkit\/api\/public\/WebSize.h\"\n#include \"webkit\/glue\/webframe.h\"\n#include \"webkit\/glue\/weburlrequest.h\"\n\n#if defined(OS_WIN)\n#include \"chrome\/common\/gfx\/emf.h\"\n#include \"skia\/ext\/vector_canvas.h\"\n#endif\n\nnamespace {\n\n\/\/ Class that calls the Begin and End print functions on the frame and changes\n\/\/ the size of the view temporarily to support full page printing..\n\/\/ Do not serve any events in the time between construction and destruction of\n\/\/ this class because it will cause flicker.\nclass PrepareFrameAndViewForPrint {\n public:\n  PrepareFrameAndViewForPrint(const ViewMsg_Print_Params& print_params,\n                              WebFrame* frame,\n                              WebView* web_view)\n      : frame_(frame),\n        web_view_(web_view),\n        expected_pages_count_(0) {\n    print_canvas_size_.set_width(\n        printing::ConvertUnit(print_params.printable_size.width(),\n        static_cast<int>(print_params.dpi),\n        print_params.desired_dpi));\n    print_canvas_size_.set_height(\n        printing::ConvertUnit(print_params.printable_size.height(),\n        static_cast<int>(print_params.dpi),\n        print_params.desired_dpi));\n\n    \/\/ Layout page according to printer page size. Since WebKit shrinks the\n    \/\/ size of the page automatically (from 125% to 200%) we trick it to\n    \/\/ think the page is 125% larger so the size of the page is correct for\n    \/\/ minimum (default) scaling.\n    \/\/ This is important for sites that try to fill the page.\n    gfx::Size print_layout_size(print_canvas_size_);\n    print_layout_size.set_height(static_cast<int>(\n        static_cast<double>(print_layout_size.height()) * 1.25));\n\n    prev_view_size_ = web_view->GetSize();\n\n    web_view->Resize(print_layout_size);\n\n    frame->BeginPrint(print_canvas_size_, &expected_pages_count_);\n  }\n\n  int GetExpectedPageCount() const {\n    return expected_pages_count_;\n  }\n\n  gfx::Size GetPrintCanvasSize() const {\n    return print_canvas_size_;\n  }\n\n  ~PrepareFrameAndViewForPrint() {\n    frame_->EndPrint();\n    web_view_->Resize(prev_view_size_);\n  }\n\n private:\n  WebFrame* frame_;\n  WebView* web_view_;\n  gfx::Size print_canvas_size_;\n  gfx::Size prev_view_size_;\n  int expected_pages_count_;\n\n  DISALLOW_COPY_AND_ASSIGN(PrepareFrameAndViewForPrint);\n};\n\n}  \/\/ namespace\n\nvoid PrintWebViewHelper::SyncPrint(WebFrame* frame) {\n#if defined(OS_WIN)\n  \/\/ Retrieve the default print settings to calculate the expected number of\n  \/\/ pages.\n  ViewMsg_Print_Params default_settings;\n\n  IPC::SyncMessage* msg =\n      new ViewHostMsg_GetDefaultPrintSettings(routing_id(), &default_settings);\n  if (Send(msg)) {\n    msg = NULL;\n    \/\/ Check if the printer returned any settings, if the settings is empty, we\n    \/\/ can safely assume there are no printer drivers configured. So we safely\n    \/\/ terminate.\n    if (default_settings.IsEmpty()) {\n      RunJavaScriptAlert(frame,\n          l10n_util::GetString(IDS_DEFAULT_PRINTER_NOT_FOUND_WARNING_TITLE));\n      return;\n    }\n\n    \/\/ Continue only if the settings are valid.\n    if (default_settings.dpi && default_settings.document_cookie) {\n      int expected_pages_count = 0;\n\n      \/\/ Prepare once to calculate the estimated page count.  This must be in\n      \/\/ a scope for itself (see comments on PrepareFrameAndViewForPrint).\n      {\n        PrepareFrameAndViewForPrint prep_frame_view(default_settings,\n                                                    frame,\n                                                    frame->GetView());\n        expected_pages_count = prep_frame_view.GetExpectedPageCount();\n        DCHECK(expected_pages_count);\n      }\n\n      \/\/ Ask the browser to show UI to retrieve the final print settings.\n      ViewMsg_PrintPages_Params print_settings;\n      \/\/ host_window_ may be NULL at this point if the current window is a popup\n      \/\/ and the print() command has been issued from the parent. The receiver\n      \/\/ of this message has to deal with this.\n      msg = new ViewHostMsg_ScriptedPrint(routing_id(),\n                                          render_view_->host_window(),\n                                          default_settings.document_cookie,\n                                          expected_pages_count,\n                                          false,  \/\/ has_selection\n                                          &print_settings);\n      if (Send(msg)) {\n        msg = NULL;\n\n        \/\/ Printing selection only not supported yet.\n        if (print_settings.params.selection_only) {\n          NOTIMPLEMENTED();\n        }\n\n        \/\/ If the settings are invalid, early quit.\n        if (print_settings.params.dpi &&\n            print_settings.params.document_cookie) {\n          \/\/ Render the printed pages. It will implicitly revert the document to\n          \/\/ display CSS media type.\n          PrintPages(print_settings, frame);\n          \/\/ All went well.\n          return;\n        } else {\n          \/\/ The user cancelled.\n        }\n      } else {\n        \/\/ Send() failed.\n        NOTREACHED();\n      }\n    } else {\n      \/\/ The user cancelled.\n    }\n  } else {\n    \/\/ Send() failed.\n    NOTREACHED();\n  }\n  \/\/ TODO(maruel):  bug 1123882 Alert the user that printing failed.\n#else  \/\/ defined(OS_WIN)\n  \/\/ TODO(port): print not implemented\n  NOTIMPLEMENTED();\n#endif\n}\n\nvoid PrintWebViewHelper::PrintPages(const ViewMsg_PrintPages_Params& params,\n                                 WebFrame* frame) {\n  PrepareFrameAndViewForPrint prep_frame_view(params.params,\n                                              frame,\n                                              frame->GetView());\n  int page_count = prep_frame_view.GetExpectedPageCount();\n\n  Send(new ViewHostMsg_DidGetPrintedPagesCount(routing_id(),\n                                               params.params.document_cookie,\n                                               page_count));\n  if (page_count) {\n    ViewMsg_PrintPage_Params page_params;\n    page_params.params = params.params;\n    if (params.pages.empty()) {\n      for (int i = 0; i < page_count; ++i) {\n        page_params.page_number = i;\n        PrintPage(page_params, prep_frame_view.GetPrintCanvasSize(), frame);\n      }\n    } else {\n      for (size_t i = 0; i < params.pages.size(); ++i) {\n        page_params.page_number = params.pages[i];\n        PrintPage(page_params, prep_frame_view.GetPrintCanvasSize(), frame);\n      }\n    }\n  }\n}\n\nvoid PrintWebViewHelper::PrintPage(const ViewMsg_PrintPage_Params& params,\n                                const gfx::Size& canvas_size,\n                                WebFrame* frame) {\n#if defined(OS_WIN)\n  \/\/ Generate a memory-based EMF file. The EMF will use the current screen's\n  \/\/ DPI.\n  gfx::Emf emf;\n\n  emf.CreateDc(NULL, NULL);\n  HDC hdc = emf.hdc();\n  DCHECK(hdc);\n  skia::PlatformDeviceWin::InitializeDC(hdc);\n  \/\/ Since WebKit extends the page width depending on the magical shrink\n  \/\/ factor we make sure the canvas covers the worst case scenario\n  \/\/ (x2.0 currently).  PrintContext will then set the correct clipping region.\n  int size_x = static_cast<int>(canvas_size.width() * params.params.max_shrink);\n  int size_y = static_cast<int>(canvas_size.height() *\n      params.params.max_shrink);\n  \/\/ Calculate the dpi adjustment.\n  float shrink = static_cast<float>(canvas_size.width()) \/\n      params.params.printable_size.width();\n#if 0\n  \/\/ TODO(maruel): This code is kept for testing until the 100% GDI drawing\n  \/\/ code is stable. maruels use this code's output as a reference when the\n  \/\/ GDI drawing code fails.\n\n  \/\/ Mix of Skia and GDI based.\n  skia::PlatformCanvasWin canvas(size_x, size_y, true);\n  canvas.drawARGB(255, 255, 255, 255, SkPorterDuff::kSrc_Mode);\n  float webkit_shrink = frame->PrintPage(params.page_number, &canvas);\n  if (shrink <= 0) {\n    NOTREACHED() << \"Printing page \" << params.page_number << \" failed.\";\n  } else {\n    \/\/ Update the dpi adjustment with the \"page shrink\" calculated in webkit.\n    shrink \/= webkit_shrink;\n  }\n\n  \/\/ Create a BMP v4 header that we can serialize.\n  BITMAPV4HEADER bitmap_header;\n  gfx::CreateBitmapV4Header(size_x, size_y, &bitmap_header);\n  const SkBitmap& src_bmp = canvas.getDevice()->accessBitmap(true);\n  SkAutoLockPixels src_lock(src_bmp);\n  int retval = StretchDIBits(hdc,\n                             0,\n                             0,\n                             size_x, size_y,\n                             0, 0,\n                             size_x, size_y,\n                             src_bmp.getPixels(),\n                             reinterpret_cast<BITMAPINFO*>(&bitmap_header),\n                             DIB_RGB_COLORS,\n                             SRCCOPY);\n  DCHECK(retval != GDI_ERROR);\n#else\n  \/\/ 100% GDI based.\n  skia::VectorCanvas canvas(hdc, size_x, size_y);\n  float webkit_shrink = frame->PrintPage(params.page_number, &canvas);\n  if (shrink <= 0) {\n    NOTREACHED() << \"Printing page \" << params.page_number << \" failed.\";\n  } else {\n    \/\/ Update the dpi adjustment with the \"page shrink\" calculated in webkit.\n    shrink \/= webkit_shrink;\n  }\n#endif\n\n  \/\/ Done printing. Close the device context to retrieve the compiled EMF.\n  if (!emf.CloseDc()) {\n    NOTREACHED() << \"EMF failed\";\n  }\n\n  \/\/ Get the size of the compiled EMF.\n  unsigned buf_size = emf.GetDataSize();\n  DCHECK_GT(buf_size, 128u);\n  ViewHostMsg_DidPrintPage_Params page_params;\n  page_params.data_size = 0;\n  page_params.emf_data_handle = NULL;\n  page_params.page_number = params.page_number;\n  page_params.document_cookie = params.params.document_cookie;\n  page_params.actual_shrink = shrink;\n  base::SharedMemory shared_buf;\n\n  \/\/ http:\/\/msdn2.microsoft.com\/en-us\/library\/ms535522.aspx\n  \/\/ Windows 2000\/XP: When a page in a spooled file exceeds approximately 350\n  \/\/ MB, it can fail to print and not send an error message.\n  if (buf_size < 350*1024*1024) {\n    \/\/ Allocate a shared memory buffer to hold the generated EMF data.\n    if (shared_buf.Create(L\"\", false, false, buf_size) &&\n        shared_buf.Map(buf_size)) {\n      \/\/ Copy the bits into shared memory.\n      if (emf.GetData(shared_buf.memory(), buf_size)) {\n        page_params.emf_data_handle = shared_buf.handle();\n        page_params.data_size = buf_size;\n      } else {\n        NOTREACHED() << \"GetData() failed\";\n      }\n      shared_buf.Unmap();\n    } else {\n      NOTREACHED() << \"Buffer allocation failed\";\n    }\n  } else {\n    NOTREACHED() << \"Buffer too large: \" << buf_size;\n  }\n  emf.CloseEmf();\n  if (Send(new ViewHostMsg_DuplicateSection(routing_id(),\n                                            page_params.emf_data_handle,\n                                            &page_params.emf_data_handle))) {\n    Send(new ViewHostMsg_DidPrintPage(routing_id(), page_params));\n  }\n#else  \/\/ defined(OS_WIN)\n  \/\/ TODO(port) implement printing\n  NOTIMPLEMENTED();\n#endif\n}\n\nbool PrintWebViewHelper::Send(IPC::Message* msg) {\n  return render_view_->Send(msg);\n}\n\nint32 PrintWebViewHelper::routing_id() {\n  return render_view_->routing_id();\n}\n\nvoid PrintWebViewHelper::GetWindowRect(WebWidget* webwidget,\n                                    WebKit::WebRect* rect) {\n  NOTREACHED();\n}\n\nvoid PrintWebViewHelper::DidStopLoading(WebView* webview) {\n  NOTREACHED();\n}\n\nWebKit::WebScreenInfo PrintWebViewHelper::GetScreenInfo(WebWidget* webwidget) {\n  WebKit::WebScreenInfo info;\n  NOTREACHED();\n  return info;\n}\n\ngfx::NativeViewId PrintWebViewHelper::GetContainingView(WebWidget* webwidget) {\n  NOTREACHED();\n  return gfx::NativeViewId();\n}\n\nbool PrintWebViewHelper::IsHidden(WebWidget* webwidget) {\n  NOTREACHED();\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************\n *  static_vector_test.hpp\n *  bptree\n *\n *  Copyright (c) 2017, Chi-En Wu\n *  Distributed under MIT License\n ************************************************\/\n\n#include <cassert>\n#include <cstddef>\n\n#include <array>\n#include <stdexcept>\n\n#include <gtest\/gtest.h>\n\n#include <bptree\/internal\/static_vector.hpp>\n\nusing bptree::internal::static_vector;\n\nenum class constructed_with {\n    default_ctor,\n    copy_ctor,\n    move_ctor,\n    value_ctor\n};\n\nclass custom_type {\n public:  \/\/ Public Method(s)\n    custom_type()\n      : custom_type(constructed_with::default_ctor, 0)\n        { \/* do nothing *\/ }\n\n    custom_type(custom_type const& other)\n      : custom_type(constructed_with::copy_ctor, other.val_)\n        { \/* do nothing *\/ }\n\n    custom_type(custom_type&& other)\n      : custom_type(constructed_with::move_ctor, other.val_)\n        { other.val_ = 0; }\n\n    explicit custom_type(int n)\n      : custom_type(constructed_with::value_ctor, n)\n        { \/* do nothing *\/ }\n\n    \/\/ used only for generating expected results in tests\n    custom_type(constructed_with ctor, int n)\n      : ctor_(ctor), val_(n)\n        { ++num_instances_; }\n\n    ~custom_type()\n        { --num_instances_; }\n\n    custom_type& operator=(custom_type const& other)\n        { val_ = other.val_; return *this; }\n\n    custom_type& operator=(custom_type&& other)\n        { val_ = other.val_; other.val_ = 0; return *this; }\n\n    bool operator==(custom_type const& other) const\n        { return val_ == other.val_ && ctor_ == other.ctor_; }\n\n    int get() const\n        { return val_; }\n\n    constructed_with ctor() const\n        { return ctor_; }\n\n public:  \/\/ Public Static Method(s)\n    static void reset_num_instances()\n        { num_instances_ = 0; }\n\n    static std::size_t num_instances()\n        { return num_instances_; }\n\n private:  \/\/ Private Property(ies)\n    int val_;\n    constructed_with ctor_;\n\n private:  \/\/ Private Static Property(ies)\n    static std::size_t num_instances_;\n};\n\nclass StaticVectorTest : public ::testing::Test {\n protected:\n     virtual void SetUp() {\n         custom_type::reset_num_instances();\n     }\n};\n\nstd::size_t custom_type::num_instances_ = 0;\nstd::size_t const SIZE_VECTOR = 10;\n\ntemplate <typename T, std::size_t N>\nvoid assert_static_vector_size(static_vector<T, N> const& v, std::size_t size) {\n    assert(size <= N);\n\n    EXPECT_EQ(size == 0, v.empty());\n    EXPECT_EQ(size == N, v.full());\n    EXPECT_EQ(size, v.size());\n    EXPECT_EQ(N, v.max_size());\n    EXPECT_EQ(N, v.capacity());\n\n    EXPECT_THROW(v.at(size), std::out_of_range);\n}\n\ntemplate <typename T, std::size_t N, typename F>\nvoid assert_static_vector_values(static_vector<T, N> const& v, std::size_t count,\n                                 F get_expected_value) {\n    assert_static_vector_size(v, count);\n\n    typename static_vector<T, N>::const_pointer data_ptr = v.data();\n    for (std::size_t pos = 0; pos < count; ++pos, ++data_ptr) {\n        T const& expected = get_expected_value(pos);\n        EXPECT_EQ(expected, v[pos]);\n        EXPECT_EQ(expected, v.at(pos));\n        EXPECT_EQ(expected, *data_ptr);\n    }\n}\n\nTEST_F(StaticVectorTest, EmptyVector) {\n    static_vector<custom_type, SIZE_VECTOR> v;\n\n    EXPECT_EQ(0, custom_type::num_instances());\n\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, ConstructWithCount) {\n    std::size_t const COUNT = 3;\n    static_vector<custom_type, SIZE_VECTOR> v(COUNT);\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n\n    auto expected_value = custom_type(constructed_with::default_ctor, 0);\n    auto get_expected_value = [&expected_value](std::size_t pos) -> decltype(auto)\n        { return (expected_value); };\n    assert_static_vector_values(v, COUNT, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructEmptyVector) {\n    static_vector<custom_type, SIZE_VECTOR> v(0);\n\n    EXPECT_EQ(0, custom_type::num_instances());\n\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, ConstructFullVector) {\n    static_vector<custom_type, SIZE_VECTOR> v(SIZE_VECTOR);\n\n    EXPECT_EQ(SIZE_VECTOR, custom_type::num_instances());\n\n    auto expected_value = custom_type(constructed_with::default_ctor, 0);\n    auto get_expected_value = [&expected_value](std::size_t pos) -> decltype(auto)\n        { return (expected_value); };\n    assert_static_vector_values(v, SIZE_VECTOR, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructWithCountAndValue) {\n    std::size_t const COUNT = 3;\n    int const VALUE = 10;\n    static_vector<custom_type, SIZE_VECTOR> v(COUNT, custom_type(VALUE));\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n\n    auto expected_value = custom_type(constructed_with::copy_ctor, VALUE);\n    auto get_expected_value = [&expected_value](std::size_t pos) -> decltype(auto)\n        { return (expected_value); };\n    assert_static_vector_values(v, COUNT, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructWithIteratorPair) {\n    std::array<custom_type, 5> arr = {\n        custom_type(1),\n        custom_type(2),\n        custom_type(3),\n        custom_type(5),\n        custom_type(8)\n    };\n\n    static_vector<custom_type, SIZE_VECTOR> v(arr.begin(), arr.end());\n\n    EXPECT_EQ(arr.size() * 2, custom_type::num_instances());\n\n    auto get_expected_value = [&arr](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, arr[pos].get()); };\n    assert_static_vector_values(v, arr.size(), get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructWithInitializerList) {\n    std::size_t const SIZE = 5;\n    static_vector<custom_type, SIZE_VECTOR> v = {\n        custom_type(1),\n        custom_type(2),\n        custom_type(3),\n        custom_type(5),\n        custom_type(8)\n    };\n\n    EXPECT_EQ(SIZE, custom_type::num_instances());\n\n    int expected_values[] = {1, 2, 3, 5, 8};\n    auto get_expected_value = [&expected_values](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, expected_values[pos]); };\n    assert_static_vector_values(v, SIZE, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructWithAnotherVector) {\n    std::size_t const SIZE = 5;\n    static_vector<custom_type, SIZE_VECTOR> v1 = {\n        custom_type(1),\n        custom_type(2),\n        custom_type(3),\n        custom_type(5),\n        custom_type(8)\n    };\n\n    static_vector<custom_type, SIZE_VECTOR> v2 = v1;\n\n    EXPECT_EQ(SIZE * 2, custom_type::num_instances());\n\n    int expected_values[] = {1, 2, 3, 5, 8};\n    auto get_expected_value = [&expected_values](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, expected_values[pos]); };\n    assert_static_vector_values(v2, SIZE, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, DestructValues) {\n    {\n        static_vector<custom_type, SIZE_VECTOR> v(3);\n        EXPECT_EQ(3, custom_type::num_instances());\n    }\n\n    EXPECT_EQ(0, custom_type::num_instances());\n}\n\nTEST_F(StaticVectorTest, ClearValues) {\n    static_vector<custom_type, SIZE_VECTOR> v = {\n        custom_type(1),\n        custom_type(2),\n        custom_type(3),\n        custom_type(5),\n        custom_type(8)\n    };\n\n    v.clear();\n\n    EXPECT_EQ(0, custom_type::num_instances());\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, AssignWithOperatorAndInitializerList) {\n    static_vector<custom_type, SIZE_VECTOR> v = {\n        custom_type(1),\n        custom_type(2),\n        custom_type(3),\n        custom_type(5),\n        custom_type(8)\n    };\n\n    std::size_t const SIZE = 3;\n    v = {\n        custom_type(13),\n        custom_type(21),\n        custom_type(34)\n    };\n\n    EXPECT_EQ(SIZE, custom_type::num_instances());\n\n    int expected_values[] = {13, 21, 34};\n    auto get_expected_value = [&expected_values](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, expected_values[pos]); };\n    assert_static_vector_values(v, SIZE, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, AssignWithOperatorAndAnotherVector) {\n    static_vector<custom_type, SIZE_VECTOR> v1 = {\n        custom_type(1),\n        custom_type(2),\n        custom_type(3),\n        custom_type(5),\n        custom_type(8)\n    };\n\n    std::size_t const SIZE = 3;\n    static_vector<custom_type, SIZE_VECTOR> v2 = {\n        custom_type(13),\n        custom_type(21),\n        custom_type(34)\n    };\n\n    v1 = v2;\n\n    EXPECT_EQ(SIZE * 2, custom_type::num_instances());\n\n    int expected_values[] = {13, 21, 34};\n    auto get_expected_value = [&expected_values](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, expected_values[pos]); };\n    assert_static_vector_values(v1, SIZE, get_expected_value);\n}\n<commit_msg>:hammer: Generate data for test cases of `static_vector` with macro<commit_after>\/************************************************\n *  static_vector_test.hpp\n *  bptree\n *\n *  Copyright (c) 2017, Chi-En Wu\n *  Distributed under MIT License\n ************************************************\/\n\n#include <cassert>\n#include <cstddef>\n\n#include <array>\n#include <stdexcept>\n\n#include <gtest\/gtest.h>\n\n#include <bptree\/internal\/static_vector.hpp>\n\nusing bptree::internal::static_vector;\n\nenum class constructed_with {\n    default_ctor,\n    copy_ctor,\n    move_ctor,\n    value_ctor\n};\n\nclass custom_type {\n public:  \/\/ Public Method(s)\n    custom_type()\n      : custom_type(constructed_with::default_ctor, 0)\n        { \/* do nothing *\/ }\n\n    custom_type(custom_type const& other)\n      : custom_type(constructed_with::copy_ctor, other.val_)\n        { \/* do nothing *\/ }\n\n    custom_type(custom_type&& other)\n      : custom_type(constructed_with::move_ctor, other.val_)\n        { other.val_ = 0; }\n\n    explicit custom_type(int n)\n      : custom_type(constructed_with::value_ctor, n)\n        { \/* do nothing *\/ }\n\n    \/\/ used only for generating expected results in tests\n    custom_type(constructed_with ctor, int n)\n      : ctor_(ctor), val_(n)\n        { ++num_instances_; }\n\n    ~custom_type()\n        { --num_instances_; }\n\n    custom_type& operator=(custom_type const& other)\n        { val_ = other.val_; return *this; }\n\n    custom_type& operator=(custom_type&& other)\n        { val_ = other.val_; other.val_ = 0; return *this; }\n\n    bool operator==(custom_type const& other) const\n        { return val_ == other.val_ && ctor_ == other.ctor_; }\n\n    int get() const\n        { return val_; }\n\n    constructed_with ctor() const\n        { return ctor_; }\n\n public:  \/\/ Public Static Method(s)\n    static void reset_num_instances()\n        { num_instances_ = 0; }\n\n    static std::size_t num_instances()\n        { return num_instances_; }\n\n private:  \/\/ Private Property(ies)\n    int val_;\n    constructed_with ctor_;\n\n private:  \/\/ Private Static Property(ies)\n    static std::size_t num_instances_;\n};\n\nclass StaticVectorTest : public ::testing::Test {\n protected:\n     virtual void SetUp() {\n         custom_type::reset_num_instances();\n     }\n};\n\nstd::size_t custom_type::num_instances_ = 0;\nstd::size_t const SIZE_VECTOR = 10;\n\n#define VA_NARGS_IMPL(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, n, ...) n\n#define VA_NARGS(...) VA_NARGS_IMPL(__VA_ARGS__, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1)\n\n#define INIT_LIST_IMPL_1(wrap, value) wrap(value)\n#define INIT_LIST_IMPL_2(wrap, _1, value) \\\n        INIT_LIST_IMPL_1(wrap, _1), wrap(value)\n#define INIT_LIST_IMPL_3(wrap, _1, _2, value) \\\n        INIT_LIST_IMPL_2(wrap, _1, _2), wrap(value)\n#define INIT_LIST_IMPL_4(wrap, _1, _2, _3, value) \\\n        INIT_LIST_IMPL_3(wrap, _1, _2, _3), wrap(value)\n#define INIT_LIST_IMPL_5(wrap, _1, _2, _3, _4, value) \\\n        INIT_LIST_IMPL_4(wrap, _1, _2, _3, _4), wrap(value)\n#define INIT_LIST_IMPL_6(wrap, _1, _2, _3, _4, _5, value) \\\n        INIT_LIST_IMPL_5(wrap, _1, _2, _3, _4, _5), wrap(value)\n#define INIT_LIST_IMPL_7(wrap, _1, _2, _3, _4, _5, _6, value) \\\n        INIT_LIST_IMPL_6(wrap, _1, _2, _3, _4, _5, _6), wrap(value)\n#define INIT_LIST_IMPL_8(wrap, _1, _2, _3, _4, _5, _6, _7, value) \\\n        INIT_LIST_IMPL_7(wrap, _1, _2, _3, _4, _5, _6, _7), wrap(value)\n#define INIT_LIST_IMPL_9(wrap, _1, _2, _3, _4, _5, _6, _7, _8, value) \\\n        INIT_LIST_IMPL_8(wrap, _1, _2, _3, _4, _5, _6, _7, _8), wrap(value)\n#define INIT_LIST_IMPL_10(wrap, _1, _2, _3, _4, _5, _6, _7, _8, _9, value) \\\n        INIT_LIST_IMPL_9(wrap, _1, _2, _3, _4, _5, _6, _7, _8, _9), wrap(value)\n\n#define INIT_LIST_IMPL_N(n, wrap, ...)  INIT_LIST_IMPL_##n(wrap, __VA_ARGS__)\n#define INIT_LIST_IMPL(n, wrap, ...)    INIT_LIST_IMPL_N(n, wrap, __VA_ARGS__)\n\n#define INIT_LIST(wrap, ...)            { INIT_LIST_IMPL(VA_NARGS(__VA_ARGS__), wrap, __VA_ARGS__) }\n\n#define TEST_VALUES                     1, 2, 3, 5, 8\n#define EXTRA_TEST_VALUES               13, 21, 34\n\ntemplate <typename T, std::size_t N>\nvoid assert_static_vector_size(static_vector<T, N> const& v, std::size_t size) {\n    assert(size <= N);\n\n    EXPECT_EQ(size == 0, v.empty());\n    EXPECT_EQ(size == N, v.full());\n    EXPECT_EQ(size, v.size());\n    EXPECT_EQ(N, v.max_size());\n    EXPECT_EQ(N, v.capacity());\n\n    EXPECT_THROW(v.at(size), std::out_of_range);\n}\n\ntemplate <typename T, std::size_t N, typename F>\nvoid assert_static_vector_values(static_vector<T, N> const& v, std::size_t count,\n                                 F get_expected_value) {\n    assert_static_vector_size(v, count);\n\n    typename static_vector<T, N>::const_pointer data_ptr = v.data();\n    for (std::size_t pos = 0; pos < count; ++pos, ++data_ptr) {\n        T const& expected = get_expected_value(pos);\n        EXPECT_EQ(expected, v[pos]);\n        EXPECT_EQ(expected, v.at(pos));\n        EXPECT_EQ(expected, *data_ptr);\n    }\n}\n\nTEST_F(StaticVectorTest, EmptyVector) {\n    static_vector<custom_type, SIZE_VECTOR> v;\n\n    EXPECT_EQ(0, custom_type::num_instances());\n\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, ConstructWithCount) {\n    std::size_t const COUNT = 3;\n    static_vector<custom_type, SIZE_VECTOR> v(COUNT);\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n\n    auto expected_value = custom_type(constructed_with::default_ctor, 0);\n    auto get_expected_value = [&expected_value](std::size_t pos) -> decltype(auto)\n        { return (expected_value); };\n    assert_static_vector_values(v, COUNT, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructEmptyVector) {\n    static_vector<custom_type, SIZE_VECTOR> v(0);\n\n    EXPECT_EQ(0, custom_type::num_instances());\n\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, ConstructFullVector) {\n    static_vector<custom_type, SIZE_VECTOR> v(SIZE_VECTOR);\n\n    EXPECT_EQ(SIZE_VECTOR, custom_type::num_instances());\n\n    auto expected_value = custom_type(constructed_with::default_ctor, 0);\n    auto get_expected_value = [&expected_value](std::size_t pos) -> decltype(auto)\n        { return (expected_value); };\n    assert_static_vector_values(v, SIZE_VECTOR, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructWithCountAndValue) {\n    std::size_t const COUNT = 3;\n    int const VALUE = 10;\n    static_vector<custom_type, SIZE_VECTOR> v(COUNT, custom_type(VALUE));\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n\n    auto expected_value = custom_type(constructed_with::copy_ctor, VALUE);\n    auto get_expected_value = [&expected_value](std::size_t pos) -> decltype(auto)\n        { return (expected_value); };\n    assert_static_vector_values(v, COUNT, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructWithIteratorPair) {\n    std::size_t constexpr SIZE = VA_NARGS(TEST_VALUES);\n    std::array<custom_type, SIZE> arr = INIT_LIST(custom_type, TEST_VALUES);\n\n    static_vector<custom_type, SIZE_VECTOR> v(arr.begin(), arr.end());\n\n    EXPECT_EQ(SIZE * 2, custom_type::num_instances());\n\n    auto get_expected_value = [&arr](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, arr[pos].get()); };\n    assert_static_vector_values(v, SIZE, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructWithInitializerList) {\n    std::size_t const SIZE = VA_NARGS(TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v = INIT_LIST(custom_type, TEST_VALUES);\n\n    EXPECT_EQ(SIZE, custom_type::num_instances());\n\n    int expected_values[] = {TEST_VALUES};\n    auto get_expected_value = [&expected_values](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, expected_values[pos]); };\n    assert_static_vector_values(v, SIZE, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, ConstructWithAnotherVector) {\n    std::size_t const SIZE = VA_NARGS(TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v1 = INIT_LIST(custom_type, TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v2 = v1;\n\n    EXPECT_EQ(SIZE * 2, custom_type::num_instances());\n\n    int expected_values[] = {TEST_VALUES};\n    auto get_expected_value = [&expected_values](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, expected_values[pos]); };\n    assert_static_vector_values(v2, SIZE, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, DestructValues) {\n    {\n        static_vector<custom_type, SIZE_VECTOR> v(3);\n        EXPECT_EQ(3, custom_type::num_instances());\n    }\n\n    EXPECT_EQ(0, custom_type::num_instances());\n}\n\nTEST_F(StaticVectorTest, ClearValues) {\n    static_vector<custom_type, SIZE_VECTOR> v = INIT_LIST(custom_type, TEST_VALUES);\n\n    v.clear();\n\n    EXPECT_EQ(0, custom_type::num_instances());\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, AssignWithOperatorAndInitializerList) {\n    std::size_t const SIZE = VA_NARGS(EXTRA_TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v = INIT_LIST(custom_type, TEST_VALUES);\n    v = INIT_LIST(custom_type, EXTRA_TEST_VALUES);\n\n    EXPECT_EQ(SIZE, custom_type::num_instances());\n\n    int expected_values[] = {EXTRA_TEST_VALUES};\n    auto get_expected_value = [&expected_values](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, expected_values[pos]); };\n    assert_static_vector_values(v, SIZE, get_expected_value);\n}\n\nTEST_F(StaticVectorTest, AssignWithOperatorAndAnotherVector) {\n    std::size_t const SIZE = VA_NARGS(EXTRA_TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v1 = INIT_LIST(custom_type, TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v2 = INIT_LIST(custom_type, EXTRA_TEST_VALUES);\n    v1 = v2;\n\n    EXPECT_EQ(SIZE * 2, custom_type::num_instances());\n\n    int expected_values[] = {EXTRA_TEST_VALUES};\n    auto get_expected_value = [&expected_values](std::size_t pos) -> decltype(auto)\n        { return custom_type(constructed_with::copy_ctor, expected_values[pos]); };\n    assert_static_vector_values(v1, SIZE, get_expected_value);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===---------------------------- StackMaps.cpp ---------------------------===\/\/\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#define DEBUG_TYPE \"stackmaps\"\n\n#include \"llvm\/CodeGen\/StackMaps.h\"\n\n#include \"llvm\/CodeGen\/AsmPrinter.h\"\n#include \"llvm\/CodeGen\/MachineInstr.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCSectionMachO.h\"\n#include \"llvm\/MC\/MCStreamer.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetOpcodes.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n\n#include <iterator>\n\nusing namespace llvm;\n\nvoid StackMaps::recordStackMap(const MachineInstr &MI, uint32_t ID,\n                               MachineInstr::const_mop_iterator MOI,\n                               MachineInstr::const_mop_iterator MOE) {\n\n  MCContext &OutContext = AP.OutStreamer.getContext();\n  MCSymbol *MILabel = OutContext.CreateTempSymbol();\n  AP.OutStreamer.EmitLabel(MILabel);\n\n  LocationVec CallsiteLocs;\n\n  while (MOI != MOE) {\n    std::pair<Location, MachineInstr::const_mop_iterator> ParseResult =\n      OpParser(MOI, MOE);\n\n    Location &Loc = ParseResult.first;\n\n    \/\/ Move large constants into the constant pool.\n    if (Loc.LocType == Location::Constant && (Loc.Offset & ~0xFFFFFFFFULL)) {\n      Loc.LocType = Location::ConstantIndex;\n      Loc.Offset = ConstPool.getConstantIndex(Loc.Offset);\n    }\n\n    CallsiteLocs.push_back(Loc);\n    MOI = ParseResult.second;\n  }\n\n  const MCExpr *CSOffsetExpr = MCBinaryExpr::CreateSub(\n    MCSymbolRefExpr::Create(MILabel, OutContext),\n    MCSymbolRefExpr::Create(AP.CurrentFnSym, OutContext),\n    OutContext);\n\n  CSInfos.push_back(CallsiteInfo(CSOffsetExpr, ID, CallsiteLocs));\n}\n\n\/\/\/ serializeToStackMapSection conceptually populates the following fields:\n\/\/\/\n\/\/\/ uint32 : Reserved (header)\n\/\/\/ uint32 : NumConstants\n\/\/\/ int64  : Constants[NumConstants]\n\/\/\/ uint32 : NumRecords\n\/\/\/ StkMapRecord[NumRecords] {\n\/\/\/   uint32 : PatchPoint ID\n\/\/\/   uint32 : Instruction Offset\n\/\/\/   uint16 : Reserved (record flags)\n\/\/\/   uint16 : NumLocations\n\/\/\/   Location[NumLocations] {\n\/\/\/     uint8  : Register | Direct | Indirect | Constant | ConstantIndex\n\/\/\/     uint8  : Reserved (location flags)\n\/\/\/     uint16 : Dwarf RegNum\n\/\/\/     int32  : Offset\n\/\/\/   }\n\/\/\/ }\n\/\/\/\n\/\/\/ Location Encoding, Type, Value:\n\/\/\/   0x1, Register, Reg                 (value in register)\n\/\/\/   0x2, Direct, Reg + Offset          (frame index)\n\/\/\/   0x3, Indirect, [Reg + Offset]      (spilled value)\n\/\/\/   0x4, Constant, Offset              (small constant)\n\/\/\/   0x5, ConstIndex, Constants[Offset] (large constant)\n\/\/\/\nvoid StackMaps::serializeToStackMapSection() {\n  \/\/ Bail out if there's no stack map data.\n  if (CSInfos.empty())\n    return;\n\n  MCContext &OutContext = AP.OutStreamer.getContext();\n  const TargetRegisterInfo *TRI = AP.TM.getRegisterInfo();\n\n  \/\/ Create the section.\n  const MCSection *StackMapSection =\n    OutContext.getObjectFileInfo().getStackMapSection();\n  AP.OutStreamer.SwitchSection(StackMapSection);\n\n  \/\/ Emit a dummy symbol to force section inclusion.\n  AP.OutStreamer.EmitLabel(\n    OutContext.GetOrCreateSymbol(Twine(\"__LLVM_StackMaps\")));\n\n  \/\/ Serialize data.\n  const char *WSMP = \"Stack Maps: \";\n  (void)WSMP;\n  const MCRegisterInfo &MCRI = *OutContext.getRegisterInfo();\n\n  DEBUG(dbgs() << \"********** Stack Map Output **********\\n\");\n\n  \/\/ Header.\n  AP.OutStreamer.EmitIntValue(0, 4);\n\n  \/\/ Num constants.\n  AP.OutStreamer.EmitIntValue(ConstPool.getNumConstants(), 4);\n\n  \/\/ Constant pool entries.\n  for (unsigned i = 0; i < ConstPool.getNumConstants(); ++i)\n    AP.OutStreamer.EmitIntValue(ConstPool.getConstant(i), 8);\n\n  DEBUG(dbgs() << WSMP << \"#callsites = \" << CSInfos.size() << \"\\n\");\n  AP.OutStreamer.EmitIntValue(CSInfos.size(), 4);\n\n  for (CallsiteInfoList::const_iterator CSII = CSInfos.begin(),\n                                        CSIE = CSInfos.end();\n       CSII != CSIE; ++CSII) {\n\n    unsigned CallsiteID = CSII->ID;\n    const LocationVec &CSLocs = CSII->Locations;\n\n    DEBUG(dbgs() << WSMP << \"callsite \" << CallsiteID << \"\\n\");\n\n    \/\/ Verify stack map entry. It's better to communicate a problem to the\n    \/\/ runtime than crash in case of in-process compilation. Currently, we do\n    \/\/ simple overflow checks, but we may eventually communicate other\n    \/\/ compilation errors this way.\n    if (CSLocs.size() > UINT16_MAX) {\n      AP.OutStreamer.EmitIntValue(UINT32_MAX, 4); \/\/ Invalid ID.\n      AP.OutStreamer.EmitValue(CSII->CSOffsetExpr, 4);\n      AP.OutStreamer.EmitIntValue(0, 2); \/\/ Reserved.\n      AP.OutStreamer.EmitIntValue(0, 2); \/\/ 0 locations.\n      continue;\n    }\n\n    AP.OutStreamer.EmitIntValue(CallsiteID, 4);\n    AP.OutStreamer.EmitValue(CSII->CSOffsetExpr, 4);\n\n    \/\/ Reserved for flags.\n    AP.OutStreamer.EmitIntValue(0, 2);\n\n    DEBUG(dbgs() << WSMP << \"  has \" << CSLocs.size() << \" locations\\n\");\n\n    AP.OutStreamer.EmitIntValue(CSLocs.size(), 2);\n\n    unsigned operIdx = 0;\n    for (LocationVec::const_iterator LocI = CSLocs.begin(), LocE = CSLocs.end();\n         LocI != LocE; ++LocI, ++operIdx) {\n      const Location &Loc = *LocI;\n      DEBUG(\n        dbgs() << WSMP << \"  Loc \" << operIdx << \": \";\n        switch (Loc.LocType) {\n        case Location::Unprocessed:\n          dbgs() << \"<Unprocessed operand>\";\n          break;\n        case Location::Register:\n          dbgs() << \"Register \" << MCRI.getName(Loc.Reg);\n          break;\n        case Location::Direct:\n          dbgs() << \"Direct \" << MCRI.getName(Loc.Reg);\n          if (Loc.Offset)\n            dbgs() << \" + \" << Loc.Offset;\n          break;\n        case Location::Indirect:\n          dbgs() << \"Indirect \" << MCRI.getName(Loc.Reg)\n                 << \" + \" << Loc.Offset;\n          break;\n        case Location::Constant:\n          dbgs() << \"Constant \" << Loc.Offset;\n          break;\n        case Location::ConstantIndex:\n          dbgs() << \"Constant Index \" << Loc.Offset;\n          break;\n        }\n        dbgs() << \"\\n\";\n      );\n\n      unsigned RegNo = 0;\n      if(Loc.Reg) {\n        RegNo = MCRI.getDwarfRegNum(Loc.Reg, false);\n        for (MCSuperRegIterator SR(Loc.Reg, TRI);\n             SR.isValid() && (int)RegNo < 0; ++SR) {\n          RegNo = TRI->getDwarfRegNum(*SR, false);\n        }\n      }\n      else {\n        assert((Loc.LocType != Location::Register\n                && Loc.LocType != Location::Register) &&\n               \"Missing location register\");\n      }\n      AP.OutStreamer.EmitIntValue(Loc.LocType, 1);\n      AP.OutStreamer.EmitIntValue(0, 1); \/\/ Reserved location flags.\n      AP.OutStreamer.EmitIntValue(RegNo, 2);\n      AP.OutStreamer.EmitIntValue(Loc.Offset, 4);\n    }\n  }\n\n  AP.OutStreamer.AddBlankLine();\n\n  CSInfos.clear();\n}\n<commit_msg>Fix some minor issues with r194282 to get the tree healthy again.<commit_after>\/\/===---------------------------- StackMaps.cpp ---------------------------===\/\/\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#define DEBUG_TYPE \"stackmaps\"\n\n#include \"llvm\/CodeGen\/StackMaps.h\"\n\n#include \"llvm\/CodeGen\/AsmPrinter.h\"\n#include \"llvm\/CodeGen\/MachineInstr.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCObjectFileInfo.h\"\n#include \"llvm\/MC\/MCSectionMachO.h\"\n#include \"llvm\/MC\/MCStreamer.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetOpcodes.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n\n#include <iterator>\n\nusing namespace llvm;\n\nvoid StackMaps::recordStackMap(const MachineInstr &MI, uint32_t ID,\n                               MachineInstr::const_mop_iterator MOI,\n                               MachineInstr::const_mop_iterator MOE) {\n\n  MCContext &OutContext = AP.OutStreamer.getContext();\n  MCSymbol *MILabel = OutContext.CreateTempSymbol();\n  AP.OutStreamer.EmitLabel(MILabel);\n\n  LocationVec CallsiteLocs;\n\n  while (MOI != MOE) {\n    std::pair<Location, MachineInstr::const_mop_iterator> ParseResult =\n      OpParser(MOI, MOE);\n\n    Location &Loc = ParseResult.first;\n\n    \/\/ Move large constants into the constant pool.\n    if (Loc.LocType == Location::Constant && (Loc.Offset & ~0xFFFFFFFFULL)) {\n      Loc.LocType = Location::ConstantIndex;\n      Loc.Offset = ConstPool.getConstantIndex(Loc.Offset);\n    }\n\n    CallsiteLocs.push_back(Loc);\n    MOI = ParseResult.second;\n  }\n\n  const MCExpr *CSOffsetExpr = MCBinaryExpr::CreateSub(\n    MCSymbolRefExpr::Create(MILabel, OutContext),\n    MCSymbolRefExpr::Create(AP.CurrentFnSym, OutContext),\n    OutContext);\n\n  CSInfos.push_back(CallsiteInfo(CSOffsetExpr, ID, CallsiteLocs));\n}\n\n\/\/\/ serializeToStackMapSection conceptually populates the following fields:\n\/\/\/\n\/\/\/ uint32 : Reserved (header)\n\/\/\/ uint32 : NumConstants\n\/\/\/ int64  : Constants[NumConstants]\n\/\/\/ uint32 : NumRecords\n\/\/\/ StkMapRecord[NumRecords] {\n\/\/\/   uint32 : PatchPoint ID\n\/\/\/   uint32 : Instruction Offset\n\/\/\/   uint16 : Reserved (record flags)\n\/\/\/   uint16 : NumLocations\n\/\/\/   Location[NumLocations] {\n\/\/\/     uint8  : Register | Direct | Indirect | Constant | ConstantIndex\n\/\/\/     uint8  : Reserved (location flags)\n\/\/\/     uint16 : Dwarf RegNum\n\/\/\/     int32  : Offset\n\/\/\/   }\n\/\/\/ }\n\/\/\/\n\/\/\/ Location Encoding, Type, Value:\n\/\/\/   0x1, Register, Reg                 (value in register)\n\/\/\/   0x2, Direct, Reg + Offset          (frame index)\n\/\/\/   0x3, Indirect, [Reg + Offset]      (spilled value)\n\/\/\/   0x4, Constant, Offset              (small constant)\n\/\/\/   0x5, ConstIndex, Constants[Offset] (large constant)\n\/\/\/\nvoid StackMaps::serializeToStackMapSection() {\n  \/\/ Bail out if there's no stack map data.\n  if (CSInfos.empty())\n    return;\n\n  MCContext &OutContext = AP.OutStreamer.getContext();\n  const TargetRegisterInfo *TRI = AP.TM.getRegisterInfo();\n\n  \/\/ Create the section.\n  const MCSection *StackMapSection =\n    OutContext.getObjectFileInfo()->getStackMapSection();\n  AP.OutStreamer.SwitchSection(StackMapSection);\n\n  \/\/ Emit a dummy symbol to force section inclusion.\n  AP.OutStreamer.EmitLabel(\n    OutContext.GetOrCreateSymbol(Twine(\"__LLVM_StackMaps\")));\n\n  \/\/ Serialize data.\n  const char *WSMP = \"Stack Maps: \";\n  (void)WSMP;\n  const MCRegisterInfo &MCRI = *OutContext.getRegisterInfo();\n\n  DEBUG(dbgs() << \"********** Stack Map Output **********\\n\");\n\n  \/\/ Header.\n  AP.OutStreamer.EmitIntValue(0, 4);\n\n  \/\/ Num constants.\n  AP.OutStreamer.EmitIntValue(ConstPool.getNumConstants(), 4);\n\n  \/\/ Constant pool entries.\n  for (unsigned i = 0; i < ConstPool.getNumConstants(); ++i)\n    AP.OutStreamer.EmitIntValue(ConstPool.getConstant(i), 8);\n\n  DEBUG(dbgs() << WSMP << \"#callsites = \" << CSInfos.size() << \"\\n\");\n  AP.OutStreamer.EmitIntValue(CSInfos.size(), 4);\n\n  for (CallsiteInfoList::const_iterator CSII = CSInfos.begin(),\n                                        CSIE = CSInfos.end();\n       CSII != CSIE; ++CSII) {\n\n    unsigned CallsiteID = CSII->ID;\n    const LocationVec &CSLocs = CSII->Locations;\n\n    DEBUG(dbgs() << WSMP << \"callsite \" << CallsiteID << \"\\n\");\n\n    \/\/ Verify stack map entry. It's better to communicate a problem to the\n    \/\/ runtime than crash in case of in-process compilation. Currently, we do\n    \/\/ simple overflow checks, but we may eventually communicate other\n    \/\/ compilation errors this way.\n    if (CSLocs.size() > UINT16_MAX) {\n      AP.OutStreamer.EmitIntValue(UINT32_MAX, 4); \/\/ Invalid ID.\n      AP.OutStreamer.EmitValue(CSII->CSOffsetExpr, 4);\n      AP.OutStreamer.EmitIntValue(0, 2); \/\/ Reserved.\n      AP.OutStreamer.EmitIntValue(0, 2); \/\/ 0 locations.\n      continue;\n    }\n\n    AP.OutStreamer.EmitIntValue(CallsiteID, 4);\n    AP.OutStreamer.EmitValue(CSII->CSOffsetExpr, 4);\n\n    \/\/ Reserved for flags.\n    AP.OutStreamer.EmitIntValue(0, 2);\n\n    DEBUG(dbgs() << WSMP << \"  has \" << CSLocs.size() << \" locations\\n\");\n\n    AP.OutStreamer.EmitIntValue(CSLocs.size(), 2);\n\n    unsigned operIdx = 0;\n    for (LocationVec::const_iterator LocI = CSLocs.begin(), LocE = CSLocs.end();\n         LocI != LocE; ++LocI, ++operIdx) {\n      const Location &Loc = *LocI;\n      DEBUG(\n        dbgs() << WSMP << \"  Loc \" << operIdx << \": \";\n        switch (Loc.LocType) {\n        case Location::Unprocessed:\n          dbgs() << \"<Unprocessed operand>\";\n          break;\n        case Location::Register:\n          dbgs() << \"Register \" << MCRI.getName(Loc.Reg);\n          break;\n        case Location::Direct:\n          dbgs() << \"Direct \" << MCRI.getName(Loc.Reg);\n          if (Loc.Offset)\n            dbgs() << \" + \" << Loc.Offset;\n          break;\n        case Location::Indirect:\n          dbgs() << \"Indirect \" << MCRI.getName(Loc.Reg)\n                 << \" + \" << Loc.Offset;\n          break;\n        case Location::Constant:\n          dbgs() << \"Constant \" << Loc.Offset;\n          break;\n        case Location::ConstantIndex:\n          dbgs() << \"Constant Index \" << Loc.Offset;\n          break;\n        }\n        dbgs() << \"\\n\";\n      );\n\n      unsigned RegNo = 0;\n      if(Loc.Reg) {\n        RegNo = MCRI.getDwarfRegNum(Loc.Reg, false);\n        for (MCSuperRegIterator SR(Loc.Reg, TRI);\n             SR.isValid() && (int)RegNo < 0; ++SR) {\n          RegNo = TRI->getDwarfRegNum(*SR, false);\n        }\n      }\n      else {\n        assert((Loc.LocType != Location::Register\n                && Loc.LocType != Location::Register) &&\n               \"Missing location register\");\n      }\n      AP.OutStreamer.EmitIntValue(Loc.LocType, 1);\n      AP.OutStreamer.EmitIntValue(0, 1); \/\/ Reserved location flags.\n      AP.OutStreamer.EmitIntValue(RegNo, 2);\n      AP.OutStreamer.EmitIntValue(Loc.Offset, 4);\n    }\n  }\n\n  AP.OutStreamer.AddBlankLine();\n\n  CSInfos.clear();\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#ifndef ETL_ITERATOR_HPP\n#define ETL_ITERATOR_HPP\n\n#include <iterator>\n\n#include \"traits_lite.hpp\"\n\nnamespace etl {\n\ntemplate<typename Expr, bool Ref = false, bool Const = true>\nstruct iterator : public std::iterator<std::random_access_iterator_tag, value_t<Expr>> {\nprivate:\n    Expr* expr;\n    std::size_t i;\n\npublic:\n    using base_iterator_t = std::iterator<std::random_access_iterator_tag, value_t<Expr>>;\n    using value_type = value_t<Expr>;\n    using reference_t = std::conditional_t<Ref,\n          std::conditional_t<Const, const value_type&, value_type&>,\n          value_type>;\n    using pointer_t = std::conditional_t<Const, const value_type*, value_type*>;\n    using difference_t = typename base_iterator_t::difference_type;\n\n    iterator(Expr& expr, std::size_t i) : expr(&expr), i(i) {}\n\n    reference_t operator*(){\n        return (*expr)[i];\n    }\n\n    reference_t operator[](difference_t n){\n        return (*expr)[n];\n    }\n\n    pointer_t operator->(){\n        return &(*expr)[i];\n    }\n\n    iterator& operator--(){\n        --i;\n        return *this;\n    }\n\n    iterator operator--(int){\n        iterator prev(*this);\n        --i;\n        return prev;\n    }\n\n    iterator& operator++(){\n        ++i;\n        return *this;\n    }\n\n    iterator operator++(int){\n        iterator prev(*this);\n        ++i;\n        return prev;\n    }\n\n    iterator& operator+=(difference_t n){\n        i += n;\n        return *this;\n    }\n\n    iterator& operator-=(difference_t n){\n        i -= n;\n        return *this;\n    }\n\n    iterator operator+(difference_t n){\n        iterator it(*this);\n        it += n;\n        return it;\n    }\n\n    iterator operator-(difference_t n){\n        iterator it(*this);\n        it -= n;\n        return it;\n    }\n\n    difference_t operator-(const iterator& it){\n        return i - it.i;\n    }\n\n    bool operator==(const iterator& other) const {\n        return expr == other.expr && i == other.i;\n    }\n\n    bool operator!=(const iterator& other) const {\n        return !(*this == other);\n    }\n};\n\n} \/\/end of namespace etl\n\n#endif\n<commit_msg>Make iterator random-access-iterator compliant<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#ifndef ETL_ITERATOR_HPP\n#define ETL_ITERATOR_HPP\n\n#include <iterator>\n\n#include \"traits_lite.hpp\"\n\nnamespace etl {\n\ntemplate<typename Expr, bool Ref = false, bool Const = true>\nstruct iterator : public std::iterator<std::random_access_iterator_tag, value_t<Expr>> {\nprivate:\n    Expr* expr;\n    std::size_t i;\n\npublic:\n    using base_iterator_t = std::iterator<std::random_access_iterator_tag, value_t<Expr>>;\n    using value_type = value_t<Expr>;\n    using reference_t = std::conditional_t<Ref,\n          std::conditional_t<Const, const value_type&, value_type&>,\n          value_type>;\n    using pointer_t = std::conditional_t<Const, const value_type*, value_type*>;\n    using difference_t = typename base_iterator_t::difference_type;\n\n    iterator(Expr& expr, std::size_t i) : expr(&expr), i(i) {}\n\n    reference_t operator*(){\n        return (*expr)[i];\n    }\n\n    reference_t operator[](difference_t n){\n        return (*expr)[n];\n    }\n\n    pointer_t operator->(){\n        return &(*expr)[i];\n    }\n\n    iterator& operator--(){\n        --i;\n        return *this;\n    }\n\n    iterator operator--(int){\n        iterator prev(*this);\n        --i;\n        return prev;\n    }\n\n    iterator& operator++(){\n        ++i;\n        return *this;\n    }\n\n    iterator operator++(int){\n        iterator prev(*this);\n        ++i;\n        return prev;\n    }\n\n    iterator& operator+=(difference_t n){\n        i += n;\n        return *this;\n    }\n\n    iterator& operator-=(difference_t n){\n        i -= n;\n        return *this;\n    }\n\n    iterator operator+(difference_t n){\n        iterator it(*this);\n        it += n;\n        return it;\n    }\n\n    iterator operator-(difference_t n){\n        iterator it(*this);\n        it -= n;\n        return it;\n    }\n\n    difference_t operator-(const iterator& it){\n        return i - it.i;\n    }\n\n    bool operator==(const iterator& other) const {\n        return expr == other.expr && i == other.i;\n    }\n\n    bool operator!=(const iterator& other) const {\n        return !(*this == other);\n    }\n\n    bool operator>(const iterator& other) const {\n        return i > other.i;\n    }\n\n    bool operator>=(const iterator& other) const {\n        return i >= other.i;\n    }\n\n    bool operator<(const iterator& other) const {\n        return i < other.i;\n    }\n\n    bool operator<=(const iterator& other) const {\n        return i <= other.i;\n\n    }\n};\n\n} \/\/end of namespace etl\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2020 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 <fstream>\n\n#include \"cpp_utils\/assert.hpp\" \/\/Assertions\n#include \"cpp_utils\/io.hpp\"     \/\/ For binary writing\n\n#include \"etl\/etl.hpp\"\n\n#include \"layer.hpp\"\n#include \"layer_traits.hpp\"\n#include \"util\/tmp.hpp\"\n\nnamespace dll {\n\n\/*!\n * \\brief Base class for RNN layers (fast \/ dynamic)\n *\/\ntemplate <typename Derived, typename Desc>\nstruct base_rnn_layer : layer<Derived> {\n    using desc      = Desc;                            \/\/\/< The descriptor of the layer\n    using derived_t = Derived;                         \/\/\/< The derived type (CRTP)\n    using weight    = typename desc::weight;           \/\/\/< The data type for this layer\n    using this_type = base_rnn_layer<derived_t, desc>; \/\/\/< The type of this layer\n    using base_type = layer<Derived>;                  \/\/\/< The base type\n\n    static constexpr auto activation_function = desc::activation_function; \/\/\/< The layer's activation function\n\n    \/*!\n     * \\brief Initialize the neural layer\n     *\/\n    base_rnn_layer()\n            : base_type() {\n        \/\/ Nothing to init here\n    }\n\n    base_rnn_layer(const base_rnn_layer& rhs) = delete;\n    base_rnn_layer(base_rnn_layer&& rhs)      = delete;\n\n    base_rnn_layer& operator=(const base_rnn_layer& rhs) = delete;\n    base_rnn_layer& operator=(base_rnn_layer&& rhs) = delete;\n\n    mutable etl::dyn_matrix<float, 3> x_t;\n    mutable etl::dyn_matrix<float, 3> s_t;\n\n    mutable etl::dyn_matrix<float, 3> delta_t;\n    mutable etl::dyn_matrix<float, 3> d_h_t;\n    mutable etl::dyn_matrix<float, 3> d_x_t;\n\n    void prepare_cache(size_t Batch, size_t time_steps, size_t sequence_length, size_t hidden_units) const {\n        if (cpp_unlikely(!x_t.memory_start())) {\n            \/\/ Forward cache\n            x_t.resize(time_steps, Batch, sequence_length);\n            s_t.resize(time_steps, Batch, hidden_units);\n\n            \/\/ Backward cache\n            delta_t.resize(time_steps, Batch, hidden_units);\n            d_h_t.resize(time_steps, Batch, hidden_units);\n            d_x_t.resize(time_steps, Batch, sequence_length);\n        }\n    }\n\n    \/*!\n     * \\brief Apply the layer to the given batch of input.\n     *\n     * \\param x A batch of input\n     * \\param output A batch of output that will be filled\n     * \\param w The W weights matrix\n     * \\param u The U weights matrix\n     *\/\n    template <typename H, typename V, typename W, typename U, typename B>\n    void forward_batch_impl(H&& output, const V& x, const W& w, const U& u, const B& b, size_t time_steps, size_t sequence_length, size_t hidden_units) const {\n        const auto Batch = etl::dim<0>(x);\n\n        prepare_cache(Batch, time_steps, sequence_length, hidden_units);\n\n        \/\/ 1. Rearrange input\n        x_t = transpose_front(x);\n\n        \/\/ 2. Forward propagation through time\n\n        \/\/ t == 0\n\n        s_t(0) = f_activate<activation_function>(bias_add_2d(x_t(0) * u, b));\n\n        for (size_t t = 1; t < time_steps; ++t) {\n            s_t(t) = f_activate<activation_function>(bias_add_2d(x_t(t) * u + s_t(t - 1) * w, b));\n        }\n\n        \/\/ 3. Rearrange the output\n\n        output = transpose_front(s_t);\n    }\n\n    \/*!\n     * \\brief Backpropagate the errors to the previous layers\n     * \\param output The ETL expression into which write the output\n     * \\param context The training context\n     *\/\n    template <typename H, typename C, typename W, typename U>\n    void backward_batch_impl(H&& output, C& context, const W& w, const U& u, size_t time_steps, size_t bptt_steps, bool direct = true) const {\n        \/\/ 1. Rearrange errors\n\n        delta_t = transpose_front(context.errors);\n\n        \/\/ 2. Get the gradients from the context\n\n        auto& w_grad = std::get<0>(context.up.context)->grad;\n        auto& u_grad = std::get<1>(context.up.context)->grad;\n        auto& b_grad = std::get<2>(context.up.context)->grad;\n\n        w_grad = 0;\n        u_grad = 0;\n        b_grad = 0;\n\n        \/\/ 3. Backpropagation through time\n\n        size_t ttt = time_steps - 1;\n\n        do {\n            const size_t last_step = std::max(int(time_steps) - int(bptt_steps), 0);\n\n            \/\/ Backpropagation through time\n            for (int tt = ttt; tt >= int(last_step); --tt) {\n                const size_t t = tt;\n\n                if(t == time_steps - 1){\n                    d_h_t(t) = delta_t(t) >> f_derivative<activation_function>(s_t(t));\n                } else {\n                    d_h_t(t) = (delta_t(t) + d_h_t(t + 1)) >> f_derivative<activation_function>(s_t(t));\n                }\n\n                if (t > 0) {\n                    w_grad += etl::batch_outer(s_t(t - 1), d_h_t(t));\n                }\n\n                u_grad += etl::batch_outer(x_t(t), d_h_t(t));\n                b_grad += etl::bias_batch_sum_2d(d_h_t(t));\n\n                \/\/ Gradients to the input\n                d_x_t(t) = d_h_t(t) * trans(u);\n\n                \/\/ Update for next steps\n                d_h_t(t) = d_h_t(t) * trans(w);\n            }\n\n            --ttt;\n\n            \/\/ If only the last time step is used, no need to use the other errors\n            if constexpr (desc::parameters::template contains<last_only>()) {\n                break;\n            }\n        } while (ttt != 0);\n\n        \/\/ 3. Rearrange for the output\n\n        if (direct) {\n            output = transpose_front(d_x_t);\n        }\n    }\n\n    \/*!\n     * \\brief Compute the gradients for this layer, if any\n     * \\param context The trainng context\n     *\/\n    template <typename C, typename W, typename U>\n    void compute_gradients_impl([[maybe_unused]] C&       context,\n                                [[maybe_unused]] const W& w,\n                                [[maybe_unused]] const U& u,\n                                [[maybe_unused]] size_t   time_steps,\n                                [[maybe_unused]] size_t   bptt_steps) const {\n        if constexpr (!C::layer){\n            backward_batch_impl(x_t, context, w, u, time_steps, bptt_steps, false);\n        }\n    }\n\n    \/*!\n     * \\brief Backup the weights in the secondary weights matrix\n     *\/\n    void backup_weights() {\n        unique_safe_get(as_derived().bak_w) = as_derived().w;\n        unique_safe_get(as_derived().bak_u) = as_derived().u;\n        unique_safe_get(as_derived().bak_b) = as_derived().b;\n    }\n\n    \/*!\n     * \\brief Restore the weights from the secondary weights matrix\n     *\/\n    void restore_weights() {\n        as_derived().w = *as_derived().bak_w;\n        as_derived().u = *as_derived().bak_u;\n        as_derived().b = *as_derived().bak_b;\n    }\n\n    \/*!\n     * \\brief Load the weigts into the given stream\n     *\/\n    void store(std::ostream& os) const {\n        cpp::binary_write_all(os, as_derived().w);\n        cpp::binary_write_all(os, as_derived().u);\n        cpp::binary_write_all(os, as_derived().b);\n    }\n\n    \/*!\n     * \\brief Load the weigts from the given stream\n     *\/\n    void load(std::istream& is) {\n        cpp::binary_load_all(is, as_derived().w);\n        cpp::binary_load_all(is, as_derived().u);\n        cpp::binary_load_all(is, as_derived().b);\n    }\n\n    \/*!\n     * \\brief Load the weigts into the given file\n     *\/\n    void store(const std::string& file) const {\n        std::ofstream os(file, std::ofstream::binary);\n        store(os);\n    }\n\n    \/*!\n     * \\brief Load the weigts from the given file\n     *\/\n    void load(const std::string& file) {\n        std::ifstream is(file, std::ifstream::binary);\n        load(is);\n    }\n\n    \/*!\n     * \\brief Returns the trainable variables of this layer.\n     * \\return a tuple containing references to the variables of this layer\n     *\/\n    decltype(auto) trainable_parameters() {\n        return std::make_tuple(std::ref(as_derived().w), std::ref(as_derived().u), std::ref(as_derived().b));\n    }\n\n    \/*!\n     * \\brief Returns the trainable variables of this layer.\n     * \\return a tuple containing references to the variables of this layer\n     *\/\n    decltype(auto) trainable_parameters() const {\n        return std::make_tuple(std::cref(as_derived().w), std::cref(as_derived().u), std::cref(as_derived().b));\n    }\n\nprivate:\n    \/\/CRTP Deduction\n\n    \/*!\n     * \\brief Returns a reference to the derived object, i.e. the object using the CRTP injector.\n     * \\return a reference to the derived object.\n     *\/\n    derived_t& as_derived() {\n        return *static_cast<derived_t*>(this);\n    }\n\n    \/*!\n     * \\brief Returns a reference to the derived object, i.e. the object using the CRTP injector.\n     * \\return a reference to the derived object.\n     *\/\n    const derived_t& as_derived() const {\n        return *static_cast<const derived_t*>(this);\n    }\n};\n\n} \/\/end of dll namespace\n<commit_msg>Improve GPU performance of RNN<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2020 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 <fstream>\n\n#include \"cpp_utils\/assert.hpp\" \/\/Assertions\n#include \"cpp_utils\/io.hpp\"     \/\/ For binary writing\n\n#include \"etl\/etl.hpp\"\n\n#include \"layer.hpp\"\n#include \"layer_traits.hpp\"\n#include \"util\/tmp.hpp\"\n\nnamespace dll {\n\n\/*!\n * \\brief Base class for RNN layers (fast \/ dynamic)\n *\/\ntemplate <typename Derived, typename Desc>\nstruct base_rnn_layer : layer<Derived> {\n    using desc      = Desc;                            \/\/\/< The descriptor of the layer\n    using derived_t = Derived;                         \/\/\/< The derived type (CRTP)\n    using weight    = typename desc::weight;           \/\/\/< The data type for this layer\n    using this_type = base_rnn_layer<derived_t, desc>; \/\/\/< The type of this layer\n    using base_type = layer<Derived>;                  \/\/\/< The base type\n\n    static constexpr auto activation_function = desc::activation_function; \/\/\/< The layer's activation function\n\n    \/*!\n     * \\brief Initialize the neural layer\n     *\/\n    base_rnn_layer()\n            : base_type() {\n        \/\/ Nothing to init here\n    }\n\n    base_rnn_layer(const base_rnn_layer& rhs) = delete;\n    base_rnn_layer(base_rnn_layer&& rhs)      = delete;\n\n    base_rnn_layer& operator=(const base_rnn_layer& rhs) = delete;\n    base_rnn_layer& operator=(base_rnn_layer&& rhs) = delete;\n\n    mutable etl::dyn_matrix<float, 3> x_t;\n    mutable etl::dyn_matrix<float, 3> s_t;\n\n    mutable etl::dyn_matrix<float, 3> delta_t;\n    mutable etl::dyn_matrix<float, 3> d_h_t;\n    mutable etl::dyn_matrix<float, 3> d_x_t;\n\n    void prepare_cache(size_t Batch, size_t time_steps, size_t sequence_length, size_t hidden_units) const {\n        if (cpp_unlikely(!x_t.memory_start())) {\n            \/\/ Forward cache\n            x_t.resize(time_steps, Batch, sequence_length);\n            s_t.resize(time_steps, Batch, hidden_units);\n\n            \/\/ Backward cache\n            delta_t.resize(time_steps, Batch, hidden_units);\n            d_h_t.resize(time_steps, Batch, hidden_units);\n            d_x_t.resize(time_steps, Batch, sequence_length);\n\n#ifdef ETL_GPU\n            \/\/ Note: all these matrices are only accessed through sub views\n            \/\/ So, the base CPU\/GPU is never fully updated.\n            \/\/ Starting with valid GPU status ensures that we never copy between\n            \/\/ CPU and GPU\n            d_h_t.ensure_gpu_up_to_date();\n            s_t.ensure_gpu_up_to_date();\n            d_h_t.ensure_gpu_up_to_date();\n            d_x_t.ensure_gpu_up_to_date();\n#endif\n        }\n    }\n\n    \/*!\n     * \\brief Apply the layer to the given batch of input.\n     *\n     * \\param x A batch of input\n     * \\param output A batch of output that will be filled\n     * \\param w The W weights matrix\n     * \\param u The U weights matrix\n     *\/\n    template <typename H, typename V, typename W, typename U, typename B>\n    void forward_batch_impl(H&& output, const V& x, const W& w, const U& u, const B& b, size_t time_steps, size_t sequence_length, size_t hidden_units) const {\n        const auto Batch = etl::dim<0>(x);\n\n        prepare_cache(Batch, time_steps, sequence_length, hidden_units);\n\n        \/\/ 1. Rearrange input\n        x_t = transpose_front(x);\n\n        \/\/ 2. Forward propagation through time\n\n        \/\/ t == 0\n\n        s_t(0) = f_activate<activation_function>(bias_add_2d(x_t(0) * u, b));\n\n        for (size_t t = 1; t < time_steps; ++t) {\n            s_t(t) = f_activate<activation_function>(bias_add_2d(x_t(t) * u + s_t(t - 1) * w, b));\n        }\n\n        \/\/ 3. Rearrange the output\n\n        output = transpose_front(s_t);\n    }\n\n    \/*!\n     * \\brief Backpropagate the errors to the previous layers\n     * \\param output The ETL expression into which write the output\n     * \\param context The training context\n     *\/\n    template <typename H, typename C, typename W, typename U>\n    void backward_batch_impl(H&& output, C& context, const W& w, const U& u, size_t time_steps, size_t bptt_steps, bool direct = true) const {\n        \/\/ 1. Rearrange errors\n\n        delta_t = transpose_front(context.errors);\n\n        \/\/ 2. Get the gradients from the context\n\n        auto& w_grad = std::get<0>(context.up.context)->grad;\n        auto& u_grad = std::get<1>(context.up.context)->grad;\n        auto& b_grad = std::get<2>(context.up.context)->grad;\n\n        w_grad = 0;\n        u_grad = 0;\n        b_grad = 0;\n\n        \/\/ 3. Backpropagation through time\n\n        size_t ttt = time_steps - 1;\n\n        do {\n            const size_t last_step = std::max(int(time_steps) - int(bptt_steps), 0);\n\n            \/\/ Backpropagation through time\n            for (int tt = ttt; tt >= int(last_step); --tt) {\n                const size_t t = tt;\n\n                if(t == time_steps - 1){\n                    d_h_t(t) = delta_t(t) >> f_derivative<activation_function>(s_t(t));\n                } else {\n                    d_h_t(t) = (delta_t(t) + d_h_t(t + 1)) >> f_derivative<activation_function>(s_t(t));\n                }\n\n                if (t > 0) {\n                    w_grad += etl::batch_outer(s_t(t - 1), d_h_t(t));\n                }\n\n                u_grad += etl::batch_outer(x_t(t), d_h_t(t));\n                b_grad += etl::bias_batch_sum_2d(d_h_t(t));\n\n                \/\/ Gradients to the input\n                d_x_t(t) = d_h_t(t) * trans(u);\n\n                \/\/ Update for next steps\n                d_h_t(t) = d_h_t(t) * trans(w);\n            }\n\n            --ttt;\n\n            \/\/ If only the last time step is used, no need to use the other errors\n            if constexpr (desc::parameters::template contains<last_only>()) {\n                break;\n            }\n        } while (ttt != 0);\n\n        \/\/ 3. Rearrange for the output\n\n        if (direct) {\n            output = transpose_front(d_x_t);\n        }\n    }\n\n    \/*!\n     * \\brief Compute the gradients for this layer, if any\n     * \\param context The trainng context\n     *\/\n    template <typename C, typename W, typename U>\n    void compute_gradients_impl([[maybe_unused]] C&       context,\n                                [[maybe_unused]] const W& w,\n                                [[maybe_unused]] const U& u,\n                                [[maybe_unused]] size_t   time_steps,\n                                [[maybe_unused]] size_t   bptt_steps) const {\n        if constexpr (!C::layer){\n            backward_batch_impl(x_t, context, w, u, time_steps, bptt_steps, false);\n        }\n    }\n\n    \/*!\n     * \\brief Backup the weights in the secondary weights matrix\n     *\/\n    void backup_weights() {\n        unique_safe_get(as_derived().bak_w) = as_derived().w;\n        unique_safe_get(as_derived().bak_u) = as_derived().u;\n        unique_safe_get(as_derived().bak_b) = as_derived().b;\n    }\n\n    \/*!\n     * \\brief Restore the weights from the secondary weights matrix\n     *\/\n    void restore_weights() {\n        as_derived().w = *as_derived().bak_w;\n        as_derived().u = *as_derived().bak_u;\n        as_derived().b = *as_derived().bak_b;\n    }\n\n    \/*!\n     * \\brief Load the weigts into the given stream\n     *\/\n    void store(std::ostream& os) const {\n        cpp::binary_write_all(os, as_derived().w);\n        cpp::binary_write_all(os, as_derived().u);\n        cpp::binary_write_all(os, as_derived().b);\n    }\n\n    \/*!\n     * \\brief Load the weigts from the given stream\n     *\/\n    void load(std::istream& is) {\n        cpp::binary_load_all(is, as_derived().w);\n        cpp::binary_load_all(is, as_derived().u);\n        cpp::binary_load_all(is, as_derived().b);\n    }\n\n    \/*!\n     * \\brief Load the weigts into the given file\n     *\/\n    void store(const std::string& file) const {\n        std::ofstream os(file, std::ofstream::binary);\n        store(os);\n    }\n\n    \/*!\n     * \\brief Load the weigts from the given file\n     *\/\n    void load(const std::string& file) {\n        std::ifstream is(file, std::ifstream::binary);\n        load(is);\n    }\n\n    \/*!\n     * \\brief Returns the trainable variables of this layer.\n     * \\return a tuple containing references to the variables of this layer\n     *\/\n    decltype(auto) trainable_parameters() {\n        return std::make_tuple(std::ref(as_derived().w), std::ref(as_derived().u), std::ref(as_derived().b));\n    }\n\n    \/*!\n     * \\brief Returns the trainable variables of this layer.\n     * \\return a tuple containing references to the variables of this layer\n     *\/\n    decltype(auto) trainable_parameters() const {\n        return std::make_tuple(std::cref(as_derived().w), std::cref(as_derived().u), std::cref(as_derived().b));\n    }\n\nprivate:\n    \/\/CRTP Deduction\n\n    \/*!\n     * \\brief Returns a reference to the derived object, i.e. the object using the CRTP injector.\n     * \\return a reference to the derived object.\n     *\/\n    derived_t& as_derived() {\n        return *static_cast<derived_t*>(this);\n    }\n\n    \/*!\n     * \\brief Returns a reference to the derived object, i.e. the object using the CRTP injector.\n     * \\return a reference to the derived object.\n     *\/\n    const derived_t& as_derived() const {\n        return *static_cast<const derived_t*>(this);\n    }\n};\n\n} \/\/end of dll namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright 2017 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) version 3, or any\n    later version accepted by the membership of KDE e.V. (or its\n    successor approved by the membership of KDE e.V.), which shall\n    act as a proxy defined in Section 6 of version 3 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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <QObject>\n#include <QtTest>\n\n#include <KConfig>\n#include <KConfigGroup>\n#include <KIconLoader>\n\n#include \"testhelpers.h\"\n\n\/**\n * Represents icon directory to conduct simple icon lookup within.\n *\/\nclass Dir\n{\npublic:\n    Dir(const KConfigGroup &cg, const QString &themeDir_)\n        : exists(checkExist(cg))\n        , themeDir(themeDir_)\n        , path(cg.name())\n        , size(cg.readEntry(\"Size\", 0))\n        , contextString(cg.readEntry(\"Context\", QString()))\n        , context(parseContext(contextString))\n        , type(parseType(cg.readEntry(\"Type\", QString(\"Threshold\"))))\n    {\n        QVERIFY2(context != -1,\n                 QString(\"Don't know how to handle 'Context=%1' of config group '[%2]'\").arg(contextString, cg.name()).toLatin1());\n    }\n\n    static void verify(const KConfigGroup &cg)\n    {\n        QVERIFY2(cg.exists(),\n                 QString(\"The theme's 'Directories' specifies '%1' as directory which appears to\"\n                         \" have no associated group entry '[%1]'\").arg(cg.name()).toLatin1());\n    }\n\n    static bool checkExist(const KConfigGroup &cg)\n    {\n        verify(cg); \/\/ extra func since QVERIFY2 is a return\n        return cg.isValid();\n    }\n\n    static QMetaEnum findEnum(const char *name)\n    {\n        auto mo = KIconLoader::staticMetaObject;\n        for (int i = 0; i < mo.enumeratorCount(); ++i) {\n            auto enumerator = mo.enumerator(i);\n            if (strcmp(enumerator.name(), name) == 0) {\n                return KIconLoader::staticMetaObject.enumerator(i);\n            }\n        }\n        Q_ASSERT(false); \/\/ failed to resolve enum\n        return QMetaEnum();\n    }\n\n    static QMetaEnum typeEnum()\n    {\n        static auto e = findEnum(\"Type\");\n        return e;\n    }\n\n    KIconLoader::Context parseContext(const QString &string)\n    {\n        \/\/ Can't use QMetaEnum as the enum names are singular, the entry values are plural though.\n        static QHash<QString, int> hash {\n            { QStringLiteral(\"Actions\"), KIconLoader::Action },\n            { QStringLiteral(\"Applications\"), KIconLoader::Application },\n            { QStringLiteral(\"Categories\"), KIconLoader::Category },\n            { QStringLiteral(\"Devices\"), KIconLoader::Device },\n            { QStringLiteral(\"Emblems\"), KIconLoader::Emblem },\n            { QStringLiteral(\"Emotes\"), KIconLoader::Emote },\n            { QStringLiteral(\"MimeTypes\"), KIconLoader::MimeType },\n            { QStringLiteral(\"Places\"), KIconLoader::Place },\n            { QStringLiteral(\"Status\"), KIconLoader::StatusIcon },\n        };\n        auto value = hash.value(string, -1);\n        return (KIconLoader::Context)value;\n    }\n\n    KIconLoader::Type parseType(const QString &string)\n    {\n        bool ok;\n        auto v = (KIconLoader::Type)typeEnum().keyToValue(string.toLatin1(), &ok);\n        Q_ASSERT(ok);\n        return v;\n    }\n\n    \/**\n     * @returns list of all icon's fileinfo (first level only, selected types\n     *          only)\n     *\/\n    QList<QFileInfo> allIcons()\n    {\n        QList<QFileInfo> icons;\n        auto iconDir = QString(\"%1\/%2\").arg(themeDir).arg(path);\n        QDirIterator it(iconDir);\n        while (it.hasNext()) {\n            it.next();\n            auto suffix = it.fileInfo().suffix();\n            if (suffix != \"svg\" && suffix != \"svgz\" && suffix != \"png\") {\n                continue; \/\/ Probably not an icon.\n            }\n            icons << it.fileInfo();\n        }\n        return icons;\n    }\n\n    bool exists;\n    QString themeDir;\n    QString path;\n    uint size;\n    QString contextString;\n    KIconLoader::Context context;\n    KIconLoader::Type type;\n};\n\n\/\/ Declare so we can put them into the QTest data table.\nQ_DECLARE_METATYPE(KIconLoader::Context)\nQ_DECLARE_METATYPE(Dir*)\n\nclass ScalableTest : public QObject\n{\n    Q_OBJECT\n\nprivate Q_SLOTS:\n    \/\/ NB: test_scalable_data leaks Dir*. Should this test grow more slots it may be wise to\n    \/\/     introduce a cleanup() to make sure the test doesn't OOM.\n\n    void test_scalable_data()\n    {\n        for (auto dir : ICON_DIRS) {\n            auto themeDir = PROJECT_SOURCE_DIR + QStringLiteral(\"\/\") + dir;\n\n            QHash<KIconLoader::Context, QList<Dir *>> contextHash;\n            QHash<KIconLoader::Context, QString> contextStringHash;\n\n            KConfig config(themeDir + \"\/index.theme\");\n            auto directoryPaths = config.group(\"Icon Theme\").readEntry(\"Directories\", QString()).split(\",\");\n            QVERIFY(!directoryPaths.isEmpty());\n            for (auto directoryPath : directoryPaths) {\n                auto dir = new Dir(config.group(directoryPath), themeDir);\n                contextHash[dir->context].append(dir);\n                contextStringHash[dir->context] = (dir->contextString);\n            }\n\n            QTest::addColumn<KIconLoader::Context>(\"context\");\n            QTest::addColumn<QList<Dir *>>(\"dirs\");\n\n            for (auto key : contextHash.keys()) {\n                if (key != KIconLoader::Application) {\n                    qDebug() << \"Only testing Application context for now.\";\n                    continue;\n                }\n                \/\/ FIXME: go through qenum to stringify the bugger\n                \/\/ Gets rid of the stupid second hash\n                auto contextId = QString(QLatin1String(dir) + \":\" + contextStringHash[key]).toLatin1();\n                QTest::newRow(contextId) << key << contextHash[key];\n            }\n        }\n    }\n\n    void test_scalable()\n    {\n        QFETCH(KIconLoader::Context, context);\n        QFETCH(QList<Dir *>, dirs);\n\n        QList<Dir *> fixedDirs;\n        QList<Dir *> scalableDirs;\n        for (auto dir : dirs) {\n            switch (dir->type) {\n            case KIconLoader::Scalable:\n                scalableDirs << dir;\n                break;\n            case KIconLoader::Fixed:\n                fixedDirs << dir;\n                break;\n            case KIconLoader::Threshold:\n                QVERIFY2(false, \"Test does not support threshold icons right now.\");\n            }\n        }\n\n        \/\/ FIXME: context should be translated through qenum\n        switch (context) {\n        case KIconLoader::Application:\n            \/\/ Treat this as a problem.\n            QVERIFY2(!scalableDirs.empty(), \"This icon context has no scalable directory at all!\");\n            break;\n        default:\n            qWarning() << \"All context but Application are whitelisted from having a scalable directory.\";\n            return;\n        }\n\n        QStringList fixedIcons;\n        for (auto dir : fixedDirs) {\n            for (auto iconInfo : dir->allIcons()) {\n                fixedIcons << iconInfo.completeBaseName();\n            }\n        }\n\n        QHash<QString, QList<QFileInfo>> scalableIcons;\n        for (auto dir : scalableDirs) {\n            for (auto iconInfo : dir->allIcons()) {\n                scalableIcons[iconInfo.completeBaseName()].append(iconInfo);\n            }\n        }\n\n        QStringList notScalableIcons;\n        for (auto fixed : fixedIcons) {\n            if (scalableIcons.keys().contains(fixed)) {\n                continue;\n            }\n            notScalableIcons << fixed;\n        }\n\n        \/\/ Assert that each icon has a scalable variant.\n        if (notScalableIcons.empty()) {\n            return;\n        }\n        QFAIL(QString(\"The following icons are not available in a scalable directory:\\n  %1\")\n              .arg(notScalableIcons.join(\"\\n  \"))\n              .toLatin1());\n    }\n\n    void test_scalableDuplicates_data()\n    {\n        test_scalable_data();\n    }\n\n    void test_scalableDuplicates()\n    {\n        QFETCH(QList<Dir *>, dirs);\n\n        QList<Dir *> scalableDirs;\n        for (auto dir : dirs) {\n            switch (dir->type) {\n            case KIconLoader::Scalable:\n                scalableDirs << dir;\n                break;\n            case KIconLoader::Fixed:\n                \/\/ Not of interest in this test.\n                break;\n            case KIconLoader::Threshold:\n                QVERIFY2(false, \"Test does not support threshold icons right now.\");\n            }\n        }\n\n        QHash<QString, QList<QFileInfo>> scalableIcons;\n        for (auto dir : scalableDirs) {\n            for (auto iconInfo : dir->allIcons()) {\n                scalableIcons[iconInfo.completeBaseName()].append(iconInfo);\n            }\n        }\n\n        QHash<QString, QList<QFileInfo>> duplicatedScalableIcons;\n        for (auto icon: scalableIcons.keys()) {\n            auto list = scalableIcons[icon];\n            if (list.size() > 1) {\n                duplicatedScalableIcons[icon] = list;\n            }\n        }\n\n        \/\/ Assert that there is only one scalable version per icon name.\n        \/\/ Otherwise apps\/32\/klipper.svg OR apps\/48\/klipper.svg may be used.\n        if (!duplicatedScalableIcons.empty()) {\n            QString msg;\n            QTextStream stream(&msg);\n            stream << \"Duplicated scalable icons:\" << endl;\n            for (auto icon : duplicatedScalableIcons.keys()) {\n                stream << QString(\"  %1:\").arg(icon) << endl;\n                for (auto info : duplicatedScalableIcons[icon]) {\n                    stream << QString(\"    %1\").arg(info.absoluteFilePath()) << endl;\n                }\n            }\n            QFAIL(msg.toLatin1());\n        }\n    }\n};\n\nQTEST_GUILESS_MAIN(ScalableTest)\n\n#include \"scalabletest.moc\"\n<commit_msg>remove duplicates from unscalable icons list<commit_after>\/*\n    Copyright 2017 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) version 3, or any\n    later version accepted by the membership of KDE e.V. (or its\n    successor approved by the membership of KDE e.V.), which shall\n    act as a proxy defined in Section 6 of version 3 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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <QObject>\n#include <QtTest>\n\n#include <KConfig>\n#include <KConfigGroup>\n#include <KIconLoader>\n\n#include \"testhelpers.h\"\n\n\/**\n * Represents icon directory to conduct simple icon lookup within.\n *\/\nclass Dir\n{\npublic:\n    Dir(const KConfigGroup &cg, const QString &themeDir_)\n        : exists(checkExist(cg))\n        , themeDir(themeDir_)\n        , path(cg.name())\n        , size(cg.readEntry(\"Size\", 0))\n        , contextString(cg.readEntry(\"Context\", QString()))\n        , context(parseContext(contextString))\n        , type(parseType(cg.readEntry(\"Type\", QString(\"Threshold\"))))\n    {\n        QVERIFY2(context != -1,\n                 QString(\"Don't know how to handle 'Context=%1' of config group '[%2]'\").arg(contextString, cg.name()).toLatin1());\n    }\n\n    static void verify(const KConfigGroup &cg)\n    {\n        QVERIFY2(cg.exists(),\n                 QString(\"The theme's 'Directories' specifies '%1' as directory which appears to\"\n                         \" have no associated group entry '[%1]'\").arg(cg.name()).toLatin1());\n    }\n\n    static bool checkExist(const KConfigGroup &cg)\n    {\n        verify(cg); \/\/ extra func since QVERIFY2 is a return\n        return cg.isValid();\n    }\n\n    static QMetaEnum findEnum(const char *name)\n    {\n        auto mo = KIconLoader::staticMetaObject;\n        for (int i = 0; i < mo.enumeratorCount(); ++i) {\n            auto enumerator = mo.enumerator(i);\n            if (strcmp(enumerator.name(), name) == 0) {\n                return KIconLoader::staticMetaObject.enumerator(i);\n            }\n        }\n        Q_ASSERT(false); \/\/ failed to resolve enum\n        return QMetaEnum();\n    }\n\n    static QMetaEnum typeEnum()\n    {\n        static auto e = findEnum(\"Type\");\n        return e;\n    }\n\n    KIconLoader::Context parseContext(const QString &string)\n    {\n        \/\/ Can't use QMetaEnum as the enum names are singular, the entry values are plural though.\n        static QHash<QString, int> hash {\n            { QStringLiteral(\"Actions\"), KIconLoader::Action },\n            { QStringLiteral(\"Applications\"), KIconLoader::Application },\n            { QStringLiteral(\"Categories\"), KIconLoader::Category },\n            { QStringLiteral(\"Devices\"), KIconLoader::Device },\n            { QStringLiteral(\"Emblems\"), KIconLoader::Emblem },\n            { QStringLiteral(\"Emotes\"), KIconLoader::Emote },\n            { QStringLiteral(\"MimeTypes\"), KIconLoader::MimeType },\n            { QStringLiteral(\"Places\"), KIconLoader::Place },\n            { QStringLiteral(\"Status\"), KIconLoader::StatusIcon },\n        };\n        auto value = hash.value(string, -1);\n        return (KIconLoader::Context)value;\n    }\n\n    KIconLoader::Type parseType(const QString &string)\n    {\n        bool ok;\n        auto v = (KIconLoader::Type)typeEnum().keyToValue(string.toLatin1(), &ok);\n        Q_ASSERT(ok);\n        return v;\n    }\n\n    \/**\n     * @returns list of all icon's fileinfo (first level only, selected types\n     *          only)\n     *\/\n    QList<QFileInfo> allIcons()\n    {\n        QList<QFileInfo> icons;\n        auto iconDir = QString(\"%1\/%2\").arg(themeDir).arg(path);\n        QDirIterator it(iconDir);\n        while (it.hasNext()) {\n            it.next();\n            auto suffix = it.fileInfo().suffix();\n            if (suffix != \"svg\" && suffix != \"svgz\" && suffix != \"png\") {\n                continue; \/\/ Probably not an icon.\n            }\n            icons << it.fileInfo();\n        }\n        return icons;\n    }\n\n    bool exists;\n    QString themeDir;\n    QString path;\n    uint size;\n    QString contextString;\n    KIconLoader::Context context;\n    KIconLoader::Type type;\n};\n\n\/\/ Declare so we can put them into the QTest data table.\nQ_DECLARE_METATYPE(KIconLoader::Context)\nQ_DECLARE_METATYPE(Dir*)\n\nclass ScalableTest : public QObject\n{\n    Q_OBJECT\n\nprivate Q_SLOTS:\n    \/\/ NB: test_scalable_data leaks Dir*. Should this test grow more slots it may be wise to\n    \/\/     introduce a cleanup() to make sure the test doesn't OOM.\n\n    void test_scalable_data()\n    {\n        for (auto dir : ICON_DIRS) {\n            auto themeDir = PROJECT_SOURCE_DIR + QStringLiteral(\"\/\") + dir;\n\n            QHash<KIconLoader::Context, QList<Dir *>> contextHash;\n            QHash<KIconLoader::Context, QString> contextStringHash;\n\n            KConfig config(themeDir + \"\/index.theme\");\n            auto directoryPaths = config.group(\"Icon Theme\").readEntry(\"Directories\", QString()).split(\",\");\n            QVERIFY(!directoryPaths.isEmpty());\n            for (auto directoryPath : directoryPaths) {\n                auto dir = new Dir(config.group(directoryPath), themeDir);\n                contextHash[dir->context].append(dir);\n                contextStringHash[dir->context] = (dir->contextString);\n            }\n\n            QTest::addColumn<KIconLoader::Context>(\"context\");\n            QTest::addColumn<QList<Dir *>>(\"dirs\");\n\n            for (auto key : contextHash.keys()) {\n                if (key != KIconLoader::Application) {\n                    qDebug() << \"Only testing Application context for now.\";\n                    continue;\n                }\n                \/\/ FIXME: go through qenum to stringify the bugger\n                \/\/ Gets rid of the stupid second hash\n                auto contextId = QString(QLatin1String(dir) + \":\" + contextStringHash[key]).toLatin1();\n                QTest::newRow(contextId) << key << contextHash[key];\n            }\n        }\n    }\n\n    void test_scalable()\n    {\n        QFETCH(KIconLoader::Context, context);\n        QFETCH(QList<Dir *>, dirs);\n\n        QList<Dir *> fixedDirs;\n        QList<Dir *> scalableDirs;\n        for (auto dir : dirs) {\n            switch (dir->type) {\n            case KIconLoader::Scalable:\n                scalableDirs << dir;\n                break;\n            case KIconLoader::Fixed:\n                fixedDirs << dir;\n                break;\n            case KIconLoader::Threshold:\n                QVERIFY2(false, \"Test does not support threshold icons right now.\");\n            }\n        }\n\n        \/\/ FIXME: context should be translated through qenum\n        switch (context) {\n        case KIconLoader::Application:\n            \/\/ Treat this as a problem.\n            QVERIFY2(!scalableDirs.empty(), \"This icon context has no scalable directory at all!\");\n            break;\n        default:\n            qWarning() << \"All context but Application are whitelisted from having a scalable directory.\";\n            return;\n        }\n\n        QStringList fixedIcons;\n        for (auto dir : fixedDirs) {\n            for (auto iconInfo : dir->allIcons()) {\n                fixedIcons << iconInfo.completeBaseName();\n            }\n        }\n\n        QHash<QString, QList<QFileInfo>> scalableIcons;\n        for (auto dir : scalableDirs) {\n            for (auto iconInfo : dir->allIcons()) {\n                scalableIcons[iconInfo.completeBaseName()].append(iconInfo);\n            }\n        }\n\n        QStringList notScalableIcons;\n        for (auto fixed : fixedIcons) {\n            if (scalableIcons.keys().contains(fixed)) {\n                continue;\n            }\n            notScalableIcons << fixed;\n        }\n\n        \/\/ Assert that each icon has a scalable variant.\n        if (notScalableIcons.empty()) {\n            return;\n        }\n        notScalableIcons.removeDuplicates();\n        QFAIL(QString(\"The following icons are not available in a scalable directory:\\n  %1\")\n              .arg(notScalableIcons.join(\"\\n  \"))\n              .toLatin1());\n    }\n\n    void test_scalableDuplicates_data()\n    {\n        test_scalable_data();\n    }\n\n    void test_scalableDuplicates()\n    {\n        QFETCH(QList<Dir *>, dirs);\n\n        QList<Dir *> scalableDirs;\n        for (auto dir : dirs) {\n            switch (dir->type) {\n            case KIconLoader::Scalable:\n                scalableDirs << dir;\n                break;\n            case KIconLoader::Fixed:\n                \/\/ Not of interest in this test.\n                break;\n            case KIconLoader::Threshold:\n                QVERIFY2(false, \"Test does not support threshold icons right now.\");\n            }\n        }\n\n        QHash<QString, QList<QFileInfo>> scalableIcons;\n        for (auto dir : scalableDirs) {\n            for (auto iconInfo : dir->allIcons()) {\n                scalableIcons[iconInfo.completeBaseName()].append(iconInfo);\n            }\n        }\n\n        QHash<QString, QList<QFileInfo>> duplicatedScalableIcons;\n        for (auto icon: scalableIcons.keys()) {\n            auto list = scalableIcons[icon];\n            if (list.size() > 1) {\n                duplicatedScalableIcons[icon] = list;\n            }\n        }\n\n        \/\/ Assert that there is only one scalable version per icon name.\n        \/\/ Otherwise apps\/32\/klipper.svg OR apps\/48\/klipper.svg may be used.\n        if (!duplicatedScalableIcons.empty()) {\n            QString msg;\n            QTextStream stream(&msg);\n            stream << \"Duplicated scalable icons:\" << endl;\n            for (auto icon : duplicatedScalableIcons.keys()) {\n                stream << QString(\"  %1:\").arg(icon) << endl;\n                for (auto info : duplicatedScalableIcons[icon]) {\n                    stream << QString(\"    %1\").arg(info.absoluteFilePath()) << endl;\n                }\n            }\n            QFAIL(msg.toLatin1());\n        }\n    }\n};\n\nQTEST_GUILESS_MAIN(ScalableTest)\n\n#include \"scalabletest.moc\"\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 math.hpp\n * \\date January 2015\n * \\author Jan Issac (jan.issac@gmail.com)\n * \\author Manuel Wuthrich (manuel.wuthrich@gmail.com)\n *\/\n\n#ifndef FL__UTIL__MATH_HPP\n#define FL__UTIL__MATH_HPP\n\n#include <Eigen\/Dense>\n\n#include <cmath>\n#include <vector>\n#include <random>\n\n#include <iostream>\n\nnamespace fl\n{\n\n\/**\n * Euler-Mascheroni Constant\n * \\ingroup math\n *\/\nstatic constexpr double GAMMA =\n        0.57721566490153286060651209008240243104215933593992;\n\n\/**\n * \\brief Sigmoid function\n * \\ingroup math\n *\/\nconstexpr double sigmoid(const double& x)\n{\n    return 1.0 \/ (1.0 + std::exp(-x));\n}\n\n\/**\n * \\brief log odd\n * \\ingroup math\n *\/\nconstexpr double logit(const double& x)\n{\n    return std::log(x \/ (1.0 - x));\n}\n\n\/**\n * \\ingroup math\n *\n * Normalizes the values of input vector such that their sum is equal to the\n * specified \\c sum. For instance, any convex combination requires that the\n * weights of the weighted sum sums up to 1.\n *\/\ntemplate <typename T>\ninline std::vector<T> normalize(const std::vector<T>& input, T sum)\n{\n    T old_sum = 0;\n    for(size_t i = 0; i < input.size(); i++)\n    {\n        old_sum += input[i];\n    }\n    T factor = sum\/old_sum;\n\n    std::vector<T> output(input.size());\n    for(size_t i = 0; i < input.size(); i++)\n    {\n        output[i] = factor*input[i];\n    }\n\n    return output;\n}\n\n\/**\n * \\brief Incomplete upper gamma function for positive \\c a and \\c z\n * \\ingroup math\n *\n * This is the unnormalized incomplete upper gamma function implementing the\n * continued fraction representation \\cite press2007numerical .\n *\n * \\f$ \\Gamma(a, z) = \\int\\limits^\\infty_z t^{a-1}e^{-t}dt \\f$\n *\n * \\return \\f$ \\Gamma(a, z) \\f$\n *\/\ninline double igamma(const double a, const double z)\n{        \n    static constexpr double EPS = std::numeric_limits<double>::epsilon();\n    static constexpr double FPMIN = std::numeric_limits<double>::min() \/ EPS;\n\n    if (z <= 0.) return std::numeric_limits<double>::quiet_NaN();\n\n    int i;\n    double an, b, c, d, del, h;\n\n    b = z + 1.0 - a;\n    c = 1.0 \/ FPMIN;\n    d = 1.0 \/ b;\n    h = d;\n\n    for (i = 1; ; i++)\n    {\n        an = -i * (i - a);\n        b += 2.0;\n        d = an * d + b;\n        if (std::fabs(d) < FPMIN) d = FPMIN;\n        c = b + an \/ c;\n        if (std::fabs(c) < FPMIN) c = FPMIN;\n        d = 1.0 \/ d;\n        del = d * c;\n        h *= del;\n\n        if (std::fabs(del - 1.0) <= EPS) break;\n    }\n\n    return std::exp(-z + a * std::log(z)) * h;\n}\n\n\/**\n * \\brief This is a deterministic exponential integral approximation\n *        \\cite barry2000approximation .\n * \\ingroup math\n *\n *\n * The exponential integral \\f$E_1(z)\\f$ is a special case of the upper\n * incomplete gamma function\n *\n * \\f$ \\Gamma(a, z) = \\int\\limits^\\infty_z t^{a-1}e^{-t}dt \\f$\n *\n * for \\f$a = 0\\f$ the gamma function is known as the exponential integral\n *\n * \\f$ \\Gamma(0, z) = \\int\\limits^\\infty_z t^{-1}e^{-t}dt = E_1(z)\\f$\n *\n * \\return \\f$E_1(z) = \\Gamma(0, z)\\f$\n * \\note For high accuracy please use igamma(0, z)\n *\/\ninline double exponential_integral(double z)\n{\n    if (z < 10.) return igamma(0., z);\n\n    static constexpr double G = std::exp(-fl::GAMMA);\n    static constexpr double b = std::sqrt((2. * (1.-G)) \/ (G * (2. - G)));\n    static constexpr double h_inf = ((1.-G) * (std::pow(G, 2.) - 6. * G + 12.))\n                                     \/ (3. * G * std::pow((2. - G), 2.) * b);\n\n    static constexpr double q_frac = 20. \/ 47.;\n    static constexpr double q_expx = std::sqrt(31. \/ 26.);\n\n    const double q = q_frac * std::pow(z, q_expx);\n    const double h = 1. \/ (1. + z * std::sqrt(z)) + (h_inf * q) \/ (1. + q);\n\n    double E1 = std::exp(-z) *\n                std::log(1. + G\/z - (1.-G) \/ std::pow(h + b*z, 2.));\n    E1 \/= (G + (1. - G) * std::exp(-z \/ (1. - G)));\n\n    return E1;\n}\n\n\/**\n * Inverse of the error function.\n * \\ingroup math\n *\n * \\tparam RealType Argument and result type\n *\n * \\return evaluates the erfinv at \\f$ x \\in (-1; 1) \\f$\n *\/\ntemplate <typename RealType> inline RealType erfinv(RealType x);\n\n\/**\n * Single precision implementation of erfinv according to\n * \\cite giles2010approximating\n * \\ingroup math\n *\n * \\return evaluates the erfinv at \\f$ x \\in (-1; 1) \\f$\n *\/\ntemplate <> inline float erfinv<float>(float x)\n{\n    float w, p;\n    w = - std::log((1.0f-x)*(1.0f+x));\n    if ( w < 5.000000f )\n    {\n        w = w - 2.500000f;\n        p =  2.81022636e-08f;\n        p =  3.43273939e-07f + p * w;\n        p =  -3.5233877e-06f + p * w;\n        p = -4.39150654e-06f + p * w;\n        p =   0.00021858087f + p * w;\n        p =  -0.00125372503f + p * w;\n        p =  -0.00417768164f + p * w;\n        p =     0.246640727f + p * w;\n        p =      1.50140941f + p * w;\n    }\n    else\n    {\n        w = std::sqrt(w) - 3.000000f;\n        p = -0.000200214257f;\n        p =  0.000100950558f + p * w;\n        p =   0.00134934322f + p * w;\n        p =  -0.00367342844f + p * w;\n        p =   0.00573950773f + p * w;\n        p =   -0.0076224613f + p * w;\n        p =   0.00943887047f + p * w;\n        p =      1.00167406f + p * w;\n        p =      2.83297682f + p * w;\n    }\n\n    return p*x;\n}\n\n\/**\n * Single precision implementation of erfinv according to\n * \\cite giles2010approximating\n *\n * \\ingroup math\n *\n * \\return evaluates the erfinv at \\f$ x \\in (-1; 1) \\f$\n *\/\ntemplate <> inline  double erfinv<double>(double x)\n{\n    double w, p;\n\n    w = - std::log((1.0-x)*(1.0+x));\n\n    if ( w < 6.250000 )\n    {\n        w = w - 3.125000;\n        p =  -3.6444120640178196996e-21;\n        p =   -1.685059138182016589e-19 + p * w;\n        p =   1.2858480715256400167e-18 + p * w;\n        p =    1.115787767802518096e-17 + p * w;\n        p =   -1.333171662854620906e-16 + p * w;\n        p =   2.0972767875968561637e-17 + p * w;\n        p =   6.6376381343583238325e-15 + p * w;\n        p =  -4.0545662729752068639e-14 + p * w;\n        p =  -8.1519341976054721522e-14 + p * w;\n        p =   2.6335093153082322977e-12 + p * w;\n        p =  -1.2975133253453532498e-11 + p * w;\n        p =  -5.4154120542946279317e-11 + p * w;\n        p =    1.051212273321532285e-09 + p * w;\n        p =  -4.1126339803469836976e-09 + p * w;\n        p =  -2.9070369957882005086e-08 + p * w;\n        p =   4.2347877827932403518e-07 + p * w;\n        p =  -1.3654692000834678645e-06 + p * w;\n        p =  -1.3882523362786468719e-05 + p * w;\n        p =    0.0001867342080340571352 + p * w;\n        p =  -0.00074070253416626697512 + p * w;\n        p =   -0.0060336708714301490533 + p * w;\n        p =      0.24015818242558961693 + p * w;\n        p =       1.6536545626831027356 + p * w;\n    }\n    else if ( w < 16.000000 )\n    {\n        w = std::sqrt(w) - 3.250000;\n        p =   2.2137376921775787049e-09;\n        p =   9.0756561938885390979e-08 + p * w;\n        p =  -2.7517406297064545428e-07 + p * w;\n        p =   1.8239629214389227755e-08 + p * w;\n        p =   1.5027403968909827627e-06 + p * w;\n        p =   -4.013867526981545969e-06 + p * w;\n        p =   2.9234449089955446044e-06 + p * w;\n        p =   1.2475304481671778723e-05 + p * w;\n        p =  -4.7318229009055733981e-05 + p * w;\n        p =   6.8284851459573175448e-05 + p * w;\n        p =   2.4031110387097893999e-05 + p * w;\n        p =   -0.0003550375203628474796 + p * w;\n        p =   0.00095328937973738049703 + p * w;\n        p =   -0.0016882755560235047313 + p * w;\n        p =    0.0024914420961078508066 + p * w;\n        p =   -0.0037512085075692412107 + p * w;\n        p =     0.005370914553590063617 + p * w;\n        p =       1.0052589676941592334 + p * w;\n        p =       3.0838856104922207635 + p * w;\n    }\n    else\n    {\n        w = std::sqrt(w) - 5.000000;\n        p =  -2.7109920616438573243e-11;\n        p =  -2.5556418169965252055e-10 + p * w;\n        p =   1.5076572693500548083e-09 + p * w;\n        p =  -3.7894654401267369937e-09 + p * w;\n        p =   7.6157012080783393804e-09 + p * w;\n        p =  -1.4960026627149240478e-08 + p * w;\n        p =   2.9147953450901080826e-08 + p * w;\n        p =  -6.7711997758452339498e-08 + p * w;\n        p =   2.2900482228026654717e-07 + p * w;\n        p =  -9.9298272942317002539e-07 + p * w;\n        p =   4.5260625972231537039e-06 + p * w;\n        p =  -1.9681778105531670567e-05 + p * w;\n        p =   7.5995277030017761139e-05 + p * w;\n        p =  -0.00021503011930044477347 + p * w;\n        p =  -0.00013871931833623122026 + p * w;\n        p =       1.0103004648645343977 + p * w;\n        p =       4.8499064014085844221 + p * w;\n    }\n\n    return p*x;\n}\n\n\n\/**\n * \\brief Constructs the QuaternionMatrix for the specified quaternion vetcor\n * \\ingroup math\n *\n * \\param q_xyzw  Quaternion vector\n *\n * \\return Matrix representation of the quaternion vector\n *\/\ninline Eigen::Matrix<double, 4, 3> QuaternionMatrix(\n        const Eigen::Matrix<double, 4, 1>& q_xyzw)\n{\n    Eigen::Matrix<double, 4, 3> Q;\n    Q <<\tq_xyzw(3), q_xyzw(2), -q_xyzw(1),\n            -q_xyzw(2), q_xyzw(3), q_xyzw(0),\n            q_xyzw(1), -q_xyzw(0), q_xyzw(3),\n            -q_xyzw(0), -q_xyzw(1), -q_xyzw(2);\n\n    return 0.5*Q;\n}\n\n}\n\n#endif\n<commit_msg>distributed all math function to the math sub categories within math\/<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 math.hpp\n * \\date January 2015\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__UTIL__MATH_HPP\n#define FL__UTIL__MATH_HPP\n\n#include \"math\/general_functions.hpp\"\n#include \"math\/special_functions.hpp\"\n#include \"math\/linear_algebra.hpp\"\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\/*!\n * \\file\n * \\brief Implementations of vector\/matrix scalar operations.\n *\/\n\n#pragma once\n\n\/\/Include the implementations\n#include \"etl\/impl\/std\/scalar_op.hpp\"\n#include \"etl\/impl\/blas\/scalar_op.hpp\"\n\nnamespace etl {\n\nnamespace detail {\n\n\/*!\n * \\brief Select the scalar implementation for an expression of type A\n *\n * The local context is not taken into account\n *\n * \\tparam A The type of expression\n * \\return The implementation to use\n *\/\ntemplate <typename A>\ncpp14_constexpr scalar_impl select_default_scalar_impl() {\n    if (all_floating<A>::value) {\n        if (is_cblas_enabled) {\n            return scalar_impl::BLAS;\n        } else {\n            return scalar_impl::STD;\n        }\n    }\n\n    return scalar_impl::STD;\n}\n\n\/*!\n * \\brief Select the scalar implementation for an expression of type A\n * \\tparam A The type of expression\n * \\return The implementation to use\n *\/\ntemplate <typename A>\nscalar_impl select_scalar_impl() {\n    if (local_context().scalar_selector.forced) {\n        auto forced = local_context().scalar_selector.impl;\n\n        switch (forced) {\n            \/\/BLAS cannot always be used\n            case scalar_impl::BLAS:\n                if (!is_cblas_enabled || !all_floating<A>::value) {\n                    std::cerr << \"Forced selection to BLAS scalar implementation, but not possible for this expression\" << std::endl;\n                    return select_default_scalar_impl<A>();\n                }\n\n                return forced;\n\n            \/\/In other cases, simply use the forced impl\n            default:\n                return forced;\n        }\n    }\n\n    return select_default_scalar_impl<A>();\n}\n\n\/*!\n * \\brief Functor to add a scalar to each element of an expression\n *\/\nstruct scalar_add {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        auto impl = select_scalar_impl<T>();\n\n        if (impl == scalar_impl::BLAS) {\n            return etl::impl::blas::scalar_add(lhs, rhs);\n        } else {\n            return etl::impl::standard::scalar_add(lhs, rhs);\n        }\n    }\n};\n\n\/*!\n * \\brief Functor to remove a scalar from each element of an expression\n *\/\nstruct scalar_sub {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        auto impl = select_scalar_impl<T>();\n\n        if (impl == scalar_impl::BLAS) {\n            return etl::impl::blas::scalar_sub(lhs, rhs);\n        } else {\n            return etl::impl::standard::scalar_sub(lhs, rhs);\n        }\n    }\n};\n\n\/*!\n * \\brief Functor to multiply each element of an expression by a scalar\n *\/\nstruct scalar_mul {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        auto impl = select_scalar_impl<T>();\n\n        if (impl == scalar_impl::BLAS) {\n            return etl::impl::blas::scalar_mul(lhs, rhs);\n        } else {\n            return etl::impl::standard::scalar_mul(lhs, rhs);\n        }\n    }\n};\n\n\/*!\n * \\brief Functor to divide each element of an expression by a scalar\n *\/\nstruct scalar_div {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        auto impl = select_scalar_impl<T>();\n\n        if (impl == scalar_impl::BLAS) {\n            return etl::impl::blas::scalar_div(lhs, rhs);\n        } else {\n            return etl::impl::standard::scalar_div(lhs, rhs);\n        }\n    }\n};\n\n\/*!\n * \\brief Functor to modulo each element of an expression by a scalar\n *\/\nstruct scalar_mod {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        etl::impl::standard::scalar_mod(lhs, rhs);\n    }\n};\n\n} \/\/end of namespace detail\n\n} \/\/end of namespace etl\n<commit_msg>Better selection<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\n * \\brief Implementations of vector\/matrix scalar operations.\n *\/\n\n#pragma once\n\n\/\/Include the implementations\n#include \"etl\/impl\/std\/scalar_op.hpp\"\n#include \"etl\/impl\/blas\/scalar_op.hpp\"\n\nnamespace etl {\n\nnamespace detail {\n\n\/*!\n * \\brief Select the scalar implementation for an expression of type A\n *\n * The local context is not taken into account\n *\n * \\tparam A The type of expression\n * \\return The implementation to use\n *\/\ntemplate <typename A, bool Simple>\ncpp14_constexpr scalar_impl select_default_scalar_impl() {\n    if (all_floating<A>::value) {\n        if (is_cblas_enabled && !Simple) {\n            return scalar_impl::BLAS;\n        } else {\n            return scalar_impl::STD;\n        }\n    }\n\n    return scalar_impl::STD;\n}\n\n\/*!\n * \\brief Select the scalar implementation for an expression of type A\n * \\tparam A The type of expression\n * \\return The implementation to use\n *\/\ntemplate <typename A, bool Simple>\nscalar_impl select_scalar_impl() {\n    if (local_context().scalar_selector.forced) {\n        auto forced = local_context().scalar_selector.impl;\n\n        switch (forced) {\n            \/\/BLAS cannot always be used\n            case scalar_impl::BLAS:\n                if (!is_cblas_enabled || !all_floating<A>::value) {\n                    std::cerr << \"Forced selection to BLAS scalar implementation, but not possible for this expression\" << std::endl;\n                    return select_default_scalar_impl<A, Simple>();\n                }\n\n                return forced;\n\n            \/\/In other cases, simply use the forced impl\n            default:\n                return forced;\n        }\n    }\n\n    return select_default_scalar_impl<A, Simple>();\n}\n\n\/*!\n * \\brief Functor to add a scalar to each element of an expression\n *\/\nstruct scalar_add {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        auto impl = select_scalar_impl<T, true>();\n\n        if (impl == scalar_impl::BLAS) {\n            return etl::impl::blas::scalar_add(lhs, rhs);\n        } else {\n            return etl::impl::standard::scalar_add(lhs, rhs);\n        }\n    }\n};\n\n\/*!\n * \\brief Functor to remove a scalar from each element of an expression\n *\/\nstruct scalar_sub {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        auto impl = select_scalar_impl<T, true>();\n\n        if (impl == scalar_impl::BLAS) {\n            return etl::impl::blas::scalar_sub(lhs, rhs);\n        } else {\n            return etl::impl::standard::scalar_sub(lhs, rhs);\n        }\n    }\n};\n\n\/*!\n * \\brief Functor to multiply each element of an expression by a scalar\n *\/\nstruct scalar_mul {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        auto impl = select_scalar_impl<T, false>();\n\n        if (impl == scalar_impl::BLAS) {\n            return etl::impl::blas::scalar_mul(lhs, rhs);\n        } else {\n            return etl::impl::standard::scalar_mul(lhs, rhs);\n        }\n    }\n};\n\n\/*!\n * \\brief Functor to divide each element of an expression by a scalar\n *\/\nstruct scalar_div {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        auto impl = select_scalar_impl<T, false>();\n\n        if (impl == scalar_impl::BLAS) {\n            return etl::impl::blas::scalar_div(lhs, rhs);\n        } else {\n            return etl::impl::standard::scalar_div(lhs, rhs);\n        }\n    }\n};\n\n\/*!\n * \\brief Functor to modulo each element of an expression by a scalar\n *\/\nstruct scalar_mod {\n    \/*!\n     * \\brief Apply the operation on the expression lhs and the scalar rhs\n     * \\param lhs The expression\n     * \\param rhs The scalar\n     *\/\n    template <typename T>\n    static void apply(T&& lhs, value_t<T> rhs) {\n        etl::impl::standard::scalar_mod(lhs, rhs);\n    }\n};\n\n} \/\/end of namespace detail\n\n} \/\/end of namespace etl\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#ifndef ETL_MULTIPLICATION_HPP\n#define ETL_MULTIPLICATION_HPP\n\n#include <algorithm>\n\nnamespace etl {\n\nnamespace detail {\n\ntemplate<typename A, typename B, typename C, cpp::disable_if_all_u<etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast> = cpp::detail::dummy>\nvoid check_mmul_sizes(const A& a, const B& b, C& c){\n    cpp_assert(\n            dim<1>(a) == dim<0>(b)          \/\/interior dimensions\n        &&  dim<0>(a) == dim<0>(c)          \/\/exterior dimension 1\n        &&  dim<1>(b) == dim<1>(c),         \/\/exterior dimension 2\n        \"Invalid sizes for multiplication\");\n    cpp_unused(a);\n    cpp_unused(b);\n    cpp_unused(c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast> = cpp::detail::dummy>\nvoid check_mmul_sizes(const A&, const B&, C&){\n    static_assert(\n            etl_traits<A>::template dim<1>() == etl_traits<B>::template dim<0>()          \/\/interior dimensions\n        &&  etl_traits<A>::template dim<0>() == etl_traits<C>::template dim<0>()          \/\/exterior dimension 1\n        &&  etl_traits<B>::template dim<1>() == etl_traits<C>::template dim<1>(),         \/\/exterior dimension 2\n        \"Invalid sizes for multiplication\");\n}\n\n} \/\/end of namespace detail\n\ntemplate<typename A, typename B, typename C>\nstatic C& mmul(const A& a, const B& b, C& c){\n    static_assert(is_etl_expr<A>::value && is_etl_expr<B>::value && is_etl_expr<C>::value, \"Matrix multiplication only supported for ETL expressions\");\n    static_assert(etl_traits<A>::dimensions() == 2 && etl_traits<B>::dimensions() == 2 && etl_traits<C>::dimensions() == 2, \"Matrix multiplication only works in 2D\");\n    detail::check_mmul_sizes(a,b,c);\n\n    c = 0;\n\n    for(std::size_t i = 0; i < rows(a); i++){\n        for(std::size_t j = 0; j < columns(b); j++){\n            for(std::size_t k = 0; k < columns(a); k++){\n                c(i,j) += a(i,k) * b(k,j);\n            }\n        }\n    }\n\n    return c;\n}\n\ninline std::size_t nextPowerOfTwo(std::size_t n) {\n    return std::pow(2, static_cast<std::size_t>(std::ceil(std::log2(n))));\n}\n\ntemplate<typename A, typename B, typename C>\nstatic void strassen_mmul_r(const A& a, const B& b, C& c){\n    using type = typename A::value_type;\n\n    auto n = dim<0>(a);\n\n    \/\/1x1 matrix mul\n    if (n == 1) {\n        c(0,0) = a(0,0) * b(0,0);\n    } else {\n        auto new_n = n \/ 2;\n\n        etl::dyn_matrix<type> a11(new_n, new_n);\n        etl::dyn_matrix<type> a12(new_n, new_n);\n        etl::dyn_matrix<type> a21(new_n, new_n);\n        etl::dyn_matrix<type> a22(new_n, new_n);\n\n        etl::dyn_matrix<type> b11(new_n, new_n);\n        etl::dyn_matrix<type> b12(new_n, new_n);\n        etl::dyn_matrix<type> b21(new_n, new_n);\n        etl::dyn_matrix<type> b22(new_n, new_n);\n\n        etl::dyn_matrix<type> p1(new_n, new_n);\n        etl::dyn_matrix<type> p2(new_n, new_n);\n        etl::dyn_matrix<type> p3(new_n, new_n);\n        etl::dyn_matrix<type> p4(new_n, new_n);\n        etl::dyn_matrix<type> p5(new_n, new_n);\n\n        for (std::size_t i = 0; i < new_n; i++) {\n            for (std::size_t j = 0; j < new_n; j++) {\n                a11(i,j) = a(i,j);\n                a12(i,j) = a(i,j + new_n);\n                a21(i,j) = a(i + new_n,j);\n                a22(i,j) = a(i + new_n,j + new_n);\n\n                b11(i,j) = b(i,j);\n                b12(i,j) = b(i,j + new_n);\n                b21(i,j) = b(i + new_n,j);\n                b22(i,j) = b(i + new_n,j + new_n);\n            }\n        }\n\n        strassen_mmul_r(a11 + a22, b11 + b22, p1);\n        strassen_mmul_r(a12 - a22, b21 + b22, p2);\n        strassen_mmul_r(a22, b21 - b11, p4);\n        strassen_mmul_r(a11 + a12, b22, p5);\n\n        auto c11 = p1 + p4 + p2 - p5;\n\n        for (std::size_t i = 0; i < new_n ; i++) {\n            for (std::size_t j = 0 ; j < new_n ; j++) {\n                c(i,j) = c11(i,j);\n            }\n        }\n\n        strassen_mmul_r(a11, b12 - b22, p3);\n\n        auto c12 = p3 + p5;\n\n        for (std::size_t i = 0; i < new_n ; i++) {\n            for (std::size_t j = 0 ; j < new_n ; j++) {\n                c(i,j + new_n) = c12(i,j);\n            }\n        }\n\n        strassen_mmul_r(a21 + a22, b11, p2);\n        strassen_mmul_r(a21 - a11, b11 + b12, p5);\n\n        auto c21 = p2 + p4;\n        auto c22 = p1 + p3 + p5 - p2;\n\n        for (std::size_t i = 0; i < new_n ; i++) {\n            for (std::size_t j = 0 ; j < new_n ; j++) {\n                c(i + new_n,j) = c21(i,j);\n                c(i + new_n,j + new_n) = c22(i,j);\n            }\n        }\n    }\n}\n\ntemplate<typename A, typename B, typename C>\nstatic C& strassen_mmul(const A& a, const B& b, C& c){\n    static_assert(is_etl_expr<A>::value && is_etl_expr<B>::value && is_etl_expr<C>::value, \"Matrix multiplication only supported for ETL expressions\");\n    static_assert(etl_traits<A>::dimensions() == 2 && etl_traits<B>::dimensions() == 2 && etl_traits<C>::dimensions() == 2, \"Matrix multiplication only works in 2D\");\n    detail::check_mmul_sizes(a,b,c);\n\n    c = 0;\n\n    \/\/For now, assume matrices are of size 2^nx2^n\n\n    auto n = std::max(dim<0>(a), std::max(dim<1>(a), dim<1>(b)));\n    auto m = nextPowerOfTwo(n);\n\n    if(dim<0>(a) == m && dim<0>(b) == m && dim<1>(a) == m && dim<1>(b) == m){\n        strassen_mmul_r(a, b, c);\n    } else {\n        using type = typename A::value_type;\n\n        etl::dyn_matrix<type> a_prep(m, m, static_cast<type>(0));\n        etl::dyn_matrix<type> b_prep(m, m, static_cast<type>(0));\n        etl::dyn_matrix<type> c_prep(m, m, static_cast<type>(0));\n\n        for(std::size_t i=0; i< dim<0>(a); i++) {\n            for (std::size_t j=0; j<dim<1>(a); j++) {\n                a_prep(i,j) = a(i,j);\n            }\n        }\n\n        for(std::size_t i=0; i< dim<0>(b); i++) {\n            for (std::size_t j=0; j<dim<1>(b); j++) {\n                b_prep(i,j) = b(i,j);\n            }\n        }\n\n        strassen_mmul_r(a_prep, b_prep, c_prep);\n\n        for(std::size_t i=0; i< dim<0>(c); i++) {\n            for (std::size_t j=0; j<dim<1>(c); j++) {\n                c(i,j) = c_prep(i,j);\n            }\n        }\n    }\n\n    return c;\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast,\n    etl_traits<A>::dimensions() == 1, etl_traits<B>::dimensions() == 2\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(reshape<1, etl_traits<B>::template dim<0>()>(a), b, c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast,\n    etl_traits<A>::dimensions() == 2, etl_traits<B>::dimensions() == 1\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(a, reshape<etl_traits<A>::template dim<1>(),1>(b), c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    cpp::or_u<!etl_traits<A>::is_fast, !etl_traits<B>::is_fast, !etl_traits<C>::is_fast>::value,\n    etl_traits<A>::dimensions() == 1, etl_traits<B>::dimensions() == 2,\n    cpp::not_u<etl_traits<A>::is_fast>::value\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(reshape(a, 1, dim<0>(b)), b, c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    cpp::or_u<!etl_traits<A>::is_fast, !etl_traits<B>::is_fast, !etl_traits<C>::is_fast>::value,\n    etl_traits<A>::dimensions() == 2, etl_traits<B>::dimensions() == 1,\n    cpp::not_u<etl_traits<B>::is_fast>::value\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(a, reshape(b, dim<1>(a), 1), c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    cpp::or_u<!etl_traits<A>::is_fast, !etl_traits<B>::is_fast, !etl_traits<C>::is_fast>::value,\n    etl_traits<A>::dimensions() == 1, etl_traits<B>::dimensions() == 2,\n    etl_traits<A>::is_fast\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(reshape<1, etl_traits<B>::template dim<0>()>(a), b, c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    cpp::or_u<!etl_traits<A>::is_fast, !etl_traits<B>::is_fast, !etl_traits<C>::is_fast>::value,\n    etl_traits<A>::dimensions() == 2, etl_traits<B>::dimensions() == 1,\n    etl_traits<B>::is_fast\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(a, reshape<etl_traits<A>::template dim<1>(),1>(b), c);\n}\n\n} \/\/end of namespace etl\n\n#endif\n<commit_msg>Do n==2 without allocations<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#ifndef ETL_MULTIPLICATION_HPP\n#define ETL_MULTIPLICATION_HPP\n\n#include <algorithm>\n\nnamespace etl {\n\nnamespace detail {\n\ntemplate<typename A, typename B, typename C, cpp::disable_if_all_u<etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast> = cpp::detail::dummy>\nvoid check_mmul_sizes(const A& a, const B& b, C& c){\n    cpp_assert(\n            dim<1>(a) == dim<0>(b)          \/\/interior dimensions\n        &&  dim<0>(a) == dim<0>(c)          \/\/exterior dimension 1\n        &&  dim<1>(b) == dim<1>(c),         \/\/exterior dimension 2\n        \"Invalid sizes for multiplication\");\n    cpp_unused(a);\n    cpp_unused(b);\n    cpp_unused(c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast> = cpp::detail::dummy>\nvoid check_mmul_sizes(const A&, const B&, C&){\n    static_assert(\n            etl_traits<A>::template dim<1>() == etl_traits<B>::template dim<0>()          \/\/interior dimensions\n        &&  etl_traits<A>::template dim<0>() == etl_traits<C>::template dim<0>()          \/\/exterior dimension 1\n        &&  etl_traits<B>::template dim<1>() == etl_traits<C>::template dim<1>(),         \/\/exterior dimension 2\n        \"Invalid sizes for multiplication\");\n}\n\n} \/\/end of namespace detail\n\ntemplate<typename A, typename B, typename C>\nstatic C& mmul(const A& a, const B& b, C& c){\n    static_assert(is_etl_expr<A>::value && is_etl_expr<B>::value && is_etl_expr<C>::value, \"Matrix multiplication only supported for ETL expressions\");\n    static_assert(etl_traits<A>::dimensions() == 2 && etl_traits<B>::dimensions() == 2 && etl_traits<C>::dimensions() == 2, \"Matrix multiplication only works in 2D\");\n    detail::check_mmul_sizes(a,b,c);\n\n    c = 0;\n\n    for(std::size_t i = 0; i < rows(a); i++){\n        for(std::size_t j = 0; j < columns(b); j++){\n            for(std::size_t k = 0; k < columns(a); k++){\n                c(i,j) += a(i,k) * b(k,j);\n            }\n        }\n    }\n\n    return c;\n}\n\ninline std::size_t nextPowerOfTwo(std::size_t n) {\n    return std::pow(2, static_cast<std::size_t>(std::ceil(std::log2(n))));\n}\n\ntemplate<typename A, typename B, typename C>\nstatic void strassen_mmul_r(const A& a, const B& b, C& c){\n    using type = typename A::value_type;\n\n    auto n = dim<0>(a);\n\n    \/\/1x1 matrix mul\n    if (n == 1) {\n        c(0,0) = a(0,0) * b(0,0);\n    } else if(n == 2){\n        auto a11 = a(0,0);\n        auto a12 = a(0,1);\n        auto a21 = a(1,0);\n        auto a22 = a(1,1);\n\n        auto b11 = b(0,0);\n        auto b12 = b(0,1);\n        auto b21 = b(1,0);\n        auto b22 = b(1,1);\n\n        auto p1 = (a11 + a22) * (b11 + b22);\n        auto p2 = (a12 - a22) * (b21 + b22);\n        auto p3 = a11 * (b12 - b22);\n        auto p4 = a22 * (b21 - b11);\n        auto p5 = (a11 + a12) * b22;\n        auto p6 = (a21 + a22) * b11;\n        auto p7 = (a21 - a11) * (b11 + b12);\n\n        c(0,0) = p1 + p4 + p2 - p5;\n        c(0,1) = p3 + p5;\n        c(1,0) = p6 + p4;\n        c(1,1) = p1 + p3 + p7 - p6;\n    } else {\n        auto new_n = n \/ 2;\n\n        etl::dyn_matrix<type> a11(new_n, new_n);\n        etl::dyn_matrix<type> a12(new_n, new_n);\n        etl::dyn_matrix<type> a21(new_n, new_n);\n        etl::dyn_matrix<type> a22(new_n, new_n);\n\n        etl::dyn_matrix<type> b11(new_n, new_n);\n        etl::dyn_matrix<type> b12(new_n, new_n);\n        etl::dyn_matrix<type> b21(new_n, new_n);\n        etl::dyn_matrix<type> b22(new_n, new_n);\n\n        etl::dyn_matrix<type> p1(new_n, new_n);\n        etl::dyn_matrix<type> p2(new_n, new_n);\n        etl::dyn_matrix<type> p3(new_n, new_n);\n        etl::dyn_matrix<type> p4(new_n, new_n);\n        etl::dyn_matrix<type> p5(new_n, new_n);\n\n        for (std::size_t i = 0; i < new_n; i++) {\n            for (std::size_t j = 0; j < new_n; j++) {\n                a11(i,j) = a(i,j);\n                a12(i,j) = a(i,j + new_n);\n                a21(i,j) = a(i + new_n,j);\n                a22(i,j) = a(i + new_n,j + new_n);\n\n                b11(i,j) = b(i,j);\n                b12(i,j) = b(i,j + new_n);\n                b21(i,j) = b(i + new_n,j);\n                b22(i,j) = b(i + new_n,j + new_n);\n            }\n        }\n\n        strassen_mmul_r(a11 + a22, b11 + b22, p1);\n        strassen_mmul_r(a12 - a22, b21 + b22, p2);\n        strassen_mmul_r(a22, b21 - b11, p4);\n        strassen_mmul_r(a11 + a12, b22, p5);\n\n        auto c11 = p1 + p4 + p2 - p5;\n\n        for (std::size_t i = 0; i < new_n ; i++) {\n            for (std::size_t j = 0 ; j < new_n ; j++) {\n                c(i,j) = c11(i,j);\n            }\n        }\n\n        strassen_mmul_r(a11, b12 - b22, p3);\n\n        auto c12 = p3 + p5;\n\n        for (std::size_t i = 0; i < new_n ; i++) {\n            for (std::size_t j = 0 ; j < new_n ; j++) {\n                c(i,j + new_n) = c12(i,j);\n            }\n        }\n\n        strassen_mmul_r(a21 + a22, b11, p2);\n        strassen_mmul_r(a21 - a11, b11 + b12, p5);\n\n        auto c21 = p2 + p4;\n        auto c22 = p1 + p3 + p5 - p2;\n\n        for (std::size_t i = 0; i < new_n ; i++) {\n            for (std::size_t j = 0 ; j < new_n ; j++) {\n                c(i + new_n,j) = c21(i,j);\n                c(i + new_n,j + new_n) = c22(i,j);\n            }\n        }\n    }\n}\n\ntemplate<typename A, typename B, typename C>\nstatic C& strassen_mmul(const A& a, const B& b, C& c){\n    static_assert(is_etl_expr<A>::value && is_etl_expr<B>::value && is_etl_expr<C>::value, \"Matrix multiplication only supported for ETL expressions\");\n    static_assert(etl_traits<A>::dimensions() == 2 && etl_traits<B>::dimensions() == 2 && etl_traits<C>::dimensions() == 2, \"Matrix multiplication only works in 2D\");\n    detail::check_mmul_sizes(a,b,c);\n\n    c = 0;\n\n    \/\/For now, assume matrices are of size 2^nx2^n\n\n    auto n = std::max(dim<0>(a), std::max(dim<1>(a), dim<1>(b)));\n    auto m = nextPowerOfTwo(n);\n\n    if(dim<0>(a) == m && dim<0>(b) == m && dim<1>(a) == m && dim<1>(b) == m){\n        strassen_mmul_r(a, b, c);\n    } else {\n        using type = typename A::value_type;\n\n        etl::dyn_matrix<type> a_prep(m, m, static_cast<type>(0));\n        etl::dyn_matrix<type> b_prep(m, m, static_cast<type>(0));\n        etl::dyn_matrix<type> c_prep(m, m, static_cast<type>(0));\n\n        for(std::size_t i=0; i< dim<0>(a); i++) {\n            for (std::size_t j=0; j<dim<1>(a); j++) {\n                a_prep(i,j) = a(i,j);\n            }\n        }\n\n        for(std::size_t i=0; i< dim<0>(b); i++) {\n            for (std::size_t j=0; j<dim<1>(b); j++) {\n                b_prep(i,j) = b(i,j);\n            }\n        }\n\n        strassen_mmul_r(a_prep, b_prep, c_prep);\n\n        for(std::size_t i=0; i< dim<0>(c); i++) {\n            for (std::size_t j=0; j<dim<1>(c); j++) {\n                c(i,j) = c_prep(i,j);\n            }\n        }\n    }\n\n    return c;\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast,\n    etl_traits<A>::dimensions() == 1, etl_traits<B>::dimensions() == 2\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(reshape<1, etl_traits<B>::template dim<0>()>(a), b, c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast,\n    etl_traits<A>::dimensions() == 2, etl_traits<B>::dimensions() == 1\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(a, reshape<etl_traits<A>::template dim<1>(),1>(b), c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    cpp::or_u<!etl_traits<A>::is_fast, !etl_traits<B>::is_fast, !etl_traits<C>::is_fast>::value,\n    etl_traits<A>::dimensions() == 1, etl_traits<B>::dimensions() == 2,\n    cpp::not_u<etl_traits<A>::is_fast>::value\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(reshape(a, 1, dim<0>(b)), b, c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    cpp::or_u<!etl_traits<A>::is_fast, !etl_traits<B>::is_fast, !etl_traits<C>::is_fast>::value,\n    etl_traits<A>::dimensions() == 2, etl_traits<B>::dimensions() == 1,\n    cpp::not_u<etl_traits<B>::is_fast>::value\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(a, reshape(b, dim<1>(a), 1), c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    cpp::or_u<!etl_traits<A>::is_fast, !etl_traits<B>::is_fast, !etl_traits<C>::is_fast>::value,\n    etl_traits<A>::dimensions() == 1, etl_traits<B>::dimensions() == 2,\n    etl_traits<A>::is_fast\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(reshape<1, etl_traits<B>::template dim<0>()>(a), b, c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<\n    cpp::or_u<!etl_traits<A>::is_fast, !etl_traits<B>::is_fast, !etl_traits<C>::is_fast>::value,\n    etl_traits<A>::dimensions() == 2, etl_traits<B>::dimensions() == 1,\n    etl_traits<B>::is_fast\n> = cpp::detail::dummy>\nstatic C& auto_vmmul(const A& a, const B& b, C& c){\n    return mmul(a, reshape<etl_traits<A>::template dim<1>(),1>(b), c);\n}\n\n} \/\/end of namespace etl\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2014 CNRS\n\/\/ Authors: Florent Lamiraux\n\/\/\n\/\/ This file is part of hpp-core\n\/\/ hpp-core 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 version\n\/\/ 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ hpp-core 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\/\/ General Lesser Public License for more details.  You should have\n\/\/ received a copy of the GNU Lesser General Public License along with\n\/\/ hpp-core  If not, see\n\/\/ <http:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef HPP_CORE_NODE_HH\n# define HPP_CORE_NODE_HH\n\n# include <hpp\/pinocchio\/fwd.hh>\n# include <hpp\/core\/fwd.hh>\n# include <hpp\/core\/config.hh>\n\nnamespace hpp {\n  namespace core {\n    \/\/\/ \\addtogroup roadmap\n    \/\/\/ \\{\n\n    \/\/\/ Node of a roadmap\n    \/\/\/\n    \/\/\/ Stores a configuration.\n    class HPP_CORE_DLLAPI Node {\n    public:\n      typedef std::list <EdgePtr_t> Edges_t;\n      \/\/\/ Constructor\n      \/\/\/ \\param configuration configuration stored in the new node\n      \/\/\/ \\note A new connected component is created. For consistency, the\n      \/\/\/       new node is not registered in the connected component.\n      Node (const ConfigurationPtr_t& configuration);\n      \/\/\/ Constructor\n      \/\/\/ \\param configuration configuration stored in the new node\n      \/\/\/ \\param connectedComponent connected component the node belongs to.\n      Node (const ConfigurationPtr_t& configuration,\n\t    ConnectedComponentPtr_t connectedComponent);\n      void addOutEdge (EdgePtr_t edge);\n      void addInEdge (EdgePtr_t edge);\n      \/\/\/ Store the connected component the node belongs to\n      void connectedComponent (const ConnectedComponentPtr_t& cc);\n      ConnectedComponentPtr_t connectedComponent () const;\n      \/\/\/ Access to outEdges\n      const Edges_t& outEdges () const;\n      \/\/\/ Access to inEdges\n      const Edges_t& inEdges () const;\n      \/\/\/ Check whether otherNode is an out-neighbor of this node.\n      \/\/\/ Node B is an out-neighbor of node A if node A has an outgoing edge\n      \/\/\/ going to B.\n      bool isOutNeighbor (const NodePtr_t& n) const;\n      \/\/\/ Check whether otherNode is an in-neighbor of this node.\n      \/\/\/ Node B is an in-neighbor of node A if node A has an ingoing edge\n      \/\/\/ going to B.\n      bool isInNeighbor (const NodePtr_t& n) const;\n\n      ConfigurationPtr_t configuration () const;\n      \/\/\/ Print node in a stream\n      std::ostream& print (std::ostream& os) const;\n    private:\n      ConfigurationPtr_t configuration_;\n      Edges_t outEdges_;\n      Edges_t inEdges_;\n      ConnectedComponentPtr_t connectedComponent_;\n    }; \/\/ class Node\n    std::ostream& operator<< (std::ostream& os, const Node& n);\n    \/\/\/ \\}\n  } \/\/   namespace core\n} \/\/ namespace hpp\n#endif \/\/ HPP_CORE_NODE_HH\n<commit_msg>Add virtual destructor to Node<commit_after>\/\/\n\/\/ Copyright (c) 2014 CNRS\n\/\/ Authors: Florent Lamiraux\n\/\/\n\/\/ This file is part of hpp-core\n\/\/ hpp-core 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 version\n\/\/ 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ hpp-core 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\/\/ General Lesser Public License for more details.  You should have\n\/\/ received a copy of the GNU Lesser General Public License along with\n\/\/ hpp-core  If not, see\n\/\/ <http:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef HPP_CORE_NODE_HH\n# define HPP_CORE_NODE_HH\n\n# include <hpp\/pinocchio\/fwd.hh>\n# include <hpp\/core\/fwd.hh>\n# include <hpp\/core\/config.hh>\n\nnamespace hpp {\n  namespace core {\n    \/\/\/ \\addtogroup roadmap\n    \/\/\/ \\{\n\n    \/\/\/ Node of a roadmap\n    \/\/\/\n    \/\/\/ Stores a configuration.\n    class HPP_CORE_DLLAPI Node {\n    public:\n      typedef std::list <EdgePtr_t> Edges_t;\n      \/\/\/ Constructor\n      \/\/\/ \\param configuration configuration stored in the new node\n      \/\/\/ \\note A new connected component is created. For consistency, the\n      \/\/\/       new node is not registered in the connected component.\n      Node (const ConfigurationPtr_t& configuration);\n      \/\/\/ Constructor\n      \/\/\/ \\param configuration configuration stored in the new node\n      \/\/\/ \\param connectedComponent connected component the node belongs to.\n      Node (const ConfigurationPtr_t& configuration,\n\t    ConnectedComponentPtr_t connectedComponent);\n      void addOutEdge (EdgePtr_t edge);\n      void addInEdge (EdgePtr_t edge);\n      \/\/\/ Store the connected component the node belongs to\n      void connectedComponent (const ConnectedComponentPtr_t& cc);\n      ConnectedComponentPtr_t connectedComponent () const;\n      \/\/\/ Access to outEdges\n      const Edges_t& outEdges () const;\n      \/\/\/ Access to inEdges\n      const Edges_t& inEdges () const;\n      \/\/\/ Check whether otherNode is an out-neighbor of this node.\n      \/\/\/ Node B is an out-neighbor of node A if node A has an outgoing edge\n      \/\/\/ going to B.\n      bool isOutNeighbor (const NodePtr_t& n) const;\n      \/\/\/ Check whether otherNode is an in-neighbor of this node.\n      \/\/\/ Node B is an in-neighbor of node A if node A has an ingoing edge\n      \/\/\/ going to B.\n      bool isInNeighbor (const NodePtr_t& n) const;\n\n      ConfigurationPtr_t configuration () const;\n      \/\/\/ Print node in a stream\n      std::ostream& print (std::ostream& os) const;\n\n      virtual ~Node () {};\n    private:\n      ConfigurationPtr_t configuration_;\n      Edges_t outEdges_;\n      Edges_t inEdges_;\n      ConnectedComponentPtr_t connectedComponent_;\n    }; \/\/ class Node\n    std::ostream& operator<< (std::ostream& os, const Node& n);\n    \/\/\/ \\}\n  } \/\/   namespace core\n} \/\/ namespace hpp\n#endif \/\/ HPP_CORE_NODE_HH\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- RustWrapper.cpp - Rust wrapper for core functions --------*- 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 alternate interfaces to core functions that are more\n\/\/ readily callable by Rust's FFI.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Linker.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/ADT\/Triple.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Support\/Timer.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Support\/Host.h\"\n#include \"llvm-c\/Core.h\"\n#include \"llvm-c\/BitReader.h\"\n#include \"llvm-c\/Object.h\"\n#include <cstdlib>\n\nusing namespace llvm;\n\nstatic const char *LLVMRustError;\n\nextern \"C\" LLVMMemoryBufferRef\nLLVMRustCreateMemoryBufferWithContentsOfFile(const char *Path) {\n  LLVMMemoryBufferRef MemBuf = NULL;\n  LLVMCreateMemoryBufferWithContentsOfFile(Path, &MemBuf,\n    const_cast<char **>(&LLVMRustError));\n  return MemBuf;\n}\n\nextern \"C\" const char *LLVMRustGetLastError(void) {\n  return LLVMRustError;\n}\n\nextern \"C\" void LLVMAddBasicAliasAnalysisPass(LLVMPassManagerRef PM);\n\nextern \"C\" bool LLVMLinkModules(LLVMModuleRef Dest, LLVMModuleRef Src) {\n  static std::string err;\n\n  \/\/ For some strange reason, unwrap() doesn't work here. \"No matching\n  \/\/ function\" error.\n  Module *DM = reinterpret_cast<Module *>(Dest);\n  Module *SM = reinterpret_cast<Module *>(Src);\n  if (Linker::LinkModules(DM, SM, &err)) {\n    LLVMRustError = err.c_str();\n    return false;\n  }\n  return true;\n}\n\nextern \"C\" void LLVMRustWriteOutputFile(LLVMPassManagerRef PMR,\n                                        LLVMModuleRef M,\n                                        const char *triple,\n                                        const char *path,\n                                        TargetMachine::CodeGenFileType FileType,\n                                        CodeGenOpt::Level OptLevel) {\n\n  \/\/ Set compilation options.\n  llvm::NoFramePointerElim = true;\n\n  InitializeAllTargets();\n  InitializeAllTargetMCs();\n  InitializeAllAsmPrinters();\n  InitializeAllAsmParsers();\n  std::string Err;\n  const Target *TheTarget = TargetRegistry::lookupTarget(triple, Err);\n  std::string FeaturesStr;\n  std::string Trip(triple);\n  std::string CPUStr = llvm::sys::getHostCPUName();\n  TargetMachine *Target =\n    TheTarget->createTargetMachine(Trip, CPUStr, FeaturesStr, Reloc::PIC_);\n  bool NoVerify = false;\n  PassManager *PM = unwrap<PassManager>(PMR);\n  std::string ErrorInfo;\n  raw_fd_ostream OS(path, ErrorInfo,\n                    raw_fd_ostream::F_Binary);\n  formatted_raw_ostream FOS(OS);\n\n  bool foo = Target->addPassesToEmitFile(*PM, FOS, FileType, OptLevel,\n                                         NoVerify);\n  assert(!foo);\n  (void)foo;\n  PM->run(*unwrap(M));\n  delete Target;\n}\n\nextern \"C\" LLVMModuleRef LLVMRustParseBitcode(LLVMMemoryBufferRef MemBuf) {\n  LLVMModuleRef M;\n  return LLVMParseBitcode(MemBuf, &M, const_cast<char **>(&LLVMRustError))\n         ? NULL : M;\n}\n\nextern \"C\" const char *LLVMRustGetHostTriple(void)\n{\n  static std::string str = llvm::sys::getHostTriple();\n  return str.c_str();\n}\n\nextern \"C\" LLVMValueRef LLVMRustConstSmallInt(LLVMTypeRef IntTy, unsigned N,\n                                              LLVMBool SignExtend) {\n  return LLVMConstInt(IntTy, (unsigned long long)N, SignExtend);\n}\n\nextern bool llvm::TimePassesIsEnabled;\nextern \"C\" void LLVMRustEnableTimePasses() {\n  TimePassesIsEnabled = true;\n}\n\nextern \"C\" void LLVMRustPrintPassTimings() {\n  raw_fd_ostream OS (2, false); \/\/ stderr.\n  TimerGroup::printAll(OS);\n}\n<commit_msg>Update LinkModules invocation to use new prototype<commit_after>\/\/===- RustWrapper.cpp - Rust wrapper for core functions --------*- 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 alternate interfaces to core functions that are more\n\/\/ readily callable by Rust's FFI.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Linker.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/ADT\/Triple.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Support\/Timer.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Support\/Host.h\"\n#include \"llvm-c\/Core.h\"\n#include \"llvm-c\/BitReader.h\"\n#include \"llvm-c\/Object.h\"\n#include <cstdlib>\n\nusing namespace llvm;\n\nstatic const char *LLVMRustError;\n\nextern \"C\" LLVMMemoryBufferRef\nLLVMRustCreateMemoryBufferWithContentsOfFile(const char *Path) {\n  LLVMMemoryBufferRef MemBuf = NULL;\n  LLVMCreateMemoryBufferWithContentsOfFile(Path, &MemBuf,\n    const_cast<char **>(&LLVMRustError));\n  return MemBuf;\n}\n\nextern \"C\" const char *LLVMRustGetLastError(void) {\n  return LLVMRustError;\n}\n\nextern \"C\" void LLVMAddBasicAliasAnalysisPass(LLVMPassManagerRef PM);\n\nextern \"C\" bool LLVMLinkModules(LLVMModuleRef Dest, LLVMModuleRef Src) {\n  static std::string err;\n\n  \/\/ For some strange reason, unwrap() doesn't work here. \"No matching\n  \/\/ function\" error.\n  Module *DM = reinterpret_cast<Module *>(Dest);\n  Module *SM = reinterpret_cast<Module *>(Src);\n  if (Linker::LinkModules(DM, SM, Linker::DestroySource, &err)) {\n    LLVMRustError = err.c_str();\n    return false;\n  }\n  return true;\n}\n\nextern \"C\" void LLVMRustWriteOutputFile(LLVMPassManagerRef PMR,\n                                        LLVMModuleRef M,\n                                        const char *triple,\n                                        const char *path,\n                                        TargetMachine::CodeGenFileType FileType,\n                                        CodeGenOpt::Level OptLevel) {\n\n  \/\/ Set compilation options.\n  llvm::NoFramePointerElim = true;\n\n  InitializeAllTargets();\n  InitializeAllTargetMCs();\n  InitializeAllAsmPrinters();\n  InitializeAllAsmParsers();\n  std::string Err;\n  const Target *TheTarget = TargetRegistry::lookupTarget(triple, Err);\n  std::string FeaturesStr;\n  std::string Trip(triple);\n  std::string CPUStr = llvm::sys::getHostCPUName();\n  TargetMachine *Target =\n    TheTarget->createTargetMachine(Trip, CPUStr, FeaturesStr, Reloc::PIC_);\n  bool NoVerify = false;\n  PassManager *PM = unwrap<PassManager>(PMR);\n  std::string ErrorInfo;\n  raw_fd_ostream OS(path, ErrorInfo,\n                    raw_fd_ostream::F_Binary);\n  formatted_raw_ostream FOS(OS);\n\n  bool foo = Target->addPassesToEmitFile(*PM, FOS, FileType, OptLevel,\n                                         NoVerify);\n  assert(!foo);\n  (void)foo;\n  PM->run(*unwrap(M));\n  delete Target;\n}\n\nextern \"C\" LLVMModuleRef LLVMRustParseBitcode(LLVMMemoryBufferRef MemBuf) {\n  LLVMModuleRef M;\n  return LLVMParseBitcode(MemBuf, &M, const_cast<char **>(&LLVMRustError))\n         ? NULL : M;\n}\n\nextern \"C\" const char *LLVMRustGetHostTriple(void)\n{\n  static std::string str = llvm::sys::getHostTriple();\n  return str.c_str();\n}\n\nextern \"C\" LLVMValueRef LLVMRustConstSmallInt(LLVMTypeRef IntTy, unsigned N,\n                                              LLVMBool SignExtend) {\n  return LLVMConstInt(IntTy, (unsigned long long)N, SignExtend);\n}\n\nextern bool llvm::TimePassesIsEnabled;\nextern \"C\" void LLVMRustEnableTimePasses() {\n  TimePassesIsEnabled = true;\n}\n\nextern \"C\" void LLVMRustPrintPassTimings() {\n  raw_fd_ostream OS (2, false); \/\/ stderr.\n  TimerGroup::printAll(OS);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2008-2010, Gostai S.A.S.\n *\n * This software is provided \"as is\" without warranty of any kind,\n * either expressed or implied, including but not limited to the\n * implied warranties of fitness for a particular purpose.\n *\n * See the LICENSE file for more information.\n *\/\n\n#ifndef LIBPORT_UTIME_HH\n# define LIBPORT_UTIME_HH\n\n# include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n# include <libport\/export.hh>\n# include <libport\/sys\/time.h>\n# include <libport\/ufloat.hh>\n\nnamespace libport\n{\n  \/\/\/ Microseconds.\n  typedef long long utime_t;\n\n  \/\/\/ Convert from seconds to utime_t.\n  template <typename Unit>\n  utime_t seconds_to_utime(Unit seconds);\n\n  \/\/\/ From timeval to utime.\n  utime_t timeval_to_utime(const timeval& t);\n\n  \/\/\/ Return elapsed time from an arbitrary basis in microseconds.\n  LIBPORT_API utime_t utime();\n\n  \/\/\/ Return the arbitrary basis\n  LIBPORT_API const boost::posix_time::ptime& utime_reference();\n\n  \/\/\/ Set the arbitrary basis\n  void utime_reference_set(const boost::posix_time::ptime& ref);\n\n  \/\/\/ Convert from microseconds to timeval.\n  timeval utime_to_timeval(utime_t t);\n\n}\n\n# include <libport\/utime.hxx>\n\n#endif \/\/ !LIBPORT_UTIME_HH\n<commit_msg>Put libport::utime_reference_set in the API.<commit_after>\/*\n * Copyright (C) 2008-2010, Gostai S.A.S.\n *\n * This software is provided \"as is\" without warranty of any kind,\n * either expressed or implied, including but not limited to the\n * implied warranties of fitness for a particular purpose.\n *\n * See the LICENSE file for more information.\n *\/\n\n#ifndef LIBPORT_UTIME_HH\n# define LIBPORT_UTIME_HH\n\n# include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n# include <libport\/export.hh>\n# include <libport\/sys\/time.h>\n# include <libport\/ufloat.hh>\n\nnamespace libport\n{\n  \/\/\/ Microseconds.\n  typedef long long utime_t;\n\n  \/\/\/ Convert from seconds to utime_t.\n  template <typename Unit>\n  utime_t seconds_to_utime(Unit seconds);\n\n  \/\/\/ From timeval to utime.\n  utime_t timeval_to_utime(const timeval& t);\n\n  \/\/\/ Return elapsed time from an arbitrary basis in microseconds.\n  LIBPORT_API utime_t utime();\n\n  \/\/\/ Return the arbitrary basis\n  LIBPORT_API const boost::posix_time::ptime& utime_reference();\n\n  \/\/\/ Set the arbitrary basis\n  LIBPORT_API void utime_reference_set(const boost::posix_time::ptime& ref);\n\n  \/\/\/ Convert from microseconds to timeval.\n  timeval utime_to_timeval(utime_t t);\n\n}\n\n# include <libport\/utime.hxx>\n\n#endif \/\/ !LIBPORT_UTIME_HH\n<|endoftext|>"}
{"text":"<commit_before>\/**\n ** \\file libport\/containers.hxx\n ** \\brief Some syntactic sugar to look for things in STL containers.\n *\/\n\n#ifndef LIBPORT_CONTAINERS_HXX\n# define LIBPORT_CONTAINERS_HXX\n\n# include <ostream>\n# include <algorithm>\n# include <functional>\n\n# include \"libport\/containers.hh\"\n\nnamespace libport\n{\n\n  \/\/ Object function to free members of a container.\n  template<typename T>\n  struct Delete : public std::unary_function<T, void>\n  {\n    void operator () (T t)\n    {\n      delete t;\n    }\n  };\n\n\n  template<typename Container>\n  void\n  deep_clear (Container& c)\n  {\n    std::for_each (c.begin (), c.end (),\n\t\t   Delete<typename Container::value_type> ());\n    c.clear ();\n  }\n\n\n  \/\/ Find \\a v in the whole \\a c.\n  template<typename Container>\n  inline typename Container::const_iterator\n  find (const Container& c, const typename Container::value_type& v)\n  {\n    return std::find (c.begin (), c.end (), v);\n  }\n\n  \/\/ Find \\a v in the whole \\a c.\n  template<typename Container>\n  inline typename Container::iterator\n  find (Container& c, const typename Container::value_type& v)\n  {\n    return std::find (c.begin (), c.end (), v);\n  }\n\n\n  template<typename Container>\n  inline typename Container::mapped_type\n  find0 (Container& c, const typename Container::key_type& k)\n  {\n    typename Container::const_iterator i = c.find(k);\n    if (i != c.end())\n      return i->second;\n    else\n      return 0;\n  }\n\n\n  \/\/ Apply \\a f to all the members of \\a c, and return it.\n  template<typename Container, typename Functor>\n  inline Functor&\n  for_each (Container& c, Functor& f)\n  {\n    for (typename Container::const_iterator i = c.begin (), end = c.end();\n\t i != end; ++i)\n      f (*i);\n    return f;\n  }\n\n\n  \/\/ Is \\a v member of \\a c?\n  template<typename Container>\n  inline bool\n  has (const Container& c, const typename Container::value_type& v)\n  {\n    \/\/ We specify the instance to solve a conflict between the\n    \/\/ two finds above, that compete against each other because\n    \/\/ the parameter Container can embed a \"const\".\n    return find<Container> (c, v) != c.end ();\n  }\n\n\n  \/\/ Is \\a v member of \\a c?\n  template<typename Container>\n  inline bool\n  mhas (const Container& c, const typename Container::key_type& v)\n  {\n    return c.find(v) != c.end ();\n  }\n\n\n  template<typename Map>\n  typename Map::iterator\n  put (Map& map,\n       const typename Map::key_type& key,\n       const typename Map::mapped_type& value)\n  {\n    \/\/ See ``Efficient STL''.\n    typename Map::iterator i = map.lower_bound (key);\n\n    if (i != map.end () && !(map.key_comp () (key, i->first)))\n      {\n\t\/\/ Update.\n\ti->second = value;\n\treturn i;\n      }\n    else\n      {\n\t\/\/ First insertion.\n\ttypedef typename Map::value_type mvt;\n\treturn map.insert (mvt (key, value)).first;\n      }\n  }\n\n} \/\/ namespace libport\n\n#endif \/\/ !LIBPORT_CONTAINERS_HXX\n<commit_msg>Useless parens removal.<commit_after>\/**\n ** \\file libport\/containers.hxx\n ** \\brief Some syntactic sugar to look for things in STL containers.\n *\/\n\n#ifndef LIBPORT_CONTAINERS_HXX\n# define LIBPORT_CONTAINERS_HXX\n\n# include <ostream>\n# include <algorithm>\n# include <functional>\n\n# include \"libport\/containers.hh\"\n\nnamespace libport\n{\n\n  \/\/ Object function to free members of a container.\n  template<typename T>\n  struct Delete : public std::unary_function<T, void>\n  {\n    void operator () (T t)\n    {\n      delete t;\n    }\n  };\n\n\n  template<typename Container>\n  void\n  deep_clear (Container& c)\n  {\n    std::for_each (c.begin (), c.end (),\n\t\t   Delete<typename Container::value_type> ());\n    c.clear ();\n  }\n\n\n  \/\/ Find \\a v in the whole \\a c.\n  template<typename Container>\n  inline typename Container::const_iterator\n  find (const Container& c, const typename Container::value_type& v)\n  {\n    return std::find (c.begin (), c.end (), v);\n  }\n\n  \/\/ Find \\a v in the whole \\a c.\n  template<typename Container>\n  inline typename Container::iterator\n  find (Container& c, const typename Container::value_type& v)\n  {\n    return std::find (c.begin (), c.end (), v);\n  }\n\n\n  template<typename Container>\n  inline typename Container::mapped_type\n  find0 (Container& c, const typename Container::key_type& k)\n  {\n    typename Container::const_iterator i = c.find(k);\n    if (i != c.end())\n      return i->second;\n    else\n      return 0;\n  }\n\n\n  \/\/ Apply \\a f to all the members of \\a c, and return it.\n  template<typename Container, typename Functor>\n  inline Functor&\n  for_each (Container& c, Functor& f)\n  {\n    for (typename Container::const_iterator i = c.begin (), end = c.end();\n\t i != end; ++i)\n      f (*i);\n    return f;\n  }\n\n\n  \/\/ Is \\a v member of \\a c?\n  template<typename Container>\n  inline bool\n  has (const Container& c, const typename Container::value_type& v)\n  {\n    \/\/ We specify the instance to solve a conflict between the\n    \/\/ two finds above, that compete against each other because\n    \/\/ the parameter Container can embed a \"const\".\n    return find<Container> (c, v) != c.end ();\n  }\n\n\n  \/\/ Is \\a v member of \\a c?\n  template<typename Container>\n  inline bool\n  mhas (const Container& c, const typename Container::key_type& v)\n  {\n    return c.find(v) != c.end ();\n  }\n\n\n  template<typename Map>\n  typename Map::iterator\n  put (Map& map,\n       const typename Map::key_type& key,\n       const typename Map::mapped_type& value)\n  {\n    \/\/ See ``Efficient STL''.\n    typename Map::iterator i = map.lower_bound (key);\n\n    if (i != map.end () && !map.key_comp () (key, i->first))\n      {\n\t\/\/ Update.\n\ti->second = value;\n\treturn i;\n      }\n    else\n      {\n\t\/\/ First insertion.\n\ttypedef typename Map::value_type mvt;\n\treturn map.insert (mvt (key, value)).first;\n      }\n  }\n\n} \/\/ namespace libport\n\n#endif \/\/ !LIBPORT_CONTAINERS_HXX\n<|endoftext|>"}
{"text":"<commit_before>\/*\nAn integer M and a non-empty zero-indexed array A consisting of N non-negative integers are given. All integers in array A are less than or equal to M.\nA pair of integers (P, Q), such that 0 ≤ P ≤ Q < N, is called a slice of array A. The slice consists of the elements A[P], A[P + 1], ..., A[Q]. A distinct slice is a slice consisting of only unique numbers. That is, no individual number occurs more than once in the slice.\nFor example, consider integer M = 6 and array A such that:\n    A[0] = 3\n    A[1] = 4\n    A[2] = 5\n    A[3] = 5\n    A[4] = 2\nThere are exactly nine distinct slices: (0, 0), (0, 1), (0, 2), (1, 1), (1, 2), (2, 2), (3, 3), (3, 4) and (4, 4).\nThe goal is to calculate the number of distinct slices.\nWrite a function:\nint solution(int M, vector<int> &A);\nthat, given an integer M and a non-empty zero-indexed array A consisting of N integers, returns the number of distinct slices.\nIf the number of distinct slices is greater than 1,000,000,000, the function should return 1,000,000,000.\nFor example, given integer M = 6 and array A such that:\n    A[0] = 3\n    A[1] = 4\n    A[2] = 5\n    A[3] = 5\n    A[4] = 2\nthe function should return 9, as explained above.\nAssume that:\nN is an integer within the range [1..100,000];\nM is an integer within the range [0..100,000];\neach element of array A is an integer within the range [0..M].\nComplexity:\nexpected worst-case time complexity is O(N);\nexpected worst-case space complexity is O(M), beyond input storage (not counting the storage required for input arguments).\nElements of input arrays can be modified.\nCopyright 2009–2015 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.\n*\/\n<commit_msg>Update solution.cpp<commit_after>\/\/ you can use includes, for example:\n\/\/ #include <algorithm>\n#include <bitset>\n\n\/\/ you can write to stdout for debugging purposes, e.g.\n\/\/ cout << \"this is a debug message\" << endl;\n\nint solution(int M, vector<int> &A) {\n    \/\/ for(unsigned int i=0; i<A.size(); ++i)\n        \/\/ cout << A[i] << \" \";\n    \/\/ cout << endl;\n    \/\/ write your code in C++11\n    int i(0);\n    int j(0);\n    long count(0);\n    bitset<100000> mybitset;\n    while( i<A.size() ) {\n        \/\/ cout << i << \" \" << j << \" \";\n        if( j<A.size() ) {\n            if( mybitset[A[j]]==0 ) {\n                mybitset[A[j]]= 1;\n                count++;\n                j++;\n            }\n            else {\n                mybitset.reset();\n                i++;\n                j=i;\n            }\n        }\n        else {\n            count += (j-i)*(j-i-1)\/2;\n            i=j;\n        }\n        if( count>1000000000 )\n            return 1000000000;\n        \/\/ cout << count << endl;\n    }\n    return count;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2011.  All rights reserved\n *\/\n#include\t\"..\/StroikaPreComp.h\"\n\n#include\t<algorithm>\n#include\t<cstdlib>\n\n#include\t\"..\/..\/Foundation\/Characters\/Format.h\"\n#include\t\"..\/..\/Foundation\/Containers\/Common.h\"\n#include\t\"..\/..\/Foundation\/DataExchangeFormat\/BadFormatException.h\"\n#include\t\"..\/..\/Foundation\/Debug\/Assertions.h\"\n#include\t\"..\/..\/Foundation\/Execution\/Exceptions.h\"\n#include\t\"..\/..\/Foundation\/Memory\/SmallStackBuffer.h\"\n\n#include\t\"HTTPResponse.h\"\n\n\nusing\tnamespace\tStroika::Foundation;\nusing\tnamespace\tStroika::Foundation::Containers;\nusing\tnamespace\tStroika::Foundation::Memory;\n\nusing\tnamespace\tStroika::Frameworks;\nusing\tnamespace\tStroika::Frameworks::WebServer;\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************ WebServer::HTTPResponse *******************************\n ********************************************************************************\n *\/\nnamespace\t{\n\t\/\/ Based on looking at a handlful of typical file sizes...5k to 80k, but ave around\n\t\/\/ 25 and median abit above 32k. Small, not very representative sampling. And the more we use\n\t\/\/ subscripts (script src=x) this number could shrink.\n\t\/\/\n\t\/\/ MAY want to switch to using SmallStackBuffer<Byte> - but before doing so, do some cleanups of its bugs and make sure\n\t\/\/ its optimized about how much it copies etc. Its really only tuned for POD-types (OK here but not necessarily good about reallocs).\n\t\/\/\n\t\/\/\t\t-- LGP 2011-07-06\n\tconst\tsize_t\tkMinResponseBufferReserve_\t\t\t\t=\t32 * 1024;\n\tconst\tsize_t\tkResponseBufferReallocChunkSizeReserve_\t=\t16 * 1024;\n}\n\nHTTPResponse::HTTPResponse (const IO::Network::Socket& s,  Streams::BinaryOutputStream& outStream, const InternetMediaType& ct)\n\t: fSocket_ (s)\n\t, fOutStream_ (outStream)\n\t, fState_ (eInProgress)\n\t, fStatus_ (StatusCodes::kOK)\n\t, fHeaders_ ()\n\t, fContentType_ (ct)\n\t, fBytes_ ()\n{\n\tAddHeader (L\"Server\", L\"Stroka-Based-Web-Server\");\n}\n\nvoid\tHTTPResponse::SetContentType (const InternetMediaType& contentType)\n{\n\tRequire (fState_ == eInProgress);\n\tfContentType_ = contentType;\n}\n\nvoid\tHTTPResponse::SetStatus (Status newStatus)\n{\n\tRequire (fState_ == eInProgress);\n\tfStatus_ = newStatus;\n}\n\nvoid\tHTTPResponse::AddHeader (String headerName, String value)\n{\n\tRequire (fState_ == eInProgress);\n\tClearHeader (headerName);\n\tfHeaders_.insert (map<String,String>::value_type (headerName, value));\n}\n\nvoid\tHTTPResponse::ClearHeader ()\n{\n\tRequire (fState_ == eInProgress);\n\tfHeaders_.clear ();\n}\n\nvoid\tHTTPResponse::ClearHeader (String headerName)\n{\n\tRequire (fState_ == eInProgress);\n\tmap<String,String>::iterator i = fHeaders_.find (headerName);\n\tif (i != fHeaders_.end ()) {\n\t\tfHeaders_.erase (i);\n\t}\n}\n\nvoid\tHTTPResponse::Flush ()\n{\n\tif (fState_ == eInProgress) {\n\t\t{\n\t\t\twstring\tstatusMsg;\n\t\t\tswitch (fStatus_) {\n\t\t\t\tcase StatusCodes::kOK:\t\t\t\t\tstatusMsg = L\"OK\"; break;\n\t\t\t\tcase StatusCodes::kMovedPermanently:\tstatusMsg = L\"Moved Permanently\"; break;\n\t\t\t}\n\t\t\twstring\tversion\t=\tL\"1.1\";\n\t\t\twstring\ttmp\t=\tCharacters::Format (L\"HTTP\/%s %d %s\\r\\n\", version.c_str (), fStatus_, statusMsg.c_str ());\n\t\t\tstring\tutf8\t=\tString (tmp).AsUTF8 ();\n\t\t\tfOutStream_.Write (reinterpret_cast<const Byte*> (Containers::Start (utf8)), reinterpret_cast<const Byte*> (Containers::End (utf8)));\n\t\t}\n\n\t\tfor (map<String,String>::const_iterator i = fHeaders_.begin (); i != fHeaders_.end (); ++i) {\n\t\t\twstring\ttmp\t=\tCharacters::Format (L\"%s: %s\\r\\n\", i->first.As<wstring> ().c_str (), i->second.As<wstring> ().c_str ());\n\t\t\tstring\tutf8\t=\tString (tmp).AsUTF8 ();\n\t\t\tfOutStream_.Write (reinterpret_cast<const Byte*> (Containers::Start (utf8)), reinterpret_cast<const Byte*> (Containers::End (utf8)));\n\t\t}\n\n\t\tconst char\tkCRLF[]\t=\t\"\\r\\n\";\n\t\tfOutStream_.Write (reinterpret_cast<const Byte*> (kCRLF), reinterpret_cast<const Byte*> (kCRLF + 2));\n\t\tfState_ = eInProgressHeaderState;\n\t}\n\t\/\/ write BYTES to fOutStream\n\tif (not fBytes_.empty ()) {\n\t\tAssert (not fState_ == eCompleted);\t\/\/ We PREVENT any writes when completed\n\t\tfOutStream_.Write (Containers::Start (fBytes_), Containers::End (fBytes_));\n\t\tfBytes_.clear ();\n\t}\n}\n\nvoid\tHTTPResponse::End ()\n{\n\tRequire ((fState_ == eInProgress) or (fState_ == eInProgressHeaderState));\n\tFlush ();\n\tfState_ = eCompleted;\n}\n\nvoid\tHTTPResponse::Kill ()\n{\n\tif (fState_ != eCompleted) {\n\t\tfState_ = eCompleted;\n\t\tfSocket_.Close ();\n\t}\n}\n\nvoid\tHTTPResponse::Redirect (const wstring& url)\n{\n\tRequire (fState_ == eInProgress);\n\tfBytes_.clear ();\n\n\t\/\/ PERHAPS should clear some header values???\n\tAddHeader (L\"Connection\", L\"close\");\t\/\/ needed for redirect\n\tAddHeader (L\"Location\", url);\t\t\t\/\/ needed for redirect\n\tSetStatus (StatusCodes::kMovedPermanently);\n\tFlush ();\n\tfState_ = eCompleted;\n}\n\nvoid\tHTTPResponse::write (const Byte* s, const Byte* e)\n{\n\tRequire ((fState_ == eInProgress) or (fState_ == eInProgressHeaderState));\n\tRequire (s <= e);\n\tif (s < e) {\n\t\tContainers::ReserveSpeedTweekAddN (fBytes_, (e - s), kResponseBufferReallocChunkSizeReserve_);\n\t\tfBytes_.insert (fBytes_.end (), s, e);\n\t}\n}\n\nvoid\tHTTPResponse::write (const wchar_t* s, const wchar_t* e)\n{\n\tRequire ((fState_ == eInProgress) or (fState_ == eInProgressHeaderState));\n\tRequire (s <= e);\n\tif (s < e) {\n\t\twstring tmp = wstring (s,e);\n\t\tstring utf8 = String (tmp).AsUTF8 ();\n\t\tif (not utf8.empty ()) {\n\t\t\tfBytes_.insert (fBytes_.end (), reinterpret_cast<const Byte*> (utf8.c_str ()), reinterpret_cast<const Byte*> (utf8.c_str () + utf8.length ()));\n\t\t}\n\t}\n}\n<commit_msg>fixed typo in HTTPResponse::Flush () assertion<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2011.  All rights reserved\n *\/\n#include\t\"..\/StroikaPreComp.h\"\n\n#include\t<algorithm>\n#include\t<cstdlib>\n\n#include\t\"..\/..\/Foundation\/Characters\/Format.h\"\n#include\t\"..\/..\/Foundation\/Containers\/Common.h\"\n#include\t\"..\/..\/Foundation\/DataExchangeFormat\/BadFormatException.h\"\n#include\t\"..\/..\/Foundation\/Debug\/Assertions.h\"\n#include\t\"..\/..\/Foundation\/Execution\/Exceptions.h\"\n#include\t\"..\/..\/Foundation\/Memory\/SmallStackBuffer.h\"\n\n#include\t\"HTTPResponse.h\"\n\n\nusing\tnamespace\tStroika::Foundation;\nusing\tnamespace\tStroika::Foundation::Containers;\nusing\tnamespace\tStroika::Foundation::Memory;\n\nusing\tnamespace\tStroika::Frameworks;\nusing\tnamespace\tStroika::Frameworks::WebServer;\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************ WebServer::HTTPResponse *******************************\n ********************************************************************************\n *\/\nnamespace\t{\n\t\/\/ Based on looking at a handlful of typical file sizes...5k to 80k, but ave around\n\t\/\/ 25 and median abit above 32k. Small, not very representative sampling. And the more we use\n\t\/\/ subscripts (script src=x) this number could shrink.\n\t\/\/\n\t\/\/ MAY want to switch to using SmallStackBuffer<Byte> - but before doing so, do some cleanups of its bugs and make sure\n\t\/\/ its optimized about how much it copies etc. Its really only tuned for POD-types (OK here but not necessarily good about reallocs).\n\t\/\/\n\t\/\/\t\t-- LGP 2011-07-06\n\tconst\tsize_t\tkMinResponseBufferReserve_\t\t\t\t=\t32 * 1024;\n\tconst\tsize_t\tkResponseBufferReallocChunkSizeReserve_\t=\t16 * 1024;\n}\n\nHTTPResponse::HTTPResponse (const IO::Network::Socket& s,  Streams::BinaryOutputStream& outStream, const InternetMediaType& ct)\n\t: fSocket_ (s)\n\t, fOutStream_ (outStream)\n\t, fState_ (eInProgress)\n\t, fStatus_ (StatusCodes::kOK)\n\t, fHeaders_ ()\n\t, fContentType_ (ct)\n\t, fBytes_ ()\n{\n\tAddHeader (L\"Server\", L\"Stroka-Based-Web-Server\");\n}\n\nvoid\tHTTPResponse::SetContentType (const InternetMediaType& contentType)\n{\n\tRequire (fState_ == eInProgress);\n\tfContentType_ = contentType;\n}\n\nvoid\tHTTPResponse::SetStatus (Status newStatus)\n{\n\tRequire (fState_ == eInProgress);\n\tfStatus_ = newStatus;\n}\n\nvoid\tHTTPResponse::AddHeader (String headerName, String value)\n{\n\tRequire (fState_ == eInProgress);\n\tClearHeader (headerName);\n\tfHeaders_.insert (map<String,String>::value_type (headerName, value));\n}\n\nvoid\tHTTPResponse::ClearHeader ()\n{\n\tRequire (fState_ == eInProgress);\n\tfHeaders_.clear ();\n}\n\nvoid\tHTTPResponse::ClearHeader (String headerName)\n{\n\tRequire (fState_ == eInProgress);\n\tmap<String,String>::iterator i = fHeaders_.find (headerName);\n\tif (i != fHeaders_.end ()) {\n\t\tfHeaders_.erase (i);\n\t}\n}\n\nvoid\tHTTPResponse::Flush ()\n{\n\tif (fState_ == eInProgress) {\n\t\t{\n\t\t\twstring\tstatusMsg;\n\t\t\tswitch (fStatus_) {\n\t\t\t\tcase StatusCodes::kOK:\t\t\t\t\tstatusMsg = L\"OK\"; break;\n\t\t\t\tcase StatusCodes::kMovedPermanently:\tstatusMsg = L\"Moved Permanently\"; break;\n\t\t\t}\n\t\t\twstring\tversion\t=\tL\"1.1\";\n\t\t\twstring\ttmp\t=\tCharacters::Format (L\"HTTP\/%s %d %s\\r\\n\", version.c_str (), fStatus_, statusMsg.c_str ());\n\t\t\tstring\tutf8\t=\tString (tmp).AsUTF8 ();\n\t\t\tfOutStream_.Write (reinterpret_cast<const Byte*> (Containers::Start (utf8)), reinterpret_cast<const Byte*> (Containers::End (utf8)));\n\t\t}\n\n\t\tfor (map<String,String>::const_iterator i = fHeaders_.begin (); i != fHeaders_.end (); ++i) {\n\t\t\twstring\ttmp\t=\tCharacters::Format (L\"%s: %s\\r\\n\", i->first.As<wstring> ().c_str (), i->second.As<wstring> ().c_str ());\n\t\t\tstring\tutf8\t=\tString (tmp).AsUTF8 ();\n\t\t\tfOutStream_.Write (reinterpret_cast<const Byte*> (Containers::Start (utf8)), reinterpret_cast<const Byte*> (Containers::End (utf8)));\n\t\t}\n\n\t\tconst char\tkCRLF[]\t=\t\"\\r\\n\";\n\t\tfOutStream_.Write (reinterpret_cast<const Byte*> (kCRLF), reinterpret_cast<const Byte*> (kCRLF + 2));\n\t\tfState_ = eInProgressHeaderState;\n\t}\n\t\/\/ write BYTES to fOutStream\n\tif (not fBytes_.empty ()) {\n\t\tAssert (fState_ != eCompleted);\t\/\/ We PREVENT any writes when completed\n\t\tfOutStream_.Write (Containers::Start (fBytes_), Containers::End (fBytes_));\n\t\tfBytes_.clear ();\n\t}\n}\n\nvoid\tHTTPResponse::End ()\n{\n\tRequire ((fState_ == eInProgress) or (fState_ == eInProgressHeaderState));\n\tFlush ();\n\tfState_ = eCompleted;\n}\n\nvoid\tHTTPResponse::Kill ()\n{\n\tif (fState_ != eCompleted) {\n\t\tfState_ = eCompleted;\n\t\tfSocket_.Close ();\n\t}\n}\n\nvoid\tHTTPResponse::Redirect (const wstring& url)\n{\n\tRequire (fState_ == eInProgress);\n\tfBytes_.clear ();\n\n\t\/\/ PERHAPS should clear some header values???\n\tAddHeader (L\"Connection\", L\"close\");\t\/\/ needed for redirect\n\tAddHeader (L\"Location\", url);\t\t\t\/\/ needed for redirect\n\tSetStatus (StatusCodes::kMovedPermanently);\n\tFlush ();\n\tfState_ = eCompleted;\n}\n\nvoid\tHTTPResponse::write (const Byte* s, const Byte* e)\n{\n\tRequire ((fState_ == eInProgress) or (fState_ == eInProgressHeaderState));\n\tRequire (s <= e);\n\tif (s < e) {\n\t\tContainers::ReserveSpeedTweekAddN (fBytes_, (e - s), kResponseBufferReallocChunkSizeReserve_);\n\t\tfBytes_.insert (fBytes_.end (), s, e);\n\t}\n}\n\nvoid\tHTTPResponse::write (const wchar_t* s, const wchar_t* e)\n{\n\tRequire ((fState_ == eInProgress) or (fState_ == eInProgressHeaderState));\n\tRequire (s <= e);\n\tif (s < e) {\n\t\twstring tmp = wstring (s,e);\n\t\tstring utf8 = String (tmp).AsUTF8 ();\n\t\tif (not utf8.empty ()) {\n\t\t\tfBytes_.insert (fBytes_.end (), reinterpret_cast<const Byte*> (utf8.c_str ()), reinterpret_cast<const Byte*> (utf8.c_str () + utf8.length ()));\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2015 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_ENUMERATION_HPP\n#define MAPNIK_ENUMERATION_HPP\n\n\/\/ mapnik\n#include <mapnik\/config.hpp>\n#include <mapnik\/debug.hpp>\n\n\/\/ stl\n#include <bitset>\n#include <iostream>\n#include <cstdlib>\n#include <algorithm>\n\nnamespace mapnik {\n\nclass illegal_enum_value : public std::exception\n{\npublic:\n    illegal_enum_value():\n        what_() {}\n\n    illegal_enum_value( std::string const& _what ) :\n        what_( _what )\n    {\n    }\n    virtual ~illegal_enum_value() throw() {}\n\n    virtual const char * what() const throw()\n    {\n        return what_.c_str();\n    }\n\nprotected:\n    std::string what_;\n};\n\n\n\/** Slim wrapper for enumerations. It creates a new type from a native enum and\n * a char pointer array. It almost exactly behaves like a native enumeration\n * type. It supports string conversion through stream operators. This is useful\n * for debugging, serialization\/deserialization and also helps with implementing\n * language bindings. The two convenient macros DEFINE_ENUM() and IMPLEMENT_ENUM()\n * are provided to help with instanciation.\n *\n * @par Limitations:\n *    - The enum must start at zero.\n *    - The enum must be consecutive.\n *    - The enum must be terminated with a special token consisting of the enum's\n *      name plus \"_MAX\".\n *    - The corresponding char pointer array must be terminated with an empty string.\n *    - The names must only consist of characters and digits (<i>a-z, A-Z, 0-9<\/i>),\n *      underscores (<i>_<\/i>) and dashes (<i>-<\/i>).\n *\n *\n * @warning At the moment the verify_mapnik_enum() method is called during static initialization.\n * It quits the application with exit code 1 if any error is detected. The other solution\n * i thought of is to do the checks at compile time (using boost::mpl).\n *\n * @par Example:\n * The following code goes into the header file:\n * @code\n * enum fruit_enum {\n *      APPLE,\n *      CHERRY,\n *      BANANA,\n *      PASSION_FRUIT,\n *      fruit_enum_MAX\n * };\n *\n * static const char * fruit_strings[] = {\n *      \"apple\",\n *      \"cherry\",\n *      \"banana\",\n *      \"passion_fruit\",\n *      \"\"\n * };\n *\n * DEFINE_ENUM( fruit, fruit_enum);\n * @endcode\n * In the corresponding cpp file do:\n * @code\n * IMPLEMENT_ENUM( fruit, fruit_strings );\n * @endcode\n * And here is how to use the resulting type Fruit\n * @code\n *\n * int\n * main(int argc, char * argv[]) {\n *      fruit f(APPLE);\n *      switch ( f ) {\n *          case BANANA:\n *          case APPLE:\n *              cerr << \"No thanks. I hate \" << f << \"s\" << endl;\n *              break;\n *          default:\n *              cerr << \"Hmmm ... yummy \" << f << endl;\n *              break;\n *      }\n *\n *      f = CHERRY;\n *\n *      fruit_enum native_enum = f;\n *\n *      f.from_string(\"passion_fruit\");\n *\n *      for (unsigned i = 0; i < fruit::MAX; ++i) {\n *          cerr << i << \" = \" << fruit::get_string(i) << endl;\n *      }\n *\n *      f.from_string(\"elephant\"); \/\/ throws illegal_enum_value\n *\n *      return 0;\n * }\n * @endcode\n *\/\n\ntemplate <typename ENUM, int THE_MAX>\nclass MAPNIK_DECL enumeration {\npublic:\n    using native_type = ENUM;\n\n    enumeration()\n        :  value_() {}\n\n    enumeration( ENUM v )\n        :  value_(v) {}\n\n    enumeration( enumeration const& other )\n        : value_(other.value_) {}\n\n    \/** Assignment operator for native enum values. *\/\n    void operator=(ENUM v)\n    {\n        value_ = v;\n    }\n\n    \/** Assignment operator. *\/\n    void operator=(enumeration const& other)\n    {\n        value_ = other.value_;\n    }\n\n    \/** Conversion operator for native enum values. *\/\n    operator ENUM() const\n    {\n        return value_;\n    }\n\n    enum Max\n    {\n        MAX = THE_MAX\n    };\n\n    \/** Converts @p str to an enum.\n     * @throw illegal_enum_value @p str is not a legal identifier.\n     * *\/\n    void from_string(std::string const& str)\n    {\n        \/\/ TODO: Enum value strings with underscore are deprecated in Mapnik 3.x\n        \/\/ and support will be removed in Mapnik 4.x.\n        bool deprecated = false;\n        std::string str_copy(str);\n        if (str_copy.find('_') != std::string::npos)\n        {\n            std::replace(str_copy.begin(), str_copy.end(), '_', '-');\n            deprecated = true;\n        }\n        for (unsigned i = 0; i < THE_MAX; ++i)\n        {\n            if (str_copy == our_strings_[i])\n            {\n                value_ = static_cast<ENUM>(i);\n                if (deprecated)\n                {\n                    MAPNIK_LOG_ERROR(enumerations) << \"enumeration value (\" << str << \") using \\\"_\\\" is deprecated and will be removed in Mapnik 4.x, use '\" << str_copy << \"' instead\";\n                }\n                return;\n            }\n        }\n        throw illegal_enum_value(std::string(\"Illegal enumeration value '\") +\n                                 str + \"' for enum \" + our_name_);\n    }\n\n    \/** Parses the input stream @p is for a word consisting of characters and\n     * digits (<i>a-z, A-Z, 0-9<\/i>) and underscores (<i>_<\/i>).\n     * The failbit of the stream is set if the word is not a valid identifier.\n     *\/\n    std::istream & parse(std::istream & is)\n    {\n        std::string word;\n        char c;\n\n        while ( is.peek() != std::char_traits< char >::eof())\n        {\n            is >> c;\n            if ( std::isspace(c) && word.empty() )\n            {\n                continue;\n            }\n            if ( std::isalnum(c) || (c == '_') || c == '-' )\n            {\n                word += c;\n            }\n            else\n            {\n                is.unget();\n                break;\n            }\n        }\n\n        try\n        {\n            from_string( word );\n        }\n        catch (illegal_enum_value const&)\n        {\n            is.setstate(std::ios::failbit);\n        }\n\n        return is;\n    }\n\n    \/** Returns the current value as a string identifier. *\/\n    std::string as_string() const\n    {\n        return our_strings_[value_];\n    }\n\n    \/** Prints the string identifier to the output stream @p os. *\/\n    std::ostream & print(std::ostream & os = std::cerr) const\n    {\n        return os << our_strings_[value_];\n    }\n\n    \/** Static helper function to iterate over valid identifiers. *\/\n    static const char * get_string(unsigned i)\n    {\n        return our_strings_[i];\n    }\n\n    \/** Performs some simple checks and quits the application if\n     * any error is detected. Tries to print helpful error messages.\n     *\/\n    static bool verify_mapnik_enum(const char * filename, unsigned line_no)\n    {\n        for (unsigned i = 0; i < THE_MAX; ++i)\n        {\n            if (our_strings_[i] == 0 )\n            {\n                std::cerr << \"### FATAL: Not enough strings for enum \"\n                          << our_name_ << \" defined in file '\" << filename\n                          << \"' at line \" << line_no;\n            }\n        }\n        if ( std::string(\"\") != our_strings_[THE_MAX])\n        {\n            std::cerr << \"### FATAL: The string array for enum \" << our_name_\n                      << \" defined in file '\" << filename << \"' at line \" << line_no\n                      << \" has too many items or is not terminated with an \"\n                      << \"empty string\";\n        }\n        return true;\n    }\n\n    static std::string const& get_full_qualified_name()\n    {\n        return our_name_;\n    }\n\n    static std::string get_name()\n    {\n        std::string::size_type idx = our_name_.find_last_of(\":\");\n        if ( idx == std::string::npos )\n        {\n            return our_name_;\n        } else {\n            return our_name_.substr( idx + 1 );\n        }\n    }\n\nprivate:\n    ENUM value_;\n    static const char ** our_strings_ ;\n    static std::string our_name_ ;\n    static bool  our_verified_flag_;\n};\n\n\/** ostream operator for enumeration\n * @relates mapnik::enumeration\n *\/\ntemplate <class ENUM, int THE_MAX>\nstd::ostream &\noperator<<(std::ostream & os, const mapnik::enumeration<ENUM, THE_MAX> & e)\n{\n    e.print( os );\n    return os;\n}\n\n\/** istream operator for enumeration\n * @relates mapnik::enumeration\n *\/\ntemplate <class ENUM, int THE_MAX>\nstd::istream &\noperator>>(std::istream & is, mapnik::enumeration<ENUM, THE_MAX> & e)\n{\n    e.parse( is );\n    return is;\n}\n\n} \/\/ end of namespace\n\n\/** Helper macro.\n * @relates mapnik::enumeration\n *\/\n#ifdef _MSC_VER\n#define DEFINE_ENUM( name, e)                   \\\n    template enumeration<e, e ## _MAX>;         \\\n    using name = enumeration<e, e ## _MAX>;\n#else\n#define DEFINE_ENUM( name, e)                   \\\n    using name = enumeration<e, e ## _MAX>;\n#endif\n\n\/** Helper macro. Runs the verify_mapnik_enum() method during static initialization.\n * @relates mapnik::enumeration\n *\/\n\n#define IMPLEMENT_ENUM( name, strings )                                 \\\n    template <> MAPNIK_DECL const char ** name ::our_strings_ = strings;            \\\n    template <> MAPNIK_DECL std::string name ::our_name_ = #name;                   \\\n    template <> MAPNIK_DECL bool name ::our_verified_flag_( name ::verify_mapnik_enum(__FILE__, __LINE__));\n\n#endif \/\/ MAPNIK_ENUMERATION_HPP\n<commit_msg>remove dead code in enumeration.hpp<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2015 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_ENUMERATION_HPP\n#define MAPNIK_ENUMERATION_HPP\n\n\/\/ mapnik\n#include <mapnik\/config.hpp>\n#include <mapnik\/debug.hpp>\n\n\/\/ stl\n#include <bitset>\n#include <iostream>\n#include <cstdlib>\n#include <algorithm>\n\nnamespace mapnik {\n\nclass illegal_enum_value : public std::exception\n{\npublic:\n    illegal_enum_value():\n        what_() {}\n\n    illegal_enum_value( std::string const& _what ) :\n        what_( _what )\n    {\n    }\n    virtual ~illegal_enum_value() throw() {}\n\n    virtual const char * what() const throw()\n    {\n        return what_.c_str();\n    }\n\nprotected:\n    std::string what_;\n};\n\n\n\/** Slim wrapper for enumerations. It creates a new type from a native enum and\n * a char pointer array. It almost exactly behaves like a native enumeration\n * type. It supports string conversion through stream operators. This is useful\n * for debugging, serialization\/deserialization and also helps with implementing\n * language bindings. The two convenient macros DEFINE_ENUM() and IMPLEMENT_ENUM()\n * are provided to help with instanciation.\n *\n * @par Limitations:\n *    - The enum must start at zero.\n *    - The enum must be consecutive.\n *    - The enum must be terminated with a special token consisting of the enum's\n *      name plus \"_MAX\".\n *    - The corresponding char pointer array must be terminated with an empty string.\n *    - The names must only consist of characters and digits (<i>a-z, A-Z, 0-9<\/i>),\n *      underscores (<i>_<\/i>) and dashes (<i>-<\/i>).\n *\n *\n * @warning At the moment the verify_mapnik_enum() method is called during static initialization.\n * It quits the application with exit code 1 if any error is detected. The other solution\n * i thought of is to do the checks at compile time (using boost::mpl).\n *\n * @par Example:\n * The following code goes into the header file:\n * @code\n * enum fruit_enum {\n *      APPLE,\n *      CHERRY,\n *      BANANA,\n *      PASSION_FRUIT,\n *      fruit_enum_MAX\n * };\n *\n * static const char * fruit_strings[] = {\n *      \"apple\",\n *      \"cherry\",\n *      \"banana\",\n *      \"passion_fruit\",\n *      \"\"\n * };\n *\n * DEFINE_ENUM( fruit, fruit_enum);\n * @endcode\n * In the corresponding cpp file do:\n * @code\n * IMPLEMENT_ENUM( fruit, fruit_strings );\n * @endcode\n * And here is how to use the resulting type Fruit\n * @code\n *\n * int\n * main(int argc, char * argv[]) {\n *      fruit f(APPLE);\n *      switch ( f ) {\n *          case BANANA:\n *          case APPLE:\n *              cerr << \"No thanks. I hate \" << f << \"s\" << endl;\n *              break;\n *          default:\n *              cerr << \"Hmmm ... yummy \" << f << endl;\n *              break;\n *      }\n *\n *      f = CHERRY;\n *\n *      fruit_enum native_enum = f;\n *\n *      f.from_string(\"passion_fruit\");\n *\n *      for (unsigned i = 0; i < fruit::MAX; ++i) {\n *          cerr << i << \" = \" << fruit::get_string(i) << endl;\n *      }\n *\n *      f.from_string(\"elephant\"); \/\/ throws illegal_enum_value\n *\n *      return 0;\n * }\n * @endcode\n *\/\n\ntemplate <typename ENUM, int THE_MAX>\nclass MAPNIK_DECL enumeration {\npublic:\n    using native_type = ENUM;\n\n    enumeration()\n        :  value_() {}\n\n    enumeration( ENUM v )\n        :  value_(v) {}\n\n    enumeration( enumeration const& other )\n        : value_(other.value_) {}\n\n    \/** Assignment operator for native enum values. *\/\n    void operator=(ENUM v)\n    {\n        value_ = v;\n    }\n\n    \/** Assignment operator. *\/\n    void operator=(enumeration const& other)\n    {\n        value_ = other.value_;\n    }\n\n    \/** Conversion operator for native enum values. *\/\n    operator ENUM() const\n    {\n        return value_;\n    }\n\n    enum Max\n    {\n        MAX = THE_MAX\n    };\n\n    \/** Converts @p str to an enum.\n     * @throw illegal_enum_value @p str is not a legal identifier.\n     * *\/\n    void from_string(std::string const& str)\n    {\n        \/\/ TODO: Enum value strings with underscore are deprecated in Mapnik 3.x\n        \/\/ and support will be removed in Mapnik 4.x.\n        bool deprecated = false;\n        std::string str_copy(str);\n        if (str_copy.find('_') != std::string::npos)\n        {\n            std::replace(str_copy.begin(), str_copy.end(), '_', '-');\n            deprecated = true;\n        }\n        for (unsigned i = 0; i < THE_MAX; ++i)\n        {\n            if (str_copy == our_strings_[i])\n            {\n                value_ = static_cast<ENUM>(i);\n                if (deprecated)\n                {\n                    MAPNIK_LOG_ERROR(enumerations) << \"enumeration value (\" << str << \") using \\\"_\\\" is deprecated and will be removed in Mapnik 4.x, use '\" << str_copy << \"' instead\";\n                }\n                return;\n            }\n        }\n        throw illegal_enum_value(std::string(\"Illegal enumeration value '\") +\n                                 str + \"' for enum \" + our_name_);\n    }\n\n    \/** Returns the current value as a string identifier. *\/\n    std::string as_string() const\n    {\n        return our_strings_[value_];\n    }\n\n    \/** Static helper function to iterate over valid identifiers. *\/\n    static const char * get_string(unsigned i)\n    {\n        return our_strings_[i];\n    }\n\n    \/** Performs some simple checks and quits the application if\n     * any error is detected. Tries to print helpful error messages.\n     *\/\n    static bool verify_mapnik_enum(const char * filename, unsigned line_no)\n    {\n        for (unsigned i = 0; i < THE_MAX; ++i)\n        {\n            if (our_strings_[i] == 0 )\n            {\n                std::cerr << \"### FATAL: Not enough strings for enum \"\n                          << our_name_ << \" defined in file '\" << filename\n                          << \"' at line \" << line_no;\n            }\n        }\n        if ( std::string(\"\") != our_strings_[THE_MAX])\n        {\n            std::cerr << \"### FATAL: The string array for enum \" << our_name_\n                      << \" defined in file '\" << filename << \"' at line \" << line_no\n                      << \" has too many items or is not terminated with an \"\n                      << \"empty string\";\n        }\n        return true;\n    }\n\nprivate:\n    ENUM value_;\n    static const char ** our_strings_ ;\n    static std::string our_name_ ;\n    static bool  our_verified_flag_;\n};\n\n} \/\/ end of namespace\n\n\/** Helper macro.\n * @relates mapnik::enumeration\n *\/\n#ifdef _MSC_VER\n#define DEFINE_ENUM( name, e)                   \\\n    template enumeration<e, e ## _MAX>;         \\\n    using name = enumeration<e, e ## _MAX>;\n#else\n#define DEFINE_ENUM( name, e)                   \\\n    using name = enumeration<e, e ## _MAX>;\n#endif\n\n\/** Helper macro. Runs the verify_mapnik_enum() method during static initialization.\n * @relates mapnik::enumeration\n *\/\n\n#define IMPLEMENT_ENUM( name, strings )                                 \\\n    template <> MAPNIK_DECL const char ** name ::our_strings_ = strings;            \\\n    template <> MAPNIK_DECL std::string name ::our_name_ = #name;                   \\\n    template <> MAPNIK_DECL bool name ::our_verified_flag_( name ::verify_mapnik_enum(__FILE__, __LINE__));\n\n#endif \/\/ MAPNIK_ENUMERATION_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/** @file configs.hpp\n *\n * @copyright (C) 2016\n * @date 2016.03.07\n * @version 1.0.0\n * @author amir zamani <azadkuh@live.com>\n *\n *\/\n\n#ifndef MBEDCRYPTO_CONFIGS_HPP\n#define MBEDCRYPTO_CONFIGS_HPP\n\n#include <memory>\n#include <string>\n\n#if defined(QT_CORE_LIB)\n#include <QByteArray>\n#endif \/\/ QT_CORE_LIB\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace mbedcrypto {\n\n\/\/\/ std::string is able to hold both TEXT and Binary data.\n\/\/\/ as encryption is frequently being used with both text strings and binaries,\n\/\/\/  std::string is more convenient than std::vector<unsigned char> or\n\/\/\/  std::basic_string<unsigned char>.\n\/\/\/ although std::vector<unsigned char> is a better options for binary contents.\nusing buffer_t = std::string;\n\n\/\/ synonyms\nusing cuchars = const unsigned char*;\nusing uchars  = unsigned char*;\n\n\/\/ helper function used internally\ninline auto\nto_const_ptr(const buffer_t& b) {\n    return reinterpret_cast<cuchars>(b.data());\n}\n\ninline auto\nto_ptr(buffer_t& b) {\n    return reinterpret_cast<uchars>(&b.front());\n}\n\n#if defined(QT_CORE_LIB)\ninline auto\nto_const_ptr(const QByteArray& b) {\n    return reinterpret_cast<cuchars>(b.data());\n}\n\ninline auto\nto_ptr(QByteArray& b) {\n    return reinterpret_cast<uchars>(b.data());\n}\n#endif \/\/ QT_CORE_LIB\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n} \/\/ namespace mbedcrypto\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#endif \/\/ MBEDCRYPTO_CONFIGS_HPP\n<commit_msg>introduce buffer_view_t<commit_after>\/** @file configs.hpp\n *\n * @copyright (C) 2016\n * @date 2016.03.07\n * @version 1.0.0\n * @author amir zamani <azadkuh@live.com>\n *\n *\/\n\n#ifndef MBEDCRYPTO_CONFIGS_HPP\n#define MBEDCRYPTO_CONFIGS_HPP\n\n#include <memory>\n#include <string>\n\n#if defined(QT_CORE_LIB)\n#include <QByteArray>\n#endif \/\/ QT_CORE_LIB\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace mbedcrypto {\n\n\/\/\/ std::string is able to hold both TEXT and Binary data.\n\/\/\/ as encryption is frequently being used with both text strings and binaries,\n\/\/\/  std::string is more convenient than std::vector<unsigned char> or\n\/\/\/  std::basic_string<unsigned char>.\n\/\/\/ although std::vector<unsigned char> is a better options for binary contents.\nusing buffer_t = std::string;\n\n\/\/ synonyms\nusing cuchars = const unsigned char*;\nusing uchars  = unsigned char*;\n\n\/\/ helper function used internally\ninline auto\nto_const_ptr(const buffer_t& b) {\n    return reinterpret_cast<cuchars>(b.data());\n}\n\ninline auto\nto_ptr(buffer_t& b) {\n    return reinterpret_cast<uchars>(&b.front());\n}\n\ntemplate<class T>\ninline auto\nto_const_ptr(const T& container) {\n    return container.data();\n}\n\ntemplate<class T>\ninline auto\nto_ptr(const T& container) {\n    return &container.front();\n}\n\n#if defined(QT_CORE_LIB)\ninline auto\nto_const_ptr(const QByteArray& b) {\n    return reinterpret_cast<cuchars>(b.data());\n}\n\ninline auto\nto_ptr(QByteArray& b) {\n    return reinterpret_cast<uchars>(b.data());\n}\n\ninline QByteArray\nQByteArrayShallow(const buffer_t& src) {\n    return QByteArray::fromRawData(src.data(), src.size());\n}\n\ninline QByteArray\nQByteArrayShallow(cuchars src, size_t size) {\n    return QByteArray::fromRawData(reinterpret_cast<const char*>(src), size);\n}\n#endif \/\/ QT_CORE_LIB\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ a class similar to c++17 std::string_view\nclass buffer_view_t\n{\n    cuchars  data_ = nullptr;\n    size_t   size_ = 0;\n\npublic:\n    constexpr buffer_view_t(cuchars data, size_t length) noexcept\n        : data_(data), size_(length) {}\n\n    \/\/ T could be std::string, QByteArray or even an std::vector<uchar>\n    template <class T>\n    constexpr buffer_view_t(const T& src)\n        : data_(to_const_ptr(src)), size_(src.length()) {}\n\n    constexpr cuchars data() const noexcept {\n        return data_;\n    }\n\n    constexpr size_t size() const noexcept {\n        return size_;\n    }\n\n    constexpr size_t length() const noexcept {\n        return size_;\n    }\n\n    constexpr bool empty() const noexcept {\n        return size_ == 0;\n    }\n\n    \/\/ copyalbe, moveable\n    ~buffer_view_t() = default;\n    buffer_view_t()  = delete;\n    buffer_view_t(const buffer_view_t&) = default;\n    buffer_view_t(buffer_view_t&&)      = default;\n    buffer_view_t& operator=(const buffer_view_t&) = default;\n    buffer_view_t& operator=(buffer_view_t&&)      = default;\n}; \/\/ buffer_view_t\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n} \/\/ namespace mbedcrypto\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#endif \/\/ MBEDCRYPTO_CONFIGS_HPP\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 \"QmitkTransferFunctionGeneratorWidget.h\"\n\n#include <mitkImageStatisticsHolder.h>\n#include <mitkTransferFunctionProperty.h>\n#include <mitkRenderingManager.h>\n#include <mitkTransferFunctionInitializer.h>\n#include <mitkUnstructuredGrid.h>\n#include <QFileDialog>\n\n#include <MitkSceneSerializationExports.h>\n#include <mitkTransferFunctionPropertySerializer.h>\n\n#include <vtkUnstructuredGrid.h>\n\n\nQmitkTransferFunctionGeneratorWidget::QmitkTransferFunctionGeneratorWidget(QWidget* parent,\n    Qt::WindowFlags f) :\n  QWidget(parent, f), deltaScale(1.0), deltaMax(1024), deltaMin(1)\n{\n  histoGramm = NULL;\n\n  this->setupUi(this);\n\n  \/\/ LevelWindow Tab\n  {\n    connect( m_CrossLevelWindow, SIGNAL( SignalDeltaMove( int, int ) ), this, SLOT( OnDeltaLevelWindow( int, int ) ) );\n  }\n\n  \/\/ Threshold Tab\n  {\n    connect( m_CrossThreshold, SIGNAL( SignalDeltaMove( int, int ) ), this, SLOT( OnDeltaThreshold( int, int ) ) );\n    thDelta = 100;\n  }\n\n  \/\/ Presets Tab\n  {\n    m_TransferFunctionComboBox->setVisible(false);\n\n    connect( m_TransferFunctionComboBox, SIGNAL( activated( int ) ), this, SIGNAL(SignalTransferFunctionModeChanged(int)) );\n    connect( m_TransferFunctionComboBox, SIGNAL( activated( int ) ), this, SLOT(OnPreset(int)) );\n\n    connect( m_SavePreset, SIGNAL( clicked() ), this, SLOT( OnSavePreset() ) );\n\n    connect( m_LoadPreset, SIGNAL( clicked() ), this, SLOT( OnLoadPreset() ) );\n  }\n\n  presetFileName = \".\";\n}\n\n\nint QmitkTransferFunctionGeneratorWidget::AddPreset(const QString &presetName)\n{\n  m_TransferFunctionComboBox->setVisible(true);\n\n  m_TransferFunctionComboBox->addItem( presetName);\n  return m_TransferFunctionComboBox->count()-1;\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::SetPresetsTabEnabled(bool enable)\n{\n  m_PresetTab->setEnabled(enable);\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::SetThresholdTabEnabled(bool enable)\n{\n  m_ThresholdTab->setEnabled(enable);\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::SetBellTabEnabled(bool enable)\n{\n  m_BellTab->setEnabled(enable);\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::OnSavePreset( )\n{\n  if(tfpToChange.IsNull())\n    return;\n\n  mitk::TransferFunction::Pointer tf = tfpToChange->GetValue();\n\n  std::string fileName;\n  std::string fileNameOutput;\n\n  presetFileName = QFileDialog::getSaveFileName( this,\"Choose a filename to save the transferfunction\",presetFileName, \"Transferfunction (*.xml)\" );\n\n\n  fileName=presetFileName.toLocal8Bit().constData();\n\n  MITK_INFO << \"Saving Transferfunction under path: \" << fileName;\n\n  fileNameOutput= ReduceFileName(fileName);\n\n  if ( mitk::TransferFunctionPropertySerializer::SerializeTransferFunction( fileName.c_str(),  tf ))\n    m_InfoPreset->setText( QString( (std::string(\"saved \")+ fileNameOutput).c_str() ) );\n  else\n    m_InfoPreset->setText( QString( std::string(\"saving failed\").c_str() ) );\n}\n\n\nvoid QmitkTransferFunctionGeneratorWidget::OnLoadPreset( )\n{\n  if(tfpToChange.IsNull())\n    return;\n\n  std::string fileName;\n  std::string fileNameOutput;\n\n  presetFileName = QFileDialog::getOpenFileName( this,\"Choose a file to open the transferfunction from\",presetFileName, \"Transferfunction (*.xml)\"  );\n\n  fileName=presetFileName.toLocal8Bit().constData();\n\n  MITK_INFO << \"Loading Transferfunction from path: \" << fileName;\n\n  fileNameOutput= ReduceFileName(fileName);\n\n  mitk::TransferFunction::Pointer tf = mitk::TransferFunctionPropertySerializer::DeserializeTransferFunction(fileName.c_str());\n\n  if(tf.IsNotNull())\n  {\n    tfpToChange->SetValue( tf );\n\n    m_InfoPreset->setText( QString( (std::string(\"loaded \")+ fileNameOutput).c_str() ) );\n    mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n    emit SignalUpdateCanvas();\n  }\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::OnPreset(int mode)\n{\n  \/\/first item is only information\n  if( --mode == -1 )\n    return;\n\n  m_InfoPreset->setText(QString(\"selected \") + m_TransferFunctionComboBox->currentText());\n\n  \/\/revert to first item\n  m_TransferFunctionComboBox->setCurrentIndex( 0 );\n}\n\nstatic double transformationGlocke ( double x )\n{\n  double z = 0.1;\n\n  double a = 2 - 2 * z;\n\n  double b = 2 * z - 1;\n\n  x = a * x + b;\n\n  return x;\n}\n\nstatic double stepFunctionGlocke ( double x )\n{\n  x = 1-(2*x -1.0); \/\/ map [0.5;1] to [0,1]\n  x = x * ( 3*x - 2*x*x ); \/\/ apply smoothing function\n\n  x = x * x;\n\n  return x;\n}\n\ndouble QmitkTransferFunctionGeneratorWidget::ScaleDelta(int d) const\n{\n  return deltaScale*(double)d;\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::OnDeltaLevelWindow(int dx, int dy) \/\/ bell\n{\n  if(tfpToChange.IsNull())\n    return;\n\n  thPos += ScaleDelta(dx);\n  thDelta -= ScaleDelta(dy);\n\n  if(thDelta < deltaMin)\n    thDelta = deltaMin;\n\n  if(thDelta > deltaMax)\n    thDelta = deltaMax;\n\n  if(thPos < histoMinimum)\n    thPos = histoMinimum;\n\n  if(thPos > histoMaximum)\n    thPos = histoMaximum;\n\n  std::stringstream ss;\n\n  ss << \"Click on the cross and move the mouse\"<<\"\\n\"\n     <<\"\\n\"\n     << \"center at \" << thPos << \"\\n\"\n     << \"width \" << thDelta * 2;\n\n  m_InfoLevelWindow->setText( QString( ss.str().c_str() ) );\n\n  mitk::TransferFunction::Pointer tf = tfpToChange->GetValue();\n\n  \/\/ grayvalue->opacity\n  {\n    vtkPiecewiseFunction *f=tf->GetScalarOpacityFunction();\n    f->RemoveAllPoints();\n\n    for( int r = 0; r<= 6; r++)\n    {\n      double relPos = (r \/ 6.0) * 0.5 + 0.5;\n      f->AddPoint(thPos+thDelta*(-transformationGlocke(relPos)),stepFunctionGlocke(relPos));\n      f->AddPoint(thPos+thDelta*( transformationGlocke(relPos)),stepFunctionGlocke(relPos));\n    }\n\n    f->Modified();\n  }\n\n  \/\/ gradient at grayvalue->opacity\n  {\n    vtkPiecewiseFunction *f=tf->GetGradientOpacityFunction();\n    f->RemoveAllPoints();\n\n\n    f->AddPoint( 0, 1.0 );\n    f->Modified();\n  }\n\n  tf->Modified();\n\n  mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n  emit SignalUpdateCanvas();\n}\n\nstatic double stepFunctionThreshold ( double x )\n{\n  x = 0.5*x + 0.5; \/\/ map [-1;1] to [0,1]\n  x = x * ( 3*x - 2*x*x ); \/\/ apply smoothing function\n\n  x = x * x;\n\n  return x;\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::OnDeltaThreshold(int dx, int dy) \/\/ LEVELWINDOW\n{\n\n  if(tfpToChange.IsNull())\n    return;\n\n  thPos += ScaleDelta(dx);\n  thDelta += ScaleDelta(dy);\n\n  if(thDelta < deltaMin)\n    thDelta = deltaMin;\n\n  if(thDelta > deltaMax)\n    thDelta = deltaMax;\n\n  if(thPos < histoMinimum)\n    thPos = histoMinimum;\n\n  if(thPos > histoMaximum)\n    thPos = histoMaximum;\n\n  std::stringstream ss;\n\n  ss << \"Click on the cross and move the mouse\"<<\"\\n\"\n     <<\"\\n\"\n     << \"threshold at \" << thPos << \"\\n\"\n     << \"width \" << thDelta * 2;\n\n  m_InfoThreshold->setText( QString( ss.str().c_str() ) );\n\n  mitk::TransferFunction::Pointer tf = tfpToChange->GetValue();\n\n  \/\/ grayvalue->opacity\n  {\n    vtkPiecewiseFunction *f=tf->GetScalarOpacityFunction();\n    f->RemoveAllPoints();\n\n    for( int r = 1; r<= 4; r++)\n    {\n      double relPos = r \/ 4.0;\n      f->AddPoint(thPos+thDelta*(-relPos),stepFunctionThreshold(-relPos));\n      f->AddPoint(thPos+thDelta*( relPos),stepFunctionThreshold( relPos));\n    }\n    f->Modified();\n  }\n\n  \/\/ gradient at grayvalue->opacity\n  {\n    vtkPiecewiseFunction *f=tf->GetGradientOpacityFunction();\n    f->RemoveAllPoints();\n    f->AddPoint( 0, 1.0 );\n    f->Modified();\n  }\n\n  tf->Modified();\n  mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n  emit SignalUpdateCanvas();\n\n}\n\nstd::string QmitkTransferFunctionGeneratorWidget::ReduceFileName(std::string fileNameLong )\n{\n  if (fileNameLong.length()< 40)\n    return fileNameLong;\n\n  std::string fileNameShort;\n  std::string fileNameRevert;\n\n  for(unsigned int i=0; i< fileNameLong.length(); i++)\n  {\n    if(i<3)\n    {\n      char x= fileNameLong[i];\n      fileNameShort= fileNameShort+x;\n    }\n    if(i==3)\n    {\n      fileNameShort= fileNameShort+\"...\";\n      break;\n    }\n  }\n\n  unsigned int len( fileNameLong.length() );\n  for(unsigned int i=len-1; i <= len; i--)\n  {\n    std::string x=std::string(\"\")+fileNameLong[i];\n\n    if ( x.compare(\"\/\")==0 || x.compare(\"\\\\\")==0)\n    {\n      fileNameRevert= \"\/\" + fileNameRevert;\n      break;\n    }\n\n    if (i>=fileNameLong.length()-24)\n    {\n      fileNameRevert= x+ fileNameRevert;\n    }\n    else\n    {\n      fileNameRevert= \"\/...\" + fileNameRevert;\n      break;\n    }\n\n  }\n\n  return fileNameShort+fileNameRevert;\n}\n\nQmitkTransferFunctionGeneratorWidget::~QmitkTransferFunctionGeneratorWidget()\n{\n}\n\n\nvoid QmitkTransferFunctionGeneratorWidget::SetDataNode(mitk::DataNode* node)\n{\n  histoGramm = NULL;\n\n  if (node)\n  {\n    tfpToChange = dynamic_cast<mitk::TransferFunctionProperty*>(node->GetProperty(\"TransferFunction\"));\n\n    if(!tfpToChange)\n    {\n      node->SetProperty(\"TransferFunction\", tfpToChange = mitk::TransferFunctionProperty::New() );\n      dynamic_cast<mitk::TransferFunctionProperty*>(node->GetProperty(\"TransferFunction\"));\n    }\n\n    mitk::TransferFunction::Pointer tf = tfpToChange->GetValue();\n\n    if( mitk::Image* image = dynamic_cast<mitk::Image*>( node->GetData() ) )\n    {\n      mitk::ImageStatisticsHolder* statistics = image->GetStatistics();\n      histoMinimum= statistics->GetScalarValueMin();\n      histoMaximum= statistics->GetScalarValueMax();\n    }\n    else if (mitk::UnstructuredGrid* grid = dynamic_cast<mitk::UnstructuredGrid*>( node->GetData() ) )\n    {\n      double* range = grid->GetVtkUnstructuredGrid()->GetScalarRange();\n      histoMinimum = range[0];\n      histoMaximum = range[1];\n      double histoRange = histoMaximum - histoMinimum;\n      deltaMax = histoRange\/4.0;\n      deltaMin = histoRange\/400.0;\n      deltaScale = histoRange\/1024.0;\n    }\n    else\n    {\n      MITK_WARN << \"QmitkTransferFunctonGeneratorWidget does not support \" << node->GetData()->GetNameOfClass() << \" instances\";\n    }\n\n    thPos = ( histoMinimum + histoMaximum ) \/ 2.0;\n\n  }\n  else\n  {\n    tfpToChange = 0;\n    m_InfoPreset->setText( QString( \"\" ) );\n\n  }\n}\n\n<commit_msg>Fixed more QtWidgetsExt warnings.<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 \"QmitkTransferFunctionGeneratorWidget.h\"\n\n#include <mitkImageStatisticsHolder.h>\n#include <mitkTransferFunctionProperty.h>\n#include <mitkRenderingManager.h>\n#include <mitkTransferFunctionInitializer.h>\n#include <mitkUnstructuredGrid.h>\n#include <QFileDialog>\n\n#include <MitkSceneSerializationExports.h>\n#include <mitkTransferFunctionPropertySerializer.h>\n\n#include <vtkUnstructuredGrid.h>\n\n\nQmitkTransferFunctionGeneratorWidget::QmitkTransferFunctionGeneratorWidget(QWidget* parent,\n    Qt::WindowFlags f) :\n  QWidget(parent, f), deltaScale(1.0), deltaMax(1024), deltaMin(1)\n{\n  histoGramm = NULL;\n\n  this->setupUi(this);\n\n  \/\/ LevelWindow Tab\n  {\n    connect( m_CrossLevelWindow, SIGNAL( SignalDeltaMove( int, int ) ), this, SLOT( OnDeltaLevelWindow( int, int ) ) );\n  }\n\n  \/\/ Threshold Tab\n  {\n    connect( m_CrossThreshold, SIGNAL( SignalDeltaMove( int, int ) ), this, SLOT( OnDeltaThreshold( int, int ) ) );\n    thDelta = 100;\n  }\n\n  \/\/ Presets Tab\n  {\n    m_TransferFunctionComboBox->setVisible(false);\n\n    connect( m_TransferFunctionComboBox, SIGNAL( activated( int ) ), this, SIGNAL(SignalTransferFunctionModeChanged(int)) );\n    connect( m_TransferFunctionComboBox, SIGNAL( activated( int ) ), this, SLOT(OnPreset(int)) );\n\n    connect( m_SavePreset, SIGNAL( clicked() ), this, SLOT( OnSavePreset() ) );\n\n    connect( m_LoadPreset, SIGNAL( clicked() ), this, SLOT( OnLoadPreset() ) );\n  }\n\n  presetFileName = \".\";\n}\n\n\nint QmitkTransferFunctionGeneratorWidget::AddPreset(const QString &presetName)\n{\n  m_TransferFunctionComboBox->setVisible(true);\n\n  m_TransferFunctionComboBox->addItem( presetName);\n  return m_TransferFunctionComboBox->count()-1;\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::SetPresetsTabEnabled(bool enable)\n{\n  m_PresetTab->setEnabled(enable);\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::SetThresholdTabEnabled(bool enable)\n{\n  m_ThresholdTab->setEnabled(enable);\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::SetBellTabEnabled(bool enable)\n{\n  m_BellTab->setEnabled(enable);\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::OnSavePreset( )\n{\n  if(tfpToChange.IsNull())\n    return;\n\n  mitk::TransferFunction::Pointer tf = tfpToChange->GetValue();\n\n  std::string fileName;\n  std::string fileNameOutput;\n\n  presetFileName = QFileDialog::getSaveFileName( this,\"Choose a filename to save the transferfunction\",presetFileName, \"Transferfunction (*.xml)\" );\n\n\n  fileName=presetFileName.toLocal8Bit().constData();\n\n  MITK_INFO << \"Saving Transferfunction under path: \" << fileName;\n\n  fileNameOutput= ReduceFileName(fileName);\n\n  if ( mitk::TransferFunctionPropertySerializer::SerializeTransferFunction( fileName.c_str(),  tf ))\n    m_InfoPreset->setText( QString( (std::string(\"saved \")+ fileNameOutput).c_str() ) );\n  else\n    m_InfoPreset->setText( QString( std::string(\"saving failed\").c_str() ) );\n}\n\n\nvoid QmitkTransferFunctionGeneratorWidget::OnLoadPreset( )\n{\n  if(tfpToChange.IsNull())\n    return;\n\n  std::string fileName;\n  std::string fileNameOutput;\n\n  presetFileName = QFileDialog::getOpenFileName( this,\"Choose a file to open the transferfunction from\",presetFileName, \"Transferfunction (*.xml)\"  );\n\n  fileName=presetFileName.toLocal8Bit().constData();\n\n  MITK_INFO << \"Loading Transferfunction from path: \" << fileName;\n\n  fileNameOutput= ReduceFileName(fileName);\n\n  mitk::TransferFunction::Pointer tf = mitk::TransferFunctionPropertySerializer::DeserializeTransferFunction(fileName.c_str());\n\n  if(tf.IsNotNull())\n  {\n    tfpToChange->SetValue( tf );\n\n    m_InfoPreset->setText( QString( (std::string(\"loaded \")+ fileNameOutput).c_str() ) );\n    mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n    emit SignalUpdateCanvas();\n  }\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::OnPreset(int mode)\n{\n  \/\/first item is only information\n  if( --mode == -1 )\n    return;\n\n  m_InfoPreset->setText(QString(\"selected \") + m_TransferFunctionComboBox->currentText());\n\n  \/\/revert to first item\n  m_TransferFunctionComboBox->setCurrentIndex( 0 );\n}\n\nstatic double transformationGlocke ( double x )\n{\n  double z = 0.1;\n\n  double a = 2 - 2 * z;\n\n  double b = 2 * z - 1;\n\n  x = a * x + b;\n\n  return x;\n}\n\nstatic double stepFunctionGlocke ( double x )\n{\n  x = 1-(2*x -1.0); \/\/ map [0.5;1] to [0,1]\n  x = x * ( 3*x - 2*x*x ); \/\/ apply smoothing function\n\n  x = x * x;\n\n  return x;\n}\n\ndouble QmitkTransferFunctionGeneratorWidget::ScaleDelta(int d) const\n{\n  return deltaScale*(double)d;\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::OnDeltaLevelWindow(int dx, int dy) \/\/ bell\n{\n  if(tfpToChange.IsNull())\n    return;\n\n  thPos += ScaleDelta(dx);\n  thDelta -= ScaleDelta(dy);\n\n  if(thDelta < deltaMin)\n    thDelta = deltaMin;\n\n  if(thDelta > deltaMax)\n    thDelta = deltaMax;\n\n  if(thPos < histoMinimum)\n    thPos = histoMinimum;\n\n  if(thPos > histoMaximum)\n    thPos = histoMaximum;\n\n  std::stringstream ss;\n\n  ss << \"Click on the cross and move the mouse\"<<\"\\n\"\n     <<\"\\n\"\n     << \"center at \" << thPos << \"\\n\"\n     << \"width \" << thDelta * 2;\n\n  m_InfoLevelWindow->setText( QString( ss.str().c_str() ) );\n\n  mitk::TransferFunction::Pointer tf = tfpToChange->GetValue();\n\n  \/\/ grayvalue->opacity\n  {\n    vtkPiecewiseFunction *f=tf->GetScalarOpacityFunction();\n    f->RemoveAllPoints();\n\n    for( int r = 0; r<= 6; r++)\n    {\n      double relPos = (r \/ 6.0) * 0.5 + 0.5;\n      f->AddPoint(thPos+thDelta*(-transformationGlocke(relPos)),stepFunctionGlocke(relPos));\n      f->AddPoint(thPos+thDelta*( transformationGlocke(relPos)),stepFunctionGlocke(relPos));\n    }\n\n    f->Modified();\n  }\n\n  \/\/ gradient at grayvalue->opacity\n  {\n    vtkPiecewiseFunction *f=tf->GetGradientOpacityFunction();\n    f->RemoveAllPoints();\n\n\n    f->AddPoint( 0, 1.0 );\n    f->Modified();\n  }\n\n  tf->Modified();\n\n  mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n  emit SignalUpdateCanvas();\n}\n\nstatic double stepFunctionThreshold ( double x )\n{\n  x = 0.5*x + 0.5; \/\/ map [-1;1] to [0,1]\n  x = x * ( 3*x - 2*x*x ); \/\/ apply smoothing function\n\n  x = x * x;\n\n  return x;\n}\n\nvoid QmitkTransferFunctionGeneratorWidget::OnDeltaThreshold(int dx, int dy) \/\/ LEVELWINDOW\n{\n\n  if(tfpToChange.IsNull())\n    return;\n\n  thPos += ScaleDelta(dx);\n  thDelta += ScaleDelta(dy);\n\n  if(thDelta < deltaMin)\n    thDelta = deltaMin;\n\n  if(thDelta > deltaMax)\n    thDelta = deltaMax;\n\n  if(thPos < histoMinimum)\n    thPos = histoMinimum;\n\n  if(thPos > histoMaximum)\n    thPos = histoMaximum;\n\n  std::stringstream ss;\n\n  ss << \"Click on the cross and move the mouse\"<<\"\\n\"\n     <<\"\\n\"\n     << \"threshold at \" << thPos << \"\\n\"\n     << \"width \" << thDelta * 2;\n\n  m_InfoThreshold->setText( QString( ss.str().c_str() ) );\n\n  mitk::TransferFunction::Pointer tf = tfpToChange->GetValue();\n\n  \/\/ grayvalue->opacity\n  {\n    vtkPiecewiseFunction *f=tf->GetScalarOpacityFunction();\n    f->RemoveAllPoints();\n\n    for( int r = 1; r<= 4; r++)\n    {\n      double relPos = r \/ 4.0;\n      f->AddPoint(thPos+thDelta*(-relPos),stepFunctionThreshold(-relPos));\n      f->AddPoint(thPos+thDelta*( relPos),stepFunctionThreshold( relPos));\n    }\n    f->Modified();\n  }\n\n  \/\/ gradient at grayvalue->opacity\n  {\n    vtkPiecewiseFunction *f=tf->GetGradientOpacityFunction();\n    f->RemoveAllPoints();\n    f->AddPoint( 0, 1.0 );\n    f->Modified();\n  }\n\n  tf->Modified();\n  mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n  emit SignalUpdateCanvas();\n\n}\n\nstd::string QmitkTransferFunctionGeneratorWidget::ReduceFileName(std::string fileNameLong )\n{\n  if (fileNameLong.length()< 40)\n    return fileNameLong;\n\n  std::string fileNameShort;\n  std::string fileNameRevert;\n\n  for(unsigned int i=0; i< fileNameLong.length(); i++)\n  {\n    if(i<3)\n    {\n      char x= fileNameLong[i];\n      fileNameShort= fileNameShort+x;\n    }\n    if(i==3)\n    {\n      fileNameShort= fileNameShort+\"...\";\n      break;\n    }\n  }\n\n  unsigned int len( fileNameLong.length() );\n  for(unsigned int i=len-1; i <= len; i--)\n  {\n    std::string x=std::string(\"\")+fileNameLong[i];\n\n    if ( x.compare(\"\/\")==0 || x.compare(\"\\\\\")==0)\n    {\n      fileNameRevert= \"\/\" + fileNameRevert;\n      break;\n    }\n\n    if (i>=fileNameLong.length()-24)\n    {\n      fileNameRevert= x+ fileNameRevert;\n    }\n    else\n    {\n      fileNameRevert= \"\/...\" + fileNameRevert;\n      break;\n    }\n\n  }\n\n  return fileNameShort+fileNameRevert;\n}\n\nQmitkTransferFunctionGeneratorWidget::~QmitkTransferFunctionGeneratorWidget()\n{\n}\n\n\nvoid QmitkTransferFunctionGeneratorWidget::SetDataNode(mitk::DataNode* node)\n{\n  histoGramm = NULL;\n\n  if (node)\n  {\n    tfpToChange = dynamic_cast<mitk::TransferFunctionProperty*>(node->GetProperty(\"TransferFunction\"));\n\n    if(!tfpToChange)\n      node->SetProperty(\"TransferFunction\", tfpToChange = mitk::TransferFunctionProperty::New() );\n\n    mitk::TransferFunction::Pointer tf = tfpToChange->GetValue();\n\n    if( mitk::Image* image = dynamic_cast<mitk::Image*>( node->GetData() ) )\n    {\n      mitk::ImageStatisticsHolder* statistics = image->GetStatistics();\n      histoMinimum= statistics->GetScalarValueMin();\n      histoMaximum= statistics->GetScalarValueMax();\n    }\n    else if (mitk::UnstructuredGrid* grid = dynamic_cast<mitk::UnstructuredGrid*>( node->GetData() ) )\n    {\n      double* range = grid->GetVtkUnstructuredGrid()->GetScalarRange();\n      histoMinimum = range[0];\n      histoMaximum = range[1];\n      double histoRange = histoMaximum - histoMinimum;\n      deltaMax = histoRange\/4.0;\n      deltaMin = histoRange\/400.0;\n      deltaScale = histoRange\/1024.0;\n    }\n    else\n    {\n      MITK_WARN << \"QmitkTransferFunctonGeneratorWidget does not support \" << node->GetData()->GetNameOfClass() << \" instances\";\n    }\n\n    thPos = ( histoMinimum + histoMaximum ) \/ 2.0;\n\n  }\n  else\n  {\n    tfpToChange = 0;\n    m_InfoPreset->setText( QString( \"\" ) );\n\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <utility>\n#include <type_traits>\n#include <string>\n\n#include \"any.hpp\"\n#include <type_list.hpp>\n#include <function_deduction.hpp>\n#include <member_variable_deduction.hpp>\n#include <void_t.hpp>\n\n\nnamespace shadow\n{\n\/\/ free function signature\ntypedef any (*free_function_binding_signature)(any*);\n\/\/ member function signature\ntypedef any (*member_function_binding_signature)(any&, any*);\n\/\/ member variable getter\ntypedef any (*member_variable_get_binding_signature)(const any&);\n\/\/ member variable setter\ntypedef void (*member_variable_set_binding_signature)(any&, const any&);\n\/\/ constructor signature\ntypedef any (*constructor_binding_signature)(any*);\n\/\/ conversion signature\ntypedef any (*conversion_binding_signature)(const any&);\n\/\/ string serialize signature\ntypedef std::string (*string_serialization_signature)(const any&);\n\/\/ string deserialization signature\ntypedef any (*string_deserialization_signature)(const std::string&);\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ generic bind point for free functions\n\/\/ has the same signature as function pointer free_function_binding_signature\n\/\/ which can be stored in the free_function_info struct\n\n\nnamespace free_function_detail\n{\n\/\/ necessary to handle void as return type differently when calling underlying\n\/\/ free function\ntemplate <class ReturnType>\nstruct return_type_specializer\n{\n    \/\/ dispatch: unpacks argument type list and sequence to correctly index into\n    \/\/ argument array and call get with the right types to retrieve raw values\n    \/\/ from the anys\n    template <class FunctionPointerType,\n              FunctionPointerType FunctionPointerValue,\n              class... ArgTypes,\n              std::size_t... ArgSeq>\n    static any\n    dispatch(any* argument_array,\n             metamusil::t_list::type_list<ArgTypes...>,\n             std::index_sequence<ArgSeq...>)\n    {\n        \/\/ necessary to remove reference from types as any only stores\n        \/\/ unqualified types, ie values only\n        return FunctionPointerValue(\n            argument_array[ArgSeq]\n                .get<typename std::remove_reference_t<ArgTypes>>()...);\n    }\n};\n\n\ntemplate <>\nstruct return_type_specializer<void>\n{\n    \/\/ dispatch: unpacks argument type list and sequence to correctly index into\n    \/\/ argument array and call get with the right types to retrieve raw values\n    \/\/ from the anys\n    template <class FunctionPointerType,\n              FunctionPointerType FunctionPointerValue,\n              class... ArgTypes,\n              std::size_t... ArgSeq>\n    static any\n    dispatch(any* argument_array,\n             metamusil::t_list::type_list<ArgTypes...>,\n             std::index_sequence<ArgSeq...>)\n    {\n        \/\/ necessary to remove reference from types as any only stores\n        \/\/ unqualified types, ie values only\n        FunctionPointerValue(\n            argument_array[ArgSeq]\n                .get<typename std::remove_reference_t<ArgTypes>>()...);\n\n        \/\/ return empty any, ie 'void'\n        return any();\n    }\n};\n\n\n\/\/ the value of the function pointer is stored at runtime in the template\n\/\/ overload set\n\/\/ this enables any function to be wrapped into uniform function signature that\n\/\/ can be stored homogenously at runtime\ntemplate <class FunctionPointerType, FunctionPointerType FunctionPointerValue>\nany\ngeneric_free_function_bind_point(any* argument_array)\n{\n    typedef metamusil::deduce_return_type_t<FunctionPointerType> return_type;\n    typedef metamusil::deduce_parameter_types_t<FunctionPointerType>\n        parameter_types;\n    \/\/ make integer sequence from type list\n    typedef metamusil::t_list::index_sequence_for_t<parameter_types>\n        parameter_sequence;\n\n    return return_type_specializer<return_type>::\n        template dispatch<FunctionPointerType, FunctionPointerValue>(\n            argument_array, parameter_types(), parameter_sequence());\n}\n}\n\n\nnamespace member_function_detail\n{\n\ntemplate <class ReturnType>\nstruct return_type_specializer\n{\n    template <class MemFunPointerType,\n              MemFunPointerType MemFunPointerValue,\n              class ObjectType,\n              class... ParamTypes,\n              std::size_t... ParamSequence>\n    static any\n    dispatch(any& object,\n             any* argument_array,\n             metamusil::t_list::type_list<ParamTypes...>,\n             std::index_sequence<ParamSequence...>)\n    {\n        return (object.get<ObjectType>().*MemFunPointerValue)(\n            argument_array[ParamSequence]\n                .get<std::remove_reference_t<ParamTypes>>()...);\n    }\n};\n\n\ntemplate <>\nstruct return_type_specializer<void>\n{\n    template <class MemFunPointerType,\n              MemFunPointerType MemFunPointerValue,\n              class ObjectType,\n              class... ParamTypes,\n              std::size_t... ParamSequence>\n    static any\n    dispatch(any& object,\n             any* argument_array,\n             metamusil::t_list::type_list<ParamTypes...>,\n             std::index_sequence<ParamSequence...>)\n    {\n        (object.get<ObjectType>().*MemFunPointerValue)(\n            argument_array[ParamSequence]\n                .get<std::remove_reference_t<ParamTypes>>()...);\n\n        return any();\n    }\n};\n\n\ntemplate <class MemFunPointerType, MemFunPointerType MemFunPointerValue>\nany\ngeneric_member_function_bind_point(any& object, any* argument_array)\n{\n    \/\/ deduce return type\n    typedef metamusil::deduce_return_type_t<MemFunPointerType> return_type;\n\n    \/\/ deduce parameter types\n    typedef metamusil::deduce_parameter_types_t<MemFunPointerType>\n        parameter_types;\n\n    \/\/ make integer sequence from parameter type list\n    typedef metamusil::t_list::index_sequence_for_t<parameter_types>\n        parameter_sequence;\n\n    \/\/ deduce object type\n    typedef metamusil::deduce_object_type_t<MemFunPointerType> object_type;\n\n    return return_type_specializer<return_type>::\n        template dispatch<MemFunPointerType, MemFunPointerValue, object_type>(\n            object, argument_array, parameter_types(), parameter_sequence());\n}\n}\n\n\nnamespace member_variable_detail\n{\n\ntemplate <class MemVarPointerType,\n          MemVarPointerType MemVarPointerValue,\n          class ObjectType,\n          class MemVarType>\nany\nget_dispatch(const any& object)\n{\n    return (object.get<ObjectType>().*MemVarPointerValue);\n}\n\ntemplate <class MemVarPointerType,\n          MemVarPointerType MemVarPointerValue,\n          class ObjectType,\n          class MemVarType>\nvoid\nset_dispatch(any& object, const any& value)\n{\n    (object.get<ObjectType>().*MemVarPointerValue) = value.get<MemVarType>();\n}\n\n\ntemplate <class MemVarPointerType, MemVarPointerType MemVarPointerValue>\nany\ngeneric_member_variable_get_bind_point(const any& object)\n{\n    typedef metamusil::deduce_member_variable_object_type_t<MemVarPointerType>\n        object_type;\n    typedef metamusil::deduce_member_variable_type_t<MemVarPointerType>\n        member_variable_type;\n\n    return get_dispatch<MemVarPointerType,\n                        MemVarPointerValue,\n                        object_type,\n                        member_variable_type>(object);\n}\n\n\ntemplate <class MemVarPointerType, MemVarPointerType MemVarPointerValue>\nvoid\ngeneric_member_variable_set_bind_point(any& object, const any& value)\n{\n    typedef metamusil::deduce_member_variable_object_type_t<MemVarPointerType>\n        object_type;\n    typedef metamusil::deduce_member_variable_type_t<MemVarPointerType>\n        member_variable_type;\n\n    return set_dispatch<MemVarPointerType,\n                        MemVarPointerValue,\n                        object_type,\n                        member_variable_type>(object, value);\n}\n}\n\n\nnamespace constructor_detail\n{\n\n\/\/ purpose of braced_init_selector is to attempt to use constructor T(...) if\n\/\/ available, otherwise fall back to braced init list initialization\ntemplate <class, class T, class... ParamTypes>\nstruct braced_init_selector_impl\n{\n    template <std::size_t... Seq>\n    static any\n    constructor_dispatch(any* argument_array, std::index_sequence<Seq...>)\n    {\n        any out = T{argument_array[Seq].get<ParamTypes>()...};\n        return out;\n    }\n};\n\ntemplate <class T, class... ParamTypes>\nstruct braced_init_selector_impl<\n    metamusil::void_t<decltype(T(std::declval<ParamTypes>()...))>,\n    T,\n    ParamTypes...>\n{\n    template <std::size_t... Seq>\n    static any\n    constructor_dispatch(any* argument_array, std::index_sequence<Seq...>)\n    {\n        any out = T(argument_array[Seq].get<ParamTypes>()...);\n        return out;\n    }\n};\n\ntemplate <class T, class... ParamTypes>\nusing braced_init_selector = braced_init_selector_impl<void, T, ParamTypes...>;\n\n\ntemplate <class T, class... ParamTypes>\nany\ngeneric_constructor_bind_point(any* argument_array)\n{\n    typedef std::index_sequence_for<ParamTypes...> param_sequence;\n\n    return braced_init_selector<T, ParamTypes...>::constructor_dispatch(\n        argument_array, param_sequence());\n}\n}\n\n\nnamespace conversion_detail\n{\ntemplate <class TargetType, class SourceType, class = void>\nstruct conversion_specializer;\n\ntemplate <>\nstruct conversion_specializer<void, void>;\n\ntemplate <class TargetType, class SourceType>\nstruct conversion_specializer<\n    TargetType,\n    SourceType,\n    std::enable_if_t<std::is_convertible<SourceType, TargetType>::value>>\n{\n    static any\n    dispatch(const any& src)\n    {\n        TargetType temp = (TargetType)src.get<SourceType>();\n        return temp;\n    }\n};\n\ntemplate <class TargetType, class SourceType>\nany\ngeneric_conversion_bind_point(const any& src)\n{\n    return conversion_specializer<TargetType, SourceType>::dispatch(src);\n}\n}\n\n\nnamespace string_serialization_detail\n{\n\ntemplate <class T, class = void>\nstruct type_selector;\n\ntemplate <class T>\nstruct type_selector<T, std::enable_if_t<std::is_arithmetic<T>::value>>\n{\n    static std::string\n    serialize_dispatch(const any& value)\n    {\n        std::to_string(value.get<T>());\n    }\n};\n\n\ntemplate <class T>\nstd::string\ngeneric_string_serialization_bind_point(const any& value)\n{\n    return type_selector<T>::serialize_dispatch(value);\n}\n}\n}\n<commit_msg>Rename. \tmodified:   include\/reflection_binding.hpp<commit_after>#pragma once\n\n#include <utility>\n#include <type_traits>\n#include <string>\n\n#include \"any.hpp\"\n#include <type_list.hpp>\n#include <function_deduction.hpp>\n#include <member_variable_deduction.hpp>\n#include <void_t.hpp>\n\n\nnamespace shadow\n{\n\/\/ free function signature\ntypedef any (*free_function_binding_signature)(any*);\n\/\/ member function signature\ntypedef any (*member_function_binding_signature)(any&, any*);\n\/\/ member variable getter\ntypedef any (*member_variable_get_binding_signature)(const any&);\n\/\/ member variable setter\ntypedef void (*member_variable_set_binding_signature)(any&, const any&);\n\/\/ constructor signature\ntypedef any (*constructor_binding_signature)(any*);\n\/\/ conversion signature\ntypedef any (*conversion_binding_signature)(const any&);\n\/\/ string serialize signature\ntypedef std::string (*string_serialization_signature)(const any&);\n\/\/ string deserialization signature\ntypedef any (*string_deserialization_signature)(const std::string&);\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ generic bind point for free functions\n\/\/ has the same signature as function pointer free_function_binding_signature\n\/\/ which can be stored in the free_function_info struct\n\n\nnamespace free_function_detail\n{\n\/\/ necessary to handle void as return type differently when calling underlying\n\/\/ free function\ntemplate <class ReturnType>\nstruct return_type_specializer\n{\n    \/\/ dispatch: unpacks argument type list and sequence to correctly index into\n    \/\/ argument array and call get with the right types to retrieve raw values\n    \/\/ from the anys\n    template <class FunctionPointerType,\n              FunctionPointerType FunctionPointerValue,\n              class... ArgTypes,\n              std::size_t... ArgSeq>\n    static any\n    dispatch(any* argument_array,\n             metamusil::t_list::type_list<ArgTypes...>,\n             std::index_sequence<ArgSeq...>)\n    {\n        \/\/ necessary to remove reference from types as any only stores\n        \/\/ unqualified types, ie values only\n        return FunctionPointerValue(\n            argument_array[ArgSeq]\n                .get<typename std::remove_reference_t<ArgTypes>>()...);\n    }\n};\n\n\ntemplate <>\nstruct return_type_specializer<void>\n{\n    \/\/ dispatch: unpacks argument type list and sequence to correctly index into\n    \/\/ argument array and call get with the right types to retrieve raw values\n    \/\/ from the anys\n    template <class FunctionPointerType,\n              FunctionPointerType FunctionPointerValue,\n              class... ArgTypes,\n              std::size_t... ArgSeq>\n    static any\n    dispatch(any* argument_array,\n             metamusil::t_list::type_list<ArgTypes...>,\n             std::index_sequence<ArgSeq...>)\n    {\n        \/\/ necessary to remove reference from types as any only stores\n        \/\/ unqualified types, ie values only\n        FunctionPointerValue(\n            argument_array[ArgSeq]\n                .get<typename std::remove_reference_t<ArgTypes>>()...);\n\n        \/\/ return empty any, ie 'void'\n        return any();\n    }\n};\n\n\n\/\/ the value of the function pointer is stored at runtime in the template\n\/\/ overload set\n\/\/ this enables any function to be wrapped into uniform function signature that\n\/\/ can be stored homogenously at runtime\ntemplate <class FunctionPointerType, FunctionPointerType FunctionPointerValue>\nany\ngeneric_free_function_bind_point(any* argument_array)\n{\n    typedef metamusil::deduce_return_type_t<FunctionPointerType> return_type;\n    typedef metamusil::deduce_parameter_types_t<FunctionPointerType>\n        parameter_types;\n    \/\/ make integer sequence from type list\n    typedef metamusil::t_list::index_sequence_for_t<parameter_types>\n        parameter_sequence;\n\n    return return_type_specializer<return_type>::\n        template dispatch<FunctionPointerType, FunctionPointerValue>(\n            argument_array, parameter_types(), parameter_sequence());\n}\n}\n\n\nnamespace member_function_detail\n{\n\ntemplate <class ReturnType>\nstruct return_type_specializer\n{\n    template <class MemFunPointerType,\n              MemFunPointerType MemFunPointerValue,\n              class ObjectType,\n              class... ParamTypes,\n              std::size_t... ParamSequence>\n    static any\n    dispatch(any& object,\n             any* argument_array,\n             metamusil::t_list::type_list<ParamTypes...>,\n             std::index_sequence<ParamSequence...>)\n    {\n        return (object.get<ObjectType>().*MemFunPointerValue)(\n            argument_array[ParamSequence]\n                .get<std::remove_reference_t<ParamTypes>>()...);\n    }\n};\n\n\ntemplate <>\nstruct return_type_specializer<void>\n{\n    template <class MemFunPointerType,\n              MemFunPointerType MemFunPointerValue,\n              class ObjectType,\n              class... ParamTypes,\n              std::size_t... ParamSequence>\n    static any\n    dispatch(any& object,\n             any* argument_array,\n             metamusil::t_list::type_list<ParamTypes...>,\n             std::index_sequence<ParamSequence...>)\n    {\n        (object.get<ObjectType>().*MemFunPointerValue)(\n            argument_array[ParamSequence]\n                .get<std::remove_reference_t<ParamTypes>>()...);\n\n        return any();\n    }\n};\n\n\ntemplate <class MemFunPointerType, MemFunPointerType MemFunPointerValue>\nany\ngeneric_member_function_bind_point(any& object, any* argument_array)\n{\n    \/\/ deduce return type\n    typedef metamusil::deduce_return_type_t<MemFunPointerType> return_type;\n\n    \/\/ deduce parameter types\n    typedef metamusil::deduce_parameter_types_t<MemFunPointerType>\n        parameter_types;\n\n    \/\/ make integer sequence from parameter type list\n    typedef metamusil::t_list::index_sequence_for_t<parameter_types>\n        parameter_sequence;\n\n    \/\/ deduce object type\n    typedef metamusil::deduce_object_type_t<MemFunPointerType> object_type;\n\n    return return_type_specializer<return_type>::\n        template dispatch<MemFunPointerType, MemFunPointerValue, object_type>(\n            object, argument_array, parameter_types(), parameter_sequence());\n}\n}\n\n\nnamespace member_variable_detail\n{\n\ntemplate <class MemVarPointerType,\n          MemVarPointerType MemVarPointerValue,\n          class ObjectType,\n          class MemVarType>\nany\nget_dispatch(const any& object)\n{\n    return (object.get<ObjectType>().*MemVarPointerValue);\n}\n\ntemplate <class MemVarPointerType,\n          MemVarPointerType MemVarPointerValue,\n          class ObjectType,\n          class MemVarType>\nvoid\nset_dispatch(any& object, const any& value)\n{\n    (object.get<ObjectType>().*MemVarPointerValue) = value.get<MemVarType>();\n}\n\n\ntemplate <class MemVarPointerType, MemVarPointerType MemVarPointerValue>\nany\ngeneric_member_variable_get_bind_point(const any& object)\n{\n    typedef metamusil::deduce_member_variable_object_type_t<MemVarPointerType>\n        object_type;\n    typedef metamusil::deduce_member_variable_type_t<MemVarPointerType>\n        member_variable_type;\n\n    return get_dispatch<MemVarPointerType,\n                        MemVarPointerValue,\n                        object_type,\n                        member_variable_type>(object);\n}\n\n\ntemplate <class MemVarPointerType, MemVarPointerType MemVarPointerValue>\nvoid\ngeneric_member_variable_set_bind_point(any& object, const any& value)\n{\n    typedef metamusil::deduce_member_variable_object_type_t<MemVarPointerType>\n        object_type;\n    typedef metamusil::deduce_member_variable_type_t<MemVarPointerType>\n        member_variable_type;\n\n    return set_dispatch<MemVarPointerType,\n                        MemVarPointerValue,\n                        object_type,\n                        member_variable_type>(object, value);\n}\n}\n\n\nnamespace constructor_detail\n{\n\n\/\/ purpose of braced_init_selector is to attempt to use constructor T(...) if\n\/\/ available, otherwise fall back to braced init list initialization\ntemplate <class, class T, class... ParamTypes>\nstruct braced_init_selector_impl\n{\n    template <std::size_t... Seq>\n    static any\n    constructor_dispatch(any* argument_array, std::index_sequence<Seq...>)\n    {\n        any out = T{argument_array[Seq].get<ParamTypes>()...};\n        return out;\n    }\n};\n\ntemplate <class T, class... ParamTypes>\nstruct braced_init_selector_impl<\n    metamusil::void_t<decltype(T(std::declval<ParamTypes>()...))>,\n    T,\n    ParamTypes...>\n{\n    template <std::size_t... Seq>\n    static any\n    constructor_dispatch(any* argument_array, std::index_sequence<Seq...>)\n    {\n        any out = T(argument_array[Seq].get<ParamTypes>()...);\n        return out;\n    }\n};\n\ntemplate <class T, class... ParamTypes>\nusing braced_init_selector = braced_init_selector_impl<void, T, ParamTypes...>;\n\n\ntemplate <class T, class... ParamTypes>\nany\ngeneric_constructor_bind_point(any* argument_array)\n{\n    typedef std::index_sequence_for<ParamTypes...> param_sequence;\n\n    return braced_init_selector<T, ParamTypes...>::constructor_dispatch(\n        argument_array, param_sequence());\n}\n}\n\n\nnamespace conversion_detail\n{\ntemplate <class TargetType, class SourceType, class = void>\nstruct conversion_specializer;\n\ntemplate <>\nstruct conversion_specializer<void, void>;\n\ntemplate <class TargetType, class SourceType>\nstruct conversion_specializer<\n    TargetType,\n    SourceType,\n    std::enable_if_t<std::is_convertible<SourceType, TargetType>::value>>\n{\n    static any\n    dispatch(const any& src)\n    {\n        TargetType temp = (TargetType)src.get<SourceType>();\n        return temp;\n    }\n};\n\ntemplate <class TargetType, class SourceType>\nany\ngeneric_conversion_bind_point(const any& src)\n{\n    return conversion_specializer<TargetType, SourceType>::dispatch(src);\n}\n}\n\n\nnamespace string_serialization_detail\n{\n\ntemplate <class T, class = void>\nstruct string_serialize_type_selector;\n\ntemplate <class T>\nstruct string_serialize_type_selector<\n    T,\n    std::enable_if_t<std::is_arithmetic<T>::value>>\n{\n    static std::string\n    dispatch(const any& value)\n    {\n        return std::to_string(value.get<T>());\n    }\n};\n\n\ntemplate <class T>\nstd::string\ngeneric_string_serialization_bind_point(const any& value)\n{\n    return type_selector<T>::serialize_dispatch(value);\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef REFLECTION_BINDING_HPP\n#define REFLECTION_BINDING_HPP\n\n\n#include <string>\n#include <type_traits>\n#include <utility>\n\n#include \"any.hpp\"\n#include <function_deduction.hpp>\n#include <member_variable_deduction.hpp>\n#include <type_list.hpp>\n#include <void_t.hpp>\n\n\nnamespace shadow\n{\n\/\/ free function signature\ntypedef any (*free_function_binding_signature)(any*);\n\/\/ member function signature\ntypedef any (*member_function_binding_signature)(any&, any*);\n\/\/ member variable getter\ntypedef any (*member_variable_get_binding_signature)(const any&);\n\/\/ member variable setter\ntypedef void (*member_variable_set_binding_signature)(any&, const any&);\n\/\/ constructor signature\ntypedef any (*constructor_binding_signature)(any*);\n\/\/ conversion signature\ntypedef any (*conversion_binding_signature)(const any&);\n\/\/ string serialize signature\ntypedef std::string (*string_serialization_signature)(const any&);\n\/\/ string deserialization signature\ntypedef any (*string_deserialization_signature)(const std::string&);\n\/\/ address of signature\ntypedef any (*address_of_signature)(any&);\n\/\/ dereference signature\ntypedef any (*dereference_signature)(any&);\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ generic bind point for free functions\n\/\/ has the same signature as function pointer free_function_binding_signature\n\/\/ which can be stored in the free_function_info struct\n\n\nnamespace free_function_detail\n{\n\/\/ necessary to handle void as return type differently when calling underlying\n\/\/ free function\ntemplate <class ReturnType>\nstruct return_type_specializer\n{\n    \/\/ dispatch: unpacks argument type list and sequence to correctly index into\n    \/\/ argument array and call get with the right types to retrieve raw values\n    \/\/ from the anys\n    template <class FunctionPointerType,\n              FunctionPointerType FunctionPointerValue,\n              class... ArgTypes,\n              std::size_t... ArgSeq>\n    static any\n    dispatch(any* argument_array,\n             metamusil::t_list::type_list<ArgTypes...>,\n             std::index_sequence<ArgSeq...>)\n    {\n        \/\/ necessary to remove reference from types as any only stores\n        \/\/ unqualified types, ie values only\n        return FunctionPointerValue(\n            argument_array[ArgSeq]\n                .get<typename std::remove_reference_t<ArgTypes>>()...);\n    }\n};\n\n\ntemplate <>\nstruct return_type_specializer<void>\n{\n    \/\/ dispatch: unpacks argument type list and sequence to correctly index into\n    \/\/ argument array and call get with the right types to retrieve raw values\n    \/\/ from the anys\n    template <class FunctionPointerType,\n              FunctionPointerType FunctionPointerValue,\n              class... ArgTypes,\n              std::size_t... ArgSeq>\n    static any\n    dispatch(any* argument_array,\n             metamusil::t_list::type_list<ArgTypes...>,\n             std::index_sequence<ArgSeq...>)\n    {\n        \/\/ necessary to remove reference from types as any only stores\n        \/\/ unqualified types, ie values only\n        FunctionPointerValue(\n            argument_array[ArgSeq]\n                .get<typename std::remove_reference_t<ArgTypes>>()...);\n\n        \/\/ return empty any, ie 'void'\n        return any();\n    }\n};\n\n\n\/\/ the value of the function pointer is stored at runtime in the template\n\/\/ overload set\n\/\/ this enables any function to be wrapped into uniform function signature that\n\/\/ can be stored homogenously at runtime\ntemplate <class FunctionPointerType, FunctionPointerType FunctionPointerValue>\nany\ngeneric_free_function_bind_point(any* argument_array)\n{\n    typedef metamusil::deduce_return_type_t<FunctionPointerType> return_type;\n    typedef metamusil::deduce_parameter_types_t<FunctionPointerType>\n        parameter_types;\n    \/\/ make integer sequence from type list\n    typedef metamusil::t_list::index_sequence_for_t<parameter_types>\n        parameter_sequence;\n\n    return return_type_specializer<return_type>::\n        template dispatch<FunctionPointerType, FunctionPointerValue>(\n            argument_array, parameter_types(), parameter_sequence());\n}\n} \/\/ namespace free_function_detail\n\n\nnamespace member_function_detail\n{\n\ntemplate <class ReturnType>\nstruct return_type_specializer\n{\n    template <class MemFunPointerType,\n              MemFunPointerType MemFunPointerValue,\n              class ObjectType,\n              class... ParamTypes,\n              std::size_t... ParamSequence>\n    static any\n    dispatch(any& object,\n             any* argument_array,\n             metamusil::t_list::type_list<ParamTypes...>,\n             std::index_sequence<ParamSequence...>)\n    {\n        return (object.get<ObjectType>().*MemFunPointerValue)(\n            argument_array[ParamSequence]\n                .get<std::remove_reference_t<ParamTypes>>()...);\n    }\n};\n\n\ntemplate <>\nstruct return_type_specializer<void>\n{\n    template <class MemFunPointerType,\n              MemFunPointerType MemFunPointerValue,\n              class ObjectType,\n              class... ParamTypes,\n              std::size_t... ParamSequence>\n    static any\n    dispatch(any& object,\n             any* argument_array,\n             metamusil::t_list::type_list<ParamTypes...>,\n             std::index_sequence<ParamSequence...>)\n    {\n        (object.get<ObjectType>().*MemFunPointerValue)(\n            argument_array[ParamSequence]\n                .get<std::remove_reference_t<ParamTypes>>()...);\n\n        return any();\n    }\n};\n\n\ntemplate <class MemFunPointerType, MemFunPointerType MemFunPointerValue>\nany\ngeneric_member_function_bind_point(any& object, any* argument_array)\n{\n    \/\/ deduce return type\n    typedef metamusil::deduce_return_type_t<MemFunPointerType> return_type;\n\n    \/\/ deduce parameter types\n    typedef metamusil::deduce_parameter_types_t<MemFunPointerType>\n        parameter_types;\n\n    \/\/ make integer sequence from parameter type list\n    typedef metamusil::t_list::index_sequence_for_t<parameter_types>\n        parameter_sequence;\n\n    \/\/ deduce object type\n    typedef metamusil::deduce_object_type_t<MemFunPointerType> object_type;\n\n    return return_type_specializer<return_type>::\n        template dispatch<MemFunPointerType, MemFunPointerValue, object_type>(\n            object, argument_array, parameter_types(), parameter_sequence());\n}\n} \/\/ namespace member_function_detail\n\n\nnamespace member_variable_detail\n{\n\ntemplate <class MemVarPointerType,\n          MemVarPointerType MemVarPointerValue,\n          class ObjectType,\n          class MemVarType>\nany\nget_dispatch(const any& object)\n{\n    return (object.get<ObjectType>().*MemVarPointerValue);\n}\n\ntemplate <class MemVarPointerType,\n          MemVarPointerType MemVarPointerValue,\n          class ObjectType,\n          class MemVarType>\nvoid\nset_dispatch(any& object, const any& value)\n{\n    (object.get<ObjectType>().*MemVarPointerValue) = value.get<MemVarType>();\n}\n\n\ntemplate <class MemVarPointerType, MemVarPointerType MemVarPointerValue>\nany\ngeneric_member_variable_get_bind_point(const any& object)\n{\n    typedef metamusil::deduce_member_variable_object_type_t<MemVarPointerType>\n        object_type;\n    typedef metamusil::deduce_member_variable_type_t<MemVarPointerType>\n        member_variable_type;\n\n    return get_dispatch<MemVarPointerType,\n                        MemVarPointerValue,\n                        object_type,\n                        member_variable_type>(object);\n}\n\n\ntemplate <class MemVarPointerType, MemVarPointerType MemVarPointerValue>\nvoid\ngeneric_member_variable_set_bind_point(any& object, const any& value)\n{\n    typedef metamusil::deduce_member_variable_object_type_t<MemVarPointerType>\n        object_type;\n    typedef metamusil::deduce_member_variable_type_t<MemVarPointerType>\n        member_variable_type;\n\n    return set_dispatch<MemVarPointerType,\n                        MemVarPointerValue,\n                        object_type,\n                        member_variable_type>(object, value);\n}\n} \/\/ namespace member_variable_detail\n\n\nnamespace constructor_detail\n{\n\n\/\/ purpose of braced_init_selector is to attempt to use constructor T(...) if\n\/\/ available, otherwise fall back to braced init list initialization\ntemplate <class, class T, class... ParamTypes>\nstruct braced_init_selector_impl\n{\n    template <std::size_t... Seq>\n    static any\n    constructor_dispatch(any* argument_array, std::index_sequence<Seq...>)\n    {\n        any out = T{argument_array[Seq].get<ParamTypes>()...};\n        return out;\n    }\n};\n\ntemplate <class T, class... ParamTypes>\nstruct braced_init_selector_impl<\n    metamusil::void_t<decltype(T(std::declval<ParamTypes>()...))>,\n    T,\n    ParamTypes...>\n{\n    template <std::size_t... Seq>\n    static any\n    constructor_dispatch(any* argument_array, std::index_sequence<Seq...>)\n    {\n        any out = T(argument_array[Seq].get<ParamTypes>()...);\n        return out;\n    }\n};\n\ntemplate <class T, class... ParamTypes>\nusing braced_init_selector = braced_init_selector_impl<void, T, ParamTypes...>;\n\n\ntemplate <class T, class... ParamTypes>\nany\ngeneric_constructor_bind_point(any* argument_array)\n{\n    typedef std::index_sequence_for<ParamTypes...> param_sequence;\n\n    return braced_init_selector<T, ParamTypes...>::constructor_dispatch(\n        argument_array, param_sequence());\n}\n} \/\/ namespace constructor_detail\n\n\nnamespace conversion_detail\n{\ntemplate <class TargetType, class SourceType, class = void>\nstruct conversion_specializer;\n\ntemplate <>\nstruct conversion_specializer<void, void>;\n\ntemplate <class TargetType, class SourceType>\nstruct conversion_specializer<\n    TargetType,\n    SourceType,\n    std::enable_if_t<std::is_convertible<SourceType, TargetType>::value>>\n{\n    static any\n    dispatch(const any& src)\n    {\n        TargetType temp = static_cast<TargetType>(src.get<SourceType>());\n        return temp;\n    }\n};\n\ntemplate <class TargetType, class SourceType>\nany\ngeneric_conversion_bind_point(const any& src)\n{\n    return conversion_specializer<TargetType, SourceType>::dispatch(src);\n}\n} \/\/ namespace conversion_detail\n\n\nnamespace string_serialization_detail\n{\n\ntemplate <class T, class = void>\nstruct string_serialize_type_selector;\n\ntemplate <class T>\nstruct string_serialize_type_selector<\n    T,\n    std::enable_if_t<std::is_arithmetic<T>::value>>\n{\n    static std::string\n    dispatch(const any& value)\n    {\n        return std::to_string(value.get<T>());\n    }\n};\n\ntemplate <>\nstruct string_serialize_type_selector<std::string>\n{\n    static std::string\n    dispatch(const any& value)\n    {\n        return value.get<std::string>();\n    }\n};\n\ntemplate <>\nstruct string_serialize_type_selector<char>\n{\n    static std::string\n    dispatch(const any& value)\n    {\n        std::string out;\n        out.push_back(value.get<char>());\n        return out;\n    }\n};\n\ntemplate <>\nstruct string_serialize_type_selector<void>\n{\n    static std::string\n    dispatch(const any&)\n    {\n        return \"empty\";\n    }\n};\n\ntemplate <class T>\nstd::string\ngeneric_string_serialization_bind_point(const any& value)\n{\n    return string_serialize_type_selector<T>::dispatch(value);\n}\n\n\ntemplate <class T, class = void>\nstruct string_deserialize_type_selector;\n\ntemplate <class T>\nstruct string_deserialize_type_selector<\n    T,\n    std::enable_if_t<std::is_arithmetic<T>::value>>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        T out = std::stold(str_value);\n        return out;\n    }\n};\n\n\ntemplate <>\nstruct string_deserialize_type_selector<char>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return str_value[0];\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<std::string>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return str_value;\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<int>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stoi(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<long>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stol(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<long long>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stoll(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<unsigned long>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stoul(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<unsigned long long>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stoull(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<float>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stof(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<double>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stod(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<long double>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stold(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<void>\n{\n    static any\n    dispatch(const std::string&)\n    {\n        return shadow::any();\n    }\n};\n\n\ntemplate <class T>\nany\ngeneric_string_deserialization_bind_point(const std::string& str_value)\n{\n    return string_deserialize_type_selector<T>::dispatch(str_value);\n}\n} \/\/ namespace string_serialization_detail\n\n\nnamespace pointer_detail\n{\ntemplate <class T>\ninline any\ngeneric_address_of_bind_point(any& value)\n{\n    return any(&(value.get<T>()));\n}\n\ntemplate <>\ninline any\ngeneric_address_of_bind_point<void>(any&)\n{\n    return any(nullptr);\n}\n\ntemplate <class T>\ninline any\ngeneric_dereference_bind_point(any& value)\n{\n    return any(*(value.get<T*>()));\n}\n\ntemplate <>\ninline any\ngeneric_dereference_bind_point<void>(any&)\n{\n    return any();\n}\n\n} \/\/ namespace pointer_detail\n\n} \/\/ namespace shadow\n\n#endif\n<commit_msg>Add remove_reference when unwrapping argument_array in constructor_dispatch. \tmodified:   include\/reflection_binding.hpp<commit_after>#ifndef REFLECTION_BINDING_HPP\n#define REFLECTION_BINDING_HPP\n\n\n#include <string>\n#include <type_traits>\n#include <utility>\n\n#include \"any.hpp\"\n#include <function_deduction.hpp>\n#include <member_variable_deduction.hpp>\n#include <type_list.hpp>\n#include <void_t.hpp>\n\n\nnamespace shadow\n{\n\/\/ free function signature\ntypedef any (*free_function_binding_signature)(any*);\n\/\/ member function signature\ntypedef any (*member_function_binding_signature)(any&, any*);\n\/\/ member variable getter\ntypedef any (*member_variable_get_binding_signature)(const any&);\n\/\/ member variable setter\ntypedef void (*member_variable_set_binding_signature)(any&, const any&);\n\/\/ constructor signature\ntypedef any (*constructor_binding_signature)(any*);\n\/\/ conversion signature\ntypedef any (*conversion_binding_signature)(const any&);\n\/\/ string serialize signature\ntypedef std::string (*string_serialization_signature)(const any&);\n\/\/ string deserialization signature\ntypedef any (*string_deserialization_signature)(const std::string&);\n\/\/ address of signature\ntypedef any (*address_of_signature)(any&);\n\/\/ dereference signature\ntypedef any (*dereference_signature)(any&);\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ generic bind point for free functions\n\/\/ has the same signature as function pointer free_function_binding_signature\n\/\/ which can be stored in the free_function_info struct\n\n\nnamespace free_function_detail\n{\n\/\/ necessary to handle void as return type differently when calling underlying\n\/\/ free function\ntemplate <class ReturnType>\nstruct return_type_specializer\n{\n    \/\/ dispatch: unpacks argument type list and sequence to correctly index into\n    \/\/ argument array and call get with the right types to retrieve raw values\n    \/\/ from the anys\n    template <class FunctionPointerType,\n              FunctionPointerType FunctionPointerValue,\n              class... ArgTypes,\n              std::size_t... ArgSeq>\n    static any\n    dispatch(any* argument_array,\n             metamusil::t_list::type_list<ArgTypes...>,\n             std::index_sequence<ArgSeq...>)\n    {\n        \/\/ necessary to remove reference from types as any only stores\n        \/\/ unqualified types, ie values only\n        return FunctionPointerValue(\n            argument_array[ArgSeq]\n                .get<typename std::remove_reference_t<ArgTypes>>()...);\n    }\n};\n\n\ntemplate <>\nstruct return_type_specializer<void>\n{\n    \/\/ dispatch: unpacks argument type list and sequence to correctly index into\n    \/\/ argument array and call get with the right types to retrieve raw values\n    \/\/ from the anys\n    template <class FunctionPointerType,\n              FunctionPointerType FunctionPointerValue,\n              class... ArgTypes,\n              std::size_t... ArgSeq>\n    static any\n    dispatch(any* argument_array,\n             metamusil::t_list::type_list<ArgTypes...>,\n             std::index_sequence<ArgSeq...>)\n    {\n        \/\/ necessary to remove reference from types as any only stores\n        \/\/ unqualified types, ie values only\n        FunctionPointerValue(\n            argument_array[ArgSeq]\n                .get<typename std::remove_reference_t<ArgTypes>>()...);\n\n        \/\/ return empty any, ie 'void'\n        return any();\n    }\n};\n\n\n\/\/ the value of the function pointer is stored at runtime in the template\n\/\/ overload set\n\/\/ this enables any function to be wrapped into uniform function signature that\n\/\/ can be stored homogenously at runtime\ntemplate <class FunctionPointerType, FunctionPointerType FunctionPointerValue>\nany\ngeneric_free_function_bind_point(any* argument_array)\n{\n    typedef metamusil::deduce_return_type_t<FunctionPointerType> return_type;\n    typedef metamusil::deduce_parameter_types_t<FunctionPointerType>\n        parameter_types;\n    \/\/ make integer sequence from type list\n    typedef metamusil::t_list::index_sequence_for_t<parameter_types>\n        parameter_sequence;\n\n    return return_type_specializer<return_type>::\n        template dispatch<FunctionPointerType, FunctionPointerValue>(\n            argument_array, parameter_types(), parameter_sequence());\n}\n} \/\/ namespace free_function_detail\n\n\nnamespace member_function_detail\n{\n\ntemplate <class ReturnType>\nstruct return_type_specializer\n{\n    template <class MemFunPointerType,\n              MemFunPointerType MemFunPointerValue,\n              class ObjectType,\n              class... ParamTypes,\n              std::size_t... ParamSequence>\n    static any\n    dispatch(any& object,\n             any* argument_array,\n             metamusil::t_list::type_list<ParamTypes...>,\n             std::index_sequence<ParamSequence...>)\n    {\n        return (object.get<ObjectType>().*MemFunPointerValue)(\n            argument_array[ParamSequence]\n                .get<std::remove_reference_t<ParamTypes>>()...);\n    }\n};\n\n\ntemplate <>\nstruct return_type_specializer<void>\n{\n    template <class MemFunPointerType,\n              MemFunPointerType MemFunPointerValue,\n              class ObjectType,\n              class... ParamTypes,\n              std::size_t... ParamSequence>\n    static any\n    dispatch(any& object,\n             any* argument_array,\n             metamusil::t_list::type_list<ParamTypes...>,\n             std::index_sequence<ParamSequence...>)\n    {\n        (object.get<ObjectType>().*MemFunPointerValue)(\n            argument_array[ParamSequence]\n                .get<std::remove_reference_t<ParamTypes>>()...);\n\n        return any();\n    }\n};\n\n\ntemplate <class MemFunPointerType, MemFunPointerType MemFunPointerValue>\nany\ngeneric_member_function_bind_point(any& object, any* argument_array)\n{\n    \/\/ deduce return type\n    typedef metamusil::deduce_return_type_t<MemFunPointerType> return_type;\n\n    \/\/ deduce parameter types\n    typedef metamusil::deduce_parameter_types_t<MemFunPointerType>\n        parameter_types;\n\n    \/\/ make integer sequence from parameter type list\n    typedef metamusil::t_list::index_sequence_for_t<parameter_types>\n        parameter_sequence;\n\n    \/\/ deduce object type\n    typedef metamusil::deduce_object_type_t<MemFunPointerType> object_type;\n\n    return return_type_specializer<return_type>::\n        template dispatch<MemFunPointerType, MemFunPointerValue, object_type>(\n            object, argument_array, parameter_types(), parameter_sequence());\n}\n} \/\/ namespace member_function_detail\n\n\nnamespace member_variable_detail\n{\n\ntemplate <class MemVarPointerType,\n          MemVarPointerType MemVarPointerValue,\n          class ObjectType,\n          class MemVarType>\nany\nget_dispatch(const any& object)\n{\n    return (object.get<ObjectType>().*MemVarPointerValue);\n}\n\ntemplate <class MemVarPointerType,\n          MemVarPointerType MemVarPointerValue,\n          class ObjectType,\n          class MemVarType>\nvoid\nset_dispatch(any& object, const any& value)\n{\n    (object.get<ObjectType>().*MemVarPointerValue) = value.get<MemVarType>();\n}\n\n\ntemplate <class MemVarPointerType, MemVarPointerType MemVarPointerValue>\nany\ngeneric_member_variable_get_bind_point(const any& object)\n{\n    typedef metamusil::deduce_member_variable_object_type_t<MemVarPointerType>\n        object_type;\n    typedef metamusil::deduce_member_variable_type_t<MemVarPointerType>\n        member_variable_type;\n\n    return get_dispatch<MemVarPointerType,\n                        MemVarPointerValue,\n                        object_type,\n                        member_variable_type>(object);\n}\n\n\ntemplate <class MemVarPointerType, MemVarPointerType MemVarPointerValue>\nvoid\ngeneric_member_variable_set_bind_point(any& object, const any& value)\n{\n    typedef metamusil::deduce_member_variable_object_type_t<MemVarPointerType>\n        object_type;\n    typedef metamusil::deduce_member_variable_type_t<MemVarPointerType>\n        member_variable_type;\n\n    return set_dispatch<MemVarPointerType,\n                        MemVarPointerValue,\n                        object_type,\n                        member_variable_type>(object, value);\n}\n} \/\/ namespace member_variable_detail\n\n\nnamespace constructor_detail\n{\n\n\/\/ purpose of braced_init_selector is to attempt to use constructor T(...) if\n\/\/ available, otherwise fall back to braced init list initialization\ntemplate <class, class T, class... ParamTypes>\nstruct braced_init_selector_impl\n{\n    template <std::size_t... Seq>\n    static any\n    constructor_dispatch(any* argument_array, std::index_sequence<Seq...>)\n    {\n        any out =\n            T{argument_array[Seq]\n                  .get<typename std::remove_reference<ParamTypes>::type>()...};\n        return out;\n    }\n};\n\ntemplate <class T, class... ParamTypes>\nstruct braced_init_selector_impl<\n    metamusil::void_t<decltype(T(std::declval<ParamTypes>()...))>,\n    T,\n    ParamTypes...>\n{\n    template <std::size_t... Seq>\n    static any\n    constructor_dispatch(any* argument_array, std::index_sequence<Seq...>)\n    {\n        any out =\n            T(argument_array[Seq]\n                  .get<typename std::remove_reference<ParamTypes>::type>()...);\n        return out;\n    }\n};\n\ntemplate <class T, class... ParamTypes>\nusing braced_init_selector = braced_init_selector_impl<void, T, ParamTypes...>;\n\n\ntemplate <class T, class... ParamTypes>\nany\ngeneric_constructor_bind_point(any* argument_array)\n{\n    typedef std::index_sequence_for<ParamTypes...> param_sequence;\n\n    return braced_init_selector<T, ParamTypes...>::constructor_dispatch(\n        argument_array, param_sequence());\n}\n} \/\/ namespace constructor_detail\n\n\nnamespace conversion_detail\n{\ntemplate <class TargetType, class SourceType, class = void>\nstruct conversion_specializer;\n\ntemplate <>\nstruct conversion_specializer<void, void>;\n\ntemplate <class TargetType, class SourceType>\nstruct conversion_specializer<\n    TargetType,\n    SourceType,\n    std::enable_if_t<std::is_convertible<SourceType, TargetType>::value>>\n{\n    static any\n    dispatch(const any& src)\n    {\n        TargetType temp = static_cast<TargetType>(src.get<SourceType>());\n        return temp;\n    }\n};\n\ntemplate <class TargetType, class SourceType>\nany\ngeneric_conversion_bind_point(const any& src)\n{\n    return conversion_specializer<TargetType, SourceType>::dispatch(src);\n}\n} \/\/ namespace conversion_detail\n\n\nnamespace string_serialization_detail\n{\n\ntemplate <class T, class = void>\nstruct string_serialize_type_selector;\n\ntemplate <class T>\nstruct string_serialize_type_selector<\n    T,\n    std::enable_if_t<std::is_arithmetic<T>::value>>\n{\n    static std::string\n    dispatch(const any& value)\n    {\n        return std::to_string(value.get<T>());\n    }\n};\n\ntemplate <>\nstruct string_serialize_type_selector<std::string>\n{\n    static std::string\n    dispatch(const any& value)\n    {\n        return value.get<std::string>();\n    }\n};\n\ntemplate <>\nstruct string_serialize_type_selector<char>\n{\n    static std::string\n    dispatch(const any& value)\n    {\n        std::string out;\n        out.push_back(value.get<char>());\n        return out;\n    }\n};\n\ntemplate <>\nstruct string_serialize_type_selector<void>\n{\n    static std::string\n    dispatch(const any&)\n    {\n        return \"empty\";\n    }\n};\n\ntemplate <class T>\nstd::string\ngeneric_string_serialization_bind_point(const any& value)\n{\n    return string_serialize_type_selector<T>::dispatch(value);\n}\n\n\ntemplate <class T, class = void>\nstruct string_deserialize_type_selector;\n\ntemplate <class T>\nstruct string_deserialize_type_selector<\n    T,\n    std::enable_if_t<std::is_arithmetic<T>::value>>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        T out = std::stold(str_value);\n        return out;\n    }\n};\n\n\ntemplate <>\nstruct string_deserialize_type_selector<char>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return str_value[0];\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<std::string>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return str_value;\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<int>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stoi(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<long>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stol(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<long long>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stoll(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<unsigned long>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stoul(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<unsigned long long>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stoull(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<float>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stof(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<double>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stod(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<long double>\n{\n    static any\n    dispatch(const std::string& str_value)\n    {\n        return std::stold(str_value);\n    }\n};\n\ntemplate <>\nstruct string_deserialize_type_selector<void>\n{\n    static any\n    dispatch(const std::string&)\n    {\n        return shadow::any();\n    }\n};\n\n\ntemplate <class T>\nany\ngeneric_string_deserialization_bind_point(const std::string& str_value)\n{\n    return string_deserialize_type_selector<T>::dispatch(str_value);\n}\n} \/\/ namespace string_serialization_detail\n\n\nnamespace pointer_detail\n{\ntemplate <class T>\ninline any\ngeneric_address_of_bind_point(any& value)\n{\n    return any(&(value.get<T>()));\n}\n\ntemplate <>\ninline any\ngeneric_address_of_bind_point<void>(any&)\n{\n    return any(nullptr);\n}\n\ntemplate <class T>\ninline any\ngeneric_dereference_bind_point(any& value)\n{\n    return any(*(value.get<T*>()));\n}\n\ntemplate <>\ninline any\ngeneric_dereference_bind_point<void>(any&)\n{\n    return any();\n}\n\n} \/\/ namespace pointer_detail\n\n} \/\/ namespace shadow\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/**\n\t@file\n\t@brief operator class\n\t@author MITSUNARI Shigeo(@herumi)\n\t@license modified new BSD license\n\thttp:\/\/opensource.org\/licenses\/BSD-3-Clause\n*\/\n#include <mcl\/op.hpp>\n#include <mcl\/util.hpp>\n#ifdef _MSC_VER\n\t#ifndef MCL_FORCE_INLINE\n\t\t#define MCL_FORCE_INLINE __forceinline\n\t#endif\n\t#pragma warning(push)\n\t#pragma warning(disable : 4714)\n#else\n\t#ifndef MCL_FORCE_INLINE\n\t\t#define MCL_FORCE_INLINE __attribute__((always_inline))\n\t#endif\n#endif\n\nnamespace mcl { namespace fp {\n\ntemplate<class T>\nstruct Empty {};\n\n\/*\n\tT must have add, sub, mul, inv, neg\n*\/\ntemplate<class T, class E = Empty<T> >\nstruct Operator : E {\n\ttemplate<class S> MCL_FORCE_INLINE T& operator+=(const S& rhs) { T::add(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> MCL_FORCE_INLINE T& operator-=(const S& rhs) { T::sub(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator+(const T& a, const S& b) { T c; T::add(c, a, b); return c; }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator-(const T& a, const S& b) { T c; T::sub(c, a, b); return c; }\n\ttemplate<class S> MCL_FORCE_INLINE T& operator*=(const S& rhs) { T::mul(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator*(const T& a, const S& b) { T c; T::mul(c, a, b); return c; }\n\tMCL_FORCE_INLINE T& operator\/=(const T& rhs) { T c; T::inv(c, rhs); T::mul(static_cast<T&>(*this), static_cast<const T&>(*this), c); return static_cast<T&>(*this); }\n\tstatic MCL_FORCE_INLINE void div(T& c, const T& a, const T& b) { T t; T::inv(t, b); T::mul(c, a, t); }\n\tfriend MCL_FORCE_INLINE T operator\/(const T& a, const T& b) { T c; T::inv(c, b); c *= a; return c; }\n\tMCL_FORCE_INLINE T operator-() const { T c; T::neg(c, static_cast<const T&>(*this)); return c; }\n\ttemplate<class tag2, size_t maxBitSize2, template<class _tag, size_t _maxBitSize> class FpT>\n\tstatic void pow(T& z, const T& x, const FpT<tag2, maxBitSize2>& y)\n\t{\n\t\tfp::Block b;\n\t\ty.getBlock(b);\n\t\tpowArray(z, x, b.p, b.n, false);\n\t}\n\tstatic void pow(T& z, const T& x, int y)\n\t{\n\t\tconst Unit u = abs(y);\n\t\tpowArray(z, x, &u, 1, y < 0);\n\t}\n\tstatic void pow(T& z, const T& x, const mpz_class& y)\n\t{\n\t\tpowArray(z, x, gmp::getUnit(y), abs(y.get_mpz_t()->_mp_size), y < 0);\n\t}\nprivate:\n\tstatic void powArray(T& z, const T& x, const Unit *y, size_t yn, bool isNegative)\n\t{\n\t\tT tmp;\n\t\tconst T *px = &x;\n\t\tif (&z == &x) {\n\t\t\ttmp = x;\n\t\t\tpx = &tmp;\n\t\t}\n\t\tz = 1;\n\t\tfp::powGeneric(z, *px, y, yn, T::mul, T::sqr, (void (*)(T&, const T&))0);\n\t\tif (isNegative) {\n\t\t\tT::inv(z, z);\n\t\t}\n\t}\n};\n\n} } \/\/ mcl::fp\n\n<commit_msg>Expose const time exponentiation for fields<commit_after>#pragma once\n\/**\n\t@file\n\t@brief operator class\n\t@author MITSUNARI Shigeo(@herumi)\n\t@license modified new BSD license\n\thttp:\/\/opensource.org\/licenses\/BSD-3-Clause\n*\/\n#include <mcl\/op.hpp>\n#include <mcl\/util.hpp>\n#ifdef _MSC_VER\n\t#ifndef MCL_FORCE_INLINE\n\t\t#define MCL_FORCE_INLINE __forceinline\n\t#endif\n\t#pragma warning(push)\n\t#pragma warning(disable : 4714)\n#else\n\t#ifndef MCL_FORCE_INLINE\n\t\t#define MCL_FORCE_INLINE __attribute__((always_inline))\n\t#endif\n#endif\n\nnamespace mcl { namespace fp {\n\ntemplate<class T>\nstruct Empty {};\n\n\/*\n\tT must have add, sub, mul, inv, neg\n*\/\ntemplate<class T, class E = Empty<T> >\nstruct Operator : E {\n\ttemplate<class S> MCL_FORCE_INLINE T& operator+=(const S& rhs) { T::add(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> MCL_FORCE_INLINE T& operator-=(const S& rhs) { T::sub(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator+(const T& a, const S& b) { T c; T::add(c, a, b); return c; }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator-(const T& a, const S& b) { T c; T::sub(c, a, b); return c; }\n\ttemplate<class S> MCL_FORCE_INLINE T& operator*=(const S& rhs) { T::mul(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator*(const T& a, const S& b) { T c; T::mul(c, a, b); return c; }\n\tMCL_FORCE_INLINE T& operator\/=(const T& rhs) { T c; T::inv(c, rhs); T::mul(static_cast<T&>(*this), static_cast<const T&>(*this), c); return static_cast<T&>(*this); }\n\tstatic MCL_FORCE_INLINE void div(T& c, const T& a, const T& b) { T t; T::inv(t, b); T::mul(c, a, t); }\n\tfriend MCL_FORCE_INLINE T operator\/(const T& a, const T& b) { T c; T::inv(c, b); c *= a; return c; }\n\tMCL_FORCE_INLINE T operator-() const { T c; T::neg(c, static_cast<const T&>(*this)); return c; }\n\ttemplate<class tag2, size_t maxBitSize2, template<class _tag, size_t _maxBitSize> class FpT>\n\tstatic void pow(T& z, const T& x, const FpT<tag2, maxBitSize2>& y, bool constTime = false)\n\t{\n\t\tfp::Block b;\n\t\ty.getBlock(b);\n\t\tpowArray(z, x, b.p, b.n, false, constTime);\n\t}\n\tstatic void pow(T& z, const T& x, int y, bool constTime = false)\n\t{\n\t\tconst Unit u = abs(y);\n\t\tpowArray(z, x, &u, 1, y < 0, constTime);\n\t}\n\tstatic void pow(T& z, const T& x, const mpz_class& y, bool constTime = false)\n\t{\n\t\tpowArray(z, x, gmp::getUnit(y), abs(y.get_mpz_t()->_mp_size), y < 0, constTime);\n\t}\nprivate:\n\tstatic void powArray(T& z, const T& x, const Unit *y, size_t yn, bool isNegative, bool constTime)\n\t{\n\t\tT tmp;\n\t\tconst T *px = &x;\n\t\tif (&z == &x) {\n\t\t\ttmp = x;\n\t\t\tpx = &tmp;\n\t\t}\n\t\tz = 1;\n\t\tfp::powGeneric(z, *px, y, yn, T::mul, T::sqr, (void (*)(T&, const T&))0, constTime);\n\t\tif (isNegative) {\n\t\t\tT::inv(z, z);\n\t\t}\n\t}\n};\n\n} } \/\/ mcl::fp\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2014 Baidu, Inc.G\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ Authors: Lei He (helei@qiyi.com)\n\n#include <cmath>\n#include <gflags\/gflags.h>\n#include \"brpc\/circuit_breaker.h\"\n\nnamespace brpc {\n\nDEFINE_int32(circuit_breaker_short_window_size, 100,\n    \"Short window sample size.\");\nDEFINE_int32(circuit_breaker_long_window_size, 1000,\n    \"Long window sample size.\");\nDEFINE_int32(circuit_breaker_short_window_error_percent, 5,\n    \"The maximum error rate allowed by the short window, ranging from 0-99.\");\nDEFINE_int32(circuit_breaker_long_window_error_percent, 3, \n    \"The maximum error rate allowed by the long window, ranging from 0-99.\");\nDEFINE_int32(circuit_breaker_min_error_cost_us, 100,\n    \"The minimum error_cost, when the ema of error cost is less than this \"\n    \"value, it will be set to zero.\");\n\nnamespace {\n\/\/ EPSILON is used to generate the smoothing coefficient when calculating EMA.\n\/\/ The larger the EPSILON, the larger the smoothing coefficient, which means \n\/\/ that the proportion of early data is larger.\n\/\/ smooth = pow(EPSILON, 1 \/ window_size), \n\/\/ eg: when window_size = 100,\n\/\/ EPSILON = 0.1, smooth = 0.9772\n\/\/ EPSILON = 0.3, smooth = 0.9880\n\/\/ when window_size = 30,\n\/\/ EPSILON = 0.1, smooth = 0.9261\n\/\/ EPSILON = 0.3, smooth = 0.9606\nconst double EPSILON = 0.1;\n}  \/\/ namepace\n\nCircuitBreaker::EmaErrorRecorder::EmaErrorRecorder(int window_size, \n                                                   int max_error_percent)\n    : _window_size(window_size)\n    , _max_error_percent(max_error_percent)\n    , _smooth(std::pow(EPSILON, 1.0\/window_size))\n    , _init_completed(false)\n    , _sample_count(0)\n    , _ema_error_cost(0)\n    , _ema_latency(0) \n    , _broken(false) {\n}\n\nbool CircuitBreaker::EmaErrorRecorder::OnCallEnd(int error_code, \n                                                 int64_t latency) {\n    if (_broken.load(butil::memory_order_relaxed)) {\n        return false;\n    }\n\n    int64_t ema_latency = 0;\n    bool healthy = false;\n    if (error_code == 0) {\n        ema_latency = UpdateLatency(latency);\n        healthy = UpdateErrorCost(0, ema_latency);\n    } else {\n        ema_latency = _ema_latency.load(butil::memory_order_relaxed);\n        healthy = UpdateErrorCost(latency, ema_latency);\n    }\n\n    int sample_count = _sample_count.fetch_add(1, butil::memory_order_relaxed);\n    bool init_completed = _init_completed.load(butil::memory_order_acquire);\n    if (!init_completed && sample_count >= _window_size) {\n        _init_completed.store(true, butil::memory_order_release);\n        init_completed = true;\n    }\n    \n    if (!init_completed) {\n        return true;\n    }\n    if (!healthy) {\n        _broken.store(true, butil::memory_order_relaxed);\n    }\n    return healthy;\n}\n\nvoid CircuitBreaker::EmaErrorRecorder::Reset() {\n    _init_completed.store(false, butil::memory_order_relaxed);\n    _sample_count.store(0, butil::memory_order_relaxed);\n    _ema_error_cost.store(0, butil::memory_order_relaxed);\n    _ema_latency.store(0, butil::memory_order_relaxed);\n    _broken.store(false, butil::memory_order_relaxed);\n}\n\nint64_t CircuitBreaker::EmaErrorRecorder::UpdateLatency(int64_t latency) {\n    while (true) {\n        int64_t ema_latency = _ema_latency.load(butil::memory_order_relaxed);\n        int64_t next_ema_latency = 0;\n        if (0 == ema_latency) {\n            next_ema_latency = latency;\n        } else {\n            next_ema_latency = ema_latency * _smooth + latency * (1 - _smooth);\n        }\n        if (_ema_latency.compare_exchange_weak(ema_latency, next_ema_latency)) {\n            return next_ema_latency;\n        }\n    }\n}\n\nbool CircuitBreaker::EmaErrorRecorder::UpdateErrorCost(int64_t error_cost, \n                                                       int64_t ema_latency) {\n    \/\/Errorous response\n    if (error_cost != 0) {\n        int64_t ema_error_cost = \n            _ema_error_cost.fetch_add(error_cost, butil::memory_order_relaxed);\n        ema_error_cost += error_cost; \n        int64_t max_error_cost = ema_latency * _window_size * \n            (_max_error_percent \/ 100.0) * (1.0 + EPSILON);\n        return ema_error_cost <= max_error_cost;\n    }\n\n    \/\/Ordinary response\n    while (true) {\n        int64_t ema_error_cost = \n            _ema_error_cost.load(butil::memory_order_relaxed);\n        if (ema_error_cost == 0) {\n            break;\n        } else if (ema_error_cost < FLAGS_circuit_breaker_min_error_cost_us) {\n            if (_ema_error_cost.compare_exchange_weak(\n                ema_error_cost, 0, butil::memory_order_relaxed)) {\n                break;\n            }\n        } else {\n            int64_t next_ema_error_cost = ema_error_cost * _smooth;\n            if (_ema_error_cost.compare_exchange_weak(\n                ema_error_cost, next_ema_error_cost)) {\n                break;\n            }\n        }\n    }\n    return true;\n}\n\nCircuitBreaker::CircuitBreaker()\n    : _long_window(FLAGS_circuit_breaker_long_window_size,\n                   FLAGS_circuit_breaker_long_window_error_percent)\n    , _short_window(FLAGS_circuit_breaker_short_window_size,\n                    FLAGS_circuit_breaker_short_window_error_percent) {\n}\n\nbool CircuitBreaker::OnCallEnd(int error_code, int64_t latency) {\n    return _long_window.OnCallEnd(error_code, latency) && \n           _short_window.OnCallEnd(error_code, latency);\n}\n\nvoid CircuitBreaker::Reset() {\n    _long_window.Reset();\n    _short_window.Reset();\n}\n\n}  \/\/ namespace brpc\n<commit_msg> Fix the isolation caused by the excessive latency of the timeout requests<commit_after>\/\/ Copyright (c) 2014 Baidu, Inc.G\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ Authors: Lei He (helei@qiyi.com)\n\n#include <cmath>\n#include <gflags\/gflags.h>\n#include \"brpc\/circuit_breaker.h\"\n\nnamespace brpc {\n\nDEFINE_int32(circuit_breaker_short_window_size, 100,\n    \"Short window sample size.\");\nDEFINE_int32(circuit_breaker_long_window_size, 1000,\n    \"Long window sample size.\");\nDEFINE_int32(circuit_breaker_short_window_error_percent, 5,\n    \"The maximum error rate allowed by the short window, ranging from 0-99.\");\nDEFINE_int32(circuit_breaker_long_window_error_percent, 3, \n    \"The maximum error rate allowed by the long window, ranging from 0-99.\");\nDEFINE_int32(circuit_breaker_min_error_cost_us, 100,\n    \"The minimum error_cost, when the ema of error cost is less than this \"\n    \"value, it will be set to zero.\");\nDEFINE_int32(circuit_breaker_max_failed_latency_mutliple, 2,\n    \"The maximum multiple of the latency of the failed request relative to \"\n    \"the average latency of the success requests.\");\n\nnamespace {\n\/\/ EPSILON is used to generate the smoothing coefficient when calculating EMA.\n\/\/ The larger the EPSILON, the larger the smoothing coefficient, which means \n\/\/ that the proportion of early data is larger.\n\/\/ smooth = pow(EPSILON, 1 \/ window_size), \n\/\/ eg: when window_size = 100,\n\/\/ EPSILON = 0.1, smooth = 0.9772\n\/\/ EPSILON = 0.3, smooth = 0.9880\n\/\/ when window_size = 1000,\n\/\/ EPSILON = 0.1, smooth = 0.9977\n\/\/ EPSILON = 0.3, smooth = 0.9987\nconst double EPSILON = 0.1;\n}  \/\/ namepace\n\nCircuitBreaker::EmaErrorRecorder::EmaErrorRecorder(int window_size, \n                                                   int max_error_percent)\n    : _window_size(window_size)\n    , _max_error_percent(max_error_percent)\n    , _smooth(std::pow(EPSILON, 1.0\/window_size))\n    , _init_completed(false)\n    , _sample_count(0)\n    , _ema_error_cost(0)\n    , _ema_latency(0) \n    , _broken(false) {\n}\n\nbool CircuitBreaker::EmaErrorRecorder::OnCallEnd(int error_code, \n                                                 int64_t latency) {\n    if (_broken.load(butil::memory_order_relaxed)) {\n        return false;\n    }\n\n    int64_t ema_latency = 0;\n    bool healthy = false;\n    if (error_code == 0) {\n        ema_latency = UpdateLatency(latency);\n        healthy = UpdateErrorCost(0, ema_latency);\n    } else {\n        ema_latency = _ema_latency.load(butil::memory_order_relaxed);\n        healthy = UpdateErrorCost(latency, ema_latency);\n    }\n\n    int sample_count = _sample_count.fetch_add(1, butil::memory_order_relaxed);\n    bool init_completed = _init_completed.load(butil::memory_order_acquire);\n    if (!init_completed && sample_count >= _window_size) {\n        _init_completed.store(true, butil::memory_order_release);\n        init_completed = true;\n    }\n    \n    if (!init_completed) {\n        return true;\n    }\n    if (!healthy) {\n        _broken.store(true, butil::memory_order_relaxed);\n    }\n    return healthy;\n}\n\nvoid CircuitBreaker::EmaErrorRecorder::Reset() {\n    _init_completed.store(false, butil::memory_order_relaxed);\n    _sample_count.store(0, butil::memory_order_relaxed);\n    _ema_error_cost.store(0, butil::memory_order_relaxed);\n    _ema_latency.store(0, butil::memory_order_relaxed);\n    _broken.store(false, butil::memory_order_relaxed);\n}\n\nint64_t CircuitBreaker::EmaErrorRecorder::UpdateLatency(int64_t latency) {\n    while (true) {\n        int64_t ema_latency = _ema_latency.load(butil::memory_order_relaxed);\n        int64_t next_ema_latency = 0;\n        if (0 == ema_latency) {\n            next_ema_latency = latency;\n        } else {\n            next_ema_latency = ema_latency * _smooth + latency * (1 - _smooth);\n        }\n        if (_ema_latency.compare_exchange_weak(ema_latency, next_ema_latency)) {\n            return next_ema_latency;\n        }\n    }\n}\n\nbool CircuitBreaker::EmaErrorRecorder::UpdateErrorCost(int64_t error_cost, \n                                                       int64_t ema_latency) {\n    const int max_mutilple = FLAGS_circuit_breaker_max_failed_latency_mutliple;\n    error_cost = std::min(ema_latency * max_mutilple, error_cost);\n    \/\/Errorous response\n    if (error_cost != 0) {\n        int64_t ema_error_cost = \n            _ema_error_cost.fetch_add(error_cost, butil::memory_order_relaxed);\n        ema_error_cost += error_cost; \n        int64_t max_error_cost = ema_latency * _window_size * \n            (_max_error_percent \/ 100.0) * (1.0 + EPSILON);\n        return ema_error_cost <= max_error_cost;\n    }\n\n    \/\/Ordinary response\n    while (true) {\n        int64_t ema_error_cost = \n            _ema_error_cost.load(butil::memory_order_relaxed);\n        if (ema_error_cost == 0) {\n            break;\n        } else if (ema_error_cost < FLAGS_circuit_breaker_min_error_cost_us) {\n            if (_ema_error_cost.compare_exchange_weak(\n                ema_error_cost, 0, butil::memory_order_relaxed)) {\n                break;\n            }\n        } else {\n            int64_t next_ema_error_cost = ema_error_cost * _smooth;\n            if (_ema_error_cost.compare_exchange_weak(\n                ema_error_cost, next_ema_error_cost)) {\n                break;\n            }\n        }\n    }\n    return true;\n}\n\nCircuitBreaker::CircuitBreaker()\n    : _long_window(FLAGS_circuit_breaker_long_window_size,\n                   FLAGS_circuit_breaker_long_window_error_percent)\n    , _short_window(FLAGS_circuit_breaker_short_window_size,\n                    FLAGS_circuit_breaker_short_window_error_percent) {\n}\n\nbool CircuitBreaker::OnCallEnd(int error_code, int64_t latency) {\n    return _long_window.OnCallEnd(error_code, latency) && \n           _short_window.OnCallEnd(error_code, latency);\n}\n\nvoid CircuitBreaker::Reset() {\n    _long_window.Reset();\n    _short_window.Reset();\n}\n\n}  \/\/ namespace brpc\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 <bsoncxx\/config\/prelude.hpp>\n\n#include <type_traits>\n\nnamespace bsoncxx {\nBSONCXX_INLINE_NAMESPACE_BEGIN\nnamespace util {\nnamespace functor {\n\ntemplate <typename, typename>\nstruct build_free_function;\n\ntemplate <typename F, typename R, typename... Args>\nstruct build_free_function<F, R(Args...)> {\n    typedef R (*type)(Args...);\n};\n\ntemplate <typename, typename>\nstruct build_class_function;\n\ntemplate <typename C, typename R, typename... Args>\nstruct build_class_function<C, R(Args...)> {\n    typedef R (C::*type)(Args...);\n};\n\ntemplate <typename>\nstruct strip_cv_from_class_function;\n\ntemplate <typename C, typename R, typename... Args>\nstruct strip_cv_from_class_function<R (C::*)(Args...)> {\n    typedef R (C::*type)(Args...);\n};\n\ntemplate <typename C, typename R, typename... Args>\nstruct strip_cv_from_class_function<R (C::*)(Args...) const> {\n    typedef R (C::*type)(Args...);\n};\n\ntemplate <typename C, typename R, typename... Args>\nstruct strip_cv_from_class_function<R (C::*)(Args...) volatile> {\n    typedef R (C::*type)(Args...);\n};\n\ntemplate <typename C, typename S>\nstruct is_class_method_with_signature {\n    typedef int yes;\n    typedef char no;\n\n    \/\/ T stands for SFINAE\n    template <typename T>\n    static typename std::enable_if<std::is_convertible<typename build_class_function<C, S>::type,\n                                                       typename strip_cv_from_class_function<\n                                                           decltype(&T::operator())>::type>::value,\n                                   yes>::type\n        sfinae(void *);\n\n    template <typename>\n    static no sfinae(...);\n\n    static bool constexpr value = sizeof(sfinae<C>(nullptr)) == sizeof(yes);\n};\n\ntemplate <typename F, typename S>\nstruct is_function_with_signature\n    : std::is_convertible<F, typename build_free_function<F, S>::type> {};\n\ntemplate <typename C, typename S, bool>\nstruct is_functor_impl : is_class_method_with_signature<C, S> {};\n\ntemplate <typename F, typename S>\nstruct is_functor_impl<F, S, false> : is_function_with_signature<F, S> {};\n\n}  \/\/ namespace functor\n\ntemplate <typename C, typename S>\nstruct is_functor : functor::is_functor_impl<C, S, std::is_class<C>::value> {};\n\n}  \/\/ namespace util\nBSONCXX_INLINE_NAMESPACE_END\n}  \/\/ namespace bsoncxx\n\n\n#include <bsoncxx\/config\/postlude.hpp>\n<commit_msg>CXX-616 simplify is_functor<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 <bsoncxx\/config\/prelude.hpp>\n\n#include <type_traits>\n\nnamespace bsoncxx {\nBSONCXX_INLINE_NAMESPACE_BEGIN\nnamespace util {\n\ntemplate <typename FunctionLike, typename Signature>\nusing is_functor = std::is_convertible<FunctionLike, std::function<Signature>>;\n\n}  \/\/ namespace util\nBSONCXX_INLINE_NAMESPACE_END\n}  \/\/ namespace bsoncxx\n\n#include <bsoncxx\/config\/postlude.hpp>\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <string>\n#include <iostream>\n#include <streambuf>\n#include <sstream>\n\n#include \"gtest\/gtest.h\"\n\n#include \"commandline.h\"\n\n#define REQUIRED_TABLES \"-I\", \"a\", \"-O\", \"b\"\n#define REQUIRED_STORAGE \"-s\", \"sqlite\", \"--sqlite_file\", \"abc\"\n#define REQUIRED REQUIRED_STORAGE, REQUIRED_TABLES\n\n\nclass ServerCommandline : public ::testing::Test\n{\nprivate:\n\tstd::stringstream _std_out_stream;\n\tstd::stringstream _std_err_stream;\n\tstd::streambuf *_orig_out;\n\tstd::streambuf *_orig_err;\n\npublic:\n\tServerCommandline()\n\t:\n\t\t_std_out_stream(),\n\t\t_std_err_stream(),\n\t\t_orig_out(std::cout.rdbuf()),\n\t\t_orig_err(std::cerr.rdbuf())\n\t{\n\t\tstd::cout.rdbuf(_std_out_stream.rdbuf());\n\t\tstd::cerr.rdbuf(_std_err_stream.rdbuf());\n\t}\n\n\t~ServerCommandline()\n\t{\n\t\tstd::cout.rdbuf(_orig_out);\n\t\tstd::cerr.rdbuf(_orig_err);\n\t}\n\n\tstd::string output() const\n\t{\n\t\treturn _std_out_stream.str();\n\t}\n\n\tstd::string error() const\n\t{\n\t\treturn _std_err_stream.str();\n\t}\n};\n\n\n\/\/ Test if -h prints help and exits\nTEST_F(ServerCommandline, test_help) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-h\"};\n\n\tEXPECT_FALSE(cmd.parse(2, argv));\n\n\tEXPECT_NE(output().find(\"Print help message.\"), std::string::npos);\n}\n\n\n\/\/ Test if default bind works\nTEST_F(ServerCommandline, test_bind_default) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(1 + 4 + 4, argv));\n\n\tstd::vector<std::string> addr(cmd.addresses());\n\tEXPECT_EQ(addr.size(), 1U);\n\tEXPECT_EQ(addr[0], \"*:3444\");\n}\n\n\n\/\/ Test if we can bind a single address\nTEST_F(ServerCommandline, test_bind_single) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-b\", \"abcde\", REQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4 + 4, argv));\n\n\tstd::vector<std::string> addr(cmd.addresses());\n\tEXPECT_EQ(addr.size(), 1U);\n\tEXPECT_EQ(addr[0], \"abcde\");\n}\n\n\n\/\/ Test if we can bind multiple addresses\nTEST_F(ServerCommandline, test_bind_multi) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\",\n\t\t\"-b\", \"abcde\",\n\t\t\"--bind\", \"1234\",\n\t\t\"-b\", \"12ab\",\n\t\tREQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(7 + 4 + 4, argv));\n\n\tstd::vector<std::string> addr(cmd.addresses());\n\tEXPECT_EQ(addr.size(), 3U);\n\tEXPECT_EQ(addr[0], \"abcde\");\n\tEXPECT_EQ(addr[1], \"1234\");\n\tEXPECT_EQ(addr[2], \"12ab\");\n}\n\n\n\/\/ Test if we get an error if bind arg is omitted\nTEST_F(ServerCommandline, test_bind_missing) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED, \"-b\"};\n\n\tEXPECT_FALSE(cmd.parse(2 + 4 + 4, argv));\n\tEXPECT_NE(error().find(\"the required argument for \"\n\t\t\t       \"option '--bind' is missing\"),\n\t\t  std::string::npos);\n}\n\n\n\/\/ Test missing storage type\nTEST_F(ServerCommandline, test_missing_storage_type) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED_TABLES};\n\n\tEXPECT_FALSE(cmd.parse(1 + 4, argv));\n\tEXPECT_NE(error().find(\"the option '--storage' \"\n\t\t\t       \"is required but missing\"),\n\t\t  std::string::npos);\n}\n\n\n\/\/ Test for sqlite storage type\nTEST_F(ServerCommandline, test_storage_sqlite) {\n\t{\n\t\ttraffic::Commandline cmd;\n\t\tconst char* argv[] = {\"foobar\", REQUIRED_TABLES,\n\t\t\t\t      \"-s\", \"sqlite\", \"--sqlite_file\", \"ab\"};\n\n\t\tEXPECT_TRUE(cmd.parse(5 + 4, argv));\n\t\tEXPECT_EQ(cmd.storage_type(), traffic::Commandline::SQLITE);\n\t\tEXPECT_EQ(cmd.sqlite_file(), \"ab\");\n\t}\n\t{\n\t\ttraffic::Commandline cmd;\n\t\tconst char* argv[] = {\"foobar\", REQUIRED_TABLES,\n\t\t\t\t      \"-s\", \"sqlite\"};\n\n\t\tEXPECT_FALSE(cmd.parse(3 + 4, argv));\n\t\tEXPECT_NE(error().find(\"option --sqlite_file missing for \"\n\t\t\t\t       \"storage_type sqlite!\"),\n\t\t\t  std::string::npos);\n\t}\n}\n\n\n\/\/ Test for mysql storage type\nTEST_F(ServerCommandline, test_storage_mysql) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-s\", \"mysql\", REQUIRED_TABLES};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4, argv));\n\n\tEXPECT_EQ(cmd.storage_type(), traffic::Commandline::MYSQL);\n}\n\n\n\/\/ Test for postgres storage type\nTEST_F(ServerCommandline, test_storage_postgres) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-s\", \"postgres\", REQUIRED_TABLES};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4, argv));\n\n\tEXPECT_EQ(cmd.storage_type(), traffic::Commandline::POSTGRES);\n}\n\n\n\/\/ Test for invalid storage type\nTEST_F(ServerCommandline, test_storage_invalid) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-s\", \"peng\", REQUIRED_TABLES};\n\n\tEXPECT_FALSE(cmd.parse(3 + 4, argv));\n\n\tEXPECT_NE(error().find(\"the argument for option \"\n\t\t\t       \"'--storage' is invalid\"),\n\t\t  std::string::npos);\n}\n\n\n\/\/ Test for sqlite storage type\nTEST_F(ServerCommandline, test_worker_default) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4 + 4, argv));\n\n\tEXPECT_EQ(cmd.worker(), 2U);\n}\n\n\n\/\/ Test for sqlite storage type\nTEST_F(ServerCommandline, test_worker_count) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-w\", \"5\", REQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4 + 4, argv));\n\n\tEXPECT_EQ(cmd.worker(), 5U);\n}\n\n\n\/\/ Test output table missing\nTEST_F(ServerCommandline, test_tables_out_missing) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED_STORAGE, \"-I\", \"a\"};\n\n\tEXPECT_FALSE(cmd.parse(3 + 4, argv));\n\tEXPECT_NE(error().find(\"the option '--table_out' is \"\n\t\t\t\t\"required but missing\"),\n\t\t\tstd::string::npos);\n}\n\n\n\/\/ Test input table missing\nTEST_F(ServerCommandline, test_tables_in_missing) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED_STORAGE, \"-O\", \"a\"};\n\n\tEXPECT_FALSE(cmd.parse(3 + 4, argv));\n\tEXPECT_NE(error().find(\"the option '--table_in' is \"\n\t\t\t\t\"required but missing\"),\n\t\t\tstd::string::npos);\n}\n\n\n\/\/ Test tables\nTEST_F(ServerCommandline, test_tables) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED_STORAGE,\n\t\t\t      \"-O\", \"a\", \"-I\", \"b\"};\n\n\tEXPECT_TRUE(cmd.parse(5 + 4, argv));\n\tEXPECT_EQ(cmd.table_outgoing(), \"a\");\n\tEXPECT_EQ(cmd.table_incomming(), \"b\");\n}\n<commit_msg>Fix wrong argument count<commit_after>#include <vector>\n#include <string>\n#include <iostream>\n#include <streambuf>\n#include <sstream>\n\n#include \"gtest\/gtest.h\"\n\n#include \"commandline.h\"\n\n#define REQUIRED_TABLES \"-I\", \"a\", \"-O\", \"b\"\n#define REQUIRED_STORAGE \"-s\", \"sqlite\", \"--sqlite_file\", \"abc\"\n#define REQUIRED REQUIRED_STORAGE, REQUIRED_TABLES\n\n\nclass ServerCommandline : public ::testing::Test\n{\nprivate:\n\tstd::stringstream _std_out_stream;\n\tstd::stringstream _std_err_stream;\n\tstd::streambuf *_orig_out;\n\tstd::streambuf *_orig_err;\n\npublic:\n\tServerCommandline()\n\t:\n\t\t_std_out_stream(),\n\t\t_std_err_stream(),\n\t\t_orig_out(std::cout.rdbuf()),\n\t\t_orig_err(std::cerr.rdbuf())\n\t{\n\t\tstd::cout.rdbuf(_std_out_stream.rdbuf());\n\t\tstd::cerr.rdbuf(_std_err_stream.rdbuf());\n\t}\n\n\t~ServerCommandline()\n\t{\n\t\tstd::cout.rdbuf(_orig_out);\n\t\tstd::cerr.rdbuf(_orig_err);\n\t}\n\n\tstd::string output() const\n\t{\n\t\treturn _std_out_stream.str();\n\t}\n\n\tstd::string error() const\n\t{\n\t\treturn _std_err_stream.str();\n\t}\n};\n\n\n\/\/ Test if -h prints help and exits\nTEST_F(ServerCommandline, test_help) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-h\"};\n\n\tEXPECT_FALSE(cmd.parse(2, argv));\n\n\tEXPECT_NE(output().find(\"Print help message.\"), std::string::npos);\n}\n\n\n\/\/ Test if default bind works\nTEST_F(ServerCommandline, test_bind_default) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(1 + 4 + 4, argv));\n\n\tstd::vector<std::string> addr(cmd.addresses());\n\tEXPECT_EQ(addr.size(), 1U);\n\tEXPECT_EQ(addr[0], \"*:3444\");\n}\n\n\n\/\/ Test if we can bind a single address\nTEST_F(ServerCommandline, test_bind_single) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-b\", \"abcde\", REQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4 + 4, argv));\n\n\tstd::vector<std::string> addr(cmd.addresses());\n\tEXPECT_EQ(addr.size(), 1U);\n\tEXPECT_EQ(addr[0], \"abcde\");\n}\n\n\n\/\/ Test if we can bind multiple addresses\nTEST_F(ServerCommandline, test_bind_multi) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\",\n\t\t\"-b\", \"abcde\",\n\t\t\"--bind\", \"1234\",\n\t\t\"-b\", \"12ab\",\n\t\tREQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(7 + 4 + 4, argv));\n\n\tstd::vector<std::string> addr(cmd.addresses());\n\tEXPECT_EQ(addr.size(), 3U);\n\tEXPECT_EQ(addr[0], \"abcde\");\n\tEXPECT_EQ(addr[1], \"1234\");\n\tEXPECT_EQ(addr[2], \"12ab\");\n}\n\n\n\/\/ Test if we get an error if bind arg is omitted\nTEST_F(ServerCommandline, test_bind_missing) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED, \"-b\"};\n\n\tEXPECT_FALSE(cmd.parse(2 + 4 + 4, argv));\n\tEXPECT_NE(error().find(\"the required argument for \"\n\t\t\t       \"option '--bind' is missing\"),\n\t\t  std::string::npos);\n}\n\n\n\/\/ Test missing storage type\nTEST_F(ServerCommandline, test_missing_storage_type) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED_TABLES};\n\n\tEXPECT_FALSE(cmd.parse(1 + 4, argv));\n\tEXPECT_NE(error().find(\"the option '--storage' \"\n\t\t\t       \"is required but missing\"),\n\t\t  std::string::npos);\n}\n\n\n\/\/ Test for sqlite storage type\nTEST_F(ServerCommandline, test_storage_sqlite) {\n\t{\n\t\ttraffic::Commandline cmd;\n\t\tconst char* argv[] = {\"foobar\", REQUIRED_TABLES,\n\t\t\t\t      \"-s\", \"sqlite\", \"--sqlite_file\", \"ab\"};\n\n\t\tEXPECT_TRUE(cmd.parse(5 + 4, argv));\n\t\tEXPECT_EQ(cmd.storage_type(), traffic::Commandline::SQLITE);\n\t\tEXPECT_EQ(cmd.sqlite_file(), \"ab\");\n\t}\n\t{\n\t\ttraffic::Commandline cmd;\n\t\tconst char* argv[] = {\"foobar\", REQUIRED_TABLES,\n\t\t\t\t      \"-s\", \"sqlite\"};\n\n\t\tEXPECT_FALSE(cmd.parse(3 + 4, argv));\n\t\tEXPECT_NE(error().find(\"option --sqlite_file missing for \"\n\t\t\t\t       \"storage_type sqlite!\"),\n\t\t\t  std::string::npos);\n\t}\n}\n\n\n\/\/ Test for mysql storage type\nTEST_F(ServerCommandline, test_storage_mysql) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-s\", \"mysql\", REQUIRED_TABLES};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4, argv));\n\n\tEXPECT_EQ(cmd.storage_type(), traffic::Commandline::MYSQL);\n}\n\n\n\/\/ Test for postgres storage type\nTEST_F(ServerCommandline, test_storage_postgres) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-s\", \"postgres\", REQUIRED_TABLES};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4, argv));\n\n\tEXPECT_EQ(cmd.storage_type(), traffic::Commandline::POSTGRES);\n}\n\n\n\/\/ Test for invalid storage type\nTEST_F(ServerCommandline, test_storage_invalid) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-s\", \"peng\", REQUIRED_TABLES};\n\n\tEXPECT_FALSE(cmd.parse(3 + 4, argv));\n\n\tEXPECT_NE(error().find(\"the argument for option \"\n\t\t\t       \"'--storage' is invalid\"),\n\t\t  std::string::npos);\n}\n\n\n\/\/ Test for sqlite storage type\nTEST_F(ServerCommandline, test_worker_default) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(1 + 4 + 4, argv));\n\n\tEXPECT_EQ(cmd.worker(), 2U);\n}\n\n\n\/\/ Test for sqlite storage type\nTEST_F(ServerCommandline, test_worker_count) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", \"-w\", \"5\", REQUIRED};\n\n\tEXPECT_TRUE(cmd.parse(3 + 4 + 4, argv));\n\n\tEXPECT_EQ(cmd.worker(), 5U);\n}\n\n\n\/\/ Test output table missing\nTEST_F(ServerCommandline, test_tables_out_missing) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED_STORAGE, \"-I\", \"a\"};\n\n\tEXPECT_FALSE(cmd.parse(3 + 4, argv));\n\tEXPECT_NE(error().find(\"the option '--table_out' is \"\n\t\t\t\t\"required but missing\"),\n\t\t\tstd::string::npos);\n}\n\n\n\/\/ Test input table missing\nTEST_F(ServerCommandline, test_tables_in_missing) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED_STORAGE, \"-O\", \"a\"};\n\n\tEXPECT_FALSE(cmd.parse(3 + 4, argv));\n\tEXPECT_NE(error().find(\"the option '--table_in' is \"\n\t\t\t\t\"required but missing\"),\n\t\t\tstd::string::npos);\n}\n\n\n\/\/ Test tables\nTEST_F(ServerCommandline, test_tables) {\n\ttraffic::Commandline cmd;\n\tconst char* argv[] = {\"foobar\", REQUIRED_STORAGE,\n\t\t\t      \"-O\", \"a\", \"-I\", \"b\"};\n\n\tEXPECT_TRUE(cmd.parse(5 + 4, argv));\n\tEXPECT_EQ(cmd.table_outgoing(), \"a\");\n\tEXPECT_EQ(cmd.table_incomming(), \"b\");\n}\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 \"TensorMechanicsActionBase.h\"\n#include \"CommonTensorMechanicsAction.h\"\n#include \"ActionWarehouse.h\"\n#include \"ComputeFiniteStrain.h\"\n\n\/\/ map tensor name shortcuts to tensor material property names\nconst std::map<std::string, std::string> TensorMechanicsActionBase::_ranktwoaux_table = {\n    {\"strain\", \"total_strain\"},\n    {\"stress\", \"stress\"},\n    {\"elastic_strain\", \"elastic_strain\"},\n    {\"plastic_strain\", \"plastic_strain\"},\n    {\"creep_strain\", \"creep_strain\"}};\nconst std::vector<char> TensorMechanicsActionBase::_component_table = {'x', 'y', 'z'};\n\/\/ map aux variable name prefixes to RanTwoScalarAux option and list of permitted tensor name\n\/\/ shortcuts\nconst std::map<std::string, std::pair<std::string, std::vector<std::string>>>\n    TensorMechanicsActionBase::_ranktwoscalaraux_table = {\n        {\"vonmises\", {\"VonMisesStress\", {\"stress\"}}},\n        {\"hydrostatic\", {\"Hydrostatic\", {\"stress\"}}},\n        {\"max_principal\", {\"MaxPrincipal\", {\"stress\"}}},\n        {\"mid_principal\", {\"MidPrincipal\", {\"stress\"}}},\n        {\"min_principal\", {\"MinPrincipal\", {\"stress\"}}},\n        {\"effective\", {\"EffectiveStrain\", {\"plastic_strain\", \"creep_strain\"}}},\n        {\"firstinv\", {\"FirstInvariant\", {\"stress\", \"strain\"}}},\n        {\"secondinv\", {\"SecondInvariant\", {\"stress\", \"strain\"}}},\n        {\"thirdinv\", {\"ThirdInvariant\", {\"stress\", \"strain\"}}}};\n\ntemplate <>\nInputParameters\nvalidParams<TensorMechanicsActionBase>()\n{\n  InputParameters params = validParams<Action>();\n\n  params.addRequiredParam<std::vector<NonlinearVariableName>>(\n      \"displacements\", \"The nonlinear displacement variables for the problem\");\n  params.addParam<NonlinearVariableName>(\"temperature\", \"The temperature\");\n\n  MooseEnum strainType(\"SMALL FINITE\", \"SMALL\");\n  params.addParam<MooseEnum>(\"strain\", strainType, \"Strain formulation\");\n  params.addParam<bool>(\"incremental\", \"Use incremental or total strain\");\n\n  params.addParam<std::string>(\"base_name\", \"Material property base name\");\n  params.addParam<bool>(\n      \"volumetric_locking_correction\", false, \"Flag to correct volumetric locking\");\n  params.addParam<bool>(\n      \"use_finite_deform_jacobian\", false, \"Jacobian for corrotational finite strain\");\n  params.addParam<bool>(\n      \"use_displaced_mesh\", false, \"Whether to use displaced mesh in the kernels\");\n  params.addParam<bool>(\"add_variables\", false, \"Add the displacement variables\");\n  params.addParam<std::vector<MaterialPropertyName>>(\n      \"eigenstrain_names\", \"List of eigenstrains to be applied in this strain calculation\");\n  \/\/ Global Strain\n  params.addParam<MaterialPropertyName>(\n      \"global_strain\",\n      \"Name of the global strain material to be applied in this strain calculation. \"\n      \"The global strain tensor is constant over the whole domain and allows visualization \"\n      \"of the deformed shape with the periodic BC\");\n\n  \/\/ Advanced\n  params.addParam<std::vector<AuxVariableName>>(\"save_in\", \"The displacement residuals\");\n  params.addParam<std::vector<AuxVariableName>>(\"diag_save_in\",\n                                                \"The displacement diagonal preconditioner terms\");\n  params.addParam<MooseEnum>(\"decomposition_method\",\n                             ComputeFiniteStrain::decompositionType(),\n                             \"Methods to calculate the finite strain and rotation increments\");\n  params.addParamNamesToGroup(\"save_in diag_save_in\", \"Advanced\");\n\n  \/\/ Planar Formulation\n  MooseEnum planarFormulationType(\"NONE PLANE_STRAIN GENERALIZED_PLANE_STRAIN\",\n                                  \"NONE\"); \/\/ PLANE_STRESS\n  params.addParam<MooseEnum>(\n      \"planar_formulation\", planarFormulationType, \"Out-of-plane stress\/strain formulation\");\n  params.addParam<NonlinearVariableName>(\"scalar_out_of_plane_strain\",\n                                         \"Scalar variable for the out-of-plane strain (in y \"\n                                         \"direction for 1D Axisymmetric or in z direction for 2D \"\n                                         \"Cartesian problems)\");\n  MooseEnum outOfPlaneDirection(\"x y z\", \"z\");\n  params.addParam<MooseEnum>(\n      \"out_of_plane_direction\", outOfPlaneDirection, \"The direction of the out-of-plane strain.\");\n  params.addParam<FunctionName>(\"out_of_plane_pressure\",\n                                \"0\",\n                                \"Function used to prescribe pressure in the out-of-plane direction \"\n                                \"(y for 1D Axisymmetric or z for 2D Cartesian problems)\");\n  params.addParam<Real>(\"pressure_factor\", 1.0, \"Scale factor applied to prescribed pressure\");\n  params.addParamNamesToGroup(\"planar_formulation scalar_out_of_plane_strain out_of_plane_pressure \"\n                              \"pressure_factor out_of_plane_direction\",\n                              \"Out-of-plane stress\/strain\");\n\n  \/\/ Output\n  params.addParam<MultiMooseEnum>(\"generate_output\",\n                                  TensorMechanicsActionBase::outputPropertiesType(),\n                                  \"Add scalar quantity output for stress and\/or strain\");\n  params.addParamNamesToGroup(\"generate_output\", \"Output\");\n\n  return params;\n}\n\nTensorMechanicsActionBase::TensorMechanicsActionBase(const InputParameters & parameters)\n  : Action(parameters)\n{\n  \/\/ check if a container block with common parameters is found\n  auto action = _awh.getActions<CommonTensorMechanicsAction>();\n  if (action.size() == 1)\n    _pars.applyParameters(action[0]->parameters());\n\n  \/\/ append additional_generate_output\n  if (isParamValid(\"additional_generate_output\"))\n  {\n    MultiMooseEnum generate_output = getParam<MultiMooseEnum>(\"generate_output\");\n    MultiMooseEnum additional_generate_output =\n        getParam<MultiMooseEnum>(\"additional_generate_output\");\n    for (auto & output : additional_generate_output)\n      generate_output.push_back(output);\n\n    _pars.set<MultiMooseEnum>(\"generate_output\") = generate_output;\n  }\n}\n\nMultiMooseEnum\nTensorMechanicsActionBase::outputPropertiesType()\n{\n  std::string options = \"\";\n  for (auto & r2a : _ranktwoaux_table)\n    for (unsigned int a = 0; a < 3; ++a)\n      for (unsigned int b = 0; b < 3; ++b)\n        options += (options == \"\" ? \"\" : \" \") + r2a.first + '_' + _component_table[a] +\n                   _component_table[b];\n\n  for (auto & r2sa : _ranktwoscalaraux_table)\n    for (auto & t : r2sa.second.second)\n      options += \" \" + r2sa.first + \"_\" + t;\n\n  return MultiMooseEnum(options);\n}\n<commit_msg>Remove options to output effective_plastic_strain and effective_creep_strain ref #12386<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 \"TensorMechanicsActionBase.h\"\n#include \"CommonTensorMechanicsAction.h\"\n#include \"ActionWarehouse.h\"\n#include \"ComputeFiniteStrain.h\"\n\n\/\/ map tensor name shortcuts to tensor material property names\nconst std::map<std::string, std::string> TensorMechanicsActionBase::_ranktwoaux_table = {\n    {\"strain\", \"total_strain\"},\n    {\"stress\", \"stress\"},\n    {\"elastic_strain\", \"elastic_strain\"},\n    {\"plastic_strain\", \"plastic_strain\"},\n    {\"creep_strain\", \"creep_strain\"}};\nconst std::vector<char> TensorMechanicsActionBase::_component_table = {'x', 'y', 'z'};\n\/\/ map aux variable name prefixes to RanTwoScalarAux option and list of permitted tensor name\n\/\/ shortcuts\nconst std::map<std::string, std::pair<std::string, std::vector<std::string>>>\n    TensorMechanicsActionBase::_ranktwoscalaraux_table = {\n        {\"vonmises\", {\"VonMisesStress\", {\"stress\"}}},\n        {\"hydrostatic\", {\"Hydrostatic\", {\"stress\"}}},\n        {\"max_principal\", {\"MaxPrincipal\", {\"stress\"}}},\n        {\"mid_principal\", {\"MidPrincipal\", {\"stress\"}}},\n        {\"min_principal\", {\"MinPrincipal\", {\"stress\"}}},\n        {\"firstinv\", {\"FirstInvariant\", {\"stress\", \"strain\"}}},\n        {\"secondinv\", {\"SecondInvariant\", {\"stress\", \"strain\"}}},\n        {\"thirdinv\", {\"ThirdInvariant\", {\"stress\", \"strain\"}}}};\n\ntemplate <>\nInputParameters\nvalidParams<TensorMechanicsActionBase>()\n{\n  InputParameters params = validParams<Action>();\n\n  params.addRequiredParam<std::vector<NonlinearVariableName>>(\n      \"displacements\", \"The nonlinear displacement variables for the problem\");\n  params.addParam<NonlinearVariableName>(\"temperature\", \"The temperature\");\n\n  MooseEnum strainType(\"SMALL FINITE\", \"SMALL\");\n  params.addParam<MooseEnum>(\"strain\", strainType, \"Strain formulation\");\n  params.addParam<bool>(\"incremental\", \"Use incremental or total strain\");\n\n  params.addParam<std::string>(\"base_name\", \"Material property base name\");\n  params.addParam<bool>(\n      \"volumetric_locking_correction\", false, \"Flag to correct volumetric locking\");\n  params.addParam<bool>(\n      \"use_finite_deform_jacobian\", false, \"Jacobian for corrotational finite strain\");\n  params.addParam<bool>(\n      \"use_displaced_mesh\", false, \"Whether to use displaced mesh in the kernels\");\n  params.addParam<bool>(\"add_variables\", false, \"Add the displacement variables\");\n  params.addParam<std::vector<MaterialPropertyName>>(\n      \"eigenstrain_names\", \"List of eigenstrains to be applied in this strain calculation\");\n  \/\/ Global Strain\n  params.addParam<MaterialPropertyName>(\n      \"global_strain\",\n      \"Name of the global strain material to be applied in this strain calculation. \"\n      \"The global strain tensor is constant over the whole domain and allows visualization \"\n      \"of the deformed shape with the periodic BC\");\n\n  \/\/ Advanced\n  params.addParam<std::vector<AuxVariableName>>(\"save_in\", \"The displacement residuals\");\n  params.addParam<std::vector<AuxVariableName>>(\"diag_save_in\",\n                                                \"The displacement diagonal preconditioner terms\");\n  params.addParam<MooseEnum>(\"decomposition_method\",\n                             ComputeFiniteStrain::decompositionType(),\n                             \"Methods to calculate the finite strain and rotation increments\");\n  params.addParamNamesToGroup(\"save_in diag_save_in\", \"Advanced\");\n\n  \/\/ Planar Formulation\n  MooseEnum planarFormulationType(\"NONE PLANE_STRAIN GENERALIZED_PLANE_STRAIN\",\n                                  \"NONE\"); \/\/ PLANE_STRESS\n  params.addParam<MooseEnum>(\n      \"planar_formulation\", planarFormulationType, \"Out-of-plane stress\/strain formulation\");\n  params.addParam<NonlinearVariableName>(\"scalar_out_of_plane_strain\",\n                                         \"Scalar variable for the out-of-plane strain (in y \"\n                                         \"direction for 1D Axisymmetric or in z direction for 2D \"\n                                         \"Cartesian problems)\");\n  MooseEnum outOfPlaneDirection(\"x y z\", \"z\");\n  params.addParam<MooseEnum>(\n      \"out_of_plane_direction\", outOfPlaneDirection, \"The direction of the out-of-plane strain.\");\n  params.addParam<FunctionName>(\"out_of_plane_pressure\",\n                                \"0\",\n                                \"Function used to prescribe pressure in the out-of-plane direction \"\n                                \"(y for 1D Axisymmetric or z for 2D Cartesian problems)\");\n  params.addParam<Real>(\"pressure_factor\", 1.0, \"Scale factor applied to prescribed pressure\");\n  params.addParamNamesToGroup(\"planar_formulation scalar_out_of_plane_strain out_of_plane_pressure \"\n                              \"pressure_factor out_of_plane_direction\",\n                              \"Out-of-plane stress\/strain\");\n\n  \/\/ Output\n  params.addParam<MultiMooseEnum>(\"generate_output\",\n                                  TensorMechanicsActionBase::outputPropertiesType(),\n                                  \"Add scalar quantity output for stress and\/or strain\");\n  params.addParamNamesToGroup(\"generate_output\", \"Output\");\n\n  return params;\n}\n\nTensorMechanicsActionBase::TensorMechanicsActionBase(const InputParameters & parameters)\n  : Action(parameters)\n{\n  \/\/ check if a container block with common parameters is found\n  auto action = _awh.getActions<CommonTensorMechanicsAction>();\n  if (action.size() == 1)\n    _pars.applyParameters(action[0]->parameters());\n\n  \/\/ append additional_generate_output\n  if (isParamValid(\"additional_generate_output\"))\n  {\n    MultiMooseEnum generate_output = getParam<MultiMooseEnum>(\"generate_output\");\n    MultiMooseEnum additional_generate_output =\n        getParam<MultiMooseEnum>(\"additional_generate_output\");\n    for (auto & output : additional_generate_output)\n      generate_output.push_back(output);\n\n    _pars.set<MultiMooseEnum>(\"generate_output\") = generate_output;\n  }\n}\n\nMultiMooseEnum\nTensorMechanicsActionBase::outputPropertiesType()\n{\n  std::string options = \"\";\n  for (auto & r2a : _ranktwoaux_table)\n    for (unsigned int a = 0; a < 3; ++a)\n      for (unsigned int b = 0; b < 3; ++b)\n        options += (options == \"\" ? \"\" : \" \") + r2a.first + '_' + _component_table[a] +\n                   _component_table[b];\n\n  for (auto & r2sa : _ranktwoscalaraux_table)\n    for (auto & t : r2sa.second.second)\n      options += \" \" + r2sa.first + \"_\" + t;\n\n  return MultiMooseEnum(options);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"inverseIndexStorageUnorderedMap.h\"\n\n \nInverseIndexStorageUnorderedMap::InverseIndexStorageUnorderedMap(size_t pSizeOfInverseIndex, size_t pMaxBinSize) {\n\tmSignatureStorage = new vector__umapVector(pSizeOfInverseIndex);\n\tmMaxBinSize = pMaxBinSize;\n\tmKeys = new vvsize_t(pSizeOfInverseIndex, vsize_t());\n\tmValues = new vvsize_t(pSizeOfInverseIndex, vsize_t());\n}\nInverseIndexStorageUnorderedMap::~InverseIndexStorageUnorderedMap() {\n\t\n}\nsize_t InverseIndexStorageUnorderedMap::size() const {\n\treturn mSignatureStorage->size();\n}\nvsize_t* InverseIndexStorageUnorderedMap::getElement(size_t pVectorId, size_t pHashValue) {\n\tauto iterator = (*mSignatureStorage)[pVectorId].find(pHashValue);\n\tif (iterator != (*mSignatureStorage)[pVectorId].end()) {\n\t\treturn &(iterator->second);\n\t}\n\treturn new vsize_t(0);\n\t\n}\nvoid InverseIndexStorageUnorderedMap::insert(size_t pVectorId, size_t pHashValue, size_t pInstance) {\n#pragma omp critical\n    {\t\n        auto itHashValue_InstanceVector = (*mSignatureStorage)[pVectorId].find(pHashValue);\n        \/\/ if for hash function h_i() the given hash values is already stored\n        if (itHashValue_InstanceVector != (*mSignatureStorage)[pVectorId].end()) {\n            \/\/ insert the instance id if not too many collisions (maxBinSize)\n            if (itHashValue_InstanceVector->second.size() && itHashValue_InstanceVector->second.size() < mMaxBinSize) {\n                \/\/ insert only if there wasn't any collisions in the past\n                if (itHashValue_InstanceVector->second.size() > 0) {\n                    itHashValue_InstanceVector->second.push_back(pInstance);\n                }\n            } else { \n                \/\/ too many collisions: delete stored ids. empty vector is interpreted as an error code \n                \/\/ for too many collisions\n                itHashValue_InstanceVector->second.clear();\n            }\n        } else {\n            \/\/ given hash value for the specific hash function was not avaible: insert new hash value\n            vsize_t instanceIdVector;\n            instanceIdVector.push_back(pInstance);\n            (*mSignatureStorage)[pVectorId][pHashValue] = instanceIdVector;\n        }\n    }\n}\n<commit_msg>Added preprocessor flags and returning NULL instead of an empty vector in function getElement<commit_after>#include \"inverseIndexStorageUnorderedMap.h\"\n#ifdef OPENMP\n#include <omp.h>\n#endif\n \nInverseIndexStorageUnorderedMap::InverseIndexStorageUnorderedMap(size_t pSizeOfInverseIndex, size_t pMaxBinSize) {\n\tmSignatureStorage = new vector__umapVector(pSizeOfInverseIndex);\n\tmMaxBinSize = pMaxBinSize;\n\tmKeys = new vvsize_t(pSizeOfInverseIndex, vsize_t());\n\tmValues = new vvsize_t(pSizeOfInverseIndex, vsize_t());\n}\nInverseIndexStorageUnorderedMap::~InverseIndexStorageUnorderedMap() {\n\t\n}\nsize_t InverseIndexStorageUnorderedMap::size() const {\n\treturn mSignatureStorage->size();\n}\nvsize_t* InverseIndexStorageUnorderedMap::getElement(size_t pVectorId, size_t pHashValue) {\n\tauto iterator = (*mSignatureStorage)[pVectorId].find(pHashValue);\n\tif (iterator != (*mSignatureStorage)[pVectorId].end()) {\n\t\treturn &(iterator->second);\n\t}\n\treturn NULL;\n\t\n}\nvoid InverseIndexStorageUnorderedMap::insert(size_t pVectorId, size_t pHashValue, size_t pInstance) {\n#ifdef OPENMP\n#pragma omp critical\n#endif\n    {\t\n        auto itHashValue_InstanceVector = (*mSignatureStorage)[pVectorId].find(pHashValue);\n        \/\/ if for hash function h_i() the given hash values is already stored\n        if (itHashValue_InstanceVector != (*mSignatureStorage)[pVectorId].end()) {\n            \/\/ insert the instance id if not too many collisions (maxBinSize)\n            if (itHashValue_InstanceVector->second.size() && itHashValue_InstanceVector->second.size() < mMaxBinSize) {\n                \/\/ insert only if there wasn't any collisions in the past\n                if (itHashValue_InstanceVector->second.size() > 0) {\n                    itHashValue_InstanceVector->second.push_back(pInstance);\n                }\n            } else { \n                \/\/ too many collisions: delete stored ids. empty vector is interpreted as an error code \n                \/\/ for too many collisions\n                itHashValue_InstanceVector->second.clear();\n            }\n        } else {\n            \/\/ given hash value for the specific hash function was not avaible: insert new hash value\n            vsize_t instanceIdVector;\n            instanceIdVector.push_back(pInstance);\n            (*mSignatureStorage)[pVectorId][pHashValue] = instanceIdVector;\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************\n *  static_vector_test.hpp\n *  bptree\n *\n *  Copyright (c) 2017, Chi-En Wu\n *  Distributed under MIT License\n ************************************************\/\n\n#include <cassert>\n#include <cstddef>\n\n#include <array>\n#include <stdexcept>\n\n#include <gtest\/gtest.h>\n\n#include <bptree\/internal\/static_vector.hpp>\n\nusing bptree::internal::static_vector;\n\nenum class constructed_with {\n    default_ctor,\n    copy_ctor,\n    move_ctor,\n    value_ctor\n};\n\nclass custom_type {\n public:  \/\/ Public Method(s)\n    custom_type()\n      : custom_type(constructed_with::default_ctor, 0)\n        { \/* do nothing *\/ }\n\n    custom_type(custom_type const& other)\n      : custom_type(constructed_with::copy_ctor, other.val_)\n        { \/* do nothing *\/ }\n\n    custom_type(custom_type&& other)\n      : custom_type(constructed_with::move_ctor, other.val_)\n        { other.val_ = 0; }\n\n    explicit custom_type(int n)\n      : custom_type(constructed_with::value_ctor, n)\n        { \/* do nothing *\/ }\n\n    \/\/ used only for generating expected results in tests\n    custom_type(constructed_with ctor, int n)\n      : ctor_(ctor), val_(n)\n        { ++num_instances_; }\n\n    ~custom_type()\n        { --num_instances_; }\n\n    custom_type& operator=(custom_type const& other)\n        { val_ = other.val_; return *this; }\n\n    custom_type& operator=(custom_type&& other)\n        { val_ = other.val_; other.val_ = 0; return *this; }\n\n    bool operator==(custom_type const& other) const\n        { return val_ == other.val_ && ctor_ == other.ctor_; }\n\n    int get() const\n        { return val_; }\n\n    constructed_with ctor() const\n        { return ctor_; }\n\n public:  \/\/ Public Static Method(s)\n    static custom_type construct_with_default_ctor(int val)\n        { return custom_type(constructed_with::default_ctor, val); }\n\n    static custom_type construct_with_copy_ctor(int val)\n        { return custom_type(constructed_with::copy_ctor, val); }\n\n    static custom_type construct_with_move_ctor(int val)\n        { return custom_type(constructed_with::move_ctor, val); }\n\n    static custom_type construct_with_value_ctor(int val)\n        { return custom_type(constructed_with::value_ctor, val); }\n\n    static void reset_num_instances()\n        { num_instances_ = 0; }\n\n    static std::size_t num_instances()\n        { return num_instances_; }\n\n private:  \/\/ Private Property(ies)\n    int val_;\n    constructed_with ctor_;\n\n private:  \/\/ Private Static Property(ies)\n    static std::size_t num_instances_;\n};\n\nclass StaticVectorTest : public ::testing::Test {\n protected:\n     virtual void SetUp() {\n         custom_type::reset_num_instances();\n     }\n};\n\nstd::size_t custom_type::num_instances_ = 0;\n\n#define VA_NARGS_IMPL(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, n, ...) n\n#define VA_NARGS(...) VA_NARGS_IMPL(__VA_ARGS__, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1)\n\n#define WRAP_VALUES_IMPL_1(wrap, value) wrap(value)\n#define WRAP_VALUES_IMPL_2(wrap, _1, value) \\\n        WRAP_VALUES_IMPL_1(wrap, _1), wrap(value)\n#define WRAP_VALUES_IMPL_3(wrap, _1, _2, value) \\\n        WRAP_VALUES_IMPL_2(wrap, _1, _2), wrap(value)\n#define WRAP_VALUES_IMPL_4(wrap, _1, _2, _3, value) \\\n        WRAP_VALUES_IMPL_3(wrap, _1, _2, _3), wrap(value)\n#define WRAP_VALUES_IMPL_5(wrap, _1, _2, _3, _4, value) \\\n        WRAP_VALUES_IMPL_4(wrap, _1, _2, _3, _4), wrap(value)\n#define WRAP_VALUES_IMPL_6(wrap, _1, _2, _3, _4, _5, value) \\\n        WRAP_VALUES_IMPL_5(wrap, _1, _2, _3, _4, _5), wrap(value)\n#define WRAP_VALUES_IMPL_7(wrap, _1, _2, _3, _4, _5, _6, value) \\\n        WRAP_VALUES_IMPL_6(wrap, _1, _2, _3, _4, _5, _6), wrap(value)\n#define WRAP_VALUES_IMPL_8(wrap, _1, _2, _3, _4, _5, _6, _7, value) \\\n        WRAP_VALUES_IMPL_7(wrap, _1, _2, _3, _4, _5, _6, _7), wrap(value)\n#define WRAP_VALUES_IMPL_9(wrap, _1, _2, _3, _4, _5, _6, _7, _8, value) \\\n        WRAP_VALUES_IMPL_8(wrap, _1, _2, _3, _4, _5, _6, _7, _8), wrap(value)\n#define WRAP_VALUES_IMPL_10(wrap, _1, _2, _3, _4, _5, _6, _7, _8, _9, value) \\\n        WRAP_VALUES_IMPL_9(wrap, _1, _2, _3, _4, _5, _6, _7, _8, _9), wrap(value)\n#define WRAP_VALUES_IMPL_(n, wrap, ...) WRAP_VALUES_IMPL_##n(wrap, __VA_ARGS__)\n#define WRAP_VALUES_IMPL(n, wrap, ...)  WRAP_VALUES_IMPL_(n, wrap, __VA_ARGS__)\n#define WRAP_VALUES(wrap, ...)          WRAP_VALUES_IMPL(VA_NARGS(__VA_ARGS__), wrap, __VA_ARGS__)\n\n#define REPEAT_VALUE_IMPL_1(value)      value\n#define REPEAT_VALUE_IMPL_2(value)      REPEAT_VALUE_IMPL_1(value), value\n#define REPEAT_VALUE_IMPL_3(value)      REPEAT_VALUE_IMPL_2(value), value\n#define REPEAT_VALUE_IMPL_4(value)      REPEAT_VALUE_IMPL_3(value), value\n#define REPEAT_VALUE_IMPL_5(value)      REPEAT_VALUE_IMPL_4(value), value\n#define REPEAT_VALUE_IMPL_6(value)      REPEAT_VALUE_IMPL_5(value), value\n#define REPEAT_VALUE_IMPL_7(value)      REPEAT_VALUE_IMPL_6(value), value\n#define REPEAT_VALUE_IMPL_8(value)      REPEAT_VALUE_IMPL_7(value), value\n#define REPEAT_VALUE_IMPL_9(value)      REPEAT_VALUE_IMPL_8(value), value\n#define REPEAT_VALUE_IMPL_10(value)     REPEAT_VALUE_IMPL_9(value), value\n#define REPEAT_VALUE_IMPL(n, value)     REPEAT_VALUE_IMPL_##n(value)\n#define REPEAT_VALUE(n, value)          REPEAT_VALUE_IMPL(n, value)\n\n#define SIZE_VECTOR                     10\n#define TEST_VALUES                     1, 2, 3, 5, 8\n#define EXTRA_TEST_VALUES               13, 21, 34\n\ntemplate <typename T, std::size_t N>\nvoid assert_static_vector_size(static_vector<T, N> const& v, std::size_t size) {\n    assert(size <= N);\n\n    EXPECT_EQ(size == 0, v.empty());\n    EXPECT_EQ(size == N, v.full());\n    EXPECT_EQ(size, v.size());\n    EXPECT_EQ(N, v.max_size());\n    EXPECT_EQ(N, v.capacity());\n\n    EXPECT_THROW(v.at(size), std::out_of_range);\n}\n\ntemplate <typename T, std::size_t N, std::size_t M>\nvoid assert_static_vector_values(static_vector<T, N> const& v, T const (&expected)[M]) {\n    assert_static_vector_size(v, M);\n\n    typename static_vector<T, N>::const_pointer data_ptr = v.data();\n    for (std::size_t pos = 0; pos < M; ++pos, ++data_ptr) {\n        EXPECT_EQ(expected[pos], v[pos]);\n        EXPECT_EQ(expected[pos], v.at(pos));\n        EXPECT_EQ(expected[pos], *data_ptr);\n    }\n}\n\nTEST_F(StaticVectorTest, EmptyVector) {\n    static_vector<custom_type, SIZE_VECTOR> v;\n\n    EXPECT_EQ(0, custom_type::num_instances());\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, ConstructWithCount) {\n#define COUNT 3\n    static_vector<custom_type, SIZE_VECTOR> v(COUNT);\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        REPEAT_VALUE(COUNT, custom_type(constructed_with::default_ctor, 0))\n    });\n#undef COUNT\n}\n\nTEST_F(StaticVectorTest, ConstructEmptyVector) {\n    static_vector<custom_type, SIZE_VECTOR> v(0);\n\n    EXPECT_EQ(0, custom_type::num_instances());\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, ConstructFullVector) {\n    static_vector<custom_type, SIZE_VECTOR> v(SIZE_VECTOR);\n\n    EXPECT_EQ(SIZE_VECTOR, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        REPEAT_VALUE(SIZE_VECTOR, custom_type(constructed_with::default_ctor, 0))\n    });\n}\n\nTEST_F(StaticVectorTest, ConstructWithCountAndValue) {\n#define COUNT 3\n    int const VALUE = 10;\n    static_vector<custom_type, SIZE_VECTOR> v(COUNT, custom_type(VALUE));\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        REPEAT_VALUE(COUNT, custom_type(constructed_with::copy_ctor, VALUE))\n    });\n#undef COUNT\n}\n\nTEST_F(StaticVectorTest, ConstructWithIteratorPair) {\n    std::size_t constexpr SIZE = VA_NARGS(TEST_VALUES);\n    std::array<custom_type, SIZE> arr = { WRAP_VALUES(custom_type, TEST_VALUES) };\n\n    static_vector<custom_type, SIZE_VECTOR> v(arr.begin(), arr.end());\n\n    EXPECT_EQ(SIZE * 2, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, ConstructWithInitializerList) {\n    std::size_t const SIZE = VA_NARGS(TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v = { WRAP_VALUES(custom_type, TEST_VALUES) };\n\n    EXPECT_EQ(SIZE, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, ConstructWithAnotherVector) {\n    std::size_t const SIZE = VA_NARGS(TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v1 = { WRAP_VALUES(custom_type, TEST_VALUES) };\n    static_vector<custom_type, SIZE_VECTOR> v2 = v1;\n\n    EXPECT_EQ(SIZE * 2, custom_type::num_instances());\n    assert_static_vector_values(v2, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, DestructValues) {\n    {\n        static_vector<custom_type, SIZE_VECTOR> v(3);\n        EXPECT_EQ(3, custom_type::num_instances());\n    }\n\n    EXPECT_EQ(0, custom_type::num_instances());\n}\n\nTEST_F(StaticVectorTest, ClearValues) {\n    static_vector<custom_type, SIZE_VECTOR> v = { WRAP_VALUES(custom_type, TEST_VALUES) };\n\n    v.clear();\n\n    EXPECT_EQ(0, custom_type::num_instances());\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, AssignWithOperatorAndInitializerList) {\n    std::size_t const SIZE = VA_NARGS(EXTRA_TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v = { WRAP_VALUES(custom_type, TEST_VALUES) };\n    v = { WRAP_VALUES(custom_type, EXTRA_TEST_VALUES) };\n\n    EXPECT_EQ(SIZE, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, EXTRA_TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, AssignWithOperatorAndAnotherVector) {\n    std::size_t const SIZE = VA_NARGS(EXTRA_TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v1 = { WRAP_VALUES(custom_type, TEST_VALUES) };\n    static_vector<custom_type, SIZE_VECTOR> v2 = { WRAP_VALUES(custom_type, EXTRA_TEST_VALUES) };\n    v1 = v2;\n\n    EXPECT_EQ(SIZE * 2, custom_type::num_instances());\n    assert_static_vector_values(v2, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, EXTRA_TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, AssignWithMethodAndCountAndValues) {\n#define COUNT 3\n    int const VALUE = 10;\n    static_vector<custom_type, SIZE_VECTOR> v = { WRAP_VALUES(custom_type, TEST_VALUES) };\n    v.assign(COUNT, custom_type(VALUE));\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        REPEAT_VALUE(COUNT, custom_type(constructed_with::copy_ctor, VALUE))\n    });\n#undef COUNT\n}\n<commit_msg>:art: Distinguish variable names from macro<commit_after>\/************************************************\n *  static_vector_test.hpp\n *  bptree\n *\n *  Copyright (c) 2017, Chi-En Wu\n *  Distributed under MIT License\n ************************************************\/\n\n#include <cassert>\n#include <cstddef>\n\n#include <array>\n#include <stdexcept>\n\n#include <gtest\/gtest.h>\n\n#include <bptree\/internal\/static_vector.hpp>\n\nusing bptree::internal::static_vector;\n\nenum class constructed_with {\n    default_ctor,\n    copy_ctor,\n    move_ctor,\n    value_ctor\n};\n\nclass custom_type {\n public:  \/\/ Public Method(s)\n    custom_type()\n      : custom_type(constructed_with::default_ctor, 0)\n        { \/* do nothing *\/ }\n\n    custom_type(custom_type const& other)\n      : custom_type(constructed_with::copy_ctor, other.val_)\n        { \/* do nothing *\/ }\n\n    custom_type(custom_type&& other)\n      : custom_type(constructed_with::move_ctor, other.val_)\n        { other.val_ = 0; }\n\n    explicit custom_type(int n)\n      : custom_type(constructed_with::value_ctor, n)\n        { \/* do nothing *\/ }\n\n    \/\/ used only for generating expected results in tests\n    custom_type(constructed_with ctor, int n)\n      : ctor_(ctor), val_(n)\n        { ++num_instances_; }\n\n    ~custom_type()\n        { --num_instances_; }\n\n    custom_type& operator=(custom_type const& other)\n        { val_ = other.val_; return *this; }\n\n    custom_type& operator=(custom_type&& other)\n        { val_ = other.val_; other.val_ = 0; return *this; }\n\n    bool operator==(custom_type const& other) const\n        { return val_ == other.val_ && ctor_ == other.ctor_; }\n\n    int get() const\n        { return val_; }\n\n    constructed_with ctor() const\n        { return ctor_; }\n\n public:  \/\/ Public Static Method(s)\n    static custom_type construct_with_default_ctor(int val)\n        { return custom_type(constructed_with::default_ctor, val); }\n\n    static custom_type construct_with_copy_ctor(int val)\n        { return custom_type(constructed_with::copy_ctor, val); }\n\n    static custom_type construct_with_move_ctor(int val)\n        { return custom_type(constructed_with::move_ctor, val); }\n\n    static custom_type construct_with_value_ctor(int val)\n        { return custom_type(constructed_with::value_ctor, val); }\n\n    static void reset_num_instances()\n        { num_instances_ = 0; }\n\n    static std::size_t num_instances()\n        { return num_instances_; }\n\n private:  \/\/ Private Property(ies)\n    int val_;\n    constructed_with ctor_;\n\n private:  \/\/ Private Static Property(ies)\n    static std::size_t num_instances_;\n};\n\nclass StaticVectorTest : public ::testing::Test {\n protected:\n     virtual void SetUp() {\n         custom_type::reset_num_instances();\n     }\n};\n\nstd::size_t custom_type::num_instances_ = 0;\n\n#define VA_NARGS_IMPL(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, n, ...) n\n#define VA_NARGS(...) VA_NARGS_IMPL(__VA_ARGS__, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1)\n\n#define WRAP_VALUES_IMPL_1(wrap, value) wrap(value)\n#define WRAP_VALUES_IMPL_2(wrap, _1, value) \\\n        WRAP_VALUES_IMPL_1(wrap, _1), wrap(value)\n#define WRAP_VALUES_IMPL_3(wrap, _1, _2, value) \\\n        WRAP_VALUES_IMPL_2(wrap, _1, _2), wrap(value)\n#define WRAP_VALUES_IMPL_4(wrap, _1, _2, _3, value) \\\n        WRAP_VALUES_IMPL_3(wrap, _1, _2, _3), wrap(value)\n#define WRAP_VALUES_IMPL_5(wrap, _1, _2, _3, _4, value) \\\n        WRAP_VALUES_IMPL_4(wrap, _1, _2, _3, _4), wrap(value)\n#define WRAP_VALUES_IMPL_6(wrap, _1, _2, _3, _4, _5, value) \\\n        WRAP_VALUES_IMPL_5(wrap, _1, _2, _3, _4, _5), wrap(value)\n#define WRAP_VALUES_IMPL_7(wrap, _1, _2, _3, _4, _5, _6, value) \\\n        WRAP_VALUES_IMPL_6(wrap, _1, _2, _3, _4, _5, _6), wrap(value)\n#define WRAP_VALUES_IMPL_8(wrap, _1, _2, _3, _4, _5, _6, _7, value) \\\n        WRAP_VALUES_IMPL_7(wrap, _1, _2, _3, _4, _5, _6, _7), wrap(value)\n#define WRAP_VALUES_IMPL_9(wrap, _1, _2, _3, _4, _5, _6, _7, _8, value) \\\n        WRAP_VALUES_IMPL_8(wrap, _1, _2, _3, _4, _5, _6, _7, _8), wrap(value)\n#define WRAP_VALUES_IMPL_10(wrap, _1, _2, _3, _4, _5, _6, _7, _8, _9, value) \\\n        WRAP_VALUES_IMPL_9(wrap, _1, _2, _3, _4, _5, _6, _7, _8, _9), wrap(value)\n#define WRAP_VALUES_IMPL_(n, wrap, ...) WRAP_VALUES_IMPL_##n(wrap, __VA_ARGS__)\n#define WRAP_VALUES_IMPL(n, wrap, ...)  WRAP_VALUES_IMPL_(n, wrap, __VA_ARGS__)\n#define WRAP_VALUES(wrap, ...)          WRAP_VALUES_IMPL(VA_NARGS(__VA_ARGS__), wrap, __VA_ARGS__)\n\n#define REPEAT_VALUE_IMPL_1(value)      value\n#define REPEAT_VALUE_IMPL_2(value)      REPEAT_VALUE_IMPL_1(value), value\n#define REPEAT_VALUE_IMPL_3(value)      REPEAT_VALUE_IMPL_2(value), value\n#define REPEAT_VALUE_IMPL_4(value)      REPEAT_VALUE_IMPL_3(value), value\n#define REPEAT_VALUE_IMPL_5(value)      REPEAT_VALUE_IMPL_4(value), value\n#define REPEAT_VALUE_IMPL_6(value)      REPEAT_VALUE_IMPL_5(value), value\n#define REPEAT_VALUE_IMPL_7(value)      REPEAT_VALUE_IMPL_6(value), value\n#define REPEAT_VALUE_IMPL_8(value)      REPEAT_VALUE_IMPL_7(value), value\n#define REPEAT_VALUE_IMPL_9(value)      REPEAT_VALUE_IMPL_8(value), value\n#define REPEAT_VALUE_IMPL_10(value)     REPEAT_VALUE_IMPL_9(value), value\n#define REPEAT_VALUE_IMPL(n, value)     REPEAT_VALUE_IMPL_##n(value)\n#define REPEAT_VALUE(n, value)          REPEAT_VALUE_IMPL(n, value)\n\n#define SIZE_VECTOR                     10\n#define TEST_VALUES                     1, 2, 3, 5, 8\n#define EXTRA_TEST_VALUES               13, 21, 34\n\ntemplate <typename T, std::size_t N>\nvoid assert_static_vector_size(static_vector<T, N> const& v, std::size_t size) {\n    assert(size <= N);\n\n    EXPECT_EQ(size == 0, v.empty());\n    EXPECT_EQ(size == N, v.full());\n    EXPECT_EQ(size, v.size());\n    EXPECT_EQ(N, v.max_size());\n    EXPECT_EQ(N, v.capacity());\n\n    EXPECT_THROW(v.at(size), std::out_of_range);\n}\n\ntemplate <typename T, std::size_t N, std::size_t M>\nvoid assert_static_vector_values(static_vector<T, N> const& v, T const (&expected)[M]) {\n    assert_static_vector_size(v, M);\n\n    typename static_vector<T, N>::const_pointer data_ptr = v.data();\n    for (std::size_t pos = 0; pos < M; ++pos, ++data_ptr) {\n        EXPECT_EQ(expected[pos], v[pos]);\n        EXPECT_EQ(expected[pos], v.at(pos));\n        EXPECT_EQ(expected[pos], *data_ptr);\n    }\n}\n\nTEST_F(StaticVectorTest, EmptyVector) {\n    static_vector<custom_type, SIZE_VECTOR> v;\n\n    EXPECT_EQ(0, custom_type::num_instances());\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, ConstructWithCount) {\n#define COUNT 3\n    static_vector<custom_type, SIZE_VECTOR> v(COUNT);\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        REPEAT_VALUE(COUNT, custom_type(constructed_with::default_ctor, 0))\n    });\n#undef COUNT\n}\n\nTEST_F(StaticVectorTest, ConstructEmptyVector) {\n    static_vector<custom_type, SIZE_VECTOR> v(0);\n\n    EXPECT_EQ(0, custom_type::num_instances());\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, ConstructFullVector) {\n    static_vector<custom_type, SIZE_VECTOR> v(SIZE_VECTOR);\n\n    EXPECT_EQ(SIZE_VECTOR, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        REPEAT_VALUE(SIZE_VECTOR, custom_type(constructed_with::default_ctor, 0))\n    });\n}\n\nTEST_F(StaticVectorTest, ConstructWithCountAndValue) {\n#define COUNT 3\n    int const value = 10;\n    static_vector<custom_type, SIZE_VECTOR> v(COUNT, custom_type(value));\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        REPEAT_VALUE(COUNT, custom_type(constructed_with::copy_ctor, value))\n    });\n#undef COUNT\n}\n\nTEST_F(StaticVectorTest, ConstructWithIteratorPair) {\n    std::size_t constexpr size = VA_NARGS(TEST_VALUES);\n    std::array<custom_type, size> arr = { WRAP_VALUES(custom_type, TEST_VALUES) };\n\n    static_vector<custom_type, SIZE_VECTOR> v(arr.begin(), arr.end());\n\n    EXPECT_EQ(size * 2, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, ConstructWithInitializerList) {\n    std::size_t const size = VA_NARGS(TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v = { WRAP_VALUES(custom_type, TEST_VALUES) };\n\n    EXPECT_EQ(size, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, ConstructWithAnotherVector) {\n    std::size_t const size = VA_NARGS(TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v1 = { WRAP_VALUES(custom_type, TEST_VALUES) };\n    static_vector<custom_type, SIZE_VECTOR> v2 = v1;\n\n    EXPECT_EQ(size * 2, custom_type::num_instances());\n    assert_static_vector_values(v2, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, DestructValues) {\n    {\n        static_vector<custom_type, SIZE_VECTOR> v(3);\n        EXPECT_EQ(3, custom_type::num_instances());\n    }\n\n    EXPECT_EQ(0, custom_type::num_instances());\n}\n\nTEST_F(StaticVectorTest, ClearValues) {\n    static_vector<custom_type, SIZE_VECTOR> v = { WRAP_VALUES(custom_type, TEST_VALUES) };\n\n    v.clear();\n\n    EXPECT_EQ(0, custom_type::num_instances());\n    assert_static_vector_size(v, 0);\n}\n\nTEST_F(StaticVectorTest, AssignWithOperatorAndInitializerList) {\n    std::size_t const size = VA_NARGS(EXTRA_TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v = { WRAP_VALUES(custom_type, TEST_VALUES) };\n    v = { WRAP_VALUES(custom_type, EXTRA_TEST_VALUES) };\n\n    EXPECT_EQ(size, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, EXTRA_TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, AssignWithOperatorAndAnotherVector) {\n    std::size_t const size = VA_NARGS(EXTRA_TEST_VALUES);\n    static_vector<custom_type, SIZE_VECTOR> v1 = { WRAP_VALUES(custom_type, TEST_VALUES) };\n    static_vector<custom_type, SIZE_VECTOR> v2 = { WRAP_VALUES(custom_type, EXTRA_TEST_VALUES) };\n    v1 = v2;\n\n    EXPECT_EQ(size * 2, custom_type::num_instances());\n    assert_static_vector_values(v2, {\n        WRAP_VALUES(custom_type::construct_with_copy_ctor, EXTRA_TEST_VALUES)\n    });\n}\n\nTEST_F(StaticVectorTest, AssignWithMethodAndCountAndValues) {\n#define COUNT 3\n    int const value = 10;\n    static_vector<custom_type, SIZE_VECTOR> v = { WRAP_VALUES(custom_type, TEST_VALUES) };\n    v.assign(COUNT, custom_type(value));\n\n    EXPECT_EQ(COUNT, custom_type::num_instances());\n    assert_static_vector_values(v, {\n        REPEAT_VALUE(COUNT, custom_type(constructed_with::copy_ctor, value))\n    });\n#undef COUNT\n}\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************\n *  string_bucket_test.cpp\n *  HAT-Trie\n *\n *  Copyright (c) 2015, Chi-En Wu\n *  Distributed under The BSD 3-Clause License\n ************************************************\/\n\n#include <string>\n#include <stdexcept>\n\n#include <gtest\/gtest.h>\n\n#include \"hat_trie\/string_bucket.hpp\"\n\nusing std::string;\nusing std::out_of_range;\nusing hat_trie::impl::string_bucket;\n\nstruct some_type\n{\n    explicit some_type(bool &alive) : alive(alive)\n                        { alive = true; }\n    ~some_type(void)    { alive = false; }\n    bool &alive;\n};\n\nvoid construct_string_bucket(string_bucket<uint32_t> &sb)\n{\n    sb.push_back(\"cat\", 1);\n    sb.push_back(\"elephant\", 3);\n    sb.push_back(\"rabbit\", 5);\n    sb.push_back(\"bird\", 7);\n    sb.push_back(\"horse\", 9);\n}\n\nvoid check_key_and_value(string_bucket<uint32_t>::iterator const &it,\n                         string const &expect_key, uint32_t expect_val)\n{\n    string key(it->get_key().begin(), it->get_key().end());\n    EXPECT_EQ(expect_key, key);\n    EXPECT_EQ(expect_val, it->get_value());\n}\n\nTEST(StringBucket, CreateEmptyBucket)\n{\n    string_bucket<uint32_t> sb;\n    EXPECT_TRUE(sb.empty());\n    EXPECT_EQ(0, sb.size());\n    EXPECT_EQ(0, sb.bytes_count());\n    EXPECT_EQ(sb.end(), sb.begin());\n}\n\nTEST(StringBucket, InsertKeyAndValue)\n{\n    string_bucket<uint32_t> sb;\n\n    auto it1 = sb.push_back(\"hello\", 3);\n    check_key_and_value(it1, \"hello\", 3);\n    EXPECT_EQ(1, sb.size());\n    EXPECT_EQ(10, sb.bytes_count()); \/\/ 1 (prefix) + 5 (key) + 4 (value) = 10 bytes\n    EXPECT_FALSE(sb.empty());\n\n    auto it2 = sb.push_back(\"hi\", 5);\n    check_key_and_value(it2, \"hi\", 5);\n    EXPECT_EQ(2, sb.size());\n    EXPECT_EQ(17, sb.bytes_count()); \/\/ 10 + 1 (prefix) + 2 (key) + 4 (value) = 17 bytes\n}\n\nTEST(StringBucket, TraverseBucket)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    auto it = sb.begin();\n    check_key_and_value(it, \"cat\", 1);\n    check_key_and_value(++it, \"elephant\", 3);\n    check_key_and_value(++it, \"rabbit\", 5);\n    check_key_and_value(++it, \"bird\", 7);\n    check_key_and_value(++it, \"horse\", 9);\n    EXPECT_EQ(sb.end(), ++it);\n}\n\nTEST(StringBucket, FindElementWithKey)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    auto it1 = sb.find(\"rabbit\");\n    check_key_and_value(it1, \"rabbit\", 5);\n\n    auto it2 = sb.find(\"horse\");\n    check_key_and_value(it2, \"horse\", 9);\n\n    auto it3 = sb.find(\"tiger\");\n    EXPECT_EQ(sb.end(), it3);\n}\n\nTEST(StringBucket, AccessElement)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    EXPECT_EQ(1, sb[\"cat\"]);\n    EXPECT_EQ(7, sb[\"bird\"]);\n\n    EXPECT_EQ(3, sb.at(\"elephant\"));\n    EXPECT_EQ(5, sb.at(\"rabbit\"));\n\n    EXPECT_THROW(sb.at(\"tiger\"), out_of_range);\n}\n\nTEST(StringBucket, EraseElement)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    auto it1 = sb.find(\"cat\");\n    auto next_it1 = sb.erase(it1);\n    check_key_and_value(next_it1, \"elephant\", 3);\n\n    auto it2 = sb.find(\"rabbit\");\n    auto next_it2 = sb.erase(it2);\n    check_key_and_value(next_it2, \"bird\", 7);\n\n    auto it3 = sb.find(\"horse\");\n    auto next_it = sb.erase(it3);\n    EXPECT_EQ(sb.end(), next_it);\n\n    EXPECT_EQ(2, sb.size());\n\n    auto it = sb.begin();\n    check_key_and_value(it, \"elephant\", 3);\n    check_key_and_value(++it, \"bird\", 7);\n    EXPECT_EQ(sb.end(), ++it);\n}\n\nTEST(StringBucket, ClearBucket)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    sb.clear();\n    EXPECT_TRUE(sb.empty());\n    EXPECT_EQ(0, sb.size());\n    EXPECT_EQ(0, sb.bytes_count());\n    EXPECT_EQ(sb.end(), sb.begin());\n}\n\nTEST(StringBucket, ConstructAndDestructObject)\n{\n    bool alive = false;\n    {\n        string_bucket<some_type> sb;\n        sb.emplace_back(\"key\", alive);\n        EXPECT_TRUE(alive);\n    }\n\n    EXPECT_FALSE(alive);\n}\n\nTEST(StringBucket, DestructObjectWhenErasingElement)\n{\n    string_bucket<some_type> sb;\n    bool alive = false;\n    auto it = sb.emplace_back(\"key\", alive);\n    sb.erase(it);\n    EXPECT_FALSE(alive);\n}\n\n\/\/ TODO: Add some test cases for inserting\/erasing objects of non-trivially\n\/\/       copyable type. We need to check whether their copy\/move constructor\n\/\/       is called when re-allocating memory.\n<commit_msg>Check whether copy\/move constructor is called when re-allocating memory<commit_after>\/************************************************\n *  string_bucket_test.cpp\n *  HAT-Trie\n *\n *  Copyright (c) 2015, Chi-En Wu\n *  Distributed under The BSD 3-Clause License\n ************************************************\/\n\n#include <string>\n#include <stdexcept>\n\n#include <gtest\/gtest.h>\n\n#include \"hat_trie\/string_bucket.hpp\"\n\nusing std::string;\nusing std::out_of_range;\nusing hat_trie::impl::string_bucket;\n\nstruct some_type\n{\n    explicit some_type(bool &alive) : alive(alive)\n                        { alive = true; }\n    ~some_type(void)    { alive = false; }\n    bool &alive;\n};\n\nstruct spy\n{\n    size_t move_count, copy_count;\n};\n\nstruct some_type_with_non_trival_copy_constructor\n{\n    explicit some_type_with_non_trival_copy_constructor(spy &c) : c(c)\n        { c.move_count = c.copy_count = 0; }\n    some_type_with_non_trival_copy_constructor(\n            some_type_with_non_trival_copy_constructor const &obj) : c(obj.c)\n        { c.copy_count++; }\n    some_type_with_non_trival_copy_constructor(\n            some_type_with_non_trival_copy_constructor &&obj) : c(obj.c)\n        { c.move_count++; }\n\n    spy &c;\n};\n\nstruct some_type_with_noexcept_move_constructor\n{\n    explicit some_type_with_noexcept_move_constructor(spy &c) : c(c)\n        { c.move_count = c.copy_count = 0; }\n    some_type_with_noexcept_move_constructor(\n            some_type_with_noexcept_move_constructor const &obj) : c(obj.c)\n        { c.copy_count++; }\n    some_type_with_noexcept_move_constructor(\n            some_type_with_noexcept_move_constructor &&obj) noexcept : c(obj.c)\n        { c.move_count++; }\n\n    spy &c;\n};\n\nvoid construct_string_bucket(string_bucket<uint32_t> &sb)\n{\n    sb.push_back(\"cat\", 1);\n    sb.push_back(\"elephant\", 3);\n    sb.push_back(\"rabbit\", 5);\n    sb.push_back(\"bird\", 7);\n    sb.push_back(\"horse\", 9);\n}\n\nvoid check_key_and_value(string_bucket<uint32_t>::iterator const &it,\n                         string const &expect_key, uint32_t expect_val)\n{\n    string key(it->get_key().begin(), it->get_key().end());\n    EXPECT_EQ(expect_key, key);\n    EXPECT_EQ(expect_val, it->get_value());\n}\n\nTEST(StringBucket, CreateEmptyBucket)\n{\n    string_bucket<uint32_t> sb;\n    EXPECT_TRUE(sb.empty());\n    EXPECT_EQ(0, sb.size());\n    EXPECT_EQ(0, sb.bytes_count());\n    EXPECT_EQ(sb.end(), sb.begin());\n}\n\nTEST(StringBucket, InsertKeyAndValue)\n{\n    string_bucket<uint32_t> sb;\n\n    auto it1 = sb.push_back(\"hello\", 3);\n    check_key_and_value(it1, \"hello\", 3);\n    EXPECT_EQ(1, sb.size());\n    EXPECT_EQ(10, sb.bytes_count()); \/\/ 1 (prefix) + 5 (key) + 4 (value) = 10 bytes\n    EXPECT_FALSE(sb.empty());\n\n    auto it2 = sb.push_back(\"hi\", 5);\n    check_key_and_value(it2, \"hi\", 5);\n    EXPECT_EQ(2, sb.size());\n    EXPECT_EQ(17, sb.bytes_count()); \/\/ 10 + 1 (prefix) + 2 (key) + 4 (value) = 17 bytes\n}\n\nTEST(StringBucket, TraverseBucket)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    auto it = sb.begin();\n    check_key_and_value(it, \"cat\", 1);\n    check_key_and_value(++it, \"elephant\", 3);\n    check_key_and_value(++it, \"rabbit\", 5);\n    check_key_and_value(++it, \"bird\", 7);\n    check_key_and_value(++it, \"horse\", 9);\n    EXPECT_EQ(sb.end(), ++it);\n}\n\nTEST(StringBucket, FindElementWithKey)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    auto it1 = sb.find(\"rabbit\");\n    check_key_and_value(it1, \"rabbit\", 5);\n\n    auto it2 = sb.find(\"horse\");\n    check_key_and_value(it2, \"horse\", 9);\n\n    auto it3 = sb.find(\"tiger\");\n    EXPECT_EQ(sb.end(), it3);\n}\n\nTEST(StringBucket, AccessElement)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    EXPECT_EQ(1, sb[\"cat\"]);\n    EXPECT_EQ(7, sb[\"bird\"]);\n\n    EXPECT_EQ(3, sb.at(\"elephant\"));\n    EXPECT_EQ(5, sb.at(\"rabbit\"));\n\n    EXPECT_THROW(sb.at(\"tiger\"), out_of_range);\n}\n\nTEST(StringBucket, EraseElement)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    auto it1 = sb.find(\"cat\");\n    auto next_it1 = sb.erase(it1);\n    check_key_and_value(next_it1, \"elephant\", 3);\n\n    auto it2 = sb.find(\"rabbit\");\n    auto next_it2 = sb.erase(it2);\n    check_key_and_value(next_it2, \"bird\", 7);\n\n    auto it3 = sb.find(\"horse\");\n    auto next_it = sb.erase(it3);\n    EXPECT_EQ(sb.end(), next_it);\n\n    EXPECT_EQ(2, sb.size());\n\n    auto it = sb.begin();\n    check_key_and_value(it, \"elephant\", 3);\n    check_key_and_value(++it, \"bird\", 7);\n    EXPECT_EQ(sb.end(), ++it);\n}\n\nTEST(StringBucket, ClearBucket)\n{\n    string_bucket<uint32_t> sb;\n    construct_string_bucket(sb);\n\n    sb.clear();\n    EXPECT_TRUE(sb.empty());\n    EXPECT_EQ(0, sb.size());\n    EXPECT_EQ(0, sb.bytes_count());\n    EXPECT_EQ(sb.end(), sb.begin());\n}\n\nTEST(StringBucket, ConstructAndDestructObject)\n{\n    bool alive = false;\n    {\n        string_bucket<some_type> sb;\n        sb.emplace_back(\"key\", alive);\n        EXPECT_TRUE(alive);\n    }\n\n    EXPECT_FALSE(alive);\n}\n\nTEST(StringBucket, DestructObjectWhenErasingElement)\n{\n    string_bucket<some_type> sb;\n    bool alive = false;\n    auto it = sb.emplace_back(\"key\", alive);\n    sb.erase(it);\n    EXPECT_FALSE(alive);\n}\n\nTEST(StringBucket, InsertRValueReference)\n{\n    string_bucket<some_type_with_non_trival_copy_constructor> sb;\n    spy c;\n    sb.push_back(\"key\", some_type_with_non_trival_copy_constructor(c));\n    EXPECT_EQ(0, c.copy_count);\n    EXPECT_EQ(1, c.move_count);\n}\n\nTEST(StringBucket, InsertLValueReference)\n{\n    string_bucket<some_type_with_non_trival_copy_constructor> sb;\n    spy c;\n    some_type_with_non_trival_copy_constructor obj(c);\n    sb.push_back(\"key\", obj);\n    EXPECT_EQ(1, c.copy_count);\n    EXPECT_EQ(0, c.move_count);\n}\n\nTEST(StringBucket, CopyObjectWhenReallocatingMemory)\n{\n    string_bucket<some_type_with_non_trival_copy_constructor> sb;\n    spy c1, c2;\n    sb.emplace_back(\"key1\", c1);\n    sb.emplace_back(\"key2\", c2);\n    EXPECT_EQ(1, c1.copy_count);\n    EXPECT_EQ(0, c1.move_count);\n}\n\nTEST(StringBucket, MoveObjectWhenReallocatingMemory)\n{\n    string_bucket<some_type_with_noexcept_move_constructor> sb;\n    spy c1, c2;\n    sb.emplace_back(\"key1\", c1);\n    sb.emplace_back(\"key2\", c2);\n    EXPECT_EQ(0, c1.copy_count);\n    EXPECT_EQ(1, c1.move_count);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* tensorimaging tests *\/\n\n#include <iostream>\n#include <functional>\n#include <cmath>\n#include \"unittest.hxx\"\n#include \"vigra\/stdimage.hxx\"\n#include \"vigra\/impex.hxx\"\n#include \"vigra\/tensorutilities.hxx\"\n#include \"vigra\/orientedtensorfilters.hxx\"\n#include \"vigra\/boundarytensor.hxx\"\n#include \"vigra\/gradient_energy_tensor.hxx\"\n\nusing namespace vigra;\n\nstruct TensorUtilityTest\n{\n    typedef vigra::DImage Image;\n    typedef vigra::DVector2Image V2Image;\n    typedef vigra::DVector3Image V3Image;\n\n    TensorUtilityTest()\n    : w(5), h(5),\n      img2(w, h), img3(w, h)\n    {\n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                img2(x,y)[0] = x;\n                img2(x,y)[1] = y;\n            }\n        }\n        vectorToTensor(srcImageRange(img2), destImage(img3));\n    }\n\n    void vector2TensorTest()\n    {\n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                shouldEqual(img3(x,y)[0], x*x);\n                shouldEqual(img3(x,y)[1], -x*y);\n                shouldEqual(img3(x,y)[2], y*y);\n            }\n        }\n    }\n    \n    void tensorEigenRepresentationTest()\n    {\n        V3Image res(img3.size());\n        tensorEigenRepresentation(srcImageRange(img3), destImage(res));\n        \n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                shouldEqual(res(x,y)[0]+res(x,y)[1], img3(x,y)[0] + img3(x,y)[2]);\n                shouldEqual(res(x,y)[0]*res(x,y)[1], \n                            img3(x,y)[0]*img3(x,y)[2]-sq(img3(x,y)[1]));\n                shouldEqualTolerance(res(x,y)[2], \n                                    VIGRA_CSTD::atan2((double)-y, (double)x), 1e-12);\n            }\n        }\n    }\n    \n    void tensorTraceTest()\n    {\n        Image res(img3.size());\n        tensorTrace(srcImageRange(img3), destImage(res));\n        \n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                shouldEqual(res(x,y), img3(x,y)[0] + img3(x,y)[2]);\n            }\n        }\n    }\n    \n    \n    void tensorToEdgeCornerTest()\n    {\n        V2Image edge(img3.size());\n        Image corner(img3.size());\n        tensorToEdgeCorner(srcImageRange(img3), destImage(edge), destImage(corner));\n        V3Image eigen(img3.size());\n        tensorEigenRepresentation(srcImageRange(img3), destImage(eigen));\n        \n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                shouldEqual(edge(x,y)[0], eigen(x,y)[0]-eigen(x,y)[1]);\n                shouldEqual(edge(x,y)[1], eigen(x,y)[2]);\n                shouldEqual(corner(x,y), 2.0*eigen(x,y)[1]);\n            }\n        }\n    }\n    \n    int w, h;\n    V2Image img2;\n    V3Image img3;    \n};\n\n#define defImpulseResponseTest(xorder, yorder) \\\n    void rieszTransform##xorder##yorder##Test() \\\n    { \\\n        Image res(img1.size()), ref(img1.size()); \\\n        ImageImportInfo iref(\"riesz\" #xorder #yorder \".xv\"); \\\n        importImage(iref, destImage(ref)); \\\n        \\\n        rieszTransformOfLOG(srcImageRange(img1), destImage(res), 2.0, xorder, yorder); \\\n        \\\n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12); \\\n    } \\\n    \n\n\nstruct EdgeJunctionTensorTest\n{\n    typedef vigra::DImage Image;\n    typedef vigra::DVector2Image V2Image;\n    typedef vigra::DVector3Image V3Image;\n\n    EdgeJunctionTensorTest()\n    : img1(17, 17)\n    {\n        img1.init(0.0);\n        img1(8,8) = 1.0;\n\n        ImageImportInfo i2(\"l2.xv\");\n        img2.resize(i2.size());\n        importImage(i2, destImage(img2));\n    }\n\n    defImpulseResponseTest(0, 0)\n    defImpulseResponseTest(1, 0)\n    defImpulseResponseTest(0, 1)\n    defImpulseResponseTest(2, 0)\n    defImpulseResponseTest(1, 1)\n    defImpulseResponseTest(0, 2)\n\n    void boundaryTensorTest0()\n    {\n        V3Image res(img1.size()), ref(img1.size());\n        ImageImportInfo iref(\"boundaryTensor.xv\");\n        importImage(iref, destImage(ref));\n        \n        boundaryTensor(srcImageRange(img1), destImage(res), 2.0);\n        \n        for(V3Image::iterator i = res.begin(), j = ref.begin(); i < res.end(); ++i, ++j)\n        {\n            shouldEqualTolerance(i->magnitude(), j->magnitude(), 1e-12);\n        }\n    }\n\n    void boundaryTensorTest1()\n    {\n        V3Image bt(img2.size());\n        Image res(img2.size()), ref(img2.size());\n        ImageImportInfo iref(\"l2_boundary1.xv\");\n        importImage(iref, destImage(ref));\n\n        boundaryTensor1(srcImageRange(img2), destImage(bt), 2.0);\n        tensorTrace(srcImageRange(bt), destImage(res));\n        \n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n\n    void boundaryTensorTest2()\n    {\n        V3Image bt(img2.size());\n        Image res(img2.size()), ref(img2.size());\n        ImageImportInfo iref(\"l2_boundary.xv\");\n        importImage(iref, destImage(ref));\n\n        boundaryTensor(srcImageRange(img2), destImage(bt), 2.0);\n        tensorTrace(srcImageRange(bt), destImage(res));\n        \n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n\n    void boundaryTensorTest3()\n    {\n        \/\/ does not produce the correct result\n        Image res(img2.size());\n        {\n            V3Image bt(img2.size()), bt2(img2.size());\n\n            boundaryTensor3(srcImageRange(img2), destImage(bt), destImage(bt2), 1.0);\n            combineTwoImages(srcImageRange(bt), srcImage(bt2), destImage(bt2), \n                         std::plus<V3Image::value_type>());\n            tensorTrace(srcImageRange(bt2), destImage(res));\n        }\n        Image ref(img2.size());\n        ImageImportInfo iref(\"l2_boundary3.xv\");\n        importImage(iref, destImage(ref));\n\n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n    \n    void hourglassTest()\n    {\n        V2Image gradient(img2.size());\n        V3Image tensor(img2.size()), smoothedTensor(img2.size());\n        Image res(img2.size()), ref(img2.size());\n        ImageImportInfo iref(\"l2_hourglass.xv\");\n        importImage(iref, destImage(ref));\n\n        gaussianGradient(srcImageRange(img2), destImage(gradient), 0.7);\n        vectorToTensor(srcImageRange(gradient), destImage(tensor));\n        hourGlassFilter(srcImageRange(tensor), destImage(smoothedTensor), 2.8, 0.4);\n        tensorTrace(srcImageRange(smoothedTensor), destImage(res));\n  \n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n\n    void energyTensorTest()\n    {\n        V3Image get(img2.size());\n        Image res(img2.size()), ref(img2.size());\n        ImageImportInfo iref(\"l2_get.xv\");\n        importImage(iref, destImage(ref));\n\n        Kernel1D<double> smooth, grad;\n        smooth.initGaussian(1.0);\n        grad.initGaussianDerivative(1.0, 1);\n        gradientEnergyTensor(srcImageRange(img2), destImage(get), grad, smooth);\n        tensorTrace(srcImageRange(get), destImage(res));\n\n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n\n    Image img1, img2;\n};\n\nstruct TensorTestSuite\n: public vigra::test_suite\n{\n    TensorTestSuite()\n    : vigra::test_suite(\"TensorTestSuite\")\n    {\n        add( testCase( &TensorUtilityTest::vector2TensorTest));\n        add( testCase( &TensorUtilityTest::tensorEigenRepresentationTest));\n        add( testCase( &TensorUtilityTest::tensorTraceTest));\n        add( testCase( &TensorUtilityTest::tensorToEdgeCornerTest));\n\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform00Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform10Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform01Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform20Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform11Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform02Test));\n        add( testCase( &EdgeJunctionTensorTest::boundaryTensorTest0));\n        add( testCase( &EdgeJunctionTensorTest::boundaryTensorTest1));\n        add( testCase( &EdgeJunctionTensorTest::boundaryTensorTest2));\n        add( testCase( &EdgeJunctionTensorTest::hourglassTest));\n        add( testCase( &EdgeJunctionTensorTest::energyTensorTest));\n    }\n};\n\nint main()\n{\n    TensorTestSuite test;\n\n    int failed = test.run();\n\n    std::cout << test.report() << std::endl;\n\n    return (failed != 0);\n}\n\n<commit_msg>addjusted error bound for energy tensor test<commit_after>\/* tensorimaging tests *\/\n\n#include <iostream>\n#include <functional>\n#include <cmath>\n#include \"unittest.hxx\"\n#include \"vigra\/stdimage.hxx\"\n#include \"vigra\/impex.hxx\"\n#include \"vigra\/tensorutilities.hxx\"\n#include \"vigra\/orientedtensorfilters.hxx\"\n#include \"vigra\/boundarytensor.hxx\"\n#include \"vigra\/gradient_energy_tensor.hxx\"\n\nusing namespace vigra;\n\nstruct TensorUtilityTest\n{\n    typedef vigra::DImage Image;\n    typedef vigra::DVector2Image V2Image;\n    typedef vigra::DVector3Image V3Image;\n\n    TensorUtilityTest()\n    : w(5), h(5),\n      img2(w, h), img3(w, h)\n    {\n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                img2(x,y)[0] = x;\n                img2(x,y)[1] = y;\n            }\n        }\n        vectorToTensor(srcImageRange(img2), destImage(img3));\n    }\n\n    void vector2TensorTest()\n    {\n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                shouldEqual(img3(x,y)[0], x*x);\n                shouldEqual(img3(x,y)[1], -x*y);\n                shouldEqual(img3(x,y)[2], y*y);\n            }\n        }\n    }\n    \n    void tensorEigenRepresentationTest()\n    {\n        V3Image res(img3.size());\n        tensorEigenRepresentation(srcImageRange(img3), destImage(res));\n        \n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                shouldEqual(res(x,y)[0]+res(x,y)[1], img3(x,y)[0] + img3(x,y)[2]);\n                shouldEqual(res(x,y)[0]*res(x,y)[1], \n                            img3(x,y)[0]*img3(x,y)[2]-sq(img3(x,y)[1]));\n                shouldEqualTolerance(res(x,y)[2], \n                                    VIGRA_CSTD::atan2((double)-y, (double)x), 1e-12);\n            }\n        }\n    }\n    \n    void tensorTraceTest()\n    {\n        Image res(img3.size());\n        tensorTrace(srcImageRange(img3), destImage(res));\n        \n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                shouldEqual(res(x,y), img3(x,y)[0] + img3(x,y)[2]);\n            }\n        }\n    }\n    \n    \n    void tensorToEdgeCornerTest()\n    {\n        V2Image edge(img3.size());\n        Image corner(img3.size());\n        tensorToEdgeCorner(srcImageRange(img3), destImage(edge), destImage(corner));\n        V3Image eigen(img3.size());\n        tensorEigenRepresentation(srcImageRange(img3), destImage(eigen));\n        \n        for(int y = 0; y < h; ++y)\n        {\n            for(int x = 0; x < w; ++x)\n            {\n                shouldEqual(edge(x,y)[0], eigen(x,y)[0]-eigen(x,y)[1]);\n                shouldEqual(edge(x,y)[1], eigen(x,y)[2]);\n                shouldEqual(corner(x,y), 2.0*eigen(x,y)[1]);\n            }\n        }\n    }\n    \n    int w, h;\n    V2Image img2;\n    V3Image img3;    \n};\n\n#define defImpulseResponseTest(xorder, yorder) \\\n    void rieszTransform##xorder##yorder##Test() \\\n    { \\\n        Image res(img1.size()), ref(img1.size()); \\\n        ImageImportInfo iref(\"riesz\" #xorder #yorder \".xv\"); \\\n        importImage(iref, destImage(ref)); \\\n        \\\n        rieszTransformOfLOG(srcImageRange(img1), destImage(res), 2.0, xorder, yorder); \\\n        \\\n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12); \\\n    } \\\n    \n\n\nstruct EdgeJunctionTensorTest\n{\n    typedef vigra::DImage Image;\n    typedef vigra::DVector2Image V2Image;\n    typedef vigra::DVector3Image V3Image;\n\n    EdgeJunctionTensorTest()\n    : img1(17, 17)\n    {\n        img1.init(0.0);\n        img1(8,8) = 1.0;\n\n        ImageImportInfo i2(\"l2.xv\");\n        img2.resize(i2.size());\n        importImage(i2, destImage(img2));\n    }\n\n    defImpulseResponseTest(0, 0)\n    defImpulseResponseTest(1, 0)\n    defImpulseResponseTest(0, 1)\n    defImpulseResponseTest(2, 0)\n    defImpulseResponseTest(1, 1)\n    defImpulseResponseTest(0, 2)\n\n    void boundaryTensorTest0()\n    {\n        V3Image res(img1.size()), ref(img1.size());\n        ImageImportInfo iref(\"boundaryTensor.xv\");\n        importImage(iref, destImage(ref));\n        \n        boundaryTensor(srcImageRange(img1), destImage(res), 2.0);\n        \n        for(V3Image::iterator i = res.begin(), j = ref.begin(); i < res.end(); ++i, ++j)\n        {\n            shouldEqualTolerance(i->magnitude(), j->magnitude(), 1e-12);\n        }\n    }\n\n    void boundaryTensorTest1()\n    {\n        V3Image bt(img2.size());\n        Image res(img2.size()), ref(img2.size());\n        ImageImportInfo iref(\"l2_boundary1.xv\");\n        importImage(iref, destImage(ref));\n\n        boundaryTensor1(srcImageRange(img2), destImage(bt), 2.0);\n        tensorTrace(srcImageRange(bt), destImage(res));\n        \n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n\n    void boundaryTensorTest2()\n    {\n        V3Image bt(img2.size());\n        Image res(img2.size()), ref(img2.size());\n        ImageImportInfo iref(\"l2_boundary.xv\");\n        importImage(iref, destImage(ref));\n\n        boundaryTensor(srcImageRange(img2), destImage(bt), 2.0);\n        tensorTrace(srcImageRange(bt), destImage(res));\n        \n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n\n    void boundaryTensorTest3()\n    {\n        \/\/ does not produce the correct result\n        Image res(img2.size());\n        {\n            V3Image bt(img2.size()), bt2(img2.size());\n\n            boundaryTensor3(srcImageRange(img2), destImage(bt), destImage(bt2), 1.0);\n            combineTwoImages(srcImageRange(bt), srcImage(bt2), destImage(bt2), \n                         std::plus<V3Image::value_type>());\n            tensorTrace(srcImageRange(bt2), destImage(res));\n        }\n        Image ref(img2.size());\n        ImageImportInfo iref(\"l2_boundary3.xv\");\n        importImage(iref, destImage(ref));\n\n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n    \n    void hourglassTest()\n    {\n        V2Image gradient(img2.size());\n        V3Image tensor(img2.size()), smoothedTensor(img2.size());\n        Image res(img2.size()), ref(img2.size());\n        ImageImportInfo iref(\"l2_hourglass.xv\");\n        importImage(iref, destImage(ref));\n\n        gaussianGradient(srcImageRange(img2), destImage(gradient), 0.7);\n        vectorToTensor(srcImageRange(gradient), destImage(tensor));\n        hourGlassFilter(srcImageRange(tensor), destImage(smoothedTensor), 2.8, 0.4);\n        tensorTrace(srcImageRange(smoothedTensor), destImage(res));\n  \n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-12);\n    }\n\n    void energyTensorTest()\n    {\n        V3Image get(img2.size());\n        Image res(img2.size()), ref(img2.size());\n        ImageImportInfo iref(\"l2_get.xv\");\n        importImage(iref, destImage(ref));\n\n        Kernel1D<double> smooth, grad;\n        smooth.initGaussian(1.0);\n        grad.initGaussianDerivative(1.0, 1);\n        gradientEnergyTensor(srcImageRange(img2), destImage(get), grad, smooth);\n        tensorTrace(srcImageRange(get), destImage(res));\n\n        shouldEqualSequenceTolerance(res.begin(), res.end(), ref.begin(), 1e-10);\n    }\n\n    Image img1, img2;\n};\n\nstruct TensorTestSuite\n: public vigra::test_suite\n{\n    TensorTestSuite()\n    : vigra::test_suite(\"TensorTestSuite\")\n    {\n        add( testCase( &TensorUtilityTest::vector2TensorTest));\n        add( testCase( &TensorUtilityTest::tensorEigenRepresentationTest));\n        add( testCase( &TensorUtilityTest::tensorTraceTest));\n        add( testCase( &TensorUtilityTest::tensorToEdgeCornerTest));\n\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform00Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform10Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform01Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform20Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform11Test));\n        add( testCase( &EdgeJunctionTensorTest::rieszTransform02Test));\n        add( testCase( &EdgeJunctionTensorTest::boundaryTensorTest0));\n        add( testCase( &EdgeJunctionTensorTest::boundaryTensorTest1));\n        add( testCase( &EdgeJunctionTensorTest::boundaryTensorTest2));\n        add( testCase( &EdgeJunctionTensorTest::hourglassTest));\n        add( testCase( &EdgeJunctionTensorTest::energyTensorTest));\n    }\n};\n\nint main()\n{\n    TensorTestSuite test;\n\n    int failed = test.run();\n\n    std::cout << test.report() << std::endl;\n\n    return (failed != 0);\n}\n\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\/test_file_util.h\"\n\n#include <windows.h>\n\n#include <vector>\n\n#include \"base\/file_util.h\"\n#include \"base\/scoped_handle.h\"\n\nnamespace file_util {\n\n\/\/ We could use GetSystemInfo to get the page size, but this serves\n\/\/ our purpose fine since 4K is the page size on x86 as well as x64.\nstatic const ptrdiff_t kPageSize = 4096;\n\nbool EvictFileFromSystemCache(const wchar_t* file) {\n  \/\/ Request exclusive access to the file and overwrite it with no buffering.\n  ScopedHandle file_handle(\n      CreateFile(file, GENERIC_READ | GENERIC_WRITE, 0, NULL,\n                 OPEN_EXISTING, FILE_FLAG_NO_BUFFERING, NULL));\n  if (!file_handle)\n    return false;\n\n  \/\/ Get some attributes to restore later.\n  BY_HANDLE_FILE_INFORMATION bhi = {0};\n  CHECK(::GetFileInformationByHandle(file_handle, &bhi));\n\n  \/\/ Execute in chunks. It could be optimized. We want to do few of these since\n  \/\/ these operations will be slow without the cache.\n\n  \/\/ Non-buffered reads and writes need to be sector aligned and since sector\n  \/\/ sizes typically range from 512-4096 bytes, we just use the page size.\n  \/\/ The buffer size is twice the size of a page (minus one) since we need to\n  \/\/ get an aligned pointer into the buffer that we can use.\n  char buffer[2 * kPageSize - 1];\n  \/\/ Get an aligned pointer into buffer.\n  char* read_write = reinterpret_cast<char*>(\n      reinterpret_cast<ptrdiff_t>(buffer + kPageSize - 1) & ~(kPageSize - 1));\n  DCHECK((reinterpret_cast<int>(read_write) % kPageSize) == 0);\n\n  \/\/ If the file size isn't a multiple of kPageSize, we'll need special\n  \/\/ processing.\n  bool file_is_page_aligned = true;\n  int total_bytes = 0;\n  DWORD bytes_read, bytes_written;\n  for (;;) {\n    bytes_read = 0;\n    ReadFile(file_handle, read_write, kPageSize, &bytes_read, NULL);\n    if (bytes_read == 0)\n      break;\n\n    if (bytes_read < kPageSize) {\n      \/\/ Zero out the remaining part of the buffer.\n      \/\/ WriteFile will fail if we provide a buffer size that isn't a\n      \/\/ sector multiple, so we'll have to write the entire buffer with\n      \/\/ padded zeros and then use SetEndOfFile to truncate the file.\n      ZeroMemory(read_write + bytes_read, kPageSize - bytes_read);\n      file_is_page_aligned = false;\n    }\n\n    \/\/ Move back to the position we just read from.\n    \/\/ Note that SetFilePointer will also fail if total_bytes isn't sector\n    \/\/ aligned, but that shouldn't happen here.\n    DCHECK((total_bytes % kPageSize) == 0);\n    SetFilePointer(file_handle, total_bytes, NULL, FILE_BEGIN);\n    if (!WriteFile(file_handle, read_write, kPageSize, &bytes_written, NULL) ||\n        bytes_written != kPageSize) {\n      DCHECK(false);\n      return false;\n    }\n\n    total_bytes += bytes_read;\n\n    \/\/ If this is false, then we just processed the last portion of the file.\n    if (!file_is_page_aligned)\n      break;\n  }\n\n  if (!file_is_page_aligned) {\n    \/\/ The size of the file isn't a multiple of the page size, so we'll have\n    \/\/ to open the file again, this time without the FILE_FLAG_NO_BUFFERING\n    \/\/ flag and use SetEndOfFile to mark EOF.\n    file_handle.Set(CreateFile(file, GENERIC_WRITE, 0, NULL, OPEN_EXISTING,\n                               0, NULL));\n    CHECK(SetFilePointer(file_handle, total_bytes, NULL, FILE_BEGIN) !=\n          INVALID_SET_FILE_POINTER);\n    CHECK(::SetEndOfFile(file_handle));\n  }\n\n  \/\/ Restore the file attributes.\n  CHECK(::SetFileTime(file_handle, &bhi.ftCreationTime, &bhi.ftLastAccessTime,\n                      &bhi.ftLastWriteTime));\n\n  return true;\n}\n\n\/\/ Like CopyFileNoCache but recursively copies all files and subdirectories\n\/\/ in the given input directory to the output directory.\nbool CopyRecursiveDirNoCache(const std::wstring& source_dir,\n                             const std::wstring& dest_dir) {\n  \/\/ Try to create the directory if it doesn't already exist.\n  if (!CreateDirectory(dest_dir)) {\n    if (GetLastError() != ERROR_ALREADY_EXISTS)\n      return false;\n  }\n\n  std::vector<std::wstring> files_copied;\n\n  std::wstring src(source_dir);\n  file_util::AppendToPath(&src, L\"*\");\n\n  WIN32_FIND_DATA fd;\n  HANDLE fh = FindFirstFile(src.c_str(), &fd);\n  if (fh == INVALID_HANDLE_VALUE)\n    return false;\n\n  do {\n    std::wstring cur_file(fd.cFileName);\n    if (cur_file == L\".\" || cur_file == L\"..\")\n      continue;  \/\/ Skip these special entries.\n\n    std::wstring cur_source_path(source_dir);\n    file_util::AppendToPath(&cur_source_path, cur_file);\n\n    std::wstring cur_dest_path(dest_dir);\n    file_util::AppendToPath(&cur_dest_path, cur_file);\n\n    if (fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n      \/\/ Recursively copy a subdirectory. We stripped \".\" and \"..\" already.\n      if (!CopyRecursiveDirNoCache(cur_source_path, cur_dest_path)) {\n        FindClose(fh);\n        return false;\n      }\n    } else {\n      \/\/ Copy the file.\n      if (!::CopyFile(cur_source_path.c_str(), cur_dest_path.c_str(), false)) {\n        FindClose(fh);\n        return false;\n      }\n\n      \/\/ We don't check for errors from this function, often, we are copying\n      \/\/ files that are in the repository, and they will have read-only set.\n      \/\/ This will prevent us from evicting from the cache, but these don't\n      \/\/ matter anyway.\n      EvictFileFromSystemCache(cur_dest_path.c_str());\n    }\n  } while (FindNextFile(fh, &fd));\n\n  FindClose(fh);\n  return true;\n}\n\n}  \/\/ namespace file_util\n\n<commit_msg>Fix CloseHandle blunder.  I was thinking that the handle would be closed by Set, but of course I need to close the handle before the CreateFile call... doh!<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\/test_file_util.h\"\n\n#include <windows.h>\n\n#include <vector>\n\n#include \"base\/file_util.h\"\n#include \"base\/scoped_handle.h\"\n\nnamespace file_util {\n\n\/\/ We could use GetSystemInfo to get the page size, but this serves\n\/\/ our purpose fine since 4K is the page size on x86 as well as x64.\nstatic const ptrdiff_t kPageSize = 4096;\n\nbool EvictFileFromSystemCache(const wchar_t* file) {\n  \/\/ Request exclusive access to the file and overwrite it with no buffering.\n  ScopedHandle file_handle(\n      CreateFile(file, GENERIC_READ | GENERIC_WRITE, 0, NULL,\n                 OPEN_EXISTING, FILE_FLAG_NO_BUFFERING, NULL));\n  if (!file_handle)\n    return false;\n\n  \/\/ Get some attributes to restore later.\n  BY_HANDLE_FILE_INFORMATION bhi = {0};\n  CHECK(::GetFileInformationByHandle(file_handle, &bhi));\n\n  \/\/ Execute in chunks. It could be optimized. We want to do few of these since\n  \/\/ these operations will be slow without the cache.\n\n  \/\/ Non-buffered reads and writes need to be sector aligned and since sector\n  \/\/ sizes typically range from 512-4096 bytes, we just use the page size.\n  \/\/ The buffer size is twice the size of a page (minus one) since we need to\n  \/\/ get an aligned pointer into the buffer that we can use.\n  char buffer[2 * kPageSize - 1];\n  \/\/ Get an aligned pointer into buffer.\n  char* read_write = reinterpret_cast<char*>(\n      reinterpret_cast<ptrdiff_t>(buffer + kPageSize - 1) & ~(kPageSize - 1));\n  DCHECK((reinterpret_cast<int>(read_write) % kPageSize) == 0);\n\n  \/\/ If the file size isn't a multiple of kPageSize, we'll need special\n  \/\/ processing.\n  bool file_is_page_aligned = true;\n  int total_bytes = 0;\n  DWORD bytes_read, bytes_written;\n  for (;;) {\n    bytes_read = 0;\n    ReadFile(file_handle, read_write, kPageSize, &bytes_read, NULL);\n    if (bytes_read == 0)\n      break;\n\n    if (bytes_read < kPageSize) {\n      \/\/ Zero out the remaining part of the buffer.\n      \/\/ WriteFile will fail if we provide a buffer size that isn't a\n      \/\/ sector multiple, so we'll have to write the entire buffer with\n      \/\/ padded zeros and then use SetEndOfFile to truncate the file.\n      ZeroMemory(read_write + bytes_read, kPageSize - bytes_read);\n      file_is_page_aligned = false;\n    }\n\n    \/\/ Move back to the position we just read from.\n    \/\/ Note that SetFilePointer will also fail if total_bytes isn't sector\n    \/\/ aligned, but that shouldn't happen here.\n    DCHECK((total_bytes % kPageSize) == 0);\n    SetFilePointer(file_handle, total_bytes, NULL, FILE_BEGIN);\n    if (!WriteFile(file_handle, read_write, kPageSize, &bytes_written, NULL) ||\n        bytes_written != kPageSize) {\n      DCHECK(false);\n      return false;\n    }\n\n    total_bytes += bytes_read;\n\n    \/\/ If this is false, then we just processed the last portion of the file.\n    if (!file_is_page_aligned)\n      break;\n  }\n\n  if (!file_is_page_aligned) {\n    \/\/ The size of the file isn't a multiple of the page size, so we'll have\n    \/\/ to open the file again, this time without the FILE_FLAG_NO_BUFFERING\n    \/\/ flag and use SetEndOfFile to mark EOF.\n    file_handle.Set(NULL);\n    file_handle.Set(CreateFile(file, GENERIC_WRITE, 0, NULL, OPEN_EXISTING,\n                               0, NULL));\n    CHECK(SetFilePointer(file_handle, total_bytes, NULL, FILE_BEGIN) !=\n          INVALID_SET_FILE_POINTER);\n    CHECK(::SetEndOfFile(file_handle));\n  }\n\n  \/\/ Restore the file attributes.\n  CHECK(::SetFileTime(file_handle, &bhi.ftCreationTime, &bhi.ftLastAccessTime,\n                      &bhi.ftLastWriteTime));\n\n  return true;\n}\n\n\/\/ Like CopyFileNoCache but recursively copies all files and subdirectories\n\/\/ in the given input directory to the output directory.\nbool CopyRecursiveDirNoCache(const std::wstring& source_dir,\n                             const std::wstring& dest_dir) {\n  \/\/ Try to create the directory if it doesn't already exist.\n  if (!CreateDirectory(dest_dir)) {\n    if (GetLastError() != ERROR_ALREADY_EXISTS)\n      return false;\n  }\n\n  std::vector<std::wstring> files_copied;\n\n  std::wstring src(source_dir);\n  file_util::AppendToPath(&src, L\"*\");\n\n  WIN32_FIND_DATA fd;\n  HANDLE fh = FindFirstFile(src.c_str(), &fd);\n  if (fh == INVALID_HANDLE_VALUE)\n    return false;\n\n  do {\n    std::wstring cur_file(fd.cFileName);\n    if (cur_file == L\".\" || cur_file == L\"..\")\n      continue;  \/\/ Skip these special entries.\n\n    std::wstring cur_source_path(source_dir);\n    file_util::AppendToPath(&cur_source_path, cur_file);\n\n    std::wstring cur_dest_path(dest_dir);\n    file_util::AppendToPath(&cur_dest_path, cur_file);\n\n    if (fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n      \/\/ Recursively copy a subdirectory. We stripped \".\" and \"..\" already.\n      if (!CopyRecursiveDirNoCache(cur_source_path, cur_dest_path)) {\n        FindClose(fh);\n        return false;\n      }\n    } else {\n      \/\/ Copy the file.\n      if (!::CopyFile(cur_source_path.c_str(), cur_dest_path.c_str(), false)) {\n        FindClose(fh);\n        return false;\n      }\n\n      \/\/ We don't check for errors from this function, often, we are copying\n      \/\/ files that are in the repository, and they will have read-only set.\n      \/\/ This will prevent us from evicting from the cache, but these don't\n      \/\/ matter anyway.\n      EvictFileFromSystemCache(cur_dest_path.c_str());\n    }\n  } while (FindNextFile(fh, &fd));\n\n  FindClose(fh);\n  return true;\n}\n\n}  \/\/ namespace file_util\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _TOOLBOX_CPP_FORMAT_HPP_\n#define _TOOLBOX_CPP_FORMAT_HPP_\n\n#include <toolbox\/container\/stack.hpp>\n\nnamespace toolbox\n{\n\nnamespace format {\nnamespace detail {\nstruct flags {\n    bool hex = 0;\n};\n} \/\/ namespace detail\ntemplate<typename Output, typename T>\nvoid format_argument(Output &out, detail::flags flags, T number)\n{\n    \/\/ TODO: may be removed when we fix stack size\n    static_assert(sizeof(number) <= 4, \"does not support integer types > 4 bytes\");\n\n    if (flags.hex == false) {\n        \/\/ TODO: allocate stack based on max dec representation\n        \/\/ of type T, for now we assume 32 bit integer which\n        \/\/ may have up to 10 digits in dec representation\n        toolbox::stack<char, 10> stack;\n\n        while (number != 0) {\n            char c = number % 10;\n            stack.emplace_back('0' + c);\n            number = number \/ 10;\n        }\n\n        while (stack.size()) {\n            out.put(stack.back());\n            stack.pop_back();\n        }\n    } else if (flags.hex == true) {\n        static char lt[] = {\n            '0', '1', '2', '3', '4',\n            '5', '6', '7', '8', '9',\n            'A', 'B', 'C', 'D', 'E',\n            'F'\n        };\n\n        constexpr auto hexSize = sizeof(T) * 2;\n        for (int i = 0; i < hexSize; i ++) {\n            out.put(\n                lt[(number >> (hexSize-1-i)*4) & 0xf]\n            );\n        }\n    }\n}\n\n\ntemplate<typename Output>\nvoid print(Output &out, const char *fmt)\n{\n    while (*fmt) {\n        out.put(*fmt);\n        fmt ++;\n    }\n}\n\ntemplate<typename Output, typename Next, typename... Args>\nvoid print(Output &out, const char *fmt, Next next, Args... args)\n{\n    bool format = false;\n    detail::flags flags;\n\n    while (*fmt) {\n        if (format) {\n            if (*fmt == 'x')\n                flags.hex = true;\n\n            if (*fmt == '}') {\n                format_argument(out, flags, next);\n                print(out, fmt + 1, args...);\n                return;\n            }\n        } else {\n            if (*fmt != '{') {\n                out.put(*fmt);\n            } else {\n                format = true;\n                flags = detail::flags{};\n            }\n        }\n\n        fmt ++;\n    }\n}\n\n} \/\/ namespace format\n} \/\/ namespace toolbox\n\n#endif \/\/ _TOOLBOX_CPP_FORMAT_HPP_<commit_msg>format: separate fmt string parsing from actual print function<commit_after>#ifndef _TOOLBOX_CPP_FORMAT_HPP_\n#define _TOOLBOX_CPP_FORMAT_HPP_\n\n#include <toolbox\/container\/stack.hpp>\n#include <toolbox\/span.hpp>\n\nnamespace toolbox\n{\n\nnamespace format {\nnamespace detail {\nstruct flags {\n    bool hex = 0;\n};\n} \/\/ namespace detail\ntemplate<typename Output, typename T>\nvoid format(Output &out, detail::flags flags, T number)\n{\n    \/\/ TODO: may be removed when we fix stack size\n    static_assert(sizeof(number) <= 4, \"does not support integer types > 4 bytes\");\n\n    if (flags.hex == false) {\n        \/\/ TODO: allocate stack based on max dec representation\n        \/\/ of type T, for now we assume 32 bit integer which\n        \/\/ may have up to 10 digits in dec representation\n        toolbox::stack<char, 10> stack;\n\n        while (number != 0) {\n            char c = number % 10;\n            stack.emplace_back('0' + c);\n            number = number \/ 10;\n        }\n\n        while (stack.size()) {\n            out.put(stack.back());\n            stack.pop_back();\n        }\n    } else if (flags.hex == true) {\n        static char lt[] = {\n            '0', '1', '2', '3', '4',\n            '5', '6', '7', '8', '9',\n            'A', 'B', 'C', 'D', 'E',\n            'F'\n        };\n\n        constexpr auto hexSize = sizeof(T) * 2;\n        for (int i = 0; i < hexSize; i ++) {\n            out.put(\n                lt[(number >> (hexSize-1-i)*4) & 0xf]\n            );\n        }\n    }\n}\n\n\ntemplate<typename Output>\nvoid print(Output &out, const char *fmt)\n{\n    while (*fmt) {\n        out.put(*fmt);\n        fmt ++;\n    }\n}\n\ntemplate<typename Output, typename Next>\nvoid format_argument(Output &out, span<const char> fmt, const Next &next)\n{\n    detail::flags flags;\n\n    for (auto c : fmt)\n    {\n        if (c == 'x') {\n            flags.hex = true;\n        }\n    }\n\n    format(out, flags, next);\n}\n\ntemplate<typename Output, typename Next, typename... Args>\nvoid print(Output &out, const char *fmt, Next next, Args... args)\n{\n    bool format = false;\n    const char *fmtBegin = nullptr;\n    detail::flags flags;\n\n    while (*fmt) {\n        if (format) {\n            if (*fmt == '}') {\n                format_argument(out, span<const char>{fmtBegin, fmt}, next);\n                print(out, fmt + 1, args...);\n                return;\n            }\n        } else {\n            if (*fmt != '{') {\n                out.put(*fmt);\n            } else {\n                format = true;\n                fmtBegin = fmt + 1;\n            }\n        }\n\n        fmt ++;\n    }\n}\n\n} \/\/ namespace format\n} \/\/ namespace toolbox\n\n#endif \/\/ _TOOLBOX_CPP_FORMAT_HPP_\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <vector>\n\n#include <memory>\n\n#include <valijson\/constraints\/constraint.hpp>\n#include <valijson\/internal\/optional.hpp>\n#include <valijson\/exceptions.hpp>\n\nnamespace valijson {\n\n\/**\n * Represents a sub-schema within a JSON Schema\n *\n * While all JSON Schemas have at least one sub-schema, the root, some will\n * have additional sub-schemas that are defined as part of constraints that are\n * included in the schema. For example, a 'oneOf' constraint maintains a set of\n * references to one or more nested sub-schemas. As per the definition of a\n * oneOf constraint, a document is valid within that constraint if it validates\n * against one of the nested sub-schemas.\n *\/\nclass Subschema\n{\npublic:\n\n    \/\/\/ Typedef for custom new-\/malloc-like function\n    typedef void * (*CustomAlloc)(size_t size);\n\n    \/\/\/ Typedef for custom free-like function\n    typedef void (*CustomFree)(void *);\n\n    \/\/\/ Typedef the Constraint class into the local namespace for convenience\n    typedef constraints::Constraint Constraint;\n\n    \/\/\/ Typedef for a function that can be applied to each of the Constraint\n    \/\/\/ instances owned by a Schema.\n    typedef std::function<bool (const Constraint &)> ApplyFunction;\n\n    \/\/ Disable copy construction\n    Subschema(const Subschema &) = delete;\n\n    \/\/ Disable copy assignment\n    Subschema & operator=(const Subschema &) = delete;\n\n    \/**\n     * @brief  Construct a new Subschema object\n     *\/\n    Subschema()\n      : m_allocFn(::operator new)\n      , m_freeFn(::operator delete)\n      , m_alwaysInvalid(false) { }\n\n    \/**\n     * @brief  Construct a new Subschema using custom memory management\n     *         functions\n     *\n     * @param  allocFn  malloc- or new-like function to allocate memory\n     *                  within Schema, such as for Subschema instances\n     * @param  freeFn   free-like function to free memory allocated with\n     *                  the `customAlloc` function\n     *\/\n    Subschema(CustomAlloc allocFn, CustomFree freeFn)\n      : m_allocFn(allocFn)\n      , m_freeFn(freeFn)\n      , m_alwaysInvalid(false)\n    {\n        \/\/ explicitly initialise optionals. See: https:\/\/github.com\/tristanpenman\/valijson\/issues\/124\n        m_description = opt::nullopt;\n        m_id = opt::nullopt;\n        m_title = opt::nullopt;\n    }\n\n    \/**\n     * @brief  Clean up and free all memory managed by the Subschema\n     *\/\n    virtual ~Subschema()\n    {\n#if VALIJSON_USE_EXCEPTIONS\n        try {\n#endif\n            for (auto constConstraint : m_constraints) {\n                auto *constraint = const_cast<Constraint *>(constConstraint);\n                constraint->~Constraint();\n                m_freeFn(constraint);\n            }\n            m_constraints.clear();\n#if VALIJSON_USE_EXCEPTIONS\n        } catch (const std::exception &e) {\n            fprintf(stderr, \"Caught an exception in Subschema destructor: %s\",\n                    e.what());\n        }\n#endif\n    }\n\n    \/**\n     * @brief  Add a constraint to this sub-schema\n     *\n     * The constraint will be copied before being added to the list of\n     * constraints for this Subschema. Note that constraints will be copied\n     * only as deep as references to other Subschemas - e.g. copies of\n     * constraints that refer to sub-schemas, will continue to refer to the\n     * same Subschema instances.\n     *\n     * @param  constraint  Reference to the constraint to copy\n     *\/\n    void addConstraint(const Constraint &constraint)\n    {\n        Constraint *newConstraint = constraint.clone(m_allocFn, m_freeFn);\n#if VALIJSON_USE_EXCEPTIONS\n        try {\n#endif\n            m_constraints.push_back(newConstraint);\n#if VALIJSON_USE_EXCEPTIONS\n        } catch (...) {\n            newConstraint->~Constraint();\n            m_freeFn(newConstraint);\n            throw;\n        }\n#endif\n    }\n\n    \/**\n     * @brief  Invoke a function on each child Constraint\n     *\n     * This function will apply the callback function to each constraint in\n     * the Subschema, even if one of the invokations returns \\c false. However,\n     * if one or more invokations of the callback function return \\c false,\n     * this function will also return \\c false.\n     *\n     * @returns  \\c true if all invokations of the callback function are\n     *           successful, \\c false otherwise\n     *\/\n    bool apply(ApplyFunction &applyFunction) const\n    {\n        bool allTrue = true;\n        for (const Constraint *constraint : m_constraints) {\n            allTrue = allTrue && applyFunction(*constraint);\n        }\n\n        return allTrue;\n    }\n\n    \/**\n     * @brief  Invoke a function on each child Constraint\n     *\n     * This is a stricter version of the apply() function that will return\n     * immediately if any of the invokations of the callback function return\n     * \\c false.\n     *\n     * @returns  \\c true if all invokations of the callback function are\n     *           successful, \\c false otherwise\n     *\/\n    bool applyStrict(ApplyFunction &applyFunction) const\n    {\n        for (const Constraint *constraint : m_constraints) {\n            if (!applyFunction(*constraint)) {\n                return false;\n            }\n        }\n\n        return true;\n    }\n\n    bool getAlwaysInvalid() const\n    {\n        return m_alwaysInvalid;\n    }\n\n    \/**\n     * @brief  Get the description associated with this sub-schema\n     *\n     * @throws  std::runtime_error if a description has not been set\n     *\n     * @returns  string containing sub-schema description\n     *\/\n    std::string getDescription() const\n    {\n        if (m_description) {\n            return *m_description;\n        }\n\n        throwRuntimeError(\"Schema does not have a description\");\n    }\n\n    \/**\n     * @brief  Get the ID associated with this sub-schema\n     *\n     * @throws  std::runtime_error if an ID has not been set\n     *\n     * @returns  string containing sub-schema ID\n     *\/\n    std::string getId() const\n    {\n        if (m_id) {\n            return *m_id;\n        }\n\n        throwRuntimeError(\"Schema does not have an ID\");\n    }\n\n    \/**\n     * @brief  Get the title associated with this sub-schema\n     *\n     * @throws  std::runtime_error if a title has not been set\n     *\n     * @returns  string containing sub-schema title\n     *\/\n    std::string getTitle() const\n    {\n        if (m_title) {\n            return *m_title;\n        }\n\n        throwRuntimeError(\"Schema does not have a title\");\n    }\n\n    \/**\n     * @brief  Check whether this sub-schema has a description\n     *\n     * @return boolean value\n     *\/\n    bool hasDescription() const\n    {\n        return static_cast<bool>(m_description);\n    }\n\n    \/**\n     * @brief  Check whether this sub-schema has an ID\n     *\n     * @return  boolean value\n     *\/\n    bool hasId() const\n    {\n        return static_cast<bool>(m_id);\n    }\n\n    \/**\n     * @brief  Check whether this sub-schema has a title\n     *\n     * @return  boolean value\n     *\/\n    bool hasTitle() const\n    {\n        return static_cast<bool>(m_title);\n    }\n\n    void setAlwaysInvalid(bool value)\n    {\n        m_alwaysInvalid = value;\n    }\n\n    \/**\n     * @brief  Set the description for this sub-schema\n     *\n     * The description will not be used for validation, but may be used as part\n     * of the user interface for interacting with schemas and sub-schemas. As\n     * an example, it may be used as part of the validation error descriptions\n     * that are produced by the Validator and ValidationVisitor classes.\n     *\n     * @param  description  new description\n     *\/\n    void setDescription(const std::string &description)\n    {\n        m_description = description;\n    }\n\n    void setId(const std::string &id)\n    {\n        m_id = id;\n    }\n\n    \/**\n     * @brief  Set the title for this sub-schema\n     *\n     * The title will not be used for validation, but may be used as part\n     * of the user interface for interacting with schemas and sub-schema. As an\n     * example, it may be used as part of the validation error descriptions\n     * that are produced by the Validator and ValidationVisitor classes.\n     *\n     * @param  title  new title\n     *\/\n    void setTitle(const std::string &title)\n    {\n        m_title = title;\n    }\n\nprotected:\n\n    CustomAlloc m_allocFn;\n\n    CustomFree m_freeFn;\n\nprivate:\n\n    bool m_alwaysInvalid;\n\n    \/\/\/ List of pointers to constraints that apply to this schema.\n    std::vector<const Constraint *> m_constraints;\n\n    \/\/\/ Schema description (optional)\n    opt::optional<std::string> m_description;\n\n    \/\/\/ Id to apply when resolving the schema URI\n    opt::optional<std::string> m_id;\n\n    \/\/\/ Title string associated with the schema (optional)\n    opt::optional<std::string> m_title;\n};\n\n} \/\/ namespace valijson\n<commit_msg>Always apply callback function when validating schema<commit_after>#pragma once\n\n#include <vector>\n\n#include <memory>\n\n#include <valijson\/constraints\/constraint.hpp>\n#include <valijson\/internal\/optional.hpp>\n#include <valijson\/exceptions.hpp>\n\nnamespace valijson {\n\n\/**\n * Represents a sub-schema within a JSON Schema\n *\n * While all JSON Schemas have at least one sub-schema, the root, some will\n * have additional sub-schemas that are defined as part of constraints that are\n * included in the schema. For example, a 'oneOf' constraint maintains a set of\n * references to one or more nested sub-schemas. As per the definition of a\n * oneOf constraint, a document is valid within that constraint if it validates\n * against one of the nested sub-schemas.\n *\/\nclass Subschema\n{\npublic:\n\n    \/\/\/ Typedef for custom new-\/malloc-like function\n    typedef void * (*CustomAlloc)(size_t size);\n\n    \/\/\/ Typedef for custom free-like function\n    typedef void (*CustomFree)(void *);\n\n    \/\/\/ Typedef the Constraint class into the local namespace for convenience\n    typedef constraints::Constraint Constraint;\n\n    \/\/\/ Typedef for a function that can be applied to each of the Constraint\n    \/\/\/ instances owned by a Schema.\n    typedef std::function<bool (const Constraint &)> ApplyFunction;\n\n    \/\/ Disable copy construction\n    Subschema(const Subschema &) = delete;\n\n    \/\/ Disable copy assignment\n    Subschema & operator=(const Subschema &) = delete;\n\n    \/**\n     * @brief  Construct a new Subschema object\n     *\/\n    Subschema()\n      : m_allocFn(::operator new)\n      , m_freeFn(::operator delete)\n      , m_alwaysInvalid(false) { }\n\n    \/**\n     * @brief  Construct a new Subschema using custom memory management\n     *         functions\n     *\n     * @param  allocFn  malloc- or new-like function to allocate memory\n     *                  within Schema, such as for Subschema instances\n     * @param  freeFn   free-like function to free memory allocated with\n     *                  the `customAlloc` function\n     *\/\n    Subschema(CustomAlloc allocFn, CustomFree freeFn)\n      : m_allocFn(allocFn)\n      , m_freeFn(freeFn)\n      , m_alwaysInvalid(false)\n    {\n        \/\/ explicitly initialise optionals. See: https:\/\/github.com\/tristanpenman\/valijson\/issues\/124\n        m_description = opt::nullopt;\n        m_id = opt::nullopt;\n        m_title = opt::nullopt;\n    }\n\n    \/**\n     * @brief  Clean up and free all memory managed by the Subschema\n     *\/\n    virtual ~Subschema()\n    {\n#if VALIJSON_USE_EXCEPTIONS\n        try {\n#endif\n            for (auto constConstraint : m_constraints) {\n                auto *constraint = const_cast<Constraint *>(constConstraint);\n                constraint->~Constraint();\n                m_freeFn(constraint);\n            }\n            m_constraints.clear();\n#if VALIJSON_USE_EXCEPTIONS\n        } catch (const std::exception &e) {\n            fprintf(stderr, \"Caught an exception in Subschema destructor: %s\",\n                    e.what());\n        }\n#endif\n    }\n\n    \/**\n     * @brief  Add a constraint to this sub-schema\n     *\n     * The constraint will be copied before being added to the list of\n     * constraints for this Subschema. Note that constraints will be copied\n     * only as deep as references to other Subschemas - e.g. copies of\n     * constraints that refer to sub-schemas, will continue to refer to the\n     * same Subschema instances.\n     *\n     * @param  constraint  Reference to the constraint to copy\n     *\/\n    void addConstraint(const Constraint &constraint)\n    {\n        Constraint *newConstraint = constraint.clone(m_allocFn, m_freeFn);\n#if VALIJSON_USE_EXCEPTIONS\n        try {\n#endif\n            m_constraints.push_back(newConstraint);\n#if VALIJSON_USE_EXCEPTIONS\n        } catch (...) {\n            newConstraint->~Constraint();\n            m_freeFn(newConstraint);\n            throw;\n        }\n#endif\n    }\n\n    \/**\n     * @brief  Invoke a function on each child Constraint\n     *\n     * This function will apply the callback function to each constraint in\n     * the Subschema, even if one of the invocations returns \\c false. However,\n     * if one or more invocations of the callback function return \\c false,\n     * this function will also return \\c false.\n     *\n     * @returns  \\c true if all invocations of the callback function are\n     *           successful, \\c false otherwise\n     *\/\n    bool apply(ApplyFunction &applyFunction) const\n    {\n        bool allTrue = true;\n        for (const Constraint *constraint : m_constraints) {\n            allTrue = applyFunction(*constraint) && allTrue;\n        }\n\n        return allTrue;\n    }\n\n    \/**\n     * @brief  Invoke a function on each child Constraint\n     *\n     * This is a stricter version of the apply() function that will return\n     * immediately if any of the invocations of the callback function return\n     * \\c false.\n     *\n     * @returns  \\c true if all invocations of the callback function are\n     *           successful, \\c false otherwise\n     *\/\n    bool applyStrict(ApplyFunction &applyFunction) const\n    {\n        for (const Constraint *constraint : m_constraints) {\n            if (!applyFunction(*constraint)) {\n                return false;\n            }\n        }\n\n        return true;\n    }\n\n    bool getAlwaysInvalid() const\n    {\n        return m_alwaysInvalid;\n    }\n\n    \/**\n     * @brief  Get the description associated with this sub-schema\n     *\n     * @throws  std::runtime_error if a description has not been set\n     *\n     * @returns  string containing sub-schema description\n     *\/\n    std::string getDescription() const\n    {\n        if (m_description) {\n            return *m_description;\n        }\n\n        throwRuntimeError(\"Schema does not have a description\");\n    }\n\n    \/**\n     * @brief  Get the ID associated with this sub-schema\n     *\n     * @throws  std::runtime_error if an ID has not been set\n     *\n     * @returns  string containing sub-schema ID\n     *\/\n    std::string getId() const\n    {\n        if (m_id) {\n            return *m_id;\n        }\n\n        throwRuntimeError(\"Schema does not have an ID\");\n    }\n\n    \/**\n     * @brief  Get the title associated with this sub-schema\n     *\n     * @throws  std::runtime_error if a title has not been set\n     *\n     * @returns  string containing sub-schema title\n     *\/\n    std::string getTitle() const\n    {\n        if (m_title) {\n            return *m_title;\n        }\n\n        throwRuntimeError(\"Schema does not have a title\");\n    }\n\n    \/**\n     * @brief  Check whether this sub-schema has a description\n     *\n     * @return boolean value\n     *\/\n    bool hasDescription() const\n    {\n        return static_cast<bool>(m_description);\n    }\n\n    \/**\n     * @brief  Check whether this sub-schema has an ID\n     *\n     * @return  boolean value\n     *\/\n    bool hasId() const\n    {\n        return static_cast<bool>(m_id);\n    }\n\n    \/**\n     * @brief  Check whether this sub-schema has a title\n     *\n     * @return  boolean value\n     *\/\n    bool hasTitle() const\n    {\n        return static_cast<bool>(m_title);\n    }\n\n    void setAlwaysInvalid(bool value)\n    {\n        m_alwaysInvalid = value;\n    }\n\n    \/**\n     * @brief  Set the description for this sub-schema\n     *\n     * The description will not be used for validation, but may be used as part\n     * of the user interface for interacting with schemas and sub-schemas. As\n     * an example, it may be used as part of the validation error descriptions\n     * that are produced by the Validator and ValidationVisitor classes.\n     *\n     * @param  description  new description\n     *\/\n    void setDescription(const std::string &description)\n    {\n        m_description = description;\n    }\n\n    void setId(const std::string &id)\n    {\n        m_id = id;\n    }\n\n    \/**\n     * @brief  Set the title for this sub-schema\n     *\n     * The title will not be used for validation, but may be used as part\n     * of the user interface for interacting with schemas and sub-schema. As an\n     * example, it may be used as part of the validation error descriptions\n     * that are produced by the Validator and ValidationVisitor classes.\n     *\n     * @param  title  new title\n     *\/\n    void setTitle(const std::string &title)\n    {\n        m_title = title;\n    }\n\nprotected:\n\n    CustomAlloc m_allocFn;\n\n    CustomFree m_freeFn;\n\nprivate:\n\n    bool m_alwaysInvalid;\n\n    \/\/\/ List of pointers to constraints that apply to this schema.\n    std::vector<const Constraint *> m_constraints;\n\n    \/\/\/ Schema description (optional)\n    opt::optional<std::string> m_description;\n\n    \/\/\/ Id to apply when resolving the schema URI\n    opt::optional<std::string> m_id;\n\n    \/\/\/ Title string associated with the schema (optional)\n    opt::optional<std::string> m_title;\n};\n\n} \/\/ namespace valijson\n<|endoftext|>"}
{"text":"<commit_before>#ifndef TREEHASH_UTIL\n#define TREEHASH_UTIL\n\n#include <cstdint>\n#include \"immintrin.h\"\n\ntypedef uint64_t ui128[2];\n\n\/\/ Multiply two unsigned 64-bit ints, producing a 128-bit int but\n\/\/ returning only the high-order bits.\nstatic inline uint64_t mulHi(uint64_t x, uint64_t y) {\n  uint64_t lo, hi;\n  __asm__(\"mulq %3\" : \"=a,a\"(lo), \"=d,d\"(hi) : \"%0,0\"(x), \"r,m\"(y));\n  return hi;\n}\n\/\/ Universal hashing of x and y\nstatic inline uint64_t deltaDietz(const ui128 h, const uint64_t x,\n                                   const uint64_t y) {\n  return x + y * h[1] + mulHi(y, h[0]);\n}\n\nstatic inline uint64_t bigendian(const ui128 h, const uint64_t x,\n                                 const uint64_t y) {\n  const uint64_t hlo = h[0] | 0x1;\n  return h[1] * x + hlo * y + mulHi(hlo, x);\n}\n\n\/\/ Universal hashing 512 bits down to 256 bits using 128 bits of\n\/\/ random data, with collision probability 2^-64.\n\/\/\n\/\/ r128x2 is 128 bits of random data, duplicated.\n\/\/\n\/\/ The method we use is one that relies on:\n\/\/\n\/\/ 1. CLNH\n\/\/\n\/\/ 2. The fact that if H is a almost delta-universal family, we can\n\/\/ get an almost universal family by using one value from H and then\n\/\/ performing an addition in the codomain. This has been noted in the\n\/\/ Badger paper, as well as by Woelfel in \"A construction method for\n\/\/ optimally universal hash families and its consequences for the\n\/\/ existence of RBIBDs.\".\nstatic inline __m256i clUniv512(const __m256i r128x2, const __m256i d0, const __m256i d1) {\n  __m256i result = _mm256_xor_si256(r128x2, d0);\n\n  \/\/ I think cast gets the lower bits of an __m256i\n  __m128i x = _mm256_castsi256_si128(result);\n  __m128i y = _mm256_extracti128_si256(result, 1);\n\n  x = _mm_clmulepi64_si128(x, x, 1);\n  y = _mm_clmulepi64_si128(y, y, 1);\n\n  \/\/ I believe cast puts into the lower order bits of an __m256i\n  result = _mm256_castsi128_si256(x);\n  result = _mm256_inserti128_si256(result, y, 1);\n\n  return _mm256_xor_si256(result, d1);\n}\n\n\/\/ In the interest of reducing code duplication, it is useful to\n\/\/ parameterize treehashes by the primitive they use. By \"primitive\",\n\/\/ I mean the building block that hashes R^2 down to R for some\n\/\/ universe R. or instance, deltaDietz hashes uint64_t^2 down to\n\/\/ uint64_t.\n\/\/\n\/\/ We'll need a few ingredients:\nstruct MultiplyShift {\n  \/\/ First, we need to know what R is in the notation above. This is\n  \/\/ called an Atom, because from the point of view of the\n  \/\/ parameterized hash algorithm, it cannot be broken up into\n  \/\/ component parts.\n  typedef uint64_t Atom;\n\n private:\n  \/\/ Second, we need to know the type of the random data needed to\n  \/\/ hash Atom^2 down to Atom.\n  typedef ui128 Rand;\n\n public:\n  \/\/ Third, we need to know the size of Atom in bytes. The sizeof\n  \/\/ keyword won't always be enough is clients of this class, since\n  \/\/ sometimes Atom is an array and \"decays\" into pointers.\n  const static size_t ATOM_SIZE = sizeof(uint64_t);\n  \/\/ Fourth, we need a way to copy Atoms.\n  inline static void AtomCopy(Atom *x, const Atom &y) { *x = y; }\n  \/\/ Fifth, we need to expose the hash family itself.\n  inline void Hash(Atom *out, int i, const Atom &in0, const Atom &in1) const {\n    *out = deltaDietz(r[i], in0, in1);\n  }\n\n  \/\/ Sixth, we need to store a particular array of random values. We\n  \/\/ have to store these because some primitives need to preprocess\n  \/\/ the random bits into an array of Rands. There is an example\n  \/\/ below, but an easy one to think of is hashing modulo a prime. For\n  \/\/ those hash families, we get data in, say, 8-bit chunks, but we\n  \/\/ need random values modulo p, so we have to pre-process.\n  \/\/\n  \/\/ We will need one Rand for each level of the tree hash. When we\n  \/\/ pre-process, these values may require extra storage space. Since\n  \/\/ that depends on the primitive, we keep the data in this struct\n  \/\/ itself.\n private:\n  const Rand *r;\n\n public:\n  \/\/ In a primitive that needs preprocessing, depth indicates how many\n  \/\/ random items to take - it is the depth of the treehash. We take\n  \/\/ as an argument a const void ** that we update to point to random\n  \/\/ data that this part of the tree hash will not need, so that it is\n  \/\/ fresh when it is needed at the end of the tree hash.\n  explicit MultiplyShift(const void **rvoid, const size_t depth)\n      : r(reinterpret_cast<const Rand *>(*rvoid)) {\n    *rvoid = reinterpret_cast<const void *>(r + depth);\n  }\n};\n\nstruct NH {\n  typedef ui128 Atom;\n\n private:\n  typedef ui128 Rand;\n\n public:\n  const static size_t ATOM_SIZE = sizeof(ui128);\n  inline static void AtomCopy(Atom *x, const Atom &y) {\n    (*x)[0] = y[0];\n    (*x)[1] = y[1];\n  }\n  inline void Hash(Atom *out, const int i, const Atom &in0,\n                   const Atom &in1) const {\n    \/\/ Use a temporary Atom in case out == &in0 or out == &in1\n    const Atom tmp = {in0[0] + r[i][0], in0[1] + r[i][1]};\n    const unsigned __int128 tmp2 =\n        *reinterpret_cast<const unsigned __int128 *>(in1) +\n        (((unsigned __int128)(tmp[0])) * ((unsigned __int128)(tmp[1])));\n    memcpy(out, &tmp2, sizeof(tmp2));\n  }\n\n  explicit NH(const void **rvoid, const size_t depth)\n      : r(reinterpret_cast<const Rand *>(rvoid)) {\n    *rvoid = reinterpret_cast<const void *>(r + depth);\n  }\n\n private:\n  const Rand *r;\n};\n\nstruct CLNH {\n  typedef __m128i Atom;\n\n private:\n  typedef __m128i Rand;\n\n public:\n  const static size_t ATOM_SIZE = sizeof(__m128i);\n  inline static void AtomCopy(Atom *x, const Atom &y) { *x = y; }\n  inline void Hash(Atom *out, const int i, const Atom &in0,\n                   const Atom &in1) const {\n    Atom tmp = _mm_xor_si128(in0, r[i]);\n    tmp = _mm_clmulepi64_si128(tmp, tmp, 1);\n    tmp = _mm_xor_si128(tmp, in1);\n    *out = tmp;\n  }\n\n  explicit CLNH(const void **rvoid, const size_t depth)\n      : r(reinterpret_cast<const Rand *>(rvoid)) {\n    *rvoid = reinterpret_cast<const void *>(r + depth);\n  }\n\n private:\n  const Rand *r;\n};\n\nstruct CLNHx2 {\n  typedef __m256i Atom;\n\n  const static size_t ATOM_SIZE = sizeof(__m256i);\n\n  inline static void AtomCopy(Atom *x, const Atom &y) { *x = y; }\n\n  explicit CLNHx2(const void **rvoid, const size_t depth) {\n    const __m128i *const r128 = reinterpret_cast<const __m128i *>(*rvoid);\n    for (size_t i = 0; i < depth; ++i) {\n      r[i] = _mm256_broadcastsi128_si256(r128[i]);\n    }\n    *rvoid = reinterpret_cast<const void *>(r128 + depth);\n  }\n\n  inline void Hash(Atom *out, const int i, const Atom &in0,\n                   const Atom &in1) const {\n    *out = clUniv512(r[i], in0, in1);\n  }\n\n private:\n  typedef __m256i Rand;\n  Rand r[62];\n};\n\n\/\/ This primitive just wraps another primitive, but operates on arrays\n\/\/ of a given static size.\ntemplate <typename T, size_t n>\nstruct Wide {\n  typedef typename T::Atom Atom[n];\n\n  const static size_t ATOM_SIZE = T::ATOM_SIZE * n;\n\n  inline static void AtomCopy(Atom *x, const Atom &y) {\n    for (size_t i = 0; i < n; ++i) {\n      T::AtomCopy(&(*x)[i], y[i]);\n    }\n  }\n\n  explicit Wide(const void **rvoid, const size_t depth) : t(rvoid, depth) {}\n\n  inline void Hash(Atom *out, const int j, const Atom &in0,\n                   const Atom &in1) const {\n    for (size_t i = 0; i < n; ++i) {\n      t.Hash(&(*out)[i], j, in0[i], in1[i]);\n    }\n  }\n\n private:\n  T t;\n};\n\n#endif\n<commit_msg>BUG: was casting from void** to Rand*, needed to be void* to Rand*<commit_after>#ifndef TREEHASH_UTIL\n#define TREEHASH_UTIL\n\n#include <cstdint>\n#include \"immintrin.h\"\n\ntypedef uint64_t ui128[2];\n\n\/\/ Multiply two unsigned 64-bit ints, producing a 128-bit int but\n\/\/ returning only the high-order bits.\nstatic inline uint64_t mulHi(uint64_t x, uint64_t y) {\n  uint64_t lo, hi;\n  __asm__(\"mulq %3\" : \"=a,a\"(lo), \"=d,d\"(hi) : \"%0,0\"(x), \"r,m\"(y));\n  return hi;\n}\n\/\/ Universal hashing of x and y\nstatic inline uint64_t deltaDietz(const ui128 h, const uint64_t x,\n                                   const uint64_t y) {\n  return x + y * h[1] + mulHi(y, h[0]);\n}\n\nstatic inline uint64_t bigendian(const ui128 h, const uint64_t x,\n                                 const uint64_t y) {\n  const uint64_t hlo = h[0] | 0x1;\n  return h[1] * x + hlo * y + mulHi(hlo, x);\n}\n\n\/\/ Universal hashing 512 bits down to 256 bits using 128 bits of\n\/\/ random data, with collision probability 2^-64.\n\/\/\n\/\/ r128x2 is 128 bits of random data, duplicated.\n\/\/\n\/\/ The method we use is one that relies on:\n\/\/\n\/\/ 1. CLNH\n\/\/\n\/\/ 2. The fact that if H is a almost delta-universal family, we can\n\/\/ get an almost universal family by using one value from H and then\n\/\/ performing an addition in the codomain. This has been noted in the\n\/\/ Badger paper, as well as by Woelfel in \"A construction method for\n\/\/ optimally universal hash families and its consequences for the\n\/\/ existence of RBIBDs.\".\nstatic inline __m256i clUniv512(const __m256i r128x2, const __m256i d0, const __m256i d1) {\n  __m256i result = _mm256_xor_si256(r128x2, d0);\n\n  \/\/ I think cast gets the lower bits of an __m256i\n  __m128i x = _mm256_castsi256_si128(result);\n  __m128i y = _mm256_extracti128_si256(result, 1);\n\n  x = _mm_clmulepi64_si128(x, x, 1);\n  y = _mm_clmulepi64_si128(y, y, 1);\n\n  \/\/ I believe cast puts into the lower order bits of an __m256i\n  result = _mm256_castsi128_si256(x);\n  result = _mm256_inserti128_si256(result, y, 1);\n\n  return _mm256_xor_si256(result, d1);\n}\n\n\/\/ In the interest of reducing code duplication, it is useful to\n\/\/ parameterize treehashes by the primitive they use. By \"primitive\",\n\/\/ I mean the building block that hashes R^2 down to R for some\n\/\/ universe R. or instance, deltaDietz hashes uint64_t^2 down to\n\/\/ uint64_t.\n\/\/\n\/\/ We'll need a few ingredients:\nstruct MultiplyShift {\n  \/\/ First, we need to know what R is in the notation above. This is\n  \/\/ called an Atom, because from the point of view of the\n  \/\/ parameterized hash algorithm, it cannot be broken up into\n  \/\/ component parts.\n  typedef uint64_t Atom;\n\n private:\n  \/\/ Second, we need to know the type of the random data needed to\n  \/\/ hash Atom^2 down to Atom.\n  typedef ui128 Rand;\n\n public:\n  \/\/ Third, we need to know the size of Atom in bytes. The sizeof\n  \/\/ keyword won't always be enough is clients of this class, since\n  \/\/ sometimes Atom is an array and \"decays\" into pointers.\n  const static size_t ATOM_SIZE = sizeof(uint64_t);\n  \/\/ Fourth, we need a way to copy Atoms.\n  inline static void AtomCopy(Atom *x, const Atom &y) { *x = y; }\n  \/\/ Fifth, we need to expose the hash family itself.\n  inline void Hash(Atom *out, int i, const Atom &in0, const Atom &in1) const {\n    *out = deltaDietz(r[i], in0, in1);\n  }\n\n  \/\/ Sixth, we need to store a particular array of random values. We\n  \/\/ have to store these because some primitives need to preprocess\n  \/\/ the random bits into an array of Rands. There is an example\n  \/\/ below, but an easy one to think of is hashing modulo a prime. For\n  \/\/ those hash families, we get data in, say, 8-bit chunks, but we\n  \/\/ need random values modulo p, so we have to pre-process.\n  \/\/\n  \/\/ We will need one Rand for each level of the tree hash. When we\n  \/\/ pre-process, these values may require extra storage space. Since\n  \/\/ that depends on the primitive, we keep the data in this struct\n  \/\/ itself.\n private:\n  const Rand *r;\n\n public:\n  \/\/ In a primitive that needs preprocessing, depth indicates how many\n  \/\/ random items to take - it is the depth of the treehash. We take\n  \/\/ as an argument a const void ** that we update to point to random\n  \/\/ data that this part of the tree hash will not need, so that it is\n  \/\/ fresh when it is needed at the end of the tree hash.\n  explicit MultiplyShift(const void **rvoid, const size_t depth)\n      : r(reinterpret_cast<const Rand *>(*rvoid)) {\n    *rvoid = reinterpret_cast<const void *>(r + depth);\n  }\n};\n\nstruct NH {\n  typedef ui128 Atom;\n\n private:\n  typedef ui128 Rand;\n\n public:\n  const static size_t ATOM_SIZE = sizeof(ui128);\n  inline static void AtomCopy(Atom *x, const Atom &y) {\n    (*x)[0] = y[0];\n    (*x)[1] = y[1];\n  }\n  inline void Hash(Atom *out, const int i, const Atom &in0,\n                   const Atom &in1) const {\n    \/\/ Use a temporary Atom in case out == &in0 or out == &in1\n    const Atom tmp = {in0[0] + r[i][0], in0[1] + r[i][1]};\n    const unsigned __int128 tmp2 =\n        *reinterpret_cast<const unsigned __int128 *>(in1) +\n        (((unsigned __int128)(tmp[0])) * ((unsigned __int128)(tmp[1])));\n    memcpy(out, &tmp2, sizeof(tmp2));\n  }\n\n  explicit NH(const void **rvoid, const size_t depth)\n      : r(reinterpret_cast<const Rand *>(*rvoid)) {\n    *rvoid = reinterpret_cast<const void *>(r + depth);\n  }\n\n private:\n  const Rand *r;\n};\n\nstruct CLNH {\n  typedef __m128i Atom;\n\n private:\n  typedef __m128i Rand;\n\n public:\n  const static size_t ATOM_SIZE = sizeof(__m128i);\n  inline static void AtomCopy(Atom *x, const Atom &y) { *x = y; }\n  inline void Hash(Atom *out, const int i, const Atom &in0,\n                   const Atom &in1) const {\n    Atom tmp = _mm_xor_si128(in0, r[i]);\n    tmp = _mm_clmulepi64_si128(tmp, tmp, 1);\n    tmp = _mm_xor_si128(tmp, in1);\n    *out = tmp;\n  }\n\n  explicit CLNH(const void **rvoid, const size_t depth)\n      : r(reinterpret_cast<const Rand *>(*rvoid)) {\n    *rvoid = reinterpret_cast<const void *>(r + depth);\n  }\n\n private:\n  const Rand *r;\n};\n\nstruct CLNHx2 {\n  typedef __m256i Atom;\n\n  const static size_t ATOM_SIZE = sizeof(__m256i);\n\n  inline static void AtomCopy(Atom *x, const Atom &y) { *x = y; }\n\n  explicit CLNHx2(const void **rvoid, const size_t depth) {\n    const __m128i *const r128 = reinterpret_cast<const __m128i *>(*rvoid);\n    for (size_t i = 0; i < depth; ++i) {\n      r[i] = _mm256_broadcastsi128_si256(r128[i]);\n    }\n    *rvoid = reinterpret_cast<const void *>(r128 + depth);\n  }\n\n  inline void Hash(Atom *out, const int i, const Atom &in0,\n                   const Atom &in1) const {\n    *out = clUniv512(r[i], in0, in1);\n  }\n\n private:\n  typedef __m256i Rand;\n  Rand r[62];\n};\n\n\/\/ This primitive just wraps another primitive, but operates on arrays\n\/\/ of a given static size.\ntemplate <typename T, size_t n>\nstruct Wide {\n  typedef typename T::Atom Atom[n];\n\n  const static size_t ATOM_SIZE = T::ATOM_SIZE * n;\n\n  inline static void AtomCopy(Atom *x, const Atom &y) {\n    for (size_t i = 0; i < n; ++i) {\n      T::AtomCopy(&(*x)[i], y[i]);\n    }\n  }\n\n  explicit Wide(const void **rvoid, const size_t depth) : t(rvoid, depth) {}\n\n  inline void Hash(Atom *out, const int j, const Atom &in0,\n                   const Atom &in1) const {\n    for (size_t i = 0; i < n; ++i) {\n      t.Hash(&(*out)[i], j, in0[i], in1[i]);\n    }\n  }\n\n private:\n  T t;\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n#include <teraranger_hub\/tr_hub_parser.h>\n\nclass HubParserTest : public ::testing::Test{\nprotected:\n  uint8_t input_buffer[BUFFER_SIZE] = {0x54,0x48,0x08,0xa7,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x0b};\/\/expected result is one 2.22 meter measurement\n};\n\nTEST_F(HubParserTest, crc8Test){\n  int16_t crc = tr_hub_parser::crc8(input_buffer, 18);\n  EXPECT_EQ(crc, input_buffer[18]);\n}\n\nTEST_F(HubParserTest, parsingTest){\n  float result = tr_hub_parser::two_chars_to_float(input_buffer[2],input_buffer[3]);\n  ASSERT_FLOAT_EQ(result, 2215);\n}\n\nint main(int argc, char **argv) {\n  testing::InitGoogleTest(&argc, argv);\n\n  return RUN_ALL_TESTS();\n}\n<commit_msg>Fix test_tr_hub_parser<commit_after>#include <gtest\/gtest.h>\n#include <teraranger_hub\/teraranger_one.h>\n\nclass HubParserTest : public ::testing::Test{\nprotected:\n  uint8_t input_buffer[BUFFER_SIZE] = {0x54,0x48,0x08,0xa7,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x0b};\/\/expected result is one 2.22 meter measurement\n};\n\nTEST_F(HubParserTest, crc8Test){\n  int16_t crc = tr_hub_parser::crc8(input_buffer, 18);\n  EXPECT_EQ(crc, input_buffer[18]);\n}\n\nTEST_F(HubParserTest, parsingTest){\n  float result = tr_hub_parser::two_chars_to_float(input_buffer[2],input_buffer[3]);\n  ASSERT_FLOAT_EQ(result, 2215);\n}\n\nint main(int argc, char **argv) {\n  testing::InitGoogleTest(&argc, argv);\n\n  return RUN_ALL_TESTS();\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef VSMC_CORE_PARTICLE_HPP\n#define VSMC_CORE_PARTICLE_HPP\n\n#include <vsmc\/internal\/common.hpp>\n#include <vsmc\/core\/single_particle.hpp>\n#include <vsmc\/core\/weight.hpp>\n#include <vsmc\/resample\/basic.hpp>\n#include <vsmc\/utility\/rng_set.hpp>\n#include <vsmc\/utility\/seed.hpp>\n#include <vsmc\/utility\/stop_watch.hpp>\n\nnamespace vsmc {\n\n\/\/\/ \\brief Particle class representing the whole particle set\n\/\/\/ \\ingroup Core\ntemplate <typename T>\nclass Particle\n{\n    public :\n\n    typedef typename traits::SizeTypeTrait<T>::type size_type;\n    typedef T value_type;\n    typedef typename traits::WeightSetTypeTrait<T>::type weight_set_type;\n    typedef typename traits::RngSetTypeTrait<T>::type rng_set_type;\n    typedef typename rng_set_type::rng_type rng_type;\n    typedef cxx11::function<\n        void (std::size_t, typename traits::ResampleRngTypeTrait<T>::type &,\n                double *, size_type *)>\n        resample_type;\n    typedef ParticleIterator<T, SingleParticle> iterator;\n    typedef ParticleIterator<T, ConstSingleParticle> const_iterator;\n    typedef std::reverse_iterator<iterator> reverse_iterator;\n    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;\n\n    explicit Particle (size_type N) :\n        size_(N), value_(N),\n        weight_set_(static_cast<typename\n                traits::SizeTypeTrait<weight_set_type>::type>(N)),\n        rng_set_(static_cast<typename\n                traits::SizeTypeTrait<rng_set_type>::type>(N)),\n        resample_replication_(N), resample_copy_from_(N), resample_weight_(N),\n        resample_rng_(Seed::instance().get()),\n        sp_(N + 2, SingleParticle<T>(0, VSMC_NULLPTR)),\n        csp_(N + 2, ConstSingleParticle<T>(0, VSMC_NULLPTR)),\n        start_watch_(false)\n    {\n        weight_set_.set_equal_weight();\n        sp_[0] = SingleParticle<T>(std::numeric_limits<size_type>::max\n                VSMC_MACRO_NO_EXPANSION (), this);\n        csp_[0] = ConstSingleParticle<T>(std::numeric_limits<size_type>::max\n                VSMC_MACRO_NO_EXPANSION (), this);\n        for (size_type i = 1; i != size_ + 2; ++i) {\n            sp_[i] = SingleParticle<T>(i - 1, this);\n            csp_[i] = ConstSingleParticle<T>(i - 1, this);\n        }\n    }\n\n    \/\/\/ \\brief Number of particles\n    size_type size () const {return size_;}\n\n    const SingleParticle<T> &sp (size_type i) {return sp_[i + 1];}\n\n    const ConstSingleParticle<T> &sp (size_type i) const {return csp_[i + 1];}\n\n    iterator begin () {return iterator(&sp(0));}\n\n    iterator end () {return iterator(&sp(size_));}\n\n    const_iterator begin () const {return cosnt_iterator(&sp(0));}\n\n    const_iterator end () const {return const_iterator(&sp(size_));}\n\n    const_iterator cbegin () const {return const_iterator(&sp(0));}\n\n    const_iterator cend () const {return const_iterator(&sp(size_));}\n\n    reverse_iterator rbegin () {return reverse_iterator(end());}\n\n    reverse_iterator rend () {return reverse_iterator(begin());}\n\n    const_reverse_iterator rbegin () const\n    {return const_reverse_iterator(end());}\n\n    const_reverse_iterator rend () const\n    {return const_reverse_iterator(begin());}\n\n    const_reverse_iterator crbegin () const\n    {return const_reverse_iterator(cend());}\n\n    const_reverse_iterator crend () const\n    {return const_reverse_iterator(cbegin());}\n\n    \/\/\/ \\brief Read and write access to the value collection object\n    value_type &value () {return value_;}\n\n    \/\/\/ \\brief Read only access to the value collection object\n    const value_type &value () const {return value_;}\n\n    \/\/\/ \\brief Read and write access to the weight collection object\n    weight_set_type &weight_set () {return weight_set_;}\n\n    \/\/\/ \\brief Read only access to the weight collection object\n    const weight_set_type &weight_set () const {return weight_set_;}\n\n    \/\/\/ \\brief Read and write access to the RNG collection object\n    rng_set_type &rng_set () {return rng_set_;}\n\n    \/\/\/ \\brief Read only access to the RNG collection object\n    const rng_set_type &rng_set () const {return rng_set_;}\n\n    \/\/\/ \\brief Set normalized weight, unnormalized logarithm weight and ESS\n    \/\/\/ such that each particle has a equal weight\n    void set_equal_weight () {weight_set_.set_equal_weight();}\n\n    \/\/\/ \\brief Read normalized weights through an output iterator\n    template <typename OutputIter>\n    OutputIter read_weight (OutputIter first) const\n    {return weight_set_.read_weight(first);}\n\n    \/\/\/ \\brief Get the ESS of the particle collection based on the current\n    \/\/\/ weights\n    double ess () const {return weight_set_.ess();}\n\n    \/\/\/ \\brief Get an RNG stream for a given particle\n    rng_type &rng (size_type id) {return rng_set_.rng(id);}\n\n    \/\/\/ \\brief Performing resampling if ESS\/N < threshold\n    \/\/\/\n    \/\/\/ \\param op The resampling operation funcitor\n    \/\/\/ \\param threshold The threshold of ESS\/N below which resampling will be\n    \/\/\/ performed\n    \/\/\/\n    \/\/\/ \\return true if resampling was performed\n    \/\/\/\n    \/\/\/ \\details\n    \/\/\/ The out of box behavior are suitable for most applications. However,\n    \/\/\/ the user can also gain full control over the internal of this\n    \/\/\/ function by changing the `weight_set_type` and other type traits for\n    \/\/\/ specific value collection type. The sequence of operations of this\n    \/\/\/ function is listed as in the following pseudo-code\n    \/\/\/ 1. Determine if resampling is required\n    \/\/\/     * Set `N = weight_set.resample_size()`\n    \/\/\/     * Set `resampled = weight_set.ess() < threshold * N`\n    \/\/\/     * If `!resampled`, GO TO Step 8. Otherwise, GO TO Step 2\n    \/\/\/ 2. Determine if resampling algorithms shall be performed. This is only\n    \/\/\/ useful for MPI implementations. the boolean value `resampled` ensures\n    \/\/\/ that collective actions like `copy` will be called by all nodes.\n    \/\/\/ However, the resampling replication numbers can be computed by one\n    \/\/\/ node instead of by all. Therefore, the program can actually collect and\n    \/\/\/ read the resampling weights on one node, and do nothing on other nodes.\n    \/\/\/ This difference shall be reflected by the returning iterator of\n    \/\/\/ `read_resample_weight`\n    \/\/\/     * (Allocate `double *weight` for size `N`)\n    \/\/\/     * Set `double *end = weight_set.read_resample_weight(weight)`\n    \/\/\/     * If `end != weight + N`, GO TO step 5. Otherwise, GO TO Step 3\n    \/\/\/ 3. Performing resampling, produce replication number of each particle\n    \/\/\/     * (Allocate `size_type *replication` for size `N`)\n    \/\/\/     * (Create RNG engine `resample_rng` according to\n    \/\/\/     traits::ResampleRngTypeTrait)\n    \/\/\/     * Call `op(N, resample_rng, weight, replication)`\n    \/\/\/ 4. Transform replication numbers into parent particle indices\n    \/\/\/     * (Allocat `size_type *copy_from` for size `N`)\n    \/\/\/     * (Create functor `r2c` according to\n    \/\/\/     traits::ResampleCopyFromReplicationTypeTrait)\n    \/\/\/     * Call `r2c(N, replication, copy_from)`\n    \/\/\/ 5. Set `const size_type *cptr` according to results of Step 2.\n    \/\/\/     * If Step 3 and 4 are skipped according to Step 2, then set\n    \/\/\/     `cptr = 0`. Otherwise,\n    \/\/\/     * Set `cptr = copy_from`\n    \/\/\/ 6. Performing copying of particles\n    \/\/\/     * Call `value.copy(N, cptr)`\n    \/\/\/ 7. Performing post resampling weight manipulation\n    \/\/\/     * (Create functor `post` according to\n    \/\/\/     traits::ResamplePostCopyTypeTrait)\n    \/\/\/     * `post(weight_set)`\n    \/\/\/ 8. `return resampled`\n    bool resample (const resample_type &op, double threshold)\n    {\n        size_type N = static_cast<size_type>(weight_set_.resample_size());\n        bool resampled = weight_set_.ess() < threshold * N;\n        if (resampled) {\n            resample_copy_from_.resize(N);\n            resample_replication_.resize(N);\n            resample_weight_.resize(N);\n            const size_type *cptr = VSMC_NULLPTR;\n            double *end = VSMC_NULLPTR;\n            {\n                ScopedStopWatch<StopWatch> start(\n                        resample_read_weight_watch_, start_watch_);\n                end = weight_set_.read_resample_weight(&resample_weight_[0]);\n            }\n            if (end == &resample_weight_[0] + N) {\n                {\n                    ScopedStopWatch<StopWatch> start(\n                            resample_get_replication_watch_, start_watch_);\n                    op(static_cast<std::size_t>(N), resample_rng_,\n                            &resample_weight_[0], &resample_replication_[0]);\n                }\n                {\n                    ScopedStopWatch<StopWatch> start(\n                            resample_get_copy_from_watch_, start_watch_);\n                    resample_copy_from_replication_(N,\n                            &resample_replication_[0],\n                            &resample_copy_from_[0]);\n                }\n                cptr = &resample_copy_from_[0];\n            }\n            {\n                ScopedStopWatch<StopWatch> start(\n                        resample_copy_watch_, start_watch_);\n                value_.copy(N, cptr);\n            }\n            {\n                ScopedStopWatch<StopWatch> start(\n                        resample_post_copy_watch_, start_watch_);\n                resample_post_copy_(weight_set_);\n            }\n        }\n\n        return resampled;\n    }\n\n    void start_watch () {start_watch_ = true;}\n\n    void stop_watch () {start_watch_ = false;}\n\n    void reset_watch ()\n    {\n        resample_read_weight_watch_.reset();\n        resample_get_replication_watch_.reset();\n        resample_get_copy_from_watch_.reset();\n        resample_copy_watch_.reset();\n        resample_post_copy_watch_.reset();\n    }\n\n    StopWatch &resample_read_weight_watch ()\n    {return resample_read_weight_watch_;}\n\n    const StopWatch &resample_read_weight_watch () const\n    {return resample_read_weight_watch_;}\n\n    StopWatch &resample_get_replication_watch ()\n    {return resample_get_replication_watch_;}\n\n    const StopWatch &resample_get_replication_watch () const\n    {return resample_get_replication_watch_;}\n\n    StopWatch &resample_get_copy_from_watch ()\n    {return resample_get_copy_from_watch_;}\n\n    const StopWatch &resample_get_copy_from_watch () const\n    {return resample_get_copy_from_watch_;}\n\n    StopWatch &resample_copy_watch ()\n    {return resample_copy_watch_;}\n\n    const StopWatch &resample_copy_watch () const\n    {return resample_copy_watch_;}\n\n    StopWatch &resample_post_copy_watch ()\n    {return resample_post_copy_watch_;}\n\n    const StopWatch &resample_post_copy_watch () const\n    {return resample_post_copy_watch_;}\n\n    private :\n\n    size_type size_;\n    value_type value_;\n    weight_set_type weight_set_;\n    rng_set_type rng_set_;\n\n    std::vector<size_type> resample_replication_;\n    std::vector<size_type> resample_copy_from_;\n    std::vector<double> resample_weight_;\n    typename traits::ResampleCopyFromReplicationTypeTrait<T>::type\n        resample_copy_from_replication_;\n    typename traits::ResamplePostCopyTypeTrait<T>::type resample_post_copy_;\n    typename traits::ResampleRngTypeTrait<T>::type resample_rng_;\n    std::vector<SingleParticle<T> > sp_;\n    std::vector<ConstSingleParticle<T> > csp_;\n\n    bool start_watch_;\n    StopWatch resample_read_weight_watch_;\n    StopWatch resample_get_replication_watch_;\n    StopWatch resample_get_copy_from_watch_;\n    StopWatch resample_copy_watch_;\n    StopWatch resample_post_copy_watch_;\n}; \/\/ class Particle\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_CORE_PARTICLE_HPP\n<commit_msg>match Particle::resample_type decl with impl<commit_after>#ifndef VSMC_CORE_PARTICLE_HPP\n#define VSMC_CORE_PARTICLE_HPP\n\n#include <vsmc\/internal\/common.hpp>\n#include <vsmc\/core\/single_particle.hpp>\n#include <vsmc\/core\/weight.hpp>\n#include <vsmc\/resample\/basic.hpp>\n#include <vsmc\/utility\/rng_set.hpp>\n#include <vsmc\/utility\/seed.hpp>\n#include <vsmc\/utility\/stop_watch.hpp>\n\nnamespace vsmc {\n\n\/\/\/ \\brief Particle class representing the whole particle set\n\/\/\/ \\ingroup Core\ntemplate <typename T>\nclass Particle\n{\n    public :\n\n    typedef typename traits::SizeTypeTrait<T>::type size_type;\n    typedef T value_type;\n    typedef typename traits::WeightSetTypeTrait<T>::type weight_set_type;\n    typedef typename traits::RngSetTypeTrait<T>::type rng_set_type;\n    typedef typename rng_set_type::rng_type rng_type;\n    typedef cxx11::function<\n        void (std::size_t, typename traits::ResampleRngTypeTrait<T>::type &,\n                const double *, size_type *)>\n        resample_type;\n    typedef ParticleIterator<T, SingleParticle> iterator;\n    typedef ParticleIterator<T, ConstSingleParticle> const_iterator;\n    typedef std::reverse_iterator<iterator> reverse_iterator;\n    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;\n\n    explicit Particle (size_type N) :\n        size_(N), value_(N),\n        weight_set_(static_cast<typename\n                traits::SizeTypeTrait<weight_set_type>::type>(N)),\n        rng_set_(static_cast<typename\n                traits::SizeTypeTrait<rng_set_type>::type>(N)),\n        resample_replication_(N), resample_copy_from_(N), resample_weight_(N),\n        resample_rng_(Seed::instance().get()),\n        sp_(N + 2, SingleParticle<T>(0, VSMC_NULLPTR)),\n        csp_(N + 2, ConstSingleParticle<T>(0, VSMC_NULLPTR)),\n        start_watch_(false)\n    {\n        weight_set_.set_equal_weight();\n        sp_[0] = SingleParticle<T>(std::numeric_limits<size_type>::max\n                VSMC_MACRO_NO_EXPANSION (), this);\n        csp_[0] = ConstSingleParticle<T>(std::numeric_limits<size_type>::max\n                VSMC_MACRO_NO_EXPANSION (), this);\n        for (size_type i = 1; i != size_ + 2; ++i) {\n            sp_[i] = SingleParticle<T>(i - 1, this);\n            csp_[i] = ConstSingleParticle<T>(i - 1, this);\n        }\n    }\n\n    \/\/\/ \\brief Number of particles\n    size_type size () const {return size_;}\n\n    const SingleParticle<T> &sp (size_type i) {return sp_[i + 1];}\n\n    const ConstSingleParticle<T> &sp (size_type i) const {return csp_[i + 1];}\n\n    iterator begin () {return iterator(&sp(0));}\n\n    iterator end () {return iterator(&sp(size_));}\n\n    const_iterator begin () const {return cosnt_iterator(&sp(0));}\n\n    const_iterator end () const {return const_iterator(&sp(size_));}\n\n    const_iterator cbegin () const {return const_iterator(&sp(0));}\n\n    const_iterator cend () const {return const_iterator(&sp(size_));}\n\n    reverse_iterator rbegin () {return reverse_iterator(end());}\n\n    reverse_iterator rend () {return reverse_iterator(begin());}\n\n    const_reverse_iterator rbegin () const\n    {return const_reverse_iterator(end());}\n\n    const_reverse_iterator rend () const\n    {return const_reverse_iterator(begin());}\n\n    const_reverse_iterator crbegin () const\n    {return const_reverse_iterator(cend());}\n\n    const_reverse_iterator crend () const\n    {return const_reverse_iterator(cbegin());}\n\n    \/\/\/ \\brief Read and write access to the value collection object\n    value_type &value () {return value_;}\n\n    \/\/\/ \\brief Read only access to the value collection object\n    const value_type &value () const {return value_;}\n\n    \/\/\/ \\brief Read and write access to the weight collection object\n    weight_set_type &weight_set () {return weight_set_;}\n\n    \/\/\/ \\brief Read only access to the weight collection object\n    const weight_set_type &weight_set () const {return weight_set_;}\n\n    \/\/\/ \\brief Read and write access to the RNG collection object\n    rng_set_type &rng_set () {return rng_set_;}\n\n    \/\/\/ \\brief Read only access to the RNG collection object\n    const rng_set_type &rng_set () const {return rng_set_;}\n\n    \/\/\/ \\brief Set normalized weight, unnormalized logarithm weight and ESS\n    \/\/\/ such that each particle has a equal weight\n    void set_equal_weight () {weight_set_.set_equal_weight();}\n\n    \/\/\/ \\brief Read normalized weights through an output iterator\n    template <typename OutputIter>\n    OutputIter read_weight (OutputIter first) const\n    {return weight_set_.read_weight(first);}\n\n    \/\/\/ \\brief Get the ESS of the particle collection based on the current\n    \/\/\/ weights\n    double ess () const {return weight_set_.ess();}\n\n    \/\/\/ \\brief Get an RNG stream for a given particle\n    rng_type &rng (size_type id) {return rng_set_.rng(id);}\n\n    \/\/\/ \\brief Performing resampling if ESS\/N < threshold\n    \/\/\/\n    \/\/\/ \\param op The resampling operation funcitor\n    \/\/\/ \\param threshold The threshold of ESS\/N below which resampling will be\n    \/\/\/ performed\n    \/\/\/\n    \/\/\/ \\return true if resampling was performed\n    \/\/\/\n    \/\/\/ \\details\n    \/\/\/ The out of box behavior are suitable for most applications. However,\n    \/\/\/ the user can also gain full control over the internal of this\n    \/\/\/ function by changing the `weight_set_type` and other type traits for\n    \/\/\/ specific value collection type. The sequence of operations of this\n    \/\/\/ function is listed as in the following pseudo-code\n    \/\/\/ 1. Determine if resampling is required\n    \/\/\/     * Set `N = weight_set.resample_size()`\n    \/\/\/     * Set `resampled = weight_set.ess() < threshold * N`\n    \/\/\/     * If `!resampled`, GO TO Step 8. Otherwise, GO TO Step 2\n    \/\/\/ 2. Determine if resampling algorithms shall be performed. This is only\n    \/\/\/ useful for MPI implementations. the boolean value `resampled` ensures\n    \/\/\/ that collective actions like `copy` will be called by all nodes.\n    \/\/\/ However, the resampling replication numbers can be computed by one\n    \/\/\/ node instead of by all. Therefore, the program can actually collect and\n    \/\/\/ read the resampling weights on one node, and do nothing on other nodes.\n    \/\/\/ This difference shall be reflected by the returning iterator of\n    \/\/\/ `read_resample_weight`\n    \/\/\/     * (Allocate `double *weight` for size `N`)\n    \/\/\/     * Set `double *end = weight_set.read_resample_weight(weight)`\n    \/\/\/     * If `end != weight + N`, GO TO step 5. Otherwise, GO TO Step 3\n    \/\/\/ 3. Performing resampling, produce replication number of each particle\n    \/\/\/     * (Allocate `size_type *replication` for size `N`)\n    \/\/\/     * (Create RNG engine `resample_rng` according to\n    \/\/\/     traits::ResampleRngTypeTrait)\n    \/\/\/     * Call `op(N, resample_rng, weight, replication)`\n    \/\/\/ 4. Transform replication numbers into parent particle indices\n    \/\/\/     * (Allocat `size_type *copy_from` for size `N`)\n    \/\/\/     * (Create functor `r2c` according to\n    \/\/\/     traits::ResampleCopyFromReplicationTypeTrait)\n    \/\/\/     * Call `r2c(N, replication, copy_from)`\n    \/\/\/ 5. Set `const size_type *cptr` according to results of Step 2.\n    \/\/\/     * If Step 3 and 4 are skipped according to Step 2, then set\n    \/\/\/     `cptr = 0`. Otherwise,\n    \/\/\/     * Set `cptr = copy_from`\n    \/\/\/ 6. Performing copying of particles\n    \/\/\/     * Call `value.copy(N, cptr)`\n    \/\/\/ 7. Performing post resampling weight manipulation\n    \/\/\/     * (Create functor `post` according to\n    \/\/\/     traits::ResamplePostCopyTypeTrait)\n    \/\/\/     * `post(weight_set)`\n    \/\/\/ 8. `return resampled`\n    bool resample (const resample_type &op, double threshold)\n    {\n        size_type N = static_cast<size_type>(weight_set_.resample_size());\n        bool resampled = weight_set_.ess() < threshold * N;\n        if (resampled) {\n            resample_copy_from_.resize(N);\n            resample_replication_.resize(N);\n            resample_weight_.resize(N);\n            const size_type *cptr = VSMC_NULLPTR;\n            double *end = VSMC_NULLPTR;\n            {\n                ScopedStopWatch<StopWatch> start(\n                        resample_read_weight_watch_, start_watch_);\n                end = weight_set_.read_resample_weight(&resample_weight_[0]);\n            }\n            if (end == &resample_weight_[0] + N) {\n                {\n                    ScopedStopWatch<StopWatch> start(\n                            resample_get_replication_watch_, start_watch_);\n                    op(static_cast<std::size_t>(N), resample_rng_,\n                            &resample_weight_[0], &resample_replication_[0]);\n                }\n                {\n                    ScopedStopWatch<StopWatch> start(\n                            resample_get_copy_from_watch_, start_watch_);\n                    resample_copy_from_replication_(N,\n                            &resample_replication_[0],\n                            &resample_copy_from_[0]);\n                }\n                cptr = &resample_copy_from_[0];\n            }\n            {\n                ScopedStopWatch<StopWatch> start(\n                        resample_copy_watch_, start_watch_);\n                value_.copy(N, cptr);\n            }\n            {\n                ScopedStopWatch<StopWatch> start(\n                        resample_post_copy_watch_, start_watch_);\n                resample_post_copy_(weight_set_);\n            }\n        }\n\n        return resampled;\n    }\n\n    void start_watch () {start_watch_ = true;}\n\n    void stop_watch () {start_watch_ = false;}\n\n    void reset_watch ()\n    {\n        resample_read_weight_watch_.reset();\n        resample_get_replication_watch_.reset();\n        resample_get_copy_from_watch_.reset();\n        resample_copy_watch_.reset();\n        resample_post_copy_watch_.reset();\n    }\n\n    StopWatch &resample_read_weight_watch ()\n    {return resample_read_weight_watch_;}\n\n    const StopWatch &resample_read_weight_watch () const\n    {return resample_read_weight_watch_;}\n\n    StopWatch &resample_get_replication_watch ()\n    {return resample_get_replication_watch_;}\n\n    const StopWatch &resample_get_replication_watch () const\n    {return resample_get_replication_watch_;}\n\n    StopWatch &resample_get_copy_from_watch ()\n    {return resample_get_copy_from_watch_;}\n\n    const StopWatch &resample_get_copy_from_watch () const\n    {return resample_get_copy_from_watch_;}\n\n    StopWatch &resample_copy_watch ()\n    {return resample_copy_watch_;}\n\n    const StopWatch &resample_copy_watch () const\n    {return resample_copy_watch_;}\n\n    StopWatch &resample_post_copy_watch ()\n    {return resample_post_copy_watch_;}\n\n    const StopWatch &resample_post_copy_watch () const\n    {return resample_post_copy_watch_;}\n\n    private :\n\n    size_type size_;\n    value_type value_;\n    weight_set_type weight_set_;\n    rng_set_type rng_set_;\n\n    std::vector<size_type> resample_replication_;\n    std::vector<size_type> resample_copy_from_;\n    std::vector<double> resample_weight_;\n    typename traits::ResampleCopyFromReplicationTypeTrait<T>::type\n        resample_copy_from_replication_;\n    typename traits::ResamplePostCopyTypeTrait<T>::type resample_post_copy_;\n    typename traits::ResampleRngTypeTrait<T>::type resample_rng_;\n    std::vector<SingleParticle<T> > sp_;\n    std::vector<ConstSingleParticle<T> > csp_;\n\n    bool start_watch_;\n    StopWatch resample_read_weight_watch_;\n    StopWatch resample_get_replication_watch_;\n    StopWatch resample_get_copy_from_watch_;\n    StopWatch resample_copy_watch_;\n    StopWatch resample_post_copy_watch_;\n}; \/\/ class Particle\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_CORE_PARTICLE_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include \"page.h\"\n#include \"bloom_filter.h\"\n#include <fstream>\n#include <cassert>\n#include <algorithm>\n#include <cstring>\n\nusing namespace dariadb::storage;\n\n\nclass PageCursor : public dariadb::storage::Cursor {\npublic:\n\tPageCursor(Page*page, const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) :\n\t\tlink(page),\n\t\t_ids(ids),\n\t\t_from(from),\n\t\t_to(to),\n\t\t_flag(flag)\n\t{\n\t\treset_pos();\n\t}\n\n\t~PageCursor() {\n\t\tif (link != nullptr) {\n\t\t\tlink->dec_reader();\n\t\t\tlink = nullptr;\n\t\t}\n\t}\n\n\tbool is_end()const override {\n\t\treturn _is_end;\n\t}\n\n\tvoid readNext(Cursor::Callback*cbk)  override {\n\t\tstd::lock_guard<std::mutex> lg(_locker);\n\t\tfor (; !_is_end; _index_it++) {\n\t\t\tif (_index_it == _index_end) {\n\t\t\t\tChunk_Ptr empty;\n\t\t\t\tcbk->call(empty);\n\t\t\t\t_is_end = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (!_index_it->is_init) {\n\t\t\t\tChunk_Ptr empty;\n\t\t\t\tcbk->call(empty);\n\t\t\t\t_is_end = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\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::storage::bloom_check(_index_it->info.flag_bloom, _flag)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (check_index_rec(_index_it)) {\n\t\t\t\tauto ptr = new Chunk(_index_it->info, link->chunks + _index_it->offset, link->header->chunk_size);\n\t\t\t\tChunk_Ptr c{ ptr };\n\t\t\t\tassert(c->last.time != 0);\n\t\t\t\tcbk->call(c);\n\t\t\t\t_index_it++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\/\/end of data;\n\t\t\t\t_is_end = true;\n\t\t\t\tChunk_Ptr empty;\n\t\t\t\tcbk->call(empty);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tbool check_index_rec(Page_ChunkIndex*it) const{\n\t\treturn ((dariadb::utils::inInterval(_from, _to, it->info.minTime)) || (dariadb::utils::inInterval(_from, _to, it->info.maxTime)));\n\t}\n\n\tvoid reset_pos() override { \/\/start read from begining;\n\t\t_is_end = false;\n\n\t\tuint32_t upPos = link->header->chunk_per_storage;\n\t\t\/\/TODO lock this;\n\t\tauto sz = this->link->_itree.size();\n\t\tif (sz != 0) {\n\t\t\tauto it = this->link->_itree.upper_bound(this->_to);\n\n\t\t\tif (it != this->link->_itree.end()) {\n\t\t\t\tupPos = (*it).second;\n\t\t\t}\n\t\t}\n\n\t\t_index_end = link->index + upPos;\n\t\t_index_it = link->index;\n\n\t\t\/\/move to data begining\n\t\tfor (; !_is_end; _index_it++) {\n\t\t\tif (_index_it == _index_end) {\n\t\t\t\t_is_end = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (check_index_rec(_index_it)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\nprotected:\n\tPage* link;\n\tbool _is_end;\n\tPage_ChunkIndex *_index_it, *_index_end;\n\tdariadb::IdArray _ids;\n\tdariadb::Time _from, _to;\n\tdariadb::Flag _flag;\n\tstd::mutex _locker;\n};\n\n\nPage::~Page() {\n\tregion=nullptr;\n\theader=nullptr;\n\tindex=nullptr;\n\tchunks=nullptr;\n\tmmap->close();\n}\n\nPage* Page::create(std::string file_name, uint64_t sz, uint32_t chunk_per_storage, uint32_t chunk_size) {\n\tauto res = new Page;\n\tauto mmap = utils::fs::MappedFile::touch(file_name, sz);\n\tauto region = mmap->data();\n\tstd::fill(region, region + sz, 0);\n\n\tres->mmap = mmap;\n\tres->region = region;\n\tres->header = reinterpret_cast<PageHeader*>(region);\n\tres->index = reinterpret_cast<Page_ChunkIndex*>(region + sizeof(PageHeader));\n\tres->chunks = reinterpret_cast<uint8_t*>(region + sizeof(PageHeader) + sizeof(Page_ChunkIndex)*chunk_per_storage);\n\n\tres->header->chunk_per_storage = chunk_per_storage;\n\tres->header->chunk_size = chunk_size;\n\tres->header->maxTime = dariadb::Time(0);\n\tres->header->minTime = std::numeric_limits<dariadb::Time>::max();\n    res->header->is_overwrite=false;\n\treturn res;\n}\n\nPage* Page::open(std::string file_name) {\n\tauto res = new Page;\n\tauto mmap = utils::fs::MappedFile::open(file_name);\n\n\tauto region = mmap->data();\n\n\tres->mmap = mmap;\n\tres->region = region;\n\tres->header = reinterpret_cast<PageHeader*>(region);\n\tres->index = reinterpret_cast<Page_ChunkIndex*>(region + sizeof(PageHeader));\n\tres->chunks = reinterpret_cast<uint8_t*>(region + sizeof(PageHeader) + sizeof(Page_ChunkIndex)*res->header->chunk_per_storage);\n\tif (res->header->chunk_size == 0) {\n\t\tthrow MAKE_EXCEPTION(\"(res->header->chunk_size == 0)\");\n\t}\n\n\tfor (size_t i = 0; i < res->header->chunk_per_storage; ++i) {\n\t\tauto irec = &res->index[i];\n\t\tif (!irec->is_init) {\n\t\t\tbreak;\n\t\t}\n\t\tres->_itree.insert2(irec->info.maxTime, i);\n\t}\n\treturn res;\n}\n\nPageHeader Page::readHeader(std::string file_name) {\n\tstd::ifstream istream;\n\tistream.open(file_name, std::fstream::in | std::fstream::binary);\n\tif (!istream.is_open()) {\n\t\tstd::stringstream ss;\n\t\tss << \"can't open file. filename=\" << file_name;\n\t\tthrow MAKE_EXCEPTION(ss.str());\n\t}\n\tPageHeader result;\n\tmemset(&result, 0, sizeof(PageHeader));\n\tistream.read((char *)&result, sizeof(PageHeader));\n\tistream.close();\n\treturn result;\n\n}\n\nuint32_t Page::get_oldes_index() {\n    auto min_time = std::numeric_limits<dariadb::Time>::max();\n    uint32_t pos = 0;\n    auto index_end = index + header->chunk_per_storage;\n    uint32_t i = 0;\n    for (auto index_it = index; index_it != index_end; ++index_it, ++i) {\n        if (index_it->info.minTime<min_time) {\n            pos = i;\n            min_time = index_it->info.minTime;\n        }\n    }\n    return pos;\n}\n\nbool Page::append(const Chunk_Ptr&ch, MODE mode) {\n    std::lock_guard<std::mutex> lg(_locker);\n\tauto index_rec = (ChunkIndexInfo*)ch.get();\n\tauto buffer = ch->_buffer_t.data();\n\n\tassert(ch->last.time != 0);\n\tassert(header->chunk_size == ch->_buffer_t.size());\n\tif (is_full()) {\n        if (mode == MODE::SINGLE) {\n            header->is_overwrite=true;\n            header->pos_index=0;\n        }\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\tindex[header->pos_index].info = *index_rec;\n\n    index[header->pos_index].is_init = true;\n\t\n\n    if(!header->is_overwrite){\n        index[header->pos_index].offset = header->pos_chunks;\n        header->pos_chunks += header->chunk_size;\n        header->addeded_chunks++;\n\t\t_itree.insert2(index_rec->maxTime, header->pos_index);\n\t}\n\telse {\n\t\tfor (auto it = _itree.begin(); it != _itree.end();++it) {\n\t\t\tif (it->second == header->pos_index) {\n\t\t\t\t_itree.erase(it);\n\t\t\t}\n\t\t}\n\t\t_itree.insert2(index_rec->maxTime, header->pos_index);\n\t}\n\tmemcpy(this->chunks + index[header->pos_index].offset, buffer, sizeof(uint8_t)*header->chunk_size);\n\n\theader->pos_index++;\n\theader->minTime = std::min(header->minTime,ch->minTime);\n\theader->maxTime = std::max(header->maxTime, ch->maxTime);\n\treturn true;\n}\n\nbool Page::is_full()const {\n\treturn !(header->pos_index < header->chunk_per_storage);\n}\n\nCursor_ptr Page::get_chunks(const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) {\n    std::lock_guard<std::mutex> lg(_locker);\n\n\tauto raw_ptr = new PageCursor(this,ids,from,to,flag );\n\tCursor_ptr result{ raw_ptr };\n\n\theader->count_readers++;\n\t\n\treturn result;\n}\n\nChuncksList Page::get_open_chunks() {\n    std::lock_guard<std::mutex> lg(_locker);\n\tauto index_end = this->index + this->header->pos_index;\n\tauto index_it = this->index;\n\tChuncksList result;\n\tfor (; index_it != index_end; index_it++) {\n\t\tif (!index_it->is_init) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (!index_it->info.is_readonly) {\n\t\t\tindex_it->is_init = false;\n            auto ptr=new Chunk(index_it->info, this->chunks + index_it->offset, this->header->chunk_size);\n            Chunk_Ptr c = Chunk_Ptr(ptr);\n\t\t\tresult.push_back(c);\n\t\t}\n\t}\n\treturn result;\n}\n\nvoid Page::dec_reader(){\n    std::lock_guard<std::mutex> lg(_locker);\n\theader->count_readers--;\n}\n\nCursor_ptr dariadb::storage::Page::chunksByIterval(const IdArray & ids, Flag flag, Time from, Time to)\n{\n\treturn get_chunks(ids, from, to, flag);\n}\n\nIdToChunkMap dariadb::storage::Page::chunksBeforeTimePoint(const IdArray & ids, Flag flag, Time timePoint)\n{\n\tIdToChunkMap result;\n\n\tChuncksList ch_list;\n\tauto cursor = this->get_chunks(ids, header->minTime, timePoint, flag);\n\tif (cursor == nullptr) {\n\t\treturn result;\n\t}\n\tcursor->readAll(&ch_list);\n\n\tfor (auto&v : ch_list) {\n\t\tauto find_res = result.find(v->first.id);\n\t\tif (find_res == result.end()) {\n\t\t\tresult.insert(std::make_pair(v->first.id, v));\n\t\t}\n\t\telse {\n\t\t\tif (find_res->second->maxTime < v->maxTime) {\n\t\t\t\tresult[v->first.id] = v;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;\n}\nclass CountOfIdCallback :public Cursor::Callback {\npublic:\n\tdariadb::IdSet ids;\n\tCountOfIdCallback() {\n\t}\n\t~CountOfIdCallback() {\n\t}\n\n\tvirtual void call(Chunk_Ptr & ptr) override {\n\t\tif (ptr != nullptr) {\n\t\t\tids.insert(ptr->first.id);\n\t\t}\n\t}\n};\n\n\ndariadb::IdArray dariadb::storage::Page::getIds() \n{\n\tauto cursor = get_chunks(dariadb::IdArray{}, header->minTime, header->maxTime, 0);\n\n\tCountOfIdCallback*clbk_raw = new CountOfIdCallback;\n\tstd::unique_ptr<Cursor::Callback> clbk{ clbk_raw };\n\n\tcursor->readAll(clbk.get());\n\n\treturn dariadb::IdArray{ clbk_raw->ids.begin(),clbk_raw->ids.end() };\n}<commit_msg>update todo.<commit_after>#include \"page.h\"\n#include \"bloom_filter.h\"\n#include <fstream>\n#include <cassert>\n#include <algorithm>\n#include <cstring>\n\nusing namespace dariadb::storage;\n\n\nclass PageCursor : public dariadb::storage::Cursor {\npublic:\n\tPageCursor(Page*page, const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) :\n\t\tlink(page),\n\t\t_ids(ids),\n\t\t_from(from),\n\t\t_to(to),\n\t\t_flag(flag)\n\t{\n\t\treset_pos();\n\t}\n\n\t~PageCursor() {\n\t\tif (link != nullptr) {\n\t\t\tlink->dec_reader();\n\t\t\tlink = nullptr;\n\t\t}\n\t}\n\n\tbool is_end()const override {\n\t\treturn _is_end;\n\t}\n\n\tvoid readNext(Cursor::Callback*cbk)  override {\n\t\tstd::lock_guard<std::mutex> lg(_locker);\n\t\tfor (; !_is_end; _index_it++) {\n\t\t\tif (_index_it == _index_end) {\n\t\t\t\tChunk_Ptr empty;\n\t\t\t\tcbk->call(empty);\n\t\t\t\t_is_end = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (!_index_it->is_init) {\n\t\t\t\tChunk_Ptr empty;\n\t\t\t\tcbk->call(empty);\n\t\t\t\t_is_end = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\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::storage::bloom_check(_index_it->info.flag_bloom, _flag)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (check_index_rec(_index_it)) {\n\t\t\t\tauto ptr = new Chunk(_index_it->info, link->chunks + _index_it->offset, link->header->chunk_size);\n\t\t\t\tChunk_Ptr c{ ptr };\n\t\t\t\tassert(c->last.time != 0);\n\t\t\t\tcbk->call(c);\n\t\t\t\t_index_it++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\/\/end of data;\n\t\t\t\t_is_end = true;\n\t\t\t\tChunk_Ptr empty;\n\t\t\t\tcbk->call(empty);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tbool check_index_rec(Page_ChunkIndex*it) const{\n\t\treturn ((dariadb::utils::inInterval(_from, _to, it->info.minTime)) || (dariadb::utils::inInterval(_from, _to, it->info.maxTime)));\n\t}\n\n\tvoid reset_pos() override { \/\/start read from begining;\n\t\t_is_end = false; \n\n\t\tuint32_t upPos = link->header->chunk_per_storage;\n\t\t\n\t\tauto sz = this->link->_itree.size();\n\t\tif (sz != 0) {\n\t\t\tauto it = this->link->_itree.upper_bound(this->_to);\n\n\t\t\tif (it != this->link->_itree.end()) {\n\t\t\t\tupPos = (*it).second;\n\t\t\t}\n\t\t}\n\n\t\t_index_end = link->index + upPos;\n\t\t_index_it = link->index;\n\n\t\t\/\/move to data begining\n\t\tfor (; !_is_end; _index_it++) {\n\t\t\tif (_index_it == _index_end) {\n\t\t\t\t_is_end = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (check_index_rec(_index_it)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\nprotected:\n\tPage* link;\n\tbool _is_end;\n\tPage_ChunkIndex *_index_it, *_index_end;\n\tdariadb::IdArray _ids;\n\tdariadb::Time _from, _to;\n\tdariadb::Flag _flag;\n\tstd::mutex _locker;\n};\n\n\nPage::~Page() {\n\tregion=nullptr;\n\theader=nullptr;\n\tindex=nullptr;\n\tchunks=nullptr;\n\tmmap->close();\n}\n\nPage* Page::create(std::string file_name, uint64_t sz, uint32_t chunk_per_storage, uint32_t chunk_size) {\n\tauto res = new Page;\n\tauto mmap = utils::fs::MappedFile::touch(file_name, sz);\n\tauto region = mmap->data();\n\tstd::fill(region, region + sz, 0);\n\n\tres->mmap = mmap;\n\tres->region = region;\n\tres->header = reinterpret_cast<PageHeader*>(region);\n\tres->index = reinterpret_cast<Page_ChunkIndex*>(region + sizeof(PageHeader));\n\tres->chunks = reinterpret_cast<uint8_t*>(region + sizeof(PageHeader) + sizeof(Page_ChunkIndex)*chunk_per_storage);\n\n\tres->header->chunk_per_storage = chunk_per_storage;\n\tres->header->chunk_size = chunk_size;\n\tres->header->maxTime = dariadb::Time(0);\n\tres->header->minTime = std::numeric_limits<dariadb::Time>::max();\n    res->header->is_overwrite=false;\n\treturn res;\n}\n\nPage* Page::open(std::string file_name) {\n\tauto res = new Page;\n\tauto mmap = utils::fs::MappedFile::open(file_name);\n\n\tauto region = mmap->data();\n\n\tres->mmap = mmap;\n\tres->region = region;\n\tres->header = reinterpret_cast<PageHeader*>(region);\n\tres->index = reinterpret_cast<Page_ChunkIndex*>(region + sizeof(PageHeader));\n\tres->chunks = reinterpret_cast<uint8_t*>(region + sizeof(PageHeader) + sizeof(Page_ChunkIndex)*res->header->chunk_per_storage);\n\tif (res->header->chunk_size == 0) {\n\t\tthrow MAKE_EXCEPTION(\"(res->header->chunk_size == 0)\");\n\t}\n\n\tfor (size_t i = 0; i < res->header->chunk_per_storage; ++i) {\n\t\tauto irec = &res->index[i];\n\t\tif (!irec->is_init) {\n\t\t\tbreak;\n\t\t}\n\t\tres->_itree.insert2(irec->info.maxTime, i);\n\t}\n\treturn res;\n}\n\nPageHeader Page::readHeader(std::string file_name) {\n\tstd::ifstream istream;\n\tistream.open(file_name, std::fstream::in | std::fstream::binary);\n\tif (!istream.is_open()) {\n\t\tstd::stringstream ss;\n\t\tss << \"can't open file. filename=\" << file_name;\n\t\tthrow MAKE_EXCEPTION(ss.str());\n\t}\n\tPageHeader result;\n\tmemset(&result, 0, sizeof(PageHeader));\n\tistream.read((char *)&result, sizeof(PageHeader));\n\tistream.close();\n\treturn result;\n\n}\n\nuint32_t Page::get_oldes_index() {\n    auto min_time = std::numeric_limits<dariadb::Time>::max();\n    uint32_t pos = 0;\n    auto index_end = index + header->chunk_per_storage;\n    uint32_t i = 0;\n    for (auto index_it = index; index_it != index_end; ++index_it, ++i) {\n        if (index_it->info.minTime<min_time) {\n            pos = i;\n            min_time = index_it->info.minTime;\n        }\n    }\n    return pos;\n}\n\nbool Page::append(const Chunk_Ptr&ch, MODE mode) {\n    std::lock_guard<std::mutex> lg(_locker);\n\tauto index_rec = (ChunkIndexInfo*)ch.get();\n\tauto buffer = ch->_buffer_t.data();\n\n\tassert(ch->last.time != 0);\n\tassert(header->chunk_size == ch->_buffer_t.size());\n\tif (is_full()) {\n        if (mode == MODE::SINGLE) {\n            header->is_overwrite=true;\n            header->pos_index=0;\n        }\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\tindex[header->pos_index].info = *index_rec;\n\n    index[header->pos_index].is_init = true;\n\t\n\n    if(!header->is_overwrite){\n        index[header->pos_index].offset = header->pos_chunks;\n        header->pos_chunks += header->chunk_size;\n        header->addeded_chunks++;\n\t\t_itree.insert2(index_rec->maxTime, header->pos_index);\n\t}\n\telse {\n\t\tfor (auto it = _itree.begin(); it != _itree.end();++it) {\n\t\t\tif (it->second == header->pos_index) {\n\t\t\t\t_itree.erase(it);\n\t\t\t}\n\t\t}\n\t\t_itree.insert2(index_rec->maxTime, header->pos_index);\n\t}\n\tmemcpy(this->chunks + index[header->pos_index].offset, buffer, sizeof(uint8_t)*header->chunk_size);\n\n\theader->pos_index++;\n\theader->minTime = std::min(header->minTime,ch->minTime);\n\theader->maxTime = std::max(header->maxTime, ch->maxTime);\n\treturn true;\n}\n\nbool Page::is_full()const {\n\treturn !(header->pos_index < header->chunk_per_storage);\n}\n\nCursor_ptr Page::get_chunks(const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) {\n    std::lock_guard<std::mutex> lg(_locker);\n\n\tauto raw_ptr = new PageCursor(this,ids,from,to,flag );\n\tCursor_ptr result{ raw_ptr };\n\n\theader->count_readers++;\n\t\n\treturn result;\n}\n\nChuncksList Page::get_open_chunks() {\n    std::lock_guard<std::mutex> lg(_locker);\n\tauto index_end = this->index + this->header->pos_index;\n\tauto index_it = this->index;\n\tChuncksList result;\n\tfor (; index_it != index_end; index_it++) {\n\t\tif (!index_it->is_init) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (!index_it->info.is_readonly) {\n\t\t\tindex_it->is_init = false;\n            auto ptr=new Chunk(index_it->info, this->chunks + index_it->offset, this->header->chunk_size);\n            Chunk_Ptr c = Chunk_Ptr(ptr);\n\t\t\tresult.push_back(c);\n\t\t}\n\t}\n\treturn result;\n}\n\nvoid Page::dec_reader(){\n    std::lock_guard<std::mutex> lg(_locker);\n\theader->count_readers--;\n}\n\nCursor_ptr dariadb::storage::Page::chunksByIterval(const IdArray & ids, Flag flag, Time from, Time to)\n{\n\treturn get_chunks(ids, from, to, flag);\n}\n\nIdToChunkMap dariadb::storage::Page::chunksBeforeTimePoint(const IdArray & ids, Flag flag, Time timePoint)\n{\n\tIdToChunkMap result;\n\n\tChuncksList ch_list;\n\tauto cursor = this->get_chunks(ids, header->minTime, timePoint, flag);\n\tif (cursor == nullptr) {\n\t\treturn result;\n\t}\n\tcursor->readAll(&ch_list);\n\n\tfor (auto&v : ch_list) {\n\t\tauto find_res = result.find(v->first.id);\n\t\tif (find_res == result.end()) {\n\t\t\tresult.insert(std::make_pair(v->first.id, v));\n\t\t}\n\t\telse {\n\t\t\tif (find_res->second->maxTime < v->maxTime) {\n\t\t\t\tresult[v->first.id] = v;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;\n}\nclass CountOfIdCallback :public Cursor::Callback {\npublic:\n\tdariadb::IdSet ids;\n\tCountOfIdCallback() {\n\t}\n\t~CountOfIdCallback() {\n\t}\n\n\tvirtual void call(Chunk_Ptr & ptr) override {\n\t\tif (ptr != nullptr) {\n\t\t\tids.insert(ptr->first.id);\n\t\t}\n\t}\n};\n\n\ndariadb::IdArray dariadb::storage::Page::getIds() \n{\n\tauto cursor = get_chunks(dariadb::IdArray{}, header->minTime, header->maxTime, 0);\n\n\tCountOfIdCallback*clbk_raw = new CountOfIdCallback;\n\tstd::unique_ptr<Cursor::Callback> clbk{ clbk_raw };\n\n\tcursor->readAll(clbk.get());\n\n\treturn dariadb::IdArray{ clbk_raw->ids.begin(),clbk_raw->ids.end() };\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef V_SMC_HISTORY_HPP\n#define V_SMC_HISTORY_HPP\n\n#include <vector>\n#include <cstddef>\n#include <vSMC\/particle.hpp>\n\nnamespace vSMC {\n\nenum HistoryMode {HISTORY_RAM, HISTORY_FILE, HISTORY_NONE};\n\ntemplate <class T>\nclass HistoryElement\n{\n    public :\n\n    HistoryElement (const Particle<T> &particle,\n            bool resample, double ess, std::size_t accept) :\n        e_particle(particle), e_resample(resample),\n        e_ess(ess), e_accept(accept) {}\n\n    const Particle<T> &particle () const\n    {\n        return e_particle;\n    }\n\n    double ESS () const\n    {\n        return e_ess;\n    }\n\n    bool resample () const\n    {\n        return e_resample;\n    }\n\n    std::size_t accept () const\n    {\n        return e_accept;\n    }\n\n    private :\n\n    Particle<T> e_particle;\n    bool e_resample;\n    double e_ess;\n    std::size_t e_accept;\n}; \/\/ class HistoryElement\n\ntemplate <class T>\nclass History\n{\n    public :\n\n    explicit History (HistoryMode history_mode) : mode(history_mode) {};\n\n    inline void push_back (const HistoryElement<T> &element)\n    {\n        history.push_back(element);\n    }\n\n    inline void pop_back ()\n    {\n        history.pop_back();\n    }\n\n    inline void pop_back (HistoryElement<T> &element)\n    {\n        element = history.back();\n        history.pop_back();\n    }\n\n    private :\n\n    HistoryMode mode;\n    std::vector<HistoryElement<T> > history;\n}; \/\/ class History\n\n} \/\/ namespace vSMC\n\n#endif \/\/ V_SMC_HISTORY_HPP\n<commit_msg>explicit set HISTORY_NONE mode to 0<commit_after>#ifndef V_SMC_HISTORY_HPP\n#define V_SMC_HISTORY_HPP\n\n#include <vector>\n#include <cstddef>\n#include <vSMC\/particle.hpp>\n\nnamespace vSMC {\n\nenum HistoryMode {HISTORY_NONE = 0, HISTORY_RAM, HISTORY_FILE};\n\ntemplate <class T>\nclass HistoryElement\n{\n    public :\n\n    HistoryElement (const Particle<T> &particle,\n            bool resample, double ess, std::size_t accept) :\n        e_particle(particle), e_resample(resample),\n        e_ess(ess), e_accept(accept) {}\n\n    const Particle<T> &particle () const\n    {\n        return e_particle;\n    }\n\n    double ESS () const\n    {\n        return e_ess;\n    }\n\n    bool resample () const\n    {\n        return e_resample;\n    }\n\n    std::size_t accept () const\n    {\n        return e_accept;\n    }\n\n    private :\n\n    Particle<T> e_particle;\n    bool e_resample;\n    double e_ess;\n    std::size_t e_accept;\n}; \/\/ class HistoryElement\n\ntemplate <class T>\nclass History\n{\n    public :\n\n    explicit History (HistoryMode history_mode) : mode(history_mode) {};\n\n    inline void push_back (const HistoryElement<T> &element)\n    {\n        history.push_back(element);\n    }\n\n    inline void pop_back ()\n    {\n        history.pop_back();\n    }\n\n    inline void pop_back (HistoryElement<T> &element)\n    {\n        element = history.back();\n        history.pop_back();\n    }\n\n    private :\n\n    HistoryMode mode;\n    std::vector<HistoryElement<T> > history;\n}; \/\/ class History\n\n} \/\/ namespace vSMC\n\n#endif \/\/ V_SMC_HISTORY_HPP\n<|endoftext|>"}
{"text":"<commit_before>\n#define GLOG_NO_ABBREVIATED_SEVERITIES\n#include \"base\/hexadecimal.hpp\"\n#include \"base\/not_null.hpp\"\n\n\/\/ Must come last to avoid conflicts when defining the CHECK macros.\n#include \"benchmark\/benchmark.h\"\n\nusing principia::base::not_null;\nusing principia::base::HexadecimalDecode;\nusing principia::base::HexadecimalEncode;\n\nnamespace principia {\nnamespace benchmarks {\n\nstatic char const kPi1000HexadecimalDigits[] =\n    \"3243F6A8885A308D313198A2E03707344A4093822299F31D0082EFA98EC4E6C89452821E63\"\n    \"8D01377BE5466CF34E90C6CC0AC29B7C97C50DD3F84D5B5B54709179216D5D98979FB1BD13\"\n    \"10BA698DFB5AC2FFD72DBD01ADFB7B8E1AFED6A267E96BA7C9045F12C7F9924A19947B3916\"\n    \"CF70801F2E2858EFC16636920D871574E69A458FEA3F4933D7E0D95748F728EB658718BCD5\"\n    \"882154AEE7B54A41DC25A59B59C30D5392AF26013C5D1B023286085F0CA417918B8DB38EF8\"\n    \"E79DCB0603A180E6C9E0E8BB01E8A3ED71577C1BD314B2778AF2FDA55605C60E65525F3AA5\"\n    \"5AB945748986263E8144055CA396A2AAB10B6B4CC5C341141E8CEA15486AF7C72E993B3EE1\"\n    \"411636FBC2A2BA9C55D741831F6CE5C3E169B87931EAFD6BA336C24CF5C7A3253812895867\"\n    \"73B8F48986B4BB9AFC4BFE81B6628219361D809CCFB21A991487CAC605DEC8032EF845D5DE\"\n    \"98575B1DC262302EB651B8823893E81D396ACC50F6D6FF383F442392E0B4482A484200469C\"\n    \"8F04A9E1F9B5E21C66842F6E96C9A670C9C61ABD388F06A51A0D2D8542F68960FA728AB513\"\n    \"3A36EEF0B6C137A3BE4BA3BF0507EFB2A98A1F1651D39AF017666CA593E82430E888CEE861\"\n    \"9456F9FB47D84A5C33B8B5EBEE06F75D885C12073401A449F56C16AA64ED3AA62363F77061\"\n    \"BFEDF72429B023D37D0D724D00A1248DB0FEAD\";\n\nstatic char const kPi500Bytes[] =\n    \"\\x32\\x43\\xF6\\xA8\\x88\\x5A\\x30\\x8D\\x31\\x31\\x98\\xA2\\xE0\\x37\\x07\\x34\\x4A\\x40\"\n    \"\\x93\\x82\\x22\\x99\\xF3\\x1D\\x00\\x82\\xEF\\xA9\\x8E\\xC4\\xE6\\xC8\\x94\\x52\\x82\\x1E\"\n    \"\\x63\\x8D\\x01\\x37\\x7B\\xE5\\x46\\x6C\\xF3\\x4E\\x90\\xC6\\xCC\\x0A\\xC2\\x9B\\x7C\\x97\"\n    \"\\xC5\\x0D\\xD3\\xF8\\x4D\\x5B\\x5B\\x54\\x70\\x91\\x79\\x21\\x6D\\x5D\\x98\\x97\\x9F\\xB1\"\n    \"\\xBD\\x13\\x10\\xBA\\x69\\x8D\\xFB\\x5A\\xC2\\xFF\\xD7\\x2D\\xBD\\x01\\xAD\\xFB\\x7B\\x8E\"\n    \"\\x1A\\xFE\\xD6\\xA2\\x67\\xE9\\x6B\\xA7\\xC9\\x04\\x5F\\x12\\xC7\\xF9\\x92\\x4A\\x19\\x94\"\n    \"\\x7B\\x39\\x16\\xCF\\x70\\x80\\x1F\\x2E\\x28\\x58\\xEF\\xC1\\x66\\x36\\x92\\x0D\\x87\\x15\"\n    \"\\x74\\xE6\\x9A\\x45\\x8F\\xEA\\x3F\\x49\\x33\\xD7\\xE0\\xD9\\x57\\x48\\xF7\\x28\\xEB\\x65\"\n    \"\\x87\\x18\\xBC\\xD5\\x88\\x21\\x54\\xAE\\xE7\\xB5\\x4A\\x41\\xDC\\x25\\xA5\\x9B\\x59\\xC3\"\n    \"\\x0D\\x53\\x92\\xAF\\x26\\x01\\x3C\\x5D\\x1B\\x02\\x32\\x86\\x08\\x5F\\x0C\\xA4\\x17\\x91\"\n    \"\\x8B\\x8D\\xB3\\x8E\\xF8\\xE7\\x9D\\xCB\\x06\\x03\\xA1\\x80\\xE6\\xC9\\xE0\\xE8\\xBB\\x01\"\n    \"\\xE8\\xA3\\xED\\x71\\x57\\x7C\\x1B\\xD3\\x14\\xB2\\x77\\x8A\\xF2\\xFD\\xA5\\x56\\x05\\xC6\"\n    \"\\x0E\\x65\\x52\\x5F\\x3A\\xA5\\x5A\\xB9\\x45\\x74\\x89\\x86\\x26\\x3E\\x81\\x44\\x05\\x5C\"\n    \"\\xA3\\x96\\xA2\\xAA\\xB1\\x0B\\x6B\\x4C\\xC5\\xC3\\x41\\x14\\x1E\\x8C\\xEA\\x15\\x48\\x6A\"\n    \"\\xF7\\xC7\\x2E\\x99\\x3B\\x3E\\xE1\\x41\\x16\\x36\\xFB\\xC2\\xA2\\xBA\\x9C\\x55\\xD7\\x41\"\n    \"\\x83\\x1F\\x6C\\xE5\\xC3\\xE1\\x69\\xB8\\x79\\x31\\xEA\\xFD\\x6B\\xA3\\x36\\xC2\\x4C\\xF5\"\n    \"\\xC7\\xA3\\x25\\x38\\x12\\x89\\x58\\x67\\x73\\xB8\\xF4\\x89\\x86\\xB4\\xBB\\x9A\\xFC\\x4B\"\n    \"\\xFE\\x81\\xB6\\x62\\x82\\x19\\x36\\x1D\\x80\\x9C\\xCF\\xB2\\x1A\\x99\\x14\\x87\\xCA\\xC6\"\n    \"\\x05\\xDE\\xC8\\x03\\x2E\\xF8\\x45\\xD5\\xDE\\x98\\x57\\x5B\\x1D\\xC2\\x62\\x30\\x2E\\xB6\"\n    \"\\x51\\xB8\\x82\\x38\\x93\\xE8\\x1D\\x39\\x6A\\xCC\\x50\\xF6\\xD6\\xFF\\x38\\x3F\\x44\\x23\"\n    \"\\x92\\xE0\\xB4\\x48\\x2A\\x48\\x42\\x00\\x46\\x9C\\x8F\\x04\\xA9\\xE1\\xF9\\xB5\\xE2\\x1C\"\n    \"\\x66\\x84\\x2F\\x6E\\x96\\xC9\\xA6\\x70\\xC9\\xC6\\x1A\\xBD\\x38\\x8F\\x06\\xA5\\x1A\\x0D\"\n    \"\\x2D\\x85\\x42\\xF6\\x89\\x60\\xFA\\x72\\x8A\\xB5\\x13\\x3A\\x36\\xEE\\xF0\\xB6\\xC1\\x37\"\n    \"\\xA3\\xBE\\x4B\\xA3\\xBF\\x05\\x07\\xEF\\xB2\\xA9\\x8A\\x1F\\x16\\x51\\xD3\\x9A\\xF0\\x17\"\n    \"\\x66\\x6C\\xA5\\x93\\xE8\\x24\\x30\\xE8\\x88\\xCE\\xE8\\x61\\x94\\x56\\xF9\\xFB\\x47\\xD8\"\n    \"\\x4A\\x5C\\x33\\xB8\\xB5\\xEB\\xEE\\x06\\xF7\\x5D\\x88\\x5C\\x12\\x07\\x34\\x01\\xA4\\x49\"\n    \"\\xF5\\x6C\\x16\\xAA\\x64\\xED\\x3A\\xA6\\x23\\x63\\xF7\\x70\\x61\\xBF\\xED\\xF7\\x24\\x29\"\n    \"\\xB0\\x23\\xD3\\x7D\\x0D\\x72\\x4D\\x00\\xA1\\x24\\x8D\\xB0\\xFE\\xAD\";\n\nint const kCopiesOfPi = 10000;\n\nvoid HexEncode(not_null<benchmark::State*> const state,\n              not_null<bool*> const correct,\n              std::vector<uint8_t> const& input_bytes,\n              std::vector<uint8_t> const& expected_digits) {\n  std::vector<uint8_t> digits(input_bytes.size() << 1);\n  HexadecimalEncode(input_bytes.data(), input_bytes.size(),\n                    digits.data(), digits.size());\n  state->PauseTiming();\n  *correct &= digits == expected_digits;\n  state->ResumeTiming();\n}\n\nstd::vector<uint8_t> Bytes() {\n  std::string const pi_bytes(kPi500Bytes, 500);\n  std::string bytes_str;\n  bytes_str.reserve(500 * kCopiesOfPi);\n  for (int i = 0; i < kCopiesOfPi; ++i) {\n    bytes_str += pi_bytes;\n  }\n  return std::vector<uint8_t>(bytes_str.begin(), bytes_str.end());\n}\n\nstd::vector<uint8_t> Digits() {\n  std::string digits_str;\n  digits_str.reserve(1000 * kCopiesOfPi);\n  for (int i = 0; i < kCopiesOfPi; ++i) {\n    digits_str += kPi1000HexadecimalDigits;\n  }\n  return std::vector<uint8_t>(digits_str.begin(), digits_str.end());\n}\n\nvoid BM_EncodePi(benchmark::State& state) {  \/\/ NOLINT(runtime\/references)\n  bool correct = true;\n  state.PauseTiming();\n  std::vector<uint8_t> const input_bytes = Bytes();\n  std::vector<uint8_t> const expected_digits = Digits();\n  state.ResumeTiming();\n  while (state.KeepRunning()) {\n    HexEncode(&state, &correct, input_bytes, expected_digits);\n  }\n  std::stringstream ss;\n  ss << correct;\n  state.SetLabel(ss.str());\n}\n\nBENCHMARK(BM_EncodePi);\n\nvoid HexDecode(not_null<benchmark::State*> const state,\n               not_null<bool*> const correct,\n               std::vector<uint8_t> const& input_digits,\n               std::vector<uint8_t> const& expected_bytes) {\n  std::vector<uint8_t> bytes(input_digits.size() \/ 2);\n  HexadecimalDecode(input_digits.data(), input_digits.size(),\n                    bytes.data(), bytes.size());\n  state->PauseTiming();\n  *correct &= bytes == expected_bytes;\n  state->ResumeTiming();\n}\n\nvoid BM_DecodePi(benchmark::State& state) {  \/\/ NOLINT(runtime\/references)\n  bool correct = true;\n  state.PauseTiming();\n  std::vector<uint8_t> input_digits = Digits();\n  std::vector<uint8_t> expected_bytes = Bytes();\n  state.ResumeTiming();\n  while (state.KeepRunning()) {\n    HexDecode(&state, &correct, input_digits, expected_bytes);\n  }\n  std::stringstream ss;\n  ss << correct;\n  state.SetLabel(ss.str());\n}\n\nBENCHMARK(BM_DecodePi);\n\n}  \/\/ namespace benchmarks\n}  \/\/ namespace principia\n<commit_msg>Don't count allocation time<commit_after>\n#define GLOG_NO_ABBREVIATED_SEVERITIES\n#include \"base\/hexadecimal.hpp\"\n#include \"base\/not_null.hpp\"\n\n\/\/ Must come last to avoid conflicts when defining the CHECK macros.\n#include \"benchmark\/benchmark.h\"\n\nusing principia::base::not_null;\nusing principia::base::HexadecimalDecode;\nusing principia::base::HexadecimalEncode;\n\nnamespace principia {\nnamespace benchmarks {\n\nstatic char const kPi1000HexadecimalDigits[] =\n    \"3243F6A8885A308D313198A2E03707344A4093822299F31D0082EFA98EC4E6C89452821E63\"\n    \"8D01377BE5466CF34E90C6CC0AC29B7C97C50DD3F84D5B5B54709179216D5D98979FB1BD13\"\n    \"10BA698DFB5AC2FFD72DBD01ADFB7B8E1AFED6A267E96BA7C9045F12C7F9924A19947B3916\"\n    \"CF70801F2E2858EFC16636920D871574E69A458FEA3F4933D7E0D95748F728EB658718BCD5\"\n    \"882154AEE7B54A41DC25A59B59C30D5392AF26013C5D1B023286085F0CA417918B8DB38EF8\"\n    \"E79DCB0603A180E6C9E0E8BB01E8A3ED71577C1BD314B2778AF2FDA55605C60E65525F3AA5\"\n    \"5AB945748986263E8144055CA396A2AAB10B6B4CC5C341141E8CEA15486AF7C72E993B3EE1\"\n    \"411636FBC2A2BA9C55D741831F6CE5C3E169B87931EAFD6BA336C24CF5C7A3253812895867\"\n    \"73B8F48986B4BB9AFC4BFE81B6628219361D809CCFB21A991487CAC605DEC8032EF845D5DE\"\n    \"98575B1DC262302EB651B8823893E81D396ACC50F6D6FF383F442392E0B4482A484200469C\"\n    \"8F04A9E1F9B5E21C66842F6E96C9A670C9C61ABD388F06A51A0D2D8542F68960FA728AB513\"\n    \"3A36EEF0B6C137A3BE4BA3BF0507EFB2A98A1F1651D39AF017666CA593E82430E888CEE861\"\n    \"9456F9FB47D84A5C33B8B5EBEE06F75D885C12073401A449F56C16AA64ED3AA62363F77061\"\n    \"BFEDF72429B023D37D0D724D00A1248DB0FEAD\";\n\nstatic char const kPi500Bytes[] =\n    \"\\x32\\x43\\xF6\\xA8\\x88\\x5A\\x30\\x8D\\x31\\x31\\x98\\xA2\\xE0\\x37\\x07\\x34\\x4A\\x40\"\n    \"\\x93\\x82\\x22\\x99\\xF3\\x1D\\x00\\x82\\xEF\\xA9\\x8E\\xC4\\xE6\\xC8\\x94\\x52\\x82\\x1E\"\n    \"\\x63\\x8D\\x01\\x37\\x7B\\xE5\\x46\\x6C\\xF3\\x4E\\x90\\xC6\\xCC\\x0A\\xC2\\x9B\\x7C\\x97\"\n    \"\\xC5\\x0D\\xD3\\xF8\\x4D\\x5B\\x5B\\x54\\x70\\x91\\x79\\x21\\x6D\\x5D\\x98\\x97\\x9F\\xB1\"\n    \"\\xBD\\x13\\x10\\xBA\\x69\\x8D\\xFB\\x5A\\xC2\\xFF\\xD7\\x2D\\xBD\\x01\\xAD\\xFB\\x7B\\x8E\"\n    \"\\x1A\\xFE\\xD6\\xA2\\x67\\xE9\\x6B\\xA7\\xC9\\x04\\x5F\\x12\\xC7\\xF9\\x92\\x4A\\x19\\x94\"\n    \"\\x7B\\x39\\x16\\xCF\\x70\\x80\\x1F\\x2E\\x28\\x58\\xEF\\xC1\\x66\\x36\\x92\\x0D\\x87\\x15\"\n    \"\\x74\\xE6\\x9A\\x45\\x8F\\xEA\\x3F\\x49\\x33\\xD7\\xE0\\xD9\\x57\\x48\\xF7\\x28\\xEB\\x65\"\n    \"\\x87\\x18\\xBC\\xD5\\x88\\x21\\x54\\xAE\\xE7\\xB5\\x4A\\x41\\xDC\\x25\\xA5\\x9B\\x59\\xC3\"\n    \"\\x0D\\x53\\x92\\xAF\\x26\\x01\\x3C\\x5D\\x1B\\x02\\x32\\x86\\x08\\x5F\\x0C\\xA4\\x17\\x91\"\n    \"\\x8B\\x8D\\xB3\\x8E\\xF8\\xE7\\x9D\\xCB\\x06\\x03\\xA1\\x80\\xE6\\xC9\\xE0\\xE8\\xBB\\x01\"\n    \"\\xE8\\xA3\\xED\\x71\\x57\\x7C\\x1B\\xD3\\x14\\xB2\\x77\\x8A\\xF2\\xFD\\xA5\\x56\\x05\\xC6\"\n    \"\\x0E\\x65\\x52\\x5F\\x3A\\xA5\\x5A\\xB9\\x45\\x74\\x89\\x86\\x26\\x3E\\x81\\x44\\x05\\x5C\"\n    \"\\xA3\\x96\\xA2\\xAA\\xB1\\x0B\\x6B\\x4C\\xC5\\xC3\\x41\\x14\\x1E\\x8C\\xEA\\x15\\x48\\x6A\"\n    \"\\xF7\\xC7\\x2E\\x99\\x3B\\x3E\\xE1\\x41\\x16\\x36\\xFB\\xC2\\xA2\\xBA\\x9C\\x55\\xD7\\x41\"\n    \"\\x83\\x1F\\x6C\\xE5\\xC3\\xE1\\x69\\xB8\\x79\\x31\\xEA\\xFD\\x6B\\xA3\\x36\\xC2\\x4C\\xF5\"\n    \"\\xC7\\xA3\\x25\\x38\\x12\\x89\\x58\\x67\\x73\\xB8\\xF4\\x89\\x86\\xB4\\xBB\\x9A\\xFC\\x4B\"\n    \"\\xFE\\x81\\xB6\\x62\\x82\\x19\\x36\\x1D\\x80\\x9C\\xCF\\xB2\\x1A\\x99\\x14\\x87\\xCA\\xC6\"\n    \"\\x05\\xDE\\xC8\\x03\\x2E\\xF8\\x45\\xD5\\xDE\\x98\\x57\\x5B\\x1D\\xC2\\x62\\x30\\x2E\\xB6\"\n    \"\\x51\\xB8\\x82\\x38\\x93\\xE8\\x1D\\x39\\x6A\\xCC\\x50\\xF6\\xD6\\xFF\\x38\\x3F\\x44\\x23\"\n    \"\\x92\\xE0\\xB4\\x48\\x2A\\x48\\x42\\x00\\x46\\x9C\\x8F\\x04\\xA9\\xE1\\xF9\\xB5\\xE2\\x1C\"\n    \"\\x66\\x84\\x2F\\x6E\\x96\\xC9\\xA6\\x70\\xC9\\xC6\\x1A\\xBD\\x38\\x8F\\x06\\xA5\\x1A\\x0D\"\n    \"\\x2D\\x85\\x42\\xF6\\x89\\x60\\xFA\\x72\\x8A\\xB5\\x13\\x3A\\x36\\xEE\\xF0\\xB6\\xC1\\x37\"\n    \"\\xA3\\xBE\\x4B\\xA3\\xBF\\x05\\x07\\xEF\\xB2\\xA9\\x8A\\x1F\\x16\\x51\\xD3\\x9A\\xF0\\x17\"\n    \"\\x66\\x6C\\xA5\\x93\\xE8\\x24\\x30\\xE8\\x88\\xCE\\xE8\\x61\\x94\\x56\\xF9\\xFB\\x47\\xD8\"\n    \"\\x4A\\x5C\\x33\\xB8\\xB5\\xEB\\xEE\\x06\\xF7\\x5D\\x88\\x5C\\x12\\x07\\x34\\x01\\xA4\\x49\"\n    \"\\xF5\\x6C\\x16\\xAA\\x64\\xED\\x3A\\xA6\\x23\\x63\\xF7\\x70\\x61\\xBF\\xED\\xF7\\x24\\x29\"\n    \"\\xB0\\x23\\xD3\\x7D\\x0D\\x72\\x4D\\x00\\xA1\\x24\\x8D\\xB0\\xFE\\xAD\";\n\nint const kCopiesOfPi = 10000;\n\nvoid HexEncode(not_null<benchmark::State*> const state,\n              not_null<bool*> const correct,\n              std::vector<uint8_t> const& input_bytes,\n              std::vector<uint8_t> const& expected_digits) {\n  state->PauseTiming();\n  std::vector<uint8_t> digits(input_bytes.size() << 1);\n  state->ResumeTiming();\n  HexadecimalEncode(input_bytes.data(), input_bytes.size(),\n                    digits.data(), digits.size());\n  state->PauseTiming();\n  *correct &= digits == expected_digits;\n  state->ResumeTiming();\n}\n\nstd::vector<uint8_t> Bytes() {\n  std::string const pi_bytes(kPi500Bytes, 500);\n  std::string bytes_str;\n  bytes_str.reserve(500 * kCopiesOfPi);\n  for (int i = 0; i < kCopiesOfPi; ++i) {\n    bytes_str += pi_bytes;\n  }\n  return std::vector<uint8_t>(bytes_str.begin(), bytes_str.end());\n}\n\nstd::vector<uint8_t> Digits() {\n  std::string digits_str;\n  digits_str.reserve(1000 * kCopiesOfPi);\n  for (int i = 0; i < kCopiesOfPi; ++i) {\n    digits_str += kPi1000HexadecimalDigits;\n  }\n  return std::vector<uint8_t>(digits_str.begin(), digits_str.end());\n}\n\nvoid BM_EncodePi(benchmark::State& state) {  \/\/ NOLINT(runtime\/references)\n  bool correct = true;\n  state.PauseTiming();\n  std::vector<uint8_t> const input_bytes = Bytes();\n  std::vector<uint8_t> const expected_digits = Digits();\n  state.ResumeTiming();\n  while (state.KeepRunning()) {\n    HexEncode(&state, &correct, input_bytes, expected_digits);\n  }\n  std::stringstream ss;\n  ss << correct;\n  state.SetLabel(ss.str());\n}\n\nBENCHMARK(BM_EncodePi);\n\nvoid HexDecode(not_null<benchmark::State*> const state,\n               not_null<bool*> const correct,\n               std::vector<uint8_t> const& input_digits,\n               std::vector<uint8_t> const& expected_bytes) {\n  state->PauseTiming();\n  std::vector<uint8_t> bytes(input_digits.size() \/ 2);\n  state->ResumeTiming();\n  HexadecimalDecode(input_digits.data(), input_digits.size(),\n                    bytes.data(), bytes.size());\n  state->PauseTiming();\n  *correct &= bytes == expected_bytes;\n  state->ResumeTiming();\n}\n\nvoid BM_DecodePi(benchmark::State& state) {  \/\/ NOLINT(runtime\/references)\n  bool correct = true;\n  state.PauseTiming();\n  std::vector<uint8_t> input_digits = Digits();\n  std::vector<uint8_t> expected_bytes = Bytes();\n  state.ResumeTiming();\n  while (state.KeepRunning()) {\n    HexDecode(&state, &correct, input_digits, expected_bytes);\n  }\n  std::stringstream ss;\n  ss << correct;\n  state.SetLabel(ss.str());\n}\n\nBENCHMARK(BM_DecodePi);\n\n}  \/\/ namespace benchmarks\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>#include <catch.hpp>\n#include <rapidcheck-catch.h>\n\n#include \"util\/Predictable.h\"\n\nusing namespace rc;\n\n\/\/ Always increasing type for testing generatinon ordering. Note that this is\n\/\/ very much a hack but it will catch regressions where arguments are not\n\/\/ generated in the correct order.\nstruct IncInt { int value; };\n\nnamespace rc {\n\ntemplate<>\nclass Arbitrary<IncInt> : public gen::Generator<IncInt>\n{\npublic:\n    IncInt generate() const override\n    {\n        return IncInt { value()++ };\n    }\n\n    static int &value()\n    {\n        static int value = 0;\n        return value;\n    }\n\n    static void reset()\n    { value() = 0; }\n};\n\n} \/\/ namespace rc\n\nnamespace {\n\nvoid show(IncInt x, std::ostream &os) { os << x.value; }\n\n} \/\/ namespace\n\nTEST_CASE(\"gen::lambda\") {\n    prop(\"generates the return value of the given callable\",\n         [] (int x) {\n             auto generator = gen::lambda([=] { return x; });\n             for (int i = 0; i < gen::currentSize(); i++)\n                 RC_ASSERT(*generator == x);\n         });\n}\n\nTEST_CASE(\"gen::rescue\") {\n    prop(\"converts exceptions to generated values\",\n         [] (int x) {\n             auto generator = gen::lambda([=] {\n                 throw std::to_string(x);\n                 return std::string(\"\");\n             });\n\n             std::string str(\n                 *gen::noShrink(\n                     gen::rescue<std::string>(\n                         generator,\n                         [] (const std::string &ex) {\n                             return ex;\n                         })));\n\n             RC_ASSERT(str == std::to_string(x));\n         });\n}\n\nTEST_CASE(\"gen::anyInvocation\") {\n    prop(\"generates arguments in listing order\",\n         [] {\n             Arbitrary<IncInt>::reset();\n             auto tuple = *gen::noShrink(\n                 gen::anyInvocation(\n                     [] (IncInt a, IncInt b, IncInt c) {\n                         return std::make_tuple(a.value, b.value, c.value);\n                     }));\n\n             RC_ASSERT(std::get<0>(tuple) < std::get<1>(tuple));\n             RC_ASSERT(std::get<1>(tuple) < std::get<2>(tuple));\n         });\n\n    prop(\"uses the appropriate Arbitrary instance\",\n         [] {\n             auto tuple = *gen::noShrink(\n                 gen::anyInvocation(\n                     [] (const Predictable &a,\n                         Predictable &&b,\n                         Predictable c)\n             {\n                 return std::make_tuple(a.value, b.value, c.value);\n             }));\n             RC_ASSERT(std::get<0>(tuple) == Predictable::predictableValue);\n             RC_ASSERT(std::get<1>(tuple) == Predictable::predictableValue);\n             RC_ASSERT(std::get<2>(tuple) == Predictable::predictableValue);\n         });\n\n    prop(\"uses the return value as the generated value\",\n         [] {\n             int x = *gen::noShrink(\n                 gen::anyInvocation([] (int a, int b) { return 12345; }));\n             RC_ASSERT(x == 12345);\n         });\n}\n<commit_msg>Use isArbitraryPredictable in InvokeTests instead of predictableValue<commit_after>#include <catch.hpp>\n#include <rapidcheck-catch.h>\n\n#include \"util\/Predictable.h\"\n\nusing namespace rc;\n\n\/\/ Always increasing type for testing generatinon ordering. Note that this is\n\/\/ very much a hack but it will catch regressions where arguments are not\n\/\/ generated in the correct order.\nstruct IncInt { int value; };\n\nnamespace rc {\n\ntemplate<>\nclass Arbitrary<IncInt> : public gen::Generator<IncInt>\n{\npublic:\n    IncInt generate() const override\n    {\n        return IncInt { value()++ };\n    }\n\n    static int &value()\n    {\n        static int value = 0;\n        return value;\n    }\n\n    static void reset()\n    { value() = 0; }\n};\n\n} \/\/ namespace rc\n\nnamespace {\n\nvoid show(IncInt x, std::ostream &os) { os << x.value; }\n\n} \/\/ namespace\n\nTEST_CASE(\"gen::lambda\") {\n    prop(\"generates the return value of the given callable\",\n         [] (int x) {\n             auto generator = gen::lambda([=] { return x; });\n             for (int i = 0; i < gen::currentSize(); i++)\n                 RC_ASSERT(*generator == x);\n         });\n}\n\nTEST_CASE(\"gen::rescue\") {\n    prop(\"converts exceptions to generated values\",\n         [] (int x) {\n             auto generator = gen::lambda([=] {\n                 throw std::to_string(x);\n                 return std::string(\"\");\n             });\n\n             std::string str(\n                 *gen::noShrink(\n                     gen::rescue<std::string>(\n                         generator,\n                         [] (const std::string &ex) {\n                             return ex;\n                         })));\n\n             RC_ASSERT(str == std::to_string(x));\n         });\n}\n\nTEST_CASE(\"gen::anyInvocation\") {\n    prop(\"generates arguments in listing order\",\n         [] {\n             Arbitrary<IncInt>::reset();\n             auto tuple = *gen::noShrink(\n                 gen::anyInvocation(\n                     [] (IncInt a, IncInt b, IncInt c) {\n                         return std::make_tuple(a.value, b.value, c.value);\n                     }));\n\n             RC_ASSERT(std::get<0>(tuple) < std::get<1>(tuple));\n             RC_ASSERT(std::get<1>(tuple) < std::get<2>(tuple));\n         });\n\n    prop(\"uses the appropriate Arbitrary instance\",\n         [] {\n             auto tuple = *gen::noShrink(\n                 gen::anyInvocation(\n                     [] (const Predictable &a,\n                         Predictable &&b,\n                         Predictable c)\n             {\n                 return std::make_tuple(a, b, c);\n             }));\n             RC_ASSERT(isArbitraryPredictable(std::get<0>(tuple)));\n             RC_ASSERT(isArbitraryPredictable(std::get<1>(tuple)));\n             RC_ASSERT(isArbitraryPredictable(std::get<2>(tuple)));\n         });\n\n    prop(\"uses the return value as the generated value\",\n         [] {\n             int x = *gen::noShrink(\n                 gen::anyInvocation([] (int a, int b) { return 12345; }));\n             RC_ASSERT(x == 12345);\n         });\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ------------------------------------------------------------------------\n\/\/ audioio-ewf.cpp: Ecasound wave format input\/output\n\/\/ Copyright (C) 1999-2002,2005,2008 Kai Vehmanen\n\/\/\n\/\/ Attributes:\n\/\/     eca-style-version: 3 (see Ecasound Programmer's Guide)\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#include <algorithm>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <cmath>\n\n#include <kvu_message_item.h>\n#include <kvu_numtostr.h>\n#include <kvu_dbc.h>\n\n#include \"eca-object-factory.h\"\n#include \"samplebuffer.h\"\n#include \"audioio-ewf.h\"\n\n#include \"eca-error.h\"\n#include \"eca-logger.h\"\n\nusing std::cout;\nusing std::endl;\nusing SAMPLE_SPECS::sample_pos_t;\n\n\/**\n * FIXME notes  (last update 2008-03-09)\n *\n *  - Add (more) sanity checks for ewf fields.\n *\/\n\nEWFFILE::EWFFILE (void)\n{\n}\n\nEWFFILE::~EWFFILE(void)\n{\n}\n\nEWFFILE* EWFFILE::clone(void) const\n{\n  EWFFILE* target = new EWFFILE();\n  for(int n = 0; n < number_of_params(); n++) {\n    target->set_parameter(n + 1, get_parameter(n + 1));\n  }\n  return target;\n}\n\nvoid EWFFILE::open(void) throw(AUDIO_IO::SETUP_ERROR &)\n{\n  if (io_mode() != AUDIO_IO::io_read)\n    ECA_LOG_MSG(ECA_LOGGER::info, \n\t\t\"WARNING: Writing to EWF files is a deprecated feature since 2.4.7 (2008), and it will be disabled in a future release.\");\n\n  ewf_rc.resource_file(label());\n  ewf_rc.load();\n  read_ewf_data();\n\n  AUDIO_SEQUENCER_BASE::open();\n}\n\nvoid EWFFILE::close(void)\n{\n  if (io_mode() != AUDIO_IO::io_read) \n    write_ewf_data();\n\n  AUDIO_SEQUENCER_BASE::close();\n}\n\nvoid EWFFILE::init_default_child(void) throw(ECA_ERROR&)\n{\n  string::const_iterator e = std::find(label().begin(), label().end(), '.');\n  if (e == label().end()) {\n    throw(ECA_ERROR(\"AUDIOIO-EWF\", \"Invalid file name; unable to open file.\",ECA_ERROR::retry));\n  }\n\n  string child_name (label().begin(), e);\n  child_name += \".wav\";\n  set_child_object_string(child_name);\n\n  DBC_CHECK(child_name == child_object_string());\n\n  ewf_rc.resource(\"source\", child_object_string());\n}\n\nvoid EWFFILE::read_ewf_data(void) throw(ECA_ERROR&)\n{\n  if (ewf_rc.has(\"source\"))\n    set_child_object_string(ewf_rc.resource(\"source\"));\n  else \n    init_default_child();\n\n  if (ewf_rc.has(\"offset\")) {\n    set_child_offset(ECA_AUDIO_TIME(ewf_rc.resource(\"offset\")));\n  }\n  else\n    set_child_offset(ECA_AUDIO_TIME());\n\n  \/* FIXME: doesn't work, if child has different srate and start-pos\n   *        specified in samples, the result is incorrect! *\/\n\n  if (ewf_rc.has(\"start-position\")) {\n    set_child_start_position(ECA_AUDIO_TIME(ewf_rc.resource(\"start-position\")));\n  }\n  else\n    set_child_start_position(ECA_AUDIO_TIME());\n\n  if (ewf_rc.has(\"length\")) {\n    set_child_length(ECA_AUDIO_TIME(ewf_rc.resource(\"length\")));\n  }\n  else\n    set_child_length(ECA_AUDIO_TIME());\n\n  toggle_looping(ewf_rc.boolean_resource(\"looping\"));\n\n  const std::vector<std::string> keys = ewf_rc.keywords();\n  std::vector<std::string>::const_iterator p = keys.begin();\n  while(p != keys.end()) {\n    if (*p != \"source\" &&\n\t*p != \"offset\" &&\n\t*p != \"start-position\" &&\n\t*p != \"length\" &&\n\t*p != \"looping\")\n      ECA_LOG_MSG(ECA_LOGGER::info, \n\t\t  \"WARNING: Unknown keyword '\" \n\t\t  + *p \n\t\t  + \"' in EWF file '\" \n\t\t  + label() \n\t\t  + \"'.\");\n    ++p;\n  }\n}\n\nvoid EWFFILE::write_ewf_data(void)\n{\n  ewf_rc.resource(\"source\", child_object_string());\n  if (child_offset().samples() > 0)\n    ewf_rc.resource(\"offset\", kvu_numtostr(child_offset().seconds(),6));\n  if (child_start_position().samples() != 0) \n    ewf_rc.resource(\"start-position\", kvu_numtostr(child_start_position().seconds(), 6));\n  if (child_looping() == true) \n    ewf_rc.resource(\"looping\",\"true\");\n  if (child_length().valid() == true)\n    ewf_rc.resource(\"length\", kvu_numtostr(child_length().seconds(),  6));\n  \n  ewf_rc.save();\n}\n\nstd::string EWFFILE::parameter_names(void) const\n{\n  return AUDIO_IO::parameter_names();\n}\n\nvoid EWFFILE::set_parameter(int param, std::string value)\n{\n  AUDIO_IO::set_parameter(param, value);\n}\n\nstd::string EWFFILE::get_parameter(int param) const\n{\n  return AUDIO_IO::get_parameter(param);\n}\n<commit_msg>Fixed a bug in detecting end-of-stream of EWF files. Bug reported by Julien Claassen.<commit_after>\/\/ ------------------------------------------------------------------------\n\/\/ audioio-ewf.cpp: Ecasound wave format input\/output\n\/\/ Copyright (C) 1999-2002,2005,2008 Kai Vehmanen\n\/\/\n\/\/ Attributes:\n\/\/     eca-style-version: 3 (see Ecasound Programmer's Guide)\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#include <algorithm>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <cmath>\n\n#include <kvu_message_item.h>\n#include <kvu_numtostr.h>\n#include <kvu_dbc.h>\n\n#include \"eca-object-factory.h\"\n#include \"samplebuffer.h\"\n#include \"audioio-ewf.h\"\n\n#include \"eca-error.h\"\n#include \"eca-logger.h\"\n\nusing std::cout;\nusing std::endl;\nusing SAMPLE_SPECS::sample_pos_t;\n\n\/**\n * FIXME notes  (last update 2008-03-09)\n *\n *  - Add (more) sanity checks for ewf fields.\n *\/\n\nEWFFILE::EWFFILE (void)\n{\n}\n\nEWFFILE::~EWFFILE(void)\n{\n}\n\nEWFFILE* EWFFILE::clone(void) const\n{\n  EWFFILE* target = new EWFFILE();\n  for(int n = 0; n < number_of_params(); n++) {\n    target->set_parameter(n + 1, get_parameter(n + 1));\n  }\n  return target;\n}\n\nvoid EWFFILE::open(void) throw(AUDIO_IO::SETUP_ERROR &)\n{\n  if (io_mode() != AUDIO_IO::io_read)\n    ECA_LOG_MSG(ECA_LOGGER::info, \n\t\t\"WARNING: Writing to EWF files is a deprecated feature since 2.4.7 (2008), and it will be disabled in a future release.\");\n\n  ewf_rc.resource_file(label());\n  ewf_rc.load();\n  read_ewf_data();\n\n  AUDIO_SEQUENCER_BASE::open();\n}\n\nvoid EWFFILE::close(void)\n{\n  if (io_mode() != AUDIO_IO::io_read) \n    write_ewf_data();\n\n  AUDIO_SEQUENCER_BASE::close();\n}\n\nvoid EWFFILE::init_default_child(void) throw(ECA_ERROR&)\n{\n  string::const_iterator e = std::find(label().begin(), label().end(), '.');\n  if (e == label().end()) {\n    throw(ECA_ERROR(\"AUDIOIO-EWF\", \"Invalid file name; unable to open file.\",ECA_ERROR::retry));\n  }\n\n  string child_name (label().begin(), e);\n  child_name += \".wav\";\n  set_child_object_string(child_name);\n\n  DBC_CHECK(child_name == child_object_string());\n\n  ewf_rc.resource(\"source\", child_object_string());\n}\n\nvoid EWFFILE::read_ewf_data(void) throw(ECA_ERROR&)\n{\n  if (ewf_rc.has(\"source\"))\n    set_child_object_string(ewf_rc.resource(\"source\"));\n  else \n    init_default_child();\n\n  if (ewf_rc.has(\"offset\")) {\n    set_child_offset(ECA_AUDIO_TIME(ewf_rc.resource(\"offset\")));\n  }\n  else\n    set_child_offset(ECA_AUDIO_TIME());\n\n  \/* FIXME: doesn't work, if child has different srate and start-pos\n   *        specified in samples, the result is incorrect! *\/\n\n  if (ewf_rc.has(\"start-position\")) {\n    set_child_start_position(ECA_AUDIO_TIME(ewf_rc.resource(\"start-position\")));\n  }\n  else\n    set_child_start_position(ECA_AUDIO_TIME());\n\n  if (ewf_rc.has(\"length\")) {\n    set_child_length(ECA_AUDIO_TIME(ewf_rc.resource(\"length\")));\n  }\n\n  toggle_looping(ewf_rc.boolean_resource(\"looping\"));\n\n  const std::vector<std::string> keys = ewf_rc.keywords();\n  std::vector<std::string>::const_iterator p = keys.begin();\n  while(p != keys.end()) {\n    if (*p != \"source\" &&\n\t*p != \"offset\" &&\n\t*p != \"start-position\" &&\n\t*p != \"length\" &&\n\t*p != \"looping\")\n      ECA_LOG_MSG(ECA_LOGGER::info, \n\t\t  \"WARNING: Unknown keyword '\" \n\t\t  + *p \n\t\t  + \"' in EWF file '\" \n\t\t  + label() \n\t\t  + \"'.\");\n    ++p;\n  }\n}\n\nvoid EWFFILE::write_ewf_data(void)\n{\n  ewf_rc.resource(\"source\", child_object_string());\n  if (child_offset().samples() > 0)\n    ewf_rc.resource(\"offset\", kvu_numtostr(child_offset().seconds(),6));\n  if (child_start_position().samples() != 0) \n    ewf_rc.resource(\"start-position\", kvu_numtostr(child_start_position().seconds(), 6));\n  if (child_looping() == true) \n    ewf_rc.resource(\"looping\",\"true\");\n  if (child_length().valid() == true)\n    ewf_rc.resource(\"length\", kvu_numtostr(child_length().seconds(),  6));\n  \n  ewf_rc.save();\n}\n\nstd::string EWFFILE::parameter_names(void) const\n{\n  return AUDIO_IO::parameter_names();\n}\n\nvoid EWFFILE::set_parameter(int param, std::string value)\n{\n  AUDIO_IO::set_parameter(param, value);\n}\n\nstd::string EWFFILE::get_parameter(int param) const\n{\n  return AUDIO_IO::get_parameter(param);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n#include <cstring>\n#include <cstdio>\n#include <cassert>\n#include <cstdlib>\n#include <algorithm>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <random>\n#include <vector>\n\n#include <sys\/resource.h>\n\n#include \"hashpack.h\"\n#include \"hashmap.h\"\n#include \"timers.hpp\"\n\nusing namespace std;\nusing namespace rigtorp;\n\ntemplate <typename ht>\nvoid populate(ht & h, vector<uint64_t> & keys) {\n    for(size_t i = 0; i < keys.size(); ++i) {\n        h.emplace(keys[i], i);\n    }\n}\n\ntemplate <typename ht>\nsize_t  query(ht & h, vector<uint64_t> & keys, size_t howmany) {\n    size_t sum = 0;\n    for(size_t i = 0; i < howmany; ++i) {\n        auto it = h.find(keys[i]);\n        if(it != h.end()) sum+= it->second;\n    }\n    return sum;\n}\n\ntemplate <typename ht>\nvoid query_avg_probed_keys(ht & h, vector<uint64_t> & keys, double * average, double * stderrprob) {\n    double sum = 0;\n    double sumsquare = 0;\n    for(size_t i = 0; i < keys.size(); ++i) {\n        double probed = h.probed_keys(keys[i]);\n        sum += probed;\n        sumsquare += probed * probed;\n    }\n    *average = sum  \/ keys.size();\n    *stderrprob = sqrt(sumsquare \/  keys.size() - *average * *average );\n}\n\ntemplate <typename ht>\nsize_t query_max_probed_keys(ht & h, vector<uint64_t> & keys) {\n    size_t mp = 0;\n    for(size_t i = 0; i < keys.size(); ++i) {\n        size_t tp = h.probed_keys(keys[i]);\n        if(tp > mp) mp = tp;\n    }\n    return mp;\n}\nconst uint64_t EMPTY = 0xFFFFFFFFFFFFFFFF;\n\nstruct BasicWorker {\n    template <typename Pack>\n    static inline void Go(std::vector<uint64_t> &keys, const float loadfactor,\n                          const int repeat, size_t howmanyqueries) {\n        double querycycles = 0;\n        double probesperquery = 0;\n        double probesperquerystderr = 0;\n        double maxprobesperquery = 0;\n\n        size_t howmany = keys.size();\n        assert(howmanyqueries <= howmany);\n        std::cout << \"testing \" << setw(20) << string(Pack::NAME) << \" \";\n        std::cout.flush();\n        uint64_t sum = 0;\n        vector<HashMap<uint64_t, uint32_t, Pack>> collection;\n        uint64_t cycles_start, cycles_end;\n        for (int r = 0; r < repeat; ++r) {\n            HashMap<uint64_t, uint32_t, Pack> hm(16, EMPTY, loadfactor);\n            cycles_start = RDTSC_START();\n            populate(hm, keys);\n            cycles_end = RDTSC_FINAL();\n            collection.push_back(hm);\n        }\n        double max_avg_probes = 0;\n        for (int r = 0; r < repeat; ++r) {\n            HashMap<uint64_t, uint32_t, Pack> &hm = collection[r];\n            cycles_start = RDTSC_START();\n            sum += query(hm, keys, howmanyqueries);\n            cycles_end = RDTSC_FINAL();\n            querycycles += (cycles_end - cycles_start) * 1.0 \/ howmanyqueries;\n            double pk, pkerr;\n            query_avg_probed_keys(hm, keys, &pk, &pkerr);\n            max_avg_probes = std::max<double>(pk, max_avg_probes);\n            double mk = query_max_probed_keys(hm, keys);\n            probesperquery += pk;\n            probesperquerystderr += pkerr;\n            maxprobesperquery += mk;\n        }\n        std::cout << \"     \" << setw(10) << querycycles \/ repeat\n                  << \" avg cycles \";\n        std::cout << \"     \" << setw(10) << probesperquery \/ repeat\n                  << \" avg probes \";\n        std::cout << \"     \" << setw(10) << probesperquerystderr \/ repeat\n                  << \" avg std. error \";\n        std::cout << \"     \" << setw(10) << maxprobesperquery \/ repeat\n                  << \" avg max probes \";\n        std::cout << \"     \" << setw(10) << max_avg_probes\n                  << \" max avg probes \";\n        std::cout << \" ignore me: \" << sum;\n        std::cout << std::endl;\n    }\n    static inline void Stop() {}\n};\n\nvoid demorandom(const uint64_t howmany, const float loadfactor,\n                const float repeat, const size_t howmanyqueries) {\n    srand(0);\n    std::vector<uint64_t>  keys;\n    for(uint64_t i = 1; i <= howmany; ++i) {\n      uint64_t newkey = get64rand();\n      while(newkey == EMPTY) newkey = get64rand();\n      keys.push_back(newkey);\n    }\n    std::cout << \"populating a hash table with \" << howmany << \" random 64-bit keys and then retrieving them. \" << std::endl;\n    std::cout << \"load factor = \" << loadfactor << std::endl;\n    std::cout << \"number of consecutive queries on same hash table = \" << howmanyqueries << std::endl;\n\n    std::cout << \"We repeat with \" << repeat << \" different hash functions, using the same keys.\" << std::endl;\n\n    ForEachT<Zobrist64Pack, MultiplyShift64Pack, WZobrist64Pack, ClLinear64Pack, ClQuadratic64Pack, ClCubic64Pack, ClQuartic64Pack,\n             ThorupZhangCWCubic64Pack>::template Go<BasicWorker>(keys,\n                                                                 loadfactor,\n                                                                 repeat, howmanyqueries);\n\n    std::cout << std::endl;\n\n}\n\nvoid demofixed(const uint64_t howmany, const float loadfactor, const float repeat, const size_t howmanyqueries) {\n    srand(0);\n    std::vector<uint64_t>  keys;\n    for(uint64_t i = 1; i <= howmany; ++i) {\n        keys.push_back(i + UINT64_C(0xFFFFFFFFF));\n    }\n    std::random_device rd;\n    std::mt19937 g(rd());\n    std::shuffle(keys.begin(), keys.end(),g);\n\n    std::cout << \"populating a hash table with \" << howmany << \" sequential and shuffled 64-bit keys and then retrieving them. \" << std::endl;\n    std::cout << \"load factor = \" << loadfactor << std::endl;\n    std::cout << \"number of consecutive queries on same hash table = \" << howmanyqueries << std::endl;\n\n    std::cout << \"We repeat with \" << repeat << \" different hash functions, using the same keys.\" << std::endl;\n\n\n    ForEachT<Cyclic64Pack, Zobrist64Pack, WZobrist64Pack, MultiplyShift64Pack, ClLinear64Pack, ClQuadratic64Pack, ClCubic64Pack, ClQuartic64Pack,\n             ThorupZhangCWCubic64Pack>::template Go<BasicWorker>(keys,\n                                                                 loadfactor,\n                                                                 repeat,howmanyqueries);\n\n    std::cout << std::endl;\n\n}\n\n\nint main() {\n    const float loadfactor = 0.9;\n    const float repeat = 1000;\n    const size_t howmanyqueries = 10;\n\n    demofixed(1000, loadfactor, repeat, howmanyqueries);\n    demofixed(2000, loadfactor, repeat, howmanyqueries);\n    demofixed(64000, loadfactor, repeat, howmanyqueries);\n    demofixed(120000, loadfactor, repeat, howmanyqueries);\n\n    std::cout << \"=======\" << std::endl;\n\n    demorandom(1000, loadfactor, repeat, howmanyqueries);\n    demorandom(2000, loadfactor, repeat, howmanyqueries);\n    demorandom(64000, loadfactor, repeat, howmanyqueries);\n    demorandom(120000, loadfactor, repeat, howmanyqueries);\n\n}\n<commit_msg>Uniformizing the tests<commit_after>#include <cmath>\n#include <cstring>\n#include <cstdio>\n#include <cassert>\n#include <cstdlib>\n#include <algorithm>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <random>\n#include <vector>\n\n#include <sys\/resource.h>\n\n#include \"hashpack.h\"\n#include \"hashmap.h\"\n#include \"timers.hpp\"\n\nusing namespace std;\nusing namespace rigtorp;\n\ntemplate <typename ht>\nvoid populate(ht & h, vector<uint64_t> & keys) {\n    for(size_t i = 0; i < keys.size(); ++i) {\n        h.emplace(keys[i], i);\n    }\n}\n\ntemplate <typename ht>\nsize_t  query(ht & h, vector<uint64_t> & keys, size_t howmany) {\n    size_t sum = 0;\n    for(size_t i = 0; i < howmany; ++i) {\n        auto it = h.find(keys[i]);\n        if(it != h.end()) sum+= it->second;\n    }\n    return sum;\n}\n\ntemplate <typename ht>\nvoid query_avg_probed_keys(ht & h, vector<uint64_t> & keys, double * average, double * stderrprob) {\n    double sum = 0;\n    double sumsquare = 0;\n    for(size_t i = 0; i < keys.size(); ++i) {\n        double probed = h.probed_keys(keys[i]);\n        sum += probed;\n        sumsquare += probed * probed;\n    }\n    *average = sum  \/ keys.size();\n    *stderrprob = sqrt(sumsquare \/  keys.size() - *average * *average );\n}\n\ntemplate <typename ht>\nsize_t query_max_probed_keys(ht & h, vector<uint64_t> & keys) {\n    size_t mp = 0;\n    for(size_t i = 0; i < keys.size(); ++i) {\n        size_t tp = h.probed_keys(keys[i]);\n        if(tp > mp) mp = tp;\n    }\n    return mp;\n}\nconst uint64_t EMPTY = 0xFFFFFFFFFFFFFFFF;\n\nstruct BasicWorker {\n    template <typename Pack>\n    static inline void Go(std::vector<uint64_t> &keys, const float loadfactor,\n                          const int repeat, size_t howmanyqueries) {\n        double querycycles = 0;\n        double probesperquery = 0;\n        double probesperquerystderr = 0;\n        double maxprobesperquery = 0;\n\n        size_t howmany = keys.size();\n        assert(howmanyqueries <= howmany);\n        std::cout << \"testing \" << setw(20) << string(Pack::NAME) << \" \";\n        std::cout.flush();\n        uint64_t sum = 0;\n        vector<HashMap<uint64_t, uint32_t, Pack>> collection;\n        uint64_t cycles_start, cycles_end;\n        for (int r = 0; r < repeat; ++r) {\n            HashMap<uint64_t, uint32_t, Pack> hm(16, EMPTY, loadfactor);\n            cycles_start = RDTSC_START();\n            populate(hm, keys);\n            cycles_end = RDTSC_FINAL();\n            collection.push_back(hm);\n        }\n        double max_avg_probes = 0;\n        for (int r = 0; r < repeat; ++r) {\n            HashMap<uint64_t, uint32_t, Pack> &hm = collection[r];\n            cycles_start = RDTSC_START();\n            sum += query(hm, keys, howmanyqueries);\n            cycles_end = RDTSC_FINAL();\n            querycycles += (cycles_end - cycles_start) * 1.0 \/ howmanyqueries;\n            double pk, pkerr;\n            query_avg_probed_keys(hm, keys, &pk, &pkerr);\n            max_avg_probes = std::max<double>(pk, max_avg_probes);\n            double mk = query_max_probed_keys(hm, keys);\n            probesperquery += pk;\n            probesperquerystderr += pkerr;\n            maxprobesperquery += mk;\n        }\n        std::cout << \"     \" << setw(10) << querycycles \/ repeat\n                  << \" avg cycles \";\n        std::cout << \"     \" << setw(10) << probesperquery \/ repeat\n                  << \" avg probes \";\n        std::cout << \"     \" << setw(10) << probesperquerystderr \/ repeat\n                  << \" avg std. error \";\n        std::cout << \"     \" << setw(10) << maxprobesperquery \/ repeat\n                  << \" avg max probes \";\n        std::cout << \"     \" << setw(10) << max_avg_probes\n                  << \" max avg probes \";\n        std::cout << \" ignore me: \" << sum;\n        std::cout << std::endl;\n    }\n    static inline void Stop() {}\n};\n\nvoid demorandom(const uint64_t howmany, const float loadfactor,\n                const float repeat, const size_t howmanyqueries) {\n    srand(0);\n    std::vector<uint64_t>  keys;\n    for(uint64_t i = 1; i <= howmany; ++i) {\n      uint64_t newkey = get64rand();\n      while(newkey == EMPTY) newkey = get64rand();\n      keys.push_back(newkey);\n    }\n    std::cout << \"populating a hash table with \" << howmany << \" random 64-bit keys and then retrieving them. \" << std::endl;\n    std::cout << \"load factor = \" << loadfactor << std::endl;\n    std::cout << \"number of consecutive queries on same hash table = \" << howmanyqueries << std::endl;\n\n    std::cout << \"We repeat with \" << repeat << \" different hash functions, using the same keys.\" << std::endl;\n\n    ForEachT<Cyclic64Pack, Zobrist64Pack, WZobrist64Pack, MultiplyShift64Pack, WZobrist64Pack, ClLinear64Pack, ClQuadratic64Pack, ClCubic64Pack, ClQuartic64Pack,\n             ThorupZhangCWCubic64Pack>::template Go<BasicWorker>(keys,\n                                                                 loadfactor,\n                                                                 repeat, howmanyqueries);\n\n    std::cout << std::endl;\n\n}\n\nvoid demofixed(const uint64_t howmany, const float loadfactor, const float repeat, const size_t howmanyqueries) {\n    srand(0);\n    std::vector<uint64_t>  keys;\n    for(uint64_t i = 1; i <= howmany; ++i) {\n        keys.push_back(i + UINT64_C(0xFFFFFFFFF));\n    }\n    std::random_device rd;\n    std::mt19937 g(rd());\n    std::shuffle(keys.begin(), keys.end(),g);\n\n    std::cout << \"populating a hash table with \" << howmany << \" sequential and shuffled 64-bit keys and then retrieving them. \" << std::endl;\n    std::cout << \"load factor = \" << loadfactor << std::endl;\n    std::cout << \"number of consecutive queries on same hash table = \" << howmanyqueries << std::endl;\n\n    std::cout << \"We repeat with \" << repeat << \" different hash functions, using the same keys.\" << std::endl;\n\n\n    ForEachT<Cyclic64Pack, Zobrist64Pack, WZobrist64Pack, MultiplyShift64Pack, ClLinear64Pack, ClQuadratic64Pack, ClCubic64Pack, ClQuartic64Pack,\n             ThorupZhangCWCubic64Pack>::template Go<BasicWorker>(keys,\n                                                                 loadfactor,\n                                                                 repeat,howmanyqueries);\n\n    std::cout << std::endl;\n\n}\n\n\nint main() {\n    const float loadfactor = 0.9;\n    const float repeat = 1000;\n    const size_t howmanyqueries = 10;\n\n    demofixed(1000, loadfactor, repeat, howmanyqueries);\n    demofixed(2000, loadfactor, repeat, howmanyqueries);\n    demofixed(64000, loadfactor, repeat, howmanyqueries);\n    demofixed(120000, loadfactor, repeat, howmanyqueries);\n\n    std::cout << \"=======\" << std::endl;\n\n    demorandom(1000, loadfactor, repeat, howmanyqueries);\n    demorandom(2000, loadfactor, repeat, howmanyqueries);\n    demorandom(64000, loadfactor, repeat, howmanyqueries);\n    demorandom(120000, loadfactor, repeat, howmanyqueries);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/============================================================================\n\/\/ vSMC\/include\/vsmc\/rng\/u01.hpp\n\/\/----------------------------------------------------------------------------\n\/\/                         vSMC: Scalable Monte Carlo\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2013-2015, 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 VSMC_RNG_U01_HPP\n#define VSMC_RNG_U01_HPP\n\n#include <vsmc\/rng\/internal\/common.hpp>\n#include <vsmc\/rng\/u01.h>\n\n#define VSMC_RUNTIME_ASSERT_RNG_U01_U01_SEQUENCE(Method) \\\n    VSMC_RUNTIME_ASSERT(                                                     \\\n            (n >= 0 && n < N_ && (n == n_ || n == n_ + 1 || n_ == N_)),      \\\n            (\"**U01Sequence\"#Method\"::operator[]** INVALID INDEX\"))\n\n#define VSMC_DEFINE_RNG_U01(FPType, Left, Right, left, right, UBits, FBits) \\\ntemplate <> struct U01<Left, Right, uint##UBits##_t, FPType>                 \\\n{                                                                            \\\n    FPType operator() (uint##UBits##_t u) const                              \\\n    {return ::u01_##left##_##right##_##UBits##_##FBits(u);}                  \\\n                                                                             \\\n    static FPType uint2fp (uint##UBits##_t u)                                \\\n    {return ::u01_##left##_##right##_##UBits##_##FBits(u);}                  \\\n};\n\nnamespace vsmc {\n\n\/\/\/ \\brief Parameter type for open interval\n\/\/\/ \\ingroup U01\nstruct Open {};\n\n\/\/\/ \\brief Parameter type for closed interval\n\/\/\/ \\ingroup U01\nstruct Closed {};\n\ntemplate <typename, typename, typename, typename> struct U01;\n\n\/\/\/ \\brief Converting 32-bits unsigned to single precision uniform \\f$[0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Closed, Closed, closed, closed, 32, 24)\n\n\/\/\/ \\brief Converting 32-bits unsigned to single precision uniform \\f$[0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Closed, Open, closed, open, 32, 24)\n\n\/\/\/ \\brief Converting 32-bits unsigned to single precision uniform \\f$(0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Open, Closed, open, closed, 32, 24)\n\n\/\/\/ \\brief Converting 32-bits unsigned to single precision uniform \\f$(0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Open, Open, open, open, 32, 24)\n\n\/\/\/ \\brief Converting 32-bits unsigned to double precision uniform \\f$[0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Closed, Closed, closed, closed, 32, 53)\n\n\/\/\/ \\brief Converting 32-bits unsigned to double precision uniform \\f$[0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Closed, Open, closed, open, 32, 53)\n\n\/\/\/ \\brief Converting 32-bits unsigned to double precision uniform \\f$(0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Open, Closed, open, closed, 32, 53)\n\n\/\/\/ \\brief Converting 32-bits unsigned to double precision uniform \\f$(0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Open, Open, open, open, 32, 53)\n\n\/\/\/ \\brief Converting 64-bits unsigned to single precision uniform \\f$[0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Closed, Closed, closed, closed, 64, 24)\n\n\/\/\/ \\brief Converting 64-bits unsigned to single precision uniform \\f$[0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Closed, Open, closed, open, 64, 24)\n\n\/\/\/ \\brief Converting 64-bits unsigned to single precision uniform \\f$(0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Open, Closed, open, closed, 64, 24)\n\n\/\/\/ \\brief Converting 64-bits unsigned to single precision uniform \\f$(0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Open, Open, open, open, 64, 24)\n\n\/\/\/ \\brief Converting 64-bits unsigned to double precision uniform \\f$[0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Closed, Closed, closed, closed, 64, 53)\n\n\/\/\/ \\brief Converting 64-bits unsigned to double precision uniform \\f$[0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Closed, Open, closed, open, 64, 53)\n\n\/\/\/ \\brief Converting 64-bits unsigned to double precision uniform \\f$(0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Open, Closed, open, closed, 64, 53)\n\n\/\/\/ \\brief Converting 64-bits unsigned to double precision uniform \\f$(0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Open, Open, open, open, 64, 53)\n\n\/\/\/ \\brief Generate a fixed length sequence of uniform \\f$[0,1)\\f$ random\n\/\/\/ variates by sorting.\n\/\/\/\n\/\/\/ \\details\n\/\/\/ This is primarily used in resampling algorithms within the library but can\n\/\/\/ be used for other purposes. It deals with the usage case similar to the\n\/\/\/ following,\n\/\/\/ ~~~{.cpp}\n\/\/\/ const std::size_t N = 1000;\n\/\/\/ std::mt19937 rng;\n\/\/\/ std::uniform_real_distribution<double> runif(0, 1);\n\/\/\/ std::vector<double> u01(N);\n\/\/\/ for (std::size_t i = 0; i != N; ++i)\n\/\/\/     u01[i] = runif(rng);\n\/\/\/ std::sort(u01.begin(), u01.end());\n\/\/\/ for (std::size_t i = 0; i != N; ++i)\n\/\/\/     do_something_with_u01(u01[i]);\n\/\/\/ ~~~\n\/\/\/ In the above example, one want N uniform random variates, and having them\n\/\/\/ sorted. The sorted sequence is accessed sequentially. There are two\n\/\/\/ undesired effects. First the program has a runtime cost \\f$O(N\\log N)\\f$.\n\/\/\/ Second, it has a memory cost \\f$O(N)\\f$. The presented class can be used in\n\/\/\/ place of the temporary vector in the following fashion.\n\/\/\/ ~~~{.cpp}\n\/\/\/ const std::size_t N = 1000;\n\/\/\/ std::mt19937 rng;\n\/\/\/ U01SequenceSorted<std::mt19937> u01(N, rng);\n\/\/\/ for (std::size_t i = 0; i != N; ++i)\n\/\/\/     do_something_with_u01(u01[i]);\n\/\/\/ ~~~\n\/\/\/ The above program will has a runtime cost \\f$O(N)\\f$ and a memory cost\n\/\/\/ \\f$O(1)\\f$. However, the overloaded `operator[]` has a few restrictions.\n\/\/\/ Most importantly, it is a forward one-pass operation. More specifically,\n\/\/\/ let `n` be the calling argument and `nlast` be the calling argument of the\n\/\/\/ last time it is called.\n\/\/\/ - `n` can only be either `0`, `nlast`, or `nlast + 1`\n\/\/\/ - `n` can be at most `N - 1`.\ntemplate <typename RngType>\nclass U01SequenceSorted\n{\n    public :\n\n    U01SequenceSorted (std::size_t N, RngType &rng) :\n        N_(N), n_(N), u_(0), lmax_(0), rng_(rng), runif_(0, 1) {}\n\n    \/\/\/ \\brief Generate the n-th random variates\n    \/\/\/ \n    double operator[] (std::size_t n)\n    {\n        using std::exp;\n        using std::log;\n\n        VSMC_RUNTIME_ASSERT_RNG_U01_U01_SEQUENCE(Sorted)\n\n        if (n == n_)\n            return u_;\n\n        lmax_ += log(1 - runif_(rng_)) \/ (N_ - n);\n        n_ = n;\n        u_ = 1 - exp(lmax_);\n\n        return u_;\n    }\n\n    double operator() (std::size_t n) {return operator[](n);}\n\n    private :\n\n    std::size_t N_;\n    std::size_t n_;\n    double u_;\n    double lmax_;\n    RngType &rng_;\n    cxx11::uniform_real_distribution<double> runif_;\n}; \/\/ U01SequenceSorted\n\n\/\/\/ \\brief Generate a fixed length sequence of uniform \\f$[0,1)\\f$ random\n\/\/\/ variates by stratified sampling.\n\/\/\/\n\/\/\/ \\details\n\/\/\/ This is similar to U01SequenceSorted except that, instead of generating the\n\/\/\/ sequence as if by sorting. It is done by generating\n\/\/\/ \\f$u_i = U_i \/ N + (i - 1) \/ N\\f$ where \\f$U_i\\f$ is uniform \\f$[0,1)\\f$\n\/\/\/ random variates.\ntemplate <typename RngType>\nclass U01SequenceStratified\n{\n    public :\n\n    U01SequenceStratified (std::size_t N, RngType &rng) :\n        N_(N), n_(N), u_(0), delta_(1.0 \/ N), rng_(rng), runif_(0, 1) {}\n\n    double operator[] (std::size_t n)\n    {\n        VSMC_RUNTIME_ASSERT_RNG_U01_U01_SEQUENCE(Stratified)\n\n        if (n == n_)\n            return u_;\n\n        n_ = n;\n        u_ = runif_(rng_) * delta_ + n * delta_;\n\n        return u_;\n    }\n\n    double operator() (std::size_t n) {return operator[](n);}\n\n    private :\n\n    std::size_t N_;\n    std::size_t n_;\n    double u_;\n    double delta_;\n    RngType &rng_;\n    cxx11::uniform_real_distribution<double> runif_;\n}; \/\/ class U01SequenceStratified\n\n\/\/\/ \\brief Generate a fixed length sequence of uniform \\f$[0,1)\\f$ random\n\/\/\/ variates by systematic sampling.\n\/\/\/\n\/\/\/ \\details\n\/\/\/ This is similar to U01SequenceSorted except that, instead of generating the\n\/\/\/ sequence as if by sorting. It is done by generating\n\/\/\/ \\f$u_i = U \/ N + (i - 1) \/ N\\f$ where \\f$U\\f$ is uniform \\f$[0,1)\\f$\n\/\/\/ random variates and it is generated only once for all \\f$i\\f$.\ntemplate <typename RngType>\nclass U01SequenceSystematic\n{\n    public :\n\n    U01SequenceSystematic (std::size_t N, RngType &rng) :\n        N_(N), n_(N), u_(0), u0_(0), delta_(1.0 \/ N)\n    {\n        cxx11::uniform_real_distribution<double> runif(0, 1);\n        u0_ = runif(rng) * delta_;\n    }\n\n    double operator[] (std::size_t n)\n    {\n        VSMC_RUNTIME_ASSERT_RNG_U01_U01_SEQUENCE(Systematic)\n\n        if (n == n_)\n            return u_;\n\n        n_ = n;\n        u_ = u0_ + n * delta_;\n\n        return u_;\n    }\n\n    double operator() (std::size_t n) {return operator[](n);}\n\n    private :\n\n    std::size_t N_;\n    std::size_t n_;\n    double u_;\n    double u0_;\n    double delta_;\n}; \/\/ class U01SequenceSystematic\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_RNG_U01_HPP\n<commit_msg>remove comparison of unsigned to zero<commit_after>\/\/============================================================================\n\/\/ vSMC\/include\/vsmc\/rng\/u01.hpp\n\/\/----------------------------------------------------------------------------\n\/\/                         vSMC: Scalable Monte Carlo\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2013-2015, 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 VSMC_RNG_U01_HPP\n#define VSMC_RNG_U01_HPP\n\n#include <vsmc\/rng\/internal\/common.hpp>\n#include <vsmc\/rng\/u01.h>\n\n#define VSMC_RUNTIME_ASSERT_RNG_U01_U01_SEQUENCE(Method) \\\n    VSMC_RUNTIME_ASSERT((n < N_ && (n == n_ || n == n_ + 1 || n_ == N_)),    \\\n            (\"**U01Sequence\"#Method\"::operator[]** INVALID INDEX\"))\n\n#define VSMC_DEFINE_RNG_U01(FPType, Left, Right, left, right, UBits, FBits) \\\ntemplate <> struct U01<Left, Right, uint##UBits##_t, FPType>                 \\\n{                                                                            \\\n    FPType operator() (uint##UBits##_t u) const                              \\\n    {return ::u01_##left##_##right##_##UBits##_##FBits(u);}                  \\\n                                                                             \\\n    static FPType uint2fp (uint##UBits##_t u)                                \\\n    {return ::u01_##left##_##right##_##UBits##_##FBits(u);}                  \\\n};\n\nnamespace vsmc {\n\n\/\/\/ \\brief Parameter type for open interval\n\/\/\/ \\ingroup U01\nstruct Open {};\n\n\/\/\/ \\brief Parameter type for closed interval\n\/\/\/ \\ingroup U01\nstruct Closed {};\n\ntemplate <typename, typename, typename, typename> struct U01;\n\n\/\/\/ \\brief Converting 32-bits unsigned to single precision uniform \\f$[0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Closed, Closed, closed, closed, 32, 24)\n\n\/\/\/ \\brief Converting 32-bits unsigned to single precision uniform \\f$[0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Closed, Open, closed, open, 32, 24)\n\n\/\/\/ \\brief Converting 32-bits unsigned to single precision uniform \\f$(0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Open, Closed, open, closed, 32, 24)\n\n\/\/\/ \\brief Converting 32-bits unsigned to single precision uniform \\f$(0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Open, Open, open, open, 32, 24)\n\n\/\/\/ \\brief Converting 32-bits unsigned to double precision uniform \\f$[0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Closed, Closed, closed, closed, 32, 53)\n\n\/\/\/ \\brief Converting 32-bits unsigned to double precision uniform \\f$[0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Closed, Open, closed, open, 32, 53)\n\n\/\/\/ \\brief Converting 32-bits unsigned to double precision uniform \\f$(0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Open, Closed, open, closed, 32, 53)\n\n\/\/\/ \\brief Converting 32-bits unsigned to double precision uniform \\f$(0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Open, Open, open, open, 32, 53)\n\n\/\/\/ \\brief Converting 64-bits unsigned to single precision uniform \\f$[0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Closed, Closed, closed, closed, 64, 24)\n\n\/\/\/ \\brief Converting 64-bits unsigned to single precision uniform \\f$[0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Closed, Open, closed, open, 64, 24)\n\n\/\/\/ \\brief Converting 64-bits unsigned to single precision uniform \\f$(0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Open, Closed, open, closed, 64, 24)\n\n\/\/\/ \\brief Converting 64-bits unsigned to single precision uniform \\f$(0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(float, Open, Open, open, open, 64, 24)\n\n\/\/\/ \\brief Converting 64-bits unsigned to double precision uniform \\f$[0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Closed, Closed, closed, closed, 64, 53)\n\n\/\/\/ \\brief Converting 64-bits unsigned to double precision uniform \\f$[0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Closed, Open, closed, open, 64, 53)\n\n\/\/\/ \\brief Converting 64-bits unsigned to double precision uniform \\f$(0,1]\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Open, Closed, open, closed, 64, 53)\n\n\/\/\/ \\brief Converting 64-bits unsigned to double precision uniform \\f$(0,1)\\f$\n\/\/\/ \\ingroup U01\nVSMC_DEFINE_RNG_U01(double, Open, Open, open, open, 64, 53)\n\n\/\/\/ \\brief Generate a fixed length sequence of uniform \\f$[0,1)\\f$ random\n\/\/\/ variates by sorting.\n\/\/\/\n\/\/\/ \\details\n\/\/\/ This is primarily used in resampling algorithms within the library but can\n\/\/\/ be used for other purposes. It deals with the usage case similar to the\n\/\/\/ following,\n\/\/\/ ~~~{.cpp}\n\/\/\/ const std::size_t N = 1000;\n\/\/\/ std::mt19937 rng;\n\/\/\/ std::uniform_real_distribution<double> runif(0, 1);\n\/\/\/ std::vector<double> u01(N);\n\/\/\/ for (std::size_t i = 0; i != N; ++i)\n\/\/\/     u01[i] = runif(rng);\n\/\/\/ std::sort(u01.begin(), u01.end());\n\/\/\/ for (std::size_t i = 0; i != N; ++i)\n\/\/\/     do_something_with_u01(u01[i]);\n\/\/\/ ~~~\n\/\/\/ In the above example, one want N uniform random variates, and having them\n\/\/\/ sorted. The sorted sequence is accessed sequentially. There are two\n\/\/\/ undesired effects. First the program has a runtime cost \\f$O(N\\log N)\\f$.\n\/\/\/ Second, it has a memory cost \\f$O(N)\\f$. The presented class can be used in\n\/\/\/ place of the temporary vector in the following fashion.\n\/\/\/ ~~~{.cpp}\n\/\/\/ const std::size_t N = 1000;\n\/\/\/ std::mt19937 rng;\n\/\/\/ U01SequenceSorted<std::mt19937> u01(N, rng);\n\/\/\/ for (std::size_t i = 0; i != N; ++i)\n\/\/\/     do_something_with_u01(u01[i]);\n\/\/\/ ~~~\n\/\/\/ The above program will has a runtime cost \\f$O(N)\\f$ and a memory cost\n\/\/\/ \\f$O(1)\\f$. However, the overloaded `operator[]` has a few restrictions.\n\/\/\/ Most importantly, it is a forward one-pass operation. More specifically,\n\/\/\/ let `n` be the calling argument and `nlast` be the calling argument of the\n\/\/\/ last time it is called.\n\/\/\/ - `n` can only be either `0`, `nlast`, or `nlast + 1`\n\/\/\/ - `n` can be at most `N - 1`.\ntemplate <typename RngType>\nclass U01SequenceSorted\n{\n    public :\n\n    U01SequenceSorted (std::size_t N, RngType &rng) :\n        N_(N), n_(N), u_(0), lmax_(0), rng_(rng), runif_(0, 1) {}\n\n    \/\/\/ \\brief Generate the n-th random variates\n    \/\/\/ \n    double operator[] (std::size_t n)\n    {\n        using std::exp;\n        using std::log;\n\n        VSMC_RUNTIME_ASSERT_RNG_U01_U01_SEQUENCE(Sorted)\n\n        if (n == n_)\n            return u_;\n\n        lmax_ += log(1 - runif_(rng_)) \/ (N_ - n);\n        n_ = n;\n        u_ = 1 - exp(lmax_);\n\n        return u_;\n    }\n\n    double operator() (std::size_t n) {return operator[](n);}\n\n    private :\n\n    std::size_t N_;\n    std::size_t n_;\n    double u_;\n    double lmax_;\n    RngType &rng_;\n    cxx11::uniform_real_distribution<double> runif_;\n}; \/\/ U01SequenceSorted\n\n\/\/\/ \\brief Generate a fixed length sequence of uniform \\f$[0,1)\\f$ random\n\/\/\/ variates by stratified sampling.\n\/\/\/\n\/\/\/ \\details\n\/\/\/ This is similar to U01SequenceSorted except that, instead of generating the\n\/\/\/ sequence as if by sorting. It is done by generating\n\/\/\/ \\f$u_i = U_i \/ N + (i - 1) \/ N\\f$ where \\f$U_i\\f$ is uniform \\f$[0,1)\\f$\n\/\/\/ random variates.\ntemplate <typename RngType>\nclass U01SequenceStratified\n{\n    public :\n\n    U01SequenceStratified (std::size_t N, RngType &rng) :\n        N_(N), n_(N), u_(0), delta_(1.0 \/ N), rng_(rng), runif_(0, 1) {}\n\n    double operator[] (std::size_t n)\n    {\n        VSMC_RUNTIME_ASSERT_RNG_U01_U01_SEQUENCE(Stratified)\n\n        if (n == n_)\n            return u_;\n\n        n_ = n;\n        u_ = runif_(rng_) * delta_ + n * delta_;\n\n        return u_;\n    }\n\n    double operator() (std::size_t n) {return operator[](n);}\n\n    private :\n\n    std::size_t N_;\n    std::size_t n_;\n    double u_;\n    double delta_;\n    RngType &rng_;\n    cxx11::uniform_real_distribution<double> runif_;\n}; \/\/ class U01SequenceStratified\n\n\/\/\/ \\brief Generate a fixed length sequence of uniform \\f$[0,1)\\f$ random\n\/\/\/ variates by systematic sampling.\n\/\/\/\n\/\/\/ \\details\n\/\/\/ This is similar to U01SequenceSorted except that, instead of generating the\n\/\/\/ sequence as if by sorting. It is done by generating\n\/\/\/ \\f$u_i = U \/ N + (i - 1) \/ N\\f$ where \\f$U\\f$ is uniform \\f$[0,1)\\f$\n\/\/\/ random variates and it is generated only once for all \\f$i\\f$.\ntemplate <typename RngType>\nclass U01SequenceSystematic\n{\n    public :\n\n    U01SequenceSystematic (std::size_t N, RngType &rng) :\n        N_(N), n_(N), u_(0), u0_(0), delta_(1.0 \/ N)\n    {\n        cxx11::uniform_real_distribution<double> runif(0, 1);\n        u0_ = runif(rng) * delta_;\n    }\n\n    double operator[] (std::size_t n)\n    {\n        VSMC_RUNTIME_ASSERT_RNG_U01_U01_SEQUENCE(Systematic)\n\n        if (n == n_)\n            return u_;\n\n        n_ = n;\n        u_ = u0_ + n * delta_;\n\n        return u_;\n    }\n\n    double operator() (std::size_t n) {return operator[](n);}\n\n    private :\n\n    std::size_t N_;\n    std::size_t n_;\n    double u_;\n    double u0_;\n    double delta_;\n}; \/\/ class U01SequenceSystematic\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_RNG_U01_HPP\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"cell_id.hpp\"\n\n#include \"..\/std\/queue.hpp\"\n#include \"..\/std\/vector.hpp\"\n\n\/\/ TODO: Move neccessary functions to geometry\/covering_utils.hpp and delete this file.\n\ntemplate <typename BoundsT, typename CellIdT>\ninline void SplitRectCell(CellIdT id,\n                          CoordT minX, CoordT minY,\n                          CoordT maxX, CoordT maxY,\n                          vector<CellIdT> & result)\n{\n  for (size_t i = 0; i < 4; ++i)\n  {\n    CellIdT child = id.Child(i);\n    CoordT minCellX, minCellY, maxCellX, maxCellY;\n    CellIdConverter<BoundsT, CellIdT>::GetCellBounds(child, minCellX, minCellY, maxCellX, maxCellY);\n    if (!((maxX < minCellX) || (minX > maxCellX) || (maxY < minCellY) || (minY > maxCellY)))\n      result.push_back(child);\n  }\n}\n\ntemplate <typename BoundsT, typename CellIdT>\ninline void CoverRect(CoordT minX, CoordT minY,\n                      CoordT maxX, CoordT maxY,\n                      size_t cells_count, int maxDepth,\n                      vector<CellIdT> & cells)\n{\n  ASSERT_LESS(minX, maxX, ());\n  ASSERT_LESS(minY, maxY, ());\n\n  if (minX < BoundsT::minX) minX = BoundsT::minX;\n  if (minY < BoundsT::minY) minY = BoundsT::minY;\n  if (maxX > BoundsT::maxX) maxX = BoundsT::maxX;\n  if (maxY > BoundsT::maxY) maxY = BoundsT::maxY;\n\n  if (minX >= maxX || minY >= maxY)\n    return;\n\n  CellIdT commonCell =\n      CellIdConverter<BoundsT, CellIdT>::Cover2PointsWithCell(minX, minY, maxX, maxY);\n\n  vector<CellIdT> result;\n\n  queue<CellIdT> cellQueue;\n  cellQueue.push(commonCell);\n\n  while (!cellQueue.empty() && cellQueue.size() + result.size() < cells_count)\n  {\n    CellIdT id = cellQueue.front();\n    cellQueue.pop();\n\n    if (id.Level() == maxDepth - 1)\n    {\n      result.push_back(id);\n      break;\n    }\n\n    vector<CellIdT> children;\n    SplitRectCell<BoundsT>(id, minX, minY, maxX, maxY, children);\n\n    \/\/ Children shouldn't be empty, but if it is, ignore this cellid in release.\n    ASSERT(!children.empty(), (id, minX, minY, maxX, maxY));\n    if (children.empty())\n    {\n      result.push_back(id);\n      continue;\n    }\n\n    if (cellQueue.size() + result.size() + children.size() <= cells_count)\n    {\n      for (size_t i = 0; i < children.size(); ++i)\n        cellQueue.push(children[i]);\n    }\n    else\n      result.push_back(id);\n  }\n\n  for (; !cellQueue.empty(); cellQueue.pop())\n    result.push_back(cellQueue.front());\n\n  for (size_t i = 0; i < result.size(); ++i)\n  {\n    CellIdT id = result[i];\n    while (id.Level() < maxDepth - 1)\n    {\n      vector<CellIdT> children;\n      SplitRectCell<BoundsT>(id, minX, minY, maxX, maxY, children);\n      if (children.size() == 1)\n        id = children[0];\n      else\n        break;\n    }\n    result[i] = id;\n  }\n\n  ASSERT_LESS_OR_EQUAL(result.size(), cells_count, (minX, minY, maxX, maxY));\n  cells.insert(cells.end(), result.begin(), result.end());\n}\n<commit_msg>Fix max rect covering depth.<commit_after>#pragma once\n\n#include \"cell_id.hpp\"\n\n#include \"..\/std\/queue.hpp\"\n#include \"..\/std\/vector.hpp\"\n\n\/\/ TODO: Move neccessary functions to geometry\/covering_utils.hpp and delete this file.\n\ntemplate <typename BoundsT, typename CellIdT>\ninline void SplitRectCell(CellIdT id,\n                          CoordT minX, CoordT minY,\n                          CoordT maxX, CoordT maxY,\n                          vector<CellIdT> & result)\n{\n  for (size_t i = 0; i < 4; ++i)\n  {\n    CellIdT child = id.Child(i);\n    CoordT minCellX, minCellY, maxCellX, maxCellY;\n    CellIdConverter<BoundsT, CellIdT>::GetCellBounds(child, minCellX, minCellY, maxCellX, maxCellY);\n    if (!((maxX < minCellX) || (minX > maxCellX) || (maxY < minCellY) || (minY > maxCellY)))\n      result.push_back(child);\n  }\n}\n\ntemplate <typename BoundsT, typename CellIdT>\ninline void CoverRect(CoordT minX, CoordT minY,\n                      CoordT maxX, CoordT maxY,\n                      size_t cells_count, int maxDepth,\n                      vector<CellIdT> & cells)\n{\n  ASSERT_LESS(minX, maxX, ());\n  ASSERT_LESS(minY, maxY, ());\n\n  if (minX < BoundsT::minX) minX = BoundsT::minX;\n  if (minY < BoundsT::minY) minY = BoundsT::minY;\n  if (maxX > BoundsT::maxX) maxX = BoundsT::maxX;\n  if (maxY > BoundsT::maxY) maxY = BoundsT::maxY;\n\n  if (minX >= maxX || minY >= maxY)\n    return;\n\n  CellIdT commonCell =\n      CellIdConverter<BoundsT, CellIdT>::Cover2PointsWithCell(minX, minY, maxX, maxY);\n\n  vector<CellIdT> result;\n\n  queue<CellIdT> cellQueue;\n  cellQueue.push(commonCell);\n\n  maxDepth -= 1;\n\n  while (!cellQueue.empty() && cellQueue.size() + result.size() < cells_count)\n  {\n    CellIdT id = cellQueue.front();\n    cellQueue.pop();\n\n    while (id.Level() > maxDepth)\n      id = id.Parent();\n\n    if (id.Level() == maxDepth)\n    {\n      result.push_back(id);\n      break;\n    }\n\n    vector<CellIdT> children;\n    SplitRectCell<BoundsT>(id, minX, minY, maxX, maxY, children);\n\n    \/\/ Children shouldn't be empty, but if it is, ignore this cellid in release.\n    ASSERT(!children.empty(), (id, minX, minY, maxX, maxY));\n    if (children.empty())\n    {\n      result.push_back(id);\n      continue;\n    }\n\n    if (cellQueue.size() + result.size() + children.size() <= cells_count)\n    {\n      for (size_t i = 0; i < children.size(); ++i)\n        cellQueue.push(children[i]);\n    }\n    else\n      result.push_back(id);\n  }\n\n  for (; !cellQueue.empty(); cellQueue.pop())\n    result.push_back(cellQueue.front());\n\n  for (size_t i = 0; i < result.size(); ++i)\n  {\n    CellIdT id = result[i];\n    while (id.Level() < maxDepth)\n    {\n      vector<CellIdT> children;\n      SplitRectCell<BoundsT>(id, minX, minY, maxX, maxY, children);\n      if (children.size() == 1)\n        id = children[0];\n      else\n        break;\n    }\n    result[i] = id;\n  }\n\n  ASSERT_LESS_OR_EQUAL(result.size(), cells_count, (minX, minY, maxX, maxY));\n  cells.insert(cells.end(), result.begin(), result.end());\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#include <higanbana\/graphics\/GraphicsCore.hpp>\n#include <higanbana\/core\/filesystem\/filesystem.hpp>\n#include <higanbana\/core\/platform\/Window.hpp>\n#include <higanbana\/core\/datastructures\/proxy.hpp>\n#include <higanbana\/core\/system\/time.hpp>\n#include <higanbana\/graphics\/helpers\/pingpongTexture.hpp>\n#include <higanbana\/core\/system\/FreelistAllocator.hpp>\n#include <higanbana\/core\/system\/LBS.hpp>\n#include \"renderer\/imgui.hpp\"\n#include \"renderer\/world_renderer.hpp\"\n#include \"renderer\/mesh_test.hpp\"\n#include \"renderer\/tsaa.hpp\"\n#include \"renderer\/tonemapper.hpp\"\n#include \"renderer\/blitter.hpp\"\n#include \"renderer\/cubes.hpp\"\n#include \"renderer\/meshes.hpp\"\n#include \"renderer\/textures.hpp\"\n#include \"renderer\/materials.hpp\"\n#include \"renderer\/generate_image.hpp\"\n#include \"renderer\/particles.hpp\"\n#include \"renderer\/viewport.hpp\"\n#include \"world\/visual_data_structures.hpp\"\n\n\nnamespace app\n{\nstruct RendererOptions\n{\n  bool submitExperimental = false;\n  bool submitSingleThread = false;\n  bool submitLBS = false;\n  bool particles = false;\n  bool particlesSimulate = true;\n  bool allowMeshShaders = false;\n  bool allowRaytracing = false;\n  bool unbalancedCubes = false;\n  bool renderImGui = true;\n  void drawImGuiOptions()\n  {\n    ImGui::Checkbox(\"Submit with experimental mt\", &submitExperimental);\n    ImGui::Checkbox(\"Submit Singlethread\", &submitSingleThread);\n    ImGui::Checkbox(\"Submit using LBS\", &submitLBS);\n    ImGui::Checkbox(\"Particles\", &particles);\n    ImGui::Checkbox(\"Simulate\", &particlesSimulate);\n    ImGui::Checkbox(\"Allow Mesh Shaders\", &allowMeshShaders);\n    ImGui::Checkbox(\"Allow Raytracing\", &allowRaytracing);\n    ImGui::Checkbox(\"Unbalanced cube drawlists\", &unbalancedCubes);\n  }\n};\nstruct ViewportOptions\n{\n  bool visible = false;\n  int gpuToUse = 0;\n  bool useMeshShaders = false;\n  bool useRaytracing = false;\n  bool syncResolutionToSwapchain = false;\n  bool jitterEnabled = true;\n  bool particlesDraw = true;\n  bool tsaa = true;\n  bool tsaaDebug = false;\n  bool debugTextures = false;\n  float resolutionScale = 1.f;\n  bool writeStraightToBackbuffer = false;\n\n  void drawImGuiOptions(higanbana::vector<higanbana::GpuInfo>& gpus)\n  {\n    if (gpus.size() > 1)\n      ImGui::SliderInt(\"GPU Device index: \", &gpuToUse, 0, static_cast<int>(gpus.size())-1);\n    ImGui::Checkbox(\"sync resolution to viewport size\", &syncResolutionToSwapchain);\n    if (!syncResolutionToSwapchain)\n    {\n      ImGui::DragFloat(\"resolution scale\", &resolutionScale, 0.01f, 0.0001f, 4.f);\n    }\n    else\n    {\n      resolutionScale = 1.f;\n    }\n    ImGui::Checkbox(\"debug textures\", &debugTextures);\n    ImGui::Checkbox(\"jitter viewport\", &jitterEnabled);\n    ImGui::Checkbox(\"TSAA\", &tsaa);\n    if (tsaa)\n    {\n      ImGui::Checkbox(\"  enable taa debugoutput\", &tsaaDebug);\n    }\n    ImGui::Checkbox(\"Draw particles\", &particlesDraw);\n    ImGui::Checkbox(\"Mesh Shaders\", &useMeshShaders);\n    ImGui::Checkbox(\"Raytracing\", &useRaytracing);\n  }\n};\n\nstruct RenderViewportInfo {\n  int viewportIndex; \/\/ gained when allocating a viewport from renderer\n  int2 viewportSize;\n  ViewportOptions options;\n  ActiveCamera camera;\n};\n\nclass Renderer\n{\n  higanbana::GraphicsSubsystem& graphics;\n  higanbana::GpuGroup& dev;\n  higanbana::GraphicsSurface surface;\n\n  higanbana::SwapchainDescriptor scdesc;\n  higanbana::Swapchain swapchain;\n\n  \/\/ api logos\n  higanbana::Texture m_logoDx12;\n  higanbana::TextureSRV m_logoDx12Srv;\n  higanbana::Texture m_logoVulkan;\n  higanbana::TextureSRV m_logoVulkanSrv;\n\n  \/\/ global layouts\n  higanbana::ShaderArgumentsLayout m_camerasLayout;\n  higanbana::Buffer cameras;\n  higanbana::BufferSRV cameraSRV;\n  higanbana::BufferUAV cameraUAV;\n  higanbana::ShaderArguments cameraArgs;\n\n  \/\/ meshes\n  MeshSystem meshes;\n\n  \/\/ materials\n  TextureDB textures;\n  MaterialDB materials;\n\n  \/\/ renderers\n  renderer::Cubes cubes;\n  renderer::IMGui imgui;\n  renderer::World worldRend;\n  renderer::MeshTest worldMeshRend;\n  \/\/ postprocess\n  renderer::ShittyTSAA tsaa;\n  renderer::Tonemapper tonemapper;\n  renderer::Blitter blitter;\n  renderer::GenerateImage genImage;\n  renderer::Particles particleSimulation;\n\n  \/\/ resources\n  higanbana::vector<app::Viewport> viewports;\n  higanbana::PingPongTexture proxyTex; \/\/ used for background color\n\n  \/\/ could probably be replaced with blitter...\n  higanbana::ShaderArgumentsLayout blitLayout;\n  higanbana::GraphicsPipeline composite;\n  higanbana::Renderpass compositeRP;\n\n  \/\/ temp, probably shouldnt be here\n  \/\/CameraSettings m_previousCamera;\n\n  \/\/ info\n  std::optional<higanbana::SubmitTiming> m_previousInfo;\n  int64_t m_acquireTimeTaken;\n  void renderMeshes(higanbana::CommandGraphNode& node, higanbana::TextureRTV& backbuffer, higanbana::TextureRTV& motionVecs, higanbana::TextureDSV& depth, higanbana::ShaderArguments materials, int cameraIndex, int prevCamera, higanbana::vector<InstanceDraw>& instances);\n  void renderMeshesWithMeshShaders(higanbana::CommandGraphNode& node, higanbana::TextureRTV& backbuffer, higanbana::TextureDSV& depth, higanbana::ShaderArguments materials, int cameraIndex, higanbana::vector<InstanceDraw>& instances);\n\n  struct SceneArguments {\n    higanbana::TextureRTV gbufferRTV;\n    higanbana::TextureDSV depth;\n    higanbana::TextureRTV motionVectors;\n    higanbana::ShaderArguments materials;\n    ViewportOptions options;\n    int cameraIdx;\n    int prevCameraIdx;\n    float4x4 perspective;\n    float3 cameraPos;\n    int drawcalls;\n    int drawsSplitInto;\n  };\n  void renderScene(higanbana::CommandNodeVector& tasks, higanbana::WTime& time, const RendererOptions& rendererOptions, const SceneArguments& args, higanbana::vector<InstanceDraw>& instances);\npublic:\n  Renderer(higanbana::GraphicsSubsystem& graphics, higanbana::GpuGroup& dev);\n  void initWindow(higanbana::Window& window, higanbana::GpuInfo info);\n  void loadLogos(higanbana::FileSystem& fs);\n  int2 windowSize();\n  void ensureViewportCount(int size);\n  void resizeExternal(higanbana::ResourceDescriptor& desc);\n  \/\/void render(higanbana::LBS& lbs, higanbana::WTime& time, RendererOptions options, ActiveCamera viewMat, higanbana::vector<InstanceDraw>& instances, int cubeCount, int cubeCommandLists, std::optional<higanbana::CpuImage>& heightmap);\n  void renderViewports(higanbana::LBS& lbs, higanbana::WTime& time, const RendererOptions& options, higanbana::MemView<RenderViewportInfo> viewportsToRender, higanbana::vector<InstanceDraw>& instances, int cubeCount, int cubeCommandLists);\n  std::optional<higanbana::SubmitTiming> timings();\n  float acquireTimeTakenMs() {return float(m_acquireTimeTaken) \/ 1000000.f;}\n  int loadMesh(MeshData& data, int buffer[5]);\n  void unloadMesh(int index);\n  int loadBuffer(BufferData& data);\n  void unloadBuffer(int index);\n  int loadTexture(TextureData& data);\n  void unloadTexture(int index);\n  int loadMaterial(MaterialData& data);\n  void unloadMaterial(int index);\n};\n}<commit_msg>Implemented fun api toggle when we detect interopt with only 1 device.<commit_after>#pragma once\n#include <higanbana\/graphics\/GraphicsCore.hpp>\n#include <higanbana\/core\/filesystem\/filesystem.hpp>\n#include <higanbana\/core\/platform\/Window.hpp>\n#include <higanbana\/core\/datastructures\/proxy.hpp>\n#include <higanbana\/core\/system\/time.hpp>\n#include <higanbana\/graphics\/helpers\/pingpongTexture.hpp>\n#include <higanbana\/core\/system\/FreelistAllocator.hpp>\n#include <higanbana\/core\/system\/LBS.hpp>\n#include \"renderer\/imgui.hpp\"\n#include \"renderer\/world_renderer.hpp\"\n#include \"renderer\/mesh_test.hpp\"\n#include \"renderer\/tsaa.hpp\"\n#include \"renderer\/tonemapper.hpp\"\n#include \"renderer\/blitter.hpp\"\n#include \"renderer\/cubes.hpp\"\n#include \"renderer\/meshes.hpp\"\n#include \"renderer\/textures.hpp\"\n#include \"renderer\/materials.hpp\"\n#include \"renderer\/generate_image.hpp\"\n#include \"renderer\/particles.hpp\"\n#include \"renderer\/viewport.hpp\"\n#include \"world\/visual_data_structures.hpp\"\n\n\nnamespace app\n{\nstruct RendererOptions\n{\n  bool submitExperimental = false;\n  bool submitSingleThread = false;\n  bool submitLBS = false;\n  bool particles = false;\n  bool particlesSimulate = true;\n  bool allowMeshShaders = false;\n  bool allowRaytracing = false;\n  bool unbalancedCubes = false;\n  bool renderImGui = true;\n  void drawImGuiOptions()\n  {\n    ImGui::Checkbox(\"Submit with experimental mt\", &submitExperimental);\n    ImGui::Checkbox(\"Submit Singlethread\", &submitSingleThread);\n    ImGui::Checkbox(\"Submit using LBS\", &submitLBS);\n    ImGui::Checkbox(\"Particles\", &particles);\n    ImGui::Checkbox(\"Simulate\", &particlesSimulate);\n    ImGui::Checkbox(\"Allow Mesh Shaders\", &allowMeshShaders);\n    ImGui::Checkbox(\"Allow Raytracing\", &allowRaytracing);\n    ImGui::Checkbox(\"Unbalanced cube drawlists\", &unbalancedCubes);\n  }\n};\nstruct ViewportOptions\n{\n  bool visible = false;\n  int gpuToUse = 0;\n  bool useMeshShaders = false;\n  bool useRaytracing = false;\n  bool syncResolutionToSwapchain = false;\n  bool jitterEnabled = true;\n  bool particlesDraw = true;\n  bool tsaa = true;\n  bool tsaaDebug = false;\n  bool debugTextures = false;\n  float resolutionScale = 1.f;\n  bool writeStraightToBackbuffer = false;\n\n  void ToggleButton(const char* hidden_id, bool* v)\n  {\n    ImVec2 p = ImGui::GetCursorScreenPos();\n    ImDrawList* draw_list = ImGui::GetWindowDrawList();\n\n    float height = ImGui::GetFrameHeight();\n    float width = height * 1.55f;\n    float radius = height * 0.50f;\n\n    ImU32 falseColor = IM_COL32(210, 50, 50, 255);\n    ImU32 trueColor = IM_COL32(50, 210, 50, 255);\n    ImU32 falseHovColor = IM_COL32(210, 50+20, 50+20, 255);\n    ImU32 trueHovColor = IM_COL32(50+20, 210, 50+20, 255);\n\n    if (ImGui::InvisibleButton(hidden_id, ImVec2(width, height)))\n        *v = !*v;\n    ImU32 col_bg;\n    if (ImGui::IsItemHovered())\n        col_bg = *v ? trueHovColor : falseHovColor;\n    else\n        col_bg = *v ? trueColor : falseColor;\n\n    draw_list->AddRectFilled(p, ImVec2(p.x + width, p.y + height), col_bg, height * 0.5f);\n    draw_list->AddCircleFilled(ImVec2(*v ? (p.x + width - radius) : (p.x + radius), p.y + radius), radius - 1.5f, IM_COL32(255, 255, 255, 255));\n  }\n\n  void drawImGuiOptions(higanbana::vector<higanbana::GpuInfo>& gpus)\n  {\n    bool isInteropDevice = false;\n    if (gpus.size() == 2 && gpus[0].api != gpus[1].api)\n      isInteropDevice = true;\n\n    if (isInteropDevice) {\n      bool current = gpus[gpuToUse].api == higanbana::GraphicsApi::DX12;\n      bool before = current;\n      ImGui::Text(\"Vulkan\"); ImGui::SameLine();\n      ToggleButton(\"##toggle\", &current); ImGui::SameLine();\n      ImGui::Text(\"DX12\");\n      if (current != before) {\n        gpuToUse = gpuToUse == 1 ? 0 : 1;\n      }\n    } else if (gpus.size() > 1)\n      ImGui::SliderInt(\"GPU Device index: \", &gpuToUse, 0, static_cast<int>(gpus.size())-1);\n    ImGui::Checkbox(\"sync resolution to viewport size\", &syncResolutionToSwapchain);\n    if (!syncResolutionToSwapchain)\n    {\n      ImGui::DragFloat(\"resolution scale\", &resolutionScale, 0.01f, 0.0001f, 4.f);\n    }\n    else\n    {\n      resolutionScale = 1.f;\n    }\n    ImGui::Checkbox(\"debug textures\", &debugTextures);\n    ImGui::Checkbox(\"jitter viewport\", &jitterEnabled);\n    ImGui::Checkbox(\"TSAA\", &tsaa);\n    if (tsaa)\n    {\n      ImGui::Checkbox(\"  enable taa debugoutput\", &tsaaDebug);\n    }\n    ImGui::Checkbox(\"Draw particles\", &particlesDraw);\n    ImGui::Checkbox(\"Mesh Shaders\", &useMeshShaders);\n    ImGui::Checkbox(\"Raytracing\", &useRaytracing);\n  }\n};\n\nstruct RenderViewportInfo {\n  int viewportIndex; \/\/ gained when allocating a viewport from renderer\n  int2 viewportSize;\n  ViewportOptions options;\n  ActiveCamera camera;\n};\n\nclass Renderer\n{\n  higanbana::GraphicsSubsystem& graphics;\n  higanbana::GpuGroup& dev;\n  higanbana::GraphicsSurface surface;\n\n  higanbana::SwapchainDescriptor scdesc;\n  higanbana::Swapchain swapchain;\n\n  \/\/ api logos\n  higanbana::Texture m_logoDx12;\n  higanbana::TextureSRV m_logoDx12Srv;\n  higanbana::Texture m_logoVulkan;\n  higanbana::TextureSRV m_logoVulkanSrv;\n\n  \/\/ global layouts\n  higanbana::ShaderArgumentsLayout m_camerasLayout;\n  higanbana::Buffer cameras;\n  higanbana::BufferSRV cameraSRV;\n  higanbana::BufferUAV cameraUAV;\n  higanbana::ShaderArguments cameraArgs;\n\n  \/\/ meshes\n  MeshSystem meshes;\n\n  \/\/ materials\n  TextureDB textures;\n  MaterialDB materials;\n\n  \/\/ renderers\n  renderer::Cubes cubes;\n  renderer::IMGui imgui;\n  renderer::World worldRend;\n  renderer::MeshTest worldMeshRend;\n  \/\/ postprocess\n  renderer::ShittyTSAA tsaa;\n  renderer::Tonemapper tonemapper;\n  renderer::Blitter blitter;\n  renderer::GenerateImage genImage;\n  renderer::Particles particleSimulation;\n\n  \/\/ resources\n  higanbana::vector<app::Viewport> viewports;\n  higanbana::PingPongTexture proxyTex; \/\/ used for background color\n\n  \/\/ could probably be replaced with blitter...\n  higanbana::ShaderArgumentsLayout blitLayout;\n  higanbana::GraphicsPipeline composite;\n  higanbana::Renderpass compositeRP;\n\n  \/\/ temp, probably shouldnt be here\n  \/\/CameraSettings m_previousCamera;\n\n  \/\/ info\n  std::optional<higanbana::SubmitTiming> m_previousInfo;\n  int64_t m_acquireTimeTaken;\n  void renderMeshes(higanbana::CommandGraphNode& node, higanbana::TextureRTV& backbuffer, higanbana::TextureRTV& motionVecs, higanbana::TextureDSV& depth, higanbana::ShaderArguments materials, int cameraIndex, int prevCamera, higanbana::vector<InstanceDraw>& instances);\n  void renderMeshesWithMeshShaders(higanbana::CommandGraphNode& node, higanbana::TextureRTV& backbuffer, higanbana::TextureDSV& depth, higanbana::ShaderArguments materials, int cameraIndex, higanbana::vector<InstanceDraw>& instances);\n\n  struct SceneArguments {\n    higanbana::TextureRTV gbufferRTV;\n    higanbana::TextureDSV depth;\n    higanbana::TextureRTV motionVectors;\n    higanbana::ShaderArguments materials;\n    ViewportOptions options;\n    int cameraIdx;\n    int prevCameraIdx;\n    float4x4 perspective;\n    float3 cameraPos;\n    int drawcalls;\n    int drawsSplitInto;\n  };\n  void renderScene(higanbana::CommandNodeVector& tasks, higanbana::WTime& time, const RendererOptions& rendererOptions, const SceneArguments& args, higanbana::vector<InstanceDraw>& instances);\npublic:\n  Renderer(higanbana::GraphicsSubsystem& graphics, higanbana::GpuGroup& dev);\n  void initWindow(higanbana::Window& window, higanbana::GpuInfo info);\n  void loadLogos(higanbana::FileSystem& fs);\n  int2 windowSize();\n  void ensureViewportCount(int size);\n  void resizeExternal(higanbana::ResourceDescriptor& desc);\n  \/\/void render(higanbana::LBS& lbs, higanbana::WTime& time, RendererOptions options, ActiveCamera viewMat, higanbana::vector<InstanceDraw>& instances, int cubeCount, int cubeCommandLists, std::optional<higanbana::CpuImage>& heightmap);\n  void renderViewports(higanbana::LBS& lbs, higanbana::WTime& time, const RendererOptions& options, higanbana::MemView<RenderViewportInfo> viewportsToRender, higanbana::vector<InstanceDraw>& instances, int cubeCount, int cubeCommandLists);\n  std::optional<higanbana::SubmitTiming> timings();\n  float acquireTimeTakenMs() {return float(m_acquireTimeTaken) \/ 1000000.f;}\n  int loadMesh(MeshData& data, int buffer[5]);\n  void unloadMesh(int index);\n  int loadBuffer(BufferData& data);\n  void unloadBuffer(int index);\n  int loadTexture(TextureData& data);\n  void unloadTexture(int index);\n  int loadMaterial(MaterialData& data);\n  void unloadMaterial(int index);\n};\n}<|endoftext|>"}
{"text":"<commit_before>\/** \n * @file llchicletbar.cpp\n * @brief LLChicletBar class implementation\n *\n * $LicenseInfo:firstyear=2011&license=viewerlgpl$\n * Second Life Viewer Source Code\n * Copyright (C) 2011, 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#include \"llviewerprecompiledheaders.h\" \/\/ must be first include\n\n#include \"llchicletbar.h\"\n\n\/\/ library includes\n#include \"llfloaterreg.h\"\n#include \"lllayoutstack.h\"\n\n\/\/ newview includes\n#include \"llchiclet.h\"\n#include \"llimfloater.h\" \/\/ for LLIMFloater\n#include \"llpaneltopinfobar.h\"\n#include \"llsyswellwindow.h\"\n\nnamespace\n{\n\tconst std::string& PANEL_CHICLET_NAME\t= \"chiclet_list_panel\";\n\n\tS32 get_panel_min_width(LLLayoutStack* stack, LLView* panel)\n\t{\n\t\tS32 minimal_width = 0;\n\t\tllassert(stack);\n\t\tif ( stack && panel && panel->getVisible() )\n\t\t{\n\t\t\tstack->getPanelMinSize(panel->getName(), &minimal_width);\n\t\t}\n\t\treturn minimal_width;\n\t}\n\n\tS32 get_panel_max_width(LLLayoutStack* stack, LLPanel* panel)\n\t{\n\t\tS32 max_width = 0;\n\t\tllassert(stack);\n\t\tif ( stack && panel && panel->getVisible() )\n\t\t{\n\t\t\tstack->getPanelMaxSize(panel->getName(), &max_width);\n\t\t}\n\t\treturn max_width;\n\t}\n\n\tS32 get_curr_width(LLUICtrl* ctrl)\n\t{\n\t\tS32 cur_width = 0;\n\t\tif ( ctrl && ctrl->getVisible() )\n\t\t{\n\t\t\tcur_width = ctrl->getRect().getWidth();\n\t\t}\n\t\treturn cur_width;\n\t}\n}\n\nLLChicletBar::LLChicletBar(const LLSD&)\n:\tmChicletPanel(NULL),\n\tmToolbarStack(NULL)\n{\n\t\/\/ Firstly add our self to IMSession observers, so we catch session events\n\t\/\/ before chiclets do that.\n\tLLIMMgr::getInstance()->addSessionObserver(this);\n\n\tbuildFromFile(\"panel_chiclet_bar.xml\");\n}\n\nLLChicletBar::~LLChicletBar()\n{\n\tif (!LLSingleton<LLIMMgr>::destroyed())\n\t{\n\t\tLLIMMgr::getInstance()->removeSessionObserver(this);\n\t}\n}\n\nLLIMChiclet* LLChicletBar::createIMChiclet(const LLUUID& session_id)\n{\n\tLLIMChiclet::EType im_chiclet_type = LLIMChiclet::getIMSessionType(session_id);\n\n\tswitch (im_chiclet_type)\n\t{\n\tcase LLIMChiclet::TYPE_IM:\n\t\treturn getChicletPanel()->createChiclet<LLIMP2PChiclet>(session_id);\n\tcase LLIMChiclet::TYPE_GROUP:\n\t\treturn getChicletPanel()->createChiclet<LLIMGroupChiclet>(session_id);\n\tcase LLIMChiclet::TYPE_AD_HOC:\n\t\treturn getChicletPanel()->createChiclet<LLAdHocChiclet>(session_id);\n\tcase LLIMChiclet::TYPE_UNKNOWN:\n\t\tbreak;\n\t}\n\n\treturn NULL;\n}\n\n\/\/virtual\nvoid LLChicletBar::sessionAdded(const LLUUID& session_id, const std::string& name, const LLUUID& other_participant_id)\n{\n\tif (!getChicletPanel()) return;\n\n\tLLIMModel::LLIMSession* session = LLIMModel::getInstance()->findIMSession(session_id);\n\tif (!session) return;\n\n\t\/\/ no need to spawn chiclets for participants in P2P calls called through Avaline\n\tif (session->isP2P() && session->isOtherParticipantAvaline()) return;\n\n\tif (getChicletPanel()->findChiclet<LLChiclet>(session_id)) return;\n\n\tLLIMChiclet* chiclet = createIMChiclet(session_id);\n\tif(chiclet)\n\t{\n\t\tchiclet->setIMSessionName(name);\n\t\tchiclet->setOtherParticipantId(other_participant_id);\n\t\t\n\t\tLLIMFloater::onIMChicletCreated(session_id);\n\n\t}\n\telse\n\t{\n\t\tllwarns << \"Could not create chiclet\" << llendl;\n\t}\n}\n\n\/\/virtual\nvoid LLChicletBar::sessionRemoved(const LLUUID& session_id)\n{\n\tif(getChicletPanel())\n\t{\n\t\t\/\/ IM floater should be closed when session removed and associated chiclet closed\n\t\tLLIMFloater* iMfloater = LLFloaterReg::findTypedInstance<LLIMFloater>(\"impanel\", session_id);\n\t\tif (iMfloater != NULL)\n\t\t{\n\t\t\tiMfloater->closeFloater();\n\t\t}\n\n\t\tgetChicletPanel()->removeChiclet(session_id);\n\t}\n}\n\nvoid LLChicletBar::sessionIDUpdated(const LLUUID& old_session_id, const LLUUID& new_session_id)\n{\n\t\/\/this is only needed in case of outgoing ad-hoc\/group chat sessions\n\tLLChicletPanel* chiclet_panel = getChicletPanel();\n\tif (chiclet_panel)\n\t{\n\t\t\/\/it should be ad-hoc im chiclet or group im chiclet\n\t\tLLChiclet* chiclet = chiclet_panel->findChiclet<LLChiclet>(old_session_id);\n\t\tif (chiclet) chiclet->setSessionId(new_session_id);\n\t}\n}\n\nS32 LLChicletBar::getTotalUnreadIMCount()\n{\n\treturn getChicletPanel()->getTotalUnreadIMCount();\n}\n\nBOOL LLChicletBar::postBuild()\n{\n\tmToolbarStack = getChild<LLLayoutStack>(\"toolbar_stack\");\n\tmChicletPanel = getChild<LLChicletPanel>(\"chiclet_list\");\n\n\tshowWellButton(\"im_well\", !LLIMWellWindow::getInstance()->isWindowEmpty());\n\tshowWellButton(\"notification_well\", !LLNotificationWellWindow::getInstance()->isWindowEmpty());\n\n\tLLPanelTopInfoBar::instance().setResizeCallback(boost::bind(&LLChicletBar::fitWithTopInfoBar, this));\n\tLLPanelTopInfoBar::instance().setVisibleCallback(boost::bind(&LLChicletBar::fitWithTopInfoBar, this));\n\n\treturn TRUE;\n}\n\nvoid LLChicletBar::showWellButton(const std::string& well_name, bool visible)\n{\n\tLLView * panel = findChild<LLView>(well_name + \"_panel\");\n\tif (!panel)\treturn;\n\n\tpanel->setVisible(visible);\n}\n\nvoid LLChicletBar::log(LLView* panel, const std::string& descr)\n{\n\tif (NULL == panel) return;\n\tLLView* layout = panel->getParent();\n\tLL_DEBUGS(\"Chiclet Bar Rects\") << descr << \": \"\n\t\t<< \"panel: \" << panel->getName()\n\t\t<< \", rect: \" << panel->getRect()\n\t\t<< \" layout: \" << layout->getName()\n\t\t<< \", rect: \" << layout->getRect()\n\t\t<< LL_ENDL;\n}\n\nvoid LLChicletBar::reshape(S32 width, S32 height, BOOL called_from_parent)\n{\n\tstatic S32 debug_calling_number = 0;\n\tlldebugs << \"**************************************** \" << ++debug_calling_number << llendl;\n\n\tS32 current_width = getRect().getWidth();\n\tS32 delta_width = width - current_width;\n\tlldebugs << \"Reshaping: \"\n\t\t<< \", width: \" << width\n\t\t<< \", cur width: \" << current_width\n\t\t<< \", delta_width: \" << delta_width\n\t\t<< \", called_from_parent: \" << called_from_parent\n\t\t<< llendl;\n\n\tif (mChicletPanel)\t\t\tlog(mChicletPanel, \"before\");\n\n\t\/\/ Difference between chiclet bar width required to fit its children and the actual width. (see EXT-991)\n\t\/\/ Positive value means that chiclet bar is not wide enough.\n\t\/\/ Negative value means that there is free space.\n\tstatic S32 extra_shrink_width = 0;\n\tbool should_be_reshaped = true;\n\n\tif (mChicletPanel && mToolbarStack)\n\t{\n\t\t\/\/ Firstly, update layout stack to ensure we deal with correct panel sizes.\n\t\t{\n\t\t\tBOOL saved_anim = mToolbarStack->getAnimate();\n\t\t\t\/\/ Set chiclet panel to be autoresized by default.\n\t\t\tmToolbarStack->updatePanelAutoResize(PANEL_CHICLET_NAME, TRUE);\n\t\t\t\/\/ Disable animation to prevent layout updating in several frames.\n\t\t\tmToolbarStack->setAnimate(FALSE);\n\t\t\t\/\/ Force the updating of layout to reset panels collapse factor.\n\t\t\tmToolbarStack->updateLayout();\n\t\t\t\/\/ Restore animate state.\n\t\t\tmToolbarStack->setAnimate(saved_anim);\n\t\t}\n\n\t\t\/\/ chiclet bar is narrowed\n\t\tif (delta_width < 0)\n\t\t{\n\t\t\tif (extra_shrink_width > 0) \/\/ not enough space\n\t\t\t{\n\t\t\t\textra_shrink_width += llabs(delta_width);\n\t\t\t\tshould_be_reshaped = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\textra_shrink_width = processWidthDecreased(delta_width);\n\n\t\t\t\t\/\/ increase new width to extra_shrink_width value to not reshape less than chiclet bar minimum\n\t\t\t\twidth += extra_shrink_width;\n\t\t\t}\n\t\t}\n\t\t\/\/ chiclet bar is widened\n\t\telse\n\t\t{\n\t\t\tif (extra_shrink_width > delta_width)\n\t\t\t{\n\t\t\t\t\/\/ Still not enough space.\n\t\t\t\t\/\/ Only subtract the delta from the required delta and don't reshape.\n\t\t\t\textra_shrink_width -= delta_width;\n\t\t\t\tshould_be_reshaped = false;\n\t\t\t}\n\t\t\telse if (extra_shrink_width > 0)\n\t\t\t{\n\t\t\t\t\/\/ If we have some extra shrink width let's reduce delta_width & width\n\t\t\t\tdelta_width -= extra_shrink_width;\n\t\t\t\twidth -= extra_shrink_width;\n\t\t\t\textra_shrink_width = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (should_be_reshaped)\n\t{\n\t\tlldebugs << \"Reshape all children with width: \" << width << llendl;\n\t\tLLPanel::reshape(width, height, called_from_parent);\n\t}\n\n\tif (mChicletPanel)\t\t\tlog(mChicletPanel, \"after\");\n}\n\nS32 LLChicletBar::processWidthDecreased(S32 delta_width)\n{\n\tbool still_should_be_processed = true;\n\n\tconst S32 chiclet_panel_shrink_headroom = getChicletPanelShrinkHeadroom();\n\n\t\/\/ Decreasing width of chiclet panel.\n\tif (chiclet_panel_shrink_headroom > 0)\n\t{\n\t\t\/\/ we have some space to decrease chiclet panel\n\t\tS32 shrink_by = llmin(-delta_width, chiclet_panel_shrink_headroom);\n\n\t\tlldebugs << \"delta_width: \" << delta_width\n\t\t\t<< \", panel_delta_min: \" << chiclet_panel_shrink_headroom\n\t\t\t<< \", shrink_by: \" << shrink_by\n\t\t\t<< llendl;\n\n\t\t\/\/ is chiclet panel wide enough to process resizing?\n\t\tdelta_width += chiclet_panel_shrink_headroom;\n\n\t\tstill_should_be_processed = delta_width < 0;\n\n\t\tlldebugs << \"Shrinking chiclet panel by \" << shrink_by << \" px\" << llendl;\n\t\tmChicletPanel->getParent()->reshape(mChicletPanel->getParent()->getRect().getWidth() - shrink_by, mChicletPanel->getParent()->getRect().getHeight());\n\t\tlog(mChicletPanel, \"after processing panel decreasing via chiclet panel\");\n\n\t\tlldebugs << \"RS_CHICLET_PANEL\"\n\t\t\t<< \", delta_width: \" << delta_width\n\t\t\t<< llendl;\n\t}\n\n\tS32 extra_shrink_width = 0;\n\n\tif (still_should_be_processed)\n\t{\n\t\textra_shrink_width = -delta_width;\n\t\tllwarns << \"There is no enough width to reshape all children: \"\n\t\t\t<< extra_shrink_width << llendl;\n\t}\n\n\treturn extra_shrink_width;\n}\n\nS32 LLChicletBar::getChicletPanelShrinkHeadroom() const\n{\n\tstatic const S32 min_width = mChicletPanel->getMinWidth();\n\tconst S32 cur_width = mChicletPanel->getParent()->getRect().getWidth();\n\n\tS32 shrink_headroom = cur_width - min_width;\n\tllassert(shrink_headroom >= 0); \/\/ the panel cannot get narrower than the minimum\n\treturn shrink_headroom;\n}\n\nvoid LLChicletBar::fitWithTopInfoBar()\n{\n\tLLPanelTopInfoBar& top_info_bar = LLPanelTopInfoBar::instance();\n\n\tLLRect rect = getRect();\n\tS32 width = rect.getWidth();\n\n\tif (top_info_bar.getVisible())\n\t{\n\t\tS32 delta = top_info_bar.calcScreenRect().mRight - calcScreenRect().mLeft;\n\t\trect.setLeftTopAndSize(rect.mLeft + delta, rect.mTop, rect.getWidth(), rect.getHeight());\n\t\twidth = rect.getWidth() - delta;\n\t}\n\telse\n\t{\n\t\tLLView* parent = getParent();\n\t\tif (parent)\n\t\t{\n\t\t\tLLRect parent_rect = parent->getRect();\n\t\t\trect.setLeftTopAndSize(0, rect.mTop, rect.getWidth(), rect.getHeight());\n\t\t\twidth = parent_rect.getWidth();\n\t\t}\n\t}\n\n\tsetRect(rect);\n\tLLPanel::reshape(width, rect.getHeight(), false);\n}\n<commit_msg>EXP-1463 ADDITIONAL FIX (IM chiclets overlay Mini-Location bar)<commit_after>\/** \n * @file llchicletbar.cpp\n * @brief LLChicletBar class implementation\n *\n * $LicenseInfo:firstyear=2011&license=viewerlgpl$\n * Second Life Viewer Source Code\n * Copyright (C) 2011, 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#include \"llviewerprecompiledheaders.h\" \/\/ must be first include\n\n#include \"llchicletbar.h\"\n\n\/\/ library includes\n#include \"llfloaterreg.h\"\n#include \"lllayoutstack.h\"\n\n\/\/ newview includes\n#include \"llchiclet.h\"\n#include \"llimfloater.h\" \/\/ for LLIMFloater\n#include \"llpaneltopinfobar.h\"\n#include \"llsyswellwindow.h\"\n\nnamespace\n{\n\tconst std::string& PANEL_CHICLET_NAME\t= \"chiclet_list_panel\";\n\n\tS32 get_panel_min_width(LLLayoutStack* stack, LLView* panel)\n\t{\n\t\tS32 minimal_width = 0;\n\t\tllassert(stack);\n\t\tif ( stack && panel && panel->getVisible() )\n\t\t{\n\t\t\tstack->getPanelMinSize(panel->getName(), &minimal_width);\n\t\t}\n\t\treturn minimal_width;\n\t}\n\n\tS32 get_panel_max_width(LLLayoutStack* stack, LLPanel* panel)\n\t{\n\t\tS32 max_width = 0;\n\t\tllassert(stack);\n\t\tif ( stack && panel && panel->getVisible() )\n\t\t{\n\t\t\tstack->getPanelMaxSize(panel->getName(), &max_width);\n\t\t}\n\t\treturn max_width;\n\t}\n\n\tS32 get_curr_width(LLUICtrl* ctrl)\n\t{\n\t\tS32 cur_width = 0;\n\t\tif ( ctrl && ctrl->getVisible() )\n\t\t{\n\t\t\tcur_width = ctrl->getRect().getWidth();\n\t\t}\n\t\treturn cur_width;\n\t}\n}\n\nLLChicletBar::LLChicletBar(const LLSD&)\n:\tmChicletPanel(NULL),\n\tmToolbarStack(NULL)\n{\n\t\/\/ Firstly add our self to IMSession observers, so we catch session events\n\t\/\/ before chiclets do that.\n\tLLIMMgr::getInstance()->addSessionObserver(this);\n\n\tbuildFromFile(\"panel_chiclet_bar.xml\");\n}\n\nLLChicletBar::~LLChicletBar()\n{\n\tif (!LLSingleton<LLIMMgr>::destroyed())\n\t{\n\t\tLLIMMgr::getInstance()->removeSessionObserver(this);\n\t}\n}\n\nLLIMChiclet* LLChicletBar::createIMChiclet(const LLUUID& session_id)\n{\n\tLLIMChiclet::EType im_chiclet_type = LLIMChiclet::getIMSessionType(session_id);\n\n\tswitch (im_chiclet_type)\n\t{\n\tcase LLIMChiclet::TYPE_IM:\n\t\treturn getChicletPanel()->createChiclet<LLIMP2PChiclet>(session_id);\n\tcase LLIMChiclet::TYPE_GROUP:\n\t\treturn getChicletPanel()->createChiclet<LLIMGroupChiclet>(session_id);\n\tcase LLIMChiclet::TYPE_AD_HOC:\n\t\treturn getChicletPanel()->createChiclet<LLAdHocChiclet>(session_id);\n\tcase LLIMChiclet::TYPE_UNKNOWN:\n\t\tbreak;\n\t}\n\n\treturn NULL;\n}\n\n\/\/virtual\nvoid LLChicletBar::sessionAdded(const LLUUID& session_id, const std::string& name, const LLUUID& other_participant_id)\n{\n\tif (!getChicletPanel()) return;\n\n\tLLIMModel::LLIMSession* session = LLIMModel::getInstance()->findIMSession(session_id);\n\tif (!session) return;\n\n\t\/\/ no need to spawn chiclets for participants in P2P calls called through Avaline\n\tif (session->isP2P() && session->isOtherParticipantAvaline()) return;\n\n\tif (getChicletPanel()->findChiclet<LLChiclet>(session_id)) return;\n\n\tLLIMChiclet* chiclet = createIMChiclet(session_id);\n\tif(chiclet)\n\t{\n\t\tchiclet->setIMSessionName(name);\n\t\tchiclet->setOtherParticipantId(other_participant_id);\n\t\t\n\t\tLLIMFloater::onIMChicletCreated(session_id);\n\n\t}\n\telse\n\t{\n\t\tllwarns << \"Could not create chiclet\" << llendl;\n\t}\n}\n\n\/\/virtual\nvoid LLChicletBar::sessionRemoved(const LLUUID& session_id)\n{\n\tif(getChicletPanel())\n\t{\n\t\t\/\/ IM floater should be closed when session removed and associated chiclet closed\n\t\tLLIMFloater* iMfloater = LLFloaterReg::findTypedInstance<LLIMFloater>(\"impanel\", session_id);\n\t\tif (iMfloater != NULL)\n\t\t{\n\t\t\tiMfloater->closeFloater();\n\t\t}\n\n\t\tgetChicletPanel()->removeChiclet(session_id);\n\t}\n}\n\nvoid LLChicletBar::sessionIDUpdated(const LLUUID& old_session_id, const LLUUID& new_session_id)\n{\n\t\/\/this is only needed in case of outgoing ad-hoc\/group chat sessions\n\tLLChicletPanel* chiclet_panel = getChicletPanel();\n\tif (chiclet_panel)\n\t{\n\t\t\/\/it should be ad-hoc im chiclet or group im chiclet\n\t\tLLChiclet* chiclet = chiclet_panel->findChiclet<LLChiclet>(old_session_id);\n\t\tif (chiclet) chiclet->setSessionId(new_session_id);\n\t}\n}\n\nS32 LLChicletBar::getTotalUnreadIMCount()\n{\n\treturn getChicletPanel()->getTotalUnreadIMCount();\n}\n\nBOOL LLChicletBar::postBuild()\n{\n\tmToolbarStack = getChild<LLLayoutStack>(\"toolbar_stack\");\n\tmChicletPanel = getChild<LLChicletPanel>(\"chiclet_list\");\n\n\tshowWellButton(\"im_well\", !LLIMWellWindow::getInstance()->isWindowEmpty());\n\tshowWellButton(\"notification_well\", !LLNotificationWellWindow::getInstance()->isWindowEmpty());\n\n\tLLPanelTopInfoBar::instance().setResizeCallback(boost::bind(&LLChicletBar::fitWithTopInfoBar, this));\n\tLLPanelTopInfoBar::instance().setVisibleCallback(boost::bind(&LLChicletBar::fitWithTopInfoBar, this));\n\n\treturn TRUE;\n}\n\nvoid LLChicletBar::showWellButton(const std::string& well_name, bool visible)\n{\n\tLLView * panel = findChild<LLView>(well_name + \"_panel\");\n\tif (!panel)\treturn;\n\n\tpanel->setVisible(visible);\n}\n\nvoid LLChicletBar::log(LLView* panel, const std::string& descr)\n{\n\tif (NULL == panel) return;\n\tLLView* layout = panel->getParent();\n\tLL_DEBUGS(\"Chiclet Bar Rects\") << descr << \": \"\n\t\t<< \"panel: \" << panel->getName()\n\t\t<< \", rect: \" << panel->getRect()\n\t\t<< \" layout: \" << layout->getName()\n\t\t<< \", rect: \" << layout->getRect()\n\t\t<< LL_ENDL;\n}\n\nvoid LLChicletBar::reshape(S32 width, S32 height, BOOL called_from_parent)\n{\n\tstatic S32 debug_calling_number = 0;\n\tlldebugs << \"**************************************** \" << ++debug_calling_number << llendl;\n\n\tS32 current_width = getRect().getWidth();\n\tS32 delta_width = width - current_width;\n\tlldebugs << \"Reshaping: \"\n\t\t<< \", width: \" << width\n\t\t<< \", cur width: \" << current_width\n\t\t<< \", delta_width: \" << delta_width\n\t\t<< \", called_from_parent: \" << called_from_parent\n\t\t<< llendl;\n\n\tif (mChicletPanel)\t\t\tlog(mChicletPanel, \"before\");\n\n\t\/\/ Difference between chiclet bar width required to fit its children and the actual width. (see EXT-991)\n\t\/\/ Positive value means that chiclet bar is not wide enough.\n\t\/\/ Negative value means that there is free space.\n\tstatic S32 extra_shrink_width = 0;\n\tbool should_be_reshaped = true;\n\n\tif (mChicletPanel && mToolbarStack)\n\t{\n\t\t\/\/ Firstly, update layout stack to ensure we deal with correct panel sizes.\n\t\t{\n\t\t\tBOOL saved_anim = mToolbarStack->getAnimate();\n\t\t\t\/\/ Set chiclet panel to be autoresized by default.\n\t\t\tmToolbarStack->updatePanelAutoResize(PANEL_CHICLET_NAME, TRUE);\n\t\t\t\/\/ Disable animation to prevent layout updating in several frames.\n\t\t\tmToolbarStack->setAnimate(FALSE);\n\t\t\t\/\/ Force the updating of layout to reset panels collapse factor.\n\t\t\tmToolbarStack->updateLayout();\n\t\t\t\/\/ Restore animate state.\n\t\t\tmToolbarStack->setAnimate(saved_anim);\n\t\t}\n\n\t\t\/\/ chiclet bar is narrowed\n\t\tif (delta_width < 0)\n\t\t{\n\t\t\tif (extra_shrink_width > 0) \/\/ not enough space\n\t\t\t{\n\t\t\t\textra_shrink_width += llabs(delta_width);\n\t\t\t\tshould_be_reshaped = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\textra_shrink_width = processWidthDecreased(delta_width);\n\n\t\t\t\t\/\/ increase new width to extra_shrink_width value to not reshape less than chiclet bar minimum\n\t\t\t\twidth += extra_shrink_width;\n\t\t\t}\n\t\t}\n\t\t\/\/ chiclet bar is widened\n\t\telse\n\t\t{\n\t\t\tif (extra_shrink_width > delta_width)\n\t\t\t{\n\t\t\t\t\/\/ Still not enough space.\n\t\t\t\t\/\/ Only subtract the delta from the required delta and don't reshape.\n\t\t\t\textra_shrink_width -= delta_width;\n\t\t\t\tshould_be_reshaped = false;\n\t\t\t}\n\t\t\telse if (extra_shrink_width > 0)\n\t\t\t{\n\t\t\t\t\/\/ If we have some extra shrink width let's reduce delta_width & width\n\t\t\t\tdelta_width -= extra_shrink_width;\n\t\t\t\twidth -= extra_shrink_width;\n\t\t\t\textra_shrink_width = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (should_be_reshaped)\n\t{\n\t\tlldebugs << \"Reshape all children with width: \" << width << llendl;\n\t\tLLPanel::reshape(width, height, called_from_parent);\n\t}\n\n\tif (mChicletPanel)\t\t\tlog(mChicletPanel, \"after\");\n}\n\nS32 LLChicletBar::processWidthDecreased(S32 delta_width)\n{\n\tbool still_should_be_processed = true;\n\n\tconst S32 chiclet_panel_shrink_headroom = getChicletPanelShrinkHeadroom();\n\n\t\/\/ Decreasing width of chiclet panel.\n\tif (chiclet_panel_shrink_headroom > 0)\n\t{\n\t\t\/\/ we have some space to decrease chiclet panel\n\t\tS32 shrink_by = llmin(-delta_width, chiclet_panel_shrink_headroom);\n\n\t\tlldebugs << \"delta_width: \" << delta_width\n\t\t\t<< \", panel_delta_min: \" << chiclet_panel_shrink_headroom\n\t\t\t<< \", shrink_by: \" << shrink_by\n\t\t\t<< llendl;\n\n\t\t\/\/ is chiclet panel wide enough to process resizing?\n\t\tdelta_width += chiclet_panel_shrink_headroom;\n\n\t\tstill_should_be_processed = delta_width < 0;\n\n\t\tlldebugs << \"Shrinking chiclet panel by \" << shrink_by << \" px\" << llendl;\n\t\tmChicletPanel->getParent()->reshape(mChicletPanel->getParent()->getRect().getWidth() - shrink_by, mChicletPanel->getParent()->getRect().getHeight());\n\t\tlog(mChicletPanel, \"after processing panel decreasing via chiclet panel\");\n\n\t\tlldebugs << \"RS_CHICLET_PANEL\"\n\t\t\t<< \", delta_width: \" << delta_width\n\t\t\t<< llendl;\n\t}\n\n\tS32 extra_shrink_width = 0;\n\n\tif (still_should_be_processed)\n\t{\n\t\textra_shrink_width = -delta_width;\n\t\tllwarns << \"There is no enough width to reshape all children: \"\n\t\t\t<< extra_shrink_width << llendl;\n\t}\n\n\treturn extra_shrink_width;\n}\n\nS32 LLChicletBar::getChicletPanelShrinkHeadroom() const\n{\n\tstatic const S32 min_width = mChicletPanel->getMinWidth();\n\tconst S32 cur_width = mChicletPanel->getParent()->getRect().getWidth();\n\n\tS32 shrink_headroom = cur_width - min_width;\n\tllassert(shrink_headroom >= 0); \/\/ the panel cannot get narrower than the minimum\n\treturn shrink_headroom;\n}\n\nvoid LLChicletBar::fitWithTopInfoBar()\n{\n\tLLPanelTopInfoBar& top_info_bar = LLPanelTopInfoBar::instance();\n\n\tLLRect rect = getRect();\n\tS32 width = rect.getWidth();\n\n\tif (top_info_bar.getVisible())\n\t{\n\t\tS32 delta = top_info_bar.calcScreenRect().mRight - calcScreenRect().mLeft;\n\t\tif (delta < 0 && rect.mLeft < llabs(delta))\n\t\t\tdelta = -rect.mLeft;\n\t\trect.setLeftTopAndSize(rect.mLeft + delta, rect.mTop, rect.getWidth(), rect.getHeight());\n\t\twidth = rect.getWidth() - delta;\n\t}\n\telse\n\t{\n\t\tLLView* parent = getParent();\n\t\tif (parent)\n\t\t{\n\t\t\tLLRect parent_rect = parent->getRect();\n\t\t\trect.setLeftTopAndSize(0, rect.mTop, rect.getWidth(), rect.getHeight());\n\t\t\twidth = parent_rect.getWidth();\n\t\t}\n\t}\n\n\tsetRect(rect);\n\tLLPanel::reshape(width, rect.getHeight(), false);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \n * @file llfloatertos.cpp\n * @brief Terms of Service Agreement dialog\n *\n * $LicenseInfo:firstyear=2003&license=viewergpl$\n * \n * Copyright (c) 2003-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab.  Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"llfloatertos.h\"\n\n\/\/ viewer includes\n#include \"llviewerstats.h\"\n#include \"llviewerwindow.h\"\n\n\/\/ linden library includes\n#include \"llbutton.h\"\n#include \"llhttpclient.h\"\n#include \"llhttpstatuscodes.h\"\t\/\/ for HTTP_FOUND\n#include \"llradiogroup.h\"\n#include \"lltextbox.h\"\n#include \"llui.h\"\n#include \"lluictrlfactory.h\"\n#include \"llvfile.h\"\n#include \"message.h\"\n\n\nLLFloaterTOS::LLFloaterTOS(const LLSD& data)\n:\tLLModalDialog( data[\"message\"].asString() ),\n\tmMessage(data[\"message\"].asString()),\n\tmWebBrowserWindowId( 0 ),\n\tmLoadCompleteCount( 0 ),\n\tmReplyPumpName(data[\"reply_pump\"].asString())\n{\n}\n\n\/\/ helper class that trys to download a URL from a web site and calls a method \n\/\/ on parent class indicating if the web server is working or not\nclass LLIamHere : public LLHTTPClient::Responder\n{\n\tprivate:\n\t\tLLIamHere( LLFloaterTOS* parent ) :\n\t\t   mParent( parent )\n\t\t{}\n\n\t\tLLFloaterTOS* mParent;\n\n\tpublic:\n\n\t\tstatic boost::intrusive_ptr< LLIamHere > build( LLFloaterTOS* parent )\n\t\t{\n\t\t\treturn boost::intrusive_ptr< LLIamHere >( new LLIamHere( parent ) );\n\t\t};\n\t\t\n\t\tvirtual void  setParent( LLFloaterTOS* parentIn )\n\t\t{\n\t\t\tmParent = parentIn;\n\t\t};\n\t\t\n\t\tvirtual void result( const LLSD& content )\n\t\t{\n\t\t\tif ( mParent )\n\t\t\t\tmParent->setSiteIsAlive( true );\n\t\t};\n\n\t\tvirtual void error( U32 status, const std::string& reason )\n\t\t{\n\t\t\tif ( mParent )\n\t\t\t{\n\t\t\t\t\/\/ *HACK: For purposes of this alive check, 302 Found\n\t\t\t\t\/\/ (aka Moved Temporarily) is considered alive.  The web site\n\t\t\t\t\/\/ redirects this link to a \"cache busting\" temporary URL. JC\n\t\t\t\tbool alive = (status == HTTP_FOUND);\n\t\t\t\tmParent->setSiteIsAlive( alive );\n\t\t\t}\n\t\t};\n};\n\n\/\/ this is global and not a class member to keep crud out of the header file\nnamespace {\n\tboost::intrusive_ptr< LLIamHere > gResponsePtr = 0;\n};\n\nBOOL LLFloaterTOS::postBuild()\n{\t\n\tchildSetAction(\"Continue\", onContinue, this);\n\tchildSetAction(\"Cancel\", onCancel, this);\n\tchildSetCommitCallback(\"agree_chk\", updateAgree, this);\n\t\n\tif (hasChild(\"tos_text\"))\n\t{\n\t\t\/\/ this displays the critical message\n\t\tLLUICtrl *tos_text = getChild<LLUICtrl>(\"tos_text\");\n\t\ttos_text->setEnabled( FALSE );\n\t\ttos_text->setFocus(TRUE);\n\t\ttos_text->setValue(LLSD(mMessage));\n\n\t\treturn TRUE;\n\t}\n\n\t\/\/ disable Agree to TOS radio button until the page has fully loaded\n\tLLCheckBoxCtrl* tos_agreement = getChild<LLCheckBoxCtrl>(\"agree_chk\");\n\ttos_agreement->setEnabled( false );\n\n\t\/\/ hide the SL text widget if we're displaying TOS with using a browser widget.\n\tLLUICtrl *editor = getChild<LLUICtrl>(\"tos_text\");\n\teditor->setVisible( FALSE );\n\n\tLLMediaCtrl* web_browser = getChild<LLMediaCtrl>(\"tos_html\");\n\tif ( web_browser )\n\t{\n\t\tweb_browser->addObserver(this);\n\t\tgResponsePtr = LLIamHere::build( this );\n\t\tLLHTTPClient::get( getString( \"real_url\" ), gResponsePtr );\n\t}\n\n\treturn TRUE;\n}\n\nvoid LLFloaterTOS::setSiteIsAlive( bool alive )\n{\n\t\/\/ only do this for TOS pages\n\tif (hasChild(\"tos_html\"))\n\t{\n\t\tLLMediaCtrl* web_browser = getChild<LLMediaCtrl>(\"tos_html\");\n\t\t\/\/ if the contents of the site was retrieved\n\t\tif ( alive )\n\t\t{\n\t\t\t\/\/ navigate to the \"real\" page \n\t\t\tweb_browser->navigateTo( getString( \"real_url\" ) );\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ normally this is set when navigation to TOS page navigation completes (so you can't accept before TOS loads)\n\t\t\t\/\/ but if the page is unavailable, we need to do this now\n\t\t\tLLCheckBoxCtrl* tos_agreement = getChild<LLCheckBoxCtrl>(\"agree_chk\");\n\t\t\ttos_agreement->setEnabled( true );\n\t\t}\n\t}\n}\n\nLLFloaterTOS::~LLFloaterTOS()\n{\n\n\t\/\/ tell the responder we're not here anymore\n\tif ( gResponsePtr )\n\t\tgResponsePtr->setParent( 0 );\n}\n\n\/\/ virtual\nvoid LLFloaterTOS::draw()\n{\n\t\/\/ draw children\n\tLLModalDialog::draw();\n}\n\n\/\/ static\nvoid LLFloaterTOS::updateAgree(LLUICtrl*, void* userdata )\n{\n\tLLFloaterTOS* self = (LLFloaterTOS*) userdata;\n\tbool agree = self->childGetValue(\"agree_chk\").asBoolean(); \n\tself->childSetEnabled(\"Continue\", agree);\n}\n\n\/\/ static\nvoid LLFloaterTOS::onContinue( void* userdata )\n{\n\tLLFloaterTOS* self = (LLFloaterTOS*) userdata;\n\tllinfos << \"User agrees with TOS.\" << llendl;\n\n\tif(self->mReplyPumpName != \"\")\n\t{\n\t\tLLEventPumps::instance().obtain(self->mReplyPumpName).post(LLSD(true));\n\t}\n\n\tself->closeFloater(); \/\/ destroys this object\n}\n\n\/\/ static\nvoid LLFloaterTOS::onCancel( void* userdata )\n{\n\tLLFloaterTOS* self = (LLFloaterTOS*) userdata;\n\tllinfos << \"User disagrees with TOS.\" << llendl;\n\n\tif(self->mReplyPumpName != \"\")\n\t{\n\t\tLLEventPumps::instance().obtain(self->mReplyPumpName).post(LLSD(false));\n\t}\n\n\tself->mLoadCompleteCount = 0;  \/\/ reset counter for next time we come to TOS\n\tself->closeFloater(); \/\/ destroys this object\n}\n\n\/\/virtual \nvoid LLFloaterTOS::handleMediaEvent(LLPluginClassMedia* \/*self*\/, EMediaEvent event)\n{\n\tif(event == MEDIA_EVENT_NAVIGATE_COMPLETE)\n\t{\n\t\t\/\/ skip past the loading screen navigate complete\n\t\tif ( ++mLoadCompleteCount == 2 )\n\t\t{\n\t\t\tllinfos << \"NAVIGATE COMPLETE\" << llendl;\n\t\t\t\/\/ enable Agree to TOS radio button now that page has loaded\n\t\t\tLLCheckBoxCtrl * tos_agreement = getChild<LLCheckBoxCtrl>(\"agree_chk\");\n\t\t\ttos_agreement->setEnabled( true );\n\t\t}\n\t}\n}\n\n<commit_msg>QAR-1619: Reconcile LLFloaterTOS::onCancel() with viewer-2 version. The viewer-2 onCancel() pops up a \"MustAgreeToLogIn\" notification. Make ours do the same.<commit_after>\/** \n * @file llfloatertos.cpp\n * @brief Terms of Service Agreement dialog\n *\n * $LicenseInfo:firstyear=2003&license=viewergpl$\n * \n * Copyright (c) 2003-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab.  Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"llfloatertos.h\"\n\n\/\/ viewer includes\n#include \"llviewerstats.h\"\n#include \"llviewerwindow.h\"\n\n\/\/ linden library includes\n#include \"llbutton.h\"\n#include \"llhttpclient.h\"\n#include \"llhttpstatuscodes.h\"\t\/\/ for HTTP_FOUND\n#include \"llradiogroup.h\"\n#include \"lltextbox.h\"\n#include \"llui.h\"\n#include \"lluictrlfactory.h\"\n#include \"llvfile.h\"\n#include \"message.h\"\n#include \"llstartup.h\"              \/\/ login_alert_done\n\n\nLLFloaterTOS::LLFloaterTOS(const LLSD& data)\n:\tLLModalDialog( data[\"message\"].asString() ),\n\tmMessage(data[\"message\"].asString()),\n\tmWebBrowserWindowId( 0 ),\n\tmLoadCompleteCount( 0 ),\n\tmReplyPumpName(data[\"reply_pump\"].asString())\n{\n}\n\n\/\/ helper class that trys to download a URL from a web site and calls a method \n\/\/ on parent class indicating if the web server is working or not\nclass LLIamHere : public LLHTTPClient::Responder\n{\n\tprivate:\n\t\tLLIamHere( LLFloaterTOS* parent ) :\n\t\t   mParent( parent )\n\t\t{}\n\n\t\tLLFloaterTOS* mParent;\n\n\tpublic:\n\n\t\tstatic boost::intrusive_ptr< LLIamHere > build( LLFloaterTOS* parent )\n\t\t{\n\t\t\treturn boost::intrusive_ptr< LLIamHere >( new LLIamHere( parent ) );\n\t\t};\n\t\t\n\t\tvirtual void  setParent( LLFloaterTOS* parentIn )\n\t\t{\n\t\t\tmParent = parentIn;\n\t\t};\n\t\t\n\t\tvirtual void result( const LLSD& content )\n\t\t{\n\t\t\tif ( mParent )\n\t\t\t\tmParent->setSiteIsAlive( true );\n\t\t};\n\n\t\tvirtual void error( U32 status, const std::string& reason )\n\t\t{\n\t\t\tif ( mParent )\n\t\t\t{\n\t\t\t\t\/\/ *HACK: For purposes of this alive check, 302 Found\n\t\t\t\t\/\/ (aka Moved Temporarily) is considered alive.  The web site\n\t\t\t\t\/\/ redirects this link to a \"cache busting\" temporary URL. JC\n\t\t\t\tbool alive = (status == HTTP_FOUND);\n\t\t\t\tmParent->setSiteIsAlive( alive );\n\t\t\t}\n\t\t};\n};\n\n\/\/ this is global and not a class member to keep crud out of the header file\nnamespace {\n\tboost::intrusive_ptr< LLIamHere > gResponsePtr = 0;\n};\n\nBOOL LLFloaterTOS::postBuild()\n{\t\n\tchildSetAction(\"Continue\", onContinue, this);\n\tchildSetAction(\"Cancel\", onCancel, this);\n\tchildSetCommitCallback(\"agree_chk\", updateAgree, this);\n\t\n\tif (hasChild(\"tos_text\"))\n\t{\n\t\t\/\/ this displays the critical message\n\t\tLLUICtrl *tos_text = getChild<LLUICtrl>(\"tos_text\");\n\t\ttos_text->setEnabled( FALSE );\n\t\ttos_text->setFocus(TRUE);\n\t\ttos_text->setValue(LLSD(mMessage));\n\n\t\treturn TRUE;\n\t}\n\n\t\/\/ disable Agree to TOS radio button until the page has fully loaded\n\tLLCheckBoxCtrl* tos_agreement = getChild<LLCheckBoxCtrl>(\"agree_chk\");\n\ttos_agreement->setEnabled( false );\n\n\t\/\/ hide the SL text widget if we're displaying TOS with using a browser widget.\n\tLLUICtrl *editor = getChild<LLUICtrl>(\"tos_text\");\n\teditor->setVisible( FALSE );\n\n\tLLMediaCtrl* web_browser = getChild<LLMediaCtrl>(\"tos_html\");\n\tif ( web_browser )\n\t{\n\t\tweb_browser->addObserver(this);\n\t\tgResponsePtr = LLIamHere::build( this );\n\t\tLLHTTPClient::get( getString( \"real_url\" ), gResponsePtr );\n\t}\n\n\treturn TRUE;\n}\n\nvoid LLFloaterTOS::setSiteIsAlive( bool alive )\n{\n\t\/\/ only do this for TOS pages\n\tif (hasChild(\"tos_html\"))\n\t{\n\t\tLLMediaCtrl* web_browser = getChild<LLMediaCtrl>(\"tos_html\");\n\t\t\/\/ if the contents of the site was retrieved\n\t\tif ( alive )\n\t\t{\n\t\t\t\/\/ navigate to the \"real\" page \n\t\t\tweb_browser->navigateTo( getString( \"real_url\" ) );\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ normally this is set when navigation to TOS page navigation completes (so you can't accept before TOS loads)\n\t\t\t\/\/ but if the page is unavailable, we need to do this now\n\t\t\tLLCheckBoxCtrl* tos_agreement = getChild<LLCheckBoxCtrl>(\"agree_chk\");\n\t\t\ttos_agreement->setEnabled( true );\n\t\t}\n\t}\n}\n\nLLFloaterTOS::~LLFloaterTOS()\n{\n\n\t\/\/ tell the responder we're not here anymore\n\tif ( gResponsePtr )\n\t\tgResponsePtr->setParent( 0 );\n}\n\n\/\/ virtual\nvoid LLFloaterTOS::draw()\n{\n\t\/\/ draw children\n\tLLModalDialog::draw();\n}\n\n\/\/ static\nvoid LLFloaterTOS::updateAgree(LLUICtrl*, void* userdata )\n{\n\tLLFloaterTOS* self = (LLFloaterTOS*) userdata;\n\tbool agree = self->childGetValue(\"agree_chk\").asBoolean(); \n\tself->childSetEnabled(\"Continue\", agree);\n}\n\n\/\/ static\nvoid LLFloaterTOS::onContinue( void* userdata )\n{\n\tLLFloaterTOS* self = (LLFloaterTOS*) userdata;\n\tllinfos << \"User agrees with TOS.\" << llendl;\n\n\tif(self->mReplyPumpName != \"\")\n\t{\n\t\tLLEventPumps::instance().obtain(self->mReplyPumpName).post(LLSD(true));\n\t}\n\n\tself->closeFloater(); \/\/ destroys this object\n}\n\n\/\/ static\nvoid LLFloaterTOS::onCancel( void* userdata )\n{\n\tLLFloaterTOS* self = (LLFloaterTOS*) userdata;\n\tllinfos << \"User disagrees with TOS.\" << llendl;\n\tLLNotifications::instance().add(\"MustAgreeToLogIn\", LLSD(), LLSD(), login_alert_done);\n\n\tif(self->mReplyPumpName != \"\")\n\t{\n\t\tLLEventPumps::instance().obtain(self->mReplyPumpName).post(LLSD(false));\n\t}\n\n\tself->mLoadCompleteCount = 0;  \/\/ reset counter for next time we come to TOS\n\tself->closeFloater(); \/\/ destroys this object\n}\n\n\/\/virtual \nvoid LLFloaterTOS::handleMediaEvent(LLPluginClassMedia* \/*self*\/, EMediaEvent event)\n{\n\tif(event == MEDIA_EVENT_NAVIGATE_COMPLETE)\n\t{\n\t\t\/\/ skip past the loading screen navigate complete\n\t\tif ( ++mLoadCompleteCount == 2 )\n\t\t{\n\t\t\tllinfos << \"NAVIGATE COMPLETE\" << llendl;\n\t\t\t\/\/ enable Agree to TOS radio button now that page has loaded\n\t\t\tLLCheckBoxCtrl * tos_agreement = getChild<LLCheckBoxCtrl>(\"agree_chk\");\n\t\t\ttos_agreement->setEnabled( true );\n\t\t}\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n\n\/**\n\n  Read one value from a modbus device\n\n  @param[out]  value\t\tthe value read, cast to an integer\n  @param[in]   device_var\tthe modbus device address\n  @param[in]   address\t\tthe offset of the value to be read in the device\n  @param[in]   retry_times\tthe number of times to retry on read failure before giving up\n\n  @return  0 if there were no errors\n\n  This does NOT lock the register_critical_section\n\n  *\/\nint modbus_read_one_value( \n\t\t\t\tint& value, \n\t\t\t\tunsigned char device_var,\n\t\t\t\tunsigned short address, \n\t\t\t\tint retry_times )\n{\n\n\tBOOL EnableRefreshTreeView_original_value = g_bEnableRefreshTreeView;\n\n\t\/** This will prevent a refresh of the tree view while we are doing the read\n\t It seems to be a sort of home made mutex.\n\t There are all sorts of probems with this, including the fact that the tree refresh\n\t is abandoned, not just delayed.\n\t But it is used in over 40 places in the rest of the code, so leave it alone\n\t *\/\n\tg_bEnableRefreshTreeView = false;\n\n\t\/\/ clear the value read from the device\n\tvalue = 0;\n\n\t\/\/ clear the error return flag\n\tint error_ret = 0;\n\n\t\/\/ clear the value\/error flag from the modbus DLL\n\tint j = 0;\n\n\t\/\/ loop over number of retries requested\n\tfor(int i=0;i<retry_times;i++)\n\t{\n\t\t\/\/ ensure no other threads attempt to access modbus communications\n\t\tCSingleLock singleLock(&register_critical_section);\n\t\tsingleLock.Lock();\n\n\t\t\/\/ call the modbus DLL method\n\t\tj=Read_One(device_var,address);\n\n\t\t\/\/ free the modbus communications for other threads\n\t\tsingleLock.Unlock();\n\n\t\t\/\/ increment the number of transmissions we have done\n\t\tg_llTxCount++;\n\n\t\t\/\/ check for no connection error\n\t\tif( j == -1 ) {\n\n\t\t\terror_ret = j;\n\n\t\t\t\/\/ give up\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ check for other errors\n\t\tif ( j == -2 || j == -3 ) {\n\n\t\t\terror_ret = j;\n\n\t\t\t\/\/ try again, if more retries available\n\t\t\tcontinue;\n\t\t}\n\n\n\t\t\/\/ increment the number or replies we have received\n\t\tg_llRxCount++;\n\n\t\t\/\/ set value that we received\n\t\tvalue = (int) j;\n\n\n\t\t\/\/ we have a good value, so no need to try again\n\t\tbreak;\n\n\t}\n\n\t\/\/ Special handling for a particular address  101\n\t\/\/ ( This probably should not be done here! \n\t\/\/ Presumably it is done because the old version\n\t\/\/ returned a negative value as an error flag\n\t\/\/ and it was neccessary to elude that check )\n\tif( address == 101 ) {\n\t\tif( value > 32767) {\n\t\t\t\/\/ assume this is a temperature below zero\n\t\t\tvalue = 0 - 65535 + value;\n\t\t}\n\t}\n\n\t\/\/ check for running in the main GUI thread\n\tif( AfxGetMainWnd()->GetActiveWindow() != NULL ) {\n\n\t\t\/\/ construct status message string\n\t\tCString str;\n\t\tstr.Format(_T(\"Addr:%d [Tx=%d Rx=%d Err=%d]\"), \n\t\t\tdevice_var, g_llTxCount, g_llRxCount, g_llTxCount-g_llRxCount);\n\n\t\t\/\/Display it\n\t\t((CMFCStatusBar *) AfxGetMainWnd()->GetDescendantWindow(AFX_IDW_STATUS_BAR))->SetPaneText(0,str.GetString());\n\n\t}\n\n\t\/**  Restore original value of tree refresh flag\n\n\tNote that we do an OR here, so if the flag has been set true somewhere else\n\tthen we will not set it false if it was false when we started.\n\n\t*\/\n\tg_bEnableRefreshTreeView |= EnableRefreshTreeView_original_value;\n\n\treturn error_ret;\n\n}\n\n\n\/**\n\n  Read multiple values from a modbus device\n\n  @param[out]  put_data_into_here\tthe values read\n  @param[in]   device_var\t\t\tthe modbus device address\n  @param[in]   start_address\t\tthe offset of thefirt value to be read in the device\n  @param[in]   length\t\t\t\tnumber of values to be read\n  @param[in]   retry_times\t\t\tthe number of times to retry on read failure before giving up\n\n  @return  negative if there were errors, otherwise length of data read\n\n  This does NOT lock the register_critical_section\n\n  *\/\nint modbus_read_multi_value( \n\t\tunsigned short *put_data_into_here,\n\t\tunsigned char device_var,\n\t\tunsigned short start_address,\n\t\tint length,\n\t\tint retry_times )\n{\n\tBOOL EnableRefreshTreeView_original_value = g_bEnableRefreshTreeView;\n\n\t\/** This will prevent a refresh of the tree view while we are doing the read\n\t It seems to be a sort of home made mutex.\n\t There are all sorts of probems with this, including the fact that the tree refresh\n\t is abandoned, not just delayed.\n\t But it is used in over 40 places in the rest of the code, so leave it alone\n\t *\/\n\tg_bEnableRefreshTreeView = false;\n\n\tint error=0;\n\tfor(int i=0;i<retry_times;i++)\n\t{\n\n\t\t\/\/ call the modbus DLL method\n\t\terror=read_multi(device_var,put_data_into_here,start_address,length);\n\n\t\t\/\/ increment the number of transmissions we have done\n\t\tg_llTxCount++;\n\n\t\t\/\/ accept any return other than -2\n\t\tif( error !=-2 )\n\t\t{\n\t\t\t\/\/ increment the number or replies we have received\n\t\t\tg_llRxCount++;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/ check for running in the main GUI thread\n\tif( AfxGetMainWnd()->GetActiveWindow() != NULL ) {\n\n\t\t\/\/ construct status message string\n\t\tCString str;\n\t\tstr.Format(_T(\"Addr:%d [Tx=%d Rx=%d Err=%d]\"), \n\t\t\tdevice_var, g_llTxCount, g_llRxCount, g_llTxCount-g_llRxCount);\n\n\t\t\/\/Display it\n\t\t((CMFCStatusBar *) AfxGetMainWnd()->GetDescendantWindow(AFX_IDW_STATUS_BAR))->SetPaneText(0,str.GetString());\n\n\t}\n\n\t\/**  Restore original value of tree refresh flag\n\n\tNote that we do an OR here, so if the flag has been set true somewhere else\n\tthen we will not set it false if it was false when we started.\n\n\t*\/\n\tg_bEnableRefreshTreeView |= EnableRefreshTreeView_original_value;\n\n\n\treturn error;\n}\n<commit_msg>Fix documentation mistake<commit_after>\n\n\/**\n\n  Read one value from a modbus device\n\n  @param[out]  value\t\tthe value read, cast to an integer\n  @param[in]   device_var\tthe modbus device address\n  @param[in]   address\t\tthe offset of the value to be read in the device\n  @param[in]   retry_times\tthe number of times to retry on read failure before giving up\n\n  @return  0 if there were no errors\n\n  This DOES lock the register_critical_section\n\n  *\/\nint modbus_read_one_value( \n\t\t\t\tint& value, \n\t\t\t\tunsigned char device_var,\n\t\t\t\tunsigned short address, \n\t\t\t\tint retry_times )\n{\n\n\tBOOL EnableRefreshTreeView_original_value = g_bEnableRefreshTreeView;\n\n\t\/** This will prevent a refresh of the tree view while we are doing the read\n\t It seems to be a sort of home made mutex.\n\t There are all sorts of probems with this, including the fact that the tree refresh\n\t is abandoned, not just delayed.\n\t But it is used in over 40 places in the rest of the code, so leave it alone\n\t *\/\n\tg_bEnableRefreshTreeView = false;\n\n\t\/\/ clear the value read from the device\n\tvalue = 0;\n\n\t\/\/ clear the error return flag\n\tint error_ret = 0;\n\n\t\/\/ clear the value\/error flag from the modbus DLL\n\tint j = 0;\n\n\t\/\/ loop over number of retries requested\n\tfor(int i=0;i<retry_times;i++)\n\t{\n\t\t\/\/ ensure no other threads attempt to access modbus communications\n\t\tCSingleLock singleLock(&register_critical_section);\n\t\tsingleLock.Lock();\n\n\t\t\/\/ call the modbus DLL method\n\t\tj=Read_One(device_var,address);\n\n\t\t\/\/ free the modbus communications for other threads\n\t\tsingleLock.Unlock();\n\n\t\t\/\/ increment the number of transmissions we have done\n\t\tg_llTxCount++;\n\n\t\t\/\/ check for no connection error\n\t\tif( j == -1 ) {\n\n\t\t\terror_ret = j;\n\n\t\t\t\/\/ give up\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ check for other errors\n\t\tif ( j == -2 || j == -3 ) {\n\n\t\t\terror_ret = j;\n\n\t\t\t\/\/ try again, if more retries available\n\t\t\tcontinue;\n\t\t}\n\n\n\t\t\/\/ increment the number or replies we have received\n\t\tg_llRxCount++;\n\n\t\t\/\/ set value that we received\n\t\tvalue = (int) j;\n\n\n\t\t\/\/ we have a good value, so no need to try again\n\t\tbreak;\n\n\t}\n\n\t\/\/ Special handling for a particular address  101\n\t\/\/ ( This probably should not be done here! \n\t\/\/ Presumably it is done because the old version\n\t\/\/ returned a negative value as an error flag\n\t\/\/ and it was neccessary to elude that check )\n\tif( address == 101 ) {\n\t\tif( value > 32767) {\n\t\t\t\/\/ assume this is a temperature below zero\n\t\t\tvalue = 0 - 65535 + value;\n\t\t}\n\t}\n\n\t\/\/ check for running in the main GUI thread\n\tif( AfxGetMainWnd()->GetActiveWindow() != NULL ) {\n\n\t\t\/\/ construct status message string\n\t\tCString str;\n\t\tstr.Format(_T(\"Addr:%d [Tx=%d Rx=%d Err=%d]\"), \n\t\t\tdevice_var, g_llTxCount, g_llRxCount, g_llTxCount-g_llRxCount);\n\n\t\t\/\/Display it\n\t\t((CMFCStatusBar *) AfxGetMainWnd()->GetDescendantWindow(AFX_IDW_STATUS_BAR))->SetPaneText(0,str.GetString());\n\n\t}\n\n\t\/**  Restore original value of tree refresh flag\n\n\tNote that we do an OR here, so if the flag has been set true somewhere else\n\tthen we will not set it false if it was false when we started.\n\n\t*\/\n\tg_bEnableRefreshTreeView |= EnableRefreshTreeView_original_value;\n\n\treturn error_ret;\n\n}\n\n\n\/**\n\n  Read multiple values from a modbus device\n\n  @param[out]  put_data_into_here\tthe values read\n  @param[in]   device_var\t\t\tthe modbus device address\n  @param[in]   start_address\t\tthe offset of thefirt value to be read in the device\n  @param[in]   length\t\t\t\tnumber of values to be read\n  @param[in]   retry_times\t\t\tthe number of times to retry on read failure before giving up\n\n  @return  negative if there were errors, otherwise length of data read\n\n  This does NOT lock the register_critical_section\n\n  *\/\nint modbus_read_multi_value( \n\t\tunsigned short *put_data_into_here,\n\t\tunsigned char device_var,\n\t\tunsigned short start_address,\n\t\tint length,\n\t\tint retry_times )\n{\n\tBOOL EnableRefreshTreeView_original_value = g_bEnableRefreshTreeView;\n\n\t\/** This will prevent a refresh of the tree view while we are doing the read\n\t It seems to be a sort of home made mutex.\n\t There are all sorts of probems with this, including the fact that the tree refresh\n\t is abandoned, not just delayed.\n\t But it is used in over 40 places in the rest of the code, so leave it alone\n\t *\/\n\tg_bEnableRefreshTreeView = false;\n\n\tint error=0;\n\tfor(int i=0;i<retry_times;i++)\n\t{\n\n\t\t\/\/ call the modbus DLL method\n\t\terror=read_multi(device_var,put_data_into_here,start_address,length);\n\n\t\t\/\/ increment the number of transmissions we have done\n\t\tg_llTxCount++;\n\n\t\t\/\/ accept any return other than -2\n\t\tif( error !=-2 )\n\t\t{\n\t\t\t\/\/ increment the number or replies we have received\n\t\t\tg_llRxCount++;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/ check for running in the main GUI thread\n\tif( AfxGetMainWnd()->GetActiveWindow() != NULL ) {\n\n\t\t\/\/ construct status message string\n\t\tCString str;\n\t\tstr.Format(_T(\"Addr:%d [Tx=%d Rx=%d Err=%d]\"), \n\t\t\tdevice_var, g_llTxCount, g_llRxCount, g_llTxCount-g_llRxCount);\n\n\t\t\/\/Display it\n\t\t((CMFCStatusBar *) AfxGetMainWnd()->GetDescendantWindow(AFX_IDW_STATUS_BAR))->SetPaneText(0,str.GetString());\n\n\t}\n\n\t\/**  Restore original value of tree refresh flag\n\n\tNote that we do an OR here, so if the flag has been set true somewhere else\n\tthen we will not set it false if it was false when we started.\n\n\t*\/\n\tg_bEnableRefreshTreeView |= EnableRefreshTreeView_original_value;\n\n\n\treturn error;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* mbed Microcontroller Library\n * Copyright (c) 2017 ARM Limited\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 !DEVICE_RTC\n    #error [NOT_SUPPORTED] RTC API not supported for this target\n#endif\n\n#include \"utest\/utest.h\"\n#include \"unity\/unity.h\"\n#include \"greentea-client\/test_env.h\"\n#include \"rtc_test.h\"\n\n#include \"mbed.h\"\n#include \"rtc_api.h\"\n\nusing namespace utest::v1;\n\nstatic const uint32_t WAIT_TIME = 4;\nstatic const uint32_t WAIT_TOLERANCE = 1;\n\n#define US_PER_SEC 1000000\n#define ACCURACY_FACTOR 10\n\nstatic const uint32_t DELAY_4S = 4;\nstatic const uint32_t DELAY_10S = 10;\nstatic const uint32_t RTC_TOLERANCE = 1;\nstatic const uint32_t TOLERANCE_ACCURACY_US = (DELAY_10S * US_PER_SEC \/ ACCURACY_FACTOR);\n\n#if DEVICE_LOWPOWERTIMER\nvolatile bool expired;\n\nvoid callback(void)\n{\n    expired = true;\n}\n\n\/* Auxiliary function to test if RTC continue counting in\n * sleep and deep-sleep modes. *\/\nvoid rtc_sleep_test_support (bool deepsleep_mode)\n{\n    LowPowerTimeout timeout;\n    const uint32_t start = 100;\n    expired = false;\n\n    \/*\n     * Since deepsleep() may shut down the UART peripheral, we wait for 10ms\n     * to allow for hardware serial buffers to completely flush.\n     * This should be replaced with a better function that checks if the\n     * hardware buffers are empty. However, such an API does not exist now,\n     * so we'll use the wait_ms() function for now.\n     *\/\n    wait_ms(10);\n\n    rtc_init();\n\n    if(deepsleep_mode == false) {\n        sleep_manager_lock_deep_sleep();\n    }\n\n    rtc_write(start);\n\n    timeout.attach(callback, DELAY_4S);\n\n    TEST_ASSERT(sleep_manager_can_deep_sleep() == deepsleep_mode);\n\n    while(!expired) sleep();\n\n    const uint32_t stop = rtc_read();\n\n    TEST_ASSERT_UINT32_WITHIN(RTC_TOLERANCE, DELAY_4S, stop - start);\n\n    timeout.detach();\n\n    if(deepsleep_mode == false) {\n        sleep_manager_unlock_deep_sleep();\n    }\n\n    rtc_free();\n}\n#endif\n\n\/* Test that ::rtc_init can be called multiple times. *\/\nvoid rtc_init_test()\n{\n    for (int i = 0; i < 10; i++) {\n        rtc_init();\n    }\n\n    rtc_free();\n}\n\n#if DEVICE_LOWPOWERTIMER\n\/** Test that the RTC keeps counting in the various sleep modes. *\/\n\nvoid rtc_sleep_test()\n{\n    \/* Test sleep mode. *\/\n    rtc_sleep_test_support(false);\n\n    \/* Test deep-sleep mode. *\/\n    rtc_sleep_test_support(true);\n}\n#endif\n\n\/* Test that the RTC keeps counting even after ::rtc_free has been called. *\/\nvoid rtc_persist_test()\n{\n    const uint32_t start = 100;\n    rtc_init();\n    rtc_write(start);\n    rtc_free();\n\n    wait(WAIT_TIME);\n\n    rtc_init();\n    const uint32_t stop = rtc_read();\n    const int enabled = rtc_isenabled();\n    rtc_free();\n\n    TEST_ASSERT_TRUE(enabled);\n    TEST_ASSERT_UINT32_WITHIN(WAIT_TOLERANCE, WAIT_TIME, stop - start);\n}\n\n\/* Test time does not glitch backwards due to an incorrectly implemented ripple counter driver. *\/\nvoid rtc_glitch_test()\n{\n    const uint32_t start = 0xffffe;\n    rtc_init();\n\n    rtc_write(start);\n    uint32_t last = start;\n    while (last < start + 4) {\n        const uint32_t cur = rtc_read();\n        TEST_ASSERT(cur >= last);\n        last = cur;\n    }\n\n    rtc_free();\n}\n\n\/* Test that the RTC correctly handles different time values. *\/\nvoid rtc_range_test()\n{\n    static const uint32_t starts[] = {\n            0x00000000,\n            0xEFFFFFFF,\n            0x00001000,\n            0x00010000,\n    };\n\n    rtc_init();\n    for (uint32_t i = 0; i < sizeof(starts) \/ sizeof(starts[0]); i++) {\n        const uint32_t start = starts[i];\n        rtc_write(start);\n        wait(WAIT_TIME);\n        const uint32_t stop = rtc_read();\n        TEST_ASSERT_UINT32_WITHIN(WAIT_TOLERANCE, WAIT_TIME, stop - start);\n    }\n    rtc_free();\n}\n\n\/* Test that the RTC accuracy is at least 10%. *\/\nvoid rtc_accuracy_test()\n{\n    Timer timer1;\n\n    const uint32_t start = 100;\n    rtc_init();\n    rtc_write(start);\n\n    timer1.start();\n    while(rtc_read() < (start + DELAY_10S)) {\n        \/* Just wait. *\/\n    }\n    timer1.stop();\n\n    \/* RTC accuracy is at least 10%. *\/\n    TEST_ASSERT_INT32_WITHIN(TOLERANCE_ACCURACY_US, DELAY_10S * US_PER_SEC, timer1.read_us());\n}\n\n\/* Test that ::rtc_write\/::rtc_read functions provides availability to set\/get RTC time. *\/\nvoid rtc_write_read_test()\n{\n    static const uint32_t rtc_init_val = 100;\n\n    rtc_init();\n\n    for (int i = 0; i < 3; i++) {\n        const uint32_t init_val = (rtc_init_val + i * rtc_init_val);\n\n        core_util_critical_section_enter();\n\n        rtc_write(init_val);\n        const uint32_t read_val = rtc_read();\n\n        core_util_critical_section_exit();\n\n        \/* No tolerance is provided since we should have 1 second to\n         * execute this case after the RTC time is set.\n         *\/\n        TEST_ASSERT_EQUAL_UINT32(init_val, read_val);\n    }\n\n    rtc_free();\n}\n\n\/* Test that ::is_enabled function returns 1 if the RTC is counting and the time has been set, 0 otherwise. *\/\nvoid rtc_enabled_test()\n{\n    rtc_init();\n    TEST_ASSERT_EQUAL_INT(0, rtc_isenabled());\n    rtc_write(0);\n    TEST_ASSERT_EQUAL_INT(1, rtc_isenabled());\n    rtc_free();\n}\n\nCase cases[] = {\n    Case(\"RTC - init\", rtc_init_test),\n#if DEVICE_LOWPOWERTIMER\n    Case(\"RTC - sleep\", rtc_sleep_test),\n#endif\n    Case(\"RTC - persist\", rtc_persist_test),\n    Case(\"RTC - glitch\", rtc_glitch_test),\n    Case(\"RTC - range\", rtc_range_test),\n    Case(\"RTC - accuracy\", rtc_accuracy_test),\n    Case(\"RTC - write\/read\", rtc_write_read_test),\n    Case(\"RTC - enabled\", rtc_enabled_test),\n};\n\nutest::v1::status_t greentea_test_setup(const size_t number_of_cases)\n{\n    GREENTEA_SETUP(30, \"default_auto\");\n    return greentea_test_setup_handler(number_of_cases);\n}\n\nSpecification specification(greentea_test_setup, cases, greentea_test_teardown_handler);\n\nint main()\n{\n    Harness::run(specification);\n}\n<commit_msg>HAL rtc test: check only if rtc_isenabled() returns 1 in case when init is done.<commit_after>\/* mbed Microcontroller Library\n * Copyright (c) 2017 ARM Limited\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 !DEVICE_RTC\n    #error [NOT_SUPPORTED] RTC API not supported for this target\n#endif\n\n#include \"utest\/utest.h\"\n#include \"unity\/unity.h\"\n#include \"greentea-client\/test_env.h\"\n#include \"rtc_test.h\"\n\n#include \"mbed.h\"\n#include \"rtc_api.h\"\n\nusing namespace utest::v1;\n\nstatic const uint32_t WAIT_TIME = 4;\nstatic const uint32_t WAIT_TOLERANCE = 1;\n\n#define US_PER_SEC 1000000\n#define ACCURACY_FACTOR 10\n\nstatic const uint32_t DELAY_4S = 4;\nstatic const uint32_t DELAY_10S = 10;\nstatic const uint32_t RTC_TOLERANCE = 1;\nstatic const uint32_t TOLERANCE_ACCURACY_US = (DELAY_10S * US_PER_SEC \/ ACCURACY_FACTOR);\n\n#if DEVICE_LOWPOWERTIMER\nvolatile bool expired;\n\nvoid callback(void)\n{\n    expired = true;\n}\n\n\/* Auxiliary function to test if RTC continue counting in\n * sleep and deep-sleep modes. *\/\nvoid rtc_sleep_test_support (bool deepsleep_mode)\n{\n    LowPowerTimeout timeout;\n    const uint32_t start = 100;\n    expired = false;\n\n    \/*\n     * Since deepsleep() may shut down the UART peripheral, we wait for 10ms\n     * to allow for hardware serial buffers to completely flush.\n     * This should be replaced with a better function that checks if the\n     * hardware buffers are empty. However, such an API does not exist now,\n     * so we'll use the wait_ms() function for now.\n     *\/\n    wait_ms(10);\n\n    rtc_init();\n\n    if(deepsleep_mode == false) {\n        sleep_manager_lock_deep_sleep();\n    }\n\n    rtc_write(start);\n\n    timeout.attach(callback, DELAY_4S);\n\n    TEST_ASSERT(sleep_manager_can_deep_sleep() == deepsleep_mode);\n\n    while(!expired) sleep();\n\n    const uint32_t stop = rtc_read();\n\n    TEST_ASSERT_UINT32_WITHIN(RTC_TOLERANCE, DELAY_4S, stop - start);\n\n    timeout.detach();\n\n    if(deepsleep_mode == false) {\n        sleep_manager_unlock_deep_sleep();\n    }\n\n    rtc_free();\n}\n#endif\n\n\/* Test that ::rtc_init can be called multiple times. *\/\nvoid rtc_init_test()\n{\n    for (int i = 0; i < 10; i++) {\n        rtc_init();\n    }\n\n    rtc_free();\n}\n\n#if DEVICE_LOWPOWERTIMER\n\/** Test that the RTC keeps counting in the various sleep modes. *\/\n\nvoid rtc_sleep_test()\n{\n    \/* Test sleep mode. *\/\n    rtc_sleep_test_support(false);\n\n    \/* Test deep-sleep mode. *\/\n    rtc_sleep_test_support(true);\n}\n#endif\n\n\/* Test that the RTC keeps counting even after ::rtc_free has been called. *\/\nvoid rtc_persist_test()\n{\n    const uint32_t start = 100;\n    rtc_init();\n    rtc_write(start);\n    rtc_free();\n\n    wait(WAIT_TIME);\n\n    rtc_init();\n    const uint32_t stop = rtc_read();\n    const int enabled = rtc_isenabled();\n    rtc_free();\n\n    TEST_ASSERT_TRUE(enabled);\n    TEST_ASSERT_UINT32_WITHIN(WAIT_TOLERANCE, WAIT_TIME, stop - start);\n}\n\n\/* Test time does not glitch backwards due to an incorrectly implemented ripple counter driver. *\/\nvoid rtc_glitch_test()\n{\n    const uint32_t start = 0xffffe;\n    rtc_init();\n\n    rtc_write(start);\n    uint32_t last = start;\n    while (last < start + 4) {\n        const uint32_t cur = rtc_read();\n        TEST_ASSERT(cur >= last);\n        last = cur;\n    }\n\n    rtc_free();\n}\n\n\/* Test that the RTC correctly handles different time values. *\/\nvoid rtc_range_test()\n{\n    static const uint32_t starts[] = {\n            0x00000000,\n            0xEFFFFFFF,\n            0x00001000,\n            0x00010000,\n    };\n\n    rtc_init();\n    for (uint32_t i = 0; i < sizeof(starts) \/ sizeof(starts[0]); i++) {\n        const uint32_t start = starts[i];\n        rtc_write(start);\n        wait(WAIT_TIME);\n        const uint32_t stop = rtc_read();\n        TEST_ASSERT_UINT32_WITHIN(WAIT_TOLERANCE, WAIT_TIME, stop - start);\n    }\n    rtc_free();\n}\n\n\/* Test that the RTC accuracy is at least 10%. *\/\nvoid rtc_accuracy_test()\n{\n    Timer timer1;\n\n    const uint32_t start = 100;\n    rtc_init();\n    rtc_write(start);\n\n    timer1.start();\n    while(rtc_read() < (start + DELAY_10S)) {\n        \/* Just wait. *\/\n    }\n    timer1.stop();\n\n    \/* RTC accuracy is at least 10%. *\/\n    TEST_ASSERT_INT32_WITHIN(TOLERANCE_ACCURACY_US, DELAY_10S * US_PER_SEC, timer1.read_us());\n}\n\n\/* Test that ::rtc_write\/::rtc_read functions provides availability to set\/get RTC time. *\/\nvoid rtc_write_read_test()\n{\n    static const uint32_t rtc_init_val = 100;\n\n    rtc_init();\n\n    for (int i = 0; i < 3; i++) {\n        const uint32_t init_val = (rtc_init_val + i * rtc_init_val);\n\n        core_util_critical_section_enter();\n\n        rtc_write(init_val);\n        const uint32_t read_val = rtc_read();\n\n        core_util_critical_section_exit();\n\n        \/* No tolerance is provided since we should have 1 second to\n         * execute this case after the RTC time is set.\n         *\/\n        TEST_ASSERT_EQUAL_UINT32(init_val, read_val);\n    }\n\n    rtc_free();\n}\n\n\/* Test that ::is_enabled function returns 1 if the RTC is counting and the time has been set. *\/\nvoid rtc_enabled_test()\n{\n    \/* Since some platforms use RTC for low power timer RTC may be already enabled.\n     * Because of that we will only verify if rtc_isenabled() returns 1 in case when init is done\n     * and RTC time is set.\n     *\/\n\n    rtc_init();\n    rtc_write(0);\n    TEST_ASSERT_EQUAL_INT(1, rtc_isenabled());\n    rtc_free();\n}\n\nCase cases[] = {\n    Case(\"RTC - init\", rtc_init_test),\n#if DEVICE_LOWPOWERTIMER\n    Case(\"RTC - sleep\", rtc_sleep_test),\n#endif\n    Case(\"RTC - persist\", rtc_persist_test),\n    Case(\"RTC - glitch\", rtc_glitch_test),\n    Case(\"RTC - range\", rtc_range_test),\n    Case(\"RTC - accuracy\", rtc_accuracy_test),\n    Case(\"RTC - write\/read\", rtc_write_read_test),\n    Case(\"RTC - enabled\", rtc_enabled_test),\n};\n\nutest::v1::status_t greentea_test_setup(const size_t number_of_cases)\n{\n    GREENTEA_SETUP(30, \"default_auto\");\n    return greentea_test_setup_handler(number_of_cases);\n}\n\nSpecification specification(greentea_test_setup, cases, greentea_test_teardown_handler);\n\nint main()\n{\n    Harness::run(specification);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n#include \"classad\/common.h\"\n#include \"classad\/source.h\"\n#include \"classad\/matchClassad.h\"\n\nusing namespace std;\n\nstatic char const *ATTR_UNOPTIMIZED_REQUIREMENTS = \"UnoptimizedRequirements\";\n\nBEGIN_NAMESPACE( classad )\n\nMatchClassAd::\nMatchClassAd()\n{\n\tlCtx = rCtx = NULL;\n\tlad = rad = NULL;\n\tladParent = radParent = NULL;\n\tInitMatchClassAd( NULL, NULL );\n}\n\n\nMatchClassAd::\nMatchClassAd( ClassAd *adl, ClassAd *adr ) : ClassAd()\n{\n\tlad = rad = lCtx = rCtx = NULL;\n\tladParent = radParent = NULL;\n\tInitMatchClassAd( adl, adr );\n}\n\n\nMatchClassAd::\n~MatchClassAd()\n{\n}\n\n\nMatchClassAd* MatchClassAd::\nMakeMatchClassAd( ClassAd *adl, ClassAd *adr )\n{\n\treturn( new MatchClassAd( adl, adr ) );\n}\n\nbool MatchClassAd::\nInitMatchClassAd( ClassAd *adl, ClassAd *adr )\n{\n\tClassAdParser parser;\n\n\t\t\/\/ clear out old info\n\tClear( );\n\tlad = rad = NULL;\n\tlCtx = rCtx = NULL;\n\n\t\t\/\/ convenience expressions\n\tClassAd *upd;\n\tif( !( upd = parser.ParseClassAd( \n\t\t\t\"[symmetricMatch = RIGHT.requirements && LEFT.requirements ;\"\n\t\t\t\"leftMatchesRight = RIGHT.requirements ;\"\n\t\t\t\"rightMatchesLeft = LEFT.requirements ;\"\n\t\t\t\"leftRankValue = LEFT.rank ;\"\n\t\t\t\"rightRankValue = RIGHT.rank]\" ) ) ) {\n\t\tClear( );\n\t\tlCtx = NULL;\n\t\trCtx = NULL;\n\t\treturn( false );\n\t}\n\tUpdate( *upd );\n\tdelete upd;\n\n\t\t\/\/ In the following, global-scope references to LEFT and RIGHT\n\t\t\/\/ are used to make things slightly more efficient.  That means\n\t\t\/\/ that this match ad should not be nested inside other ads.\n\t\t\/\/ Also for effiency, the left and right ads are actually\n\t\t\/\/ inserted as .LEFT and .RIGHT (ie at the top level) but\n\t\t\/\/ their parent scope is set to the lCtx and rCtx ads as\n\t\t\/\/ though they were inserted as lCtx.ad and rCtx.ad.  This way,\n\t\t\/\/ the most direct way to reference the ads is through the\n\t\t\/\/ top-level global names .LEFT and .RIGHT.\n\n\t\t\/\/ the left context\n\tif( !( lCtx = parser.ParseClassAd( \n\t\t\t\"[other=.RIGHT;target=.RIGHT;my=.LEFT;ad=.LEFT]\" ) ) ) {\n\t\tClear( );\n\t\tlCtx = NULL;\n\t\trCtx = NULL;\n\t\treturn( false );\n\t}\n\n\t\t\/\/ the right context\n\tif( !( rCtx = parser.ParseClassAd( \n\t\t\t\"[other=.LEFT;target=.LEFT;my=.RIGHT;ad=.RIGHT]\" ) ) ) {\n\t\tdelete lCtx;\n\t\tlCtx = rCtx = NULL;\n\t\treturn( false );\n\t}\n\n\t\t\/\/ insert the left and right contexts\n\tInsert( \"lCtx\", lCtx );\n\tInsert( \"rCtx\", rCtx );\n\n\tif( !adl ) {\n\t\tadl = new ClassAd();\n\t}\n\tif( !adr ) {\n\t\tadr = new ClassAd();\n\t}\n\tReplaceLeftAd( adl );\n\tReplaceRightAd( adr );\n\n\treturn( true );\n}\n\n\nbool MatchClassAd::\nReplaceLeftAd( ClassAd *ad )\n{\n\tlad = ad;\n\tladParent = lad ? lad->GetParentScope( ) : (ClassAd*)NULL;\n\tif( ad ) {\n\t\tif( !Insert( \"LEFT\", ad ) ) {\n\t\t\treturn false;\n\t\t}\n\t\t\t\/\/ For the ability to efficiently reference the ad via\n\t\t\t\/\/ .LEFT, it is inserted in the top match ad, but we want\n\t\t\t\/\/ its parent scope to be the context ad.\n\t\tlad->SetParentScope( lCtx );\n\t}\n\treturn true;\n}\n\n\nbool MatchClassAd::\nReplaceRightAd( ClassAd *ad )\n{\n\trad = ad;\n\tradParent = rad ? rad->GetParentScope( ) : (ClassAd*)NULL;\n\tif( ad ) {\n\t\tif( !Insert( \"RIGHT\", ad ) ) {\n\t\t\treturn false;\n\t\t}\n\t\t\t\/\/ For the ability to efficiently reference the ad via\n\t\t\t\/\/ .RIGHT, it is inserted in the top match ad, but we want\n\t\t\t\/\/ its parent scope to be the context ad.\n\t\trad->SetParentScope( rCtx );\n\t}\n\treturn true;\n}\n\n\nClassAd *MatchClassAd::\nGetLeftAd()\n{\n\treturn( lad );\n}\n\n\nClassAd *MatchClassAd::\nGetRightAd()\n{\n\treturn( rad );\n}\n\n\nClassAd *MatchClassAd::\nGetLeftContext( )\n{\n\treturn( lCtx );\n}\n\n\nClassAd *MatchClassAd::\nGetRightContext( )\n{\n\treturn( rCtx );\n}\n\n\nClassAd *MatchClassAd::\nRemoveLeftAd( )\n{\n\tClassAd *ad = lad;\n\tRemove( \"LEFT\" );\n\tif( lad ) {\n\t\tlad->SetParentScope( ladParent );\n\t}\n\tladParent = NULL;\n\tlad = NULL;\n\treturn( ad );\n}\n\n\nClassAd *MatchClassAd::\nRemoveRightAd( )\n{\n\tClassAd\t*ad = rad;\n\tRemove( \"RIGHT\" );\n\tif( rad ) {\n\t\trad->SetParentScope( radParent );\n\t}\n\tradParent = NULL;\n\trad = NULL;\n\treturn( ad );\n}\n\nbool MatchClassAd::\nOptimizeRightAdForMatchmaking( ClassAd *ad, std::string *error_msg )\n{\n\treturn OptimizeAdForMatchmaking( ad, true, error_msg );\n}\n\nbool MatchClassAd::\nOptimizeLeftAdForMatchmaking( ClassAd *ad, std::string *error_msg )\n{\n\treturn OptimizeAdForMatchmaking( ad, false, error_msg );\n}\n\nbool MatchClassAd::\nOptimizeAdForMatchmaking( ClassAd *ad, bool is_right, std::string *error_msg )\n{\n\tif( ad->Lookup(\"my\") ||\n\t\tad->Lookup(\"target\") ||\n\t\tad->Lookup(\"other\") ||\n\t\tad->Lookup(ATTR_UNOPTIMIZED_REQUIREMENTS) )\n\t{\n\t\tif( error_msg ) {\n\t\t\t*error_msg = \"Optimization of matchmaking requirements failed, because ad already contains one of my, target, other, or UnoptimizedRequirements.\";\n\t\t}\n\t\treturn false;\n\t}\n\n\tExprTree *requirements = ad->Lookup(ATTR_REQUIREMENTS);\n\tif( !requirements ) {\n\t\tif( error_msg ) {\n\t\t\t*error_msg = \"No requirements found in ad to be optimized.\";\n\t\t}\n\t\treturn false;\n\t}\n\n\t\t\/\/ insert \"my\" into this ad so that references that use it\n\t\t\/\/ can be flattened\n\tValue me;\n\tme.SetClassAdValue( ad );\n\tad->Insert(\"my\",Literal::MakeLiteral(me));\n\n\t\t\/\/ insert \"target\" and \"other\" into this ad so references can be\n\t\t\/\/ _partially_ flattened to the more efficient .RIGHT or .LEFT\n\tchar const *other = is_right ? \"LEFT\" : \"RIGT\";\n\tExprTree *target =\n\t\tAttributeReference::MakeAttributeReference(NULL,other,true);\n\tad->Insert(\"target\",target);\n\tad->Insert(\"other\",target);\n\n\n\tExprTree *flat_requirements = NULL;\n\tValue flat_val;\n\n\tif( ad->FlattenAndInline(requirements,flat_val,flat_requirements) ) {\n\t\tif( !flat_requirements ) {\n\t\t\t\t\/\/ flattened to a value\n\t\t\tflat_requirements = classad::Literal::MakeLiteral(flat_val);\n\t\t}\n\t\tif( flat_requirements ) {\n\t\t\t\t\/\/ save original requirements\n\t\t\tExprTree *orig_requirements = ad->Remove(ATTR_REQUIREMENTS);\n\t\t\tif( orig_requirements ) {\n\t\t\t\tif( !ad->Insert(ATTR_UNOPTIMIZED_REQUIREMENTS,orig_requirements) )\n\t\t\t\t{\n\t\t\t\t\t\t\/\/ Now we have no requirements.  Very bad!\n\t\t\t\t\tif( error_msg ) {\n\t\t\t\t\t\t*error_msg = \"Failed to rename original requirements.\";\n\t\t\t\t\t}\n\t\t\t\t\tdelete orig_requirements;\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\t\/\/ insert new flattened requirements\n\t\t\tif( !ad->Insert(ATTR_REQUIREMENTS,flat_requirements) ) {\n\t\t\t\tif( error_msg ) {\n\t\t\t\t\t*error_msg = \"Failed to insert optimized requirements.\";\n\t\t\t\t}\n\t\t\t\tdelete flat_requirements;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t\t\/\/ After flatenning, no references should remain to MY or TARGET.\n\t\t\/\/ Even if there are, those can be resolved by the context ads, so\n\t\t\/\/ we don't need to leave these attributes in the ad.\n\tad->Delete(\"my\");\n\tad->Remove(\"other\"); \/\/ this is a pointer to same object as target\n\tad->Delete(\"target\");\n\n\treturn true;\n}\n\nbool MatchClassAd::\nUnoptimizeAdForMatchmaking( ClassAd *ad )\n{\n\tExprTree *orig_requirements = ad->Remove(ATTR_UNOPTIMIZED_REQUIREMENTS);\n\tif( orig_requirements ) {\n\t\tif( !ad->Insert(ATTR_REQUIREMENTS,orig_requirements) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nEND_NAMESPACE \/\/ classad\n<commit_msg>Fix bad namespace usage in MatchClassAd.<commit_after>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n#include \"classad\/common.h\"\n#include \"classad\/source.h\"\n#include \"classad\/matchClassad.h\"\n\nusing namespace std;\n\nstatic char const *ATTR_UNOPTIMIZED_REQUIREMENTS = \"UnoptimizedRequirements\";\n\nBEGIN_NAMESPACE( classad )\n\nMatchClassAd::\nMatchClassAd()\n{\n\tlCtx = rCtx = NULL;\n\tlad = rad = NULL;\n\tladParent = radParent = NULL;\n\tInitMatchClassAd( NULL, NULL );\n}\n\n\nMatchClassAd::\nMatchClassAd( ClassAd *adl, ClassAd *adr ) : ClassAd()\n{\n\tlad = rad = lCtx = rCtx = NULL;\n\tladParent = radParent = NULL;\n\tInitMatchClassAd( adl, adr );\n}\n\n\nMatchClassAd::\n~MatchClassAd()\n{\n}\n\n\nMatchClassAd* MatchClassAd::\nMakeMatchClassAd( ClassAd *adl, ClassAd *adr )\n{\n\treturn( new MatchClassAd( adl, adr ) );\n}\n\nbool MatchClassAd::\nInitMatchClassAd( ClassAd *adl, ClassAd *adr )\n{\n\tClassAdParser parser;\n\n\t\t\/\/ clear out old info\n\tClear( );\n\tlad = rad = NULL;\n\tlCtx = rCtx = NULL;\n\n\t\t\/\/ convenience expressions\n\tClassAd *upd;\n\tif( !( upd = parser.ParseClassAd( \n\t\t\t\"[symmetricMatch = RIGHT.requirements && LEFT.requirements ;\"\n\t\t\t\"leftMatchesRight = RIGHT.requirements ;\"\n\t\t\t\"rightMatchesLeft = LEFT.requirements ;\"\n\t\t\t\"leftRankValue = LEFT.rank ;\"\n\t\t\t\"rightRankValue = RIGHT.rank]\" ) ) ) {\n\t\tClear( );\n\t\tlCtx = NULL;\n\t\trCtx = NULL;\n\t\treturn( false );\n\t}\n\tUpdate( *upd );\n\tdelete upd;\n\n\t\t\/\/ In the following, global-scope references to LEFT and RIGHT\n\t\t\/\/ are used to make things slightly more efficient.  That means\n\t\t\/\/ that this match ad should not be nested inside other ads.\n\t\t\/\/ Also for effiency, the left and right ads are actually\n\t\t\/\/ inserted as .LEFT and .RIGHT (ie at the top level) but\n\t\t\/\/ their parent scope is set to the lCtx and rCtx ads as\n\t\t\/\/ though they were inserted as lCtx.ad and rCtx.ad.  This way,\n\t\t\/\/ the most direct way to reference the ads is through the\n\t\t\/\/ top-level global names .LEFT and .RIGHT.\n\n\t\t\/\/ the left context\n\tif( !( lCtx = parser.ParseClassAd( \n\t\t\t\"[other=.RIGHT;target=.RIGHT;my=.LEFT;ad=.LEFT]\" ) ) ) {\n\t\tClear( );\n\t\tlCtx = NULL;\n\t\trCtx = NULL;\n\t\treturn( false );\n\t}\n\n\t\t\/\/ the right context\n\tif( !( rCtx = parser.ParseClassAd( \n\t\t\t\"[other=.LEFT;target=.LEFT;my=.RIGHT;ad=.RIGHT]\" ) ) ) {\n\t\tdelete lCtx;\n\t\tlCtx = rCtx = NULL;\n\t\treturn( false );\n\t}\n\n\t\t\/\/ insert the left and right contexts\n\tInsert( \"lCtx\", lCtx );\n\tInsert( \"rCtx\", rCtx );\n\n\tif( !adl ) {\n\t\tadl = new ClassAd();\n\t}\n\tif( !adr ) {\n\t\tadr = new ClassAd();\n\t}\n\tReplaceLeftAd( adl );\n\tReplaceRightAd( adr );\n\n\treturn( true );\n}\n\n\nbool MatchClassAd::\nReplaceLeftAd( ClassAd *ad )\n{\n\tlad = ad;\n\tladParent = lad ? lad->GetParentScope( ) : (ClassAd*)NULL;\n\tif( ad ) {\n\t\tif( !Insert( \"LEFT\", ad ) ) {\n\t\t\treturn false;\n\t\t}\n\t\t\t\/\/ For the ability to efficiently reference the ad via\n\t\t\t\/\/ .LEFT, it is inserted in the top match ad, but we want\n\t\t\t\/\/ its parent scope to be the context ad.\n\t\tlad->SetParentScope( lCtx );\n\t}\n\treturn true;\n}\n\n\nbool MatchClassAd::\nReplaceRightAd( ClassAd *ad )\n{\n\trad = ad;\n\tradParent = rad ? rad->GetParentScope( ) : (ClassAd*)NULL;\n\tif( ad ) {\n\t\tif( !Insert( \"RIGHT\", ad ) ) {\n\t\t\treturn false;\n\t\t}\n\t\t\t\/\/ For the ability to efficiently reference the ad via\n\t\t\t\/\/ .RIGHT, it is inserted in the top match ad, but we want\n\t\t\t\/\/ its parent scope to be the context ad.\n\t\trad->SetParentScope( rCtx );\n\t}\n\treturn true;\n}\n\n\nClassAd *MatchClassAd::\nGetLeftAd()\n{\n\treturn( lad );\n}\n\n\nClassAd *MatchClassAd::\nGetRightAd()\n{\n\treturn( rad );\n}\n\n\nClassAd *MatchClassAd::\nGetLeftContext( )\n{\n\treturn( lCtx );\n}\n\n\nClassAd *MatchClassAd::\nGetRightContext( )\n{\n\treturn( rCtx );\n}\n\n\nClassAd *MatchClassAd::\nRemoveLeftAd( )\n{\n\tClassAd *ad = lad;\n\tRemove( \"LEFT\" );\n\tif( lad ) {\n\t\tlad->SetParentScope( ladParent );\n\t}\n\tladParent = NULL;\n\tlad = NULL;\n\treturn( ad );\n}\n\n\nClassAd *MatchClassAd::\nRemoveRightAd( )\n{\n\tClassAd\t*ad = rad;\n\tRemove( \"RIGHT\" );\n\tif( rad ) {\n\t\trad->SetParentScope( radParent );\n\t}\n\tradParent = NULL;\n\trad = NULL;\n\treturn( ad );\n}\n\nbool MatchClassAd::\nOptimizeRightAdForMatchmaking( ClassAd *ad, std::string *error_msg )\n{\n\treturn OptimizeAdForMatchmaking( ad, true, error_msg );\n}\n\nbool MatchClassAd::\nOptimizeLeftAdForMatchmaking( ClassAd *ad, std::string *error_msg )\n{\n\treturn OptimizeAdForMatchmaking( ad, false, error_msg );\n}\n\nbool MatchClassAd::\nOptimizeAdForMatchmaking( ClassAd *ad, bool is_right, std::string *error_msg )\n{\n\tif( ad->Lookup(\"my\") ||\n\t\tad->Lookup(\"target\") ||\n\t\tad->Lookup(\"other\") ||\n\t\tad->Lookup(ATTR_UNOPTIMIZED_REQUIREMENTS) )\n\t{\n\t\tif( error_msg ) {\n\t\t\t*error_msg = \"Optimization of matchmaking requirements failed, because ad already contains one of my, target, other, or UnoptimizedRequirements.\";\n\t\t}\n\t\treturn false;\n\t}\n\n\tExprTree *requirements = ad->Lookup(ATTR_REQUIREMENTS);\n\tif( !requirements ) {\n\t\tif( error_msg ) {\n\t\t\t*error_msg = \"No requirements found in ad to be optimized.\";\n\t\t}\n\t\treturn false;\n\t}\n\n\t\t\/\/ insert \"my\" into this ad so that references that use it\n\t\t\/\/ can be flattened\n\tValue me;\n\tme.SetClassAdValue( ad );\n\tad->Insert(\"my\",Literal::MakeLiteral(me));\n\n\t\t\/\/ insert \"target\" and \"other\" into this ad so references can be\n\t\t\/\/ _partially_ flattened to the more efficient .RIGHT or .LEFT\n\tchar const *other = is_right ? \"LEFT\" : \"RIGT\";\n\tExprTree *target =\n\t\tAttributeReference::MakeAttributeReference(NULL,other,true);\n\tad->Insert(\"target\",target);\n\tad->Insert(\"other\",target);\n\n\n\tExprTree *flat_requirements = NULL;\n\tValue flat_val;\n\n\tif( ad->FlattenAndInline(requirements,flat_val,flat_requirements) ) {\n\t\tif( !flat_requirements ) {\n\t\t\t\t\/\/ flattened to a value\n\t\t\tflat_requirements = Literal::MakeLiteral(flat_val);\n\t\t}\n\t\tif( flat_requirements ) {\n\t\t\t\t\/\/ save original requirements\n\t\t\tExprTree *orig_requirements = ad->Remove(ATTR_REQUIREMENTS);\n\t\t\tif( orig_requirements ) {\n\t\t\t\tif( !ad->Insert(ATTR_UNOPTIMIZED_REQUIREMENTS,orig_requirements) )\n\t\t\t\t{\n\t\t\t\t\t\t\/\/ Now we have no requirements.  Very bad!\n\t\t\t\t\tif( error_msg ) {\n\t\t\t\t\t\t*error_msg = \"Failed to rename original requirements.\";\n\t\t\t\t\t}\n\t\t\t\t\tdelete orig_requirements;\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\t\/\/ insert new flattened requirements\n\t\t\tif( !ad->Insert(ATTR_REQUIREMENTS,flat_requirements) ) {\n\t\t\t\tif( error_msg ) {\n\t\t\t\t\t*error_msg = \"Failed to insert optimized requirements.\";\n\t\t\t\t}\n\t\t\t\tdelete flat_requirements;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t\t\/\/ After flatenning, no references should remain to MY or TARGET.\n\t\t\/\/ Even if there are, those can be resolved by the context ads, so\n\t\t\/\/ we don't need to leave these attributes in the ad.\n\tad->Delete(\"my\");\n\tad->Remove(\"other\"); \/\/ this is a pointer to same object as target\n\tad->Delete(\"target\");\n\n\treturn true;\n}\n\nbool MatchClassAd::\nUnoptimizeAdForMatchmaking( ClassAd *ad )\n{\n\tExprTree *orig_requirements = ad->Remove(ATTR_UNOPTIMIZED_REQUIREMENTS);\n\tif( orig_requirements ) {\n\t\tif( !ad->Insert(ATTR_REQUIREMENTS,orig_requirements) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nEND_NAMESPACE \/\/ classad\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * Copyright (c) 2007, Michael Feathers, James Grenning and Bas Vodde\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 are met:\r\n *     * Redistributions of source code must retain the above copyright\r\n *       notice, this list of conditions and the following disclaimer.\r\n *     * 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 *     * Neither the name of the <organization> nor the\r\n *       names of its contributors may be used to endorse or promote products\r\n *       derived from this software without specific prior written permission.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY THE EARLIER MENTIONED AUTHORS ``AS IS'' AND ANY\r\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\n * DISCLAIMED. IN NO EVENT SHALL <copyright holder> BE LIABLE FOR ANY\r\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\r\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\r\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\r\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\r\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n *\/\r\n\r\n#include \"CppUTest\/TestHarness_c.h\"\r\n\r\n#include \"CppUTest\/TestHarness.h\"\r\n#include \"CppUTest\/TestRegistry.h\"\r\n#include \"CppUTest\/TestOutput.h\"\r\n#include \"CppUTest\/TestTestingFixture.h\"\r\n#include \"CppUTest\/PlatformSpecificFunctions.h\"\r\n\r\nTEST_GROUP(TestHarness_c)\r\n{\r\n\tTestTestingFixture* fixture;\r\n\tTEST_SETUP()\r\n\t{\r\n\t\tfixture = new TestTestingFixture();\r\n\t}\r\n\tTEST_TEARDOWN()\r\n\t{\r\n\t\tdelete fixture;\r\n\t}\r\n};\r\n\r\nstatic void _failIntMethod()\r\n{\r\n\tCHECK_EQUAL_C_INT(1, 2);\r\n}\r\n\r\nTEST(TestHarness_c, checkInt)\r\n{\r\n\tCHECK_EQUAL_C_INT(2, 2);\r\n\tfixture->setTestFunction(_failIntMethod);\r\n\tfixture->runAllTests();\r\n\tfixture->assertPrintContains(\"expected <1>\\n\tbut was  <2>\");\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failRealMethod()\r\n{\r\n\tCHECK_EQUAL_C_REAL(1.0, 2.0, 0.5);\r\n}\r\n\r\nTEST(TestHarness_c, checkReal)\r\n{\r\n\tCHECK_EQUAL_C_REAL(1.0, 1.1, 0.5);\r\n\tfixture->setTestFunction(_failRealMethod);\r\n\tfixture->runAllTests();\r\n\tfixture->assertPrintContains(\"expected <1>\\n\tbut was  <2>\");\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failCharMethod()\r\n{\r\n\tCHECK_EQUAL_C_CHAR('a', 'c');\r\n}\r\n\r\nTEST(TestHarness_c, checkChar)\r\n{\r\n\tCHECK_EQUAL_C_CHAR('a', 'a');\r\n\tfixture->setTestFunction(_failCharMethod);\r\n\tfixture->runAllTests();\r\n\tfixture->assertPrintContains(\"expected <a>\\n\tbut was  <c>\");\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failStringMethod()\r\n{\r\n\tCHECK_EQUAL_C_STRING(\"Hello\", \"Hello World\");\r\n}\r\n\r\nTEST(TestHarness_c, checkString)\r\n{\r\n\tCHECK_EQUAL_C_STRING(\"Hello\", \"Hello\");\r\n\tfixture->setTestFunction(_failStringMethod);\r\n\tfixture->runAllTests();\r\n\r\n\tStringEqualFailure failure(UtestShell::getCurrent(), \"file\", 1, \"Hello\", \"Hello World\");\r\n\tfixture->assertPrintContains(failure.getMessage());\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failTextMethod()\r\n{\r\n\tFAIL_TEXT_C(\"Booo\");\r\n}\r\n\r\nTEST(TestHarness_c, checkFailText)\r\n{\r\n\tfixture->setTestFunction(_failTextMethod);\r\n\tfixture->runAllTests();\r\n\tfixture->assertPrintContains(\"Booo\");\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failMethod()\r\n{\r\n\tFAIL_C();\r\n}\r\n\r\nTEST(TestHarness_c, checkFail)\r\n{\r\n\tfixture->setTestFunction(_failMethod);\r\n\tfixture->runAllTests();\r\n\tLONGS_EQUAL(1, fixture->getFailureCount());\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _CheckMethod()\r\n{\r\n\tCHECK_C(false);\r\n}\r\n\r\nTEST(TestHarness_c, checkCheck)\r\n{\r\n\tCHECK_C(true);\r\n\tfixture->setTestFunction(_CheckMethod);\r\n\tfixture->runAllTests();\r\n\tLONGS_EQUAL(1, fixture->getFailureCount());\r\n}\r\n\r\n#if CPPUTEST_USE_MEM_LEAK_DETECTION\r\n\r\nTEST(TestHarness_c, cpputest_malloc_out_of_memory)\r\n{\r\n\tcpputest_malloc_set_out_of_memory();\r\n\tCHECK(0 == cpputest_malloc(100));\r\n\r\n\tcpputest_malloc_set_not_out_of_memory();\r\n\tvoid * mem = cpputest_malloc(100);\r\n\tCHECK(0 != mem);\r\n\tcpputest_free(mem);\r\n}\r\n\r\nTEST(TestHarness_c, cpputest_malloc_out_of_memory_after_n_mallocs)\r\n{\r\n\tcpputest_malloc_set_out_of_memory_countdown(3);\r\n\tvoid * m1 = cpputest_malloc(10);\r\n\tvoid * m2 = cpputest_malloc(11);\r\n\tvoid * m3 = cpputest_malloc(12);\r\n\tCHECK(m1);\r\n\tCHECK(m2);\r\n\tPOINTERS_EQUAL(0, m3);\r\n\tcpputest_malloc_set_not_out_of_memory();\r\n\tcpputest_free(m1);\r\n\tcpputest_free(m2);\r\n}\r\n\r\nTEST(TestHarness_c, cpputest_malloc_out_of_memory_after_0_mallocs)\r\n{\r\n\tcpputest_malloc_set_out_of_memory_countdown(0);\r\n\tvoid * m1 = cpputest_malloc(10);\r\n\tCHECK(m1 == 0);\r\n\tcpputest_malloc_set_not_out_of_memory();\r\n}\r\n\r\nTEST(TestHarness_c, count_mallocs)\r\n{\r\n\tcpputest_malloc_count_reset();\r\n\tvoid * m1 = cpputest_malloc(10);\r\n\tvoid * m2 = cpputest_malloc(11);\r\n\tvoid * m3 = cpputest_malloc(12);\r\n\tcpputest_free(m1);\r\n\tcpputest_free(m2);\r\n\tcpputest_free(m3);\r\n\tLONGS_EQUAL(3, cpputest_malloc_get_count());\r\n}\r\n\r\nTEST(TestHarness_c, cpputest_calloc)\r\n{\r\n\tvoid * mem = cpputest_calloc(10, 10);\r\n\tCHECK(0 != mem);\r\n\tcpputest_free(mem);\r\n}\r\n\r\nTEST(TestHarness_c, cpputest_realloc_larger)\r\n{\r\n\tconst char* number_string = \"123456789\";\r\n\r\n\tchar* mem1 = (char*) cpputest_malloc(10);\r\n\r\n\tPlatformSpecificStrCpy(mem1, number_string);\r\n\tCHECK(mem1 != 0);\r\n\r\n\tchar* mem2 = (char*) cpputest_realloc(mem1, 1000);\r\n\r\n\tCHECK(mem2 != 0);\r\n\tSTRCMP_EQUAL(number_string, mem2);\r\n\r\n\tcpputest_free(mem2);\r\n}\r\n\r\n#include \"CppUTest\/MemoryLeakDetector.h\"\r\n\r\nTEST(TestHarness_c, macros)\r\n{\r\n\tMemoryLeakDetector* memLeakDetector = MemoryLeakWarningPlugin::getGlobalDetector();\r\n\tint memLeaks = memLeakDetector->totalMemoryLeaks(mem_leak_period_checking);\r\n\tvoid* mem1 = malloc(10);\r\n\tvoid* mem2 = calloc(10, 20);\r\n\tvoid* mem3 = realloc(mem2, 100);\r\n#if CPPUTEST_USE_MALLOC_MACROS\r\n\tLONGS_EQUAL(memLeaks + 2, memLeakDetector->totalMemoryLeaks(mem_leak_period_checking));\r\n#endif\r\n\tfree(mem1);\r\n\tfree(mem3);\r\n#if CPPUTEST_USE_MALLOC_MACROS\r\n\tLONGS_EQUAL(memLeaks, memLeakDetector->totalMemoryLeaks(mem_leak_period_checking));\r\n#endif\r\n\r\n}\r\n\r\nTEST(TestHarness_c, callocInitializedToZero)\r\n{\r\n\tchar* mem = (char*) calloc(20, sizeof(char));\r\n\tfor (int i = 0; i < 20; i++)\r\n\t\tCHECK(mem[i] == 0);\r\n\tfree(mem);\r\n}\r\n#endif\r\n\r\n<commit_msg>Eliminate \"unused Variable\" warning when CPPUTEST_USE_MALLOC_MACROS is not defined.<commit_after>\/*\r\n * Copyright (c) 2007, Michael Feathers, James Grenning and Bas Vodde\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 are met:\r\n *     * Redistributions of source code must retain the above copyright\r\n *       notice, this list of conditions and the following disclaimer.\r\n *     * 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 *     * Neither the name of the <organization> nor the\r\n *       names of its contributors may be used to endorse or promote products\r\n *       derived from this software without specific prior written permission.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY THE EARLIER MENTIONED AUTHORS ``AS IS'' AND ANY\r\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\n * DISCLAIMED. IN NO EVENT SHALL <copyright holder> BE LIABLE FOR ANY\r\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\r\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\r\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\r\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\r\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n *\/\r\n\r\n#include \"CppUTest\/TestHarness_c.h\"\r\n\r\n#include \"CppUTest\/TestHarness.h\"\r\n#include \"CppUTest\/TestRegistry.h\"\r\n#include \"CppUTest\/TestOutput.h\"\r\n#include \"CppUTest\/TestTestingFixture.h\"\r\n#include \"CppUTest\/PlatformSpecificFunctions.h\"\r\n\r\nTEST_GROUP(TestHarness_c)\r\n{\r\n\tTestTestingFixture* fixture;\r\n\tTEST_SETUP()\r\n\t{\r\n\t\tfixture = new TestTestingFixture();\r\n\t}\r\n\tTEST_TEARDOWN()\r\n\t{\r\n\t\tdelete fixture;\r\n\t}\r\n};\r\n\r\nstatic void _failIntMethod()\r\n{\r\n\tCHECK_EQUAL_C_INT(1, 2);\r\n}\r\n\r\nTEST(TestHarness_c, checkInt)\r\n{\r\n\tCHECK_EQUAL_C_INT(2, 2);\r\n\tfixture->setTestFunction(_failIntMethod);\r\n\tfixture->runAllTests();\r\n\tfixture->assertPrintContains(\"expected <1>\\n\tbut was  <2>\");\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failRealMethod()\r\n{\r\n\tCHECK_EQUAL_C_REAL(1.0, 2.0, 0.5);\r\n}\r\n\r\nTEST(TestHarness_c, checkReal)\r\n{\r\n\tCHECK_EQUAL_C_REAL(1.0, 1.1, 0.5);\r\n\tfixture->setTestFunction(_failRealMethod);\r\n\tfixture->runAllTests();\r\n\tfixture->assertPrintContains(\"expected <1>\\n\tbut was  <2>\");\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failCharMethod()\r\n{\r\n\tCHECK_EQUAL_C_CHAR('a', 'c');\r\n}\r\n\r\nTEST(TestHarness_c, checkChar)\r\n{\r\n\tCHECK_EQUAL_C_CHAR('a', 'a');\r\n\tfixture->setTestFunction(_failCharMethod);\r\n\tfixture->runAllTests();\r\n\tfixture->assertPrintContains(\"expected <a>\\n\tbut was  <c>\");\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failStringMethod()\r\n{\r\n\tCHECK_EQUAL_C_STRING(\"Hello\", \"Hello World\");\r\n}\r\n\r\nTEST(TestHarness_c, checkString)\r\n{\r\n\tCHECK_EQUAL_C_STRING(\"Hello\", \"Hello\");\r\n\tfixture->setTestFunction(_failStringMethod);\r\n\tfixture->runAllTests();\r\n\r\n\tStringEqualFailure failure(UtestShell::getCurrent(), \"file\", 1, \"Hello\", \"Hello World\");\r\n\tfixture->assertPrintContains(failure.getMessage());\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failTextMethod()\r\n{\r\n\tFAIL_TEXT_C(\"Booo\");\r\n}\r\n\r\nTEST(TestHarness_c, checkFailText)\r\n{\r\n\tfixture->setTestFunction(_failTextMethod);\r\n\tfixture->runAllTests();\r\n\tfixture->assertPrintContains(\"Booo\");\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _failMethod()\r\n{\r\n\tFAIL_C();\r\n}\r\n\r\nTEST(TestHarness_c, checkFail)\r\n{\r\n\tfixture->setTestFunction(_failMethod);\r\n\tfixture->runAllTests();\r\n\tLONGS_EQUAL(1, fixture->getFailureCount());\r\n\tfixture->assertPrintContains(\"arness_c\");\r\n}\r\n\r\nstatic void _CheckMethod()\r\n{\r\n\tCHECK_C(false);\r\n}\r\n\r\nTEST(TestHarness_c, checkCheck)\r\n{\r\n\tCHECK_C(true);\r\n\tfixture->setTestFunction(_CheckMethod);\r\n\tfixture->runAllTests();\r\n\tLONGS_EQUAL(1, fixture->getFailureCount());\r\n}\r\n\r\n#if CPPUTEST_USE_MEM_LEAK_DETECTION\r\n\r\nTEST(TestHarness_c, cpputest_malloc_out_of_memory)\r\n{\r\n\tcpputest_malloc_set_out_of_memory();\r\n\tCHECK(0 == cpputest_malloc(100));\r\n\r\n\tcpputest_malloc_set_not_out_of_memory();\r\n\tvoid * mem = cpputest_malloc(100);\r\n\tCHECK(0 != mem);\r\n\tcpputest_free(mem);\r\n}\r\n\r\nTEST(TestHarness_c, cpputest_malloc_out_of_memory_after_n_mallocs)\r\n{\r\n\tcpputest_malloc_set_out_of_memory_countdown(3);\r\n\tvoid * m1 = cpputest_malloc(10);\r\n\tvoid * m2 = cpputest_malloc(11);\r\n\tvoid * m3 = cpputest_malloc(12);\r\n\tCHECK(m1);\r\n\tCHECK(m2);\r\n\tPOINTERS_EQUAL(0, m3);\r\n\tcpputest_malloc_set_not_out_of_memory();\r\n\tcpputest_free(m1);\r\n\tcpputest_free(m2);\r\n}\r\n\r\nTEST(TestHarness_c, cpputest_malloc_out_of_memory_after_0_mallocs)\r\n{\r\n\tcpputest_malloc_set_out_of_memory_countdown(0);\r\n\tvoid * m1 = cpputest_malloc(10);\r\n\tCHECK(m1 == 0);\r\n\tcpputest_malloc_set_not_out_of_memory();\r\n}\r\n\r\nTEST(TestHarness_c, count_mallocs)\r\n{\r\n\tcpputest_malloc_count_reset();\r\n\tvoid * m1 = cpputest_malloc(10);\r\n\tvoid * m2 = cpputest_malloc(11);\r\n\tvoid * m3 = cpputest_malloc(12);\r\n\tcpputest_free(m1);\r\n\tcpputest_free(m2);\r\n\tcpputest_free(m3);\r\n\tLONGS_EQUAL(3, cpputest_malloc_get_count());\r\n}\r\n\r\nTEST(TestHarness_c, cpputest_calloc)\r\n{\r\n\tvoid * mem = cpputest_calloc(10, 10);\r\n\tCHECK(0 != mem);\r\n\tcpputest_free(mem);\r\n}\r\n\r\nTEST(TestHarness_c, cpputest_realloc_larger)\r\n{\r\n\tconst char* number_string = \"123456789\";\r\n\r\n\tchar* mem1 = (char*) cpputest_malloc(10);\r\n\r\n\tPlatformSpecificStrCpy(mem1, number_string);\r\n\tCHECK(mem1 != 0);\r\n\r\n\tchar* mem2 = (char*) cpputest_realloc(mem1, 1000);\r\n\r\n\tCHECK(mem2 != 0);\r\n\tSTRCMP_EQUAL(number_string, mem2);\r\n\r\n\tcpputest_free(mem2);\r\n}\r\n\r\n#include \"CppUTest\/MemoryLeakDetector.h\"\r\n\r\nTEST(TestHarness_c, macros)\r\n{\r\n#if CPPUTEST_USE_MALLOC_MACROS\r\n\tMemoryLeakDetector* memLeakDetector = MemoryLeakWarningPlugin::getGlobalDetector();\r\n\tint memLeaks = memLeakDetector->totalMemoryLeaks(mem_leak_period_checking);\r\n#endif\r\n\tvoid* mem1 = malloc(10);\r\n\tvoid* mem2 = calloc(10, 20);\r\n\tvoid* mem3 = realloc(mem2, 100);\r\n#if CPPUTEST_USE_MALLOC_MACROS\r\n\tLONGS_EQUAL(memLeaks + 2, memLeakDetector->totalMemoryLeaks(mem_leak_period_checking));\r\n#endif\r\n\tfree(mem1);\r\n\tfree(mem3);\r\n#if CPPUTEST_USE_MALLOC_MACROS\r\n\tLONGS_EQUAL(memLeaks, memLeakDetector->totalMemoryLeaks(mem_leak_period_checking));\r\n#endif\r\n\r\n}\r\n\r\nTEST(TestHarness_c, callocInitializedToZero)\r\n{\r\n\tchar* mem = (char*) calloc(20, sizeof(char));\r\n\tfor (int i = 0; i < 20; i++)\r\n\t\tCHECK(mem[i] == 0);\r\n\tfree(mem);\r\n}\r\n#endif\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012, 2013, 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#include \"openMVG\/exif\/exif_IO_EasyExif.hpp\"\n\n#include \"openMVG\/exif\/sensor_width_database\/ParseDatabase.hpp\"\n\n#include \"openMVG\/image\/image.hpp\"\n#include \"openMVG\/stl\/split.hpp\"\n\n#include \"openMVG\/sfm\/sfm.hpp\"\n\n#include \"third_party\/cmdLine\/cmdLine.h\"\n#include \"third_party\/stlplus3\/filesystemSimplified\/file_system.hpp\"\n\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <memory>\n#include <string>\n#include <vector>\n\nusing namespace openMVG;\nusing namespace openMVG::cameras;\nusing namespace openMVG::exif;\nusing namespace openMVG::image;\nusing namespace openMVG::sfm;\n\n\/\/\/ Check that Kmatrix is a string like \"f;0;ppx;0;f;ppy;0;0;1\"\n\/\/\/ With f,ppx,ppy as valid numerical value\nbool checkIntrinsicStringValidity(const std::string & Kmatrix, double & focal, double & ppx, double & ppy)\n{\n  std::vector<std::string> vec_str;\n  stl::split(Kmatrix, \";\", vec_str);\n  if (vec_str.size() != 9)  {\n    std::cerr << \"\\n Missing ';' character\" << std::endl;\n    return false;\n  }\n  \/\/ Check that all K matrix value are valid numbers\n  for (size_t i = 0; i < vec_str.size(); ++i) {\n    double readvalue = 0.0;\n    std::stringstream ss;\n    ss.str(vec_str[i]);\n    if (! (ss >> readvalue) )  {\n      std::cerr << \"\\n Used an invalid not a number character\" << std::endl;\n      return false;\n    }\n    if (i==0) focal = readvalue;\n    if (i==2) ppx = readvalue;\n    if (i==5) ppy = readvalue;\n  }\n  return true;\n}\n\n\/\/\n\/\/ Create the description of an input image dataset for OpenMVG toolsuite\n\/\/ - Export a SfM_Data file with View & Intrinsic data\n\/\/\nint main(int argc, char **argv)\n{\n  CmdLine cmd;\n\n  std::string sImageDir,\n    sfileDatabase = \"\",\n    sOutputDir = \"\",\n    sKmatrix;\n\n  int i_User_camera_model = PINHOLE_CAMERA_RADIAL3;\n\n  bool b_Group_camera_model = true;\n\n  double focal_pixels = -1.0;\n\n  cmd.add( make_option('i', sImageDir, \"imageDirectory\") );\n  cmd.add( make_option('d', sfileDatabase, \"sensorWidthDatabase\") );\n  cmd.add( make_option('o', sOutputDir, \"outputDirectory\") );\n  cmd.add( make_option('f', focal_pixels, \"focal\") );\n  cmd.add( make_option('k', sKmatrix, \"intrinsics\") );\n  cmd.add( make_option('c', i_User_camera_model, \"camera_model\") );\n  cmd.add( make_option('g', b_Group_camera_model, \"group_camera_model\") );\n\n  try {\n      if (argc == 1) throw std::string(\"Invalid command line parameter.\");\n      cmd.process(argc, argv);\n  } catch(const std::string& s) {\n      std::cerr << \"Usage: \" << argv[0] << '\\n'\n      << \"[-i|--imageDirectory]\\n\"\n      << \"[-d|--sensorWidthDatabase]\\n\"\n      << \"[-o|--outputDirectory]\\n\"\n      << \"[-f|--focal] (pixels)\\n\"\n      << \"[-k|--intrinsics] Kmatrix: \\\"f;0;ppx;0;f;ppy;0;0;1\\\"\\n\"\n      << \"[-c|--camera_model] Camera model type:\\n\"\n      << \"\\t 1: Pinhole\\n\"\n      << \"\\t 2: Pinhole radial 1\\n\"\n      << \"\\t 3: Pinhole radial 3 (default)\\n\"\n      << \"[-g|--group_camera_model]\\n\"\n      << \"\\t 0-> each view have it's own camera intrinsic parameters,\\n\"\n      << \"\\t 1-> (default) view can share some camera intrinsic parameters\\n\"\n      << std::endl;\n\n      std::cerr << s << std::endl;\n      return EXIT_FAILURE;\n  }\n\n  std::cout << \" You called : \" <<std::endl\n            << argv[0] << std::endl\n            << \"--imageDirectory \" << sImageDir << std::endl\n            << \"--sensorWidthDatabase \" << sfileDatabase << std::endl\n            << \"--outputDirectory \" << sOutputDir << std::endl\n            << \"--focal \" << focal_pixels << std::endl\n            << \"--intrinsics \" << sKmatrix << std::endl\n            << \"--camera_model \" << i_User_camera_model << std::endl\n            << \"--group_camera_model \" << b_Group_camera_model << std::endl;\n\n  \/\/ Expected properties for each image\n  double width = -1, height = -1, focal = -1, ppx = -1,  ppy = -1;\n\n  const EINTRINSIC e_User_camera_model = EINTRINSIC(i_User_camera_model);\n\n  if ( !stlplus::folder_exists( sImageDir ) )\n  {\n    std::cerr << \"\\nThe input directory doesn't exist\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  if (sOutputDir.empty())\n  {\n    std::cerr << \"\\nInvalid output directory\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  if ( !stlplus::folder_exists( sOutputDir ) )\n  {\n    if ( !stlplus::folder_create( sOutputDir ))\n    {\n      std::cerr << \"\\nCannot create output directory\" << std::endl;\n      return EXIT_FAILURE;\n    }\n  }\n\n  if (sKmatrix.size() > 0 &&\n    !checkIntrinsicStringValidity(sKmatrix, focal, ppx, ppy) )\n  {\n    std::cerr << \"\\nInvalid K matrix input\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  if (sKmatrix.size() > 0 && focal_pixels != -1.0)\n  {\n    std::cerr << \"\\nCannot combine -f and -k options\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  std::vector<Datasheet> vec_database;\n  if (!sfileDatabase.empty())\n  {\n    if ( !parseDatabase( sfileDatabase, vec_database ) )\n    {\n      std::cerr\n       << \"\\nInvalid input database: \" << sfileDatabase\n       << \", please specify a valid file.\" << std::endl;\n      return EXIT_FAILURE;\n    }\n  }\n\n  std::vector<std::string> vec_image = stlplus::folder_files( sImageDir );\n  std::sort(vec_image.begin(), vec_image.end());\n\n  \/\/ Configure an empty scene with Views and their corresponding cameras\n  SfM_Data sfm_data;\n  sfm_data.s_root_path = sImageDir; \/\/ Setup main image root_path\n  Views & views = sfm_data.views;\n  Intrinsics & intrinsics = sfm_data.intrinsics;\n\n  for ( std::vector<std::string>::const_iterator iter_image = vec_image.begin();\n    iter_image != vec_image.end();\n    iter_image++ )\n  {\n    \/\/ Read meta data to fill camera parameter (w,h,focal,ppx,ppy) fields.\n    width = height = ppx = ppy = focal = -1.0;\n\n    const std::string sImageFilename = stlplus::create_filespec( sImageDir, *iter_image );\n\n    \/\/ Test if the image format is supported:\n    if (openMVG::image::GetFormat(sImageFilename.c_str()) == openMVG::image::Unknown)\n      continue; \/\/ image cannot be opened\n\n    ImageHeader imgHeader;\n    if (!openMVG::image::ReadImageHeader(sImageFilename.c_str(), &imgHeader))\n      continue; \/\/ image cannot be read\n\n    width = imgHeader.width;\n    height = imgHeader.height;\n    ppx = width \/ 2.0;\n    ppy = height \/ 2.0;\n\n    std::unique_ptr<Exif_IO> exifReader(new Exif_IO_EasyExif());\n    exifReader->open( sImageFilename );\n\n    const bool bHaveValidExifMetadata =\n      exifReader->doesHaveExifInfo()\n      && !exifReader->getBrand().empty()\n      && !exifReader->getModel().empty();\n\n    \/\/ Consider the case where the focal is provided manually\n    if ( !bHaveValidExifMetadata || focal_pixels != -1)\n    {\n      if (sKmatrix.size() > 0) \/\/ Known user calibration K matrix\n      {\n        if (!checkIntrinsicStringValidity(sKmatrix, focal, ppx, ppy))\n          focal = -1.0;\n      }\n      else \/\/ User provided focal length value\n        if (focal_pixels != -1 )\n          focal = focal_pixels;\n    }\n    else \/\/ If image contains meta data\n    {\n      const std::string sCamName = exifReader->getBrand();\n      const std::string sCamModel = exifReader->getModel();\n\n      \/\/ Handle case where focal length is equal to 0\n      if (exifReader->getFocal() == 0.0f)\n      {\n        std::cout << stlplus::basename_part(sImageFilename) << \": Focal length is missing.\" << std::endl;\n        focal = -1.0;\n      }\n      else\n      \/\/ Create the image entry in the list file\n      {\n        Datasheet datasheet;\n        if ( getInfo( sCamName, sCamModel, vec_database, datasheet ))\n        {\n          \/\/ The camera model was found in the database so we can compute it's approximated focal length\n          const double ccdw = datasheet._sensorSize;\n          focal = std::max ( width, height ) * exifReader->getFocal() \/ ccdw;\n        }\n        else\n        {\n          std::cout << stlplus::basename_part(sImageFilename) << \": Camera \\\"\"\n            << sCamName << \"\\\" model \\\"\" << sCamModel << \"\\\" doesn't exist in the database\" << std::endl\n            << \"Please consider add your camera model and sensor width in the database.\" << std::endl;\n        }\n      }\n    }\n\n    \/\/ Build intrinsic parameter related to the view\n    std::shared_ptr<IntrinsicBase> intrinsic (NULL);\n\n    if (focal > 0 && ppx > 0 && ppy > 0 && width > 0 && height > 0)\n    {\n      \/\/ Create the desired camera type\n      switch(e_User_camera_model)\n      {\n        case PINHOLE_CAMERA:\n          intrinsic = std::make_shared<Pinhole_Intrinsic>\n            (width, height, focal, ppx, ppy);\n        break;\n        case PINHOLE_CAMERA_RADIAL1:\n          intrinsic = std::make_shared<Pinhole_Intrinsic_Radial_K1>\n            (width, height, focal, ppx, ppy, 0.0); \/\/ setup no distortion as initial guess\n        break;\n        case PINHOLE_CAMERA_RADIAL3:\n          intrinsic = std::make_shared<Pinhole_Intrinsic_Radial_K3>\n            (width, height, focal, ppx, ppy, 0.0, 0.0, 0.0);  \/\/ setup no distortion as initial guess\n        break;\n        default:\n          std::cout << \"Unknown camera model: \" << (int) e_User_camera_model << std::endl;\n      }\n    }\n\n    \/\/ Build the view corresponding to the image\n    View v(*iter_image, views.size(), views.size(), views.size(), width, height);\n\n    \/\/ Add intrinsic related to the image (if any)\n    if (intrinsic == NULL)\n    {\n      \/\/Since the view have invalid intrinsic data\n      \/\/ (export the view, with an invalid intrinsic field value)\n      v.id_intrinsic = UndefinedIndexT;\n    }\n    else\n    {\n      \/\/ Add the defined intrinsic to the sfm_container\n      intrinsics[v.id_intrinsic] = intrinsic;\n    }\n\n    \/\/ Add the view to the sfm_container\n    views[v.id_view] = std::make_shared<View>(v);\n  }\n\n  \/\/ Group camera that share common properties if desired (leads to more faster & stable BA).\n  if (b_Group_camera_model)\n  {\n    GroupSharedIntrinsics(sfm_data);\n  }\n\n  \/\/ Store SfM_Data views & intrinsic data\n  if (!Save(\n    sfm_data,\n    stlplus::create_filespec( sOutputDir, \"sfm_data.json\" ).c_str(),\n    ESfM_Data(VIEWS|INTRINSICS)))\n  {\n    return EXIT_FAILURE;\n  }\n\n  std::cout << std::endl\n    << \"SfMInit_ImageListing report:\\n\"\n    << \"listed #File(s): \" << vec_image.size() << \"\\n\"\n    << \"usable #File(s) listed in sfm_data: \" << sfm_data.GetViews().size() << std::endl;\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>[software] SfMInit_ImageListing. Add progress bar and enhance warning\/error report. #364<commit_after>\/\/ Copyright (c) 2012, 2013, 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#include \"openMVG\/exif\/exif_IO_EasyExif.hpp\"\n\n#include \"openMVG\/exif\/sensor_width_database\/ParseDatabase.hpp\"\n\n#include \"openMVG\/image\/image.hpp\"\n#include \"openMVG\/stl\/split.hpp\"\n\n#include \"openMVG\/sfm\/sfm.hpp\"\n\n#include \"third_party\/cmdLine\/cmdLine.h\"\n#include \"third_party\/stlplus3\/filesystemSimplified\/file_system.hpp\"\n\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <memory>\n#include <string>\n#include <vector>\n\nusing namespace openMVG;\nusing namespace openMVG::cameras;\nusing namespace openMVG::exif;\nusing namespace openMVG::image;\nusing namespace openMVG::sfm;\n\n\/\/\/ Check that Kmatrix is a string like \"f;0;ppx;0;f;ppy;0;0;1\"\n\/\/\/ With f,ppx,ppy as valid numerical value\nbool checkIntrinsicStringValidity(const std::string & Kmatrix, double & focal, double & ppx, double & ppy)\n{\n  std::vector<std::string> vec_str;\n  stl::split(Kmatrix, \";\", vec_str);\n  if (vec_str.size() != 9)  {\n    std::cerr << \"\\n Missing ';' character\" << std::endl;\n    return false;\n  }\n  \/\/ Check that all K matrix value are valid numbers\n  for (size_t i = 0; i < vec_str.size(); ++i) {\n    double readvalue = 0.0;\n    std::stringstream ss;\n    ss.str(vec_str[i]);\n    if (! (ss >> readvalue) )  {\n      std::cerr << \"\\n Used an invalid not a number character\" << std::endl;\n      return false;\n    }\n    if (i==0) focal = readvalue;\n    if (i==2) ppx = readvalue;\n    if (i==5) ppy = readvalue;\n  }\n  return true;\n}\n\n\/\/\n\/\/ Create the description of an input image dataset for OpenMVG toolsuite\n\/\/ - Export a SfM_Data file with View & Intrinsic data\n\/\/\nint main(int argc, char **argv)\n{\n  CmdLine cmd;\n\n  std::string sImageDir,\n    sfileDatabase = \"\",\n    sOutputDir = \"\",\n    sKmatrix;\n\n  int i_User_camera_model = PINHOLE_CAMERA_RADIAL3;\n\n  bool b_Group_camera_model = true;\n\n  double focal_pixels = -1.0;\n\n  cmd.add( make_option('i', sImageDir, \"imageDirectory\") );\n  cmd.add( make_option('d', sfileDatabase, \"sensorWidthDatabase\") );\n  cmd.add( make_option('o', sOutputDir, \"outputDirectory\") );\n  cmd.add( make_option('f', focal_pixels, \"focal\") );\n  cmd.add( make_option('k', sKmatrix, \"intrinsics\") );\n  cmd.add( make_option('c', i_User_camera_model, \"camera_model\") );\n  cmd.add( make_option('g', b_Group_camera_model, \"group_camera_model\") );\n\n  try {\n      if (argc == 1) throw std::string(\"Invalid command line parameter.\");\n      cmd.process(argc, argv);\n  } catch(const std::string& s) {\n      std::cerr << \"Usage: \" << argv[0] << '\\n'\n      << \"[-i|--imageDirectory]\\n\"\n      << \"[-d|--sensorWidthDatabase]\\n\"\n      << \"[-o|--outputDirectory]\\n\"\n      << \"[-f|--focal] (pixels)\\n\"\n      << \"[-k|--intrinsics] Kmatrix: \\\"f;0;ppx;0;f;ppy;0;0;1\\\"\\n\"\n      << \"[-c|--camera_model] Camera model type:\\n\"\n      << \"\\t 1: Pinhole\\n\"\n      << \"\\t 2: Pinhole radial 1\\n\"\n      << \"\\t 3: Pinhole radial 3 (default)\\n\"\n      << \"[-g|--group_camera_model]\\n\"\n      << \"\\t 0-> each view have it's own camera intrinsic parameters,\\n\"\n      << \"\\t 1-> (default) view can share some camera intrinsic parameters\\n\"\n      << std::endl;\n\n      std::cerr << s << std::endl;\n      return EXIT_FAILURE;\n  }\n\n  std::cout << \" You called : \" <<std::endl\n            << argv[0] << std::endl\n            << \"--imageDirectory \" << sImageDir << std::endl\n            << \"--sensorWidthDatabase \" << sfileDatabase << std::endl\n            << \"--outputDirectory \" << sOutputDir << std::endl\n            << \"--focal \" << focal_pixels << std::endl\n            << \"--intrinsics \" << sKmatrix << std::endl\n            << \"--camera_model \" << i_User_camera_model << std::endl\n            << \"--group_camera_model \" << b_Group_camera_model << std::endl;\n\n  \/\/ Expected properties for each image\n  double width = -1, height = -1, focal = -1, ppx = -1,  ppy = -1;\n\n  const EINTRINSIC e_User_camera_model = EINTRINSIC(i_User_camera_model);\n\n  if ( !stlplus::folder_exists( sImageDir ) )\n  {\n    std::cerr << \"\\nThe input directory doesn't exist\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  if (sOutputDir.empty())\n  {\n    std::cerr << \"\\nInvalid output directory\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  if ( !stlplus::folder_exists( sOutputDir ) )\n  {\n    if ( !stlplus::folder_create( sOutputDir ))\n    {\n      std::cerr << \"\\nCannot create output directory\" << std::endl;\n      return EXIT_FAILURE;\n    }\n  }\n\n  if (sKmatrix.size() > 0 &&\n    !checkIntrinsicStringValidity(sKmatrix, focal, ppx, ppy) )\n  {\n    std::cerr << \"\\nInvalid K matrix input\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  if (sKmatrix.size() > 0 && focal_pixels != -1.0)\n  {\n    std::cerr << \"\\nCannot combine -f and -k options\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  std::vector<Datasheet> vec_database;\n  if (!sfileDatabase.empty())\n  {\n    if ( !parseDatabase( sfileDatabase, vec_database ) )\n    {\n      std::cerr\n       << \"\\nInvalid input database: \" << sfileDatabase\n       << \", please specify a valid file.\" << std::endl;\n      return EXIT_FAILURE;\n    }\n  }\n\n  std::vector<std::string> vec_image = stlplus::folder_files( sImageDir );\n  std::sort(vec_image.begin(), vec_image.end());\n\n  \/\/ Configure an empty scene with Views and their corresponding cameras\n  SfM_Data sfm_data;\n  sfm_data.s_root_path = sImageDir; \/\/ Setup main image root_path\n  Views & views = sfm_data.views;\n  Intrinsics & intrinsics = sfm_data.intrinsics;\n\n  C_Progress_display my_progress_bar( vec_image.size(),\n      std::cout, \"\\n- Image listing -\\n\" );\n  std::ostringstream error_report_stream;\n  for ( std::vector<std::string>::const_iterator iter_image = vec_image.begin();\n    iter_image != vec_image.end();\n    ++iter_image, ++my_progress_bar )\n  {\n    \/\/ Read meta data to fill camera parameter (w,h,focal,ppx,ppy) fields.\n    width = height = ppx = ppy = focal = -1.0;\n\n    const std::string sImageFilename = stlplus::create_filespec( sImageDir, *iter_image );\n\n    \/\/ Test if the image format is supported:\n    if (openMVG::image::GetFormat(sImageFilename.c_str()) == openMVG::image::Unknown)\n      continue; \/\/ image cannot be opened\n\n    ImageHeader imgHeader;\n    if (!openMVG::image::ReadImageHeader(sImageFilename.c_str(), &imgHeader))\n      continue; \/\/ image cannot be read\n\n    width = imgHeader.width;\n    height = imgHeader.height;\n    ppx = width \/ 2.0;\n    ppy = height \/ 2.0;\n\n    std::unique_ptr<Exif_IO> exifReader(new Exif_IO_EasyExif());\n    exifReader->open( sImageFilename );\n\n    const bool bHaveValidExifMetadata =\n      exifReader->doesHaveExifInfo()\n      && !exifReader->getBrand().empty()\n      && !exifReader->getModel().empty();\n\n    \/\/ Consider the case where the focal is provided manually\n    if ( !bHaveValidExifMetadata || focal_pixels != -1)\n    {\n      if (sKmatrix.size() > 0) \/\/ Known user calibration K matrix\n      {\n        if (!checkIntrinsicStringValidity(sKmatrix, focal, ppx, ppy))\n          focal = -1.0;\n      }\n      else \/\/ User provided focal length value\n        if (focal_pixels != -1 )\n          focal = focal_pixels;\n    }\n    else \/\/ If image contains meta data\n    {\n      const std::string sCamName = exifReader->getBrand();\n      const std::string sCamModel = exifReader->getModel();\n\n      \/\/ Handle case where focal length is equal to 0\n      if (exifReader->getFocal() == 0.0f)\n      {\n        error_report_stream\n          << stlplus::basename_part(sImageFilename) << \": Focal length is missing.\" << \"\\n\";\n        focal = -1.0;\n      }\n      else\n      \/\/ Create the image entry in the list file\n      {\n        Datasheet datasheet;\n        if ( getInfo( sCamName, sCamModel, vec_database, datasheet ))\n        {\n          \/\/ The camera model was found in the database so we can compute it's approximated focal length\n          const double ccdw = datasheet._sensorSize;\n          focal = std::max ( width, height ) * exifReader->getFocal() \/ ccdw;\n        }\n        else\n        {\n          error_report_stream\n            << stlplus::basename_part(sImageFilename) << \": Camera \\\"\"\n            << sCamName << \"\\\" model \\\"\" << sCamModel << \"\\\" doesn't exist in the database\" << \"\\n\"\n            << \"Please consider add your camera model and sensor width in the database.\" << \"\\n\";\n        }\n      }\n    }\n\n    \/\/ Build intrinsic parameter related to the view\n    std::shared_ptr<IntrinsicBase> intrinsic (NULL);\n\n    if (focal > 0 && ppx > 0 && ppy > 0 && width > 0 && height > 0)\n    {\n      \/\/ Create the desired camera type\n      switch(e_User_camera_model)\n      {\n        case PINHOLE_CAMERA:\n          intrinsic = std::make_shared<Pinhole_Intrinsic>\n            (width, height, focal, ppx, ppy);\n        break;\n        case PINHOLE_CAMERA_RADIAL1:\n          intrinsic = std::make_shared<Pinhole_Intrinsic_Radial_K1>\n            (width, height, focal, ppx, ppy, 0.0); \/\/ setup no distortion as initial guess\n        break;\n        case PINHOLE_CAMERA_RADIAL3:\n          intrinsic = std::make_shared<Pinhole_Intrinsic_Radial_K3>\n            (width, height, focal, ppx, ppy, 0.0, 0.0, 0.0);  \/\/ setup no distortion as initial guess\n        break;\n        default:\n          std::cerr << \"Error: unknown camera model: \" << (int) e_User_camera_model << std::endl;\n          return EXIT_FAILURE;\n      }\n    }\n\n    \/\/ Build the view corresponding to the image\n    View v(*iter_image, views.size(), views.size(), views.size(), width, height);\n\n    \/\/ Add intrinsic related to the image (if any)\n    if (intrinsic == NULL)\n    {\n      \/\/Since the view have invalid intrinsic data\n      \/\/ (export the view, with an invalid intrinsic field value)\n      v.id_intrinsic = UndefinedIndexT;\n    }\n    else\n    {\n      \/\/ Add the defined intrinsic to the sfm_container\n      intrinsics[v.id_intrinsic] = intrinsic;\n    }\n\n    \/\/ Add the view to the sfm_container\n    views[v.id_view] = std::make_shared<View>(v);\n  }\n\n  \/\/ Display saved warning & error messages if any.\n  if (!error_report_stream.str().empty())\n  {\n    std::cerr\n      << \"\\nWarning & Error messages:\" << std::endl\n      << error_report_stream.str() << std::endl;\n  }\n\n  \/\/ Group camera that share common properties if desired (leads to more faster & stable BA).\n  if (b_Group_camera_model)\n  {\n    GroupSharedIntrinsics(sfm_data);\n  }\n\n  \/\/ Store SfM_Data views & intrinsic data\n  if (!Save(\n    sfm_data,\n    stlplus::create_filespec( sOutputDir, \"sfm_data.json\" ).c_str(),\n    ESfM_Data(VIEWS|INTRINSICS)))\n  {\n    return EXIT_FAILURE;\n  }\n\n  std::cout << std::endl\n    << \"SfMInit_ImageListing report:\\n\"\n    << \"listed #File(s): \" << vec_image.size() << \"\\n\"\n    << \"usable #File(s) listed in sfm_data: \" << sfm_data.GetViews().size() << std::endl;\n\n  return EXIT_SUCCESS;\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 \"tasking\/taskscheduler.h\"\n#include \"tasking\/taskscheduler_new.h\"\n\n#include \"math\/math.h\"\n#include \"kernels\/algorithms\/sort.h\"\n#include <tbb\/tbb.h>\n\nnamespace embree\n{\n  std::fstream fs;\n\n  struct reduce_benchmark\n  {\n    reduce_benchmark() \n      : N(0), array(NULL) {}\n    \n    size_t N;\n    double* array;\n    double threadReductions[1024];\n    \n    TASK_FUNCTION_(reduce_benchmark,reduce);\n    \n    void reduce(size_t threadIndex, size_t threadCount)\n    {\n      const size_t begin = (threadIndex+0)*N\/threadCount;\n      const size_t end   = (threadIndex+1)*N\/threadCount;\n      double c = 0;\n      for (size_t i=begin; i<end; i++) c += sin(array[i]);\n      threadReductions[threadIndex] = c;\n    }\n    \n    void init(size_t N)\n    {\n      this->N = N;\n      array = new double[N];\n\n      for (size_t i=0; i<N; i++) \n        array[i] = drand48();\n\n      \n    }\n\n    double reduce_sequential(size_t N)\n    {\n      double sum = 0.0;\n      for (size_t i=0; i<N; i++) \n        sum += sin(array[i]);\n      return sum;\n    }\n    \n    double run_sequential (size_t N) \n    {\n      double t0 = getSeconds();\n      double c0 = 0;\n      for (size_t i=0; i<N; i++) c0 += sin(array[i]);\n      volatile double result = c0;\n      double t1 = getSeconds();\n\n      \/*double sum = reduce_sequential(N);\n      if (abs(sum-c0) > 1E-5) {\n        std::cerr << \"internal error: \" << sum << \" != \" << c0 << std::endl;\n        exit(1);\n        }*\/\n      return t1-t0;\n    }  \n    \n    double run_locksteptaskscheduler(size_t N)\n    {\n      double t0 = getSeconds();\n      this->N = N;\n      LockStepTaskScheduler* scheduler = LockStepTaskScheduler::instance();\n      scheduler->dispatchTask( task_reduce, this, 0, scheduler->getNumThreads() );\n      \n      double c = 0;\n      for (size_t i=0; i<scheduler->getNumThreads(); i++) \n        c += threadReductions[i];\n      volatile double result = c;\n      double t1 = getSeconds();\n\n      \/*double sum = reduce_sequential(N);\n      if (abs(sum-c) > 1E-5) {\n        std::cerr << \"internal error: \" << sum << \" != \" << c << std::endl;\n        exit(1);\n        }*\/\n      return t1-t0;\n    }\n    \n    double run_tbb(size_t N)\n    {\n      double t0 = getSeconds();\n      double c2 = 0;\n      \/\/LockStepTaskScheduler::execute_tbb([&] () {\n      c2 = tbb::parallel_reduce(tbb::blocked_range<size_t>(0,N,1024), 0.0, \n                                [&](const tbb::blocked_range<size_t>& r, double value) -> double {\n                                  double c = value; \n                                  for (size_t i=r.begin(); i<r.end(); i++) c += sin(array[i]); \n                                  return c;\n                                },\n                                std::plus<double>());\n      \/\/});\n      volatile double result = c2;\n      double t1 = getSeconds();\n\n      \/*double sum = reduce_sequential(N);\n      if (abs(sum-c2) > 1E-5) {\n        std::cerr << \"internal error: \" << sum << \" != \" << c2 << std::endl;\n        exit(1);\n        }*\/\n      return t1-t0;\n    }\n    \n    const char* name;\n  };\n\n  template<typename Closure>\n  void benchmark(size_t N0, size_t N1, const char* name, const Closure& closure)\n  {\n    fs << \"# \" << name << std::endl;\n    fs << \"# N dt_min dt_avg dt_max M\/s(min) M\/s(avg) M\/s(max)\" << std::endl;\n    for (size_t N = N0; N < N1; N *= 1.5) \n    {\n      double t_min = pos_inf;\n      double t_avg = 0.0f;\n      double t_max = neg_inf;\n      for (size_t i=0; i<10; i++)\n      {\n        double dt = closure(N);\n        t_min = min(t_min,dt);\n        if (i != 0) t_avg = t_avg + dt;\n        t_max = max(t_max,dt);\n      }\n      t_avg \/= 9.0;\n      fs << N << \" \" \n                << 1000.0f*t_min << \" \" << 1000.0f*t_avg << \" \" << 1000.0f*t_max << \" \" \n                << 1E-6*N\/t_max << \" \" << 1E-6*N\/t_avg << \" \" << 1E-6*N\/t_min << std::endl;\n    }\n  }\n\n  reduce_benchmark reduce;\n\n  size_t fib(size_t i)\n  {\n    if (i == 0) \n      return 0;\n    else if (i == 1) \n      return 1;\n    else {\n      return fib(i-1) + fib(i-2);\n    }\n  }\n\n  \/* regression testing *\/\n  struct task_scheduler_regression_test \/\/: public RegressionTest\n  {\n    task_scheduler_regression_test(const char* name) : name(name) {\n      \/\/registerRegressionTest(this);\n    }\n    \n    bool operator() (size_t N)\n    {\n      bool passed = true;\n      printf(\"%s::%s ... \\n\",TOSTRING(isa),name);\n      fflush(stdout);\n\n      \/* create task scheduler *\/\n      TaskSchedulerNew* scheduler = new TaskSchedulerNew(8);\n\n      struct Fib\n      {\n        size_t& r;\n        size_t i;\n        \n        __forceinline Fib (size_t& r, size_t i) : r(r), i(i) {}\n        \n        void operator() (size_t, size_t) const\n        {\n          if (i < 2) {\n            r = i;\n          } else {\n            size_t r0; const Fib fib0(r0, i-1);\n            size_t r1; const Fib fib1(r1, i-2);\n            TaskSchedulerNew::spawn(fib0);\n            TaskSchedulerNew::spawn(fib1);\n            TaskSchedulerNew::wait();\n            r = r0+r1;\n          }\n        }\n      };\n\n      \/* parallel calculation of sum of fibonacci number *\/\n      double t0 = getSeconds();\n      size_t r0 = fib(N);\n      double t1 = getSeconds();\n      size_t r1; Fib pfib(r1,N);\n      scheduler->spawn_root(pfib);\n      double t2 = getSeconds();\n\n      printf(\"  sequential_fib(%zu) = %zu, %3.2fms\\n\",N,r0,1000.0f*(t1-t0));\n      printf(\"  parallel_fib  (%zu) = %zu, %3.2fms\\n\",N,r1,1000.0f*(t2-t1));\n      passed = r0 == r1;\n            \n      \/* output if test passed or not *\/\n      if (passed) printf(\"[passed]\\n\");\n      else        printf(\"[failed]\\n\");\n\n      delete scheduler;\n      return passed;\n    }\n\n    const char* name;\n  };\n\n  size_t Fib(size_t n)\n  {\n    if (n<2) {\n      return n;\n    }\n    else {\n      size_t x, y;\n      tbb::parallel_invoke([&]{x=Fib(n-1);}, [&]{y=Fib(n-2);});\n      return x+y;\n    }\n  }\n\n  void main()\n  {\n#if 1\n    const size_t N = 30;\n    {\n      task_scheduler_regression_test task_scheduler_regression(\"task_scheduler_regression_test\");\n      task_scheduler_regression(N);\n    }\n    {\n      tbb::task_scheduler_init init(tbb::task_scheduler_init::default_num_threads());\n      \/\/tbb::task_scheduler_init init(1);\n      double t0 = getSeconds();\n      size_t r0 = Fib(N);\n      double t1 = getSeconds();\n      printf(\"  tbb_fib(%zu) = %zu, %3.2fms\\n\",N,r0,1000.0f*(t1-t0));\n\n    }\n#else\n\n    const size_t N = 100*1024*1024;\n    const size_t N_seq = 10*1024*1024;\n\n    \/* parallel reduction *\/\n    reduce.init(N);\n    \n    fs.open (\"benchmark_reduce_sequential.csv\", std::fstream::out);\n    benchmark(1000,N_seq,\"reduce_sequential\",[] (size_t N) -> double { return reduce.run_sequential(N); });\n    fs.close();\n\n    fs.open (\"benchmark_reduce_lockstep.csv\", std::fstream::out);\n    TaskScheduler::create();\n    execute_closure([&] () -> double { benchmark(1000,N,\"reduce_lockstep\",[] (size_t N) -> double { return reduce.run_locksteptaskscheduler(N); }); return 0.0; });\n    TaskScheduler::destroy();\n    fs.close();\n\n    {\n      fs.open (\"benchmark_reduce_tbb.csv\", std::fstream::out);\n      tbb::task_scheduler_init init(tbb::task_scheduler_init::default_num_threads());\n      benchmark(1000,N,\"reduce_tbb\",[] (size_t N) -> double { return reduce.run_tbb(N); });\n      fs.close();\n    }\n\n    \/* parallel sort *\/\n    int* src = new int[N];\n    int* array = new int[N];\n    int* temp = new int[N];\n    for (size_t i=0; i<N; i++) src[i] = random<int>();\n    for (size_t i=0; i<N; i++) array[i] = i;\n    for (size_t i=0; i<N; i++) temp[i] = i;\n\n    fs.open (\"benchmark_sort_sequential.csv\", std::fstream::out);\n    benchmark(1000,N_seq,\"sort_sequential\",[&] (size_t N) -> double \n    { \n      for (size_t i=0; i<N; i++) array[i] = src[i];\n      double t0 = getSeconds();\n      std::sort(array,array+N); \n      double t1 = getSeconds();\n      \/\/for (size_t i=1; i<N; i++) if (array[i] < array[i-1]) { std::cerr << \"internal error\" << std::endl;  exit(1); }\n      return t1-t0; \n    });\n    fs.close();\n\n    {\n      fs.open (\"benchmark_sort_tbb.csv\", std::fstream::out);\n      tbb::task_scheduler_init init(tbb::task_scheduler_init::default_num_threads());\n      benchmark(1000,N,\"sort_tbb\",[&] (size_t N) -> double \n      { \n        for (size_t i=0; i<N; i++) array[i] = src[i];\n        double t0 = getSeconds();\n        tbb::parallel_sort(array,array+N); \n        double t1 = getSeconds();\n        \/\/for (size_t i=1; i<N; i++) if (array[i] < array[i-1]) { std::cerr << \"internal error\" << std::endl;  exit(1); }\n        return t1-t0; \n      });\n      fs.close();\n    }\n\n    fs.open (\"benchmark_sort_lockstep.csv\", std::fstream::out);\n    TaskScheduler::create();\n    execute_closure([&] () -> double \n    { \n      benchmark(1000,N,\"sort_lockstep\",[&] (size_t N) -> double\n      { \n        for (size_t i=0; i<N; i++) array[i] = src[i];\n        double t0 = getSeconds();\n        radix_sort_u32(array,temp,N); \n        double t1 = getSeconds();\n        \/\/for (size_t i=1; i<N; i++) if (array[i] < array[i-1]) { std::cerr << \"internal error\" << std::endl;  exit(1); }\n        return t1-t0; \n      });\n      return 0.0;\n    });\n    TaskScheduler::destroy();\n    fs.close();\n#endif\n  }\n}\n\nint main() {\n  embree::main();\n  return 0;\n}\n  \n  \n  \n  \n  \n  \n<commit_msg>updates to benchmark_tasking<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 \"tasking\/taskscheduler.h\"\n#include \"tasking\/taskscheduler_new.h\"\n\n#include \"math\/math.h\"\n#include \"kernels\/algorithms\/sort.h\"\n#include <tbb\/tbb.h>\n\nnamespace embree\n{\n  std::fstream fs;\n\n  struct reduce_benchmark\n  {\n    reduce_benchmark() \n      : N(0), array(NULL) {}\n    \n    size_t N;\n    double* array;\n    double threadReductions[1024];\n    \n    TASK_FUNCTION_(reduce_benchmark,reduce);\n    \n    void reduce(size_t threadIndex, size_t threadCount)\n    {\n      const size_t begin = (threadIndex+0)*N\/threadCount;\n      const size_t end   = (threadIndex+1)*N\/threadCount;\n      double c = 0;\n      for (size_t i=begin; i<end; i++) c += sin(array[i]);\n      threadReductions[threadIndex] = c;\n    }\n    \n    void init(size_t N)\n    {\n      this->N = N;\n      array = new double[N];\n\n      for (size_t i=0; i<N; i++) \n        array[i] = drand48();\n\n      \n    }\n\n    double reduce_sequential(size_t N)\n    {\n      double sum = 0.0;\n      for (size_t i=0; i<N; i++) \n        sum += sin(array[i]);\n      return sum;\n    }\n    \n    double run_sequential (size_t N) \n    {\n      double t0 = getSeconds();\n      double c0 = 0;\n      for (size_t i=0; i<N; i++) c0 += sin(array[i]);\n      volatile double result = c0;\n      double t1 = getSeconds();\n\n      \/*double sum = reduce_sequential(N);\n      if (abs(sum-c0) > 1E-5) {\n        std::cerr << \"internal error: \" << sum << \" != \" << c0 << std::endl;\n        exit(1);\n        }*\/\n      return t1-t0;\n    }  \n    \n    double run_locksteptaskscheduler(size_t N)\n    {\n      double t0 = getSeconds();\n      this->N = N;\n      LockStepTaskScheduler* scheduler = LockStepTaskScheduler::instance();\n      scheduler->dispatchTask( task_reduce, this, 0, scheduler->getNumThreads() );\n      \n      double c = 0;\n      for (size_t i=0; i<scheduler->getNumThreads(); i++) \n        c += threadReductions[i];\n      volatile double result = c;\n      double t1 = getSeconds();\n\n      \/*double sum = reduce_sequential(N);\n      if (abs(sum-c) > 1E-5) {\n        std::cerr << \"internal error: \" << sum << \" != \" << c << std::endl;\n        exit(1);\n        }*\/\n      return t1-t0;\n    }\n    \n    double run_tbb(size_t N)\n    {\n      double t0 = getSeconds();\n      double c2 = 0;\n      \/\/LockStepTaskScheduler::execute_tbb([&] () {\n      c2 = tbb::parallel_reduce(tbb::blocked_range<size_t>(0,N,1024), 0.0, \n                                [&](const tbb::blocked_range<size_t>& r, double value) -> double {\n                                  double c = value; \n                                  for (size_t i=r.begin(); i<r.end(); i++) c += sin(array[i]); \n                                  return c;\n                                },\n                                std::plus<double>());\n      \/\/});\n      volatile double result = c2;\n      double t1 = getSeconds();\n\n      \/*double sum = reduce_sequential(N);\n      if (abs(sum-c2) > 1E-5) {\n        std::cerr << \"internal error: \" << sum << \" != \" << c2 << std::endl;\n        exit(1);\n        }*\/\n      return t1-t0;\n    }\n    \n    const char* name;\n  };\n\n  template<typename Closure>\n  void benchmark(size_t N0, size_t N1, const char* name, const Closure& closure)\n  {\n    fs << \"# \" << name << std::endl;\n    fs << \"# N dt_min dt_avg dt_max M\/s(min) M\/s(avg) M\/s(max)\" << std::endl;\n    for (size_t N = N0; N < N1; N *= 1.5) \n    {\n      double t_min = pos_inf;\n      double t_avg = 0.0f;\n      double t_max = neg_inf;\n      for (size_t i=0; i<10; i++)\n      {\n        double dt = closure(N);\n        t_min = min(t_min,dt);\n        if (i != 0) t_avg = t_avg + dt;\n        t_max = max(t_max,dt);\n      }\n      t_avg \/= 9.0;\n      fs << N << \" \" \n                << 1000.0f*t_min << \" \" << 1000.0f*t_avg << \" \" << 1000.0f*t_max << \" \" \n                << 1E-6*N\/t_max << \" \" << 1E-6*N\/t_avg << \" \" << 1E-6*N\/t_min << std::endl;\n    }\n  }\n\n  reduce_benchmark reduce;\n\n  const int CUTOFF = 20;\n\n  size_t fib(size_t i)\n  {\n    if (i == 0) \n      return 0;\n    else if (i == 1) \n      return 1;\n    else {\n      return fib(i-1) + fib(i-2);\n    }\n  }\n\n  \/* regression testing *\/\n  struct task_scheduler_regression_test \/\/: public RegressionTest\n  {\n    task_scheduler_regression_test(const char* name) : name(name) {\n      \/\/registerRegressionTest(this);\n    }\n    \n    bool operator() (size_t N)\n    {\n      bool passed = true;\n      printf(\"%s::%s ... \\n\",TOSTRING(isa),name);\n      fflush(stdout);\n\n      \/* create task scheduler *\/\n      TaskSchedulerNew* scheduler = new TaskSchedulerNew(8);\n\n      struct Fib\n      {\n        size_t& r;\n        size_t i;\n        \n        __forceinline Fib (size_t& r, size_t i) : r(r), i(i) {}\n        \n        void operator() (size_t, size_t) const\n        {\n          if (i < CUTOFF) {\n            r = fib(i); \/\/i;\n          } else {\n            size_t r0; const Fib fib0(r0, i-1);\n            size_t r1; const Fib fib1(r1, i-2);\n            TaskSchedulerNew::spawn(fib0);\n            TaskSchedulerNew::spawn(fib1);\n            TaskSchedulerNew::wait();\n            r = r0+r1;\n          }\n        }\n      };\n\n      \/* parallel calculation of sum of fibonacci number *\/\n      double t0 = getSeconds();\n      size_t r0 = fib(N);\n      double t1 = getSeconds();\n      size_t r1; Fib pfib(r1,N);\n      scheduler->spawn_root(pfib);\n      double t2 = getSeconds();\n\n      printf(\"  sequential_fib(%zu) = %zu, %3.2fms\\n\",N,r0,1000.0f*(t1-t0));\n      printf(\"  parallel_fib  (%zu) = %zu, %3.2fms\\n\",N,r1,1000.0f*(t2-t1));\n      passed = r0 == r1;\n            \n      \/* output if test passed or not *\/\n      if (passed) printf(\"[passed]\\n\");\n      else        printf(\"[failed]\\n\");\n\n      delete scheduler;\n      return passed;\n    }\n\n    const char* name;\n  };\n\n  size_t Fib(size_t n)\n  {\n    if (n<CUTOFF) {\n      return fib(n);\n    }\n    else {\n      size_t x, y;\n      \/\/for (volatile size_t i=0; ; i++);\n      tbb::parallel_invoke([&]{x=Fib(n-1);}, [&]{y=Fib(n-2);});\n      \/\/if (n == 40) *((char*)NULL) = 0;\n      return x+y;\n    }\n  }\n\n  struct myobserver : public tbb::task_scheduler_observer\n  {\n    virtual void on_scheduler_entry( bool is_worker ) {\n      PRINT(\"on_scheduler_entry\");\n    }\n    virtual void on_scheduler_exit( bool is_worker ) {\n      PRINT(\"on_scheduler_exit\");\n    }\n  };\n\n  void main()\n  {\n#if 0\n    const size_t N = 40;\n    \/\/tbb::task_arena limited(2);\n    \/\/limited.my_limit = 1000000;\n\n    \/*{\n      task_scheduler_regression_test task_scheduler_regression(\"task_scheduler_regression_test\");\n      task_scheduler_regression(N);\n      }*\/\n    {\n      \/\/tbb::task_scheduler_init init(tbb::task_scheduler_init::default_num_threads());\n      tbb::task_scheduler_init init(8);\n      myobserver observer; observer.observe();\n      double t0 = getSeconds();\n      size_t r0 = Fib(N);\n      double t1 = getSeconds();\n      \/\/sleep(1);\n      \/\/*((char*)NULL) = 0;\n      \/\/Fib(N);\n      printf(\"  tbb_fib(%zu) = %zu, %3.2fms\\n\",N,r0,1000.0f*(t1-t0));\n\n    }\n#else\n\n    const size_t N = 100*1024*1024;\n    const size_t N_seq = 10*1024*1024;\n\n    \/* parallel reduction *\/\n    reduce.init(N);\n    \n    fs.open (\"benchmark_reduce_sequential.csv\", std::fstream::out);\n    benchmark(1000,N_seq,\"reduce_sequential\",[] (size_t N) -> double { return reduce.run_sequential(N); });\n    fs.close();\n\n    fs.open (\"benchmark_reduce_lockstep.csv\", std::fstream::out);\n    TaskScheduler::create();\n    execute_closure([&] () -> double { benchmark(1000,N,\"reduce_lockstep\",[] (size_t N) -> double { return reduce.run_locksteptaskscheduler(N); }); return 0.0; });\n    TaskScheduler::destroy();\n    fs.close();\n\n    {\n      fs.open (\"benchmark_reduce_tbb.csv\", std::fstream::out);\n      tbb::task_scheduler_init init(tbb::task_scheduler_init::default_num_threads());\n      benchmark(1000,N,\"reduce_tbb\",[] (size_t N) -> double { return reduce.run_tbb(N); });\n      fs.close();\n    }\n\n    \/* parallel sort *\/\n    int* src = new int[N];\n    int* array = new int[N];\n    int* temp = new int[N];\n    for (size_t i=0; i<N; i++) src[i] = random<int>();\n    for (size_t i=0; i<N; i++) array[i] = i;\n    for (size_t i=0; i<N; i++) temp[i] = i;\n\n    fs.open (\"benchmark_sort_sequential.csv\", std::fstream::out);\n    benchmark(1000,N_seq,\"sort_sequential\",[&] (size_t N) -> double \n    { \n      for (size_t i=0; i<N; i++) array[i] = src[i];\n      double t0 = getSeconds();\n      std::sort(array,array+N); \n      double t1 = getSeconds();\n      \/\/for (size_t i=1; i<N; i++) if (array[i] < array[i-1]) { std::cerr << \"internal error\" << std::endl;  exit(1); }\n      return t1-t0; \n    });\n    fs.close();\n\n    {\n      fs.open (\"benchmark_sort_tbb.csv\", std::fstream::out);\n      tbb::task_scheduler_init init(tbb::task_scheduler_init::default_num_threads());\n      benchmark(1000,N,\"sort_tbb\",[&] (size_t N) -> double \n      { \n        for (size_t i=0; i<N; i++) array[i] = src[i];\n        double t0 = getSeconds();\n        tbb::parallel_sort(array,array+N); \n        double t1 = getSeconds();\n        \/\/for (size_t i=1; i<N; i++) if (array[i] < array[i-1]) { std::cerr << \"internal error\" << std::endl;  exit(1); }\n        return t1-t0; \n      });\n      fs.close();\n    }\n\n    fs.open (\"benchmark_sort_lockstep.csv\", std::fstream::out);\n    TaskScheduler::create();\n    execute_closure([&] () -> double \n    { \n      benchmark(1000,N,\"sort_lockstep\",[&] (size_t N) -> double\n      { \n        for (size_t i=0; i<N; i++) array[i] = src[i];\n        double t0 = getSeconds();\n        radix_sort_u32(array,temp,N); \n        double t1 = getSeconds();\n        \/\/for (size_t i=1; i<N; i++) if (array[i] < array[i-1]) { std::cerr << \"internal error\" << std::endl;  exit(1); }\n        return t1-t0; \n      });\n      return 0.0;\n    });\n    TaskScheduler::destroy();\n    fs.close();\n#endif\n  }\n}\n\nint main() {\n  embree::main();\n  return 0;\n}\n  \n  \n  \n  \n  \n  \n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright 2019 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#define CATCH_CONFIG_ENABLE_BENCHMARKING\n\n#include \"util\/test_file.hpp\"\n#include \"util\/test_utils.hpp\"\n\n#include \"impl\/object_accessor_impl.hpp\"\n#include \"impl\/realm_coordinator.hpp\"\n#include \"binding_context.hpp\"\n#include \"object_schema.hpp\"\n#include \"property.hpp\"\n#include \"results.hpp\"\n#include \"schema.hpp\"\n\n#include <realm\/db.hpp>\n#include <realm\/query_engine.hpp>\n#include <realm\/query_expression.hpp>\n\nusing namespace realm;\n\nstruct TestContext : CppContext {\n    std::map<std::string, AnyDict> defaults;\n\n    using CppContext::CppContext;\n    TestContext(TestContext& parent, realm::Property const& prop)\n    : CppContext(parent, prop)\n    , defaults(parent.defaults)\n    { }\n\n    util::Optional<util::Any>\n    default_value_for_property(ObjectSchema const& object, Property const& prop)\n    {\n        auto obj_it = defaults.find(object.name);\n        if (obj_it == defaults.end())\n            return util::none;\n        auto prop_it = obj_it->second.find(prop.name);\n        if (prop_it == obj_it->second.end())\n            return util::none;\n        return prop_it->second;\n    }\n\n    void will_change(Object const&, Property const&) {}\n    void did_change() {}\n    std::string print(util::Any) { return \"not implemented\"; }\n    bool allow_missing(util::Any) { return false; }\n};\n\n\n\nTEST_CASE(\"Benchmark object\", \"[benchmark]\") {\n    using namespace std::string_literals;\n    using AnyVec = std::vector<util::Any>;\n    using AnyDict = std::map<std::string, util::Any>;\n    _impl::RealmCoordinator::assert_no_open_realms();\n\n    InMemoryTestFile config;\n    config.automatic_change_notifications = false;\n    config.schema = Schema{\n        {\"all types\", {\n            {\"pk\", PropertyType::Int, Property::IsPrimary{true}},\n            {\"bool\", PropertyType::Bool},\n            {\"int\", PropertyType::Int},\n            {\"float\", PropertyType::Float},\n            {\"double\", PropertyType::Double},\n            {\"string\", PropertyType::String},\n            {\"data\", PropertyType::Data},\n            {\"date\", PropertyType::Date},\n            {\"object\", PropertyType::Object|PropertyType::Nullable, \"link target\"},\n\n            {\"bool array\", PropertyType::Array|PropertyType::Bool},\n            {\"int array\", PropertyType::Array|PropertyType::Int},\n            {\"float array\", PropertyType::Array|PropertyType::Float},\n            {\"double array\", PropertyType::Array|PropertyType::Double},\n            {\"string array\", PropertyType::Array|PropertyType::String},\n            {\"data array\", PropertyType::Array|PropertyType::Data},\n            {\"date array\", PropertyType::Array|PropertyType::Date},\n            {\"object array\", PropertyType::Array|PropertyType::Object, \"array target\"},\n        }},\n        {\"link target\", {\n            {\"value\", PropertyType::Int},\n        }, {\n            {\"origin\", PropertyType::LinkingObjects|PropertyType::Array, \"all types\", \"object\"},\n        }},\n        {\"array target\", {\n            {\"value\", PropertyType::Int},\n        }},\n        {\"person\", {\n            {\"name\", PropertyType::String, Property::IsPrimary{true}},\n            {\"age\", PropertyType::Int},\n            {\"scores\", PropertyType::Array|PropertyType::Int},\n            {\"assistant\", PropertyType::Object|PropertyType::Nullable, \"person\"},\n            {\"team\", PropertyType::Array|PropertyType::Object, \"person\"},\n        }},\n    };\n\n    config.schema_version = 0;\n    auto r = Realm::get_shared_realm(config);\n    TestContext d(r);\n\n    auto create_person = [&](util::Any&& value, bool update, bool update_only_diff = false) {\n        r->begin_transaction();\n        auto obj = Object::create(d, r, *r->schema().find(\"person\"), value, update, update_only_diff);\n        r->commit_transaction();\n        return obj;\n    };\n\n    SECTION(\"create object\") {\n        r->begin_transaction();\n        ObjectSchema all_types = *r->schema().find(\"all types\");\n        constexpr bool update = false;\n        constexpr bool update_only_diff = false;\n\n        int64_t benchmark_pk = 0;\n        BENCHMARK(\"create object\") {\n            return Object::create(d, r, all_types, util::Any(AnyDict{\n                {\"pk\", benchmark_pk++},\n                {\"bool\", true},\n                {\"int\", INT64_C(5)},\n                {\"float\", 2.2f},\n                {\"double\", 3.3},\n                {\"string\", \"hello\"s},\n                {\"data\", \"olleh\"s},\n                {\"date\", Timestamp(10, 20)},\n                {\"object\", AnyDict{{\"value\", INT64_C(10)}}},\n\n                {\"bool array\", AnyVec{true, false}},\n                {\"int array\", AnyVec{INT64_C(5), INT64_C(6)}},\n                {\"float array\", AnyVec{1.1f, 2.2f}},\n                {\"double array\", AnyVec{3.3, 4.4}},\n                {\"string array\", AnyVec{\"a\"s, \"b\"s, \"c\"s}},\n                {\"data array\", AnyVec{\"d\"s, \"e\"s, \"f\"s}},\n                {\"date array\", AnyVec{}},\n                {\"object array\", AnyVec{AnyDict{{\"value\", INT64_C(20)}}}},\n            }), update, update_only_diff);\n        };\n        r->commit_transaction();\n    }\n\n    SECTION(\"update object\") {\n        auto table = r->read_group().get_table(\"class_all types\");\n        r->begin_transaction();\n        ObjectSchema all_types = *r->schema().find(\"all types\");\n        constexpr bool update = false;\n        constexpr bool update_only_diff = false;\n        auto obj = Object::create(d, r, all_types, util::Any(AnyDict{\n            {\"pk\", INT64_C(0)},\n            {\"bool\", true},\n            {\"int\", INT64_C(5)},\n            {\"float\", 2.2f},\n            {\"double\", 3.3},\n            {\"string\", \"hello\"s},\n            {\"data\", \"olleh\"s},\n            {\"date\", Timestamp(10, 20)},\n            {\"object\", AnyDict{{\"value\", INT64_C(10)}}},\n\n            {\"bool array\", AnyVec{true, false}},\n            {\"int array\", AnyVec{INT64_C(5), INT64_C(6)}},\n            {\"float array\", AnyVec{1.1f, 2.2f}},\n            {\"double array\", AnyVec{3.3, 4.4}},\n            {\"string array\", AnyVec{\"a\"s, \"b\"s, \"c\"s}},\n            {\"data array\", AnyVec{\"d\"s, \"e\"s, \"f\"s}},\n            {\"date array\", AnyVec{}},\n            {\"object array\", AnyVec{AnyDict{{\"value\", INT64_C(20)}}}},\n        }), update, update_only_diff);\n        r->commit_transaction();\n\n        Results result(r, *table);\n        size_t num_modifications = 0;\n        auto token = result.add_notification_callback([&](CollectionChangeSet c, std::exception_ptr) {\n            num_modifications += c.modifications.count();\n        });\n\n        advance_and_notify(*r);\n        int64_t update_int = 1;\n        ColKey col_int = table->get_column_key(\"int\");\n        REQUIRE(col_int);\n        BENCHMARK_ADVANCED(\"update object\")(Catch::Benchmark::Chronometer meter) {\n            r->begin_transaction();\n            meter.measure([&d, &all_types, &update_int, &r] {\n                auto shadow = Object::create(d, r, all_types, util::Any(AnyDict{\n                    {\"pk\", INT64_C(0)},\n                    {\"int\", update_int},\n                }), true, true);\n            });\n            r->commit_transaction();\n            advance_and_notify(*r);\n            REQUIRE(result.size() == 1);\n            REQUIRE(result.get(0).get<Int>(col_int) == update_int);\n            update_int++;\n        };\n    }\n\n    SECTION(\"change notifications reporting\") {\n        auto table = r->read_group().get_table(\"class_person\");\n        Results result(r, *table);\n        size_t num_calls = 0;\n        size_t num_insertions = 0;\n        auto token = result.add_notification_callback([&](CollectionChangeSet c, std::exception_ptr) {\n            num_insertions += c.insertions.count();\n            ++num_calls;\n        });\n\n        advance_and_notify(*r);\n        int64_t pk = 0;\n        BENCHMARK_ADVANCED(\"create notifications\")(Catch::Benchmark::Chronometer meter) {\n            std::stringstream name;\n            name << \"person_\" << pk++;\n            AnyDict person {\n                {\"name\", name.str()},\n                {\"age\", pk},\n            };\n            create_person(person, true, false);\n            meter.measure([&r] {\n                advance_and_notify(*r);\n            });\n            REQUIRE(static_cast<int64_t>(num_calls) == pk + 1);\n            REQUIRE(static_cast<int64_t>(num_insertions) == pk);\n        };\n    }\n}\n\n<commit_msg>Add more notification benchmarks<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright 2019 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#define CATCH_CONFIG_ENABLE_BENCHMARKING\n\n#include \"util\/index_helpers.hpp\"\n#include \"util\/test_file.hpp\"\n#include \"util\/test_utils.hpp\"\n\n#include \"impl\/object_accessor_impl.hpp\"\n#include \"impl\/realm_coordinator.hpp\"\n#include \"binding_context.hpp\"\n#include \"object_schema.hpp\"\n#include \"property.hpp\"\n#include \"results.hpp\"\n#include \"schema.hpp\"\n\n#include <realm\/db.hpp>\n#include <realm\/query_engine.hpp>\n#include <realm\/query_expression.hpp>\n\nusing namespace realm;\n\nstruct TestContext : CppContext {\n    std::map<std::string, AnyDict> defaults;\n\n    using CppContext::CppContext;\n    TestContext(TestContext& parent, realm::Property const& prop)\n    : CppContext(parent, prop)\n    , defaults(parent.defaults)\n    { }\n\n    util::Optional<util::Any>\n    default_value_for_property(ObjectSchema const& object, Property const& prop)\n    {\n        auto obj_it = defaults.find(object.name);\n        if (obj_it == defaults.end())\n            return util::none;\n        auto prop_it = obj_it->second.find(prop.name);\n        if (prop_it == obj_it->second.end())\n            return util::none;\n        return prop_it->second;\n    }\n\n    void will_change(Object const&, Property const&) {}\n    void did_change() {}\n    std::string print(util::Any) { return \"not implemented\"; }\n    bool allow_missing(util::Any) { return false; }\n};\n\nTEST_CASE(\"Benchmark index change calculations\", \"[benchmark]\") {\n    _impl::CollectionChangeBuilder c;\n\n    auto all_modified = [](size_t) { return true; };\n    auto none_modified = [](size_t) { return false; };\n\n    SECTION(\"reports inserts\/deletes for simple reorderings\") {\n        auto calc = [&](std::vector<int64_t> old_rows, std::vector<int64_t> new_rows, std::function<bool (size_t)> modifications) {\n            return _impl::CollectionChangeBuilder::calculate(old_rows, new_rows, modifications);\n        };\n        std::vector<int64_t> indices = {};\n        constexpr size_t indices_size = 10000;\n        indices.reserve(indices_size);\n        for (size_t i = 0; i < indices_size; ++i) {\n            indices.push_back(i);\n        }\n\n        BENCHMARK(\"no changes\") {\n            c = calc(indices, indices, none_modified);\n        };\n        REQUIRE(c.insertions.empty());\n        REQUIRE(c.deletions.empty());\n\n        BENCHMARK(\"all modified\") {\n            c = calc(indices, indices, all_modified);\n        };\n        REQUIRE(c.insertions.empty());\n        REQUIRE(c.deletions.empty());\n\n        BENCHMARK(\"calc 1\") {\n            c = calc({1, 2, 3}, {1, 3, 2}, none_modified);\n        };\n        REQUIRE_INDICES(c.insertions, 1);\n        REQUIRE_INDICES(c.deletions, 2);\n\n        BENCHMARK(\"calc 2\") {\n            c = calc({1, 2, 3}, {2, 1, 3}, none_modified);\n        };\n        REQUIRE_INDICES(c.insertions, 0);\n        REQUIRE_INDICES(c.deletions, 1);\n\n        BENCHMARK(\"calc 3\") {\n            c = calc({1, 2, 3}, {2, 3, 1}, none_modified);\n        };\n        REQUIRE_INDICES(c.insertions, 2);\n        REQUIRE_INDICES(c.deletions, 0);\n\n        BENCHMARK(\"calc 4\") {\n            c = calc({1, 2, 3}, {3, 1, 2}, none_modified);\n        };\n        REQUIRE_INDICES(c.insertions, 0);\n        REQUIRE_INDICES(c.deletions, 2);\n\n        BENCHMARK(\"calc 5\") {\n            c = calc({1, 2, 3}, {3, 2, 1}, none_modified);\n        };\n        REQUIRE_INDICES(c.insertions, 0, 1);\n        REQUIRE_INDICES(c.deletions, 1, 2);\n    }\n}\n\nTEST_CASE(\"Benchmark object\", \"[benchmark]\") {\n    using namespace std::string_literals;\n    using AnyVec = std::vector<util::Any>;\n    using AnyDict = std::map<std::string, util::Any>;\n    _impl::RealmCoordinator::assert_no_open_realms();\n\n    InMemoryTestFile config;\n    config.automatic_change_notifications = false;\n    config.schema = Schema{\n        {\"all types\", {\n            {\"pk\", PropertyType::Int, Property::IsPrimary{true}},\n            {\"bool\", PropertyType::Bool},\n            {\"int\", PropertyType::Int},\n            {\"float\", PropertyType::Float},\n            {\"double\", PropertyType::Double},\n            {\"string\", PropertyType::String},\n            {\"data\", PropertyType::Data},\n            {\"date\", PropertyType::Date},\n            {\"object\", PropertyType::Object|PropertyType::Nullable, \"link target\"},\n\n            {\"bool array\", PropertyType::Array|PropertyType::Bool},\n            {\"int array\", PropertyType::Array|PropertyType::Int},\n            {\"float array\", PropertyType::Array|PropertyType::Float},\n            {\"double array\", PropertyType::Array|PropertyType::Double},\n            {\"string array\", PropertyType::Array|PropertyType::String},\n            {\"data array\", PropertyType::Array|PropertyType::Data},\n            {\"date array\", PropertyType::Array|PropertyType::Date},\n            {\"object array\", PropertyType::Array|PropertyType::Object, \"array target\"},\n        }},\n        {\"link target\", {\n            {\"value\", PropertyType::Int},\n        }, {\n            {\"origin\", PropertyType::LinkingObjects|PropertyType::Array, \"all types\", \"object\"},\n        }},\n        {\"array target\", {\n            {\"value\", PropertyType::Int},\n        }},\n        {\"person\", {\n            {\"name\", PropertyType::String, Property::IsPrimary{true}},\n            {\"age\", PropertyType::Int},\n            {\"scores\", PropertyType::Array|PropertyType::Int},\n            {\"assistant\", PropertyType::Object|PropertyType::Nullable, \"person\"},\n            {\"team\", PropertyType::Array|PropertyType::Object, \"person\"},\n        }},\n    };\n\n    config.schema_version = 0;\n    auto r = Realm::get_shared_realm(config);\n    TestContext d(r);\n\n    SECTION(\"create object\") {\n        r->begin_transaction();\n        ObjectSchema all_types = *r->schema().find(\"all types\");\n        constexpr bool update = false;\n        constexpr bool update_only_diff = false;\n\n        int64_t benchmark_pk = 0;\n        BENCHMARK(\"create object\") {\n            return Object::create(d, r, all_types, util::Any(AnyDict{\n                {\"pk\", benchmark_pk++},\n                {\"bool\", true},\n                {\"int\", INT64_C(5)},\n                {\"float\", 2.2f},\n                {\"double\", 3.3},\n                {\"string\", \"hello\"s},\n                {\"data\", \"olleh\"s},\n                {\"date\", Timestamp(10, 20)},\n                {\"object\", AnyDict{{\"value\", INT64_C(10)}}},\n\n                {\"bool array\", AnyVec{true, false}},\n                {\"int array\", AnyVec{INT64_C(5), INT64_C(6)}},\n                {\"float array\", AnyVec{1.1f, 2.2f}},\n                {\"double array\", AnyVec{3.3, 4.4}},\n                {\"string array\", AnyVec{\"a\"s, \"b\"s, \"c\"s}},\n                {\"data array\", AnyVec{\"d\"s, \"e\"s, \"f\"s}},\n                {\"date array\", AnyVec{}},\n                {\"object array\", AnyVec{AnyDict{{\"value\", INT64_C(20)}}}},\n            }), update, update_only_diff);\n        };\n        r->commit_transaction();\n    }\n\n    SECTION(\"update object\") {\n        auto table = r->read_group().get_table(\"class_all types\");\n        r->begin_transaction();\n        ObjectSchema all_types = *r->schema().find(\"all types\");\n        constexpr bool update = false;\n        constexpr bool update_only_diff = false;\n        auto obj = Object::create(d, r, all_types, util::Any(AnyDict{\n            {\"pk\", INT64_C(0)},\n            {\"bool\", true},\n            {\"int\", INT64_C(5)},\n            {\"float\", 2.2f},\n            {\"double\", 3.3},\n            {\"string\", \"hello\"s},\n            {\"data\", \"olleh\"s},\n            {\"date\", Timestamp(10, 20)},\n            {\"object\", AnyDict{{\"value\", INT64_C(10)}}},\n\n            {\"bool array\", AnyVec{true, false}},\n            {\"int array\", AnyVec{INT64_C(5), INT64_C(6)}},\n            {\"float array\", AnyVec{1.1f, 2.2f}},\n            {\"double array\", AnyVec{3.3, 4.4}},\n            {\"string array\", AnyVec{\"a\"s, \"b\"s, \"c\"s}},\n            {\"data array\", AnyVec{\"d\"s, \"e\"s, \"f\"s}},\n            {\"date array\", AnyVec{}},\n            {\"object array\", AnyVec{AnyDict{{\"value\", INT64_C(20)}}}},\n        }), update, update_only_diff);\n        r->commit_transaction();\n\n        Results result(r, *table);\n        size_t num_modifications = 0;\n        auto token = result.add_notification_callback([&](CollectionChangeSet c, std::exception_ptr) {\n            num_modifications += c.modifications.count();\n        });\n\n        advance_and_notify(*r);\n        int64_t update_int = 1;\n        ColKey col_int = table->get_column_key(\"int\");\n        REQUIRE(col_int);\n        BENCHMARK_ADVANCED(\"update object\")(Catch::Benchmark::Chronometer meter) {\n            r->begin_transaction();\n            meter.measure([&d, &all_types, &update_int, &r] {\n                auto shadow = Object::create(d, r, all_types, util::Any(AnyDict{\n                    {\"pk\", INT64_C(0)},\n                    {\"int\", update_int},\n                }), true, true);\n            });\n            r->commit_transaction();\n            advance_and_notify(*r);\n            REQUIRE(result.size() == 1);\n            REQUIRE(result.get(0).get<Int>(col_int) == update_int);\n            update_int++;\n        };\n    }\n\n    SECTION(\"change notifications reporting\") {\n        auto table = r->read_group().get_table(\"class_person\");\n        Results result(r, *table);\n        size_t num_calls = 0;\n        size_t num_insertions = 0;\n        size_t num_deletions = 0;\n        size_t num_modifications = 0;\n        auto token = result.add_notification_callback([&](CollectionChangeSet c, std::exception_ptr) {\n            num_insertions += c.insertions.count();\n            num_deletions += c.deletions.count();\n            num_modifications += c.modifications_new.count();\n            ++num_calls;\n        });\n\n        advance_and_notify(*r);\n        int64_t pk = 0;\n        ObjectSchema person_schema = *r->schema().find(\"person\");\n        constexpr size_t num_objects = 100;\n        constexpr bool update = false;\n        constexpr bool update_only_diff = false;\n\n        BENCHMARK_ADVANCED(\"create notifications\")(Catch::Benchmark::Chronometer meter) {\n            r->begin_transaction();\n            result.clear();\n            r->commit_transaction();\n            advance_and_notify(*r);\n            num_insertions = 0;\n            num_modifications = 0;\n            num_deletions = 0;\n\n            r->begin_transaction();\n            for (size_t i = 0; i < num_objects; ++i) {\n                std::stringstream name;\n                name << \"person_\" << i;\n                AnyDict person {\n                    {\"name\", name.str()},\n                    {\"age\", static_cast<int64_t>(i)},\n                };\n                Object::create(d, r, person_schema, Any(person), update, update_only_diff);\n            }\n            r->commit_transaction();\n            meter.measure([&r] {\n                advance_and_notify(*r);\n            });\n            REQUIRE(num_insertions == num_objects);\n            REQUIRE(num_modifications == 0);\n            REQUIRE(num_deletions == 0);\n            REQUIRE(result.size() == num_objects);\n        };\n\n        r->begin_transaction();\n        result.clear();\n        r->commit_transaction();\n        advance_and_notify(*r);\n        pk = 0;\n        num_calls = 0;\n\n        BENCHMARK_ADVANCED(\"delete notifications\")(Catch::Benchmark::Chronometer meter) {\n            r->begin_transaction();\n            result.clear();\n            r->commit_transaction();\n            advance_and_notify(*r);\n            num_insertions = 0;\n            num_modifications = 0;\n            num_deletions = 0;\n\n            r->begin_transaction();\n            for (size_t i = 0; i < num_objects; ++i) {\n                std::stringstream name;\n                name << \"person_\" << i;\n                AnyDict person {\n                    {\"name\", name.str()},\n                    {\"age\", static_cast<int64_t>(i)},\n                };\n                Object::create(d, r, person_schema, Any(person), update, update_only_diff);\n            }\n            r->commit_transaction();\n            advance_and_notify(*r);\n            REQUIRE(num_insertions == num_objects);\n            REQUIRE(num_modifications == 0);\n            REQUIRE(num_deletions == 0);\n            REQUIRE(result.size() == num_objects);\n\n            r->begin_transaction();\n            result.clear();\n            r->commit_transaction();\n\n            meter.measure([&r] {\n                advance_and_notify(*r);\n            });\n            REQUIRE(num_insertions == num_objects);\n            REQUIRE(num_modifications == 0);\n            REQUIRE(num_deletions == num_objects);\n            REQUIRE(result.size() == 0);\n        };\n\n        BENCHMARK_ADVANCED(\"modify notifications\")(Catch::Benchmark::Chronometer meter) {\n            r->begin_transaction();\n            result.clear();\n            r->commit_transaction();\n            advance_and_notify(*r);\n            num_insertions = 0;\n            num_modifications = 0;\n            num_deletions = 0;\n\n            r->begin_transaction();\n            for (size_t i = 0; i < num_objects; ++i) {\n                std::stringstream name;\n                name << \"person_\" << i;\n                AnyDict person {\n                    {\"name\", name.str()},\n                    {\"age\", static_cast<int64_t>(i)},\n                };\n                Object::create(d, r, person_schema, Any(person), update, update_only_diff);\n            }\n            r->commit_transaction();\n            advance_and_notify(*r);\n            REQUIRE(result.size() == num_objects);\n            REQUIRE(num_insertions == num_objects);\n            REQUIRE(num_modifications == 0);\n            REQUIRE(num_deletions == 0);\n            num_insertions = 0;\n            num_modifications = 0;\n            num_deletions = 0;\n\n            r->begin_transaction();\n            for (size_t i = 0; i < num_objects; ++i) {\n                std::stringstream name;\n                name << \"person_\" << i;\n                AnyDict person {\n                    {\"name\", name.str()},\n                    {\"age\", static_cast<int64_t>(i + 1)}, \/\/ age differs\n                };\n                constexpr bool do_update = true;\n                Object::create(d, r, person_schema, Any(person), do_update, update_only_diff);\n            }\n            r->commit_transaction();\n\n            meter.measure([&r] {\n                advance_and_notify(*r);\n            });\n            REQUIRE(num_insertions == 0);\n            REQUIRE(num_modifications == num_objects);\n            REQUIRE(num_deletions == 0);\n            REQUIRE(result.size() == num_objects);\n        };\n    }\n\n    SECTION(\"change notifications sorted\") {\n        auto table = r->read_group().get_table(\"class_person\");\n        auto age_col = table->get_column_key(\"age\");\n        Results result = Results(r, *table).sort({{\"age\", true}});\n        size_t num_insertions = 0;\n        size_t num_deletions = 0;\n        size_t num_modifications = 0;\n        auto token = result.add_notification_callback([&](CollectionChangeSet c, std::exception_ptr) {\n            num_insertions += c.insertions.count();\n            num_deletions += c.deletions.count();\n            num_modifications += c.modifications_new.count();\n        });\n\n        advance_and_notify(*r);\n        ObjectSchema person_schema = *r->schema().find(\"person\");\n        constexpr bool update = false;\n        constexpr bool update_only_diff = false;\n        auto add_objects = [&](size_t num_objects, size_t start_index = 0) {\n            r->begin_transaction();\n            for (size_t i = 0; i < num_objects; ++i) {\n                size_t index = i + start_index;\n                std::stringstream name;\n                name << \"person_\" << index;\n                AnyDict person {\n                    {\"name\", name.str()},\n                    {\"age\", static_cast<int64_t>(index)},\n                };\n                Object::create(d, r, person_schema, Any(person), update, update_only_diff);\n            }\n            r->commit_transaction();\n        };\n\n        BENCHMARK_ADVANCED(\"prepend insertions\")(Catch::Benchmark::Chronometer meter) {\n            constexpr size_t num_initial_objects = 100;\n            constexpr size_t num_prepend_objects = 100;\n            r->begin_transaction();\n            result.clear();\n            r->commit_transaction();\n            advance_and_notify(*r);\n            add_objects(num_initial_objects, num_prepend_objects);\n            advance_and_notify(*r);\n\n            add_objects(num_prepend_objects, 0);\n\n            num_insertions = 0;\n            num_modifications = 0;\n            num_deletions = 0;\n\n            meter.measure([&r] {\n                advance_and_notify(*r);\n            });\n            REQUIRE(num_insertions == num_prepend_objects);\n            REQUIRE(num_modifications == 0);\n            REQUIRE(num_deletions == 0);\n            REQUIRE(result.size() == num_prepend_objects + num_initial_objects);\n            REQUIRE(result.get(0).get<int64_t>(age_col) == 0);\n            REQUIRE(result.get(result.size() - 1).get<int64_t>(age_col) == num_prepend_objects + num_initial_objects - 1);\n        };\n\n        BENCHMARK_ADVANCED(\"insert even, insert odd\")(Catch::Benchmark::Chronometer meter) {\n            constexpr size_t num_objects = 100;\n            r->begin_transaction();\n            result.clear();\n            r->commit_transaction();\n            advance_and_notify(*r);\n\n            \/\/ insert even\n            r->begin_transaction();\n            for (size_t i = 0; i < num_objects; ++i) {\n                size_t index = i * 2;\n                std::stringstream name;\n                name << \"person_\" << index;\n                AnyDict person {\n                    {\"name\", name.str()},\n                    {\"age\", static_cast<int64_t>(index)},\n                };\n                Object::create(d, r, person_schema, Any(person), update, update_only_diff);\n            }\n            r->commit_transaction();\n            advance_and_notify(*r);\n\n            \/\/ insert odd\n            r->begin_transaction();\n            for (size_t i = 0; i < num_objects; ++i) {\n                size_t index = i * 2 + 1;\n                std::stringstream name;\n                name << \"person_\" << index;\n                AnyDict person {\n                    {\"name\", name.str()},\n                    {\"age\", static_cast<int64_t>(index)},\n                };\n                Object::create(d, r, person_schema, Any(person), update, update_only_diff);\n            }\n            r->commit_transaction();\n\n            num_insertions = 0;\n            num_modifications = 0;\n            num_deletions = 0;\n\n            meter.measure([&r] {\n                advance_and_notify(*r);\n            });\n            REQUIRE(num_insertions == num_objects);\n            REQUIRE(num_modifications == 0);\n            REQUIRE(num_deletions == 0);\n            REQUIRE(result.size() == num_objects * 2);\n            REQUIRE(result.get(0).get<int64_t>(age_col) == 0);\n            REQUIRE(result.get(1).get<int64_t>(age_col) == 1);\n            REQUIRE(result.get(result.size() - 1).get<int64_t>(age_col) == num_objects * 2 - 1);\n        };\n\n        BENCHMARK_ADVANCED(\"insert, delete odds\")(Catch::Benchmark::Chronometer meter) {\n            constexpr size_t num_objects = 200;\n            r->begin_transaction();\n            result.clear();\n            r->commit_transaction();\n            advance_and_notify(*r);\n\n            \/\/ insert\n            add_objects(num_objects);\n            advance_and_notify(*r);\n\n            \/\/ remove odds\n            r->begin_transaction();\n            for (size_t i = result.size(); i > 0; --i) {\n                if (i % 2 == 1) {\n                    Obj odd = result.get(i);\n                    odd.remove();\n                }\n            }\n            r->commit_transaction();\n\n            num_insertions = 0;\n            num_modifications = 0;\n            num_deletions = 0;\n\n            meter.measure([&r] {\n                advance_and_notify(*r);\n            });\n            REQUIRE(num_insertions == 0);\n            REQUIRE(num_modifications == 0);\n            REQUIRE(num_deletions == num_objects \/ 2);\n            REQUIRE(result.size() == num_objects \/ 2);\n            REQUIRE(result.get(0).get<int64_t>(age_col) == 0);\n            REQUIRE(result.get(1).get<int64_t>(age_col) == 2);\n        };\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* mod_dup - duplicates apache requests\n*\n* Copyright (C) 2013 Orange\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF 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\/\/ Stubs for Apache API\n\/\/ don't care about memory leaks\n\/\/ these are just stubs\n\n#include <string>\n#include <sstream>\n\n#include <httpd.h>\n#include <http_config.h>  \/\/ for the config functions\n#include <http_request.h>\n#include <http_protocol.h>\n#include <apr_pools.h>\n#include <apr_hooks.h>\n#include <unixd.h>\n\n#include <http_log.h>\n#include \"testBodies.hh\"\n\n#include <cstring>\n#include <cassert>\n\nunixd_config_rec unixd_config;\n\nAP_DECLARE_NONSTD(int) ap_rprintf( request_rec *r, const char *fmt, ...)\n{\n    assert( r != NULL );\n    assert( fmt != NULL );\n\n    char* lDest = NULL;\n\n    va_list l_ap;\n    va_start(l_ap, fmt);\n\n    int n = vasprintf( &lDest, fmt, l_ap);\n\n    va_end(l_ap);\n\n    if( r->filename == NULL ){\n        r->filename = lDest;\n    }\n    else {\n        std::string lNew(r->filename);\n        lNew.append(lDest);\n        free(r->filename);\n        r->filename = strdup(lNew.c_str());\n        free(lDest);\n    }\n\n     return n;\n};\n\nAP_DECLARE(int) ap_is_initial_req(request_rec *r)\n{\n    return 0;\n};\n\nconst std::string getLevel(int level) {\n    switch ( level ) {\n    case APLOG_NOERRNO|APLOG_WARNING:\n        return \"warning\";\n    case APLOG_NOERRNO|APLOG_ERR:\n        return \"err\";\n    case APLOG_NOERRNO|APLOG_NOTICE:\n        return \"notice\";\n    case APLOG_NOERRNO|APLOG_INFO:\n        return \"info\";\n    case APLOG_NOERRNO|APLOG_DEBUG:\n        return \"debug\";\n    case APLOG_NOERRNO|APLOG_EMERG:\n        return \"crit\";\n    }\n    return \"unknown\";\n}\n\nAP_DECLARE_NONSTD(void) ap_log_error(const char *file, int line, int level,\n                             apr_status_t status, const server_rec *s,\n                             const char *fmt, ...)\n{\n\n    char* lDest = NULL;\n    va_list l_ap;\n    va_start(l_ap, fmt);\n\n    vasprintf( &lDest, fmt, l_ap);\n    printf(\"%s: %s\\n\", getLevel(level).c_str(), lDest);\n\n    va_end(l_ap);\n}\n\nAP_DECLARE(void) ap_add_version_component(apr_pool_t *pconf, const char *component)\n        {\n    \/\/ NOP\n        }\n\nAP_CORE_DECLARE(ap_conf_vector_t *) ap_create_request_config(apr_pool_t *p)\n{\n    void *conf_vector = apr_pcalloc(p, sizeof(void *) * 16);\n     return reinterpret_cast<ap_conf_vector_t *>(conf_vector);\n\n}\n\nint bodyServed = 0;\n#include <iostream>\n\nAP_DECLARE(apr_status_t) ap_get_brigade(ap_filter_t *filter,\n                                        apr_bucket_brigade *bb,\n                                        ap_input_mode_t mode,\n                                        apr_read_type_e block,\n                                        apr_off_t readbytes)\n{\n\n    apr_pool_t *pool = NULL;\n    apr_pool_create(&pool, 0);\n    std::cout << \"Filter \" << filter << std::endl;\n    \/\/ No filter, simply forge an EOS\n    if (((void *)filter == (void *)0x42)) {\n\n        assert(apr_brigade_write(bb, NULL, NULL, testBody42, std::string(testBody42).size()) == APR_SUCCESS);\n    } else if ((void *)filter == (void *)0x43) {\n        if (!bodyServed) {\n            assert(apr_brigade_write(bb, NULL, NULL, testBody43p1,\n                                     std::string(testBody43p1).size()) == APR_SUCCESS);\n            bodyServed = 1;\n            return APR_SUCCESS;\n        } else if (bodyServed == 1) {\n            assert(apr_brigade_write(bb, NULL, NULL,\n                                     testBody43p2, std::string(testBody43p2).size()) == APR_SUCCESS);\n            bodyServed = 2;\n            return APR_SUCCESS;\n        }\n    } else if ((void *)filter == (void *)0x44) {\n        return 1;\n    }    apr_bucket_alloc_t *bA = apr_bucket_alloc_create(pool);\n    apr_bucket *e = apr_bucket_eos_create(bA);\n    assert(e);\n    APR_BRIGADE_INSERT_TAIL(bb, e);\n    return APR_SUCCESS;\n}\n\nAP_DECLARE(ap_filter_t *) ap_add_input_filter(const char *name, void *ctx,\n                                              request_rec *r, conn_rec *c)\n{\n\treturn NULL;\n}\n\napr_status_t\nap_pass_brigade(ap_filter_t *, apr_bucket_brigade *)\n{\n    return APR_SUCCESS;\n}\n\nAP_DECLARE(void)\nap_remove_output_filter(ap_filter_t *pFilter)\n{\n}\n\nAP_DECLARE(void)\nap_remove_input_filter(ap_filter_t *pFilter)\n{\n}\n\napr_status_t \tap_filter_flush (apr_bucket_brigade *bb, void *ctx) {\n    return APR_SUCCESS;\n}\n<commit_msg>Fixing stubs<commit_after>\/*\n* mod_dup - duplicates apache requests\n*\n* Copyright (C) 2013 Orange\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF 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\/\/ Stubs for Apache API\n\/\/ don't care about memory leaks\n\/\/ these are just stubs\n\n#include <string>\n#include <sstream>\n\n#include <httpd.h>\n#include <http_config.h>  \/\/ for the config functions\n#include <http_request.h>\n#include <http_protocol.h>\n#include <apr_pools.h>\n#include <apr_hooks.h>\n#include <unixd.h>\n\n#include <http_log.h>\n#include \"testBodies.hh\"\n\n#include <cstring>\n#include <cassert>\n\nunixd_config_rec unixd_config;\n\nAP_DECLARE_NONSTD(int) ap_rprintf( request_rec *r, const char *fmt, ...)\n{\n    assert( r != NULL );\n    assert( fmt != NULL );\n\n    char* lDest = NULL;\n\n    va_list l_ap;\n    va_start(l_ap, fmt);\n\n    int n = vasprintf( &lDest, fmt, l_ap);\n\n    va_end(l_ap);\n\n    if( r->filename == NULL ){\n        r->filename = lDest;\n    }\n    else {\n        std::string lNew(r->filename);\n        lNew.append(lDest);\n        free(r->filename);\n        r->filename = strdup(lNew.c_str());\n        free(lDest);\n    }\n\n     return n;\n};\n\nAP_DECLARE(int) ap_is_initial_req(request_rec *r)\n{\n    return 0;\n};\n\nconst std::string getLevel(int level) {\n    switch ( level ) {\n    case APLOG_NOERRNO|APLOG_WARNING:\n        return \"warning\";\n    case APLOG_NOERRNO|APLOG_ERR:\n        return \"err\";\n    case APLOG_NOERRNO|APLOG_NOTICE:\n        return \"notice\";\n    case APLOG_NOERRNO|APLOG_INFO:\n        return \"info\";\n    case APLOG_NOERRNO|APLOG_DEBUG:\n        return \"debug\";\n    case APLOG_NOERRNO|APLOG_EMERG:\n        return \"crit\";\n    }\n    return \"unknown\";\n}\n\nAP_DECLARE_NONSTD(void) ap_log_error(const char *file, int line, int level,\n                             apr_status_t status, const server_rec *s,\n                             const char *fmt, ...)\n{\n\n    char* lDest = NULL;\n    va_list l_ap;\n    va_start(l_ap, fmt);\n\n    vasprintf( &lDest, fmt, l_ap);\n    printf(\"%s: %s\\n\", getLevel(level).c_str(), lDest);\n\n    va_end(l_ap);\n}\n\nAP_DECLARE(void) ap_add_version_component(apr_pool_t *pconf, const char *component)\n        {\n    \/\/ NOP\n        }\n\nAP_CORE_DECLARE(ap_conf_vector_t *) ap_create_request_config(apr_pool_t *p)\n{\n    void *conf_vector = apr_pcalloc(p, sizeof(void *) * 16);\n     return reinterpret_cast<ap_conf_vector_t *>(conf_vector);\n\n}\n\nint bodyServed = 0;\n#include <iostream>\n\nAP_DECLARE(apr_status_t) ap_get_brigade(ap_filter_t *filter,\n                                        apr_bucket_brigade *bb,\n                                        ap_input_mode_t mode,\n                                        apr_read_type_e block,\n                                        apr_off_t readbytes)\n{\n\n    apr_pool_t *pool = NULL;\n    apr_pool_create(&pool, 0);\n    std::cout << \"Filter \" << filter << std::endl;\n    \/\/ No filter, simply forge an EOS\n    if (((void *)filter == (void *)0x42)) {\n\n        assert(apr_brigade_write(bb, NULL, NULL, testBody42, std::string(testBody42).size()) == APR_SUCCESS);\n    } else if ((void *)filter == (void *)0x43) {\n        if (!bodyServed) {\n            assert(apr_brigade_write(bb, NULL, NULL, testBody43p1,\n                                     std::string(testBody43p1).size()) == APR_SUCCESS);\n            bodyServed = 1;\n            return APR_SUCCESS;\n        } else if (bodyServed == 1) {\n            assert(apr_brigade_write(bb, NULL, NULL,\n                                     testBody43p2, std::string(testBody43p2).size()) == APR_SUCCESS);\n            bodyServed = 2;\n            return APR_SUCCESS;\n        }\n    } else if ((void *)filter == (void *)0x44) {\n        return 1;\n    }    apr_bucket_alloc_t *bA = apr_bucket_alloc_create(pool);\n    apr_bucket *e = apr_bucket_eos_create(bA);\n    assert(e);\n    APR_BRIGADE_INSERT_TAIL(bb, e);\n    return APR_SUCCESS;\n}\n\nAP_DECLARE(ap_filter_t *) ap_add_input_filter(const char *name, void *ctx,\n                                              request_rec *r, conn_rec *c)\n{\n\treturn NULL;\n}\n\nAP_DECLARE(ap_filter_t *) ap_add_output_filter(const char *name, void *ctx,\n                                              request_rec *r, conn_rec *c)\n{\n\treturn NULL;\n}\n\napr_status_t\nap_pass_brigade(ap_filter_t *, apr_bucket_brigade *)\n{\n    return APR_SUCCESS;\n}\n\nAP_DECLARE(void)\nap_remove_output_filter(ap_filter_t *pFilter)\n{\n}\n\nAP_DECLARE(void)\nap_remove_input_filter(ap_filter_t *pFilter)\n{\n}\n\napr_status_t \tap_filter_flush (apr_bucket_brigade *bb, void *ctx) {\n    return APR_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2013-2016, Roland Bock\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 *  * 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 *\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 COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\n * OR OTHERWISE) 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 <iostream>\n#include <sqlpp11\/remove.h>\n#include \"Sample.h\"\n#include \"MockDb.h\"\n#include \"is_regular.h\"\n\nint Remove(int, char* [])\n{\n  MockDb db = {};\n  MockDb::_serializer_context_t printer = {};\n\n  const auto t = test::TabBar{};\n  const auto f = test::TabFoo{};\n\n  {\n    using T = decltype(remove_from(t));\n    static_assert(sqlpp::is_regular<T>::value, \"type requirement\");\n  }\n\n  {\n    using T = decltype(remove_from(t).where(t.beta != \"transparent\"));\n    static_assert(sqlpp::is_regular<T>::value, \"type requirement\");\n  }\n\n  {\n    using T = decltype(dynamic_remove_from(db, t).dynamic_using().dynamic_where());\n    static_assert(sqlpp::is_regular<T>::value, \"type requirement\");\n  }\n\n  serialize(remove_from(t), printer).str();\n  serialize(remove_from(t).where(t.beta != \"transparent\"), printer).str();\n  serialize(remove_from(t).using_(t), printer).str();\n  serialize(remove_from(t).using_(f), printer).str();\n  auto r = dynamic_remove_from(db, t).dynamic_using().dynamic_where();\n  r.using_.add(t);\n  r.where.add(t.beta != \"transparent\");\n  printer.reset();\n  std::cerr << serialize(r, printer).str() << std::endl;\n  printer.reset();\n  std::cerr << serialize(remove_from(t).unconditionally(), printer).str() << std::endl;\n\n  db(r);\n\n  return 0;\n}\n<commit_msg>Add example for #448<commit_after>\/*\n * Copyright (c) 2013-2016, Roland Bock\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 *  * 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 *\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 COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\n * OR OTHERWISE) 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 <iostream>\n#include <sqlpp11\/sqlpp11.h>\n#include \"Sample.h\"\n#include \"MockDb.h\"\n#include \"is_regular.h\"\n\nint Remove(int, char* [])\n{\n  MockDb db = {};\n  MockDb::_serializer_context_t printer = {};\n\n  const auto t = test::TabBar{};\n  const auto f = test::TabFoo{};\n\n  {\n    using T = decltype(remove_from(t));\n    static_assert(sqlpp::is_regular<T>::value, \"type requirement\");\n  }\n\n  {\n    using T = decltype(remove_from(t).where(t.beta != \"transparent\"));\n    static_assert(sqlpp::is_regular<T>::value, \"type requirement\");\n  }\n\n  {\n    using T = decltype(dynamic_remove_from(db, t).dynamic_using().dynamic_where());\n    static_assert(sqlpp::is_regular<T>::value, \"type requirement\");\n  }\n\n  serialize(remove_from(t), printer).str();\n  serialize(remove_from(t).where(t.beta != \"transparent\"), printer).str();\n  serialize(remove_from(t).using_(t), printer).str();\n  serialize(remove_from(t).using_(f), printer).str();\n  auto r = dynamic_remove_from(db, t).dynamic_using().dynamic_where();\n  r.using_.add(t);\n  r.where.add(t.beta != \"transparent\");\n  printer.reset();\n  std::cerr << serialize(r, printer).str() << std::endl;\n  printer.reset();\n  std::cerr << serialize(remove_from(t).unconditionally(), printer).str() << std::endl;\n\n  db(r);\n\n  remove_from(t).where(t.beta.in(select(f.delta).from(f).unconditionally()));\n\n  return 0;\n}\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_DETAILS_GENERICOBJECT_HXX_\n#define _QITYPE_DETAILS_GENERICOBJECT_HXX_\n\n#include <qi\/future.hpp>\n#include <qitype\/typeobject.hpp>\n#include <qitype\/details\/typeimpl.hxx>\n\nnamespace qi {\n\n  namespace detail\n  {\n\n    template <typename T>\n    inline void futureAdapter(qi::Future<qi::GenericValuePtr> metaFut, qi::Promise<T> promise)\n    {\n\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n\n      GenericValuePtr val =  metaFut.value();\n      Type* targetType = typeOf<T>();\n      try\n      {\n        std::pair<GenericValuePtr, bool> conv = val.convert(targetType);\n        if (!conv.first.type)\n          promise.setError(std::string(\"Unable to convert call result to target type:\")\n            + val.type->infoString() + \" -> \" + targetType->infoString());\n        else\n        {\n          T* res = (T*)conv.first.type->ptrFromStorage(&conv.first.value);\n          promise.setValue(*res);\n        }\n        if (conv.second)\n          conv.first.destroy();\n      }\n      catch(const std::exception& e)\n      {\n        promise.setError(std::string(\"Return argument conversion error: \") + e.what());\n      }\n      val.destroy();\n    }\n\n    template <typename T>\n    inline void futureAdapterVal(qi::Future<qi::GenericValue> metaFut, qi::Promise<T> promise)\n    {\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n      const GenericValue& val =  metaFut.value();\n      try\n      {\n        promise.setValue(val.to<T>());\n      }\n      catch (const std::exception& e)\n      {\n        promise.setError(std::string(\"Return argument conversion error: \") + e.what());\n      }\n    }\n\n    template<>\n    inline void futureAdapterVal(qi::Future<qi::GenericValue> metaFut, qi::Promise<GenericValue> promise)\n    {\n      if (metaFut.hasError())\n        promise.setError(metaFut.error());\n      else\n        promise.setValue(metaFut.value());\n    }\n\n    template <>\n    inline void futureAdapter<void>(qi::Future<qi::GenericValuePtr> metaFut, qi::Promise<void> promise)\n    {\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n      promise.setValue(0);\n    }\n\n  }\n\n\n  \/* Generate qi::FutureSync<R> GenericObject::call(methodname, args...)\n   * for all argument counts\n   * The function packs arguments in a vector<GenericValuePtr>, computes the\n   * signature and bounce those to metaCall.\n   *\/\n  #define pushi(z, n,_) params.push_back(p ## n);\n#define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::call(             \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params);      \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::async(             \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params, MetaCallType_Queued);   \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::call(             \\\n      MetaCallType callType,                                              \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params, callType);   \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #undef pushi\n\n  template<typename T>\n  qi::FutureSync<T> GenericObject::getProperty(const std::string& name)\n  {\n    int pid = metaObject().propertyId(name);\n    if (pid < 0)\n      return makeFutureError<T>(\"Property not found\");\n    qi::Future<GenericValue> f = type->getProperty(value, pid);\n    qi::Promise<T> p;\n    f.connect(boost::bind(&detail::futureAdapterVal<T>,_1, p));\n    return p.future();\n  }\n\n  template<typename T>\n  qi::FutureSync<void> GenericObject::setProperty(const std::string& name, const T& val)\n  {\n    int pid = metaObject().propertyId(name);\n    if (pid < 0)\n      return makeFutureError<void>(\"Property not found\");\n    return type->setProperty(value, pid, GenericValue(GenericValueRef(val)));\n  }\n\n  \/* An ObjectPtr is actually of a Dynamic type: The underlying Type*\n   * is not allways the same.\n  *\/\n  template<> class QITYPE_API TypeImpl<ObjectPtr>: public TypeDynamic\n  {\n  public:\n    virtual GenericValuePtr get(void* storage)\n    {\n      ObjectPtr* val = (ObjectPtr*)ptrFromStorage(&storage);\n      GenericValuePtr result;\n      if (!*val)\n      {\n        return GenericValuePtr();\n      }\n      result.type = (*val)->type;\n      result.value = (*val)->value;\n      return result;\n    }\n\n    virtual void set(void** storage, GenericValuePtr source)\n    {\n      qiLogCategory(\"qitype.object\");\n      ObjectPtr* val = (ObjectPtr*)ptrFromStorage(storage);\n      if (source.type->info() == info())\n      { \/\/ source is objectptr\n        ObjectPtr* src = (ObjectPtr*)source.type->ptrFromStorage(&source.value);\n        if (!*src)\n          qiLogWarning() << \"NULL ObjectPtr\";\n        *val = *src;\n      }\n      else if (source.kind() == Type::Dynamic)\n      { \/\/ try to dereference dynamic type in case it contains an object\n        set(storage, source.asDynamic());\n      }\n      else if (source.kind() == Type::Object)\n      { \/\/ wrap object in objectptr: we do not keep it alive,\n        \/\/ but source type offers no tracking capability\n        ObjectPtr op(new GenericObject(static_cast<ObjectType*>(source.type), source.value));\n        *val = op;\n      }\n      else\n        throw std::runtime_error((std::string)\"Cannot assign non-object \" + source.type->infoString() + \" to ObjectPtr\");\n\n    }\n    typedef DefaultTypeImplMethods<ObjectPtr> Methods;\n    _QI_BOUNCE_TYPE_METHODS(Methods);\n  };\n\n  namespace detail\n  {\n    typedef std::map<TypeInfo, boost::function<GenericValuePtr(ObjectPtr)> > ProxyGeneratorMap;\n    QITYPE_API ProxyGeneratorMap& proxyGeneratorMap();\n\n    template<typename Proxy>\n    GenericValuePtr makeProxy(ObjectPtr ptr)\n    {\n      boost::shared_ptr<Proxy> sp(new Proxy(ptr));\n      return GenericValuePtr(&sp).clone();\n    }\n  }\n  template<typename Proxy>\n  bool registerProxy()\n  {\n    detail::ProxyGeneratorMap& map = detail::proxyGeneratorMap();\n    map[typeOf<Proxy>()->info()] = &detail::makeProxy<Proxy>;\n    return true;\n  }\n}\n#endif  \/\/ _QITYPE_DETAILS_GENERICOBJECT_HXX_\n<commit_msg>GVP::toObject(): Accept a pointer.<commit_after>#pragma once\n\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n\n#ifndef _QITYPE_DETAILS_GENERICOBJECT_HXX_\n#define _QITYPE_DETAILS_GENERICOBJECT_HXX_\n\n#include <qi\/future.hpp>\n#include <qitype\/typeobject.hpp>\n#include <qitype\/details\/typeimpl.hxx>\n\nnamespace qi {\n\n  namespace detail\n  {\n\n    template <typename T>\n    inline void futureAdapter(qi::Future<qi::GenericValuePtr> metaFut, qi::Promise<T> promise)\n    {\n\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n\n      GenericValuePtr val =  metaFut.value();\n      Type* targetType = typeOf<T>();\n      try\n      {\n        std::pair<GenericValuePtr, bool> conv = val.convert(targetType);\n        if (!conv.first.type)\n          promise.setError(std::string(\"Unable to convert call result to target type:\")\n            + val.type->infoString() + \" -> \" + targetType->infoString());\n        else\n        {\n          T* res = (T*)conv.first.type->ptrFromStorage(&conv.first.value);\n          promise.setValue(*res);\n        }\n        if (conv.second)\n          conv.first.destroy();\n      }\n      catch(const std::exception& e)\n      {\n        promise.setError(std::string(\"Return argument conversion error: \") + e.what());\n      }\n      val.destroy();\n    }\n\n    template <typename T>\n    inline void futureAdapterVal(qi::Future<qi::GenericValue> metaFut, qi::Promise<T> promise)\n    {\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n      const GenericValue& val =  metaFut.value();\n      try\n      {\n        promise.setValue(val.to<T>());\n      }\n      catch (const std::exception& e)\n      {\n        promise.setError(std::string(\"Return argument conversion error: \") + e.what());\n      }\n    }\n\n    template<>\n    inline void futureAdapterVal(qi::Future<qi::GenericValue> metaFut, qi::Promise<GenericValue> promise)\n    {\n      if (metaFut.hasError())\n        promise.setError(metaFut.error());\n      else\n        promise.setValue(metaFut.value());\n    }\n\n    template <>\n    inline void futureAdapter<void>(qi::Future<qi::GenericValuePtr> metaFut, qi::Promise<void> promise)\n    {\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n      promise.setValue(0);\n    }\n\n  }\n\n\n  \/* Generate qi::FutureSync<R> GenericObject::call(methodname, args...)\n   * for all argument counts\n   * The function packs arguments in a vector<GenericValuePtr>, computes the\n   * signature and bounce those to metaCall.\n   *\/\n  #define pushi(z, n,_) params.push_back(p ## n);\n#define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::call(             \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params);      \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::async(             \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params, MetaCallType_Queued);   \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::call(             \\\n      MetaCallType callType,                                              \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params, callType);   \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #undef pushi\n\n  template<typename T>\n  qi::FutureSync<T> GenericObject::getProperty(const std::string& name)\n  {\n    int pid = metaObject().propertyId(name);\n    if (pid < 0)\n      return makeFutureError<T>(\"Property not found\");\n    qi::Future<GenericValue> f = type->getProperty(value, pid);\n    qi::Promise<T> p;\n    f.connect(boost::bind(&detail::futureAdapterVal<T>,_1, p));\n    return p.future();\n  }\n\n  template<typename T>\n  qi::FutureSync<void> GenericObject::setProperty(const std::string& name, const T& val)\n  {\n    int pid = metaObject().propertyId(name);\n    if (pid < 0)\n      return makeFutureError<void>(\"Property not found\");\n    return type->setProperty(value, pid, GenericValue(GenericValueRef(val)));\n  }\n\n  \/* An ObjectPtr is actually of a Dynamic type: The underlying Type*\n   * is not allways the same.\n  *\/\n  template<> class QITYPE_API TypeImpl<ObjectPtr>: public TypeDynamic\n  {\n  public:\n    virtual GenericValuePtr get(void* storage)\n    {\n      ObjectPtr* val = (ObjectPtr*)ptrFromStorage(&storage);\n      GenericValuePtr result;\n      if (!*val)\n      {\n        return GenericValuePtr();\n      }\n      result.type = (*val)->type;\n      result.value = (*val)->value;\n      return result;\n    }\n\n    virtual void set(void** storage, GenericValuePtr source)\n    {\n      qiLogCategory(\"qitype.object\");\n      ObjectPtr* val = (ObjectPtr*)ptrFromStorage(storage);\n      if (source.type->info() == info())\n      { \/\/ source is objectptr\n        ObjectPtr* src = (ObjectPtr*)source.type->ptrFromStorage(&source.value);\n        if (!*src)\n          qiLogWarning() << \"NULL ObjectPtr\";\n        *val = *src;\n      }\n      else if (source.kind() == Type::Dynamic)\n      { \/\/ try to dereference dynamic type in case it contains an object\n        set(storage, source.asDynamic());\n      }\n      else if (source.kind() == Type::Object)\n      { \/\/ wrap object in objectptr: we do not keep it alive,\n        \/\/ but source type offers no tracking capability\n        ObjectPtr op(new GenericObject(static_cast<ObjectType*>(source.type), source.value));\n        *val = op;\n      }\n      else if (source.kind() == Type::Pointer)\n      {\n        TypePointer* ptype = static_cast<TypePointer*>(source.type);\n        \/\/ FIXME: find a way!\n        if (ptype->pointerKind() == TypePointer::Shared)\n          qiLogInfo(\"ObjectPtr will *not* track original shared pointer\");\n        set(storage, *source);\n      }\n      else\n        throw std::runtime_error((std::string)\"Cannot assign non-object \" + source.type->infoString() + \" to ObjectPtr\");\n\n    }\n    typedef DefaultTypeImplMethods<ObjectPtr> Methods;\n    _QI_BOUNCE_TYPE_METHODS(Methods);\n  };\n\n  namespace detail\n  {\n    typedef std::map<TypeInfo, boost::function<GenericValuePtr(ObjectPtr)> > ProxyGeneratorMap;\n    QITYPE_API ProxyGeneratorMap& proxyGeneratorMap();\n\n    template<typename Proxy>\n    GenericValuePtr makeProxy(ObjectPtr ptr)\n    {\n      boost::shared_ptr<Proxy> sp(new Proxy(ptr));\n      return GenericValuePtr(&sp).clone();\n    }\n  }\n  template<typename Proxy>\n  bool registerProxy()\n  {\n    detail::ProxyGeneratorMap& map = detail::proxyGeneratorMap();\n    map[typeOf<Proxy>()->info()] = &detail::makeProxy<Proxy>;\n    return true;\n  }\n}\n#endif  \/\/ _QITYPE_DETAILS_GENERICOBJECT_HXX_\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_DETAILS_GENERICOBJECT_HXX_\n#define _QITYPE_DETAILS_GENERICOBJECT_HXX_\n\n#include <qi\/future.hpp>\n#include <qitype\/typeobject.hpp>\n#include <qitype\/details\/typeimpl.hxx>\n\nnamespace qi {\n\n  namespace detail\n  {\n\n    template <typename T>\n    inline void futureAdapter(qi::Future<qi::GenericValuePtr> metaFut, qi::Promise<T> promise)\n    {\n\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n\n      GenericValuePtr val =  metaFut.value();\n      Type* targetType = typeOf<T>();\n      std::pair<GenericValuePtr, bool> conv = val.convert(targetType);\n      if (!conv.first.type)\n        promise.setError(std::string(\"Unable to convert call result to target type:\")\n          + val.type->infoString() + \" -> \" + targetType->infoString());\n      else\n      {\n        T* res = (T*)conv.first.type->ptrFromStorage(&conv.first.value);\n        promise.setValue(*res);\n      }\n      if (conv.second)\n        conv.first.destroy();\n      val.destroy();\n    }\n\n    template <>\n    inline void futureAdapter<void>(qi::Future<qi::GenericValuePtr> metaFut, qi::Promise<void> promise)\n    {\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n      promise.setValue(0);\n    }\n\n  }\n\n\n  \/* Generate qi::FutureSync<R> GenericObject::call(methodname, args...)\n   * for all argument counts\n   * The function packs arguments in a vector<GenericValuePtr>, computes the\n   * signature and bounce those to metaCall.\n   *\/\n  #define pushi(z, n,_) params.push_back(p ## n);\n#define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::call(             \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params);      \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::async(             \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params, MetaCallType_Queued);   \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::call(             \\\n      MetaCallType callType,                                              \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params, callType);   \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #undef pushi\n\n  \/* An ObjectPtr is actually of a Dynamic type: The underlying Type*\n   * is not allways the same.\n  *\/\n  template<> class TypeImpl<ObjectPtr>: public TypeDynamic\n  {\n  public:\n    virtual std::pair<GenericValuePtr, bool> get(void* storage)\n    {\n      ObjectPtr* val = (ObjectPtr*)ptrFromStorage(&storage);\n      GenericValuePtr result;\n      result.type = (*val)->type;\n      result.value = (*val)->value;\n      return std::make_pair(result, false);\n    }\n\n    virtual void set(void** storage, GenericValuePtr source)\n    {\n      qiLogCategory(\"qitype.object\");\n      ObjectPtr* val = (ObjectPtr*)ptrFromStorage(storage);\n      if (source.type->info() == info())\n      {\n        ObjectPtr* src = (ObjectPtr*)source.type->ptrFromStorage(&source.value);\n        if (!*src)\n          qiLogWarning() << \"NULL ObjectPtr\";\n        *val = *src;\n      }\n      else if (source.kind() == Type::Dynamic)\n      {\n        std::pair<GenericValuePtr, bool> val\n          = static_cast<TypeDynamic*>(source.type)->get(source.value);\n       set(storage, val.first);\n       if (val.second)\n         val.first.destroy();\n      }\n      else if (source.kind() == Type::Object)\n      {\n        ObjectPtr op(new GenericObject(static_cast<ObjectType*>(source.type), source.value));\n        *val = op;\n      }\n      else\n        throw std::runtime_error((std::string)\"Cannot assign non-object \" + source.type->infoString() + \" to ObjectPtr\");\n\n    }\n    typedef DefaultTypeImplMethods<ObjectPtr> Methods;\n    _QI_BOUNCE_TYPE_METHODS(Methods);\n  };\n\n  namespace detail\n  {\n    typedef std::map<TypeInfo, boost::function<GenericValuePtr(ObjectPtr)> > ProxyGeneratorMap;\n    QITYPE_API ProxyGeneratorMap& proxyGeneratorMap();\n\n    template<typename Proxy>\n    GenericValuePtr makeProxy(ObjectPtr ptr)\n    {\n      boost::shared_ptr<Proxy> sp(new Proxy(ptr));\n      return GenericValuePtr::from(sp).clone();\n    }\n  }\n  template<typename Proxy>\n  bool registerProxy()\n  {\n    detail::ProxyGeneratorMap& map = detail::proxyGeneratorMap();\n    map[typeOf<Proxy>()->info()] = &detail::makeProxy<Proxy>;\n    return true;\n  }\n}\n#endif  \/\/ _QITYPE_DETAILS_GENERICOBJECT_HXX_\n<commit_msg>Fix ObjectPtr serialization: Add missing QITYPE_API.<commit_after>#pragma once\n\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n\n#ifndef _QITYPE_DETAILS_GENERICOBJECT_HXX_\n#define _QITYPE_DETAILS_GENERICOBJECT_HXX_\n\n#include <qi\/future.hpp>\n#include <qitype\/typeobject.hpp>\n#include <qitype\/details\/typeimpl.hxx>\n\nnamespace qi {\n\n  namespace detail\n  {\n\n    template <typename T>\n    inline void futureAdapter(qi::Future<qi::GenericValuePtr> metaFut, qi::Promise<T> promise)\n    {\n\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n\n      GenericValuePtr val =  metaFut.value();\n      Type* targetType = typeOf<T>();\n      std::pair<GenericValuePtr, bool> conv = val.convert(targetType);\n      if (!conv.first.type)\n        promise.setError(std::string(\"Unable to convert call result to target type:\")\n          + val.type->infoString() + \" -> \" + targetType->infoString());\n      else\n      {\n        T* res = (T*)conv.first.type->ptrFromStorage(&conv.first.value);\n        promise.setValue(*res);\n      }\n      if (conv.second)\n        conv.first.destroy();\n      val.destroy();\n    }\n\n    template <>\n    inline void futureAdapter<void>(qi::Future<qi::GenericValuePtr> metaFut, qi::Promise<void> promise)\n    {\n      \/\/error handling\n      if (metaFut.hasError()) {\n        promise.setError(metaFut.error());\n        return;\n      }\n      promise.setValue(0);\n    }\n\n  }\n\n\n  \/* Generate qi::FutureSync<R> GenericObject::call(methodname, args...)\n   * for all argument counts\n   * The function packs arguments in a vector<GenericValuePtr>, computes the\n   * signature and bounce those to metaCall.\n   *\/\n  #define pushi(z, n,_) params.push_back(p ## n);\n#define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::call(             \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params);      \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::async(             \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params, MetaCallType_Queued);   \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma)                           \\\n  template<typename R> qi::FutureSync<R> GenericObject::call(             \\\n      MetaCallType callType,                                              \\\n      const std::string& methodName       comma                           \\\n      QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoGenericValuePtr))             \\\n  {                                                                        \\\n     if (!value || !type) {                                                \\\n      return makeFutureError<R>(\"Invalid GenericObject\");                  \\\n     }                                                                     \\\n     std::vector<qi::GenericValuePtr> params;                              \\\n     params.reserve(n);                                                    \\\n     BOOST_PP_REPEAT(n, pushi, _)                                          \\\n     std::string signature = methodName + \"::(\";                           \\\n     for (unsigned i=0; i< params.size(); ++i)                             \\\n       signature += params[i].signature();                                 \\\n     signature += \")\";                                                     \\\n     std::string sigret;                                                   \\\n     qi::Promise<R> res;                                                   \\\n     qi::Future<GenericValuePtr> fmeta = metaCall(signature, params, callType);   \\\n     fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res));  \\\n     return res.future();                                                  \\\n  }\n\n  QI_GEN(genCall)\n  #undef genCall\n  #undef pushi\n\n  \/* An ObjectPtr is actually of a Dynamic type: The underlying Type*\n   * is not allways the same.\n  *\/\n  template<> class QITYPE_API TypeImpl<ObjectPtr>: public TypeDynamic\n  {\n  public:\n    virtual std::pair<GenericValuePtr, bool> get(void* storage)\n    {\n      ObjectPtr* val = (ObjectPtr*)ptrFromStorage(&storage);\n      GenericValuePtr result;\n      result.type = (*val)->type;\n      result.value = (*val)->value;\n      return std::make_pair(result, false);\n    }\n\n    virtual void set(void** storage, GenericValuePtr source)\n    {\n      qiLogCategory(\"qitype.object\");\n      ObjectPtr* val = (ObjectPtr*)ptrFromStorage(storage);\n      if (source.type->info() == info())\n      {\n        ObjectPtr* src = (ObjectPtr*)source.type->ptrFromStorage(&source.value);\n        if (!*src)\n          qiLogWarning() << \"NULL ObjectPtr\";\n        *val = *src;\n      }\n      else if (source.kind() == Type::Dynamic)\n      {\n        std::pair<GenericValuePtr, bool> val\n          = static_cast<TypeDynamic*>(source.type)->get(source.value);\n       set(storage, val.first);\n       if (val.second)\n         val.first.destroy();\n      }\n      else if (source.kind() == Type::Object)\n      {\n        ObjectPtr op(new GenericObject(static_cast<ObjectType*>(source.type), source.value));\n        *val = op;\n      }\n      else\n        throw std::runtime_error((std::string)\"Cannot assign non-object \" + source.type->infoString() + \" to ObjectPtr\");\n\n    }\n    typedef DefaultTypeImplMethods<ObjectPtr> Methods;\n    _QI_BOUNCE_TYPE_METHODS(Methods);\n  };\n\n  namespace detail\n  {\n    typedef std::map<TypeInfo, boost::function<GenericValuePtr(ObjectPtr)> > ProxyGeneratorMap;\n    QITYPE_API ProxyGeneratorMap& proxyGeneratorMap();\n\n    template<typename Proxy>\n    GenericValuePtr makeProxy(ObjectPtr ptr)\n    {\n      boost::shared_ptr<Proxy> sp(new Proxy(ptr));\n      return GenericValuePtr::from(sp).clone();\n    }\n  }\n  template<typename Proxy>\n  bool registerProxy()\n  {\n    detail::ProxyGeneratorMap& map = detail::proxyGeneratorMap();\n    map[typeOf<Proxy>()->info()] = &detail::makeProxy<Proxy>;\n    return true;\n  }\n}\n#endif  \/\/ _QITYPE_DETAILS_GENERICOBJECT_HXX_\n<|endoftext|>"}
{"text":"<commit_before>#include \"kwsysPrivate.h\"\n#include KWSYS_HEADER(stl\/vector)\n#include KWSYS_HEADER(ios\/sstream)\n#include KWSYS_HEADER(ios\/iostream)\n\n\/\/ Work-around CMake dependency scanning limitation.  This must\n\/\/ duplicate the above list of headers.\n#if 0\n# include \"kwsys_stl_string.hxx.in\"\n# include \"kwsys_stl_vector.h.in\"\n# include \"kwsys_ios_sstream.h.in\"\n# include \"kwsys_ios_iostream.h.in\"\n#endif\n\n#include <string.h> \/* strlen *\/\n\nint testIOS(int, char*[])\n{\n  kwsys_ios::ostringstream ostr;\n  const char hello[] = \"hello\";\n  ostr << hello;\n  if(ostr.str() != hello)\n    {\n    kwsys_ios::cerr << \"failed to write hello to ostr\" << kwsys_ios::endl;\n    return 1;\n    }\n  const char world[] = \"world\";\n  kwsys_ios::ostringstream ostr2;\n  ostr2.write( hello, strlen(hello) ); \/* I could do sizeof *\/\n  ostr2.put( '\\0' );\n  ostr2.write( world, strlen(world) );\n  if(ostr2.str().size() !=  strlen(hello) + 1 + strlen(world) )\n    {\n    kwsys_ios::cerr << \"failed to write hello to ostr2\" << kwsys_ios::endl;\n    return 1;\n    }\n  kwsys_ios::istringstream istr(\" 10 20 str \");\n  kwsys_stl::string s;\n  int x;\n  if(istr >> x)\n    {\n    if(x != 10)\n      {\n      kwsys_ios::cerr << \"x != 10\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read 10 from istr\" << kwsys_ios::endl;\n    return 1;\n    }\n  if(istr >> x)\n    {\n    if(x != 20)\n      {\n      kwsys_ios::cerr << \"x != 20\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read 20 from istr\" << kwsys_ios::endl;\n    return 1;\n    }\n  if(istr >> s)\n    {\n    if(s != \"str\")\n      {\n      kwsys_ios::cerr << \"s != \\\"str\\\"\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read str from istr\" << kwsys_ios::endl;\n    return 1;\n    }\n  if(istr >> s)\n    {\n    kwsys_ios::cerr << \"Able to read past end of stream\" << kwsys_ios::endl;\n    return 1;\n    }\n  else\n    {\n    \/\/ Clear the failure.\n    istr.clear(istr.rdstate() & ~kwsys_ios::ios::eofbit);\n    istr.clear(istr.rdstate() & ~kwsys_ios::ios::failbit);\n    }\n  istr.str(\"30\");\n  if(istr >> x)\n    {\n    if(x != 30)\n      {\n      kwsys_ios::cerr << \"x != 30\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read 30 from istr\" << kwsys_ios::endl;\n    return 1;\n    }\n\n  kwsys_ios::stringstream sstr;\n  sstr << \"40 str2\";\n  if(sstr >> x)\n    {\n    if(x != 40)\n      {\n      kwsys_ios::cerr << \"x != 40\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read 40 from sstr\" << kwsys_ios::endl;\n    return 1;\n    }\n  if(sstr >> s)\n    {\n    if(s != \"str2\")\n      {\n      kwsys_ios::cerr << \"s != \\\"str2\\\"\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read str2 from sstr\" << kwsys_ios::endl;\n    return 1;\n    }\n\n  kwsys_ios::cout << \"IOS tests passed\" << kwsys_ios::endl;\n  return 0;\n}\n<commit_msg>ENH: trying to reproduce issue on sunos<commit_after>#include \"kwsysPrivate.h\"\n#include KWSYS_HEADER(stl\/vector)\n#include KWSYS_HEADER(ios\/sstream)\n#include KWSYS_HEADER(ios\/iostream)\n\n\/\/ Work-around CMake dependency scanning limitation.  This must\n\/\/ duplicate the above list of headers.\n#if 0\n# include \"kwsys_stl_string.hxx.in\"\n# include \"kwsys_stl_vector.h.in\"\n# include \"kwsys_ios_sstream.h.in\"\n# include \"kwsys_ios_iostream.h.in\"\n#endif\n\n#include <string.h> \/* strlen *\/\n\nint testIOS(int, char*[])\n{\n  kwsys_ios::ostringstream ostr;\n  const char hello[] = \"hello\";\n  ostr << hello;\n  if(ostr.str() != hello)\n    {\n    kwsys_ios::cerr << \"failed to write hello to ostr\" << kwsys_ios::endl;\n    return 1;\n    }\n  const char world[] = \"world\";\n  kwsys_ios::ostringstream ostr2;\n  ostr2.write( hello, strlen(hello) ); \/* I could do sizeof *\/\n  ostr2.put( '\\0' );\n  ostr2.write( world, strlen(world) );\n  if(ostr2.str().size() !=  strlen(hello) + 1 + strlen(world) )\n    {\n    kwsys_ios::cerr << \"failed to write hello to ostr2\" << kwsys_ios::endl;\n    return 1;\n    }\n  static const unsigned char array[] = { 0xff,0x4f,0xff,0x51,0x00,0x29,0x00,0x00,0x00,0x00,0x00,0x30,0x00,0x00,0x00,0x3e,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x30,0x00,0x00,0x00,0x3e,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x01,0x07,0x01,0x01,0xff,0x52,0x00,0x0c,0x00,0x00,0x00,0x01,0x00,0x05,0x04,0x04,0x00,0x01,0xff,0x5c,0x00,0x13,0x40,0x40,0x48,0x48,0x50,0x48,0x48,0x50,0x48,0x48,0x50,0x48,0x48,0x50,0x48,0x48,0x50,0xff,0x64,0x00,0x2c,0x00,0x00,0x43,0x72,0x65,0x61,0x74,0x65,0x64,0x20,0x62,0x79,0x20,0x49,0x54,0x4b,0x2f,0x47,0x44,0x43,0x4d,0x2f,0x4f,0x70,0x65,0x6e,0x4a,0x50,0x45,0x47,0x20,0x76,0x65,0x72,0x73,0x69,0x6f,0x6e,0x20,0x31,0x2e,0x30,0xff,0x90,0x00,0x0a,0x00,0x00,0x00,0x00,0x06,0x2c,0x00,0x01,0xff,0x93,0xcf,0xb0,0x18,0x08,0x7f,0xc6,0x99,0xbf,0xff,0xc0,0xf8,0xc1,0xc1,0xf3,0x05,0x81,0xf2,0x83,0x0a,0xa5,0xff,0x10,0x90,0xbf,0x2f,0xff,0x04,0xa8,0x7f,0xc0,0xf8,0xc4,0xc1,0xf3,0x09,0x81,0xf3,0x0c,0x19,0x34 };\n  const unsigned int narray = sizeof(array); \/\/ 180\n  kwsys_ios::stringstream strstr;\n  strstr.write( (char*)array, narray );\n  if(strstr.str().size() != narray )\n    {\n    kwsys_ios::cerr << \"failed to write array to strstr\" << kwsys_ios::endl;\n    return 1;\n    }\n\n  kwsys_ios::istringstream istr(\" 10 20 str \");\n  kwsys_stl::string s;\n  int x;\n  if(istr >> x)\n    {\n    if(x != 10)\n      {\n      kwsys_ios::cerr << \"x != 10\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read 10 from istr\" << kwsys_ios::endl;\n    return 1;\n    }\n  if(istr >> x)\n    {\n    if(x != 20)\n      {\n      kwsys_ios::cerr << \"x != 20\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read 20 from istr\" << kwsys_ios::endl;\n    return 1;\n    }\n  if(istr >> s)\n    {\n    if(s != \"str\")\n      {\n      kwsys_ios::cerr << \"s != \\\"str\\\"\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read str from istr\" << kwsys_ios::endl;\n    return 1;\n    }\n  if(istr >> s)\n    {\n    kwsys_ios::cerr << \"Able to read past end of stream\" << kwsys_ios::endl;\n    return 1;\n    }\n  else\n    {\n    \/\/ Clear the failure.\n    istr.clear(istr.rdstate() & ~kwsys_ios::ios::eofbit);\n    istr.clear(istr.rdstate() & ~kwsys_ios::ios::failbit);\n    }\n  istr.str(\"30\");\n  if(istr >> x)\n    {\n    if(x != 30)\n      {\n      kwsys_ios::cerr << \"x != 30\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read 30 from istr\" << kwsys_ios::endl;\n    return 1;\n    }\n\n  kwsys_ios::stringstream sstr;\n  sstr << \"40 str2\";\n  if(sstr >> x)\n    {\n    if(x != 40)\n      {\n      kwsys_ios::cerr << \"x != 40\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read 40 from sstr\" << kwsys_ios::endl;\n    return 1;\n    }\n  if(sstr >> s)\n    {\n    if(s != \"str2\")\n      {\n      kwsys_ios::cerr << \"s != \\\"str2\\\"\" << kwsys_ios::endl;\n      return 1;\n      }\n    }\n  else\n    {\n    kwsys_ios::cerr << \"Failed to read str2 from sstr\" << kwsys_ios::endl;\n    return 1;\n    }\n\n  kwsys_ios::cout << \"IOS tests passed\" << kwsys_ios::endl;\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkRenderViewBase.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#include \"vtkRenderViewBase.h\"\n\n#include \"vtkCamera.h\"\n#include \"vtkCommand.h\"\n#include \"vtkInteractorStyleRubberBand2D.h\"\n#include \"vtkInteractorStyleRubberBand3D.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkRendererCollection.h\"\n#include \"vtkDataRepresentation.h\"\n\nvtkStandardNewMacro(vtkRenderViewBase);\n\nvtkRenderViewBase::vtkRenderViewBase()\n{\n  this->RenderOnMouseMove = false;\n  this->InteractionMode = -1;\n  this->Renderer = vtkSmartPointer<vtkRenderer>::New();\n  this->RenderWindow = vtkSmartPointer<vtkRenderWindow>::New();\n  this->RenderWindow->AddRenderer(this->Renderer);\n\n  \/\/ We will handle all interactor renders by turning off rendering\n  \/\/ in the interactor and listening to the interactor's render event.\n  vtkSmartPointer<vtkRenderWindowInteractor> iren =\n    vtkSmartPointer<vtkRenderWindowInteractor>::New();\n  iren->EnableRenderOff();\n  iren->AddObserver(vtkCommand::RenderEvent, this->GetObserver());\n  iren->AddObserver(vtkCommand::StartInteractionEvent, this->GetObserver());\n  iren->AddObserver(vtkCommand::EndInteractionEvent, this->GetObserver());\n  this->RenderWindow->SetInteractor(iren);\n  this->SetInteractionMode(INTERACTION_MODE_2D);\n}\n\nvtkRenderViewBase::~vtkRenderViewBase()\n{\n}\n\nvtkRenderer* vtkRenderViewBase::GetRenderer()\n{\n  return this->Renderer;\n}\n\nvtkRenderWindow* vtkRenderViewBase::GetRenderWindow()\n{\n  return this->RenderWindow;\n}\n\nvoid vtkRenderViewBase::SetRenderWindow(vtkRenderWindow* win)\n{\n  if (!win)\n    {\n    vtkErrorMacro(<< \"SetRenderWindow called with a null window pointer.\"\n                  << \" That can't be right.\");\n    return;\n    }\n\n  \/\/ get rid of the render observer on the current window\n  if (this->RenderWindow)\n    {\n    this->RenderWindow->RemoveObserver(this->GetObserver());\n    }\n\n  \/\/ move renderers to new window\n  vtkRendererCollection* rens = this->RenderWindow->GetRenderers();\n  while(rens->GetNumberOfItems())\n    {\n    vtkRenderer* ren = rens->GetFirstRenderer();\n    ren->SetRenderWindow(NULL);\n    win->AddRenderer(ren);\n    this->RenderWindow->RemoveRenderer(ren);\n    }\n\n  \/\/ move interactor to new window\n  vtkSmartPointer<vtkRenderWindowInteractor> iren =\n      this->RenderWindow->GetInteractor();\n  this->RenderWindow->SetInteractor(NULL);\n  iren->SetRenderWindow(NULL);\n  win->SetInteractor(iren);\n  iren->SetRenderWindow(win);\n\n  this->RenderWindow->UnRegister(this);\n  this->RenderWindow = win;\n  this->RenderWindow->Register(this);\n  this->RenderWindow->AddObserver(vtkCommand::EndEvent, this->GetObserver());\n}\n\nvtkRenderWindowInteractor* vtkRenderViewBase::GetInteractor()\n{\n  return this->RenderWindow->GetInteractor();\n}\n\nvoid vtkRenderViewBase::SetInteractor(vtkRenderWindowInteractor* interactor)\n{\n  if (!interactor)\n    {\n    vtkErrorMacro(<< \"SetInteractor called with a null interactor pointer.\"\n                  << \" That can't be right.\");\n    return;\n    }\n\n  \/\/ get rid of the render observer on any current interactor\n  if (this->RenderWindow->GetInteractor())\n    {\n    this->RenderWindow->GetInteractor()->RemoveObserver(this->GetObserver());\n    }\n\n  \/\/ We need to preserve the interactor style currently present on the\n  \/\/ interactor.\n  vtkInteractorObserver *oldStyle = this->GetInteractorStyle();\n  oldStyle->Register(this);\n\n  \/\/ We will handle all interactor renders by turning off rendering\n  \/\/ in the interactor and listening to the interactor's render event.\n  interactor->EnableRenderOff();\n  interactor->AddObserver(vtkCommand::RenderEvent, this->GetObserver());\n  interactor->AddObserver(vtkCommand::StartInteractionEvent, this->GetObserver());\n  interactor->AddObserver(vtkCommand::EndInteractionEvent, this->GetObserver());\n  this->RenderWindow->SetInteractor(interactor);\n  interactor->SetInteractorStyle(oldStyle);\n  oldStyle->UnRegister(this);\n}\n\nvtkInteractorObserver* vtkRenderViewBase::GetInteractorStyle()\n{\n  return this->GetInteractor()->GetInteractorStyle();\n}\n\nvoid vtkRenderViewBase::SetInteractorStyle(vtkInteractorObserver* style)\n{\n  if (!style)\n    {\n    vtkErrorMacro(\"Interactor style must not be null.\");\n    return;\n    }\n  vtkInteractorObserver* oldStyle = this->GetInteractorStyle();\n  if (style != oldStyle)\n    {\n    if (oldStyle)\n      {\n      oldStyle->RemoveObserver(this->GetObserver());\n      }\n    this->RenderWindow->GetInteractor()->SetInteractorStyle(style);\n    style->AddObserver(\n      vtkCommand::SelectionChangedEvent, this->GetObserver());\n    vtkInteractorStyleRubberBand2D* style2D =\n      vtkInteractorStyleRubberBand2D::SafeDownCast(style);\n    vtkInteractorStyleRubberBand3D* style3D =\n      vtkInteractorStyleRubberBand3D::SafeDownCast(style);\n    if (style2D)\n      {\n      style2D->SetRenderOnMouseMove(this->GetRenderOnMouseMove());\n      this->InteractionMode = INTERACTION_MODE_2D;\n      }\n    else if (style3D)\n      {\n      style3D->SetRenderOnMouseMove(this->GetRenderOnMouseMove());\n      this->InteractionMode = INTERACTION_MODE_3D;\n      }\n    else\n      {\n      this->InteractionMode = INTERACTION_MODE_UNKNOWN;\n      }\n    }\n}\n\nvoid vtkRenderViewBase::SetInteractionMode(int mode)\n{\n  if (this->InteractionMode != mode)\n    {\n    this->InteractionMode = mode;\n    vtkInteractorObserver* oldStyle = this->GetInteractor()->GetInteractorStyle();\n    if (mode == INTERACTION_MODE_2D)\n      {\n      if (oldStyle)\n        {\n        oldStyle->RemoveObserver(this->GetObserver());\n        }\n      vtkInteractorStyleRubberBand2D* style = vtkInteractorStyleRubberBand2D::New();\n      this->RenderWindow->GetInteractor()->SetInteractorStyle(style);\n      style->SetRenderOnMouseMove(this->GetRenderOnMouseMove());\n      style->AddObserver(vtkCommand::SelectionChangedEvent, this->GetObserver());\n      this->Renderer->GetActiveCamera()->ParallelProjectionOn();\n      style->Delete();\n      }\n    else if (mode == INTERACTION_MODE_3D)\n      {\n      if (oldStyle)\n        {\n        oldStyle->RemoveObserver(this->GetObserver());\n        }\n      vtkInteractorStyleRubberBand3D* style = vtkInteractorStyleRubberBand3D::New();\n      this->RenderWindow->GetInteractor()->SetInteractorStyle(style);\n      style->SetRenderOnMouseMove(this->GetRenderOnMouseMove());\n      style->AddObserver(vtkCommand::SelectionChangedEvent, this->GetObserver());\n      this->Renderer->GetActiveCamera()->ParallelProjectionOff();\n      style->Delete();\n      }\n    else\n      {\n      vtkErrorMacro(\"Unknown interaction mode.\");\n      }\n    }\n}\n\nvoid vtkRenderViewBase::SetRenderOnMouseMove(bool b)\n{\n  if (b == this->RenderOnMouseMove)\n    {\n    return;\n    }\n\n  vtkInteractorObserver* style = this->GetInteractor()->GetInteractorStyle();\n  vtkInteractorStyleRubberBand2D* style2D =\n    vtkInteractorStyleRubberBand2D::SafeDownCast(style);\n  if (style2D)\n    {\n    style2D->SetRenderOnMouseMove(b);\n    }\n  vtkInteractorStyleRubberBand3D* style3D =\n    vtkInteractorStyleRubberBand3D::SafeDownCast(style);\n  if (style3D)\n    {\n    style3D->SetRenderOnMouseMove(b);\n    }\n  this->RenderOnMouseMove = b;\n}\n\nvoid vtkRenderViewBase::Render()\n{\n  \/\/ Indirectly call this->RenderWindow->Start() without crashing.\n  \/\/ to create context if it is not yet created and to make it current\n  \/\/ this is required for HoverWidget to be active after the first\n  \/\/ render.\n  this->RenderWindow->GetInteractor()->Initialize();\n\n  this->Update();\n  this->PrepareForRendering();\n  this->Renderer->ResetCameraClippingRange();\n  this->RenderWindow->Render();\n}\n\nvoid vtkRenderViewBase::ResetCamera()\n{\n  this->Update();\n  this->PrepareForRendering();\n  this->Renderer->ResetCamera();\n}\n\nvoid vtkRenderViewBase::ResetCameraClippingRange()\n{\n  this->Update();\n  this->PrepareForRendering();\n  this->Renderer->ResetCameraClippingRange();\n}\n\nvoid vtkRenderViewBase::PrepareForRendering()\n{\n  this->Update();\n}\n\nvoid vtkRenderViewBase::ProcessEvents(\n  vtkObject* caller, unsigned long eventId, void* callData)\n{\n  if (caller == this->GetInteractor() && eventId == vtkCommand::RenderEvent)\n    {\n    vtkDebugMacro(<< \"interactor causing a render event.\");\n    this->Render();\n    }\n  if (vtkDataRepresentation::SafeDownCast(caller) &&\n      eventId == vtkCommand::SelectionChangedEvent)\n    {\n    vtkDebugMacro(\"selection changed causing a render event\");\n    this->Render();\n    }\n  else if (vtkDataRepresentation::SafeDownCast(caller) &&\n           eventId == vtkCommand::UpdateEvent)\n    {\n    \/\/ UpdateEvent is called from push pipeline executions from\n    \/\/ vtkExecutionScheduler. We want to automatically render the view\n    \/\/ when one of our representations is updated.\n    vtkDebugMacro(\"push pipeline causing a render event\");\n    this->Render();\n    }\n  this->Superclass::ProcessEvents(caller, eventId, callData);\n}\n\nvoid vtkRenderViewBase::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n  os << indent << \"RenderWindow: \";\n  if (this->RenderWindow)\n    {\n    os << \"\\n\";\n    this->RenderWindow->PrintSelf(os, indent.GetNextIndent());\n    }\n  else\n    {\n    os << \"(none)\\n\";\n    }\n  os << indent << \"Renderer: \";\n  if (this->Renderer)\n    {\n    os << \"\\n\";\n    this->Renderer->PrintSelf(os, indent.GetNextIndent());\n    }\n  else\n    {\n    os << \"(none)\\n\";\n    }\n  os << indent << \"InteractionMode: \" << this->InteractionMode << endl;\n  os << indent << \"RenderOnMouseMove: \" << this->RenderOnMouseMove << endl;\n}\n<commit_msg>BUG: FIXME: vtkRenderViewBase::Interactor.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkRenderViewBase.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#include \"vtkRenderViewBase.h\"\n\n#include \"vtkCamera.h\"\n#include \"vtkCommand.h\"\n#include \"vtkInteractorStyleRubberBand2D.h\"\n#include \"vtkInteractorStyleRubberBand3D.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkRendererCollection.h\"\n#include \"vtkDataRepresentation.h\"\n\nvtkStandardNewMacro(vtkRenderViewBase);\n\nvtkRenderViewBase::vtkRenderViewBase()\n{\n  this->RenderOnMouseMove = false;\n  this->InteractionMode = -1;\n  this->Renderer = vtkSmartPointer<vtkRenderer>::New();\n  this->RenderWindow = vtkSmartPointer<vtkRenderWindow>::New();\n  this->RenderWindow->AddRenderer(this->Renderer);\n\n  \/\/ We will handle all interactor renders by turning off rendering\n  \/\/ in the interactor and listening to the interactor's render event.\n  vtkSmartPointer<vtkRenderWindowInteractor> iren =\n    vtkSmartPointer<vtkRenderWindowInteractor>::New();\n  iren->EnableRenderOff();\n  iren->AddObserver(vtkCommand::RenderEvent, this->GetObserver());\n  iren->AddObserver(vtkCommand::StartInteractionEvent, this->GetObserver());\n  iren->AddObserver(vtkCommand::EndInteractionEvent, this->GetObserver());\n  this->RenderWindow->SetInteractor(iren);\n  this->SetInteractionMode(INTERACTION_MODE_2D);\n}\n\nvtkRenderViewBase::~vtkRenderViewBase()\n{\n}\n\nvtkRenderer* vtkRenderViewBase::GetRenderer()\n{\n  return this->Renderer;\n}\n\nvtkRenderWindow* vtkRenderViewBase::GetRenderWindow()\n{\n  return this->RenderWindow;\n}\n\nvoid vtkRenderViewBase::SetRenderWindow(vtkRenderWindow* win)\n{\n  if (!win)\n    {\n    vtkErrorMacro(<< \"SetRenderWindow called with a null window pointer.\"\n                  << \" That can't be right.\");\n    return;\n    }\n\n  \/\/ get rid of the render observer on the current window\n  if (this->RenderWindow)\n    {\n    this->RenderWindow->RemoveObserver(this->GetObserver());\n    }\n\n  \/\/ move renderers to new window\n  vtkRendererCollection* rens = this->RenderWindow->GetRenderers();\n  while(rens->GetNumberOfItems())\n    {\n    vtkRenderer* ren = rens->GetFirstRenderer();\n    ren->SetRenderWindow(NULL);\n    win->AddRenderer(ren);\n    this->RenderWindow->RemoveRenderer(ren);\n    }\n\n  \/\/ move interactor to new window\n  \/\/ FIXME: Qt doesn't like interactor being initialized here.\n  \/\/vtkSmartPointer<vtkRenderWindowInteractor> iren =\n  \/\/    this->RenderWindow->GetInteractor();\n  \/\/this->RenderWindow->SetInteractor(NULL);\n  \/\/iren->SetRenderWindow(NULL);\n  \/\/win->SetInteractor(iren);\n  \/\/iren->SetRenderWindow(win);\n\n  this->RenderWindow->UnRegister(this);\n  this->RenderWindow = win;\n  this->RenderWindow->Register(this);\n  this->RenderWindow->AddObserver(vtkCommand::EndEvent, this->GetObserver());\n}\n\nvtkRenderWindowInteractor* vtkRenderViewBase::GetInteractor()\n{\n  return this->RenderWindow->GetInteractor();\n}\n\nvoid vtkRenderViewBase::SetInteractor(vtkRenderWindowInteractor* interactor)\n{\n  if (!interactor)\n    {\n    vtkErrorMacro(<< \"SetInteractor called with a null interactor pointer.\"\n                  << \" That can't be right.\");\n    return;\n    }\n\n  \/\/ get rid of the render observer on any current interactor\n  if (this->RenderWindow->GetInteractor())\n    {\n    this->RenderWindow->GetInteractor()->RemoveObserver(this->GetObserver());\n    }\n\n  \/\/ We need to preserve the interactor style currently present on the\n  \/\/ interactor.\n  vtkInteractorObserver *oldStyle = this->GetInteractorStyle();\n  oldStyle->Register(this);\n\n  \/\/ We will handle all interactor renders by turning off rendering\n  \/\/ in the interactor and listening to the interactor's render event.\n  interactor->EnableRenderOff();\n  interactor->AddObserver(vtkCommand::RenderEvent, this->GetObserver());\n  interactor->AddObserver(vtkCommand::StartInteractionEvent, this->GetObserver());\n  interactor->AddObserver(vtkCommand::EndInteractionEvent, this->GetObserver());\n  this->RenderWindow->SetInteractor(interactor);\n  interactor->SetInteractorStyle(oldStyle);\n  oldStyle->UnRegister(this);\n}\n\nvtkInteractorObserver* vtkRenderViewBase::GetInteractorStyle()\n{\n  return this->GetInteractor()->GetInteractorStyle();\n}\n\nvoid vtkRenderViewBase::SetInteractorStyle(vtkInteractorObserver* style)\n{\n  if (!style)\n    {\n    vtkErrorMacro(\"Interactor style must not be null.\");\n    return;\n    }\n  vtkInteractorObserver* oldStyle = this->GetInteractorStyle();\n  if (style != oldStyle)\n    {\n    if (oldStyle)\n      {\n      oldStyle->RemoveObserver(this->GetObserver());\n      }\n    this->RenderWindow->GetInteractor()->SetInteractorStyle(style);\n    style->AddObserver(\n      vtkCommand::SelectionChangedEvent, this->GetObserver());\n    vtkInteractorStyleRubberBand2D* style2D =\n      vtkInteractorStyleRubberBand2D::SafeDownCast(style);\n    vtkInteractorStyleRubberBand3D* style3D =\n      vtkInteractorStyleRubberBand3D::SafeDownCast(style);\n    if (style2D)\n      {\n      style2D->SetRenderOnMouseMove(this->GetRenderOnMouseMove());\n      this->InteractionMode = INTERACTION_MODE_2D;\n      }\n    else if (style3D)\n      {\n      style3D->SetRenderOnMouseMove(this->GetRenderOnMouseMove());\n      this->InteractionMode = INTERACTION_MODE_3D;\n      }\n    else\n      {\n      this->InteractionMode = INTERACTION_MODE_UNKNOWN;\n      }\n    }\n}\n\nvoid vtkRenderViewBase::SetInteractionMode(int mode)\n{\n  if (this->InteractionMode != mode)\n    {\n    this->InteractionMode = mode;\n    vtkInteractorObserver* oldStyle = this->GetInteractor()->GetInteractorStyle();\n    if (mode == INTERACTION_MODE_2D)\n      {\n      if (oldStyle)\n        {\n        oldStyle->RemoveObserver(this->GetObserver());\n        }\n      vtkInteractorStyleRubberBand2D* style = vtkInteractorStyleRubberBand2D::New();\n      this->RenderWindow->GetInteractor()->SetInteractorStyle(style);\n      style->SetRenderOnMouseMove(this->GetRenderOnMouseMove());\n      style->AddObserver(vtkCommand::SelectionChangedEvent, this->GetObserver());\n      this->Renderer->GetActiveCamera()->ParallelProjectionOn();\n      style->Delete();\n      }\n    else if (mode == INTERACTION_MODE_3D)\n      {\n      if (oldStyle)\n        {\n        oldStyle->RemoveObserver(this->GetObserver());\n        }\n      vtkInteractorStyleRubberBand3D* style = vtkInteractorStyleRubberBand3D::New();\n      this->RenderWindow->GetInteractor()->SetInteractorStyle(style);\n      style->SetRenderOnMouseMove(this->GetRenderOnMouseMove());\n      style->AddObserver(vtkCommand::SelectionChangedEvent, this->GetObserver());\n      this->Renderer->GetActiveCamera()->ParallelProjectionOff();\n      style->Delete();\n      }\n    else\n      {\n      vtkErrorMacro(\"Unknown interaction mode.\");\n      }\n    }\n}\n\nvoid vtkRenderViewBase::SetRenderOnMouseMove(bool b)\n{\n  if (b == this->RenderOnMouseMove)\n    {\n    return;\n    }\n\n  vtkInteractorObserver* style = this->GetInteractor()->GetInteractorStyle();\n  vtkInteractorStyleRubberBand2D* style2D =\n    vtkInteractorStyleRubberBand2D::SafeDownCast(style);\n  if (style2D)\n    {\n    style2D->SetRenderOnMouseMove(b);\n    }\n  vtkInteractorStyleRubberBand3D* style3D =\n    vtkInteractorStyleRubberBand3D::SafeDownCast(style);\n  if (style3D)\n    {\n    style3D->SetRenderOnMouseMove(b);\n    }\n  this->RenderOnMouseMove = b;\n}\n\nvoid vtkRenderViewBase::Render()\n{\n  \/\/ Indirectly call this->RenderWindow->Start() without crashing.\n  \/\/ to create context if it is not yet created and to make it current\n  \/\/ this is required for HoverWidget to be active after the first\n  \/\/ render.\n  this->RenderWindow->GetInteractor()->Initialize();\n\n  this->Update();\n  this->PrepareForRendering();\n  this->Renderer->ResetCameraClippingRange();\n  this->RenderWindow->Render();\n}\n\nvoid vtkRenderViewBase::ResetCamera()\n{\n  this->Update();\n  this->PrepareForRendering();\n  this->Renderer->ResetCamera();\n}\n\nvoid vtkRenderViewBase::ResetCameraClippingRange()\n{\n  this->Update();\n  this->PrepareForRendering();\n  this->Renderer->ResetCameraClippingRange();\n}\n\nvoid vtkRenderViewBase::PrepareForRendering()\n{\n  this->Update();\n}\n\nvoid vtkRenderViewBase::ProcessEvents(\n  vtkObject* caller, unsigned long eventId, void* callData)\n{\n  if (caller == this->GetInteractor() && eventId == vtkCommand::RenderEvent)\n    {\n    vtkDebugMacro(<< \"interactor causing a render event.\");\n    this->Render();\n    }\n  if (vtkDataRepresentation::SafeDownCast(caller) &&\n      eventId == vtkCommand::SelectionChangedEvent)\n    {\n    vtkDebugMacro(\"selection changed causing a render event\");\n    this->Render();\n    }\n  else if (vtkDataRepresentation::SafeDownCast(caller) &&\n           eventId == vtkCommand::UpdateEvent)\n    {\n    \/\/ UpdateEvent is called from push pipeline executions from\n    \/\/ vtkExecutionScheduler. We want to automatically render the view\n    \/\/ when one of our representations is updated.\n    vtkDebugMacro(\"push pipeline causing a render event\");\n    this->Render();\n    }\n  this->Superclass::ProcessEvents(caller, eventId, callData);\n}\n\nvoid vtkRenderViewBase::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n  os << indent << \"RenderWindow: \";\n  if (this->RenderWindow)\n    {\n    os << \"\\n\";\n    this->RenderWindow->PrintSelf(os, indent.GetNextIndent());\n    }\n  else\n    {\n    os << \"(none)\\n\";\n    }\n  os << indent << \"Renderer: \";\n  if (this->Renderer)\n    {\n    os << \"\\n\";\n    this->Renderer->PrintSelf(os, indent.GetNextIndent());\n    }\n  else\n    {\n    os << \"(none)\\n\";\n    }\n  os << indent << \"InteractionMode: \" << this->InteractionMode << endl;\n  os << indent << \"RenderOnMouseMove: \" << this->RenderOnMouseMove << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>`yli::config::SettingMaster`: cleaning up code.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Bugfix: `get_ground_level`: `position.x`, `position.z` coordinate check.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n#include \"classad\/common.h\"\n#include \"classad\/util.h\"\n#include <limits.h>\n\nusing namespace std;\n\n#if HAVE_LONG_TIMEZONE\nextern DLL_IMPORT_MAGIC long timezone;\n#endif\n\nBEGIN_NAMESPACE( classad )\n\n#ifdef WIN32\n#define BIGGEST_RANDOM_INT RAND_MAX\nint get_random_integer(void)\n{\n    static char initialized = 0;\n\n\tif (!initialized) {\n        int seed = time(NULL);\n        srand(seed);\n        initialized = 1;\n\t}\n\n\treturn rand();\n}\n#else\n#define BIGGEST_RANDOM_INT INT_MAX\nint get_random_integer(void)\n{\n    static char initialized = 0;\n\n\tif (!initialized) {\n        int seed = time(NULL);\n        srand48(seed);\n        initialized = 1;\n\t}\n\treturn (int) (lrand48() & INT_MAX);\n}\n#endif\n\ndouble get_random_real(void)\n{\n    return (get_random_integer() \/ (double) BIGGEST_RANDOM_INT);\n}\n\nlong timezone_offset(void)\n{\n#if HAVE_LONG_TIMEZONE\n    return ::timezone;\n#else\n    static long tz_offset = 0;\n    static bool have_tz_offset = false;\n\n    if (!have_tz_offset) {\n        struct tm  *tms;\n        time_t     clock;\n\n        time(&clock);\n        tms = localtime(&clock);\n        tz_offset = -tms->tm_gmtoff;\n        if (0 != tms->tm_isdst) {\n            tz_offset += 3600;\n        }\n    }\n    return tz_offset;\n#endif\n}\n\nvoid convert_escapes(string &text, bool &validStr)\n{\n\tchar *copy;\n\tint  length;\n\tint  source, dest;\n\n\t\/\/ We now it will be no longer than the original.\n\tlength = text.length();\n\tcopy = new char[length + 1];\n\t\n\t\/\/ We scan up to one less than the length, because we ignore\n\t\/\/ a terminating slash: it can't be an escape. \n\tdest = 0;\n\tfor (source = 0; source < length - 1; source++) {\n\t\tif (text[source] != '\\\\' || source == length - 1) {\n\t\t\tcopy[dest++]= text[source]; \n\t\t}\n\t\telse {\n\t\t\tsource++;\n\n\t\t\tchar new_char;\n\t\t\tswitch(text[source]) {\n\t\t\tcase 'a':\tnew_char = '\\a'; break;\n\t\t\tcase 'b':\tnew_char = '\\b'; break;\n\t\t\tcase 'f':\tnew_char = '\\f'; break;\n\t\t\tcase 'n':\tnew_char = '\\n'; break;\n\t\t\tcase 'r':\tnew_char = '\\r'; break;\n\t\t\tcase 't':\tnew_char = '\\t'; break;\n\t\t\tcase 'v':\tnew_char = '\\v'; break;\n\t\t\tcase '\\\\':\tnew_char = '\\\\'; break;\n\t\t\tcase '\\?':\tnew_char = '\\?'; break;\n\t\t\tcase '\\'':\tnew_char = '\\''; break;\n\t\t\tcase '\\\"':\tnew_char = '\\\"'; break;\n\t\t\tdefault:   \n\t\t\t\tif (isodigit(text[source])) {\n\t\t\t\t\tunsigned int  number;\n\t\t\t\t\t\/\/ There are three allowed ways to have octal escape characters:\n\t\t\t\t\t\/\/  \\[0..3]nn or \\nn or \\n. We check for them in that order.\n\t\t\t\t\tif (   source <= length - 3\n\t\t\t\t\t\t&& text[source] >= '0' && text[source] <= '3'\n\t\t\t\t\t\t&& isodigit(text[source+1])\n\t\t\t\t\t\t&& isodigit(text[source+2])) {\n\n\t\t\t\t\t\t\/\/ We have the \\[0..3]nn case\n\t\t\t\t\t\tchar octal[4];\n\t\t\t\t\t\toctal[0] = text[source];\n\t\t\t\t\t\toctal[1] = text[source+1];\n\t\t\t\t\t\toctal[2] = text[source+2];\n\t\t\t\t\t\toctal[3] = 0;\n\t\t\t\t\t\tsscanf(octal, \"%o\", &number);\n\t\t\t\t\t\tnew_char = number;\n\t\t\t\t\t\tsource += 2; \/\/ to account for the two extra digits\n\t\t\t\t\t} else if (   source <= length -2\n\t\t\t\t\t\t\t   && isodigit(text[source+1])) {\n\n\t\t\t\t\t\t\/\/ We have the \\nn case\n\t\t\t\t\t\tchar octal[3];\n\t\t\t\t\t\toctal[0] = text[source];\n\t\t\t\t\t\toctal[1] = text[source+1];\n\t\t\t\t\t\toctal[2] = 0;\n\t\t\t\t\t\tsscanf(octal, \"%o\", &number);\n\t\t\t\t\t\tnew_char = number;\n\t\t\t\t\t\tsource += 1; \/\/ to account for the extra digit\n\t\t\t\t\t} else if (source <= length - 1) {\n\t\t\t\t\t\tchar octal[2];\n\t\t\t\t\t\toctal[0] = text[source];\n\t\t\t\t\t\toctal[1] = 0;\n\t\t\t\t\t\tsscanf(octal, \"%o\", &number);\n\t\t\t\t\t\tnew_char = number;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnew_char = text[source];\n\t\t\t\t\t}\n\t\t\t\t\tif(number == 0) { \/\/ \"\\\\0\" is an invalid substring within a string literal\n\t\t\t\t\t  validStr = false;\n\t\t\t\t\t  delete [] copy;\n\t\t\t\t\t  return;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tnew_char = text[source];\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcopy[dest++] = new_char;\n\t\t}\n\t}\n\tcopy[dest] = 0;\n\ttext = copy;\n\tdelete [] copy;\n\treturn;\n}\n\nvoid \ngetLocalTime(time_t *now, struct tm *localtm) \n{\n\n#ifndef WIN32\n\tlocaltime_r( now, localtm );\n#else\n\t\/\/ there is no localtime_r() on Windows, so for now\n\t\/\/ we just call localtime() and deep copy the result.\n\n\tstruct tm *lt_ptr; \n\n\tlt_ptr = localtime(now);\n\n\tif (localtm == NULL) { return; } \n\n\tlocaltm->tm_sec   = lt_ptr->tm_sec;    \/* seconds *\/\n\tlocaltm->tm_min   = lt_ptr->tm_min;    \/* minutes *\/\n\tlocaltm->tm_hour  = lt_ptr->tm_hour;   \/* hours *\/\n\tlocaltm->tm_mday  = lt_ptr->tm_mday;   \/* day of the month *\/\n\tlocaltm->tm_mon   = lt_ptr->tm_mon;    \/* month *\/\n\tlocaltm->tm_year  = lt_ptr->tm_year;   \/* year *\/\n\tlocaltm->tm_wday  = lt_ptr->tm_wday;   \/* day of the week *\/\n\tlocaltm->tm_yday  = lt_ptr->tm_yday;   \/* day in the year *\/\n\tlocaltm->tm_isdst = lt_ptr->tm_isdst;  \/* daylight saving time *\/\n\t\n#endif\n\treturn;\n}\n\nvoid \ngetGMTime(time_t *now, struct tm *gtm) \n{\n\n#ifndef WIN32\n\tgmtime_r( now, gtm );\n#else\n\t\/\/ there is no localtime_r() on Windows, so for now\n\t\/\/ we just call localtime() and deep copy the result.\n\n\tstruct tm *gt_ptr; \n\n\tgt_ptr = gmtime(now);\n\n\tif (gtm == NULL) { return; } \n\n\tgtm->tm_sec   = gt_ptr->tm_sec;    \/* seconds *\/\n\tgtm->tm_min   = gt_ptr->tm_min;    \/* minutes *\/\n\tgtm->tm_hour  = gt_ptr->tm_hour;   \/* hours *\/\n\tgtm->tm_mday  = gt_ptr->tm_mday;   \/* day of the month *\/\n\tgtm->tm_mon   = gt_ptr->tm_mon;    \/* month *\/\n\tgtm->tm_year  = gt_ptr->tm_year;   \/* year *\/\n\tgtm->tm_wday  = gt_ptr->tm_wday;   \/* day of the week *\/\n\tgtm->tm_yday  = gt_ptr->tm_yday;   \/* day in the year *\/\n\tgtm->tm_isdst = gt_ptr->tm_isdst;  \/* daylight saving time *\/\n\t\n#endif\n\treturn;\n}\n\nvoid absTimeToString(const abstime_t &atime, string &buffer)\n{\n    int       tzsecs;\n    time_t    epoch_time;\n    char      timebuf[32], sign;\n    struct tm tms;\n\n    tzsecs = atime.offset;  \n    epoch_time = atime.secs;\n    if (tzsecs > 0) { \n        sign = '+';         \/\/ timezone offset's sign\n    } else {\n        sign = '-';\n        tzsecs = -tzsecs;\n    }\n    getGMTime(&epoch_time, &tms);\n    strftime(timebuf, sizeof(timebuf), \"%Y-%m-%dT%H:%M:%S\", &tms);\n    buffer += timebuf;\n    sprintf(timebuf, \"%c%02d%02d\", sign, tzsecs \/ 3600, (tzsecs \/ 60) % 60);\n    buffer += timebuf;\n    return;\n}\n\nvoid relTimeToString(double rsecs, string &buffer)\n{\n    double  fractional_seconds;\n    int     days, hrs, mins;\n    double  secs;\n    char    timebuf[128];\n   \n    if( rsecs < 0 ) {\n        buffer += \"-\";\n        rsecs = -rsecs;\n    }\n    fractional_seconds = rsecs - floor(rsecs);\n\n    days = (int) rsecs;\n    hrs  = days % 86400;\n    mins = hrs  % 3600;\n    secs = (mins % 60) + fractional_seconds;\n    days = days \/ 86400;\n    hrs  = hrs  \/ 3600;\n    mins = mins \/ 60;\n    \n    if (days) {\n        if (fractional_seconds == 0) {\n            sprintf(timebuf, \"%d+%02d:%02d:%02d\", days, hrs, mins, (int) secs);\n        } else {\n            sprintf(timebuf, \"%d+%02d:%02d:%02g\", days, hrs, mins, secs);\n        }\n        buffer += timebuf;\n    } else if (hrs) {\n        if (fractional_seconds == 0) {\n            sprintf(timebuf, \"%02d:%02d:%02d\", hrs, mins, (int) secs);\n        } else {\n            sprintf(timebuf, \"%02d:%02d:%02g\", hrs, mins, secs);\n        }\n        buffer += timebuf;\n    } else if (mins) {\n        if (fractional_seconds == 0) {\n            sprintf(timebuf, \"%02d:%02d\", mins, (int) secs);\n        } else {\n            sprintf(timebuf, \"%02d:%02g\", mins, secs);\n        }\n        buffer += timebuf;\n        return;\n    } else {\n        if (fractional_seconds == 0) {\n            sprintf(timebuf, \"%02d\", (int) secs);\n        } else {\n            sprintf(timebuf, \"%02g\", secs);\n        }\n        buffer += timebuf;\n    }\n    return;\n}\n\nvoid day_numbers(int year, int month, int day, int &weekday, int &yearday)\n{\n    int fixed =       fixed_from_gregorian(year, month, day);\n    int jan1_fixed =  fixed_from_gregorian(year, 1, 1);\n    weekday = fixed % 7;\n    yearday = fixed - jan1_fixed;\n    return;\n}\n\nint fixed_from_gregorian(int year, int month, int day)\n{\n    int fixed;\n    int month_adjustment;\n\n    if (month <= 2) {\n        month_adjustment = 0;\n    } else if (is_leap_year(year)) {\n        month_adjustment = -1;\n    } else {\n        month_adjustment = -2;\n    }\n    fixed = 365 * (year -1)\n          + ((year - 1) \/ 4)\n          - ((year - 1) \/ 100)\n          + ((year - 1) \/ 400)\n          + ((367 * month - 362) \/ 12)\n          + month_adjustment\n          + day;\n    return fixed;\n}\n\nbool is_leap_year(int year)\n{\n    int  mod4;\n    int  mod400;\n    bool leap_year;\n\n    mod4   = year % 4;\n    mod400 = year % 400;\n\n    if (mod4 == 0 && mod400 != 100 && mod400 != 200 && mod400 != 300) {\n        leap_year = true;\n    } else {\n        leap_year = false;\n    }\n    return leap_year;\n}\n\n#ifdef WIN32\nint classad_isinf(double x) \n{\n\n\tint result;\n\tresult = _fpclass(x);\n\n\tif (result == _FPCLASS_NINF ) {\n\t\t\/* negative infinity *\/\n\t\treturn -1;\n\t} else if ( result == _FPCLASS_PINF ) {\n\t\t\/* positive infinity *\/\n\t\treturn 1;\n\t} else {\n\t\t\/* otherwise *\/\n\t\treturn 0;\n\t}\n}\n#elif (defined (__SVR4) && defined (__sun)) || defined(__APPLE_CC__)\n#ifndef __APPLE_CC__\n#include <ieeefp.h>\n#endif\nint classad_isinf(double x) \n{ \n    if (finite(x) || x != x) {\n        return 0;\n    } else if (x > 0) {\n        return 1;\n    } else {\n        return -1;\n    }\n}\n#else\nint classad_isinf(double x)\n{\n    if (!isinf(x) || x != x) {\n        return 0;\n    } else if (x > 0) {\n        return 1;\n    } else {\n        return -1;\n    }\n}\n#endif \n\n#ifdef  __APPLE_CC__\nint classad_isnan(double x)\n{\n    return __isnan(x);\n}\n#else\nint classad_isnan(double x)\n{\n    return isnan(x);\n}\n#endif\n\nEND_NAMESPACE \/\/ classad\n\n<commit_msg>Fixing compiler problems for Mac OS.  Forgot to include config.h.<commit_after>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n#include \"classad\/common.h\"\n#include \"classad\/util.h\"\n#include \"config.h\"\n#include <limits.h>\n\nusing namespace std;\n\n#if HAVE_LONG_TIMEZONE\nextern DLL_IMPORT_MAGIC long timezone;\n#endif\n\nBEGIN_NAMESPACE( classad )\n\n#ifdef WIN32\n#define BIGGEST_RANDOM_INT RAND_MAX\nint get_random_integer(void)\n{\n    static char initialized = 0;\n\n\tif (!initialized) {\n        int seed = time(NULL);\n        srand(seed);\n        initialized = 1;\n\t}\n\n\treturn rand();\n}\n#else\n#define BIGGEST_RANDOM_INT INT_MAX\nint get_random_integer(void)\n{\n    static char initialized = 0;\n\n\tif (!initialized) {\n        int seed = time(NULL);\n        srand48(seed);\n        initialized = 1;\n\t}\n\treturn (int) (lrand48() & INT_MAX);\n}\n#endif\n\ndouble get_random_real(void)\n{\n    return (get_random_integer() \/ (double) BIGGEST_RANDOM_INT);\n}\n\nlong timezone_offset(void)\n{\n#if HAVE_LONG_TIMEZONE\n    return ::timezone;\n#else\n    static long tz_offset = 0;\n    static bool have_tz_offset = false;\n\n    if (!have_tz_offset) {\n        struct tm  *tms;\n        time_t     clock;\n\n        time(&clock);\n        tms = localtime(&clock);\n        tz_offset = -tms->tm_gmtoff;\n        if (0 != tms->tm_isdst) {\n            tz_offset += 3600;\n        }\n    }\n    return tz_offset;\n#endif\n}\n\nvoid convert_escapes(string &text, bool &validStr)\n{\n\tchar *copy;\n\tint  length;\n\tint  source, dest;\n\n\t\/\/ We now it will be no longer than the original.\n\tlength = text.length();\n\tcopy = new char[length + 1];\n\t\n\t\/\/ We scan up to one less than the length, because we ignore\n\t\/\/ a terminating slash: it can't be an escape. \n\tdest = 0;\n\tfor (source = 0; source < length - 1; source++) {\n\t\tif (text[source] != '\\\\' || source == length - 1) {\n\t\t\tcopy[dest++]= text[source]; \n\t\t}\n\t\telse {\n\t\t\tsource++;\n\n\t\t\tchar new_char;\n\t\t\tswitch(text[source]) {\n\t\t\tcase 'a':\tnew_char = '\\a'; break;\n\t\t\tcase 'b':\tnew_char = '\\b'; break;\n\t\t\tcase 'f':\tnew_char = '\\f'; break;\n\t\t\tcase 'n':\tnew_char = '\\n'; break;\n\t\t\tcase 'r':\tnew_char = '\\r'; break;\n\t\t\tcase 't':\tnew_char = '\\t'; break;\n\t\t\tcase 'v':\tnew_char = '\\v'; break;\n\t\t\tcase '\\\\':\tnew_char = '\\\\'; break;\n\t\t\tcase '\\?':\tnew_char = '\\?'; break;\n\t\t\tcase '\\'':\tnew_char = '\\''; break;\n\t\t\tcase '\\\"':\tnew_char = '\\\"'; break;\n\t\t\tdefault:   \n\t\t\t\tif (isodigit(text[source])) {\n\t\t\t\t\tunsigned int  number;\n\t\t\t\t\t\/\/ There are three allowed ways to have octal escape characters:\n\t\t\t\t\t\/\/  \\[0..3]nn or \\nn or \\n. We check for them in that order.\n\t\t\t\t\tif (   source <= length - 3\n\t\t\t\t\t\t&& text[source] >= '0' && text[source] <= '3'\n\t\t\t\t\t\t&& isodigit(text[source+1])\n\t\t\t\t\t\t&& isodigit(text[source+2])) {\n\n\t\t\t\t\t\t\/\/ We have the \\[0..3]nn case\n\t\t\t\t\t\tchar octal[4];\n\t\t\t\t\t\toctal[0] = text[source];\n\t\t\t\t\t\toctal[1] = text[source+1];\n\t\t\t\t\t\toctal[2] = text[source+2];\n\t\t\t\t\t\toctal[3] = 0;\n\t\t\t\t\t\tsscanf(octal, \"%o\", &number);\n\t\t\t\t\t\tnew_char = number;\n\t\t\t\t\t\tsource += 2; \/\/ to account for the two extra digits\n\t\t\t\t\t} else if (   source <= length -2\n\t\t\t\t\t\t\t   && isodigit(text[source+1])) {\n\n\t\t\t\t\t\t\/\/ We have the \\nn case\n\t\t\t\t\t\tchar octal[3];\n\t\t\t\t\t\toctal[0] = text[source];\n\t\t\t\t\t\toctal[1] = text[source+1];\n\t\t\t\t\t\toctal[2] = 0;\n\t\t\t\t\t\tsscanf(octal, \"%o\", &number);\n\t\t\t\t\t\tnew_char = number;\n\t\t\t\t\t\tsource += 1; \/\/ to account for the extra digit\n\t\t\t\t\t} else if (source <= length - 1) {\n\t\t\t\t\t\tchar octal[2];\n\t\t\t\t\t\toctal[0] = text[source];\n\t\t\t\t\t\toctal[1] = 0;\n\t\t\t\t\t\tsscanf(octal, \"%o\", &number);\n\t\t\t\t\t\tnew_char = number;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnew_char = text[source];\n\t\t\t\t\t}\n\t\t\t\t\tif(number == 0) { \/\/ \"\\\\0\" is an invalid substring within a string literal\n\t\t\t\t\t  validStr = false;\n\t\t\t\t\t  delete [] copy;\n\t\t\t\t\t  return;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tnew_char = text[source];\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcopy[dest++] = new_char;\n\t\t}\n\t}\n\tcopy[dest] = 0;\n\ttext = copy;\n\tdelete [] copy;\n\treturn;\n}\n\nvoid \ngetLocalTime(time_t *now, struct tm *localtm) \n{\n\n#ifndef WIN32\n\tlocaltime_r( now, localtm );\n#else\n\t\/\/ there is no localtime_r() on Windows, so for now\n\t\/\/ we just call localtime() and deep copy the result.\n\n\tstruct tm *lt_ptr; \n\n\tlt_ptr = localtime(now);\n\n\tif (localtm == NULL) { return; } \n\n\tlocaltm->tm_sec   = lt_ptr->tm_sec;    \/* seconds *\/\n\tlocaltm->tm_min   = lt_ptr->tm_min;    \/* minutes *\/\n\tlocaltm->tm_hour  = lt_ptr->tm_hour;   \/* hours *\/\n\tlocaltm->tm_mday  = lt_ptr->tm_mday;   \/* day of the month *\/\n\tlocaltm->tm_mon   = lt_ptr->tm_mon;    \/* month *\/\n\tlocaltm->tm_year  = lt_ptr->tm_year;   \/* year *\/\n\tlocaltm->tm_wday  = lt_ptr->tm_wday;   \/* day of the week *\/\n\tlocaltm->tm_yday  = lt_ptr->tm_yday;   \/* day in the year *\/\n\tlocaltm->tm_isdst = lt_ptr->tm_isdst;  \/* daylight saving time *\/\n\t\n#endif\n\treturn;\n}\n\nvoid \ngetGMTime(time_t *now, struct tm *gtm) \n{\n\n#ifndef WIN32\n\tgmtime_r( now, gtm );\n#else\n\t\/\/ there is no localtime_r() on Windows, so for now\n\t\/\/ we just call localtime() and deep copy the result.\n\n\tstruct tm *gt_ptr; \n\n\tgt_ptr = gmtime(now);\n\n\tif (gtm == NULL) { return; } \n\n\tgtm->tm_sec   = gt_ptr->tm_sec;    \/* seconds *\/\n\tgtm->tm_min   = gt_ptr->tm_min;    \/* minutes *\/\n\tgtm->tm_hour  = gt_ptr->tm_hour;   \/* hours *\/\n\tgtm->tm_mday  = gt_ptr->tm_mday;   \/* day of the month *\/\n\tgtm->tm_mon   = gt_ptr->tm_mon;    \/* month *\/\n\tgtm->tm_year  = gt_ptr->tm_year;   \/* year *\/\n\tgtm->tm_wday  = gt_ptr->tm_wday;   \/* day of the week *\/\n\tgtm->tm_yday  = gt_ptr->tm_yday;   \/* day in the year *\/\n\tgtm->tm_isdst = gt_ptr->tm_isdst;  \/* daylight saving time *\/\n\t\n#endif\n\treturn;\n}\n\nvoid absTimeToString(const abstime_t &atime, string &buffer)\n{\n    int       tzsecs;\n    time_t    epoch_time;\n    char      timebuf[32], sign;\n    struct tm tms;\n\n    tzsecs = atime.offset;  \n    epoch_time = atime.secs;\n    if (tzsecs > 0) { \n        sign = '+';         \/\/ timezone offset's sign\n    } else {\n        sign = '-';\n        tzsecs = -tzsecs;\n    }\n    getGMTime(&epoch_time, &tms);\n    strftime(timebuf, sizeof(timebuf), \"%Y-%m-%dT%H:%M:%S\", &tms);\n    buffer += timebuf;\n    sprintf(timebuf, \"%c%02d%02d\", sign, tzsecs \/ 3600, (tzsecs \/ 60) % 60);\n    buffer += timebuf;\n    return;\n}\n\nvoid relTimeToString(double rsecs, string &buffer)\n{\n    double  fractional_seconds;\n    int     days, hrs, mins;\n    double  secs;\n    char    timebuf[128];\n   \n    if( rsecs < 0 ) {\n        buffer += \"-\";\n        rsecs = -rsecs;\n    }\n    fractional_seconds = rsecs - floor(rsecs);\n\n    days = (int) rsecs;\n    hrs  = days % 86400;\n    mins = hrs  % 3600;\n    secs = (mins % 60) + fractional_seconds;\n    days = days \/ 86400;\n    hrs  = hrs  \/ 3600;\n    mins = mins \/ 60;\n    \n    if (days) {\n        if (fractional_seconds == 0) {\n            sprintf(timebuf, \"%d+%02d:%02d:%02d\", days, hrs, mins, (int) secs);\n        } else {\n            sprintf(timebuf, \"%d+%02d:%02d:%02g\", days, hrs, mins, secs);\n        }\n        buffer += timebuf;\n    } else if (hrs) {\n        if (fractional_seconds == 0) {\n            sprintf(timebuf, \"%02d:%02d:%02d\", hrs, mins, (int) secs);\n        } else {\n            sprintf(timebuf, \"%02d:%02d:%02g\", hrs, mins, secs);\n        }\n        buffer += timebuf;\n    } else if (mins) {\n        if (fractional_seconds == 0) {\n            sprintf(timebuf, \"%02d:%02d\", mins, (int) secs);\n        } else {\n            sprintf(timebuf, \"%02d:%02g\", mins, secs);\n        }\n        buffer += timebuf;\n        return;\n    } else {\n        if (fractional_seconds == 0) {\n            sprintf(timebuf, \"%02d\", (int) secs);\n        } else {\n            sprintf(timebuf, \"%02g\", secs);\n        }\n        buffer += timebuf;\n    }\n    return;\n}\n\nvoid day_numbers(int year, int month, int day, int &weekday, int &yearday)\n{\n    int fixed =       fixed_from_gregorian(year, month, day);\n    int jan1_fixed =  fixed_from_gregorian(year, 1, 1);\n    weekday = fixed % 7;\n    yearday = fixed - jan1_fixed;\n    return;\n}\n\nint fixed_from_gregorian(int year, int month, int day)\n{\n    int fixed;\n    int month_adjustment;\n\n    if (month <= 2) {\n        month_adjustment = 0;\n    } else if (is_leap_year(year)) {\n        month_adjustment = -1;\n    } else {\n        month_adjustment = -2;\n    }\n    fixed = 365 * (year -1)\n          + ((year - 1) \/ 4)\n          - ((year - 1) \/ 100)\n          + ((year - 1) \/ 400)\n          + ((367 * month - 362) \/ 12)\n          + month_adjustment\n          + day;\n    return fixed;\n}\n\nbool is_leap_year(int year)\n{\n    int  mod4;\n    int  mod400;\n    bool leap_year;\n\n    mod4   = year % 4;\n    mod400 = year % 400;\n\n    if (mod4 == 0 && mod400 != 100 && mod400 != 200 && mod400 != 300) {\n        leap_year = true;\n    } else {\n        leap_year = false;\n    }\n    return leap_year;\n}\n\n#ifdef WIN32\nint classad_isinf(double x) \n{\n\n\tint result;\n\tresult = _fpclass(x);\n\n\tif (result == _FPCLASS_NINF ) {\n\t\t\/* negative infinity *\/\n\t\treturn -1;\n\t} else if ( result == _FPCLASS_PINF ) {\n\t\t\/* positive infinity *\/\n\t\treturn 1;\n\t} else {\n\t\t\/* otherwise *\/\n\t\treturn 0;\n\t}\n}\n#elif (defined (__SVR4) && defined (__sun)) || defined(__APPLE_CC__)\n#ifndef __APPLE_CC__\n#include <ieeefp.h>\n#endif\nint classad_isinf(double x) \n{ \n    if (finite(x) || x != x) {\n        return 0;\n    } else if (x > 0) {\n        return 1;\n    } else {\n        return -1;\n    }\n}\n#else\nint classad_isinf(double x)\n{\n    if (!isinf(x) || x != x) {\n        return 0;\n    } else if (x > 0) {\n        return 1;\n    } else {\n        return -1;\n    }\n}\n#endif \n\n#ifdef  __APPLE_CC__\nint classad_isnan(double x)\n{\n    return __isnan(x);\n}\n#else\nint classad_isnan(double x)\n{\n    return isnan(x);\n}\n#endif\n\nEND_NAMESPACE \/\/ classad\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright 2012 Frederik Gladhorn <gladhorn@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) version 3, or any\n    later version accepted by the membership of KDE e.V. (or its\n    successor approved by the membership of KDE e.V.), which shall\n    act as a proxy defined in Section 6 of version 3 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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"mainwindow.h\"\n\n#include <qitemselectionmodel.h>\n#include <qplaintextedit.h>\n#include <qstring.h>\n#include <qtreeview.h>\n\n#include \"kdeaccessibilityclient\/registry.h\"\n#include \"kdeaccessibilityclient\/accessibleobject.h\"\n\n#include \"accessibletree.h\"\n\n#include \"tests_auto_modeltest_modeltest.h\"\n\nusing namespace KAccessibleClient;\n\nMainWindow::MainWindow(QWidget *parent)\n    : QMainWindow(parent), m_model(0)\n{\n    ui.setupUi(this);\n\n    m_registry = new KAccessibleClient::Registry(this);\n    connect(m_registry, SIGNAL(focusChanged(KAccessibleClient::AccessibleObject)), this, SLOT(focusChanged(KAccessibleClient::AccessibleObject)));\n    m_registry->subscribeEventListeners(KAccessibleClient::Registry::Focus);\n\n    m_model = new AccessibleTree(this);\n    ui.treeView->setModel(m_model);\n    ui.treeView->setContextMenuPolicy(Qt::ActionsContextMenu);\n    m_model->setRegistry(m_registry);\n\n    \/\/ The ultimate model verificaton helper :p\n    new ModelTest(m_model, this);\n\n    connect(ui.treeView->selectionModel(), SIGNAL(currentChanged(QModelIndex,QModelIndex)), this, SLOT(selectionChanged(QModelIndex,QModelIndex)));\n    connect(ui.action_Reset_tree, SIGNAL(triggered()), m_model, SLOT(resetModel()));\n    ui.action_Reset_tree->setShortcut(QKeySequence(QKeySequence::Refresh));\n}\n\nvoid MainWindow::focusChanged(const KAccessibleClient::AccessibleObject &object)\n{\n    ui.label->setText(tr(\"Focus changed to: %1 - %2 (%3)\").arg(object.name()).arg(object.roleName()).arg(object.role()));\n\n    if (ui.action_Follow_Focus->isChecked()) {\n        QModelIndex index = m_model->indexForAccessible(object);\n        if (index.isValid()) {\n            ui.treeView->scrollTo(index);\n            ui.treeView->selectionModel()->setCurrentIndex(index, QItemSelectionModel::ClearAndSelect);\n        }\n    }\n}\n\nvoid MainWindow::selectionChanged(const QModelIndex& current, const QModelIndex&)\n{\n    QString text;\n\n    while(!actions().isEmpty()) {\n        ui.treeView->removeAction(actions().first());\n    }\n\n    if (current.isValid() && current.internalPointer()) {\n        KAccessibleClient::AccessibleObject acc = static_cast<AccessibleWrapper*>(current.internalPointer())->acc;\n        text += acc.name() + \" (\" + acc.description() + \")\\n\";\n        text += \"role: \" + acc.roleName() + \"\\n\";\n        text += \"checked: \" + (acc.isChecked() ? QLatin1String(\"yes\") : QLatin1String(\"no\")) + '\\n';\n\n        text += \"\\nchildCount: \" + QString::number(acc.childCount()) + \"\\n\";\n        foreach (const KAccessibleClient::AccessibleObject &child, acc.children()) {\n            text += \"child: \" + child.name() + \" (\" + child.roleName() + \")\\n\";\n        }\n\n        Q_FOREACH(QAction *a, acc.actions()) {\n            ui.treeView->insertAction(0, a);\n        }\n    }\n\n    ui.plainTextEdit->setPlainText(text);\n}\n\n\n#include <mainwindow.moc>\n\n<commit_msg>proper compile<commit_after>\/*\n    Copyright 2012 Frederik Gladhorn <gladhorn@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) version 3, or any\n    later version accepted by the membership of KDE e.V. (or its\n    successor approved by the membership of KDE e.V.), which shall\n    act as a proxy defined in Section 6 of version 3 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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"mainwindow.h\"\n\n#include <qitemselectionmodel.h>\n#include <qplaintextedit.h>\n#include <qstring.h>\n#include <qtreeview.h>\n\n#include \"kdeaccessibilityclient\/registry.h\"\n#include \"kdeaccessibilityclient\/accessibleobject.h\"\n\n#include \"accessibletree.h\"\n\n#include \"tests_auto_modeltest_modeltest.h\"\n\nusing namespace KAccessibleClient;\n\nMainWindow::MainWindow(QWidget *parent)\n    : QMainWindow(parent), m_model(0)\n{\n    ui.setupUi(this);\n\n    m_registry = new KAccessibleClient::Registry(this);\n    connect(m_registry, SIGNAL(focusChanged(KAccessibleClient::AccessibleObject)), this, SLOT(focusChanged(KAccessibleClient::AccessibleObject)));\n    m_registry->subscribeEventListeners(KAccessibleClient::Registry::Focus);\n\n    m_model = new AccessibleTree(this);\n    ui.treeView->setModel(m_model);\n    ui.treeView->setContextMenuPolicy(Qt::ActionsContextMenu);\n    m_model->setRegistry(m_registry);\n\n    \/\/ The ultimate model verificaton helper :p\n    new ModelTest(m_model, this);\n\n    connect(ui.treeView->selectionModel(), SIGNAL(currentChanged(QModelIndex,QModelIndex)), this, SLOT(selectionChanged(QModelIndex,QModelIndex)));\n    connect(ui.action_Reset_tree, SIGNAL(triggered()), m_model, SLOT(resetModel()));\n    ui.action_Reset_tree->setShortcut(QKeySequence(QKeySequence::Refresh));\n}\n\nvoid MainWindow::focusChanged(const KAccessibleClient::AccessibleObject &object)\n{\n    ui.label->setText(tr(\"Focus changed to: %1 - %2 (%3)\").arg(object.name()).arg(object.roleName()).arg(object.role()));\n\n    if (ui.action_Follow_Focus->isChecked()) {\n        QModelIndex index = m_model->indexForAccessible(object);\n        if (index.isValid()) {\n            ui.treeView->scrollTo(index);\n            ui.treeView->selectionModel()->setCurrentIndex(index, QItemSelectionModel::ClearAndSelect);\n        }\n    }\n}\n\nvoid MainWindow::selectionChanged(const QModelIndex& current, const QModelIndex&)\n{\n    QString text;\n\n    while(!actions().isEmpty()) {\n        ui.treeView->removeAction(actions().first());\n    }\n\n    if (current.isValid() && current.internalPointer()) {\n        KAccessibleClient::AccessibleObject acc = static_cast<AccessibleWrapper*>(current.internalPointer())->acc;\n        text += acc.name() + \" (\" + acc.description() + \")\\n\";\n        text += \"role: \" + acc.roleName() + \"\\n\";\n        text += \"checked: \" + (acc.isChecked() ? QLatin1String(\"yes\") : QLatin1String(\"no\")) + '\\n';\n\n        text += \"\\nchildCount: \" + QString::number(acc.childCount()) + \"\\n\";\n        foreach (const KAccessibleClient::AccessibleObject &child, acc.children()) {\n            text += \"child: \" + child.name() + \" (\" + child.roleName() + \")\\n\";\n        }\n\n        Q_FOREACH(QAction *a, acc.actions()) {\n            ui.treeView->insertAction(0, a);\n        }\n    }\n\n    ui.plainTextEdit->setPlainText(text);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"FileUtils.hpp\"\n#include <sys\/stat.h>\n#include <dirent.h>\n#include <sys\/types.h>\n#include <sstream>\n#include <limits>\n#include <cstring>\n\nbool fileExists(const std::string& file) {\n    struct stat buf;\n    return (stat(file.c_str(), &buf) == 0);\n}\n\nuint64_t parseUint64(const std::string& value) {\n    uint64_t ret;\n    std::stringstream ss(value);\n    ss >> ret;\n    if(ss.fail()) {\n        return std::numeric_limits<uint64_t>::max();\n    }\n    return ret;\n}\n\n#include <iostream>\nusing namespace std;\nsize_t getFilesize(const char* filename) {\n    struct stat st;\n    if(stat(filename, &st) != 0) {\n        return std::numeric_limits<size_t>::max();\n    }\n    return st.st_size;   \n}\nsize_t getDirectoryFilesize(const char* dirname) {\n    \/**\n     * Using boost::filesystem would make this task easier,\n     * however it would introduce a large, clunky dependency\n     * which is not practicable for all applications YakDB is\n     * designed for.\n     *\/\n    DIR* dir;\n    struct dirent* ent;\n    size_t filesizeSum = 0;\n    if ((dir = opendir(dirname)) != nullptr) {\n        \/\/Iterate over entries in directory\n        while ((ent = readdir(dir)) != nullptr) {\n            \/\/ent->d_name is relative to the current directory.\n            \/\/Make it absolute\n            std::string absoluteFilename =\n                std::string(dirname) + \"\/\" + std::string(ent->d_name);\n            if(ent->d_type == DT_DIR) {\n                \/\/Skip . and .. which lead to infinite recursion\n                if (strcmp(\".\", ent->d_name) == 0 || strcmp(\"..\", ent->d_name) == 0) {\n                    continue;\n                }\n                \/\/Recurse into directory\n                filesizeSum += getDirectoryFilesize(absoluteFilename.c_str());\n            } else if(ent->d_type == DT_REG) {\n                \/\/Regular file -> use its size\n                size_t filesize = getFilesize(absoluteFilename.c_str());\n                \/\/getFilesize returns max() on error\n                if(filesize == std::numeric_limits<size_t>::max()) {\n                    filesize = 0;\n                }\n                filesizeSum += filesize;\n            } \/\/Else: Ignore\n        }\n        closedir (dir);\n    }\n    return filesizeSum;\n}<commit_msg>Remove FileUtils debugging code<commit_after>#include \"FileUtils.hpp\"\n#include <sys\/stat.h>\n#include <dirent.h>\n#include <sys\/types.h>\n#include <sstream>\n#include <limits>\n#include <cstring>\n\nbool fileExists(const std::string& file) {\n    struct stat buf;\n    return (stat(file.c_str(), &buf) == 0);\n}\n\nuint64_t parseUint64(const std::string& value) {\n    uint64_t ret;\n    std::stringstream ss(value);\n    ss >> ret;\n    if(ss.fail()) {\n        return std::numeric_limits<uint64_t>::max();\n    }\n    return ret;\n}\n\nsize_t getFilesize(const char* filename) {\n    struct stat st;\n    if(stat(filename, &st) != 0) {\n        return std::numeric_limits<size_t>::max();\n    }\n    return st.st_size;   \n}\nsize_t getDirectoryFilesize(const char* dirname) {\n    \/**\n     * Using boost::filesystem would make this task easier,\n     * however it would introduce a large, clunky dependency\n     * which is not practicable for all applications YakDB is\n     * designed for.\n     *\/\n    DIR* dir;\n    struct dirent* ent;\n    size_t filesizeSum = 0;\n    if ((dir = opendir(dirname)) != nullptr) {\n        \/\/Iterate over entries in directory\n        while ((ent = readdir(dir)) != nullptr) {\n            \/\/ent->d_name is relative to the current directory.\n            \/\/Make it absolute\n            std::string absoluteFilename =\n                std::string(dirname) + \"\/\" + std::string(ent->d_name);\n            if(ent->d_type == DT_DIR) {\n                \/\/Skip . and .. which lead to infinite recursion\n                if (strcmp(\".\", ent->d_name) == 0 || strcmp(\"..\", ent->d_name) == 0) {\n                    continue;\n                }\n                \/\/Recurse into directory\n                filesizeSum += getDirectoryFilesize(absoluteFilename.c_str());\n            } else if(ent->d_type == DT_REG) {\n                \/\/Regular file -> use its size\n                size_t filesize = getFilesize(absoluteFilename.c_str());\n                \/\/getFilesize returns max() on error\n                if(filesize == std::numeric_limits<size_t>::max()) {\n                    filesize = 0;\n                }\n                filesizeSum += filesize;\n            } \/\/Else: Ignore\n        }\n        closedir (dir);\n    }\n    return filesizeSum;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Ignore unused parameter warnings coming from cppunit headers\n#include <libmesh\/ignore_warnings.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/TestCase.h>\n#include <libmesh\/restore_warnings.h>\n\n#include <libmesh\/libmesh.h>\n#include <libmesh\/elem.h>\n\n#include \"test_comm.h\"\n\nusing namespace libMesh;\n\nclass ContainsPointTest : public CppUnit::TestCase\n{\n  \/**\n   * The goal of this test is to verify proper operation of the contains_point\n   * method that is used extensively in the point locator. This test focusses on\n   * the specializes contains_point implementaion in TRI3.\n   *\/\npublic:\n  CPPUNIT_TEST_SUITE( ContainsPointTest );\n\n  CPPUNIT_TEST( testContainsPointTri3 );\n\n  CPPUNIT_TEST_SUITE_END();\n\npublic:\n  void setUp() {}\n\n  void tearDown() {}\n\n  \/\/ TRI3 test\n  void testContainsPointTri3() {\n    \/\/ tri corner nodes\n    Node a(3,1,2, 0);\n    Node b(1,2,3, 1);\n    Node c(2,3,1, 2);\n\n    \/\/ helper vectors to span the tri and point out of plane\n    Point va(a-c);\n    Point vb(b-c);\n    Point oop(va.cross(vb));\n\n    UniquePtr<Elem> elem = Elem::build(TRI3);\n\n    elem->set_node(0) = &a;\n    elem->set_node(1) = &b;\n    elem->set_node(2) = &c;\n\n    \/\/ midpoint\n    Point mid = 1.0\/3.0 * (a + b + c);\n    CPPUNIT_ASSERT (elem->contains_point(mid));\n\n    \/\/ out of plane from the mid point\n    CPPUNIT_ASSERT (!elem->contains_point(mid + 0.1 * oop));\n\n    \/\/ check all corners\n    CPPUNIT_ASSERT (elem->contains_point(a));\n    CPPUNIT_ASSERT (elem->contains_point(b));\n    CPPUNIT_ASSERT (elem->contains_point(c));\n\n    \/\/ check outside\n    CPPUNIT_ASSERT (!elem->contains_point(a + va * TOLERANCE * 10));\n    CPPUNIT_ASSERT (!elem->contains_point(b + vb * TOLERANCE * 10));\n    CPPUNIT_ASSERT (!elem->contains_point(c - (va + vb) * TOLERANCE * 10));\n  }\n};\n\n\nCPPUNIT_TEST_SUITE_REGISTRATION( ContainsPointTest );\n<commit_msg>Add unit test of new contains_point() routine.<commit_after>\/\/ Ignore unused parameter warnings coming from cppunit headers\n#include <libmesh\/ignore_warnings.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/TestCase.h>\n#include <libmesh\/restore_warnings.h>\n\n#include <libmesh\/libmesh.h>\n#include <libmesh\/elem.h>\n\n#include \"test_comm.h\"\n\nusing namespace libMesh;\n\nclass ContainsPointTest : public CppUnit::TestCase\n{\n  \/**\n   * The goal of this test is to verify proper operation of the contains_point\n   * method that is used extensively in the point locator. This test focusses on\n   * the specializes contains_point implementaion in TRI3.\n   *\/\npublic:\n  CPPUNIT_TEST_SUITE( ContainsPointTest );\n\n  CPPUNIT_TEST( testContainsPointTri3 );\n\n  CPPUNIT_TEST( testContainsPointTet4 );\n\n  CPPUNIT_TEST_SUITE_END();\n\npublic:\n  void setUp() {}\n\n  void tearDown() {}\n\n  \/\/ TRI3 test\n  void testContainsPointTri3() {\n    \/\/ tri corner nodes\n    Node a(3,1,2, 0);\n    Node b(1,2,3, 1);\n    Node c(2,3,1, 2);\n\n    \/\/ helper vectors to span the tri and point out of plane\n    Point va(a-c);\n    Point vb(b-c);\n    Point oop(va.cross(vb));\n\n    UniquePtr<Elem> elem = Elem::build(TRI3);\n\n    elem->set_node(0) = &a;\n    elem->set_node(1) = &b;\n    elem->set_node(2) = &c;\n\n    \/\/ midpoint\n    Point mid = 1.0\/3.0 * (a + b + c);\n    CPPUNIT_ASSERT (elem->contains_point(mid));\n\n    \/\/ out of plane from the mid point\n    CPPUNIT_ASSERT (!elem->contains_point(mid + 0.1 * oop));\n\n    \/\/ check all corners\n    CPPUNIT_ASSERT (elem->contains_point(a));\n    CPPUNIT_ASSERT (elem->contains_point(b));\n    CPPUNIT_ASSERT (elem->contains_point(c));\n\n    \/\/ check outside\n    CPPUNIT_ASSERT (!elem->contains_point(a + va * TOLERANCE * 10));\n    CPPUNIT_ASSERT (!elem->contains_point(b + vb * TOLERANCE * 10));\n    CPPUNIT_ASSERT (!elem->contains_point(c - (va + vb) * TOLERANCE * 10));\n  }\n\n\n\n  \/\/ TET4 test\n  void testContainsPointTet4()\n  {\n    \/\/ Construct unit Tet.\n    {\n      Node zero  (0., 0., 0., 0);\n      Node one   (1., 0., 0., 1);\n      Node two   (0., 1., 0., 2);\n      Node three (0., 0., 1., 3);\n\n      UniquePtr<Elem> elem = Elem::build(TET4);\n      elem->set_node(0) = &zero;\n      elem->set_node(1) = &one;\n      elem->set_node(2) = &two;\n      elem->set_node(3) = &three;\n\n      \/\/ The centroid must be inside the element.\n      CPPUNIT_ASSERT (elem->contains_point(elem->centroid()));\n\n      \/\/ The vertices must be contained in the element.\n      CPPUNIT_ASSERT (elem->contains_point(zero));\n      CPPUNIT_ASSERT (elem->contains_point(one));\n      CPPUNIT_ASSERT (elem->contains_point(two));\n      CPPUNIT_ASSERT (elem->contains_point(three));\n\n      \/\/ Make sure that outside points are not contained.\n      CPPUNIT_ASSERT (!elem->contains_point(Point(.34, .34, .34)));\n      CPPUNIT_ASSERT (!elem->contains_point(Point(.33, .33, -.1)));\n      CPPUNIT_ASSERT (!elem->contains_point(Point(0., -.1, .5)));\n    }\n\n\n    \/\/ Construct a nearly degenerate (sliver) tet.  A unit tet with\n    \/\/ nodes \"one\" and \"two\" moved to within a distance of epsilon\n    \/\/ from the origin.\n    {\n      Real epsilon = 1.e-4;\n\n      Node zero  (0., 0., 0., 0);\n      Node one   (epsilon, 0., 0., 1);\n      Node two   (0., epsilon, 0., 2);\n      Node three (0., 0., 1., 3);\n\n      UniquePtr<Elem> elem = Elem::build(TET4);\n      elem->set_node(0) = &zero;\n      elem->set_node(1) = &one;\n      elem->set_node(2) = &two;\n      elem->set_node(3) = &three;\n\n      \/\/ The centroid must be inside the element.\n      CPPUNIT_ASSERT (elem->contains_point(elem->centroid()));\n\n      \/\/ The vertices must be contained in the element.\n      CPPUNIT_ASSERT (elem->contains_point(zero));\n      CPPUNIT_ASSERT (elem->contains_point(one));\n      CPPUNIT_ASSERT (elem->contains_point(two));\n      CPPUNIT_ASSERT (elem->contains_point(three));\n\n      \/\/ Verify that a point which is on a mid-edge is contained in the element.\n      CPPUNIT_ASSERT (elem->contains_point(Point(epsilon\/2, 0, 0.5)));\n\n      \/\/ Make sure that \"just barely\" outside points are outside.\n      CPPUNIT_ASSERT (!elem->contains_point(Point(epsilon, epsilon, epsilon\/2)));\n      CPPUNIT_ASSERT (!elem->contains_point(Point(epsilon\/10, epsilon\/10, 1.0)));\n      CPPUNIT_ASSERT (!elem->contains_point(Point(epsilon\/2, -epsilon\/10, 0.5)));\n    }\n  }\n};\n\n\nCPPUNIT_TEST_SUITE_REGISTRATION( ContainsPointTest );\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: regpathhelper.cxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 17:13: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_comphelper.hxx\"\n\n#include <stdio.h>\n\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef _OSL_SECURITY_HXX_\n#include <osl\/security.hxx>\n#endif\n#ifndef _OSL_THREAD_H_\n#include <osl\/thread.h>\n#endif\n#ifndef _VOS_PROCESS_HXX_\n#include <vos\/process.hxx>\n#endif\n#ifndef _RTL_TEXTENC_H\n#include <rtl\/textenc.h>\n#endif\n#ifndef _RTL_URI_H_\n#include <rtl\/uri.h>\n#endif\n#ifndef _RTL_URI_HXX_\n#include <rtl\/uri.hxx>\n#endif\n\nusing namespace vos;\nusing namespace osl;\nusing namespace rtl;\n\n#define PATH_DELEMITTER '\/'\n\n#define USER_REGISTRY_NAME_ENV      \"STAR_USER_REGISTRY\"\n#define SYSTEM_REGISTRY_NAME_ENV    \"STAR_REGISTRY\"\n#define REGISTRY_SYSTEM_NAME    \"services.rdb\"\n\n#define REGISTRY_LOCAL_NAME     \"user60.rdb\"\n\n#ifdef SAL_UNX\n#define CONFIG_PATH_PREFIX      \".\"\n#else\n#define CONFIG_PATH_PREFIX      \"\"\n#endif\n\nnamespace comphelper\n{\n\n\/**\n   @return sal_True, if the office is started in a portal\n                     environment.\n           sal_False, if the common office is started\n *\/\nstatic sal_Bool retrievePortalUserDir( OUString *pDirectory )\n{\n    OStartupInfo startInfo;\n    sal_uInt32 nArgs = startInfo.getCommandArgCount();\n    sal_Bool bIsPortalUser = sal_False;\n    OUString sArg;\n    while( nArgs > 0 )\n      {\n        if ( !startInfo.getCommandArg(--nArgs, sArg) )\n          {\n            if ( sArg.indexOf(OUString::createFromAscii(\"-userid\")) == 0 )\n            {\n\n                  bIsPortalUser = sal_True;\n                sal_Int32 nStart = sArg.lastIndexOf( '[' );\n                sal_Int32 nEnd   = sArg.lastIndexOf( ']' );\n                if( -1 == nStart || -1 == nEnd || nEnd < nStart)\n                {\n                    *pDirectory = OUString();\n                }\n                else\n                {\n                    OUString aEncHome = sArg.copy( nStart + 1 , nEnd - nStart -1 );\n                    *pDirectory = rtl::Uri::decode(aEncHome,\n                                                   rtl_UriDecodeWithCharset,\n                                                   RTL_TEXTENCODING_UTF8);\n                }\n                  break;\n            }\n          }\n     }\n    return bIsPortalUser;\n}\n\n\nstatic OUString getDefaultLocalRegistry()\n{\n    OUString uBuffer, userRegistryName;\n    OUString portalUserDir;\n\n    sal_Bool bIsPortalUser = retrievePortalUserDir( &portalUserDir );\n\n    if ( bIsPortalUser )\n       {\n        if(  portalUserDir.getLength() )\n        {\n            FileBase::getFileURLFromSystemPath( portalUserDir , portalUserDir );\n            userRegistryName = portalUserDir;\n            userRegistryName += OUString( RTL_CONSTASCII_USTRINGPARAM(\n                \"\/user\/\" REGISTRY_LOCAL_NAME ) );\n\n            \/\/ Directory creation is probably necessary for bootstrapping a new\n            \/\/ user in the portal environment (the ucb uses this function).\n            \/\/ This should be solved differently, as\n            \/\/ no one expects this function to create anything ...\n            OUString sSeparator(RTL_CONSTASCII_USTRINGPARAM(\"\/\"));\n            OUString sPath(RTL_CONSTASCII_USTRINGPARAM(\"file:\/\/\"));\n            FileBase::RC retRC = FileBase::E_None;\n\n            sal_Int32 nIndex = 3;\n            sPath += userRegistryName.getToken(2, '\/', nIndex);\n            while( nIndex != -1 )\n            {\n                sPath += sSeparator;\n                sPath += userRegistryName.getToken(0, '\/', nIndex);\n                if( nIndex == -1 )\n                    break;\n                Directory aDir( sPath );\n                if( aDir.open() == FileBase::E_NOENT )\n                {\n                    retRC = Directory::create(sPath);\n                    if ( retRC != FileBase::E_None && retRC != FileBase::E_EXIST)\n                    {\n                        return OUString();\n                    }\n                }\n            }\n        }\n    }\n    else \/* bIsPortalUser *\/\n    {\n        ::osl::Security aUserSecurity;\n        aUserSecurity.getConfigDir( userRegistryName );\n        userRegistryName += OUString( RTL_CONSTASCII_USTRINGPARAM(\n            \"\/\" CONFIG_PATH_PREFIX REGISTRY_LOCAL_NAME ) );\n    }\n\n    return userRegistryName;\n}\n\n\nOUString getPathToUserRegistry()\n{\n    OUString    userRegistryName;\n    FILE        *f=NULL;\n\n    \/\/ search the environment STAR_USER_REGISTRY\n    OString sBuffer( getenv(USER_REGISTRY_NAME_ENV) );\n    if ( sBuffer.getLength() > 0 )\n    {\n        f = fopen( sBuffer.getStr(), \"r\" );\n\n        if (f != NULL)\n        {\n            fclose(f);\n            userRegistryName = OStringToOUString( sBuffer, osl_getThreadTextEncoding() );\n        }\n    }\n\n    if ( !userRegistryName.getLength() )\n    {\n        userRegistryName = getDefaultLocalRegistry();\n    }\n\n    return userRegistryName;\n}\n\nOUString getPathToSystemRegistry()\n{\n    OUString uBuffer;\n    OUString registryBaseName( RTL_CONSTASCII_USTRINGPARAM(REGISTRY_SYSTEM_NAME) );\n    OUString systemRegistryName;\n    FILE     *f=NULL;\n\n    \/\/ search in the directory of the executable\n    OStartupInfo info;\n    if( OStartupInfo::E_None == info.getExecutableFile(uBuffer) )\n    {\n        sal_uInt32  lastIndex = uBuffer.lastIndexOf(PATH_DELEMITTER);\n        if (lastIndex > 0)\n        {\n            uBuffer = uBuffer.copy(0, lastIndex + 1);\n        }\n\n        uBuffer += registryBaseName;\n\n        if (!FileBase::getSystemPathFromFileURL(uBuffer, systemRegistryName))\n        {\n            OString tmpStr( OUStringToOString(systemRegistryName, osl_getThreadTextEncoding()) );\n            f = fopen( tmpStr.getStr(), \"r\" );\n        }\n    }\n\n    if (f == NULL)\n    {\n        \/\/ search the environment STAR_REGISTRY\n        OString tmpStr( getenv(SYSTEM_REGISTRY_NAME_ENV) );\n        if ( tmpStr.getLength() > 0 )\n        {\n            f = fopen(tmpStr.getStr(), \"r\");\n\n            if (f != NULL)\n            {\n                fclose(f);\n                systemRegistryName = OStringToOUString( tmpStr, osl_getThreadTextEncoding() );\n            } else\n            {\n                systemRegistryName = OUString();\n            }\n        }\n    } else\n    {\n        fclose(f);\n    }\n\n    return systemRegistryName;\n}\n\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.16.160); FILE MERGED 2008\/04\/01 15:05:28 thb 1.16.160.2: #i85898# Stripping all external header guards 2008\/03\/31 12:19:33 rt 1.16.160.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: regpathhelper.cxx,v $\n * $Revision: 1.17 $\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_comphelper.hxx\"\n\n#include <stdio.h>\n#include <osl\/file.hxx>\n#include <osl\/security.hxx>\n#include <osl\/thread.h>\n#include <vos\/process.hxx>\n#include <rtl\/textenc.h>\n#include <rtl\/uri.h>\n#include <rtl\/uri.hxx>\n\nusing namespace vos;\nusing namespace osl;\nusing namespace rtl;\n\n#define PATH_DELEMITTER '\/'\n\n#define USER_REGISTRY_NAME_ENV      \"STAR_USER_REGISTRY\"\n#define SYSTEM_REGISTRY_NAME_ENV    \"STAR_REGISTRY\"\n#define REGISTRY_SYSTEM_NAME    \"services.rdb\"\n\n#define REGISTRY_LOCAL_NAME     \"user60.rdb\"\n\n#ifdef SAL_UNX\n#define CONFIG_PATH_PREFIX      \".\"\n#else\n#define CONFIG_PATH_PREFIX      \"\"\n#endif\n\nnamespace comphelper\n{\n\n\/**\n   @return sal_True, if the office is started in a portal\n                     environment.\n           sal_False, if the common office is started\n *\/\nstatic sal_Bool retrievePortalUserDir( OUString *pDirectory )\n{\n    OStartupInfo startInfo;\n    sal_uInt32 nArgs = startInfo.getCommandArgCount();\n    sal_Bool bIsPortalUser = sal_False;\n    OUString sArg;\n    while( nArgs > 0 )\n      {\n        if ( !startInfo.getCommandArg(--nArgs, sArg) )\n          {\n            if ( sArg.indexOf(OUString::createFromAscii(\"-userid\")) == 0 )\n            {\n\n                  bIsPortalUser = sal_True;\n                sal_Int32 nStart = sArg.lastIndexOf( '[' );\n                sal_Int32 nEnd   = sArg.lastIndexOf( ']' );\n                if( -1 == nStart || -1 == nEnd || nEnd < nStart)\n                {\n                    *pDirectory = OUString();\n                }\n                else\n                {\n                    OUString aEncHome = sArg.copy( nStart + 1 , nEnd - nStart -1 );\n                    *pDirectory = rtl::Uri::decode(aEncHome,\n                                                   rtl_UriDecodeWithCharset,\n                                                   RTL_TEXTENCODING_UTF8);\n                }\n                  break;\n            }\n          }\n     }\n    return bIsPortalUser;\n}\n\n\nstatic OUString getDefaultLocalRegistry()\n{\n    OUString uBuffer, userRegistryName;\n    OUString portalUserDir;\n\n    sal_Bool bIsPortalUser = retrievePortalUserDir( &portalUserDir );\n\n    if ( bIsPortalUser )\n       {\n        if(  portalUserDir.getLength() )\n        {\n            FileBase::getFileURLFromSystemPath( portalUserDir , portalUserDir );\n            userRegistryName = portalUserDir;\n            userRegistryName += OUString( RTL_CONSTASCII_USTRINGPARAM(\n                \"\/user\/\" REGISTRY_LOCAL_NAME ) );\n\n            \/\/ Directory creation is probably necessary for bootstrapping a new\n            \/\/ user in the portal environment (the ucb uses this function).\n            \/\/ This should be solved differently, as\n            \/\/ no one expects this function to create anything ...\n            OUString sSeparator(RTL_CONSTASCII_USTRINGPARAM(\"\/\"));\n            OUString sPath(RTL_CONSTASCII_USTRINGPARAM(\"file:\/\/\"));\n            FileBase::RC retRC = FileBase::E_None;\n\n            sal_Int32 nIndex = 3;\n            sPath += userRegistryName.getToken(2, '\/', nIndex);\n            while( nIndex != -1 )\n            {\n                sPath += sSeparator;\n                sPath += userRegistryName.getToken(0, '\/', nIndex);\n                if( nIndex == -1 )\n                    break;\n                Directory aDir( sPath );\n                if( aDir.open() == FileBase::E_NOENT )\n                {\n                    retRC = Directory::create(sPath);\n                    if ( retRC != FileBase::E_None && retRC != FileBase::E_EXIST)\n                    {\n                        return OUString();\n                    }\n                }\n            }\n        }\n    }\n    else \/* bIsPortalUser *\/\n    {\n        ::osl::Security aUserSecurity;\n        aUserSecurity.getConfigDir( userRegistryName );\n        userRegistryName += OUString( RTL_CONSTASCII_USTRINGPARAM(\n            \"\/\" CONFIG_PATH_PREFIX REGISTRY_LOCAL_NAME ) );\n    }\n\n    return userRegistryName;\n}\n\n\nOUString getPathToUserRegistry()\n{\n    OUString    userRegistryName;\n    FILE        *f=NULL;\n\n    \/\/ search the environment STAR_USER_REGISTRY\n    OString sBuffer( getenv(USER_REGISTRY_NAME_ENV) );\n    if ( sBuffer.getLength() > 0 )\n    {\n        f = fopen( sBuffer.getStr(), \"r\" );\n\n        if (f != NULL)\n        {\n            fclose(f);\n            userRegistryName = OStringToOUString( sBuffer, osl_getThreadTextEncoding() );\n        }\n    }\n\n    if ( !userRegistryName.getLength() )\n    {\n        userRegistryName = getDefaultLocalRegistry();\n    }\n\n    return userRegistryName;\n}\n\nOUString getPathToSystemRegistry()\n{\n    OUString uBuffer;\n    OUString registryBaseName( RTL_CONSTASCII_USTRINGPARAM(REGISTRY_SYSTEM_NAME) );\n    OUString systemRegistryName;\n    FILE     *f=NULL;\n\n    \/\/ search in the directory of the executable\n    OStartupInfo info;\n    if( OStartupInfo::E_None == info.getExecutableFile(uBuffer) )\n    {\n        sal_uInt32  lastIndex = uBuffer.lastIndexOf(PATH_DELEMITTER);\n        if (lastIndex > 0)\n        {\n            uBuffer = uBuffer.copy(0, lastIndex + 1);\n        }\n\n        uBuffer += registryBaseName;\n\n        if (!FileBase::getSystemPathFromFileURL(uBuffer, systemRegistryName))\n        {\n            OString tmpStr( OUStringToOString(systemRegistryName, osl_getThreadTextEncoding()) );\n            f = fopen( tmpStr.getStr(), \"r\" );\n        }\n    }\n\n    if (f == NULL)\n    {\n        \/\/ search the environment STAR_REGISTRY\n        OString tmpStr( getenv(SYSTEM_REGISTRY_NAME_ENV) );\n        if ( tmpStr.getLength() > 0 )\n        {\n            f = fopen(tmpStr.getStr(), \"r\");\n\n            if (f != NULL)\n            {\n                fclose(f);\n                systemRegistryName = OStringToOUString( tmpStr, osl_getThreadTextEncoding() );\n            } else\n            {\n                systemRegistryName = OUString();\n            }\n        }\n    } else\n    {\n        fclose(f);\n    }\n\n    return systemRegistryName;\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\nnamespace kengine {\n    struct CommandLineComponent {\n        int argc = 0;\n        const char ** argv = nullptr;\n    };\n}<commit_msg>reflectible CommandLineComponent<commit_after>#pragma once\n\n#include <vector>\n#include <string>\n#include \"reflection.hpp\"\n\nnamespace kengine {\n    struct CommandLineComponent {\n        std::vector<std::string> arguments;\n    };\n}\n\n#define refltype kengine::CommandLineComponent\nputils_reflection_info{\n    putils_reflection_class_name;\n    putils_reflection_attributes(\n        putils_reflection_attribute(arguments)\n    );\n};\n#undef refltype<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright 2015 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 <grpcpp\/channel.h>\n\n#include <chrono>\n#include <condition_variable>\n#include <cstring>\n#include <memory>\n#include <mutex>\n\n#include <grpc\/grpc.h>\n#include <grpc\/slice.h>\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n#include <grpc\/support\/sync.h>\n#include <grpc\/support\/time.h>\n#include <grpcpp\/client_context.h>\n#include <grpcpp\/completion_queue.h>\n#include <grpcpp\/impl\/call.h>\n#include <grpcpp\/impl\/codegen\/completion_queue_tag.h>\n#include <grpcpp\/impl\/grpc_library.h>\n#include <grpcpp\/impl\/rpc_method.h>\n#include <grpcpp\/security\/credentials.h>\n#include <grpcpp\/support\/channel_arguments.h>\n#include <grpcpp\/support\/config.h>\n#include <grpcpp\/support\/status.h>\n#include <grpcpp\/support\/time.h>\n#include \"src\/core\/lib\/gpr\/env.h\"\n#include \"src\/core\/lib\/gpr\/string.h\"\n#include \"src\/core\/lib\/gprpp\/memory.h\"\n#include \"src\/core\/lib\/gprpp\/thd.h\"\n#include \"src\/core\/lib\/profiling\/timers.h\"\n#include \"src\/core\/lib\/surface\/completion_queue.h\"\n\nnamespace grpc {\n\nstatic internal::GrpcLibraryInitializer g_gli_initializer;\nChannel::Channel(const grpc::string& host, grpc_channel* channel)\n    : host_(host), c_channel_(channel) {\n  g_gli_initializer.summon();\n}\n\nChannel::~Channel() {\n  grpc_channel_destroy(c_channel_);\n  if (callback_cq_ != nullptr) {\n    callback_cq_->Shutdown();\n  }\n}\n\nnamespace {\n\ngrpc::string GetChannelInfoField(grpc_channel* channel,\n                                 grpc_channel_info* channel_info,\n                                 char*** channel_info_field) {\n  char* value = nullptr;\n  memset(channel_info, 0, sizeof(*channel_info));\n  *channel_info_field = &value;\n  grpc_channel_get_info(channel, channel_info);\n  if (value == nullptr) return \"\";\n  grpc::string result = value;\n  gpr_free(value);\n  return result;\n}\n\n}  \/\/ namespace\n\ngrpc::string Channel::GetLoadBalancingPolicyName() const {\n  grpc_channel_info channel_info;\n  return GetChannelInfoField(c_channel_, &channel_info,\n                             &channel_info.lb_policy_name);\n}\n\ngrpc::string Channel::GetServiceConfigJSON() const {\n  grpc_channel_info channel_info;\n  return GetChannelInfoField(c_channel_, &channel_info,\n                             &channel_info.service_config_json);\n}\n\nnamespace experimental {\n\nvoid ChannelResetConnectionBackoff(Channel* channel) {\n  grpc_channel_reset_connect_backoff(channel->c_channel_);\n}\n\n}  \/\/ namespace experimental\n\ninternal::Call Channel::CreateCall(const internal::RpcMethod& method,\n                                   ClientContext* context,\n                                   CompletionQueue* cq) {\n  const bool kRegistered = method.channel_tag() && context->authority().empty();\n  grpc_call* c_call = nullptr;\n  if (kRegistered) {\n    c_call = grpc_channel_create_registered_call(\n        c_channel_, context->propagate_from_call_,\n        context->propagation_options_.c_bitmask(), cq->cq(),\n        method.channel_tag(), context->raw_deadline(), nullptr);\n  } else {\n    const char* host_str = nullptr;\n    if (!context->authority().empty()) {\n      host_str = context->authority_.c_str();\n    } else if (!host_.empty()) {\n      host_str = host_.c_str();\n    }\n    grpc_slice method_slice =\n        SliceFromArray(method.name(), strlen(method.name()));\n    grpc_slice host_slice;\n    if (host_str != nullptr) {\n      host_slice = SliceFromArray(host_str, strlen(host_str));\n    }\n    c_call = grpc_channel_create_call(\n        c_channel_, context->propagate_from_call_,\n        context->propagation_options_.c_bitmask(), cq->cq(), method_slice,\n        host_str == nullptr ? nullptr : &host_slice, context->raw_deadline(),\n        nullptr);\n    grpc_slice_unref(method_slice);\n    if (host_str != nullptr) {\n      grpc_slice_unref(host_slice);\n    }\n  }\n  grpc_census_call_set_context(c_call, context->census_context());\n  context->set_call(c_call, shared_from_this());\n  return internal::Call(c_call, this, cq);\n}\n\nvoid Channel::PerformOpsOnCall(internal::CallOpSetInterface* ops,\n                               internal::Call* call) {\n  static const size_t MAX_OPS = 8;\n  size_t nops = 0;\n  grpc_op cops[MAX_OPS];\n  ops->FillOps(call->call(), cops, &nops);\n  GPR_ASSERT(GRPC_CALL_OK == grpc_call_start_batch(call->call(), cops, nops,\n                                                   ops->cq_tag(), nullptr));\n}\n\nvoid* Channel::RegisterMethod(const char* method) {\n  return grpc_channel_register_call(\n      c_channel_, method, host_.empty() ? nullptr : host_.c_str(), nullptr);\n}\n\ngrpc_connectivity_state Channel::GetState(bool try_to_connect) {\n  return grpc_channel_check_connectivity_state(c_channel_, try_to_connect);\n}\n\nnamespace {\n\nclass TagSaver final : public internal::CompletionQueueTag {\n public:\n  explicit TagSaver(void* tag) : tag_(tag) {}\n  ~TagSaver() override {}\n  bool FinalizeResult(void** tag, bool* status) override {\n    *tag = tag_;\n    delete this;\n    return true;\n  }\n\n private:\n  void* tag_;\n};\n\n}  \/\/ namespace\n\nvoid Channel::NotifyOnStateChangeImpl(grpc_connectivity_state last_observed,\n                                      gpr_timespec deadline,\n                                      CompletionQueue* cq, void* tag) {\n  TagSaver* tag_saver = new TagSaver(tag);\n  grpc_channel_watch_connectivity_state(c_channel_, last_observed, deadline,\n                                        cq->cq(), tag_saver);\n}\n\nbool Channel::WaitForStateChangeImpl(grpc_connectivity_state last_observed,\n                                     gpr_timespec deadline) {\n  CompletionQueue cq;\n  bool ok = false;\n  void* tag = nullptr;\n  NotifyOnStateChangeImpl(last_observed, deadline, &cq, nullptr);\n  cq.Next(&tag, &ok);\n  GPR_ASSERT(tag == nullptr);\n  return ok;\n}\n\nnamespace {\nclass ShutdownCallback : public grpc_experimental_completion_queue_functor {\n public:\n  ShutdownCallback() { functor_run = &ShutdownCallback::Run; }\n  \/\/ TakeCQ takes ownership of the cq into the shutdown callback\n  \/\/ so that the shutdown callback will be responsible for destroying it\n  void TakeCQ(CompletionQueue* cq) { cq_ = cq; }\n\n  \/\/ The Run function will get invoked by the completion queue library\n  \/\/ when the shutdown is actually complete\n  static void Run(grpc_experimental_completion_queue_functor* cb, int) {\n    auto* callback = static_cast<ShutdownCallback*>(cb);\n    delete callback->cq_;\n    grpc_core::Delete(callback);\n  }\n\n private:\n  CompletionQueue* cq_ = nullptr;\n};\n}  \/\/ namespace\n\nCompletionQueue* Channel::CallbackCQ() {\n  \/\/ TODO(vjpai): Consider using a single global CQ for the default CQ\n  \/\/ if there is no explicit per-channel CQ registered\n  std::lock_guard<std::mutex> l(mu_);\n  if (callback_cq_ == nullptr) {\n    auto* shutdown_callback = grpc_core::New<ShutdownCallback>();\n    callback_cq_ = new CompletionQueue(grpc_completion_queue_attributes{\n        GRPC_CQ_CURRENT_VERSION, GRPC_CQ_CALLBACK, GRPC_CQ_DEFAULT_POLLING,\n        shutdown_callback});\n\n    \/\/ Transfer ownership of the new cq to its own shutdown callback\n    shutdown_callback->TakeCQ(callback_cq_);\n  }\n  return callback_cq_;\n}\n\n}  \/\/ namespace grpc\n<commit_msg>Use SliceFromCopiedString() for host name.<commit_after>\/*\n *\n * Copyright 2015 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 <grpcpp\/channel.h>\n\n#include <chrono>\n#include <condition_variable>\n#include <cstring>\n#include <memory>\n#include <mutex>\n\n#include <grpc\/grpc.h>\n#include <grpc\/slice.h>\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n#include <grpc\/support\/sync.h>\n#include <grpc\/support\/time.h>\n#include <grpcpp\/client_context.h>\n#include <grpcpp\/completion_queue.h>\n#include <grpcpp\/impl\/call.h>\n#include <grpcpp\/impl\/codegen\/completion_queue_tag.h>\n#include <grpcpp\/impl\/grpc_library.h>\n#include <grpcpp\/impl\/rpc_method.h>\n#include <grpcpp\/security\/credentials.h>\n#include <grpcpp\/support\/channel_arguments.h>\n#include <grpcpp\/support\/config.h>\n#include <grpcpp\/support\/status.h>\n#include <grpcpp\/support\/time.h>\n#include \"src\/core\/lib\/gpr\/env.h\"\n#include \"src\/core\/lib\/gpr\/string.h\"\n#include \"src\/core\/lib\/gprpp\/memory.h\"\n#include \"src\/core\/lib\/gprpp\/thd.h\"\n#include \"src\/core\/lib\/profiling\/timers.h\"\n#include \"src\/core\/lib\/surface\/completion_queue.h\"\n\nnamespace grpc {\n\nstatic internal::GrpcLibraryInitializer g_gli_initializer;\nChannel::Channel(const grpc::string& host, grpc_channel* channel)\n    : host_(host), c_channel_(channel) {\n  g_gli_initializer.summon();\n}\n\nChannel::~Channel() {\n  grpc_channel_destroy(c_channel_);\n  if (callback_cq_ != nullptr) {\n    callback_cq_->Shutdown();\n  }\n}\n\nnamespace {\n\ngrpc::string GetChannelInfoField(grpc_channel* channel,\n                                 grpc_channel_info* channel_info,\n                                 char*** channel_info_field) {\n  char* value = nullptr;\n  memset(channel_info, 0, sizeof(*channel_info));\n  *channel_info_field = &value;\n  grpc_channel_get_info(channel, channel_info);\n  if (value == nullptr) return \"\";\n  grpc::string result = value;\n  gpr_free(value);\n  return result;\n}\n\n}  \/\/ namespace\n\ngrpc::string Channel::GetLoadBalancingPolicyName() const {\n  grpc_channel_info channel_info;\n  return GetChannelInfoField(c_channel_, &channel_info,\n                             &channel_info.lb_policy_name);\n}\n\ngrpc::string Channel::GetServiceConfigJSON() const {\n  grpc_channel_info channel_info;\n  return GetChannelInfoField(c_channel_, &channel_info,\n                             &channel_info.service_config_json);\n}\n\nnamespace experimental {\n\nvoid ChannelResetConnectionBackoff(Channel* channel) {\n  grpc_channel_reset_connect_backoff(channel->c_channel_);\n}\n\n}  \/\/ namespace experimental\n\ninternal::Call Channel::CreateCall(const internal::RpcMethod& method,\n                                   ClientContext* context,\n                                   CompletionQueue* cq) {\n  const bool kRegistered = method.channel_tag() && context->authority().empty();\n  grpc_call* c_call = nullptr;\n  if (kRegistered) {\n    c_call = grpc_channel_create_registered_call(\n        c_channel_, context->propagate_from_call_,\n        context->propagation_options_.c_bitmask(), cq->cq(),\n        method.channel_tag(), context->raw_deadline(), nullptr);\n  } else {\n    const string* host_str = nullptr;\n    if (!context->authority().empty()) {\n      host_str = &context->authority_;\n    } else if (!host_.empty()) {\n      host_str = &host_;\n    }\n    grpc_slice method_slice =\n        SliceFromArray(method.name(), strlen(method.name()));\n    grpc_slice host_slice;\n    if (host_str != nullptr) {\n      host_slice = SliceFromCopiedString(*host_str);\n    }\n    c_call = grpc_channel_create_call(\n        c_channel_, context->propagate_from_call_,\n        context->propagation_options_.c_bitmask(), cq->cq(), method_slice,\n        host_str == nullptr ? nullptr : &host_slice, context->raw_deadline(),\n        nullptr);\n    grpc_slice_unref(method_slice);\n    if (host_str != nullptr) {\n      grpc_slice_unref(host_slice);\n    }\n  }\n  grpc_census_call_set_context(c_call, context->census_context());\n  context->set_call(c_call, shared_from_this());\n  return internal::Call(c_call, this, cq);\n}\n\nvoid Channel::PerformOpsOnCall(internal::CallOpSetInterface* ops,\n                               internal::Call* call) {\n  static const size_t MAX_OPS = 8;\n  size_t nops = 0;\n  grpc_op cops[MAX_OPS];\n  ops->FillOps(call->call(), cops, &nops);\n  GPR_ASSERT(GRPC_CALL_OK == grpc_call_start_batch(call->call(), cops, nops,\n                                                   ops->cq_tag(), nullptr));\n}\n\nvoid* Channel::RegisterMethod(const char* method) {\n  return grpc_channel_register_call(\n      c_channel_, method, host_.empty() ? nullptr : host_.c_str(), nullptr);\n}\n\ngrpc_connectivity_state Channel::GetState(bool try_to_connect) {\n  return grpc_channel_check_connectivity_state(c_channel_, try_to_connect);\n}\n\nnamespace {\n\nclass TagSaver final : public internal::CompletionQueueTag {\n public:\n  explicit TagSaver(void* tag) : tag_(tag) {}\n  ~TagSaver() override {}\n  bool FinalizeResult(void** tag, bool* status) override {\n    *tag = tag_;\n    delete this;\n    return true;\n  }\n\n private:\n  void* tag_;\n};\n\n}  \/\/ namespace\n\nvoid Channel::NotifyOnStateChangeImpl(grpc_connectivity_state last_observed,\n                                      gpr_timespec deadline,\n                                      CompletionQueue* cq, void* tag) {\n  TagSaver* tag_saver = new TagSaver(tag);\n  grpc_channel_watch_connectivity_state(c_channel_, last_observed, deadline,\n                                        cq->cq(), tag_saver);\n}\n\nbool Channel::WaitForStateChangeImpl(grpc_connectivity_state last_observed,\n                                     gpr_timespec deadline) {\n  CompletionQueue cq;\n  bool ok = false;\n  void* tag = nullptr;\n  NotifyOnStateChangeImpl(last_observed, deadline, &cq, nullptr);\n  cq.Next(&tag, &ok);\n  GPR_ASSERT(tag == nullptr);\n  return ok;\n}\n\nnamespace {\nclass ShutdownCallback : public grpc_experimental_completion_queue_functor {\n public:\n  ShutdownCallback() { functor_run = &ShutdownCallback::Run; }\n  \/\/ TakeCQ takes ownership of the cq into the shutdown callback\n  \/\/ so that the shutdown callback will be responsible for destroying it\n  void TakeCQ(CompletionQueue* cq) { cq_ = cq; }\n\n  \/\/ The Run function will get invoked by the completion queue library\n  \/\/ when the shutdown is actually complete\n  static void Run(grpc_experimental_completion_queue_functor* cb, int) {\n    auto* callback = static_cast<ShutdownCallback*>(cb);\n    delete callback->cq_;\n    grpc_core::Delete(callback);\n  }\n\n private:\n  CompletionQueue* cq_ = nullptr;\n};\n}  \/\/ namespace\n\nCompletionQueue* Channel::CallbackCQ() {\n  \/\/ TODO(vjpai): Consider using a single global CQ for the default CQ\n  \/\/ if there is no explicit per-channel CQ registered\n  std::lock_guard<std::mutex> l(mu_);\n  if (callback_cq_ == nullptr) {\n    auto* shutdown_callback = grpc_core::New<ShutdownCallback>();\n    callback_cq_ = new CompletionQueue(grpc_completion_queue_attributes{\n        GRPC_CQ_CURRENT_VERSION, GRPC_CQ_CALLBACK, GRPC_CQ_DEFAULT_POLLING,\n        shutdown_callback});\n\n    \/\/ Transfer ownership of the new cq to its own shutdown callback\n    shutdown_callback->TakeCQ(callback_cq_);\n  }\n  return callback_cq_;\n}\n\n}  \/\/ namespace grpc\n<|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 \"base\/winlog.h\"\n#include \"base\/util\/utils.h\"\n#include \"base\/util\/StringBuffer.h\"\n#include \"base\/util\/WString.h\"\n#include \"base\/globalsdef.h\"\n\nUSE_NAMESPACE\n\n#ifdef _WIN32_WCE\n#define FUNAMBOL_HEADER \"Funambol Windows Mobile Client Log\"\n#elif WIN32\n#define FUNAMBOL_HEADER \"Funambol Win32 Client Log\"\n#endif\n\n\nstatic FILE* logFile = NULL;\n\nstatic WString      wlogDir(TEXT(\"\\\\\"));\nstatic StringBuffer logName(LOG_NAME);\nstatic StringBuffer logPath(\"\\\\\");\nstatic WCHAR mutexName[128];\n\nHANDLE winLog::wait() {\n  \n    HANDLE hMutex = CreateMutex(NULL, TRUE, mutexName);\n    switch(GetLastError()) {\n        case ERROR_SUCCESS:\n            break;\n        case ERROR_ALREADY_EXISTS:\n            CloseHandle(hMutex);\n            hMutex = NULL;\n            break;\n        default:\n            {}\n    }    \n    return hMutex;        \n}\n\nvoid winLog::signal(HANDLE hMutex) {\n    CloseHandle(hMutex);\n}\n\nwinLog::winLog(bool resetLog, const char* path, const char* name) {\n\n    setLogPath(path);\n    setLogName(name);\n\n    \/\/ MUST use a wchar_t* logDir to manage correctly international chars.\n    \/\/ If using char* logDir and UTF-8, fopen() is not working correctly and\n    \/\/ will fail to open the log file. (with UTF-8... why?)\n    \/\/ So we use _wfopen() and a wchar_t* logDir.\n    StringBuffer logDir;\n    logDir.sprintf(\"%s\\\\%s\", logPath.c_str(), logName.c_str());\n    WCHAR* tmp = toWideChar(logDir.c_str());\n    wlogDir = tmp;\n    delete [] tmp;\n\n    \/\/\n    \/\/ Test to ensure the log file is writable (only if path is set)\n    \/\/\n    if (path) {\n        logFile = _wfopen(wlogDir.c_str(), TEXT(\"a+\"));\n        if (logFile == NULL) {\n            WCHAR tmp[512];\n            wsprintf(tmp, TEXT(\"Unable to write log file: \\\"%s\\\".\\nPlease check your user's permissions.\"), wlogDir.c_str());\n            MessageBox(NULL, tmp, TEXT(\"Funambol\"), MB_SETFOREGROUND | MB_OK);\n        }\n        else {\n            fclose(logFile);\n\n            if (resetLog) {\n                reset(FUNAMBOL_HEADER);\n            }\n        }\n    }\n}\n\n\nwinLog::~winLog() {\n    if (logFile != NULL) {\n        fclose(logFile);\n    }\n}\n\n\nvoid winLog::setLogPath(const char* configLogPath) {\n\n    if (configLogPath != NULL) {\n        logPath = configLogPath;\n    } else {\n        logPath = \".\";\n    }\n    if (logName.length() > 0){\n        StringBuffer logDir;\n        logDir.sprintf(\"%s\\\\%s\", logPath.c_str(), logName.c_str());\n        WCHAR* tmp = toWideChar(logDir.c_str());\n        wlogDir = tmp;\n        delete [] tmp;\n    }\n}\n\nvoid winLog::setLogName(const char* configLogName) {\n\n    if (configLogName != NULL) {\n        logName = configLogName;\n        wsprintf(mutexName, TEXT(\"%S\"), logName);\n    }\n    else {\n        logName = LOG_NAME;\n    }\n    if (logPath){\n        StringBuffer logDir;\n        logDir.sprintf(\"%s\\\\%s\", logPath.c_str(), logName.c_str());\n        WCHAR* tmp = toWideChar(logDir.c_str());\n        wlogDir = tmp;\n        delete [] tmp;\n    }\n}\n\n\/*\n* return a the time to write into log file. If complete is true, it return\n* the date too, else only hours, minutes, seconds and milliseconds\n*\/\nstatic StringBuffer createCurrentTime(bool complete) {\n\n    SYSTEMTIME sys_time;\n    TIME_ZONE_INFORMATION timezone;\n    GetLocalTime(&sys_time);\n    GetTimeZoneInformation(&timezone);\n\n    StringBuffer ret;\n\n    \/\/ calculate offset from UTC\/GMT in hours:min, positive value\n    \/\/ means east of Greenwich (e.g. CET = GMT +1)\n    char direction = timezone.Bias <= 0 ? '+' : '-';\n    int hours      = abs(timezone.Bias \/ 60) ;\n    int minutes    = abs(timezone.Bias % 60);\n\n    if (complete) {\n        char fmtComplete[] = \"%04d-%02d-%02d %02d:%02d:%02d GMT %c%d:%02d\";\n        ret.sprintf(fmtComplete, sys_time.wYear, sys_time.wMonth, sys_time.wDay,\n                    sys_time.wHour, sys_time.wMinute, sys_time.wSecond,\n                    direction, hours, minutes);\n    } \n    else {\n        char fmt[] = \"%02d:%02d:%02d GMT %c%d:%02d\";\n        ret.sprintf(fmt, sys_time.wHour, sys_time.wMinute, sys_time.wSecond,\n                    direction, hours, minutes);\n    }\n    return ret;\n}\n\n\n\n\nvoid winLog::error(const char*  msg, ...) {\n   HANDLE h = wait();\n   if (!h) return;\n    va_list argList;\n    va_start (argList, msg);\n    printMessage(LOG_ERROR, msg, argList);\n    va_end(argList);\n\n   signal(h);\n}\n\nvoid winLog::info(const char*  msg, ...) {\n    HANDLE h = wait();\n    if (!h) return;\n    if (isLoggable(LOG_LEVEL_INFO)) {\n        va_list argList;\n        va_start (argList, msg);\n        printMessage(LOG_INFO, msg, argList);\n        va_end(argList);\n    }\n    signal(h);\n}\n\nvoid winLog::debug(const char*  msg, ...) {\n    HANDLE h = wait();\n    if (!h) return;\n    if (isLoggable(LOG_LEVEL_DEBUG)) {\n        va_list argList;\n        va_start (argList, msg);\n        printMessage(LOG_DEBUG, msg, argList);\n        va_end(argList);\n    }\n    signal(h);\n}\n\nvoid winLog::developer(const char*  msg, ...) {\n    HANDLE h = wait();\n    if (!h) return;\n    if (isLoggable(LOG_LEVEL_INFO)) {\n        va_list argList;\n        va_start (argList, msg);\n        printMessage(LOG_DEBUG, msg, argList);\n        va_end(argList);\n    }\n    signal(h);\n}\n\n\nvoid winLog::printMessage(const char* level, const char* msg, va_list argList) {\n\n    StringBuffer currentTime = createCurrentTime(false);\n    logFile = _wfopen(wlogDir.c_str(), TEXT(\"a+\"));\n    if (logFile) {\n        fprintf(logFile, \"%s [%s] - \", currentTime.c_str(), level);\n        vfprintf(logFile, msg, argList);\n\t    fprintf(logFile, \"\\n\");\n\t    fclose(logFile);\n    }\n}\n\nvoid winLog::reset(const char* title) {\n    const char *t = (title) ? title : FUNAMBOL_HEADER;\n\n    StringBuffer currentTime = createCurrentTime(true);\n    logFile = _wfopen(wlogDir.c_str(), TEXT(\"w+\"));\n    if (logFile) {\n        fprintf(logFile, \"%s - # %s\\n\\n\", currentTime.c_str(), t);\n        fclose(logFile);\n    }\n}\n\n\nsize_t winLog::getLogSize() {\n    size_t ret = 0;\n\n    logFile = _wfopen(wlogDir.c_str(), TEXT(\"r\"));\n    if (logFile) {\n        ret = fgetsize(logFile);\n        fclose(logFile);\n    }\n    return ret;\n}\n\nLog *Log::logger;\n\nLog &Log::instance() {\n    if (!logger) {\n        logger = new winLog();\n    }\n    return *logger;\n}\n<commit_msg>just added the .c_str(), otherwise it won't work on debug mode<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 \"base\/winlog.h\"\n#include \"base\/util\/utils.h\"\n#include \"base\/util\/StringBuffer.h\"\n#include \"base\/util\/WString.h\"\n#include \"base\/globalsdef.h\"\n\nUSE_NAMESPACE\n\n#ifdef _WIN32_WCE\n#define FUNAMBOL_HEADER \"Funambol Windows Mobile Client Log\"\n#elif WIN32\n#define FUNAMBOL_HEADER \"Funambol Win32 Client Log\"\n#endif\n\n\nstatic FILE* logFile = NULL;\n\nstatic WString      wlogDir(TEXT(\"\\\\\"));\nstatic StringBuffer logName(LOG_NAME);\nstatic StringBuffer logPath(\"\\\\\");\nstatic WCHAR mutexName[128];\n\nHANDLE winLog::wait() {\n  \n    HANDLE hMutex = CreateMutex(NULL, TRUE, mutexName);\n    switch(GetLastError()) {\n        case ERROR_SUCCESS:\n            break;\n        case ERROR_ALREADY_EXISTS:\n            CloseHandle(hMutex);\n            hMutex = NULL;\n            break;\n        default:\n            {}\n    }    \n    return hMutex;        \n}\n\nvoid winLog::signal(HANDLE hMutex) {\n    CloseHandle(hMutex);\n}\n\nwinLog::winLog(bool resetLog, const char* path, const char* name) {\n\n    setLogPath(path);\n    setLogName(name);\n\n    \/\/ MUST use a wchar_t* logDir to manage correctly international chars.\n    \/\/ If using char* logDir and UTF-8, fopen() is not working correctly and\n    \/\/ will fail to open the log file. (with UTF-8... why?)\n    \/\/ So we use _wfopen() and a wchar_t* logDir.\n    StringBuffer logDir;\n    logDir.sprintf(\"%s\\\\%s\", logPath.c_str(), logName.c_str());\n    WCHAR* tmp = toWideChar(logDir.c_str());\n    wlogDir = tmp;\n    delete [] tmp;\n\n    \/\/\n    \/\/ Test to ensure the log file is writable (only if path is set)\n    \/\/\n    if (path) {\n        logFile = _wfopen(wlogDir.c_str(), TEXT(\"a+\"));\n        if (logFile == NULL) {\n            WCHAR tmp[512];\n            wsprintf(tmp, TEXT(\"Unable to write log file: \\\"%s\\\".\\nPlease check your user's permissions.\"), wlogDir.c_str());\n            MessageBox(NULL, tmp, TEXT(\"Funambol\"), MB_SETFOREGROUND | MB_OK);\n        }\n        else {\n            fclose(logFile);\n\n            if (resetLog) {\n                reset(FUNAMBOL_HEADER);\n            }\n        }\n    }\n}\n\n\nwinLog::~winLog() {\n    if (logFile != NULL) {\n        fclose(logFile);\n    }\n}\n\n\nvoid winLog::setLogPath(const char* configLogPath) {\n\n    if (configLogPath != NULL) {\n        logPath = configLogPath;\n    } else {\n        logPath = \".\";\n    }\n    if (logName.length() > 0){\n        StringBuffer logDir;\n        logDir.sprintf(\"%s\\\\%s\", logPath.c_str(), logName.c_str());\n        WCHAR* tmp = toWideChar(logDir.c_str());\n        wlogDir = tmp;\n        delete [] tmp;\n    }\n}\n\nvoid winLog::setLogName(const char* configLogName) {\n\n    if (configLogName != NULL) {\n        logName = configLogName;\n        wsprintf(mutexName, TEXT(\"%S\"), logName.c_str());\n    }\n    else {\n        logName = LOG_NAME;\n    }\n    if (logPath){\n        StringBuffer logDir;\n        logDir.sprintf(\"%s\\\\%s\", logPath.c_str(), logName.c_str());\n        WCHAR* tmp = toWideChar(logDir.c_str());\n        wlogDir = tmp;\n        delete [] tmp;\n    }\n}\n\n\/*\n* return a the time to write into log file. If complete is true, it return\n* the date too, else only hours, minutes, seconds and milliseconds\n*\/\nstatic StringBuffer createCurrentTime(bool complete) {\n\n    SYSTEMTIME sys_time;\n    TIME_ZONE_INFORMATION timezone;\n    GetLocalTime(&sys_time);\n    GetTimeZoneInformation(&timezone);\n\n    StringBuffer ret;\n\n    \/\/ calculate offset from UTC\/GMT in hours:min, positive value\n    \/\/ means east of Greenwich (e.g. CET = GMT +1)\n    char direction = timezone.Bias <= 0 ? '+' : '-';\n    int hours      = abs(timezone.Bias \/ 60) ;\n    int minutes    = abs(timezone.Bias % 60);\n\n    if (complete) {\n        char fmtComplete[] = \"%04d-%02d-%02d %02d:%02d:%02d GMT %c%d:%02d\";\n        ret.sprintf(fmtComplete, sys_time.wYear, sys_time.wMonth, sys_time.wDay,\n                    sys_time.wHour, sys_time.wMinute, sys_time.wSecond,\n                    direction, hours, minutes);\n    } \n    else {\n        char fmt[] = \"%02d:%02d:%02d GMT %c%d:%02d\";\n        ret.sprintf(fmt, sys_time.wHour, sys_time.wMinute, sys_time.wSecond,\n                    direction, hours, minutes);\n    }\n    return ret;\n}\n\n\n\n\nvoid winLog::error(const char*  msg, ...) {\n   HANDLE h = wait();\n   if (!h) return;\n    va_list argList;\n    va_start (argList, msg);\n    printMessage(LOG_ERROR, msg, argList);\n    va_end(argList);\n\n   signal(h);\n}\n\nvoid winLog::info(const char*  msg, ...) {\n    HANDLE h = wait();\n    if (!h) return;\n    if (isLoggable(LOG_LEVEL_INFO)) {\n        va_list argList;\n        va_start (argList, msg);\n        printMessage(LOG_INFO, msg, argList);\n        va_end(argList);\n    }\n    signal(h);\n}\n\nvoid winLog::debug(const char*  msg, ...) {\n    HANDLE h = wait();\n    if (!h) return;\n    if (isLoggable(LOG_LEVEL_DEBUG)) {\n        va_list argList;\n        va_start (argList, msg);\n        printMessage(LOG_DEBUG, msg, argList);\n        va_end(argList);\n    }\n    signal(h);\n}\n\nvoid winLog::developer(const char*  msg, ...) {\n    HANDLE h = wait();\n    if (!h) return;\n    if (isLoggable(LOG_LEVEL_INFO)) {\n        va_list argList;\n        va_start (argList, msg);\n        printMessage(LOG_DEBUG, msg, argList);\n        va_end(argList);\n    }\n    signal(h);\n}\n\n\nvoid winLog::printMessage(const char* level, const char* msg, va_list argList) {\n\n    StringBuffer currentTime = createCurrentTime(false);\n    logFile = _wfopen(wlogDir.c_str(), TEXT(\"a+\"));\n    if (logFile) {\n        fprintf(logFile, \"%s [%s] - \", currentTime.c_str(), level);\n        vfprintf(logFile, msg, argList);\n\t    fprintf(logFile, \"\\n\");\n\t    fclose(logFile);\n    }\n}\n\nvoid winLog::reset(const char* title) {\n    const char *t = (title) ? title : FUNAMBOL_HEADER;\n\n    StringBuffer currentTime = createCurrentTime(true);\n    logFile = _wfopen(wlogDir.c_str(), TEXT(\"w+\"));\n    if (logFile) {\n        fprintf(logFile, \"%s - # %s\\n\\n\", currentTime.c_str(), t);\n        fclose(logFile);\n    }\n}\n\n\nsize_t winLog::getLogSize() {\n    size_t ret = 0;\n\n    logFile = _wfopen(wlogDir.c_str(), TEXT(\"r\"));\n    if (logFile) {\n        ret = fgetsize(logFile);\n        fclose(logFile);\n    }\n    return ret;\n}\n\nLog *Log::logger;\n\nLog &Log::instance() {\n    if (!logger) {\n        logger = new winLog();\n    }\n    return *logger;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"LuaPbIntfImpl.h\"\n\n#include <google\/protobuf\/compiler\/importer.h>  \/\/ for DiskSourceTree\n\n#include <sstream>  \/\/ for ostringstream\n\n\/\/ See CommandLineInterface::Run().\n\nclass ErrorCollector : public google::protobuf::compiler::MultiFileErrorCollector\n{\npublic:\n    void Clear() { m_sError.clear(); }\n    const std::string& GetError() const { return m_sError; }\n\n    \/\/ Only record the last error.\n    void AddError(const std::string & filename,\n        int line, int column, const std::string & message) override\n    {\n        std::ostringstream oss;\n        oss << filename << \":\" << line << \": \" << message;\n        m_sError = oss.str();\n    }\nprivate:\n    std::string m_sError;\n};\n\nLuaPbIntfImpl::LuaPbIntfImpl()\n    : m_pDiskSourceTree(new DiskSourceTree),  \/\/ unique_ptr\n    m_pErrorCollector(new ErrorCollector),  \/\/ unique_ptr\n    m_pImporter(new Importer(m_pDiskSourceTree.get(),  \/\/ unique_ptr\n        m_pErrorCollector.get()))\n{\n}\n\nLuaPbIntfImpl::~LuaPbIntfImpl()\n{\n}\n\n\/\/ e.g. AddProtoPath(\"proto\")\n\/\/ e.g. AddProtoPath(\"d:\/proto\")\nvoid LuaPbIntfImpl::AddProtoPath(const string& sProtoPath)\n{\n    MapPath(\"\", sProtoPath);\n}\n\nvoid LuaPbIntfImpl::MapPath(\n    const string& sVirtualPath,\n    const string& sDiskPath)\n{\n    m_pDiskSourceTree->MapPath(sVirtualPath, sDiskPath);\n}\n\n\/\/ e.g. CompileProtoFile(\"bar\/foo.proto\")\nstd::tuple<bool, std::string>\nLuaPbIntfImpl::CompileProtoFile(const string& sProtoFile)\n{\n    m_pErrorCollector->Clear();\n    const google::protobuf::FileDescriptor* desc =\n        m_pImporter->Import(sProtoFile);\n    if (desc) return std::make_tuple(true, \"\");\n    return std::make_tuple(false, \"Proto file compile error: \"\n        + m_pErrorCollector->GetError());\n}\n\n<commit_msg>Add the current dir as the default proto path.<commit_after>#include \"LuaPbIntfImpl.h\"\n\n#include <google\/protobuf\/compiler\/importer.h>  \/\/ for DiskSourceTree\n\n#include <sstream>  \/\/ for ostringstream\n\n\/\/ See CommandLineInterface::Run().\n\nclass ErrorCollector : public google::protobuf::compiler::MultiFileErrorCollector\n{\npublic:\n    void Clear() { m_sError.clear(); }\n    const std::string& GetError() const { return m_sError; }\n\n    \/\/ Only record the last error.\n    void AddError(const std::string & filename,\n        int line, int column, const std::string & message) override\n    {\n        std::ostringstream oss;\n        oss << filename << \":\" << line << \": \" << message;\n        m_sError = oss.str();\n    }\nprivate:\n    std::string m_sError;\n};\n\nLuaPbIntfImpl::LuaPbIntfImpl()\n    : m_pDiskSourceTree(new DiskSourceTree),  \/\/ unique_ptr\n    m_pErrorCollector(new ErrorCollector),  \/\/ unique_ptr\n    m_pImporter(new Importer(m_pDiskSourceTree.get(),  \/\/ unique_ptr\n        m_pErrorCollector.get()))\n{\n    \/\/ The current dir is the default proto path.\n    AddProtoPath(\"\");\n}\n\nLuaPbIntfImpl::~LuaPbIntfImpl()\n{\n}\n\n\/\/ e.g. AddProtoPath(\"proto\")\n\/\/ e.g. AddProtoPath(\"d:\/proto\")\nvoid LuaPbIntfImpl::AddProtoPath(const string& sProtoPath)\n{\n    MapPath(\"\", sProtoPath);\n}\n\nvoid LuaPbIntfImpl::MapPath(\n    const string& sVirtualPath,\n    const string& sDiskPath)\n{\n    m_pDiskSourceTree->MapPath(sVirtualPath, sDiskPath);\n}\n\n\/\/ e.g. CompileProtoFile(\"bar\/foo.proto\")\nstd::tuple<bool, std::string>\nLuaPbIntfImpl::CompileProtoFile(const string& sProtoFile)\n{\n    m_pErrorCollector->Clear();\n    const google::protobuf::FileDescriptor* desc =\n        m_pImporter->Import(sProtoFile);\n    if (desc) return std::make_tuple(true, \"\");\n    return std::make_tuple(false, \"Proto file compile error: \"\n        + m_pErrorCollector->GetError());\n}\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.6  2000\/02\/06 07:47:33  rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.5  2000\/02\/04 01:49:26  aruna1\n * TreeWalker and NodeIterator changes\n *\n * Revision 1.4  1999\/11\/30 21:16:25  roddey\n * Changes to add the transcode() method to DOMString, which returns a transcoded\n * version (to local code page) of the DOM string contents. And I changed all of the\n * exception 'throw by pointer' to 'throw by value' style.\n *\n * Revision 1.3  1999\/11\/23 01:48:16  rahulj\n * Changed 0L to 0. CC under HPUX is happy now.\n *\n * Revision 1.2  1999\/11\/20 00:56:39  rahulj\n * Source files must end with an un-escaped newline.\n *\n * Revision 1.1.1.1  1999\/11\/09 01:09:15  twl\n * Initial checkin\n *\n * Revision 1.2  1999\/11\/08 20:44:30  rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\/\/ NodeIteratorImpl.cpp: implementation of the NodeIteratorImpl class.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"NodeIteratorImpl.hpp\"\n#include \"DOM_Document.hpp\"\n#include \"DOM_DOMException.hpp\"\n#include \"DocumentImpl.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Construction\/Destruction\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nNodeIteratorImpl::NodeIteratorImpl ()\n: fDetached(false),\n    fNodeFilter(0)\n{\n}\t\n\nNodeIteratorImpl::~NodeIteratorImpl ()\n{\n\tfDetached = false;\n}\n\n\nvoid NodeIteratorImpl::detach ()\n{\n\tfDetached = true;\n}\n\n\nNodeIteratorImpl::NodeIteratorImpl (\n                                    DOM_Node root, \n                                    unsigned long whatToShow, \n                                    DOM_NodeFilter* nodeFilter,\n                                    bool expandEntityRef)\n:   fDetached(false),\n    fRoot(root),\n    fCurrentNode(0),\n    fWhatToShow(whatToShow),\n    fNodeFilter(nodeFilter),\n    fForward(true),\n    fExpandEntityReferences(expandEntityRef)\n{\n\t\n}\n\n\nNodeIteratorImpl::NodeIteratorImpl ( const NodeIteratorImpl& toCopy)\n    :   fDetached(toCopy.fDetached),\n    fRoot(toCopy.fRoot),\n    fCurrentNode(toCopy.fCurrentNode),\n    fWhatToShow(toCopy.fWhatToShow),\n    fNodeFilter(toCopy.fNodeFilter),\n    fForward(toCopy.fForward),\n    fExpandEntityReferences(toCopy.fExpandEntityReferences)\n{\n}\n\n\nNodeIteratorImpl& NodeIteratorImpl::operator= (const NodeIteratorImpl& other) {\n    fRoot                   = other.fRoot;\n    fCurrentNode            = other.fRoot;\n    fWhatToShow             = other.fWhatToShow;\n    fNodeFilter             = other.fNodeFilter;\n    fForward                = other.fForward;\n\tfDetached               = other.fDetached;\n    fExpandEntityReferences = other.fExpandEntityReferences;\n    return *this;\n}\n\n\n\n\/\/ Implementation Note: Note that the iterator looks at whatToShow\n\/\/ and filter values at each call, and therefore one _could_ add\n\/\/ setters for these values and alter them while iterating!\n\n\/** Return the whatToShow value *\/\n\nunsigned long NodeIteratorImpl::getWhatToShow () {\n    return fWhatToShow;\n}\n\n\n\/** Return the filter *\/\n\nDOM_NodeFilter* NodeIteratorImpl::getFilter () {\n    return fNodeFilter;\n}\n\n\/** Get the expandEntity reference flag. *\/\nbool NodeIteratorImpl::getExpandEntityReferences()\n{\n    return fExpandEntityReferences;\n}\n\n\/** Return the next DOM_Node in the Iterator. The node is the next node in\n *  depth-first order which also passes the filter, and whatToShow.\n *  A null return means either that\n *\/\n\nDOM_Node NodeIteratorImpl::nextNode () {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n\tDOM_Node result;\n\n    \/\/ if root is null there is no next node.\n    if (fRoot.isNull())\n\t\t\treturn result;\n\n    DOM_Node aNextNode = fCurrentNode;\n    bool accepted = false; \/\/ the next node has not been accepted.\n\n    while (!accepted) {\n\n        \/\/ if last direction is not forward, repeat node.\n        if (!fForward && !aNextNode.isNull()) {\n            \/\/System.out.println(\"nextNode():!fForward:\"+fCurrentNode.getNodeName());\n            aNextNode = fCurrentNode;\n        } else {\n        \/\/ else get the next node via depth-first\n            aNextNode = nextNode(aNextNode, true);\n        }\n\n        fForward = true; \/\/REVIST: should direction be set forward before null check?\n\n        \/\/ nothing in the list. return null.\n        if (aNextNode.isNull())\n\t\t\t\t\treturn result;\n\n        \/\/ does node pass the filters and whatToShow?\n        accepted = acceptNode(aNextNode);\n        if (accepted) {\n            \/\/ if so, then the node is the current node.\n            fCurrentNode = aNextNode;\n            return fCurrentNode;\n\t\t\t\t}\n\n    }\n\n    \/\/ no nodes, or no accepted nodes.\n    return result;\n}\n\n\n\/** Return the previous Node in the Iterator. The node is the next node in\n *  _backwards_ depth-first order which also passes the filter, and whatToShow.\n *\/\n\nDOM_Node NodeIteratorImpl::previousNode () {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\t\t\n\tDOM_Node result;\n\n    \/\/ if the root is null, or the current node is null, return null.\n    if (fRoot.isNull() || fCurrentNode.isNull())\n\t\t\treturn result;\n\n    DOM_Node aPreviousNode = fCurrentNode;\n    bool accepted = false;\n\n    while (!accepted) {\n\n        if (fForward && ! aPreviousNode.isNull()) {\n            \/\/repeat last node.\n            aPreviousNode = fCurrentNode;\n        } else {\n            \/\/ get previous node in backwards depth first order.\n            aPreviousNode = previousNode(aPreviousNode);\n        }\n\n        \/\/ we are going backwards\n        fForward = false;\n\n        \/\/ if the new previous node is null, we're at head or past the root,\n        \/\/ so return null.\n        if (aPreviousNode.isNull())\n\t\t\t\t\treturn result;\n\n        \/\/ check if node passes filters and whatToShow.\n        accepted = acceptNode(aPreviousNode);\n        if (accepted) {\n            \/\/ if accepted, update the current node, and return it.\n            fCurrentNode = aPreviousNode;\n            return fCurrentNode;\n        }\n    }\n    \/\/ there are no nodes?\n    return result;\n}\n\n\n\/** The node is accepted if it passes the whatToShow and the filter. *\/\nbool NodeIteratorImpl::acceptNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    if (fNodeFilter == 0) {\n        return ((fWhatToShow & ((1 << node.getNodeType()) - 1)) != 0);\n    } else {\n        return ((fWhatToShow & ((1 << node.getNodeType()) - 1)) != 0 )\n            && fNodeFilter->acceptNode(node) == DOM_NodeFilter::FILTER_ACCEPT;\n    }\n}\n\n\n\/** Return node, if matches or any parent if matches. *\/\nDOM_Node NodeIteratorImpl::matchNodeOrParent (DOM_Node node) {\n\t\tDOM_Node result;\n\n    for (DOM_Node n = node; n != fRoot; n = n.getParentNode()) {\n        if (node == n) return n;\n    }\n\n    return result;\n}\n\n\n\/** The method nextNode(DOM_Node, bool) returns the next node\n *  from the actual DOM tree.\n *\n *  The bool visitChildren determines whether to visit the children.\n *  The result is the nextNode.\n *\/\n\nDOM_Node NodeIteratorImpl::nextNode (DOM_Node node, bool visitChildren) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    if (node.isNull()) return fRoot;\n\n    DOM_Node result;\n    \/\/ only check children if we visit children.\n    if (visitChildren) {\n        \/\/if hasChildren, return 1st child.\n        if (node.hasChildNodes()) {\n            result = node.getFirstChild();\n            return result;\n        }\n    }\n\n    \/\/ if hasSibling, return sibling\n    result = node.getNextSibling();\n    if (! result.isNull()) return result;\n\n\n    \/\/ return parent's 1st sibling.\n    DOM_Node parent = node.getParentNode();\n    while (!parent.isNull() && parent != fRoot) {\n        result = parent.getNextSibling();\n        if (!result.isNull()) {\n            return result;\n        } else {\n            parent = parent.getParentNode();\n        }\n\n    } \/\/ while (parent != null && parent != fRoot) {\n\n    \/\/ end of list, return null\n\t\tDOM_Node aNull;\n    return aNull;\n}\n\n\n\/** The method previousNode(DOM_Node) returns the previous node\n *  from the actual DOM tree.\n *\/\n\nDOM_Node NodeIteratorImpl::previousNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    DOM_Node result;\n\n    \/\/ if we're at the root, return null.\n    if (node == fRoot)\n\t\t\treturn result;\n\n    \/\/ get sibling\n    result = node.getPreviousSibling();\n    if (result.isNull()) {\n        \/\/if 1st sibling, return parent\n        result = node.getParentNode();\n        return result;\n    }\n\n    \/\/ if sibling has children, keep getting last child of child.\n    if (result.hasChildNodes()) {\n        while (result.hasChildNodes()) {\n            result = result.getLastChild();\n        }\n    }\n\n    return result;\n}\n\n\n\/** Fix-up the iterator on a remove. Called by DOM or otherwise,\n *  before an actual DOM remove.\n *\/\n\nvoid NodeIteratorImpl::removeNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    \/\/ Implementation note: Fix-up means setting the current node properly\n    \/\/ after a remove.\n\n    if (node.isNull())\n\t\t\t\treturn;\n\n    DOM_Node deleted = matchNodeOrParent(node);\n\n    if (deleted.isNull()) return;\n\n    if (fForward) {\n        fCurrentNode = previousNode(deleted);\n    } else\n    \/\/ if (!fForward)\n    {\n        DOM_Node next = nextNode(deleted, false);\n        if (! next.isNull()) {\n            \/\/ normal case: there _are_ nodes following this in the iterator.\n            fCurrentNode = next;\n        } else {\n            \/\/ the last node in the iterator is to be removed,\n            \/\/ so we set the current node to be the previous one.\n            fCurrentNode = previousNode(deleted);\n            fForward = true;\n        }\n\n    }\n\n}\n\n\nvoid NodeIteratorImpl::unreferenced()\n{\n    DOM_Document doc = fRoot.getOwnerDocument();\n    DocumentImpl* impl;\n\n    if (! doc.isNull()) {\n        impl = (DocumentImpl *) doc.fImpl;\n    }\n    else\n        impl = (DocumentImpl *) fRoot.fImpl;\n\n    if (impl->iterators != 0L) {\n        int i;\n        int sz = impl->iterators->size();\n        for (i = 0; i < sz; i++)\n            if (impl->iterators->elementAt(i) == this) {\n                impl->iterators->removeElementAt(i);\n                break;\n            }\n    }\n\n    delete this;\n}\n<commit_msg>nodeIterator previous tracking problem solved<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.7  2000\/02\/08 01:16:18  aruna1\n * nodeIterator previous tracking problem solved\n *\n * Revision 1.6  2000\/02\/06 07:47:33  rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.5  2000\/02\/04 01:49:26  aruna1\n * TreeWalker and NodeIterator changes\n *\n * Revision 1.4  1999\/11\/30 21:16:25  roddey\n * Changes to add the transcode() method to DOMString, which returns a transcoded\n * version (to local code page) of the DOM string contents. And I changed all of the\n * exception 'throw by pointer' to 'throw by value' style.\n *\n * Revision 1.3  1999\/11\/23 01:48:16  rahulj\n * Changed 0L to 0. CC under HPUX is happy now.\n *\n * Revision 1.2  1999\/11\/20 00:56:39  rahulj\n * Source files must end with an un-escaped newline.\n *\n * Revision 1.1.1.1  1999\/11\/09 01:09:15  twl\n * Initial checkin\n *\n * Revision 1.2  1999\/11\/08 20:44:30  rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\/\/ NodeIteratorImpl.cpp: implementation of the NodeIteratorImpl class.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"NodeIteratorImpl.hpp\"\n#include \"DOM_Document.hpp\"\n#include \"DOM_DOMException.hpp\"\n#include \"DocumentImpl.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Construction\/Destruction\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nNodeIteratorImpl::NodeIteratorImpl ()\n: fDetached(false),\n    fNodeFilter(0)\n{\n}\t\n\nNodeIteratorImpl::~NodeIteratorImpl ()\n{\n\tfDetached = false;\n}\n\n\nvoid NodeIteratorImpl::detach ()\n{\n\tfDetached = true;\n}\n\n\nNodeIteratorImpl::NodeIteratorImpl (\n                                    DOM_Node root, \n                                    unsigned long whatToShow, \n                                    DOM_NodeFilter* nodeFilter,\n                                    bool expandEntityRef)\n:   fDetached(false),\n    fRoot(root),\n    fCurrentNode(0),\n    fWhatToShow(whatToShow),\n    fNodeFilter(nodeFilter),\n    fForward(true),\n    fExpandEntityReferences(expandEntityRef)\n{\n\t\n}\n\n\nNodeIteratorImpl::NodeIteratorImpl ( const NodeIteratorImpl& toCopy)\n    :   fDetached(toCopy.fDetached),\n    fRoot(toCopy.fRoot),\n    fCurrentNode(toCopy.fCurrentNode),\n    fWhatToShow(toCopy.fWhatToShow),\n    fNodeFilter(toCopy.fNodeFilter),\n    fForward(toCopy.fForward),\n    fExpandEntityReferences(toCopy.fExpandEntityReferences)\n{\n}\n\n\nNodeIteratorImpl& NodeIteratorImpl::operator= (const NodeIteratorImpl& other) {\n    fRoot                   = other.fRoot;\n    fCurrentNode            = other.fRoot;\n    fWhatToShow             = other.fWhatToShow;\n    fNodeFilter             = other.fNodeFilter;\n    fForward                = other.fForward;\n\tfDetached               = other.fDetached;\n    fExpandEntityReferences = other.fExpandEntityReferences;\n    return *this;\n}\n\n\n\n\/\/ Implementation Note: Note that the iterator looks at whatToShow\n\/\/ and filter values at each call, and therefore one _could_ add\n\/\/ setters for these values and alter them while iterating!\n\n\/** Return the whatToShow value *\/\n\nunsigned long NodeIteratorImpl::getWhatToShow () {\n    return fWhatToShow;\n}\n\n\n\/** Return the filter *\/\n\nDOM_NodeFilter* NodeIteratorImpl::getFilter () {\n    return fNodeFilter;\n}\n\n\/** Get the expandEntity reference flag. *\/\nbool NodeIteratorImpl::getExpandEntityReferences()\n{\n    return fExpandEntityReferences;\n}\n\n\/** Return the next DOM_Node in the Iterator. The node is the next node in\n *  depth-first order which also passes the filter, and whatToShow.\n *  A null return means either that\n *\/\n\nDOM_Node NodeIteratorImpl::nextNode () {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n\tDOM_Node result;\n\n    \/\/ if root is null there is no next node.\n    if (fRoot.isNull())\n\t\t\treturn result;\n\n    DOM_Node aNextNode = fCurrentNode;\n    bool accepted = false; \/\/ the next node has not been accepted.\n\n    while (!accepted) {\n\n        \/\/ if last direction is not forward, repeat node.\n        if (!fForward && !aNextNode.isNull()) {\n            \/\/System.out.println(\"nextNode():!fForward:\"+fCurrentNode.getNodeName());\n            aNextNode = fCurrentNode;\n        } else {\n        \/\/ else get the next node via depth-first\n            aNextNode = nextNode(aNextNode, true);\n        }\n\n        fForward = true; \/\/REVIST: should direction be set forward before null check?\n\n        \/\/ nothing in the list. return null.\n        if (aNextNode.isNull())\n\t\t\t\t\treturn result;\n\n        \/\/ does node pass the filters and whatToShow?\n        accepted = acceptNode(aNextNode);\n        if (accepted) {\n            \/\/ if so, then the node is the current node.\n            fCurrentNode = aNextNode;\n            return fCurrentNode;\n\t\t\t\t}\n\n    }\n\n    \/\/ no nodes, or no accepted nodes.\n    return result;\n}\n\n\n\/** Return the previous Node in the Iterator. The node is the next node in\n *  _backwards_ depth-first order which also passes the filter, and whatToShow.\n *\/\n\nDOM_Node NodeIteratorImpl::previousNode () {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\t\t\n\tDOM_Node result;\n\n    \/\/ if the root is null, or the current node is null, return null.\n    if (fRoot.isNull() || fCurrentNode.isNull())\n\t\t\treturn result;\n\n    DOM_Node aPreviousNode = fCurrentNode;\n    bool accepted = false;\n\n    while (!accepted) {\n        \/\/ we are going backwards\n        fForward = false;\n\n        if (fForward && ! aPreviousNode.isNull()) {\n            \/\/repeat last node.\n            aPreviousNode = fCurrentNode;\n        } else {\n            \/\/ get previous node in backwards depth first order.\n            aPreviousNode = previousNode(aPreviousNode);\n        }\n  \n\n        \/\/ if the new previous node is null, we're at head or past the root,\n        \/\/ so return null.\n        if (aPreviousNode.isNull())\n\t\t\t\t\treturn result;\n\n        \/\/ check if node passes filters and whatToShow.\n        accepted = acceptNode(aPreviousNode);\n        if (accepted) {\n            \/\/ if accepted, update the current node, and return it.\n            fCurrentNode = aPreviousNode;\n            return fCurrentNode;\n        }\n    }\n    \/\/ there are no nodes?\n    return result;\n}\n\n\n\/** The node is accepted if it passes the whatToShow and the filter. *\/\nbool NodeIteratorImpl::acceptNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    if (fNodeFilter == 0) {\n        return ((fWhatToShow & ((1 << node.getNodeType()) - 1)) != 0);\n    } else {\n        return ((fWhatToShow & ((1 << node.getNodeType()) - 1)) != 0 )\n            && fNodeFilter->acceptNode(node) == DOM_NodeFilter::FILTER_ACCEPT;\n    }\n}\n\n\n\/** Return node, if matches or any parent if matches. *\/\nDOM_Node NodeIteratorImpl::matchNodeOrParent (DOM_Node node) {\n\t\tDOM_Node result;\n\n    for (DOM_Node n = node; n != fRoot; n = n.getParentNode()) {\n        if (node == n) return n;\n    }\n\n    return result;\n}\n\n\n\/** The method nextNode(DOM_Node, bool) returns the next node\n *  from the actual DOM tree.\n *\n *  The bool visitChildren determines whether to visit the children.\n *  The result is the nextNode.\n *\/\n\nDOM_Node NodeIteratorImpl::nextNode (DOM_Node node, bool visitChildren) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    if (node.isNull()) return fRoot;\n\n    DOM_Node result;\n    \/\/ only check children if we visit children.\n    if (visitChildren) {\n        \/\/if hasChildren, return 1st child.\n        if (node.hasChildNodes()) {\n            result = node.getFirstChild();\n            return result;\n        }\n    }\n\n    \/\/ if hasSibling, return sibling\n    result = node.getNextSibling();\n    if (! result.isNull()) return result;\n\n\n    \/\/ return parent's 1st sibling.\n    DOM_Node parent = node.getParentNode();\n    while (!parent.isNull() && parent != fRoot) {\n        result = parent.getNextSibling();\n        if (!result.isNull()) {\n            return result;\n        } else {\n            parent = parent.getParentNode();\n        }\n\n    } \/\/ while (parent != null && parent != fRoot) {\n\n    \/\/ end of list, return null\n\t\tDOM_Node aNull;\n    return aNull;\n}\n\n\n\/** The method previousNode(DOM_Node) returns the previous node\n *  from the actual DOM tree.\n *\/\n\nDOM_Node NodeIteratorImpl::previousNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    DOM_Node result;\n\n    \/\/ if we're at the root, return null.\n    if (node == fRoot)\n\t\t\treturn result;\n\n    \/\/ get sibling\n    result = node.getPreviousSibling();\n    if (result.isNull()) {\n        \/\/if 1st sibling, return parent\n        result = node.getParentNode();\n        return result;\n    }\n\n    \/\/ if sibling has children, keep getting last child of child.\n    if (result.hasChildNodes()) {\n        while (result.hasChildNodes()) {\n            result = result.getLastChild();\n        }\n    }\n\n    return result;\n}\n\n\n\/** Fix-up the iterator on a remove. Called by DOM or otherwise,\n *  before an actual DOM remove.\n *\/\n\nvoid NodeIteratorImpl::removeNode (DOM_Node node) {\n\tif (fDetached)\n\t\tthrow DOM_DOMException(DOM_DOMException::INVALID_STATE_ERR, null);\n\n    \/\/ Implementation note: Fix-up means setting the current node properly\n    \/\/ after a remove.\n\n    if (node.isNull())\n\t\t\t\treturn;\n\n    DOM_Node deleted = matchNodeOrParent(node);\n\n    if (deleted.isNull()) return;\n\n    if (fForward) {\n        fCurrentNode = previousNode(deleted);\n    } else\n    \/\/ if (!fForward)\n    {\n        DOM_Node next = nextNode(deleted, false);\n        if (! next.isNull()) {\n            \/\/ normal case: there _are_ nodes following this in the iterator.\n            fCurrentNode = next;\n        } else {\n            \/\/ the last node in the iterator is to be removed,\n            \/\/ so we set the current node to be the previous one.\n            fCurrentNode = previousNode(deleted);\n            fForward = true;\n        }\n\n    }\n\n}\n\n\nvoid NodeIteratorImpl::unreferenced()\n{\n    DOM_Document doc = fRoot.getOwnerDocument();\n    DocumentImpl* impl;\n\n    if (! doc.isNull()) {\n        impl = (DocumentImpl *) doc.fImpl;\n    }\n    else\n        impl = (DocumentImpl *) fRoot.fImpl;\n\n    if (impl->iterators != 0L) {\n        int i;\n        int sz = impl->iterators->size();\n        for (i = 0; i < sz; i++)\n            if (impl->iterators->elementAt(i) == this) {\n                impl->iterators->removeElementAt(i);\n                break;\n            }\n    }\n\n    delete this;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"domain\/mesh_cartesian.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <vector>\n\n#include <deal.II\/base\/point.h>\n#include <deal.II\/grid\/grid_generator.h>\n#include <deal.II\/base\/tensor.h>\n#include <deal.II\/base\/utilities.h>\n\n#include \"problem\/parameter_types.h\"\n\nnamespace bart {\n\nnamespace domain {\n\ntemplate <int dim>\nMeshCartesian<dim>::MeshCartesian(const std::vector<double> spatial_max,\n                                  const std::vector<int> n_cells,\n                                  const std::string material_mapping)\n    : MeshCartesian(spatial_max, n_cells) {\n  ParseMaterialMap(material_mapping);\n}\n\n\ntemplate <int dim>\nMeshCartesian<dim>::MeshCartesian(const std::vector<double> spatial_max,\n                                  const std::vector<int> n_cells) {\n\n  \/\/ Check lengths of spatial max and n_cells\n  AssertThrow(spatial_max.size() == dim,\n              dealii::ExcMessage(\"MeshCartesian argument error, incorrect spatial vector size\"));\n  AssertThrow(n_cells.size() == dim,\n              dealii::ExcMessage(\"MeshCartesian argument error, incorrect number of cells vector size\"));\n  \n  std::copy(n_cells.begin(), n_cells.end(), n_cells_.begin());\n  std::copy(spatial_max.begin(), spatial_max.end(), spatial_max_.begin());\n}\n\ntemplate <int dim>\nvoid MeshCartesian<dim>::FillTriangulation(dealii::Triangulation<dim> &to_fill) {\n  \n  dealii::Point<dim> diagonal;\n  dealii::Point<dim> origin;\n\n  for (int i = 0; i < dim; ++i)\n    diagonal[i] = spatial_max_[i];\n\n  std::vector<unsigned int> number_of_cells{n_cells_.begin(), n_cells_.end()};\n  dealii::GridGenerator::subdivided_hyper_rectangle(to_fill, number_of_cells,\n                                                    origin, diagonal);\n}\n\ntemplate <int dim>\nvoid MeshCartesian<dim>::ParseMaterialMap(std::string material_mapping) {\n  using dealii::Utilities::split_string_list;\n  using dealii::Utilities::string_to_int;\n  using StringVector = std::vector<std::string>;\n\n  StringVector z_blocks = split_string_list(material_mapping, \"\\n\\n\");\n\n  std::reverse(z_blocks.begin(), z_blocks.end());\n\n  for (unsigned k = 0; k < z_blocks.size(); ++k) {\n    StringVector y_line = split_string_list(z_blocks.at(k), \"\\n\");\n    std::reverse(y_line.begin(), y_line.end());\n    for (unsigned j = 0; j < y_line.size(); ++j) {\n      StringVector x_positions = split_string_list(y_line.at(j), \" \");\n      for (unsigned i = 0; i < x_positions.size(); ++i) {\n        std::array<unsigned, 3> index{i, j, k};\n        std::array<int, dim> location;\n        for (int dir = 0; dir < dim; ++dir)\n          location.at(dir) = index.at(dir);\n        material_mapping_[location] = string_to_int(x_positions.at(i));\n      }\n      n_material_cells_.at(0) = x_positions.size();\n    }\n    if (dim > 1)\n      n_material_cells_.at(1) = y_line.size();\n  }\n\n  if (dim > 2)\n    n_material_cells_.at(2) = z_blocks.size();\n}\n\ntemplate <int dim>  \nvoid MeshCartesian<dim>::FillMaterialID(dealii::Triangulation<dim> &to_fill) {\n  for (auto cell = to_fill.begin_active(); cell != to_fill.end(); ++cell) {\n    if (cell->is_locally_owned()) {\n      int material_id = GetMaterialID(cell->center());\n      cell->set_material_id(material_id);\n    }\n  }\n}\n\ntemplate <int dim>\nvoid MeshCartesian<dim>::FillBoundaryID(dealii::Triangulation<dim> &to_fill) {\n  using Boundary = bart::problem::Boundary;\n  int faces_per_cell = dealii::GeometryInfo<dim>::faces_per_cell;\n  double zero_tol = 1.0e-14;\n  \n  for (auto cell = to_fill.begin_active(); cell != to_fill.end(); ++cell) {\n    if (cell->is_locally_owned()) {\n      for (int face_id = 0; face_id < faces_per_cell; ++face_id) {\n        auto face = cell->face(face_id);\n        dealii::Point<dim> face_center = face->center();\n        \/\/TODO(Josh) add 3D support\n        switch (dim) {\n          case 2: {\n            if (std::fabs(face_center[1]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kYMin));\n              break;\n            } else if (std::fabs(face_center[1] - spatial_max_[1]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kYMax));\n              break;\n            }\n            [[fallthrough]];\n          }\n            \/\/ Fall through to check x-direction\n          case 1: {\n            if (std::fabs(face_center[0]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kXMin));\n              break;\n            } else if (std::fabs(face_center[0] - spatial_max_[0]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kXMax));\n              break;\n            }\n            break;\n          }\n          default: {\n            AssertThrow(false,\n                        dealii::ExcMessage(\"Unsupported number of dimensions in FillBoundaryID\"));\n          }\n        }\n      }\n    }\n  }\n}\n  \n\ntemplate <int dim>\nint MeshCartesian<dim>::GetMaterialID(dealii::Point<dim> location) {\n  std::array<double, dim> array_location;\n  for (int i = 0; i < dim; ++i)\n    array_location[i] = location[i];\n  return GetMaterialID(array_location);\n}\n  \ntemplate <int dim>\nint MeshCartesian<dim>::GetMaterialID(std::array<double, dim> location) {\n  std::array<int, dim> relative_location;\n\n  for (int i = 0; i < dim; ++i) {\n    double cell_size = spatial_max_.at(i)\/n_material_cells_.at(i);\n    double cell_location = location.at(i) \/ cell_size;\n    int cell_index = std::floor(cell_location);\n\n    if (static_cast<double>(cell_index) == cell_location && cell_index != 0) {\n      relative_location.at(i) = cell_index - 1;\n    } else {\n      relative_location.at(i) = cell_index;\n    }\n  }\n  \n  return material_mapping_[relative_location];\n}\n\ntemplate class MeshCartesian<1>;\ntemplate class MeshCartesian<2>;\ntemplate class MeshCartesian<3>;\n\n} \/\/ namespace domain\n\n} \/\/ namespace bart \n<commit_msg>added support for filling boundary material ID in 3D<commit_after>#include \"domain\/mesh_cartesian.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <vector>\n\n#include <deal.II\/base\/point.h>\n#include <deal.II\/grid\/grid_generator.h>\n#include <deal.II\/base\/tensor.h>\n#include <deal.II\/base\/utilities.h>\n\n#include \"problem\/parameter_types.h\"\n\nnamespace bart {\n\nnamespace domain {\n\ntemplate <int dim>\nMeshCartesian<dim>::MeshCartesian(const std::vector<double> spatial_max,\n                                  const std::vector<int> n_cells,\n                                  const std::string material_mapping)\n    : MeshCartesian(spatial_max, n_cells) {\n  ParseMaterialMap(material_mapping);\n}\n\n\ntemplate <int dim>\nMeshCartesian<dim>::MeshCartesian(const std::vector<double> spatial_max,\n                                  const std::vector<int> n_cells) {\n\n  \/\/ Check lengths of spatial max and n_cells\n  AssertThrow(spatial_max.size() == dim,\n              dealii::ExcMessage(\"MeshCartesian argument error, incorrect spatial vector size\"));\n  AssertThrow(n_cells.size() == dim,\n              dealii::ExcMessage(\"MeshCartesian argument error, incorrect number of cells vector size\"));\n  \n  std::copy(n_cells.begin(), n_cells.end(), n_cells_.begin());\n  std::copy(spatial_max.begin(), spatial_max.end(), spatial_max_.begin());\n}\n\ntemplate <int dim>\nvoid MeshCartesian<dim>::FillTriangulation(dealii::Triangulation<dim> &to_fill) {\n  \n  dealii::Point<dim> diagonal;\n  dealii::Point<dim> origin;\n\n  for (int i = 0; i < dim; ++i)\n    diagonal[i] = spatial_max_[i];\n\n  std::vector<unsigned int> number_of_cells{n_cells_.begin(), n_cells_.end()};\n  dealii::GridGenerator::subdivided_hyper_rectangle(to_fill, number_of_cells,\n                                                    origin, diagonal);\n}\n\ntemplate <int dim>\nvoid MeshCartesian<dim>::ParseMaterialMap(std::string material_mapping) {\n  using dealii::Utilities::split_string_list;\n  using dealii::Utilities::string_to_int;\n  using StringVector = std::vector<std::string>;\n\n  StringVector z_blocks = split_string_list(material_mapping, \"\\n\\n\");\n\n  std::reverse(z_blocks.begin(), z_blocks.end());\n\n  for (unsigned k = 0; k < z_blocks.size(); ++k) {\n    StringVector y_line = split_string_list(z_blocks.at(k), \"\\n\");\n    std::reverse(y_line.begin(), y_line.end());\n    for (unsigned j = 0; j < y_line.size(); ++j) {\n      StringVector x_positions = split_string_list(y_line.at(j), \" \");\n      for (unsigned i = 0; i < x_positions.size(); ++i) {\n        std::array<unsigned, 3> index{i, j, k};\n        std::array<int, dim> location;\n        for (int dir = 0; dir < dim; ++dir)\n          location.at(dir) = index.at(dir);\n        material_mapping_[location] = string_to_int(x_positions.at(i));\n      }\n      n_material_cells_.at(0) = x_positions.size();\n    }\n    if (dim > 1)\n      n_material_cells_.at(1) = y_line.size();\n  }\n\n  if (dim > 2)\n    n_material_cells_.at(2) = z_blocks.size();\n}\n\ntemplate <int dim>  \nvoid MeshCartesian<dim>::FillMaterialID(dealii::Triangulation<dim> &to_fill) {\n  for (auto cell = to_fill.begin_active(); cell != to_fill.end(); ++cell) {\n    if (cell->is_locally_owned()) {\n      int material_id = GetMaterialID(cell->center());\n      cell->set_material_id(material_id);\n    }\n  }\n}\n\ntemplate <int dim>\nvoid MeshCartesian<dim>::FillBoundaryID(dealii::Triangulation<dim> &to_fill) {\n  using Boundary = bart::problem::Boundary;\n  int faces_per_cell = dealii::GeometryInfo<dim>::faces_per_cell;\n  double zero_tol = 1.0e-14;\n  \n  for (auto cell = to_fill.begin_active(); cell != to_fill.end(); ++cell) {\n    if (cell->is_locally_owned()) {\n      for (int face_id = 0; face_id < faces_per_cell; ++face_id) {\n        auto face = cell->face(face_id);\n        dealii::Point<dim> face_center = face->center();\n        switch (dim) {\n          case 3: {\n            if (std::fabs(face_center[2]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kZMin));\n              break;\n            } else if (std::fabs(face_center[2] - spatial_max_.at(2) < zero_tol)) {\n              face->set_boundary_id(static_cast<int>(Boundary::kZMax));\n              break;\n            }\n            [[fallthrough]];\n          }\n          case 2: {\n            if (std::fabs(face_center[1]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kYMin));\n              break;\n            } else if (std::fabs(face_center[1] - spatial_max_[1]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kYMax));\n              break;\n            }\n            [[fallthrough]];\n          }\n            \/\/ Fall through to check x-direction\n          case 1: {\n            if (std::fabs(face_center[0]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kXMin));\n              break;\n            } else if (std::fabs(face_center[0] - spatial_max_[0]) < zero_tol) {\n              face->set_boundary_id(static_cast<int>(Boundary::kXMax));\n              break;\n            }\n            break;\n          }\n          default: {\n            AssertThrow(false,\n                        dealii::ExcMessage(\"Unsupported number of dimensions in FillBoundaryID\"));\n          }\n        }\n      }\n    }\n  }\n}\n  \n\ntemplate <int dim>\nint MeshCartesian<dim>::GetMaterialID(dealii::Point<dim> location) {\n  std::array<double, dim> array_location;\n  for (int i = 0; i < dim; ++i)\n    array_location[i] = location[i];\n  return GetMaterialID(array_location);\n}\n  \ntemplate <int dim>\nint MeshCartesian<dim>::GetMaterialID(std::array<double, dim> location) {\n  std::array<int, dim> relative_location;\n\n  for (int i = 0; i < dim; ++i) {\n    double cell_size = spatial_max_.at(i)\/n_material_cells_.at(i);\n    double cell_location = location.at(i) \/ cell_size;\n    int cell_index = std::floor(cell_location);\n\n    if (static_cast<double>(cell_index) == cell_location && cell_index != 0) {\n      relative_location.at(i) = cell_index - 1;\n    } else {\n      relative_location.at(i) = cell_index;\n    }\n  }\n  \n  return material_mapping_[relative_location];\n}\n\ntemplate class MeshCartesian<1>;\ntemplate class MeshCartesian<2>;\ntemplate class MeshCartesian<3>;\n\n} \/\/ namespace domain\n\n} \/\/ namespace bart \n<|endoftext|>"}
{"text":"<commit_before>#include <mutex>\n#include <thread>\n#include <ros\/spinner.h>\n\n#include <ensenso\/visualizer.h>\n#include <ensenso\/pcl_headers.h>\n#include <sensor_msgs\/PointCloud2.h>\n\n#include <pcl\/filters\/voxel_grid.h>\n#include <pcl\/surface\/convex_hull.h>\n#include <pcl\/filters\/extract_indices.h>\n#include <pcl\/segmentation\/extract_polygonal_prism_data.h>\n\n\/*Globlal namespaces and aliases*\/\n\/\/ using namespace pathfinder;\nusing PointT \t\t\t= pcl::PointXYZ;\nusing PointCloudT \t\t= pcl::PointCloud<PointT>;\nusing PointCloudTPtr \t= PointCloudT::Ptr;\n\nusing PointN  \t\t\t= pcl::Normal;\nusing PointCloudN \t\t= pcl::PointCloud<PointN>;\nusing PointCloudNPtr  \t= PointCloudN::Ptr;\n\nusing pcl_viz \t\t\t= pcl::visualization::PCLVisualizer;\nusing NormalEstimation \t= pcl::NormalEstimation<PointT, PointN>;\n\n#define OUT(__o__) std::cout<< __o__ << std::endl;\n\nclass Segmentation\n{\nprivate:\n\tbool updateCloud, save, running;\n\tros::NodeHandle nh_;\n \tconst std::string cloudName;\n\tros::Subscriber cloud_sub_;\n\tstd::mutex mutex;\n \tPointCloudT cloud;  \n \tstd::thread cloudDispThread, normalsDispThread;\n \tunsigned long const hardware_concurrency;\n \tros::AsyncSpinner spinner;\n \tboost::shared_ptr<pcl::visualization::PCLVisualizer> viewer, segViewer;\n \tboost::shared_ptr<pcl::visualization::PCLVisualizer> multiViewer;\n \tNormalEstimation normalEstimation;\n\tPointCloudNPtr normals;\n\n\tboost::shared_ptr<visualizer> viz;\n\tstd::vector<std::thread> threads;\t\n\tfloat distThreshold; \/\/distance at which to apply the threshold\n\tfloat zmin, zmax;\t\/\/minimum and maximum distance to extrude the prism object\npublic:\n\tSegmentation(bool running_, ros::NodeHandle nh)\n\t: nh_(nh), updateCloud(false), save(false), running(running_), cloudName(\"Segmentation Cloud\"),\n\thardware_concurrency(std::thread::hardware_concurrency()),\n\tspinner(hardware_concurrency\/2)\n\t{\t\n\t    cloud_sub_ = nh.subscribe(\"ensenso\/cloud\", 10, &Segmentation::cloudCallback, this); \n\t\t    normals = PointCloudNPtr(new PointCloudN());\n\t}\n\n\t~Segmentation()\n\t{\n\t\t\/\/ viewer->close();\n\t}\n\n\tvoid spawn()\n\t{\n\t\tbegin();\n\t\tend();\n\t}\n\n\tvoid begin()\n\t{\n\t\tif(spinner.canStart())\n\t\t{\n\t\t\tspinner.start();\n\t\t\tROS_INFO(\"started spinner\");\n\t\t}\n\n\t\twhile(!updateCloud)\n\t\t{\n\t\t  std::this_thread::sleep_for(std::chrono::milliseconds(1));\n\t\t}\n\n\t\t\/\/spawn the threads\n\t    threads.push_back(std::thread(&Segmentation::planeSeg, this));\n\t    threads.push_back(std::thread(&Segmentation::headSeg, this));\n\n\t    std::for_each(threads.begin(), threads.end(), \\\n\t                  std::mem_fn(&std::thread::join)); \n\n\t    \/\/ cloudDispThread = std::thread(&Segmentation::cloudDisp, this);\n\t    normals = PointCloudNPtr (new PointCloudN());\t\n\t}\n\n\tvoid end()\n\t{\n\t  spinner.stop(); \n\t  running = false;\n\t}\n\n\tvoid cloudCallback(const sensor_msgs::PointCloud2ConstPtr& ensensoCloud)\n\t{\n\t\tPointCloudT cloud;\t\n\n\t\tgetCloud(ensensoCloud, cloud);\n\t\t\/\/ getSurfaceNormals(cloud, this->normals);\n\n\t\tstd::lock_guard<std::mutex> lock(mutex);\n\t\tthis->cloud = cloud;\n\t\tupdateCloud = true;\n\t}\n\n\tvoid getCloud(const sensor_msgs::PointCloud2ConstPtr cb_cloud, PointCloudT& pcl_cloud) const\n\t{\n\t\tpcl::PCLPointCloud2 pcl_pc;\n\t\tpcl_conversions::toPCL(*cb_cloud, pcl_pc);\n\t\tpcl::fromPCLPointCloud2(pcl_pc, pcl_cloud);\n\t}\n\n\tvoid cloudDisp() \n\t{\n\t  const PointCloudT& cloud  = this->cloud;    \n\t  PointCloudT::ConstPtr cloud_ptr (&cloud);\n\t  PointCloudNPtr normals(new PointCloudN);\n\t  normals = this->normals;  \n\t  \n\t  pcl::visualization::PointCloudColorHandlerCustom<PointT> color_handler (cloud_ptr, 255, 255, 255);\t\n\t  viz = boost::shared_ptr<visualizer> (new visualizer());\n\n\t  viewer= viz->createViewer();    \n\t  viewer->addPointCloud(cloud_ptr, color_handler, cloudName);\n\t  viewer->addPointCloudNormals<PointT, PointN>(cloud_ptr, normals, 20, 0.03, \"normals\");\n\n\t  for(; running && ros::ok() ;)\n\t  {\n\t    \/*populate the cloud viewer and prepare for publishing*\/\n\t    if(updateCloud)\n\t    {   \n\t      std::lock_guard<std::mutex> lock(mutex); \n\t      updateCloud = false;\n\t      viewer->updatePointCloud(cloud_ptr, cloudName);\n\t      \/\/ viewer->addPointCloudNormals<PointT, PointN>(cloud_ptr, normals, 20, 0.03, \"normals\");\n\t    }\t    \n\t    viewer->spinOnce(10);\n\t  }\n\t  viewer->close();\n\t}\n\n\tvoid getSurfaceNormals(const PointCloudT& cloud, const PointCloudNPtr normals)\n\t{\n\t\tPointCloudT::ConstPtr cloud_ptr (&cloud);\n\t\tnormalEstimation.setInputCloud(cloud_ptr);\n\t\tnormalEstimation.setRadiusSearch(0.03); \/\/use all neighbors in a radius of 3cm.\n\t\t\/\/ use a kd-tree to search for neighbors.\n\t\tpcl::search::KdTree<PointT>::Ptr kdtree(new pcl::search::KdTree<PointT>);\n\t\tnormalEstimation.setSearchMethod(kdtree);\n\n\t\t\/\/ Calculate the normals.\n\t\tnormalEstimation.compute(*normals);\n\t}\n\n\tvoid planeSeg()\n\t{\n\t\t\/\/ Objects for storing the point clouds.\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr cloud(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr plane(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr convexHull(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr objects(new pcl::PointCloud<pcl::PointXYZ>);\n\n\t\t\/\/Get Plane Model\n\t\tpcl::ModelCoefficients::Ptr coefficients (new pcl::ModelCoefficients);\n\t\tpcl::PointIndices::Ptr inliers (new pcl::PointIndices);\n\t\t\/\/ Create the segmentation object\n\t\tpcl::SACSegmentation<PointT> seg;\n\t\t\/\/ Optional\n\t\tseg.setOptimizeCoefficients (true);\n\t\t\/*Set the maximum number of iterations before giving up*\/\n\t\tseg.setMaxIterations(100);\n\t\t\/\/ Mandatory\n\t\tseg.setModelType (pcl::SACMODEL_PLANE); \n\t\tseg.setMethodType (pcl::SAC_RANSAC);\n\t\t\/*set the distance to the model threshold to use*\/\n\t\tdistThreshold = 0.712;\n\t\tseg.setDistanceThreshold (distThreshold);\t\/\/as measured\n\t\t{\n\t\t\tstd::lock_guard<std::mutex> lock(mutex);\n\t\t\t*cloud = this->cloud;\t\t\t\n\t\t\tupdateCloud = false;\t\n\t\t}\n\n\t\tseg.setInputCloud (cloud);\n\t\tseg.segment (*inliers, *coefficients);\n\n\t\tif(inliers->indices.size() == 0)\n\t\t\tROS_INFO(\"Could not find plane in scene\");\n\t\telse\n\t\t{\n\t\t\t\/\/ Copy the points of the plane to a new cloud.\n\t\t\tpcl::ExtractIndices<pcl::PointXYZ> extract;\n\t\t\textract.setInputCloud(cloud);\n\t\t\textract.setIndices(inliers);\n\t\t\textract.filter(*plane);\n\n\t\t\t\/\/retrieve convex hull\n\t\t\tpcl::ConvexHull<PointT> hull;\n\t\t\thull.setInputCloud(plane);\n\n\t\t\t\/\/ensure hull is 2 -d\n\t\t\thull.setDimension(2);\n\t\t\thull.reconstruct(*convexHull);\n\n\t\t\t\/\/redundant check\n\t\t\tif (hull.getDimension() == 2)\n\t\t\t{\n\t\t\t\t\/\/ Prism object.\n\t\t\t\tpcl::ExtractPolygonalPrismData<pcl::PointXYZ> prism;\n\t\t\t\tprism.setInputCloud(cloud);\n\t\t\t\tprism.setInputPlanarHull(convexHull);\n\t\t\t\t\/\/ First parameter: minimum Z value. Set to 0, segments objects lying on the plane (can be negative).\n\t\t\t\t\/\/ Second parameter: maximum Z value, set to 10cm. Tune it according to the height of the objects you expect.\n\t\t\t\t\/\/ prism.setHeightLimits(0.1f, 0.5f);\n\t\t\t\tzmin = 0.2f; zmax = 0.4953f+0.2f;\n\t\t\t\tprism.setHeightLimits(zmin, zmax);\n\t\t\t\tpcl::PointIndices::Ptr objectIndices(new pcl::PointIndices);\n\n\t\t\t\tprism.segment(*objectIndices);\n\n\t\t\t\t\/\/ Get and show all points retrieved by the hull.\n\t\t\t\textract.setIndices(objectIndices);\n\t\t\t\textract.filter(*objects);\n\n\t\t\t\tmultiViewer = boost::shared_ptr<pcl::visualization::PCLVisualizer> (new pcl::visualization::PCLVisualizer (\"Multiple Viewer\"));   \n\t\t\t\tmultiViewer->initCameraParameters ();\n\n\t\t\t\tint v1(0);\n\t\t\t\tmultiViewer->createViewPort(0.0, 0.0, 0.5, 1.0, v1);\n\t\t\t\tmultiViewer->setBackgroundColor (0, 0, 0, v1);\n\t\t\t\tmultiViewer->addText(\"Original Cloud: 0.01\", 10, 10, \"v1 text\", v1);\n\t\t\t\tmultiViewer->addPointCloud(cloud, \"Original Cloud\", v1);\n\n\t\t\t\tint v2(0);\n\t\t\t\tmultiViewer->createViewPort(0.5, 0.0, 1.0, 1.0, v2);\n\t\t\t\tmultiViewer->setBackgroundColor (0.3, 0.3, 0.3, v2);\n\t\t\t\tmultiViewer->addText(\"Segmented Cloud\", 10, 10, \"v2 text\", v2);\n\t\t\t\tmultiViewer->addPointCloud(objects, \"Segmented Cloud\", v2);\n\n\t\t\t\tmultiViewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 3, \"Original Cloud\");\n\t\t\t\tmultiViewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 3, \"Segmented Cloud\");\n\n\t\t\t\twhile (running && ros::ok())\n\t\t\t\t{\n\t\t\t\t\t\/*populate the cloud viewer and prepare for publishing*\/\n\t\t\t\t\tif(updateCloud)\n\t\t\t\t\t{   \n\t\t\t\t\t  std::lock_guard<std::mutex> lock(mutex); \n\t\t\t\t\t  updateCloud = false;\n\t\t\t\t\t  multiViewer->updatePointCloud(cloud, \"Original Cloud\");\n\t\t\t\t\t  multiViewer->updatePointCloud(objects, \"Segmented Cloud\");\n\t\t\t\t\t}\t    \n\t\t\t\t\tmultiViewer->spinOnce(10);\n\t\t\t\t}\n\t\t\t\tmultiViewer->close();\n\t\t\t}\n\t\t\telse\n\t\t\t\tROS_INFO(\"Chosen hull is not planar\");\n\t\t}\n\t}\n\n\tvoid headSeg()\n\t{\n\t\t\/\/ Objects for storing the point clouds.\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr cloud(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr head(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr convexHull(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr objects(new pcl::PointCloud<pcl::PointXYZ>);\n\n\t\t\/\/Get Plane Model\n\t\tpcl::ModelCoefficients::Ptr coefficients (new pcl::ModelCoefficients);\n\t\tpcl::PointIndices::Ptr inliers (new pcl::PointIndices);\n\t\t\/\/set min and max radius for sphere discovery\n\t\tconst double& min_radius = 0.01;\n\t\tconst double& max_radius = 0.03;\n\t\t\/\/ Create the segmentation object\n\t\tpcl::SACSegmentation<PointT> seg;\n\t\t\/\/ Optional\n\t\tseg.setOptimizeCoefficients (true);\n\t\t\/\/ Mandatory\n\t\tseg.setModelType (pcl::SACMODEL_SPHERE); \n\t\tseg.setMethodType (pcl::SAC_RANSAC);\n\t\tseg.setRadiusLimits(min_radius, max_radius);\n\t\t\/\/ seg.setDistanceThreshold (0.01);\n\t\t\/\/set axis along which to search for a model perpendicular to\n\t\tEigen::Vector3f ax;\n\t\tax << 0, 0, 1;\n\t\tseg.setAxis(ax);\n\n\t\t{\n\t\t\t\/\/ mutex.lock();\n\t\t\tstd::lock_guard<std::mutex> lock(mutex);\n\t\t\t*cloud = this->cloud;\t\t\t\n\t\t\tupdateCloud = false;\t\n\t\t}\n\n\t\tseg.setInputCloud (cloud);\n\t\t\/\/inliers: resultant pt indices that support found model\n\t\t\/\/coefficients: resultant model coefficients\n\t\tseg.segment (*inliers, *coefficients);\n\n\t\tif(inliers->indices.size() == 0)\n\t\t\tROS_INFO(\"Could not find sphere in scene\");\n\t\telse\n\t\t{\n\t\t\t\/\/ Copy the points of the spherepcl::extract indices to a new cloud.\n\t\t\tpcl::ExtractIndices<pcl::PointXYZ> extract(true); \/\/init with true will always allow to extract removed indices\n\t\t\textract.setInputCloud(cloud);\n\t\t\textract.setIndices(inliers);\n\t\t\t\/\/the resulting cloud that contains the indices of the head spherical model\n\t\t\textract.filter(*head);\n\n\t\t\t\/\/retrieve convex hull\n\t\t\tpcl::ConvexHull<PointT> hull;\n\t\t\thull.setInputCloud(head);\n\n\t\t\t\/\/ensure hull is 3 -d\n\t\t\thull.setDimension(3);\n\t\t\t\/*compute a convex hull for all points given*\/\n\t\t\thull.reconstruct(*convexHull);\n\t\t\t\/*compute the area volume of the head and output the result\n\t\t\tto console*\/\n\t\t\thull.setComputeAreaVolume(true);\n\n\t\t\t\/\/redundant check\n\t\t\tif (hull.getDimension() == 3)\n\t\t\t{\n\t\t\t\t\/\/ Prism object.\n\t\t\t\tpcl::ExtractPolygonalPrismData<pcl::PointXYZ> prism;\n\t\t\t\tprism.setInputCloud(cloud);\n\t\t\t\tprism.setInputPlanarHull(convexHull);\n\t\t\t\t\/\/ First parameter: minimum Z value. Set to 0, segments objects lying on the plane (can be negative).\n\t\t\t\t\/\/ Second parameter: maximum Z value, set to 50cm. Tune it according to the height of the objects you expect.\n\t\t\t\tprism.setHeightLimits(0.2f, 0.6f);\n\t\t\t\tpcl::PointIndices::Ptr objectIndices(new pcl::PointIndices);\n\n\t\t\t\tprism.segment(*objectIndices);\n\n\t\t\t\t\/\/ Get and show all points retrieved by the hull.\n\t\t\t\textract.setIndices(objectIndices);\n\t\t\t\textract.filter(*objects);\n\n\t\t\t\tmultiViewer = boost::shared_ptr<pcl::visualization::PCLVisualizer> (new pcl::visualization::PCLVisualizer (\"Multiple Viewer\"));   \n\t\t\t\tmultiViewer->initCameraParameters ();\n\n\t\t\t\tint v1(0);\n\t\t\t\tmultiViewer->createViewPort(0.0, 0.0, 0.5, 1.0, v1);\n\t\t\t\tmultiViewer->setBackgroundColor (0, 0, 0, v1);\n\t\t\t\tmultiViewer->addText(\"Original Cloud: 0.01\", 10, 10, \"v1 text\", v1);\n\t\t\t\tmultiViewer->addPointCloud(cloud, \"Original Cloud\", v1);\n\n\t\t\t\tint v2(0);\n\t\t\t\tmultiViewer->createViewPort(0.5, 0.0, 1.0, 1.0, v2);\n\t\t\t\tmultiViewer->setBackgroundColor (0.3, 0.3, 0.3, v2);\n\t\t\t\tmultiViewer->addText(\"Segmented Cloud\", 10, 10, \"v2 text\", v2);\n\t\t\t\tmultiViewer->addPointCloud(objects, \"Segmented Cloud\", v2);\n\n\t\t\t\tmultiViewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 3, \"Original Cloud\");\n\t\t\t\tmultiViewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 3, \"Segmented Cloud\");\n\n\t\t\t\twhile (running && ros::ok())\n\t\t\t\t{\n\t\t\t\t\t\/*populate the cloud viewer and prepare for publishing*\/\n\t\t\t\t\tif(updateCloud)\n\t\t\t\t\t{   \n\t\t\t\t\t  std::lock_guard<std::mutex> lock(mutex); \n\t\t\t\t\t  updateCloud = false;\n\t\t\t\t\t  multiViewer->updatePointCloud(cloud, \"Original Cloud\");\n\t\t\t\t\t  multiViewer->updatePointCloud(objects, \"Segmented Cloud\");\n\t\t\t\t\t}\t    \n\t\t\t\t\tmultiViewer->spinOnce(10);\n\t\t\t\t}\n\t\t\t\tmultiViewer->close();\n\t\t\t}\n\t\t\telse\n\t\t\t\tROS_INFO(\"Chosen hull is not planar\");\n\t\t}\n\t}\n};\n\nint main(int argc, char* argv[])\n{\n\tros::init(argc, argv, \"ensensor_segmentation_node\"); \n\n\tROS_INFO(\"Started node %s\", ros::this_node::getName().c_str());\n\n\tbool running = true;\n\tros::NodeHandle nh;\n\n\tSegmentation seg(running, nh);\n\tseg.spawn();\n\n\tros::shutdown();\n}<commit_msg>plane segmentation working<commit_after>#include <mutex>\n#include <thread>\n#include <ros\/spinner.h>\n\n#include <ensenso\/visualizer.h>\n#include <ensenso\/pcl_headers.h>\n#include <sensor_msgs\/PointCloud2.h>\n\n#include <pcl\/filters\/voxel_grid.h>\n#include <pcl\/surface\/convex_hull.h>\n#include <pcl\/filters\/extract_indices.h>\n#include <pcl\/segmentation\/extract_polygonal_prism_data.h>\n\n\/*Globlal namespaces and aliases*\/\n\/\/ using namespace pathfinder;\nusing PointT \t\t\t= pcl::PointXYZ;\nusing PointCloudT \t\t= pcl::PointCloud<PointT>;\nusing PointCloudTPtr \t= PointCloudT::Ptr;\n\nusing PointN  \t\t\t= pcl::Normal;\nusing PointCloudN \t\t= pcl::PointCloud<PointN>;\nusing PointCloudNPtr  \t= PointCloudN::Ptr;\n\nusing pcl_viz \t\t\t= pcl::visualization::PCLVisualizer;\nusing NormalEstimation \t= pcl::NormalEstimation<PointT, PointN>;\n\n#define OUT(__o__) std::cout<< __o__ << std::endl;\n\nclass Segmentation\n{\nprivate:\n\tbool updateCloud, save, running;\n\tros::NodeHandle nh_;\n \tconst std::string cloudName;\n\tros::Subscriber cloud_sub_;\n\tstd::mutex mutex;\n \tPointCloudT cloud;  \n \tstd::thread cloudDispThread, normalsDispThread;\n \tunsigned long const hardware_concurrency;\n \tros::AsyncSpinner spinner;\n \tboost::shared_ptr<pcl::visualization::PCLVisualizer> viewer, segViewer;\n \tboost::shared_ptr<pcl::visualization::PCLVisualizer> multiViewer;\n \tNormalEstimation normalEstimation;\n\tPointCloudNPtr normals;\n\n\tboost::shared_ptr<visualizer> viz;\n\tstd::vector<std::thread> threads;\t\n\tfloat distThreshold; \/\/distance at which to apply the threshold\n\tfloat zmin, zmax;\t\/\/minimum and maximum distance to extrude the prism object\npublic:\n\tSegmentation(bool running_, ros::NodeHandle nh)\n\t: nh_(nh), updateCloud(false), save(false), running(running_), cloudName(\"Segmentation Cloud\"),\n\thardware_concurrency(std::thread::hardware_concurrency()),\n\tspinner(hardware_concurrency\/2)\n\t{\t\n\t    cloud_sub_ = nh.subscribe(\"ensenso\/cloud\", 10, &Segmentation::cloudCallback, this); \n\t\t    normals = PointCloudNPtr(new PointCloudN());\n\t}\n\n\t~Segmentation()\n\t{\n\t\t\/\/ viewer->close();\n\t}\n\n\tvoid spawn()\n\t{\n\t\tbegin();\n\t\tend();\n\t}\n\n\tvoid begin()\n\t{\n\t\tif(spinner.canStart())\n\t\t{\n\t\t\tspinner.start();\n\t\t\tROS_INFO(\"started spinner\");\n\t\t}\n\n\t\twhile(!updateCloud)\n\t\t{\n\t\t  std::this_thread::sleep_for(std::chrono::milliseconds(1));\n\t\t}\n\n\t\t\/\/spawn the threads\n\t    threads.push_back(std::thread(&Segmentation::planeSeg, this));\n\t    threads.push_back(std::thread(&Segmentation::headSeg, this));\n\n\t    std::for_each(threads.begin(), threads.end(), \\\n\t                  std::mem_fn(&std::thread::join)); \n\n\t    \/\/ cloudDispThread = std::thread(&Segmentation::cloudDisp, this);\n\t    normals = PointCloudNPtr (new PointCloudN());\t\n\t}\n\n\tvoid end()\n\t{\n\t  spinner.stop(); \n\t  running = false;\n\t}\n\n\tvoid cloudCallback(const sensor_msgs::PointCloud2ConstPtr& ensensoCloud)\n\t{\n\t\tPointCloudT cloud;\t\n\n\t\tgetCloud(ensensoCloud, cloud);\n\t\t\/\/ getSurfaceNormals(cloud, this->normals);\n\n\t\tstd::lock_guard<std::mutex> lock(mutex);\n\t\tthis->cloud = cloud;\n\t\tupdateCloud = true;\n\t}\n\n\tvoid getCloud(const sensor_msgs::PointCloud2ConstPtr cb_cloud, PointCloudT& pcl_cloud) const\n\t{\n\t\tpcl::PCLPointCloud2 pcl_pc;\n\t\tpcl_conversions::toPCL(*cb_cloud, pcl_pc);\n\t\tpcl::fromPCLPointCloud2(pcl_pc, pcl_cloud);\n\t}\n\n\tvoid cloudDisp() \n\t{\n\t  const PointCloudT& cloud  = this->cloud;    \n\t  PointCloudT::ConstPtr cloud_ptr (&cloud);\n\t  PointCloudNPtr normals(new PointCloudN);\n\t  normals = this->normals;  \n\t  \n\t  pcl::visualization::PointCloudColorHandlerCustom<PointT> color_handler (cloud_ptr, 255, 255, 255);\t\n\t  viz = boost::shared_ptr<visualizer> (new visualizer());\n\n\t  viewer= viz->createViewer();    \n\t  viewer->addPointCloud(cloud_ptr, color_handler, cloudName);\n\t  viewer->addPointCloudNormals<PointT, PointN>(cloud_ptr, normals, 20, 0.03, \"normals\");\n\n\t  for(; running && ros::ok() ;)\n\t  {\n\t    \/*populate the cloud viewer and prepare for publishing*\/\n\t    if(updateCloud)\n\t    {   \n\t      std::lock_guard<std::mutex> lock(mutex); \n\t      updateCloud = false;\n\t      viewer->updatePointCloud(cloud_ptr, cloudName);\n\t      \/\/ viewer->addPointCloudNormals<PointT, PointN>(cloud_ptr, normals, 20, 0.03, \"normals\");\n\t    }\t    \n\t    viewer->spinOnce(10);\n\t  }\n\t  viewer->close();\n\t}\n\n\tvoid getSurfaceNormals(const PointCloudT& cloud, const PointCloudNPtr normals)\n\t{\n\t\tPointCloudT::ConstPtr cloud_ptr (&cloud);\n\t\tnormalEstimation.setInputCloud(cloud_ptr);\n\t\tnormalEstimation.setRadiusSearch(0.03); \/\/use all neighbors in a radius of 3cm.\n\t\t\/\/ use a kd-tree to search for neighbors.\n\t\tpcl::search::KdTree<PointT>::Ptr kdtree(new pcl::search::KdTree<PointT>);\n\t\tnormalEstimation.setSearchMethod(kdtree);\n\n\t\t\/\/ Calculate the normals.\n\t\tnormalEstimation.compute(*normals);\n\t}\n\n\tvoid planeSeg()\n\t{\n\t\t\/\/ Objects for storing the point clouds.\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr cloud(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr plane(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr convexHull(new pcl::PointCloud<pcl::PointXYZ>);\n\t\tpcl::PointCloud<pcl::PointXYZ>::Ptr objects(new pcl::PointCloud<pcl::PointXYZ>);\n\n\t\t\/\/Get Plane Model\n\t\tpcl::ModelCoefficients::Ptr coefficients (new pcl::ModelCoefficients);\n\t\tpcl::PointIndices::Ptr inliers (new pcl::PointIndices);\n\t\t\/\/ Create the segmentation object\n\t\tpcl::SACSegmentation<PointT> seg;\n\t\t\/\/ Optional\n\t\tseg.setOptimizeCoefficients (true);\n\t\t\/*Set the maximum number of iterations before giving up*\/\n\t\tseg.setMaxIterations(100);\n\t\t\/\/ Mandatory\n\t\tseg.setModelType (pcl::SACMODEL_PLANE); \n\t\tseg.setMethodType (pcl::SAC_RANSAC);\n\t\t\/*set the distance to the model threshold to use*\/\n\t\tdistThreshold = 0.712;\n\t\tseg.setDistanceThreshold (distThreshold);\t\/\/as measured\n\t\t{\n\t\t\tstd::lock_guard<std::mutex> lock(mutex);\n\t\t\t*cloud = this->cloud;\t\t\t\n\t\t\tupdateCloud = false;\t\n\t\t}\n\n\t\tseg.setInputCloud (cloud);\n\t\tseg.segment (*inliers, *coefficients);\n\n\t\tif(inliers->indices.size() == 0)\n\t\t\tROS_INFO(\"Could not find plane in scene\");\n\t\telse\n\t\t{\n\t\t\t\/\/ Copy the points of the plane to a new cloud.\n\t\t\tpcl::ExtractIndices<pcl::PointXYZ> extract;\n\t\t\textract.setInputCloud(cloud);\n\t\t\textract.setIndices(inliers);\n\t\t\textract.filter(*plane);\n\n\t\t\t\/\/retrieve convex hull\n\t\t\tpcl::ConvexHull<PointT> hull;\n\t\t\thull.setInputCloud(plane);\n\n\t\t\t\/\/ensure hull is 2 -d\n\t\t\thull.setDimension(2);\n\t\t\thull.reconstruct(*convexHull);\n\n\t\t\t\/\/redundant check\n\t\t\tif (hull.getDimension() == 2)\n\t\t\t{\n\t\t\t\t\/\/ Prism object.\n\t\t\t\tpcl::ExtractPolygonalPrismData<pcl::PointXYZ> prism;\n\t\t\t\tprism.setInputCloud(cloud);\n\t\t\t\tprism.setInputPlanarHull(convexHull);\n\t\t\t\t\/\/ First parameter: minimum Z value. Set to 0, segments objects lying on the plane (can be negative).\n\t\t\t\t\/\/ Second parameter: maximum Z value, set to 10cm. Tune it according to the height of the objects you expect.\n\t\t\t\t\/\/ prism.setHeightLimits(0.1f, 0.5f);\n\t\t\t\tzmin = 0.2f; zmax = 0.4953f+0.2f;\n\t\t\t\tprism.setHeightLimits(zmin, zmax);\n\t\t\t\tpcl::PointIndices::Ptr objectIndices(new pcl::PointIndices);\n\n\t\t\t\tprism.segment(*objectIndices);\n\n\t\t\t\t\/\/ Get and show all points retrieved by the hull.\n\t\t\t\textract.setIndices(objectIndices);\n\t\t\t\textract.filter(*objects);\n\n\t\t\t\tmultiViewer = boost::shared_ptr<pcl::visualization::PCLVisualizer> (new pcl::visualization::PCLVisualizer (\"Multiple Viewer\"));   \n\t\t\t\tmultiViewer->initCameraParameters ();\n\n\t\t\t\tint v1(0);\n\t\t\t\tmultiViewer->createViewPort(0.0, 0.0, 0.5, 1.0, v1);\n\t\t\t\tmultiViewer->setBackgroundColor (0, 0, 0, v1);\n\t\t\t\tmultiViewer->addText(\"Original Cloud: 0.01\", 10, 10, \"v1 text\", v1);\n\t\t\t\tmultiViewer->addPointCloud(cloud, \"Original Cloud\", v1);\n\n\t\t\t\tint v2(0);\n\t\t\t\tmultiViewer->createViewPort(0.5, 0.0, 1.0, 1.0, v2);\n\t\t\t\tmultiViewer->setBackgroundColor (0.3, 0.3, 0.3, v2);\n\t\t\t\tmultiViewer->addText(\"Segmented Cloud\", 10, 10, \"v2 text\", v2);\n\t\t\t\tmultiViewer->addPointCloud(objects, \"Segmented Cloud\", v2);\n\n\t\t\t\tmultiViewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 3, \"Original Cloud\");\n\t\t\t\tmultiViewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 3, \"Segmented Cloud\");\n\n\t\t\t\twhile (running && ros::ok())\n\t\t\t\t{\n\t\t\t\t\t\/*populate the cloud viewer and prepare for publishing*\/\n\t\t\t\t\tif(updateCloud)\n\t\t\t\t\t{   \n\t\t\t\t\t  std::lock_guard<std::mutex> lock(mutex); \n\t\t\t\t\t  updateCloud = false;\n\t\t\t\t\t  multiViewer->updatePointCloud(cloud, \"Original Cloud\");\n\t\t\t\t\t  multiViewer->updatePointCloud(objects, \"Segmented Cloud\");\n\t\t\t\t\t}\t    \n\t\t\t\t\tmultiViewer->spinOnce(10);\n\t\t\t\t}\n\t\t\t\tmultiViewer->close();\n\t\t\t}\n\t\t\telse\n\t\t\t\tROS_INFO(\"Chosen hull is not planar\");\n\t\t}\n\t}\n};\n\nint main(int argc, char* argv[])\n{\n\tros::init(argc, argv, \"ensensor_segmentation_node\"); \n\n\tROS_INFO(\"Started node %s\", ros::this_node::getName().c_str());\n\n\tbool running = true;\n\tros::NodeHandle nh;\n\n\tSegmentation seg(running, nh);\n\tseg.spawn();\n\n\tros::shutdown();\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2019\n * Joseph Mirabel\n *\n * LAAS-CNRS\n *\n *\/\n\n\/* --------------------------------------------------------------------- *\/\n\/* --- INCLUDE --------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\n\/* --- SOT --- *\/\n\/\/#define VP_DEBUG\n\/\/#define VP_DEBUG_MODE 45\n#include <boost\/mpl\/if.hpp>\n#include <boost\/type_traits\/is_same.hpp>\n\n#include <dynamic-graph\/command-bind.h>\n#include <dynamic-graph\/command-getter.h>\n#include <dynamic-graph\/command-setter.h>\n#include <dynamic-graph\/command.h>\n\n#include <pinocchio\/multibody\/liegroup\/liegroup.hpp>\n\n#include <Eigen\/LU>\n\n#include <sot\/core\/debug.hh>\n#include <sot\/core\/factory.hh>\n#include <sot\/core\/feature-pose.hh>\n\nusing namespace std;\nusing namespace dynamicgraph;\nusing namespace dynamicgraph::sot;\n\ntypedef pinocchio::CartesianProductOperation<\n    pinocchio::VectorSpaceOperationTpl<3, double>,\n    pinocchio::SpecialOrthogonalOperationTpl<3, double> >\n    R3xSO3_t;\ntypedef pinocchio::SpecialEuclideanOperationTpl<3, double> SE3_t;\ntemplate <Representation_t representation> struct LG_t {\n  typedef typename boost::mpl::if_c<representation == SE3Representation, SE3_t,\n                                    R3xSO3_t>::type type;\n};\n\ntypedef FeaturePose<R3xSO3Representation> FeaturePose_t;\ntypedef FeaturePose<SE3Representation> FeaturePoseSE3_t;\ntemplate <> DYNAMICGRAPH_FACTORY_ENTITY_PLUGIN(FeaturePose_t, \"FeaturePose\");\ntemplate <>\nDYNAMICGRAPH_FACTORY_ENTITY_PLUGIN(FeaturePoseSE3_t, \"FeaturePoseSE3\");\n\n\/* --------------------------------------------------------------------- *\/\n\/* --- CLASS ----------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\nstatic const MatrixHomogeneous Id(MatrixHomogeneous::Identity());\n\ntemplate <Representation_t representation>\nFeaturePose<representation>::FeaturePose(const string &pointName)\n    : FeatureAbstract(pointName),\n      oMja(NULL, CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::oMja\"),\n      jaMfa(NULL, CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::jaMfa\"),\n      oMjb(NULL, CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::oMjb\"),\n      jbMfb(NULL, CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::jbMfb\"),\n      jaJja(NULL, CLASS_NAME + \"(\" + name + \")::input(matrix)::jaJja\"),\n      jbJjb(NULL, CLASS_NAME + \"(\" + name + \")::input(matrix)::jbJjb\")\n\n      ,\n      faMfbDes(NULL,\n               CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::faMfbDes\"),\n      faNufafbDes(NULL,\n                  CLASS_NAME + \"(\" + name + \")::input(vector)::faNufafbDes\")\n\n      ,\n      faMfb(\n          boost::bind(&FeaturePose<representation>::computefaMfb, this, _1, _2),\n          oMja << jaMfa << oMjb << jbMfb,\n          CLASS_NAME + \"(\" + name + \")::output(vector7)::q_faMfbDes\"),\n      q_faMfb(boost::bind(&FeaturePose<representation>::computeQfaMfb, this, _1,\n                          _2),\n              faMfb, CLASS_NAME + \"(\" + name + \")::output(vector7)::q_faMfb\"),\n      q_faMfbDes(boost::bind(&FeaturePose<representation>::computeQfaMfbDes,\n                             this, _1, _2),\n                 faMfbDes,\n                 CLASS_NAME + \"(\" + name + \")::output(vector7)::q_faMfbDes\") {\n  oMja.setConstant(Id);\n  jaMfa.setConstant(Id);\n  jbMfb.setConstant(Id);\n  faMfbDes.setConstant(Id);\n  faNufafbDes.setConstant(Vector::Zero(6));\n\n  jacobianSOUT.addDependencies(q_faMfbDes << q_faMfb << jaJja << jbJjb);\n\n  errorSOUT.addDependencies(q_faMfbDes << q_faMfb);\n\n  signalRegistration(oMja << jaMfa << oMjb << jbMfb << jaJja << jbJjb);\n  signalRegistration(errordotSOUT << faMfbDes << faNufafbDes);\n\n  errordotSOUT.setFunction(\n      boost::bind(&FeaturePose<representation>::computeErrorDot, this, _1, _2));\n  errordotSOUT.addDependencies(q_faMfbDes << q_faMfb << faNufafbDes);\n\n  \/\/ Commands\n  \/\/\n  {\n    using namespace dynamicgraph::command;\n    addCommand(\"keep\",\n               makeCommandVoid1(\n                   *this, &FeaturePose<representation>::servoCurrentPosition,\n                   docCommandVoid1(\n                       \"modify the desired position to servo at current pos.\",\n                       \"time\")));\n  }\n}\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\ntemplate <Representation_t representation>\nstatic inline void check(const FeaturePose<representation> &ft) {\n  (void)ft;\n  assert(ft.oMja.isPlugged());\n  assert(ft.jaMfa.isPlugged());\n  assert(ft.oMjb.isPlugged());\n  assert(ft.jbMfb.isPlugged());\n  assert(ft.faMfbDes.isPlugged());\n  assert(ft.faNufafbDes.isPlugged());\n}\n\ntemplate <Representation_t representation>\nunsigned int &FeaturePose<representation>::getDimension(unsigned int &dim,\n                                                        int time) {\n  sotDEBUG(25) << \"# In {\" << endl;\n\n  const Flags &fl = selectionSIN.access(time);\n\n  dim = 0;\n  for (int i = 0; i < 6; ++i)\n    if (fl(i))\n      dim++;\n\n  sotDEBUG(25) << \"# Out }\" << endl;\n  return dim;\n}\n\nvoid toVector(const MatrixHomogeneous &M, Vector7 &v) {\n  v.head<3>() = M.translation();\n  QuaternionMap(v.tail<4>().data()) = M.linear();\n}\n\nVector7 toVector(const MatrixHomogeneous &M) {\n  Vector7 ret;\n  toVector(M, ret);\n  return ret;\n}\n\ntemplate <Representation_t representation>\nMatrix &FeaturePose<representation>::computeJacobian(Matrix &J, int time) {\n  typedef typename LG_t<representation>::type LieGroup_t;\n\n  check(*this);\n\n  q_faMfb.recompute(time);\n  q_faMfbDes.recompute(time);\n\n  const int &dim = dimensionSOUT(time);\n  const Flags &fl = selectionSIN(time);\n\n  const Matrix &_jbJjb = jbJjb(time);\n\n  const MatrixHomogeneous &_jbMfb =\n      (jbMfb.isPlugged() ? jbMfb.accessCopy() : Id);\n\n  const Matrix::Index cJ = _jbJjb.cols();\n  J.resize(dim, cJ);\n\n  MatrixTwist X;\n  Eigen::Matrix<double, 6, 6, Eigen::RowMajor> Jminus;\n\n  buildFrom(_jbMfb.inverse(Eigen::Affine), X);\n  MatrixRotation faRfb = jaMfa.access(time).rotation().transpose() *\n                         oMja.access(time).rotation().transpose() *\n                         oMjb.access(time).rotation() * _jbMfb.rotation();\n  if (boost::is_same<LieGroup_t, R3xSO3_t>::value)\n    X.topRows<3>().applyOnTheLeft(faRfb);\n  LieGroup_t().template dDifference<pinocchio::ARG1>(\n      q_faMfbDes.accessCopy(), q_faMfb.accessCopy(), Jminus);\n\n  \/\/ Contribution of b:\n  \/\/ J = Jminus * X * jbJjb;\n  unsigned int rJ = 0;\n  for (unsigned int r = 0; r < 6; ++r)\n    if (fl(r))\n      J.row(rJ++) = (Jminus * X).row(r) * _jbJjb;\n\n  if (jaJja.isPlugged()) {\n    const Matrix &_jaJja = jaJja(time);\n    const MatrixHomogeneous &_jaMfa =\n                                (jaMfa.isPlugged() ? jaMfa.accessCopy() : Id),\n                            _faMfb = faMfb.accessCopy();\n\n    buildFrom((_jaMfa * _faMfb).inverse(Eigen::Affine), X);\n    if (boost::is_same<LieGroup_t, R3xSO3_t>::value)\n      X.topRows<3>().applyOnTheLeft(faRfb);\n\n    \/\/ J -= (Jminus * X) * jaJja(time);\n    rJ = 0;\n    for (unsigned int r = 0; r < 6; ++r)\n      if (fl(r))\n        J.row(rJ++).noalias() -= (Jminus * X).row(r) * _jaJja;\n  }\n\n  return J;\n}\n\ntemplate <Representation_t representation>\nMatrixHomogeneous &\nFeaturePose<representation>::computefaMfb(MatrixHomogeneous &res, int time) {\n  check(*this);\n\n  res = (oMja(time) * jaMfa(time)).inverse(Eigen::Affine) * oMjb(time) *\n        jbMfb(time);\n  return res;\n}\n\ntemplate <Representation_t representation>\nVector7 &FeaturePose<representation>::computeQfaMfb(Vector7 &res, int time) {\n  check(*this);\n\n  toVector(faMfb(time), res);\n  return res;\n}\n\ntemplate <Representation_t representation>\nVector7 &FeaturePose<representation>::computeQfaMfbDes(Vector7 &res, int time) {\n  check(*this);\n\n  toVector(faMfbDes(time), res);\n  return res;\n}\n\ntemplate <Representation_t representation>\nVector &FeaturePose<representation>::computeError(Vector &error, int time) {\n  typedef typename LG_t<representation>::type LieGroup_t;\n  check(*this);\n\n  const Flags &fl = selectionSIN(time);\n\n  Eigen::Matrix<double, 6, 1> v;\n  LieGroup_t().difference(q_faMfbDes(time), q_faMfb(time), v);\n\n  error.resize(dimensionSOUT(time));\n  unsigned int cursor = 0;\n  for (unsigned int i = 0; i < 6; ++i)\n    if (fl(i))\n      error(cursor++) = v(i);\n\n  return error;\n}\n\n\/\/ This function is responsible of converting the input velocity expressed with\n\/\/ SE(3) convention onto a velocity expressed with the convention of this\n\/\/ feature (R^3xSO(3) or SE(3)), in the right frame.\ntemplate <typename LG_t>\nVector6d convertVelocity(const MatrixHomogeneous &M,\n                         const MatrixHomogeneous &Mdes,\n                         const Vector &faNufafbDes) {\n  (void)M;\n  MatrixTwist X;\n  buildFrom(Mdes.inverse(Eigen::Affine), X);\n  return X * faNufafbDes;\n}\ntemplate <>\nVector6d convertVelocity<R3xSO3_t>(const MatrixHomogeneous &M,\n                                   const MatrixHomogeneous &Mdes,\n                                   const Vector &faNufafbDes) {\n  Vector6d nu;\n  nu.head<3>() =\n      faNufafbDes.head<3>() - M.translation().cross(faNufafbDes.tail<3>());\n  nu.tail<3>() = Mdes.rotation().transpose() * faNufafbDes.tail<3>();\n  return nu;\n}\n\ntemplate <Representation_t representation>\nVector &FeaturePose<representation>::computeErrorDot(Vector &errordot,\n                                                     int time) {\n  typedef typename LG_t<representation>::type LieGroup_t;\n  check(*this);\n\n  errordot.resize(dimensionSOUT(time));\n  const Flags &fl = selectionSIN(time);\n  if (!faNufafbDes.isPlugged()) {\n    errordot.setZero();\n    return errordot;\n  }\n\n  q_faMfb.recompute(time);\n  q_faMfbDes.recompute(time);\n  faNufafbDes.recompute(time);\n\n  const MatrixHomogeneous &_faMfbDes = faMfbDes(time);\n\n  Eigen::Matrix<double, 6, 6, Eigen::RowMajor> Jminus;\n\n  LieGroup_t().template dDifference<pinocchio::ARG0>(\n      q_faMfbDes.accessCopy(), q_faMfb.accessCopy(), Jminus);\n  Vector6d nu = convertVelocity<LieGroup_t>(faMfb(time), _faMfbDes,\n                                            faNufafbDes.accessCopy());\n  unsigned int cursor = 0;\n  for (unsigned int i = 0; i < 6; ++i)\n    if (fl(i))\n      errordot(cursor++) = Jminus.row(i) * nu;\n\n  return errordot;\n}\n\n\/* Modify the value of the reference (sdes) so that it corresponds\n * to the current position. The effect on the servo is to maintain the\n * current position and correct any drift. *\/\ntemplate <Representation_t representation>\nvoid FeaturePose<representation>::servoCurrentPosition(const int &time) {\n  check(*this);\n\n  const MatrixHomogeneous &_oMja = (oMja.isPlugged() ? oMja.access(time) : Id),\n                          _jaMfa =\n                              (jaMfa.isPlugged() ? jaMfa.access(time) : Id),\n                          _oMjb = oMjb.access(time),\n                          _jbMfb =\n                              (jbMfb.isPlugged() ? jbMfb.access(time) : Id);\n  faMfbDes = (_oMja * _jaMfa).inverse(Eigen::Affine) * _oMjb * _jbMfb;\n}\n\nstatic const char *featureNames[] = {\"X \", \"Y \", \"Z \", \"RX\", \"RY\", \"RZ\"};\ntemplate <Representation_t representation>\nvoid FeaturePose<representation>::display(std::ostream &os) const {\n  os << CLASS_NAME << \"<\" << name << \">: (\";\n\n  try {\n    const Flags &fl = selectionSIN.accessCopy();\n    bool first = true;\n    for (int i = 0; i < 6; ++i)\n      if (fl(i)) {\n        if (first) {\n          first = false;\n        } else {\n          os << \",\";\n        }\n        os << featureNames[i];\n      }\n    os << \") \";\n  } catch (ExceptionAbstract e) {\n    os << \" selectSIN not set.\";\n  }\n}\n<commit_msg>[FeaturePose] Fix signal name<commit_after>\/*\n * Copyright 2019\n * Joseph Mirabel\n *\n * LAAS-CNRS\n *\n *\/\n\n\/* --------------------------------------------------------------------- *\/\n\/* --- INCLUDE --------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\n\/* --- SOT --- *\/\n\/\/#define VP_DEBUG\n\/\/#define VP_DEBUG_MODE 45\n#include <boost\/mpl\/if.hpp>\n#include <boost\/type_traits\/is_same.hpp>\n\n#include <dynamic-graph\/command-bind.h>\n#include <dynamic-graph\/command-getter.h>\n#include <dynamic-graph\/command-setter.h>\n#include <dynamic-graph\/command.h>\n\n#include <pinocchio\/multibody\/liegroup\/liegroup.hpp>\n\n#include <Eigen\/LU>\n\n#include <sot\/core\/debug.hh>\n#include <sot\/core\/factory.hh>\n#include <sot\/core\/feature-pose.hh>\n\nusing namespace std;\nusing namespace dynamicgraph;\nusing namespace dynamicgraph::sot;\n\ntypedef pinocchio::CartesianProductOperation<\n    pinocchio::VectorSpaceOperationTpl<3, double>,\n    pinocchio::SpecialOrthogonalOperationTpl<3, double> >\n    R3xSO3_t;\ntypedef pinocchio::SpecialEuclideanOperationTpl<3, double> SE3_t;\ntemplate <Representation_t representation> struct LG_t {\n  typedef typename boost::mpl::if_c<representation == SE3Representation, SE3_t,\n                                    R3xSO3_t>::type type;\n};\n\ntypedef FeaturePose<R3xSO3Representation> FeaturePose_t;\ntypedef FeaturePose<SE3Representation> FeaturePoseSE3_t;\ntemplate <> DYNAMICGRAPH_FACTORY_ENTITY_PLUGIN(FeaturePose_t, \"FeaturePose\");\ntemplate <>\nDYNAMICGRAPH_FACTORY_ENTITY_PLUGIN(FeaturePoseSE3_t, \"FeaturePoseSE3\");\n\n\/* --------------------------------------------------------------------- *\/\n\/* --- CLASS ----------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\nstatic const MatrixHomogeneous Id(MatrixHomogeneous::Identity());\n\ntemplate <Representation_t representation>\nFeaturePose<representation>::FeaturePose(const string &pointName)\n    : FeatureAbstract(pointName),\n      oMja(NULL, CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::oMja\"),\n      jaMfa(NULL, CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::jaMfa\"),\n      oMjb(NULL, CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::oMjb\"),\n      jbMfb(NULL, CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::jbMfb\"),\n      jaJja(NULL, CLASS_NAME + \"(\" + name + \")::input(matrix)::jaJja\"),\n      jbJjb(NULL, CLASS_NAME + \"(\" + name + \")::input(matrix)::jbJjb\")\n\n      ,\n      faMfbDes(NULL,\n               CLASS_NAME + \"(\" + name + \")::input(matrixHomo)::faMfbDes\"),\n      faNufafbDes(NULL,\n                  CLASS_NAME + \"(\" + name + \")::input(vector)::faNufafbDes\")\n\n      ,\n      faMfb(\n          boost::bind(&FeaturePose<representation>::computefaMfb, this, _1, _2),\n          oMja << jaMfa << oMjb << jbMfb,\n          CLASS_NAME + \"(\" + name + \")::output(matrixHomo)::faMfb\"),\n      q_faMfb(boost::bind(&FeaturePose<representation>::computeQfaMfb, this, _1,\n                          _2),\n              faMfb, CLASS_NAME + \"(\" + name + \")::output(vector7)::q_faMfb\"),\n      q_faMfbDes(boost::bind(&FeaturePose<representation>::computeQfaMfbDes,\n                             this, _1, _2),\n                 faMfbDes,\n                 CLASS_NAME + \"(\" + name + \")::output(vector7)::q_faMfbDes\") {\n  oMja.setConstant(Id);\n  jaMfa.setConstant(Id);\n  jbMfb.setConstant(Id);\n  faMfbDes.setConstant(Id);\n  faNufafbDes.setConstant(Vector::Zero(6));\n\n  jacobianSOUT.addDependencies(q_faMfbDes << q_faMfb << jaJja << jbJjb);\n\n  errorSOUT.addDependencies(q_faMfbDes << q_faMfb);\n\n  signalRegistration(oMja << jaMfa << oMjb << jbMfb << jaJja << jbJjb);\n  signalRegistration(faMfb << errordotSOUT << faMfbDes << faNufafbDes);\n\n  errordotSOUT.setFunction(\n      boost::bind(&FeaturePose<representation>::computeErrorDot, this, _1, _2));\n  errordotSOUT.addDependencies(q_faMfbDes << q_faMfb << faNufafbDes);\n\n  \/\/ Commands\n  \/\/\n  {\n    using namespace dynamicgraph::command;\n    addCommand(\"keep\",\n               makeCommandVoid1(\n                   *this, &FeaturePose<representation>::servoCurrentPosition,\n                   docCommandVoid1(\n                       \"modify the desired position to servo at current pos.\",\n                       \"time\")));\n  }\n}\n\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\/* --------------------------------------------------------------------- *\/\n\ntemplate <Representation_t representation>\nstatic inline void check(const FeaturePose<representation> &ft) {\n  (void)ft;\n  assert(ft.oMja.isPlugged());\n  assert(ft.jaMfa.isPlugged());\n  assert(ft.oMjb.isPlugged());\n  assert(ft.jbMfb.isPlugged());\n  assert(ft.faMfbDes.isPlugged());\n  assert(ft.faNufafbDes.isPlugged());\n}\n\ntemplate <Representation_t representation>\nunsigned int &FeaturePose<representation>::getDimension(unsigned int &dim,\n                                                        int time) {\n  sotDEBUG(25) << \"# In {\" << endl;\n\n  const Flags &fl = selectionSIN.access(time);\n\n  dim = 0;\n  for (int i = 0; i < 6; ++i)\n    if (fl(i))\n      dim++;\n\n  sotDEBUG(25) << \"# Out }\" << endl;\n  return dim;\n}\n\nvoid toVector(const MatrixHomogeneous &M, Vector7 &v) {\n  v.head<3>() = M.translation();\n  QuaternionMap(v.tail<4>().data()) = M.linear();\n}\n\nVector7 toVector(const MatrixHomogeneous &M) {\n  Vector7 ret;\n  toVector(M, ret);\n  return ret;\n}\n\ntemplate <Representation_t representation>\nMatrix &FeaturePose<representation>::computeJacobian(Matrix &J, int time) {\n  typedef typename LG_t<representation>::type LieGroup_t;\n\n  check(*this);\n\n  q_faMfb.recompute(time);\n  q_faMfbDes.recompute(time);\n\n  const int &dim = dimensionSOUT(time);\n  const Flags &fl = selectionSIN(time);\n\n  const Matrix &_jbJjb = jbJjb(time);\n\n  const MatrixHomogeneous &_jbMfb =\n      (jbMfb.isPlugged() ? jbMfb.accessCopy() : Id);\n\n  const Matrix::Index cJ = _jbJjb.cols();\n  J.resize(dim, cJ);\n\n  MatrixTwist X;\n  Eigen::Matrix<double, 6, 6, Eigen::RowMajor> Jminus;\n\n  buildFrom(_jbMfb.inverse(Eigen::Affine), X);\n  MatrixRotation faRfb = jaMfa.access(time).rotation().transpose() *\n                         oMja.access(time).rotation().transpose() *\n                         oMjb.access(time).rotation() * _jbMfb.rotation();\n  if (boost::is_same<LieGroup_t, R3xSO3_t>::value)\n    X.topRows<3>().applyOnTheLeft(faRfb);\n  LieGroup_t().template dDifference<pinocchio::ARG1>(\n      q_faMfbDes.accessCopy(), q_faMfb.accessCopy(), Jminus);\n\n  \/\/ Contribution of b:\n  \/\/ J = Jminus * X * jbJjb;\n  unsigned int rJ = 0;\n  for (unsigned int r = 0; r < 6; ++r)\n    if (fl(r))\n      J.row(rJ++) = (Jminus * X).row(r) * _jbJjb;\n\n  if (jaJja.isPlugged()) {\n    const Matrix &_jaJja = jaJja(time);\n    const MatrixHomogeneous &_jaMfa =\n                                (jaMfa.isPlugged() ? jaMfa.accessCopy() : Id),\n                            _faMfb = faMfb.accessCopy();\n\n    buildFrom((_jaMfa * _faMfb).inverse(Eigen::Affine), X);\n    if (boost::is_same<LieGroup_t, R3xSO3_t>::value)\n      X.topRows<3>().applyOnTheLeft(faRfb);\n\n    \/\/ J -= (Jminus * X) * jaJja(time);\n    rJ = 0;\n    for (unsigned int r = 0; r < 6; ++r)\n      if (fl(r))\n        J.row(rJ++).noalias() -= (Jminus * X).row(r) * _jaJja;\n  }\n\n  return J;\n}\n\ntemplate <Representation_t representation>\nMatrixHomogeneous &\nFeaturePose<representation>::computefaMfb(MatrixHomogeneous &res, int time) {\n  check(*this);\n\n  res = (oMja(time) * jaMfa(time)).inverse(Eigen::Affine) * oMjb(time) *\n        jbMfb(time);\n  return res;\n}\n\ntemplate <Representation_t representation>\nVector7 &FeaturePose<representation>::computeQfaMfb(Vector7 &res, int time) {\n  check(*this);\n\n  toVector(faMfb(time), res);\n  return res;\n}\n\ntemplate <Representation_t representation>\nVector7 &FeaturePose<representation>::computeQfaMfbDes(Vector7 &res, int time) {\n  check(*this);\n\n  toVector(faMfbDes(time), res);\n  return res;\n}\n\ntemplate <Representation_t representation>\nVector &FeaturePose<representation>::computeError(Vector &error, int time) {\n  typedef typename LG_t<representation>::type LieGroup_t;\n  check(*this);\n\n  const Flags &fl = selectionSIN(time);\n\n  Eigen::Matrix<double, 6, 1> v;\n  LieGroup_t().difference(q_faMfbDes(time), q_faMfb(time), v);\n\n  error.resize(dimensionSOUT(time));\n  unsigned int cursor = 0;\n  for (unsigned int i = 0; i < 6; ++i)\n    if (fl(i))\n      error(cursor++) = v(i);\n\n  return error;\n}\n\n\/\/ This function is responsible of converting the input velocity expressed with\n\/\/ SE(3) convention onto a velocity expressed with the convention of this\n\/\/ feature (R^3xSO(3) or SE(3)), in the right frame.\ntemplate <typename LG_t>\nVector6d convertVelocity(const MatrixHomogeneous &M,\n                         const MatrixHomogeneous &Mdes,\n                         const Vector &faNufafbDes) {\n  (void)M;\n  MatrixTwist X;\n  buildFrom(Mdes.inverse(Eigen::Affine), X);\n  return X * faNufafbDes;\n}\ntemplate <>\nVector6d convertVelocity<R3xSO3_t>(const MatrixHomogeneous &M,\n                                   const MatrixHomogeneous &Mdes,\n                                   const Vector &faNufafbDes) {\n  Vector6d nu;\n  nu.head<3>() =\n      faNufafbDes.head<3>() - M.translation().cross(faNufafbDes.tail<3>());\n  nu.tail<3>() = Mdes.rotation().transpose() * faNufafbDes.tail<3>();\n  return nu;\n}\n\ntemplate <Representation_t representation>\nVector &FeaturePose<representation>::computeErrorDot(Vector &errordot,\n                                                     int time) {\n  typedef typename LG_t<representation>::type LieGroup_t;\n  check(*this);\n\n  errordot.resize(dimensionSOUT(time));\n  const Flags &fl = selectionSIN(time);\n  if (!faNufafbDes.isPlugged()) {\n    errordot.setZero();\n    return errordot;\n  }\n\n  q_faMfb.recompute(time);\n  q_faMfbDes.recompute(time);\n  faNufafbDes.recompute(time);\n\n  const MatrixHomogeneous &_faMfbDes = faMfbDes(time);\n\n  Eigen::Matrix<double, 6, 6, Eigen::RowMajor> Jminus;\n\n  LieGroup_t().template dDifference<pinocchio::ARG0>(\n      q_faMfbDes.accessCopy(), q_faMfb.accessCopy(), Jminus);\n  Vector6d nu = convertVelocity<LieGroup_t>(faMfb(time), _faMfbDes,\n                                            faNufafbDes.accessCopy());\n  unsigned int cursor = 0;\n  for (unsigned int i = 0; i < 6; ++i)\n    if (fl(i))\n      errordot(cursor++) = Jminus.row(i) * nu;\n\n  return errordot;\n}\n\n\/* Modify the value of the reference (sdes) so that it corresponds\n * to the current position. The effect on the servo is to maintain the\n * current position and correct any drift. *\/\ntemplate <Representation_t representation>\nvoid FeaturePose<representation>::servoCurrentPosition(const int &time) {\n  check(*this);\n\n  const MatrixHomogeneous &_oMja = (oMja.isPlugged() ? oMja.access(time) : Id),\n                          _jaMfa =\n                              (jaMfa.isPlugged() ? jaMfa.access(time) : Id),\n                          _oMjb = oMjb.access(time),\n                          _jbMfb =\n                              (jbMfb.isPlugged() ? jbMfb.access(time) : Id);\n  faMfbDes = (_oMja * _jaMfa).inverse(Eigen::Affine) * _oMjb * _jbMfb;\n}\n\nstatic const char *featureNames[] = {\"X \", \"Y \", \"Z \", \"RX\", \"RY\", \"RZ\"};\ntemplate <Representation_t representation>\nvoid FeaturePose<representation>::display(std::ostream &os) const {\n  os << CLASS_NAME << \"<\" << name << \">: (\";\n\n  try {\n    const Flags &fl = selectionSIN.accessCopy();\n    bool first = true;\n    for (int i = 0; i < 6; ++i)\n      if (fl(i)) {\n        if (first) {\n          first = false;\n        } else {\n          os << \",\";\n        }\n        os << featureNames[i];\n      }\n    os << \") \";\n  } catch (ExceptionAbstract e) {\n    os << \" selectSIN not set.\";\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2017 Massachusetts Institute of Technology\n\n#include <csignal>\n\n#include \"ros\/ros.h\"\n#include \"nodelet\/nodelet.h\"\n\n#include \"global_mapper_ros\/global_mapper_ros.h\"\n\nnamespace global_mapper {\n\nclass GlobalMapperNodelet : public nodelet::Nodelet {\n public:\n  GlobalMapperNodelet() = default;\n  ~GlobalMapperNodelet() = default;\n\n  GlobalMapperNodelet(const GlobalMapperNodelet& rhs) = delete;\n  GlobalMapperNodelet& operator=(const GlobalMapperNodelet& rhs) = delete;\n\n  GlobalMapperNodelet(GlobalMapperNodelet&& rhs) = delete;\n  GlobalMapperNodelet& operator=(GlobalMapperNodelet&& rhs) = delete;\n\n  \/**\n   * We override the default ROS SIGINT handler to set a global variable which\n   * tells the other threads to stop.\n   *\/\n  static void signal_handler(int signal) {\n    printf(\"(svis_ros) SIGINT received\\n\");\n\n    \/\/ Tell other threads to stop.\n    GlobalMapperNodelet::stop_signal_ = 1;\n\n    \/\/ Tell ROS to shutdown nodes.\n    ros::shutdown();\n\n    return;\n  }\n\n  \/\/ sigint\n  static volatile std::sig_atomic_t stop_signal_;\n\n  \/**\n   * \\brief Nodelet initialization.\n   *\n   * Subclasses of nodelet::Nodelet need to override this virtual method.\n   * It takes the place of the nodelet constructor.\n   *\/\n  virtual void onInit() {\n    \/\/ Install signal handler.\n    std::signal(SIGINT, signal_handler);\n\n    \/\/ GlobalMapperRos global_mapper_ros;\n    \/\/ NODELET_INFO(\"Starting loop\");\n    \/\/ global_mapper_ros.Run(stop_signal_);\n\n    return;\n  }\n};\n\nvolatile std::sig_atomic_t stop_signal_ = 0;\n\n}  \/\/ namespace global_mapper\n\n\/\/ Export as a plugin.\n#include <pluginlib\/class_list_macros.h>\nPLUGINLIB_EXPORT_CLASS(global_mapper::GlobalMapperNodelet, nodelet::Nodelet)\n<commit_msg>Fix sigint implementation.<commit_after>\/\/ Copyright 2017 Massachusetts Institute of Technology\n\n#include <csignal>\n\n#include \"ros\/ros.h\"\n#include \"nodelet\/nodelet.h\"\n\n#include \"global_mapper_ros\/global_mapper_ros.h\"\n\nnamespace global_mapper {\n\nclass GlobalMapperNodelet : public nodelet::Nodelet {\n public:\n  GlobalMapperNodelet() = default;\n  ~GlobalMapperNodelet() = default;\n\n  GlobalMapperNodelet(const GlobalMapperNodelet& rhs) = delete;\n  GlobalMapperNodelet& operator=(const GlobalMapperNodelet& rhs) = delete;\n\n  GlobalMapperNodelet(GlobalMapperNodelet&& rhs) = delete;\n  GlobalMapperNodelet& operator=(GlobalMapperNodelet&& rhs) = delete;\n\n  \/**\n   * We override the default ROS SIGINT handler to set a global variable which\n   * tells the other threads to stop.\n   *\/\n  static void signal_handler(int signal) {\n    printf(\"(global_mapper) SIGINT received\\n\");\n\n    \/\/ Tell other threads to stop.\n    GlobalMapperNodelet::stop_signal_ = 1;\n\n    \/\/ Tell ROS to shutdown nodes.\n    ros::shutdown();\n\n    return;\n  }\n\n  \/**\n   * \\brief Nodelet initialization.\n   *\n   * Subclasses of nodelet::Nodelet need to override this virtual method.\n   * It takes the place of the nodelet constructor.\n   *\/\n  virtual void onInit() {\n    \/\/ Install signal handler.\n    std::signal(SIGINT, signal_handler);\n\n    \/\/ GlobalMapperRos global_mapper_ros;\n    \/\/ NODELET_INFO(\"Starting loop\");\n    \/\/ global_mapper_ros.Run(stop_signal_);\n\n    return;\n  }\n\n  \/\/ sigint\n  static volatile std::sig_atomic_t stop_signal_;\n};\n\nvolatile std::sig_atomic_t GlobalMapperNodelet::stop_signal_ = 0;\n\n}  \/\/ namespace global_mapper\n\n\/\/ Export as a plugin.\n#include <pluginlib\/class_list_macros.h>\nPLUGINLIB_EXPORT_CLASS(global_mapper::GlobalMapperNodelet, nodelet::Nodelet)\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BSD 3-Clause License\n\/\/\n\/\/ Copyright (c) 2019, The Regents of the University of California\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 \"scriptWidget.h\"\n\n#include <errno.h>\n#include <unistd.h>\n\n#include <QCoreApplication>\n#include <QHBoxLayout>\n#include <QKeyEvent>\n#include <QTimer>\n#include <QVBoxLayout>\n\n#include \"ord\/OpenRoad.hh\"\n#include \"utl\/Logger.h\"\n#include \"spdlog\/formatter.h\"\n#include \"spdlog\/sinks\/base_sink.h\"\n\nnamespace gui {\n\nScriptWidget::ScriptWidget(QWidget* parent)\n    : QDockWidget(\"Scripting\", parent),\n      output_(new QTextEdit),\n      input_(new TclCmdInputWidget),\n      pauser_(new QPushButton(\"Idle\")),\n      historyPosition_(0)\n{\n  setObjectName(\"scripting\");  \/\/ for settings\n\n  output_->setReadOnly(true);\n  pauser_->setEnabled(false);\n  pauser_->setSizePolicy(QSizePolicy::Minimum, QSizePolicy::Expanding);\n\n  QHBoxLayout* inner_layout = new QHBoxLayout;\n  inner_layout->addWidget(pauser_);\n  inner_layout->addWidget(input_);\n\n  QVBoxLayout* layout = new QVBoxLayout;\n  layout->addWidget(output_, \/* stretch *\/ 1);\n  layout->addLayout(inner_layout);\n\n  QWidget* container = new QWidget;\n  container->setLayout(layout);\n\n  QTimer::singleShot(200, this, &ScriptWidget::setupTcl);\n\n  connect(input_, SIGNAL(completeCommand()), this, SLOT(executeCommand()));\n  connect(this, SIGNAL(commandExecuted(int)), input_, SLOT(commandExecuted(int)));\n  connect(input_, SIGNAL(historyGoBack()), this, SLOT(goBackHistory()));\n  connect(input_, SIGNAL(historyGoForward()), this, SLOT(goForwardHistory()));\n  connect(input_, SIGNAL(textChanged()), this, SLOT(outputChanged()));\n  connect(output_, SIGNAL(textChanged()), this, SLOT(outputChanged()));\n  connect(pauser_, SIGNAL(pressed()), this, SLOT(pauserClicked()));\n\n  setWidget(container);\n}\n\nint channelClose(ClientData instance_data, Tcl_Interp* interp)\n{\n  \/\/ This channel should never be closed\n  return EINVAL;\n}\n\nint ScriptWidget::channelOutput(ClientData instance_data,\n                                const char* buf,\n                                int to_write,\n                                int* error_code)\n{\n  \/\/ Buffer up the output\n  ScriptWidget* widget = (ScriptWidget*) instance_data;\n  widget->logger_->report(std::string(buf, to_write));\n  return to_write;\n}\n\nvoid channelWatch(ClientData instance_data, int mask)\n{\n  \/\/ watch is not supported inside OpenROAD GUI\n}\n\nTcl_ChannelType ScriptWidget::stdout_channel_type_ = {\n    \/\/ Tcl stupidly defines this a non-cost char*\n    ((char*) \"stdout_channel\"),  \/* typeName *\/\n    TCL_CHANNEL_VERSION_2,       \/* version *\/\n    channelClose,                \/* closeProc *\/\n    nullptr,                     \/* inputProc *\/\n    ScriptWidget::channelOutput, \/* outputProc *\/\n    nullptr,                     \/* seekProc *\/\n    nullptr,                     \/* setOptionProc *\/\n    nullptr,                     \/* getOptionProc *\/\n    channelWatch,                \/* watchProc *\/\n    nullptr,                     \/* getHandleProc *\/\n    nullptr,                     \/* close2Proc *\/\n    nullptr,                     \/* blockModeProc *\/\n    nullptr,                     \/* flushProc *\/\n    nullptr,                     \/* handlerProc *\/\n    nullptr,                     \/* wideSeekProc *\/\n    nullptr,                     \/* threadActionProc *\/\n    nullptr                      \/* truncateProc *\/\n};\n\nint ScriptWidget::tclExitHandler(ClientData instance_data,\n                                 Tcl_Interp *interp,\n                                 int argc,\n                                 const char **argv) {\n  ScriptWidget* widget = (ScriptWidget*) instance_data;\n  \/\/ announces exit to Qt\n  emit widget->tclExiting();\n  \/\/ does not matter from here on, since GUI is getting ready exit\n  return TCL_OK;\n}\n\nvoid ScriptWidget::setupTcl()\n{\n  interp_ = Tcl_CreateInterp();\n\n  Tcl_Channel stdout_channel = Tcl_CreateChannel(\n      &stdout_channel_type_, \"stdout\", (ClientData) this, TCL_WRITABLE);\n  if (stdout_channel) {\n    Tcl_SetChannelOption(nullptr, stdout_channel, \"-translation\", \"lf\");\n    Tcl_SetChannelOption(nullptr, stdout_channel, \"-buffering\", \"none\");\n    Tcl_RegisterChannel(interp_, stdout_channel);  \/\/ per man page: some tcl bug\n    Tcl_SetStdChannel(stdout_channel, TCL_STDOUT);\n  }\n\n  \/\/ Overwrite exit to allow Qt to handle exit\n  Tcl_CreateCommand(interp_, \"exit\", ScriptWidget::tclExitHandler, this, nullptr);\n\n  \/\/ Ensures no newlines are present in stdout stream when using logger, but normal behavior in file writing\n  Tcl_Eval(interp_, \"rename puts ::tcl::openroad::puts\");\n  Tcl_Eval(interp_, \"proc puts { args } { if {[llength $args] == 1} { ::tcl::openroad::puts -nonewline {*}$args } else { ::tcl::openroad::puts {*}$args } }\");\n\n  pauser_->setText(\"Running\");\n  pauser_->setStyleSheet(\"background-color: red\");\n  ord::tclAppInit(interp_);\n  pauser_->setText(\"Idle\");\n  pauser_->setStyleSheet(\"\");\n\n  \/\/ TODO: tclAppInit should return the status which we could\n  \/\/ pass to updateOutput\n  addTclResultToOutput(TCL_OK);\n\n  input_->init(interp_);\n}\n\nvoid ScriptWidget::executeCommand()\n{\n  pauser_->setText(\"Running\");\n  pauser_->setStyleSheet(\"background-color: red\");\n  QString command = input_->text();\n\n  \/\/ Show the command that we executed\n  addCommandToOutput(command);\n\n  int return_code = Tcl_Eval(interp_, command.toLatin1().data());\n\n  \/\/ Show its output\n  addTclResultToOutput(return_code);\n\n  if (return_code == TCL_OK) {\n    \/\/ Update history; ignore repeated commands and keep last 100\n    const int history_limit = 100;\n    if (history_.empty() || command != history_.last()) {\n      if (history_.size() == history_limit) {\n        history_.pop_front();\n      }\n\n      history_.append(command);\n    }\n    historyPosition_ = history_.size();\n  }\n\n  pauser_->setText(\"Idle\");\n  pauser_->setStyleSheet(\"\");\n\n  emit commandExecuted(return_code);\n}\n\nvoid ScriptWidget::addCommandToOutput(const QString& cmd)\n{\n  const QString first_line_prefix    = \">>> \";\n  const QString continue_line_prefix = \"... \";\n\n  QString command = first_line_prefix + cmd;\n  command.replace(\"\\n\", \"\\n\" + continue_line_prefix);\n\n  addToOutput(command, cmd_msg_);\n}\n\nvoid ScriptWidget::addTclResultToOutput(int return_code)\n{\n  \/\/ Show the return value color-coded by ok\/err.\n  const char* result = Tcl_GetString(Tcl_GetObjResult(interp_));\n  if (result[0] != '\\0') {\n    addToOutput(result, (return_code == TCL_OK) ? tcl_ok_msg_ : tcl_error_msg_);\n  }\n}\n\nvoid ScriptWidget::addLogToOutput(const QString& text, const QColor& color)\n{\n  addToOutput(text, color);\n}\n\nvoid ScriptWidget::addReportToOutput(const QString& text)\n{\n  addToOutput(text, buffer_msg_);\n}\n\nvoid ScriptWidget::addToOutput(const QString& text, const QColor& color)\n{\n  \/\/ disable updates while added text\n  output_->setUpdatesEnabled(false);\n\n  \/\/ make sure cursor is at the end of the document\n  output_->moveCursor(QTextCursor::End);\n\n  QString output_text = text;\n  if (text.endsWith('\\n')) {\n    \/\/ remove last new line\n    output_text.chop(1);\n  }\n\n  \/\/ set new text color\n  output_->setTextColor(color);\n\n  QStringList output;\n  for (QString& text_line : output_text.split('\\n')) {\n    \/\/ check for line length limits\n    if (text_line.size() > max_output_line_length_) {\n      text_line = text_line.left(max_output_line_length_-3);\n      text_line += \"...\";\n    }\n\n    output.append(text_line);\n  }\n  \/\/ output new text\n  output_->append(output.join(\"\\n\"));\n\n  \/\/ reenable updates to display text\n  output_->setUpdatesEnabled(true);\n\n  \/\/ ensure changes are updated\n  QCoreApplication::processEvents(QEventLoop::ExcludeUserInputEvents);\n}\n\nScriptWidget::~ScriptWidget()\n{\n  \/\/ TODO: I am being lazy and not cleaning up the tcl interpreter.\n  \/\/ We are likely exiting anyways\n}\n\nvoid ScriptWidget::goForwardHistory()\n{\n  if (historyPosition_ < history_.size() - 1) {\n    ++historyPosition_;\n    input_->setText(history_[historyPosition_]);\n  } else if (historyPosition_ == history_.size() - 1) {\n    ++historyPosition_;\n    input_->setText(history_buffer_last_);\n  }\n}\n\nvoid ScriptWidget::goBackHistory()\n{\n  if (historyPosition_ > 0) {\n    if (historyPosition_ == history_.size()) {\n      \/\/ whats in the buffer is the last thing the user was editing\n      history_buffer_last_ = input_->text();\n    }\n    --historyPosition_;\n    input_->setText(history_[historyPosition_]);\n  }\n}\n\nvoid ScriptWidget::readSettings(QSettings* settings)\n{\n  settings->beginGroup(\"scripting\");\n  history_ = settings->value(\"history\").toStringList();\n  historyPosition_ = history_.size();\n\n  input_->readSettings(settings);\n\n  settings->endGroup();\n}\n\nvoid ScriptWidget::writeSettings(QSettings* settings)\n{\n  settings->beginGroup(\"scripting\");\n  settings->setValue(\"history\", history_);\n\n  input_->writeSettings(settings);\n\n  settings->endGroup();\n}\n\nvoid ScriptWidget::pause()\n{\n  QString prior_text = pauser_->text();\n  bool prior_enable = pauser_->isEnabled();\n  QString prior_style = pauser_->styleSheet();\n  pauser_->setText(\"Continue\");\n  pauser_->setStyleSheet(\"background-color: yellow\");\n  pauser_->setEnabled(true);\n  paused_ = true;\n\n  \/\/ Keep processing events until the user continues\n  while (paused_) {\n    QCoreApplication::processEvents(QEventLoop::WaitForMoreEvents);\n  }\n\n  pauser_->setText(prior_text);\n  pauser_->setStyleSheet(prior_style);\n  pauser_->setEnabled(prior_enable);\n\n  \/\/ Make changes visible while command runs\n  QCoreApplication::processEvents(QEventLoop::ExcludeUserInputEvents);\n}\n\nvoid ScriptWidget::pauserClicked()\n{\n  paused_ = false;\n}\n\nvoid ScriptWidget::outputChanged()\n{\n  \/\/ ensure the new output is visible\n  output_->ensureCursorVisible();\n  \/\/ Make changes visible\n  QCoreApplication::processEvents(QEventLoop::ExcludeUserInputEvents);\n}\n\nvoid ScriptWidget::resizeEvent(QResizeEvent* event)\n{\n  input_->setMaximumHeight(event->size().height() - output_->sizeHint().height());\n  QDockWidget::resizeEvent(event);\n}\n\nvoid ScriptWidget::setFont(const QFont& font)\n{\n  QDockWidget::setFont(font);\n  output_->setFont(font);\n  input_->setFont(font);\n}\n\n\/\/ This class is an spdlog sink that writes the messages into the output\n\/\/ area.\ntemplate <typename Mutex>\nclass ScriptWidget::GuiSink : public spdlog::sinks::base_sink<Mutex>\n{\n public:\n  GuiSink(ScriptWidget* widget) : widget_(widget) {}\n\n protected:\n  void sink_it_(const spdlog::details::log_msg& msg) override\n  {\n    \/\/ Convert the msg into a formatted string\n    spdlog::memory_buf_t formatted;\n    this->formatter_->format(msg, formatted);\n    std::string formatted_msg = std::string(formatted.data(), formatted.size());\n\n    if (msg.level == spdlog::level::level_enum::off) {\n      \/\/ this comes from a ->report\n      widget_->addReportToOutput(formatted_msg.c_str());\n    }\n    else {\n      \/\/ select error message color if message level is error or above.\n      const QColor& msg_color = msg.level >= spdlog::level::level_enum::err ? widget_->tcl_error_msg_ : widget_->buffer_msg_;\n\n      widget_->addLogToOutput(formatted_msg.c_str(), msg_color);\n    }\n  }\n\n  void flush_() override {}\n\n private:\n  ScriptWidget* widget_;\n};\n\nvoid ScriptWidget::setLogger(utl::Logger* logger)\n{\n  logger_ = logger;\n  logger->addSink(std::make_shared<GuiSink<std::mutex>>(this));\n}\n\n}  \/\/ namespace gui\n<commit_msg>gui: removing leftover updateEnabled toggles<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BSD 3-Clause License\n\/\/\n\/\/ Copyright (c) 2019, The Regents of the University of California\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 \"scriptWidget.h\"\n\n#include <errno.h>\n#include <unistd.h>\n\n#include <QCoreApplication>\n#include <QHBoxLayout>\n#include <QKeyEvent>\n#include <QTimer>\n#include <QVBoxLayout>\n\n#include \"ord\/OpenRoad.hh\"\n#include \"utl\/Logger.h\"\n#include \"spdlog\/formatter.h\"\n#include \"spdlog\/sinks\/base_sink.h\"\n\nnamespace gui {\n\nScriptWidget::ScriptWidget(QWidget* parent)\n    : QDockWidget(\"Scripting\", parent),\n      output_(new QTextEdit),\n      input_(new TclCmdInputWidget),\n      pauser_(new QPushButton(\"Idle\")),\n      historyPosition_(0)\n{\n  setObjectName(\"scripting\");  \/\/ for settings\n\n  output_->setReadOnly(true);\n  pauser_->setEnabled(false);\n  pauser_->setSizePolicy(QSizePolicy::Minimum, QSizePolicy::Expanding);\n\n  QHBoxLayout* inner_layout = new QHBoxLayout;\n  inner_layout->addWidget(pauser_);\n  inner_layout->addWidget(input_);\n\n  QVBoxLayout* layout = new QVBoxLayout;\n  layout->addWidget(output_, \/* stretch *\/ 1);\n  layout->addLayout(inner_layout);\n\n  QWidget* container = new QWidget;\n  container->setLayout(layout);\n\n  QTimer::singleShot(200, this, &ScriptWidget::setupTcl);\n\n  connect(input_, SIGNAL(completeCommand()), this, SLOT(executeCommand()));\n  connect(this, SIGNAL(commandExecuted(int)), input_, SLOT(commandExecuted(int)));\n  connect(input_, SIGNAL(historyGoBack()), this, SLOT(goBackHistory()));\n  connect(input_, SIGNAL(historyGoForward()), this, SLOT(goForwardHistory()));\n  connect(input_, SIGNAL(textChanged()), this, SLOT(outputChanged()));\n  connect(output_, SIGNAL(textChanged()), this, SLOT(outputChanged()));\n  connect(pauser_, SIGNAL(pressed()), this, SLOT(pauserClicked()));\n\n  setWidget(container);\n}\n\nint channelClose(ClientData instance_data, Tcl_Interp* interp)\n{\n  \/\/ This channel should never be closed\n  return EINVAL;\n}\n\nint ScriptWidget::channelOutput(ClientData instance_data,\n                                const char* buf,\n                                int to_write,\n                                int* error_code)\n{\n  \/\/ Buffer up the output\n  ScriptWidget* widget = (ScriptWidget*) instance_data;\n  widget->logger_->report(std::string(buf, to_write));\n  return to_write;\n}\n\nvoid channelWatch(ClientData instance_data, int mask)\n{\n  \/\/ watch is not supported inside OpenROAD GUI\n}\n\nTcl_ChannelType ScriptWidget::stdout_channel_type_ = {\n    \/\/ Tcl stupidly defines this a non-cost char*\n    ((char*) \"stdout_channel\"),  \/* typeName *\/\n    TCL_CHANNEL_VERSION_2,       \/* version *\/\n    channelClose,                \/* closeProc *\/\n    nullptr,                     \/* inputProc *\/\n    ScriptWidget::channelOutput, \/* outputProc *\/\n    nullptr,                     \/* seekProc *\/\n    nullptr,                     \/* setOptionProc *\/\n    nullptr,                     \/* getOptionProc *\/\n    channelWatch,                \/* watchProc *\/\n    nullptr,                     \/* getHandleProc *\/\n    nullptr,                     \/* close2Proc *\/\n    nullptr,                     \/* blockModeProc *\/\n    nullptr,                     \/* flushProc *\/\n    nullptr,                     \/* handlerProc *\/\n    nullptr,                     \/* wideSeekProc *\/\n    nullptr,                     \/* threadActionProc *\/\n    nullptr                      \/* truncateProc *\/\n};\n\nint ScriptWidget::tclExitHandler(ClientData instance_data,\n                                 Tcl_Interp *interp,\n                                 int argc,\n                                 const char **argv) {\n  ScriptWidget* widget = (ScriptWidget*) instance_data;\n  \/\/ announces exit to Qt\n  emit widget->tclExiting();\n  \/\/ does not matter from here on, since GUI is getting ready exit\n  return TCL_OK;\n}\n\nvoid ScriptWidget::setupTcl()\n{\n  interp_ = Tcl_CreateInterp();\n\n  Tcl_Channel stdout_channel = Tcl_CreateChannel(\n      &stdout_channel_type_, \"stdout\", (ClientData) this, TCL_WRITABLE);\n  if (stdout_channel) {\n    Tcl_SetChannelOption(nullptr, stdout_channel, \"-translation\", \"lf\");\n    Tcl_SetChannelOption(nullptr, stdout_channel, \"-buffering\", \"none\");\n    Tcl_RegisterChannel(interp_, stdout_channel);  \/\/ per man page: some tcl bug\n    Tcl_SetStdChannel(stdout_channel, TCL_STDOUT);\n  }\n\n  \/\/ Overwrite exit to allow Qt to handle exit\n  Tcl_CreateCommand(interp_, \"exit\", ScriptWidget::tclExitHandler, this, nullptr);\n\n  \/\/ Ensures no newlines are present in stdout stream when using logger, but normal behavior in file writing\n  Tcl_Eval(interp_, \"rename puts ::tcl::openroad::puts\");\n  Tcl_Eval(interp_, \"proc puts { args } { if {[llength $args] == 1} { ::tcl::openroad::puts -nonewline {*}$args } else { ::tcl::openroad::puts {*}$args } }\");\n\n  pauser_->setText(\"Running\");\n  pauser_->setStyleSheet(\"background-color: red\");\n  ord::tclAppInit(interp_);\n  pauser_->setText(\"Idle\");\n  pauser_->setStyleSheet(\"\");\n\n  \/\/ TODO: tclAppInit should return the status which we could\n  \/\/ pass to updateOutput\n  addTclResultToOutput(TCL_OK);\n\n  input_->init(interp_);\n}\n\nvoid ScriptWidget::executeCommand()\n{\n  pauser_->setText(\"Running\");\n  pauser_->setStyleSheet(\"background-color: red\");\n  QString command = input_->text();\n\n  \/\/ Show the command that we executed\n  addCommandToOutput(command);\n\n  int return_code = Tcl_Eval(interp_, command.toLatin1().data());\n\n  \/\/ Show its output\n  addTclResultToOutput(return_code);\n\n  if (return_code == TCL_OK) {\n    \/\/ Update history; ignore repeated commands and keep last 100\n    const int history_limit = 100;\n    if (history_.empty() || command != history_.last()) {\n      if (history_.size() == history_limit) {\n        history_.pop_front();\n      }\n\n      history_.append(command);\n    }\n    historyPosition_ = history_.size();\n  }\n\n  pauser_->setText(\"Idle\");\n  pauser_->setStyleSheet(\"\");\n\n  emit commandExecuted(return_code);\n}\n\nvoid ScriptWidget::addCommandToOutput(const QString& cmd)\n{\n  const QString first_line_prefix    = \">>> \";\n  const QString continue_line_prefix = \"... \";\n\n  QString command = first_line_prefix + cmd;\n  command.replace(\"\\n\", \"\\n\" + continue_line_prefix);\n\n  addToOutput(command, cmd_msg_);\n}\n\nvoid ScriptWidget::addTclResultToOutput(int return_code)\n{\n  \/\/ Show the return value color-coded by ok\/err.\n  const char* result = Tcl_GetString(Tcl_GetObjResult(interp_));\n  if (result[0] != '\\0') {\n    addToOutput(result, (return_code == TCL_OK) ? tcl_ok_msg_ : tcl_error_msg_);\n  }\n}\n\nvoid ScriptWidget::addLogToOutput(const QString& text, const QColor& color)\n{\n  addToOutput(text, color);\n}\n\nvoid ScriptWidget::addReportToOutput(const QString& text)\n{\n  addToOutput(text, buffer_msg_);\n}\n\nvoid ScriptWidget::addToOutput(const QString& text, const QColor& color)\n{\n  \/\/ make sure cursor is at the end of the document\n  output_->moveCursor(QTextCursor::End);\n\n  QString output_text = text;\n  if (text.endsWith('\\n')) {\n    \/\/ remove last new line\n    output_text.chop(1);\n  }\n\n  \/\/ set new text color\n  output_->setTextColor(color);\n\n  QStringList output;\n  for (QString& text_line : output_text.split('\\n')) {\n    \/\/ check for line length limits\n    if (text_line.size() > max_output_line_length_) {\n      text_line = text_line.left(max_output_line_length_-3);\n      text_line += \"...\";\n    }\n\n    output.append(text_line);\n  }\n  \/\/ output new text\n  output_->append(output.join(\"\\n\"));\n\n  \/\/ ensure changes are updated\n  QCoreApplication::processEvents(QEventLoop::ExcludeUserInputEvents);\n}\n\nScriptWidget::~ScriptWidget()\n{\n  \/\/ TODO: I am being lazy and not cleaning up the tcl interpreter.\n  \/\/ We are likely exiting anyways\n}\n\nvoid ScriptWidget::goForwardHistory()\n{\n  if (historyPosition_ < history_.size() - 1) {\n    ++historyPosition_;\n    input_->setText(history_[historyPosition_]);\n  } else if (historyPosition_ == history_.size() - 1) {\n    ++historyPosition_;\n    input_->setText(history_buffer_last_);\n  }\n}\n\nvoid ScriptWidget::goBackHistory()\n{\n  if (historyPosition_ > 0) {\n    if (historyPosition_ == history_.size()) {\n      \/\/ whats in the buffer is the last thing the user was editing\n      history_buffer_last_ = input_->text();\n    }\n    --historyPosition_;\n    input_->setText(history_[historyPosition_]);\n  }\n}\n\nvoid ScriptWidget::readSettings(QSettings* settings)\n{\n  settings->beginGroup(\"scripting\");\n  history_ = settings->value(\"history\").toStringList();\n  historyPosition_ = history_.size();\n\n  input_->readSettings(settings);\n\n  settings->endGroup();\n}\n\nvoid ScriptWidget::writeSettings(QSettings* settings)\n{\n  settings->beginGroup(\"scripting\");\n  settings->setValue(\"history\", history_);\n\n  input_->writeSettings(settings);\n\n  settings->endGroup();\n}\n\nvoid ScriptWidget::pause()\n{\n  QString prior_text = pauser_->text();\n  bool prior_enable = pauser_->isEnabled();\n  QString prior_style = pauser_->styleSheet();\n  pauser_->setText(\"Continue\");\n  pauser_->setStyleSheet(\"background-color: yellow\");\n  pauser_->setEnabled(true);\n  paused_ = true;\n\n  \/\/ Keep processing events until the user continues\n  while (paused_) {\n    QCoreApplication::processEvents(QEventLoop::WaitForMoreEvents);\n  }\n\n  pauser_->setText(prior_text);\n  pauser_->setStyleSheet(prior_style);\n  pauser_->setEnabled(prior_enable);\n\n  \/\/ Make changes visible while command runs\n  QCoreApplication::processEvents(QEventLoop::ExcludeUserInputEvents);\n}\n\nvoid ScriptWidget::pauserClicked()\n{\n  paused_ = false;\n}\n\nvoid ScriptWidget::outputChanged()\n{\n  \/\/ ensure the new output is visible\n  output_->ensureCursorVisible();\n  \/\/ Make changes visible\n  QCoreApplication::processEvents(QEventLoop::ExcludeUserInputEvents);\n}\n\nvoid ScriptWidget::resizeEvent(QResizeEvent* event)\n{\n  input_->setMaximumHeight(event->size().height() - output_->sizeHint().height());\n  QDockWidget::resizeEvent(event);\n}\n\nvoid ScriptWidget::setFont(const QFont& font)\n{\n  QDockWidget::setFont(font);\n  output_->setFont(font);\n  input_->setFont(font);\n}\n\n\/\/ This class is an spdlog sink that writes the messages into the output\n\/\/ area.\ntemplate <typename Mutex>\nclass ScriptWidget::GuiSink : public spdlog::sinks::base_sink<Mutex>\n{\n public:\n  GuiSink(ScriptWidget* widget) : widget_(widget) {}\n\n protected:\n  void sink_it_(const spdlog::details::log_msg& msg) override\n  {\n    \/\/ Convert the msg into a formatted string\n    spdlog::memory_buf_t formatted;\n    this->formatter_->format(msg, formatted);\n    std::string formatted_msg = std::string(formatted.data(), formatted.size());\n\n    if (msg.level == spdlog::level::level_enum::off) {\n      \/\/ this comes from a ->report\n      widget_->addReportToOutput(formatted_msg.c_str());\n    }\n    else {\n      \/\/ select error message color if message level is error or above.\n      const QColor& msg_color = msg.level >= spdlog::level::level_enum::err ? widget_->tcl_error_msg_ : widget_->buffer_msg_;\n\n      widget_->addLogToOutput(formatted_msg.c_str(), msg_color);\n    }\n  }\n\n  void flush_() override {}\n\n private:\n  ScriptWidget* widget_;\n};\n\nvoid ScriptWidget::setLogger(utl::Logger* logger)\n{\n  logger_ = logger;\n  logger->addSink(std::make_shared<GuiSink<std::mutex>>(this));\n}\n\n}  \/\/ namespace gui\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * REXI_CI.hpp\n *\n *  Created on: 18 Aug 2017\n *      Author: Martin Schreiber <SchreiberX@gmail.com>\n *\/\n\n#ifndef SRC_INCLUDE_REXI_CI_HPP_\n#define SRC_INCLUDE_REXI_CI_HPP_\n\n#include <sweet\/FatalError.hpp>\n#include <libmath\/DQStuff.hpp>\n#include <rexi\/REXIFunctions.hpp>\n#include <vector>\n\n\ntemplate <\n#if SWEET_QUADMATH\n\ttypename T =  __float128\n#else\n\ttypename T =  double\n#endif\n>\nclass REXI_CI\n{\n\ttypedef std::complex<T> TComplex;\n\n\tstd::vector<TComplex> alpha_eval;\n\tstd::vector<TComplex> beta_eval;\n\n\tconst T pi = DQStuff::fromString<T>(\"3.14159265358979323846264338327950288\");\n\tconst T pi2 = pi*DQStuff::fromString<T>(\"2.0\");\n\tconst T pi4 = pi*DQStuff::fromString<T>(\"4.0\");\n\tconst std::complex<T> I = std::complex<T>(0, 1);\n\npublic:\n\tstd::vector<std::complex<double>> alpha;\n\tstd::vector<std::complex<double>> beta;\n\n\tREXI_CI()\n\t{\n\t}\n\n\n\tvoid setup_shifted_circle(\n\t\t\tconst std::string &i_function_name,\n\t\t\tint N,\n\t\t\tT max_real_evalue,\n\t\t\tT max_imag_evalue,\n\t\t\tT i_ci_gaussian_filter_scale_a,\n\t\t\tT i_ci_gaussian_filter_dt_norm,\n\t\t\tT i_ci_gaussian_filter_exp_N,\n\t\t\tT i_ci_gaussian_filter_dt\n\t)\n\t{\n\t\t\/*\n\t\t * See CI documentation\n\t\t *\n\t\t * Here we compute a circle which is given by the boundary points.\n\t\t * This avoids large positive EValues leading to numerical cancellation effects\n\t\t *\/\n\t\tT x0 = max_real_evalue;\n\t\tT xm = max_imag_evalue;\n\t\tT r = (x0*x0 + xm*xm)\/(2.0*x0);\n\t\tT center = max_real_evalue-r;\n\n\t\tsetup(\n\t\t\t\ti_function_name,\n\t\t\t\tN,\n\t\t\t\t\"circle\",\n\t\t\t\tr*2.0,\n\t\t\t\tr*2.0,\n\t\t\t\tcenter,\n\t\t\t\ti_ci_gaussian_filter_scale_a,\n\t\t\t\ti_ci_gaussian_filter_dt_norm,\n\t\t\t\ti_ci_gaussian_filter_exp_N,\n\t\t\t\ti_ci_gaussian_filter_dt\n\t\t\t);\n\t}\n\n\n\tvoid setup(\n\t\t\tconst std::string &i_function_name,\n\t\t\tint N,\n\t\t\tconst std::string &i_primitive_name,\n\t\t\tT i_size_real,\n\t\t\tT i_size_imag,\n\t\t\tT i_mu,\n\t\t\tT i_ci_gaussian_filter_scale_a,\n\t\t\tT i_ci_gaussian_filter_dt_norm,\n\t\t\tT i_ci_gaussian_filter_exp_N,\n\t\t\tT i_ci_gaussian_filter_dt\n\t)\n\t{\n#if !SWEET_QUADMATH\n\/\/\t\tFatalError(\"Don't use this without quad precision support to generate the coefficients!\");\n#endif\n\n\t\talpha_eval.resize(N);\n\t\tbeta_eval.resize(N);\n\n\t\tREXIFunctions<T> fun(i_function_name);\n\n\t\tif (i_primitive_name == \"circle\")\n\t\t{\n\t\t\tif (i_size_real != i_size_imag)\n\t\t\t\tFatalError(\"size along real and imaginary axis must be the same\");\n\n\t\t\tT r = i_size_real*0.5;\n\n\t\t\tfor (int j = 0; j < N; j++)\n\t\t\t{\n\/\/\t\t\t\tT theta_j = (T)pi2*((T)j+(T)0.5)\/(T)N;\n\t\t\t\tT theta_j = (T)pi2*((T)j+(T)0.5)\/(T)N;\n\n\t\t\t\t\/\/ sampling position of support point\n\t\t\t\tTComplex pos = r*DQStuff::exp(I*theta_j);\n\n\t\t\t\t\/\/ shifted position\n\t\t\t\tTComplex gamma_j = pos + i_mu;\n\n\t\t\t\t\/*\n\t\t\t\t * Handle filter, see\n\t\t\t\t * doc\/rexi\/filter\n\t\t\t\t *\n\t\t\t\t * We use a Gaussian bump to filter out the fast modes\n\t\t\t\t *\/\n\t\t\t\tT filter_value = 1.0;\n\t\t\t\tif (i_ci_gaussian_filter_dt_norm != 0 && i_ci_gaussian_filter_scale_a != 0)\n\t\t\t\t{\n\/\/\t\t\t\t\tT dist = DQStuff::sqrt(gamma_j.real()*gamma_j.real() + gamma_j.imag()*gamma_j.imag());\n\t\t\t\t\tT dist = DQStuff::abs(gamma_j.imag());\n\n\/\/\t\t\t\t\tstd::cout << (double)gamma_j.real() << std::endl;\n\/\/\t\t\t\t\tstd::cout << (double)gamma_j.imag() << std::endl;\n\n\t\t\t\t\tfilter_value = DQStuff::exp(\n\t\t\t\t\t\t\t\t\t\t-DQStuff::pow(\n\t\t\t\t\t\t\t\t\t\t\t\ti_ci_gaussian_filter_dt_norm\/(i_ci_gaussian_filter_scale_a*i_ci_gaussian_filter_dt)*dist,\n\t\t\t\t\t\t\t\t\t\t\t\ti_ci_gaussian_filter_exp_N\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\tstd::cout << (double)dist << \"\\t\" << (double)filter_value << std::endl;\n\t\t\t\t}\n\n\t\t\t\tbeta_eval[j] = filter_value*fun.eval(gamma_j)*pos;\n\t\t\t\talpha_eval[j] = gamma_j;\n\n\t\t\t\tbeta_eval[j] \/= (T)N;\n\t\t\t}\n\t\t}\n\t\telse if (i_primitive_name == \"rectangle\")\n\t\t{\n\/\/\t\t\tFatalError(\"Not yet working :-(\");\n\n\t\t\tT SRe = i_size_real;\n\t\t\tT SIm = i_size_imag;\n\n\t\t\tint NRe = 0.5 * SRe * N \/ (SRe + SIm);\n\t\t\tint NIm = 0.5 * SIm * N \/ (SRe + SIm);\n\n#if 0\n\t\t\t\/*\n\t\t\t * Make N even numbered\n\t\t\t *\/\n\t\t\tif (NRe & 1)\n\t\t\t\tNRe--;\n\n\t\t\tif (NIm & 1)\n\t\t\t\tNIm--;\n#endif\n\n\t\t\tstd::cout << \"Size: \" << (double)i_size_real << \" x \" << (double)i_size_imag << std::endl;\n\t\t\tstd::cout << \"Points: \" << NRe << \" x \" << NIm << std::endl;\n\t\t\tint total_N = (2*NRe + 2*NIm);\n\t\t\tstd::cout << \"Points (total): \" << total_N << std::endl;\n\n\t\t\tif (total_N > N)\n\t\t\t\tFatalError(\"Total number of points exceeds the total number of requested points\");\n\n\t\t\t\/\/ Sampling distances\n\t\t\tT DRe = SRe\/NRe;\n\t\t\tT DIm = SIm\/NIm;\n\n\t\t\t\/\/ Sampling points along each rectangle boundary\n\t\t\tauto PRe = [&](int n) -> T { return (T)0.5*(DRe-SRe) + n*DRe; };\n\t\t\tauto PIm = [&](int n) -> T { return (T)0.5*(DIm-SIm) + n*DIm; };\n\n\t\t\tint j = 0;\n\n\t\t\t\/\/ BOTTOM\n\t\t\tfor (int n = 0; n < NRe; n++)\n\t\t\t{\n\t\t\t\tTComplex z = -I*(T)0.5*SIm + PRe(n) + i_mu;\n\n\t\t\t\tbeta_eval[j] = fun.eval(z);\n\t\t\t\tbeta_eval[j] *= SRe\/NRe;\n\t\t\t\tbeta_eval[j] \/= I*pi2;\n\n\t\t\t\talpha_eval[j] = z;\n\t\t\t\tj++;\n\t\t\t}\n\n\t\t\t\/\/ RIGHT\n\t\t\tfor (int n = 0; n < NIm; n++)\n\t\t\t{\n\t\t\t\tTComplex z = (T)0.5*SRe + I*PIm(n) + i_mu;\n\n\t\t\t\tbeta_eval[j] = fun.eval(z);\n\t\t\t\tbeta_eval[j] *= I;\n\t\t\t\tbeta_eval[j] *= SIm\/NIm;\n\t\t\t\tbeta_eval[j] \/= I*pi2;\n\n\t\t\t\talpha_eval[j] = z;\n\t\t\t\tj++;\n\t\t\t}\n\n\t\t\t\/\/ TOP\n\t\t\tfor (int n = 0; n < NRe; n++)\n\t\t\t{\n\t\t\t\tTComplex z = I*(T)0.5*SIm - PRe(n) + i_mu;\n\n\t\t\t\tbeta_eval[j] = fun.eval(z);\n\t\t\t\tbeta_eval[j] *= -(T)1.0;\n\t\t\t\tbeta_eval[j] *= SRe\/NRe;\n\t\t\t\tbeta_eval[j] \/= I*pi2;\n\n\t\t\t\talpha_eval[j] = z;\n\t\t\t\tj++;\n\t\t\t}\n\n\n\t\t\t\/\/ LEFT\n\t\t\tfor (int n = 0; n < NIm; n++)\n\t\t\t{\n\t\t\t\tTComplex z = -(T)0.5*SRe - I*PIm(n) + i_mu;\n\n\t\t\t\tbeta_eval[j] = fun.eval(z);\n\t\t\t\tbeta_eval[j] *= -I;\n\t\t\t\tbeta_eval[j] *= SIm\/NIm;\n\t\t\t\tbeta_eval[j] \/= I*pi2;\n\n\t\t\t\talpha_eval[j] = z;\n\t\t\t\tj++;\n\t\t\t}\n\n\t\t\tN = j;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tFatalError(\"This primitive is not known\");\n\t\t}\n\n\n\t\talpha.resize(N);\n\t\tbeta.resize(N);\n\n\t\tfor (int j = 0; j < N; j++)\n\t\t{\n\t\t\talpha[j] = {(double)alpha_eval[j].real(), (double)alpha_eval[j].imag()};\n\t\t\talpha[j] = -alpha[j];\n\n\t\t\tbeta[j] = {(double)beta_eval[j].real(), (double)beta_eval[j].imag()};\n\t\t\tbeta[j] = -beta[j];\n\/\/\t\t\tstd::cout << j << \":\\t\" << alpha[j] << std::endl;\n\t\t}\n\t}\n};\n\n\n#endif \/* SRC_INCLUDE_REXI_CI_HPP_ *\/\n<commit_msg>reenabled error if using REXI CI without quad precision<commit_after>\/*\n * REXI_CI.hpp\n *\n *  Created on: 18 Aug 2017\n *      Author: Martin Schreiber <SchreiberX@gmail.com>\n *\/\n\n#ifndef SRC_INCLUDE_REXI_CI_HPP_\n#define SRC_INCLUDE_REXI_CI_HPP_\n\n#include <sweet\/FatalError.hpp>\n#include <libmath\/DQStuff.hpp>\n#include <rexi\/REXIFunctions.hpp>\n#include <vector>\n\n\ntemplate <\n#if SWEET_QUADMATH\n\ttypename T =  __float128\n#else\n\ttypename T =  double\n#endif\n>\nclass REXI_CI\n{\n\ttypedef std::complex<T> TComplex;\n\n\tstd::vector<TComplex> alpha_eval;\n\tstd::vector<TComplex> beta_eval;\n\n\tconst T pi = DQStuff::fromString<T>(\"3.14159265358979323846264338327950288\");\n\tconst T pi2 = pi*DQStuff::fromString<T>(\"2.0\");\n\tconst T pi4 = pi*DQStuff::fromString<T>(\"4.0\");\n\tconst std::complex<T> I = std::complex<T>(0, 1);\n\npublic:\n\tstd::vector<std::complex<double>> alpha;\n\tstd::vector<std::complex<double>> beta;\n\n\tREXI_CI()\n\t{\n\t}\n\n\n\tvoid setup_shifted_circle(\n\t\t\tconst std::string &i_function_name,\n\t\t\tint N,\n\t\t\tT max_real_evalue,\n\t\t\tT max_imag_evalue,\n\t\t\tT i_ci_gaussian_filter_scale_a,\n\t\t\tT i_ci_gaussian_filter_dt_norm,\n\t\t\tT i_ci_gaussian_filter_exp_N,\n\t\t\tT i_ci_gaussian_filter_dt\n\t)\n\t{\n\t\t\/*\n\t\t * See CI documentation\n\t\t *\n\t\t * Here we compute a circle which is given by the boundary points.\n\t\t * This avoids large positive EValues leading to numerical cancellation effects\n\t\t *\/\n\t\tT x0 = max_real_evalue;\n\t\tT xm = max_imag_evalue;\n\t\tT r = (x0*x0 + xm*xm)\/(2.0*x0);\n\t\tT center = max_real_evalue-r;\n\n\t\tsetup(\n\t\t\t\ti_function_name,\n\t\t\t\tN,\n\t\t\t\t\"circle\",\n\t\t\t\tr*2.0,\n\t\t\t\tr*2.0,\n\t\t\t\tcenter,\n\t\t\t\ti_ci_gaussian_filter_scale_a,\n\t\t\t\ti_ci_gaussian_filter_dt_norm,\n\t\t\t\ti_ci_gaussian_filter_exp_N,\n\t\t\t\ti_ci_gaussian_filter_dt\n\t\t\t);\n\t}\n\n\n\tvoid setup(\n\t\t\tconst std::string &i_function_name,\n\t\t\tint N,\n\t\t\tconst std::string &i_primitive_name,\n\t\t\tT i_size_real,\n\t\t\tT i_size_imag,\n\t\t\tT i_mu,\n\t\t\tT i_ci_gaussian_filter_scale_a,\n\t\t\tT i_ci_gaussian_filter_dt_norm,\n\t\t\tT i_ci_gaussian_filter_exp_N,\n\t\t\tT i_ci_gaussian_filter_dt\n\t)\n\t{\n#if !SWEET_QUADMATH\n\t\tFatalError(\"Don't use this without quad precision support to generate the coefficients!\");\n#endif\n\n\t\talpha_eval.resize(N);\n\t\tbeta_eval.resize(N);\n\n\t\tREXIFunctions<T> fun(i_function_name);\n\n\t\tif (i_primitive_name == \"circle\")\n\t\t{\n\t\t\tif (i_size_real != i_size_imag)\n\t\t\t\tFatalError(\"size along real and imaginary axis must be the same\");\n\n\t\t\tT r = i_size_real*0.5;\n\n\t\t\tfor (int j = 0; j < N; j++)\n\t\t\t{\n\/\/\t\t\t\tT theta_j = (T)pi2*((T)j+(T)0.5)\/(T)N;\n\t\t\t\tT theta_j = (T)pi2*((T)j+(T)0.5)\/(T)N;\n\n\t\t\t\t\/\/ sampling position of support point\n\t\t\t\tTComplex pos = r*DQStuff::exp(I*theta_j);\n\n\t\t\t\t\/\/ shifted position\n\t\t\t\tTComplex gamma_j = pos + i_mu;\n\n\t\t\t\t\/*\n\t\t\t\t * Handle filter, see\n\t\t\t\t * doc\/rexi\/filter\n\t\t\t\t *\n\t\t\t\t * We use a Gaussian bump to filter out the fast modes\n\t\t\t\t *\/\n\t\t\t\tT filter_value = 1.0;\n\t\t\t\tif (i_ci_gaussian_filter_dt_norm != 0 && i_ci_gaussian_filter_scale_a != 0)\n\t\t\t\t{\n\/\/\t\t\t\t\tT dist = DQStuff::sqrt(gamma_j.real()*gamma_j.real() + gamma_j.imag()*gamma_j.imag());\n\t\t\t\t\tT dist = DQStuff::abs(gamma_j.imag());\n\n\/\/\t\t\t\t\tstd::cout << (double)gamma_j.real() << std::endl;\n\/\/\t\t\t\t\tstd::cout << (double)gamma_j.imag() << std::endl;\n\n\t\t\t\t\tfilter_value = DQStuff::exp(\n\t\t\t\t\t\t\t\t\t\t-DQStuff::pow(\n\t\t\t\t\t\t\t\t\t\t\t\ti_ci_gaussian_filter_dt_norm\/(i_ci_gaussian_filter_scale_a*i_ci_gaussian_filter_dt)*dist,\n\t\t\t\t\t\t\t\t\t\t\t\ti_ci_gaussian_filter_exp_N\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\tstd::cout << (double)dist << \"\\t\" << (double)filter_value << std::endl;\n\t\t\t\t}\n\n\t\t\t\tbeta_eval[j] = filter_value*fun.eval(gamma_j)*pos;\n\t\t\t\talpha_eval[j] = gamma_j;\n\n\t\t\t\tbeta_eval[j] \/= (T)N;\n\t\t\t}\n\t\t}\n\t\telse if (i_primitive_name == \"rectangle\")\n\t\t{\n\/\/\t\t\tFatalError(\"Not yet working :-(\");\n\n\t\t\tT SRe = i_size_real;\n\t\t\tT SIm = i_size_imag;\n\n\t\t\tint NRe = 0.5 * SRe * N \/ (SRe + SIm);\n\t\t\tint NIm = 0.5 * SIm * N \/ (SRe + SIm);\n\n#if 0\n\t\t\t\/*\n\t\t\t * Make N even numbered\n\t\t\t *\/\n\t\t\tif (NRe & 1)\n\t\t\t\tNRe--;\n\n\t\t\tif (NIm & 1)\n\t\t\t\tNIm--;\n#endif\n\n\t\t\tstd::cout << \"Size: \" << (double)i_size_real << \" x \" << (double)i_size_imag << std::endl;\n\t\t\tstd::cout << \"Points: \" << NRe << \" x \" << NIm << std::endl;\n\t\t\tint total_N = (2*NRe + 2*NIm);\n\t\t\tstd::cout << \"Points (total): \" << total_N << std::endl;\n\n\t\t\tif (total_N > N)\n\t\t\t\tFatalError(\"Total number of points exceeds the total number of requested points\");\n\n\t\t\t\/\/ Sampling distances\n\t\t\tT DRe = SRe\/NRe;\n\t\t\tT DIm = SIm\/NIm;\n\n\t\t\t\/\/ Sampling points along each rectangle boundary\n\t\t\tauto PRe = [&](int n) -> T { return (T)0.5*(DRe-SRe) + n*DRe; };\n\t\t\tauto PIm = [&](int n) -> T { return (T)0.5*(DIm-SIm) + n*DIm; };\n\n\t\t\tint j = 0;\n\n\t\t\t\/\/ BOTTOM\n\t\t\tfor (int n = 0; n < NRe; n++)\n\t\t\t{\n\t\t\t\tTComplex z = -I*(T)0.5*SIm + PRe(n) + i_mu;\n\n\t\t\t\tbeta_eval[j] = fun.eval(z);\n\t\t\t\tbeta_eval[j] *= SRe\/NRe;\n\t\t\t\tbeta_eval[j] \/= I*pi2;\n\n\t\t\t\talpha_eval[j] = z;\n\t\t\t\tj++;\n\t\t\t}\n\n\t\t\t\/\/ RIGHT\n\t\t\tfor (int n = 0; n < NIm; n++)\n\t\t\t{\n\t\t\t\tTComplex z = (T)0.5*SRe + I*PIm(n) + i_mu;\n\n\t\t\t\tbeta_eval[j] = fun.eval(z);\n\t\t\t\tbeta_eval[j] *= I;\n\t\t\t\tbeta_eval[j] *= SIm\/NIm;\n\t\t\t\tbeta_eval[j] \/= I*pi2;\n\n\t\t\t\talpha_eval[j] = z;\n\t\t\t\tj++;\n\t\t\t}\n\n\t\t\t\/\/ TOP\n\t\t\tfor (int n = 0; n < NRe; n++)\n\t\t\t{\n\t\t\t\tTComplex z = I*(T)0.5*SIm - PRe(n) + i_mu;\n\n\t\t\t\tbeta_eval[j] = fun.eval(z);\n\t\t\t\tbeta_eval[j] *= -(T)1.0;\n\t\t\t\tbeta_eval[j] *= SRe\/NRe;\n\t\t\t\tbeta_eval[j] \/= I*pi2;\n\n\t\t\t\talpha_eval[j] = z;\n\t\t\t\tj++;\n\t\t\t}\n\n\n\t\t\t\/\/ LEFT\n\t\t\tfor (int n = 0; n < NIm; n++)\n\t\t\t{\n\t\t\t\tTComplex z = -(T)0.5*SRe - I*PIm(n) + i_mu;\n\n\t\t\t\tbeta_eval[j] = fun.eval(z);\n\t\t\t\tbeta_eval[j] *= -I;\n\t\t\t\tbeta_eval[j] *= SIm\/NIm;\n\t\t\t\tbeta_eval[j] \/= I*pi2;\n\n\t\t\t\talpha_eval[j] = z;\n\t\t\t\tj++;\n\t\t\t}\n\n\t\t\tN = j;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tFatalError(\"This primitive is not known\");\n\t\t}\n\n\n\t\talpha.resize(N);\n\t\tbeta.resize(N);\n\n\t\tfor (int j = 0; j < N; j++)\n\t\t{\n\t\t\talpha[j] = {(double)alpha_eval[j].real(), (double)alpha_eval[j].imag()};\n\t\t\talpha[j] = -alpha[j];\n\n\t\t\tbeta[j] = {(double)beta_eval[j].real(), (double)beta_eval[j].imag()};\n\t\t\tbeta[j] = -beta[j];\n\/\/\t\t\tstd::cout << j << \":\\t\" << alpha[j] << std::endl;\n\t\t}\n\t}\n};\n\n\n#endif \/* SRC_INCLUDE_REXI_CI_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>280d6d64-2e4d-11e5-9284-b827eb9e62be<commit_msg>281272e6-2e4d-11e5-9284-b827eb9e62be<commit_after>281272e6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>b477e72e-2e4e-11e5-9284-b827eb9e62be<commit_msg>b48400a4-2e4e-11e5-9284-b827eb9e62be<commit_after>b48400a4-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>eb3f3344-2e4d-11e5-9284-b827eb9e62be<commit_msg>eb442854-2e4d-11e5-9284-b827eb9e62be<commit_after>eb442854-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>#include <node.h>\n#include \"include\/cef_base.h\"\n#include \"include\/cef_browser.h\"\n#include \"include\/cef_frame.h\"\n#include \"includes\/cef_handler.h\"\n#include \"includes\/cef_sync_handler.h\"\n#include \"base\/native_window.h\"\n#include \"appjs_window.h\"\n\n\nusing namespace v8;\nusing namespace appjs;\n\nint windowCount = 0;\n\nClientHandler::ClientHandler()\n  : mainBrowserHandle(NULL) {\n}\n\nClientHandler::~ClientHandler() {\n}\n\n\n\nHandle<Object> ClientHandler::GetNodeWindow(CefRefPtr<CefBrowser> browser) {\n  return GetWindow(browser)->GetV8Handle();\n}\n\nHandle<Object> ClientHandler::CreatedBrowser(CefRefPtr<CefBrowser> browser) {\n  NativeWindow* window = GetWindow(browser);\n  window->SetBrowser(browser);\n  return window->GetV8Handle();\n}\n\nNativeWindow* ClientHandler::GetWindow(CefRefPtr<CefBrowser> browser){\n  return GetWindow(GetContainer(browser));\n}\n\n\nvoid ClientHandler::OnAfterCreated(CefRefPtr<CefBrowser> browser) {\n  REQUIRE_UI_THREAD();\n  AutoLock lock_scope(this);\n\n  if (!browser->IsPopup()) {\n    if (!mainBrowserHandle.get()) {\n      mainBrowserHandle = browser;\n    }\n    windowCount++;\n    CreatedBrowser(browser);\n    GetWindow(browser)->Emit(\"create\");\n  }\n}\n\nbool ClientHandler::HasMainWindow() {\n  return mainBrowserHandle != NULL && mainBrowserHandle.get() != NULL;\n}\n\nvoid ClientHandler::Shutdown() {\n  if ( HasMainWindow() ) {\n    mainBrowserHandle->CloseBrowser();\n  }\n}\n\nvoid ClientHandler::OnContextCreated(CefRefPtr<CefBrowser> browser, CefRefPtr<CefFrame> frame, CefRefPtr<CefV8Context> context) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup()) {\n    context->Enter();\n    CefRefPtr<CefV8Value> appjsObj = CefV8Value::CreateObject(NULL);\n    CefRefPtr<CefV8Value> func = CefV8Value::CreateFunction(\"send\", new AppjsSyncHandler(browser));\n    context->GetGlobal()->SetValue(\"appjs\", appjsObj, V8_PROPERTY_ATTRIBUTE_NONE);\n    appjsObj->SetValue(\"send\", func, V8_PROPERTY_ATTRIBUTE_NONE);\n    context->Exit();\n    GetWindow(browser)->Emit(\"context-created\");\n  }\n}\n\nvoid ClientHandler::OnContextReleased(CefRefPtr<CefBrowser> browser, CefRefPtr<CefFrame> frame, CefRefPtr<CefV8Context> context) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup()) {\n    GetWindow(browser)->Emit(\"context-released\");\n  }\n}\n\nbool ClientHandler::DoClose(CefRefPtr<CefBrowser> browser) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup() && --windowCount == 0) {\n    Local<Object> global = Context::GetCurrent()->Global();\n    Local<Object> process = global->Get(String::NewSymbol(\"process\"))->ToObject();\n    Local<Object> emitter = Local<Object>::Cast(process->Get(String::NewSymbol(\"AppjsEmitter\")));\n    Handle<Value> exitArgv[1] = {String::New(\"exit\")};\n    node::MakeCallback(emitter,\"emit\",1,exitArgv);\n    Cef::Shutdown();\n    mainBrowserHandle = NULL;\n    return true;\n  } else {\n    return false;\n  }\n}\n\nvoid ClientHandler::OnBeforeClose(CefRefPtr<CefBrowser> browser) {\n  REQUIRE_UI_THREAD();\n\n  if(!browser->IsPopup()) {\n    NativeWindow* window = GetWindow(browser);\n    window->PrepareClose();\n    DoClose(browser);\n#ifdef __WIN__\n    delete GetWindow(browser);\n#endif\n  }\n}\n\nvoid ClientHandler::OnLoadEnd(CefRefPtr<CefBrowser> browser, CefRefPtr<CefFrame> frame, int httpStatusCode) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup()) {\n    GetWindow(browser)->Emit(\"ready\");\n  }\n}\n\nvoid ClientHandler::OnContentsSizeChange(CefRefPtr<CefBrowser> browser, CefRefPtr<CefFrame> frame, int width, int height) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup()) {\n    NativeWindow* window = GetWindow(browser);\n    if (window->GetAutoResize()) {\n      window->Resize(width, height);\n    }\n  }\n}\n\nvoid ClientHandler::OnTitleChange(CefRefPtr<CefBrowser> browser, const CefString& title) {\n  REQUIRE_UI_THREAD();\n  std::string titleStr(title);\n  NativeWindow::SetWindowTitle(GetContainer(browser),titleStr.c_str());\n  if (!browser->IsPopup()) {\n    GetWindow(browser)->Emit(\"title-change\");\n  }\n}\n<commit_msg>Check nativewindow existance before resizing the window<commit_after>#include <node.h>\n#include \"include\/cef_base.h\"\n#include \"include\/cef_browser.h\"\n#include \"include\/cef_frame.h\"\n#include \"includes\/cef_handler.h\"\n#include \"includes\/cef_sync_handler.h\"\n#include \"base\/native_window.h\"\n#include \"appjs_window.h\"\n\n\nusing namespace v8;\nusing namespace appjs;\n\nint windowCount = 0;\n\nClientHandler::ClientHandler()\n  : mainBrowserHandle(NULL) {\n}\n\nClientHandler::~ClientHandler() {\n}\n\n\n\nHandle<Object> ClientHandler::GetNodeWindow(CefRefPtr<CefBrowser> browser) {\n  return GetWindow(browser)->GetV8Handle();\n}\n\nHandle<Object> ClientHandler::CreatedBrowser(CefRefPtr<CefBrowser> browser) {\n  NativeWindow* window = GetWindow(browser);\n  window->SetBrowser(browser);\n  return window->GetV8Handle();\n}\n\nNativeWindow* ClientHandler::GetWindow(CefRefPtr<CefBrowser> browser){\n  return GetWindow(GetContainer(browser));\n}\n\n\nvoid ClientHandler::OnAfterCreated(CefRefPtr<CefBrowser> browser) {\n  REQUIRE_UI_THREAD();\n  AutoLock lock_scope(this);\n\n  if (!browser->IsPopup()) {\n    if (!mainBrowserHandle.get()) {\n      mainBrowserHandle = browser;\n    }\n    windowCount++;\n    CreatedBrowser(browser);\n    GetWindow(browser)->Emit(\"create\");\n  }\n}\n\nbool ClientHandler::HasMainWindow() {\n  return mainBrowserHandle != NULL && mainBrowserHandle.get() != NULL;\n}\n\nvoid ClientHandler::Shutdown() {\n  if ( HasMainWindow() ) {\n    mainBrowserHandle->CloseBrowser();\n  }\n}\n\nvoid ClientHandler::OnContextCreated(CefRefPtr<CefBrowser> browser, CefRefPtr<CefFrame> frame, CefRefPtr<CefV8Context> context) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup()) {\n    context->Enter();\n    CefRefPtr<CefV8Value> appjsObj = CefV8Value::CreateObject(NULL);\n    CefRefPtr<CefV8Value> func = CefV8Value::CreateFunction(\"send\", new AppjsSyncHandler(browser));\n    context->GetGlobal()->SetValue(\"appjs\", appjsObj, V8_PROPERTY_ATTRIBUTE_NONE);\n    appjsObj->SetValue(\"send\", func, V8_PROPERTY_ATTRIBUTE_NONE);\n    context->Exit();\n    GetWindow(browser)->Emit(\"context-created\");\n  }\n}\n\nvoid ClientHandler::OnContextReleased(CefRefPtr<CefBrowser> browser, CefRefPtr<CefFrame> frame, CefRefPtr<CefV8Context> context) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup()) {\n    GetWindow(browser)->Emit(\"context-released\");\n  }\n}\n\nbool ClientHandler::DoClose(CefRefPtr<CefBrowser> browser) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup() && --windowCount == 0) {\n    Local<Object> global = Context::GetCurrent()->Global();\n    Local<Object> process = global->Get(String::NewSymbol(\"process\"))->ToObject();\n    Local<Object> emitter = Local<Object>::Cast(process->Get(String::NewSymbol(\"AppjsEmitter\")));\n    Handle<Value> exitArgv[1] = {String::New(\"exit\")};\n    node::MakeCallback(emitter,\"emit\",1,exitArgv);\n    Cef::Shutdown();\n    mainBrowserHandle = NULL;\n    return true;\n  } else {\n    return false;\n  }\n}\n\nvoid ClientHandler::OnBeforeClose(CefRefPtr<CefBrowser> browser) {\n  REQUIRE_UI_THREAD();\n\n  if(!browser->IsPopup()) {\n    NativeWindow* window = GetWindow(browser);\n    window->PrepareClose();\n    DoClose(browser);\n#ifdef __WIN__\n    delete GetWindow(browser);\n#endif\n  }\n}\n\nvoid ClientHandler::OnLoadEnd(CefRefPtr<CefBrowser> browser, CefRefPtr<CefFrame> frame, int httpStatusCode) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup()) {\n    GetWindow(browser)->Emit(\"ready\");\n  }\n}\n\nvoid ClientHandler::OnContentsSizeChange(CefRefPtr<CefBrowser> browser, CefRefPtr<CefFrame> frame, int width, int height) {\n  REQUIRE_UI_THREAD();\n  if (!browser->IsPopup()) {\n    NativeWindow* window = GetWindow(browser);\n    if (window != NULL && window->GetAutoResize()) {\n      window->Resize(width, height);\n    }\n  }\n}\n\nvoid ClientHandler::OnTitleChange(CefRefPtr<CefBrowser> browser, const CefString& title) {\n  REQUIRE_UI_THREAD();\n  std::string titleStr(title);\n  NativeWindow::SetWindowTitle(GetContainer(browser),titleStr.c_str());\n  if (!browser->IsPopup()) {\n    GetWindow(browser)->Emit(\"title-change\");\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>d321652e-2e4e-11e5-9284-b827eb9e62be<commit_msg>d3266844-2e4e-11e5-9284-b827eb9e62be<commit_after>d3266844-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>c3dc01a6-2e4d-11e5-9284-b827eb9e62be<commit_msg>c3e11088-2e4d-11e5-9284-b827eb9e62be<commit_after>c3e11088-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>9c2a7858-2e4e-11e5-9284-b827eb9e62be<commit_msg>9c2f6f66-2e4e-11e5-9284-b827eb9e62be<commit_after>9c2f6f66-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>b56f3274-2e4c-11e5-9284-b827eb9e62be<commit_msg>b5744142-2e4c-11e5-9284-b827eb9e62be<commit_after>b5744142-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>36648cb6-2e4e-11e5-9284-b827eb9e62be<commit_msg>366981d0-2e4e-11e5-9284-b827eb9e62be<commit_after>366981d0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>a0dc89a4-2e4e-11e5-9284-b827eb9e62be<commit_msg>a0e1883c-2e4e-11e5-9284-b827eb9e62be<commit_after>a0e1883c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>e7d50b1c-2e4c-11e5-9284-b827eb9e62be<commit_msg>e7da0324-2e4c-11e5-9284-b827eb9e62be<commit_after>e7da0324-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>47caa036-2e4d-11e5-9284-b827eb9e62be<commit_msg>47cfae0a-2e4d-11e5-9284-b827eb9e62be<commit_after>47cfae0a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>aca8e5d6-2e4c-11e5-9284-b827eb9e62be<commit_msg>acadd71c-2e4c-11e5-9284-b827eb9e62be<commit_after>acadd71c-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>7b6db8d8-2e4d-11e5-9284-b827eb9e62be<commit_msg>7b72a6fe-2e4d-11e5-9284-b827eb9e62be<commit_after>7b72a6fe-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>021485ec-2e4e-11e5-9284-b827eb9e62be<commit_msg>02198254-2e4e-11e5-9284-b827eb9e62be<commit_after>02198254-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>48c09922-2e4e-11e5-9284-b827eb9e62be<commit_msg>48ccf69a-2e4e-11e5-9284-b827eb9e62be<commit_after>48ccf69a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>f5cec30a-2e4e-11e5-9284-b827eb9e62be<commit_msg>f5d3b5e0-2e4e-11e5-9284-b827eb9e62be<commit_after>f5d3b5e0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>0f1120de-2e4e-11e5-9284-b827eb9e62be<commit_msg>0f161eea-2e4e-11e5-9284-b827eb9e62be<commit_after>0f161eea-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>937c3616-2e4d-11e5-9284-b827eb9e62be<commit_msg>938140fc-2e4d-11e5-9284-b827eb9e62be<commit_after>938140fc-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>1f933628-2e4d-11e5-9284-b827eb9e62be<commit_msg>1f982b60-2e4d-11e5-9284-b827eb9e62be<commit_after>1f982b60-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>b4224932-2e4d-11e5-9284-b827eb9e62be<commit_msg>b427413a-2e4d-11e5-9284-b827eb9e62be<commit_after>b427413a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>85f67c8a-2e4e-11e5-9284-b827eb9e62be<commit_msg>85fb8b80-2e4e-11e5-9284-b827eb9e62be<commit_after>85fb8b80-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>00c57d9a-2e4e-11e5-9284-b827eb9e62be<commit_msg>00ca7458-2e4e-11e5-9284-b827eb9e62be<commit_after>00ca7458-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>aa7fc25c-2e4c-11e5-9284-b827eb9e62be<commit_msg>aa84b4f6-2e4c-11e5-9284-b827eb9e62be<commit_after>aa84b4f6-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>e7676012-2e4c-11e5-9284-b827eb9e62be<commit_msg>e76c4fa0-2e4c-11e5-9284-b827eb9e62be<commit_after>e76c4fa0-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>1404480a-2e4e-11e5-9284-b827eb9e62be<commit_msg>14093b62-2e4e-11e5-9284-b827eb9e62be<commit_after>14093b62-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>d60cd5c0-2e4e-11e5-9284-b827eb9e62be<commit_msg>d611d354-2e4e-11e5-9284-b827eb9e62be<commit_after>d611d354-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>3d03f962-2e4e-11e5-9284-b827eb9e62be<commit_msg>3d090718-2e4e-11e5-9284-b827eb9e62be<commit_after>3d090718-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>187d6b32-2e4e-11e5-9284-b827eb9e62be<commit_msg>18826ac4-2e4e-11e5-9284-b827eb9e62be<commit_after>18826ac4-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>16c065d2-2e4f-11e5-9284-b827eb9e62be<commit_msg>16c5743c-2e4f-11e5-9284-b827eb9e62be<commit_after>16c5743c-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>dfbc8a04-2e4c-11e5-9284-b827eb9e62be<commit_msg>dfc1785c-2e4c-11e5-9284-b827eb9e62be<commit_after>dfc1785c-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>7aca6498-2e4e-11e5-9284-b827eb9e62be<commit_msg>7acfa002-2e4e-11e5-9284-b827eb9e62be<commit_after>7acfa002-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>08cf0c58-2e4f-11e5-9284-b827eb9e62be<commit_msg>08d411da-2e4f-11e5-9284-b827eb9e62be<commit_after>08d411da-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>7a41dc00-2e4d-11e5-9284-b827eb9e62be<commit_msg>7a46ca62-2e4d-11e5-9284-b827eb9e62be<commit_after>7a46ca62-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>041853d6-2e4f-11e5-9284-b827eb9e62be<commit_msg>041d4c6a-2e4f-11e5-9284-b827eb9e62be<commit_after>041d4c6a-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>373fb128-2e4f-11e5-9284-b827eb9e62be<commit_msg>37450222-2e4f-11e5-9284-b827eb9e62be<commit_after>37450222-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>4d567458-2e4d-11e5-9284-b827eb9e62be<commit_msg>4d5b7e62-2e4d-11e5-9284-b827eb9e62be<commit_after>4d5b7e62-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>eb7323bc-2e4c-11e5-9284-b827eb9e62be<commit_msg>eb78112e-2e4c-11e5-9284-b827eb9e62be<commit_after>eb78112e-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>9ce052f0-2e4d-11e5-9284-b827eb9e62be<commit_msg>9ce55106-2e4d-11e5-9284-b827eb9e62be<commit_after>9ce55106-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>1c6604d4-2e4e-11e5-9284-b827eb9e62be<commit_msg>1c6b5e7a-2e4e-11e5-9284-b827eb9e62be<commit_after>1c6b5e7a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>fa8d5074-2e4d-11e5-9284-b827eb9e62be<commit_msg>fa924638-2e4d-11e5-9284-b827eb9e62be<commit_after>fa924638-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>ff560262-2e4e-11e5-9284-b827eb9e62be<commit_msg>ff5afaa6-2e4e-11e5-9284-b827eb9e62be<commit_after>ff5afaa6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>c283fec2-2e4c-11e5-9284-b827eb9e62be<commit_msg>c288fb2a-2e4c-11e5-9284-b827eb9e62be<commit_after>c288fb2a-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>4f6dfa94-2e4e-11e5-9284-b827eb9e62be<commit_msg>4f732b0e-2e4e-11e5-9284-b827eb9e62be<commit_after>4f732b0e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>2478b5bc-2e4f-11e5-9284-b827eb9e62be<commit_msg>247db224-2e4f-11e5-9284-b827eb9e62be<commit_after>247db224-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>b141aedc-2e4e-11e5-9284-b827eb9e62be<commit_msg>b146b8f0-2e4e-11e5-9284-b827eb9e62be<commit_after>b146b8f0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>269f3a2a-2e4d-11e5-9284-b827eb9e62be<commit_msg>26a43548-2e4d-11e5-9284-b827eb9e62be<commit_after>26a43548-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>f2523676-2e4e-11e5-9284-b827eb9e62be<commit_msg>f2572fd2-2e4e-11e5-9284-b827eb9e62be<commit_after>f2572fd2-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>15669be8-2e4f-11e5-9284-b827eb9e62be<commit_msg>156bc79e-2e4f-11e5-9284-b827eb9e62be<commit_after>156bc79e-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>52ab96c2-2e4d-11e5-9284-b827eb9e62be<commit_msg>52b0a1c6-2e4d-11e5-9284-b827eb9e62be<commit_after>52b0a1c6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>0566fb86-2e4d-11e5-9284-b827eb9e62be<commit_msg>056bfb2c-2e4d-11e5-9284-b827eb9e62be<commit_after>056bfb2c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013 Joshua Beitler, Mirus 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#include <term\/terminal.hpp>\n\n\/\/ terminal sizes\nstatic const size_t VGA_WIDTH = 80;\nstatic const size_t VGA_HEIGHT = 24;\n\n\/\/ term info\nstatic size_t terminal_row;\nstatic size_t terminal_column;\nstatic uint8_t terminal_color;\nstatic uint16_t* terminal_buffer;\n\nuint8_t mirus::make_color(enum vga_color fg, enum vga_color bg) {\n    return fg | bg << 4;\n}\n\nuint16_t mirus::make_vgaentry(char c, uint8_t color) {\n    uint16_t c16 = c;\n    uint16_t color16 = color;\n\n    return c16 | color16 << 8;\n}\n\nvoid mirus::terminal_initialize() {\n    using namespace mirus;\n\n    terminal_row = 0;\n    terminal_column = 0;\n    terminal_color = make_color(COLOR_WHITE, COLOR_BLACK);\n    terminal_buffer = (uint16_t*) 0xB8000;\n\n    for ( size_t y = 0; y < VGA_HEIGHT; y++ )\n    {\n        for ( size_t x = 0; x < VGA_WIDTH; x++ )\n        {\n            const size_t index = y * VGA_WIDTH + x;\n            terminal_buffer[index] = make_vgaentry(' ', terminal_color);\n        }\n    }\n}\n\n\/\/ set color\nvoid mirus::terminal_setcolor(uint8_t color) {\n    terminal_color = color;\n}\n\n\/\/ put an entry at location\nvoid mirus::terminal_putentryat(char c, uint8_t color, size_t x, size_t y) {\n    using namespace mirus;\n\n    const size_t index = y * VGA_WIDTH + x;\n    terminal_buffer[index] = make_vgaentry(c, color);\n}\n\n\/\/ put a char at a location\nvoid mirus::terminal_putchar(char c) {\n    using namespace mirus;\n\n    if (c == '\\r') {\n        ++terminal_row;\n        terminal_column = 0;\n    } else if (c == '\\b') {\n        --terminal_column;\n    }\n\n    terminal_putentryat(c, terminal_color, terminal_column, terminal_row);\n\n    if ( ++terminal_column == VGA_WIDTH )\n    {\n        terminal_column = 0;\n        terminal_row++;\n\n        \/\/ if (++terminal_row == 25)\n        \/\/ {\n        \/\/     terminal_scroll();\n        \/\/ }\n    }\n\n    \/\/ TODO: bug here\n    \/\/ if (++terminal_row == VGA_HEIGHT) {\n    \/\/     terminal_scroll();\n    \/\/ }\n\n    terminal_move_cursor();\n}\n\nvoid mirus::terminal_putchar(char c, uint8_t color) {\n    uint8_t oldcolor = terminal_color;\n    terminal_setcolor(color);\n    mirus::terminal_putchar(c);\n    terminal_setcolor(oldcolor);\n}\n\n\/\/ write a string\nvoid mirus::terminal_writestring(const char* data) {\n    using namespace mirus;\n\n    size_t datalen = strlen(data);\n\n    for (size_t i = 0; i < datalen; i++)\n        terminal_putchar(data[i]);\n}\n\nvoid mirus::terminal_writestring(const char* data, uint8_t color) {\n    using namespace mirus;\n\n    size_t datalen = strlen(data);\n    for (size_t i = 0; i < datalen; i++)\n        terminal_putchar(data[i], color);\n}\n\nvoid mirus::terminal_clear() {\n    using namespace mirus;\n\n    uint8_t attributeByte = (0 \/*black*\/ << 4) | (15 \/*white*\/ & 0x0F);\n    uint16_t blank = 0x20 \/* space *\/ | (attributeByte << 8);\n\n    for (int i = 0; i < 80 * 25; i++)\n        terminal_buffer[i] = 0;\n\n    \/\/ Move the hardware cursor back to the start.\n    terminal_row = 0;\n    terminal_column = 0;\n\n    terminal_move_cursor();\n}\n\n\/\/ TODO: does not scroll correctly\nvoid mirus::terminal_scroll() {\n    using namespace mirus;\n\n    uint8_t blank = make_color(COLOR_BLACK, COLOR_BLACK);\n    unsigned temp;\n    unsigned short* vidmem = nullptr;\n\n    vidmem = (unsigned short*)0xB8000;\n\n    temp = terminal_column - 25 + 1;\n\n    mirus::memcpy(vidmem, vidmem + temp * 80, (25 - temp) * 80 * 2);\n    mirus::memsetw(vidmem + (25 - temp) * 80, blank, 80);\n\n    terminal_column = 25 - 1;\n}\n\nvoid mirus::terminal_move_cursor() {\n    using namespace mirus;\n\n    unsigned temp;\n\n    \/* The equation for finding the index in a linear\n    *  chunk of memory can be represented by:\n    *  Index = [(y * width) + x] *\/\n    temp = terminal_row * 80 + terminal_column;\n\n    \/* This sends a command to indicies 14 and 15 in the\n    *  CRT Control Register of the VGA controller. These\n    *  are the high and low bytes of the index that show\n    *  where the hardware cursor is to be 'blinking'. To\n    *  learn more, you should look up some VGA specific\n    *  programming documents. A great start to graphics:\n    *  http:\/\/www.brackeen.com\/home\/vga *\/\n    mirus::outb(0x3D4, 14);\n    mirus::outb(0x3D5, temp >> 8);\n    mirus::outb(0x3D4, 15);\n    mirus::outb(0x3D5, temp);\n}<commit_msg>Backspace?<commit_after>\/\/ Copyright (c) 2013 Joshua Beitler, Mirus 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#include <term\/terminal.hpp>\n\n\/\/ terminal sizes\nstatic const size_t VGA_WIDTH = 80;\nstatic const size_t VGA_HEIGHT = 24;\n\n\/\/ term info\nstatic size_t terminal_row;\nstatic size_t terminal_column;\nstatic uint8_t terminal_color;\nstatic uint16_t* terminal_buffer;\n\nuint8_t mirus::make_color(enum vga_color fg, enum vga_color bg) {\n    return fg | bg << 4;\n}\n\nuint16_t mirus::make_vgaentry(char c, uint8_t color) {\n    uint16_t c16 = c;\n    uint16_t color16 = color;\n\n    return c16 | color16 << 8;\n}\n\nvoid mirus::terminal_initialize() {\n    using namespace mirus;\n\n    terminal_row = 0;\n    terminal_column = 0;\n    terminal_color = make_color(COLOR_WHITE, COLOR_BLACK);\n    terminal_buffer = (uint16_t*) 0xB8000;\n\n    for ( size_t y = 0; y < VGA_HEIGHT; y++ )\n    {\n        for ( size_t x = 0; x < VGA_WIDTH; x++ )\n        {\n            const size_t index = y * VGA_WIDTH + x;\n            terminal_buffer[index] = make_vgaentry(' ', terminal_color);\n        }\n    }\n}\n\n\/\/ set color\nvoid mirus::terminal_setcolor(uint8_t color) {\n    terminal_color = color;\n}\n\n\/\/ put an entry at location\nvoid mirus::terminal_putentryat(char c, uint8_t color, size_t x, size_t y) {\n    using namespace mirus;\n\n    const size_t index = y * VGA_WIDTH + x;\n    terminal_buffer[index] = make_vgaentry(c, color);\n}\n\n\/\/ put a char at a location\nvoid mirus::terminal_putchar(char c) {\n    using namespace mirus;\n\n    \/\/ if (c == '\\r') {\n    \/\/     ++terminal_row;\n    \/\/     terminal_column = 0;\n    \/\/ } else if (c == '\\b') {\n    \/\/     --terminal_column;\n    \/\/ }\n\n    terminal_putentryat(c, terminal_color, terminal_column, terminal_row);\n\n    if ( ++terminal_column == VGA_WIDTH )\n    {\n        terminal_column = 0;\n        terminal_row++;\n\n        \/\/ if (++terminal_row == 25)\n        \/\/ {\n        \/\/     terminal_scroll();\n        \/\/ }\n    }\n\n    \/\/ TODO: bug here\n    \/\/ if (++terminal_row == VGA_HEIGHT) {\n    \/\/     terminal_scroll();\n    \/\/ }\n\n    terminal_move_cursor();\n}\n\nvoid mirus::terminal_putchar(char c, uint8_t color) {\n    uint8_t oldcolor = terminal_color;\n    terminal_setcolor(color);\n    mirus::terminal_putchar(c);\n    terminal_setcolor(oldcolor);\n}\n\n\/\/ write a string\nvoid mirus::terminal_writestring(const char* data) {\n    using namespace mirus;\n\n    size_t datalen = strlen(data);\n\n    for (size_t i = 0; i < datalen; i++) {\n        if (data[i] == '\\r') {\n            ++terminal_column;\n            terinal_row = 0;\n        } else if (data[i] == '\\b') {\n            terminal_column--;\n        } else\n            terminal_putchar(data[i]);\n    }\n}\n\nvoid mirus::terminal_writestring(const char* data, uint8_t color) {\n    using namespace mirus;\n\n    size_t datalen = strlen(data);\n    for (size_t i = 0; i < datalen; i++) {\n        if (data[i] == '\\r') {\n            ++terminal_column;\n            terminal_row = 0;\n        }  else if (data[i] == '\\b') {\n            terminal_column--;\n        } else\n            terminal_putchar(data[i], color);\n    }\n}\n\nvoid mirus::terminal_clear() {\n    using namespace mirus;\n\n    uint8_t attributeByte = (0 \/*black*\/ << 4) | (15 \/*white*\/ & 0x0F);\n    uint16_t blank = 0x20 \/* space *\/ | (attributeByte << 8);\n\n    for (int i = 0; i < 80 * 25; i++)\n        terminal_buffer[i] = 0;\n\n    \/\/ Move the hardware cursor back to the start.\n    terminal_row = 0;\n    terminal_column = 0;\n\n    terminal_move_cursor();\n}\n\n\/\/ TODO: does not scroll correctly\nvoid mirus::terminal_scroll() {\n    using namespace mirus;\n\n    uint8_t blank = make_color(COLOR_BLACK, COLOR_BLACK);\n    unsigned temp;\n    unsigned short* vidmem = nullptr;\n\n    vidmem = (unsigned short*)0xB8000;\n\n    temp = terminal_column - 25 + 1;\n\n    mirus::memcpy(vidmem, vidmem + temp * 80, (25 - temp) * 80 * 2);\n    mirus::memsetw(vidmem + (25 - temp) * 80, blank, 80);\n\n    terminal_column = 25 - 1;\n}\n\nvoid mirus::terminal_move_cursor() {\n    using namespace mirus;\n\n    unsigned temp;\n\n    \/* The equation for finding the index in a linear\n    *  chunk of memory can be represented by:\n    *  Index = [(y * width) + x] *\/\n    temp = terminal_row * 80 + terminal_column;\n\n    \/* This sends a command to indicies 14 and 15 in the\n    *  CRT Control Register of the VGA controller. These\n    *  are the high and low bytes of the index that show\n    *  where the hardware cursor is to be 'blinking'. To\n    *  learn more, you should look up some VGA specific\n    *  programming documents. A great start to graphics:\n    *  http:\/\/www.brackeen.com\/home\/vga *\/\n    mirus::outb(0x3D4, 14);\n    mirus::outb(0x3D5, temp >> 8);\n    mirus::outb(0x3D4, 15);\n    mirus::outb(0x3D5, temp);\n}<|endoftext|>"}
{"text":"<commit_before>fad809d4-2e4d-11e5-9284-b827eb9e62be<commit_msg>fadd09fc-2e4d-11e5-9284-b827eb9e62be<commit_after>fadd09fc-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2019 Advanced Micro Devices, Inc.\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#ifndef BFLOAT16_DEVICE_HPP\n#define BFLOAT16_DEVICE_HPP\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#ifdef __HIP_PLATFORM_HCC__\n#define EXECUTION_SPECIFIER __device__\n#else\n#define EXECUTION_SPECIFIER\n#endif \/\/ MIOPEN_BACKEND_HIP\n\ntypedef union\n{\n    uint u32;\n    ushort2 ushortx2;\n\n\/\/ Composable kernels are written in HIP language. The language doesnt support\n\/\/ ushort2.hi or ushort2.low.\n#ifdef __HIP_PLATFORM_HCC__\n    ushort ushortvec[2];\n#endif \/\/ MIOPEN_BACKEND_HIP\n    float f32;\n} cvt_bf16_fp32_t;\n\nEXECUTION_SPECIFIER float bfloat16_to_float(ushort src_val)\n{\n    cvt_bf16_fp32_t target_val;\n\n#ifdef __HIP_PLATFORM_HCC__\n    target_val.ushortx2 = make_ushort2(0, src_val);\n#else\n    target_val.ushortx2 = (ushort2)(0, src_val);\n#endif\n\n    return target_val.f32;\n}\n\nEXECUTION_SPECIFIER ushort float_to_bfloat16(float src_val)\n{\n    cvt_bf16_fp32_t target_val;\n    target_val.f32 = src_val;\n    \/\/ BF16 round and NaN preservation code matches\n    \/\/ https:\/\/github.com\/ROCmSoftwarePlatform\/rocBLAS\/blob\/develop\/library\/include\/rocblas_bfloat16.h\n    if((~target_val.u32 & 0x7f800000) == 0) \/\/ Inf or NaN\n    {\n        \/\/ When all of the exponent bits are 1, the value is Inf or NaN.\n        \/\/ Inf is indicated by a zero mantissa. NaN is indicated by any nonzero\n        \/\/ mantissa bit. Quiet NaN is indicated by the most significant mantissa\n        \/\/ bit being 1. Signaling NaN is indicated by the most significant\n        \/\/ mantissa bit being 0 but some other bit(s) being 1. If any of the\n        \/\/ lower 16 bits of the mantissa are 1, we set the least significant bit\n        \/\/ of the bfloat16 mantissa, in order to preserve signaling NaN in case\n        \/\/ the bloat16's mantissa bits are all 0.\n        if((target_val.u32 & 0xffff) != 0)\n        {\n            target_val.u32 |= 0x10000; \/\/ Preserve signaling NaN\n        }\n    }\n    else\n    {\n#ifdef MIOPEN_USE_RNE_BFLOAT16\n\/\/ When the exponent bits are not all 1s, then the value is zero, normal,\n\/\/ or subnormal. We round the bfloat16 mantissa up by adding 0x7FFF, plus\n\/\/ 1 if the least significant bit of the bfloat16 mantissa is 1 (odd).\n\/\/ This causes the bfloat16's mantissa to be incremented by 1 if the 16\n\/\/ least significant bits of the float mantissa are greater than 0x8000,\n\/\/ or if they are equal to 0x8000 and the least significant bit of the\n\/\/ bfloat16 mantissa is 1 (odd). This causes it to be rounded to even when\n\/\/ the lower 16 bits are exactly 0x8000. If the bfloat16 mantissa already\n\/\/ has the value 0x7f, then incrementing it causes it to become 0x00 and\n\/\/ the exponent is incremented by one, which is the next higher FP value\n\/\/ to the unrounded bfloat16 value. When the bfloat16 value is subnormal\n\/\/ with an exponent of 0x00 and a mantissa of 0x7F, it may be rounded up\n\/\/ to a normal value with an exponent of 0x01 and a mantissa of 0x00.\n\/\/ When the bfloat16 value has an exponent of 0xFE and a mantissa of 0x7F,\n\/\/ incrementing it causes it to become an exponent of 0xFF and a mantissa\n\/\/ of 0x00, which is Inf, the next higher value to the unrounded value.\n#ifdef __HIP_PLATFORM_HCC__\n        target_val.u32 += (0x7fff + (target_val.ushortvec[1] & 1));\n#else\n        target_val.u32 +=\n            (0x7fff + (target_val.ushortx2.hi & 1)); \/\/ Round to nearest, round to even\n#endif \/\/ MIOPEN_BACKEND_HIP\n#endif \/\/ MIOPEN_USE_RNE_BFLOAT16\n    }\n\n#ifdef __HIP_PLATFORM_HCC__\n    return target_val.ushortvec[1];\n#else\n    return target_val.ushortx2.hi;\n#endif \/\/ MIOPEN_BACKEND_HIP\n}\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif \/\/ BFLOAT16_DEVICE_HPP\n<commit_msg>Resolves hipclang compilation error pertaining to anonymous union (#157)<commit_after>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2019 Advanced Micro Devices, Inc.\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#ifndef BFLOAT16_DEVICE_HPP\n#define BFLOAT16_DEVICE_HPP\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#ifdef __HIP_PLATFORM_HCC__\n#define EXECUTION_SPECIFIER __device__\n#else\n#define EXECUTION_SPECIFIER\n#endif \/\/ MIOPEN_BACKEND_HIP\n\ntypedef union cvt_bf16_fp32\n{\n    uint u32;\n    ushort2 ushortx2;\n\n\/\/ Composable kernels are written in HIP language. The language doesnt support\n\/\/ ushort2.hi or ushort2.low.\n#ifdef __HIP_PLATFORM_HCC__\n    ushort ushortvec[2];\n#endif \/\/ MIOPEN_BACKEND_HIP\n    float f32;\n} cvt_bf16_fp32_t;\n\nEXECUTION_SPECIFIER float bfloat16_to_float(ushort src_val)\n{\n    cvt_bf16_fp32_t target_val;\n\n#ifdef __HIP_PLATFORM_HCC__\n    target_val.ushortx2 = make_ushort2(0, src_val);\n#else\n    target_val.ushortx2 = (ushort2)(0, src_val);\n#endif\n\n    return target_val.f32;\n}\n\nEXECUTION_SPECIFIER ushort float_to_bfloat16(float src_val)\n{\n    cvt_bf16_fp32_t target_val;\n    target_val.f32 = src_val;\n    \/\/ BF16 round and NaN preservation code matches\n    \/\/ https:\/\/github.com\/ROCmSoftwarePlatform\/rocBLAS\/blob\/develop\/library\/include\/rocblas_bfloat16.h\n    if((~target_val.u32 & 0x7f800000) == 0) \/\/ Inf or NaN\n    {\n        \/\/ When all of the exponent bits are 1, the value is Inf or NaN.\n        \/\/ Inf is indicated by a zero mantissa. NaN is indicated by any nonzero\n        \/\/ mantissa bit. Quiet NaN is indicated by the most significant mantissa\n        \/\/ bit being 1. Signaling NaN is indicated by the most significant\n        \/\/ mantissa bit being 0 but some other bit(s) being 1. If any of the\n        \/\/ lower 16 bits of the mantissa are 1, we set the least significant bit\n        \/\/ of the bfloat16 mantissa, in order to preserve signaling NaN in case\n        \/\/ the bloat16's mantissa bits are all 0.\n        if((target_val.u32 & 0xffff) != 0)\n        {\n            target_val.u32 |= 0x10000; \/\/ Preserve signaling NaN\n        }\n    }\n    else\n    {\n#ifdef MIOPEN_USE_RNE_BFLOAT16\n\/\/ When the exponent bits are not all 1s, then the value is zero, normal,\n\/\/ or subnormal. We round the bfloat16 mantissa up by adding 0x7FFF, plus\n\/\/ 1 if the least significant bit of the bfloat16 mantissa is 1 (odd).\n\/\/ This causes the bfloat16's mantissa to be incremented by 1 if the 16\n\/\/ least significant bits of the float mantissa are greater than 0x8000,\n\/\/ or if they are equal to 0x8000 and the least significant bit of the\n\/\/ bfloat16 mantissa is 1 (odd). This causes it to be rounded to even when\n\/\/ the lower 16 bits are exactly 0x8000. If the bfloat16 mantissa already\n\/\/ has the value 0x7f, then incrementing it causes it to become 0x00 and\n\/\/ the exponent is incremented by one, which is the next higher FP value\n\/\/ to the unrounded bfloat16 value. When the bfloat16 value is subnormal\n\/\/ with an exponent of 0x00 and a mantissa of 0x7F, it may be rounded up\n\/\/ to a normal value with an exponent of 0x01 and a mantissa of 0x00.\n\/\/ When the bfloat16 value has an exponent of 0xFE and a mantissa of 0x7F,\n\/\/ incrementing it causes it to become an exponent of 0xFF and a mantissa\n\/\/ of 0x00, which is Inf, the next higher value to the unrounded value.\n#ifdef __HIP_PLATFORM_HCC__\n        target_val.u32 += (0x7fff + (target_val.ushortvec[1] & 1));\n#else\n        target_val.u32 +=\n            (0x7fff + (target_val.ushortx2.hi & 1)); \/\/ Round to nearest, round to even\n#endif \/\/ MIOPEN_BACKEND_HIP\n#endif \/\/ MIOPEN_USE_RNE_BFLOAT16\n    }\n\n#ifdef __HIP_PLATFORM_HCC__\n    return target_val.ushortvec[1];\n#else\n    return target_val.ushortx2.hi;\n#endif \/\/ MIOPEN_BACKEND_HIP\n}\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif \/\/ BFLOAT16_DEVICE_HPP\n<|endoftext|>"}
{"text":"<commit_before>eb0e11b6-2e4c-11e5-9284-b827eb9e62be<commit_msg>eb130374-2e4c-11e5-9284-b827eb9e62be<commit_after>eb130374-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>7b16d26a-2e4e-11e5-9284-b827eb9e62be<commit_msg>7b1bf7ae-2e4e-11e5-9284-b827eb9e62be<commit_after>7b1bf7ae-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>87891d1e-2e4e-11e5-9284-b827eb9e62be<commit_msg>878e2d9a-2e4e-11e5-9284-b827eb9e62be<commit_after>878e2d9a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>57fcdfb4-2e4d-11e5-9284-b827eb9e62be<commit_msg>5801e644-2e4d-11e5-9284-b827eb9e62be<commit_after>5801e644-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>eda8b98a-2e4c-11e5-9284-b827eb9e62be<commit_msg>edadb520-2e4c-11e5-9284-b827eb9e62be<commit_after>edadb520-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>2b25e9d4-2e4f-11e5-9284-b827eb9e62be<commit_msg>2b2ae330-2e4f-11e5-9284-b827eb9e62be<commit_after>2b2ae330-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>dd94184a-2e4d-11e5-9284-b827eb9e62be<commit_msg>dd992f92-2e4d-11e5-9284-b827eb9e62be<commit_after>dd992f92-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>32a0dfb6-2e4f-11e5-9284-b827eb9e62be<commit_msg>32a5d520-2e4f-11e5-9284-b827eb9e62be<commit_after>32a5d520-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>c1ffb3d6-2e4e-11e5-9284-b827eb9e62be<commit_msg>c204afbc-2e4e-11e5-9284-b827eb9e62be<commit_after>c204afbc-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>5a38eaa6-2e4e-11e5-9284-b827eb9e62be<commit_msg>5a3ff21a-2e4e-11e5-9284-b827eb9e62be<commit_after>5a3ff21a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>9678cd20-2e4d-11e5-9284-b827eb9e62be<commit_msg>967dc852-2e4d-11e5-9284-b827eb9e62be<commit_after>967dc852-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>6f08a5d4-2e4e-11e5-9284-b827eb9e62be<commit_msg>6f0da17e-2e4e-11e5-9284-b827eb9e62be<commit_after>6f0da17e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>86bfe468-2e4d-11e5-9284-b827eb9e62be<commit_msg>86c4e166-2e4d-11e5-9284-b827eb9e62be<commit_after>86c4e166-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>f30d8020-2e4e-11e5-9284-b827eb9e62be<commit_msg>f3127a12-2e4e-11e5-9284-b827eb9e62be<commit_after>f3127a12-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>19695d8a-2e4e-11e5-9284-b827eb9e62be<commit_msg>196e8738-2e4e-11e5-9284-b827eb9e62be<commit_after>196e8738-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>46cac8b8-2e4e-11e5-9284-b827eb9e62be<commit_msg>46cfd9c0-2e4e-11e5-9284-b827eb9e62be<commit_after>46cfd9c0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>e588dd32-2e4e-11e5-9284-b827eb9e62be<commit_msg>e5948b14-2e4e-11e5-9284-b827eb9e62be<commit_after>e5948b14-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>8c4fee32-2e4d-11e5-9284-b827eb9e62be<commit_msg>8c54e4aa-2e4d-11e5-9284-b827eb9e62be<commit_after>8c54e4aa-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>4f449e88-2e4e-11e5-9284-b827eb9e62be<commit_msg>4f49cc82-2e4e-11e5-9284-b827eb9e62be<commit_after>4f49cc82-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>9e42baa2-2e4d-11e5-9284-b827eb9e62be<commit_msg>9e47bc32-2e4d-11e5-9284-b827eb9e62be<commit_after>9e47bc32-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>deeba6a4-2e4d-11e5-9284-b827eb9e62be<commit_msg>def0ae38-2e4d-11e5-9284-b827eb9e62be<commit_after>def0ae38-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>ee375e8c-2e4d-11e5-9284-b827eb9e62be<commit_msg>ee3c6c38-2e4d-11e5-9284-b827eb9e62be<commit_after>ee3c6c38-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>628b61d0-2e4d-11e5-9284-b827eb9e62be<commit_msg>62907990-2e4d-11e5-9284-b827eb9e62be<commit_after>62907990-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>1c6b5e7a-2e4e-11e5-9284-b827eb9e62be<commit_msg>1c706834-2e4e-11e5-9284-b827eb9e62be<commit_after>1c706834-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>db6b4060-2e4e-11e5-9284-b827eb9e62be<commit_msg>db703b1a-2e4e-11e5-9284-b827eb9e62be<commit_after>db703b1a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>942c664e-2e4d-11e5-9284-b827eb9e62be<commit_msg>9431c076-2e4d-11e5-9284-b827eb9e62be<commit_after>9431c076-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>65d95a44-2e4e-11e5-9284-b827eb9e62be<commit_msg>65dec010-2e4e-11e5-9284-b827eb9e62be<commit_after>65dec010-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>cc230292-2e4d-11e5-9284-b827eb9e62be<commit_msg>cc2800e4-2e4d-11e5-9284-b827eb9e62be<commit_after>cc2800e4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>3be8127a-2e4e-11e5-9284-b827eb9e62be<commit_msg>3bed2c42-2e4e-11e5-9284-b827eb9e62be<commit_after>3bed2c42-2e4e-11e5-9284-b827eb9e62be<|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 Layouts 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 \"qquicklayout_p.h\"\n#include <QEvent>\n#include <QtCore\/qcoreapplication.h>\n#include <QtCore\/qnumeric.h>\n#include <limits>\n\n\/*!\n    \\qmltype Layout\n    \\instantiates QQuickLayoutAttached\n    \\inqmlmodule QtQuick.Layouts\n    \\ingroup layouts\n    \\brief Provides attached properties for items pushed onto a \\l GridLayout,\n    \\l RowLayout or \\l ColumnLayout.\n\n    An object of type Layout is attached to children of the layout to provide layout specific\n    information about the item.\n    The properties of the attached object influences how the layout will arrange the items.\n\n    For instance, you can specify \\l minimumWidth, \\l preferredWidth, and\n    \\l maximumWidth if the default values are not satisfactory.\n\n    When a layout is resized, items may grow or shrink. Due to this, items have a\n    \\l{Layout::minimumWidth}{minimum size}, \\l{Layout::preferredWidth}{preferred size} and a\n    \\l{Layout::maximumWidth}{maximum size}.\n\n    If minimum size have not been explicitly specified on an item, the size is set to \\c 0.\n    If maximum size have not been explicitly specified on an item, the size is set to\n    \\c Number.POSITIVE_INFINITY.\n\n    For layouts, the implicit minimum and maximum size depends on the content of the layouts.\n\n    The \\l fillWidth and \\l fillHeight properties can either be \\c true or \\c false. If it is \\c\n    false, the item's size will be fixed to its preferred size. Otherwise, it will grow or shrink\n    between its minimum and maximum size as the layout is resized.\n\n    \\note It is not recommended to have bindings to the x, y, width, or height properties of items\n    in a layout, since this would conflict with the goal of the Layout, and also cause binding\n    loops.\n\n\n    \\sa GridLayout\n    \\sa RowLayout\n    \\sa ColumnLayout\n*\/\n\nQT_BEGIN_NAMESPACE\n\nQQuickLayoutAttached::QQuickLayoutAttached(QObject *parent)\n    : QObject(parent),\n      m_minimumWidth(0),\n      m_minimumHeight(0),\n      m_preferredWidth(-1),\n      m_preferredHeight(-1),\n      m_maximumWidth(std::numeric_limits<qreal>::infinity()),\n      m_maximumHeight(std::numeric_limits<qreal>::infinity()),\n      m_row(-1),\n      m_column(-1),\n      m_rowSpan(1),\n      m_columnSpan(1),\n      m_fillWidth(false),\n      m_fillHeight(false),\n      m_isFillWidthSet(false),\n      m_isFillHeightSet(false),\n      m_isMinimumWidthSet(false),\n      m_isMinimumHeightSet(false),\n      m_isMaximumWidthSet(false),\n      m_isMaximumHeightSet(false),\n      m_changesNotificationEnabled(true),\n      m_alignment(0)\n{\n\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::minimumWidth\n\n    This property holds the maximum width of an item in a layout.\n    The default value is the items implicit minimum width.\n\n    If the item is a layout, the implicit minimum width will be the minimum width the layout can\n    have without any of its items shrink beyond their minimum width.\n    The implicit minimum width for any other item is \\c 0.\n\n    Setting this value to -1 will reset the width back to its implicit minimum width.\n\n\n    \\sa preferredWidth\n    \\sa maximumWidth\n*\/\nvoid QQuickLayoutAttached::setMinimumWidth(qreal width)\n{\n    if (qIsNaN(width))\n        return;\n    m_isMinimumWidthSet = width >= 0;\n    if (m_minimumWidth == width)\n        return;\n\n    m_minimumWidth = width;\n    invalidateItem();\n    emit minimumWidthChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::minimumHeight\n\n    The default value is the items implicit minimum height.\n\n    If the item is a layout, the implicit minimum height will be the minimum height the layout can\n    have without any of its items shrink beyond their minimum height.\n    The implicit minimum height for any other item is \\c 0.\n\n    Setting this value to -1 will reset the height back to its implicit minimum height.\n\n    \\sa preferredHeight\n    \\sa maximumHeight\n*\/\nvoid QQuickLayoutAttached::setMinimumHeight(qreal height)\n{\n    if (qIsNaN(height))\n        return;\n    m_isMinimumHeightSet = height >= 0;\n    if (m_minimumHeight == height)\n        return;\n\n    m_minimumHeight = height;\n    invalidateItem();\n    emit minimumHeightChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::preferredWidth\n\n    This property holds the preferred width of an item in a layout.\n    If the preferred width is -1 it will be ignored, and the layout\n    will use \\l{Item::implicitWidth}{implicitWidth} instead.\n    The default is \\c -1.\n\n    \\sa minimumWidth\n    \\sa maximumWidth\n*\/\nvoid QQuickLayoutAttached::setPreferredWidth(qreal width)\n{\n    if (qIsNaN(width) || m_preferredWidth == width)\n        return;\n\n    m_preferredWidth = width;\n    invalidateItem();\n    emit preferredWidthChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::preferredHeight\n\n    This property holds the preferred height of an item in a layout.\n    If the preferred height is -1 it will be ignored, and the layout\n    will use \\l{Item::implicitHeight}{implicitHeight} instead.\n    The default is \\c -1.\n\n    \\sa minimumHeight\n    \\sa maximumHeight\n*\/\nvoid QQuickLayoutAttached::setPreferredHeight(qreal height)\n{\n    if (qIsNaN(height) || m_preferredHeight == height)\n        return;\n\n    m_preferredHeight = height;\n    invalidateItem();\n    emit preferredHeightChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::maximumWidth\n\n    This property holds the maximum width of an item in a layout.\n    The default value is the items implicit maximum width.\n\n    If the item is a layout, the implicit maximum width will be the maximum width the layout can\n    have without any of its items grow beyond their maximum width.\n    The implicit maximum width for any other item is \\c Number.POSITIVE_INFINITY.\n\n    Setting this value to -1 will reset the width back to its implicit maximum width.\n\n    \\sa minimumWidth\n    \\sa preferredWidth\n*\/\nvoid QQuickLayoutAttached::setMaximumWidth(qreal width)\n{\n    if (qIsNaN(width))\n        return;\n    m_isMaximumWidthSet = width >= 0;\n    if (m_maximumWidth == width)\n        return;\n\n    m_maximumWidth = width;\n    invalidateItem();\n    emit maximumWidthChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::maximumHeight\n\n    The default value is the items implicit maximum height.\n\n    If the item is a layout, the implicit maximum height will be the maximum height the layout can\n    have without any of its items grow beyond their maximum height.\n    The implicit maximum height for any other item is \\c Number.POSITIVE_INFINITY.\n\n    Setting this value to -1 will reset the height back to its implicit maximum height.\n\n    \\sa minimumHeight\n    \\sa preferredHeight\n*\/\nvoid QQuickLayoutAttached::setMaximumHeight(qreal height)\n{\n    if (qIsNaN(height))\n        return;\n    m_isMaximumHeightSet = height >= 0;\n    if (m_maximumHeight == height)\n        return;\n\n    m_maximumHeight = height;\n    invalidateItem();\n    emit maximumHeightChanged();\n}\n\nvoid QQuickLayoutAttached::setMinimumImplicitSize(const QSizeF &sz)\n{\n    bool emitWidthChanged = false;\n    bool emitHeightChanged = false;\n    if (!m_isMinimumWidthSet && m_minimumWidth != sz.width()) {\n        m_minimumWidth = sz.width();\n        emitWidthChanged = true;\n    }\n    if (!m_isMinimumHeightSet && m_minimumHeight != sz.height()) {\n        m_minimumHeight = sz.height();\n        emitHeightChanged = true;\n    }\n    \/\/ Only invalidate the item once, and make sure we emit signal changed after the call to\n    \/\/ invalidateItem()\n    if (emitWidthChanged || emitHeightChanged) {\n        invalidateItem();\n        if (emitWidthChanged)\n            emit minimumWidthChanged();\n        if (emitHeightChanged)\n            emit minimumHeightChanged();\n    }\n}\n\nvoid QQuickLayoutAttached::setMaximumImplicitSize(const QSizeF &sz)\n{\n    bool emitWidthChanged = false;\n    bool emitHeightChanged = false;\n    if (!m_isMaximumWidthSet && m_maximumWidth != sz.width()) {\n        m_maximumWidth = sz.width();\n        emitWidthChanged = true;\n    }\n    if (!m_isMaximumHeightSet && m_maximumHeight != sz.height()) {\n        m_maximumHeight = sz.height();\n        emitHeightChanged = true;\n    }\n    \/\/ Only invalidate the item once, and make sure we emit changed signal after the call to\n    \/\/ invalidateItem()\n    if (emitWidthChanged || emitHeightChanged) {\n        invalidateItem();\n        if (emitWidthChanged)\n            emit maximumWidthChanged();\n        if (emitHeightChanged)\n            emit maximumHeightChanged();\n    }\n}\n\n\/*!\n    \\qmlattachedproperty bool Layout::fillWidth\n\n    If this property is \\c true, the item will be as wide as possible while respecting\n    the given constraints. If the property is \\c false, the item will have a fixed width\n    set to the preferred width.\n    The default is \\c false, except for layouts themselves which defaults to \\c true.\n\n    \\sa fillHeight\n*\/\nvoid QQuickLayoutAttached::setFillWidth(bool fill)\n{\n    m_isFillWidthSet = true;\n    if (m_fillWidth != fill) {\n        m_fillWidth = fill;\n        invalidateItem();\n        emit fillWidthChanged();\n    }\n}\n\n\/*!\n    \\qmlattachedproperty bool Layout::fillHeight\n\n    If this property is \\c true, the item will be as tall as possible while respecting\n    the given constraints. If the property is \\c false, the item will have a fixed height\n    set to the preferred height.\n    The default is \\c false, except for layouts themselves which defaults to \\c true.\n\n    \\sa fillWidth\n*\/\nvoid QQuickLayoutAttached::setFillHeight(bool fill)\n{\n    m_isFillHeightSet = true;\n    if (m_fillHeight != fill) {\n        m_fillHeight = fill;\n        invalidateItem();\n        emit fillHeightChanged();\n    }\n}\n\n\/*!\n    \\qmlattachedproperty int Layout::row\n\n    This property allows you to specify the row position of an item in a \\l GridLayout.\n\n    If both \\l column and this property are not set, it is up to the layout to assign a cell to the item.\n\n    The default value is \\c 0.\n\n    \\sa column\n    \\sa rowSpan\n*\/\nvoid QQuickLayoutAttached::setRow(int row)\n{\n    if (row >= 0 && row != m_row) {\n        m_row = row;\n        repopulateLayout();\n        emit rowChanged();\n    }\n}\n\n\/*!\n    \\qmlattachedproperty int Layout::column\n\n    This property allows you to specify the column position of an item in a \\l GridLayout.\n\n    If both \\l row and this property are not set, it is up to the layout to assign a cell to the item.\n\n    The default value is \\c 0.\n\n    \\sa row\n    \\sa columnSpan\n*\/\nvoid QQuickLayoutAttached::setColumn(int column)\n{\n    if (column >= 0 && column != m_column) {\n        m_column = column;\n        repopulateLayout();\n        emit columnChanged();\n    }\n}\n\n\n\/*!\n    \\qmlattachedproperty Qt.Alignment Layout::alignment\n\n    This property allows you to specify the alignment of an item within the cell(s) it occupies.\n\n    The default value is \\c 0, which means it will be \\c{Qt.AlignVCenter | Qt.AlignLeft}\n\n    A valid alignment is a combination of the following flags:\n    \\list\n    \\li Qt::AlignLeft\n    \\li Qt::AlignHCenter\n    \\li Qt::AlignRight\n    \\li Qt::AlignTop\n    \\li Qt::AlignVCenter\n    \\li Qt::AlignBottom\n    \\li Qt::AlignBaseline\n    \\endlist\n\n*\/\nvoid QQuickLayoutAttached::setAlignment(Qt::Alignment align)\n{\n    if (align != m_alignment) {\n        m_alignment = align;\n        if (QQuickLayout *layout = parentLayout()) {\n            layout->setAlignment(item(), align);\n            invalidateItem();\n        }\n        emit alignmentChanged();\n    }\n}\n\n\n\/*!\n    \\qmlattachedproperty int Layout::rowSpan\n\n    This property allows you to specify the row span of an item in a \\l GridLayout.\n\n    The default value is \\c 1.\n\n    \\sa columnSpan\n    \\sa row\n*\/\nvoid QQuickLayoutAttached::setRowSpan(int span)\n{\n    if (span != m_rowSpan) {\n        m_rowSpan = span;\n        repopulateLayout();\n        emit rowSpanChanged();\n    }\n}\n\n\n\/*!\n    \\qmlattachedproperty int Layout::columnSpan\n\n    This property allows you to specify the column span of an item in a \\l GridLayout.\n\n    The default value is \\c 1.\n\n    \\sa rowSpan\n    \\sa column\n*\/\nvoid QQuickLayoutAttached::setColumnSpan(int span)\n{\n    if (span != m_columnSpan) {\n        m_columnSpan = span;\n        repopulateLayout();\n        emit columnSpanChanged();\n    }\n}\n\n\nqreal QQuickLayoutAttached::sizeHint(Qt::SizeHint which, Qt::Orientation orientation) const\n{\n    qreal result = 0;\n    if (QQuickLayout *layout = qobject_cast<QQuickLayout *>(item())) {\n        const QSizeF sz = layout->sizeHint(which);\n        result = (orientation == Qt::Horizontal ? sz.width() : sz.height());\n    } else {\n        if (which == Qt::MaximumSize)\n            result = std::numeric_limits<qreal>::infinity();\n    }\n    return result;\n}\n\nvoid QQuickLayoutAttached::invalidateItem()\n{\n    if (!m_changesNotificationEnabled)\n        return;\n    quickLayoutDebug() << \"QQuickLayoutAttached::invalidateItem\";\n    if (QQuickLayout *layout = parentLayout()) {\n        layout->invalidate(item());\n    }\n}\n\nvoid QQuickLayoutAttached::repopulateLayout()\n{\n    if (QQuickLayout *layout = parentLayout())\n        layout->updateLayoutItems();\n}\n\nQQuickLayout *QQuickLayoutAttached::parentLayout() const\n{\n    QQuickItem *parentItem = item();\n    if (parentItem) {\n        parentItem = parentItem->parentItem();\n        return qobject_cast<QQuickLayout *>(parentItem);\n    } else {\n        qWarning(\"Layout must be attached to Item elements\");\n    }\n    return 0;\n}\n\nQQuickItem *QQuickLayoutAttached::item() const\n{\n    return qobject_cast<QQuickItem *>(parent());\n}\n\n\n\n\n\nQQuickLayout::QQuickLayout(QQuickLayoutPrivate &dd, QQuickItem *parent)\n    : QQuickItem(dd, parent),\n      m_dirty(false)\n{\n}\n\nQQuickLayout::~QQuickLayout()\n{\n\n}\n\nQQuickLayoutAttached *QQuickLayout::qmlAttachedProperties(QObject *object)\n{\n    return new QQuickLayoutAttached(object);\n}\n\nvoid QQuickLayout::updatePolish()\n{\n    rearrange(QSizeF(width(), height()));\n}\n\nvoid QQuickLayout::componentComplete()\n{\n    QQuickItem::componentComplete();\n}\n\nvoid QQuickLayout::invalidate(QQuickItem * \/*childItem*\/)\n{\n    if (m_dirty)\n        return;\n\n    m_dirty = true;\n\n    if (!qobject_cast<QQuickLayout *>(parentItem())) {\n        quickLayoutDebug() << \"QQuickLayout::invalidate(), polish()\";\n        polish();\n    }\n}\n\nvoid QQuickLayout::rearrange(const QSizeF &\/*size*\/)\n{\n    m_dirty = false;\n}\n\nQT_END_NAMESPACE\n<commit_msg>Fix grammar in Layout::fillWidth and Layout::fillHeight documentation.<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 Layouts 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 \"qquicklayout_p.h\"\n#include <QEvent>\n#include <QtCore\/qcoreapplication.h>\n#include <QtCore\/qnumeric.h>\n#include <limits>\n\n\/*!\n    \\qmltype Layout\n    \\instantiates QQuickLayoutAttached\n    \\inqmlmodule QtQuick.Layouts\n    \\ingroup layouts\n    \\brief Provides attached properties for items pushed onto a \\l GridLayout,\n    \\l RowLayout or \\l ColumnLayout.\n\n    An object of type Layout is attached to children of the layout to provide layout specific\n    information about the item.\n    The properties of the attached object influences how the layout will arrange the items.\n\n    For instance, you can specify \\l minimumWidth, \\l preferredWidth, and\n    \\l maximumWidth if the default values are not satisfactory.\n\n    When a layout is resized, items may grow or shrink. Due to this, items have a\n    \\l{Layout::minimumWidth}{minimum size}, \\l{Layout::preferredWidth}{preferred size} and a\n    \\l{Layout::maximumWidth}{maximum size}.\n\n    If minimum size have not been explicitly specified on an item, the size is set to \\c 0.\n    If maximum size have not been explicitly specified on an item, the size is set to\n    \\c Number.POSITIVE_INFINITY.\n\n    For layouts, the implicit minimum and maximum size depends on the content of the layouts.\n\n    The \\l fillWidth and \\l fillHeight properties can either be \\c true or \\c false. If it is \\c\n    false, the item's size will be fixed to its preferred size. Otherwise, it will grow or shrink\n    between its minimum and maximum size as the layout is resized.\n\n    \\note It is not recommended to have bindings to the x, y, width, or height properties of items\n    in a layout, since this would conflict with the goal of the Layout, and also cause binding\n    loops.\n\n\n    \\sa GridLayout\n    \\sa RowLayout\n    \\sa ColumnLayout\n*\/\n\nQT_BEGIN_NAMESPACE\n\nQQuickLayoutAttached::QQuickLayoutAttached(QObject *parent)\n    : QObject(parent),\n      m_minimumWidth(0),\n      m_minimumHeight(0),\n      m_preferredWidth(-1),\n      m_preferredHeight(-1),\n      m_maximumWidth(std::numeric_limits<qreal>::infinity()),\n      m_maximumHeight(std::numeric_limits<qreal>::infinity()),\n      m_row(-1),\n      m_column(-1),\n      m_rowSpan(1),\n      m_columnSpan(1),\n      m_fillWidth(false),\n      m_fillHeight(false),\n      m_isFillWidthSet(false),\n      m_isFillHeightSet(false),\n      m_isMinimumWidthSet(false),\n      m_isMinimumHeightSet(false),\n      m_isMaximumWidthSet(false),\n      m_isMaximumHeightSet(false),\n      m_changesNotificationEnabled(true),\n      m_alignment(0)\n{\n\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::minimumWidth\n\n    This property holds the maximum width of an item in a layout.\n    The default value is the items implicit minimum width.\n\n    If the item is a layout, the implicit minimum width will be the minimum width the layout can\n    have without any of its items shrink beyond their minimum width.\n    The implicit minimum width for any other item is \\c 0.\n\n    Setting this value to -1 will reset the width back to its implicit minimum width.\n\n\n    \\sa preferredWidth\n    \\sa maximumWidth\n*\/\nvoid QQuickLayoutAttached::setMinimumWidth(qreal width)\n{\n    if (qIsNaN(width))\n        return;\n    m_isMinimumWidthSet = width >= 0;\n    if (m_minimumWidth == width)\n        return;\n\n    m_minimumWidth = width;\n    invalidateItem();\n    emit minimumWidthChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::minimumHeight\n\n    The default value is the items implicit minimum height.\n\n    If the item is a layout, the implicit minimum height will be the minimum height the layout can\n    have without any of its items shrink beyond their minimum height.\n    The implicit minimum height for any other item is \\c 0.\n\n    Setting this value to -1 will reset the height back to its implicit minimum height.\n\n    \\sa preferredHeight\n    \\sa maximumHeight\n*\/\nvoid QQuickLayoutAttached::setMinimumHeight(qreal height)\n{\n    if (qIsNaN(height))\n        return;\n    m_isMinimumHeightSet = height >= 0;\n    if (m_minimumHeight == height)\n        return;\n\n    m_minimumHeight = height;\n    invalidateItem();\n    emit minimumHeightChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::preferredWidth\n\n    This property holds the preferred width of an item in a layout.\n    If the preferred width is -1 it will be ignored, and the layout\n    will use \\l{Item::implicitWidth}{implicitWidth} instead.\n    The default is \\c -1.\n\n    \\sa minimumWidth\n    \\sa maximumWidth\n*\/\nvoid QQuickLayoutAttached::setPreferredWidth(qreal width)\n{\n    if (qIsNaN(width) || m_preferredWidth == width)\n        return;\n\n    m_preferredWidth = width;\n    invalidateItem();\n    emit preferredWidthChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::preferredHeight\n\n    This property holds the preferred height of an item in a layout.\n    If the preferred height is -1 it will be ignored, and the layout\n    will use \\l{Item::implicitHeight}{implicitHeight} instead.\n    The default is \\c -1.\n\n    \\sa minimumHeight\n    \\sa maximumHeight\n*\/\nvoid QQuickLayoutAttached::setPreferredHeight(qreal height)\n{\n    if (qIsNaN(height) || m_preferredHeight == height)\n        return;\n\n    m_preferredHeight = height;\n    invalidateItem();\n    emit preferredHeightChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::maximumWidth\n\n    This property holds the maximum width of an item in a layout.\n    The default value is the items implicit maximum width.\n\n    If the item is a layout, the implicit maximum width will be the maximum width the layout can\n    have without any of its items grow beyond their maximum width.\n    The implicit maximum width for any other item is \\c Number.POSITIVE_INFINITY.\n\n    Setting this value to -1 will reset the width back to its implicit maximum width.\n\n    \\sa minimumWidth\n    \\sa preferredWidth\n*\/\nvoid QQuickLayoutAttached::setMaximumWidth(qreal width)\n{\n    if (qIsNaN(width))\n        return;\n    m_isMaximumWidthSet = width >= 0;\n    if (m_maximumWidth == width)\n        return;\n\n    m_maximumWidth = width;\n    invalidateItem();\n    emit maximumWidthChanged();\n}\n\n\/*!\n    \\qmlattachedproperty real Layout::maximumHeight\n\n    The default value is the items implicit maximum height.\n\n    If the item is a layout, the implicit maximum height will be the maximum height the layout can\n    have without any of its items grow beyond their maximum height.\n    The implicit maximum height for any other item is \\c Number.POSITIVE_INFINITY.\n\n    Setting this value to -1 will reset the height back to its implicit maximum height.\n\n    \\sa minimumHeight\n    \\sa preferredHeight\n*\/\nvoid QQuickLayoutAttached::setMaximumHeight(qreal height)\n{\n    if (qIsNaN(height))\n        return;\n    m_isMaximumHeightSet = height >= 0;\n    if (m_maximumHeight == height)\n        return;\n\n    m_maximumHeight = height;\n    invalidateItem();\n    emit maximumHeightChanged();\n}\n\nvoid QQuickLayoutAttached::setMinimumImplicitSize(const QSizeF &sz)\n{\n    bool emitWidthChanged = false;\n    bool emitHeightChanged = false;\n    if (!m_isMinimumWidthSet && m_minimumWidth != sz.width()) {\n        m_minimumWidth = sz.width();\n        emitWidthChanged = true;\n    }\n    if (!m_isMinimumHeightSet && m_minimumHeight != sz.height()) {\n        m_minimumHeight = sz.height();\n        emitHeightChanged = true;\n    }\n    \/\/ Only invalidate the item once, and make sure we emit signal changed after the call to\n    \/\/ invalidateItem()\n    if (emitWidthChanged || emitHeightChanged) {\n        invalidateItem();\n        if (emitWidthChanged)\n            emit minimumWidthChanged();\n        if (emitHeightChanged)\n            emit minimumHeightChanged();\n    }\n}\n\nvoid QQuickLayoutAttached::setMaximumImplicitSize(const QSizeF &sz)\n{\n    bool emitWidthChanged = false;\n    bool emitHeightChanged = false;\n    if (!m_isMaximumWidthSet && m_maximumWidth != sz.width()) {\n        m_maximumWidth = sz.width();\n        emitWidthChanged = true;\n    }\n    if (!m_isMaximumHeightSet && m_maximumHeight != sz.height()) {\n        m_maximumHeight = sz.height();\n        emitHeightChanged = true;\n    }\n    \/\/ Only invalidate the item once, and make sure we emit changed signal after the call to\n    \/\/ invalidateItem()\n    if (emitWidthChanged || emitHeightChanged) {\n        invalidateItem();\n        if (emitWidthChanged)\n            emit maximumWidthChanged();\n        if (emitHeightChanged)\n            emit maximumHeightChanged();\n    }\n}\n\n\/*!\n    \\qmlattachedproperty bool Layout::fillWidth\n\n    If this property is \\c true, the item will be as wide as possible while respecting\n    the given constraints. If the property is \\c false, the item will have a fixed width\n    set to the preferred width.\n    The default is \\c false, except for layouts themselves, which default to \\c true.\n\n    \\sa fillHeight\n*\/\nvoid QQuickLayoutAttached::setFillWidth(bool fill)\n{\n    m_isFillWidthSet = true;\n    if (m_fillWidth != fill) {\n        m_fillWidth = fill;\n        invalidateItem();\n        emit fillWidthChanged();\n    }\n}\n\n\/*!\n    \\qmlattachedproperty bool Layout::fillHeight\n\n    If this property is \\c true, the item will be as tall as possible while respecting\n    the given constraints. If the property is \\c false, the item will have a fixed height\n    set to the preferred height.\n    The default is \\c false, except for layouts themselves, which default to \\c true.\n\n    \\sa fillWidth\n*\/\nvoid QQuickLayoutAttached::setFillHeight(bool fill)\n{\n    m_isFillHeightSet = true;\n    if (m_fillHeight != fill) {\n        m_fillHeight = fill;\n        invalidateItem();\n        emit fillHeightChanged();\n    }\n}\n\n\/*!\n    \\qmlattachedproperty int Layout::row\n\n    This property allows you to specify the row position of an item in a \\l GridLayout.\n\n    If both \\l column and this property are not set, it is up to the layout to assign a cell to the item.\n\n    The default value is \\c 0.\n\n    \\sa column\n    \\sa rowSpan\n*\/\nvoid QQuickLayoutAttached::setRow(int row)\n{\n    if (row >= 0 && row != m_row) {\n        m_row = row;\n        repopulateLayout();\n        emit rowChanged();\n    }\n}\n\n\/*!\n    \\qmlattachedproperty int Layout::column\n\n    This property allows you to specify the column position of an item in a \\l GridLayout.\n\n    If both \\l row and this property are not set, it is up to the layout to assign a cell to the item.\n\n    The default value is \\c 0.\n\n    \\sa row\n    \\sa columnSpan\n*\/\nvoid QQuickLayoutAttached::setColumn(int column)\n{\n    if (column >= 0 && column != m_column) {\n        m_column = column;\n        repopulateLayout();\n        emit columnChanged();\n    }\n}\n\n\n\/*!\n    \\qmlattachedproperty Qt.Alignment Layout::alignment\n\n    This property allows you to specify the alignment of an item within the cell(s) it occupies.\n\n    The default value is \\c 0, which means it will be \\c{Qt.AlignVCenter | Qt.AlignLeft}\n\n    A valid alignment is a combination of the following flags:\n    \\list\n    \\li Qt::AlignLeft\n    \\li Qt::AlignHCenter\n    \\li Qt::AlignRight\n    \\li Qt::AlignTop\n    \\li Qt::AlignVCenter\n    \\li Qt::AlignBottom\n    \\li Qt::AlignBaseline\n    \\endlist\n\n*\/\nvoid QQuickLayoutAttached::setAlignment(Qt::Alignment align)\n{\n    if (align != m_alignment) {\n        m_alignment = align;\n        if (QQuickLayout *layout = parentLayout()) {\n            layout->setAlignment(item(), align);\n            invalidateItem();\n        }\n        emit alignmentChanged();\n    }\n}\n\n\n\/*!\n    \\qmlattachedproperty int Layout::rowSpan\n\n    This property allows you to specify the row span of an item in a \\l GridLayout.\n\n    The default value is \\c 1.\n\n    \\sa columnSpan\n    \\sa row\n*\/\nvoid QQuickLayoutAttached::setRowSpan(int span)\n{\n    if (span != m_rowSpan) {\n        m_rowSpan = span;\n        repopulateLayout();\n        emit rowSpanChanged();\n    }\n}\n\n\n\/*!\n    \\qmlattachedproperty int Layout::columnSpan\n\n    This property allows you to specify the column span of an item in a \\l GridLayout.\n\n    The default value is \\c 1.\n\n    \\sa rowSpan\n    \\sa column\n*\/\nvoid QQuickLayoutAttached::setColumnSpan(int span)\n{\n    if (span != m_columnSpan) {\n        m_columnSpan = span;\n        repopulateLayout();\n        emit columnSpanChanged();\n    }\n}\n\n\nqreal QQuickLayoutAttached::sizeHint(Qt::SizeHint which, Qt::Orientation orientation) const\n{\n    qreal result = 0;\n    if (QQuickLayout *layout = qobject_cast<QQuickLayout *>(item())) {\n        const QSizeF sz = layout->sizeHint(which);\n        result = (orientation == Qt::Horizontal ? sz.width() : sz.height());\n    } else {\n        if (which == Qt::MaximumSize)\n            result = std::numeric_limits<qreal>::infinity();\n    }\n    return result;\n}\n\nvoid QQuickLayoutAttached::invalidateItem()\n{\n    if (!m_changesNotificationEnabled)\n        return;\n    quickLayoutDebug() << \"QQuickLayoutAttached::invalidateItem\";\n    if (QQuickLayout *layout = parentLayout()) {\n        layout->invalidate(item());\n    }\n}\n\nvoid QQuickLayoutAttached::repopulateLayout()\n{\n    if (QQuickLayout *layout = parentLayout())\n        layout->updateLayoutItems();\n}\n\nQQuickLayout *QQuickLayoutAttached::parentLayout() const\n{\n    QQuickItem *parentItem = item();\n    if (parentItem) {\n        parentItem = parentItem->parentItem();\n        return qobject_cast<QQuickLayout *>(parentItem);\n    } else {\n        qWarning(\"Layout must be attached to Item elements\");\n    }\n    return 0;\n}\n\nQQuickItem *QQuickLayoutAttached::item() const\n{\n    return qobject_cast<QQuickItem *>(parent());\n}\n\n\n\n\n\nQQuickLayout::QQuickLayout(QQuickLayoutPrivate &dd, QQuickItem *parent)\n    : QQuickItem(dd, parent),\n      m_dirty(false)\n{\n}\n\nQQuickLayout::~QQuickLayout()\n{\n\n}\n\nQQuickLayoutAttached *QQuickLayout::qmlAttachedProperties(QObject *object)\n{\n    return new QQuickLayoutAttached(object);\n}\n\nvoid QQuickLayout::updatePolish()\n{\n    rearrange(QSizeF(width(), height()));\n}\n\nvoid QQuickLayout::componentComplete()\n{\n    QQuickItem::componentComplete();\n}\n\nvoid QQuickLayout::invalidate(QQuickItem * \/*childItem*\/)\n{\n    if (m_dirty)\n        return;\n\n    m_dirty = true;\n\n    if (!qobject_cast<QQuickLayout *>(parentItem())) {\n        quickLayoutDebug() << \"QQuickLayout::invalidate(), polish()\";\n        polish();\n    }\n}\n\nvoid QQuickLayout::rearrange(const QSizeF &\/*size*\/)\n{\n    m_dirty = false;\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>bee13314-2e4e-11e5-9284-b827eb9e62be<commit_msg>bee63968-2e4e-11e5-9284-b827eb9e62be<commit_after>bee63968-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>d0c1f244-2e4e-11e5-9284-b827eb9e62be<commit_msg>d0c6eaa6-2e4e-11e5-9284-b827eb9e62be<commit_after>d0c6eaa6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>88e771e2-2e4e-11e5-9284-b827eb9e62be<commit_msg>88ec7b9c-2e4e-11e5-9284-b827eb9e62be<commit_after>88ec7b9c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>368baf48-2e4f-11e5-9284-b827eb9e62be<commit_msg>3690a96c-2e4f-11e5-9284-b827eb9e62be<commit_after>3690a96c-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>52483262-2e4d-11e5-9284-b827eb9e62be<commit_msg>524d4356-2e4d-11e5-9284-b827eb9e62be<commit_after>524d4356-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>122b32b4-2e4e-11e5-9284-b827eb9e62be<commit_msg>1230328c-2e4e-11e5-9284-b827eb9e62be<commit_after>1230328c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>f488b28a-2e4e-11e5-9284-b827eb9e62be<commit_msg>f48daf6a-2e4e-11e5-9284-b827eb9e62be<commit_after>f48daf6a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>08dd6f4c-2e4e-11e5-9284-b827eb9e62be<commit_msg>08e2802c-2e4e-11e5-9284-b827eb9e62be<commit_after>08e2802c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>ff2af4fc-2e4c-11e5-9284-b827eb9e62be<commit_msg>ff2ff1f0-2e4c-11e5-9284-b827eb9e62be<commit_after>ff2ff1f0-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>347ee4f0-2e4e-11e5-9284-b827eb9e62be<commit_msg>3483d596-2e4e-11e5-9284-b827eb9e62be<commit_after>3483d596-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>081b020a-2e4d-11e5-9284-b827eb9e62be<commit_msg>0820168c-2e4d-11e5-9284-b827eb9e62be<commit_after>0820168c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>e06a2b00-2e4c-11e5-9284-b827eb9e62be<commit_msg>e06f1e94-2e4c-11e5-9284-b827eb9e62be<commit_after>e06f1e94-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>f45ab238-2e4c-11e5-9284-b827eb9e62be<commit_msg>f45fd36c-2e4c-11e5-9284-b827eb9e62be<commit_after>f45fd36c-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>3530125c-2e4e-11e5-9284-b827eb9e62be<commit_msg>3535091a-2e4e-11e5-9284-b827eb9e62be<commit_after>3535091a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>10c5d876-2e4d-11e5-9284-b827eb9e62be<commit_msg>10cacae8-2e4d-11e5-9284-b827eb9e62be<commit_after>10cacae8-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>80d82e48-2e4d-11e5-9284-b827eb9e62be<commit_msg>80dd231c-2e4d-11e5-9284-b827eb9e62be<commit_after>80dd231c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>9cbd9be8-2e4d-11e5-9284-b827eb9e62be<commit_msg>9cc291c0-2e4d-11e5-9284-b827eb9e62be<commit_after>9cc291c0-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>9f9142ca-2e4d-11e5-9284-b827eb9e62be<commit_msg>9f963726-2e4d-11e5-9284-b827eb9e62be<commit_after>9f963726-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>20cdd410-2e4f-11e5-9284-b827eb9e62be<commit_msg>20d2cd8a-2e4f-11e5-9284-b827eb9e62be<commit_after>20d2cd8a-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>0eba7ec4-2e4d-11e5-9284-b827eb9e62be<commit_msg>0ebf7636-2e4d-11e5-9284-b827eb9e62be<commit_after>0ebf7636-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>ac186f96-2e4d-11e5-9284-b827eb9e62be<commit_msg>ac1d6460-2e4d-11e5-9284-b827eb9e62be<commit_after>ac1d6460-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>f3ef258a-2e4d-11e5-9284-b827eb9e62be<commit_msg>f3f43b1a-2e4d-11e5-9284-b827eb9e62be<commit_after>f3f43b1a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>aa114924-2e4e-11e5-9284-b827eb9e62be<commit_msg>aa164794-2e4e-11e5-9284-b827eb9e62be<commit_after>aa164794-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>adaae078-2e4d-11e5-9284-b827eb9e62be<commit_msg>adafd9a2-2e4d-11e5-9284-b827eb9e62be<commit_after>adafd9a2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>c991e732-2e4d-11e5-9284-b827eb9e62be<commit_msg>c996d882-2e4d-11e5-9284-b827eb9e62be<commit_after>c996d882-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>159c8174-2e4d-11e5-9284-b827eb9e62be<commit_msg>15a1b37e-2e4d-11e5-9284-b827eb9e62be<commit_after>15a1b37e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>d7420696-2e4d-11e5-9284-b827eb9e62be<commit_msg>d746fab6-2e4d-11e5-9284-b827eb9e62be<commit_after>d746fab6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>07b05d9c-2e4d-11e5-9284-b827eb9e62be<commit_msg>07b56954-2e4d-11e5-9284-b827eb9e62be<commit_after>07b56954-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>34b0a3f0-2e4e-11e5-9284-b827eb9e62be<commit_msg>34b5eb6c-2e4e-11e5-9284-b827eb9e62be<commit_after>34b5eb6c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>01c1e7c0-2e4d-11e5-9284-b827eb9e62be<commit_msg>01c6dbe0-2e4d-11e5-9284-b827eb9e62be<commit_after>01c6dbe0-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>38371a3a-2e4f-11e5-9284-b827eb9e62be<commit_msg>383c16a2-2e4f-11e5-9284-b827eb9e62be<commit_after>383c16a2-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>c843268a-2e4c-11e5-9284-b827eb9e62be<commit_msg>c8481596-2e4c-11e5-9284-b827eb9e62be<commit_after>c8481596-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>2e5fe6f6-2e4d-11e5-9284-b827eb9e62be<commit_msg>2e64dfee-2e4d-11e5-9284-b827eb9e62be<commit_after>2e64dfee-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>02d407ec-2e4d-11e5-9284-b827eb9e62be<commit_msg>02d9086e-2e4d-11e5-9284-b827eb9e62be<commit_after>02d9086e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>f00bde36-2e4d-11e5-9284-b827eb9e62be<commit_msg>f010d38c-2e4d-11e5-9284-b827eb9e62be<commit_after>f010d38c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>f68c1384-2e4d-11e5-9284-b827eb9e62be<commit_msg>f69106d2-2e4d-11e5-9284-b827eb9e62be<commit_after>f69106d2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>afca4bfa-2e4d-11e5-9284-b827eb9e62be<commit_msg>afcf4998-2e4d-11e5-9284-b827eb9e62be<commit_after>afcf4998-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>e40e943e-2e4d-11e5-9284-b827eb9e62be<commit_msg>e4139d80-2e4d-11e5-9284-b827eb9e62be<commit_after>e4139d80-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>cee57f5a-2e4d-11e5-9284-b827eb9e62be<commit_msg>ceea8644-2e4d-11e5-9284-b827eb9e62be<commit_after>ceea8644-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>ee86a374-2e4e-11e5-9284-b827eb9e62be<commit_msg>ee8be5b4-2e4e-11e5-9284-b827eb9e62be<commit_after>ee8be5b4-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>25cdd43a-2e4d-11e5-9284-b827eb9e62be<commit_msg>25d2d322-2e4d-11e5-9284-b827eb9e62be<commit_after>25d2d322-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>8e586e1a-2e4e-11e5-9284-b827eb9e62be<commit_msg>8e5d769e-2e4e-11e5-9284-b827eb9e62be<commit_after>8e5d769e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>96b2fe68-2e4e-11e5-9284-b827eb9e62be<commit_msg>96b80d7c-2e4e-11e5-9284-b827eb9e62be<commit_after>96b80d7c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>1903e220-2e4e-11e5-9284-b827eb9e62be<commit_msg>1908dea6-2e4e-11e5-9284-b827eb9e62be<commit_after>1908dea6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>2f714a94-2e4d-11e5-9284-b827eb9e62be<commit_msg>2f764b2a-2e4d-11e5-9284-b827eb9e62be<commit_after>2f764b2a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>4a9977e2-2e4d-11e5-9284-b827eb9e62be<commit_msg>4a9e88b8-2e4d-11e5-9284-b827eb9e62be<commit_after>4a9e88b8-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>a3244dec-2e4d-11e5-9284-b827eb9e62be<commit_msg>a32948a6-2e4d-11e5-9284-b827eb9e62be<commit_after>a32948a6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>d833417c-2e4e-11e5-9284-b827eb9e62be<commit_msg>d8383cae-2e4e-11e5-9284-b827eb9e62be<commit_after>d8383cae-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>a171679a-2e4e-11e5-9284-b827eb9e62be<commit_msg>a1765d86-2e4e-11e5-9284-b827eb9e62be<commit_after>a1765d86-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>1c708b24-2e4f-11e5-9284-b827eb9e62be<commit_msg>1c75942a-2e4f-11e5-9284-b827eb9e62be<commit_after>1c75942a-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>cd1a4a08-2e4c-11e5-9284-b827eb9e62be<commit_msg>cd1f3f0e-2e4c-11e5-9284-b827eb9e62be<commit_after>cd1f3f0e-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>a42cd952-2e4d-11e5-9284-b827eb9e62be<commit_msg>a431d524-2e4d-11e5-9284-b827eb9e62be<commit_after>a431d524-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>8da6cc42-2e4d-11e5-9284-b827eb9e62be<commit_msg>8dabd606-2e4d-11e5-9284-b827eb9e62be<commit_after>8dabd606-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>6d5ec520-2e4d-11e5-9284-b827eb9e62be<commit_msg>6d63d07e-2e4d-11e5-9284-b827eb9e62be<commit_after>6d63d07e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>cbc222e8-2e4c-11e5-9284-b827eb9e62be<commit_msg>cbc7d85a-2e4c-11e5-9284-b827eb9e62be<commit_after>cbc7d85a-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>def52994-2e4e-11e5-9284-b827eb9e62be<commit_msg>defa280e-2e4e-11e5-9284-b827eb9e62be<commit_after>defa280e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>2f967b64-2e4f-11e5-9284-b827eb9e62be<commit_msg>2f9b7560-2e4f-11e5-9284-b827eb9e62be<commit_after>2f9b7560-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>add9ad3a-2e4e-11e5-9284-b827eb9e62be<commit_msg>addea2b8-2e4e-11e5-9284-b827eb9e62be<commit_after>addea2b8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>040e53e0-2e4f-11e5-9284-b827eb9e62be<commit_msg>04134be8-2e4f-11e5-9284-b827eb9e62be<commit_after>04134be8-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2010 Sony Pictures Imageworks Inc., et al.\nAll Rights Reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\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 Sony Pictures Imageworks 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.\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\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(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 \"oslops.h\"\n#include \"oslexec_pvt.h\"\n\n\n#ifdef OSL_NAMESPACE\nnamespace OSL_NAMESPACE {\n#endif\nnamespace OSL {\nnamespace pvt {\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Notes on how messages work:\n\/\/\n\/\/ The messages are stored in a ParamValueList in the ShadingContext.\n\/\/ For simple types, just slurp them up into the PVL.\n\/\/\n\/\/ Closures are tricky because of the memory management and that PVL's\n\/\/ don't know anything about them. For those we allocate new closures\n\/\/ in the context's closure_msgs vector, and just store their indices in\n\/\/ the PVL.\n\/\/\n\/\/ FIXME -- setmessage only stores message values, not derivs, so\n\/\/ getmessage only retrieves the values and has zero derivs.\n\/\/ We should come back and fix this later.\n\/\/\n\/\/ FIXME -- I believe that if you try to set a message that is an array\n\/\/ of closures, it will only store the first element.  Also something to\n\/\/ come back to, not an emergency at the moment.\n\/\/\n\/\/ FIXME -- because we store closures by int index, there's an error\n\/\/ condition if a shader does a setmessage with a closure, then does a\n\/\/ getmessage of the same message name into int, or vice versa.  Instead\n\/\/ that should be a type mismatch and getmessage() should return 0.\n\n\n\n\/\/ void setmessage (string name, ANY value).\nDECLOP (OP_setmessage)\n{\n    ASSERT (nargs == 2);\n    Symbol &Name (exec->sym (args[0]));\n    Symbol &Val (exec->sym (args[1]));\n    ASSERT (Name.typespec().is_string());\n\n    VaryingRef<ustring> name ((ustring *)Name.data(), Name.step());\n    ParamValueList &messages (exec->context()->messages());\n    std::vector<ClosureColor> &closure_msgs (exec->context()->closure_msgs());\n\n    bool varying = (Name.is_varying() || Val.is_varying() ||\n                    ! exec->all_points_on());\n    TypeDesc type = Val.typespec().simpletype();\n    if (Val.typespec().is_closure ())\n        type = TypeDesc::TypeInt;     \/\/ Actually store closure indices only\n    size_t datasize = type.size();\n\n    ustring lastname;       \/\/ Last message name that we matched\n    ParamValue *p = NULL;   \/\/ Pointer to the PV for the message\n\n    for (int i = beginpoint;  i < endpoint;  ++i) {\n        if (runflags[i]) {\n            if (i == beginpoint || name[i] != lastname) {\n                \/\/ Different message than last time -- search anew\n                p = NULL;\n                for (size_t m = 0;  m < messages.size() && !p;  ++m)\n                    if (messages[m].name() == name[i] &&\n                          messages[m].type() == type)\n                        p = &messages[m];\n                \/\/ If the message doesn't already exist, create it\n                if (! p) {\n                    p = & messages.grow ();\n                    p->init (name[i], type,\n                             varying ? exec->npoints() : 1, NULL);\n                }\n                lastname = name[i];\n            }\n\n            \/\/ Copy the data\n            DASSERT (p != NULL);\n            char *msgdata = (char *)p->data() + varying*datasize*i;\n            if (Val.typespec().is_closure()) {\n                \/\/ Add the closure data to the end of the closure messages\n                closure_msgs.push_back (**(ClosureColor **)Val.data(i));\n                \/\/ and store its index in the PVL\n                *(int *)msgdata = (int)closure_msgs.size() - 1;\n            } else {\n                \/\/ Non-closure types, just memcpy\n                memcpy (msgdata, Val.data(i), datasize);\n            }\n        }\n        if (! varying)\n            break;      \/\/ Non-uniform case can take early out\n    }\n}\n\n\n\n\/\/ int getmessage (string name, ANY value)\nDECLOP (OP_getmessage)\n{\n    ASSERT (nargs == 3);\n    Symbol &Result (exec->sym (args[0]));\n    Symbol &Name (exec->sym (args[1]));\n    Symbol &Val (exec->sym (args[2]));\n    ASSERT (Result.typespec().is_int() && Name.typespec().is_string());\n\n    bool varying = (Name.is_varying());\n    exec->adjust_varying (Result, varying);\n    exec->adjust_varying (Val, varying);\n    varying |= Result.is_varying();  \/\/ adjust in case we're in a conditional\n\n    VaryingRef<int> result ((int *)Result.data(), Result.step());\n    VaryingRef<ustring> name ((ustring *)Name.data(), Name.step());\n    ParamValueList &messages (exec->context()->messages());\n    std::vector<ClosureColor> &closure_msgs (exec->context()->closure_msgs());\n\n    TypeDesc type = Val.typespec().simpletype();\n    if (Val.typespec().is_closure ())\n        type = TypeDesc::TypeInt;     \/\/ Actually store closure indices only\n    size_t datasize = type.size();\n\n    ustring lastname;       \/\/ Last message name that we matched\n    ParamValue *p = NULL;   \/\/ Pointer to the PV for the message\n\n    for (int i = beginpoint;  i < endpoint;  ++i) {\n        if (runflags[i]) {\n            if (i == beginpoint || name[i] != lastname) {\n                \/\/ Different message than last time -- search anew\n                p = NULL;\n                for (size_t m = 0;  m < messages.size() && !p;  ++m)\n                    if (messages[m].name() == name[i] &&\n                          messages[m].type() == type)\n                        p = &messages[m];\n                if (p && (! varying || Val.is_uniform()) && p->nvalues() > 1) {\n                    \/\/ all the parameters to the function were uniform,\n                    \/\/ but the message itself is varying, so adjust Val.\n                    exec->adjust_varying (Val, true);\n                    varying = true;\n                }\n                lastname = name[i];\n            }\n\n            if (p) {\n                result[i] = 1;   \/\/ found\n                char *msgdata = (char *)p->data() + varying*datasize*i;\n                if (Val.typespec().is_closure()) {\n                    \/\/ Retrieve the closure index from the PVL\n                    int index = *(int *)msgdata;\n                    ClosureColor *valclose = *(ClosureColor **) Val.data(i);\n                    \/\/ then copy the closure (or clear it, if out of range)\n                    if (index < (int)closure_msgs.size())\n                        *valclose = closure_msgs.back();\n                    else\n                        valclose->clear ();\n                } else {\n                    memcpy (Val.data(i), msgdata, datasize);\n                }\n            } else {\n                result[i] = 0;   \/\/ not found\n            }\n        }\n        if (! varying)\n            break;      \/\/ Non-uniform case can take early out\n    }\n\n    if (Val.has_derivs ())\n        exec->zero_derivs (Val);\n}\n\n\n\n}; \/\/ namespace pvt\n}; \/\/ namespace OSL\n#ifdef OSL_NAMESPACE\n}; \/\/ end namespace OSL_NAMESPACE\n#endif\n<commit_msg>Fixed a bad reference to closure messages<commit_after>\/*\nCopyright (c) 2010 Sony Pictures Imageworks Inc., et al.\nAll Rights Reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\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 Sony Pictures Imageworks 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.\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\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(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 \"oslops.h\"\n#include \"oslexec_pvt.h\"\n\n\n#ifdef OSL_NAMESPACE\nnamespace OSL_NAMESPACE {\n#endif\nnamespace OSL {\nnamespace pvt {\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Notes on how messages work:\n\/\/\n\/\/ The messages are stored in a ParamValueList in the ShadingContext.\n\/\/ For simple types, just slurp them up into the PVL.\n\/\/\n\/\/ Closures are tricky because of the memory management and that PVL's\n\/\/ don't know anything about them. For those we allocate new closures\n\/\/ in the context's closure_msgs vector, and just store their indices in\n\/\/ the PVL.\n\/\/\n\/\/ FIXME -- setmessage only stores message values, not derivs, so\n\/\/ getmessage only retrieves the values and has zero derivs.\n\/\/ We should come back and fix this later.\n\/\/\n\/\/ FIXME -- I believe that if you try to set a message that is an array\n\/\/ of closures, it will only store the first element.  Also something to\n\/\/ come back to, not an emergency at the moment.\n\/\/\n\/\/ FIXME -- because we store closures by int index, there's an error\n\/\/ condition if a shader does a setmessage with a closure, then does a\n\/\/ getmessage of the same message name into int, or vice versa.  Instead\n\/\/ that should be a type mismatch and getmessage() should return 0.\n\n\n\n\/\/ void setmessage (string name, ANY value).\nDECLOP (OP_setmessage)\n{\n    ASSERT (nargs == 2);\n    Symbol &Name (exec->sym (args[0]));\n    Symbol &Val (exec->sym (args[1]));\n    ASSERT (Name.typespec().is_string());\n\n    VaryingRef<ustring> name ((ustring *)Name.data(), Name.step());\n    ParamValueList &messages (exec->context()->messages());\n    std::vector<ClosureColor> &closure_msgs (exec->context()->closure_msgs());\n\n    bool varying = (Name.is_varying() || Val.is_varying() ||\n                    ! exec->all_points_on());\n    TypeDesc type = Val.typespec().simpletype();\n    if (Val.typespec().is_closure ())\n        type = TypeDesc::TypeInt;     \/\/ Actually store closure indices only\n    size_t datasize = type.size();\n\n    ustring lastname;       \/\/ Last message name that we matched\n    ParamValue *p = NULL;   \/\/ Pointer to the PV for the message\n\n    for (int i = beginpoint;  i < endpoint;  ++i) {\n        if (runflags[i]) {\n            if (i == beginpoint || name[i] != lastname) {\n                \/\/ Different message than last time -- search anew\n                p = NULL;\n                for (size_t m = 0;  m < messages.size() && !p;  ++m)\n                    if (messages[m].name() == name[i] &&\n                          messages[m].type() == type)\n                        p = &messages[m];\n                \/\/ If the message doesn't already exist, create it\n                if (! p) {\n                    p = & messages.grow ();\n                    p->init (name[i], type,\n                             varying ? exec->npoints() : 1, NULL);\n                }\n                lastname = name[i];\n            }\n\n            \/\/ Copy the data\n            DASSERT (p != NULL);\n            char *msgdata = (char *)p->data() + varying*datasize*i;\n            if (Val.typespec().is_closure()) {\n                \/\/ Add the closure data to the end of the closure messages\n                closure_msgs.push_back (**(ClosureColor **)Val.data(i));\n                \/\/ and store its index in the PVL\n                *(int *)msgdata = (int)closure_msgs.size() - 1;\n            } else {\n                \/\/ Non-closure types, just memcpy\n                memcpy (msgdata, Val.data(i), datasize);\n            }\n        }\n        if (! varying)\n            break;      \/\/ Non-uniform case can take early out\n    }\n}\n\n\n\n\/\/ int getmessage (string name, ANY value)\nDECLOP (OP_getmessage)\n{\n    ASSERT (nargs == 3);\n    Symbol &Result (exec->sym (args[0]));\n    Symbol &Name (exec->sym (args[1]));\n    Symbol &Val (exec->sym (args[2]));\n    ASSERT (Result.typespec().is_int() && Name.typespec().is_string());\n\n    bool varying = (Name.is_varying());\n    exec->adjust_varying (Result, varying);\n    exec->adjust_varying (Val, varying);\n    varying |= Result.is_varying();  \/\/ adjust in case we're in a conditional\n\n    VaryingRef<int> result ((int *)Result.data(), Result.step());\n    VaryingRef<ustring> name ((ustring *)Name.data(), Name.step());\n    ParamValueList &messages (exec->context()->messages());\n    std::vector<ClosureColor> &closure_msgs (exec->context()->closure_msgs());\n\n    TypeDesc type = Val.typespec().simpletype();\n    if (Val.typespec().is_closure ())\n        type = TypeDesc::TypeInt;     \/\/ Actually store closure indices only\n    size_t datasize = type.size();\n\n    ustring lastname;       \/\/ Last message name that we matched\n    ParamValue *p = NULL;   \/\/ Pointer to the PV for the message\n\n    for (int i = beginpoint;  i < endpoint;  ++i) {\n        if (runflags[i]) {\n            if (i == beginpoint || name[i] != lastname) {\n                \/\/ Different message than last time -- search anew\n                p = NULL;\n                for (size_t m = 0;  m < messages.size() && !p;  ++m)\n                    if (messages[m].name() == name[i] &&\n                          messages[m].type() == type)\n                        p = &messages[m];\n                if (p && (! varying || Val.is_uniform()) && p->nvalues() > 1) {\n                    \/\/ all the parameters to the function were uniform,\n                    \/\/ but the message itself is varying, so adjust Val.\n                    exec->adjust_varying (Val, true);\n                    varying = true;\n                }\n                lastname = name[i];\n            }\n\n            if (p) {\n                result[i] = 1;   \/\/ found\n                char *msgdata = (char *)p->data() + varying*datasize*i;\n                if (Val.typespec().is_closure()) {\n                    \/\/ Retrieve the closure index from the PVL\n                    int index = *(int *)msgdata;\n                    ClosureColor *valclose = *(ClosureColor **) Val.data(i);\n                    \/\/ then copy the closure (or clear it, if out of range)\n                    if (index < (int)closure_msgs.size())\n                        *valclose = closure_msgs[index];\n                    else\n                        valclose->clear ();\n                } else {\n                    memcpy (Val.data(i), msgdata, datasize);\n                }\n            } else {\n                result[i] = 0;   \/\/ not found\n            }\n        }\n        if (! varying)\n            break;      \/\/ Non-uniform case can take early out\n    }\n\n    if (Val.has_derivs ())\n        exec->zero_derivs (Val);\n}\n\n\n\n}; \/\/ namespace pvt\n}; \/\/ namespace OSL\n#ifdef OSL_NAMESPACE\n}; \/\/ end namespace OSL_NAMESPACE\n#endif\n<|endoftext|>"}
{"text":"<commit_before>62f59bf4-2e4d-11e5-9284-b827eb9e62be<commit_msg>62faef50-2e4d-11e5-9284-b827eb9e62be<commit_after>62faef50-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>968cc29e-2e4d-11e5-9284-b827eb9e62be<commit_msg>9691bf74-2e4d-11e5-9284-b827eb9e62be<commit_after>9691bf74-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>cf7c25f0-2e4c-11e5-9284-b827eb9e62be<commit_msg>cf811e7a-2e4c-11e5-9284-b827eb9e62be<commit_after>cf811e7a-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>cb2e5a58-2e4d-11e5-9284-b827eb9e62be<commit_msg>cb3350a8-2e4d-11e5-9284-b827eb9e62be<commit_after>cb3350a8-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>1165c2fa-2e4d-11e5-9284-b827eb9e62be<commit_msg>116ab8a0-2e4d-11e5-9284-b827eb9e62be<commit_after>116ab8a0-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>6e2c3ab4-2e4d-11e5-9284-b827eb9e62be<commit_msg>6e314d74-2e4d-11e5-9284-b827eb9e62be<commit_after>6e314d74-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>778904f2-2e4d-11e5-9284-b827eb9e62be<commit_msg>778dfaa2-2e4d-11e5-9284-b827eb9e62be<commit_after>778dfaa2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"}
{"text":"<commit_before>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\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* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include \"stdafx.h\"\n\n#include <atltime.h>\n#include \"ext\/rho\/rhoruby.h\"\n#include \"..\/MainWindow.h\"\n#include \"Camera.h\"\n#include \"common\/RhodesApp.h\"\n\n#ifdef _MSC_VER\n\/\/ warning C4800: 'int' : forcing to bool 'true' or 'false' (performance warning)\n#pragma warning ( disable : 4800 )\n#endif\n\nextern \"C\" HWND getMainWnd();\n\n\/\/#if defined(_WIN32_WCE)\n\nstatic bool copy_file(LPTSTR from, LPTSTR to);\nstatic LPTSTR get_file_name(LPTSTR from, LPTSTR to);\nstatic LPTSTR generate_filename(LPTSTR filename, LPCTSTR szExt );\nstatic void create_folder(LPTSTR Path);\n\nIMPLEMENT_LOGCLASS(Camera,\"Camera\");\n\nCamera::Camera(void) {\n}\n\nCamera::~Camera(void) {\n}\n\nHRESULT Camera::takePicture(HWND hwndOwner,LPTSTR pszFilename) \n{\n    HRESULT         hResult = S_OK;\n#if defined(_WIN32_WCE) && !defined( OS_PLATFORM_MOTCE )\n    SHCAMERACAPTURE shcc;\n\n    StringW root;\n    convertToStringW(rho_rhodesapp_getblobsdirpath(), root);\n    wsprintf( pszFilename, L\"%s\", root.c_str() );\n\n\tcreate_folder(pszFilename);\n\n    \/\/LPCTSTR szExt = wcsrchr(pszFilename, '.');\n    TCHAR filename[256];\n\tgenerate_filename(filename,L\".jpg\");\n\n    \/\/ Set the SHCAMERACAPTURE structure.\n    ZeroMemory(&shcc, sizeof(shcc));\n    shcc.cbSize             = sizeof(shcc);\n    shcc.hwndOwner          = hwndOwner;\n    shcc.pszInitialDir      = pszFilename;\n    shcc.pszDefaultFileName = filename;\n    shcc.pszTitle           = TEXT(\"Camera\");\n    shcc.VideoTypes\t\t\t= CAMERACAPTURE_VIDEOTYPE_MESSAGING;\n    shcc.nResolutionWidth   = 176;\n    shcc.nResolutionHeight  = 144;\n    shcc.nVideoTimeLimit    = 15;\n    shcc.Mode               = CAMERACAPTURE_MODE_STILL;\n\n    \/\/ Display the Camera Capture dialog.\n    hResult = SHCameraCapture(&shcc);\n\n    \/\/ The next statements will execute only after the user takes\n    \/\/ a picture or video, or closes the Camera Capture dialog.\n    if (S_OK == hResult) {\n        LPTSTR fname = get_file_name(shcc.szFile,pszFilename);\n\t\tif (fname) {\n\t\t\tStringCchCopy(pszFilename, MAX_PATH, fname);\n\t\t\tfree(fname);\n\t\t} else {\n            LOG(ERROR) + \"takePicture error get file: \" + shcc.szFile;\n\n\t\t\thResult = E_INVALIDARG;\n\t\t}\n    }else\n    {\n        LOG(ERROR) + \"takePicture failed with code: \" + LOGFMT(\"0x%X\") + hResult;\n    }\n#endif \/\/_WIN32_WCE\n\n    return hResult;\n}\n\nHRESULT Camera::selectPicture(HWND hwndOwner,LPTSTR pszFilename) \n{\n\tRHO_ASSERT(pszFilename);\n#if defined( _WIN32_WCE ) && !defined( OS_PLATFORM_MOTCE )\n\tOPENFILENAMEEX ofn = {0};\n#else\n    OPENFILENAME ofn = {0};\n#endif\n    pszFilename[0] = 0;\n\n\tofn.lStructSize     = sizeof(ofn);\n\tofn.lpstrFilter     = NULL;\n\tofn.lpstrFile       = pszFilename;\n\tofn.nMaxFile        = MAX_PATH;\n\tofn.lpstrInitialDir = NULL;\n\tofn.lpstrTitle      = _T(\"Select an image\");\n#if defined( _WIN32_WCE ) && !defined( OS_PLATFORM_MOTCE )\n\tofn.ExFlags         = OFN_EXFLAG_THUMBNAILVIEW|OFN_EXFLAG_NOFILECREATE|OFN_EXFLAG_LOCKDIRECTORY;\n    if (GetOpenFileNameEx(&ofn))\n#else\n    if (GetOpenFileName(&ofn))\n#endif\n\n    {\n\t\tHRESULT hResult = S_OK;\n\n        \/*\n\t\tTCHAR rhoroot[MAX_PATH];\n\t\twchar_t* root  = wce_mbtowc(rho_rhodesapp_getblobsdirpath());\n\t\twsprintf(rhoroot,L\"%s\",root);\n\t\tfree(root);\n\n\t\tcreate_folder(rhoroot);*\/\n\n        StringW strBlobRoot = convertToStringW( RHODESAPP().getBlobsDirPath() );\n\n        LPCTSTR szExt = wcsrchr(pszFilename, '.');\n\t\tTCHAR filename[256];\n\t\tgenerate_filename(filename, szExt);\n\t\t\n\t\tint len = strBlobRoot.length() + wcslen(L\"\\\\\") + wcslen(filename);\n\t\twchar_t* full_name = (wchar_t*) malloc((len+2)*sizeof(wchar_t));\n\t\twsprintf(full_name,L\"%s\\\\%s\",strBlobRoot.c_str(),filename);\n\n\t\tif (copy_file(pszFilename,full_name)) \n        {\n\t\t\twcscpy( pszFilename, filename );\n\t\t} else {\n\t\t\thResult = E_INVALIDARG;\n\t\t}\n\n\t\tfree(full_name);\n\n\t\treturn hResult;\n\t} else if (GetLastError()==ERROR_SUCCESS) {\n\t\treturn S_FALSE; \/\/user cancel op\n\t}\n\treturn E_INVALIDARG;\n}\n\nbool copy_file(LPTSTR from, LPTSTR to) \n{\n\tRHO_ASSERT(from);\n\tRHO_ASSERT(to);\n\/*\n\tSHFILEOPSTRUCT SHFileOp;\n\tATL::CString source(from);\n\tATL::CString destination(to);\n\n\t\/\/ add required string terminators\n\tsource+=_T(\"\\0\\0\");\n\tdestination+=_T(\"\\0\\0\");\n\n\t\/\/ set up File Operation structure\n\tZeroMemory(&SHFileOp, sizeof(SHFILEOPSTRUCT));\n\tSHFileOp.hwnd = NULL;\n\tSHFileOp.wFunc = FO_COPY;\n\tSHFileOp.pFrom = source;\n\tSHFileOp.pTo = destination;\n\tSHFileOp.fFlags = FOF_SILENT | FOF_NOCONFIRMATION | FOF_NOCONFIRMMKDIR;\n*\/\n\t\/\/if(SHFileOperation(&SHFileOp) != 0) {\n    if ( !CopyFile(from, to, TRUE) )\n    {\n        DWORD dwErr = GetLastError();\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nLPTSTR get_file_name(LPTSTR from, LPTSTR to) {\n\tint len = wcslen(to);\n\tif (wcsncmp(to,from,len)==0) {\n\t\tLPTSTR fname = from+len;\n\t\tif ( (wcsncmp(L\"\\\\\",fname,1)==0) || \n\t\t\t (wcsncmp(L\"\/\",fname,1)==0) ) {\n\t\t\tfname++;\n\t\t}\n\t\tlen = wcslen(fname);\n\t\twchar_t* name = (wchar_t*) malloc(len*sizeof(wchar_t)+1);\n\t\twcscpy(name,fname);\n\t\treturn name;\n\t} else {\n\t\treturn NULL;\n\t}\n}\n\nLPTSTR generate_filename(LPTSTR filename, LPCTSTR szExt) {\n\tRHO_ASSERT(filename);\n\n\tCTime time(CTime::GetCurrentTime());\n\ttm tl, tg;\n\ttime.GetLocalTm(&tl);\n\ttime.GetGmtTm(&tg);\n\tint tz = tl.tm_hour-tg.tm_hour; \/\/TBD: fix tz\n\n    wsprintf(filename, L\"Image_%02i-%02i-%0004i_%02i.%02i.%02i_%c%03i%s\", \n\t\ttg.tm_mon, tg.tm_mday, 1900+tg.tm_year, tg.tm_hour, tg.tm_min, tg.tm_sec,  \n        tz>0?'_':'-',abs(tz),(szExt?szExt:L\"\"));\n\n\treturn filename;\n}\n\nvoid create_folder(LPTSTR Path)\n{\n\tTCHAR DirName[256];\n\tLPTSTR p = Path;\n\tLPTSTR q = DirName; \n\twhile(*p)\n\t{\n\t\tif (('\\\\' == *p) || ('\/' == *p))\n\t\t{\n\t\t\tif (':' != *(p-1))\n\t\t\t{\n\t\t\t\tCreateDirectory(DirName, NULL);\n\t\t\t}\n\t\t}\n\t\t*q++ = *p++;\n\t\t*q = '\\0';\n\t}\n\tCreateDirectory(DirName, NULL);\n}\n\n\/\/#endif \/\/_WIN32_WCE\n\nvoid choose_picture(char* callback_url, rho_param *options_hash) {\n\/\/#if defined(_WIN32_WCE)\n\tHWND main_wnd = getMainWnd();\n\t::PostMessage(main_wnd,WM_SELECTPICTURE,0,(LPARAM)strdup(callback_url));\n\/\/#endif\n}\n\nvoid take_picture(char* callback_url, rho_param * options_hash) {\n\tHWND main_wnd = getMainWnd();\n\t::PostMessage(main_wnd,WM_TAKEPICTURE,0,(LPARAM)strdup(callback_url));\n}\n\nVALUE get_camera_info(const char* camera_type) {\n     return rho_ruby_get_NIL();\n}\n<commit_msg>wm: fix choose picture<commit_after>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\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* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include \"stdafx.h\"\n\n#include <atltime.h>\n#include \"ext\/rho\/rhoruby.h\"\n#include \"..\/MainWindow.h\"\n#include \"Camera.h\"\n#include \"common\/RhodesApp.h\"\n\n#ifdef _MSC_VER\n\/\/ warning C4800: 'int' : forcing to bool 'true' or 'false' (performance warning)\n#pragma warning ( disable : 4800 )\n#endif\n\nextern \"C\" HWND getMainWnd();\n\n\/\/#if defined(_WIN32_WCE)\n\nstatic bool copy_file(LPTSTR from, LPTSTR to);\nstatic LPTSTR get_file_name(LPTSTR from, LPTSTR to);\nstatic LPTSTR generate_filename(LPTSTR filename, LPCTSTR szExt );\nstatic void create_folder(LPTSTR Path);\n\nIMPLEMENT_LOGCLASS(Camera,\"Camera\");\n\nCamera::Camera(void) {\n}\n\nCamera::~Camera(void) {\n}\n\nHRESULT Camera::takePicture(HWND hwndOwner,LPTSTR pszFilename) \n{\n    HRESULT         hResult = S_OK;\n#if defined(_WIN32_WCE) && !defined( OS_PLATFORM_MOTCE )\n    SHCAMERACAPTURE shcc;\n\n    StringW root;\n    convertToStringW(rho_rhodesapp_getblobsdirpath(), root);\n    wsprintf( pszFilename, L\"%s\", root.c_str() );\n\n\tcreate_folder(pszFilename);\n\n    \/\/LPCTSTR szExt = wcsrchr(pszFilename, '.');\n    TCHAR filename[256];\n\tgenerate_filename(filename,L\".jpg\");\n\n    \/\/ Set the SHCAMERACAPTURE structure.\n    ZeroMemory(&shcc, sizeof(shcc));\n    shcc.cbSize             = sizeof(shcc);\n    shcc.hwndOwner          = hwndOwner;\n    shcc.pszInitialDir      = pszFilename;\n    shcc.pszDefaultFileName = filename;\n    shcc.pszTitle           = TEXT(\"Camera\");\n    shcc.VideoTypes\t\t\t= CAMERACAPTURE_VIDEOTYPE_MESSAGING;\n    shcc.nResolutionWidth   = 176;\n    shcc.nResolutionHeight  = 144;\n    shcc.nVideoTimeLimit    = 15;\n    shcc.Mode               = CAMERACAPTURE_MODE_STILL;\n\n    \/\/ Display the Camera Capture dialog.\n    hResult = SHCameraCapture(&shcc);\n\n    \/\/ The next statements will execute only after the user takes\n    \/\/ a picture or video, or closes the Camera Capture dialog.\n    if (S_OK == hResult) {\n        LPTSTR fname = get_file_name(shcc.szFile,pszFilename);\n\t\tif (fname) {\n\t\t\tStringCchCopy(pszFilename, MAX_PATH, fname);\n\t\t\tfree(fname);\n\t\t} else {\n            LOG(ERROR) + \"takePicture error get file: \" + shcc.szFile;\n\n\t\t\thResult = E_INVALIDARG;\n\t\t}\n    }else\n    {\n        LOG(ERROR) + \"takePicture failed with code: \" + LOGFMT(\"0x%X\") + hResult;\n    }\n#endif \/\/_WIN32_WCE\n\n    return hResult;\n}\n\nHRESULT Camera::selectPicture(HWND hwndOwner,LPTSTR pszFilename) \n{\n\tRHO_ASSERT(pszFilename);\n#if defined( _WIN32_WCE ) && !defined( OS_PLATFORM_MOTCE )\n\tOPENFILENAMEEX ofn = {0};\n#else\n    OPENFILENAME ofn = {0};\n#endif\n    pszFilename[0] = 0;\n\n\tofn.lStructSize     = sizeof(ofn);\n    ofn.hwndOwner       = hwndOwner;\n\tofn.lpstrFilter     = NULL;\n\tofn.lpstrFile       = pszFilename;\n\tofn.nMaxFile        = MAX_PATH;\n\tofn.lpstrInitialDir = NULL;\n\tofn.lpstrTitle      = _T(\"Select an image\");\n#if defined( _WIN32_WCE ) && !defined( OS_PLATFORM_MOTCE )\n\tofn.ExFlags         = OFN_EXFLAG_THUMBNAILVIEW|OFN_EXFLAG_NOFILECREATE|OFN_EXFLAG_LOCKDIRECTORY;\n    if (GetOpenFileNameEx(&ofn))\n#else\n    if (GetOpenFileName(&ofn))\n#endif\n\n    {\n\t\tHRESULT hResult = S_OK;\n\n        \/*\n\t\tTCHAR rhoroot[MAX_PATH];\n\t\twchar_t* root  = wce_mbtowc(rho_rhodesapp_getblobsdirpath());\n\t\twsprintf(rhoroot,L\"%s\",root);\n\t\tfree(root);\n\n\t\tcreate_folder(rhoroot);*\/\n\n        StringW strBlobRoot = convertToStringW( RHODESAPP().getBlobsDirPath() );\n\n        LPCTSTR szExt = wcsrchr(pszFilename, '.');\n\t\tTCHAR filename[256];\n\t\tgenerate_filename(filename, szExt);\n\t\t\n\t\tint len = strBlobRoot.length() + wcslen(L\"\\\\\") + wcslen(filename);\n\t\twchar_t* full_name = (wchar_t*) malloc((len+2)*sizeof(wchar_t));\n\t\twsprintf(full_name,L\"%s\\\\%s\",strBlobRoot.c_str(),filename);\n\n\t\tif (copy_file(pszFilename,full_name)) \n        {\n\t\t\twcscpy( pszFilename, filename );\n\t\t} else {\n\t\t\thResult = E_INVALIDARG;\n\t\t}\n\n\t\tfree(full_name);\n\n\t\treturn hResult;\n\t} else if (GetLastError()==ERROR_SUCCESS) {\n\t\treturn S_FALSE; \/\/user cancel op\n\t}\n\treturn E_INVALIDARG;\n}\n\nbool copy_file(LPTSTR from, LPTSTR to) \n{\n\tRHO_ASSERT(from);\n\tRHO_ASSERT(to);\n\/*\n\tSHFILEOPSTRUCT SHFileOp;\n\tATL::CString source(from);\n\tATL::CString destination(to);\n\n\t\/\/ add required string terminators\n\tsource+=_T(\"\\0\\0\");\n\tdestination+=_T(\"\\0\\0\");\n\n\t\/\/ set up File Operation structure\n\tZeroMemory(&SHFileOp, sizeof(SHFILEOPSTRUCT));\n\tSHFileOp.hwnd = NULL;\n\tSHFileOp.wFunc = FO_COPY;\n\tSHFileOp.pFrom = source;\n\tSHFileOp.pTo = destination;\n\tSHFileOp.fFlags = FOF_SILENT | FOF_NOCONFIRMATION | FOF_NOCONFIRMMKDIR;\n*\/\n\t\/\/if(SHFileOperation(&SHFileOp) != 0) {\n    if ( !CopyFile(from, to, TRUE) )\n    {\n        DWORD dwErr = GetLastError();\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nLPTSTR get_file_name(LPTSTR from, LPTSTR to) {\n\tint len = wcslen(to);\n\tif (wcsncmp(to,from,len)==0) {\n\t\tLPTSTR fname = from+len;\n\t\tif ( (wcsncmp(L\"\\\\\",fname,1)==0) || \n\t\t\t (wcsncmp(L\"\/\",fname,1)==0) ) {\n\t\t\tfname++;\n\t\t}\n\t\tlen = wcslen(fname);\n\t\twchar_t* name = (wchar_t*) malloc(len*sizeof(wchar_t)+1);\n\t\twcscpy(name,fname);\n\t\treturn name;\n\t} else {\n\t\treturn NULL;\n\t}\n}\n\nLPTSTR generate_filename(LPTSTR filename, LPCTSTR szExt) {\n\tRHO_ASSERT(filename);\n\n\tCTime time(CTime::GetCurrentTime());\n\ttm tl, tg;\n\ttime.GetLocalTm(&tl);\n\ttime.GetGmtTm(&tg);\n\tint tz = tl.tm_hour-tg.tm_hour; \/\/TBD: fix tz\n\n    wsprintf(filename, L\"Image_%02i-%02i-%0004i_%02i.%02i.%02i_%c%03i%s\", \n\t\ttg.tm_mon, tg.tm_mday, 1900+tg.tm_year, tg.tm_hour, tg.tm_min, tg.tm_sec,  \n        tz>0?'_':'-',abs(tz),(szExt?szExt:L\"\"));\n\n\treturn filename;\n}\n\nvoid create_folder(LPTSTR Path)\n{\n\tTCHAR DirName[256];\n\tLPTSTR p = Path;\n\tLPTSTR q = DirName; \n\twhile(*p)\n\t{\n\t\tif (('\\\\' == *p) || ('\/' == *p))\n\t\t{\n\t\t\tif (':' != *(p-1))\n\t\t\t{\n\t\t\t\tCreateDirectory(DirName, NULL);\n\t\t\t}\n\t\t}\n\t\t*q++ = *p++;\n\t\t*q = '\\0';\n\t}\n\tCreateDirectory(DirName, NULL);\n}\n\n\/\/#endif \/\/_WIN32_WCE\n\nvoid choose_picture(char* callback_url, rho_param *options_hash) {\n\/\/#if defined(_WIN32_WCE)\n\tHWND main_wnd = getMainWnd();\n\t::PostMessage(main_wnd,WM_SELECTPICTURE,0,(LPARAM)strdup(callback_url));\n\/\/#endif\n}\n\nvoid take_picture(char* callback_url, rho_param * options_hash) {\n\tHWND main_wnd = getMainWnd();\n\t::PostMessage(main_wnd,WM_TAKEPICTURE,0,(LPARAM)strdup(callback_url));\n}\n\nVALUE get_camera_info(const char* camera_type) {\n     return rho_ruby_get_NIL();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"follow_me_impl.h\"\n#include \"system.h\"\n#include \"global_include.h\"\n#include \"px4_custom_mode.h\"\n\nnamespace dronecode_sdk {\n\nusing namespace std::placeholders; \/\/ for `_1`\n\nFollowMeImpl::FollowMeImpl(System &system) : PluginImplBase(system)\n{\n    \/\/ (Lat, Lon, Alt) => double, (vx, vy, vz) => float\n    _last_location = _target_location =\n        FollowMe::TargetLocation{double(NAN), double(NAN), double(NAN), NAN, NAN, NAN};\n    _parent->register_plugin(this);\n}\n\nFollowMeImpl::~FollowMeImpl()\n{\n    _parent->unregister_plugin(this);\n}\n\nvoid FollowMeImpl::init()\n{\n    _parent->register_mavlink_message_handler(MAVLINK_MSG_ID_HEARTBEAT,\n                                              std::bind(&FollowMeImpl::process_heartbeat, this, _1),\n                                              static_cast<void *>(this));\n}\n\nvoid FollowMeImpl::deinit()\n{\n    _parent->unregister_all_mavlink_message_handlers(this);\n}\n\nvoid FollowMeImpl::enable()\n{\n    _parent->get_param_float_async(\"NAV_MIN_FT_HT\", [this](bool success, float value) {\n        if (success) {\n            _config.min_height_m = value;\n        }\n    });\n    _parent->get_param_float_async(\"NAV_FT_DST\", [this](bool success, float value) {\n        if (success) {\n            _config.follow_distance_m = value;\n        }\n    });\n    _parent->get_param_int_async(\"NAV_FT_FS\", [this](bool success, int32_t value) {\n        if (success) {\n            _config.follow_direction = static_cast<FollowMe::Config::FollowDirection>(value);\n        }\n    });\n    _parent->get_param_float_async(\"NAV_FT_RS\", [this](bool success, float value) {\n        if (success) {\n            _config.responsiveness = value;\n        }\n    });\n}\n\nvoid FollowMeImpl::disable()\n{\n    stop_sending_target_location();\n}\n\nconst FollowMe::Config &FollowMeImpl::get_config() const\n{\n    return _config;\n}\n\nFollowMe::Result FollowMeImpl::set_config(const FollowMe::Config &config)\n{\n    \/\/ Valdidate configuration\n    if (!is_config_ok(config)) {\n        LogErr() << debug_str << \"set_config() failed. Last configuration is preserved.\";\n        return FollowMe::Result::SET_CONFIG_FAILED;\n    }\n\n    auto height = config.min_height_m;\n    auto distance = config.follow_distance_m;\n    int32_t direction = static_cast<int32_t>(config.follow_direction);\n    auto responsiveness = config.responsiveness;\n\n    LogDebug() << \"Waiting for the system confirmation of the new configuration..\";\n\n    bool success = true;\n\n    \/\/ Send configuration to Vehicle\n    if (_config.min_height_m != height) {\n        if (_parent->set_param_float(\"NAV_MIN_FT_HT\", height)) {\n            _config.min_height_m = height;\n        } else {\n            success = false;\n        }\n    }\n    if (_config.follow_distance_m != distance) {\n        if (_parent->set_param_float(\"NAV_FT_DST\", distance)) {\n            _config.follow_distance_m = distance;\n        } else {\n            success = false;\n        }\n    }\n    if (_config.follow_direction != config.follow_direction) {\n        if (_parent->set_param_int(\"NAV_FT_FS\", direction)) {\n            _config.follow_direction = static_cast<FollowMe::Config::FollowDirection>(direction);\n\n        } else {\n            success = false;\n        }\n    }\n    if (_config.responsiveness != responsiveness) {\n        if (_parent->set_param_float(\"NAV_FT_RS\", responsiveness)) {\n            _config.responsiveness = responsiveness;\n        } else {\n            success = false;\n        }\n    }\n\n    return (success ? FollowMe::Result::SUCCESS : FollowMe::Result::SET_CONFIG_FAILED);\n}\n\nvoid FollowMeImpl::set_target_location(const FollowMe::TargetLocation &location)\n{\n    _mutex.lock();\n    _target_location = location;\n    \/\/ We're interested only in lat, long.\n    _estimatation_capabilities |= (1 << static_cast<int>(EstimationCapabilites::POS));\n\n    if (_mode != Mode::ACTIVE) {\n        _mutex.unlock();\n        return;\n    }\n    \/\/ If set already, reschedule it.\n    if (_target_location_cookie) {\n        _parent->reset_call_every(_target_location_cookie);\n        _target_location_cookie = nullptr;\n    } else {\n        \/\/ Regiter now for sending in the next cycle.\n        _parent->add_call_every(\n            [this]() { send_target_location(); }, SENDER_RATE, &_target_location_cookie);\n    }\n    _mutex.unlock();\n\n    \/\/ Send it immediately for now.\n    send_target_location();\n}\n\nconst FollowMe::TargetLocation &FollowMeImpl::get_last_location() const\n{\n    std::lock_guard<std::mutex> lock(_mutex);\n    return _last_location;\n}\n\nbool FollowMeImpl::is_active() const\n{\n    std::lock_guard<std::mutex> lock(_mutex);\n    return _mode == Mode::ACTIVE;\n}\n\nFollowMe::Result FollowMeImpl::start()\n{\n    FollowMe::Result result =\n        to_follow_me_result(_parent->set_flight_mode(SystemImpl::FlightMode::FOLLOW_ME));\n\n    if (result == FollowMe::Result::SUCCESS) {\n        \/\/ If location was set before, lets send it to vehicle\n        std::lock_guard<std::mutex> lock(\n            _mutex); \/\/ locking is not necessary here but lets do it for integrity\n        if (is_target_location_set()) {\n            _parent->add_call_every(\n                [this]() { send_target_location(); }, SENDER_RATE, &_target_location_cookie);\n        }\n    }\n    return result;\n}\n\nFollowMe::Result FollowMeImpl::stop()\n{\n    {\n        std::lock_guard<std::mutex> lock(_mutex);\n        if (_mode == Mode::ACTIVE) {\n            stop_sending_target_location();\n        }\n    }\n    return to_follow_me_result(_parent->set_flight_mode(SystemImpl::FlightMode::HOLD));\n}\n\nbool FollowMeImpl::is_config_ok(const FollowMe::Config &config) const\n{\n    auto config_ok = false;\n\n    if (config.min_height_m < FollowMe::Config::MIN_HEIGHT_M) {\n        LogErr() << debug_str << \"Err: Min height must be atleast 8.0 meters\";\n    } else if (config.follow_distance_m < FollowMe::Config::MIN_FOLLOW_DIST_M) {\n        LogErr() << debug_str << \"Err: Min Follow distance must be atleast 1.0 meter\";\n    } else if (config.follow_direction < FollowMe::Config::FollowDirection::FRONT_RIGHT ||\n               config.follow_direction > FollowMe::Config::FollowDirection::NONE) {\n        LogErr() << debug_str << \"Err: Invalid Follow direction\";\n    } else if (config.responsiveness < FollowMe::Config::MIN_RESPONSIVENESS ||\n               config.responsiveness > FollowMe::Config::MAX_RESPONSIVENESS) {\n        LogErr() << debug_str << \"Err: Responsiveness must be in range (0.0 to 1.0)\";\n    } else { \/\/ Config is OK\n        config_ok = true;\n    }\n\n    return config_ok;\n}\n\nFollowMe::Result FollowMeImpl::to_follow_me_result(MAVLinkCommands::Result result) const\n{\n    switch (result) {\n        case MAVLinkCommands::Result::SUCCESS:\n            return FollowMe::Result::SUCCESS;\n        case MAVLinkCommands::Result::NO_SYSTEM:\n            return FollowMe::Result::NO_SYSTEM;\n        case MAVLinkCommands::Result::CONNECTION_ERROR:\n            return FollowMe::Result::CONNECTION_ERROR;\n        case MAVLinkCommands::Result::BUSY:\n            return FollowMe::Result::BUSY;\n        case MAVLinkCommands::Result::COMMAND_DENIED:\n            return FollowMe::Result::COMMAND_DENIED;\n        case MAVLinkCommands::Result::TIMEOUT:\n            return FollowMe::Result::TIMEOUT;\n        default:\n            return FollowMe::Result::UNKNOWN;\n    }\n}\n\nbool FollowMeImpl::is_target_location_set() const\n{\n    \/\/ If the target's latitude is NAN, we assume that location is not set.\n    \/\/ We assume that mutex was acquired by the caller\n    return std::isfinite(_target_location.latitude_deg);\n}\n\nvoid FollowMeImpl::send_target_location()\n{\n    \/\/ Don't send if we're not in FollowMe mode.\n    if (!is_active()) {\n        return;\n    }\n\n    dl_time_t now = _time.steady_time();\n    \/\/ needed by http:\/\/mavlink.org\/messages\/common#FOLLOW_TARGET\n    uint64_t elapsed_msec =\n        static_cast<uint64_t>(_time.elapsed_since_s(now) * 1000); \/\/ milliseconds\n\n    _mutex.lock();\n    \/\/   LogDebug() << debug_str <<  \"Lat: \" << _target_location.latitude_deg << \" Lon: \" <<\n    \/\/   _target_location.longitude_deg <<\n    \/\/\t\" Alt: \" << _target_location.absolute_altitude_m;\n    const int32_t lat_int = static_cast<int32_t>(_target_location.latitude_deg * 1e7);\n    const int32_t lon_int = static_cast<int32_t>(_target_location.longitude_deg * 1e7);\n    const float alt = static_cast<float>(_target_location.absolute_altitude_m);\n    _mutex.unlock();\n\n    const float pos_std_dev[] = {NAN, NAN, NAN};\n    const float vel[] = {NAN, NAN, NAN};\n    const float accel_unknown[] = {NAN, NAN, NAN};\n    const float attitude_q_unknown[] = {1.f, NAN, NAN, NAN};\n    const float rates_unknown[] = {NAN, NAN, NAN};\n    uint64_t custom_state = 0;\n\n    mavlink_message_t msg{};\n    mavlink_msg_follow_target_pack(GCSClient::system_id,\n                                   GCSClient::component_id,\n                                   &msg,\n                                   elapsed_msec,\n                                   _estimatation_capabilities,\n                                   lat_int,\n                                   lon_int,\n                                   alt,\n                                   vel,\n                                   accel_unknown,\n                                   attitude_q_unknown,\n                                   rates_unknown,\n                                   pos_std_dev,\n                                   custom_state);\n\n    if (!_parent->send_message(msg)) {\n        LogErr() << debug_str << \"send_target_location() failed..\";\n    } else {\n        std::lock_guard<std::mutex> lock(_mutex);\n        _last_location = _target_location;\n    }\n}\n\nvoid FollowMeImpl::stop_sending_target_location()\n{\n    \/\/ We assume that mutex was acquired by the caller\n    if (_target_location_cookie) {\n        _parent->remove_call_every(_target_location_cookie);\n        _target_location_cookie = nullptr;\n    }\n    _mode = Mode::NOT_ACTIVE;\n}\n\nvoid FollowMeImpl::process_heartbeat(const mavlink_message_t &message)\n{\n    mavlink_heartbeat_t heartbeat;\n    mavlink_msg_heartbeat_decode(&message, &heartbeat);\n\n    bool follow_me_active = false; \/\/ tells whether we're in FollowMe mode right now\n    if (heartbeat.base_mode & MAV_MODE_FLAG_CUSTOM_MODE_ENABLED) {\n        px4::px4_custom_mode px4_custom_mode;\n        px4_custom_mode.data = heartbeat.custom_mode;\n\n        if (px4_custom_mode.main_mode == px4::PX4_CUSTOM_MAIN_MODE_AUTO &&\n            px4_custom_mode.sub_mode == px4::PX4_CUSTOM_SUB_MODE_AUTO_FOLLOW_TARGET) {\n            follow_me_active = true; \/\/ we're in FollowMe mode\n        }\n    }\n\n    {\n        std::lock_guard<std::mutex> lock(_mutex);\n        if (!follow_me_active && _mode == Mode::ACTIVE) {\n            \/\/ We're NOT in FollowMe mode anymore.\n            \/\/ Lets stop sending target location updates\n            stop_sending_target_location();\n        } else if (follow_me_active && _mode == Mode::NOT_ACTIVE) {\n            \/\/ We're in FollowMe mode now\n            _mode = Mode::ACTIVE;\n            _mutex.unlock(); \/\/ we must unlock to avoid deadlock in send_target_location()\n            return;\n        }\n    }\n}\n\n} \/\/ namespace dronecode_sdk\n<commit_msg>follow_me: small improvement<commit_after>#include \"follow_me_impl.h\"\n#include \"system.h\"\n#include \"global_include.h\"\n#include \"px4_custom_mode.h\"\n\nnamespace dronecode_sdk {\n\nFollowMeImpl::FollowMeImpl(System &system) : PluginImplBase(system)\n{\n    \/\/ (Lat, Lon, Alt) => double, (vx, vy, vz) => float\n    _last_location = _target_location =\n        FollowMe::TargetLocation{double(NAN), double(NAN), double(NAN), NAN, NAN, NAN};\n    _parent->register_plugin(this);\n}\n\nFollowMeImpl::~FollowMeImpl()\n{\n    _parent->unregister_plugin(this);\n}\n\nvoid FollowMeImpl::init()\n{\n    _parent->register_mavlink_message_handler(\n        MAVLINK_MSG_ID_HEARTBEAT,\n        std::bind(&FollowMeImpl::process_heartbeat, this, std::placeholders::_1),\n        static_cast<void *>(this));\n}\n\nvoid FollowMeImpl::deinit()\n{\n    _parent->unregister_all_mavlink_message_handlers(this);\n}\n\nvoid FollowMeImpl::enable()\n{\n    _parent->get_param_float_async(\"NAV_MIN_FT_HT\", [this](bool success, float value) {\n        if (success) {\n            _config.min_height_m = value;\n        }\n    });\n    _parent->get_param_float_async(\"NAV_FT_DST\", [this](bool success, float value) {\n        if (success) {\n            _config.follow_distance_m = value;\n        }\n    });\n    _parent->get_param_int_async(\"NAV_FT_FS\", [this](bool success, int32_t value) {\n        if (success) {\n            _config.follow_direction = static_cast<FollowMe::Config::FollowDirection>(value);\n        }\n    });\n    _parent->get_param_float_async(\"NAV_FT_RS\", [this](bool success, float value) {\n        if (success) {\n            _config.responsiveness = value;\n        }\n    });\n}\n\nvoid FollowMeImpl::disable()\n{\n    stop_sending_target_location();\n}\n\nconst FollowMe::Config &FollowMeImpl::get_config() const\n{\n    return _config;\n}\n\nFollowMe::Result FollowMeImpl::set_config(const FollowMe::Config &config)\n{\n    \/\/ Valdidate configuration\n    if (!is_config_ok(config)) {\n        LogErr() << debug_str << \"set_config() failed. Last configuration is preserved.\";\n        return FollowMe::Result::SET_CONFIG_FAILED;\n    }\n\n    auto height = config.min_height_m;\n    auto distance = config.follow_distance_m;\n    int32_t direction = static_cast<int32_t>(config.follow_direction);\n    auto responsiveness = config.responsiveness;\n\n    LogDebug() << \"Waiting for the system confirmation of the new configuration..\";\n\n    bool success = true;\n\n    \/\/ Send configuration to Vehicle\n    if (_config.min_height_m != height) {\n        if (_parent->set_param_float(\"NAV_MIN_FT_HT\", height)) {\n            _config.min_height_m = height;\n        } else {\n            success = false;\n        }\n    }\n    if (_config.follow_distance_m != distance) {\n        if (_parent->set_param_float(\"NAV_FT_DST\", distance)) {\n            _config.follow_distance_m = distance;\n        } else {\n            success = false;\n        }\n    }\n    if (_config.follow_direction != config.follow_direction) {\n        if (_parent->set_param_int(\"NAV_FT_FS\", direction)) {\n            _config.follow_direction = static_cast<FollowMe::Config::FollowDirection>(direction);\n\n        } else {\n            success = false;\n        }\n    }\n    if (_config.responsiveness != responsiveness) {\n        if (_parent->set_param_float(\"NAV_FT_RS\", responsiveness)) {\n            _config.responsiveness = responsiveness;\n        } else {\n            success = false;\n        }\n    }\n\n    return (success ? FollowMe::Result::SUCCESS : FollowMe::Result::SET_CONFIG_FAILED);\n}\n\nvoid FollowMeImpl::set_target_location(const FollowMe::TargetLocation &location)\n{\n    _mutex.lock();\n    _target_location = location;\n    \/\/ We're interested only in lat, long.\n    _estimatation_capabilities |= (1 << static_cast<int>(EstimationCapabilites::POS));\n\n    if (_mode != Mode::ACTIVE) {\n        _mutex.unlock();\n        return;\n    }\n    \/\/ If set already, reschedule it.\n    if (_target_location_cookie) {\n        _parent->reset_call_every(_target_location_cookie);\n        _target_location_cookie = nullptr;\n    } else {\n        \/\/ Regiter now for sending in the next cycle.\n        _parent->add_call_every(\n            [this]() { send_target_location(); }, SENDER_RATE, &_target_location_cookie);\n    }\n    _mutex.unlock();\n\n    \/\/ Send it immediately for now.\n    send_target_location();\n}\n\nconst FollowMe::TargetLocation &FollowMeImpl::get_last_location() const\n{\n    std::lock_guard<std::mutex> lock(_mutex);\n    return _last_location;\n}\n\nbool FollowMeImpl::is_active() const\n{\n    std::lock_guard<std::mutex> lock(_mutex);\n    return _mode == Mode::ACTIVE;\n}\n\nFollowMe::Result FollowMeImpl::start()\n{\n    FollowMe::Result result =\n        to_follow_me_result(_parent->set_flight_mode(SystemImpl::FlightMode::FOLLOW_ME));\n\n    if (result == FollowMe::Result::SUCCESS) {\n        \/\/ If location was set before, lets send it to vehicle\n        std::lock_guard<std::mutex> lock(\n            _mutex); \/\/ locking is not necessary here but lets do it for integrity\n        if (is_target_location_set()) {\n            _parent->add_call_every(\n                [this]() { send_target_location(); }, SENDER_RATE, &_target_location_cookie);\n        }\n    }\n    return result;\n}\n\nFollowMe::Result FollowMeImpl::stop()\n{\n    {\n        std::lock_guard<std::mutex> lock(_mutex);\n        if (_mode == Mode::ACTIVE) {\n            stop_sending_target_location();\n        }\n    }\n    return to_follow_me_result(_parent->set_flight_mode(SystemImpl::FlightMode::HOLD));\n}\n\nbool FollowMeImpl::is_config_ok(const FollowMe::Config &config) const\n{\n    auto config_ok = false;\n\n    if (config.min_height_m < FollowMe::Config::MIN_HEIGHT_M) {\n        LogErr() << debug_str << \"Err: Min height must be atleast 8.0 meters\";\n    } else if (config.follow_distance_m < FollowMe::Config::MIN_FOLLOW_DIST_M) {\n        LogErr() << debug_str << \"Err: Min Follow distance must be atleast 1.0 meter\";\n    } else if (config.follow_direction < FollowMe::Config::FollowDirection::FRONT_RIGHT ||\n               config.follow_direction > FollowMe::Config::FollowDirection::NONE) {\n        LogErr() << debug_str << \"Err: Invalid Follow direction\";\n    } else if (config.responsiveness < FollowMe::Config::MIN_RESPONSIVENESS ||\n               config.responsiveness > FollowMe::Config::MAX_RESPONSIVENESS) {\n        LogErr() << debug_str << \"Err: Responsiveness must be in range (0.0 to 1.0)\";\n    } else { \/\/ Config is OK\n        config_ok = true;\n    }\n\n    return config_ok;\n}\n\nFollowMe::Result FollowMeImpl::to_follow_me_result(MAVLinkCommands::Result result) const\n{\n    switch (result) {\n        case MAVLinkCommands::Result::SUCCESS:\n            return FollowMe::Result::SUCCESS;\n        case MAVLinkCommands::Result::NO_SYSTEM:\n            return FollowMe::Result::NO_SYSTEM;\n        case MAVLinkCommands::Result::CONNECTION_ERROR:\n            return FollowMe::Result::CONNECTION_ERROR;\n        case MAVLinkCommands::Result::BUSY:\n            return FollowMe::Result::BUSY;\n        case MAVLinkCommands::Result::COMMAND_DENIED:\n            return FollowMe::Result::COMMAND_DENIED;\n        case MAVLinkCommands::Result::TIMEOUT:\n            return FollowMe::Result::TIMEOUT;\n        default:\n            return FollowMe::Result::UNKNOWN;\n    }\n}\n\nbool FollowMeImpl::is_target_location_set() const\n{\n    \/\/ If the target's latitude is NAN, we assume that location is not set.\n    \/\/ We assume that mutex was acquired by the caller\n    return std::isfinite(_target_location.latitude_deg);\n}\n\nvoid FollowMeImpl::send_target_location()\n{\n    \/\/ Don't send if we're not in FollowMe mode.\n    if (!is_active()) {\n        return;\n    }\n\n    dl_time_t now = _time.steady_time();\n    \/\/ needed by http:\/\/mavlink.org\/messages\/common#FOLLOW_TARGET\n    uint64_t elapsed_msec =\n        static_cast<uint64_t>(_time.elapsed_since_s(now) * 1000); \/\/ milliseconds\n\n    _mutex.lock();\n    \/\/   LogDebug() << debug_str <<  \"Lat: \" << _target_location.latitude_deg << \" Lon: \" <<\n    \/\/   _target_location.longitude_deg <<\n    \/\/\t\" Alt: \" << _target_location.absolute_altitude_m;\n    const int32_t lat_int = static_cast<int32_t>(_target_location.latitude_deg * 1e7);\n    const int32_t lon_int = static_cast<int32_t>(_target_location.longitude_deg * 1e7);\n    const float alt = static_cast<float>(_target_location.absolute_altitude_m);\n    _mutex.unlock();\n\n    const float pos_std_dev[] = {NAN, NAN, NAN};\n    const float vel[] = {NAN, NAN, NAN};\n    const float accel_unknown[] = {NAN, NAN, NAN};\n    const float attitude_q_unknown[] = {1.f, NAN, NAN, NAN};\n    const float rates_unknown[] = {NAN, NAN, NAN};\n    uint64_t custom_state = 0;\n\n    mavlink_message_t msg{};\n    mavlink_msg_follow_target_pack(GCSClient::system_id,\n                                   GCSClient::component_id,\n                                   &msg,\n                                   elapsed_msec,\n                                   _estimatation_capabilities,\n                                   lat_int,\n                                   lon_int,\n                                   alt,\n                                   vel,\n                                   accel_unknown,\n                                   attitude_q_unknown,\n                                   rates_unknown,\n                                   pos_std_dev,\n                                   custom_state);\n\n    if (!_parent->send_message(msg)) {\n        LogErr() << debug_str << \"send_target_location() failed..\";\n    } else {\n        std::lock_guard<std::mutex> lock(_mutex);\n        _last_location = _target_location;\n    }\n}\n\nvoid FollowMeImpl::stop_sending_target_location()\n{\n    \/\/ We assume that mutex was acquired by the caller\n    if (_target_location_cookie) {\n        _parent->remove_call_every(_target_location_cookie);\n        _target_location_cookie = nullptr;\n    }\n    _mode = Mode::NOT_ACTIVE;\n}\n\nvoid FollowMeImpl::process_heartbeat(const mavlink_message_t &message)\n{\n    mavlink_heartbeat_t heartbeat;\n    mavlink_msg_heartbeat_decode(&message, &heartbeat);\n\n    bool follow_me_active = false; \/\/ tells whether we're in FollowMe mode right now\n    if (heartbeat.base_mode & MAV_MODE_FLAG_CUSTOM_MODE_ENABLED) {\n        px4::px4_custom_mode px4_custom_mode;\n        px4_custom_mode.data = heartbeat.custom_mode;\n\n        if (px4_custom_mode.main_mode == px4::PX4_CUSTOM_MAIN_MODE_AUTO &&\n            px4_custom_mode.sub_mode == px4::PX4_CUSTOM_SUB_MODE_AUTO_FOLLOW_TARGET) {\n            follow_me_active = true; \/\/ we're in FollowMe mode\n        }\n    }\n\n    {\n        std::lock_guard<std::mutex> lock(_mutex);\n        if (!follow_me_active && _mode == Mode::ACTIVE) {\n            \/\/ We're NOT in FollowMe mode anymore.\n            \/\/ Lets stop sending target location updates\n            stop_sending_target_location();\n        } else if (follow_me_active && _mode == Mode::NOT_ACTIVE) {\n            \/\/ We're in FollowMe mode now\n            _mode = Mode::ACTIVE;\n            _mutex.unlock(); \/\/ we must unlock to avoid deadlock in send_target_location()\n            return;\n        }\n    }\n}\n\n} \/\/ namespace dronecode_sdk\n<|endoftext|>"}
{"text":"<commit_before>#include \"point_series_xy.h\"\n#include <cmath>\n#include <cstdlib>\n\nPointSeriesXY::PointSeriesXY(const PlotData *y_axis, const PlotData *x_axis):\n    DataSeriesBase( &_cached_curve ),\n    _x_axis(x_axis),\n    _y_axis(y_axis),\n    _cached_curve(\"\")\n{\n    updateCache();\n}\n\nPlotData::RangeTimeOpt PointSeriesXY::getVisualizationRangeX()\n{\n    if( this->size() < 2 )\n        return  PlotData::RangeTimeOpt();\n    else{\n        return PlotData::RangeTimeOpt( { _bounding_box.left() ,\n                                         _bounding_box.right()} );\n    }\n}\n\nnonstd::optional<QPointF> PointSeriesXY::sampleFromTime(double t)\n{\n    if( _cached_curve.size() == 0 )\n    {\n        return {};\n    }\n\n    int index = _y_axis->getIndexFromX(t);\n    if(index <0)\n    {\n        return {};\n    }\n    const auto& p = _cached_curve.at( size_t(index) );\n    return QPointF(p.x, p.y);\n}\n\nPlotData::RangeValueOpt PointSeriesXY::getVisualizationRangeY(PlotData::RangeTime range_X)\n{\n    \/\/TODO: improve?\n    return PlotData::RangeValueOpt( { _bounding_box.bottom(),\n                                      _bounding_box.top() } );\n}\n\nbool PointSeriesXY::updateCache()\n{\n    if( _x_axis == nullptr )\n    {\n        throw std::runtime_error(\"the X axis is null\");\n    }\n\n    const size_t data_size =  _x_axis->size();\n\n    if( data_size != _y_axis->size() )\n    {\n        _bounding_box = QRectF();\n        _cached_curve.clear();\n        throw std::runtime_error(\"X and Y axis don't share the same time axis\");\n    }\n\n    if(data_size == 0)\n    {\n        _bounding_box = QRectF();\n        _cached_curve.clear();\n        return true;\n    }\n\n    double min_y =( std::numeric_limits<double>::max() );\n    double max_y =(-std::numeric_limits<double>::max() );\n    double min_x =( std::numeric_limits<double>::max() );\n    double max_x =(-std::numeric_limits<double>::max() );\n\n    _cached_curve.resize( data_size );\n\n    const double EPS = std::numeric_limits<double>::epsilon();\n\n    for (size_t i=0; i<data_size; i++ )\n    {\n        if( Abs( _x_axis->at(i).x  - _y_axis->at(i).x ) >  EPS)\n        {\n            _bounding_box = QRectF();\n            _cached_curve.clear();\n            throw std::runtime_error(\"X and Y axis don't share the same time axis\");\n        }\n\n        const QPointF p(_x_axis->at(i).y,\n                        _y_axis->at(i).y );\n\n        _cached_curve.at(i) = { p.x(), p.y() };\n\n        min_x = std::min( min_x, p.x() );\n        max_x = std::max( max_x, p.x() );\n        min_y = std::min( min_y, p.y() );\n        max_y = std::max( max_y, p.y() );\n    }\n\n    _bounding_box.setLeft(  min_x );\n    _bounding_box.setRight( max_x );\n    _bounding_box.setBottom( min_y );\n    _bounding_box.setTop( max_y );\n\n    return true;\n}\n<commit_msg>relax the XY consitions as suggested in #177<commit_after>#include \"point_series_xy.h\"\n#include <cmath>\n#include <cstdlib>\n\nPointSeriesXY::PointSeriesXY(const PlotData *y_axis, const PlotData *x_axis):\n    DataSeriesBase( &_cached_curve ),\n    _x_axis(x_axis),\n    _y_axis(y_axis),\n    _cached_curve(\"\")\n{\n    updateCache();\n}\n\nPlotData::RangeTimeOpt PointSeriesXY::getVisualizationRangeX()\n{\n    if( this->size() < 2 )\n        return  PlotData::RangeTimeOpt();\n    else{\n        return PlotData::RangeTimeOpt( { _bounding_box.left() ,\n                                         _bounding_box.right()} );\n    }\n}\n\nnonstd::optional<QPointF> PointSeriesXY::sampleFromTime(double t)\n{\n    if( _cached_curve.size() == 0 )\n    {\n        return {};\n    }\n\n    int index = _y_axis->getIndexFromX(t);\n    if(index <0)\n    {\n        return {};\n    }\n    const auto& p = _cached_curve.at( size_t(index) );\n    return QPointF(p.x, p.y);\n}\n\nPlotData::RangeValueOpt PointSeriesXY::getVisualizationRangeY(PlotData::RangeTime range_X)\n{\n    \/\/TODO: improve?\n    return PlotData::RangeValueOpt( { _bounding_box.bottom(),\n                                      _bounding_box.top() } );\n}\n\nbool PointSeriesXY::updateCache()\n{\n    if( _x_axis == nullptr )\n    {\n        throw std::runtime_error(\"the X axis is null\");\n    }\n\n    const size_t data_size =  std::min(_x_axis->size(), _y_axis->size());\n    \n    if(data_size == 0)\n    {\n        _bounding_box = QRectF();\n        _cached_curve.clear();\n        return true;\n    }\n\n    double min_y =( std::numeric_limits<double>::max() );\n    double max_y =(-std::numeric_limits<double>::max() );\n    double min_x =( std::numeric_limits<double>::max() );\n    double max_x =(-std::numeric_limits<double>::max() );\n\n    _cached_curve.resize( data_size );\n\n    const double EPS = std::numeric_limits<double>::epsilon();\n\n    for (size_t i=0; i<data_size; i++ )\n    {\n        if( Abs( _x_axis->at(i).x  - _y_axis->at(i).x ) >  EPS)\n        {\n            _bounding_box = QRectF();\n            _cached_curve.clear();\n            throw std::runtime_error(\"X and Y axis don't share the same time axis\");\n        }\n\n        const QPointF p(_x_axis->at(i).y,\n                        _y_axis->at(i).y );\n\n        _cached_curve.at(i) = { p.x(), p.y() };\n\n        min_x = std::min( min_x, p.x() );\n        max_x = std::max( max_x, p.x() );\n        min_y = std::min( min_y, p.y() );\n        max_y = std::max( max_y, p.y() );\n    }\n\n    _bounding_box.setLeft(  min_x );\n    _bounding_box.setRight( max_x );\n    _bounding_box.setBottom( min_y );\n    _bounding_box.setTop( max_y );\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * This file is part of the MULA project\n * Copyright (c) 2011 Laszlo Papp <lpapp@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, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n *\/\n\n#include \"dictionary.h\"\n\n#include \"dictionaryzip.h\"\n#include \"stardictdictionaryinfo.h\"\n#include \"indexfile.h\"\n#include \"offsetcachefile.h\"\n\n#include <QtCore\/QScopedPointer>\n#include <QtCore\/QFile>\n#include <QtCore\/QDebug>\n\nusing namespace MulaPluginStarDict;\n\nclass Dictionary::Private\n{\n    public:\n        Private()\n            : wordCount(0)\n            , indexFileSize(0)\n        {\n        }\n\n        ~Private()\n        {\n        }\n\n        QString ifoFilePath;\n        long wordCount;\n        QString bookName;\n\n        QScopedPointer<AbstractIndexFile> indexFile;\n        int indexFileSize;\n};\n\nDictionary::Dictionary()\n    : d(new Private)\n{\n}\n\nDictionary::~Dictionary()\n{\n}\n\nint\nDictionary::articleCount() const\n{\n    return d->wordCount;\n}\n\nconst QString\nDictionary::dictionaryName() const\n{\n    return d->bookName;\n}\n\nconst QString\nDictionary::ifoFilePath() const\n{\n    return d->ifoFilePath;\n}\n\nconst QString\nDictionary::key(long index) const\n{\n    if (d->indexFile.isNull())\n        return QString();\n\n    return d->indexFile->key(index);\n}\n\nQString\nDictionary::data(long index)\n{\n    Q_UNUSED(index);\n    if (d->indexFile.isNull())\n        return QString();\n\n    return AbstractDictionary::wordData(d->indexFile->wordEntryOffset(), d->indexFile->wordEntrySize());\n}\n\nconst WordEntry\nDictionary::wordEntry(long index)\n{\n    if (d->indexFile.isNull())\n        return WordEntry();\n\n    WordEntry wordEntry;\n    wordEntry.setData(d->indexFile->key(index));\n    wordEntry.setDataOffset(d->indexFile->wordEntryOffset());\n    wordEntry.setDataSize(d->indexFile->wordEntrySize());\n\n    return wordEntry;\n}\n\nbool\nDictionary::lookup(const QString word, int &index)\n{\n    if (d->indexFile.isNull())\n        return false;\n\n    return d->indexFile->lookup(word.toUtf8(), index);\n}\n\nbool\nDictionary::load(const QString& ifoFilePath)\n{\n    if (!loadIfoFile(ifoFilePath))\n        return false;\n\n    QString completeFilePath = ifoFilePath;\n    completeFilePath.replace(completeFilePath.length() - sizeof(\"ifo\") + 1, sizeof(\"ifo\") - 1, \"dict.dz\");\n\n    if (QFile(completeFilePath).exists())\n    {\n        DictionaryZip *dictionaryZip = compressedDictionaryFile();\n        if (!dictionaryZip)\n        {\n            delete dictionaryZip;\n            dictionaryZip = 0;\n        }\n\n        dictionaryZip = new DictionaryZip();\n        if (!dictionaryZip->open(completeFilePath, 0))\n        {\n            qDebug() << \"Failed to open file:\" << completeFilePath;\n            return false;\n        }\n    }\n    else\n    {\n        completeFilePath.chop(sizeof(\".dz\"));\n\n        QFile *uncompressedDictionaryFile = dictionaryFile();\n        if (uncompressedDictionaryFile)\n        {\n            delete uncompressedDictionaryFile;\n            uncompressedDictionaryFile = 0;\n        }\n\n        uncompressedDictionaryFile = new QFile(completeFilePath);\n        if( uncompressedDictionaryFile->open( QIODevice::ReadOnly ) )\n        {\n            qDebug() << \"Failed to open file:\" << completeFilePath;\n            return -1;\n        }\n    }\n\n    completeFilePath = ifoFilePath;\n    completeFilePath.replace(completeFilePath.length() - sizeof(\"ifo\") + 1, sizeof(\"ifo\") - 1, \"idx.gz\");\n\n    if (QFile(completeFilePath).exists())\n    {\n        d->indexFile.reset(new IndexFile);\n    }\n    else\n    {\n        completeFilePath.chop(sizeof(\".gz\"));\n        d->indexFile.reset(new OffsetCacheFile);\n    }\n\n    if (!d->indexFile->load(completeFilePath, d->wordCount, d->indexFileSize))\n        return false;\n\n    return true;\n}\n\nbool\nDictionary::loadIfoFile(const QString& ifoFilePath)\n{\n    StarDictDictionaryInfo dictionaryInfo;\n    if (!dictionaryInfo.loadFromIfoFile(ifoFilePath))\n        return false;\n\n    if (dictionaryInfo.wordCount() == 0)\n        return false;\n\n    d->ifoFilePath = dictionaryInfo.ifoFilePath();\n    d->wordCount = dictionaryInfo.wordCount();\n    d->bookName = dictionaryInfo.bookName();\n\n    d->indexFileSize = dictionaryInfo.indexFileSize();\n\n    setSameTypeSequence(dictionaryInfo.sameTypeSequence());\n\n    return true;\n}\n\nbool\nDictionary::lookupWithRule(const QString& pattern, long *aIndex, int iBuffLen)\n{\n    int indexCount = 0;\n    bool found = false;\n\n    QRegExp rx(pattern);\n    rx.setPatternSyntax(QRegExp::Wildcard);\n\n    for (int i = 0; i < articleCount() && indexCount < iBuffLen - 1; ++i)\n    {\n        if (rx.exactMatch(key(i)))\n        {\n            aIndex[indexCount++] = i;\n            found = true;\n        }\n    }\n\n    aIndex[indexCount] = -1; \/\/ -1 is the end.\n\n    return found;\n}\n\n<commit_msg>Use one dictionaryInfo member in the private class instead of various members<commit_after>\/******************************************************************************\n * This file is part of the MULA project\n * Copyright (c) 2011 Laszlo Papp <lpapp@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, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n *\/\n\n#include \"dictionary.h\"\n\n#include \"dictionaryzip.h\"\n#include \"stardictdictionaryinfo.h\"\n#include \"indexfile.h\"\n#include \"offsetcachefile.h\"\n\n#include <QtCore\/QScopedPointer>\n#include <QtCore\/QFile>\n#include <QtCore\/QDebug>\n\nusing namespace MulaPluginStarDict;\n\nclass Dictionary::Private\n{\n    public:\n        Private()\n        {\n        }\n\n        ~Private()\n        {\n        }\n\n        StarDictDictionaryInfo dictionaryInfo;\n        QScopedPointer<AbstractIndexFile> indexFile;\n};\n\nDictionary::Dictionary()\n    : d(new Private)\n{\n}\n\nDictionary::~Dictionary()\n{\n}\n\nint\nDictionary::articleCount() const\n{\n    return d->dictionaryInfo.wordCount();\n}\n\nconst QString\nDictionary::dictionaryName() const\n{\n    return d->dictionaryInfo.bookName();\n}\n\nconst QString\nDictionary::ifoFilePath() const\n{\n    return d->dictionaryInfo.ifoFilePath();\n}\n\nconst QString\nDictionary::key(long index) const\n{\n    if (d->indexFile.isNull())\n        return QString();\n\n    return d->indexFile->key(index);\n}\n\nQString\nDictionary::data(long index)\n{\n    Q_UNUSED(index);\n    if (d->indexFile.isNull())\n        return QString();\n\n    return AbstractDictionary::wordData(d->indexFile->wordEntryOffset(), d->indexFile->wordEntrySize());\n}\n\nconst WordEntry\nDictionary::wordEntry(long index)\n{\n    if (d->indexFile.isNull())\n        return WordEntry();\n\n    WordEntry wordEntry;\n    wordEntry.setData(d->indexFile->key(index));\n    wordEntry.setDataOffset(d->indexFile->wordEntryOffset());\n    wordEntry.setDataSize(d->indexFile->wordEntrySize());\n\n    return wordEntry;\n}\n\nbool\nDictionary::lookup(const QString word, int &index)\n{\n    if (d->indexFile.isNull())\n        return false;\n\n    return d->indexFile->lookup(word.toUtf8(), index);\n}\n\nbool\nDictionary::load(const QString& ifoFilePath)\n{\n    if (!loadIfoFile(ifoFilePath))\n        return false;\n\n    QString completeFilePath = ifoFilePath;\n    completeFilePath.replace(completeFilePath.length() - sizeof(\"ifo\") + 1, sizeof(\"ifo\") - 1, \"dict.dz\");\n\n    if (QFile(completeFilePath).exists())\n    {\n        DictionaryZip *dictionaryZip = compressedDictionaryFile();\n        if (!dictionaryZip)\n        {\n            delete dictionaryZip;\n            dictionaryZip = 0;\n        }\n\n        dictionaryZip = new DictionaryZip();\n        if (!dictionaryZip->open(completeFilePath, 0))\n        {\n            qDebug() << \"Failed to open file:\" << completeFilePath;\n            return false;\n        }\n    }\n    else\n    {\n        completeFilePath.chop(sizeof(\".dz\"));\n\n        QFile *uncompressedDictionaryFile = dictionaryFile();\n        if (uncompressedDictionaryFile)\n        {\n            delete uncompressedDictionaryFile;\n            uncompressedDictionaryFile = 0;\n        }\n\n        uncompressedDictionaryFile = new QFile(completeFilePath);\n        if( uncompressedDictionaryFile->open( QIODevice::ReadOnly ) )\n        {\n            qDebug() << \"Failed to open file:\" << completeFilePath;\n            return -1;\n        }\n    }\n\n    completeFilePath = ifoFilePath;\n    completeFilePath.replace(completeFilePath.length() - sizeof(\"ifo\") + 1, sizeof(\"ifo\") - 1, \"idx.gz\");\n\n    if (QFile(completeFilePath).exists())\n    {\n        d->indexFile.reset(new IndexFile);\n    }\n    else\n    {\n        completeFilePath.chop(sizeof(\".gz\"));\n        d->indexFile.reset(new OffsetCacheFile);\n    }\n\n    if (!d->indexFile->load(completeFilePath, d->dictionaryInfo.wordCount(), d->dictionaryInfo.indexFileSize()))\n        return false;\n\n    return true;\n}\n\nbool\nDictionary::loadIfoFile(const QString& ifoFilePath)\n{\n    if (!d->dictionaryInfo.loadFromIfoFile(ifoFilePath))\n        return false;\n\n    if (d->dictionaryInfo.wordCount() == 0)\n        return false;\n\n    setSameTypeSequence(d->dictionaryInfo.sameTypeSequence());\n\n    return true;\n}\n\nbool\nDictionary::lookupWithRule(const QString& pattern, long *aIndex, int iBuffLen)\n{\n    int indexCount = 0;\n    bool found = false;\n\n    QRegExp rx(pattern);\n    rx.setPatternSyntax(QRegExp::Wildcard);\n\n    for (int i = 0; i < articleCount() && indexCount < iBuffLen - 1; ++i)\n    {\n        if (rx.exactMatch(key(i)))\n        {\n            aIndex[indexCount++] = i;\n            found = true;\n        }\n    }\n\n    aIndex[indexCount] = -1; \/\/ -1 is the end.\n\n    return found;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: osl_Module_DLL.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 15:30: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#include <stdio.h>\n#include <sal\/types.h>\n#include <cppunit\/simpleheader.hxx>\n\nextern \"C\" sal_Bool SAL_CALL firstfunc( sal_Bool bRes )\n{\n   return ( bRes = sal_True );\n}\nextern \"C\" void SAL_CALL secondfunc()\n{\n   printf(\"second func called.\\n\");\n}\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.4.140); FILE MERGED 2006\/09\/01 17:34:04 kaib 1.4.140.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: osl_Module_DLL.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 08:50:21 $\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_sal.hxx\"\n\n#include <stdio.h>\n#include <sal\/types.h>\n#include <cppunit\/simpleheader.hxx>\n\nextern \"C\" sal_Bool SAL_CALL firstfunc( sal_Bool bRes )\n{\n   return ( bRes = sal_True );\n}\nextern \"C\" void SAL_CALL secondfunc()\n{\n   printf(\"second func called.\\n\");\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <system\/Display.h>\n\n\nnamespace lime {\n\t\n\t\n\tint Display::GetNumDevices() {\n\t\t\n\t\treturn SDL_GetNumVideoDisplays();\n\t\t\n\t}\n\t\n\tstatic const char* GetDisplayName (int displayIndex) {\n\t\t\n\t\treturn SDL_GetDisplayName(displayIndex);\n\t\t\n\t}\n\t\n}<commit_msg>add name<commit_after>#include <system\/Display.h>\n\n\nnamespace lime {\n\t\n\t\n\tint Display::GetNumDevices() {\n\t\t\n\t\treturn SDL_GetNumVideoDisplays();\n\t\t\n\t}\n\t\n\tconst char* Display::GetDisplayName (int displayIndex) {\n\t\t\n\t\treturn SDL_GetDisplayName(displayIndex);\n\t\t\n\t}\n\t\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright © 2011 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\nextern \"C\" {\n#include \"main\/macros.h\"\n#include \"program\/register_allocate.h\"\n} \/* extern \"C\" *\/\n\n#include \"brw_vec4.h\"\n#include \"brw_vs.h\"\n\nusing namespace brw;\n\nnamespace brw {\n\nstatic void\nassign(unsigned int *reg_hw_locations, reg *reg)\n{\n   if (reg->file == GRF) {\n      reg->reg = reg_hw_locations[reg->reg];\n   }\n}\n\nbool\nvec4_visitor::reg_allocate_trivial()\n{\n   unsigned int hw_reg_mapping[this->virtual_grf_count];\n   bool virtual_grf_used[this->virtual_grf_count];\n   int i;\n   int next;\n\n   \/* Calculate which virtual GRFs are actually in use after whatever\n    * optimization passes have occurred.\n    *\/\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      virtual_grf_used[i] = false;\n   }\n\n   foreach_iter(exec_list_iterator, iter, this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)iter.get();\n\n      if (inst->dst.file == GRF)\n\t virtual_grf_used[inst->dst.reg] = true;\n\n      for (int i = 0; i < 3; i++) {\n\t if (inst->src[i].file == GRF)\n\t    virtual_grf_used[inst->src[i].reg] = true;\n      }\n   }\n\n   hw_reg_mapping[0] = this->first_non_payload_grf;\n   next = hw_reg_mapping[0] + this->virtual_grf_sizes[0];\n   for (i = 1; i < this->virtual_grf_count; i++) {\n      if (virtual_grf_used[i]) {\n\t hw_reg_mapping[i] = next;\n\t next += this->virtual_grf_sizes[i];\n      }\n   }\n   prog_data->total_grf = next;\n\n   foreach_iter(exec_list_iterator, iter, this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)iter.get();\n\n      assign(hw_reg_mapping, &inst->dst);\n      assign(hw_reg_mapping, &inst->src[0]);\n      assign(hw_reg_mapping, &inst->src[1]);\n      assign(hw_reg_mapping, &inst->src[2]);\n   }\n\n   if (prog_data->total_grf > max_grf) {\n      fail(\"Ran out of regs on trivial allocator (%d\/%d)\\n\",\n\t   prog_data->total_grf, max_grf);\n      return false;\n   }\n\n   return true;\n}\n\nstatic void\nbrw_alloc_reg_set_for_classes(struct brw_context *brw,\n\t\t\t      int *class_sizes,\n\t\t\t      int class_count,\n\t\t\t      int base_reg_count)\n{\n   \/* Compute the total number of registers across all classes. *\/\n   int ra_reg_count = 0;\n   for (int i = 0; i < class_count; i++) {\n      ra_reg_count += base_reg_count - (class_sizes[i] - 1);\n   }\n\n   ralloc_free(brw->vs.ra_reg_to_grf);\n   brw->vs.ra_reg_to_grf = ralloc_array(brw, uint8_t, ra_reg_count);\n   ralloc_free(brw->vs.regs);\n   brw->vs.regs = ra_alloc_reg_set(brw, ra_reg_count);\n   if (brw->gen >= 6)\n      ra_set_allocate_round_robin(brw->vs.regs);\n   ralloc_free(brw->vs.classes);\n   brw->vs.classes = ralloc_array(brw, int, class_count + 1);\n\n   \/* Now, add the registers to their classes, and add the conflicts\n    * between them and the base GRF registers (and also each other).\n    *\/\n   int reg = 0;\n   for (int i = 0; i < class_count; i++) {\n      int class_reg_count = base_reg_count - (class_sizes[i] - 1);\n      brw->vs.classes[i] = ra_alloc_reg_class(brw->vs.regs);\n\n      for (int j = 0; j < class_reg_count; j++) {\n\t ra_class_add_reg(brw->vs.regs, brw->vs.classes[i], reg);\n\n\t brw->vs.ra_reg_to_grf[reg] = j;\n\n\t for (int base_reg = j;\n\t      base_reg < j + class_sizes[i];\n\t      base_reg++) {\n\t    ra_add_transitive_reg_conflict(brw->vs.regs, base_reg, reg);\n\t }\n\n\t reg++;\n      }\n   }\n   assert(reg == ra_reg_count);\n\n   ra_set_finalize(brw->vs.regs, NULL);\n}\n\nbool\nvec4_visitor::reg_allocate()\n{\n   unsigned int hw_reg_mapping[virtual_grf_count];\n   int first_assigned_grf = this->first_non_payload_grf;\n   int base_reg_count = max_grf - first_assigned_grf;\n   int class_sizes[base_reg_count];\n   int class_count = 0;\n\n   \/* Using the trivial allocator can be useful in debugging undefined\n    * register access as a result of broken optimization passes.\n    *\/\n   if (0)\n      return reg_allocate_trivial();\n\n   calculate_live_intervals();\n\n   \/* Set up the register classes.\n    *\n    * The base registers store a vec4.  However, we'll need larger\n    * storage for arrays, structures, and matrices, which will be sets\n    * of contiguous registers.\n    *\/\n   class_sizes[class_count++] = 1;\n\n   for (int r = 0; r < virtual_grf_count; r++) {\n      int i;\n\n      for (i = 0; i < class_count; i++) {\n\t if (class_sizes[i] == this->virtual_grf_sizes[r])\n\t    break;\n      }\n      if (i == class_count) {\n\t if (this->virtual_grf_sizes[r] >= base_reg_count) {\n\t    fail(\"Object too large to register allocate.\\n\");\n\t }\n\n\t class_sizes[class_count++] = this->virtual_grf_sizes[r];\n      }\n   }\n\n   brw_alloc_reg_set_for_classes(brw, class_sizes, class_count, base_reg_count);\n\n   struct ra_graph *g = ra_alloc_interference_graph(brw->vs.regs,\n\t\t\t\t\t\t    virtual_grf_count);\n\n   for (int i = 0; i < virtual_grf_count; i++) {\n      for (int c = 0; c < class_count; c++) {\n\t if (class_sizes[c] == this->virtual_grf_sizes[i]) {\n\t    ra_set_node_class(g, i, brw->vs.classes[c]);\n\t    break;\n\t }\n      }\n\n      for (int j = 0; j < i; j++) {\n\t if (virtual_grf_interferes(i, j)) {\n\t    ra_add_node_interference(g, i, j);\n\t }\n      }\n   }\n\n   if (!ra_allocate_no_spills(g)) {\n      \/* Failed to allocate registers.  Spill a reg, and the caller will\n       * loop back into here to try again.\n       *\/\n      int reg = choose_spill_reg(g);\n      if (reg == -1) {\n         fail(\"no register to spill\\n\");\n      } else {\n         spill_reg(reg);\n      }\n      ralloc_free(g);\n      return false;\n   }\n\n   \/* Get the chosen virtual registers for each node, and map virtual\n    * regs in the register classes back down to real hardware reg\n    * numbers.\n    *\/\n   prog_data->total_grf = first_assigned_grf;\n   for (int i = 0; i < virtual_grf_count; i++) {\n      int reg = ra_get_node_reg(g, i);\n\n      hw_reg_mapping[i] = first_assigned_grf + brw->vs.ra_reg_to_grf[reg];\n      prog_data->total_grf = MAX2(prog_data->total_grf,\n\t\t\t\t  hw_reg_mapping[i] + virtual_grf_sizes[i]);\n   }\n\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)node;\n\n      assign(hw_reg_mapping, &inst->dst);\n      assign(hw_reg_mapping, &inst->src[0]);\n      assign(hw_reg_mapping, &inst->src[1]);\n      assign(hw_reg_mapping, &inst->src[2]);\n   }\n\n   ralloc_free(g);\n\n   return true;\n}\n\nvoid\nvec4_visitor::evaluate_spill_costs(float *spill_costs, bool *no_spill)\n{\n   float loop_scale = 1.0;\n\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      spill_costs[i] = 0.0;\n      no_spill[i] = virtual_grf_sizes[i] != 1;\n   }\n\n   \/* Calculate costs for spilling nodes.  Call it a cost of 1 per\n    * spill\/unspill we'll have to do, and guess that the insides of\n    * loops run 10 times.\n    *\/\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *) node;\n\n      for (unsigned int i = 0; i < 3; i++) {\n\t if (inst->src[i].file == GRF) {\n\t    spill_costs[inst->src[i].reg] += loop_scale;\n            if (inst->src[i].reladdr)\n               no_spill[inst->src[i].reg] = true;\n\t }\n      }\n\n      if (inst->dst.file == GRF) {\n\t spill_costs[inst->dst.reg] += loop_scale;\n         if (inst->dst.reladdr)\n            no_spill[inst->dst.reg] = true;\n      }\n\n      switch (inst->opcode) {\n\n      case BRW_OPCODE_DO:\n\t loop_scale *= 10;\n\t break;\n\n      case BRW_OPCODE_WHILE:\n\t loop_scale \/= 10;\n\t break;\n\n      case VS_OPCODE_SCRATCH_READ:\n      case VS_OPCODE_SCRATCH_WRITE:\n         for (int i = 0; i < 3; i++) {\n            if (inst->src[i].file == GRF)\n               no_spill[inst->src[i].reg] = true;\n         }\n\t if (inst->dst.file == GRF)\n\t    no_spill[inst->dst.reg] = true;\n\t break;\n\n      default:\n\t break;\n      }\n   }\n}\n\nint\nvec4_visitor::choose_spill_reg(struct ra_graph *g)\n{\n   float spill_costs[this->virtual_grf_count];\n   bool no_spill[this->virtual_grf_count];\n\n   evaluate_spill_costs(spill_costs, no_spill);\n\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      if (!no_spill[i])\n         ra_set_node_spill_cost(g, i, spill_costs[i]);\n   }\n\n   return ra_get_best_spill_node(g);\n}\n\nvoid\nvec4_visitor::spill_reg(int spill_reg_nr)\n{\n   assert(virtual_grf_sizes[spill_reg_nr] == 1);\n   unsigned int spill_offset = c->last_scratch++;\n\n   \/* Generate spill\/unspill instructions for the objects being spilled. *\/\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *) node;\n\n      for (unsigned int i = 0; i < 3; i++) {\n         if (inst->src[i].file == GRF && inst->src[i].reg == spill_reg_nr) {\n            src_reg spill_reg = inst->src[i];\n            inst->src[i].reg = virtual_grf_alloc(1);\n            dst_reg temp = dst_reg(inst->src[i]);\n\n            \/* Only read the necessary channels, to avoid overwriting the rest\n             * with data that may not have been written to scratch.\n             *\/\n            temp.writemask = 0;\n            for (int c = 0; c < 4; c++)\n               temp.writemask |= (1 << BRW_GET_SWZ(inst->src[i].swizzle, c));\n            assert(temp.writemask != 0);\n\n            emit_scratch_read(inst, temp, spill_reg, spill_offset);\n         }\n      }\n\n      if (inst->dst.file == GRF && inst->dst.reg == spill_reg_nr) {\n         emit_scratch_write(inst, spill_offset);\n      }\n   }\n\n   this->live_intervals_valid = false;\n}\n\n} \/* namespace brw *\/\n<commit_msg>i965\/vs: Use a fixed set of register classes.<commit_after>\/*\n * Copyright © 2011 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\nextern \"C\" {\n#include \"main\/macros.h\"\n#include \"program\/register_allocate.h\"\n} \/* extern \"C\" *\/\n\n#include \"brw_vec4.h\"\n#include \"brw_vs.h\"\n\nusing namespace brw;\n\nnamespace brw {\n\nstatic void\nassign(unsigned int *reg_hw_locations, reg *reg)\n{\n   if (reg->file == GRF) {\n      reg->reg = reg_hw_locations[reg->reg];\n   }\n}\n\nbool\nvec4_visitor::reg_allocate_trivial()\n{\n   unsigned int hw_reg_mapping[this->virtual_grf_count];\n   bool virtual_grf_used[this->virtual_grf_count];\n   int i;\n   int next;\n\n   \/* Calculate which virtual GRFs are actually in use after whatever\n    * optimization passes have occurred.\n    *\/\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      virtual_grf_used[i] = false;\n   }\n\n   foreach_iter(exec_list_iterator, iter, this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)iter.get();\n\n      if (inst->dst.file == GRF)\n\t virtual_grf_used[inst->dst.reg] = true;\n\n      for (int i = 0; i < 3; i++) {\n\t if (inst->src[i].file == GRF)\n\t    virtual_grf_used[inst->src[i].reg] = true;\n      }\n   }\n\n   hw_reg_mapping[0] = this->first_non_payload_grf;\n   next = hw_reg_mapping[0] + this->virtual_grf_sizes[0];\n   for (i = 1; i < this->virtual_grf_count; i++) {\n      if (virtual_grf_used[i]) {\n\t hw_reg_mapping[i] = next;\n\t next += this->virtual_grf_sizes[i];\n      }\n   }\n   prog_data->total_grf = next;\n\n   foreach_iter(exec_list_iterator, iter, this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)iter.get();\n\n      assign(hw_reg_mapping, &inst->dst);\n      assign(hw_reg_mapping, &inst->src[0]);\n      assign(hw_reg_mapping, &inst->src[1]);\n      assign(hw_reg_mapping, &inst->src[2]);\n   }\n\n   if (prog_data->total_grf > max_grf) {\n      fail(\"Ran out of regs on trivial allocator (%d\/%d)\\n\",\n\t   prog_data->total_grf, max_grf);\n      return false;\n   }\n\n   return true;\n}\n\nstatic void\nbrw_alloc_reg_set(struct brw_context *brw, int base_reg_count)\n{\n   \/* After running split_virtual_grfs(), almost all VGRFs will be of size 1.\n    * SEND-from-GRF sources cannot be split, so we also need classes for each\n    * potential message length.\n    *\/\n   const int class_count = 2;\n   const int class_sizes[class_count] = {1, 2};\n\n   \/* Compute the total number of registers across all classes. *\/\n   int ra_reg_count = 0;\n   for (int i = 0; i < class_count; i++) {\n      ra_reg_count += base_reg_count - (class_sizes[i] - 1);\n   }\n\n   ralloc_free(brw->vs.ra_reg_to_grf);\n   brw->vs.ra_reg_to_grf = ralloc_array(brw, uint8_t, ra_reg_count);\n   ralloc_free(brw->vs.regs);\n   brw->vs.regs = ra_alloc_reg_set(brw, ra_reg_count);\n   if (brw->gen >= 6)\n      ra_set_allocate_round_robin(brw->vs.regs);\n   ralloc_free(brw->vs.classes);\n   brw->vs.classes = ralloc_array(brw, int, class_count + 1);\n\n   \/* Now, add the registers to their classes, and add the conflicts\n    * between them and the base GRF registers (and also each other).\n    *\/\n   int reg = 0;\n   for (int i = 0; i < class_count; i++) {\n      int class_reg_count = base_reg_count - (class_sizes[i] - 1);\n      brw->vs.classes[i] = ra_alloc_reg_class(brw->vs.regs);\n\n      for (int j = 0; j < class_reg_count; j++) {\n\t ra_class_add_reg(brw->vs.regs, brw->vs.classes[i], reg);\n\n\t brw->vs.ra_reg_to_grf[reg] = j;\n\n\t for (int base_reg = j;\n\t      base_reg < j + class_sizes[i];\n\t      base_reg++) {\n\t    ra_add_transitive_reg_conflict(brw->vs.regs, base_reg, reg);\n\t }\n\n\t reg++;\n      }\n   }\n   assert(reg == ra_reg_count);\n\n   ra_set_finalize(brw->vs.regs, NULL);\n}\n\nbool\nvec4_visitor::reg_allocate()\n{\n   unsigned int hw_reg_mapping[virtual_grf_count];\n   int first_assigned_grf = this->first_non_payload_grf;\n   int base_reg_count = max_grf - first_assigned_grf;\n\n   \/* Using the trivial allocator can be useful in debugging undefined\n    * register access as a result of broken optimization passes.\n    *\/\n   if (0)\n      return reg_allocate_trivial();\n\n   calculate_live_intervals();\n\n   brw_alloc_reg_set(brw, base_reg_count);\n\n   struct ra_graph *g = ra_alloc_interference_graph(brw->vs.regs,\n\t\t\t\t\t\t    virtual_grf_count);\n\n   for (int i = 0; i < virtual_grf_count; i++) {\n      int size = this->virtual_grf_sizes[i];\n      assert(size >= 1 && size <= 2 &&\n             \"Register allocation relies on split_virtual_grfs().\");\n      ra_set_node_class(g, i, brw->vs.classes[size - 1]);\n\n      for (int j = 0; j < i; j++) {\n\t if (virtual_grf_interferes(i, j)) {\n\t    ra_add_node_interference(g, i, j);\n\t }\n      }\n   }\n\n   if (!ra_allocate_no_spills(g)) {\n      \/* Failed to allocate registers.  Spill a reg, and the caller will\n       * loop back into here to try again.\n       *\/\n      int reg = choose_spill_reg(g);\n      if (reg == -1) {\n         fail(\"no register to spill\\n\");\n      } else {\n         spill_reg(reg);\n      }\n      ralloc_free(g);\n      return false;\n   }\n\n   \/* Get the chosen virtual registers for each node, and map virtual\n    * regs in the register classes back down to real hardware reg\n    * numbers.\n    *\/\n   prog_data->total_grf = first_assigned_grf;\n   for (int i = 0; i < virtual_grf_count; i++) {\n      int reg = ra_get_node_reg(g, i);\n\n      hw_reg_mapping[i] = first_assigned_grf + brw->vs.ra_reg_to_grf[reg];\n      prog_data->total_grf = MAX2(prog_data->total_grf,\n\t\t\t\t  hw_reg_mapping[i] + virtual_grf_sizes[i]);\n   }\n\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)node;\n\n      assign(hw_reg_mapping, &inst->dst);\n      assign(hw_reg_mapping, &inst->src[0]);\n      assign(hw_reg_mapping, &inst->src[1]);\n      assign(hw_reg_mapping, &inst->src[2]);\n   }\n\n   ralloc_free(g);\n\n   return true;\n}\n\nvoid\nvec4_visitor::evaluate_spill_costs(float *spill_costs, bool *no_spill)\n{\n   float loop_scale = 1.0;\n\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      spill_costs[i] = 0.0;\n      no_spill[i] = virtual_grf_sizes[i] != 1;\n   }\n\n   \/* Calculate costs for spilling nodes.  Call it a cost of 1 per\n    * spill\/unspill we'll have to do, and guess that the insides of\n    * loops run 10 times.\n    *\/\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *) node;\n\n      for (unsigned int i = 0; i < 3; i++) {\n\t if (inst->src[i].file == GRF) {\n\t    spill_costs[inst->src[i].reg] += loop_scale;\n            if (inst->src[i].reladdr)\n               no_spill[inst->src[i].reg] = true;\n\t }\n      }\n\n      if (inst->dst.file == GRF) {\n\t spill_costs[inst->dst.reg] += loop_scale;\n         if (inst->dst.reladdr)\n            no_spill[inst->dst.reg] = true;\n      }\n\n      switch (inst->opcode) {\n\n      case BRW_OPCODE_DO:\n\t loop_scale *= 10;\n\t break;\n\n      case BRW_OPCODE_WHILE:\n\t loop_scale \/= 10;\n\t break;\n\n      case VS_OPCODE_SCRATCH_READ:\n      case VS_OPCODE_SCRATCH_WRITE:\n         for (int i = 0; i < 3; i++) {\n            if (inst->src[i].file == GRF)\n               no_spill[inst->src[i].reg] = true;\n         }\n\t if (inst->dst.file == GRF)\n\t    no_spill[inst->dst.reg] = true;\n\t break;\n\n      default:\n\t break;\n      }\n   }\n}\n\nint\nvec4_visitor::choose_spill_reg(struct ra_graph *g)\n{\n   float spill_costs[this->virtual_grf_count];\n   bool no_spill[this->virtual_grf_count];\n\n   evaluate_spill_costs(spill_costs, no_spill);\n\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      if (!no_spill[i])\n         ra_set_node_spill_cost(g, i, spill_costs[i]);\n   }\n\n   return ra_get_best_spill_node(g);\n}\n\nvoid\nvec4_visitor::spill_reg(int spill_reg_nr)\n{\n   assert(virtual_grf_sizes[spill_reg_nr] == 1);\n   unsigned int spill_offset = c->last_scratch++;\n\n   \/* Generate spill\/unspill instructions for the objects being spilled. *\/\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *) node;\n\n      for (unsigned int i = 0; i < 3; i++) {\n         if (inst->src[i].file == GRF && inst->src[i].reg == spill_reg_nr) {\n            src_reg spill_reg = inst->src[i];\n            inst->src[i].reg = virtual_grf_alloc(1);\n            dst_reg temp = dst_reg(inst->src[i]);\n\n            \/* Only read the necessary channels, to avoid overwriting the rest\n             * with data that may not have been written to scratch.\n             *\/\n            temp.writemask = 0;\n            for (int c = 0; c < 4; c++)\n               temp.writemask |= (1 << BRW_GET_SWZ(inst->src[i].swizzle, c));\n            assert(temp.writemask != 0);\n\n            emit_scratch_read(inst, temp, spill_reg, spill_offset);\n         }\n      }\n\n      if (inst->dst.file == GRF && inst->dst.reg == spill_reg_nr) {\n         emit_scratch_write(inst, spill_offset);\n      }\n   }\n\n   this->live_intervals_valid = false;\n}\n\n} \/* namespace brw *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 __WINDOWS__\n#include <stout\/windows.hpp>\n#else\n#include <netinet\/tcp.h>\n#endif \/\/ __WINDOWS__\n\n#include <process\/io.hpp>\n#include <process\/network.hpp>\n#include <process\/socket.hpp>\n\n#include <stout\/os\/sendfile.hpp>\n#include <stout\/os\/strerror.hpp>\n#include <stout\/os.hpp>\n\n#include \"config.hpp\"\n#include \"poll_socket.hpp\"\n\nusing std::string;\n\nnamespace process {\nnamespace network {\n\nTry<std::shared_ptr<Socket::Impl>> PollSocketImpl::create(int s)\n{\n  return std::make_shared<PollSocketImpl>(s);\n}\n\n\nTry<Nothing> PollSocketImpl::listen(int backlog)\n{\n  if (::listen(get(), backlog) < 0) {\n    return ErrnoError();\n  }\n  return Nothing();\n}\n\n\nnamespace internal {\n\nFuture<Socket> accept(int fd)\n{\n  Try<int> accepted = network::accept(fd);\n  if (accepted.isError()) {\n    return Failure(accepted.error());\n  }\n\n  int s = accepted.get();\n  Try<Nothing> nonblock = os::nonblock(s);\n  if (nonblock.isError()) {\n    LOG_IF(INFO, VLOG_IS_ON(1)) << \"Failed to accept, nonblock: \"\n                                << nonblock.error();\n    os::close(s);\n    return Failure(\"Failed to accept, nonblock: \" + nonblock.error());\n  }\n\n  Try<Nothing> cloexec = os::cloexec(s);\n  if (cloexec.isError()) {\n    LOG_IF(INFO, VLOG_IS_ON(1)) << \"Failed to accept, cloexec: \"\n                                << cloexec.error();\n    os::close(s);\n    return Failure(\"Failed to accept, cloexec: \" + cloexec.error());\n  }\n\n  \/\/ Turn off Nagle (TCP_NODELAY) so pipelined requests don't wait.\n  \/\/ NOTE: We cast to `char*` here because the function prototypes on Windows\n  \/\/ use `char*` instead of `void*`.\n  int on = 1;\n  if (::setsockopt(\n          s,\n          SOL_TCP,\n          TCP_NODELAY,\n          reinterpret_cast<const char*>(&on),\n          sizeof(on)) < 0) {\n    const string error = os::strerror(errno);\n    VLOG(1) << \"Failed to turn off the Nagle algorithm: \" << error;\n    os::close(s);\n    return Failure(\n      \"Failed to turn off the Nagle algorithm: \" + stringify(error));\n  }\n\n  Try<Socket> socket = Socket::create(Socket::DEFAULT_KIND(), s);\n  if (socket.isError()) {\n    os::close(s);\n    return Failure(\"Failed to accept, create socket: \" + socket.error());\n  }\n  return socket.get();\n}\n\n} \/\/ namespace internal {\n\n\nFuture<Socket> PollSocketImpl::accept()\n{\n  return io::poll(get(), io::READ)\n    .then(lambda::bind(&internal::accept, get()));\n}\n\n\nnamespace internal {\n\nFuture<Nothing> connect(const Socket& socket)\n{\n  \/\/ Now check that a successful connection was made.\n  int opt;\n  socklen_t optlen = sizeof(opt);\n  int s = socket.get();\n\n  \/\/ NOTE: We cast to `char*` here because the function prototypes on Windows\n  \/\/ use `char*` instead of `void*`.\n  if (::getsockopt(\n          s,\n          SOL_SOCKET,\n          SO_ERROR,\n          reinterpret_cast<char*>(&opt),\n          &optlen) < 0 ||\n      opt != 0) {\n    \/\/ Connect failure.\n    VLOG(1) << \"Socket error while connecting\";\n    return Failure(\"Socket error while connecting\");\n  }\n\n  return Nothing();\n}\n\n} \/\/ namespace internal {\n\n\nFuture<Nothing> PollSocketImpl::connect(const Address& address)\n{\n  Try<int, SocketError> connect = network::connect(get(), address);\n  if (connect.isError()) {\n    if (net::is_inprogress_error(connect.error().code)) {\n      return io::poll(get(), io::WRITE)\n        .then(lambda::bind(&internal::connect, socket()));\n    }\n\n    return Failure(connect.error());\n  }\n\n  return Nothing();\n}\n\n\nFuture<size_t> PollSocketImpl::recv(char* data, size_t size)\n{\n  return io::read(get(), data, size);\n}\n\n\nnamespace internal {\n\nFuture<size_t> socket_send_data(int s, const char* data, size_t size)\n{\n  CHECK(size > 0);\n\n  while (true) {\n    ssize_t length = send(s, data, size, MSG_NOSIGNAL);\n\n#ifdef __WINDOWS__\n    int error = WSAGetLastError();\n#else\n    int error = errno;\n#endif \/\/ __WINDOWS__\n\n    if (length < 0 && net::is_restartable_error(error)) {\n      \/\/ Interrupted, try again now.\n      continue;\n    } else if (length < 0 && net::is_retryable_error(error)) {\n      \/\/ Might block, try again later.\n      return io::poll(s, io::WRITE)\n        .then(lambda::bind(&internal::socket_send_data, s, data, size));\n    } else if (length <= 0) {\n      \/\/ Socket error or closed.\n      if (length < 0) {\n        const string error = os::strerror(errno);\n        VLOG(1) << \"Socket error while sending: \" << error;\n      } else {\n        VLOG(1) << \"Socket closed while sending\";\n      }\n      if (length == 0) {\n        return length;\n      } else {\n        return Failure(ErrnoError(\"Socket send failed\"));\n      }\n    } else {\n      CHECK(length > 0);\n\n      return length;\n    }\n  }\n}\n\n\nFuture<size_t> socket_send_file(int s, int fd, off_t offset, size_t size)\n{\n  CHECK(size > 0);\n\n  while (true) {\n    ssize_t length = os::sendfile(s, fd, offset, size);\n\n    if (length < 0 && (errno == EINTR)) {\n      \/\/ Interrupted, try again now.\n      continue;\n    } else if (length < 0 && (errno == EAGAIN || errno == EWOULDBLOCK)) {\n      \/\/ Might block, try again later.\n      return io::poll(s, io::WRITE)\n        .then(lambda::bind(&internal::socket_send_file, s, fd, offset, size));\n    } else if (length <= 0) {\n      \/\/ Socket error or closed.\n      if (length < 0) {\n        const string error = os::strerror(errno);\n        VLOG(1) << \"Socket error while sending: \" << error;\n      } else {\n        VLOG(1) << \"Socket closed while sending\";\n      }\n      if (length == 0) {\n        return length;\n      } else {\n        return Failure(ErrnoError(\"Socket sendfile failed\"));\n      }\n    } else {\n      CHECK(length > 0);\n\n      return length;\n    }\n  }\n}\n\n} \/\/ namespace internal {\n\n\nFuture<size_t> PollSocketImpl::send(const char* data, size_t size)\n{\n  return io::poll(get(), io::WRITE)\n    .then(lambda::bind(&internal::socket_send_data, get(), data, size));\n}\n\n\nFuture<size_t> PollSocketImpl::sendfile(int fd, off_t offset, size_t size)\n{\n  return io::poll(get(), io::WRITE)\n    .then(lambda::bind(&internal::socket_send_file, get(), fd, offset, size));\n}\n\n} \/\/ namespace network {\n} \/\/ namespace process {\n<commit_msg>Windows: Used `sendfile` with the typed error state of `Try`.<commit_after>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 __WINDOWS__\n#include <stout\/windows.hpp>\n#else\n#include <netinet\/tcp.h>\n#endif \/\/ __WINDOWS__\n\n#include <process\/io.hpp>\n#include <process\/network.hpp>\n#include <process\/socket.hpp>\n\n#include <stout\/os\/sendfile.hpp>\n#include <stout\/os\/strerror.hpp>\n#include <stout\/os.hpp>\n\n#include \"config.hpp\"\n#include \"poll_socket.hpp\"\n\nusing std::string;\n\nnamespace process {\nnamespace network {\n\nTry<std::shared_ptr<Socket::Impl>> PollSocketImpl::create(int s)\n{\n  return std::make_shared<PollSocketImpl>(s);\n}\n\n\nTry<Nothing> PollSocketImpl::listen(int backlog)\n{\n  if (::listen(get(), backlog) < 0) {\n    return ErrnoError();\n  }\n  return Nothing();\n}\n\n\nnamespace internal {\n\nFuture<Socket> accept(int fd)\n{\n  Try<int> accepted = network::accept(fd);\n  if (accepted.isError()) {\n    return Failure(accepted.error());\n  }\n\n  int s = accepted.get();\n  Try<Nothing> nonblock = os::nonblock(s);\n  if (nonblock.isError()) {\n    LOG_IF(INFO, VLOG_IS_ON(1)) << \"Failed to accept, nonblock: \"\n                                << nonblock.error();\n    os::close(s);\n    return Failure(\"Failed to accept, nonblock: \" + nonblock.error());\n  }\n\n  Try<Nothing> cloexec = os::cloexec(s);\n  if (cloexec.isError()) {\n    LOG_IF(INFO, VLOG_IS_ON(1)) << \"Failed to accept, cloexec: \"\n                                << cloexec.error();\n    os::close(s);\n    return Failure(\"Failed to accept, cloexec: \" + cloexec.error());\n  }\n\n  \/\/ Turn off Nagle (TCP_NODELAY) so pipelined requests don't wait.\n  \/\/ NOTE: We cast to `char*` here because the function prototypes on Windows\n  \/\/ use `char*` instead of `void*`.\n  int on = 1;\n  if (::setsockopt(\n          s,\n          SOL_TCP,\n          TCP_NODELAY,\n          reinterpret_cast<const char*>(&on),\n          sizeof(on)) < 0) {\n    const string error = os::strerror(errno);\n    VLOG(1) << \"Failed to turn off the Nagle algorithm: \" << error;\n    os::close(s);\n    return Failure(\n      \"Failed to turn off the Nagle algorithm: \" + stringify(error));\n  }\n\n  Try<Socket> socket = Socket::create(Socket::DEFAULT_KIND(), s);\n  if (socket.isError()) {\n    os::close(s);\n    return Failure(\"Failed to accept, create socket: \" + socket.error());\n  }\n  return socket.get();\n}\n\n} \/\/ namespace internal {\n\n\nFuture<Socket> PollSocketImpl::accept()\n{\n  return io::poll(get(), io::READ)\n    .then(lambda::bind(&internal::accept, get()));\n}\n\n\nnamespace internal {\n\nFuture<Nothing> connect(const Socket& socket)\n{\n  \/\/ Now check that a successful connection was made.\n  int opt;\n  socklen_t optlen = sizeof(opt);\n  int s = socket.get();\n\n  \/\/ NOTE: We cast to `char*` here because the function prototypes on Windows\n  \/\/ use `char*` instead of `void*`.\n  if (::getsockopt(\n          s,\n          SOL_SOCKET,\n          SO_ERROR,\n          reinterpret_cast<char*>(&opt),\n          &optlen) < 0 ||\n      opt != 0) {\n    \/\/ Connect failure.\n    VLOG(1) << \"Socket error while connecting\";\n    return Failure(\"Socket error while connecting\");\n  }\n\n  return Nothing();\n}\n\n} \/\/ namespace internal {\n\n\nFuture<Nothing> PollSocketImpl::connect(const Address& address)\n{\n  Try<int, SocketError> connect = network::connect(get(), address);\n  if (connect.isError()) {\n    if (net::is_inprogress_error(connect.error().code)) {\n      return io::poll(get(), io::WRITE)\n        .then(lambda::bind(&internal::connect, socket()));\n    }\n\n    return Failure(connect.error());\n  }\n\n  return Nothing();\n}\n\n\nFuture<size_t> PollSocketImpl::recv(char* data, size_t size)\n{\n  return io::read(get(), data, size);\n}\n\n\nnamespace internal {\n\nFuture<size_t> socket_send_data(int s, const char* data, size_t size)\n{\n  CHECK(size > 0);\n\n  while (true) {\n    ssize_t length = send(s, data, size, MSG_NOSIGNAL);\n\n#ifdef __WINDOWS__\n    int error = WSAGetLastError();\n#else\n    int error = errno;\n#endif \/\/ __WINDOWS__\n\n    if (length < 0 && net::is_restartable_error(error)) {\n      \/\/ Interrupted, try again now.\n      continue;\n    } else if (length < 0 && net::is_retryable_error(error)) {\n      \/\/ Might block, try again later.\n      return io::poll(s, io::WRITE)\n        .then(lambda::bind(&internal::socket_send_data, s, data, size));\n    } else if (length <= 0) {\n      \/\/ Socket error or closed.\n      if (length < 0) {\n        const string error = os::strerror(errno);\n        VLOG(1) << \"Socket error while sending: \" << error;\n      } else {\n        VLOG(1) << \"Socket closed while sending\";\n      }\n      if (length == 0) {\n        return length;\n      } else {\n        return Failure(ErrnoError(\"Socket send failed\"));\n      }\n    } else {\n      CHECK(length > 0);\n\n      return length;\n    }\n  }\n}\n\n\nFuture<size_t> socket_send_file(int s, int fd, off_t offset, size_t size)\n{\n  CHECK(size > 0);\n\n  while (true) {\n    Try<ssize_t, SocketError> length = os::sendfile(s, fd, offset, size);\n\n    if (length.isSome()) {\n      CHECK(length.get() >= 0);\n      if (length.get() == 0) {\n        \/\/ Socket closed.\n        VLOG(1) << \"Socket closed while sending\";\n      }\n      return length.get();\n    }\n\n    if (net::is_restartable_error(length.error().code)) {\n      \/\/ Interrupted, try again now.\n      continue;\n    } else if (net::is_retryable_error(length.error().code)) {\n      \/\/ Might block, try again later.\n      return io::poll(s, io::WRITE)\n        .then(lambda::bind(&internal::socket_send_file, s, fd, offset, size));\n    } else {\n      \/\/ Socket error or closed.\n      VLOG(1) << length.error().message;\n      return Failure(length.error());\n    };\n  }\n}\n\n} \/\/ namespace internal {\n\n\nFuture<size_t> PollSocketImpl::send(const char* data, size_t size)\n{\n  return io::poll(get(), io::WRITE)\n    .then(lambda::bind(&internal::socket_send_data, get(), data, size));\n}\n\n\nFuture<size_t> PollSocketImpl::sendfile(int fd, off_t offset, size_t size)\n{\n  return io::poll(get(), io::WRITE)\n    .then(lambda::bind(&internal::socket_send_file, get(), fd, offset, size));\n}\n\n} \/\/ namespace network {\n} \/\/ namespace process {\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 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 \"compileoutputwindow.h\"\n#include \"buildmanager.h\"\n#include \"showoutputtaskhandler.h\"\n#include \"task.h\"\n#include \"projectexplorerconstants.h\"\n#include \"projectexplorer.h\"\n#include \"projectexplorersettings.h\"\n#include \"taskhub.h\"\n\n#include <coreplugin\/icontext.h>\n#include <find\/basetextfind.h>\n#include <aggregation\/aggregate.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <texteditor\/texteditorsettings.h>\n#include <texteditor\/fontsettings.h>\n\n#include <QKeyEvent>\n#include <QIcon>\n#include <QTextCharFormat>\n#include <QTextBlock>\n#include <QTextCursor>\n#include <QTextEdit>\n#include <QScrollBar>\n#include <QPlainTextEdit>\n#include <QToolButton>\n\nusing namespace ProjectExplorer;\nusing namespace ProjectExplorer::Internal;\n\nnamespace {\nconst int MAX_LINECOUNT = 50000;\n}\n\nnamespace ProjectExplorer {\nnamespace Internal {\n\nclass CompileOutputTextEdit : public Core::OutputWindow\n{\n    Q_OBJECT\npublic:\n    CompileOutputTextEdit(const Core::Context &context) : Core::OutputWindow(context)\n    {\n        fontSettingsChanged();\n        connect(TextEditor::TextEditorSettings::instance(), SIGNAL(fontSettingsChanged(TextEditor::FontSettings)),\n                this, SLOT(fontSettingsChanged()));\n    }\n\n    void addTask(const Task &task, int blocknumber)\n    {\n        m_taskids.insert(blocknumber, task.taskId);\n    }\n\n    void clearTasks()\n    {\n        m_taskids.clear();\n    }\nprivate slots:\n    void fontSettingsChanged()\n    {\n        setFont(TextEditor::TextEditorSettings::instance()->fontSettings().font());\n    }\n\nprotected:\n    void mouseDoubleClickEvent(QMouseEvent *ev)\n    {\n        int line = cursorForPosition(ev->pos()).block().blockNumber();\n        if (unsigned taskid = m_taskids.value(line, 0)) {\n            TaskHub *hub = ExtensionSystem::PluginManager::getObject<TaskHub>();\n            hub->showTaskInEditor(taskid);\n        } else {\n            QPlainTextEdit::mouseDoubleClickEvent(ev);\n        }\n    }\n\nprivate:\n    QHash<int, unsigned int> m_taskids;   \/\/Map blocknumber to taskId\n};\n\n} \/\/ namespace Internal\n} \/\/ namespace ProjectExplorer\n\nCompileOutputWindow::CompileOutputWindow(BuildManager * \/*bm*\/, QAction *cancelBuildAction) :\n    m_cancelBuildButton(new QToolButton)\n{\n    Core::Context context(Constants::C_COMPILE_OUTPUT);\n    m_outputWindow = new CompileOutputTextEdit(context);\n    m_outputWindow->setWindowTitle(tr(\"Compile Output\"));\n    m_outputWindow->setWindowIcon(QIcon(QLatin1String(Constants::ICON_WINDOW)));\n    m_outputWindow->setReadOnly(true);\n    m_outputWindow->setUndoRedoEnabled(false);\n    m_outputWindow->setMaxLineCount(MAX_LINECOUNT);\n\n    m_cancelBuildButton->setDefaultAction(cancelBuildAction);\n\n    Aggregation::Aggregate *agg = new Aggregation::Aggregate;\n    agg->add(m_outputWindow);\n    agg->add(new Find::BaseTextFind(m_outputWindow));\n\n    qRegisterMetaType<QTextCharFormat>(\"QTextCharFormat\");\n\n    m_handler = new ShowOutputTaskHandler(this);\n    ExtensionSystem::PluginManager::addObject(m_handler);\n    connect(ProjectExplorerPlugin::instance(), SIGNAL(settingsChanged()),\n            this, SLOT(updateWordWrapMode()));\n    updateWordWrapMode();\n}\n\nCompileOutputWindow::~CompileOutputWindow()\n{\n    ExtensionSystem::PluginManager::removeObject(m_handler);\n    delete m_handler;\n    delete m_cancelBuildButton;\n}\n\nvoid CompileOutputWindow::updateWordWrapMode()\n{\n    m_outputWindow->setWordWrapEnabled(ProjectExplorerPlugin::instance()->projectExplorerSettings().wrapAppOutput);\n}\n\nbool CompileOutputWindow::hasFocus() const\n{\n    return m_outputWindow->hasFocus();\n}\n\nbool CompileOutputWindow::canFocus() const\n{\n    return true;\n}\n\nvoid CompileOutputWindow::setFocus()\n{\n    m_outputWindow->setFocus();\n}\n\nQWidget *CompileOutputWindow::outputWidget(QWidget *)\n{\n    return m_outputWindow;\n}\n\nQList<QWidget *> CompileOutputWindow::toolBarWidgets() const\n{\n     return QList<QWidget *>() << m_cancelBuildButton;\n}\n\nstatic QColor mix_colors(QColor a, QColor b)\n{\n    return QColor((a.red() + 2 * b.red()) \/ 3, (a.green() + 2 * b.green()) \/ 3,\n                  (a.blue() + 2* b.blue()) \/ 3, (a.alpha() + 2 * b.alpha()) \/ 3);\n}\n\nvoid CompileOutputWindow::appendText(const QString &text, ProjectExplorer::BuildStep::OutputFormat format)\n{\n    QPalette p = m_outputWindow->palette();\n    QTextCharFormat textFormat;\n    switch (format) {\n    case BuildStep::NormalOutput:\n        textFormat.setForeground(p.color(QPalette::Text));\n        textFormat.setFontWeight(QFont::Normal);\n        break;\n    case BuildStep::ErrorOutput:\n        textFormat.setForeground(mix_colors(p.color(QPalette::Text), QColor(Qt::red)));\n        textFormat.setFontWeight(QFont::Normal);\n        break;\n    case BuildStep::MessageOutput:\n        textFormat.setForeground(mix_colors(p.color(QPalette::Text), QColor(Qt::blue)));\n        break;\n    case BuildStep::ErrorMessageOutput:\n        textFormat.setForeground(mix_colors(p.color(QPalette::Text), QColor(Qt::red)));\n        textFormat.setFontWeight(QFont::Bold);\n        break;\n\n    }\n\n    m_outputWindow->appendText(text, textFormat);\n}\n\nvoid CompileOutputWindow::clearContents()\n{\n    m_outputWindow->clear();\n    m_outputWindow->clearTasks();\n    m_taskPositions.clear();\n}\n\nvoid CompileOutputWindow::visibilityChanged(bool)\n{\n\n}\n\nint CompileOutputWindow::priorityInStatusBar() const\n{\n    return 50;\n}\n\nbool CompileOutputWindow::canNext() const\n{\n    return false;\n}\n\nbool CompileOutputWindow::canPrevious() const\n{\n    return false;\n}\n\nvoid CompileOutputWindow::goToNext()\n{\n\n}\n\nvoid CompileOutputWindow::goToPrev()\n{\n\n}\n\nbool CompileOutputWindow::canNavigate() const\n{\n    return false;\n}\n\nvoid CompileOutputWindow::registerPositionOf(const Task &task)\n{\n    int blocknumber = m_outputWindow->blockCount();\n    if (blocknumber > MAX_LINECOUNT)\n        return;\n\n    m_taskPositions.insert(task.taskId, blocknumber);\n    m_outputWindow->addTask(task, blocknumber);\n}\n\nbool CompileOutputWindow::knowsPositionOf(const Task &task)\n{\n    return (m_taskPositions.contains(task.taskId));\n}\n\nvoid CompileOutputWindow::showPositionOf(const Task &task)\n{\n    int position = m_taskPositions.value(task.taskId);\n    QTextCursor newCursor(m_outputWindow->document()->findBlockByNumber(position));\n    newCursor.movePosition(QTextCursor::EndOfBlock, QTextCursor::KeepAnchor);\n    m_outputWindow->setTextCursor(newCursor);\n}\n\n#include \"compileoutputwindow.moc\"\n<commit_msg>CompileOutputWindow: Allow for 100k lines<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 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 \"compileoutputwindow.h\"\n#include \"buildmanager.h\"\n#include \"showoutputtaskhandler.h\"\n#include \"task.h\"\n#include \"projectexplorerconstants.h\"\n#include \"projectexplorer.h\"\n#include \"projectexplorersettings.h\"\n#include \"taskhub.h\"\n\n#include <coreplugin\/icontext.h>\n#include <find\/basetextfind.h>\n#include <aggregation\/aggregate.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <texteditor\/texteditorsettings.h>\n#include <texteditor\/fontsettings.h>\n\n#include <QKeyEvent>\n#include <QIcon>\n#include <QTextCharFormat>\n#include <QTextBlock>\n#include <QTextCursor>\n#include <QTextEdit>\n#include <QScrollBar>\n#include <QPlainTextEdit>\n#include <QToolButton>\n\nusing namespace ProjectExplorer;\nusing namespace ProjectExplorer::Internal;\n\nnamespace {\nconst int MAX_LINECOUNT = 100000;\n}\n\nnamespace ProjectExplorer {\nnamespace Internal {\n\nclass CompileOutputTextEdit : public Core::OutputWindow\n{\n    Q_OBJECT\npublic:\n    CompileOutputTextEdit(const Core::Context &context) : Core::OutputWindow(context)\n    {\n        fontSettingsChanged();\n        connect(TextEditor::TextEditorSettings::instance(), SIGNAL(fontSettingsChanged(TextEditor::FontSettings)),\n                this, SLOT(fontSettingsChanged()));\n    }\n\n    void addTask(const Task &task, int blocknumber)\n    {\n        m_taskids.insert(blocknumber, task.taskId);\n    }\n\n    void clearTasks()\n    {\n        m_taskids.clear();\n    }\nprivate slots:\n    void fontSettingsChanged()\n    {\n        setFont(TextEditor::TextEditorSettings::instance()->fontSettings().font());\n    }\n\nprotected:\n    void mouseDoubleClickEvent(QMouseEvent *ev)\n    {\n        int line = cursorForPosition(ev->pos()).block().blockNumber();\n        if (unsigned taskid = m_taskids.value(line, 0)) {\n            TaskHub *hub = ExtensionSystem::PluginManager::getObject<TaskHub>();\n            hub->showTaskInEditor(taskid);\n        } else {\n            QPlainTextEdit::mouseDoubleClickEvent(ev);\n        }\n    }\n\nprivate:\n    QHash<int, unsigned int> m_taskids;   \/\/Map blocknumber to taskId\n};\n\n} \/\/ namespace Internal\n} \/\/ namespace ProjectExplorer\n\nCompileOutputWindow::CompileOutputWindow(BuildManager * \/*bm*\/, QAction *cancelBuildAction) :\n    m_cancelBuildButton(new QToolButton)\n{\n    Core::Context context(Constants::C_COMPILE_OUTPUT);\n    m_outputWindow = new CompileOutputTextEdit(context);\n    m_outputWindow->setWindowTitle(tr(\"Compile Output\"));\n    m_outputWindow->setWindowIcon(QIcon(QLatin1String(Constants::ICON_WINDOW)));\n    m_outputWindow->setReadOnly(true);\n    m_outputWindow->setUndoRedoEnabled(false);\n    m_outputWindow->setMaxLineCount(MAX_LINECOUNT);\n\n    m_cancelBuildButton->setDefaultAction(cancelBuildAction);\n\n    Aggregation::Aggregate *agg = new Aggregation::Aggregate;\n    agg->add(m_outputWindow);\n    agg->add(new Find::BaseTextFind(m_outputWindow));\n\n    qRegisterMetaType<QTextCharFormat>(\"QTextCharFormat\");\n\n    m_handler = new ShowOutputTaskHandler(this);\n    ExtensionSystem::PluginManager::addObject(m_handler);\n    connect(ProjectExplorerPlugin::instance(), SIGNAL(settingsChanged()),\n            this, SLOT(updateWordWrapMode()));\n    updateWordWrapMode();\n}\n\nCompileOutputWindow::~CompileOutputWindow()\n{\n    ExtensionSystem::PluginManager::removeObject(m_handler);\n    delete m_handler;\n    delete m_cancelBuildButton;\n}\n\nvoid CompileOutputWindow::updateWordWrapMode()\n{\n    m_outputWindow->setWordWrapEnabled(ProjectExplorerPlugin::instance()->projectExplorerSettings().wrapAppOutput);\n}\n\nbool CompileOutputWindow::hasFocus() const\n{\n    return m_outputWindow->hasFocus();\n}\n\nbool CompileOutputWindow::canFocus() const\n{\n    return true;\n}\n\nvoid CompileOutputWindow::setFocus()\n{\n    m_outputWindow->setFocus();\n}\n\nQWidget *CompileOutputWindow::outputWidget(QWidget *)\n{\n    return m_outputWindow;\n}\n\nQList<QWidget *> CompileOutputWindow::toolBarWidgets() const\n{\n     return QList<QWidget *>() << m_cancelBuildButton;\n}\n\nstatic QColor mix_colors(QColor a, QColor b)\n{\n    return QColor((a.red() + 2 * b.red()) \/ 3, (a.green() + 2 * b.green()) \/ 3,\n                  (a.blue() + 2* b.blue()) \/ 3, (a.alpha() + 2 * b.alpha()) \/ 3);\n}\n\nvoid CompileOutputWindow::appendText(const QString &text, ProjectExplorer::BuildStep::OutputFormat format)\n{\n    QPalette p = m_outputWindow->palette();\n    QTextCharFormat textFormat;\n    switch (format) {\n    case BuildStep::NormalOutput:\n        textFormat.setForeground(p.color(QPalette::Text));\n        textFormat.setFontWeight(QFont::Normal);\n        break;\n    case BuildStep::ErrorOutput:\n        textFormat.setForeground(mix_colors(p.color(QPalette::Text), QColor(Qt::red)));\n        textFormat.setFontWeight(QFont::Normal);\n        break;\n    case BuildStep::MessageOutput:\n        textFormat.setForeground(mix_colors(p.color(QPalette::Text), QColor(Qt::blue)));\n        break;\n    case BuildStep::ErrorMessageOutput:\n        textFormat.setForeground(mix_colors(p.color(QPalette::Text), QColor(Qt::red)));\n        textFormat.setFontWeight(QFont::Bold);\n        break;\n\n    }\n\n    m_outputWindow->appendText(text, textFormat);\n}\n\nvoid CompileOutputWindow::clearContents()\n{\n    m_outputWindow->clear();\n    m_outputWindow->clearTasks();\n    m_taskPositions.clear();\n}\n\nvoid CompileOutputWindow::visibilityChanged(bool)\n{\n\n}\n\nint CompileOutputWindow::priorityInStatusBar() const\n{\n    return 50;\n}\n\nbool CompileOutputWindow::canNext() const\n{\n    return false;\n}\n\nbool CompileOutputWindow::canPrevious() const\n{\n    return false;\n}\n\nvoid CompileOutputWindow::goToNext()\n{\n\n}\n\nvoid CompileOutputWindow::goToPrev()\n{\n\n}\n\nbool CompileOutputWindow::canNavigate() const\n{\n    return false;\n}\n\nvoid CompileOutputWindow::registerPositionOf(const Task &task)\n{\n    int blocknumber = m_outputWindow->blockCount();\n    if (blocknumber > MAX_LINECOUNT)\n        return;\n\n    m_taskPositions.insert(task.taskId, blocknumber);\n    m_outputWindow->addTask(task, blocknumber);\n}\n\nbool CompileOutputWindow::knowsPositionOf(const Task &task)\n{\n    return (m_taskPositions.contains(task.taskId));\n}\n\nvoid CompileOutputWindow::showPositionOf(const Task &task)\n{\n    int position = m_taskPositions.value(task.taskId);\n    QTextCursor newCursor(m_outputWindow->document()->findBlockByNumber(position));\n    newCursor.movePosition(QTextCursor::EndOfBlock, QTextCursor::KeepAnchor);\n    m_outputWindow->setTextCursor(newCursor);\n}\n\n#include \"compileoutputwindow.moc\"\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 (info@qt.nokia.com)\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** 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** Other Usage\n**\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** If you have questions regarding the use of this file, please contact\n** Nokia at info@qt.nokia.com.\n**\n**************************************************************************\/\n#include \"remotelinuxdebugsupport.h\"\n\n#include \"linuxdeviceconfiguration.h\"\n#include \"remotelinuxapplicationrunner.h\"\n#include \"remotelinuxrunconfiguration.h\"\n#include \"remotelinuxusedportsgatherer.h\"\n\n#include <debugger\/debuggerengine.h>\n#include <debugger\/debuggerstartparameters.h>\n#include <projectexplorer\/abi.h>\n#include <projectexplorer\/project.h>\n#include <projectexplorer\/target.h>\n#include <projectexplorer\/toolchain.h>\n#include <qt4projectmanager\/qt4buildconfiguration.h>\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QPointer>\n#include <QtCore\/QSharedPointer>\n\nusing namespace Utils;\nusing namespace Debugger;\nusing namespace ProjectExplorer;\n\nnamespace RemoteLinux {\nnamespace Internal {\nnamespace {\nenum State { Inactive, StartingRunner, StartingRemoteProcess, Debugging };\n} \/\/ anonymous namespace\n\nclass AbstractRemoteLinuxDebugSupportPrivate\n{\npublic:\n    AbstractRemoteLinuxDebugSupportPrivate(RemoteLinuxRunConfiguration *runConfig,\n            DebuggerEngine *engine)\n        : engine(engine), runConfig(runConfig), deviceConfig(runConfig->deviceConfig()),\n          debuggingType(runConfig->debuggingType()), state(Inactive),\n          gdbServerPort(-1), qmlPort(-1)\n    {\n    }\n\n    const QPointer<Debugger::DebuggerEngine> engine;\n    const QPointer<RemoteLinuxRunConfiguration> runConfig;\n    const LinuxDeviceConfiguration::ConstPtr deviceConfig;\n    const RemoteLinuxRunConfiguration::DebuggingType debuggingType;\n\n    QByteArray gdbserverOutput;\n    State state;\n    int gdbServerPort;\n    int qmlPort;\n};\n\nclass RemoteLinuxDebugSupportPrivate\n{\npublic:\n    RemoteLinuxDebugSupportPrivate(RemoteLinuxRunConfiguration *runConfig) : runner(runConfig) {}\n\n    GenericRemoteLinuxApplicationRunner runner;\n};\n\n} \/\/ namespace Internal\n\nusing namespace Internal;\n\nDebuggerStartParameters AbstractRemoteLinuxDebugSupport::startParameters(const RemoteLinuxRunConfiguration *runConfig)\n{\n    DebuggerStartParameters params;\n    const LinuxDeviceConfiguration::ConstPtr &devConf = runConfig->deviceConfig();\n    const RemoteLinuxRunConfiguration::DebuggingType debuggingType\n        = runConfig->debuggingType();\n    if (debuggingType != RemoteLinuxRunConfiguration::DebugCppOnly) {\n        params.qmlServerAddress = runConfig->deviceConfig()->sshParameters().host;\n        params.qmlServerPort = -1;\n    }\n    if (debuggingType != RemoteLinuxRunConfiguration::DebugQmlOnly) {\n        params.processArgs = runConfig->arguments();\n        if (runConfig->activeQt4BuildConfiguration()->qtVersion())\n            params.sysroot = runConfig->activeQt4BuildConfiguration()->qtVersion()->systemRoot();\n        params.toolChainAbi = runConfig->abi();\n        params.startMode = AttachToRemote;\n        params.executable = runConfig->localExecutableFilePath();\n        params.debuggerCommand = runConfig->gdbCmd();\n        params.remoteChannel = devConf->sshParameters().host + QLatin1String(\":-1\");\n        params.useServerStartScript = true;\n\n        \/\/ TODO: This functionality should be inside the debugger.\n        const ProjectExplorer::Abi &abi = runConfig->target()\n            ->activeBuildConfiguration()->toolChain()->targetAbi();\n        params.remoteArchitecture = abi.toString();\n        params.gnuTarget = QLatin1String(abi.architecture() == ProjectExplorer::Abi::ArmArchitecture\n            ? \"arm-none-linux-gnueabi\": \"i386-unknown-linux-gnu\");\n    } else {\n        params.startMode = AttachToRemote;\n    }\n    params.displayName = runConfig->displayName();\n\n    if (const ProjectExplorer::Project *project = runConfig->target()->project()) {\n        params.projectSourceDirectory = project->projectDirectory();\n        if (const ProjectExplorer::BuildConfiguration *buildConfig = runConfig->target()->activeBuildConfiguration()) {\n            params.projectBuildDirectory = buildConfig->buildDirectory();\n        }\n        params.projectSourceFiles = project->files(Project::ExcludeGeneratedFiles);\n    }\n\n    return params;\n}\n\nAbstractRemoteLinuxDebugSupport::AbstractRemoteLinuxDebugSupport(RemoteLinuxRunConfiguration *runConfig,\n        DebuggerEngine *engine)\n    : QObject(engine), m_d(new AbstractRemoteLinuxDebugSupportPrivate(runConfig, engine))\n{\n    connect(m_d->engine, SIGNAL(requestRemoteSetup()), this, SLOT(handleAdapterSetupRequested()));\n}\n\nAbstractRemoteLinuxDebugSupport::~AbstractRemoteLinuxDebugSupport()\n{\n    setFinished();\n    delete m_d;\n}\n\nvoid AbstractRemoteLinuxDebugSupport::showMessage(const QString &msg, int channel)\n{\n    if (m_d->engine)\n        m_d->engine->showMessage(msg, channel);\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleAdapterSetupRequested()\n{\n    QTC_ASSERT(m_d->state == Inactive, return);\n\n    m_d->state = StartingRunner;\n    showMessage(tr(\"Preparing remote side ...\\n\"), AppStuff);\n    disconnect(runner(), 0, this, 0);\n    connect(runner(), SIGNAL(error(QString)), this, SLOT(handleSshError(QString)));\n    connect(runner(), SIGNAL(readyForExecution()), this, SLOT(startExecution()));\n    connect(runner(), SIGNAL(reportProgress(QString)), this, SLOT(handleProgressReport(QString)));\n    runner()->start();\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleSshError(const QString &error)\n{\n    if (m_d->state == Debugging) {\n        showMessage(error, AppError);\n        if (m_d->engine)\n            m_d->engine->notifyInferiorIll();\n    } else if (m_d->state != Inactive) {\n        handleAdapterSetupFailed(error);\n    }\n}\n\nvoid AbstractRemoteLinuxDebugSupport::startExecution()\n{\n    if (m_d->state == Inactive)\n        return;\n\n    QTC_ASSERT(m_d->state == StartingRunner, return);\n\n    if (m_d->debuggingType != RemoteLinuxRunConfiguration::DebugQmlOnly) {\n        if (!setPort(m_d->gdbServerPort))\n            return;\n    }\n    if (m_d->debuggingType != RemoteLinuxRunConfiguration::DebugCppOnly) {\n        if (!setPort(m_d->qmlPort))\n            return;\n    }\n\n    m_d->state = StartingRemoteProcess;\n    m_d->gdbserverOutput.clear();\n    connect(runner(), SIGNAL(remoteErrorOutput(QByteArray)), this,\n        SLOT(handleRemoteErrorOutput(QByteArray)));\n    connect(runner(), SIGNAL(remoteOutput(QByteArray)), this,\n        SLOT(handleRemoteOutput(QByteArray)));\n    if (m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly) {\n        connect(runner(), SIGNAL(remoteProcessStarted()),\n            SLOT(handleRemoteProcessStarted()));\n    }\n    const QString &remoteExe = runner()->remoteExecutable();\n    QString args = runner()->arguments();\n    if (m_d->debuggingType != RemoteLinuxRunConfiguration::DebugCppOnly) {\n        args += QString(QLatin1String(\" -qmljsdebugger=port:%1,block\"))\n            .arg(m_d->qmlPort);\n    }\n\n    const QString remoteCommandLine = m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly\n        ? QString::fromLocal8Bit(\"%1 %2 %3\").arg(runner()->commandPrefix()).arg(remoteExe).arg(args)\n        : QString::fromLocal8Bit(\"%1 gdbserver :%2 %3 %4\").arg(runner()->commandPrefix())\n              .arg(m_d->gdbServerPort).arg(remoteExe).arg(args);\n    connect(runner(), SIGNAL(remoteProcessFinished(qint64)),\n        SLOT(handleRemoteProcessFinished(qint64)));\n    runner()->startExecution(remoteCommandLine.toUtf8());\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleRemoteProcessFinished(qint64 exitCode)\n{\n    if (!m_d->engine || m_d->state == Inactive)\n        return;\n\n    if (m_d->state == Debugging) {\n        \/\/ The QML engine does not realize on its own that the application has finished.\n        if (m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly)\n            m_d->engine->quitDebugger();\n        else if (exitCode != 0)\n            m_d->engine->notifyInferiorIll();\n\n    } else {\n        const QString errorMsg = m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly\n            ? tr(\"Remote application failed with exit code %1.\").arg(exitCode)\n            : tr(\"The gdbserver process closed unexpectedly.\");\n        m_d->engine->handleRemoteSetupFailed(errorMsg);\n    }\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleDebuggingFinished()\n{\n    setFinished();\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleRemoteOutput(const QByteArray &output)\n{\n    QTC_ASSERT(m_d->state == Inactive || m_d->state == Debugging, return);\n\n    showMessage(QString::fromUtf8(output), AppOutput);\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleRemoteErrorOutput(const QByteArray &output)\n{\n    QTC_ASSERT(m_d->state == Inactive || m_d->state == StartingRemoteProcess || m_d->state == Debugging,\n        return);\n\n    if (!m_d->engine)\n        return;\n\n    showMessage(QString::fromUtf8(output), AppOutput);\n    if (m_d->state == StartingRemoteProcess\n            && m_d->debuggingType != RemoteLinuxRunConfiguration::DebugQmlOnly) {\n        m_d->gdbserverOutput += output;\n        if (m_d->gdbserverOutput.contains(\"Listening on port\")) {\n            handleAdapterSetupDone();\n            m_d->gdbserverOutput.clear();\n        }\n    }\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleProgressReport(const QString &progressOutput)\n{\n    showMessage(progressOutput + QLatin1Char('\\n'), AppStuff);\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleAdapterSetupFailed(const QString &error)\n{\n    setFinished();\n    m_d->engine->handleRemoteSetupFailed(tr(\"Initial setup failed: %1\").arg(error));\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleAdapterSetupDone()\n{\n    m_d->state = Debugging;\n    m_d->engine->handleRemoteSetupDone(m_d->gdbServerPort, m_d->qmlPort);\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleRemoteProcessStarted()\n{\n    Q_ASSERT(m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly);\n    QTC_ASSERT(m_d->state == StartingRemoteProcess, return);\n\n    handleAdapterSetupDone();\n}\n\nvoid AbstractRemoteLinuxDebugSupport::setFinished()\n{\n    if (m_d->state == Inactive)\n        return;\n    m_d->state = Inactive;\n    runner()->stop();\n}\n\nbool AbstractRemoteLinuxDebugSupport::setPort(int &port)\n{\n    port = runner()->usedPortsGatherer()->getNextFreePort(runner()->freePorts());\n    if (port == -1) {\n        handleAdapterSetupFailed(tr(\"Not enough free ports on device for debugging.\"));\n        return false;\n    }\n    return true;\n}\n\n\nRemoteLinuxDebugSupport::RemoteLinuxDebugSupport(RemoteLinuxRunConfiguration *runConfig,\n        DebuggerEngine *engine)\n    : AbstractRemoteLinuxDebugSupport(runConfig, engine),\n      m_d(new RemoteLinuxDebugSupportPrivate(runConfig))\n{\n}\n\nRemoteLinuxDebugSupport::~RemoteLinuxDebugSupport()\n{\n    delete m_d;\n}\n\nAbstractRemoteLinuxApplicationRunner *RemoteLinuxDebugSupport::runner() const\n{\n    return &m_d->runner;\n}\n\n} \/\/ namespace RemoteLinux\n<commit_msg>RemoteLinux: Remove unused class member.<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 (info@qt.nokia.com)\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** 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** Other Usage\n**\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** If you have questions regarding the use of this file, please contact\n** Nokia at info@qt.nokia.com.\n**\n**************************************************************************\/\n#include \"remotelinuxdebugsupport.h\"\n\n#include \"linuxdeviceconfiguration.h\"\n#include \"remotelinuxapplicationrunner.h\"\n#include \"remotelinuxrunconfiguration.h\"\n#include \"remotelinuxusedportsgatherer.h\"\n\n#include <debugger\/debuggerengine.h>\n#include <debugger\/debuggerstartparameters.h>\n#include <projectexplorer\/abi.h>\n#include <projectexplorer\/project.h>\n#include <projectexplorer\/target.h>\n#include <projectexplorer\/toolchain.h>\n#include <qt4projectmanager\/qt4buildconfiguration.h>\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QPointer>\n#include <QtCore\/QSharedPointer>\n\nusing namespace Utils;\nusing namespace Debugger;\nusing namespace ProjectExplorer;\n\nnamespace RemoteLinux {\nnamespace Internal {\nnamespace {\nenum State { Inactive, StartingRunner, StartingRemoteProcess, Debugging };\n} \/\/ anonymous namespace\n\nclass AbstractRemoteLinuxDebugSupportPrivate\n{\npublic:\n    AbstractRemoteLinuxDebugSupportPrivate(RemoteLinuxRunConfiguration *runConfig,\n            DebuggerEngine *engine)\n        : engine(engine), deviceConfig(runConfig->deviceConfig()),\n          debuggingType(runConfig->debuggingType()), state(Inactive),\n          gdbServerPort(-1), qmlPort(-1)\n    {\n    }\n\n    const QPointer<Debugger::DebuggerEngine> engine;\n    const LinuxDeviceConfiguration::ConstPtr deviceConfig;\n    const RemoteLinuxRunConfiguration::DebuggingType debuggingType;\n\n    QByteArray gdbserverOutput;\n    State state;\n    int gdbServerPort;\n    int qmlPort;\n};\n\nclass RemoteLinuxDebugSupportPrivate\n{\npublic:\n    RemoteLinuxDebugSupportPrivate(RemoteLinuxRunConfiguration *runConfig) : runner(runConfig) {}\n\n    GenericRemoteLinuxApplicationRunner runner;\n};\n\n} \/\/ namespace Internal\n\nusing namespace Internal;\n\nDebuggerStartParameters AbstractRemoteLinuxDebugSupport::startParameters(const RemoteLinuxRunConfiguration *runConfig)\n{\n    DebuggerStartParameters params;\n    const LinuxDeviceConfiguration::ConstPtr &devConf = runConfig->deviceConfig();\n    const RemoteLinuxRunConfiguration::DebuggingType debuggingType\n        = runConfig->debuggingType();\n    if (debuggingType != RemoteLinuxRunConfiguration::DebugCppOnly) {\n        params.qmlServerAddress = runConfig->deviceConfig()->sshParameters().host;\n        params.qmlServerPort = -1;\n    }\n    if (debuggingType != RemoteLinuxRunConfiguration::DebugQmlOnly) {\n        params.processArgs = runConfig->arguments();\n        if (runConfig->activeQt4BuildConfiguration()->qtVersion())\n            params.sysroot = runConfig->activeQt4BuildConfiguration()->qtVersion()->systemRoot();\n        params.toolChainAbi = runConfig->abi();\n        params.startMode = AttachToRemote;\n        params.executable = runConfig->localExecutableFilePath();\n        params.debuggerCommand = runConfig->gdbCmd();\n        params.remoteChannel = devConf->sshParameters().host + QLatin1String(\":-1\");\n        params.useServerStartScript = true;\n\n        \/\/ TODO: This functionality should be inside the debugger.\n        const ProjectExplorer::Abi &abi = runConfig->target()\n            ->activeBuildConfiguration()->toolChain()->targetAbi();\n        params.remoteArchitecture = abi.toString();\n        params.gnuTarget = QLatin1String(abi.architecture() == ProjectExplorer::Abi::ArmArchitecture\n            ? \"arm-none-linux-gnueabi\": \"i386-unknown-linux-gnu\");\n    } else {\n        params.startMode = AttachToRemote;\n    }\n    params.displayName = runConfig->displayName();\n\n    if (const ProjectExplorer::Project *project = runConfig->target()->project()) {\n        params.projectSourceDirectory = project->projectDirectory();\n        if (const ProjectExplorer::BuildConfiguration *buildConfig = runConfig->target()->activeBuildConfiguration()) {\n            params.projectBuildDirectory = buildConfig->buildDirectory();\n        }\n        params.projectSourceFiles = project->files(Project::ExcludeGeneratedFiles);\n    }\n\n    return params;\n}\n\nAbstractRemoteLinuxDebugSupport::AbstractRemoteLinuxDebugSupport(RemoteLinuxRunConfiguration *runConfig,\n        DebuggerEngine *engine)\n    : QObject(engine), m_d(new AbstractRemoteLinuxDebugSupportPrivate(runConfig, engine))\n{\n    connect(m_d->engine, SIGNAL(requestRemoteSetup()), this, SLOT(handleAdapterSetupRequested()));\n}\n\nAbstractRemoteLinuxDebugSupport::~AbstractRemoteLinuxDebugSupport()\n{\n    setFinished();\n    delete m_d;\n}\n\nvoid AbstractRemoteLinuxDebugSupport::showMessage(const QString &msg, int channel)\n{\n    if (m_d->engine)\n        m_d->engine->showMessage(msg, channel);\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleAdapterSetupRequested()\n{\n    QTC_ASSERT(m_d->state == Inactive, return);\n\n    m_d->state = StartingRunner;\n    showMessage(tr(\"Preparing remote side ...\\n\"), AppStuff);\n    disconnect(runner(), 0, this, 0);\n    connect(runner(), SIGNAL(error(QString)), this, SLOT(handleSshError(QString)));\n    connect(runner(), SIGNAL(readyForExecution()), this, SLOT(startExecution()));\n    connect(runner(), SIGNAL(reportProgress(QString)), this, SLOT(handleProgressReport(QString)));\n    runner()->start();\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleSshError(const QString &error)\n{\n    if (m_d->state == Debugging) {\n        showMessage(error, AppError);\n        if (m_d->engine)\n            m_d->engine->notifyInferiorIll();\n    } else if (m_d->state != Inactive) {\n        handleAdapterSetupFailed(error);\n    }\n}\n\nvoid AbstractRemoteLinuxDebugSupport::startExecution()\n{\n    if (m_d->state == Inactive)\n        return;\n\n    QTC_ASSERT(m_d->state == StartingRunner, return);\n\n    if (m_d->debuggingType != RemoteLinuxRunConfiguration::DebugQmlOnly) {\n        if (!setPort(m_d->gdbServerPort))\n            return;\n    }\n    if (m_d->debuggingType != RemoteLinuxRunConfiguration::DebugCppOnly) {\n        if (!setPort(m_d->qmlPort))\n            return;\n    }\n\n    m_d->state = StartingRemoteProcess;\n    m_d->gdbserverOutput.clear();\n    connect(runner(), SIGNAL(remoteErrorOutput(QByteArray)), this,\n        SLOT(handleRemoteErrorOutput(QByteArray)));\n    connect(runner(), SIGNAL(remoteOutput(QByteArray)), this,\n        SLOT(handleRemoteOutput(QByteArray)));\n    if (m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly) {\n        connect(runner(), SIGNAL(remoteProcessStarted()),\n            SLOT(handleRemoteProcessStarted()));\n    }\n    const QString &remoteExe = runner()->remoteExecutable();\n    QString args = runner()->arguments();\n    if (m_d->debuggingType != RemoteLinuxRunConfiguration::DebugCppOnly) {\n        args += QString(QLatin1String(\" -qmljsdebugger=port:%1,block\"))\n            .arg(m_d->qmlPort);\n    }\n\n    const QString remoteCommandLine = m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly\n        ? QString::fromLocal8Bit(\"%1 %2 %3\").arg(runner()->commandPrefix()).arg(remoteExe).arg(args)\n        : QString::fromLocal8Bit(\"%1 gdbserver :%2 %3 %4\").arg(runner()->commandPrefix())\n              .arg(m_d->gdbServerPort).arg(remoteExe).arg(args);\n    connect(runner(), SIGNAL(remoteProcessFinished(qint64)),\n        SLOT(handleRemoteProcessFinished(qint64)));\n    runner()->startExecution(remoteCommandLine.toUtf8());\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleRemoteProcessFinished(qint64 exitCode)\n{\n    if (!m_d->engine || m_d->state == Inactive)\n        return;\n\n    if (m_d->state == Debugging) {\n        \/\/ The QML engine does not realize on its own that the application has finished.\n        if (m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly)\n            m_d->engine->quitDebugger();\n        else if (exitCode != 0)\n            m_d->engine->notifyInferiorIll();\n\n    } else {\n        const QString errorMsg = m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly\n            ? tr(\"Remote application failed with exit code %1.\").arg(exitCode)\n            : tr(\"The gdbserver process closed unexpectedly.\");\n        m_d->engine->handleRemoteSetupFailed(errorMsg);\n    }\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleDebuggingFinished()\n{\n    setFinished();\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleRemoteOutput(const QByteArray &output)\n{\n    QTC_ASSERT(m_d->state == Inactive || m_d->state == Debugging, return);\n\n    showMessage(QString::fromUtf8(output), AppOutput);\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleRemoteErrorOutput(const QByteArray &output)\n{\n    QTC_ASSERT(m_d->state == Inactive || m_d->state == StartingRemoteProcess || m_d->state == Debugging,\n        return);\n\n    if (!m_d->engine)\n        return;\n\n    showMessage(QString::fromUtf8(output), AppOutput);\n    if (m_d->state == StartingRemoteProcess\n            && m_d->debuggingType != RemoteLinuxRunConfiguration::DebugQmlOnly) {\n        m_d->gdbserverOutput += output;\n        if (m_d->gdbserverOutput.contains(\"Listening on port\")) {\n            handleAdapterSetupDone();\n            m_d->gdbserverOutput.clear();\n        }\n    }\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleProgressReport(const QString &progressOutput)\n{\n    showMessage(progressOutput + QLatin1Char('\\n'), AppStuff);\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleAdapterSetupFailed(const QString &error)\n{\n    setFinished();\n    m_d->engine->handleRemoteSetupFailed(tr(\"Initial setup failed: %1\").arg(error));\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleAdapterSetupDone()\n{\n    m_d->state = Debugging;\n    m_d->engine->handleRemoteSetupDone(m_d->gdbServerPort, m_d->qmlPort);\n}\n\nvoid AbstractRemoteLinuxDebugSupport::handleRemoteProcessStarted()\n{\n    Q_ASSERT(m_d->debuggingType == RemoteLinuxRunConfiguration::DebugQmlOnly);\n    QTC_ASSERT(m_d->state == StartingRemoteProcess, return);\n\n    handleAdapterSetupDone();\n}\n\nvoid AbstractRemoteLinuxDebugSupport::setFinished()\n{\n    if (m_d->state == Inactive)\n        return;\n    m_d->state = Inactive;\n    runner()->stop();\n}\n\nbool AbstractRemoteLinuxDebugSupport::setPort(int &port)\n{\n    port = runner()->usedPortsGatherer()->getNextFreePort(runner()->freePorts());\n    if (port == -1) {\n        handleAdapterSetupFailed(tr(\"Not enough free ports on device for debugging.\"));\n        return false;\n    }\n    return true;\n}\n\n\nRemoteLinuxDebugSupport::RemoteLinuxDebugSupport(RemoteLinuxRunConfiguration *runConfig,\n        DebuggerEngine *engine)\n    : AbstractRemoteLinuxDebugSupport(runConfig, engine),\n      m_d(new RemoteLinuxDebugSupportPrivate(runConfig))\n{\n}\n\nRemoteLinuxDebugSupport::~RemoteLinuxDebugSupport()\n{\n    delete m_d;\n}\n\nAbstractRemoteLinuxApplicationRunner *RemoteLinuxDebugSupport::runner() const\n{\n    return &m_d->runner;\n}\n\n} \/\/ namespace RemoteLinux\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2011 Sven Verdoolaege. 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\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 SVEN VERDOOLAEGE ''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 SVEN VERDOOLAEGE 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,\n * 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 * The views and conclusions contained in the software and documentation\n * are those of the authors and should not be interpreted as\n * representing official policies, either expressed or implied, of\n * Sven Verdoolaege.\n *\/ \n\n#include \"isl_config.h\"\n\n#include <assert.h>\n#include <iostream>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/Support\/CommandLine.h>\n#include <llvm\/Support\/Host.h>\n#include <llvm\/Support\/ManagedStatic.h>\n#include <clang\/AST\/ASTContext.h>\n#include <clang\/AST\/ASTConsumer.h>\n#include <clang\/Basic\/FileSystemOptions.h>\n#include <clang\/Basic\/FileManager.h>\n#include <clang\/Basic\/TargetOptions.h>\n#include <clang\/Basic\/TargetInfo.h>\n#include <clang\/Basic\/Version.h>\n#include <clang\/Driver\/Compilation.h>\n#include <clang\/Driver\/Driver.h>\n#include <clang\/Driver\/Tool.h>\n#include <clang\/Frontend\/CompilerInstance.h>\n#include <clang\/Frontend\/CompilerInvocation.h>\n#ifdef HAVE_BASIC_DIAGNOSTICOPTIONS_H\n#include <clang\/Basic\/DiagnosticOptions.h>\n#else\n#include <clang\/Frontend\/DiagnosticOptions.h>\n#endif\n#include <clang\/Frontend\/TextDiagnosticPrinter.h>\n#include <clang\/Frontend\/Utils.h>\n#include <clang\/Lex\/HeaderSearch.h>\n#include <clang\/Lex\/Preprocessor.h>\n#include <clang\/Parse\/ParseAST.h>\n#include <clang\/Sema\/Sema.h>\n\n#include \"extract_interface.h\"\n#include \"python.h\"\n\nusing namespace std;\nusing namespace clang;\nusing namespace clang::driver;\n\nstatic llvm::cl::opt<string> InputFilename(llvm::cl::Positional,\n\t\t\tllvm::cl::Required, llvm::cl::desc(\"<input file>\"));\nstatic llvm::cl::list<string> Includes(\"I\",\n\t\t\tllvm::cl::desc(\"Header search path\"),\n\t\t\tllvm::cl::value_desc(\"path\"), llvm::cl::Prefix);\n\nstatic const char *ResourceDir =\n\tCLANG_PREFIX \"\/lib\/clang\/\" CLANG_VERSION_STRING;\n\n\/* Does decl have an attribute of the following form?\n *\n *\t__attribute__((annotate(\"name\")))\n *\/\nbool has_annotation(Decl *decl, const char *name)\n{\n\tif (!decl->hasAttrs())\n\t\treturn false;\n\n\tAttrVec attrs = decl->getAttrs();\n\tfor (AttrVec::const_iterator i = attrs.begin() ; i != attrs.end(); ++i) {\n\t\tconst AnnotateAttr *ann = dyn_cast<AnnotateAttr>(*i);\n\t\tif (!ann)\n\t\t\tcontinue;\n\t\tif (ann->getAnnotation().str() == name)\n\t\t\treturn true;\n\t}\n\n\treturn false;\n}\n\n\/* Is decl marked as exported?\n *\/\nstatic bool is_exported(Decl *decl)\n{\n\treturn has_annotation(decl, \"isl_export\");\n}\n\n\/* Collect all types and functions that are annotated \"isl_export\"\n * in \"types\" and \"function\".\n *\n * We currently only consider single declarations.\n *\/\nstruct MyASTConsumer : public ASTConsumer {\n\tset<RecordDecl *> types;\n\tset<FunctionDecl *> functions;\n\n\tvirtual HandleTopLevelDeclReturn HandleTopLevelDecl(DeclGroupRef D) {\n\t\tDecl *decl;\n\n\t\tif (!D.isSingleDecl())\n\t\t\treturn HandleTopLevelDeclContinue;\n\t\tdecl = D.getSingleDecl();\n\t\tif (!is_exported(decl))\n\t\t\treturn HandleTopLevelDeclContinue;\n\t\tswitch (decl->getKind()) {\n\t\tcase Decl::Record:\n\t\t\ttypes.insert(cast<RecordDecl>(decl));\n\t\t\tbreak;\n\t\tcase Decl::Function:\n\t\t\tfunctions.insert(cast<FunctionDecl>(decl));\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t\treturn HandleTopLevelDeclContinue;\n\t}\n};\n\n#ifdef USE_ARRAYREF\n\n#ifdef HAVE_CXXISPRODUCTION\nstatic Driver *construct_driver(const char *binary, DiagnosticsEngine &Diags)\n{\n\treturn new Driver(binary, llvm::sys::getDefaultTargetTriple(),\n\t\t\t    \"\", false, false, Diags);\n}\n#elif defined(HAVE_ISPRODUCTION)\nstatic Driver *construct_driver(const char *binary, DiagnosticsEngine &Diags)\n{\n\treturn new Driver(binary, llvm::sys::getDefaultTargetTriple(),\n\t\t\t    \"\", false, Diags);\n}\n#else\nstatic Driver *construct_driver(const char *binary, DiagnosticsEngine &Diags)\n{\n\treturn new Driver(binary, llvm::sys::getDefaultTargetTriple(),\n\t\t\t    \"\", Diags);\n}\n#endif\n\n\/* Create a CompilerInvocation object that stores the command line\n * arguments constructed by the driver.\n * The arguments are mainly useful for setting up the system include\n * paths on newer clangs and on some platforms.\n *\/\nstatic CompilerInvocation *construct_invocation(const char *filename,\n\tDiagnosticsEngine &Diags)\n{\n\tconst char *binary = CLANG_PREFIX\"\/bin\/clang\";\n\tconst llvm::OwningPtr<Driver> driver(construct_driver(binary, Diags));\n\tstd::vector<const char *> Argv;\n\tArgv.push_back(binary);\n\tArgv.push_back(filename);\n\tconst llvm::OwningPtr<Compilation> compilation(\n\t\tdriver->BuildCompilation(llvm::ArrayRef<const char *>(Argv)));\n\tJobList &Jobs = compilation->getJobs();\n\n\tCommand *cmd = cast<Command>(*Jobs.begin());\n\tif (strcmp(cmd->getCreator().getName(), \"clang\"))\n\t\treturn NULL;\n\n\tconst ArgStringList *args = &cmd->getArguments();\n\n\tCompilerInvocation *invocation = new CompilerInvocation;\n\tCompilerInvocation::CreateFromArgs(*invocation, args->data() + 1,\n\t\t\t\t\t\targs->data() + args->size(),\n\t\t\t\t\t\tDiags);\n\treturn invocation;\n}\n\n#else\n\nstatic CompilerInvocation *construct_invocation(const char *filename,\n\tDiagnosticsEngine &Diags)\n{\n\treturn NULL;\n}\n\n#endif\n\n#ifdef HAVE_BASIC_DIAGNOSTICOPTIONS_H\n\nstatic TextDiagnosticPrinter *construct_printer(void)\n{\n\treturn new TextDiagnosticPrinter(llvm::errs(), new DiagnosticOptions());\n}\n\n#else\n\nstatic TextDiagnosticPrinter *construct_printer(void)\n{\n\tDiagnosticOptions DO;\n\treturn new TextDiagnosticPrinter(llvm::errs(), DO);\n}\n\n#endif\n\n#ifdef CREATETARGETINFO_TAKES_POINTER\n\nstatic TargetInfo *create_target_info(CompilerInstance *Clang,\n\tDiagnosticsEngine &Diags)\n{\n\tTargetOptions &TO = Clang->getTargetOpts();\n\tTO.Triple = llvm::sys::getDefaultTargetTriple();\n\treturn TargetInfo::CreateTargetInfo(Diags, &TO);\n}\n\n#else\n\nstatic TargetInfo *create_target_info(CompilerInstance *Clang,\n\tDiagnosticsEngine &Diags)\n{\n\tTargetOptions &TO = Clang->getTargetOpts();\n\tTO.Triple = llvm::sys::getDefaultTargetTriple();\n\treturn TargetInfo::CreateTargetInfo(Diags, TO);\n}\n\n#endif\n\n#ifdef CREATEDIAGNOSTICS_TAKES_ARG\n\nstatic void create_diagnostics(CompilerInstance *Clang)\n{\n\tClang->createDiagnostics(0, NULL, construct_printer());\n}\n\n#else\n\nstatic void create_diagnostics(CompilerInstance *Clang)\n{\n\tClang->createDiagnostics(construct_printer());\n}\n\n#endif\n\n#ifdef CREATEPREPROCESSOR_TAKES_TUKIND\n\nstatic void create_preprocessor(CompilerInstance *Clang)\n{\n\tClang->createPreprocessor(TU_Complete);\n}\n\n#else\n\nstatic void create_preprocessor(CompilerInstance *Clang)\n{\n\tClang->createPreprocessor();\n}\n\n#endif\n\n#ifdef ADDPATH_TAKES_4_ARGUMENTS\n\nvoid add_path(HeaderSearchOptions &HSO, string Path)\n{\n\tHSO.AddPath(Path, frontend::Angled, false, false);\n}\n\n#else\n\nvoid add_path(HeaderSearchOptions &HSO, string Path)\n{\n\tHSO.AddPath(Path, frontend::Angled, true, false, false);\n}\n\n#endif\n\nint main(int argc, char *argv[])\n{\n\tllvm::cl::ParseCommandLineOptions(argc, argv);\n\n\tCompilerInstance *Clang = new CompilerInstance();\n\tcreate_diagnostics(Clang);\n\tDiagnosticsEngine &Diags = Clang->getDiagnostics();\n\tDiags.setSuppressSystemWarnings(true);\n\tCompilerInvocation *invocation =\n\t\tconstruct_invocation(InputFilename.c_str(), Diags);\n\tif (invocation)\n\t\tClang->setInvocation(invocation);\n\tClang->createFileManager();\n\tClang->createSourceManager(Clang->getFileManager());\n\tTargetInfo *target = create_target_info(Clang, Diags);\n\tClang->setTarget(target);\n\tCompilerInvocation::setLangDefaults(Clang->getLangOpts(), IK_C,\n\t\t\t\t\t    LangStandard::lang_unspecified);\n\tHeaderSearchOptions &HSO = Clang->getHeaderSearchOpts();\n\tLangOptions &LO = Clang->getLangOpts();\n\tPreprocessorOptions &PO = Clang->getPreprocessorOpts();\n\tHSO.ResourceDir = ResourceDir;\n\n\tfor (int i = 0; i < Includes.size(); ++i)\n\t\tadd_path(HSO, Includes[i]);\n\n\tPO.addMacroDef(\"__isl_give=__attribute__((annotate(\\\"isl_give\\\")))\");\n\tPO.addMacroDef(\"__isl_keep=__attribute__((annotate(\\\"isl_keep\\\")))\");\n\tPO.addMacroDef(\"__isl_take=__attribute__((annotate(\\\"isl_take\\\")))\");\n\tPO.addMacroDef(\"__isl_export=__attribute__((annotate(\\\"isl_export\\\")))\");\n\tPO.addMacroDef(\"__isl_constructor=__attribute__((annotate(\\\"isl_constructor\\\"))) __attribute__((annotate(\\\"isl_export\\\")))\");\n\tPO.addMacroDef(\"__isl_subclass(super)=__attribute__((annotate(\\\"isl_subclass(\\\" #super \\\")\\\"))) __attribute__((annotate(\\\"isl_export\\\")))\");\n\n\tcreate_preprocessor(Clang);\n\tPreprocessor &PP = Clang->getPreprocessor();\n\n\tPP.getBuiltinInfo().InitializeBuiltins(PP.getIdentifierTable(), LO);\n\n\tconst FileEntry *file = Clang->getFileManager().getFile(InputFilename);\n\tassert(file);\n\tClang->getSourceManager().createMainFileID(file);\n\n\tClang->createASTContext();\n\tMyASTConsumer consumer;\n\tSema *sema = new Sema(PP, Clang->getASTContext(), consumer);\n\n\tDiags.getClient()->BeginSourceFile(LO, &PP);\n\tParseAST(*sema);\n\tDiags.getClient()->EndSourceFile();\n\n\tgenerate_python(consumer.types, consumer.functions);\n\n\tdelete sema;\n\tdelete Clang;\n\tllvm::llvm_shutdown();\n\n\treturn 0;\n}\n<commit_msg>interface\/extract_interface.cc: explicitly include llvm\/ADT\/OwningPtr.h<commit_after>\/*\n * Copyright 2011 Sven Verdoolaege. 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\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 SVEN VERDOOLAEGE ''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 SVEN VERDOOLAEGE 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,\n * 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 * The views and conclusions contained in the software and documentation\n * are those of the authors and should not be interpreted as\n * representing official policies, either expressed or implied, of\n * Sven Verdoolaege.\n *\/ \n\n#include \"isl_config.h\"\n\n#include <assert.h>\n#include <iostream>\n#include <llvm\/ADT\/OwningPtr.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/Support\/CommandLine.h>\n#include <llvm\/Support\/Host.h>\n#include <llvm\/Support\/ManagedStatic.h>\n#include <clang\/AST\/ASTContext.h>\n#include <clang\/AST\/ASTConsumer.h>\n#include <clang\/Basic\/FileSystemOptions.h>\n#include <clang\/Basic\/FileManager.h>\n#include <clang\/Basic\/TargetOptions.h>\n#include <clang\/Basic\/TargetInfo.h>\n#include <clang\/Basic\/Version.h>\n#include <clang\/Driver\/Compilation.h>\n#include <clang\/Driver\/Driver.h>\n#include <clang\/Driver\/Tool.h>\n#include <clang\/Frontend\/CompilerInstance.h>\n#include <clang\/Frontend\/CompilerInvocation.h>\n#ifdef HAVE_BASIC_DIAGNOSTICOPTIONS_H\n#include <clang\/Basic\/DiagnosticOptions.h>\n#else\n#include <clang\/Frontend\/DiagnosticOptions.h>\n#endif\n#include <clang\/Frontend\/TextDiagnosticPrinter.h>\n#include <clang\/Frontend\/Utils.h>\n#include <clang\/Lex\/HeaderSearch.h>\n#include <clang\/Lex\/Preprocessor.h>\n#include <clang\/Parse\/ParseAST.h>\n#include <clang\/Sema\/Sema.h>\n\n#include \"extract_interface.h\"\n#include \"python.h\"\n\nusing namespace std;\nusing namespace clang;\nusing namespace clang::driver;\n\nstatic llvm::cl::opt<string> InputFilename(llvm::cl::Positional,\n\t\t\tllvm::cl::Required, llvm::cl::desc(\"<input file>\"));\nstatic llvm::cl::list<string> Includes(\"I\",\n\t\t\tllvm::cl::desc(\"Header search path\"),\n\t\t\tllvm::cl::value_desc(\"path\"), llvm::cl::Prefix);\n\nstatic const char *ResourceDir =\n\tCLANG_PREFIX \"\/lib\/clang\/\" CLANG_VERSION_STRING;\n\n\/* Does decl have an attribute of the following form?\n *\n *\t__attribute__((annotate(\"name\")))\n *\/\nbool has_annotation(Decl *decl, const char *name)\n{\n\tif (!decl->hasAttrs())\n\t\treturn false;\n\n\tAttrVec attrs = decl->getAttrs();\n\tfor (AttrVec::const_iterator i = attrs.begin() ; i != attrs.end(); ++i) {\n\t\tconst AnnotateAttr *ann = dyn_cast<AnnotateAttr>(*i);\n\t\tif (!ann)\n\t\t\tcontinue;\n\t\tif (ann->getAnnotation().str() == name)\n\t\t\treturn true;\n\t}\n\n\treturn false;\n}\n\n\/* Is decl marked as exported?\n *\/\nstatic bool is_exported(Decl *decl)\n{\n\treturn has_annotation(decl, \"isl_export\");\n}\n\n\/* Collect all types and functions that are annotated \"isl_export\"\n * in \"types\" and \"function\".\n *\n * We currently only consider single declarations.\n *\/\nstruct MyASTConsumer : public ASTConsumer {\n\tset<RecordDecl *> types;\n\tset<FunctionDecl *> functions;\n\n\tvirtual HandleTopLevelDeclReturn HandleTopLevelDecl(DeclGroupRef D) {\n\t\tDecl *decl;\n\n\t\tif (!D.isSingleDecl())\n\t\t\treturn HandleTopLevelDeclContinue;\n\t\tdecl = D.getSingleDecl();\n\t\tif (!is_exported(decl))\n\t\t\treturn HandleTopLevelDeclContinue;\n\t\tswitch (decl->getKind()) {\n\t\tcase Decl::Record:\n\t\t\ttypes.insert(cast<RecordDecl>(decl));\n\t\t\tbreak;\n\t\tcase Decl::Function:\n\t\t\tfunctions.insert(cast<FunctionDecl>(decl));\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t\treturn HandleTopLevelDeclContinue;\n\t}\n};\n\n#ifdef USE_ARRAYREF\n\n#ifdef HAVE_CXXISPRODUCTION\nstatic Driver *construct_driver(const char *binary, DiagnosticsEngine &Diags)\n{\n\treturn new Driver(binary, llvm::sys::getDefaultTargetTriple(),\n\t\t\t    \"\", false, false, Diags);\n}\n#elif defined(HAVE_ISPRODUCTION)\nstatic Driver *construct_driver(const char *binary, DiagnosticsEngine &Diags)\n{\n\treturn new Driver(binary, llvm::sys::getDefaultTargetTriple(),\n\t\t\t    \"\", false, Diags);\n}\n#else\nstatic Driver *construct_driver(const char *binary, DiagnosticsEngine &Diags)\n{\n\treturn new Driver(binary, llvm::sys::getDefaultTargetTriple(),\n\t\t\t    \"\", Diags);\n}\n#endif\n\n\/* Create a CompilerInvocation object that stores the command line\n * arguments constructed by the driver.\n * The arguments are mainly useful for setting up the system include\n * paths on newer clangs and on some platforms.\n *\/\nstatic CompilerInvocation *construct_invocation(const char *filename,\n\tDiagnosticsEngine &Diags)\n{\n\tconst char *binary = CLANG_PREFIX\"\/bin\/clang\";\n\tconst llvm::OwningPtr<Driver> driver(construct_driver(binary, Diags));\n\tstd::vector<const char *> Argv;\n\tArgv.push_back(binary);\n\tArgv.push_back(filename);\n\tconst llvm::OwningPtr<Compilation> compilation(\n\t\tdriver->BuildCompilation(llvm::ArrayRef<const char *>(Argv)));\n\tJobList &Jobs = compilation->getJobs();\n\n\tCommand *cmd = cast<Command>(*Jobs.begin());\n\tif (strcmp(cmd->getCreator().getName(), \"clang\"))\n\t\treturn NULL;\n\n\tconst ArgStringList *args = &cmd->getArguments();\n\n\tCompilerInvocation *invocation = new CompilerInvocation;\n\tCompilerInvocation::CreateFromArgs(*invocation, args->data() + 1,\n\t\t\t\t\t\targs->data() + args->size(),\n\t\t\t\t\t\tDiags);\n\treturn invocation;\n}\n\n#else\n\nstatic CompilerInvocation *construct_invocation(const char *filename,\n\tDiagnosticsEngine &Diags)\n{\n\treturn NULL;\n}\n\n#endif\n\n#ifdef HAVE_BASIC_DIAGNOSTICOPTIONS_H\n\nstatic TextDiagnosticPrinter *construct_printer(void)\n{\n\treturn new TextDiagnosticPrinter(llvm::errs(), new DiagnosticOptions());\n}\n\n#else\n\nstatic TextDiagnosticPrinter *construct_printer(void)\n{\n\tDiagnosticOptions DO;\n\treturn new TextDiagnosticPrinter(llvm::errs(), DO);\n}\n\n#endif\n\n#ifdef CREATETARGETINFO_TAKES_POINTER\n\nstatic TargetInfo *create_target_info(CompilerInstance *Clang,\n\tDiagnosticsEngine &Diags)\n{\n\tTargetOptions &TO = Clang->getTargetOpts();\n\tTO.Triple = llvm::sys::getDefaultTargetTriple();\n\treturn TargetInfo::CreateTargetInfo(Diags, &TO);\n}\n\n#else\n\nstatic TargetInfo *create_target_info(CompilerInstance *Clang,\n\tDiagnosticsEngine &Diags)\n{\n\tTargetOptions &TO = Clang->getTargetOpts();\n\tTO.Triple = llvm::sys::getDefaultTargetTriple();\n\treturn TargetInfo::CreateTargetInfo(Diags, TO);\n}\n\n#endif\n\n#ifdef CREATEDIAGNOSTICS_TAKES_ARG\n\nstatic void create_diagnostics(CompilerInstance *Clang)\n{\n\tClang->createDiagnostics(0, NULL, construct_printer());\n}\n\n#else\n\nstatic void create_diagnostics(CompilerInstance *Clang)\n{\n\tClang->createDiagnostics(construct_printer());\n}\n\n#endif\n\n#ifdef CREATEPREPROCESSOR_TAKES_TUKIND\n\nstatic void create_preprocessor(CompilerInstance *Clang)\n{\n\tClang->createPreprocessor(TU_Complete);\n}\n\n#else\n\nstatic void create_preprocessor(CompilerInstance *Clang)\n{\n\tClang->createPreprocessor();\n}\n\n#endif\n\n#ifdef ADDPATH_TAKES_4_ARGUMENTS\n\nvoid add_path(HeaderSearchOptions &HSO, string Path)\n{\n\tHSO.AddPath(Path, frontend::Angled, false, false);\n}\n\n#else\n\nvoid add_path(HeaderSearchOptions &HSO, string Path)\n{\n\tHSO.AddPath(Path, frontend::Angled, true, false, false);\n}\n\n#endif\n\nint main(int argc, char *argv[])\n{\n\tllvm::cl::ParseCommandLineOptions(argc, argv);\n\n\tCompilerInstance *Clang = new CompilerInstance();\n\tcreate_diagnostics(Clang);\n\tDiagnosticsEngine &Diags = Clang->getDiagnostics();\n\tDiags.setSuppressSystemWarnings(true);\n\tCompilerInvocation *invocation =\n\t\tconstruct_invocation(InputFilename.c_str(), Diags);\n\tif (invocation)\n\t\tClang->setInvocation(invocation);\n\tClang->createFileManager();\n\tClang->createSourceManager(Clang->getFileManager());\n\tTargetInfo *target = create_target_info(Clang, Diags);\n\tClang->setTarget(target);\n\tCompilerInvocation::setLangDefaults(Clang->getLangOpts(), IK_C,\n\t\t\t\t\t    LangStandard::lang_unspecified);\n\tHeaderSearchOptions &HSO = Clang->getHeaderSearchOpts();\n\tLangOptions &LO = Clang->getLangOpts();\n\tPreprocessorOptions &PO = Clang->getPreprocessorOpts();\n\tHSO.ResourceDir = ResourceDir;\n\n\tfor (int i = 0; i < Includes.size(); ++i)\n\t\tadd_path(HSO, Includes[i]);\n\n\tPO.addMacroDef(\"__isl_give=__attribute__((annotate(\\\"isl_give\\\")))\");\n\tPO.addMacroDef(\"__isl_keep=__attribute__((annotate(\\\"isl_keep\\\")))\");\n\tPO.addMacroDef(\"__isl_take=__attribute__((annotate(\\\"isl_take\\\")))\");\n\tPO.addMacroDef(\"__isl_export=__attribute__((annotate(\\\"isl_export\\\")))\");\n\tPO.addMacroDef(\"__isl_constructor=__attribute__((annotate(\\\"isl_constructor\\\"))) __attribute__((annotate(\\\"isl_export\\\")))\");\n\tPO.addMacroDef(\"__isl_subclass(super)=__attribute__((annotate(\\\"isl_subclass(\\\" #super \\\")\\\"))) __attribute__((annotate(\\\"isl_export\\\")))\");\n\n\tcreate_preprocessor(Clang);\n\tPreprocessor &PP = Clang->getPreprocessor();\n\n\tPP.getBuiltinInfo().InitializeBuiltins(PP.getIdentifierTable(), LO);\n\n\tconst FileEntry *file = Clang->getFileManager().getFile(InputFilename);\n\tassert(file);\n\tClang->getSourceManager().createMainFileID(file);\n\n\tClang->createASTContext();\n\tMyASTConsumer consumer;\n\tSema *sema = new Sema(PP, Clang->getASTContext(), consumer);\n\n\tDiags.getClient()->BeginSourceFile(LO, &PP);\n\tParseAST(*sema);\n\tDiags.getClient()->EndSourceFile();\n\n\tgenerate_python(consumer.types, consumer.functions);\n\n\tdelete sema;\n\tdelete Clang;\n\tllvm::llvm_shutdown();\n\n\treturn 0;\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 \"itkMeanImageFilter.h\"\n#include \"itkDiscreteGaussianImageFilter.h\"\n#include \"itkGradientAnisotropicDiffusionImageFilter.h\"\n#include \"otbPerBandVectorImageFilter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nenum\n{\n  Smoothing_Mean,\n  Smoothing_Gaussian,\n  Smoothing_Anisotropic\n};\n\ntypedef otb::Image<FloatVectorImageType::InternalPixelType, 2>  ImageType;\n\nclass Smoothing : public Application\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef Smoothing                      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(Smoothing, otb::Application);\n\nprivate:\n  void DoInit()\n  {\n    SetName(\"Smoothing\");\n    SetDescription(\"Apply a smoothing filter to an image\");\n\n    SetDocName(\"Smoothing\");\n    SetDocLongDescription(\"This application applies smoothing filter to an image.\"\n      \" Either gaussian, mean, or anisotropic diffusion are available.\");\n    SetDocLimitations(\"None\");\n    SetDocAuthors(\"OTB-Team\");\n    SetDocSeeAlso(\" \");\n\n    AddDocTag(Tags::Filter);\n\n    AddParameter(ParameterType_InputImage,  \"in\",   \"Input Image\");\n    SetParameterDescription(\"in\", \"Input image to smooth.\");\n    AddParameter(ParameterType_OutputImage, \"out\",  \"Output Image\");\n    SetParameterDescription(\"out\", \"Output smoothed image.\");\n\n    AddRAMParameter();\n\n    AddParameter(ParameterType_Choice,      \"type\", \"Smoothing Type\");\n    SetParameterDescription(\"type\", \"Smoothing kernel to apply\");\n\n    AddChoice(\"type.mean\",     \"Mean\");\n\n    AddParameter(ParameterType_Radius, \"type.mean.radius\", \"Radius\");\n    SetParameterDescription(\"type.mean.radius\", \"Mean radius (in pixels)\");\n    SetDefaultParameterInt(\"type.mean.radius\", 2);\n\n    AddChoice(\"type.gaussian\", \"Gaussian\");\n\n    AddParameter(ParameterType_Float, \"type.gaussian.radius\", \"Radius\");\n    SetParameterDescription(\"type.gaussian.radius\", \"Gaussian radius (in pixels)\");\n    SetDefaultParameterFloat(\"type.gaussian.radius\", 2.0);\n\n    AddChoice(\"type.anidif\",   \"Anisotropic Diffusion\");\n\n    AddParameter(ParameterType_Float,  \"type.anidif.timestep\", \"Time Step\");\n    SetParameterDescription(\"type.anidif.timestep\", \"Diffusion equation time step\");\n\n    AddParameter(ParameterType_Int,  \"type.anidif.nbiter\", \"Nb Iterations\");\n    SetParameterDescription(\"type.anidif.nbiter\", \"Number of iterations\");\n\n    SetDefaultParameterFloat(\"type.anidif.timestep\",   0.125);\n    SetDefaultParameterInt(\"type.anidif.nbiter\",     10);\n\n    SetParameterString(\"type\", \"anidif\");\n\n    \/\/ Doc example parameter settings\n    SetExampleComment(\"Image smoothing using a mean filter.\", 0);\n    SetDocExampleParameterValue(\"in\", \"Romania_Extract.tif\");\n    SetDocExampleParameterValue(\"out\", \"smoothedImage_mean.png uchar\");\n    SetDocExampleParameterValue(\"type\", \"mean\");\n\n    unsigned int exId = AddExample( \"Image smoothing using an anisotropic diffusion filter.\" );\n    SetDocExampleParameterValue(\"in\", \"Romania_Extract.tif\", exId);\n    SetDocExampleParameterValue(\"out\", \"smoothedImage_ani.png float\", exId);\n    SetDocExampleParameterValue(\"type\", \"anidif\", exId);\n    SetDocExampleParameterValue(\"type.anidif.timestep\", \"0.1\", exId);\n    SetDocExampleParameterValue(\"type.anidif.nbiter\", \"5\", exId);\n  }\n\n  void DoUpdateParameters()\n  {\n    \/\/ Nothing to do here : all parameters are independent\n  }\n\n  void DoExecute()\n  {\n    GetLogger()->Debug(\"Entering DoExecute\\n\");\n\n\n    FloatVectorImageType::Pointer inImage = GetParameterImage(\"in\");\n\n    switch ( GetParameterInt(\"type\") )\n      {\n      case Smoothing_Mean:\n        {\n        GetLogger()->Debug(\"Using mean\");\n\n        typedef itk::MeanImageFilter<ImageType, ImageType>         MeanFilterType;\n        typedef otb::PerBandVectorImageFilter<FloatVectorImageType, FloatVectorImageType, MeanFilterType>\n          PerBandMeanFilterType;\n\n        PerBandMeanFilterType::Pointer perBand\n          = PerBandMeanFilterType::New();\n        perBand->SetInput(inImage);\n\n        MeanFilterType::InputSizeType radius;\n        radius.Fill( GetParameterInt(\"type.mean.radius\") );\n        perBand->GetFilter()->SetRadius(radius);\n        perBand->UpdateOutputInformation();\n        m_FilterRef = perBand;\n        SetParameterOutputImage(\"out\", perBand->GetOutput());\n        }\n        break;\n      case Smoothing_Gaussian:\n        {\n        GetLogger()->Debug(\"Using gaussian\");\n\n        typedef itk::DiscreteGaussianImageFilter<ImageType, ImageType>  DiscreteGaussianFilterType;\n        typedef otb::PerBandVectorImageFilter<FloatVectorImageType, FloatVectorImageType, DiscreteGaussianFilterType>\n          PerBandDiscreteGaussianFilterType;\n\n        PerBandDiscreteGaussianFilterType::Pointer perBand\n          = PerBandDiscreteGaussianFilterType::New();\n        perBand->SetInput(inImage);\n\n        double radius = GetParameterFloat(\"type.gaussian.radius\");\n        double variance = radius * radius;\n        perBand->GetFilter()->SetVariance(variance);\n        perBand->GetFilter()->SetUseImageSpacing(false);\n        perBand->UpdateOutputInformation();\n        m_FilterRef = perBand;\n        SetParameterOutputImage(\"out\", perBand->GetOutput());\n        }\n        break;\n      case Smoothing_Anisotropic:\n        {\n        GetLogger()->Debug(\"Using anisotropic diffusion\");\n\n        typedef itk::GradientAnisotropicDiffusionImageFilter<ImageType, ImageType>  GradientAnisotropicDiffusionFilterType;\n        typedef otb::PerBandVectorImageFilter<FloatVectorImageType, FloatVectorImageType, GradientAnisotropicDiffusionFilterType>\n          PerBandGradientAnisotropicDiffusionFilterType;\n\n        PerBandGradientAnisotropicDiffusionFilterType::Pointer perBand\n          = PerBandGradientAnisotropicDiffusionFilterType::New();\n        perBand->SetInput(inImage);\n\n        int aniDifNbIter = GetParameterInt(\"type.anidif.nbiter\");\n        perBand->GetFilter()->SetNumberOfIterations(static_cast<unsigned int>(aniDifNbIter));\n\n        float aniDifTimeStep = GetParameterFloat(\"type.anidif.timestep\");\n        perBand->GetFilter()->SetTimeStep(static_cast<double>(aniDifTimeStep));\n        \/\/ perBand->GetFilter()->SetConductanceParameter()\n        perBand->UpdateOutputInformation();\n        m_FilterRef = perBand;\n        SetParameterOutputImage(\"out\", perBand->GetOutput());\n        }\n        break;\n      }\n  }\n\n  itk::LightObject::Pointer m_FilterRef;\n};\n\n\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::Smoothing)\n\n<commit_msg>ENH: add conductance parameter for anidifusion which was added recently in ITK filter<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 \"itkMeanImageFilter.h\"\n#include \"itkDiscreteGaussianImageFilter.h\"\n#include \"itkGradientAnisotropicDiffusionImageFilter.h\"\n#include \"otbPerBandVectorImageFilter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nenum\n{\n  Smoothing_Mean,\n  Smoothing_Gaussian,\n  Smoothing_Anisotropic\n};\n\ntypedef otb::Image<FloatVectorImageType::InternalPixelType, 2>  ImageType;\n\nclass Smoothing : public Application\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef Smoothing                      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(Smoothing, otb::Application);\n\nprivate:\n  void DoInit()\n  {\n    SetName(\"Smoothing\");\n    SetDescription(\"Apply a smoothing filter to an image\");\n\n    SetDocName(\"Smoothing\");\n    SetDocLongDescription(\"This application applies smoothing filter to an image.\"\n      \" Either gaussian, mean, or anisotropic diffusion are available.\");\n    SetDocLimitations(\"None\");\n    SetDocAuthors(\"OTB-Team\");\n    SetDocSeeAlso(\" \");\n\n    AddDocTag(Tags::Filter);\n\n    AddParameter(ParameterType_InputImage,  \"in\",   \"Input Image\");\n    SetParameterDescription(\"in\", \"Input image to smooth.\");\n    AddParameter(ParameterType_OutputImage, \"out\",  \"Output Image\");\n    SetParameterDescription(\"out\", \"Output smoothed image.\");\n\n    AddRAMParameter();\n\n    AddParameter(ParameterType_Choice,      \"type\", \"Smoothing Type\");\n    SetParameterDescription(\"type\", \"Smoothing kernel to apply\");\n\n    AddChoice(\"type.mean\",     \"Mean\");\n\n    AddParameter(ParameterType_Radius, \"type.mean.radius\", \"Radius\");\n    SetParameterDescription(\"type.mean.radius\", \"Mean radius (in pixels)\");\n    SetDefaultParameterInt(\"type.mean.radius\", 2);\n\n    AddChoice(\"type.gaussian\", \"Gaussian\");\n\n    AddParameter(ParameterType_Float, \"type.gaussian.radius\", \"Radius\");\n    SetParameterDescription(\"type.gaussian.radius\", \"Gaussian radius (in pixels)\");\n    SetDefaultParameterFloat(\"type.gaussian.radius\", 2.0);\n\n    AddChoice(\"type.anidif\",   \"Anisotropic Diffusion\");\n\n    AddParameter(ParameterType_Float,  \"type.anidif.timestep\", \"Time Step\");\n    SetParameterDescription(\"type.anidif.timestep\", \"Diffusion equation time step\");\n\n    AddParameter(ParameterType_Int,  \"type.anidif.nbiter\", \"Nb Iterations\");\n    SetParameterDescription(\"type.anidif.nbiter\", \"Number of iterations\");\n\n    AddParameter(ParameterType_Float,  \"type.anidif.conductance\", \"Conductance\");\n    SetParameterDescription(\"type.anidif.nbiter\", \"Controls the sensitivity of the conductance term\");\n\n    SetDefaultParameterFloat(\"type.anidif.timestep\",   0.125);\n    SetDefaultParameterInt(\"type.anidif.nbiter\",     10);\n    SetDefaultParameterInt(\"type.anidif.conductance\",     1.);\n\n    SetParameterString(\"type\", \"anidif\");\n\n    \/\/ Doc example parameter settings\n    SetExampleComment(\"Image smoothing using a mean filter.\", 0);\n    SetDocExampleParameterValue(\"in\", \"Romania_Extract.tif\");\n    SetDocExampleParameterValue(\"out\", \"smoothedImage_mean.png uchar\");\n    SetDocExampleParameterValue(\"type\", \"mean\");\n\n    unsigned int exId = AddExample( \"Image smoothing using an anisotropic diffusion filter.\" );\n    SetDocExampleParameterValue(\"in\", \"Romania_Extract.tif\", exId);\n    SetDocExampleParameterValue(\"out\", \"smoothedImage_ani.png float\", exId);\n    SetDocExampleParameterValue(\"type\", \"anidif\", exId);\n    SetDocExampleParameterValue(\"type.anidif.timestep\", \"0.1\", exId);\n    SetDocExampleParameterValue(\"type.anidif.nbiter\", \"5\", exId);\n    SetDocExampleParameterValue(\"type.anidif.conductance\", \"1.5\", exId);\n  }\n\n  void DoUpdateParameters()\n  {\n    \/\/ Nothing to do here : all parameters are independent\n  }\n\n  void DoExecute()\n  {\n    GetLogger()->Debug(\"Entering DoExecute\\n\");\n\n\n    FloatVectorImageType::Pointer inImage = GetParameterImage(\"in\");\n\n    switch ( GetParameterInt(\"type\") )\n      {\n      case Smoothing_Mean:\n        {\n        GetLogger()->Debug(\"Using mean\");\n\n        typedef itk::MeanImageFilter<ImageType, ImageType>         MeanFilterType;\n        typedef otb::PerBandVectorImageFilter<FloatVectorImageType, FloatVectorImageType, MeanFilterType>\n          PerBandMeanFilterType;\n\n        PerBandMeanFilterType::Pointer perBand\n          = PerBandMeanFilterType::New();\n        perBand->SetInput(inImage);\n\n        MeanFilterType::InputSizeType radius;\n        radius.Fill( GetParameterInt(\"type.mean.radius\") );\n        perBand->GetFilter()->SetRadius(radius);\n        perBand->UpdateOutputInformation();\n        m_FilterRef = perBand;\n        SetParameterOutputImage(\"out\", perBand->GetOutput());\n        }\n        break;\n      case Smoothing_Gaussian:\n        {\n        GetLogger()->Debug(\"Using gaussian\");\n\n        typedef itk::DiscreteGaussianImageFilter<ImageType, ImageType>  DiscreteGaussianFilterType;\n        typedef otb::PerBandVectorImageFilter<FloatVectorImageType, FloatVectorImageType, DiscreteGaussianFilterType>\n          PerBandDiscreteGaussianFilterType;\n\n        PerBandDiscreteGaussianFilterType::Pointer perBand\n          = PerBandDiscreteGaussianFilterType::New();\n        perBand->SetInput(inImage);\n\n        double radius = GetParameterFloat(\"type.gaussian.radius\");\n        double variance = radius * radius;\n        perBand->GetFilter()->SetVariance(variance);\n        perBand->GetFilter()->SetUseImageSpacing(false);\n        perBand->UpdateOutputInformation();\n        m_FilterRef = perBand;\n        SetParameterOutputImage(\"out\", perBand->GetOutput());\n        }\n        break;\n      case Smoothing_Anisotropic:\n        {\n        GetLogger()->Debug(\"Using anisotropic diffusion\");\n\n        typedef itk::GradientAnisotropicDiffusionImageFilter<ImageType, ImageType>  GradientAnisotropicDiffusionFilterType;\n        typedef otb::PerBandVectorImageFilter<FloatVectorImageType, FloatVectorImageType, GradientAnisotropicDiffusionFilterType>\n          PerBandGradientAnisotropicDiffusionFilterType;\n\n        PerBandGradientAnisotropicDiffusionFilterType::Pointer perBand\n          = PerBandGradientAnisotropicDiffusionFilterType::New();\n        perBand->SetInput(inImage);\n\n        const int aniDifNbIter = GetParameterInt(\"type.anidif.nbiter\");\n        perBand->GetFilter()->SetNumberOfIterations(static_cast<unsigned int>(aniDifNbIter));\n\n        const float aniDifTimeStep = GetParameterFloat(\"type.anidif.timestep\");\n        perBand->GetFilter()->SetTimeStep(static_cast<double>(aniDifTimeStep));\n\n        perBand->GetFilter()->SetConductanceParameter(GetParameterFloat(\"type.anidif.conductance\"));\n        perBand->UpdateOutputInformation();\n        \n        m_FilterRef = perBand;\n        SetParameterOutputImage(\"out\", perBand->GetOutput());\n        }\n        break;\n      }\n  }\n\n  itk::LightObject::Pointer m_FilterRef;\n};\n\n\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::Smoothing)\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         PelotonDB\n\/\/\n\/\/ pair_test.cpp\n\/\/\n\/\/ Identification: tests\/mfabric\/pair_test.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <string.h>\n#include <unistd.h>\n#include <cstdio>\n#include <cassert>\n\n#include \"gtest\/gtest.h\"\n#include \"harness.h\"\n\n#include \"backend\/mfabric\/libnanomsg\/src\/nn.h\"\n#include \"backend\/mfabric\/libnanomsg\/src\/pair.h\"\n\nnamespace peloton {\nnamespace test {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Pair Tests\n\/\/===--------------------------------------------------------------------===\/\/\n\n#define NODE0 \"node0\"\n#define NODE1 \"node1\"\n\nint send_name(int sock, const char *name)\n{\n\tprintf (\"%s: SENDING \\\"%s\\\"\\n\", name, name);\n\tint sz_n = strlen (name) + 1; \/\/ '\\0' too\n\treturn nn_send (sock, name, sz_n, 0);\n}\n\nint recv_name(int sock, const char *name)\n{\n\tchar *buf = NULL;\n\tint result = nn_recv (sock, &buf, NN_MSG, 0);\n\tif (result > 0)\n\t{\n\t\tprintf (\"%s: RECEIVED \\\"%s\\\"\\n\", name, buf);\n\t\tnn_freemsg (buf);\n\t}\n\treturn result;\n}\n\nint send_recv(int sock, const char *name)\n{\n\tint to = 100;\n\tassert (nn_setsockopt (sock, NN_SOL_SOCKET, NN_RCVTIMEO, &to, sizeof (to)) >= 0);\n\twhile(1)\n\t{\n\t\trecv_name(sock, name);\n\t\tsleep(1);\n\t\tsend_name(sock, name);\n\t}\n}\n\nint node0 (const char *url)\n{\n\tint sock = nn_socket (AF_SP, NN_PAIR);\n\tassert (sock >= 0);\n\tassert (nn_bind (sock, url) >= 0);\n\tsend_recv(sock, NODE0);\n\treturn nn_shutdown (sock, 0);\n}\n\nint node1 (const char *url)\n{\n\tint sock = nn_socket (AF_SP, NN_PAIR);\n\tassert (sock >= 0);\n\tassert (nn_connect (sock, url) >= 0);\n\tsend_recv(sock, NODE1);\n\treturn nn_shutdown (sock, 0);\n}\n\nTEST(PairTest, BasicTest) {\n\n node0(NODE0);\n node1(NODE1);\n\n}\n\n}  \/\/ End test namespace\n}  \/\/ End peloton namespace\n\n<commit_msg>Fixing pair test<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         PelotonDB\n\/\/\n\/\/ pair_test.cpp\n\/\/\n\/\/ Identification: tests\/mfabric\/pair_test.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <string.h>\n#include <unistd.h>\n#include <cstdio>\n#include <cassert>\n\n#include \"gtest\/gtest.h\"\n#include \"harness.h\"\n\n#include \"backend\/mfabric\/libnanomsg\/src\/nn.h\"\n#include \"backend\/mfabric\/libnanomsg\/src\/pair.h\"\n\nnamespace peloton {\nnamespace test {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Pair Tests\n\/\/===--------------------------------------------------------------------===\/\/\n\n#define NODE0 \"node0\"\n#define NODE1 \"node1\"\n\nint send_name(int sock, const char *name)\n{\n  printf(\"Send name \\n\");\n\n  printf (\"%s: SENDING \\\"%s\\\"\\n\", name, name);\n  int sz_n = strlen (name) + 1; \/\/ '\\0' too\n  return nn_send (sock, name, sz_n, 0);\n}\n\nint recv_name(int sock, const char *name)\n{\n  printf(\"Recv name \\n\");\n\n  char *buf = NULL;\n  int result = nn_recv (sock, &buf, NN_MSG, 0);\n  if (result > 0)\n  {\n    printf (\"%s: RECEIVED \\\"%s\\\"\\n\", name, buf);\n    nn_freemsg (buf);\n  }\n  return result;\n}\n\nint send_recv(int sock, const char *name)\n{\n  int to = 100;\n  assert (nn_setsockopt (sock, NN_SOL_SOCKET, NN_RCVTIMEO, &to, sizeof (to)) >= 0);\n  while(1)\n  {\n    printf(\"Send Recv \\n\");\n    recv_name(sock, name);\n    \/\/sleep(1);\n    send_name(sock, name);\n  }\n}\n\nint node0 (const char *url)\n{\n  int sock = nn_socket (AF_SP, NN_PAIR);\n  assert (sock >= 0);\n  assert (nn_bind (sock, url) >= 0);\n  send_recv(sock, NODE0);\n  return nn_shutdown (sock, 0);\n}\n\nint node1 (const char *url)\n{\n  int sock = nn_socket (AF_SP, NN_PAIR);\n  assert (sock >= 0);\n  assert (nn_connect (sock, url) >= 0);\n  send_recv(sock, NODE1);\n  return nn_shutdown (sock, 0);\n}\n\nTEST(PairTest, BasicTest) {\n\n  std::thread send(node0,\"ipc:\/\/\/tmp\/pair.ipc\");\n  send.detach();\n  std::thread recv(node1,\"ipc:\/\/\/tmp\/pair.ipc\");\n  recv.detach();\n\n  sleep(3);\n\n}\n\n}  \/\/ End test namespace\n}  \/\/ End peloton namespace\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- TargetData.cpp - Data size & alignment routines --------------------==\/\/\n\/\/\n\/\/ This file defines target properties related to datatype size\/offset\/alignment\n\/\/ information.  It uses lazy annotations to cache information about how \n\/\/ structure types are laid out and used.\n\/\/\n\/\/ This structure should be created once, filled in if the defaults are not\n\/\/ correct and then passed around by const&.  None of the members functions\n\/\/ require modification to the object.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Constants.h\"\n\nstatic inline void getTypeInfo(const Type *Ty, const TargetData *TD,\n\t\t\t       uint64_t &Size, unsigned char &Alignment);\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Support for StructLayout Annotation\n\/\/===----------------------------------------------------------------------===\/\/\n\nStructLayout::StructLayout(const StructType *ST, const TargetData &TD) \n  : Annotation(TD.getStructLayoutAID()) {\n  StructAlignment = 0;\n  StructSize = 0;\n\n  \/\/ Loop over each of the elements, placing them in memory...\n  for (StructType::ElementTypes::const_iterator\n\t TI = ST->getElementTypes().begin(), \n\t TE = ST->getElementTypes().end(); TI != TE; ++TI) {\n    const Type *Ty = *TI;\n    unsigned char A;\n    unsigned TyAlign;\n    uint64_t TySize;\n    getTypeInfo(Ty, &TD, TySize, A);\n    TyAlign = A;\n\n    \/\/ Add padding if neccesary to make the data element aligned properly...\n    if (StructSize % TyAlign != 0)\n      StructSize = (StructSize\/TyAlign + 1) * TyAlign;   \/\/ Add padding...\n\n    \/\/ Keep track of maximum alignment constraint\n    StructAlignment = std::max(TyAlign, StructAlignment);\n\n    MemberOffsets.push_back(StructSize);\n    StructSize += TySize;                 \/\/ Consume space for this data item\n  }\n\n  \/\/ Add padding to the end of the struct so that it could be put in an array\n  \/\/ and all array elements would be aligned correctly.\n  if (StructSize % StructAlignment != 0)\n    StructSize = (StructSize\/StructAlignment + 1) * StructAlignment;\n\n  if (StructSize == 0) {\n    StructSize = 1;           \/\/ Empty struct is 1 byte\n    StructAlignment = 1;\n  }\n}\n\nAnnotation *TargetData::TypeAnFactory(AnnotationID AID, const Annotable *T,\n\t\t\t\t      void *D) {\n  const TargetData &TD = *(const TargetData*)D;\n  assert(AID == TD.AID && \"Target data annotation ID mismatch!\");\n  const Type *Ty = cast<const Type>((const Value *)T);\n  assert(isa<StructType>(Ty) && \n\t \"Can only create StructLayout annotation on structs!\");\n  return new StructLayout((const StructType *)Ty, TD);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                       TargetData Class Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nTargetData::TargetData(const std::string &TargetName,\n             unsigned char IntRegSize, unsigned char PtrSize,\n\t     unsigned char PtrAl, unsigned char DoubleAl,\n\t     unsigned char FloatAl, unsigned char LongAl, \n\t     unsigned char IntAl, unsigned char ShortAl,\n\t     unsigned char ByteAl)\n  : AID(AnnotationManager::getID(\"TargetData::\" + TargetName)) {\n  AnnotationManager::registerAnnotationFactory(AID, TypeAnFactory, this);\n\n  IntegerRegSize   = IntRegSize;\n  PointerSize      = PtrSize;\n  PointerAlignment = PtrAl;\n  DoubleAlignment  = DoubleAl;\n  FloatAlignment   = FloatAl;\n  LongAlignment    = LongAl;\n  IntAlignment     = IntAl;\n  ShortAlignment   = ShortAl;\n  ByteAlignment    = ByteAl;\n}\n\nTargetData::~TargetData() {\n  AnnotationManager::registerAnnotationFactory(AID, 0);   \/\/ Deregister factory\n}\n\nstatic inline void getTypeInfo(const Type *Ty, const TargetData *TD,\n\t\t\t       uint64_t &Size, unsigned char &Alignment) {\n  assert(Ty->isSized() && \"Cannot getTypeInfo() on a type that is unsized!\");\n  switch (Ty->getPrimitiveID()) {\n  case Type::VoidTyID:\n  case Type::BoolTyID:\n  case Type::UByteTyID:\n  case Type::SByteTyID:  Size = 1; Alignment = TD->getByteAlignment(); return;\n  case Type::UShortTyID:\n  case Type::ShortTyID:  Size = 2; Alignment = TD->getShortAlignment(); return;\n  case Type::UIntTyID:\n  case Type::IntTyID:    Size = 4; Alignment = TD->getIntAlignment(); return;\n  case Type::ULongTyID:\n  case Type::LongTyID:   Size = 8; Alignment = TD->getLongAlignment(); return;\n  case Type::FloatTyID:  Size = 4; Alignment = TD->getFloatAlignment(); return;\n  case Type::DoubleTyID: Size = 8; Alignment = TD->getDoubleAlignment(); return;\n  case Type::LabelTyID:\n  case Type::PointerTyID:\n    Size = TD->getPointerSize(); Alignment = TD->getPointerAlignment();\n    return;\n  case Type::ArrayTyID: {\n    const ArrayType *ATy = (const ArrayType *)Ty;\n    getTypeInfo(ATy->getElementType(), TD, Size, Alignment);\n    Size *= ATy->getNumElements();\n    return;\n  }\n  case Type::StructTyID: {\n    \/\/ Get the layout annotation... which is lazily created on demand.\n    const StructLayout *Layout = TD->getStructLayout((const StructType*)Ty);\n    Size = Layout->StructSize; Alignment = Layout->StructAlignment;\n    return;\n  }\n    \n  case Type::TypeTyID:\n  default:\n    assert(0 && \"Bad type for getTypeInfo!!!\");\n    return;\n  }\n}\n\nuint64_t TargetData::getTypeSize(const Type *Ty) const {\n  uint64_t Size;\n  unsigned char Align;\n  getTypeInfo(Ty, this, Size, Align);\n  return Size;\n}\n\nunsigned char TargetData::getTypeAlignment(const Type *Ty) const {\n  uint64_t Size;\n  unsigned char Align;\n  getTypeInfo(Ty, this, Size, Align);\n  return Align;\n}\n\nuint64_t TargetData::getIndexedOffset(const Type *ptrTy,\n\t\t\t\t      const std::vector<Value*> &Idx) const {\n  const Type *Ty = ptrTy;\n  assert(isa<PointerType>(Ty) && \"Illegal argument for getIndexedOffset()\");\n  uint64_t Result = 0;\n\n  for (unsigned CurIDX = 0; CurIDX < Idx.size(); ++CurIDX) {\n    if (Idx[CurIDX]->getType() == Type::UIntTy) {\n      \/\/ Update Ty to refer to current element\n      Ty = cast<SequentialType>(Ty)->getElementType();\n\n      \/\/ Get the array index and the size of each array element.\n      \/\/ Both must be known constants, or this will fail.\n      \/\/ Also, the arrayIdx needs to be sign-extended from 32 bits to uint64_t\n      \/\/ since uint is not normally sign-extended when cast to uint64_t.\n      uint64_t elementSize = this->getTypeSize(Ty);\n      uint64_t arrayIdx = cast<ConstantUInt>(Idx[CurIDX])->getValue();\n      arrayIdx = (uint64_t) (int) arrayIdx; \/\/ sign-extend from 32 to 64 bits\n      Result += arrayIdx * elementSize;\n\n    } else if (const StructType *STy = dyn_cast<const StructType>(Ty)) {\n      assert(Idx[CurIDX]->getType() == Type::UByteTy && \"Illegal struct idx\");\n      unsigned FieldNo = cast<ConstantUInt>(Idx[CurIDX])->getValue();\n\n      \/\/ Get structure layout information...\n      const StructLayout *Layout = getStructLayout(STy);\n\n      \/\/ Add in the offset, as calculated by the structure layout info...\n      assert(FieldNo < Layout->MemberOffsets.size() &&\"FieldNo out of range!\");\n      Result += Layout->MemberOffsets[FieldNo];\n\n      \/\/ Update Ty to refer to current element\n      Ty = STy->getElementTypes()[FieldNo];\n\n    } else if (isa<const ArrayType>(Ty)) {\n      assert(0 && \"Loading from arrays not implemented yet!\");\n    } else {\n      assert(0 && \"Indexing type that is not struct or array?\");\n      return 0;                         \/\/ Load directly through ptr\n    }\n  }\n\n  return Result;\n}\n<commit_msg>Fix sign-extension: it needs to happen *after* multiplying by type size.<commit_after>\/\/===-- TargetData.cpp - Data size & alignment routines --------------------==\/\/\n\/\/\n\/\/ This file defines target properties related to datatype size\/offset\/alignment\n\/\/ information.  It uses lazy annotations to cache information about how \n\/\/ structure types are laid out and used.\n\/\/\n\/\/ This structure should be created once, filled in if the defaults are not\n\/\/ correct and then passed around by const&.  None of the members functions\n\/\/ require modification to the object.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Constants.h\"\n\nstatic inline void getTypeInfo(const Type *Ty, const TargetData *TD,\n\t\t\t       uint64_t &Size, unsigned char &Alignment);\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Support for StructLayout Annotation\n\/\/===----------------------------------------------------------------------===\/\/\n\nStructLayout::StructLayout(const StructType *ST, const TargetData &TD) \n  : Annotation(TD.getStructLayoutAID()) {\n  StructAlignment = 0;\n  StructSize = 0;\n\n  \/\/ Loop over each of the elements, placing them in memory...\n  for (StructType::ElementTypes::const_iterator\n\t TI = ST->getElementTypes().begin(), \n\t TE = ST->getElementTypes().end(); TI != TE; ++TI) {\n    const Type *Ty = *TI;\n    unsigned char A;\n    unsigned TyAlign;\n    uint64_t TySize;\n    getTypeInfo(Ty, &TD, TySize, A);\n    TyAlign = A;\n\n    \/\/ Add padding if neccesary to make the data element aligned properly...\n    if (StructSize % TyAlign != 0)\n      StructSize = (StructSize\/TyAlign + 1) * TyAlign;   \/\/ Add padding...\n\n    \/\/ Keep track of maximum alignment constraint\n    StructAlignment = std::max(TyAlign, StructAlignment);\n\n    MemberOffsets.push_back(StructSize);\n    StructSize += TySize;                 \/\/ Consume space for this data item\n  }\n\n  \/\/ Add padding to the end of the struct so that it could be put in an array\n  \/\/ and all array elements would be aligned correctly.\n  if (StructSize % StructAlignment != 0)\n    StructSize = (StructSize\/StructAlignment + 1) * StructAlignment;\n\n  if (StructSize == 0) {\n    StructSize = 1;           \/\/ Empty struct is 1 byte\n    StructAlignment = 1;\n  }\n}\n\nAnnotation *TargetData::TypeAnFactory(AnnotationID AID, const Annotable *T,\n\t\t\t\t      void *D) {\n  const TargetData &TD = *(const TargetData*)D;\n  assert(AID == TD.AID && \"Target data annotation ID mismatch!\");\n  const Type *Ty = cast<const Type>((const Value *)T);\n  assert(isa<StructType>(Ty) && \n\t \"Can only create StructLayout annotation on structs!\");\n  return new StructLayout((const StructType *)Ty, TD);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                       TargetData Class Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nTargetData::TargetData(const std::string &TargetName,\n             unsigned char IntRegSize, unsigned char PtrSize,\n\t     unsigned char PtrAl, unsigned char DoubleAl,\n\t     unsigned char FloatAl, unsigned char LongAl, \n\t     unsigned char IntAl, unsigned char ShortAl,\n\t     unsigned char ByteAl)\n  : AID(AnnotationManager::getID(\"TargetData::\" + TargetName)) {\n  AnnotationManager::registerAnnotationFactory(AID, TypeAnFactory, this);\n\n  IntegerRegSize   = IntRegSize;\n  PointerSize      = PtrSize;\n  PointerAlignment = PtrAl;\n  DoubleAlignment  = DoubleAl;\n  FloatAlignment   = FloatAl;\n  LongAlignment    = LongAl;\n  IntAlignment     = IntAl;\n  ShortAlignment   = ShortAl;\n  ByteAlignment    = ByteAl;\n}\n\nTargetData::~TargetData() {\n  AnnotationManager::registerAnnotationFactory(AID, 0);   \/\/ Deregister factory\n}\n\nstatic inline void getTypeInfo(const Type *Ty, const TargetData *TD,\n\t\t\t       uint64_t &Size, unsigned char &Alignment) {\n  assert(Ty->isSized() && \"Cannot getTypeInfo() on a type that is unsized!\");\n  switch (Ty->getPrimitiveID()) {\n  case Type::VoidTyID:\n  case Type::BoolTyID:\n  case Type::UByteTyID:\n  case Type::SByteTyID:  Size = 1; Alignment = TD->getByteAlignment(); return;\n  case Type::UShortTyID:\n  case Type::ShortTyID:  Size = 2; Alignment = TD->getShortAlignment(); return;\n  case Type::UIntTyID:\n  case Type::IntTyID:    Size = 4; Alignment = TD->getIntAlignment(); return;\n  case Type::ULongTyID:\n  case Type::LongTyID:   Size = 8; Alignment = TD->getLongAlignment(); return;\n  case Type::FloatTyID:  Size = 4; Alignment = TD->getFloatAlignment(); return;\n  case Type::DoubleTyID: Size = 8; Alignment = TD->getDoubleAlignment(); return;\n  case Type::LabelTyID:\n  case Type::PointerTyID:\n    Size = TD->getPointerSize(); Alignment = TD->getPointerAlignment();\n    return;\n  case Type::ArrayTyID: {\n    const ArrayType *ATy = (const ArrayType *)Ty;\n    getTypeInfo(ATy->getElementType(), TD, Size, Alignment);\n    Size *= ATy->getNumElements();\n    return;\n  }\n  case Type::StructTyID: {\n    \/\/ Get the layout annotation... which is lazily created on demand.\n    const StructLayout *Layout = TD->getStructLayout((const StructType*)Ty);\n    Size = Layout->StructSize; Alignment = Layout->StructAlignment;\n    return;\n  }\n    \n  case Type::TypeTyID:\n  default:\n    assert(0 && \"Bad type for getTypeInfo!!!\");\n    return;\n  }\n}\n\nuint64_t TargetData::getTypeSize(const Type *Ty) const {\n  uint64_t Size;\n  unsigned char Align;\n  getTypeInfo(Ty, this, Size, Align);\n  return Size;\n}\n\nunsigned char TargetData::getTypeAlignment(const Type *Ty) const {\n  uint64_t Size;\n  unsigned char Align;\n  getTypeInfo(Ty, this, Size, Align);\n  return Align;\n}\n\nuint64_t TargetData::getIndexedOffset(const Type *ptrTy,\n\t\t\t\t      const std::vector<Value*> &Idx) const {\n  const Type *Ty = ptrTy;\n  assert(isa<PointerType>(Ty) && \"Illegal argument for getIndexedOffset()\");\n  uint64_t Result = 0;\n\n  for (unsigned CurIDX = 0; CurIDX < Idx.size(); ++CurIDX) {\n    if (Idx[CurIDX]->getType() == Type::UIntTy) {\n      \/\/ Update Ty to refer to current element\n      Ty = cast<SequentialType>(Ty)->getElementType();\n\n      \/\/ Get the array index and the size of each array element.\n      \/\/ Both must be known constants, or this will fail.\n      \/\/ Also, the product needs to be sign-extended from 32 to 64 bits.\n      uint64_t elementSize = this->getTypeSize(Ty);\n      uint64_t arrayIdx = cast<ConstantUInt>(Idx[CurIDX])->getValue();\n      Result += (uint64_t) (int) (arrayIdx * elementSize); \/\/ sign-extend\n\n    } else if (const StructType *STy = dyn_cast<const StructType>(Ty)) {\n      assert(Idx[CurIDX]->getType() == Type::UByteTy && \"Illegal struct idx\");\n      unsigned FieldNo = cast<ConstantUInt>(Idx[CurIDX])->getValue();\n\n      \/\/ Get structure layout information...\n      const StructLayout *Layout = getStructLayout(STy);\n\n      \/\/ Add in the offset, as calculated by the structure layout info...\n      assert(FieldNo < Layout->MemberOffsets.size() &&\"FieldNo out of range!\");\n      Result += Layout->MemberOffsets[FieldNo];\n\n      \/\/ Update Ty to refer to current element\n      Ty = STy->getElementTypes()[FieldNo];\n\n    } else if (isa<const ArrayType>(Ty)) {\n      assert(0 && \"Loading from arrays not implemented yet!\");\n    } else {\n      assert(0 && \"Indexing type that is not struct or array?\");\n      return 0;                         \/\/ Load directly through ptr\n    }\n  }\n\n  return Result;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/---------------------------------------------------------------------------\n\/\/    $Id: integrate_difference.cc 24418 2011-09-26 12:52:19Z bangerth $\n\/\/    Version: $Name$\n\/\/\n\/\/    Copyright (C) 2009, 2010, 2011 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\/\/---------------------------------------------------------------------------\n\n\n\/\/ in Trilinos 10.12.1 interpolate() hangs with a small number of cells (smaller than the number of CPUs). This works fine in 10.4.2 and 10.8.5\n\n#include \"..\/tests.h\"\n#include \"coarse_grid_common.h\"\n#include <deal.II\/base\/logstream.h>\n#include <deal.II\/base\/function.h>\n#include <deal.II\/base\/tensor.h>\n#include <deal.II\/lac\/trilinos_vector.h>\n#include <deal.II\/grid\/tria.h>\n#include <deal.II\/grid\/grid_generator.h>\n#include <deal.II\/distributed\/tria.h>\n#include <deal.II\/grid\/grid_generator.h>\n#include <deal.II\/grid\/grid_out.h>\n#include <deal.II\/dofs\/dof_handler.h>\n#include <deal.II\/dofs\/dof_handler.h>\n#include <deal.II\/dofs\/dof_tools.h>\n#include <deal.II\/grid\/tria_accessor.h>\n#include <deal.II\/grid\/tria_iterator.h>\n#include <deal.II\/dofs\/dof_accessor.h>\n\n#include <deal.II\/fe\/fe_q.h>\n#include <deal.II\/numerics\/vectors.h>\n\n#include <fstream>\n\n\ntemplate <int dim>\nclass LinearFunction : public Function<dim> \n{\n  public:\n    double value (const Point<dim> &p,\n\t\t  const unsigned int) const\n      {\n\treturn 1;\n      }\n};\n\n\ntemplate<int dim>\nvoid test()\n{\n  parallel::distributed::Triangulation<dim> tr(MPI_COMM_WORLD);\n\n  GridGenerator::hyper_cube(tr);\n\n\/\/tr.refine_global (2);\n\n  const FE_Q<dim> fe(2);\n  DoFHandler<dim> dofh(tr);\n  dofh.distribute_dofs (fe);\n  \n  TrilinosWrappers::MPI::Vector interpolated(dofh.locally_owned_dofs(),\n\t\t\t\t\t     MPI_COMM_WORLD);\n  deallog << \"before\" << std::endl;\n  VectorTools::interpolate (dofh,\n\t\t\t    LinearFunction<dim>(),\n\t\t\t    interpolated);\n  deallog << \"after\" << std::endl;\n  interpolated.compress();\n\n  double norm = interpolated.l2_norm();\n  if (Utilities::MPI::this_mpi_process (MPI_COMM_WORLD) == 0)\n    deallog << \"norm = \" << norm\n\t    << std::endl;\n}\n\n\nint main(int argc, char *argv[])\n{\n#ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n  MPI_Init (&argc,&argv);\n#else\n  (void)argc;\n  (void)argv;\n#endif\n\n  unsigned int myid = Utilities::MPI::this_mpi_process (MPI_COMM_WORLD);\n\n\n  deallog.push(Utilities::int_to_string(myid));\n\n  if (myid == 0)\n    {\n      std::ofstream logfile(output_file_for_mpi(\"interpolate_03\").c_str());\n      deallog.attach(logfile);\n      deallog.depth_console(0);\n      deallog.threshold_double(1.e-10);\n\n      deallog.push(\"2d\");\n      test<2>();\n      deallog.pop();\n\n      deallog.push(\"3d\");\n\t\t\t\t       \/\/    test<3>();\n      deallog.pop();\n    }\n  else\n    {\n      deallog.push(\"2d\");\n      test<2>();\n      deallog.pop();\n\n      deallog.push(\"3d\");\n\/\/      test<3>();\n      deallog.pop();\n    }\n\n#ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n  MPI_Finalize();\n#endif\n}\n<commit_msg>document test better<commit_after>\/\/---------------------------------------------------------------------------\n\/\/    $Id: integrate_difference.cc 24418 2011-09-26 12:52:19Z bangerth $\n\/\/    Version: $Name$\n\/\/\n\/\/    Copyright (C) 2009, 2010, 2011 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\/\/---------------------------------------------------------------------------\n\n\n\/\/ In Trilinos 10.12.1 interpolate() hangs with a small number of cells (smaller than the number of CPUs). This works fine in 10.4.2 and 10.8.5\n\/\/ As it turns out, this is because vector creation after interpolate()\n\/\/ reacts differently in 10.12.1 and causes a hang. The bug is\n\/\/ that interpolate() does not call compress()!\n\n#include \"..\/tests.h\"\n#include \"coarse_grid_common.h\"\n#include <deal.II\/base\/logstream.h>\n#include <deal.II\/base\/function.h>\n#include <deal.II\/base\/tensor.h>\n#include <deal.II\/lac\/trilinos_vector.h>\n#include <deal.II\/grid\/tria.h>\n#include <deal.II\/grid\/grid_generator.h>\n#include <deal.II\/distributed\/tria.h>\n#include <deal.II\/grid\/grid_generator.h>\n#include <deal.II\/grid\/grid_out.h>\n#include <deal.II\/dofs\/dof_handler.h>\n#include <deal.II\/dofs\/dof_handler.h>\n#include <deal.II\/dofs\/dof_tools.h>\n#include <deal.II\/grid\/tria_accessor.h>\n#include <deal.II\/grid\/tria_iterator.h>\n#include <deal.II\/dofs\/dof_accessor.h>\n\n#include <deal.II\/fe\/fe_q.h>\n#include <deal.II\/numerics\/vectors.h>\n\n#include <fstream>\n\n\ntemplate <int dim>\nclass LinearFunction : public Function<dim> \n{\n  public:\n    double value (const Point<dim> &p,\n\t\t  const unsigned int) const\n      {\n\treturn 1;\n      }\n};\n\n\ntemplate<int dim>\nvoid test()\n{\n  parallel::distributed::Triangulation<dim> tr(MPI_COMM_WORLD);\n\n  GridGenerator::hyper_cube(tr);\n\n\/\/tr.refine_global (2);\n\n  const FE_Q<dim> fe(2);\n  DoFHandler<dim> dofh(tr);\n  dofh.distribute_dofs (fe);\n  \n  TrilinosWrappers::MPI::Vector interpolated(dofh.locally_owned_dofs(),\n\t\t\t\t\t     MPI_COMM_WORLD);\n  deallog << \"before\" << std::endl;\n  VectorTools::interpolate (dofh,\n\t\t\t    LinearFunction<dim>(),\n\t\t\t    interpolated);\n  deallog << \"after\" << std::endl;\n  interpolated.compress();\n\n  double norm = interpolated.l2_norm();\n  if (Utilities::MPI::this_mpi_process (MPI_COMM_WORLD) == 0)\n    deallog << \"norm = \" << norm\n\t    << std::endl;\n}\n\n\nint main(int argc, char *argv[])\n{\n#ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n  MPI_Init (&argc,&argv);\n#else\n  (void)argc;\n  (void)argv;\n#endif\n\n  unsigned int myid = Utilities::MPI::this_mpi_process (MPI_COMM_WORLD);\n\n\n  deallog.push(Utilities::int_to_string(myid));\n\n  if (myid == 0)\n    {\n      std::ofstream logfile(output_file_for_mpi(\"interpolate_03\").c_str());\n      deallog.attach(logfile);\n      deallog.depth_console(0);\n      deallog.threshold_double(1.e-10);\n\n      deallog.push(\"2d\");\n      test<2>();\n      deallog.pop();\n\n      deallog.push(\"3d\");\n\t\t\t\t       \/\/    test<3>();\n      deallog.pop();\n    }\n  else\n    {\n      deallog.push(\"2d\");\n      test<2>();\n      deallog.pop();\n\n      deallog.push(\"3d\");\n\/\/      test<3>();\n      deallog.pop();\n    }\n\n#ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n  MPI_Finalize();\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- Dominators.cpp - Dominator Calculation -----------------------------===\/\/\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 simple dominator construction algorithms for finding\n\/\/ forward dominators.  Postdominators are available in libanalysis, but are not\n\/\/ included in libvmcore, because it's not needed.  Forward dominators are\n\/\/ needed to support the Verifier pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/ADT\/DepthFirstIterator.h\"\n#include \"llvm\/ADT\/SetOperations.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Analysis\/DominatorInternals.h\"\n#include \"llvm\/Instructions.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include <algorithm>\nusing namespace llvm;\n\n\/\/ Always verify dominfo if expensive checking is enabled.\n#ifdef XDEBUG\nstatic bool VerifyDomInfo = true;\n#else\nstatic bool VerifyDomInfo = false;\n#endif\nstatic cl::opt<bool,true>\nVerifyDomInfoX(\"verify-dom-info\", cl::location(VerifyDomInfo),\n               cl::desc(\"Verify dominator info (time consuming)\"));\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  DominatorTree Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Provide public access to DominatorTree information.  Implementation details\n\/\/ can be found in DominatorCalculation.h.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\nTEMPLATE_INSTANTIATION(class llvm::DomTreeNodeBase<BasicBlock>);\nTEMPLATE_INSTANTIATION(class llvm::DominatorTreeBase<BasicBlock>);\n\nchar DominatorTree::ID = 0;\nINITIALIZE_PASS(DominatorTree, \"domtree\",\n                \"Dominator Tree Construction\", true, true);\n\nbool DominatorTree::runOnFunction(Function &F) {\n  DT->recalculate(F);\n  return false;\n}\n\nvoid DominatorTree::verifyAnalysis() const {\n  if (!VerifyDomInfo) return;\n\n  Function &F = *getRoot()->getParent();\n\n  DominatorTree OtherDT;\n  OtherDT.getBase().recalculate(F);\n  assert(!compare(OtherDT) && \"Invalid DominatorTree info!\");\n}\n\nvoid DominatorTree::print(raw_ostream &OS, const Module *) const {\n  DT->print(OS);\n}\n\n\/\/ dominates - Return true if A dominates a use in B. This performs the\n\/\/ special checks necessary if A and B are in the same basic block.\nbool DominatorTree::dominates(const Instruction *A, const Instruction *B) const{\n  const BasicBlock *BBA = A->getParent(), *BBB = B->getParent();\n  \n  \/\/ If A is an invoke instruction, its value is only available in this normal\n  \/\/ successor block.\n  if (const InvokeInst *II = dyn_cast<InvokeInst>(A))\n    BBA = II->getNormalDest();\n  \n  if (BBA != BBB) return dominates(BBA, BBB);\n  \n  \/\/ It is not possible to determine dominance between two PHI nodes \n  \/\/ based on their ordering.\n  if (isa<PHINode>(A) && isa<PHINode>(B)) \n    return false;\n  \n  \/\/ Loop through the basic block until we find A or B.\n  BasicBlock::const_iterator I = BBA->begin();\n  for (; &*I != A && &*I != B; ++I)\n    \/*empty*\/;\n  \n  return &*I == A;\n}\n\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  DominanceFrontier Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nchar DominanceFrontier::ID = 0;\nINITIALIZE_PASS(DominanceFrontier, \"domfrontier\",\n                \"Dominance Frontier Construction\", true, true);\n\nvoid DominanceFrontier::verifyAnalysis() const {\n  if (!VerifyDomInfo) return;\n\n  DominatorTree &DT = getAnalysis<DominatorTree>();\n\n  DominanceFrontier OtherDF;\n  const std::vector<BasicBlock*> &DTRoots = DT.getRoots();\n  OtherDF.calculate(DT, DT.getNode(DTRoots[0]));\n  assert(!compare(OtherDF) && \"Invalid DominanceFrontier info!\");\n}\n\n\/\/ NewBB is split and now it has one successor. Update dominance frontier to\n\/\/ reflect this change.\nvoid DominanceFrontier::splitBlock(BasicBlock *NewBB) {\n  assert(NewBB->getTerminator()->getNumSuccessors() == 1\n         && \"NewBB should have a single successor!\");\n  BasicBlock *NewBBSucc = NewBB->getTerminator()->getSuccessor(0);\n\n  SmallVector<BasicBlock*, 8> PredBlocks;\n  for (pred_iterator PI = pred_begin(NewBB), PE = pred_end(NewBB);\n       PI != PE; ++PI)\n    PredBlocks.push_back(*PI);  \n\n  if (PredBlocks.empty())\n    \/\/ If NewBB does not have any predecessors then it is a entry block.\n    \/\/ In this case, NewBB and its successor NewBBSucc dominates all\n    \/\/ other blocks.\n    return;\n\n  \/\/ NewBBSucc inherits original NewBB frontier.\n  DominanceFrontier::iterator NewBBI = find(NewBB);\n  if (NewBBI != end()) {\n    DominanceFrontier::DomSetType NewBBSet = NewBBI->second;\n    DominanceFrontier::DomSetType NewBBSuccSet;\n    NewBBSuccSet.insert(NewBBSet.begin(), NewBBSet.end());\n    addBasicBlock(NewBBSucc, NewBBSuccSet);\n  }\n\n  \/\/ If NewBB dominates NewBBSucc, then DF(NewBB) is now going to be the\n  \/\/ DF(NewBBSucc) without the stuff that the new block does not dominate\n  \/\/ a predecessor of.\n  DominatorTree &DT = getAnalysis<DominatorTree>();\n  if (DT.dominates(NewBB, NewBBSucc)) {\n    DominanceFrontier::iterator DFI = find(NewBBSucc);\n    if (DFI != end()) {\n      DominanceFrontier::DomSetType Set = DFI->second;\n      \/\/ Filter out stuff in Set that we do not dominate a predecessor of.\n      for (DominanceFrontier::DomSetType::iterator SetI = Set.begin(),\n             E = Set.end(); SetI != E;) {\n        bool DominatesPred = false;\n        for (pred_iterator PI = pred_begin(*SetI), E = pred_end(*SetI);\n             PI != E; ++PI)\n          if (DT.dominates(NewBB, *PI))\n            DominatesPred = true;\n        if (!DominatesPred)\n          Set.erase(SetI++);\n        else\n          ++SetI;\n      }\n\n      if (NewBBI != end()) {\n        for (DominanceFrontier::DomSetType::iterator SetI = Set.begin(),\n               E = Set.end(); SetI != E; ++SetI) {\n          BasicBlock *SB = *SetI;\n          addToFrontier(NewBBI, SB);\n        }\n      } else \n        addBasicBlock(NewBB, Set);\n    }\n    \n  } else {\n    \/\/ DF(NewBB) is {NewBBSucc} because NewBB does not strictly dominate\n    \/\/ NewBBSucc, but it does dominate itself (and there is an edge (NewBB ->\n    \/\/ NewBBSucc)).  NewBBSucc is the single successor of NewBB.\n    DominanceFrontier::DomSetType NewDFSet;\n    NewDFSet.insert(NewBBSucc);\n    addBasicBlock(NewBB, NewDFSet);\n  }\n  \n  \/\/ Now we must loop over all of the dominance frontiers in the function,\n  \/\/ replacing occurrences of NewBBSucc with NewBB in some cases.  All\n  \/\/ blocks that dominate a block in PredBlocks and contained NewBBSucc in\n  \/\/ their dominance frontier must be updated to contain NewBB instead.\n  \/\/\n  for (Function::iterator FI = NewBB->getParent()->begin(),\n         FE = NewBB->getParent()->end(); FI != FE; ++FI) {\n    DominanceFrontier::iterator DFI = find(FI);\n    if (DFI == end()) continue;  \/\/ unreachable block.\n    \n    \/\/ Only consider nodes that have NewBBSucc in their dominator frontier.\n    if (!DFI->second.count(NewBBSucc)) continue;\n\n    \/\/ Verify whether this block dominates a block in predblocks.  If not, do\n    \/\/ not update it.\n    bool BlockDominatesAny = false;\n    for (SmallVectorImpl<BasicBlock*>::const_iterator BI = PredBlocks.begin(), \n           BE = PredBlocks.end(); BI != BE; ++BI) {\n      if (DT.dominates(FI, *BI)) {\n        BlockDominatesAny = true;\n        break;\n      }\n    }\n\n    \/\/ If NewBBSucc should not stay in our dominator frontier, remove it.\n    \/\/ We remove it unless there is a predecessor of NewBBSucc that we\n    \/\/ dominate, but we don't strictly dominate NewBBSucc.\n    bool ShouldRemove = true;\n    if ((BasicBlock*)FI == NewBBSucc || !DT.dominates(FI, NewBBSucc)) {\n      \/\/ Okay, we know that PredDom does not strictly dominate NewBBSucc.\n      \/\/ Check to see if it dominates any predecessors of NewBBSucc.\n      for (pred_iterator PI = pred_begin(NewBBSucc),\n           E = pred_end(NewBBSucc); PI != E; ++PI)\n        if (DT.dominates(FI, *PI)) {\n          ShouldRemove = false;\n          break;\n        }\n    }\n    \n    if (ShouldRemove)\n      removeFromFrontier(DFI, NewBBSucc);\n    if (BlockDominatesAny && (&*FI == NewBB || !DT.dominates(FI, NewBB)))\n      addToFrontier(DFI, NewBB);\n  }\n}\n\nnamespace {\n  class DFCalculateWorkObject {\n  public:\n    DFCalculateWorkObject(BasicBlock *B, BasicBlock *P, \n                          const DomTreeNode *N,\n                          const DomTreeNode *PN)\n    : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}\n    BasicBlock *currentBB;\n    BasicBlock *parentBB;\n    const DomTreeNode *Node;\n    const DomTreeNode *parentNode;\n  };\n}\n\nconst DominanceFrontier::DomSetType &\nDominanceFrontier::calculate(const DominatorTree &DT,\n                             const DomTreeNode *Node) {\n  BasicBlock *BB = Node->getBlock();\n  DomSetType *Result = NULL;\n\n  std::vector<DFCalculateWorkObject> workList;\n  SmallPtrSet<BasicBlock *, 32> visited;\n\n  workList.push_back(DFCalculateWorkObject(BB, NULL, Node, NULL));\n  do {\n    DFCalculateWorkObject *currentW = &workList.back();\n    assert (currentW && \"Missing work object.\");\n\n    BasicBlock *currentBB = currentW->currentBB;\n    BasicBlock *parentBB = currentW->parentBB;\n    const DomTreeNode *currentNode = currentW->Node;\n    const DomTreeNode *parentNode = currentW->parentNode;\n    assert (currentBB && \"Invalid work object. Missing current Basic Block\");\n    assert (currentNode && \"Invalid work object. Missing current Node\");\n    DomSetType &S = Frontiers[currentBB];\n\n    \/\/ Visit each block only once.\n    if (visited.count(currentBB) == 0) {\n      visited.insert(currentBB);\n\n      \/\/ Loop over CFG successors to calculate DFlocal[currentNode]\n      for (succ_iterator SI = succ_begin(currentBB), SE = succ_end(currentBB);\n           SI != SE; ++SI) {\n        \/\/ Does Node immediately dominate this successor?\n        if (DT[*SI]->getIDom() != currentNode)\n          S.insert(*SI);\n      }\n    }\n\n    \/\/ At this point, S is DFlocal.  Now we union in DFup's of our children...\n    \/\/ Loop through and visit the nodes that Node immediately dominates (Node's\n    \/\/ children in the IDomTree)\n    bool visitChild = false;\n    for (DomTreeNode::const_iterator NI = currentNode->begin(), \n           NE = currentNode->end(); NI != NE; ++NI) {\n      DomTreeNode *IDominee = *NI;\n      BasicBlock *childBB = IDominee->getBlock();\n      if (visited.count(childBB) == 0) {\n        workList.push_back(DFCalculateWorkObject(childBB, currentBB,\n                                                 IDominee, currentNode));\n        visitChild = true;\n      }\n    }\n\n    \/\/ If all children are visited or there is any child then pop this block\n    \/\/ from the workList.\n    if (!visitChild) {\n\n      if (!parentBB) {\n        Result = &S;\n        break;\n      }\n\n      DomSetType::const_iterator CDFI = S.begin(), CDFE = S.end();\n      DomSetType &parentSet = Frontiers[parentBB];\n      for (; CDFI != CDFE; ++CDFI) {\n        if (!DT.properlyDominates(parentNode, DT[*CDFI]))\n          parentSet.insert(*CDFI);\n      }\n      workList.pop_back();\n    }\n\n  } while (!workList.empty());\n\n  return *Result;\n}\n\nvoid DominanceFrontierBase::print(raw_ostream &OS, const Module* ) const {\n  for (const_iterator I = begin(), E = end(); I != E; ++I) {\n    OS << \"  DomFrontier for BB \";\n    if (I->first)\n      WriteAsOperand(OS, I->first, false);\n    else\n      OS << \" <<exit node>>\";\n    OS << \" is:\\t\";\n    \n    const std::set<BasicBlock*> &BBs = I->second;\n    \n    for (std::set<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();\n         I != E; ++I) {\n      OS << ' ';\n      if (*I)\n        WriteAsOperand(OS, *I, false);\n      else\n        OS << \"<<exit node>>\";\n    }\n    OS << \"\\n\";\n  }\n}\n\nvoid DominanceFrontierBase::dump() const {\n  print(dbgs());\n}\n\n<commit_msg>Fix formatting.<commit_after>\/\/===- Dominators.cpp - Dominator Calculation -----------------------------===\/\/\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 simple dominator construction algorithms for finding\n\/\/ forward dominators.  Postdominators are available in libanalysis, but are not\n\/\/ included in libvmcore, because it's not needed.  Forward dominators are\n\/\/ needed to support the Verifier pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/ADT\/DepthFirstIterator.h\"\n#include \"llvm\/ADT\/SetOperations.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Analysis\/DominatorInternals.h\"\n#include \"llvm\/Instructions.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include <algorithm>\nusing namespace llvm;\n\n\/\/ Always verify dominfo if expensive checking is enabled.\n#ifdef XDEBUG\nstatic bool VerifyDomInfo = true;\n#else\nstatic bool VerifyDomInfo = false;\n#endif\nstatic cl::opt<bool,true>\nVerifyDomInfoX(\"verify-dom-info\", cl::location(VerifyDomInfo),\n               cl::desc(\"Verify dominator info (time consuming)\"));\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  DominatorTree Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Provide public access to DominatorTree information.  Implementation details\n\/\/ can be found in DominatorCalculation.h.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\nTEMPLATE_INSTANTIATION(class llvm::DomTreeNodeBase<BasicBlock>);\nTEMPLATE_INSTANTIATION(class llvm::DominatorTreeBase<BasicBlock>);\n\nchar DominatorTree::ID = 0;\nINITIALIZE_PASS(DominatorTree, \"domtree\",\n                \"Dominator Tree Construction\", true, true);\n\nbool DominatorTree::runOnFunction(Function &F) {\n  DT->recalculate(F);\n  return false;\n}\n\nvoid DominatorTree::verifyAnalysis() const {\n  if (!VerifyDomInfo) return;\n\n  Function &F = *getRoot()->getParent();\n\n  DominatorTree OtherDT;\n  OtherDT.getBase().recalculate(F);\n  assert(!compare(OtherDT) && \"Invalid DominatorTree info!\");\n}\n\nvoid DominatorTree::print(raw_ostream &OS, const Module *) const {\n  DT->print(OS);\n}\n\n\/\/ dominates - Return true if A dominates a use in B. This performs the\n\/\/ special checks necessary if A and B are in the same basic block.\nbool DominatorTree::dominates(const Instruction *A, const Instruction *B) const{\n  const BasicBlock *BBA = A->getParent(), *BBB = B->getParent();\n  \n  \/\/ If A is an invoke instruction, its value is only available in this normal\n  \/\/ successor block.\n  if (const InvokeInst *II = dyn_cast<InvokeInst>(A))\n    BBA = II->getNormalDest();\n  \n  if (BBA != BBB) return dominates(BBA, BBB);\n  \n  \/\/ It is not possible to determine dominance between two PHI nodes \n  \/\/ based on their ordering.\n  if (isa<PHINode>(A) && isa<PHINode>(B)) \n    return false;\n  \n  \/\/ Loop through the basic block until we find A or B.\n  BasicBlock::const_iterator I = BBA->begin();\n  for (; &*I != A && &*I != B; ++I)\n    \/*empty*\/;\n  \n  return &*I == A;\n}\n\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  DominanceFrontier Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nchar DominanceFrontier::ID = 0;\nINITIALIZE_PASS(DominanceFrontier, \"domfrontier\",\n                \"Dominance Frontier Construction\", true, true);\n\nvoid DominanceFrontier::verifyAnalysis() const {\n  if (!VerifyDomInfo) return;\n\n  DominatorTree &DT = getAnalysis<DominatorTree>();\n\n  DominanceFrontier OtherDF;\n  const std::vector<BasicBlock*> &DTRoots = DT.getRoots();\n  OtherDF.calculate(DT, DT.getNode(DTRoots[0]));\n  assert(!compare(OtherDF) && \"Invalid DominanceFrontier info!\");\n}\n\n\/\/ NewBB is split and now it has one successor. Update dominance frontier to\n\/\/ reflect this change.\nvoid DominanceFrontier::splitBlock(BasicBlock *NewBB) {\n  assert(NewBB->getTerminator()->getNumSuccessors() == 1 &&\n         \"NewBB should have a single successor!\");\n  BasicBlock *NewBBSucc = NewBB->getTerminator()->getSuccessor(0);\n\n  SmallVector<BasicBlock*, 8> PredBlocks;\n  for (pred_iterator PI = pred_begin(NewBB), PE = pred_end(NewBB);\n       PI != PE; ++PI)\n    PredBlocks.push_back(*PI);  \n\n  if (PredBlocks.empty())\n    \/\/ If NewBB does not have any predecessors then it is a entry block.\n    \/\/ In this case, NewBB and its successor NewBBSucc dominates all\n    \/\/ other blocks.\n    return;\n\n  \/\/ NewBBSucc inherits original NewBB frontier.\n  DominanceFrontier::iterator NewBBI = find(NewBB);\n  if (NewBBI != end()) {\n    DominanceFrontier::DomSetType NewBBSet = NewBBI->second;\n    DominanceFrontier::DomSetType NewBBSuccSet;\n    NewBBSuccSet.insert(NewBBSet.begin(), NewBBSet.end());\n    addBasicBlock(NewBBSucc, NewBBSuccSet);\n  }\n\n  \/\/ If NewBB dominates NewBBSucc, then DF(NewBB) is now going to be the\n  \/\/ DF(NewBBSucc) without the stuff that the new block does not dominate\n  \/\/ a predecessor of.\n  DominatorTree &DT = getAnalysis<DominatorTree>();\n  if (DT.dominates(NewBB, NewBBSucc)) {\n    DominanceFrontier::iterator DFI = find(NewBBSucc);\n    if (DFI != end()) {\n      DominanceFrontier::DomSetType Set = DFI->second;\n      \/\/ Filter out stuff in Set that we do not dominate a predecessor of.\n      for (DominanceFrontier::DomSetType::iterator SetI = Set.begin(),\n             E = Set.end(); SetI != E;) {\n        bool DominatesPred = false;\n        for (pred_iterator PI = pred_begin(*SetI), E = pred_end(*SetI);\n             PI != E; ++PI)\n          if (DT.dominates(NewBB, *PI))\n            DominatesPred = true;\n        if (!DominatesPred)\n          Set.erase(SetI++);\n        else\n          ++SetI;\n      }\n\n      if (NewBBI != end()) {\n        for (DominanceFrontier::DomSetType::iterator SetI = Set.begin(),\n               E = Set.end(); SetI != E; ++SetI) {\n          BasicBlock *SB = *SetI;\n          addToFrontier(NewBBI, SB);\n        }\n      } else \n        addBasicBlock(NewBB, Set);\n    }\n    \n  } else {\n    \/\/ DF(NewBB) is {NewBBSucc} because NewBB does not strictly dominate\n    \/\/ NewBBSucc, but it does dominate itself (and there is an edge (NewBB ->\n    \/\/ NewBBSucc)).  NewBBSucc is the single successor of NewBB.\n    DominanceFrontier::DomSetType NewDFSet;\n    NewDFSet.insert(NewBBSucc);\n    addBasicBlock(NewBB, NewDFSet);\n  }\n  \n  \/\/ Now we must loop over all of the dominance frontiers in the function,\n  \/\/ replacing occurrences of NewBBSucc with NewBB in some cases.  All\n  \/\/ blocks that dominate a block in PredBlocks and contained NewBBSucc in\n  \/\/ their dominance frontier must be updated to contain NewBB instead.\n  \/\/\n  for (Function::iterator FI = NewBB->getParent()->begin(),\n         FE = NewBB->getParent()->end(); FI != FE; ++FI) {\n    DominanceFrontier::iterator DFI = find(FI);\n    if (DFI == end()) continue;  \/\/ unreachable block.\n    \n    \/\/ Only consider nodes that have NewBBSucc in their dominator frontier.\n    if (!DFI->second.count(NewBBSucc)) continue;\n\n    \/\/ Verify whether this block dominates a block in predblocks.  If not, do\n    \/\/ not update it.\n    bool BlockDominatesAny = false;\n    for (SmallVectorImpl<BasicBlock*>::const_iterator BI = PredBlocks.begin(), \n           BE = PredBlocks.end(); BI != BE; ++BI) {\n      if (DT.dominates(FI, *BI)) {\n        BlockDominatesAny = true;\n        break;\n      }\n    }\n\n    \/\/ If NewBBSucc should not stay in our dominator frontier, remove it.\n    \/\/ We remove it unless there is a predecessor of NewBBSucc that we\n    \/\/ dominate, but we don't strictly dominate NewBBSucc.\n    bool ShouldRemove = true;\n    if ((BasicBlock*)FI == NewBBSucc || !DT.dominates(FI, NewBBSucc)) {\n      \/\/ Okay, we know that PredDom does not strictly dominate NewBBSucc.\n      \/\/ Check to see if it dominates any predecessors of NewBBSucc.\n      for (pred_iterator PI = pred_begin(NewBBSucc),\n           E = pred_end(NewBBSucc); PI != E; ++PI)\n        if (DT.dominates(FI, *PI)) {\n          ShouldRemove = false;\n          break;\n        }\n    }\n    \n    if (ShouldRemove)\n      removeFromFrontier(DFI, NewBBSucc);\n    if (BlockDominatesAny && (&*FI == NewBB || !DT.dominates(FI, NewBB)))\n      addToFrontier(DFI, NewBB);\n  }\n}\n\nnamespace {\n  class DFCalculateWorkObject {\n  public:\n    DFCalculateWorkObject(BasicBlock *B, BasicBlock *P, \n                          const DomTreeNode *N,\n                          const DomTreeNode *PN)\n    : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}\n    BasicBlock *currentBB;\n    BasicBlock *parentBB;\n    const DomTreeNode *Node;\n    const DomTreeNode *parentNode;\n  };\n}\n\nconst DominanceFrontier::DomSetType &\nDominanceFrontier::calculate(const DominatorTree &DT,\n                             const DomTreeNode *Node) {\n  BasicBlock *BB = Node->getBlock();\n  DomSetType *Result = NULL;\n\n  std::vector<DFCalculateWorkObject> workList;\n  SmallPtrSet<BasicBlock *, 32> visited;\n\n  workList.push_back(DFCalculateWorkObject(BB, NULL, Node, NULL));\n  do {\n    DFCalculateWorkObject *currentW = &workList.back();\n    assert (currentW && \"Missing work object.\");\n\n    BasicBlock *currentBB = currentW->currentBB;\n    BasicBlock *parentBB = currentW->parentBB;\n    const DomTreeNode *currentNode = currentW->Node;\n    const DomTreeNode *parentNode = currentW->parentNode;\n    assert (currentBB && \"Invalid work object. Missing current Basic Block\");\n    assert (currentNode && \"Invalid work object. Missing current Node\");\n    DomSetType &S = Frontiers[currentBB];\n\n    \/\/ Visit each block only once.\n    if (visited.count(currentBB) == 0) {\n      visited.insert(currentBB);\n\n      \/\/ Loop over CFG successors to calculate DFlocal[currentNode]\n      for (succ_iterator SI = succ_begin(currentBB), SE = succ_end(currentBB);\n           SI != SE; ++SI) {\n        \/\/ Does Node immediately dominate this successor?\n        if (DT[*SI]->getIDom() != currentNode)\n          S.insert(*SI);\n      }\n    }\n\n    \/\/ At this point, S is DFlocal.  Now we union in DFup's of our children...\n    \/\/ Loop through and visit the nodes that Node immediately dominates (Node's\n    \/\/ children in the IDomTree)\n    bool visitChild = false;\n    for (DomTreeNode::const_iterator NI = currentNode->begin(), \n           NE = currentNode->end(); NI != NE; ++NI) {\n      DomTreeNode *IDominee = *NI;\n      BasicBlock *childBB = IDominee->getBlock();\n      if (visited.count(childBB) == 0) {\n        workList.push_back(DFCalculateWorkObject(childBB, currentBB,\n                                                 IDominee, currentNode));\n        visitChild = true;\n      }\n    }\n\n    \/\/ If all children are visited or there is any child then pop this block\n    \/\/ from the workList.\n    if (!visitChild) {\n\n      if (!parentBB) {\n        Result = &S;\n        break;\n      }\n\n      DomSetType::const_iterator CDFI = S.begin(), CDFE = S.end();\n      DomSetType &parentSet = Frontiers[parentBB];\n      for (; CDFI != CDFE; ++CDFI) {\n        if (!DT.properlyDominates(parentNode, DT[*CDFI]))\n          parentSet.insert(*CDFI);\n      }\n      workList.pop_back();\n    }\n\n  } while (!workList.empty());\n\n  return *Result;\n}\n\nvoid DominanceFrontierBase::print(raw_ostream &OS, const Module* ) const {\n  for (const_iterator I = begin(), E = end(); I != E; ++I) {\n    OS << \"  DomFrontier for BB \";\n    if (I->first)\n      WriteAsOperand(OS, I->first, false);\n    else\n      OS << \" <<exit node>>\";\n    OS << \" is:\\t\";\n    \n    const std::set<BasicBlock*> &BBs = I->second;\n    \n    for (std::set<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();\n         I != E; ++I) {\n      OS << ' ';\n      if (*I)\n        WriteAsOperand(OS, *I, false);\n      else\n        OS << \"<<exit node>>\";\n    }\n    OS << \"\\n\";\n  }\n}\n\nvoid DominanceFrontierBase::dump() const {\n  print(dbgs());\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*-------------------------------------------------------------------------\n*\n* tile_test.cpp\n* file description\n*\n* Copyright(c) 2015, CMU\n*\n* \/n-store\/test\/tile_test.cpp\n*\n*-------------------------------------------------------------------------\n*\/\n\n#include \"gtest\/gtest.h\"\n\n#include \"backend\/storage\/tile.h\"\n#include \"backend\/storage\/tile_group.h\"\n#include \"backend\/storage\/tile_iterator.h\"\n\nnamespace peloton {\nnamespace test {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Tile Tests\n\/\/===--------------------------------------------------------------------===\/\/\n\nTEST(TileTests, BasicTest) {\n\n\tstd::vector<catalog::ColumnInfo> columns;\n\n\tcatalog::ColumnInfo column1(VALUE_TYPE_INTEGER, GetTypeSize(VALUE_TYPE_INTEGER), \"A\", true);\n\tcatalog::ColumnInfo column2(VALUE_TYPE_INTEGER, GetTypeSize(VALUE_TYPE_INTEGER), \"B\", true);\n\tcatalog::ColumnInfo column3(VALUE_TYPE_TINYINT, GetTypeSize(VALUE_TYPE_TINYINT), \"C\", true);\n\tcatalog::ColumnInfo column4(VALUE_TYPE_VARCHAR, 25, \"D\", false);\n\tcatalog::ColumnInfo column5(VALUE_TYPE_VARCHAR, 25, \"E\", false);\n\n\tcolumns.push_back(column1);\n\tcolumns.push_back(column2);\n\tcolumns.push_back(column3);\n\tcolumns.push_back(column4);\n\tcolumns.push_back(column4);\n\n\tcatalog::Schema *schema = new catalog::Schema(columns);\n\n\tstd::vector<std::string> column_names;\n\n\tcolumn_names.push_back(\"COL 1\");\n\tcolumn_names.push_back(\"COL 2\");\n\tcolumn_names.push_back(\"COL 3\");\n\tcolumn_names.push_back(\"COL 4\");\n\tcolumn_names.push_back(\"COL 5\");\n\n\tconst int tuple_count = 6;\n\n\tstorage::AbstractBackend *backend = new storage::VMBackend();\n\tstorage::TileGroupHeader *header = new storage::TileGroupHeader(backend, tuple_count);\n\n\tstorage::Tile *tile = storage::TileFactory::GetTile(INVALID_OID, INVALID_OID, INVALID_OID, INVALID_OID,\n\t\t\t\t\t\t\t\t\t\t\t\t\t  \t  header, backend, *schema, nullptr, tuple_count);\n\n\n\t\/\/std::cout << \"tile size: \" << tile->GetInlinedSize() << std::endl;\n\t\/\/std::cout << \"allocated tuple count: \" << tile->GetAllocatedTupleCount() << std::endl;\n\n\n\tstorage::Tuple *tuple1 = new storage::Tuple(schema, true);\n\tstorage::Tuple *tuple2 = new storage::Tuple(schema, true);\n\tstorage::Tuple *tuple3 = new storage::Tuple(schema, true);\n\n\ttuple1->SetValue(0, ValueFactory::GetIntegerValue(1));\n\ttuple1->SetValue(1, ValueFactory::GetIntegerValue(1));\n\ttuple1->SetValue(2, ValueFactory::GetTinyIntValue(1));\n\ttuple1->SetValue(3, ValueFactory::GetStringValue(\"vivek sengupta\", tile->GetPool()));\n\ttuple1->SetValue(4, ValueFactory::GetStringValue(\"vivek sengupta again\", tile->GetPool()));\n\n\ttuple2->SetValue(0, ValueFactory::GetIntegerValue(2));\n\ttuple2->SetValue(1, ValueFactory::GetIntegerValue(2));\n\ttuple2->SetValue(2, ValueFactory::GetTinyIntValue(2));\n\ttuple2->SetValue(3, ValueFactory::GetStringValue(\"ming fang\", tile->GetPool()));\n\ttuple2->SetValue(4, ValueFactory::GetStringValue(\"ming fang again\", tile->GetPool()));\n\n\ttuple3->SetValue(0, ValueFactory::GetIntegerValue(3));\n\ttuple3->SetValue(1, ValueFactory::GetIntegerValue(3));\n\ttuple3->SetValue(2, ValueFactory::GetTinyIntValue(3));\n\ttuple3->SetValue(3, ValueFactory::GetStringValue(\"jinwoong kim\", tile->GetPool()));\n\ttuple3->SetValue(4, ValueFactory::GetStringValue(\"jinwoong kim again\", tile->GetPool()));\n\n\ttile->InsertTuple(0, tuple1);\n\ttile->InsertTuple(1, tuple2);\n\ttile->InsertTuple(2, tuple3);\n\n\t\/\/std::cout << (*tile);\n\n\t\/\/tile->InsertTuple(2, tuple1);\n\n\t\/\/std::cout << (*tile);\n\n\n\t\/*\n\t * Print details of old tile\n\t *\/\n\n\tconst catalog::Schema *old_schema;\n\tbool old_tile_is_inlined;\n\tuint16_t old_tile_allocated_tuple_count, old_tile_active_tuple_count;\n\tuint32_t old_tile_size;\n\tuint32_t old_tile_tuple_size;\n\n\n\tstd::cout << \"-------------------\" << std::endl;\n\tstd::cout << \"Details of old tile\" << std::endl;\n\tstd::cout << \"-------------------\" << std::endl;\n\n\tstd::cout << \"base address of old tile: \" << static_cast<void *>(tile) << std::endl;\n\n\told_tile_size = tile->GetInlinedSize();\n\tstd::cout << \"old tile size: \" << old_tile_size << std:: endl;\n\n\told_tile_allocated_tuple_count = tile->GetAllocatedTupleCount();\n\tstd::cout << \"old tile allocated tuple count: \" << old_tile_allocated_tuple_count << std:: endl;\n\n\told_tile_active_tuple_count = tile->GetActiveTupleCount();\n\tstd::cout << \"old tile active tuple count: \" << old_tile_active_tuple_count << std:: endl;\n\told_tile_active_tuple_count = 3;\n\n\told_tile_tuple_size = old_tile_size \/ old_tile_allocated_tuple_count;\n\tstd::cout << \"size of each tuple in old tile: \" << old_tile_tuple_size << std::endl;\n\n\told_schema = tile->GetSchema();\n\told_tile_is_inlined = old_schema->IsInlined();\n\tstd::cout << \"Is the entire old tile inlined? \" << (old_tile_is_inlined? \"true\" : \"false\") << std::endl;\n\n\tPool *old_pool = tile->GetPool();\n\tstd::cout << \"Pool associated with old tile is at address: \" << static_cast<void *>(old_pool) << std::endl;\n\n\tint64_t old_pool_size = old_pool->GetAllocatedMemory();\n\tstd::cout << \"size of old pool: \" << old_pool_size << std::endl;\n\n\n\t\/*\n\t * Create a new tile from the old tile\n\t *\/\n\tstd::vector<catalog::ColumnInfo> new_columns = old_schema->GetColumns();\n\tconst catalog::Schema *new_schema = new catalog::Schema(columns);\n\n\tstorage::AbstractBackend *new_backend = new storage::VMBackend();\n\tstorage::TileGroupHeader *new_header = new storage::TileGroupHeader(new_backend, tuple_count);\n\tstorage::Tile *new_tile = storage::TileFactory::GetTile(INVALID_OID, INVALID_OID, INVALID_OID, INVALID_OID,\n\t\t\t\t\t\t\t\t\t\t\t  new_header, new_backend, *new_schema, nullptr, old_tile_allocated_tuple_count);\n\tPool *new_pool = new_tile->GetPool();\n\n\t\/\/::memcpy(new_pool,old_pool,old_pool_size);\n\t\/\/::memcpy(static_cast<void *>(new_tile), static_cast<void *>(tile), old_tile_size);\n\n\tstorage::Tuple *old_tuple;\n\n\tfor(int old_tup_itr=0; old_tup_itr<old_tile_active_tuple_count; old_tup_itr++)\n\t{\n\t\told_tuple = tile->GetTuple(old_tup_itr);\n\t\tnew_tile->InsertTuple(old_tup_itr,old_tuple);\n\t}\n\n\n\n\t\/*\n\t * Print details of new tile\n\t *\/\n\n\n\tbool new_tile_is_inlined;\n\tuint16_t new_tile_allocated_tuple_count, new_tile_active_tuple_count;\n\tuint32_t new_tile_size;\n\tuint32_t new_tile_tuple_size;\n\n\n\tstd::cout << \"-------------------\" << std::endl;\n\tstd::cout << \"Details of new tile\" << std::endl;\n\tstd::cout << \"-------------------\" << std::endl;\n\n\tstd::cout << \"base address of new tile: \" << static_cast<void *>(new_tile) << std::endl;\n\n\tnew_tile_size = new_tile->GetInlinedSize();\n\tstd::cout << \"new tile size: \" << new_tile_size << std:: endl;\n\n\tnew_tile_allocated_tuple_count = tile->GetAllocatedTupleCount();\n\tstd::cout << \"new tile allocated tuple count: \" << new_tile_allocated_tuple_count << std:: endl;\n\n\tnew_tile_active_tuple_count = tile->GetActiveTupleCount();\n\tstd::cout << \"new tile active tuple count: \" << new_tile_active_tuple_count << std:: endl;\n\tnew_tile_active_tuple_count = 3;\n\n\tnew_tile_tuple_size = new_tile_size \/ new_tile_allocated_tuple_count;\n\tstd::cout << \"size of each tuple in new tile: \" << new_tile_tuple_size << std::endl;\n\n\tnew_schema = new_tile->GetSchema();\n\tnew_tile_is_inlined = new_schema->IsInlined();\n\tstd::cout << \"Is the entire new tile inlined? \" << (new_tile_is_inlined? \"true\" : \"false\") << std::endl;\n\n\tstd::cout << \"Pool associated with new tile is at address: \" << static_cast<void *>(new_pool) << std::endl;\n\n\tint64_t new_pool_size = new_pool->GetAllocatedMemory();\n\tstd::cout << \"size of new pool: \" << new_pool_size << std::endl;\n\n\tstd::cout << \"------------------------------------\" << std:: endl;\n\tstd::cout << \"In case some columns are not inlined\" << std:: endl;\n\tstd::cout << \"------------------------------------\" << std:: endl;\n\n\t\/\/std::cout << (*new_tile);\n\n\t\/*\n\t * Iterate over the tile and print the tuples\n\t *\/\n\t\/\/storage::TileIterator tile_itr(new_tile);\n\t\/\/storage::Tuple *new_tuple = new storage::Tuple(old_schema, true);\n\t\/\/storage::Tuple& new_tuple_ref = *new_tuple;\n\n\/*\n\twhile(tile_itr.Next(new_tuple_ref) == true)\n\t{\n\t\tstd::cout << (new_tuple_ref);\n\t\ttile_itr++;\n\t}\n*\/\n\n\n\n\tif(!new_tile_is_inlined)\n\t{\n\t\t\/\/int col_cnt = old_schema->GetColumnCount();\n\t\t\/\/std::cout << \"total column count: \" << col_cnt << std::endl;\n\n\t\tint uninlined_col_cnt = new_schema->GetUninlinedColumnCount();\n\t\t\/\/std::cout << \"uninlined column count: \" << uninlined_col_cnt << std::endl;\n\n\t\tint uninlined_col_index;\n\t\tValue uninlined_col_value, new_uninlined_col_value;\n\t\tstorage::Tuple *new_tuple;\n\n\t\tfor(int col_itr=0; col_itr<uninlined_col_cnt; col_itr++) {\n\n\t\t\tuninlined_col_index = new_schema->GetUninlinedColumnIndex(col_itr);\n\t\t\tstd::cout << \"----------------------------------\" << std::endl;\n\t\t\tstd::cout << \"index of next uninlined column: \" << uninlined_col_index << std::endl;\n\t\t\tstd::cout << \"----------------------------------\" << std::endl  << std::endl;\n\n\t\t\tfor(int tup_itr=0; tup_itr<new_tile_active_tuple_count; tup_itr++) {\n\n\t\t\t\tstd::cout << \"\\t -----------------------------------------------------\" + tup_itr << std::endl;\n\t\t\t\tstd::cout << \"\\t Before associating new pool to new data for tuple: \" + tup_itr << std::endl;\n\t\t\t\tstd::cout << \"\\t -----------------------------------------------------\" + tup_itr << std::endl;\n\n\t\t\t\tnew_tuple = new_tile->GetTuple(tup_itr);\n\t\t\t\tstd::cout << \"\\t address of new_tuple: \" << static_cast<void *>(new_tuple) << std::endl << std::endl;\n\n\t\t\t\tuninlined_col_value = new_tile->GetValue(tup_itr,uninlined_col_index);\n\t\t\t\tstd::cout << \"\\t uninlined column value: \" << uninlined_col_value << std::endl;\n\n\t\t\t\tsize_t uninlined_col_object_len = ValuePeeker::PeekObjectLength(uninlined_col_value);\n\t\t\t\tstd::cout << \"\\t size of uninlined column object: \" << uninlined_col_object_len << std::endl;\n\n\t\t\t\tunsigned char* uninlined_col_object_ptr = static_cast<unsigned char *>(ValuePeeker::PeekObjectValue(uninlined_col_value));\n\t\t\t\tstd::cout << \"\\t uninlined column object pointer: \" << static_cast<void *>(uninlined_col_object_ptr) << std::endl;\n\n\t\t\t\tstd::string uninlined_varchar_str(reinterpret_cast<char const*>(uninlined_col_object_ptr), uninlined_col_object_len);\n\t\t\t\tstd::cout << \"\\t the data stored uninlined is: \" << uninlined_varchar_str << std::endl << std::endl;\n\n\t\t\t\t\/\/char *xyz = new_tuple->GetData();\n\t\t\t\t\/\/tile->GetValue(tup_itr,next_uninlined_col_index);\n\n\t\t\t\t\/\/ std::string copy_uninlined_varchar_str;\n\t\t\t\t\/\/ Create a new Value object with the uninlined string w.r.t. the new pool\n\t\t\t\tValue new_val = ValueFactory::GetStringValue(uninlined_varchar_str, new_pool);\n\t\t\t\t\/\/ Set the newly created value object to the tuple\n\t\t\t\t\/\/ new_tuple->SetValue(uninlined_col_index, uninlined_col_value);\n\t\t\t\tnew_tile->SetValue(new_val, tup_itr, uninlined_col_index);\n\n\n\t\t\t\tstd::cout << \"\\t ---------------------------------------------\" + tup_itr << std::endl;\n\t\t\t\tstd::cout << \"\\t Associated new pool to new data for tuple: \" + tup_itr << std::endl;\n\t\t\t\tstd::cout << \"\\t ---------------------------------------------\" + tup_itr << std::endl;\n\n\t\t\t\tnew_uninlined_col_value = new_tile->GetValue(tup_itr,uninlined_col_index);\n\t\t\t\tstd::cout << \"\\t new uninlined column value: \" << new_uninlined_col_value << std::endl;\n\n\t\t\t\tsize_t new_uninlined_col_object_len = ValuePeeker::PeekObjectLength(new_uninlined_col_value);\n\t\t\t\tstd::cout << \"\\t size of uninlined column object: \" << new_uninlined_col_object_len << std::endl;\n\n\t\t\t\tunsigned char* new_uninlined_col_object_ptr = static_cast<unsigned char *>(ValuePeeker::PeekObjectValue(new_uninlined_col_value));\n\t\t\t\tstd::cout << \"\\t new uninlined column object pointer: \" << static_cast<void *>(new_uninlined_col_object_ptr) << std::endl;\n\n\t\t\t\tstd::string new_uninlined_varchar_str( reinterpret_cast<char const*>(new_uninlined_col_object_ptr), uninlined_col_object_len);\n\t\t\t\tstd::cout << \"\\t the new data stored uninlined is: \" << new_uninlined_varchar_str << std::endl << std::endl;\n\t\t\t}\n\t\t}\n\n\t\tdelete new_tuple;\n\t}\n\n\tif(tile==new_tile)\n\t\t\tstd::cout << \"old and new tiles are the same ...\" << std::endl;\n\n\tstd::string str1 = \"hello world\";\n\tstd::string str2 = str1;\n\n\tstd::cout << \"add of str1: \" << &str1 << std::endl;\n\tstd::cout << \"add of str2: \" << &str2 << std::endl;\n\n\n\n\n\tdelete tuple1;\n\tdelete tuple2;\n\tdelete tuple3;\n\tdelete tile;\n\tdelete header;\n\tdelete schema;\n\tdelete backend;\n}\n\n} \/\/ End test namespace\n} \/\/ End peloton namespace\n\n\n<commit_msg>minor cleanup<commit_after>\/*-------------------------------------------------------------------------\n*\n* tile_test.cpp\n* file description\n*\n* Copyright(c) 2015, CMU\n*\n* \/n-store\/test\/tile_test.cpp\n*\n*-------------------------------------------------------------------------\n*\/\n\n#include \"gtest\/gtest.h\"\n\n#include \"backend\/storage\/tile.h\"\n#include \"backend\/storage\/tile_group.h\"\n#include \"backend\/storage\/tile_iterator.h\"\n\nnamespace peloton {\nnamespace test {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Tile Tests\n\/\/===--------------------------------------------------------------------===\/\/\n\nTEST(TileTests, BasicTest) {\n\n\tstd::vector<catalog::ColumnInfo> columns;\n\n\tcatalog::ColumnInfo column1(VALUE_TYPE_INTEGER, GetTypeSize(VALUE_TYPE_INTEGER), \"A\", true);\n\tcatalog::ColumnInfo column2(VALUE_TYPE_INTEGER, GetTypeSize(VALUE_TYPE_INTEGER), \"B\", true);\n\tcatalog::ColumnInfo column3(VALUE_TYPE_TINYINT, GetTypeSize(VALUE_TYPE_TINYINT), \"C\", true);\n\tcatalog::ColumnInfo column4(VALUE_TYPE_VARCHAR, 25, \"D\", false);\n\tcatalog::ColumnInfo column5(VALUE_TYPE_VARCHAR, 25, \"E\", false);\n\n\tcolumns.push_back(column1);\n\tcolumns.push_back(column2);\n\tcolumns.push_back(column3);\n\tcolumns.push_back(column4);\n\tcolumns.push_back(column4);\n\n\tcatalog::Schema *schema = new catalog::Schema(columns);\n\n\tstd::vector<std::string> column_names;\n\n\tcolumn_names.push_back(\"COL 1\");\n\tcolumn_names.push_back(\"COL 2\");\n\tcolumn_names.push_back(\"COL 3\");\n\tcolumn_names.push_back(\"COL 4\");\n\tcolumn_names.push_back(\"COL 5\");\n\n\tconst int tuple_count = 6;\n\n\tstorage::AbstractBackend *backend = new storage::VMBackend();\n\tstorage::TileGroupHeader *header = new storage::TileGroupHeader(backend, tuple_count);\n\n\tstorage::Tile *tile = storage::TileFactory::GetTile(INVALID_OID, INVALID_OID, INVALID_OID, INVALID_OID,\n\t\t\t\t\t\t\t\t\t\t\t\t\t  \t  header, backend, *schema, nullptr, tuple_count);\n\n\n\tstorage::Tuple *tuple1 = new storage::Tuple(schema, true);\n\tstorage::Tuple *tuple2 = new storage::Tuple(schema, true);\n\tstorage::Tuple *tuple3 = new storage::Tuple(schema, true);\n\n\ttuple1->SetValue(0, ValueFactory::GetIntegerValue(1));\n\ttuple1->SetValue(1, ValueFactory::GetIntegerValue(1));\n\ttuple1->SetValue(2, ValueFactory::GetTinyIntValue(1));\n\ttuple1->SetValue(3, ValueFactory::GetStringValue(\"vivek sengupta\", tile->GetPool()));\n\ttuple1->SetValue(4, ValueFactory::GetStringValue(\"vivek sengupta again\", tile->GetPool()));\n\n\ttuple2->SetValue(0, ValueFactory::GetIntegerValue(2));\n\ttuple2->SetValue(1, ValueFactory::GetIntegerValue(2));\n\ttuple2->SetValue(2, ValueFactory::GetTinyIntValue(2));\n\ttuple2->SetValue(3, ValueFactory::GetStringValue(\"ming fang\", tile->GetPool()));\n\ttuple2->SetValue(4, ValueFactory::GetStringValue(\"ming fang again\", tile->GetPool()));\n\n\ttuple3->SetValue(0, ValueFactory::GetIntegerValue(3));\n\ttuple3->SetValue(1, ValueFactory::GetIntegerValue(3));\n\ttuple3->SetValue(2, ValueFactory::GetTinyIntValue(3));\n\ttuple3->SetValue(3, ValueFactory::GetStringValue(\"jinwoong kim\", tile->GetPool()));\n\ttuple3->SetValue(4, ValueFactory::GetStringValue(\"jinwoong kim again\", tile->GetPool()));\n\n\ttile->InsertTuple(0, tuple1);\n\ttile->InsertTuple(1, tuple2);\n\ttile->InsertTuple(2, tuple3);\n\n\t\/\/std::cout << (*tile);\n\n\t\/\/tile->InsertTuple(2, tuple1);\n\n\t\/\/std::cout << (*tile);\n\n\n\t\/*\n\t * Print details of old tile\n\t *\/\n\tconst catalog::Schema *old_schema;\n\tbool old_tile_is_inlined;\n\tuint16_t old_tile_allocated_tuple_count, old_tile_active_tuple_count;\n\tuint32_t old_tile_size;\n\tuint32_t old_tile_tuple_size;\n\n\n\tstd::cout << \"-------------------\" << std::endl;\n\tstd::cout << \"Details of old tile\" << std::endl;\n\tstd::cout << \"-------------------\" << std::endl;\n\n\tstd::cout << \"base address of old tile: \" << static_cast<void *>(tile) << std::endl;\n\n\told_tile_size = tile->GetInlinedSize();\n\tstd::cout << \"old tile size: \" << old_tile_size << std:: endl;\n\n\told_tile_allocated_tuple_count = tile->GetAllocatedTupleCount();\n\tstd::cout << \"old tile allocated tuple count: \" << old_tile_allocated_tuple_count << std:: endl;\n\n\told_tile_active_tuple_count = tile->GetActiveTupleCount();\n\tstd::cout << \"old tile active tuple count: \" << old_tile_active_tuple_count << std:: endl;\n\told_tile_active_tuple_count = 3;\n\n\told_tile_tuple_size = old_tile_size \/ old_tile_allocated_tuple_count;\n\tstd::cout << \"size of each tuple in old tile: \" << old_tile_tuple_size << std::endl;\n\n\told_schema = tile->GetSchema();\n\told_tile_is_inlined = old_schema->IsInlined();\n\tstd::cout << \"Is the entire old tile inlined? \" << (old_tile_is_inlined? \"true\" : \"false\") << std::endl;\n\n\tPool *old_pool = tile->GetPool();\n\tstd::cout << \"Pool associated with old tile is at address: \" << static_cast<void *>(old_pool) << std::endl;\n\n\tint64_t old_pool_size = old_pool->GetAllocatedMemory();\n\tstd::cout << \"size of old pool: \" << old_pool_size << std::endl;\n\n\n\t\/*\n\t * Create a new tile from the old tile\n\t *\/\n\tstd::vector<catalog::ColumnInfo> new_columns = old_schema->GetColumns();\n\tconst catalog::Schema *new_schema = new catalog::Schema(columns);\n\n\tstorage::AbstractBackend *new_backend = new storage::VMBackend();\n\tstorage::TileGroupHeader *new_header = new storage::TileGroupHeader(new_backend, tuple_count);\n\tstorage::Tile *new_tile = storage::TileFactory::GetTile(INVALID_OID, INVALID_OID, INVALID_OID, INVALID_OID,\n\t\t\t\t\t\t\t\t\t\t\t  new_header, new_backend, *new_schema, nullptr, old_tile_allocated_tuple_count);\n\tPool *new_pool = new_tile->GetPool();\n\n\tstorage::Tuple *old_tuple;\n\n\tfor(int old_tup_itr=0; old_tup_itr<old_tile_active_tuple_count; old_tup_itr++)\n\t{\n\t\told_tuple = tile->GetTuple(old_tup_itr);\n\t\tnew_tile->InsertTuple(old_tup_itr,old_tuple);\n\t}\n\n\n\n\t\/*\n\t * Print details of new tile\n\t *\/\n\tbool new_tile_is_inlined;\n\tuint16_t new_tile_allocated_tuple_count, new_tile_active_tuple_count;\n\tuint32_t new_tile_size;\n\tuint32_t new_tile_tuple_size;\n\n\n\tstd::cout << \"-------------------\" << std::endl;\n\tstd::cout << \"Details of new tile\" << std::endl;\n\tstd::cout << \"-------------------\" << std::endl;\n\n\tstd::cout << \"base address of new tile: \" << static_cast<void *>(new_tile) << std::endl;\n\n\tnew_tile_size = new_tile->GetInlinedSize();\n\tstd::cout << \"new tile size: \" << new_tile_size << std:: endl;\n\n\tnew_tile_allocated_tuple_count = tile->GetAllocatedTupleCount();\n\tstd::cout << \"new tile allocated tuple count: \" << new_tile_allocated_tuple_count << std:: endl;\n\n\tnew_tile_active_tuple_count = tile->GetActiveTupleCount();\n\tstd::cout << \"new tile active tuple count: \" << new_tile_active_tuple_count << std:: endl;\n\tnew_tile_active_tuple_count = 3;\n\n\tnew_tile_tuple_size = new_tile_size \/ new_tile_allocated_tuple_count;\n\tstd::cout << \"size of each tuple in new tile: \" << new_tile_tuple_size << std::endl;\n\n\tnew_schema = new_tile->GetSchema();\n\tnew_tile_is_inlined = new_schema->IsInlined();\n\tstd::cout << \"Is the entire new tile inlined? \" << (new_tile_is_inlined? \"true\" : \"false\") << std::endl;\n\n\tstd::cout << \"Pool associated with new tile is at address: \" << static_cast<void *>(new_pool) << std::endl;\n\n\tint64_t new_pool_size = new_pool->GetAllocatedMemory();\n\tstd::cout << \"size of new pool: \" << new_pool_size << std::endl;\n\n\tstd::cout << \"------------------------------------\" << std:: endl;\n\tstd::cout << \"In case some columns are not inlined\" << std:: endl;\n\tstd::cout << \"------------------------------------\" << std:: endl;\n\n\n\tif(!new_tile_is_inlined)\n\t{\n\t\tint uninlined_col_cnt = new_schema->GetUninlinedColumnCount();\n\n\t\tint uninlined_col_index;\n\t\tValue uninlined_col_value, new_uninlined_col_value;\n\t\tstorage::Tuple *new_tuple;\n\n\t\tfor(int col_itr=0; col_itr<uninlined_col_cnt; col_itr++) {\n\n\t\t\tuninlined_col_index = new_schema->GetUninlinedColumnIndex(col_itr);\n\t\t\tstd::cout << \" ----------------------------------\" << std::endl;\n\t\t\tstd::cout << \" index of next uninlined column: \" << uninlined_col_index << std::endl;\n\t\t\tstd::cout << \" ----------------------------------\" << std::endl << std::endl;\n\n\t\t\tfor(int tup_itr=0; tup_itr<new_tile_active_tuple_count; tup_itr++) {\n\n\t\t\t\tstd::cout << \"\\t -----------------------------------------------------\" << std::endl;\n\t\t\t\tstd::cout << \"\\t Before associating new pool to new data for tuple: \" << tup_itr << std::endl;\n\t\t\t\tstd::cout << \"\\t -----------------------------------------------------\" << std::endl;\n\n\t\t\t\tnew_tuple = new_tile->GetTuple(tup_itr);\n\t\t\t\tstd::cout << \"\\t address of new_tuple: \" << static_cast<void *>(new_tuple) << std::endl << std::endl;\n\n\t\t\t\tuninlined_col_value = new_tile->GetValue(tup_itr,uninlined_col_index);\n\t\t\t\tstd::cout << \"\\t uninlined column value: \" << uninlined_col_value << std::endl;\n\n\t\t\t\tsize_t uninlined_col_object_len = ValuePeeker::PeekObjectLength(uninlined_col_value);\n\t\t\t\tstd::cout << \"\\t size of uninlined column object: \" << uninlined_col_object_len << std::endl;\n\n\t\t\t\tunsigned char* uninlined_col_object_ptr = static_cast<unsigned char *>(ValuePeeker::PeekObjectValue(uninlined_col_value));\n\t\t\t\tstd::cout << \"\\t uninlined column object pointer: \" << static_cast<void *>(uninlined_col_object_ptr) << std::endl;\n\n\t\t\t\tstd::string uninlined_varchar_str(reinterpret_cast<char const*>(uninlined_col_object_ptr), uninlined_col_object_len);\n\t\t\t\tstd::cout << \"\\t the data stored uninlined is: \" << uninlined_varchar_str << std::endl << std::endl;\n\n\n\t\t\t\t\/\/ Create a new Value object with the uninlined string w.r.t. the new pool\n\t\t\t\tValue new_val = ValueFactory::GetStringValue(uninlined_varchar_str, new_pool);\n\t\t\t\t\/\/ Set the newly created value object to the tuple\n\t\t\t\tnew_tile->SetValue(new_val, tup_itr, uninlined_col_index);\n\n\n\t\t\t\tstd::cout << \"\\t ---------------------------------------------\" << std::endl;\n\t\t\t\tstd::cout << \"\\t Associated new pool to new data for tuple: \" << tup_itr << std::endl;\n\t\t\t\tstd::cout << \"\\t ---------------------------------------------\" << std::endl;\n\n\t\t\t\tnew_uninlined_col_value = new_tile->GetValue(tup_itr,uninlined_col_index);\n\t\t\t\tstd::cout << \"\\t new uninlined column value: \" << new_uninlined_col_value << std::endl;\n\n\t\t\t\tsize_t new_uninlined_col_object_len = ValuePeeker::PeekObjectLength(new_uninlined_col_value);\n\t\t\t\tstd::cout << \"\\t size of uninlined column object: \" << new_uninlined_col_object_len << std::endl;\n\n\t\t\t\tunsigned char* new_uninlined_col_object_ptr = static_cast<unsigned char *>(ValuePeeker::PeekObjectValue(new_uninlined_col_value));\n\t\t\t\tstd::cout << \"\\t new uninlined column object pointer: \" << static_cast<void *>(new_uninlined_col_object_ptr) << std::endl;\n\n\t\t\t\tstd::string new_uninlined_varchar_str( reinterpret_cast<char const*>(new_uninlined_col_object_ptr), uninlined_col_object_len);\n\t\t\t\tstd::cout << \"\\t the new data stored uninlined is: \" << new_uninlined_varchar_str << std::endl << std::endl;\n\t\t\t}\n\t\t}\n\n\t\tdelete new_tuple;\n\t}\n\n\n\tdelete tuple1;\n\tdelete tuple2;\n\tdelete tuple3;\n\tdelete tile;\n\tdelete header;\n\tdelete schema;\n\tdelete backend;\n}\n\n} \/\/ End test namespace\n} \/\/ End peloton namespace\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"stringify.h\"\n\nnamespace mahjong {\n\nstatic long parse_tiles_impl(const char *str, tile_t *tiles, long max_cnt, long *out_tile_cnt) {\n    \/\/if (strspn(str, \"123456789mpsESWNCFP\") != strlen(str)) {\n    \/\/    return PARSE_ERROR_ILLEGAL_CHARACTER;\n    \/\/}\n\n    long tile_cnt = 0;\n\n#define SET_SUIT_FOR_NUMBERED(value_)       \\\n    for (long i = tile_cnt; i > 0;) {       \\\n        if (tiles[--i] & 0xF0) break;       \\\n        tiles[i] |= value_;                 \\\n        } (void)0\n\n    const char *p = str;\n    for (; tile_cnt < max_cnt && *p != '\\0'; ++p) {\n        char c = *p;\n        switch (c) {\n        case '1': tiles[tile_cnt++] = 1; break;\n        case '2': tiles[tile_cnt++] = 2; break;\n        case '3': tiles[tile_cnt++] = 3; break;\n        case '4': tiles[tile_cnt++] = 4; break;\n        case '5': tiles[tile_cnt++] = 5; break;\n        case '6': tiles[tile_cnt++] = 6; break;\n        case '7': tiles[tile_cnt++] = 7; break;\n        case '8': tiles[tile_cnt++] = 8; break;\n        case '9': tiles[tile_cnt++] = 9; break;\n        case 'm': SET_SUIT_FOR_NUMBERED(0x10); break;\n        case 's': SET_SUIT_FOR_NUMBERED(0x20); break;\n        case 'p': SET_SUIT_FOR_NUMBERED(0x30); break;\n        case 'E': tiles[tile_cnt++] = TILE_E; break;\n        case 'S': tiles[tile_cnt++] = TILE_S; break;\n        case 'W': tiles[tile_cnt++] = TILE_W; break;\n        case 'N': tiles[tile_cnt++] = TILE_N; break;\n        case 'C': tiles[tile_cnt++] = TILE_C; break;\n        case 'F': tiles[tile_cnt++] = TILE_F; break;\n        case 'P': tiles[tile_cnt++] = TILE_P; break;\n        default: goto parse_finish;\n        }\n    }\n\nparse_finish:\n    if (tile_cnt > 0 && !(tiles[tile_cnt - 1] & 0xF0)) {\n        bool hasSuffix = false;\n        for (; !hasSuffix && *p != '\\0'; ++p) {\n            char c = *p;\n            switch (c) {\n            case 'm': SET_SUIT_FOR_NUMBERED(0x10); hasSuffix = true; break;\n            case 's': SET_SUIT_FOR_NUMBERED(0x20); hasSuffix = true; break;\n            case 'p': SET_SUIT_FOR_NUMBERED(0x30); hasSuffix = true; break;\n            default: break;\n            }\n        }\n\n        if (!hasSuffix) {\n            return PARSE_ERROR_NO_SUFFIX_AFTER_DIGIT;\n        }\n    }\n\n#undef SET_SUIT_FOR_NUMBERED\n\n    if (out_tile_cnt != nullptr) {\n        *out_tile_cnt = tile_cnt;\n    }\n    return (p - str);\n}\n\nlong parse_tiles(const char *str, tile_t *tiles, long max_cnt) {\n    long tile_cnt;\n    if (parse_tiles_impl(str, tiles, max_cnt, &tile_cnt) > 0) {\n        return tile_cnt;\n    }\n    return 0;\n}\n\nstatic long make_fixed_pack(const tile_t *tiles, long tile_cnt, pack_t *pack) {\n    if (tile_cnt > 0) {\n        if (tile_cnt != 3 && tile_cnt != 4) {\n            return PARSE_ERROR_TOO_MANY_TILES_FOR_FIXED_SET;\n        }\n        if (tile_cnt == 3) {\n            if (tiles[0] == tiles[1] && tiles[1] == tiles[2]) {\n                *pack = make_pack(true, PACK_TYPE_PUNG, tiles[0]);\n            }\n            else {\n                tile_t temp[3] = { tiles[0], tiles[1], tiles[2] };\n                std::sort(std::begin(temp), std::end(temp));\n                if (temp[0] + 1 == temp[1] && temp[1] + 1 == temp[2]) {\n                    *pack = make_pack(true, PACK_TYPE_CHOW, temp[1]);\n                }\n                else {\n                    return PARSE_ERROR_CANNOT_MAKE_FIXED_SET;\n                }\n            }\n        }\n        else {\n            if (tiles[0] != tiles[1] || tiles[1] != tiles[2] || tiles[2] != tiles[3]) {\n                return PARSE_ERROR_CANNOT_MAKE_FIXED_SET;\n            }\n            *pack = make_pack(true, PACK_TYPE_KONG, tiles[0]);\n        }\n        return 1;\n    }\n    return 0;\n}\n\nlong string_to_tiles(const char *str, hand_tiles_t *hand_tiles) {\n    pack_t packs[4];\n    long pack_cnt = 0;\n    bool is_concealed_kong = false;\n    tile_t tiles[13];\n    long tile_cnt = 0;\n\n    const char *p = str;\n    while (char c = *p) {\n        const char *q;\n        switch (c) {\n        case ' ': {\n            if (pack_cnt > 4) {\n                return PARSE_ERROR_TOO_MANY_FIXED_SET;\n            }\n            long ret = make_fixed_pack(tiles, tile_cnt, &packs[pack_cnt]);\n            if (ret < 0) {\n                return ret;\n            }\n            pack_cnt += ret;\n            q = ++p;\n            tile_cnt = 0;\n            break;\n        }\n        case '[': {\n            if (pack_cnt > 4) {\n                return PARSE_ERROR_TOO_MANY_FIXED_SET;\n            }\n            long ret = make_fixed_pack(tiles, tile_cnt, &packs[pack_cnt]);\n            if (ret < 0) {\n                return ret;\n            }\n            pack_cnt += ret;\n            q = ++p;\n            is_concealed_kong = true;\n            break;\n        }\n        case ']':\n            if (!is_concealed_kong) {\n                return PARSE_ERROR_ILLEGAL_CHARACTER;\n            }\n            if (tile_cnt != 4) {\n                return PARSE_ERROR_TOO_MANY_TILES_FOR_FIXED_SET;\n            }\n            q = ++p;\n            packs[pack_cnt] = make_pack(false, PACK_TYPE_KONG, tiles[0]);\n            is_concealed_kong = false;\n            ++pack_cnt;\n            tile_cnt = 0;\n            break;\n        default: {\n                long ret = parse_tiles_impl(p, tiles, 13, &tile_cnt);\n                if (ret <= 0) {\n                    return ret;\n                }\n                q = p + ret;\n            }\n            break;\n        }\n        p = q;\n    }\n\n    memcpy(hand_tiles->fixed_packs, packs, pack_cnt * sizeof(pack_t));\n    hand_tiles->pack_count = pack_cnt;\n    memcpy(hand_tiles->standing_tiles, tiles, tile_cnt * sizeof(tile_t));\n    hand_tiles->tile_count = tile_cnt;\n\n    return PARSE_NO_ERROR;\n}\n\n}\n\n<commit_msg>修复解析字符串逻辑错误<commit_after>#include \"stringify.h\"\n\nnamespace mahjong {\n\nstatic long parse_tiles_impl(const char *str, tile_t *tiles, long max_cnt, long *out_tile_cnt) {\n    \/\/if (strspn(str, \"123456789mpsESWNCFP\") != strlen(str)) {\n    \/\/    return PARSE_ERROR_ILLEGAL_CHARACTER;\n    \/\/}\n\n    long tile_cnt = 0;\n\n#define SET_SUIT_FOR_NUMBERED(value_)       \\\n    for (long i = tile_cnt; i > 0;) {       \\\n        if (tiles[--i] & 0xF0) break;       \\\n        tiles[i] |= value_;                 \\\n        } (void)0\n\n    const char *p = str;\n    for (; tile_cnt < max_cnt && *p != '\\0'; ++p) {\n        char c = *p;\n        switch (c) {\n        case '1': tiles[tile_cnt++] = 1; break;\n        case '2': tiles[tile_cnt++] = 2; break;\n        case '3': tiles[tile_cnt++] = 3; break;\n        case '4': tiles[tile_cnt++] = 4; break;\n        case '5': tiles[tile_cnt++] = 5; break;\n        case '6': tiles[tile_cnt++] = 6; break;\n        case '7': tiles[tile_cnt++] = 7; break;\n        case '8': tiles[tile_cnt++] = 8; break;\n        case '9': tiles[tile_cnt++] = 9; break;\n        case 'm': SET_SUIT_FOR_NUMBERED(0x10); break;\n        case 's': SET_SUIT_FOR_NUMBERED(0x20); break;\n        case 'p': SET_SUIT_FOR_NUMBERED(0x30); break;\n        case 'E': tiles[tile_cnt++] = TILE_E; break;\n        case 'S': tiles[tile_cnt++] = TILE_S; break;\n        case 'W': tiles[tile_cnt++] = TILE_W; break;\n        case 'N': tiles[tile_cnt++] = TILE_N; break;\n        case 'C': tiles[tile_cnt++] = TILE_C; break;\n        case 'F': tiles[tile_cnt++] = TILE_F; break;\n        case 'P': tiles[tile_cnt++] = TILE_P; break;\n        default: goto parse_finish;\n        }\n    }\n\nparse_finish:\n    if (tile_cnt > 0 && !(tiles[tile_cnt - 1] & 0xF0)) {\n        bool hasSuffix = false;\n        for (; !hasSuffix && *p != '\\0'; ++p) {\n            char c = *p;\n            switch (c) {\n            case 'm': SET_SUIT_FOR_NUMBERED(0x10); hasSuffix = true; break;\n            case 's': SET_SUIT_FOR_NUMBERED(0x20); hasSuffix = true; break;\n            case 'p': SET_SUIT_FOR_NUMBERED(0x30); hasSuffix = true; break;\n            default: break;\n            }\n        }\n\n        if (!hasSuffix) {\n            return PARSE_ERROR_NO_SUFFIX_AFTER_DIGIT;\n        }\n    }\n\n#undef SET_SUIT_FOR_NUMBERED\n\n    if (out_tile_cnt != nullptr) {\n        *out_tile_cnt = tile_cnt;\n    }\n    return (p - str);\n}\n\nlong parse_tiles(const char *str, tile_t *tiles, long max_cnt) {\n    long tile_cnt;\n    if (parse_tiles_impl(str, tiles, max_cnt, &tile_cnt) > 0) {\n        return tile_cnt;\n    }\n    return 0;\n}\n\nstatic long make_fixed_pack(const tile_t *tiles, long tile_cnt, pack_t *pack) {\n    if (tile_cnt > 0) {\n        if (tile_cnt != 3 && tile_cnt != 4) {\n            return PARSE_ERROR_TOO_MANY_TILES_FOR_FIXED_SET;\n        }\n        if (tile_cnt == 3) {\n            if (tiles[0] == tiles[1] && tiles[1] == tiles[2]) {\n                *pack = make_pack(true, PACK_TYPE_PUNG, tiles[0]);\n            }\n            else {\n                tile_t temp[3] = { tiles[0], tiles[1], tiles[2] };\n                std::sort(std::begin(temp), std::end(temp));\n                if (temp[0] + 1 == temp[1] && temp[1] + 1 == temp[2]) {\n                    *pack = make_pack(true, PACK_TYPE_CHOW, temp[1]);\n                }\n                else {\n                    return PARSE_ERROR_CANNOT_MAKE_FIXED_SET;\n                }\n            }\n        }\n        else {\n            if (tiles[0] != tiles[1] || tiles[1] != tiles[2] || tiles[2] != tiles[3]) {\n                return PARSE_ERROR_CANNOT_MAKE_FIXED_SET;\n            }\n            *pack = make_pack(true, PACK_TYPE_KONG, tiles[0]);\n        }\n        return 1;\n    }\n    return 0;\n}\n\nlong string_to_tiles(const char *str, hand_tiles_t *hand_tiles) {\n    pack_t packs[4];\n    long pack_cnt = 0;\n    bool is_concealed_kong = false;\n    tile_t tiles[13];\n    long tile_cnt = 0;\n\n    const char *p = str;\n    while (char c = *p) {\n        const char *q;\n        switch (c) {\n        case ' ': {\n            if (pack_cnt > 4) {\n                return PARSE_ERROR_TOO_MANY_FIXED_SET;\n            }\n            long ret = make_fixed_pack(tiles, tile_cnt, &packs[pack_cnt]);\n            if (ret < 0) {\n                return ret;\n            }\n            pack_cnt += ret;\n            q = ++p;\n            tile_cnt = 0;\n            break;\n        }\n        case '[': {\n            if (pack_cnt > 4) {\n                return PARSE_ERROR_TOO_MANY_FIXED_SET;\n            }\n            long ret = make_fixed_pack(tiles, tile_cnt, &packs[pack_cnt]);\n            if (ret < 0) {\n                return ret;\n            }\n            pack_cnt += ret;\n            q = ++p;\n            is_concealed_kong = true;\n            break;\n        }\n        case ']':\n            if (!is_concealed_kong) {\n                return PARSE_ERROR_ILLEGAL_CHARACTER;\n            }\n            if (tile_cnt != 4) {\n                return PARSE_ERROR_TOO_MANY_TILES_FOR_FIXED_SET;\n            }\n            q = ++p;\n            packs[pack_cnt] = make_pack(false, PACK_TYPE_KONG, tiles[0]);\n            is_concealed_kong = false;\n            ++pack_cnt;\n            tile_cnt = 0;\n            break;\n        default: {\n                long ret = parse_tiles_impl(p, tiles, 13, &tile_cnt);\n                if (ret < 0) {\n                    return ret;\n                }\n                if (ret == 0) {\n                    return PARSE_ERROR_ILLEGAL_CHARACTER;\n                }\n                q = p + ret;\n            }\n            break;\n        }\n        p = q;\n    }\n\n    memcpy(hand_tiles->fixed_packs, packs, pack_cnt * sizeof(pack_t));\n    hand_tiles->pack_count = pack_cnt;\n    memcpy(hand_tiles->standing_tiles, tiles, tile_cnt * sizeof(tile_t));\n    hand_tiles->tile_count = tile_cnt;\n\n    return PARSE_NO_ERROR;\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: servicehandler.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 01:21: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\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_DISPATCH_SERVICEHANDLER_HXX_\n#include <dispatch\/servicehandler.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_READGUARD_HXX_\n#include <threadhelp\/readguard.hxx>\n#endif\n\n#ifndef __FRAMEWORK_GENERAL_H_\n#include <general.h>\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_FRAME_DISPATCHRESULTSTATE_HPP_\n#include <com\/sun\/star\/frame\/DispatchResultState.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_TASK_XJOBEXECUTOR_HPP_\n#include <com\/sun\/star\/task\/XJobExecutor.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  includes of other projects\n\/\/_________________________________________________________________________________________________________________\n\n#include <vcl\/svapp.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  non exported const\n\/\/_________________________________________________________________________________________________________________\n\n#define PROTOCOL_VALUE      \"service:\"\n#define PROTOCOL_LENGTH     8\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  non exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  declarations\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ XInterface, XTypeProvider, XServiceInfo\n\nDEFINE_XINTERFACE_5(ServiceHandler                                  ,\n                    OWeakObject                                     ,\n                    DIRECT_INTERFACE(css::lang::XTypeProvider      ),\n                    DIRECT_INTERFACE(css::lang::XServiceInfo       ),\n                    DIRECT_INTERFACE(css::frame::XDispatchProvider ),\n                    DIRECT_INTERFACE(css::frame::XNotifyingDispatch),\n                    DIRECT_INTERFACE(css::frame::XDispatch         ))\n\nDEFINE_XTYPEPROVIDER_5(ServiceHandler                ,\n                       css::lang::XTypeProvider      ,\n                       css::lang::XServiceInfo       ,\n                       css::frame::XDispatchProvider ,\n                       css::frame::XNotifyingDispatch,\n                       css::frame::XDispatch         )\n\nDEFINE_XSERVICEINFO_MULTISERVICE(ServiceHandler                   ,\n                                 ::cppu::OWeakObject              ,\n                                 SERVICENAME_PROTOCOLHANDLER      ,\n                                 IMPLEMENTATIONNAME_SERVICEHANDLER)\n\nDEFINE_INIT_SERVICE(ServiceHandler,\n                    {\n                        \/*Attention\n                            I think we don't need any mutex or lock here ... because we are called by our own static method impl_createInstance()\n                            to create a new instance of this class by our own supported service factory.\n                            see macro DEFINE_XSERVICEINFO_MULTISERVICE and \"impl_initService()\" for further informations!\n                        *\/\n                    }\n                   )\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      standard ctor\n    @descr      These initialize a new instance of ths class with needed informations for work.\n\n    @param      xFactory\n                reference to uno servicemanager for creation of new services\n\n    @modified   02.05.2002 08:16, as96863\n*\/\nServiceHandler::ServiceHandler( const css::uno::Reference< css::lang::XMultiServiceFactory >& xFactory )\n        \/\/  Init baseclasses first\n        : ThreadHelpBase( &Application::GetSolarMutex() )\n        , OWeakObject   (                               )\n        \/\/ Init member\n        , m_xFactory    ( xFactory                      )\n{\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      standard dtor\n    @descr      -\n\n    @modified   02.05.2002 08:16, as96863\n*\/\nServiceHandler::~ServiceHandler()\n{\n    m_xFactory = NULL;\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      decide if this dispatch implementation can be used for requested URL or not\n    @descr      A protocol handler is registerd for an URL pattern inside configuration and will\n                be asked by the generic dispatch mechanism inside framework, if he can handle this\n                special URL wich match his registration. He can agree by returning of a valid dispatch\n                instance or disagree by returning <NULL\/>.\n                We don't create new dispatch instances here realy - we return THIS as result to handle it\n                at the same implementation.\n\n    @modified   02.05.2002 15:25, as96863\n*\/\ncss::uno::Reference< css::frame::XDispatch > SAL_CALL ServiceHandler::queryDispatch( const css::util::URL&  aURL    ,\n                                                                                     const ::rtl::OUString& sTarget ,\n                                                                                           sal_Int32        nFlags  ) throw( css::uno::RuntimeException )\n{\n    css::uno::Reference< css::frame::XDispatch > xDispatcher;\n    if (aURL.Complete.compareToAscii(PROTOCOL_VALUE,PROTOCOL_LENGTH)==0)\n        xDispatcher = this;\n    return xDispatcher;\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      do the same like dispatch() but for multiple requests at the same time\n    @descr      -\n\n    @modified   02.05.2002 15:27, as96863\n*\/\ncss::uno::Sequence< css::uno::Reference< css::frame::XDispatch > > SAL_CALL ServiceHandler::queryDispatches( const css::uno::Sequence< css::frame::DispatchDescriptor >& lDescriptor ) throw( css::uno::RuntimeException )\n{\n    sal_Int32 nCount = lDescriptor.getLength();\n    css::uno::Sequence< css::uno::Reference< css::frame::XDispatch > > lDispatcher( nCount );\n    for( sal_Int32 i=0; i<nCount; ++i )\n    {\n        lDispatcher[i] = this->queryDispatch(\n                            lDescriptor[i].FeatureURL,\n                            lDescriptor[i].FrameName,\n                            lDescriptor[i].SearchFlags);\n    }\n    return lDispatcher;\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      dispatch URL with arguments\n    @descr      We use threadsafe internal method to do so. It returns a state value - but we ignore it.\n                Because we doesn't support status listener notifications here.\n\n    @param      aURL\n                    uno URL which should be executed\n    @param      lArguments\n                    list of optional arguments for this request\n\n    @modified   02.05.2002 08:19, as96863\n*\/\nvoid SAL_CALL ServiceHandler::dispatch( const css::util::URL&                                  aURL       ,\n                                    const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException )\n{\n    \/\/ dispatch() is an [oneway] call ... and may our user release his reference to us immediatly.\n    \/\/ So we should hold us self alive till this call ends.\n    css::uno::Reference< css::frame::XNotifyingDispatch > xSelfHold(static_cast< ::cppu::OWeakObject* >(this), css::uno::UNO_QUERY);\n    implts_dispatch(aURL,lArguments);\n    \/\/ No notification for status listener!\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      dispatch with guaranteed notifications about success\n    @descr      We use threadsafe internal method to do so. Return state of this function will be used\n                for notification if an optional listener is given.\n\n    @param      aURL\n                    uno URL which should be executed\n    @param      lArguments\n                    list of optional arguments for this request\n    @param      xListener\n                    optional listener for state events\n\n    @modified   30.04.2002 14:49, as96863\n*\/\nvoid SAL_CALL ServiceHandler::dispatchWithNotification( const css::util::URL&                                             aURL      ,\n                                                        const css::uno::Sequence< css::beans::PropertyValue >&            lArguments,\n                                                        const css::uno::Reference< css::frame::XDispatchResultListener >& xListener ) throw( css::uno::RuntimeException )\n{\n    \/\/ This class was designed to die by reference. And if user release his reference to us immediatly after calling this method\n    \/\/ we can run into some problems. So we hold us self alive till this method ends.\n    \/\/ Another reason: We can use this reference as source of sending event at the end too.\n    css::uno::Reference< css::frame::XNotifyingDispatch > xThis(static_cast< ::cppu::OWeakObject* >(this), css::uno::UNO_QUERY);\n\n    css::uno::Reference< css::uno::XInterface > xService = implts_dispatch(aURL,lArguments);\n    if (xListener.is())\n    {\n        css::frame::DispatchResultEvent aEvent;\n        if (xService.is())\n            aEvent.State = css::frame::DispatchResultState::SUCCESS;\n        else\n            aEvent.State = css::frame::DispatchResultState::FAILURE;\n        aEvent.Result <<= xService; \/\/ may NULL for state=FAILED!\n        aEvent.Source = xThis;\n\n        xListener->dispatchFinished( aEvent );\n    }\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      threadsafe helper for dispatch calls\n    @descr      We support two interfaces for the same process - dispatch URLs. That the reason for this internal\n                function. It implements the real dispatch operation and returns a state value which inform caller\n                about success. He can notify listener then by using this return value.\n\n    @param      aURL\n                    uno URL which should be executed\n    @param      lArguments\n                    list of optional arguments for this request\n\n    @return     <NULL\/> if requested service couldn't be created successullfy;\n                a valid reference otherwise. This return value can be used to indicate,\n                if dispatch was successfully or not.\n\n    @modified   02.05.2002 10:51, as96863\n*\/\ncss::uno::Reference< css::uno::XInterface > ServiceHandler::implts_dispatch( const css::util::URL&                                  aURL       ,\n                                                                             const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException )\n{\n    \/* SAFE *\/\n    ReadGuard aReadLock( m_aLock );\n    css::uno::Reference< css::lang::XMultiServiceFactory > xFactory = m_xFactory;\n    aReadLock.unlock();\n    \/* SAFE *\/\n\n    if (!xFactory.is())\n        return css::uno::Reference< css::uno::XInterface >();\n\n    \/\/ extract service name and may optional given parameters from given URL\n    \/\/ and use it to create and start the component\n    ::rtl::OUString sServiceAndArguments = aURL.Complete.copy(PROTOCOL_LENGTH);\n    ::rtl::OUString sServiceName;\n    ::rtl::OUString sArguments  ;\n\n    sal_Int32 nArgStart = sServiceAndArguments.indexOf('?',0);\n    if (nArgStart!=-1)\n    {\n        sServiceName = sServiceAndArguments.copy(0,nArgStart);\n        ++nArgStart; \/\/ ignore '?'!\n        sArguments   = sServiceAndArguments.copy(nArgStart);\n    }\n    else\n    {\n        sServiceName = sServiceAndArguments;\n    }\n\n    if (!sServiceName.getLength())\n        return css::uno::Reference< css::uno::XInterface >();\n\n    \/\/ If a service doesnt support an optional job executor interface - he can't get\n    \/\/ any given parameters!\n    \/\/ Because we can't know if we must call createInstanceWithArguments() or XJobExecutor::trigger() ...\n\n    css::uno::Reference< css::uno::XInterface > xService;\n    try\n    {\n        \/\/ => a) a service starts running inside his own ctor and we create it only\n        xService = xFactory->createInstance(sServiceName);\n        \/\/ or b) he implements the right interface and starts there (may with optional parameters)\n        css::uno::Reference< css::task::XJobExecutor > xExecuteable(xService, css::uno::UNO_QUERY);\n        if (xExecuteable.is())\n            xExecuteable->trigger(sArguments);\n    }\n    \/\/ ignore all errors - inclusive runtime errors!\n    \/\/ E.g. a script based service (written in phyton) could not be executed\n    \/\/ because it contains syntax errors, which was detected at runtime ...\n    catch(const css::uno::Exception&)\n        { xService.clear(); }\n\n    return xService;\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      add\/remove listener for state events\n    @descr      We use an internal container to hold such registered listener. This container lives if we live.\n                And if call pas registration as non breakable transaction - we can accept the request without\n                any explicit lock. Because we share our mutex with this container.\n\n    @param      xListener\n                    reference to a valid listener for state events\n    @param      aURL\n                    URL about listener will be informed, if something occured\n\n    @modified   30.04.2002 14:49, as96863\n*\/\nvoid SAL_CALL ServiceHandler::addStatusListener( const css::uno::Reference< css::frame::XStatusListener >& xListener ,\n                                                 const css::util::URL&                                     aURL      ) throw( css::uno::RuntimeException )\n{\n    \/\/ not suported yet\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid SAL_CALL ServiceHandler::removeStatusListener( const css::uno::Reference< css::frame::XStatusListener >& xListener ,\n                                                    const css::util::URL&                                     aURL      ) throw( css::uno::RuntimeException )\n{\n    \/\/ not suported yet\n}\n\n}       \/\/  namespace framework\n<commit_msg>INTEGRATION: CWS warnings01 (1.6.32); FILE MERGED 2005\/11\/16 13:10:35 pl 1.6.32.1: #i55991# removed warnings<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: servicehandler.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 11:16:53 $\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\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_DISPATCH_SERVICEHANDLER_HXX_\n#include <dispatch\/servicehandler.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_READGUARD_HXX_\n#include <threadhelp\/readguard.hxx>\n#endif\n\n#ifndef __FRAMEWORK_GENERAL_H_\n#include <general.h>\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_FRAME_DISPATCHRESULTSTATE_HPP_\n#include <com\/sun\/star\/frame\/DispatchResultState.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_TASK_XJOBEXECUTOR_HPP_\n#include <com\/sun\/star\/task\/XJobExecutor.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  includes of other projects\n\/\/_________________________________________________________________________________________________________________\n\n#include <vcl\/svapp.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  non exported const\n\/\/_________________________________________________________________________________________________________________\n\n#define PROTOCOL_VALUE      \"service:\"\n#define PROTOCOL_LENGTH     8\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  non exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  declarations\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ XInterface, XTypeProvider, XServiceInfo\n\nDEFINE_XINTERFACE_5(ServiceHandler                                  ,\n                    OWeakObject                                     ,\n                    DIRECT_INTERFACE(css::lang::XTypeProvider      ),\n                    DIRECT_INTERFACE(css::lang::XServiceInfo       ),\n                    DIRECT_INTERFACE(css::frame::XDispatchProvider ),\n                    DIRECT_INTERFACE(css::frame::XNotifyingDispatch),\n                    DIRECT_INTERFACE(css::frame::XDispatch         ))\n\nDEFINE_XTYPEPROVIDER_5(ServiceHandler                ,\n                       css::lang::XTypeProvider      ,\n                       css::lang::XServiceInfo       ,\n                       css::frame::XDispatchProvider ,\n                       css::frame::XNotifyingDispatch,\n                       css::frame::XDispatch         )\n\nDEFINE_XSERVICEINFO_MULTISERVICE(ServiceHandler                   ,\n                                 ::cppu::OWeakObject              ,\n                                 SERVICENAME_PROTOCOLHANDLER      ,\n                                 IMPLEMENTATIONNAME_SERVICEHANDLER)\n\nDEFINE_INIT_SERVICE(ServiceHandler,\n                    {\n                        \/*Attention\n                            I think we don't need any mutex or lock here ... because we are called by our own static method impl_createInstance()\n                            to create a new instance of this class by our own supported service factory.\n                            see macro DEFINE_XSERVICEINFO_MULTISERVICE and \"impl_initService()\" for further informations!\n                        *\/\n                    }\n                   )\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      standard ctor\n    @descr      These initialize a new instance of ths class with needed informations for work.\n\n    @param      xFactory\n                reference to uno servicemanager for creation of new services\n\n    @modified   02.05.2002 08:16, as96863\n*\/\nServiceHandler::ServiceHandler( const css::uno::Reference< css::lang::XMultiServiceFactory >& xFactory )\n        \/\/  Init baseclasses first\n        : ThreadHelpBase( &Application::GetSolarMutex() )\n        , OWeakObject   (                               )\n        \/\/ Init member\n        , m_xFactory    ( xFactory                      )\n{\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      standard dtor\n    @descr      -\n\n    @modified   02.05.2002 08:16, as96863\n*\/\nServiceHandler::~ServiceHandler()\n{\n    m_xFactory = NULL;\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      decide if this dispatch implementation can be used for requested URL or not\n    @descr      A protocol handler is registerd for an URL pattern inside configuration and will\n                be asked by the generic dispatch mechanism inside framework, if he can handle this\n                special URL wich match his registration. He can agree by returning of a valid dispatch\n                instance or disagree by returning <NULL\/>.\n                We don't create new dispatch instances here realy - we return THIS as result to handle it\n                at the same implementation.\n\n    @modified   02.05.2002 15:25, as96863\n*\/\ncss::uno::Reference< css::frame::XDispatch > SAL_CALL ServiceHandler::queryDispatch( const css::util::URL&  aURL    ,\n                                                                                     const ::rtl::OUString& \/*sTarget*\/ ,\n                                                                                           sal_Int32        \/*nFlags*\/  ) throw( css::uno::RuntimeException )\n{\n    css::uno::Reference< css::frame::XDispatch > xDispatcher;\n    if (aURL.Complete.compareToAscii(PROTOCOL_VALUE,PROTOCOL_LENGTH)==0)\n        xDispatcher = this;\n    return xDispatcher;\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      do the same like dispatch() but for multiple requests at the same time\n    @descr      -\n\n    @modified   02.05.2002 15:27, as96863\n*\/\ncss::uno::Sequence< css::uno::Reference< css::frame::XDispatch > > SAL_CALL ServiceHandler::queryDispatches( const css::uno::Sequence< css::frame::DispatchDescriptor >& lDescriptor ) throw( css::uno::RuntimeException )\n{\n    sal_Int32 nCount = lDescriptor.getLength();\n    css::uno::Sequence< css::uno::Reference< css::frame::XDispatch > > lDispatcher( nCount );\n    for( sal_Int32 i=0; i<nCount; ++i )\n    {\n        lDispatcher[i] = this->queryDispatch(\n                            lDescriptor[i].FeatureURL,\n                            lDescriptor[i].FrameName,\n                            lDescriptor[i].SearchFlags);\n    }\n    return lDispatcher;\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      dispatch URL with arguments\n    @descr      We use threadsafe internal method to do so. It returns a state value - but we ignore it.\n                Because we doesn't support status listener notifications here.\n\n    @param      aURL\n                    uno URL which should be executed\n    @param      lArguments\n                    list of optional arguments for this request\n\n    @modified   02.05.2002 08:19, as96863\n*\/\nvoid SAL_CALL ServiceHandler::dispatch( const css::util::URL&                                  aURL       ,\n                                    const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException )\n{\n    \/\/ dispatch() is an [oneway] call ... and may our user release his reference to us immediatly.\n    \/\/ So we should hold us self alive till this call ends.\n    css::uno::Reference< css::frame::XNotifyingDispatch > xSelfHold(static_cast< ::cppu::OWeakObject* >(this), css::uno::UNO_QUERY);\n    implts_dispatch(aURL,lArguments);\n    \/\/ No notification for status listener!\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      dispatch with guaranteed notifications about success\n    @descr      We use threadsafe internal method to do so. Return state of this function will be used\n                for notification if an optional listener is given.\n\n    @param      aURL\n                    uno URL which should be executed\n    @param      lArguments\n                    list of optional arguments for this request\n    @param      xListener\n                    optional listener for state events\n\n    @modified   30.04.2002 14:49, as96863\n*\/\nvoid SAL_CALL ServiceHandler::dispatchWithNotification( const css::util::URL&                                             aURL      ,\n                                                        const css::uno::Sequence< css::beans::PropertyValue >&            lArguments,\n                                                        const css::uno::Reference< css::frame::XDispatchResultListener >& xListener ) throw( css::uno::RuntimeException )\n{\n    \/\/ This class was designed to die by reference. And if user release his reference to us immediatly after calling this method\n    \/\/ we can run into some problems. So we hold us self alive till this method ends.\n    \/\/ Another reason: We can use this reference as source of sending event at the end too.\n    css::uno::Reference< css::frame::XNotifyingDispatch > xThis(static_cast< ::cppu::OWeakObject* >(this), css::uno::UNO_QUERY);\n\n    css::uno::Reference< css::uno::XInterface > xService = implts_dispatch(aURL,lArguments);\n    if (xListener.is())\n    {\n        css::frame::DispatchResultEvent aEvent;\n        if (xService.is())\n            aEvent.State = css::frame::DispatchResultState::SUCCESS;\n        else\n            aEvent.State = css::frame::DispatchResultState::FAILURE;\n        aEvent.Result <<= xService; \/\/ may NULL for state=FAILED!\n        aEvent.Source = xThis;\n\n        xListener->dispatchFinished( aEvent );\n    }\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      threadsafe helper for dispatch calls\n    @descr      We support two interfaces for the same process - dispatch URLs. That the reason for this internal\n                function. It implements the real dispatch operation and returns a state value which inform caller\n                about success. He can notify listener then by using this return value.\n\n    @param      aURL\n                    uno URL which should be executed\n    @param      lArguments\n                    list of optional arguments for this request\n\n    @return     <NULL\/> if requested service couldn't be created successullfy;\n                a valid reference otherwise. This return value can be used to indicate,\n                if dispatch was successfully or not.\n\n    @modified   02.05.2002 10:51, as96863\n*\/\ncss::uno::Reference< css::uno::XInterface > ServiceHandler::implts_dispatch( const css::util::URL&                                  aURL       ,\n                                                                             const css::uno::Sequence< css::beans::PropertyValue >& \/*lArguments*\/ ) throw( css::uno::RuntimeException )\n{\n    \/* SAFE *\/\n    ReadGuard aReadLock( m_aLock );\n    css::uno::Reference< css::lang::XMultiServiceFactory > xFactory = m_xFactory;\n    aReadLock.unlock();\n    \/* SAFE *\/\n\n    if (!xFactory.is())\n        return css::uno::Reference< css::uno::XInterface >();\n\n    \/\/ extract service name and may optional given parameters from given URL\n    \/\/ and use it to create and start the component\n    ::rtl::OUString sServiceAndArguments = aURL.Complete.copy(PROTOCOL_LENGTH);\n    ::rtl::OUString sServiceName;\n    ::rtl::OUString sArguments  ;\n\n    sal_Int32 nArgStart = sServiceAndArguments.indexOf('?',0);\n    if (nArgStart!=-1)\n    {\n        sServiceName = sServiceAndArguments.copy(0,nArgStart);\n        ++nArgStart; \/\/ ignore '?'!\n        sArguments   = sServiceAndArguments.copy(nArgStart);\n    }\n    else\n    {\n        sServiceName = sServiceAndArguments;\n    }\n\n    if (!sServiceName.getLength())\n        return css::uno::Reference< css::uno::XInterface >();\n\n    \/\/ If a service doesnt support an optional job executor interface - he can't get\n    \/\/ any given parameters!\n    \/\/ Because we can't know if we must call createInstanceWithArguments() or XJobExecutor::trigger() ...\n\n    css::uno::Reference< css::uno::XInterface > xService;\n    try\n    {\n        \/\/ => a) a service starts running inside his own ctor and we create it only\n        xService = xFactory->createInstance(sServiceName);\n        \/\/ or b) he implements the right interface and starts there (may with optional parameters)\n        css::uno::Reference< css::task::XJobExecutor > xExecuteable(xService, css::uno::UNO_QUERY);\n        if (xExecuteable.is())\n            xExecuteable->trigger(sArguments);\n    }\n    \/\/ ignore all errors - inclusive runtime errors!\n    \/\/ E.g. a script based service (written in phyton) could not be executed\n    \/\/ because it contains syntax errors, which was detected at runtime ...\n    catch(const css::uno::Exception&)\n        { xService.clear(); }\n\n    return xService;\n}\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short      add\/remove listener for state events\n    @descr      We use an internal container to hold such registered listener. This container lives if we live.\n                And if call pas registration as non breakable transaction - we can accept the request without\n                any explicit lock. Because we share our mutex with this container.\n\n    @param      xListener\n                    reference to a valid listener for state events\n    @param      aURL\n                    URL about listener will be informed, if something occured\n\n    @modified   30.04.2002 14:49, as96863\n*\/\nvoid SAL_CALL ServiceHandler::addStatusListener( const css::uno::Reference< css::frame::XStatusListener >& \/*xListener*\/ ,\n                                                 const css::util::URL&                                     \/*aURL*\/      ) throw( css::uno::RuntimeException )\n{\n    \/\/ not suported yet\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid SAL_CALL ServiceHandler::removeStatusListener( const css::uno::Reference< css::frame::XStatusListener >& \/*xListener*\/ ,\n                                                    const css::util::URL&                                     \/*aURL*\/      ) throw( css::uno::RuntimeException )\n{\n    \/\/ not suported yet\n}\n\n}       \/\/  namespace framework\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 2008 by Sun Microsystems, Inc.\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\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#include <uielement\/uielement.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#include <com\/sun\/star\/ui\/DockingArea.hpp>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nusing namespace ::com::sun::star;\n\nnamespace framework\n{\n\n    bool UIElement::operator< ( const ::framework::UIElement& aUIElement ) const\n{\n    if ( !m_xUIElement.is() && aUIElement.m_xUIElement.is() )\n        return false;\n    else if ( m_xUIElement.is() && !aUIElement.m_xUIElement.is() )\n        return true;\n    else if ( !m_bVisible && aUIElement.m_bVisible )\n        return false;\n    else if ( m_bVisible && !aUIElement.m_bVisible )\n        return true;\n    else if ( !m_bFloating && aUIElement.m_bFloating )\n        return true;\n    else if ( m_bFloating && !aUIElement.m_bFloating )\n        return false;\n    else\n    {\n        if ( m_bFloating )\n        {\n            bool bEqual = ( m_aFloatingData.m_aPos.Y == aUIElement.m_aFloatingData.m_aPos.Y );\n            if ( bEqual )\n                return ( m_aFloatingData.m_aPos.X < aUIElement.m_aFloatingData.m_aPos.X );\n            else\n                return ( m_aFloatingData.m_aPos.Y < aUIElement.m_aFloatingData.m_aPos.Y );\n        }\n        else\n        {\n            if ( m_aDockedData.m_nDockedArea < aUIElement.m_aDockedData.m_nDockedArea )\n                return true;\n            else if ( m_aDockedData.m_nDockedArea > aUIElement.m_aDockedData.m_nDockedArea )\n                return false;\n            else\n            {\n                if ( m_aDockedData.m_nDockedArea == ui::DockingArea_DOCKINGAREA_TOP ||\n                     m_aDockedData.m_nDockedArea == ui::DockingArea_DOCKINGAREA_BOTTOM )\n                {\n                    if ( !( m_aDockedData.m_aPos.Y == aUIElement.m_aDockedData.m_aPos.Y ) )\n                        return  ( m_aDockedData.m_aPos.Y < aUIElement.m_aDockedData.m_aPos.Y );\n                    else\n                    {\n                        bool bEqual = ( m_aDockedData.m_aPos.X == aUIElement.m_aDockedData.m_aPos.X );\n                        if ( bEqual )\n                        {\n                            if ( m_bUserActive && !aUIElement.m_bUserActive )\n                                return sal_True;\n                            else if ( !m_bUserActive && aUIElement.m_bUserActive )\n                                return sal_False;\n                            else\n                                return sal_False;\n                        }\n                        else\n                            return ( m_aDockedData.m_aPos.X <= aUIElement.m_aDockedData.m_aPos.X );\n                    }\n                }\n                else\n                {\n                    if ( !( m_aDockedData.m_aPos.X == aUIElement.m_aDockedData.m_aPos.X ) )\n                        return ( m_aDockedData.m_aPos.X < aUIElement.m_aDockedData.m_aPos.X );\n                    else\n                    {\n                        bool bEqual = ( m_aDockedData.m_aPos.Y == aUIElement.m_aDockedData.m_aPos.Y );\n                        if ( bEqual )\n                        {\n                            if ( m_bUserActive && !aUIElement.m_bUserActive )\n                                return sal_True;\n                            else if ( !m_bUserActive && aUIElement.m_bUserActive )\n                                return sal_False;\n                            else\n                                return sal_False;\n                        }\n                        else\n                            return ( m_aDockedData.m_aPos.Y <= aUIElement.m_aDockedData.m_aPos.Y );\n                    }\n                }\n            }\n        }\n    }\n}\n\nUIElement& UIElement::operator= ( const UIElement& rUIElement )\n{\n    if (&rUIElement != this)\n    {\n        m_aType             = rUIElement.m_aType;\n        m_aName             = rUIElement.m_aName;\n        m_aUIName           = rUIElement.m_aUIName;\n        m_xUIElement        = rUIElement.m_xUIElement;\n        m_bFloating         = rUIElement.m_bFloating;\n        m_bVisible          = rUIElement.m_bVisible;\n        m_bUserActive       = rUIElement.m_bUserActive;\n        m_bCreateNewRowCol0 = rUIElement.m_bCreateNewRowCol0;\n        m_bDeactiveHide     = rUIElement.m_bDeactiveHide;\n        m_bMasterHide       = rUIElement.m_bMasterHide;\n        m_bContextSensitive = rUIElement.m_bContextSensitive;\n        m_bContextActive    = rUIElement.m_bContextActive;\n        m_bNoClose          = rUIElement.m_bNoClose;\n        m_bSoftClose        = rUIElement.m_bSoftClose;\n        m_bStateRead        = rUIElement.m_bStateRead;\n        m_nStyle            = rUIElement.m_nStyle;\n        m_aDockedData       = rUIElement.m_aDockedData;\n        m_aFloatingData     = rUIElement.m_aFloatingData;\n    }\n    return *this;\n}\n\n} \/\/ namespace framework\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>WaE: duplicateBranch<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 2008 by Sun Microsystems, Inc.\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\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#include <uielement\/uielement.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#include <com\/sun\/star\/ui\/DockingArea.hpp>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nusing namespace ::com::sun::star;\n\nnamespace framework\n{\n\n    bool UIElement::operator< ( const ::framework::UIElement& aUIElement ) const\n{\n    if ( !m_xUIElement.is() && aUIElement.m_xUIElement.is() )\n        return false;\n    else if ( m_xUIElement.is() && !aUIElement.m_xUIElement.is() )\n        return true;\n    else if ( !m_bVisible && aUIElement.m_bVisible )\n        return false;\n    else if ( m_bVisible && !aUIElement.m_bVisible )\n        return true;\n    else if ( !m_bFloating && aUIElement.m_bFloating )\n        return true;\n    else if ( m_bFloating && !aUIElement.m_bFloating )\n        return false;\n    else\n    {\n        if ( m_bFloating )\n        {\n            bool bEqual = ( m_aFloatingData.m_aPos.Y == aUIElement.m_aFloatingData.m_aPos.Y );\n            if ( bEqual )\n                return ( m_aFloatingData.m_aPos.X < aUIElement.m_aFloatingData.m_aPos.X );\n            else\n                return ( m_aFloatingData.m_aPos.Y < aUIElement.m_aFloatingData.m_aPos.Y );\n        }\n        else\n        {\n            if ( m_aDockedData.m_nDockedArea < aUIElement.m_aDockedData.m_nDockedArea )\n                return true;\n            else if ( m_aDockedData.m_nDockedArea > aUIElement.m_aDockedData.m_nDockedArea )\n                return false;\n            else\n            {\n                if ( m_aDockedData.m_nDockedArea == ui::DockingArea_DOCKINGAREA_TOP ||\n                     m_aDockedData.m_nDockedArea == ui::DockingArea_DOCKINGAREA_BOTTOM )\n                {\n                    if ( !( m_aDockedData.m_aPos.Y == aUIElement.m_aDockedData.m_aPos.Y ) )\n                        return  ( m_aDockedData.m_aPos.Y < aUIElement.m_aDockedData.m_aPos.Y );\n                    else\n                    {\n                        bool bEqual = ( m_aDockedData.m_aPos.X == aUIElement.m_aDockedData.m_aPos.X );\n                        if ( bEqual )\n                        {\n                            if ( m_bUserActive && !aUIElement.m_bUserActive )\n                                return sal_True;\n                            else\n                                return sal_False;\n                        }\n                        else\n                            return ( m_aDockedData.m_aPos.X <= aUIElement.m_aDockedData.m_aPos.X );\n                    }\n                }\n                else\n                {\n                    if ( !( m_aDockedData.m_aPos.X == aUIElement.m_aDockedData.m_aPos.X ) )\n                        return ( m_aDockedData.m_aPos.X < aUIElement.m_aDockedData.m_aPos.X );\n                    else\n                    {\n                        bool bEqual = ( m_aDockedData.m_aPos.Y == aUIElement.m_aDockedData.m_aPos.Y );\n                        if ( bEqual )\n                        {\n                            if ( m_bUserActive && !aUIElement.m_bUserActive )\n                                return sal_True;\n                            else\n                                return sal_False;\n                        }\n                        else\n                            return ( m_aDockedData.m_aPos.Y <= aUIElement.m_aDockedData.m_aPos.Y );\n                    }\n                }\n            }\n        }\n    }\n}\n\nUIElement& UIElement::operator= ( const UIElement& rUIElement )\n{\n    if (&rUIElement != this)\n    {\n        m_aType             = rUIElement.m_aType;\n        m_aName             = rUIElement.m_aName;\n        m_aUIName           = rUIElement.m_aUIName;\n        m_xUIElement        = rUIElement.m_xUIElement;\n        m_bFloating         = rUIElement.m_bFloating;\n        m_bVisible          = rUIElement.m_bVisible;\n        m_bUserActive       = rUIElement.m_bUserActive;\n        m_bCreateNewRowCol0 = rUIElement.m_bCreateNewRowCol0;\n        m_bDeactiveHide     = rUIElement.m_bDeactiveHide;\n        m_bMasterHide       = rUIElement.m_bMasterHide;\n        m_bContextSensitive = rUIElement.m_bContextSensitive;\n        m_bContextActive    = rUIElement.m_bContextActive;\n        m_bNoClose          = rUIElement.m_bNoClose;\n        m_bSoftClose        = rUIElement.m_bSoftClose;\n        m_bStateRead        = rUIElement.m_bStateRead;\n        m_nStyle            = rUIElement.m_nStyle;\n        m_aDockedData       = rUIElement.m_aDockedData;\n        m_aFloatingData     = rUIElement.m_aFloatingData;\n    }\n    return *this;\n}\n\n} \/\/ namespace framework\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\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\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 )\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  return true;\n}\n\n\/*****************************************************************************\/\nvoid\nI18nApplication\n::DatasetPathName( QString& path,\n\t\t   QString& name,\n\t\t   const QString& imageFilename )\n{\n  \/\/ '\/tmp\/archive.tar.gz'\n  QFileInfo fileInfo( imageFilename );\n\n#if 0\n  \/\/ Dataset is stored into image-file path.\n  \/\/ E.g. '\/tmp'\n  path = fileInfo.path();\n#else\n  \/\/ Dataset is stored into application cache-directory.\n  \/\/ E.g. '$HOME\/<CACHE_DIR>'\n  path = I18nApplication::Instance()->GetCacheDir().path();\n#endif\n\n  \/\/ '[_tmp_]archive.tar.gz.<SUFFIX>'\n  name =\n#if 1\n    fileInfo.canonicalPath().replace( QRegExp( \"[\/\\\\\\\\:]+\" ), \"_\") +\n    \"_\" +\n#endif\n    fileInfo.fileName() +\n    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\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& cacheDirStr )\n{\n  qDebug() << this << \"::MakeCacheDir(\" << cacheDirStr << \")\";\n\n  QDir homeDir (cacheDirStr);\n\n  if (!homeDir.exists())\n    SystemError( ToStdString( QString( \"('%1')\" ).arg( homeDir.path() ) ) );\n\n  bool isNew = I18nApplication::MakeDirTree(\n    homeDir.path(), I18nApplication::DEFAULT_CACHE_DIR_NAME );\n\n  QDir cacheDir( homeDir );\n\n  if( !cacheDir.cd( I18nApplication::DEFAULT_CACHE_DIR_NAME ) )\n    throw SystemError(\n      ToStdString(\n\tQString( \"('%1')\" ).arg(\n\t  homeDir.filePath( I18nApplication::DEFAULT_CACHE_DIR_NAME )\n\t)\n      )\n    );\n\n  m_CacheDir = cacheDir;\n\n  StoreSettingsKey( \"cacheDir\", QDir::cleanPath( m_CacheDir.path() ) );\n\n  return isNew;\n}\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::MakeResultCacheDir( const QString& cacheDirStr )\n{\n  \/\/\n  QDir homeDir (cacheDirStr);\n\n  \/\/\n  \/\/ create result directory in  CacheDir\n  QDir cacheDir( homeDir.filePath( I18nApplication::DEFAULT_CACHE_DIR_NAME ) );\n  QDir resultDir(cacheDir.filePath ( I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME ) );\n\n  if ( !resultDir.exists() &&\n       !cacheDir.mkpath( I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME ) )\n    {\n    throw SystemError(\n      ToStdString(\n\tQString( \"('%1')\" ).arg( cacheDir.filePath(I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME ) )\n        )\n      );\n    }\n\n  return true;\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::InitializeLocale()\n{\n  QTextCodec::setCodecForTr( 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: use the md5 hash of the filename to get the dataset directory name (thanks to JMK)<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\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 )\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  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(imageFilename.toAscii(), 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\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& cacheDirStr )\n{\n  qDebug() << this << \"::MakeCacheDir(\" << cacheDirStr << \")\";\n\n  QDir homeDir (cacheDirStr);\n\n  if (!homeDir.exists())\n    SystemError( ToStdString( QString( \"('%1')\" ).arg( homeDir.path() ) ) );\n\n  bool isNew = I18nApplication::MakeDirTree(\n    homeDir.path(), I18nApplication::DEFAULT_CACHE_DIR_NAME );\n\n  QDir cacheDir( homeDir );\n\n  if( !cacheDir.cd( I18nApplication::DEFAULT_CACHE_DIR_NAME ) )\n    throw SystemError(\n      ToStdString(\n\tQString( \"('%1')\" ).arg(\n\t  homeDir.filePath( I18nApplication::DEFAULT_CACHE_DIR_NAME )\n\t)\n      )\n    );\n\n  m_CacheDir = cacheDir;\n\n  StoreSettingsKey( \"cacheDir\", QDir::cleanPath( m_CacheDir.path() ) );\n\n  return isNew;\n}\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::MakeResultCacheDir( const QString& cacheDirStr )\n{\n  \/\/\n  QDir homeDir (cacheDirStr);\n\n  \/\/\n  \/\/ create result directory in  CacheDir\n  QDir cacheDir( homeDir.filePath( I18nApplication::DEFAULT_CACHE_DIR_NAME ) );\n  QDir resultDir(cacheDir.filePath ( I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME ) );\n\n  if ( !resultDir.exists() &&\n       !cacheDir.mkpath( I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME ) )\n    {\n    throw SystemError(\n      ToStdString(\n\tQString( \"('%1')\" ).arg( cacheDir.filePath(I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME ) )\n        )\n      );\n    }\n\n  return true;\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::InitializeLocale()\n{\n  QTextCodec::setCodecForTr( 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<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <condition_variable>\n#include <thread>\n#include <queue>\n#include <string>\n\nstd::mutex m;\nstd::queue<std::string> messages;\nstd::condition_variable data_condition;\n\nvoid data_reading()\n{\n\tstd::string line;\n\tstd::cout << \"Input: (Empty line exits) \";\n\twhile ( getline(std::cin, line) )\n\t{\n\t\tif ( line.empty() )\n\t\t\tbreak;\n\t\tstd::lock_guard<std::mutex> lg(m);\n\t\tmessages.push(line);\n\t\tdata_condition.notify_one();\n\t}\n}\n\nvoid data_printing()\n{\n\twhile (true)\n\t{\n\t\tstd::unique_lock<std::mutex> l(m);\n\t\tdata_condition.wait( l, [] { return ! messages.empty(); });\n\t\tauto message = std::move(messages.front());\n\t\tmessages.pop();\n\t\tl.unlock();\n\t\tstd::cout << \"READ: \" << message << std::endl;\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\tstd::thread t_read(data_reading);\n\tstd::thread t_print(data_printing);\n\tt_print.detach();\n\tt_read.join();\n}\n\n<commit_msg>Sleep now lets us fill the queue faster than it is emptied<commit_after>#include <iostream>\n#include <condition_variable>\n#include <thread>\n#include <queue>\n#include <string>\n\nstd::mutex m;\nstd::queue<std::string> messages;\nstd::condition_variable data_condition;\n\nvoid data_reading()\n{\n\tstd::string line;\n\tstd::cout << \"Input: (Empty line exits) \";\n\twhile ( getline(std::cin, line) )\n\t{\n\t\tstd::lock_guard<std::mutex> lg(m);\n\t\tmessages.push(line);\n\t\tdata_condition.notify_one();\n\t\tif ( line.empty() )\n\t\t\tbreak;\n\t}\n}\n\nvoid data_printing()\n{\n\twhile (true)\n\t{\n\t\tstd::unique_lock<std::mutex> l(m);\n\t\tdata_condition.wait( l, [] { return ! messages.empty(); });\n\t\tauto message = std::move(messages.front());\n\t\tmessages.pop();\n\t\tl.unlock();\n\t\tif ( message.empty() )\n\t\t\tbreak;\n\t\tstd::cout << \"READ: \" << message << std::endl;\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(1000));\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\tstd::thread t_read(data_reading);\n\tstd::thread t_print(data_printing);\n\tt_print.join();\n\tt_read.join();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE TEST_COMPASS\n#include \"boost\/test\/unit_test.hpp\"\n\n#include <vector>\n#include <iostream>\n#include <string>\n#include <algorithm>\n\n#include \"compass.hpp\"\n#include \"compass_fixture.hpp\"\n\nBOOST_AUTO_TEST_SUITE( compass_fundamentals )\n\nBOOST_AUTO_TEST_CASE( compass_works_at_runtime ){\n\n  auto value = compass::runtime::works();\n\n  BOOST_CHECK(value);\n\n}\n\nBOOST_AUTO_TEST_CASE( compass_yields_vendor_name ){\n\n  auto value = compass::runtime::vendor();\n  BOOST_CHECK_NE(value.size(),0u);\n\n}\nBOOST_AUTO_TEST_SUITE_END()\n\nBOOST_FIXTURE_TEST_SUITE( machine_specific, host_reference )\n\nBOOST_AUTO_TEST_CASE( vendor_right  ){\n\n  auto value = compass::runtime::vendor();\n\n  BOOST_CHECK_NE(value.size(),0u);\n\n  std::transform(value.begin(), value.end(),\n         value.begin(),\n         ::tolower);\n\n  BOOST_CHECK(value.find(expected_vendor)!=std::string::npos);\n\n}\n\n\nBOOST_AUTO_TEST_CASE( brand_right  ){\n\n  auto value = compass::runtime::brand();\n\n  BOOST_CHECK_NE(value.size(),0u);\n\n\n  BOOST_CHECK_MESSAGE(value.find(expected_brand)!=std::string::npos,\n                      \"[brand retrieved]\\t_\" << value.c_str() << \"_\");\n\n}\n\nBOOST_AUTO_TEST_CASE( device_name_right  ){\n\n  auto value = compass::runtime::device_name();\n\n  BOOST_CHECK_NE(value.size(),0u);\n\n  BOOST_CHECK_MESSAGE(value.find(expected_device_name)!=std::string::npos,\n                      \"[device_name]\\t_\"<<value<<\"_ is not \"<< expected_device_name);\n\n}\n\nBOOST_AUTO_TEST_CASE( ncores_right  ){\n\n  auto value = compass::runtime::ncores();\n\n  BOOST_CHECK_NE(value,0);\n  BOOST_CHECK_EQUAL(value,expected_ncores);\n}\n\nBOOST_AUTO_TEST_CASE( has_sse_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse2_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse2());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse2);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse3_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse3());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse3);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse4_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse4());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse4);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_avx_right  ){\n\n  auto value = compass::runtime::has(compass::feature::avx());\n\n  BOOST_CHECK_EQUAL(value,expected_has_avx);\n\n}\n\n\nBOOST_AUTO_TEST_CASE( has_avx2_right  ){\n\n  auto value = compass::runtime::has(compass::feature::avx2());\n\n  BOOST_CHECK_EQUAL(value,expected_has_avx2);\n\n}\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>added error message to avx2 test<commit_after>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE TEST_COMPASS\n#include \"boost\/test\/unit_test.hpp\"\n\n#include <vector>\n#include <iostream>\n#include <string>\n#include <algorithm>\n\n#include \"compass.hpp\"\n#include \"compass_fixture.hpp\"\n\nBOOST_AUTO_TEST_SUITE( compass_fundamentals )\n\nBOOST_AUTO_TEST_CASE( compass_works_at_runtime ){\n\n  auto value = compass::runtime::works();\n\n  BOOST_CHECK(value);\n\n}\n\nBOOST_AUTO_TEST_CASE( compass_yields_vendor_name ){\n\n  auto value = compass::runtime::vendor();\n  BOOST_CHECK_NE(value.size(),0u);\n\n}\nBOOST_AUTO_TEST_SUITE_END()\n\nBOOST_FIXTURE_TEST_SUITE( machine_specific, host_reference )\n\nBOOST_AUTO_TEST_CASE( vendor_right  ){\n\n  auto value = compass::runtime::vendor();\n\n  BOOST_CHECK_NE(value.size(),0u);\n\n  std::transform(value.begin(), value.end(),\n         value.begin(),\n         ::tolower);\n\n  BOOST_CHECK(value.find(expected_vendor)!=std::string::npos);\n\n}\n\n\nBOOST_AUTO_TEST_CASE( brand_right  ){\n\n  auto value = compass::runtime::brand();\n\n  BOOST_CHECK_NE(value.size(),0u);\n\n\n  BOOST_CHECK_MESSAGE(value.find(expected_brand)!=std::string::npos,\n                      \"[brand retrieved]\\t_\" << value.c_str() << \"_\");\n\n}\n\nBOOST_AUTO_TEST_CASE( device_name_right  ){\n\n  auto value = compass::runtime::device_name();\n\n  BOOST_CHECK_NE(value.size(),0u);\n\n  BOOST_CHECK_MESSAGE(value.find(expected_device_name)!=std::string::npos,\n                      \"[device_name]\\t_\"<<value<<\"_ is not \"<< expected_device_name);\n\n}\n\nBOOST_AUTO_TEST_CASE( ncores_right  ){\n\n  auto value = compass::runtime::ncores();\n\n  BOOST_CHECK_NE(value,0);\n  BOOST_CHECK_EQUAL(value,expected_ncores);\n}\n\nBOOST_AUTO_TEST_CASE( has_sse_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse2_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse2());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse2);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse3_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse3());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse3);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse4_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse4());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse4);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_avx_right  ){\n\n  auto value = compass::runtime::has(compass::feature::avx());\n\n  BOOST_CHECK_EQUAL(value,expected_has_avx);\n\n}\n\n\nBOOST_AUTO_TEST_CASE( has_avx2_right  ){\n\n  auto value = compass::runtime::has(compass::feature::avx2());\n\n  BOOST_CHECK_MESSAGE(value==expected_has_avx2, \"detected \" << (value ? \"AVX2\" : \"no AVX2\") << \" on \" << hostname << \" (expected: \" <<  (expected_has_avx2 ? \"AVX2\" : \"no AVX2\"));\n\n}\nBOOST_AUTO_TEST_SUITE_END()\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 \"mitkLevelWindow.h\"\n#include \"mitkImageSliceSelector.h\"\n\n#include <ipFunc\/ipFunc.h>\n#include <algorithm>\n\nmitk::LevelWindow::LevelWindow(mitk::ScalarType level, mitk::ScalarType window) : m_Min(level-window\/2.0), m_Max(level+window\/2.0), m_RangeMin(-1024), m_RangeMax(4096)\n{\n\n}\n\nmitk::LevelWindow::LevelWindow(const mitk::LevelWindow& levWin)\n{\n  *this=levWin;\n}\n\nmitk::LevelWindow::~LevelWindow()\n{\n}\n\nmitk::ScalarType mitk::LevelWindow::GetLevel() const\n{\n  return (m_Max-m_Min)\/2.0 + m_Min;\n}\n\nmitk::ScalarType mitk::LevelWindow::GetWindow() const\n{\n  return (m_Max-m_Min);\n}\n\nmitk::ScalarType mitk::LevelWindow::GetMin() const\n{\n  return m_Min;\n}\n\nmitk::ScalarType mitk::LevelWindow::GetMax() const\n{\n  return m_Max;\n}\n\nvoid mitk::LevelWindow::SetLevel(mitk::ScalarType level)\n{\n  mitk::ScalarType halfWindow = (m_Max - m_Min) \/ 2;\n  m_Min = level - halfWindow;\n  m_Max = level + halfWindow;\n\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetWindow(mitk::ScalarType window)\n{\n  mitk::ScalarType level = m_Min + (m_Max - m_Min) \/ 2;\n  mitk::ScalarType halfWindow = window \/ 2;\n\n  m_Min = level - halfWindow;\n  m_Max = level + halfWindow;\n\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetLevelWindow(mitk::ScalarType level, mitk::ScalarType window)\n{\n  m_Min = level - window \/ 2.0;\n  m_Max = level + window \/ 2.0;\n\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetMin(mitk::ScalarType min)\n{\n  m_Min = min;\n  testValues(); \n}\n\nvoid mitk::LevelWindow::SetMax(mitk::ScalarType max)\n{\n  m_Max = max;\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetMinMax(mitk::ScalarType min, mitk::ScalarType max)\n{\n  if(min>max)\n    std::swap(min,max);\n\n  SetMin(min);\n  SetMax(max);\n}\n\nvoid mitk::LevelWindow::SetRangeMin(mitk::ScalarType min)\n{\n  m_RangeMin = min;\n  if(m_RangeMin > m_RangeMax)\n    std::swap(m_RangeMin,m_RangeMax);\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetRangeMax(mitk::ScalarType max)\n{\n  m_RangeMax = max;\n  if(m_RangeMin > m_RangeMax)\n    std::swap(m_RangeMin,m_RangeMax);\n  testValues();\n}\n\nmitk::ScalarType mitk::LevelWindow::GetRangeMin() const\n{\n  return m_RangeMin;\n}\n\nmitk::ScalarType mitk::LevelWindow::GetRangeMax() const\n{\n  return m_RangeMax;\n}\n\nmitk::ScalarType mitk::LevelWindow::GetRange() const\n{\n  return  m_RangeMax - m_RangeMin;\n}\n\n\/*!\nThis method initializes a mitk::LevelWindow from an mitk::Image. The algorithm is as follows:\n  \nDefault to taking the central image slice for quick analysis.\n\nCompute the smallest (minValue), second smallest (min2ndValue), second largest (max2ndValue), and\nlargest (maxValue) data value by traversing the pixel values only once. In the\nsame scan it also computes the count of minValue values and maxValue values.\nAfter that a basic histogram with specific information about the\nextrems is complete.\n\nIf minValue == maxValue, the center slice is uniform and the above scan is repeated for\nthe complete image, not just one slice\n\nNext, special cases of images with only 1, 2 or 3 distinct data values\nhave hand assigned level window ranges.\n\nNext the level window is set relative to the inner range IR = lengthOf([min2ndValue, max2ndValue])\n\nFor count(minValue) > 20% the smallest values are frequent and should be\ndistinct from the min2ndValue and larger values (minValue may be std:min, may signify\nsomething special) hence the lower end of the level window is set to min2ndValue - 0.5 * IR\n \nFor count(minValue) <= 20% the smallest values are not so important and can\nblend with the next ones => min(level window) = min2ndValue\n\nAnd analog for max(level window):\ncount(max2ndValue) > 20%:  max(level window) = max2ndValue + 0.5 * IR\ncount(max2ndValue) < 20%:  max(level window) = max2ndValue\n\nIn both 20%+ cases the level window bounds are clamped to the [minValue, maxValue] range\n\nIn consequence the level window maximizes contrast with minimal amount of\ncomputation and does do useful things if the data contains std::min or\nstd:max values or has only 1 or 2 or 3 data values.\n*\/\nvoid mitk::LevelWindow::SetAuto(mitk::Image* image, bool tryPicTags, bool guessByCentralSlice)\n{\n    if ( image == NULL )\n        return;\n\n    if ( tryPicTags )\n    {\n        if ( SetAutoByPicTags(image->GetPic()) )\n            return;\n    }\n\n    mitk::Image* wholeImage = image;\n    mitk::ImageSliceSelector::Pointer sliceSelector = mitk::ImageSliceSelector::New();\n    if ( guessByCentralSlice )\n    {\n        sliceSelector->SetInput(image);\n        sliceSelector->SetSliceNr(image->GetDimension(2)\/2);\n        sliceSelector->SetTimeNr(image->GetDimension(3)\/2);\n        sliceSelector->SetChannelNr(image->GetDimension(4)\/2);\n        sliceSelector->Update();\n\n        image = sliceSelector->GetOutput();\n    }\n    ScalarType minValue    = image->GetScalarValueMin();\n    ScalarType maxValue    = image->GetScalarValueMaxNoRecompute();\n    ScalarType min2ndValue = image->GetScalarValue2ndMinNoRecompute();\n    ScalarType max2ndValue = image->GetScalarValue2ndMaxNoRecompute();\n    unsigned int numPixelsInSlice = image->GetDimensions()[0];\n    for ( unsigned int k=0;  k<image->GetDimension();  ++k ) numPixelsInSlice *= image->GetDimensions()[k];\n    unsigned int minCount = image->GetCountOfMinValuedVoxelsNoRecompute();\n    unsigned int maxCount = image->GetCountOfMaxValuedVoxelsNoRecompute();\n    float minCountFraction = minCount\/float(numPixelsInSlice);\n    float maxCountFraction = maxCount\/float(numPixelsInSlice);\n    if ( minValue == maxValue )\n    {\n        \/\/ guessByCentralSlice seems to have failed, lets look at all data\n        minValue    = wholeImage->GetScalarValueMin();                   \n        maxValue    = wholeImage->GetScalarValueMaxNoRecompute();        \n        min2ndValue = wholeImage->GetScalarValue2ndMinNoRecompute();  \n        max2ndValue = wholeImage->GetScalarValue2ndMaxNoRecompute();  \n        unsigned int numPixelsInDataset = image->GetDimensions()[0];\n        for ( unsigned int k=0;  k<image->GetDimension();  ++k ) numPixelsInDataset *= image->GetDimensions()[k];\n        minCount = image->GetCountOfMinValuedVoxelsNoRecompute();\n        maxCount = image->GetCountOfMaxValuedVoxelsNoRecompute();\n        minCountFraction = minCount\/float(numPixelsInDataset);\n        maxCountFraction = maxCount\/float(numPixelsInDataset);\n    }\n    \/\/\/\/ uniform image\n    if ( minValue == maxValue )\n    {\n        maxValue = minValue+1;\n    }\n\n    \/\/\/\/ binary image\n    else if ( min2ndValue == maxValue )\n    {\n        \/\/ noop; full range is fine\n    }\n\n    \/\/\/\/ triple value image, put middle value in center of gray level ramp\n    else if ( min2ndValue == max2ndValue )\n    {\n        ScalarType minDelta = std::min(min2ndValue-minValue, maxValue-min2ndValue);\n        minValue = min2ndValue - minDelta;\n        maxValue = min2ndValue + minDelta;\n    }\n    \/\/ now we can assume more than three distict scalar values\n\n\n    else\n    {\n        ScalarType innerRange = max2ndValue - min2ndValue;\n        \/\/\/\/ lots of min values -> make different from rest, but not miles away\n        if ( minCountFraction > 0.2 )\n        {\n            ScalarType halfInnerRangeGapMinValue = min2ndValue - innerRange\/2.0;\n            minValue = std::max(minValue, halfInnerRangeGapMinValue);\n        }\n        else\n        \/\/\/\/ few min values -> focus on innerRange\n        {\n            minValue = min2ndValue;\n        }\n\n        \/\/\/\/ lots of max values -> make different from rest\n        if ( maxCountFraction > 0.2 )\n        {\n            ScalarType halfInnerRangeGapMaxValue = max2ndValue + innerRange\/2.0;\n            maxValue = std::min(maxValue, halfInnerRangeGapMaxValue);\n        }\n        else\n        \/\/\/\/ few max values -> focus on innerRange\n        {\n            maxValue = max2ndValue;\n        }\n    }\n\n\n\n  if(guessByCentralSlice)\n  {\n    mitk::ImageSliceSelector::Pointer sliceSelector = mitk::ImageSliceSelector::New();\n      sliceSelector->SetInput(image);\n      sliceSelector->SetSliceNr(image->GetDimension(2)\/2);\n      sliceSelector->SetTimeNr(image->GetDimension(3)\/2);\n      sliceSelector->SetChannelNr(image->GetDimension(4)\/2);\n      sliceSelector->Update();\n\n    mitk::Image* slice = sliceSelector->GetOutput();\n    minValue = slice->GetScalarValue2ndMin();\n    maxValue = slice->GetScalarValue2ndMaxNoRecompute();\n    if (minValue == maxValue)\n    {\n        \/\/ guessByCentralSlice seems to have failed, lets look at all data\n        minValue = image->GetScalarValue2ndMin();\n        maxValue = image->GetScalarValue2ndMaxNoRecompute();\n    }\n  }\n  else\n  {\n    minValue = image->GetScalarValue2ndMin();\n    maxValue = image->GetScalarValue2ndMaxNoRecompute();\n  }\n\n  if (minValue == maxValue)\n  {\n    maxValue = minValue+1;\n  }\n  SetRangeMin(minValue);\n  SetRangeMax(maxValue);\n  SetMinMax(minValue, maxValue);\n}\n\nbool mitk::LevelWindow::SetAutoByPicTags(const ipPicDescriptor* aPic)\n{\n  ipPicDescriptor* pic = const_cast<ipPicDescriptor*>(aPic);\n  if ( pic == NULL )\n  {\n    return false;\n  }\n  ipPicTSV_t *tsv = ipPicQueryTag( pic, \"LEVEL\/WINDOW\" );\n  if( tsv != NULL )\n  {\n    double level = 0;\n    double window = 0;\n    #define GET_C_W( type, tsv, C, W )    \\\n      level = ((type *)tsv->value)[0];    \\\n      window = ((type *)tsv->value)[1];\n\n    ipPicFORALL_2( GET_C_W, tsv, level, window );\n\n    SetLevelWindow( level, window );\n    return true;\n  }\n  return false;\n}\n\nbool mitk::LevelWindow::operator==(const mitk::LevelWindow& levWin) const\n{\n  if ( m_RangeMin == levWin.GetRangeMin() && \n    m_RangeMax == levWin.GetRangeMax() && \n    m_Min == levWin.GetMin() && m_Max == levWin.GetMax()) {\n\n      return true;\n    }\n  else {\n    return false;\n  }\n}\n\nbool mitk::LevelWindow::operator!=(const mitk::LevelWindow& levWin) const\n{\n  if ( m_RangeMin == levWin.GetRangeMin() && \n    m_RangeMax == levWin.GetRangeMax() && \n    m_Min == levWin.GetMin() && m_Max == levWin.GetMax()) {\n\n      return false;\n    }\n  else {\n    return true;\n  }\n}\n\nmitk::LevelWindow& mitk::LevelWindow::operator=(const mitk::LevelWindow& levWin)\n{\n  if (this == &levWin) {\n    return *this;\n  }\n  else {\n    m_RangeMin = levWin.GetRangeMin();\n    m_RangeMax = levWin.GetRangeMax();\n    m_Min= levWin.GetMin();\n    m_Max= levWin.GetMax();\n    return *this;\n  }\n}\n<commit_msg>FIX: the default range for level\/window starts at -2048 now.<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 \"mitkLevelWindow.h\"\n#include \"mitkImageSliceSelector.h\"\n\n#include <ipFunc\/ipFunc.h>\n#include <algorithm>\n\nmitk::LevelWindow::LevelWindow(mitk::ScalarType level, mitk::ScalarType window) : m_Min(level-window\/2.0), m_Max(level+window\/2.0), m_RangeMin(-2048), m_RangeMax(4096)\n{\n\n}\n\nmitk::LevelWindow::LevelWindow(const mitk::LevelWindow& levWin)\n{\n  *this=levWin;\n}\n\nmitk::LevelWindow::~LevelWindow()\n{\n}\n\nmitk::ScalarType mitk::LevelWindow::GetLevel() const\n{\n  return (m_Max-m_Min)\/2.0 + m_Min;\n}\n\nmitk::ScalarType mitk::LevelWindow::GetWindow() const\n{\n  return (m_Max-m_Min);\n}\n\nmitk::ScalarType mitk::LevelWindow::GetMin() const\n{\n  return m_Min;\n}\n\nmitk::ScalarType mitk::LevelWindow::GetMax() const\n{\n  return m_Max;\n}\n\nvoid mitk::LevelWindow::SetLevel(mitk::ScalarType level)\n{\n  mitk::ScalarType halfWindow = (m_Max - m_Min) \/ 2;\n  m_Min = level - halfWindow;\n  m_Max = level + halfWindow;\n\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetWindow(mitk::ScalarType window)\n{\n  mitk::ScalarType level = m_Min + (m_Max - m_Min) \/ 2;\n  mitk::ScalarType halfWindow = window \/ 2;\n\n  m_Min = level - halfWindow;\n  m_Max = level + halfWindow;\n\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetLevelWindow(mitk::ScalarType level, mitk::ScalarType window)\n{\n  m_Min = level - window \/ 2.0;\n  m_Max = level + window \/ 2.0;\n\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetMin(mitk::ScalarType min)\n{\n  m_Min = min;\n  testValues(); \n}\n\nvoid mitk::LevelWindow::SetMax(mitk::ScalarType max)\n{\n  m_Max = max;\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetMinMax(mitk::ScalarType min, mitk::ScalarType max)\n{\n  if(min>max)\n    std::swap(min,max);\n\n  SetMin(min);\n  SetMax(max);\n}\n\nvoid mitk::LevelWindow::SetRangeMin(mitk::ScalarType min)\n{\n  m_RangeMin = min;\n  if(m_RangeMin > m_RangeMax)\n    std::swap(m_RangeMin,m_RangeMax);\n  testValues();\n}\n\nvoid mitk::LevelWindow::SetRangeMax(mitk::ScalarType max)\n{\n  m_RangeMax = max;\n  if(m_RangeMin > m_RangeMax)\n    std::swap(m_RangeMin,m_RangeMax);\n  testValues();\n}\n\nmitk::ScalarType mitk::LevelWindow::GetRangeMin() const\n{\n  return m_RangeMin;\n}\n\nmitk::ScalarType mitk::LevelWindow::GetRangeMax() const\n{\n  return m_RangeMax;\n}\n\nmitk::ScalarType mitk::LevelWindow::GetRange() const\n{\n  return  m_RangeMax - m_RangeMin;\n}\n\n\/*!\nThis method initializes a mitk::LevelWindow from an mitk::Image. The algorithm is as follows:\n  \nDefault to taking the central image slice for quick analysis.\n\nCompute the smallest (minValue), second smallest (min2ndValue), second largest (max2ndValue), and\nlargest (maxValue) data value by traversing the pixel values only once. In the\nsame scan it also computes the count of minValue values and maxValue values.\nAfter that a basic histogram with specific information about the\nextrems is complete.\n\nIf minValue == maxValue, the center slice is uniform and the above scan is repeated for\nthe complete image, not just one slice\n\nNext, special cases of images with only 1, 2 or 3 distinct data values\nhave hand assigned level window ranges.\n\nNext the level window is set relative to the inner range IR = lengthOf([min2ndValue, max2ndValue])\n\nFor count(minValue) > 20% the smallest values are frequent and should be\ndistinct from the min2ndValue and larger values (minValue may be std:min, may signify\nsomething special) hence the lower end of the level window is set to min2ndValue - 0.5 * IR\n \nFor count(minValue) <= 20% the smallest values are not so important and can\nblend with the next ones => min(level window) = min2ndValue\n\nAnd analog for max(level window):\ncount(max2ndValue) > 20%:  max(level window) = max2ndValue + 0.5 * IR\ncount(max2ndValue) < 20%:  max(level window) = max2ndValue\n\nIn both 20%+ cases the level window bounds are clamped to the [minValue, maxValue] range\n\nIn consequence the level window maximizes contrast with minimal amount of\ncomputation and does do useful things if the data contains std::min or\nstd:max values or has only 1 or 2 or 3 data values.\n*\/\nvoid mitk::LevelWindow::SetAuto(mitk::Image* image, bool tryPicTags, bool guessByCentralSlice)\n{\n    if ( image == NULL )\n        return;\n\n    if ( tryPicTags )\n    {\n        if ( SetAutoByPicTags(image->GetPic()) )\n            return;\n    }\n\n    mitk::Image* wholeImage = image;\n    mitk::ImageSliceSelector::Pointer sliceSelector = mitk::ImageSliceSelector::New();\n    if ( guessByCentralSlice )\n    {\n        sliceSelector->SetInput(image);\n        sliceSelector->SetSliceNr(image->GetDimension(2)\/2);\n        sliceSelector->SetTimeNr(image->GetDimension(3)\/2);\n        sliceSelector->SetChannelNr(image->GetDimension(4)\/2);\n        sliceSelector->Update();\n\n        image = sliceSelector->GetOutput();\n    }\n    ScalarType minValue    = image->GetScalarValueMin();\n    ScalarType maxValue    = image->GetScalarValueMaxNoRecompute();\n    ScalarType min2ndValue = image->GetScalarValue2ndMinNoRecompute();\n    ScalarType max2ndValue = image->GetScalarValue2ndMaxNoRecompute();\n    unsigned int numPixelsInSlice = image->GetDimensions()[0];\n    for ( unsigned int k=0;  k<image->GetDimension();  ++k ) numPixelsInSlice *= image->GetDimensions()[k];\n    unsigned int minCount = image->GetCountOfMinValuedVoxelsNoRecompute();\n    unsigned int maxCount = image->GetCountOfMaxValuedVoxelsNoRecompute();\n    float minCountFraction = minCount\/float(numPixelsInSlice);\n    float maxCountFraction = maxCount\/float(numPixelsInSlice);\n    if ( minValue == maxValue )\n    {\n        \/\/ guessByCentralSlice seems to have failed, lets look at all data\n        minValue    = wholeImage->GetScalarValueMin();                   \n        maxValue    = wholeImage->GetScalarValueMaxNoRecompute();        \n        min2ndValue = wholeImage->GetScalarValue2ndMinNoRecompute();  \n        max2ndValue = wholeImage->GetScalarValue2ndMaxNoRecompute();  \n        unsigned int numPixelsInDataset = image->GetDimensions()[0];\n        for ( unsigned int k=0;  k<image->GetDimension();  ++k ) numPixelsInDataset *= image->GetDimensions()[k];\n        minCount = image->GetCountOfMinValuedVoxelsNoRecompute();\n        maxCount = image->GetCountOfMaxValuedVoxelsNoRecompute();\n        minCountFraction = minCount\/float(numPixelsInDataset);\n        maxCountFraction = maxCount\/float(numPixelsInDataset);\n    }\n    \/\/\/\/ uniform image\n    if ( minValue == maxValue )\n    {\n        maxValue = minValue+1;\n    }\n\n    \/\/\/\/ binary image\n    else if ( min2ndValue == maxValue )\n    {\n        \/\/ noop; full range is fine\n    }\n\n    \/\/\/\/ triple value image, put middle value in center of gray level ramp\n    else if ( min2ndValue == max2ndValue )\n    {\n        ScalarType minDelta = std::min(min2ndValue-minValue, maxValue-min2ndValue);\n        minValue = min2ndValue - minDelta;\n        maxValue = min2ndValue + minDelta;\n    }\n    \/\/ now we can assume more than three distict scalar values\n\n\n    else\n    {\n        ScalarType innerRange = max2ndValue - min2ndValue;\n        \/\/\/\/ lots of min values -> make different from rest, but not miles away\n        if ( minCountFraction > 0.2 )\n        {\n            ScalarType halfInnerRangeGapMinValue = min2ndValue - innerRange\/2.0;\n            minValue = std::max(minValue, halfInnerRangeGapMinValue);\n        }\n        else\n        \/\/\/\/ few min values -> focus on innerRange\n        {\n            minValue = min2ndValue;\n        }\n\n        \/\/\/\/ lots of max values -> make different from rest\n        if ( maxCountFraction > 0.2 )\n        {\n            ScalarType halfInnerRangeGapMaxValue = max2ndValue + innerRange\/2.0;\n            maxValue = std::min(maxValue, halfInnerRangeGapMaxValue);\n        }\n        else\n        \/\/\/\/ few max values -> focus on innerRange\n        {\n            maxValue = max2ndValue;\n        }\n    }\n\n\n\n  if(guessByCentralSlice)\n  {\n    mitk::ImageSliceSelector::Pointer sliceSelector = mitk::ImageSliceSelector::New();\n      sliceSelector->SetInput(image);\n      sliceSelector->SetSliceNr(image->GetDimension(2)\/2);\n      sliceSelector->SetTimeNr(image->GetDimension(3)\/2);\n      sliceSelector->SetChannelNr(image->GetDimension(4)\/2);\n      sliceSelector->Update();\n\n    mitk::Image* slice = sliceSelector->GetOutput();\n    minValue = slice->GetScalarValue2ndMin();\n    maxValue = slice->GetScalarValue2ndMaxNoRecompute();\n    if (minValue == maxValue)\n    {\n        \/\/ guessByCentralSlice seems to have failed, lets look at all data\n        minValue = image->GetScalarValue2ndMin();\n        maxValue = image->GetScalarValue2ndMaxNoRecompute();\n    }\n  }\n  else\n  {\n    minValue = image->GetScalarValue2ndMin();\n    maxValue = image->GetScalarValue2ndMaxNoRecompute();\n  }\n\n  if (minValue == maxValue)\n  {\n    maxValue = minValue+1;\n  }\n  SetRangeMin(minValue);\n  SetRangeMax(maxValue);\n  SetMinMax(minValue, maxValue);\n}\n\nbool mitk::LevelWindow::SetAutoByPicTags(const ipPicDescriptor* aPic)\n{\n  ipPicDescriptor* pic = const_cast<ipPicDescriptor*>(aPic);\n  if ( pic == NULL )\n  {\n    return false;\n  }\n  ipPicTSV_t *tsv = ipPicQueryTag( pic, \"LEVEL\/WINDOW\" );\n  if( tsv != NULL )\n  {\n    double level = 0;\n    double window = 0;\n    #define GET_C_W( type, tsv, C, W )    \\\n      level = ((type *)tsv->value)[0];    \\\n      window = ((type *)tsv->value)[1];\n\n    ipPicFORALL_2( GET_C_W, tsv, level, window );\n\n    SetLevelWindow( level, window );\n    return true;\n  }\n  return false;\n}\n\nbool mitk::LevelWindow::operator==(const mitk::LevelWindow& levWin) const\n{\n  if ( m_RangeMin == levWin.GetRangeMin() && \n    m_RangeMax == levWin.GetRangeMax() && \n    m_Min == levWin.GetMin() && m_Max == levWin.GetMax()) {\n\n      return true;\n    }\n  else {\n    return false;\n  }\n}\n\nbool mitk::LevelWindow::operator!=(const mitk::LevelWindow& levWin) const\n{\n  if ( m_RangeMin == levWin.GetRangeMin() && \n    m_RangeMax == levWin.GetRangeMax() && \n    m_Min == levWin.GetMin() && m_Max == levWin.GetMax()) {\n\n      return false;\n    }\n  else {\n    return true;\n  }\n}\n\nmitk::LevelWindow& mitk::LevelWindow::operator=(const mitk::LevelWindow& levWin)\n{\n  if (this == &levWin) {\n    return *this;\n  }\n  else {\n    m_RangeMin = levWin.GetRangeMin();\n    m_RangeMax = levWin.GetRangeMax();\n    m_Min= levWin.GetMin();\n    m_Max= levWin.GetMax();\n    return *this;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Base.h\"\n#include \"GoogleStoreFront.h\"\n#include \"storefront\/StoreListener.h\"\n#include <jni.h>\n#include <android_native_app_glue.h>\n\n\n\nextern struct android_app* __state;\nextern jclass __mainActivityClass;\n\n\nnamespace gameplay\n{\n    class GoogleStoreFront;\n}\n\nstatic gameplay::GoogleStoreFront * __instance = NULL;\nstatic std::vector< gameplay::StoreProduct > __products;\nstatic std::set<std::string> __requestedProducts;\nstatic bool __iabEnabled = false;\nstatic jmethodID __midQueueSKURequest;\nstatic jmethodID __midFlushSkuDetailsQueue;\nstatic jmethodID __midPurchaseItem;\nstatic jmethodID __midRestorePurchases;\n\nextern \"C\"\n{\n\nJNIEXPORT jint JNICALL GameplayJNI_OnLoad(JavaVM *vm, void *reserved)\n{\n    JNIEnv* env = NULL;\n    vm->GetEnv((void **)&env, JNI_VERSION_1_6);\n\n    __mainActivityClass = (jclass)env->NewGlobalRef(env->FindClass(\"org\/gameplay3d\/GamePlayNativeActivity\"));\n    __midQueueSKURequest = env->GetMethodID(__mainActivityClass, \"queueSkuDetailsRequest\", \"(Ljava\/lang\/String;)V\");\n    __midFlushSkuDetailsQueue = env->GetMethodID(__mainActivityClass, \"flushSkuDetailsQueue\", \"()V\");\n    __midPurchaseItem = env->GetMethodID(__mainActivityClass, \"purchaseItem\", \"(Ljava\/lang\/String;)V\");\n    __midRestorePurchases = env->GetMethodID(__mainActivityClass, \"restorePurchases\", \"()V\");\n\n    return JNI_VERSION_1_6;\n}\n\n\/\/ JNI stuff\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_setIABEnabled(JNIEnv* env, jobject thiz)\n{\n    __iabEnabled = true;\n}\n\nJNIEXPORT int Java_org_gameplay3d_GamePlayNativeActivity_isItemConsumable(JNIEnv* env, jobject thiz, jstring sku)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    bool res = __instance->getListener()->isProductConsumable(productID);\n    env->ReleaseStringUTFChars(sku, productID);\n\n    return res ? 1 : 0;\n}\n\nJNIEXPORT int Java_org_gameplay3d_GamePlayNativeActivity_isSubscription(JNIEnv* env, jobject thiz, jstring sku)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    bool res = __instance->getListener()->isSubscription(productID);\n    env->ReleaseStringUTFChars(sku, productID);\n\n    return res ? 1 : 0;\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_itemRestored(JNIEnv* env, jobject thiz, jstring sku, jlong time, jstring orderId)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    const char* orderID = env->GetStringUTFChars(orderId, NULL);\n\n    __instance->getListener()->paymentTransactionRestoredEvent(productID, 1, time, orderID, NULL);\n\n    env->ReleaseStringUTFChars(orderId, orderID);\n    env->ReleaseStringUTFChars(sku, productID);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_itemPurchased(JNIEnv* env, jobject thiz, jstring sku, jlong time, jstring orderId)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    const char* orderID = env->GetStringUTFChars(orderId, NULL);\n\n    __instance->getListener()->paymentTransactionSucceededEvent(productID, 1, time, orderID, NULL);\n\n    env->ReleaseStringUTFChars(orderId, orderID);\n    env->ReleaseStringUTFChars(sku, productID);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_itemPurchaseFailed(JNIEnv* env, jobject thiz, jstring sku, jint error, jstring message)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    const char* msg = env->GetStringUTFChars(message, NULL);\n\n    __instance->getListener()->paymentTransactionFailedEvent(productID, 1, error, msg);\n\n    env->ReleaseStringUTFChars(message, msg);\n    env->ReleaseStringUTFChars(sku, productID);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_getProductsFailed(JNIEnv* env, jobject thiz, jint error, jstring message)\n{\n    const char* msg = env->GetStringUTFChars(message, NULL);\n    if (__instance)\n        __instance->getListener()->getProductsFailedEvent(error, msg);\n    env->ReleaseStringUTFChars(message, msg);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_productValidated(JNIEnv* env, jobject thiz, jstring sku, jstring price, jstring title, jstring descr, jstring priceAmount, jstring priceCurrency)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    const char* cPrice = env->GetStringUTFChars(price, NULL);\n    const char* cTitle = env->GetStringUTFChars(title, NULL);\n    const char* cDescr = env->GetStringUTFChars(descr, NULL);\n    const char* cPriceAmount = env->GetStringUTFChars(priceAmount, NULL);\n    const char* cPriceCurrency = env->GetStringUTFChars(priceCurrency, NULL);\n\n    gameplay::StoreProduct product(productID, cTitle, cDescr, static_cast<float>(atoi(cPriceAmount)) * 0.000001f, cPrice, cPriceCurrency);\n    __products.push_back(product);\n\n    env->ReleaseStringUTFChars(sku, productID);\n    env->ReleaseStringUTFChars(price, cPrice);\n    env->ReleaseStringUTFChars(title, cTitle);\n    env->ReleaseStringUTFChars(descr, cDescr);\n    env->ReleaseStringUTFChars(priceAmount, cPriceAmount);\n    env->ReleaseStringUTFChars(priceCurrency, cPriceCurrency);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_finishProductsValidation(JNIEnv* env, jobject thiz)\n{\n    std::vector<std::string> invalidProducts;\n    for (const std::string &product : __requestedProducts)\n    {\n        if (std::find_if(__products.begin(), __products.end(), [&](const gameplay::StoreProduct& p){return p.id == product; }) == __products.end())\n            invalidProducts.push_back(product);\n    }\n\n    __instance->getListener()->getProductsEvent(__products, invalidProducts);\n}\n\n}\n\n\n\n\nnamespace gameplay\n{\n\n\n\nGoogleStoreFront::GoogleStoreFront()\n    : _listener( NULL )\n{\n    __instance = this;\n}\n\nGoogleStoreFront::~GoogleStoreFront()\n{\n}\n\nvoid GoogleStoreFront::setListener(StoreListener * listener)\n{\n    _listener = listener;\n}\n\nStoreListener * GoogleStoreFront::getListener()\n{\n    return _listener;\n}\n\nvoid GoogleStoreFront::getProducts(const char ** productIDs) const\n{\n    __products.clear();\n    __requestedProducts.clear();\n\n    android_app* app = __state;\n    JNIEnv* env = app->activity->env;\n    JavaVM* vm = app->activity->vm;\n    vm->AttachCurrentThread(&env, NULL);\n\n    while (*productIDs)\n    {\n        __requestedProducts.insert(*productIDs);\n\n        jstring paramString = env->NewStringUTF(*productIDs++);\n        env->CallVoidMethod(app->activity->clazz, __midQueueSKURequest, paramString);\n    }\n\n    env->CallVoidMethod(app->activity->clazz, __midFlushSkuDetailsQueue);\n\n    vm->DetachCurrentThread();\n}\n\nvoid GoogleStoreFront::makePayment(const char * productID, int quantity, const char * usernameHash)\n{\n    android_app* app = __state;\n    JNIEnv* env = app->activity->env;\n    JavaVM* vm = app->activity->vm;\n    vm->AttachCurrentThread(&env, NULL);\n\n    jstring paramString = env->NewStringUTF(productID);\n\n    while (quantity-- > 0)\n        env->CallVoidMethod(app->activity->clazz, __midPurchaseItem, paramString);\n\n    vm->DetachCurrentThread();\n\n    getListener()->paymentTransactionInProcessEvent(productID, quantity);\n}\n\nbool GoogleStoreFront::canMakePayments() const\n{\n    return __iabEnabled;\n}\n\nvoid GoogleStoreFront::restoreTransactions(const char * usernameHash)\n{\n    android_app* app = __state;\n    JNIEnv* env = app->activity->env;\n    JavaVM* vm = app->activity->vm;\n    vm->AttachCurrentThread(&env, NULL);\n\n    env->CallVoidMethod(app->activity->clazz, __midRestorePurchases);\n\n    vm->DetachCurrentThread();\n}\n\nfloat GoogleStoreFront::getShippingCost(const StoreProduct& product, int quantity) const\n{\n    return product.price * quantity * 0.3f;\n}\n\nvoid GoogleStoreFront::finishTransaction(void * transactionObject)\n{\n    \/\/ do nothing\n}\n\nvoid GoogleStoreFront::requestReceipt()\n{\n    GP_ASSERT(!\"Not implemented.\")\n}\n\n}<commit_msg>clear google products after flushing and sending to client app<commit_after>#include \"Base.h\"\n#include \"GoogleStoreFront.h\"\n#include \"storefront\/StoreListener.h\"\n#include <jni.h>\n#include <android_native_app_glue.h>\n\n\n\nextern struct android_app* __state;\nextern jclass __mainActivityClass;\n\n\nnamespace gameplay\n{\n    class GoogleStoreFront;\n}\n\nstatic gameplay::GoogleStoreFront * __instance = NULL;\nstatic std::vector< gameplay::StoreProduct > __products;\nstatic std::set<std::string> __requestedProducts;\nstatic bool __iabEnabled = false;\nstatic jmethodID __midQueueSKURequest;\nstatic jmethodID __midFlushSkuDetailsQueue;\nstatic jmethodID __midPurchaseItem;\nstatic jmethodID __midRestorePurchases;\n\nextern \"C\"\n{\n\nJNIEXPORT jint JNICALL GameplayJNI_OnLoad(JavaVM *vm, void *reserved)\n{\n    JNIEnv* env = NULL;\n    vm->GetEnv((void **)&env, JNI_VERSION_1_6);\n\n    __mainActivityClass = (jclass)env->NewGlobalRef(env->FindClass(\"org\/gameplay3d\/GamePlayNativeActivity\"));\n    __midQueueSKURequest = env->GetMethodID(__mainActivityClass, \"queueSkuDetailsRequest\", \"(Ljava\/lang\/String;)V\");\n    __midFlushSkuDetailsQueue = env->GetMethodID(__mainActivityClass, \"flushSkuDetailsQueue\", \"()V\");\n    __midPurchaseItem = env->GetMethodID(__mainActivityClass, \"purchaseItem\", \"(Ljava\/lang\/String;)V\");\n    __midRestorePurchases = env->GetMethodID(__mainActivityClass, \"restorePurchases\", \"()V\");\n\n    return JNI_VERSION_1_6;\n}\n\n\/\/ JNI stuff\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_setIABEnabled(JNIEnv* env, jobject thiz)\n{\n    __iabEnabled = true;\n}\n\nJNIEXPORT int Java_org_gameplay3d_GamePlayNativeActivity_isItemConsumable(JNIEnv* env, jobject thiz, jstring sku)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    bool res = __instance->getListener()->isProductConsumable(productID);\n    env->ReleaseStringUTFChars(sku, productID);\n\n    return res ? 1 : 0;\n}\n\nJNIEXPORT int Java_org_gameplay3d_GamePlayNativeActivity_isSubscription(JNIEnv* env, jobject thiz, jstring sku)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    bool res = __instance->getListener()->isSubscription(productID);\n    env->ReleaseStringUTFChars(sku, productID);\n\n    return res ? 1 : 0;\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_itemRestored(JNIEnv* env, jobject thiz, jstring sku, jlong time, jstring orderId)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    const char* orderID = env->GetStringUTFChars(orderId, NULL);\n\n    __instance->getListener()->paymentTransactionRestoredEvent(productID, 1, time, orderID, NULL);\n\n    env->ReleaseStringUTFChars(orderId, orderID);\n    env->ReleaseStringUTFChars(sku, productID);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_itemPurchased(JNIEnv* env, jobject thiz, jstring sku, jlong time, jstring orderId)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    const char* orderID = env->GetStringUTFChars(orderId, NULL);\n\n    __instance->getListener()->paymentTransactionSucceededEvent(productID, 1, time, orderID, NULL);\n\n    env->ReleaseStringUTFChars(orderId, orderID);\n    env->ReleaseStringUTFChars(sku, productID);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_itemPurchaseFailed(JNIEnv* env, jobject thiz, jstring sku, jint error, jstring message)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    const char* msg = env->GetStringUTFChars(message, NULL);\n\n    __instance->getListener()->paymentTransactionFailedEvent(productID, 1, error, msg);\n\n    env->ReleaseStringUTFChars(message, msg);\n    env->ReleaseStringUTFChars(sku, productID);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_getProductsFailed(JNIEnv* env, jobject thiz, jint error, jstring message)\n{\n    const char* msg = env->GetStringUTFChars(message, NULL);\n    if (__instance)\n        __instance->getListener()->getProductsFailedEvent(error, msg);\n    env->ReleaseStringUTFChars(message, msg);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_productValidated(JNIEnv* env, jobject thiz, jstring sku, jstring price, jstring title, jstring descr, jstring priceAmount, jstring priceCurrency)\n{\n    const char* productID = env->GetStringUTFChars(sku, NULL);\n    const char* cPrice = env->GetStringUTFChars(price, NULL);\n    const char* cTitle = env->GetStringUTFChars(title, NULL);\n    const char* cDescr = env->GetStringUTFChars(descr, NULL);\n    const char* cPriceAmount = env->GetStringUTFChars(priceAmount, NULL);\n    const char* cPriceCurrency = env->GetStringUTFChars(priceCurrency, NULL);\n\n    gameplay::StoreProduct product(productID, cTitle, cDescr, static_cast<float>(atoi(cPriceAmount)) * 0.000001f, cPrice, cPriceCurrency);\n    __products.push_back(product);\n\n    env->ReleaseStringUTFChars(sku, productID);\n    env->ReleaseStringUTFChars(price, cPrice);\n    env->ReleaseStringUTFChars(title, cTitle);\n    env->ReleaseStringUTFChars(descr, cDescr);\n    env->ReleaseStringUTFChars(priceAmount, cPriceAmount);\n    env->ReleaseStringUTFChars(priceCurrency, cPriceCurrency);\n}\n\nJNIEXPORT void Java_org_gameplay3d_GamePlayNativeActivity_finishProductsValidation(JNIEnv* env, jobject thiz)\n{\n    std::vector<std::string> invalidProducts;\n    for (const std::string &product : __requestedProducts)\n    {\n        if (std::find_if(__products.begin(), __products.end(), [&](const gameplay::StoreProduct& p){return p.id == product; }) == __products.end())\n            invalidProducts.push_back(product);\n    }\n\n    __instance->getListener()->getProductsEvent(__products, invalidProducts);\n    __products.clear();\n}\n\n}\n\n\n\n\nnamespace gameplay\n{\n\n\n\nGoogleStoreFront::GoogleStoreFront()\n    : _listener( NULL )\n{\n    __instance = this;\n}\n\nGoogleStoreFront::~GoogleStoreFront()\n{\n}\n\nvoid GoogleStoreFront::setListener(StoreListener * listener)\n{\n    _listener = listener;\n}\n\nStoreListener * GoogleStoreFront::getListener()\n{\n    return _listener;\n}\n\nvoid GoogleStoreFront::getProducts(const char ** productIDs) const\n{\n    __products.clear();\n    __requestedProducts.clear();\n\n    android_app* app = __state;\n    JNIEnv* env = app->activity->env;\n    JavaVM* vm = app->activity->vm;\n    vm->AttachCurrentThread(&env, NULL);\n\n    while (*productIDs)\n    {\n        __requestedProducts.insert(*productIDs);\n\n        jstring paramString = env->NewStringUTF(*productIDs++);\n        env->CallVoidMethod(app->activity->clazz, __midQueueSKURequest, paramString);\n    }\n\n    env->CallVoidMethod(app->activity->clazz, __midFlushSkuDetailsQueue);\n\n    vm->DetachCurrentThread();\n}\n\nvoid GoogleStoreFront::makePayment(const char * productID, int quantity, const char * usernameHash)\n{\n    android_app* app = __state;\n    JNIEnv* env = app->activity->env;\n    JavaVM* vm = app->activity->vm;\n    vm->AttachCurrentThread(&env, NULL);\n\n    jstring paramString = env->NewStringUTF(productID);\n\n    while (quantity-- > 0)\n        env->CallVoidMethod(app->activity->clazz, __midPurchaseItem, paramString);\n\n    vm->DetachCurrentThread();\n\n    getListener()->paymentTransactionInProcessEvent(productID, quantity);\n}\n\nbool GoogleStoreFront::canMakePayments() const\n{\n    return __iabEnabled;\n}\n\nvoid GoogleStoreFront::restoreTransactions(const char * usernameHash)\n{\n    android_app* app = __state;\n    JNIEnv* env = app->activity->env;\n    JavaVM* vm = app->activity->vm;\n    vm->AttachCurrentThread(&env, NULL);\n\n    env->CallVoidMethod(app->activity->clazz, __midRestorePurchases);\n\n    vm->DetachCurrentThread();\n}\n\nfloat GoogleStoreFront::getShippingCost(const StoreProduct& product, int quantity) const\n{\n    return product.price * quantity * 0.3f;\n}\n\nvoid GoogleStoreFront::finishTransaction(void * transactionObject)\n{\n    \/\/ do nothing\n}\n\nvoid GoogleStoreFront::requestReceipt()\n{\n    GP_ASSERT(!\"Not implemented.\")\n}\n\n}<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\nLanguage:  C++\nDate:      $Date: 2009-05-12 19:56:03 +0200 (Di, 12 Mai 2009) $\nVersion:   $Revision: 17179 $\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 \"QmitkOverlayController.h\"\n\n#include \"QmitkRenderWindow.h\"\n#include \"QmitkOverlay.h\"\n\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n\n#include <algorithm>\n\n\nQmitkOverlayController::QmitkOverlayController( QmitkRenderWindow* rw, mitk::PropertyList* pl )\n: QObject(), m_RenderWindow( rw ), m_PropertyList( pl )\n{\n  this->InitializeOverlayLayout();\n  this->AdjustOverlayPosition();\n  this->SetOverlayVisibility( true );\n\n  if ( m_PropertyList.IsNull() )\n    m_PropertyList = mitk::PropertyList::New();\n\n}\n\nQmitkOverlayController::~QmitkOverlayController()\n{\n}\n\nvoid QmitkOverlayController::InitializeOverlayLayout()\n{\n  \n  this->InitializeWidget( QmitkOverlay::top_Left );\n  this->InitializeWidget( QmitkOverlay::top_Center );\n  this->InitializeWidget( QmitkOverlay::top_Right );\n  this->InitializeWidget( QmitkOverlay::middle_Left );\n  this->InitializeWidget( QmitkOverlay::middle_Right );\n  this->InitializeWidget( QmitkOverlay::bottom_Left );\n  this->InitializeWidget( QmitkOverlay::bottom_Center );\n  this->InitializeWidget( QmitkOverlay::bottom_Right );\n\n}\n\nvoid QmitkOverlayController::InitializeWidget( QmitkOverlay::DisplayPosition pos )\n{\n  m_PositionedOverlays[ pos ] = new QWidget( m_RenderWindow, Qt::Tool | Qt::FramelessWindowHint );\n  m_PositionedOverlays[ pos ]->setAutoFillBackground(false);\n  m_PositionedOverlays[ pos ]->setAttribute( Qt::WA_TranslucentBackground, true );\n  \/\/m_PositionedOverlays[ pos ]->setAttribute( Qt::WA_MacAlwaysShowToolWindow, true );\n  \/\/m_PositionedOverlays[ pos ]->setAttribute( Qt::WA_MacShowFocusRect, false );\n  m_PositionedOverlays[ pos ]->setFocusPolicy( Qt::NoFocus );\n  QPalette p = QPalette();\n  p.setColor( QPalette::Window, Qt::transparent );\n  m_PositionedOverlays[ pos ]->setPalette( p );\n\n\n  switch ( pos )\n  {\n  case QmitkOverlay::top_Left : \n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::TopToBottom );\n      layout->setAlignment( Qt::AlignLeft );\n      break;\n    }\n  case QmitkOverlay::top_Center : \n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::TopToBottom );\n      layout->setAlignment( Qt::AlignCenter );\n      layout->setAlignment( Qt::AlignLeft );\n      break;\n    }\n  case QmitkOverlay::top_Right :\n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::TopToBottom );\n      layout->setAlignment( Qt::AlignRight );\n      break;\n    }\n  case QmitkOverlay::middle_Left : \n    {\n      QHBoxLayout* layout = new QHBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::LeftToRight );\n      layout->setAlignment( Qt::AlignLeft );\n      break;\n\n    }\n  case QmitkOverlay::middle_Right : \n    {\n      QHBoxLayout* layout = new QHBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::RightToLeft );\n      layout->setAlignment( Qt::AlignRight );\n      break;\n    }\n  case QmitkOverlay::bottom_Left : \n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::BottomToTop );\n      layout->setAlignment( Qt::AlignLeft );\n      break;\n    }\n  case QmitkOverlay::bottom_Center : \n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::BottomToTop );\n      layout->setAlignment( Qt::AlignCenter );\n      break;\n    }\n  case QmitkOverlay::bottom_Right :\n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::BottomToTop );\n      layout->setAlignment( Qt::AlignRight );\n      break;\n    }\n  }\n}\n\nvoid QmitkOverlayController::AdjustOverlayPosition()\n{\n\n  if ( m_PositionedOverlays[ QmitkOverlay::top_Left ]->isVisible() )\n  {\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint(0,0) );\n    m_PositionedOverlays[ QmitkOverlay::top_Left ]->move( pos.x(), pos.y() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::top_Center ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::top_Center ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( m_RenderWindow->size().width()\/2, 0 ) ) ;\n    widget->move( pos.x() - widget->size().width()\/2, pos.y() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::top_Right ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::top_Right ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( m_RenderWindow->size().width(), 0 ) ) ;\n    widget->move( pos.x() - widget->size().width(), pos.y() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::middle_Left ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::middle_Left ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( 0, m_RenderWindow->size().height()\/2 ) ) ;\n    widget->move( pos.x(), pos.y() - widget->size().height()\/2 );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::middle_Right ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::middle_Right ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( m_RenderWindow->size().width(), m_RenderWindow->size().height()\/2 ) ) ;\n    widget->move( pos.x() - widget->size().width(), pos.y() - widget->size().height()\/2 );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::bottom_Left ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::bottom_Left ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( 0, m_RenderWindow->size().height() ) ) ;\n    widget->move( pos.x(), pos.y() - widget->size().height() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::bottom_Center ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::bottom_Center ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint(  m_RenderWindow->size().width()\/2, m_RenderWindow->size().height() ) ) ;\n    widget->move( pos.x() - widget->size().width()\/2, pos.y() - widget->size().height() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::bottom_Right ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::bottom_Right ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint(  m_RenderWindow->size().width(), m_RenderWindow->size().height() ) ) ;\n    widget->move( pos.x() - widget->size().width(), pos.y() - widget->size().height() );\n  }\n\n}\n\n\nvoid QmitkOverlayController::SetOverlayVisibility( bool visible )\n{\n  foreach( QmitkOverlay* overlay, m_AllOverlays )\n  {\n    if ( visible )\n    {\n      MITK_INFO << \"Setting visible\";\n      overlay->GetWidget()->show();\n    }\n    else\n    {\n      MITK_INFO << \"hiding\";\n      overlay->GetWidget()->hide();\n    }\n  }\n}\n\n\nvoid QmitkOverlayController::AddOverlay( QmitkOverlay* overlay )\n{\n  if ( overlay != NULL )\n  {\n    QmitkOverlay::DisplayPosition pos = overlay->GetPosition();\n    unsigned int layer = overlay->GetLayer();\n\n    m_PropertyList->ConcatenatePropertyList( m_RenderWindow->GetRenderer()->GetRenderingManager()->GetPropertyList(), false );\n\n    overlay->GenerateData( m_PropertyList );\n\n    overlay->GetWidget()->setParent( m_PositionedOverlays[ pos ] );\n\n    int stackLayer = dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ pos ]->layout() )->isEmpty() ? 0 : layer;\n  \n    switch ( pos )\n    {\n      case QmitkOverlay::top_Left : {}\n      case QmitkOverlay::middle_Left : {}\n      case QmitkOverlay::bottom_Left : \n        {\n          dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ pos ]->layout() )->insertWidget( overlay->GetLayer(), overlay->GetWidget(), stackLayer, Qt::AlignLeft );    \n          break;\n        }\n      case QmitkOverlay::top_Center : {}\n      case QmitkOverlay::bottom_Center :\n        {\n          dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ pos ]->layout() )->insertWidget( overlay->GetLayer(), overlay->GetWidget(), stackLayer, Qt::AlignCenter );\n          break;\n        }\n      case QmitkOverlay::top_Right : {}\n      case QmitkOverlay::middle_Right : {}\n      case QmitkOverlay::bottom_Right : \n        {\n          dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ pos ]->layout() )->insertWidget( overlay->GetLayer(), overlay->GetWidget(), stackLayer, Qt::AlignRight );    \n          break;\n        }\n    }\n\n    m_PositionedOverlays[ pos ]->show();\n    this->AdjustOverlayPosition();\n  }\n}\n\n\n\nvoid QmitkOverlayController::AlignOverlays()\n{\n  \/\/MITK_INFO << \"mitkOverlayController::AlignOverlays\";\n\n  \/\/OverlayVector::iterator overlayIter;\n\n  \/\/for ( overlayIter=m_AllOverlays.begin(); overlayIter!=m_AllOverlays.end(); overlayIter++ )\n  \/\/{\n  \/\/  int stackLayer = dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ (*overlayIter)->GetPosition() ]->layout() )->isEmpty() ? 0 : layer;\n  \/\/  dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ (*overlayIter)->GetPosition() ]->layout() )->addWidget( (*overlayIter)->GetWidget(), stackLayer, Qt::AlignLeft );\n  \/\/}\n}<commit_msg>ENH (#3463): adding MITK_ERROR in case an invalied QmitkRenderWindow has been set<commit_after>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\nLanguage:  C++\nDate:      $Date: 2009-05-12 19:56:03 +0200 (Di, 12 Mai 2009) $\nVersion:   $Revision: 17179 $\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 \"QmitkOverlayController.h\"\n\n#include \"QmitkRenderWindow.h\"\n#include \"QmitkOverlay.h\"\n\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n\n#include <algorithm>\n\n\nQmitkOverlayController::QmitkOverlayController( QmitkRenderWindow* rw, mitk::PropertyList* pl )\n: QObject(), m_RenderWindow( rw ), m_PropertyList( pl )\n{\n  if ( m_RenderWindow == NULL )\n  {\n    MITK_ERROR << \"invalid QmitkRenderWindow\";\n    return;\n  }\n\n  this->InitializeOverlayLayout();\n  this->AdjustOverlayPosition();\n  this->SetOverlayVisibility( true );\n\n  if ( m_PropertyList.IsNull() )\n    m_PropertyList = mitk::PropertyList::New();\n\n}\n\nQmitkOverlayController::~QmitkOverlayController()\n{\n}\n\nvoid QmitkOverlayController::InitializeOverlayLayout()\n{\n  \n  this->InitializeWidget( QmitkOverlay::top_Left );\n  this->InitializeWidget( QmitkOverlay::top_Center );\n  this->InitializeWidget( QmitkOverlay::top_Right );\n  this->InitializeWidget( QmitkOverlay::middle_Left );\n  this->InitializeWidget( QmitkOverlay::middle_Right );\n  this->InitializeWidget( QmitkOverlay::bottom_Left );\n  this->InitializeWidget( QmitkOverlay::bottom_Center );\n  this->InitializeWidget( QmitkOverlay::bottom_Right );\n\n}\n\nvoid QmitkOverlayController::InitializeWidget( QmitkOverlay::DisplayPosition pos )\n{\n  m_PositionedOverlays[ pos ] = new QWidget( m_RenderWindow, Qt::Tool | Qt::FramelessWindowHint );\n  m_PositionedOverlays[ pos ]->setAutoFillBackground(false);\n  m_PositionedOverlays[ pos ]->setAttribute( Qt::WA_TranslucentBackground, true );\n  \/\/m_PositionedOverlays[ pos ]->setAttribute( Qt::WA_MacAlwaysShowToolWindow, true );\n  \/\/m_PositionedOverlays[ pos ]->setAttribute( Qt::WA_MacShowFocusRect, false );\n  m_PositionedOverlays[ pos ]->setFocusPolicy( Qt::NoFocus );\n  QPalette p = QPalette();\n  p.setColor( QPalette::Window, Qt::transparent );\n  m_PositionedOverlays[ pos ]->setPalette( p );\n\n\n  switch ( pos )\n  {\n  case QmitkOverlay::top_Left : \n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::TopToBottom );\n      layout->setAlignment( Qt::AlignLeft );\n      break;\n    }\n  case QmitkOverlay::top_Center : \n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::TopToBottom );\n      layout->setAlignment( Qt::AlignCenter );\n      layout->setAlignment( Qt::AlignLeft );\n      break;\n    }\n  case QmitkOverlay::top_Right :\n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::TopToBottom );\n      layout->setAlignment( Qt::AlignRight );\n      break;\n    }\n  case QmitkOverlay::middle_Left : \n    {\n      QHBoxLayout* layout = new QHBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::LeftToRight );\n      layout->setAlignment( Qt::AlignLeft );\n      break;\n\n    }\n  case QmitkOverlay::middle_Right : \n    {\n      QHBoxLayout* layout = new QHBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::RightToLeft );\n      layout->setAlignment( Qt::AlignRight );\n      break;\n    }\n  case QmitkOverlay::bottom_Left : \n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::BottomToTop );\n      layout->setAlignment( Qt::AlignLeft );\n      break;\n    }\n  case QmitkOverlay::bottom_Center : \n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::BottomToTop );\n      layout->setAlignment( Qt::AlignCenter );\n      break;\n    }\n  case QmitkOverlay::bottom_Right :\n    {\n      QVBoxLayout* layout = new QVBoxLayout( m_PositionedOverlays[ pos ] );\n      layout->setDirection( QBoxLayout::BottomToTop );\n      layout->setAlignment( Qt::AlignRight );\n      break;\n    }\n  }\n}\n\nvoid QmitkOverlayController::AdjustOverlayPosition()\n{\n\n  if ( m_PositionedOverlays[ QmitkOverlay::top_Left ]->isVisible() )\n  {\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint(0,0) );\n    m_PositionedOverlays[ QmitkOverlay::top_Left ]->move( pos.x(), pos.y() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::top_Center ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::top_Center ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( m_RenderWindow->size().width()\/2, 0 ) ) ;\n    widget->move( pos.x() - widget->size().width()\/2, pos.y() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::top_Right ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::top_Right ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( m_RenderWindow->size().width(), 0 ) ) ;\n    widget->move( pos.x() - widget->size().width(), pos.y() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::middle_Left ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::middle_Left ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( 0, m_RenderWindow->size().height()\/2 ) ) ;\n    widget->move( pos.x(), pos.y() - widget->size().height()\/2 );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::middle_Right ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::middle_Right ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( m_RenderWindow->size().width(), m_RenderWindow->size().height()\/2 ) ) ;\n    widget->move( pos.x() - widget->size().width(), pos.y() - widget->size().height()\/2 );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::bottom_Left ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::bottom_Left ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint( 0, m_RenderWindow->size().height() ) ) ;\n    widget->move( pos.x(), pos.y() - widget->size().height() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::bottom_Center ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::bottom_Center ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint(  m_RenderWindow->size().width()\/2, m_RenderWindow->size().height() ) ) ;\n    widget->move( pos.x() - widget->size().width()\/2, pos.y() - widget->size().height() );\n  }\n\n  if ( m_PositionedOverlays[ QmitkOverlay::bottom_Right ]->isVisible() )\n  {\n    QWidget* widget = m_PositionedOverlays[ QmitkOverlay::bottom_Right ];\n    QPoint pos = m_RenderWindow->mapToGlobal( QPoint(  m_RenderWindow->size().width(), m_RenderWindow->size().height() ) ) ;\n    widget->move( pos.x() - widget->size().width(), pos.y() - widget->size().height() );\n  }\n\n}\n\n\nvoid QmitkOverlayController::SetOverlayVisibility( bool visible )\n{\n  foreach( QmitkOverlay* overlay, m_AllOverlays )\n  {\n    if ( visible )\n    {\n      MITK_INFO << \"Setting visible\";\n      overlay->GetWidget()->show();\n    }\n    else\n    {\n      MITK_INFO << \"hiding\";\n      overlay->GetWidget()->hide();\n    }\n  }\n}\n\n\nvoid QmitkOverlayController::AddOverlay( QmitkOverlay* overlay )\n{\n  if ( overlay != NULL )\n  {\n    QmitkOverlay::DisplayPosition pos = overlay->GetPosition();\n    unsigned int layer = overlay->GetLayer();\n\n    m_PropertyList->ConcatenatePropertyList( m_RenderWindow->GetRenderer()->GetRenderingManager()->GetPropertyList(), false );\n\n    overlay->GenerateData( m_PropertyList );\n\n    overlay->GetWidget()->setParent( m_PositionedOverlays[ pos ] );\n\n    int stackLayer = dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ pos ]->layout() )->isEmpty() ? 0 : layer;\n  \n    switch ( pos )\n    {\n      case QmitkOverlay::top_Left : {}\n      case QmitkOverlay::middle_Left : {}\n      case QmitkOverlay::bottom_Left : \n        {\n          dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ pos ]->layout() )->insertWidget( overlay->GetLayer(), overlay->GetWidget(), stackLayer, Qt::AlignLeft );    \n          break;\n        }\n      case QmitkOverlay::top_Center : {}\n      case QmitkOverlay::bottom_Center :\n        {\n          dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ pos ]->layout() )->insertWidget( overlay->GetLayer(), overlay->GetWidget(), stackLayer, Qt::AlignCenter );\n          break;\n        }\n      case QmitkOverlay::top_Right : {}\n      case QmitkOverlay::middle_Right : {}\n      case QmitkOverlay::bottom_Right : \n        {\n          dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ pos ]->layout() )->insertWidget( overlay->GetLayer(), overlay->GetWidget(), stackLayer, Qt::AlignRight );    \n          break;\n        }\n    }\n\n    m_PositionedOverlays[ pos ]->show();\n    this->AdjustOverlayPosition();\n  }\n}\n\n\n\nvoid QmitkOverlayController::AlignOverlays()\n{\n  \/\/MITK_INFO << \"mitkOverlayController::AlignOverlays\";\n\n  \/\/OverlayVector::iterator overlayIter;\n\n  \/\/for ( overlayIter=m_AllOverlays.begin(); overlayIter!=m_AllOverlays.end(); overlayIter++ )\n  \/\/{\n  \/\/  int stackLayer = dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ (*overlayIter)->GetPosition() ]->layout() )->isEmpty() ? 0 : layer;\n  \/\/  dynamic_cast<QBoxLayout*>( m_PositionedOverlays[ (*overlayIter)->GetPosition() ]->layout() )->addWidget( (*overlayIter)->GetWidget(), stackLayer, Qt::AlignLeft );\n  \/\/}\n}<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright(c) 2015 Gabi Melman.\n\/\/ Distributed under the MIT License (http:\/\/opensource.org\/licenses\/MIT)\n\/\/\n\n\/\/\n\/\/ bench.cpp : spdlog benchmarks\n\/\/\n#include \"spdlog\/spdlog.h\"\n#include \"spdlog\/async.h\"\n#include \"spdlog\/sinks\/basic_file_sink.h\"\n#include \"spdlog\/sinks\/daily_file_sink.h\"\n#include \"spdlog\/sinks\/null_sink.h\"\n#include \"spdlog\/sinks\/rotating_file_sink.h\"\n\n#include \"utils.h\"\n#include <atomic>\n#include <cstdlib> \/\/ EXIT_FAILURE\n#include <memory>\n#include <string>\n#include <thread>\n\nusing namespace std;\nusing namespace std::chrono;\nusing namespace spdlog;\nusing namespace spdlog::sinks;\nusing namespace utils;\n\nvoid bench(int howmany, std::shared_ptr<spdlog::logger> log);\nvoid bench_mt(int howmany, std::shared_ptr<spdlog::logger> log, int thread_count);\nvoid bench_default_api(int howmany, std::shared_ptr<spdlog::logger> log);\n\nint main(int argc, char *argv[])\n{\n\n    spdlog::default_logger()->set_pattern(\"[%^%l%$] %v\");\n    int howmany = 1000000;\n    int queue_size = howmany + 2;\n    int threads = 10;\n    size_t file_size = 30 * 1024 * 1024;\n    size_t rotating_files = 5;\n\n    try\n    {\n\n        if (argc > 1)\n            howmany = atoi(argv[1]);\n        if (argc > 2)\n            threads = atoi(argv[2]);\n        if (argc > 3)\n            queue_size = atoi(argv[3]);\n\n        spdlog::info(\"**************************************************************\");\n        spdlog::info(\"Single thread, {:n} iterations\", howmany);\n        spdlog::info(\"**************************************************************\");\n\n\n        auto basic_st = spdlog::basic_logger_st(\"basic_st\", \"logs\/basic_st.log\", true);\n        bench(howmany, std::move(basic_st));\n\n        basic_st.reset();\n        auto rotating_st = spdlog::rotating_logger_st(\"rotating_st\", \"logs\/rotating_st.log\", file_size, rotating_files);\n        bench(howmany, std::move(rotating_st));\n\n        auto daily_st = spdlog::daily_logger_st(\"daily_st\", \"logs\/daily_st.log\");\n        bench(howmany, std::move(daily_st));\n\n        bench(howmany, spdlog::create<null_sink_st>(\"null_st\"));\n\n        spdlog::info(\"**************************************************************\");\n        spdlog::info(\"Default API. Single thread, {:n} iterations\", howmany);\n        spdlog::info(\"**************************************************************\");\n\n        basic_st = spdlog::basic_logger_st(\"basic_st\", \"logs\/basic_st.log\", true);\n        bench_default_api(howmany, std::move(basic_st));\n\n        rotating_st = spdlog::rotating_logger_st(\"rotating_st\", \"logs\/rotating_st.log\", file_size, rotating_files);\n        bench_default_api(howmany, std::move(rotating_st));\n\n        daily_st = spdlog::daily_logger_st(\"daily_st\", \"logs\/daily_st.log\");\n        bench_default_api(howmany, std::move(daily_st));\n\n        bench_default_api(howmany, spdlog::create<null_sink_st>(\"null_st\"));\n\n        spdlog::info(\"**************************************************************\");\n        spdlog::info(\"{:n} threads sharing same logger, {:n} iterations\", threads, howmany);\n        spdlog::info(\"**************************************************************\");\n\n        auto basic_mt = spdlog::basic_logger_mt(\"basic_mt\", \"logs\/basic_mt.log\", true);\n        bench_mt(howmany, std::move(basic_mt), threads);\n\n        auto rotating_mt = spdlog::rotating_logger_mt(\"rotating_mt\", \"logs\/rotating_mt.log\", file_size, rotating_files);\n        bench_mt(howmany, std::move(rotating_mt), threads);\n\n        auto daily_mt = spdlog::daily_logger_mt(\"daily_mt\", \"logs\/daily_mt.log\");\n        bench_mt(howmany, std::move(daily_mt), threads);\n        bench_mt(howmany, spdlog::create<null_sink_mt>(\"null_mt\"), threads);\n\n        spdlog::info(\"**************************************************************\");\n        spdlog::info(\"Asyncronous.. {:n} threads sharing same logger, {:n} iterations\", threads, howmany);\n        spdlog::info(\"**************************************************************\");\n\n        for (int i = 0; i < 3; ++i)\n        {\n            spdlog::init_thread_pool(static_cast<size_t>(queue_size), 1);\n            auto as = spdlog::basic_logger_mt<spdlog::async_factory>(\"async\", \"logs\/basic_async.log\", true);\n            bench_mt(howmany, std::move(as), threads);\n        }\n    }\n    catch (std::exception &ex)\n    {\n        spdlog::error(ex.what());\n        return EXIT_FAILURE;\n    }\n    return EXIT_SUCCESS;\n}\n\nvoid bench(int howmany, std::shared_ptr<spdlog::logger> log)\n{\n    using std::chrono::high_resolution_clock;\n    auto start = high_resolution_clock::now();\n    for (auto i = 0; i < howmany; ++i)\n    {\n        log->info(\"Hello logger: msg number {}\", i);\n    }\n\n    auto delta = high_resolution_clock::now() - start;\n    auto delta_d = duration_cast<duration<double>>(delta).count();\n\n    spdlog::info(\"{:<16} Elapsed: {:0.2f} secs {:>16n}\/sec\", log->name(), delta_d, int(howmany \/ delta_d));\n    spdlog::drop(log->name());\n}\n\nvoid bench_mt(int howmany, std::shared_ptr<spdlog::logger> log, int thread_count)\n{\n    using std::chrono::high_resolution_clock;\n    vector<thread> threads;\n    auto start = high_resolution_clock::now();\n    for (int t = 0; t < thread_count; ++t)\n    {\n        threads.push_back(std::thread([&]() {\n            for (int j = 0; j < howmany \/ thread_count; j++)\n            {\n                log->info(\"Hello logger: msg number {}\", j);\n            }\n        }));\n    }\n\n    for (auto &t : threads)\n    {\n        t.join();\n    };\n\n    auto delta = high_resolution_clock::now() - start;\n    auto delta_d = duration_cast<duration<double>>(delta).count();\n    spdlog::info(\"{:<16} Elapsed: {:0.2f} secs {:>16n}\/sec\", log->name(), delta_d, int(howmany \/ delta_d));\n    spdlog::drop(log->name());\n}\n\nvoid bench_default_api(int howmany, std::shared_ptr<spdlog::logger> log)\n{\n    using std::chrono::high_resolution_clock;\n    auto orig_default = spdlog::default_logger();\n    spdlog::set_default_logger(log);\n    auto start = high_resolution_clock::now();\n    for (auto i = 0; i < howmany; ++i)\n    {\n        spdlog::info(\"Hello logger: msg number {}\", i);\n    }\n\n    auto delta = high_resolution_clock::now() - start;\n    auto delta_d = duration_cast<duration<double>>(delta).count();\n    spdlog::drop(log->name());\n    spdlog::set_default_logger(std::move(orig_default));\n    spdlog::info(\"{:<16} Elapsed: {:0.2f} secs {:>16n}\/sec\", log->name(), delta_d, int(howmany \/ delta_d));\n}\n<commit_msg>Code formatting<commit_after>\/\/\n\/\/ Copyright(c) 2015 Gabi Melman.\n\/\/ Distributed under the MIT License (http:\/\/opensource.org\/licenses\/MIT)\n\/\/\n\n\/\/\n\/\/ bench.cpp : spdlog benchmarks\n\/\/\n#include \"spdlog\/spdlog.h\"\n#include \"spdlog\/async.h\"\n#include \"spdlog\/sinks\/basic_file_sink.h\"\n#include \"spdlog\/sinks\/daily_file_sink.h\"\n#include \"spdlog\/sinks\/null_sink.h\"\n#include \"spdlog\/sinks\/rotating_file_sink.h\"\n\n#include \"utils.h\"\n#include <atomic>\n#include <cstdlib> \/\/ EXIT_FAILURE\n#include <memory>\n#include <string>\n#include <thread>\n\nusing namespace std;\nusing namespace std::chrono;\nusing namespace spdlog;\nusing namespace spdlog::sinks;\nusing namespace utils;\n\nvoid bench(int howmany, std::shared_ptr<spdlog::logger> log);\nvoid bench_mt(int howmany, std::shared_ptr<spdlog::logger> log, int thread_count);\nvoid bench_default_api(int howmany, std::shared_ptr<spdlog::logger> log);\n\nint main(int argc, char *argv[])\n{\n\n    spdlog::default_logger()->set_pattern(\"[%^%l%$] %v\");\n    int howmany = 1000000;\n    int queue_size = howmany + 2;\n    int threads = 10;\n    size_t file_size = 30 * 1024 * 1024;\n    size_t rotating_files = 5;\n\n    try\n    {\n\n        if (argc > 1)\n            howmany = atoi(argv[1]);\n        if (argc > 2)\n            threads = atoi(argv[2]);\n        if (argc > 3)\n            queue_size = atoi(argv[3]);\n\n        spdlog::info(\"**************************************************************\");\n        spdlog::info(\"Single thread, {:n} iterations\", howmany);\n        spdlog::info(\"**************************************************************\");\n\n        auto basic_st = spdlog::basic_logger_st(\"basic_st\", \"logs\/basic_st.log\", true);\n        bench(howmany, std::move(basic_st));\n\n        basic_st.reset();\n        auto rotating_st = spdlog::rotating_logger_st(\"rotating_st\", \"logs\/rotating_st.log\", file_size, rotating_files);\n        bench(howmany, std::move(rotating_st));\n\n        auto daily_st = spdlog::daily_logger_st(\"daily_st\", \"logs\/daily_st.log\");\n        bench(howmany, std::move(daily_st));\n\n        bench(howmany, spdlog::create<null_sink_st>(\"null_st\"));\n\n        spdlog::info(\"**************************************************************\");\n        spdlog::info(\"Default API. Single thread, {:n} iterations\", howmany);\n        spdlog::info(\"**************************************************************\");\n\n        basic_st = spdlog::basic_logger_st(\"basic_st\", \"logs\/basic_st.log\", true);\n        bench_default_api(howmany, std::move(basic_st));\n\n        rotating_st = spdlog::rotating_logger_st(\"rotating_st\", \"logs\/rotating_st.log\", file_size, rotating_files);\n        bench_default_api(howmany, std::move(rotating_st));\n\n        daily_st = spdlog::daily_logger_st(\"daily_st\", \"logs\/daily_st.log\");\n        bench_default_api(howmany, std::move(daily_st));\n\n        bench_default_api(howmany, spdlog::create<null_sink_st>(\"null_st\"));\n\n        spdlog::info(\"**************************************************************\");\n        spdlog::info(\"{:n} threads sharing same logger, {:n} iterations\", threads, howmany);\n        spdlog::info(\"**************************************************************\");\n\n        auto basic_mt = spdlog::basic_logger_mt(\"basic_mt\", \"logs\/basic_mt.log\", true);\n        bench_mt(howmany, std::move(basic_mt), threads);\n\n        auto rotating_mt = spdlog::rotating_logger_mt(\"rotating_mt\", \"logs\/rotating_mt.log\", file_size, rotating_files);\n        bench_mt(howmany, std::move(rotating_mt), threads);\n\n        auto daily_mt = spdlog::daily_logger_mt(\"daily_mt\", \"logs\/daily_mt.log\");\n        bench_mt(howmany, std::move(daily_mt), threads);\n        bench_mt(howmany, spdlog::create<null_sink_mt>(\"null_mt\"), threads);\n\n        spdlog::info(\"**************************************************************\");\n        spdlog::info(\"Asyncronous.. {:n} threads sharing same logger, {:n} iterations\", threads, howmany);\n        spdlog::info(\"**************************************************************\");\n\n        for (int i = 0; i < 3; ++i)\n        {\n            spdlog::init_thread_pool(static_cast<size_t>(queue_size), 1);\n            auto as = spdlog::basic_logger_mt<spdlog::async_factory>(\"async\", \"logs\/basic_async.log\", true);\n            bench_mt(howmany, std::move(as), threads);\n        }\n    }\n    catch (std::exception &ex)\n    {\n        spdlog::error(ex.what());\n        return EXIT_FAILURE;\n    }\n    return EXIT_SUCCESS;\n}\n\nvoid bench(int howmany, std::shared_ptr<spdlog::logger> log)\n{\n    using std::chrono::high_resolution_clock;\n    auto start = high_resolution_clock::now();\n    for (auto i = 0; i < howmany; ++i)\n    {\n        log->info(\"Hello logger: msg number {}\", i);\n    }\n\n    auto delta = high_resolution_clock::now() - start;\n    auto delta_d = duration_cast<duration<double>>(delta).count();\n\n    spdlog::info(\"{:<16} Elapsed: {:0.2f} secs {:>16n}\/sec\", log->name(), delta_d, int(howmany \/ delta_d));\n    spdlog::drop(log->name());\n}\n\nvoid bench_mt(int howmany, std::shared_ptr<spdlog::logger> log, int thread_count)\n{\n    using std::chrono::high_resolution_clock;\n    vector<thread> threads;\n    auto start = high_resolution_clock::now();\n    for (int t = 0; t < thread_count; ++t)\n    {\n        threads.push_back(std::thread([&]() {\n            for (int j = 0; j < howmany \/ thread_count; j++)\n            {\n                log->info(\"Hello logger: msg number {}\", j);\n            }\n        }));\n    }\n\n    for (auto &t : threads)\n    {\n        t.join();\n    };\n\n    auto delta = high_resolution_clock::now() - start;\n    auto delta_d = duration_cast<duration<double>>(delta).count();\n    spdlog::info(\"{:<16} Elapsed: {:0.2f} secs {:>16n}\/sec\", log->name(), delta_d, int(howmany \/ delta_d));\n    spdlog::drop(log->name());\n}\n\nvoid bench_default_api(int howmany, std::shared_ptr<spdlog::logger> log)\n{\n    using std::chrono::high_resolution_clock;\n    auto orig_default = spdlog::default_logger();\n    spdlog::set_default_logger(log);\n    auto start = high_resolution_clock::now();\n    for (auto i = 0; i < howmany; ++i)\n    {\n        spdlog::info(\"Hello logger: msg number {}\", i);\n    }\n\n    auto delta = high_resolution_clock::now() - start;\n    auto delta_d = duration_cast<duration<double>>(delta).count();\n    spdlog::drop(log->name());\n    spdlog::set_default_logger(std::move(orig_default));\n    spdlog::info(\"{:<16} Elapsed: {:0.2f} secs {:>16n}\/sec\", log->name(), delta_d, int(howmany \/ delta_d));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hf_linachain.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-02 16:40: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#ifndef ADC_DISPLAY_HF_LINACHAIN_HXX\n#define ADC_DISPLAY_HF_LINACHAIN_HXX\n\n\/\/ BASE CLASSES\n#include \"htmlfactory.hxx\"\n#include \"out_position.hxx\"\n\n\n\n\nclass HF_LinkedNameChain : public HtmlMaker\n{\n  public:\n    \/** F_LinkMaker makes a link out of the name of the\n        parent position.\n\n        Returns true, if there is a link, false if not.\n    *\/\n    typedef String (*F_LinkMaker)(const char *);\n\n\n                        HF_LinkedNameChain(\n                            Xml::Element &      o_rOut );\n    virtual             ~HF_LinkedNameChain();\n\n    void                Produce_CompleteChain(\n                            const output::Position &\n                                                i_curPosition,\n                            F_LinkMaker         i_linkMaker ) const;\n    void                Produce_CompleteChain_forModule(\n                            const output::Position &\n                                                i_curPosition,  \/\/\/ current Module's node\n                            F_LinkMaker         i_linkMaker ) const;\n  private:\n    void                produce_Level(\n                            output::Node &      i_levelNode,\n                            const output::Position &\n                                                i_startPosition,\n                            F_LinkMaker         i_linkMaker ) const;\n};\n\n\n\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.22); FILE MERGED 2008\/03\/28 16:02:11 rt 1.3.22.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: hf_linachain.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 ADC_DISPLAY_HF_LINACHAIN_HXX\n#define ADC_DISPLAY_HF_LINACHAIN_HXX\n\n\/\/ BASE CLASSES\n#include \"htmlfactory.hxx\"\n#include \"out_position.hxx\"\n\n\n\n\nclass HF_LinkedNameChain : public HtmlMaker\n{\n  public:\n    \/** F_LinkMaker makes a link out of the name of the\n        parent position.\n\n        Returns true, if there is a link, false if not.\n    *\/\n    typedef String (*F_LinkMaker)(const char *);\n\n\n                        HF_LinkedNameChain(\n                            Xml::Element &      o_rOut );\n    virtual             ~HF_LinkedNameChain();\n\n    void                Produce_CompleteChain(\n                            const output::Position &\n                                                i_curPosition,\n                            F_LinkMaker         i_linkMaker ) const;\n    void                Produce_CompleteChain_forModule(\n                            const output::Position &\n                                                i_curPosition,  \/\/\/ current Module's node\n                            F_LinkMaker         i_linkMaker ) const;\n  private:\n    void                produce_Level(\n                            output::Node &      i_levelNode,\n                            const output::Position &\n                                                i_startPosition,\n                            F_LinkMaker         i_linkMaker ) const;\n};\n\n\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* * This file is part of meego-im-framework *\n *\n * Copyright (C) 2011 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\/\/ This file is based on mkeyboardstatetracker.cpp from libmeegotouch\n\n#include \"mimhwkeyboardtracker.h\"\n#include \"mimhwkeyboardtracker_p.h\"\n\n#include <QCoreApplication>\n\nnamespace {\n    const char * const keyboardPresent(\"\/maemo\/InternalKeyboard\/Present\");\n    const char * const keyboardOpen(\"\/maemo\/InternalKeyboard\/Open\");\n}\n\nMImHwKeyboardTrackerPrivate::MImHwKeyboardTrackerPrivate(MImHwKeyboardTracker *q_ptr) :\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    keyboardOpenProperty(),\n#endif\n    present(false)\n{\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    ContextProperty keyboardPresentProperty(keyboardPresent);\n    keyboardOpenProperty.reset(new ContextProperty(keyboardOpen));\n    keyboardPresentProperty.waitForSubscription(true);\n    keyboardOpenProperty->waitForSubscription(true);\n    present = keyboardPresentProperty.value().toBool();\n    if (present) {\n        QObject::connect(keyboardOpenProperty.data(), SIGNAL(valueChanged()),\n                         q_ptr, SIGNAL(stateChanged()));\n    } else {\n        keyboardOpenProperty.reset();\n    }\n#else\n    Q_UNUSED(q_ptr);\n#endif\n}\n\nMImHwKeyboardTrackerPrivate::~MImHwKeyboardTrackerPrivate()\n{\n}\n\nMImHwKeyboardTracker::MImHwKeyboardTracker()\n    : QObject(QCoreApplication::instance()),\n      d_ptr(new MImHwKeyboardTrackerPrivate(this))\n{\n}\n\nMImHwKeyboardTracker::~MImHwKeyboardTracker()\n{\n}\n\nMImHwKeyboardTracker *MImHwKeyboardTracker::instance()\n{\n    static MImHwKeyboardTracker tracker;\n    return &tracker;\n}\n\nbool MImHwKeyboardTracker::isPresent() const\n{\n    Q_D(const MImHwKeyboardTracker);\n\n    return d->present;\n}\n\nbool MImHwKeyboardTracker::isOpen() const\n{\n    Q_D(const MImHwKeyboardTracker);\n\n    if (!d->present) {\n        return false;\n    }\n\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    return d->keyboardOpenProperty->value().toBool();\n#else\n    return false;\n#endif\n}\n<commit_msg>Fixes: crash in ut_mimpluginmanager<commit_after>\/* * This file is part of meego-im-framework *\n *\n * Copyright (C) 2011 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\/\/ This file is based on mkeyboardstatetracker.cpp from libmeegotouch\n\n#include \"mimhwkeyboardtracker.h\"\n#include \"mimhwkeyboardtracker_p.h\"\n\nnamespace {\n    const char * const keyboardPresent(\"\/maemo\/InternalKeyboard\/Present\");\n    const char * const keyboardOpen(\"\/maemo\/InternalKeyboard\/Open\");\n}\n\nMImHwKeyboardTrackerPrivate::MImHwKeyboardTrackerPrivate(MImHwKeyboardTracker *q_ptr) :\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    keyboardOpenProperty(),\n#endif\n    present(false)\n{\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    ContextProperty keyboardPresentProperty(keyboardPresent);\n    keyboardOpenProperty.reset(new ContextProperty(keyboardOpen));\n    keyboardPresentProperty.waitForSubscription(true);\n    keyboardOpenProperty->waitForSubscription(true);\n    present = keyboardPresentProperty.value().toBool();\n    if (present) {\n        QObject::connect(keyboardOpenProperty.data(), SIGNAL(valueChanged()),\n                         q_ptr, SIGNAL(stateChanged()));\n    } else {\n        keyboardOpenProperty.reset();\n    }\n#else\n    Q_UNUSED(q_ptr);\n#endif\n}\n\nMImHwKeyboardTrackerPrivate::~MImHwKeyboardTrackerPrivate()\n{\n}\n\nMImHwKeyboardTracker::MImHwKeyboardTracker()\n    : QObject(),\n      d_ptr(new MImHwKeyboardTrackerPrivate(this))\n{\n}\n\nMImHwKeyboardTracker::~MImHwKeyboardTracker()\n{\n}\n\n\/\/ TODO just use a normal instance in the plugin manager instead of singleton\nMImHwKeyboardTracker *MImHwKeyboardTracker::instance()\n{\n    static MImHwKeyboardTracker tracker;\n    return &tracker;\n}\n\nbool MImHwKeyboardTracker::isPresent() const\n{\n    Q_D(const MImHwKeyboardTracker);\n\n    return d->present;\n}\n\nbool MImHwKeyboardTracker::isOpen() const\n{\n    Q_D(const MImHwKeyboardTracker);\n\n    if (!d->present) {\n        return false;\n    }\n\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    return d->keyboardOpenProperty->value().toBool();\n#else\n    return false;\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\r\n\tThis software was developed by the University of Tennessee as part of the\r\n\tDistributed Data Analysis of Neutron Scattering Experiments (DANSE)\r\n\tproject funded by the US National Science Foundation.\r\n\r\n\tIf you use DANSE applications to do scientific research that leads to\r\n\tpublication, we ask that you acknowledge the use of the software with the\r\n\tfollowing sentence:\r\n\r\n\t\"This work benefited from DANSE software developed under NSF award DMR-0520547.\"\r\n\r\n\tcopyright 2008, University of Tennessee\r\n *\/\r\n\r\n\/**\r\n * Scattering model classes\r\n * The classes use the IGOR library found in\r\n *   sansmodels\/src\/libigor\r\n *\r\n *\/\n\r\n#include <math.h>\r\n#include \"parameters.hh\"\r\n#include <stdio.h>\r\nusing namespace std;\r\n\r\nextern \"C\" {\r\n\t#include \"libCylinder.h\"\r\n\t#include \"libStructureFactor.h\"\r\n}\r\n#include \"cylinder.h\"\r\n\r\n\/\/ Convenience parameter structure\r\ntypedef struct {\r\n    double scale;\r\n    double radius;\r\n    double length;\r\n    double sldCyl;\r\n    double sldSolv;\r\n    double background;\r\n    double cyl_theta;\r\n    double cyl_phi;\r\n} CylinderParameters;\r\n\r\nCylinderModel :: CylinderModel() {\r\n\tscale      = Parameter(1.0);\r\n\tradius     = Parameter(20.0, true);\r\n\tradius.set_min(0.0);\r\n\tlength     = Parameter(400.0, true);\r\n\tlength.set_min(0.0);\r\n\tsldCyl   = Parameter(4.e-6);\r\n\tsldSolv   = Parameter(1.e-6);\r\n\tbackground = Parameter(0.0);\r\n\tcyl_theta  = Parameter(0.0, true);\r\n\tcyl_phi    = Parameter(0.0, true);\r\n}\r\n\r\n\/**\r\n * Function to evaluate 1D scattering function\r\n * The NIST IGOR library is used for the actual calculation.\r\n * @param q: q-value\r\n * @return: function value\r\n *\/\r\ndouble CylinderModel :: operator()(double q) {\r\n\tdouble dp[6];\r\n\r\n\t\/\/ Fill parameter array for IGOR library\r\n\t\/\/ Add the background after averaging\r\n\tdp[0] = scale();\r\n\tdp[1] = radius();\r\n\tdp[2] = length();\r\n\tdp[3] = sldCyl();\r\n\tdp[4] = sldSolv();\r\n\tdp[5] = 0.0;\r\n\r\n\t\/\/ Get the dispersion points for the radius\r\n\tvector<WeightPoint> weights_rad;\r\n\tradius.get_weights(weights_rad);\r\n\r\n\t\/\/ Get the dispersion points for the length\r\n\tvector<WeightPoint> weights_len;\r\n\tlength.get_weights(weights_len);\r\n\r\n\t\/\/ Perform the computation, with all weight points\r\n\tdouble sum = 0.0;\r\n\tdouble norm = 0.0;\r\n\tdouble vol = 0.0;\r\n\r\n\t\/\/ Loop over radius weight points\r\n\tfor(size_t i=0; i<weights_rad.size(); i++) {\r\n\t\tdp[1] = weights_rad[i].value;\r\n\r\n\t\t\/\/ Loop over length weight points\r\n\t\tfor(size_t j=0; j<weights_len.size(); j++) {\r\n\t\t\tdp[2] = weights_len[j].value;\r\n\t\t\t\/\/Un-normalize by volume\r\n\t\t\tsum += weights_rad[i].weight\r\n\t\t\t\t* weights_len[j].weight * CylinderForm(dp, q)\r\n\t\t\t\t*pow(weights_rad[i].value,2)*weights_len[j].value;\r\n\r\n\t\t\t\/\/Find average volume\r\n\t\t\tvol += weights_rad[i].weight\r\n\t\t\t\t* weights_len[j].weight *pow(weights_rad[i].value,2)*weights_len[j].value;\r\n\t\t\tnorm += weights_rad[i].weight\r\n\t\t\t\t* weights_len[j].weight;\r\n\t\t}\r\n\t}\r\n\tif (vol != 0.0 && norm != 0.0) {\r\n\t\t\/\/Re-normalize by avg volume\r\n\t\tsum = sum\/(vol\/norm);}\r\n\r\n\treturn sum\/norm + background();\r\n}\r\n\r\n\/**\r\n * Function to evaluate 2D scattering function\r\n * @param pars: parameters of the cylinder\r\n * @param q: q-value\r\n * @param q_x: q_x \/ q\r\n * @param q_y: q_y \/ q\r\n * @return: function value\r\n *\/\r\nstatic double cylinder_analytical_2D_scaled(CylinderParameters *pars, double q, double q_x, double q_y) {\r\n  double cyl_x, cyl_y, cyl_z;\r\n  double q_z;\r\n  double alpha, vol, cos_val;\r\n  double answer;\r\n  \/\/convert angle degree to radian\r\n  double pi = 4.0*atan(1.0);\r\n  double theta = pars->cyl_theta * pi\/180.0;\r\n  double phi = pars->cyl_phi * pi\/180.0;\r\n\r\n    \/\/ Cylinder orientation\r\n    cyl_x = sin(theta) * cos(phi);\r\n    cyl_y = sin(theta) * sin(phi);\r\n    cyl_z = cos(theta);\r\n\r\n    \/\/ q vector\r\n    q_z = 0.0;\r\n\r\n    \/\/ Compute the angle btw vector q and the\r\n    \/\/ axis of the cylinder\r\n    cos_val = cyl_x*q_x + cyl_y*q_y + cyl_z*q_z;\r\n\r\n    \/\/ The following test should always pass\r\n    if (fabs(cos_val)>1.0) {\r\n      printf(\"cyl_ana_2D: Unexpected error: |cos(alpha)=%g|>1\\n\", cos_val);\r\n      printf(\"cyl_ana_2D: at theta=%g and phi=%g.\", theta, phi);\r\n      return 1.0;\r\n    }\r\n\r\n    \/\/ Note: cos(alpha) = 0 and 1 will get an\r\n    \/\/ undefined value from CylKernel\r\n  alpha = acos( cos_val );\r\n\r\n  \/\/ Call the IGOR library function to get the kernel\r\n  answer = CylKernel(q, pars->radius, pars->length\/2.0, alpha) \/ sin(alpha);\r\n\r\n  \/\/ Multiply by contrast^2\r\n  answer *= (pars->sldCyl - pars->sldSolv)*(pars->sldCyl - pars->sldSolv);\r\n\r\n  \/\/normalize by cylinder volume\r\n  \/\/NOTE that for this (Fournet) definition of the integral, one must MULTIPLY by Vcyl\r\n    vol = acos(-1.0) * pars->radius * pars->radius * pars->length;\r\n  answer *= vol;\r\n\r\n  \/\/convert to [cm-1]\r\n  answer *= 1.0e8;\r\n\r\n  \/\/Scale\r\n  answer *= pars->scale;\r\n\r\n  \/\/ add in the background\r\n  answer += pars->background;\r\n\r\n  return answer;\r\n}\r\n\r\n\/**\r\n * Function to evaluate 2D scattering function\r\n * @param pars: parameters of the cylinder\r\n * @param q: q-value\r\n * @return: function value\r\n *\/\r\nstatic double cylinder_analytical_2DXY(CylinderParameters *pars, double qx, double qy) {\r\n  double q;\r\n  q = sqrt(qx*qx+qy*qy);\r\n  return cylinder_analytical_2D_scaled(pars, q, qx\/q, qy\/q);\r\n}\r\n\r\n\/**\r\n * Function to evaluate 2D scattering function\r\n * @param q_x: value of Q along x\r\n * @param q_y: value of Q along y\r\n * @return: function value\r\n *\/\r\ndouble CylinderModel :: operator()(double qx, double qy) {\r\n\tCylinderParameters dp;\r\n\t\/\/ Fill parameter array\r\n\tdp.scale      = scale();\r\n\tdp.radius     = radius();\r\n\tdp.length     = length();\r\n\tdp.sldCyl   = sldCyl();\r\n\tdp.sldSolv   = sldSolv();\r\n\tdp.background = 0.0;\r\n\tdp.cyl_theta  = cyl_theta();\r\n\tdp.cyl_phi    = cyl_phi();\r\n\r\n\t\/\/ Get the dispersion points for the radius\r\n\tvector<WeightPoint> weights_rad;\r\n\tradius.get_weights(weights_rad);\r\n\r\n\t\/\/ Get the dispersion points for the length\r\n\tvector<WeightPoint> weights_len;\r\n\tlength.get_weights(weights_len);\r\n\r\n\t\/\/ Get angular averaging for theta\r\n\tvector<WeightPoint> weights_theta;\r\n\tcyl_theta.get_weights(weights_theta);\r\n\r\n\t\/\/ Get angular averaging for phi\r\n\tvector<WeightPoint> weights_phi;\r\n\tcyl_phi.get_weights(weights_phi);\r\n\r\n\t\/\/ Perform the computation, with all weight points\r\n\tdouble sum = 0.0;\r\n\tdouble norm = 0.0;\r\n\tdouble norm_vol = 0.0;\r\n\tdouble vol = 0.0;\r\n\tdouble pi = 4.0*atan(1.0);\r\n\t\/\/ Loop over radius weight points\r\n\tfor(size_t i=0; i<weights_rad.size(); i++) {\r\n\t\tdp.radius = weights_rad[i].value;\r\n\r\n\r\n\t\t\/\/ Loop over length weight points\r\n\t\tfor(size_t j=0; j<weights_len.size(); j++) {\r\n\t\t\tdp.length = weights_len[j].value;\r\n\r\n\t\t\t\/\/ Average over theta distribution\r\n\t\t\tfor(size_t k=0; k<weights_theta.size(); k++) {\r\n\t\t\t\tdp.cyl_theta = weights_theta[k].value;\r\n\r\n\t\t\t\t\/\/ Average over phi distribution\r\n\t\t\t\tfor(size_t l=0; l<weights_phi.size(); l++) {\r\n\t\t\t\t\tdp.cyl_phi = weights_phi[l].value;\r\n\t\t\t\t\t\/\/Un-normalize by volume\r\n\t\t\t\t\tdouble _ptvalue = weights_rad[i].weight\r\n\t\t\t\t\t\t* weights_len[j].weight\r\n\t\t\t\t\t\t* weights_theta[k].weight\r\n\t\t\t\t\t\t* weights_phi[l].weight\r\n\t\t\t\t\t\t* cylinder_analytical_2DXY(&dp, qx, qy)\r\n\t\t\t\t\t\t*pow(weights_rad[i].value,2)*weights_len[j].value;\r\n\t\t\t\t\tif (weights_theta.size()>1) {\r\n\t\t\t\t\t\t_ptvalue *= fabs(sin(weights_theta[k].value*pi\/180.0));\r\n\t\t\t\t\t}\r\n\t\t\t\t\tsum += _ptvalue;\r\n\t\t\t\t\t\/\/Find average volume\r\n\t\t\t\t\tvol += weights_rad[i].weight\r\n\t\t\t\t\t\t\t* weights_len[j].weight\r\n\t\t\t\t\t\t\t* pow(weights_rad[i].value,2)*weights_len[j].value;\r\n\t\t\t\t\t\/\/Find norm for volume\r\n\t\t\t\t\tnorm_vol += weights_rad[i].weight\r\n\t\t\t\t\t\t\t* weights_len[j].weight;\r\n\r\n\t\t\t\t\tnorm += weights_rad[i].weight\r\n\t\t\t\t\t\t* weights_len[j].weight\r\n\t\t\t\t\t\t* weights_theta[k].weight\r\n\t\t\t\t\t\t* weights_phi[l].weight;\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\/\/ Averaging in theta needs an extra normalization\r\n\t\/\/ factor to account for the sin(theta) term in the\r\n\t\/\/ integration (see documentation).\r\n\tif (weights_theta.size()>1) norm = norm \/ asin(1.0);\r\n\tif (vol != 0.0 && norm_vol != 0.0) {\r\n\t\t\/\/Re-normalize by avg volume\r\n\t\tsum = sum\/(vol\/norm_vol);}\r\n\r\n\treturn sum\/norm + background();\r\n}\r\n\r\n\/**\r\n * Function to evaluate 2D scattering function\r\n * @param pars: parameters of the cylinder\r\n * @param q: q-value\r\n * @param phi: angle phi\r\n * @return: function value\r\n *\/\r\ndouble CylinderModel :: evaluate_rphi(double q, double phi) {\r\n\tdouble qx = q*cos(phi);\r\n\tdouble qy = q*sin(phi);\r\n\treturn (*this).operator()(qx, qy);\r\n}\r\n\/**\r\n * Function to calculate effective radius\r\n * @return: effective radius value\r\n *\/\r\ndouble CylinderModel :: calculate_ER() {\r\n\tCylinderParameters dp;\r\n\r\n\tdp.radius     = radius();\r\n\tdp.length     = length();\r\n\tdouble rad_out = 0.0;\r\n\r\n\t\/\/ Perform the computation, with all weight points\r\n\tdouble sum = 0.0;\r\n\tdouble norm = 0.0;\r\n\r\n\t\/\/ Get the dispersion points for the major shell\r\n\tvector<WeightPoint> weights_length;\r\n\tlength.get_weights(weights_length);\r\n\r\n\t\/\/ Get the dispersion points for the minor shell\r\n\tvector<WeightPoint> weights_radius ;\r\n\tradius.get_weights(weights_radius);\r\n\r\n\t\/\/ Loop over major shell weight points\r\n\tfor(int i=0; i< (int)weights_length.size(); i++) {\r\n\t\tdp.length = weights_length[i].value;\r\n\t\tfor(int k=0; k< (int)weights_radius.size(); k++) {\r\n\t\t\tdp.radius = weights_radius[k].value;\r\n\t\t\t\/\/Note: output of \"DiamCyl(dp.length,dp.radius)\" is DIAMETER.\r\n\t\t\tsum +=weights_length[i].weight\r\n\t\t\t\t* weights_radius[k].weight*DiamCyl(dp.length,dp.radius)\/2.0;\r\n\t\t\tnorm += weights_length[i].weight* weights_radius[k].weight;\r\n\t\t}\r\n\t}\r\n\tif (norm != 0){\r\n\t\t\/\/return the averaged value\r\n\t\trad_out =  sum\/norm;}\r\n\telse{\r\n\t\t\/\/return normal value\r\n\t\t\/\/Note: output of \"DiamCyl(dp.length,dp.radius)\" is DIAMETER.\r\n\t\trad_out = DiamCyl(dp.length,dp.radius)\/2.0;}\r\n\r\n\treturn rad_out;\r\n}\r\ndouble CylinderModel :: calculate_VR() {\r\n  return 1.0;\r\n}\r\n<commit_msg>block alpha=0 that breaks fitting<commit_after>\/**\r\n\tThis software was developed by the University of Tennessee as part of the\r\n\tDistributed Data Analysis of Neutron Scattering Experiments (DANSE)\r\n\tproject funded by the US National Science Foundation.\r\n\r\n\tIf you use DANSE applications to do scientific research that leads to\r\n\tpublication, we ask that you acknowledge the use of the software with the\r\n\tfollowing sentence:\r\n\r\n\t\"This work benefited from DANSE software developed under NSF award DMR-0520547.\"\r\n\r\n\tcopyright 2008, University of Tennessee\r\n *\/\r\n\r\n\/**\r\n * Scattering model classes\r\n * The classes use the IGOR library found in\r\n *   sansmodels\/src\/libigor\r\n *\r\n *\/\n\r\n#include <math.h>\r\n#include \"parameters.hh\"\r\n#include <stdio.h>\r\nusing namespace std;\r\n\r\nextern \"C\" {\r\n\t#include \"libCylinder.h\"\r\n\t#include \"libStructureFactor.h\"\r\n}\r\n#include \"cylinder.h\"\r\n\r\n\/\/ Convenience parameter structure\r\ntypedef struct {\r\n    double scale;\r\n    double radius;\r\n    double length;\r\n    double sldCyl;\r\n    double sldSolv;\r\n    double background;\r\n    double cyl_theta;\r\n    double cyl_phi;\r\n} CylinderParameters;\r\n\r\nCylinderModel :: CylinderModel() {\r\n\tscale      = Parameter(1.0);\r\n\tradius     = Parameter(20.0, true);\r\n\tradius.set_min(0.0);\r\n\tlength     = Parameter(400.0, true);\r\n\tlength.set_min(0.0);\r\n\tsldCyl   = Parameter(4.e-6);\r\n\tsldSolv   = Parameter(1.e-6);\r\n\tbackground = Parameter(0.0);\r\n\tcyl_theta  = Parameter(0.0, true);\r\n\tcyl_phi    = Parameter(0.0, true);\r\n}\r\n\r\n\/**\r\n * Function to evaluate 1D scattering function\r\n * The NIST IGOR library is used for the actual calculation.\r\n * @param q: q-value\r\n * @return: function value\r\n *\/\r\ndouble CylinderModel :: operator()(double q) {\r\n\tdouble dp[6];\r\n\r\n\t\/\/ Fill parameter array for IGOR library\r\n\t\/\/ Add the background after averaging\r\n\tdp[0] = scale();\r\n\tdp[1] = radius();\r\n\tdp[2] = length();\r\n\tdp[3] = sldCyl();\r\n\tdp[4] = sldSolv();\r\n\tdp[5] = 0.0;\r\n\r\n\t\/\/ Get the dispersion points for the radius\r\n\tvector<WeightPoint> weights_rad;\r\n\tradius.get_weights(weights_rad);\r\n\r\n\t\/\/ Get the dispersion points for the length\r\n\tvector<WeightPoint> weights_len;\r\n\tlength.get_weights(weights_len);\r\n\r\n\t\/\/ Perform the computation, with all weight points\r\n\tdouble sum = 0.0;\r\n\tdouble norm = 0.0;\r\n\tdouble vol = 0.0;\r\n\r\n\t\/\/ Loop over radius weight points\r\n\tfor(size_t i=0; i<weights_rad.size(); i++) {\r\n\t\tdp[1] = weights_rad[i].value;\r\n\r\n\t\t\/\/ Loop over length weight points\r\n\t\tfor(size_t j=0; j<weights_len.size(); j++) {\r\n\t\t\tdp[2] = weights_len[j].value;\r\n\t\t\t\/\/Un-normalize by volume\r\n\t\t\tsum += weights_rad[i].weight\r\n\t\t\t\t* weights_len[j].weight * CylinderForm(dp, q)\r\n\t\t\t\t*pow(weights_rad[i].value,2)*weights_len[j].value;\r\n\r\n\t\t\t\/\/Find average volume\r\n\t\t\tvol += weights_rad[i].weight\r\n\t\t\t\t* weights_len[j].weight *pow(weights_rad[i].value,2)*weights_len[j].value;\r\n\t\t\tnorm += weights_rad[i].weight\r\n\t\t\t\t* weights_len[j].weight;\r\n\t\t}\r\n\t}\r\n\tif (vol != 0.0 && norm != 0.0) {\r\n\t\t\/\/Re-normalize by avg volume\r\n\t\tsum = sum\/(vol\/norm);}\r\n\r\n\treturn sum\/norm + background();\r\n}\r\n\r\n\/**\r\n * Function to evaluate 2D scattering function\r\n * @param pars: parameters of the cylinder\r\n * @param q: q-value\r\n * @param q_x: q_x \/ q\r\n * @param q_y: q_y \/ q\r\n * @return: function value\r\n *\/\r\nstatic double cylinder_analytical_2D_scaled(CylinderParameters *pars, double q, double q_x, double q_y) {\r\n  double cyl_x, cyl_y, cyl_z;\r\n  double q_z;\r\n  double alpha, vol, cos_val;\r\n  double answer;\r\n  \/\/convert angle degree to radian\r\n  double pi = 4.0*atan(1.0);\r\n  double theta = pars->cyl_theta * pi\/180.0;\r\n  double phi = pars->cyl_phi * pi\/180.0;\r\n\r\n    \/\/ Cylinder orientation\r\n    cyl_x = sin(theta) * cos(phi);\r\n    cyl_y = sin(theta) * sin(phi);\r\n    cyl_z = cos(theta);\r\n\r\n    \/\/ q vector\r\n    q_z = 0.0;\r\n\r\n    \/\/ Compute the angle btw vector q and the\r\n    \/\/ axis of the cylinder\r\n    cos_val = cyl_x*q_x + cyl_y*q_y + cyl_z*q_z;\r\n\r\n    \/\/ The following test should always pass\r\n    if (fabs(cos_val)>1.0) {\r\n      printf(\"cyl_ana_2D: Unexpected error: |cos(alpha)=%g|>1\\n\", cos_val);\r\n      printf(\"cyl_ana_2D: at theta=%g and phi=%g.\", theta, phi);\r\n      return 1.0;\r\n    }\r\n\r\n    \/\/ Note: cos(alpha) = 0 and 1 will get an\r\n    \/\/ undefined value from CylKernel\r\n  alpha = acos( cos_val );\r\n  if (alpha == 0.0){\r\n  \talpha = 1.0e-26;\r\n  \t}\r\n  \/\/ Call the IGOR library function to get the kernel\r\n  answer = CylKernel(q, pars->radius, pars->length\/2.0, alpha) \/ sin(alpha);\r\n\r\n  \/\/ Multiply by contrast^2\r\n  answer *= (pars->sldCyl - pars->sldSolv)*(pars->sldCyl - pars->sldSolv);\r\n\r\n  \/\/normalize by cylinder volume\r\n  \/\/NOTE that for this (Fournet) definition of the integral, one must MULTIPLY by Vcyl\r\n    vol = acos(-1.0) * pars->radius * pars->radius * pars->length;\r\n  answer *= vol;\r\n\r\n  \/\/convert to [cm-1]\r\n  answer *= 1.0e8;\r\n\r\n  \/\/Scale\r\n  answer *= pars->scale;\r\n\r\n  \/\/ add in the background\r\n  answer += pars->background;\r\n\r\n  return answer;\r\n}\r\n\r\n\/**\r\n * Function to evaluate 2D scattering function\r\n * @param pars: parameters of the cylinder\r\n * @param q: q-value\r\n * @return: function value\r\n *\/\r\nstatic double cylinder_analytical_2DXY(CylinderParameters *pars, double qx, double qy) {\r\n  double q;\r\n  q = sqrt(qx*qx+qy*qy);\r\n  return cylinder_analytical_2D_scaled(pars, q, qx\/q, qy\/q);\r\n}\r\n\r\n\/**\r\n * Function to evaluate 2D scattering function\r\n * @param q_x: value of Q along x\r\n * @param q_y: value of Q along y\r\n * @return: function value\r\n *\/\r\ndouble CylinderModel :: operator()(double qx, double qy) {\r\n\tCylinderParameters dp;\r\n\t\/\/ Fill parameter array\r\n\tdp.scale      = scale();\r\n\tdp.radius     = radius();\r\n\tdp.length     = length();\r\n\tdp.sldCyl   = sldCyl();\r\n\tdp.sldSolv   = sldSolv();\r\n\tdp.background = 0.0;\r\n\tdp.cyl_theta  = cyl_theta();\r\n\tdp.cyl_phi    = cyl_phi();\r\n\r\n\t\/\/ Get the dispersion points for the radius\r\n\tvector<WeightPoint> weights_rad;\r\n\tradius.get_weights(weights_rad);\r\n\r\n\t\/\/ Get the dispersion points for the length\r\n\tvector<WeightPoint> weights_len;\r\n\tlength.get_weights(weights_len);\r\n\r\n\t\/\/ Get angular averaging for theta\r\n\tvector<WeightPoint> weights_theta;\r\n\tcyl_theta.get_weights(weights_theta);\r\n\r\n\t\/\/ Get angular averaging for phi\r\n\tvector<WeightPoint> weights_phi;\r\n\tcyl_phi.get_weights(weights_phi);\r\n\r\n\t\/\/ Perform the computation, with all weight points\r\n\tdouble sum = 0.0;\r\n\tdouble norm = 0.0;\r\n\tdouble norm_vol = 0.0;\r\n\tdouble vol = 0.0;\r\n\tdouble pi = 4.0*atan(1.0);\r\n\t\/\/ Loop over radius weight points\r\n\tfor(size_t i=0; i<weights_rad.size(); i++) {\r\n\t\tdp.radius = weights_rad[i].value;\r\n\r\n\r\n\t\t\/\/ Loop over length weight points\r\n\t\tfor(size_t j=0; j<weights_len.size(); j++) {\r\n\t\t\tdp.length = weights_len[j].value;\r\n\r\n\t\t\t\/\/ Average over theta distribution\r\n\t\t\tfor(size_t k=0; k<weights_theta.size(); k++) {\r\n\t\t\t\tdp.cyl_theta = weights_theta[k].value;\r\n\r\n\t\t\t\t\/\/ Average over phi distribution\r\n\t\t\t\tfor(size_t l=0; l<weights_phi.size(); l++) {\r\n\t\t\t\t\tdp.cyl_phi = weights_phi[l].value;\r\n\t\t\t\t\t\/\/Un-normalize by volume\r\n\t\t\t\t\tdouble _ptvalue = weights_rad[i].weight\r\n\t\t\t\t\t\t* weights_len[j].weight\r\n\t\t\t\t\t\t* weights_theta[k].weight\r\n\t\t\t\t\t\t* weights_phi[l].weight\r\n\t\t\t\t\t\t* cylinder_analytical_2DXY(&dp, qx, qy)\r\n\t\t\t\t\t\t*pow(weights_rad[i].value,2)*weights_len[j].value;\r\n\t\t\t\t\tif (weights_theta.size()>1) {\r\n\t\t\t\t\t\t_ptvalue *= fabs(sin(weights_theta[k].value*pi\/180.0));\r\n\t\t\t\t\t}\r\n\t\t\t\t\tsum += _ptvalue;\r\n\t\t\t\t\t\/\/Find average volume\r\n\t\t\t\t\tvol += weights_rad[i].weight\r\n\t\t\t\t\t\t\t* weights_len[j].weight\r\n\t\t\t\t\t\t\t* pow(weights_rad[i].value,2)*weights_len[j].value;\r\n\t\t\t\t\t\/\/Find norm for volume\r\n\t\t\t\t\tnorm_vol += weights_rad[i].weight\r\n\t\t\t\t\t\t\t* weights_len[j].weight;\r\n\r\n\t\t\t\t\tnorm += weights_rad[i].weight\r\n\t\t\t\t\t\t* weights_len[j].weight\r\n\t\t\t\t\t\t* weights_theta[k].weight\r\n\t\t\t\t\t\t* weights_phi[l].weight;\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\/\/ Averaging in theta needs an extra normalization\r\n\t\/\/ factor to account for the sin(theta) term in the\r\n\t\/\/ integration (see documentation).\r\n\tif (weights_theta.size()>1) norm = norm \/ asin(1.0);\r\n\tif (vol != 0.0 && norm_vol != 0.0) {\r\n\t\t\/\/Re-normalize by avg volume\r\n\t\tsum = sum\/(vol\/norm_vol);}\r\n\r\n\treturn sum\/norm + background();\r\n}\r\n\r\n\/**\r\n * Function to evaluate 2D scattering function\r\n * @param pars: parameters of the cylinder\r\n * @param q: q-value\r\n * @param phi: angle phi\r\n * @return: function value\r\n *\/\r\ndouble CylinderModel :: evaluate_rphi(double q, double phi) {\r\n\tdouble qx = q*cos(phi);\r\n\tdouble qy = q*sin(phi);\r\n\treturn (*this).operator()(qx, qy);\r\n}\r\n\/**\r\n * Function to calculate effective radius\r\n * @return: effective radius value\r\n *\/\r\ndouble CylinderModel :: calculate_ER() {\r\n\tCylinderParameters dp;\r\n\r\n\tdp.radius     = radius();\r\n\tdp.length     = length();\r\n\tdouble rad_out = 0.0;\r\n\r\n\t\/\/ Perform the computation, with all weight points\r\n\tdouble sum = 0.0;\r\n\tdouble norm = 0.0;\r\n\r\n\t\/\/ Get the dispersion points for the major shell\r\n\tvector<WeightPoint> weights_length;\r\n\tlength.get_weights(weights_length);\r\n\r\n\t\/\/ Get the dispersion points for the minor shell\r\n\tvector<WeightPoint> weights_radius ;\r\n\tradius.get_weights(weights_radius);\r\n\r\n\t\/\/ Loop over major shell weight points\r\n\tfor(int i=0; i< (int)weights_length.size(); i++) {\r\n\t\tdp.length = weights_length[i].value;\r\n\t\tfor(int k=0; k< (int)weights_radius.size(); k++) {\r\n\t\t\tdp.radius = weights_radius[k].value;\r\n\t\t\t\/\/Note: output of \"DiamCyl(dp.length,dp.radius)\" is DIAMETER.\r\n\t\t\tsum +=weights_length[i].weight\r\n\t\t\t\t* weights_radius[k].weight*DiamCyl(dp.length,dp.radius)\/2.0;\r\n\t\t\tnorm += weights_length[i].weight* weights_radius[k].weight;\r\n\t\t}\r\n\t}\r\n\tif (norm != 0){\r\n\t\t\/\/return the averaged value\r\n\t\trad_out =  sum\/norm;}\r\n\telse{\r\n\t\t\/\/return normal value\r\n\t\t\/\/Note: output of \"DiamCyl(dp.length,dp.radius)\" is DIAMETER.\r\n\t\trad_out = DiamCyl(dp.length,dp.radius)\/2.0;}\r\n\r\n\treturn rad_out;\r\n}\r\ndouble CylinderModel :: calculate_VR() {\r\n  return 1.0;\r\n}\r\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 <config_features.h>\n#include \"formulagroup.hxx\"\n#include \"document.hxx\"\n#include \"formulacell.hxx\"\n#include \"tokenarray.hxx\"\n#include \"compiler.hxx\"\n#include \"interpre.hxx\"\n#include \"scmatrix.hxx\"\n\n#include \"formula\/vectortoken.hxx\"\n\n#include <vector>\n\n#define USE_DUMMY_INTERPRETER 1\n\n#if USE_DUMMY_INTERPRETER\n#include <cstdio>\n#endif\n\nnamespace sc {\n\nScMatrixRef FormulaGroupInterpreterSoftware::inverseMatrix(const ScMatrix& \/*rMat*\/)\n{\n    return ScMatrixRef();\n}\n\nbool FormulaGroupInterpreterSoftware::interpret(ScDocument& rDoc, const ScAddress& rTopPos,\n                                                const ScFormulaCellGroupRef& xGroup,\n                                                ScTokenArray& rCode)\n{\n    \/\/ Decompose the group into individual cells and calculate them individually.\n\n    \/\/ The caller must ensure that the top position is the start position of\n    \/\/ the group.\n\n    ScAddress aTmpPos = rTopPos;\n    std::vector<double> aResults;\n    aResults.reserve(xGroup->mnLength);\n    for (SCROW i = 0; i < xGroup->mnLength; ++i, aTmpPos.IncRow())\n    {\n        ScTokenArray aCode2;\n        for (const formula::FormulaToken* p = rCode.First(); p; p = rCode.Next())\n        {\n            switch (p->GetType())\n            {\n                case formula::svSingleVectorRef:\n                {\n                    const formula::SingleVectorRefToken* p2 = static_cast<const formula::SingleVectorRefToken*>(p);\n                    const double* pArray = p2->GetArray();\n                    aCode2.AddDouble(static_cast<size_t>(i) < p2->GetArrayLength() ? pArray[i] : 0.0);\n                }\n                break;\n                case formula::svDoubleVectorRef:\n                {\n                    const formula::DoubleVectorRefToken* p2 = static_cast<const formula::DoubleVectorRefToken*>(p);\n                    const std::vector<const double*>& rArrays = p2->GetArrays();\n                    size_t nColSize = rArrays.size();\n                    size_t nRowStart = p2->IsStartFixed() ? 0 : i;\n                    size_t nRowEnd = p2->GetRefRowSize() - 1;\n                    if (!p2->IsEndFixed())\n                        nRowEnd += i;\n                    size_t nRowSize = nRowEnd - nRowStart + 1;\n                    ScMatrixRef pMat(new ScMatrix(nColSize, nRowSize, 0.0));\n                    for (size_t nCol = 0; nCol < nColSize; ++nCol)\n                    {\n                        const double* pArray = rArrays[nCol];\n                        pArray += nRowStart;\n                        pMat->PutDouble(pArray, nRowSize, nCol, 0);\n                    }\n\n                    ScMatrixToken aTok(pMat);\n                    aCode2.AddToken(aTok);\n                }\n                break;\n                default:\n                    aCode2.AddToken(*p);\n            }\n        }\n\n        ScFormulaCell* pDest = rDoc.GetFormulaCell(aTmpPos);\n        if (!pDest)\n            return false;\n\n        generateRPNCode(rDoc, aTmpPos, aCode2);\n        ScInterpreter aInterpreter(pDest, &rDoc, aTmpPos, aCode2);\n        aInterpreter.Interpret();\n        aResults.push_back(aInterpreter.GetResultToken()->GetDouble());\n    } \/\/ for loop end (xGroup->mnLength)\n\n    if (!aResults.empty())\n        rDoc.SetFormulaResults(rTopPos, &aResults[0], aResults.size());\n\n    return true;\n}\n\n\/\/ TODO: load module, hook symbol out, check it works, UI on failure etc.\nnamespace opencl {\n    extern sc::FormulaGroupInterpreter *createFormulaGroupInterpreter();\n}\nFormulaGroupInterpreter *FormulaGroupInterpreter::msInstance = NULL;\n\n#if USE_DUMMY_INTERPRETER\nclass FormulaGroupInterpreterDummy : public FormulaGroupInterpreter\n{\n    enum Mode {\n        WRITE_OUTPUT = 0\n    };\n    Mode meMode;\npublic:\n    FormulaGroupInterpreterDummy()\n    {\n        const char *pValue = getenv(\"FORMULA_GROUP_DUMMY\");\n        meMode = static_cast<Mode>(OString(pValue, strlen(pValue)).toInt32());\n        fprintf(stderr, \"Using Dummy Formula Group interpreter mode %d\\n\", (int)meMode);\n    }\n\n    virtual ScMatrixRef inverseMatrix(const ScMatrix& \/*rMat*\/)\n    {\n        return ScMatrixRef();\n    }\n\n    virtual bool interpret(ScDocument& rDoc, const ScAddress& rTopPos,\n                           const ScFormulaCellGroupRef& xGroup,\n                           ScTokenArray& rCode)\n    {\n        (void)rCode;\n\n        \/\/ Write simple data back into the sheet\n        if (meMode == WRITE_OUTPUT)\n        {\n            double *pDoubles = new double[xGroup->mnLength];\n            for (sal_Int32 i = 0; i < xGroup->mnLength; i++)\n                pDoubles[i] = 42.0 + i;\n            rDoc.SetFormulaResults(rTopPos, pDoubles, xGroup->mnLength);\n            delete [] pDoubles;\n        }\n        return true;\n    }\n};\n#endif\n\n\/\/\/ load and\/or configure the correct formula group interpreter\nFormulaGroupInterpreter *FormulaGroupInterpreter::getStatic()\n{\n    static bool bOpenCLEnabled = false;\n\n#if USE_DUMMY_INTERPRETER\n    if (getenv(\"FORMULA_GROUP_DUMMY\"))\n    {\n        delete msInstance;\n        return msInstance = new sc::FormulaGroupInterpreterDummy();\n    }\n#endif\n\n    if ( msInstance &&\n         bOpenCLEnabled != ScInterpreter::GetGlobalConfig().mbOpenCLEnabled )\n    {\n        bOpenCLEnabled = ScInterpreter::GetGlobalConfig().mbOpenCLEnabled;\n        delete msInstance;\n        msInstance = NULL;\n    }\n\n    if ( !msInstance )\n    {\n#if HAVE_FEATURE_OPENCL\n        if ( ScInterpreter::GetGlobalConfig().mbOpenCLEnabled )\n            msInstance = sc::opencl::createFormulaGroupInterpreter();\n#endif\n        if ( !msInstance ) \/\/ software fallback\n            msInstance = new sc::FormulaGroupInterpreterSoftware();\n    }\n\n    return msInstance;\n}\n\nvoid FormulaGroupInterpreter::generateRPNCode(ScDocument& rDoc, const ScAddress& rPos, ScTokenArray& rCode)\n{\n    \/\/ First, generate an RPN (reverse polish notation) token array.\n    ScCompiler aComp(&rDoc, rPos, rCode);\n    aComp.SetGrammar(rDoc.GetGrammar());\n    aComp.CompileTokenArray(); \/\/ Create RPN token array.\n    \/\/ Now, calling FirstRPN() and NextRPN() will return tokens from the RPN token array.\n}\n\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Cache select converted tokens to avoid unnecessary token duplication.<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 <config_features.h>\n#include \"formulagroup.hxx\"\n#include \"document.hxx\"\n#include \"formulacell.hxx\"\n#include \"tokenarray.hxx\"\n#include \"compiler.hxx\"\n#include \"interpre.hxx\"\n#include \"scmatrix.hxx\"\n\n#include \"formula\/vectortoken.hxx\"\n\n#include <vector>\n#include <boost\/unordered_map.hpp>\n\n#define USE_DUMMY_INTERPRETER 1\n\n#if USE_DUMMY_INTERPRETER\n#include <cstdio>\n#endif\n\nnamespace sc {\n\nScMatrixRef FormulaGroupInterpreterSoftware::inverseMatrix(const ScMatrix& \/*rMat*\/)\n{\n    return ScMatrixRef();\n}\n\nbool FormulaGroupInterpreterSoftware::interpret(ScDocument& rDoc, const ScAddress& rTopPos,\n                                                const ScFormulaCellGroupRef& xGroup,\n                                                ScTokenArray& rCode)\n{\n    typedef boost::unordered_map<const formula::FormulaToken*, formula::FormulaTokenRef> CachedTokensType;\n\n    \/\/ Decompose the group into individual cells and calculate them individually.\n\n    \/\/ The caller must ensure that the top position is the start position of\n    \/\/ the group.\n\n    ScAddress aTmpPos = rTopPos;\n    std::vector<double> aResults;\n    aResults.reserve(xGroup->mnLength);\n    CachedTokensType aCachedTokens;\n\n    for (SCROW i = 0; i < xGroup->mnLength; ++i, aTmpPos.IncRow())\n    {\n        ScTokenArray aCode2;\n        for (const formula::FormulaToken* p = rCode.First(); p; p = rCode.Next())\n        {\n            CachedTokensType::iterator it = aCachedTokens.find(p);\n            if (it != aCachedTokens.end())\n            {\n                \/\/ This token is cached. Use the cached one.\n                aCode2.AddToken(*it->second);\n                continue;\n            }\n\n            switch (p->GetType())\n            {\n                case formula::svSingleVectorRef:\n                {\n                    const formula::SingleVectorRefToken* p2 = static_cast<const formula::SingleVectorRefToken*>(p);\n                    const double* pArray = p2->GetArray();\n                    aCode2.AddDouble(static_cast<size_t>(i) < p2->GetArrayLength() ? pArray[i] : 0.0);\n                }\n                break;\n                case formula::svDoubleVectorRef:\n                {\n                    const formula::DoubleVectorRefToken* p2 = static_cast<const formula::DoubleVectorRefToken*>(p);\n                    const std::vector<const double*>& rArrays = p2->GetArrays();\n                    size_t nColSize = rArrays.size();\n                    size_t nRowStart = p2->IsStartFixed() ? 0 : i;\n                    size_t nRowEnd = p2->GetRefRowSize() - 1;\n                    if (!p2->IsEndFixed())\n                        nRowEnd += i;\n                    size_t nRowSize = nRowEnd - nRowStart + 1;\n                    ScMatrixRef pMat(new ScMatrix(nColSize, nRowSize, 0.0));\n                    for (size_t nCol = 0; nCol < nColSize; ++nCol)\n                    {\n                        const double* pArray = rArrays[nCol];\n                        pArray += nRowStart;\n                        pMat->PutDouble(pArray, nRowSize, nCol, 0);\n                    }\n\n                    if (p2->IsStartFixed() && p2->IsEndFixed())\n                    {\n                        \/\/ Cached the converted token for absolute range referene.\n                        formula::FormulaTokenRef xTok(new ScMatrixToken(pMat));\n                        aCachedTokens.insert(CachedTokensType::value_type(p, xTok));\n                        aCode2.AddToken(*xTok);\n                    }\n                    else\n                    {\n                        ScMatrixToken aTok(pMat);\n                        aCode2.AddToken(aTok);\n                    }\n                }\n                break;\n                default:\n                    aCode2.AddToken(*p);\n            }\n        }\n\n        ScFormulaCell* pDest = rDoc.GetFormulaCell(aTmpPos);\n        if (!pDest)\n            return false;\n\n        generateRPNCode(rDoc, aTmpPos, aCode2);\n        ScInterpreter aInterpreter(pDest, &rDoc, aTmpPos, aCode2);\n        aInterpreter.Interpret();\n        aResults.push_back(aInterpreter.GetResultToken()->GetDouble());\n    } \/\/ for loop end (xGroup->mnLength)\n\n    if (!aResults.empty())\n        rDoc.SetFormulaResults(rTopPos, &aResults[0], aResults.size());\n\n    return true;\n}\n\n\/\/ TODO: load module, hook symbol out, check it works, UI on failure etc.\nnamespace opencl {\n    extern sc::FormulaGroupInterpreter *createFormulaGroupInterpreter();\n}\nFormulaGroupInterpreter *FormulaGroupInterpreter::msInstance = NULL;\n\n#if USE_DUMMY_INTERPRETER\nclass FormulaGroupInterpreterDummy : public FormulaGroupInterpreter\n{\n    enum Mode {\n        WRITE_OUTPUT = 0\n    };\n    Mode meMode;\npublic:\n    FormulaGroupInterpreterDummy()\n    {\n        const char *pValue = getenv(\"FORMULA_GROUP_DUMMY\");\n        meMode = static_cast<Mode>(OString(pValue, strlen(pValue)).toInt32());\n        fprintf(stderr, \"Using Dummy Formula Group interpreter mode %d\\n\", (int)meMode);\n    }\n\n    virtual ScMatrixRef inverseMatrix(const ScMatrix& \/*rMat*\/)\n    {\n        return ScMatrixRef();\n    }\n\n    virtual bool interpret(ScDocument& rDoc, const ScAddress& rTopPos,\n                           const ScFormulaCellGroupRef& xGroup,\n                           ScTokenArray& rCode)\n    {\n        (void)rCode;\n\n        \/\/ Write simple data back into the sheet\n        if (meMode == WRITE_OUTPUT)\n        {\n            double *pDoubles = new double[xGroup->mnLength];\n            for (sal_Int32 i = 0; i < xGroup->mnLength; i++)\n                pDoubles[i] = 42.0 + i;\n            rDoc.SetFormulaResults(rTopPos, pDoubles, xGroup->mnLength);\n            delete [] pDoubles;\n        }\n        return true;\n    }\n};\n#endif\n\n\/\/\/ load and\/or configure the correct formula group interpreter\nFormulaGroupInterpreter *FormulaGroupInterpreter::getStatic()\n{\n    static bool bOpenCLEnabled = false;\n\n#if USE_DUMMY_INTERPRETER\n    if (getenv(\"FORMULA_GROUP_DUMMY\"))\n    {\n        delete msInstance;\n        return msInstance = new sc::FormulaGroupInterpreterDummy();\n    }\n#endif\n\n    if ( msInstance &&\n         bOpenCLEnabled != ScInterpreter::GetGlobalConfig().mbOpenCLEnabled )\n    {\n        bOpenCLEnabled = ScInterpreter::GetGlobalConfig().mbOpenCLEnabled;\n        delete msInstance;\n        msInstance = NULL;\n    }\n\n    if ( !msInstance )\n    {\n#if HAVE_FEATURE_OPENCL\n        if ( ScInterpreter::GetGlobalConfig().mbOpenCLEnabled )\n            msInstance = sc::opencl::createFormulaGroupInterpreter();\n#endif\n        if ( !msInstance ) \/\/ software fallback\n            msInstance = new sc::FormulaGroupInterpreterSoftware();\n    }\n\n    return msInstance;\n}\n\nvoid FormulaGroupInterpreter::generateRPNCode(ScDocument& rDoc, const ScAddress& rPos, ScTokenArray& rCode)\n{\n    \/\/ First, generate an RPN (reverse polish notation) token array.\n    ScCompiler aComp(&rDoc, rPos, rCode);\n    aComp.SetGrammar(rDoc.GetGrammar());\n    aComp.CompileTokenArray(); \/\/ Create RPN token array.\n    \/\/ Now, calling FirstRPN() and NextRPN() will return tokens from the RPN token array.\n}\n\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\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\n#include \"AliEveTPCSectorVizEditor.h\"\n#include <EveDet\/AliEveTPCSectorViz.h>\n\n#include <TEveGValuators.h>\n\n#include <TVirtualPad.h>\n\n#include <TGButton.h>\n#include <TGNumberEntry.h>\n#include <TGSlider.h>\n#include <TGDoubleSlider.h>\n\n\n\/\/______________________________________________________________________________\n\/\/\n\/\/ Editor for AliEveTPCSectorViz.\n\nClassImp(AliEveTPCSectorVizEditor)\n\nAliEveTPCSectorVizEditor::AliEveTPCSectorVizEditor(const TGWindow *p,\n                                       Int_t width, Int_t height,\n                                       UInt_t options, Pixel_t back) :\n  TGedFrame(p, width, height, options | kVerticalFrame, back),\n  fM(0),\n  fSectorID  (0), fAutoTrans (0),\n  fRnrInn    (0), fRnrOut1   (0), fRnrOut2(0),\n  fThreshold (0), fMaxVal    (0),\n  fTime      (0)\n{\n  \/\/ Constructor.\n\n  fPriority = 40;\n\n  Int_t labelW = 60;\n\n  MakeTitle(\"AliEveTPCSectorViz\");\n\n  fSectorID = new TEveGValuator(this, \"SectorID\", 110, 0);\n  fSectorID->SetLabelWidth(labelW);\n  fSectorID->SetShowSlider(kFALSE);\n  fSectorID->SetNELength(4);\n  fSectorID->Build();\n  fSectorID->SetLimits(0, 35);\n  fSectorID->SetToolTip(\"0-17 +z plate; 18-35 -z plate\");\n  fSectorID->Connect(\"ValueSet(Double_t)\",\n\t\t     \"AliEveTPCSectorVizEditor\", this, \"DoSectorID()\");\n  \/\/ Reuse sectorID for auto-transformation button\n  fAutoTrans = new TGCheckButton(fSectorID, \"AutoTrans\");\n  fAutoTrans->SetToolTipText(\"Automatically set transformation to true position\");\n  fSectorID->AddFrame(fAutoTrans, new TGLayoutHints(kLHintsLeft, 12, 0, 1, 0));\n  fAutoTrans->Connect(\"Toggled(Bool_t)\",\"AliEveTPCSectorVizEditor\", this, \"DoAutoTrans()\");\n  AddFrame(fSectorID, new TGLayoutHints(kLHintsTop, 1, 1, 1, 1));\n\n  {\n    TGHorizontalFrame* f = new TGHorizontalFrame(this);\n\n    fRnrInn = new TGCheckButton(f, \"Inner\");\n    f->AddFrame(fRnrInn, new TGLayoutHints(kLHintsTop, 3, 1, 1, 0));\n    fRnrInn->Connect(\"Toggled(Bool_t)\",\"AliEveTPCSectorVizEditor\", this, \"DoRnrInn()\");\n\n    fRnrOut1 = new TGCheckButton(f, \"Outer 1\");\n    f->AddFrame(fRnrOut1, new TGLayoutHints(kLHintsTop, 3, 1, 1, 0));\n    fRnrOut1->Connect(\"Toggled(Bool_t)\",\"AliEveTPCSectorVizEditor\", this, \"DoRnrOut1()\");\n\n    fRnrOut2 = new TGCheckButton(f, \"Outer 2\");\n    f->AddFrame(fRnrOut2, new TGLayoutHints(kLHintsTop, 3, 1, 1, 0));\n    fRnrOut2->Connect(\"Toggled(Bool_t)\",\"AliEveTPCSectorVizEditor\", this, \"DoRnrOut2()\");\n\n    AddFrame(f, new TGLayoutHints(kLHintsTop, 1, 1, 1, 1));\n  }\n\n  fThreshold = new TEveGValuator(this, \"Threshold\", 200, 0);\n  fThreshold->SetNELength(4);\n  fThreshold->SetLabelWidth(labelW);\n  fThreshold->Build();\n  fThreshold->GetSlider()->SetWidth(120);\n  fThreshold->SetLimits(0,250);\n  fThreshold->Connect(\"ValueSet(Double_t)\",\n\t\t      \"AliEveTPCSectorVizEditor\", this, \"DoThreshold()\");\n  AddFrame(fThreshold, new TGLayoutHints(kLHintsTop, 1, 1, 2, 1));\n\n  fMaxVal = new TEveGValuator(this,\"MaxVal\", 200, 0);\n  fMaxVal->SetNELength(4);\n  fMaxVal->SetLabelWidth(labelW);\n  fMaxVal->Build();\n  fMaxVal->GetSlider()->SetWidth(120);\n  fMaxVal->SetLimits(0, 500);\n  fMaxVal->Connect(\"ValueSet(Double_t)\",\n\t\t   \"AliEveTPCSectorVizEditor\", this, \"DoMaxVal()\");\n  AddFrame(fMaxVal, new TGLayoutHints(kLHintsTop, 1, 1, 2, 1));\n\n  fTime = new TEveGDoubleValuator(this,\"Time\", 200, 0);\n  fTime->SetNELength(4);\n  fTime->SetLabelWidth(labelW);\n  fTime->Build();\n  fTime->GetSlider()->SetWidth(224);\n  fTime->SetLimits(0, 1023, TGNumberFormat::kNESInteger);\n  fTime->Connect(\"ValueSet()\",\n\t\t \"AliEveTPCSectorVizEditor\", this, \"DoTime()\");\n  AddFrame(fTime, new TGLayoutHints(kLHintsTop, 1, 1, 2, 1));\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::SetModel(TObject* obj)\n{\n  \/\/ Set model object.\n\n  fM = dynamic_cast<AliEveTPCSectorViz*>(obj);\n\n  fSectorID->SetValue(fM->fSectorID);\n  fAutoTrans->SetState(fM->fAutoTrans  ? kButtonDown : kButtonUp);\n\n  fRnrInn ->SetState(fM->fRnrInn  ? kButtonDown : kButtonUp);\n  fRnrOut1->SetState(fM->fRnrOut1 ? kButtonDown : kButtonUp);\n  fRnrOut2->SetState(fM->fRnrOut2 ? kButtonDown : kButtonUp);\n\n  fThreshold->SetValue(fM->fThreshold);\n  fMaxVal->SetValue(fM->fMaxVal);\n\n  fTime->SetValues(fM->fMinTime, fM->fMaxTime);\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::DoSectorID()\n{\n  \/\/ Slot for SectorID.\n\n  fM->SetSectorID((Int_t) fSectorID->GetValue());\n  Update();\n}\n\nvoid AliEveTPCSectorVizEditor::DoAutoTrans()\n{\n  \/\/ Slot for AutoTrans.\n\n  fM->SetAutoTrans(fAutoTrans->IsOn());\n  Update();\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::DoRnrInn()\n{\n  \/\/ Slot for RnrInn.\n\n  fM->SetRnrInn(fRnrInn->IsOn());\n  Update();\n}\n\nvoid AliEveTPCSectorVizEditor::DoRnrOut1()\n{\n  \/\/ Slot for RnrOut1.\n\n  fM->SetRnrOut1(fRnrOut1->IsOn());\n  Update();\n}\n\nvoid AliEveTPCSectorVizEditor::DoRnrOut2()\n{\n  \/\/ Slot for RnrOut2.\n\n  fM->SetRnrOut2(fRnrOut2->IsOn());\n  Update();\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::DoThreshold()\n{\n  \/\/ Slot for Threshold.\n\n  fM->SetThreshold((Short_t) fThreshold->GetValue());\n  fThreshold->SetValue(fM->fThreshold);\n  Update();\n}\n\nvoid AliEveTPCSectorVizEditor::DoMaxVal()\n{\n  \/\/ Slot for MaxVal.\n\n  fM->SetMaxVal((Int_t) fMaxVal->GetValue());\n  fMaxVal->SetValue(fM->fMaxVal);\n  Update();\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::DoTime()\n{\n  \/\/ Slot for time-range.\n\n  fM->SetMinTime((Int_t) fTime->GetMin());\n  fM->SetMaxTime((Int_t) fTime->GetMax());\n  Update();\n}\n<commit_msg>Coverity<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\n#include \"AliEveTPCSectorVizEditor.h\"\n#include <EveDet\/AliEveTPCSectorViz.h>\n\n#include <TEveGValuators.h>\n\n#include <TVirtualPad.h>\n\n#include <TGButton.h>\n#include <TGNumberEntry.h>\n#include <TGSlider.h>\n#include <TGDoubleSlider.h>\n\n\n\/\/______________________________________________________________________________\n\/\/\n\/\/ Editor for AliEveTPCSectorViz.\n\nClassImp(AliEveTPCSectorVizEditor)\n\nAliEveTPCSectorVizEditor::AliEveTPCSectorVizEditor(const TGWindow *p,\n                                       Int_t width, Int_t height,\n                                       UInt_t options, Pixel_t back) :\n  TGedFrame(p, width, height, options | kVerticalFrame, back),\n  fM(0),\n  fSectorID  (0), fAutoTrans (0),\n  fRnrInn    (0), fRnrOut1   (0), fRnrOut2(0),\n  fThreshold (0), fMaxVal    (0),\n  fTime      (0)\n{\n  \/\/ Constructor.\n\n  fPriority = 40;\n\n  Int_t labelW = 60;\n\n  MakeTitle(\"AliEveTPCSectorViz\");\n\n  fSectorID = new TEveGValuator(this, \"SectorID\", 110, 0);\n  fSectorID->SetLabelWidth(labelW);\n  fSectorID->SetShowSlider(kFALSE);\n  fSectorID->SetNELength(4);\n  fSectorID->Build();\n  fSectorID->SetLimits(0, 35);\n  fSectorID->SetToolTip(\"0-17 +z plate; 18-35 -z plate\");\n  fSectorID->Connect(\"ValueSet(Double_t)\",\n\t\t     \"AliEveTPCSectorVizEditor\", this, \"DoSectorID()\");\n  \/\/ Reuse sectorID for auto-transformation button\n  fAutoTrans = new TGCheckButton(fSectorID, \"AutoTrans\");\n  fAutoTrans->SetToolTipText(\"Automatically set transformation to true position\");\n  fSectorID->AddFrame(fAutoTrans, new TGLayoutHints(kLHintsLeft, 12, 0, 1, 0));\n  fAutoTrans->Connect(\"Toggled(Bool_t)\",\"AliEveTPCSectorVizEditor\", this, \"DoAutoTrans()\");\n  AddFrame(fSectorID, new TGLayoutHints(kLHintsTop, 1, 1, 1, 1));\n\n  {\n    TGHorizontalFrame* f = new TGHorizontalFrame(this);\n\n    fRnrInn = new TGCheckButton(f, \"Inner\");\n    f->AddFrame(fRnrInn, new TGLayoutHints(kLHintsTop, 3, 1, 1, 0));\n    fRnrInn->Connect(\"Toggled(Bool_t)\",\"AliEveTPCSectorVizEditor\", this, \"DoRnrInn()\");\n\n    fRnrOut1 = new TGCheckButton(f, \"Outer 1\");\n    f->AddFrame(fRnrOut1, new TGLayoutHints(kLHintsTop, 3, 1, 1, 0));\n    fRnrOut1->Connect(\"Toggled(Bool_t)\",\"AliEveTPCSectorVizEditor\", this, \"DoRnrOut1()\");\n\n    fRnrOut2 = new TGCheckButton(f, \"Outer 2\");\n    f->AddFrame(fRnrOut2, new TGLayoutHints(kLHintsTop, 3, 1, 1, 0));\n    fRnrOut2->Connect(\"Toggled(Bool_t)\",\"AliEveTPCSectorVizEditor\", this, \"DoRnrOut2()\");\n\n    AddFrame(f, new TGLayoutHints(kLHintsTop, 1, 1, 1, 1));\n  }\n\n  fThreshold = new TEveGValuator(this, \"Threshold\", 200, 0);\n  fThreshold->SetNELength(4);\n  fThreshold->SetLabelWidth(labelW);\n  fThreshold->Build();\n  fThreshold->GetSlider()->SetWidth(120);\n  fThreshold->SetLimits(0,250);\n  fThreshold->Connect(\"ValueSet(Double_t)\",\n\t\t      \"AliEveTPCSectorVizEditor\", this, \"DoThreshold()\");\n  AddFrame(fThreshold, new TGLayoutHints(kLHintsTop, 1, 1, 2, 1));\n\n  fMaxVal = new TEveGValuator(this,\"MaxVal\", 200, 0);\n  fMaxVal->SetNELength(4);\n  fMaxVal->SetLabelWidth(labelW);\n  fMaxVal->Build();\n  fMaxVal->GetSlider()->SetWidth(120);\n  fMaxVal->SetLimits(0, 500);\n  fMaxVal->Connect(\"ValueSet(Double_t)\",\n\t\t   \"AliEveTPCSectorVizEditor\", this, \"DoMaxVal()\");\n  AddFrame(fMaxVal, new TGLayoutHints(kLHintsTop, 1, 1, 2, 1));\n\n  fTime = new TEveGDoubleValuator(this,\"Time\", 200, 0);\n  fTime->SetNELength(4);\n  fTime->SetLabelWidth(labelW);\n  fTime->Build();\n  fTime->GetSlider()->SetWidth(224);\n  fTime->SetLimits(0, 1023, TGNumberFormat::kNESInteger);\n  fTime->Connect(\"ValueSet()\",\n\t\t \"AliEveTPCSectorVizEditor\", this, \"DoTime()\");\n  AddFrame(fTime, new TGLayoutHints(kLHintsTop, 1, 1, 2, 1));\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::SetModel(TObject* obj)\n{\n  \/\/ Set model object.\n\n  fM = static_cast<AliEveTPCSectorViz*>(obj);\n\n  fSectorID->SetValue(fM->fSectorID);\n  fAutoTrans->SetState(fM->fAutoTrans  ? kButtonDown : kButtonUp);\n\n  fRnrInn ->SetState(fM->fRnrInn  ? kButtonDown : kButtonUp);\n  fRnrOut1->SetState(fM->fRnrOut1 ? kButtonDown : kButtonUp);\n  fRnrOut2->SetState(fM->fRnrOut2 ? kButtonDown : kButtonUp);\n\n  fThreshold->SetValue(fM->fThreshold);\n  fMaxVal->SetValue(fM->fMaxVal);\n\n  fTime->SetValues(fM->fMinTime, fM->fMaxTime);\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::DoSectorID()\n{\n  \/\/ Slot for SectorID.\n\n  fM->SetSectorID((Int_t) fSectorID->GetValue());\n  Update();\n}\n\nvoid AliEveTPCSectorVizEditor::DoAutoTrans()\n{\n  \/\/ Slot for AutoTrans.\n\n  fM->SetAutoTrans(fAutoTrans->IsOn());\n  Update();\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::DoRnrInn()\n{\n  \/\/ Slot for RnrInn.\n\n  fM->SetRnrInn(fRnrInn->IsOn());\n  Update();\n}\n\nvoid AliEveTPCSectorVizEditor::DoRnrOut1()\n{\n  \/\/ Slot for RnrOut1.\n\n  fM->SetRnrOut1(fRnrOut1->IsOn());\n  Update();\n}\n\nvoid AliEveTPCSectorVizEditor::DoRnrOut2()\n{\n  \/\/ Slot for RnrOut2.\n\n  fM->SetRnrOut2(fRnrOut2->IsOn());\n  Update();\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::DoThreshold()\n{\n  \/\/ Slot for Threshold.\n\n  fM->SetThreshold((Short_t) fThreshold->GetValue());\n  fThreshold->SetValue(fM->fThreshold);\n  Update();\n}\n\nvoid AliEveTPCSectorVizEditor::DoMaxVal()\n{\n  \/\/ Slot for MaxVal.\n\n  fM->SetMaxVal((Int_t) fMaxVal->GetValue());\n  fMaxVal->SetValue(fM->fMaxVal);\n  Update();\n}\n\n\/******************************************************************************\/\n\nvoid AliEveTPCSectorVizEditor::DoTime()\n{\n  \/\/ Slot for time-range.\n\n  fM->SetMinTime((Int_t) fTime->GetMin());\n  fM->SetMaxTime((Int_t) fTime->GetMax());\n  Update();\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  UIOBuffer.cc\n\n**************************************************************************\/\n#include \"P_EventSystem.h\"\n\n\/\/\n\/\/ General Buffer Allocator\n\/\/\ninkcoreapi Allocator ioBufAllocator[DEFAULT_BUFFER_SIZES];\ninkcoreapi ClassAllocator<MIOBuffer> ioAllocator(\"ioAllocator\", DEFAULT_BUFFER_NUMBER);\ninkcoreapi ClassAllocator<IOBufferData> ioDataAllocator(\"ioDataAllocator\", DEFAULT_BUFFER_NUMBER);\ninkcoreapi ClassAllocator<IOBufferBlock> ioBlockAllocator(\"ioBlockAllocator\", DEFAULT_BUFFER_NUMBER);\nint64_t default_large_iobuffer_size = DEFAULT_LARGE_BUFFER_SIZE;\nint64_t default_small_iobuffer_size = DEFAULT_SMALL_BUFFER_SIZE;\nint64_t max_iobuffer_size = DEFAULT_BUFFER_SIZES - 1;\n\n\/\/\n\/\/ Initialization\n\/\/\nvoid\ninit_buffer_allocators()\n{\n  char *name;\n  int advice = 0;\n\n#ifdef MADV_DONTDUMP \/\/ This should only exist on Linux 3.4 and higher.\n  advice = MADV_DONTDUMP;\n#endif\n\n  for (int i = 0; i < DEFAULT_BUFFER_SIZES; i++) {\n    int64_t s = DEFAULT_BUFFER_BASE_SIZE * (((int64_t)1) << i);\n    int64_t a = DEFAULT_BUFFER_ALIGNMENT;\n    int n = i <= default_large_iobuffer_size ? DEFAULT_BUFFER_NUMBER : DEFAULT_HUGE_BUFFER_NUMBER;\n    if (s < a)\n      a = s;\n\n    name = new char[64];\n    snprintf(name, 64, \"ioBufAllocator[%d]\", i);\n    ioBufAllocator[i].re_init(name, s, n, a, advice);\n  }\n}\n\nint64_t\nMIOBuffer::remove_append(IOBufferReader * r)\n{\n  int64_t l = 0;\n  while (r->block) {\n    Ptr<IOBufferBlock> b = r->block;\n    r->block = r->block->next;\n    b->_start += r->start_offset;\n    if (b->start() >= b->end()) {\n      r->start_offset = -r->start_offset;\n      continue;\n    }\n    r->start_offset = 0;\n    l += b->read_avail();\n    append_block(b);\n  }\n  r->mbuf->_writer = NULL;\n  return l;\n}\n\nint64_t\nMIOBuffer::write(const void *abuf, int64_t alen)\n{\n  const char *buf = (const char*)abuf;\n  int64_t len = alen;\n  while (len) {\n    if (!_writer)\n      add_block();\n    int64_t f = _writer->write_avail();\n    f = f < len ? f : len;\n    if (f > 0) {\n      ::memcpy(_writer->end(), buf, f);\n      _writer->fill(f);\n      buf += f;\n      len -= f;\n    }\n    if (len) {\n      if (!_writer->next)\n        add_block();\n      else\n        _writer = _writer->next;\n    }\n  }\n  return alen;\n}\n\n\n#ifdef WRITE_AND_TRANSFER\n  \/*\n   * Same functionality as write but for the one small difference.\n   * The space available in the last block is taken from the original\n   * and this space becomes available to the copy.\n   *\n   *\/\nint64_t\nMIOBuffer::write_and_transfer_left_over_space(IOBufferReader * r, int64_t alen, int64_t offset)\n{\n  int64_t rval = write(r, alen, offset);\n  \/\/ reset the end markers of the original so that it cannot\n  \/\/ make use of the space in the current block\n  if (r->mbuf->_writer)\n    r->mbuf->_writer->_buf_end = r->mbuf->_writer->_end;\n  \/\/ reset the end marker of the clone so that it can make\n  \/\/ use of the space in the current block\n  if (_writer) {\n    _writer->_buf_end = _writer->data->data() + _writer->block_size();\n  }\n  return rval;\n}\n\n#endif\n\n\nint64_t\nMIOBuffer::write(IOBufferReader * r, int64_t alen, int64_t offset)\n{\n  int64_t len = alen;\n  IOBufferBlock *b = r->block;\n  offset += r->start_offset;\n\n  while (b && len > 0) {\n    int64_t max_bytes = b->read_avail();\n    max_bytes -= offset;\n    if (max_bytes <= 0) {\n      offset = -max_bytes;\n      b = b->next;\n      continue;\n    }\n    int64_t bytes;\n    if (len<0 || len>= max_bytes)\n      bytes = max_bytes;\n    else\n      bytes = len;\n    IOBufferBlock *bb = b->clone();\n    bb->_start += offset;\n    bb->_buf_end = bb->_end = bb->_start + bytes;\n    append_block(bb);\n    offset = 0;\n    len -= bytes;\n    b = b->next;\n  }\n  return alen - len;\n}\n\nint64_t\nMIOBuffer::puts(char *s, int64_t len)\n{\n  char *pc = end();\n  char *pb = s;\n  while (pc < buf_end()) {\n    if (len-- <= 0)\n      return -1;\n    if (!*pb || *pb == '\\n') {\n      int64_t n = (int64_t) (pb - s);\n      memcpy(end(), s, n + 1);  \/\/ Upto and including '\\n'\n      end()[n + 1] = 0;\n      fill(n + 1);\n      return n + 1;\n    }\n    pc++;\n    pb++;\n  }\n  return 0;\n}\n\nint64_t\nIOBufferReader::read(void *ab, int64_t len)\n{\n  char *b = (char*)ab;\n  int64_t max_bytes = read_avail();\n  int64_t bytes = len <= max_bytes ? len : max_bytes;\n  int64_t n = bytes;\n\n  while (n) {\n    int64_t l = block_read_avail();\n    if (n < l)\n      l = n;\n    ::memcpy(b, start(), l);\n    consume(l);\n    b += l;\n    n -= l;\n  }\n  return bytes;\n}\n\n\/\/ TODO: I don't think this method is used anywhere, so perhaps get rid of it ?\nint64_t\nIOBufferReader::memchr(char c, int64_t len, int64_t offset)\n{\n  IOBufferBlock *b = block;\n  offset += start_offset;\n  int64_t o = offset;\n\n  while (b && len) {\n    int64_t max_bytes = b->read_avail();\n    max_bytes -= offset;\n    if (max_bytes <= 0) {\n      offset = -max_bytes;\n      b = b->next;\n      continue;\n    }\n    int64_t bytes;\n    if (len<0 || len>= max_bytes)\n      bytes = max_bytes;\n    else\n      bytes = len;\n    char *s = b->start() + offset;\n    char *p = (char *) ::memchr(s, c, bytes);\n    if (p)\n      return (int64_t) (o - start_offset + p - s);\n    o += bytes;\n    len -= bytes;\n    b = b->next;\n    offset = 0;\n  }\n\n  return -1;\n}\n\nchar *\nIOBufferReader::memcpy(const void *ap, int64_t len, int64_t offset)\n{\n  char *p = (char*)ap;\n  IOBufferBlock *b = block;\n  offset += start_offset;\n\n  while (b && len) {\n    int64_t max_bytes = b->read_avail();\n    max_bytes -= offset;\n    if (max_bytes <= 0) {\n      offset = -max_bytes;\n      b = b->next;\n      continue;\n    }\n    int64_t bytes;\n    if (len<0 || len>= max_bytes)\n      bytes = max_bytes;\n    else\n      bytes = len;\n    ::memcpy(p, b->start() + offset, bytes);\n    p += bytes;\n    len -= bytes;\n    b = b->next;\n    offset = 0;\n  }\n\n  return p;\n}\n<commit_msg>TS-3417: Add overlooked include back<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  UIOBuffer.cc\n\n**************************************************************************\/\n#include \"ink_defs.h\"\n#include \"P_EventSystem.h\"\n\n\/\/\n\/\/ General Buffer Allocator\n\/\/\ninkcoreapi Allocator ioBufAllocator[DEFAULT_BUFFER_SIZES];\ninkcoreapi ClassAllocator<MIOBuffer> ioAllocator(\"ioAllocator\", DEFAULT_BUFFER_NUMBER);\ninkcoreapi ClassAllocator<IOBufferData> ioDataAllocator(\"ioDataAllocator\", DEFAULT_BUFFER_NUMBER);\ninkcoreapi ClassAllocator<IOBufferBlock> ioBlockAllocator(\"ioBlockAllocator\", DEFAULT_BUFFER_NUMBER);\nint64_t default_large_iobuffer_size = DEFAULT_LARGE_BUFFER_SIZE;\nint64_t default_small_iobuffer_size = DEFAULT_SMALL_BUFFER_SIZE;\nint64_t max_iobuffer_size = DEFAULT_BUFFER_SIZES - 1;\n\n\/\/\n\/\/ Initialization\n\/\/\nvoid\ninit_buffer_allocators()\n{\n  char *name;\n  int advice = 0;\n\n#ifdef MADV_DONTDUMP \/\/ This should only exist on Linux 3.4 and higher.\n  advice = MADV_DONTDUMP;\n#endif\n\n  for (int i = 0; i < DEFAULT_BUFFER_SIZES; i++) {\n    int64_t s = DEFAULT_BUFFER_BASE_SIZE * (((int64_t)1) << i);\n    int64_t a = DEFAULT_BUFFER_ALIGNMENT;\n    int n = i <= default_large_iobuffer_size ? DEFAULT_BUFFER_NUMBER : DEFAULT_HUGE_BUFFER_NUMBER;\n    if (s < a)\n      a = s;\n\n    name = new char[64];\n    snprintf(name, 64, \"ioBufAllocator[%d]\", i);\n    ioBufAllocator[i].re_init(name, s, n, a, advice);\n  }\n}\n\nint64_t\nMIOBuffer::remove_append(IOBufferReader * r)\n{\n  int64_t l = 0;\n  while (r->block) {\n    Ptr<IOBufferBlock> b = r->block;\n    r->block = r->block->next;\n    b->_start += r->start_offset;\n    if (b->start() >= b->end()) {\n      r->start_offset = -r->start_offset;\n      continue;\n    }\n    r->start_offset = 0;\n    l += b->read_avail();\n    append_block(b);\n  }\n  r->mbuf->_writer = NULL;\n  return l;\n}\n\nint64_t\nMIOBuffer::write(const void *abuf, int64_t alen)\n{\n  const char *buf = (const char*)abuf;\n  int64_t len = alen;\n  while (len) {\n    if (!_writer)\n      add_block();\n    int64_t f = _writer->write_avail();\n    f = f < len ? f : len;\n    if (f > 0) {\n      ::memcpy(_writer->end(), buf, f);\n      _writer->fill(f);\n      buf += f;\n      len -= f;\n    }\n    if (len) {\n      if (!_writer->next)\n        add_block();\n      else\n        _writer = _writer->next;\n    }\n  }\n  return alen;\n}\n\n\n#ifdef WRITE_AND_TRANSFER\n  \/*\n   * Same functionality as write but for the one small difference.\n   * The space available in the last block is taken from the original\n   * and this space becomes available to the copy.\n   *\n   *\/\nint64_t\nMIOBuffer::write_and_transfer_left_over_space(IOBufferReader * r, int64_t alen, int64_t offset)\n{\n  int64_t rval = write(r, alen, offset);\n  \/\/ reset the end markers of the original so that it cannot\n  \/\/ make use of the space in the current block\n  if (r->mbuf->_writer)\n    r->mbuf->_writer->_buf_end = r->mbuf->_writer->_end;\n  \/\/ reset the end marker of the clone so that it can make\n  \/\/ use of the space in the current block\n  if (_writer) {\n    _writer->_buf_end = _writer->data->data() + _writer->block_size();\n  }\n  return rval;\n}\n\n#endif\n\n\nint64_t\nMIOBuffer::write(IOBufferReader * r, int64_t alen, int64_t offset)\n{\n  int64_t len = alen;\n  IOBufferBlock *b = r->block;\n  offset += r->start_offset;\n\n  while (b && len > 0) {\n    int64_t max_bytes = b->read_avail();\n    max_bytes -= offset;\n    if (max_bytes <= 0) {\n      offset = -max_bytes;\n      b = b->next;\n      continue;\n    }\n    int64_t bytes;\n    if (len<0 || len>= max_bytes)\n      bytes = max_bytes;\n    else\n      bytes = len;\n    IOBufferBlock *bb = b->clone();\n    bb->_start += offset;\n    bb->_buf_end = bb->_end = bb->_start + bytes;\n    append_block(bb);\n    offset = 0;\n    len -= bytes;\n    b = b->next;\n  }\n  return alen - len;\n}\n\nint64_t\nMIOBuffer::puts(char *s, int64_t len)\n{\n  char *pc = end();\n  char *pb = s;\n  while (pc < buf_end()) {\n    if (len-- <= 0)\n      return -1;\n    if (!*pb || *pb == '\\n') {\n      int64_t n = (int64_t) (pb - s);\n      memcpy(end(), s, n + 1);  \/\/ Upto and including '\\n'\n      end()[n + 1] = 0;\n      fill(n + 1);\n      return n + 1;\n    }\n    pc++;\n    pb++;\n  }\n  return 0;\n}\n\nint64_t\nIOBufferReader::read(void *ab, int64_t len)\n{\n  char *b = (char*)ab;\n  int64_t max_bytes = read_avail();\n  int64_t bytes = len <= max_bytes ? len : max_bytes;\n  int64_t n = bytes;\n\n  while (n) {\n    int64_t l = block_read_avail();\n    if (n < l)\n      l = n;\n    ::memcpy(b, start(), l);\n    consume(l);\n    b += l;\n    n -= l;\n  }\n  return bytes;\n}\n\n\/\/ TODO: I don't think this method is used anywhere, so perhaps get rid of it ?\nint64_t\nIOBufferReader::memchr(char c, int64_t len, int64_t offset)\n{\n  IOBufferBlock *b = block;\n  offset += start_offset;\n  int64_t o = offset;\n\n  while (b && len) {\n    int64_t max_bytes = b->read_avail();\n    max_bytes -= offset;\n    if (max_bytes <= 0) {\n      offset = -max_bytes;\n      b = b->next;\n      continue;\n    }\n    int64_t bytes;\n    if (len<0 || len>= max_bytes)\n      bytes = max_bytes;\n    else\n      bytes = len;\n    char *s = b->start() + offset;\n    char *p = (char *) ::memchr(s, c, bytes);\n    if (p)\n      return (int64_t) (o - start_offset + p - s);\n    o += bytes;\n    len -= bytes;\n    b = b->next;\n    offset = 0;\n  }\n\n  return -1;\n}\n\nchar *\nIOBufferReader::memcpy(const void *ap, int64_t len, int64_t offset)\n{\n  char *p = (char*)ap;\n  IOBufferBlock *b = block;\n  offset += start_offset;\n\n  while (b && len) {\n    int64_t max_bytes = b->read_avail();\n    max_bytes -= offset;\n    if (max_bytes <= 0) {\n      offset = -max_bytes;\n      b = b->next;\n      continue;\n    }\n    int64_t bytes;\n    if (len<0 || len>= max_bytes)\n      bytes = max_bytes;\n    else\n      bytes = len;\n    ::memcpy(p, b->start() + offset, bytes);\n    p += bytes;\n    len -= bytes;\n    b = b->next;\n    offset = 0;\n  }\n\n  return p;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    ImageHistogram1.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\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This example shows how to compute the histogram of a scalar image.  Since\n\/\/ the classes of the Statistics framework operate on Samples and\n\/\/ ListOfSamples, we need to introduce a class that will make the image look\n\/\/ like a list of samples. This class is the \\subdoxygen{Statistics}{ScalarImageToListAdaptor}.\n\/\/ Once we have connected this adaptor to an image, we can proceed to use the\n\/\/ \\subdoxygen{Statistics}{ListSampleToHistogramGenerator} in order to compute the\n\/\/ \\subdoxygen{Statistics}{Histogram} of the image.\n\/\/\n\/\/ First, we need to include the headers for the\n\/\/ \\subdoxygen{Statistics}{ScalarImageToListAdaptor} and the \\doxygen{Image} classes.\n\/\/\n\/\/ \\index{itk::Statistics::ScalarImageToListAdaptor!header}\n\/\/ \\index{Statistics!Images}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkScalarImageToListAdaptor.h\"\n#include \"itkImage.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Now we include the headers for the \\code{ListSampleToHistogramGenerator} and\n\/\/ the reader that we will use for reading the image from a file.\n\/\/\n\/\/ \\index{itk::Statistics::ListSampleToHistogramGenerator!header}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkImageFileReader.h\"\n#include \"itkListSampleToHistogramGenerator.h\"\n\/\/ Software Guide : EndCodeSnippet\n\nint main( int argc, char * argv [] )\n{\n\n  if( argc < 2 )\n    {\n    std::cerr << \"Missing command line arguments\" << std::endl;\n    std::cerr << \"Usage :  ImageHistogram1  inputImageFileName \" << std::endl;\n    return -1;\n    }\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ The image type must be defined using the typical pair of pixel type and\n\/\/ dimension specification.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef unsigned char       PixelType;\n  const unsigned int          Dimension = 2;\n\n  typedef itk::Image<PixelType, Dimension > ImageType;\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Using the same image type we instantiate the type of the image reader that\n\/\/ will provide the image source for our example.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::ImageFileReader< ImageType > ReaderType;\n\n  ReaderType::Pointer reader = ReaderType::New();\n\n  reader->SetFileName( argv[1] );\n\/\/ Software Guide : EndCodeSnippet\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Now we introduce the central piece of this example, which is the use of the\n\/\/ adaptor that will present the \\doxygen{Image} as if it was a list of\n\/\/ samples. We instantiate the type of the adaptor by using the actual image\n\/\/ type. Then construct the adaptor by invoking its \\code{New()} method and\n\/\/ assigning the result to the corresponding smart pointer. Finally we connect\n\/\/ the output of the image reader to the input of the adaptor. \n\/\/\n\/\/ \\index{itk::Statistics::ScalarImageToListAdaptor!instantiation}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::Statistics::ScalarImageToListAdaptor< ImageType >   AdaptorType;\n\n  AdaptorType::Pointer adaptor = AdaptorType::New();\n\n  adaptor->SetImage(  reader->GetOutput() );\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ You must keep in mind that adaptors are not pipeline objects. This means\n\/\/ that they do not propagate update calls. It is therefore your responsibility\n\/\/ to make sure that you invoke the \\code{Update()} method of the reader before\n\/\/ you attempt to use the output of the adaptor. As usual, this must be done\n\/\/ inside a try\/catch block because the read operation can potentially throw\n\/\/ exceptions.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n  try\n    {\n    reader->Update();\n    }\n  catch( itk::ExceptionObject & excp )\n    {\n    std::cerr << \"Problem reading image file : \" << argv[1] << std::endl;\n    std::cerr << excp << std::endl;\n    return -1;\n    }\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ At this point, we are ready for instantiating the type of the histogram\n\/\/ generator. Note that the adaptor type is used as template parameter of the\n\/\/ generator. Having instantiated this type, we proceed to create one generator\n\/\/ by invoking its \\code{New()} method.\n\/\/\n\/\/ \\index{itk::Statistics::ListSampleToHistogramGenerator!instantiation}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef PixelType        HistogramMeasurementType;\n\n  typedef itk::Statistics::ListSampleToHistogramGenerator< \n                                                AdaptorType, \n                                                HistogramMeasurementType \n                                                                > GeneratorType;\n\n  GeneratorType::Pointer generator = GeneratorType::New();\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We define now the characteristics of the Histogram that we want to compute.\n\/\/ This typically includes the size of each one of the component, but given\n\/\/ that in this simple example we are dealing with a scalar image, then our\n\/\/ histogram will have a single component. For the sake of generality, however,\n\/\/ we use the \\code{HistogramType} as defined inside of the Generator type. We\n\/\/ define also the marginal scale factor that will control the precision used\n\/\/ when assigning values to histogram bines. Finally we invoke the\n\/\/ \\code{Update()} method in the generator.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef GeneratorType::HistogramType  HistogramType;\n\n  HistogramType::SizeType size;\n  size.Fill( 255 );\n\n  generator->SetListSample( adaptor );\n  generator->SetNumberOfBins( size );\n  generator->SetMarginalScale( 10.0 );\n\n  generator->Update();\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Now we are ready for using the image histogram for any further processing.\n\/\/ The histogram is obtained from the generator by invoking the\n\/\/ \\code{GetOutput()} method.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  HistogramType::ConstPointer histogram = generator->GetOutput();\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ In this current example we simply print out the frequency values of all the\n\/\/ bins in the image histogram.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  const unsigned int histogramSize = histogram->Size();\n\n  std::cout << \"Histogram size \" << histogramSize << std::endl;\n\n  for( unsigned int bin=0; bin < histogramSize; bin++ )\n    {\n    std::cout << \"bin = \" << bin << \" frequency = \";\n    std::cout << histogram->GetFrequency( bin, 0 ) <<std::endl;\n    }\n\/\/ Software Guide : EndCodeSnippet\n\n  return 0;\n  \n}\n\n\n<commit_msg>STYLE: Minor typos on Software Guide comments.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    ImageHistogram1.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\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This example shows how to compute the histogram of a scalar image.  Since\n\/\/ the classes of the Statistics framework operate on Samples and\n\/\/ ListOfSamples, we need to introduce a class that will make the image look\n\/\/ like a list of samples. This class is the\n\/\/ \\subdoxygen{Statistics}{ScalarImageToListAdaptor}.  Once we have connected\n\/\/ this adaptor to an image, we can proceed to use the\n\/\/ \\subdoxygen{Statistics}{ListSampleToHistogramGenerator} in order to compute\n\/\/ the histogram of the image.\n\/\/\n\/\/ First, we need to include the headers for the\n\/\/ \\subdoxygen{Statistics}{ScalarImageToListAdaptor} and the \\doxygen{Image} classes.\n\/\/\n\/\/ \\index{itk::Statistics::ScalarImageToListAdaptor!header}\n\/\/ \\index{Statistics!Images}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkScalarImageToListAdaptor.h\"\n#include \"itkImage.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Now we include the headers for the \\code{ListSampleToHistogramGenerator} and\n\/\/ the reader that we will use for reading the image from a file.\n\/\/\n\/\/ \\index{itk::Statistics::ListSampleToHistogramGenerator!header}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkImageFileReader.h\"\n#include \"itkListSampleToHistogramGenerator.h\"\n\/\/ Software Guide : EndCodeSnippet\n\nint main( int argc, char * argv [] )\n{\n\n  if( argc < 2 )\n    {\n    std::cerr << \"Missing command line arguments\" << std::endl;\n    std::cerr << \"Usage :  ImageHistogram1  inputImageFileName \" << std::endl;\n    return -1;\n    }\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ The image type must be defined using the typical pair of pixel type and\n\/\/ dimension specification.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef unsigned char       PixelType;\n  const unsigned int          Dimension = 2;\n\n  typedef itk::Image<PixelType, Dimension > ImageType;\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Using the same image type we instantiate the type of the image reader that\n\/\/ will provide the image source for our example.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::ImageFileReader< ImageType > ReaderType;\n\n  ReaderType::Pointer reader = ReaderType::New();\n\n  reader->SetFileName( argv[1] );\n\/\/ Software Guide : EndCodeSnippet\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Now we introduce the central piece of this example, which is the use of the\n\/\/ adaptor that will present the \\doxygen{Image} as if it was a list of\n\/\/ samples. We instantiate the type of the adaptor by using the actual image\n\/\/ type. Then construct the adaptor by invoking its \\code{New()} method and\n\/\/ assigning the result to the corresponding smart pointer. Finally we connect\n\/\/ the output of the image reader to the input of the adaptor. \n\/\/\n\/\/ \\index{itk::Statistics::ScalarImageToListAdaptor!instantiation}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::Statistics::ScalarImageToListAdaptor< ImageType >   AdaptorType;\n\n  AdaptorType::Pointer adaptor = AdaptorType::New();\n\n  adaptor->SetImage(  reader->GetOutput() );\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ You must keep in mind that adaptors are not pipeline objects. This means\n\/\/ that they do not propagate update calls. It is therefore your responsibility\n\/\/ to make sure that you invoke the \\code{Update()} method of the reader before\n\/\/ you attempt to use the output of the adaptor. As usual, this must be done\n\/\/ inside a try\/catch block because the read operation can potentially throw\n\/\/ exceptions.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n  try\n    {\n    reader->Update();\n    }\n  catch( itk::ExceptionObject & excp )\n    {\n    std::cerr << \"Problem reading image file : \" << argv[1] << std::endl;\n    std::cerr << excp << std::endl;\n    return -1;\n    }\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ At this point, we are ready for instantiating the type of the histogram\n\/\/ generator. Note that the adaptor type is used as template parameter of the\n\/\/ generator. Having instantiated this type, we proceed to create one generator\n\/\/ by invoking its \\code{New()} method.\n\/\/\n\/\/ \\index{itk::Statistics::ListSampleToHistogramGenerator!instantiation}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef PixelType        HistogramMeasurementType;\n\n  typedef itk::Statistics::ListSampleToHistogramGenerator< \n                                                AdaptorType, \n                                                HistogramMeasurementType \n                                                                > GeneratorType;\n\n  GeneratorType::Pointer generator = GeneratorType::New();\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We define now the characteristics of the Histogram that we want to compute.\n\/\/ This typically includes the size of each one of the component, but given\n\/\/ that in this simple example we are dealing with a scalar image, then our\n\/\/ histogram will have a single component. For the sake of generality, however,\n\/\/ we use the \\code{HistogramType} as defined inside of the Generator type. We\n\/\/ define also the marginal scale factor that will control the precision used\n\/\/ when assigning values to histogram bins. Finally we invoke the\n\/\/ \\code{Update()} method in the generator.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef GeneratorType::HistogramType  HistogramType;\n\n  HistogramType::SizeType size;\n  size.Fill( 255 );\n\n  generator->SetListSample( adaptor );\n  generator->SetNumberOfBins( size );\n  generator->SetMarginalScale( 10.0 );\n\n  generator->Update();\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Now we are ready for using the image histogram for any further processing.\n\/\/ The histogram is obtained from the generator by invoking the\n\/\/ \\code{GetOutput()} method.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  HistogramType::ConstPointer histogram = generator->GetOutput();\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ In this current example we simply print out the frequency values of all the\n\/\/ bins in the image histogram.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n  const unsigned int histogramSize = histogram->Size();\n\n  std::cout << \"Histogram size \" << histogramSize << std::endl;\n\n  for( unsigned int bin=0; bin < histogramSize; bin++ )\n    {\n    std::cout << \"bin = \" << bin << \" frequency = \";\n    std::cout << histogram->GetFrequency( bin, 0 ) <<std::endl;\n    }\n\/\/ Software Guide : EndCodeSnippet\n\n  return 0;\n  \n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- Mode: c++-mode; c-basic-offset: 2; indent-tabs-mode: t; tab-width: 2; -*-\n\/\/\n\/\/ Copyright (C) 2003 Grzegorz Jaskiewicz \t<gj at pointblue.com.pl>\n\/\/\n\/\/ gaduregisteraccount.cpp\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.\t 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\n\/\/ 02111-1307, USA.\n\n#include <qstring.h>\n#include <qregexp.h>\n#include <qpushbutton.h>\n#include <qlabel.h>\n\n#include <klineedit.h>\n#include <kmessagebox.h>\n#include <kdebug.h>\n#include <klocale.h>\n#include <kiconloader.h>\n#include <kglobal.h>\n\n#include \"gaduregisteraccountui.h\"\n#include \"gaduregisteraccount.h\"\n#include \"gaducommands.h\"\n\nGaduRegisterAccount::GaduRegisterAccount( QWidget* parent, const char* name )\n: KDialogBase( parent, name, true, i18n( \"Register New Account\" ), KDialogBase::User1 | KDialogBase::Ok, KDialogBase::User1, true )\n{\n\tui = new GaduRegisterAccountUI( this );\n\tsetMainWidget( ui );\n\n\tui->valueVerificationSequence->setDisabled( true );\n\tsetButtonText( User1, i18n( \"&Register\" ) );\n\tsetButtonText( Ok, i18n( \"&Cancel\" ) );\n\tenableButton( User1, false );\n\n\tcRegister = new RegisterCommand( this );\n\n\temailRegexp = new QRegExp(  \"[\\\\w\\\\d.+_-]{1,}@[\\\\w\\\\d.-]{1,}\" );\n\thintPixmap = KGlobal::iconLoader()->loadIcon ( \"gadu_protocol\", KIcon::Small );\n\n\tconnect( this, SIGNAL( user1Clicked() ), SLOT( doRegister() ) );\n\tconnect( this, SIGNAL( okClicked() ), SLOT( slotClose() ) );\n\n\tconnect( ui->valueEmailAddress, SIGNAL( textChanged( const QString &) ), SLOT( inputChanged( const QString & ) ) );\n\tconnect( ui->valuePassword, SIGNAL( textChanged( const QString & ) ), SLOT( inputChanged( const QString & ) ) );\n\tconnect( ui->valuePasswordVerify, SIGNAL( textChanged( const QString & ) ), SLOT( inputChanged( const QString & ) ) );\n\tconnect( ui->valueVerificationSequence, SIGNAL( textChanged( const QString & ) ), SLOT( inputChanged( const QString & ) ) );\n\n\tconnect( cRegister, SIGNAL( tokenRecieved( QPixmap, QString ) ), SLOT( displayToken( QPixmap, QString ) ) );\n\tconnect( cRegister, SIGNAL( done(  const QString&,  const QString& ) ), SLOT( registrationDone(  const QString&,  const QString& ) ) );\n\tconnect( cRegister, SIGNAL( error(  const QString&,  const QString& ) ), SLOT( registrationError(  const QString&,  const QString& ) ) );\n\tconnect( cRegister, SIGNAL( operationStatus( const QString ) ), SLOT( updateStatus( const QString ) ) );\n\n\tupdateStatus( i18n( \"Retrieving token\" ) );\n\tcRegister->requestToken();\n\n\tshow();\n}\n\nvoid\nGaduRegisterAccount::doRegister( )\n{\n\tcRegister->setUserinfo( ui->valueEmailAddress->text(), ui->valuePassword->text(), ui->valueVerificationSequence->text() );\n\tcRegister->execute();\n\tenableButton( User1, false );\n}\n\nvoid\nGaduRegisterAccount::validateInput()\n{\n\tint valid = true;\n\tint passwordHighlight = false;\n\n\tif ( !emailRegexp->exactMatch( ui->valueEmailAddress->text() ) )\n\t{\n\t\tupdateStatus( i18n( \"Please enter a valid E-Mail Address.\" ) );\n\t\tui->pixmapEmailAddress->setPixmap ( hintPixmap );\n\t\tvalid = false;\n\t}\n\telse {\n\t\tui->pixmapEmailAddress->setText ( \"\" );\n\t}\n\n\tif ( valid && ( ( ui->valuePassword->text().isEmpty() ) || ( ui->valuePasswordVerify->text().isEmpty() ) ) )\n\t{\n\t\tupdateStatus( i18n( \"Please enter the same password twice.\" ) );\n\t\tvalid = false;\n\t\tpasswordHighlight = true;\n\t}\n\n\tif ( valid && ( ui->valuePassword->text() != ui->valuePasswordVerify->text() ) )\n\t{\n\t\tupdateStatus( i18n( \"Password entries do not match.\" ) );\n\t\tvalid = false;\n\t\tpasswordHighlight = true;\n\t}\n\n\tif ( valid && ( ui->valueVerificationSequence->text().isEmpty() ) )\n\t{\n\t\tupdateStatus( i18n( \"Please enter the verification sequence.\" ) );\n\t\tui->pixmapVerificationSequence->setPixmap ( hintPixmap );\n\t\tvalid = false;\n\t}\n\telse {\n\t\tui->pixmapVerificationSequence->setText ( \"\" );\n\t}\n\n\tif ( passwordHighlight == true )\n\t{\n\t\tui->pixmapPassword->setPixmap ( hintPixmap );\n\t\tui->pixmapPasswordVerify->setPixmap ( hintPixmap );\n\t}\n\telse {\n\t\tui->pixmapPassword->setText ( \"\" );\n\t\tui->pixmapPasswordVerify->setText ( \"\" );\n\t}\n\n\tif ( valid )\n\t{\n\t\t\/\/ clear status message if we have valid data\n\t\tupdateStatus( i18n( \"\" ) );\n\t}\n\n\tenableButton( User1, valid );\n}\n\nvoid\nGaduRegisterAccount::inputChanged( const QString & )\n{\n\tvalidateInput();\n}\n\nvoid\nGaduRegisterAccount::registrationDone(  const QString& \/*title*\/,  const QString& \/*what *\/ )\n{\n\tui->valueEmailAddress->setDisabled( true );\n\tui->valuePassword->setDisabled( true );\n\tui->valuePasswordVerify->setDisabled( true );\n\tui->valueVerificationSequence->setDisabled( true );\n\tui->labelEmailAddress->setDisabled( true );\n\tui->labelPassword->setDisabled( true );\n\tui->labelPasswordVerify->setDisabled( true );\n\tui->labelVerificationSequence->setDisabled( true );\n\tui->labelInstructions->setDisabled( true );\n\temit registeredNumber( cRegister->newUin(), ui->valuePassword->text() );\n\tupdateStatus( i18n( \"Account created; your new UIN is %1.\" ).arg(QString::number( cRegister->newUin() )  ) );\n\tenableButton( User1, false );\n\tsetButtonText( Ok, i18n( \"&Close\" ) );\n}\n\nvoid\nGaduRegisterAccount::registrationError(  const QString& title,  const QString& what )\n{\n\tupdateStatus( i18n( \"Registration failed: %1\" ).arg( what ) );\n\tKMessageBox::sorry( this, what, title );\n\n\tdisconnect( this, SLOT( displayToken( QPixmap, QString ) ) );\n\tdisconnect( this, SLOT( registrationDone(  const QString&,  const QString& ) ) );\n\tdisconnect( this, SLOT( registrationError(  const QString&,  const QString& ) ) );\n\tdisconnect( this, SLOT( updateStatus( const QString ) ) );\n\n\/\/ it is set to deleteLater, in case of error\n\tcRegister = NULL;\n\tui->valueVerificationSequence->setDisabled( true );\n\tui->valueVerificationSequence->setText( \"\" );\n\tenableButton( User1, false );\n\tupdateStatus( \"\" );\n\n\tcRegister = new RegisterCommand( this );\n\n\tconnect( cRegister, SIGNAL( tokenRecieved( QPixmap, QString ) ), SLOT( displayToken( QPixmap, QString ) ) );\n\tconnect( cRegister, SIGNAL( done(  const QString&,  const QString& ) ), SLOT( registrationDone(  const QString&,  const QString& ) ) );\n\tconnect( cRegister, SIGNAL( error(  const QString&,  const QString& ) ), SLOT( registrationError(  const QString&,  const QString& ) ) );\n\tconnect( cRegister, SIGNAL( operationStatus( const QString ) ), SLOT( updateStatus( const QString ) ) );\n\n\tupdateStatus( i18n( \"Retrieving token\" ) );\n\tcRegister->requestToken();\n}\n\nvoid\nGaduRegisterAccount::displayToken( QPixmap image, QString \/*tokenId *\/ )\n{\n\tui->valueVerificationSequence->setDisabled( false );\n\tui->pixmapToken->setPixmap( image );\n\tvalidateInput();\n}\n\nvoid\nGaduRegisterAccount::updateStatus( const QString status )\n{\n\tui->labelStatusMessage->setAlignment( AlignCenter );\n\tui->labelStatusMessage->setText( status );\n}\n\nvoid\nGaduRegisterAccount::slotClose()\n{\n\tdelete cRegister;\n\tcRegister = NULL;\n}\n\nGaduRegisterAccount::~GaduRegisterAccount( )\n{\n\tkdDebug( 14100 ) << \" register Cancel \" << endl;\n\tdelete cRegister;\n\tcRegister = NULL;\n}\n\n#include \"gaduregisteraccount.moc\"\n<commit_msg>CVS_SILENT:infact there is no need to assign NULL in destructor<commit_after>\/\/ -*- Mode: c++-mode; c-basic-offset: 2; indent-tabs-mode: t; tab-width: 2; -*-\n\/\/\n\/\/ Copyright (C) 2003 Grzegorz Jaskiewicz \t<gj at pointblue.com.pl>\n\/\/\n\/\/ gaduregisteraccount.cpp\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.\t 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\n\/\/ 02111-1307, USA.\n\n#include <qstring.h>\n#include <qregexp.h>\n#include <qpushbutton.h>\n#include <qlabel.h>\n\n#include <klineedit.h>\n#include <kmessagebox.h>\n#include <kdebug.h>\n#include <klocale.h>\n#include <kiconloader.h>\n#include <kglobal.h>\n\n#include \"gaduregisteraccountui.h\"\n#include \"gaduregisteraccount.h\"\n#include \"gaducommands.h\"\n\nGaduRegisterAccount::GaduRegisterAccount( QWidget* parent, const char* name )\n: KDialogBase( parent, name, true, i18n( \"Register New Account\" ), KDialogBase::User1 | KDialogBase::Ok, KDialogBase::User1, true )\n{\n\tui = new GaduRegisterAccountUI( this );\n\tsetMainWidget( ui );\n\n\tui->valueVerificationSequence->setDisabled( true );\n\tsetButtonText( User1, i18n( \"&Register\" ) );\n\tsetButtonText( Ok, i18n( \"&Cancel\" ) );\n\tenableButton( User1, false );\n\n\tcRegister = new RegisterCommand( this );\n\n\temailRegexp = new QRegExp(  \"[\\\\w\\\\d.+_-]{1,}@[\\\\w\\\\d.-]{1,}\" );\n\thintPixmap = KGlobal::iconLoader()->loadIcon ( \"gadu_protocol\", KIcon::Small );\n\n\tconnect( this, SIGNAL( user1Clicked() ), SLOT( doRegister() ) );\n\tconnect( this, SIGNAL( okClicked() ), SLOT( slotClose() ) );\n\n\tconnect( ui->valueEmailAddress, SIGNAL( textChanged( const QString &) ), SLOT( inputChanged( const QString & ) ) );\n\tconnect( ui->valuePassword, SIGNAL( textChanged( const QString & ) ), SLOT( inputChanged( const QString & ) ) );\n\tconnect( ui->valuePasswordVerify, SIGNAL( textChanged( const QString & ) ), SLOT( inputChanged( const QString & ) ) );\n\tconnect( ui->valueVerificationSequence, SIGNAL( textChanged( const QString & ) ), SLOT( inputChanged( const QString & ) ) );\n\n\tconnect( cRegister, SIGNAL( tokenRecieved( QPixmap, QString ) ), SLOT( displayToken( QPixmap, QString ) ) );\n\tconnect( cRegister, SIGNAL( done(  const QString&,  const QString& ) ), SLOT( registrationDone(  const QString&,  const QString& ) ) );\n\tconnect( cRegister, SIGNAL( error(  const QString&,  const QString& ) ), SLOT( registrationError(  const QString&,  const QString& ) ) );\n\tconnect( cRegister, SIGNAL( operationStatus( const QString ) ), SLOT( updateStatus( const QString ) ) );\n\n\tupdateStatus( i18n( \"Retrieving token\" ) );\n\tcRegister->requestToken();\n\n\tshow();\n}\n\nvoid\nGaduRegisterAccount::doRegister( )\n{\n\tcRegister->setUserinfo( ui->valueEmailAddress->text(), ui->valuePassword->text(), ui->valueVerificationSequence->text() );\n\tcRegister->execute();\n\tenableButton( User1, false );\n}\n\nvoid\nGaduRegisterAccount::validateInput()\n{\n\tint valid = true;\n\tint passwordHighlight = false;\n\n\tif ( !emailRegexp->exactMatch( ui->valueEmailAddress->text() ) )\n\t{\n\t\tupdateStatus( i18n( \"Please enter a valid E-Mail Address.\" ) );\n\t\tui->pixmapEmailAddress->setPixmap ( hintPixmap );\n\t\tvalid = false;\n\t}\n\telse {\n\t\tui->pixmapEmailAddress->setText ( \"\" );\n\t}\n\n\tif ( valid && ( ( ui->valuePassword->text().isEmpty() ) || ( ui->valuePasswordVerify->text().isEmpty() ) ) )\n\t{\n\t\tupdateStatus( i18n( \"Please enter the same password twice.\" ) );\n\t\tvalid = false;\n\t\tpasswordHighlight = true;\n\t}\n\n\tif ( valid && ( ui->valuePassword->text() != ui->valuePasswordVerify->text() ) )\n\t{\n\t\tupdateStatus( i18n( \"Password entries do not match.\" ) );\n\t\tvalid = false;\n\t\tpasswordHighlight = true;\n\t}\n\n\tif ( valid && ( ui->valueVerificationSequence->text().isEmpty() ) )\n\t{\n\t\tupdateStatus( i18n( \"Please enter the verification sequence.\" ) );\n\t\tui->pixmapVerificationSequence->setPixmap ( hintPixmap );\n\t\tvalid = false;\n\t}\n\telse {\n\t\tui->pixmapVerificationSequence->setText ( \"\" );\n\t}\n\n\tif ( passwordHighlight == true )\n\t{\n\t\tui->pixmapPassword->setPixmap ( hintPixmap );\n\t\tui->pixmapPasswordVerify->setPixmap ( hintPixmap );\n\t}\n\telse {\n\t\tui->pixmapPassword->setText ( \"\" );\n\t\tui->pixmapPasswordVerify->setText ( \"\" );\n\t}\n\n\tif ( valid )\n\t{\n\t\t\/\/ clear status message if we have valid data\n\t\tupdateStatus( i18n( \"\" ) );\n\t}\n\n\tenableButton( User1, valid );\n}\n\nvoid\nGaduRegisterAccount::inputChanged( const QString & )\n{\n\tvalidateInput();\n}\n\nvoid\nGaduRegisterAccount::registrationDone(  const QString& \/*title*\/,  const QString& \/*what *\/ )\n{\n\tui->valueEmailAddress->setDisabled( true );\n\tui->valuePassword->setDisabled( true );\n\tui->valuePasswordVerify->setDisabled( true );\n\tui->valueVerificationSequence->setDisabled( true );\n\tui->labelEmailAddress->setDisabled( true );\n\tui->labelPassword->setDisabled( true );\n\tui->labelPasswordVerify->setDisabled( true );\n\tui->labelVerificationSequence->setDisabled( true );\n\tui->labelInstructions->setDisabled( true );\n\temit registeredNumber( cRegister->newUin(), ui->valuePassword->text() );\n\tupdateStatus( i18n( \"Account created; your new UIN is %1.\" ).arg(QString::number( cRegister->newUin() )  ) );\n\tenableButton( User1, false );\n\tsetButtonText( Ok, i18n( \"&Close\" ) );\n}\n\nvoid\nGaduRegisterAccount::registrationError(  const QString& title,  const QString& what )\n{\n\tupdateStatus( i18n( \"Registration failed: %1\" ).arg( what ) );\n\tKMessageBox::sorry( this, what, title );\n\n\tdisconnect( this, SLOT( displayToken( QPixmap, QString ) ) );\n\tdisconnect( this, SLOT( registrationDone(  const QString&,  const QString& ) ) );\n\tdisconnect( this, SLOT( registrationError(  const QString&,  const QString& ) ) );\n\tdisconnect( this, SLOT( updateStatus( const QString ) ) );\n\n\/\/ it is set to deleteLater, in case of error\n\tcRegister = NULL;\n\tui->valueVerificationSequence->setDisabled( true );\n\tui->valueVerificationSequence->setText( \"\" );\n\tenableButton( User1, false );\n\tupdateStatus( \"\" );\n\n\tcRegister = new RegisterCommand( this );\n\n\tconnect( cRegister, SIGNAL( tokenRecieved( QPixmap, QString ) ), SLOT( displayToken( QPixmap, QString ) ) );\n\tconnect( cRegister, SIGNAL( done(  const QString&,  const QString& ) ), SLOT( registrationDone(  const QString&,  const QString& ) ) );\n\tconnect( cRegister, SIGNAL( error(  const QString&,  const QString& ) ), SLOT( registrationError(  const QString&,  const QString& ) ) );\n\tconnect( cRegister, SIGNAL( operationStatus( const QString ) ), SLOT( updateStatus( const QString ) ) );\n\n\tupdateStatus( i18n( \"Retrieving token\" ) );\n\tcRegister->requestToken();\n}\n\nvoid\nGaduRegisterAccount::displayToken( QPixmap image, QString \/*tokenId *\/ )\n{\n\tui->valueVerificationSequence->setDisabled( false );\n\tui->pixmapToken->setPixmap( image );\n\tvalidateInput();\n}\n\nvoid\nGaduRegisterAccount::updateStatus( const QString status )\n{\n\tui->labelStatusMessage->setAlignment( AlignCenter );\n\tui->labelStatusMessage->setText( status );\n}\n\nvoid\nGaduRegisterAccount::slotClose()\n{\n\tdelete cRegister;\n\tcRegister = NULL;\n}\n\nGaduRegisterAccount::~GaduRegisterAccount( )\n{\n\tkdDebug( 14100 ) << \" register Cancel \" << endl;\n\tdelete cRegister;\n}\n\n#include \"gaduregisteraccount.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/*****************************************************************************\n\/\/ Copyright 2017-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 <algorithm>\n#include <cinttypes>\n#include <cmath>\n#include <cstdlib>\n#include <random>\n#include <string>\n\n#include \"gtest\/gtest.h\"\n#include \"ngraph\/ngraph.hpp\"\n#include \"util\/all_close.hpp\"\n#include \"util\/all_close_f.hpp\"\n#include \"util\/ndarray.hpp\"\n#include \"util\/test_control.hpp\"\n#include \"util\/test_tools.hpp\"\n\nusing namespace std;\nusing namespace ngraph;\n\nstatic string s_manifest = \"${MANIFEST}\";\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_2_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{2});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ((vector<int32_t>{0, 0, 1}), read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_1_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{1});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ((vector<int32_t>{0, 1, 0}), read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_0_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{0});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ((vector<int32_t>{1, 0, 0}), read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_fp_nonint_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::f32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::f32, shape_a);\n    copy_data(a, vector<float>{1.1f});\n    auto result = backend->create_tensor(element::f32, shape_r);\n\n    try\n    {\n        auto handle = backend->compile(f);\n        handle->call_with_validate({result}, {a});\n    }\n    catch (const std::exception& e)\n    {\n        EXPECT_EQ(e.what(), std::string(\"One-hot: non-integral value in input\"));\n    }\n    catch (...)\n    {\n        FAIL() << \"Expected a std::out_of_range exception\";\n    }\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_oob_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{3});\n    vector<int32_t> r_data(4);\n    auto result = backend->create_tensor(element::i32, shape_r, r_data.data());\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ(r_data[3], 0);\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_0)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3, 8};\n    auto r = make_shared<op::OneHot>(A, Shape{3, 8}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{2, 1, 0, 0, 2, 2, 1, 0});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ(\n        (vector<int32_t>{0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0}),\n        read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_1)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{8, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{8, 3}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{2, 1, 0, 0, 2, 2, 1, 0});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ(\n        (vector<int32_t>{0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0}),\n        read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_1_barely_oob)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{8, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{8, 3}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{2, 1, 0, 0, 3, 2, 1, 0});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    vector<int32_t> rv = read_vector<int32_t>(result);\n\n    EXPECT_EQ(rv[0], 0);\n    EXPECT_EQ(rv[1], 0);\n    EXPECT_EQ(rv[2], 1);\n\n    EXPECT_EQ(rv[3], 0);\n    EXPECT_EQ(rv[4], 1);\n    EXPECT_EQ(rv[5], 0);\n\n    EXPECT_EQ(rv[6], 1);\n    EXPECT_EQ(rv[7], 0);\n    EXPECT_EQ(rv[8], 0);\n\n    EXPECT_EQ(rv[9], 1);\n    EXPECT_EQ(rv[10], 0);\n    EXPECT_EQ(rv[11], 0);\n\n    \/\/ These are undefined since value is out of bounds\n    \/\/ EXPECT_EQ(rv[12], 0);\n    \/\/ EXPECT_EQ(rv[13], 0);\n    \/\/ EXPECT_EQ(rv[14], 0);\n\n    EXPECT_EQ(rv[15], 0);\n    EXPECT_EQ(rv[16], 0);\n    EXPECT_EQ(rv[17], 1);\n\n    EXPECT_EQ(rv[18], 0);\n    EXPECT_EQ(rv[19], 1);\n    EXPECT_EQ(rv[20], 0);\n\n    EXPECT_EQ(rv[21], 1);\n    EXPECT_EQ(rv[22], 0);\n    EXPECT_EQ(rv[23], 0);\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_matrix_0)\n{\n    Shape shape_a{3, 3};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3, 3, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{3, 3, 3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a,\n              vector<int32_t>{\n                  0, 1, 1, 2, 1, 0, 0, 2, 1,\n              });\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ((vector<int32_t>{1, 0, 0, 0, 0, 1, 1, 0, 0,\n\n                               0, 1, 1, 0, 1, 0, 0, 0, 1,\n\n                               0, 0, 0, 1, 0, 0, 0, 1, 0}),\n              read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_1_fp)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::f32, shape_a);\n    Shape shape_r{8, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{8, 3}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::f32, shape_a);\n    copy_data(a, vector<float>{2, 1, 0, 0, 2, 2, 1, 0});\n    auto result = backend->create_tensor(element::f32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ(\n        (vector<float>{0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0}),\n        read_vector<float>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_1_fp_nonint)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::f32, shape_a);\n    Shape shape_r{8, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{8, 3}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::f32, shape_a);\n    copy_data(a, vector<float>{2, 1, 0, 0, 2, 2, 1.01f, 0});\n    auto result = backend->create_tensor(element::f32, shape_r);\n\n    try\n    {\n        auto handle = backend->compile(f);\n        handle->call_with_validate({result}, {a});\n    }\n    catch (const std::exception& e)\n    {\n        EXPECT_EQ(e.what(), std::string(\"One-hot: non-integral value in input\"));\n    }\n    catch (...)\n    {\n        FAIL() << \"Expected a std::out_of_range exception\";\n    }\n}\n<commit_msg>Add a new onehot unit test (#2670)<commit_after>\/\/*****************************************************************************\n\/\/ Copyright 2017-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 <algorithm>\n#include <cinttypes>\n#include <cmath>\n#include <cstdlib>\n#include <random>\n#include <string>\n\n#include \"gtest\/gtest.h\"\n#include \"ngraph\/ngraph.hpp\"\n#include \"util\/all_close.hpp\"\n#include \"util\/all_close_f.hpp\"\n#include \"util\/ndarray.hpp\"\n#include \"util\/test_control.hpp\"\n#include \"util\/test_tools.hpp\"\n\nusing namespace std;\nusing namespace ngraph;\n\nstatic string s_manifest = \"${MANIFEST}\";\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_2_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{2});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ((vector<int32_t>{0, 0, 1}), read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_1_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{1});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ((vector<int32_t>{0, 1, 0}), read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_0_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{0});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ((vector<int32_t>{1, 0, 0}), read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_fp_nonint_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::f32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::f32, shape_a);\n    copy_data(a, vector<float>{1.1f});\n    auto result = backend->create_tensor(element::f32, shape_r);\n\n    try\n    {\n        auto handle = backend->compile(f);\n        handle->call_with_validate({result}, {a});\n    }\n    catch (const std::exception& e)\n    {\n        EXPECT_EQ(e.what(), std::string(\"One-hot: non-integral value in input\"));\n    }\n    catch (...)\n    {\n        FAIL() << \"Expected a std::out_of_range exception\";\n    }\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_scalar_oob_in_3)\n{\n    Shape shape_a{};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3};\n    auto r = make_shared<op::OneHot>(A, Shape{3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{3});\n    vector<int32_t> r_data(4);\n    auto result = backend->create_tensor(element::i32, shape_r, r_data.data());\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ(r_data[3], 0);\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_0)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3, 8};\n    auto r = make_shared<op::OneHot>(A, Shape{3, 8}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{2, 1, 0, 0, 2, 2, 1, 0});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ(\n        (vector<int32_t>{0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0}),\n        read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_1)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{8, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{8, 3}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{2, 1, 0, 0, 2, 2, 1, 0});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ(\n        (vector<int32_t>{0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0}),\n        read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_1_barely_oob)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{8, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{8, 3}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a, vector<int32_t>{2, 1, 0, 0, 3, 2, 1, 0});\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    vector<int32_t> rv = read_vector<int32_t>(result);\n\n    EXPECT_EQ(rv[0], 0);\n    EXPECT_EQ(rv[1], 0);\n    EXPECT_EQ(rv[2], 1);\n\n    EXPECT_EQ(rv[3], 0);\n    EXPECT_EQ(rv[4], 1);\n    EXPECT_EQ(rv[5], 0);\n\n    EXPECT_EQ(rv[6], 1);\n    EXPECT_EQ(rv[7], 0);\n    EXPECT_EQ(rv[8], 0);\n\n    EXPECT_EQ(rv[9], 1);\n    EXPECT_EQ(rv[10], 0);\n    EXPECT_EQ(rv[11], 0);\n\n    \/\/ These are undefined since value is out of bounds\n    \/\/ EXPECT_EQ(rv[12], 0);\n    \/\/ EXPECT_EQ(rv[13], 0);\n    \/\/ EXPECT_EQ(rv[14], 0);\n\n    EXPECT_EQ(rv[15], 0);\n    EXPECT_EQ(rv[16], 0);\n    EXPECT_EQ(rv[17], 1);\n\n    EXPECT_EQ(rv[18], 0);\n    EXPECT_EQ(rv[19], 1);\n    EXPECT_EQ(rv[20], 0);\n\n    EXPECT_EQ(rv[21], 1);\n    EXPECT_EQ(rv[22], 0);\n    EXPECT_EQ(rv[23], 0);\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_matrix_0)\n{\n    Shape shape_a{3, 3};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{3, 3, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{3, 3, 3}, 0);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    copy_data(a,\n              vector<int32_t>{\n                  0, 1, 1, 2, 1, 0, 0, 2, 1,\n              });\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ((vector<int32_t>{1, 0, 0, 0, 0, 1, 1, 0, 0,\n\n                               0, 1, 1, 0, 1, 0, 0, 0, 1,\n\n                               0, 0, 0, 1, 0, 0, 0, 1, 0}),\n              read_vector<int32_t>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_1_fp)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::f32, shape_a);\n    Shape shape_r{8, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{8, 3}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::f32, shape_a);\n    copy_data(a, vector<float>{2, 1, 0, 0, 2, 2, 1, 0});\n    auto result = backend->create_tensor(element::f32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    EXPECT_EQ(\n        (vector<float>{0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0}),\n        read_vector<float>(result));\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_1_fp_nonint)\n{\n    Shape shape_a{8};\n    auto A = make_shared<op::Parameter>(element::f32, shape_a);\n    Shape shape_r{8, 3};\n    auto r = make_shared<op::OneHot>(A, Shape{8, 3}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::f32, shape_a);\n    copy_data(a, vector<float>{2, 1, 0, 0, 2, 2, 1.01f, 0});\n    auto result = backend->create_tensor(element::f32, shape_r);\n\n    try\n    {\n        auto handle = backend->compile(f);\n        handle->call_with_validate({result}, {a});\n    }\n    catch (const std::exception& e)\n    {\n        EXPECT_EQ(e.what(), std::string(\"One-hot: non-integral value in input\"));\n    }\n    catch (...)\n    {\n        FAIL() << \"Expected a std::out_of_range exception\";\n    }\n}\n\nNGRAPH_TEST(${BACKEND_NAME}, one_hot_vector_many_categories)\n{\n    \/\/ Imagenet has roughly 20,000 categories\n    uint32_t category_count = 20000;\n    Shape shape_a{6};\n    auto A = make_shared<op::Parameter>(element::i32, shape_a);\n    Shape shape_r{6, category_count};\n    auto r = make_shared<op::OneHot>(A, Shape{6, category_count}, 1);\n    auto f = make_shared<Function>(r, ParameterVector{A});\n\n    auto backend = runtime::Backend::create(\"${BACKEND_NAME}\");\n\n    \/\/ Create some tensors for input\/output\n    auto a = backend->create_tensor(element::i32, shape_a);\n    vector<int32_t> input_data{0, 11, 101, 1001, 10001, static_cast<int32_t>(category_count - 1)};\n    copy_data(a, input_data);\n    auto result = backend->create_tensor(element::i32, shape_r);\n\n    auto handle = backend->compile(f);\n    handle->call_with_validate({result}, {a});\n    vector<int32_t> data = read_vector<int32_t>(result);\n\n    vector<int32_t> bit_positions;\n    for (size_t i = 0; i < shape_size(shape_r); ++i)\n    {\n        if (data[i] == 1)\n        {\n            bit_positions.push_back(i % category_count);\n        }\n    }\n    EXPECT_EQ(bit_positions, input_data);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    oscarstatusmanager.cpp  -  Oscar status manager\n    \n    Copyright (c) 2004      by Richard Smith          <kde@metafoo.co.uk>\n    Copyright (c) 2006,2007 by Roman Jarosz           <kedgedev@centrum.cz>\n    Kopete    (c) 2002-2007 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\n#include \"oscarstatusmanager.h\"\n\n#include <QHash>\n\n#include <kdebug.h>\n\n#include \"oscarprotocol.h\"\n#include \"oscarpresencesdataclasses.h\"\n\nclass OscarStatusManager::Private\n{\npublic:\n\tOscarProtocol* protocol;\n\n\ttypedef QHash<int, Kopete::OnlineStatus> StatusHash;\n\tStatusHash statusHash;\n\n\tQList<Oscar::PresenceType> presenceTypeList;\n\tQList<Oscar::PresenceOverlay> presenceOverlayList;\n\n\tOscar::Presence::Flags mask;\n};\n\nOscarStatusManager::OscarStatusManager( OscarProtocol* protocol )\n\t: d( new Private() )\n{\n\td->protocol = protocol;\n\td->mask = ~(Oscar::Presence::Flags)Oscar::Presence::None;\n}\n\nOscarStatusManager::~OscarStatusManager()\n{\n\tdelete d;\n}\n\nvoid OscarStatusManager::initialize( uint firstUsableWeight )\n{\n\tfor ( uint i = 0; i < Oscar::Presence::TypeCount; ++i )\n\t{\n\t\tconst Oscar::PresenceType &data =  pscTypeForType( static_cast<Oscar::Presence::Type>(i) );\n\t\tconst uint weight = i + firstUsableWeight;\n\t\tfor ( int j = 0; j < data.overlayFlagsList().count(); ++j )\n\t\t{\n\t\t\tconst uint internalStatus = data.overlayFlagsList().at(j) | data.type();\n\t\t\t\n\t\t\tKopete::OnlineStatus status;\n\t\t\tif ( data.overlayFlagsList().at(j) != Oscar::Presence::None )\n\t\t\t{\n\t\t\t\tOscar::PresenceOverlay overlay = pscOverlayForFlags( data.overlayFlagsList().at(j) );\n\t\t\t\t\/\/don't add KOS to account's context menu\n\t\t\t\tstatus = Kopete::OnlineStatus( data.onlineStatusType(), weight,\n\t\t\t\t                               d->protocol, internalStatus,\n\t\t\t\t                               data.overlayIcons() + overlay.icons(),\n\t\t\t\t                               data.name() + QString(\" (%1)\").arg( overlay.description() ) );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/add KOS\n\t\t\t\tstatus = Kopete::OnlineStatus( data.onlineStatusType(), weight,\n\t\t\t\t                               d->protocol, internalStatus,\n\t\t\t\t                               data.overlayIcons(), data.name(),\n\t\t\t\t                               data.caption(), data.categories(), data.options() );\n\t\t\t}\n\t\t\td->statusHash[internalStatus] = status;\n\t\t}\n\t}\n}\n\nvoid OscarStatusManager::setPresenceType( const QList<Oscar::PresenceType>& list )\n{\n\td->presenceTypeList = list;\n}\n\nvoid OscarStatusManager::setPresenceOverlay( const QList<Oscar::PresenceOverlay>& list )\n{\n\td->presenceOverlayList = list;\n}\n\nvoid OscarStatusManager::setPresenceFlagsMask( Oscar::Presence::Flags mask )\n{\n\td->mask = mask;\n}\n\nKopete::OnlineStatus OscarStatusManager::onlineStatusOf( const Oscar::Presence &presence ) const\n{\n\tOscar::Presence pres( presence.internalStatus() & d->mask );\n\tpres.setDescription( presence.description() );\n\t\n\tif ( (pres.flags() & Oscar::Presence::XStatus) == Oscar::Presence::XStatus )\n\t{\n\t\tkDebug() << \"Creating Kopete::OnlineStatus for XStatus, internal status: \" << pres.internalStatus();\n\t\t\/\/ XStatus, we have to create new KOS\n\t\tOscar::PresenceOverlay overlay = pscOverlayForFlags( pres.flags() );\n\n\t\tQString desc = kosDescription( pres );\n\t\tQString xtrazIcon = QString( \"icq_xstatus%1\" ).arg( pres.xtrazStatus() );\n\t\treturn Kopete::OnlineStatus( Kopete::OnlineStatus::Online, 0, d->protocol, pres.internalStatus(),\n\t\t                             QStringList( xtrazIcon ) + overlay.icons(), desc );\n\t}\n\telse if ( (pres.flags() & Oscar::Presence::ExtStatus) == Oscar::Presence::ExtStatus )\n\t{\n\t\tkDebug() << \"Creating Kopete::OnlineStatus for ExtStatus, internal status: \" << pres.internalStatus();\n\t\t\/\/ ExtStatus, we have to create new KOS\n\t\tOscar::PresenceOverlay overlay = pscOverlayForFlags( pres.flags() );\n\t\tconst Oscar::PresenceType &type = pscTypeForType( pres.type() );\n\n\t\tQString desc = kosDescription( pres );\n\t\treturn Kopete::OnlineStatus( type.onlineStatusType(), 0, d->protocol, pres.internalStatus(),\n\t\t                             type.overlayIcons() + overlay.icons(), desc );\n\t}\n\telse\n\t{\n\t\tif ( d->statusHash.contains( pres.internalStatus() ) )\n\t\t{\n\t\t\treturn d->statusHash.value( pres.internalStatus() );\n\t\t}\n\t\telse if ( d->statusHash.contains( pres.type() ) )\n\t\t{\n\t\t\tkWarning() << \"Kopete::OnlineStatus doesn't exists for internal status \" << pres.internalStatus()\n\t\t\t           << \" Using basic status for type \" << pres.type() << endl;\n\t\t\treturn d->statusHash.value( pres.type() );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tkWarning() << \"Kopete::OnlineStatus doesn't exists for internal status \" << pres.internalStatus();\n\t\t\treturn unknownStatus();\n\t\t}\n\t}\n}\n\nOscar::Presence OscarStatusManager::presenceOf( const Kopete::OnlineStatus &status ) const\n{\n\tif ( status.protocol() == d->protocol )\n\t{\n\t\tOscar::Presence presence( status.internalStatus() );\n\t\tif ( (presence.flags() & Oscar::Presence::XStatus) || (presence.flags() & Oscar::Presence::ExtStatus) )\n\t\t{\n\t\t\t\/\/ ExtStatus\/XStatus, we have to filter out description\n\t\t\tpresence.setDescription( descriptionFromKOS( status ) );\n\t\t}\n\t\treturn presence;\n\t}\n\telse\n\t{\n\t\t\/\/status is a libkopete builtin status object\n\t\t\/\/don't even think about converting it to Oscar::Presence using presenceOf!\n\t\treturn Oscar::Presence( pscTypeForOnlineStatusType( status.status() ).type(),\n\t\t                        Oscar::Presence::None );\n\t}\n}\n\nunsigned long OscarStatusManager::oscarStatusOf( const Oscar::Presence &presence ) const\n{\n\tunsigned long basicStatus = basicOscarStatus( presence.type() );\n\tif ( (presence.internalStatus() & Oscar::Presence::Invisible) == Oscar::Presence::Invisible )\n\t\tbasicStatus |= Oscar::StatusCode::INVISIBLE;\n\treturn basicStatus;\n}\n\nOscar::Presence OscarStatusManager::presenceOf( unsigned long oStatus, int oClass ) const\n{\n\tusing namespace Oscar;\n\tPresence::Type type = pscTypeForOscarStatus( oStatus );\n\n\t\/\/Hack for aim away contacts\n\tif ( type == Presence::Online && (oClass & ClassCode::AWAY) == ClassCode::AWAY )\n\t\ttype = Presence::Away;\n\n\tPresence::Flags flags = Presence::None;\n\tif ( (oClass & ClassCode::ICQ) == ClassCode::ICQ )\n\t\tflags |= Presence::ICQ;\n\telse\n\t\tflags |= Presence::AIM;\n\n\tif ( (oClass & ClassCode::WIRELESS) == ClassCode::WIRELESS )\n\t\tflags |= Presence::Wireless;\n\n\tif ( (oStatus & StatusCode::INVISIBLE) == StatusCode::INVISIBLE )\n\t\tflags |= Presence::Invisible;\n\n\treturn Presence( type, flags );\n}\n\nunsigned long OscarStatusManager::basicOscarStatus( Oscar::Presence::Type type ) const\n{\n\tconst Oscar::PresenceType &data = pscTypeForType( type );\n\treturn data.setFlag();\n}\n\nOscar::Presence::Type OscarStatusManager::pscTypeForOscarStatus( unsigned long status ) const\n{\n\tconst Oscar::PresenceType &data = pscTypeForStatus( status & 0xff );\n\treturn data.type();\n}\n\nOscar::PresenceOverlay OscarStatusManager::pscOverlayForFlags( Oscar::Presence::Flags flags ) const\n{\n\tOscar::PresenceOverlay overlay;\n\tint size = d->presenceOverlayList.size();\n\tfor ( int i = 0; i < size; i++ )\n\t{\n\t\tOscar::PresenceOverlay data = d->presenceOverlayList.at(i);\n\t\tif ( data.flags() == flags )\n\t\t\treturn data;\n\t\telse if ( data.flags() & flags )\n\t\t\toverlay += data;\n\t}\n\n\treturn overlay;\n}\n\nconst Oscar::PresenceType &OscarStatusManager::pscTypeForType( Oscar::Presence::Type type ) const\n{\n\tint size = d->presenceTypeList.size();\n\tfor ( int n = 0; n < size; ++n )\n\t{\n\t\tif ( d->presenceTypeList.at(n).type() == type )\n\t\t\treturn d->presenceTypeList.at(n);\n\t}\n\n\tkWarning(14153) << \"type \" << (int)type << \" not found! Returning Offline\";\n\treturn d->presenceTypeList.at(0);\n}\n\nconst Oscar::PresenceType &OscarStatusManager::pscTypeForStatus( unsigned long status ) const\n{\n\tint size = d->presenceTypeList.size();\n\tfor ( int n = 0; n < size; ++n )\n\t{\n\t\tif ( (d->presenceTypeList.at(n).getFlag() & status) == d->presenceTypeList.at(n).getFlag() )\n\t\t\treturn d->presenceTypeList.at(n);\n\t}\n\n\tkWarning(14153) << \"status \" << (int)status << \" not found! Returning Offline. This should not happen.\";\n\treturn d->presenceTypeList.at(0);\n}\n\nconst Oscar::PresenceType &OscarStatusManager::pscTypeForOnlineStatusType( const Kopete::OnlineStatus::StatusType statusType ) const\n{\n\tint size = d->presenceTypeList.size();\n\tfor ( int n = size - 1; n >= 0; --n )\n\t{\n\t\tif ( d->presenceTypeList.at(n).onlineStatusType() == statusType )\n\t\t\treturn d->presenceTypeList.at(n);\n\t}\n\n\tkWarning(14153) << \"online status \" << (int)statusType << \" not found! Returning Offline. This should not happen.\";\n\treturn d->presenceTypeList.at(0);\n}\n\nQString OscarStatusManager::kosDescription( const Oscar::Presence &presence ) const\n{\n\tOscar::PresenceOverlay overlay = pscOverlayForFlags( presence.flags() );\n\tconst Oscar::PresenceType &type = pscTypeForType( presence.type() );\n\t\n\tQString desc = type.name();\n\tif ( !presence.description().isEmpty() )\n\t\tdesc += QString(\" - %1\").arg( presence.description() );\n\t\n\tif ( !overlay.description().isEmpty() )\n\t\tdesc += QString(\" (%1)\").arg( overlay.description() );\n\t\n\treturn desc;\n}\n\nQString OscarStatusManager::descriptionFromKOS( const Kopete::OnlineStatus &status ) const\n{\n\tOscar::Presence presence( status.internalStatus() );\n\tOscar::PresenceOverlay overlay = pscOverlayForFlags( presence.flags() );\n\n\tQString desc = status.description();\n\tif ( !overlay.description().isEmpty() )\n\t{\n\t\tQString overlayDesc = QString(\" (%1)\").arg( overlay.description() );\n\t\tif ( desc.endsWith( overlayDesc ) )\n\t\t\tdesc.chop( overlayDesc.length() );\n\t}\n\n\tint idx = desc.indexOf( \" - \" );\n\tif ( idx > -1 )\n\t\treturn desc.mid( idx + 3 );\n\telse\n\t\treturn QString();\n}\n<commit_msg>Miranda sets away class when it is online so don't set away flag for ICQ.<commit_after>\/*\n    oscarstatusmanager.cpp  -  Oscar status manager\n    \n    Copyright (c) 2004      by Richard Smith          <kde@metafoo.co.uk>\n    Copyright (c) 2006,2007 by Roman Jarosz           <kedgedev@centrum.cz>\n    Kopete    (c) 2002-2007 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\n#include \"oscarstatusmanager.h\"\n\n#include <QHash>\n\n#include <kdebug.h>\n\n#include \"oscarprotocol.h\"\n#include \"oscarpresencesdataclasses.h\"\n\nclass OscarStatusManager::Private\n{\npublic:\n\tOscarProtocol* protocol;\n\n\ttypedef QHash<int, Kopete::OnlineStatus> StatusHash;\n\tStatusHash statusHash;\n\n\tQList<Oscar::PresenceType> presenceTypeList;\n\tQList<Oscar::PresenceOverlay> presenceOverlayList;\n\n\tOscar::Presence::Flags mask;\n};\n\nOscarStatusManager::OscarStatusManager( OscarProtocol* protocol )\n\t: d( new Private() )\n{\n\td->protocol = protocol;\n\td->mask = ~(Oscar::Presence::Flags)Oscar::Presence::None;\n}\n\nOscarStatusManager::~OscarStatusManager()\n{\n\tdelete d;\n}\n\nvoid OscarStatusManager::initialize( uint firstUsableWeight )\n{\n\tfor ( uint i = 0; i < Oscar::Presence::TypeCount; ++i )\n\t{\n\t\tconst Oscar::PresenceType &data =  pscTypeForType( static_cast<Oscar::Presence::Type>(i) );\n\t\tconst uint weight = i + firstUsableWeight;\n\t\tfor ( int j = 0; j < data.overlayFlagsList().count(); ++j )\n\t\t{\n\t\t\tconst uint internalStatus = data.overlayFlagsList().at(j) | data.type();\n\t\t\t\n\t\t\tKopete::OnlineStatus status;\n\t\t\tif ( data.overlayFlagsList().at(j) != Oscar::Presence::None )\n\t\t\t{\n\t\t\t\tOscar::PresenceOverlay overlay = pscOverlayForFlags( data.overlayFlagsList().at(j) );\n\t\t\t\t\/\/don't add KOS to account's context menu\n\t\t\t\tstatus = Kopete::OnlineStatus( data.onlineStatusType(), weight,\n\t\t\t\t                               d->protocol, internalStatus,\n\t\t\t\t                               data.overlayIcons() + overlay.icons(),\n\t\t\t\t                               data.name() + QString(\" (%1)\").arg( overlay.description() ) );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/add KOS\n\t\t\t\tstatus = Kopete::OnlineStatus( data.onlineStatusType(), weight,\n\t\t\t\t                               d->protocol, internalStatus,\n\t\t\t\t                               data.overlayIcons(), data.name(),\n\t\t\t\t                               data.caption(), data.categories(), data.options() );\n\t\t\t}\n\t\t\td->statusHash[internalStatus] = status;\n\t\t}\n\t}\n}\n\nvoid OscarStatusManager::setPresenceType( const QList<Oscar::PresenceType>& list )\n{\n\td->presenceTypeList = list;\n}\n\nvoid OscarStatusManager::setPresenceOverlay( const QList<Oscar::PresenceOverlay>& list )\n{\n\td->presenceOverlayList = list;\n}\n\nvoid OscarStatusManager::setPresenceFlagsMask( Oscar::Presence::Flags mask )\n{\n\td->mask = mask;\n}\n\nKopete::OnlineStatus OscarStatusManager::onlineStatusOf( const Oscar::Presence &presence ) const\n{\n\tOscar::Presence pres( presence.internalStatus() & d->mask );\n\tpres.setDescription( presence.description() );\n\t\n\tif ( (pres.flags() & Oscar::Presence::XStatus) == Oscar::Presence::XStatus )\n\t{\n\t\tkDebug() << \"Creating Kopete::OnlineStatus for XStatus, internal status: \" << pres.internalStatus();\n\t\t\/\/ XStatus, we have to create new KOS\n\t\tOscar::PresenceOverlay overlay = pscOverlayForFlags( pres.flags() );\n\n\t\tQString desc = kosDescription( pres );\n\t\tQString xtrazIcon = QString( \"icq_xstatus%1\" ).arg( pres.xtrazStatus() );\n\t\treturn Kopete::OnlineStatus( Kopete::OnlineStatus::Online, 0, d->protocol, pres.internalStatus(),\n\t\t                             QStringList( xtrazIcon ) + overlay.icons(), desc );\n\t}\n\telse if ( (pres.flags() & Oscar::Presence::ExtStatus) == Oscar::Presence::ExtStatus )\n\t{\n\t\tkDebug() << \"Creating Kopete::OnlineStatus for ExtStatus, internal status: \" << pres.internalStatus();\n\t\t\/\/ ExtStatus, we have to create new KOS\n\t\tOscar::PresenceOverlay overlay = pscOverlayForFlags( pres.flags() );\n\t\tconst Oscar::PresenceType &type = pscTypeForType( pres.type() );\n\n\t\tQString desc = kosDescription( pres );\n\t\treturn Kopete::OnlineStatus( type.onlineStatusType(), 0, d->protocol, pres.internalStatus(),\n\t\t                             type.overlayIcons() + overlay.icons(), desc );\n\t}\n\telse\n\t{\n\t\tif ( d->statusHash.contains( pres.internalStatus() ) )\n\t\t{\n\t\t\treturn d->statusHash.value( pres.internalStatus() );\n\t\t}\n\t\telse if ( d->statusHash.contains( pres.type() ) )\n\t\t{\n\t\t\tkWarning() << \"Kopete::OnlineStatus doesn't exists for internal status \" << pres.internalStatus()\n\t\t\t           << \" Using basic status for type \" << pres.type() << endl;\n\t\t\treturn d->statusHash.value( pres.type() );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tkWarning() << \"Kopete::OnlineStatus doesn't exists for internal status \" << pres.internalStatus();\n\t\t\treturn unknownStatus();\n\t\t}\n\t}\n}\n\nOscar::Presence OscarStatusManager::presenceOf( const Kopete::OnlineStatus &status ) const\n{\n\tif ( status.protocol() == d->protocol )\n\t{\n\t\tOscar::Presence presence( status.internalStatus() );\n\t\tif ( (presence.flags() & Oscar::Presence::XStatus) || (presence.flags() & Oscar::Presence::ExtStatus) )\n\t\t{\n\t\t\t\/\/ ExtStatus\/XStatus, we have to filter out description\n\t\t\tpresence.setDescription( descriptionFromKOS( status ) );\n\t\t}\n\t\treturn presence;\n\t}\n\telse\n\t{\n\t\t\/\/status is a libkopete builtin status object\n\t\t\/\/don't even think about converting it to Oscar::Presence using presenceOf!\n\t\treturn Oscar::Presence( pscTypeForOnlineStatusType( status.status() ).type(),\n\t\t                        Oscar::Presence::None );\n\t}\n}\n\nunsigned long OscarStatusManager::oscarStatusOf( const Oscar::Presence &presence ) const\n{\n\tunsigned long basicStatus = basicOscarStatus( presence.type() );\n\tif ( (presence.internalStatus() & Oscar::Presence::Invisible) == Oscar::Presence::Invisible )\n\t\tbasicStatus |= Oscar::StatusCode::INVISIBLE;\n\treturn basicStatus;\n}\n\nOscar::Presence OscarStatusManager::presenceOf( unsigned long oStatus, int oClass ) const\n{\n\tusing namespace Oscar;\n\tPresence::Type type = pscTypeForOscarStatus( oStatus );\n\n\t\/\/Hack for aim away contacts\n\tif ( type == Presence::Online && (oClass & ClassCode::AWAY) == ClassCode::AWAY\n\t     && (oClass & ClassCode::ICQ) == 0 )\n\t\ttype = Presence::Away;\n\n\tPresence::Flags flags = Presence::None;\n\tif ( (oClass & ClassCode::ICQ) == ClassCode::ICQ )\n\t\tflags |= Presence::ICQ;\n\telse\n\t\tflags |= Presence::AIM;\n\n\tif ( (oClass & ClassCode::WIRELESS) == ClassCode::WIRELESS )\n\t\tflags |= Presence::Wireless;\n\n\tif ( (oStatus & StatusCode::INVISIBLE) == StatusCode::INVISIBLE )\n\t\tflags |= Presence::Invisible;\n\n\treturn Presence( type, flags );\n}\n\nunsigned long OscarStatusManager::basicOscarStatus( Oscar::Presence::Type type ) const\n{\n\tconst Oscar::PresenceType &data = pscTypeForType( type );\n\treturn data.setFlag();\n}\n\nOscar::Presence::Type OscarStatusManager::pscTypeForOscarStatus( unsigned long status ) const\n{\n\tconst Oscar::PresenceType &data = pscTypeForStatus( status & 0xff );\n\treturn data.type();\n}\n\nOscar::PresenceOverlay OscarStatusManager::pscOverlayForFlags( Oscar::Presence::Flags flags ) const\n{\n\tOscar::PresenceOverlay overlay;\n\tint size = d->presenceOverlayList.size();\n\tfor ( int i = 0; i < size; i++ )\n\t{\n\t\tOscar::PresenceOverlay data = d->presenceOverlayList.at(i);\n\t\tif ( data.flags() == flags )\n\t\t\treturn data;\n\t\telse if ( data.flags() & flags )\n\t\t\toverlay += data;\n\t}\n\n\treturn overlay;\n}\n\nconst Oscar::PresenceType &OscarStatusManager::pscTypeForType( Oscar::Presence::Type type ) const\n{\n\tint size = d->presenceTypeList.size();\n\tfor ( int n = 0; n < size; ++n )\n\t{\n\t\tif ( d->presenceTypeList.at(n).type() == type )\n\t\t\treturn d->presenceTypeList.at(n);\n\t}\n\n\tkWarning(14153) << \"type \" << (int)type << \" not found! Returning Offline\";\n\treturn d->presenceTypeList.at(0);\n}\n\nconst Oscar::PresenceType &OscarStatusManager::pscTypeForStatus( unsigned long status ) const\n{\n\tint size = d->presenceTypeList.size();\n\tfor ( int n = 0; n < size; ++n )\n\t{\n\t\tif ( (d->presenceTypeList.at(n).getFlag() & status) == d->presenceTypeList.at(n).getFlag() )\n\t\t\treturn d->presenceTypeList.at(n);\n\t}\n\n\tkWarning(14153) << \"status \" << (int)status << \" not found! Returning Offline. This should not happen.\";\n\treturn d->presenceTypeList.at(0);\n}\n\nconst Oscar::PresenceType &OscarStatusManager::pscTypeForOnlineStatusType( const Kopete::OnlineStatus::StatusType statusType ) const\n{\n\tint size = d->presenceTypeList.size();\n\tfor ( int n = size - 1; n >= 0; --n )\n\t{\n\t\tif ( d->presenceTypeList.at(n).onlineStatusType() == statusType )\n\t\t\treturn d->presenceTypeList.at(n);\n\t}\n\n\tkWarning(14153) << \"online status \" << (int)statusType << \" not found! Returning Offline. This should not happen.\";\n\treturn d->presenceTypeList.at(0);\n}\n\nQString OscarStatusManager::kosDescription( const Oscar::Presence &presence ) const\n{\n\tOscar::PresenceOverlay overlay = pscOverlayForFlags( presence.flags() );\n\tconst Oscar::PresenceType &type = pscTypeForType( presence.type() );\n\t\n\tQString desc = type.name();\n\tif ( !presence.description().isEmpty() )\n\t\tdesc += QString(\" - %1\").arg( presence.description() );\n\t\n\tif ( !overlay.description().isEmpty() )\n\t\tdesc += QString(\" (%1)\").arg( overlay.description() );\n\t\n\treturn desc;\n}\n\nQString OscarStatusManager::descriptionFromKOS( const Kopete::OnlineStatus &status ) const\n{\n\tOscar::Presence presence( status.internalStatus() );\n\tOscar::PresenceOverlay overlay = pscOverlayForFlags( presence.flags() );\n\n\tQString desc = status.description();\n\tif ( !overlay.description().isEmpty() )\n\t{\n\t\tQString overlayDesc = QString(\" (%1)\").arg( overlay.description() );\n\t\tif ( desc.endsWith( overlayDesc ) )\n\t\t\tdesc.chop( overlayDesc.length() );\n\t}\n\n\tint idx = desc.indexOf( \" - \" );\n\tif ( idx > -1 )\n\t\treturn desc.mid( idx + 3 );\n\telse\n\t\treturn QString();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tThis file is part of the CVD Library.\n\n\tCopyright (C) 2005 The Authors\n\n\tThis library is free software; you can redistribute it and\/or\n\tmodify it under the terms of the GNU Lesser General Public\n\tLicense as published by the Free Software Foundation; either\n\tversion 2.1 of the License, or (at your option) any later version.\n\n\tThis library 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 GNU\n\tLesser General Public License for more details.\n\n\tYou should have received a copy of the GNU Lesser General Public\n\tLicense along with this library; if not, write to the Free Software\n\tFoundation, Inc.,\n    51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n*\/\ninline ImageRef::ImageRef()\n{\n\tx=y=0;\n}\n\ninline ImageRef::ImageRef(int xp, int yp)\n:x(xp),y(yp)\n{}\n\ninline ImageRef::ImageRef(std::istream& is)\n{\n\tis.read((char*)&x,sizeof(int));\n\tis.read((char*)&y,sizeof(int));\n}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ the following cryptic pieces of rubbish are because inline functions \/\/\n\t\/\/ must have their one and only return function as the last call        \/\/\n\t\/\/ so this code makes use of the fact that expressions to the right     \/\/\n\t\/\/ of || are only evaluated when the left hand side is false            \/\/\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ninline bool ImageRef::next(const ImageRef& max)\t\/\/ move on to the next value\n{\n\treturn(++x != max.x || (x=0, ++y != max.y) || (y=0, false));\n}\n\ninline bool ImageRef::next(const ImageRef& min, const ImageRef& max)\n{\n\treturn (++x != max.x || (x=min.x, ++y != max.y) || (y=min.y, false));\n}\n\ninline bool ImageRef::prev(const ImageRef& max)\t\/\/ move back to the previous value\n{\n\treturn(--x != -1 || (x=max.x-1, --y != -1) || (y=max.y-1, false));\n}\n\ninline bool ImageRef::prev(const ImageRef& min, const ImageRef& max)\n{\n\treturn (--x != min.x-1 || (x=max.x-1, --y != min.y-1) || (y=max.y-1, false));\n}\n\ninline void ImageRef::home()\n{\n\tx=y=0;\n}\n\ninline void ImageRef::end(const ImageRef& size)\n{\n\tx=size.x-1;\n\ty=size.y-1;\n}\n\ninline ImageRef& ImageRef::operator=(const ImageRef& ref)\n{\n\tx=ref.x;\n\ty=ref.y;\n\treturn *this;\n}\n\ninline bool ImageRef::operator ==(const ImageRef& ref) const\n{\n\treturn (x==ref.x && y==ref.y);\n}\n\ninline bool ImageRef::operator !=(const ImageRef& ref) const\n{\n\treturn (x!=ref.x || y!=ref.y);\n}\n\ninline ImageRef ImageRef::operator-() const\n{\n  ImageRef v(-x, -y);\n  return v;\n}\n\ninline ImageRef& ImageRef::operator*=(const double scale)\n{\n  x=(int)(x*scale);\n  y=(int)(y*scale);\n  return *this;\n}\n\ninline ImageRef& ImageRef::operator\/=(const double scale)\n{\n\tx=(int)(x\/scale);\n\ty=(int)(y\/scale);\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator+=(const ImageRef rhs)\n{\n\tx+=rhs.x;\n\ty+=rhs.y;\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator-=(const ImageRef rhs)\n{\n\tx-=rhs.x;\n\ty-=rhs.y;\n\treturn *this;\n}\n\ninline ImageRef ImageRef::operator*(const double scale) const\n{\n\tImageRef v((int)(x*scale),(int)(y*scale));\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator\/(const double scale) const\n{\n\tImageRef v((int)(x\/scale),(int)(y\/scale));\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator+(const ImageRef rhs) const\n{\n\tImageRef v(x+rhs.x, y+rhs.y);\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator-(const ImageRef rhs) const\n{\n\tImageRef v(x-rhs.x, y-rhs.y);\n\treturn v;\n}\n\ninline ImageRef& ImageRef::operator<<=(int i)\n{\n\tx = x << i;\n\ty=y << i;\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator>>=(int i)\n{\n\tx = x >> i;\n\ty=y >> i;\n\treturn *this;\n}\n\ninline ImageRef ImageRef::shiftl(int i) const\n{\n\tImageRef result;\n\tresult.x = x << i;\n\tresult.y=y << i;\n\treturn result;\n}\n\ninline ImageRef ImageRef::shiftr(int i) const\n{\n\tImageRef result;\n\tresult.x = x >> i;\n\tresult.y=y >> i;\n\treturn result;\n}\n\ninline ImageRef ImageRef::operator<<(int i) const\n{\n\treturn shiftl(i);\n}\n\ninline ImageRef ImageRef::operator>>(int i) const\n{\n\treturn shiftr(i);\n}\n\n\ninline ImageRef operator*(const int scale, const ImageRef&  ref)\n{\n\treturn ImageRef(ref.x*scale, ref.y*scale);\n}\n\ninline bool ImageRef::operator<(const ImageRef & other) const\n{\n  return y < other.y || ( y == other.y && x < other.x);\n}\n\ninline bool ImageRef::operator>(const ImageRef & other) const\n{\n  return y > other.y || ( y == other.y && x > other.x);\n}\n\n\ninline int& ImageRef::operator[](int i)\n{\n  if(i==0)\n    return x;\n  if(i==1)\n    return y;\n  throw Exceptions::BadSubscript();\n}\n\ninline int ImageRef::operator[](int i) const\n{\n  if(i==0)\n    return x;\n  if(i==1)\n    return y;\n  throw Exceptions::BadSubscript();\n}\n\ninline unsigned int ImageRef::mag_squared() const\n{\n  typedef unsigned int uint;\n  return uint(x*x) + uint(y*y);\n}\n\ninline int ImageRef::area() const\n{\n  return x * y;\n}\n\ninline ImageRef ImageRef::dot_times(const ImageRef &ref) const\n{\n  return ImageRef(x * ref.x, y * ref.y);\n}\n<commit_msg>make ImageRef::next, prev work for min >= max<commit_after>\/*\n\tThis file is part of the CVD Library.\n\n\tCopyright (C) 2005 The Authors\n\n\tThis library is free software; you can redistribute it and\/or\n\tmodify it under the terms of the GNU Lesser General Public\n\tLicense as published by the Free Software Foundation; either\n\tversion 2.1 of the License, or (at your option) any later version.\n\n\tThis library 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 GNU\n\tLesser General Public License for more details.\n\n\tYou should have received a copy of the GNU Lesser General Public\n\tLicense along with this library; if not, write to the Free Software\n\tFoundation, Inc.,\n    51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n*\/\ninline ImageRef::ImageRef()\n{\n\tx=y=0;\n}\n\ninline ImageRef::ImageRef(int xp, int yp)\n:x(xp),y(yp)\n{}\n\ninline ImageRef::ImageRef(std::istream& is)\n{\n\tis.read((char*)&x,sizeof(int));\n\tis.read((char*)&y,sizeof(int));\n}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ the following cryptic pieces of rubbish are because inline functions \/\/\n\t\/\/ must have their one and only return function as the last call        \/\/\n\t\/\/ so this code makes use of the fact that expressions to the right     \/\/\n\t\/\/ of || are only evaluated when the left hand side is false            \/\/\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ninline bool ImageRef::next(const ImageRef& max)\t\/\/ move on to the next value\n{\n\treturn(++x < max.x || (x=0, ++y < max.y) || (y=0, false));\n}\n\ninline bool ImageRef::next(const ImageRef& min, const ImageRef& max)\n{\n\treturn (++x < max.x || (x=min.x, ++y < max.y) || (y=min.y, false));\n}\n\ninline bool ImageRef::prev(const ImageRef& max)\t\/\/ move back to the previous value\n{\n\treturn(--x > -1 || (x=max.x-1, --y > -1) || (y=max.y-1, false));\n}\n\ninline bool ImageRef::prev(const ImageRef& min, const ImageRef& max)\n{\n\treturn (--x > min.x-1 || (x=max.x-1, --y > min.y-1) || (y=max.y-1, false));\n}\n\ninline void ImageRef::home()\n{\n\tx=y=0;\n}\n\ninline void ImageRef::end(const ImageRef& size)\n{\n\tx=size.x-1;\n\ty=size.y-1;\n}\n\ninline ImageRef& ImageRef::operator=(const ImageRef& ref)\n{\n\tx=ref.x;\n\ty=ref.y;\n\treturn *this;\n}\n\ninline bool ImageRef::operator ==(const ImageRef& ref) const\n{\n\treturn (x==ref.x && y==ref.y);\n}\n\ninline bool ImageRef::operator !=(const ImageRef& ref) const\n{\n\treturn (x!=ref.x || y!=ref.y);\n}\n\ninline ImageRef ImageRef::operator-() const\n{\n  ImageRef v(-x, -y);\n  return v;\n}\n\ninline ImageRef& ImageRef::operator*=(const double scale)\n{\n  x=(int)(x*scale);\n  y=(int)(y*scale);\n  return *this;\n}\n\ninline ImageRef& ImageRef::operator\/=(const double scale)\n{\n\tx=(int)(x\/scale);\n\ty=(int)(y\/scale);\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator+=(const ImageRef rhs)\n{\n\tx+=rhs.x;\n\ty+=rhs.y;\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator-=(const ImageRef rhs)\n{\n\tx-=rhs.x;\n\ty-=rhs.y;\n\treturn *this;\n}\n\ninline ImageRef ImageRef::operator*(const double scale) const\n{\n\tImageRef v((int)(x*scale),(int)(y*scale));\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator\/(const double scale) const\n{\n\tImageRef v((int)(x\/scale),(int)(y\/scale));\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator+(const ImageRef rhs) const\n{\n\tImageRef v(x+rhs.x, y+rhs.y);\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator-(const ImageRef rhs) const\n{\n\tImageRef v(x-rhs.x, y-rhs.y);\n\treturn v;\n}\n\ninline ImageRef& ImageRef::operator<<=(int i)\n{\n\tx = x << i;\n\ty=y << i;\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator>>=(int i)\n{\n\tx = x >> i;\n\ty=y >> i;\n\treturn *this;\n}\n\ninline ImageRef ImageRef::shiftl(int i) const\n{\n\tImageRef result;\n\tresult.x = x << i;\n\tresult.y=y << i;\n\treturn result;\n}\n\ninline ImageRef ImageRef::shiftr(int i) const\n{\n\tImageRef result;\n\tresult.x = x >> i;\n\tresult.y=y >> i;\n\treturn result;\n}\n\ninline ImageRef ImageRef::operator<<(int i) const\n{\n\treturn shiftl(i);\n}\n\ninline ImageRef ImageRef::operator>>(int i) const\n{\n\treturn shiftr(i);\n}\n\n\ninline ImageRef operator*(const int scale, const ImageRef&  ref)\n{\n\treturn ImageRef(ref.x*scale, ref.y*scale);\n}\n\ninline bool ImageRef::operator<(const ImageRef & other) const\n{\n  return y < other.y || ( y == other.y && x < other.x);\n}\n\ninline bool ImageRef::operator>(const ImageRef & other) const\n{\n  return y > other.y || ( y == other.y && x > other.x);\n}\n\n\ninline int& ImageRef::operator[](int i)\n{\n  if(i==0)\n    return x;\n  if(i==1)\n    return y;\n  throw Exceptions::BadSubscript();\n}\n\ninline int ImageRef::operator[](int i) const\n{\n  if(i==0)\n    return x;\n  if(i==1)\n    return y;\n  throw Exceptions::BadSubscript();\n}\n\ninline unsigned int ImageRef::mag_squared() const\n{\n  typedef unsigned int uint;\n  return uint(x*x) + uint(y*y);\n}\n\ninline int ImageRef::area() const\n{\n  return x * y;\n}\n\ninline ImageRef ImageRef::dot_times(const ImageRef &ref) const\n{\n  return ImageRef(x * ref.x, y * ref.y);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"module_webcams.h\"\r\n#include <Module_Webcams\/form_webcams.h>\r\n#include <assert.h>\r\n\r\nModule_Webcams::Module_Webcams( QString id ) :\r\n        RobotModule_MT( id )\r\n{\r\n\/\/    VI.setUseCallback( true );\r\n\/\/    leftConnected = false;\r\n\/\/    rightConnected = false;\r\n\/\/    bottomConnected = false;\r\n    leftFramerate = 5;\r\n    rightFramerate = 5;\r\n    bottomFramerate = 5;\r\n\r\n    leftCap = NULL;\r\n    rightCap = NULL;\r\n    bottomCap = NULL;\r\n\r\n\r\n    nCams = this->numOfCams();\r\n\r\n    leftID = 1;\r\n    rightID = 0;\r\n    bottomID = 2;\r\n\r\n    settingsChanged();\r\n\r\n\r\n\r\n    leftFrame = cvCreateImage( cvSize( WEBCAM_WIDTH, WEBCAM_HEIGHT ), IPL_DEPTH_8U, 3 );\r\n    rightFrame = cvCreateImage( cvSize( WEBCAM_WIDTH, WEBCAM_HEIGHT ), IPL_DEPTH_8U, 3 );\r\n    bottomFrame = cvCreateImage( cvSize( WEBCAM_WIDTH, WEBCAM_HEIGHT ), IPL_DEPTH_8U, 3 );\r\n}\r\n\r\nModule_Webcams::~Module_Webcams()\r\n{\r\n    stopWebcams();\r\n    cvReleaseImage( &leftFrame );\r\n    cvReleaseImage( &rightFrame );\r\n    cvReleaseImage( &bottomFrame );\r\n}\r\n\r\nvoid Module_Webcams::stopWebcams()\r\n{\r\n    if ( leftCap != NULL )\r\n    {\r\n        delete leftCap;\r\n        leftCap = NULL;\r\n    }\r\n    if ( rightCap != NULL )\r\n    {\r\n        delete rightCap;\r\n        rightCap = NULL;\r\n    }\r\n    if ( bottomCap != NULL  )\r\n    {\r\n        delete bottomCap;\r\n        bottomCap = NULL;\r\n    }\r\n\r\n    \/\/cvReleaseCapture(&bottomCam);\/\/VI.stopDevice( bottomID );\r\n}\r\n\r\n\/\/void Module_Webcams::grabLeft( IplImage *left )\r\n\/\/{\r\n\/\/    if ( leftConnected )\/\/&& VI.isFrameNew(leftID) )\r\n\/\/    {\r\n\/\/        mutex.lock();\r\n\/\/        assert( left->width == WEBCAM_WIDTH && left->height == WEBCAM_HEIGHT );\r\n\/\/        if(leftCap.grab())\r\n\/\/        {\r\n\/\/            cv::Mat mat;\r\n\/\/            leftCap.retrieve(mat,0);\r\n\/\/            cv::imshow(\"blub\",mat);\r\n\/\/            left = new IplImage(mat.clone());\r\n\/\/        }\r\n\r\n\/\/\/\/        cvGrabFrame(leftCam);\r\n\/\/\/\/        left = cvCloneImage(cvRetrieveFrame(leftCam));\r\n\/\/\/\/        VI.getPixels( leftID, (unsigned char *)left->imageData, false, true );\r\n\/\/        mutex.unlock();\r\n\/\/    }\r\n\/\/}\r\n\r\n\/\/void Module_Webcams::grabRight( IplImage *right )\r\n\/\/{\r\n\/\/    if ( rightConnected )\/\/&& VI.isFrameNew(rightID))\r\n\/\/    {\r\n\/\/        mutex.lock();\r\n\/\/        assert( right->width == WEBCAM_WIDTH && right->height == WEBCAM_HEIGHT );\r\n\/\/        if(rightCap.grab())\r\n\/\/        {\r\n\/\/            cv::Mat mat;\r\n\/\/            rightCap.retrieve(mat);\r\n\/\/            right = new IplImage(mat);\r\n\/\/        }\r\n\r\n\/\/\/\/        cvGrabFrame(rightCam);\r\n\/\/\/\/        right = cvCloneImage(cvRetrieveFrame(rightCam));\r\n\/\/\/\/        VI.getPixels( rightID, (unsigned char *)right->imageData, false, true );\r\n\/\/        mutex.unlock();\r\n\/\/    }\r\n\/\/}\r\n\r\n\/\/void Module_Webcams::grabBottom( IplImage *bottom )\r\n\/\/{\r\n\/\/    if ( bottomConnected )\/\/&& VI.isFrameNew(bottomID))\r\n\/\/    {\r\n\/\/        mutex.lock();\r\n\/\/        assert( bottom->width == WEBCAM_WIDTH && bottom->height == WEBCAM_HEIGHT );\r\n\/\/        if(bottomCap.grab())\r\n\/\/        {\r\n\/\/            cv::Mat mat;\r\n\/\/            bottomCap.retrieve(mat);\r\n\/\/            bottom = new IplImage(mat);\r\n\/\/        }\r\n\/\/        \/\/        cvGrabFrame(bottomCam);\r\n\/\/\/\/        bottom = cvCloneImage(cvRetrieveFrame(bottomCam));\r\n\/\/\/\/        VI.getPixels( bottomID, (unsigned char *)bottom->imageData, false, true );\r\n\/\/        mutex.unlock();\r\n\/\/    }\r\n\/\/}\r\n\r\nvoid Module_Webcams::grabLeft( cv::Mat &left )\r\n{\r\n    if ( leftCap != NULL )\r\n    {\r\n        mutex.lock();\r\n        IplImage* img = cvQueryFrame(leftCap);\r\n        if(img)\r\n        {\r\n        cv::Mat mtx(img);\r\n        left = mtx.clone();\r\n        }\r\n\/\/        *leftCap >> left;\r\n        mutex.unlock();\r\n    }\r\n}\r\n\r\nvoid Module_Webcams::grabRight( cv::Mat &right )\r\n{\r\n    if ( rightCap != NULL )\r\n    {\r\n        mutex.lock();\r\n        IplImage* img = cvQueryFrame(rightCap);\r\n        if(img)\r\n        {\r\n        cv::Mat mat(img);\r\n        right = mat.clone();\r\n    }\r\n\/\/        *rightCap >> right;\r\n        mutex.unlock();\r\n    }\r\n}\r\n\r\nvoid Module_Webcams::grabBottom( cv::Mat &bottom )\r\n{\r\n\/\/    qDebug() << \"cam thread id\";\r\n\/\/    qDebug() << QThread::currentThreadId();\r\n    if ( bottomCap != NULL )\/\/&& VI.isFrameNew(bottomID))\r\n    {\r\n        mutex.lock();\r\n        IplImage* img = cvQueryFrame(bottomCap);\r\n        if(img)\r\n        {\r\n        cv::Mat mat(img);\r\n        bottom = mat.clone();\r\n        }\r\n\/\/        assert( bottom.cols == WEBCAM_WIDTH && bottom.rows == WEBCAM_HEIGHT );\r\n\/\/        if(bottomCap.grab())\r\n\/\/            *bottomCap >> bottom;\r\n\/\/            bottomCap.retrieve(bottom);\r\n\r\n\/\/        cvGrabFrame(bottomCam);\r\n\/\/        IplImage *img = (cvCloneImage(cvRetrieveFrame(bottomCam)));\r\n\/\/        cv::Mat mtx (img);\r\n\/\/        bottom = mtx.clone();\r\n\/\/        VI.getPixels( bottomID, (unsigned char *)bottom.data, true, true );\r\n        mutex.unlock();\r\n    }\r\n}\r\n\/\/\r\n\/\/void Module_Webcams::grabBottom(QImage bottom1)\r\n\/\/{\r\n\/\/    cv::Mat bottom;\r\n\/\/    bottom.create( WEBCAM_HEIGHT, WEBCAM_WIDTH, CV_8UC3 );\r\n\/\/    qDebug() << \"cam thread id\";\r\n\/\/    qDebug() << QThread::currentThreadId();\r\n\/\/    if ( bottomConnected )\/\/&& VI.isFrameNew(bottomID))\r\n\/\/    {\r\n\/\/        mutex.lock();\r\n\/\/        assert( bottom.cols == WEBCAM_WIDTH && bottom.rows == WEBCAM_HEIGHT );\r\n\/\/        VI.getPixels( bottomID, (unsigned char *)bottom.data, true, true );\r\n\/\/        mutex.unlock();\r\n\/\/    }\r\n\/\/     QImage image1((unsigned char*)bottom.data, bottom.cols, bottom.rows, QImage::Format_RGB888);\r\n\/\/     bottom1 = image1.copy();\r\n\/\/}\r\n\r\nvoid Module_Webcams::reset()\r\n{\r\n    mutex.lock();\r\n    stopWebcams();\r\n\r\n    if ( this->isEnabled() )\r\n    {\r\n        if ( 0 <= bottomID && bottomID < nCams && bottomEnabled )\r\n        {\r\n            bottomCap = cvCaptureFromCAM(bottomID);\r\n            if(bottomCap)\r\n            {\r\n                cvSetCaptureProperty(bottomCap,CV_CAP_PROP_FRAME_WIDTH,640);\r\n                cvSetCaptureProperty(bottomCap,CV_CAP_PROP_FRAME_HEIGHT,480);\r\n                qDebug() << QString::number(cvGetCaptureProperty(bottomCap,CV_CAP_PROP_FRAME_WIDTH));\r\n                qDebug() << QString::number(cvGetCaptureProperty(bottomCap,CV_CAP_PROP_FRAME_HEIGHT));\r\n            }\r\n            else\r\n            {\r\n                delete bottomCap;\r\n                bottomCap = NULL;\r\n            }\r\n\/\/            bottomCam = cvCaptureFromCAM(bottomID);\r\n\/\/            bottomConnected = true;\r\n\/\/            VI.setIdealFramerate( bottomID, bottomFramerate );\r\n\/\/            bottomConnected = VI.setupDevice( bottomID, WEBCAM_WIDTH, WEBCAM_HEIGHT );\r\n        }\r\n\r\n        if ( 0 <= leftID && leftID < nCams && leftEnabled )\r\n        {\r\n            leftCap = cvCaptureFromCAM(leftID);\r\n            if(leftCap)\r\n            {\r\n                cvSetCaptureProperty(leftCap,CV_CAP_PROP_FRAME_WIDTH,640);\r\n                cvSetCaptureProperty(leftCap,CV_CAP_PROP_FRAME_HEIGHT,480);\r\n\/\/                qDebug() << QString::number(leftCap->get(CV_CAP_PROP_FRAME_HEIGHT));\r\n\/\/                qDebug() << QString::number(leftCap->get(CV_CAP_PROP_FRAME_WIDTH));\r\n\r\n            }\r\n            else\r\n            {\r\n                delete leftCap;\r\n                leftCap = NULL;\r\n            }\r\n\r\n        }\r\n        if ( 0 <= rightID && rightID < nCams && rightEnabled )\r\n        {\r\n\/\/            rightCap = new cv::VideoCapture(3);\r\n            rightCap = cvCaptureFromCAM(rightID);\r\n            if(rightCap)\r\n            {\r\n                cvSetCaptureProperty(rightCap,CV_CAP_PROP_FRAME_WIDTH,640);\r\n                cvSetCaptureProperty(rightCap,CV_CAP_PROP_FRAME_HEIGHT,480);\r\n\r\n\/\/                qDebug() << QString::number(rightCap->get(CV_CAP_PROP_FRAME_HEIGHT));\r\n\/\/                qDebug() << QString::number(rightCap->get(CV_CAP_PROP_FRAME_WIDTH));\r\n            }\r\n            else\r\n            {\r\n                delete rightCap;\r\n                rightCap = NULL;\r\n            }\r\n\/\/            VI.setIdealFramerate( rightID, rightFramerate );\r\n\/\/            rightConnected = VI.setupDevice( rightID, WEBCAM_WIDTH, WEBCAM_HEIGHT );\r\n        }\r\n    }\r\n    mutex.unlock();\r\n    qDebug() << \"left\" << leftConnected;\r\n        qDebug() << \"right\" << rightConnected;\r\n            qDebug() << \"bottom\" << bottomConnected;\r\n}\r\n\r\nint Module_Webcams::numOfCams()\r\n{ \r\n    cv::VideoCapture cap;\r\n    int finished = 0;\r\n    int cams = 0;\r\n    return 3;\r\n\/\/    while (!finished)\r\n\/\/    {\r\n\/\/        cap.open(cams);\r\n\/\/        if(!cap.isOpened())\r\n\/\/        {\r\n\/\/            finished = 1;\r\n\/\/        }\r\n\/\/        else\r\n\/\/        {\r\n\/\/            cams++;\r\n\/\/            cap.release();\r\n\/\/        }\r\n\/\/    }\r\n\/\/    return cams;\r\n}\r\n\r\nvoid Module_Webcams::terminate()\r\n{\r\n    stopWebcams();\r\n    RobotModule_MT::terminate();\r\n}\r\n\r\n\r\n\r\n\r\nvoid Module_Webcams::statusChange( bool value )\r\n{\r\n\r\n}\r\n\r\nvoid Module_Webcams::showSettings( int camNr )\r\n{\r\n\/\/    VI.showSettingsWindow( camNr );\r\n}\r\n\r\nvoid Module_Webcams::settingsChanged()\r\n{\r\n\/\/    nCams = VI.listDevices( true );\r\n\/\/    nCams = this->numOfCams();\r\n\/\/    logger->debug(\"Number of Cams \"+QString::number(nCams));\r\n    leftID = this->getSettingsValue(\"leftID\",0).toInt();\r\n    rightID = this->getSettingsValue(\"rightID\",1).toInt();\r\n    bottomID = this->getSettingsValue(\"bottomID\",2).toInt();\r\n    leftEnabled = this->getSettingsValue(\"leftEnabled\",true).toBool();\r\n    rightEnabled = this->getSettingsValue(\"rightEnabled\",true).toBool();\r\n    bottomEnabled = this->getSettingsValue(\"bottomEnabled\",true).toBool();\r\n    leftFramerate = this->getSettingsValue(\"leftFramerate\",5).toInt();\r\n    rightFramerate = this->getSettingsValue(\"rightFramerate\",5).toInt();\r\n    bottomFramerate = this->getSettingsValue(\"bottomFramerate\",5).toInt();\r\n\r\n    if ( isEnabled() )\r\n    {\r\n        reset();\r\n    }\r\n}\r\n\r\nQWidget *Module_Webcams::createView( QWidget *parent )\r\n{\r\n    Form_Webcams *cams = new Form_Webcams( this, parent );\r\n    return cams;\r\n}\r\n\r\nQList<RobotModule *> Module_Webcams::getDependencies()\r\n{\r\n    return QList<RobotModule *>();\r\n}\r\n<commit_msg><commit_after>#include \"module_webcams.h\"\r\n#include <Module_Webcams\/form_webcams.h>\r\n#include <assert.h>\r\n\r\nModule_Webcams::Module_Webcams( QString id ) :\r\n        RobotModule_MT( id )\r\n{\r\n\/\/    VI.setUseCallback( true );\r\n\/\/    leftConnected = false;\r\n\/\/    rightConnected = false;\r\n\/\/    bottomConnected = false;\r\n    leftFramerate = 5;\r\n    rightFramerate = 5;\r\n    bottomFramerate = 5;\r\n\r\n    leftCap = NULL;\r\n    rightCap = NULL;\r\n    bottomCap = NULL;\r\n\r\n\r\n    nCams = this->numOfCams();\r\n\r\n    leftID = 1;\r\n    rightID = 0;\r\n    bottomID = 2;\r\n\r\n    settingsChanged();\r\n\r\n\r\n\r\n    leftFrame = cvCreateImage( cvSize( WEBCAM_WIDTH, WEBCAM_HEIGHT ), IPL_DEPTH_8U, 3 );\r\n    rightFrame = cvCreateImage( cvSize( WEBCAM_WIDTH, WEBCAM_HEIGHT ), IPL_DEPTH_8U, 3 );\r\n    bottomFrame = cvCreateImage( cvSize( WEBCAM_WIDTH, WEBCAM_HEIGHT ), IPL_DEPTH_8U, 3 );\r\n}\r\n\r\nModule_Webcams::~Module_Webcams()\r\n{\r\n    stopWebcams();\r\n    cvReleaseImage( &leftFrame );\r\n    cvReleaseImage( &rightFrame );\r\n    cvReleaseImage( &bottomFrame );\r\n}\r\n\r\nvoid Module_Webcams::stopWebcams()\r\n{\r\n    if ( leftCap != NULL )\r\n    {\r\n        delete leftCap;\r\n        leftCap = NULL;\r\n    }\r\n    if ( rightCap != NULL )\r\n    {\r\n        delete rightCap;\r\n        rightCap = NULL;\r\n    }\r\n    if ( bottomCap != NULL  )\r\n    {\r\n        delete bottomCap;\r\n        bottomCap = NULL;\r\n    }\r\n\r\n    \/\/cvReleaseCapture(&bottomCam);\/\/VI.stopDevice( bottomID );\r\n}\r\n\r\n\/\/void Module_Webcams::grabLeft( IplImage *left )\r\n\/\/{\r\n\/\/    if ( leftConnected )\/\/&& VI.isFrameNew(leftID) )\r\n\/\/    {\r\n\/\/        mutex.lock();\r\n\/\/        assert( left->width == WEBCAM_WIDTH && left->height == WEBCAM_HEIGHT );\r\n\/\/        if(leftCap.grab())\r\n\/\/        {\r\n\/\/            cv::Mat mat;\r\n\/\/            leftCap.retrieve(mat,0);\r\n\/\/            cv::imshow(\"blub\",mat);\r\n\/\/            left = new IplImage(mat.clone());\r\n\/\/        }\r\n\r\n\/\/\/\/        cvGrabFrame(leftCam);\r\n\/\/\/\/        left = cvCloneImage(cvRetrieveFrame(leftCam));\r\n\/\/\/\/        VI.getPixels( leftID, (unsigned char *)left->imageData, false, true );\r\n\/\/        mutex.unlock();\r\n\/\/    }\r\n\/\/}\r\n\r\n\/\/void Module_Webcams::grabRight( IplImage *right )\r\n\/\/{\r\n\/\/    if ( rightConnected )\/\/&& VI.isFrameNew(rightID))\r\n\/\/    {\r\n\/\/        mutex.lock();\r\n\/\/        assert( right->width == WEBCAM_WIDTH && right->height == WEBCAM_HEIGHT );\r\n\/\/        if(rightCap.grab())\r\n\/\/        {\r\n\/\/            cv::Mat mat;\r\n\/\/            rightCap.retrieve(mat);\r\n\/\/            right = new IplImage(mat);\r\n\/\/        }\r\n\r\n\/\/\/\/        cvGrabFrame(rightCam);\r\n\/\/\/\/        right = cvCloneImage(cvRetrieveFrame(rightCam));\r\n\/\/\/\/        VI.getPixels( rightID, (unsigned char *)right->imageData, false, true );\r\n\/\/        mutex.unlock();\r\n\/\/    }\r\n\/\/}\r\n\r\n\/\/void Module_Webcams::grabBottom( IplImage *bottom )\r\n\/\/{\r\n\/\/    if ( bottomConnected )\/\/&& VI.isFrameNew(bottomID))\r\n\/\/    {\r\n\/\/        mutex.lock();\r\n\/\/        assert( bottom->width == WEBCAM_WIDTH && bottom->height == WEBCAM_HEIGHT );\r\n\/\/        if(bottomCap.grab())\r\n\/\/        {\r\n\/\/            cv::Mat mat;\r\n\/\/            bottomCap.retrieve(mat);\r\n\/\/            bottom = new IplImage(mat);\r\n\/\/        }\r\n\/\/        \/\/        cvGrabFrame(bottomCam);\r\n\/\/\/\/        bottom = cvCloneImage(cvRetrieveFrame(bottomCam));\r\n\/\/\/\/        VI.getPixels( bottomID, (unsigned char *)bottom->imageData, false, true );\r\n\/\/        mutex.unlock();\r\n\/\/    }\r\n\/\/}\r\n\r\nvoid Module_Webcams::grabLeft( cv::Mat &left )\r\n{\r\n    if ( leftCap != NULL )\r\n    {\r\n        mutex.lock();\r\n        IplImage* img = cvQueryFrame(leftCap);\r\n        if(img)\r\n        {\r\n        cv::Mat mtx(img);\r\n        left = mtx.clone();\r\n        }\r\n\/\/        *leftCap >> left;\r\n        mutex.unlock();\r\n    }\r\n}\r\n\r\nvoid Module_Webcams::grabRight( cv::Mat &right )\r\n{\r\n    if ( rightCap != NULL )\r\n    {\r\n        mutex.lock();\r\n        IplImage* img = cvQueryFrame(rightCap);\r\n        if(img)\r\n        {\r\n        cv::Mat mat(img);\r\n        right = mat.clone();\r\n    }\r\n\/\/        *rightCap >> right;\r\n        mutex.unlock();\r\n    }\r\n}\r\n\r\nvoid Module_Webcams::grabBottom( cv::Mat &bottom )\r\n{\r\n\/\/    qDebug() << \"cam thread id\";\r\n\/\/    qDebug() << QThread::currentThreadId();\r\n    if ( bottomCap != NULL )\/\/&& VI.isFrameNew(bottomID))\r\n    {\r\n        mutex.lock();\r\n        IplImage* img = cvQueryFrame(bottomCap);\r\n        if(img)\r\n        {\r\n        cv::Mat mat(img);\r\n        bottom = mat.clone();\r\n        }\r\n\/\/        assert( bottom.cols == WEBCAM_WIDTH && bottom.rows == WEBCAM_HEIGHT );\r\n\/\/        if(bottomCap.grab())\r\n\/\/            *bottomCap >> bottom;\r\n\/\/            bottomCap.retrieve(bottom);\r\n\r\n\/\/        cvGrabFrame(bottomCam);\r\n\/\/        IplImage *img = (cvCloneImage(cvRetrieveFrame(bottomCam)));\r\n\/\/        cv::Mat mtx (img);\r\n\/\/        bottom = mtx.clone();\r\n\/\/        VI.getPixels( bottomID, (unsigned char *)bottom.data, true, true );\r\n        mutex.unlock();\r\n    }\r\n}\r\n\/\/\r\n\/\/void Module_Webcams::grabBottom(QImage bottom1)\r\n\/\/{\r\n\/\/    cv::Mat bottom;\r\n\/\/    bottom.create( WEBCAM_HEIGHT, WEBCAM_WIDTH, CV_8UC3 );\r\n\/\/    qDebug() << \"cam thread id\";\r\n\/\/    qDebug() << QThread::currentThreadId();\r\n\/\/    if ( bottomConnected )\/\/&& VI.isFrameNew(bottomID))\r\n\/\/    {\r\n\/\/        mutex.lock();\r\n\/\/        assert( bottom.cols == WEBCAM_WIDTH && bottom.rows == WEBCAM_HEIGHT );\r\n\/\/        VI.getPixels( bottomID, (unsigned char *)bottom.data, true, true );\r\n\/\/        mutex.unlock();\r\n\/\/    }\r\n\/\/     QImage image1((unsigned char*)bottom.data, bottom.cols, bottom.rows, QImage::Format_RGB888);\r\n\/\/     bottom1 = image1.copy();\r\n\/\/}\r\n\r\nvoid Module_Webcams::reset()\r\n{\r\n    mutex.lock();\r\n    stopWebcams();\r\n\r\n    if ( this->isEnabled() )\r\n    {\r\n        if ( 0 <= bottomID && bottomID < nCams && bottomEnabled )\r\n        {\r\n            bottomCap = cvCaptureFromCAM(bottomID);\r\n            if(bottomCap)\r\n            {\r\n                cvSetCaptureProperty(bottomCap,CV_CAP_PROP_FRAME_WIDTH,640);\r\n                cvSetCaptureProperty(bottomCap,CV_CAP_PROP_FRAME_HEIGHT,480);\r\n                cvSetCaptureProperty(bottomCap,CV_CAP_PROP_GAIN,0);\r\n                qDebug() << QString::number(cvGetCaptureProperty(bottomCap,CV_CAP_PROP_FRAME_WIDTH));\r\n                qDebug() << QString::number(cvGetCaptureProperty(bottomCap,CV_CAP_PROP_FRAME_HEIGHT));\r\n            }\r\n            else\r\n            {\r\n                delete bottomCap;\r\n                bottomCap = NULL;\r\n            }\r\n\/\/            bottomCam = cvCaptureFromCAM(bottomID);\r\n\/\/            bottomConnected = true;\r\n\/\/            VI.setIdealFramerate( bottomID, bottomFramerate );\r\n\/\/            bottomConnected = VI.setupDevice( bottomID, WEBCAM_WIDTH, WEBCAM_HEIGHT );\r\n        }\r\n\r\n        if ( 0 <= leftID && leftID < nCams && leftEnabled )\r\n        {\r\n            leftCap = cvCaptureFromCAM(leftID);\r\n            if(leftCap)\r\n            {\r\n                cvSetCaptureProperty(leftCap,CV_CAP_PROP_FRAME_WIDTH,640);\r\n                cvSetCaptureProperty(leftCap,CV_CAP_PROP_FRAME_HEIGHT,480);\r\n                cvSetCaptureProperty(leftCap,CV_CAP_PROP_GAIN,0);\r\n\/\/                qDebug() << QString::number(leftCap->get(CV_CAP_PROP_FRAME_HEIGHT));\r\n\/\/                qDebug() << QString::number(leftCap->get(CV_CAP_PROP_FRAME_WIDTH));\r\n\r\n            }\r\n            else\r\n            {\r\n                delete leftCap;\r\n                leftCap = NULL;\r\n            }\r\n\r\n        }\r\n        if ( 0 <= rightID && rightID < nCams && rightEnabled )\r\n        {\r\n\/\/            rightCap = new cv::VideoCapture(3);\r\n            rightCap = cvCaptureFromCAM(rightID);\r\n            if(rightCap)\r\n            {\r\n                cvSetCaptureProperty(rightCap,CV_CAP_PROP_FRAME_WIDTH,640);\r\n                cvSetCaptureProperty(rightCap,CV_CAP_PROP_FRAME_HEIGHT,480);\r\n                cvSetCaptureProperty(rightCap,CV_CAP_PROP_GAIN,0);\r\n\r\n\/\/                qDebug() << QString::number(rightCap->get(CV_CAP_PROP_FRAME_HEIGHT));\r\n\/\/                qDebug() << QString::number(rightCap->get(CV_CAP_PROP_FRAME_WIDTH));\r\n            }\r\n            else\r\n            {\r\n                delete rightCap;\r\n                rightCap = NULL;\r\n            }\r\n\/\/            VI.setIdealFramerate( rightID, rightFramerate );\r\n\/\/            rightConnected = VI.setupDevice( rightID, WEBCAM_WIDTH, WEBCAM_HEIGHT );\r\n        }\r\n    }\r\n    mutex.unlock();\r\n    qDebug() << \"left\" << leftConnected;\r\n        qDebug() << \"right\" << rightConnected;\r\n            qDebug() << \"bottom\" << bottomConnected;\r\n}\r\n\r\nint Module_Webcams::numOfCams()\r\n{ \r\n    cv::VideoCapture cap;\r\n    int finished = 0;\r\n    int cams = 0;\r\n    return 3;\r\n\/\/    while (!finished)\r\n\/\/    {\r\n\/\/        cap.open(cams);\r\n\/\/        if(!cap.isOpened())\r\n\/\/        {\r\n\/\/            finished = 1;\r\n\/\/        }\r\n\/\/        else\r\n\/\/        {\r\n\/\/            cams++;\r\n\/\/            cap.release();\r\n\/\/        }\r\n\/\/    }\r\n\/\/    return cams;\r\n}\r\n\r\nvoid Module_Webcams::terminate()\r\n{\r\n    stopWebcams();\r\n    RobotModule_MT::terminate();\r\n}\r\n\r\n\r\n\r\n\r\nvoid Module_Webcams::statusChange( bool value )\r\n{\r\n\r\n}\r\n\r\nvoid Module_Webcams::showSettings( int camNr )\r\n{\r\n\/\/    VI.showSettingsWindow( camNr );\r\n}\r\n\r\nvoid Module_Webcams::settingsChanged()\r\n{\r\n\/\/    nCams = VI.listDevices( true );\r\n\/\/    nCams = this->numOfCams();\r\n\/\/    logger->debug(\"Number of Cams \"+QString::number(nCams));\r\n    leftID = this->getSettingsValue(\"leftID\",0).toInt();\r\n    rightID = this->getSettingsValue(\"rightID\",1).toInt();\r\n    bottomID = this->getSettingsValue(\"bottomID\",2).toInt();\r\n    leftEnabled = this->getSettingsValue(\"leftEnabled\",true).toBool();\r\n    rightEnabled = this->getSettingsValue(\"rightEnabled\",true).toBool();\r\n    bottomEnabled = this->getSettingsValue(\"bottomEnabled\",true).toBool();\r\n    leftFramerate = this->getSettingsValue(\"leftFramerate\",5).toInt();\r\n    rightFramerate = this->getSettingsValue(\"rightFramerate\",5).toInt();\r\n    bottomFramerate = this->getSettingsValue(\"bottomFramerate\",5).toInt();\r\n\r\n    if ( isEnabled() )\r\n    {\r\n        reset();\r\n    }\r\n}\r\n\r\nQWidget *Module_Webcams::createView( QWidget *parent )\r\n{\r\n    Form_Webcams *cams = new Form_Webcams( this, parent );\r\n    return cams;\r\n}\r\n\r\nQList<RobotModule *> Module_Webcams::getDependencies()\r\n{\r\n    return QList<RobotModule *>();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"SocketDescriptor.hxx\"\n#include \"SocketAddress.hxx\"\n#include \"StaticSocketAddress.hxx\"\n#include \"util\/Error.hxx\"\n\n#include <unistd.h>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <netinet\/tcp.h>\n\nSocketDescriptor::~SocketDescriptor()\n{\n    if (IsDefined())\n        Close();\n}\n\nvoid\nSocketDescriptor::Close()\n{\n    assert(IsDefined());\n\n    close(fd);\n    fd = -1;\n}\n\nbool\nSocketDescriptor::Create(int domain, int type, int protocol)\n{\n    assert(!IsDefined());\n\n    type |= SOCK_CLOEXEC|SOCK_NONBLOCK;\n    fd = socket(domain, type, protocol);\n    return fd >= 0;\n}\n\nbool\nSocketDescriptor::Create(int domain, int type, int protocol, Error &error)\n{\n    assert(!IsDefined());\n\n    type |= SOCK_CLOEXEC|SOCK_NONBLOCK;\n    fd = socket(domain, type, protocol);\n    if (fd < 0) {\n        error.SetErrno(\"Failed to create socket\");\n        return false;\n    }\n\n    return true;\n}\n\nbool\nSocketDescriptor::CreateListen(int family, int socktype, int protocol,\n                               const SocketAddress &address, Error &error)\n{\n    if (!Create(family, socktype, protocol, error))\n        return false;\n\n    const int reuse = 1;\n    if (setsockopt(fd, SOL_SOCKET, SO_REUSEADDR,\n                   (const char *)&reuse, sizeof(reuse)) < 0) {\n        error.SetErrno(\"Failed to set SO_REUSEADDR\");\n        Close();\n        return false;\n    }\n\n    if (!Bind(address)) {\n        error.SetErrno(\"Failed to bind\");\n        Close();\n        return false;\n    }\n\n#ifdef __linux\n    \/* enable TCP Fast Open (requires Linux 3.7) *\/\n\n#ifndef TCP_FASTOPEN\n#define TCP_FASTOPEN 23\n#endif\n\n    if ((family == AF_INET || family == AF_INET6) &&\n        socktype == SOCK_STREAM) {\n        int qlen = 16;\n        setsockopt(fd, SOL_TCP, TCP_FASTOPEN, &qlen, sizeof(qlen));\n    }\n#endif\n\n    if (listen(fd, 64) < 0) {\n        error.SetErrno(\"Failed to listen\");\n        Close();\n        return false;\n    }\n\n    setsockopt(fd, SOL_SOCKET, SO_PASSCRED,\n               (const char *)&reuse, sizeof(reuse));\n\n    return true;\n}\n\nbool\nSocketDescriptor::Bind(SocketAddress address)\n{\n    assert(IsDefined());\n\n    return bind(fd, address, address.GetSize()) == 0;\n}\n\nSocketDescriptor\nSocketDescriptor::Accept(StaticSocketAddress &address, Error &error) const\n{\n    assert(IsDefined());\n\n    address.size = address.GetCapacity();\n    int result = accept4(fd, address, &address.size,\n                         SOCK_CLOEXEC|SOCK_NONBLOCK);\n    if (result < 0) {\n        error.SetErrno(\"Failed to accept connection\");\n        return SocketDescriptor();\n    }\n\n    return SocketDescriptor(result);\n}\n\nbool\nSocketDescriptor::Connect(const SocketAddress address)\n{\n    assert(IsDefined());\n\n    return connect(fd, address, address.GetSize());\n}\n\nint\nSocketDescriptor::GetError()\n{\n    assert(IsDefined());\n\n    int s_err = 0;\n    socklen_t s_err_size = sizeof(s_err);\n    return getsockopt(fd, SOL_SOCKET, SO_ERROR,\n                      (char *)&s_err, &s_err_size) == 0\n        ? s_err\n        : errno;\n}\n\nStaticSocketAddress\nSocketDescriptor::GetLocalAddress() const\n{\n    assert(IsDefined());\n\n    StaticSocketAddress result;\n    result.size = result.GetCapacity();\n    if (getsockname(fd, result, &result.size) < 0)\n        result.Clear();\n\n    return result;\n}\n\n<commit_msg>net\/SocketDescriptor: fix Connect() return value<commit_after>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"SocketDescriptor.hxx\"\n#include \"SocketAddress.hxx\"\n#include \"StaticSocketAddress.hxx\"\n#include \"util\/Error.hxx\"\n\n#include <unistd.h>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <netinet\/tcp.h>\n\nSocketDescriptor::~SocketDescriptor()\n{\n    if (IsDefined())\n        Close();\n}\n\nvoid\nSocketDescriptor::Close()\n{\n    assert(IsDefined());\n\n    close(fd);\n    fd = -1;\n}\n\nbool\nSocketDescriptor::Create(int domain, int type, int protocol)\n{\n    assert(!IsDefined());\n\n    type |= SOCK_CLOEXEC|SOCK_NONBLOCK;\n    fd = socket(domain, type, protocol);\n    return fd >= 0;\n}\n\nbool\nSocketDescriptor::Create(int domain, int type, int protocol, Error &error)\n{\n    assert(!IsDefined());\n\n    type |= SOCK_CLOEXEC|SOCK_NONBLOCK;\n    fd = socket(domain, type, protocol);\n    if (fd < 0) {\n        error.SetErrno(\"Failed to create socket\");\n        return false;\n    }\n\n    return true;\n}\n\nbool\nSocketDescriptor::CreateListen(int family, int socktype, int protocol,\n                               const SocketAddress &address, Error &error)\n{\n    if (!Create(family, socktype, protocol, error))\n        return false;\n\n    const int reuse = 1;\n    if (setsockopt(fd, SOL_SOCKET, SO_REUSEADDR,\n                   (const char *)&reuse, sizeof(reuse)) < 0) {\n        error.SetErrno(\"Failed to set SO_REUSEADDR\");\n        Close();\n        return false;\n    }\n\n    if (!Bind(address)) {\n        error.SetErrno(\"Failed to bind\");\n        Close();\n        return false;\n    }\n\n#ifdef __linux\n    \/* enable TCP Fast Open (requires Linux 3.7) *\/\n\n#ifndef TCP_FASTOPEN\n#define TCP_FASTOPEN 23\n#endif\n\n    if ((family == AF_INET || family == AF_INET6) &&\n        socktype == SOCK_STREAM) {\n        int qlen = 16;\n        setsockopt(fd, SOL_TCP, TCP_FASTOPEN, &qlen, sizeof(qlen));\n    }\n#endif\n\n    if (listen(fd, 64) < 0) {\n        error.SetErrno(\"Failed to listen\");\n        Close();\n        return false;\n    }\n\n    setsockopt(fd, SOL_SOCKET, SO_PASSCRED,\n               (const char *)&reuse, sizeof(reuse));\n\n    return true;\n}\n\nbool\nSocketDescriptor::Bind(SocketAddress address)\n{\n    assert(IsDefined());\n\n    return bind(fd, address, address.GetSize()) == 0;\n}\n\nSocketDescriptor\nSocketDescriptor::Accept(StaticSocketAddress &address, Error &error) const\n{\n    assert(IsDefined());\n\n    address.size = address.GetCapacity();\n    int result = accept4(fd, address, &address.size,\n                         SOCK_CLOEXEC|SOCK_NONBLOCK);\n    if (result < 0) {\n        error.SetErrno(\"Failed to accept connection\");\n        return SocketDescriptor();\n    }\n\n    return SocketDescriptor(result);\n}\n\nbool\nSocketDescriptor::Connect(const SocketAddress address)\n{\n    assert(IsDefined());\n\n    return connect(fd, address, address.GetSize()) == 0;\n}\n\nint\nSocketDescriptor::GetError()\n{\n    assert(IsDefined());\n\n    int s_err = 0;\n    socklen_t s_err_size = sizeof(s_err);\n    return getsockopt(fd, SOL_SOCKET, SO_ERROR,\n                      (char *)&s_err, &s_err_size) == 0\n        ? s_err\n        : errno;\n}\n\nStaticSocketAddress\nSocketDescriptor::GetLocalAddress() const\n{\n    assert(IsDefined());\n\n    StaticSocketAddress result;\n    result.size = result.GetCapacity();\n    if (getsockname(fd, result, &result.size) < 0)\n        result.Clear();\n\n    return result;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) The Shogun Machine Learning Toolbox\n * Written (W) 2015 Wu Lin\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 Shogun Development Team.\n *\n *\/\n\n#include <shogun\/machine\/gp\/SingleSparseInferenceBase.h>\n#ifdef USE_GPL_SHOGUN\n#ifdef HAVE_NLOPT\n#include <shogun\/optimization\/NLOPTMinimizer.h>\n#include <shogun\/features\/DenseFeatures.h>\n#endif \/\/HAVE_NLOPT\n#endif \/\/USE_GPL_SHOGUN\n\n#include <shogun\/mathematics\/Math.h>\n#include <shogun\/mathematics\/eigen3.h>\n#include <shogun\/features\/DotFeatures.h>\n#include <shogun\/optimization\/FirstOrderBoundConstraintsCostFunction.h>\n\nusing namespace shogun;\nusing namespace Eigen;\n\nnamespace shogun\n{\n\n#ifndef DOXYGEN_SHOULD_SKIP_THIS\n\/** Wrapper cost function used for the NLOPT minimizer *\/\nclass CSingleSparseInferenceCostFunction: public FirstOrderBoundConstraintsCostFunction\n{\npublic:\n        CSingleSparseInferenceCostFunction():FirstOrderBoundConstraintsCostFunction() {  init(); }\n        virtual ~CSingleSparseInferenceCostFunction() { SG_UNREF(m_obj); }\n        void set_target(CSingleSparseInferenceBase *obj)\n\t{\n\t\tif(obj!=m_obj)\n\t\t{\n\t\t\tSG_REF(obj);\n\t\t\tSG_UNREF(m_obj);\n\t\t\tm_obj=obj;\n\t\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\t\tm_obj->check_fully_sparse();\n\t\t\tREQUIRE(m_obj->m_fully_sparse,\"Can not compute gradient\\n\");\n\t\t}\n\t}\n        virtual float64_t get_cost()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\tdouble nlz=m_obj->get_negative_log_marginal_likelihood();\n\t\treturn nlz;\n\t}\n        virtual SGVector<float64_t> obtain_variable_reference()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\tSGMatrix<float64_t>& lat_m=m_obj->m_inducing_features;\n\t\tSGVector<double> x(lat_m.matrix,lat_m.num_rows*lat_m.num_cols,false);\n\t\treturn x;\n\t}\n        virtual SGVector<float64_t> get_gradient()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\tm_obj->compute_gradient();\n\t\tTParameter* param=m_obj->m_gradient_parameters->get_parameter(\"inducing_features\");\n\t\tSGVector<float64_t> derivatives=m_obj->get_derivative_wrt_inducing_features(param);\n\t\treturn derivatives;\n\t}\n        virtual SGVector<float64_t> get_lower_bound()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\treturn m_obj->m_lower_bound;\n\t}\n        virtual SGVector<float64_t> get_upper_bound()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\treturn m_obj->m_upper_bound;\n\t}\nprivate:\n        void init() { m_obj=NULL; }\n        CSingleSparseInferenceBase *m_obj;\n};\n#endif \/\/DOXYGEN_SHOULD_SKIP_THIS\n\nCSingleSparseInferenceBase::CSingleSparseInferenceBase() : CSparseInferenceBase()\n{\n\tinit();\n}\n\nCSingleSparseInferenceBase::CSingleSparseInferenceBase(CKernel* kern, CFeatures* feat,\n\t\tCMeanFunction* m, CLabels* lab, CLikelihoodModel* mod, CFeatures* lat)\n\t\t: CSparseInferenceBase(kern, feat, m, lab, mod, lat)\n{\n\tinit();\n\tcheck_fully_sparse();\n}\n\nvoid CSingleSparseInferenceBase::init()\n{\n\tm_fully_sparse=false;\n\tSG_ADD(&m_fully_sparse, \"fully_Sparse\",\n\t\t\"whether the kernel support sparse inference\", MS_NOT_AVAILABLE);\n\tm_lock=new CLock();\n\n\tSG_ADD(&m_upper_bound, \"upper_bound\",\n\t\t\"upper bound of inducing features\", MS_NOT_AVAILABLE);\n\tSG_ADD(&m_lower_bound, \"lower_bound\",\n\t\t\"lower bound of inducing features\", MS_NOT_AVAILABLE);\n\tSG_ADD(&m_max_ind_iterations, \"max_ind_iterations\",\n\t\t\"max number of iterations used in inducing features optimization\", MS_NOT_AVAILABLE);\n\tSG_ADD(&m_ind_tolerance, \"ind_tolerance\",\n\t\t\"tolearance used in inducing features optimization\", MS_NOT_AVAILABLE);\n\tSG_ADD(&m_opt_inducing_features,\n\t\t\"opt_inducing_features\", \"whether optimize inducing features\", MS_NOT_AVAILABLE);\n\tm_max_ind_iterations=50;\n\tm_ind_tolerance=1e-3;\n\tm_opt_inducing_features=false;\n\tm_lower_bound=SGVector<float64_t>();\n\tm_upper_bound=SGVector<float64_t>();\n}\n\nvoid CSingleSparseInferenceBase::set_kernel(CKernel* kern)\n{\n\tCInferenceMethod::set_kernel(kern);\n\tcheck_fully_sparse();\n}\n\nCSingleSparseInferenceBase::~CSingleSparseInferenceBase()\n{\n\tdelete m_lock;\n}\n\nvoid CSingleSparseInferenceBase::check_fully_sparse()\n{\n\tREQUIRE(m_kernel, \"Kernel must be set first\\n\")\n\tif (strstr(m_kernel->get_name(), \"SparseKernel\")!=NULL)\n\t\tm_fully_sparse=true;\n\telse\n\t{\n\t\tSG_WARNING( \"The provided kernel does not support to optimize inducing features\\n\");\n\t\tm_fully_sparse=false;\n\t}\n}\n\nSGVector<float64_t> CSingleSparseInferenceBase::get_derivative_wrt_inference_method(\n\t\tconst TParameter* param)\n{\n\t\/\/ the time complexity O(m^2*n) if the TO DO is done\n\tREQUIRE(param, \"Param not set\\n\");\n\tREQUIRE(!(strcmp(param->m_name, \"log_scale\")\n\t\t\t&& strcmp(param->m_name, \"log_inducing_noise\")\n\t\t\t&& strcmp(param->m_name, \"inducing_features\")),\n\t\t    \"Can't compute derivative of\"\n\t\t\t\" the nagative log marginal likelihood wrt %s.%s parameter\\n\",\n\t\t\tget_name(), param->m_name)\n\n\tif (!strcmp(param->m_name, \"log_inducing_noise\"))\n\t\t\/\/ wrt inducing_noise\n\t\t\/\/ compute derivative wrt inducing noise\n\t\treturn get_derivative_wrt_inducing_noise(param);\n\telse if (!strcmp(param->m_name, \"inducing_features\"))\n\t{\n\t\tSGVector<float64_t> res;\n\t\tif (!m_fully_sparse)\n\t\t{\n\t\t\tint32_t dim=m_inducing_features.num_rows;\n\t\t\tint32_t num_samples=m_inducing_features.num_cols;\n\t\t\tres=SGVector<float64_t>(dim*num_samples);\n\t\t\tSG_WARNING(\"Derivative wrt %s cannot be computed since the kernel does not support fully sparse inference\\n\",\n\t\t\t\tparam->m_name);\n\t\t\tres.zero();\n\t\t\treturn res;\n\t\t}\n\t\tres=get_derivative_wrt_inducing_features(param);\n\t\treturn res;\n\t}\n\n\t\/\/ wrt scale\n\t\/\/ clone kernel matrices\n\tSGVector<float64_t> deriv_trtr=m_ktrtr_diag.clone();\n\tSGMatrix<float64_t> deriv_uu=m_kuu.clone();\n\tSGMatrix<float64_t> deriv_tru=m_ktru.clone();\n\n\t\/\/ create eigen representation of kernel matrices\n\tMap<VectorXd> ddiagKi(deriv_trtr.vector, deriv_trtr.vlen);\n\tMap<MatrixXd> dKuui(deriv_uu.matrix, deriv_uu.num_rows, deriv_uu.num_cols);\n\tMap<MatrixXd> dKui(deriv_tru.matrix, deriv_tru.num_rows, deriv_tru.num_cols);\n\n\t\/\/ compute derivatives wrt scale for each kernel matrix\n\tSGVector<float64_t> result(1);\n\n\tresult[0]=get_derivative_related_cov(deriv_trtr, deriv_uu, deriv_tru);\n\tresult[0]*=CMath::exp(m_log_scale*2.0)*2.0;\n\treturn result;\n}\n\nSGVector<float64_t> CSingleSparseInferenceBase::get_derivative_wrt_kernel(\n\tconst TParameter* param)\n{\n\tREQUIRE(param, \"Param not set\\n\");\n\tSGVector<float64_t> result;\n\tint64_t len=const_cast<TParameter *>(param)->m_datatype.get_num_elements();\n\tresult=SGVector<float64_t>(len);\n\n\tCFeatures *inducing_features=get_inducing_features();\n\tfor (index_t i=0; i<result.vlen; i++)\n\t{\n\t\tSGVector<float64_t> deriv_trtr;\n\t\tSGMatrix<float64_t> deriv_uu;\n\t\tSGMatrix<float64_t> deriv_tru;\n\n\t\tm_lock->lock();\n\t\tm_kernel->init(m_features, m_features);\n\t\t\/\/to reduce the time complexity\n\t\t\/\/the kernel object only computes diagonal elements of gradients wrt hyper-parameter\n\t\tderiv_trtr=m_kernel->get_parameter_gradient_diagonal(param, i);\n\n\t\tm_kernel->init(inducing_features, inducing_features);\n\t\tderiv_uu=m_kernel->get_parameter_gradient(param, i);\n\n\t\tm_kernel->init(inducing_features, m_features);\n\t\tderiv_tru=m_kernel->get_parameter_gradient(param, i);\n\t\tm_lock->unlock();\n\n\t\t\/\/ create eigen representation of derivatives\n\t\tMap<VectorXd> ddiagKi(deriv_trtr.vector, deriv_trtr.vlen);\n\t\tMap<MatrixXd> dKuui(deriv_uu.matrix, deriv_uu.num_rows,\n\t\t\t\tderiv_uu.num_cols);\n\t\tMap<MatrixXd> dKui(deriv_tru.matrix, deriv_tru.num_rows,\n\t\t\t\tderiv_tru.num_cols);\n\n\t\tresult[i]=get_derivative_related_cov(deriv_trtr, deriv_uu, deriv_tru);\n\t\tresult[i]*=CMath::exp(m_log_scale*2.0);\n\t}\n\tSG_UNREF(inducing_features);\n\treturn result;\n}\n\nvoid CSingleSparseInferenceBase::check_bound(SGVector<float64_t> bound, const char* name)\n{\n\tif (bound.vlen>1)\n\t{\n\t\tREQUIRE(m_inducing_features.num_rows>0, \"Inducing features must set before this method is called\\n\");\n\t\tREQUIRE(m_inducing_features.num_rows*m_inducing_features.num_cols==bound.vlen,\n\t\t\t\"The length of inducing features (%dx%d)\",\n\t\t\t\" and the length of bound constraints (%d) are different\\n\", \n\t\t\tm_inducing_features.num_rows,m_inducing_features.num_cols,bound.vlen);\n\t}\n\telse if(bound.vlen==1)\n\t{\n\t\tSG_WARNING(\"All inducing_features (%dx%d) are constrainted by the single value (%f) in the %s bound\\n\",\n\t\t\tm_inducing_features.num_rows,m_inducing_features.num_cols,bound[0],name);\n\t}\n}\n\nvoid CSingleSparseInferenceBase::set_lower_bound_of_inducing_features(SGVector<float64_t> bound)\n{\n\tcheck_bound(bound,\"lower\");\n\tm_lower_bound=bound;\n}\nvoid CSingleSparseInferenceBase::set_upper_bound_of_inducing_features(SGVector<float64_t> bound)\n{\n\tcheck_bound(bound, \"upper\");\n\tm_upper_bound=bound;\n}\n\nvoid CSingleSparseInferenceBase::set_max_iterations_for_inducing_features(int32_t it)\n{\n\tREQUIRE(it>0, \"Iteration (%d) must be positive\\n\",it);\n\tm_max_ind_iterations=it;\n}\nvoid CSingleSparseInferenceBase::set_tolearance_for_inducing_features(float64_t tol)\n{\n\n\tREQUIRE(tol>0, \"Tolearance (%f) must be positive\\n\",tol);\n\tm_ind_tolerance=tol;\n}\ndouble CSingleSparseInferenceBase::nlopt_function(unsigned n, const double* x, double* grad, void* func_data)\n{\n\tCSingleSparseInferenceBase* object=static_cast<CSingleSparseInferenceBase *>(func_data);\n\tREQUIRE(object,\"func_data must be SingleSparseInferenceBase pointer\\n\");\n\n\tdouble nlz=object->get_negative_log_marginal_likelihood();\n\tobject->compute_gradient();\n\n\tTParameter* param=object->m_gradient_parameters->get_parameter(\"inducing_features\");\n\tSGVector<float64_t> derivatives=object->get_derivative_wrt_inducing_features(param);\n\n\tstd::copy(derivatives.vector,derivatives.vector+n,grad);\n\n\treturn nlz;\n}\n\nvoid CSingleSparseInferenceBase::enable_optimizing_inducing_features(bool is_optmization)\n{\n\tm_opt_inducing_features=is_optmization;\n}\n\nvoid CSingleSparseInferenceBase::optimize_inducing_features()\n{\n#ifdef USE_GPL_SHOGUN\n#ifdef HAVE_NLOPT\n\tif (!m_opt_inducing_features)\n\t\treturn;\n\n\tcheck_fully_sparse();\n\tREQUIRE(m_fully_sparse,\"Please use a kernel which supports to optimize inducing features\\n\");\n\n\tCSingleSparseInferenceCostFunction *cost_fun=new CSingleSparseInferenceCostFunction();\n\tSG_REF(this);\n\tcost_fun->set_target(this);\n    \n\tNLOPTMinimizer* opt=new NLOPTMinimizer(cost_fun);\n\topt->set_nlopt_parameters(NLOPT_LD_LBFGS, m_max_ind_iterations, m_ind_tolerance, m_ind_tolerance);\n\topt->minimize();\n\n\tdelete cost_fun;\n\tdelete opt;\n#else\n\tSG_PRINT(\"For this functionality we require NLOPT library\\n\");\n#endif \/\/HAVE_NLOPT\n#else \n\tSG_PRINT(\"For this functionality we require NLOPT (GPL License) library\\n\");\n#endif \/\/USE_GPL_SHOGUN\n}\n\n}\n<commit_msg>added some comments<commit_after>\/*\n * Copyright (c) The Shogun Machine Learning Toolbox\n * Written (W) 2015 Wu Lin\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 Shogun Development Team.\n *\n *\/\n\n#include <shogun\/machine\/gp\/SingleSparseInferenceBase.h>\n#ifdef USE_GPL_SHOGUN\n#ifdef HAVE_NLOPT\n#include <shogun\/optimization\/NLOPTMinimizer.h>\n#include <shogun\/features\/DenseFeatures.h>\n#endif \/\/HAVE_NLOPT\n#endif \/\/USE_GPL_SHOGUN\n\n#include <shogun\/mathematics\/Math.h>\n#include <shogun\/mathematics\/eigen3.h>\n#include <shogun\/features\/DotFeatures.h>\n#include <shogun\/optimization\/FirstOrderBoundConstraintsCostFunction.h>\n\nusing namespace shogun;\nusing namespace Eigen;\n\nnamespace shogun\n{\n\n#ifndef DOXYGEN_SHOULD_SKIP_THIS\n\/** Wrapper cost function used for the NLOPT minimizer *\/\nclass CSingleSparseInferenceCostFunction: public FirstOrderBoundConstraintsCostFunction\n{\npublic:\n        CSingleSparseInferenceCostFunction():FirstOrderBoundConstraintsCostFunction() {  init(); }\n        virtual ~CSingleSparseInferenceCostFunction() { SG_UNREF(m_obj); }\n        void set_target(CSingleSparseInferenceBase *obj)\n\t{\n\t\tif(obj!=m_obj)\n\t\t{\n\t\t\tSG_REF(obj);\n\t\t\tSG_UNREF(m_obj);\n\t\t\tm_obj=obj;\n\t\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\t\tm_obj->check_fully_sparse();\n\t\t\tREQUIRE(m_obj->m_fully_sparse,\"Can not compute gradient\\n\");\n\t\t}\n\t}\n        virtual float64_t get_cost()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\tdouble nlz=m_obj->get_negative_log_marginal_likelihood();\n\t\treturn nlz;\n\t}\n        virtual SGVector<float64_t> obtain_variable_reference()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\tSGMatrix<float64_t>& lat_m=m_obj->m_inducing_features;\n\t\tSGVector<double> x(lat_m.matrix,lat_m.num_rows*lat_m.num_cols,false);\n\t\treturn x;\n\t}\n        virtual SGVector<float64_t> get_gradient()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\tm_obj->compute_gradient();\n\t\tTParameter* param=m_obj->m_gradient_parameters->get_parameter(\"inducing_features\");\n\t\tSGVector<float64_t> derivatives=m_obj->get_derivative_wrt_inducing_features(param);\n\t\treturn derivatives;\n\t}\n        virtual SGVector<float64_t> get_lower_bound()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\treturn m_obj->m_lower_bound;\n\t}\n        virtual SGVector<float64_t> get_upper_bound()\n\t{\n\t\tREQUIRE(m_obj,\"Object not set\\n\");\n\t\treturn m_obj->m_upper_bound;\n\t}\nprivate:\n        void init() { m_obj=NULL; }\n        CSingleSparseInferenceBase *m_obj;\n};\n#endif \/\/DOXYGEN_SHOULD_SKIP_THIS\n\nCSingleSparseInferenceBase::CSingleSparseInferenceBase() : CSparseInferenceBase()\n{\n\tinit();\n}\n\nCSingleSparseInferenceBase::CSingleSparseInferenceBase(CKernel* kern, CFeatures* feat,\n\t\tCMeanFunction* m, CLabels* lab, CLikelihoodModel* mod, CFeatures* lat)\n\t\t: CSparseInferenceBase(kern, feat, m, lab, mod, lat)\n{\n\tinit();\n\tcheck_fully_sparse();\n}\n\nvoid CSingleSparseInferenceBase::init()\n{\n\tm_fully_sparse=false;\n\tSG_ADD(&m_fully_sparse, \"fully_Sparse\",\n\t\t\"whether the kernel support sparse inference\", MS_NOT_AVAILABLE);\n\tm_lock=new CLock();\n\n\tSG_ADD(&m_upper_bound, \"upper_bound\",\n\t\t\"upper bound of inducing features\", MS_NOT_AVAILABLE);\n\tSG_ADD(&m_lower_bound, \"lower_bound\",\n\t\t\"lower bound of inducing features\", MS_NOT_AVAILABLE);\n\tSG_ADD(&m_max_ind_iterations, \"max_ind_iterations\",\n\t\t\"max number of iterations used in inducing features optimization\", MS_NOT_AVAILABLE);\n\tSG_ADD(&m_ind_tolerance, \"ind_tolerance\",\n\t\t\"tolearance used in inducing features optimization\", MS_NOT_AVAILABLE);\n\tSG_ADD(&m_opt_inducing_features,\n\t\t\"opt_inducing_features\", \"whether optimize inducing features\", MS_NOT_AVAILABLE);\n\tm_max_ind_iterations=50;\n\tm_ind_tolerance=1e-3;\n\tm_opt_inducing_features=false;\n\tm_lower_bound=SGVector<float64_t>();\n\tm_upper_bound=SGVector<float64_t>();\n}\n\nvoid CSingleSparseInferenceBase::set_kernel(CKernel* kern)\n{\n\tCInferenceMethod::set_kernel(kern);\n\tcheck_fully_sparse();\n}\n\nCSingleSparseInferenceBase::~CSingleSparseInferenceBase()\n{\n\tdelete m_lock;\n}\n\nvoid CSingleSparseInferenceBase::check_fully_sparse()\n{\n\tREQUIRE(m_kernel, \"Kernel must be set first\\n\")\n\tif (strstr(m_kernel->get_name(), \"SparseKernel\")!=NULL)\n\t\tm_fully_sparse=true;\n\telse\n\t{\n\t\tSG_WARNING( \"The provided kernel does not support to optimize inducing features\\n\");\n\t\tm_fully_sparse=false;\n\t}\n}\n\nSGVector<float64_t> CSingleSparseInferenceBase::get_derivative_wrt_inference_method(\n\t\tconst TParameter* param)\n{\n\t\/\/ the time complexity O(m^2*n) if the TO DO is done\n\tREQUIRE(param, \"Param not set\\n\");\n\tREQUIRE(!(strcmp(param->m_name, \"log_scale\")\n\t\t\t&& strcmp(param->m_name, \"log_inducing_noise\")\n\t\t\t&& strcmp(param->m_name, \"inducing_features\")),\n\t\t    \"Can't compute derivative of\"\n\t\t\t\" the nagative log marginal likelihood wrt %s.%s parameter\\n\",\n\t\t\tget_name(), param->m_name)\n\n\tif (!strcmp(param->m_name, \"log_inducing_noise\"))\n\t\t\/\/ wrt inducing_noise\n\t\t\/\/ compute derivative wrt inducing noise\n\t\treturn get_derivative_wrt_inducing_noise(param);\n\telse if (!strcmp(param->m_name, \"inducing_features\"))\n\t{\n\t\tSGVector<float64_t> res;\n\t\tif (!m_fully_sparse)\n\t\t{\n\t\t\tint32_t dim=m_inducing_features.num_rows;\n\t\t\tint32_t num_samples=m_inducing_features.num_cols;\n\t\t\tres=SGVector<float64_t>(dim*num_samples);\n\t\t\tSG_WARNING(\"Derivative wrt %s cannot be computed since the kernel does not support fully sparse inference\\n\",\n\t\t\t\tparam->m_name);\n\t\t\tres.zero();\n\t\t\treturn res;\n\t\t}\n\t\tres=get_derivative_wrt_inducing_features(param);\n\t\treturn res;\n\t}\n\n\t\/\/ wrt scale\n\t\/\/ clone kernel matrices\n\tSGVector<float64_t> deriv_trtr=m_ktrtr_diag.clone();\n\tSGMatrix<float64_t> deriv_uu=m_kuu.clone();\n\tSGMatrix<float64_t> deriv_tru=m_ktru.clone();\n\n\t\/\/ create eigen representation of kernel matrices\n\tMap<VectorXd> ddiagKi(deriv_trtr.vector, deriv_trtr.vlen);\n\tMap<MatrixXd> dKuui(deriv_uu.matrix, deriv_uu.num_rows, deriv_uu.num_cols);\n\tMap<MatrixXd> dKui(deriv_tru.matrix, deriv_tru.num_rows, deriv_tru.num_cols);\n\n\t\/\/ compute derivatives wrt scale for each kernel matrix\n\tSGVector<float64_t> result(1);\n\n\tresult[0]=get_derivative_related_cov(deriv_trtr, deriv_uu, deriv_tru);\n\tresult[0]*=CMath::exp(m_log_scale*2.0)*2.0;\n\treturn result;\n}\n\nSGVector<float64_t> CSingleSparseInferenceBase::get_derivative_wrt_kernel(\n\tconst TParameter* param)\n{\n\tREQUIRE(param, \"Param not set\\n\");\n\tSGVector<float64_t> result;\n\tint64_t len=const_cast<TParameter *>(param)->m_datatype.get_num_elements();\n\tresult=SGVector<float64_t>(len);\n\n\tCFeatures *inducing_features=get_inducing_features();\n\tfor (index_t i=0; i<result.vlen; i++)\n\t{\n\t\tSGVector<float64_t> deriv_trtr;\n\t\tSGMatrix<float64_t> deriv_uu;\n\t\tSGMatrix<float64_t> deriv_tru;\n\n\t\tm_lock->lock();\n\t\tm_kernel->init(m_features, m_features);\n\t\t\/\/to reduce the time complexity\n\t\t\/\/the kernel object only computes diagonal elements of gradients wrt hyper-parameter\n\t\tderiv_trtr=m_kernel->get_parameter_gradient_diagonal(param, i);\n\n\t\tm_kernel->init(inducing_features, inducing_features);\n\t\tderiv_uu=m_kernel->get_parameter_gradient(param, i);\n\n\t\tm_kernel->init(inducing_features, m_features);\n\t\tderiv_tru=m_kernel->get_parameter_gradient(param, i);\n\t\tm_lock->unlock();\n\n\t\t\/\/ create eigen representation of derivatives\n\t\tMap<VectorXd> ddiagKi(deriv_trtr.vector, deriv_trtr.vlen);\n\t\tMap<MatrixXd> dKuui(deriv_uu.matrix, deriv_uu.num_rows,\n\t\t\t\tderiv_uu.num_cols);\n\t\tMap<MatrixXd> dKui(deriv_tru.matrix, deriv_tru.num_rows,\n\t\t\t\tderiv_tru.num_cols);\n\n\t\tresult[i]=get_derivative_related_cov(deriv_trtr, deriv_uu, deriv_tru);\n\t\tresult[i]*=CMath::exp(m_log_scale*2.0);\n\t}\n\tSG_UNREF(inducing_features);\n\treturn result;\n}\n\nvoid CSingleSparseInferenceBase::check_bound(SGVector<float64_t> bound, const char* name)\n{\n\tif (bound.vlen>1)\n\t{\n\t\tREQUIRE(m_inducing_features.num_rows>0, \"Inducing features must set before this method is called\\n\");\n\t\tREQUIRE(m_inducing_features.num_rows*m_inducing_features.num_cols==bound.vlen,\n\t\t\t\"The length of inducing features (%dx%d)\",\n\t\t\t\" and the length of bound constraints (%d) are different\\n\", \n\t\t\tm_inducing_features.num_rows,m_inducing_features.num_cols,bound.vlen);\n\t}\n\telse if(bound.vlen==1)\n\t{\n\t\tSG_WARNING(\"All inducing_features (%dx%d) are constrainted by the single value (%f) in the %s bound\\n\",\n\t\t\tm_inducing_features.num_rows,m_inducing_features.num_cols,bound[0],name);\n\t}\n}\n\nvoid CSingleSparseInferenceBase::set_lower_bound_of_inducing_features(SGVector<float64_t> bound)\n{\n\tcheck_bound(bound,\"lower\");\n\tm_lower_bound=bound;\n}\nvoid CSingleSparseInferenceBase::set_upper_bound_of_inducing_features(SGVector<float64_t> bound)\n{\n\tcheck_bound(bound, \"upper\");\n\tm_upper_bound=bound;\n}\n\nvoid CSingleSparseInferenceBase::set_max_iterations_for_inducing_features(int32_t it)\n{\n\tREQUIRE(it>0, \"Iteration (%d) must be positive\\n\",it);\n\tm_max_ind_iterations=it;\n}\nvoid CSingleSparseInferenceBase::set_tolearance_for_inducing_features(float64_t tol)\n{\n\n\tREQUIRE(tol>0, \"Tolearance (%f) must be positive\\n\",tol);\n\tm_ind_tolerance=tol;\n}\ndouble CSingleSparseInferenceBase::nlopt_function(unsigned n, const double* x, double* grad, void* func_data)\n{\n\tCSingleSparseInferenceBase* object=static_cast<CSingleSparseInferenceBase *>(func_data);\n\tREQUIRE(object,\"func_data must be SingleSparseInferenceBase pointer\\n\");\n\n\tdouble nlz=object->get_negative_log_marginal_likelihood();\n\tobject->compute_gradient();\n\n\tTParameter* param=object->m_gradient_parameters->get_parameter(\"inducing_features\");\n\tSGVector<float64_t> derivatives=object->get_derivative_wrt_inducing_features(param);\n\n\tstd::copy(derivatives.vector,derivatives.vector+n,grad);\n\n\treturn nlz;\n}\n\nvoid CSingleSparseInferenceBase::enable_optimizing_inducing_features(bool is_optmization)\n{\n\tm_opt_inducing_features=is_optmization;\n#ifdef USE_GPL_SHOGUN\n#ifdef HAVE_NLOPT\n\tif (m_opt_inducing_features)\n\t{\n\t\tcheck_fully_sparse();\n\t\tREQUIRE(m_fully_sparse,\"Please use a kernel which has the functionality about optimizing inducing features\\n\");\n\t}\n#else\n\tSG_WARNING(\"For this functionality we require NLOPT library\\n\");\n#endif \/\/HAVE_NLOPT\n#else \n\tSG_WARNING(\"For this functionality we require NLOPT (GPL License) library\\n\");\n#endif \/\/USE_GPL_SHOGUN\n\n}\n\nvoid CSingleSparseInferenceBase::optimize_inducing_features()\n{\n#ifdef USE_GPL_SHOGUN\n#ifdef HAVE_NLOPT\n\tif (!m_opt_inducing_features)\n\t\treturn;\n\n\tCSingleSparseInferenceCostFunction *cost_fun=new CSingleSparseInferenceCostFunction();\n\tSG_REF(this);\n\tcost_fun->set_target(this);\n    \n\tNLOPTMinimizer* opt=new NLOPTMinimizer(cost_fun);\n\topt->set_nlopt_parameters(NLOPT_LD_LBFGS, m_max_ind_iterations, m_ind_tolerance, m_ind_tolerance);\n\topt->minimize();\n\n\tdelete cost_fun;\n\tdelete opt;\n#endif \/\/HAVE_NLOPT\n#endif \/\/USE_GPL_SHOGUN\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"BoundaryConditions.h\"\n\n\/\/ to avoid compiler confusion, python.hpp must be include before Halide headers\n#include <boost\/python.hpp>\n\n#include \"..\/..\/src\/BoundaryConditions.h\"\n\n#include <string>\n\n\nvoid defineBoundaryConditions()\n{\n\n    return;\n}\n\n<commit_msg>Implemented BoundaryConditions<commit_after>#include \"BoundaryConditions.h\"\n\n\/\/ to avoid compiler confusion, python.hpp must be include before Halide headers\n#include <boost\/python.hpp>\n\n#include \"..\/..\/src\/Lambda.h\" \/\/ needed by BoundaryConditions.h\n#include \"..\/..\/src\/BoundaryConditions.h\"\n#include \"..\/..\/src\/Func.h\"\n\n#include <string>\n\nnamespace h = Halide;\nnamespace hb = Halide::BoundaryConditions;\nnamespace p = boost::python;\n\nnamespace {\n\ntemplate<typename T>\nh::Func constant_exterior0(T func_like, h::Expr value)\n{\n    return hb::constant_exterior(func_like, value);\n}\n\n\/\/ C++ fun, variadic template recursive function !\ntemplate<typename T=void, typename ...Types>\nvoid def_constant_exterior_for_image()\n{\n    p::def(\"constant_exterior\", &constant_exterior0<h::Image<T>>, p::args(\"source\", \"value\"));\n    def_constant_exterior_for_image<Types...>(); \/\/ recursive call\n    return;\n}\n\ntemplate<>\nvoid def_constant_exterior_for_image<void>()\n{ \/\/ end of recursion\n    return;\n}\n\n} \/\/ end of anonymous namespace\n\nnamespace {\n\n\ntemplate<typename T>\nh::Func repeat_edge0(T func_like)\n{\n    return hb::repeat_edge(func_like);\n}\n\n\/\/ C++ fun, variadic template recursive function !\ntemplate<typename T=void, typename ...Types>\nvoid def_repeat_edge_for_image()\n{\n    p::def(\"repeat_edge\", &repeat_edge0<h::Image<T>>, p::args(\"source\"));\n    def_repeat_edge_for_image<Types...>(); \/\/ recursive call\n    return;\n}\n\ntemplate<>\nvoid def_repeat_edge_for_image<void>()\n{ \/\/ end of recursion\n    return;\n}\n\n} \/\/ end of anonymous namespace\n\nnamespace {\n\ntemplate<typename T>\nh::Func repeat_image0(T func_like)\n{\n    return hb::repeat_image(func_like);\n}\n\n\/\/ C++ fun, variadic template recursive function !\ntemplate<typename T=void, typename ...Types>\nvoid def_repeat_image_for_image()\n{\n    p::def(\"repeat_image\", &repeat_image0<h::Image<T>>, p::args(\"source\"));\n    def_repeat_image_for_image<Types...>(); \/\/ recursive call\n    return;\n}\n\ntemplate<>\nvoid def_repeat_image_for_image<void>()\n{ \/\/ end of recursion\n    return;\n}\n\n} \/\/ end of anonymous namespace\n\nnamespace {\n\n\ntemplate<typename T>\nh::Func mirror_image0(T func_like)\n{\n    return hb::mirror_image(func_like);\n}\n\n\/\/ C++ fun, variadic template recursive function !\ntemplate<typename T=void, typename ...Types>\nvoid def_mirror_image_for_image()\n{\n    p::def(\"mirror_image\", &mirror_image0<h::Image<T>>, p::args(\"source\"));\n    def_mirror_image_for_image<Types...>(); \/\/ recursive call\n    return;\n}\n\ntemplate<>\nvoid def_mirror_image_for_image<void>()\n{ \/\/ end of recursion\n    return;\n}\n\n} \/\/ end of anonymous namespace\n\nnamespace {\n\ntemplate<typename T>\nh::Func mirror_interior0(T func_like)\n{\n    return hb::mirror_interior(func_like);\n}\n\n\/\/ C++ fun, variadic template recursive function !\ntemplate<typename T=void, typename ...Types>\nvoid def_mirror_interior_for_image()\n{\n    p::def(\"mirror_interior\", &mirror_interior0<h::Image<T>>, p::args(\"source\"));\n    def_mirror_interior_for_image<Types...>(); \/\/ recursive call\n    return;\n}\n\ntemplate<>\nvoid def_mirror_interior_for_image<void>()\n{ \/\/ end of recursion\n    return;\n}\n\n} \/\/ end of anonymous namespace\n\nvoid defineBoundaryConditions()\n{\n    using p::self;\n\n    \/\/ Other variants of constant_exterior exist, but not yet implemented\n\n    p::def(\"constant_exterior\", &constant_exterior0<h::ImageParam>, p::args(\"source\", \"value\"),\n           \"Impose a boundary condition such that a given expression is returned \"\n           \"everywhere outside the boundary. Generally the expression will be a \"\n           \"constant, though the code currently allows accessing the arguments  \"\n           \"of source.\\n\\n\"\n           \"An ImageParam, Image<T>, or similar can be passed instead of a Func. If this  \"\n           \"is done and no bounds are given, the boundaries will be taken from the  \"\n           \"min and extent methods of the passed object.\\n\\n\"\n           \"(This is similar to setting GL_TEXTURE_WRAP_* to GL_CLAMP_TO_BORDER  \"\n           \" and putting value in the border of the texture.) \");\n\n    def_constant_exterior_for_image<\n            boost::uint8_t, boost::uint16_t, boost::uint32_t,\n            boost::int8_t, boost::int16_t, boost::int32_t,\n            float, double >();\n\n    \/\/ The following variant is not yet implemented\n    \/\/    EXPORT Func constant_exterior(const Func &source, Expr value,\n    \/\/                                  const std::vector<std::pair<Expr, Expr>> &bounds);\n\n\n    p::def(\"repeat_edge\", &repeat_edge0<h::ImageParam>, p::args(\"source\"),\n           \"Impose a boundary condition such that the nearest edge sample is returned \"\n           \"everywhere outside the given region.\\n\\n\"\n           \"An ImageParam, Image<T>, or similar can be passed instead of a Func. If this \"\n           \"is done and no bounds are given, the boundaries will be taken from the \"\n           \"min and extent methods of the passed object.\\n\\n\"\n           \"(This is similar to setting GL_TEXTURE_WRAP_* to GL_CLAMP_TO_EDGE.)\");\n\n    def_repeat_edge_for_image<\n            boost::uint8_t, boost::uint16_t, boost::uint32_t,\n            boost::int8_t, boost::int16_t, boost::int32_t,\n            float, double >();\n\n    \/\/ The following variant is not yet implemented\n    \/\/    EXPORT Func repeat_edge(const Func &source,\n    \/\/                            const std::vector<std::pair<Expr, Expr>> &bounds);\n\n\n\n    p::def(\"repeat_image\", &repeat_image0<h::ImageParam>, p::args(\"source\"),\n           \"Impose a boundary condition such that the entire coordinate space is \"\n           \"tiled with copies of the image abutted against each other.\\n\\n\"\n           \"An ImageParam, Image<T>, or similar can be passed instead of a Func. If this \"\n           \"is done and no bounds are given, the boundaries will be taken from the \"\n           \"min and extent methods of the passed object.\\n\\n\"\n           \"(This is similar to setting GL_TEXTURE_WRAP_* to GL_REPEAT.)\");\n\n    def_repeat_image_for_image<\n            boost::uint8_t, boost::uint16_t, boost::uint32_t,\n            boost::int8_t, boost::int16_t, boost::int32_t,\n            float, double >();\n\n    \/\/The following variant is not yet implemented\n    \/\/        EXPORT Func repeat_image(const Func &source,\n    \/\/                                 const std::vector<std::pair<Expr, Expr>> &bounds);\n\n\n    p::def(\"mirror_image\", &mirror_image0<h::ImageParam>, p::args(\"source\"),\n           \"Impose a boundary condition such that the entire coordinate space is \"\n           \"tiled with copies of the image abutted against each other, but mirror \"\n           \"them such that adjacent edges are the same.\\n\\n\"\n           \"An ImageParam, Image<T>, or similar can be passed instead of a Func. If this \"\n           \"is done and no bounds are given, the boundaries will be taken from the \"\n           \"min and extent methods of the passed object.\\n\\n\"\n           \"(This is similar to setting GL_TEXTURE_WRAP_* to GL_MIRRORED_REPEAT.)\");\n\n    def_mirror_image_for_image<\n            boost::uint8_t, boost::uint16_t, boost::uint32_t,\n            boost::int8_t, boost::int16_t, boost::int32_t,\n            float, double >();\n\n    \/\/ The following variant is not yet implemented\n    \/\/        EXPORT Func mirror_image(const Func &source,\n    \/\/                                 const std::vector<std::pair<Expr, Expr>> &bounds);\n\n\n    p::def(\"mirror_interior\", &mirror_interior0<h::ImageParam>, p::args(\"source\"),\n           \"Impose a boundary condition such that the entire coordinate space is \"\n           \"tiled with copies of the image abutted against each other, but mirror \"\n           \"them such that adjacent edges are the same and then overlap the edges.\\n\\n\"\n           \"This produces an error if any extent is 1 or less. (TODO: check this.)\\n\\n\"\n           \"An ImageParam, Image<T>, or similar can be passed instead of a Func. If this \"\n           \"is done and no bounds are given, the boundaries will be taken from the \"\n           \"min and extent methods of the passed object. \"\n           \"(I do not believe there is a direct GL_TEXTURE_WRAP_* equivalent for this.)\");\n\n    def_mirror_interior_for_image<\n            boost::uint8_t, boost::uint16_t, boost::uint32_t,\n            boost::int8_t, boost::int16_t, boost::int32_t,\n            float, double >();\n\n    \/\/ The following variant is not yet implemented\n    \/\/    EXPORT Func mirror_interior(const Func &source,\n    \/\/                                const std::vector<std::pair<Expr, Expr>> &bounds);\n\n    return;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/Copyright (c) 2015 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"PolygonTest.h\"\n\n\nnamespace cura\n{\n    CPPUNIT_TEST_SUITE_REGISTRATION(PolygonTest);\n\nvoid PolygonTest::setUp()\n{\n    test_square.emplace_back(0, 0);\n    test_square.emplace_back(100, 0);\n    test_square.emplace_back(100, 100);\n    test_square.emplace_back(0, 100);\n\n\n    pointy_square.emplace_back(0, 0);\n    pointy_square.emplace_back(47, 0);\n    pointy_square.emplace_back(50, 80);\n    pointy_square.emplace_back(53, 0);\n    pointy_square.emplace_back(100, 0);\n    pointy_square.emplace_back(100, 100);\n    pointy_square.emplace_back(55, 100);\n    pointy_square.emplace_back(50, 180);\n    pointy_square.emplace_back(45, 100);\n    pointy_square.emplace_back(0, 100);\n\n    triangle.emplace_back(100, 0);\n    triangle.emplace_back(300, 0);\n    triangle.emplace_back(200, 100);\n}\n\nvoid PolygonTest::tearDown()\n{\n    \/\/Do nothing.\n}\n\n\nvoid PolygonTest::polygonOffsetTest()\n{\n    Polygons test_squares;\n    test_squares.add(test_square);\n    Polygons expanded = test_squares.offset(25);\n    int64_t expanded_length = expanded.polygonLength();\n\n    Polygons square_hole;\n    PolygonRef square_inverted = square_hole.newPoly();\n    for (int i = test_square.size() - 1; i >= 0; i--)\n    {\n        square_inverted.add(test_square[i]);\n    }\n    Polygons contracted = square_hole.offset(25);\n    int64_t contracted_length = contracted.polygonLength();\n\n    CPPUNIT_ASSERT_MESSAGE(\"Offset on outside poly is different from offset on inverted poly!\", std::abs(expanded_length - contracted_length) < 5);\n}\n\nvoid PolygonTest::isOutsideTest()\n{\n    Polygons test_triangle;\n    test_triangle.add(triangle);\n    \n    CPPUNIT_ASSERT_MESSAGE(\"Point is calculated as inside while it's outside!\", !test_triangle.inside(Point(0, 100)));\n}\n\n\n\n\n}<commit_msg>Remove whitespace at end of line<commit_after>\/\/Copyright (c) 2015 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"PolygonTest.h\"\n\n\nnamespace cura\n{\n    CPPUNIT_TEST_SUITE_REGISTRATION(PolygonTest);\n\nvoid PolygonTest::setUp()\n{\n    test_square.emplace_back(0, 0);\n    test_square.emplace_back(100, 0);\n    test_square.emplace_back(100, 100);\n    test_square.emplace_back(0, 100);\n\n\n    pointy_square.emplace_back(0, 0);\n    pointy_square.emplace_back(47, 0);\n    pointy_square.emplace_back(50, 80);\n    pointy_square.emplace_back(53, 0);\n    pointy_square.emplace_back(100, 0);\n    pointy_square.emplace_back(100, 100);\n    pointy_square.emplace_back(55, 100);\n    pointy_square.emplace_back(50, 180);\n    pointy_square.emplace_back(45, 100);\n    pointy_square.emplace_back(0, 100);\n\n    triangle.emplace_back(100, 0);\n    triangle.emplace_back(300, 0);\n    triangle.emplace_back(200, 100);\n}\n\nvoid PolygonTest::tearDown()\n{\n    \/\/Do nothing.\n}\n\n\nvoid PolygonTest::polygonOffsetTest()\n{\n    Polygons test_squares;\n    test_squares.add(test_square);\n    Polygons expanded = test_squares.offset(25);\n    int64_t expanded_length = expanded.polygonLength();\n\n    Polygons square_hole;\n    PolygonRef square_inverted = square_hole.newPoly();\n    for (int i = test_square.size() - 1; i >= 0; i--)\n    {\n        square_inverted.add(test_square[i]);\n    }\n    Polygons contracted = square_hole.offset(25);\n    int64_t contracted_length = contracted.polygonLength();\n\n    CPPUNIT_ASSERT_MESSAGE(\"Offset on outside poly is different from offset on inverted poly!\", std::abs(expanded_length - contracted_length) < 5);\n}\n\nvoid PolygonTest::isOutsideTest()\n{\n    Polygons test_triangle;\n    test_triangle.add(triangle);\n\n    CPPUNIT_ASSERT_MESSAGE(\"Point is calculated as inside while it's outside!\", !test_triangle.inside(Point(0, 100)));\n}\n\n\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 JPetCommonToolsTest.cpp\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE JPetCommonToolsTest\n#include <boost\/test\/unit_test.hpp>\n#include <map>\n#include \"JPetCommonTools.h\"\n\n\nBOOST_AUTO_TEST_SUITE(CommonToolsTestSuite)\n\nBOOST_AUTO_TEST_CASE(findSubstringTest)\n{\n  std::string str(\"There are two needles in this haystack with needles.\");\n  std::string str2(\"needle\");\n\n  std::size_t found = JPetCommonTools::findSubstring(str, str2);\n  BOOST_REQUIRE_EQUAL(found != std::string::npos, true);\n}\n\nBOOST_AUTO_TEST_CASE(ItoaTest)\n{\n  int testNumber = 64;\n\n  std::string intAsASting = JPetCommonTools::Itoa(testNumber);\n  BOOST_REQUIRE_EQUAL(intAsASting == \"64\", true);\n}\n\nBOOST_AUTO_TEST_CASE(intToStringTest)\n{\n  int testNumber = 64;\n\n  std::string intAsASting = JPetCommonTools::intToString(testNumber);\n  BOOST_REQUIRE_EQUAL(intAsASting == \"64\", true);\n}\n\nBOOST_AUTO_TEST_CASE(doubleToStringTest)\n{\n  double testNumber = 256.3264;\n\n  std::string doubleAsASting = JPetCommonTools::doubleToString(testNumber);\n  BOOST_REQUIRE_EQUAL(doubleAsASting == \"256.326\", true);\n}\n\nBOOST_AUTO_TEST_CASE(stringToIntTest)\n{\n  std::string testString = \"1024\";\n\n  int stringAsAInt = JPetCommonTools::stringToInt(testString);\n  BOOST_REQUIRE_EQUAL(stringAsAInt == 1024, true);\n}\n\nBOOST_AUTO_TEST_CASE(toBoolTest)\n{\n  std::string testString = \"0\";\n\n  bool stringAsABool = JPetCommonTools::to_bool(testString);\n  BOOST_REQUIRE_EQUAL(stringAsABool == false, true);\n}\n\nBOOST_AUTO_TEST_CASE(ifFileExistingTest)\n{\n  std::string fileTest = \"run_tests.pl\";\n\n  bool ifFileExisting = JPetCommonTools::ifFileExisting(fileTest);\n  BOOST_REQUIRE_EQUAL(ifFileExisting, true);\n}\n\nBOOST_AUTO_TEST_CASE(mapAreEqualTest)\n{\n  std::map<int, int> mapTestLeft, mapTestRight;\n  bool areMapsEqual = JPetCommonTools::mapComparator(mapTestLeft, mapTestRight);\n  BOOST_REQUIRE_EQUAL(areMapsEqual, true);\n}\n\nBOOST_AUTO_TEST_CASE(mapAreNotEqualTest)\n{\n  std::map<char, int> first;\n  first['a'] = 10;\n  first['b'] = 30;\n  first['c'] = 50;\n  first['d'] = 70;\n  std::map<char, int> second;\n\n  bool areMapsEqual = JPetCommonTools::mapComparator(first, second);\n  BOOST_REQUIRE_EQUAL(areMapsEqual, false);\n}\n\nBOOST_AUTO_TEST_CASE(stripFileNameSuffixTest)\n{\n  std::string fileTest = \"run_tests.pl\";\n\n  std::string stripFileNameSuffix = JPetCommonTools::stripFileNameSuffix(fileTest);\n  BOOST_REQUIRE_EQUAL(stripFileNameSuffix == \"run_tests\", true);\n}\n\nBOOST_AUTO_TEST_CASE(extractFileNameSuffixTest)\n{\n  std::string fileTest = \"run_tests.pl\";\n\n  std::string stripFileNameSuffix = JPetCommonTools::stripFileNameSuffix(fileTest);\n  BOOST_REQUIRE_EQUAL(stripFileNameSuffix == \".pl\", true);\n}\n\nBOOST_AUTO_TEST_CASE(currentFullPathTest)\n{\n  std::string currentFullPathTest = boost::filesystem::path(boost::filesystem::current_path()).string();\n\n  std::string currentFullPath = JPetCommonTools::currentFullPath();\n  BOOST_REQUIRE_EQUAL(currentFullPath == currentFullPathTest, true);\n}\n\nBOOST_AUTO_TEST_CASE(extractPathFromFileTest)\n{\n  std::string currentFullPathTest = boost::filesystem::path(boost::filesystem::current_path()).string();\n  std::string currentFullPathTestWithFileName = currentFullPathTest + \"\/\" + \"run_tests.pl\";\n\n  std::string result = JPetCommonTools::extractPathFromFile(currentFullPathTestWithFileName);\n  BOOST_REQUIRE_EQUAL(result.compare(currentFullPathTest), 0);\n}\n\nBOOST_AUTO_TEST_CASE(isDirectory)\n{\n  BOOST_REQUIRE(JPetCommonTools::isDirectory(boost::filesystem::initial_path().string()));\n  BOOST_REQUIRE(!JPetCommonTools::isDirectory(\"fake\/directory\/baba\"));\n}\n\nBOOST_AUTO_TEST_CASE(appendSlashToPathIfAbsent)\n{\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"\"), \"\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\".\/\"), \".\/\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"\/home\/\"), \"\/home\/\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"\/home\"), \"\/home\/\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"home\/bbl\/be\"), \"home\/bbl\/be\/\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"test\"), \"test\/\");\n}\n\n\nBOOST_AUTO_TEST_SUITE_END()\n\n<commit_msg>Changed one line in suffixStrip function in CommonTools<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 JPetCommonToolsTest.cpp\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE JPetCommonToolsTest\n#include <boost\/test\/unit_test.hpp>\n#include <map>\n#include \"JPetCommonTools.h\"\n\n\nBOOST_AUTO_TEST_SUITE(CommonToolsTestSuite)\n\nBOOST_AUTO_TEST_CASE(findSubstringTest)\n{\n  std::string str(\"There are two needles in this haystack with needles.\");\n  std::string str2(\"needle\");\n\n  std::size_t found = JPetCommonTools::findSubstring(str, str2);\n  BOOST_REQUIRE_EQUAL(found != std::string::npos, true);\n}\n\nBOOST_AUTO_TEST_CASE(ItoaTest)\n{\n  int testNumber = 64;\n\n  std::string intAsASting = JPetCommonTools::Itoa(testNumber);\n  BOOST_REQUIRE_EQUAL(intAsASting == \"64\", true);\n}\n\nBOOST_AUTO_TEST_CASE(intToStringTest)\n{\n  int testNumber = 64;\n\n  std::string intAsASting = JPetCommonTools::intToString(testNumber);\n  BOOST_REQUIRE_EQUAL(intAsASting == \"64\", true);\n}\n\nBOOST_AUTO_TEST_CASE(doubleToStringTest)\n{\n  double testNumber = 256.3264;\n\n  std::string doubleAsASting = JPetCommonTools::doubleToString(testNumber);\n  BOOST_REQUIRE_EQUAL(doubleAsASting == \"256.326\", true);\n}\n\nBOOST_AUTO_TEST_CASE(stringToIntTest)\n{\n  std::string testString = \"1024\";\n\n  int stringAsAInt = JPetCommonTools::stringToInt(testString);\n  BOOST_REQUIRE_EQUAL(stringAsAInt == 1024, true);\n}\n\nBOOST_AUTO_TEST_CASE(toBoolTest)\n{\n  std::string testString = \"0\";\n\n  bool stringAsABool = JPetCommonTools::to_bool(testString);\n  BOOST_REQUIRE_EQUAL(stringAsABool == false, true);\n}\n\nBOOST_AUTO_TEST_CASE(ifFileExistingTest)\n{\n  std::string fileTest = \"run_tests.pl\";\n\n  bool ifFileExisting = JPetCommonTools::ifFileExisting(fileTest);\n  BOOST_REQUIRE_EQUAL(ifFileExisting, true);\n}\n\nBOOST_AUTO_TEST_CASE(mapAreEqualTest)\n{\n  std::map<int, int> mapTestLeft, mapTestRight;\n  bool areMapsEqual = JPetCommonTools::mapComparator(mapTestLeft, mapTestRight);\n  BOOST_REQUIRE_EQUAL(areMapsEqual, true);\n}\n\nBOOST_AUTO_TEST_CASE(mapAreNotEqualTest)\n{\n  std::map<char, int> first;\n  first['a'] = 10;\n  first['b'] = 30;\n  first['c'] = 50;\n  first['d'] = 70;\n  std::map<char, int> second;\n\n  bool areMapsEqual = JPetCommonTools::mapComparator(first, second);\n  BOOST_REQUIRE_EQUAL(areMapsEqual, false);\n}\n\nBOOST_AUTO_TEST_CASE(stripFileNameSuffixTest)\n{\n  std::string fileTest = \"run_tests.pl\";\n\n  std::string stripFileNameSuffix = JPetCommonTools::stripFileNameSuffix(fileTest);\n  BOOST_REQUIRE_EQUAL(stripFileNameSuffix == \"run_tests\", true);\n}\n\nBOOST_AUTO_TEST_CASE(extractFileNameSuffixTest)\n{\n  std::string fileTest = \"run_tests.pl\";\n\n  std::string stripFileNameSuffix = JPetCommonTools::stripFileNameSuffix(fileTest);\n  BOOST_REQUIRE_EQUAL(stripFileNameSuffix, \".pl\");\n}\n\nBOOST_AUTO_TEST_CASE(currentFullPathTest)\n{\n  std::string currentFullPathTest = boost::filesystem::path(boost::filesystem::current_path()).string();\n\n  std::string currentFullPath = JPetCommonTools::currentFullPath();\n  BOOST_REQUIRE_EQUAL(currentFullPath == currentFullPathTest, true);\n}\n\nBOOST_AUTO_TEST_CASE(extractPathFromFileTest)\n{\n  std::string currentFullPathTest = boost::filesystem::path(boost::filesystem::current_path()).string();\n  std::string currentFullPathTestWithFileName = currentFullPathTest + \"\/\" + \"run_tests.pl\";\n\n  std::string result = JPetCommonTools::extractPathFromFile(currentFullPathTestWithFileName);\n  BOOST_REQUIRE_EQUAL(result.compare(currentFullPathTest), 0);\n}\n\nBOOST_AUTO_TEST_CASE(isDirectory)\n{\n  BOOST_REQUIRE(JPetCommonTools::isDirectory(boost::filesystem::initial_path().string()));\n  BOOST_REQUIRE(!JPetCommonTools::isDirectory(\"fake\/directory\/baba\"));\n}\n\nBOOST_AUTO_TEST_CASE(appendSlashToPathIfAbsent)\n{\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"\"), \"\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\".\/\"), \".\/\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"\/home\/\"), \"\/home\/\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"\/home\"), \"\/home\/\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"home\/bbl\/be\"), \"home\/bbl\/be\/\");\n  BOOST_REQUIRE_EQUAL(JPetCommonTools::appendSlashToPathIfAbsent(\"test\"), \"test\/\");\n}\n\n\nBOOST_AUTO_TEST_SUITE_END()\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id: linear_solver.C,v 1.4 2005-06-12 18:36:41 jwpeterson Exp $\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2005  Benjamin S. Kirk, John W. Peterson\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\/\/ C++ includes\n\n\/\/ Local Includes\n#include \"linear_solver.h\"\n#include \"laspack_linear_solver.h\"\n#include \"petsc_linear_solver.h\"\n\n\n\/\/------------------------------------------------------------------\n\/\/ LinearSolver members\ntemplate <typename T>\nAutoPtr<LinearSolver<T> >\nLinearSolver<T>::build(const SolverPackage solver_package)\n{\n  \/\/ Build the appropriate solver\n  switch (solver_package)\n    {\n\n\n#ifdef HAVE_LASPACK\n    case LASPACK_SOLVERS:\n      {\n\tAutoPtr<LinearSolver<T> > ap(new LaspackLinearSolver<T>);\n\treturn ap;\n      }\n#endif\n\n\n#ifdef HAVE_PETSC\n    case PETSC_SOLVERS:\n      {\n\tAutoPtr<LinearSolver<T> > ap(new PetscLinearSolver<T>);\n\treturn ap;\n      }\n#endif\n\n\n\n    default:\n      std::cerr << \"ERROR:  Unrecognized solver package: \"\n\t\t<< solver_package\n\t\t<< std::endl;\n      error();\n    }\n    \n  AutoPtr<LinearSolver<T> > ap(NULL);\n  return ap;    \n}\n\n\n\n\/\/------------------------------------------------------------------\n\/\/ Explicit instantiations\ntemplate class LinearSolver<Number>;\n\n\n\n<commit_msg>We use an AutoPtr outside of the #ifdefs, so we should include auto_ptr.h<commit_after>\/\/ $Id: linear_solver.C,v 1.5 2007-07-01 01:53:48 roystgnr Exp $\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2005  Benjamin S. Kirk, John W. Peterson\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\/\/ C++ includes\n\n\/\/ Local Includes\n#include \"auto_ptr.h\"\n#include \"linear_solver.h\"\n#include \"laspack_linear_solver.h\"\n#include \"petsc_linear_solver.h\"\n\n\n\/\/------------------------------------------------------------------\n\/\/ LinearSolver members\ntemplate <typename T>\nAutoPtr<LinearSolver<T> >\nLinearSolver<T>::build(const SolverPackage solver_package)\n{\n  \/\/ Build the appropriate solver\n  switch (solver_package)\n    {\n\n\n#ifdef HAVE_LASPACK\n    case LASPACK_SOLVERS:\n      {\n\tAutoPtr<LinearSolver<T> > ap(new LaspackLinearSolver<T>);\n\treturn ap;\n      }\n#endif\n\n\n#ifdef HAVE_PETSC\n    case PETSC_SOLVERS:\n      {\n\tAutoPtr<LinearSolver<T> > ap(new PetscLinearSolver<T>);\n\treturn ap;\n      }\n#endif\n\n\n\n    default:\n      std::cerr << \"ERROR:  Unrecognized solver package: \"\n\t\t<< solver_package\n\t\t<< std::endl;\n      error();\n    }\n    \n  AutoPtr<LinearSolver<T> > ap(NULL);\n  return ap;    \n}\n\n\n\n\/\/------------------------------------------------------------------\n\/\/ Explicit instantiations\ntemplate class LinearSolver<Number>;\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *  For conditions of distribution and use, see copyright notice in license.txt\n *\n *  @file   JavascriptInstance.cpp\n *  @brief  Javascript script instance used wit EC_Script.\n *\/\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n#include \"JavascriptInstance.h\"\n#include \"JavascriptModule.h\"\n#include \"ScriptMetaTypeDefines.h\"\n#include \"NaaliCoreTypeDefines.h\"\n#include \"EC_Script.h\"\n#include \"IModule.h\"\n#include \"AssetAPI.h\"\n#include \"IAssetProvider.h\" \/\/to check if the code was loaded from a local or remote storage\n\n#include \"LoggingFunctions.h\"\nDEFINE_POCO_LOGGING_FUNCTIONS(\"JavascriptInstance\")\n\n#include <QFile>\n\n#include \"MemoryLeakCheck.h\"\n\nJavascriptInstance::JavascriptInstance(const QString &fileName, JavascriptModule *module)\n:engine_(0),\nsourceFile(fileName),\nmodule_(module),\nevaluated(false)\n{\n    CreateEngine();\n    Load();\n}\n\n\nJavascriptInstance::JavascriptInstance(ScriptAssetPtr scriptRef, JavascriptModule *module)\n:engine_(0),\nscriptRef_(scriptRef),\nmodule_(module),\nevaluated(false)\n{\n    CreateEngine();\n    Load();\n}\n\nJavascriptInstance::~JavascriptInstance()\n{\n    DeleteEngine();\n}\n\nvoid JavascriptInstance::Load()\n{\n    if (!engine_)\n        CreateEngine();\n\n    \/\/ Can't specify both a file source and an Asset API source.\n    assert(sourceFile.isEmpty() || scriptRef_.get() == 0);\n\n    \/\/determine based on code origin whether it can be trusted with system access or not\n    if (scriptRef_.get()) \n    {\n        AssetProviderPtr provider = scriptRef_.get()->GetAssetProvider();\n        if (provider->Name() == \"Local\")\n            trusted_ = true;\n        else\n            trusted_ = false;\n    }\n    \n\n    if (sourceFile.length() > 0)\n    {\n        program_ = LoadScript(sourceFile);\n        trusted_ = true; \/\/this is a local file directly, right?\n    }\n\n    \/\/ Do we even have a script to execute?\n    if (program_.isEmpty() && (!scriptRef_.get() || scriptRef_->scriptContent.isEmpty()))\n    {\n        LogError(\"JavascriptInstance::Load: No script content to load!\");\n        return;\n    }\n\n    QString scriptSourceFilename = (scriptRef_.get() ? scriptRef_->Name() : sourceFile);\n    QString &scriptContent = (scriptRef_.get() ? scriptRef_->scriptContent : program_);\n\n    QScriptSyntaxCheckResult syntaxResult = engine_->checkSyntax(scriptContent);\n    if (syntaxResult.state() != QScriptSyntaxCheckResult::Valid)\n    {\n        LogError(\"Syntax error in script \" + scriptSourceFilename.toStdString() + \",\" + QString::number(syntaxResult.errorLineNumber()).toStdString() +\n            \": \" + syntaxResult.errorMessage().toStdString());\n\n        \/\/ Delete our loaded script content (if any exists).\n        program_ == \"\";\n    }\n}\n\nQString JavascriptInstance::LoadScript(const QString &fileName)\n{\n    QString filename = fileName.trimmed();\n\n    \/\/ First check if the include was supposed to go through the Asset API.\n    if (module_)\n    {\n        ScriptAssetPtr asset = boost::dynamic_pointer_cast<ScriptAsset>(module_->GetFramework()->Asset()->GetAsset(fileName));\n        if (asset)\n            return asset->scriptContent;\n    }\n\n    \/\/ Otherwise, treat fileName as a local file to load up.\n\n    QFile scriptFile(filename);\n    if (!scriptFile.open(QIODevice::ReadOnly))\n    {\n        LogError((\"JavascriptInstance::LoadScript: Failed to load script from file \" + filename + \"!\").toStdString());\n        return \"\";\n    }\n\n    QString result = scriptFile.readAll();\n    scriptFile.close();\n\n    QString trimmedResult = result.trimmed();\n    if (trimmedResult.isEmpty())\n    {\n        LogWarning((\"JavascriptInstance::LoadScript: Warning Loaded script from file \" + filename + \", but the content was empty.\").toStdString());\n        return \"\";\n    }\n    return result;\n}\n\nvoid JavascriptInstance::Unload()\n{\n    DeleteEngine();\n}\n\nvoid JavascriptInstance::Run()\n{\n    \/\/ Need to have either absolute file path source or an Asset API source.\n    if (!scriptRef_.get() && program_.isEmpty())\n    {\n        LogError(\"JavascriptInstance::Run: Cannot run, no script reference loaded.\");\n        return;\n    }\n\n    \/\/ Can't specify both a file source and an Asset API source.\n    assert(sourceFile.isEmpty() || scriptRef_.get() == 0);\n\n    \/\/ If we've already evaluated this script once before, create a new script engine to run it again, or otherwise\n    \/\/ the effects would stack (we'd possibly register into signals twice, or other odd side effects).\n    \/\/ We never allow a script to be run twice in this kind of \"stacking\" manner.\n    if (evaluated)\n    {\n        Unload();\n        Load();\n    }\n\n    if (!engine_)\n    {\n        LogError(\"JavascriptInstance::Run: Cannot run, script engine not loaded.\");\n        return;\n    }\n\n    \/\/ If no script specified at all, we'll have to abort.\n    if (!scriptRef_.get() && program_.isEmpty())\n        return;\n\n    QString scriptSourceFilename = (scriptRef_.get() ? scriptRef_->Name() : sourceFile);\n    QString &scriptContent = (scriptRef_.get() ? scriptRef_->scriptContent : program_);\n\n    included_files_.clear();\n    QScriptValue result = engine_->evaluate(scriptContent, scriptSourceFilename);\n    if (engine_->hasUncaughtException())\n        LogError(result.toString().toStdString());\n\n    evaluated = true;\n}\n\nvoid JavascriptInstance::RegisterService(QObject *serviceObject, const QString &name)\n{\n    if (!engine_)\n    {\n        LogError(\"JavascriptInstance::RegisterService: No Qt script engine created when trying to register service to js script instance.\");\n        return;\n    }\n    if (!serviceObject)\n    {\n        LogError(\"JavascriptInstance::RegisterService: Trying to pass a null service object pointer to RegisterService!\");\n        return;\n    }\n\n    QScriptValue scriptValue = engine_->newQObject(serviceObject);\n    engine_->globalObject().setProperty(name, scriptValue);\n}\n\nvoid JavascriptInstance::IncludeFile(const QString &path)\n{\n    for (uint i = 0; i < included_files_.size(); ++i)\n    {\n        if (included_files_[i].toLower() == path.toLower())\n        {\n            LogDebug(\"JavascriptInstance::IncludeFile: Not including already included file \" + path.toStdString());\n            return;\n        }\n    }\n    \n    QString script = LoadScript(path);\n\n    QScriptContext *context = engine_->currentContext();\n    assert(context);\n    if (!context)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: QScriptEngine::currentContext() returned null!\");\n        return;\n    }\n\n    QScriptContext *parent = context->parentContext();\n    if (!parent)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: QScriptEngine::parentContext() returned null!\");\n        return;\n    }\n\n    context->setActivationObject(context->parentContext()->activationObject());\n    context->setThisObject(context->parentContext()->thisObject());\n\n    QScriptSyntaxCheckResult syntaxResult = engine_->checkSyntax(script);\n    if(syntaxResult.state() != QScriptSyntaxCheckResult::Valid)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: Syntax error in \" + path.toStdString() + syntaxResult.errorMessage().toStdString()\n            + \" In line:\" + QString::number(syntaxResult.errorLineNumber()).toStdString());\n        return;\n    }\n\n    QScriptValue result = engine_->evaluate(script);\n\n    included_files_.push_back(path);\n    \n    if (engine_->hasUncaughtException())\n        LogError(result.toString().toStdString());\n}\n\nvoid JavascriptInstance::ImportExtension(const QString &scriptExtensionName)\n{\n    assert(engine_);\n    if (!engine_)\n    {\n        LogWarning((\"JavascriptInstance::ImportExtension(\" + scriptExtensionName + \") failed, QScriptEngine==null!\").toStdString());\n        return;\n    }\n\n    QStringList extension_blacklist;\n    extension_blacklist << \"qt.network\" << \"qt.webkit\"; \/\/webkit to not allow scripts to open hidden browsers to do malicious stuff.\n\n    QStringList qtcore_blacklist; \/\/the types in qt.core which are not safe\n    qtcore_blacklist << \"QDir\" << \"QFile\" << \"QFileSystemWatcher\" << \"QFileInfo\" << \"QLibrary\" << \"QPluginLoader\";\n\n    if (!trusted_ && extension_blacklist.contains(scriptExtensionName, Qt::CaseInsensitive))\n    {\n        LogWarning(\"JavascriptInstance::ImportExtension: refusing to load a QtScript plugin for an untrusted instance: \" + scriptExtensionName.toStdString());\n        return;\n    }\n\n    QScriptValue success = engine_->importExtension(scriptExtensionName);\n    if (!success.isUndefined()) \/\/ Yes, importExtension returns undefinedValue if the import succeeds. http:\/\/doc.qt.nokia.com\/4.7\/qscriptengine.html#importExtension\n        LogWarning(std::string(\"JavascriptInstance::ImportExtension: Failed to load \") + scriptExtensionName.toStdString() + \" plugin for QtScript!\");\n    \n    if (!trusted_)\n    {\n        QScriptValue exposed;\n        foreach (const QString &blacktype, qtcore_blacklist)\n        {\n            exposed = engine_->globalObject().property(blacktype);\n            if (exposed.isValid())\n            {\n                engine_->globalObject().setProperty(blacktype, QScriptValue::QScriptValue()); \/\/passing an invalid val removes the property, http:\/\/doc.qt.nokia.com\/4.6\/qscriptvalue.html#setProperty\n                \/\/LogInfo(\"JavascriptInstance::ImportExtension: removed a type from the untrusted context: \" + blacktype.toStdString());\n            }\n        }\n    }\n}\n\nvoid JavascriptInstance::CreateEngine()\n{\n    if (engine_)\n        DeleteEngine();\n    engine_ = new QScriptEngine;\n    connect(engine_, SIGNAL(signalHandlerException(const QScriptValue &)), SLOT(OnSignalHandlerException(const QScriptValue &)));\n\n    ExposeQtMetaTypes(engine_);\n    ExposeNaaliCoreTypes(engine_);\n    ExposeCoreApiMetaTypes(engine_);\n\n    EC_Script *ec = dynamic_cast<EC_Script *>(owner_.lock().get());\n    module_->PrepareScriptInstance(this, ec);\n    evaluated = false;\n}\n\nvoid JavascriptInstance::DeleteEngine()\n{\n    if (!engine_)\n        return;\n\n    program_ = \"\";\n    engine_->abortEvaluation();\n\n    \/\/ As a convention, we call a function 'OnScriptDestroyed' for each JS script\n    \/\/ so that they can clean up their data before the script is removed from the object,\n    \/\/ or when the system is unloading.\n    \n    QScriptValue destructor = engine_->globalObject().property(\"OnScriptDestroyed\");\n    if (!destructor.isUndefined())\n        destructor.call();\n    SAFE_DELETE(engine_);\n}\n\nvoid JavascriptInstance::OnSignalHandlerException(const QScriptValue& exception)\n{\n    LogError(exception.toString().toStdString());\n}\n\n<commit_msg>js sandbox: changed extension (dll\/so) blacklist to a whitelist<commit_after>\/**\n *  For conditions of distribution and use, see copyright notice in license.txt\n *\n *  @file   JavascriptInstance.cpp\n *  @brief  Javascript script instance used wit EC_Script.\n *\/\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n#include \"JavascriptInstance.h\"\n#include \"JavascriptModule.h\"\n#include \"ScriptMetaTypeDefines.h\"\n#include \"NaaliCoreTypeDefines.h\"\n#include \"EC_Script.h\"\n#include \"IModule.h\"\n#include \"AssetAPI.h\"\n#include \"IAssetProvider.h\" \/\/to check if the code was loaded from a local or remote storage\n\n#include \"LoggingFunctions.h\"\nDEFINE_POCO_LOGGING_FUNCTIONS(\"JavascriptInstance\")\n\n#include <QFile>\n\n#include \"MemoryLeakCheck.h\"\n\nJavascriptInstance::JavascriptInstance(const QString &fileName, JavascriptModule *module)\n:engine_(0),\nsourceFile(fileName),\nmodule_(module),\nevaluated(false)\n{\n    CreateEngine();\n    Load();\n}\n\n\nJavascriptInstance::JavascriptInstance(ScriptAssetPtr scriptRef, JavascriptModule *module)\n:engine_(0),\nscriptRef_(scriptRef),\nmodule_(module),\nevaluated(false)\n{\n    CreateEngine();\n    Load();\n}\n\nJavascriptInstance::~JavascriptInstance()\n{\n    DeleteEngine();\n}\n\nvoid JavascriptInstance::Load()\n{\n    if (!engine_)\n        CreateEngine();\n\n    \/\/ Can't specify both a file source and an Asset API source.\n    assert(sourceFile.isEmpty() || scriptRef_.get() == 0);\n\n    \/\/determine based on code origin whether it can be trusted with system access or not\n    if (scriptRef_.get()) \n    {\n        AssetProviderPtr provider = scriptRef_.get()->GetAssetProvider();\n        if (provider->Name() == \"Local\")\n            trusted_ = true;\n        else\n            trusted_ = false;\n    }\n    \n\n    if (sourceFile.length() > 0)\n    {\n        program_ = LoadScript(sourceFile);\n        trusted_ = true; \/\/this is a local file directly, right?\n    }\n\n    \/\/ Do we even have a script to execute?\n    if (program_.isEmpty() && (!scriptRef_.get() || scriptRef_->scriptContent.isEmpty()))\n    {\n        LogError(\"JavascriptInstance::Load: No script content to load!\");\n        return;\n    }\n\n    QString scriptSourceFilename = (scriptRef_.get() ? scriptRef_->Name() : sourceFile);\n    QString &scriptContent = (scriptRef_.get() ? scriptRef_->scriptContent : program_);\n\n    QScriptSyntaxCheckResult syntaxResult = engine_->checkSyntax(scriptContent);\n    if (syntaxResult.state() != QScriptSyntaxCheckResult::Valid)\n    {\n        LogError(\"Syntax error in script \" + scriptSourceFilename.toStdString() + \",\" + QString::number(syntaxResult.errorLineNumber()).toStdString() +\n            \": \" + syntaxResult.errorMessage().toStdString());\n\n        \/\/ Delete our loaded script content (if any exists).\n        program_ == \"\";\n    }\n}\n\nQString JavascriptInstance::LoadScript(const QString &fileName)\n{\n    QString filename = fileName.trimmed();\n\n    \/\/ First check if the include was supposed to go through the Asset API.\n    if (module_)\n    {\n        ScriptAssetPtr asset = boost::dynamic_pointer_cast<ScriptAsset>(module_->GetFramework()->Asset()->GetAsset(fileName));\n        if (asset)\n            return asset->scriptContent;\n    }\n\n    \/\/ Otherwise, treat fileName as a local file to load up.\n\n    QFile scriptFile(filename);\n    if (!scriptFile.open(QIODevice::ReadOnly))\n    {\n        LogError((\"JavascriptInstance::LoadScript: Failed to load script from file \" + filename + \"!\").toStdString());\n        return \"\";\n    }\n\n    QString result = scriptFile.readAll();\n    scriptFile.close();\n\n    QString trimmedResult = result.trimmed();\n    if (trimmedResult.isEmpty())\n    {\n        LogWarning((\"JavascriptInstance::LoadScript: Warning Loaded script from file \" + filename + \", but the content was empty.\").toStdString());\n        return \"\";\n    }\n    return result;\n}\n\nvoid JavascriptInstance::Unload()\n{\n    DeleteEngine();\n}\n\nvoid JavascriptInstance::Run()\n{\n    \/\/ Need to have either absolute file path source or an Asset API source.\n    if (!scriptRef_.get() && program_.isEmpty())\n    {\n        LogError(\"JavascriptInstance::Run: Cannot run, no script reference loaded.\");\n        return;\n    }\n\n    \/\/ Can't specify both a file source and an Asset API source.\n    assert(sourceFile.isEmpty() || scriptRef_.get() == 0);\n\n    \/\/ If we've already evaluated this script once before, create a new script engine to run it again, or otherwise\n    \/\/ the effects would stack (we'd possibly register into signals twice, or other odd side effects).\n    \/\/ We never allow a script to be run twice in this kind of \"stacking\" manner.\n    if (evaluated)\n    {\n        Unload();\n        Load();\n    }\n\n    if (!engine_)\n    {\n        LogError(\"JavascriptInstance::Run: Cannot run, script engine not loaded.\");\n        return;\n    }\n\n    \/\/ If no script specified at all, we'll have to abort.\n    if (!scriptRef_.get() && program_.isEmpty())\n        return;\n\n    QString scriptSourceFilename = (scriptRef_.get() ? scriptRef_->Name() : sourceFile);\n    QString &scriptContent = (scriptRef_.get() ? scriptRef_->scriptContent : program_);\n\n    included_files_.clear();\n    QScriptValue result = engine_->evaluate(scriptContent, scriptSourceFilename);\n    if (engine_->hasUncaughtException())\n        LogError(result.toString().toStdString());\n\n    evaluated = true;\n}\n\nvoid JavascriptInstance::RegisterService(QObject *serviceObject, const QString &name)\n{\n    if (!engine_)\n    {\n        LogError(\"JavascriptInstance::RegisterService: No Qt script engine created when trying to register service to js script instance.\");\n        return;\n    }\n    if (!serviceObject)\n    {\n        LogError(\"JavascriptInstance::RegisterService: Trying to pass a null service object pointer to RegisterService!\");\n        return;\n    }\n\n    QScriptValue scriptValue = engine_->newQObject(serviceObject);\n    engine_->globalObject().setProperty(name, scriptValue);\n}\n\nvoid JavascriptInstance::IncludeFile(const QString &path)\n{\n    for (uint i = 0; i < included_files_.size(); ++i)\n    {\n        if (included_files_[i].toLower() == path.toLower())\n        {\n            LogDebug(\"JavascriptInstance::IncludeFile: Not including already included file \" + path.toStdString());\n            return;\n        }\n    }\n    \n    QString script = LoadScript(path);\n\n    QScriptContext *context = engine_->currentContext();\n    assert(context);\n    if (!context)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: QScriptEngine::currentContext() returned null!\");\n        return;\n    }\n\n    QScriptContext *parent = context->parentContext();\n    if (!parent)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: QScriptEngine::parentContext() returned null!\");\n        return;\n    }\n\n    context->setActivationObject(context->parentContext()->activationObject());\n    context->setThisObject(context->parentContext()->thisObject());\n\n    QScriptSyntaxCheckResult syntaxResult = engine_->checkSyntax(script);\n    if(syntaxResult.state() != QScriptSyntaxCheckResult::Valid)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: Syntax error in \" + path.toStdString() + syntaxResult.errorMessage().toStdString()\n            + \" In line:\" + QString::number(syntaxResult.errorLineNumber()).toStdString());\n        return;\n    }\n\n    QScriptValue result = engine_->evaluate(script);\n\n    included_files_.push_back(path);\n    \n    if (engine_->hasUncaughtException())\n        LogError(result.toString().toStdString());\n}\n\nvoid JavascriptInstance::ImportExtension(const QString &scriptExtensionName)\n{\n    assert(engine_);\n    if (!engine_)\n    {\n        LogWarning((\"JavascriptInstance::ImportExtension(\" + scriptExtensionName + \") failed, QScriptEngine==null!\").toStdString());\n        return;\n    }\n\n    QStringList extension_whitelist; \/\/the search is system wide, so whitelist is best to not leak to 3rd party libs\n    extension_whitelist << \"qt.core\" << \"qt.gui\" << \"qt.xml\" << \"qt.xmlpatterns\" << \"qt.opengl\" << \"qt.phonon\"; \/\/webkit not allowed directly so scripts can't open hidden browsers to do malicious stuff. uitools to be investigated\n\n    QStringList qtcore_blacklist; \/\/the types in qt.core which are not safe. should probably be a whitelist too.\n    qtcore_blacklist << \"QDir\" << \"QFile\" << \"QFileSystemWatcher\" << \"QFileInfo\" << \"QLibrary\" << \"QPluginLoader\";\n\n    if (!trusted_ && !extension_whitelist.contains(scriptExtensionName, Qt::CaseInsensitive))\n    {\n        LogWarning(\"JavascriptInstance::ImportExtension: refusing to load a QtScript plugin for an untrusted instance: \" + scriptExtensionName.toStdString());\n        return;\n    }\n\n    QScriptValue success = engine_->importExtension(scriptExtensionName);\n    if (!success.isUndefined()) \/\/ Yes, importExtension returns undefinedValue if the import succeeds. http:\/\/doc.qt.nokia.com\/4.7\/qscriptengine.html#importExtension\n        LogWarning(std::string(\"JavascriptInstance::ImportExtension: Failed to load \") + scriptExtensionName.toStdString() + \" plugin for QtScript!\");\n    \n    if (!trusted_)\n    {\n        QScriptValue exposed;\n        foreach (const QString &blacktype, qtcore_blacklist)\n        {\n            exposed = engine_->globalObject().property(blacktype);\n            if (exposed.isValid())\n            {\n                engine_->globalObject().setProperty(blacktype, QScriptValue::QScriptValue()); \/\/passing an invalid val removes the property, http:\/\/doc.qt.nokia.com\/4.6\/qscriptvalue.html#setProperty\n                \/\/LogInfo(\"JavascriptInstance::ImportExtension: removed a type from the untrusted context: \" + blacktype.toStdString());\n            }\n        }\n    }\n}\n\nvoid JavascriptInstance::CreateEngine()\n{\n    if (engine_)\n        DeleteEngine();\n    engine_ = new QScriptEngine;\n    connect(engine_, SIGNAL(signalHandlerException(const QScriptValue &)), SLOT(OnSignalHandlerException(const QScriptValue &)));\n\n    ExposeQtMetaTypes(engine_);\n    ExposeNaaliCoreTypes(engine_);\n    ExposeCoreApiMetaTypes(engine_);\n\n    EC_Script *ec = dynamic_cast<EC_Script *>(owner_.lock().get());\n    module_->PrepareScriptInstance(this, ec);\n    evaluated = false;\n}\n\nvoid JavascriptInstance::DeleteEngine()\n{\n    if (!engine_)\n        return;\n\n    program_ = \"\";\n    engine_->abortEvaluation();\n\n    \/\/ As a convention, we call a function 'OnScriptDestroyed' for each JS script\n    \/\/ so that they can clean up their data before the script is removed from the object,\n    \/\/ or when the system is unloading.\n    \n    QScriptValue destructor = engine_->globalObject().property(\"OnScriptDestroyed\");\n    if (!destructor.isUndefined())\n        destructor.call();\n    SAFE_DELETE(engine_);\n}\n\nvoid JavascriptInstance::OnSignalHandlerException(const QScriptValue& exception)\n{\n    LogError(exception.toString().toStdString());\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ main.cpp (Oclgrind)\n\/\/ Copyright (c) 2013-2014, James Price and Simon McIntosh-Smith,\n\/\/ University of Bristol. All rights reserved.\n\/\/\n\/\/ This program is provided under a three-clause BSD license. For full\n\/\/ license terms please see the LICENSE file distributed with this\n\/\/ source code.\n\n#include <fstream>\n#include <string>\n\n#include \"spirsim\/Device.h\"\n#include \"spirsim\/Kernel.h\"\n#include \"spirsim\/Memory.h\"\n#include \"spirsim\/Program.h\"\n\nusing namespace spirsim;\nusing namespace std;\n\nstatic bool outputGlobalMemory = false;\nstatic const char *simfile = NULL;\n\nstatic size_t ndrange[3];\nstatic size_t wgsize[3];\nstatic Device *device = NULL;\nstatic Program *program = NULL;\nstatic Kernel *kernel = NULL;\n\nstatic bool init(istream& input);\nstatic bool parseArguments(int argc, char *argv[]);\nstatic void printUsage();\n\nint main(int argc, char *argv[])\n{\n  \/\/ Parse arguments\n  if (!parseArguments(argc, argv))\n  {\n    return 1;\n  }\n\n  \/\/ Attempt to open simulator file\n  ifstream input;\n  input.open(simfile);\n  if (input.fail())\n  {\n    cerr << \"Unable to open simulator file.\" << endl;\n    return 1;\n  }\n\n  \/\/ Initialise simulator\n  device = new Device();\n  bool ret = init(input);\n  input.close();\n  if (!ret)\n  {\n    return 1;\n  }\n\n  \/\/ Run kernel\n  size_t offset[3] = {0,0,0};\n  device->run(*kernel, 3, offset, ndrange, wgsize);\n  if (outputGlobalMemory)\n  {\n    cout << \"Global Memory:\" << endl;\n    device->getGlobalMemory()->dump();\n  }\n\n  delete device;\n  delete kernel;\n  delete program;\n}\n\nbool init(istream& input)\n{\n  string progFileName;\n  string kernelName;\n\n  \/\/ Read simulation parameters\n  input >> progFileName\n        >> kernelName\n        >> ndrange[0] >> ndrange[1] >> ndrange[2]\n        >> wgsize[0] >> wgsize[1] >> wgsize[2];\n\n  \/\/ Ensure work-group size exactly divides NDRange\n  if (ndrange[0] % wgsize[0] ||\n      ndrange[1] % wgsize[1] ||\n      ndrange[2] % wgsize[2])\n  {\n    cerr << \"Work group size must divide NDRange exactly.\" << endl;\n    return false;\n  }\n\n  \/\/ Open program file\n  ifstream progFile;\n  progFile.open(progFileName.c_str(), ios_base::in | ios_base::binary);\n  if (!progFile.good())\n  {\n    cerr << \"Unable to open \" << progFileName << endl;\n    return false;\n  }\n\n  \/\/ Check for LLVM bitcode magic numbers\n  char magic[2] = {0,0};\n  progFile.read(magic, 2);\n  if (magic[0] == 0x42 && magic[1] == 0x43)\n  {\n    \/\/ Load bitcode\n    progFile.close();\n    program = Program::createFromBitcodeFile(progFileName);\n    if (!program)\n    {\n      cerr << \"Failed to load bitcode from \" << progFileName << endl;\n      return false;\n    }\n  }\n  else\n  {\n    \/\/ Get size of file\n    progFile.seekg(0, ios_base::end);\n    size_t sz = progFile.tellg();\n    progFile.seekg(0, ios_base::beg);\n\n    \/\/ Load source\n    char *data = new char[sz + 1];\n    progFile.read(data, sz+1);\n    progFile.close();\n    data[sz] = '\\0';\n    program = new Program(data);\n    delete[] data;\n\n    \/\/ Build program\n    if (!program->build(\"\"))\n    {\n      cerr << \"Build failure:\" << endl << program->getBuildLog() << endl;\n      return false;\n    }\n  }\n\n  \/\/ Get kernel\n  kernel = program->createKernel(kernelName);\n  if (!kernel)\n  {\n    cerr << \"Failed to create kernel \" << kernelName << endl;\n    return false;\n  }\n\n  \/\/ Clear global memory\n  Memory *globalMemory = device->getGlobalMemory();\n  globalMemory->clear();\n\n  \/\/ Set kernel arguments\n  for (int idx = 0; idx < kernel->getNumArguments(); idx++)\n  {\n    char type;\n    size_t size;\n    size_t address;\n    int i;\n    int byte;\n    TypedValue value;\n\n    input >> type >> dec >> size;\n    if (input.fail())\n    {\n      cerr << \"Error reading kernel arguments.\" << endl;\n      return false;\n    }\n\n    switch (type)\n    {\n    case 'b':\n      \/\/ Allocate buffer\n      address = globalMemory->allocateBuffer(size);\n      if (!address)\n      {\n        cerr << \"Failed to allocate buffer\" << endl;\n        return false;\n      }\n\n      \/\/ Initialise buffer\n      for (i = 0; i < size; i++)\n      {\n        input >> hex >> byte;\n        globalMemory->store((unsigned char*)&byte, address + i);\n      }\n\n      \/\/ Set argument value\n      value.size = sizeof(size_t);\n      value.num = 1;\n      value.data = new unsigned char[value.size];\n      *((size_t*)value.data) = address;\n\n      break;\n    case 'l':\n      \/\/ Allocate local memory argument\n      value.size = size;\n      value.num = 1;\n      value.data = NULL;\n\n      break;\n    case 's':\n      \/\/ Create scalar argument\n      value.size = size;\n      value.num = 1;\n      value.data = new unsigned char[value.size];\n      for (i = 0; i < size; i++)\n      {\n        input >> hex >> byte;\n        value.data[i] = (unsigned char)byte;\n      }\n\n      break;\n    default:\n      cerr << \"Unrecognised argument type '\" << type << \"'\" << endl;\n      return false;\n    }\n\n    kernel->setArgument(idx, value);\n    if (value.data)\n    {\n      delete[] value.data;\n    }\n  }\n\n  \/\/ Make sure there is no more input\n  std::string next;\n  input >> next;\n  if (input.good() || !input.eof())\n  {\n    cerr << \"Unexpected token '\" << next << \"' (expected EOF)\" << endl;\n    return false;\n  }\n\n  return true;\n}\n\nstatic bool parseArguments(int argc, char *argv[])\n{\n  for (int i = 1; i < argc; i++)\n  {\n    if (argv[i][0] == '-')\n    {\n      char *opt = argv[i] + 1;\n      while (*opt != '\\0')\n      {\n        switch (*opt)\n        {\n        case 'g':\n          outputGlobalMemory = true;\n          break;\n        default:\n          cerr << \"Unrecognised option '\" << argv[i] << \"'\" << endl;\n          return false;\n        }\n        opt++;\n      }\n    }\n    else\n    {\n      if (simfile == NULL)\n      {\n        simfile = argv[i];\n      }\n      else\n      {\n        cerr << \"Unexpected positional argument '\" << argv[i] << \"'\" << endl;\n        return false;\n      }\n    }\n  }\n\n  if (simfile == NULL)\n  {\n    printUsage();\n    return false;\n  }\n\n  return true;\n}\n\nstatic void printUsage()\n{\n  cout << \"Usage: oclgrind-kernel [-g] simfile\" << endl;\n}\n<commit_msg>Added arguments to oclgrind-kernel to match oclgrind.<commit_after>\/\/ main.cpp (Oclgrind)\n\/\/ Copyright (c) 2013-2014, James Price and Simon McIntosh-Smith,\n\/\/ University of Bristol. All rights reserved.\n\/\/\n\/\/ This program is provided under a three-clause BSD license. For full\n\/\/ license terms please see the LICENSE file distributed with this\n\/\/ source code.\n\n#include <fstream>\n#include <string>\n\n#include \"spirsim\/Device.h\"\n#include \"spirsim\/Kernel.h\"\n#include \"spirsim\/Memory.h\"\n#include \"spirsim\/Program.h\"\n\nusing namespace spirsim;\nusing namespace std;\n\nstatic bool outputGlobalMemory = false;\nstatic const char *simfile = NULL;\n\nstatic size_t ndrange[3];\nstatic size_t wgsize[3];\nstatic Device *device = NULL;\nstatic Program *program = NULL;\nstatic Kernel *kernel = NULL;\n\nstatic bool init(istream& input);\nstatic bool parseArguments(int argc, char *argv[]);\nstatic void printUsage();\n\nint main(int argc, char *argv[])\n{\n  \/\/ Parse arguments\n  if (!parseArguments(argc, argv))\n  {\n    return 1;\n  }\n\n  \/\/ Attempt to open simulator file\n  ifstream input;\n  input.open(simfile);\n  if (input.fail())\n  {\n    cerr << \"Unable to open simulator file.\" << endl;\n    return 1;\n  }\n\n  \/\/ Initialise simulator\n  device = new Device();\n  bool ret = init(input);\n  input.close();\n  if (!ret)\n  {\n    return 1;\n  }\n\n  \/\/ Run kernel\n  size_t offset[3] = {0,0,0};\n  device->run(*kernel, 3, offset, ndrange, wgsize);\n  if (outputGlobalMemory)\n  {\n    cout << \"Global Memory:\" << endl;\n    device->getGlobalMemory()->dump();\n  }\n\n  delete device;\n  delete kernel;\n  delete program;\n}\n\nbool init(istream& input)\n{\n  string progFileName;\n  string kernelName;\n\n  \/\/ Read simulation parameters\n  input >> progFileName\n        >> kernelName\n        >> ndrange[0] >> ndrange[1] >> ndrange[2]\n        >> wgsize[0] >> wgsize[1] >> wgsize[2];\n\n  \/\/ Ensure work-group size exactly divides NDRange\n  if (ndrange[0] % wgsize[0] ||\n      ndrange[1] % wgsize[1] ||\n      ndrange[2] % wgsize[2])\n  {\n    cerr << \"Work group size must divide NDRange exactly.\" << endl;\n    return false;\n  }\n\n  \/\/ Open program file\n  ifstream progFile;\n  progFile.open(progFileName.c_str(), ios_base::in | ios_base::binary);\n  if (!progFile.good())\n  {\n    cerr << \"Unable to open \" << progFileName << endl;\n    return false;\n  }\n\n  \/\/ Check for LLVM bitcode magic numbers\n  char magic[2] = {0,0};\n  progFile.read(magic, 2);\n  if (magic[0] == 0x42 && magic[1] == 0x43)\n  {\n    \/\/ Load bitcode\n    progFile.close();\n    program = Program::createFromBitcodeFile(progFileName);\n    if (!program)\n    {\n      cerr << \"Failed to load bitcode from \" << progFileName << endl;\n      return false;\n    }\n  }\n  else\n  {\n    \/\/ Get size of file\n    progFile.seekg(0, ios_base::end);\n    size_t sz = progFile.tellg();\n    progFile.seekg(0, ios_base::beg);\n\n    \/\/ Load source\n    char *data = new char[sz + 1];\n    progFile.read(data, sz+1);\n    progFile.close();\n    data[sz] = '\\0';\n    program = new Program(data);\n    delete[] data;\n\n    \/\/ Build program\n    if (!program->build(\"\"))\n    {\n      cerr << \"Build failure:\" << endl << program->getBuildLog() << endl;\n      return false;\n    }\n  }\n\n  \/\/ Get kernel\n  kernel = program->createKernel(kernelName);\n  if (!kernel)\n  {\n    cerr << \"Failed to create kernel \" << kernelName << endl;\n    return false;\n  }\n\n  \/\/ Clear global memory\n  Memory *globalMemory = device->getGlobalMemory();\n  globalMemory->clear();\n\n  \/\/ Set kernel arguments\n  for (int idx = 0; idx < kernel->getNumArguments(); idx++)\n  {\n    char type;\n    size_t size;\n    size_t address;\n    int i;\n    int byte;\n    TypedValue value;\n\n    input >> type >> dec >> size;\n    if (input.fail())\n    {\n      cerr << \"Error reading kernel arguments.\" << endl;\n      return false;\n    }\n\n    switch (type)\n    {\n    case 'b':\n      \/\/ Allocate buffer\n      address = globalMemory->allocateBuffer(size);\n      if (!address)\n      {\n        cerr << \"Failed to allocate buffer\" << endl;\n        return false;\n      }\n\n      \/\/ Initialise buffer\n      for (i = 0; i < size; i++)\n      {\n        input >> hex >> byte;\n        globalMemory->store((unsigned char*)&byte, address + i);\n      }\n\n      \/\/ Set argument value\n      value.size = sizeof(size_t);\n      value.num = 1;\n      value.data = new unsigned char[value.size];\n      *((size_t*)value.data) = address;\n\n      break;\n    case 'l':\n      \/\/ Allocate local memory argument\n      value.size = size;\n      value.num = 1;\n      value.data = NULL;\n\n      break;\n    case 's':\n      \/\/ Create scalar argument\n      value.size = size;\n      value.num = 1;\n      value.data = new unsigned char[value.size];\n      for (i = 0; i < size; i++)\n      {\n        input >> hex >> byte;\n        value.data[i] = (unsigned char)byte;\n      }\n\n      break;\n    default:\n      cerr << \"Unrecognised argument type '\" << type << \"'\" << endl;\n      return false;\n    }\n\n    kernel->setArgument(idx, value);\n    if (value.data)\n    {\n      delete[] value.data;\n    }\n  }\n\n  \/\/ Make sure there is no more input\n  std::string next;\n  input >> next;\n  if (input.good() || !input.eof())\n  {\n    cerr << \"Unexpected token '\" << next << \"' (expected EOF)\" << endl;\n    return false;\n  }\n\n  return true;\n}\n\nstatic bool parseArguments(int argc, char *argv[])\n{\n  for (int i = 1; i < argc; i++)\n  {\n    if (!strcmp(argv[i], \"--data-races\"))\n    {\n#if defined(_WIN32) && !defined(__MINGW32__)\n      _putenv(\"OCLGRIND_DATA_RACES=1\");\n#else\n      setenv(\"OCLGRIND_DATA_RACES\", \"1\", 1);\n#endif\n    }\n    else if (!strcmp(argv[i], \"--dump-spir\"))\n    {\n#if defined(_WIN32) && !defined(__MINGW32__)\n      _putenv(\"OCLGRIND_DUMP_SPIR=1\");\n#else\n      setenv(\"OCLGRIND_DUMP_SPIR\", \"1\", 1);\n#endif\n    }\n    else if (!strcmp(argv[i], \"-g\") || !strcmp(argv[i], \"--global-mem\"))\n    {\n      outputGlobalMemory = true;\n    }\n    else if (!strcmp(argv[i], \"-h\") || !strcmp(argv[i], \"--help\"))\n    {\n      printUsage();\n      exit(0);\n    }\n    else if (!strcmp(argv[i], \"-i\") || !strcmp(argv[i], \"--interactive\"))\n    {\n#if defined(_WIN32) && !defined(__MINGW32__)\n      _putenv(\"OCLGRIND_INTERACTIVE=1\");\n#else\n      setenv(\"OCLGRIND_INTERACTIVE\", \"1\", 1);\n#endif\n    }\n    else if (!strcmp(argv[i], \"-v\") || !strcmp(argv[i], \"--version\"))\n    {\n      cout << endl;\n      cout << \"Oclgrind \" PACKAGE_VERSION << endl;\n      cout << endl;\n      cout << \"Copyright (c) 2013-2014\" << endl;\n      cout << \"James Price and Simon McIntosh-Smith, University of Bristol\"\n           << endl;\n      cout << \"https:\/\/github.com\/jrprice\/Oclgrind\" << endl;\n      cout << endl;\n      exit(0);\n    }\n    else if (argv[i][0] == '-')\n    {\n      cerr << \"Unrecognised option '\" << argv[i] << \"'\" << endl;\n      return false;\n    }\n    else\n    {\n      if (simfile == NULL)\n      {\n        simfile = argv[i];\n      }\n      else\n      {\n        cerr << \"Unexpected positional argument '\" << argv[i] << \"'\" << endl;\n        return false;\n      }\n    }\n  }\n\n  if (simfile == NULL)\n  {\n    printUsage();\n    return false;\n  }\n\n  return true;\n}\n\nstatic void printUsage()\n{\n  cout << \"Usage: oclgrind-kernel [OPTIONS] simfile\" << endl;\n  cout << \"       oclgrind-kernel [--help | --version]\" << endl;\n  cout << endl;\n  cout << \"Options:\" << endl;\n  cout << \"     --data-races    Enable data-race detection\" << endl;\n  cout << \"     --dump-spir     Dump SPIR to \/tmp\/oclgrind_*.{ll,bc}\" << endl;\n  cout << \"  -g --global-mem    Output global memory at exit\" << endl;\n  cout << \"  -h --help          Display usage information\" << endl;\n  cout << \"  -i --interactive   Enable interactive mode\" << endl;\n  cout << \"  -v --version       Display version information\" << endl;\n  cout << endl;\n  cout << \"For more information, please visit the Oclgrind wiki page:\" << endl;\n  cout << \"-> https:\/\/github.com\/jrprice\/Oclgrind\/wiki\" << endl;\n  cout << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n * \\file SickLMSBufferMonitor.cc\n * \\brief Implements a class for monitoring the receive\n *        buffer when interfacing w\/ a Sick LMS LIDAR.\n *\n * Code by Jason C. Derenick and Thomas H. Miller.\n * Contact derenick(at)lehigh(dot)edu\n *\n * The Sick LIDAR Matlab\/C++ Toolbox\n * Copyright (c) 2008, Jason C. Derenick and Thomas H. Miller\n * All rights reserved.\n *\n * This software is released under a BSD Open-Source License.\n * See http:\/\/sicktoolbox.sourceforge.net\n *\/\n\n\/* Auto-generated header *\/\n#include \"SickConfig.hh\"\n\n\/* Implementation dependencies *\/\n#include <iostream>\n#include <termios.h>\n\n#include \"SickLMS.hh\"\n#include \"SickLMSBufferMonitor.hh\"\n#include \"SickLMSMessage.hh\"\n#include \"SickException.hh\"\n#include \"SickLMSUtility.hh\"\n\n\/* Associate the namespace *\/\nnamespace SickToolbox {\n\n  \/**\n   * \\brief A standard constructor\n   *\/\n  SickLMSBufferMonitor::SickLMSBufferMonitor( ) : SickBufferMonitor<SickLMSBufferMonitor,SickLMSMessage>(this) { }\n\n  \/**\n   * \\brief Acquires the next message from the SickLMS byte stream\n   * \\param &sick_message The returned message object\n   *\/\n  void SickLMSBufferMonitor::GetNextMessageFromDataStream( SickLMSMessage &sick_message ) throw( SickIOException ) {\n    \n    uint8_t search_buffer[2] = {0};\n    uint8_t payload_length_buffer[2] = {0};\n    uint8_t payload_buffer[SickLMSMessage::MESSAGE_PAYLOAD_MAX_LENGTH] = {0};\n    uint8_t checksum_buffer[2] = {0};  \n    uint16_t payload_length, checksum;\n    \n    try {\n\n      \/* Drain the I\/O buffers! *\/\n      if (tcdrain(_sick_fd) != 0) {\n     \tthrow SickIOException(\"SickLMS::_getNextMessageFromDataStream: tcdrain failed!\");\n      }\n\n      \/* Read until we get a valid message header *\/\n      unsigned int bytes_searched = 0;\n      while(search_buffer[0] != 0x02 || search_buffer[1] != DEFAULT_SICK_LMS_HOST_ADDRESS) {\n\t\n \t\/* Slide the search window *\/\n \tsearch_buffer[0] = search_buffer[1];\n\t\n \t\/* Attempt to read in another byte *\/\n \t_readBytes(&search_buffer[1],1,DEFAULT_SICK_LMS_SICK_BYTE_TIMEOUT);\n\n\t\/* Header should be no more than max message length + header length bytes away *\/\n\tif (bytes_searched > SickLMSMessage::MESSAGE_MAX_LENGTH + SickLMSMessage::MESSAGE_HEADER_LENGTH) {\n\t  throw SickTimeoutException(\"SickLMSBufferMonitor::GetNextMessageFromDataStream: header timeout!\");\n\t}\n\t\n\t\/* Increment the number of bytes searched *\/\n\tbytes_searched++;\n\t\n      }\n      \n      \/* Read until we receive the payload length or we timeout *\/\n      _readBytes(payload_length_buffer,2,DEFAULT_SICK_LMS_SICK_BYTE_TIMEOUT);\n\n      \/* Extract the payload length *\/\n      memcpy(&payload_length,payload_length_buffer,2);\n      payload_length = sick_lms_to_host_byte_order(payload_length);\n\n      \/* Make sure the payload length is legitimate, otherwise disregard *\/\n      if (payload_length <= SickLMSMessage::MESSAGE_MAX_LENGTH) {\n\n\t\/* Read until we receive the payload or we timeout *\/\n\t_readBytes(payload_buffer,payload_length,DEFAULT_SICK_LMS_SICK_BYTE_TIMEOUT);\n\t\n\t\/* Read until we receive the checksum or we timeout *\/\n\t_readBytes(checksum_buffer,2,DEFAULT_SICK_LMS_SICK_BYTE_TIMEOUT);\n\t\n\t\/* Copy into uint16_t so it can be used *\/\n\tmemcpy(&checksum,checksum_buffer,2);\n\tchecksum = sick_lms_to_host_byte_order(checksum);\n\t\n\t\/* Build a frame and compute the crc *\/\n\tsick_message.BuildMessage(DEFAULT_SICK_LMS_HOST_ADDRESS,payload_buffer,payload_length);\n\t\n\t\/* See if the checksums match *\/\n\tif(sick_message.GetChecksum() != checksum) {\n\t  throw SickBadChecksumException(\"SickLMS::_getNextMessageFromDataStream: CRC16 failed!\");\n\t}\n\n      }\n      \n    }\n    \n    catch(SickTimeoutException &sick_timeout_exception) { \/* This is ok! *\/ }\n    \n    \/* Catch a bad checksum! *\/\n    catch(SickBadChecksumException &sick_checksum_exception) {\n      std::cerr << sick_checksum_exception.what() << std::endl;\n    }\n    \n    \/* Catch any serious IO exceptions *\/\n    catch(SickIOException &sick_io_exception) {\n      std::cerr << sick_io_exception.what() << std::endl;\n      throw;\n    }\n\n    \/* A sanity check *\/\n    catch (...) {\n      std::cerr << \"SickLMSBufferMonitor::_getNextMessageFromByteStream: Unknown exception!\" << std::endl;\n      throw;\n    }\n    \n  }\n  \n  \/**\n   * \\brief A standard destructor\n   *\/\n  SickLMSBufferMonitor::~SickLMSBufferMonitor( ) { }\n    \n} \/* namespace SickToolbox *\/\n<commit_msg>Monitor now clears msg container on bad checksum<commit_after>\/*!\n * \\file SickLMSBufferMonitor.cc\n * \\brief Implements a class for monitoring the receive\n *        buffer when interfacing w\/ a Sick LMS LIDAR.\n *\n * Code by Jason C. Derenick and Thomas H. Miller.\n * Contact derenick(at)lehigh(dot)edu\n *\n * The Sick LIDAR Matlab\/C++ Toolbox\n * Copyright (c) 2008, Jason C. Derenick and Thomas H. Miller\n * All rights reserved.\n *\n * This software is released under a BSD Open-Source License.\n * See http:\/\/sicktoolbox.sourceforge.net\n *\/\n\n\/* Auto-generated header *\/\n#include \"SickConfig.hh\"\n\n\/* Implementation dependencies *\/\n#include <iostream>\n#include <termios.h>\n\n#include \"SickLMS.hh\"\n#include \"SickLMSBufferMonitor.hh\"\n#include \"SickLMSMessage.hh\"\n#include \"SickException.hh\"\n#include \"SickLMSUtility.hh\"\n\n\/* Associate the namespace *\/\nnamespace SickToolbox {\n\n  \/**\n   * \\brief A standard constructor\n   *\/\n  SickLMSBufferMonitor::SickLMSBufferMonitor( ) : SickBufferMonitor<SickLMSBufferMonitor,SickLMSMessage>(this) { }\n\n  \/**\n   * \\brief Acquires the next message from the SickLMS byte stream\n   * \\param &sick_message The returned message object\n   *\/\n  void SickLMSBufferMonitor::GetNextMessageFromDataStream( SickLMSMessage &sick_message ) throw( SickIOException ) {\n    \n    uint8_t search_buffer[2] = {0};\n    uint8_t payload_length_buffer[2] = {0};\n    uint8_t payload_buffer[SickLMSMessage::MESSAGE_PAYLOAD_MAX_LENGTH] = {0};\n    uint8_t checksum_buffer[2] = {0};  \n    uint16_t payload_length, checksum;\n    \n    try {\n\n      \/* Drain the I\/O buffers! *\/\n      if (tcdrain(_sick_fd) != 0) {\n     \tthrow SickIOException(\"SickLMS::_getNextMessageFromDataStream: tcdrain failed!\");\n      }\n\n      \/* Read until we get a valid message header *\/\n      unsigned int bytes_searched = 0;\n      while(search_buffer[0] != 0x02 || search_buffer[1] != DEFAULT_SICK_LMS_HOST_ADDRESS) {\n\t\n \t\/* Slide the search window *\/\n \tsearch_buffer[0] = search_buffer[1];\n\t\n \t\/* Attempt to read in another byte *\/\n \t_readBytes(&search_buffer[1],1,DEFAULT_SICK_LMS_SICK_BYTE_TIMEOUT);\n\n\t\/* Header should be no more than max message length + header length bytes away *\/\n\tif (bytes_searched > SickLMSMessage::MESSAGE_MAX_LENGTH + SickLMSMessage::MESSAGE_HEADER_LENGTH) {\n\t  throw SickTimeoutException(\"SickLMSBufferMonitor::GetNextMessageFromDataStream: header timeout!\");\n\t}\n\t\n\t\/* Increment the number of bytes searched *\/\n\tbytes_searched++;\n\t\n      }\n      \n      \/* Read until we receive the payload length or we timeout *\/\n      _readBytes(payload_length_buffer,2,DEFAULT_SICK_LMS_SICK_BYTE_TIMEOUT);\n\n      \/* Extract the payload length *\/\n      memcpy(&payload_length,payload_length_buffer,2);\n      payload_length = sick_lms_to_host_byte_order(payload_length);\n\n      \/* Make sure the payload length is legitimate, otherwise disregard *\/\n      if (payload_length <= SickLMSMessage::MESSAGE_MAX_LENGTH) {\n\n\t\/* Read until we receive the payload or we timeout *\/\n\t_readBytes(payload_buffer,payload_length,DEFAULT_SICK_LMS_SICK_BYTE_TIMEOUT);\n\t\n\t\/* Read until we receive the checksum or we timeout *\/\n\t_readBytes(checksum_buffer,2,DEFAULT_SICK_LMS_SICK_BYTE_TIMEOUT);\n\t\n\t\/* Copy into uint16_t so it can be used *\/\n\tmemcpy(&checksum,checksum_buffer,2);\n\tchecksum = sick_lms_to_host_byte_order(checksum);\n\t\n\t\/* Build a frame and compute the crc *\/\n\tsick_message.BuildMessage(DEFAULT_SICK_LMS_HOST_ADDRESS,payload_buffer,payload_length);\n\t\n\t\/* See if the checksums match *\/\n\tif(sick_message.GetChecksum() != checksum) {\n\t  throw SickBadChecksumException(\"SickLMS::_getNextMessageFromDataStream: CRC16 failed!\");\n\t}\n\n      }\n      \n    }\n    \n    catch(SickTimeoutException &sick_timeout_exception) { \/* This is ok! *\/ }\n    \n    \/* Catch a bad checksum! *\/\n    catch(SickBadChecksumException &sick_checksum_exception) {\n      sick_message.Clear(); \/\/ Clear the message container\n      std::cerr << sick_checksum_exception.what() << std::endl;\n    }\n    \n    \/* Catch any serious IO exceptions *\/\n    catch(SickIOException &sick_io_exception) {\n      std::cerr << sick_io_exception.what() << std::endl;\n      throw;\n    }\n\n    \/* A sanity check *\/\n    catch (...) {\n      std::cerr << \"SickLMSBufferMonitor::_getNextMessageFromByteStream: Unknown exception!\" << std::endl;\n      throw;\n    }\n    \n  }\n  \n  \/**\n   * \\brief A standard destructor\n   *\/\n  SickLMSBufferMonitor::~SickLMSBufferMonitor( ) { }\n    \n} \/* namespace SickToolbox *\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>CID#1103763 uninitialized member<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************************\r\n *                                                                                       *\r\n * GHOUL                                                                                 *\r\n * General Helpful Open Utility Library                                                  *\r\n *                                                                                       *\r\n * Copyright (c) 2012 Alexander Bock                                                     *\r\n *                                                                                       *\r\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this  *\r\n * software and associated documentation files (the \"Software\"), to deal in the Software *\r\n * without restriction, including without limitation the rights to use, copy, modify,    *\r\n * merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to    *\r\n * permit persons to whom the Software is furnished to do so, subject to the following   *\r\n * conditions:                                                                           *\r\n *                                                                                       *\r\n * The above copyright notice and this permission notice shall be included in all copies *\r\n * or substantial portions of the Software.                                              *\r\n *                                                                                       *\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,   *\r\n * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A         *\r\n * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT    *\r\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF  *\r\n * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE  *\r\n * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                                         *\r\n ****************************************************************************************\/\r\n\r\n#include <ghoul\/opengl\/texturereader.h>\r\n\r\n#include <ghoul\/opengl\/texture.h>\r\n#include <ghoul\/logging\/logmanager.h>\r\n#include \"glm\/glm.hpp\"\r\n\r\n#include <IL\/il.h>\r\n\r\nnamespace ghoul {\r\nnamespace opengl {\r\n\r\nTexture* loadTexture(const std::string& filename, bool useCompression) {\r\n    std::string _loggerCat = \"loadTexture\";\r\n\r\n    ilInit();\r\n    \/\/ilOriginFunc(IL_ORIGIN_LOWER_LEFT);\r\n    \/\/ilEnable(IL_ORIGIN_SET);\r\n\r\n    ILboolean loadSuccess = ilLoadImage(filename.c_str());\r\n    if (!loadSuccess) {\r\n        ILenum error = ilGetError();\r\n        if (error == IL_COULD_NOT_OPEN_FILE)\r\n            LERROR(\"Could not open image file '\" << filename <<\r\n                        \"'. File did not exist.\");\r\n        else if (error == IL_ILLEGAL_OPERATION)\r\n            LERROR(\"Could not open image file '\" << filename <<\r\n                        \"'. Illegal operation.\");\r\n        else if (error == IL_INVALID_EXTENSION)\r\n            LERROR(\"Could not open image file '\" << filename <<\r\n                        \"'. The file could not be loaded based on extension or header.\");\r\n        else if (error == IL_INVALID_PARAM)\r\n            LERROR(\"Could not open image file '\" << filename <<\r\n                        \"'. FileName was not valid. It was most likely NULL.\");\r\n        else if (error == IL_OUT_OF_MEMORY)\r\n            LERROR(\"Could not allocate enough memory for '\" << filename << \"'.\");\r\n        else if (error == IL_NO_ERROR)\r\n            LERROR(\"Could not open image file '\" << filename <<\r\n                        \"'. No error reported.\");\r\n        else if (error == IL_UNKNOWN_ERROR)\r\n            LERROR(\"Could not open image file '\" << filename <<\r\n                        \"'. Unknown reported.\");\r\n        else\r\n            LERROR(\"Could not open\/read image file '\" << filename <<\r\n                        \"'. Error message: \" << error);\r\n        return nullptr;\r\n    }\r\n    ILint imageFormat = ilGetInteger(IL_IMAGE_FORMAT);\r\n    ILint imageType = ilGetInteger(IL_IMAGE_TYPE);\r\n    ILint imageByte = ilGetInteger(IL_IMAGE_BYTES_PER_PIXEL);\r\n    ILint width = ilGetInteger(IL_IMAGE_WIDTH);\r\n    ILint height = ilGetInteger(IL_IMAGE_HEIGHT);\r\n    ILint depth = ilGetInteger(IL_IMAGE_DEPTH);\r\n\r\n    \/\/ Copy data from common data store to own address space\r\n    ILubyte* data = new ILubyte[width * height * imageByte];\r\n    ilCopyPixels(0, 0, 0, width, height, 1, imageFormat, IL_UNSIGNED_BYTE, data);\r\n\r\n    glm::size3_t size(width, height, depth);\r\n\r\n    Texture::Format format;\r\n    switch (imageFormat) {\r\n        case IL_RGB:\r\n            format = Texture::Format::RGB;\r\n            break;\r\n        case IL_RGBA:\r\n            format = Texture::Format::RGBA;\r\n            break;\r\n        case IL_BGR:\r\n            format = Texture::Format::BGR;\r\n            break;\r\n        case IL_BGRA:\r\n            format = Texture::Format::BGRA;\r\n            break;\r\n        default:\r\n            LERROR(\"Could not read image file '\" << filename << \"' of format: '\" <<\r\n                        imageFormat << \"'\");\r\n            return nullptr;\r\n    }\r\n\r\n    \r\n    GLenum type;\r\n    switch (imageType) {\r\n        case IL_UNSIGNED_BYTE:\r\n            type = GL_UNSIGNED_BYTE;\r\n            break;\r\n        case IL_BYTE:\r\n            type = GL_BYTE;\r\n            break;\r\n        case IL_UNSIGNED_SHORT:\r\n            type = GL_UNSIGNED_SHORT;\r\n            break;\r\n        case IL_SHORT:\r\n            type = GL_SHORT;\r\n            break;\r\n        case IL_UNSIGNED_INT:\r\n            type = GL_UNSIGNED_INT;\r\n            break;\r\n        case IL_INT:\r\n            type = GL_INT;\r\n            break;\r\n        case IL_FLOAT:\r\n            type = GL_FLOAT;\r\n            break;\r\n        default:\r\n            LERROR(\"Could not read image file '\" << filename <<\r\n                        \"' of data type: '\" << imageType << \"'\");\r\n            return nullptr;\r\n    }\r\n\r\n    Texture* result;\r\n    if (useCompression) {\r\n        switch (format) {\r\n            case Texture::Format::RGB:\r\n                result = new Texture(data, size, format,\r\n                                     GL_COMPRESSED_RGB_S3TC_DXT1_EXT, type);\r\n                break;\r\n            case Texture::Format::RGBA:\r\n                result = new Texture(data, size, format,\r\n                                     GL_COMPRESSED_RGBA_S3TC_DXT5_EXT, type);\r\n                break;\r\n            default:\r\n                LERROR(\"Could not assign compressed format for: '\" <<\r\n                    GLint(format) << \"'. Using no compression instead\");\r\n                result = new Texture(data, size, format, static_cast<int>(format), type);\r\n                break;\r\n        }\r\n    }\r\n    else\r\n        result = new Texture(data, size, format, static_cast<int>(format), type);\r\n\r\n    return result;\r\n}\r\n\r\n} \/\/ namespace opengl\r\n} \/\/ namespace ghoul\r\n<commit_msg>replaced if-else construct in TextureReader with 'iluGetError' string message<commit_after>\/*****************************************************************************************\r\n *                                                                                       *\r\n * GHOUL                                                                                 *\r\n * General Helpful Open Utility Library                                                  *\r\n *                                                                                       *\r\n * Copyright (c) 2012 Alexander Bock                                                     *\r\n *                                                                                       *\r\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this  *\r\n * software and associated documentation files (the \"Software\"), to deal in the Software *\r\n * without restriction, including without limitation the rights to use, copy, modify,    *\r\n * merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to    *\r\n * permit persons to whom the Software is furnished to do so, subject to the following   *\r\n * conditions:                                                                           *\r\n *                                                                                       *\r\n * The above copyright notice and this permission notice shall be included in all copies *\r\n * or substantial portions of the Software.                                              *\r\n *                                                                                       *\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,   *\r\n * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A         *\r\n * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT    *\r\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF  *\r\n * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE  *\r\n * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                                         *\r\n ****************************************************************************************\/\r\n\r\n#include <ghoul\/opengl\/texturereader.h>\r\n\r\n#include <ghoul\/opengl\/texture.h>\r\n#include <ghoul\/logging\/logmanager.h>\r\n#include \"glm\/glm.hpp\"\r\n\r\n#include <IL\/il.h>\r\n#include <IL\/ilu.h>\r\n\r\nnamespace ghoul {\r\nnamespace opengl {\r\n\r\nTexture* loadTexture(const std::string& filename, bool useCompression) {\r\n    std::string _loggerCat = \"loadTexture\";\r\n\r\n    ilInit();\r\n    \/\/ilOriginFunc(IL_ORIGIN_LOWER_LEFT);\r\n    \/\/ilEnable(IL_ORIGIN_SET);\r\n\r\n    ILboolean loadSuccess = ilLoadImage(filename.c_str());\r\n    if (!loadSuccess) {\r\n        ILenum error = ilGetError();\r\n        LERROR(\"Error while loading image '\" << filename << \"': \" <<\r\n                    iluErrorString(error));\r\n        return nullptr;\r\n    }\r\n    ILint imageFormat = ilGetInteger(IL_IMAGE_FORMAT);\r\n    ILint imageType = ilGetInteger(IL_IMAGE_TYPE);\r\n    ILint imageByte = ilGetInteger(IL_IMAGE_BYTES_PER_PIXEL);\r\n    ILint width = ilGetInteger(IL_IMAGE_WIDTH);\r\n    ILint height = ilGetInteger(IL_IMAGE_HEIGHT);\r\n    ILint depth = ilGetInteger(IL_IMAGE_DEPTH);\r\n\r\n    \/\/ Copy data from common data store to own address space\r\n    ILubyte* data = new ILubyte[width * height * imageByte];\r\n    ilCopyPixels(0, 0, 0, width, height, 1, imageFormat, IL_UNSIGNED_BYTE, data);\r\n\r\n    glm::size3_t size(width, height, depth);\r\n\r\n    Texture::Format format;\r\n    switch (imageFormat) {\r\n        case IL_RGB:\r\n            format = Texture::Format::RGB;\r\n            break;\r\n        case IL_RGBA:\r\n            format = Texture::Format::RGBA;\r\n            break;\r\n        case IL_BGR:\r\n            format = Texture::Format::BGR;\r\n            break;\r\n        case IL_BGRA:\r\n            format = Texture::Format::BGRA;\r\n            break;\r\n        default:\r\n            LERROR(\"Could not read image file '\" << filename << \"' of format: '\" <<\r\n                        imageFormat << \"'\");\r\n            return nullptr;\r\n    }\r\n\r\n    \r\n    GLenum type;\r\n    switch (imageType) {\r\n        case IL_UNSIGNED_BYTE:\r\n            type = GL_UNSIGNED_BYTE;\r\n            break;\r\n        case IL_BYTE:\r\n            type = GL_BYTE;\r\n            break;\r\n        case IL_UNSIGNED_SHORT:\r\n            type = GL_UNSIGNED_SHORT;\r\n            break;\r\n        case IL_SHORT:\r\n            type = GL_SHORT;\r\n            break;\r\n        case IL_UNSIGNED_INT:\r\n            type = GL_UNSIGNED_INT;\r\n            break;\r\n        case IL_INT:\r\n            type = GL_INT;\r\n            break;\r\n        case IL_FLOAT:\r\n            type = GL_FLOAT;\r\n            break;\r\n        default:\r\n            LERROR(\"Could not read image file '\" << filename <<\r\n                        \"' of data type: '\" << imageType << \"'\");\r\n            return nullptr;\r\n    }\r\n\r\n    Texture* result;\r\n    if (useCompression) {\r\n        switch (format) {\r\n            case Texture::Format::RGB:\r\n                result = new Texture(data, size, format,\r\n                                     GL_COMPRESSED_RGB_S3TC_DXT1_EXT, type);\r\n                break;\r\n            case Texture::Format::RGBA:\r\n                result = new Texture(data, size, format,\r\n                                     GL_COMPRESSED_RGBA_S3TC_DXT5_EXT, type);\r\n                break;\r\n            default:\r\n                LERROR(\"Could not assign compressed format for: '\" <<\r\n                    GLint(format) << \"'. Using no compression instead\");\r\n                result = new Texture(data, size, format, static_cast<int>(format), type);\r\n                break;\r\n        }\r\n    }\r\n    else\r\n        result = new Texture(data, size, format, static_cast<int>(format), type);\r\n\r\n    return result;\r\n}\r\n\r\n} \/\/ namespace opengl\r\n} \/\/ namespace ghoul\r\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 \"SkUtils_opts_SSE2.h\"\n#include \"SkUtils.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() {\n    if (cachedHasSSE2()) {\n        fConvolutionProcs->fExtraHorizontalReads = 3;\n        fConvolutionProcs->fConvolveVertically = &convolveVertically_SSE2;\n        fConvolutionProcs->fConvolve4RowsHorizontally = &convolve4RowsHorizontally_SSE2;\n        fConvolutionProcs->fConvolveHorizontally = &convolveHorizontally_SSE2;\n        fConvolutionProcs->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 == highQualityFilter) {\n                fShaderProc32 = highQualityFilter_SSE2;\n            }\n        }\n    }\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    return NULL;\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\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory(); \/\/ suppress warning\n\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory() {\n    if (cachedHasSSE2()) {\n        return ColorRect32_SSE2;\n    } else {\n        return NULL;\n    }\n}\n<commit_msg>Let hasSSSE3 return false for the Android framework, if the CPU level check doesn't support SSSE3.<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 \"SkUtils_opts_SSE2.h\"\n#include \"SkUtils.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, if the device does not support SSSE3, the\n   compiler will not supply the required -mssse3 option.  Thus, we return\n   false here.  *\/\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() {\n    if (cachedHasSSE2()) {\n        fConvolutionProcs->fExtraHorizontalReads = 3;\n        fConvolutionProcs->fConvolveVertically = &convolveVertically_SSE2;\n        fConvolutionProcs->fConvolve4RowsHorizontally = &convolve4RowsHorizontally_SSE2;\n        fConvolutionProcs->fConvolveHorizontally = &convolveHorizontally_SSE2;\n        fConvolutionProcs->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 == highQualityFilter) {\n                fShaderProc32 = highQualityFilter_SSE2;\n            }\n        }\n    }\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    return NULL;\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\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory(); \/\/ suppress warning\n\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory() {\n    if (cachedHasSSE2()) {\n        return ColorRect32_SSE2;\n    } else {\n        return NULL;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: pe_file2.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2005-01-27 11:31: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#ifndef LUIDL_PE_FILE2_HXX\n#define LUIDL_PE_FILE2_HXX\n\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include <s2_luidl\/parsenv2.hxx>\n#include <s2_luidl\/pestate.hxx>\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n\n\nnamespace ary\n{\nnamespace idl\n{\nclass Module;\n}   \/\/ namespace idl\n}   \/\/ namespace ary\n\n\nnamespace csi\n{\nnamespace uidl\n{\n\nclass TokenDistributor;\nclass PE_Service;\nclass PE_Singleton;\nclass PE_Interface;\nclass PE_Struct;\nclass PE_Exception;\nclass PE_Constant;\nclass PE_Enum;\nclass PE_Typedef;\n\n\nclass PE_File : public UnoIDL_PE,\n                public ParseEnvState\n{\n  public:\n                        PE_File(\n                            TokenDistributor &  i_rTokenAdmin,\n                            const ParserInfo &  i_parseInfo );\n    virtual void        EstablishContacts(\n                            UnoIDL_PE *         io_pParentPE,\n                            ary::n22::Repository &  io_rRepository,\n                            TokenProcessing_Result &\n                                                o_rResult );\n                        ~PE_File();\n\n    virtual void        ProcessToken(\n                            const Token &       i_rToken );\n\n    virtual void        Process_Identifier(\n                            const TokIdentifier &\n                                                i_rToken );\n    virtual void        Process_Punctuation(\n                            const TokPunctuation &\n                                                i_rToken );\n    virtual void        Process_MetaType(\n                            const TokMetaType & i_rToken );\n    virtual void        Process_Stereotype(\n                            const TokStereotype &\n                                                i_rToken );\n    virtual void        Process_Default();\n\n  private:\n    enum E_State\n    {\n        e_none,\n        e_std,\n        wait_for_module,\n        wait_for_module_bracket,\n        wait_for_module_semicolon,\n        in_sub_pe,\n        on_default\n    };\n\n    virtual void        InitData();\n    virtual void        TransferData();\n    virtual void        ReceiveData();\n    virtual UnoIDL_PE & MyPE();\n    virtual const ary::idl::Module &\n                        CurNamespace() const;\n    virtual const ParserInfo &\n                        ParseInfo() const;\n    \/\/ DATA\n    TokenDistributor *  pTokenAdmin;\n    Dyn<PE_Service>     pPE_Service;\n    Dyn<PE_Singleton>   pPE_Singleton;\n    Dyn<PE_Interface>   pPE_Interface;\n    Dyn<PE_Struct>      pPE_Struct;\n    Dyn<PE_Exception>   pPE_Exception;\n    Dyn<PE_Constant>    pPE_Constant;\n    Dyn<PE_Enum>        pPE_Enum;\n    Dyn<PE_Typedef>     pPE_Typedef;\n\n    const ary::idl::Module *\n                        pCurNamespace;\n    const ParserInfo *  pParseInfo;\n\n    E_State             eState;\n    uintt               nBracketCount_inDefMode;\n};\n\n\n}   \/\/ namespace uidl\n}   \/\/ namespace csi\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.4.16); FILE MERGED 2005\/09\/05 13:12:41 rt 1.4.16.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: pe_file2.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 19:01: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 LUIDL_PE_FILE2_HXX\n#define LUIDL_PE_FILE2_HXX\n\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include <s2_luidl\/parsenv2.hxx>\n#include <s2_luidl\/pestate.hxx>\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n\n\nnamespace ary\n{\nnamespace idl\n{\nclass Module;\n}   \/\/ namespace idl\n}   \/\/ namespace ary\n\n\nnamespace csi\n{\nnamespace uidl\n{\n\nclass TokenDistributor;\nclass PE_Service;\nclass PE_Singleton;\nclass PE_Interface;\nclass PE_Struct;\nclass PE_Exception;\nclass PE_Constant;\nclass PE_Enum;\nclass PE_Typedef;\n\n\nclass PE_File : public UnoIDL_PE,\n                public ParseEnvState\n{\n  public:\n                        PE_File(\n                            TokenDistributor &  i_rTokenAdmin,\n                            const ParserInfo &  i_parseInfo );\n    virtual void        EstablishContacts(\n                            UnoIDL_PE *         io_pParentPE,\n                            ary::n22::Repository &  io_rRepository,\n                            TokenProcessing_Result &\n                                                o_rResult );\n                        ~PE_File();\n\n    virtual void        ProcessToken(\n                            const Token &       i_rToken );\n\n    virtual void        Process_Identifier(\n                            const TokIdentifier &\n                                                i_rToken );\n    virtual void        Process_Punctuation(\n                            const TokPunctuation &\n                                                i_rToken );\n    virtual void        Process_MetaType(\n                            const TokMetaType & i_rToken );\n    virtual void        Process_Stereotype(\n                            const TokStereotype &\n                                                i_rToken );\n    virtual void        Process_Default();\n\n  private:\n    enum E_State\n    {\n        e_none,\n        e_std,\n        wait_for_module,\n        wait_for_module_bracket,\n        wait_for_module_semicolon,\n        in_sub_pe,\n        on_default\n    };\n\n    virtual void        InitData();\n    virtual void        TransferData();\n    virtual void        ReceiveData();\n    virtual UnoIDL_PE & MyPE();\n    virtual const ary::idl::Module &\n                        CurNamespace() const;\n    virtual const ParserInfo &\n                        ParseInfo() const;\n    \/\/ DATA\n    TokenDistributor *  pTokenAdmin;\n    Dyn<PE_Service>     pPE_Service;\n    Dyn<PE_Singleton>   pPE_Singleton;\n    Dyn<PE_Interface>   pPE_Interface;\n    Dyn<PE_Struct>      pPE_Struct;\n    Dyn<PE_Exception>   pPE_Exception;\n    Dyn<PE_Constant>    pPE_Constant;\n    Dyn<PE_Enum>        pPE_Enum;\n    Dyn<PE_Typedef>     pPE_Typedef;\n\n    const ary::idl::Module *\n                        pCurNamespace;\n    const ParserInfo *  pParseInfo;\n\n    E_State             eState;\n    uintt               nBracketCount_inDefMode;\n};\n\n\n}   \/\/ namespace uidl\n}   \/\/ namespace csi\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- bugpoint.cpp - The LLVM BugPoint utility ---------------------------===\/\/\n\/\/\n\/\/ This program is an automated compiler debugger tool.  It is used to narrow\n\/\/ down miscompilations and crash problems to a specific pass in the compiler,\n\/\/ and the specific Module or Function input that is causing the problem.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"BugDriver.h\"\n#include \"Support\/CommandLine.h\"\n#include \"llvm\/Support\/PassNameParser.h\"\n\nstatic cl::list<std::string>\nInputFilenames(cl::Positional, cl::OneOrMore,\n               cl::desc(\"<input llvm ll\/bc files>\"));\n\n\/\/ The AnalysesList is automatically populated with registered Passes by the\n\/\/ PassNameParser.\n\/\/\nstatic cl::list<const PassInfo*, bool, PassNameParser>\nPassList(cl::desc(\"Passes available:\"), cl::ZeroOrMore);\n\n\/\/cl::list<std::string>\n\/\/InputArgv(cl::ConsumeAfter, cl::desc(\"<program arguments>...\"));\n\nint main(int argc, char **argv) {\n  cl::ParseCommandLineOptions(argc, argv);\n\n  BugDriver D(argv[0]);\n  if (D.addSources(InputFilenames)) return 1;\n  D.addPasses(PassList.begin(), PassList.end());\n\n  return D.run();\n}\n<commit_msg>Add variable to capture arguments that should be passed to the user program This is unused so far.<commit_after>\/\/===- bugpoint.cpp - The LLVM BugPoint utility ---------------------------===\/\/\n\/\/\n\/\/ This program is an automated compiler debugger tool.  It is used to narrow\n\/\/ down miscompilations and crash problems to a specific pass in the compiler,\n\/\/ and the specific Module or Function input that is causing the problem.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"BugDriver.h\"\n#include \"Support\/CommandLine.h\"\n#include \"llvm\/Support\/PassNameParser.h\"\n\nstatic cl::list<std::string>\nInputFilenames(cl::Positional, cl::OneOrMore,\n               cl::desc(\"<input llvm ll\/bc files>\"));\n\n\/\/ The AnalysesList is automatically populated with registered Passes by the\n\/\/ PassNameParser.\n\/\/\nstatic cl::list<const PassInfo*, bool, PassNameParser>\nPassList(cl::desc(\"Passes available:\"), cl::ZeroOrMore);\n\n\/\/ Anything specified after the --args option are taken as arguments to the\n\/\/ program being debugged.\ncl::list<std::string>\nInputArgv(\"args\", cl::Positional, cl::desc(\"<program arguments>...\"),\n          cl::ZeroOrMore);\n\nint main(int argc, char **argv) {\n  cl::ParseCommandLineOptions(argc, argv);\n\n  BugDriver D(argv[0]);\n  if (D.addSources(InputFilenames)) return 1;\n  D.addPasses(PassList.begin(), PassList.end());\n\n  return D.run();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- bugpoint.cpp - The LLVM Bugpoint utility ---------------------------===\/\/\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 program is an automated compiler debugger tool.  It is used to narrow\n\/\/ down miscompilations and crash problems to a specific pass in the compiler,\n\/\/ and the specific Module or Function input that is causing the problem.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"BugDriver.h\"\n#include \"ToolRunner.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/LegacyPassManager.h\"\n#include \"llvm\/IR\/LegacyPassNameParser.h\"\n#include \"llvm\/LinkAllIR.h\"\n#include \"llvm\/LinkAllPasses.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/PluginLoader.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/Process.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/Valgrind.h\"\n#include \"llvm\/Transforms\/IPO\/AlwaysInliner.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n\n\/\/ Enable this macro to debug bugpoint itself.\n\/\/#define DEBUG_BUGPOINT 1\n\nusing namespace llvm;\n\nstatic cl::opt<bool>\n    FindBugs(\"find-bugs\", cl::desc(\"Run many different optimization sequences \"\n                                   \"on program to find bugs\"),\n             cl::init(false));\n\nstatic cl::list<std::string>\n    InputFilenames(cl::Positional, cl::OneOrMore,\n                   cl::desc(\"<input llvm ll\/bc files>\"));\n\nstatic cl::opt<unsigned> TimeoutValue(\n    \"timeout\", cl::init(300), cl::value_desc(\"seconds\"),\n    cl::desc(\"Number of seconds program is allowed to run before it \"\n             \"is killed (default is 300s), 0 disables timeout\"));\n\nstatic cl::opt<int>\n    MemoryLimit(\"mlimit\", cl::init(-1), cl::value_desc(\"MBytes\"),\n                cl::desc(\"Maximum amount of memory to use. 0 disables check.\"\n                         \" Defaults to 400MB (800MB under valgrind).\"));\n\nstatic cl::opt<bool>\n    UseValgrind(\"enable-valgrind\",\n                cl::desc(\"Run optimizations through valgrind\"));\n\n\/\/ The AnalysesList is automatically populated with registered Passes by the\n\/\/ PassNameParser.\n\/\/\nstatic cl::list<const PassInfo *, bool, PassNameParser>\n    PassList(cl::desc(\"Passes available:\"), cl::ZeroOrMore);\n\nstatic cl::opt<bool>\n    StandardLinkOpts(\"std-link-opts\",\n                     cl::desc(\"Include the standard link time optimizations\"));\n\nstatic cl::opt<bool>\n    OptLevelO1(\"O1\", cl::desc(\"Optimization level 1. Identical to 'opt -O1'\"));\n\nstatic cl::opt<bool>\n    OptLevelO2(\"O2\", cl::desc(\"Optimization level 2. Identical to 'opt -O2'\"));\n\nstatic cl::opt<bool> OptLevelOs(\n    \"Os\",\n    cl::desc(\n        \"Like -O2 with extra optimizations for size. Similar to clang -Os\"));\n\nstatic cl::opt<bool>\n    OptLevelO3(\"O3\", cl::desc(\"Optimization level 3. Identical to 'opt -O3'\"));\n\nstatic cl::opt<std::string>\n    OverrideTriple(\"mtriple\", cl::desc(\"Override target triple for module\"));\n\n\/\/\/ BugpointIsInterrupted - Set to true when the user presses ctrl-c.\nbool llvm::BugpointIsInterrupted = false;\n\n#ifndef DEBUG_BUGPOINT\nstatic void BugpointInterruptFunction() { BugpointIsInterrupted = true; }\n#endif\n\n\/\/ Hack to capture a pass list.\nnamespace {\nclass AddToDriver : public legacy::FunctionPassManager {\n  BugDriver &D;\n\npublic:\n  AddToDriver(BugDriver &_D) : FunctionPassManager(nullptr), D(_D) {}\n\n  void add(Pass *P) override {\n    const void *ID = P->getPassID();\n    const PassInfo *PI = PassRegistry::getPassRegistry()->getPassInfo(ID);\n    D.addPass(PI->getPassArgument());\n  }\n};\n}\n\n#ifdef LINK_POLLY_INTO_TOOLS\nnamespace polly {\nvoid initializePollyPasses(llvm::PassRegistry &Registry);\n}\n#endif\n\nint main(int argc, char **argv) {\n#ifndef DEBUG_BUGPOINT\n  llvm::sys::PrintStackTraceOnErrorSignal(argv[0]);\n  llvm::PrettyStackTraceProgram X(argc, argv);\n  llvm_shutdown_obj Y; \/\/ Call llvm_shutdown() on exit.\n#endif\n\n  \/\/ Initialize passes\n  PassRegistry &Registry = *PassRegistry::getPassRegistry();\n  initializeCore(Registry);\n  initializeScalarOpts(Registry);\n  initializeObjCARCOpts(Registry);\n  initializeVectorization(Registry);\n  initializeIPO(Registry);\n  initializeAnalysis(Registry);\n  initializeTransformUtils(Registry);\n  initializeInstCombine(Registry);\n  initializeInstrumentation(Registry);\n  initializeTarget(Registry);\n\n#ifdef LINK_POLLY_INTO_TOOLS\n  polly::initializePollyPasses(Registry);\n#endif\n\n  if (std::getenv(\"bar\") == (char*) -1) {\n    InitializeAllTargets();\n    InitializeAllTargetMCs();\n    InitializeAllAsmPrinters();\n    InitializeAllAsmParsers();\n  }\n\n  cl::ParseCommandLineOptions(argc, argv,\n                              \"LLVM automatic testcase reducer. See\\nhttp:\/\/\"\n                              \"llvm.org\/cmds\/bugpoint.html\"\n                              \" for more information.\\n\");\n#ifndef DEBUG_BUGPOINT\n  sys::SetInterruptFunction(BugpointInterruptFunction);\n#endif\n\n  LLVMContext Context;\n  \/\/ If we have an override, set it and then track the triple we want Modules\n  \/\/ to use.\n  if (!OverrideTriple.empty()) {\n    TargetTriple.setTriple(Triple::normalize(OverrideTriple));\n    outs() << \"Override triple set to '\" << TargetTriple.getTriple() << \"'\\n\";\n  }\n\n  if (MemoryLimit < 0) {\n    \/\/ Set the default MemoryLimit.  Be sure to update the flag's description if\n    \/\/ you change this.\n    if (sys::RunningOnValgrind() || UseValgrind)\n      MemoryLimit = 800;\n    else\n      MemoryLimit = 400;\n  }\n\n  BugDriver D(argv[0], FindBugs, TimeoutValue, MemoryLimit, UseValgrind,\n              Context);\n  if (D.addSources(InputFilenames))\n    return 1;\n\n  AddToDriver PM(D);\n\n  if (StandardLinkOpts) {\n    PassManagerBuilder Builder;\n    Builder.Inliner = createFunctionInliningPass();\n    Builder.populateLTOPassManager(PM);\n  }\n\n  if (OptLevelO1 || OptLevelO2 || OptLevelO3) {\n    PassManagerBuilder Builder;\n    if (OptLevelO1)\n      Builder.Inliner = createAlwaysInlinerLegacyPass();\n    else if (OptLevelOs || OptLevelO2)\n      Builder.Inliner = createFunctionInliningPass(\n          2, OptLevelOs ? 1 : 0, false);\n    else\n      Builder.Inliner = createFunctionInliningPass(275);\n    Builder.populateFunctionPassManager(PM);\n    Builder.populateModulePassManager(PM);\n  }\n\n  for (const PassInfo *PI : PassList)\n    D.addPass(PI->getPassArgument());\n\n\/\/ Bugpoint has the ability of generating a plethora of core files, so to\n\/\/ avoid filling up the disk, we prevent it\n#ifndef DEBUG_BUGPOINT\n  sys::Process::PreventCoreFiles();\n#endif\n\n  if (Error E = D.run()) {\n    errs() << toString(std::move(E));\n    return 1;\n  }\n  return 0;\n}\n<commit_msg>Fix check-llvm on kernel 4.9+ with asan or msan<commit_after>\/\/===- bugpoint.cpp - The LLVM Bugpoint utility ---------------------------===\/\/\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 program is an automated compiler debugger tool.  It is used to narrow\n\/\/ down miscompilations and crash problems to a specific pass in the compiler,\n\/\/ and the specific Module or Function input that is causing the problem.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"BugDriver.h\"\n#include \"ToolRunner.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/LegacyPassManager.h\"\n#include \"llvm\/IR\/LegacyPassNameParser.h\"\n#include \"llvm\/LinkAllIR.h\"\n#include \"llvm\/LinkAllPasses.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/PluginLoader.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/Process.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/Valgrind.h\"\n#include \"llvm\/Transforms\/IPO\/AlwaysInliner.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n\n\/\/ Enable this macro to debug bugpoint itself.\n\/\/#define DEBUG_BUGPOINT 1\n\nusing namespace llvm;\n\nstatic cl::opt<bool>\n    FindBugs(\"find-bugs\", cl::desc(\"Run many different optimization sequences \"\n                                   \"on program to find bugs\"),\n             cl::init(false));\n\nstatic cl::list<std::string>\n    InputFilenames(cl::Positional, cl::OneOrMore,\n                   cl::desc(\"<input llvm ll\/bc files>\"));\n\nstatic cl::opt<unsigned> TimeoutValue(\n    \"timeout\", cl::init(300), cl::value_desc(\"seconds\"),\n    cl::desc(\"Number of seconds program is allowed to run before it \"\n             \"is killed (default is 300s), 0 disables timeout\"));\n\nstatic cl::opt<int> MemoryLimit(\n    \"mlimit\", cl::init(-1), cl::value_desc(\"MBytes\"),\n    cl::desc(\"Maximum amount of memory to use. 0 disables check. Defaults to \"\n             \"400MB (800MB under valgrind, 0 with sanitizers).\"));\n\nstatic cl::opt<bool>\n    UseValgrind(\"enable-valgrind\",\n                cl::desc(\"Run optimizations through valgrind\"));\n\n\/\/ The AnalysesList is automatically populated with registered Passes by the\n\/\/ PassNameParser.\n\/\/\nstatic cl::list<const PassInfo *, bool, PassNameParser>\n    PassList(cl::desc(\"Passes available:\"), cl::ZeroOrMore);\n\nstatic cl::opt<bool>\n    StandardLinkOpts(\"std-link-opts\",\n                     cl::desc(\"Include the standard link time optimizations\"));\n\nstatic cl::opt<bool>\n    OptLevelO1(\"O1\", cl::desc(\"Optimization level 1. Identical to 'opt -O1'\"));\n\nstatic cl::opt<bool>\n    OptLevelO2(\"O2\", cl::desc(\"Optimization level 2. Identical to 'opt -O2'\"));\n\nstatic cl::opt<bool> OptLevelOs(\n    \"Os\",\n    cl::desc(\n        \"Like -O2 with extra optimizations for size. Similar to clang -Os\"));\n\nstatic cl::opt<bool>\n    OptLevelO3(\"O3\", cl::desc(\"Optimization level 3. Identical to 'opt -O3'\"));\n\nstatic cl::opt<std::string>\n    OverrideTriple(\"mtriple\", cl::desc(\"Override target triple for module\"));\n\n\/\/\/ BugpointIsInterrupted - Set to true when the user presses ctrl-c.\nbool llvm::BugpointIsInterrupted = false;\n\n#ifndef DEBUG_BUGPOINT\nstatic void BugpointInterruptFunction() { BugpointIsInterrupted = true; }\n#endif\n\n\/\/ Hack to capture a pass list.\nnamespace {\nclass AddToDriver : public legacy::FunctionPassManager {\n  BugDriver &D;\n\npublic:\n  AddToDriver(BugDriver &_D) : FunctionPassManager(nullptr), D(_D) {}\n\n  void add(Pass *P) override {\n    const void *ID = P->getPassID();\n    const PassInfo *PI = PassRegistry::getPassRegistry()->getPassInfo(ID);\n    D.addPass(PI->getPassArgument());\n  }\n};\n}\n\n#ifdef LINK_POLLY_INTO_TOOLS\nnamespace polly {\nvoid initializePollyPasses(llvm::PassRegistry &Registry);\n}\n#endif\n\nint main(int argc, char **argv) {\n#ifndef DEBUG_BUGPOINT\n  llvm::sys::PrintStackTraceOnErrorSignal(argv[0]);\n  llvm::PrettyStackTraceProgram X(argc, argv);\n  llvm_shutdown_obj Y; \/\/ Call llvm_shutdown() on exit.\n#endif\n\n  \/\/ Initialize passes\n  PassRegistry &Registry = *PassRegistry::getPassRegistry();\n  initializeCore(Registry);\n  initializeScalarOpts(Registry);\n  initializeObjCARCOpts(Registry);\n  initializeVectorization(Registry);\n  initializeIPO(Registry);\n  initializeAnalysis(Registry);\n  initializeTransformUtils(Registry);\n  initializeInstCombine(Registry);\n  initializeInstrumentation(Registry);\n  initializeTarget(Registry);\n\n#ifdef LINK_POLLY_INTO_TOOLS\n  polly::initializePollyPasses(Registry);\n#endif\n\n  if (std::getenv(\"bar\") == (char*) -1) {\n    InitializeAllTargets();\n    InitializeAllTargetMCs();\n    InitializeAllAsmPrinters();\n    InitializeAllAsmParsers();\n  }\n\n  cl::ParseCommandLineOptions(argc, argv,\n                              \"LLVM automatic testcase reducer. See\\nhttp:\/\/\"\n                              \"llvm.org\/cmds\/bugpoint.html\"\n                              \" for more information.\\n\");\n#ifndef DEBUG_BUGPOINT\n  sys::SetInterruptFunction(BugpointInterruptFunction);\n#endif\n\n  LLVMContext Context;\n  \/\/ If we have an override, set it and then track the triple we want Modules\n  \/\/ to use.\n  if (!OverrideTriple.empty()) {\n    TargetTriple.setTriple(Triple::normalize(OverrideTriple));\n    outs() << \"Override triple set to '\" << TargetTriple.getTriple() << \"'\\n\";\n  }\n\n  if (MemoryLimit < 0) {\n    \/\/ Set the default MemoryLimit.  Be sure to update the flag's description if\n    \/\/ you change this.\n    if (sys::RunningOnValgrind() || UseValgrind)\n      MemoryLimit = 800;\n    else\n      MemoryLimit = 400;\n#if (LLVM_ADDRESS_SANITIZER_BUILD || LLVM_MEMORY_SANITIZER_BUILD ||            \\\n     LLVM_THREAD_SANITIZER_BUILD)\n    \/\/ Starting from kernel 4.9 memory allocated with mmap is counted against\n    \/\/ RLIMIT_DATA. Sanitizers need to allocate tens of terabytes for shadow.\n    MemoryLimit = 0;\n#endif\n  }\n\n  BugDriver D(argv[0], FindBugs, TimeoutValue, MemoryLimit, UseValgrind,\n              Context);\n  if (D.addSources(InputFilenames))\n    return 1;\n\n  AddToDriver PM(D);\n\n  if (StandardLinkOpts) {\n    PassManagerBuilder Builder;\n    Builder.Inliner = createFunctionInliningPass();\n    Builder.populateLTOPassManager(PM);\n  }\n\n  if (OptLevelO1 || OptLevelO2 || OptLevelO3) {\n    PassManagerBuilder Builder;\n    if (OptLevelO1)\n      Builder.Inliner = createAlwaysInlinerLegacyPass();\n    else if (OptLevelOs || OptLevelO2)\n      Builder.Inliner = createFunctionInliningPass(\n          2, OptLevelOs ? 1 : 0, false);\n    else\n      Builder.Inliner = createFunctionInliningPass(275);\n    Builder.populateFunctionPassManager(PM);\n    Builder.populateModulePassManager(PM);\n  }\n\n  for (const PassInfo *PI : PassList)\n    D.addPass(PI->getPassArgument());\n\n\/\/ Bugpoint has the ability of generating a plethora of core files, so to\n\/\/ avoid filling up the disk, we prevent it\n#ifndef DEBUG_BUGPOINT\n  sys::Process::PreventCoreFiles();\n#endif\n\n  if (Error E = D.run()) {\n    errs() << toString(std::move(E));\n    return 1;\n  }\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- cc1as_main.cpp - Clang Assembler  ---------------------------------===\/\/\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 is the entry point to the clang -cc1as functionality, which implements\n\/\/ the direct interface to the LLVM MC based assembler.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/Driver\/Arg.h\"\n#include \"clang\/Driver\/ArgList.h\"\n#include \"clang\/Driver\/DriverDiagnostic.h\"\n#include \"clang\/Driver\/CC1AsOptions.h\"\n#include \"clang\/Driver\/OptTable.h\"\n#include \"clang\/Driver\/Options.h\"\n#include \"clang\/Frontend\/DiagnosticOptions.h\"\n#include \"clang\/Frontend\/FrontendDiagnostic.h\"\n#include \"clang\/Frontend\/TextDiagnosticPrinter.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/ADT\/StringSwitch.h\"\n#include \"llvm\/MC\/MCParser\/MCAsmParser.h\"\n#include \"llvm\/MC\/MCAsmInfo.h\"\n#include \"llvm\/MC\/MCCodeEmitter.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/MCStreamer.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/Timer.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/System\/Host.h\"\n#include \"llvm\/System\/Path.h\"\n#include \"llvm\/System\/Signals.h\"\n#include \"llvm\/Target\/TargetAsmBackend.h\"\n#include \"llvm\/Target\/TargetAsmParser.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetSelect.h\"\nusing namespace clang;\nusing namespace clang::driver;\nusing namespace llvm;\n\nnamespace {\n\n\/\/\/ \\brief Helper class for representing a single invocation of the assembler.\nstruct AssemblerInvocation {\n  \/\/\/ @name Target Options\n  \/\/\/ @{\n\n  std::string Triple;\n\n  \/\/\/ @}\n  \/\/\/ @name Language Options\n  \/\/\/ @{\n\n  std::vector<std::string> IncludePaths;\n  unsigned NoInitialTextSection : 1;\n\n  \/\/\/ @}\n  \/\/\/ @name Frontend Options\n  \/\/\/ @{\n\n  std::string InputFile;\n  std::vector<std::string> LLVMArgs;\n  std::string OutputPath;\n  enum FileType {\n    FT_Asm,  \/\/\/< Assembly (.s) output, transliterate mode.\n    FT_Null, \/\/\/< No output, for timing purposes.\n    FT_Obj   \/\/\/< Object file output.\n  };\n  FileType OutputType;\n  unsigned ShowHelp : 1;\n  unsigned ShowVersion : 1;\n\n  \/\/\/ @}\n  \/\/\/ @name Transliterate Options\n  \/\/\/ @{\n\n  unsigned OutputAsmVariant;\n  unsigned ShowEncoding : 1;\n  unsigned ShowInst : 1;\n\n  \/\/\/ @}\n  \/\/\/ @name Assembler Options\n  \/\/\/ @{\n\n  unsigned RelaxAll : 1;\n\n  \/\/\/ @}\n\npublic:\n  AssemblerInvocation() {\n    Triple = \"\";\n    NoInitialTextSection = 0;\n    InputFile = \"-\";\n    OutputPath = \"-\";\n    OutputType = FT_Asm;\n    OutputAsmVariant = 0;\n    ShowInst = 0;\n    ShowEncoding = 0;\n    RelaxAll = 0;\n  }\n\n  static void CreateFromArgs(AssemblerInvocation &Res, const char **ArgBegin,\n                             const char **ArgEnd, Diagnostic &Diags);\n};\n\n}\n\nvoid AssemblerInvocation::CreateFromArgs(AssemblerInvocation &Opts,\n                                         const char **ArgBegin,\n                                         const char **ArgEnd,\n                                         Diagnostic &Diags) {\n  using namespace clang::driver::cc1asoptions;\n  \/\/ Parse the arguments.\n  OwningPtr<OptTable> OptTbl(createCC1AsOptTable());\n  unsigned MissingArgIndex, MissingArgCount;\n  OwningPtr<InputArgList> Args(\n    OptTbl->ParseArgs(ArgBegin, ArgEnd,MissingArgIndex, MissingArgCount));\n\n  \/\/ Check for missing argument error.\n  if (MissingArgCount)\n    Diags.Report(diag::err_drv_missing_argument)\n      << Args->getArgString(MissingArgIndex) << MissingArgCount;\n\n  \/\/ Issue errors on unknown arguments.\n  for (arg_iterator it = Args->filtered_begin(cc1asoptions::OPT_UNKNOWN),\n         ie = Args->filtered_end(); it != ie; ++it)\n    Diags.Report(diag::err_drv_unknown_argument) << (*it) ->getAsString(*Args);\n\n  \/\/ Construct the invocation.\n\n  \/\/ Target Options\n  Opts.Triple = Args->getLastArgValue(OPT_triple);\n  if (Opts.Triple.empty()) \/\/ Use the host triple if unspecified.\n    Opts.Triple = sys::getHostTriple();\n\n  \/\/ Language Options\n  Opts.IncludePaths = Args->getAllArgValues(OPT_I);\n  Opts.NoInitialTextSection = Args->hasArg(OPT_n);\n\n  \/\/ Frontend Options\n  if (Args->hasArg(OPT_INPUT)) {\n    bool First = true;\n    for (arg_iterator it = Args->filtered_begin(OPT_INPUT),\n           ie = Args->filtered_end(); it != ie; ++it, First=false) {\n      const Arg *A = it;\n      if (First)\n        Opts.InputFile = A->getValue(*Args);\n      else\n        Diags.Report(diag::err_drv_unknown_argument) << A->getAsString(*Args);\n    }\n  }\n  Opts.LLVMArgs = Args->getAllArgValues(OPT_mllvm);\n  Opts.OutputPath = Args->getLastArgValue(OPT_o);\n  if (Arg *A = Args->getLastArg(OPT_filetype)) {\n    StringRef Name = A->getValue(*Args);\n    unsigned OutputType = StringSwitch<unsigned>(Name)\n      .Case(\"asm\", FT_Asm)\n      .Case(\"null\", FT_Null)\n      .Case(\"obj\", FT_Obj)\n      .Default(~0U);\n    if (OutputType == ~0U)\n      Diags.Report(diag::err_drv_invalid_value)\n        << A->getAsString(*Args) << Name;\n    else\n      Opts.OutputType = FileType(OutputType);\n  }\n  Opts.ShowHelp = Args->hasArg(OPT_help);\n  Opts.ShowVersion = Args->hasArg(OPT_version);\n\n  \/\/ Transliterate Options\n  Opts.OutputAsmVariant = Args->getLastArgIntValue(OPT_output_asm_variant,\n                                                   0, Diags);\n  Opts.ShowEncoding = Args->hasArg(OPT_show_encoding);\n  Opts.ShowInst = Args->hasArg(OPT_show_inst);\n\n  \/\/ Assemble Options\n  Opts.RelaxAll = Args->hasArg(OPT_relax_all);\n}\n\nstatic formatted_raw_ostream *GetOutputStream(AssemblerInvocation &Opts,\n                                              Diagnostic &Diags,\n                                              bool Binary) {\n  if (Opts.OutputPath.empty())\n    Opts.OutputPath = \"-\";\n\n  \/\/ Make sure that the Out file gets unlinked from the disk if we get a\n  \/\/ SIGINT.\n  if (Opts.OutputPath != \"-\")\n    sys::RemoveFileOnSignal(sys::Path(Opts.OutputPath));\n\n  std::string Error;\n  raw_fd_ostream *Out =\n    new raw_fd_ostream(Opts.OutputPath.c_str(), Error,\n                       (Binary ? raw_fd_ostream::F_Binary : 0));\n  if (!Error.empty()) {\n    Diags.Report(diag::err_fe_unable_to_open_output)\n      << Opts.OutputPath << Error;\n    return 0;\n  }\n\n  return new formatted_raw_ostream(*Out, formatted_raw_ostream::DELETE_STREAM);\n}\n\nstatic bool ExecuteAssembler(AssemblerInvocation &Opts, Diagnostic &Diags) {\n  \/\/ Get the target specific parser.\n  std::string Error;\n  const Target *TheTarget(TargetRegistry::lookupTarget(Opts.Triple, Error));\n  if (!TheTarget) {\n    Diags.Report(diag::err_target_unknown_triple) << Opts.Triple;\n    return false;\n  }\n\n  MemoryBuffer *Buffer = MemoryBuffer::getFileOrSTDIN(Opts.InputFile, &Error);\n  if (Buffer == 0) {\n    Diags.Report(diag::err_fe_error_reading) << Opts.InputFile;\n    return false;\n  }\n\n  SourceMgr SrcMgr;\n\n  \/\/ Tell SrcMgr about this buffer, which is what the parser will pick up.\n  SrcMgr.AddNewSourceBuffer(Buffer, SMLoc());\n\n  \/\/ Record the location of the include directories so that the lexer can find\n  \/\/ it later.\n  SrcMgr.setIncludeDirs(Opts.IncludePaths);\n\n  OwningPtr<MCAsmInfo> MAI(TheTarget->createAsmInfo(Opts.Triple));\n  assert(MAI && \"Unable to create target asm info!\");\n\n  MCContext Ctx(*MAI);\n  bool IsBinary = Opts.OutputType == AssemblerInvocation::FT_Obj;\n  formatted_raw_ostream *Out = GetOutputStream(Opts, Diags, IsBinary);\n  if (!Out)\n    return false;\n\n  \/\/ FIXME: We shouldn't need to do this (and link in codegen).\n  OwningPtr<TargetMachine> TM(TheTarget->createTargetMachine(Opts.Triple, \"\"));\n  if (!TM) {\n    Diags.Report(diag::err_target_unknown_triple) << Opts.Triple;\n    return false;\n  }\n\n  OwningPtr<MCCodeEmitter> CE;\n  OwningPtr<MCStreamer> Str;\n  OwningPtr<TargetAsmBackend> TAB;\n\n  if (Opts.OutputType == AssemblerInvocation::FT_Asm) {\n    MCInstPrinter *IP =\n      TheTarget->createMCInstPrinter(Opts.OutputAsmVariant, *MAI);\n    if (Opts.ShowEncoding)\n      CE.reset(TheTarget->createCodeEmitter(*TM, Ctx));\n    Str.reset(createAsmStreamer(Ctx, *Out,TM->getTargetData()->isLittleEndian(),\n                                \/*asmverbose*\/true, IP, CE.get(),\n                                Opts.ShowInst));\n  } else if (Opts.OutputType == AssemblerInvocation::FT_Null) {\n    Str.reset(createNullStreamer(Ctx));\n  } else {\n    assert(Opts.OutputType == AssemblerInvocation::FT_Obj &&\n           \"Invalid file type!\");\n    CE.reset(TheTarget->createCodeEmitter(*TM, Ctx));\n    TAB.reset(TheTarget->createAsmBackend(Opts.Triple));\n    Str.reset(createMachOStreamer(Ctx, *TAB, *Out, CE.get(), Opts.RelaxAll));\n  }\n\n  OwningPtr<MCAsmParser> Parser(createMCAsmParser(*TheTarget, SrcMgr, Ctx,\n                                                  *Str.get(), *MAI));\n  OwningPtr<TargetAsmParser> TAP(TheTarget->createAsmParser(*Parser));\n  if (!TAP) {\n    Diags.Report(diag::err_target_unknown_triple) << Opts.Triple;\n    return false;\n  }\n\n  Parser->setTargetParser(*TAP.get());\n\n  bool Success = !Parser->Run(Opts.NoInitialTextSection);\n\n  \/\/ Close the output.\n  delete Out;\n\n  \/\/ Delete output on errors.\n  if (!Success && Opts.OutputPath != \"-\")\n    sys::Path(Opts.OutputPath).eraseFromDisk();\n\n  return Success;\n}\n\nstatic void LLVMErrorHandler(void *UserData, const std::string &Message) {\n  Diagnostic &Diags = *static_cast<Diagnostic*>(UserData);\n\n  Diags.Report(diag::err_fe_error_backend) << Message;\n\n  \/\/ We cannot recover from llvm errors.\n  exit(1);\n}\n\nint cc1as_main(const char **ArgBegin, const char **ArgEnd,\n               const char *Argv0, void *MainAddr) {\n  \/\/ Print a stack trace if we signal out.\n  sys::PrintStackTraceOnErrorSignal();\n  PrettyStackTraceProgram X(ArgEnd - ArgBegin, ArgBegin);\n  llvm_shutdown_obj Y;  \/\/ Call llvm_shutdown() on exit.\n\n  \/\/ Initialize targets and assembly printers\/parsers.\n  InitializeAllTargetInfos();\n  \/\/ FIXME: We shouldn't need to initialize the Target(Machine)s.\n  InitializeAllTargets();\n  InitializeAllAsmPrinters();\n  InitializeAllAsmParsers();\n\n  \/\/ Construct our diagnostic client.\n  TextDiagnosticPrinter DiagClient(errs(), DiagnosticOptions());\n  DiagClient.setPrefix(\"clang -cc1as\");\n  Diagnostic Diags(&DiagClient);\n\n  \/\/ Set an error handler, so that any LLVM backend diagnostics go through our\n  \/\/ error handler.\n  install_fatal_error_handler(LLVMErrorHandler,\n                                    static_cast<void*>(&Diags));\n\n  \/\/ Parse the arguments.\n  AssemblerInvocation Asm;\n  AssemblerInvocation::CreateFromArgs(Asm, ArgBegin, ArgEnd, Diags);\n\n  \/\/ Honor -help.\n  if (Asm.ShowHelp) {\n    llvm::OwningPtr<driver::OptTable> Opts(driver::createCC1AsOptTable());\n    Opts->PrintHelp(llvm::outs(), \"clang -cc1as\", \"Clang Integrated Assembler\");\n    return 0;\n  }\n\n  \/\/ Honor -version.\n  \/\/\n  \/\/ FIXME: Use a better -version message?\n  if (Asm.ShowVersion) {\n    llvm::cl::PrintVersionMessage();\n    return 0;\n  }\n\n  \/\/ Honor -mllvm.\n  \/\/\n  \/\/ FIXME: Remove this, one day.\n  if (!Asm.LLVMArgs.empty()) {\n    unsigned NumArgs = Asm.LLVMArgs.size();\n    const char **Args = new const char*[NumArgs + 2];\n    Args[0] = \"clang (LLVM option parsing)\";\n    for (unsigned i = 0; i != NumArgs; ++i)\n      Args[i + 1] = Asm.LLVMArgs[i].c_str();\n    Args[NumArgs + 1] = 0;\n    llvm::cl::ParseCommandLineOptions(NumArgs + 1, const_cast<char **>(Args));\n  }\n\n  \/\/ Execute the invocation, unless there were parsing errors.\n  bool Success = false;\n  if (!Diags.getNumErrors())\n    Success = ExecuteAssembler(Asm, Diags);\n\n  \/\/ If any timers were active but haven't been destroyed yet, print their\n  \/\/ results now.\n  TimerGroup::printAll(errs());\n\n  return !Success;\n}\n<commit_msg>Update for LLVM API change.<commit_after>\/\/===-- cc1as_main.cpp - Clang Assembler  ---------------------------------===\/\/\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 is the entry point to the clang -cc1as functionality, which implements\n\/\/ the direct interface to the LLVM MC based assembler.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/Driver\/Arg.h\"\n#include \"clang\/Driver\/ArgList.h\"\n#include \"clang\/Driver\/DriverDiagnostic.h\"\n#include \"clang\/Driver\/CC1AsOptions.h\"\n#include \"clang\/Driver\/OptTable.h\"\n#include \"clang\/Driver\/Options.h\"\n#include \"clang\/Frontend\/DiagnosticOptions.h\"\n#include \"clang\/Frontend\/FrontendDiagnostic.h\"\n#include \"clang\/Frontend\/TextDiagnosticPrinter.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/ADT\/StringSwitch.h\"\n#include \"llvm\/MC\/MCParser\/MCAsmParser.h\"\n#include \"llvm\/MC\/MCAsmInfo.h\"\n#include \"llvm\/MC\/MCCodeEmitter.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/MCStreamer.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/Timer.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/System\/Host.h\"\n#include \"llvm\/System\/Path.h\"\n#include \"llvm\/System\/Signals.h\"\n#include \"llvm\/Target\/TargetAsmBackend.h\"\n#include \"llvm\/Target\/TargetAsmParser.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetSelect.h\"\nusing namespace clang;\nusing namespace clang::driver;\nusing namespace llvm;\n\nnamespace {\n\n\/\/\/ \\brief Helper class for representing a single invocation of the assembler.\nstruct AssemblerInvocation {\n  \/\/\/ @name Target Options\n  \/\/\/ @{\n\n  std::string Triple;\n\n  \/\/\/ @}\n  \/\/\/ @name Language Options\n  \/\/\/ @{\n\n  std::vector<std::string> IncludePaths;\n  unsigned NoInitialTextSection : 1;\n\n  \/\/\/ @}\n  \/\/\/ @name Frontend Options\n  \/\/\/ @{\n\n  std::string InputFile;\n  std::vector<std::string> LLVMArgs;\n  std::string OutputPath;\n  enum FileType {\n    FT_Asm,  \/\/\/< Assembly (.s) output, transliterate mode.\n    FT_Null, \/\/\/< No output, for timing purposes.\n    FT_Obj   \/\/\/< Object file output.\n  };\n  FileType OutputType;\n  unsigned ShowHelp : 1;\n  unsigned ShowVersion : 1;\n\n  \/\/\/ @}\n  \/\/\/ @name Transliterate Options\n  \/\/\/ @{\n\n  unsigned OutputAsmVariant;\n  unsigned ShowEncoding : 1;\n  unsigned ShowInst : 1;\n\n  \/\/\/ @}\n  \/\/\/ @name Assembler Options\n  \/\/\/ @{\n\n  unsigned RelaxAll : 1;\n\n  \/\/\/ @}\n\npublic:\n  AssemblerInvocation() {\n    Triple = \"\";\n    NoInitialTextSection = 0;\n    InputFile = \"-\";\n    OutputPath = \"-\";\n    OutputType = FT_Asm;\n    OutputAsmVariant = 0;\n    ShowInst = 0;\n    ShowEncoding = 0;\n    RelaxAll = 0;\n  }\n\n  static void CreateFromArgs(AssemblerInvocation &Res, const char **ArgBegin,\n                             const char **ArgEnd, Diagnostic &Diags);\n};\n\n}\n\nvoid AssemblerInvocation::CreateFromArgs(AssemblerInvocation &Opts,\n                                         const char **ArgBegin,\n                                         const char **ArgEnd,\n                                         Diagnostic &Diags) {\n  using namespace clang::driver::cc1asoptions;\n  \/\/ Parse the arguments.\n  OwningPtr<OptTable> OptTbl(createCC1AsOptTable());\n  unsigned MissingArgIndex, MissingArgCount;\n  OwningPtr<InputArgList> Args(\n    OptTbl->ParseArgs(ArgBegin, ArgEnd,MissingArgIndex, MissingArgCount));\n\n  \/\/ Check for missing argument error.\n  if (MissingArgCount)\n    Diags.Report(diag::err_drv_missing_argument)\n      << Args->getArgString(MissingArgIndex) << MissingArgCount;\n\n  \/\/ Issue errors on unknown arguments.\n  for (arg_iterator it = Args->filtered_begin(cc1asoptions::OPT_UNKNOWN),\n         ie = Args->filtered_end(); it != ie; ++it)\n    Diags.Report(diag::err_drv_unknown_argument) << (*it) ->getAsString(*Args);\n\n  \/\/ Construct the invocation.\n\n  \/\/ Target Options\n  Opts.Triple = Args->getLastArgValue(OPT_triple);\n  if (Opts.Triple.empty()) \/\/ Use the host triple if unspecified.\n    Opts.Triple = sys::getHostTriple();\n\n  \/\/ Language Options\n  Opts.IncludePaths = Args->getAllArgValues(OPT_I);\n  Opts.NoInitialTextSection = Args->hasArg(OPT_n);\n\n  \/\/ Frontend Options\n  if (Args->hasArg(OPT_INPUT)) {\n    bool First = true;\n    for (arg_iterator it = Args->filtered_begin(OPT_INPUT),\n           ie = Args->filtered_end(); it != ie; ++it, First=false) {\n      const Arg *A = it;\n      if (First)\n        Opts.InputFile = A->getValue(*Args);\n      else\n        Diags.Report(diag::err_drv_unknown_argument) << A->getAsString(*Args);\n    }\n  }\n  Opts.LLVMArgs = Args->getAllArgValues(OPT_mllvm);\n  Opts.OutputPath = Args->getLastArgValue(OPT_o);\n  if (Arg *A = Args->getLastArg(OPT_filetype)) {\n    StringRef Name = A->getValue(*Args);\n    unsigned OutputType = StringSwitch<unsigned>(Name)\n      .Case(\"asm\", FT_Asm)\n      .Case(\"null\", FT_Null)\n      .Case(\"obj\", FT_Obj)\n      .Default(~0U);\n    if (OutputType == ~0U)\n      Diags.Report(diag::err_drv_invalid_value)\n        << A->getAsString(*Args) << Name;\n    else\n      Opts.OutputType = FileType(OutputType);\n  }\n  Opts.ShowHelp = Args->hasArg(OPT_help);\n  Opts.ShowVersion = Args->hasArg(OPT_version);\n\n  \/\/ Transliterate Options\n  Opts.OutputAsmVariant = Args->getLastArgIntValue(OPT_output_asm_variant,\n                                                   0, Diags);\n  Opts.ShowEncoding = Args->hasArg(OPT_show_encoding);\n  Opts.ShowInst = Args->hasArg(OPT_show_inst);\n\n  \/\/ Assemble Options\n  Opts.RelaxAll = Args->hasArg(OPT_relax_all);\n}\n\nstatic formatted_raw_ostream *GetOutputStream(AssemblerInvocation &Opts,\n                                              Diagnostic &Diags,\n                                              bool Binary) {\n  if (Opts.OutputPath.empty())\n    Opts.OutputPath = \"-\";\n\n  \/\/ Make sure that the Out file gets unlinked from the disk if we get a\n  \/\/ SIGINT.\n  if (Opts.OutputPath != \"-\")\n    sys::RemoveFileOnSignal(sys::Path(Opts.OutputPath));\n\n  std::string Error;\n  raw_fd_ostream *Out =\n    new raw_fd_ostream(Opts.OutputPath.c_str(), Error,\n                       (Binary ? raw_fd_ostream::F_Binary : 0));\n  if (!Error.empty()) {\n    Diags.Report(diag::err_fe_unable_to_open_output)\n      << Opts.OutputPath << Error;\n    return 0;\n  }\n\n  return new formatted_raw_ostream(*Out, formatted_raw_ostream::DELETE_STREAM);\n}\n\nstatic bool ExecuteAssembler(AssemblerInvocation &Opts, Diagnostic &Diags) {\n  \/\/ Get the target specific parser.\n  std::string Error;\n  const Target *TheTarget(TargetRegistry::lookupTarget(Opts.Triple, Error));\n  if (!TheTarget) {\n    Diags.Report(diag::err_target_unknown_triple) << Opts.Triple;\n    return false;\n  }\n\n  MemoryBuffer *Buffer = MemoryBuffer::getFileOrSTDIN(Opts.InputFile, &Error);\n  if (Buffer == 0) {\n    Diags.Report(diag::err_fe_error_reading) << Opts.InputFile;\n    return false;\n  }\n\n  SourceMgr SrcMgr;\n\n  \/\/ Tell SrcMgr about this buffer, which is what the parser will pick up.\n  SrcMgr.AddNewSourceBuffer(Buffer, SMLoc());\n\n  \/\/ Record the location of the include directories so that the lexer can find\n  \/\/ it later.\n  SrcMgr.setIncludeDirs(Opts.IncludePaths);\n\n  OwningPtr<MCAsmInfo> MAI(TheTarget->createAsmInfo(Opts.Triple));\n  assert(MAI && \"Unable to create target asm info!\");\n\n  MCContext Ctx(*MAI);\n  bool IsBinary = Opts.OutputType == AssemblerInvocation::FT_Obj;\n  formatted_raw_ostream *Out = GetOutputStream(Opts, Diags, IsBinary);\n  if (!Out)\n    return false;\n\n  \/\/ FIXME: We shouldn't need to do this (and link in codegen).\n  OwningPtr<TargetMachine> TM(TheTarget->createTargetMachine(Opts.Triple, \"\"));\n  if (!TM) {\n    Diags.Report(diag::err_target_unknown_triple) << Opts.Triple;\n    return false;\n  }\n\n  OwningPtr<MCCodeEmitter> CE;\n  OwningPtr<MCStreamer> Str;\n  OwningPtr<TargetAsmBackend> TAB;\n\n  if (Opts.OutputType == AssemblerInvocation::FT_Asm) {\n    MCInstPrinter *IP =\n      TheTarget->createMCInstPrinter(Opts.OutputAsmVariant, *MAI);\n    if (Opts.ShowEncoding)\n      CE.reset(TheTarget->createCodeEmitter(*TM, Ctx));\n    Str.reset(createAsmStreamer(Ctx, *Out,TM->getTargetData()->isLittleEndian(),\n                                \/*asmverbose*\/true, IP, CE.get(),\n                                Opts.ShowInst));\n  } else if (Opts.OutputType == AssemblerInvocation::FT_Null) {\n    Str.reset(createNullStreamer(Ctx));\n  } else {\n    assert(Opts.OutputType == AssemblerInvocation::FT_Obj &&\n           \"Invalid file type!\");\n    CE.reset(TheTarget->createCodeEmitter(*TM, Ctx));\n    TAB.reset(TheTarget->createAsmBackend(Opts.Triple));\n    Str.reset(createMachOStreamer(Ctx, *TAB, *Out, CE.get(), Opts.RelaxAll));\n  }\n\n  OwningPtr<MCAsmParser> Parser(createMCAsmParser(*TheTarget, SrcMgr, Ctx,\n                                                  *Str.get(), *MAI));\n  OwningPtr<TargetAsmParser> TAP(TheTarget->createAsmParser(*Parser, *TM));\n  if (!TAP) {\n    Diags.Report(diag::err_target_unknown_triple) << Opts.Triple;\n    return false;\n  }\n\n  Parser->setTargetParser(*TAP.get());\n\n  bool Success = !Parser->Run(Opts.NoInitialTextSection);\n\n  \/\/ Close the output.\n  delete Out;\n\n  \/\/ Delete output on errors.\n  if (!Success && Opts.OutputPath != \"-\")\n    sys::Path(Opts.OutputPath).eraseFromDisk();\n\n  return Success;\n}\n\nstatic void LLVMErrorHandler(void *UserData, const std::string &Message) {\n  Diagnostic &Diags = *static_cast<Diagnostic*>(UserData);\n\n  Diags.Report(diag::err_fe_error_backend) << Message;\n\n  \/\/ We cannot recover from llvm errors.\n  exit(1);\n}\n\nint cc1as_main(const char **ArgBegin, const char **ArgEnd,\n               const char *Argv0, void *MainAddr) {\n  \/\/ Print a stack trace if we signal out.\n  sys::PrintStackTraceOnErrorSignal();\n  PrettyStackTraceProgram X(ArgEnd - ArgBegin, ArgBegin);\n  llvm_shutdown_obj Y;  \/\/ Call llvm_shutdown() on exit.\n\n  \/\/ Initialize targets and assembly printers\/parsers.\n  InitializeAllTargetInfos();\n  \/\/ FIXME: We shouldn't need to initialize the Target(Machine)s.\n  InitializeAllTargets();\n  InitializeAllAsmPrinters();\n  InitializeAllAsmParsers();\n\n  \/\/ Construct our diagnostic client.\n  TextDiagnosticPrinter DiagClient(errs(), DiagnosticOptions());\n  DiagClient.setPrefix(\"clang -cc1as\");\n  Diagnostic Diags(&DiagClient);\n\n  \/\/ Set an error handler, so that any LLVM backend diagnostics go through our\n  \/\/ error handler.\n  install_fatal_error_handler(LLVMErrorHandler,\n                                    static_cast<void*>(&Diags));\n\n  \/\/ Parse the arguments.\n  AssemblerInvocation Asm;\n  AssemblerInvocation::CreateFromArgs(Asm, ArgBegin, ArgEnd, Diags);\n\n  \/\/ Honor -help.\n  if (Asm.ShowHelp) {\n    llvm::OwningPtr<driver::OptTable> Opts(driver::createCC1AsOptTable());\n    Opts->PrintHelp(llvm::outs(), \"clang -cc1as\", \"Clang Integrated Assembler\");\n    return 0;\n  }\n\n  \/\/ Honor -version.\n  \/\/\n  \/\/ FIXME: Use a better -version message?\n  if (Asm.ShowVersion) {\n    llvm::cl::PrintVersionMessage();\n    return 0;\n  }\n\n  \/\/ Honor -mllvm.\n  \/\/\n  \/\/ FIXME: Remove this, one day.\n  if (!Asm.LLVMArgs.empty()) {\n    unsigned NumArgs = Asm.LLVMArgs.size();\n    const char **Args = new const char*[NumArgs + 2];\n    Args[0] = \"clang (LLVM option parsing)\";\n    for (unsigned i = 0; i != NumArgs; ++i)\n      Args[i + 1] = Asm.LLVMArgs[i].c_str();\n    Args[NumArgs + 1] = 0;\n    llvm::cl::ParseCommandLineOptions(NumArgs + 1, const_cast<char **>(Args));\n  }\n\n  \/\/ Execute the invocation, unless there were parsing errors.\n  bool Success = false;\n  if (!Diags.getNumErrors())\n    Success = ExecuteAssembler(Asm, Diags);\n\n  \/\/ If any timers were active but haven't been destroyed yet, print their\n  \/\/ results now.\n  TimerGroup::printAll(errs());\n\n  return !Success;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <hir\/hir.hpp>\n#include <hir\/item_path.hpp>\n#include <hir\/main_bindings.hpp>\n#include <macro_rules\/macro_rules.hpp>\n#include <mir\/mir.hpp>\n#include <mir\/operations.hpp>   \/\/ MIR_Dump_Fcn\n\nint g_debug_indent_level = 0;\n\nstruct Args\n{\n    Args(int argc, const char* const argv[]);\n\n    ::std::string   infile;\n};\n\nstruct Dumper\n{\n    struct Filters {\n        struct Types {\n            bool    macros = true;\n            bool    functions = true;\n            bool    statics = true;\n            bool    types = true;\n            bool    traits = true;\n        } types;\n        bool public_only = false;\n        bool no_body = false;\n    } filters;\n\n    void dump_crate(const char* name, const ::HIR::Crate& crate) const;\n    void dump_module(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Module& mod) const;\n    void dump_function(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Function& fcn, int indent=0) const;\n    void dump_trait(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Trait& trait, int indent=0) const;\n};\n\nint main(int argc, const char* argv[])\n{\n    Args    args(argc, argv);\n    Dumper  dumper;\n\n    dumper.filters.types.functions = true;\n\n    auto hir = HIR_Deserialise(args.infile);\n    dumper.dump_crate(\"\", *hir);\n}\nnamespace {\n    template<typename T, typename Fcn>\n    void dump_impl_group(const ::HIR::Crate::ImplGroup<T>& ig, Fcn cb)\n    {\n        for(const auto& named_il : ig.named)\n        {\n            for(const auto& impl : named_il.second)\n            {\n                cb(*impl);\n            }\n        }\n        for(const auto& impl : ig.non_named)\n        {\n            cb(*impl);\n        }\n        for(const auto& impl : ig.generic)\n        {\n            cb(*impl);\n        }\n    }\n}\nvoid Dumper::dump_crate(const char* name, const ::HIR::Crate& crate) const\n{\n    \/\/ Dump macros\n    for(const auto& mac : crate.m_exported_macros)\n    {\n        ::std::cout << \"macro_rules! \" << mac.first << \"{\" << std::endl;\n        for(const auto& arm : mac.second->m_rules)\n        {\n            ::std::cout << \"    (\";\n            for(const auto& pat : arm.m_pattern)\n            {\n                TU_MATCH_HDRA( (pat), {)\n                TU_ARMA(End, e)\n                    ::std::cout << \" EOS\";\n                TU_ARMA(LoopStart, e)\n                    ::std::cout << \" (\";\n                TU_ARMA(LoopNext, e)\n                    ::std::cout << \" ^\";\n                TU_ARMA(LoopEnd, e)\n                    ::std::cout << \" )\";\n                TU_ARMA(Jump, e)\n                    ::std::cout << \" <\" << e.jump_target;\n                TU_ARMA(ExpectTok, e)\n                    ::std::cout << \" =\" << e;\n                TU_ARMA(ExpectPat, e)\n                    ::std::cout << \" \" << e.idx << \"=\" << e.type;\n                TU_ARMA(If, e) {\n                    ::std::cout << \" ?\" << (e.is_equal ? \"\" : \"!\") << \"{\";\n                    for(const auto& ent : e.ents) {\n                        if(ent.ty == MacroPatEnt::PAT_TOKEN)\n                            ::std::cout << \" =\" << ent.tok;\n                        else\n                            ::std::cout << \" \" << ent.ty;\n                    }\n                    ::std::cout << \"}->\" << e.jump_target;\n                    }\n                }\n            }\n            ::std::cout << \" ) => {\\n\";\n            \/\/ TODO: Macro expansion\n            ::std::cout << \"    }\\n\";\n        }\n        ::std::cout << \"}\\n\";\n        ::std::cout << ::std::endl;\n    }\n\n    this->dump_module(::HIR::ItemPath(name), ::HIR::Publicity::new_global(), crate.m_root_module);\n\n    for(const auto& i : crate.m_trait_impls)\n    {\n        dump_impl_group(i.second, [&](const ::HIR::TraitImpl& ti) {\n            auto root_ip = ::HIR::ItemPath(ti.m_type, i.first, ti.m_trait_args);\n            ::std::cout << \"impl\" << ti.m_params.fmt_args() << \" \" << i.first << ti.m_trait_args << \" for \" << ti.m_type << \"\\n\";\n            ::std::cout << \"  where\" << ti.m_params.fmt_bounds() << \"\\n\";\n            ::std::cout << \"{\" << ::std::endl;\n            if( this->filters.types.functions )\n            {\n                for(const auto& m : ti.m_methods)\n                {\n                    this->dump_function(root_ip + m.first, ::HIR::Publicity::new_global(), m.second.data, 1);\n                }\n            }\n            ::std::cout << \"}\" << ::std::endl;\n        });\n    }\n\n    dump_impl_group(crate.m_type_impls, [&](const auto& i) {\n        auto root_ip = ::HIR::ItemPath(i.m_type);\n        ::std::cout << \"impl\" << i.m_params.fmt_args() << \" \" << i.m_type << \"\\n\";\n        ::std::cout << \"  where\" << i.m_params.fmt_bounds() << \"\\n\";\n        ::std::cout << \"{\" << ::std::endl;\n        if( this->filters.types.functions )\n        {\n            for(const auto& m : i.m_methods)\n            {\n                this->dump_function(root_ip + m.first, ::HIR::Publicity::new_global(), m.second.data, 1);\n            }\n        }\n        ::std::cout << \"}\" << ::std::endl;\n    });\n}\nvoid Dumper::dump_module(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Module& mod) const\n{\n    if( !filters.public_only && !pub.is_global() )\n    {\n        return ;\n    }\n    ::std::cout << \"\/\/ mod \" << ip << ::std::endl;\n    for(const auto& i : mod.m_mod_items)\n    {\n        auto sub_ip = ip + i.first;\n        \/\/::std::cout << \"\/\/ \" << i.second->ent.tagstr() << \" \" << sub_ip << \"\\n\";\n        TU_MATCH_HDRA( (i.second->ent), {)\n        TU_ARMA(Module, e) {\n            this->dump_module(sub_ip, i.second->publicity, e);\n            }\n        TU_ARMA(Import, e) {\n            \/\/this->dump_mod_import(sub_ip, e);\n            }\n        TU_ARMA(TypeAlias, e) {\n            \/\/this->dump_type_alias(sub_ip, e);\n            }\n        TU_ARMA(ExternType, e) {\n            \/\/this->dump_ext_type(sub_ip, e);\n            }\n        TU_ARMA(Enum, e) {\n            \/\/this->dump_enum(sub_ip, e);\n            }\n        TU_ARMA(Struct, e) {\n            \/\/this->dump_enum(sub_ip, e);\n            }\n        TU_ARMA(Union, e) {\n            \/\/this->dump_trait(sub_ip, e);\n            }\n        TU_ARMA(Trait, e) {\n            this->dump_trait(sub_ip, i.second->publicity, e);\n            }\n        }\n    }\n    for(const auto& i : mod.m_value_items)\n    {\n        auto sub_ip = ip + i.first;\n        \/\/::std::cout << \"\/\/ \" << i.second->ent.tagstr() << \" \" << sub_ip << \"\\n\";\n        TU_MATCH_HDRA( (i.second->ent), {)\n        TU_ARMA(Import, e) {\n            \/\/this->dump_val_import(sub_ip, e);\n            }\n        TU_ARMA(Constant, e) {\n            \/\/this->dump_constant(sub_ip, e);\n            }\n        TU_ARMA(Static, e) {\n            \/\/this->dump_constant(sub_ip, e);\n            }\n        TU_ARMA(StructConstant, e) {\n            \/\/this->dump_constant(sub_ip, e);\n            }\n        TU_ARMA(StructConstructor, e) {\n            \/\/this->dump_constant(sub_ip, e);\n            }\n        TU_ARMA(Function, e) {\n            this->dump_function(sub_ip, i.second->publicity, e);\n            }\n        }\n    }\n}\nvoid Dumper::dump_function(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Function& fcn, int nindent\/*=0*\/) const\n{\n    auto indent = RepeatLitStr { \"   \", nindent };\n    if( !this->filters.types.functions ) {\n        return ;\n    }\n    if( !filters.public_only && !pub.is_global() ) {\n        return ;\n    }\n    ::std::cout << indent << \"fn \" << ip << fcn.m_params.fmt_args() << \"(\";\n    ::std::cout << \" )\";\n    if( fcn.m_code.m_mir )\n    {\n        ::std::cout << \"\\n\";\n        ::std::cout << indent << \"{\\n\";\n        if( filters.no_body ) {\n            ::std::cout << indent << \"...\\n\";\n        }\n        else {\n            MIR_Dump_Fcn(::std::cout, *fcn.m_code.m_mir, nindent+1);\n        }\n        ::std::cout << indent << \"}\\n\";\n        ::std::cout << ::std::endl;\n    }\n    else\n    {\n        ::std::cout << \";\" << ::std::endl;\n    }\n}\nvoid Dumper::dump_trait(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Trait& trait, int nindent\/*=0*\/) const\n{\n    auto indent = RepeatLitStr { \"   \", nindent };\n    if( !this->filters.types.functions ) {\n        return ;\n    }\n    if( !filters.public_only && !pub.is_global() ) {\n        return ;\n    }\n    ::std::cout << indent << \"trait \" << ip << trait.m_params.fmt_args() << \"\\n\";\n    ::std::cout << indent << \"{\\n\";\n    auto indent2 = RepeatLitStr { \"   \", nindent+1 };\n    \/\/ ...\n    ::std::cout << indent << \"}\\n\";\n    ::std::cout << ::std::endl;\n}\n\nbool debug_enabled()\n{\n    return false;\n}\n::std::ostream& debug_output(int indent, const char* function)\n{\n    return ::std::cout << \"- \" << RepeatLitStr { \" \", indent } << function << \": \";\n}\n\nArgs::Args(int argc, const char* const argv[])\n{\n    this->infile = argv[1];\n}\n\n\/\/ TODO: This is copy-pasted from src\/main.cpp, should live somewhere better\n::std::ostream& operator<<(::std::ostream& os, const FmtEscaped& x)\n{\n    os << ::std::hex;\n    for(auto s = x.s; *s != '\\0'; s ++)\n    {\n        switch(*s)\n        {\n        case '\\0':  os << \"\\\\0\";    break;\n        case '\\n':  os << \"\\\\n\";    break;\n        case '\\\\':  os << \"\\\\\\\\\";   break;\n        case '\"':   os << \"\\\\\\\"\";   break;\n        default:\n            uint8_t v = *s;\n            if( v < 0x80 )\n            {\n                if( v < ' ' || v > 0x7F )\n                    os << \"\\\\u{\" << ::std::hex << (unsigned int)v << \"}\";\n                else\n                    os << v;\n            }\n            else if( v < 0xC0 )\n                ;\n            else if( v < 0xE0 )\n            {\n                uint32_t    val = (uint32_t)(v & 0x1F) << 6;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 6;\n                os << \"\\\\u{\" << ::std::hex << val << \"}\";\n            }\n            else if( v < 0xF0 )\n            {\n                uint32_t    val = (uint32_t)(v & 0x0F) << 12;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 12;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 6;\n                os << \"\\\\u{\" << ::std::hex << val << \"}\";\n            }\n            else if( v < 0xF8 )\n            {\n                uint32_t    val = (uint32_t)(v & 0x07) << 18;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 18;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 12;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 6;\n                os << \"\\\\u{\" << ::std::hex << val << \"}\";\n            }\n            break;\n        }\n    }\n    os << ::std::dec;\n    return os;\n}\n\nMIR::EnumCachePtr::~EnumCachePtr()\n{\n    assert(!this->p);\n}\n<commit_msg>dump_hirfile - Fix publicity handling<commit_after>#include <hir\/hir.hpp>\n#include <hir\/item_path.hpp>\n#include <hir\/main_bindings.hpp>\n#include <macro_rules\/macro_rules.hpp>\n#include <mir\/mir.hpp>\n#include <mir\/operations.hpp>   \/\/ MIR_Dump_Fcn\n\nint g_debug_indent_level = 0;\n\nstruct Args\n{\n    Args(int argc, const char* const argv[]);\n\n    ::std::string   infile;\n};\n\nstruct Dumper\n{\n    struct Filters {\n        struct Types {\n            bool    macros = true;\n            bool    functions = true;\n            bool    statics = true;\n            bool    types = true;\n            bool    traits = true;\n        } types;\n        bool public_only = false;\n        bool no_body = false;\n    } filters;\n\n    void dump_crate(const char* name, const ::HIR::Crate& crate) const;\n    void dump_module(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Module& mod) const;\n    void dump_function(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Function& fcn, int indent=0) const;\n    void dump_trait(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Trait& trait, int indent=0) const;\n};\n\nint main(int argc, const char* argv[])\n{\n    Args    args(argc, argv);\n    Dumper  dumper;\n\n    dumper.filters.types.functions = true;\n\n    auto hir = HIR_Deserialise(args.infile);\n    dumper.dump_crate(\"\", *hir);\n}\nnamespace {\n    template<typename T, typename Fcn>\n    void dump_impl_group(const ::HIR::Crate::ImplGroup<T>& ig, Fcn cb)\n    {\n        for(const auto& named_il : ig.named)\n        {\n            for(const auto& impl : named_il.second)\n            {\n                cb(*impl);\n            }\n        }\n        for(const auto& impl : ig.non_named)\n        {\n            cb(*impl);\n        }\n        for(const auto& impl : ig.generic)\n        {\n            cb(*impl);\n        }\n    }\n}\nvoid Dumper::dump_crate(const char* name, const ::HIR::Crate& crate) const\n{\n    \/\/ Dump macros\n    for(const auto& mac : crate.m_exported_macros)\n    {\n        ::std::cout << \"macro_rules! \" << mac.first << \"{\" << std::endl;\n        for(const auto& arm : mac.second->m_rules)\n        {\n            ::std::cout << \"    (\";\n            for(const auto& pat : arm.m_pattern)\n            {\n                TU_MATCH_HDRA( (pat), {)\n                TU_ARMA(End, e)\n                    ::std::cout << \" EOS\";\n                TU_ARMA(LoopStart, e)\n                    ::std::cout << \" (\";\n                TU_ARMA(LoopNext, e)\n                    ::std::cout << \" ^\";\n                TU_ARMA(LoopEnd, e)\n                    ::std::cout << \" )\";\n                TU_ARMA(Jump, e)\n                    ::std::cout << \" <\" << e.jump_target;\n                TU_ARMA(ExpectTok, e)\n                    ::std::cout << \" =\" << e;\n                TU_ARMA(ExpectPat, e)\n                    ::std::cout << \" \" << e.idx << \"=\" << e.type;\n                TU_ARMA(If, e) {\n                    ::std::cout << \" ?\" << (e.is_equal ? \"\" : \"!\") << \"{\";\n                    for(const auto& ent : e.ents) {\n                        if(ent.ty == MacroPatEnt::PAT_TOKEN)\n                            ::std::cout << \" =\" << ent.tok;\n                        else\n                            ::std::cout << \" \" << ent.ty;\n                    }\n                    ::std::cout << \"}->\" << e.jump_target;\n                    }\n                }\n            }\n            ::std::cout << \" ) => {\\n\";\n            \/\/ TODO: Macro expansion\n            ::std::cout << \"    }\\n\";\n        }\n        ::std::cout << \"}\\n\";\n        ::std::cout << ::std::endl;\n    }\n\n    this->dump_module(::HIR::ItemPath(name), ::HIR::Publicity::new_global(), crate.m_root_module);\n\n    for(const auto& i : crate.m_trait_impls)\n    {\n        dump_impl_group(i.second, [&](const ::HIR::TraitImpl& ti) {\n            auto root_ip = ::HIR::ItemPath(ti.m_type, i.first, ti.m_trait_args);\n            ::std::cout << \"impl\" << ti.m_params.fmt_args() << \" \" << i.first << ti.m_trait_args << \" for \" << ti.m_type << \"\\n\";\n            ::std::cout << \"  where\" << ti.m_params.fmt_bounds() << \"\\n\";\n            ::std::cout << \"{\" << ::std::endl;\n            if( this->filters.types.functions )\n            {\n                for(const auto& m : ti.m_methods)\n                {\n                    this->dump_function(root_ip + m.first, ::HIR::Publicity::new_global(), m.second.data, 1);\n                }\n            }\n            ::std::cout << \"}\" << ::std::endl;\n        });\n    }\n\n    dump_impl_group(crate.m_type_impls, [&](const auto& i) {\n        auto root_ip = ::HIR::ItemPath(i.m_type);\n        ::std::cout << \"impl\" << i.m_params.fmt_args() << \" \" << i.m_type << \"\\n\";\n        ::std::cout << \"  where\" << i.m_params.fmt_bounds() << \"\\n\";\n        ::std::cout << \"{\" << ::std::endl;\n        if( this->filters.types.functions )\n        {\n            for(const auto& m : i.m_methods)\n            {\n                this->dump_function(root_ip + m.first, ::HIR::Publicity::new_global(), m.second.data, 1);\n            }\n        }\n        ::std::cout << \"}\" << ::std::endl;\n    });\n}\nvoid Dumper::dump_module(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Module& mod) const\n{\n    if( filters.public_only && !pub.is_global() )\n    {\n        return ;\n    }\n    ::std::cout << \"\/\/ mod \" << ip << ::std::endl;\n    for(const auto& i : mod.m_mod_items)\n    {\n        auto sub_ip = ip + i.first;\n        \/\/::std::cout << \"\/\/ \" << i.second->ent.tagstr() << \" \" << sub_ip << \"\\n\";\n        TU_MATCH_HDRA( (i.second->ent), {)\n        TU_ARMA(Module, e) {\n            this->dump_module(sub_ip, i.second->publicity, e);\n            }\n        TU_ARMA(Import, e) {\n            \/\/this->dump_mod_import(sub_ip, e);\n            }\n        TU_ARMA(TypeAlias, e) {\n            \/\/this->dump_type_alias(sub_ip, e);\n            }\n        TU_ARMA(ExternType, e) {\n            \/\/this->dump_ext_type(sub_ip, e);\n            }\n        TU_ARMA(Enum, e) {\n            \/\/this->dump_enum(sub_ip, e);\n            }\n        TU_ARMA(Struct, e) {\n            \/\/this->dump_enum(sub_ip, e);\n            }\n        TU_ARMA(Union, e) {\n            \/\/this->dump_trait(sub_ip, e);\n            }\n        TU_ARMA(Trait, e) {\n            this->dump_trait(sub_ip, i.second->publicity, e);\n            }\n        }\n    }\n    for(const auto& i : mod.m_value_items)\n    {\n        auto sub_ip = ip + i.first;\n        \/\/::std::cout << \"\/\/ \" << i.second->ent.tagstr() << \" \" << sub_ip << \"\\n\";\n        TU_MATCH_HDRA( (i.second->ent), {)\n        TU_ARMA(Import, e) {\n            \/\/this->dump_val_import(sub_ip, e);\n            }\n        TU_ARMA(Constant, e) {\n            \/\/this->dump_constant(sub_ip, e);\n            }\n        TU_ARMA(Static, e) {\n            \/\/this->dump_constant(sub_ip, e);\n            }\n        TU_ARMA(StructConstant, e) {\n            \/\/this->dump_constant(sub_ip, e);\n            }\n        TU_ARMA(StructConstructor, e) {\n            \/\/this->dump_constant(sub_ip, e);\n            }\n        TU_ARMA(Function, e) {\n            this->dump_function(sub_ip, i.second->publicity, e);\n            }\n        }\n    }\n}\nvoid Dumper::dump_function(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Function& fcn, int nindent\/*=0*\/) const\n{\n    auto indent = RepeatLitStr { \"   \", nindent };\n    if( !this->filters.types.functions ) {\n        return ;\n    }\n    if( filters.public_only && !pub.is_global() ) {\n        return ;\n    }\n    ::std::cout << indent << \"fn \" << ip << fcn.m_params.fmt_args() << \"(\";\n    ::std::cout << \" )\";\n    if( fcn.m_code.m_mir )\n    {\n        ::std::cout << \"\\n\";\n        ::std::cout << indent << \"{\\n\";\n        if( filters.no_body ) {\n            ::std::cout << indent << \"...\\n\";\n        }\n        else {\n            MIR_Dump_Fcn(::std::cout, *fcn.m_code.m_mir, nindent+1);\n        }\n        ::std::cout << indent << \"}\\n\";\n        ::std::cout << ::std::endl;\n    }\n    else\n    {\n        ::std::cout << \";\" << ::std::endl;\n    }\n}\nvoid Dumper::dump_trait(::HIR::ItemPath ip, const ::HIR::Publicity& pub, const ::HIR::Trait& trait, int nindent\/*=0*\/) const\n{\n    auto indent = RepeatLitStr { \"   \", nindent };\n    if( !this->filters.types.functions ) {\n        return ;\n    }\n    if( !filters.public_only && !pub.is_global() ) {\n        return ;\n    }\n    ::std::cout << indent << \"trait \" << ip << trait.m_params.fmt_args() << \"\\n\";\n    ::std::cout << indent << \"{\\n\";\n    auto indent2 = RepeatLitStr { \"   \", nindent+1 };\n    \/\/ ...\n    ::std::cout << indent << \"}\\n\";\n    ::std::cout << ::std::endl;\n}\n\nbool debug_enabled()\n{\n    return false;\n}\n::std::ostream& debug_output(int indent, const char* function)\n{\n    return ::std::cout << \"- \" << RepeatLitStr { \" \", indent } << function << \": \";\n}\n\nArgs::Args(int argc, const char* const argv[])\n{\n    this->infile = argv[1];\n}\n\n\/\/ TODO: This is copy-pasted from src\/main.cpp, should live somewhere better\n::std::ostream& operator<<(::std::ostream& os, const FmtEscaped& x)\n{\n    os << ::std::hex;\n    for(auto s = x.s; *s != '\\0'; s ++)\n    {\n        switch(*s)\n        {\n        case '\\0':  os << \"\\\\0\";    break;\n        case '\\n':  os << \"\\\\n\";    break;\n        case '\\\\':  os << \"\\\\\\\\\";   break;\n        case '\"':   os << \"\\\\\\\"\";   break;\n        default:\n            uint8_t v = *s;\n            if( v < 0x80 )\n            {\n                if( v < ' ' || v > 0x7F )\n                    os << \"\\\\u{\" << ::std::hex << (unsigned int)v << \"}\";\n                else\n                    os << v;\n            }\n            else if( v < 0xC0 )\n                ;\n            else if( v < 0xE0 )\n            {\n                uint32_t    val = (uint32_t)(v & 0x1F) << 6;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 6;\n                os << \"\\\\u{\" << ::std::hex << val << \"}\";\n            }\n            else if( v < 0xF0 )\n            {\n                uint32_t    val = (uint32_t)(v & 0x0F) << 12;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 12;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 6;\n                os << \"\\\\u{\" << ::std::hex << val << \"}\";\n            }\n            else if( v < 0xF8 )\n            {\n                uint32_t    val = (uint32_t)(v & 0x07) << 18;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 18;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 12;\n                v = (uint8_t)*++s; if( (v & 0xC0) != 0x80 ) { s--; continue ; } val |= (uint32_t)v << 6;\n                os << \"\\\\u{\" << ::std::hex << val << \"}\";\n            }\n            break;\n        }\n    }\n    os << ::std::dec;\n    return os;\n}\n\nMIR::EnumCachePtr::~EnumCachePtr()\n{\n    assert(!this->p);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 2011  Lasath Fernando <kde@lasath.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 \"conversations-model.h\"\n#include \"conversation.h\"\n#include \"conversation-target.h\"\n#include \"messages-model.h\"\n#include \"channel-delegator.h\"\n\n#include <KDebug>\n\n#include <TelepathyQt\/ChannelClassSpec>\n#include <TelepathyQt\/TextChannel>\n#include <TelepathyQt\/ClientRegistrar>\n\nstatic inline Tp::ChannelClassSpecList channelClassList()\n{\n    return Tp::ChannelClassSpecList() << Tp::ChannelClassSpec::textChat();\n}\n\nclass ConversationsModel::ConversationsModelPrivate\n{\n  public:\n    QList<Conversation*> conversations;\n};\n\nConversationsModel::ConversationsModel(QObject *parent) :\n        QAbstractListModel(parent),\n        Tp::AbstractClientHandler(channelClassList()),\n        d(new ConversationsModelPrivate)\n{\n    QHash<int, QByteArray> roles;\n    roles[ConversationRole] = \"conversation\";\n    setRoleNames(roles);\n    connect(this, SIGNAL(rowsInserted(QModelIndex,int,int)), SIGNAL(totalUnreadCountChanged()));\n    connect(this, SIGNAL(rowsRemoved(QModelIndex,int,int)), SIGNAL(totalUnreadCountChanged()));\n}\n\nConversationsModel::~ConversationsModel()\n{\n    delete d;\n}\n\nQVariant ConversationsModel::data(const QModelIndex &index, int role) const\n{\n    QVariant result;\n    if (index.isValid()) {\n        if (role == ConversationRole) {\n            result = QVariant::fromValue<Conversation*>(d->conversations[index.row()]);\n            kDebug() << \"returning value \" << result;\n        }\n    }\n    return result;\n}\n\nint ConversationsModel::rowCount(const QModelIndex &parent) const\n{\n    Q_UNUSED(parent);\n    return d->conversations.count();\n}\n\nvoid ConversationsModel::handleChannels(const Tp::MethodInvocationContextPtr<> &context,\n                                        const Tp::AccountPtr &account,\n                                        const Tp::ConnectionPtr &connection,\n                                        const QList<Tp::ChannelPtr> &channels,\n                                        const QList<Tp::ChannelRequestPtr> &channelRequests,\n                                        const QDateTime &userActionTime,\n                                        const HandlerInfo &handlerInfo)\n{\n    Q_UNUSED(connection);\n    Q_UNUSED(handlerInfo);\n\n    bool handled = false;\n    bool shouldDelegate = false;\n\n    \/\/check that the channel is of type text\n    Tp::TextChannelPtr textChannel;\n    Q_FOREACH(const Tp::ChannelPtr &channel, channels) {\n        textChannel = Tp::TextChannelPtr::dynamicCast(channel);\n        if (textChannel) {\n            break;\n        }\n    }\n\n    Q_ASSERT(textChannel);\n\n\n    \/\/find the relevant channelRequest\n    Q_FOREACH(const Tp::ChannelRequestPtr channelRequest, channelRequests) {\n        kDebug() << channelRequest->hints().allHints();\n        shouldDelegate = channelRequest->hints().hint(QLatin1String(\"org.freedesktop.Telepathy.ChannelRequest\"), QLatin1String(\"DelegateToPreferredHandler\")).toBool();\n    }\n\n\n    \/\/loop through all conversations checking for matches\n\n    \/\/if we are handling and we're not told to delegate it, update the text channel\n    \/\/if we are handling but should delegate, call delegate channel\n    Q_FOREACH(Conversation *convo, d->conversations) {\n        if (convo->target()->id() == textChannel->targetId() &&\n                convo->messages()->textChannel()->targetHandleType() == textChannel->targetHandleType())\n        {\n            if (!shouldDelegate) {\n                convo->messages()->setTextChannel(textChannel);\n            } else {\n                if (convo->messages()->textChannel() == textChannel) {\n                    ChannelDelegator::delegateChannel(account, textChannel, userActionTime);\n                }\n            }\n            handled = true;\n            break;\n        }\n    }\n\n    \/\/if we are not handling channel already and should not delegate, add the conversation\n    \/\/if we not handling the channel but should delegate it, do nothing.\n\n    if (!handled && !shouldDelegate) {\n        beginInsertRows(QModelIndex(), rowCount(), rowCount());\n        Conversation *newConvo = new Conversation(textChannel, account, this);\n        d->conversations.append(newConvo);\n        connect(newConvo, SIGNAL(validityChanged(bool)), SLOT(handleValidityChange(bool)));\n        connect(newConvo, SIGNAL(conversationDelegated()), SLOT(conversationDelegated()));\n        connect(newConvo->messages(), SIGNAL(unreadCountChanged(int)), SIGNAL(unreadCountChanged()));\n        endInsertRows();\n        context->setFinished();\n    }\n\n}\n\nbool ConversationsModel::bypassApproval() const\n{\n    return true;\n}\n\nvoid ConversationsModel::startChat(const Tp::AccountPtr &account, const KTp::ContactPtr &contact)\n{\n    Q_ASSERT(account);\n    account->ensureTextChat(contact, QDateTime::currentDateTime(),\n                            QLatin1String(\"org.freedesktop.Telepathy.Client.KDE.TextUi.ConversationWatcher\"));\n}\n\nvoid ConversationsModel::handleValidityChange(bool valid)\n{\n    if (!valid) {\n        removeConversation(qobject_cast<Conversation*>(QObject::sender()));\n    }\n}\n\nvoid ConversationsModel::conversationDelegated()\n{\n    removeConversation(qobject_cast<Conversation*>(QObject::sender()));\n}\n\nvoid ConversationsModel::removeConversation(Conversation* conv)\n{\n    int index = d->conversations.indexOf(conv);\n    if (index != -1) {\n        beginRemoveRows(QModelIndex(), index, index);\n        d->conversations.removeAt(index);\n        conv->deleteLater();\n        endRemoveRows();\n    } else {\n        kError() << \"attempting to delete non-existent conversation\";\n    }\n}\n\nint ConversationsModel::nextActiveConversation(int fromRow)\n{\n    if(d->conversations.isEmpty()) {\n        return -1;\n    }\n    Q_ASSERT(qBound(0, fromRow, d->conversations.count()-1) == fromRow);\n\n    bool first = true; \/\/let first be checked on the first loop\n    for(int i = fromRow; i != fromRow || first; i = (i + 1) % d->conversations.count()) {\n        if(d->conversations[i]->messages()->unreadCount() > 0) {\n            return i;\n        }\n        first = false;\n    }\n    return -1;\n}\n\nint ConversationsModel::totalUnreadCount() const\n{\n    int ret = 0;\n    Q_FOREACH(Conversation *c, d->conversations) {\n        ret += c->messages()->unreadCount();\n    }\n    return ret;\n}\n<commit_msg>fix signal name<commit_after>\/*\n    Copyright (C) 2011  Lasath Fernando <kde@lasath.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 \"conversations-model.h\"\n#include \"conversation.h\"\n#include \"conversation-target.h\"\n#include \"messages-model.h\"\n#include \"channel-delegator.h\"\n\n#include <KDebug>\n\n#include <TelepathyQt\/ChannelClassSpec>\n#include <TelepathyQt\/TextChannel>\n#include <TelepathyQt\/ClientRegistrar>\n\nstatic inline Tp::ChannelClassSpecList channelClassList()\n{\n    return Tp::ChannelClassSpecList() << Tp::ChannelClassSpec::textChat();\n}\n\nclass ConversationsModel::ConversationsModelPrivate\n{\n  public:\n    QList<Conversation*> conversations;\n};\n\nConversationsModel::ConversationsModel(QObject *parent) :\n        QAbstractListModel(parent),\n        Tp::AbstractClientHandler(channelClassList()),\n        d(new ConversationsModelPrivate)\n{\n    QHash<int, QByteArray> roles;\n    roles[ConversationRole] = \"conversation\";\n    setRoleNames(roles);\n    connect(this, SIGNAL(rowsInserted(QModelIndex,int,int)), SIGNAL(totalUnreadCountChanged()));\n    connect(this, SIGNAL(rowsRemoved(QModelIndex,int,int)), SIGNAL(totalUnreadCountChanged()));\n}\n\nConversationsModel::~ConversationsModel()\n{\n    delete d;\n}\n\nQVariant ConversationsModel::data(const QModelIndex &index, int role) const\n{\n    QVariant result;\n    if (index.isValid()) {\n        if (role == ConversationRole) {\n            result = QVariant::fromValue<Conversation*>(d->conversations[index.row()]);\n            kDebug() << \"returning value \" << result;\n        }\n    }\n    return result;\n}\n\nint ConversationsModel::rowCount(const QModelIndex &parent) const\n{\n    Q_UNUSED(parent);\n    return d->conversations.count();\n}\n\nvoid ConversationsModel::handleChannels(const Tp::MethodInvocationContextPtr<> &context,\n                                        const Tp::AccountPtr &account,\n                                        const Tp::ConnectionPtr &connection,\n                                        const QList<Tp::ChannelPtr> &channels,\n                                        const QList<Tp::ChannelRequestPtr> &channelRequests,\n                                        const QDateTime &userActionTime,\n                                        const HandlerInfo &handlerInfo)\n{\n    Q_UNUSED(connection);\n    Q_UNUSED(handlerInfo);\n\n    bool handled = false;\n    bool shouldDelegate = false;\n\n    \/\/check that the channel is of type text\n    Tp::TextChannelPtr textChannel;\n    Q_FOREACH(const Tp::ChannelPtr &channel, channels) {\n        textChannel = Tp::TextChannelPtr::dynamicCast(channel);\n        if (textChannel) {\n            break;\n        }\n    }\n\n    Q_ASSERT(textChannel);\n\n\n    \/\/find the relevant channelRequest\n    Q_FOREACH(const Tp::ChannelRequestPtr channelRequest, channelRequests) {\n        kDebug() << channelRequest->hints().allHints();\n        shouldDelegate = channelRequest->hints().hint(QLatin1String(\"org.freedesktop.Telepathy.ChannelRequest\"), QLatin1String(\"DelegateToPreferredHandler\")).toBool();\n    }\n\n\n    \/\/loop through all conversations checking for matches\n\n    \/\/if we are handling and we're not told to delegate it, update the text channel\n    \/\/if we are handling but should delegate, call delegate channel\n    Q_FOREACH(Conversation *convo, d->conversations) {\n        if (convo->target()->id() == textChannel->targetId() &&\n                convo->messages()->textChannel()->targetHandleType() == textChannel->targetHandleType())\n        {\n            if (!shouldDelegate) {\n                convo->messages()->setTextChannel(textChannel);\n            } else {\n                if (convo->messages()->textChannel() == textChannel) {\n                    ChannelDelegator::delegateChannel(account, textChannel, userActionTime);\n                }\n            }\n            handled = true;\n            break;\n        }\n    }\n\n    \/\/if we are not handling channel already and should not delegate, add the conversation\n    \/\/if we not handling the channel but should delegate it, do nothing.\n\n    if (!handled && !shouldDelegate) {\n        beginInsertRows(QModelIndex(), rowCount(), rowCount());\n        Conversation *newConvo = new Conversation(textChannel, account, this);\n        d->conversations.append(newConvo);\n        connect(newConvo, SIGNAL(validityChanged(bool)), SLOT(handleValidityChange(bool)));\n        connect(newConvo, SIGNAL(conversationDelegated()), SLOT(conversationDelegated()));\n        connect(newConvo->messages(), SIGNAL(unreadCountChanged(int)), SIGNAL(totalUnreadCountChanged()));\n        endInsertRows();\n        context->setFinished();\n    }\n\n}\n\nbool ConversationsModel::bypassApproval() const\n{\n    return true;\n}\n\nvoid ConversationsModel::startChat(const Tp::AccountPtr &account, const KTp::ContactPtr &contact)\n{\n    Q_ASSERT(account);\n    account->ensureTextChat(contact, QDateTime::currentDateTime(),\n                            QLatin1String(\"org.freedesktop.Telepathy.Client.KDE.TextUi.ConversationWatcher\"));\n}\n\nvoid ConversationsModel::handleValidityChange(bool valid)\n{\n    if (!valid) {\n        removeConversation(qobject_cast<Conversation*>(QObject::sender()));\n    }\n}\n\nvoid ConversationsModel::conversationDelegated()\n{\n    removeConversation(qobject_cast<Conversation*>(QObject::sender()));\n}\n\nvoid ConversationsModel::removeConversation(Conversation* conv)\n{\n    int index = d->conversations.indexOf(conv);\n    if (index != -1) {\n        beginRemoveRows(QModelIndex(), index, index);\n        d->conversations.removeAt(index);\n        conv->deleteLater();\n        endRemoveRows();\n    } else {\n        kError() << \"attempting to delete non-existent conversation\";\n    }\n}\n\nint ConversationsModel::nextActiveConversation(int fromRow)\n{\n    if(d->conversations.isEmpty()) {\n        return -1;\n    }\n    Q_ASSERT(qBound(0, fromRow, d->conversations.count()-1) == fromRow);\n\n    bool first = true; \/\/let first be checked on the first loop\n    for(int i = fromRow; i != fromRow || first; i = (i + 1) % d->conversations.count()) {\n        if(d->conversations[i]->messages()->unreadCount() > 0) {\n            return i;\n        }\n        first = false;\n    }\n    return -1;\n}\n\nint ConversationsModel::totalUnreadCount() const\n{\n    int ret = 0;\n    Q_FOREACH(Conversation *c, d->conversations) {\n        ret += c->messages()->unreadCount();\n    }\n    return ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\r\n#include <seqan\/index.h>\r\n\r\nusing namespace std;\r\nusing namespace seqan;\r\n\r\n\r\n\tstruct TMySpec;\r\n\n\ttemplate <typename TString, typename TSpec>\r\n\tbool nodePredicate(Iter<Index<TString, Index_Wotd<TMySpec> >, TSpec> const &it) {\r\n\t\treturn (countOccurrences(it) >= 2) && (repLength(it) >= 4);\r\n\t}\r\n\r\n\r\nint main ()\r\n{\r\n\/\/\/We begin with a @Class.String@ to store our sequence.\r\n\tString<char> myString = \"How many wood would a woodchuck chuck.\";\r\n\r\n\/\/\/Then we create an @Class.Index@ of this @Class.StringSet@\r\n\ttypedef Index< String<char>, Index_Wotd<TMySpec> > TMyIndex;\r\n\tTMyIndex myIndex(myString);\r\n\r\n\/\/\/To find maximal repeats, we use SeqAn's @Spec.MaxRepeats Iterator@\r\n\/\/\/and set the minimum repeat length to 3.\r\n\ttypedef Iterator< TMyIndex, TopDown<ParentLinks<> > >::Type TMaxRepeatIterator;\r\n\tTMaxRepeatIterator myRepeatIterator(myIndex);\r\n\r\n\tgoBegin(myRepeatIterator);\r\n\twhile (!atEnd(myRepeatIterator))\r\n\t{\r\n\r\n\/\/\/@Function.countOccurrences@ returns the number of hits of the representative.\r\n\t\tcout << countOccurrences(myRepeatIterator) << \"x  \";\r\n\r\n\/\/\/The repeat string itself can be determined with @Function.representative@\r\n\t\tcout << \"\\t\\\"\" << representative(myRepeatIterator) << '\\\"' << endl;\r\n\r\n\t\tgoNext(myRepeatIterator);\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg><commit_after>#include <iostream>\r\n#include <seqan\/index.h>\r\n\r\nusing namespace std;\r\nusing namespace seqan;\r\n\r\n\/\/\/ constraint parameters\r\nstruct TMyConstraints {\r\n\tdouble p_min;\r\n\tint replen_max;\r\n};\r\n\r\n\/\/\/ SeqAn extensions\r\nnamespace seqan \r\n{\r\n\t\/\/ custom TSpec for our customized wotd-Index\r\n\tstruct TMyIndex;\r\n\r\n\ttemplate <typename TText>\r\n\tstruct Cargo<Index<TText, Index_Wotd<TMyIndex> > > {\r\n\t\ttypedef TMyConstraints Type;\r\n\t};\r\n\r\n\t\/\/ node predicate\r\n\ttemplate <typename TText, typename TSpec>\r\n\tbool nodePredicate(Iter<Index<TText, Index_Wotd<TMyIndex> >, TSpec> const &it) \r\n\t{\r\n\t\tTMyConstraints const &cons = cargo(container(it));\r\n\t\tunsigned replen = repLength(it);\r\n\t\tunsigned textLen = length(container(it));\r\n\r\n\t\tif (textLen == replen) return false;\r\n\t\treturn ((double)countOccurrences(it) \/ \r\n\t\t\t\t(double)(textLen - replen)) > cons.p_min;\r\n\t}\r\n\r\n\t\/\/ monotonic hull\r\n\ttemplate <typename TText, typename TSpec>\r\n\tbool nodeHullPredicate(Iter<Index<TText, Index_Wotd<TMyIndex> >, TSpec> const &it) \r\n\t{\r\n\t\tIndex<TText, Index_Wotd<TMyIndex> > const &index = container(it);\r\n\t\tTMyConstraints const &cons = cargo(index);\r\n\r\n\t\tif (repLength(it) > cons.replen_max) return false;\r\n\t\treturn ((double)countOccurrences(it) \/ \r\n\t\t\t\t(double)(length(index) - cons.replen_max)) > cons.p_min;\r\n\t}\r\n}\r\n\r\nint main ()\r\n{\r\n\/\/\/We begin with a @Class.String@ to store our sequence.\r\n\tString<char> myString = \"How many wood would a woodchuck chuck.\";\r\n\r\n\/\/\/Then we create our customized index which is a specialization\r\n\/\/\/of the deferred @Class.Index.wotd-Index@\r\n\ttypedef Index< String<char>, Index_Wotd<TMyIndex> > TMyIndex;\r\n\tTMyIndex myIndex(myString);\r\n\r\n\tcargo(myIndex).replen_max = 10;\r\n\tcargo(myIndex).p_min = 0.05;\r\n\r\n\/\/\/To find all strings that fulfill our constraints,\r\n\/\/\/we simply do a dfs-traversal via @Function.goBegin@ and @Function.goNext@\r\n\ttypedef Iterator< TMyIndex, TopDown<ParentLinks<> > >::Type TConstrainedIterator;\r\n\tTConstrainedIterator myConstrainedIterator(myIndex);\r\n\r\n\tgoBegin(myConstrainedIterator);\r\n\twhile (!atEnd(myConstrainedIterator))\r\n\t{\r\n\r\n\/\/\/@Function.countOccurrences@ returns the number of hits of the representative.\r\n\t\tcout << countOccurrences(myConstrainedIterator) << \"x  \";\r\n\r\n\/\/\/The representative string can be determined with @Function.representative@\r\n\t\tcout << \"\\t\\\"\" << representative(myConstrainedIterator) << '\\\"' << endl;\r\n\r\n\t\tgoNext(myConstrainedIterator);\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include <osg\/ApplicationUsage>\n#include <osg\/Math>\n\nusing namespace osg;\n\nApplicationUsage::ApplicationUsage(const std::string& commandLineUsage):\n    _commandLineUsage(commandLineUsage)\n{\n}\n\nApplicationUsage* ApplicationUsage::instance()\n{\n    static ApplicationUsage s_applicationUsage;\n    return &s_applicationUsage;\n}\n\nvoid ApplicationUsage::addUsageExplanation(Type type,const std::string& option,const std::string& explanation)\n{\n    switch(type)\n    {\n        case(COMMAND_LINE_OPTION):\n            addCommandLineOption(option,explanation);\n            break;\n        case(ENVIRONMENTAL_VARIABLE):\n            addEnvironmentalVariable(option,explanation);\n            break;\n        case(KEYBOARD_MOUSE_BINDING):\n            addKeyboardMouseBinding(option,explanation);\n            break;\n    }\n}\n\nvoid ApplicationUsage::addCommandLineOption(const std::string& option,const std::string& explanation,const std::string& defaultValue)\n{\n    _commandLineOptions[option]=explanation;\n    _commandLineOptionsDefaults[option]=defaultValue;\n}\n\nvoid ApplicationUsage::addEnvironmentalVariable(const std::string& option,const std::string& explanation, const std::string& defaultValue)\n{\n    _environmentalVariables[option]=explanation;\n    _environmentalVariablesDefaults[option]=defaultValue;\n}\n\nvoid ApplicationUsage::addKeyboardMouseBinding(const std::string& option,const std::string& explanation)\n{\n    _keyboardMouse[option]=explanation;\n}\n\nvoid ApplicationUsage::getFormattedString(std::string& str, const UsageMap& um,unsigned int widthOfOutput,bool showDefaults,const UsageMap& ud)\n{\n\n    unsigned int maxNumCharsInOptions = 0;\n    ApplicationUsage::UsageMap::const_iterator citr;\n    for(citr=um.begin();\n        citr!=um.end();\n        ++citr)\n    {\n        maxNumCharsInOptions = maximum(maxNumCharsInOptions,(unsigned int)citr->first.length());\n    }\n    \n    unsigned int fullWidth = widthOfOutput;\n    unsigned int optionPos = 2;\n    unsigned int explanationPos = optionPos+maxNumCharsInOptions+2;\n    unsigned int defaultPos = 0;\n    if (showDefaults)\n    {\n        defaultPos = explanationPos;\n        explanationPos = optionPos+8;\n    }\n    unsigned int explanationWidth = fullWidth-explanationPos;\n\n    std::string line;\n    \n    for(citr=um.begin();\n        citr!=um.end();\n        ++citr)\n    {\n        line.assign(fullWidth,' ');\n        line.replace(optionPos,citr->first.length(),citr->first);\n\n        if (showDefaults)\n        {\n            UsageMap::const_iterator ditr = ud.find(citr->first);\n            if (ditr != ud.end())\n            {\n                line.replace(defaultPos, std::string::npos, \"\");\n                if (ditr->second != \"\")\n                {\n                    line += \"[\";\n                    line += ditr->second;\n                    line += \"]\";\n                }\n                str += line;\n                str += \"\\n\";\n                line.assign(fullWidth,' ');\n            }\n        }\n        \n        const std::string& explanation = citr->second;\n        std::string::size_type pos = 0;\n        std::string::size_type offset = 0;\n        bool firstInLine = true;\n        while (pos<explanation.length())\n        {\n            if (firstInLine) offset = 0;\n                    \n            \/\/ skip any leading white space.\n            while (pos<explanation.length() && explanation[pos]==' ')\n            {\n                if (firstInLine) ++offset;\n                ++pos;\n            }\n            \n            firstInLine = false;\n        \n            std::string::size_type width = minimum((std::string::size_type)(explanation.length()-pos),(std::string::size_type)(explanationWidth-offset));\n            std::string::size_type slashn_pos = explanation.find('\\n',pos);\n            \n            unsigned int extraSkip = 0;\n            bool concatinated = false;\n            if (slashn_pos!=std::string::npos)\n            {\n                if (slashn_pos<pos+width)\n                {\n                    width = slashn_pos-pos;\n                    ++extraSkip;\n                    firstInLine = true;\n                }\n                else if (slashn_pos==pos+width) \n                {\n                    ++extraSkip;\n                    firstInLine = true;\n                }\n            }\n            \n            if (pos+width<explanation.length())\n            {\n                \/\/ now reduce width until we get a space or a return\n                \/\/ so that we ensure that whole words are printed.\n                while (width>0 && \n                       explanation[pos+width]!=' ' && \n                       explanation[pos+width]!='\\n') --width;\n                       \n                if (width==0)\n                {\n                    \/\/ word must be longer than a whole line so will need\n                    \/\/ to concatinate it.\n                    width = explanationWidth-1;\n                    concatinated = true;\n                }\n            }\n\n            line.replace(explanationPos+offset,explanationWidth, explanation, pos, width);\n\n            if (concatinated) { str += line; str += \"-\\n\"; }\n            else { str += line; str += \"\\n\"; }\n            \n            \/\/ move to the next line of output.\n            line.assign(fullWidth,' ');\n            \n            pos += width+extraSkip;\n\n            \n        }\n                \n    }\n}\n\nvoid ApplicationUsage::write(std::ostream& output, const ApplicationUsage::UsageMap& um,unsigned int widthOfOutput,bool showDefaults,const ApplicationUsage::UsageMap& ud)\n{\n    std::string str;\n    getFormattedString(str, um, widthOfOutput, showDefaults, ud);\n    output << str << std::endl;\n}\n\nvoid ApplicationUsage::write(std::ostream& output, unsigned int type, unsigned int widthOfOutput, bool showDefaults)\n{\n\n    output << \"Usage: \"<<getCommandLineUsage()<<std::endl;\n    bool needspace = false;\n    if ((type&COMMAND_LINE_OPTION) && !getCommandLineOptions().empty())\n    {\n        if (needspace) output << std::endl;\n        output << \"Options\";\n        if (showDefaults) output << \" [and default value]\";\n        output << \":\"<<std::endl;\n        write(output,getCommandLineOptions(),widthOfOutput,showDefaults,getCommandLineOptionsDefaults());\n        needspace = true;\n    }\n    \n    if ((type&ENVIRONMENTAL_VARIABLE) && !getEnvironmentalVariables().empty())\n    {\n        if (needspace) output << std::endl;\n        output << \"Environmental Variables\";\n        if (showDefaults) output << \" [and default value]\";\n        output << \":\"<<std::endl;\n        write(output,getEnvironmentalVariables(),widthOfOutput,showDefaults,getEnvironmentalVariablesDefaults());\n        needspace = true;\n    }\n\n    if ((type&KEYBOARD_MOUSE_BINDING) && !getKeyboardMouseBindings().empty())\n    {\n        if (needspace) output << std::endl;\n        output << \"Keyboard and Mouse Bindings:\"<<std::endl;\n        write(output,getKeyboardMouseBindings(),widthOfOutput);\n        needspace = true;\n    }\n\n}\n\n\nvoid ApplicationUsage::writeEnvironmentSettings(std::ostream& output)\n{\n    output << \"Current Environment Settings:\"<<std::endl;\n\n    unsigned int maxNumCharsInOptions = 0;\n    ApplicationUsage::UsageMap::const_iterator citr;\n    for(citr=getEnvironmentalVariables().begin();\n        citr!=getEnvironmentalVariables().end();\n        ++citr)\n    {\n        std::string::size_type len = citr->first.find_first_of(\"\\n\\r\\t \");\n        if (len == std::string::npos) len = citr->first.size();\n        maxNumCharsInOptions = maximum(maxNumCharsInOptions,(unsigned int) len);\n    }\n    \n    unsigned int optionPos = 2;\n    std::string line;\n    \n    for(citr=getEnvironmentalVariables().begin();\n        citr!=getEnvironmentalVariables().end();\n        ++citr)\n    {\n        line.assign(optionPos+maxNumCharsInOptions+2,' ');\n        std::string::size_type len = citr->first.find_first_of(\"\\n\\r\\t \");\n        if (len == std::string::npos) len = citr->first.size();\n        line.replace(optionPos,len,citr->first.substr(0,len));\n        char *cp = getenv(citr->first.substr(0, len).c_str());\n        if (!cp) cp = \"[not set]\";\n        else if (!*cp) cp = \"[set]\";\n        line += std::string(cp) + \"\\n\";\n\n        output << line;\n    }\n    output << std::endl;\n}\n<commit_msg>From Bob Kuehne, proper c++ cast instead of c-cast for ApplicationUsage<commit_after>#include <osg\/ApplicationUsage>\n#include <osg\/Math>\n\nusing namespace osg;\n\nApplicationUsage::ApplicationUsage(const std::string& commandLineUsage):\n    _commandLineUsage(commandLineUsage)\n{\n}\n\nApplicationUsage* ApplicationUsage::instance()\n{\n    static ApplicationUsage s_applicationUsage;\n    return &s_applicationUsage;\n}\n\nvoid ApplicationUsage::addUsageExplanation(Type type,const std::string& option,const std::string& explanation)\n{\n    switch(type)\n    {\n        case(COMMAND_LINE_OPTION):\n            addCommandLineOption(option,explanation);\n            break;\n        case(ENVIRONMENTAL_VARIABLE):\n            addEnvironmentalVariable(option,explanation);\n            break;\n        case(KEYBOARD_MOUSE_BINDING):\n            addKeyboardMouseBinding(option,explanation);\n            break;\n    }\n}\n\nvoid ApplicationUsage::addCommandLineOption(const std::string& option,const std::string& explanation,const std::string& defaultValue)\n{\n    _commandLineOptions[option]=explanation;\n    _commandLineOptionsDefaults[option]=defaultValue;\n}\n\nvoid ApplicationUsage::addEnvironmentalVariable(const std::string& option,const std::string& explanation, const std::string& defaultValue)\n{\n    _environmentalVariables[option]=explanation;\n    _environmentalVariablesDefaults[option]=defaultValue;\n}\n\nvoid ApplicationUsage::addKeyboardMouseBinding(const std::string& option,const std::string& explanation)\n{\n    _keyboardMouse[option]=explanation;\n}\n\nvoid ApplicationUsage::getFormattedString(std::string& str, const UsageMap& um,unsigned int widthOfOutput,bool showDefaults,const UsageMap& ud)\n{\n\n    unsigned int maxNumCharsInOptions = 0;\n    ApplicationUsage::UsageMap::const_iterator citr;\n    for(citr=um.begin();\n        citr!=um.end();\n        ++citr)\n    {\n        maxNumCharsInOptions = maximum(maxNumCharsInOptions,(unsigned int)citr->first.length());\n    }\n    \n    unsigned int fullWidth = widthOfOutput;\n    unsigned int optionPos = 2;\n    unsigned int explanationPos = optionPos+maxNumCharsInOptions+2;\n    unsigned int defaultPos = 0;\n    if (showDefaults)\n    {\n        defaultPos = explanationPos;\n        explanationPos = optionPos+8;\n    }\n    unsigned int explanationWidth = fullWidth-explanationPos;\n\n    std::string line;\n    \n    for(citr=um.begin();\n        citr!=um.end();\n        ++citr)\n    {\n        line.assign(fullWidth,' ');\n        line.replace(optionPos,citr->first.length(),citr->first);\n\n        if (showDefaults)\n        {\n            UsageMap::const_iterator ditr = ud.find(citr->first);\n            if (ditr != ud.end())\n            {\n                line.replace(defaultPos, std::string::npos, \"\");\n                if (ditr->second != \"\")\n                {\n                    line += \"[\";\n                    line += ditr->second;\n                    line += \"]\";\n                }\n                str += line;\n                str += \"\\n\";\n                line.assign(fullWidth,' ');\n            }\n        }\n        \n        const std::string& explanation = citr->second;\n        std::string::size_type pos = 0;\n        std::string::size_type offset = 0;\n        bool firstInLine = true;\n        while (pos<explanation.length())\n        {\n            if (firstInLine) offset = 0;\n                    \n            \/\/ skip any leading white space.\n            while (pos<explanation.length() && explanation[pos]==' ')\n            {\n                if (firstInLine) ++offset;\n                ++pos;\n            }\n            \n            firstInLine = false;\n        \n            std::string::size_type width = minimum((std::string::size_type)(explanation.length()-pos),(std::string::size_type)(explanationWidth-offset));\n            std::string::size_type slashn_pos = explanation.find('\\n',pos);\n            \n            unsigned int extraSkip = 0;\n            bool concatinated = false;\n            if (slashn_pos!=std::string::npos)\n            {\n                if (slashn_pos<pos+width)\n                {\n                    width = slashn_pos-pos;\n                    ++extraSkip;\n                    firstInLine = true;\n                }\n                else if (slashn_pos==pos+width) \n                {\n                    ++extraSkip;\n                    firstInLine = true;\n                }\n            }\n            \n            if (pos+width<explanation.length())\n            {\n                \/\/ now reduce width until we get a space or a return\n                \/\/ so that we ensure that whole words are printed.\n                while (width>0 && \n                       explanation[pos+width]!=' ' && \n                       explanation[pos+width]!='\\n') --width;\n                       \n                if (width==0)\n                {\n                    \/\/ word must be longer than a whole line so will need\n                    \/\/ to concatinate it.\n                    width = explanationWidth-1;\n                    concatinated = true;\n                }\n            }\n\n            line.replace(explanationPos+offset,explanationWidth, explanation, pos, width);\n\n            if (concatinated) { str += line; str += \"-\\n\"; }\n            else { str += line; str += \"\\n\"; }\n            \n            \/\/ move to the next line of output.\n            line.assign(fullWidth,' ');\n            \n            pos += width+extraSkip;\n\n            \n        }\n                \n    }\n}\n\nvoid ApplicationUsage::write(std::ostream& output, const ApplicationUsage::UsageMap& um,unsigned int widthOfOutput,bool showDefaults,const ApplicationUsage::UsageMap& ud)\n{\n    std::string str;\n    getFormattedString(str, um, widthOfOutput, showDefaults, ud);\n    output << str << std::endl;\n}\n\nvoid ApplicationUsage::write(std::ostream& output, unsigned int type, unsigned int widthOfOutput, bool showDefaults)\n{\n\n    output << \"Usage: \"<<getCommandLineUsage()<<std::endl;\n    bool needspace = false;\n    if ((type&COMMAND_LINE_OPTION) && !getCommandLineOptions().empty())\n    {\n        if (needspace) output << std::endl;\n        output << \"Options\";\n        if (showDefaults) output << \" [and default value]\";\n        output << \":\"<<std::endl;\n        write(output,getCommandLineOptions(),widthOfOutput,showDefaults,getCommandLineOptionsDefaults());\n        needspace = true;\n    }\n    \n    if ((type&ENVIRONMENTAL_VARIABLE) && !getEnvironmentalVariables().empty())\n    {\n        if (needspace) output << std::endl;\n        output << \"Environmental Variables\";\n        if (showDefaults) output << \" [and default value]\";\n        output << \":\"<<std::endl;\n        write(output,getEnvironmentalVariables(),widthOfOutput,showDefaults,getEnvironmentalVariablesDefaults());\n        needspace = true;\n    }\n\n    if ((type&KEYBOARD_MOUSE_BINDING) && !getKeyboardMouseBindings().empty())\n    {\n        if (needspace) output << std::endl;\n        output << \"Keyboard and Mouse Bindings:\"<<std::endl;\n        write(output,getKeyboardMouseBindings(),widthOfOutput);\n        needspace = true;\n    }\n\n}\n\n\nvoid ApplicationUsage::writeEnvironmentSettings(std::ostream& output)\n{\n    output << \"Current Environment Settings:\"<<std::endl;\n\n    unsigned int maxNumCharsInOptions = 0;\n    ApplicationUsage::UsageMap::const_iterator citr;\n    for(citr=getEnvironmentalVariables().begin();\n        citr!=getEnvironmentalVariables().end();\n        ++citr)\n    {\n        std::string::size_type len = citr->first.find_first_of(\"\\n\\r\\t \");\n        if (len == std::string::npos) len = citr->first.size();\n        maxNumCharsInOptions = maximum( maxNumCharsInOptions,static_cast<unsigned int>(len));\n    }\n    \n    unsigned int optionPos = 2;\n    std::string line;\n    \n    for(citr=getEnvironmentalVariables().begin();\n        citr!=getEnvironmentalVariables().end();\n        ++citr)\n    {\n        line.assign(optionPos+maxNumCharsInOptions+2,' ');\n        std::string::size_type len = citr->first.find_first_of(\"\\n\\r\\t \");\n        if (len == std::string::npos) len = citr->first.size();\n        line.replace(optionPos,len,citr->first.substr(0,len));\n        char *cp = getenv(citr->first.substr(0, len).c_str());\n        if (!cp) cp = \"[not set]\";\n        else if (!*cp) cp = \"[set]\";\n        line += std::string(cp) + \"\\n\";\n\n        output << line;\n    }\n    output << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ UjoImro, 2013\n\n#ifndef __OPENCL_HPP__\n#define __OPENCL_HPP__\n\n#include <string>\n#include <vector>\n#include <CL\/cl.h>\n#include <fstream>\n#include <stdexcept>\n#include <boost\/foreach.hpp>\n#include <boost\/smart_ptr.hpp>\n\n#include \"errors.hpp\"\n\nnamespace carp {\n    namespace opencl {\n        \n\n        std::string\n        readfile( const std::string & filename )\n        {\n            std::ifstream input( filename, std::ifstream::binary );\n    \n            if (!input) throw std::runtime_error(\"error: Couldn't open file `\" + filename + \"'\" );\n        \n            input.seekg(0, input.end);\n            int length = input.tellg();\n            input.seekg(0, input.beg);\n\n            boost::scoped_array<char> result_c_str(new char[length+1]);            \n            input.read(result_c_str.get(), length);\n            if (!input) throw std::runtime_error(\"error: Could not read file `\" + filename + \"'\");\n            \n            std::string result(result_c_str.get());\n\n            return result;\n        } \/\/ readfile\n\n\n        class kernel {\n        private:\n            cl_kernel cqKernel;\n            \n        public:\n            kernel() : cqKernel(NULL) { };\n\n            kernel & operator= ( cl_kernel cqKernel ) {\n                this->cqKernel = cqKernel;                \n                return *this;\n            } \/\/ operator=\n\n            void release() {\n                if (cqKernel) clReleaseKernel(cqKernel);\n                cqKernel=NULL;                \n            } \/\/ release\n            \n        }; \/\/ class kernel\n        \n\n        class device {\n        private:\n            typedef std::map<std::string, opencl::kernel> kernels_t;            \n            \n            cl_context cxGPUContext;        \/\/ OpenCL context\n            cl_command_queue cqCommandQueue;\/\/ OpenCL command queue\n            cl_platform_id cpPlatform;      \/\/ OpenCL platform\n            cl_device_id cdDevice;          \/\/ OpenCL device\n            cl_program cpProgram;           \/\/ OpenCL program\n            kernels_t kernels; \/\/ OpenCL kernel            \n            cl_uint num_platforms;          \/\/ The number of OpenCL platforms\n            cl_uint num_devices;            \/\/ The number of OpenCL devices\n            \n        public:\n\n            device() {\n                cl_int err; \/\/ for the error messages\n\n                device::check(clGetPlatformIDs(1, &cpPlatform, &num_platforms), __FILE__, __LINE__ );\n                assert(num_platforms==1);  \/\/ there is only one supported platform at the time\n\n                device::check(clGetDeviceIDs(cpPlatform, CL_DEVICE_TYPE_GPU, 1, &cdDevice, &num_devices), __FILE__, __LINE__ );\n                assert(num_devices==1);\n\n                cxGPUContext = clCreateContext( NULL, 1, &cdDevice, NULL, NULL, &err );\n                device::check( err, __FILE__, __LINE__ );\n                \n                cqCommandQueue = clCreateCommandQueue( cxGPUContext, cdDevice, CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE, &err );\n                device::check( err, __FILE__, __LINE__ );\n                \n            }\n            \n            static void check(\n                const cl_int & error,\n                const std::string & filename = __FILE__,\n                const int & line = __LINE__\n                ) throw (std::exception&) {\n                if ( error != CL_SUCCESS )\n                    throw std::runtime_error( std::string(\"error: OpenCL: \") +\n                                              carp::opencl::errors[error] +\n                                              \"; line: \" + std::to_string(__LINE__) + \" in file \" + __FILE__ );\n            }\n    \n            ~device() {\n                if(cpProgram) clReleaseProgram(cpProgram);\n                if(cqCommandQueue) clReleaseCommandQueue(cqCommandQueue);\n                if(cxGPUContext) clReleaseContext(cxGPUContext);\n                std::for_each( kernels.begin(), kernels.end(), [] ( kernels_t::allocator_type::value_type & kernel ) {\/\/ kernel->second.release();\n                    } );\n            } \/\/ ~device\n\n            void compile( const std::vector<std::string> & filenames,\n                          const std::vector<std::string> & kernelnames ) {\n                cl_int err;\n                \n                \/\/ loading the sources\n                std::vector<std::string> sources;\n                std::vector<const char*> c_strs;\n                std::vector<size_t> lengths;                \n                \n                BOOST_FOREACH( std::string filename, filenames ) {                    \n                    sources.push_back(readfile(filename));\n                    c_strs.push_back(sources.back().c_str());\n                    lengths.push_back(sources.back().size());                    \n                }\n                                \n                cpProgram = clCreateProgramWithSource( cxGPUContext, sources.size(), &(c_strs[0]), &(lengths[0]), &err );\n                device::check(err);\n\n                \/\/ building the OpenCL source code\n                err = clBuildProgram( cpProgram, 0, NULL, NULL, NULL, NULL );\n                if ( err!=CL_SUCCESS )\n                {\n                    size_t len;\n                    std::string buffer(1048576, 0);\n\n                    device::check( clGetProgramBuildInfo( cpProgram, cdDevice, CL_PROGRAM_BUILD_LOG, buffer.size(), reinterpret_cast<void*>(&buffer[0]), &len ) );\n\n                    std::cerr << buffer << std::endl;\n                    throw std::runtime_error(\"error: OpenCL: The compilation has failed.\");                    \n                }\n\n                \/\/ extracting the kernel entrances\n                BOOST_FOREACH( std::string kernel_name, kernelnames )\n                {\n                    cl_int err;                    \n                    kernels[kernel_name] = clCreateKernel( cpProgram, kernel_name.c_str(), &err);\n                    device::check(err);                    \n                }                \n\n                return;\n            } \/\/ compile\n\n            kernel & operator [] ( const std::string & filename ) {\n                return kernels[filename];\n            } \/\/ operator[]\n        }; \/\/ class device\n\n        \n    } \/\/ namespace opencl\n} \/\/ namespace carp\n\n\n\n#endif \/* __OPENCL_HPP__ *\/\n\/\/ LuM end of file\n<commit_msg>created the opencl array<commit_after>\/\/ UjoImro, 2013\n\n#ifndef __OPENCL_HPP__\n#define __OPENCL_HPP__\n\n#include <string>\n#include <vector>\n#include <CL\/cl.h>\n#include <fstream>\n#include <stdexcept>\n#include <boost\/foreach.hpp>\n#include <boost\/smart_ptr.hpp>\n\n#include \"errors.hpp\"\n\nnamespace carp {\n    namespace opencl {\n        \n\n        std::string\n        readfile( const std::string & filename )\n        {\n            std::ifstream input( filename, std::ifstream::binary );\n    \n            if (!input) throw std::runtime_error(\"error: Couldn't open file `\" + filename + \"'\" );\n        \n            input.seekg(0, input.end);\n            int length = input.tellg();\n            input.seekg(0, input.beg);\n\n            boost::scoped_array<char> result_c_str(new char[length+1]);            \n            input.read(result_c_str.get(), length);\n            if (!input) throw std::runtime_error(\"error: Could not read file `\" + filename + \"'\");\n            \n            std::string result(result_c_str.get());\n\n            return result;\n        } \/\/ readfile\n\n\n        void checkerror(\n            const cl_int & error,\n            const std::string & filename = __FILE__,\n            const int & line = __LINE__\n            ) throw (std::exception&) {\n            if ( error != CL_SUCCESS )\n                throw std::runtime_error( std::string(\"error: OpenCL: \") +\n                                          carp::opencl::errors[error] +\n                                          \"; line: \" + std::to_string(__LINE__) + \" in file \" + __FILE__ );\n        }\n\n\n        class kernel {\n        private:\n            cl_kernel cqKernel;\n\n            template <class MT0, class Pos>\n            bool\n            setparameter( Pos & pos, MT0 & mt0 ) {\n                checkerror( clSetKernelArg(cqKernel, pos, sizeof(mt0), static_cast<void*>(&mt0) ), __FILE__, __LINE__ );\n                pos++; \/\/ move the position of the parameter applied                \n                return true;\n            } \/\/ setparameter            \n                \n            \n        public:\n            kernel() : cqKernel(NULL) { };\n\n            kernel & operator= ( cl_kernel cqKernel ) {\n                this->cqKernel = cqKernel;                \n                return *this;\n            } \/\/ operator=\n\n            void release() {\n                if (cqKernel) clReleaseKernel(cqKernel);\n                cqKernel=NULL;                \n            } \/\/ release\n\n            template <class ...MT>\n            void operator() ( MT ... mt ) {\n                int pos=0; \/\/ the position of the parameters\n                std::vector<bool> err { setparameter(pos, mt)... };                \n            } \/\/ operator ()\n            \n                \n        }; \/\/ class kernel\n        \n\n        class device {\n        private:\n            typedef std::map<std::string, opencl::kernel> kernels_t;            \n            \n            cl_context cxGPUContext;        \/\/ OpenCL context\n            cl_command_queue cqCommandQueue;\/\/ OpenCL command queue\n            cl_platform_id cpPlatform;      \/\/ OpenCL platform\n            cl_device_id cdDevice;          \/\/ OpenCL device\n            cl_program cpProgram;           \/\/ OpenCL program\n            kernels_t kernels; \/\/ OpenCL kernel            \n            cl_uint num_platforms;          \/\/ The number of OpenCL platforms\n            cl_uint num_devices;            \/\/ The number of OpenCL devices\n            \n        public:\n\n            device() {\n                cl_int err; \/\/ for the error messages\n\n                checkerror(clGetPlatformIDs(1, &cpPlatform, &num_platforms), __FILE__, __LINE__ );\n                assert(num_platforms==1);  \/\/ there is only one supported platform at the time\n\n                checkerror(clGetDeviceIDs(cpPlatform, CL_DEVICE_TYPE_GPU, 1, &cdDevice, &num_devices), __FILE__, __LINE__ );\n                assert(num_devices==1);\n\n                cxGPUContext = clCreateContext( NULL, 1, &cdDevice, NULL, NULL, &err );\n                checkerror( err, __FILE__, __LINE__ );\n                \n                cqCommandQueue = clCreateCommandQueue( cxGPUContext, cdDevice, CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE, &err );\n                checkerror( err, __FILE__, __LINE__ );\n                \n            }\n                \n            ~device() {\n                if(cpProgram) clReleaseProgram(cpProgram);\n                if(cqCommandQueue) clReleaseCommandQueue(cqCommandQueue);\n                if(cxGPUContext) clReleaseContext(cxGPUContext);\n                std::for_each( kernels.begin(), kernels.end(), [] ( kernels_t::allocator_type::value_type & kernel ) {\/\/ kernel->second.release();\n                    } );\n            } \/\/ ~device\n\n            void compile( const std::vector<std::string> & filenames,\n                          const std::vector<std::string> & kernelnames ) {\n                cl_int err;\n                \n                \/\/ loading the sources\n                std::vector<std::string> sources;\n                std::vector<const char*> c_strs;\n                std::vector<size_t> lengths;                \n                \n                BOOST_FOREACH( std::string filename, filenames ) {                    \n                    sources.push_back(readfile(filename));\n                    c_strs.push_back(sources.back().c_str());\n                    lengths.push_back(sources.back().size());                    \n                }\n                                \n                cpProgram = clCreateProgramWithSource( cxGPUContext, sources.size(), &(c_strs[0]), &(lengths[0]), &err );\n                checkerror(err, __FILE__, __LINE__ );\n\n                \/\/ building the OpenCL source code\n                err = clBuildProgram( cpProgram, 0, NULL, NULL, NULL, NULL );\n                if ( err!=CL_SUCCESS )\n                {\n                    size_t len;\n                    std::string buffer(1048576, 0);\n\n                    checkerror( clGetProgramBuildInfo( cpProgram, cdDevice, CL_PROGRAM_BUILD_LOG, buffer.size(), reinterpret_cast<void*>(&buffer[0]), &len ), __FILE__, __LINE__ );\n\n                    std::cerr << buffer << std::endl;\n                    throw std::runtime_error(\"error: OpenCL: The compilation has failed.\");                    \n                }\n\n                \/\/ extracting the kernel entrances\n                BOOST_FOREACH( std::string kernel_name, kernelnames )\n                {\n                    cl_int err;                    \n                    kernels[kernel_name] = clCreateKernel( cpProgram, kernel_name.c_str(), &err);\n                    checkerror(err, __FILE__, __LINE__ );\n                }                \n\n                return;\n            } \/\/ compile\n\n            kernel & operator [] ( const std::string & filename ) {\n                return kernels[filename];\n            } \/\/ operator[]\n        }; \/\/ class device\n\n\n        template <class T0>\n        class array {\n        private:\n            cl_mem cl_ptr;\n            size_t size;\n            cl_context context;\n            cl_command_queue command_queue;\n            \n            array( const array<T0> & ) { } \/\/ copy constructor forbidden\n            \n        public:\n            array( const cl_context & context,\n                   const cl_command_queue & command_queue,\n                   const size_t & size,\n                   cl_mem_flags flags = CL_MEM_READ_WRITE\n                ) : size(size), context(context), command_queue(command_queue) {\n                assert( (flags & CL_MEM_USE_HOST_PTR) == 0 );\n                cl_int err;                \n                cl_ptr = clCreateBuffer( context, flags, size * sizeof(T0), NULL, &err );\n                checkerror( err, __FILE__, __LINE__ );              \n            } \/\/ array\n\n            array( const cl_context & context,\n                   const cl_command_queue & command_queue,\n                   std::vector<T0> & input,\n                   cl_mem_flags flags = CL_MEM_READ_WRITE\n                ) : size(input.size()) {\n                cl_int err;\n                cl_ptr = clCreateBuffer( context, flags | CL_MEM_COPY_HOST_PTR, size * sizeof(T0), reinterpret_cast<void*>(intput[0]), &err );\n                checkerror( err, __FILE__, __LINE__ );\n            } \/\/ array\n\n            cl_mem get() {\n                return cl_ptr;\n            } \/\/ get\n                        \n            ~array() {\n                clReleaseMemObject(cl_ptr);\n            } \/\/ ~array\n\n            size_t size() {\n                return size;\n            } \/\/ size\n            \n            std::vector<T0> extract( ) {\n                std::vector<T0> result(size);                \n                checkerror( clEnqueueReadBuffer( command_queue, cl_ptr, CL_TRUE, 0, sizeof(T0) * size, &(result[0]), 0, NULL, NULL), __FILE__, __LINE__ );\n\n                return result;                \n            } \/\/ extract\n            \n        }; \/\/ class array\n        \n            \n        \n    } \/\/ namespace opencl\n} \/\/ namespace carp\n\n\n\n#endif \/* __OPENCL_HPP__ *\/\n\/\/ LuM end of file\n<|endoftext|>"}
{"text":"<commit_before>#include \"pegr\/gensys\/PodChunk.hpp\"\n\n#include <cassert>\n#include <algorithm>\n\nnamespace pegr {\nnamespace Gensys {\nnamespace Pod {\n\nChunk_Ptr::Chunk_Ptr(void* chunk, std::size_t size)\n: m_voidptr(chunk)\n, m_size(size) {\n    assert(m_size % 8 == 0);\n}\n\nChunk_Ptr::Chunk_Ptr()\n: m_voidptr(nullptr)\n, m_size(0) {}\n\nbool Chunk_Ptr::is_nullptr() const {\n    return m_voidptr == nullptr;\n}\nvoid Chunk_Ptr::make_nullptr() {\n    m_voidptr = nullptr;\n    m_size = 0;\n}\n\nvoid* Chunk_Ptr::get_raw() const {\n    return m_voidptr;\n}\nstd::size_t Chunk_Ptr::get_size() const {\n    return m_size;\n}\n\nbool Chunk_Ptr::operator ==(const Chunk_Ptr& rhs) const {\n    return m_voidptr == rhs.m_voidptr;\n}\nbool Chunk_Ptr::operator !=(const Chunk_Ptr& rhs) const {\n    return m_voidptr != rhs.m_voidptr;\n}\nChunk_Ptr::operator bool() const {\n    return m_voidptr == nullptr;\n}\n    \nbool operator ==(std::nullptr_t, const Chunk_Ptr& rhs) {\n    return rhs.m_voidptr == nullptr;\n}\nbool operator ==(const Chunk_Ptr& lhs, std::nullptr_t) {\n    return lhs.m_voidptr == nullptr;\n}\nbool operator !=(std::nullptr_t, const Chunk_Ptr& rhs) {\n    return rhs.m_voidptr != nullptr;\n}\nbool operator !=(const Chunk_Ptr& lhs, std::nullptr_t) {\n    return lhs.m_voidptr != nullptr;\n}\n\nvoid Chunk_Ptr_Deleter::operator ()(pointer ptr) const {\n    delete_pod_chunk(ptr);\n}\n\nChunk_Ptr new_pod_chunk(std::size_t req_size) {\n    if (req_size == 0) {\n        int64_t* chunk = new int64_t[1];\n        return Chunk_Ptr(chunk, 0);\n    }\n    \n    \/\/ Fewest number of int64's that can hold the requested number of bytes\n    std::size_t size = (req_size \/ 8) + (req_size % 8 == 0 ? 0 : 1);\n    int64_t* chunk = new int64_t[size];\n    return Chunk_Ptr(chunk, size);\n}\n\nvoid delete_pod_chunk(Chunk_Ptr ptr) {\n    if (!ptr.get_raw()) return;\n    \n    delete[] static_cast<int64_t*>(ptr.get_raw());\n}\n\nvoid copy_pod_chunk(\n        Chunk_Ptr src, std::size_t src_start,\n        Chunk_Ptr dest, std::size_t dest_start, std::size_t num_bytes) {\n\n    assert(src_start % 8 == 0);\n    assert(dest_start % 8 == 0);\n    assert(num_bytes % 8 == 0);\n    assert(src_start >= 0);\n    assert(dest_start >= 0);\n    assert(num_bytes >= 0);\n    assert(!dest.is_nullptr());\n    assert(num_bytes <= src.get_size() - src_start);\n    assert(num_bytes <= dest.get_size() - dest_start);\n    \n    if (src.is_nullptr()) {\n        assert(num_bytes == 0);\n        return;\n    }\n    \n    int64_t* src_array = static_cast<int64_t*>(src.get_raw());\n    int64_t* dest_array = static_cast<int64_t*>(dest.get_raw());\n    \n    std::copy(\n        src_array + (src_start \/ 8), \n        src_array + ((src_start + num_bytes) \/ 8), \n        dest_array + (dest_start \/ 8));\n}\n\n} \/\/ namespace Pod\n} \/\/ namespace Gensys\n} \/\/ namespace pegr\n<commit_msg>Use proper null check<commit_after>#include \"pegr\/gensys\/PodChunk.hpp\"\n\n#include <cassert>\n#include <algorithm>\n\nnamespace pegr {\nnamespace Gensys {\nnamespace Pod {\n\nChunk_Ptr::Chunk_Ptr(void* chunk, std::size_t size)\n: m_voidptr(chunk)\n, m_size(size) {\n    assert(m_size % 8 == 0);\n}\n\nChunk_Ptr::Chunk_Ptr()\n: m_voidptr(nullptr)\n, m_size(0) {}\n\nbool Chunk_Ptr::is_nullptr() const {\n    return m_voidptr == nullptr;\n}\nvoid Chunk_Ptr::make_nullptr() {\n    m_voidptr = nullptr;\n    m_size = 0;\n}\n\nvoid* Chunk_Ptr::get_raw() const {\n    return m_voidptr;\n}\nstd::size_t Chunk_Ptr::get_size() const {\n    return m_size;\n}\n\nbool Chunk_Ptr::operator ==(const Chunk_Ptr& rhs) const {\n    return m_voidptr == rhs.m_voidptr;\n}\nbool Chunk_Ptr::operator !=(const Chunk_Ptr& rhs) const {\n    return m_voidptr != rhs.m_voidptr;\n}\nChunk_Ptr::operator bool() const {\n    return m_voidptr == nullptr;\n}\n    \nbool operator ==(std::nullptr_t, const Chunk_Ptr& rhs) {\n    return rhs.m_voidptr == nullptr;\n}\nbool operator ==(const Chunk_Ptr& lhs, std::nullptr_t) {\n    return lhs.m_voidptr == nullptr;\n}\nbool operator !=(std::nullptr_t, const Chunk_Ptr& rhs) {\n    return rhs.m_voidptr != nullptr;\n}\nbool operator !=(const Chunk_Ptr& lhs, std::nullptr_t) {\n    return lhs.m_voidptr != nullptr;\n}\n\nvoid Chunk_Ptr_Deleter::operator ()(pointer ptr) const {\n    delete_pod_chunk(ptr);\n}\n\nChunk_Ptr new_pod_chunk(std::size_t req_size) {\n    \/* Special case if there is no size: Create a \"zero-length\" array\n     * NOT nullptr! This ensures that no two independent return values for this \n     * function are equal!\n     *\/\n    if (req_size == 0) {\n        int64_t* chunk = new int64_t[1];\n        return Chunk_Ptr(chunk, 0);\n    }\n    \n    \/\/ Fewest number of int64's that can hold the requested number of bytes\n    std::size_t size = (req_size \/ 8) + (req_size % 8 == 0 ? 0 : 1);\n    int64_t* chunk = new int64_t[size];\n    return Chunk_Ptr(chunk, size);\n}\n\nvoid delete_pod_chunk(Chunk_Ptr ptr) {\n    if (ptr.is_nullptr()) return;\n    delete[] static_cast<int64_t*>(ptr.get_raw());\n}\n\nvoid copy_pod_chunk(\n        Chunk_Ptr src, std::size_t src_start,\n        Chunk_Ptr dest, std::size_t dest_start, std::size_t num_bytes) {\n\n    assert(src_start % 8 == 0);\n    assert(dest_start % 8 == 0);\n    assert(num_bytes % 8 == 0);\n    assert(src_start >= 0);\n    assert(dest_start >= 0);\n    assert(num_bytes >= 0);\n    assert(!dest.is_nullptr());\n    assert(num_bytes <= src.get_size() - src_start);\n    assert(num_bytes <= dest.get_size() - dest_start);\n    \n    if (src.is_nullptr()) {\n        assert(num_bytes == 0);\n        return;\n    }\n    \n    int64_t* src_array = static_cast<int64_t*>(src.get_raw());\n    int64_t* dest_array = static_cast<int64_t*>(dest.get_raw());\n    \n    std::copy(\n        src_array + (src_start \/ 8), \n        src_array + ((src_start + num_bytes) \/ 8), \n        dest_array + (dest_start \/ 8));\n}\n\n} \/\/ namespace Pod\n} \/\/ namespace Gensys\n} \/\/ namespace pegr\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"task_queue.hpp\"\n\n#include <thread>\n\nnamespace stx {\n\nclass threadpool : public task_queue_mt {\n\tstd::vector<std::thread> m_threads;\npublic:\n\tthreadpool() noexcept {}\n\tthreadpool(int count) noexcept {\n\t\tstart(count);\n\t}\n\n\t~threadpool() noexcept { stop(); }\n\n\tvoid start(int count = 0) noexcept {\n\t\tstop();\n\n\t\tif(count <= 0) {\n\t\t\tcount = std::thread::hardware_concurrency() - 1;\n\t\t}\n\n\t\tfor(unsigned i = 0; i < count; i++) {\n\t\t\tm_threads.emplace_back([this]() {\n\t\t\t\ttask_queue_mt::start();\n\t\t\t});\n\t\t}\n\t}\n\n\tvoid stop() noexcept {\n\t\ttask_queue_mt::stop();\n\t\tfor(auto& thread : m_threads) {\n\t\t\tthread.join();\n\t\t}\n\t\tm_threads.clear();\n\t}\n};\n\n} \/\/ namespace stx\n<commit_msg>Fixed compiler warning<commit_after>#pragma once\n\n#include \"task_queue.hpp\"\n\n#include <thread>\n\nnamespace stx {\n\nclass threadpool : public task_queue_mt {\n\tstd::vector<std::thread> m_threads;\npublic:\n\tthreadpool() noexcept {}\n\tthreadpool(int count) noexcept {\n\t\tstart(count);\n\t}\n\n\t~threadpool() noexcept { stop(); }\n\n\tvoid start(int count = 0) noexcept {\n\t\tstop();\n\n\t\tif(count <= 0) {\n\t\t\tcount = std::thread::hardware_concurrency() - 1;\n\t\t}\n\n\t\tfor(int i = 0; i < count; i++) {\n\t\t\tm_threads.emplace_back([this]() {\n\t\t\t\ttask_queue_mt::start();\n\t\t\t});\n\t\t}\n\t}\n\n\tvoid stop() noexcept {\n\t\ttask_queue_mt::stop();\n\t\tfor(auto& thread : m_threads) {\n\t\t\tthread.join();\n\t\t}\n\t\tm_threads.clear();\n\t}\n};\n\n} \/\/ namespace stx\n<|endoftext|>"}
{"text":"<commit_before>#define CATCH_CONFIG_MAIN\n#include \"catch.hpp\"\n\n#include <random>\n\n#include \"ADT\/Bitvector.h\"\n\nusing dg::ADT::SparseBitvector;\n\nTEST_CASE(\"Querying empty set\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n   for (uint64_t i = 1; i < (1UL << 63); i *= 2) {\n       REQUIRE(B.get(i) == false);\n   }\n}\n\nTEST_CASE(\"Set few elements\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n    REQUIRE(B.get(0) == false);\n    REQUIRE(B.get(1) == false);\n    REQUIRE(B.get(10) == false);\n    REQUIRE(B.get(1000) == false);\n    REQUIRE(B.get(100000) == false);\n    B.set(0);\n    B.set(1);\n    B.set(10);\n    B.set(1000);\n    B.set(100000);\n    REQUIRE(B.get(0) == true);\n    REQUIRE(B.get(1) == true);\n    REQUIRE(B.get(10) == true);\n    REQUIRE(B.get(1000) == true);\n    REQUIRE(B.get(100000) == true);\n}\n\nTEST_CASE(\"Extreme values\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n    REQUIRE(B.get(0) == false);\n\n    for (unsigned int i = 0; i < 64; ++i) {\n        REQUIRE(B.get(1UL << i) == false);\n        REQUIRE(B.set(1UL << i) == false);\n    }\n\n    for (unsigned int i = 0; i < 64; ++i) {\n        REQUIRE(B.get(1UL << i) == true);\n    }\n}\n\nTEST_CASE(\"Iterator test\", \"SparseBitvector\") {\n    SparseBitvector B;\n    int n = 0;\n    auto it = B.begin();\n    auto et = B.end();\n    for (; it != et; ++it) {\n        size_t i = *it;\n        REQUIRE((i == 0 || i == 1 || i == 10 || i == 1000 || i == 100000));\n        ++n;\n    }\n    REQUIRE(n == 5);\n}\n\nTEST_CASE(\"Set continuous values\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n#define NUM 10000000\n    for (int i = 0; i < NUM; ++i) {\n        REQUIRE(B.get(i) == false);\n        B.set(i);\n    }\n\n    for (int i = 0; i < NUM; ++i) {\n        REQUIRE(B.get(i) == true);\n    }\n#undef NUM\n}\n\nTEST_CASE(\"Random\", \"SparseBitvector\") {\n    SparseBitvector B;\n    srand(time(nullptr));\n\n#define NUM 10000000\n\n    std::vector<size_t> numbers;\n    numbers.reserve(NUM);\n    std::default_random_engine generator;\n    std::uniform_int_distribution<uint64_t> distribution(0, ~static_cast<uint64_t>(0));\n\n    for (int i = 0; i < NUM; ++i) {\n        auto x = distribution(generator);\n        REQUIRE(B.set(x) == false);\n        numbers.push_back(x);\n    }\n\n    for (auto x : numbers) {\n        REQUIRE(B.get(x) == true);\n    }\n}\n<commit_msg>tests: add few more tests for bitvectors<commit_after>#define CATCH_CONFIG_MAIN\n#include \"catch.hpp\"\n\n#include <random>\n\n#include \"ADT\/Bitvector.h\"\n\nusing dg::ADT::SparseBitvector;\n\nTEST_CASE(\"Querying empty set\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n   for (uint64_t i = 1; i < (1UL << 63); i *= 2) {\n       REQUIRE(B.get(i) == false);\n   }\n}\n\nTEST_CASE(\"Set few elements\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n    REQUIRE(B.get(0) == false);\n    REQUIRE(B.get(1) == false);\n    REQUIRE(B.get(10) == false);\n    REQUIRE(B.get(1000) == false);\n    REQUIRE(B.get(100000) == false);\n    B.set(0);\n    B.set(1);\n    B.set(10);\n    B.set(1000);\n    B.set(100000);\n    REQUIRE(B.get(0) == true);\n    REQUIRE(B.get(1) == true);\n    REQUIRE(B.get(10) == true);\n    REQUIRE(B.get(1000) == true);\n    REQUIRE(B.get(100000) == true);\n}\n\nTEST_CASE(\"Extreme values\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n    REQUIRE(B.get(0) == false);\n\n    for (unsigned int i = 0; i < 64; ++i) {\n        REQUIRE(B.get(1UL << i) == false);\n        REQUIRE(B.set(1UL << i) == false);\n    }\n\n    for (unsigned int i = 0; i < 64; ++i) {\n        REQUIRE(B.get(1UL << i) == true);\n    }\n}\n\nTEST_CASE(\"Iterator and empty bitvector\", \"SparseBitvector\") {\n    SparseBitvector B;\n    auto it = B.begin();\n    auto et = B.end();\n\n    REQUIRE(it == et);\n    REQUIRE(B.size() == 0);\n    REQUIRE(B.empty());\n}\n\nTEST_CASE(\"Iterator one element\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n    auto it = B.begin();\n    auto et = B.end();\n\n    REQUIRE(it == et);\n\n    REQUIRE(B.empty());\n    REQUIRE(B.set(1000000) == false);\n\n    it = B.begin();\n    et = B.end();\n\n    REQUIRE(it != et);\n    REQUIRE(*it == 1000000);\n    ++it;\n    REQUIRE(it == et);\n}\n\nTEST_CASE(\"Iterator test\", \"SparseBitvector\") {\n    SparseBitvector B;\n    int n = 0;\n\n    B.set(0);\n    B.set(1);\n    B.set(10);\n    B.set(1000);\n    B.set(100000);\n\n    auto it = B.begin();\n    auto et = B.end();\n\n    for (; it != et; ++it) {\n        size_t i = *it;\n        REQUIRE((i == 0 || i == 1 || i == 10 || i == 1000 || i == 100000));\n        ++n;\n    }\n    REQUIRE(n == 5);\n}\n\nTEST_CASE(\"Set continuous values\", \"SparseBitvector\") {\n    SparseBitvector B;\n\n#define NUM 10000\n    for (int i = 0; i < NUM; ++i) {\n        REQUIRE(B.get(i) == false);\n        B.set(i);\n    }\n\n    for (int i = 0; i < NUM; ++i) {\n        REQUIRE(B.get(i) == true);\n    }\n#undef NUM\n}\n\nTEST_CASE(\"Random\", \"SparseBitvector\") {\n    SparseBitvector B;\n    srand(time(nullptr));\n\n#define NUM 10000\n\n    std::set<size_t> numbers;\n    std::default_random_engine generator;\n    std::uniform_int_distribution<uint64_t> distribution(0, ~static_cast<uint64_t>(0));\n\nSECTION(\"Generating random numbers and putting them to bitvector\") {\n    for (int i = 0; i < NUM; ++i) {\n        auto x = distribution(generator);\n        REQUIRE(B.set(x) == false);\n        numbers.insert(x);\n    }\n}\n\nSECTION(\"Checking that each generated number is in bitvector\") {\n    for (auto x : numbers) {\n        REQUIRE(B.get(x) == true);\n    }\n}\n\nSECTION(\"Checking that each generated number is in bitvector using iterator\") {\n    \/\/ try iterators\n    for (auto x : B) {\n        REQUIRE(numbers.count(x) > 0);\n    }\n}\n\nSECTION(\"Checking random numbers\") {\n    for (int i = 0; i < NUM; ++i) {\n        auto x = distribution(generator);\n        if (numbers.count(x) > 0)\n            REQUIRE(B.get(x) == true);\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 \"base\/command_line.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n  BrowserClosedObserver(Browser* browser) {\n    registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n                   Source<Browser>(browser));\n    ui_test_utils::RunMessageLoop();\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst wchar_t kConsoleTestPage[] = L\"files\/devtools\/console_test_page.html\";\nconst wchar_t kDebuggerTestPage[] = L\"files\/devtools\/debugger_test_page.html\";\nconst wchar_t kEvalTestPage[] = L\"files\/devtools\/eval_test_page.html\";\nconst wchar_t kJsPage[] = L\"files\/devtools\/js_page.html\";\nconst wchar_t kResourceTestPage[] = L\"files\/devtools\/resource_test_page.html\";\nconst wchar_t kSimplePage[] = L\"files\/devtools\/simple_page.html\";\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::wstring& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\",\n                                      test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::wstring& test_page) {\n    HTTPTestServer* server = StartHTTPServer();\n    GURL url = server->TestServerPageW(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    TabContents* tab = browser()->GetTabContentsAt(0);\n    inspected_rvh_ = tab->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n    BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\/\/ WebInspector opens.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHostIsPresent) {\n  RunTest(\"testHostIsPresent\", kSimplePage);\n}\n\n\/\/ Tests elements panel basics.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestElementsTreeRoot) {\n  RunTest(\"testElementsTreeRoot\", kSimplePage);\n}\n\n\/\/ Tests main resource load.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestMainResource) {\n  RunTest(\"testMainResource\", kSimplePage);\n}\n\n\/\/ Tests resources panel enabling.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Tests resource headers.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kResourceTestPage);\n}\n\n\/\/ Tests profiler panel.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests scripts panel showing.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests that scripts are not duplicated after Scripts Panel switch.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest,\n                       TestNoScriptDuplicatesOnPanelSwitch) {\n  RunTest(\"testNoScriptDuplicatesOnPanelSwitch\", kDebuggerTestPage);\n}\n\n\/\/ Tests set breakpoint.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestSetBreakpoint) {\n  RunTest(\"testSetBreakpoint\", kDebuggerTestPage);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n\/\/ Tests console eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestConsoleEval) {\n  RunTest(\"testConsoleEval\", kConsoleTestPage);\n}\n\n\/\/ Tests console log.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleLog) {\n  RunTest(\"testConsoleLog\", kConsoleTestPage);\n}\n\n\/\/ Tests eval global values.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestEvalGlobal) {\n  RunTest(\"testEvalGlobal\", kEvalTestPage);\n}\n\n\/\/ Tests eval on call frame.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalCallFrame) {\n  RunTest(\"testEvalCallFrame\", kEvalTestPage);\n}\n\n}  \/\/ namespace\n<commit_msg>Temporarily disable some devtools interactive tests.<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\/command_line.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n  BrowserClosedObserver(Browser* browser) {\n    registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n                   Source<Browser>(browser));\n    ui_test_utils::RunMessageLoop();\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst wchar_t kConsoleTestPage[] = L\"files\/devtools\/console_test_page.html\";\nconst wchar_t kDebuggerTestPage[] = L\"files\/devtools\/debugger_test_page.html\";\nconst wchar_t kEvalTestPage[] = L\"files\/devtools\/eval_test_page.html\";\nconst wchar_t kJsPage[] = L\"files\/devtools\/js_page.html\";\nconst wchar_t kResourceTestPage[] = L\"files\/devtools\/resource_test_page.html\";\nconst wchar_t kSimplePage[] = L\"files\/devtools\/simple_page.html\";\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::wstring& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\",\n                                      test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::wstring& test_page) {\n    HTTPTestServer* server = StartHTTPServer();\n    GURL url = server->TestServerPageW(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    TabContents* tab = browser()->GetTabContentsAt(0);\n    inspected_rvh_ = tab->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n    BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\/\/ WebInspector opens.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHostIsPresent) {\n  RunTest(\"testHostIsPresent\", kSimplePage);\n}\n\n\/\/ Tests elements panel basics.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestElementsTreeRoot) {\n  RunTest(\"testElementsTreeRoot\", kSimplePage);\n}\n\n\/\/ Tests main resource load.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestMainResource) {\n  RunTest(\"testMainResource\", kSimplePage);\n}\n\n\/\/ Tests resources panel enabling.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Tests resource headers.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kResourceTestPage);\n}\n\n\/\/ Tests profiler panel.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests scripts panel showing.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests that scripts are not duplicated after Scripts Panel switch.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest,\n                       TestNoScriptDuplicatesOnPanelSwitch) {\n  RunTest(\"testNoScriptDuplicatesOnPanelSwitch\", kDebuggerTestPage);\n}\n\n\/\/ Tests set breakpoint.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestSetBreakpoint) {\n  RunTest(\"testSetBreakpoint\", kDebuggerTestPage);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n\/\/ Tests console eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleEval) {\n  RunTest(\"testConsoleEval\", kConsoleTestPage);\n}\n\n\/\/ Tests console log.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleLog) {\n  RunTest(\"testConsoleLog\", kConsoleTestPage);\n}\n\n\/\/ Tests eval global values.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestEvalGlobal) {\n  RunTest(\"testEvalGlobal\", kEvalTestPage);\n}\n\n\/\/ Tests eval on call frame.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalCallFrame) {\n  RunTest(\"testEvalCallFrame\", kEvalTestPage);\n}\n\n}  \/\/ namespace\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\/command_line.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\n\n#if defined(OS_WIN)\n#define MAYBE_TestShowScriptsTab TestShowScriptsTab\n#define MAYBE_TestSetBreakpoint TestSetBreakpoint\n#elif defined(OS_LINUX)\n\/\/ http:\/\/crbug.com\/19748\n#define MAYBE_TestShowScriptsTab DISABLED_TestShowScriptsTab\n#define MAYBE_TestSetBreakpoint DISABLED_TestSetBreakpoint\n#endif\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n  BrowserClosedObserver(Browser* browser) {\n    registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n                   Source<Browser>(browser));\n    ui_test_utils::RunMessageLoop();\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst wchar_t kConsoleTestPage[] = L\"files\/devtools\/console_test_page.html\";\nconst wchar_t kDebuggerTestPage[] = L\"files\/devtools\/debugger_test_page.html\";\nconst wchar_t kEvalTestPage[] = L\"files\/devtools\/eval_test_page.html\";\nconst wchar_t kJsPage[] = L\"files\/devtools\/js_page.html\";\nconst wchar_t kSimplePage[] = L\"files\/devtools\/simple_page.html\";\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::wstring& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\",\n                                      test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::wstring& test_page) {\n    HTTPTestServer* server = StartHTTPServer();\n    GURL url = server->TestServerPageW(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    TabContents* tab = browser()->GetTabContentsAt(0);\n    inspected_rvh_ = tab->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n    BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\/\/ WebInspector opens.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHostIsPresent) {\n  RunTest(\"testHostIsPresent\", kSimplePage);\n}\n\n\/\/ Tests elements panel basics.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestElementsTreeRoot) {\n  RunTest(\"testElementsTreeRoot\", kSimplePage);\n}\n\n\/\/ Tests main resource load.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestMainResource) {\n  RunTest(\"testMainResource\", kSimplePage);\n}\n\n\/\/ Tests resources panel enabling.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Tests resource headers.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kDebuggerTestPage);\n}\n\n\/\/ Tests profiler panel.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests scripts panel showing.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests set breakpoint.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestSetBreakpoint) {\n  RunTest(\"testSetBreakpoint\", kDebuggerTestPage);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n\/\/ Tests console eval.\n\/\/ DISABLED:  See http:\/\/crbug.com\/18786\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleEval) {\n  RunTest(\"testConsoleEval\", kConsoleTestPage);\n}\n\n\/\/ Tests console log.\n\/\/ DISABLED:  See http:\/\/crbug.com\/18786\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleLog) {\n  RunTest(\"testConsoleLog\", kConsoleTestPage);\n}\n\n\/\/ Tests eval global values.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalGlobal) {\n  RunTest(\"testEvalGlobal\", kEvalTestPage);\n}\n\n\/\/ Tests eval on call frame.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalCallFrame) {\n  RunTest(\"testEvalCallFrame\", kEvalTestPage);\n}\n\n}  \/\/ namespace\n<commit_msg>Disable DevToolsSanityTest.TestShowScriptsTab, which has been flaky for quite a while.<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\/command_line.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\n\n#if defined(OS_WIN)\n#define MAYBE_TestShowScriptsTab DISABLED_TestShowScriptsTab\n#define MAYBE_TestSetBreakpoint TestSetBreakpoint\n#elif defined(OS_LINUX)\n\/\/ http:\/\/crbug.com\/19748\n#define MAYBE_TestShowScriptsTab DISABLED_TestShowScriptsTab\n#define MAYBE_TestSetBreakpoint DISABLED_TestSetBreakpoint\n#endif\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n  BrowserClosedObserver(Browser* browser) {\n    registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n                   Source<Browser>(browser));\n    ui_test_utils::RunMessageLoop();\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst wchar_t kConsoleTestPage[] = L\"files\/devtools\/console_test_page.html\";\nconst wchar_t kDebuggerTestPage[] = L\"files\/devtools\/debugger_test_page.html\";\nconst wchar_t kEvalTestPage[] = L\"files\/devtools\/eval_test_page.html\";\nconst wchar_t kJsPage[] = L\"files\/devtools\/js_page.html\";\nconst wchar_t kSimplePage[] = L\"files\/devtools\/simple_page.html\";\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::wstring& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\",\n                                      test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::wstring& test_page) {\n    HTTPTestServer* server = StartHTTPServer();\n    GURL url = server->TestServerPageW(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    TabContents* tab = browser()->GetTabContentsAt(0);\n    inspected_rvh_ = tab->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n    BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\/\/ WebInspector opens.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHostIsPresent) {\n  RunTest(\"testHostIsPresent\", kSimplePage);\n}\n\n\/\/ Tests elements panel basics.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestElementsTreeRoot) {\n  RunTest(\"testElementsTreeRoot\", kSimplePage);\n}\n\n\/\/ Tests main resource load.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestMainResource) {\n  RunTest(\"testMainResource\", kSimplePage);\n}\n\n\/\/ Tests resources panel enabling.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Tests resource headers.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kDebuggerTestPage);\n}\n\n\/\/ Tests profiler panel.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests scripts panel showing.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests set breakpoint.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestSetBreakpoint) {\n  RunTest(\"testSetBreakpoint\", kDebuggerTestPage);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n\/\/ Tests console eval.\n\/\/ DISABLED:  See http:\/\/crbug.com\/18786\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleEval) {\n  RunTest(\"testConsoleEval\", kConsoleTestPage);\n}\n\n\/\/ Tests console log.\n\/\/ DISABLED:  See http:\/\/crbug.com\/18786\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleLog) {\n  RunTest(\"testConsoleLog\", kConsoleTestPage);\n}\n\n\/\/ Tests eval global values.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalGlobal) {\n  RunTest(\"testEvalGlobal\", kEvalTestPage);\n}\n\n\/\/ Tests eval on call frame.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalCallFrame) {\n  RunTest(\"testEvalCallFrame\", kEvalTestPage);\n}\n\n}  \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ $Id$\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(&params, 0, sizeof(params));\n    params.image_format = 0;\n\n    err = av_open_input_file(&m_pFormatContext, sFilename.c_str(), \n            0, 0, &params);\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(\"      FFMpegDecoder::renderToBmp\");\nstatic ProfilingZone ImgConvertProfilingZone(\"        FFMpegDecoder::img_convert\");\n\nbool FFMpegDecoder::renderToBmp(BitmapPtr pBmp)\n{\n    ScopeTimer Timer(RenderToBmpProfilingZone);\n    \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>Cleaned up profiling output.<commit_after>\/\/\n\/\/ $Id$\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(&params, 0, sizeof(params));\n    params.image_format = 0;\n\n    err = av_open_input_file(&m_pFormatContext, sFilename.c_str(), \n            0, 0, &params);\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    \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>\/\/ 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\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/extensions\/extension_host.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/test\/test_server.h\"\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\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  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst char kConsoleTestPage[] = \"files\/devtools\/console_test_page.html\";\nconst char kDebuggerTestPage[] = \"files\/devtools\/debugger_test_page.html\";\nconst char kJsPage[] = \"files\/devtools\/js_page.html\";\nconst char kHeapProfilerPage[] = \"files\/devtools\/heap_profiler.html\";\nconst char kPauseWhenLoadingDevTools[] =\n    \"files\/devtools\/pause_when_loading_devtools.html\";\nconst char kPauseWhenScriptIsRunning[] =\n    \"files\/devtools\/pause_when_script_is_running.html\";\nconst char kResourceContentLengthTestPage[] = \"files\/devtools\/image.html\";\nconst char kResourceTestPage[] = \"files\/devtools\/resource_test_page.html\";\nconst char kSimplePage[] = \"files\/devtools\/simple_page.html\";\nconst char kCompletionOnPause[] =\n    \"files\/devtools\/completion_on_pause.html\";\nconst char kPageWithContentScript[] =\n    \"files\/devtools\/page_with_content_script.html\";\n\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::string& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\",\n                                      test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::string& test_page) {\n    ASSERT_TRUE(test_server()->Start());\n    GURL url = test_server()->GetURL(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    inspected_rvh_ = GetInspectedTab()->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  TabContents* GetInspectedTab() {\n    return browser()->GetTabContentsAt(0);\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n\n    \/\/ Wait only when DevToolsWindow has a browser. For docked DevTools, this\n    \/\/ is NULL and we skip the wait.\n    if (browser)\n      BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\nclass CancelableQuitTask : public Task {\n public:\n  explicit CancelableQuitTask(const std::string& timeout_message)\n      : timeout_message_(timeout_message),\n        cancelled_(false) {\n  }\n\n  void cancel() {\n    cancelled_ = true;\n  }\n\n  virtual void Run() {\n    if (cancelled_) {\n      return;\n    }\n    FAIL() << timeout_message_;\n    MessageLoop::current()->Quit();\n  }\n\n private:\n  std::string timeout_message_;\n  bool cancelled_;\n};\n\n\n\/\/ Base class for DevTools tests that test devtools functionality for\n\/\/ extensions and content scripts.\nclass DevToolsExtensionDebugTest : public DevToolsSanityTest,\n                                   public NotificationObserver {\n public:\n  DevToolsExtensionDebugTest() : DevToolsSanityTest() {\n    PathService::Get(chrome::DIR_TEST_DATA, &test_extensions_dir_);\n    test_extensions_dir_ = test_extensions_dir_.AppendASCII(\"devtools\");\n    test_extensions_dir_ = test_extensions_dir_.AppendASCII(\"extensions\");\n  }\n\n protected:\n  \/\/ Load an extention from test\\data\\devtools\\extensions\\<extension_name>\n  void LoadExtension(const char* extension_name) {\n    FilePath path = test_extensions_dir_.AppendASCII(extension_name);\n    ASSERT_TRUE(LoadExtensionFromPath(path)) << \"Failed to load extension.\";\n  }\n\n private:\n  bool LoadExtensionFromPath(const FilePath& path) {\n    ExtensionsService* service = browser()->profile()->GetExtensionsService();\n    size_t num_before = service->extensions()->size();\n    {\n      NotificationRegistrar registrar;\n      registrar.Add(this, NotificationType::EXTENSION_LOADED,\n                    NotificationService::AllSources());\n      CancelableQuitTask* delayed_quit =\n          new CancelableQuitTask(\"Extension load timed out.\");\n      MessageLoop::current()->PostDelayedTask(FROM_HERE, delayed_quit,\n          4*1000);\n      service->LoadExtension(path);\n      ui_test_utils::RunMessageLoop();\n      delayed_quit->cancel();\n    }\n    size_t num_after = service->extensions()->size();\n    if (num_after != (num_before + 1))\n      return false;\n\n    return WaitForExtensionHostsToLoad();\n  }\n\n  bool WaitForExtensionHostsToLoad() {\n    \/\/ Wait for all the extension hosts that exist to finish loading.\n    \/\/ NOTE: This assumes that the extension host list is not changing while\n    \/\/ this method is running.\n\n    NotificationRegistrar registrar;\n    registrar.Add(this, NotificationType::EXTENSION_HOST_DID_STOP_LOADING,\n                  NotificationService::AllSources());\n    CancelableQuitTask* delayed_quit =\n        new CancelableQuitTask(\"Extension host load timed out.\");\n    MessageLoop::current()->PostDelayedTask(FROM_HERE, delayed_quit,\n        4*1000);\n\n    ExtensionProcessManager* manager =\n          browser()->profile()->GetExtensionProcessManager();\n    for (ExtensionProcessManager::const_iterator iter = manager->begin();\n         iter != manager->end();) {\n      if ((*iter)->did_stop_loading())\n        ++iter;\n      else\n        ui_test_utils::RunMessageLoop();\n    }\n\n    delayed_quit->cancel();\n    return true;\n  }\n\n  void Observe(NotificationType type,\n               const NotificationSource& source,\n               const NotificationDetails& details) {\n    switch (type.value) {\n      case NotificationType::EXTENSION_LOADED:\n      case NotificationType::EXTENSION_HOST_DID_STOP_LOADING:\n        MessageLoopForUI::current()->Quit();\n        break;\n      default:\n        NOTREACHED();\n        break;\n    }\n  }\n\n  FilePath test_extensions_dir_;\n};\n\n\/\/ Tests resources panel enabling.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Fails after WebKit roll 59365:59477, http:\/\/crbug.com\/44202.\n#if defined(OS_LINUX)\n#define MAYBE_TestResourceContentLength FLAKY_TestResourceContentLength\n#else\n#define MAYBE_TestResourceContentLength TestResourceContentLength\n#endif  \/\/ defined(OS_LINUX)\n\n\/\/ Tests resources have correct sizes.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestResourceContentLength) {\n  RunTest(\"testResourceContentLength\", kResourceContentLengthTestPage);\n}\n\n\/\/ Tests resource headers.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kResourceTestPage);\n}\n\n\/\/ Tests cached resource mime type.\n\/\/ @see http:\/\/crbug.com\/27364\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestCachedResourceMimeType) {\n  RunTest(\"testCachedResourceMimeType\", kResourceTestPage);\n}\n\n\/\/ Tests profiler panel.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests heap profiler.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHeapProfiler) {\n  RunTest(\"testHeapProfiler\", kHeapProfilerPage);\n}\n\n\/\/ Tests scripts panel showing.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests that scripts tab is populated with inspected scripts even if it\n\/\/ hadn't been shown by the moment inspected paged refreshed.\n\/\/ @see http:\/\/crbug.com\/26312\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest,\n                       TestScriptsTabIsPopulatedOnInspectedPageRefresh) {\n  \/\/ Clear inspector settings to ensure that Elements will be\n  \/\/ current panel when DevTools window is open.\n  GetInspectedTab()->render_view_host()->delegate()->ClearInspectorSettings();\n  RunTest(\"testScriptsTabIsPopulatedOnInspectedPageRefresh\",\n          kDebuggerTestPage);\n}\n\n\/\/ Tests that a content script is in the scripts list.\n\/\/ This test is disabled, see bug 28961.\nIN_PROC_BROWSER_TEST_F(DevToolsExtensionDebugTest,\n                       TestContentScriptIsPresent) {\n  LoadExtension(\"simple_content_script\");\n  RunTest(\"testContentScriptIsPresent\", kPageWithContentScript);\n}\n\n\/\/ Tests that scripts are not duplicated after Scripts Panel switch.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest,\n                       TestNoScriptDuplicatesOnPanelSwitch) {\n  RunTest(\"testNoScriptDuplicatesOnPanelSwitch\", kDebuggerTestPage);\n}\n\n\/\/ Tests that debugger works correctly if pause event occurs when DevTools\n\/\/ frontend is being loaded.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestPauseWhenLoadingDevTools) {\n  RunTest(\"testPauseWhenLoadingDevTools\", kPauseWhenLoadingDevTools);\n}\n\n\/\/ Tests that pressing 'Pause' will pause script execution if the script\n\/\/ is already running.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestPauseWhenScriptIsRunning) {\n  RunTest(\"testPauseWhenScriptIsRunning\", kPauseWhenScriptIsRunning);\n}\n\n\/\/ Fails after WebKit roll 66724:66804, http:\/\/crbug.com\/54592\n#if defined(OS_LINUX) || defined(OS_WIN)\n#define MAYBE_TestCompletionOnPause FAILS_TestCompletionOnPause\n#else\n#define MAYBE_TestCompletionOnPause TestCompletionOnPause\n#endif  \/\/ defined(OS_LINUX) || defined(OS_WIN)\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestCompletionOnPause) {\n  RunTest(\"testCompletionOnPause\", kCompletionOnPause);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n}  \/\/ namespace\n<commit_msg>Disable TestEnableResourcesTab.<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\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/extensions\/extension_host.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/test\/test_server.h\"\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\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  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst char kConsoleTestPage[] = \"files\/devtools\/console_test_page.html\";\nconst char kDebuggerTestPage[] = \"files\/devtools\/debugger_test_page.html\";\nconst char kJsPage[] = \"files\/devtools\/js_page.html\";\nconst char kHeapProfilerPage[] = \"files\/devtools\/heap_profiler.html\";\nconst char kPauseWhenLoadingDevTools[] =\n    \"files\/devtools\/pause_when_loading_devtools.html\";\nconst char kPauseWhenScriptIsRunning[] =\n    \"files\/devtools\/pause_when_script_is_running.html\";\nconst char kResourceContentLengthTestPage[] = \"files\/devtools\/image.html\";\nconst char kResourceTestPage[] = \"files\/devtools\/resource_test_page.html\";\nconst char kSimplePage[] = \"files\/devtools\/simple_page.html\";\nconst char kCompletionOnPause[] =\n    \"files\/devtools\/completion_on_pause.html\";\nconst char kPageWithContentScript[] =\n    \"files\/devtools\/page_with_content_script.html\";\n\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::string& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\",\n                                      test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::string& test_page) {\n    ASSERT_TRUE(test_server()->Start());\n    GURL url = test_server()->GetURL(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    inspected_rvh_ = GetInspectedTab()->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  TabContents* GetInspectedTab() {\n    return browser()->GetTabContentsAt(0);\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n\n    \/\/ Wait only when DevToolsWindow has a browser. For docked DevTools, this\n    \/\/ is NULL and we skip the wait.\n    if (browser)\n      BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\nclass CancelableQuitTask : public Task {\n public:\n  explicit CancelableQuitTask(const std::string& timeout_message)\n      : timeout_message_(timeout_message),\n        cancelled_(false) {\n  }\n\n  void cancel() {\n    cancelled_ = true;\n  }\n\n  virtual void Run() {\n    if (cancelled_) {\n      return;\n    }\n    FAIL() << timeout_message_;\n    MessageLoop::current()->Quit();\n  }\n\n private:\n  std::string timeout_message_;\n  bool cancelled_;\n};\n\n\n\/\/ Base class for DevTools tests that test devtools functionality for\n\/\/ extensions and content scripts.\nclass DevToolsExtensionDebugTest : public DevToolsSanityTest,\n                                   public NotificationObserver {\n public:\n  DevToolsExtensionDebugTest() : DevToolsSanityTest() {\n    PathService::Get(chrome::DIR_TEST_DATA, &test_extensions_dir_);\n    test_extensions_dir_ = test_extensions_dir_.AppendASCII(\"devtools\");\n    test_extensions_dir_ = test_extensions_dir_.AppendASCII(\"extensions\");\n  }\n\n protected:\n  \/\/ Load an extention from test\\data\\devtools\\extensions\\<extension_name>\n  void LoadExtension(const char* extension_name) {\n    FilePath path = test_extensions_dir_.AppendASCII(extension_name);\n    ASSERT_TRUE(LoadExtensionFromPath(path)) << \"Failed to load extension.\";\n  }\n\n private:\n  bool LoadExtensionFromPath(const FilePath& path) {\n    ExtensionsService* service = browser()->profile()->GetExtensionsService();\n    size_t num_before = service->extensions()->size();\n    {\n      NotificationRegistrar registrar;\n      registrar.Add(this, NotificationType::EXTENSION_LOADED,\n                    NotificationService::AllSources());\n      CancelableQuitTask* delayed_quit =\n          new CancelableQuitTask(\"Extension load timed out.\");\n      MessageLoop::current()->PostDelayedTask(FROM_HERE, delayed_quit,\n          4*1000);\n      service->LoadExtension(path);\n      ui_test_utils::RunMessageLoop();\n      delayed_quit->cancel();\n    }\n    size_t num_after = service->extensions()->size();\n    if (num_after != (num_before + 1))\n      return false;\n\n    return WaitForExtensionHostsToLoad();\n  }\n\n  bool WaitForExtensionHostsToLoad() {\n    \/\/ Wait for all the extension hosts that exist to finish loading.\n    \/\/ NOTE: This assumes that the extension host list is not changing while\n    \/\/ this method is running.\n\n    NotificationRegistrar registrar;\n    registrar.Add(this, NotificationType::EXTENSION_HOST_DID_STOP_LOADING,\n                  NotificationService::AllSources());\n    CancelableQuitTask* delayed_quit =\n        new CancelableQuitTask(\"Extension host load timed out.\");\n    MessageLoop::current()->PostDelayedTask(FROM_HERE, delayed_quit,\n        4*1000);\n\n    ExtensionProcessManager* manager =\n          browser()->profile()->GetExtensionProcessManager();\n    for (ExtensionProcessManager::const_iterator iter = manager->begin();\n         iter != manager->end();) {\n      if ((*iter)->did_stop_loading())\n        ++iter;\n      else\n        ui_test_utils::RunMessageLoop();\n    }\n\n    delayed_quit->cancel();\n    return true;\n  }\n\n  void Observe(NotificationType type,\n               const NotificationSource& source,\n               const NotificationDetails& details) {\n    switch (type.value) {\n      case NotificationType::EXTENSION_LOADED:\n      case NotificationType::EXTENSION_HOST_DID_STOP_LOADING:\n        MessageLoopForUI::current()->Quit();\n        break;\n      default:\n        NOTREACHED();\n        break;\n    }\n  }\n\n  FilePath test_extensions_dir_;\n};\n\n\/\/ Fails after WebKit roll 69808:70011, http:\/\/crbug.com\/59727.\n#if defined(OS_LINUX) || defined(OS_WIN)\n#define MAYBE_TestEnableResourcesTab DISABLED_TestEnableResourcesTab\n#else\n#define MAYBE_TestEnableResourcesTab TestEnableResourcesTab\n#endif  \/\/ defined(OS_LINUX) || defined(OS_WIN)\n\n\/\/ Tests resources panel enabling.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Fails after WebKit roll 59365:59477, http:\/\/crbug.com\/44202.\n#if defined(OS_LINUX)\n#define MAYBE_TestResourceContentLength FLAKY_TestResourceContentLength\n#else\n#define MAYBE_TestResourceContentLength TestResourceContentLength\n#endif  \/\/ defined(OS_LINUX)\n\n\/\/ Tests resources have correct sizes.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestResourceContentLength) {\n  RunTest(\"testResourceContentLength\", kResourceContentLengthTestPage);\n}\n\n\/\/ Tests resource headers.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kResourceTestPage);\n}\n\n\/\/ Tests cached resource mime type.\n\/\/ @see http:\/\/crbug.com\/27364\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestCachedResourceMimeType) {\n  RunTest(\"testCachedResourceMimeType\", kResourceTestPage);\n}\n\n\/\/ Tests profiler panel.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests heap profiler.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHeapProfiler) {\n  RunTest(\"testHeapProfiler\", kHeapProfilerPage);\n}\n\n\/\/ Tests scripts panel showing.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests that scripts tab is populated with inspected scripts even if it\n\/\/ hadn't been shown by the moment inspected paged refreshed.\n\/\/ @see http:\/\/crbug.com\/26312\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest,\n                       TestScriptsTabIsPopulatedOnInspectedPageRefresh) {\n  \/\/ Clear inspector settings to ensure that Elements will be\n  \/\/ current panel when DevTools window is open.\n  GetInspectedTab()->render_view_host()->delegate()->ClearInspectorSettings();\n  RunTest(\"testScriptsTabIsPopulatedOnInspectedPageRefresh\",\n          kDebuggerTestPage);\n}\n\n\/\/ Tests that a content script is in the scripts list.\n\/\/ This test is disabled, see bug 28961.\nIN_PROC_BROWSER_TEST_F(DevToolsExtensionDebugTest,\n                       TestContentScriptIsPresent) {\n  LoadExtension(\"simple_content_script\");\n  RunTest(\"testContentScriptIsPresent\", kPageWithContentScript);\n}\n\n\/\/ Tests that scripts are not duplicated after Scripts Panel switch.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest,\n                       TestNoScriptDuplicatesOnPanelSwitch) {\n  RunTest(\"testNoScriptDuplicatesOnPanelSwitch\", kDebuggerTestPage);\n}\n\n\/\/ Tests that debugger works correctly if pause event occurs when DevTools\n\/\/ frontend is being loaded.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestPauseWhenLoadingDevTools) {\n  RunTest(\"testPauseWhenLoadingDevTools\", kPauseWhenLoadingDevTools);\n}\n\n\/\/ Tests that pressing 'Pause' will pause script execution if the script\n\/\/ is already running.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestPauseWhenScriptIsRunning) {\n  RunTest(\"testPauseWhenScriptIsRunning\", kPauseWhenScriptIsRunning);\n}\n\n\/\/ Fails after WebKit roll 66724:66804, http:\/\/crbug.com\/54592\n#if defined(OS_LINUX) || defined(OS_WIN)\n#define MAYBE_TestCompletionOnPause FAILS_TestCompletionOnPause\n#else\n#define MAYBE_TestCompletionOnPause TestCompletionOnPause\n#endif  \/\/ defined(OS_LINUX) || defined(OS_WIN)\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, MAYBE_TestCompletionOnPause) {\n  RunTest(\"testCompletionOnPause\", kCompletionOnPause);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n}  \/\/ namespace\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\/command_line.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n  BrowserClosedObserver(Browser* browser) {\n    registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n                   Source<Browser>(browser));\n    ui_test_utils::RunMessageLoop();\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst wchar_t kConsoleTestPage[] = L\"files\/devtools\/console_test_page.html\";\nconst wchar_t kDebuggerTestPage[] = L\"files\/devtools\/debugger_test_page.html\";\nconst wchar_t kEvalTestPage[] = L\"files\/devtools\/eval_test_page.html\";\nconst wchar_t kJsPage[] = L\"files\/devtools\/js_page.html\";\nconst wchar_t kSimplePage[] = L\"files\/devtools\/simple_page.html\";\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::wstring& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\", test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::wstring& test_page) {\n    HTTPTestServer* server = StartHTTPServer();\n    GURL url = server->TestServerPageW(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    TabContents* tab = browser()->GetTabContentsAt(0);\n    inspected_rvh_ = tab->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n    BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\/\/ WebInspector opens.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHostIsPresent) {\n  RunTest(\"testHostIsPresent\", kSimplePage);\n}\n\n\/\/ Tests elements panel basics.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestElementsTreeRoot) {\n  RunTest(\"testElementsTreeRoot\", kSimplePage);\n}\n\n\/\/ Tests main resource load.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestMainResource) {\n  RunTest(\"testMainResource\", kSimplePage);\n}\n\n\/\/ Tests resources panel enabling.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Tests resource headers.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kDebuggerTestPage);\n}\n\n\/\/ Tests profiler panel.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests scripts panel showing.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests set breakpoint.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestSetBreakpoint) {\n  RunTest(\"testSetBreakpoint\", kDebuggerTestPage);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n\/\/ Tests console eval.\n\/\/ DISABLED:  See http:\/\/crbug.com\/18786\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleEval) {\n  RunTest(\"testConsoleEval\", kConsoleTestPage);\n}\n\n\/\/ Tests console log.\n\/\/ DISABLED:  See http:\/\/crbug.com\/18786\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleLog) {\n  RunTest(\"testConsoleLog\", kConsoleTestPage);\n}\n\n\/\/ Tests eval global values.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalGlobal) {\n  RunTest(\"testEvalGlobal\", kEvalTestPage);\n}\n\n\/\/ Tests eval on call frame.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalCallFrame) {\n  RunTest(\"testEvalCallFrame\", kEvalTestPage);\n}\n\n}  \/\/ namespace\n<commit_msg>DevTools: Disable sanity tests while merging the DOMAgent commit upstream. (Re-apply 23350).<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\/command_line.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n  BrowserClosedObserver(Browser* browser) {\n    registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n                   Source<Browser>(browser));\n    ui_test_utils::RunMessageLoop();\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst wchar_t kConsoleTestPage[] = L\"files\/devtools\/console_test_page.html\";\nconst wchar_t kDebuggerTestPage[] = L\"files\/devtools\/debugger_test_page.html\";\nconst wchar_t kEvalTestPage[] = L\"files\/devtools\/eval_test_page.html\";\nconst wchar_t kJsPage[] = L\"files\/devtools\/js_page.html\";\nconst wchar_t kSimplePage[] = L\"files\/devtools\/simple_page.html\";\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::wstring& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\", test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::wstring& test_page) {\n    HTTPTestServer* server = StartHTTPServer();\n    GURL url = server->TestServerPageW(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    TabContents* tab = browser()->GetTabContentsAt(0);\n    inspected_rvh_ = tab->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n    BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\/*\n\nDisable tests while merging DOMAgent commit upstream.\n\n\/\/ WebInspector opens.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHostIsPresent) {\n  RunTest(\"testHostIsPresent\", kSimplePage);\n}\n\n\/\/ Tests elements panel basics.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestElementsTreeRoot) {\n  RunTest(\"testElementsTreeRoot\", kSimplePage);\n}\n\n\/\/ Tests main resource load.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestMainResource) {\n  RunTest(\"testMainResource\", kSimplePage);\n}\n\n\/\/ Tests resources panel enabling.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Tests resource headers.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kDebuggerTestPage);\n}\n\n\/\/ Tests profiler panel.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests scripts panel showing.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests set breakpoint.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestSetBreakpoint) {\n  RunTest(\"testSetBreakpoint\", kDebuggerTestPage);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n\/\/ Tests console eval.\n\/\/ DISABLED:  See http:\/\/crbug.com\/18786\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleEval) {\n  RunTest(\"testConsoleEval\", kConsoleTestPage);\n}\n\n\/\/ Tests console log.\n\/\/ DISABLED:  See http:\/\/crbug.com\/18786\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleLog) {\n  RunTest(\"testConsoleLog\", kConsoleTestPage);\n}\n\n\/\/ Tests eval global values.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalGlobal) {\n  RunTest(\"testEvalGlobal\", kEvalTestPage);\n}\n\n\/\/ Tests eval on call frame.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalCallFrame) {\n  RunTest(\"testEvalCallFrame\", kEvalTestPage);\n}\n\n*\/\n\n}  \/\/ namespace\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\/command_line.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n  BrowserClosedObserver(Browser* browser) {\n    registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n                   Source<Browser>(browser));\n    ui_test_utils::RunMessageLoop();\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst wchar_t kConsoleTestPage[] = L\"files\/devtools\/console_test_page.html\";\nconst wchar_t kDebuggerTestPage[] = L\"files\/devtools\/debugger_test_page.html\";\nconst wchar_t kEvalTestPage[] = L\"files\/devtools\/eval_test_page.html\";\nconst wchar_t kJsPage[] = L\"files\/devtools\/js_page.html\";\nconst wchar_t kResourceTestPage[] = L\"files\/devtools\/resource_test_page.html\";\nconst wchar_t kSimplePage[] = L\"files\/devtools\/simple_page.html\";\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::wstring& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\",\n                                      test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::wstring& test_page) {\n    HTTPTestServer* server = StartHTTPServer();\n    GURL url = server->TestServerPageW(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    TabContents* tab = browser()->GetTabContentsAt(0);\n    inspected_rvh_ = tab->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n    BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\/\/ WebInspector opens.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHostIsPresent) {\n  RunTest(\"testHostIsPresent\", kSimplePage);\n}\n\n\/\/ Tests elements panel basics.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestElementsTreeRoot) {\n  RunTest(\"testElementsTreeRoot\", kSimplePage);\n}\n\n\/\/ Tests main resource load.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestMainResource) {\n  RunTest(\"testMainResource\", kSimplePage);\n}\n\n\/\/ Tests resources panel enabling.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Tests resource headers.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kResourceTestPage);\n}\n\n\/\/ Tests profiler panel.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests scripts panel showing.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests set breakpoint.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestSetBreakpoint) {\n  RunTest(\"testSetBreakpoint\", kDebuggerTestPage);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n\/\/ Tests console eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestConsoleEval) {\n  RunTest(\"testConsoleEval\", kConsoleTestPage);\n}\n\n\/\/ Tests console log.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestConsoleLog) {\n  RunTest(\"testConsoleLog\", kConsoleTestPage);\n}\n\n\/\/ Tests eval global values.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalGlobal) {\n  RunTest(\"testEvalGlobal\", kEvalTestPage);\n}\n\n\/\/ Tests eval on call frame.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalCallFrame) {\n  RunTest(\"testEvalCallFrame\", kEvalTestPage);\n}\n\n}  \/\/ namespace\n<commit_msg>DevTools: temporary disable TestConsoleLog and TestEvalGlobal that would fail with next WebKit roll. Review URL: http:\/\/codereview.chromium.org\/208009<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\/command_line.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/debugger\/devtools_client_host.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_registrar.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\n\nnamespace {\n\n\/\/ Used to block until a dev tools client window's browser is closed.\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n  BrowserClosedObserver(Browser* browser) {\n    registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n                   Source<Browser>(browser));\n    ui_test_utils::RunMessageLoop();\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    MessageLoopForUI::current()->Quit();\n  }\n\n private:\n  NotificationRegistrar registrar_;\n  DISALLOW_COPY_AND_ASSIGN(BrowserClosedObserver);\n};\n\n\/\/ The delay waited in some cases where we don't have a notifications for an\n\/\/ action we take.\nconst int kActionDelayMs = 500;\n\nconst wchar_t kConsoleTestPage[] = L\"files\/devtools\/console_test_page.html\";\nconst wchar_t kDebuggerTestPage[] = L\"files\/devtools\/debugger_test_page.html\";\nconst wchar_t kEvalTestPage[] = L\"files\/devtools\/eval_test_page.html\";\nconst wchar_t kJsPage[] = L\"files\/devtools\/js_page.html\";\nconst wchar_t kResourceTestPage[] = L\"files\/devtools\/resource_test_page.html\";\nconst wchar_t kSimplePage[] = L\"files\/devtools\/simple_page.html\";\n\nclass DevToolsSanityTest : public InProcessBrowserTest {\n public:\n  DevToolsSanityTest() {\n    set_show_window(true);\n    EnableDOMAutomation();\n  }\n\n protected:\n  void RunTest(const std::string& test_name, const std::wstring& test_page) {\n    OpenDevToolsWindow(test_page);\n    std::string result;\n\n    \/\/ At first check that JavaScript part of the front-end is loaded by\n    \/\/ checking that global variable uiTests exists(it's created after all js\n    \/\/ files have been loaded) and has runTest method.\n    ASSERT_TRUE(\n        ui_test_utils::ExecuteJavaScriptAndExtractString(\n            client_contents_->render_view_host(),\n            L\"\",\n            L\"window.domAutomationController.send(\"\n            L\"'' + (window.uiTests && (typeof uiTests.runTest)));\",\n            &result));\n\n    if (result == \"function\") {\n      ASSERT_TRUE(\n          ui_test_utils::ExecuteJavaScriptAndExtractString(\n              client_contents_->render_view_host(),\n              L\"\",\n              UTF8ToWide(StringPrintf(\"uiTests.runTest('%s')\",\n                                      test_name.c_str())),\n              &result));\n      EXPECT_EQ(\"[OK]\", result);\n    } else {\n      FAIL() << \"DevTools front-end is broken.\";\n    }\n    CloseDevToolsWindow();\n  }\n\n  void OpenDevToolsWindow(const std::wstring& test_page) {\n    HTTPTestServer* server = StartHTTPServer();\n    GURL url = server->TestServerPageW(test_page);\n    ui_test_utils::NavigateToURL(browser(), url);\n\n    TabContents* tab = browser()->GetTabContentsAt(0);\n    inspected_rvh_ = tab->render_view_host();\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    devtools_manager->OpenDevToolsWindow(inspected_rvh_);\n\n    DevToolsClientHost* client_host =\n        devtools_manager->GetDevToolsClientHostFor(inspected_rvh_);\n    window_ = client_host->AsDevToolsWindow();\n    RenderViewHost* client_rvh = window_->GetRenderViewHost();\n    client_contents_ = client_rvh->delegate()->GetAsTabContents();\n    ui_test_utils::WaitForNavigation(&client_contents_->controller());\n  }\n\n  void CloseDevToolsWindow() {\n    DevToolsManager* devtools_manager = DevToolsManager::GetInstance();\n    \/\/ UnregisterDevToolsClientHostFor may destroy window_ so store the browser\n    \/\/ first.\n    Browser* browser = window_->browser();\n    devtools_manager->UnregisterDevToolsClientHostFor(inspected_rvh_);\n    BrowserClosedObserver close_observer(browser);\n  }\n\n  TabContents* client_contents_;\n  DevToolsWindow* window_;\n  RenderViewHost* inspected_rvh_;\n};\n\n\/\/ WebInspector opens.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestHostIsPresent) {\n  RunTest(\"testHostIsPresent\", kSimplePage);\n}\n\n\/\/ Tests elements panel basics.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestElementsTreeRoot) {\n  RunTest(\"testElementsTreeRoot\", kSimplePage);\n}\n\n\/\/ Tests main resource load.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestMainResource) {\n  RunTest(\"testMainResource\", kSimplePage);\n}\n\n\/\/ Tests resources panel enabling.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEnableResourcesTab) {\n  RunTest(\"testEnableResourcesTab\", kSimplePage);\n}\n\n\/\/ Tests resource headers.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestResourceHeaders) {\n  RunTest(\"testResourceHeaders\", kResourceTestPage);\n}\n\n\/\/ Tests profiler panel.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestProfilerTab) {\n  RunTest(\"testProfilerTab\", kJsPage);\n}\n\n\/\/ Tests scripts panel showing.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestShowScriptsTab) {\n  RunTest(\"testShowScriptsTab\", kDebuggerTestPage);\n}\n\n\/\/ Tests set breakpoint.\n\/\/ http:\/\/crbug.com\/16767\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestSetBreakpoint) {\n  RunTest(\"testSetBreakpoint\", kDebuggerTestPage);\n}\n\n\/\/ Tests that 'Pause' button works for eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestPauseInEval) {\n  RunTest(\"testPauseInEval\", kDebuggerTestPage);\n}\n\n\/\/ Tests console eval.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestConsoleEval) {\n  RunTest(\"testConsoleEval\", kConsoleTestPage);\n}\n\n\/\/ Tests console log.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestConsoleLog) {\n  RunTest(\"testConsoleLog\", kConsoleTestPage);\n}\n\n\/\/ Tests eval global values.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, DISABLED_TestEvalGlobal) {\n  RunTest(\"testEvalGlobal\", kEvalTestPage);\n}\n\n\/\/ Tests eval on call frame.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest, TestEvalCallFrame) {\n  RunTest(\"testEvalCallFrame\", kEvalTestPage);\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\/extensions\/extension_apitest.h\"\n#include \"net\/base\/mock_host_resolver.h\"\n\nclass ExecuteScriptApiTest : public ExtensionApiTest {\n protected:\n  void SetupDelayedHostResolver() {\n    \/\/ We need a.com to be a little bit slow to trigger a race condition.\n    host_resolver()->AddRuleWithLatency(\"a.com\", \"127.0.0.1\", 500);\n    host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n    host_resolver()->AddRule(\"c.com\", \"127.0.0.1\");\n  }\n};\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptBasic) {\n  SetupDelayedHostResolver();\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/basic\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptInFrame) {\n  SetupDelayedHostResolver();\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/in_frame\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptPermissions) {\n  SetupDelayedHostResolver();\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/permissions\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/84760\n#if defined(OS_CHROMEOS)\n#define MAYBE_ExecuteScriptFileAfterClose DISABLED_ExecuteScriptFileAfterClose\n#else\n#define MAYBE_ExecuteScriptFileAfterClose ExecuteScriptFileAfterClose\n#endif  \/\/ defined(OS_CHROMEOS)\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n                       MAYBE_ExecuteScriptFileAfterClose) {\n  host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/file_after_close\")) << message_;\n}\n\n\/\/ Crashy, http:\/\/crbug.com\/67774.\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n                       DISABLED_ExecuteScriptFragmentNavigation) {\n  ASSERT_TRUE(StartTestServer());\n  const char* extension_name = \"executescript\/fragment\";\n  ASSERT_TRUE(RunExtensionTest(extension_name)) << message_;\n}\n\n\/\/ Time-outy linux. http:\/\/crbug.com\/89076\n#if defined(OS_LINUX)\n#define MAYBE_NavigationRaceExecuteScript DISABLED_NavigationRaceExecuteScript\n#else\n#define MAYBE_NavigationRaceExecuteScript NavigationRaceExecuteScript\n#endif\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n                       MAYBE_NavigationRaceExecuteScript) {\n  host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n  host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionSubtest(\"executescript\/navigation_race\",\n                                  \"execute_script.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, NavigationRaceJavaScriptUrl) {\n  host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n  host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionSubtest(\"executescript\/navigation_race\",\n                                  \"javascript_url.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptFrameAfterLoad) {\n  SetupDelayedHostResolver();\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/frame_after_load\")) << message_;\n}\n<commit_msg>Forgot to actually re-enable the test in r92388.<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\/extension_apitest.h\"\n#include \"net\/base\/mock_host_resolver.h\"\n\nclass ExecuteScriptApiTest : public ExtensionApiTest {\n protected:\n  void SetupDelayedHostResolver() {\n    \/\/ We need a.com to be a little bit slow to trigger a race condition.\n    host_resolver()->AddRuleWithLatency(\"a.com\", \"127.0.0.1\", 500);\n    host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n    host_resolver()->AddRule(\"c.com\", \"127.0.0.1\");\n  }\n};\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptBasic) {\n  SetupDelayedHostResolver();\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/basic\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptInFrame) {\n  SetupDelayedHostResolver();\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/in_frame\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptPermissions) {\n  SetupDelayedHostResolver();\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/permissions\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/84760\n#if defined(OS_CHROMEOS)\n#define MAYBE_ExecuteScriptFileAfterClose DISABLED_ExecuteScriptFileAfterClose\n#else\n#define MAYBE_ExecuteScriptFileAfterClose ExecuteScriptFileAfterClose\n#endif  \/\/ defined(OS_CHROMEOS)\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n                       MAYBE_ExecuteScriptFileAfterClose) {\n  host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/file_after_close\")) << message_;\n}\n\n\/\/ Crashy, http:\/\/crbug.com\/67774.\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n                       DISABLED_ExecuteScriptFragmentNavigation) {\n  ASSERT_TRUE(StartTestServer());\n  const char* extension_name = \"executescript\/fragment\";\n  ASSERT_TRUE(RunExtensionTest(extension_name)) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, NavigationRaceExecuteScript) {\n  host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n  host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionSubtest(\"executescript\/navigation_race\",\n                                  \"execute_script.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, NavigationRaceJavaScriptUrl) {\n  host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n  host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionSubtest(\"executescript\/navigation_race\",\n                                  \"javascript_url.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptFrameAfterLoad) {\n  SetupDelayedHostResolver();\n  ASSERT_TRUE(StartTestServer());\n  ASSERT_TRUE(RunExtensionTest(\"executescript\/frame_after_load\")) << message_;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of the kolab resource - the implementation of the\n    Kolab storage format. See www.kolab.org for documentation on this.\n\n    Copyright (c) 2004 Bo Thorsen <bo@sonofthor.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 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    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 \"task.h\"\n\n#include <libkcal\/todo.h>\n#include <kdebug.h>\n\nusing namespace Kolab;\n\n\nKCal::Todo* Task::xmlToTask( const QString& xml, const QString& tz )\n{\n  Task task( tz );\n  task.load( xml );\n  KCal::Todo* todo = new KCal::Todo();\n  task.saveTo( todo );\n  return todo;\n}\n\nQString Task::taskToXML( KCal::Todo* todo, const QString& tz )\n{\n  Task task( tz, todo );\n  return task.saveXML();\n}\n\nTask::Task( const QString& tz, KCal::Todo* task )\n  : Incidence( tz ), mPriority( 3 ), mPercentCompleted( 100 ),\n    mStatus( KCal::Incidence::StatusNone ),\n    mHasStartDate( false ), mHasDueDate( false ),\n    mHasCompletedDate( false )\n{\n  if ( task )\n    setFields( task );\n}\n\nTask::~Task()\n{\n}\n\nvoid Task::setPriority( int priority )\n{\n  mPriority = priority;\n}\n\nint Task::priority() const\n{\n  return mPriority;\n}\n\nvoid Task::setPercentCompleted( int percent )\n{\n  mPercentCompleted = percent;\n}\n\nint Task::percentCompleted() const\n{\n  return mPercentCompleted;\n}\n\nvoid Task::setStatus( KCal::Incidence::Status status )\n{\n  mStatus = status;\n}\n\nKCal::Incidence::Status Task::status() const\n{\n  return mStatus;\n}\n\nvoid Task::setParent( const QString& parentUid )\n{\n  mParent = parentUid;\n}\n\nQString Task::parent() const\n{\n  return mParent;\n}\n\nvoid Task::setDueDate( const QDateTime& date )\n{\n  mDueDate = date;\n  mHasDueDate = true;\n}\n\nQDateTime Task::dueDate() const\n{\n  return mDueDate;\n}\n\nvoid Task::setHasStartDate( bool v )\n{\n  mHasStartDate = v;\n}\n\nbool Task::hasStartDate() const\n{\n  return mHasStartDate;\n}\n\nbool Task::hasDueDate() const\n{\n  return mHasDueDate;\n}\n\nvoid Task::setCompletedDate( const QDateTime& date )\n{\n  mCompletedDate = date;\n  mHasCompletedDate = true;\n}\n\nQDateTime Task::completedDate() const\n{\n  return mCompletedDate;\n}\n\nbool Task::hasCompletedDate() const\n{\n  return mHasCompletedDate;\n}\n\nbool Task::loadAttribute( QDomElement& element )\n{\n  QString tagName = element.tagName();\n\n  if ( tagName == \"priority\" ) {\n    bool ok;\n    int priority = element.text().toInt( &ok );\n    if ( !ok || priority < 0 || priority > 5 )\n      priority = 3;\n    setPriority( priority );\n  } else if ( tagName == \"completed\" ) {\n    bool ok;\n    int percent = element.text().toInt( &ok );\n    if ( !ok || percent < 0 || percent > 100 )\n      percent = 0;\n    setPercentCompleted( percent );\n  } else if ( tagName == \"status\" ) {\n    if ( element.text() == \"in-progress\" )\n      setStatus( KCal::Incidence::StatusInProcess );\n    else if ( element.text() == \"completed\" )\n      setStatus( KCal::Incidence::StatusCompleted );\n    else if ( element.text() == \"waiting-on-someone-else\" )\n      setStatus( KCal::Incidence::StatusNeedsAction );\n    else if ( element.text() == \"deferred\" )\n      \/\/ Guessing a status here\n      setStatus( KCal::Incidence::StatusCanceled );\n    else\n      \/\/ Default\n      setStatus( KCal::Incidence::StatusNone );\n  } else if ( tagName == \"due-date\" )\n    setDueDate( stringToDateTime( element.text() ) );\n  else if ( tagName == \"parent\" )\n    setParent( element.text() );\n  else if ( tagName == \"x-completed-date\" )\n    setCompletedDate( stringToDateTime( element.text() ) );\n  else if ( tagName == \"start-date\" ) {\n    setHasStartDate( true );\n    setStartDate( element.text() );\n  } else\n    return Incidence::loadAttribute( element );\n\n  \/\/ We handled this\n  return true;\n}\n\nbool Task::saveAttributes( QDomElement& element ) const\n{\n  \/\/ Save the base class elements\n  Incidence::saveAttributes( element );\n\n  writeString( element, \"priority\", QString::number( priority() ) );\n  writeString( element, \"completed\", QString::number( percentCompleted() ) );\n\n  switch( status() ) {\n  case KCal::Incidence::StatusInProcess:\n    writeString( element, \"status\", \"in-progress\" );\n    break;\n  case KCal::Incidence::StatusCompleted:\n    writeString( element, \"status\", \"completed\" );\n    break;\n  case KCal::Incidence::StatusNeedsAction:\n    writeString( element, \"status\", \"waiting-on-someone-else\" );\n    break;\n  case KCal::Incidence::StatusCanceled:\n    writeString( element, \"status\", \"deferred\" );\n    break;\n  case KCal::Incidence::StatusNone:\n    writeString( element, \"status\", \"not-started\" );\n    break;\n  case KCal::Incidence::StatusTentative:\n  case KCal::Incidence::StatusConfirmed:\n  case KCal::Incidence::StatusDraft:\n  case KCal::Incidence::StatusFinal:\n  case KCal::Incidence::StatusX:\n    \/\/ All of these are saved as StatusNone.\n    writeString( element, \"status\", \"not-started\" );\n    break;\n  }\n\n  if ( hasDueDate() )\n    writeString( element, \"due-date\", dateTimeToString( dueDate() ) );\n\n  if ( !parent().isNull() )\n    writeString( element, \"parent\", parent() );\n\n  if ( hasCompletedDate() )\n    writeString( element, \"x-completed-date\", dateTimeToString( completedDate() ) );\n\n  return true;\n}\n\n\nbool Task::loadXML( const QDomDocument& document )\n{\n  QDomElement top = document.documentElement();\n\n  if ( top.tagName() != \"task\" ) {\n    qWarning( \"XML error: Top tag was %s instead of the expected task\",\n              top.tagName().ascii() );\n    return false;\n  }\n  setHasStartDate( false ); \/\/ todo's don't necessarily have one\n\n  for ( QDomNode n = top.firstChild(); !n.isNull(); n = n.nextSibling() ) {\n    if ( n.isComment() )\n      continue;\n    if ( n.isElement() ) {\n      QDomElement e = n.toElement();\n      if ( !loadAttribute( e ) )\n        \/\/ TODO: Unhandled tag - save for later storage\n        kdDebug() << \"Warning: Unhandled tag \" << e.tagName() << endl;\n    } else\n      kdDebug() << \"Node is not a comment or an element???\" << endl;\n  }\n\n\n  return true;\n}\n\nQString Task::saveXML() const\n{\n  QDomDocument document = domTree();\n  QDomElement element = document.createElement( \"task\" );\n  element.setAttribute( \"version\", \"1.0\" );\n  saveAttributes( element );\n  if ( !hasStartDate() ) {\n    \/\/ events and journals always have a start date, but tasks don't.\n    \/\/ Remove the entry done by the inherited save above, because we\n    \/\/ don't have one.\n    QDomNodeList l = element.elementsByTagName( \"start-date\" );\n    Q_ASSERT( l.count() == 1 );\n    element.removeChild( l.item( 0 ) );\n  }\n  document.appendChild( element );\n  return document.toString();\n}\n\nvoid Task::setFields( const KCal::Todo* task )\n{\n  Incidence::setFields( task );\n\n  setPriority( task->priority() );\n  setPercentCompleted( task->percentComplete() );\n  setStatus( task->status() );\n  setHasStartDate( task->hasStartDate() );\n\n  if ( task->hasDueDate() )\n    setDueDate( localToUTC( task->dtDue() ) );\n  else\n    mHasDueDate = false;\n  if ( task->relatedTo() )\n    setParent( task->relatedTo()->uid() );\n  else\n    setParent( QString::null );\n\n  if ( task->hasCompletedDate() )\n    setCompletedDate( localToUTC( task->completed() ) );\n  else\n    mHasCompletedDate = false;\n}\n\nvoid Task::saveTo( KCal::Todo* task )\n{\n  Incidence::saveTo( task );\n\n  task->setPriority( priority() );\n  task->setPercentComplete( percentCompleted() );\n  task->setStatus( status() );\n  task->setHasStartDate( hasStartDate() );\n  task->setHasDueDate( hasDueDate() );\n  if ( hasDueDate() )\n    task->setDtDue( utcToLocal( dueDate() ) );\n\n  if ( parent() != QString::null )\n    task->setRelatedToUid( parent() );\n\n  if ( hasCompletedDate() )\n    task->setCompleted( utcToLocal( mCompletedDate ) );\n}\n<commit_msg>Default to 0% completed, not 100%, as per spec.<commit_after>\/*\n    This file is part of the kolab resource - the implementation of the\n    Kolab storage format. See www.kolab.org for documentation on this.\n\n    Copyright (c) 2004 Bo Thorsen <bo@sonofthor.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 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    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 \"task.h\"\n\n#include <libkcal\/todo.h>\n#include <kdebug.h>\n\nusing namespace Kolab;\n\n\nKCal::Todo* Task::xmlToTask( const QString& xml, const QString& tz )\n{\n  Task task( tz );\n  task.load( xml );\n  KCal::Todo* todo = new KCal::Todo();\n  task.saveTo( todo );\n  return todo;\n}\n\nQString Task::taskToXML( KCal::Todo* todo, const QString& tz )\n{\n  Task task( tz, todo );\n  return task.saveXML();\n}\n\nTask::Task( const QString& tz, KCal::Todo* task )\n  : Incidence( tz ), mPriority( 3 ), mPercentCompleted( 0 ),\n    mStatus( KCal::Incidence::StatusNone ),\n    mHasStartDate( false ), mHasDueDate( false ),\n    mHasCompletedDate( false )\n{\n  if ( task )\n    setFields( task );\n}\n\nTask::~Task()\n{\n}\n\nvoid Task::setPriority( int priority )\n{\n  mPriority = priority;\n}\n\nint Task::priority() const\n{\n  return mPriority;\n}\n\nvoid Task::setPercentCompleted( int percent )\n{\n  mPercentCompleted = percent;\n}\n\nint Task::percentCompleted() const\n{\n  return mPercentCompleted;\n}\n\nvoid Task::setStatus( KCal::Incidence::Status status )\n{\n  mStatus = status;\n}\n\nKCal::Incidence::Status Task::status() const\n{\n  return mStatus;\n}\n\nvoid Task::setParent( const QString& parentUid )\n{\n  mParent = parentUid;\n}\n\nQString Task::parent() const\n{\n  return mParent;\n}\n\nvoid Task::setDueDate( const QDateTime& date )\n{\n  mDueDate = date;\n  mHasDueDate = true;\n}\n\nQDateTime Task::dueDate() const\n{\n  return mDueDate;\n}\n\nvoid Task::setHasStartDate( bool v )\n{\n  mHasStartDate = v;\n}\n\nbool Task::hasStartDate() const\n{\n  return mHasStartDate;\n}\n\nbool Task::hasDueDate() const\n{\n  return mHasDueDate;\n}\n\nvoid Task::setCompletedDate( const QDateTime& date )\n{\n  mCompletedDate = date;\n  mHasCompletedDate = true;\n}\n\nQDateTime Task::completedDate() const\n{\n  return mCompletedDate;\n}\n\nbool Task::hasCompletedDate() const\n{\n  return mHasCompletedDate;\n}\n\nbool Task::loadAttribute( QDomElement& element )\n{\n  QString tagName = element.tagName();\n\n  if ( tagName == \"priority\" ) {\n    bool ok;\n    int priority = element.text().toInt( &ok );\n    if ( !ok || priority < 0 || priority > 5 )\n      priority = 3;\n    setPriority( priority );\n  } else if ( tagName == \"completed\" ) {\n    bool ok;\n    int percent = element.text().toInt( &ok );\n    if ( !ok || percent < 0 || percent > 100 )\n      percent = 0;\n    setPercentCompleted( percent );\n  } else if ( tagName == \"status\" ) {\n    if ( element.text() == \"in-progress\" )\n      setStatus( KCal::Incidence::StatusInProcess );\n    else if ( element.text() == \"completed\" )\n      setStatus( KCal::Incidence::StatusCompleted );\n    else if ( element.text() == \"waiting-on-someone-else\" )\n      setStatus( KCal::Incidence::StatusNeedsAction );\n    else if ( element.text() == \"deferred\" )\n      \/\/ Guessing a status here\n      setStatus( KCal::Incidence::StatusCanceled );\n    else\n      \/\/ Default\n      setStatus( KCal::Incidence::StatusNone );\n  } else if ( tagName == \"due-date\" )\n    setDueDate( stringToDateTime( element.text() ) );\n  else if ( tagName == \"parent\" )\n    setParent( element.text() );\n  else if ( tagName == \"x-completed-date\" )\n    setCompletedDate( stringToDateTime( element.text() ) );\n  else if ( tagName == \"start-date\" ) {\n    setHasStartDate( true );\n    setStartDate( element.text() );\n  } else\n    return Incidence::loadAttribute( element );\n\n  \/\/ We handled this\n  return true;\n}\n\nbool Task::saveAttributes( QDomElement& element ) const\n{\n  \/\/ Save the base class elements\n  Incidence::saveAttributes( element );\n\n  writeString( element, \"priority\", QString::number( priority() ) );\n  writeString( element, \"completed\", QString::number( percentCompleted() ) );\n\n  switch( status() ) {\n  case KCal::Incidence::StatusInProcess:\n    writeString( element, \"status\", \"in-progress\" );\n    break;\n  case KCal::Incidence::StatusCompleted:\n    writeString( element, \"status\", \"completed\" );\n    break;\n  case KCal::Incidence::StatusNeedsAction:\n    writeString( element, \"status\", \"waiting-on-someone-else\" );\n    break;\n  case KCal::Incidence::StatusCanceled:\n    writeString( element, \"status\", \"deferred\" );\n    break;\n  case KCal::Incidence::StatusNone:\n    writeString( element, \"status\", \"not-started\" );\n    break;\n  case KCal::Incidence::StatusTentative:\n  case KCal::Incidence::StatusConfirmed:\n  case KCal::Incidence::StatusDraft:\n  case KCal::Incidence::StatusFinal:\n  case KCal::Incidence::StatusX:\n    \/\/ All of these are saved as StatusNone.\n    writeString( element, \"status\", \"not-started\" );\n    break;\n  }\n\n  if ( hasDueDate() )\n    writeString( element, \"due-date\", dateTimeToString( dueDate() ) );\n\n  if ( !parent().isNull() )\n    writeString( element, \"parent\", parent() );\n\n  if ( hasCompletedDate() )\n    writeString( element, \"x-completed-date\", dateTimeToString( completedDate() ) );\n\n  return true;\n}\n\n\nbool Task::loadXML( const QDomDocument& document )\n{\n  QDomElement top = document.documentElement();\n\n  if ( top.tagName() != \"task\" ) {\n    qWarning( \"XML error: Top tag was %s instead of the expected task\",\n              top.tagName().ascii() );\n    return false;\n  }\n  setHasStartDate( false ); \/\/ todo's don't necessarily have one\n\n  for ( QDomNode n = top.firstChild(); !n.isNull(); n = n.nextSibling() ) {\n    if ( n.isComment() )\n      continue;\n    if ( n.isElement() ) {\n      QDomElement e = n.toElement();\n      if ( !loadAttribute( e ) )\n        \/\/ TODO: Unhandled tag - save for later storage\n        kdDebug() << \"Warning: Unhandled tag \" << e.tagName() << endl;\n    } else\n      kdDebug() << \"Node is not a comment or an element???\" << endl;\n  }\n\n\n  return true;\n}\n\nQString Task::saveXML() const\n{\n  QDomDocument document = domTree();\n  QDomElement element = document.createElement( \"task\" );\n  element.setAttribute( \"version\", \"1.0\" );\n  saveAttributes( element );\n  if ( !hasStartDate() ) {\n    \/\/ events and journals always have a start date, but tasks don't.\n    \/\/ Remove the entry done by the inherited save above, because we\n    \/\/ don't have one.\n    QDomNodeList l = element.elementsByTagName( \"start-date\" );\n    Q_ASSERT( l.count() == 1 );\n    element.removeChild( l.item( 0 ) );\n  }\n  document.appendChild( element );\n  return document.toString();\n}\n\nvoid Task::setFields( const KCal::Todo* task )\n{\n  Incidence::setFields( task );\n\n  setPriority( task->priority() );\n  setPercentCompleted( task->percentComplete() );\n  setStatus( task->status() );\n  setHasStartDate( task->hasStartDate() );\n\n  if ( task->hasDueDate() )\n    setDueDate( localToUTC( task->dtDue() ) );\n  else\n    mHasDueDate = false;\n  if ( task->relatedTo() )\n    setParent( task->relatedTo()->uid() );\n  else\n    setParent( QString::null );\n\n  if ( task->hasCompletedDate() )\n    setCompletedDate( localToUTC( task->completed() ) );\n  else\n    mHasCompletedDate = false;\n}\n\nvoid Task::saveTo( KCal::Todo* task )\n{\n  Incidence::saveTo( task );\n\n  task->setPriority( priority() );\n  task->setPercentComplete( percentCompleted() );\n  task->setStatus( status() );\n  task->setHasStartDate( hasStartDate() );\n  task->setHasDueDate( hasDueDate() );\n  if ( hasDueDate() )\n    task->setDtDue( utcToLocal( dueDate() ) );\n\n  if ( parent() != QString::null )\n    task->setRelatedToUid( parent() );\n\n  if ( hasCompletedDate() )\n    task->setCompleted( utcToLocal( mCompletedDate ) );\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 <algorithm>\n#include <list>\n#include <map>\n\n#include \"chrome\/browser\/browser_thread.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/login\/login_prompt.h\"\n#include \"chrome\/browser\/ui\/tab_contents\/tab_contents_wrapper.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/base\/auth.h\"\n\nnamespace {\n\nclass LoginPromptBrowserTest : public InProcessBrowserTest {\n public:\n  LoginPromptBrowserTest()\n      : bad_password_(L\"incorrect\"), bad_username_(L\"nouser\") {\n    set_show_window(true);\n\n    auth_map_[L\"foo\"] = AuthInfo(L\"testuser\", L\"foopassword\");\n    auth_map_[L\"bar\"] = AuthInfo(L\"testuser\", L\"barpassword\");\n  }\n\n protected:\n  void SetAuthFor(LoginHandler* handler);\n\n  struct AuthInfo {\n    std::wstring username_;\n    std::wstring password_;\n\n    AuthInfo() {}\n\n    AuthInfo(const std::wstring username,\n             const std::wstring password)\n        : username_(username), password_(password) {}\n  };\n\n  std::map<std::wstring, AuthInfo> auth_map_;\n  std::wstring bad_password_;\n  std::wstring bad_username_;\n};\n\nvoid LoginPromptBrowserTest::SetAuthFor(LoginHandler* handler) {\n  const net::AuthChallengeInfo* challenge = handler->auth_info();\n\n  ASSERT_TRUE(challenge);\n  std::map<std::wstring, AuthInfo>::iterator i =\n      auth_map_.find(challenge->realm);\n  EXPECT_TRUE(auth_map_.end() != i);\n  if (i != auth_map_.end()) {\n    const AuthInfo& info = i->second;\n    handler->SetAuth(info.username_, info.password_);\n  }\n}\n\n\/\/ Maintains a set of LoginHandlers that are currently active and\n\/\/ keeps a count of the notifications that were observed.\nclass LoginPromptBrowserTestObserver : public NotificationObserver {\n public:\n  LoginPromptBrowserTestObserver()\n      : auth_needed_count_(0),\n        auth_supplied_count_(0),\n        auth_cancelled_count_(0) {}\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details);\n\n  void AddHandler(LoginHandler* handler);\n\n  void RemoveHandler(LoginHandler* handler);\n\n  void Register(const NotificationSource& source);\n\n  std::list<LoginHandler*> handlers_;\n\n  \/\/ The exact number of notifications we receive is depedent on the\n  \/\/ number of requests that were dispatched and is subject to a\n  \/\/ number of factors that we don't directly control here.  The\n  \/\/ values below should only be used qualitatively.\n  int auth_needed_count_;\n  int auth_supplied_count_;\n  int auth_cancelled_count_;\n\n private:\n  NotificationRegistrar registrar_;\n\n  DISALLOW_COPY_AND_ASSIGN(LoginPromptBrowserTestObserver);\n};\n\nvoid LoginPromptBrowserTestObserver::Observe(\n    NotificationType type,\n    const NotificationSource& source,\n    const NotificationDetails& details) {\n  if (type == NotificationType::AUTH_NEEDED) {\n    LoginNotificationDetails* login_details =\n        Details<LoginNotificationDetails>(details).ptr();\n    AddHandler(login_details->handler());\n    auth_needed_count_++;\n  } else if (type == NotificationType::AUTH_SUPPLIED) {\n    AuthSuppliedLoginNotificationDetails* login_details =\n        Details<AuthSuppliedLoginNotificationDetails>(details).ptr();\n    RemoveHandler(login_details->handler());\n    auth_supplied_count_++;\n  } else if (type == NotificationType::AUTH_CANCELLED) {\n    LoginNotificationDetails* login_details =\n        Details<LoginNotificationDetails>(details).ptr();\n    RemoveHandler(login_details->handler());\n    auth_cancelled_count_++;\n  }\n}\n\nvoid LoginPromptBrowserTestObserver::AddHandler(LoginHandler* handler) {\n  std::list<LoginHandler*>::iterator i = std::find(handlers_.begin(),\n                                                   handlers_.end(),\n                                                   handler);\n  EXPECT_TRUE(i == handlers_.end());\n  if (i == handlers_.end())\n    handlers_.push_back(handler);\n}\n\nvoid LoginPromptBrowserTestObserver::RemoveHandler(LoginHandler* handler) {\n  std::list<LoginHandler*>::iterator i = std::find(handlers_.begin(),\n                                                   handlers_.end(),\n                                                   handler);\n  EXPECT_TRUE(i != handlers_.end());\n  if (i != handlers_.end())\n    handlers_.erase(i);\n}\n\nvoid LoginPromptBrowserTestObserver::Register(\n    const NotificationSource& source) {\n  registrar_.Add(this, NotificationType::AUTH_NEEDED, source);\n  registrar_.Add(this, NotificationType::AUTH_SUPPLIED, source);\n  registrar_.Add(this, NotificationType::AUTH_CANCELLED, source);\n}\n\ntemplate <NotificationType::Type T>\nclass WindowedNavigationObserver\n    : public ui_test_utils::WindowedNotificationObserver {\n public:\n  explicit WindowedNavigationObserver(NavigationController* controller)\n      : ui_test_utils::WindowedNotificationObserver(\n          T, Source<NavigationController>(controller)) {}\n};\n\ntypedef WindowedNavigationObserver<NotificationType::LOAD_STOP>\n    WindowedLoadStopObserver;\n\ntypedef WindowedNavigationObserver<NotificationType::AUTH_NEEDED>\n    WindowedAuthNeededObserver;\n\ntypedef WindowedNavigationObserver<NotificationType::AUTH_CANCELLED>\n    WindowedAuthCancelledObserver;\n\ntypedef WindowedNavigationObserver<NotificationType::AUTH_SUPPLIED>\n    WindowedAuthSuppliedObserver;\n\nconst char* kMultiRealmTestPage = \"files\/login\/multi_realm.html\";\nconst int   kMultiRealmTestRealmCount = 2;\nconst int   kMultiRealmTestResourceCount = 4;\n\nconst char* kSingleRealmTestPage = \"files\/login\/single_realm.html\";\nconst int   kSingleRealmTestResourceCount = 6;\n\n\/\/ Test handling of resources that require authentication even though\n\/\/ the page they are included on doesn't.  In this case we should only\n\/\/ present the minimal number of prompts necessary for successfully\n\/\/ displaying the page.  First we check whether cancelling works as\n\/\/ expected.\nIN_PROC_BROWSER_TEST_F(LoginPromptBrowserTest, MultipleRealmCancellation) {\n  ASSERT_TRUE(test_server()->Start());\n  GURL test_page = test_server()->GetURL(kMultiRealmTestPage);\n\n  TabContentsWrapper* contents =\n      browser()->GetSelectedTabContentsWrapper();\n  ASSERT_TRUE(contents);\n\n  NavigationController* controller = &contents->controller();\n  LoginPromptBrowserTestObserver observer;\n\n  observer.Register(Source<NavigationController>(controller));\n\n  WindowedLoadStopObserver load_stop_waiter(controller);\n\n  {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n    browser()->OpenURL(test_page, GURL(), CURRENT_TAB, PageTransition::TYPED);\n    auth_needed_waiter.Wait();\n  }\n\n  int n_handlers = 0;\n\n  while (n_handlers < kMultiRealmTestRealmCount) {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n\n    while (!observer.handlers_.empty()) {\n      WindowedAuthCancelledObserver auth_cancelled_waiter(controller);\n      LoginHandler* handler = *observer.handlers_.begin();\n\n      ASSERT_TRUE(handler);\n      n_handlers++;\n      handler->CancelAuth();\n      auth_cancelled_waiter.Wait();\n    }\n\n    if (n_handlers < kMultiRealmTestRealmCount)\n      auth_needed_waiter.Wait();\n  }\n\n  load_stop_waiter.Wait();\n\n  EXPECT_EQ(kMultiRealmTestRealmCount, n_handlers);\n  EXPECT_EQ(0, observer.auth_supplied_count_);\n  EXPECT_LT(0, observer.auth_needed_count_);\n  EXPECT_LT(0, observer.auth_cancelled_count_);\n  EXPECT_TRUE(test_server()->Stop());\n}\n\n\/\/ Similar to the MultipleRealmCancellation test above, but tests\n\/\/ whether supplying credentials work as exepcted.\nIN_PROC_BROWSER_TEST_F(LoginPromptBrowserTest, MultipleRealmConfirmation) {\n  ASSERT_TRUE(test_server()->Start());\n  GURL test_page = test_server()->GetURL(kMultiRealmTestPage);\n\n  TabContentsWrapper* contents =\n      browser()->GetSelectedTabContentsWrapper();\n  ASSERT_TRUE(contents);\n\n  NavigationController* controller = &contents->controller();\n  LoginPromptBrowserTestObserver observer;\n\n  observer.Register(Source<NavigationController>(controller));\n\n  WindowedLoadStopObserver load_stop_waiter(controller);\n  int n_handlers = 0;\n\n  {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n\n    browser()->OpenURL(test_page, GURL(), CURRENT_TAB, PageTransition::TYPED);\n    auth_needed_waiter.Wait();\n  }\n\n  while (n_handlers < kMultiRealmTestRealmCount) {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n\n    while (!observer.handlers_.empty()) {\n      WindowedAuthSuppliedObserver auth_supplied_waiter(controller);\n      LoginHandler* handler = *observer.handlers_.begin();\n\n      ASSERT_TRUE(handler);\n      n_handlers++;\n      SetAuthFor(handler);\n      auth_supplied_waiter.Wait();\n    }\n\n    if (n_handlers < kMultiRealmTestRealmCount)\n      auth_needed_waiter.Wait();\n  }\n\n  load_stop_waiter.Wait();\n\n  EXPECT_EQ(kMultiRealmTestRealmCount, n_handlers);\n  EXPECT_LT(0, observer.auth_needed_count_);\n  EXPECT_LT(0, observer.auth_supplied_count_);\n  EXPECT_EQ(0, observer.auth_cancelled_count_);\n  EXPECT_TRUE(test_server()->Stop());\n}\n\n\/\/ Testing for recovery from an incorrect password for the case where\n\/\/ there are multiple authenticated resources.\nIN_PROC_BROWSER_TEST_F(LoginPromptBrowserTest, IncorrectConfirmation) {\n  ASSERT_TRUE(test_server()->Start());\n  GURL test_page = test_server()->GetURL(kSingleRealmTestPage);\n\n  TabContentsWrapper* contents =\n      browser()->GetSelectedTabContentsWrapper();\n  ASSERT_TRUE(contents);\n\n  NavigationController* controller = &contents->controller();\n  LoginPromptBrowserTestObserver observer;\n\n  observer.Register(Source<NavigationController>(controller));\n\n  WindowedLoadStopObserver load_stop_waiter(controller);\n\n  {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n    browser()->OpenURL(test_page, GURL(), CURRENT_TAB, PageTransition::TYPED);\n    auth_needed_waiter.Wait();\n  }\n\n  EXPECT_FALSE(observer.handlers_.empty());\n\n  if (!observer.handlers_.empty()) {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n    WindowedAuthSuppliedObserver auth_supplied_waiter(controller);\n    LoginHandler* handler = *observer.handlers_.begin();\n\n    ASSERT_TRUE(handler);\n    handler->SetAuth(bad_username_, bad_password_);\n    auth_supplied_waiter.Wait();\n\n    \/\/ The request should be retried after the incorrect password is\n    \/\/ supplied.  This should result in a new AUTH_NEEDED notification\n    \/\/ for the same realm.\n    auth_needed_waiter.Wait();\n  }\n\n  int n_handlers = 0;\n\n  while (n_handlers < 1) {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n\n    while (!observer.handlers_.empty()) {\n      WindowedAuthSuppliedObserver auth_supplied_waiter(controller);\n      LoginHandler* handler = *observer.handlers_.begin();\n\n      ASSERT_TRUE(handler);\n      n_handlers++;\n      SetAuthFor(handler);\n      auth_supplied_waiter.Wait();\n    }\n\n    if (n_handlers < 1)\n      auth_needed_waiter.Wait();\n  }\n\n  load_stop_waiter.Wait();\n\n  \/\/ The single realm test has only one realm, and thus only one login\n  \/\/ prompt.\n  EXPECT_EQ(1, n_handlers);\n  EXPECT_LT(0, observer.auth_needed_count_);\n  EXPECT_LT(0, observer.auth_supplied_count_);\n  EXPECT_EQ(0, observer.auth_cancelled_count_);\n  EXPECT_TRUE(test_server()->Stop());\n}\n} \/\/ namespace\n<commit_msg>Marking test LoginPromptBrowserTest.IncorrectConfirmation as flaky.  See here for evidence: http:\/\/test-results.appspot.com\/dashboards\/flakiness_dashboard.html#testType=browser_tests&tests=LoginPromptBrowserTest.IncorrectConfirmation<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 <algorithm>\n#include <list>\n#include <map>\n\n#include \"chrome\/browser\/browser_thread.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/login\/login_prompt.h\"\n#include \"chrome\/browser\/ui\/tab_contents\/tab_contents_wrapper.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/base\/auth.h\"\n\nnamespace {\n\nclass LoginPromptBrowserTest : public InProcessBrowserTest {\n public:\n  LoginPromptBrowserTest()\n      : bad_password_(L\"incorrect\"), bad_username_(L\"nouser\") {\n    set_show_window(true);\n\n    auth_map_[L\"foo\"] = AuthInfo(L\"testuser\", L\"foopassword\");\n    auth_map_[L\"bar\"] = AuthInfo(L\"testuser\", L\"barpassword\");\n  }\n\n protected:\n  void SetAuthFor(LoginHandler* handler);\n\n  struct AuthInfo {\n    std::wstring username_;\n    std::wstring password_;\n\n    AuthInfo() {}\n\n    AuthInfo(const std::wstring username,\n             const std::wstring password)\n        : username_(username), password_(password) {}\n  };\n\n  std::map<std::wstring, AuthInfo> auth_map_;\n  std::wstring bad_password_;\n  std::wstring bad_username_;\n};\n\nvoid LoginPromptBrowserTest::SetAuthFor(LoginHandler* handler) {\n  const net::AuthChallengeInfo* challenge = handler->auth_info();\n\n  ASSERT_TRUE(challenge);\n  std::map<std::wstring, AuthInfo>::iterator i =\n      auth_map_.find(challenge->realm);\n  EXPECT_TRUE(auth_map_.end() != i);\n  if (i != auth_map_.end()) {\n    const AuthInfo& info = i->second;\n    handler->SetAuth(info.username_, info.password_);\n  }\n}\n\n\/\/ Maintains a set of LoginHandlers that are currently active and\n\/\/ keeps a count of the notifications that were observed.\nclass LoginPromptBrowserTestObserver : public NotificationObserver {\n public:\n  LoginPromptBrowserTestObserver()\n      : auth_needed_count_(0),\n        auth_supplied_count_(0),\n        auth_cancelled_count_(0) {}\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details);\n\n  void AddHandler(LoginHandler* handler);\n\n  void RemoveHandler(LoginHandler* handler);\n\n  void Register(const NotificationSource& source);\n\n  std::list<LoginHandler*> handlers_;\n\n  \/\/ The exact number of notifications we receive is depedent on the\n  \/\/ number of requests that were dispatched and is subject to a\n  \/\/ number of factors that we don't directly control here.  The\n  \/\/ values below should only be used qualitatively.\n  int auth_needed_count_;\n  int auth_supplied_count_;\n  int auth_cancelled_count_;\n\n private:\n  NotificationRegistrar registrar_;\n\n  DISALLOW_COPY_AND_ASSIGN(LoginPromptBrowserTestObserver);\n};\n\nvoid LoginPromptBrowserTestObserver::Observe(\n    NotificationType type,\n    const NotificationSource& source,\n    const NotificationDetails& details) {\n  if (type == NotificationType::AUTH_NEEDED) {\n    LoginNotificationDetails* login_details =\n        Details<LoginNotificationDetails>(details).ptr();\n    AddHandler(login_details->handler());\n    auth_needed_count_++;\n  } else if (type == NotificationType::AUTH_SUPPLIED) {\n    AuthSuppliedLoginNotificationDetails* login_details =\n        Details<AuthSuppliedLoginNotificationDetails>(details).ptr();\n    RemoveHandler(login_details->handler());\n    auth_supplied_count_++;\n  } else if (type == NotificationType::AUTH_CANCELLED) {\n    LoginNotificationDetails* login_details =\n        Details<LoginNotificationDetails>(details).ptr();\n    RemoveHandler(login_details->handler());\n    auth_cancelled_count_++;\n  }\n}\n\nvoid LoginPromptBrowserTestObserver::AddHandler(LoginHandler* handler) {\n  std::list<LoginHandler*>::iterator i = std::find(handlers_.begin(),\n                                                   handlers_.end(),\n                                                   handler);\n  EXPECT_TRUE(i == handlers_.end());\n  if (i == handlers_.end())\n    handlers_.push_back(handler);\n}\n\nvoid LoginPromptBrowserTestObserver::RemoveHandler(LoginHandler* handler) {\n  std::list<LoginHandler*>::iterator i = std::find(handlers_.begin(),\n                                                   handlers_.end(),\n                                                   handler);\n  EXPECT_TRUE(i != handlers_.end());\n  if (i != handlers_.end())\n    handlers_.erase(i);\n}\n\nvoid LoginPromptBrowserTestObserver::Register(\n    const NotificationSource& source) {\n  registrar_.Add(this, NotificationType::AUTH_NEEDED, source);\n  registrar_.Add(this, NotificationType::AUTH_SUPPLIED, source);\n  registrar_.Add(this, NotificationType::AUTH_CANCELLED, source);\n}\n\ntemplate <NotificationType::Type T>\nclass WindowedNavigationObserver\n    : public ui_test_utils::WindowedNotificationObserver {\n public:\n  explicit WindowedNavigationObserver(NavigationController* controller)\n      : ui_test_utils::WindowedNotificationObserver(\n          T, Source<NavigationController>(controller)) {}\n};\n\ntypedef WindowedNavigationObserver<NotificationType::LOAD_STOP>\n    WindowedLoadStopObserver;\n\ntypedef WindowedNavigationObserver<NotificationType::AUTH_NEEDED>\n    WindowedAuthNeededObserver;\n\ntypedef WindowedNavigationObserver<NotificationType::AUTH_CANCELLED>\n    WindowedAuthCancelledObserver;\n\ntypedef WindowedNavigationObserver<NotificationType::AUTH_SUPPLIED>\n    WindowedAuthSuppliedObserver;\n\nconst char* kMultiRealmTestPage = \"files\/login\/multi_realm.html\";\nconst int   kMultiRealmTestRealmCount = 2;\nconst int   kMultiRealmTestResourceCount = 4;\n\nconst char* kSingleRealmTestPage = \"files\/login\/single_realm.html\";\nconst int   kSingleRealmTestResourceCount = 6;\n\n\/\/ Test handling of resources that require authentication even though\n\/\/ the page they are included on doesn't.  In this case we should only\n\/\/ present the minimal number of prompts necessary for successfully\n\/\/ displaying the page.  First we check whether cancelling works as\n\/\/ expected.\nIN_PROC_BROWSER_TEST_F(LoginPromptBrowserTest, MultipleRealmCancellation) {\n  ASSERT_TRUE(test_server()->Start());\n  GURL test_page = test_server()->GetURL(kMultiRealmTestPage);\n\n  TabContentsWrapper* contents =\n      browser()->GetSelectedTabContentsWrapper();\n  ASSERT_TRUE(contents);\n\n  NavigationController* controller = &contents->controller();\n  LoginPromptBrowserTestObserver observer;\n\n  observer.Register(Source<NavigationController>(controller));\n\n  WindowedLoadStopObserver load_stop_waiter(controller);\n\n  {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n    browser()->OpenURL(test_page, GURL(), CURRENT_TAB, PageTransition::TYPED);\n    auth_needed_waiter.Wait();\n  }\n\n  int n_handlers = 0;\n\n  while (n_handlers < kMultiRealmTestRealmCount) {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n\n    while (!observer.handlers_.empty()) {\n      WindowedAuthCancelledObserver auth_cancelled_waiter(controller);\n      LoginHandler* handler = *observer.handlers_.begin();\n\n      ASSERT_TRUE(handler);\n      n_handlers++;\n      handler->CancelAuth();\n      auth_cancelled_waiter.Wait();\n    }\n\n    if (n_handlers < kMultiRealmTestRealmCount)\n      auth_needed_waiter.Wait();\n  }\n\n  load_stop_waiter.Wait();\n\n  EXPECT_EQ(kMultiRealmTestRealmCount, n_handlers);\n  EXPECT_EQ(0, observer.auth_supplied_count_);\n  EXPECT_LT(0, observer.auth_needed_count_);\n  EXPECT_LT(0, observer.auth_cancelled_count_);\n  EXPECT_TRUE(test_server()->Stop());\n}\n\n\/\/ Similar to the MultipleRealmCancellation test above, but tests\n\/\/ whether supplying credentials work as exepcted.\nIN_PROC_BROWSER_TEST_F(LoginPromptBrowserTest, MultipleRealmConfirmation) {\n  ASSERT_TRUE(test_server()->Start());\n  GURL test_page = test_server()->GetURL(kMultiRealmTestPage);\n\n  TabContentsWrapper* contents =\n      browser()->GetSelectedTabContentsWrapper();\n  ASSERT_TRUE(contents);\n\n  NavigationController* controller = &contents->controller();\n  LoginPromptBrowserTestObserver observer;\n\n  observer.Register(Source<NavigationController>(controller));\n\n  WindowedLoadStopObserver load_stop_waiter(controller);\n  int n_handlers = 0;\n\n  {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n\n    browser()->OpenURL(test_page, GURL(), CURRENT_TAB, PageTransition::TYPED);\n    auth_needed_waiter.Wait();\n  }\n\n  while (n_handlers < kMultiRealmTestRealmCount) {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n\n    while (!observer.handlers_.empty()) {\n      WindowedAuthSuppliedObserver auth_supplied_waiter(controller);\n      LoginHandler* handler = *observer.handlers_.begin();\n\n      ASSERT_TRUE(handler);\n      n_handlers++;\n      SetAuthFor(handler);\n      auth_supplied_waiter.Wait();\n    }\n\n    if (n_handlers < kMultiRealmTestRealmCount)\n      auth_needed_waiter.Wait();\n  }\n\n  load_stop_waiter.Wait();\n\n  EXPECT_EQ(kMultiRealmTestRealmCount, n_handlers);\n  EXPECT_LT(0, observer.auth_needed_count_);\n  EXPECT_LT(0, observer.auth_supplied_count_);\n  EXPECT_EQ(0, observer.auth_cancelled_count_);\n  EXPECT_TRUE(test_server()->Stop());\n}\n\n\/\/ Testing for recovery from an incorrect password for the case where\n\/\/ there are multiple authenticated resources.\n\/\/ Marked as flaky.  See crbug.com\/68860\nIN_PROC_BROWSER_TEST_F(LoginPromptBrowserTest, FLAKY_IncorrectConfirmation) {\n  ASSERT_TRUE(test_server()->Start());\n  GURL test_page = test_server()->GetURL(kSingleRealmTestPage);\n\n  TabContentsWrapper* contents =\n      browser()->GetSelectedTabContentsWrapper();\n  ASSERT_TRUE(contents);\n\n  NavigationController* controller = &contents->controller();\n  LoginPromptBrowserTestObserver observer;\n\n  observer.Register(Source<NavigationController>(controller));\n\n  WindowedLoadStopObserver load_stop_waiter(controller);\n\n  {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n    browser()->OpenURL(test_page, GURL(), CURRENT_TAB, PageTransition::TYPED);\n    auth_needed_waiter.Wait();\n  }\n\n  EXPECT_FALSE(observer.handlers_.empty());\n\n  if (!observer.handlers_.empty()) {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n    WindowedAuthSuppliedObserver auth_supplied_waiter(controller);\n    LoginHandler* handler = *observer.handlers_.begin();\n\n    ASSERT_TRUE(handler);\n    handler->SetAuth(bad_username_, bad_password_);\n    auth_supplied_waiter.Wait();\n\n    \/\/ The request should be retried after the incorrect password is\n    \/\/ supplied.  This should result in a new AUTH_NEEDED notification\n    \/\/ for the same realm.\n    auth_needed_waiter.Wait();\n  }\n\n  int n_handlers = 0;\n\n  while (n_handlers < 1) {\n    WindowedAuthNeededObserver auth_needed_waiter(controller);\n\n    while (!observer.handlers_.empty()) {\n      WindowedAuthSuppliedObserver auth_supplied_waiter(controller);\n      LoginHandler* handler = *observer.handlers_.begin();\n\n      ASSERT_TRUE(handler);\n      n_handlers++;\n      SetAuthFor(handler);\n      auth_supplied_waiter.Wait();\n    }\n\n    if (n_handlers < 1)\n      auth_needed_waiter.Wait();\n  }\n\n  load_stop_waiter.Wait();\n\n  \/\/ The single realm test has only one realm, and thus only one login\n  \/\/ prompt.\n  EXPECT_EQ(1, n_handlers);\n  EXPECT_LT(0, observer.auth_needed_count_);\n  EXPECT_LT(0, observer.auth_supplied_count_);\n  EXPECT_EQ(0, observer.auth_cancelled_count_);\n  EXPECT_TRUE(test_server()->Stop());\n}\n} \/\/ namespace\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\/options\/passwords_page_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"grit\/generated_resources.h\"\n#include \"views\/background.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/grid_layout.h\"\n#include \"views\/standard_layout.h\"\n\nusing views::ColumnSet;\nusing views::GridLayout;\nusing webkit_glue::PasswordForm;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ MultiLabelButtons\nMultiLabelButtons::MultiLabelButtons(views::ButtonListener* listener,\n                                     const std::wstring& label,\n                                     const std::wstring& alt_label)\n    : NativeButton(listener, label),\n      label_(label),\n      alt_label_(alt_label) {\n}\n\ngfx::Size MultiLabelButtons::GetPreferredSize() {\n  if (pref_size_.IsEmpty()) {\n    \/\/ Let's compute our preferred size.\n    std::wstring current_label = label();\n    SetLabel(label_);\n    pref_size_ = NativeButton::GetPreferredSize();\n    SetLabel(alt_label_);\n    gfx::Size alt_pref_size = NativeButton::GetPreferredSize();\n    \/\/ Revert to the original label.\n    SetLabel(current_label);\n    pref_size_.SetSize(std::max(pref_size_.width(), alt_pref_size.width()),\n                       std::max(pref_size_.height(), alt_pref_size.height()));\n  }\n  return gfx::Size(pref_size_.width(), pref_size_.height());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsTableModel, public\nPasswordsTableModel::PasswordsTableModel(Profile* profile)\n    : observer_(NULL),\n      row_count_observer_(NULL),\n      pending_login_query_(NULL),\n      saved_signons_cleanup_(&saved_signons_),\n      profile_(profile) {\n  DCHECK(profile && profile->GetWebDataService(Profile::EXPLICIT_ACCESS));\n}\n\nPasswordsTableModel::~PasswordsTableModel() {\n  CancelLoginsQuery();\n}\n\nint PasswordsTableModel::RowCount() {\n  return static_cast<int>(saved_signons_.size());\n}\n\nstd::wstring PasswordsTableModel::GetText(int row,\n                                          int col_id) {\n  switch (col_id) {\n    case IDS_PASSWORDS_PAGE_VIEW_SITE_COLUMN: {  \/\/ Site.\n      const std::wstring& url = saved_signons_[row]->display_url.display_url();\n      \/\/ Force URL to have LTR directionality.\n      if (l10n_util::GetTextDirection() == l10n_util::RIGHT_TO_LEFT) {\n        std::wstring localized_url = url;\n        l10n_util::WrapStringWithLTRFormatting(&localized_url);\n        return localized_url;\n      }\n      return url;\n    }\n    case IDS_PASSWORDS_PAGE_VIEW_USERNAME_COLUMN: {  \/\/ Username.\n      std::wstring username = GetPasswordFormAt(row)->username_value;\n      l10n_util::AdjustStringForLocaleDirection(username, &username);\n      return username;\n    }\n    default:\n      NOTREACHED() << \"Invalid column.\";\n      return std::wstring();\n  }\n}\n\nint PasswordsTableModel::CompareValues(int row1, int row2,\n                                       int column_id) {\n  if (column_id == IDS_PASSWORDS_PAGE_VIEW_SITE_COLUMN) {\n    return saved_signons_[row1]->display_url.Compare(\n        saved_signons_[row2]->display_url, GetCollator());\n  }\n  return TableModel::CompareValues(row1, row2, column_id);\n}\n\nvoid PasswordsTableModel::SetObserver(TableModelObserver* observer) {\n  observer_ = observer;\n}\n\nvoid PasswordsTableModel::GetAllSavedLoginsForProfile() {\n  DCHECK(!pending_login_query_);\n  pending_login_query_ = web_data_service()->GetAllAutofillableLogins(this);\n}\n\nvoid PasswordsTableModel::OnWebDataServiceRequestDone(\n    WebDataService::Handle h,\n    const WDTypedResult* result) {\n  DCHECK_EQ(pending_login_query_, h);\n  pending_login_query_ = NULL;\n\n  if (!result)\n    return;\n\n  DCHECK(result->GetType() == PASSWORD_RESULT);\n\n  \/\/ Get the result from the database into a useable form.\n  const WDResult<std::vector<PasswordForm*> >* r =\n      static_cast<const WDResult<std::vector<PasswordForm*> >*>(result);\n  std::vector<PasswordForm*> rows = r->GetValue();\n  STLDeleteElements<PasswordRows>(&saved_signons_);\n  saved_signons_.resize(rows.size(), NULL);\n  std::wstring languages =\n      profile_->GetPrefs()->GetString(prefs::kAcceptLanguages);\n  for (size_t i = 0; i < rows.size(); ++i) {\n    saved_signons_[i] = new PasswordRow(\n        gfx::SortedDisplayURL(rows[i]->origin, languages), rows[i]);\n  }\n  if (observer_)\n    observer_->OnModelChanged();\n  if (row_count_observer_)\n    row_count_observer_->OnRowCountChanged(RowCount());\n}\n\nPasswordForm* PasswordsTableModel::GetPasswordFormAt(int row) {\n  DCHECK(row >= 0 && row < RowCount());\n  return saved_signons_[row]->form.get();\n}\n\nvoid PasswordsTableModel::ForgetAndRemoveSignon(int row) {\n  DCHECK(row >= 0 && row < RowCount());\n  PasswordRows::iterator target_iter = saved_signons_.begin() + row;\n  \/\/ Remove from DB, memory, and vector.\n  PasswordRow* password_row = *target_iter;\n  web_data_service()->RemoveLogin(*(password_row->form.get()));\n  delete password_row;\n  saved_signons_.erase(target_iter);\n  if (observer_)\n    observer_->OnItemsRemoved(row, 1);\n  if (row_count_observer_)\n    row_count_observer_->OnRowCountChanged(RowCount());\n}\n\nvoid PasswordsTableModel::ForgetAndRemoveAllSignons() {\n  PasswordRows::iterator iter = saved_signons_.begin();\n  while (iter != saved_signons_.end()) {\n    \/\/ Remove from DB, memory, and vector.\n    PasswordRow* row = *iter;\n    web_data_service()->RemoveLogin(*(row->form.get()));\n    delete row;\n    iter = saved_signons_.erase(iter);\n  }\n  if (observer_)\n    observer_->OnModelChanged();\n  if (row_count_observer_)\n    row_count_observer_->OnRowCountChanged(RowCount());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsTableModel, private\nvoid PasswordsTableModel::CancelLoginsQuery() {\n  if (pending_login_query_) {\n    web_data_service()->CancelRequest(pending_login_query_);\n    pending_login_query_ = NULL;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsPageView, public\nPasswordsPageView::PasswordsPageView(Profile* profile)\n    : OptionsPageView(profile),\n      ALLOW_THIS_IN_INITIALIZER_LIST(show_button_(\n          this,\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_SHOW_BUTTON),\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_HIDE_BUTTON))),\n      ALLOW_THIS_IN_INITIALIZER_LIST(remove_button_(\n          this,\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_REMOVE_BUTTON))),\n      ALLOW_THIS_IN_INITIALIZER_LIST(remove_all_button_(\n          this,\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_REMOVE_ALL_BUTTON))),\n      table_model_(profile),\n      table_view_(NULL),\n      current_selected_password_(NULL) {\n}\n\nvoid PasswordsPageView::OnSelectionChanged() {\n  bool has_selection = table_view_->SelectedRowCount() > 0;\n  remove_button_.SetEnabled(has_selection);\n\n  views::TableSelectionIterator iter = table_view_->SelectionBegin();\n  int row = *iter;\n  PasswordForm* selected = table_model_.GetPasswordFormAt(row);\n  DCHECK(++iter == table_view_->SelectionEnd());\n\n  if (selected != current_selected_password_) {\n    \/\/ Reset the password related views.\n    show_button_.SetLabel(\n        l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_SHOW_BUTTON));\n    show_button_.SetEnabled(has_selection);\n    password_label_.SetText(std::wstring());\n\n    current_selected_password_ = selected;\n  }\n}\n\nvoid PasswordsPageView::ButtonPressed(views::Button* sender) {\n  \/\/ Close will result in our destruction.\n  if (sender == &remove_all_button_) {\n    table_model_.ForgetAndRemoveAllSignons();\n    return;\n  }\n\n  \/\/ The following require a selection (and only one, since table is single-\n  \/\/ select only).\n  views::TableSelectionIterator iter = table_view_->SelectionBegin();\n  int row = *iter;\n  PasswordForm* selected = table_model_.GetPasswordFormAt(row);\n  DCHECK(++iter == table_view_->SelectionEnd());\n\n  if (sender == &remove_button_) {\n    table_model_.ForgetAndRemoveSignon(row);\n  } else if (sender == &show_button_) {\n    if (password_label_.GetText().length() == 0) {\n      password_label_.SetText(selected->password_value);\n      show_button_.SetLabel(\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_HIDE_BUTTON));\n    } else {\n      password_label_.SetText(L\"\");\n      show_button_.SetLabel(\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_SHOW_BUTTON));\n    }\n  } else {\n    NOTREACHED() << \"Invalid button.\";\n  }\n}\n\nvoid PasswordsPageView::OnRowCountChanged(size_t rows) {\n  remove_all_button_.SetEnabled(rows > 0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsPageView, protected\nvoid PasswordsPageView::InitControlLayout() {\n  SetupButtonsAndLabels();\n  SetupTable();\n\n  \/\/ Do the layout thing.\n  const int top_column_set_id = 0;\n  GridLayout* layout = CreatePanelGridLayout(this);\n  SetLayoutManager(layout);\n\n  \/\/ Design the grid.\n  ColumnSet* column_set = layout->AddColumnSet(top_column_set_id);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::FILL, 1,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, kRelatedControlHorizontalSpacing);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n\n  \/\/ Fill the grid.\n  layout->StartRow(0, top_column_set_id);\n  layout->AddView(table_view_, 1, 8, GridLayout::FILL,\n                  GridLayout::FILL);\n  layout->AddView(&remove_button_);\n  layout->StartRowWithPadding(0, top_column_set_id, 0,\n                              kRelatedControlVerticalSpacing);\n  layout->SkipColumns(1);\n  layout->AddView(&remove_all_button_);\n  layout->StartRowWithPadding(0, top_column_set_id, 0,\n                              kRelatedControlVerticalSpacing);\n  layout->SkipColumns(1);\n  layout->AddView(&show_button_);\n  layout->StartRowWithPadding(0, top_column_set_id, 0,\n                              kRelatedControlVerticalSpacing);\n  layout->SkipColumns(1);\n  layout->AddView(&password_label_);\n  layout->AddPaddingRow(1, 0);\n\n  \/\/ Ask the database for saved password data.\n  table_model_.GetAllSavedLoginsForProfile();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsPageView, private\nvoid PasswordsPageView::SetupButtonsAndLabels() {\n  \/\/ Disable all buttons in the first place.\n  show_button_.SetParentOwned(false);\n  show_button_.SetEnabled(false);\n\n  remove_button_.SetParentOwned(false);\n  remove_button_.SetEnabled(false);\n\n  remove_all_button_.SetParentOwned(false);\n  remove_all_button_.SetEnabled(false);\n\n  password_label_.SetParentOwned(false);\n}\n\nvoid PasswordsPageView::SetupTable() {\n  \/\/ Tell the table model we are concern about how many rows it has.\n  table_model_.set_row_count_observer(this);\n\n  \/\/ Creates the different columns for the table.\n  \/\/ The float resize values are the result of much tinkering.\n  std::vector<TableColumn> columns;\n  columns.push_back(TableColumn(IDS_PASSWORDS_PAGE_VIEW_SITE_COLUMN,\n                                       TableColumn::LEFT, -1, 0.55f));\n  columns.back().sortable = true;\n  columns.push_back(TableColumn(\n      IDS_PASSWORDS_PAGE_VIEW_USERNAME_COLUMN, TableColumn::LEFT,\n      -1, 0.37f));\n  columns.back().sortable = true;\n  table_view_ = new views::TableView(&table_model_, columns, views::TEXT_ONLY,\n                                     true, true, true);\n  \/\/ Make the table initially sorted by host.\n  views::TableView::SortDescriptors sort;\n  sort.push_back(views::TableView::SortDescriptor(\n      IDS_PASSWORDS_PAGE_VIEW_SITE_COLUMN, true));\n  table_view_->SetSortDescriptors(sort);\n  table_view_->SetObserver(this);\n}\n<commit_msg>We were hitting a DCHECK when removing a password in the password option panel. This is a regression introduced by a recent change that fixed another bug. The problem was that we were not dealing with the empty selection case in the password table.<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\/options\/passwords_page_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"grit\/generated_resources.h\"\n#include \"views\/background.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/grid_layout.h\"\n#include \"views\/standard_layout.h\"\n\nusing views::ColumnSet;\nusing views::GridLayout;\nusing webkit_glue::PasswordForm;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ MultiLabelButtons\nMultiLabelButtons::MultiLabelButtons(views::ButtonListener* listener,\n                                     const std::wstring& label,\n                                     const std::wstring& alt_label)\n    : NativeButton(listener, label),\n      label_(label),\n      alt_label_(alt_label) {\n}\n\ngfx::Size MultiLabelButtons::GetPreferredSize() {\n  if (pref_size_.IsEmpty()) {\n    \/\/ Let's compute our preferred size.\n    std::wstring current_label = label();\n    SetLabel(label_);\n    pref_size_ = NativeButton::GetPreferredSize();\n    SetLabel(alt_label_);\n    gfx::Size alt_pref_size = NativeButton::GetPreferredSize();\n    \/\/ Revert to the original label.\n    SetLabel(current_label);\n    pref_size_.SetSize(std::max(pref_size_.width(), alt_pref_size.width()),\n                       std::max(pref_size_.height(), alt_pref_size.height()));\n  }\n  return gfx::Size(pref_size_.width(), pref_size_.height());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsTableModel, public\nPasswordsTableModel::PasswordsTableModel(Profile* profile)\n    : observer_(NULL),\n      row_count_observer_(NULL),\n      pending_login_query_(NULL),\n      saved_signons_cleanup_(&saved_signons_),\n      profile_(profile) {\n  DCHECK(profile && profile->GetWebDataService(Profile::EXPLICIT_ACCESS));\n}\n\nPasswordsTableModel::~PasswordsTableModel() {\n  CancelLoginsQuery();\n}\n\nint PasswordsTableModel::RowCount() {\n  return static_cast<int>(saved_signons_.size());\n}\n\nstd::wstring PasswordsTableModel::GetText(int row,\n                                          int col_id) {\n  switch (col_id) {\n    case IDS_PASSWORDS_PAGE_VIEW_SITE_COLUMN: {  \/\/ Site.\n      const std::wstring& url = saved_signons_[row]->display_url.display_url();\n      \/\/ Force URL to have LTR directionality.\n      if (l10n_util::GetTextDirection() == l10n_util::RIGHT_TO_LEFT) {\n        std::wstring localized_url = url;\n        l10n_util::WrapStringWithLTRFormatting(&localized_url);\n        return localized_url;\n      }\n      return url;\n    }\n    case IDS_PASSWORDS_PAGE_VIEW_USERNAME_COLUMN: {  \/\/ Username.\n      std::wstring username = GetPasswordFormAt(row)->username_value;\n      l10n_util::AdjustStringForLocaleDirection(username, &username);\n      return username;\n    }\n    default:\n      NOTREACHED() << \"Invalid column.\";\n      return std::wstring();\n  }\n}\n\nint PasswordsTableModel::CompareValues(int row1, int row2,\n                                       int column_id) {\n  if (column_id == IDS_PASSWORDS_PAGE_VIEW_SITE_COLUMN) {\n    return saved_signons_[row1]->display_url.Compare(\n        saved_signons_[row2]->display_url, GetCollator());\n  }\n  return TableModel::CompareValues(row1, row2, column_id);\n}\n\nvoid PasswordsTableModel::SetObserver(TableModelObserver* observer) {\n  observer_ = observer;\n}\n\nvoid PasswordsTableModel::GetAllSavedLoginsForProfile() {\n  DCHECK(!pending_login_query_);\n  pending_login_query_ = web_data_service()->GetAllAutofillableLogins(this);\n}\n\nvoid PasswordsTableModel::OnWebDataServiceRequestDone(\n    WebDataService::Handle h,\n    const WDTypedResult* result) {\n  DCHECK_EQ(pending_login_query_, h);\n  pending_login_query_ = NULL;\n\n  if (!result)\n    return;\n\n  DCHECK(result->GetType() == PASSWORD_RESULT);\n\n  \/\/ Get the result from the database into a useable form.\n  const WDResult<std::vector<PasswordForm*> >* r =\n      static_cast<const WDResult<std::vector<PasswordForm*> >*>(result);\n  std::vector<PasswordForm*> rows = r->GetValue();\n  STLDeleteElements<PasswordRows>(&saved_signons_);\n  saved_signons_.resize(rows.size(), NULL);\n  std::wstring languages =\n      profile_->GetPrefs()->GetString(prefs::kAcceptLanguages);\n  for (size_t i = 0; i < rows.size(); ++i) {\n    saved_signons_[i] = new PasswordRow(\n        gfx::SortedDisplayURL(rows[i]->origin, languages), rows[i]);\n  }\n  if (observer_)\n    observer_->OnModelChanged();\n  if (row_count_observer_)\n    row_count_observer_->OnRowCountChanged(RowCount());\n}\n\nPasswordForm* PasswordsTableModel::GetPasswordFormAt(int row) {\n  DCHECK(row >= 0 && row < RowCount());\n  return saved_signons_[row]->form.get();\n}\n\nvoid PasswordsTableModel::ForgetAndRemoveSignon(int row) {\n  DCHECK(row >= 0 && row < RowCount());\n  PasswordRows::iterator target_iter = saved_signons_.begin() + row;\n  \/\/ Remove from DB, memory, and vector.\n  PasswordRow* password_row = *target_iter;\n  web_data_service()->RemoveLogin(*(password_row->form.get()));\n  delete password_row;\n  saved_signons_.erase(target_iter);\n  if (observer_)\n    observer_->OnItemsRemoved(row, 1);\n  if (row_count_observer_)\n    row_count_observer_->OnRowCountChanged(RowCount());\n}\n\nvoid PasswordsTableModel::ForgetAndRemoveAllSignons() {\n  PasswordRows::iterator iter = saved_signons_.begin();\n  while (iter != saved_signons_.end()) {\n    \/\/ Remove from DB, memory, and vector.\n    PasswordRow* row = *iter;\n    web_data_service()->RemoveLogin(*(row->form.get()));\n    delete row;\n    iter = saved_signons_.erase(iter);\n  }\n  if (observer_)\n    observer_->OnModelChanged();\n  if (row_count_observer_)\n    row_count_observer_->OnRowCountChanged(RowCount());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsTableModel, private\nvoid PasswordsTableModel::CancelLoginsQuery() {\n  if (pending_login_query_) {\n    web_data_service()->CancelRequest(pending_login_query_);\n    pending_login_query_ = NULL;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsPageView, public\nPasswordsPageView::PasswordsPageView(Profile* profile)\n    : OptionsPageView(profile),\n      ALLOW_THIS_IN_INITIALIZER_LIST(show_button_(\n          this,\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_SHOW_BUTTON),\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_HIDE_BUTTON))),\n      ALLOW_THIS_IN_INITIALIZER_LIST(remove_button_(\n          this,\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_REMOVE_BUTTON))),\n      ALLOW_THIS_IN_INITIALIZER_LIST(remove_all_button_(\n          this,\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_REMOVE_ALL_BUTTON))),\n      table_model_(profile),\n      table_view_(NULL),\n      current_selected_password_(NULL) {\n}\n\nvoid PasswordsPageView::OnSelectionChanged() {\n  bool has_selection = table_view_->SelectedRowCount() > 0;\n  remove_button_.SetEnabled(has_selection);\n\n  PasswordForm* selected = NULL;\n  if (has_selection) {\n    views::TableSelectionIterator iter = table_view_->SelectionBegin();\n    selected = table_model_.GetPasswordFormAt(*iter);\n    DCHECK(++iter == table_view_->SelectionEnd());\n  }\n\n  if (selected != current_selected_password_) {\n    \/\/ Reset the password related views.\n    show_button_.SetLabel(\n        l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_SHOW_BUTTON));\n    show_button_.SetEnabled(has_selection);\n    password_label_.SetText(std::wstring());\n\n    current_selected_password_ = selected;\n  }\n}\n\nvoid PasswordsPageView::ButtonPressed(views::Button* sender) {\n  \/\/ Close will result in our destruction.\n  if (sender == &remove_all_button_) {\n    table_model_.ForgetAndRemoveAllSignons();\n    return;\n  }\n\n  \/\/ The following require a selection (and only one, since table is single-\n  \/\/ select only).\n  views::TableSelectionIterator iter = table_view_->SelectionBegin();\n  int row = *iter;\n  PasswordForm* selected = table_model_.GetPasswordFormAt(row);\n  DCHECK(++iter == table_view_->SelectionEnd());\n\n  if (sender == &remove_button_) {\n    table_model_.ForgetAndRemoveSignon(row);\n  } else if (sender == &show_button_) {\n    if (password_label_.GetText().length() == 0) {\n      password_label_.SetText(selected->password_value);\n      show_button_.SetLabel(\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_HIDE_BUTTON));\n    } else {\n      password_label_.SetText(L\"\");\n      show_button_.SetLabel(\n          l10n_util::GetString(IDS_PASSWORDS_PAGE_VIEW_SHOW_BUTTON));\n    }\n  } else {\n    NOTREACHED() << \"Invalid button.\";\n  }\n}\n\nvoid PasswordsPageView::OnRowCountChanged(size_t rows) {\n  remove_all_button_.SetEnabled(rows > 0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsPageView, protected\nvoid PasswordsPageView::InitControlLayout() {\n  SetupButtonsAndLabels();\n  SetupTable();\n\n  \/\/ Do the layout thing.\n  const int top_column_set_id = 0;\n  GridLayout* layout = CreatePanelGridLayout(this);\n  SetLayoutManager(layout);\n\n  \/\/ Design the grid.\n  ColumnSet* column_set = layout->AddColumnSet(top_column_set_id);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::FILL, 1,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, kRelatedControlHorizontalSpacing);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n\n  \/\/ Fill the grid.\n  layout->StartRow(0, top_column_set_id);\n  layout->AddView(table_view_, 1, 8, GridLayout::FILL,\n                  GridLayout::FILL);\n  layout->AddView(&remove_button_);\n  layout->StartRowWithPadding(0, top_column_set_id, 0,\n                              kRelatedControlVerticalSpacing);\n  layout->SkipColumns(1);\n  layout->AddView(&remove_all_button_);\n  layout->StartRowWithPadding(0, top_column_set_id, 0,\n                              kRelatedControlVerticalSpacing);\n  layout->SkipColumns(1);\n  layout->AddView(&show_button_);\n  layout->StartRowWithPadding(0, top_column_set_id, 0,\n                              kRelatedControlVerticalSpacing);\n  layout->SkipColumns(1);\n  layout->AddView(&password_label_);\n  layout->AddPaddingRow(1, 0);\n\n  \/\/ Ask the database for saved password data.\n  table_model_.GetAllSavedLoginsForProfile();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ PasswordsPageView, private\nvoid PasswordsPageView::SetupButtonsAndLabels() {\n  \/\/ Disable all buttons in the first place.\n  show_button_.SetParentOwned(false);\n  show_button_.SetEnabled(false);\n\n  remove_button_.SetParentOwned(false);\n  remove_button_.SetEnabled(false);\n\n  remove_all_button_.SetParentOwned(false);\n  remove_all_button_.SetEnabled(false);\n\n  password_label_.SetParentOwned(false);\n}\n\nvoid PasswordsPageView::SetupTable() {\n  \/\/ Tell the table model we are concern about how many rows it has.\n  table_model_.set_row_count_observer(this);\n\n  \/\/ Creates the different columns for the table.\n  \/\/ The float resize values are the result of much tinkering.\n  std::vector<TableColumn> columns;\n  columns.push_back(TableColumn(IDS_PASSWORDS_PAGE_VIEW_SITE_COLUMN,\n                                       TableColumn::LEFT, -1, 0.55f));\n  columns.back().sortable = true;\n  columns.push_back(TableColumn(\n      IDS_PASSWORDS_PAGE_VIEW_USERNAME_COLUMN, TableColumn::LEFT,\n      -1, 0.37f));\n  columns.back().sortable = true;\n  table_view_ = new views::TableView(&table_model_, columns, views::TEXT_ONLY,\n                                     true, true, true);\n  \/\/ Make the table initially sorted by host.\n  views::TableView::SortDescriptors sort;\n  sort.push_back(views::TableView::SortDescriptor(\n      IDS_PASSWORDS_PAGE_VIEW_SITE_COLUMN, true));\n  table_view_->SetSortDescriptors(sort);\n  table_view_->SetObserver(this);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\nint main(int argc, const char **argv)\n{\n  return 0;\n}\n<commit_msg>connected device proxy and indication<commit_after>\/* Copyright (c) 2014 Quanta Research Cambridge, Inc\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 \"Ov7670ControllerRequest.h\"\n#include \"Ov7670ControllerIndication.h\"\n\nclass Ov7670ControllerIndication : public Ov7670ControllerIndicationWrapper {\npublic:\n  Ov7670ControllerIndication(unsigned int id) : Ov7670ControllerIndicationWrapper(id){}\n  virtual void probeResponse(uint8_t data) {\n    fprintf(stderr, \"i2c response %02x\\n\", data);\n  }\n  virtual void vsync() {\n    fprintf(stderr, \"vsync\\n\");\n  }\n};\n\nint main(int argc, const char **argv)\n{\n  Ov7670ControllerRequestProxy device(IfcNames_Ov7670ControllerRequestS2H);\n  Ov7670ControllerIndication deviceResponse(IfcNames_Ov7670ControllerIndicationH2S);\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sstream>\n#include <cereal\/archives\/binary.hpp>\n#include <nfl.hpp>\n#include \"tools.h\"\n\n\ntemplate <size_t degree, size_t modulus, class T>\nbool run() {\n  using poly_t = nfl::poly_from_modulus<T, degree, modulus>;\n\n  \/\/ Stream\n  std::stringstream ss;\n\n  \/\/ Archives\n  cereal::BinaryOutputArchive oarchive(ss); \/\/ output archive\n  cereal::BinaryInputArchive iarchive(ss); \/\/ input archive\n\n  \/\/ define a random polynomial\n  poly_t& p0 = *alloc_aligned<poly_t, 32>(1, nfl::uniform());\n\n  \/\/ serialize the polynomial\n  oarchive(p0);\n\n  \/\/ copy p0 into p1\n  poly_t& p1 = *alloc_aligned<poly_t, 32>(1, p0);\n\n  \/\/ free p0\n  free_aligned(1, &p0);\n\n  \/\/ define a new polynomial p2\n  poly_t& p2 = *alloc_aligned<poly_t, 32>(1);\n\n  \/\/ deserialize the stream into p2\n  iarchive(p2);\n\n  \/\/ Verify that p1 == p2\n  bool ret_value = (p1 == p2);\n  \n  \/\/ Cleaning\n  free_aligned(1, &p1);\n  free_aligned(1, &p2);\n\n  return ret_value;\n}\n\ntemplate <size_t degree, size_t modulus, class T>\nbool run_p() {\n  using poly_p = nfl::poly_p_from_modulus<T, degree, modulus>;\n\n  \/\/ Stream\n  std::stringstream ss;\n\n  \/\/ Archives\n  cereal::BinaryOutputArchive oarchive(ss); \/\/ output archive\n  cereal::BinaryInputArchive iarchive(ss); \/\/ input archive\n\n  \/\/ define a random polynomial\n  poly_p* p0 = new poly_p(nfl::uniform());\n\n  \/\/ serialize the polynomial\n  oarchive(*p0);\n\n  \/\/ copy p0 into p1\n  poly_p p1 = *p0;\n\n  \/\/ delete p0\n  delete p0;\n\n  \/\/ define a new polynomial p2\n  poly_p p2;\n\n  \/\/ deserialize the stream into p2\n  iarchive(p2);\n\n  \/\/ Verify that p1 == p2\n  return (p1 == p2);\n}\n\nint main(int argc, char const* argv[]) {\n  return not(run<CONFIG>() and run_p<CONFIG>());\n}\n<commit_msg>Serializer perfs<commit_after>#include <cereal\/archives\/binary.hpp>\n#include <chrono>\n#include <iostream>\n#include <iterator>\n#include <nfl.hpp>\n#include <sstream>\n#include \"tools.h\"\n\n#define REPETITIONS 500\n\ntemplate <class T>\ndouble get_time_us(T const& start, T const& end, uint32_t N) {\n  auto diff = end - start;\n  return (long double)(std::chrono::duration_cast<std::chrono::microseconds>(\n                           diff)\n                           .count()) \/\n         N;\n}\n\n\/\/\/ Temporary class to compare manual serialization and serialization using\n\/\/\/ cereal\ntemplate <class T, size_t degree, size_t modulus>\nclass poly_temp {\n  using poly_p = nfl::poly_p_from_modulus<T, degree, modulus>;\n  static constexpr size_t N = poly_p::degree * poly_p::nmoduli;\n\n public:\n  T _data[N] __attribute__((aligned(32))) = {0};\n  poly_temp() {}\n  void set(poly_p const& p) {\n    for (size_t cm = 0; cm < poly_p::nmoduli; cm++) {\n      for (size_t i = 0; i < poly_p::degree; i++) {\n        _data[cm * poly_p::degree + i] = p(cm, i);\n      }\n    }\n  }\n  T& operator()(size_t cm, size_t i) { return _data[cm * degree + i]; }\n\n  \/\/\/ cereal serializer\n  template <class Archive>\n  void serialize(Archive& archive) {\n    archive(_data);  \/\/ serialize coefficients by passing them to the archive\n  }\n\n  \/\/\/ manual serializers\n  inline void oserialize_manually(std::ostream& outputstream) {\n    outputstream.write(reinterpret_cast<char*>(_data), N * sizeof(T));\n  }\n  inline void iserialize_manually(std::istream& inputstream) {\n    inputstream.read(reinterpret_cast<char*>(_data), N * sizeof(T));\n  }\n} __attribute__((aligned(32)));\n\ntemplate <size_t degree, size_t modulus, class T>\nbool run() {\n  using poly_t = nfl::poly_from_modulus<T, degree, modulus>;\n\n  \/\/ Stream\n  std::stringstream ss(std::stringstream::in | std::stringstream::out |\n                       std::stringstream::binary);\n\n  \/\/ Archives\n  cereal::BinaryOutputArchive oarchive(ss);  \/\/ output archive\n  cereal::BinaryInputArchive iarchive(ss);   \/\/ input archive\n\n  \/\/ define a random polynomial\n  poly_t& p0 = *alloc_aligned<poly_t, 32>(1, nfl::uniform());\n\n  \/\/ serialize the polynomial\n  oarchive(p0);\n\n  \/\/ copy p0 into p1\n  poly_t& p1 = *alloc_aligned<poly_t, 32>(1, p0);\n\n  \/\/ free p0\n  free_aligned(1, &p0);\n\n  \/\/ define a new polynomial p2\n  poly_t& p2 = *alloc_aligned<poly_t, 32>(1);\n\n  \/\/ deserialize the stream into p2\n  iarchive(p2);\n\n  \/\/ Verify that p1 == p2\n  bool ret_value = (p1 == p2);\n\n  \/\/ Cleaning\n  free_aligned(1, &p1);\n  free_aligned(1, &p2);\n\n  return ret_value;\n}\n\ntemplate <size_t degree, size_t modulus, class T>\nbool run_p() {\n  using poly_p = nfl::poly_p_from_modulus<T, degree, modulus>;\n\n  \/\/ Stream\n  std::stringstream ss(std::stringstream::in | std::stringstream::out |\n                       std::stringstream::binary);\n\n  \/\/ Archives\n  cereal::BinaryOutputArchive oarchive(ss);  \/\/ output archive\n  cereal::BinaryInputArchive iarchive(ss);   \/\/ input archive\n\n  \/\/ define a random polynomial\n  poly_p* p0 = new poly_p(nfl::uniform());\n\n  \/\/ serialize the polynomial\n  oarchive(*p0);\n\n  \/\/ copy p0 into p1\n  poly_p p1 = *p0;\n\n  \/\/ delete p0\n  delete p0;\n\n  \/\/ define a new polynomial p2\n  poly_p p2;\n\n  \/\/ deserialize the stream into p2\n  iarchive(p2);\n\n  \/\/ Verify that p1 == p2\n  return (p1 == p2);\n}\n\ntemplate <size_t degree, size_t modulus, class T>\nbool run_perf() {\n  using poly_p = nfl::poly_p_from_modulus<T, degree, modulus>;\n  using poly_tmp = poly_temp<T, degree, modulus>;\n\n  auto start = std::chrono::steady_clock::now();\n  auto end = std::chrono::steady_clock::now();\n\n  \/\/ Stream\n  std::stringstream ss(std::stringstream::in | std::stringstream::out |\n                       std::stringstream::binary);\n\n  \/\/ Archives\n  cereal::BinaryOutputArchive oarchive(ss);  \/\/ output archive\n  cereal::BinaryInputArchive iarchive(ss);   \/\/ input archive\n\n  \/\/ array of random polynomials\n  std::array<poly_p, REPETITIONS> poly_p_array;\n  std::fill(poly_p_array.begin(), poly_p_array.end(), nfl::uniform());\n\n  \/\/ array of poly_tmp\n  poly_tmp* poly_tmp_array = alloc_aligned<poly_tmp, 32>(REPETITIONS);\n  for (size_t i = 0; i < REPETITIONS; i++) {\n    poly_tmp_array[i].set(poly_p_array[i]);\n  }\n\n  \/\/ Benchmark cereal serialization\n  start = std::chrono::steady_clock::now();\n  for (size_t i = 0; i < REPETITIONS; i++) {\n    oarchive(poly_tmp_array[i]);\n  }\n  end = std::chrono::steady_clock::now();\n  std::cout << \"Cereal output serialization: \"\n            << get_time_us(start, end, REPETITIONS) << \" us\" << std::endl;\n\n  start = std::chrono::steady_clock::now();\n  for (size_t i = 0; i < REPETITIONS; i++) {\n    iarchive(poly_tmp_array[i]);\n  }\n  end = std::chrono::steady_clock::now();\n  std::cout << \"Cereal input serialization: \"\n            << get_time_us(start, end, REPETITIONS) << \" us\" << std::endl;\n\n  \/\/ reset stringstream\n  ss.clear();\n  ss.str(\"\");\n\n  \/\/ Benchmark cereal serialization\n  start = std::chrono::steady_clock::now();\n  for (size_t i = 0; i < REPETITIONS; i++) {\n    poly_tmp_array[i].oserialize_manually(ss);\n  }\n  end = std::chrono::steady_clock::now();\n  std::cout << \"Manual output serialization: \"\n            << get_time_us(start, end, REPETITIONS) << \" us\" << std::endl;\n\n  start = std::chrono::steady_clock::now();\n  for (size_t i = 0; i < REPETITIONS; i++) {\n    poly_tmp_array[i].iserialize_manually(ss);\n  }\n  end = std::chrono::steady_clock::now();\n  std::cout << \"Manual input serialization: \"\n            << get_time_us(start, end, REPETITIONS) << \" us\" << std::endl;\n\n  \/\/ Verify serialization\n  bool ret_value = true;\n  for (size_t i = 0; i < REPETITIONS; i++) {\n    \/\/ reset stringstream\n    ss.clear();\n    ss.str(\"\");\n\n    \/\/ poly_p serialized to ss2, and read as a poly_tmp\n    oarchive(poly_p_array[i]);\n    poly_tmp* p_tmp = alloc_aligned<poly_tmp, 32>(1);\n    p_tmp->iserialize_manually(ss);\n    for (size_t cm = 0; cm < poly_p::nmoduli; cm++) {\n      for (size_t j = 0; j < poly_p::degree; j++) {\n        ret_value &= ((*p_tmp)(cm, j) == poly_p_array[i](cm, j));\n      }\n    }\n\n    \/\/ reset stringstream\n    ss.clear();\n    ss.str(\"\");\n\n    \/\/ poly_tmp serialized to ss3, and read as a poly_p\n    p_tmp->oserialize_manually(ss);\n    poly_p p;\n    iarchive(p);\n    for (size_t cm = 0; cm < poly_p::nmoduli; cm++) {\n      for (size_t j = 0; j < poly_p::degree; j++) {\n        ret_value &= ((*p_tmp)(cm, j) == p(cm, j));\n      }\n    }\n\n    free_aligned(1, p_tmp);\n  }\n\n  free_aligned(REPETITIONS, poly_tmp_array);\n\n  return ret_value;\n}\n\nint main(int argc, char const* argv[]) {\n  return not(run<CONFIG>() and run_p<CONFIG>() and run_perf<CONFIG>());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <x0\/http\/HttpRangeDef.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/extensions\/TestFactoryRegistry.h>\n#include <iostream>\n#include <cstdlib>\n#include <cctype>\n#include <cassert>\n#include <strings.h>\n\nclass range_def_test :\n\tpublic CPPUNIT_NS::TestFixture\n{\npublic:\n\tCPPUNIT_TEST_SUITE(range_def_test);\n\t\tCPPUNIT_TEST(range1);\n\t\tCPPUNIT_TEST(range2);\n\t\tCPPUNIT_TEST(range3);\n\t\tCPPUNIT_TEST(range4);\n\t\tCPPUNIT_TEST(range5);\n\t\tCPPUNIT_TEST(range6);\n\tCPPUNIT_TEST_SUITE_END();\n\nprivate:\n\tvoid range1()\n\t{\n\t\tx0::HttpRangeDef r;\n\t\tx0::ConstBuffer spec(\"bytes=0-499\");\n\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 1);\n\t\tCPPUNIT_ASSERT(r[0].first == 0);\n\t\tCPPUNIT_ASSERT(r[0].second == 499);\n\t}\n\n\tvoid range2()\n\t{\n\t\tx0::HttpRangeDef r;\n\t\tx0::ConstBuffer spec(\"bytes=500-999\");\n\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 1);\n\t\tCPPUNIT_ASSERT(r[0].first == 500);\n\t\tCPPUNIT_ASSERT(r[0].second == 999);\n\t}\n\n\tvoid range3()\n\t{\n\t\tx0::HttpRangeDef r;\n\n\t\tx0::ConstBuffer spec(\"bytes=-500\");\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 1);\n\t\tCPPUNIT_ASSERT(r[0].first == x0::HttpRangeDef::npos);\n\t\tCPPUNIT_ASSERT(r[0].second == 500);\n\t}\n\n\tvoid range4()\n\t{\n\t\tx0::HttpRangeDef r;\n\n\t\tx0::ConstBuffer spec(\"bytes=9500-\");\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 1);\n\t\tCPPUNIT_ASSERT(r[0].first == 9500);\n\t\tCPPUNIT_ASSERT(r[0].second == x0::HttpRangeDef::npos);\n\t}\n\n\tvoid range5()\n\t{\n\t\tx0::HttpRangeDef r;\n\n\t\tx0::ConstBuffer spec(\"bytes=0-0,-1\");\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 2);\n\n\t\tCPPUNIT_ASSERT(r[0].first == 0);\n\t\tCPPUNIT_ASSERT(r[0].second == 0);\n\n\t\tCPPUNIT_ASSERT(r[1].first == x0::HttpRangeDef::npos);\n\t\tCPPUNIT_ASSERT(r[1].second == 1);\n\t}\n\n\tvoid range6()\n\t{\n\t\tx0::HttpRangeDef r;\n\n\t\tx0::ConstBuffer spec(\"bytes=500-700,601-999\");\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 2);\n\n\t\tCPPUNIT_ASSERT(r[0].first == 500);\n\t\tCPPUNIT_ASSERT(r[0].second == 700);\n\n\t\tCPPUNIT_ASSERT(r[1].first == 601);\n\t\tCPPUNIT_ASSERT(r[1].second == 999);\n\t}\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(range_def_test);\n<commit_msg>[tests] range_def_test: added missing include (due to recent changes)<commit_after>#include <x0\/http\/HttpRangeDef.h>\n#include <x0\/ConstBuffer.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/extensions\/TestFactoryRegistry.h>\n#include <iostream>\n#include <cstdlib>\n#include <cctype>\n#include <cassert>\n#include <strings.h>\n\nclass range_def_test :\n\tpublic CPPUNIT_NS::TestFixture\n{\npublic:\n\tCPPUNIT_TEST_SUITE(range_def_test);\n\t\tCPPUNIT_TEST(range1);\n\t\tCPPUNIT_TEST(range2);\n\t\tCPPUNIT_TEST(range3);\n\t\tCPPUNIT_TEST(range4);\n\t\tCPPUNIT_TEST(range5);\n\t\tCPPUNIT_TEST(range6);\n\tCPPUNIT_TEST_SUITE_END();\n\nprivate:\n\tvoid range1()\n\t{\n\t\tx0::HttpRangeDef r;\n\t\tx0::ConstBuffer spec(\"bytes=0-499\");\n\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 1);\n\t\tCPPUNIT_ASSERT(r[0].first == 0);\n\t\tCPPUNIT_ASSERT(r[0].second == 499);\n\t}\n\n\tvoid range2()\n\t{\n\t\tx0::HttpRangeDef r;\n\t\tx0::ConstBuffer spec(\"bytes=500-999\");\n\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 1);\n\t\tCPPUNIT_ASSERT(r[0].first == 500);\n\t\tCPPUNIT_ASSERT(r[0].second == 999);\n\t}\n\n\tvoid range3()\n\t{\n\t\tx0::HttpRangeDef r;\n\n\t\tx0::ConstBuffer spec(\"bytes=-500\");\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 1);\n\t\tCPPUNIT_ASSERT(r[0].first == x0::HttpRangeDef::npos);\n\t\tCPPUNIT_ASSERT(r[0].second == 500);\n\t}\n\n\tvoid range4()\n\t{\n\t\tx0::HttpRangeDef r;\n\n\t\tx0::ConstBuffer spec(\"bytes=9500-\");\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 1);\n\t\tCPPUNIT_ASSERT(r[0].first == 9500);\n\t\tCPPUNIT_ASSERT(r[0].second == x0::HttpRangeDef::npos);\n\t}\n\n\tvoid range5()\n\t{\n\t\tx0::HttpRangeDef r;\n\n\t\tx0::ConstBuffer spec(\"bytes=0-0,-1\");\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 2);\n\n\t\tCPPUNIT_ASSERT(r[0].first == 0);\n\t\tCPPUNIT_ASSERT(r[0].second == 0);\n\n\t\tCPPUNIT_ASSERT(r[1].first == x0::HttpRangeDef::npos);\n\t\tCPPUNIT_ASSERT(r[1].second == 1);\n\t}\n\n\tvoid range6()\n\t{\n\t\tx0::HttpRangeDef r;\n\n\t\tx0::ConstBuffer spec(\"bytes=500-700,601-999\");\n\t\tr.parse(spec);\n\t\tCPPUNIT_ASSERT(r.unitName() == \"bytes\");\n\t\tCPPUNIT_ASSERT(r.size() == 2);\n\n\t\tCPPUNIT_ASSERT(r[0].first == 500);\n\t\tCPPUNIT_ASSERT(r[0].second == 700);\n\n\t\tCPPUNIT_ASSERT(r[1].first == 601);\n\t\tCPPUNIT_ASSERT(r[1].second == 999);\n\t}\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(range_def_test);\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"braincloud\/BrainCloudClient.h\"\n#include \"TestResult.h\"\n#include \"TestBCFile.h\"\n#include \"braincloud\/http_codes.h\"\n#include \"braincloud\/reason_codes.h\"\n\n\/\/#define UPLOAD_TIMEOUT_SECS 30\n#define SLEEP_INTERVAL_MS 300\n\nint TestBCFile::createFile(const char * in_path, int in_size)\n{\n    FILE* fp = NULL;\n    fp = fopen(in_path, \"w\");\n    if (fp == NULL)\n    {\n        return -1;\n    }\n    for (int i = 0; i < in_size; ++i)\n    {\n        fputc('!', fp);\n    }\n    fseek(fp, 0, SEEK_END);\n    int fileLen = ftell(fp);\n    fclose(fp);\n    fp = NULL;\n    return fileLen;\n}\n\nbool TestBCFile::simpleUpload(int mb, const std::string & cloudPath, const std::string & cloudFilename, std::string & out_uploadId)\n{\n    std::string localPath = cloudFilename;\n    createFile(localPath.c_str(), mb * 1024 * 1024);\n\n    TestResult tr;\n    m_bc->getFileService()->uploadFile(cloudPath.c_str(), cloudFilename.c_str(), true, true, localPath.c_str(), &tr);\n    if (!tr.run(m_bc))\n    {\n        return false;\n    }\n    out_uploadId = tr.m_response[\"data\"][\"fileDetails\"][\"uploadId\"].asString();\n\n    m_bc->registerFileUploadCallback(this);\n    while (_completedUploadDetails.size() == 0 && _failedUploadDetails.size() == 0)\n    {\n        int64_t transferred = m_bc->getFileService()->getUploadBytesTransferred(out_uploadId.c_str());\n        int64_t total = m_bc->getFileService()->getUploadTotalBytesToTransfer(out_uploadId.c_str());\n        double progress = m_bc->getFileService()->getUploadProgress(out_uploadId.c_str());\n        printf(\"%lld transfered %lld total %f progress\\n\", transferred, total, progress);\n\n        m_bc->runCallbacks();\n        TestResult::sleep(SLEEP_INTERVAL_MS);\n    }\n    m_bc->deregisterFileUploadCallback();\n    return true;\n}\n\n\nvoid TestBCFile::fileUploadCompleted(const char * in_fileUploadId, const std::string & in_jsonResponse)\n{\n    std::cout << \"FileUploadCompleted callback hit\" << std::endl;\n\n    UploadCompletedDetails details;\n    details._fileUploadId = in_fileUploadId;\n    details._jsonResponse = in_jsonResponse;\n    _completedUploadDetails.push_back(details);\n}\n\nvoid TestBCFile::fileUploadFailed(const char * in_fileUploadId, int in_statusCode, int in_reasonCode, const std::string & in_jsonResponse)\n{\n    std::cout << \"FileUploadFailed callback hit status(\" << in_statusCode << \") reason(\" << in_reasonCode << \") id(\" << in_fileUploadId << \")\" << std::endl;\n\n    UploadFailedDetails details;\n    details._fileUploadId = in_fileUploadId;\n    details._statusCode = in_statusCode;\n    details._reasonCode = in_reasonCode;\n    details._jsonResponse = in_jsonResponse;\n    _failedUploadDetails.push_back(details);\n}\n\n\/\/ marmalade does not support file uploads... yet!\n#if !defined(IW_SDK)\n\nTEST_F(TestBCFile, UploadSimpleFile)\n{\n    std::string uploadId;\n    if (!simpleUpload(5, \"\", \"uploadsimplefile.txt\", uploadId))\n    {\n        return;\n    }\n    \n    ASSERT_EQ(_completedUploadDetails.size(), 1);\n    ASSERT_EQ(_failedUploadDetails.size(), 0);\n}\n\nTEST_F(TestBCFile, UploadSimpleFileAndCancel)\n{\n    std::string localPath = \"uploadsimplefile.txt\";\n    createFile(localPath.c_str(), 3*1024*1024);\n    \n    TestResult tr;\n    m_bc->getFileService()->uploadFile(\"\", localPath.c_str(), true, true, localPath.c_str(), &tr);\n    if (!tr.run(m_bc))\n    {\n        return;\n    }\n    std::string uploadId = tr.m_response[\"data\"][\"fileDetails\"][\"uploadId\"].asString();\n    \n    m_bc->registerFileUploadCallback(this);\n    bool transferHasStarted = false;\n    while(!transferHasStarted)\n    {\n        m_bc->runCallbacks();\n        int64_t transferred = m_bc->getFileService()->getUploadBytesTransferred(uploadId.c_str());\n        int64_t total = m_bc->getFileService()->getUploadTotalBytesToTransfer(uploadId.c_str());\n        double progress = m_bc->getFileService()->getUploadProgress(uploadId.c_str());\n        printf(\"%lld transfered %lld total %f progress\\n\", transferred, total, progress);\n        \n        if (transferred > 0)\n        {\n            transferHasStarted = true;\n        }\n        TestResult::sleep(SLEEP_INTERVAL_MS);\n    }\n    if (!transferHasStarted)\n    {\n        m_bc->deregisterFileUploadCallback();\n        ASSERT_TRUE(transferHasStarted);\n        return;\n    }\n    \n    printf(\"Cancelling upload\\n\");\n    m_bc->getFileService()->cancelUpload(uploadId.c_str());\n    while (_completedUploadDetails.size() == 0 && _failedUploadDetails.size() == 0)\n    {\n        m_bc->runCallbacks();\n        TestResult::sleep(SLEEP_INTERVAL_MS);\n    }\n    m_bc->deregisterFileUploadCallback();\n\n    ASSERT_EQ(_failedUploadDetails.size(), 1);\n    ASSERT_EQ(_completedUploadDetails.size(), 0);\n    ASSERT_EQ(_failedUploadDetails[0]._statusCode, HTTP_CLIENT_NETWORK_ERROR);\n    ASSERT_EQ(_failedUploadDetails[0]._reasonCode, CLIENT_UPLOAD_FILE_CANCELLED);\n}\n\nTEST_F(TestBCFile, ListUserFiles)\n{\n    TestResult tr;\n    m_bc->getFileService()->listUserFiles(&tr);\n    tr.run(m_bc);\n}\n\nTEST_F(TestBCFile, UploadMultipleFiles)\n{\n\tm_bc->registerFileUploadCallback(this);\n    \n    std::vector<std::string> uploadIds;\n    int numTransfers = 3;\n    for (int i = 0; i < numTransfers; ++i)\n    {\n        std::string localPath = \"uploadmultiplefile\"  + std::to_string(i + 1) + \".txt\";\n        createFile(localPath.c_str(), 2*1024*1024);\n\n        TestResult tr;\n        m_bc->getFileService()->uploadFile(\"\", localPath.c_str(), true, true, localPath.c_str(), &tr);\n        if (!tr.run(m_bc))\n        {\n            return;\n        }\n        std::string uploadId = tr.m_response[\"data\"][\"fileDetails\"][\"uploadId\"].asString();\n        uploadIds.push_back(uploadId);\n    }\n    \n    int timeoutMs = 120000;\n    while (_completedUploadDetails.size() + _failedUploadDetails.size() < numTransfers && timeoutMs > 0)\n    {\n        m_bc->runCallbacks();\n        for (int i = 0; i < numTransfers; ++i)\n        {\n            int64_t transferred = m_bc->getFileService()->getUploadBytesTransferred(uploadIds[i].c_str());\n            int64_t total = m_bc->getFileService()->getUploadTotalBytesToTransfer(uploadIds[i].c_str());\n            double progress = m_bc->getFileService()->getUploadProgress(uploadIds[i].c_str());\n            if (transferred >= 0)\n            {\n                printf(\"File%d %lld transfered %lld total %f progress\\n\", i+1, transferred, total, progress);\n            }\n        }\n        \n        timeoutMs -= SLEEP_INTERVAL_MS;\n        TestResult::sleep(SLEEP_INTERVAL_MS);\n    }\n    m_bc->deregisterFileUploadCallback();\n\n    ASSERT_TRUE(timeoutMs >= 0);\n    ASSERT_EQ(_completedUploadDetails.size(), numTransfers);\n    ASSERT_EQ(_failedUploadDetails.size(), 0);\n\n    \/\/ Delete them. expect errors if the test failed, that's fine\n    \/\/ So brainCloud doesn't grow indefinitely.\n    for (int i = 0; i < numTransfers; ++i)\n    {\n        TestResult tr;\n        std::string localPath = \"uploadmultiplefile\"  + std::to_string(i + 1) + \".txt\";\n        m_bc->getFileService()->deleteUserFile(\"\", localPath.c_str(), &tr);\n        tr.run(m_bc);\n    }\n}\n\nTEST_F(TestBCFile, DeleteUserFile)\n{\n    std::string uploadId;\n    if (!simpleUpload(19, \"\", \"uploadsimplefile.txt\", uploadId))\n    {\n        return;\n    }\n    \n    ASSERT_EQ(_completedUploadDetails.size(), 1);\n    ASSERT_EQ(_failedUploadDetails.size(), 0);\n    \n    TestResult tr;\n    m_bc->getFileService()->deleteUserFile(\"\", \"uploadsimplefile.txt\", &tr);\n    tr.run(m_bc);\n}\n\nTEST_F(TestBCFile, GetCDNUrl)\n{\n\tstd::string uploadId;\n\tif (!simpleUpload(19, \"\", \"uploadsimplefile.txt\", uploadId))\n\t{\n\t\treturn;\n\t}\n\n\tASSERT_EQ(_completedUploadDetails.size(), 1);\n\tASSERT_EQ(_failedUploadDetails.size(), 0);\n\n\tTestResult tr;\n\tm_bc->getFileService()->getCDNUrl(\"\", \"uploadsimplefile.txt\", &tr);\n\ttr.run(m_bc);\n\n\tm_bc->getFileService()->deleteUserFile(\"\", \"uploadsimplefile.txt\", &tr);\n\ttr.run(m_bc);\n}\n\n\/\/ this test requires use of a bandwidth limiter\n\/\/ so it's normally commented out\n\/*\nTEST_F(TestBCFile, LowRateTimeout)\n{\n    m_bc->setUploadLowTransferRateThreshold(500);\n    m_bc->setUploadLowTransferRateTimeout(15);\n\n    std::string uploadId;\n    if (!simpleUpload(19, \"\", \"uploadsimplefile.txt\", uploadId))\n    {\n        return;\n    }\n\n    ASSERT_EQ(_completedUploadDetails.size(), 0);\n    ASSERT_EQ(_failedUploadDetails.size(), 1);\n    ASSERT_EQ(_failedUploadDetails[0]._statusCode, HTTP_CUSTOM);\n    ASSERT_EQ(_failedUploadDetails[0]._reasonCode, CLIENT_UPLOAD_FILE_TIMED_OUT);\n}\n*\/\n\n#endif \/\/!IW_SDK<commit_msg>Break before sleep in FileUploadCancel test<commit_after>#include \"gtest\/gtest.h\"\n#include \"braincloud\/BrainCloudClient.h\"\n#include \"TestResult.h\"\n#include \"TestBCFile.h\"\n#include \"braincloud\/http_codes.h\"\n#include \"braincloud\/reason_codes.h\"\n\n\/\/#define UPLOAD_TIMEOUT_SECS 30\n#define SLEEP_INTERVAL_MS 300\n\nint TestBCFile::createFile(const char * in_path, int in_size)\n{\n    FILE* fp = NULL;\n    fp = fopen(in_path, \"w\");\n    if (fp == NULL)\n    {\n        return -1;\n    }\n    for (int i = 0; i < in_size; ++i)\n    {\n        fputc('!', fp);\n    }\n    fseek(fp, 0, SEEK_END);\n    int fileLen = ftell(fp);\n    fclose(fp);\n    fp = NULL;\n    return fileLen;\n}\n\nbool TestBCFile::simpleUpload(int mb, const std::string & cloudPath, const std::string & cloudFilename, std::string & out_uploadId)\n{\n    std::string localPath = cloudFilename;\n    createFile(localPath.c_str(), mb * 1024 * 1024);\n\n    TestResult tr;\n    m_bc->getFileService()->uploadFile(cloudPath.c_str(), cloudFilename.c_str(), true, true, localPath.c_str(), &tr);\n    if (!tr.run(m_bc))\n    {\n        return false;\n    }\n    out_uploadId = tr.m_response[\"data\"][\"fileDetails\"][\"uploadId\"].asString();\n\n    m_bc->registerFileUploadCallback(this);\n    while (_completedUploadDetails.size() == 0 && _failedUploadDetails.size() == 0)\n    {\n        int64_t transferred = m_bc->getFileService()->getUploadBytesTransferred(out_uploadId.c_str());\n        int64_t total = m_bc->getFileService()->getUploadTotalBytesToTransfer(out_uploadId.c_str());\n        double progress = m_bc->getFileService()->getUploadProgress(out_uploadId.c_str());\n        printf(\"%lld transfered %lld total %f progress\\n\", transferred, total, progress);\n\n        m_bc->runCallbacks();\n        TestResult::sleep(SLEEP_INTERVAL_MS);\n    }\n    m_bc->deregisterFileUploadCallback();\n    return true;\n}\n\n\nvoid TestBCFile::fileUploadCompleted(const char * in_fileUploadId, const std::string & in_jsonResponse)\n{\n    std::cout << \"FileUploadCompleted callback hit\" << std::endl;\n\n    UploadCompletedDetails details;\n    details._fileUploadId = in_fileUploadId;\n    details._jsonResponse = in_jsonResponse;\n    _completedUploadDetails.push_back(details);\n}\n\nvoid TestBCFile::fileUploadFailed(const char * in_fileUploadId, int in_statusCode, int in_reasonCode, const std::string & in_jsonResponse)\n{\n    std::cout << \"FileUploadFailed callback hit status(\" << in_statusCode << \") reason(\" << in_reasonCode << \") id(\" << in_fileUploadId << \")\" << std::endl;\n\n    UploadFailedDetails details;\n    details._fileUploadId = in_fileUploadId;\n    details._statusCode = in_statusCode;\n    details._reasonCode = in_reasonCode;\n    details._jsonResponse = in_jsonResponse;\n    _failedUploadDetails.push_back(details);\n}\n\n\/\/ marmalade does not support file uploads... yet!\n#if !defined(IW_SDK)\n\nTEST_F(TestBCFile, UploadSimpleFile)\n{\n    std::string uploadId;\n    if (!simpleUpload(5, \"\", \"uploadsimplefile.txt\", uploadId))\n    {\n        return;\n    }\n    \n    ASSERT_EQ(_completedUploadDetails.size(), 1);\n    ASSERT_EQ(_failedUploadDetails.size(), 0);\n}\n\nTEST_F(TestBCFile, UploadSimpleFileAndCancel)\n{\n    std::string localPath = \"uploadsimplefile.txt\";\n    createFile(localPath.c_str(), 3*1024*1024);\n    \n    TestResult tr;\n    m_bc->registerFileUploadCallback(this);\n    m_bc->getFileService()->uploadFile(\"\", localPath.c_str(), true, true, localPath.c_str(), &tr);\n    if (!tr.run(m_bc))\n    {\n        return;\n    }\n    std::string uploadId = tr.m_response[\"data\"][\"fileDetails\"][\"uploadId\"].asString();\n    \n    bool transferHasStarted = false;\n    while(!transferHasStarted)\n    {\n        m_bc->runCallbacks();\n        int64_t transferred = m_bc->getFileService()->getUploadBytesTransferred(uploadId.c_str());\n        int64_t total = m_bc->getFileService()->getUploadTotalBytesToTransfer(uploadId.c_str());\n        double progress = m_bc->getFileService()->getUploadProgress(uploadId.c_str());\n        printf(\"%lld transfered %lld total %f progress\\n\", transferred, total, progress);\n        \n        if (transferred > 0)\n        {\n            transferHasStarted = true;\n            break; \/\/ We don't want to get hit by the sleep\n        }\n        TestResult::sleep(SLEEP_INTERVAL_MS);\n    }\n    if (!transferHasStarted)\n    {\n        m_bc->deregisterFileUploadCallback();\n        ASSERT_TRUE(transferHasStarted);\n        return;\n    }\n    \n    printf(\"Cancelling upload\\n\");\n    m_bc->getFileService()->cancelUpload(uploadId.c_str());\n    while (_completedUploadDetails.size() == 0 && _failedUploadDetails.size() == 0)\n    {\n        m_bc->runCallbacks();\n        TestResult::sleep(SLEEP_INTERVAL_MS);\n    }\n    m_bc->deregisterFileUploadCallback();\n\n    ASSERT_EQ(_failedUploadDetails.size(), 1);\n    ASSERT_EQ(_completedUploadDetails.size(), 0);\n    ASSERT_EQ(_failedUploadDetails[0]._statusCode, HTTP_CLIENT_NETWORK_ERROR);\n    ASSERT_EQ(_failedUploadDetails[0]._reasonCode, CLIENT_UPLOAD_FILE_CANCELLED);\n}\n\nTEST_F(TestBCFile, ListUserFiles)\n{\n    TestResult tr;\n    m_bc->getFileService()->listUserFiles(&tr);\n    tr.run(m_bc);\n}\n\nTEST_F(TestBCFile, UploadMultipleFiles)\n{\n\tm_bc->registerFileUploadCallback(this);\n    \n    std::vector<std::string> uploadIds;\n    int numTransfers = 3;\n    for (int i = 0; i < numTransfers; ++i)\n    {\n        std::string localPath = \"uploadmultiplefile\"  + std::to_string(i + 1) + \".txt\";\n        createFile(localPath.c_str(), 2*1024*1024);\n\n        TestResult tr;\n        m_bc->getFileService()->uploadFile(\"\", localPath.c_str(), true, true, localPath.c_str(), &tr);\n        if (!tr.run(m_bc))\n        {\n            return;\n        }\n        std::string uploadId = tr.m_response[\"data\"][\"fileDetails\"][\"uploadId\"].asString();\n        uploadIds.push_back(uploadId);\n    }\n    \n    int timeoutMs = 120000;\n    while (_completedUploadDetails.size() + _failedUploadDetails.size() < numTransfers && timeoutMs > 0)\n    {\n        m_bc->runCallbacks();\n        for (int i = 0; i < numTransfers; ++i)\n        {\n            int64_t transferred = m_bc->getFileService()->getUploadBytesTransferred(uploadIds[i].c_str());\n            int64_t total = m_bc->getFileService()->getUploadTotalBytesToTransfer(uploadIds[i].c_str());\n            double progress = m_bc->getFileService()->getUploadProgress(uploadIds[i].c_str());\n            if (transferred >= 0)\n            {\n                printf(\"File%d %lld transfered %lld total %f progress\\n\", i+1, transferred, total, progress);\n            }\n        }\n        \n        timeoutMs -= SLEEP_INTERVAL_MS;\n        TestResult::sleep(SLEEP_INTERVAL_MS);\n    }\n    m_bc->deregisterFileUploadCallback();\n\n    ASSERT_TRUE(timeoutMs >= 0);\n    ASSERT_EQ(_completedUploadDetails.size(), numTransfers);\n    ASSERT_EQ(_failedUploadDetails.size(), 0);\n\n    \/\/ Delete them. expect errors if the test failed, that's fine\n    \/\/ So brainCloud doesn't grow indefinitely.\n    for (int i = 0; i < numTransfers; ++i)\n    {\n        TestResult tr;\n        std::string localPath = \"uploadmultiplefile\"  + std::to_string(i + 1) + \".txt\";\n        m_bc->getFileService()->deleteUserFile(\"\", localPath.c_str(), &tr);\n        tr.run(m_bc);\n    }\n}\n\nTEST_F(TestBCFile, DeleteUserFile)\n{\n    std::string uploadId;\n    if (!simpleUpload(19, \"\", \"uploadsimplefile.txt\", uploadId))\n    {\n        return;\n    }\n    \n    ASSERT_EQ(_completedUploadDetails.size(), 1);\n    ASSERT_EQ(_failedUploadDetails.size(), 0);\n    \n    TestResult tr;\n    m_bc->getFileService()->deleteUserFile(\"\", \"uploadsimplefile.txt\", &tr);\n    tr.run(m_bc);\n}\n\nTEST_F(TestBCFile, GetCDNUrl)\n{\n\tstd::string uploadId;\n\tif (!simpleUpload(19, \"\", \"uploadsimplefile.txt\", uploadId))\n\t{\n\t\treturn;\n\t}\n\n\tASSERT_EQ(_completedUploadDetails.size(), 1);\n\tASSERT_EQ(_failedUploadDetails.size(), 0);\n\n\tTestResult tr;\n\tm_bc->getFileService()->getCDNUrl(\"\", \"uploadsimplefile.txt\", &tr);\n\ttr.run(m_bc);\n\n\tm_bc->getFileService()->deleteUserFile(\"\", \"uploadsimplefile.txt\", &tr);\n\ttr.run(m_bc);\n}\n\n\/\/ this test requires use of a bandwidth limiter\n\/\/ so it's normally commented out\n\/*\nTEST_F(TestBCFile, LowRateTimeout)\n{\n    m_bc->setUploadLowTransferRateThreshold(500);\n    m_bc->setUploadLowTransferRateTimeout(15);\n\n    std::string uploadId;\n    if (!simpleUpload(19, \"\", \"uploadsimplefile.txt\", uploadId))\n    {\n        return;\n    }\n\n    ASSERT_EQ(_completedUploadDetails.size(), 0);\n    ASSERT_EQ(_failedUploadDetails.size(), 1);\n    ASSERT_EQ(_failedUploadDetails[0]._statusCode, HTTP_CUSTOM);\n    ASSERT_EQ(_failedUploadDetails[0]._reasonCode, CLIENT_UPLOAD_FILE_TIMED_OUT);\n}\n*\/\n\n#endif \/\/!IW_SDK<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by chase on 5\/4\/15.\n\/\/\n\n#include \"gtest\/gtest.h\"\n#include \"..\/EasyRedis.h\"\n#include \"test_easyredis_fixture.h\"\n\nusing namespace easyredis;{\n\n}\n\nTEST_F (EasyRedisTest, TestContextCreation)\n{\n    EasyRedis easyRedis = EasyRedis(\"localhost\", 6379);\n    EXPECT_TRUE(easyRedis.raw_redis_context() != NULL);\n    ASSERT_EQ(easyRedis.raw_redis_context()->err, 0);\n}\n\nTEST_F (EasyRedisTest, TestContextCreationFailure)\n{\n    EasyRedis easyRedis = EasyRedis(\"localhost\", 6378);\n    EXPECT_TRUE(easyRedis.raw_redis_context() != NULL);\n    ASSERT_EQ(easyRedis.raw_redis_context()->err, 1);\n}\n\nTEST_F (EasyRedisTest, TestRunCommandReply)\n{\n    EasyRedis easyRedis = EasyRedis(\"localhost\", 6379);\n    EasyRedisReply setReply = easyRedis.run_command(\"SET %s %s\", test_key_set.c_str(), test_value.c_str());\n    EasyRedisReply getReply = easyRedis.run_command(\"GET %s\", test_key_set.c_str());\n\n    ASSERT_NE(setReply.raw_redis_reply()->type, REDIS_REPLY_ERROR);\n    ASSERT_EQ(strcmp(test_value.c_str(), getReply.raw_redis_reply()->str), 0);\n}\n\nTEST_F (EasyRedisTest, TestRunCommandNoReply)\n{\n    EasyRedis easyRedis = EasyRedis(\"localhost\", 6379);\n    EasyRedisReply setReply = easyRedis.run_command(\"SET %s %s\", test_key_set.c_str(), test_value.c_str());\n    EasyRedisReply getReply = easyRedis.run_command(\"GET %s\", test_key_not_set.c_str());\n\n\n    ASSERT_NE(setReply.raw_redis_reply()->type, REDIS_REPLY_ERROR);\n    ASSERT_EQ(getReply.raw_redis_reply()->type, REDIS_REPLY_NIL);\n}<commit_msg>fixing extra brackets<commit_after>\/\/\n\/\/ Created by chase on 5\/4\/15.\n\/\/\n\n#include \"gtest\/gtest.h\"\n#include \"..\/EasyRedis.h\"\n#include \"test_easyredis_fixture.h\"\n\nusing namespace easyredis;\n\nTEST_F (EasyRedisTest, TestContextCreation)\n{\n    EasyRedis easyRedis = EasyRedis(\"localhost\", 6379);\n    EXPECT_TRUE(easyRedis.raw_redis_context() != NULL);\n    ASSERT_EQ(easyRedis.raw_redis_context()->err, 0);\n}\n\nTEST_F (EasyRedisTest, TestContextCreationFailure)\n{\n    EasyRedis easyRedis = EasyRedis(\"localhost\", 6378);\n    EXPECT_TRUE(easyRedis.raw_redis_context() != NULL);\n    ASSERT_EQ(easyRedis.raw_redis_context()->err, 1);\n}\n\nTEST_F (EasyRedisTest, TestRunCommandReply)\n{\n    EasyRedis easyRedis = EasyRedis(\"localhost\", 6379);\n    EasyRedisReply setReply = easyRedis.run_command(\"SET %s %s\", test_key_set.c_str(), test_value.c_str());\n    EasyRedisReply getReply = easyRedis.run_command(\"GET %s\", test_key_set.c_str());\n\n    ASSERT_NE(setReply.raw_redis_reply()->type, REDIS_REPLY_ERROR);\n    ASSERT_EQ(strcmp(test_value.c_str(), getReply.raw_redis_reply()->str), 0);\n}\n\nTEST_F (EasyRedisTest, TestRunCommandNoReply)\n{\n    EasyRedis easyRedis = EasyRedis(\"localhost\", 6379);\n    EasyRedisReply setReply = easyRedis.run_command(\"SET %s %s\", test_key_set.c_str(), test_value.c_str());\n    EasyRedisReply getReply = easyRedis.run_command(\"GET %s\", test_key_not_set.c_str());\n\n\n    ASSERT_NE(setReply.raw_redis_reply()->type, REDIS_REPLY_ERROR);\n    ASSERT_EQ(getReply.raw_redis_reply()->type, REDIS_REPLY_NIL);\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <ctime>\n\n#include \"..\/..\/entetes\/parc.h\"\n\nusing namespace std;\n\nint main() {\n\n\n    \/** POUR DE L'ALÉATOIRE **\/\n    srand(time(NULL));\n\n\n\n\n    \/* *************************** *\/\n    \/* CRÉATION D'ANIMAUX          *\/\n    \/* *************************** *\/\n    Tigre Helico(105, 654, \"Diego\", 1);\n    Tigre Paul(241, 3321, \"Pau'Pol\", 2);\n\n    Basque Xabi(125, 63, 1, 9999999, \"Xabi\", 3);\n    Basque Ninicolas(12, 125, 14, 4419, \"Nicolas Belloir\", 4);\n\n    Marmotte Miam(95, 6544, \"Shakira\", 5);\n    Marmotte Tekitoi(245, 20, \"Rihanna\", 6);\n\n    Elephant Pikachu(1021, 365, 102, \"Valentin\", 74);\n    Elephant PHP(412, 35, 212, \"C++\", 744);\n\n    Aigle Piafabec(95, 6544, \"Poussin\", 51);\n    Aigle Roucarnage(652, 474, \"Pousse pousse\", 11);\n\n    Lapin Valou(64, \"Rouge\", \"Mimie Matti\", 26);\n    Lapin Tuture(205, \"Blanche\", \"GTi\", 205);\n\n    Tortue Toto(35, 1201, \"Arc-end-ciel\", \"Speedy Gonzalez\", 7);\n    Tortue Toutou(135, 11, \"Invisible\", \"Faut pas pousser mes mail dans les ordis !\", 17);\n\n    Crocodile GrosseDent(3045, 124, \"Mange de l'herbe\", 8);\n    Crocodile MoiJaiFaim(212345, 542, \"Trotro Rigolo !\", 84);\n\n    Girafe PetiteB(120, 5412, \"Gigi\", 9);\n    Girafe QuiVeutDesTalons(21, 6854, \"Tour Eiffel\", 19);\n\n    Loutre loulou(12,14,\"Moi j'ai des amis !\", 110);\n    Loutre PasDeSequelles(1,4,\"Gnééé !\", 150);\n\n\n    \/* *************************** *\/\n    \/* CRÉATION D'ENCLOS           *\/\n    \/* *************************** *\/\n    Enclos parcSafari(\"Attrapez-les tous !\", 1, 23 , 1);\n    Enclos paysBasque(\"Zone 51\", 3, 2 , 4);\n    Enclos UPPA(\"Ça peut dégénérer en liste...\", 2, 53 , 41);\n    Enclos monkeyIsland(\"La planète des singes\", 3, 5 , 11);\n    Enclos azerty(\"Qwerty\", 1, 2233 , 21);\n    Enclos ocean(\"Hasta la victoria siempre\", 3, 64 , 31);\n\n\n\n    \/* *************************** *\/\n    \/* CRÉATION D'UN PARC          *\/\n    \/* *************************** *\/\n    cout << \"*************************\" << endl;\n    cout << \"* CRÉATION D'UN PARC    *\" << endl;\n    cout << \"*************************\" << endl;\n    Parc Parc1;\n\n\n    \/* *************************** *\/\n    \/* AJOUT D'ENCLOS              *\/\n    \/* *************************** *\/\n    cout << \"*************************\" << endl;\n    cout << \"* AJOUT D'ENCLOS        *\" << endl;\n    cout << \"*************************\" << endl;\n    Parc1.creerEnclos(\"Attrapez-les tous !\",1,23);\n    Parc1.creerEnclos(\"Zone 51\",3,2);\n    Parc1.creerEnclos(\"Ça peut dégénérer en liste...\",2,53);\n    Parc1.creerEnclos(\"La planète des singes\",3,5);\n    Parc1.creerEnclos(\"Qwerty\",1,21);\n    Parc1.creerEnclos(\"Hasta la victoria siempre\",3,64);\n\n    cout << Parc1 << endl;\n\n    for(int i=0; i<Parc1.getNbEnclos(); i++) {\n        cout << Parc1.getEnclos(i) << endl;\n    }\n\n\n    \/* *************************** *\/\n    \/* SUPPRESSION D'UN ENCLOS     *\/\n    \/* *************************** *\/\n    cout << \"***********************************\" << endl;\n    cout << \"* SUPPRESSION D'UN ENCLOS (ID=4)  *\" << endl;\n    cout << \"***********************************\" << endl;\n    Parc1.supprimerEnclos(4);\n    for(int i=0; i<Parc1.getNbEnclos(); i++) {\n        cout << Parc1.getEnclos(i) << endl;\n    }\n\n\n    \/* *************************** *\/\n    \/* AJOUT D'ENCLOS              *\/\n    \/* *************************** *\/\n    cout << \"*************************\" << endl;\n    cout << \"* AJOUT D'ANIMAUX       *\" << endl;\n    cout << \"*************************\" << endl;\n\n    \/\/ Test ajout 1 animal dans 1 enclos\n    Parc1.creerAnimal(&Helico, 1);\n    cout << Parc1.getEnclos(0);\n    cout << Parc1.getEnclos(0).getAnimal(0) << endl;\n\n\n    \/\/ Test surpeupler enclos\n    Parc1.creerAnimal(&Pikachu, 2);\n    Parc1.creerAnimal(&Tuture, 2);\n    Parc1.creerAnimal(&Valou, 2);\n    Parc1.creerAnimal(&PetiteB, 2);\n    cout << Parc1.getEnclos(1);\n    cout << Parc1.getEnclos(1).getAnimal(0) << endl;\n    cout << Parc1.getEnclos(1).getAnimal(1) << endl;\n\n    \/\/ Test ajout aigle dans enclos\n    Parc1.creerAnimal(&Roucarnage, 1);\n    Parc1.creerAnimal(&Roucarnage, 1);\n    cout << Parc1.getEnclos(0);\n    cout << Parc1.getEnclos(0).getAnimal(0) << endl;\n\n    \/\/ Test ajout proie dans enclos 1\n    Parc1.creerAnimal(&Valou, 1);\n    cout << Parc1.getEnclos(0);\n    cout << Parc1.getEnclos(0).getAnimal(0) << endl;\n    if(Parc1.getEnclos(0).getOccupation() == 2) {cout << Parc1.getEnclos(0).getAnimal(1) << endl;}\n\n\n    \/\/ Test proies doivent se défendre\n    Parc1.creerAnimal(&PHP, 3);\n    Parc1.creerAnimal(&PHP, 3);\n   \/\/ Parc1.creerAnimal(&Pikachu, 3);\n  \/\/  Parc1.creerAnimal(&Pikachu, 3);\n    Parc1.creerAnimal(&Pikachu, 3);\n    cout << Parc1.getEnclos(2);\n    Parc1.creerAnimal(&MoiJaiFaim, 3);\n    cout << Parc1.getEnclos(2) << endl;\n    cout << *Parc1.getEnclos(2).getPtrAnimal(0) << endl;\n   \/\/ Parc1.creerAnimal(&Helico, 5);\n    \/\/\n    \/\/cout << Parc1.getEnclos(0).getAnimal(1) << endl;\n   \/\/ int a;\n   \/\/ cin >> a;\n    return 0;\n}\n<commit_msg>tests en cours sur Parc<commit_after>#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <ctime>\n\n#include \"..\/..\/entetes\/parc.h\"\n\nusing namespace std;\n\nint main() {\n\n\n    \/** POUR DE L'ALÉATOIRE **\/\n    srand(time(NULL));\n\n\n\n\n    \/* *************************** *\/\n    \/* CRÉATION D'ANIMAUX          *\/\n    \/* *************************** *\/\n    Tigre Helico(105, 654, \"Diego\", 1);\n    Tigre Paul(241, 3321, \"Pau'Pol\", 2);\n\n    Basque Xabi(125, 63, 1, 9999999, \"Xabi\", 3);\n    Basque Ninicolas(12, 125, 14, 4419, \"Nicolas Belloir\", 4);\n\n    Marmotte Miam(95, 6544, \"Shakira\", 5);\n    Marmotte Tekitoi(245, 20, \"Rihanna\", 6);\n\n    Elephant Pikachu(1021, 365, 102, \"Valentin\", 74);\n    Elephant PHP(412, 35, 212, \"C++\", 744);\n\n    Aigle Piafabec(95, 6544, \"Poussin\", 51);\n    Aigle Roucarnage(652, 474, \"Pousse pousse\", 11);\n\n    Lapin Valou(64, \"Rouge\", \"Mimie Matti\", 26);\n    Lapin Tuture(205, \"Blanche\", \"GTi\", 205);\n\n    Tortue Toto(35, 1201, \"Arc-end-ciel\", \"Speedy Gonzalez\", 7);\n    Tortue Toutou(135, 11, \"Invisible\", \"Faut pas pousser mes mail dans les ordis !\", 17);\n\n    Crocodile GrosseDent(3045, 124, \"Mange de l'herbe\", 8);\n    Crocodile MoiJaiFaim(212345, 542, \"Trotro Rigolo !\", 84);\n\n    Girafe PetiteB(120, 5412, \"Gigi\", 9);\n    Girafe QuiVeutDesTalons(21, 6854, \"Tour Eiffel\", 19);\n\n    Loutre loulou(12,14,\"Moi j'ai des amis !\", 110);\n    Loutre PasDeSequelles(1,4,\"Gnééé !\", 150);\n\n\n    \/* *************************** *\/\n    \/* CRÉATION D'ENCLOS           *\/\n    \/* *************************** *\/\n    Enclos parcSafari(\"Attrapez-les tous !\", 1, 23 , 1);\n    Enclos paysBasque(\"Zone 51\", 3, 2 , 4);\n    Enclos UPPA(\"Ça peut dégénérer en liste...\", 2, 53 , 41);\n    Enclos monkeyIsland(\"La planète des singes\", 3, 5 , 11);\n    Enclos azerty(\"Qwerty\", 1, 2233 , 21);\n    Enclos ocean(\"Hasta la victoria siempre\", 3, 64 , 31);\n\n\n\n    \/* *************************** *\/\n    \/* CRÉATION D'UN PARC          *\/\n    \/* *************************** *\/\n    cout << \"*************************\" << endl;\n    cout << \"* CRÉATION D'UN PARC    *\" << endl;\n    cout << \"*************************\" << endl;\n    Parc Parc1;\n\n\n    \/* *************************** *\/\n    \/* AJOUT D'ENCLOS              *\/\n    \/* *************************** *\/\n    cout << \"*************************\" << endl;\n    cout << \"* AJOUT D'ENCLOS        *\" << endl;\n    cout << \"*************************\" << endl;\n    Parc1.creerEnclos(\"Attrapez-les tous !\",1,23);\n    Parc1.creerEnclos(\"Zone 51\",3,2);\n    Parc1.creerEnclos(\"Ça peut dégénérer en liste...\",2,53);\n    Parc1.creerEnclos(\"La planète des singes\",3,5);\n    Parc1.creerEnclos(\"Qwerty\",1,21);\n    Parc1.creerEnclos(\"Hasta la victoria siempre\",3,64);\n\n    cout << Parc1 << endl;\n\n    for(int i=0; i<Parc1.getNbEnclos(); i++) {\n        cout << Parc1.getEnclos(i) << endl;\n    }\n\n\n    \/* *************************** *\/\n    \/* SUPPRESSION D'UN ENCLOS     *\/\n    \/* *************************** *\/\n    cout << \"***********************************\" << endl;\n    cout << \"* SUPPRESSION D'UN ENCLOS (ID=4)  *\" << endl;\n    cout << \"***********************************\" << endl;\n    Parc1.supprimerEnclos(4);\n    for(int i=0; i<Parc1.getNbEnclos(); i++) {\n        cout << Parc1.getEnclos(i) << endl;\n    }\n\n\n    \/* *************************** *\/\n    \/* AJOUT D'ENCLOS              *\/\n    \/* *************************** *\/\n    cout << \"*************************\" << endl;\n    cout << \"* AJOUT D'ANIMAUX       *\" << endl;\n    cout << \"*************************\" << endl;\n\n    \/\/ Test ajout 1 animal dans 1 enclos\n    Parc1.creerAnimal(&Helico, 1);\n    cout << Parc1.getEnclos(0);\n    cout << Parc1.getEnclos(0).getAnimal(0) << endl;\n\n\n    \/\/ Test surpeupler enclos\n    Parc1.creerAnimal(&Pikachu, 2);\n    Parc1.creerAnimal(&Tuture, 2);\n    Parc1.creerAnimal(&Valou, 2);\n    Parc1.creerAnimal(&PetiteB, 2);\n    cout << Parc1.getEnclos(1);\n    cout << Parc1.getEnclos(1).getAnimal(0) << endl;\n    cout << Parc1.getEnclos(1).getAnimal(1) << endl;\n\n    \/\/ Test ajout aigle dans enclos\n    Parc1.creerAnimal(&Roucarnage, 1);\n    Parc1.creerAnimal(&Roucarnage, 1);\n    cout << Parc1.getEnclos(0);\n    cout << Parc1.getEnclos(0).getAnimal(0) << endl;\n\n    \/\/ Test ajout proie dans enclos 1\n    Parc1.creerAnimal(&Valou, 1);\n    cout << Parc1.getEnclos(0);\n    cout << Parc1.getEnclos(0).getAnimal(0) << endl;\n    if(Parc1.getEnclos(0).getOccupation() == 2) {cout << Parc1.getEnclos(0).getAnimal(1) << endl;}\n\n\n    \/\/ Test proies doivent se défendre\n    Parc1.creerAnimal(&PHP, 3);\n    Parc1.creerAnimal(&PHP, 3);\n   \/\/ Parc1.creerAnimal(&Pikachu, 3);\n  \/\/  Parc1.creerAnimal(&Pikachu, 3);\n    Parc1.creerAnimal(&Pikachu, 3);\n    cout << Parc1.getEnclos(2);\n    Parc1.creerAnimal(&MoiJaiFaim, 3);\n    cout << Parc1.getEnclos(2) << endl;\n    cout << *Parc1.getEnclos(2).getPtrAnimal(0) << endl;\n    cout << *Parc1.getEnclos(2).getPtrAnimal(1) << endl;\n   \/\/ Parc1.creerAnimal(&Helico, 5);\n    \/\/\n    \/\/cout << Parc1.getEnclos(0).getAnimal(1) << endl;\n   \/\/ int a;\n   \/\/ cin >> a;\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*===========================================================================*\\\n*                                                                           *\n*                               OpenMesh                                    *\n*      Copyright (C) 2001-2011 by Computer Graphics Group, RWTH Aachen      *\n*                           www.openmesh.org                                *\n*                                                                           *\n*---------------------------------------------------------------------------* \n*  This file is part of OpenMesh.                                           *\n*                                                                           *\n*  OpenMesh is free software: you can redistribute it and\/or modify         * \n*  it under the terms of the GNU Lesser 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 with the              *\n*  following exceptions:                                                    *\n*                                                                           *\n*  If other files instantiate templates or use macros                       *\n*  or inline functions from this file, or you compile this file and         *\n*  link it with other files to produce an executable, this file does        *\n*  not by itself cause the resulting executable to be covered by the        *\n*  GNU Lesser General Public License. This exception does not however       *\n*  invalidate any other reasons why the executable file might be            *\n*  covered by the GNU Lesser General Public License.                        *\n*                                                                           *\n*  OpenMesh is distributed in the hope that it 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 LesserGeneral Public          *\n*  License along with OpenMesh.  If not,                                    *\n*  see <http:\/\/www.gnu.org\/licenses\/>.                                      *\n*                                                                           *\n\\*==========================================================================*\/ \n\n\/*==========================================================================*\\\n*                                                                           *             \n*   $Revision: 410 $                                                        *\n*   $Date: 2010-06-17 12:45:58 +0200 (Do, 17. Jun 2010) $                   *\n*                                                                           *\n\\*==========================================================================*\/\n\n\/** \\file LongestEdgeT.hh\n\n*\/\n\n\/\/=============================================================================\n\/\/\n\/\/  CLASS LongestEdgeT\n\/\/\n\/\/=============================================================================\n\n\n#ifndef LINEAR_H\n#define LINEAR_H\n\n#include <OpenMesh\/Tools\/Subdivider\/Uniform\/SubdividerT.hh>\n#include <OpenMesh\/Core\/Utils\/vector_cast.hh>\n#include <OpenMesh\/Core\/Utils\/Property.hh>\n\/\/ -------------------- STL\n#include <vector>\n#include <queue>\n#if defined(OM_CC_MIPS)\n#  include <math.h>\n#else\n#  include <cmath>\n#endif\n\n\n\/\/== NAMESPACE ================================================================\n\nnamespace OpenMesh   { \/\/ BEGIN_NS_OPENMESH\nnamespace Subdivider { \/\/ BEGIN_NS_DECIMATER\nnamespace Uniform    { \/\/ BEGIN_NS_UNIFORM\n\n\n\/\/== CLASS DEFINITION =========================================================\n\ntemplate <typename MeshType, typename RealType = float>\nclass CompareLengthFunction {\n    public:\n\n    bool operator()( const std::pair< typename MeshType::EdgeHandle, RealType >& t1, const std::pair< typename MeshType::EdgeHandle, RealType >& t2) \/\/ Returns true if t1 is earlier than t2\n    {\n       if (t1.second < t2.second)\n         return true;\n       else\n         return false;\n    }\n};\n\n\n\/** %Uniform LongestEdgeT subdivision algorithm\n *\n * Very simple algorithm splitting all edges which are longer than given via\n * set_max_edge_length(). The split is always performed on the longest\n * edge in the mesh.\n *\/\ntemplate <typename MeshType, typename RealType = float>\nclass LongestEdgeT : public SubdividerT<MeshType, RealType>\n{\npublic:\n\n  typedef RealType                                real_t;\n  typedef MeshType                                mesh_t;\n  typedef SubdividerT< mesh_t, real_t >           parent_t;\n\n  typedef std::vector< std::vector<real_t> >      weights_t;\n  typedef std::vector<real_t>                     weight_t;\n\npublic:\n\n\n  LongestEdgeT() : parent_t()\n  {  }\n\n\n  LongestEdgeT( mesh_t& _m) : parent_t(_m)\n  {  }\n\n\n  ~LongestEdgeT() {}\n\n\npublic:\n\n\n  const char *name() const { return \"Longest Edge Split\"; }\n\n  void set_max_edge_length(double _value) {\n    max_edge_length_squared_ = _value * _value;\n  }\n\nprotected:\n\n\n  bool prepare( mesh_t& _m )\n  {\n    return true;\n  }\n\n\n  bool cleanup( mesh_t& _m )\n  {\n    return true;\n  }\n\n\n  bool subdivide( MeshType& _m, size_t _n , const bool _update_points = true)\n  {\n\n    typedef std::pair< typename mesh_t::EdgeHandle, real_t > queueElement;\n    \/\/ Sorted queue containing all edges sorted by their decreasing length\n    std::priority_queue< queueElement, std::vector< queueElement > , CompareLengthFunction< typename mesh_t::EdgeHandle, real_t > > queue;\n\n    \/\/ Build the initial queue\n    \/\/ First element should be longest edge\n    typename mesh_t::EdgeIter edgesEnd = _m.edges_end();\n    for ( typename mesh_t::EdgeIter eit  = _m.edges_begin(); eit != edgesEnd; ++eit) {\n      const typename MeshType::Point to   = _m.point(_m.to_vertex_handle(_m.halfedge_handle(eit,0)));\n      const typename MeshType::Point from = _m.point(_m.from_vertex_handle(_m.halfedge_handle(eit,0)));\n\n      real_t length = (to - from).sqrnorm();\n\n      \/\/ Only push the edges that need to be split\n      if ( length > max_edge_length_squared_ )\n        queue.push( queueElement(eit.handle(),length) );\n    }\n\n    bool stop = false;\n    while ( !stop && ! queue.empty() ) {\n      queueElement a = queue.top();\n      queue.pop();\n\n      if ( a.second < max_edge_length_squared_ ) {\n        stop = true;\n        break;\n      } else {\n        const typename MeshType::Point to   = _m.point(_m.to_vertex_handle(_m.halfedge_handle(a.first,0)));\n        const typename MeshType::Point from = _m.point(_m.from_vertex_handle(_m.halfedge_handle(a.first,0)));\n        const typename MeshType::Point midpoint = 0.5 * ( to + from );\n\n        const typename MeshType::VertexHandle newVertex = _m.add_vertex(midpoint);\n        _m.split(a.first,newVertex);\n\n        for ( typename MeshType::VertexOHalfedgeIter voh_it(_m,newVertex); voh_it; ++voh_it) {\n          typename MeshType::EdgeHandle eh = _m.edge_handle(voh_it.handle());\n          const typename MeshType::Point to   = _m.point(_m.to_vertex_handle(voh_it));\n          const typename MeshType::Point from = _m.point(_m.from_vertex_handle(voh_it));\n          real_t length = (to - from).sqrnorm();\n\n          \/\/ Only push the edges that need to be split\n          if ( length > max_edge_length_squared_ )\n            queue.push( queueElement(eh,length) );\n\n        }\n      }\n    }\n\n#if defined(_DEBUG) || defined(DEBUG)\n      \/\/ Now we have an consistent mesh!\n      assert( OpenMesh::Utils::MeshCheckerT<mesh_t>(_m).check() );\n#endif\n\n\n    return true;\n  }\n\n\nprivate: \/\/ data\n  real_t max_edge_length_squared_;\n\n};\n\n} \/\/ END_NS_UNIFORM\n} \/\/ END_NS_SUBDIVIDER\n} \/\/ END_NS_OPENMESH\n#endif\n\n<commit_msg>Try to fix build error on windows<commit_after>\/*===========================================================================*\\\n*                                                                           *\n*                               OpenMesh                                    *\n*      Copyright (C) 2001-2011 by Computer Graphics Group, RWTH Aachen      *\n*                           www.openmesh.org                                *\n*                                                                           *\n*---------------------------------------------------------------------------* \n*  This file is part of OpenMesh.                                           *\n*                                                                           *\n*  OpenMesh is free software: you can redistribute it and\/or modify         * \n*  it under the terms of the GNU Lesser 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 with the              *\n*  following exceptions:                                                    *\n*                                                                           *\n*  If other files instantiate templates or use macros                       *\n*  or inline functions from this file, or you compile this file and         *\n*  link it with other files to produce an executable, this file does        *\n*  not by itself cause the resulting executable to be covered by the        *\n*  GNU Lesser General Public License. This exception does not however       *\n*  invalidate any other reasons why the executable file might be            *\n*  covered by the GNU Lesser General Public License.                        *\n*                                                                           *\n*  OpenMesh is distributed in the hope that it 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 LesserGeneral Public          *\n*  License along with OpenMesh.  If not,                                    *\n*  see <http:\/\/www.gnu.org\/licenses\/>.                                      *\n*                                                                           *\n\\*==========================================================================*\/ \n\n\/*==========================================================================*\\\n*                                                                           *             \n*   $Revision: 410 $                                                        *\n*   $Date: 2010-06-17 12:45:58 +0200 (Do, 17. Jun 2010) $                   *\n*                                                                           *\n\\*==========================================================================*\/\n\n\/** \\file LongestEdgeT.hh\n\n*\/\n\n\/\/=============================================================================\n\/\/\n\/\/  CLASS LongestEdgeT\n\/\/\n\/\/=============================================================================\n\n\n#ifndef LINEAR_H\n#define LINEAR_H\n\n#include <OpenMesh\/Tools\/Subdivider\/Uniform\/SubdividerT.hh>\n#include <OpenMesh\/Core\/Utils\/vector_cast.hh>\n#include <OpenMesh\/Core\/Utils\/Property.hh>\n\/\/ -------------------- STL\n#include <vector>\n#include <queue>\n#if defined(OM_CC_MIPS)\n#  include <math.h>\n#else\n#  include <cmath>\n#endif\n\n\n\/\/== NAMESPACE ================================================================\n\nnamespace OpenMesh   { \/\/ BEGIN_NS_OPENMESH\nnamespace Subdivider { \/\/ BEGIN_NS_DECIMATER\nnamespace Uniform    { \/\/ BEGIN_NS_UNIFORM\n\n\n\/\/== CLASS DEFINITION =========================================================\n\ntemplate <typename MeshType, typename RealType = float>\nclass CompareLengthFunction {\n  public:\n\n    typedef std::pair<typename MeshType::EdgeHandle, RealType> queueElement;\n\n    bool operator()(const queueElement& t1, const queueElement& t2) \/\/ Returns true if t1 is smaller than t2\n    {\n      return (t1.second < t2.second);\n    }\n};\n\n\n\/** %Uniform LongestEdgeT subdivision algorithm\n *\n * Very simple algorithm splitting all edges which are longer than given via\n * set_max_edge_length(). The split is always performed on the longest\n * edge in the mesh.\n *\/\ntemplate <typename MeshType, typename RealType = float>\nclass LongestEdgeT : public SubdividerT<MeshType, RealType>\n{\npublic:\n\n  typedef RealType                                real_t;\n  typedef MeshType                                mesh_t;\n  typedef SubdividerT< mesh_t, real_t >           parent_t;\n\n  typedef std::vector< std::vector<real_t> >      weights_t;\n  typedef std::vector<real_t>                     weight_t;\n\n  typedef std::pair< typename mesh_t::EdgeHandle, real_t > queueElement;\n\npublic:\n\n\n  LongestEdgeT() : parent_t()\n  {  }\n\n\n  LongestEdgeT( mesh_t& _m) : parent_t(_m)\n  {  }\n\n\n  ~LongestEdgeT() {}\n\n\npublic:\n\n\n  const char *name() const { return \"Longest Edge Split\"; }\n\n  void set_max_edge_length(double _value) {\n    max_edge_length_squared_ = _value * _value;\n  }\n\nprotected:\n\n\n  bool prepare( mesh_t& _m )\n  {\n    return true;\n  }\n\n\n  bool cleanup( mesh_t& _m )\n  {\n    return true;\n  }\n\n\n  bool subdivide( MeshType& _m, size_t _n , const bool _update_points = true)\n  {\n\n    \/\/ Sorted queue containing all edges sorted by their decreasing length\n    std::priority_queue< queueElement, std::vector< queueElement > , CompareLengthFunction< typename mesh_t::EdgeHandle, real_t > > queue;\n\n    \/\/ Build the initial queue\n    \/\/ First element should be longest edge\n    typename mesh_t::EdgeIter edgesEnd = _m.edges_end();\n    for ( typename mesh_t::EdgeIter eit  = _m.edges_begin(); eit != edgesEnd; ++eit) {\n      const typename MeshType::Point to   = _m.point(_m.to_vertex_handle(_m.halfedge_handle(eit,0)));\n      const typename MeshType::Point from = _m.point(_m.from_vertex_handle(_m.halfedge_handle(eit,0)));\n\n      real_t length = (to - from).sqrnorm();\n\n      \/\/ Only push the edges that need to be split\n      if ( length > max_edge_length_squared_ )\n        queue.push( queueElement(eit.handle(),length) );\n    }\n\n    bool stop = false;\n    while ( !stop && ! queue.empty() ) {\n      queueElement a = queue.top();\n      queue.pop();\n\n      if ( a.second < max_edge_length_squared_ ) {\n        stop = true;\n        break;\n      } else {\n        const typename MeshType::Point to   = _m.point(_m.to_vertex_handle(_m.halfedge_handle(a.first,0)));\n        const typename MeshType::Point from = _m.point(_m.from_vertex_handle(_m.halfedge_handle(a.first,0)));\n        const typename MeshType::Point midpoint = 0.5 * ( to + from );\n\n        const typename MeshType::VertexHandle newVertex = _m.add_vertex(midpoint);\n        _m.split(a.first,newVertex);\n\n        for ( typename MeshType::VertexOHalfedgeIter voh_it(_m,newVertex); voh_it; ++voh_it) {\n          typename MeshType::EdgeHandle eh = _m.edge_handle(voh_it.handle());\n          const typename MeshType::Point to   = _m.point(_m.to_vertex_handle(voh_it));\n          const typename MeshType::Point from = _m.point(_m.from_vertex_handle(voh_it));\n          real_t length = (to - from).sqrnorm();\n\n          \/\/ Only push the edges that need to be split\n          if ( length > max_edge_length_squared_ )\n            queue.push( queueElement(eh,length) );\n\n        }\n      }\n    }\n\n#if defined(_DEBUG) || defined(DEBUG)\n      \/\/ Now we have an consistent mesh!\n      assert( OpenMesh::Utils::MeshCheckerT<mesh_t>(_m).check() );\n#endif\n\n\n    return true;\n  }\n\n\nprivate: \/\/ data\n  real_t max_edge_length_squared_;\n\n};\n\n} \/\/ END_NS_UNIFORM\n} \/\/ END_NS_SUBDIVIDER\n} \/\/ END_NS_OPENMESH\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: MABTable.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 07:31:37 $\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_MAB_TABLE_HXX_\n#define _CONNECTIVITY_MAB_TABLE_HXX_\n\n#ifndef _CONNECTIVITY_FILE_TABLE_HXX_\n#include \"file\/FTable.hxx\"\n#endif\n#ifndef _DATE_HXX\n#include <tools\/date.hxx>\n#endif\n\n#include <mozaddressbook\/MABQuery.hxx>\n\n#ifdef DARREN_WORK\nnamespace com { namespace sun { namespace star { namespace sheet {\n    class XSpreadsheet;\n} } } }\n\nnamespace com { namespace sun { namespace star { namespace util {\n    class XNumberFormats;\n} } } }\n\n#endif \/* DARREN_WORK *\/\n\nnamespace connectivity\n{\n    namespace mozaddressbook\n    {\n        typedef file::OFileTable OMozabTable_BASE;\n        class OMozabConnection;\n\n        typedef ::std::map< ::rtl::OUString,\n                        ::com::sun::star::uno::Reference< ::com::sun::star::container::XNamed>,\n                        comphelper::UStringMixLess > OContainer;\n        static sal_Int32 const m_nNR_OF_FIELDS = 37;\n\n        class OMozabTable : public OMozabTable_BASE\n        {\n        private:\n            \/\/static sal_Int32 const m_nNR_OF_FIELDS = 37;\n            const OMozabColumnAlias & m_aColumnAlias;\n            OMozabQuery             *m_xQuery;\n            ::std::vector<sal_Int32> m_aTypes;      \/\/ holds all type for columns just to avoid to ask the propertyset\n            ::std::vector<sal_Int32> m_aPrecisions; \/\/ same as aboth\n            ::std::vector<sal_Int32> m_aScales;\n#ifdef DARREN_WORK\n            ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSpreadsheet > m_xSheet;\n            ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormats > m_xFormats;\n            ::Date m_aNullDate;\n#endif \/* DARREN_WORK *\/\n            ::std::vector< ::rtl::OUString> m_aAttributeStrings;\n\n            void fillColumns();\n\n            BOOL WriteBuffer();\n            BOOL UpdateBuffer(connectivity::OValueVector& rRow, connectivity::OValueRow pOrgRow,const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess>& _xCols);\n            ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet> isUniqueByColumnName(const ::rtl::OUString& _rColName);\n            OValueRow                               m_aParameterRow;\n\n            sal_Int32   sParamIndex;\n\n            inline void resetParameters()\n                          { sParamIndex = 0; }\n\n            void parseParameter( const OSQLParseNode* pNode, rtl::OUString& rMatchString );\n\n        protected:\n            virtual void FileClose();\n\n            \/\/ special ctor is needed for clone\n            OMozabTable(const OMozabTable* _pTable);\n        public:\n            virtual void refreshColumns();\n            virtual void refreshIndexes();\n\n        public:\n            \/\/  DECLARE_CTY_DEFAULTS( OMozabTable_BASE);\n            OMozabTable( sdbcx::OCollection* _pTables,OMozabConnection* _pConnection);\n            OMozabTable( sdbcx::OCollection* _pTables,OMozabConnection* _pConnection,\n                    const ::rtl::OUString& _Name,\n                    const ::rtl::OUString& _Type,\n                    const ::rtl::OUString& _Description = ::rtl::OUString(),\n                    const ::rtl::OUString& _SchemaName = ::rtl::OUString(),\n                    const ::rtl::OUString& _CatalogName = ::rtl::OUString()\n                );\n            ~OMozabTable( );\n\n            virtual sal_Int32 getCurrentLastPos() const;\n            virtual sal_Bool seekRow(IResultSetHelper::Movement eCursorPosition, sal_Int32 nOffset, sal_Int32& nCurPos);\n            virtual sal_Bool fetchRow(connectivity::OValueRow _rRow,const OSQLColumns& _rCols, sal_Bool _bUseTableDefs,sal_Bool bRetrieveData);\n\n            virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException);\n            \/\/XTypeProvider\n            virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes(  ) throw(::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL disposing(void);\n\n            \/\/ com::sun::star::lang::XUnoTunnel\n            virtual sal_Int64 SAL_CALL getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& aIdentifier ) throw(::com::sun::star::uno::RuntimeException);\n            static ::com::sun::star::uno::Sequence< sal_Int8 > getUnoTunnelImplementationId();\n\n            BOOL DropImpl();\n            BOOL CreateImpl();\n\n            virtual BOOL InsertRow(connectivity::OValueVector& rRow, BOOL bFlush,const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess>& _xCols);\n            virtual BOOL DeleteRow(const OSQLColumns& _rCols);\n            virtual BOOL UpdateRow(connectivity::OValueVector& rRow, connectivity::OValueRow pOrgRow,const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess>& _xCols);\n\n            void fillRowData( connectivity::OSQLParseTreeIterator& _aSQLIterator );\n\n            void analyseWhereClause( const OSQLParseNode*          parseTree,\n                            ::std::vector< ::rtl::OUString >       &matchItems,\n                            ::std::vector< OMozabQuery::eSqlOppr > &matchOper,\n                            ::std::vector< ::rtl::OUString >       &matchValues,\n                            connectivity::OSQLParseTreeIterator&   aSQLIterator);\n\n            \/\/ returns a copy of this object\n            OMozabTable* clone() const;\n            const OMozabColumnAlias & getColumnAlias() const\n                          { return (m_aColumnAlias); }\n\n            void setParameterRow(const OValueRow& _rParaRow)\n                          { m_aParameterRow = _rParaRow; }\n\n        };\n    }\n}\n\n#endif \/\/ _CONNECTIVITY_MAB_TABLE_HXX_\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.10.372); FILE MERGED 2008\/04\/01 15:09:16 thb 1.10.372.3: #i85898# Stripping all external header guards 2008\/04\/01 10:53:40 thb 1.10.372.2: #i85898# Stripping all external header guards 2008\/03\/28 15:24:32 rt 1.10.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: MABTable.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\n#ifndef _CONNECTIVITY_MAB_TABLE_HXX_\n#define _CONNECTIVITY_MAB_TABLE_HXX_\n\n#include \"file\/FTable.hxx\"\n#include <tools\/date.hxx>\n\n#include <mozaddressbook\/MABQuery.hxx>\n\n#ifdef DARREN_WORK\nnamespace com { namespace sun { namespace star { namespace sheet {\n    class XSpreadsheet;\n} } } }\n\nnamespace com { namespace sun { namespace star { namespace util {\n    class XNumberFormats;\n} } } }\n\n#endif \/* DARREN_WORK *\/\n\nnamespace connectivity\n{\n    namespace mozaddressbook\n    {\n        typedef file::OFileTable OMozabTable_BASE;\n        class OMozabConnection;\n\n        typedef ::std::map< ::rtl::OUString,\n                        ::com::sun::star::uno::Reference< ::com::sun::star::container::XNamed>,\n                        comphelper::UStringMixLess > OContainer;\n        static sal_Int32 const m_nNR_OF_FIELDS = 37;\n\n        class OMozabTable : public OMozabTable_BASE\n        {\n        private:\n            \/\/static sal_Int32 const m_nNR_OF_FIELDS = 37;\n            const OMozabColumnAlias & m_aColumnAlias;\n            OMozabQuery             *m_xQuery;\n            ::std::vector<sal_Int32> m_aTypes;      \/\/ holds all type for columns just to avoid to ask the propertyset\n            ::std::vector<sal_Int32> m_aPrecisions; \/\/ same as aboth\n            ::std::vector<sal_Int32> m_aScales;\n#ifdef DARREN_WORK\n            ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSpreadsheet > m_xSheet;\n            ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormats > m_xFormats;\n            ::Date m_aNullDate;\n#endif \/* DARREN_WORK *\/\n            ::std::vector< ::rtl::OUString> m_aAttributeStrings;\n\n            void fillColumns();\n\n            BOOL WriteBuffer();\n            BOOL UpdateBuffer(connectivity::OValueVector& rRow, connectivity::OValueRow pOrgRow,const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess>& _xCols);\n            ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet> isUniqueByColumnName(const ::rtl::OUString& _rColName);\n            OValueRow                               m_aParameterRow;\n\n            sal_Int32   sParamIndex;\n\n            inline void resetParameters()\n                          { sParamIndex = 0; }\n\n            void parseParameter( const OSQLParseNode* pNode, rtl::OUString& rMatchString );\n\n        protected:\n            virtual void FileClose();\n\n            \/\/ special ctor is needed for clone\n            OMozabTable(const OMozabTable* _pTable);\n        public:\n            virtual void refreshColumns();\n            virtual void refreshIndexes();\n\n        public:\n            \/\/  DECLARE_CTY_DEFAULTS( OMozabTable_BASE);\n            OMozabTable( sdbcx::OCollection* _pTables,OMozabConnection* _pConnection);\n            OMozabTable( sdbcx::OCollection* _pTables,OMozabConnection* _pConnection,\n                    const ::rtl::OUString& _Name,\n                    const ::rtl::OUString& _Type,\n                    const ::rtl::OUString& _Description = ::rtl::OUString(),\n                    const ::rtl::OUString& _SchemaName = ::rtl::OUString(),\n                    const ::rtl::OUString& _CatalogName = ::rtl::OUString()\n                );\n            ~OMozabTable( );\n\n            virtual sal_Int32 getCurrentLastPos() const;\n            virtual sal_Bool seekRow(IResultSetHelper::Movement eCursorPosition, sal_Int32 nOffset, sal_Int32& nCurPos);\n            virtual sal_Bool fetchRow(connectivity::OValueRow _rRow,const OSQLColumns& _rCols, sal_Bool _bUseTableDefs,sal_Bool bRetrieveData);\n\n            virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException);\n            \/\/XTypeProvider\n            virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes(  ) throw(::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL disposing(void);\n\n            \/\/ com::sun::star::lang::XUnoTunnel\n            virtual sal_Int64 SAL_CALL getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& aIdentifier ) throw(::com::sun::star::uno::RuntimeException);\n            static ::com::sun::star::uno::Sequence< sal_Int8 > getUnoTunnelImplementationId();\n\n            BOOL DropImpl();\n            BOOL CreateImpl();\n\n            virtual BOOL InsertRow(connectivity::OValueVector& rRow, BOOL bFlush,const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess>& _xCols);\n            virtual BOOL DeleteRow(const OSQLColumns& _rCols);\n            virtual BOOL UpdateRow(connectivity::OValueVector& rRow, connectivity::OValueRow pOrgRow,const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess>& _xCols);\n\n            void fillRowData( connectivity::OSQLParseTreeIterator& _aSQLIterator );\n\n            void analyseWhereClause( const OSQLParseNode*          parseTree,\n                            ::std::vector< ::rtl::OUString >       &matchItems,\n                            ::std::vector< OMozabQuery::eSqlOppr > &matchOper,\n                            ::std::vector< ::rtl::OUString >       &matchValues,\n                            connectivity::OSQLParseTreeIterator&   aSQLIterator);\n\n            \/\/ returns a copy of this object\n            OMozabTable* clone() const;\n            const OMozabColumnAlias & getColumnAlias() const\n                          { return (m_aColumnAlias); }\n\n            void setParameterRow(const OValueRow& _rParaRow)\n                          { m_aParameterRow = _rParaRow; }\n\n        };\n    }\n}\n\n#endif \/\/ _CONNECTIVITY_MAB_TABLE_HXX_\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\r\n * @file cmiss_optimisation_private.cpp\r\n *\r\n * The Cmiss_optimisation object.\r\n *\r\n * @see-also api\/zinc\/optimisation.h\r\n *\r\n *\/\r\n\/* ***** BEGIN LICENSE BLOCK *****\r\n * Version: MPL 1.1\/GPL 2.0\/LGPL 2.1\r\n *\r\n * The contents of this file are subject to the Mozilla Public License Version\r\n * 1.1 (the \"License\"); you may not use this file except in compliance with\r\n * the License. You may obtain a copy of the License at\r\n * http:\/\/www.mozilla.org\/MPL\/\r\n *\r\n * Software distributed under the License is distributed on an \"AS IS\" basis,\r\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\r\n * for the specific language governing rights and limitations under the\r\n * License.\r\n *\r\n * The Original Code is cmgui.\r\n *\r\n * The Initial Developer of the Original Code is\r\n * Auckland Uniservices Ltd, Auckland, New Zealand.\r\n * Portions created by the Initial Developer are Copyright (C) 2005\r\n * the Initial Developer. All Rights Reserved.\r\n *\r\n * Contributor(s):\r\n *\r\n * Alternatively, the contents of this file may be used under the terms of\r\n * either the GNU General Public License Version 2 or later (the \"GPL\"), or\r\n * the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\r\n * in which case the provisions of the GPL or the LGPL are applicable instead\r\n * of those above. If you wish to allow use of your version of this file only\r\n * under the terms of either the GPL or the LGPL, and not to allow others to\r\n * use your version of this file under the terms of the MPL, indicate your\r\n * decision by deleting the provisions above and replace them with the notice\r\n * and other provisions required by the GPL or the LGPL. If you do not delete\r\n * the provisions above, a recipient may use your version of this file under\r\n * the terms of any one of the MPL, the GPL or the LGPL.\r\n *\r\n * ***** END LICENSE BLOCK ***** *\/\r\n\r\n#include <cstdio>\r\n\t#include \"zinc\/field.h\"\r\n\t#include \"zinc\/region.h\"\r\n\t#include \"computed_field\/computed_field.h\"\r\n\t#include \"computed_field\/computed_field_composite.h\"\r\n\t#include \"computed_field\/computed_field_finite_element.h\"\r\n\t#include \"general\/mystring.h\"\r\n\t#include \"general\/debug.h\"\r\n#include \"general\/enumerator_conversion.hpp\"\r\n#include \"minimise\/cmiss_optimisation_private.hpp\"\r\n#include \"minimise\/optimisation.hpp\"\r\n\r\nchar *Cmiss_optimisation::getSolutionReport()\r\n{\r\n\tstd::string temp = solution_report.str();\r\n\treturn duplicate_string(temp.c_str());\r\n}\r\n\r\nint Cmiss_optimisation::runOptimisation()\r\n{\r\n\tint return_code = 1;\r\n\tsolution_report.str(\"\");\r\n\t\/\/ check required attributes are set\r\n\tif (method == CMISS_OPTIMISATION_METHOD_INVALID)\r\n\t{\r\n\t\tdisplay_message(ERROR_MESSAGE, \"Cmiss_optimisation_optimise.  Optimisation method invalid or not set.\");\r\n\t\treturn_code = 0;\r\n\t}\r\n\tif (independentFields.size() < 1)\r\n\t{\r\n\t\tdisplay_message(ERROR_MESSAGE, \"Cmiss_optimisation_optimise.  Must set at least one independent field.\");\r\n\t\treturn_code = 0;\r\n\t}\r\n\tif (objectiveFields.size() < 1)\r\n\t{\r\n\t\tdisplay_message(ERROR_MESSAGE, \"Cmiss_optimisation_optimise.  Must set at least one objective field.\");\r\n\t\treturn_code = 0;\r\n\t}\r\n\tif (return_code)\r\n\t{\r\n\t\tMinimisation minimisation(*this);\r\n\t\treturn_code = return_code && minimisation.prepareOptimisation();\r\n\t\treturn_code = return_code && minimisation.runOptimisation();\r\n\t}\r\n\treturn return_code;\r\n}\r\n\r\nCmiss_optimisation_id Cmiss_field_module_create_optimisation(Cmiss_field_module_id field_module)\r\n{\r\n\tif (field_module)\r\n\t\treturn new Cmiss_optimisation(field_module);\r\n\treturn 0;\r\n}\r\n\r\nCmiss_optimisation_id Cmiss_optimisation_access(Cmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\toptimisation->access();\r\n\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_destroy(Cmiss_optimisation_id *optimisation_address)\r\n{\r\n\tif (optimisation_address)\r\n\t\treturn Cmiss_optimisation::deaccess(*optimisation_address);\r\n\treturn 0;\r\n}\r\n\r\nenum Cmiss_optimisation_method Cmiss_optimisation_get_method(Cmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->method;\r\n\treturn CMISS_OPTIMISATION_METHOD_INVALID;\r\n}\r\n\r\nint Cmiss_optimisation_set_method(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_method method)\r\n{\r\n\tif (optimisation && (\r\n\t\t(method == CMISS_OPTIMISATION_METHOD_QUASI_NEWTON) ||\r\n\t\t(method == CMISS_OPTIMISATION_METHOD_LEAST_SQUARES_QUASI_NEWTON)))\r\n\t{\r\n\t\toptimisation->method = method;\r\n\t\treturn 1;\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nclass Cmiss_optimisation_method_conversion\r\n{\r\npublic:\r\n    static const char *to_string(enum Cmiss_optimisation_method method)\r\n    {\r\n    \tconst char *enum_string = 0;\r\n    \tswitch (method)\r\n    \t{\r\n    \t\tcase CMISS_OPTIMISATION_METHOD_QUASI_NEWTON:\r\n    \t\t\tenum_string = \"QUASI_NEWTON\";\r\n    \t\t\tbreak;\r\n    \t\tcase CMISS_OPTIMISATION_METHOD_LEAST_SQUARES_QUASI_NEWTON:\r\n    \t\t\tenum_string = \"LEAST_SQUARES_QUASI_NEWTON\";\r\n    \t\t\tbreak;\r\n    \t\tdefault:\r\n    \t\t\tbreak;\r\n    \t}\r\n    \treturn enum_string;\r\n    }\r\n};\r\n\r\nenum Cmiss_optimisation_method\r\n\tCmiss_optimisation_method_enum_from_string(const char *string)\r\n{\r\n\treturn string_to_enum<enum Cmiss_optimisation_method,\r\n\tCmiss_optimisation_method_conversion>(string);\r\n}\r\n\r\nchar *Cmiss_optimisation_method_enum_to_string(\r\n\tenum Cmiss_optimisation_method method)\r\n{\r\n\tconst char *method_string = Cmiss_optimisation_method_conversion::to_string(method);\r\n\treturn (method_string ? duplicate_string(method_string) : 0);\r\n}\r\n\r\nint Cmiss_optimisation_get_attribute_integer(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_attribute attribute)\r\n{\r\n\tif (optimisation)\r\n\t{\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_ITERATIONS:\r\n\t\t\treturn optimisation->maximumIterations;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_FUNCTION_EVALUATIONS:\r\n\t\t\treturn optimisation->maximumNumberFunctionEvaluations;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_BACKTRACK_ITERATIONS:\r\n\t\t\treturn optimisation->maximumBacktrackIterations;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_set_attribute_integer(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_attribute attribute, int value)\r\n{\r\n\tint return_code = 1;\r\n\tif (optimisation)\r\n\t{\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_ITERATIONS:\r\n\t\t\toptimisation->maximumIterations = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_FUNCTION_EVALUATIONS:\r\n\t\t\toptimisation->maximumNumberFunctionEvaluations = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_BACKTRACK_ITERATIONS:\r\n\t\t\toptimisation->maximumBacktrackIterations = value;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\treturn_code = 0;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\treturn return_code;\r\n}\r\n\r\ndouble Cmiss_optimisation_get_attribute_real(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_attribute attribute)\r\n{\r\n\tif (optimisation)\r\n\t{\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_FUNCTION_TOLERANCE:\r\n\t\t\treturn optimisation->functionTolerance;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_GRADIENT_TOLERANCE:\r\n\t\t\treturn optimisation->gradientTolerance;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_STEP_TOLERANCE:\r\n\t\t\treturn optimisation->stepTolerance;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_STEP:\r\n\t\t\treturn optimisation->maximumStep;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MINIMUM_STEP:\r\n\t\t\treturn optimisation->minimumStep;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_LINESEARCH_TOLERANCE:\r\n\t\t\treturn optimisation->linesearchTolerance;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_TRUST_REGION_SIZE:\r\n\t\t\treturn optimisation->trustRegionSize;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\treturn 0.0;\r\n}\r\n\r\nint Cmiss_optimisation_set_attribute_real(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_attribute attribute, double value)\r\n{\r\n\tint return_code = 1;\r\n\tif (optimisation)\r\n\t{\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_FUNCTION_TOLERANCE:\r\n\t\t\toptimisation->functionTolerance = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_GRADIENT_TOLERANCE:\r\n\t\t\toptimisation->gradientTolerance = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_STEP_TOLERANCE:\r\n\t\t\toptimisation->stepTolerance = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_STEP:\r\n\t\t\toptimisation->maximumStep = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MINIMUM_STEP:\r\n\t\t\toptimisation->minimumStep = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_LINESEARCH_TOLERANCE:\r\n\t\t\toptimisation->linesearchTolerance = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_TRUST_REGION_SIZE:\r\n\t\t\toptimisation->trustRegionSize = value;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\treturn_code = 0;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\treturn return_code;\r\n}\r\n\r\nclass Cmiss_optimisation_attribute_conversion\r\n{\r\npublic:\r\n    static const char *to_string(enum Cmiss_optimisation_attribute attribute)\r\n    {\r\n        const char *enum_string = 0;\r\n        switch (attribute)\r\n        {\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_FUNCTION_TOLERANCE:\r\n        \t\tenum_string = \"FUNCTION_TOLERANCE\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_GRADIENT_TOLERANCE:\r\n        \t\tenum_string = \"GRADIENT_TOLERANCE\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_STEP_TOLERANCE:\r\n        \t\tenum_string = \"STEP_TOLERANCE\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_ITERATIONS:\r\n        \t\tenum_string = \"MAXIMUM_ITERATIONS\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_FUNCTION_EVALUATIONS:\r\n        \t\tenum_string = \"MAXIMUM_FUNCTION_EVALUATIONS\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_STEP:\r\n        \t\tenum_string = \"MAXIMUM_STEP\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_MINIMUM_STEP:\r\n        \t\tenum_string = \"MINIMUM_STEP\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_LINESEARCH_TOLERANCE:\r\n        \t\tenum_string = \"LINESEARCH_TOLERANCE\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_BACKTRACK_ITERATIONS:\r\n        \t\tenum_string = \"MAXIMUM_BACKTRACK_ITERATIONS\";\r\n        \t\tbreak;\r\n        \tcase CMISS_OPTIMISATION_ATTRIBUTE_TRUST_REGION_SIZE:\r\n        \t\tenum_string = \"TRUST_REGION_SIZE\";\r\n        \t\tbreak;\r\n        \tdefault:\r\n        \t\tbreak;\r\n        }\r\n        return enum_string;\r\n    }\r\n};\r\n\r\nenum Cmiss_optimisation_attribute Cmiss_optimisation_attribute_enum_from_string(\r\n\tconst char *string)\r\n{\r\n\treturn string_to_enum<enum Cmiss_optimisation_attribute,\r\n\tCmiss_optimisation_attribute_conversion>(string);\r\n}\r\n\r\nchar *Cmiss_optimisation_attribute_enum_to_string(\r\n\tenum Cmiss_optimisation_attribute attribute)\r\n{\r\n\tconst char *attribute_string = Cmiss_optimisation_attribute_conversion::to_string(attribute);\r\n\treturn (attribute_string ? duplicate_string(attribute_string) : 0);\r\n}\r\n\r\nCmiss_field_id Cmiss_optimisation_get_first_independent_field(\r\n\tCmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->getFirstIndependentField();\r\n\treturn 0;\r\n}\r\n\r\nCmiss_field_id Cmiss_optimisation_get_next_independent_field(\r\n\tCmiss_optimisation_id optimisation, Cmiss_field_id ref_field)\r\n{\r\n\tif (optimisation && ref_field)\r\n\t\treturn optimisation->getNextIndependentField(ref_field);\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_add_independent_field(Cmiss_optimisation_id optimisation,\r\n\tCmiss_field_id field)\r\n{\r\n\tif (optimisation && field)\r\n\t\treturn optimisation->addIndependentField(field);\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_remove_independent_field(\r\n\tCmiss_optimisation_id optimisation, Cmiss_field_id field)\r\n{\r\n\tif (optimisation && field)\r\n\t\treturn optimisation->removeIndependentField(field);\r\n\treturn 0;\r\n}\r\n\r\nCmiss_field_id Cmiss_optimisation_get_first_objective_field(\r\n\tCmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->getFirstObjectiveField();\r\n\treturn 0;\r\n}\r\n\r\nCmiss_field_id Cmiss_optimisation_get_next_objective_field(\r\n\tCmiss_optimisation_id optimisation, Cmiss_field_id ref_field)\r\n{\r\n\tif (optimisation && ref_field)\r\n\t\treturn optimisation->getNextObjectiveField(ref_field);\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_add_objective_field(Cmiss_optimisation_id optimisation,\r\n\tCmiss_field_id field)\r\n{\r\n\tif (optimisation && field)\r\n\t\treturn optimisation->addObjectiveField(field);\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_remove_objective_field(\r\n\tCmiss_optimisation_id optimisation, Cmiss_field_id field)\r\n{\r\n\tif (optimisation && field)\r\n\t\treturn optimisation->removeObjectiveField(field);\r\n\treturn 0;\r\n}\r\n\r\nchar *Cmiss_optimisation_get_solution_report(Cmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->getSolutionReport();\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_optimise(Cmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->runOptimisation();\r\n\treturn 0;\r\n}\r\n<commit_msg>Fixing bug in accessing of optimisation object.  https:\/\/tracker.physiomeproject.org\/show_bug.cgi?id=3260<commit_after>\/**\r\n * @file cmiss_optimisation_private.cpp\r\n *\r\n * The Cmiss_optimisation object.\r\n *\r\n * @see-also api\/zinc\/optimisation.h\r\n *\r\n *\/\r\n\/* ***** BEGIN LICENSE BLOCK *****\r\n * Version: MPL 1.1\/GPL 2.0\/LGPL 2.1\r\n *\r\n * The contents of this file are subject to the Mozilla Public License Version\r\n * 1.1 (the \"License\"); you may not use this file except in compliance with\r\n * the License. You may obtain a copy of the License at\r\n * http:\/\/www.mozilla.org\/MPL\/\r\n *\r\n * Software distributed under the License is distributed on an \"AS IS\" basis,\r\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\r\n * for the specific language governing rights and limitations under the\r\n * License.\r\n *\r\n * The Original Code is cmgui.\r\n *\r\n * The Initial Developer of the Original Code is\r\n * Auckland Uniservices Ltd, Auckland, New Zealand.\r\n * Portions created by the Initial Developer are Copyright (C) 2005\r\n * the Initial Developer. All Rights Reserved.\r\n *\r\n * Contributor(s):\r\n *\r\n * Alternatively, the contents of this file may be used under the terms of\r\n * either the GNU General Public License Version 2 or later (the \"GPL\"), or\r\n * the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\r\n * in which case the provisions of the GPL or the LGPL are applicable instead\r\n * of those above. If you wish to allow use of your version of this file only\r\n * under the terms of either the GPL or the LGPL, and not to allow others to\r\n * use your version of this file under the terms of the MPL, indicate your\r\n * decision by deleting the provisions above and replace them with the notice\r\n * and other provisions required by the GPL or the LGPL. If you do not delete\r\n * the provisions above, a recipient may use your version of this file under\r\n * the terms of any one of the MPL, the GPL or the LGPL.\r\n *\r\n * ***** END LICENSE BLOCK ***** *\/\r\n\r\n#include <cstdio>\r\n\t#include \"zinc\/field.h\"\r\n\t#include \"zinc\/region.h\"\r\n\t#include \"computed_field\/computed_field.h\"\r\n\t#include \"computed_field\/computed_field_composite.h\"\r\n\t#include \"computed_field\/computed_field_finite_element.h\"\r\n\t#include \"general\/mystring.h\"\r\n\t#include \"general\/debug.h\"\r\n#include \"general\/enumerator_conversion.hpp\"\r\n#include \"minimise\/cmiss_optimisation_private.hpp\"\r\n#include \"minimise\/optimisation.hpp\"\r\n\r\nchar *Cmiss_optimisation::getSolutionReport()\r\n{\r\n\tstd::string temp = solution_report.str();\r\n\treturn duplicate_string(temp.c_str());\r\n}\r\n\r\nint Cmiss_optimisation::runOptimisation()\r\n{\r\n\tint return_code = 1;\r\n\tsolution_report.str(\"\");\r\n\t\/\/ check required attributes are set\r\n\tif (method == CMISS_OPTIMISATION_METHOD_INVALID)\r\n\t{\r\n\t\tdisplay_message(ERROR_MESSAGE, \"Cmiss_optimisation_optimise.  Optimisation method invalid or not set.\");\r\n\t\treturn_code = 0;\r\n\t}\r\n\tif (independentFields.size() < 1)\r\n\t{\r\n\t\tdisplay_message(ERROR_MESSAGE, \"Cmiss_optimisation_optimise.  Must set at least one independent field.\");\r\n\t\treturn_code = 0;\r\n\t}\r\n\tif (objectiveFields.size() < 1)\r\n\t{\r\n\t\tdisplay_message(ERROR_MESSAGE, \"Cmiss_optimisation_optimise.  Must set at least one objective field.\");\r\n\t\treturn_code = 0;\r\n\t}\r\n\tif (return_code)\r\n\t{\r\n\t\tMinimisation minimisation(*this);\r\n\t\treturn_code = return_code && minimisation.prepareOptimisation();\r\n\t\treturn_code = return_code && minimisation.runOptimisation();\r\n\t}\r\n\treturn return_code;\r\n}\r\n\r\nCmiss_optimisation_id Cmiss_field_module_create_optimisation(Cmiss_field_module_id field_module)\r\n{\r\n\tif (field_module)\r\n\t\treturn new Cmiss_optimisation(field_module);\r\n\treturn 0;\r\n}\r\n\r\nCmiss_optimisation_id Cmiss_optimisation_access(Cmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->access();\r\n\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_destroy(Cmiss_optimisation_id *optimisation_address)\r\n{\r\n\tif (optimisation_address)\r\n\t\treturn Cmiss_optimisation::deaccess(*optimisation_address);\r\n\treturn 0;\r\n}\r\n\r\nenum Cmiss_optimisation_method Cmiss_optimisation_get_method(Cmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->method;\r\n\treturn CMISS_OPTIMISATION_METHOD_INVALID;\r\n}\r\n\r\nint Cmiss_optimisation_set_method(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_method method)\r\n{\r\n\tif (optimisation && (\r\n\t\t(method == CMISS_OPTIMISATION_METHOD_QUASI_NEWTON) ||\r\n\t\t(method == CMISS_OPTIMISATION_METHOD_LEAST_SQUARES_QUASI_NEWTON)))\r\n\t{\r\n\t\toptimisation->method = method;\r\n\t\treturn 1;\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nclass Cmiss_optimisation_method_conversion\r\n{\r\npublic:\r\n\tstatic const char *to_string(enum Cmiss_optimisation_method method)\r\n\t{\r\n\t\tconst char *enum_string = 0;\r\n\t\tswitch (method)\r\n\t\t{\r\n\t\t\tcase CMISS_OPTIMISATION_METHOD_QUASI_NEWTON:\r\n\t\t\t\tenum_string = \"QUASI_NEWTON\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_METHOD_LEAST_SQUARES_QUASI_NEWTON:\r\n\t\t\t\tenum_string = \"LEAST_SQUARES_QUASI_NEWTON\";\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t\treturn enum_string;\r\n\t}\r\n};\r\n\r\nenum Cmiss_optimisation_method\r\n\tCmiss_optimisation_method_enum_from_string(const char *string)\r\n{\r\n\treturn string_to_enum<enum Cmiss_optimisation_method,\r\n\tCmiss_optimisation_method_conversion>(string);\r\n}\r\n\r\nchar *Cmiss_optimisation_method_enum_to_string(\r\n\tenum Cmiss_optimisation_method method)\r\n{\r\n\tconst char *method_string = Cmiss_optimisation_method_conversion::to_string(method);\r\n\treturn (method_string ? duplicate_string(method_string) : 0);\r\n}\r\n\r\nint Cmiss_optimisation_get_attribute_integer(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_attribute attribute)\r\n{\r\n\tif (optimisation)\r\n\t{\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_ITERATIONS:\r\n\t\t\treturn optimisation->maximumIterations;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_FUNCTION_EVALUATIONS:\r\n\t\t\treturn optimisation->maximumNumberFunctionEvaluations;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_BACKTRACK_ITERATIONS:\r\n\t\t\treturn optimisation->maximumBacktrackIterations;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_set_attribute_integer(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_attribute attribute, int value)\r\n{\r\n\tint return_code = 1;\r\n\tif (optimisation)\r\n\t{\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_ITERATIONS:\r\n\t\t\toptimisation->maximumIterations = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_FUNCTION_EVALUATIONS:\r\n\t\t\toptimisation->maximumNumberFunctionEvaluations = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_BACKTRACK_ITERATIONS:\r\n\t\t\toptimisation->maximumBacktrackIterations = value;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\treturn_code = 0;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\treturn return_code;\r\n}\r\n\r\ndouble Cmiss_optimisation_get_attribute_real(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_attribute attribute)\r\n{\r\n\tif (optimisation)\r\n\t{\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_FUNCTION_TOLERANCE:\r\n\t\t\treturn optimisation->functionTolerance;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_GRADIENT_TOLERANCE:\r\n\t\t\treturn optimisation->gradientTolerance;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_STEP_TOLERANCE:\r\n\t\t\treturn optimisation->stepTolerance;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_STEP:\r\n\t\t\treturn optimisation->maximumStep;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MINIMUM_STEP:\r\n\t\t\treturn optimisation->minimumStep;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_LINESEARCH_TOLERANCE:\r\n\t\t\treturn optimisation->linesearchTolerance;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_TRUST_REGION_SIZE:\r\n\t\t\treturn optimisation->trustRegionSize;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\treturn 0.0;\r\n}\r\n\r\nint Cmiss_optimisation_set_attribute_real(Cmiss_optimisation_id optimisation,\r\n\t\tenum Cmiss_optimisation_attribute attribute, double value)\r\n{\r\n\tint return_code = 1;\r\n\tif (optimisation)\r\n\t{\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_FUNCTION_TOLERANCE:\r\n\t\t\toptimisation->functionTolerance = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_GRADIENT_TOLERANCE:\r\n\t\t\toptimisation->gradientTolerance = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_STEP_TOLERANCE:\r\n\t\t\toptimisation->stepTolerance = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_STEP:\r\n\t\t\toptimisation->maximumStep = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MINIMUM_STEP:\r\n\t\t\toptimisation->minimumStep = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_LINESEARCH_TOLERANCE:\r\n\t\t\toptimisation->linesearchTolerance = value;\r\n\t\t\tbreak;\r\n\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_TRUST_REGION_SIZE:\r\n\t\t\toptimisation->trustRegionSize = value;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\treturn_code = 0;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\treturn return_code;\r\n}\r\n\r\nclass Cmiss_optimisation_attribute_conversion\r\n{\r\npublic:\r\n\tstatic const char *to_string(enum Cmiss_optimisation_attribute attribute)\r\n\t{\r\n\t\tconst char *enum_string = 0;\r\n\t\tswitch (attribute)\r\n\t\t{\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_FUNCTION_TOLERANCE:\r\n\t\t\t\tenum_string = \"FUNCTION_TOLERANCE\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_GRADIENT_TOLERANCE:\r\n\t\t\t\tenum_string = \"GRADIENT_TOLERANCE\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_STEP_TOLERANCE:\r\n\t\t\t\tenum_string = \"STEP_TOLERANCE\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_ITERATIONS:\r\n\t\t\t\tenum_string = \"MAXIMUM_ITERATIONS\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_FUNCTION_EVALUATIONS:\r\n\t\t\t\tenum_string = \"MAXIMUM_FUNCTION_EVALUATIONS\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_STEP:\r\n\t\t\t\tenum_string = \"MAXIMUM_STEP\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MINIMUM_STEP:\r\n\t\t\t\tenum_string = \"MINIMUM_STEP\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_LINESEARCH_TOLERANCE:\r\n\t\t\t\tenum_string = \"LINESEARCH_TOLERANCE\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_MAXIMUM_BACKTRACK_ITERATIONS:\r\n\t\t\t\tenum_string = \"MAXIMUM_BACKTRACK_ITERATIONS\";\r\n\t\t\t\tbreak;\r\n\t\t\tcase CMISS_OPTIMISATION_ATTRIBUTE_TRUST_REGION_SIZE:\r\n\t\t\t\tenum_string = \"TRUST_REGION_SIZE\";\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t\treturn enum_string;\r\n\t}\r\n};\r\n\r\nenum Cmiss_optimisation_attribute Cmiss_optimisation_attribute_enum_from_string(\r\n\tconst char *string)\r\n{\r\n\treturn string_to_enum<enum Cmiss_optimisation_attribute,\r\n\tCmiss_optimisation_attribute_conversion>(string);\r\n}\r\n\r\nchar *Cmiss_optimisation_attribute_enum_to_string(\r\n\tenum Cmiss_optimisation_attribute attribute)\r\n{\r\n\tconst char *attribute_string = Cmiss_optimisation_attribute_conversion::to_string(attribute);\r\n\treturn (attribute_string ? duplicate_string(attribute_string) : 0);\r\n}\r\n\r\nCmiss_field_id Cmiss_optimisation_get_first_independent_field(\r\n\tCmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->getFirstIndependentField();\r\n\treturn 0;\r\n}\r\n\r\nCmiss_field_id Cmiss_optimisation_get_next_independent_field(\r\n\tCmiss_optimisation_id optimisation, Cmiss_field_id ref_field)\r\n{\r\n\tif (optimisation && ref_field)\r\n\t\treturn optimisation->getNextIndependentField(ref_field);\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_add_independent_field(Cmiss_optimisation_id optimisation,\r\n\tCmiss_field_id field)\r\n{\r\n\tif (optimisation && field)\r\n\t\treturn optimisation->addIndependentField(field);\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_remove_independent_field(\r\n\tCmiss_optimisation_id optimisation, Cmiss_field_id field)\r\n{\r\n\tif (optimisation && field)\r\n\t\treturn optimisation->removeIndependentField(field);\r\n\treturn 0;\r\n}\r\n\r\nCmiss_field_id Cmiss_optimisation_get_first_objective_field(\r\n\tCmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->getFirstObjectiveField();\r\n\treturn 0;\r\n}\r\n\r\nCmiss_field_id Cmiss_optimisation_get_next_objective_field(\r\n\tCmiss_optimisation_id optimisation, Cmiss_field_id ref_field)\r\n{\r\n\tif (optimisation && ref_field)\r\n\t\treturn optimisation->getNextObjectiveField(ref_field);\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_add_objective_field(Cmiss_optimisation_id optimisation,\r\n\tCmiss_field_id field)\r\n{\r\n\tif (optimisation && field)\r\n\t\treturn optimisation->addObjectiveField(field);\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_remove_objective_field(\r\n\tCmiss_optimisation_id optimisation, Cmiss_field_id field)\r\n{\r\n\tif (optimisation && field)\r\n\t\treturn optimisation->removeObjectiveField(field);\r\n\treturn 0;\r\n}\r\n\r\nchar *Cmiss_optimisation_get_solution_report(Cmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->getSolutionReport();\r\n\treturn 0;\r\n}\r\n\r\nint Cmiss_optimisation_optimise(Cmiss_optimisation_id optimisation)\r\n{\r\n\tif (optimisation)\r\n\t\treturn optimisation->runOptimisation();\r\n\treturn 0;\r\n}\r\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 <gtest\/gtest.h>\n\n#include \"arrow\/chunked_array.h\"\n#include \"arrow\/compute\/api.h\"\n#include \"arrow\/compute\/kernels\/test_util.h\"\n#include \"arrow\/result.h\"\n#include \"arrow\/testing\/gtest_util.h\"\n#include \"arrow\/util\/checked_cast.h\"\n\nnamespace arrow {\nnamespace compute {\n\nusing arrow::internal::checked_cast;\n\nTEST(TestVectorNested, ListFlatten) {\n  for (auto ty : {list(int16()), large_list(int16())}) {\n    auto input = ArrayFromJSON(ty, \"[[0, null, 1], null, [2, 3], []]\");\n    auto expected = ArrayFromJSON(int16(), \"[0, null, 1, 2, 3]\");\n    CheckVectorUnary(\"list_flatten\", input, expected);\n\n    \/\/ Construct a list with a non-empty null slot\n    TweakValidityBit(input, 0, false);\n    expected = ArrayFromJSON(int16(), \"[2, 3]\");\n    CheckVectorUnary(\"list_flatten\", input, expected);\n  }\n}\n\nTEST(TestVectorNested, ListFlattenChunkedArray) {\n  for (auto ty : {list(int16()), large_list(int16())}) {\n    auto input = ChunkedArrayFromJSON(ty, {\"[[0, null, 1], null]\", \"[[2, 3], []]\"});\n    auto expected = ChunkedArrayFromJSON(int16(), {\"[0, null, 1]\", \"[2, 3]\"});\n    CheckVectorUnary(\"list_flatten\", input, expected);\n\n    input = ChunkedArrayFromJSON(ty, {});\n    expected = ChunkedArrayFromJSON(int16(), {});\n    CheckVectorUnary(\"list_flatten\", input, expected);\n  }\n}\n\nTEST(TestVectorNested, ListFlattenFixedSizeList) {\n  for (auto ty : {fixed_size_list(int16(), 2), fixed_size_list(uint32(), 2)}) {\n    const auto& out_ty = checked_cast<const FixedSizeListType&>(*ty).value_type();\n    {\n      auto input = ArrayFromJSON(ty, \"[[0, null], null, [2, 3], [0, 42]]\");\n      auto expected = ArrayFromJSON(out_ty, \"[0, null, 2, 3, 0, 42]\");\n      CheckVectorUnary(\"list_flatten\", input, expected);\n    }\n\n    {\n      \/\/ Test a chunked array\n      auto input = ChunkedArrayFromJSON(ty, {\"[[0, null], null]\", \"[[2, 3], [0, 42]]\"});\n      auto expected = ChunkedArrayFromJSON(out_ty, {\"[0, null]\", \"[2, 3, 0, 42]\"});\n      CheckVectorUnary(\"list_flatten\", input, expected);\n\n      input = ChunkedArrayFromJSON(ty, {});\n      expected = ChunkedArrayFromJSON(out_ty, {});\n      CheckVectorUnary(\"list_flatten\", input, expected);\n    }\n  }\n}\n\nTEST(TestVectorNested, ListParentIndices) {\n  for (auto ty : {list(int16()), large_list(int16())}) {\n    auto input = ArrayFromJSON(ty, \"[[0, null, 1], null, [2, 3], [], [4, 5]]\");\n\n    auto expected = ArrayFromJSON(int64(), \"[0, 0, 0, 2, 2, 4, 4]\");\n    CheckVectorUnary(\"list_parent_indices\", input, expected);\n  }\n\n  \/\/ Construct a list with a non-empty null slot\n  auto input = ArrayFromJSON(list(int16()), \"[[0, null, 1], [0, 0], [2, 3], [], [4, 5]]\");\n  TweakValidityBit(input, 1, false);\n  auto expected = ArrayFromJSON(int64(), \"[0, 0, 0, 1, 1, 2, 2, 4, 4]\");\n  CheckVectorUnary(\"list_parent_indices\", input, expected);\n}\n\nTEST(TestVectorNested, ListParentIndicesChunkedArray) {\n  for (auto ty : {list(int16()), large_list(int16())}) {\n    auto input =\n        ChunkedArrayFromJSON(ty, {\"[[0, null, 1], null]\", \"[[2, 3], [], [4, 5]]\"});\n\n    auto expected = ChunkedArrayFromJSON(int64(), {\"[0, 0, 0]\", \"[2, 2, 4, 4]\"});\n    CheckVectorUnary(\"list_parent_indices\", input, expected);\n\n    input = ChunkedArrayFromJSON(ty, {});\n    expected = ChunkedArrayFromJSON(int64(), {});\n    CheckVectorUnary(\"list_parent_indices\", input, expected);\n  }\n}\n\nTEST(TestVectorNested, ListParentIndicesFixedSizeList) {\n  for (auto ty : {fixed_size_list(int16(), 2), fixed_size_list(uint32(), 2)}) {\n    {\n      auto input = ArrayFromJSON(ty, \"[[0, null], null, [1, 2], [3, 4], [null, 5]]\");\n      auto expected = ArrayFromJSON(int64(), \"[0, 0, 2, 2, 3, 3, 4, 4]\");\n      CheckVectorUnary(\"list_parent_indices\", input, expected);\n    }\n    {\n      \/\/ Test a chunked array\n      auto input =\n          ChunkedArrayFromJSON(ty, {\"[[0, null], null, [1, 2]]\", \"[[3, 4], [null, 5]]\"});\n      auto expected = ChunkedArrayFromJSON(int64(), {\"[0, 0, 2, 2]\", \"[3, 3, 4, 4]\"});\n      CheckVectorUnary(\"list_parent_indices\", input, expected);\n\n      input = ChunkedArrayFromJSON(ty, {});\n      expected = ChunkedArrayFromJSON(int64(), {});\n      CheckVectorUnary(\"list_parent_indices\", input, expected);\n    }\n  }\n}\n\n}  \/\/ namespace compute\n}  \/\/ namespace arrow\n<commit_msg>MINOR: [C++] Use the array returned by TweakValidityBit (#14221)<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 <gtest\/gtest.h>\n\n#include \"arrow\/chunked_array.h\"\n#include \"arrow\/compute\/api.h\"\n#include \"arrow\/compute\/kernels\/test_util.h\"\n#include \"arrow\/result.h\"\n#include \"arrow\/testing\/gtest_util.h\"\n#include \"arrow\/util\/checked_cast.h\"\n\nnamespace arrow {\nnamespace compute {\n\nusing arrow::internal::checked_cast;\n\nTEST(TestVectorNested, ListFlatten) {\n  for (auto ty : {list(int16()), large_list(int16())}) {\n    auto input = ArrayFromJSON(ty, \"[[0, null, 1], null, [2, 3], []]\");\n    auto expected = ArrayFromJSON(int16(), \"[0, null, 1, 2, 3]\");\n    CheckVectorUnary(\"list_flatten\", input, expected);\n\n    \/\/ Construct a list with a non-empty null slot\n    auto tweaked = TweakValidityBit(input, 0, false);\n    expected = ArrayFromJSON(int16(), \"[2, 3]\");\n    CheckVectorUnary(\"list_flatten\", tweaked, expected);\n  }\n}\n\nTEST(TestVectorNested, ListFlattenChunkedArray) {\n  for (auto ty : {list(int16()), large_list(int16())}) {\n    auto input = ChunkedArrayFromJSON(ty, {\"[[0, null, 1], null]\", \"[[2, 3], []]\"});\n    auto expected = ChunkedArrayFromJSON(int16(), {\"[0, null, 1]\", \"[2, 3]\"});\n    CheckVectorUnary(\"list_flatten\", input, expected);\n\n    input = ChunkedArrayFromJSON(ty, {});\n    expected = ChunkedArrayFromJSON(int16(), {});\n    CheckVectorUnary(\"list_flatten\", input, expected);\n  }\n}\n\nTEST(TestVectorNested, ListFlattenFixedSizeList) {\n  for (auto ty : {fixed_size_list(int16(), 2), fixed_size_list(uint32(), 2)}) {\n    const auto& out_ty = checked_cast<const FixedSizeListType&>(*ty).value_type();\n    {\n      auto input = ArrayFromJSON(ty, \"[[0, null], null, [2, 3], [0, 42]]\");\n      auto expected = ArrayFromJSON(out_ty, \"[0, null, 2, 3, 0, 42]\");\n      CheckVectorUnary(\"list_flatten\", input, expected);\n    }\n\n    {\n      \/\/ Test a chunked array\n      auto input = ChunkedArrayFromJSON(ty, {\"[[0, null], null]\", \"[[2, 3], [0, 42]]\"});\n      auto expected = ChunkedArrayFromJSON(out_ty, {\"[0, null]\", \"[2, 3, 0, 42]\"});\n      CheckVectorUnary(\"list_flatten\", input, expected);\n\n      input = ChunkedArrayFromJSON(ty, {});\n      expected = ChunkedArrayFromJSON(out_ty, {});\n      CheckVectorUnary(\"list_flatten\", input, expected);\n    }\n  }\n}\n\nTEST(TestVectorNested, ListParentIndices) {\n  for (auto ty : {list(int16()), large_list(int16())}) {\n    auto input = ArrayFromJSON(ty, \"[[0, null, 1], null, [2, 3], [], [4, 5]]\");\n\n    auto expected = ArrayFromJSON(int64(), \"[0, 0, 0, 2, 2, 4, 4]\");\n    CheckVectorUnary(\"list_parent_indices\", input, expected);\n  }\n\n  \/\/ Construct a list with a non-empty null slot\n  auto input = ArrayFromJSON(list(int16()), \"[[0, null, 1], [0, 0], [2, 3], [], [4, 5]]\");\n  auto tweaked = TweakValidityBit(input, 1, false);\n  auto expected = ArrayFromJSON(int64(), \"[0, 0, 0, 1, 1, 2, 2, 4, 4]\");\n  CheckVectorUnary(\"list_parent_indices\", tweaked, expected);\n}\n\nTEST(TestVectorNested, ListParentIndicesChunkedArray) {\n  for (auto ty : {list(int16()), large_list(int16())}) {\n    auto input =\n        ChunkedArrayFromJSON(ty, {\"[[0, null, 1], null]\", \"[[2, 3], [], [4, 5]]\"});\n\n    auto expected = ChunkedArrayFromJSON(int64(), {\"[0, 0, 0]\", \"[2, 2, 4, 4]\"});\n    CheckVectorUnary(\"list_parent_indices\", input, expected);\n\n    input = ChunkedArrayFromJSON(ty, {});\n    expected = ChunkedArrayFromJSON(int64(), {});\n    CheckVectorUnary(\"list_parent_indices\", input, expected);\n  }\n}\n\nTEST(TestVectorNested, ListParentIndicesFixedSizeList) {\n  for (auto ty : {fixed_size_list(int16(), 2), fixed_size_list(uint32(), 2)}) {\n    {\n      auto input = ArrayFromJSON(ty, \"[[0, null], null, [1, 2], [3, 4], [null, 5]]\");\n      auto expected = ArrayFromJSON(int64(), \"[0, 0, 2, 2, 3, 3, 4, 4]\");\n      CheckVectorUnary(\"list_parent_indices\", input, expected);\n    }\n    {\n      \/\/ Test a chunked array\n      auto input =\n          ChunkedArrayFromJSON(ty, {\"[[0, null], null, [1, 2]]\", \"[[3, 4], [null, 5]]\"});\n      auto expected = ChunkedArrayFromJSON(int64(), {\"[0, 0, 2, 2]\", \"[3, 3, 4, 4]\"});\n      CheckVectorUnary(\"list_parent_indices\", input, expected);\n\n      input = ChunkedArrayFromJSON(ty, {});\n      expected = ChunkedArrayFromJSON(int64(), {});\n      CheckVectorUnary(\"list_parent_indices\", input, expected);\n    }\n  }\n}\n\n}  \/\/ namespace compute\n}  \/\/ namespace arrow\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************\n*\n* Copyright 2014 Samsung Electronics All Rights Reserved.\n*\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 implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n******************************************************************\/\n#include \"SSMInterface\/SSMCore.h\"\n#include \"SSMInterface\/SoftSensorManager.h\"\n#include \"Common\/InternalInterface.h\"\n\nstatic ISoftSensorManager       *g_pSoftSensorManager = NULL;\n\nSSMRESULT CreateQueryEngine(IQueryEngine **ppQueryEngine)\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->createQueryEngine(ppQueryEngine));\n\nCLEANUP:\n    return res;\n}\n\nunsigned long ReleaseQueryEngine(IQueryEngine *pQueryEngine)\n{\n    if (pQueryEngine == NULL)\n    {\n        return -1;\n    }\n\n    if (g_pSoftSensorManager == NULL)\n    {\n        return -1;\n    }\n\n    return g_pSoftSensorManager->releaseQueryEngine(pQueryEngine);\n}\n\nSSMRESULT InitializeSSMCore(std::string xmlDescription)\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    if (g_pSoftSensorManager != NULL)\n        SSM_CLEANUP_ASSERT(SSM_E_INITIALIZED);\n\n    SSM_CLEANUP_ASSERT(CreateGlobalInstanceRepo());\n    SSM_CLEANUP_ASSERT(CreateInstance(OID_ISoftSensorManager, (IBase **)&g_pSoftSensorManager));\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->initializeCore(xmlDescription));\n\nCLEANUP:\n    if (res != SSM_S_OK &&\n        res != SSM_E_INITIALIZED)\n    {\n        SAFE_RELEASE(g_pSoftSensorManager);\n    }\n    return res;\n}\n\nSSMRESULT StartSSMCore()\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->startCore());\n\nCLEANUP:\n    return res;\n}\n\nSSMRESULT StopSSMCore()\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->stopCore());\n\nCLEANUP:\n    return res;\n}\n\nSSMRESULT TerminateSSMCore(bool factoryResetFlag)\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->terminateCore(factoryResetFlag));\n\nCLEANUP:\n    SAFE_RELEASE(g_pSoftSensorManager);\n    DestroyGlobalInstanceRepo();\n    return res;\n}\n\nconst char *GetSSMError(SSMRESULT res)\n{\n    const char *msg = NULL;\n\n    switch (res)\n    {\n        case SSM_S_OK:\n            msg = \"Success\";\n            break;\n\n        case SSM_E_POINTER:\n            msg = \"SSM_E_POINTER\";\n            break;\n\n        case SSM_E_OUTOFMEMORY:\n            msg = \"SSM_E_OUTOFMEMORY\";\n            break;\n\n        case SSM_E_FAIL:\n            msg = \"SSM_E_FAIL\";\n            break;\n\n        case SSM_E_NOTINIT:\n            msg = \"SSM_E_NOTINIT\";\n            break;\n\n        case SSM_E_INITIALIZED:\n            msg = \"SSM_E_INITIALIZED\";\n            break;\n\n        case SSM_E_INVALIDXML:\n            msg = \"SSM_E_INVALIDXML\";\n            break;\n\n        case SSM_E_NOINTERFACE:\n            msg = \"SSM_E_NOINTERFACE\";\n            break;\n\n        case SSM_E_NOTIMPL:\n            msg = \"SSM_E_NOTIMPL\";\n            break;\n\n        default:\n            msg = \"Not defined\";\n            break;\n    }\n\n    return msg;\n}\n\nSSMRESULT GetInstalledModelList(std::vector<ISSMResource *> *pList)\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    g_pSoftSensorManager->getInstalledModelList(pList);\n\nCLEANUP:\n    return res;\n}\n<commit_msg>Fix IOT-504 issue of soft sensor manager<commit_after>\/******************************************************************\n*\n* Copyright 2014 Samsung Electronics All Rights Reserved.\n*\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 implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n******************************************************************\/\n#include \"SSMInterface\/SSMCore.h\"\n#include \"SSMInterface\/SoftSensorManager.h\"\n#include \"Common\/InternalInterface.h\"\n\nstatic ISoftSensorManager       *g_pSoftSensorManager = NULL;\n\nSSMRESULT CreateQueryEngine(IQueryEngine **ppQueryEngine)\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->createQueryEngine(ppQueryEngine));\n\nCLEANUP:\n    return res;\n}\n\nunsigned long ReleaseQueryEngine(IQueryEngine *pQueryEngine)\n{\n    if (pQueryEngine == NULL)\n    {\n        return -1;\n    }\n\n    if (g_pSoftSensorManager == NULL)\n    {\n        return -1;\n    }\n\n    return g_pSoftSensorManager->releaseQueryEngine(pQueryEngine);\n}\n\nSSMRESULT InitializeSSMCore(std::string xmlDescription)\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    if (g_pSoftSensorManager != NULL)\n        SSM_CLEANUP_ASSERT(SSM_E_INITIALIZED);\n\n    SSM_CLEANUP_ASSERT(CreateGlobalInstanceRepo());\n    SSM_CLEANUP_ASSERT(CreateInstance(OID_ISoftSensorManager, (IBase **)&g_pSoftSensorManager));\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->initializeCore(xmlDescription));\n\nCLEANUP:\n    if (res != SSM_S_OK &&\n        res != SSM_E_INITIALIZED)\n    {\n        SAFE_RELEASE(g_pSoftSensorManager);\n        DestroyGlobalInstanceRepo();\n    }\n\n    return res;\n}\n\nSSMRESULT StartSSMCore()\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->startCore());\n\nCLEANUP:\n    return res;\n}\n\nSSMRESULT StopSSMCore()\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->stopCore());\n\nCLEANUP:\n    return res;\n}\n\nSSMRESULT TerminateSSMCore(bool factoryResetFlag)\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    SSM_CLEANUP_ASSERT(g_pSoftSensorManager->terminateCore(factoryResetFlag));\n\nCLEANUP:\n    SAFE_RELEASE(g_pSoftSensorManager);\n    DestroyGlobalInstanceRepo();\n    return res;\n}\n\nconst char *GetSSMError(SSMRESULT res)\n{\n    const char *msg = NULL;\n\n    switch (res)\n    {\n        case SSM_S_OK:\n            msg = \"Success\";\n            break;\n\n        case SSM_E_POINTER:\n            msg = \"SSM_E_POINTER\";\n            break;\n\n        case SSM_E_OUTOFMEMORY:\n            msg = \"SSM_E_OUTOFMEMORY\";\n            break;\n\n        case SSM_E_FAIL:\n            msg = \"SSM_E_FAIL\";\n            break;\n\n        case SSM_E_NOTINIT:\n            msg = \"SSM_E_NOTINIT\";\n            break;\n\n        case SSM_E_INITIALIZED:\n            msg = \"SSM_E_INITIALIZED\";\n            break;\n\n        case SSM_E_INVALIDXML:\n            msg = \"SSM_E_INVALIDXML\";\n            break;\n\n        case SSM_E_NOINTERFACE:\n            msg = \"SSM_E_NOINTERFACE\";\n            break;\n\n        case SSM_E_NOTIMPL:\n            msg = \"SSM_E_NOTIMPL\";\n            break;\n\n        default:\n            msg = \"Not defined\";\n            break;\n    }\n\n    return msg;\n}\n\nSSMRESULT GetInstalledModelList(std::vector<ISSMResource *> *pList)\n{\n    SSMRESULT res = SSM_E_FAIL;\n\n    SSM_CLEANUP_NULL_ASSERT(g_pSoftSensorManager);\n    g_pSoftSensorManager->getInstalledModelList(pList);\n\nCLEANUP:\n    return res;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_PRIM_PROB_NORMAL_SUFFICIENT_LPDF_HPP\n#define STAN_MATH_PRIM_PROB_NORMAL_SUFFICIENT_LPDF_HPP\n\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/constants.hpp>\n#include <stan\/math\/prim\/fun\/log.hpp>\n#include <stan\/math\/prim\/fun\/max_size.hpp>\n#include <stan\/math\/prim\/fun\/promote_scalar.hpp>\n#include <stan\/math\/prim\/fun\/size.hpp>\n#include <stan\/math\/prim\/fun\/size_zero.hpp>\n#include <stan\/math\/prim\/fun\/to_ref.hpp>\n#include <stan\/math\/prim\/fun\/value_of.hpp>\n#include <stan\/math\/prim\/prob\/normal_lpdf.hpp>\n#include <stan\/math\/prim\/functor\/operands_and_partials.hpp>\n#include <cmath>\n\nnamespace stan {\nnamespace math {\n\n\/** \\ingroup prob_dists\n * The log of the normal density for the specified scalar(s) given\n * the specified mean(s) and deviation(s).\n * y, s_squared, mu, or sigma can each be either\n * a scalar, a std vector or Eigen vector.\n * n can be either a single int or an std vector of ints.\n * Any vector inputs must be the same length.\n *\n * <p>The result log probability is defined to be the sum of the\n * log probabilities for each observation\/mean\/deviation triple.\n *\n * @tparam T_y type of sample average parameter\n * @tparam T_s type of sample squared errors parameter\n * @tparam T_n type of sample size parameter\n * @tparam T_loc type of location parameter\n * @tparam T_scale type of scale parameter\n *\n * @param y_bar (Sequence of) scalar(s) (sample average(s)).\n * @param s_squared (Sequence of) sum(s) of sample squared errors\n * @param n_obs (Sequence of) sample size(s)\n * @param mu (Sequence of) location parameter(s)\n * for the normal distribution.\n * @param sigma (Sequence of) scale parameters for the normal\n * distribution.\n * @return The log of the product of the densities.\n * @throw std::domain_error if either n or sigma are not positive,\n * if s_squared is negative or if any parameter is not finite.\n *\/\ntemplate <bool propto, typename T_y, typename T_s, typename T_n, typename T_loc,\n          typename T_scale>\nreturn_type_t<T_y, T_s, T_loc, T_scale> normal_sufficient_lpdf(\n    const T_y& y_bar, const T_s& s_squared, const T_n& n_obs, const T_loc& mu,\n    const T_scale& sigma) {\n  using T_partials_return = partials_return_t<T_y, T_s, T_n, T_loc, T_scale>;\n  using T_y_ref = ref_type_if_t<!is_constant<T_y>::value, T_y>;\n  using T_s_ref = ref_type_if_t<!is_constant<T_s>::value, T_s>;\n  using T_n_ref = ref_type_if_t<!is_constant<T_n>::value, T_n>;\n  using T_mu_ref = ref_type_if_t<!is_constant<T_loc>::value, T_loc>;\n  using T_sigma_ref = ref_type_if_t<!is_constant<T_scale>::value, T_scale>;\n  static const char* function = \"normal_sufficient_lpdf\";\n  check_consistent_sizes(function, \"Location parameter sufficient statistic\",\n                         y_bar, \"Scale parameter sufficient statistic\",\n                         s_squared, \"Number of observations\", n_obs,\n                         \"Location parameter\", mu, \"Scale parameter\", sigma);\n\n  T_y_ref y_ref = y_bar;\n  T_s_ref s_squared_ref = s_squared;\n  T_n_ref n_obs_ref = n_obs;\n  T_mu_ref mu_ref = mu;\n  T_sigma_ref sigma_ref = sigma;\n\n  const auto& y_col = as_column_vector_or_scalar(y_ref);\n  const auto& s_squared_col = as_column_vector_or_scalar(s_squared_ref);\n  const auto& n_obs_col = as_column_vector_or_scalar(n_obs_ref);\n  const auto& mu_col = as_column_vector_or_scalar(mu_ref);\n  const auto& sigma_col = as_column_vector_or_scalar(sigma_ref);\n\n  const auto& y_arr = as_array_or_scalar(y_col);\n  const auto& s_squared_arr = as_array_or_scalar(s_squared_col);\n  const auto& n_obs_arr = as_array_or_scalar(n_obs_col);\n  const auto& mu_arr = as_array_or_scalar(mu_col);\n  const auto& sigma_arr = as_array_or_scalar(sigma_col);\n\n  ref_type_t<decltype(value_of(y_arr))> y_val = value_of(y_arr);\n  ref_type_t<decltype(value_of(s_squared_arr))> s_squared_val\n      = value_of(s_squared_arr);\n  const auto& n_obs_val_int = value_of(n_obs_arr);\n  ref_type_t<decltype(promote_scalar<double>(n_obs_arr))> n_obs_val\n      = promote_scalar<double>(n_obs_arr);\n  ref_type_t<decltype(value_of(mu_arr))> mu_val = value_of(mu_arr);\n  ref_type_t<decltype(value_of(sigma_arr))> sigma_val = value_of(sigma_arr);\n\n  check_finite(function, \"Location parameter sufficient statistic\", y_val);\n  check_finite(function, \"Scale parameter sufficient statistic\", s_squared_val);\n  check_nonnegative(function, \"Scale parameter sufficient statistic\",\n                    s_squared_val);\n  check_positive_finite(function, \"Number of observations\", n_obs_val);\n  check_finite(function, \"Location parameter\", mu_val);\n  check_positive_finite(function, \"Scale parameter\", sigma_val);\n\n  if (size_zero(y_bar, s_squared, n_obs, mu, sigma)) {\n    return 0.0;\n  }\n  if (!include_summand<propto, T_y, T_s, T_loc, T_scale>::value) {\n    return 0.0;\n  }\n\n  const auto& sigma_squared\n      = to_ref_if<!is_constant_all<T_y, T_loc, T_s, T_scale>::value>(\n          square(sigma_val));\n  const auto& diff = to_ref(mu_val - y_val);\n  const auto& cons_expr = to_ref_if<!is_constant_all<T_scale>::value>(\n      s_squared_val + n_obs_val * diff * diff);\n\n  size_t N = max_size(y_bar, s_squared, n_obs, mu, sigma);\n  T_partials_return logp = -sum(cons_expr \/ (2 * sigma_squared));\n  if (include_summand<propto>::value) {\n    logp += NEG_LOG_SQRT_TWO_PI * sum(n_obs_val) * N \/ size(n_obs);\n  }\n  if (include_summand<propto, T_scale>::value) {\n    logp -= sum(n_obs_val * log(sigma_val)) * N \/ max_size(n_obs, sigma);\n  }\n\n  operands_and_partials<T_y_ref, T_s_ref, T_mu_ref, T_sigma_ref> ops_partials(\n      y_ref, s_squared_ref, mu_ref, sigma_ref);\n  if (!is_constant_all<T_y, T_loc>::value) {\n    const auto& common_derivative = to_ref_if<(\n        !is_constant_all<T_loc>::value && !is_constant_all<T_y>::value)>(\n        n_obs_val \/ sigma_squared * diff);\n    if (!is_constant_all<T_loc>::value) {\n      ops_partials.edge3_.partials_ = -common_derivative;\n    }\n    if (!is_constant_all<T_y>::value) {\n      ops_partials.edge1_.partials_ = std::move(common_derivative);\n    }\n  }\n  if (!is_constant_all<T_s>::value) {\n    using T_sigma_value_scalar = scalar_type_t<decltype(sigma_val)>;\n    using T_sigma_value_vector\n        = Eigen::Array<T_sigma_value_scalar, Eigen::Dynamic, 1>;\n    if (is_vector<T_scale>::value) {\n      ops_partials.edge2_.partials_\n          = -0.5 \/ forward_as<T_sigma_value_vector>(sigma_squared);\n    } else {\n      if (is_vector<T_s>::value) {\n        ops_partials.edge2_.partials_ = T_sigma_value_vector::Constant(\n            size(sigma),\n            -0.5 \/ forward_as<T_sigma_value_scalar>(sigma_squared));\n      } else {\n        ops_partials.edge2_.partials_ = -0.5 \/ sigma_squared;\n      }\n    }\n  }\n  if (!is_constant_all<T_scale>::value) {\n    ops_partials.edge4_.partials_\n        = (cons_expr \/ sigma_squared - n_obs_val) \/ sigma_val;\n  }\n  return ops_partials.build(logp);\n}\n\ntemplate <typename T_y, typename T_s, typename T_n, typename T_loc,\n          typename T_scale>\ninline return_type_t<T_y, T_s, T_loc, T_scale> normal_sufficient_lpdf(\n    const T_y& y_bar, const T_s& s_squared, const T_n& n_obs, const T_loc& mu,\n    const T_scale& sigma) {\n  return normal_sufficient_lpdf<false>(y_bar, s_squared, n_obs, mu, sigma);\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\n<commit_msg>another bugfix for sufficient<commit_after>#ifndef STAN_MATH_PRIM_PROB_NORMAL_SUFFICIENT_LPDF_HPP\n#define STAN_MATH_PRIM_PROB_NORMAL_SUFFICIENT_LPDF_HPP\n\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/constants.hpp>\n#include <stan\/math\/prim\/fun\/log.hpp>\n#include <stan\/math\/prim\/fun\/max_size.hpp>\n#include <stan\/math\/prim\/fun\/promote_scalar.hpp>\n#include <stan\/math\/prim\/fun\/size.hpp>\n#include <stan\/math\/prim\/fun\/size_zero.hpp>\n#include <stan\/math\/prim\/fun\/to_ref.hpp>\n#include <stan\/math\/prim\/fun\/value_of.hpp>\n#include <stan\/math\/prim\/prob\/normal_lpdf.hpp>\n#include <stan\/math\/prim\/functor\/operands_and_partials.hpp>\n#include <cmath>\n\nnamespace stan {\nnamespace math {\n\n\/** \\ingroup prob_dists\n * The log of the normal density for the specified scalar(s) given\n * the specified mean(s) and deviation(s).\n * y, s_squared, mu, or sigma can each be either\n * a scalar, a std vector or Eigen vector.\n * n can be either a single int or an std vector of ints.\n * Any vector inputs must be the same length.\n *\n * <p>The result log probability is defined to be the sum of the\n * log probabilities for each observation\/mean\/deviation triple.\n *\n * @tparam T_y type of sample average parameter\n * @tparam T_s type of sample squared errors parameter\n * @tparam T_n type of sample size parameter\n * @tparam T_loc type of location parameter\n * @tparam T_scale type of scale parameter\n *\n * @param y_bar (Sequence of) scalar(s) (sample average(s)).\n * @param s_squared (Sequence of) sum(s) of sample squared errors\n * @param n_obs (Sequence of) sample size(s)\n * @param mu (Sequence of) location parameter(s)\n * for the normal distribution.\n * @param sigma (Sequence of) scale parameters for the normal\n * distribution.\n * @return The log of the product of the densities.\n * @throw std::domain_error if either n or sigma are not positive,\n * if s_squared is negative or if any parameter is not finite.\n *\/\ntemplate <bool propto, typename T_y, typename T_s, typename T_n, typename T_loc,\n          typename T_scale>\nreturn_type_t<T_y, T_s, T_loc, T_scale> normal_sufficient_lpdf(\n    const T_y& y_bar, const T_s& s_squared, const T_n& n_obs, const T_loc& mu,\n    const T_scale& sigma) {\n  using T_partials_return = partials_return_t<T_y, T_s, T_n, T_loc, T_scale>;\n  using T_y_ref = ref_type_if_t<!is_constant<T_y>::value, T_y>;\n  using T_s_ref = ref_type_if_t<!is_constant<T_s>::value, T_s>;\n  using T_n_ref = ref_type_if_t<!is_constant<T_n>::value, T_n>;\n  using T_mu_ref = ref_type_if_t<!is_constant<T_loc>::value, T_loc>;\n  using T_sigma_ref = ref_type_if_t<!is_constant<T_scale>::value, T_scale>;\n  static const char* function = \"normal_sufficient_lpdf\";\n  check_consistent_sizes(function, \"Location parameter sufficient statistic\",\n                         y_bar, \"Scale parameter sufficient statistic\",\n                         s_squared, \"Number of observations\", n_obs,\n                         \"Location parameter\", mu, \"Scale parameter\", sigma);\n\n  T_y_ref y_ref = y_bar;\n  T_s_ref s_squared_ref = s_squared;\n  T_n_ref n_obs_ref = n_obs;\n  T_mu_ref mu_ref = mu;\n  T_sigma_ref sigma_ref = sigma;\n\n  const auto& y_col = as_column_vector_or_scalar(y_ref);\n  const auto& s_squared_col = as_column_vector_or_scalar(s_squared_ref);\n  const auto& n_obs_col = as_column_vector_or_scalar(n_obs_ref);\n  const auto& mu_col = as_column_vector_or_scalar(mu_ref);\n  const auto& sigma_col = as_column_vector_or_scalar(sigma_ref);\n\n  const auto& y_arr = as_array_or_scalar(y_col);\n  const auto& s_squared_arr = as_array_or_scalar(s_squared_col);\n  const auto& n_obs_arr = as_array_or_scalar(n_obs_col);\n  const auto& mu_arr = as_array_or_scalar(mu_col);\n  const auto& sigma_arr = as_array_or_scalar(sigma_col);\n\n  ref_type_t<decltype(value_of(y_arr))> y_val = value_of(y_arr);\n  ref_type_t<decltype(value_of(s_squared_arr))> s_squared_val\n      = value_of(s_squared_arr);\n  const auto& n_obs_val_int = value_of(n_obs_arr);\n  ref_type_t<decltype(promote_scalar<double>(n_obs_arr))> n_obs_val\n      = promote_scalar<double>(n_obs_arr);\n  ref_type_t<decltype(value_of(mu_arr))> mu_val = value_of(mu_arr);\n  ref_type_t<decltype(value_of(sigma_arr))> sigma_val = value_of(sigma_arr);\n\n  check_finite(function, \"Location parameter sufficient statistic\", y_val);\n  check_finite(function, \"Scale parameter sufficient statistic\", s_squared_val);\n  check_nonnegative(function, \"Scale parameter sufficient statistic\",\n                    s_squared_val);\n  check_positive_finite(function, \"Number of observations\", n_obs_val);\n  check_finite(function, \"Location parameter\", mu_val);\n  check_positive_finite(function, \"Scale parameter\", sigma_val);\n\n  if (size_zero(y_bar, s_squared, n_obs, mu, sigma)) {\n    return 0.0;\n  }\n  if (!include_summand<propto, T_y, T_s, T_loc, T_scale>::value) {\n    return 0.0;\n  }\n\n  const auto& sigma_squared\n      = to_ref_if<!is_constant_all<T_y, T_loc, T_s, T_scale>::value>(\n          square(sigma_val));\n  const auto& diff = to_ref(mu_val - y_val);\n  const auto& cons_expr = to_ref_if<!is_constant_all<T_scale>::value>(\n      s_squared_val + n_obs_val * diff * diff);\n\n  size_t N = max_size(y_bar, s_squared, n_obs, mu, sigma);\n  T_partials_return logp = -sum(cons_expr \/ (2 * sigma_squared));\n  if (include_summand<propto>::value) {\n    logp += NEG_LOG_SQRT_TWO_PI * sum(n_obs_val) * N \/ size(n_obs);\n  }\n  if (include_summand<propto, T_scale>::value) {\n    logp -= sum(n_obs_val * log(sigma_val)) * N \/ max_size(n_obs, sigma);\n  }\n\n  operands_and_partials<T_y_ref, T_s_ref, T_mu_ref, T_sigma_ref> ops_partials(\n      y_ref, s_squared_ref, mu_ref, sigma_ref);\n  if (!is_constant_all<T_y, T_loc>::value) {\n    const auto& common_derivative = to_ref_if<(\n        !is_constant_all<T_loc>::value && !is_constant_all<T_y>::value)>(\n        n_obs_val \/ sigma_squared * diff);\n    if (!is_constant_all<T_loc>::value) {\n      ops_partials.edge3_.partials_ = -common_derivative;\n    }\n    if (!is_constant_all<T_y>::value) {\n      ops_partials.edge1_.partials_ = std::move(common_derivative);\n    }\n  }\n  if (!is_constant_all<T_s>::value) {\n    using T_sigma_value_scalar = scalar_type_t<decltype(sigma_val)>;\n    using T_sigma_value_vector\n        = Eigen::Array<T_sigma_value_scalar, Eigen::Dynamic, 1>;\n    if (is_vector<T_scale>::value) {\n      ops_partials.edge2_.partials_\n          = -0.5 \/ forward_as<T_sigma_value_vector>(sigma_squared);\n    } else {\n      if (is_vector<T_s>::value) {\n        ops_partials.edge2_.partials_ = T_sigma_value_vector::Constant(\n            size(sigma),\n            -0.5 \/ forward_as<T_sigma_value_scalar>(sigma_squared));\n      } else {\n        forward_as<internal::broadcast_array<T_partials_return>>(\n            ops_partials.edge2_.partials_)\n            = -0.5 \/ sigma_squared;\n      }\n    }\n  }\n  if (!is_constant_all<T_scale>::value) {\n    ops_partials.edge4_.partials_\n        = (cons_expr \/ sigma_squared - n_obs_val) \/ sigma_val;\n  }\n  return ops_partials.build(logp);\n}\n\ntemplate <typename T_y, typename T_s, typename T_n, typename T_loc,\n          typename T_scale>\ninline return_type_t<T_y, T_s, T_loc, T_scale> normal_sufficient_lpdf(\n    const T_y& y_bar, const T_s& s_squared, const T_n& n_obs, const T_loc& mu,\n    const T_scale& sigma) {\n  return normal_sufficient_lpdf<false>(y_bar, s_squared, n_obs, mu, sigma);\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\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 <string>\n#include \"base\/message_loop.h\"\n#include \"chrome\/browser\/chromeos\/gview_request_interceptor.h\"\n#include \"net\/base\/load_flags.h\"\n#include \"net\/url_request\/url_request.h\"\n#include \"net\/url_request\/url_request_job.h\"\n#include \"net\/url_request\/url_request_test_job.h\"\n#include \"net\/url_request\/url_request_unittest.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace chromeos {\n\nclass GViewURLRequestTestJob : public URLRequestTestJob {\n public:\n  explicit GViewURLRequestTestJob(URLRequest* request)\n      : URLRequestTestJob(request, true) {\n  }\n\n  virtual bool GetMimeType(std::string* mime_type) const {\n    \/\/ During the course of a single test, two URLRequestJobs are\n    \/\/ created -- the first is for the viewable document URL, and the\n    \/\/ second is for the rediected URL.  In order to test the\n    \/\/ interceptor, the mime type of the first request must be one of\n    \/\/ the supported viewable mime types.  So when the URLRequestJob\n    \/\/ is a request for one of the test URLs that point to viewable\n    \/\/ content, return an appropraite mime type.  Otherwise, return\n    \/\/ \"text\/html\".\n    if (request_->url() == GURL(\"http:\/\/foo.com\/file.pdf\")) {\n      *mime_type = \"application\/pdf\";\n    } else if (request_->url() == GURL(\"http:\/\/foo.com\/file.ppt\")) {\n      *mime_type = \"application\/vnd.ms-powerpoint\";\n    } else {\n      *mime_type = \"text\/html\";\n    }\n    return true;\n  }\n\n private:\n  ~GViewURLRequestTestJob() {}\n};\n\nclass GViewRequestInterceptorTest : public testing::Test {\n public:\n  virtual void SetUp() {\n    URLRequest::RegisterProtocolFactory(\"http\",\n                                        &GViewRequestInterceptorTest::Factory);\n    interceptor_ = GViewRequestInterceptor::GetGViewRequestInterceptor();\n  }\n\n  virtual void TearDown() {\n    URLRequest::RegisterProtocolFactory(\"http\", NULL);\n    message_loop_.RunAllPending();\n  }\n\n  static URLRequestJob* Factory(URLRequest* request,\n                                const std::string& scheme) {\n    return new GViewURLRequestTestJob(request);\n  }\n\n protected:\n  MessageLoopForIO message_loop_;\n  TestDelegate test_delegate_;\n  URLRequest::Interceptor* interceptor_;\n};\n\nTEST_F(GViewRequestInterceptorTest, DoNotInterceptHtml) {\n  URLRequest request(GURL(\"http:\/\/foo.com\/index.html\"), &test_delegate_);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(0, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/foo.com\/index.html\"), request.url());\n}\n\nTEST_F(GViewRequestInterceptorTest, DoNotInterceptDownload) {\n  URLRequest request(GURL(\"http:\/\/foo.com\/file.pdf\"), &test_delegate_);\n  request.set_load_flags(net::LOAD_IS_DOWNLOAD);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(0, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/foo.com\/file.pdf\"), request.url());\n}\n\nTEST_F(GViewRequestInterceptorTest, FAILS_InterceptPdf) {\n  URLRequest request(GURL(\"http:\/\/foo.com\/file.pdf\"), &test_delegate_);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(1, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/docs.google.com\/gview?url=http%3A\/\/foo.com\/file.pdf\"),\n                 request.url());\n}\n\nTEST_F(GViewRequestInterceptorTest, InterceptPowerpoint) {\n  URLRequest request(GURL(\"http:\/\/foo.com\/file.ppt\"), &test_delegate_);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(1, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/docs.google.com\/gview?url=http%3A\/\/foo.com\/file.ppt\"),\n                 request.url());\n}\n\n}  \/\/ namespace chromeos\n<commit_msg>Fix unit test for GView interceptor.<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 <string>\n#include \"base\/message_loop.h\"\n#include \"chrome\/browser\/chromeos\/gview_request_interceptor.h\"\n#include \"chrome\/browser\/plugin_service.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"net\/base\/load_flags.h\"\n#include \"net\/url_request\/url_request.h\"\n#include \"net\/url_request\/url_request_job.h\"\n#include \"net\/url_request\/url_request_test_job.h\"\n#include \"net\/url_request\/url_request_unittest.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"webkit\/glue\/plugins\/plugin_list.h\"\n\nnamespace chromeos {\n\nclass GViewURLRequestTestJob : public URLRequestTestJob {\n public:\n  explicit GViewURLRequestTestJob(URLRequest* request)\n      : URLRequestTestJob(request, true) {\n  }\n\n  virtual bool GetMimeType(std::string* mime_type) const {\n    \/\/ During the course of a single test, two URLRequestJobs are\n    \/\/ created -- the first is for the viewable document URL, and the\n    \/\/ second is for the rediected URL.  In order to test the\n    \/\/ interceptor, the mime type of the first request must be one of\n    \/\/ the supported viewable mime types.  So when the URLRequestJob\n    \/\/ is a request for one of the test URLs that point to viewable\n    \/\/ content, return an appropraite mime type.  Otherwise, return\n    \/\/ \"text\/html\".\n    if (request_->url() == GURL(\"http:\/\/foo.com\/file.pdf\")) {\n      *mime_type = \"application\/pdf\";\n    } else if (request_->url() == GURL(\"http:\/\/foo.com\/file.ppt\")) {\n      *mime_type = \"application\/vnd.ms-powerpoint\";\n    } else {\n      *mime_type = \"text\/html\";\n    }\n    return true;\n  }\n\n private:\n  ~GViewURLRequestTestJob() {}\n};\n\nclass GViewRequestInterceptorTest : public testing::Test {\n public:\n  virtual void SetUp() {\n    URLRequest::RegisterProtocolFactory(\"http\",\n                                        &GViewRequestInterceptorTest::Factory);\n    interceptor_ = GViewRequestInterceptor::GetGViewRequestInterceptor();\n    ASSERT_TRUE(PathService::Get(chrome::FILE_PDF_PLUGIN, &pdf_path_));\n  }\n\n  virtual void TearDown() {\n    URLRequest::RegisterProtocolFactory(\"http\", NULL);\n    message_loop_.RunAllPending();\n  }\n\n  static URLRequestJob* Factory(URLRequest* request,\n                                const std::string& scheme) {\n    return new GViewURLRequestTestJob(request);\n  }\n\n  void RegisterPDFPlugin() {\n    NPAPI::PluginVersionInfo info;\n    info.path = pdf_path_;\n    memset(&info.entry_points, 0, sizeof(info.entry_points));\n    NPAPI::PluginList::Singleton()->RegisterInternalPlugin(info);\n    NPAPI::PluginList::Singleton()->RefreshPlugins();\n  }\n\n  void UnregisterPDFPlugin() {\n    NPAPI::PluginList::Singleton()->UnregisterInternalPlugin(pdf_path_);\n    NPAPI::PluginList::Singleton()->RefreshPlugins();\n  }\n\n  void SetPDFPluginLoadedState(bool want_loaded, bool* out_is_enabled) {\n    WebPluginInfo info;\n    bool is_loaded =\n        NPAPI::PluginList::Singleton()->GetPluginInfoByPath(pdf_path_, &info);\n    if (is_loaded && !want_loaded) {\n      UnregisterPDFPlugin();\n      is_loaded =\n          NPAPI::PluginList::Singleton()->GetPluginInfoByPath(pdf_path_, &info);\n    } else if (!is_loaded && want_loaded) {\n      \/\/ This \"loads\" the plug-in even if it's not present on the\n      \/\/ system - which is OK since we don't actually use it, just\n      \/\/ need it to be \"enabled\" for the test.\n      RegisterPDFPlugin();\n      is_loaded =\n          NPAPI::PluginList::Singleton()->GetPluginInfoByPath(pdf_path_, &info);\n    }\n    EXPECT_EQ(want_loaded, is_loaded);\n    *out_is_enabled = info.enabled;\n  }\n\n protected:\n  MessageLoopForIO message_loop_;\n  TestDelegate test_delegate_;\n  URLRequest::Interceptor* interceptor_;\n  FilePath pdf_path_;\n};\n\nTEST_F(GViewRequestInterceptorTest, DoNotInterceptHtml) {\n  URLRequest request(GURL(\"http:\/\/foo.com\/index.html\"), &test_delegate_);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(0, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/foo.com\/index.html\"), request.url());\n}\n\nTEST_F(GViewRequestInterceptorTest, DoNotInterceptDownload) {\n  URLRequest request(GURL(\"http:\/\/foo.com\/file.pdf\"), &test_delegate_);\n  request.set_load_flags(net::LOAD_IS_DOWNLOAD);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(0, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/foo.com\/file.pdf\"), request.url());\n}\n\nTEST_F(GViewRequestInterceptorTest, DoNotInterceptPdfWhenEnabled) {\n  bool enabled;\n  SetPDFPluginLoadedState(true, &enabled);\n\n  if (!enabled) {\n    bool pdf_plugin_enabled =\n        NPAPI::PluginList::Singleton()->EnablePlugin(pdf_path_);\n    EXPECT_TRUE(pdf_plugin_enabled);\n  }\n\n  URLRequest request(GURL(\"http:\/\/foo.com\/file.pdf\"), &test_delegate_);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(0, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/foo.com\/file.pdf\"), request.url());\n}\n\nTEST_F(GViewRequestInterceptorTest, InterceptPdfWhenDisabled) {\n  bool enabled;\n  SetPDFPluginLoadedState(true, &enabled);\n\n  if (enabled) {\n    bool pdf_plugin_disabled =\n        NPAPI::PluginList::Singleton()->DisablePlugin(pdf_path_);\n    EXPECT_TRUE(pdf_plugin_disabled);\n  }\n\n  URLRequest request(GURL(\"http:\/\/foo.com\/file.pdf\"), &test_delegate_);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(1, test_delegate_.received_redirect_count());\n  EXPECT_EQ(\n      GURL(\"http:\/\/docs.google.com\/gview?url=http%3A\/\/foo.com\/file.pdf\"),\n      request.url());\n}\n\nTEST_F(GViewRequestInterceptorTest, InterceptPdfWithNoPlugin) {\n  bool enabled;\n  SetPDFPluginLoadedState(false, &enabled);\n\n  URLRequest request(GURL(\"http:\/\/foo.com\/file.pdf\"), &test_delegate_);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(1, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/docs.google.com\/gview?url=http%3A\/\/foo.com\/file.pdf\"),\n                 request.url());\n}\n\nTEST_F(GViewRequestInterceptorTest, InterceptPowerpoint) {\n  URLRequest request(GURL(\"http:\/\/foo.com\/file.ppt\"), &test_delegate_);\n  request.Start();\n  MessageLoop::current()->Run();\n  EXPECT_EQ(1, test_delegate_.received_redirect_count());\n  EXPECT_EQ(GURL(\"http:\/\/docs.google.com\/gview?url=http%3A\/\/foo.com\/file.ppt\"),\n                 request.url());\n}\n\n}  \/\/ namespace chromeos\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\/extensions\/theme_installed_infobar_delegate.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n\nThemeInstalledInfoBarDelegate::ThemeInstalledInfoBarDelegate(\n    TabContents* tab_contents, const Extension* new_theme,\n    const std::string& previous_theme_id)\n         : ConfirmInfoBarDelegate(tab_contents),\n           was_canceled_(false),\n           profile_(tab_contents->profile()),\n           name_(new_theme->name()),\n           new_theme_id_(new_theme->id()),\n           previous_theme_id_(previous_theme_id) {\n}\n\nvoid ThemeInstalledInfoBarDelegate::InfoBarClosed() {\n  ExtensionsService* service = profile_->GetExtensionsService();\n  if (service) {\n    std::string uninstall_id;\n    if (was_canceled_)\n      uninstall_id = new_theme_id_;\n    else if (!previous_theme_id_.empty())\n      uninstall_id = previous_theme_id_;\n    \/\/ It's possible that the theme was already uninstalled by someone so make\n    \/\/ sure it exists.\n    if (!uninstall_id.empty() && service->GetExtensionById(uninstall_id))\n      service->UninstallExtension(uninstall_id, false);\n  }\n  delete this;\n}\n\nstd::wstring ThemeInstalledInfoBarDelegate::GetMessageText() const {\n  return l10n_util::GetStringF(IDS_THEME_INSTALL_INFOBAR_LABEL,\n                               UTF8ToWide(name_));\n}\n\nSkBitmap* ThemeInstalledInfoBarDelegate::GetIcon() const {\n  \/\/ TODO(aa): Reply with the theme's icon, but this requires reading it\n  \/\/ asynchronously from disk.\n  return ResourceBundle::GetSharedInstance().GetBitmapNamed(\n      IDR_INFOBAR_THEME);\n}\n\nThemeInstalledInfoBarDelegate*\n    ThemeInstalledInfoBarDelegate::AsThemePreviewInfobarDelegate() {\n  return this;\n}\n\nint ThemeInstalledInfoBarDelegate::GetButtons() const {\n  return BUTTON_CANCEL;\n}\n\nstd::wstring ThemeInstalledInfoBarDelegate::GetButtonLabel(\n    ConfirmInfoBarDelegate::InfoBarButton button) const {\n  switch (button) {\n    case BUTTON_CANCEL: {\n      return l10n_util::GetString(IDS_THEME_INSTALL_INFOBAR_UNDO_BUTTON);\n    }\n    default:\n      NOTREACHED();\n      return L\"\";\n  }\n}\n\nbool ThemeInstalledInfoBarDelegate::Cancel() {\n  was_canceled_ = true;\n  if (!previous_theme_id_.empty()) {\n    ExtensionsService* service = profile_->GetExtensionsService();\n    if (service) {\n      Extension* previous_theme = service->GetExtensionById(previous_theme_id_);\n      if (previous_theme) {\n        profile_->SetTheme(previous_theme);\n        return true;\n      }\n    }\n  }\n\n  profile_->ClearTheme();\n  return true;\n}\n<commit_msg>Fix theme install crasher.<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\/extensions\/theme_installed_infobar_delegate.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n\nThemeInstalledInfoBarDelegate::ThemeInstalledInfoBarDelegate(\n    TabContents* tab_contents, const Extension* new_theme,\n    const std::string& previous_theme_id)\n         : ConfirmInfoBarDelegate(tab_contents),\n           was_canceled_(false),\n           profile_(tab_contents->profile()),\n           name_(new_theme->name()),\n           new_theme_id_(new_theme->id()),\n           previous_theme_id_(previous_theme_id) {\n}\n\nvoid ThemeInstalledInfoBarDelegate::InfoBarClosed() {\n  ExtensionsService* service = profile_->GetExtensionsService();\n  if (service) {\n    std::string uninstall_id;\n    if (was_canceled_)\n      uninstall_id = new_theme_id_;\n    else if (!previous_theme_id_.empty())\n      uninstall_id = previous_theme_id_;\n    \/\/ It's possible that the theme was already uninstalled by someone so make\n    \/\/ sure it exists.\n    if (!uninstall_id.empty() && service->GetExtensionById(uninstall_id))\n      service->UninstallExtension(uninstall_id, false);\n  }\n  delete this;\n}\n\nstd::wstring ThemeInstalledInfoBarDelegate::GetMessageText() const {\n  return l10n_util::GetStringF(IDS_THEME_INSTALL_INFOBAR_LABEL,\n                               UTF8ToWide(name_));\n}\n\nSkBitmap* ThemeInstalledInfoBarDelegate::GetIcon() const {\n  \/\/ TODO(aa): Reply with the theme's icon, but this requires reading it\n  \/\/ asynchronously from disk.\n  return ResourceBundle::GetSharedInstance().GetBitmapNamed(\n      IDR_INFOBAR_THEME);\n}\n\nThemeInstalledInfoBarDelegate*\n    ThemeInstalledInfoBarDelegate::AsThemePreviewInfobarDelegate() {\n  return this;\n}\n\nint ThemeInstalledInfoBarDelegate::GetButtons() const {\n  return BUTTON_CANCEL;\n}\n\nstd::wstring ThemeInstalledInfoBarDelegate::GetButtonLabel(\n    ConfirmInfoBarDelegate::InfoBarButton button) const {\n  switch (button) {\n    case BUTTON_CANCEL: {\n      return l10n_util::GetString(IDS_THEME_INSTALL_INFOBAR_UNDO_BUTTON);\n    }\n    default:\n      \/\/ The InfoBar will create a default OK button and make it invisible.\n      \/\/ TODO(mirandac): remove the default OK button from ConfirmInfoBar.\n      return L\"\";\n  }\n}\n\nbool ThemeInstalledInfoBarDelegate::Cancel() {\n  was_canceled_ = true;\n  if (!previous_theme_id_.empty()) {\n    ExtensionsService* service = profile_->GetExtensionsService();\n    if (service) {\n      Extension* previous_theme = service->GetExtensionById(previous_theme_id_);\n      if (previous_theme) {\n        profile_->SetTheme(previous_theme);\n        return true;\n      }\n    }\n  }\n\n  profile_->ClearTheme();\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: RowSetCache.hxx,v $\n *\n *  $Revision: 1.26 $\n *\n *  last change: $Author: hr $ $Date: 2006-01-25 13:43:41 $\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 DBACCESS_CORE_API_ROWSETCACHE_HXX\n#define DBACCESS_CORE_API_ROWSETCACHE_HXX\n\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include <connectivity\/CommonTools.hxx>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XPREPAREDSTATEMENT_HPP_\n#include <com\/sun\/star\/sdbc\/XPreparedStatement.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCONNECTION_HPP_\n#include <com\/sun\/star\/sdbc\/XConnection.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDB_XSINGLESELECTQUERYANALYZER_HPP_\n#include <com\/sun\/star\/sdb\/XSingleSelectQueryAnalyzer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDB_XSINGLESELECTQUERYANALYZER_HPP_\n#include <com\/sun\/star\/sdb\/XSingleSelectQueryAnalyzer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSETMETADATASUPPLIER_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetMetaDataSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XWARNINGSSUPPLIER_HPP_\n#include <com\/sun\/star\/sdbc\/XWarningsSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDB_XRESULTSETACCESS_HPP_\n#include <com\/sun\/star\/sdb\/XResultSetAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XROW_HPP_\n#include <com\/sun\/star\/sdbc\/XRow.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCOLUMNLOCATE_HPP_\n#include <com\/sun\/star\/sdbc\/XColumnLocate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XROWLOCATE_HPP_\n#include <com\/sun\/star\/sdbcx\/XRowLocate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XROWUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XRowUpdate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSETUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetUpdate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDB_XROWSETAPPROVEBROADCASTER_HPP_\n#include <com\/sun\/star\/sdb\/XRowSetApproveBroadcaster.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_RESULTSETTYPE_HPP_\n#include <com\/sun\/star\/sdbc\/ResultSetType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XDELETEROWS_HPP_\n#include <com\/sun\/star\/sdbcx\/XDeleteRows.hpp>\n#endif\n#ifndef _CPPUHELPER_COMPBASE11_HXX_\n#include <cppuhelper\/compbase11.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTYCONTAINER_HXX_\n#include <comphelper\/propertycontainer.hxx>\n#endif\n#ifndef _CPPUHELPER_IMPLBASE5_HXX_\n#include <cppuhelper\/implbase5.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n#ifndef DBACCESS_CORE_API_ROWSETROW_HXX\n#include \"RowSetRow.hxx\"\n#endif\n#ifndef DBACCESS_ROWSETCACHEITERATOR_HXX\n#include \"RowSetCacheIterator.hxx\"\n#endif\n\nnamespace dbaccess\n{\n    class OCacheSet;\n    class ORowSetDataColumns;\n    class ORowSetCacheClone;\n\n    class ORowSetCache\n    {\n        friend class ORowSetBase;\n        friend class ORowSet;\n        friend class ORowSetClone;\n        friend class ORowSetCacheIterator;\n\n        typedef ::std::vector< TORowSetOldRowHelperRef >    TOldRowSetRows;\n\n        ::osl::Mutex            m_aRowCountMutex, \/\/ mutex for rowcount changes\n                                \/\/ we need a extra mutex for columns to prevend deadlock when setting new values\n                                \/\/ for a row\n                                m_aColumnsMutex;\n\n        \/\/the set can be static, bookmarkable or keyset\n        ::com::sun::star::uno::WeakReference< ::com::sun::star::sdbc::XResultSet>       m_xSet;\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSetMetaData >  m_xMetaData; \/\/ must be before m_aInsertRow\n        ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory> m_xServiceFactory;\n\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XRow>                 m_xCacheSet;\n\n        OCacheSet*                      m_pCacheSet;            \/\/ is a bookmarkable, keyset or static resultset\n        ORowSetMatrix*                  m_pMatrix;              \/\/ represent the table struct\n        ORowSetMatrix::iterator         m_aMatrixIter;          \/\/ represent a row of the table\n        ORowSetMatrix::iterator         m_aMatrixEnd;           \/\/ present the row behind the last row of the table\n        ORowSetCacheMap                 m_aCacheIterators;\n        TOldRowSetRows                  m_aOldRows;\n\n        ORowSetMatrix*                  m_pInsertMatrix;        \/\/ represent the rows which should be inserted normally this is only one\n        ORowSetMatrix::iterator         m_aInsertRow;           \/\/ represent a insert row\n\n        \/\/  ORowSetRow                      m_aInsertRow;           \/\/ present the row that should be inserted\n        sal_Int32                       m_nLastColumnIndex;     \/\/ the last column ask for, used for wasNull()\n\n        connectivity::OSQLTable         m_aUpdateTable;         \/\/ used for updates\/deletes and inserts\n\n        sal_Int32                   m_nFetchSize;\n        sal_Int32                   m_nRowCount;\n        sal_Int32                   m_nPrivileges;\n        sal_Int32                   m_nPosition;                \/\/ 0 means beforefirst\n\n        sal_Int32                   m_nStartPos;                \/\/ start pos of the window zero based\n        sal_Int32                   m_nEndPos;                  \/\/ end   pos of the window zero based\n\n        sal_Bool                    m_bRowCountFinal ;\n        sal_Bool                    m_bBeforeFirst ;\n        sal_Bool                    m_bAfterLast ;\n        sal_Bool                    m_bInserted;\n        sal_Bool                    m_bDeleted ;\n        sal_Bool                    m_bUpdated ;\n        sal_Bool&                   m_bModified ;           \/\/ points to the rowset member m_bModified\n        sal_Bool&                   m_bNew ;                \/\/ points to the rowset member m_bNew\n\n        sal_Bool fill(ORowSetMatrix::iterator& _aIter,const ORowSetMatrix::iterator& _aEnd,sal_Int32& _nPos,sal_Bool _bCheck);\n        sal_Bool reFillMatrix(sal_Int32 _nNewStartPos,sal_Int32 nNewEndPos);\n        sal_Bool fillMatrix(sal_Int32 &_nNewStartPos,sal_Int32 _nNewEndPos);\n        sal_Bool moveWindow();\n\n        void firePropertyChange(sal_Int32 _nColumnIndex,const ::connectivity::ORowSetValue& _rOldValue);\n\n        void rotateCacheIterator(sal_Int16 _nDist);\n        void updateValue(sal_Int32 columnIndex,const connectivity::ORowSetValue& x);\n        \/\/ checks and set the flags isAfterLast isLast and position when afterlast is true\n        void checkPositionFlags();\n        void checkUpdateConditions(sal_Int32 columnIndex);\n        sal_Bool checkJoin( const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection>& _xConnection,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::sdb::XSingleSelectQueryAnalyzer >& _xComposer,\n                            const ::rtl::OUString& _sUpdateTableName);\n\n        \/\/ clears the insert row\n        void                    clearInsertRow();\n        ORowSetMatrix::iterator calcPosition() const;\n\n    protected:\n        ORowSetMatrix::iterator& getIterator() { return m_aMatrixIter;}\n        ORowSetMatrix::iterator& getEnd() { return m_aMatrixEnd;}\n        \/\/ is called when after a moveToInsertRow a movement (next, etc) was called\n        void cancelRowModification();\n    public:\n        ORowSetCache(const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet >&,\n                     const ::com::sun::star::uno::Reference< ::com::sun::star::sdb::XSingleSelectQueryAnalyzer >& _xAnalyzer,\n                     const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _xServiceFactory,\n                     const ORowSetValueVector& _rParameterRow,\n                     const ::rtl::OUString& _rUpdateTableName,\n                     sal_Bool&  _bModified,\n                     sal_Bool&  _bNew);\n        ~ORowSetCache();\n\n\n        \/\/ called from the rowset when a updateXXX was called for the first time\n        void setUpdateIterator(const ORowSetMatrix::iterator& _rOriginalRow);\n        ORowSetCacheIterator createIterator(ORowSetBase* _pRowSet);\n        \/\/ sets the size of the matrix\n        void setMaxRowSize(sal_Int32 _nSize);\n\n        TORowSetOldRowHelperRef registerOldRow();\n        void deregisterOldRow(const TORowSetOldRowHelperRef& _rRow);\n\n        void clearModified();\n\n    \/\/ ::com::sun::star::sdbc::XResultSetMetaDataSupplier\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSetMetaData > getMetaData(  );\n\n    \/\/ ::com::sun::star::sdbcx::XRowLocate\n        ::com::sun::star::uno::Any getBookmark(  );\n        sal_Bool moveToBookmark( const ::com::sun::star::uno::Any& bookmark );\n        sal_Bool moveRelativeToBookmark( const ::com::sun::star::uno::Any& bookmark, sal_Int32 rows );\n        sal_Int32 compareBookmarks( const ::com::sun::star::uno::Any& first, const ::com::sun::star::uno::Any& second );\n        sal_Bool hasOrderedBookmarks(  );\n        sal_Int32 hashBookmark( const ::com::sun::star::uno::Any& bookmark );\n\n    \/\/ ::com::sun::star::sdbc::XRowUpdate\n        void updateBinaryStream( sal_Int32 columnIndex, const ::com::sun::star::uno::Reference< ::com::sun::star::io::XInputStream >& x, sal_Int32 length );\n        void updateCharacterStream( sal_Int32 columnIndex, const ::com::sun::star::uno::Reference< ::com::sun::star::io::XInputStream >& x, sal_Int32 length );\n        void updateObject( sal_Int32 columnIndex, const ::com::sun::star::uno::Any& x );\n        void updateNumericObject( sal_Int32 columnIndex, const ::com::sun::star::uno::Any& x, sal_Int32 scale );\n\n    \/\/ ::com::sun::star::sdbc::XResultSet\n        sal_Bool next(  );\n        sal_Bool isBeforeFirst(  );\n        sal_Bool isAfterLast(  );\n        sal_Bool isFirst(  );\n        sal_Bool isLast(  );\n        void beforeFirst(  );\n        void afterLast(  );\n        sal_Bool first(  );\n        sal_Bool last(  );\n        sal_Int32 getRow(  );\n        sal_Bool absolute( sal_Int32 row );\n        sal_Bool relative( sal_Int32 rows );\n        sal_Bool previous(  );\n        void refreshRow(  );\n        sal_Bool rowUpdated(  );\n        sal_Bool rowInserted(  );\n        sal_Bool rowDeleted(  );\n\n    \/\/ ::com::sun::star::sdbc::XResultSetUpdate\n        sal_Bool insertRow();\n        void resetInsertRow(sal_Bool _bClearInsertRow);\n\n        void updateRow();\n        void updateRow( ORowSetMatrix::iterator& _rUpdateRow );\n        void deleteRow();\n        void cancelRowUpdates(  );\n        void moveToInsertRow(  );\n        void moveToCurrentRow(  );\n\n    \/\/ ::com::sun::star::sdbcx::XDeleteRows\n        ::com::sun::star::uno::Sequence< sal_Int32 > deleteRows( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& rows );\n    };\n}\n#endif\n\n<commit_msg>INTEGRATION: CWS rowsetdel (1.25.76); FILE MERGED 2006\/01\/25 14:47:26 fs 1.25.76.5: manual RESYNC to HEAD 2006\/01\/20 09:01:24 fs 1.25.76.4: #i55731# deleteRows now implemented in the RowSet itself 2006\/01\/19 09:04:09 fs 1.25.76.3: merging the changes from CWS stlusagefix01, to ensure there are no interdependencies 2006\/01\/19 07:12:27 fs 1.25.76.2: #i55731# removed some unused code from the cache 2006\/01\/16 10:12:23 fs 1.25.76.1: #i55731# fixed the handling for deleting rows. In particular, remove m_bDeleted, since this is an attribute of the RowSet\/Clone now, not the cache<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: RowSetCache.hxx,v $\n *\n *  $Revision: 1.27 $\n *\n *  last change: $Author: hr $ $Date: 2006-01-25 15:10: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#ifndef DBACCESS_CORE_API_ROWSETCACHE_HXX\n#define DBACCESS_CORE_API_ROWSETCACHE_HXX\n\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include <connectivity\/CommonTools.hxx>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XPREPAREDSTATEMENT_HPP_\n#include <com\/sun\/star\/sdbc\/XPreparedStatement.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCONNECTION_HPP_\n#include <com\/sun\/star\/sdbc\/XConnection.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDB_XSINGLESELECTQUERYANALYZER_HPP_\n#include <com\/sun\/star\/sdb\/XSingleSelectQueryAnalyzer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDB_XSINGLESELECTQUERYANALYZER_HPP_\n#include <com\/sun\/star\/sdb\/XSingleSelectQueryAnalyzer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSETMETADATASUPPLIER_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetMetaDataSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XWARNINGSSUPPLIER_HPP_\n#include <com\/sun\/star\/sdbc\/XWarningsSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDB_XRESULTSETACCESS_HPP_\n#include <com\/sun\/star\/sdb\/XResultSetAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XROW_HPP_\n#include <com\/sun\/star\/sdbc\/XRow.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCOLUMNLOCATE_HPP_\n#include <com\/sun\/star\/sdbc\/XColumnLocate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XROWLOCATE_HPP_\n#include <com\/sun\/star\/sdbcx\/XRowLocate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XROWUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XRowUpdate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSETUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetUpdate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDB_XROWSETAPPROVEBROADCASTER_HPP_\n#include <com\/sun\/star\/sdb\/XRowSetApproveBroadcaster.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_RESULTSETTYPE_HPP_\n#include <com\/sun\/star\/sdbc\/ResultSetType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XDELETEROWS_HPP_\n#include <com\/sun\/star\/sdbcx\/XDeleteRows.hpp>\n#endif\n#ifndef _CPPUHELPER_COMPBASE11_HXX_\n#include <cppuhelper\/compbase11.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTYCONTAINER_HXX_\n#include <comphelper\/propertycontainer.hxx>\n#endif\n#ifndef _CPPUHELPER_IMPLBASE5_HXX_\n#include <cppuhelper\/implbase5.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n#ifndef DBACCESS_CORE_API_ROWSETROW_HXX\n#include \"RowSetRow.hxx\"\n#endif\n#ifndef DBACCESS_ROWSETCACHEITERATOR_HXX\n#include \"RowSetCacheIterator.hxx\"\n#endif\n\nnamespace dbaccess\n{\n    class OCacheSet;\n    class ORowSetDataColumns;\n    class ORowSetCacheClone;\n\n    class ORowSetCache\n    {\n        friend class ORowSetBase;\n        friend class ORowSet;\n        friend class ORowSetClone;\n        friend class ORowSetCacheIterator;\n\n        typedef ::std::vector< TORowSetOldRowHelperRef >    TOldRowSetRows;\n\n        ::osl::Mutex            m_aRowCountMutex, \/\/ mutex for rowcount changes\n                                \/\/ we need a extra mutex for columns to prevend deadlock when setting new values\n                                \/\/ for a row\n                                m_aColumnsMutex;\n\n        \/\/the set can be static, bookmarkable or keyset\n        ::com::sun::star::uno::WeakReference< ::com::sun::star::sdbc::XResultSet>       m_xSet;\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSetMetaData >  m_xMetaData; \/\/ must be before m_aInsertRow\n        ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory> m_xServiceFactory;\n\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XRow>                 m_xCacheSet;\n\n        OCacheSet*                      m_pCacheSet;            \/\/ is a bookmarkable, keyset or static resultset\n        ORowSetMatrix*                  m_pMatrix;              \/\/ represent the table struct\n        ORowSetMatrix::iterator         m_aMatrixIter;          \/\/ represent a row of the table\n        ORowSetMatrix::iterator         m_aMatrixEnd;           \/\/ present the row behind the last row of the table\n        ORowSetCacheMap                 m_aCacheIterators;\n        TOldRowSetRows                  m_aOldRows;\n\n        ORowSetMatrix*                  m_pInsertMatrix;        \/\/ represent the rows which should be inserted normally this is only one\n        ORowSetMatrix::iterator         m_aInsertRow;           \/\/ represent a insert row\n\n        \/\/  ORowSetRow                      m_aInsertRow;           \/\/ present the row that should be inserted\n        sal_Int32                       m_nLastColumnIndex;     \/\/ the last column ask for, used for wasNull()\n\n        connectivity::OSQLTable         m_aUpdateTable;         \/\/ used for updates\/deletes and inserts\n\n        sal_Int32                   m_nFetchSize;\n        sal_Int32                   m_nRowCount;\n        sal_Int32                   m_nPrivileges;\n        sal_Int32                   m_nPosition;                \/\/ 0 means beforefirst\n\n        sal_Int32                   m_nStartPos;                \/\/ start pos of the window zero based\n        sal_Int32                   m_nEndPos;                  \/\/ end   pos of the window zero based\n\n        sal_Bool                    m_bRowCountFinal ;\n        sal_Bool                    m_bBeforeFirst ;\n        sal_Bool                    m_bAfterLast ;\n        sal_Bool                    m_bInserted;\n        sal_Bool                    m_bUpdated ;\n        sal_Bool&                   m_bModified ;           \/\/ points to the rowset member m_bModified\n        sal_Bool&                   m_bNew ;                \/\/ points to the rowset member m_bNew\n\n        sal_Bool fill(ORowSetMatrix::iterator& _aIter,const ORowSetMatrix::iterator& _aEnd,sal_Int32& _nPos,sal_Bool _bCheck);\n        sal_Bool reFillMatrix(sal_Int32 _nNewStartPos,sal_Int32 nNewEndPos);\n        sal_Bool fillMatrix(sal_Int32 &_nNewStartPos,sal_Int32 _nNewEndPos);\n        sal_Bool moveWindow();\n\n        void firePropertyChange(sal_Int32 _nColumnIndex,const ::connectivity::ORowSetValue& _rOldValue);\n\n        void rotateCacheIterator(sal_Int16 _nDist);\n        void updateValue(sal_Int32 columnIndex,const connectivity::ORowSetValue& x);\n        \/\/ checks and set the flags isAfterLast isLast and position when afterlast is true\n        void checkPositionFlags();\n        void checkUpdateConditions(sal_Int32 columnIndex);\n        sal_Bool checkJoin( const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection>& _xConnection,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::sdb::XSingleSelectQueryAnalyzer >& _xComposer,\n                            const ::rtl::OUString& _sUpdateTableName);\n\n        \/\/ clears the insert row\n        void                    clearInsertRow();\n        ORowSetMatrix::iterator calcPosition() const;\n\n    protected:\n        ORowSetMatrix::iterator& getIterator() { return m_aMatrixIter;}\n        ORowSetMatrix::iterator& getEnd() { return m_aMatrixEnd;}\n        \/\/ is called when after a moveToInsertRow a movement (next, etc) was called\n        void cancelRowModification();\n    public:\n        ORowSetCache(const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet >&,\n                     const ::com::sun::star::uno::Reference< ::com::sun::star::sdb::XSingleSelectQueryAnalyzer >& _xAnalyzer,\n                     const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _xServiceFactory,\n                     const ORowSetValueVector& _rParameterRow,\n                     const ::rtl::OUString& _rUpdateTableName,\n                     sal_Bool&  _bModified,\n                     sal_Bool&  _bNew);\n        ~ORowSetCache();\n\n\n        \/\/ called from the rowset when a updateXXX was called for the first time\n        void setUpdateIterator(const ORowSetMatrix::iterator& _rOriginalRow);\n        ORowSetCacheIterator createIterator(ORowSetBase* _pRowSet);\n        \/\/ sets the size of the matrix\n        void setMaxRowSize(sal_Int32 _nSize);\n\n        TORowSetOldRowHelperRef registerOldRow();\n        void deregisterOldRow(const TORowSetOldRowHelperRef& _rRow);\n\n        void clearModified();\n\n    \/\/ ::com::sun::star::sdbc::XResultSetMetaDataSupplier\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSetMetaData > getMetaData(  );\n\n    \/\/ ::com::sun::star::sdbcx::XRowLocate\n        ::com::sun::star::uno::Any getBookmark(  );\n        sal_Bool moveToBookmark( const ::com::sun::star::uno::Any& bookmark );\n        sal_Bool moveRelativeToBookmark( const ::com::sun::star::uno::Any& bookmark, sal_Int32 rows );\n        sal_Int32 compareBookmarks( const ::com::sun::star::uno::Any& first, const ::com::sun::star::uno::Any& second );\n        sal_Bool hasOrderedBookmarks(  );\n        sal_Int32 hashBookmark( const ::com::sun::star::uno::Any& bookmark );\n\n    \/\/ ::com::sun::star::sdbc::XRowUpdate\n        void updateBinaryStream( sal_Int32 columnIndex, const ::com::sun::star::uno::Reference< ::com::sun::star::io::XInputStream >& x, sal_Int32 length );\n        void updateCharacterStream( sal_Int32 columnIndex, const ::com::sun::star::uno::Reference< ::com::sun::star::io::XInputStream >& x, sal_Int32 length );\n        void updateObject( sal_Int32 columnIndex, const ::com::sun::star::uno::Any& x );\n        void updateNumericObject( sal_Int32 columnIndex, const ::com::sun::star::uno::Any& x, sal_Int32 scale );\n\n    \/\/ ::com::sun::star::sdbc::XResultSet\n        sal_Bool next(  );\n        sal_Bool isBeforeFirst(  );\n        sal_Bool isAfterLast(  );\n        sal_Bool isFirst(  );\n        sal_Bool isLast(  );\n        sal_Bool beforeFirst(  );\n        sal_Bool afterLast(  );\n        sal_Bool first(  );\n        sal_Bool last(  );\n        sal_Int32 getRow(  );\n        sal_Bool absolute( sal_Int32 row );\n        sal_Bool relative( sal_Int32 rows );\n        sal_Bool previous(  );\n        void refreshRow(  );\n        sal_Bool rowUpdated(  );\n        sal_Bool rowInserted(  );\n\n    \/\/ ::com::sun::star::sdbc::XResultSetUpdate\n        sal_Bool insertRow();\n        void resetInsertRow(sal_Bool _bClearInsertRow);\n\n        void updateRow();\n        void updateRow( ORowSetMatrix::iterator& _rUpdateRow );\n        bool deleteRow();\n        void cancelRowUpdates(  );\n        void moveToInsertRow(  );\n        void moveToCurrentRow(  );\n    };\n}\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AppDetailView.hxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-26 14:47:39 $\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_APPDETAILVIEW_HXX\n#define DBAUI_APPDETAILVIEW_HXX\n\n#ifndef _COM_SUN_STAR_FRAME_XCONTROLLER_HPP_\n#include <com\/sun\/star\/frame\/XController.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCONNECTION_HPP_\n#include <com\/sun\/star\/sdbc\/XConnection.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_XCONTENT_HPP_\n#include <com\/sun\/star\/ucb\/XContent.hpp>\n#endif\n#ifndef _SV_SPLIT_HXX\n#include <vcl\/split.hxx>\n#endif\n#ifndef _SV_FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_MNEMONIC_HXX\n#include <vcl\/mnemonic.hxx>\n#endif\n#ifndef DBACCESS_TABLEDESIGN_ICLIPBOARDTEST_HXX\n#include \"IClipBoardTest.hxx\"\n#endif\n#ifndef DBAUI_TITLE_WINDOW_HXX\n#include \"AppTitleWindow.hxx\"\n#endif\n#ifndef DBAUI_APPELEMENTTYPE_HXX\n#include \"AppElementType.hxx\"\n#endif\n#ifndef _SVTREEBOX_HXX\n#include <svtools\/svtreebx.hxx>\n#endif\n#ifndef DBAUI_VERTSPLITVIEW_HXX\n#include \"VertSplitView.hxx\"\n#endif\n\n#include <vector>\n\nclass SvLBoxEntry;\n\nnamespace dbaui\n{\n    class OApplicationController;\n    class OAppBorderWindow;\n    class OApplicationDetailView;\n    class OAppDetailPageHelper;\n    class OTasksWindow;\n\n    class OCreationList : public SvTreeListBox\n    {\n        OTasksWindow&   m_rTaskWindow;\n\n        \/\/ members related to drawing the currently hovered\/selected entry\n        SvLBoxEntry*        m_pMouseDownEntry;\n        SvLBoxEntry*        m_pLastActiveEntry;\n        Color               m_aOriginalBackgroundColor;\n        Font                m_aOriginalFont;\n\n    public:\n        OCreationList( OTasksWindow& _rParent );\n        \/\/ window overloads\n        virtual void MouseMove( const MouseEvent& rMEvt );\n        virtual void MouseButtonDown( const MouseEvent& rMEvt );\n        virtual void MouseButtonUp( const MouseEvent& rMEvt );\n        virtual void KeyInput( const KeyEvent& rKEvt );\n        virtual void Paint( const Rectangle& rRect );\n        virtual void StartDrag( sal_Int8 _nAction, const Point& _rPosPixel );\n        virtual void GetFocus();\n        virtual void LoseFocus();\n\n        inline void resetLastActive() { m_pLastActiveEntry = NULL;}\n\n        void    updateHelpText();\n\n    protected:\n        virtual void        PreparePaint( SvLBoxEntry* _pEntry );\n        virtual Rectangle   GetFocusRect( SvLBoxEntry* _pEntry, long _nLine );\n        virtual void        ModelHasCleared();\n\n        \/\/ IMnemonicEntryList\n        virtual void        SelectSearchEntry( const void* _pEntry );\n        virtual void        ExecuteSearchEntry( const void* _pEntry );\n\n    private:\n        void    onSelected( SvLBoxEntry* _pEntry ) const;\n        \/** sets a new current entry, and invalidates the old and the new one, if necessary\n            @return <TRUE\/> if and only if the \"current entry\" changed\n        *\/\n        bool    setCurrentEntryInvalidate( SvLBoxEntry* _pEntry );\n    };\n\n    struct TaskEntry\n    {\n        ::rtl::OUString sUNOCommand;\n        USHORT          nHelpID;\n        String          sTitle;\n        bool            bHideWhenDisabled;\n            \/\/ TODO: we should be consistent in the task pane and the menus\/toolbars:\n            \/\/ If an entry is disabled in the latter, it should also be disabled in the former.\n            \/\/ If an entry is *hidden* in the former, it should also be hidden in the latter.\n\n        TaskEntry( const sal_Char* _pAsciiUNOCommand, USHORT _nHelpID, USHORT _nTitleResourceID, bool _bHideWhenDisabled = false );\n    };\n    typedef ::std::vector< TaskEntry >  TaskEntryList;\n\n    struct TaskPaneData\n    {\n        \/\/\/ the tasks available in the pane\n        TaskEntryList   aTasks;\n        \/\/\/ the resource ID for the title of the pane\n        USHORT          nTitleId;\n    };\n\n    class OTasksWindow : public Window\n    {\n        OCreationList                       m_aCreation;\n        FixedText                           m_aDescription;\n        FixedText                           m_aHelpText;\n        FixedLine                           m_aFL;\n        OApplicationDetailView*             m_pDetailView;\n\n        DECL_LINK( OnEntrySelectHdl,        SvTreeListBox* );\n        void ImplInitSettings( BOOL bFont, BOOL bForeground, BOOL bBackground );\n    protected:\n        virtual void DataChanged(const DataChangedEvent& rDCEvt);\n    public:\n        OTasksWindow(Window* _pParent,OApplicationDetailView* _pDetailView);\n        virtual ~OTasksWindow();\n\n        \/\/ window overloads\n        virtual void Resize();\n\n        OApplicationDetailView* getDetailView() const { return m_pDetailView; }\n\n        \/\/\/ fills the Creation listbox with the necessary strings and images\n        void fillTaskEntryList( const TaskEntryList& _rList );\n\n        inline bool HandleKeyInput( const KeyEvent& _rKEvt )\n        {\n            return m_aCreation.HandleKeyInput( _rKEvt );\n        }\n\n        void Clear();\n        void setHelpText(USHORT _nId);\n    };\n    \/\/==================================================================\n    class OApplicationDetailView : public OSplitterView\n                                 , public IClipboardTest\n    {\n        Splitter                            m_aHorzSplitter;\n        OTitleWindow                        m_aTasks;\n        OTitleWindow                        m_aContainer;\n        OAppBorderWindow&                   m_rBorderWin;       \/\/ my parent\n        OAppDetailPageHelper*               m_pControlHelper;\n        ::std::vector< TaskPaneData >       m_aTaskPaneData;\n        MnemonicGenerator                   m_aExternalMnemonics;\n\n        void ImplInitSettings( BOOL bFont, BOOL bForeground, BOOL bBackground );\n\n    protected:\n        virtual void DataChanged(const DataChangedEvent& rDCEvt);\n\n    public:\n        OApplicationDetailView(OAppBorderWindow& _rParent,PreviewMode _ePreviewMode);\n        virtual ~OApplicationDetailView();\n        \/\/ window overloads\n        \/\/  virtual void Resize();\n        virtual void GetFocus();\n\n        \/** creates the tables page\n            @param  _xConnection\n                The connection to get the table names\n        *\/\n        void createTablesPage(const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection>& _xConnection);\n\n        \/** creates the page for the specific type.\n            @param  _eType\n                The type which should be created. E_TABLE isn't allowed.\n            @param  _xContainer\n                The container of the elements to be inserted.\n        *\/\n        void createPage(ElementType _eType,const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >& _xContainer);\n\n        void setTaskExternalMnemonics( MnemonicGenerator& _rMnemonics );\n\n        \/** called to give the window the chance to intercept key events, while it has not\n            the focus\n\n            @return <TRUE\/> if and only if the event has been handled, and should not\n                not be further processed\n        *\/\n        bool    interceptKeyInput( const KeyEvent& _rEvent );\n\n        inline OAppBorderWindow& getBorderWin() const { return m_rBorderWin; }\n        inline OTasksWindow& getTasksWindow() const { return *static_cast< OTasksWindow* >( m_aTasks.getChildWindow() ); }\n\n        sal_Bool isCutAllowed() ;\n        sal_Bool isCopyAllowed()    ;\n        sal_Bool isPasteAllowed();\n        virtual sal_Bool hasChildPathFocus() { return HasChildPathFocus(); }\n        void copy();\n        void cut();\n        void paste();\n\n        \/** return the qualified name.\n            @param  _pEntry\n                The entry of a table, or query, form, report to get the qualified name.\n                If the entry is <NULL\/>, the first selected is chosen.\n            @return\n                the qualified name\n        *\/\n        ::rtl::OUString getQualifiedName( SvLBoxEntry* _pEntry ) const;\n\n        \/** returns if an entry is a leaf\n            @param _pEntry\n                The entry to check\n            @return\n                <TRUE\/> if the entry is a leaf, otherwise <FALSE\/>\n        *\/\n        sal_Bool isLeaf(SvLBoxEntry* _pEntry) const;\n\n        \/** returns if one of the selected entries is a leaf\n            @return\n                <TRUE\/> if the entry is a leaf, otherwise <FALSE\/>\n        *\/\n        sal_Bool isALeafSelected() const;\n\n        \/** select all entries in the detail page\n        *\/\n        void selectAll();\n\n        \/\/\/ returns <TRUE\/> if it sorts ascending\n        sal_Bool isSortUp() const;\n\n        \/\/\/ sort the entries in the detail page down\n        void sortDown();\n\n        \/\/\/ sort the entries in the detail page up\n        void sortUp();\n\n        \/\/\/ returns <TRUE\/> when a detail page was filled\n        sal_Bool isFilled() const;\n\n        \/\/\/ return the element of currently select entry\n        ElementType getElementType() const;\n\n        \/** clears the detail pages.\n            @param  _bTaskAlso\n                If <TRUE\/> the task window will also be cleared.\n        *\/\n        void clearPages(sal_Bool _bTaskAlso = sal_True);\n\n        \/\/\/ returns the count of entries\n        sal_Int32 getElementCount();\n\n        \/\/\/ returns the count of selected entries\n        sal_Int32 getSelectionCount();\n\n        \/** returns the element names which are selected\n            @param  _rNames\n                The list will be filled.\n        *\/\n        void getSelectionElementNames(::std::vector< ::rtl::OUString>& _rNames ) const;\n\n        \/** select all names on the currently selected container. Non existence names where ignored.\n        *\n        * \\param _aNames the element names\n        *\/\n        void selectElements(const ::com::sun::star::uno::Sequence< ::rtl::OUString>& _aNames);\n\n        \/** adds a new object to the detail page.\n            @param  _eType\n                The type where the entry shold be appended.\n            @param  _rName\n                The name of the object to be inserted\n            @param  _rObject\n                The object to add.\n            @param  _rxConn\n                If we insert a table, the connection must be set.\n        *\/\n        SvLBoxEntry* elementAdded(ElementType eType\n                        ,const ::rtl::OUString& _rName\n                        ,const ::com::sun::star::uno::Any& _rObject );\n\n        \/** replaces a objects name with a new one\n            @param  _eType\n                The type where the entry shold be appended.\n            @param  _rOldName\n                The old name of the object to be replaced\n            @param  _rNewName\n                The new name of the object to be replaced\n            @param  _rxConn\n                If we insert a table, the connection must be set.\n            @param  _xObject\n                The object which was replaced\n        *\/\n        void elementReplaced(ElementType eType\n                        ,const ::rtl::OUString& _rOldName\n                        ,const ::rtl::OUString& _rNewName );\n\n        \/** removes an element from the detail page.\n            @param  _eType\n                The type where the entry shold be appended.\n            @param  _rName\n                The name of the element to be removed.\n            @param  _rxConn\n                If we remove a table, the connection must be set.\n        *\/\n        void elementRemoved(ElementType _eType\n                            ,const ::rtl::OUString& _rName );\n\n        \/\/\/ returns the preview mode\n        PreviewMode getPreviewMode();\n\n        \/\/\/ <TRUE\/> if the preview is enabled\n        sal_Bool isPreviewEnabled();\n\n\n        \/** switches to the given preview mode\n            @param  _eMode\n                the mode to set for the preview\n        *\/\n        void switchPreview(PreviewMode _eMode);\n\n        \/** shows the Preview of the content when it is enabled.\n            @param  _xContent\n                The content which must support the \"preview\" command.\n        *\/\n        void showPreview(const ::com::sun::star::uno::Reference< ::com::sun::star::ucb::XContent >& _xContent);\n\n        \/** shows the Preview of a table or query\n            @param  _sDataSourceName\n                the name of the data source\n            @param  _sName\n                the name of table or query\n            @param  _bTable\n                <TRUE\/> if it is a table, otherwise <FALSE\/>\n            @return void\n        *\/\n        void showPreview(   const ::rtl::OUString& _sDataSourceName,\n                            const ::rtl::OUString& _sName,\n                            sal_Bool _bTable);\n\n        SvLBoxEntry* getEntry( const Point& _aPoint ) const;\n\n        \/** a command entry was selected\n            @param  _sCommand\n                The command to be executed.\n        *\/\n        void onCreationClick( const ::rtl::OUString& _sCommand);\n\n    private:\n        void                impl_createPage(\n                                ElementType _eType,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _rxConnection,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >& _rxNonTableElements\n                            );\n\n        const TaskPaneData& impl_getTaskPaneData( ElementType _eType );\n        void                impl_fillTaskPaneData( ElementType _eType, TaskPaneData& _rData ) const;\n    };\n}\n#endif \/\/ DBAUI_APPDETAILVIEW_HXX\n\n<commit_msg>INTEGRATION: CWS dba24d (1.17.28); FILE MERGED 2007\/11\/07 14:54:00 oj 1.17.28.1: #i78231# use treelistbox as drag window and not the parent<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AppDetailView.hxx,v $\n *\n *  $Revision: 1.18 $\n *\n *  last change: $Author: rt $ $Date: 2008-01-30 08:42:30 $\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_APPDETAILVIEW_HXX\n#define DBAUI_APPDETAILVIEW_HXX\n\n#ifndef _COM_SUN_STAR_FRAME_XCONTROLLER_HPP_\n#include <com\/sun\/star\/frame\/XController.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCONNECTION_HPP_\n#include <com\/sun\/star\/sdbc\/XConnection.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_XCONTENT_HPP_\n#include <com\/sun\/star\/ucb\/XContent.hpp>\n#endif\n#ifndef _SV_SPLIT_HXX\n#include <vcl\/split.hxx>\n#endif\n#ifndef _SV_FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_MNEMONIC_HXX\n#include <vcl\/mnemonic.hxx>\n#endif\n#ifndef DBACCESS_TABLEDESIGN_ICLIPBOARDTEST_HXX\n#include \"IClipBoardTest.hxx\"\n#endif\n#ifndef DBAUI_TITLE_WINDOW_HXX\n#include \"AppTitleWindow.hxx\"\n#endif\n#ifndef DBAUI_APPELEMENTTYPE_HXX\n#include \"AppElementType.hxx\"\n#endif\n#ifndef _SVTREEBOX_HXX\n#include <svtools\/svtreebx.hxx>\n#endif\n#ifndef DBAUI_VERTSPLITVIEW_HXX\n#include \"VertSplitView.hxx\"\n#endif\n\n#include <vector>\n\nclass SvLBoxEntry;\n\nnamespace dbaui\n{\n    class OApplicationController;\n    class OAppBorderWindow;\n    class OApplicationDetailView;\n    class OAppDetailPageHelper;\n    class OTasksWindow;\n\n    class OCreationList : public SvTreeListBox\n    {\n        OTasksWindow&   m_rTaskWindow;\n\n        \/\/ members related to drawing the currently hovered\/selected entry\n        SvLBoxEntry*        m_pMouseDownEntry;\n        SvLBoxEntry*        m_pLastActiveEntry;\n        Color               m_aOriginalBackgroundColor;\n        Font                m_aOriginalFont;\n\n    public:\n        OCreationList( OTasksWindow& _rParent );\n        \/\/ window overloads\n        virtual void MouseMove( const MouseEvent& rMEvt );\n        virtual void MouseButtonDown( const MouseEvent& rMEvt );\n        virtual void MouseButtonUp( const MouseEvent& rMEvt );\n        virtual void KeyInput( const KeyEvent& rKEvt );\n        virtual void Paint( const Rectangle& rRect );\n        virtual void StartDrag( sal_Int8 _nAction, const Point& _rPosPixel );\n        virtual void GetFocus();\n        virtual void LoseFocus();\n\n        inline void resetLastActive() { m_pLastActiveEntry = NULL;}\n\n        void    updateHelpText();\n\n    protected:\n        virtual void        PreparePaint( SvLBoxEntry* _pEntry );\n        virtual Rectangle   GetFocusRect( SvLBoxEntry* _pEntry, long _nLine );\n        virtual void        ModelHasCleared();\n\n        \/\/ IMnemonicEntryList\n        virtual void        SelectSearchEntry( const void* _pEntry );\n        virtual void        ExecuteSearchEntry( const void* _pEntry );\n\n    private:\n        void    onSelected( SvLBoxEntry* _pEntry ) const;\n        \/** sets a new current entry, and invalidates the old and the new one, if necessary\n            @return <TRUE\/> if and only if the \"current entry\" changed\n        *\/\n        bool    setCurrentEntryInvalidate( SvLBoxEntry* _pEntry );\n    };\n\n    struct TaskEntry\n    {\n        ::rtl::OUString sUNOCommand;\n        USHORT          nHelpID;\n        String          sTitle;\n        bool            bHideWhenDisabled;\n            \/\/ TODO: we should be consistent in the task pane and the menus\/toolbars:\n            \/\/ If an entry is disabled in the latter, it should also be disabled in the former.\n            \/\/ If an entry is *hidden* in the former, it should also be hidden in the latter.\n\n        TaskEntry( const sal_Char* _pAsciiUNOCommand, USHORT _nHelpID, USHORT _nTitleResourceID, bool _bHideWhenDisabled = false );\n    };\n    typedef ::std::vector< TaskEntry >  TaskEntryList;\n\n    struct TaskPaneData\n    {\n        \/\/\/ the tasks available in the pane\n        TaskEntryList   aTasks;\n        \/\/\/ the resource ID for the title of the pane\n        USHORT          nTitleId;\n    };\n\n    class OTasksWindow : public Window\n    {\n        OCreationList                       m_aCreation;\n        FixedText                           m_aDescription;\n        FixedText                           m_aHelpText;\n        FixedLine                           m_aFL;\n        OApplicationDetailView*             m_pDetailView;\n\n        DECL_LINK( OnEntrySelectHdl,        SvTreeListBox* );\n        void ImplInitSettings( BOOL bFont, BOOL bForeground, BOOL bBackground );\n    protected:\n        virtual void DataChanged(const DataChangedEvent& rDCEvt);\n    public:\n        OTasksWindow(Window* _pParent,OApplicationDetailView* _pDetailView);\n        virtual ~OTasksWindow();\n\n        \/\/ window overloads\n        virtual void Resize();\n\n        OApplicationDetailView* getDetailView() const { return m_pDetailView; }\n\n        \/\/\/ fills the Creation listbox with the necessary strings and images\n        void fillTaskEntryList( const TaskEntryList& _rList );\n\n        inline bool HandleKeyInput( const KeyEvent& _rKEvt )\n        {\n            return m_aCreation.HandleKeyInput( _rKEvt );\n        }\n\n        void Clear();\n        void setHelpText(USHORT _nId);\n    };\n    \/\/==================================================================\n    class OApplicationDetailView : public OSplitterView\n                                 , public IClipboardTest\n    {\n        Splitter                            m_aHorzSplitter;\n        OTitleWindow                        m_aTasks;\n        OTitleWindow                        m_aContainer;\n        OAppBorderWindow&                   m_rBorderWin;       \/\/ my parent\n        OAppDetailPageHelper*               m_pControlHelper;\n        ::std::vector< TaskPaneData >       m_aTaskPaneData;\n        MnemonicGenerator                   m_aExternalMnemonics;\n\n        void ImplInitSettings( BOOL bFont, BOOL bForeground, BOOL bBackground );\n\n    protected:\n        virtual void DataChanged(const DataChangedEvent& rDCEvt);\n\n    public:\n        OApplicationDetailView(OAppBorderWindow& _rParent,PreviewMode _ePreviewMode);\n        virtual ~OApplicationDetailView();\n        \/\/ window overloads\n        \/\/  virtual void Resize();\n        virtual void GetFocus();\n\n        \/** creates the tables page\n            @param  _xConnection\n                The connection to get the table names\n        *\/\n        void createTablesPage(const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection>& _xConnection);\n\n        \/** creates the page for the specific type.\n            @param  _eType\n                The type which should be created. E_TABLE isn't allowed.\n            @param  _xContainer\n                The container of the elements to be inserted.\n        *\/\n        void createPage(ElementType _eType,const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >& _xContainer);\n\n        void setTaskExternalMnemonics( MnemonicGenerator& _rMnemonics );\n\n        \/** called to give the window the chance to intercept key events, while it has not\n            the focus\n\n            @return <TRUE\/> if and only if the event has been handled, and should not\n                not be further processed\n        *\/\n        bool    interceptKeyInput( const KeyEvent& _rEvent );\n\n        inline OAppBorderWindow& getBorderWin() const { return m_rBorderWin; }\n        inline OTasksWindow& getTasksWindow() const { return *static_cast< OTasksWindow* >( m_aTasks.getChildWindow() ); }\n\n        sal_Bool isCutAllowed() ;\n        sal_Bool isCopyAllowed()    ;\n        sal_Bool isPasteAllowed();\n        virtual sal_Bool hasChildPathFocus() { return HasChildPathFocus(); }\n        void copy();\n        void cut();\n        void paste();\n\n        \/** return the qualified name.\n            @param  _pEntry\n                The entry of a table, or query, form, report to get the qualified name.\n                If the entry is <NULL\/>, the first selected is chosen.\n            @return\n                the qualified name\n        *\/\n        ::rtl::OUString getQualifiedName( SvLBoxEntry* _pEntry ) const;\n\n        \/** returns if an entry is a leaf\n            @param _pEntry\n                The entry to check\n            @return\n                <TRUE\/> if the entry is a leaf, otherwise <FALSE\/>\n        *\/\n        sal_Bool isLeaf(SvLBoxEntry* _pEntry) const;\n\n        \/** returns if one of the selected entries is a leaf\n            @return\n                <TRUE\/> if the entry is a leaf, otherwise <FALSE\/>\n        *\/\n        sal_Bool isALeafSelected() const;\n\n        \/** select all entries in the detail page\n        *\/\n        void selectAll();\n\n        \/\/\/ returns <TRUE\/> if it sorts ascending\n        sal_Bool isSortUp() const;\n\n        \/\/\/ sort the entries in the detail page down\n        void sortDown();\n\n        \/\/\/ sort the entries in the detail page up\n        void sortUp();\n\n        \/\/\/ returns <TRUE\/> when a detail page was filled\n        sal_Bool isFilled() const;\n\n        \/\/\/ return the element of currently select entry\n        ElementType getElementType() const;\n\n        \/** clears the detail pages.\n            @param  _bTaskAlso\n                If <TRUE\/> the task window will also be cleared.\n        *\/\n        void clearPages(sal_Bool _bTaskAlso = sal_True);\n\n        \/\/\/ returns the count of entries\n        sal_Int32 getElementCount();\n\n        \/\/\/ returns the count of selected entries\n        sal_Int32 getSelectionCount();\n\n        \/** returns the element names which are selected\n            @param  _rNames\n                The list will be filled.\n        *\/\n        void getSelectionElementNames(::std::vector< ::rtl::OUString>& _rNames ) const;\n\n        \/** select all names on the currently selected container. Non existence names where ignored.\n        *\n        * \\param _aNames the element names\n        *\/\n        void selectElements(const ::com::sun::star::uno::Sequence< ::rtl::OUString>& _aNames);\n\n        \/** adds a new object to the detail page.\n            @param  _eType\n                The type where the entry shold be appended.\n            @param  _rName\n                The name of the object to be inserted\n            @param  _rObject\n                The object to add.\n            @param  _rxConn\n                If we insert a table, the connection must be set.\n        *\/\n        SvLBoxEntry* elementAdded(ElementType eType\n                        ,const ::rtl::OUString& _rName\n                        ,const ::com::sun::star::uno::Any& _rObject );\n\n        \/** replaces a objects name with a new one\n            @param  _eType\n                The type where the entry shold be appended.\n            @param  _rOldName\n                The old name of the object to be replaced\n            @param  _rNewName\n                The new name of the object to be replaced\n            @param  _rxConn\n                If we insert a table, the connection must be set.\n            @param  _xObject\n                The object which was replaced\n        *\/\n        void elementReplaced(ElementType eType\n                        ,const ::rtl::OUString& _rOldName\n                        ,const ::rtl::OUString& _rNewName );\n\n        \/** removes an element from the detail page.\n            @param  _eType\n                The type where the entry shold be appended.\n            @param  _rName\n                The name of the element to be removed.\n            @param  _rxConn\n                If we remove a table, the connection must be set.\n        *\/\n        void elementRemoved(ElementType _eType\n                            ,const ::rtl::OUString& _rName );\n\n        \/\/\/ returns the preview mode\n        PreviewMode getPreviewMode();\n\n        \/\/\/ <TRUE\/> if the preview is enabled\n        sal_Bool isPreviewEnabled();\n\n\n        \/** switches to the given preview mode\n            @param  _eMode\n                the mode to set for the preview\n        *\/\n        void switchPreview(PreviewMode _eMode);\n\n        \/** shows the Preview of the content when it is enabled.\n            @param  _xContent\n                The content which must support the \"preview\" command.\n        *\/\n        void showPreview(const ::com::sun::star::uno::Reference< ::com::sun::star::ucb::XContent >& _xContent);\n\n        \/** shows the Preview of a table or query\n            @param  _sDataSourceName\n                the name of the data source\n            @param  _sName\n                the name of table or query\n            @param  _bTable\n                <TRUE\/> if it is a table, otherwise <FALSE\/>\n            @return void\n        *\/\n        void showPreview(   const ::rtl::OUString& _sDataSourceName,\n                            const ::rtl::OUString& _sName,\n                            sal_Bool _bTable);\n\n        SvLBoxEntry* getEntry( const Point& _aPoint ) const;\n\n        \/** a command entry was selected\n            @param  _sCommand\n                The command to be executed.\n        *\/\n        void onCreationClick( const ::rtl::OUString& _sCommand);\n        Window* getTreeWindow() const;\n    private:\n        void                impl_createPage(\n                                ElementType _eType,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _rxConnection,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >& _rxNonTableElements\n                            );\n\n        const TaskPaneData& impl_getTaskPaneData( ElementType _eType );\n        void                impl_fillTaskPaneData( ElementType _eType, TaskPaneData& _rData ) const;\n    };\n}\n#endif \/\/ DBAUI_APPDETAILVIEW_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: VertSplitView.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 15:41: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#ifndef DBAUI_VERTSPLITVIEW_HXX\n#define DBAUI_VERTSPLITVIEW_HXX\n\n#ifndef _SV_SPLIT_HXX\n#include <vcl\/split.hxx>\n#endif\n\nnamespace dbaui\n{\n    \/\/==================================================================\n    class OSplitterView : public Window\n    {\n        Splitter*                           m_pSplitter;\n        Window*                             m_pLeft;\n        Window*                             m_pRight;\n        sal_Bool                            m_bVertical;\n\n        void ImplInitSettings( BOOL bFont, BOOL bForeground, BOOL bBackground );\n        DECL_LINK( SplitHdl, Splitter* );\n    protected:\n        virtual void DataChanged(const DataChangedEvent& rDCEvt);\n    public:\n        OSplitterView(Window* _pParent,sal_Bool _bVertical = sal_True);\n        virtual ~OSplitterView();\n        \/\/ window overloads\n        virtual void GetFocus();\n\n        void setSplitter(Splitter* _pSplitter);\n        void set(Window* _pRight,Window* _pLeft = NULL);\n        virtual void Resize();\n    };\n}\n#endif \/\/ DBAUI_VERTSPLITVIEW_HXX\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.4.434); FILE MERGED 2008\/03\/31 13:27:44 rt 1.4.434.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: VertSplitView.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 DBAUI_VERTSPLITVIEW_HXX\n#define DBAUI_VERTSPLITVIEW_HXX\n\n#ifndef _SV_SPLIT_HXX\n#include <vcl\/split.hxx>\n#endif\n\nnamespace dbaui\n{\n    \/\/==================================================================\n    class OSplitterView : public Window\n    {\n        Splitter*                           m_pSplitter;\n        Window*                             m_pLeft;\n        Window*                             m_pRight;\n        sal_Bool                            m_bVertical;\n\n        void ImplInitSettings( BOOL bFont, BOOL bForeground, BOOL bBackground );\n        DECL_LINK( SplitHdl, Splitter* );\n    protected:\n        virtual void DataChanged(const DataChangedEvent& rDCEvt);\n    public:\n        OSplitterView(Window* _pParent,sal_Bool _bVertical = sal_True);\n        virtual ~OSplitterView();\n        \/\/ window overloads\n        virtual void GetFocus();\n\n        void setSplitter(Splitter* _pSplitter);\n        void set(Window* _pRight,Window* _pLeft = NULL);\n        virtual void Resize();\n    };\n}\n#endif \/\/ DBAUI_VERTSPLITVIEW_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\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 \"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.2  1999\/12\/23 01:43:37  aruna1\n * MsgCatalog support added for solaris\n *\n * Revision 1.1.1.1  1999\/11\/09 01:07:16  twl\n * Initial checkin\n *\n * Revision 1.2  1999\/11\/08 20:45:27  rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <util\/XML4CDefs.hpp>\n#include <util\/PlatformUtils.hpp>\n#include <util\/XMLMsgLoader.hpp>\n#include <util\/XMLString.hpp>\n#include <util\/XMLUni.hpp>\n#include \"MsgCatalogLoader.hpp\"\n\n#include <locale.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Public Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nMsgCatalogLoader::MsgCatalogLoader(const XMLCh* const msgDomain) :\n\n    fCatalogHandle(0)\n    , fMsgDomain(0)\n{\n    \/\/ Try to get the module handle\n\tchar* tempLoc = setlocale(LC_ALL, \"\");\n    char catfile[256];\n    if (XMLPlatformUtils::fgLibLocation) {\n        strcpy(catfile, XMLPlatformUtils::fgLibLocation);\n        strcat(catfile, \"\/msg\/\");\n        strcat(catfile, \"XMLMessages.cat\");\n    }\n\tfCatalogHandle = catopen(catfile , 0);\n    if ((int)fCatalogHandle == -1)\n    {\n        \/\/ Probably have to call panic here\n\t\tprintf(\"Could not open catalog XMLMessages\\n\");\n\t\t\/\/ TBD: Tell user what the locale is\n\t\texit(1);\n    }\n\n    fMsgDomain = XMLString::replicate(msgDomain);\n}\n\nMsgCatalogLoader::~MsgCatalogLoader()\n{\n    if (fCatalogHandle)\n\tcatclose( fCatalogHandle );\t\n    delete fMsgDomain;\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Implementation of the virtual message loader API\n\/\/ ---------------------------------------------------------------------------\nbool MsgCatalogLoader::loadMsg(const  XMLMsgLoader::XMLMsgId  msgToLoad\n                            ,       XMLCh* const            toFill\n                            , const unsigned long           maxChars)\n{\n    int msgSet = 1;\n    if (!XMLString::compareString(fMsgDomain, XMLUni::fgXMLErrDomain))\n        msgSet = 1;\n    else if (!XMLString::compareString(fMsgDomain, XMLUni::fgExceptDomain))\n        msgSet = 2;\n    else if (!XMLString::compareString(fMsgDomain, XMLUni::fgValidityDomain))\n        msgSet = 3;\n\n    char msgString[100];\n    sprintf(msgString, \"Could not find message ID %d from message set %d\\n\", msgToLoad, msgSet);\n    char* catMessage = catgets( fCatalogHandle, msgSet, (int)msgToLoad, msgString);\n    XMLString::copyString((XMLCh*)toFill,  XMLString::transcode(catMessage));\n\t\n    return true;\n}\n\n\nbool MsgCatalogLoader::loadMsg(const  XMLMsgLoader::XMLMsgId  msgToLoad\n                            ,       XMLCh* const            toFill\n                            , const unsigned long           maxChars\n                            , const XMLCh* const            repText1\n                            , const XMLCh* const            repText2\n                            , const XMLCh* const            repText3\n                            , const XMLCh* const            repText4)\n{\n    \/\/ Call the other version to load up the message\n    if (!loadMsg(msgToLoad, toFill, maxChars))\n        return false;\n\n    \/\/ And do the token replacement\n    XMLString::replaceTokens(toFill, maxChars, repText1, repText2, repText3, repText4);\n    return true;\n}\n\n\nbool MsgCatalogLoader::loadMsg(const  XMLMsgLoader::XMLMsgId  msgToLoad\n                            ,       XMLCh* const            toFill\n                            , const unsigned long           maxChars\n                            , const char* const             repText1\n                            , const char* const             repText2\n                            , const char* const             repText3\n                            , const char* const             repText4)\n{\n    \/\/\n    \/\/  Transcode the provided parameters and call the other version,\n    \/\/  which will do the replacement work.\n    \/\/\n    XMLCh* tmp1 = 0;\n    XMLCh* tmp2 = 0;\n    XMLCh* tmp3 = 0;\n    XMLCh* tmp4 = 0;\n\n    bool bRet = false;\n    if (repText1)\n        tmp1 = XMLString::transcode(repText1);\n    if (repText2)\n        tmp2 = XMLString::transcode(repText2);\n    if (repText3)\n        tmp3 = XMLString::transcode(repText3);\n    if (repText4)\n        tmp4 = XMLString::transcode(repText4);\n\n    bRet = loadMsg(msgToLoad, toFill, maxChars, tmp1, tmp2, tmp3, tmp4);\n\n    if (tmp1)\n        delete [] tmp1;\n    if (tmp2)\n        delete [] tmp2;\n    if (tmp3)\n        delete [] tmp3;\n    if (tmp4)\n        delete [] tmp4;\n\n    return bRet;\n}\n<commit_msg>Modified message 'set' attribute reading sequence. Removed dependencies on  hard coded constants<commit_after>\/*\n * The Apache Software License, Version 1.1\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 \"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.3  2000\/01\/05 22:00:22  aruna1\n * Modified message 'set' attribute reading sequence. Removed dependencies on  hard coded constants\n *\n * Revision 1.2  1999\/12\/23 01:43:37  aruna1\n * MsgCatalog support added for solaris\n *\n * Revision 1.1.1.1  1999\/11\/09 01:07:16  twl\n * Initial checkin\n *\n * Revision 1.2  1999\/11\/08 20:45:27  rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <util\/XML4CDefs.hpp>\n#include <util\/PlatformUtils.hpp>\n#include <util\/XMLMsgLoader.hpp>\n#include <util\/XMLString.hpp>\n#include <util\/XMLUni.hpp>\n#include \"MsgCatalogLoader.hpp\"\n#include \"XMLMsgCat_Ids.hpp\"\n\n#include <locale.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Public Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nMsgCatalogLoader::MsgCatalogLoader(const XMLCh* const msgDomain) :\n\n    fCatalogHandle(0)\n    , fMsgDomain(0)\n{\n    \/\/ Try to get the module handle\n\tchar* tempLoc = setlocale(LC_ALL, \"\");\n    char catfile[256];\n    if (XMLPlatformUtils::fgLibLocation) {\n        strcpy(catfile, XMLPlatformUtils::fgLibLocation);\n        strcat(catfile, \"\/msg\/\");\n        strcat(catfile, \"XMLMessages.cat\");\n    }\n\tfCatalogHandle = catopen(catfile , 0);\n    if ((int)fCatalogHandle == -1)\n    {\n        \/\/ Probably have to call panic here\n\t\tprintf(\"Could not open catalog XMLMessages\\n\");\n\t\t\/\/ TBD: Tell user what the locale is\n\t\texit(1);\n    }\n\n    fMsgDomain = XMLString::replicate(msgDomain);\n}\n\nMsgCatalogLoader::~MsgCatalogLoader()\n{\n    if (fCatalogHandle)\n\tcatclose( fCatalogHandle );\t\n    delete fMsgDomain;\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Implementation of the virtual message loader API\n\/\/ ---------------------------------------------------------------------------\nbool MsgCatalogLoader::loadMsg(const  XMLMsgLoader::XMLMsgId  msgToLoad\n                            ,       XMLCh* const            toFill\n                            , const unsigned long           maxChars)\n{\n    int msgSet = CatId_XML4CErrs;\n    if (!XMLString::compareString(fMsgDomain, XMLUni::fgXMLErrDomain))\n        msgSet = CatId_XML4CErrs;\n    else if (!XMLString::compareString(fMsgDomain, XMLUni::fgExceptDomain))\n        msgSet = CatId_XML4CExcepts;\n    else if (!XMLString::compareString(fMsgDomain, XMLUni::fgValidityDomain))\n        msgSet = CatId_XML4CValid;\n\n    char msgString[100];\n    sprintf(msgString, \"Could not find message ID %d from message set %d\\n\", msgToLoad, msgSet);\n    char* catMessage = catgets( fCatalogHandle, msgSet, (int)msgToLoad, msgString);\n    XMLString::copyString((XMLCh*)toFill,  XMLString::transcode(catMessage));\n\t\n    return true;\n}\n\n\nbool MsgCatalogLoader::loadMsg(const  XMLMsgLoader::XMLMsgId  msgToLoad\n                            ,       XMLCh* const            toFill\n                            , const unsigned long           maxChars\n                            , const XMLCh* const            repText1\n                            , const XMLCh* const            repText2\n                            , const XMLCh* const            repText3\n                            , const XMLCh* const            repText4)\n{\n    \/\/ Call the other version to load up the message\n    if (!loadMsg(msgToLoad, toFill, maxChars))\n        return false;\n\n    \/\/ And do the token replacement\n    XMLString::replaceTokens(toFill, maxChars, repText1, repText2, repText3, repText4);\n    return true;\n}\n\n\nbool MsgCatalogLoader::loadMsg(const  XMLMsgLoader::XMLMsgId  msgToLoad\n                            ,       XMLCh* const            toFill\n                            , const unsigned long           maxChars\n                            , const char* const             repText1\n                            , const char* const             repText2\n                            , const char* const             repText3\n                            , const char* const             repText4)\n{\n    \/\/\n    \/\/  Transcode the provided parameters and call the other version,\n    \/\/  which will do the replacement work.\n    \/\/\n    XMLCh* tmp1 = 0;\n    XMLCh* tmp2 = 0;\n    XMLCh* tmp3 = 0;\n    XMLCh* tmp4 = 0;\n\n    bool bRet = false;\n    if (repText1)\n        tmp1 = XMLString::transcode(repText1);\n    if (repText2)\n        tmp2 = XMLString::transcode(repText2);\n    if (repText3)\n        tmp3 = XMLString::transcode(repText3);\n    if (repText4)\n        tmp4 = XMLString::transcode(repText4);\n\n    bRet = loadMsg(msgToLoad, toFill, maxChars, tmp1, tmp2, tmp3, tmp4);\n\n    if (tmp1)\n        delete [] tmp1;\n    if (tmp2)\n        delete [] tmp2;\n    if (tmp3)\n        delete [] tmp3;\n    if (tmp4)\n        delete [] tmp4;\n\n    return bRet;\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.3  2001\/05\/11 13:27:17  tng\n * Copyright update.\n *\n * Revision 1.2  2001\/04\/19 18:17:28  tng\n * Schema: SchemaValidator update, and use QName in Content Model\n *\n * Revision 1.1  2001\/02\/27 14:48:49  tng\n * Schema: Add CMAny and ContentLeafNameTypeVector, by Pei Yong Zhang\n *\n *\/\n\n\n#if !defined(CONTENTLEAFNAMETYPEVECTOR_HPP)\n#define CONTENTLEAFNAMETYPEVECTOR_HPP\n\n#include <util\/XercesDefs.hpp>\n#include <util\/ValueVectorOf.hpp>\n#include <validators\/common\/ContentSpecNode.hpp>\n\nclass ContentLeafNameTypeVector\n{\npublic :\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Class specific types\n    \/\/ -----------------------------------------------------------------------\n\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Constructors and Destructor\n    \/\/ -----------------------------------------------------------------------\n    ContentLeafNameTypeVector();\n    ContentLeafNameTypeVector\n    (\n        QName** const                      qName\n      , ContentSpecNode::NodeTypes* const  types\n      , const unsigned int                       count\n    );\n\n    ~ContentLeafNameTypeVector();\n\n    ContentLeafNameTypeVector(const ContentLeafNameTypeVector&);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Getter methods\n    \/\/ -----------------------------------------------------------------------\n    QName* getLeafNameAt(const unsigned int pos) const;\n\n    const ContentSpecNode::NodeTypes getLeafTypeAt(const unsigned int pos) const;\n    const unsigned int getLeafCount() const;\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Setter methods\n    \/\/ -----------------------------------------------------------------------\n    void setValues\n    (\n        QName** const                      qName\n      , ContentSpecNode::NodeTypes* const  types\n      , const unsigned int                       count\n    );\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Miscellaneous\n    \/\/ -----------------------------------------------------------------------\n\nprivate :\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Unimplemented constructors and operators\n    \/\/ -----------------------------------------------------------------------\n    void operator=(const ContentLeafNameTypeVector&);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  helper methods\n    \/\/ -----------------------------------------------------------------------\n    void cleanUp();\n    void init(const unsigned int);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Private Data Members\n    \/\/\n    \/\/ -----------------------------------------------------------------------\n    QName**                       fLeafNames;\n    ContentSpecNode::NodeTypes   *fLeafTypes;\n    unsigned int                  fLeafCount;\n};\n\ninline void ContentLeafNameTypeVector::cleanUp()\n{\n\tdelete [] fLeafNames;\n\tdelete [] fLeafTypes;\n}\n\ninline void ContentLeafNameTypeVector::init(const unsigned int size)\n{\n\tfLeafNames = new QName*[size];\n\tfLeafTypes = new ContentSpecNode::NodeTypes [size];\n}\n\n#endif\n<commit_msg>The value of 'fLeafCount' was not set.<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.4  2001\/08\/07 15:21:20  knoaman\n * The value of 'fLeafCount' was not set.\n *\n * Revision 1.3  2001\/05\/11 13:27:17  tng\n * Copyright update.\n *\n * Revision 1.2  2001\/04\/19 18:17:28  tng\n * Schema: SchemaValidator update, and use QName in Content Model\n *\n * Revision 1.1  2001\/02\/27 14:48:49  tng\n * Schema: Add CMAny and ContentLeafNameTypeVector, by Pei Yong Zhang\n *\n *\/\n\n\n#if !defined(CONTENTLEAFNAMETYPEVECTOR_HPP)\n#define CONTENTLEAFNAMETYPEVECTOR_HPP\n\n#include <util\/XercesDefs.hpp>\n#include <util\/ValueVectorOf.hpp>\n#include <validators\/common\/ContentSpecNode.hpp>\n\nclass ContentLeafNameTypeVector\n{\npublic :\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Class specific types\n    \/\/ -----------------------------------------------------------------------\n\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Constructors and Destructor\n    \/\/ -----------------------------------------------------------------------\n    ContentLeafNameTypeVector();\n    ContentLeafNameTypeVector\n    (\n        QName** const                      qName\n      , ContentSpecNode::NodeTypes* const  types\n      , const unsigned int                       count\n    );\n\n    ~ContentLeafNameTypeVector();\n\n    ContentLeafNameTypeVector(const ContentLeafNameTypeVector&);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Getter methods\n    \/\/ -----------------------------------------------------------------------\n    QName* getLeafNameAt(const unsigned int pos) const;\n\n    const ContentSpecNode::NodeTypes getLeafTypeAt(const unsigned int pos) const;\n    const unsigned int getLeafCount() const;\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Setter methods\n    \/\/ -----------------------------------------------------------------------\n    void setValues\n    (\n        QName** const                      qName\n      , ContentSpecNode::NodeTypes* const  types\n      , const unsigned int                       count\n    );\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Miscellaneous\n    \/\/ -----------------------------------------------------------------------\n\nprivate :\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Unimplemented constructors and operators\n    \/\/ -----------------------------------------------------------------------\n    void operator=(const ContentLeafNameTypeVector&);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  helper methods\n    \/\/ -----------------------------------------------------------------------\n    void cleanUp();\n    void init(const unsigned int);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Private Data Members\n    \/\/\n    \/\/ -----------------------------------------------------------------------\n    QName**                       fLeafNames;\n    ContentSpecNode::NodeTypes   *fLeafTypes;\n    unsigned int                  fLeafCount;\n};\n\ninline void ContentLeafNameTypeVector::cleanUp()\n{\n\tdelete [] fLeafNames;\n\tdelete [] fLeafTypes;\n}\n\ninline void ContentLeafNameTypeVector::init(const unsigned int size)\n{\n\tfLeafNames = new QName*[size];\n\tfLeafTypes = new ContentSpecNode::NodeTypes [size];\n\tfLeafCount = size;\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/******* COPYRIGHT ************************************************\n*                                                                 *\n*                         FlowVR Render                           *\n*                   Parallel Rendering Modules                    *\n*                                                                 *\n*-----------------------------------------------------------------*\n* COPYRIGHT (C) 2005 by                                           *\n* Laboratoire Informatique et Distribution (UMR5132) and          *\n* INRIA Project MOVI. ALL RIGHTS RESERVED.                        *\n*                                                                 *\n* This source is covered by the GNU GPL, please refer to the      *\n* COPYING file for further information.                           *\n*                                                                 *\n*-----------------------------------------------------------------*\n*                                                                 *\n*  Original Contributors:                                         *\n*    Jeremie Allard,                                              *\n*    Clement Menier.                                              *\n*                                                                 *\n*******************************************************************\n*                                                                 *\n* File: .\/src\/utils\/meshconv.cpp                                  *\n*                                                                 *\n* Contacts:                                                       *\n*                                                                 *\n******************************************************************\/\n#include <math.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n#include <ftl\/cmdline.h>\n#include <flowvr\/render\/mesh.h>\n\nusing namespace flowvr::render;\n\nint main(int argc, char** argv)\n{\n    bool normalize = false;\n    bool flip = false;\n    bool wnormals = false;\n    bool rnormals = false;\n    bool rtexcoords = false;\n    bool closemesh = false;\n    Vec3f translation;\n    Vec3f rotation;\n    Vec3f scale(1,1,1);\n    ftl::CmdLine cmd(\"Usage: meshconv [options] mesh.input [mesh.output]\");\n    cmd.opt(\"normalize\",'n',\"transform points so that the center is at <0,0,0> and the max coodinate is 1\",&normalize);\n    cmd.opt(\"flip\",'f',\"flip normals\",&flip);\n    cmd.opt(\"wnormals\",'N',\"force writing of normals\",&wnormals);\n    cmd.opt(\"rnormals\",'O',\"remove normals\",&rnormals);\n    cmd.opt(\"rtexcoords\",'T',\"remove texcoords\",&rtexcoords);\n    cmd.opt(\"close\",'c',\"close mesh\",&closemesh);\n    cmd.opt(\"translate\",'t',\"translate the mesh\",&translation);\n    cmd.opt(\"rotate\",'r',\"rotate the mesh using euler angles in degree\",&rotation);\n    cmd.opt(\"scale\",'s',\"scale the mesh using 3 coefficients\",&scale);\n    bool error=false;\n    if (!cmd.parse(argc,argv,&error))\n        return error?1:0;\n\n    if (cmd.args.size()<1 || cmd.args.size()>2)\n    {\n        std::cerr << cmd.help() << std::endl;\n        return 1;\n    }\n\n    std::string file_in = cmd.args[0];\n    std::string file_out;\n    if (cmd.args.size()>=2) file_out = cmd.args[1];\n\n    Mesh obj;\n\n    if (!obj.load(file_in.c_str()))\n    {\n        std::cerr << \"Failed to read \"<<file_in<<std::endl;\n        return 1;\n    }\n\n    if (normalize)\n    {\n        BBox bb = obj.calcBBox();\n        std::cout << \"Mesh bbox=\"<<bb<<std::endl;\n        std::cout << \"Normalizing mesh...\"<<std::endl;\n        float size = 0;\n        for (int i=0; i<3; i++)\n        {\n            float d = bb.b[i]-bb.a[i];\n            if (d>size) size=d;\n        }\n        Vec3f center = (bb.a+bb.b)*0.5;\n        float sc = 2\/size;\n        Mat4x4f m; m.identity();\n        m(0,0)=sc; m(0,3) = -center[0]*sc;\n        m(1,1)=sc; m(1,3) = -center[1]*sc;\n        m(2,2)=sc; m(2,3) = -center[2]*sc;\n        for (int i=0; i<obj.nbp(); i++)\n            obj.PP(i) = transform(m,obj.getPP(i));\n    }\n\n    if (scale != Vec3f(1,1,1))\n    {\n        std::cout << \"Scaling mesh...\"<<std::endl;\n        for (int i=0; i<obj.nbp(); i++)\n        {\n            Vec3f p = obj.getPP(i);\n            p[0] *= scale[0];\n            p[1] *= scale[1];\n            p[2] *= scale[2];\n            obj.PP(i) = p;\n        }\n    }\n\n    if (rotation != Vec3f(0,0,0))\n    {\n        std::cout << \"Rotating mesh...\"<<std::endl;\n        Mat3x3f mat;\n        Quat qx,qy,qz;\n        qx.fromDegreeAngAxis(rotation[0],Vec3f(1,0,0));\n        qy.fromDegreeAngAxis(rotation[1],Vec3f(0,1,0));\n        qz.fromDegreeAngAxis(rotation[2],Vec3f(0,0,1));\n        Quat q = qx*qy*qz;\n        q.toMatrix(&mat);\n        for (int i=0; i<obj.nbp(); i++)\n        {\n            obj.PP(i) = mat*obj.getPP(i);\n            obj.PN(i) = mat*obj.getPN(i);\n        }\n    }\n\n    if (translation != Vec3f(0,0,0))\n    {\n        std::cout << \"Translating mesh...\"<<std::endl;\n        for (int i=0; i<obj.nbp(); i++)\n        {\n            obj.PP(i) = obj.getPP(i) + translation;\n        }\n    }\n\n    std::cout << \"Mesh bbox=\"<<obj.calcBBox()<<std::endl;\n    if (flip)\n    {\n        std::cout << \"Flipping mesh...\"<<std::endl;\n        obj.flipAll();\n        \/\/obj.calcFlip();\n    }\n    if (closemesh)\n    {\n        bool closed = obj.isClosed();\n        std::cout << \"Mesh is \"<<(closed?\"\":\"NOT \")<<\"closed.\"<<std::endl;\n        if (!closed)\n        {\n            obj.calcFlip();\n            std::cout << \"Closing mesh...\"<<std::endl;\n            obj.close();\n            std::cout << \"Mesh is \"<<(obj.isClosed()?\"\":\"NOT \")<<\"closed.\"<<std::endl;\n        }\n    }\n    if (wnormals)\n        obj.setAttrib(Mesh::MESH_POINTS_NORMAL,true);\n    if (rnormals)\n        obj.setAttrib(Mesh::MESH_POINTS_NORMAL,false);\n    if (rtexcoords)\n        obj.setAttrib(Mesh::MESH_POINTS_TEXCOORD,false);\n    if (!file_out.empty())\n    {\n        std::cout << \"Saving result...\"<<std::endl;\n        obj.save(file_out.c_str());\n    }\n    return 0;\n}\n<commit_msg>r1554\/sofa-dev : ADD dilate option (-d) in meshconv<commit_after>\/******* COPYRIGHT ************************************************\n*                                                                 *\n*                         FlowVR Render                           *\n*                   Parallel Rendering Modules                    *\n*                                                                 *\n*-----------------------------------------------------------------*\n* COPYRIGHT (C) 2005 by                                           *\n* Laboratoire Informatique et Distribution (UMR5132) and          *\n* INRIA Project MOVI. ALL RIGHTS RESERVED.                        *\n*                                                                 *\n* This source is covered by the GNU GPL, please refer to the      *\n* COPYING file for further information.                           *\n*                                                                 *\n*-----------------------------------------------------------------*\n*                                                                 *\n*  Original Contributors:                                         *\n*    Jeremie Allard,                                              *\n*    Clement Menier.                                              *\n*                                                                 *\n*******************************************************************\n*                                                                 *\n* File: .\/src\/utils\/meshconv.cpp                                  *\n*                                                                 *\n* Contacts:                                                       *\n*                                                                 *\n******************************************************************\/\n#include <math.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n#include <ftl\/cmdline.h>\n#include <flowvr\/render\/mesh.h>\n\nusing namespace flowvr::render;\n\nint main(int argc, char** argv)\n{\n    bool normalize = false;\n    bool flip = false;\n    bool wnormals = false;\n    bool rnormals = false;\n    bool rtexcoords = false;\n    bool closemesh = false;\n    Vec3f translation;\n    Vec3f rotation;\n    Vec3f scale(1,1,1);\n    float dilate = 0.0f;\n    ftl::CmdLine cmd(\"Usage: meshconv [options] mesh.input [mesh.output]\");\n    cmd.opt(\"normalize\",'n',\"transform points so that the center is at <0,0,0> and the max coodinate is 1\",&normalize);\n    cmd.opt(\"flip\",'f',\"flip normals\",&flip);\n    cmd.opt(\"wnormals\",'N',\"force writing of normals\",&wnormals);\n    cmd.opt(\"rnormals\",'O',\"remove normals\",&rnormals);\n    cmd.opt(\"rtexcoords\",'T',\"remove texcoords\",&rtexcoords);\n    cmd.opt(\"close\",'c',\"close mesh\",&closemesh);\n    cmd.opt(\"translate\",'t',\"translate the mesh\",&translation);\n    cmd.opt(\"rotate\",'r',\"rotate the mesh using euler angles in degree\",&rotation);\n    cmd.opt(\"scale\",'s',\"scale the mesh using 3 coefficients\",&scale);\n    cmd.opt(\"dilate\",'d',\"dilate (i.e. displace vertices of the given distance along their normals)\",&dilate);\n    bool error=false;\n    if (!cmd.parse(argc,argv,&error))\n        return error?1:0;\n\n    if (cmd.args.size()<1 || cmd.args.size()>2)\n    {\n        std::cerr << cmd.help() << std::endl;\n        return 1;\n    }\n\n    std::string file_in = cmd.args[0];\n    std::string file_out;\n    if (cmd.args.size()>=2) file_out = cmd.args[1];\n\n    Mesh obj;\n\n    if (!obj.load(file_in.c_str()))\n    {\n        std::cerr << \"Failed to read \"<<file_in<<std::endl;\n        return 1;\n    }\n\n    if (normalize)\n    {\n        BBox bb = obj.calcBBox();\n        std::cout << \"Mesh bbox=\"<<bb<<std::endl;\n        std::cout << \"Normalizing mesh...\"<<std::endl;\n        float size = 0;\n        for (int i=0; i<3; i++)\n        {\n            float d = bb.b[i]-bb.a[i];\n            if (d>size) size=d;\n        }\n        Vec3f center = (bb.a+bb.b)*0.5;\n        float sc = 2\/size;\n        Mat4x4f m; m.identity();\n        m(0,0)=sc; m(0,3) = -center[0]*sc;\n        m(1,1)=sc; m(1,3) = -center[1]*sc;\n        m(2,2)=sc; m(2,3) = -center[2]*sc;\n        for (int i=0; i<obj.nbp(); i++)\n            obj.PP(i) = transform(m,obj.getPP(i));\n    }\n\n    if (scale != Vec3f(1,1,1))\n    {\n        std::cout << \"Scaling mesh...\"<<std::endl;\n        for (int i=0; i<obj.nbp(); i++)\n        {\n            Vec3f p = obj.getPP(i);\n            p[0] *= scale[0];\n            p[1] *= scale[1];\n            p[2] *= scale[2];\n            obj.PP(i) = p;\n        }\n    }\n\n    if (rotation != Vec3f(0,0,0))\n    {\n        std::cout << \"Rotating mesh...\"<<std::endl;\n        Mat3x3f mat;\n        Quat qx,qy,qz;\n        qx.fromDegreeAngAxis(rotation[0],Vec3f(1,0,0));\n        qy.fromDegreeAngAxis(rotation[1],Vec3f(0,1,0));\n        qz.fromDegreeAngAxis(rotation[2],Vec3f(0,0,1));\n        Quat q = qx*qy*qz;\n        q.toMatrix(&mat);\n        for (int i=0; i<obj.nbp(); i++)\n        {\n            obj.PP(i) = mat*obj.getPP(i);\n            obj.PN(i) = mat*obj.getPN(i);\n        }\n    }\n\n    if (translation != Vec3f(0,0,0))\n    {\n        std::cout << \"Translating mesh...\"<<std::endl;\n        for (int i=0; i<obj.nbp(); i++)\n        {\n            obj.PP(i) = obj.getPP(i) + translation;\n        }\n    }\n\n    std::cout << \"Mesh bbox=\"<<obj.calcBBox()<<std::endl;\n    if (flip)\n    {\n        std::cout << \"Flipping mesh...\"<<std::endl;\n        obj.flipAll();\n        \/\/obj.calcFlip();\n    }\n    if (closemesh)\n    {\n        bool closed = obj.isClosed();\n        std::cout << \"Mesh is \"<<(closed?\"\":\"NOT \")<<\"closed.\"<<std::endl;\n        if (!closed)\n        {\n            obj.calcFlip();\n            std::cout << \"Closing mesh...\"<<std::endl;\n            obj.close();\n            std::cout << \"Mesh is \"<<(obj.isClosed()?\"\":\"NOT \")<<\"closed.\"<<std::endl;\n        }\n    }\n\n    if (dilate != 0.0f)\n        obj.dilate(dilate);\n\n    if (wnormals)\n        obj.setAttrib(Mesh::MESH_POINTS_NORMAL,true);\n    if (rnormals)\n        obj.setAttrib(Mesh::MESH_POINTS_NORMAL,false);\n    if (rtexcoords)\n        obj.setAttrib(Mesh::MESH_POINTS_TEXCOORD,false);\n    if (!file_out.empty())\n    {\n        std::cout << \"Saving result...\"<<std::endl;\n        obj.save(file_out.c_str());\n    }\n    return 0;\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\/\/ HEADER\n#include <dali\/internal\/render\/gl-resources\/gl-call-debug.h>\n\n\/\/ INTERNAL INCLUDES\n#include <dali\/public-api\/common\/dali-common.h>\n#include <dali\/integration-api\/debug.h>\n#include <dali\/integration-api\/gl-abstraction.h>\n#include <dali\/integration-api\/gl-defines.h>\n\nnamespace\n{\n\/**\n * GL error strings\n *\/\nstruct errorStrings\n{\n  const Dali::GLenum errorCode;\n  const char* errorString;\n};\nerrorStrings errors[] =\n{\n   { GL_NO_ERROR,           \"GL_NO_ERROR\" },\n   { GL_INVALID_ENUM,       \"GL_INVALID_ENUM\" },\n   { GL_INVALID_VALUE,      \"GL_INVALID_VALUE\" },\n   { GL_INVALID_OPERATION,  \"GL_INVALID_OPERATION\" },\n   { GL_OUT_OF_MEMORY,      \"GL_OUT_OF_MEMORY\" }\n};\n\nconst char* ErrorToString( Dali::GLenum errorCode )\n{\n  for( unsigned int i = 0; i < sizeof(errors) \/ sizeof(errors[0]); ++i)\n  {\n    if (errorCode == errors[i].errorCode)\n    {\n      return errors[i].errorString;\n    }\n  }\n  return \"Unknown Open GLES error\";\n}\n\n}\n\nnamespace Dali\n{\n\nnamespace Internal\n{\n\n#ifdef DEBUG_ENABLED\n\/\/\/ Switch debug level to Concise to disable, General to enable. Note, enabling snapshot logging will do this on the fly.\nDebug::Filter* gGlLogFilter = Debug::Filter::New(Debug::Concise, false, \"LOG_CONTEXT\");\n#endif \/\/ DEBUG_ENABLED\n\nvoid CheckGlError( Integration::GlAbstraction& glAbstraction, const char* operation )\n{\n  for( GLint error = glAbstraction.GetError(); error; error = glAbstraction.GetError() )\n  {\n    DALI_LOG_ERROR( \"glError (0x%x) %s - after %s\\n\",  error, ErrorToString(error), operation );\n    DALI_ASSERT_ALWAYS( error && \"GL ERROR\"); \/\/ if errors are being checked we should assert\n  }\n}\n\n}\n\n}\n<commit_msg>Klockwork: Fix CheckGlError assert condition<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\/\/ HEADER\n#include <dali\/internal\/render\/gl-resources\/gl-call-debug.h>\n\n\/\/ INTERNAL INCLUDES\n#include <dali\/public-api\/common\/dali-common.h>\n#include <dali\/integration-api\/debug.h>\n#include <dali\/integration-api\/gl-abstraction.h>\n#include <dali\/integration-api\/gl-defines.h>\n\nnamespace\n{\n\/**\n * GL error strings\n *\/\nstruct errorStrings\n{\n  const Dali::GLenum errorCode;\n  const char* errorString;\n};\nerrorStrings errors[] =\n{\n   { GL_NO_ERROR,           \"GL_NO_ERROR\" },\n   { GL_INVALID_ENUM,       \"GL_INVALID_ENUM\" },\n   { GL_INVALID_VALUE,      \"GL_INVALID_VALUE\" },\n   { GL_INVALID_OPERATION,  \"GL_INVALID_OPERATION\" },\n   { GL_OUT_OF_MEMORY,      \"GL_OUT_OF_MEMORY\" }\n};\n\nconst char* ErrorToString( Dali::GLenum errorCode )\n{\n  for( unsigned int i = 0; i < sizeof(errors) \/ sizeof(errors[0]); ++i)\n  {\n    if (errorCode == errors[i].errorCode)\n    {\n      return errors[i].errorString;\n    }\n  }\n  return \"Unknown Open GLES error\";\n}\n\n}\n\nnamespace Dali\n{\n\nnamespace Internal\n{\n\n#ifdef DEBUG_ENABLED\n\/\/\/ Switch debug level to Concise to disable, General to enable. Note, enabling snapshot logging will do this on the fly.\nDebug::Filter* gGlLogFilter = Debug::Filter::New(Debug::Concise, false, \"LOG_CONTEXT\");\n#endif \/\/ DEBUG_ENABLED\n\nvoid CheckGlError( Integration::GlAbstraction& glAbstraction, const char* operation )\n{\n  for( GLint error = glAbstraction.GetError(); error; error = glAbstraction.GetError() )\n  {\n    DALI_LOG_ERROR( \"glError (0x%x) %s - after %s\\n\",  error, ErrorToString(error), operation );\n    DALI_ASSERT_ALWAYS( !error && \"GL ERROR\"); \/\/ if errors are being checked we should assert\n  }\n}\n\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sstream>\n#include <map>\n#include <cassert>\n#include <eiger.h>\n\n#include \"datakind.h\"\n#include \"eigerbackend.h\"\n\nEigerBackend::EigerBackend(std::string sitename, std::string machine, bool append)\n  : sitename_(sitename), dc_(sitename, sitename), app_(sitename, sitename), machine_(machine, machine)\n{\n\t\tdc_.commit();\n    app_.commit();\n    machine_.commit();\n}\n\nvoid EigerBackend::addCol(const std::string& label, const enum datakind kind){\n  eiger::metric_type_t etype;\n  std::string slabel = sitename_ + \"_\"+label;\n  switch(kind){\n    case RESULT:\n      etype = eiger::RESULT;\n      break;\n    case DETERMINISTIC:\n      etype = eiger::DETERMINISTIC;\n\t\t\tbreak;\n    case NONDETERMINISTIC:\n      etype = eiger::NONDETERMINISTIC;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tthrow \"eigerbackend: addCol unhandled datakind\";\n  }\n  eiger::Metric metric(etype, slabel, slabel);\n  metric.commit();\n  erow_.push_back(metric);\n}\n\nvoid EigerBackend::nextrow(const std::vector<std::pair<std::string, enum datakind> >& headers,\n                           const std::vector<double>& row){\n  \/\/ declare a trial, exec, etc and do all commits, then \n  \/\/ do text since text handles row.clear().\n  std::ostringstream dsbuf; \n  std::ostringstream ddbuf; \n  dsbuf << sitename_;\n  ddbuf << sitename_;\n  std::vector<std::pair<std::string, enum datakind> >::size_type len = headers.size();\n  assert(row.size() == len && 0 != \"eigerbackend::nextrow called with incomplete data\");\n  int i = 0;\n  for(std::vector<std::pair<std::string, enum datakind> >::const_iterator it = headers.begin();\n      it != headers.end(); ++it, ++i){\n    dsbuf << \"_\" << row.at(i);\n    ddbuf << \" \" << it->first <<  \"=\" << row.at(i);\n  } \n  std::string dsname = dsbuf.str();\n  std::string dsdesc = ddbuf.str();\n\n  eiger::ApplicationID aid = app_.getID();\n  eiger::Dataset ds(aid, dsname, dsdesc, \"nURL\");\n  ds.commit();\n  eiger::DatasetID dsid = ds.getID();\n\n  eiger::MachineID machid = machine_.getID();\n  eiger::Trial trial(dc_.getID(), machid, aid, dsid, eiger::PropertiesID(0,0));\n  trial.commit();\n  eiger::Execution exec(trial.getID(),machid);\n  exec.commit();\n  eiger::ExecutionID eid = exec.getID();\n  int j = 0;\n  for(std::vector<std::pair<std::string, enum datakind> >::const_iterator it = headers.begin();\n      it != headers.end(); ++it, ++j){\n    eiger::MetricID mid = (erow_.at(j)).getID();\n    switch(it->second){\n    case DETERMINISTIC: {\n      eiger::DeterministicMetric dmD(dsid, mid, row.at(j));\n      dmD.commit();\n      break;\n      }\n    case NONDETERMINISTIC: {\n      eiger::NondeterministicMetric ndmD(eid, mid, row.at(j));\n      ndmD.commit();\n      break;\n      }\n    case RESULT: {\n      eiger::NondeterministicMetric rdmD(eid, mid, row.at(j));\n      rdmD.commit();\n      break;\n      }\n    default:\n      throw \"unhandled htype in nextrow\";\n    } \n  }\n}\n\n<commit_msg>allow lwperf to be used with fakeeiger<commit_after>#include <sstream>\n#include <map>\n#include <cassert>\n#ifdef _USE_FAKEEIGER \n#include <mpifakeeiger.h>\n#else\n#include <eiger.h>\n#endif\n\n#include \"datakind.h\"\n#include \"eigerbackend.h\"\n\nEigerBackend::EigerBackend(std::string sitename, std::string machine, bool append)\n  : sitename_(sitename), dc_(sitename, sitename), app_(sitename, sitename), machine_(machine, machine)\n{\n\t\tdc_.commit();\n    app_.commit();\n    machine_.commit();\n}\n\nvoid EigerBackend::addCol(const std::string& label, const enum datakind kind){\n  eiger::metric_type_t etype;\n  std::string slabel = sitename_ + \"_\"+label;\n  switch(kind){\n    case RESULT:\n      etype = eiger::RESULT;\n      break;\n    case DETERMINISTIC:\n      etype = eiger::DETERMINISTIC;\n\t\t\tbreak;\n    case NONDETERMINISTIC:\n      etype = eiger::NONDETERMINISTIC;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tthrow \"eigerbackend: addCol unhandled datakind\";\n  }\n  eiger::Metric metric(etype, slabel, slabel);\n  metric.commit();\n  erow_.push_back(metric);\n}\n\nvoid EigerBackend::nextrow(const std::vector<std::pair<std::string, enum datakind> >& headers,\n                           const std::vector<double>& row){\n  \/\/ declare a trial, exec, etc and do all commits, then \n  \/\/ do text since text handles row.clear().\n  std::ostringstream dsbuf; \n  std::ostringstream ddbuf; \n  dsbuf << sitename_;\n  ddbuf << sitename_;\n  std::vector<std::pair<std::string, enum datakind> >::size_type len = headers.size();\n  assert(row.size() == len && 0 != \"eigerbackend::nextrow called with incomplete data\");\n  int i = 0;\n  for(std::vector<std::pair<std::string, enum datakind> >::const_iterator it = headers.begin();\n      it != headers.end(); ++it, ++i){\n    dsbuf << \"_\" << row.at(i);\n    ddbuf << \" \" << it->first <<  \"=\" << row.at(i);\n  } \n  std::string dsname = dsbuf.str();\n  std::string dsdesc = ddbuf.str();\n\n  eiger::ApplicationID aid = app_.getID();\n  eiger::Dataset ds(aid, dsname, dsdesc, \"nURL\");\n  ds.commit();\n  eiger::DatasetID dsid = ds.getID();\n\n  eiger::MachineID machid = machine_.getID();\n  eiger::Trial trial(dc_.getID(), machid, aid, dsid, eiger::PropertiesID(0,0));\n  trial.commit();\n  eiger::Execution exec(trial.getID(),machid);\n  exec.commit();\n  eiger::ExecutionID eid = exec.getID();\n  int j = 0;\n  for(std::vector<std::pair<std::string, enum datakind> >::const_iterator it = headers.begin();\n      it != headers.end(); ++it, ++j){\n    eiger::MetricID mid = (erow_.at(j)).getID();\n    switch(it->second){\n    case DETERMINISTIC: {\n      eiger::DeterministicMetric dmD(dsid, mid, row.at(j));\n      dmD.commit();\n      break;\n      }\n    case NONDETERMINISTIC: {\n      eiger::NondeterministicMetric ndmD(eid, mid, row.at(j));\n      ndmD.commit();\n      break;\n      }\n    case RESULT: {\n      eiger::NondeterministicMetric rdmD(eid, mid, row.at(j));\n      rdmD.commit();\n      break;\n      }\n    default:\n      throw \"unhandled htype in nextrow\";\n    } \n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Make geodesic work<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef YQVMC_NLOHMANN_JSON_EIGEN3_ADAPTOR_HPP\n#define YQVMC_NLOHMANN_JSON_EIGEN3_ADAPTOR_HPP\n\n#include <Eigen\/Dense>\n\nnamespace nlohmann {\n    \/\/template <typename Derived>\n    \/\/struct adl_serializer<EigenBase<Derived>> {\n    \/\/};\n    template <>\n    struct adl_serializer<Eigen::ArrayXd> {\n      static void to_json(json& j, const Eigen::ArrayXd& vec) {\n        for (unsigned i = 0; i < vec.size(); i++) {\n          j[i] = vec[i];\n        }\n      }\n    };\n}\n\n#endif\n<commit_msg>adding more interface for i\/os of vectors and matrices (not done yet...)<commit_after>#ifndef YQVMC_NLOHMANN_JSON_EIGEN3_ADAPTOR_HPP\n#define YQVMC_NLOHMANN_JSON_EIGEN3_ADAPTOR_HPP\n\n#include <Eigen\/Dense>\n\nnamespace nlohmann {\n    \/\/template <typename Derived>\n    \/\/struct adl_serializer<EigenBase<Derived>> {\n    \/\/};\n    template <>\n    struct adl_serializer<Eigen::ArrayXd> {\n      static void to_json(json& j, const Eigen::ArrayXd& vec) {\n        for (unsigned i = 0; i < vec.size(); i++) {\n          j[i] = vec[i];\n        }\n      }\n\n      static void from_json(const json& j, Eigen::ArrayXd& vec) {\n        vec.resize(j.size());\n        for (unsigned i = 0; i < j.size(); i++) {\n          vec[i] = j[i];\n        }\n      }\n\n      static void to_json(json& j, const Eigen::ArrayXXd& vec) {\n      }\n\n      static void from_json(const json& j, Eigen::ArrayXXd& vec) {\n      }\n\n    };\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : A.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-11-10 15:20:13\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\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N, M, L;\nstring S[500];\nstring T[29];\n\nvoid input()\n{\n  cin >> N >> M >> L;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> S[i];\n  }\n}\n\nvoid make_wall()\n{\n  string wall = \"\";\n  for (auto i = 0; i < M; i++)\n  {\n    wall += \"#\";\n  }\n  for (auto i = 0; i < M; i++)\n  {\n    T[i] = wall;\n  }\n  T[14][14] = '.';\n}\n\nvoid flush()\n{\n  for (auto i = 0; i < M; i++)\n  {\n    cout << T[i] << endl;\n  }\n}\n\nvoid solve(int k)\n{\n  assert(1 <= k && k <= 13);\n  for (auto i = 1; i <= k; i++)\n  {\n    for (auto t = 0; t < 4; t++)\n    {\n      int x = M \/ 2 + dx[t] * i;\n      int y = M \/ 2 + dy[t] * i;\n      T[x][y] = '.';\n    }\n  }\n}\n\nint main()\n{\n  input();\n  make_wall();\n  solve(7);\n  flush();\n}<commit_msg>submit A.cpp to 'A - ばらばらロボット' (future-contest-2019-qual) [C++14 (GCC 5.4.1)]<commit_after>\/**\n * File    : A.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-11-10 15:20:13\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\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N, M, L;\nstring S[500];\nstring T[29];\n\nvoid input()\n{\n  cin >> N >> M >> L;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> S[i];\n  }\n}\n\nvoid make_wall()\n{\n  string wall = \"\";\n  for (auto i = 0; i < M; i++)\n  {\n    wall += \"#\";\n  }\n  for (auto i = 0; i < M; i++)\n  {\n    T[i] = wall;\n  }\n  T[14][14] = '.';\n}\n\nvoid flush()\n{\n  for (auto i = 0; i < M; i++)\n  {\n    cout << T[i] << endl;\n  }\n}\n\nvoid solve(int k)\n{\n  assert(1 <= k && k <= 13);\n  for (auto i = 1; i <= k; i++)\n  {\n    for (auto t = 0; t < 4; t++)\n    {\n      int x = M \/ 2 + dx[t] * i;\n      int y = M \/ 2 + dy[t] * i;\n      T[x][y] = '.';\n    }\n  }\n}\n\nint main()\n{\n  input();\n  make_wall();\n  solve(8);\n  flush();\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <sstream>\n#include <string>\n\n#include <process\/defer.hpp>\n#include <process\/dispatch.hpp>\n#include <process\/future.hpp>\n#include <process\/http.hpp>\n#include <process\/process.hpp>\n\nusing namespace process;\n\nusing namespace process::http;\n\nusing std::string;\n\nclass MyProcess : public Process<MyProcess>\n{\npublic:\n  MyProcess() {}\n  virtual ~MyProcess() {}\n\n  Future<int> func1()\n  {\n    promise.future().onAny(\n        defer([=](const Future<int>& future) {\n          terminate(self());\n        }));\n    return promise.future();\n  }\n\n  void func2(int i)\n  {\n    promise.set(i);\n  }\n\n  Future<Response> vars(const Request& request)\n  {\n    string body = \"... vars here ...\";\n    OK response;\n    response.headers[\"Content-Type\"] = \"text\/plain\";\n    std::ostringstream out;\n    out << body.size();\n    response.headers[\"Content-Length\"] = out.str();\n    response.body = body;\n    return response;\n  }\n\n  void stop(const UPID& from, const string& body)\n  {\n    terminate(self());\n  }\n\nprotected:\n  virtual void initialize()\n  {\n    \/\/ route(\"\/vars\", &MyProcess::vars);\n    route(\"\/vars\", [=](const Request& request) {\n      string body = \"... vars here ...\";\n      OK response;\n      response.headers[\"Content-Type\"] = \"text\/plain\";\n      std::ostringstream out;\n      out << body.size();\n      response.headers[\"Content-Length\"] = out.str();\n      response.body = body;\n      return response;\n    });\n\n    \/\/ install(\"stop\", &MyProcess::stop);\n    install(\"stop\", [=](const UPID& from, const string& body) {\n      terminate(self());\n    });\n  }\n\nprivate:\n  Promise<int> promise;\n};\n\n\nint main(int argc, char** argv)\n{\n  MyProcess process;\n  PID<MyProcess> pid = spawn(&process);\n\n  PID<> pid2 = pid;\n\n  \/\/\/\/ --------------------------------------\n\n  \/\/ Future<int> future = dispatch(pid, &MyProcess::func1);\n  \/\/ dispatch(pid, &MyProcess::func2, 42);\n\n  \/\/ std::cout << future.get() << std::endl;\n\n  \/\/ post(pid, \"stop\");\n\n  \/\/\/\/ --------------------------------------\n\n  \/\/ Promise<bool> p;\n\n  \/\/ dispatch(pid, &MyProcess::func1)\n  \/\/   .then([=, &p] (int i) {\n  \/\/       p.set(i == 42);\n  \/\/       return p.future();\n  \/\/     })\n  \/\/   .then([=] (bool b) {\n  \/\/       if (b) {\n  \/\/         post(pid, \"stop\");\n  \/\/       }\n  \/\/       return true; \/\/ No Future<void>.\n  \/\/     });\n\n  \/\/ dispatch(pid, &MyProcess::func2, 42);\n\n  \/\/\/\/ --------------------------------------\n\n  dispatch(pid, &MyProcess::func1);\n  dispatch(pid, &MyProcess::func2, 42);\n\n  wait(pid);\n  return 0;\n}\n<commit_msg>Fixed compilation issues in libprocess example.<commit_after>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <string>\n\n#include <process\/defer.hpp>\n#include <process\/dispatch.hpp>\n#include <process\/future.hpp>\n#include <process\/http.hpp>\n#include <process\/process.hpp>\n\n#include <stout\/strings.hpp>\n\nusing namespace process;\n\nusing namespace process::http;\n\nusing std::string;\n\nclass MyProcess : public Process<MyProcess>\n{\npublic:\n  MyProcess(): ProcessBase(\"my-process\") {}\n  virtual ~MyProcess() {}\n\n  Future<int> func1()\n  {\n    promise.future().onAny(\n        defer([=](const Future<int>& future) {\n          terminate(self());\n        }));\n    return promise.future();\n  }\n\n  void func2(int i)\n  {\n    promise.set(i);\n  }\n\n  Future<Response> vars(const Request& request)\n  {\n    \/\/ Response response;\n    \/\/ response.code = Status::OK;\n    \/\/ response.headers[\"Content-Type\"] = \"text\/plain\";\n    \/\/ response.headers[\"Content-Length\"] = stringify(body.size());\n    \/\/ response.type = Response::BODY;\n    \/\/ response.body = body;\n\n    string body = \"... vars here ...\";\n    return OK(body);\n  }\n\n  void stop(const UPID& from, const string& body)\n  {\n    terminate(self());\n  }\n\nprotected:\n  virtual void initialize()\n  {\n    \/\/ route(\"\/vars\", None(), &MyProcess::vars);\n    route(\"\/vars\", None(), [=](const Request& request) {\n      string body = \"... vars here ...\";\n      return OK(body);\n    });\n\n    \/\/ install(\"stop\", &MyProcess::stop);\n    install(\"stop\", [=](const UPID& from, const string& body) {\n      terminate(self());\n    });\n  }\n\nprivate:\n  Promise<int> promise;\n};\n\n\nint main(int argc, char** argv)\n{\n  MyProcess process;\n  PID<MyProcess> pid = spawn(&process);\n\n  \/\/\/\/ --------------------------------------\n\n  \/\/ Future<int> future = dispatch(pid, &MyProcess::func1);\n  \/\/ dispatch(pid, &MyProcess::func2, 42);\n\n  \/\/ std::cout << future.get() << std::endl;\n\n  \/\/ http::post(pid, \"stop\");\n\n  \/\/\/\/ --------------------------------------\n\n  \/\/ Promise<bool> p;\n\n  \/\/ dispatch(pid, &MyProcess::func1)\n  \/\/   .then([=, &p] (int i) {\n  \/\/       p.set(i == 42);\n  \/\/       return p.future();\n  \/\/     })\n  \/\/   .then([=] (bool b) {\n  \/\/       if (b) {\n  \/\/         http::post(pid, \"stop\");\n  \/\/       }\n  \/\/       return true; \/\/ No Future<void>.\n  \/\/     });\n\n  \/\/ dispatch(pid, &MyProcess::func2, 42);\n\n  \/\/\/\/ --------------------------------------\n\n  \/\/ dispatch(pid, &MyProcess::func1);\n  \/\/ dispatch(pid, &MyProcess::func2, 42);\n\n  \/\/\/\/ --------------------------------------\n\n  std::cout << strings::format(\"Endpoint listening on http:\/\/%s\/%s\/vars\\n\",\n      process::address(),\n      process.self().id).get();\n\n  wait(pid);\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: TableWindowTitle.cxx,v $\n *\n *  $Revision: 1.23 $\n *\n *  last change: $Author: rt $ $Date: 2007-07-06 08:40: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dbaccess.hxx\"\n#ifndef DBAUI_TABLEWINDOWTITLE_HXX\n#include \"TableWindowTitle.hxx\"\n#endif\n#ifndef DBAUI_TABLEWINDOW_HXX\n#include \"TableWindow.hxx\"\n#endif\n#ifndef DBAUI_QUERYTABLEVIEW_HXX\n#include \"QueryTableView.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _SV_HELP_HXX\n#include <vcl\/help.hxx>\n#endif\n#ifndef _SV_MENU_HXX\n#include <vcl\/menu.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef _CNTIDS_HRC\n#include <sfx2\/cntids.hrc>\n#endif\n#ifndef DBAUI_TABLEWINDOWLISTBOX_HXX\n#include \"TableWindowListBox.hxx\"\n#endif\n#ifndef DBAUI_TABLECONNECTION_HXX\n#include \"TableConnection.hxx\"\n#endif\n#ifndef _DBU_QRY_HRC_\n#include \"dbu_qry.hrc\"\n#endif\n#ifndef DBAUI_QUERYDESIGNVIEW_HXX\n#include \"QueryDesignView.hxx\"\n#endif\n#ifndef DBAUI_JOINCONTROLLER_HXX\n#include \"JoinController.hxx\"\n#endif\n\n#include <algorithm>\n\nusing namespace dbaui;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::uno;\n\/\/==================================================================\n\/\/ class OTableWindowTitle\n\/\/==================================================================\nDBG_NAME(OTableWindowTitle)\n\/\/------------------------------------------------------------------------------\nOTableWindowTitle::OTableWindowTitle( OTableWindow* pParent ) :\n     FixedText( pParent, WB_3DLOOK|WB_LEFT|WB_NOLABEL|WB_VCENTER )\n    ,m_pTabWin( pParent )\n{\n    DBG_CTOR(OTableWindowTitle,NULL);\n    \/\/ Hintergrund- und Textfarbe setzen\n    StyleSettings aSystemStyle = Application::GetSettings().GetStyleSettings();\n    SetBackground(Wallpaper(Color(aSystemStyle.GetFaceColor())));\n    SetTextColor(aSystemStyle.GetButtonTextColor());\n\n    Font aFont( GetFont() );\n    aFont.SetTransparent( TRUE );\n    SetFont( aFont );\n}\n\n\/\/------------------------------------------------------------------------------\nOTableWindowTitle::~OTableWindowTitle()\n{\n    DBG_DTOR(OTableWindowTitle,NULL);\n    m_pTabWin = NULL;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::GetFocus()\n{\n    if(m_pTabWin)\n        m_pTabWin->GetFocus();\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::LoseFocus()\n{\n    m_pTabWin->LoseFocus();\n}\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::RequestHelp( const HelpEvent& rHEvt )\n{\n    if(m_pTabWin)\n    {\n        String aHelpText = m_pTabWin->GetComposedName();\n        if( aHelpText.Len())\n        {\n            \/\/ Hilfe anzeigen\n            Rectangle aItemRect(Point(0,0),GetSizePixel());\n            aItemRect = LogicToPixel( aItemRect );\n            Point aPt = OutputToScreenPixel( aItemRect.TopLeft() );\n            aItemRect.Left()   = aPt.X();\n            aItemRect.Top()    = aPt.Y();\n            aPt = OutputToScreenPixel( aItemRect.BottomRight() );\n            aItemRect.Right()  = aPt.X();\n            aItemRect.Bottom() = aPt.Y();\n            if( rHEvt.GetMode() == HELPMODE_BALLOON )\n                Help::ShowBalloon( this, aItemRect.Center(), aItemRect, aHelpText);\n            else\n                Help::ShowQuickHelp( this, aItemRect, aHelpText );\n        }\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::Command( const CommandEvent& rEvt )\n{\n    switch( rEvt.GetCommand() )\n    {\n        case COMMAND_CONTEXTMENU:\n        {\n            GrabFocus();\n            if ( m_pTabWin )\n                m_pTabWin->Command( rEvt );\n            else\n                Control::Command(rEvt);\n        }\n    }\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/void OTableWindowTitle::Paint( const Rectangle& rRect )\n\/\/{\n\/\/  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/  \/\/ Ausgabe des Textes in der Titelzeile\n\/\/  Rectangle aWinRect( Point(0,0), GetSizePixel() );\n\/\/  DrawText( aWinRect, GetText(), TEXT_DRAW_CENTER|TEXT_DRAW_VCENTER|TEXT_DRAW_ENDELLIPSIS );\n\/\/}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::KeyInput( const KeyEvent& rEvt )\n{\n    if ( m_pTabWin )\n        m_pTabWin->KeyInput( rEvt );\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::MouseButtonDown( const MouseEvent& rEvt )\n{\n    if( rEvt.IsLeft() )\n    {\n        if( rEvt.GetClicks() == 2)\n        {\n            Size aSize(GetTextWidth(GetText()) + 20,\n                        m_pTabWin->GetSizePixel().Height() - m_pTabWin->GetListBox()->GetSizePixel().Height());\n\n            aSize.Height() += (m_pTabWin->GetListBox()->GetEntryCount() + 2) * m_pTabWin->GetListBox()->GetEntryHeight();\n            if(m_pTabWin->GetSizePixel() != aSize)\n            {\n                m_pTabWin->SetSizePixel(aSize);\n\n                OJoinTableView* pView = static_cast<OJoinTableView*>(m_pTabWin->getTableView());\n                OSL_ENSURE(pView,\"No OJoinTableView!\");\n                const ::std::vector<OTableConnection*>* pConns = pView->getTableConnections();\n                ::std::for_each(pConns->begin(),\n                                pConns->end(),\n                                ::std::mem_fun(&OTableConnection::RecalcLines));\n\n                pView->InvalidateConnections();\n                pView->getDesignView()->getController()->setModified(sal_True);\n                pView->Invalidate(INVALIDATE_NOCHILDREN);\n            }\n        }\n        else\n        {\n            Point aPos = rEvt.GetPosPixel();\n            aPos = OutputToScreenPixel( aPos );\n            OJoinTableView* pView = static_cast<OJoinTableView*>(m_pTabWin->getTableView());\n            OSL_ENSURE(pView,\"No OJoinTableView!\");\n            pView->NotifyTitleClicked( static_cast<OTableWindow*>(GetParent()), aPos );\n        }\n        GrabFocus();\n    }\n    else\n        Control::MouseButtonDown( rEvt );\n}\n\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::DataChanged(const DataChangedEvent& rDCEvt)\n{\n    if (rDCEvt.GetType() == DATACHANGED_SETTINGS)\n    {\n        \/\/ nehmen wir den worst-case an : die Farben haben sich geaendert, also\n        \/\/ mich anpassen\n        StyleSettings aSystemStyle = Application::GetSettings().GetStyleSettings();\n        SetBackground(Wallpaper(Color(aSystemStyle.GetFaceColor())));\n        SetTextColor(aSystemStyle.GetButtonTextColor());\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OTableWindowTitle::StateChanged( StateChangedType nType )\n{\n    Window::StateChanged( nType );\n\n    if ( nType == STATE_CHANGE_ZOOM )\n    {\n        const StyleSettings& rStyleSettings = GetSettings().GetStyleSettings();\n\n        Font aFont = rStyleSettings.GetGroupFont();\n        if ( IsControlFont() )\n            aFont.Merge( GetControlFont() );\n        SetZoomedPointFont( aFont );\n\n        Resize();\n    }\n}\n\n\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.23.162); FILE MERGED 2008\/03\/31 13:27:58 rt 1.23.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: TableWindowTitle.cxx,v $\n * $Revision: 1.24 $\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#ifndef DBAUI_TABLEWINDOWTITLE_HXX\n#include \"TableWindowTitle.hxx\"\n#endif\n#ifndef DBAUI_TABLEWINDOW_HXX\n#include \"TableWindow.hxx\"\n#endif\n#ifndef DBAUI_QUERYTABLEVIEW_HXX\n#include \"QueryTableView.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _SV_HELP_HXX\n#include <vcl\/help.hxx>\n#endif\n#ifndef _SV_MENU_HXX\n#include <vcl\/menu.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef _CNTIDS_HRC\n#include <sfx2\/cntids.hrc>\n#endif\n#ifndef DBAUI_TABLEWINDOWLISTBOX_HXX\n#include \"TableWindowListBox.hxx\"\n#endif\n#ifndef DBAUI_TABLECONNECTION_HXX\n#include \"TableConnection.hxx\"\n#endif\n#ifndef _DBU_QRY_HRC_\n#include \"dbu_qry.hrc\"\n#endif\n#ifndef DBAUI_QUERYDESIGNVIEW_HXX\n#include \"QueryDesignView.hxx\"\n#endif\n#ifndef DBAUI_JOINCONTROLLER_HXX\n#include \"JoinController.hxx\"\n#endif\n\n#include <algorithm>\n\nusing namespace dbaui;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::uno;\n\/\/==================================================================\n\/\/ class OTableWindowTitle\n\/\/==================================================================\nDBG_NAME(OTableWindowTitle)\n\/\/------------------------------------------------------------------------------\nOTableWindowTitle::OTableWindowTitle( OTableWindow* pParent ) :\n     FixedText( pParent, WB_3DLOOK|WB_LEFT|WB_NOLABEL|WB_VCENTER )\n    ,m_pTabWin( pParent )\n{\n    DBG_CTOR(OTableWindowTitle,NULL);\n    \/\/ Hintergrund- und Textfarbe setzen\n    StyleSettings aSystemStyle = Application::GetSettings().GetStyleSettings();\n    SetBackground(Wallpaper(Color(aSystemStyle.GetFaceColor())));\n    SetTextColor(aSystemStyle.GetButtonTextColor());\n\n    Font aFont( GetFont() );\n    aFont.SetTransparent( TRUE );\n    SetFont( aFont );\n}\n\n\/\/------------------------------------------------------------------------------\nOTableWindowTitle::~OTableWindowTitle()\n{\n    DBG_DTOR(OTableWindowTitle,NULL);\n    m_pTabWin = NULL;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::GetFocus()\n{\n    if(m_pTabWin)\n        m_pTabWin->GetFocus();\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::LoseFocus()\n{\n    m_pTabWin->LoseFocus();\n}\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::RequestHelp( const HelpEvent& rHEvt )\n{\n    if(m_pTabWin)\n    {\n        String aHelpText = m_pTabWin->GetComposedName();\n        if( aHelpText.Len())\n        {\n            \/\/ Hilfe anzeigen\n            Rectangle aItemRect(Point(0,0),GetSizePixel());\n            aItemRect = LogicToPixel( aItemRect );\n            Point aPt = OutputToScreenPixel( aItemRect.TopLeft() );\n            aItemRect.Left()   = aPt.X();\n            aItemRect.Top()    = aPt.Y();\n            aPt = OutputToScreenPixel( aItemRect.BottomRight() );\n            aItemRect.Right()  = aPt.X();\n            aItemRect.Bottom() = aPt.Y();\n            if( rHEvt.GetMode() == HELPMODE_BALLOON )\n                Help::ShowBalloon( this, aItemRect.Center(), aItemRect, aHelpText);\n            else\n                Help::ShowQuickHelp( this, aItemRect, aHelpText );\n        }\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::Command( const CommandEvent& rEvt )\n{\n    switch( rEvt.GetCommand() )\n    {\n        case COMMAND_CONTEXTMENU:\n        {\n            GrabFocus();\n            if ( m_pTabWin )\n                m_pTabWin->Command( rEvt );\n            else\n                Control::Command(rEvt);\n        }\n    }\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/void OTableWindowTitle::Paint( const Rectangle& rRect )\n\/\/{\n\/\/  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/  \/\/ Ausgabe des Textes in der Titelzeile\n\/\/  Rectangle aWinRect( Point(0,0), GetSizePixel() );\n\/\/  DrawText( aWinRect, GetText(), TEXT_DRAW_CENTER|TEXT_DRAW_VCENTER|TEXT_DRAW_ENDELLIPSIS );\n\/\/}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::KeyInput( const KeyEvent& rEvt )\n{\n    if ( m_pTabWin )\n        m_pTabWin->KeyInput( rEvt );\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::MouseButtonDown( const MouseEvent& rEvt )\n{\n    if( rEvt.IsLeft() )\n    {\n        if( rEvt.GetClicks() == 2)\n        {\n            Size aSize(GetTextWidth(GetText()) + 20,\n                        m_pTabWin->GetSizePixel().Height() - m_pTabWin->GetListBox()->GetSizePixel().Height());\n\n            aSize.Height() += (m_pTabWin->GetListBox()->GetEntryCount() + 2) * m_pTabWin->GetListBox()->GetEntryHeight();\n            if(m_pTabWin->GetSizePixel() != aSize)\n            {\n                m_pTabWin->SetSizePixel(aSize);\n\n                OJoinTableView* pView = static_cast<OJoinTableView*>(m_pTabWin->getTableView());\n                OSL_ENSURE(pView,\"No OJoinTableView!\");\n                const ::std::vector<OTableConnection*>* pConns = pView->getTableConnections();\n                ::std::for_each(pConns->begin(),\n                                pConns->end(),\n                                ::std::mem_fun(&OTableConnection::RecalcLines));\n\n                pView->InvalidateConnections();\n                pView->getDesignView()->getController()->setModified(sal_True);\n                pView->Invalidate(INVALIDATE_NOCHILDREN);\n            }\n        }\n        else\n        {\n            Point aPos = rEvt.GetPosPixel();\n            aPos = OutputToScreenPixel( aPos );\n            OJoinTableView* pView = static_cast<OJoinTableView*>(m_pTabWin->getTableView());\n            OSL_ENSURE(pView,\"No OJoinTableView!\");\n            pView->NotifyTitleClicked( static_cast<OTableWindow*>(GetParent()), aPos );\n        }\n        GrabFocus();\n    }\n    else\n        Control::MouseButtonDown( rEvt );\n}\n\n\n\/\/------------------------------------------------------------------------------\nvoid OTableWindowTitle::DataChanged(const DataChangedEvent& rDCEvt)\n{\n    if (rDCEvt.GetType() == DATACHANGED_SETTINGS)\n    {\n        \/\/ nehmen wir den worst-case an : die Farben haben sich geaendert, also\n        \/\/ mich anpassen\n        StyleSettings aSystemStyle = Application::GetSettings().GetStyleSettings();\n        SetBackground(Wallpaper(Color(aSystemStyle.GetFaceColor())));\n        SetTextColor(aSystemStyle.GetButtonTextColor());\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OTableWindowTitle::StateChanged( StateChangedType nType )\n{\n    Window::StateChanged( nType );\n\n    if ( nType == STATE_CHANGE_ZOOM )\n    {\n        const StyleSettings& rStyleSettings = GetSettings().GetStyleSettings();\n\n        Font aFont = rStyleSettings.GetGroupFont();\n        if ( IsControlFont() )\n            aFont.Merge( GetControlFont() );\n        SetZoomedPointFont( aFont );\n\n        Resize();\n    }\n}\n\n\n\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,\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#include <thrift\/test\/gen-cpp\/EnumTest_types.h>\n#include <thrift\/lib\/cpp\/util\/EnumUtils.h>\n\n#include <gtest\/gtest.h>\n\nusing apache::thrift::TEnumTraits;\nusing namespace apache::thrift::util;\n\nTEST(EnumTest, test_enum) {\n  \/\/ Check that all the enum values match what we expect\n  EXPECT_EQ(TEnumTraits<MyEnum1>::min(), 0);\n  EXPECT_EQ(MyEnum1::ME1_0, 0);\n  EXPECT_EQ(MyEnum1::ME1_1, 1);\n  EXPECT_EQ(MyEnum1::ME1_2, 2);\n  EXPECT_EQ(MyEnum1::ME1_3, 3);\n  EXPECT_EQ(MyEnum1::ME1_5, 5);\n  EXPECT_EQ(MyEnum1::ME1_6, 6);\n  EXPECT_EQ(TEnumTraits<MyEnum1>::max(), 6);\n\n  EXPECT_EQ(TEnumTraits<MyEnum2>::min(), 0);\n  EXPECT_EQ(MyEnum2::ME2_0, 0);\n  EXPECT_EQ(MyEnum2::ME2_1, 1);\n  EXPECT_EQ(MyEnum2::ME2_2, 2);\n  EXPECT_EQ(TEnumTraits<MyEnum2>::max(), 2);\n\n  EXPECT_EQ(TEnumTraits<MyEnum3>::min(), -2);\n  EXPECT_EQ(MyEnum3::ME3_0, 0);\n  EXPECT_EQ(MyEnum3::ME3_1, 1);\n  EXPECT_EQ(MyEnum3::ME3_N2, -2);\n  EXPECT_EQ(MyEnum3::ME3_N1, -1);\n  EXPECT_EQ(MyEnum3::ME3_D0, 0);\n  EXPECT_EQ(MyEnum3::ME3_D1, 1);\n  EXPECT_EQ(MyEnum3::ME3_9, 9);\n  EXPECT_EQ(MyEnum3::ME3_10, 10);\n  EXPECT_EQ(TEnumTraits<MyEnum3>::max(), 10);\n\n  EXPECT_EQ(TEnumTraits<MyEnum4>::min(), 0x7ffffffd);\n  EXPECT_EQ(MyEnum4::ME4_A, 0x7ffffffd);\n  EXPECT_EQ(MyEnum4::ME4_B, 0x7ffffffe);\n  EXPECT_EQ(MyEnum4::ME4_C, 0x7fffffff);\n  EXPECT_EQ(TEnumTraits<MyEnum4>::max(), 0x7fffffff);\n}\n\nTEST(EnumTest, test_enum_constant) {\n  MyStruct ms;\n  EXPECT_EQ(ms.me2_2, 2);\n  EXPECT_EQ(ms.me3_n2, -2);\n  EXPECT_EQ(ms.me3_d1, 1);\n}\n\nTEST(EnumTest, test_enum_names) {\n  EXPECT_EQ(enumName(MyEnum3::ME3_1), std::string{\"ME3_1\"});\n  EXPECT_EQ(enumName(MyEnum2::ME2_2), std::string{\"ME2_2\"});\n  EXPECT_EQ(enumName(static_cast<MyEnum2>(-10)), (const char*)nullptr);\n  EXPECT_EQ(enumName(static_cast<MyEnum2>(-10), \"foo\"), \"foo\");\n}\n\nTEST(EnumTest, test_enum_parse) {\n  MyEnum2 e2;\n  MyEnum3 e3;\n\n  EXPECT_TRUE(tryParseEnum(\"ME2_2\", &e2));\n  EXPECT_EQ((int)MyEnum2::ME2_2, (int)e2);\n  EXPECT_TRUE(tryParseEnum(\"ME3_N2\", &e3));\n  EXPECT_EQ((int)MyEnum3::ME3_N2, (int)e3);\n\n  EXPECT_FALSE(tryParseEnum(\"FOO_ME2_0\", &e2));\n  EXPECT_FALSE(tryParseEnum(\"BAR_ME3_N2\", &e3));\n}\n<commit_msg>Work around UB invalid-enum-load in thrift\/test\/EnumTest.cpp<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,\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#include <thrift\/test\/gen-cpp\/EnumTest_types.h>\n#include <thrift\/lib\/cpp\/util\/EnumUtils.h>\n\n#include <gtest\/gtest.h>\n\nusing apache::thrift::TEnumTraits;\nusing namespace apache::thrift::util;\n\nTEST(EnumTest, test_enum) {\n  \/\/ Check that all the enum values match what we expect\n  EXPECT_EQ(TEnumTraits<MyEnum1>::min(), 0);\n  EXPECT_EQ(MyEnum1::ME1_0, 0);\n  EXPECT_EQ(MyEnum1::ME1_1, 1);\n  EXPECT_EQ(MyEnum1::ME1_2, 2);\n  EXPECT_EQ(MyEnum1::ME1_3, 3);\n  EXPECT_EQ(MyEnum1::ME1_5, 5);\n  EXPECT_EQ(MyEnum1::ME1_6, 6);\n  EXPECT_EQ(TEnumTraits<MyEnum1>::max(), 6);\n\n  EXPECT_EQ(TEnumTraits<MyEnum2>::min(), 0);\n  EXPECT_EQ(MyEnum2::ME2_0, 0);\n  EXPECT_EQ(MyEnum2::ME2_1, 1);\n  EXPECT_EQ(MyEnum2::ME2_2, 2);\n  EXPECT_EQ(TEnumTraits<MyEnum2>::max(), 2);\n\n  EXPECT_EQ(TEnumTraits<MyEnum3>::min(), -2);\n  EXPECT_EQ(MyEnum3::ME3_0, 0);\n  EXPECT_EQ(MyEnum3::ME3_1, 1);\n  EXPECT_EQ(MyEnum3::ME3_N2, -2);\n  EXPECT_EQ(MyEnum3::ME3_N1, -1);\n  EXPECT_EQ(MyEnum3::ME3_D0, 0);\n  EXPECT_EQ(MyEnum3::ME3_D1, 1);\n  EXPECT_EQ(MyEnum3::ME3_9, 9);\n  EXPECT_EQ(MyEnum3::ME3_10, 10);\n  EXPECT_EQ(TEnumTraits<MyEnum3>::max(), 10);\n\n  EXPECT_EQ(TEnumTraits<MyEnum4>::min(), 0x7ffffffd);\n  EXPECT_EQ(MyEnum4::ME4_A, 0x7ffffffd);\n  EXPECT_EQ(MyEnum4::ME4_B, 0x7ffffffe);\n  EXPECT_EQ(MyEnum4::ME4_C, 0x7fffffff);\n  EXPECT_EQ(TEnumTraits<MyEnum4>::max(), 0x7fffffff);\n}\n\nTEST(EnumTest, test_enum_constant) {\n  MyStruct ms;\n  EXPECT_EQ(ms.me2_2, 2);\n  EXPECT_EQ(ms.me3_n2, -2);\n  EXPECT_EQ(ms.me3_d1, 1);\n}\n\nTEST(EnumTest, test_enum_names) {\n  EXPECT_EQ(enumName(MyEnum3::ME3_1), std::string{\"ME3_1\"});\n  EXPECT_EQ(enumName(MyEnum2::ME2_2), std::string{\"ME2_2\"});\n  EXPECT_EQ(enumName(static_cast<MyEnum2>(3)), (const char*)nullptr);\n  EXPECT_EQ(enumName(static_cast<MyEnum2>(3), \"foo\"), \"foo\");\n}\n\nTEST(EnumTest, test_enum_parse) {\n  MyEnum2 e2;\n  MyEnum3 e3;\n\n  EXPECT_TRUE(tryParseEnum(\"ME2_2\", &e2));\n  EXPECT_EQ((int)MyEnum2::ME2_2, (int)e2);\n  EXPECT_TRUE(tryParseEnum(\"ME3_N2\", &e3));\n  EXPECT_EQ((int)MyEnum3::ME3_N2, (int)e3);\n\n  EXPECT_FALSE(tryParseEnum(\"FOO_ME2_0\", &e2));\n  EXPECT_FALSE(tryParseEnum(\"BAR_ME3_N2\", &e3));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"QuadraticSieve.h\"\n#include \"QuadraticSieveScheduler.h\"\n#include \"QuadraticSieveElf.h\"\n#include \"common\/ProblemStatement.h\"\n#include \"common\/Utils.h\"\n#include <numeric>\n\ntemplate<typename ElemType>\nstd::ostream& operator<<(std::ostream& stream, const std::vector<ElemType>& list)\n{\n    stream << \"[\";\n    bool first = true;\n    for (const auto& element : list)\n    {\n        if (!first)\n            stream << \", \";\n        stream << element;\n        first = false;\n    }\n    stream << \"]\";\n\n    return stream;\n}\n\nusing namespace std;\nusing namespace std::placeholders;\n\nBigInt receiveBigInt(const Communicator& communicator);\nBigInt receiveBigIntFromMaster(const Communicator& communicator);\n\nstruct serializedBigIntDeleter\n{\n    void operator()(uint32_t* memory)\n    {\n        free(memory);\n    }\n};\n\ntypedef std::pair<std::unique_ptr<uint32_t, serializedBigIntDeleter>, size_t> SerializedBigInt;\n\ninline SerializedBigInt bigIntToArray(const BigInt& number)\n{\n    size_t arraySize;\n    std::unique_ptr<uint32_t, serializedBigIntDeleter> pointer(reinterpret_cast<uint32_t*>(\n        mpz_export(nullptr, &arraySize, -1, sizeof(uint32_t), 0, 0, number.get_mpz_t())\n    ), serializedBigIntDeleter());\n    return make_pair(std::move(pointer), arraySize);\n}\n\ninline BigInt arrayToBigInt(const SerializedBigInt& data)\n{\n    BigInt result;\n    mpz_import(result.get_mpz_t(), data.second, -1, sizeof(uint32_t), 0, 0, data.first.get());\n    return result;\n}\n\nQuadraticSieveScheduler::QuadraticSieveScheduler(const Communicator& communicator, const std::function<ElfPointer()>& factory) :\n    SchedulerTemplate(communicator, factory)\n{\n}\n\nvoid QuadraticSieveScheduler::provideData(istream& input)\n{\n    input >> number;\n\n    if (input.fail())\n        throw runtime_error(\"Failed to read BigInt from input stream in \" __FILE__);\n}\n\nvoid QuadraticSieveScheduler::outputData(ostream& output)\n{\n    output << p << endl;\n    output << q << endl;\n}\n\nvoid QuadraticSieveScheduler::generateData(const DataGenerationParameters&)\n{\n    \/\/ TODO: Use parameters and generate a random number\n    number = 1089911;\n}\n\nbool QuadraticSieveScheduler::hasData() const\n{\n    return number != 0;\n}\n\nvoid QuadraticSieveScheduler::doSimpleDispatch()\n{\n    tie(p, q) = QuadraticSieveHelper::factor(\n        number,\n        bind(&QuadraticSieveElf::sieveSmoothSquares, &elf(), _1, _2, _3, _4)\n    );\n}\n\nvoid packBigintVector(vector<size_t>& outSizes, vector<uint32_t>& outData, const vector<BigInt>& input)\n{\n    for (const auto& number : input)\n    {\n        auto serialized = bigIntToArray(number);\n        outSizes.push_back(serialized.second);\n        outData.insert(outData.end(), serialized.first.get(), serialized.first.get() + serialized.second);\n    }\n}\n\nSmoothSquareList unpackBigintVector(const vector<size_t>& sizes, const vector<uint32_t>& data)\n{\n    SmoothSquareList result;\n    auto dataIter = data.begin();\n    for (const auto size : sizes)\n    {\n        SerializedBigInt serialized;\n        serialized.second = size;\n        serialized.first.reset(reinterpret_cast<uint32_t*>(malloc(sizeof(uint32_t)*size)));\n        std::copy(dataIter, dataIter+size, serialized.first.get());\n        dataIter += size;\n        result.push_back(arrayToBigInt(serialized));\n    }\n\n    return result;\n}\n\nvoid QuadraticSieveScheduler::doDispatch()\n{\n    if (communicator.isMaster())\n    {\n        tie(p, q) = QuadraticSieveHelper::factor(\n            number,\n            bind(&QuadraticSieveScheduler::sieveDistributed, this, _1, _2, _3, _4)\n        );\n    }\n    else\n    {\n        BigInt number = receiveBigInt(communicator);\n        BigInt start = receiveBigIntFromMaster(communicator);\n        BigInt end = receiveBigIntFromMaster(communicator);\n        size_t factorBaseSize;\n        communicator->Bcast(&factorBaseSize, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n        vector<smallPrime_t> factorBase(factorBaseSize);\n        communicator->Bcast(factorBase.data(), factorBaseSize, MPI::INT, Communicator::MASTER_RANK);\n\n        auto result = elf().sieveSmoothSquares(start, end, number, factorBase);\n        int resultSize = result.size();\n        communicator->Gather(&resultSize, 1, MPI::INT, nullptr, 0, MPI::INT, Communicator::MASTER_RANK);\n\n        vector<size_t> resultsSizes;\n        vector<uint32_t> resultsData;\n        packBigintVector(resultsSizes, resultsData, result);\n\n        communicator->Gatherv(resultsSizes.data(), resultSize, MPI::UNSIGNED_LONG, nullptr, nullptr, nullptr, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n        communicator->Gatherv(resultsData.data(), resultsData.size(), MPI::INT, nullptr, nullptr, nullptr, MPI::INT, Communicator::MASTER_RANK);\n    }\n}\n\n\nvoid sendBigInt(const Communicator& communicator, const BigInt& number)\n{\n    auto serialized = bigIntToArray(number);\n    communicator->Bcast(&serialized.second, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n    communicator->Bcast(serialized.first.get(), serialized.second, MPI::INT, Communicator::MASTER_RANK);\n}\n\nBigInt receiveBigInt(const Communicator& communicator)\n{\n    SerializedBigInt result;\n    communicator->Bcast(&result.second, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n    result.first.reset(reinterpret_cast<uint32_t*>(malloc(result.second * sizeof(uint32_t))));\n    communicator->Bcast(result.first.get(), result.second, MPI::INT, Communicator::MASTER_RANK);\n    return arrayToBigInt(result);\n}\n\nvoid sendBigIntTo(const Communicator& communicator, const BigInt& number, int nodeId)\n{\n    auto serialized = bigIntToArray(number);\n    communicator->Send(&serialized.second, 1, MPI::UNSIGNED_LONG, nodeId, 0);\n    communicator->Send(serialized.first.get(), serialized.second, MPI::INT, nodeId, 0);\n}\n\nBigInt receiveBigIntFromMaster(const Communicator& communicator)\n{\n    SerializedBigInt result;\n    communicator->Recv(&result.second, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK, 0);\n    result.first.reset(reinterpret_cast<uint32_t*>(malloc(result.second * sizeof(uint32_t))));\n    communicator->Recv(result.first.get(), result.second, MPI::INT, Communicator::MASTER_RANK, 0);\n    return arrayToBigInt(result);\n}\n\nvector<BigInt> QuadraticSieveScheduler::sieveDistributed(\n    const BigInt& start,\n    const BigInt& end,\n    const BigInt& number,\n    const FactorBase& factorBase\n)\n{\n    sendBigInt(communicator, number);\n\n    BigInt intervalLength = end - start;\n    BigInt chunkSize = div_ceil(intervalLength, BigInt(communicator.size()));\n\n    for (size_t nodeId=1; nodeId < communicator.size(); ++nodeId)\n    {\n        BigInt partialStart = start + chunkSize*nodeId;\n        BigInt partialEnd = min(partialStart + chunkSize, end);\n        sendBigIntTo(communicator, partialStart, nodeId);\n        sendBigIntTo(communicator, partialEnd, nodeId);\n    }\n\n    size_t factorBaseSize = factorBase.size();\n    communicator->Bcast(&factorBaseSize, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n    communicator->Bcast(const_cast<smallPrime_t*>(factorBase.data()), factorBaseSize, MPI::INT, Communicator::MASTER_RANK);\n\n    SmoothSquareList masterResult = elf().sieveSmoothSquares(start, min(start + chunkSize, end), number, factorBase);\n    size_t resultSize = masterResult.size();\n\n    vector<size_t> numberSizes;\n    vector<uint32_t> numberData;\n    packBigintVector(numberSizes, numberData, masterResult);\n\n    vector<int> resultSizes(communicator.size());\n    communicator->Gather(&resultSize, 1, MPI::INT, resultSizes.data(), 1, MPI::INT, Communicator::MASTER_RANK);\n\n    auto totalSmoothSquares = std::accumulate(resultSizes.begin(), resultSizes.end(), 0);\n\n\n    \/\/ gather sizes of smooth squares\n    vector<int> displs(communicator.size());\n    displs[0] = 0;\n    for (size_t nodeId = 1; nodeId < communicator.size(); ++nodeId)\n    {\n        displs[nodeId] = displs[nodeId - 1] + resultSizes.at(nodeId - 1);\n    }\n    vector<size_t> allNumberSizes(totalSmoothSquares);\n    communicator->Gatherv(numberSizes.data(), resultSize, MPI::UNSIGNED_LONG, allNumberSizes.data(), resultSizes.data(), displs.data(), MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n\n\n    \/\/ gather smooth squares\n    auto numberSizesSum = std::accumulate(allNumberSizes.begin(), allNumberSizes.end(), 0);\n    vector<uint32_t> allNumberData(numberSizesSum);\n    vector<int> sizePerNode(communicator.size());\n    auto accumulateStart = allNumberSizes.begin();\n    \/\/auto accumulateEnd = allNumberSizes.begin() + resultSizes[0];\n    for (size_t nodeId = 0; nodeId < communicator.size(); ++nodeId)\n    {\n        auto accumulateEnd = accumulateStart + resultSizes[nodeId];\n        sizePerNode[nodeId] = std::accumulate(accumulateStart, accumulateEnd, 0);\n        accumulateStart = accumulateEnd;\n\n    }\n    vector<int> dataDispls(communicator.size());\n    dataDispls[0] = 0;\n    for (size_t nodeId = 1; nodeId < communicator.size(); ++nodeId)\n    {\n        dataDispls[nodeId] = dataDispls[nodeId - 1] + sizePerNode[nodeId - 1];\n    }\n\n    communicator->Gatherv(numberData.data(), numberData.size(), MPI::INT, allNumberData.data(), sizePerNode.data(), dataDispls.data(), MPI::INT, Communicator::MASTER_RANK);\n\n    return unpackBigintVector(allNumberSizes, allNumberData);\n}\n<commit_msg>Considering node weights<commit_after>#include \"QuadraticSieve.h\"\n#include \"QuadraticSieveScheduler.h\"\n#include \"QuadraticSieveElf.h\"\n#include \"common\/ProblemStatement.h\"\n#include \"common\/Utils.h\"\n#include <numeric>\n\ntemplate<typename ElemType>\nstd::ostream& operator<<(std::ostream& stream, const std::vector<ElemType>& list)\n{\n    stream << \"[\";\n    bool first = true;\n    for (const auto& element : list)\n    {\n        if (!first)\n            stream << \", \";\n        stream << element;\n        first = false;\n    }\n    stream << \"]\";\n\n    return stream;\n}\n\nusing namespace std;\nusing namespace std::placeholders;\n\nBigInt receiveBigInt(const Communicator& communicator);\nBigInt receiveBigIntFromMaster(const Communicator& communicator);\n\nstruct serializedBigIntDeleter\n{\n    void operator()(uint32_t* memory)\n    {\n        free(memory);\n    }\n};\n\ntypedef std::pair<std::unique_ptr<uint32_t, serializedBigIntDeleter>, size_t> SerializedBigInt;\n\ninline SerializedBigInt bigIntToArray(const BigInt& number)\n{\n    size_t arraySize;\n    std::unique_ptr<uint32_t, serializedBigIntDeleter> pointer(reinterpret_cast<uint32_t*>(\n        mpz_export(nullptr, &arraySize, -1, sizeof(uint32_t), 0, 0, number.get_mpz_t())\n    ), serializedBigIntDeleter());\n    return make_pair(std::move(pointer), arraySize);\n}\n\ninline BigInt arrayToBigInt(const SerializedBigInt& data)\n{\n    BigInt result;\n    mpz_import(result.get_mpz_t(), data.second, -1, sizeof(uint32_t), 0, 0, data.first.get());\n    return result;\n}\n\nQuadraticSieveScheduler::QuadraticSieveScheduler(const Communicator& communicator, const std::function<ElfPointer()>& factory) :\n    SchedulerTemplate(communicator, factory)\n{\n}\n\nvoid QuadraticSieveScheduler::provideData(istream& input)\n{\n    input >> number;\n\n    if (input.fail())\n        throw runtime_error(\"Failed to read BigInt from input stream in \" __FILE__);\n}\n\nvoid QuadraticSieveScheduler::outputData(ostream& output)\n{\n    output << p << endl;\n    output << q << endl;\n}\n\nvoid QuadraticSieveScheduler::generateData(const DataGenerationParameters&)\n{\n    \/\/ TODO: Use parameters and generate a random number\n    number = 1089911;\n}\n\nbool QuadraticSieveScheduler::hasData() const\n{\n    return number != 0;\n}\n\nvoid QuadraticSieveScheduler::doSimpleDispatch()\n{\n    tie(p, q) = QuadraticSieveHelper::factor(\n        number,\n        bind(&QuadraticSieveElf::sieveSmoothSquares, &elf(), _1, _2, _3, _4)\n    );\n}\n\nvoid packBigintVector(vector<size_t>& outSizes, vector<uint32_t>& outData, const vector<BigInt>& input)\n{\n    for (const auto& number : input)\n    {\n        auto serialized = bigIntToArray(number);\n        outSizes.push_back(serialized.second);\n        outData.insert(outData.end(), serialized.first.get(), serialized.first.get() + serialized.second);\n    }\n}\n\nSmoothSquareList unpackBigintVector(const vector<size_t>& sizes, const vector<uint32_t>& data)\n{\n    SmoothSquareList result;\n    auto dataIter = data.begin();\n    for (const auto size : sizes)\n    {\n        SerializedBigInt serialized;\n        serialized.second = size;\n        serialized.first.reset(reinterpret_cast<uint32_t*>(malloc(sizeof(uint32_t)*size)));\n        std::copy(dataIter, dataIter+size, serialized.first.get());\n        dataIter += size;\n        result.push_back(arrayToBigInt(serialized));\n    }\n\n    return result;\n}\n\nvoid QuadraticSieveScheduler::doDispatch()\n{\n    if (communicator.isMaster())\n    {\n        tie(p, q) = QuadraticSieveHelper::factor(\n            number,\n            bind(&QuadraticSieveScheduler::sieveDistributed, this, _1, _2, _3, _4)\n        );\n    }\n    else\n    {\n        BigInt number = receiveBigInt(communicator);\n        BigInt start = receiveBigIntFromMaster(communicator);\n        BigInt end = receiveBigIntFromMaster(communicator);\n        size_t factorBaseSize;\n        communicator->Bcast(&factorBaseSize, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n        vector<smallPrime_t> factorBase(factorBaseSize);\n        communicator->Bcast(factorBase.data(), factorBaseSize, MPI::INT, Communicator::MASTER_RANK);\n\n        auto result = elf().sieveSmoothSquares(start, end, number, factorBase);\n        int resultSize = result.size();\n        communicator->Gather(&resultSize, 1, MPI::INT, nullptr, 0, MPI::INT, Communicator::MASTER_RANK);\n\n        vector<size_t> resultsSizes;\n        vector<uint32_t> resultsData;\n        packBigintVector(resultsSizes, resultsData, result);\n\n        communicator->Gatherv(resultsSizes.data(), resultSize, MPI::UNSIGNED_LONG, nullptr, nullptr, nullptr, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n        communicator->Gatherv(resultsData.data(), resultsData.size(), MPI::INT, nullptr, nullptr, nullptr, MPI::INT, Communicator::MASTER_RANK);\n    }\n}\n\n\nvoid sendBigInt(const Communicator& communicator, const BigInt& number)\n{\n    auto serialized = bigIntToArray(number);\n    communicator->Bcast(&serialized.second, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n    communicator->Bcast(serialized.first.get(), serialized.second, MPI::INT, Communicator::MASTER_RANK);\n}\n\nBigInt receiveBigInt(const Communicator& communicator)\n{\n    SerializedBigInt result;\n    communicator->Bcast(&result.second, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n    result.first.reset(reinterpret_cast<uint32_t*>(malloc(result.second * sizeof(uint32_t))));\n    communicator->Bcast(result.first.get(), result.second, MPI::INT, Communicator::MASTER_RANK);\n    return arrayToBigInt(result);\n}\n\nvoid sendBigIntTo(const Communicator& communicator, const BigInt& number, int nodeId)\n{\n    auto serialized = bigIntToArray(number);\n    communicator->Send(&serialized.second, 1, MPI::UNSIGNED_LONG, nodeId, 0);\n    communicator->Send(serialized.first.get(), serialized.second, MPI::INT, nodeId, 0);\n}\n\nBigInt receiveBigIntFromMaster(const Communicator& communicator)\n{\n    SerializedBigInt result;\n    communicator->Recv(&result.second, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK, 0);\n    result.first.reset(reinterpret_cast<uint32_t*>(malloc(result.second * sizeof(uint32_t))));\n    communicator->Recv(result.first.get(), result.second, MPI::INT, Communicator::MASTER_RANK, 0);\n    return arrayToBigInt(result);\n}\n\nvector<BigInt> QuadraticSieveScheduler::sieveDistributed(\n    const BigInt& start,\n    const BigInt& end,\n    const BigInt& number,\n    const FactorBase& factorBase\n)\n{\n    sendBigInt(communicator, number);\n\n    BigInt intervalLengthBigInt = end - start;\n\n    if (!intervalLengthBigInt.fits_ulong_p())\n        throw runtime_error(\"Interval is too long!\");\n\n    uint64_t intervalLength = intervalLengthBigInt.get_ui();\n    cout << \"IntervalLength: \" << intervalLength << endl;\n    double basicChunkSize = div_ceil(intervalLength, communicator.size());\n    auto weights = communicator.weights();\n    cout << \"Weights: \" << weights << endl;\n\n    for (size_t nodeId=1; nodeId < communicator.size(); ++nodeId)\n    {\n        double weightedChunkSize = basicChunkSize * weights[nodeId];\n        cout << \"Chunksize for node \" << nodeId << \": \" << weightedChunkSize << endl;\n        BigInt partialStart = start + weightedChunkSize*nodeId;\n        BigInt partialEnd = min(partialStart + basicChunkSize, end);\n        sendBigIntTo(communicator, partialStart, nodeId);\n        sendBigIntTo(communicator, partialEnd, nodeId);\n    }\n\n    size_t factorBaseSize = factorBase.size();\n    communicator->Bcast(&factorBaseSize, 1, MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n    communicator->Bcast(const_cast<smallPrime_t*>(factorBase.data()), factorBaseSize, MPI::INT, Communicator::MASTER_RANK);\n\n    double masterChunkSize = basicChunkSize * weights[0];\n    SmoothSquareList masterResult = elf().sieveSmoothSquares(start, min(start + masterChunkSize, end), number, factorBase);\n    size_t resultSize = masterResult.size();\n\n    vector<size_t> numberSizes;\n    vector<uint32_t> numberData;\n    packBigintVector(numberSizes, numberData, masterResult);\n\n    vector<int> resultSizes(communicator.size());\n    communicator->Gather(&resultSize, 1, MPI::INT, resultSizes.data(), 1, MPI::INT, Communicator::MASTER_RANK);\n\n    auto totalSmoothSquares = std::accumulate(resultSizes.begin(), resultSizes.end(), 0);\n\n\n    \/\/ gather sizes of smooth squares\n    vector<int> displs(communicator.size());\n    displs[0] = 0;\n    for (size_t nodeId = 1; nodeId < communicator.size(); ++nodeId)\n    {\n        displs[nodeId] = displs[nodeId - 1] + resultSizes.at(nodeId - 1);\n    }\n    vector<size_t> allNumberSizes(totalSmoothSquares);\n    communicator->Gatherv(numberSizes.data(), resultSize, MPI::UNSIGNED_LONG, allNumberSizes.data(), resultSizes.data(), displs.data(), MPI::UNSIGNED_LONG, Communicator::MASTER_RANK);\n\n\n    \/\/ gather smooth squares\n    auto numberSizesSum = std::accumulate(allNumberSizes.begin(), allNumberSizes.end(), 0);\n    vector<uint32_t> allNumberData(numberSizesSum);\n    vector<int> sizePerNode(communicator.size());\n    auto accumulateStart = allNumberSizes.begin();\n    \/\/auto accumulateEnd = allNumberSizes.begin() + resultSizes[0];\n    for (size_t nodeId = 0; nodeId < communicator.size(); ++nodeId)\n    {\n        auto accumulateEnd = accumulateStart + resultSizes[nodeId];\n        sizePerNode[nodeId] = std::accumulate(accumulateStart, accumulateEnd, 0);\n        accumulateStart = accumulateEnd;\n\n    }\n    vector<int> dataDispls(communicator.size());\n    dataDispls[0] = 0;\n    for (size_t nodeId = 1; nodeId < communicator.size(); ++nodeId)\n    {\n        dataDispls[nodeId] = dataDispls[nodeId - 1] + sizePerNode[nodeId - 1];\n    }\n\n    communicator->Gatherv(numberData.data(), numberData.size(), MPI::INT, allNumberData.data(), sizePerNode.data(), dataDispls.data(), MPI::INT, Communicator::MASTER_RANK);\n\n    return unpackBigintVector(allNumberSizes, allNumberData);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The Art of C++ \/ Sequences\n\/\/ Copyright (c) 2015 Daniel Frey\n\n#include <tao\/seq\/tuple_cat.hpp>\n\n#include <type_traits>\n#include <tuple>\n\n#define USE std\n\/\/#define USE tao::seq\n\nint main()\n{\n  auto t = USE::tuple_cat( std::make_tuple( 1, true ),\n\t\t\t   std::make_tuple( 1.0 ),\n\t\t\t   std::make_tuple(),\n\t\t\t   std::make_tuple( 1UL, nullptr ) );\n\n  static_assert( std::is_same< decltype( t ), std::tuple< int, bool, double, unsigned long, std::nullptr_t > >::value, \"oops\" );\n\n  auto t2 = USE::tuple_cat( t, std::make_tuple( 1, true ),\n\t\t\t    t, std::make_tuple( 1.0 ),\n\t\t\t    t, std::make_tuple(),\n\t\t\t    t, std::make_tuple( 1UL, nullptr ) );\n\n  auto t3 = USE::tuple_cat( t2, std::make_tuple( 1, true ),\n\t\t\t    t2, std::make_tuple( 1.0 ),\n\t\t\t    t2, std::make_tuple(),\n\t\t\t    t2, std::make_tuple( 1UL, nullptr ) );\n\n  auto t4 = USE::tuple_cat( t3, std::make_tuple( 1, true ),\n\t\t\t    t2, std::make_tuple( 1.0 ),\n\t\t\t    t3, std::make_tuple(),\n\t\t\t    t2, std::make_tuple( 1UL, nullptr ) );\n\n  static_assert( std::tuple_size< decltype( t4 ) >::value == 265, \"oops\" );\n}\n<commit_msg>By default, test our own version<commit_after>\/\/ The Art of C++ \/ Sequences\n\/\/ Copyright (c) 2015 Daniel Frey\n\n#include <tao\/seq\/tuple_cat.hpp>\n\n#include <type_traits>\n#include <tuple>\n\n\/\/#define USE std\n#define USE tao::seq\n\nint main()\n{\n  auto t = USE::tuple_cat( std::make_tuple( 1, true ),\n\t\t\t   std::make_tuple( 1.0 ),\n\t\t\t   std::make_tuple(),\n\t\t\t   std::make_tuple( 1UL, nullptr ) );\n\n  static_assert( std::is_same< decltype( t ), std::tuple< int, bool, double, unsigned long, std::nullptr_t > >::value, \"oops\" );\n\n  auto t2 = USE::tuple_cat( t, std::make_tuple( 1, true ),\n\t\t\t    t, std::make_tuple( 1.0 ),\n\t\t\t    t, std::make_tuple(),\n\t\t\t    t, std::make_tuple( 1UL, nullptr ) );\n\n  auto t3 = USE::tuple_cat( t2, std::make_tuple( 1, true ),\n\t\t\t    t2, std::make_tuple( 1.0 ),\n\t\t\t    t2, std::make_tuple(),\n\t\t\t    t2, std::make_tuple( 1UL, nullptr ) );\n\n  auto t4 = USE::tuple_cat( t3, std::make_tuple( 1, true ),\n\t\t\t    t2, std::make_tuple( 1.0 ),\n\t\t\t    t3, std::make_tuple(),\n\t\t\t    t2, std::make_tuple( 1UL, nullptr ) );\n\n  static_assert( std::tuple_size< decltype( t4 ) >::value == 265, \"oops\" );\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\n#ifndef PCL_SURFACE_RECONSTRUCTION_IMPL_H_\n#define PCL_SURFACE_RECONSTRUCTION_IMPL_H_\n#include <pcl\/search\/pcl_search.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointInT> void\npcl::SurfaceReconstruction<PointInT>::reconstruct (pcl::PolygonMesh &output)\n{\n  \/\/ Copy the header\n  output.header = input_->header;\n\n  if (!initCompute ()) \n  {\n    output.cloud.width = output.cloud.height = 0;\n    output.cloud.data.clear ();\n    output.polygons.clear ();\n    return;\n  }\n\n  \/\/ Check if a space search locator was given\n  if (check_tree_)\n  {\n    if (!tree_)\n    {\n      if (input_->isOrganized ())\n        tree_.reset (new pcl::search::OrganizedNeighbor<PointInT> ());\n      else\n        tree_.reset (new pcl::search::KdTree<PointInT> (false));\n    }\n\n    \/\/ Send the surface dataset to the spatial locator\n    tree_->setInputCloud (input_, indices_);\n  }\n\n  \/\/ Set up the output dataset\n  pcl::toROSMsg (*input_, output.cloud); \/\/\/ NOTE: passing in boost shared pointer with * as const& should be OK here\n  output.polygons.clear ();\n  output.polygons.reserve (2*indices_->size ()); \/\/\/ NOTE: usually the number of triangles is around twice the number of vertices\n  \/\/ Perform the actual surface reconstruction\n  performReconstruction (output);\n\n  deinitCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointInT> void\npcl::SurfaceReconstruction<PointInT>::reconstruct (pcl::PointCloud<PointInT> &points,\n                                                   std::vector<pcl::Vertices> &polygons)\n{\n  \/\/ Copy the header\n  points.header = input_->header;\n\n  if (!initCompute ()) \n  {\n    points.width = points.height = 0;\n    points.data.clear ();\n    polygons.clear ();\n    return;\n  }\n\n  \/\/ Check if a space search locator was given\n  if (check_tree_)\n  {\n    if (!tree_)\n    {\n      if (input_->isOrganized ())\n        tree_.reset (new pcl::search::OrganizedNeighbor<PointInT> ());\n      else\n        tree_.reset (new pcl::search::KdTree<PointInT> (false));\n    }\n\n    \/\/ Send the surface dataset to the spatial locator\n    tree_->setInputCloud (input_, indices_);\n  }\n\n  \/\/ Set up the output dataset\n  polygons.clear ();\n  polygons.reserve (2 * indices_->size ()); \/\/\/ NOTE: usually the number of triangles is around twice the number of vertices\n  \/\/ Perform the actual surface reconstruction\n  performReconstruction (points, polygons);\n\n  deinitCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointInT> void\npcl::MeshConstruction<PointInT>::reconstruct (pcl::PolygonMesh &output)\n{\n  \/\/ Copy the header\n  output.header = input_->header;\n\n  if (!initCompute ()) \n  {\n    output.cloud.width = output.cloud.height = 0;\n    output.cloud.data.clear ();\n    output.polygons.clear ();\n    return;\n  }\n\n  \/\/ Check if a space search locator was given\n  if (check_tree_)\n  {\n    if (!tree_)\n    {\n      if (input_->isOrganized ())\n        tree_.reset (new pcl::search::OrganizedNeighbor<PointInT> ());\n      else\n        tree_.reset (new pcl::search::KdTree<PointInT> (false));\n    }\n\n    \/\/ Send the surface dataset to the spatial locator\n    tree_->setInputCloud (input_, indices_);\n  }\n\n  \/\/ Set up the output dataset\n  pcl::toROSMsg (*input_, output.cloud); \/\/\/ NOTE: passing in boost shared pointer with * as const& should be OK here\n  output.polygons.clear ();\n  output.polygons.reserve (2*indices_->size ()); \/\/\/ NOTE: usually the number of triangles is around twice the number of vertices\n  \/\/ Perform the actual surface reconstruction\n  performReconstruction (output);\n\n  deinitCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointInT> void\npcl::MeshConstruction<PointInT>::reconstruct (std::vector<pcl::Vertices> &polygons)\n{\n  if (!initCompute ()) \n  {\n    polygons.clear ();\n    return;\n  }\n\n  \/\/ Check if a space search locator was given\n  if (check_tree_)\n  {\n    if (!tree_)\n    {\n      if (input_->isOrganized ())\n        tree_.reset (new pcl::search::OrganizedNeighbor<PointInT> ());\n      else\n        tree_.reset (new pcl::search::KdTree<PointInT> (false));\n    }\n\n    \/\/ Send the surface dataset to the spatial locator\n    tree_->setInputCloud (input_, indices_);\n  }\n\n  \/\/ Set up the output dataset\n  \/\/polygons.clear ();\n  \/\/polygons.reserve (2 * indices_->size ()); \/\/\/ NOTE: usually the number of triangles is around twice the number of vertices\n  \/\/ Perform the actual surface reconstruction\n  performReconstruction (polygons);\n\n  deinitCompute ();\n}\n\n\n#endif  \/\/ PCL_SURFACE_RECONSTRUCTION_IMPL_H_\n\n<commit_msg>don't automatically clear the polygons for @MeshConstruction@<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\n#ifndef PCL_SURFACE_RECONSTRUCTION_IMPL_H_\n#define PCL_SURFACE_RECONSTRUCTION_IMPL_H_\n#include <pcl\/search\/pcl_search.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointInT> void\npcl::SurfaceReconstruction<PointInT>::reconstruct (pcl::PolygonMesh &output)\n{\n  \/\/ Copy the header\n  output.header = input_->header;\n\n  if (!initCompute ()) \n  {\n    output.cloud.width = output.cloud.height = 0;\n    output.cloud.data.clear ();\n    output.polygons.clear ();\n    return;\n  }\n\n  \/\/ Check if a space search locator was given\n  if (check_tree_)\n  {\n    if (!tree_)\n    {\n      if (input_->isOrganized ())\n        tree_.reset (new pcl::search::OrganizedNeighbor<PointInT> ());\n      else\n        tree_.reset (new pcl::search::KdTree<PointInT> (false));\n    }\n\n    \/\/ Send the surface dataset to the spatial locator\n    tree_->setInputCloud (input_, indices_);\n  }\n\n  \/\/ Set up the output dataset\n  pcl::toROSMsg (*input_, output.cloud); \/\/\/ NOTE: passing in boost shared pointer with * as const& should be OK here\n  output.polygons.clear ();\n  output.polygons.reserve (2*indices_->size ()); \/\/\/ NOTE: usually the number of triangles is around twice the number of vertices\n  \/\/ Perform the actual surface reconstruction\n  performReconstruction (output);\n\n  deinitCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointInT> void\npcl::SurfaceReconstruction<PointInT>::reconstruct (pcl::PointCloud<PointInT> &points,\n                                                   std::vector<pcl::Vertices> &polygons)\n{\n  \/\/ Copy the header\n  points.header = input_->header;\n\n  if (!initCompute ()) \n  {\n    points.width = points.height = 0;\n    points.data.clear ();\n    polygons.clear ();\n    return;\n  }\n\n  \/\/ Check if a space search locator was given\n  if (check_tree_)\n  {\n    if (!tree_)\n    {\n      if (input_->isOrganized ())\n        tree_.reset (new pcl::search::OrganizedNeighbor<PointInT> ());\n      else\n        tree_.reset (new pcl::search::KdTree<PointInT> (false));\n    }\n\n    \/\/ Send the surface dataset to the spatial locator\n    tree_->setInputCloud (input_, indices_);\n  }\n\n  \/\/ Set up the output dataset\n  polygons.clear ();\n  polygons.reserve (2 * indices_->size ()); \/\/\/ NOTE: usually the number of triangles is around twice the number of vertices\n  \/\/ Perform the actual surface reconstruction\n  performReconstruction (points, polygons);\n\n  deinitCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointInT> void\npcl::MeshConstruction<PointInT>::reconstruct (pcl::PolygonMesh &output)\n{\n  \/\/ Copy the header\n  output.header = input_->header;\n\n  if (!initCompute ()) \n  {\n    output.cloud.width = output.cloud.height = 0;\n    output.cloud.data.clear ();\n    output.polygons.clear ();\n    return;\n  }\n\n  \/\/ Check if a space search locator was given\n  if (check_tree_)\n  {\n    if (!tree_)\n    {\n      if (input_->isOrganized ())\n        tree_.reset (new pcl::search::OrganizedNeighbor<PointInT> ());\n      else\n        tree_.reset (new pcl::search::KdTree<PointInT> (false));\n    }\n\n    \/\/ Send the surface dataset to the spatial locator\n    tree_->setInputCloud (input_, indices_);\n  }\n\n  \/\/ Set up the output dataset\n  pcl::toROSMsg (*input_, output.cloud); \/\/\/ NOTE: passing in boost shared pointer with * as const& should be OK here\n\/\/  output.polygons.clear ();\n\/\/  output.polygons.reserve (2*indices_->size ()); \/\/\/ NOTE: usually the number of triangles is around twice the number of vertices\n  \/\/ Perform the actual surface reconstruction\n  performReconstruction (output);\n\n  deinitCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointInT> void\npcl::MeshConstruction<PointInT>::reconstruct (std::vector<pcl::Vertices> &polygons)\n{\n  if (!initCompute ()) \n  {\n    polygons.clear ();\n    return;\n  }\n\n  \/\/ Check if a space search locator was given\n  if (check_tree_)\n  {\n    if (!tree_)\n    {\n      if (input_->isOrganized ())\n        tree_.reset (new pcl::search::OrganizedNeighbor<PointInT> ());\n      else\n        tree_.reset (new pcl::search::KdTree<PointInT> (false));\n    }\n\n    \/\/ Send the surface dataset to the spatial locator\n    tree_->setInputCloud (input_, indices_);\n  }\n\n  \/\/ Set up the output dataset\n  \/\/polygons.clear ();\n  \/\/polygons.reserve (2 * indices_->size ()); \/\/\/ NOTE: usually the number of triangles is around twice the number of vertices\n  \/\/ Perform the actual surface reconstruction\n  performReconstruction (polygons);\n\n  deinitCompute ();\n}\n\n\n#endif  \/\/ PCL_SURFACE_RECONSTRUCTION_IMPL_H_\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef slic3r_LOG_HPP\n#define slic3r_LOG_HPP\n\n#include <string>\n#include <vector>\n#include <sstream>\n#include <iostream>\n\nnamespace Slic3r {\n\nclass Log {\npublic:\n    static void fatal_error(std::string topic, std::wstring message) {\n        std::cerr << topic << \" FERR\" << \": \";\n        std::wcerr << message << std::endl;\n    }\n    static void error(std::string topic, std::wstring message) {\n        std::cerr << topic << \"  ERR\" << \": \";\n        std::wcerr << message << std::endl;\n    }\n\n    static void error(std::string topic, std::string message) {\n        std::cerr << topic << \"  ERR\" << \": \";\n        std::cerr << message << std::endl;\n    }\n\n    static void info(std::string topic, std::wstring message) {\n        std::clog << topic << \" INFO\" << \": \";\n        std::wclog << message << std::endl;\n    }\n    static void info(std::string topic, std::string message) {\n        std::clog << topic << \" INFO\" << \": \";\n        std::clog << message << std::endl;\n    }\n\n    static void warn(std::string topic, std::wstring message) {\n        std::cerr << topic << \" WARN\" << \": \";\n        std::wcerr << message << std::endl;\n    }\n    static void warn(std::string topic, std::string message) {\n        std::cerr << topic << \" WARN\" << \": \";\n        std::cerr << message << std::endl;\n    }\n\n    static void debug(std::string topic, std::wstring message) {\n        std::cerr << topic << \" DEBUG\" << \": \";\n        std::wcerr << message << std::endl;\n    }\n    static void debug(std::string topic, std::string message) {\n        std::cerr << topic << \" DEBUG\" << \": \";\n        std::cerr << message << std::endl;\n    }\n\n    static std::ostream& debug(std::string topic) {\n        std::cerr << topic << \" DEBUG\" << \": \";\n        return std::cerr;\n    }\n\n};\n\n\/\/\/ Utility debug function to transform a std::vector of anything that \n\/\/\/ supports ostream& operator<<() into a std::string.\ntemplate <typename T>\nstd::string \nlog_string(const std::vector<T>& in) \n{\n    std::stringstream ss;\n    bool first {true};\n    ss << \"[ \";\n    for (auto& c : in) {\n        if (!first) {\n            ss << \", \";\n        }\n        ss << c;\n        first = false;\n    }\n\n    ss << \" ]\";\n\n    return ss.str();\n}\n\n}\n\n#endif \/\/ slic3r_LOG_HPP\n<commit_msg>Added ostream version of error<commit_after>#ifndef slic3r_LOG_HPP\n#define slic3r_LOG_HPP\n\n#include <string>\n#include <vector>\n#include <sstream>\n#include <iostream>\n\nnamespace Slic3r {\n\nclass Log {\npublic:\n    static void fatal_error(std::string topic, std::wstring message) {\n        std::cerr << topic << \" FERR\" << \": \";\n        std::wcerr << message << std::endl;\n    }\n    static void error(std::string topic, std::wstring message) {\n        std::cerr << topic << \"  ERR\" << \": \";\n        std::wcerr << message << std::endl;\n    }\n\n    static void error(std::string topic, std::string message) {\n        std::cerr << topic << \"  ERR\" << \": \";\n        std::cerr << message << std::endl;\n    }\n\n    static void info(std::string topic, std::wstring message) {\n        std::clog << topic << \" INFO\" << \": \";\n        std::wclog << message << std::endl;\n    }\n    static void info(std::string topic, std::string message) {\n        std::clog << topic << \" INFO\" << \": \";\n        std::clog << message << std::endl;\n    }\n\n    static void warn(std::string topic, std::wstring message) {\n        std::cerr << topic << \" WARN\" << \": \";\n        std::wcerr << message << std::endl;\n    }\n    static void warn(std::string topic, std::string message) {\n        std::cerr << topic << \" WARN\" << \": \";\n        std::cerr << message << std::endl;\n    }\n\n    static void debug(std::string topic, std::wstring message) {\n        std::cerr << topic << \" DEBUG\" << \": \";\n        std::wcerr << message << std::endl;\n    }\n    static void debug(std::string topic, std::string message) {\n        std::cerr << topic << \" DEBUG\" << \": \";\n        std::cerr << message << std::endl;\n    }\n    static std::ostream& error(std::string topic) {\n        std::cerr << topic << \"   ERR\" << \": \";\n        return std::cerr;\n    }\n    static std::ostream& debug(std::string topic) {\n        std::cerr << topic << \" DEBUG\" << \": \";\n        return std::cerr;\n    }\n\n};\n\n\/\/\/ Utility debug function to transform a std::vector of anything that \n\/\/\/ supports ostream& operator<<() into a std::string.\ntemplate <typename T>\nstd::string \nlog_string(const std::vector<T>& in) \n{\n    std::stringstream ss;\n    bool first {true};\n    ss << \"[ \";\n    for (auto& c : in) {\n        if (!first) {\n            ss << \", \";\n        }\n        ss << c;\n        first = false;\n    }\n\n    ss << \" ]\";\n\n    return ss.str();\n}\n\n}\n\n#endif \/\/ slic3r_LOG_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdlib>\n#include <cstdio> \/\/ debug\n#include <algorithm>\n#include <iostream>\n#include <iomanip>\n#include <cstring>\n\n#include <tightdb\/utilities.hpp>\n#include <tightdb\/array_string.hpp>\n#include <tightdb\/impl\/destroy_guard.hpp>\n#include <tightdb\/column.hpp>\n\nusing namespace std;\nusing namespace tightdb;\n\n\nnamespace {\n\nconst int max_width = 64;\n\n\/\/ Round up to nearest possible block length: {0, 1, 4, 8, 16, 32, 64, 128, ...}. We include 1 to store empty strings\n\/\/ in as little space as possible, because 0 can only store nulls.\nsize_t round_up(size_t size)\n{\n    if (size == 0)\n        return 0;\n\n    if (size == 1)\n        return 1;\n\n    size |= size >> 1;\n    size |= size >> 2;\n    size |= size >> 4;\n    ++size;\n    return size;\n}\n\n} \/\/ anonymous namespace\n\nbool ArrayString::is_null(size_t ndx) const\n{\n    TIGHTDB_ASSERT(ndx < m_size);\n    StringData sd = get(ndx);\n    return sd.data() == null_ptr;\n}\n\nvoid ArrayString::set_null(size_t ndx)\n{\n    TIGHTDB_ASSERT(ndx < m_size);\n    StringData sd = StringData(null_ptr, 0);\n    set(ndx, sd);\n}\n\nvoid ArrayString::set(size_t ndx, StringData value)\n{\n    TIGHTDB_ASSERT(ndx < m_size);\n    TIGHTDB_ASSERT(value.size() < size_t(max_width)); \/\/ otherwise we have to use another column type\n\n    \/\/ Check if we need to copy before modifying\n    copy_on_write(); \/\/ Throws\n\n    \/\/ Make room for the new value plus a zero-termination\n    if (m_width <= value.size()) {\n        \/\/ if m_width == 0 then entire array contains only null entries\n        if (value.data() == null_ptr && m_width == 0) {\n            return; \/\/ set null element to null\n        }\n\n\/\/        TIGHTDB_ASSERT(0 < value.size());\n\n        \/\/ Calc min column width\n        size_t new_width;\n        if (m_width == 0 && value.size() == 0)\n            new_width = ::round_up(1); \/\/ Entire Array is nulls; expand to m_width > 0\n        else\n            new_width = ::round_up(value.size() + 1);\n\n        \/\/TIGHTDB_ASSERT(value.size() < new_width);\n\n        \/\/ FIXME: Should we try to avoid double copying when realloc fails to preserve the address?\n        alloc(m_size, new_width); \/\/ Throws\n\n        char* base = m_data;\n        char* new_end = base + m_size*new_width;\n\n        \/\/ Expand the old values in reverse order\n        if (0 < m_width) {\n            const char* old_end = base + m_size*m_width;\n            while (new_end != base) {\n                *--new_end = char(*--old_end + (new_width-m_width));\n                {\n                    \/\/ extend 0-padding\n                    char* new_begin = new_end - (new_width-m_width);\n                    fill(new_begin, new_end, 0);\n                    new_end = new_begin;\n                }\n                {\n                    \/\/ copy string payload\n                    const char* old_begin = old_end - (m_width-1);\n                    if(static_cast<size_t>(old_end - old_begin) < m_width) \/\/ non-null string\n                        new_end = copy_backward(old_begin, old_end, new_end);\n                    old_end = old_begin;\n                }\n            }\n        }\n        else {\n            \/\/ m_width == 0, so all elements are null. Expand that to new width.\n            while (new_end != base) {\n                *--new_end = new_width; \/\/  char(new_width - 1);\n                {\n                    char* new_begin = new_end - (new_width-1);\n                    fill(new_begin, new_end, 0); \/\/ Fill with zero bytes\n                    new_end = new_begin;\n                }\n            }\n        }\n\n        m_width = new_width;\n    }\n\n    TIGHTDB_ASSERT(0 < m_width);\n\n    \/\/ Set the value\n    char* begin = m_data + (ndx * m_width);\n    char* end   = begin + (m_width-1);\n    begin = copy(value.data(), value.data()+value.size(), begin);\n    fill(begin, end, 0); \/\/ Pad with zero bytes\n    TIGHTDB_STATIC_ASSERT(max_width <= 128, \"Padding size must fit in 7-bits\");\n\/\/    TIGHTDB_ASSERT(end - begin < max_width);\n    if (value.data() == null_ptr) {\n        *end = m_width;\n    }\n    else {\n        int pad_size = int(end - begin);\n        *end = char(pad_size);\n    }\n}\n\n\nvoid ArrayString::insert(size_t ndx, StringData value)\n{\n    TIGHTDB_ASSERT(ndx <= m_size);\n    TIGHTDB_ASSERT(value.size() < size_t(max_width)); \/\/ otherwise we have to use another column type\n\n    \/\/ Check if we need to copy before modifying\n    copy_on_write(); \/\/ Throws\n\n    \/\/ Todo: Below code will perform up to 3 memcpy() operations in worst case. Todo, if we improve the\n    \/\/ allocator to make a gap for the new value for us, we can have just 1. We can also have 2 by merging\n    \/\/ memmove() and set(), but it's a bit complex. May be done after support of null is completed.\n\n    \/\/ Allocate room for the new value\n    alloc(m_size+1, m_width); \/\/ Throws\n    \n    \/\/ Make gap for new value\n    memmove(m_data + m_width * (ndx + 1), m_data + m_width * ndx, m_width * (m_size - ndx));\n\n    m_size++;\n\n    \/\/ Set new value\n    set(ndx, value);\n    return;\n}\n\nvoid ArrayString::erase(size_t ndx)\n{\n    TIGHTDB_ASSERT(ndx < m_size);\n\n    \/\/ Check if we need to copy before modifying\n    copy_on_write(); \/\/ Throws\n\n    \/\/ move data backwards after deletion\n    if (ndx < m_size-1) {\n        char* new_begin = m_data + ndx*m_width;\n        char* old_begin = new_begin + m_width;\n        char* old_end   = m_data + m_size*m_width;\n        copy(old_begin, old_end, new_begin);\n    }\n\n    --m_size;\n\n    \/\/ Update size in header\n    set_header_size(m_size);\n}\n\nsize_t ArrayString::CalcByteLen(size_t count, size_t width) const\n{\n    \/\/ FIXME: This arithemtic could overflow. Consider using one of\n    \/\/ the functions in <tightdb\/util\/safe_int_ops.hpp>\n    return header_size + (count * width);\n}\n\nsize_t ArrayString::CalcItemCount(size_t bytes, size_t width) const TIGHTDB_NOEXCEPT\n{\n    if (width == 0) return size_t(-1); \/\/ zero-width gives infinite space\n\n    size_t bytes_without_header = bytes - header_size;\n    return bytes_without_header \/ width;\n}\n\nsize_t ArrayString::count(StringData value, size_t begin, size_t end) const TIGHTDB_NOEXCEPT\n{\n    size_t num_matches = 0;\n\n    size_t begin_2 = begin;\n    for (;;) {\n        size_t ndx = find_first(value, begin_2, end);\n        if (ndx == not_found)\n            break;\n        ++num_matches;\n        begin_2 = ndx + 1;\n    }\n\n    return num_matches;\n}\n\nsize_t ArrayString::find_first(StringData value, size_t begin, size_t end) const TIGHTDB_NOEXCEPT\n{\n    if (end == size_t(-1))\n        end = m_size;\n    TIGHTDB_ASSERT(begin <= m_size && end <= m_size && begin <= end);\n\n    if (m_width == 0)\n        return value.size() == 0 && begin < end ? begin : size_t(-1);\n\n    \/\/ A string can never be wider than the column width\n    if (m_width <= value.size())\n        return size_t(-1);\n\n    if (value.size() == 0) {\n        const char* data = m_data + (m_width-1);\n        for (size_t i = begin; i != end; ++i) {\n            size_t size = (m_width-1) - data[i * m_width];\n            if (TIGHTDB_UNLIKELY(size == 0))\n                return i;\n        }\n    }\n    else {\n        for (size_t i = begin; i != end; ++i) {\n            const char* data = m_data + (i * m_width);\n            size_t j = 0;\n            for (;;) {\n                if (TIGHTDB_LIKELY(data[j] != value[j]))\n                    break;\n                ++j;\n                if (TIGHTDB_UNLIKELY(j == value.size())) {\n                    size_t size = (m_width-1) - data[m_width-1];\n                    if (TIGHTDB_LIKELY(size == value.size()))\n                        return i;\n                    break;\n                }\n            }\n        }\n    }\n\n    return not_found;\n}\n\nvoid ArrayString::find_all(Column& result, StringData value, size_t add_offset,\n                           size_t begin, size_t end)\n{\n    size_t begin_2 = begin;\n    for (;;) {\n        size_t ndx = find_first(value, begin_2, end);\n        if (ndx == not_found)\n            break;\n        result.add(add_offset + ndx); \/\/ Throws\n        begin_2 = ndx + 1;\n    }\n}\n\nbool ArrayString::compare_string(const ArrayString& c) const TIGHTDB_NOEXCEPT\n{\n    if (c.size() != size())\n        return false;\n\n    for (size_t i = 0; i < size(); ++i) {\n        if (get(i) != c.get(i))\n            return false;\n    }\n\n    return true;\n}\n\nref_type ArrayString::bptree_leaf_insert(size_t ndx, StringData value, TreeInsertBase& state)\n{\n    size_t leaf_size = size();\n    TIGHTDB_ASSERT(leaf_size <= TIGHTDB_MAX_BPNODE_SIZE);\n    if (leaf_size < ndx) ndx = leaf_size;\n    if (TIGHTDB_LIKELY(leaf_size < TIGHTDB_MAX_BPNODE_SIZE)) {\n        insert(ndx, value); \/\/ Throws\n        return 0; \/\/ Leaf was not split\n    }\n\n    \/\/ Split leaf node\n    ArrayString new_leaf(m_alloc);\n    new_leaf.create(); \/\/ Throws\n    if (ndx == leaf_size) {\n        new_leaf.add(value); \/\/ Throws\n        state.m_split_offset = ndx;\n    }\n    else {\n        for (size_t i = ndx; i != leaf_size; ++i)\n            new_leaf.add(get(i)); \/\/ Throws\n        truncate(ndx); \/\/ Throws\n        add(value); \/\/ Throws\n        state.m_split_offset = ndx + 1;\n    }\n    state.m_split_size = leaf_size + 1;\n    return new_leaf.get_ref();\n}\n\n\nMemRef ArrayString::slice(size_t offset, size_t size, Allocator& target_alloc) const\n{\n    TIGHTDB_ASSERT(is_attached());\n\n    \/\/ FIXME: This can be optimized as a single contiguous copy\n    \/\/ operation.\n    ArrayString slice(target_alloc);\n    _impl::ShallowArrayDestroyGuard dg(&slice);\n    slice.create(); \/\/ Throws\n    size_t begin = offset;\n    size_t end   = offset + size;\n    for (size_t i = begin; i != end; ++i) {\n        StringData value = get(i);\n        slice.add(value); \/\/ Throws\n    }\n    dg.release();\n    return slice.get_mem();\n}\n\n\n#ifdef TIGHTDB_DEBUG\n\nvoid ArrayString::string_stats() const\n{\n    size_t total = 0;\n    size_t longest = 0;\n\n    for (size_t i = 0; i < m_size; ++i) {\n        StringData str = get(i);\n        size_t size = str.size() + 1;\n        total += size;\n        if (size > longest) longest = size;\n    }\n\n    size_t size = m_size * m_width;\n    size_t zeroes = size - total;\n    size_t zavg = zeroes \/ (m_size ? m_size : 1); \/\/ avoid possible div by zero\n\n    cout << \"Size: \" << m_size << \"\\n\";\n    cout << \"Width: \" << m_width << \"\\n\";\n    cout << \"Total: \" << size << \"\\n\";\n    cout << \"Capacity: \" << m_capacity << \"\\n\\n\";\n    cout << \"Bytes string: \" << total << \"\\n\";\n    cout << \"     longest: \" << longest << \"\\n\";\n    cout << \"Bytes zeroes: \" << zeroes << \"\\n\";\n    cout << \"         avg: \" << zavg << \"\\n\";\n}\n\n\nvoid ArrayString::to_dot(ostream& out, StringData title) const\n{\n    ref_type ref = get_ref();\n\n    if (title.size() != 0) {\n        out << \"subgraph cluster_\" << ref << \" {\" << endl;\n        out << \" label = \\\"\" << title << \"\\\";\" << endl;\n        out << \" color = white;\" << endl;\n    }\n\n    out << \"n\" << hex << ref << dec << \"[shape=none,label=<\";\n    out << \"<TABLE BORDER=\\\"0\\\" CELLBORDER=\\\"1\\\" CELLSPACING=\\\"0\\\" CELLPADDING=\\\"4\\\"><TR>\" << endl;\n\n    \/\/ Header\n    out << \"<TD BGCOLOR=\\\"lightgrey\\\"><FONT POINT-SIZE=\\\"7\\\">\";\n    out << \"0x\" << hex << ref << dec << \"<\/FONT><\/TD>\" << endl;\n\n    for (size_t i = 0; i < m_size; ++i)\n        out << \"<TD>\\\"\" << get(i) << \"\\\"<\/TD>\" << endl;\n\n    out << \"<\/TR><\/TABLE>>];\" << endl;\n\n    if (title.size() != 0)\n        out << \"}\" << endl;\n\n    to_dot_parent_edge(out);\n}\n\n#endif \/\/ TIGHTDB_DEBUG\n<commit_msg>Update array_string.cpp<commit_after>#include <cstdlib>\n#include <cstdio> \/\/ debug\n#include <algorithm>\n#include <iostream>\n#include <iomanip>\n#include <cstring>\n\n#include <tightdb\/utilities.hpp>\n#include <tightdb\/array_string.hpp>\n#include <tightdb\/impl\/destroy_guard.hpp>\n#include <tightdb\/column.hpp>\n\nusing namespace std;\nusing namespace tightdb;\n\n\nnamespace {\n\nconst int max_width = 64;\n\n\/\/ Round up to nearest possible block length: {0, 1, 4, 8, 16, 32, 64, 128, ...}. We include 1 to store empty \n\/\/ strings in as little space as possible, because 0 can only store nulls.\nsize_t round_up(size_t size)\n{\n    if (size == 0)\n        return 0;\n\n    if (size == 1)\n        return 1;\n\n    size |= size >> 1;\n    size |= size >> 2;\n    size |= size >> 4;\n    ++size;\n    return size;\n}\n\n} \/\/ anonymous namespace\n\nbool ArrayString::is_null(size_t ndx) const\n{\n    TIGHTDB_ASSERT(ndx < m_size);\n    StringData sd = get(ndx);\n    return sd.data() == null_ptr;\n}\n\nvoid ArrayString::set_null(size_t ndx)\n{\n    TIGHTDB_ASSERT(ndx < m_size);\n    StringData sd = StringData(null_ptr, 0);\n    set(ndx, sd);\n}\n\nvoid ArrayString::set(size_t ndx, StringData value)\n{\n    TIGHTDB_ASSERT(ndx < m_size);\n    TIGHTDB_ASSERT(value.size() < size_t(max_width)); \/\/ otherwise we have to use another column type\n\n    \/\/ Check if we need to copy before modifying\n    copy_on_write(); \/\/ Throws\n\n    \/\/ Make room for the new value plus a zero-termination\n    if (m_width <= value.size()) {\n        \/\/ if m_width == 0 then entire array contains only null entries\n        if (value.data() == null_ptr && m_width == 0) {\n            return; \/\/ set null element to null\n        }\n\n\/\/        TIGHTDB_ASSERT(0 < value.size());\n\n        \/\/ Calc min column width\n        size_t new_width;\n        if (m_width == 0 && value.size() == 0)\n            new_width = ::round_up(1); \/\/ Entire Array is nulls; expand to m_width > 0\n        else\n            new_width = ::round_up(value.size() + 1);\n\n        \/\/TIGHTDB_ASSERT(value.size() < new_width);\n\n        \/\/ FIXME: Should we try to avoid double copying when realloc fails to preserve the address?\n        alloc(m_size, new_width); \/\/ Throws\n\n        char* base = m_data;\n        char* new_end = base + m_size*new_width;\n\n        \/\/ Expand the old values in reverse order\n        if (0 < m_width) {\n            const char* old_end = base + m_size*m_width;\n            while (new_end != base) {\n                *--new_end = char(*--old_end + (new_width-m_width));\n                {\n                    \/\/ extend 0-padding\n                    char* new_begin = new_end - (new_width-m_width);\n                    fill(new_begin, new_end, 0);\n                    new_end = new_begin;\n                }\n                {\n                    \/\/ copy string payload\n                    const char* old_begin = old_end - (m_width-1);\n                    if(static_cast<size_t>(old_end - old_begin) < m_width) \/\/ non-null string\n                        new_end = copy_backward(old_begin, old_end, new_end);\n                    old_end = old_begin;\n                }\n            }\n        }\n        else {\n            \/\/ m_width == 0, so all elements are null. Expand that to new width.\n            while (new_end != base) {\n                *--new_end = new_width; \/\/  char(new_width - 1);\n                {\n                    char* new_begin = new_end - (new_width-1);\n                    fill(new_begin, new_end, 0); \/\/ Fill with zero bytes\n                    new_end = new_begin;\n                }\n            }\n        }\n\n        m_width = new_width;\n    }\n\n    TIGHTDB_ASSERT(0 < m_width);\n\n    \/\/ Set the value\n    char* begin = m_data + (ndx * m_width);\n    char* end   = begin + (m_width-1);\n    begin = copy(value.data(), value.data()+value.size(), begin);\n    fill(begin, end, 0); \/\/ Pad with zero bytes\n    TIGHTDB_STATIC_ASSERT(max_width <= 128, \"Padding size must fit in 7-bits\");\n\/\/    TIGHTDB_ASSERT(end - begin < max_width);\n    if (value.data() == null_ptr) {\n        *end = m_width;\n    }\n    else {\n        int pad_size = int(end - begin);\n        *end = char(pad_size);\n    }\n}\n\n\nvoid ArrayString::insert(size_t ndx, StringData value)\n{\n    TIGHTDB_ASSERT(ndx <= m_size);\n    TIGHTDB_ASSERT(value.size() < size_t(max_width)); \/\/ otherwise we have to use another column type\n\n    \/\/ Check if we need to copy before modifying\n    copy_on_write(); \/\/ Throws\n\n    \/\/ Todo: Below code will perform up to 3 memcpy() operations in worst case. Todo, if we improve the\n    \/\/ allocator to make a gap for the new value for us, we can have just 1. We can also have 2 by merging\n    \/\/ memmove() and set(), but it's a bit complex. May be done after support of null is completed.\n\n    \/\/ Allocate room for the new value\n    alloc(m_size+1, m_width); \/\/ Throws\n    \n    \/\/ Make gap for new value\n    memmove(m_data + m_width * (ndx + 1), m_data + m_width * ndx, m_width * (m_size - ndx));\n\n    m_size++;\n\n    \/\/ Set new value\n    set(ndx, value);\n    return;\n}\n\nvoid ArrayString::erase(size_t ndx)\n{\n    TIGHTDB_ASSERT(ndx < m_size);\n\n    \/\/ Check if we need to copy before modifying\n    copy_on_write(); \/\/ Throws\n\n    \/\/ move data backwards after deletion\n    if (ndx < m_size-1) {\n        char* new_begin = m_data + ndx*m_width;\n        char* old_begin = new_begin + m_width;\n        char* old_end   = m_data + m_size*m_width;\n        copy(old_begin, old_end, new_begin);\n    }\n\n    --m_size;\n\n    \/\/ Update size in header\n    set_header_size(m_size);\n}\n\nsize_t ArrayString::CalcByteLen(size_t count, size_t width) const\n{\n    \/\/ FIXME: This arithemtic could overflow. Consider using one of\n    \/\/ the functions in <tightdb\/util\/safe_int_ops.hpp>\n    return header_size + (count * width);\n}\n\nsize_t ArrayString::CalcItemCount(size_t bytes, size_t width) const TIGHTDB_NOEXCEPT\n{\n    if (width == 0) return size_t(-1); \/\/ zero-width gives infinite space\n\n    size_t bytes_without_header = bytes - header_size;\n    return bytes_without_header \/ width;\n}\n\nsize_t ArrayString::count(StringData value, size_t begin, size_t end) const TIGHTDB_NOEXCEPT\n{\n    size_t num_matches = 0;\n\n    size_t begin_2 = begin;\n    for (;;) {\n        size_t ndx = find_first(value, begin_2, end);\n        if (ndx == not_found)\n            break;\n        ++num_matches;\n        begin_2 = ndx + 1;\n    }\n\n    return num_matches;\n}\n\nsize_t ArrayString::find_first(StringData value, size_t begin, size_t end) const TIGHTDB_NOEXCEPT\n{\n    if (end == size_t(-1))\n        end = m_size;\n    TIGHTDB_ASSERT(begin <= m_size && end <= m_size && begin <= end);\n\n    if (m_width == 0)\n        return value.size() == 0 && begin < end ? begin : size_t(-1);\n\n    \/\/ A string can never be wider than the column width\n    if (m_width <= value.size())\n        return size_t(-1);\n\n    if (value.size() == 0) {\n        const char* data = m_data + (m_width-1);\n        for (size_t i = begin; i != end; ++i) {\n            size_t size = (m_width-1) - data[i * m_width];\n            if (TIGHTDB_UNLIKELY(size == 0))\n                return i;\n        }\n    }\n    else {\n        for (size_t i = begin; i != end; ++i) {\n            const char* data = m_data + (i * m_width);\n            size_t j = 0;\n            for (;;) {\n                if (TIGHTDB_LIKELY(data[j] != value[j]))\n                    break;\n                ++j;\n                if (TIGHTDB_UNLIKELY(j == value.size())) {\n                    size_t size = (m_width-1) - data[m_width-1];\n                    if (TIGHTDB_LIKELY(size == value.size()))\n                        return i;\n                    break;\n                }\n            }\n        }\n    }\n\n    return not_found;\n}\n\nvoid ArrayString::find_all(Column& result, StringData value, size_t add_offset,\n                           size_t begin, size_t end)\n{\n    size_t begin_2 = begin;\n    for (;;) {\n        size_t ndx = find_first(value, begin_2, end);\n        if (ndx == not_found)\n            break;\n        result.add(add_offset + ndx); \/\/ Throws\n        begin_2 = ndx + 1;\n    }\n}\n\nbool ArrayString::compare_string(const ArrayString& c) const TIGHTDB_NOEXCEPT\n{\n    if (c.size() != size())\n        return false;\n\n    for (size_t i = 0; i < size(); ++i) {\n        if (get(i) != c.get(i))\n            return false;\n    }\n\n    return true;\n}\n\nref_type ArrayString::bptree_leaf_insert(size_t ndx, StringData value, TreeInsertBase& state)\n{\n    size_t leaf_size = size();\n    TIGHTDB_ASSERT(leaf_size <= TIGHTDB_MAX_BPNODE_SIZE);\n    if (leaf_size < ndx) ndx = leaf_size;\n    if (TIGHTDB_LIKELY(leaf_size < TIGHTDB_MAX_BPNODE_SIZE)) {\n        insert(ndx, value); \/\/ Throws\n        return 0; \/\/ Leaf was not split\n    }\n\n    \/\/ Split leaf node\n    ArrayString new_leaf(m_alloc);\n    new_leaf.create(); \/\/ Throws\n    if (ndx == leaf_size) {\n        new_leaf.add(value); \/\/ Throws\n        state.m_split_offset = ndx;\n    }\n    else {\n        for (size_t i = ndx; i != leaf_size; ++i)\n            new_leaf.add(get(i)); \/\/ Throws\n        truncate(ndx); \/\/ Throws\n        add(value); \/\/ Throws\n        state.m_split_offset = ndx + 1;\n    }\n    state.m_split_size = leaf_size + 1;\n    return new_leaf.get_ref();\n}\n\n\nMemRef ArrayString::slice(size_t offset, size_t size, Allocator& target_alloc) const\n{\n    TIGHTDB_ASSERT(is_attached());\n\n    \/\/ FIXME: This can be optimized as a single contiguous copy\n    \/\/ operation.\n    ArrayString slice(target_alloc);\n    _impl::ShallowArrayDestroyGuard dg(&slice);\n    slice.create(); \/\/ Throws\n    size_t begin = offset;\n    size_t end   = offset + size;\n    for (size_t i = begin; i != end; ++i) {\n        StringData value = get(i);\n        slice.add(value); \/\/ Throws\n    }\n    dg.release();\n    return slice.get_mem();\n}\n\n\n#ifdef TIGHTDB_DEBUG\n\nvoid ArrayString::string_stats() const\n{\n    size_t total = 0;\n    size_t longest = 0;\n\n    for (size_t i = 0; i < m_size; ++i) {\n        StringData str = get(i);\n        size_t size = str.size() + 1;\n        total += size;\n        if (size > longest) longest = size;\n    }\n\n    size_t size = m_size * m_width;\n    size_t zeroes = size - total;\n    size_t zavg = zeroes \/ (m_size ? m_size : 1); \/\/ avoid possible div by zero\n\n    cout << \"Size: \" << m_size << \"\\n\";\n    cout << \"Width: \" << m_width << \"\\n\";\n    cout << \"Total: \" << size << \"\\n\";\n    cout << \"Capacity: \" << m_capacity << \"\\n\\n\";\n    cout << \"Bytes string: \" << total << \"\\n\";\n    cout << \"     longest: \" << longest << \"\\n\";\n    cout << \"Bytes zeroes: \" << zeroes << \"\\n\";\n    cout << \"         avg: \" << zavg << \"\\n\";\n}\n\n\nvoid ArrayString::to_dot(ostream& out, StringData title) const\n{\n    ref_type ref = get_ref();\n\n    if (title.size() != 0) {\n        out << \"subgraph cluster_\" << ref << \" {\" << endl;\n        out << \" label = \\\"\" << title << \"\\\";\" << endl;\n        out << \" color = white;\" << endl;\n    }\n\n    out << \"n\" << hex << ref << dec << \"[shape=none,label=<\";\n    out << \"<TABLE BORDER=\\\"0\\\" CELLBORDER=\\\"1\\\" CELLSPACING=\\\"0\\\" CELLPADDING=\\\"4\\\"><TR>\" << endl;\n\n    \/\/ Header\n    out << \"<TD BGCOLOR=\\\"lightgrey\\\"><FONT POINT-SIZE=\\\"7\\\">\";\n    out << \"0x\" << hex << ref << dec << \"<\/FONT><\/TD>\" << endl;\n\n    for (size_t i = 0; i < m_size; ++i)\n        out << \"<TD>\\\"\" << get(i) << \"\\\"<\/TD>\" << endl;\n\n    out << \"<\/TR><\/TABLE>>];\" << endl;\n\n    if (title.size() != 0)\n        out << \"}\" << endl;\n\n    to_dot_parent_edge(out);\n}\n\n#endif \/\/ TIGHTDB_DEBUG\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 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<commit_msg>[fixit] More max_connection_idle fixes (#30639)<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#include <grpc\/support\/time.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 = GRPC_INITIAL_METADATA_WAIT_FOR_READY |\n              GRPC_INITIAL_METADATA_WAIT_FOR_READY_EXPLICITLY_SET;\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      gpr_time_add(grpc_timeout_milliseconds_to_deadline(3000),\n                   gpr_time_from_millis(MAX_CONNECTION_IDLE_MS, GPR_TIMESPAN)),\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>void draw() {\n  for (int i = 0; i < 6; i++) {\n    for (int j = 0; j < 6; j++) {\n      for(int k = 0; k < numShapes; k++) {\n        int centerX = 150 + i * 110;\n        int centerY = 150 + j * 110;\n\n        \/\/ Add some randomness!\n        scale([[size]]);\n        rotate(random() * (1.0 - [[smoothing]]));\n        translate(random() * (1.0 - [[smoothing]]),\n                  random() * (1.0 - [[smoothing]]));\n\n        drawRect(centerX, centerY, k);\n      }\n    }\n  }\n}\n<commit_msg>add opacity parameter<commit_after>void draw() {\n  for (int i = 0; i < 6; i++) {\n    for (int j = 0; j < 6; j++) {\n      for(int k = 0; k < numShapes; k++) {\n        int centerX = 150 + i * 110;\n        int centerY = 150 + j * 110;\n\n        \/\/ Add some randomness!\n        scale([[size]]);\n        rotate(random() * (1.0 - [[smoothing]]));\n        translate(random() * (1.0 - [[smoothing]]),\n                  random() * (1.0 - [[smoothing]]));\n        color(255, [[opacity]]);\n        drawRect(centerX, centerY, k);\n      }\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  Copyright (c) 2013 Matthew Stump\n\n  This file is part of libmutton.\n\n  libmutton 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  libmutton is distributed in the hope that it 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 <boost\/test\/unit_test.hpp>\n#include <boost\/filesystem.hpp>\n\n#include <leveldb\/db.h>\n\n#include \"fixtures.hpp\"\n#include \"context.hpp\"\n#include \"index_reader_writer_leveldb.hpp\"\n\n\nBOOST_AUTO_TEST_SUITE(_index_reader_writer_leveldb)\n\nstruct auto_path_t {\n\n    auto_path_t() :\n        path(\"tmp\/testdb\")\n    {\n        boost::filesystem::create_directories(path);\n    }\n\n    ~auto_path_t()\n    {\n        boost::filesystem::remove_all(path);\n    }\n\n    std::string path;\n};\n\nBOOST_AUTO_TEST_CASE(index_partition)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index);\n    BOOST_CHECK(NULL != index);\n    BOOST_CHECK_EQUAL(1, index->partition());\n}\n\nBOOST_AUTO_TEST_CASE(index_bucket)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    BOOST_CHECK(context.init());\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index);\n    BOOST_CHECK(NULL != index);\n    BOOST_CHECK_EQUAL(index->bucket().size(), bucket.size());\n    BOOST_CHECK(std::equal(index->bucket().begin(), index->bucket().end(), bucket.begin()));\n}\n\nBOOST_AUTO_TEST_CASE(index_field)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    BOOST_CHECK(context.init());\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index);\n    BOOST_CHECK(NULL != index);\n    BOOST_CHECK_EQUAL(index->field().size(), field.size());\n    BOOST_CHECK(std::equal(index->field().begin(), index->field().end(), field.begin()));\n}\n\nBOOST_AUTO_TEST_CASE(read_write_segment)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_segment_t segment_one;\n    mtn::index_segment_t segment_two;\n    memset(segment_one, 0xFFFFFFFF, MTN_INDEX_SEGMENT_SIZE);\n    memset(segment_two, 0, MTN_INDEX_SEGMENT_SIZE);\n\n    mtn::status_t status;\n    status = context.index_reader_writer().write_segment(1, bucket, field, 2, 3, segment_one);\n    BOOST_CHECK(status);\n\n    status = context.index_reader_writer().read_segment(1, bucket, field, 2, 3, segment_two);\n    BOOST_CHECK(status);\n\n    BOOST_CHECK_EQUAL(0, memcmp(segment_one, segment_two, MTN_INDEX_SEGMENT_SIZE));\n}\n\nBOOST_AUTO_TEST_CASE(slice_set_bit_simple)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index_one = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_one);\n    BOOST_CHECK(NULL != index_one);\n    BOOST_CHECK(index_one->index_value(context.index_reader_writer(), 1, 1, true));\n    BOOST_CHECK_EQUAL(1, index_one->size());\n\n    mtn::index_slice_t slice_one;\n    BOOST_CHECK(!slice_one.bit(1));\n    BOOST_CHECK(index_one->slice(slice_one));\n    BOOST_CHECK_EQUAL(1, slice_one.size());\n    BOOST_CHECK(slice_one.bit(1));\n\n    mtn::index_t* index_two = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_two);\n    BOOST_CHECK(NULL != index_two);\n\n    mtn::index_slice_t slice_two;\n    BOOST_CHECK(!slice_two.bit(1));\n    BOOST_CHECK(index_two->slice(slice_two));\n    BOOST_CHECK_EQUAL(1, slice_two.size());\n    BOOST_CHECK(slice_two.bit(1));\n}\n\nBOOST_AUTO_TEST_CASE(slice_set_bit_larger_offset)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index_one = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_one);\n    BOOST_CHECK(NULL != index_one);\n    BOOST_CHECK(index_one->index_value(context.index_reader_writer(), 2048, 1, true));\n\n    mtn::index_slice_t slice_one;\n    BOOST_CHECK(!slice_one.bit(1));\n    BOOST_CHECK(index_one->slice(slice_one));\n    BOOST_CHECK(slice_one.bit(1));\n\n    mtn::index_t* index_two = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_two);\n    BOOST_CHECK(NULL != index_two);\n\n    mtn::index_slice_t slice_two;\n    BOOST_CHECK(!slice_two.bit(1));\n    BOOST_CHECK(index_two->slice(slice_two));\n    BOOST_CHECK(slice_two.bit(1));\n}\n\nBOOST_AUTO_TEST_CASE(slice_set_bit_larger_user)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index_one = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_one);\n    BOOST_CHECK(NULL != index_one);\n    BOOST_CHECK(index_one->index_value(context.index_reader_writer(), 2048, 4096, true));\n\n    mtn::index_slice_t slice_one;\n    BOOST_CHECK(!slice_one.bit(4096));\n    BOOST_CHECK(index_one->slice(slice_one));\n    BOOST_CHECK(slice_one.bit(4096));\n\n    mtn::index_t* index_two = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_two);\n    BOOST_CHECK(NULL != index_two);\n\n    mtn::index_slice_t slice_two;\n    BOOST_CHECK(!slice_two.bit(4096));\n    BOOST_CHECK(index_two->slice(slice_two));\n    BOOST_CHECK(slice_two.bit(4096));\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>fix unit test broken to context.opt interface change<commit_after>\/*\n  Copyright (c) 2013 Matthew Stump\n\n  This file is part of libmutton.\n\n  libmutton 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  libmutton is distributed in the hope that it 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 <boost\/test\/unit_test.hpp>\n#include <boost\/filesystem.hpp>\n\n#include <leveldb\/db.h>\n\n#include \"fixtures.hpp\"\n#include \"context.hpp\"\n#include \"index_reader_writer_leveldb.hpp\"\n\n\nBOOST_AUTO_TEST_SUITE(_index_reader_writer_leveldb)\n\nstruct auto_path_t {\n\n    auto_path_t() :\n        path(\"tmp\/testdb\")\n    {\n        boost::filesystem::create_directories(path);\n    }\n\n    ~auto_path_t()\n    {\n        boost::filesystem::remove_all(path);\n    }\n\n    std::string path;\n};\n\nBOOST_AUTO_TEST_CASE(index_partition)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.set_opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index);\n    BOOST_CHECK(NULL != index);\n    BOOST_CHECK_EQUAL(1, index->partition());\n}\n\nBOOST_AUTO_TEST_CASE(index_bucket)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.set_opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    BOOST_CHECK(context.init());\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index);\n    BOOST_CHECK(NULL != index);\n    BOOST_CHECK_EQUAL(index->bucket().size(), bucket.size());\n    BOOST_CHECK(std::equal(index->bucket().begin(), index->bucket().end(), bucket.begin()));\n}\n\nBOOST_AUTO_TEST_CASE(index_field)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.set_opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    BOOST_CHECK(context.init());\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index);\n    BOOST_CHECK(NULL != index);\n    BOOST_CHECK_EQUAL(index->field().size(), field.size());\n    BOOST_CHECK(std::equal(index->field().begin(), index->field().end(), field.begin()));\n}\n\nBOOST_AUTO_TEST_CASE(read_write_segment)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.set_opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_segment_t segment_one;\n    mtn::index_segment_t segment_two;\n    memset(segment_one, 0xFFFFFFFF, MTN_INDEX_SEGMENT_SIZE);\n    memset(segment_two, 0, MTN_INDEX_SEGMENT_SIZE);\n\n    mtn::status_t status;\n    status = context.index_reader_writer().write_segment(1, bucket, field, 2, 3, segment_one);\n    BOOST_CHECK(status);\n\n    status = context.index_reader_writer().read_segment(1, bucket, field, 2, 3, segment_two);\n    BOOST_CHECK(status);\n\n    BOOST_CHECK_EQUAL(0, memcmp(segment_one, segment_two, MTN_INDEX_SEGMENT_SIZE));\n}\n\nBOOST_AUTO_TEST_CASE(slice_set_bit_simple)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.set_opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index_one = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_one);\n    BOOST_CHECK(NULL != index_one);\n    BOOST_CHECK(index_one->index_value(context.index_reader_writer(), 1, 1, true));\n    BOOST_CHECK_EQUAL(1, index_one->size());\n\n    mtn::index_slice_t slice_one;\n    BOOST_CHECK(!slice_one.bit(1));\n    BOOST_CHECK(index_one->slice(slice_one));\n    BOOST_CHECK_EQUAL(1, slice_one.size());\n    BOOST_CHECK(slice_one.bit(1));\n\n    mtn::index_t* index_two = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_two);\n    BOOST_CHECK(NULL != index_two);\n\n    mtn::index_slice_t slice_two;\n    BOOST_CHECK(!slice_two.bit(1));\n    BOOST_CHECK(index_two->slice(slice_two));\n    BOOST_CHECK_EQUAL(1, slice_two.size());\n    BOOST_CHECK(slice_two.bit(1));\n}\n\nBOOST_AUTO_TEST_CASE(slice_set_bit_larger_offset)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.set_opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index_one = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_one);\n    BOOST_CHECK(NULL != index_one);\n    BOOST_CHECK(index_one->index_value(context.index_reader_writer(), 2048, 1, true));\n\n    mtn::index_slice_t slice_one;\n    BOOST_CHECK(!slice_one.bit(1));\n    BOOST_CHECK(index_one->slice(slice_one));\n    BOOST_CHECK(slice_one.bit(1));\n\n    mtn::index_t* index_two = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_two);\n    BOOST_CHECK(NULL != index_two);\n\n    mtn::index_slice_t slice_two;\n    BOOST_CHECK(!slice_two.bit(1));\n    BOOST_CHECK(index_two->slice(slice_two));\n    BOOST_CHECK(slice_two.bit(1));\n}\n\nBOOST_AUTO_TEST_CASE(slice_set_bit_larger_user)\n{\n    auto_path_t path;\n    mtn::context_t context(new mtn::index_reader_writer_leveldb_t());\n\n    context.set_opt(MTN_OPT_DB_PATH, static_cast<const void*>(path.path.c_str()), path.path.size());\n    context.init();\n\n    mtn::byte_t bucket_name_array[] = \"bizbang\";\n    mtn::byte_t field_name_array[] = \"foobar\";\n\n    std::vector<mtn::byte_t> bucket(bucket_name_array, bucket_name_array + 7);\n    std::vector<mtn::byte_t> field(field_name_array, field_name_array + 6);\n\n    mtn::index_t* index_one = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_one);\n    BOOST_CHECK(NULL != index_one);\n    BOOST_CHECK(index_one->index_value(context.index_reader_writer(), 2048, 4096, true));\n\n    mtn::index_slice_t slice_one;\n    BOOST_CHECK(!slice_one.bit(4096));\n    BOOST_CHECK(index_one->slice(slice_one));\n    BOOST_CHECK(slice_one.bit(4096));\n\n    mtn::index_t* index_two = NULL;\n    context.index_reader_writer().read_index(1, bucket, field, &index_two);\n    BOOST_CHECK(NULL != index_two);\n\n    mtn::index_slice_t slice_two;\n    BOOST_CHECK(!slice_two.bit(4096));\n    BOOST_CHECK(index_two->slice(slice_two));\n    BOOST_CHECK(slice_two.bit(4096));\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>#include \"tools\/cabana\/settings.h\"\n\n#include <QDialogButtonBox>\n#include <QFormLayout>\n#include <QSettings>\n\n\/\/ Settings\nSettings settings;\n\nSettings::Settings() {\n  load();\n}\n\nvoid Settings::save() {\n  QSettings s(\"settings\", QSettings::IniFormat);\n  s.setValue(\"fps\", fps);\n  s.setValue(\"log_size\", can_msg_log_size);\n  s.setValue(\"cached_segment\", cached_segment_limit);\n  s.setValue(\"chart_height\", chart_height);\n  s.setValue(\"chart_theme\", chart_theme);\n  s.setValue(\"max_chart_x_range\", max_chart_x_range);\n  emit changed();\n}\n\nvoid Settings::load() {\n  QSettings s(\"settings\", QSettings::IniFormat);\n  fps = s.value(\"fps\", 10).toInt();\n  can_msg_log_size = s.value(\"log_size\", 100).toInt();\n  cached_segment_limit = s.value(\"cached_segment\", 3).toInt();\n  chart_height = s.value(\"chart_height\", 200).toInt();\n  chart_theme = s.value(\"chart_theme\", 0).toInt();\n  max_chart_x_range = s.value(\"max_chart_x_range\", 3 * 60).toInt();\n}\n\n\/\/ SettingsDlg\n\nSettingsDlg::SettingsDlg(QWidget *parent) : QDialog(parent) {\n  setWindowTitle(tr(\"Settings\"));\n  QVBoxLayout *main_layout = new QVBoxLayout(this);\n  QFormLayout *form_layout = new QFormLayout();\n\n  fps = new QSpinBox(this);\n  fps->setRange(10, 100);\n  fps->setSingleStep(10);\n  fps->setValue(settings.fps);\n  form_layout->addRow(\"FPS\", fps);\n\n  log_size = new QSpinBox(this);\n  log_size->setRange(50, 500);\n  log_size->setSingleStep(10);\n  log_size->setValue(settings.can_msg_log_size);\n  form_layout->addRow(tr(\"Signal history log size\"), log_size);\n\n  cached_segment = new QSpinBox(this);\n  cached_segment->setRange(3, 60);\n  cached_segment->setSingleStep(1);\n  cached_segment->setValue(settings.cached_segment_limit);\n  form_layout->addRow(tr(\"Cached segments limit(minute)\"), cached_segment);\n\n  max_chart_x_range = new QSpinBox(this);\n  max_chart_x_range->setRange(1, 60);\n  max_chart_x_range->setSingleStep(1);\n  max_chart_x_range->setValue(settings.max_chart_x_range \/ 60);\n  form_layout->addRow(tr(\"Chart's max X-axis range(minute)\"), max_chart_x_range);\n\n  chart_height = new QSpinBox(this);\n  chart_height->setRange(100, 500);\n  chart_height->setSingleStep(10);\n  chart_height->setValue(settings.chart_height);\n  form_layout->addRow(tr(\"Chart's height\"), chart_height);\n\n  chart_theme = new QComboBox();\n  chart_theme->addItems({\"Light\", \"Dark\"});\n  chart_theme->setCurrentIndex(settings.chart_theme == 1 ? 1 : 0);\n  form_layout->addRow(tr(\"Chart theme\"), chart_theme);\n\n  main_layout->addLayout(form_layout);\n\n  auto buttonBox = new QDialogButtonBox(QDialogButtonBox::Ok | QDialogButtonBox::Cancel);\n  main_layout->addWidget(buttonBox);\n\n  setFixedWidth(360);\n  connect(buttonBox, &QDialogButtonBox::accepted, this, &SettingsDlg::save);\n  connect(buttonBox, &QDialogButtonBox::rejected, this, &QDialog::reject);\n}\n\nvoid SettingsDlg::save() {\n  settings.fps = fps->value();\n  settings.can_msg_log_size = log_size->value();\n  settings.cached_segment_limit = cached_segment->value();\n  settings.chart_height = chart_height->value();\n  settings.chart_theme = chart_theme->currentIndex();\n  settings.max_chart_x_range = max_chart_x_range->value() * 60;\n  settings.save();\n  accept();\n}\n<commit_msg>cabana: fix settings titles<commit_after>#include \"tools\/cabana\/settings.h\"\n\n#include <QDialogButtonBox>\n#include <QFormLayout>\n#include <QSettings>\n\n\/\/ Settings\nSettings settings;\n\nSettings::Settings() {\n  load();\n}\n\nvoid Settings::save() {\n  QSettings s(\"settings\", QSettings::IniFormat);\n  s.setValue(\"fps\", fps);\n  s.setValue(\"log_size\", can_msg_log_size);\n  s.setValue(\"cached_segment\", cached_segment_limit);\n  s.setValue(\"chart_height\", chart_height);\n  s.setValue(\"chart_theme\", chart_theme);\n  s.setValue(\"max_chart_x_range\", max_chart_x_range);\n  emit changed();\n}\n\nvoid Settings::load() {\n  QSettings s(\"settings\", QSettings::IniFormat);\n  fps = s.value(\"fps\", 10).toInt();\n  can_msg_log_size = s.value(\"log_size\", 100).toInt();\n  cached_segment_limit = s.value(\"cached_segment\", 3).toInt();\n  chart_height = s.value(\"chart_height\", 200).toInt();\n  chart_theme = s.value(\"chart_theme\", 0).toInt();\n  max_chart_x_range = s.value(\"max_chart_x_range\", 3 * 60).toInt();\n}\n\n\/\/ SettingsDlg\n\nSettingsDlg::SettingsDlg(QWidget *parent) : QDialog(parent) {\n  setWindowTitle(tr(\"Settings\"));\n  QVBoxLayout *main_layout = new QVBoxLayout(this);\n  QFormLayout *form_layout = new QFormLayout();\n\n  fps = new QSpinBox(this);\n  fps->setRange(10, 100);\n  fps->setSingleStep(10);\n  fps->setValue(settings.fps);\n  form_layout->addRow(\"FPS\", fps);\n\n  log_size = new QSpinBox(this);\n  log_size->setRange(50, 500);\n  log_size->setSingleStep(10);\n  log_size->setValue(settings.can_msg_log_size);\n  form_layout->addRow(tr(\"Signal history log size\"), log_size);\n\n  cached_segment = new QSpinBox(this);\n  cached_segment->setRange(3, 60);\n  cached_segment->setSingleStep(1);\n  cached_segment->setValue(settings.cached_segment_limit);\n  form_layout->addRow(tr(\"Cached segments limit\"), cached_segment);\n\n  max_chart_x_range = new QSpinBox(this);\n  max_chart_x_range->setRange(1, 60);\n  max_chart_x_range->setSingleStep(1);\n  max_chart_x_range->setValue(settings.max_chart_x_range \/ 60);\n  form_layout->addRow(tr(\"Chart range (minutes)\"), max_chart_x_range);\n\n  chart_height = new QSpinBox(this);\n  chart_height->setRange(100, 500);\n  chart_height->setSingleStep(10);\n  chart_height->setValue(settings.chart_height);\n  form_layout->addRow(tr(\"Chart height\"), chart_height);\n\n  chart_theme = new QComboBox();\n  chart_theme->addItems({\"Light\", \"Dark\"});\n  chart_theme->setCurrentIndex(settings.chart_theme == 1 ? 1 : 0);\n  form_layout->addRow(tr(\"Chart theme\"), chart_theme);\n\n  main_layout->addLayout(form_layout);\n\n  auto buttonBox = new QDialogButtonBox(QDialogButtonBox::Ok | QDialogButtonBox::Cancel);\n  main_layout->addWidget(buttonBox);\n\n  setFixedWidth(360);\n  connect(buttonBox, &QDialogButtonBox::accepted, this, &SettingsDlg::save);\n  connect(buttonBox, &QDialogButtonBox::rejected, this, &QDialog::reject);\n}\n\nvoid SettingsDlg::save() {\n  settings.fps = fps->value();\n  settings.can_msg_log_size = log_size->value();\n  settings.cached_segment_limit = cached_segment->value();\n  settings.chart_height = chart_height->value();\n  settings.chart_theme = chart_theme->currentIndex();\n  settings.max_chart_x_range = max_chart_x_range->value() * 60;\n  settings.save();\n  accept();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*============================================================================\n\nThe Medical Imaging Interaction Toolkit (MITK)\n\nCopyright (c) German Cancer Research Center (DKFZ)\nAll rights reserved.\n\nUse of this source code is governed by a 3-clause BSD license that can be\nfound in the LICENSE file.\n\n============================================================================*\/\n\n#include <mitkDICOMRTMimeTypes.h>\n\n#include <mitkIOMimeTypes.h>\n\n#include <mitkDICOMDCMTKTagScanner.h>\n#include <mitkDICOMTagPath.h>\n#include <mitkDICOMFileReaderSelector.h>\n#include <mitkDICOMFileReader.h>\n\n#include <itksys\/SystemTools.hxx>\n\n\n\nnamespace mitk\n{\n\nstd::array<std::unique_ptr<CustomMimeType>, 3> DICOMRTMimeTypes::Get()\n{\n  return {\n    std::make_unique<RTDoseMimeType>(),\n    std::make_unique<RTPlanMimeType>(),\n    std::make_unique<RTStructMimeType>()\n  };\n}\n\n\/\/ Mime Types\n\nDICOMRTMimeTypes::RTDoseMimeType::RTDoseMimeType()\n  : CustomMimeType(DICOMRT_DOSE_MIMETYPE_NAME())\n{\n  std::string category = \"DICOMRT\";\n  this->SetCategory(category);\n  this->SetComment(\"RTDose\");\n\n  this->AddExtension(\"dcm\");\n}\n\nbool DICOMRTMimeTypes::RTDoseMimeType::AppliesTo(const std::string &path) const\n{\n  bool canRead( CustomMimeType::AppliesTo(path) );\n\n  if (!canRead)\n  {\n    return false;\n  }\n\n  auto modality = GetModality(path);\n  if (modality == \"RTDOSE\")\n  {\n    return canReadByDicomFileReader(path);\n  }\n\n  return false;\n}\n\nstd::string DICOMRTMimeTypes::GetModality(const std::string & path)\n{\n  const auto modalityTagPath = DICOMTagPath(0x0008, 0x0060);\n\n  mitk::DICOMDCMTKTagScanner::Pointer scanner = mitk::DICOMDCMTKTagScanner::New();\n  scanner->SetInputFiles({ path });\n  scanner->AddTagPaths({ modalityTagPath });\n  scanner->Scan();\n\n  mitk::DICOMDatasetAccessingImageFrameList frames = scanner->GetFrameInfoList();\n  std::string modality = \"\";\n  if (frames.empty())\n    return modality;\n  auto findings = frames.front()->GetTagValueAsString(modalityTagPath);\n\n  modality = findings.front().value;\n  return modality;\n}\n\nbool DICOMRTMimeTypes::canReadByDicomFileReader(const std::string & filename)\n{\n  mitk::DICOMFileReaderSelector::Pointer selector = mitk::DICOMFileReaderSelector::New();\n  selector->LoadBuiltIn3DConfigs();\n  selector->SetInputFiles({ filename });\n\n  mitk::DICOMFileReader::Pointer reader = selector->GetFirstReaderWithMinimumNumberOfOutputImages();\n\n  return reader.IsNotNull();\n}\n\nDICOMRTMimeTypes::RTDoseMimeType* DICOMRTMimeTypes::RTDoseMimeType::Clone() const\n{\n  return new RTDoseMimeType(*this);\n}\n\nDICOMRTMimeTypes::RTStructMimeType::RTStructMimeType()\n  : CustomMimeType(DICOMRT_STRUCT_MIMETYPE_NAME())\n{\n  std::string category = \"DICOMRT\";\n  this->SetCategory(category);\n  this->SetComment(\"RTStruct\");\n\n  this->AddExtension(\"dcm\");\n}\n\nbool DICOMRTMimeTypes::RTStructMimeType::AppliesTo(const std::string &path) const\n{\n  bool canRead(CustomMimeType::AppliesTo(path));\n\n  if (!canRead) {\n    return false;\n  }\n\n  auto modality = GetModality(path);\n  if (modality == \"RTSTRUCT\") {\n    return true;\n  }\n\n  return false;\n}\n\nDICOMRTMimeTypes::RTStructMimeType* DICOMRTMimeTypes::RTStructMimeType::Clone() const\n{\n  return new RTStructMimeType(*this);\n}\n\nDICOMRTMimeTypes::RTPlanMimeType::RTPlanMimeType()\n  : CustomMimeType(DICOMRT_PLAN_MIMETYPE_NAME())\n{\n  std::string category = \"DICOMRT\";\n  this->SetCategory(category);\n  this->SetComment(\"RTPLAN\");\n\n  this->AddExtension(\"dcm\");\n}\n\nbool DICOMRTMimeTypes::RTPlanMimeType::AppliesTo(const std::string &path) const\n{\n  bool canRead(CustomMimeType::AppliesTo(path));\n\n  if (!canRead) {\n    return false;\n  }\n\n  auto modality = GetModality(path);\n  if (modality == \"RTPLAN\") {\n    return true;\n  }\n\n  return false;\n}\n\nDICOMRTMimeTypes::RTPlanMimeType* DICOMRTMimeTypes::RTPlanMimeType::Clone() const\n{\n  return new RTPlanMimeType(*this);\n}\n\n\nDICOMRTMimeTypes::RTDoseMimeType DICOMRTMimeTypes::DICOMRT_DOSE_MIMETYPE()\n{\n  return RTDoseMimeType();\n}\n\nDICOMRTMimeTypes::RTStructMimeType DICOMRTMimeTypes::DICOMRT_STRUCT_MIMETYPE()\n{\n  return RTStructMimeType();\n}\n\nDICOMRTMimeTypes::RTPlanMimeType DICOMRTMimeTypes::DICOMRT_PLAN_MIMETYPE()\n{\n  return RTPlanMimeType();\n}\n\n\/\/ Names\nstd::string DICOMRTMimeTypes::DICOMRT_DOSE_MIMETYPE_NAME()\n{\n  return IOMimeTypes::DEFAULT_BASE_NAME() + \".dicomrt.dose\";\n}\n\nstd::string DICOMRTMimeTypes::DICOMRT_STRUCT_MIMETYPE_NAME()\n{\n  return IOMimeTypes::DEFAULT_BASE_NAME() + \".dicomrt.struct\";\n}\n\nstd::string DICOMRTMimeTypes::DICOMRT_PLAN_MIMETYPE_NAME()\n{\n  return IOMimeTypes::DEFAULT_BASE_NAME() + \".dicomrt.plan\";\n}\n\n\/\/ Descriptions\n\nstd::string DICOMRTMimeTypes::DICOMRT_DOSE_MIMETYPE_DESCRIPTION()\n{\n  return \"RTDOSE reader\";\n}\n\nstd::string DICOMRTMimeTypes::DICOMRT_STRUCT_MIMETYPE_DESCRIPTION()\n{\n  return \"RTSTRUCT reader\";\n}\n\nstd::string DICOMRTMimeTypes::DICOMRT_PLAN_MIMETYPE_DESCRIPTION()\n{\n  return \"RTPLAN reader\";\n}\n\n}\n<commit_msg>Added a check for file existance to prevent tag scanning.<commit_after>\/*============================================================================\n\nThe Medical Imaging Interaction Toolkit (MITK)\n\nCopyright (c) German Cancer Research Center (DKFZ)\nAll rights reserved.\n\nUse of this source code is governed by a 3-clause BSD license that can be\nfound in the LICENSE file.\n\n============================================================================*\/\n\n#include <mitkDICOMRTMimeTypes.h>\n\n#include <mitkIOMimeTypes.h>\n\n#include <mitkDICOMDCMTKTagScanner.h>\n#include <mitkDICOMTagPath.h>\n#include <mitkDICOMFileReaderSelector.h>\n#include <mitkDICOMFileReader.h>\n\n#include <itksys\/SystemTools.hxx>\n\n\n\nnamespace mitk\n{\n\nstd::array<std::unique_ptr<CustomMimeType>, 3> DICOMRTMimeTypes::Get()\n{\n  return {\n    std::make_unique<RTDoseMimeType>(),\n    std::make_unique<RTPlanMimeType>(),\n    std::make_unique<RTStructMimeType>()\n  };\n}\n\n\/\/ Mime Types\n\nDICOMRTMimeTypes::RTDoseMimeType::RTDoseMimeType()\n  : CustomMimeType(DICOMRT_DOSE_MIMETYPE_NAME())\n{\n  std::string category = \"DICOMRT\";\n  this->SetCategory(category);\n  this->SetComment(\"RTDose\");\n\n  this->AddExtension(\"dcm\");\n}\n\nbool DICOMRTMimeTypes::RTDoseMimeType::AppliesTo(const std::string &path) const\n{\n  bool canRead( CustomMimeType::AppliesTo(path) );\n\n  if (!canRead)\n  {\n    return false;\n  }\n\n  \/\/ fix for bug 18572\n  \/\/ Currently this function is called for writing as well as reading, in that case\n  \/\/ the image information can of course not be parsed or further identifyed.\n  \/\/so as a work arround we just return the current canRead if the file does not exist.\n  if (!itksys::SystemTools::FileExists(path.c_str()))\n  {\n    return canRead;\n  }\n  \/\/ end fix for bug 18572\n\n  auto modality = GetModality(path);\n  if (modality == \"RTDOSE\")\n  {\n    return canReadByDicomFileReader(path);\n  }\n\n  return false;\n}\n\nstd::string DICOMRTMimeTypes::GetModality(const std::string & path)\n{\n  const auto modalityTagPath = DICOMTagPath(0x0008, 0x0060);\n\n  mitk::DICOMDCMTKTagScanner::Pointer scanner = mitk::DICOMDCMTKTagScanner::New();\n  scanner->SetInputFiles({ path });\n  scanner->AddTagPaths({ modalityTagPath });\n  scanner->Scan();\n\n  mitk::DICOMDatasetAccessingImageFrameList frames = scanner->GetFrameInfoList();\n  std::string modality = \"\";\n  if (frames.empty())\n    return modality;\n  auto findings = frames.front()->GetTagValueAsString(modalityTagPath);\n\n  modality = findings.front().value;\n  return modality;\n}\n\nbool DICOMRTMimeTypes::canReadByDicomFileReader(const std::string & filename)\n{\n  mitk::DICOMFileReaderSelector::Pointer selector = mitk::DICOMFileReaderSelector::New();\n  selector->LoadBuiltIn3DConfigs();\n  selector->SetInputFiles({ filename });\n\n  mitk::DICOMFileReader::Pointer reader = selector->GetFirstReaderWithMinimumNumberOfOutputImages();\n\n  return reader.IsNotNull();\n}\n\nDICOMRTMimeTypes::RTDoseMimeType* DICOMRTMimeTypes::RTDoseMimeType::Clone() const\n{\n  return new RTDoseMimeType(*this);\n}\n\nDICOMRTMimeTypes::RTStructMimeType::RTStructMimeType()\n  : CustomMimeType(DICOMRT_STRUCT_MIMETYPE_NAME())\n{\n  std::string category = \"DICOMRT\";\n  this->SetCategory(category);\n  this->SetComment(\"RTStruct\");\n\n  this->AddExtension(\"dcm\");\n}\n\nbool DICOMRTMimeTypes::RTStructMimeType::AppliesTo(const std::string &path) const\n{\n  bool canRead(CustomMimeType::AppliesTo(path));\n\n  if (!canRead) {\n    return false;\n  }\n\n  \/\/ fix for bug 18572\n  \/\/ Currently this function is called for writing as well as reading, in that case\n  \/\/ the image information can of course not be parsed or further identifyed.\n  \/\/so as a work arround we just return the current canRead if the file does not exist.\n  if (!itksys::SystemTools::FileExists(path.c_str()))\n  {\n    return canRead;\n  }\n  \/\/ end fix for bug 18572\n\n  auto modality = GetModality(path);\n  if (modality == \"RTSTRUCT\") {\n    return true;\n  }\n\n  return false;\n}\n\nDICOMRTMimeTypes::RTStructMimeType* DICOMRTMimeTypes::RTStructMimeType::Clone() const\n{\n  return new RTStructMimeType(*this);\n}\n\nDICOMRTMimeTypes::RTPlanMimeType::RTPlanMimeType()\n  : CustomMimeType(DICOMRT_PLAN_MIMETYPE_NAME())\n{\n  std::string category = \"DICOMRT\";\n  this->SetCategory(category);\n  this->SetComment(\"RTPLAN\");\n\n  this->AddExtension(\"dcm\");\n}\n\nbool DICOMRTMimeTypes::RTPlanMimeType::AppliesTo(const std::string &path) const\n{\n  bool canRead(CustomMimeType::AppliesTo(path));\n\n  if (!canRead) {\n    return false;\n  }\n\n  \/\/ fix for bug 18572\n  \/\/ Currently this function is called for writing as well as reading, in that case\n  \/\/ the image information can of course not be parsed or further identifyed.\n  \/\/so as a work arround we just return the current canRead if the file does not exist.\n  if (!itksys::SystemTools::FileExists(path.c_str()))\n  {\n    return canRead;\n  }\n  \/\/ end fix for bug 18572\n\n  auto modality = GetModality(path);\n  if (modality == \"RTPLAN\") {\n    return true;\n  }\n\n  return false;\n}\n\nDICOMRTMimeTypes::RTPlanMimeType* DICOMRTMimeTypes::RTPlanMimeType::Clone() const\n{\n  return new RTPlanMimeType(*this);\n}\n\n\nDICOMRTMimeTypes::RTDoseMimeType DICOMRTMimeTypes::DICOMRT_DOSE_MIMETYPE()\n{\n  return RTDoseMimeType();\n}\n\nDICOMRTMimeTypes::RTStructMimeType DICOMRTMimeTypes::DICOMRT_STRUCT_MIMETYPE()\n{\n  return RTStructMimeType();\n}\n\nDICOMRTMimeTypes::RTPlanMimeType DICOMRTMimeTypes::DICOMRT_PLAN_MIMETYPE()\n{\n  return RTPlanMimeType();\n}\n\n\/\/ Names\nstd::string DICOMRTMimeTypes::DICOMRT_DOSE_MIMETYPE_NAME()\n{\n  return IOMimeTypes::DEFAULT_BASE_NAME() + \".dicomrt.dose\";\n}\n\nstd::string DICOMRTMimeTypes::DICOMRT_STRUCT_MIMETYPE_NAME()\n{\n  return IOMimeTypes::DEFAULT_BASE_NAME() + \".dicomrt.struct\";\n}\n\nstd::string DICOMRTMimeTypes::DICOMRT_PLAN_MIMETYPE_NAME()\n{\n  return IOMimeTypes::DEFAULT_BASE_NAME() + \".dicomrt.plan\";\n}\n\n\/\/ Descriptions\n\nstd::string DICOMRTMimeTypes::DICOMRT_DOSE_MIMETYPE_DESCRIPTION()\n{\n  return \"RTDOSE reader\";\n}\n\nstd::string DICOMRTMimeTypes::DICOMRT_STRUCT_MIMETYPE_DESCRIPTION()\n{\n  return \"RTSTRUCT reader\";\n}\n\nstd::string DICOMRTMimeTypes::DICOMRT_PLAN_MIMETYPE_DESCRIPTION()\n{\n  return \"RTPLAN reader\";\n}\n\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\/table.h\"\n\n#include <ctype.h>\n#include <string.h>\n\n#include \"perfetto\/base\/logging.h\"\n\nnamespace perfetto {\nnamespace trace_processor {\n\nnamespace {\n\nstruct TableDescriptor {\n  Table::Factory factory;\n  const TraceStorage* storage = nullptr;\n  std::string name;\n  sqlite3_module module = {};\n};\n\nTable* ToTable(sqlite3_vtab* vtab) {\n  return static_cast<Table*>(vtab);\n}\n\nTable::RawCursor* ToCursor(sqlite3_vtab_cursor* cursor) {\n  return static_cast<Table::RawCursor*>(cursor);\n}\n\nstd::string TypeToString(Table::ColumnType type) {\n  switch (type) {\n    case Table::ColumnType::kString:\n      return \"STRING\";\n    case Table::ColumnType::kUint:\n      return \"UNSIGNED INT\";\n    case Table::ColumnType::kUlong:\n      return \"UNSIGNED BIG INT\";\n    case Table::ColumnType::kInt:\n      return \"INT\";\n  }\n  PERFETTO_CHECK(false);\n}\n\n}  \/\/ namespace\n\n\/\/ static\nbool Table::debug = false;\n\nTable::Table() = default;\nTable::~Table() = default;\n\nvoid Table::RegisterInternal(sqlite3* db,\n                             const TraceStorage* storage,\n                             const std::string& table_name,\n                             bool read_write,\n                             Factory factory) {\n  std::unique_ptr<TableDescriptor> desc(new TableDescriptor());\n  desc->storage = storage;\n  desc->factory = factory;\n  desc->name = table_name;\n  sqlite3_module* module = &desc->module;\n  memset(module, 0, sizeof(*module));\n\n  auto create_fn = [](sqlite3* xdb, void* arg, int argc,\n                      const char* const* argv, sqlite3_vtab** tab, char**) {\n    const TableDescriptor* xdesc = static_cast<const TableDescriptor*>(arg);\n    auto table = xdesc->factory(xdb, xdesc->storage);\n\n    auto schema = table->CreateSchema(argc, argv);\n    auto create_stmt = schema.ToCreateTableStmt();\n\n    int res = sqlite3_declare_vtab(xdb, create_stmt.c_str());\n    if (res != SQLITE_OK)\n      return res;\n\n    \/\/ Freed in xDisconnect().\n    table->schema_ = schema;\n    table->name_ = xdesc->name;\n    *tab = table.release();\n\n    return SQLITE_OK;\n  };\n  module->xCreate = create_fn;\n  module->xConnect = create_fn;\n\n  auto destroy_fn = [](sqlite3_vtab* t) {\n    delete ToTable(t);\n    return SQLITE_OK;\n  };\n  module->xDisconnect = destroy_fn;\n  module->xDestroy = destroy_fn;\n\n  module->xOpen = [](sqlite3_vtab* t, sqlite3_vtab_cursor** c) {\n    return ToTable(t)->OpenInternal(c);\n  };\n\n  module->xClose = [](sqlite3_vtab_cursor* c) {\n    delete ToCursor(c);\n    return SQLITE_OK;\n  };\n\n  module->xBestIndex = [](sqlite3_vtab* t, sqlite3_index_info* i) {\n    return ToTable(t)->BestIndexInternal(i);\n  };\n\n  module->xFilter = [](sqlite3_vtab_cursor* c, int i, const char* s, int a,\n                       sqlite3_value** v) {\n    return ToCursor(c)->Filter(i, s, a, v);\n  };\n  module->xNext = [](sqlite3_vtab_cursor* c) {\n    return ToCursor(c)->cursor()->Next();\n  };\n  module->xEof = [](sqlite3_vtab_cursor* c) {\n    return ToCursor(c)->cursor()->Eof();\n  };\n  module->xColumn = [](sqlite3_vtab_cursor* c, sqlite3_context* a, int b) {\n    return ToCursor(c)->cursor()->Column(a, b);\n  };\n\n  module->xRowid = [](sqlite3_vtab_cursor* c, sqlite3_int64* r) {\n    return ToCursor(c)->cursor()->RowId(r);\n  };\n\n  module->xFindFunction =\n      [](sqlite3_vtab* t, int, const char* name,\n         void (**fn)(sqlite3_context*, int, sqlite3_value**),\n         void** args) { return ToTable(t)->FindFunction(name, fn, args); };\n\n  if (read_write) {\n    module->xUpdate = [](sqlite3_vtab* t, int a, sqlite3_value** v,\n                         sqlite3_int64* r) {\n      return ToTable(t)->Update(a, v, r);\n    };\n  }\n\n  int res = sqlite3_create_module_v2(\n      db, table_name.c_str(), module, desc.release(),\n      [](void* arg) { delete static_cast<TableDescriptor*>(arg); });\n  PERFETTO_CHECK(res == SQLITE_OK);\n}\n\nint Table::OpenInternal(sqlite3_vtab_cursor** ppCursor) {\n  \/\/ Freed in xClose().\n  *ppCursor = static_cast<sqlite3_vtab_cursor*>(new RawCursor(this));\n  return SQLITE_OK;\n}\n\nint Table::BestIndexInternal(sqlite3_index_info* idx) {\n  QueryConstraints query_constraints;\n\n  for (int i = 0; i < idx->nOrderBy; i++) {\n    int column = idx->aOrderBy[i].iColumn;\n    bool desc = idx->aOrderBy[i].desc;\n    query_constraints.AddOrderBy(column, desc);\n  }\n\n  for (int i = 0; i < idx->nConstraint; i++) {\n    const auto& cs = idx->aConstraint[i];\n    if (!cs.usable)\n      continue;\n    query_constraints.AddConstraint(cs.iColumn, cs.op);\n\n    \/\/ argvIndex is 1-based so use the current size of the vector.\n    int argv_index = static_cast<int>(query_constraints.constraints().size());\n    idx->aConstraintUsage[i].argvIndex = argv_index;\n  }\n\n  BestIndexInfo info;\n  info.omit.resize(query_constraints.constraints().size());\n\n  int ret = BestIndex(query_constraints, &info);\n\n  if (Table::debug) {\n    PERFETTO_LOG(\n        \"[%s::BestIndex] constraints=%s orderByConsumed=%d estimatedCost=%d\",\n        name_.c_str(), query_constraints.ToNewSqlite3String().get(),\n        info.order_by_consumed, info.estimated_cost);\n  }\n\n  if (ret != SQLITE_OK)\n    return ret;\n\n  idx->orderByConsumed = info.order_by_consumed;\n  idx->estimatedCost = info.estimated_cost;\n\n  size_t j = 0;\n  for (int i = 0; i < idx->nConstraint; i++) {\n    const auto& cs = idx->aConstraint[i];\n    if (cs.usable)\n      idx->aConstraintUsage[i].omit = info.omit[j++];\n  }\n\n  if (!info.order_by_consumed)\n    query_constraints.ClearOrderBy();\n\n  idx->idxStr = query_constraints.ToNewSqlite3String().release();\n  idx->needToFreeIdxStr = true;\n  idx->idxNum = ++best_index_num_;\n\n  return SQLITE_OK;\n}\n\nint Table::FindFunction(const char*, FindFunctionFn, void**) {\n  return 0;\n}\n\nint Table::Update(int, sqlite3_value**, sqlite3_int64*) {\n  return SQLITE_READONLY;\n}\n\nTable::RawCursor::RawCursor(Table* table) : table_(table) {}\n\nint Table::RawCursor::Filter(int idxNum,\n                             const char* idxStr,\n                             int argc,\n                             sqlite3_value** argv) {\n  auto* table = ToTable(this->pVtab);\n  bool cache_hit = true;\n  if (idxNum != table->qc_hash_) {\n    table->qc_cache_ = QueryConstraints::FromString(idxStr);\n    table->qc_hash_ = idxNum;\n    cache_hit = false;\n  }\n  if (Table::debug) {\n    PERFETTO_LOG(\"[%s::Filter] constraints=%s argc=%d cache_hit=%d\",\n                 table->name_.c_str(), idxStr, argc, cache_hit);\n  }\n  PERFETTO_DCHECK(table->qc_cache_.constraints().size() ==\n                  static_cast<size_t>(argc));\n  cursor_ = table_->CreateCursor(table->qc_cache_, argv);\n  return !cursor_ ? SQLITE_ERROR : SQLITE_OK;\n}\n\nTable::Cursor::~Cursor() = default;\n\nint Table::Cursor::RowId(sqlite3_int64*) {\n  return SQLITE_ERROR;\n}\n\nTable::Column::Column(size_t index,\n                      std::string name,\n                      ColumnType type,\n                      bool hidden)\n    : index_(index), name_(name), type_(type), hidden_(hidden) {}\n\nTable::Schema::Schema(std::vector<Column> columns,\n                      std::vector<size_t> primary_keys)\n    : columns_(std::move(columns)), primary_keys_(std::move(primary_keys)) {\n  for (size_t i = 0; i < columns_.size(); i++) {\n    PERFETTO_CHECK(columns_[i].index() == i);\n  }\n  for (auto key : primary_keys_) {\n    PERFETTO_CHECK(key < columns_.size());\n  }\n}\n\nTable::Schema::Schema() = default;\nTable::Schema::Schema(const Schema&) = default;\nTable::Schema& Table::Schema::operator=(const Schema&) = default;\n\nstd::string Table::Schema::ToCreateTableStmt() {\n  std::string stmt = \"CREATE TABLE x(\";\n  for (const auto& col : columns_) {\n    stmt += \" \" + col.name() + \" \" + TypeToString(col.type()) + \",\";\n  }\n  stmt += \" PRIMARY KEY(\";\n  for (size_t i = 0; i < primary_keys_.size(); i++) {\n    if (i != 0)\n      stmt += \", \";\n    stmt += columns_[primary_keys_[i]].name();\n  }\n  stmt += \")) WITHOUT ROWID;\";\n  return stmt;\n}\n\n}  \/\/ namespace trace_processor\n}  \/\/ namespace perfetto\n<commit_msg>trace_processor: fix missing noexcept breaking build in Google3<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\/table.h\"\n\n#include <ctype.h>\n#include <string.h>\n\n#include \"perfetto\/base\/logging.h\"\n\nnamespace perfetto {\nnamespace trace_processor {\n\nnamespace {\n\nstruct TableDescriptor {\n  Table::Factory factory;\n  const TraceStorage* storage = nullptr;\n  std::string name;\n  sqlite3_module module = {};\n};\n\nTable* ToTable(sqlite3_vtab* vtab) {\n  return static_cast<Table*>(vtab);\n}\n\nTable::RawCursor* ToCursor(sqlite3_vtab_cursor* cursor) {\n  return static_cast<Table::RawCursor*>(cursor);\n}\n\nstd::string TypeToString(Table::ColumnType type) {\n  switch (type) {\n    case Table::ColumnType::kString:\n      return \"STRING\";\n    case Table::ColumnType::kUint:\n      return \"UNSIGNED INT\";\n    case Table::ColumnType::kUlong:\n      return \"UNSIGNED BIG INT\";\n    case Table::ColumnType::kInt:\n      return \"INT\";\n  }\n  PERFETTO_CHECK(false);\n}\n\n}  \/\/ namespace\n\n\/\/ static\nbool Table::debug = false;\n\nTable::Table() = default;\nTable::~Table() = default;\n\nvoid Table::RegisterInternal(sqlite3* db,\n                             const TraceStorage* storage,\n                             const std::string& table_name,\n                             bool read_write,\n                             Factory factory) {\n  std::unique_ptr<TableDescriptor> desc(new TableDescriptor());\n  desc->storage = storage;\n  desc->factory = factory;\n  desc->name = table_name;\n  sqlite3_module* module = &desc->module;\n  memset(module, 0, sizeof(*module));\n\n  auto create_fn = [](sqlite3* xdb, void* arg, int argc,\n                      const char* const* argv, sqlite3_vtab** tab, char**) {\n    const TableDescriptor* xdesc = static_cast<const TableDescriptor*>(arg);\n    auto table = xdesc->factory(xdb, xdesc->storage);\n\n    auto schema = table->CreateSchema(argc, argv);\n    auto create_stmt = schema.ToCreateTableStmt();\n\n    int res = sqlite3_declare_vtab(xdb, create_stmt.c_str());\n    if (res != SQLITE_OK)\n      return res;\n\n    \/\/ Freed in xDisconnect().\n    table->schema_ = schema;\n    table->name_ = xdesc->name;\n    *tab = table.release();\n\n    return SQLITE_OK;\n  };\n  module->xCreate = create_fn;\n  module->xConnect = create_fn;\n\n  auto destroy_fn = [](sqlite3_vtab* t) {\n    delete ToTable(t);\n    return SQLITE_OK;\n  };\n  module->xDisconnect = destroy_fn;\n  module->xDestroy = destroy_fn;\n\n  module->xOpen = [](sqlite3_vtab* t, sqlite3_vtab_cursor** c) {\n    return ToTable(t)->OpenInternal(c);\n  };\n\n  module->xClose = [](sqlite3_vtab_cursor* c) {\n    delete ToCursor(c);\n    return SQLITE_OK;\n  };\n\n  module->xBestIndex = [](sqlite3_vtab* t, sqlite3_index_info* i) {\n    return ToTable(t)->BestIndexInternal(i);\n  };\n\n  module->xFilter = [](sqlite3_vtab_cursor* c, int i, const char* s, int a,\n                       sqlite3_value** v) {\n    return ToCursor(c)->Filter(i, s, a, v);\n  };\n  module->xNext = [](sqlite3_vtab_cursor* c) {\n    return ToCursor(c)->cursor()->Next();\n  };\n  module->xEof = [](sqlite3_vtab_cursor* c) {\n    return ToCursor(c)->cursor()->Eof();\n  };\n  module->xColumn = [](sqlite3_vtab_cursor* c, sqlite3_context* a, int b) {\n    return ToCursor(c)->cursor()->Column(a, b);\n  };\n\n  module->xRowid = [](sqlite3_vtab_cursor* c, sqlite3_int64* r) {\n    return ToCursor(c)->cursor()->RowId(r);\n  };\n\n  module->xFindFunction =\n      [](sqlite3_vtab* t, int, const char* name,\n         void (**fn)(sqlite3_context*, int, sqlite3_value**),\n         void** args) { return ToTable(t)->FindFunction(name, fn, args); };\n\n  if (read_write) {\n    module->xUpdate = [](sqlite3_vtab* t, int a, sqlite3_value** v,\n                         sqlite3_int64* r) {\n      return ToTable(t)->Update(a, v, r);\n    };\n  }\n\n  int res = sqlite3_create_module_v2(\n      db, table_name.c_str(), module, desc.release(),\n      [](void* arg) { delete static_cast<TableDescriptor*>(arg); });\n  PERFETTO_CHECK(res == SQLITE_OK);\n}\n\nint Table::OpenInternal(sqlite3_vtab_cursor** ppCursor) {\n  \/\/ Freed in xClose().\n  *ppCursor = static_cast<sqlite3_vtab_cursor*>(new RawCursor(this));\n  return SQLITE_OK;\n}\n\nint Table::BestIndexInternal(sqlite3_index_info* idx) {\n  QueryConstraints query_constraints;\n\n  for (int i = 0; i < idx->nOrderBy; i++) {\n    int column = idx->aOrderBy[i].iColumn;\n    bool desc = idx->aOrderBy[i].desc;\n    query_constraints.AddOrderBy(column, desc);\n  }\n\n  for (int i = 0; i < idx->nConstraint; i++) {\n    const auto& cs = idx->aConstraint[i];\n    if (!cs.usable)\n      continue;\n    query_constraints.AddConstraint(cs.iColumn, cs.op);\n\n    \/\/ argvIndex is 1-based so use the current size of the vector.\n    int argv_index = static_cast<int>(query_constraints.constraints().size());\n    idx->aConstraintUsage[i].argvIndex = argv_index;\n  }\n\n  BestIndexInfo info;\n  info.omit.resize(query_constraints.constraints().size());\n\n  int ret = BestIndex(query_constraints, &info);\n\n  if (Table::debug) {\n    PERFETTO_LOG(\n        \"[%s::BestIndex] constraints=%s orderByConsumed=%d estimatedCost=%d\",\n        name_.c_str(), query_constraints.ToNewSqlite3String().get(),\n        info.order_by_consumed, info.estimated_cost);\n  }\n\n  if (ret != SQLITE_OK)\n    return ret;\n\n  idx->orderByConsumed = info.order_by_consumed;\n  idx->estimatedCost = info.estimated_cost;\n\n  size_t j = 0;\n  for (int i = 0; i < idx->nConstraint; i++) {\n    const auto& cs = idx->aConstraint[i];\n    if (cs.usable)\n      idx->aConstraintUsage[i].omit = info.omit[j++];\n  }\n\n  if (!info.order_by_consumed)\n    query_constraints.ClearOrderBy();\n\n  idx->idxStr = query_constraints.ToNewSqlite3String().release();\n  idx->needToFreeIdxStr = true;\n  idx->idxNum = ++best_index_num_;\n\n  return SQLITE_OK;\n}\n\nint Table::FindFunction(const char*, FindFunctionFn, void**) {\n  return 0;\n}\n\nint Table::Update(int, sqlite3_value**, sqlite3_int64*) {\n  return SQLITE_READONLY;\n}\n\nTable::RawCursor::RawCursor(Table* table) : table_(table) {}\n\nint Table::RawCursor::Filter(int idxNum,\n                             const char* idxStr,\n                             int argc,\n                             sqlite3_value** argv) {\n  auto* table = ToTable(this->pVtab);\n  bool cache_hit = true;\n  if (idxNum != table->qc_hash_) {\n    table->qc_cache_ = QueryConstraints::FromString(idxStr);\n    table->qc_hash_ = idxNum;\n    cache_hit = false;\n  }\n  if (Table::debug) {\n    PERFETTO_LOG(\"[%s::Filter] constraints=%s argc=%d cache_hit=%d\",\n                 table->name_.c_str(), idxStr, argc, cache_hit);\n  }\n  PERFETTO_DCHECK(table->qc_cache_.constraints().size() ==\n                  static_cast<size_t>(argc));\n  cursor_ = table_->CreateCursor(table->qc_cache_, argv);\n  return !cursor_ ? SQLITE_ERROR : SQLITE_OK;\n}\n\nTable::Cursor::~Cursor() = default;\n\nint Table::Cursor::RowId(sqlite3_int64*) {\n  return SQLITE_ERROR;\n}\n\nTable::Column::Column(size_t index,\n                      std::string name,\n                      ColumnType type,\n                      bool hidden)\n    : index_(index), name_(name), type_(type), hidden_(hidden) {}\n\nTable::Schema::Schema(std::vector<Column> columns,\n                      std::vector<size_t> primary_keys)\n    : columns_(std::move(columns)), primary_keys_(std::move(primary_keys)) {\n  for (size_t i = 0; i < columns_.size(); i++) {\n    PERFETTO_CHECK(columns_[i].index() == i);\n  }\n  for (auto key : primary_keys_) {\n    PERFETTO_CHECK(key < columns_.size());\n  }\n}\n\nTable::Schema::Schema() = default;\nTable::Schema::Schema(const Schema&) noexcept = default;\nTable::Schema& Table::Schema::operator=(const Schema&) = default;\n\nstd::string Table::Schema::ToCreateTableStmt() {\n  std::string stmt = \"CREATE TABLE x(\";\n  for (const auto& col : columns_) {\n    stmt += \" \" + col.name() + \" \" + TypeToString(col.type()) + \",\";\n  }\n  stmt += \" PRIMARY KEY(\";\n  for (size_t i = 0; i < primary_keys_.size(); i++) {\n    if (i != 0)\n      stmt += \", \";\n    stmt += columns_[primary_keys_[i]].name();\n  }\n  stmt += \")) WITHOUT ROWID;\";\n  return stmt;\n}\n\n}  \/\/ namespace trace_processor\n}  \/\/ namespace perfetto\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/tree:$Id$\n\/\/ Author: Rene Brun   05\/02\/97\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\/\/ A TSelector object is used by the TTree::Draw, TTree::Scan,            \/\/\n\/\/ TTree::Process to navigate in a TTree and make selections.             \/\/\n\/\/ It contains the following main methods:                                \/\/\n\/\/                                                                        \/\/\n\/\/ void TSelector::Init(TTree *t). Called every time a new TTree is       \/\/\n\/\/    attached.                                                           \/\/\n\/\/ void TSelector::Begin(). This method is called before looping on the   \/\/\n\/\/    events in the Tree. The user can create his histograms in this      \/\/\n\/\/    function. When using PROOF Begin() is called on the client only.    \/\/\n\/\/    Histogram creation should preferable be done in SlaveBegin() in     \/\/\n\/\/    that case.                                                          \/\/\n\/\/ void TSelector::SlaveBegin(). This method is called on each PROOF      \/\/\n\/\/    worker node. The user can create his histograms in this method.     \/\/\n\/\/    In local mode this method is called on the client too.              \/\/\n\/\/                                                                        \/\/\n\/\/ Bool_t TSelector::Notify(). This method is called at the first entry   \/\/\n\/\/    of a new file in a chain.                                           \/\/\n\/\/                                                                        \/\/\n\/\/ Bool_t TSelector::Process(Long64_t entry). This method is called       \/\/\n\/\/    to process an event. It is the user's responsability to read        \/\/\n\/\/    the corresponding entry in memory (may be just a partial read).     \/\/\n\/\/    Once the entry is in memory one can apply a selection and if the    \/\/\n\/\/    event is selected histograms can be filled. Processing stops        \/\/\n\/\/    when this function returns kFALSE. This function combines the       \/\/\n\/\/    next two functions in one, avoiding to have to maintain state       \/\/\n\/\/    in the class to communicate between these two functions.             \/\/\n\/\/    See WARNING below about entry.                                      \/\/\n\/\/    This method is used by PROOF.                                       \/\/\n\/\/ Bool_t TSelector::ProcessCut(Long64_t entry). This method is called    \/\/\n\/\/    before processing entry. It is the user's responsability to read    \/\/\n\/\/    the corresponding entry in memory (may be just a partial read).     \/\/\n\/\/    The function returns kTRUE if the entry must be processed,          \/\/\n\/\/    kFALSE otherwise. This method is obsolete, use Process().           \/\/\n\/\/    See WARNING below about entry.                                      \/\/\n\/\/ void TSelector::ProcessFill(Long64_t entry). This method is called     \/\/\n\/\/    for all selected events. User fills histograms in this function.    \/\/\n\/\/    This method is obsolete, use Process().                             \/\/\n\/\/    See WARNING below about entry.                                      \/\/\n\/\/ void TSelector::SlaveTerminate(). This method is called at the end of  \/\/\n\/\/    the loop on all PROOF worker nodes. In local mode this method is    \/\/\n\/\/    called on the client too.                                           \/\/\n\/\/ void TSelector::Terminate(). This method is called at the end of       \/\/\n\/\/    the loop on all events. When using PROOF Terminate() is call on     \/\/\n\/\/    the client only. Typically one performs the fits on the produced    \/\/\n\/\/    histograms or write the histograms to file in this method.          \/\/\n\/\/                                                                        \/\/\n\/\/ WARNING when a selector is used with a TChain:                         \/\/\n\/\/    in the Process, ProcessCut, ProcessFill function, you must use      \/\/\n\/\/    the pointer to the current Tree to call GetEntry(entry).            \/\/\n\/\/    entry is always the local entry number in the current tree.         \/\/\n\/\/    Assuming that fChain is the pointer to the TChain being processed,  \/\/\n\/\/    use fChain->GetTree()->GetEntry(entry);                             \/\/\n\/\/                                                                        \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TROOT.h\"\n#include \"TSystem.h\"\n#include \"TTree.h\"\n#include \"TError.h\"\n#include \"TSelectorCint.h\"\n#include \"TClass.h\"\n#include \"TInterpreter.h\"\n\n\nClassImp(TSelector)\n\n\/\/______________________________________________________________________________\nTSelector::TSelector() : TObject()\n{\n   \/\/ Default selector ctor.\n\n   fStatus = 0;\n   fAbort  = kContinue;\n   fObject = 0;\n   fInput  = 0;\n   fOutput = new TSelectorList;\n   fOutput->SetOwner();\n}\n\n\/\/______________________________________________________________________________\nTSelector::~TSelector()\n{\n   \/\/ Selector destructor.\n\n   delete fOutput;\n}\n\n\/\/______________________________________________________________________________\nvoid TSelector::Abort(const char *why, EAbort what)\n{\n   \/\/ Abort processing. If what = kAbortProcess, the Process() loop will be\n   \/\/ aborted. If what = kAbortFile, the current file in a chain will be\n   \/\/ aborted and the processing will continue with the next file, if there\n   \/\/ is no next file then Process() will be aborted. Abort() can also  be\n   \/\/ called from Begin(), SlaveBegin(), Init() and Notify(). After abort\n   \/\/ the SlaveTerminate() and Terminate() are always called. The abort flag\n   \/\/ can be checked in these methods using GetAbort().\n\n   fAbort = what;\n   TString mess = \"Abort\";\n   if (fAbort == kAbortProcess)\n      mess = \"AbortProcess\";\n   else if (fAbort == kAbortFile)\n      mess = \"AbortFile\";\n\n   Info(mess, \"%s\", why);\n}\n\n\/\/______________________________________________________________________________\nTSelector *TSelector::GetSelector(const char *filename)\n{\n   \/\/ The code in filename is loaded (interpreted or compiled, see below),\n   \/\/ filename must contain a valid class implementation derived from TSelector.\n   \/\/\n   \/\/ If filename is of the form file.C, the file will be interpreted.\n   \/\/ If filename is of the form file.C++, the file file.C will be compiled\n   \/\/ and dynamically loaded. The corresponding binary file and shared\n   \/\/ library will be deleted at the end of the function.\n   \/\/ If filename is of the form file.C+, the file file.C will be compiled\n   \/\/ and dynamically loaded. At next call, if file.C is older than file.o\n   \/\/ and file.so, the file.C is not compiled, only file.so is loaded.\n   \/\/\n   \/\/ The static function returns a pointer to a TSelector object\n\n   \/\/ If the filename does not contain \".\" assume class is compiled in\n   TString localname;\n   Bool_t fromFile = kFALSE;\n   if (strchr(filename, '.') != 0) {\n      \/\/Interpret\/compile filename via CINT\n      localname  = \".L \";\n      localname += filename;\n      gROOT->ProcessLine(localname);\n      fromFile = kTRUE;\n   }\n\n   \/\/loop on all classes known to CINT to find the class on filename\n   \/\/that derives from TSelector\n   const char *basename = gSystem->BaseName(filename);\n   if (!basename) {\n      ::Error(\"TSelector::GetSelector\",\"unable to determine the classname for file %s\", filename);\n      return 0;\n   }\n   TString aclicmode,args,io;\n   localname = gSystem->SplitAclicMode(basename,aclicmode,args,io);\n   Bool_t isCompiled = !fromFile || aclicmode.Length()>0;\n   if (localname.Last('.') != kNPOS)\n      localname.Remove(localname.Last('.'));\n\n   \/\/ if a file was not specified, try to load the class via the interpreter;\n   \/\/ this returns 0 (== failure) in the case the class is already in memory\n   \/\/ but does not have a dictionary, so we just raise a flag for better\n   \/\/ diagnostic in the case the class is not found in the CINT ClassInfo table.\n   Bool_t autoloaderr = kFALSE;\n   if (!fromFile && gCint->AutoLoad(localname) != 1)\n      autoloaderr = kTRUE;\n\n   ClassInfo_t *cl = gCint->ClassInfo_Factory();\n   Bool_t ok = kFALSE;\n   while (gCint->ClassInfo_Next(cl)) {\n      if (localname == gCint->ClassInfo_FullName(cl)) {\n         if (gCint->ClassInfo_IsBase(cl,\"TSelector\")) ok = kTRUE;\n         break;\n      }\n   }\n   if (!ok) {\n      if (fromFile) {\n         ::Error(\"TSelector::GetSelector\",\n         \"file %s does not have a valid class deriving from TSelector\", filename);\n      } else {\n         if (autoloaderr)\n            ::Error(\"TSelector::GetSelector\", \"class %s could not be loaded\", filename);\n         else\n            ::Error(\"TSelector::GetSelector\",\n                    \"class %s does not exist or does not derive from TSelector\", filename);\n      }\n      return 0;\n   }\n\n   \/\/ we can now create an instance of the class\n   TSelector *selector = (TSelector*)gCint->ClassInfo_New(cl);\n   if (!selector || isCompiled) return selector;\n\n   \/\/interpreted selector: cannot be used as such\n   \/\/create a fake selector\n   TSelectorCint *select = new TSelectorCint();\n   select->Build(selector, cl);\n   gCint->ClassInfo_Delete(cl);\n   return select;\n}\n\n\/\/______________________________________________________________________________\nBool_t TSelector::IsStandardDraw(const char *selec)\n{\n   \/\/ Find out if this is a standard selection used for Draw actions\n   \/\/ (either TSelectorDraw, TProofDraw or deriving from them).\n\n   \/\/ Make sure we have a name\n   if (!selec) {\n      ::Info(\"TSelector::IsStandardDraw\",\n             \"selector name undefined - do nothing\");\n      return kFALSE;\n   }\n\n   Bool_t stdselec = kFALSE;\n   if (!strchr(selec, '.')) {\n      if (strstr(selec, \"TSelectorDraw\")) {\n         stdselec = kTRUE;\n      } else {\n         TClass *cl = TClass::GetClass(selec);\n         if (cl && (cl->InheritsFrom(\"TProofDraw\") ||\n                    cl->InheritsFrom(\"TSelectorDraw\")))\n            stdselec = kTRUE;\n      }\n   }\n\n   \/\/ We are done\n   return stdselec;\n}\n<commit_msg>* Simplify and clarify doc for SlaveBegin() versus Begin()  * Wording: use TTree \"entry\" instead of \"event\"<commit_after>\/\/ @(#)root\/tree:$Id$\n\/\/ Author: Rene Brun   05\/02\/97\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\/\/ A TSelector object is used by the TTree::Draw, TTree::Scan,            \/\/\n\/\/ TTree::Process to navigate in a TTree and make selections.             \/\/\n\/\/ It contains the following main methods:                                \/\/\n\/\/                                                                        \/\/\n\/\/ void TSelector::Init(TTree *t). Called every time a new TTree is       \/\/\n\/\/    attached.                                                           \/\/\n\/\/                                                                        \/\/\n\/\/ void TSelector::SlaveBegin(). Create e.g. histograms in this method.   \/\/\n\/\/    This method is called (with or without PROOF) before looping on the \/\/\n\/\/    entries in the Tree. When using PROOF, this method is called on     \/\/\n\/\/    each worker node.                                                   \/\/\n\/\/ void TSelector::Begin(). Mostly for backward compatibility; use        \/\/\n\/\/    SlaveBegin() instead. Both methods are called before looping on the \/\/\n\/\/    entries in the Tree. When using PROOF, Begin() is called on the     \/\/\n\/\/    client only.                                                        \/\/\n\/\/                                                                        \/\/\n\/\/ Bool_t TSelector::Notify(). This method is called at the first entry   \/\/\n\/\/    of a new file in a chain.                                           \/\/\n\/\/                                                                        \/\/\n\/\/ Bool_t TSelector::Process(Long64_t entry). This method is called       \/\/\n\/\/    to process an entry. It is the user's responsability to read        \/\/\n\/\/    the corresponding entry in memory (may be just a partial read).     \/\/\n\/\/    Once the entry is in memory one can apply a selection and if the    \/\/\n\/\/    entry is selected histograms can be filled. Processing stops        \/\/\n\/\/    when this function returns kFALSE. This function combines the       \/\/\n\/\/    next two functions in one, avoiding to have to maintain state       \/\/\n\/\/    in the class to communicate between these two functions.            \/\/\n\/\/    See WARNING below about entry.                                      \/\/\n\/\/    This method is used by PROOF.                                       \/\/\n\/\/ Bool_t TSelector::ProcessCut(Long64_t entry). This method is called    \/\/\n\/\/    before processing entry. It is the user's responsability to read    \/\/\n\/\/    the corresponding entry in memory (may be just a partial read).     \/\/\n\/\/    The function returns kTRUE if the entry must be processed,          \/\/\n\/\/    kFALSE otherwise. This method is obsolete, use Process().           \/\/\n\/\/    See WARNING below about entry.                                      \/\/\n\/\/ void TSelector::ProcessFill(Long64_t entry). This method is called     \/\/\n\/\/    for all selected entries. User fills histograms in this function.   \/\/\n\/\/    This method is obsolete, use Process().                             \/\/\n\/\/    See WARNING below about entry.                                      \/\/\n\/\/ void TSelector::SlaveTerminate(). This method is called at the end of  \/\/\n\/\/    the loop on all PROOF worker nodes. In local mode this method is    \/\/\n\/\/    called on the client too.                                           \/\/\n\/\/ void TSelector::Terminate(). This method is called at the end of       \/\/\n\/\/    the loop on all entries. When using PROOF Terminate() is call on    \/\/\n\/\/    the client only. Typically one performs the fits on the produced    \/\/\n\/\/    histograms or write the histograms to file in this method.          \/\/\n\/\/                                                                        \/\/\n\/\/ WARNING when a selector is used with a TChain:                         \/\/\n\/\/    in the Process, ProcessCut, ProcessFill function, you must use      \/\/\n\/\/    the pointer to the current Tree to call GetEntry(entry).            \/\/\n\/\/    entry is always the local entry number in the current tree.         \/\/\n\/\/    Assuming that fChain is the pointer to the TChain being processed,  \/\/\n\/\/    use fChain->GetTree()->GetEntry(entry);                             \/\/\n\/\/                                                                        \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TROOT.h\"\n#include \"TSystem.h\"\n#include \"TTree.h\"\n#include \"TError.h\"\n#include \"TSelectorCint.h\"\n#include \"TClass.h\"\n#include \"TInterpreter.h\"\n\n\nClassImp(TSelector)\n\n\/\/______________________________________________________________________________\nTSelector::TSelector() : TObject()\n{\n   \/\/ Default selector ctor.\n\n   fStatus = 0;\n   fAbort  = kContinue;\n   fObject = 0;\n   fInput  = 0;\n   fOutput = new TSelectorList;\n   fOutput->SetOwner();\n}\n\n\/\/______________________________________________________________________________\nTSelector::~TSelector()\n{\n   \/\/ Selector destructor.\n\n   delete fOutput;\n}\n\n\/\/______________________________________________________________________________\nvoid TSelector::Abort(const char *why, EAbort what)\n{\n   \/\/ Abort processing. If what = kAbortProcess, the Process() loop will be\n   \/\/ aborted. If what = kAbortFile, the current file in a chain will be\n   \/\/ aborted and the processing will continue with the next file, if there\n   \/\/ is no next file then Process() will be aborted. Abort() can also  be\n   \/\/ called from Begin(), SlaveBegin(), Init() and Notify(). After abort\n   \/\/ the SlaveTerminate() and Terminate() are always called. The abort flag\n   \/\/ can be checked in these methods using GetAbort().\n\n   fAbort = what;\n   TString mess = \"Abort\";\n   if (fAbort == kAbortProcess)\n      mess = \"AbortProcess\";\n   else if (fAbort == kAbortFile)\n      mess = \"AbortFile\";\n\n   Info(mess, \"%s\", why);\n}\n\n\/\/______________________________________________________________________________\nTSelector *TSelector::GetSelector(const char *filename)\n{\n   \/\/ The code in filename is loaded (interpreted or compiled, see below),\n   \/\/ filename must contain a valid class implementation derived from TSelector.\n   \/\/\n   \/\/ If filename is of the form file.C, the file will be interpreted.\n   \/\/ If filename is of the form file.C++, the file file.C will be compiled\n   \/\/ and dynamically loaded. The corresponding binary file and shared\n   \/\/ library will be deleted at the end of the function.\n   \/\/ If filename is of the form file.C+, the file file.C will be compiled\n   \/\/ and dynamically loaded. At next call, if file.C is older than file.o\n   \/\/ and file.so, the file.C is not compiled, only file.so is loaded.\n   \/\/\n   \/\/ The static function returns a pointer to a TSelector object\n\n   \/\/ If the filename does not contain \".\" assume class is compiled in\n   TString localname;\n   Bool_t fromFile = kFALSE;\n   if (strchr(filename, '.') != 0) {\n      \/\/Interpret\/compile filename via CINT\n      localname  = \".L \";\n      localname += filename;\n      gROOT->ProcessLine(localname);\n      fromFile = kTRUE;\n   }\n\n   \/\/loop on all classes known to CINT to find the class on filename\n   \/\/that derives from TSelector\n   const char *basename = gSystem->BaseName(filename);\n   if (!basename) {\n      ::Error(\"TSelector::GetSelector\",\"unable to determine the classname for file %s\", filename);\n      return 0;\n   }\n   TString aclicmode,args,io;\n   localname = gSystem->SplitAclicMode(basename,aclicmode,args,io);\n   Bool_t isCompiled = !fromFile || aclicmode.Length()>0;\n   if (localname.Last('.') != kNPOS)\n      localname.Remove(localname.Last('.'));\n\n   \/\/ if a file was not specified, try to load the class via the interpreter;\n   \/\/ this returns 0 (== failure) in the case the class is already in memory\n   \/\/ but does not have a dictionary, so we just raise a flag for better\n   \/\/ diagnostic in the case the class is not found in the CINT ClassInfo table.\n   Bool_t autoloaderr = kFALSE;\n   if (!fromFile && gCint->AutoLoad(localname) != 1)\n      autoloaderr = kTRUE;\n\n   ClassInfo_t *cl = gCint->ClassInfo_Factory();\n   Bool_t ok = kFALSE;\n   while (gCint->ClassInfo_Next(cl)) {\n      if (localname == gCint->ClassInfo_FullName(cl)) {\n         if (gCint->ClassInfo_IsBase(cl,\"TSelector\")) ok = kTRUE;\n         break;\n      }\n   }\n   if (!ok) {\n      if (fromFile) {\n         ::Error(\"TSelector::GetSelector\",\n         \"file %s does not have a valid class deriving from TSelector\", filename);\n      } else {\n         if (autoloaderr)\n            ::Error(\"TSelector::GetSelector\", \"class %s could not be loaded\", filename);\n         else\n            ::Error(\"TSelector::GetSelector\",\n                    \"class %s does not exist or does not derive from TSelector\", filename);\n      }\n      return 0;\n   }\n\n   \/\/ we can now create an instance of the class\n   TSelector *selector = (TSelector*)gCint->ClassInfo_New(cl);\n   if (!selector || isCompiled) return selector;\n\n   \/\/interpreted selector: cannot be used as such\n   \/\/create a fake selector\n   TSelectorCint *select = new TSelectorCint();\n   select->Build(selector, cl);\n   gCint->ClassInfo_Delete(cl);\n   return select;\n}\n\n\/\/______________________________________________________________________________\nBool_t TSelector::IsStandardDraw(const char *selec)\n{\n   \/\/ Find out if this is a standard selection used for Draw actions\n   \/\/ (either TSelectorDraw, TProofDraw or deriving from them).\n\n   \/\/ Make sure we have a name\n   if (!selec) {\n      ::Info(\"TSelector::IsStandardDraw\",\n             \"selector name undefined - do nothing\");\n      return kFALSE;\n   }\n\n   Bool_t stdselec = kFALSE;\n   if (!strchr(selec, '.')) {\n      if (strstr(selec, \"TSelectorDraw\")) {\n         stdselec = kTRUE;\n      } else {\n         TClass *cl = TClass::GetClass(selec);\n         if (cl && (cl->InheritsFrom(\"TProofDraw\") ||\n                    cl->InheritsFrom(\"TSelectorDraw\")))\n            stdselec = kTRUE;\n      }\n   }\n\n   \/\/ We are done\n   return stdselec;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-\n\/\/ vi: set ts=2 noet:\n\/\/\n\/\/ Copyright (c) 2016 Sergey Lyskov <sergey.lyskov@jhu.edu>\n\/\/\n\/\/ All rights reserved. Use of this source code is governed by a\n\/\/ MIT license that can be found in the LICENSE file.\n\n\/\/\/ @file   binder\/enum.cpp\n\/\/\/ @brief  Binding generation for C++ enums\n\/\/\/ @author Sergey Lyskov\n\n\n#include <enum.hpp>\n\n#include <type.hpp>\n#include <util.hpp>\n\n#include <fmt\/format.h>\n\n#include <clang\/AST\/ASTContext.h>\n\nusing namespace llvm;\nusing namespace clang;\n\nusing std::string;\nusing std::vector;\n\nusing namespace fmt::literals;\n\nnamespace binder {\n\n\n\/\/\/ extract include needed for this generator and add it to includes vector\nvoid add_relevant_includes(clang::EnumDecl const *E, IncludeSet &includes, int level)\n{\n\tif( !includes.add_decl(E, level) ) return;\n\tadd_relevant_include_for_decl(E, includes);\n}\n\n\n\/\/ Generate binding for given function: py::enum_<MyEnum>(module, \"MyEnum\")...\nstd::string bind_enum(std::string const & module, EnumDecl *E)\n{\n\tstring name { E->getNameAsString() };\n\tstring qualified_name { E->getQualifiedNameAsString() };\n\n\tstring r = \"\\tpybind11::enum_<{}>({}, \\\"{}\\\", \\\"{}\\\")\\n\"_format(qualified_name, module, name, generate_documentation_string_for_declaration(E));\n\n\tfor(auto e = E->enumerator_begin(); e != E->enumerator_end(); ++e) {\n\t\tr += \"\\t\\t.value(\\\"{}\\\", {})\\n\"_format(e->getNameAsString(), e->getQualifiedNameAsString());\n\t}\n\tr.pop_back();\n\n\treturn r + ( E->isScopedUsingClassTag() ? \";\\n\\n\" : \"\\n\\t\\t.export_values();\\n\\n\" );\n}\n\n\n\/\/\/ Generate string id that uniquly identify C++ binding object. For functions this is function prototype and for classes forward declaration.\nstring EnumBinder::id() const\n{\n\treturn E->getQualifiedNameAsString();\n}\n\n\n\/\/\/ check if generator can create binding\nbool EnumBinder::bindable() const\n{\n\tif( E->isCXXInstanceMember()  or  E->isCXXClassMember() ) return false;\n\telse return true;\n}\n\n\n\/\/\/ check if user requested binding for the given declaration\nvoid EnumBinder::request_bindings_and_skipping(Config const &config)\n{\n\tif( config.is_namespace_binding_requested( namespace_from_named_decl(E) ) ) Binder::request_bindings();\n}\n\n\n\/\/\/ extract include needed for this generator and add it to includes vector\nvoid EnumBinder::add_relevant_includes(IncludeSet &includes) const\n{\n\tbinder::add_relevant_includes(E, includes, 0);\n}\n\n\/\/\/ generate binding code for this object and all its dependencies\nvoid EnumBinder::bind(Context &context)\n{\n\tif( is_binded() ) return;\n\n\tstring const module_variable_name = context.module_variable_name( namespace_from_named_decl(E) );\n\n\tcode()  = \"\\t\" + generate_comment_for_declaration(E);\n\tcode() += bind_enum(module_variable_name, E) + \";\\n\\n\";\n}\n\n\n\n} \/\/ namespace binder\n<commit_msg>enum include should also reference definition headers<commit_after>\/\/ -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-\n\/\/ vi: set ts=2 noet:\n\/\/\n\/\/ Copyright (c) 2016 Sergey Lyskov <sergey.lyskov@jhu.edu>\n\/\/\n\/\/ All rights reserved. Use of this source code is governed by a\n\/\/ MIT license that can be found in the LICENSE file.\n\n\/\/\/ @file   binder\/enum.cpp\n\/\/\/ @brief  Binding generation for C++ enums\n\/\/\/ @author Sergey Lyskov\n\n\n#include <enum.hpp>\n\n#include <type.hpp>\n#include <util.hpp>\n\n#include <fmt\/format.h>\n\n#include <clang\/AST\/ASTContext.h>\n\nusing namespace llvm;\nusing namespace clang;\n\nusing std::string;\nusing std::vector;\n\nusing namespace fmt::literals;\n\nnamespace binder {\n\n\n\/\/\/ extract include needed for this generator and add it to includes vector\nvoid add_relevant_includes(clang::EnumDecl const *E, IncludeSet &includes, int level)\n{\n\tif( !includes.add_decl(E, level) ) return;\n\tadd_relevant_include_for_decl(E, includes);\n\n\tadd_relevant_include_for_decl(E->getDefinition(), includes);\n}\n\n\n\/\/ Generate binding for given function: py::enum_<MyEnum>(module, \"MyEnum\")...\nstd::string bind_enum(std::string const & module, EnumDecl *E)\n{\n\tstring name { E->getNameAsString() };\n\tstring qualified_name { E->getQualifiedNameAsString() };\n\n\tstring r = \"\\tpybind11::enum_<{}>({}, \\\"{}\\\", \\\"{}\\\")\\n\"_format(qualified_name, module, name, generate_documentation_string_for_declaration(E));\n\n\tfor(auto e = E->enumerator_begin(); e != E->enumerator_end(); ++e) {\n\t\tr += \"\\t\\t.value(\\\"{}\\\", {})\\n\"_format(e->getNameAsString(), e->getQualifiedNameAsString());\n\t}\n\tr.pop_back();\n\n\treturn r + ( E->isScopedUsingClassTag() ? \";\\n\\n\" : \"\\n\\t\\t.export_values();\\n\\n\" );\n}\n\n\n\/\/\/ Generate string id that uniquly identify C++ binding object. For functions this is function prototype and for classes forward declaration.\nstring EnumBinder::id() const\n{\n\treturn E->getQualifiedNameAsString();\n}\n\n\n\/\/\/ check if generator can create binding\nbool EnumBinder::bindable() const\n{\n\tif( E->isCXXInstanceMember()  or  E->isCXXClassMember() ) return false;\n\telse return true;\n}\n\n\n\/\/\/ check if user requested binding for the given declaration\nvoid EnumBinder::request_bindings_and_skipping(Config const &config)\n{\n\tif( config.is_namespace_binding_requested( namespace_from_named_decl(E) ) ) Binder::request_bindings();\n}\n\n\n\/\/\/ extract include needed for this generator and add it to includes vector\nvoid EnumBinder::add_relevant_includes(IncludeSet &includes) const\n{\n\tbinder::add_relevant_includes(E, includes, 0);\n}\n\n\/\/\/ generate binding code for this object and all its dependencies\nvoid EnumBinder::bind(Context &context)\n{\n\tif( is_binded() ) return;\n\n\tstring const module_variable_name = context.module_variable_name( namespace_from_named_decl(E) );\n\n\tcode()  = \"\\t\" + generate_comment_for_declaration(E);\n\tcode() += bind_enum(module_variable_name, E) + \";\\n\\n\";\n}\n\n\n\n} \/\/ namespace binder\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\/nest\/p9_l2_flush.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\/\/\/ @file p9_l2_flush.H\n\/\/\/ @brief Flush the P9 L2 cache (FAPI)\n\/\/\/\n\/\/\/ *HWP HWP Owner   : Benjamin Gass <bgass@us.ibm.com>\n\/\/\/ *HWP FW Owner    : Bilicon Patil  <bilpatil@in.ibm.com>\n\/\/\/ *HWP Team        : Quad\n\/\/\/ *HWP Consumed by : FSP\n\/\/\/ *HWP Level       : 2\n\/\/\/\n\n\/\/------------------------------------------------------------------------------\n\/\/ Includes\n\/\/------------------------------------------------------------------------------\n#include <p9_quad_scom_addresses.H>\n#include <p9_l2_flush.H>\n\n\/\/------------------------------------------------------------------------------\n\/\/ Constant definitions\n\/\/------------------------------------------------------------------------------\n\n\/\/ L2 Purge Engine Command Register bit\/field definitions\nenum\n{\n    PURGE_CMD_TRIGGER_BIT            = 0,\n    PURGE_CMD_REG_BUSY               = 9,\n    PURGE_CMD_PRGSM_BUSY_ON_THIS_BIT = 10,\n    PURGE_CMD_PRGSM_BUSY_BIT         = 11,\n    PURGE_CMD_ERR_BIT                = 29,\n    PURGE_CMD_TYPE_BIT               = 1,\n    PURGE_CMD_MEM_BIT                = 17,\n    PURGE_CMD_BANK_BIT               = 28,\n    PURGE_CMD_CGC_BIT                = 20\n};\n\n\/\/ L2 Purge Engine Command Register bit\/field Lengths\nenum\n{\n    PURGE_CMD_TYPE_BIT_LENGTH   = 4,\n    PURGE_CMD_MEM_BIT_LENGTH    = 3,\n    PURGE_CMD_BANK_BIT_LENGTH   = 1,\n    PURGE_CMD_CGC_BIT_LENGTH    = 8\n};\n\n\/\/ polling constants\nenum\n{\n    P9_L2_FLUSH_HW_NS_DELAY     = 10000, \/\/ unit is nano seconds\n    P9_L2_FLUSH_SIM_CYCLE_DELAY = 12000, \/\/ unit is cycles\n    P9_L2_FLUSH_MAX_POLLS       = 200    \/\/ unit is cycles\n};\n\n\/\/------------------------------------------------------------------------------\n\/\/ Function definitions\n\/\/------------------------------------------------------------------------------\n\n\/\/------------------------------------------------------------------------------\n\/\/\/\n\/\/\/ @brief l2_flush_start: Utility subroutine to initiate L2 cache flush\n\/\/\/                        via purge engine\n\/\/\/ @param[in]  i_target Ex target\n\/\/\/ @param[in]  i_regAddr The scom address to use\n\/\/\/ @param[in]  i_purgeData Structure having values for MEM, CGC, BANK\n\/\/\/                         passed by the user\n\/\/\/ @return  FAPI2_RC_SUCCESS if purge operation was started,\n\/\/\/          RC_P9_L2_FLUSH_PURGE_REQ_OUTSTANDING if a prior purge\n\/\/\/          operation has not yet completed\n\/\/\/          else FAPI getscom\/putscom return code for failing operation\n\/\/------------------------------------------------------------------------------\nfapi2::ReturnCode l2_flush_start(\n    const fapi2::Target<fapi2::TARGET_TYPE_EX>& i_target,\n    const uint32_t i_regAddr,\n    const p9core::purgeData_t& i_purgeData)\n{\n    fapi2::buffer<uint64_t> l_cmdReg;\n    fapi2::buffer<uint64_t> l_purgeCmd;\n\n    FAPI_INF(\"l2_flush_start: Enter\");\n\n    \/\/ ensure that purge engine is idle before starting flush\n    \/\/ poll Purge Engine status\n    FAPI_DBG(\"Reading L2 Purge Engine Command Register to check status\");\n    FAPI_TRY(fapi2::getScom(i_target, i_regAddr, l_cmdReg));\n\n    \/\/ check to see if this reg is idle and ready to accept a new command\n    FAPI_ASSERT(!l_cmdReg.getBit<PURGE_CMD_REG_BUSY>(),\n                fapi2::P9_L2_FLUSH_PURGE_REQ_OUTSTANDING()\n                .set_TARGET(i_target)\n                .set_CMD_REG(l_cmdReg)\n                .set_CMD_REG_ADDR(i_regAddr),\n                \"Previous purge request has not completed for target\");\n\n    \/\/ write PURGE_CMD_TRIGGER bit in Purge Engine Command Register\n    \/\/ ensure PURGE_CMD_TYPE\/MEM\/CGC\/BANK are clear to specify flush\n    \/\/ of entire cache\n    FAPI_DBG(\"Write L2 Purge Engine Command Register to initiate cache flush\");\n    l_purgeCmd.insert<PURGE_CMD_TYPE_BIT,\n                      PURGE_CMD_TYPE_BIT_LENGTH>(i_purgeData.iv_cmdType);\n\n    l_purgeCmd.insert<PURGE_CMD_MEM_BIT,\n                      PURGE_CMD_MEM_BIT_LENGTH>(i_purgeData.iv_cmdMem);\n\n    l_purgeCmd.insert<PURGE_CMD_BANK_BIT,\n                      PURGE_CMD_BANK_BIT_LENGTH>(i_purgeData.iv_cmdBank);\n\n    l_purgeCmd.insert<PURGE_CMD_CGC_BIT,\n                      PURGE_CMD_CGC_BIT_LENGTH>(i_purgeData.iv_cmdCGC);\n\n    l_purgeCmd.setBit<PURGE_CMD_TRIGGER_BIT>();\n\n    FAPI_TRY(fapi2::putScom(i_target, i_regAddr, l_purgeCmd));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\n\/\/------------------------------------------------------------------------------\n\/\/\/\n\/\/\/ @brief l2_flush_check_status: Utility subroutine to poll L2 purge\n\/\/\/                                    engine status, looking for clean idle\n\/\/\/                                    state\n\/\/\/ @param[in] i_target EX chiplet target\n\/\/\/ @param[in] i_regAddr Purge engine register SCOM address\n\/\/\/ @return FAPI2_RC_SUCCESS if engine status returns as idle (with no errors)\n\/\/\/         before maximum number of polls has been reached\n\/\/\/         RC_P9_L2_FLUSH_CMD_ERROR\n\/\/\/              if purge command error reported,\n\/\/\/         RC_P9_L2_FLUSH_CMD_TIMEOUT\n\/\/\/              if purge operation did not complete prior to polling limit,\n\/\/\/         else FAPI getscom\/putscom return code for failing operation\n\/\/\/\n\/\/------------------------------------------------------------------------------\nfapi2::ReturnCode l2_flush_check_status(\n    const fapi2::Target<fapi2::TARGET_TYPE_EX>& i_target,\n    const uint32_t i_regAddr)\n{\n    fapi2::buffer<uint64_t> l_cmdReg;\n    uint32_t l_polls = 1;\n\n    FAPI_INF(\"l2_flush_check_status: Enter\");\n\n    while(1)\n    {\n        \/\/ poll Purge Engine status\n        FAPI_DBG(\"Reading L2 Purge Engine Command Register to check status\");\n        FAPI_TRY(fapi2::getScom(i_target, i_regAddr, l_cmdReg));\n\n        \/\/ check state of PURGE_CMD_ERR\n        FAPI_ASSERT(!l_cmdReg.getBit<PURGE_CMD_ERR_BIT>(),\n                    fapi2::P9_L2_FLUSH_CMD_ERROR()\n                    .set_TARGET(i_target)\n                    .set_CMD_REG(l_cmdReg)\n                    .set_CMD_REG_ADDR(i_regAddr),\n                    \"Purge failed. PURGE_CMD_ERR_BIT set\");\n\n        \/\/ check to see if this reg is idle and ready to accept a new command\n        if (!l_cmdReg.getBit<PURGE_CMD_REG_BUSY>())\n        {\n            FAPI_DBG(\"Purge engine idle\");\n            break;\n        }\n\n        \/\/ engine busy, dump status\n        FAPI_DBG(\"Purge engine busy (reg_busy = %d, busy_on_this = %d,\"\n                 \" sm_busy = %d)\",\n                 l_cmdReg.getBit<PURGE_CMD_REG_BUSY>(),\n                 l_cmdReg.getBit<PURGE_CMD_PRGSM_BUSY_ON_THIS_BIT>(),\n                 l_cmdReg.getBit<PURGE_CMD_PRGSM_BUSY_BIT>());\n\n        \/\/ check if loop count has expired\n        FAPI_ASSERT((l_polls < P9_L2_FLUSH_MAX_POLLS),\n                    fapi2::P9_L2_FLUSH_CMD_TIMEOUT()\n                    .set_TARGET(i_target)\n                    .set_CMD_REG(l_cmdReg)\n                    .set_CMD_REG_ADDR(i_regAddr)\n                    .set_NUMBER_OF_ATTEMPTS(l_polls),\n                    \"Purge engine still busy after %d loops\", l_polls);\n\n        \/\/ l_polls left, delay prior to next poll\n        FAPI_DBG(\"%d loops done, delaying before next poll\", l_polls);\n\n        FAPI_TRY(fapi2::delay(P9_L2_FLUSH_HW_NS_DELAY,\n                              P9_L2_FLUSH_SIM_CYCLE_DELAY),\n                 \"fapi delay Error\");\n\n        l_polls++;\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ Hardware Procedure\n\/\/------------------------------------------------------------------------------\nfapi2::ReturnCode p9_l2_flush(const fapi2::Target < fapi2::TARGET_TYPE_EX >\n                              & i_target,\n                              const p9core::purgeData_t& i_purgeData)\n{\n    FAPI_DBG(\"i_purgeData [iv_cmdType: 0x%x] [iv_cmdMem : 0x%x] \"\n             \"[iv_cmdBank: 0x%x] [iv_cmdCGC : 0x%x]\", i_purgeData.iv_cmdType,\n             i_purgeData.iv_cmdMem, i_purgeData.iv_cmdBank, i_purgeData.iv_cmdCGC);\n\n    uint32_t l_regAddr = EX_PRD_PURGE_CMD_REG;\n\n    \/\/ initiate flush\n    FAPI_TRY(l2_flush_start(i_target, l_regAddr, i_purgeData));\n\n    \/\/ check that flush completes and the purge engine is idle\n    \/\/ before exiting\n    FAPI_TRY(l2_flush_check_status(i_target, l_regAddr));\n\nfapi_try_exit:\n    FAPI_INF(\"l2_flush, Ex: Exit\");\n    return fapi2::current_err;\n}\n<commit_msg>L3 Update - p9_l2\/l3_flush.C<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/nest\/p9_l2_flush.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_l2_flush.H\n\/\/\/ @brief Flush the P9 L2 cache (FAPI)\n\/\/\/\n\/\/\/ *HWP HWP Owner   : Benjamin Gass <bgass@us.ibm.com>\n\/\/\/ *HWP FW Owner    : Thi Tran <thi@us.ibm.com>\n\/\/\/ *HWP Team        : Quad\n\/\/\/ *HWP Consumed by : FSP and SBE\n\/\/\/ *HWP Level       : 3\n\/\/\/\n\n\/\/------------------------------------------------------------------------------\n\/\/ Includes\n\/\/------------------------------------------------------------------------------\n#include <p9_l2_flush.H>\n#include <p9_quad_scom_addresses.H>\n#include <p9_quad_scom_addresses_fld.H>\n\n\/\/------------------------------------------------------------------------------\n\/\/ Constant definitions\n\/\/------------------------------------------------------------------------------\n\n\/\/ polling constants\nenum\n{\n    P9_L2_FLUSH_HW_NS_DELAY     = 10000, \/\/ unit is nano seconds\n    P9_L2_FLUSH_SIM_CYCLE_DELAY = 12000, \/\/ unit is cycles\n    P9_L2_FLUSH_MAX_POLLS       = 200    \/\/ unit is cycles\n};\n\n\/\/------------------------------------------------------------------------------\n\/\/ Function definitions\n\/\/------------------------------------------------------------------------------\n\n\/\/\/-----------------------------------------------------------------------------\n\/\/\/ @brief Utility subroutine to initiate L2 cache flush via purge engine.\n\/\/\/\n\/\/\/ @param[in]  i_target    EX target\n\/\/\/ @param[in]  i_regAddr   The scom address to use\n\/\/\/ @param[in]  i_purgeData Structure having values for MEM, CGC, BANK\n\/\/\/                         passed by the user\n\/\/\/\n\/\/\/ @return  FAPI2_RC_SUCCESS if purge operation was started,\n\/\/\/          RC_P9_L2_FLUSH_PURGE_REQ_OUTSTANDING if a prior purge\n\/\/\/          operation has not yet completed\n\/\/\/          else FAPI getscom\/putscom return code for failing operation\n\/\/\/-----------------------------------------------------------------------------\nfapi2::ReturnCode l2_flush_start(\n    const fapi2::Target<fapi2::TARGET_TYPE_EX>& i_target,\n    const uint32_t i_regAddr,\n    const p9core::purgeData_t& i_purgeData)\n{\n    fapi2::buffer<uint64_t> l_cmdReg;\n    fapi2::buffer<uint64_t> l_purgeCmd;\n\n    FAPI_DBG(\"l2_flush_start: Enter\");\n\n    \/\/ ensure that purge engine is idle before starting flush\n    \/\/ poll Purge Engine status\n    FAPI_DBG(\"Reading L2 Purge Engine Command Register to check status\");\n    FAPI_TRY(fapi2::getScom(i_target, i_regAddr, l_cmdReg));\n\n    \/\/ check to see if this reg is idle and ready to accept a new command\n    FAPI_ASSERT(!l_cmdReg.getBit<EX_PRD_PURGE_CMD_REG_BUSY>(),\n                fapi2::P9_L2_FLUSH_PURGE_REQ_OUTSTANDING()\n                .set_TARGET(i_target)\n                .set_CMD_REG(l_cmdReg)\n                .set_CMD_REG_ADDR(i_regAddr),\n                \"Previous purge request has not completed for target\");\n\n    \/\/ write PURGE_CMD_TRIGGER bit in Purge Engine Command Register\n    \/\/ ensure PURGE_CMD_TYPE\/MEM\/CGC\/BANK are clear to specify flush\n    \/\/ of entire cache\n    FAPI_DBG(\"Write L2 Purge Engine Command Register to initiate cache flush\");\n    l_purgeCmd.insert<EX_PRD_PURGE_CMD_REG_TYPE,\n                      EX_PRD_PURGE_CMD_REG_TYPE_LEN>(i_purgeData.iv_cmdType);\n\n    l_purgeCmd.insert<EX_PRD_PURGE_CMD_REG_MEM,\n                      EX_PRD_PURGE_CMD_REG_MEM_LEN>(i_purgeData.iv_cmdMem);\n\n    l_purgeCmd.insert<EX_PRD_PURGE_CMD_REG_BANK, 1>(i_purgeData.iv_cmdBank);\n\n    l_purgeCmd.insert<EX_PRD_PURGE_CMD_REG_CGC,\n                      EQ_PRD_PURGE_CMD_REG_CGC_LEN>(i_purgeData.iv_cmdCGC);\n\n    l_purgeCmd.setBit<EX_PRD_PURGE_CMD_REG_TRIGGER>();\n\n    FAPI_TRY(fapi2::putScom(i_target, i_regAddr, l_purgeCmd));\n\nfapi_try_exit:\n    FAPI_DBG(\"l2_flush_start: Exit\");\n    return fapi2::current_err;\n}\n\n\/\/\/-----------------------------------------------------------------------------\n\/\/\/ @brief Utility subroutine to poll L2 purge engine status, looking for\n\/\/\/        clean idle state.\n\/\/\/\n\/\/\/ @param[in] i_target EX chiplet target\n\/\/\/ @param[in] i_regAddr Purge engine register SCOM address\n\/\/\/\n\/\/\/ @return FAPI2_RC_SUCCESS if engine status returns as idle (with no errors)\n\/\/\/         before maximum number of polls has been reached\n\/\/\/         RC_P9_L2_FLUSH_CMD_ERROR\n\/\/\/              if purge command error reported,\n\/\/\/         RC_P9_L2_FLUSH_CMD_TIMEOUT\n\/\/\/              if purge operation did not complete prior to polling limit,\n\/\/\/         else FAPI getscom\/putscom return code for failing operation\n\/\/\/-----------------------------------------------------------------------------\nfapi2::ReturnCode l2_flush_check_status(\n    const fapi2::Target<fapi2::TARGET_TYPE_EX>& i_target,\n    const uint32_t i_regAddr)\n{\n    fapi2::buffer<uint64_t> l_cmdReg;\n    uint32_t l_polls = 1;\n\n    FAPI_DBG(\"l2_flush_check_status: Enter\");\n\n    while(1)\n    {\n        \/\/ poll Purge Engine status\n        FAPI_DBG(\"Reading L2 Purge Engine Command Register to check status\");\n        FAPI_TRY(fapi2::getScom(i_target, i_regAddr, l_cmdReg));\n\n        \/\/ check state of PURGE_CMD_ERR\n        FAPI_ASSERT(!l_cmdReg.getBit<EX_PRD_PURGE_CMD_REG_ERR>(),\n                    fapi2::P9_L2_FLUSH_CMD_ERROR()\n                    .set_TARGET(i_target)\n                    .set_CMD_REG(l_cmdReg)\n                    .set_CMD_REG_ADDR(i_regAddr),\n                    \"Purge failed. EX_PRD_PURGE_CMD_REG_ERR set\");\n\n        \/\/ check to see if this reg is idle and ready to accept a new command\n        if (!l_cmdReg.getBit<EX_PRD_PURGE_CMD_REG_BUSY>())\n        {\n            FAPI_DBG(\"Purge engine idle\");\n            break;\n        }\n\n        \/\/ engine busy, dump status\n        FAPI_DBG(\"Purge engine busy (reg_busy = %d, busy_on_this = %d,\"\n                 \" sm_busy = %d)\",\n                 l_cmdReg.getBit<EX_PRD_PURGE_CMD_REG_BUSY>(),\n                 l_cmdReg.getBit<EX_PRD_PURGE_CMD_REG_PRGSM_BUSY_ON_THIS>(),\n                 l_cmdReg.getBit<EX_PRD_PURGE_CMD_REG_PRGSM_BUSY>());\n\n        \/\/ check if loop count has expired\n        FAPI_ASSERT((l_polls < P9_L2_FLUSH_MAX_POLLS),\n                    fapi2::P9_L2_FLUSH_CMD_TIMEOUT()\n                    .set_TARGET(i_target)\n                    .set_CMD_REG(l_cmdReg)\n                    .set_CMD_REG_ADDR(i_regAddr)\n                    .set_NUMBER_OF_ATTEMPTS(l_polls),\n                    \"Purge engine still busy after %d loops\", l_polls);\n\n        \/\/ l_polls left, delay prior to next poll\n        FAPI_DBG(\"%d loops done, delaying before next poll\", l_polls);\n\n        FAPI_TRY(fapi2::delay(P9_L2_FLUSH_HW_NS_DELAY,\n                              P9_L2_FLUSH_SIM_CYCLE_DELAY));\n\n        l_polls++;\n    }\n\nfapi_try_exit:\n    FAPI_DBG(\"l2_flush_check_status: Exit\");\n    return fapi2::current_err;\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ Hardware Procedure\n\/\/ See doxygen in header file.\n\/\/------------------------------------------------------------------------------\nfapi2::ReturnCode p9_l2_flush(\n    const fapi2::Target <fapi2::TARGET_TYPE_EX>& i_target,\n    const p9core::purgeData_t& i_purgeData)\n{\n    FAPI_DBG(\"Entering p9_l2_flush: i_purgeData [iv_cmdType: 0x%x] \"\n             \"[iv_cmdMem : 0x%x] [iv_cmdBank: 0x%x] [iv_cmdCGC : 0x%x]\",\n             i_purgeData.iv_cmdType, i_purgeData.iv_cmdMem,\n             i_purgeData.iv_cmdBank, i_purgeData.iv_cmdCGC);\n\n    uint32_t l_regAddr = EX_PRD_PURGE_CMD_REG;\n\n    \/\/ initiate flush\n    FAPI_TRY(l2_flush_start(i_target, l_regAddr, i_purgeData));\n\n    \/\/ check that flush completes and the purge engine is idle\n    \/\/ before exiting\n    FAPI_TRY(l2_flush_check_status(i_target, l_regAddr));\n\nfapi_try_exit:\n    FAPI_DBG(\"p9_l2_flush: Exit\");\n    return fapi2::current_err;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ first working version\n\/\/ no runtime info was generated\n\/\/ repo: https:\/\/github.com\/hun-nemethpeter\/clang in branch typid_ast\n\/\/ direct link to patch: https:\/\/github.com\/llvm-mirror\/clang\/compare\/master...hun-nemethpeter:typid_ast\n\n#include \"ast.h\"\n\nstruct Test\n{\n  bool member1;\n  char member2;\n};\n\nint main()\n{\n  static_assert(typeid<Test>.name() == \"Test\");\n  static_assert(typeid<Test>.members().size() == 2);\n  static_assert(typeid<Test>.members()[0].name() == \"member1\");\n  static_assert(typeid<Test>.members()[0].type().name() == \"bool\");\n  static_assert(typeid<Test>.members()[1].name() == \"member2\");\n  static_assert(typeid<Test>.members()[1].type().name() == \"char\");\n  static_assert(typeid<Test>.bases().size() == 0);\n  static_assert(typeid<Test2>.name() == \"Test2\");\n\n  return 0;\n}\n<commit_msg>Update test.cpp<commit_after>\/\/ first working version\n\/\/ no runtime info was generated\n\/\/ repo: https:\/\/github.com\/hun-nemethpeter\/clang in branch typid_ast\n\/\/ direct link to patch: https:\/\/github.com\/llvm-mirror\/clang\/compare\/master...hun-nemethpeter:typid_ast\n\n#include \"ast.h\"\n\nstruct Test\n{\n  bool member1;\n  char member2;\n};\n\nint main()\n{\n  static_assert(typeid<Test>.name() == \"Test\");\n  static_assert(typeid<Test>.members().size() == 2);\n  static_assert(typeid<Test>.members()[0].name() == \"member1\");\n  static_assert(typeid<Test>.members()[0].type().name() == \"bool\");\n  static_assert(typeid<Test>.members()[1].name() == \"member2\");\n  static_assert(typeid<Test>.members()[1].type().name() == \"char\");\n  static_assert(typeid<Test>.bases().size() == 0);\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\n    Copyright (C) 2014-2015 Pedro Côrte-Real\n    Copyright (C) 2017 Roman Lebedev\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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"decompressors\/OlympusDecompressor.h\"\n#include \"common\/Common.h\"                \/\/ for uint32, ushort16, uchar8\n#include \"common\/Point.h\"                 \/\/ for iPoint2D\n#include \"common\/RawImage.h\"              \/\/ for RawImage, RawImageData\n#include \"decoders\/RawDecoderException.h\" \/\/ for ThrowRDE\n#include \"io\/BitPumpMSB.h\"                \/\/ for BitPumpMSB\n#include \"io\/ByteStream.h\"                \/\/ for ByteStream\n#include <algorithm>                      \/\/ for min\n#include <array>                          \/\/ for array, array<>::value_type\n#include <cassert>                        \/\/ for assert\n#include <cmath>                          \/\/ for abs\n#include <cstdlib>                        \/\/ for abs\n#include <memory>                         \/\/ for unique_ptr\n#include <type_traits>                    \/\/ for enable_if_t, is_integral\n\nnamespace {\n\n\/\/ Normally, we'd just use std::signbit(int) here. But, some (non-conforming?)\n\/\/ compilers do not provide that overload, so the code simply fails to compile.\n\/\/ One could cast the int to the double, but at least right now that results\n\/\/ in a horrible code. So let's just provide our own signbit(). It compiles to\n\/\/ the exact same code as the std::signbit(int).\ntemplate <typename T, typename = std::enable_if_t<std::is_integral<T>::value>>\nconstexpr __attribute__((const)) bool SignBit(T x) {\n  return x < 0;\n}\n\n} \/\/ namespace\n\nnamespace rawspeed {\n\nOlympusDecompressor::OlympusDecompressor(const RawImage& img) : mRaw(img) {\n  if (mRaw->getCpp() != 1 || mRaw->getDataType() != TYPE_USHORT16 ||\n      mRaw->getBpp() != 2)\n    ThrowRDE(\"Unexpected component count \/ data type\");\n\n  const uint32 w = mRaw->dim.x;\n  const uint32 h = mRaw->dim.y;\n\n  if (w == 0 || h == 0 || w % 2 != 0 || w > 10400 || h > 7792)\n    ThrowRDE(\"Unexpected image dimensions found: (%u; %u)\", w, h);\n}\n\n\/* This is probably the slowest decoder of them all.\n * I cannot see any way to effectively speed up the prediction\n * phase, which is by far the slowest part of this algorithm.\n * Also there is no way to multithread this code, since prediction\n * is based on the output of all previous pixel (bar the first four)\n *\/\n\nvoid OlympusDecompressor::decompress(ByteStream input) const {\n  assert(mRaw->dim.y > 0);\n  assert(mRaw->dim.x > 0);\n  assert(mRaw->dim.x % 2 == 0);\n\n  uchar8* data = mRaw->getData();\n  int pitch = mRaw->pitch;\n\n  \/* Build a table to quickly look up \"high\" value *\/\n  std::unique_ptr<char[]> bittable(new char[4096]); \/\/ NOLINT\n\n  for (int i = 0; i < 4096; i++) {\n    int b = i;\n    int high;\n    for (high = 0; high < 12; high++)\n      if ((b >> (11 - high)) & 1)\n        break;\n    bittable[i] = std::min(12, high);\n  }\n\n  input.skipBytes(7);\n  BitPumpMSB bits(input);\n\n  for (uint32 y = 0; y < static_cast<uint32>(mRaw->dim.y); y++) {\n    std::array<std::array<int, 3>, 2> acarry{{}};\n    std::array<int, 2> nw{{}};\n\n    auto* dest = reinterpret_cast<ushort16*>(&data[y * pitch]);\n    bool y_border = y < 2;\n    bool border = true;\n    for (uint32 x = 0; x < static_cast<uint32>(mRaw->dim.x); x++) {\n      int c = x & 1;\n\n      std::array<int, 3>& carry = acarry[c];\n\n      bits.fill();\n      int i = 2 * (carry[2] < 3);\n      int nbits;\n      for (nbits = 2 + i; static_cast<ushort16>(carry[0]) >> (nbits + i);\n           nbits++)\n        ;\n\n      int b = bits.peekBitsNoFill(15);\n      int sign = (b >> 14) * -1;\n      int low = (b >> 12) & 3;\n      int high = bittable[b & 4095];\n\n      \/\/ Skip bytes used above or read bits\n      if (high == 12) {\n        bits.skipBitsNoFill(15);\n        high = bits.getBits(16 - nbits) >> 1;\n      } else\n        bits.skipBitsNoFill(high + 1 + 3);\n\n      carry[0] = (high << nbits) | bits.getBits(nbits);\n      int diff = (carry[0] ^ sign) + carry[1];\n      carry[1] = (diff * 3 + carry[1]) >> 5;\n      carry[2] = carry[0] > 16 ? 0 : carry[2] + 1;\n\n      int pred;\n      if (border) {\n        if (y_border && x < 2)\n          pred = 0;\n        else {\n          if (y_border)\n            pred = dest[x - 2];\n          else {\n            pred = dest[-pitch + (static_cast<int>(x))];\n            nw[c] = pred;\n          }\n        }\n      } else {\n        \/\/ Have local variables for values used several tiles\n        \/\/ (having a \"ushort16 *dst_up\" that caches dest[-pitch+((int)x)] is\n        \/\/ actually slower, probably stack spill or aliasing)\n        int up = dest[-pitch + (static_cast<int>(x))];\n        int leftMinusNw = dest[x - 2] - nw[c];\n        int upMinusNw = up - nw[c];\n        \/\/ Check if sign is different, and they are both not zero\n        if ((SignBit(leftMinusNw) ^ SignBit(upMinusNw)) &&\n            (leftMinusNw != 0 && upMinusNw != 0)) {\n          if (std::abs(leftMinusNw) > 32 || std::abs(upMinusNw) > 32)\n            pred = dest[x - 2] + upMinusNw;\n          else\n            pred = (dest[x - 2] + up) >> 1;\n        } else\n          pred = std::abs(leftMinusNw) > std::abs(upMinusNw) ? dest[x - 2] : up;\n\n        nw[c] = up;\n      }\n\n      dest[x] = pred + ((diff * 4) | low);\n\n      if (c)\n        border = y_border;\n    }\n  }\n}\n\n} \/\/ namespace rawspeed\n<commit_msg>OlympusDecompressor: get rid of 'nw' caching.<commit_after>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\n    Copyright (C) 2014-2015 Pedro Côrte-Real\n    Copyright (C) 2017 Roman Lebedev\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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"decompressors\/OlympusDecompressor.h\"\n#include \"common\/Common.h\"                \/\/ for uint32, ushort16, uchar8\n#include \"common\/Point.h\"                 \/\/ for iPoint2D\n#include \"common\/RawImage.h\"              \/\/ for RawImage, RawImageData\n#include \"decoders\/RawDecoderException.h\" \/\/ for ThrowRDE\n#include \"io\/BitPumpMSB.h\"                \/\/ for BitPumpMSB\n#include \"io\/ByteStream.h\"                \/\/ for ByteStream\n#include <algorithm>                      \/\/ for min\n#include <array>                          \/\/ for array, array<>::value_type\n#include <cassert>                        \/\/ for assert\n#include <cmath>                          \/\/ for abs\n#include <cstdlib>                        \/\/ for abs\n#include <memory>                         \/\/ for unique_ptr\n#include <type_traits>                    \/\/ for enable_if_t, is_integral\n\nnamespace {\n\n\/\/ Normally, we'd just use std::signbit(int) here. But, some (non-conforming?)\n\/\/ compilers do not provide that overload, so the code simply fails to compile.\n\/\/ One could cast the int to the double, but at least right now that results\n\/\/ in a horrible code. So let's just provide our own signbit(). It compiles to\n\/\/ the exact same code as the std::signbit(int).\ntemplate <typename T, typename = std::enable_if_t<std::is_integral<T>::value>>\nconstexpr __attribute__((const)) bool SignBit(T x) {\n  return x < 0;\n}\n\n} \/\/ namespace\n\nnamespace rawspeed {\n\nOlympusDecompressor::OlympusDecompressor(const RawImage& img) : mRaw(img) {\n  if (mRaw->getCpp() != 1 || mRaw->getDataType() != TYPE_USHORT16 ||\n      mRaw->getBpp() != 2)\n    ThrowRDE(\"Unexpected component count \/ data type\");\n\n  const uint32 w = mRaw->dim.x;\n  const uint32 h = mRaw->dim.y;\n\n  if (w == 0 || h == 0 || w % 2 != 0 || w > 10400 || h > 7792)\n    ThrowRDE(\"Unexpected image dimensions found: (%u; %u)\", w, h);\n}\n\n\/* This is probably the slowest decoder of them all.\n * I cannot see any way to effectively speed up the prediction\n * phase, which is by far the slowest part of this algorithm.\n * Also there is no way to multithread this code, since prediction\n * is based on the output of all previous pixel (bar the first four)\n *\/\n\nvoid OlympusDecompressor::decompress(ByteStream input) const {\n  assert(mRaw->dim.y > 0);\n  assert(mRaw->dim.x > 0);\n  assert(mRaw->dim.x % 2 == 0);\n\n  uchar8* data = mRaw->getData();\n  int pitch = mRaw->pitch;\n\n  \/* Build a table to quickly look up \"high\" value *\/\n  std::unique_ptr<char[]> bittable(new char[4096]); \/\/ NOLINT\n\n  for (int i = 0; i < 4096; i++) {\n    int b = i;\n    int high;\n    for (high = 0; high < 12; high++)\n      if ((b >> (11 - high)) & 1)\n        break;\n    bittable[i] = std::min(12, high);\n  }\n\n  input.skipBytes(7);\n  BitPumpMSB bits(input);\n\n  for (uint32 y = 0; y < static_cast<uint32>(mRaw->dim.y); y++) {\n    std::array<std::array<int, 3>, 2> acarry{{}};\n\n    auto* dest = reinterpret_cast<ushort16*>(&data[y * pitch]);\n    bool y_border = y < 2;\n    bool border = true;\n    for (uint32 x = 0; x < static_cast<uint32>(mRaw->dim.x); x++) {\n      int c = x & 1;\n\n      std::array<int, 3>& carry = acarry[c];\n\n      bits.fill();\n      int i = 2 * (carry[2] < 3);\n      int nbits;\n      for (nbits = 2 + i; static_cast<ushort16>(carry[0]) >> (nbits + i);\n           nbits++)\n        ;\n\n      int b = bits.peekBitsNoFill(15);\n      int sign = (b >> 14) * -1;\n      int low = (b >> 12) & 3;\n      int high = bittable[b & 4095];\n\n      \/\/ Skip bytes used above or read bits\n      if (high == 12) {\n        bits.skipBitsNoFill(15);\n        high = bits.getBits(16 - nbits) >> 1;\n      } else\n        bits.skipBitsNoFill(high + 1 + 3);\n\n      carry[0] = (high << nbits) | bits.getBits(nbits);\n      int diff = (carry[0] ^ sign) + carry[1];\n      carry[1] = (diff * 3 + carry[1]) >> 5;\n      carry[2] = carry[0] > 16 ? 0 : carry[2] + 1;\n\n      int pred;\n      if (border) {\n        if (y_border && x < 2)\n          pred = 0;\n        else {\n          if (y_border)\n            pred = dest[x - 2];\n          else {\n            pred = dest[-pitch + (static_cast<int>(x))];\n          }\n        }\n      } else {\n        \/\/ Have local variables for values used several tiles\n        \/\/ (having a \"ushort16 *dst_up\" that caches dest[-pitch+((int)x)] is\n        \/\/ actually slower, probably stack spill or aliasing)\n        int up = dest[-pitch + (static_cast<int>(x))];\n        int leftMinusNw =\n            dest[x - 2] - dest[-pitch + (static_cast<int>(x)) - 2];\n        int upMinusNw = up - dest[-pitch + (static_cast<int>(x)) - 2];\n        \/\/ Check if sign is different, and they are both not zero\n        if ((SignBit(leftMinusNw) ^ SignBit(upMinusNw)) &&\n            (leftMinusNw != 0 && upMinusNw != 0)) {\n          if (std::abs(leftMinusNw) > 32 || std::abs(upMinusNw) > 32)\n            pred = dest[x - 2] + upMinusNw;\n          else\n            pred = (dest[x - 2] + up) >> 1;\n        } else\n          pred = std::abs(leftMinusNw) > std::abs(upMinusNw) ? dest[x - 2] : up;\n      }\n\n      dest[x] = pred + ((diff * 4) | low);\n\n      if (c)\n        border = y_border;\n    }\n  }\n}\n\n} \/\/ namespace rawspeed\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          otl.cpp\n* Purpose:       Implementation of wxExOTL class\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 2008-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/config.h>\n#include <wx\/grid.h>\n#include <wx\/stc\/stc.h>\n#include <wx\/textfile.h> \/\/ for wxTextFile::GetEOL()\n#include <wx\/extension\/otl.h>\n#include <wx\/extension\/configdlg.h>\n#include <wx\/extension\/util.h>\n\n#if wxExUSE_OTL\n\nwxExOTL::wxExOTL(const int threaded_mode)\n{\n  otl_connect::otl_initialize(threaded_mode);\n}\n\nwxExOTL::~wxExOTL()\n{\n  Logoff();\n}\n\nbool wxExOTL::Logon(\n  wxWindow* parent,\n  int max_items,\n  const wxString& title)\n{\n  wxConfigBase* config = wxConfigBase::Get(); \n\n  std::vector<wxExConfigItem> v;\n\n  v.push_back(wxExConfigItem(_(\"Datasource\"),\n    CONFIG_COMBOBOX,\n    wxEmptyString, \/\/ page\n    true,          \/\/ is_required\n    max_items));\n  v.push_back(wxExConfigItem(_(\"User\")));\n  v.push_back(wxExConfigItem(_(\"Password\"), wxEmptyString, wxTE_PASSWORD));\n\n  \/\/ Always show the dialog.\n  if (wxExConfigDialog(parent,\n    v,\n    title).ShowModal() == wxID_CANCEL)\n  {\n    return false;\n  }\n\n  try\n  {\n    const wxString connect =\n      config->Read(_(\"User\")) + \"\/\" +\n      config->Read(_(\"Password\")) + \"@\" +\n      config->Read(_(\"Datasource\"));\n\n    m_Connect.rlogon(\n      connect.c_str(),\n      1); \/\/ autocommit-flag\n\n    \/\/ We cannot use rlogon return value, that is a void.\n    return IsConnected();\n  }\n  catch (otl_exception& p)\n  {\n    wxLogError(\"Exception: '%s' while logon to database: %s\",\n      p.msg,\n      config->Read(_(\"Datasource\")).c_str());\n  }\n\n  return false;\n}\n\nlong wxExOTL::Query(const wxString& query)\n{\n  return otl_cursor::direct_exec(m_Connect, query.c_str());\n}\n\n#if wxUSE_GRID\nlong wxExOTL::Query(\n  const wxString& query,\n  wxGrid* grid,\n  bool& stopped,\n  bool empty_results,\n  int buffer_size)\n{\n  wxASSERT(grid != NULL);\n\n  otl_stream i;\n  i.set_all_column_types(otl_all_num2str | otl_all_date2str);\n  i.open(\n    buffer_size,\n    query.c_str(),\n    m_Connect,\n    otl_implicit_select);\n\n  long rows = 0;\n  otl_column_desc* desc;\n\n  \/\/ Get column names.\n  int desc_len;\n  desc = i.describe_select(desc_len);\n\n  if (empty_results)\n  {\n    if (grid->GetNumberCols() > 0)\n    {\n      grid->DeleteCols(0, grid->GetNumberCols());\n    }\n\n    grid->AppendCols(desc_len);\n\n    for (int n = 0; n < desc_len; n++)\n    {\n      grid->SetColLabelValue(n, desc[n].name);\n    }\n\n    if (grid->GetNumberRows() > 0)\n    {\n      grid->DeleteRows(0, grid->GetNumberRows());\n    }\n  }\n\n  grid->BeginBatch();\n\n  const long startrow = grid->GetNumberRows();\n\n  \/\/ Get all rows.\n  while (!i.eof() && !stopped)\n  {\n    grid->AppendRows();\n\n    for (int n = 0; n < desc_len; n++)\n    {\n      try\n      {\n        if (desc[n].otl_var_dbtype == otl_var_varchar_long)\n        {\n          otl_long_string var;\n          i >> var;\n          grid->SetCellValue(startrow + rows, n, var.v);\n        }\n        else\n        {\n          std::string s;\n          i >> s;\n          grid->SetCellValue(startrow + rows, n, s);\n        }\n      }\n      catch (otl_exception&)\n      {\n        \/\/ Ignore error.\n        grid->SetCellValue(startrow + rows, n, _(\"<Skipped>\"));\n      }\n    }\n\n    if ((rows & 0xff) == 0)\n    {\n      wxTheApp->Yield();\n    }\n\n    rows++;\n  }\n\n  grid->EndBatch();\n  grid->AutoSizeColumns();\n\n  return rows;\n}\n#endif \/\/wxUSE_GRID\n\nlong wxExOTL::Query(\n  const wxString& query,\n  wxStyledTextCtrl* stc,\n  bool& stopped,\n  int buffer_size)\n{\n  wxASSERT(stc != NULL);\n\n  otl_stream i;\n  i.set_all_column_types(otl_all_num2str | otl_all_date2str);\n  i.open(\n    buffer_size,\n    query.c_str(),\n    m_Connect,\n    otl_implicit_select);\n\n  stc->AppendText(wxTextFile::GetEOL());\n\n  long rows = 0;\n  otl_column_desc* desc;\n\n  \/\/ Get column names.\n  int desc_len;\n  desc = i.describe_select(desc_len);\n\n  for (int n = 0; n < desc_len; n++)\n  {\n    stc->AppendText(desc[n].name);\n    if (n < desc_len - 1) stc->AppendText('\\t');\n  }\n\n  stc->AppendText(wxTextFile::GetEOL());\n\n  \/\/ Get all rows.\n  while (!i.eof() && !stopped)\n  {\n    wxString line;\n\n    for (int n = 0; n < desc_len; n++)\n    {\n      try\n      {\n        if (desc[n].otl_var_dbtype == otl_var_varchar_long)\n        {\n          otl_long_string var;\n          i >> var;\n          line += var.v;\n        }\n        else\n        {\n          std::string s;\n          i >> s;\n          line += s;\n        }\n      }\n      catch (otl_exception&)\n      {\n        \/\/ Ignore error.\n        line += _(\"<Skipped>\");\n        line += wxString::Format(\" (%d, %d)\",\n          desc[n].otl_var_dbtype, desc[n].dbsize);\n      }\n\n      if (n < desc_len - 1) line += '\\t';\n    }\n\n    stc->AppendText(line + wxTextFile::GetEOL());\n\n    if ((rows & 0xff) == 0)\n    {\n      wxTheApp->Yield();\n    }\n\n    rows++;\n  }\n\n  return rows;\n}\n\nconst wxString wxExOTL::Version()\n{\n  const long version = OTL_VERSION_NUMBER;\n  return wxString::Format(\"OTL v%d.%d.%d\",\n     version >> 16,\n    (version >> 8) & 0xff,\n    (version & 0xff));\n}\n#endif \/\/ wxExUSE_OTL\n<commit_msg>added comment<commit_after>\/******************************************************************************\\\n* File:          otl.cpp\n* Purpose:       Implementation of wxExOTL class\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 2008-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/config.h>\n#include <wx\/grid.h>\n#include <wx\/stc\/stc.h>\n#include <wx\/textfile.h> \/\/ for wxTextFile::GetEOL()\n#include <wx\/extension\/otl.h>\n#include <wx\/extension\/configdlg.h>\n#include <wx\/extension\/util.h>\n\n#if wxExUSE_OTL\n\nwxExOTL::wxExOTL(const int threaded_mode)\n{\n  otl_connect::otl_initialize(threaded_mode);\n}\n\nwxExOTL::~wxExOTL()\n{\n  Logoff();\n}\n\nbool wxExOTL::Logon(\n  wxWindow* parent,\n  int max_items,\n  const wxString& title)\n{\n  wxConfigBase* config = wxConfigBase::Get(); \n\n  std::vector<wxExConfigItem> v;\n\n  v.push_back(wxExConfigItem(_(\"Datasource\"),\n    CONFIG_COMBOBOX,\n    wxEmptyString, \/\/ page\n    true,          \/\/ is_required\n    max_items));\n  v.push_back(wxExConfigItem(_(\"User\")));\n  v.push_back(wxExConfigItem(_(\"Password\"), wxEmptyString, wxTE_PASSWORD));\n\n  \/\/ Always show the dialog.\n  if (wxExConfigDialog(parent,\n    v,\n    title).ShowModal() == wxID_CANCEL)\n  {\n    return false;\n  }\n\n  try\n  {\n    const wxString connect =\n      config->Read(_(\"User\")) + \"\/\" +\n      config->Read(_(\"Password\")) + \"@\" +\n      config->Read(_(\"Datasource\"));\n\n    m_Connect.rlogon(\n      connect.c_str(),\n      1); \/\/ autocommit-flag\n\n    \/\/ We cannot use rlogon return value, that is a void.\n    return IsConnected();\n  }\n  catch (otl_exception& p)\n  {\n    wxLogError(\"Exception: '%s' while logon to database: %s\",\n      p.msg,\n      config->Read(_(\"Datasource\")).c_str());\n  }\n\n  return false;\n}\n\nlong wxExOTL::Query(const wxString& query)\n{\n  return otl_cursor::direct_exec(m_Connect, query.c_str());\n}\n\n#if wxUSE_GRID\n\/\/ Cannot be const because of open call.\nlong wxExOTL::Query(\n  const wxString& query,\n  wxGrid* grid,\n  bool& stopped,\n  bool empty_results,\n  int buffer_size)\n{\n  wxASSERT(grid != NULL);\n\n  otl_stream i;\n  i.set_all_column_types(otl_all_num2str | otl_all_date2str);\n  i.open(\n    buffer_size,\n    query.c_str(),\n    m_Connect,\n    otl_implicit_select);\n\n  long rows = 0;\n  otl_column_desc* desc;\n\n  \/\/ Get column names.\n  int desc_len;\n  desc = i.describe_select(desc_len);\n\n  if (empty_results)\n  {\n    if (grid->GetNumberCols() > 0)\n    {\n      grid->DeleteCols(0, grid->GetNumberCols());\n    }\n\n    grid->AppendCols(desc_len);\n\n    for (int n = 0; n < desc_len; n++)\n    {\n      grid->SetColLabelValue(n, desc[n].name);\n    }\n\n    if (grid->GetNumberRows() > 0)\n    {\n      grid->DeleteRows(0, grid->GetNumberRows());\n    }\n  }\n\n  grid->BeginBatch();\n\n  const long startrow = grid->GetNumberRows();\n\n  \/\/ Get all rows.\n  while (!i.eof() && !stopped)\n  {\n    grid->AppendRows();\n\n    for (int n = 0; n < desc_len; n++)\n    {\n      try\n      {\n        if (desc[n].otl_var_dbtype == otl_var_varchar_long)\n        {\n          otl_long_string var;\n          i >> var;\n          grid->SetCellValue(startrow + rows, n, var.v);\n        }\n        else\n        {\n          std::string s;\n          i >> s;\n          grid->SetCellValue(startrow + rows, n, s);\n        }\n      }\n      catch (otl_exception&)\n      {\n        \/\/ Ignore error.\n        grid->SetCellValue(startrow + rows, n, _(\"<Skipped>\"));\n      }\n    }\n\n    if ((rows & 0xff) == 0)\n    {\n      wxTheApp->Yield();\n    }\n\n    rows++;\n  }\n\n  grid->EndBatch();\n  grid->AutoSizeColumns();\n\n  return rows;\n}\n#endif \/\/wxUSE_GRID\n\n\/\/ Cannot be const because of open call.\nlong wxExOTL::Query(\n  const wxString& query,\n  wxStyledTextCtrl* stc,\n  bool& stopped,\n  int buffer_size)\n{\n  wxASSERT(stc != NULL);\n\n  otl_stream i;\n  i.set_all_column_types(otl_all_num2str | otl_all_date2str);\n  i.open(\n    buffer_size,\n    query.c_str(),\n    m_Connect,\n    otl_implicit_select);\n\n  stc->AppendText(wxTextFile::GetEOL());\n\n  long rows = 0;\n  otl_column_desc* desc;\n\n  \/\/ Get column names.\n  int desc_len;\n  desc = i.describe_select(desc_len);\n\n  for (int n = 0; n < desc_len; n++)\n  {\n    stc->AppendText(desc[n].name);\n    if (n < desc_len - 1) stc->AppendText('\\t');\n  }\n\n  stc->AppendText(wxTextFile::GetEOL());\n\n  \/\/ Get all rows.\n  while (!i.eof() && !stopped)\n  {\n    wxString line;\n\n    for (int n = 0; n < desc_len; n++)\n    {\n      try\n      {\n        if (desc[n].otl_var_dbtype == otl_var_varchar_long)\n        {\n          otl_long_string var;\n          i >> var;\n          line += var.v;\n        }\n        else\n        {\n          std::string s;\n          i >> s;\n          line += s;\n        }\n      }\n      catch (otl_exception&)\n      {\n        \/\/ Ignore error.\n        line += _(\"<Skipped>\");\n        line += wxString::Format(\" (%d, %d)\",\n          desc[n].otl_var_dbtype, desc[n].dbsize);\n      }\n\n      if (n < desc_len - 1) line += '\\t';\n    }\n\n    stc->AppendText(line + wxTextFile::GetEOL());\n\n    if ((rows & 0xff) == 0)\n    {\n      wxTheApp->Yield();\n    }\n\n    rows++;\n  }\n\n  return rows;\n}\n\nconst wxString wxExOTL::Version()\n{\n  const long version = OTL_VERSION_NUMBER;\n\n  return wxString::Format(\"OTL v%d.%d.%d\",\n     version >> 16,\n    (version >> 8) & 0xff,\n    (version & 0xff));\n}\n#endif \/\/ wxExUSE_OTL\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2013-2020 Winlin\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#ifndef SRS_CORE_HPP\n#define SRS_CORE_HPP\n\n\/\/ The version config.\n#define VERSION_MAJOR       3\n#define VERSION_MINOR       0\n#define SRS3_VERSION_REVISION    111\n#define VERSION_REVISION SRS3_VERSION_REVISION\n\n\/\/ The macros generated by configure script.\n#include <srs_auto_headers.hpp>\n\n\/\/ To convert macro values to string.\n\/\/ @see https:\/\/gcc.gnu.org\/onlinedocs\/cpp\/Stringification.html#Stringification\n#define SRS_INTERNAL_STR(v) #v\n#define SRS_XSTR(v) SRS_INTERNAL_STR(v)\n\n\/\/ The project informations, may sent to client in HTTP header or RTMP metadata.\n#define RTMP_SIG_SRS_KEY \"SRS\"\n#define RTMP_SIG_SRS_CODE \"OuXuli\"\n#define RTMP_SIG_SRS_URL \"https:\/\/github.com\/ossrs\/srs\"\n#define RTMP_SIG_SRS_LICENSE \"The MIT License (MIT)\"\n#define RTMP_SIG_SRS_VERSION SRS_XSTR(VERSION_MAJOR) \".\" SRS_XSTR(VERSION_MINOR) \".\" SRS_XSTR(VERSION_REVISION)\n#define RTMP_SIG_SRS_SERVER RTMP_SIG_SRS_KEY \"\/\" RTMP_SIG_SRS_VERSION \"(\" RTMP_SIG_SRS_CODE \")\"\n\n\/\/ The current stable release.\n#define VERSION_STABLE 2\n#define VERSION_STABLE_BRANCH SRS_XSTR(VERSION_STABLE)\".0release\"\n\n\/\/ For 32bit os, 2G big file limit for unistd io,\n\/\/ ie. read\/write\/lseek to use 64bits size for huge file.\n#ifndef _FILE_OFFSET_BITS\n    #define _FILE_OFFSET_BITS 64\n#endif\n\n\/\/ For int64_t print using PRId64 format.\n#ifndef __STDC_FORMAT_MACROS\n    #define __STDC_FORMAT_MACROS\n#endif\n\n\/\/ For srs-librtmp, @see https:\/\/github.com\/ossrs\/srs\/issues\/213\n#ifndef _WIN32\n#include <inttypes.h>\n#endif\n\n#include <assert.h>\n#define srs_assert(expression) assert(expression)\n\n#include <stddef.h>\n#include <sys\/types.h>\n\n\/\/ The time unit for timeout, interval or duration.\n#include <srs_core_time.hpp>\n\n\/\/ Some important performance options.\n#include <srs_core_performance.hpp>\n\n\/\/ To free the p and set to NULL.\n\/\/ @remark The p must be a pointer T*.\n#define srs_freep(p) \\\n    if (p) { \\\n        delete p; \\\n        p = NULL; \\\n    } \\\n    (void)0\n\/\/ Please use the freepa(T[]) to free an array, otherwise the behavior is undefined.\n#define srs_freepa(pa) \\\n    if (pa) { \\\n        delete[] pa; \\\n        pa = NULL; \\\n    } \\\n    (void)0\n\n\/\/ For librtmp, it is pure c++ and supports all OS.\n#ifndef SRS_EXPORT_LIBRTMP\n    \/\/ Checking for st(state-threads), only support the following cpus: i386\/amd64\/x86_64\/arm\n    \/\/ @reamrk To patch ST for arm, read https:\/\/github.com\/ossrs\/state-threads\/issues\/1\n    #if !defined(__amd64__) && !defined(__x86_64__) && !defined(__i386__) && !defined(__arm__) && !defined(__aarch64__)\n        #error \"only support i386\/amd64\/x86_64\/arm cpu\"\n    #endif\n#endif\n\n\/\/ Error predefined for all modules.\nclass SrsCplxError;\ntypedef SrsCplxError* srs_error_t;\n\n#endif\n<commit_msg>Update version<commit_after>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2013-2020 Winlin\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#ifndef SRS_CORE_HPP\n#define SRS_CORE_HPP\n\n\/\/ The version config.\n#define VERSION_MAJOR       3\n#define VERSION_MINOR       0\n\/\/ Version for SRS3.\n#define SRS3_VERSION_REVISION    111\n\/\/ Version we used.\n#define VERSION_REVISION SRS3_VERSION_REVISION\n\n\/\/ The macros generated by configure script.\n#include <srs_auto_headers.hpp>\n\n\/\/ To convert macro values to string.\n\/\/ @see https:\/\/gcc.gnu.org\/onlinedocs\/cpp\/Stringification.html#Stringification\n#define SRS_INTERNAL_STR(v) #v\n#define SRS_XSTR(v) SRS_INTERNAL_STR(v)\n\n\/\/ The project informations, may sent to client in HTTP header or RTMP metadata.\n#define RTMP_SIG_SRS_KEY \"SRS\"\n#define RTMP_SIG_SRS_CODE \"OuXuli\"\n#define RTMP_SIG_SRS_URL \"https:\/\/github.com\/ossrs\/srs\"\n#define RTMP_SIG_SRS_LICENSE \"The MIT License (MIT)\"\n#define RTMP_SIG_SRS_VERSION SRS_XSTR(VERSION_MAJOR) \".\" SRS_XSTR(VERSION_MINOR) \".\" SRS_XSTR(VERSION_REVISION)\n#define RTMP_SIG_SRS_SERVER RTMP_SIG_SRS_KEY \"\/\" RTMP_SIG_SRS_VERSION \"(\" RTMP_SIG_SRS_CODE \")\"\n\n\/\/ The current stable release.\n#define VERSION_STABLE 2\n#define VERSION_STABLE_BRANCH SRS_XSTR(VERSION_STABLE)\".0release\"\n\n\/\/ For 32bit os, 2G big file limit for unistd io,\n\/\/ ie. read\/write\/lseek to use 64bits size for huge file.\n#ifndef _FILE_OFFSET_BITS\n    #define _FILE_OFFSET_BITS 64\n#endif\n\n\/\/ For int64_t print using PRId64 format.\n#ifndef __STDC_FORMAT_MACROS\n    #define __STDC_FORMAT_MACROS\n#endif\n\n\/\/ For srs-librtmp, @see https:\/\/github.com\/ossrs\/srs\/issues\/213\n#ifndef _WIN32\n#include <inttypes.h>\n#endif\n\n#include <assert.h>\n#define srs_assert(expression) assert(expression)\n\n#include <stddef.h>\n#include <sys\/types.h>\n\n\/\/ The time unit for timeout, interval or duration.\n#include <srs_core_time.hpp>\n\n\/\/ Some important performance options.\n#include <srs_core_performance.hpp>\n\n\/\/ To free the p and set to NULL.\n\/\/ @remark The p must be a pointer T*.\n#define srs_freep(p) \\\n    if (p) { \\\n        delete p; \\\n        p = NULL; \\\n    } \\\n    (void)0\n\/\/ Please use the freepa(T[]) to free an array, otherwise the behavior is undefined.\n#define srs_freepa(pa) \\\n    if (pa) { \\\n        delete[] pa; \\\n        pa = NULL; \\\n    } \\\n    (void)0\n\n\/\/ For librtmp, it is pure c++ and supports all OS.\n#ifndef SRS_EXPORT_LIBRTMP\n    \/\/ Checking for st(state-threads), only support the following cpus: i386\/amd64\/x86_64\/arm\n    \/\/ @reamrk To patch ST for arm, read https:\/\/github.com\/ossrs\/state-threads\/issues\/1\n    #if !defined(__amd64__) && !defined(__x86_64__) && !defined(__i386__) && !defined(__arm__) && !defined(__aarch64__)\n        #error \"only support i386\/amd64\/x86_64\/arm cpu\"\n    #endif\n#endif\n\n\/\/ Error predefined for all modules.\nclass SrsCplxError;\ntypedef SrsCplxError* srs_error_t;\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <functional>\n#include <future>\n#include <memory>\n#include <functional>\n#include \"geos\/geom\/Geometry.h\"\n#include \"geos\/util\/GEOSException.h\"\n#include \"kernel.h\"\n#include \"coverage.h\"\n#include \"columndefinition.h\"\n#include \"table.h\"\n#include \"attributerecord.h\"\n#include \"feature.h\"\n#include \"featurecoverage.h\"\n#include \"symboltable.h\"\n#include \"OperationExpression.h\"\n#include \"operationmetadata.h\"\n#include \"operation.h\"\n#include \"operationhelper.h\"\n#include \"operationhelperfeatures.h\"\n#include \"geometryhelper.h\"\n#include \"commandhandler.h\"\n#include \"featureiterator.h\"\n#include \"spatialrelation.h\"\n\nusing namespace Ilwis;\nusing namespace BaseOperations;\n\nSpatialRelationOperation::SpatialRelationOperation()\n{\n}\n\nSpatialRelationOperation::SpatialRelationOperation(quint64 metaid, const Ilwis::OperationExpression &expr) : OperationImplementation(metaid, expr)\n{\n\n}\n\nquint64 SpatialRelationOperation::createMetadata(OperationResource& operation)\n{\n    operation.setInParameterCount({2});\n\n    operation.addInParameter(0,itCOVERAGE, TR(\"coverage\"),TR(\"coverage on which the spatial relation is applicable\"));\n    operation.addInParameter(1,itSTRING, TR(\"Geometry\"), TR(\"the geometry for which the spatial relation holds true\"));\n\n    operation.setOutParameterCount({1});\n    operation.addOutParameter(0,itCOLLECTION | itINTEGER, TR(\"result index collection\"));\n    operation.setKeywords(\"geometry, coordinate, coverage, spatial relation\");\n\n    mastercatalog()->addItems({operation});\n    return operation.id();\n\n}\n\nbool SpatialRelationOperation::execute(ExecutionContext *ctx, SymbolTable &symTable)\n{\n    if (_prepState == sNOTPREPARED)\n        if((_prepState = prepare(ctx, symTable)) != sPREPARED)\n            return false;\n\n    IFeatureCoverage features = _coverage.as<FeatureCoverage>();\n\n    std::set<quint32> resultset;\n    int index = 0;\n    geos::geom::Geometry *geomRelation = _geometry.get();\n    try{\n    if ( geomRelation != 0) {\n        for(auto& iter : features){\n            int geomcount = iter->trackSize();\n            for(int gindex = 0; gindex < geomcount; ++gindex){\n                for(int gi = 0; gi < geomRelation->getNumGeometries(); ++gi){\n                    const geos::geom::Geometry *geomCoverage = iter->geometry(gindex).get();\n                    if ( geomCoverage!= 0 &&_relation(geomCoverage,geomRelation->getGeometryN(gi) )){\n                        resultset.insert(index);\n                    }\n                }\n            }\n            ++index;\n        }\n    }\n    } catch(geos::util::GEOSException& exc){\n        ERROR0(QString(exc.what()));\n        return false;\n    }\n\n    std::vector<quint32> result(resultset.begin(), resultset.end());\n    if ( ctx != 0) {\n        QVariant value;\n        value.setValue<std::vector<quint32>>(result);\n        ctx->setOutput(symTable, value, sUNDEF, itINTEGER | itCOLLECTION, Resource());\n    }\n\n    return true;\n}\n\n\nOperationImplementation::State SpatialRelationOperation::prepare(ExecutionContext *ctx, const SymbolTable &)\n{\n    QString fc = _expression.parm(0).value();\n\n    if (!_coverage.prepare(fc)) {\n        ERROR2(ERR_COULD_NOT_LOAD_2,fc,\"\");\n        return sPREPAREFAILED;\n    }\n\n    QString quotedGeom = _expression.parm(1).value();\n    QString geom = quotedGeom.remove('\\\"');\n    _geometry.reset(GeometryHelper::fromWKT(geom));\n    if ( !_geometry){\n        ERROR2(ERR_NO_INITIALIZED_2, TR(\"Geometry\"), TR(\"Contains operation\"));\n        return sPREPAREFAILED;\n    }\n\n    return sPREPARED;\n\n}\n\n\/\/---------------------------------------------------------------------------------\nREGISTER_OPERATION(Contains)\n\nContains::Contains(){}\n\nContains::Contains(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Contains::create(quint64 metaid, const Ilwis::OperationExpression &expr){\n    return new Contains(metaid, expr);\n}\n\nbool Contains::contains(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomCoverage->contains(geomRelation);\n}\n\nOperationImplementation::State Contains::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Contains::contains;\n    return sPREPARED;\n}\n\nquint64 Contains::createMetadata(){\n    OperationResource operation({\"ilwis:\/\/operations\/contains\"});\n    operation.setSyntax(\"contains(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the contains constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/----------------------------------------------------------------------------------\nREGISTER_OPERATION(Covers)\n\nCovers::Covers(){}\n\nCovers::Covers(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Covers::create(quint64 metaid, const Ilwis::OperationExpression &expr){\n    return new Covers(metaid, expr);\n}\n\nbool Covers::covers(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomCoverage->covers(geomRelation);\n}\n\nOperationImplementation::State Covers::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Covers::covers;\n    return sPREPARED;\n}\n\nquint64 Covers::createMetadata(){\n    OperationResource operation({\"ilwis:\/\/operations\/covers\"});\n    operation.setSyntax(\"covers(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the covers constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/-----------------------------------------------------------------------------------\nREGISTER_OPERATION(CoveredBy)\n\nCoveredBy::CoveredBy(){}\n\nCoveredBy::CoveredBy(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *CoveredBy::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new CoveredBy(metaid, expr);\n}\n\nbool CoveredBy::coveredBy(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->coveredBy(geomCoverage);\n}\n\nOperationImplementation::State CoveredBy::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = CoveredBy::coveredBy;\n    return sPREPARED;\n}\n\nquint64 CoveredBy::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/coveredby\"});\n    operation.setSyntax(\"coveredby(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the CoveredBy constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/-----------------------------------------------------------------------------------\nREGISTER_OPERATION(Touches)\n\nTouches::Touches(){}\n\nTouches::Touches(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Touches::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Touches(metaid, expr);\n}\n\nbool Touches::touches(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->touches(geomCoverage);\n}\n\nOperationImplementation::State Touches::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Touches::touches;\n    return sPREPARED;\n}\n\nquint64 Touches::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/touches\"});\n    operation.setSyntax(\"touches(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the Touches constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/-----------------------------------------------------------------------------------\nREGISTER_OPERATION(Intersects)\n\nIntersects::Intersects(){}\n\nIntersects::Intersects(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Intersects::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Intersects(metaid, expr);\n}\n\nbool Intersects::intersects(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->intersects(geomCoverage);\n}\n\nOperationImplementation::State Intersects::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Intersects::intersects;\n    return sPREPARED;\n}\n\nquint64 Intersects::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/intersects\"});\n    operation.setSyntax(\"intersects(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the intersects constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/--------------------------------------------------------------------------------\nREGISTER_OPERATION(Disjoint)\n\nDisjoint::Disjoint(){}\n\nDisjoint::Disjoint(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Disjoint::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Disjoint(metaid, expr);\n}\n\nbool Disjoint::disjoint(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->disjoint(geomCoverage);\n}\n\nOperationImplementation::State Disjoint::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Disjoint::disjoint;\n    return sPREPARED;\n}\n\nquint64 Disjoint::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/disjoint\"});\n    operation.setSyntax(\"disjoint(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the disjoint constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\n\/\/--------------------------------------------------------------------------------\nREGISTER_OPERATION(Within)\n\nWithin::Within(){}\n\nWithin::Within(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Within::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Within(metaid, expr);\n}\n\nbool Within::within(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->within(geomCoverage);\n}\n\nOperationImplementation::State Within::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Within::within;\n    return sPREPARED;\n}\n\nquint64 Within::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/within\"});\n    operation.setSyntax(\"within(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the within constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\n\/\/--------------------------------------------------------------------------------\nREGISTER_OPERATION(Equals)\n\nEquals::Equals(){}\n\nEquals::Equals(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Equals::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Equals(metaid, expr);\n}\n\nbool Equals::equals(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->equals(geomCoverage);\n}\n\nOperationImplementation::State Equals::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Equals::equals;\n    return sPREPARED;\n}\n\nquint64 Equals::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/equals\"});\n    operation.setSyntax(\"equals(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the equals constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/--------------------------------------------------------------------------------\nREGISTER_OPERATION(Crosses)\n\nCrosses::Crosses(){}\n\nCrosses::Crosses(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Crosses::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Crosses(metaid, expr);\n}\n\nbool Crosses::crosses(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->crosses(geomCoverage);\n}\n\nOperationImplementation::State Crosses::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Crosses::crosses;\n    return sPREPARED;\n}\n\nquint64 Crosses::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/crosses\"});\n    operation.setSyntax(\"crosses(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the Crosses constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/-----------------------------------------------------------------------------------\nREGISTER_OPERATION(Overlaps)\n\nOverlaps::Overlaps(){}\n\nOverlaps::Overlaps(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Overlaps::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Overlaps(metaid, expr);\n}\n\nbool Overlaps::overlaps(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->overlaps(geomCoverage);\n}\n\nOperationImplementation::State Overlaps::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Overlaps::overlaps;\n    return sPREPARED;\n}\n\nquint64 Overlaps::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/overlaps\"});\n    operation.setSyntax(\"overlaps(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the Overlaps constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n<commit_msg>order of geometries for covers was just the other way around<commit_after>#include <functional>\n#include <future>\n#include <memory>\n#include <functional>\n#include \"geos\/geom\/Geometry.h\"\n#include \"geos\/util\/GEOSException.h\"\n#include \"kernel.h\"\n#include \"coverage.h\"\n#include \"columndefinition.h\"\n#include \"table.h\"\n#include \"attributerecord.h\"\n#include \"feature.h\"\n#include \"featurecoverage.h\"\n#include \"symboltable.h\"\n#include \"OperationExpression.h\"\n#include \"operationmetadata.h\"\n#include \"operation.h\"\n#include \"operationhelper.h\"\n#include \"operationhelperfeatures.h\"\n#include \"geometryhelper.h\"\n#include \"commandhandler.h\"\n#include \"featureiterator.h\"\n#include \"spatialrelation.h\"\n\nusing namespace Ilwis;\nusing namespace BaseOperations;\n\nSpatialRelationOperation::SpatialRelationOperation()\n{\n}\n\nSpatialRelationOperation::SpatialRelationOperation(quint64 metaid, const Ilwis::OperationExpression &expr) : OperationImplementation(metaid, expr)\n{\n\n}\n\nquint64 SpatialRelationOperation::createMetadata(OperationResource& operation)\n{\n    operation.setInParameterCount({2});\n\n    operation.addInParameter(0,itCOVERAGE, TR(\"coverage\"),TR(\"coverage on which the spatial relation is applicable\"));\n    operation.addInParameter(1,itSTRING, TR(\"Geometry\"), TR(\"the geometry for which the spatial relation holds true\"));\n\n    operation.setOutParameterCount({1});\n    operation.addOutParameter(0,itCOLLECTION | itINTEGER, TR(\"result index collection\"));\n    operation.setKeywords(\"geometry, coordinate, coverage, spatial relation\");\n\n    mastercatalog()->addItems({operation});\n    return operation.id();\n\n}\n\nbool SpatialRelationOperation::execute(ExecutionContext *ctx, SymbolTable &symTable)\n{\n    if (_prepState == sNOTPREPARED)\n        if((_prepState = prepare(ctx, symTable)) != sPREPARED)\n            return false;\n\n    IFeatureCoverage features = _coverage.as<FeatureCoverage>();\n\n    std::set<quint32> resultset;\n    int index = 0;\n    geos::geom::Geometry *geomRelation = _geometry.get();\n    try{\n    if ( geomRelation != 0) {\n        for(auto& iter : features){\n            int geomcount = iter->trackSize();\n            for(int gindex = 0; gindex < geomcount; ++gindex){\n                for(int gi = 0; gi < geomRelation->getNumGeometries(); ++gi){\n                    const geos::geom::Geometry *geomCoverage = iter->geometry(gindex).get();\n                    if ( geomCoverage!= 0 &&_relation(geomCoverage,geomRelation->getGeometryN(gi) )){\n                        resultset.insert(index);\n                    }\n                }\n            }\n            ++index;\n        }\n    }\n    } catch(geos::util::GEOSException& exc){\n        ERROR0(QString(exc.what()));\n        return false;\n    }\n\n    std::vector<quint32> result(resultset.begin(), resultset.end());\n    if ( ctx != 0) {\n        QVariant value;\n        value.setValue<std::vector<quint32>>(result);\n        ctx->setOutput(symTable, value, sUNDEF, itINTEGER | itCOLLECTION, Resource());\n    }\n\n    return true;\n}\n\n\nOperationImplementation::State SpatialRelationOperation::prepare(ExecutionContext *ctx, const SymbolTable &)\n{\n    QString fc = _expression.parm(0).value();\n\n    if (!_coverage.prepare(fc)) {\n        ERROR2(ERR_COULD_NOT_LOAD_2,fc,\"\");\n        return sPREPAREFAILED;\n    }\n\n    QString quotedGeom = _expression.parm(1).value();\n    QString geom = quotedGeom.remove('\\\"');\n    _geometry.reset(GeometryHelper::fromWKT(geom));\n    if ( !_geometry){\n        ERROR2(ERR_NO_INITIALIZED_2, TR(\"Geometry\"), TR(\"Contains operation\"));\n        return sPREPAREFAILED;\n    }\n\n    return sPREPARED;\n\n}\n\n\/\/---------------------------------------------------------------------------------\nREGISTER_OPERATION(Contains)\n\nContains::Contains(){}\n\nContains::Contains(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Contains::create(quint64 metaid, const Ilwis::OperationExpression &expr){\n    return new Contains(metaid, expr);\n}\n\nbool Contains::contains(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomCoverage->contains(geomRelation);\n}\n\nOperationImplementation::State Contains::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Contains::contains;\n    return sPREPARED;\n}\n\nquint64 Contains::createMetadata(){\n    OperationResource operation({\"ilwis:\/\/operations\/contains\"});\n    operation.setSyntax(\"contains(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the contains constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/----------------------------------------------------------------------------------\nREGISTER_OPERATION(Covers)\n\nCovers::Covers(){}\n\nCovers::Covers(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Covers::create(quint64 metaid, const Ilwis::OperationExpression &expr){\n    return new Covers(metaid, expr);\n}\n\nbool Covers::covers(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return  geomRelation->covers(geomCoverage);\n}\n\nOperationImplementation::State Covers::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Covers::covers;\n    return sPREPARED;\n}\n\nquint64 Covers::createMetadata(){\n    OperationResource operation({\"ilwis:\/\/operations\/covers\"});\n    operation.setSyntax(\"covers(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the covers constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/-----------------------------------------------------------------------------------\nREGISTER_OPERATION(CoveredBy)\n\nCoveredBy::CoveredBy(){}\n\nCoveredBy::CoveredBy(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *CoveredBy::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new CoveredBy(metaid, expr);\n}\n\nbool CoveredBy::coveredBy(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->coveredBy(geomCoverage);\n}\n\nOperationImplementation::State CoveredBy::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = CoveredBy::coveredBy;\n    return sPREPARED;\n}\n\nquint64 CoveredBy::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/coveredby\"});\n    operation.setSyntax(\"coveredby(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the CoveredBy constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/-----------------------------------------------------------------------------------\nREGISTER_OPERATION(Touches)\n\nTouches::Touches(){}\n\nTouches::Touches(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Touches::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Touches(metaid, expr);\n}\n\nbool Touches::touches(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->touches(geomCoverage);\n}\n\nOperationImplementation::State Touches::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Touches::touches;\n    return sPREPARED;\n}\n\nquint64 Touches::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/touches\"});\n    operation.setSyntax(\"touches(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the Touches constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/-----------------------------------------------------------------------------------\nREGISTER_OPERATION(Intersects)\n\nIntersects::Intersects(){}\n\nIntersects::Intersects(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Intersects::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Intersects(metaid, expr);\n}\n\nbool Intersects::intersects(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->intersects(geomCoverage);\n}\n\nOperationImplementation::State Intersects::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Intersects::intersects;\n    return sPREPARED;\n}\n\nquint64 Intersects::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/intersects\"});\n    operation.setSyntax(\"intersects(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the intersects constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/--------------------------------------------------------------------------------\nREGISTER_OPERATION(Disjoint)\n\nDisjoint::Disjoint(){}\n\nDisjoint::Disjoint(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Disjoint::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Disjoint(metaid, expr);\n}\n\nbool Disjoint::disjoint(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->disjoint(geomCoverage);\n}\n\nOperationImplementation::State Disjoint::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Disjoint::disjoint;\n    return sPREPARED;\n}\n\nquint64 Disjoint::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/disjoint\"});\n    operation.setSyntax(\"disjoint(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the disjoint constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\n\/\/--------------------------------------------------------------------------------\nREGISTER_OPERATION(Within)\n\nWithin::Within(){}\n\nWithin::Within(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Within::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Within(metaid, expr);\n}\n\nbool Within::within(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->within(geomCoverage);\n}\n\nOperationImplementation::State Within::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Within::within;\n    return sPREPARED;\n}\n\nquint64 Within::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/within\"});\n    operation.setSyntax(\"within(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the within constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\n\/\/--------------------------------------------------------------------------------\nREGISTER_OPERATION(Equals)\n\nEquals::Equals(){}\n\nEquals::Equals(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Equals::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Equals(metaid, expr);\n}\n\nbool Equals::equals(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->equals(geomCoverage);\n}\n\nOperationImplementation::State Equals::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Equals::equals;\n    return sPREPARED;\n}\n\nquint64 Equals::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/equals\"});\n    operation.setSyntax(\"equals(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the equals constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/--------------------------------------------------------------------------------\nREGISTER_OPERATION(Crosses)\n\nCrosses::Crosses(){}\n\nCrosses::Crosses(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Crosses::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Crosses(metaid, expr);\n}\n\nbool Crosses::crosses(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->crosses(geomCoverage);\n}\n\nOperationImplementation::State Crosses::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Crosses::crosses;\n    return sPREPARED;\n}\n\nquint64 Crosses::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/crosses\"});\n    operation.setSyntax(\"crosses(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the Crosses constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n\/\/-----------------------------------------------------------------------------------\nREGISTER_OPERATION(Overlaps)\n\nOverlaps::Overlaps(){}\n\nOverlaps::Overlaps(quint64 metaid, const Ilwis::OperationExpression &expr) : SpatialRelationOperation(metaid, expr){}\n\nIlwis::OperationImplementation *Overlaps::create(quint64 metaid, const Ilwis::OperationExpression &expr)\n{\n    return new Overlaps(metaid, expr);\n}\n\nbool Overlaps::overlaps(const geos::geom::Geometry *geomCoverage, const geos::geom::Geometry *geomRelation) {\n    return geomRelation->overlaps(geomCoverage);\n}\n\nOperationImplementation::State Overlaps::prepare(ExecutionContext *ctx, const SymbolTable &sym){\n    if (!SpatialRelationOperation::prepare(ctx, sym) == sPREPARED)\n        return sPREPAREFAILED;\n    _relation = Overlaps::overlaps;\n    return sPREPARED;\n}\n\nquint64 Overlaps::createMetadata()\n{\n    OperationResource operation({\"ilwis:\/\/operations\/overlaps\"});\n    operation.setSyntax(\"overlaps(coverage,wkt-defintion)\");\n    operation.setDescription(TR(\"returns a feature-index of all features that satisfy the Overlaps constraint\"));\n\n    return SpatialRelationOperation::createMetadata(operation);\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"Constants.hpp\"\n#include \"Geometry2d\/Point.hpp\"\n#include \"time.hpp\"\n\n#include <cmath>\n#include <deque>\n#include <QString>\n#include <stdexcept>\n#include <stdint.h>\n#include <sys\/time.h>\n#include <typeinfo>\n#include <vector>\n#include <QtWidgets>\n\nconst static bool THROW_DEBUG_EXCEPTIONS = true;\n\ntemplate <class exception>\nstatic inline void debugThrow(const exception &e) {\n\tif (THROW_DEBUG_EXCEPTIONS) {\n\t\tthrow e;\n\t}\n}\n\nstatic inline void debugThrow(const std::string &string) {\n\tdebugThrow(std::runtime_error(string));\n}\n\n\/**\n * @brief Restricts the given angle to be between pi and -pi\n * \n * @param a An angle in radians\n * @return An equivalent angle in radians restricted to [-pi, pi]\n *\/\nstatic inline float fixAngleRadians(float a)\n{\n\ta = remainder(a, 2*M_PI);\n\twhile (a < -M_PI) a += 2.0*M_PI;\n\twhile (a > M_PI) a -= 2.0*M_PI;\n\treturn a;\n}\n\n\/** Checks whether or not the given ball is in the defense area. *\/\nstatic inline bool ballIsInGoalieBox(Geometry2d::Point point) {\n\tif (std::abs(point.x) < Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f) \/\/ Ball is in center (rectangular) portion of defensive bubble\n\t{\n\t\treturn point.y > 0 && point.y < Field_Dimensions::Current_Dimensions.ArcRadius();\n\t} else if (std::abs(point.x) < (Field_Dimensions::Current_Dimensions.ArcRadius() + Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f)) \/\/ Ball is in one of the side (arc) portions of defensive bubble\n\t{\n\t\tdouble adjusted_x = std::abs(point.x) - (Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f);\n\t\tdouble max_y = sqrt( (Field_Dimensions::Current_Dimensions.ArcRadius() * Field_Dimensions::Current_Dimensions.ArcRadius()) - (adjusted_x * adjusted_x));\n\t\treturn point.y > 0 && point.y <= max_y;\n\t}\n\treturn false;\n}\n\n\nstatic Geometry2d::Point fromOursToTheirs(Geometry2d::Point &pt) {\n\tGeometry2d::Point c;\n\tc.y = Field_Dimensions::Current_Dimensions.Length() - pt.y;\n\tc.x = -pt.x;\n\n\treturn c;\n}\n\nstatic bool ballIsInTheirGoalieBox(Geometry2d::Point &pt) {\n\tGeometry2d::Point converted = fromOursToTheirs(pt);\n\treturn ballIsInGoalieBox(converted);\n}\n\n\n\/** Returns @value if it is in bounds, otherwise returns the bound it is closest to *\/\ntemplate<class T>\nfloat clamp(T value, T min, T max)\n{\n\tif (value > max)\n\t{\n\t\treturn max;\n\t}\n\telse if (value < min)\n\t{\n\t\treturn min;\n\t}\n\treturn value;\n}\n\n\/\/ Removes all entries in a std::map which associate to the given value.\ntemplate<class Map_Type, class Data_Type>\nvoid map_remove(Map_Type &map, Data_Type &value)\n{\n\ttypename Map_Type::iterator i = map.begin();\n\twhile (i != map.end())\n\t{\n\t\ttypename Map_Type::iterator next = i;\n\t\t++next;\n\n\t\tif (i->second == value)\n\t\t{\n\t\t\tmap.erase(i);\n\t\t}\n\n\t\ti = next;\n\t}\n}\n\n\/\/ If <key> exists in <map>, returns map[key].\n\/\/ If not, returns 0.\ntemplate<typename Map>\ntypename Map::mapped_type map_lookup(const Map &map, typename Map::key_type key)\n{\n\ttypename Map::const_iterator i = map.find(key);\n\tif (i != map.end())\n\t{\n\t\treturn i->second;\n\t} else {\n\t\treturn 0;\n\t}\n}\n\n\/**\n * A basic FIR filter of variable type with float coeffs\n *\n * Note, coefficients will be normalized so that inputs\n * will always be scaled appropriately\n *\/\ntemplate<typename T>\nclass FIRFilter {\npublic:\n\ttypedef std::vector<float> Coeffs;\n\n\tFIRFilter(const T& zero, size_t nrTaps) : _zero(zero) {\n\t\tif (nrTaps == 0)\n\t\t\tthrow std::invalid_argument(\"FIR Filter: number of taps must be greater than zero\");\n\n\t\t\/\/ initialize\n\t\t_taps.assign(nrTaps, _zero);\n\t\t_coeffs.assign(nrTaps, 0.0f);\n\t\t_coeffs[0] = 1.0;\n\t}\n\n\tT filter(const T& x) {\n\t\t_taps.push_front(x);\n\t\t_taps.pop_back();\n\n\t\tT y = _zero;\n\t\tfor (size_t i = 0; i<_taps.size(); ++i)\n\t\t\ty += _taps.at(i) * _coeffs.at(i);\n\n\t\treturn y;\n\t}\n\n\t\/** reinitializes the coeffs and taps to new values *\/\n\tvoid setCoeffs(const Coeffs& coeffs) {\n\t\tsize_t nrTaps = coeffs.size();\n\t\tif (nrTaps == 0)\n\t\t\tthrow std::invalid_argument(\"FIR Filter: number of coeffs must be greater than zero\");\n\n\t\t_taps.assign(nrTaps, _zero);\n\t\t_coeffs.assign(nrTaps, 0.0);\n\n\t\t\/\/ find the normalizer\n\t\tfloat normalizer = 0.0;\n\t\tfor (size_t i = 0; i<coeffs.size(); ++i)\n\t\t\tnormalizer += coeffs.at(i);\n\n\t\t\/\/ set the normalized coefficients\n\t\tfor (size_t i=0; i<coeffs.size(); ++i)\n\t\t\t_coeffs[i] = coeffs.at(i) \/ normalizer;\n\t}\n\nprotected:\n\tT _zero;\n\tstd::deque<T> _taps;\n\tCoeffs _coeffs;\n};\n\n\/\/ An output iterator which throws an exception when it's used.\n\/\/ This is used for example to determine if the output of set_difference would be non-empty without\n\/\/ calculating all of it.\ntemplate<typename T>\nclass ExceptionIterator: public std::iterator<std::output_iterator_tag, void, void, void, void>\n{\npublic:\n\tExceptionIterator &operator=(const T &value)\n\t{\n\t\tthrow std::exception();\n\t}\n\n\tExceptionIterator &operator*()\n\t{\n\t\treturn *this;\n\t}\n\n\tExceptionIterator &operator++()\n\t{\n\t\treturn *this;\n\t}\n\n\tExceptionIterator &operator++(int)\n\t{\n\t\treturn *this;\n\t}\n};\n\n\/\/ Sets str to the name of a class.\n\/\/ Use it like this:\n\/\/\t\tObject *obj = new Object();\n\/\/\t\tQString name = typeName(typeid(*obj));\n\/\/ The returned name is in the usual C++ format: \"Namespace::Namespace::Class\"\nQString typeName(const std::type_info &info);\n\n\/\/ Like typeName, but only returns the final class name part.\nQString className(const std::type_info &info);\n\n\/\/\/ Returns the absolute path to the 'run' directory\nQDir ApplicationRunDirectory();\n<commit_msg>Get rid of static in function declaration<commit_after>#pragma once\n\n#include \"Constants.hpp\"\n#include \"Geometry2d\/Point.hpp\"\n#include \"time.hpp\"\n\n#include <cmath>\n#include <deque>\n#include <QString>\n#include <stdexcept>\n#include <stdint.h>\n#include <sys\/time.h>\n#include <typeinfo>\n#include <vector>\n#include <QtWidgets>\n\nconst static bool THROW_DEBUG_EXCEPTIONS = true;\n\ntemplate <class exception>\ninline void debugThrow(const exception &e) {\n\tif (THROW_DEBUG_EXCEPTIONS) {\n\t\tthrow e;\n\t}\n}\n\ninline void debugThrow(const std::string &string) {\n\tif (THROW_DEBUG_EXCEPTIONS) {\n\t\tdebugThrow(std::runtime_error(string));\n\t}\n}\n\n\/**\n * @brief Restricts the given angle to be between pi and -pi\n * \n * @param a An angle in radians\n * @return An equivalent angle in radians restricted to [-pi, pi]\n *\/\nstatic inline float fixAngleRadians(float a)\n{\n\ta = remainder(a, 2*M_PI);\n\twhile (a < -M_PI) a += 2.0*M_PI;\n\twhile (a > M_PI) a -= 2.0*M_PI;\n\treturn a;\n}\n\n\/** Checks whether or not the given ball is in the defense area. *\/\nstatic inline bool ballIsInGoalieBox(Geometry2d::Point point) {\n\tif (std::abs(point.x) < Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f) \/\/ Ball is in center (rectangular) portion of defensive bubble\n\t{\n\t\treturn point.y > 0 && point.y < Field_Dimensions::Current_Dimensions.ArcRadius();\n\t} else if (std::abs(point.x) < (Field_Dimensions::Current_Dimensions.ArcRadius() + Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f)) \/\/ Ball is in one of the side (arc) portions of defensive bubble\n\t{\n\t\tdouble adjusted_x = std::abs(point.x) - (Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f);\n\t\tdouble max_y = sqrt( (Field_Dimensions::Current_Dimensions.ArcRadius() * Field_Dimensions::Current_Dimensions.ArcRadius()) - (adjusted_x * adjusted_x));\n\t\treturn point.y > 0 && point.y <= max_y;\n\t}\n\treturn false;\n}\n\n\nstatic Geometry2d::Point fromOursToTheirs(Geometry2d::Point &pt) {\n\tGeometry2d::Point c;\n\tc.y = Field_Dimensions::Current_Dimensions.Length() - pt.y;\n\tc.x = -pt.x;\n\n\treturn c;\n}\n\nstatic bool ballIsInTheirGoalieBox(Geometry2d::Point &pt) {\n\tGeometry2d::Point converted = fromOursToTheirs(pt);\n\treturn ballIsInGoalieBox(converted);\n}\n\n\n\/** Returns @value if it is in bounds, otherwise returns the bound it is closest to *\/\ntemplate<class T>\nfloat clamp(T value, T min, T max)\n{\n\tif (value > max)\n\t{\n\t\treturn max;\n\t}\n\telse if (value < min)\n\t{\n\t\treturn min;\n\t}\n\treturn value;\n}\n\n\/\/ Removes all entries in a std::map which associate to the given value.\ntemplate<class Map_Type, class Data_Type>\nvoid map_remove(Map_Type &map, Data_Type &value)\n{\n\ttypename Map_Type::iterator i = map.begin();\n\twhile (i != map.end())\n\t{\n\t\ttypename Map_Type::iterator next = i;\n\t\t++next;\n\n\t\tif (i->second == value)\n\t\t{\n\t\t\tmap.erase(i);\n\t\t}\n\n\t\ti = next;\n\t}\n}\n\n\/\/ If <key> exists in <map>, returns map[key].\n\/\/ If not, returns 0.\ntemplate<typename Map>\ntypename Map::mapped_type map_lookup(const Map &map, typename Map::key_type key)\n{\n\ttypename Map::const_iterator i = map.find(key);\n\tif (i != map.end())\n\t{\n\t\treturn i->second;\n\t} else {\n\t\treturn 0;\n\t}\n}\n\n\/**\n * A basic FIR filter of variable type with float coeffs\n *\n * Note, coefficients will be normalized so that inputs\n * will always be scaled appropriately\n *\/\ntemplate<typename T>\nclass FIRFilter {\npublic:\n\ttypedef std::vector<float> Coeffs;\n\n\tFIRFilter(const T& zero, size_t nrTaps) : _zero(zero) {\n\t\tif (nrTaps == 0)\n\t\t\tthrow std::invalid_argument(\"FIR Filter: number of taps must be greater than zero\");\n\n\t\t\/\/ initialize\n\t\t_taps.assign(nrTaps, _zero);\n\t\t_coeffs.assign(nrTaps, 0.0f);\n\t\t_coeffs[0] = 1.0;\n\t}\n\n\tT filter(const T& x) {\n\t\t_taps.push_front(x);\n\t\t_taps.pop_back();\n\n\t\tT y = _zero;\n\t\tfor (size_t i = 0; i<_taps.size(); ++i)\n\t\t\ty += _taps.at(i) * _coeffs.at(i);\n\n\t\treturn y;\n\t}\n\n\t\/** reinitializes the coeffs and taps to new values *\/\n\tvoid setCoeffs(const Coeffs& coeffs) {\n\t\tsize_t nrTaps = coeffs.size();\n\t\tif (nrTaps == 0)\n\t\t\tthrow std::invalid_argument(\"FIR Filter: number of coeffs must be greater than zero\");\n\n\t\t_taps.assign(nrTaps, _zero);\n\t\t_coeffs.assign(nrTaps, 0.0);\n\n\t\t\/\/ find the normalizer\n\t\tfloat normalizer = 0.0;\n\t\tfor (size_t i = 0; i<coeffs.size(); ++i)\n\t\t\tnormalizer += coeffs.at(i);\n\n\t\t\/\/ set the normalized coefficients\n\t\tfor (size_t i=0; i<coeffs.size(); ++i)\n\t\t\t_coeffs[i] = coeffs.at(i) \/ normalizer;\n\t}\n\nprotected:\n\tT _zero;\n\tstd::deque<T> _taps;\n\tCoeffs _coeffs;\n};\n\n\/\/ An output iterator which throws an exception when it's used.\n\/\/ This is used for example to determine if the output of set_difference would be non-empty without\n\/\/ calculating all of it.\ntemplate<typename T>\nclass ExceptionIterator: public std::iterator<std::output_iterator_tag, void, void, void, void>\n{\npublic:\n\tExceptionIterator &operator=(const T &value)\n\t{\n\t\tthrow std::exception();\n\t}\n\n\tExceptionIterator &operator*()\n\t{\n\t\treturn *this;\n\t}\n\n\tExceptionIterator &operator++()\n\t{\n\t\treturn *this;\n\t}\n\n\tExceptionIterator &operator++(int)\n\t{\n\t\treturn *this;\n\t}\n};\n\n\/\/ Sets str to the name of a class.\n\/\/ Use it like this:\n\/\/\t\tObject *obj = new Object();\n\/\/\t\tQString name = typeName(typeid(*obj));\n\/\/ The returned name is in the usual C++ format: \"Namespace::Namespace::Class\"\nQString typeName(const std::type_info &info);\n\n\/\/ Like typeName, but only returns the final class name part.\nQString className(const std::type_info &info);\n\n\/\/\/ Returns the absolute path to the 'run' directory\nQDir ApplicationRunDirectory();\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\/nss_init.h\"\n\n#include <nss.h>\n#include <plarena.h>\n#include <prerror.h>\n#include <prinit.h>\n\n\/\/ Work around https:\/\/bugzilla.mozilla.org\/show_bug.cgi?id=455424\n\/\/ until NSS 3.12.2 comes out and we update to it.\n#define Lock FOO_NSS_Lock\n#include <pk11pub.h>\n#include <secmod.h>\n#include <ssl.h>\n#undef Lock\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/singleton.h\"\n#include \"base\/string_util.h\"\n\nnamespace {\n\nstd::string GetDefaultConfigDirectory() {\n  const char* home = getenv(\"HOME\");\n  if (home == NULL) {\n    LOG(ERROR) << \"$HOME is not set.\";\n    return \"\";\n  }\n  FilePath dir(home);\n  dir = dir.AppendASCII(\".pki\").AppendASCII(\"nssdb\");\n  if (!file_util::CreateDirectory(dir)) {\n    LOG(ERROR) << \"Failed to create ~\/.pki\/nssdb directory.\";\n    return \"\";\n  }\n  return dir.value();\n}\n\n\/\/ Load nss's built-in root certs.\nSECMODModule *InitDefaultRootCerts() {\n  const char* kModulePath = \"libnssckbi.so\";\n  char modparams[1024];\n  snprintf(modparams, sizeof(modparams),\n          \"name=\\\"Root Certs\\\" library=\\\"%s\\\"\", kModulePath);\n  SECMODModule *root = SECMOD_LoadUserModule(modparams, NULL, PR_FALSE);\n  if (root)\n    return root;\n\n  \/\/ Aw, snap.  Can't find\/load root cert shared library.\n  \/\/ This will make it hard to talk to anybody via https.\n  NOTREACHED();\n  return NULL;\n}\n\nclass NSSInitSingleton {\n public:\n  NSSInitSingleton() {\n    SECStatus status;\n    std::string database_dir = GetDefaultConfigDirectory();\n    if (!database_dir.empty()) {\n      \/\/ Initialize with a persistant database (~\/.pki\/nssdb).\n      \/\/ Use \"sql:\" which can be shared by multiple processes safely.\n      status = NSS_InitReadWrite(\n          StringPrintf(\"sql:%s\", database_dir.c_str()).c_str());\n    } else {\n      LOG(WARNING) << \"Initialize NSS without using a persistent database \"\n                   << \"(~\/.pki\/nssdb).\";\n      status = NSS_NoDB_Init(\".\");\n    }\n    if (status != SECSuccess) {\n      char buffer[513] = \"Couldn't retrieve error\";\n      PRInt32 err_length = PR_GetErrorTextLength();\n      if (err_length > 0 && static_cast<size_t>(err_length) < sizeof(buffer))\n        PR_GetErrorText(buffer);\n\n      NOTREACHED() << \"Error initializing NSS: \" << buffer;\n    }\n\n    \/\/ If we haven't initialized the password for the NSS databases,\n    \/\/ initialize an empty-string password so that we don't need to\n    \/\/ log in.\n    PK11SlotInfo* slot = PK11_GetInternalKeySlot();\n    if (slot) {\n      if (PK11_NeedUserInit(slot))\n        PK11_InitPin(slot, NULL, NULL);\n      PK11_FreeSlot(slot);\n    }\n\n    root_ = InitDefaultRootCerts();\n\n    NSS_SetDomesticPolicy();\n\n    \/\/ Explicitly enable exactly those ciphers with keys of at least 80 bits\n    for (int i = 0; i < SSL_NumImplementedCiphers; i++) {\n      SSLCipherSuiteInfo info;\n      if (SSL_GetCipherSuiteInfo(SSL_ImplementedCiphers[i], &info,\n                                 sizeof(info)) == SECSuccess) {\n        SSL_CipherPrefSetDefault(SSL_ImplementedCiphers[i],\n                                 (info.effectiveKeyBits >= 80));\n      }\n    }\n\n    \/\/ Enable SSL\n    SSL_OptionSetDefault(SSL_SECURITY, PR_TRUE);\n\n    \/\/ All other SSL options are set per-session by SSLClientSocket.\n  }\n\n  ~NSSInitSingleton() {\n    if (root_) {\n      SECMOD_UnloadUserModule(root_);\n      SECMOD_DestroyModule(root_);\n      root_ = NULL;\n    }\n\n    \/\/ Have to clear the cache, or NSS_Shutdown fails with SEC_ERROR_BUSY\n    SSL_ClearSessionCache();\n\n    SECStatus status = NSS_Shutdown();\n    if (status != SECSuccess)\n      LOG(ERROR) << \"NSS_Shutdown failed, leak?  See \"\n                    \"http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=4609\";\n\n    PL_ArenaFinish();\n\n    PRStatus prstatus = PR_Cleanup();\n    if (prstatus != PR_SUCCESS)\n      LOG(ERROR) << \"PR_Cleanup failed?\";\n  }\n\n private:\n  SECMODModule *root_;\n};\n\n}  \/\/ namespace\n\nnamespace base {\n\nvoid EnsureNSSInit() {\n  Singleton<NSSInitSingleton>::get();\n}\n\n}  \/\/ namespace base\n<commit_msg>Avoid runtime linker warning  \"Symbol `SSL_ImplementedCiphers' has different size in shared object, consider re-linking\" if SSL_ImplementedCiphers is different size on target system than it was on build system.<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\/nss_init.h\"\n\n#include <dlfcn.h>\n#include <nss.h>\n#include <plarena.h>\n#include <prerror.h>\n#include <prinit.h>\n\n\/\/ Work around https:\/\/bugzilla.mozilla.org\/show_bug.cgi?id=455424\n\/\/ until NSS 3.12.2 comes out and we update to it.\n#define Lock FOO_NSS_Lock\n#include <pk11pub.h>\n#include <secmod.h>\n#include <ssl.h>\n#undef Lock\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/singleton.h\"\n#include \"base\/string_util.h\"\n\nnamespace {\n\nstd::string GetDefaultConfigDirectory() {\n  const char* home = getenv(\"HOME\");\n  if (home == NULL) {\n    LOG(ERROR) << \"$HOME is not set.\";\n    return \"\";\n  }\n  FilePath dir(home);\n  dir = dir.AppendASCII(\".pki\").AppendASCII(\"nssdb\");\n  if (!file_util::CreateDirectory(dir)) {\n    LOG(ERROR) << \"Failed to create ~\/.pki\/nssdb directory.\";\n    return \"\";\n  }\n  return dir.value();\n}\n\n\/\/ Load nss's built-in root certs.\nSECMODModule *InitDefaultRootCerts() {\n  const char* kModulePath = \"libnssckbi.so\";\n  char modparams[1024];\n  snprintf(modparams, sizeof(modparams),\n          \"name=\\\"Root Certs\\\" library=\\\"%s\\\"\", kModulePath);\n  SECMODModule *root = SECMOD_LoadUserModule(modparams, NULL, PR_FALSE);\n  if (root)\n    return root;\n\n  \/\/ Aw, snap.  Can't find\/load root cert shared library.\n  \/\/ This will make it hard to talk to anybody via https.\n  NOTREACHED();\n  return NULL;\n}\n\nclass NSSInitSingleton {\n public:\n  NSSInitSingleton() {\n    SECStatus status;\n    std::string database_dir = GetDefaultConfigDirectory();\n    if (!database_dir.empty()) {\n      \/\/ Initialize with a persistant database (~\/.pki\/nssdb).\n      \/\/ Use \"sql:\" which can be shared by multiple processes safely.\n      status = NSS_InitReadWrite(\n          StringPrintf(\"sql:%s\", database_dir.c_str()).c_str());\n    } else {\n      LOG(WARNING) << \"Initialize NSS without using a persistent database \"\n                   << \"(~\/.pki\/nssdb).\";\n      status = NSS_NoDB_Init(\".\");\n    }\n    if (status != SECSuccess) {\n      char buffer[513] = \"Couldn't retrieve error\";\n      PRInt32 err_length = PR_GetErrorTextLength();\n      if (err_length > 0 && static_cast<size_t>(err_length) < sizeof(buffer))\n        PR_GetErrorText(buffer);\n\n      NOTREACHED() << \"Error initializing NSS: \" << buffer;\n    }\n\n    \/\/ If we haven't initialized the password for the NSS databases,\n    \/\/ initialize an empty-string password so that we don't need to\n    \/\/ log in.\n    PK11SlotInfo* slot = PK11_GetInternalKeySlot();\n    if (slot) {\n      if (PK11_NeedUserInit(slot))\n        PK11_InitPin(slot, NULL, NULL);\n      PK11_FreeSlot(slot);\n    }\n\n    root_ = InitDefaultRootCerts();\n\n    NSS_SetDomesticPolicy();\n\n    \/\/ Use late binding to avoid scary but benign warning\n    \/\/ \"Symbol `SSL_ImplementedCiphers' has different size in shared object,\n    \/\/  consider re-linking\"\n    const PRUint16* pSSL_ImplementedCiphers = static_cast<const PRUint16*>(\n        dlsym(RTLD_DEFAULT, \"SSL_ImplementedCiphers\"));\n    if (pSSL_ImplementedCiphers == NULL) {\n      NOTREACHED() << \"Can't get list of supported ciphers\";\n      return;\n    }\n\n    \/\/ Explicitly enable exactly those ciphers with keys of at least 80 bits\n    for (int i = 0; i < SSL_NumImplementedCiphers; i++) {\n      SSLCipherSuiteInfo info;\n      if (SSL_GetCipherSuiteInfo(pSSL_ImplementedCiphers[i], &info,\n                                 sizeof(info)) == SECSuccess) {\n        SSL_CipherPrefSetDefault(pSSL_ImplementedCiphers[i],\n                                 (info.effectiveKeyBits >= 80));\n      }\n    }\n\n    \/\/ Enable SSL\n    SSL_OptionSetDefault(SSL_SECURITY, PR_TRUE);\n\n    \/\/ All other SSL options are set per-session by SSLClientSocket.\n  }\n\n  ~NSSInitSingleton() {\n    if (root_) {\n      SECMOD_UnloadUserModule(root_);\n      SECMOD_DestroyModule(root_);\n      root_ = NULL;\n    }\n\n    \/\/ Have to clear the cache, or NSS_Shutdown fails with SEC_ERROR_BUSY\n    SSL_ClearSessionCache();\n\n    SECStatus status = NSS_Shutdown();\n    if (status != SECSuccess)\n      LOG(ERROR) << \"NSS_Shutdown failed, leak?  See \"\n                    \"http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=4609\";\n\n    PL_ArenaFinish();\n\n    PRStatus prstatus = PR_Cleanup();\n    if (prstatus != PR_SUCCESS)\n      LOG(ERROR) << \"PR_Cleanup failed?\";\n  }\n\n private:\n  SECMODModule *root_;\n};\n\n}  \/\/ namespace\n\nnamespace base {\n\nvoid EnsureNSSInit() {\n  Singleton<NSSInitSingleton>::get();\n}\n\n}  \/\/ namespace base\n<|endoftext|>"}
{"text":"<commit_before>#ifndef AMGCL_MAKE_BLOCK_SOLVER_HPP\n#define AMGCL_MAKE_BLOCK_SOLVER_HPP\n\n#include <amgcl\/backend\/interface.hpp>\n#include <amgcl\/adapter\/block_matrix.hpp>\n#include <amgcl\/value_type\/static_matrix.hpp>\n#include <amgcl\/make_solver.hpp>\n#include <amgcl\/util.hpp>\n\nnamespace amgcl {\n\nnamespace backend {\n\n} \/\/ namespace backend\n\n\/* Creates solver that operates in non-scalar domain but may take scalar inputs\n * for the system matrix and the rhs\/solution vectors.\n *\/\ntemplate <class Precond, class IterativeSolver>\nclass make_block_solver {\n    public:\n        typedef typename Precond::backend_type             backend_type;\n        typedef typename backend_type::value_type          value_type;\n        typedef typename backend_type::params              backend_params;\n        typedef typename backend_type::vector              vector;\n        typedef typename math::scalar_of<value_type>::type scalar_type;\n        typedef typename math::rhs_of<value_type>::type    rhs_type;\n\n        typedef typename make_solver<Precond, IterativeSolver>::params params;\n\n        template <class Matrix>\n        make_block_solver(\n                const Matrix &A,\n                const params &prm = params(),\n                const backend_params &bprm = backend_params()\n                )\n        {\n            S = std::make_shared<Solver>(adapter::block_matrix<value_type>(A), prm, bprm);\n        }\n\n        template <class Matrix, class Vec1, class Vec2>\n        std::tuple<size_t, scalar_type> operator()(\n                const Matrix &A, const Vec1 &rhs, Vec2 &&x) const\n        {\n            const size_t n = backend::rows(system_matrix());\n\n            rhs_type const * fptr = reinterpret_cast<rhs_type const *>(&rhs[0]);\n            rhs_type       * xptr = reinterpret_cast<rhs_type       *>(&x[0]);\n\n            iterator_range<rhs_type const *> frng(fptr, fptr + n);\n            iterator_range<rhs_type       *> xrng(xptr, xptr + n);\n\n            return (*S)(A, frng, xrng);\n        }\n\n        template <class Vec1, class Vec2>\n        std::tuple<size_t, scalar_type>\n        operator()(const Vec1 &rhs, Vec2 &&x) const {\n            const size_t n = backend::rows(system_matrix());\n\n            rhs_type const * fptr = reinterpret_cast<rhs_type const *>(&rhs[0]);\n            rhs_type       * xptr = reinterpret_cast<rhs_type       *>(&x[0]);\n\n            iterator_range<rhs_type const *> frng(fptr, fptr + n);\n            iterator_range<rhs_type       *> xrng(xptr, xptr + n);\n\n            return (*S)(frng, xrng);\n        }\n\n        std::shared_ptr<typename Precond::matrix> system_matrix_ptr() const {\n            return S->system_matrix_ptr();\n        }\n\n        typename Precond::matrix const& system_matrix() const {\n            return S->system_matrix();\n        }\n\n        friend std::ostream& operator<<(std::ostream &os, const make_block_solver &p) {\n            return os << *p.S << std::endl;\n        }\n\n        size_t bytes() const {\n            return backend::bytes(*S);\n        }\n    private:\n        typedef make_solver<Precond, IterativeSolver> Solver;\n        std::shared_ptr<Solver> S;\n};\n\n} \/\/ namespace amgcl\n\n#endif\n<commit_msg>Support mixed precision in block solver<commit_after>#ifndef AMGCL_MAKE_BLOCK_SOLVER_HPP\n#define AMGCL_MAKE_BLOCK_SOLVER_HPP\n\n#include <amgcl\/backend\/interface.hpp>\n#include <amgcl\/adapter\/block_matrix.hpp>\n#include <amgcl\/value_type\/static_matrix.hpp>\n#include <amgcl\/make_solver.hpp>\n#include <amgcl\/util.hpp>\n\nnamespace amgcl {\n\nnamespace backend {\n\n} \/\/ namespace backend\n\n\/* Creates solver that operates in non-scalar domain but may take scalar inputs\n * for the system matrix and the rhs\/solution vectors.\n *\/\ntemplate <class Precond, class IterativeSolver>\nclass make_block_solver {\n    public:\n        typedef typename Precond::backend_type             backend_type;\n        typedef typename backend_type::value_type          value_type;\n        typedef typename backend_type::params              backend_params;\n        typedef typename backend_type::vector              vector;\n        typedef typename math::scalar_of<value_type>::type scalar_type;\n        typedef typename math::rhs_of<value_type>::type    rhs_type;\n\n        typedef typename make_solver<Precond, IterativeSolver>::params params;\n\n        template <class Matrix>\n        make_block_solver(\n                const Matrix &A,\n                const params &prm = params(),\n                const backend_params &bprm = backend_params()\n                )\n        {\n            S = std::make_shared<Solver>(adapter::block_matrix<value_type>(A), prm, bprm);\n        }\n\n        template <class Matrix, class Vec1, class Vec2>\n        std::tuple<size_t, scalar_type> operator()(\n                const Matrix &A, const Vec1 &rhs, Vec2 &&x) const\n        {\n            const size_t n = backend::rows(system_matrix());\n\n            typedef typename math::scalar_of<typename backend::value_type<typename std::decay<Vec1>::type>::type>::type fs;\n            typedef typename math::scalar_of<typename backend::value_type<typename std::decay<Vec2>::type>::type>::type xs;\n\n            typedef typename math::replace_scalar<rhs_type, fs>::type f_type;\n            typedef typename math::replace_scalar<rhs_type, xs>::type x_type;\n\n            f_type const * fptr = reinterpret_cast<f_type const *>(&rhs[0]);\n            x_type       * xptr = reinterpret_cast<x_type       *>(&x[0]);\n\n            iterator_range<f_type const *> frng(fptr, fptr + n);\n            iterator_range<x_type       *> xrng(xptr, xptr + n);\n\n            return (*S)(A, frng, xrng);\n        }\n\n        template <class Vec1, class Vec2>\n        std::tuple<size_t, scalar_type>\n        operator()(const Vec1 &rhs, Vec2 &&x) const {\n            const size_t n = backend::rows(system_matrix());\n\n            typedef typename math::scalar_of<typename backend::value_type<typename std::decay<Vec1>::type>::type>::type fs;\n            typedef typename math::scalar_of<typename backend::value_type<typename std::decay<Vec2>::type>::type>::type xs;\n\n            typedef typename math::replace_scalar<rhs_type, fs>::type f_type;\n            typedef typename math::replace_scalar<rhs_type, xs>::type x_type;\n\n            f_type const * fptr = reinterpret_cast<f_type const *>(&rhs[0]);\n            x_type       * xptr = reinterpret_cast<x_type       *>(&x[0]);\n\n            iterator_range<f_type const *> frng(fptr, fptr + n);\n            iterator_range<x_type       *> xrng(xptr, xptr + n);\n\n            return (*S)(frng, xrng);\n        }\n\n        std::shared_ptr<typename Precond::matrix> system_matrix_ptr() const {\n            return S->system_matrix_ptr();\n        }\n\n        typename Precond::matrix const& system_matrix() const {\n            return S->system_matrix();\n        }\n\n        friend std::ostream& operator<<(std::ostream &os, const make_block_solver &p) {\n            return os << *p.S << std::endl;\n        }\n\n        size_t bytes() const {\n            return backend::bytes(*S);\n        }\n    private:\n        typedef make_solver<Precond, IterativeSolver> Solver;\n        std::shared_ptr<Solver> S;\n};\n\n} \/\/ namespace amgcl\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <tests\/Base.hh>\n\n#include <aleph\/persistentHomology\/algorithms\/Standard.hh>\n#include <aleph\/persistentHomology\/PhiPersistence.hh>\n\n#include <aleph\/topology\/Conversions.hh>\n#include <aleph\/topology\/QuotientSpaces.hh>\n#include <aleph\/topology\/Simplex.hh>\n#include <aleph\/topology\/SimplicialComplex.hh>\n\n#include <unordered_map>\n#include <vector>\n\ntemplate <class T> void test()\n{\n  ALEPH_TEST_BEGIN( \"Persistent intersection homology: simple example\" );\n\n  using Simplex           = aleph::topology::Simplex<T>;\n  using SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\n\n  std::vector<Simplex> simplices =\n  {\n    {0},\n    {1},\n    {2},\n    {3},\n    {4},\n    {0,1}, {0,3}, {0,4},\n    {1,2}, {1,4},\n    {2,3}, {2,4},\n    {3,4},\n    {0,3,4}, \/\/ A\n    {1,2,4}, \/\/ B\n    {2,3,4}, \/\/ C\n    {0,1,4}  \/\/ E\n  };\n\n  std::map<Simplex, bool> phi;\n\n  for( auto&& simplex : simplices )\n  {\n    if( simplex.contains(4) == false || simplex.dimension() == 2 )\n      phi[simplex] = true;\n    else\n      phi[simplex] = false;\n  }\n\n  SimplicialComplex K( simplices.begin(), simplices.end() );\n  SimplicialComplex L;\n\n  std::size_t s    = 0;\n  std::tie( L, s ) =\n    aleph::partition( K,\n                      [&phi] ( const Simplex& s )\n                      {\n                        return phi.at(s);\n                      } );\n\n  ALEPH_ASSERT_EQUAL( K.size(), L.size() );\n\n  auto boundaryMatrix = aleph::topology::makeBoundaryMatrix( L, s );\n  auto indexA         = L.index( {0,3,4} );\n\n  using IndexType     = typename decltype(boundaryMatrix)::Index;\n  auto columnA        = boundaryMatrix.getColumn( static_cast<IndexType>( indexA ) );\n\n  ALEPH_ASSERT_EQUAL( columnA.size(), 3 );\n\n  aleph::persistentHomology::algorithms::Standard algorithm;\n  algorithm( boundaryMatrix );\n\n  unsigned numAllowableChains    = 0;\n  unsigned numAllowableTwoChains = 0;\n\n  for( IndexType i = 0; i < boundaryMatrix.getNumColumns(); i++ )\n  {\n    auto lowestOne = boundaryMatrix.getMaximumIndex( i );\n    if( lowestOne.second && lowestOne.first <= s )\n    {\n      ++numAllowableChains;\n\n      if( L.at(i).dimension() == 2 )\n        ++numAllowableTwoChains;\n    }\n  }\n\n  ALEPH_ASSERT_THROW( numAllowableChains >= numAllowableTwoChains );\n  ALEPH_ASSERT_EQUAL( numAllowableTwoChains, 1 );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class T> void testQuotientSpaces()\n{\n  ALEPH_TEST_BEGIN( \"Persistent intersection homology: quotient spaces\" );\n\n  using Simplex           = aleph::topology::Simplex<T>;\n  using SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\n\n  SimplicialComplex K = {\n    {0},\n    {1},\n    {2},\n    {3},\n    {0,1}, {0,2}, {0,3},\n    {1,2}, {1,3},\n    {2,3},\n    {0,1,2}, {0,1,3}, {0,2,3},\n    {1,2,3},\n    {0,1,2,3}\n  };\n\n  auto C = aleph::topology::cone( K );\n  auto S = aleph::topology::suspension( K );\n\n  ALEPH_ASSERT_THROW( C.empty() == false );\n  ALEPH_ASSERT_THROW( S.empty() == false );\n  ALEPH_ASSERT_EQUAL( C.size(), 2 * K.size() + 1);\n  ALEPH_ASSERT_EQUAL( S.size(), 3 * K.size() + 2);\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class T> void testWedgeOfTwoCircles()\n{\n  ALEPH_TEST_BEGIN( \"Persistent intersection homology: wedge of two circles\" );\n\n  using Simplex           = aleph::topology::Simplex<T>;\n  using SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\n\n  SimplicialComplex K = {\n    {0},\n    {1},\n    {2},\n    {3},\n    {4},\n    {5},\n    {6},\n    {0,1}, {0,6},\n    {1,2},\n    {2,3}, {2,5}, {2,6},\n    {3,4},\n    {4,5}\n  };\n\n  SimplicialComplex X0 = { {2} };\n  SimplicialComplex X1 = K;\n\n  auto D1 = aleph::calculateIntersectionHomology( K, {X0,X1}, aleph::Perversity( {-1,-1} ) );\n  auto D2 = aleph::calculateIntersectionHomology( K, {X0,X1}, aleph::Perversity( { 0, 0} ) );\n\n  ALEPH_ASSERT_EQUAL( D1.size(), 1 );\n  ALEPH_ASSERT_EQUAL( D2.size(), 2 );\n\n  ALEPH_ASSERT_EQUAL( D1[0].betti(), 2 );\n\n  \/\/ TODO: is this correct? In his Ph.D. thesis \"Analyzing Stratified\n  \/\/ Spaces Using Persistent Versions of Intersection and Local\n  \/\/ Homology\", Bendich states that this should be 0...\n  ALEPH_ASSERT_EQUAL( D2[0].betti(), 1 );\n  ALEPH_ASSERT_EQUAL( D2[1].betti(), 2 );\n\n  ALEPH_TEST_END();\n}\n\nint main(int, char**)\n{\n  test<float> ();\n  test<double>();\n\n  testQuotientSpaces<float> ();\n  testQuotientSpaces<double>();\n\n  testWedgeOfTwoCircles<float> ();\n  testWedgeOfTwoCircles<double>();\n}\n<commit_msg>Extended test case for quotient spaces with homology calculations<commit_after>#include <tests\/Base.hh>\n\n#include <aleph\/persistentHomology\/algorithms\/Standard.hh>\n\n#include <aleph\/persistentHomology\/Calculation.hh>\n#include <aleph\/persistentHomology\/PhiPersistence.hh>\n\n#include <aleph\/topology\/Conversions.hh>\n#include <aleph\/topology\/QuotientSpaces.hh>\n#include <aleph\/topology\/Simplex.hh>\n#include <aleph\/topology\/SimplicialComplex.hh>\n\n#include <unordered_map>\n#include <vector>\n\ntemplate <class T> void test()\n{\n  ALEPH_TEST_BEGIN( \"Persistent intersection homology: simple example\" );\n\n  using Simplex           = aleph::topology::Simplex<T>;\n  using SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\n\n  std::vector<Simplex> simplices =\n  {\n    {0},\n    {1},\n    {2},\n    {3},\n    {4},\n    {0,1}, {0,3}, {0,4},\n    {1,2}, {1,4},\n    {2,3}, {2,4},\n    {3,4},\n    {0,3,4}, \/\/ A\n    {1,2,4}, \/\/ B\n    {2,3,4}, \/\/ C\n    {0,1,4}  \/\/ E\n  };\n\n  std::map<Simplex, bool> phi;\n\n  for( auto&& simplex : simplices )\n  {\n    if( simplex.contains(4) == false || simplex.dimension() == 2 )\n      phi[simplex] = true;\n    else\n      phi[simplex] = false;\n  }\n\n  SimplicialComplex K( simplices.begin(), simplices.end() );\n  SimplicialComplex L;\n\n  std::size_t s    = 0;\n  std::tie( L, s ) =\n    aleph::partition( K,\n                      [&phi] ( const Simplex& s )\n                      {\n                        return phi.at(s);\n                      } );\n\n  ALEPH_ASSERT_EQUAL( K.size(), L.size() );\n\n  auto boundaryMatrix = aleph::topology::makeBoundaryMatrix( L, s );\n  auto indexA         = L.index( {0,3,4} );\n\n  using IndexType     = typename decltype(boundaryMatrix)::Index;\n  auto columnA        = boundaryMatrix.getColumn( static_cast<IndexType>( indexA ) );\n\n  ALEPH_ASSERT_EQUAL( columnA.size(), 3 );\n\n  aleph::persistentHomology::algorithms::Standard algorithm;\n  algorithm( boundaryMatrix );\n\n  unsigned numAllowableChains    = 0;\n  unsigned numAllowableTwoChains = 0;\n\n  for( IndexType i = 0; i < boundaryMatrix.getNumColumns(); i++ )\n  {\n    auto lowestOne = boundaryMatrix.getMaximumIndex( i );\n    if( lowestOne.second && lowestOne.first <= s )\n    {\n      ++numAllowableChains;\n\n      if( L.at(i).dimension() == 2 )\n        ++numAllowableTwoChains;\n    }\n  }\n\n  ALEPH_ASSERT_THROW( numAllowableChains >= numAllowableTwoChains );\n  ALEPH_ASSERT_EQUAL( numAllowableTwoChains, 1 );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class T> void testQuotientSpaces()\n{\n  ALEPH_TEST_BEGIN( \"Persistent intersection homology: quotient spaces\" );\n\n  using Simplex           = aleph::topology::Simplex<T>;\n  using SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\n\n  SimplicialComplex K = {\n    {0},\n    {1},\n    {2},\n    {3},\n    {0,1}, {0,2}, {0,3},\n    {1,2}, {1,3},\n    {2,3},\n    {0,1,2}, {0,1,3}, {0,2,3},\n    {1,2,3}\n  };\n\n  auto C = aleph::topology::cone( K );\n  auto S = aleph::topology::suspension( K );\n\n  ALEPH_ASSERT_THROW( C.empty() == false );\n  ALEPH_ASSERT_THROW( S.empty() == false );\n  ALEPH_ASSERT_EQUAL( C.size(), 2 * K.size() + 1);\n  ALEPH_ASSERT_EQUAL( S.size(), 3 * K.size() + 2);\n\n  S.sort();\n\n  bool dualize                    = true;\n  bool includeAllUnpairedCreators = true;\n\n  auto D1 = aleph::calculatePersistenceDiagrams(K, dualize, includeAllUnpairedCreators);\n  auto D2 = aleph::calculatePersistenceDiagrams(S, dualize, includeAllUnpairedCreators);\n\n  ALEPH_ASSERT_EQUAL( D1.size(), 3 );\n  ALEPH_ASSERT_EQUAL( D2.size(), 4 );\n\n  std::vector<std::size_t> expectedBettiNumbersK = {1,0,1};\n  std::vector<std::size_t> expectedBettiNumbersS = {1,0,0,1};\n\n  std::vector<std::size_t> bettiNumbersK;\n  std::vector<std::size_t> bettiNumbersS;\n\n  using PersistenceDiagram = decltype( D1.front() );\n\n  std::transform( D1.begin(), D1.end(), std::back_inserter( bettiNumbersK ), [] ( const PersistenceDiagram& D ) { return D.betti(); } );\n  std::transform( D2.begin(), D2.end(), std::back_inserter( bettiNumbersS ), [] ( const PersistenceDiagram& D ) { return D.betti(); } );\n\n  ALEPH_ASSERT_THROW( bettiNumbersK == expectedBettiNumbersK );\n  ALEPH_ASSERT_THROW( bettiNumbersS == expectedBettiNumbersS );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class T> void testWedgeOfTwoCircles()\n{\n  ALEPH_TEST_BEGIN( \"Persistent intersection homology: wedge of two circles\" );\n\n  using Simplex           = aleph::topology::Simplex<T>;\n  using SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\n\n  SimplicialComplex K = {\n    {0},\n    {1},\n    {2},\n    {3},\n    {4},\n    {5},\n    {6},\n    {0,1}, {0,6},\n    {1,2},\n    {2,3}, {2,5}, {2,6},\n    {3,4},\n    {4,5}\n  };\n\n  SimplicialComplex X0 = { {2} };\n  SimplicialComplex X1 = K;\n\n  auto D1 = aleph::calculateIntersectionHomology( K, {X0,X1}, aleph::Perversity( {-1,-1} ) );\n  auto D2 = aleph::calculateIntersectionHomology( K, {X0,X1}, aleph::Perversity( { 0, 0} ) );\n\n  ALEPH_ASSERT_EQUAL( D1.size(), 1 );\n  ALEPH_ASSERT_EQUAL( D2.size(), 2 );\n\n  ALEPH_ASSERT_EQUAL( D1[0].betti(), 2 );\n\n  \/\/ TODO: is this correct? In his Ph.D. thesis \"Analyzing Stratified\n  \/\/ Spaces Using Persistent Versions of Intersection and Local\n  \/\/ Homology\", Bendich states that this should be 0...\n  ALEPH_ASSERT_EQUAL( D2[0].betti(), 1 );\n  ALEPH_ASSERT_EQUAL( D2[1].betti(), 2 );\n\n  ALEPH_TEST_END();\n}\n\nint main(int, char**)\n{\n  test<float> ();\n  test<double>();\n\n  testQuotientSpaces<float> ();\n  testQuotientSpaces<double>();\n\n  testWedgeOfTwoCircles<float> ();\n  testWedgeOfTwoCircles<double>();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cthun-agent\/modules\/status.hpp>\n#include <cthun-agent\/file_utils.hpp>\n#include <cthun-agent\/configuration.hpp>\n#include <cthun-agent\/errors.hpp>\n\n#include <fstream>\n\n#define LEATHERMAN_LOGGING_NAMESPACE \"puppetlabs.cthun_agent.modules.status\"\n#include <leatherman\/logging\/logging.hpp>\n\nnamespace CthunAgent {\nnamespace Modules {\n\nstatic const std::string QUERY { \"query\" };\n\nStatus::Status() {\n    module_name = \"status\";\n    actions.push_back(QUERY);\n    CthunClient::Schema input_schema { QUERY };\n    CthunClient::Schema output_schema { QUERY };\n\n    input_validator_.registerSchema(input_schema);\n    output_validator_.registerSchema(output_schema);\n}\n\nActionOutcome Status::callAction(const std::string& action_name,\n                                 const CthunClient::ParsedChunks& parsed_chunks) {\n    CthunClient::DataContainer results {};\n    auto request_input = parsed_chunks.data\n                                      .get<CthunClient::DataContainer>(\"params\");\n    auto job_id = request_input.get<std::string>(\"job_id\");\n    auto spool_dir = Configuration::Instance().get<std::string>(\"spool-dir\");\n\n    if (!FileUtils::fileExists(spool_dir + job_id)) {\n        LOG_ERROR(\"Found no results for job id %1%\", job_id);\n        results.set<std::string>(\"error\", \"No job exists for id: \" + job_id);\n        return results;\n    }\n\n    CthunClient::DataContainer status {\n        FileUtils::readFileAsString(spool_dir + job_id + \"\/status\") };\n\n    auto status_txt = status.get<std::string>(\"status\");\n    if (status_txt == \"running\") {\n        results.set<std::string>(\"status\", \"Running\");\n    } else if (status_txt == \"completed\") {\n        results.set<std::string>(\"status\", \"Completed\");\n        results.set<std::string>(\"stdout\",\n                    FileUtils::readFileAsString(spool_dir + job_id + \"\/stdout\"));\n        results.set<std::string>(\"stderr\",\n                    FileUtils::readFileAsString(spool_dir + job_id + \"\/stderr\"));\n    } else {\n        std::string tmp { \"Job '\" + job_id + \"' is in unknown state: \" };\n        results.set<std::string>(\"status\", tmp + status_txt);\n    }\n\n    return ActionOutcome { results };\n}\n\n}  \/\/ namespace Modules\n}  \/\/ namespace CthunAgent\n<commit_msg>(maint) Add TODO message for status action response<commit_after>#include <cthun-agent\/modules\/status.hpp>\n#include <cthun-agent\/file_utils.hpp>\n#include <cthun-agent\/configuration.hpp>\n#include <cthun-agent\/errors.hpp>\n\n#include <fstream>\n\n#define LEATHERMAN_LOGGING_NAMESPACE \"puppetlabs.cthun_agent.modules.status\"\n#include <leatherman\/logging\/logging.hpp>\n\nnamespace CthunAgent {\nnamespace Modules {\n\nstatic const std::string QUERY { \"query\" };\n\nStatus::Status() {\n    module_name = \"status\";\n    actions.push_back(QUERY);\n    CthunClient::Schema input_schema { QUERY };\n    CthunClient::Schema output_schema { QUERY };\n\n    input_validator_.registerSchema(input_schema);\n    output_validator_.registerSchema(output_schema);\n}\n\nActionOutcome Status::callAction(const std::string& action_name,\n                                 const CthunClient::ParsedChunks& parsed_chunks) {\n    CthunClient::DataContainer results {};\n    auto request_input = parsed_chunks.data\n                                      .get<CthunClient::DataContainer>(\"params\");\n    auto job_id = request_input.get<std::string>(\"job_id\");\n    auto spool_dir = Configuration::Instance().get<std::string>(\"spool-dir\");\n\n    if (!FileUtils::fileExists(spool_dir + job_id)) {\n        \/\/ TODO(ale): return \"unknown\" in this case; see RPC specs\n\n        LOG_ERROR(\"Found no results for job id %1%\", job_id);\n        results.set<std::string>(\"error\", \"No job exists for id: \" + job_id);\n        return results;\n    }\n\n    CthunClient::DataContainer status {\n        FileUtils::readFileAsString(spool_dir + job_id + \"\/status\") };\n\n    auto status_txt = status.get<std::string>(\"status\");\n    if (status_txt == \"running\") {\n        results.set<std::string>(\"status\", \"Running\");\n    } else if (status_txt == \"completed\") {\n        results.set<std::string>(\"status\", \"Completed\");\n        results.set<std::string>(\"stdout\",\n                    FileUtils::readFileAsString(spool_dir + job_id + \"\/stdout\"));\n        results.set<std::string>(\"stderr\",\n                    FileUtils::readFileAsString(spool_dir + job_id + \"\/stderr\"));\n    } else {\n        std::string tmp { \"Job '\" + job_id + \"' is in unknown state: \" };\n        results.set<std::string>(\"status\", tmp + status_txt);\n    }\n\n    return ActionOutcome { results };\n}\n\n}  \/\/ namespace Modules\n}  \/\/ namespace CthunAgent\n<|endoftext|>"}
{"text":"<commit_before>#include \"Window.hpp\"\n#include <QApplication>\n#include <QOffscreenSurface>\n#include <QEventLoop>\n#include <QDesktopWidget>\n#include <QIcon>\n\nnamespace fast {\n\nQGLContext* Window::mMainGLContext = NULL;\n\nclass FAST_EXPORT FASTApplication : public QApplication {\npublic:\n    FASTApplication(int &argc, char **argv) : QApplication(argc, argv) {\n    }\n\n    virtual ~FASTApplication() {\n        Reporter::info() << \"FASTApplication (QApplication) is destroyed\" << Reporter::end();\n    }\n\n    \/\/ reimplemented from QApplication so we can throw exceptions in slots\n    virtual bool notify(QObject *receiver, QEvent *event) {\n        try {\n            return QApplication::notify(receiver, event);\n        } catch(Exception &e) {\n            Reporter::error() << \"FAST exception caught in Qt event handler \" << e.what() << Reporter::end();\n        } catch(cl::Error &e) {\n            Reporter::error() << \"OpenCL exception caught in Qt event handler \" << e.what() << \"(\" << getCLErrorString(e.err()) << \")\" << Reporter::end();\n        } catch(std::exception &e) {\n            Reporter::error() << \"Std exception caught in Qt event handler \" << e.what() << Reporter::end();\n        }\n        return false;\n    }\n};\n\nWindow::Window() {\n    mThread = NULL;\n    mTimeout = 0;\n    initializeQtApp();\n\n    \/\/ Scaling GUI\n    QFont defaultFont = QApplication::font();\n    QDesktopWidget *desktop = QApplication::desktop();\n    int screenWidth = desktop->width();\n    if(defaultFont.pointSize() < 10 && screenWidth > 2000) {\n        if(screenWidth > 3000) {\n            \/\/ 4K screens\n            Reporter::info() << \"Large screen detected with width: \" << screenWidth << Reporter::end();\n            Reporter::info() << \"Scaling default font with factor 2\" << Reporter::end();\n            mGUIScalingFactor = 2;\n        } else {\n            Reporter::info() << \"Medium large screen detected with width: \" << screenWidth << Reporter::end();\n            Reporter::info() << \"Scaling default font with factor 1.5\" << Reporter::end();\n            mGUIScalingFactor = 1.5;\n        }\n    }\n    defaultFont.setPointSize((int)round(defaultFont.pointSize() * mGUIScalingFactor));\n    QApplication::setFont(defaultFont);\n\n\tmEventLoop = NULL;\n    mWidget = new WindowWidget;\n    mEventLoop = new QEventLoop(mWidget);\n    mWidget->connect(mWidget, SIGNAL(widgetHasClosed()), this, SLOT(stop()));\n    mWidget->setContentsMargins(0, 0, 0, 0);\n\n    \/\/ default window size\n    mWidth = 512;\n    mHeight = 512;\n    mFullscreen = false;\n    mMaximized = false;\n}\n\nvoid Window::enableFullscreen() {\n    mFullscreen = true;\n    disableMaximized();\n}\n\nvoid Window::disableFullscreen() {\n    mFullscreen = false;\n}\n\nvoid Window::enableMaximized() {\n    mMaximized = true;\n    disableFullscreen();\n}\n\nvoid Window::disableMaximized() {\n    mMaximized = false;\n}\n\nvoid Window::setTitle(std::string title) {\n    mWidget->setWindowTitle(title.c_str());\n}\n\nvoid Window::cleanup() {\n    \/\/delete QApplication::instance();\n}\n\nvoid Window::initializeQtApp() {\n    \/\/ Make sure only one QApplication is created\n    if(!QApplication::instance()) {\n        Reporter::info() << \"Creating new QApp\" << Reporter::end();\n        \/\/ Create some dummy argc and argv options as QApplication requires it\n        int* argc = new int[1];\n        *argc = 0;\n        QApplication* app = new FASTApplication(*argc,NULL);\n\n        \/\/ Set default window icon\n        QApplication::setWindowIcon(QIcon((Config::getDocumentationPath() + \"images\/fast_icon.png\").c_str()));\n\n         \/\/ Create computation GL context, if it doesn't exist\n        if(mMainGLContext == NULL) {\n            Reporter::info() << \"Creating new GL context for computation thread\" << Reporter::end();\n\n            \/\/ Create GL context to be shared with the CL contexts\n            QGLWidget* widget = new QGLWidget;\n            mMainGLContext = new QGLContext(QGLFormat::defaultFormat(), widget); \/\/ by including widget here the context becomes valid\n            mMainGLContext->create();\n            if(!mMainGLContext->isValid()) {\n                throw Exception(\"Qt GL context is invalid!\");\n            }\n        }\n    } else {\n        Reporter::info() << \"QApp already exists..\" << Reporter::end();\n    }\n\n    \/\/ There is a bug in AMD OpenCL related to comma (,) as decimal point\n    \/\/ This will change decimal point to dot (.)\n    struct lconv * lc;\n    lc = localeconv();\n    if(strcmp(lc->decimal_point, \",\") == 0) {\n        Reporter::warning() << \"Your system uses comma as decimal point.\" << Reporter::end();\n        Reporter::warning() << \"This will now be changed to dot to avoid any comma related bugs.\" << Reporter::end();\n        setlocale(LC_NUMERIC, \"C\");\n        \/\/ Check again to be sure\n        lc = localeconv();\n        if(strcmp(lc->decimal_point, \",\") == 0) {\n            throw Exception(\"Failed to convert decimal point to dot.\");\n        }\n    }\n}\n\n\nvoid Window::stop() {\n    reportInfo() << \"Stop signal recieved..\" << Reporter::end();\n    stopComputationThread();\n    if(mEventLoop != NULL)\n        mEventLoop->quit();\n    \/*\n    \/\/ Make sure event is not quit twice\n    if(!mWidget->getView()->hasQuit()) {\n        \/\/ This event occurs when window is closed or timeout is reached\n        mWidget->getView()->quit();\n    }\n    *\/\n}\n\nView* Window::createView() {\n    View* view = mWidget->addView();\n\n    return view;\n}\n\nvoid Window::start() {\n\n    QDesktopWidget *desktop = QApplication::desktop();\n    int screenWidth = desktop->width();\n    int screenHeight = desktop->height();\n\n    mWidget->resize(mWidth,mHeight);\n    if(mFullscreen) {\n        mWidget->showFullScreen();\n    } else if(mMaximized) {\n        \/\/mWidth = screenWidth;\n        \/\/mHeight = screenHeight;\n        mWidget->showMaximized();\n    } else {\n        \/\/ Move window to center\n        int x = (screenWidth - mWidth) \/ 2;\n        int y = (screenHeight - mHeight) \/ 2;\n        mWidget->move(x, y);\n        mWidget->show();\n    }\n\n    if(mTimeout > 0) {\n        QTimer* timer = new QTimer(mWidget);\n        timer->start(mTimeout);\n        timer->setSingleShot(true);\n        mWidget->connect(timer,SIGNAL(timeout()),mWidget,SLOT(close()));\n    }\n\n    startComputationThread();\n\n    mEventLoop->exec(); \/\/ This call blocks and starts rendering\n}\n\nWindow::~Window() {\n    \/\/ Cleanup\n    reportInfo() << \"Destroying window..\" << Reporter::end();\n    \/\/ Event loop is child of widget\n    \/\/reportInfo() << \"Deleting event loop\" << Reporter::end();\n    \/\/if(mEventLoop != NULL)\n    \/\/    delete mEventLoop;\n    reportInfo() << \"Deleting widget\" << Reporter::end();\n    if(mWidget != NULL) {\n        delete mWidget;\n        mWidget = NULL;\n    }\n    reportInfo() << \"Finished deleting window widget\" << Reporter::end();\n    if(mThread != NULL) {\n        mThread->stop();\n        delete mThread;\n        mThread = NULL;\n    }\n\n    reportInfo() << \"Window destroyed\" << Reporter::end();\n}\n\nvoid Window::setTimeout(unsigned int milliseconds) {\n    mTimeout = milliseconds;\n}\n\nQGLContext* Window::getMainGLContext() {\n    if(mMainGLContext == NULL) {\n        throw Exception(\"No OpenGL context created\");\n        \/\/initializeQtApp();\n    }\n\n    return mMainGLContext;\n}\n\nvoid Window::setMainGLContext(QGLContext* context) {\n    mMainGLContext = context;\n}\n\nvoid Window::startComputationThread() {\n    if(mThread == NULL) {\n        \/\/ Start computation thread using QThreads which is a strange thing, see https:\/\/mayaposch.wordpress.com\/2011\/11\/01\/how-to-really-truly-use-qthreads-the-full-explanation\/\n        reportInfo() << \"Trying to start computation thread\" << Reporter::end();\n        mThread = new ComputationThread(QThread::currentThread());\n        QThread* thread = new QThread();\n        mThread->moveToThread(thread);\n        connect(thread, SIGNAL(started()), mThread, SLOT(run()));\n        connect(mThread, SIGNAL(finished()), thread, SLOT(quit()));\n        \/\/connect(thread, SIGNAL(finished()), thread, SLOT(deleteLater()));\n\n        for(int i = 0; i < getViews().size(); i++)\n            mThread->addView(getViews()[i]);\n        QGLContext* mainGLContext = Window::getMainGLContext();\n        if(!mainGLContext->isValid()) {\n            throw Exception(\"QGL context is invalid!\");\n        }\n\n        mainGLContext->doneCurrent();\n        mainGLContext->moveToThread(thread);\n        thread->start();\n        reportInfo() << \"Computation thread started\" << Reporter::end();\n    }\n}\n\nvoid Window::stopComputationThread() {\n    reportInfo() << \"Trying to stop computation thread\" << Reporter::end();\n    if(mThread != NULL) {\n        mThread->stop();\n        delete mThread;\n        mThread = NULL;\n    }\n    reportInfo() << \"Computation thread stopped\" << Reporter::end();\n}\n\nstd::vector<View*> Window::getViews() const {\n    return mWidget->getViews();\n}\n\nView* Window::getView(uint i) const {\n    return mWidget->getViews().at(i);\n}\n\nvoid Window::setWidth(uint width) {\n    mWidth = width;\n}\n\nvoid Window::setHeight(uint height) {\n    mHeight = height;\n}\n\nvoid Window::setSize(uint width, uint height) {\n    setWidth(width);\n    setHeight(height);\n}\n\nfloat Window::getScalingFactor() const {\n    return mGUIScalingFactor;\n}\n\nint Window::getScreenWidth() const {\n    QDesktopWidget *desktop = QApplication::desktop();\n    return desktop->width();\n}\n\nint Window::getScreenHeight() const {\n    QDesktopWidget *desktop = QApplication::desktop();\n    return desktop->height();\n}\n\n} \/\/ end namespace fast\n<commit_msg>Lowered scaling factor for 4k screens to 1.75<commit_after>#include \"Window.hpp\"\n#include <QApplication>\n#include <QOffscreenSurface>\n#include <QEventLoop>\n#include <QDesktopWidget>\n#include <QIcon>\n\nnamespace fast {\n\nQGLContext* Window::mMainGLContext = NULL;\n\nclass FAST_EXPORT FASTApplication : public QApplication {\npublic:\n    FASTApplication(int &argc, char **argv) : QApplication(argc, argv) {\n    }\n\n    virtual ~FASTApplication() {\n        Reporter::info() << \"FASTApplication (QApplication) is destroyed\" << Reporter::end();\n    }\n\n    \/\/ reimplemented from QApplication so we can throw exceptions in slots\n    virtual bool notify(QObject *receiver, QEvent *event) {\n        try {\n            return QApplication::notify(receiver, event);\n        } catch(Exception &e) {\n            Reporter::error() << \"FAST exception caught in Qt event handler \" << e.what() << Reporter::end();\n        } catch(cl::Error &e) {\n            Reporter::error() << \"OpenCL exception caught in Qt event handler \" << e.what() << \"(\" << getCLErrorString(e.err()) << \")\" << Reporter::end();\n        } catch(std::exception &e) {\n            Reporter::error() << \"Std exception caught in Qt event handler \" << e.what() << Reporter::end();\n        }\n        return false;\n    }\n};\n\nWindow::Window() {\n    mThread = NULL;\n    mTimeout = 0;\n    initializeQtApp();\n\n    \/\/ Scaling GUI\n    QFont defaultFont = QApplication::font();\n    QDesktopWidget *desktop = QApplication::desktop();\n    int screenWidth = desktop->width();\n    if(defaultFont.pointSize() < 10 && screenWidth > 2000) {\n        if(screenWidth > 3000) {\n            \/\/ 4K screens\n            Reporter::info() << \"Large screen detected with width: \" << screenWidth << Reporter::end();\n            Reporter::info() << \"Scaling default font with factor 2\" << Reporter::end();\n            mGUIScalingFactor = 1.75;\n        } else {\n            Reporter::info() << \"Medium large screen detected with width: \" << screenWidth << Reporter::end();\n            Reporter::info() << \"Scaling default font with factor 1.5\" << Reporter::end();\n            mGUIScalingFactor = 1.5;\n        }\n    }\n    defaultFont.setPointSize((int)round(defaultFont.pointSize() * mGUIScalingFactor));\n    QApplication::setFont(defaultFont);\n\n\tmEventLoop = NULL;\n    mWidget = new WindowWidget;\n    mEventLoop = new QEventLoop(mWidget);\n    mWidget->connect(mWidget, SIGNAL(widgetHasClosed()), this, SLOT(stop()));\n    mWidget->setContentsMargins(0, 0, 0, 0);\n\n    \/\/ default window size\n    mWidth = 512;\n    mHeight = 512;\n    mFullscreen = false;\n    mMaximized = false;\n}\n\nvoid Window::enableFullscreen() {\n    mFullscreen = true;\n    disableMaximized();\n}\n\nvoid Window::disableFullscreen() {\n    mFullscreen = false;\n}\n\nvoid Window::enableMaximized() {\n    mMaximized = true;\n    disableFullscreen();\n}\n\nvoid Window::disableMaximized() {\n    mMaximized = false;\n}\n\nvoid Window::setTitle(std::string title) {\n    mWidget->setWindowTitle(title.c_str());\n}\n\nvoid Window::cleanup() {\n    \/\/delete QApplication::instance();\n}\n\nvoid Window::initializeQtApp() {\n    \/\/ Make sure only one QApplication is created\n    if(!QApplication::instance()) {\n        Reporter::info() << \"Creating new QApp\" << Reporter::end();\n        \/\/ Create some dummy argc and argv options as QApplication requires it\n        int* argc = new int[1];\n        *argc = 0;\n        QApplication* app = new FASTApplication(*argc,NULL);\n\n        \/\/ Set default window icon\n        QApplication::setWindowIcon(QIcon((Config::getDocumentationPath() + \"images\/fast_icon.png\").c_str()));\n\n         \/\/ Create computation GL context, if it doesn't exist\n        if(mMainGLContext == NULL) {\n            Reporter::info() << \"Creating new GL context for computation thread\" << Reporter::end();\n\n            \/\/ Create GL context to be shared with the CL contexts\n            QGLWidget* widget = new QGLWidget;\n            mMainGLContext = new QGLContext(QGLFormat::defaultFormat(), widget); \/\/ by including widget here the context becomes valid\n            mMainGLContext->create();\n            if(!mMainGLContext->isValid()) {\n                throw Exception(\"Qt GL context is invalid!\");\n            }\n        }\n    } else {\n        Reporter::info() << \"QApp already exists..\" << Reporter::end();\n    }\n\n    \/\/ There is a bug in AMD OpenCL related to comma (,) as decimal point\n    \/\/ This will change decimal point to dot (.)\n    struct lconv * lc;\n    lc = localeconv();\n    if(strcmp(lc->decimal_point, \",\") == 0) {\n        Reporter::warning() << \"Your system uses comma as decimal point.\" << Reporter::end();\n        Reporter::warning() << \"This will now be changed to dot to avoid any comma related bugs.\" << Reporter::end();\n        setlocale(LC_NUMERIC, \"C\");\n        \/\/ Check again to be sure\n        lc = localeconv();\n        if(strcmp(lc->decimal_point, \",\") == 0) {\n            throw Exception(\"Failed to convert decimal point to dot.\");\n        }\n    }\n}\n\n\nvoid Window::stop() {\n    reportInfo() << \"Stop signal recieved..\" << Reporter::end();\n    stopComputationThread();\n    if(mEventLoop != NULL)\n        mEventLoop->quit();\n    \/*\n    \/\/ Make sure event is not quit twice\n    if(!mWidget->getView()->hasQuit()) {\n        \/\/ This event occurs when window is closed or timeout is reached\n        mWidget->getView()->quit();\n    }\n    *\/\n}\n\nView* Window::createView() {\n    View* view = mWidget->addView();\n\n    return view;\n}\n\nvoid Window::start() {\n\n    QDesktopWidget *desktop = QApplication::desktop();\n    int screenWidth = desktop->width();\n    int screenHeight = desktop->height();\n\n    mWidget->resize(mWidth,mHeight);\n    if(mFullscreen) {\n        mWidget->showFullScreen();\n    } else if(mMaximized) {\n        \/\/mWidth = screenWidth;\n        \/\/mHeight = screenHeight;\n        mWidget->showMaximized();\n    } else {\n        \/\/ Move window to center\n        int x = (screenWidth - mWidth) \/ 2;\n        int y = (screenHeight - mHeight) \/ 2;\n        mWidget->move(x, y);\n        mWidget->show();\n    }\n\n    if(mTimeout > 0) {\n        QTimer* timer = new QTimer(mWidget);\n        timer->start(mTimeout);\n        timer->setSingleShot(true);\n        mWidget->connect(timer,SIGNAL(timeout()),mWidget,SLOT(close()));\n    }\n\n    startComputationThread();\n\n    mEventLoop->exec(); \/\/ This call blocks and starts rendering\n}\n\nWindow::~Window() {\n    \/\/ Cleanup\n    reportInfo() << \"Destroying window..\" << Reporter::end();\n    \/\/ Event loop is child of widget\n    \/\/reportInfo() << \"Deleting event loop\" << Reporter::end();\n    \/\/if(mEventLoop != NULL)\n    \/\/    delete mEventLoop;\n    reportInfo() << \"Deleting widget\" << Reporter::end();\n    if(mWidget != NULL) {\n        delete mWidget;\n        mWidget = NULL;\n    }\n    reportInfo() << \"Finished deleting window widget\" << Reporter::end();\n    if(mThread != NULL) {\n        mThread->stop();\n        delete mThread;\n        mThread = NULL;\n    }\n\n    reportInfo() << \"Window destroyed\" << Reporter::end();\n}\n\nvoid Window::setTimeout(unsigned int milliseconds) {\n    mTimeout = milliseconds;\n}\n\nQGLContext* Window::getMainGLContext() {\n    if(mMainGLContext == NULL) {\n        throw Exception(\"No OpenGL context created\");\n        \/\/initializeQtApp();\n    }\n\n    return mMainGLContext;\n}\n\nvoid Window::setMainGLContext(QGLContext* context) {\n    mMainGLContext = context;\n}\n\nvoid Window::startComputationThread() {\n    if(mThread == NULL) {\n        \/\/ Start computation thread using QThreads which is a strange thing, see https:\/\/mayaposch.wordpress.com\/2011\/11\/01\/how-to-really-truly-use-qthreads-the-full-explanation\/\n        reportInfo() << \"Trying to start computation thread\" << Reporter::end();\n        mThread = new ComputationThread(QThread::currentThread());\n        QThread* thread = new QThread();\n        mThread->moveToThread(thread);\n        connect(thread, SIGNAL(started()), mThread, SLOT(run()));\n        connect(mThread, SIGNAL(finished()), thread, SLOT(quit()));\n        \/\/connect(thread, SIGNAL(finished()), thread, SLOT(deleteLater()));\n\n        for(int i = 0; i < getViews().size(); i++)\n            mThread->addView(getViews()[i]);\n        QGLContext* mainGLContext = Window::getMainGLContext();\n        if(!mainGLContext->isValid()) {\n            throw Exception(\"QGL context is invalid!\");\n        }\n\n        mainGLContext->doneCurrent();\n        mainGLContext->moveToThread(thread);\n        thread->start();\n        reportInfo() << \"Computation thread started\" << Reporter::end();\n    }\n}\n\nvoid Window::stopComputationThread() {\n    reportInfo() << \"Trying to stop computation thread\" << Reporter::end();\n    if(mThread != NULL) {\n        mThread->stop();\n        delete mThread;\n        mThread = NULL;\n    }\n    reportInfo() << \"Computation thread stopped\" << Reporter::end();\n}\n\nstd::vector<View*> Window::getViews() const {\n    return mWidget->getViews();\n}\n\nView* Window::getView(uint i) const {\n    return mWidget->getViews().at(i);\n}\n\nvoid Window::setWidth(uint width) {\n    mWidth = width;\n}\n\nvoid Window::setHeight(uint height) {\n    mHeight = height;\n}\n\nvoid Window::setSize(uint width, uint height) {\n    setWidth(width);\n    setHeight(height);\n}\n\nfloat Window::getScalingFactor() const {\n    return mGUIScalingFactor;\n}\n\nint Window::getScreenWidth() const {\n    QDesktopWidget *desktop = QApplication::desktop();\n    return desktop->width();\n}\n\nint Window::getScreenHeight() const {\n    QDesktopWidget *desktop = QApplication::desktop();\n    return desktop->height();\n}\n\n} \/\/ end namespace fast\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <string>\n#include <algorithm>\n#include <sstream>\n\n#include <boost\/unordered_map.hpp>\n#include <boost\/assign\/list_of.hpp>\n\n#include <boost\/python.hpp>\n#include <boost\/python\/stl_iterator.hpp>\n\n\/\/ We intentionally omit numpy\/arrayobject.h here because cpp files need to be careful with exactly when this is imported.\n\/\/ http:\/\/docs.scipy.org\/doc\/numpy\/reference\/c-api.array.html#importing-the-api\n\/\/ Therefore, we assume the cpp file that included converters.hpp has already included numpy\/arrayobject.h\n\/\/ #include <numpy\/arrayobject.h>\n\n#include \"BinaryData.h\"\n#include \"DVIDException.h\"\n\nusing namespace boost::python;\n\nnamespace libdvid { namespace python {\n\n    \/\/*********************************************************************************************\n    \/\/* Helpers\n    \/\/*********************************************************************************************\n\n    \/\/! PyBinaryDataHolder is the Python wrapper class for the SmartPtrHolder<BinaryDataPtr> class.\n    \/\/! It is exposed here as a global so helper functions can use it to manage BinaryData objects.\n    \/\/! It must be assigned in the module init section (see libdvid_python.cpp).\n    boost::python::object PyBinaryDataHolder;\n    \n    template<class SmartPtr>\n    struct SmartPtrHolder\n    {\n        SmartPtrHolder() {}\n        SmartPtr ptr;\n    };\n    typedef SmartPtrHolder<libdvid::BinaryDataPtr> BinaryDataHolder;\n\n\n    \/\/*********************************************************************************************\n    \/\/*********************************************************************************************\n    \/\/* Python -> C++\n    \/\/*********************************************************************************************\n    \/\/*********************************************************************************************\n\n    \/\/!*********************************************************************************************\n    \/\/! This struct tells boost::python how to convert Python sequences into std::vector<T>.\n    \/\/! To use it, instantiate a single instance of it somewhere in your module init section:\n    \/\/!\n    \/\/!     libdvid::python::std_vector_from_python_iterable<unsigned int>();\n    \/\/!\n    \/\/! NOTE: This does NOT convert the other way, i.e. from std::vector<T> into Python list.\n    \/\/!      If you need to return a std::vector<T>, you'll have to implement that separately.\n    \/\/!\n    \/\/! For explanation and examples, see the following links:\n    \/\/! https:\/\/misspent.wordpress.com\/2009\/09\/27\/how-to-write-boost-python-converters\n    \/\/! http:\/\/www.boost.org\/doc\/libs\/1_39_0\/libs\/python\/doc\/v2\/faq.html#custom_string\n    \/\/!*********************************************************************************************\n    template <typename T>\n    struct std_vector_from_python_iterable\n    {\n        typedef std::vector<T> vector_t;\n    \n        std_vector_from_python_iterable()\n        {\n          converter::registry::push_back(\n              &convertible,\n              &construct,\n              type_id<vector_t>());\n        }\n    \n        \/\/ Determine if obj_ptr can be converted in a vector\n        static void* convertible(PyObject* obj_ptr)\n        {\n            if (!PySequence_Check(obj_ptr))\n            {\n                return 0;\n            }\n            return obj_ptr;\n        }\n    \n        \/\/ Convert obj_ptr into a vector\n        static void construct( PyObject* obj_ptr, converter::rvalue_from_python_stage1_data* data)\n        {\n            assert( PySequence_Check(obj_ptr) );\n    \n            \/\/ Grab pointer to memory into which to construct the new vector_t\n            void* storage = ((converter::rvalue_from_python_storage<vector_t>*) data)->storage.bytes;\n    \n            \/\/ in-place construct the new vector_t\n            vector_t * the_vector = new (storage) vector_t;\n    \n            \/\/ Now copy the data from python into the vector\n            typedef stl_input_iterator<T> vector_iter_t;\n            object obj = object(handle<>(borrowed(obj_ptr)));\n            the_vector->assign( vector_iter_t(obj), vector_iter_t()  );\n    \n            \/\/ Stash the memory chunk pointer for later use by boost::python\n            data->convertible = storage;\n        }\n    };\n\n    \/\/!*********************************************************************************************\n    \/\/! This converter auto-converts 'None' objects into empty std::strings.\n    \/\/!*********************************************************************************************\n    struct std_string_from_python_none\n    {\n        std_string_from_python_none()\n        {\n          converter::registry::push_back(\n              &convertible,\n              &construct,\n              type_id<std::string>());\n        }\n    \n        \/\/ Determine if obj_ptr is None\n        static void* convertible(PyObject* obj_ptr)\n        {\n            if (obj_ptr == Py_None)\n            {\n                return obj_ptr;\n            }\n            return 0;\n        }\n    \n        \/\/ Convert obj_ptr into a std::string\n        static void construct( PyObject* obj_ptr, converter::rvalue_from_python_stage1_data* data)\n        {\n            assert (obj_ptr == Py_None);\n    \n            \/\/ Grab pointer to memory into which to construct the std::string\n            void* storage = ((converter::rvalue_from_python_storage<std::string>*) data)->storage.bytes;\n    \n            \/\/ in-place construct the new std::string\n            \/\/ extraced from the python object\n            new (storage) std::string;\n        \n            \/\/ Stash the memory chunk pointer for later use by boost.python\n            data->convertible = storage;\n        }\n    };\n\n    \/\/!*********************************************************************************************\n    \/\/! This helper struct is specialized over integer types to provide a\n    \/\/! compile-time mapping from integer types to numpy typenumbers.\n    \/\/!*********************************************************************************************\n    template <typename T> struct numpy_typenums {};\n    template <> struct numpy_typenums<libdvid::uint8> { static const int typenum = NPY_UINT8; };\n    template <> struct numpy_typenums<libdvid::uint64> { static const int typenum = NPY_UINT64; };\n\n    \/\/!*********************************************************************************************\n    \/\/! Declares a mapping between numpy typenumbers and the corresponding dtype names\n    \/\/!*********************************************************************************************\n    static boost::unordered_map<int, std::string> dtype_names =\n        boost::assign::map_list_of\n        (NPY_UINT8, \"uint8\")\n        (NPY_UINT64, \"uint64\");\n\n    \/\/!*********************************************************************************************\n    \/\/! Converts the given numpy ndarray object into a DVIDVoxels object.\n    \/\/! NOTE: The data from the ndarray is *copied* into the new DVIDVoxels object.\n    \/\/!*********************************************************************************************\n    template <class VolumeType>\n    struct ndarray_to_volume\n    {\n        ndarray_to_volume()\n        {\n          converter::registry::push_back( &convertible, &construct, type_id<VolumeType>() );\n          converter::registry::push_back( &convertible, &construct, type_id<VolumeType&>() );\n        }\n    \n        static void* convertible(PyObject* obj_ptr)\n        {\n            if (!PyArray_Check(obj_ptr))\n            {\n                return 0;\n            }\n            \/\/ We could also check shape, dtype, etc. here, but it's more helpful to \n            \/\/ wait until construction time, and then throw a specific exception to\n            \/\/ tell the user what he did wrong.\n            return obj_ptr;\n        }\n\n        static void construct( PyObject* obj_ptr, converter::rvalue_from_python_stage1_data* data)\n        {\n            using namespace boost::python;\n            using namespace libdvid;\n\n            assert(PyArray_Check(obj_ptr));\n    \n            typedef typename VolumeType::voxel_type voxel_type;\n    \n            object ndarray = object(handle<>(borrowed(obj_ptr)));\n            \n            \/\/ Verify ndarray.dtype\n            std::string dtype = extract<std::string>(str(ndarray.attr(\"dtype\")));\n            const int numpy_typenum = numpy_typenums<voxel_type>::typenum;\n            if (dtype != dtype_names[numpy_typenum])\n            {\n                std::ostringstream ssMsg;\n                ssMsg << \"Volume has wrong dtype.  Expected \" << dtype_names[numpy_typenum] << \", got \" << dtype;\n                throw ErrMsg(ssMsg.str());\n            }\n    \n            \/\/ Verify ndarray dimensionality.\n            int ndarray_ndim = extract<int>(ndarray.attr(\"ndim\"));\n            if (ndarray_ndim != VolumeType::num_dims)\n            {\n                std::string shape = extract<std::string>(str(ndarray.attr(\"shape\")));\n                std::ostringstream ssMsg;\n                ssMsg << \"Volume is not exactly \" << VolumeType::num_dims << \"D.  Shape is \" << shape;\n                throw ErrMsg( ssMsg.str() );\n            }\n\n            \/\/ Verify ndarray memory order\n            if (!ndarray.attr(\"flags\")[\"C_CONTIGUOUS\"])\n            {\n                throw ErrMsg(\"Volume is not C_CONTIGUOUS\");\n            }\n    \n            \/\/ Extract dims from ndarray.shape\n            object shape = ndarray.attr(\"shape\");\n            typedef stl_input_iterator<Dims_t::value_type> shape_iter_t;\n            Dims_t dims;\n            dims.assign( shape_iter_t(shape), shape_iter_t() );\n    \n            \/\/ Extract the voxel count\n            int voxel_count = extract<int>(ndarray.attr(\"size\"));\n    \n            \/\/ Obtain a pointer to the array's data\n            PyArrayObject * array_object = reinterpret_cast<PyArrayObject *>( ndarray.ptr() );\n            voxel_type const * voxel_data = static_cast<voxel_type const *>( PyArray_DATA(array_object) );\n\n            \/\/ Grab pointer to memory into which to construct the DVIDVoxels\n            void* storage = ((converter::rvalue_from_python_storage<VolumeType>*) data)->storage.bytes;\n\n            \/\/ Create DVIDVoxels<> from ndarray data using \"in-place\" new().\n            \/\/ FIXME: The DVIDVoxels constructor copies the data. Is that really necessary?\n            VolumeType * volume = new (storage) VolumeType( voxel_data, voxel_count, dims );\n\n            \/\/ Stash the memory chunk pointer for later use by boost.python\n            data->convertible = storage;\n        }\n    };\n\n    \/\/!*********************************************************************************************\n    \/\/! Convert Python buffer objects (e.g. str, bytearray) -> BinaryDataPtr\n    \/\/!*********************************************************************************************\n    struct binary_data_ptr_from_python_buffer\n    {\n        binary_data_ptr_from_python_buffer()\n        {\n          converter::registry::push_back(\n              &convertible,\n              &construct,\n              type_id<BinaryDataPtr>());\n        }\n\n        static void* convertible(PyObject* obj_ptr)\n        {\n            \/\/ The \"proper\" thing here would be to check if this object is a buffer,\n            \/\/ but I think it's more helpful to the user if we check inside construct()\n            \/\/ and raise a descriptive exception if they tried to supply a non-buffer.\n\n            \/\/ return PyObject_CheckBuffer(obj_ptr) ? obj_ptr : 0;\n\n            return obj_ptr;\n        }\n\n        static void construct( PyObject* obj_ptr, converter::rvalue_from_python_stage1_data* data)\n        {\n            using namespace libdvid;\n            using namespace boost::python;\n\n            BinaryDataPtr binary_data;\n            if (obj_ptr == Py_None)\n            {\n                \/\/ As a special convenience, we auto-convert None to an empty buffer.\n                binary_data = BinaryData::create_binary_data();\n            }\n            else\n            {\n                if (!PyObject_CheckBuffer(obj_ptr))\n                {\n                    std::string value_str = extract<std::string>(str(object(handle<>(borrowed(obj_ptr)))));\n                    throw ErrMsg(\"Value is not a buffer: \" + value_str);\n                }\n                Py_buffer py_buffer;\n                PyObject_GetBuffer(obj_ptr, &py_buffer, PyBUF_SIMPLE);\n\n                \/\/ Copy buffer into BinaryData\n                binary_data = BinaryData::create_binary_data(static_cast<char*>(py_buffer.buf), py_buffer.len);\n                PyBuffer_Release(&py_buffer);\n            }\n\n            \/\/ Grab pointer to memory into which to construct the BinaryDataPtr\n            void* storage = ((converter::rvalue_from_python_storage<BinaryDataPtr>*) data)->storage.bytes;\n\n            \/\/ in-place construct the new std::string\n            \/\/ extraced from the python object\n            new (storage) BinaryDataPtr(binary_data);\n\n            \/\/ Stash the memory chunk pointer for later use by boost.python\n            data->convertible = storage;\n        }\n    };\n\n    \/\/*********************************************************************************************\n    \/\/*********************************************************************************************\n    \/\/* C++ -> Python\n    \/\/*********************************************************************************************\n    \/\/*********************************************************************************************\n\n    \/\/!*********************************************************************************************\n    \/\/! This converts BinaryDataPtr objects into Python strings.\n    \/\/! NOTE: It copies the data.\n    \/\/!*********************************************************************************************\n    struct binary_data_ptr_to_python_str\n    {\n        static PyObject* convert(BinaryDataPtr const& binary_data)\n        {\n            return PyString_FromStringAndSize( binary_data->get_data().c_str(), binary_data->get_data().size() );\n        }\n    };\n    \n    \/\/!*********************************************************************************************\n    \/\/! Converts the given DVIDVoxels object into a numpy array.\n    \/\/! NOTE:The ndarray will *steal* the data from the DVIDVoxels object.\n    \/\/!*********************************************************************************************\n    template <class VolumeType> \/\/ VolumeType must be some DVIDVoxels<T, N>\n    struct volume_to_ndarray\n    {\n        static PyObject* convert( VolumeType volume )\n        {\n            using namespace boost::python;\n            using namespace libdvid;\n    \n            typedef typename VolumeType::voxel_type voxel_type;\n    \n            BinaryDataPtr volume_data = volume.get_binary();\n    \n            \/\/ Wrap the BinaryData in a BinaryDataHolder object,\n            \/\/ which is managed via Python's reference counting scheme.\n            object py_managed_bd = PyBinaryDataHolder();\n            BinaryDataHolder & holder = extract<BinaryDataHolder&>(py_managed_bd);\n            holder.ptr = volume_data;\n    \n            \/\/ Copy dims to type numpy expects.\n            std::vector<npy_intp> numpy_dims( volume.get_dims().begin(), volume.get_dims().end() );\n    \n            \/\/ We will create a new array with the data from the existing PyBinaryData object (no copy).\n            \/\/ The basic idea is described in the following link, but can get away with a lot less code\n            \/\/ because boost-python already defined the new Python type for us (PyBinaryData).\n            \/\/ Also, this post is old so the particular API we're using here is slightly different.\n            \/\/ http:\/\/blog.enthought.com\/python\/numpy-arrays-with-pre-allocated-memory\/\n            void const * raw_data = static_cast<void const*>(volume_data->get_raw());\n            PyObject * array_object = PyArray_SimpleNewFromData( numpy_dims.size(),\n                                                                 &numpy_dims[0],\n                                                                 numpy_typenums<voxel_type>::typenum,\n                                                                 const_cast<void*>(raw_data) );\n            if (!array_object)\n            {\n                throw ErrMsg(\"Failed to create array from BinaryData!\");\n            }\n            PyArrayObject * ndarray = reinterpret_cast<PyArrayObject *>( array_object );\n    \n            \/\/ As described in the link above, assigning the 'base' pointer here ensures\n            \/\/  that the memory is deallocated when the user is done with the ndarray.\n            int status = PyArray_SetBaseObject(ndarray, py_managed_bd.ptr());\n            if (status != 0)\n            {\n                throw ErrMsg(\"Failed to set array base object!\");\n            }\n            \/\/ PyArray_SetBaseObject *steals* the reference, so we need to INCREF here\n            \/\/  to make sure the binary data object isn't destroyed when we return.\n            incref(py_managed_bd.ptr());\n    \n            \/\/ Return the new array.\n            return array_object;\n        }\n    };\n\n    \/\/!*********************************************************************************************\n    \/\/! This converts Json::Value objects into python dict objects.\n    \/\/! NOTE: This isn't an efficient conversion method.\n    \/\/!*********************************************************************************************\n    struct json_value_to_dict\n    {\n        static PyObject* convert(Json::Value const & json_value)\n        {\n            using namespace boost::python;\n\n            \/\/ For now, easiest thing to do is just export as\n            \/\/  string and re-parse via python's json module.\n            std::ostringstream ss;\n            ss << json_value;\n\n            object json = import(\"json\");\n            return incref(json.attr(\"loads\")( ss.str() ).ptr());\n        }\n    };\n    \n}} \/\/ namespace libdvid::python\n<commit_msg>python: Corrected a comment.<commit_after>#include <vector>\n#include <string>\n#include <algorithm>\n#include <sstream>\n\n#include <boost\/unordered_map.hpp>\n#include <boost\/assign\/list_of.hpp>\n\n#include <boost\/python.hpp>\n#include <boost\/python\/stl_iterator.hpp>\n\n\/\/ We intentionally omit numpy\/arrayobject.h here because cpp files need to be careful with exactly when this is imported.\n\/\/ http:\/\/docs.scipy.org\/doc\/numpy\/reference\/c-api.array.html#importing-the-api\n\/\/ Therefore, we assume the cpp file that included converters.hpp has already included numpy\/arrayobject.h\n\/\/ #include <numpy\/arrayobject.h>\n\n#include \"BinaryData.h\"\n#include \"DVIDException.h\"\n\nusing namespace boost::python;\n\nnamespace libdvid { namespace python {\n\n    \/\/*********************************************************************************************\n    \/\/* Helpers\n    \/\/*********************************************************************************************\n\n    \/\/! PyBinaryDataHolder is the Python wrapper class for the SmartPtrHolder<BinaryDataPtr> class.\n    \/\/! It is exposed here as a global so helper functions can use it to manage BinaryData objects.\n    \/\/! It must be assigned in the module init section (see libdvid_python.cpp).\n    boost::python::object PyBinaryDataHolder;\n    \n    template<class SmartPtr>\n    struct SmartPtrHolder\n    {\n        SmartPtrHolder() {}\n        SmartPtr ptr;\n    };\n    typedef SmartPtrHolder<libdvid::BinaryDataPtr> BinaryDataHolder;\n\n\n    \/\/*********************************************************************************************\n    \/\/*********************************************************************************************\n    \/\/* Python -> C++\n    \/\/*********************************************************************************************\n    \/\/*********************************************************************************************\n\n    \/\/!*********************************************************************************************\n    \/\/! This struct tells boost::python how to convert Python sequences into std::vector<T>.\n    \/\/! To use it, instantiate a single instance of it somewhere in your module init section:\n    \/\/!\n    \/\/!     libdvid::python::std_vector_from_python_iterable<unsigned int>();\n    \/\/!\n    \/\/! NOTE: This does NOT convert the other way, i.e. from std::vector<T> into Python list.\n    \/\/!      If you need to return a std::vector<T>, you'll have to implement that separately.\n    \/\/!\n    \/\/! For explanation and examples, see the following links:\n    \/\/! https:\/\/misspent.wordpress.com\/2009\/09\/27\/how-to-write-boost-python-converters\n    \/\/! http:\/\/www.boost.org\/doc\/libs\/1_39_0\/libs\/python\/doc\/v2\/faq.html#custom_string\n    \/\/!*********************************************************************************************\n    template <typename T>\n    struct std_vector_from_python_iterable\n    {\n        typedef std::vector<T> vector_t;\n    \n        std_vector_from_python_iterable()\n        {\n          converter::registry::push_back(\n              &convertible,\n              &construct,\n              type_id<vector_t>());\n        }\n    \n        \/\/ Determine if obj_ptr can be converted in a vector\n        static void* convertible(PyObject* obj_ptr)\n        {\n            if (!PySequence_Check(obj_ptr))\n            {\n                return 0;\n            }\n            return obj_ptr;\n        }\n    \n        \/\/ Convert obj_ptr into a vector\n        static void construct( PyObject* obj_ptr, converter::rvalue_from_python_stage1_data* data)\n        {\n            assert( PySequence_Check(obj_ptr) );\n    \n            \/\/ Grab pointer to memory into which to construct the new vector_t\n            void* storage = ((converter::rvalue_from_python_storage<vector_t>*) data)->storage.bytes;\n    \n            \/\/ in-place construct the new vector_t\n            vector_t * the_vector = new (storage) vector_t;\n    \n            \/\/ Now copy the data from python into the vector\n            typedef stl_input_iterator<T> vector_iter_t;\n            object obj = object(handle<>(borrowed(obj_ptr)));\n            the_vector->assign( vector_iter_t(obj), vector_iter_t()  );\n    \n            \/\/ Stash the memory chunk pointer for later use by boost::python\n            data->convertible = storage;\n        }\n    };\n\n    \/\/!*********************************************************************************************\n    \/\/! This converter auto-converts 'None' objects into empty std::strings.\n    \/\/!*********************************************************************************************\n    struct std_string_from_python_none\n    {\n        std_string_from_python_none()\n        {\n          converter::registry::push_back(\n              &convertible,\n              &construct,\n              type_id<std::string>());\n        }\n    \n        \/\/ Determine if obj_ptr is None\n        static void* convertible(PyObject* obj_ptr)\n        {\n            if (obj_ptr == Py_None)\n            {\n                return obj_ptr;\n            }\n            return 0;\n        }\n    \n        \/\/ Convert obj_ptr into a std::string\n        static void construct( PyObject* obj_ptr, converter::rvalue_from_python_stage1_data* data)\n        {\n            assert (obj_ptr == Py_None);\n    \n            \/\/ Grab pointer to memory into which to construct the std::string\n            void* storage = ((converter::rvalue_from_python_storage<std::string>*) data)->storage.bytes;\n    \n            \/\/ in-place construct the new std::string\n            \/\/ extraced from the python object\n            new (storage) std::string;\n        \n            \/\/ Stash the memory chunk pointer for later use by boost.python\n            data->convertible = storage;\n        }\n    };\n\n    \/\/!*********************************************************************************************\n    \/\/! This helper struct is specialized over integer types to provide a\n    \/\/! compile-time mapping from integer types to numpy typenumbers.\n    \/\/!*********************************************************************************************\n    template <typename T> struct numpy_typenums {};\n    template <> struct numpy_typenums<libdvid::uint8> { static const int typenum = NPY_UINT8; };\n    template <> struct numpy_typenums<libdvid::uint64> { static const int typenum = NPY_UINT64; };\n\n    \/\/!*********************************************************************************************\n    \/\/! Declares a mapping between numpy typenumbers and the corresponding dtype names\n    \/\/!*********************************************************************************************\n    static boost::unordered_map<int, std::string> dtype_names =\n        boost::assign::map_list_of\n        (NPY_UINT8, \"uint8\")\n        (NPY_UINT64, \"uint64\");\n\n    \/\/!*********************************************************************************************\n    \/\/! Converts the given numpy ndarray object into a DVIDVoxels object.\n    \/\/! NOTE: The data from the ndarray is *copied* into the new DVIDVoxels object.\n    \/\/!*********************************************************************************************\n    template <class VolumeType>\n    struct ndarray_to_volume\n    {\n        ndarray_to_volume()\n        {\n          converter::registry::push_back( &convertible, &construct, type_id<VolumeType>() );\n          converter::registry::push_back( &convertible, &construct, type_id<VolumeType&>() );\n        }\n    \n        static void* convertible(PyObject* obj_ptr)\n        {\n            if (!PyArray_Check(obj_ptr))\n            {\n                return 0;\n            }\n            \/\/ We could also check shape, dtype, etc. here, but it's more helpful to \n            \/\/ wait until construction time, and then throw a specific exception to\n            \/\/ tell the user what he did wrong.\n            return obj_ptr;\n        }\n\n        static void construct( PyObject* obj_ptr, converter::rvalue_from_python_stage1_data* data)\n        {\n            using namespace boost::python;\n            using namespace libdvid;\n\n            assert(PyArray_Check(obj_ptr));\n    \n            typedef typename VolumeType::voxel_type voxel_type;\n    \n            object ndarray = object(handle<>(borrowed(obj_ptr)));\n            \n            \/\/ Verify ndarray.dtype\n            std::string dtype = extract<std::string>(str(ndarray.attr(\"dtype\")));\n            const int numpy_typenum = numpy_typenums<voxel_type>::typenum;\n            if (dtype != dtype_names[numpy_typenum])\n            {\n                std::ostringstream ssMsg;\n                ssMsg << \"Volume has wrong dtype.  Expected \" << dtype_names[numpy_typenum] << \", got \" << dtype;\n                throw ErrMsg(ssMsg.str());\n            }\n    \n            \/\/ Verify ndarray dimensionality.\n            int ndarray_ndim = extract<int>(ndarray.attr(\"ndim\"));\n            if (ndarray_ndim != VolumeType::num_dims)\n            {\n                std::string shape = extract<std::string>(str(ndarray.attr(\"shape\")));\n                std::ostringstream ssMsg;\n                ssMsg << \"Volume is not exactly \" << VolumeType::num_dims << \"D.  Shape is \" << shape;\n                throw ErrMsg( ssMsg.str() );\n            }\n\n            \/\/ Verify ndarray memory order\n            if (!ndarray.attr(\"flags\")[\"C_CONTIGUOUS\"])\n            {\n                throw ErrMsg(\"Volume is not C_CONTIGUOUS\");\n            }\n    \n            \/\/ Extract dims from ndarray.shape\n            object shape = ndarray.attr(\"shape\");\n            typedef stl_input_iterator<Dims_t::value_type> shape_iter_t;\n            Dims_t dims;\n            dims.assign( shape_iter_t(shape), shape_iter_t() );\n    \n            \/\/ Extract the voxel count\n            int voxel_count = extract<int>(ndarray.attr(\"size\"));\n    \n            \/\/ Obtain a pointer to the array's data\n            PyArrayObject * array_object = reinterpret_cast<PyArrayObject *>( ndarray.ptr() );\n            voxel_type const * voxel_data = static_cast<voxel_type const *>( PyArray_DATA(array_object) );\n\n            \/\/ Grab pointer to memory into which to construct the DVIDVoxels\n            void* storage = ((converter::rvalue_from_python_storage<VolumeType>*) data)->storage.bytes;\n\n            \/\/ Create DVIDVoxels<> from ndarray data using \"in-place\" new().\n            \/\/ FIXME: The DVIDVoxels constructor copies the data. Is that really necessary?\n            VolumeType * volume = new (storage) VolumeType( voxel_data, voxel_count, dims );\n\n            \/\/ Stash the memory chunk pointer for later use by boost.python\n            data->convertible = storage;\n        }\n    };\n\n    \/\/!*********************************************************************************************\n    \/\/! Convert Python buffer objects (e.g. str, bytearray) -> BinaryDataPtr\n    \/\/!*********************************************************************************************\n    struct binary_data_ptr_from_python_buffer\n    {\n        binary_data_ptr_from_python_buffer()\n        {\n          converter::registry::push_back(\n              &convertible,\n              &construct,\n              type_id<BinaryDataPtr>());\n        }\n\n        static void* convertible(PyObject* obj_ptr)\n        {\n            \/\/ The \"proper\" thing here would be to check if this object is a buffer,\n            \/\/ but I think it's more helpful to the user if we check inside construct()\n            \/\/ and raise a descriptive exception if they tried to supply a non-buffer.\n\n            \/\/ return PyObject_CheckBuffer(obj_ptr) ? obj_ptr : 0;\n\n            return obj_ptr;\n        }\n\n        static void construct( PyObject* obj_ptr, converter::rvalue_from_python_stage1_data* data)\n        {\n            using namespace libdvid;\n            using namespace boost::python;\n\n            BinaryDataPtr binary_data;\n            if (obj_ptr == Py_None)\n            {\n                \/\/ As a special convenience, we auto-convert None to an empty buffer.\n                binary_data = BinaryData::create_binary_data();\n            }\n            else\n            {\n                if (!PyObject_CheckBuffer(obj_ptr))\n                {\n                    std::string value_str = extract<std::string>(str(object(handle<>(borrowed(obj_ptr)))));\n                    throw ErrMsg(\"Value is not a buffer: \" + value_str);\n                }\n                Py_buffer py_buffer;\n                PyObject_GetBuffer(obj_ptr, &py_buffer, PyBUF_SIMPLE);\n\n                \/\/ Copy buffer into BinaryData\n                binary_data = BinaryData::create_binary_data(static_cast<char*>(py_buffer.buf), py_buffer.len);\n                PyBuffer_Release(&py_buffer);\n            }\n\n            \/\/ Grab pointer to memory into which to construct the BinaryDataPtr\n            void* storage = ((converter::rvalue_from_python_storage<BinaryDataPtr>*) data)->storage.bytes;\n\n            \/\/ in-place construct the new std::string\n            \/\/ extraced from the python object\n            new (storage) BinaryDataPtr(binary_data);\n\n            \/\/ Stash the memory chunk pointer for later use by boost.python\n            data->convertible = storage;\n        }\n    };\n\n    \/\/*********************************************************************************************\n    \/\/*********************************************************************************************\n    \/\/* C++ -> Python\n    \/\/*********************************************************************************************\n    \/\/*********************************************************************************************\n\n    \/\/!*********************************************************************************************\n    \/\/! This converts BinaryDataPtr objects into Python strings.\n    \/\/! NOTE: It copies the data.\n    \/\/!*********************************************************************************************\n    struct binary_data_ptr_to_python_str\n    {\n        static PyObject* convert(BinaryDataPtr const& binary_data)\n        {\n            return PyString_FromStringAndSize( binary_data->get_data().c_str(), binary_data->get_data().size() );\n        }\n    };\n    \n    \/\/!*********************************************************************************************\n    \/\/! Converts the given DVIDVoxels object into a numpy array.\n    \/\/! NOTE:The ndarray will *steal* the data from the DVIDVoxels object.\n    \/\/!*********************************************************************************************\n    template <class VolumeType> \/\/ VolumeType must be some DVIDVoxels<T, N>\n    struct volume_to_ndarray\n    {\n        static PyObject* convert( VolumeType volume )\n        {\n            using namespace boost::python;\n            using namespace libdvid;\n    \n            typedef typename VolumeType::voxel_type voxel_type;\n    \n            BinaryDataPtr volume_data = volume.get_binary();\n    \n            \/\/ Wrap the BinaryData in a BinaryDataHolder object,\n            \/\/ which is managed via Python's reference counting scheme.\n            object py_managed_bd = PyBinaryDataHolder();\n            BinaryDataHolder & holder = extract<BinaryDataHolder&>(py_managed_bd);\n            holder.ptr = volume_data;\n    \n            \/\/ Copy dims to type numpy expects.\n            std::vector<npy_intp> numpy_dims( volume.get_dims().begin(), volume.get_dims().end() );\n    \n            \/\/ We will create a new array with the data from the existing PyBinaryDataHolder object (no copy).\n            \/\/ The basic idea is described in the following link, but can get away with a lot less code\n            \/\/ because we used boost-python to define the Python type (PyBinaryDataHolder).\n            \/\/ (Note: this post is old, so the particular API we're using here is slightly different.)\n            \/\/ http:\/\/blog.enthought.com\/python\/numpy-arrays-with-pre-allocated-memory\n            void const * raw_data = static_cast<void const*>(volume_data->get_raw());\n            PyObject * array_object = PyArray_SimpleNewFromData( numpy_dims.size(),\n                                                                 &numpy_dims[0],\n                                                                 numpy_typenums<voxel_type>::typenum,\n                                                                 const_cast<void*>(raw_data) );\n            if (!array_object)\n            {\n                throw ErrMsg(\"Failed to create array from BinaryData!\");\n            }\n            PyArrayObject * ndarray = reinterpret_cast<PyArrayObject *>( array_object );\n    \n            \/\/ As described in the link above, assigning the 'base' pointer here ensures\n            \/\/  that the memory is deallocated when the user is done with the ndarray.\n            int status = PyArray_SetBaseObject(ndarray, py_managed_bd.ptr());\n            if (status != 0)\n            {\n                throw ErrMsg(\"Failed to set array base object!\");\n            }\n            \/\/ PyArray_SetBaseObject *steals* the reference, so we need to INCREF here\n            \/\/  to make sure the binary data object isn't destroyed when we return.\n            incref(py_managed_bd.ptr());\n    \n            \/\/ Return the new array.\n            return array_object;\n        }\n    };\n\n    \/\/!*********************************************************************************************\n    \/\/! This converts Json::Value objects into python dict objects.\n    \/\/! NOTE: This isn't an efficient conversion method.\n    \/\/!*********************************************************************************************\n    struct json_value_to_dict\n    {\n        static PyObject* convert(Json::Value const & json_value)\n        {\n            using namespace boost::python;\n\n            \/\/ For now, easiest thing to do is just export as\n            \/\/  string and re-parse via python's json module.\n            std::ostringstream ss;\n            ss << json_value;\n\n            object json = import(\"json\");\n            return incref(json.attr(\"loads\")( ss.str() ).ptr());\n        }\n    };\n    \n}} \/\/ namespace libdvid::python\n<|endoftext|>"}
{"text":"<commit_before>#include \"libmemcached\/memcached.h\"\n#include <string.h>\n#include <stdio.h>\n\n#include <string>\n\nclass Memcached\n{\n  memcached_st memc;\n  memcached_result_st result;\n\npublic:\n\n  Memcached() \n    : \n      memc(),\n      result()\n  {\n    memcached_create(&memc);\n  }\n\n  Memcached(memcached_st *clone) \n    : \n      memc(),\n      result()\n  {\n    memcached_clone(&memc, clone);\n  }\n\n  ~Memcached()\n  {\n    memcached_free(&memc);\n  }\n\n  std::string fetch(const std::string& key, size_t *key_length, size_t *value_length)\n  {\n    uint32_t flags;\n    memcached_return rc;\n    std::string ret_val;\n\n    char *value= memcached_fetch(&memc, const_cast<char *>(key.c_str()), key_length,\n                                 value_length, &flags, &rc);\n    if (value)\n    {\n      ret_val.assign(value);\n    }\n    return ret_val;\n  }\n\n  std::string get(const std::string& key, size_t *value_length)\n  {\n    uint32_t flags;\n    memcached_return rc;\n    std::string ret_val;\n\n    char *value= memcached_get(&memc, key.c_str(), key.length(),\n                               value_length, &flags, &rc);\n    if (value)\n    {\n      ret_val.assign(value);\n    }\n    return ret_val;\n  }\n\n  std::string get_by_key(const std::string& master_key, \n                   const std::string& key, \n                   size_t *value_length)\n  {\n    uint32_t flags;\n    memcached_return rc;\n    std::string ret_val;\n\n    char *value= memcached_get_by_key(&memc, master_key.c_str(), master_key.length(), \n                                      key.c_str(), key.length(),\n                                      value_length, &flags, &rc);\n    if (value)\n    {\n      ret_val.assign(value);\n    }\n    return ret_val;\n  }\n\n  memcached_return mget(char **keys, size_t *key_length, \n                        unsigned int number_of_keys)\n  {\n\n    return memcached_mget(&memc, keys, key_length, number_of_keys);\n  }\n\n  bool set(const std::string& key, const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_set(&memc, key.c_str(), key.length(),\n                                       value, value_length,\n                                       time_t(0), uint32_t(0));\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool set_by_key(const std::string& master_key, \n                  const std::string& key, \n                  const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_set_by_key(&memc, master_key.c_str(), \n                                              master_key.length(),\n                                              key.c_str(), key.length(),\n                                              value, value_length,\n                                              time_t(0),\n                                              uint32_t(0));\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool increment(const std::string& key, unsigned int offset, uint64_t *value)\n  {\n    memcached_return rc= memcached_increment(&memc, key.c_str(), key.length(),\n                                             offset, value);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool decrement(const char *key, unsigned int offset, uint64_t *value)\n  {\n    memcached_return rc= memcached_decrement(&memc, key, strlen(key),\n                                             offset, value);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n\n  bool add(const char *key, const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_add(&memc, key, strlen(key), value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool add_by_key(const char *master_key, const char *key, \n                  const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_add_by_key(&memc, master_key, strlen(master_key),\n                                              key, strlen(key),\n                                              value, value_length,\n                                              0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool replace(const char *key, const char *value, \n               size_t value_length)\n  {\n    memcached_return rc= memcached_replace(&memc, key, strlen(key),\n                                           value, value_length,\n                                           0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool replace_by_key(const char *master_key, const char *key, \n                      const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_replace_by_key(&memc, master_key, strlen(master_key),\n                                                  key, strlen(key),\n                                                  value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool prepend(const char *key, const char *value, \n               size_t value_length)\n  {\n    memcached_return rc= memcached_prepend(&memc, key, strlen(key),\n                                           value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool prepend_by_key(const char *master_key, const char *key, \n                      const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_prepend_by_key(&memc, master_key, strlen(master_key),\n                                                  key, strlen(key),\n                                                  value, value_length,\n                                                  0,\n                                                  0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool append(const char *key, const char *value, \n              size_t value_length)\n  {\n    memcached_return rc= memcached_append(&memc, key, strlen(key),\n                                          value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool append_by_key(const char *master_key, const char *key, \n                     const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_append_by_key(&memc,\n                                                 master_key, strlen(master_key),\n                                                 key, strlen(key),\n                                                 value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool cas(const char *key, const char *value, \n           size_t value_length, uint64_t cas_arg)\n  {\n    memcached_return rc= memcached_cas(&memc, key, strlen(key),\n                                       value, value_length, 0, 0, cas_arg);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool cas_by_key(const char *master_key, const char *key, \n                  const char *value, size_t value_length, \n                  uint64_t cas_arg)\n  {\n    memcached_return rc= memcached_cas_by_key(&memc,\n                                              master_key, strlen(master_key),\n                                              key, strlen(key),\n                                              value, value_length,\n                                              0, 0, cas_arg);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  \/\/ using 'remove' vs. 'delete' since 'delete' is a keyword \n  bool remove(const std::string& key)\n  {\n    memcached_return rc= memcached_delete(&memc, key.c_str(), key.length(), 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool delete_by_key(const char *master_key, const char *key)\n  {\n    memcached_return rc= memcached_delete_by_key(&memc, master_key, strlen(master_key),\n                                                 key, strlen(key), 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n};\n<commit_msg>Removing un-needed include declaration from C++ interface.<commit_after>#include \"libmemcached\/memcached.h\"\n#include <string.h>\n\n#include <string>\n\nclass Memcached\n{\n  memcached_st memc;\n  memcached_result_st result;\n\npublic:\n\n  Memcached() \n    : \n      memc(),\n      result()\n  {\n    memcached_create(&memc);\n  }\n\n  Memcached(memcached_st *clone) \n    : \n      memc(),\n      result()\n  {\n    memcached_clone(&memc, clone);\n  }\n\n  ~Memcached()\n  {\n    memcached_free(&memc);\n  }\n\n  std::string fetch(const std::string& key, size_t *key_length, size_t *value_length)\n  {\n    uint32_t flags;\n    memcached_return rc;\n    std::string ret_val;\n\n    char *value= memcached_fetch(&memc, const_cast<char *>(key.c_str()), key_length,\n                                 value_length, &flags, &rc);\n    if (value)\n    {\n      ret_val.assign(value);\n    }\n    return ret_val;\n  }\n\n  std::string get(const std::string& key, size_t *value_length) \n  {\n    uint32_t flags;\n    memcached_return rc;\n    std::string ret_val;\n\n    char *value= memcached_get(&memc, key.c_str(), key.length(),\n                               value_length, &flags, &rc);\n    if (value)\n    {\n      ret_val.assign(value);\n    }\n    return ret_val;\n  }\n\n  std::string get_by_key(const std::string& master_key, \n                         const std::string& key, \n                         size_t *value_length)\n  {\n    uint32_t flags;\n    memcached_return rc;\n    std::string ret_val;\n\n    char *value= memcached_get_by_key(&memc, master_key.c_str(), master_key.length(), \n                                      key.c_str(), key.length(),\n                                      value_length, &flags, &rc);\n    if (value)\n    {\n      ret_val.assign(value);\n    }\n    return ret_val;\n  }\n\n  memcached_return mget(char **keys, size_t *key_length, \n                        unsigned int number_of_keys)\n  {\n\n    return memcached_mget(&memc, keys, key_length, number_of_keys);\n  }\n\n  bool set(const std::string& key, const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_set(&memc, key.c_str(), key.length(),\n                                       value, value_length,\n                                       time_t(0), uint32_t(0));\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool set_by_key(const std::string& master_key, \n                  const std::string& key, \n                  const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_set_by_key(&memc, master_key.c_str(), \n                                              master_key.length(),\n                                              key.c_str(), key.length(),\n                                              value, value_length,\n                                              time_t(0),\n                                              uint32_t(0));\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool increment(const std::string& key, unsigned int offset, uint64_t *value)\n  {\n    memcached_return rc= memcached_increment(&memc, key.c_str(), key.length(),\n                                             offset, value);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool decrement(const char *key, unsigned int offset, uint64_t *value)\n  {\n    memcached_return rc= memcached_decrement(&memc, key, strlen(key),\n                                             offset, value);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n\n  bool add(const char *key, const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_add(&memc, key, strlen(key), value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool add_by_key(const char *master_key, const char *key, \n                  const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_add_by_key(&memc, master_key, strlen(master_key),\n                                              key, strlen(key),\n                                              value, value_length,\n                                              0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool replace(const char *key, const char *value, \n               size_t value_length)\n  {\n    memcached_return rc= memcached_replace(&memc, key, strlen(key),\n                                           value, value_length,\n                                           0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool replace_by_key(const char *master_key, const char *key, \n                      const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_replace_by_key(&memc, master_key, strlen(master_key),\n                                                  key, strlen(key),\n                                                  value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool prepend(const char *key, const char *value, \n               size_t value_length)\n  {\n    memcached_return rc= memcached_prepend(&memc, key, strlen(key),\n                                           value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool prepend_by_key(const char *master_key, const char *key, \n                      const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_prepend_by_key(&memc, master_key, strlen(master_key),\n                                                  key, strlen(key),\n                                                  value, value_length,\n                                                  0,\n                                                  0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool append(const char *key, const char *value, \n              size_t value_length)\n  {\n    memcached_return rc= memcached_append(&memc, key, strlen(key),\n                                          value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool append_by_key(const char *master_key, const char *key, \n                     const char *value, size_t value_length)\n  {\n    memcached_return rc= memcached_append_by_key(&memc,\n                                                 master_key, strlen(master_key),\n                                                 key, strlen(key),\n                                                 value, value_length, 0, 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool cas(const char *key, const char *value, \n           size_t value_length, uint64_t cas_arg)\n  {\n    memcached_return rc= memcached_cas(&memc, key, strlen(key),\n                                       value, value_length, 0, 0, cas_arg);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool cas_by_key(const char *master_key, const char *key, \n                  const char *value, size_t value_length, \n                  uint64_t cas_arg)\n  {\n    memcached_return rc= memcached_cas_by_key(&memc,\n                                              master_key, strlen(master_key),\n                                              key, strlen(key),\n                                              value, value_length,\n                                              0, 0, cas_arg);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  \/\/ using 'remove' vs. 'delete' since 'delete' is a keyword \n  bool remove(const std::string& key)\n  {\n    memcached_return rc= memcached_delete(&memc, key.c_str(), key.length(), 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n\n  bool delete_by_key(const char *master_key, const char *key)\n  {\n    memcached_return rc= memcached_delete_by_key(&memc, master_key, strlen(master_key),\n                                                 key, strlen(key), 0);\n    return (rc == MEMCACHED_SUCCESS);\n  }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 1998 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 <math.h>\n\n#include \"cssysdef.h\"\n#include \"csengine\/texture.h\"\n#include \"csengine\/engine.h\"\n#include \"iimage.h\"\n#include \"itxtmgr.h\"\n\n\/\/---------------------------------------------------------------------------\n\nIMPLEMENT_CSOBJTYPE (csTextureWrapper,csPObject);\n\ncsTextureWrapper::csTextureWrapper (iImage* Image) :\n  csPObject (), handle (NULL), flags (CS_TEXTURE_3D)\n{\n  (image = Image)->IncRef ();\n  key_col_r = -1;\n  if(image->HasKeycolor ())\n    image->GetKeycolor( key_col_r, key_col_g, key_col_b );\n  csEngine::current_engine->AddToCurrentRegion (this);\n}\n\ncsTextureWrapper::csTextureWrapper (csTextureWrapper &th) :\n  csPObject (), handle (NULL)\n{\n  flags = th.flags;\n  (image = th.image)->IncRef ();\n  key_col_r = th.key_col_r;\n  key_col_g = th.key_col_g;\n  key_col_b = th.key_col_b;\n  handle = th.GetTextureHandle ();\n  SetName (th.GetName ());\n  if (handle)\n    SetKeyColor (key_col_r, key_col_g, key_col_b);\n  csEngine::current_engine->AddToCurrentRegion (this);\n}\n\ncsTextureWrapper::csTextureWrapper (iTextureHandle *ith) :\n  csPObject (), image (NULL)\n{\n  ith->IncRef ();\n  flags = ith->GetFlags ();\n  if (ith->GetKeyColor ())\n  {\n    UByte r, g, b;\n    ith->GetKeyColor (r, g, b);\n    SetKeyColor ((int)r, (int)g, (int)b);\n  }\n  handle = ith;\n  csEngine::current_engine->AddToCurrentRegion (this);\n}\n\ncsTextureWrapper::~csTextureWrapper ()\n{\n  if (handle)\n    handle->DecRef ();\n  if (image)\n    image->DecRef ();\n}\n\nvoid csTextureWrapper::SetImageFile (iImage *Image)\n{\n  if (image)\n    image->DecRef ();\n  (image = Image)->IncRef ();\n}\n\nvoid csTextureWrapper::SetKeyColor (int red, int green, int blue)\n{\n  if (handle)\n    if (red >= 0)\n      handle->SetKeyColor (red, green, blue);\n    else\n      handle->SetKeyColor (false);\n  key_col_r = red;\n  key_col_g = green;\n  key_col_b = blue;\n}\n\nvoid csTextureWrapper::Register (iTextureManager *txtmgr)\n{\n  \/\/ smgh 22\/07\/00\n  \/\/if (handle) handle->DecRef ();\n\n  \/\/ Now we check the size of the loaded image. Having an image, that\n  \/\/ is not a power of two will result in strange errors while\n  \/\/ rendering. It is by far better to check the format of all textures\n  \/\/ already while loading them.\n  if (flags & CS_TEXTURE_3D)\n  {\n    int Width  = image->GetWidth ();\n    int Height = image->GetHeight ();\n\n    if (!IsPowerOf2 (Width) || !IsPowerOf2 (Height))\n      CsPrintf (MSG_WARNING,\n        \"Inefficient texture image '%s' dimenstions!\\n\"\n        \"The width (%d) and height (%d) should be a power of two.\\n\",\n        GetName (), Width, Height);\n  }\n\n  handle = txtmgr->RegisterTexture (image, flags);\n  if (handle)\n    SetKeyColor (key_col_r, key_col_g, key_col_b);\n}\n\n\/\/-------------------------------------------------------- csTextureList -----\/\/\n\ncsTextureList::~csTextureList ()\n{\n  DeleteAll ();\n}\n\ncsTextureWrapper *csTextureList::NewTexture (iImage *image)\n{\n  csTextureWrapper *tm = new csTextureWrapper (image);\n  Push (tm);\n  return tm;\n}\n\ncsTextureWrapper *csTextureList::NewTexture (iTextureHandle *ith)\n{\n  csTextureWrapper *tm = new csTextureWrapper (ith);\n  Push (tm);\n  return tm;\n}\n<commit_msg>Forgot to commit.<commit_after>\/*\n    Copyright (C) 1998 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 <math.h>\n\n#include \"cssysdef.h\"\n#include \"csengine\/texture.h\"\n#include \"csengine\/engine.h\"\n#include \"iimage.h\"\n#include \"itxtmgr.h\"\n\n\/\/---------------------------------------------------------------------------\n\nIMPLEMENT_CSOBJTYPE (csTextureWrapper,csPObject);\n\nIMPLEMENT_IBASE (csTextureWrapper)\n  IMPLEMENTS_INTERFACE (iTextureWrapper)\nIMPLEMENT_IBASE_END\n\ncsTextureWrapper::csTextureWrapper (iImage* Image) :\n  csPObject (), handle (NULL), flags (CS_TEXTURE_3D)\n{\n  CONSTRUCT_IBASE (NULL);\n  (image = Image)->IncRef ();\n  key_col_r = -1;\n  if(image->HasKeycolor ())\n    image->GetKeycolor( key_col_r, key_col_g, key_col_b );\n  csEngine::current_engine->AddToCurrentRegion (this);\n}\n\ncsTextureWrapper::csTextureWrapper (csTextureWrapper &th) :\n  csPObject (), handle (NULL)\n{\n  CONSTRUCT_IBASE (NULL);\n  flags = th.flags;\n  (image = th.image)->IncRef ();\n  key_col_r = th.key_col_r;\n  key_col_g = th.key_col_g;\n  key_col_b = th.key_col_b;\n  handle = th.GetTextureHandle ();\n  SetName (th.GetName ());\n  if (handle)\n    SetKeyColor (key_col_r, key_col_g, key_col_b);\n  csEngine::current_engine->AddToCurrentRegion (this);\n}\n\ncsTextureWrapper::csTextureWrapper (iTextureHandle *ith) :\n  csPObject (), image (NULL)\n{\n  CONSTRUCT_IBASE (NULL);\n  ith->IncRef ();\n  flags = ith->GetFlags ();\n  if (ith->GetKeyColor ())\n  {\n    UByte r, g, b;\n    ith->GetKeyColor (r, g, b);\n    SetKeyColor ((int)r, (int)g, (int)b);\n  }\n  handle = ith;\n  csEngine::current_engine->AddToCurrentRegion (this);\n}\n\ncsTextureWrapper::~csTextureWrapper ()\n{\n  if (handle)\n    handle->DecRef ();\n  if (image)\n    image->DecRef ();\n}\n\nvoid csTextureWrapper::SetImageFile (iImage *Image)\n{\n  if (image)\n    image->DecRef ();\n  (image = Image)->IncRef ();\n}\n\nvoid csTextureWrapper::SetKeyColor (int red, int green, int blue)\n{\n  if (handle)\n    if (red >= 0)\n      handle->SetKeyColor (red, green, blue);\n    else\n      handle->SetKeyColor (false);\n  key_col_r = red;\n  key_col_g = green;\n  key_col_b = blue;\n}\n\nvoid csTextureWrapper::Register (iTextureManager *txtmgr)\n{\n  \/\/ smgh 22\/07\/00\n  \/\/if (handle) handle->DecRef ();\n\n  \/\/ Now we check the size of the loaded image. Having an image, that\n  \/\/ is not a power of two will result in strange errors while\n  \/\/ rendering. It is by far better to check the format of all textures\n  \/\/ already while loading them.\n  if (flags & CS_TEXTURE_3D)\n  {\n    int Width  = image->GetWidth ();\n    int Height = image->GetHeight ();\n\n    if (!IsPowerOf2 (Width) || !IsPowerOf2 (Height))\n      CsPrintf (MSG_WARNING,\n        \"Inefficient texture image '%s' dimenstions!\\n\"\n        \"The width (%d) and height (%d) should be a power of two.\\n\",\n        GetName (), Width, Height);\n  }\n\n  handle = txtmgr->RegisterTexture (image, flags);\n  if (handle)\n    SetKeyColor (key_col_r, key_col_g, key_col_b);\n}\n\n\/\/-------------------------------------------------------- csTextureList -----\/\/\n\ncsTextureList::~csTextureList ()\n{\n  DeleteAll ();\n}\n\ncsTextureWrapper *csTextureList::NewTexture (iImage *image)\n{\n  csTextureWrapper *tm = new csTextureWrapper (image);\n  Push (tm);\n  return tm;\n}\n\ncsTextureWrapper *csTextureList::NewTexture (iTextureHandle *ith)\n{\n  csTextureWrapper *tm = new csTextureWrapper (ith);\n  Push (tm);\n  return tm;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 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\/experiments\/alr_experiment.h\"\n\n#include <inttypes.h>\n#include <stdio.h>\n#include <string>\n\n#include \"api\/transport\/field_trial_based_config.h\"\n#include \"rtc_base\/logging.h\"\n\nnamespace webrtc {\n\nconst char AlrExperimentSettings::kScreenshareProbingBweExperimentName[] =\n    \"WebRTC-ProbingScreenshareBwe\";\nconst char AlrExperimentSettings::kStrictPacingAndProbingExperimentName[] =\n    \"WebRTC-StrictPacingAndProbing\";\nconst char kDefaultProbingScreenshareBweSettings[] = \"1.0,2875,80,40,-60,3\";\n\nbool AlrExperimentSettings::MaxOneFieldTrialEnabled() {\n  return AlrExperimentSettings::MaxOneFieldTrialEnabled(\n      FieldTrialBasedConfig());\n}\n\nbool AlrExperimentSettings::MaxOneFieldTrialEnabled(\n    const WebRtcKeyValueConfig& key_value_config) {\n  return key_value_config.Lookup(kStrictPacingAndProbingExperimentName)\n             .empty() ||\n         key_value_config.Lookup(kScreenshareProbingBweExperimentName).empty();\n}\n\nabsl::optional<AlrExperimentSettings>\nAlrExperimentSettings::CreateFromFieldTrial(const char* experiment_name) {\n  return AlrExperimentSettings::CreateFromFieldTrial(FieldTrialBasedConfig(),\n                                                     experiment_name);\n}\n\nabsl::optional<AlrExperimentSettings>\nAlrExperimentSettings::CreateFromFieldTrial(\n    const WebRtcKeyValueConfig& key_value_config,\n    const char* experiment_name) {\n  absl::optional<AlrExperimentSettings> ret;\n  std::string group_name = key_value_config.Lookup(experiment_name);\n\n  const std::string kIgnoredSuffix = \"_Dogfood\";\n  std::string::size_type suffix_pos = group_name.rfind(kIgnoredSuffix);\n  if (suffix_pos != std::string::npos &&\n      suffix_pos == group_name.length() - kIgnoredSuffix.length()) {\n    group_name.resize(group_name.length() - kIgnoredSuffix.length());\n  }\n\n  if (group_name.empty()) {\n    if (experiment_name == kScreenshareProbingBweExperimentName) {\n      \/\/ This experiment is now default-on with fixed settings.\n      \/\/ TODO(sprang): Remove this kill-switch and clean up experiment code.\n      group_name = kDefaultProbingScreenshareBweSettings;\n    } else {\n      return ret;\n    }\n  }\n\n  AlrExperimentSettings settings;\n  if (sscanf(group_name.c_str(), \"%f,%\" PRId64 \",%d,%d,%d,%d\",\n             &settings.pacing_factor, &settings.max_paced_queue_time,\n             &settings.alr_bandwidth_usage_percent,\n             &settings.alr_start_budget_level_percent,\n             &settings.alr_stop_budget_level_percent,\n             &settings.group_id) == 6) {\n    ret.emplace(settings);\n    RTC_LOG(LS_INFO) << \"Using ALR experiment settings: \"\n                        \"pacing factor: \"\n                     << settings.pacing_factor << \", max pacer queue length: \"\n                     << settings.max_paced_queue_time\n                     << \", ALR start bandwidth usage percent: \"\n                     << settings.alr_bandwidth_usage_percent\n                     << \", ALR end budget level percent: \"\n                     << settings.alr_start_budget_level_percent\n                     << \", ALR end budget level percent: \"\n                     << settings.alr_stop_budget_level_percent\n                     << \", ALR experiment group ID: \" << settings.group_id;\n  } else {\n    RTC_LOG(LS_INFO) << \"Failed to parse ALR experiment: \" << experiment_name;\n  }\n\n  return ret;\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Fix text logging of ALR detector experiment settings.<commit_after>\/*\n *  Copyright (c) 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\/experiments\/alr_experiment.h\"\n\n#include <inttypes.h>\n#include <stdio.h>\n#include <string>\n\n#include \"api\/transport\/field_trial_based_config.h\"\n#include \"rtc_base\/logging.h\"\n\nnamespace webrtc {\n\nconst char AlrExperimentSettings::kScreenshareProbingBweExperimentName[] =\n    \"WebRTC-ProbingScreenshareBwe\";\nconst char AlrExperimentSettings::kStrictPacingAndProbingExperimentName[] =\n    \"WebRTC-StrictPacingAndProbing\";\nconst char kDefaultProbingScreenshareBweSettings[] = \"1.0,2875,80,40,-60,3\";\n\nbool AlrExperimentSettings::MaxOneFieldTrialEnabled() {\n  return AlrExperimentSettings::MaxOneFieldTrialEnabled(\n      FieldTrialBasedConfig());\n}\n\nbool AlrExperimentSettings::MaxOneFieldTrialEnabled(\n    const WebRtcKeyValueConfig& key_value_config) {\n  return key_value_config.Lookup(kStrictPacingAndProbingExperimentName)\n             .empty() ||\n         key_value_config.Lookup(kScreenshareProbingBweExperimentName).empty();\n}\n\nabsl::optional<AlrExperimentSettings>\nAlrExperimentSettings::CreateFromFieldTrial(const char* experiment_name) {\n  return AlrExperimentSettings::CreateFromFieldTrial(FieldTrialBasedConfig(),\n                                                     experiment_name);\n}\n\nabsl::optional<AlrExperimentSettings>\nAlrExperimentSettings::CreateFromFieldTrial(\n    const WebRtcKeyValueConfig& key_value_config,\n    const char* experiment_name) {\n  absl::optional<AlrExperimentSettings> ret;\n  std::string group_name = key_value_config.Lookup(experiment_name);\n\n  const std::string kIgnoredSuffix = \"_Dogfood\";\n  std::string::size_type suffix_pos = group_name.rfind(kIgnoredSuffix);\n  if (suffix_pos != std::string::npos &&\n      suffix_pos == group_name.length() - kIgnoredSuffix.length()) {\n    group_name.resize(group_name.length() - kIgnoredSuffix.length());\n  }\n\n  if (group_name.empty()) {\n    if (experiment_name == kScreenshareProbingBweExperimentName) {\n      \/\/ This experiment is now default-on with fixed settings.\n      \/\/ TODO(sprang): Remove this kill-switch and clean up experiment code.\n      group_name = kDefaultProbingScreenshareBweSettings;\n    } else {\n      return ret;\n    }\n  }\n\n  AlrExperimentSettings settings;\n  if (sscanf(group_name.c_str(), \"%f,%\" PRId64 \",%d,%d,%d,%d\",\n             &settings.pacing_factor, &settings.max_paced_queue_time,\n             &settings.alr_bandwidth_usage_percent,\n             &settings.alr_start_budget_level_percent,\n             &settings.alr_stop_budget_level_percent,\n             &settings.group_id) == 6) {\n    ret.emplace(settings);\n    RTC_LOG(LS_INFO) << \"Using ALR experiment settings: \"\n                        \"pacing factor: \"\n                     << settings.pacing_factor << \", max pacer queue length: \"\n                     << settings.max_paced_queue_time\n                     << \", ALR bandwidth usage percent: \"\n                     << settings.alr_bandwidth_usage_percent\n                     << \", ALR start budget level percent: \"\n                     << settings.alr_start_budget_level_percent\n                     << \", ALR end budget level percent: \"\n                     << settings.alr_stop_budget_level_percent\n                     << \", ALR experiment group ID: \" << settings.group_id;\n  } else {\n    RTC_LOG(LS_INFO) << \"Failed to parse ALR experiment: \" << experiment_name;\n  }\n\n  return ret;\n}\n\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- AliasAnalysis.cpp - Generic Alias Analysis Interface Implementation -==\/\/\n\/\/\n\/\/ This file implements the generic AliasAnalysis interface which is used as the\n\/\/ common interface used by all clients and implementations of alias analysis.\n\/\/\n\/\/ This file also implements the default version of the AliasAnalysis interface\n\/\/ that is to be used when no other implementation is specified.  This does some\n\/\/ simple tests that detect obvious cases: two different global pointers cannot\n\/\/ alias, a global cannot alias a malloc, two different mallocs cannot alias,\n\/\/ etc.\n\/\/\n\/\/ This alias analysis implementation really isn't very good for anything, but\n\/\/ it is very fast, and makes a nice clean default implementation.  Because it\n\/\/ handles lots of little corner cases, other, more complex, alias analysis\n\/\/ implementations may choose to rely on this pass to resolve these simple and\n\/\/ easy cases.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/BasicAliasAnalysis.h\"\n#include \"llvm\/BasicBlock.h\"\n#include \"llvm\/Support\/InstVisitor.h\"\n#include \"llvm\/iMemory.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/GlobalValue.h\"\n#include \"llvm\/DerivedTypes.h\"\n\n\/\/ Register the AliasAnalysis interface, providing a nice name to refer to.\nstatic RegisterAnalysisGroup<AliasAnalysis> X(\"Alias Analysis\");\n\n\/\/ CanModify - Define a little visitor class that is used to check to see if\n\/\/ arbitrary chunks of code can modify a specified pointer.\n\/\/\nnamespace {\n  struct CanModify : public InstVisitor<CanModify, bool> {\n    const AliasAnalysis &AA;\n    const Value *Ptr;\n\n    CanModify(const AliasAnalysis *aa, const Value *ptr)\n      : AA(*aa), Ptr(ptr) {}\n\n    bool visitInvokeInst(InvokeInst &II) {\n      return AA.canInvokeModify(II, Ptr);\n    }\n    bool visitCallInst(CallInst &CI) {\n      return AA.canCallModify(CI, Ptr);\n    }\n    bool visitStoreInst(StoreInst &SI) {\n      return AA.alias(Ptr, SI.getOperand(1));\n    }\n\n    \/\/ Other instructions do not alias anything.\n    bool visitInstruction(Instruction &I) { return false; }\n  };\n}\n\n\/\/ AliasAnalysis destructor: DO NOT move this to the header file for\n\/\/ AliasAnalysis or else clients of the AliasAnalysis class may not depend on\n\/\/ the AliasAnalysis.o file in the current .a file, causing alias analysis\n\/\/ support to not be included in the tool correctly!\n\/\/\nAliasAnalysis::~AliasAnalysis() {}\n\n\/\/\/ canBasicBlockModify - Return true if it is possible for execution of the\n\/\/\/ specified basic block to modify the value pointed to by Ptr.\n\/\/\/\nbool AliasAnalysis::canBasicBlockModify(const BasicBlock &bb,\n                                        const Value *Ptr) const {\n  CanModify CM(this, Ptr);\n  BasicBlock &BB = const_cast<BasicBlock&>(bb);\n\n  for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)\n    if (CM.visit(I))        \/\/ Check every instruction in the basic block...\n      return true;\n\n  return false;\n}\n\n\/\/\/ canInstructionRangeModify - Return true if it is possible for the execution\n\/\/\/ of the specified instructions to modify the value pointed to by Ptr.  The\n\/\/\/ instructions to consider are all of the instructions in the range of [I1,I2]\n\/\/\/ INCLUSIVE.  I1 and I2 must be in the same basic block.\n\/\/\/\nbool AliasAnalysis::canInstructionRangeModify(const Instruction &I1,\n                                              const Instruction &I2,\n                                              const Value *Ptr) const {\n  assert(I1.getParent() == I2.getParent() &&\n         \"Instructions not in same basic block!\");\n  CanModify CM(this, Ptr);\n  BasicBlock::iterator I = const_cast<Instruction*>(&I1);\n  BasicBlock::iterator E = const_cast<Instruction*>(&I2);\n  ++E;  \/\/ Convert from inclusive to exclusive range.\n\n  for (; I != E; ++I)\n    if (CM.visit(I))        \/\/ Check every instruction in the basic block...\n      return true;\n\n  return false;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ BasicAliasAnalysis Pass Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Because of the way .a files work, the implementation of the\n\/\/ BasicAliasAnalysis class MUST be in the AliasAnalysis file itself, or else we\n\/\/ run the risk of AliasAnalysis being used, but the default implementation not\n\/\/ being linked into the tool that uses it.  As such, we register and implement\n\/\/ the class here.\n\/\/\nnamespace {\n  \/\/ Register this pass...\n  RegisterOpt<BasicAliasAnalysis>\n  X(\"basicaa\", \"Basic Alias Analysis (default AA impl)\");\n\n  \/\/ Declare that we implement the AliasAnalysis interface\n  RegisterAnalysisGroup<AliasAnalysis, BasicAliasAnalysis, true> Y;\n}  \/\/ End of anonymous namespace\n\n\n\n\/\/ hasUniqueAddress - Return true if the \nstatic inline bool hasUniqueAddress(const Value *V) {\n  return isa<GlobalValue>(V) || isa<MallocInst>(V) || isa<AllocaInst>(V);\n}\n\nAliasAnalysis::Result BasicAliasAnalysis::alias(const Value *V1,\n                                                const Value *V2) const {\n  \/\/ Strip off constant pointer refs if they exist\n  if (const ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(V1))\n    V1 = CPR->getValue();\n  if (const ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(V2))\n    V2 = CPR->getValue();\n\n  \/\/ Are we checking for alias of the same value?\n  if (V1 == V2) return MustAlias;\n\n  if (!isa<PointerType>(V1->getType()) || !isa<PointerType>(V2->getType()))\n    return NoAlias;  \/\/ Scalars cannot alias each other\n\n  bool V1Unique = hasUniqueAddress(V1);\n  bool V2Unique = hasUniqueAddress(V2);\n\n  if (V1Unique && V2Unique)\n    return NoAlias;         \/\/ Can't alias if they are different unique values\n\n  if ((V1Unique && isa<ConstantPointerNull>(V2)) ||\n      (V2Unique && isa<ConstantPointerNull>(V1)))\n    return NoAlias;         \/\/ Unique values don't alias null\n\n  \/\/ TODO: Handle getelementptr with nonzero offset\n\n  return MayAlias;\n}\n<commit_msg>* Add capability to recognize alias properties of the following common cases:   - A[c1] cannot alias A[c2] where constants c1 != c2   - A[i] cannot alias B[j] if A & B are provably different arrays<commit_after>\/\/===- AliasAnalysis.cpp - Generic Alias Analysis Interface Implementation -==\/\/\n\/\/\n\/\/ This file implements the generic AliasAnalysis interface which is used as the\n\/\/ common interface used by all clients and implementations of alias analysis.\n\/\/\n\/\/ This file also implements the default version of the AliasAnalysis interface\n\/\/ that is to be used when no other implementation is specified.  This does some\n\/\/ simple tests that detect obvious cases: two different global pointers cannot\n\/\/ alias, a global cannot alias a malloc, two different mallocs cannot alias,\n\/\/ etc.\n\/\/\n\/\/ This alias analysis implementation really isn't very good for anything, but\n\/\/ it is very fast, and makes a nice clean default implementation.  Because it\n\/\/ handles lots of little corner cases, other, more complex, alias analysis\n\/\/ implementations may choose to rely on this pass to resolve these simple and\n\/\/ easy cases.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/BasicAliasAnalysis.h\"\n#include \"llvm\/BasicBlock.h\"\n#include \"llvm\/Support\/InstVisitor.h\"\n#include \"llvm\/iMemory.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/GlobalValue.h\"\n#include \"llvm\/DerivedTypes.h\"\n\n\/\/ Register the AliasAnalysis interface, providing a nice name to refer to.\nstatic RegisterAnalysisGroup<AliasAnalysis> X(\"Alias Analysis\");\n\n\/\/ CanModify - Define a little visitor class that is used to check to see if\n\/\/ arbitrary chunks of code can modify a specified pointer.\n\/\/\nnamespace {\n  struct CanModify : public InstVisitor<CanModify, bool> {\n    const AliasAnalysis &AA;\n    const Value *Ptr;\n\n    CanModify(const AliasAnalysis *aa, const Value *ptr)\n      : AA(*aa), Ptr(ptr) {}\n\n    bool visitInvokeInst(InvokeInst &II) {\n      return AA.canInvokeModify(II, Ptr);\n    }\n    bool visitCallInst(CallInst &CI) {\n      return AA.canCallModify(CI, Ptr);\n    }\n    bool visitStoreInst(StoreInst &SI) {\n      return AA.alias(Ptr, SI.getOperand(1));\n    }\n\n    \/\/ Other instructions do not alias anything.\n    bool visitInstruction(Instruction &I) { return false; }\n  };\n}\n\n\/\/ AliasAnalysis destructor: DO NOT move this to the header file for\n\/\/ AliasAnalysis or else clients of the AliasAnalysis class may not depend on\n\/\/ the AliasAnalysis.o file in the current .a file, causing alias analysis\n\/\/ support to not be included in the tool correctly!\n\/\/\nAliasAnalysis::~AliasAnalysis() {}\n\n\/\/\/ canBasicBlockModify - Return true if it is possible for execution of the\n\/\/\/ specified basic block to modify the value pointed to by Ptr.\n\/\/\/\nbool AliasAnalysis::canBasicBlockModify(const BasicBlock &bb,\n                                        const Value *Ptr) const {\n  CanModify CM(this, Ptr);\n  BasicBlock &BB = const_cast<BasicBlock&>(bb);\n\n  for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)\n    if (CM.visit(I))        \/\/ Check every instruction in the basic block...\n      return true;\n\n  return false;\n}\n\n\/\/\/ canInstructionRangeModify - Return true if it is possible for the execution\n\/\/\/ of the specified instructions to modify the value pointed to by Ptr.  The\n\/\/\/ instructions to consider are all of the instructions in the range of [I1,I2]\n\/\/\/ INCLUSIVE.  I1 and I2 must be in the same basic block.\n\/\/\/\nbool AliasAnalysis::canInstructionRangeModify(const Instruction &I1,\n                                              const Instruction &I2,\n                                              const Value *Ptr) const {\n  assert(I1.getParent() == I2.getParent() &&\n         \"Instructions not in same basic block!\");\n  CanModify CM(this, Ptr);\n  BasicBlock::iterator I = const_cast<Instruction*>(&I1);\n  BasicBlock::iterator E = const_cast<Instruction*>(&I2);\n  ++E;  \/\/ Convert from inclusive to exclusive range.\n\n  for (; I != E; ++I)\n    if (CM.visit(I))        \/\/ Check every instruction in the basic block...\n      return true;\n\n  return false;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ BasicAliasAnalysis Pass Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Because of the way .a files work, the implementation of the\n\/\/ BasicAliasAnalysis class MUST be in the AliasAnalysis file itself, or else we\n\/\/ run the risk of AliasAnalysis being used, but the default implementation not\n\/\/ being linked into the tool that uses it.  As such, we register and implement\n\/\/ the class here.\n\/\/\nnamespace {\n  \/\/ Register this pass...\n  RegisterOpt<BasicAliasAnalysis>\n  X(\"basicaa\", \"Basic Alias Analysis (default AA impl)\");\n\n  \/\/ Declare that we implement the AliasAnalysis interface\n  RegisterAnalysisGroup<AliasAnalysis, BasicAliasAnalysis, true> Y;\n}  \/\/ End of anonymous namespace\n\n\n\n\/\/ hasUniqueAddress - Return true if the \nstatic inline bool hasUniqueAddress(const Value *V) {\n  return isa<GlobalValue>(V) || isa<MallocInst>(V) || isa<AllocaInst>(V);\n}\n\nstatic const Value *getUnderlyingObject(const Value *V) {\n  if (!isa<PointerType>(V->getType())) return 0;\n\n  \/\/ If we are at some type of object... return it.\n  if (hasUniqueAddress(V)) return V;\n  \n  \/\/ Traverse through different addressing mechanisms...\n  if (const Instruction *I = dyn_cast<Instruction>(V)) {\n    if (isa<CastInst>(I) || isa<GetElementPtrInst>(I))\n      return getUnderlyingObject(I->getOperand(0));\n  }\n  return 0;\n}\n\n\/\/ alias - Provide a bunch of ad-hoc rules to disambiguate in common cases, such\n\/\/ as array references.  Note that this function is heavily tail recursive.\n\/\/ Hopefully we have a smart C++ compiler.  :)\n\/\/\nAliasAnalysis::Result BasicAliasAnalysis::alias(const Value *V1,\n                                                const Value *V2) const {\n  \/\/ Strip off constant pointer refs if they exist\n  if (const ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(V1))\n    V1 = CPR->getValue();\n  if (const ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(V2))\n    V2 = CPR->getValue();\n\n  \/\/ Are we checking for alias of the same value?\n  if (V1 == V2) return MustAlias;\n\n  if ((!isa<PointerType>(V1->getType()) || !isa<PointerType>(V2->getType())) &&\n      V1->getType() != Type::LongTy && V2->getType() != Type::LongTy)\n    return NoAlias;  \/\/ Scalars cannot alias each other\n\n  \/\/ Strip off cast instructions...\n  if (const Instruction *I = dyn_cast<CastInst>(V1))\n    return alias(I->getOperand(0), V2);\n  if (const Instruction *I = dyn_cast<CastInst>(V2))\n    return alias(I->getOperand(0), V1);\n\n  \/\/ If we have two gep instructions with identical indices, return an alias\n  \/\/ result equal to the alias result of the original pointer...\n  \/\/\n  if (const GetElementPtrInst *GEP1 = dyn_cast<GetElementPtrInst>(V1))\n    if (const GetElementPtrInst *GEP2 = dyn_cast<GetElementPtrInst>(V2))\n      if (GEP1->getNumOperands() == GEP2->getNumOperands() &&\n          GEP1->getOperand(0)->getType() == GEP2->getOperand(0)->getType()) {\n        if (std::equal(GEP1->op_begin()+1, GEP1->op_end(), GEP2->op_begin()+1))\n          return alias(GEP1->getOperand(0), GEP2->getOperand(0));\n\n        \/\/ If all of the indexes to the getelementptr are constant, but\n        \/\/ different (well we already know they are different), then we know\n        \/\/ that there cannot be an alias here if the two base pointers DO alias.\n        \/\/\n        bool AllConstant = true;\n        for (unsigned i = 1, e = GEP1->getNumOperands(); i != e; ++i)\n          if (!isa<Constant>(GEP1->getOperand(i)) ||\n              !isa<Constant>(GEP2->getOperand(i))) {\n            AllConstant = false;\n            break;\n          }\n\n        \/\/ If we are all constant, then look at where the the base pointers\n        \/\/ alias.  If they are known not to alias, then we are dealing with two\n        \/\/ different arrays or something, so no alias is possible.  If they are\n        \/\/ known to be the same object, then we cannot alias because we are\n        \/\/ indexing into a different part of the object.  As usual, MayAlias\n        \/\/ doesn't tell us anything.\n        \/\/\n        if (AllConstant &&\n            alias(GEP1->getOperand(0), GEP2->getOperand(1)) != MayAlias)\n            return NoAlias;\n      }\n\n  \/\/ Figure out what objects these things are pointing to if we can...\n  const Value *O1 = getUnderlyingObject(V1);\n  const Value *O2 = getUnderlyingObject(V2);\n\n  \/\/ Pointing at a discernable object?\n  if (O1 && O2) {\n    \/\/ If they are two different objects, we know that we have no alias...\n    if (O1 != O2) return NoAlias;\n\n    \/\/ If they are the same object, they we can look at the indexes.  If they\n    \/\/ index off of the object is the same for both pointers, they must alias.\n    \/\/ If they are provably different, they must not alias.  Otherwise, we can't\n    \/\/ tell anything.\n  } else if (O1 && isa<ConstantPointerNull>(V2)) {\n    return NoAlias;                    \/\/ Unique values don't alias null\n  } else if (O2 && isa<ConstantPointerNull>(V1)) {\n    return NoAlias;                    \/\/ Unique values don't alias null\n  }\n\n  return MayAlias;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Platform.hpp\"\n#include \"genome.pb.h\"\n#include \"Brain.hpp\"\n#include \"ProteinEnvironment.hpp\"\n#include \"Neuron.hpp\"\n#include \"Synapse.hpp\"\n#include \"SimpleSpatialSearch.hpp\"\n#include \"BrainPlugins.hpp\"\n#include \"BrainPlugin.hpp\"\n\n#define INPUT_NEURONS\t\t\t100\n#define INPUT_REGION_MINX\t\t0.0f\n#define INPUT_REGION_MAXX\t\t5.0f\n#define INPUT_REGION_MINY\t\t0.0f\n#define INPUT_REGION_MAXY\t\t5.0f\n#define INPUT_REGION_SPACING\t0.01f\t\/\/This also implies max input neurons of ((max-min)\/spacing)^2\n#define INPUT_AXON_SPREAD\t\t0.0f\t\/\/The range of axon locations from input neurons\n#define DEVELOPMENT_TICKS\t\t10\t\t\/\/How often development neurons are re-evaluated\n\n#include <boost\/math\/distributions\/uniform.hpp>\n#include <boost\/random.hpp>\n\nnamespace Elysia {\n\n\/**\n *  @param ProteinEnvironment *proteinMap - a base protein map for the brain\n *\n *\tDescription:\tCreates a new Brain instance using a defined protein map as a base.\n *\t\t\t\t\tAlso adds a new spatial search instance, sets the brain's age to 0 and\n *\t\t\t\t\tinitializes all requisite brain plugins\n**\/\nBrain::Brain (ProteinEnvironment *proteinMap){\n    mProteinMap=proteinMap;\n    mSpatialSearch=new SimpleSpatialSearch;\n    mAge=0;\n\tmDevelopmentCounter=0;\n\tcreateInputRegion(INPUT_NEURONS);\n    makeInitialNeurons();\n    BrainPlugins::constructAll(this).swap(mPlugins);\n}\n\nvoid Brain::syncEnvironmentNeurons(unsigned int index, ProteinEnvironment::iterator environmentIterator){\n    Elysia::Genome::Effect growEffect=Elysia::Genome::GROW_NEURON;\n    float neuronDensity =environmentIterator.getProteinDensity(growEffect);\n    BoundingBox3f3f bounds = environmentIterator.getBoundingBox();\n    float area = bounds.across().x*bounds.across().y;\n    float expectedNumNeurons=neuronDensity*area;\n    boost::minstd_rand randGen(1+index);\/\/needs to be >0\n    boost::uniform_real<> uni_dist(0.0f,1.0f);\n    boost::variate_generator<boost::minstd_rand, boost::uniform_real<> > uniform(randGen,uni_dist);\n    if (expectedNumNeurons-floor(expectedNumNeurons)<uniform()) {\n        expectedNumNeurons=ceil(expectedNumNeurons);\n    }else {\n        expectedNumNeurons=floor(expectedNumNeurons);\n    }\n    int numNeurons=(unsigned int)expectedNumNeurons;\n    if (numNeurons<mNumNeurons[index]) {\n        \/\/FIXME: do we want to delete excess neurons\n    }\n    for (int n=mNumNeurons[index];n<numNeurons;++n) {\n        this->addNeuron(bounds, environmentIterator.retrieveGene(growEffect));\n    }\n    if (mNumNeurons[index]!=numNeurons) {\n        fprintf(stderr,\"The index count isn't equal to the sync count:\\nthis could happen if a neuron lies at the exact edge of a lobe,\\nso don't panic, but verify that this is indeed the case\\nand the wrong count got updated for that neuron\");\n    }\n}\n\n\n\nvoid Brain::makeInitialNeurons() {\n    unsigned int index=0;\n    for (ProteinEnvironment::iterator i=mProteinMap->begin();\n         i!=mProteinMap->end();\n         ++i,++index) {\n        mNumNeurons[i.uid()]=0;\n        syncEnvironmentNeurons(index,i);\n        \/\/FIXME add numNeurons to the count in this protein zone so we can add\/remove more later\n    }\n}\n\nNeuron * Brain::addNeuron(const BoundingBox3f3f&generationArea, const Genome::Gene&gene) {\n    Vector3f v = generationArea.min();\n    v.x+=generationArea.across().x*(rand()\/(double)RAND_MAX);\n    v.y+=generationArea.across().y*(rand()\/(double)RAND_MAX);\n\tv.z=0;\t \/\/Fixing z to 0 for now.\n    \/\/v.z+=generationArea.across().z*(rand()\/(double)RAND_MAX); \n\tNeuron *n = new Neuron(this, 2, 3, 4, 1, 1, v, gene);\n    mAllNeurons.insert(n);\n    return n;\n}\n\n\/**\n *\tDescription:\tOne \"tick\" of the brain simulation code, where the following occurs:\n *\t\t\t\t\t - processNeuron() called\n *\t\t\t\t\t - processSynapes() called\n *\t\t\t\t\t - increments the current time in the simulation\n *\t\t\t\t\t - ages the brain\n *\t\t\t\t\t - updates all the plugins for this brain\n**\/\nvoid Brain::tick(){\n\tprocessNeuron();\n\tprocessSynapse();\n\t\/\/developAllNeurons();\n    ++mCurTime;\n\t++mDevelopmentCounter;\n\tif(mDevelopmentCounter%10 == 0)this->processDevelopment();\n    mAge+=1.0e-6;\/\/fixme this is probably not correct: we probably need genes to do this\n    if (mAge>1.0) mAge=1.0;\n    for(std::vector<BrainPlugin*>::iterator i=mPlugins.begin(),ie=mPlugins.end();i!=ie;++i) {\n        (*i)->update();\n    }\n}\n\nvoid Brain::developAllNeurons(){\n\tfor(std::set<Neuron*>::iterator i=mAllNeurons.begin(),ie=mAllNeurons.end();i!=ie;++i){\n\t\t(*i)->developSynapse((*i)->getActivityStats());\n\t}\n}\n\n\n\n\/**\n *\tDescription:\tUpdates all neurons in the neuron list for this brain, then clears the list of\n *\t\t\t\t\tactive neurons\n**\/\nvoid Brain::processNeuron(){\n\tfor (std::list<Neuron*>::iterator i=mActiveNeurons.begin(),ie=mActiveNeurons.end();\n         i!=ie;\n\t\t ++i) {\n        (*i)->tick();\n\t}\n\tmActiveNeurons.clear();\n}\n\n\/**\n *\tDescription:\tIterates through brain's associates synapses and updates all of them using\n *\t\t\t\t\tthe Synapse class residualFire() method\n**\/\nvoid Brain::processSynapse(){\n    std::list<Synapse*>::iterator j,i=mActiveSynapses.begin(),ie=mActiveSynapses.end();\n\twhile (i!=ie) {\n        std::list<Synapse*>::iterator j=i++;\n        (*j)->residualFire();\n\t}\n}\n\n\n\n\n\/**\n *\t@param Synapse *inactiveSynapse - synapse to remove\n *\n *\tDescription:\tRemoves a synapse from the synapse list and updates it.\n**\/\nvoid Brain::inactivateSynapse(Synapse *inactiveSynapse){\n\tmActiveSynapses.erase(inactiveSynapse->mWhere);\n\tinactiveSynapse->mWhere=activeSynapseListSentinel();\n}\n\n\nvoid Brain::deleteSynapse(Synapse *deletedSynapse){\n\t\/\/mActiveSynapses.erase(deletedSynapse->mWhere);\n}\n\n\n\n\/**\n *\t@param Neuron *inactiveNeuron - an inactive neuron to remove\n *\n *\tDescription:\tRemoves an unused neuron from the neuron list and updates\n**\/\nvoid Brain::inactivateNeuron(Neuron *inactiveNeuron){\n\tmActiveNeurons.erase(inactiveNeuron->mWhere);\n\tinactiveNeuron->mWhere=activeNeuronListSentinel();\n}\n\nvoid Brain::deleteNeuron(Neuron *deletedNeuron){\n\t\/\/mAllNeurons.erase(deletedNeuron->mWhere);\n}\n\n\/**\n *\t@param Synapse *activeSynapse - a synapse to activate\n *\t@return\tthe beginning element of the active synapses list for this brain\n *\n *\tDescription:\tAdds a new synapse to the brain (at front of active synapse list)\n *\t\t\t\t\tand returns the front element of the list\n**\/\nstd::list<Synapse *>::iterator Brain::activateSynapse(Synapse *activeSynapse){\n    mActiveSynapses.push_front(activeSynapse);\n    return mActiveSynapses.begin();\n}\n\/**\n *\t@param Neuron *activeNeuron - a neuron to activate\n *\t@return\tthe beginning element of the active neuron list for this brain\n *\n *\tDescription:\tAdds a new neuron to the brain (at front of active neuron list)\n *\t\t\t\t\tand returns the front element of the list\n**\/\nstd::list<Neuron *>::iterator Brain::activateNeuron(Neuron *activeNeuron){\n  activeNeuron->mActivity=5.0f;\n  mActiveNeurons.push_front(activeNeuron);\n  return mActiveNeurons.begin();\n}\n\n\/**\n *\tBrain destructor\n**\/\nBrain::~Brain() {\n\tfor(std::set<Neuron*>::iterator i=mAllNeurons.begin(),ie=mAllNeurons.end();i!=ie;++i){\n\t\tdelete *i;\n\t}\n    delete mSpatialSearch;\n    delete mProteinMap;\n    for (std::vector<BrainPlugin*>::iterator i=mPlugins.begin(),ie=mPlugins.end();i!=ie;++i) {\n        delete *i;\n    }\n}\n\nNeuron* Brain::createInputNeuron(float x, float y, float z, float spread){\n\tGenome::Gene gene;\n    Genome::TemporalBoundingBox *sourcebb=gene.add_bounds();\n    Genome::TemporalBoundingBox *dendritebb=gene.add_bounds();\n    sourcebb->set_minx(x-spread);\n    sourcebb->set_miny(y-spread);\n    sourcebb->set_minz(0);\n    sourcebb->set_maxx(x+spread);\n    sourcebb->set_maxy(y+spread);\n    sourcebb->set_maxz(0);\n\n    dendritebb->set_minx(0);\n    dendritebb->set_miny(0);\n    dendritebb->set_minz(0);\n    dendritebb->set_maxx(0);\n    dendritebb->set_maxy(0);\n    dendritebb->set_maxz(0);\n\n\tVector3f v;\n\tv.x = x;\n\tv.y = y;\n\tv.z = z;\n\tNeuron *n;\n\tthis->mAllNeurons.insert(n = new Neuron(this, 0, 0, 0, 1, 1, v,gene));\n\tthis->mDevelopingNeurons.insert(n);\n\treturn n;\n}\n\nvoid Brain::createInputRegion(int neurons){\n\t\/\/At present, reserved location of input lobe is <0,0,0> to <5,5,0> neurons are added at 0.01 increments\n\tfloat minx = INPUT_REGION_MINX;\n\tfloat maxx = INPUT_REGION_MAXX;\n\tfloat miny = INPUT_REGION_MINY;\n\tfloat maxy = INPUT_REGION_MAXY;\n\tfloat spacing = INPUT_REGION_SPACING;\n\tfloat spread = INPUT_AXON_SPREAD;\n\n\tif(neurons > (maxx-minx)*(maxy-miny)\/spacing){\n\t\tassert(this);\n\t}\n\tNeuron* n;\n\tfloat x=minx;\n\tfloat y=miny;\n\n\tfor(int i=0;i<neurons;i++){\n\t\tn = createInputNeuron(x,y,0,spread);\n\t\tmInputNeurons.push_back(n);\n\t\tx += spacing;\n\t\tif(x >= maxx){\n\t\t\tx = minx;\n\t\t\ty += spacing;\n\t\t}\n\t}\n}\n\nvoid Brain::fireInputNeuron(int neuronNumber){\n\tNeuron* n= mInputNeurons[neuronNumber];\n\tn->setActivity(5);\n\tthis -> activateNeuron(n);\n\t\/\/printf(\"input\");\n}\n\nvoid Brain::processDevelopment(){\n\tfor(std::set<Neuron*>::iterator i=mAllNeurons.begin(),ie=mAllNeurons.end();i!=ie;++i){\n\t\t(*i)->tick();\n\t}\n}\n\n\/**\n * @return the bounds of all genes in the brain, i.e. where the farthest neurons may spout\n *\/\nBoundingBox3f3f Brain::getBounds()const{\n    \n    \n\/\/    return BoundingBox3f3f(Vector3f(0,00,00),Vector3f(1000,1000,1000));\n    return mProteinMap->getBounds();\n}\n\n}\n\n<commit_msg>Fixed problem with Neuron destruction by making sure that the neuron was actually in the active list before erasing it from the active list. Same with synapses<commit_after>#include \"Platform.hpp\"\n#include \"genome.pb.h\"\n#include \"Brain.hpp\"\n#include \"ProteinEnvironment.hpp\"\n#include \"Neuron.hpp\"\n#include \"Synapse.hpp\"\n#include \"SimpleSpatialSearch.hpp\"\n#include \"BrainPlugins.hpp\"\n#include \"BrainPlugin.hpp\"\n\n#define INPUT_NEURONS\t\t\t100\n#define INPUT_REGION_MINX\t\t0.0f\n#define INPUT_REGION_MAXX\t\t5.0f\n#define INPUT_REGION_MINY\t\t0.0f\n#define INPUT_REGION_MAXY\t\t5.0f\n#define INPUT_REGION_SPACING\t0.01f\t\/\/This also implies max input neurons of ((max-min)\/spacing)^2\n#define INPUT_AXON_SPREAD\t\t0.0f\t\/\/The range of axon locations from input neurons\n#define DEVELOPMENT_TICKS\t\t10\t\t\/\/How often development neurons are re-evaluated\n\n#include <boost\/math\/distributions\/uniform.hpp>\n#include <boost\/random.hpp>\n\nnamespace Elysia {\n\n\/**\n *  @param ProteinEnvironment *proteinMap - a base protein map for the brain\n *\n *\tDescription:\tCreates a new Brain instance using a defined protein map as a base.\n *\t\t\t\t\tAlso adds a new spatial search instance, sets the brain's age to 0 and\n *\t\t\t\t\tinitializes all requisite brain plugins\n**\/\nBrain::Brain (ProteinEnvironment *proteinMap){\n    mProteinMap=proteinMap;\n    mSpatialSearch=new SimpleSpatialSearch;\n    mAge=0;\n\tmDevelopmentCounter=0;\n\tcreateInputRegion(INPUT_NEURONS);\n    makeInitialNeurons();\n    BrainPlugins::constructAll(this).swap(mPlugins);\n}\n\nvoid Brain::syncEnvironmentNeurons(unsigned int index, ProteinEnvironment::iterator environmentIterator){\n    Elysia::Genome::Effect growEffect=Elysia::Genome::GROW_NEURON;\n    float neuronDensity =environmentIterator.getProteinDensity(growEffect);\n    BoundingBox3f3f bounds = environmentIterator.getBoundingBox();\n    float area = bounds.across().x*bounds.across().y;\n    float expectedNumNeurons=neuronDensity*area;\n    boost::minstd_rand randGen(1+index);\/\/needs to be >0\n    boost::uniform_real<> uni_dist(0.0f,1.0f);\n    boost::variate_generator<boost::minstd_rand, boost::uniform_real<> > uniform(randGen,uni_dist);\n    if (expectedNumNeurons-floor(expectedNumNeurons)<uniform()) {\n        expectedNumNeurons=ceil(expectedNumNeurons);\n    }else {\n        expectedNumNeurons=floor(expectedNumNeurons);\n    }\n    int numNeurons=(unsigned int)expectedNumNeurons;\n    if (numNeurons<mNumNeurons[index]) {\n        \/\/FIXME: do we want to delete excess neurons\n    }\n    for (int n=mNumNeurons[index];n<numNeurons;++n) {\n        this->addNeuron(bounds, environmentIterator.retrieveGene(growEffect));\n    }\n    if (mNumNeurons[index]!=numNeurons) {\n        fprintf(stderr,\"The index count isn't equal to the sync count:\\nthis could happen if a neuron lies at the exact edge of a lobe,\\nso don't panic, but verify that this is indeed the case\\nand the wrong count got updated for that neuron\");\n    }\n}\n\n\n\nvoid Brain::makeInitialNeurons() {\n    unsigned int index=0;\n    for (ProteinEnvironment::iterator i=mProteinMap->begin();\n         i!=mProteinMap->end();\n         ++i,++index) {\n        mNumNeurons[i.uid()]=0;\n        syncEnvironmentNeurons(index,i);\n        \/\/FIXME add numNeurons to the count in this protein zone so we can add\/remove more later\n    }\n}\n\nNeuron * Brain::addNeuron(const BoundingBox3f3f&generationArea, const Genome::Gene&gene) {\n    Vector3f v = generationArea.min();\n    v.x+=generationArea.across().x*(rand()\/(double)RAND_MAX);\n    v.y+=generationArea.across().y*(rand()\/(double)RAND_MAX);\n\tv.z=0;\t \/\/Fixing z to 0 for now.\n    \/\/v.z+=generationArea.across().z*(rand()\/(double)RAND_MAX); \n\tNeuron *n = new Neuron(this, 2, 3, 4, 1, 1, v, gene);\n    mAllNeurons.insert(n);\n    return n;\n}\n\n\/**\n *\tDescription:\tOne \"tick\" of the brain simulation code, where the following occurs:\n *\t\t\t\t\t - processNeuron() called\n *\t\t\t\t\t - processSynapes() called\n *\t\t\t\t\t - increments the current time in the simulation\n *\t\t\t\t\t - ages the brain\n *\t\t\t\t\t - updates all the plugins for this brain\n**\/\nvoid Brain::tick(){\n\tprocessNeuron();\n\tprocessSynapse();\n\t\/\/developAllNeurons();\n    ++mCurTime;\n\t++mDevelopmentCounter;\n\tif(mDevelopmentCounter%10 == 0)this->processDevelopment();\n    mAge+=1.0e-6;\/\/fixme this is probably not correct: we probably need genes to do this\n    if (mAge>1.0) mAge=1.0;\n    for(std::vector<BrainPlugin*>::iterator i=mPlugins.begin(),ie=mPlugins.end();i!=ie;++i) {\n        (*i)->update();\n    }\n}\n\nvoid Brain::developAllNeurons(){\n\tfor(std::set<Neuron*>::iterator i=mAllNeurons.begin(),ie=mAllNeurons.end();i!=ie;++i){\n\t\t(*i)->developSynapse((*i)->getActivityStats());\n\t}\n}\n\n\n\n\/**\n *\tDescription:\tUpdates all neurons in the neuron list for this brain, then clears the list of\n *\t\t\t\t\tactive neurons\n**\/\nvoid Brain::processNeuron(){\n\tfor (std::list<Neuron*>::iterator i=mActiveNeurons.begin(),ie=mActiveNeurons.end();\n         i!=ie;\n\t\t ++i) {\n        (*i)->tick();\n\t}\n\tmActiveNeurons.clear();\n}\n\n\/**\n *\tDescription:\tIterates through brain's associates synapses and updates all of them using\n *\t\t\t\t\tthe Synapse class residualFire() method\n**\/\nvoid Brain::processSynapse(){\n    std::list<Synapse*>::iterator j,i=mActiveSynapses.begin(),ie=mActiveSynapses.end();\n\twhile (i!=ie) {\n        std::list<Synapse*>::iterator j=i++;\n        (*j)->residualFire();\n\t}\n}\n\n\n\n\n\/**\n *\t@param Synapse *inactiveSynapse - synapse to remove\n *\n *\tDescription:\tRemoves a synapse from the synapse list and updates it.\n**\/\nvoid Brain::inactivateSynapse(Synapse *inactiveSynapse){\n    if (inactiveSynapse->mWhere!=activeSynapseListSentinel()) {\n        mActiveSynapses.erase(inactiveSynapse->mWhere);\n        inactiveSynapse->mWhere=activeSynapseListSentinel();\n    }\n}\n\n\nvoid Brain::deleteSynapse(Synapse *deletedSynapse){\n\t\/\/mActiveSynapses.erase(deletedSynapse->mWhere);\n}\n\n\n\n\/**\n *\t@param Neuron *inactiveNeuron - an inactive neuron to remove\n *\n *\tDescription:\tRemoves an unused neuron from the neuron list and updates\n**\/\nvoid Brain::inactivateNeuron(Neuron *inactiveNeuron){\n    if (inactiveNeuron->mWhere!=activeNeuronListSentinel()) {\n        mActiveNeurons.erase(inactiveNeuron->mWhere);\n        inactiveNeuron->mWhere=activeNeuronListSentinel();\n    }\n}\n\nvoid Brain::deleteNeuron(Neuron *deletedNeuron){\n\t\/\/mAllNeurons.erase(deletedNeuron->mWhere);\n}\n\n\/**\n *\t@param Synapse *activeSynapse - a synapse to activate\n *\t@return\tthe beginning element of the active synapses list for this brain\n *\n *\tDescription:\tAdds a new synapse to the brain (at front of active synapse list)\n *\t\t\t\t\tand returns the front element of the list\n**\/\nstd::list<Synapse *>::iterator Brain::activateSynapse(Synapse *activeSynapse){\n    mActiveSynapses.push_front(activeSynapse);\n    return mActiveSynapses.begin();\n}\n\/**\n *\t@param Neuron *activeNeuron - a neuron to activate\n *\t@return\tthe beginning element of the active neuron list for this brain\n *\n *\tDescription:\tAdds a new neuron to the brain (at front of active neuron list)\n *\t\t\t\t\tand returns the front element of the list\n**\/\nstd::list<Neuron *>::iterator Brain::activateNeuron(Neuron *activeNeuron){\n  activeNeuron->mActivity=5.0f;\n  mActiveNeurons.push_front(activeNeuron);\n  return mActiveNeurons.begin();\n}\n\n\/**\n *\tBrain destructor\n**\/\nBrain::~Brain() {\n\tfor(std::set<Neuron*>::iterator i=mAllNeurons.begin(),ie=mAllNeurons.end();i!=ie;++i){\n\t\tdelete *i;\n\t}\n    delete mSpatialSearch;\n    delete mProteinMap;\n    for (std::vector<BrainPlugin*>::iterator i=mPlugins.begin(),ie=mPlugins.end();i!=ie;++i) {\n        delete *i;\n    }\n}\n\nNeuron* Brain::createInputNeuron(float x, float y, float z, float spread){\n\tGenome::Gene gene;\n    Genome::TemporalBoundingBox *sourcebb=gene.add_bounds();\n    Genome::TemporalBoundingBox *dendritebb=gene.add_bounds();\n    sourcebb->set_minx(x-spread);\n    sourcebb->set_miny(y-spread);\n    sourcebb->set_minz(0);\n    sourcebb->set_maxx(x+spread);\n    sourcebb->set_maxy(y+spread);\n    sourcebb->set_maxz(0);\n\n    dendritebb->set_minx(0);\n    dendritebb->set_miny(0);\n    dendritebb->set_minz(0);\n    dendritebb->set_maxx(0);\n    dendritebb->set_maxy(0);\n    dendritebb->set_maxz(0);\n\n\tVector3f v;\n\tv.x = x;\n\tv.y = y;\n\tv.z = z;\n\tNeuron *n;\n\tthis->mAllNeurons.insert(n = new Neuron(this, 0, 0, 0, 1, 1, v,gene));\n\tthis->mDevelopingNeurons.insert(n);\n\treturn n;\n}\n\nvoid Brain::createInputRegion(int neurons){\n\t\/\/At present, reserved location of input lobe is <0,0,0> to <5,5,0> neurons are added at 0.01 increments\n\tfloat minx = INPUT_REGION_MINX;\n\tfloat maxx = INPUT_REGION_MAXX;\n\tfloat miny = INPUT_REGION_MINY;\n\tfloat maxy = INPUT_REGION_MAXY;\n\tfloat spacing = INPUT_REGION_SPACING;\n\tfloat spread = INPUT_AXON_SPREAD;\n\n\tif(neurons > (maxx-minx)*(maxy-miny)\/spacing){\n\t\tassert(this);\n\t}\n\tNeuron* n;\n\tfloat x=minx;\n\tfloat y=miny;\n\n\tfor(int i=0;i<neurons;i++){\n\t\tn = createInputNeuron(x,y,0,spread);\n\t\tmInputNeurons.push_back(n);\n\t\tx += spacing;\n\t\tif(x >= maxx){\n\t\t\tx = minx;\n\t\t\ty += spacing;\n\t\t}\n\t}\n}\n\nvoid Brain::fireInputNeuron(int neuronNumber){\n\tNeuron* n= mInputNeurons[neuronNumber];\n\tn->setActivity(5);\n\tthis -> activateNeuron(n);\n\t\/\/printf(\"input\");\n}\n\nvoid Brain::processDevelopment(){\n\tfor(std::set<Neuron*>::iterator i=mAllNeurons.begin(),ie=mAllNeurons.end();i!=ie;++i){\n\t\t(*i)->tick();\n\t}\n}\n\n\/**\n * @return the bounds of all genes in the brain, i.e. where the farthest neurons may spout\n *\/\nBoundingBox3f3f Brain::getBounds()const{\n    \n    \n\/\/    return BoundingBox3f3f(Vector3f(0,00,00),Vector3f(1000,1000,1000));\n    return mProteinMap->getBounds();\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>                                         \/* allows to perform standard input and output operations *\/\n#include <fstream>\n#include <stdio.h>                                          \/* Standard input\/output definitions *\/\n#include <stdint.h>                                         \/* Standard input\/output definitions *\/\n#include <stdlib.h>                                         \/* defines several general purpose functions *\/\n#include <unistd.h>                                         \/* UNIX standard function definitions *\/\n#include <fcntl.h>                                          \/* File control definitions *\/\n#include <ctype.h>                                          \/* isxxx() *\/\n#include <ros\/ros.h>                                        \/* ROS *\/\n#include <geometry_msgs\/Twist.h>                            \/* ROS Twist message *\/\n#include <base_controller\/encoders.h>                       \/* Custom message \/encoders *\/\n#include <base_controller\/md49data.h>                       \/* Custom message \/encoders *\/\n#include <sqlite3.h>\n\nint32_t EncoderL;                                           \/* stores encoder value left read from md49 *\/\nint32_t EncoderR;                                           \/* stores encoder value right read from md49 *\/\nunsigned char speed_l=128, speed_r=128;                     \/* speed to set for MD49 *\/\nunsigned char last_speed_l=128, last_speed_r=128;           \/* speed to set for MD49 *\/\ndouble vr = 0.0;\ndouble vl = 0.0;\ndouble max_vr = 0.2;\ndouble max_vl = 0.2;\ndouble min_vr = 0.2;\ndouble min_vl = 0.2;\ndouble base_width = 0.4;                                    \/* Base width in meters *\/\n\nunsigned char serialBuffer[18];                             \/* Serial buffer to store uart data *\/\nvoid read_MD49_Data (void);\nvoid set_md49_speed (unsigned char speed_l, unsigned char speed_r);\n\n\n\/\/ sqlite globals\nsqlite3 *db;\nchar *zErrMsg = 0;\nint  rc;\nconst char *sql;\nconst char* data = \"Callback function called\";\n\nusing namespace std;\n\nbase_controller::encoders encoders;\nbase_controller::md49data md49data;\n\nvoid cmd_vel_callback(const geometry_msgs::Twist& vel_cmd){\n\n        if (vel_cmd.linear.x>0){\n            speed_l = 200;\n            speed_r = 200;\n        }\n        if (vel_cmd.linear.x<0){\n            speed_l = 100;\n            speed_r = 100;\n        }\n        if (vel_cmd.linear.x==0 && vel_cmd.angular.z==0){\n            speed_l = 128;\n            speed_r = 128;\n        }\n        if (vel_cmd.angular.z>0){\n            speed_l = 100;\n            speed_r = 200;\n        }\n        if (vel_cmd.angular.z<0){\n            speed_l = 200;\n            speed_r = 100;\n        }\n\n    \/*\n        \/\/ANFANG Alternative\n        if (vel_cmd.linear.x==0 && vel_cmd.angular.z==0){vl=0;vr=0;}\n        else if(vel_cmd.linear.x == 0){\n            \/\/ turning\n            vr = vel_cmd.angular.z * base_width \/ 2.0;\n            vl = (-1) * vr;\n        }\n        else if(vel_cmd.angular.z == 0){\n            \/\/ forward \/ backward\n            vl = vr = vel_cmd.linear.x;\n        }\n        else{\n            \/\/ moving doing arcs\n            vl = vel_cmd.linear.x - vel_cmd.angular.z * base_width \/ 2.0;\n            if (vl > max_vl) {vl=max_vl;}\n            if (vl < min_vl) {vl=min_vl;}\n            vr = vel_cmd.linear.x + vel_cmd.angular.z * base_width \/ 2.0;\n            if (vr > max_vr) {vr=max_vr;}\n            if (vr < min_vr) {vr=min_vr;}\n        }\n        \/\/ENDE Alternative\n    *\/\n}\n\n\nint main( int argc, char* argv[] ){\n\n    \/\/ Setup as ROS node\n    \/\/ *****************\n    ros::init(argc, argv, \"base_controller\" );\n    ros::NodeHandle n;\n    ros::Subscriber sub = n.subscribe(\"\/cmd_vel\", 10, cmd_vel_callback);\n    ros::Publisher encoders_pub = n.advertise<base_controller::encoders>(\"encoders\",10);\n    ros::Publisher md49data_pub = n.advertise<base_controller::md49data>(\"md49data\",10);\n\n    ros::Rate loop_rate(10);\n    ROS_INFO(\"Starting base_controller node:\");\n    ROS_INFO(\"============================================\");\n    ROS_INFO(\"subscribing to \/cmd_vel\");\n    ROS_INFO(\"publishing to \/encoders\");\n    ROS_INFO(\"publishing to \/md49data\");\n    ROS_INFO(\"============================================\");\n\n    \/\/ Open database md49data.db and add\n    \/\/ table md49commands\n    \/\/ *********************************\n    rc = sqlite3_open(\"data\/md49data.db\", &db);\n    if( rc ){\n        ROS_INFO(\"Can't open database: %s\", sqlite3_errmsg(db));\n        exit(0);\n    }else{\n        ROS_INFO(\"Opened database successfully,\");\n    }\n\n    \/\/ Create table md49commands\n    \/\/ *************************\n    sql = \"CREATE TABLE md49commands(\"  \\\n     \"ID INT PRIMARY KEY     NOT NULL,\" \\\n     \"SpeedL         INT DEFAULT 128,\" \\\n     \"SpeedR         INT DEFAULT 128 );\" \\\n     \"INSERT INTO md49commands (ID,SpeedL,SpeedR) VALUES (1,128,128);\";\n    rc = sqlite3_exec(db, sql, NULL, 0, &zErrMsg);                      \/\/ Execute SQL statement\n    if( rc != SQLITE_OK ){\n        ROS_INFO(\"SQL message: %s\", zErrMsg);\n        sqlite3_free(zErrMsg);\n    }else{\n        ROS_INFO(\"table created successfully\");\n    }\n\n    \/\/ Set SpeedL and SpeedR to\n    \/\/ defaults =128\n    \/\/ ************************\n    char sql_buffer[200];\n    int cx;\n    cx = snprintf (sql_buffer,200,\"UPDATE md49commands SET SpeedL=%i, SpeedR=%i WHERE ID=1\", 128,128);\n\n    rc = sqlite3_exec(db, sql_buffer, NULL, 0, &zErrMsg);\n    if( rc != SQLITE_OK ){\n        ROS_INFO(\"SQL message: %s\", zErrMsg);\n        sqlite3_free(zErrMsg);\n    }else{\n        ROS_INFO(\"SpeedL & SpeedR set to defaults in Table md49commands(md49data.db)\");\n    }\n\n\n    while(n.ok())\n    {\n        \/\/ Read encoder values and other data from MD49:\n        \/\/ serial_controller_node reads data from AVR-Master\n        \/\/ and provides that data in md49_data.txt\n        \/\/ *************************************************\n\/\/        read_MD49_Data();\n\n        \/\/ Set MD49 speed_l and speed_r:\n        \/\/ serial_controller_node reads commands from\n        \/\/ md49_commands.txt and writes commands to AVR-Master\n        \/\/ ***************************************************\n        if ((speed_l != last_speed_l) || (speed_r != last_speed_r)){\n            set_md49_speed(speed_l,speed_r);\n            last_speed_l=speed_l;\n            last_speed_r=speed_r;\n        }\n\n        \/\/ Publish encoder values to topic \/encoders (custom message)\n        \/\/ **********************************************************\n        encoders.encoder_l=EncoderL;\n        encoders.encoder_r=EncoderR;\n        encoders_pub.publish(encoders);\n\n        \/\/ Publish MD49 data to topic \/md49data (custom message)\n        \/\/ *****************************************************\n        md49data.speed_l = serialBuffer[8];\n        md49data.speed_r = serialBuffer[9];\n        md49data.volt = serialBuffer[10];\n        md49data.current_l = serialBuffer[11];\n        md49data.current_r = serialBuffer[12];\n        md49data.error = serialBuffer[13];\n        md49data.acceleration = serialBuffer[14];\n        md49data.mode = serialBuffer[15];\n        md49data.regulator = serialBuffer[16];\n        md49data.timeout = serialBuffer[17];\n        md49data_pub.publish(md49data);\n\n        ros::spinOnce();\n        loop_rate.sleep();\n\n    }\/\/ end.mainloop\n\n    return 1;\n} \/\/ end.main\n\n\nvoid read_MD49_Data (void){\n\n    \/\/ Read all MD49 data from md49_data.txt\n    \/\/ *************************************\n    string line;\n    ifstream myfile (\"md49_data.txt\");\n    if (myfile.is_open()){\n        int i=0;\n        while (getline (myfile,line)){\n            \/\/cout << line << '\\n';\n            char data[10];\n            std::copy(line.begin(), line.end(), data);\n            serialBuffer[i]=atoi(data);\n            i =i++;\n        }\n        myfile.close();\n\n    }\n    else ROS_ERROR(\"Unable to open file: md49_data.txt\");\n\n    \/\/ Put toghether new encodervalues\n    \/\/ *******************************\n    EncoderL = serialBuffer[0] << 24;                        \/\/ Put together first encoder value\n    EncoderL |= (serialBuffer[1] << 16);\n    EncoderL |= (serialBuffer[2] << 8);\n    EncoderL |= (serialBuffer[3]);\n    EncoderR = serialBuffer[4] << 24;                        \/\/ Put together second encoder value\n    EncoderR |= (serialBuffer[5] << 16);\n    EncoderR |= (serialBuffer[6] << 8);\n    EncoderR |= (serialBuffer[7]);\n\n}\n\nvoid set_md49_speed (unsigned char speed_l, unsigned char speed_r){\n\n    \/\/ Set SpeedL=speed_l and\n    \/\/ SpeedR=speed_r in Table md49commands\n    \/\/ ************************************\n    char sql_buffer[200];\n    int cx;\n    cx = snprintf (sql_buffer,200,\"UPDATE md49commands SET SpeedL=%i, SpeedR=%i WHERE ID=1\", speed_l,speed_r);\n\n    rc = sqlite3_exec(db, sql_buffer, NULL, 0, &zErrMsg);\n    if( rc != SQLITE_OK ){\n        ROS_WARN(\"SQL message: %s\", zErrMsg);\n        sqlite3_free(zErrMsg);\n    }else{\n        ROS_INFO(\"Set SpeedL=%i and SpeedR=%i in Table md49commands(md49data.db)\",speed_l, speed_r);\n    }\n}\n\n\n<commit_msg>Update code<commit_after>#include <iostream>                                         \/* allows to perform standard input and output operations *\/\n#include <fstream>\n#include <stdio.h>                                          \/* Standard input\/output definitions *\/\n#include <stdint.h>                                         \/* Standard input\/output definitions *\/\n#include <stdlib.h>                                         \/* defines several general purpose functions *\/\n#include <unistd.h>                                         \/* UNIX standard function definitions *\/\n#include <fcntl.h>                                          \/* File control definitions *\/\n#include <ctype.h>                                          \/* isxxx() *\/\n#include <ros\/ros.h>                                        \/* ROS *\/\n#include <geometry_msgs\/Twist.h>                            \/* ROS Twist message *\/\n#include <base_controller\/encoders.h>                       \/* Custom message \/encoders *\/\n#include <base_controller\/md49data.h>                       \/* Custom message \/encoders *\/\n#include <sqlite3.h>\n\nint32_t EncoderL;                                           \/* stores encoder value left read from md49 *\/\nint32_t EncoderR;                                           \/* stores encoder value right read from md49 *\/\nunsigned char speed_l=128, speed_r=128;                     \/* speed to set for MD49 *\/\nunsigned char last_speed_l=128, last_speed_r=128;           \/* speed to set for MD49 *\/\ndouble vr = 0.0;\ndouble vl = 0.0;\ndouble max_vr = 0.2;\ndouble max_vl = 0.2;\ndouble min_vr = 0.2;\ndouble min_vl = 0.2;\ndouble base_width = 0.4;                                    \/* Base width in meters *\/\n\nunsigned char serialBuffer[18];                             \/* Serial buffer to store uart data *\/\nvoid read_MD49_Data (void);\nvoid set_md49_speed (unsigned char speed_l, unsigned char speed_r);\n\n\n\/\/ sqlite globals\nsqlite3 *db;\nchar *zErrMsg = 0;\nint  rc;\nconst char *sql;\nconst char* data = \"Callback function called\";\n\nusing namespace std;\n\nbase_controller::encoders encoders;\nbase_controller::md49data md49data;\n\nvoid cmd_vel_callback(const geometry_msgs::Twist& vel_cmd){\n\n        if (vel_cmd.linear.x>0){\n            speed_l = 255;\n            speed_r = 255;\n        }\n        if (vel_cmd.linear.x<0){\n            speed_l = 1;\n            speed_r = 1;\n        }\n        if (vel_cmd.linear.x==0 && vel_cmd.angular.z==0){\n            speed_l = 128;\n            speed_r = 128;\n        }\n        if (vel_cmd.angular.z>0){\n            speed_l = 1;\n            speed_r = 255;\n        }\n        if (vel_cmd.angular.z<0){\n            speed_l = 255;\n            speed_r = 1;\n        }\n\n    \/*\n        \/\/ANFANG Alternative\n        if (vel_cmd.linear.x==0 && vel_cmd.angular.z==0){vl=0;vr=0;}\n        else if(vel_cmd.linear.x == 0){\n            \/\/ turning\n            vr = vel_cmd.angular.z * base_width \/ 2.0;\n            vl = (-1) * vr;\n        }\n        else if(vel_cmd.angular.z == 0){\n            \/\/ forward \/ backward\n            vl = vr = vel_cmd.linear.x;\n        }\n        else{\n            \/\/ moving doing arcs\n            vl = vel_cmd.linear.x - vel_cmd.angular.z * base_width \/ 2.0;\n            if (vl > max_vl) {vl=max_vl;}\n            if (vl < min_vl) {vl=min_vl;}\n            vr = vel_cmd.linear.x + vel_cmd.angular.z * base_width \/ 2.0;\n            if (vr > max_vr) {vr=max_vr;}\n            if (vr < min_vr) {vr=min_vr;}\n        }\n        \/\/ENDE Alternative\n    *\/\n}\n\n\nint main( int argc, char* argv[] ){\n\n    \/\/ Setup as ROS node\n    \/\/ *****************\n    ros::init(argc, argv, \"base_controller\" );\n    ros::NodeHandle n;\n    ros::Subscriber sub = n.subscribe(\"\/cmd_vel\", 10, cmd_vel_callback);\n    ros::Publisher encoders_pub = n.advertise<base_controller::encoders>(\"encoders\",10);\n    ros::Publisher md49data_pub = n.advertise<base_controller::md49data>(\"md49data\",10);\n\n    ros::Rate loop_rate(10);\n    ROS_INFO(\"Starting base_controller node:\");\n    ROS_INFO(\"============================================\");\n    ROS_INFO(\"subscribing to \/cmd_vel\");\n    ROS_INFO(\"publishing to \/encoders\");\n    ROS_INFO(\"publishing to \/md49data\");\n    ROS_INFO(\"============================================\");\n\n    \/\/ Open database md49data.db and add\n    \/\/ table md49commands\n    \/\/ *********************************\n    rc = sqlite3_open(\"data\/md49data.db\", &db);\n    if( rc ){\n        ROS_INFO(\"Can't open database: %s\", sqlite3_errmsg(db));\n        exit(0);\n    }else{\n        ROS_INFO(\"Opened database successfully,\");\n    }\n\n    \/\/ Create table md49commands\n    \/\/ *************************\n    sql = \"CREATE TABLE md49commands(\"  \\\n     \"ID INT PRIMARY KEY     NOT NULL,\" \\\n     \"SpeedL         INT DEFAULT 128,\" \\\n     \"SpeedR         INT DEFAULT 128 );\" \\\n     \"INSERT INTO md49commands (ID,SpeedL,SpeedR) VALUES (1,128,128);\";\n    rc = sqlite3_exec(db, sql, NULL, 0, &zErrMsg);                      \/\/ Execute SQL statement\n    if( rc != SQLITE_OK ){\n        ROS_INFO(\"SQL message: %s\", zErrMsg);\n        sqlite3_free(zErrMsg);\n    }else{\n        ROS_INFO(\"table created successfully\");\n    }\n\n    \/\/ Set SpeedL and SpeedR to\n    \/\/ defaults =128\n    \/\/ ************************\n    char sql_buffer[200];\n    int cx;\n    cx = snprintf (sql_buffer,200,\"UPDATE md49commands SET SpeedL=%i, SpeedR=%i WHERE ID=1\", 128,128);\n\n    rc = sqlite3_exec(db, sql_buffer, NULL, 0, &zErrMsg);\n    if( rc != SQLITE_OK ){\n        ROS_INFO(\"SQL message: %s\", zErrMsg);\n        sqlite3_free(zErrMsg);\n    }else{\n        ROS_INFO(\"SpeedL & SpeedR set to defaults in Table md49commands(md49data.db)\");\n    }\n\n\n    while(n.ok())\n    {\n        \/\/ Read encoder values and other data from MD49:\n        \/\/ serial_controller_node reads data from AVR-Master\n        \/\/ and provides that data in md49_data.txt\n        \/\/ *************************************************\n\/\/        read_MD49_Data();\n\n        \/\/ Set MD49 speed_l and speed_r:\n        \/\/ serial_controller_node reads commands from\n        \/\/ md49_commands.txt and writes commands to AVR-Master\n        \/\/ ***************************************************\n        if ((speed_l != last_speed_l) || (speed_r != last_speed_r)){\n            set_md49_speed(speed_l,speed_r);\n            last_speed_l=speed_l;\n            last_speed_r=speed_r;\n        }\n\n        \/\/ Publish encoder values to topic \/encoders (custom message)\n        \/\/ **********************************************************\n        encoders.encoder_l=EncoderL;\n        encoders.encoder_r=EncoderR;\n        encoders_pub.publish(encoders);\n\n        \/\/ Publish MD49 data to topic \/md49data (custom message)\n        \/\/ *****************************************************\n        md49data.speed_l = serialBuffer[8];\n        md49data.speed_r = serialBuffer[9];\n        md49data.volt = serialBuffer[10];\n        md49data.current_l = serialBuffer[11];\n        md49data.current_r = serialBuffer[12];\n        md49data.error = serialBuffer[13];\n        md49data.acceleration = serialBuffer[14];\n        md49data.mode = serialBuffer[15];\n        md49data.regulator = serialBuffer[16];\n        md49data.timeout = serialBuffer[17];\n        md49data_pub.publish(md49data);\n\n        ros::spinOnce();\n        loop_rate.sleep();\n\n    }\/\/ end.mainloop\n\n    return 1;\n} \/\/ end.main\n\n\nvoid read_MD49_Data (void){\n\n    \/\/ Read all MD49 data from md49_data.txt\n    \/\/ *************************************\n    string line;\n    ifstream myfile (\"md49_data.txt\");\n    if (myfile.is_open()){\n        int i=0;\n        while (getline (myfile,line)){\n            \/\/cout << line << '\\n';\n            char data[10];\n            std::copy(line.begin(), line.end(), data);\n            serialBuffer[i]=atoi(data);\n            i =i++;\n        }\n        myfile.close();\n\n    }\n    else ROS_ERROR(\"Unable to open file: md49_data.txt\");\n\n    \/\/ Put toghether new encodervalues\n    \/\/ *******************************\n    EncoderL = serialBuffer[0] << 24;                        \/\/ Put together first encoder value\n    EncoderL |= (serialBuffer[1] << 16);\n    EncoderL |= (serialBuffer[2] << 8);\n    EncoderL |= (serialBuffer[3]);\n    EncoderR = serialBuffer[4] << 24;                        \/\/ Put together second encoder value\n    EncoderR |= (serialBuffer[5] << 16);\n    EncoderR |= (serialBuffer[6] << 8);\n    EncoderR |= (serialBuffer[7]);\n\n}\n\nvoid set_md49_speed (unsigned char speed_l, unsigned char speed_r){\n\n    \/\/ Set SpeedL=speed_l and\n    \/\/ SpeedR=speed_r in Table md49commands\n    \/\/ ************************************\n    char sql_buffer[200];\n    int cx;\n    cx = snprintf (sql_buffer,200,\"UPDATE md49commands SET SpeedL=%i, SpeedR=%i WHERE ID=1\", speed_l,speed_r);\n\n    rc = sqlite3_exec(db, sql_buffer, NULL, 0, &zErrMsg);\n    if( rc != SQLITE_OK ){\n        ROS_WARN(\"SQL message: %s\", zErrMsg);\n        sqlite3_free(zErrMsg);\n    }else{\n        ROS_INFO(\"Set SpeedL=%i and SpeedR=%i in Table md49commands(md49data.db)\",speed_l, speed_r);\n    }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- CompletionInstance.cpp -------------------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2019 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\/IDE\/CompletionInstance.h\"\n\n#include \"swift\/AST\/ASTContext.h\"\n#include \"swift\/AST\/DiagnosticEngine.h\"\n#include \"swift\/AST\/DiagnosticsFrontend.h\"\n#include \"swift\/AST\/Module.h\"\n#include \"swift\/AST\/SourceFile.h\"\n#include \"swift\/Basic\/LangOptions.h\"\n#include \"swift\/Basic\/SourceManager.h\"\n#include \"swift\/Driver\/FrontendUtil.h\"\n#include \"swift\/Frontend\/Frontend.h\"\n#include \"swift\/Parse\/Lexer.h\"\n#include \"swift\/Parse\/PersistentParserState.h\"\n#include \"swift\/Subsystems.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n\nusing namespace swift;\nusing namespace ide;\n\nstd::unique_ptr<llvm::MemoryBuffer>\nswift::ide::makeCodeCompletionMemoryBuffer(const llvm::MemoryBuffer *origBuf,\n                                           unsigned &Offset,\n                                           StringRef bufferIdentifier) {\n\n  auto origBuffSize = origBuf->getBufferSize();\n  if (Offset > origBuffSize)\n    Offset = origBuffSize;\n\n  auto newBuffer = llvm::WritableMemoryBuffer::getNewUninitMemBuffer(\n      origBuffSize + 1, bufferIdentifier);\n  auto *pos = origBuf->getBufferStart() + Offset;\n  auto *newPos =\n      std::copy(origBuf->getBufferStart(), pos, newBuffer->getBufferStart());\n  *newPos = '\\0';\n  std::copy(pos, origBuf->getBufferEnd(), newPos + 1);\n\n  return std::unique_ptr<llvm::MemoryBuffer>(newBuffer.release());\n}\n\nnamespace {\n\/\/\/ Returns index number of \\p D in \\p Decls . If it's not found, returns ~0.\ntemplate <typename Range>\nunsigned findIndexInRange(Decl *D, const Range &Decls) {\n  unsigned N = 0;\n  for (auto I = Decls.begin(), E = Decls.end(); I != E; ++I) {\n    if ((*I)->isImplicit())\n      continue;\n    if (*I == D)\n      return N;\n    ++N;\n  }\n  return ~0U;\n}\n\n\/\/\/ Return the element at \\p N in \\p Decls .\ntemplate <typename Range> Decl *getElementAt(const Range &Decls, unsigned N) {\n  for (auto I = Decls.begin(), E = Decls.end(); I != E; ++I) {\n    if ((*I)->isImplicit())\n      continue;\n    if (N == 0)\n      return *I;\n    --N;\n  }\n  return nullptr;\n}\n\n\/\/\/ Find the equivalent \\c DeclContext with \\p DC from \\p SF AST.\n\/\/\/ This assumes the AST which contains \\p DC has exact the same structure with\n\/\/\/ \\p SF.\n\/\/\/ FIXME: This doesn't support IfConfigDecl blocks. If \\p DC is in an inactive\n\/\/\/        config block, this function returns \\c false.\nstatic DeclContext *getEquivalentDeclContextFromSourceFile(DeclContext *DC,\n                                                           SourceFile *SF) {\n  auto *newDC = DC;\n  \/\/ NOTE: Shortcut for DC->getParentSourceFile() == SF case is not needed\n  \/\/ because they should be always different.\n\n  \/\/ Get the index path in the current AST.\n  SmallVector<unsigned, 4> IndexStack;\n  do {\n    auto *D = newDC->getAsDecl();\n    if (!D)\n      return nullptr;\n    auto *parentDC = newDC->getParent();\n    unsigned N;\n\n    if (auto accessor = dyn_cast<AccessorDecl>(D)) {\n      \/\/ The AST for accessors is like:\n      \/\/   DeclContext -> AbstractStorageDecl -> AccessorDecl\n      \/\/ We need to push the index of the accessor within the accessor list\n      \/\/ of the storage.\n      auto *storage = accessor->getStorage();\n      if (!storage)\n        return nullptr;\n      auto accessorN = findIndexInRange(accessor, storage->getAllAccessors());\n      IndexStack.push_back(accessorN);\n      D = storage;\n    }\n\n    if (auto parentSF = dyn_cast<SourceFile>(parentDC))\n      N = findIndexInRange(D, parentSF->getTopLevelDecls());\n    else if (auto parentIDC =\n                 dyn_cast<IterableDeclContext>(parentDC->getAsDecl()))\n      N = findIndexInRange(D, parentIDC->getMembers());\n    else\n      llvm_unreachable(\"invalid DC kind for finding equivalent DC (indexpath)\");\n\n    \/\/ Not found in the decl context tree.\n    \/\/ FIXME: Probably DC is in an inactive #if block.\n    if (N == ~0U) {\n      return nullptr;\n    }\n\n    IndexStack.push_back(N);\n    newDC = parentDC;\n  } while (!newDC->isModuleScopeContext());\n\n  assert(isa<SourceFile>(newDC) && \"DC should be in a SourceFile\");\n\n  \/\/ Query the equivalent decl context from the base SourceFile using the index\n  \/\/ path.\n  newDC = SF;\n  do {\n    auto N = IndexStack.pop_back_val();\n    Decl *D;\n    if (auto parentSF = dyn_cast<SourceFile>(newDC))\n      D = getElementAt(parentSF->getTopLevelDecls(), N);\n    else if (auto parentIDC = dyn_cast<IterableDeclContext>(newDC->getAsDecl()))\n      D = getElementAt(parentIDC->getMembers(), N);\n    else\n      llvm_unreachable(\"invalid DC kind for finding equivalent DC (query)\");\n\n    if (auto storage = dyn_cast<AbstractStorageDecl>(D)) {\n      if (IndexStack.empty())\n        return nullptr;\n      auto accessorN = IndexStack.pop_back_val();\n      D = getElementAt(storage->getAllAccessors(), accessorN);\n    }\n\n    newDC = dyn_cast<DeclContext>(D);\n    if (!newDC)\n      return nullptr;\n  } while (!IndexStack.empty());\n\n  assert(newDC->getContextKind() == DC->getContextKind());\n\n  return newDC;\n}\n\n} \/\/ namespace\n\nbool CompletionInstance::performCachedOperaitonIfPossible(\n    const swift::CompilerInvocation &Invocation, llvm::hash_code ArgsHash,\n    llvm::MemoryBuffer *completionBuffer, unsigned int Offset,\n    DiagnosticConsumer *DiagC,\n    llvm::function_ref<void(CompilerInstance &)> Callback) {\n\n  if (!CachedCI)\n    return false;\n  if (CachedReuseCount >= MaxASTReuseCount)\n    return false;\n  if (CachedArgHash != ArgsHash)\n    return false;\n\n  auto &CI = *CachedCI;\n\n  if (!CI.hasPersistentParserState())\n    return false;\n  auto &oldState = CI.getPersistentParserState();\n  if (!oldState.hasCodeCompletionDelayedDeclState())\n    return false;\n\n  auto &SM = CI.getSourceMgr();\n  if (SM.getIdentifierForBuffer(SM.getCodeCompletionBufferID()) !=\n      completionBuffer->getBufferIdentifier())\n    return false;\n\n  auto &oldInfo = oldState.getCodeCompletionDelayedDeclState();\n\n  \/\/ Currently, only completions within a function body is supported.\n  if (oldInfo.Kind != CodeCompletionDelayedDeclKind::FunctionBody)\n    return false;\n\n  \/\/ Parse the new buffer into temporary SourceFile.\n  SourceManager tmpSM;\n  auto tmpBufferID = tmpSM.addMemBufferCopy(completionBuffer);\n  tmpSM.setCodeCompletionPoint(tmpBufferID, Offset);\n\n  LangOptions langOpts;\n  langOpts.DisableParserLookup = true;\n  TypeCheckerOptions typeckOpts;\n  SearchPathOptions searchPathOpts;\n  DiagnosticEngine tmpDiags(tmpSM);\n  std::unique_ptr<ASTContext> Ctx(\n      ASTContext::get(langOpts, typeckOpts, searchPathOpts, tmpSM, tmpDiags));\n  registerIDERequestFunctions(Ctx->evaluator);\n  registerTypeCheckerRequestFunctions(Ctx->evaluator);\n  registerSILGenRequestFunctions(Ctx->evaluator);\n  ModuleDecl *M = ModuleDecl::create(Identifier(), *Ctx);\n  PersistentParserState newState;\n  SourceFile *newSF =\n      new (*Ctx) SourceFile(*M, SourceFileKind::Library, tmpBufferID,\n                            SourceFile::ImplicitModuleImportKind::None);\n  newSF->enableInterfaceHash();\n  \/\/ Ensure all non-function-body tokens are hashed into the interface hash\n  Ctx->LangOpts.EnableTypeFingerprints = false;\n  parseIntoSourceFileFull(*newSF, tmpBufferID, &newState);\n  \/\/ Couldn't find any completion token?\n  if (!newState.hasCodeCompletionDelayedDeclState())\n    return false;\n\n  auto &newInfo = newState.getCodeCompletionDelayedDeclState();\n\n  \/\/ The new completion must happens in function body too.\n  if (newInfo.Kind != CodeCompletionDelayedDeclKind::FunctionBody)\n    return false;\n\n  auto *oldSF = oldInfo.ParentContext->getParentSourceFile();\n\n  \/\/ If the interface has changed, AST must be refreshed.\n  llvm::SmallString<32> oldInterfaceHash{};\n  llvm::SmallString<32> newInterfaceHash{};\n  oldSF->getInterfaceHash(oldInterfaceHash);\n  newSF->getInterfaceHash(newInterfaceHash);\n  if (oldInterfaceHash != newInterfaceHash)\n    return false;\n\n  DeclContext *DC =\n      getEquivalentDeclContextFromSourceFile(newInfo.ParentContext, oldSF);\n  if (!DC)\n    return false;\n\n  \/\/ OK, we can perform fast completion for this. Update the orignal delayed\n  \/\/ decl state.\n\n  \/\/ Fast completion keeps the buffer in memory for multiple completions.\n  \/\/ To reduce the consumption, slice the source buffer so it only holds\n  \/\/ the portion that is needed for the second pass.\n  auto startOffset = newInfo.StartOffset;\n  if (newInfo.PrevOffset != ~0u)\n    startOffset = newInfo.PrevOffset;\n  auto startLoc = tmpSM.getLocForOffset(tmpBufferID, startOffset);\n  startLoc = Lexer::getLocForStartOfLine(tmpSM, startLoc);\n  startOffset = tmpSM.getLocOffsetInBuffer(startLoc, tmpBufferID);\n\n  auto endOffset = newInfo.EndOffset;\n  auto endLoc = tmpSM.getLocForOffset(tmpBufferID, endOffset);\n  endLoc = Lexer::getLocForEndOfToken(tmpSM, endLoc);\n  endOffset = tmpSM.getLocOffsetInBuffer(endLoc, tmpBufferID);\n\n  newInfo.StartOffset -= startOffset;\n  newInfo.EndOffset -= startOffset;\n  if (newInfo.PrevOffset != ~0u)\n    newInfo.PrevOffset -= startOffset;\n\n  auto sourceText = completionBuffer->getBuffer().slice(startOffset, endOffset);\n  auto newOffset = Offset - startOffset;\n\n  auto newBufferID =\n      SM.addMemBufferCopy(sourceText, completionBuffer->getBufferIdentifier());\n  SM.openVirtualFile(SM.getLocForBufferStart(newBufferID),\n                     tmpSM.getDisplayNameForLoc(startLoc),\n                     tmpSM.getLineAndColumn(startLoc).first - 1);\n  SM.setCodeCompletionPoint(newBufferID, newOffset);\n\n  \/\/ Construct dummy scopes. We don't need to restore the original scope\n  \/\/ because they are probably not 'isResolvable()' anyway.\n  auto &SI = oldState.getScopeInfo();\n  assert(SI.getCurrentScope() == nullptr);\n  Scope Top(SI, ScopeKind::TopLevel);\n  Scope Body(SI, ScopeKind::FunctionBody);\n\n  oldInfo.ParentContext = DC;\n  oldInfo.StartOffset = newInfo.StartOffset;\n  oldInfo.EndOffset = newInfo.EndOffset;\n  oldInfo.PrevOffset = newInfo.PrevOffset;\n  oldState.restoreCodeCompletionDelayedDeclState(oldInfo);\n\n  auto *AFD = cast<AbstractFunctionDecl>(DC);\n  if (AFD->isBodySkipped())\n    AFD->setBodyDelayed(AFD->getBodySourceRange());\n  if (DiagC)\n    CI.addDiagnosticConsumer(DiagC);\n\n  CI.getDiags().diagnose(SM.getLocForOffset(newBufferID, newInfo.StartOffset),\n                         diag::completion_reusing_astcontext);\n\n  Callback(CI);\n\n  if (DiagC)\n    CI.removeDiagnosticConsumer(DiagC);\n\n  CachedReuseCount += 1;\n\n  return true;\n}\n\nbool CompletionInstance::performNewOperation(\n    Optional<llvm::hash_code> ArgsHash, swift::CompilerInvocation &Invocation,\n    llvm::IntrusiveRefCntPtr<llvm::vfs::FileSystem> FileSystem,\n    llvm::MemoryBuffer *completionBuffer, unsigned int Offset,\n    std::string &Error, DiagnosticConsumer *DiagC,\n    llvm::function_ref<void(CompilerInstance &)> Callback) {\n\n  auto TheInstance = std::make_unique<CompilerInstance>();\n  auto &CI = *TheInstance;\n  if (DiagC)\n    CI.addDiagnosticConsumer(DiagC);\n\n  if (FileSystem != llvm::vfs::getRealFileSystem())\n    CI.getSourceMgr().setFileSystem(FileSystem);\n\n  Invocation.setCodeCompletionPoint(completionBuffer, Offset);\n\n  if (CI.setup(Invocation)) {\n    Error = \"failed to setup compiler instance\";\n    return false;\n  }\n  registerIDERequestFunctions(CI.getASTContext().evaluator);\n\n  CI.performParseAndResolveImportsOnly();\n  if (CI.hasPersistentParserState())\n    Callback(CI);\n\n  if (DiagC)\n    CI.removeDiagnosticConsumer(DiagC);\n\n  if (ArgsHash.hasValue()) {\n    CachedCI = std::move(TheInstance);\n    CachedArgHash = *ArgsHash;\n    CachedReuseCount = 0;\n  }\n\n  return true;\n}\n\nbool swift::ide::CompletionInstance::performOperation(\n    swift::CompilerInvocation &Invocation, llvm::ArrayRef<const char *> Args,\n    llvm::IntrusiveRefCntPtr<llvm::vfs::FileSystem> FileSystem,\n    llvm::MemoryBuffer *completionBuffer, unsigned int Offset,\n    bool EnableASTCaching, std::string &Error, DiagnosticConsumer *DiagC,\n    llvm::function_ref<void(CompilerInstance &)> Callback) {\n\n  \/\/ Always disable source location resolutions from .swiftsourceinfo file\n  \/\/ because they're somewhat heavy operations and aren't needed for completion.\n  Invocation.getFrontendOptions().IgnoreSwiftSourceInfo = true;\n\n  \/\/ Disable to build syntax tree because code-completion skips some portion of\n  \/\/ source text. That breaks an invariant of syntax tree building.\n  Invocation.getLangOptions().BuildSyntaxTree = false;\n\n  \/\/ This validation may call stat(2) many times. Disable it to prevent\n  \/\/ performance regression.\n  Invocation.getSearchPathOptions().DisableModulesValidateSystemDependencies =\n      true;\n\n  \/\/ Since caching uses the interface hash, and since per type fingerprints\n  \/\/ weaken that hash, disable them here:\n  Invocation.getLangOptions().EnableTypeFingerprints = false;\n\n  \/\/ FIXME: ASTScopeLookup doesn't support code completion yet.\n  Invocation.disableASTScopeLookup();\n\n  if (EnableASTCaching) {\n    \/\/ Compute the signature of the invocation.\n    llvm::hash_code ArgsHash(0);\n    for (auto arg : Args)\n      ArgsHash = llvm::hash_combine(ArgsHash, StringRef(arg));\n\n    \/\/ Concurrent completions will block so that they have higher chance to use\n    \/\/ the cached completion instance.\n    std::lock_guard<std::mutex> lock(mtx);\n\n    if (performCachedOperaitonIfPossible(Invocation, ArgsHash, completionBuffer,\n                                         Offset, DiagC, Callback))\n      return true;\n\n    if (performNewOperation(ArgsHash, Invocation, FileSystem, completionBuffer,\n                            Offset, Error, DiagC, Callback))\n      return true;\n  } else {\n    \/\/ Concurrent completions may happen in parallel when caching is disabled.\n    if (performNewOperation(None, Invocation, FileSystem, completionBuffer,\n                            Offset, Error, DiagC, Callback))\n      return true;\n  }\n\n  assert(!Error.empty());\n  return false;\n}\n<commit_msg>Revert \"[CodeCompletion] Disable module system headers validation\"<commit_after>\/\/===--- CompletionInstance.cpp -------------------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2019 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\/IDE\/CompletionInstance.h\"\n\n#include \"swift\/AST\/ASTContext.h\"\n#include \"swift\/AST\/DiagnosticEngine.h\"\n#include \"swift\/AST\/DiagnosticsFrontend.h\"\n#include \"swift\/AST\/Module.h\"\n#include \"swift\/AST\/SourceFile.h\"\n#include \"swift\/Basic\/LangOptions.h\"\n#include \"swift\/Basic\/SourceManager.h\"\n#include \"swift\/Driver\/FrontendUtil.h\"\n#include \"swift\/Frontend\/Frontend.h\"\n#include \"swift\/Parse\/Lexer.h\"\n#include \"swift\/Parse\/PersistentParserState.h\"\n#include \"swift\/Subsystems.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n\nusing namespace swift;\nusing namespace ide;\n\nstd::unique_ptr<llvm::MemoryBuffer>\nswift::ide::makeCodeCompletionMemoryBuffer(const llvm::MemoryBuffer *origBuf,\n                                           unsigned &Offset,\n                                           StringRef bufferIdentifier) {\n\n  auto origBuffSize = origBuf->getBufferSize();\n  if (Offset > origBuffSize)\n    Offset = origBuffSize;\n\n  auto newBuffer = llvm::WritableMemoryBuffer::getNewUninitMemBuffer(\n      origBuffSize + 1, bufferIdentifier);\n  auto *pos = origBuf->getBufferStart() + Offset;\n  auto *newPos =\n      std::copy(origBuf->getBufferStart(), pos, newBuffer->getBufferStart());\n  *newPos = '\\0';\n  std::copy(pos, origBuf->getBufferEnd(), newPos + 1);\n\n  return std::unique_ptr<llvm::MemoryBuffer>(newBuffer.release());\n}\n\nnamespace {\n\/\/\/ Returns index number of \\p D in \\p Decls . If it's not found, returns ~0.\ntemplate <typename Range>\nunsigned findIndexInRange(Decl *D, const Range &Decls) {\n  unsigned N = 0;\n  for (auto I = Decls.begin(), E = Decls.end(); I != E; ++I) {\n    if ((*I)->isImplicit())\n      continue;\n    if (*I == D)\n      return N;\n    ++N;\n  }\n  return ~0U;\n}\n\n\/\/\/ Return the element at \\p N in \\p Decls .\ntemplate <typename Range> Decl *getElementAt(const Range &Decls, unsigned N) {\n  for (auto I = Decls.begin(), E = Decls.end(); I != E; ++I) {\n    if ((*I)->isImplicit())\n      continue;\n    if (N == 0)\n      return *I;\n    --N;\n  }\n  return nullptr;\n}\n\n\/\/\/ Find the equivalent \\c DeclContext with \\p DC from \\p SF AST.\n\/\/\/ This assumes the AST which contains \\p DC has exact the same structure with\n\/\/\/ \\p SF.\n\/\/\/ FIXME: This doesn't support IfConfigDecl blocks. If \\p DC is in an inactive\n\/\/\/        config block, this function returns \\c false.\nstatic DeclContext *getEquivalentDeclContextFromSourceFile(DeclContext *DC,\n                                                           SourceFile *SF) {\n  auto *newDC = DC;\n  \/\/ NOTE: Shortcut for DC->getParentSourceFile() == SF case is not needed\n  \/\/ because they should be always different.\n\n  \/\/ Get the index path in the current AST.\n  SmallVector<unsigned, 4> IndexStack;\n  do {\n    auto *D = newDC->getAsDecl();\n    if (!D)\n      return nullptr;\n    auto *parentDC = newDC->getParent();\n    unsigned N;\n\n    if (auto accessor = dyn_cast<AccessorDecl>(D)) {\n      \/\/ The AST for accessors is like:\n      \/\/   DeclContext -> AbstractStorageDecl -> AccessorDecl\n      \/\/ We need to push the index of the accessor within the accessor list\n      \/\/ of the storage.\n      auto *storage = accessor->getStorage();\n      if (!storage)\n        return nullptr;\n      auto accessorN = findIndexInRange(accessor, storage->getAllAccessors());\n      IndexStack.push_back(accessorN);\n      D = storage;\n    }\n\n    if (auto parentSF = dyn_cast<SourceFile>(parentDC))\n      N = findIndexInRange(D, parentSF->getTopLevelDecls());\n    else if (auto parentIDC =\n                 dyn_cast<IterableDeclContext>(parentDC->getAsDecl()))\n      N = findIndexInRange(D, parentIDC->getMembers());\n    else\n      llvm_unreachable(\"invalid DC kind for finding equivalent DC (indexpath)\");\n\n    \/\/ Not found in the decl context tree.\n    \/\/ FIXME: Probably DC is in an inactive #if block.\n    if (N == ~0U) {\n      return nullptr;\n    }\n\n    IndexStack.push_back(N);\n    newDC = parentDC;\n  } while (!newDC->isModuleScopeContext());\n\n  assert(isa<SourceFile>(newDC) && \"DC should be in a SourceFile\");\n\n  \/\/ Query the equivalent decl context from the base SourceFile using the index\n  \/\/ path.\n  newDC = SF;\n  do {\n    auto N = IndexStack.pop_back_val();\n    Decl *D;\n    if (auto parentSF = dyn_cast<SourceFile>(newDC))\n      D = getElementAt(parentSF->getTopLevelDecls(), N);\n    else if (auto parentIDC = dyn_cast<IterableDeclContext>(newDC->getAsDecl()))\n      D = getElementAt(parentIDC->getMembers(), N);\n    else\n      llvm_unreachable(\"invalid DC kind for finding equivalent DC (query)\");\n\n    if (auto storage = dyn_cast<AbstractStorageDecl>(D)) {\n      if (IndexStack.empty())\n        return nullptr;\n      auto accessorN = IndexStack.pop_back_val();\n      D = getElementAt(storage->getAllAccessors(), accessorN);\n    }\n\n    newDC = dyn_cast<DeclContext>(D);\n    if (!newDC)\n      return nullptr;\n  } while (!IndexStack.empty());\n\n  assert(newDC->getContextKind() == DC->getContextKind());\n\n  return newDC;\n}\n\n} \/\/ namespace\n\nbool CompletionInstance::performCachedOperaitonIfPossible(\n    const swift::CompilerInvocation &Invocation, llvm::hash_code ArgsHash,\n    llvm::MemoryBuffer *completionBuffer, unsigned int Offset,\n    DiagnosticConsumer *DiagC,\n    llvm::function_ref<void(CompilerInstance &)> Callback) {\n\n  if (!CachedCI)\n    return false;\n  if (CachedReuseCount >= MaxASTReuseCount)\n    return false;\n  if (CachedArgHash != ArgsHash)\n    return false;\n\n  auto &CI = *CachedCI;\n\n  if (!CI.hasPersistentParserState())\n    return false;\n  auto &oldState = CI.getPersistentParserState();\n  if (!oldState.hasCodeCompletionDelayedDeclState())\n    return false;\n\n  auto &SM = CI.getSourceMgr();\n  if (SM.getIdentifierForBuffer(SM.getCodeCompletionBufferID()) !=\n      completionBuffer->getBufferIdentifier())\n    return false;\n\n  auto &oldInfo = oldState.getCodeCompletionDelayedDeclState();\n\n  \/\/ Currently, only completions within a function body is supported.\n  if (oldInfo.Kind != CodeCompletionDelayedDeclKind::FunctionBody)\n    return false;\n\n  \/\/ Parse the new buffer into temporary SourceFile.\n  SourceManager tmpSM;\n  auto tmpBufferID = tmpSM.addMemBufferCopy(completionBuffer);\n  tmpSM.setCodeCompletionPoint(tmpBufferID, Offset);\n\n  LangOptions langOpts;\n  langOpts.DisableParserLookup = true;\n  TypeCheckerOptions typeckOpts;\n  SearchPathOptions searchPathOpts;\n  DiagnosticEngine tmpDiags(tmpSM);\n  std::unique_ptr<ASTContext> Ctx(\n      ASTContext::get(langOpts, typeckOpts, searchPathOpts, tmpSM, tmpDiags));\n  registerIDERequestFunctions(Ctx->evaluator);\n  registerTypeCheckerRequestFunctions(Ctx->evaluator);\n  registerSILGenRequestFunctions(Ctx->evaluator);\n  ModuleDecl *M = ModuleDecl::create(Identifier(), *Ctx);\n  PersistentParserState newState;\n  SourceFile *newSF =\n      new (*Ctx) SourceFile(*M, SourceFileKind::Library, tmpBufferID,\n                            SourceFile::ImplicitModuleImportKind::None);\n  newSF->enableInterfaceHash();\n  \/\/ Ensure all non-function-body tokens are hashed into the interface hash\n  Ctx->LangOpts.EnableTypeFingerprints = false;\n  parseIntoSourceFileFull(*newSF, tmpBufferID, &newState);\n  \/\/ Couldn't find any completion token?\n  if (!newState.hasCodeCompletionDelayedDeclState())\n    return false;\n\n  auto &newInfo = newState.getCodeCompletionDelayedDeclState();\n\n  \/\/ The new completion must happens in function body too.\n  if (newInfo.Kind != CodeCompletionDelayedDeclKind::FunctionBody)\n    return false;\n\n  auto *oldSF = oldInfo.ParentContext->getParentSourceFile();\n\n  \/\/ If the interface has changed, AST must be refreshed.\n  llvm::SmallString<32> oldInterfaceHash{};\n  llvm::SmallString<32> newInterfaceHash{};\n  oldSF->getInterfaceHash(oldInterfaceHash);\n  newSF->getInterfaceHash(newInterfaceHash);\n  if (oldInterfaceHash != newInterfaceHash)\n    return false;\n\n  DeclContext *DC =\n      getEquivalentDeclContextFromSourceFile(newInfo.ParentContext, oldSF);\n  if (!DC)\n    return false;\n\n  \/\/ OK, we can perform fast completion for this. Update the orignal delayed\n  \/\/ decl state.\n\n  \/\/ Fast completion keeps the buffer in memory for multiple completions.\n  \/\/ To reduce the consumption, slice the source buffer so it only holds\n  \/\/ the portion that is needed for the second pass.\n  auto startOffset = newInfo.StartOffset;\n  if (newInfo.PrevOffset != ~0u)\n    startOffset = newInfo.PrevOffset;\n  auto startLoc = tmpSM.getLocForOffset(tmpBufferID, startOffset);\n  startLoc = Lexer::getLocForStartOfLine(tmpSM, startLoc);\n  startOffset = tmpSM.getLocOffsetInBuffer(startLoc, tmpBufferID);\n\n  auto endOffset = newInfo.EndOffset;\n  auto endLoc = tmpSM.getLocForOffset(tmpBufferID, endOffset);\n  endLoc = Lexer::getLocForEndOfToken(tmpSM, endLoc);\n  endOffset = tmpSM.getLocOffsetInBuffer(endLoc, tmpBufferID);\n\n  newInfo.StartOffset -= startOffset;\n  newInfo.EndOffset -= startOffset;\n  if (newInfo.PrevOffset != ~0u)\n    newInfo.PrevOffset -= startOffset;\n\n  auto sourceText = completionBuffer->getBuffer().slice(startOffset, endOffset);\n  auto newOffset = Offset - startOffset;\n\n  auto newBufferID =\n      SM.addMemBufferCopy(sourceText, completionBuffer->getBufferIdentifier());\n  SM.openVirtualFile(SM.getLocForBufferStart(newBufferID),\n                     tmpSM.getDisplayNameForLoc(startLoc),\n                     tmpSM.getLineAndColumn(startLoc).first - 1);\n  SM.setCodeCompletionPoint(newBufferID, newOffset);\n\n  \/\/ Construct dummy scopes. We don't need to restore the original scope\n  \/\/ because they are probably not 'isResolvable()' anyway.\n  auto &SI = oldState.getScopeInfo();\n  assert(SI.getCurrentScope() == nullptr);\n  Scope Top(SI, ScopeKind::TopLevel);\n  Scope Body(SI, ScopeKind::FunctionBody);\n\n  oldInfo.ParentContext = DC;\n  oldInfo.StartOffset = newInfo.StartOffset;\n  oldInfo.EndOffset = newInfo.EndOffset;\n  oldInfo.PrevOffset = newInfo.PrevOffset;\n  oldState.restoreCodeCompletionDelayedDeclState(oldInfo);\n\n  auto *AFD = cast<AbstractFunctionDecl>(DC);\n  if (AFD->isBodySkipped())\n    AFD->setBodyDelayed(AFD->getBodySourceRange());\n  if (DiagC)\n    CI.addDiagnosticConsumer(DiagC);\n\n  CI.getDiags().diagnose(SM.getLocForOffset(newBufferID, newInfo.StartOffset),\n                         diag::completion_reusing_astcontext);\n\n  Callback(CI);\n\n  if (DiagC)\n    CI.removeDiagnosticConsumer(DiagC);\n\n  CachedReuseCount += 1;\n\n  return true;\n}\n\nbool CompletionInstance::performNewOperation(\n    Optional<llvm::hash_code> ArgsHash, swift::CompilerInvocation &Invocation,\n    llvm::IntrusiveRefCntPtr<llvm::vfs::FileSystem> FileSystem,\n    llvm::MemoryBuffer *completionBuffer, unsigned int Offset,\n    std::string &Error, DiagnosticConsumer *DiagC,\n    llvm::function_ref<void(CompilerInstance &)> Callback) {\n\n  auto TheInstance = std::make_unique<CompilerInstance>();\n  auto &CI = *TheInstance;\n  if (DiagC)\n    CI.addDiagnosticConsumer(DiagC);\n\n  if (FileSystem != llvm::vfs::getRealFileSystem())\n    CI.getSourceMgr().setFileSystem(FileSystem);\n\n  Invocation.setCodeCompletionPoint(completionBuffer, Offset);\n\n  if (CI.setup(Invocation)) {\n    Error = \"failed to setup compiler instance\";\n    return false;\n  }\n  registerIDERequestFunctions(CI.getASTContext().evaluator);\n\n  CI.performParseAndResolveImportsOnly();\n  if (CI.hasPersistentParserState())\n    Callback(CI);\n\n  if (DiagC)\n    CI.removeDiagnosticConsumer(DiagC);\n\n  if (ArgsHash.hasValue()) {\n    CachedCI = std::move(TheInstance);\n    CachedArgHash = *ArgsHash;\n    CachedReuseCount = 0;\n  }\n\n  return true;\n}\n\nbool swift::ide::CompletionInstance::performOperation(\n    swift::CompilerInvocation &Invocation, llvm::ArrayRef<const char *> Args,\n    llvm::IntrusiveRefCntPtr<llvm::vfs::FileSystem> FileSystem,\n    llvm::MemoryBuffer *completionBuffer, unsigned int Offset,\n    bool EnableASTCaching, std::string &Error, DiagnosticConsumer *DiagC,\n    llvm::function_ref<void(CompilerInstance &)> Callback) {\n\n  \/\/ Always disable source location resolutions from .swiftsourceinfo file\n  \/\/ because they're somewhat heavy operations and aren't needed for completion.\n  Invocation.getFrontendOptions().IgnoreSwiftSourceInfo = true;\n\n  \/\/ Disable to build syntax tree because code-completion skips some portion of\n  \/\/ source text. That breaks an invariant of syntax tree building.\n  Invocation.getLangOptions().BuildSyntaxTree = false;\n\n  \/\/ Since caching uses the interface hash, and since per type fingerprints\n  \/\/ weaken that hash, disable them here:\n  Invocation.getLangOptions().EnableTypeFingerprints = false;\n\n  \/\/ FIXME: ASTScopeLookup doesn't support code completion yet.\n  Invocation.disableASTScopeLookup();\n\n  if (EnableASTCaching) {\n    \/\/ Compute the signature of the invocation.\n    llvm::hash_code ArgsHash(0);\n    for (auto arg : Args)\n      ArgsHash = llvm::hash_combine(ArgsHash, StringRef(arg));\n\n    \/\/ Concurrent completions will block so that they have higher chance to use\n    \/\/ the cached completion instance.\n    std::lock_guard<std::mutex> lock(mtx);\n\n    if (performCachedOperaitonIfPossible(Invocation, ArgsHash, completionBuffer,\n                                         Offset, DiagC, Callback))\n      return true;\n\n    if (performNewOperation(ArgsHash, Invocation, FileSystem, completionBuffer,\n                            Offset, Error, DiagC, Callback))\n      return true;\n  } else {\n    \/\/ Concurrent completions may happen in parallel when caching is disabled.\n    if (performNewOperation(None, Invocation, FileSystem, completionBuffer,\n                            Offset, Error, DiagC, Callback))\n      return true;\n  }\n\n  assert(!Error.empty());\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- LLVMSwiftAA.cpp - LLVM Alias Analysis for Swift ------------------===\/\/\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#include \"swift\/LLVMPasses\/Passes.h\"\n#include \"LLVMARCOpts.h\"\n#include \"llvm\/Analysis\/TargetLibraryInfo.h\"\n#include \"llvm\/IR\/LegacyPassManager.h\" \n#include \"llvm\/IR\/Module.h\"\n\nusing namespace llvm;\nusing swift::SwiftAAResult;\nusing swift::SwiftAAWrapperPass;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                           Alias Analysis Result\n\/\/===----------------------------------------------------------------------===\/\/\n\nllvm::ModRefInfo SwiftAAResult::getModRefInfo(llvm::ImmutableCallSite CS,\n                                              const llvm::MemoryLocation &Loc) {\n  \/\/ We know the mod-ref behavior of various runtime functions.\n  switch (classifyInstruction(*CS.getInstruction())) {\n  case RT_AllocObject:\n  case RT_NoMemoryAccessed:\n  case RT_Retain:\n  case RT_RetainUnowned:\n  case RT_CheckUnowned:\n  case RT_ObjCRetain:\n  case RT_BridgeRetain:\n  case RT_UnknownRetain:\n  case RT_RetainN:\n  case RT_UnknownRetainN:\n  case RT_BridgeRetainN:\n  case RT_FixLifetime:\n    \/\/ These entrypoints don't modify any compiler-visible state.\n    return MRI_NoModRef;\n  case RT_ReleaseN:\n  case RT_UnknownReleaseN:\n  case RT_BridgeReleaseN:\n  case RT_Release:\n  case RT_ObjCRelease:\n  case RT_BridgeRelease:\n  case RT_UnknownRelease:\n  case RT_Unknown:\n    break;\n  }\n\n  return AAResultBase::getModRefInfo(CS, Loc);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                        Alias Analysis Wrapper Pass\n\/\/===----------------------------------------------------------------------===\/\/\n\nchar SwiftAAWrapperPass::ID = 0;\nINITIALIZE_PASS_BEGIN(SwiftAAWrapperPass, \"swift-aa\",\n                      \"Swift Alias Analysis\", false, true)\nINITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)\nINITIALIZE_PASS_END(SwiftAAWrapperPass, \"swift-aa\",\n                    \"Swift Alias Analysis\", false, true)\n\nSwiftAAWrapperPass::SwiftAAWrapperPass() : ImmutablePass(ID) {\n  initializeSwiftAAWrapperPassPass(*PassRegistry::getPassRegistry());\n}\n\nbool SwiftAAWrapperPass::doInitialization(Module &M) {\n  Result.reset(new SwiftAAResult());\n  return false;\n}\n\nbool SwiftAAWrapperPass::doFinalization(Module &M) {\n  Result.reset();\n  return false;\n}\n\nvoid SwiftAAWrapperPass::getAnalysisUsage(AnalysisUsage &AU) const {\n  AU.setPreservesAll();\n  AU.addRequired<TargetLibraryInfoWrapperPass>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                           Top Level Entry Point\n\/\/===----------------------------------------------------------------------===\/\/\n\nllvm::ImmutablePass *swift::createSwiftAAWrapperPass() {\n  return new SwiftAAWrapperPass();\n}\n<commit_msg>[semantic-arc] Use BaseModRef effects from LLVMSwift.def in LLVMSwiftAA instead of a switch.<commit_after>\/\/===--- LLVMSwiftAA.cpp - LLVM Alias Analysis for Swift ------------------===\/\/\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#include \"swift\/LLVMPasses\/Passes.h\"\n#include \"LLVMARCOpts.h\"\n#include \"llvm\/Analysis\/TargetLibraryInfo.h\"\n#include \"llvm\/IR\/LegacyPassManager.h\" \n#include \"llvm\/IR\/Module.h\"\n\nusing namespace llvm;\nusing namespace swift;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                           Alias Analysis Result\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic ModRefInfo getConservativeModRefForKind(const llvm::Instruction &I) {\n  switch (classifyInstruction(I)) {\n#define KIND(Name, MemBehavior) case RT_ ## Name: return MRI_ ## MemBehavior;\n#include \"LLVMSwift.def\"\n  }\n}\n\nModRefInfo SwiftAAResult::getModRefInfo(llvm::ImmutableCallSite CS,\n                                        const llvm::MemoryLocation &Loc) {\n  \/\/ We know at compile time that certain entry points do not modify any\n  \/\/ compiler-visible state ever. Quickly check if we have one of those\n  \/\/ instructions and return if so.\n  if (MRI_NoModRef == getConservativeModRefForKind(*CS.getInstruction()))\n    return MRI_NoModRef;\n\n  \/\/ Otherwise, delegate to the rest of the AA ModRefInfo machinery.\n  return AAResultBase::getModRefInfo(CS, Loc);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                        Alias Analysis Wrapper Pass\n\/\/===----------------------------------------------------------------------===\/\/\n\nchar SwiftAAWrapperPass::ID = 0;\nINITIALIZE_PASS_BEGIN(SwiftAAWrapperPass, \"swift-aa\",\n                      \"Swift Alias Analysis\", false, true)\nINITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)\nINITIALIZE_PASS_END(SwiftAAWrapperPass, \"swift-aa\",\n                    \"Swift Alias Analysis\", false, true)\n\nSwiftAAWrapperPass::SwiftAAWrapperPass() : ImmutablePass(ID) {\n  initializeSwiftAAWrapperPassPass(*PassRegistry::getPassRegistry());\n}\n\nbool SwiftAAWrapperPass::doInitialization(Module &M) {\n  Result.reset(new SwiftAAResult());\n  return false;\n}\n\nbool SwiftAAWrapperPass::doFinalization(Module &M) {\n  Result.reset();\n  return false;\n}\n\nvoid SwiftAAWrapperPass::getAnalysisUsage(AnalysisUsage &AU) const {\n  AU.setPreservesAll();\n  AU.addRequired<TargetLibraryInfoWrapperPass>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                           Top Level Entry Point\n\/\/===----------------------------------------------------------------------===\/\/\n\nllvm::ImmutablePass *swift::createSwiftAAWrapperPass() {\n  return new SwiftAAWrapperPass();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n\n\/\/#include \"xUnit++\/xUnit++.h\"\n\n#include <dataspace\/FileDataspace.hpp>\n\ntemplate<typename DS>\nbool containsDS(DS ds, const K3::Value& val)\n{\n    return ds.template fold<bool>(\n            [val](bool fnd, K3::Value cur) {\n                if (fnd || val == cur)\n                    return true;\n                else\n                    return fnd;\n            }, false);\n}\n\ntemplate<typename DS>\nunsigned sizeDS(DS ds)\n{\n    return ds.template fold<unsigned>(\n            [](unsigned count, K3::Value) {\n                return count + 1;\n            }, 0);\n}\n\nclass ElementNotFoundException : public std::runtime_error\n{\n    public:\n    ElementNotFoundException(const K3::Value& val)\n        : std::runtime_error(\"Could not find element \" + val)\n    {}\n};\nclass ExtraElementsException : public std::runtime_error\n{\n    public:\n    ExtraElementsException(unsigned i)\n        : std::runtime_error(\"Dataspace had \" + toString(i) + \" extra elements\")\n    { }\n};\n\ntemplate<typename DS>\nstd::shared_ptr<DS> findAndRemoveElement(std::shared_ptr<DS> ds, const K3::Value& val)\n{\n    if (!ds)\n        return std::shared_ptr<DS>(nullptr);\n    else {\n        if (containsDS(*ds, val)) {\n            ds->delete_first(val);\n            return ds;\n        }\n        else\n            throw ElementNotFoundException(val);\n    }\n}\n\ntemplate<typename DS>\nbool compareDataspaceToList(DS dataspace, std::vector<K3::Value> l)\n{\n    std::shared_ptr<DS> ds_ptr = std::make_shared<DS>(dataspace);\n    std::shared_ptr<DS> result = std::accumulate(begin(l), end(l), ds_ptr,\n            [](std::shared_ptr<DS> ds, K3::Value cur_val) {\n                return findAndRemoveElement(ds, cur_val);\n            });\n    if (result) {\n        auto s = sizeDS(*result);\n        if (s == 0)\n            return true;\n        else\n            throw ExtraElementsException(s);\n    }\n    else\n        return false;\n}\n\ntemplate<typename DS>\nbool emptyPeek(std::shared_ptr<K3::Engine> engine)\n{\n    DS d(engine.get());\n    std::shared_ptr<K3::Value> result = d.peek();\n    return result == nullptr;\n}\n\ntemplate<typename DS>\nbool testEmptyFold(std::shared_ptr<K3::Engine> engine)\n{\n    DS d(engine.get());\n    unsigned counter = d.template fold<unsigned>(\n            [](unsigned accum, K3::Value) {\n                return accum + 1;\n            }, 0);\n    return counter == 0;\n}\n\nconst std::vector<K3::Value> test_lst({\"1\", \"2\", \"3\", \"4\", \"4\", \"100\"});\n\ntemplate<typename DS>\nbool testPeek(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    std::shared_ptr<K3::Value> peekResult = test_ds.peek();\n    if (!peekResult)\n        throw std::runtime_error(\"Peek returned nothing!\");\n    else\n        return containsDS(test_ds, *peekResult);\n}\n\ntemplate<typename DS>\nbool testInsert(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get());\n    for( K3::Value val : test_lst )\n        test_ds.insert_basic(val);\n    return compareDataspaceToList(test_ds, test_lst);\n}\n\ntemplate<typename DS>\nbool testDelete(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.delete_first(\"3\");\n    test_ds.delete_first(\"4\");\n    std::vector<K3::Value> deleted_lst({\"1\", \"2\", \"4\", \"100\"});\n    return compareDataspaceToList(test_ds, deleted_lst);\n}\n\ntemplate<typename DS>\nbool testMissingDelete(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.delete_first(\"5\");\n    return compareDataspaceToList(test_ds, test_lst);\n}\n\ntemplate<typename DS>\nbool testUpdate(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update_first(\"1\", \"4\");\n    std::vector<K3::Value> updated_answer({\"4\", \"2\", \"3\", \"4\", \"4\", \"100\"});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testUpdateMultiple(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update_first(\"4\", \"5\");\n    std::vector<K3::Value> updated_answer({\"1\", \"2\", \"3\", \"5\", \"4\", \"100\"});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testUpdateMissing(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update_first(\"40\", \"5\");\n    std::vector<K3::Value> updated_answer({\"1\", \"2\", \"3\", \"4\", \"4\", \"100\", \"5\"});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testFold(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    unsigned test_sum = test_ds.template fold<unsigned>(\n            [](unsigned sum, K3::Value val) {\n                sum += fromString<unsigned>(val);\n                return sum;\n            }, 0);\n    return test_sum == 114;\n}\n\ntemplate<typename DS>\nbool testMap(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS mapped_ds = test_ds.map(\n            [](K3::Value val) {\n                return toString(fromString<int>(val) + 5);\n            });\n    std::vector<K3::Value> mapped_answer({\"6\", \"7\", \"8\", \"9\", \"9\", \"105\"});\n    return compareDataspaceToList(mapped_ds, mapped_answer);\n}\n\ntemplate<typename DS>\nbool testFilter(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS filtered = test_ds.filter([](K3::Value val) {\n            return fromString<int>(val) > 50;\n            });\n    std::vector<K3::Value> filtered_answer({\"100\"});\n    return compareDataspaceToList(filtered, filtered_answer);\n}\n\ntemplate<typename DS>\nbool testCombine(std::shared_ptr<K3::Engine> engine)\n{\n    DS left_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS right_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS combined = left_ds.combine(right_ds);\n\n    std::vector<K3::Value> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    return compareDataspaceToList(combined, long_lst);\n}\n\ntemplate<typename DS>\nbool testCombineSelf(std::shared_ptr<K3::Engine> engine)\n{\n    DS self(engine.get(), begin(test_lst), end(test_lst));\n    DS combined = self.combine(self);\n\n    std::vector<K3::Value> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    return compareDataspaceToList(combined, long_lst);\n}\n\ntemplate<typename DS>\nstd::shared_ptr<std::tuple<DS, DS>> split_findAndRemoveElement(std::shared_ptr<std::tuple<DS, DS>> maybeTuple, K3::Value cur_val)\n{\n    typedef std::shared_ptr<std::tuple<DS, DS>> MaybePair;\n    if (!maybeTuple) {\n        return nullptr;\n    }\n    else {\n        DS& left = std::get<0>(*maybeTuple);\n        DS& right = std::get<1>(*maybeTuple);\n        if (containsDS(left, cur_val)) {\n            left.delete_first(cur_val);\n            \/\/ TODO copying everywhere!\n            \/\/ this copies the DS into the tuple, then the tuple is copied into the new target of the shared_ptr\n            return std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        }\n        else if (containsDS(right, cur_val)) {\n            right.delete_first(cur_val);\n            \/\/ TODO see above\n            return std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        }\n        else {\n            throw ElementNotFoundException(cur_val);\n            return MaybePair(nullptr);\n        }\n    }\n}\n\ntemplate<typename DS>\nbool testSplit(std::shared_ptr<K3::Engine> engine)\n{\n    std::vector<K3::Value> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    DS first_ds(engine.get(), begin(long_lst), end(long_lst));\n    std::tuple<DS, DS> split_pair = first_ds.split();\n    DS& left = std::get<0>(split_pair);\n    DS& right = std::get<1>(split_pair);\n\n    unsigned leftLen = sizeDS(left);\n    unsigned rightLen = sizeDS(right);\n\n    \/\/ TODO should the >= be just > ?\n    if (leftLen >= long_lst.size() || rightLen >= long_lst.size() || leftLen + rightLen > long_lst.size())\n        return false;\n    else {\n        std::shared_ptr<std::tuple<DS, DS>> remainders = std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        for (K3::Value val : long_lst)\n            remainders = split_findAndRemoveElement(remainders, val);\n        if (!remainders) {\n            return false;\n        }\n        else {\n            const DS& l = std::get<0>(*remainders);\n            const DS& r = std::get<1>(*remainders);\n            return (sizeDS(l) == 0 && sizeDS(r) == 0);\n        }\n    }\n}\n\n\/\/ TODO This just makes sure that nothing crashes, but should probably check for correctness also\n\/\/ This test is commented out because it segfaults clang 3.4.  It's bug #18473.\n\/\/ There's a temporary fix in r200954 that may be included in 3.4.1, but that's not released yet.\n\/\/template<typename DS>\n\/\/bool insertInsideMap(std::shared_ptr<K3::Engine> engine)\n\/\/{\n\/\/    DS outer_ds(engine.get(), begin(test_lst), end(test_lst));\n\/\/    DS result_ds = outer_ds.map([&outer_ds, &v, &v4](K3::Value cur_val) {\n\/\/            outer_ds.insert_basic(\"256\");\n\/\/            return \"4\";\n\/\/            });\n\/\/    return true;\n\/\/}\n\n\/\/ Engine setup\nstd::shared_ptr<K3::Engine> buildEngine()\n{\n  \/\/ Configure engine components\n  bool simulation = true;\n  K3::SystemEnvironment s_env = K3::defaultEnvironment();\n  auto i_cdec = std::shared_ptr<K3::InternalCodec>(new K3::DefaultInternalCodec());\n\n  \/\/ Construct an engine\n  K3::Engine * engine = new K3::Engine(simulation, s_env, i_cdec);\n  return std::shared_ptr<K3::Engine>(engine);\n}\n\nvoid callTest(std::function<bool(std::shared_ptr<K3::Engine>)> testFunc)\n{\n    auto engine = buildEngine();\n    bool success = false;\n    try {\n       success = testFunc(engine);\n       assert(success == true);\n       \/\/xUnitpp::Assert.Equal(success, true);\n    }\n    catch( std::exception& e)\n    {\n        std::cerr << e.what();\n        assert(false);\n        \/\/xUnitpp::Assert.Fail() << e.what();\n    }\n}\n\n\/\/#define MAKE_TEST(name, function, ds) \\\n\/\/    FACT(name) { callTest(function<ds>); }\n#define MAKE_TEST(name, function, ds) \\\n    callTest(function<ds>);\n\n\n\/\/SUITE(\"List Dataspace\") {\n\/\/    MAKE_TEST( \"EmptyPeek\", emptyPeek, ListDataspace)\n\/\/    MAKE_TEST( \"Fold on Empty List Test\", testEmptyFold, ListDataspace)\n\/\/    MAKE_TEST( \"Peek Test\", testPeek, ListDataspace)\n\/\/    MAKE_TEST( \"Insert Test\", testInsert, ListDataspace)\n\/\/    MAKE_TEST( \"Delete Test\", testDelete, ListDataspace)\n\/\/    MAKE_TEST( \"Delete of missing element Test\", testMissingDelete, ListDataspace)\n\/\/    MAKE_TEST( \"Update Test\", testUpdate, ListDataspace)\n\/\/    MAKE_TEST( \"Update Multiple Test\", testUpdateMultiple, ListDataspace)\n\/\/    MAKE_TEST( \"Update missing element Test\", testUpdateMissing, ListDataspace)\n\/\/    MAKE_TEST( \"Fold Test\", testFold, ListDataspace)\n\/\/    MAKE_TEST( \"Map Test\", testMap, ListDataspace)\n\/\/    MAKE_TEST( \"Filter Test\", testFilter, ListDataspace)\n\/\/    MAKE_TEST( \"Combine Test\", testCombine, ListDataspace)\n\/\/    MAKE_TEST( \"Combine with Self Test\", testCombineSelf, ListDataspace)\n\/\/    MAKE_TEST( \"Split Test\", testSplit, ListDataspace)\n\/\/    MAKE_TEST( \"Insert inside map\", insertInsideMap, ListDataspace)\n\/\/}\n\n\/\/SUITE(\"File Dataspace\") {\nint main()\n{\n    MAKE_TEST( \"EmptyPeek\", emptyPeek, FileDataspace)\n    MAKE_TEST( \"Fold on Empty List Test\", testEmptyFold, FileDataspace)\n    MAKE_TEST( \"Peek Test\", testPeek, FileDataspace)\n    MAKE_TEST( \"Insert Test\", testInsert, FileDataspace)\n    MAKE_TEST( \"Delete Test\", testDelete, FileDataspace)\n    MAKE_TEST( \"Delete of missing element Test\", testMissingDelete, FileDataspace)\n    MAKE_TEST( \"Update Test\", testUpdate, FileDataspace)\n    MAKE_TEST( \"Update Multiple Test\", testUpdateMultiple, FileDataspace)\n    MAKE_TEST( \"Update missing element Test\", testUpdateMissing, FileDataspace)\n    MAKE_TEST( \"Fold Test\", testFold, FileDataspace)\n    MAKE_TEST( \"Map Test\", testMap, FileDataspace)\n    MAKE_TEST( \"Filter Test\", testFilter, FileDataspace)\n    MAKE_TEST( \"Combine Test\", testCombine, FileDataspace)\n    MAKE_TEST( \"Combine with Self Test\", testCombineSelf, FileDataspace)\n    MAKE_TEST( \"Split Test\", testSplit, FileDataspace)\n    \/\/MAKE_TEST( \"Insert inside map\", insertInsideMap, FileDataspace)\n}\n\n\/\/MAKE_TEST_GROUP(\"List Dataspace\", ListDataspace)\n\/\/MAKE_TEST_GROUP(\"File Dataspace\", FileDataspace)\n<commit_msg>Adjust FileDataspaceTest to use the renamed files and classes<commit_after>#include <algorithm>\n\n\/\/#include \"xUnit++\/xUnit++.h\"\n\n#include <dataspace\/FileDS.hpp>\n\ntemplate<typename DS>\nbool containsDS(DS ds, const K3::Value& val)\n{\n    return ds.template fold<bool>(\n            [val](bool fnd, K3::Value cur) {\n                if (fnd || val == cur)\n                    return true;\n                else\n                    return fnd;\n            }, false);\n}\n\ntemplate<typename DS>\nunsigned sizeDS(DS ds)\n{\n    return ds.template fold<unsigned>(\n            [](unsigned count, K3::Value) {\n                return count + 1;\n            }, 0);\n}\n\nclass ElementNotFoundException : public std::runtime_error\n{\n    public:\n    ElementNotFoundException(const K3::Value& val)\n        : std::runtime_error(\"Could not find element \" + val)\n    {}\n};\nclass ExtraElementsException : public std::runtime_error\n{\n    public:\n    ExtraElementsException(unsigned i)\n        : std::runtime_error(\"Dataspace had \" + K3::toString(i) + \" extra elements\")\n    { }\n};\n\ntemplate<typename DS>\nstd::shared_ptr<DS> findAndRemoveElement(std::shared_ptr<DS> ds, const K3::Value& val)\n{\n    if (!ds)\n        return std::shared_ptr<DS>(nullptr);\n    else {\n        if (containsDS(*ds, val)) {\n            ds->delete_first(val);\n            return ds;\n        }\n        else\n            throw ElementNotFoundException(val);\n    }\n}\n\ntemplate<typename DS>\nbool compareDataspaceToList(DS dataspace, std::vector<K3::Value> l)\n{\n    std::shared_ptr<DS> ds_ptr = std::make_shared<DS>(dataspace);\n    std::shared_ptr<DS> result = std::accumulate(begin(l), end(l), ds_ptr,\n            [](std::shared_ptr<DS> ds, K3::Value cur_val) {\n                return findAndRemoveElement(ds, cur_val);\n            });\n    if (result) {\n        auto s = sizeDS(*result);\n        if (s == 0)\n            return true;\n        else\n            throw ExtraElementsException(s);\n    }\n    else\n        return false;\n}\n\ntemplate<typename DS>\nbool emptyPeek(std::shared_ptr<K3::Engine> engine)\n{\n    DS d(engine.get());\n    std::shared_ptr<K3::Value> result = d.peek();\n    return result == nullptr;\n}\n\ntemplate<typename DS>\nbool testEmptyFold(std::shared_ptr<K3::Engine> engine)\n{\n    DS d(engine.get());\n    unsigned counter = d.template fold<unsigned>(\n            [](unsigned accum, K3::Value) {\n                return accum + 1;\n            }, 0);\n    return counter == 0;\n}\n\nconst std::vector<K3::Value> test_lst({\"1\", \"2\", \"3\", \"4\", \"4\", \"100\"});\n\ntemplate<typename DS>\nbool testPeek(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    std::shared_ptr<K3::Value> peekResult = test_ds.peek();\n    if (!peekResult)\n        throw std::runtime_error(\"Peek returned nothing!\");\n    else\n        return containsDS(test_ds, *peekResult);\n}\n\ntemplate<typename DS>\nbool testInsert(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get());\n    for( K3::Value val : test_lst )\n        test_ds.insert_basic(val);\n    return compareDataspaceToList(test_ds, test_lst);\n}\n\ntemplate<typename DS>\nbool testDelete(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.delete_first(\"3\");\n    test_ds.delete_first(\"4\");\n    std::vector<K3::Value> deleted_lst({\"1\", \"2\", \"4\", \"100\"});\n    return compareDataspaceToList(test_ds, deleted_lst);\n}\n\ntemplate<typename DS>\nbool testMissingDelete(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.delete_first(\"5\");\n    return compareDataspaceToList(test_ds, test_lst);\n}\n\ntemplate<typename DS>\nbool testUpdate(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update_first(\"1\", \"4\");\n    std::vector<K3::Value> updated_answer({\"4\", \"2\", \"3\", \"4\", \"4\", \"100\"});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testUpdateMultiple(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update_first(\"4\", \"5\");\n    std::vector<K3::Value> updated_answer({\"1\", \"2\", \"3\", \"5\", \"4\", \"100\"});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testUpdateMissing(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update_first(\"40\", \"5\");\n    std::vector<K3::Value> updated_answer({\"1\", \"2\", \"3\", \"4\", \"4\", \"100\", \"5\"});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testFold(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    unsigned test_sum = test_ds.template fold<unsigned>(\n            [](unsigned sum, K3::Value val) {\n                sum += K3::fromString<unsigned>(val);\n                return sum;\n            }, 0);\n    return test_sum == 114;\n}\n\ntemplate<typename DS>\nbool testMap(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS mapped_ds = test_ds.map(\n            [](K3::Value val) {\n                return K3::toString(K3::fromString<int>(val) + 5);\n            });\n    std::vector<K3::Value> mapped_answer({\"6\", \"7\", \"8\", \"9\", \"9\", \"105\"});\n    return compareDataspaceToList(mapped_ds, mapped_answer);\n}\n\ntemplate<typename DS>\nbool testFilter(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS filtered = test_ds.filter([](K3::Value val) {\n            return K3::fromString<int>(val) > 50;\n            });\n    std::vector<K3::Value> filtered_answer({\"100\"});\n    return compareDataspaceToList(filtered, filtered_answer);\n}\n\ntemplate<typename DS>\nbool testCombine(std::shared_ptr<K3::Engine> engine)\n{\n    DS left_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS right_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS combined = left_ds.combine(right_ds);\n\n    std::vector<K3::Value> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    return compareDataspaceToList(combined, long_lst);\n}\n\ntemplate<typename DS>\nbool testCombineSelf(std::shared_ptr<K3::Engine> engine)\n{\n    DS self(engine.get(), begin(test_lst), end(test_lst));\n    DS combined = self.combine(self);\n\n    std::vector<K3::Value> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    return compareDataspaceToList(combined, long_lst);\n}\n\ntemplate<typename DS>\nstd::shared_ptr<std::tuple<DS, DS>> split_findAndRemoveElement(std::shared_ptr<std::tuple<DS, DS>> maybeTuple, K3::Value cur_val)\n{\n    typedef std::shared_ptr<std::tuple<DS, DS>> MaybePair;\n    if (!maybeTuple) {\n        return nullptr;\n    }\n    else {\n        DS& left = std::get<0>(*maybeTuple);\n        DS& right = std::get<1>(*maybeTuple);\n        if (containsDS(left, cur_val)) {\n            left.delete_first(cur_val);\n            \/\/ TODO copying everywhere!\n            \/\/ this copies the DS into the tuple, then the tuple is copied into the new target of the shared_ptr\n            return std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        }\n        else if (containsDS(right, cur_val)) {\n            right.delete_first(cur_val);\n            \/\/ TODO see above\n            return std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        }\n        else {\n            throw ElementNotFoundException(cur_val);\n            return MaybePair(nullptr);\n        }\n    }\n}\n\ntemplate<typename DS>\nbool testSplit(std::shared_ptr<K3::Engine> engine)\n{\n    std::vector<K3::Value> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    DS first_ds(engine.get(), begin(long_lst), end(long_lst));\n    std::tuple<DS, DS> split_pair = first_ds.split();\n    DS& left = std::get<0>(split_pair);\n    DS& right = std::get<1>(split_pair);\n\n    unsigned leftLen = sizeDS(left);\n    unsigned rightLen = sizeDS(right);\n\n    \/\/ TODO should the >= be just > ?\n    if (leftLen >= long_lst.size() || rightLen >= long_lst.size() || leftLen + rightLen > long_lst.size())\n        return false;\n    else {\n        std::shared_ptr<std::tuple<DS, DS>> remainders = std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        for (K3::Value val : long_lst)\n            remainders = split_findAndRemoveElement(remainders, val);\n        if (!remainders) {\n            return false;\n        }\n        else {\n            const DS& l = std::get<0>(*remainders);\n            const DS& r = std::get<1>(*remainders);\n            return (sizeDS(l) == 0 && sizeDS(r) == 0);\n        }\n    }\n}\n\n\/\/ TODO This just makes sure that nothing crashes, but should probably check for correctness also\n\/\/ This test is commented out because it segfaults clang 3.4.  It's bug #18473.\n\/\/ There's a temporary fix in r200954 that may be included in 3.4.1, but that's not released yet.\n\/\/template<typename DS>\n\/\/bool insertInsideMap(std::shared_ptr<K3::Engine> engine)\n\/\/{\n\/\/    DS outer_ds(engine.get(), begin(test_lst), end(test_lst));\n\/\/    DS result_ds = outer_ds.map([&outer_ds, &v, &v4](K3::Value cur_val) {\n\/\/            outer_ds.insert_basic(\"256\");\n\/\/            return \"4\";\n\/\/            });\n\/\/    return true;\n\/\/}\n\n\/\/ Engine setup\nstd::shared_ptr<K3::Engine> buildEngine()\n{\n  \/\/ Configure engine components\n  bool simulation = true;\n  K3::SystemEnvironment s_env = K3::defaultEnvironment();\n  auto i_cdec = std::shared_ptr<K3::InternalCodec>(new K3::DefaultInternalCodec());\n\n  \/\/ Construct an engine\n  K3::Engine * engine = new K3::Engine(simulation, s_env, i_cdec);\n  return std::shared_ptr<K3::Engine>(engine);\n}\n\nvoid callTest(std::function<bool(std::shared_ptr<K3::Engine>)> testFunc)\n{\n    auto engine = buildEngine();\n    bool success = false;\n    try {\n       success = testFunc(engine);\n       assert(success == true);\n       \/\/xUnitpp::Assert.Equal(success, true);\n    }\n    catch( std::exception& e)\n    {\n        std::cerr << e.what();\n        assert(false);\n        \/\/xUnitpp::Assert.Fail() << e.what();\n    }\n}\n\n\/\/#define MAKE_TEST(name, function, ds) \\\n\/\/    FACT(name) { callTest(function<ds>); }\n#define MAKE_TEST(name, function, ds) \\\n    callTest(function<ds>);\n\n\n\/\/SUITE(\"List Dataspace\") {\n\/\/    MAKE_TEST( \"EmptyPeek\", emptyPeek, ListDataspace)\n\/\/    MAKE_TEST( \"Fold on Empty List Test\", testEmptyFold, ListDataspace)\n\/\/    MAKE_TEST( \"Peek Test\", testPeek, ListDataspace)\n\/\/    MAKE_TEST( \"Insert Test\", testInsert, ListDataspace)\n\/\/    MAKE_TEST( \"Delete Test\", testDelete, ListDataspace)\n\/\/    MAKE_TEST( \"Delete of missing element Test\", testMissingDelete, ListDataspace)\n\/\/    MAKE_TEST( \"Update Test\", testUpdate, ListDataspace)\n\/\/    MAKE_TEST( \"Update Multiple Test\", testUpdateMultiple, ListDataspace)\n\/\/    MAKE_TEST( \"Update missing element Test\", testUpdateMissing, ListDataspace)\n\/\/    MAKE_TEST( \"Fold Test\", testFold, ListDataspace)\n\/\/    MAKE_TEST( \"Map Test\", testMap, ListDataspace)\n\/\/    MAKE_TEST( \"Filter Test\", testFilter, ListDataspace)\n\/\/    MAKE_TEST( \"Combine Test\", testCombine, ListDataspace)\n\/\/    MAKE_TEST( \"Combine with Self Test\", testCombineSelf, ListDataspace)\n\/\/    MAKE_TEST( \"Split Test\", testSplit, ListDataspace)\n\/\/    MAKE_TEST( \"Insert inside map\", insertInsideMap, ListDataspace)\n\/\/}\n\n\/\/SUITE(\"File Dataspace\") {\nint main()\n{\n    MAKE_TEST( \"EmptyPeek\", emptyPeek, K3::FileDS)\n    MAKE_TEST( \"Fold on Empty List Test\", testEmptyFold, K3::FileDS)\n    MAKE_TEST( \"Peek Test\", testPeek, K3::FileDS)\n    MAKE_TEST( \"Insert Test\", testInsert, K3::FileDS)\n    MAKE_TEST( \"Delete Test\", testDelete, K3::FileDS)\n    MAKE_TEST( \"Delete of missing element Test\", testMissingDelete, K3::FileDS)\n    MAKE_TEST( \"Update Test\", testUpdate, K3::FileDS)\n    MAKE_TEST( \"Update Multiple Test\", testUpdateMultiple, K3::FileDS)\n    MAKE_TEST( \"Update missing element Test\", testUpdateMissing, K3::FileDS)\n    MAKE_TEST( \"Fold Test\", testFold, K3::FileDS)\n    MAKE_TEST( \"Map Test\", testMap, K3::FileDS)\n    MAKE_TEST( \"Filter Test\", testFilter, K3::FileDS)\n    MAKE_TEST( \"Combine Test\", testCombine, K3::FileDS)\n    MAKE_TEST( \"Combine with Self Test\", testCombineSelf, K3::FileDS)\n    MAKE_TEST( \"Split Test\", testSplit, K3::FileDS)\n    \/\/MAKE_TEST( \"Insert inside map\", insertInsideMap, K3::FileDS)\n}\n\n\/\/MAKE_TEST_GROUP(\"List Dataspace\", ListDataspace)\n\/\/MAKE_TEST_GROUP(\"File Dataspace\", K3::FileDS)\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n\n#include \"xUnit++\/xUnit++.h\"\n\n#include <dataspace\/FileDS.hpp>\n\ntemplate<typename DS>\nbool containsDS(DS ds, const typename DS::Elem& val)\n{\n    return ds.template fold<bool>(\n            [val](bool fnd, typename DS::Elem cur) {\n                if (fnd || val == cur)\n                    return true;\n                else\n                    return fnd;\n            }, false);\n}\n\ntemplate<typename DS>\nunsigned sizeDS(DS ds)\n{\n    return ds.template fold<unsigned>(\n            [](unsigned count, typename DS::Elem) {\n                return count + 1;\n            }, 0);\n}\n\ntemplate<typename DS>\nclass ElementNotFoundException : public std::runtime_error\n{\n    public:\n    ElementNotFoundException(const typename DS::Elem& val)\n        : std::runtime_error(\"Could not find element \" + K3::BoostSerializer::pack(val))\n    {}\n};\nclass ExtraElementsException : public std::runtime_error\n{\n    std::string msg;\n    public:\n    ExtraElementsException(unsigned i)\n        : std::runtime_error(\"\")\n    {\n        std::ostringstream strm;\n        strm << \"Dataspace had \" << i << \" extra elements.\";\n        msg = strm.str();\n    }\n\n    virtual const char * what() const noexcept {\n        return msg.c_str();\n    }\n};\n\ntemplate<typename DS>\nstd::shared_ptr<DS> findAndRemoveElement(std::shared_ptr<DS> ds, const typename DS::Elem& val)\n{\n    if (!ds)\n        return std::shared_ptr<DS>(nullptr);\n    else {\n        if (containsDS(*ds, val)) {\n            ds->erase(val);\n            return ds;\n        }\n        else\n            throw ElementNotFoundException<DS>(val);\n    }\n}\n\ntemplate<typename DS>\nbool compareDataspaceToList(DS dataspace, std::vector<typename DS::Elem> l)\n{\n    std::shared_ptr<DS> ds_ptr = std::make_shared<DS>(dataspace);\n    std::shared_ptr<DS> result = std::accumulate(begin(l), end(l), ds_ptr,\n            [](std::shared_ptr<DS> ds, typename DS::Elem cur_val) {\n                return findAndRemoveElement(ds, cur_val);\n            });\n    if (result) {\n        auto s = sizeDS(*result);\n        if (s == 0)\n            return true;\n        else\n            throw ExtraElementsException(s);\n    }\n    else\n        return false;\n}\n\ntemplate<typename DS>\nbool emptyPeek(std::shared_ptr<K3::Engine> engine)\n{\n    DS d(engine.get());\n    std::shared_ptr<typename DS::Elem> result = d.peek();\n    return result == nullptr;\n}\n\ntemplate<typename DS>\nbool testEmptyFold(std::shared_ptr<K3::Engine> engine)\n{\n    DS d(engine.get());\n    unsigned counter = d.template fold<unsigned>(\n            [](unsigned accum, typename DS::Elem) {\n                return accum + 1;\n            }, 0);\n    return counter == 0;\n}\n\nconst std::vector<int> test_lst({1, 2, 3, 4, 4, 100});\n\ntemplate<typename DS>\nbool testPeek(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    std::shared_ptr<typename DS::Elem> peekResult = test_ds.peek();\n    if (!peekResult)\n        throw std::runtime_error(\"Peek returned nothing!\");\n    else\n        return containsDS(test_ds, *peekResult);\n}\n\ntemplate<typename DS>\nbool testInsert(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get());\n    for( typename DS::Elem val : test_lst )\n        test_ds.insert(val);\n    return compareDataspaceToList(test_ds, test_lst);\n}\n\ntemplate<typename DS>\nbool testDelete(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.erase(3);\n    test_ds.erase(4);\n    std::vector<typename DS::Elem> deleted_lst({1, 2, 4, 100});\n    return compareDataspaceToList(test_ds, deleted_lst);\n}\n\ntemplate<typename DS>\nbool testMissingDelete(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.erase(5);\n    return compareDataspaceToList(test_ds, test_lst);\n}\n\ntemplate<typename DS>\nbool testUpdate(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update(1, 4);\n    std::vector<typename DS::Elem> updated_answer({4, 2, 3, 4, 4, 100});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testUpdateMultiple(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update(4, 5);\n    std::vector<typename DS::Elem> updated_answer({1, 2, 3, 5, 4, 100});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testUpdateMissing(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update(40, 5);\n    std::vector<typename DS::Elem> updated_answer({1, 2, 3, 4, 4, 100, 5});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testFold(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    int test_sum = test_ds.template fold<int>(\n            [](int sum, typename DS::Elem val) {\n                sum += val;\n                return sum;\n            }, 0);\n    return test_sum == 114;\n}\n\ntemplate<typename DS>\nbool testMap(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS mapped_ds = test_ds.template map<typename DS::Elem>(\n            [](typename DS::Elem val) {\n                return val + 5;\n            });\n    std::vector<typename DS::Elem> mapped_answer({6, 7, 8, 9, 9, 105});\n    return compareDataspaceToList(mapped_ds, mapped_answer);\n}\n\ntemplate<typename DS>\nbool testFilter(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS filtered = test_ds.filter([](typename DS::Elem val) {\n            return val > 50;\n            });\n    std::vector<typename DS::Elem> filtered_answer({100});\n    return compareDataspaceToList(filtered, filtered_answer);\n}\n\ntemplate<typename DS>\nbool testCombine(std::shared_ptr<K3::Engine> engine)\n{\n    DS left_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS right_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS combined = left_ds.combine(right_ds);\n\n    std::vector<typename DS::Elem> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    return compareDataspaceToList(combined, long_lst);\n}\n\ntemplate<typename DS>\nbool testCombineSelf(std::shared_ptr<K3::Engine> engine)\n{\n    DS self(engine.get(), begin(test_lst), end(test_lst));\n    DS combined = self.combine(self);\n\n    std::vector<typename DS::Elem> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    return compareDataspaceToList(combined, long_lst);\n}\n\ntemplate<typename DS>\nstd::shared_ptr<std::tuple<DS, DS>> split_findAndRemoveElement(std::shared_ptr<std::tuple<DS, DS>> maybeTuple, typename DS::Elem cur_val)\n{\n    typedef std::shared_ptr<std::tuple<DS, DS>> MaybePair;\n    if (!maybeTuple) {\n        return nullptr;\n    }\n    else {\n        DS& left = std::get<0>(*maybeTuple);\n        DS& right = std::get<1>(*maybeTuple);\n        if (containsDS(left, cur_val)) {\n            left.erase(cur_val);\n            \/\/ TODO copying everywhere!\n            \/\/ this copies the DS into the tuple, then the tuple is copied into the new target of the shared_ptr\n            return std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        }\n        else if (containsDS(right, cur_val)) {\n            right.erase(cur_val);\n            \/\/ TODO see above\n            return std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        }\n        else {\n            return MaybePair(nullptr);\n        }\n    }\n}\n\ntemplate<typename DS>\nbool testSplit(std::shared_ptr<K3::Engine> engine)\n{\n    std::vector<typename DS::Elem> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    DS first_ds(engine.get(), begin(long_lst), end(long_lst));\n    std::tuple<DS, DS> split_pair = first_ds.split();\n    DS& left = std::get<0>(split_pair);\n    DS& right = std::get<1>(split_pair);\n\n    unsigned leftLen = sizeDS(left);\n    unsigned rightLen = sizeDS(right);\n\n    \/\/ TODO should the >= be just > ?\n    if (leftLen >= long_lst.size() || rightLen >= long_lst.size() || leftLen + rightLen > long_lst.size())\n        return false;\n    else {\n        std::shared_ptr<std::tuple<DS, DS>> remainders = std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        for (typename DS::Elem val : long_lst)\n            remainders = split_findAndRemoveElement(remainders, val);\n        if (!remainders) {\n            return false;\n        }\n        else {\n            const DS& l = std::get<0>(*remainders);\n            const DS& r = std::get<1>(*remainders);\n            return (sizeDS(l) == 0 && sizeDS(r) == 0);\n        }\n    }\n}\n\n\/\/ TODO This just makes sure that nothing crashes, but should probably check for correctness also\n\/\/ This test is commented out because it segfaults clang 3.4.  It's bug #18473.\n\/\/ There's a temporary fix in r200954 that may be included in 3.4.1, but that's not released yet.\n\/\/template<typename DS>\n\/\/bool insertInsideMap(std::shared_ptr<K3::Engine> engine)\n\/\/{\n\/\/    DS outer_ds(engine.get(), begin(test_lst), end(test_lst));\n\/\/    DS result_ds = outer_ds.map([&outer_ds, &v, &v4](typename DS::Elem cur_val) {\n\/\/            outer_ds.insert(\"256\");\n\/\/            return \"4\";\n\/\/            });\n\/\/    return true;\n\/\/}\n\n\/\/ Engine setup\nstd::shared_ptr<K3::Engine> buildEngine()\n{\n  \/\/ Configure engine components\n  bool simulation = true;\n  K3::SystemEnvironment s_env = K3::defaultEnvironment();\n  auto i_cdec = std::shared_ptr<K3::InternalCodec>(new K3::DefaultInternalCodec());\n\n  \/\/ Construct an engine\n  K3::Engine * engine = new K3::Engine(simulation, s_env, i_cdec);\n  return std::shared_ptr<K3::Engine>(engine);\n}\n\nvoid callTest(std::function<bool(std::shared_ptr<K3::Engine>)> testFunc)\n{\n    auto engine = buildEngine();\n    bool success = false;\n    try {\n       success = testFunc(engine);\n       xUnitpp::Assert.Equal(success, true);\n    }\n    catch (std::exception& e)\n    {\n        std::cerr << e.what() << \"\\n\";\n        xUnitpp::Assert.Fail() << e.what();\n    }\n}\n\n\/\/#define MAKE_TEST(name, function, ds) \\\n\/\/    FACT(name) { callTest(function<ds>); }\n#define MAKE_TEST(name, function, ds) \\\n    std::cout << \"Test \" << name << \"\\n\"; \\\n    callTest(function<ds>);\n\n\/\/SUITE(\"List Dataspace\") {\n\/\/    MAKE_TEST( \"EmptyPeek\", emptyPeek, ListDataspace)\n\/\/    MAKE_TEST( \"Fold on Empty List Test\", testEmptyFold, ListDataspace)\n\/\/    MAKE_TEST( \"Peek Test\", testPeek, ListDataspace)\n\/\/    MAKE_TEST( \"Insert Test\", testInsert, ListDataspace)\n\/\/    MAKE_TEST( \"Delete Test\", testDelete, ListDataspace)\n\/\/    MAKE_TEST( \"Delete of missing element Test\", testMissingDelete, ListDataspace)\n\/\/    MAKE_TEST( \"Update Test\", testUpdate, ListDataspace)\n\/\/    MAKE_TEST( \"Update Multiple Test\", testUpdateMultiple, ListDataspace)\n\/\/    MAKE_TEST( \"Update missing element Test\", testUpdateMissing, ListDataspace)\n\/\/    MAKE_TEST( \"Fold Test\", testFold, ListDataspace)\n\/\/    MAKE_TEST( \"Map Test\", testMap, ListDataspace)\n\/\/    MAKE_TEST( \"Filter Test\", testFilter, ListDataspace)\n\/\/    MAKE_TEST( \"Combine Test\", testCombine, ListDataspace)\n\/\/    MAKE_TEST( \"Combine with Self Test\", testCombineSelf, ListDataspace)\n\/\/    MAKE_TEST( \"Split Test\", testSplit, ListDataspace)\n\/\/    MAKE_TEST( \"Insert inside map\", insertInsideMap, ListDataspace)\n\/\/}\n\n\/\/SUITE(\"File Dataspace\")\nint main()\n{\n    typedef K3::FileDS<int> DS;\n    MAKE_TEST( \"EmptyPeek\", emptyPeek, DS)\n    MAKE_TEST( \"Fold on Empty List Test\", testEmptyFold, DS)\n    MAKE_TEST( \"Peek Test\", testPeek, DS)\n    MAKE_TEST( \"Insert Test\", testInsert, DS)\n    MAKE_TEST( \"Delete Test\", testDelete, DS)\n    MAKE_TEST( \"Delete of missing element Test\", testMissingDelete, DS)\n    MAKE_TEST( \"Update Test\", testUpdate, DS)\n    MAKE_TEST( \"Update Multiple Test\", testUpdateMultiple, DS)\n    MAKE_TEST( \"Update missing element Test\", testUpdateMissing, DS)\n    MAKE_TEST( \"Fold Test\", testFold, DS)\n    MAKE_TEST( \"Map Test\", testMap, DS)\n    MAKE_TEST( \"Filter Test\", testFilter, DS)\n    MAKE_TEST( \"Combine Test\", testCombine, DS)\n    MAKE_TEST( \"Combine with Self Test\", testCombineSelf, DS)\n    MAKE_TEST( \"Split Test\", testSplit, DS)\n    \/\/MAKE_TEST( \"Insert inside map\", insertInsideMap, DS)\n}\n<commit_msg>Pass dataspace around by value in the test<commit_after>#include <algorithm>\n\n#include \"xUnit++\/xUnit++.h\"\n\n#include <dataspace\/FileDS.hpp>\n\ntemplate<typename DS>\nbool containsDS(DS ds, const typename DS::Elem& val)\n{\n    return ds.template fold<bool>(\n            [val](bool fnd, typename DS::Elem cur) {\n                if (fnd || val == cur)\n                    return true;\n                else\n                    return fnd;\n            }, false);\n}\n\ntemplate<typename DS>\nunsigned sizeDS(DS ds)\n{\n    return ds.template fold<unsigned>(\n            [](unsigned count, typename DS::Elem) {\n                return count + 1;\n            }, 0);\n}\n\ntemplate<typename DS>\nclass ElementNotFoundException : public std::runtime_error\n{\n    public:\n    ElementNotFoundException(const typename DS::Elem& val)\n        : std::runtime_error(\"Could not find element \" + K3::BoostSerializer::pack(val))\n    {}\n};\nclass ExtraElementsException : public std::runtime_error\n{\n    std::string msg;\n    public:\n    ExtraElementsException(unsigned i)\n        : std::runtime_error(\"\")\n    {\n        std::ostringstream strm;\n        strm << \"Dataspace had \" << i << \" extra elements.\";\n        msg = strm.str();\n    }\n\n    virtual const char * what() const noexcept {\n        return msg.c_str();\n    }\n};\n\ntemplate<typename DS>\nDS findAndRemoveElement(DS ds, const typename DS::Elem& val)\n{\n    if (containsDS(ds, val)) {\n        ds.erase(val);\n    }\n    else\n        throw ElementNotFoundException<DS>(val);\n    return ds;\n}\n\ntemplate<typename DS>\nbool compareDataspaceToList(DS dataspace, std::vector<typename DS::Elem> l)\n{\n    for (typename DS::Elem cur_val : l)\n    {\n        dataspace = findAndRemoveElement(dataspace, cur_val);\n    }\n    auto s = sizeDS(dataspace);\n    if (s == 0)\n        return true;\n    else\n        throw ExtraElementsException(s);\n}\n\ntemplate<typename DS>\nbool emptyPeek(std::shared_ptr<K3::Engine> engine)\n{\n    DS d(engine.get());\n    std::shared_ptr<typename DS::Elem> result = d.peek();\n    return result == nullptr;\n}\n\ntemplate<typename DS>\nbool testEmptyFold(std::shared_ptr<K3::Engine> engine)\n{\n    DS d(engine.get());\n    unsigned counter = d.template fold<unsigned>(\n            [](unsigned accum, typename DS::Elem) {\n                return accum + 1;\n            }, 0);\n    return counter == 0;\n}\n\nconst std::vector<int> test_lst({1, 2, 3, 4, 4, 100});\n\ntemplate<typename DS>\nbool testPeek(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    std::shared_ptr<typename DS::Elem> peekResult = test_ds.peek();\n    if (!peekResult)\n        throw std::runtime_error(\"Peek returned nothing!\");\n    else\n        return containsDS(test_ds, *peekResult);\n}\n\ntemplate<typename DS>\nbool testInsert(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get());\n    for( typename DS::Elem val : test_lst )\n        test_ds.insert(val);\n    return compareDataspaceToList(test_ds, test_lst);\n}\n\ntemplate<typename DS>\nbool testDelete(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.erase(3);\n    test_ds.erase(4);\n    std::vector<typename DS::Elem> deleted_lst({1, 2, 4, 100});\n    return compareDataspaceToList(test_ds, deleted_lst);\n}\n\ntemplate<typename DS>\nbool testMissingDelete(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.erase(5);\n    return compareDataspaceToList(test_ds, test_lst);\n}\n\ntemplate<typename DS>\nbool testUpdate(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update(1, 4);\n    std::vector<typename DS::Elem> updated_answer({4, 2, 3, 4, 4, 100});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testUpdateMultiple(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update(4, 5);\n    std::vector<typename DS::Elem> updated_answer({1, 2, 3, 5, 4, 100});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testUpdateMissing(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    test_ds.update(40, 5);\n    std::vector<typename DS::Elem> updated_answer({1, 2, 3, 4, 4, 100, 5});\n    return compareDataspaceToList(test_ds, updated_answer);\n}\n\ntemplate<typename DS>\nbool testFold(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    int test_sum = test_ds.template fold<int>(\n            [](int sum, typename DS::Elem val) {\n                sum += val;\n                return sum;\n            }, 0);\n    return test_sum == 114;\n}\n\ntemplate<typename DS>\nbool testMap(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS mapped_ds = test_ds.template map<typename DS::Elem>(\n            [](typename DS::Elem val) {\n                return val + 5;\n            });\n    std::vector<typename DS::Elem> mapped_answer({6, 7, 8, 9, 9, 105});\n    return compareDataspaceToList(mapped_ds, mapped_answer);\n}\n\ntemplate<typename DS>\nbool testFilter(std::shared_ptr<K3::Engine> engine)\n{\n    DS test_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS filtered = test_ds.filter([](typename DS::Elem val) {\n            return val > 50;\n            });\n    std::vector<typename DS::Elem> filtered_answer({100});\n    return compareDataspaceToList(filtered, filtered_answer);\n}\n\ntemplate<typename DS>\nbool testCombine(std::shared_ptr<K3::Engine> engine)\n{\n    DS left_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS right_ds(engine.get(), begin(test_lst), end(test_lst));\n    DS combined = left_ds.combine(right_ds);\n\n    std::vector<typename DS::Elem> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    return compareDataspaceToList(combined, long_lst);\n}\n\ntemplate<typename DS>\nbool testCombineSelf(std::shared_ptr<K3::Engine> engine)\n{\n    DS self(engine.get(), begin(test_lst), end(test_lst));\n    DS combined = self.combine(self);\n\n    std::vector<typename DS::Elem> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    return compareDataspaceToList(combined, long_lst);\n}\n\ntemplate<typename DS>\nstd::shared_ptr<std::tuple<DS, DS>> split_findAndRemoveElement(std::shared_ptr<std::tuple<DS, DS>> maybeTuple, typename DS::Elem cur_val)\n{\n    typedef std::shared_ptr<std::tuple<DS, DS>> MaybePair;\n    if (!maybeTuple) {\n        return nullptr;\n    }\n    else {\n        DS& left = std::get<0>(*maybeTuple);\n        DS& right = std::get<1>(*maybeTuple);\n        if (containsDS(left, cur_val)) {\n            left.erase(cur_val);\n            \/\/ TODO copying everywhere!\n            \/\/ this copies the DS into the tuple, then the tuple is copied into the new target of the shared_ptr\n            return std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        }\n        else if (containsDS(right, cur_val)) {\n            right.erase(cur_val);\n            \/\/ TODO see above\n            return std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        }\n        else {\n            return MaybePair(nullptr);\n        }\n    }\n}\n\ntemplate<typename DS>\nbool testSplit(std::shared_ptr<K3::Engine> engine)\n{\n    std::vector<typename DS::Elem> long_lst(test_lst);\n    long_lst.insert(end(long_lst), begin(test_lst), end(test_lst));\n    DS first_ds(engine.get(), begin(long_lst), end(long_lst));\n    std::tuple<DS, DS> split_pair = first_ds.split();\n    DS& left = std::get<0>(split_pair);\n    DS& right = std::get<1>(split_pair);\n\n    unsigned leftLen = sizeDS(left);\n    unsigned rightLen = sizeDS(right);\n\n    \/\/ TODO should the >= be just > ?\n    if (leftLen >= long_lst.size() || rightLen >= long_lst.size() || leftLen + rightLen > long_lst.size())\n        return false;\n    else {\n        std::shared_ptr<std::tuple<DS, DS>> remainders = std::make_shared<std::tuple<DS, DS>>(std::make_tuple(left, right));\n        for (typename DS::Elem val : long_lst)\n            remainders = split_findAndRemoveElement(remainders, val);\n        if (!remainders) {\n            return false;\n        }\n        else {\n            DS& l = std::get<0>(*remainders);\n            DS& r = std::get<1>(*remainders);\n            return (sizeDS(l) == 0 && sizeDS(r) == 0);\n        }\n    }\n}\n\n\/\/ TODO This just makes sure that nothing crashes, but should probably check for correctness also\n\/\/ This test is commented out because it segfaults clang 3.4.  It's bug #18473.\n\/\/ There's a temporary fix in r200954 that may be included in 3.4.1, but that's not released yet.\n\/\/template<typename DS>\n\/\/bool insertInsideMap(std::shared_ptr<K3::Engine> engine)\n\/\/{\n\/\/    DS outer_ds(engine.get(), begin(test_lst), end(test_lst));\n\/\/    DS result_ds = outer_ds.map([&outer_ds, &v, &v4](typename DS::Elem cur_val) {\n\/\/            outer_ds.insert(\"256\");\n\/\/            return \"4\";\n\/\/            });\n\/\/    return true;\n\/\/}\n\n\/\/ Engine setup\nstd::shared_ptr<K3::Engine> buildEngine()\n{\n  \/\/ Configure engine components\n  bool simulation = true;\n  K3::SystemEnvironment s_env = K3::defaultEnvironment();\n  auto i_cdec = std::shared_ptr<K3::InternalCodec>(new K3::DefaultInternalCodec());\n\n  \/\/ Construct an engine\n  K3::Engine * engine = new K3::Engine(simulation, s_env, i_cdec);\n  return std::shared_ptr<K3::Engine>(engine);\n}\n\nvoid callTest(std::function<bool(std::shared_ptr<K3::Engine>)> testFunc)\n{\n    auto engine = buildEngine();\n    bool success = false;\n    try {\n       success = testFunc(engine);\n       xUnitpp::Assert.Equal(success, true);\n    }\n    catch (std::exception& e)\n    {\n        std::cerr << e.what() << \"\\n\";\n        xUnitpp::Assert.Fail() << e.what();\n    }\n}\n\n\/\/#define MAKE_TEST(name, function, ds) \\\n\/\/    FACT(name) { callTest(function<ds>); }\n#define MAKE_TEST(name, function, ds) \\\n    std::cout << \"Test \" << name << \"\\n\"; \\\n    callTest(function<ds>);\n\n\/\/SUITE(\"List Dataspace\") {\n\/\/    MAKE_TEST( \"EmptyPeek\", emptyPeek, ListDataspace)\n\/\/    MAKE_TEST( \"Fold on Empty List Test\", testEmptyFold, ListDataspace)\n\/\/    MAKE_TEST( \"Peek Test\", testPeek, ListDataspace)\n\/\/    MAKE_TEST( \"Insert Test\", testInsert, ListDataspace)\n\/\/    MAKE_TEST( \"Delete Test\", testDelete, ListDataspace)\n\/\/    MAKE_TEST( \"Delete of missing element Test\", testMissingDelete, ListDataspace)\n\/\/    MAKE_TEST( \"Update Test\", testUpdate, ListDataspace)\n\/\/    MAKE_TEST( \"Update Multiple Test\", testUpdateMultiple, ListDataspace)\n\/\/    MAKE_TEST( \"Update missing element Test\", testUpdateMissing, ListDataspace)\n\/\/    MAKE_TEST( \"Fold Test\", testFold, ListDataspace)\n\/\/    MAKE_TEST( \"Map Test\", testMap, ListDataspace)\n\/\/    MAKE_TEST( \"Filter Test\", testFilter, ListDataspace)\n\/\/    MAKE_TEST( \"Combine Test\", testCombine, ListDataspace)\n\/\/    MAKE_TEST( \"Combine with Self Test\", testCombineSelf, ListDataspace)\n\/\/    MAKE_TEST( \"Split Test\", testSplit, ListDataspace)\n\/\/    MAKE_TEST( \"Insert inside map\", insertInsideMap, ListDataspace)\n\/\/}\n\n\/\/SUITE(\"File Dataspace\")\nint main()\n{\n    typedef K3::FileDS<int> DS;\n    MAKE_TEST( \"EmptyPeek\", emptyPeek, DS)\n    MAKE_TEST( \"Fold on Empty List Test\", testEmptyFold, DS)\n    MAKE_TEST( \"Peek Test\", testPeek, DS)\n    MAKE_TEST( \"Insert Test\", testInsert, DS)\n    MAKE_TEST( \"Delete Test\", testDelete, DS)\n    MAKE_TEST( \"Delete of missing element Test\", testMissingDelete, DS)\n    MAKE_TEST( \"Update Test\", testUpdate, DS)\n    MAKE_TEST( \"Update Multiple Test\", testUpdateMultiple, DS)\n    MAKE_TEST( \"Update missing element Test\", testUpdateMissing, DS)\n    MAKE_TEST( \"Fold Test\", testFold, DS)\n    MAKE_TEST( \"Map Test\", testMap, DS)\n    MAKE_TEST( \"Filter Test\", testFilter, DS)\n    MAKE_TEST( \"Combine Test\", testCombine, DS)\n    MAKE_TEST( \"Combine with Self Test\", testCombineSelf, DS)\n    MAKE_TEST( \"Split Test\", testSplit, DS)\n    \/\/MAKE_TEST( \"Insert inside map\", insertInsideMap, DS)\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2009-2010 by Bjoern Kolbeck, Zuse Institute Berlin\n *\n * Licensed under the BSD License, see LICENSE file for details.\n *\n *\/\n\n#include \"rpc\/client.h\"\n\n#include <openssl\/pem.h>\n#include <openssl\/err.h>\n#include <openssl\/pkcs12.h>\n#include <openssl\/bio.h>\n#include <openssl\/rand.h>\n#include <openssl\/x509.h>\n#include <openssl\/evp.h>\n#include <unistd.h>\n\n#include <boost\/algorithm\/string\/trim.hpp>\n#include <boost\/interprocess\/detail\/atomic.hpp>\n\n#include <cstdio>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <utility>\n#include <string>\n\n#include \"util\/logging.h\"\n\n\nnamespace xtreemfs {\nnamespace rpc {\nusing namespace xtreemfs::pbrpc;\nusing namespace xtreemfs::util;\nusing namespace std;\nusing namespace boost;\nusing namespace google::protobuf;\n\nClient::Client(int32_t connect_timeout_s,\n               int32_t request_timeout_s,\n               int32_t max_con_linger,\n               const SSLOptions* options)\n    : service_(),\n      resolver_(service_),\n      use_gridssl_(false),\n      ssl_context_(NULL),\n      callid_counter_(1),\n      rq_timeout_timer_(service_),\n      rq_timeout_s_(request_timeout_s),\n      connect_timeout_s_(connect_timeout_s),\n      max_con_linger_(max_con_linger),\n      ssl_options(options),\n      pemFileName(NULL),\n      certFileName(NULL) {\n  \/\/ Check if ssl options were passed.\n  if (options != NULL) {\n    Logging::log->getLog(LEVEL_INFO) << \"SSL support activated\" << endl;\n\n    use_gridssl_ = options->use_grid_ssl();\n    ssl_context_ =\n        new boost::asio::ssl::context(service_,\n                                      boost::asio::ssl::context::sslv23);\n    ssl_context_->set_verify_mode(boost::asio::ssl::context::verify_none);\n\n    OpenSSL_add_all_algorithms();\n    OpenSSL_add_all_ciphers();\n    OpenSSL_add_all_digests();\n    SSL_load_error_strings();\n\n    \/\/ check if pkcs12 was entered\n    \/\/ the pkcs12 file has to be read using openssl\n    \/\/ afterwards the pem- and cert-files are written to temporary files on disk\n    \/\/ these can be accessed by boost::assio::ssl\n    if (!options->pkcs12_file_name().empty()) {\n      Logging::log->getLog(LEVEL_INFO) << \"SSL suport using pkcs12 file \"\n          << options->pkcs12_file_name() << endl;\n\n      char tmplate1[] = \"\/tmp\/pmXXXXXX\";\n      char tmplate2[] = \"\/tmp\/ctXXXXXX\";\n\n      const char* fp = options->pkcs12_file_name().c_str();\n      FILE *p12_file = fopen(fp, \"rb\");\n\n      \/\/ read the pkcs12 file\n      if (!p12_file) {\n        Logging::log->getLog(LEVEL_ERROR) << \"Error opening pkcs12 file:\"\n            << options->pkcs12_file_name() << \". (file not found)\" << endl;\n        exit(1);\n      }\n      PKCS12 *p12 = d2i_PKCS12_fp(p12_file, NULL);\n      fclose(p12_file);\n\n      if (!p12) {\n        Logging::log->getLog(LEVEL_ERROR) << \"Error reading pkcs12 file:\"\n            << options->pkcs12_file_name() << \". (no access rights?)\" << endl;\n        ERR_print_errors_fp(stderr);\n        exit(1);\n      }\n\n      EVP_PKEY *pkey = NULL;\n      X509 *cert = NULL;\n      STACK_OF(X509) *ca = NULL;\n\n      \/\/ parse pkcs12 file\n      if (!PKCS12_parse(p12,\n                        options->pkcs12_file_password().c_str(),\n                        &pkey,\n                        &cert,\n                        &ca)) {\n        Logging::log->getLog(LEVEL_ERROR) << \"Error parsing pkcs12 file:\"\n            << options->pkcs12_file_name() << endl;\n        ERR_print_errors_fp(stderr);\n        exit(1);\n      }\n      PKCS12_free(p12);\n\n      \/\/ create two tmp files containing the PEM certificates.\n      \/\/ these which be deleted when exiting the program\n      int tmpPem = mkstemp(tmplate1);\n      int tmpCert = mkstemp(tmplate2);\n      if (tmpPem == -1 || tmpCert == -1) {\n        std::cerr << \"Couldn't create temp file name.\\n\";\n        exit(1);\n      }\n      FILE* pemFile = fdopen(tmpPem, \"wb+\");\n      FILE* certFile = fdopen(tmpCert, \"wb+\");\n\n      if (Logging::log->loggingActive(LEVEL_DEBUG)) {\n        Logging::log->getLog(LEVEL_DEBUG) << \"tmp file name:\"\n            << tmplate1 << \" \" << tmplate2 << endl;\n      }\n\n      \/\/ write private key\n      \/\/ use the pkcs12 password as the pem password\n      char* password = strdup(options->pkcs12_file_password().c_str());\n      if (!PEM_write_PrivateKey(pemFile, pkey, NULL, NULL, 0, 0, password)) {\n        Logging::log->getLog(LEVEL_ERROR)\n            << \"Error writing pem file:\" << tmplate1 << endl;\n        unlink(tmplate1);\n        unlink(tmplate2);\n        exit(1);\n      }\n\n      \/\/ write ca certificate\n      if (!PEM_write_X509(certFile, cert)) {\n        Logging::log->getLog(LEVEL_ERROR) << \"Error writing cert file:\"\n            << tmplate2 << endl;\n        unlink(tmplate1);\n        unlink(tmplate2);\n        exit(1);\n      }\n\n      fclose(pemFile);\n      fclose(certFile);\n\n      pemFileName = tmplate1;\n      certFileName = tmplate2;\n\n      ssl_context_->set_password_callback(\n          boost::bind(&Client::get_pkcs12_password_callback, this));\n      ssl_context_->use_private_key_file(pemFileName, options->cert_format());\n      ssl_context_->use_certificate_chain_file(certFileName);\n\n      \/\/ FIXME(ps) make sure that the temporary files are deleted!\n    } else if (!options->pem_file_name().empty()) {\n      \/\/ otherwise use the pem files\n      Logging::log->getLog(LEVEL_INFO) << \"SSL support using key file \"\n          << options->pem_file_name() << endl;\n\n      try {\n        ssl_context_->set_password_callback(\n            boost::bind(&Client::get_pem_password_callback, this));\n        ssl_context_->use_private_key_file(options->pem_file_name(),\n                                           options->cert_format());\n        ssl_context_->use_certificate_chain_file(options->pem_cert_name());\n      } catch(invalid_argument& ia) {\n         cerr << \"Invalid argument: \" << ia.what() << endl;\n         cerr << \"Please check your private key and certificate file.\"<< endl;\n         exit(1);\n      }\n    }\n  }\n}\n\nstd::string Client::get_pem_password_callback() const {\n  return ssl_options->pem_file_password();\n}\n\nstd::string Client::get_pkcs12_password_callback() const {\n  return ssl_options->pkcs12_file_password();\n}\n\nvoid Client::sendRequest(const string& address,\n                         int32_t interface_id,\n                         int32_t proc_id,\n                         const UserCredentials& userCreds,\n                         const Auth& auth,\n                         const Message* message,\n                         const char* data,\n                         int data_length,\n                         Message* response_message,\n                         void* context,\n                         ClientRequestCallbackInterface *callback) {\n  uint32_t call_id =\n      boost::interprocess::detail::atomic_inc32(&callid_counter_);\n  ClientRequest *rq = new ClientRequest(address,\n                                        call_id,\n                                        interface_id,\n                                        proc_id,\n                                        userCreds,\n                                        auth,\n                                        message,\n                                        data,\n                                        data_length,\n                                        response_message,\n                                        context,\n                                        callback);\n\n  mutex::scoped_lock lock(this->requests_lock_);\n  bool wasEmpty = requests_.empty();\n  requests_.push(rq);\n  if (wasEmpty) {\n    service_.post(bind(&Client::sendInternalRequest, this));\n  }\n}\n\nvoid Client::sendInternalRequest() {\n  \/\/ Process requests.\n  do {\n    ClientRequest *rq = NULL;\n    {\n      mutex::scoped_lock lock(this->requests_lock_);\n      if (requests_.empty())\n        break;\n      rq = requests_.front();\n      requests_.pop();\n    }\n    assert(rq != NULL);\n\n    rq->RequestSent();\n\n    ClientConnection *con = NULL;\n    connection_map::iterator iter = connections_.find(rq->address());\n    if (iter != connections_.end())\n      con = iter->second;\n    if (con) {\n      con->AddRequest(rq);\n      con->DoProcess();\n    } else {\n      \/\/ New connection.\n\n      \/\/ FIXME(bjk) start resolving the address\n      const std::string &addr = rq->address();\n      int colonpos = addr.find(\":\");\n      if (colonpos < 0) {\n        RPCHeader::ErrorResponse* err = new RPCHeader::ErrorResponse();\n        err->set_error_message(std::string(\"invalid address: \") + addr);\n        err->set_error_type(IO_ERROR);\n        err->set_posix_errno(POSIX_ERROR_EINVAL);\n        rq->set_error(err);\n        rq->ExecuteCallback();\n      } else {\n        try {\n          std::string server = addr.substr(0, colonpos);\n          std::string port = addr.substr(colonpos + 1);\n\n          con = new ClientConnection(server,\n                                     port,\n                                     service_,\n                                     &request_table_,\n                                     connect_timeout_s_,\n                                     connect_timeout_s_,\n                                     use_gridssl_,\n                                     ssl_context_);\n\n          if (Logging::log->loggingActive(LEVEL_DEBUG)) {\n            Logging::log->getLog(LEVEL_DEBUG) << \"new connection for \"\n                << addr << endl;\n          }\n\n          connections_[addr] = con;\n          con->AddRequest(rq);\n          con->DoProcess();\n        } catch(std::out_of_range &exception) {\n          RPCHeader::ErrorResponse* err = new RPCHeader::ErrorResponse();\n          err->set_error_message(std::string(\"exception: \")\n              + exception.what());\n          err->set_error_type(ERRNO);\n          err->set_posix_errno(POSIX_ERROR_EINVAL);\n          rq->set_error(err);\n          rq->ExecuteCallback();\n        }\n      }\n    }\n  } while (true);\n}\n\nvoid Client::handleTimeout(const boost::system::error_code& error) {\n  try {\n    request_map::iterator iter = request_table_.begin();\n    list<int32_t> to_be_removed1;\n    posix_time::ptime deadline = posix_time::microsec_clock::local_time()\n        - posix_time::seconds(rq_timeout_s_);\n\n    for (; iter != request_table_.end(); ++iter) {\n      ClientRequest *rq = iter->second;\n      if (rq->time_sent() < deadline) {\n        if (Logging::log->loggingActive(LEVEL_DEBUG)) {\n          Logging::log->getLog(LEVEL_DEBUG) << \"request timed out: \"\n              << rq->call_id() << endl;\n        }\n\n        RPCHeader::ErrorResponse* err = new RPCHeader::ErrorResponse();\n        err->set_error_message(string(\"request timed out\"));\n        err->set_error_type(IO_ERROR);\n        err->set_posix_errno(POSIX_ERROR_EINVAL);\n        rq->set_error(err);\n        rq->ExecuteCallback();\n        to_be_removed1.push_back(iter->first);\n      }\n    }\n    for (list<int32_t>::iterator it = to_be_removed1.begin();\n        it != to_be_removed1.end(); it++) {\n      request_table_.erase(*it);\n    }\n\n    connection_map::iterator iter2 = connections_.begin();\n    list<std::string> to_be_removed2;\n    posix_time::ptime deadline2 = posix_time::microsec_clock::local_time()\n        - posix_time::seconds(max_con_linger_);\n\n    for (; iter2 != connections_.end(); iter2++) {\n      pair<string, ClientConnection*> entry = *iter2;\n      ClientConnection *con = entry.second;\n      string addr = entry.first;\n      assert(con != NULL);\n      if (con->last_used() < deadline2) {\n        if (Logging::log->loggingActive(LEVEL_DEBUG)) {\n          Logging::log->getLog(LEVEL_DEBUG)\n              << \"connection not used, closing... \" << addr << endl;\n        }\n\n        to_be_removed2.push_back(addr);\n        con->Close();\n      }\n    }\n\n    for (list<string>::iterator it = to_be_removed2.begin();\n        it != to_be_removed2.end(); it++) {\n      connections_.erase(*it);\n    }\n  } catch(std::exception &e) {\n    cerr << \"exception: \" << e.what() << endl;\n  }\n  rq_timeout_timer_.expires_from_now(posix_time::seconds(rq_timeout_s_));\n  rq_timeout_timer_.async_wait(bind(&Client::handleTimeout,\n                                    this,\n                                    asio::placeholders::error));\n}\n\nvoid Client::run() {\n  asio::io_service::work work(service_);\n  rq_timeout_timer_.expires_from_now(posix_time::seconds(rq_timeout_s_));\n  rq_timeout_timer_.async_wait(bind(&Client::handleTimeout,\n                                    this,\n                                    asio::placeholders::error));\n\n  if (Logging::log->loggingActive(LEVEL_INFO)) {\n    Logging::log->getLog(LEVEL_INFO) << \"starting rpc client\" << endl;\n    if (ssl_context_ != NULL) {\n      if (use_gridssl_) {\n        Logging::log->getLog(LEVEL_INFO) << \"running in GRID SSL mode\"\n            << endl;\n      } else {\n        Logging::log->getLog(LEVEL_INFO) << \"running in SSL mode\"\n            << endl;\n      }\n    } else {\n      Logging::log->getLog(LEVEL_INFO) << \"running in plain TPC mode\"\n          << endl;\n    }\n  }\n\n  service_.run();\n\n  connection_map::iterator iter2 = connections_.begin();\n  for (; iter2 != connections_.end(); iter2++) {\n    ClientConnection *con = iter2->second;\n    assert(con != NULL);\n    con->Close();\n    delete con;\n  }\n}\n\nvoid Client::shutdown() {\n  service_.stop();\n  if (Logging::log->loggingActive(LEVEL_INFO)) {\n    Logging::log->getLog(LEVEL_INFO) << \"rpc client stopped\" << endl;\n  }\n}\n\nClient::~Client() {\n  delete ssl_options;\n  \/\/ remove temporary cert and pem files\n  if (pemFileName != NULL) {\n    unlink(pemFileName);\n  }\n  if (certFileName != NULL) {\n    unlink(certFileName);\n  }\n}\n\n}  \/\/ namespace rpc\n}  \/\/ namespace xtreemfs\n<commit_msg>client: Added no_tlsv1 to avoid problems with openssl >= 1.0<commit_after>\/*\n * Copyright (c) 2009-2010 by Bjoern Kolbeck, Zuse Institute Berlin\n *\n * Licensed under the BSD License, see LICENSE file for details.\n *\n *\/\n\n#include \"rpc\/client.h\"\n\n#include <openssl\/pem.h>\n#include <openssl\/err.h>\n#include <openssl\/pkcs12.h>\n#include <openssl\/bio.h>\n#include <openssl\/rand.h>\n#include <openssl\/x509.h>\n#include <openssl\/evp.h>\n#include <unistd.h>\n\n#include <boost\/algorithm\/string\/trim.hpp>\n#include <boost\/interprocess\/detail\/atomic.hpp>\n\n#include <cstdio>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <utility>\n#include <string>\n\n#include \"util\/logging.h\"\n\n\nnamespace xtreemfs {\nnamespace rpc {\nusing namespace xtreemfs::pbrpc;\nusing namespace xtreemfs::util;\nusing namespace std;\nusing namespace boost;\nusing namespace google::protobuf;\n\nClient::Client(int32_t connect_timeout_s,\n               int32_t request_timeout_s,\n               int32_t max_con_linger,\n               const SSLOptions* options)\n    : service_(),\n      resolver_(service_),\n      use_gridssl_(false),\n      ssl_context_(NULL),\n      callid_counter_(1),\n      rq_timeout_timer_(service_),\n      rq_timeout_s_(request_timeout_s),\n      connect_timeout_s_(connect_timeout_s),\n      max_con_linger_(max_con_linger),\n      ssl_options(options),\n      pemFileName(NULL),\n      certFileName(NULL) {\n  \/\/ Check if ssl options were passed.\n  if (options != NULL) {\n    Logging::log->getLog(LEVEL_INFO) << \"SSL support activated\" << endl;\n\n    use_gridssl_ = options->use_grid_ssl();\n    ssl_context_ =\n        new boost::asio::ssl::context(service_,\n                                      boost::asio::ssl::context::sslv23);\n    ssl_context_->set_options(boost::asio::ssl::context::no_tlsv1);\n    ssl_context_->set_verify_mode(boost::asio::ssl::context::verify_none);\n\n    OpenSSL_add_all_algorithms();\n    OpenSSL_add_all_ciphers();\n    OpenSSL_add_all_digests();\n    SSL_load_error_strings();\n\n    \/\/ check if pkcs12 was entered\n    \/\/ the pkcs12 file has to be read using openssl\n    \/\/ afterwards the pem- and cert-files are written to temporary files on disk\n    \/\/ these can be accessed by boost::assio::ssl\n    if (!options->pkcs12_file_name().empty()) {\n      Logging::log->getLog(LEVEL_INFO) << \"SSL suport using pkcs12 file \"\n          << options->pkcs12_file_name() << endl;\n\n      char tmplate1[] = \"\/tmp\/pmXXXXXX\";\n      char tmplate2[] = \"\/tmp\/ctXXXXXX\";\n\n      const char* fp = options->pkcs12_file_name().c_str();\n      FILE *p12_file = fopen(fp, \"rb\");\n\n      \/\/ read the pkcs12 file\n      if (!p12_file) {\n        Logging::log->getLog(LEVEL_ERROR) << \"Error opening pkcs12 file:\"\n            << options->pkcs12_file_name() << \". (file not found)\" << endl;\n        exit(1);\n      }\n      PKCS12 *p12 = d2i_PKCS12_fp(p12_file, NULL);\n      fclose(p12_file);\n\n      if (!p12) {\n        Logging::log->getLog(LEVEL_ERROR) << \"Error reading pkcs12 file:\"\n            << options->pkcs12_file_name() << \". (no access rights?)\" << endl;\n        ERR_print_errors_fp(stderr);\n        exit(1);\n      }\n\n      EVP_PKEY *pkey = NULL;\n      X509 *cert = NULL;\n      STACK_OF(X509) *ca = NULL;\n\n      \/\/ parse pkcs12 file\n      if (!PKCS12_parse(p12,\n                        options->pkcs12_file_password().c_str(),\n                        &pkey,\n                        &cert,\n                        &ca)) {\n        Logging::log->getLog(LEVEL_ERROR) << \"Error parsing pkcs12 file:\"\n            << options->pkcs12_file_name() << endl;\n        ERR_print_errors_fp(stderr);\n        exit(1);\n      }\n      PKCS12_free(p12);\n\n      \/\/ create two tmp files containing the PEM certificates.\n      \/\/ these which be deleted when exiting the program\n      int tmpPem = mkstemp(tmplate1);\n      int tmpCert = mkstemp(tmplate2);\n      if (tmpPem == -1 || tmpCert == -1) {\n        std::cerr << \"Couldn't create temp file name.\\n\";\n        exit(1);\n      }\n      FILE* pemFile = fdopen(tmpPem, \"wb+\");\n      FILE* certFile = fdopen(tmpCert, \"wb+\");\n\n      if (Logging::log->loggingActive(LEVEL_DEBUG)) {\n        Logging::log->getLog(LEVEL_DEBUG) << \"tmp file name:\"\n            << tmplate1 << \" \" << tmplate2 << endl;\n      }\n\n      \/\/ write private key\n      \/\/ use the pkcs12 password as the pem password\n      char* password = strdup(options->pkcs12_file_password().c_str());\n      if (!PEM_write_PrivateKey(pemFile, pkey, NULL, NULL, 0, 0, password)) {\n        Logging::log->getLog(LEVEL_ERROR)\n            << \"Error writing pem file:\" << tmplate1 << endl;\n        unlink(tmplate1);\n        unlink(tmplate2);\n        exit(1);\n      }\n\n      \/\/ write ca certificate\n      if (!PEM_write_X509(certFile, cert)) {\n        Logging::log->getLog(LEVEL_ERROR) << \"Error writing cert file:\"\n            << tmplate2 << endl;\n        unlink(tmplate1);\n        unlink(tmplate2);\n        exit(1);\n      }\n\n      fclose(pemFile);\n      fclose(certFile);\n\n      pemFileName = tmplate1;\n      certFileName = tmplate2;\n\n      ssl_context_->set_password_callback(\n          boost::bind(&Client::get_pkcs12_password_callback, this));\n      ssl_context_->use_private_key_file(pemFileName, options->cert_format());\n      ssl_context_->use_certificate_chain_file(certFileName);\n\n      \/\/ FIXME(ps) make sure that the temporary files are deleted!\n    } else if (!options->pem_file_name().empty()) {\n      \/\/ otherwise use the pem files\n      Logging::log->getLog(LEVEL_INFO) << \"SSL support using key file \"\n          << options->pem_file_name() << endl;\n\n      try {\n        ssl_context_->set_password_callback(\n            boost::bind(&Client::get_pem_password_callback, this));\n        ssl_context_->use_private_key_file(options->pem_file_name(),\n                                           options->cert_format());\n        ssl_context_->use_certificate_chain_file(options->pem_cert_name());\n      } catch(invalid_argument& ia) {\n         cerr << \"Invalid argument: \" << ia.what() << endl;\n         cerr << \"Please check your private key and certificate file.\"<< endl;\n         exit(1);\n      }\n    }\n  }\n}\n\nstd::string Client::get_pem_password_callback() const {\n  return ssl_options->pem_file_password();\n}\n\nstd::string Client::get_pkcs12_password_callback() const {\n  return ssl_options->pkcs12_file_password();\n}\n\nvoid Client::sendRequest(const string& address,\n                         int32_t interface_id,\n                         int32_t proc_id,\n                         const UserCredentials& userCreds,\n                         const Auth& auth,\n                         const Message* message,\n                         const char* data,\n                         int data_length,\n                         Message* response_message,\n                         void* context,\n                         ClientRequestCallbackInterface *callback) {\n  uint32_t call_id =\n      boost::interprocess::detail::atomic_inc32(&callid_counter_);\n  ClientRequest *rq = new ClientRequest(address,\n                                        call_id,\n                                        interface_id,\n                                        proc_id,\n                                        userCreds,\n                                        auth,\n                                        message,\n                                        data,\n                                        data_length,\n                                        response_message,\n                                        context,\n                                        callback);\n\n  mutex::scoped_lock lock(this->requests_lock_);\n  bool wasEmpty = requests_.empty();\n  requests_.push(rq);\n  if (wasEmpty) {\n    service_.post(bind(&Client::sendInternalRequest, this));\n  }\n}\n\nvoid Client::sendInternalRequest() {\n  \/\/ Process requests.\n  do {\n    ClientRequest *rq = NULL;\n    {\n      mutex::scoped_lock lock(this->requests_lock_);\n      if (requests_.empty())\n        break;\n      rq = requests_.front();\n      requests_.pop();\n    }\n    assert(rq != NULL);\n\n    rq->RequestSent();\n\n    ClientConnection *con = NULL;\n    connection_map::iterator iter = connections_.find(rq->address());\n    if (iter != connections_.end())\n      con = iter->second;\n    if (con) {\n      con->AddRequest(rq);\n      con->DoProcess();\n    } else {\n      \/\/ New connection.\n\n      \/\/ FIXME(bjk) start resolving the address\n      const std::string &addr = rq->address();\n      int colonpos = addr.find(\":\");\n      if (colonpos < 0) {\n        RPCHeader::ErrorResponse* err = new RPCHeader::ErrorResponse();\n        err->set_error_message(std::string(\"invalid address: \") + addr);\n        err->set_error_type(IO_ERROR);\n        err->set_posix_errno(POSIX_ERROR_EINVAL);\n        rq->set_error(err);\n        rq->ExecuteCallback();\n      } else {\n        try {\n          std::string server = addr.substr(0, colonpos);\n          std::string port = addr.substr(colonpos + 1);\n\n          con = new ClientConnection(server,\n                                     port,\n                                     service_,\n                                     &request_table_,\n                                     connect_timeout_s_,\n                                     connect_timeout_s_,\n                                     use_gridssl_,\n                                     ssl_context_);\n\n          if (Logging::log->loggingActive(LEVEL_DEBUG)) {\n            Logging::log->getLog(LEVEL_DEBUG) << \"new connection for \"\n                << addr << endl;\n          }\n\n          connections_[addr] = con;\n          con->AddRequest(rq);\n          con->DoProcess();\n        } catch(std::out_of_range &exception) {\n          RPCHeader::ErrorResponse* err = new RPCHeader::ErrorResponse();\n          err->set_error_message(std::string(\"exception: \")\n              + exception.what());\n          err->set_error_type(ERRNO);\n          err->set_posix_errno(POSIX_ERROR_EINVAL);\n          rq->set_error(err);\n          rq->ExecuteCallback();\n        }\n      }\n    }\n  } while (true);\n}\n\nvoid Client::handleTimeout(const boost::system::error_code& error) {\n  try {\n    request_map::iterator iter = request_table_.begin();\n    list<int32_t> to_be_removed1;\n    posix_time::ptime deadline = posix_time::microsec_clock::local_time()\n        - posix_time::seconds(rq_timeout_s_);\n\n    for (; iter != request_table_.end(); ++iter) {\n      ClientRequest *rq = iter->second;\n      if (rq->time_sent() < deadline) {\n        if (Logging::log->loggingActive(LEVEL_DEBUG)) {\n          Logging::log->getLog(LEVEL_DEBUG) << \"request timed out: \"\n              << rq->call_id() << endl;\n        }\n\n        RPCHeader::ErrorResponse* err = new RPCHeader::ErrorResponse();\n        err->set_error_message(string(\"request timed out\"));\n        err->set_error_type(IO_ERROR);\n        err->set_posix_errno(POSIX_ERROR_EINVAL);\n        rq->set_error(err);\n        rq->ExecuteCallback();\n        to_be_removed1.push_back(iter->first);\n      }\n    }\n    for (list<int32_t>::iterator it = to_be_removed1.begin();\n        it != to_be_removed1.end(); it++) {\n      request_table_.erase(*it);\n    }\n\n    connection_map::iterator iter2 = connections_.begin();\n    list<std::string> to_be_removed2;\n    posix_time::ptime deadline2 = posix_time::microsec_clock::local_time()\n        - posix_time::seconds(max_con_linger_);\n\n    for (; iter2 != connections_.end(); iter2++) {\n      pair<string, ClientConnection*> entry = *iter2;\n      ClientConnection *con = entry.second;\n      string addr = entry.first;\n      assert(con != NULL);\n      if (con->last_used() < deadline2) {\n        if (Logging::log->loggingActive(LEVEL_DEBUG)) {\n          Logging::log->getLog(LEVEL_DEBUG)\n              << \"connection not used, closing... \" << addr << endl;\n        }\n\n        to_be_removed2.push_back(addr);\n        con->Close();\n      }\n    }\n\n    for (list<string>::iterator it = to_be_removed2.begin();\n        it != to_be_removed2.end(); it++) {\n      connections_.erase(*it);\n    }\n  } catch(std::exception &e) {\n    cerr << \"exception: \" << e.what() << endl;\n  }\n  rq_timeout_timer_.expires_from_now(posix_time::seconds(rq_timeout_s_));\n  rq_timeout_timer_.async_wait(bind(&Client::handleTimeout,\n                                    this,\n                                    asio::placeholders::error));\n}\n\nvoid Client::run() {\n  asio::io_service::work work(service_);\n  rq_timeout_timer_.expires_from_now(posix_time::seconds(rq_timeout_s_));\n  rq_timeout_timer_.async_wait(bind(&Client::handleTimeout,\n                                    this,\n                                    asio::placeholders::error));\n\n  if (Logging::log->loggingActive(LEVEL_INFO)) {\n    Logging::log->getLog(LEVEL_INFO) << \"starting rpc client\" << endl;\n    if (ssl_context_ != NULL) {\n      if (use_gridssl_) {\n        Logging::log->getLog(LEVEL_INFO) << \"running in GRID SSL mode\"\n            << endl;\n      } else {\n        Logging::log->getLog(LEVEL_INFO) << \"running in SSL mode\"\n            << endl;\n      }\n    } else {\n      Logging::log->getLog(LEVEL_INFO) << \"running in plain TPC mode\"\n          << endl;\n    }\n  }\n\n  service_.run();\n\n  connection_map::iterator iter2 = connections_.begin();\n  for (; iter2 != connections_.end(); iter2++) {\n    ClientConnection *con = iter2->second;\n    assert(con != NULL);\n    con->Close();\n    delete con;\n  }\n}\n\nvoid Client::shutdown() {\n  service_.stop();\n  if (Logging::log->loggingActive(LEVEL_INFO)) {\n    Logging::log->getLog(LEVEL_INFO) << \"rpc client stopped\" << endl;\n  }\n}\n\nClient::~Client() {\n  delete ssl_options;\n  \/\/ remove temporary cert and pem files\n  if (pemFileName != NULL) {\n    unlink(pemFileName);\n  }\n  if (certFileName != NULL) {\n    unlink(certFileName);\n  }\n}\n\n}  \/\/ namespace rpc\n}  \/\/ namespace xtreemfs\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/eve:$Id$\n\/\/ Author: Matevz Tadel\n\n#include \"TCanvas.h\"\n#include \"TStyle.h\"\n#include \"TFile.h\"\n#include \"TStopwatch.h\"\n#include \"TError.h\"\n\nclass TEveTriangleSet;\n\nTEveTriangleSet *ts1=0, *ts2=0, *ts3=0;\n\nvoid triangleset()\n{\n   TEveManager::Create();\n\n   {\n      ts1 = TEveTriangleSet::ReadTrivialFile(\"broken_torus.tring\");\n      ts1->SetName(\"RandomColors\");\n      ts1->GenerateTriangleNormals();\n      ts1->GenerateRandomColors();\n      ts1->SetColor(0);\n      TGeoHMatrix m;\n      Double_t scale[3] = { 0.5, 0.5, 0.5 };\n      m.SetScale(scale);\n      ts1->SetTransMatrix(m);\n      gEve->AddElement(ts1);\n   }\n   {\n      ts2 = TEveTriangleSet::ReadTrivialFile(\"broken_torus.tring\");\n      ts2->SetName(\"SmallBlue\");\n      ts2->GenerateTriangleNormals();\n      ts2->SetColor(4);\n      TGeoHMatrix m;\n      m.RotateY(90);\n      Double_t scale[3] = { 0.8, 0.8, 1.2 };\n      m.SetScale(scale);\n      ts2->SetTransMatrix(m);\n      gEve->AddElement(ts2);\n   }\n   {\n      ts3 = TEveTriangleSet::ReadTrivialFile(\"broken_torus.tring\");\n      ts3->SetName(\"Spectrum\");\n      ts3->GenerateTriangleNormals();\n      gStyle->SetPalette(1, 0);\n      ts3->GenerateZNormalColors(50, -50, 50, kTRUE, kTRUE);\n      ts3->SetColor(0);\n      TGeoHMatrix m;\n      m.RotateZ(90);\n      Double_t scale[3] = { 1.3, 1.0, 1.6 };\n      m.SetScale(scale);\n      ts3->SetTransMatrix(m);\n      gEve->AddElement(ts3);\n   }\n\n   gEve->Redraw3D(kTRUE);\n}\n<commit_msg>Use SetMainColor() - SetColor() has been removed from TEveTriangleSet.<commit_after>\/\/ @(#)root\/eve:$Id$\n\/\/ Author: Matevz Tadel\n\n#include \"TCanvas.h\"\n#include \"TStyle.h\"\n#include \"TFile.h\"\n#include \"TStopwatch.h\"\n#include \"TError.h\"\n\nclass TEveTriangleSet;\n\nTEveTriangleSet *ts1=0, *ts2=0, *ts3=0;\n\nvoid triangleset()\n{\n   TEveManager::Create();\n\n   {\n      ts1 = TEveTriangleSet::ReadTrivialFile(\"broken_torus.tring\");\n      ts1->SetName(\"RandomColors\");\n      ts1->GenerateTriangleNormals();\n      ts1->GenerateRandomColors();\n      ts1->SetMainColor(0);\n      TGeoHMatrix m;\n      Double_t scale[3] = { 0.5, 0.5, 0.5 };\n      m.SetScale(scale);\n      ts1->SetTransMatrix(m);\n      gEve->AddElement(ts1);\n   }\n   {\n      ts2 = TEveTriangleSet::ReadTrivialFile(\"broken_torus.tring\");\n      ts2->SetName(\"SmallBlue\");\n      ts2->GenerateTriangleNormals();\n      ts2->SetMainColor(4);\n      TGeoHMatrix m;\n      m.RotateY(90);\n      Double_t scale[3] = { 0.8, 0.8, 1.2 };\n      m.SetScale(scale);\n      ts2->SetTransMatrix(m);\n      gEve->AddElement(ts2);\n   }\n   {\n      ts3 = TEveTriangleSet::ReadTrivialFile(\"broken_torus.tring\");\n      ts3->SetName(\"Spectrum\");\n      ts3->GenerateTriangleNormals();\n      gStyle->SetPalette(1, 0);\n      ts3->GenerateZNormalColors(50, -50, 50, kTRUE, kTRUE);\n      ts3->SetMainColor(0);\n      TGeoHMatrix m;\n      m.RotateZ(90);\n      Double_t scale[3] = { 1.3, 1.0, 1.6 };\n      m.SetScale(scale);\n      ts3->SetTransMatrix(m);\n      gEve->AddElement(ts3);\n   }\n\n   gEve->Redraw3D(kTRUE);\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 \"select_file_dialog_android.h\"\n\n#include \"base\/android\/jni_android.h\"\n#include \"base\/android\/jni_array.h\"\n#include \"base\/android\/jni_string.h\"\n#include \"base\/android\/scoped_java_ref.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n#include \"base\/strings\/string_split.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"jni\/SelectFileDialog_jni.h\"\n#include \"ui\/android\/window_android.h\"\n\nnamespace ui {\n\n\/\/ static\nSelectFileDialogImpl* SelectFileDialogImpl::Create(Listener* listener,\n                                           ui::SelectFilePolicy* policy) {\n  return new SelectFileDialogImpl(listener, policy);\n}\n\nvoid SelectFileDialogImpl::OnFileSelected(JNIEnv* env,\n                                          jobject java_object,\n                                          jstring filepath) {\n  if (listener_) {\n    std::string path = base::android::ConvertJavaStringToUTF8(env, filepath);\n    listener_->FileSelected(base::FilePath(path), 0, NULL);\n  }\n\n  is_running_ = false;\n}\n\nvoid SelectFileDialogImpl::OnFileNotSelected(\n    JNIEnv* env,\n    jobject java_object) {\n  if (listener_)\n    listener_->FileSelectionCanceled(NULL);\n\n  is_running_ = false;\n}\n\nbool SelectFileDialogImpl::IsRunning(gfx::NativeWindow) const {\n  return is_running_;\n}\n\nvoid SelectFileDialogImpl::ListenerDestroyed() {\n  listener_ = NULL;\n}\n\nvoid SelectFileDialogImpl::SelectFileImpl(\n    ui::SelectFileDialog::Type type,\n    const string16& title,\n    const base::FilePath& default_path,\n    const SelectFileDialog::FileTypeInfo* file_types,\n    int file_type_index,\n    const std::string& default_extension,\n    gfx::NativeWindow owning_window,\n    void* params) {\n  JNIEnv* env = base::android::AttachCurrentThread();\n\n  std::vector<string16> accept_types =\n      *(reinterpret_cast<std::vector<string16>*>(params));\n\n  \/\/ The last string in params is expected to be the string with capture value.\n  ScopedJavaLocalRef<jstring> capture_value =\n      base::android::ConvertUTF16ToJavaString(env,\n          StringToLowerASCII(accept_types.back()));\n  base::android::CheckException(env);\n  accept_types.pop_back();\n\n  \/\/ The rest params elements are expected to be accept_types.\n  ScopedJavaLocalRef<jobjectArray> accept_types_java =\n      base::android::ToJavaArrayOfStrings(env, accept_types);\n\n  Java_SelectFileDialog_selectFile(env, java_object_.obj(),\n                                   accept_types_java.obj(),\n                                   capture_value.obj(),\n                                   owning_window->GetJavaObject().obj());\n  is_running_ = true;\n}\n\nbool SelectFileDialogImpl::RegisterSelectFileDialog(JNIEnv* env) {\n  return RegisterNativesImpl(env);\n}\n\nSelectFileDialogImpl::~SelectFileDialogImpl() {\n}\n\nSelectFileDialogImpl::SelectFileDialogImpl(Listener* listener,\n                                           ui::SelectFilePolicy* policy)\n    : ui::SelectFileDialog(listener, policy),\n      is_running_(false) {\n  JNIEnv* env = base::android::AttachCurrentThread();\n  java_object_.Reset(\n      Java_SelectFileDialog_create(env, reinterpret_cast<jint>(this)));\n}\n\nbool SelectFileDialogImpl::HasMultipleFileTypeChoicesImpl() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nSelectFileDialog* CreateAndroidSelectFileDialog(\n    SelectFileDialog::Listener* listener,\n    SelectFilePolicy* policy) {\n  return SelectFileDialogImpl::Create(listener, policy);\n}\n\n}  \/\/ namespace ui\n<commit_msg>Fix the Android implementation of SelectFile() SEGV when params is NULL.<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 \"select_file_dialog_android.h\"\n\n#include \"base\/android\/jni_android.h\"\n#include \"base\/android\/jni_array.h\"\n#include \"base\/android\/jni_string.h\"\n#include \"base\/android\/scoped_java_ref.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n#include \"base\/strings\/string_split.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"jni\/SelectFileDialog_jni.h\"\n#include \"ui\/android\/window_android.h\"\n\nnamespace ui {\n\n\/\/ static\nSelectFileDialogImpl* SelectFileDialogImpl::Create(Listener* listener,\n                                           ui::SelectFilePolicy* policy) {\n  return new SelectFileDialogImpl(listener, policy);\n}\n\nvoid SelectFileDialogImpl::OnFileSelected(JNIEnv* env,\n                                          jobject java_object,\n                                          jstring filepath) {\n  if (listener_) {\n    std::string path = base::android::ConvertJavaStringToUTF8(env, filepath);\n    listener_->FileSelected(base::FilePath(path), 0, NULL);\n  }\n\n  is_running_ = false;\n}\n\nvoid SelectFileDialogImpl::OnFileNotSelected(\n    JNIEnv* env,\n    jobject java_object) {\n  if (listener_)\n    listener_->FileSelectionCanceled(NULL);\n\n  is_running_ = false;\n}\n\nbool SelectFileDialogImpl::IsRunning(gfx::NativeWindow) const {\n  return is_running_;\n}\n\nvoid SelectFileDialogImpl::ListenerDestroyed() {\n  listener_ = NULL;\n}\n\nvoid SelectFileDialogImpl::SelectFileImpl(\n    ui::SelectFileDialog::Type type,\n    const string16& title,\n    const base::FilePath& default_path,\n    const SelectFileDialog::FileTypeInfo* file_types,\n    int file_type_index,\n    const std::string& default_extension,\n    gfx::NativeWindow owning_window,\n    void* params) {\n  JNIEnv* env = base::android::AttachCurrentThread();\n\n  ScopedJavaLocalRef<jstring> capture_value;\n  std::vector<string16> accept_types;\n  if (params) {\n    accept_types = *(reinterpret_cast<std::vector<string16>*>(params));\n\n    \/\/ The last string in params is expected to be the string\n    \/\/ with capture value.\n    capture_value = base::android::ConvertUTF16ToJavaString(env,\n          StringToLowerASCII(accept_types.back()));\n    base::android::CheckException(env);\n    accept_types.pop_back();\n  } else {\n    capture_value = base::android::ConvertUTF8ToJavaString(env, \"filesystem\");\n  }\n\n  \/\/ The rest params elements are expected to be accept_types.\n  ScopedJavaLocalRef<jobjectArray> accept_types_java =\n      base::android::ToJavaArrayOfStrings(env, accept_types);\n\n  Java_SelectFileDialog_selectFile(env, java_object_.obj(),\n                                   accept_types_java.obj(),\n                                   capture_value.obj(),\n                                   owning_window->GetJavaObject().obj());\n  is_running_ = true;\n}\n\nbool SelectFileDialogImpl::RegisterSelectFileDialog(JNIEnv* env) {\n  return RegisterNativesImpl(env);\n}\n\nSelectFileDialogImpl::~SelectFileDialogImpl() {\n}\n\nSelectFileDialogImpl::SelectFileDialogImpl(Listener* listener,\n                                           ui::SelectFilePolicy* policy)\n    : ui::SelectFileDialog(listener, policy),\n      is_running_(false) {\n  JNIEnv* env = base::android::AttachCurrentThread();\n  java_object_.Reset(\n      Java_SelectFileDialog_create(env, reinterpret_cast<jint>(this)));\n}\n\nbool SelectFileDialogImpl::HasMultipleFileTypeChoicesImpl() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nSelectFileDialog* CreateAndroidSelectFileDialog(\n    SelectFileDialog::Listener* listener,\n    SelectFilePolicy* policy) {\n  return SelectFileDialogImpl::Create(listener, policy);\n}\n\n}  \/\/ namespace ui\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#include <vector>\n\n#include \"tensorflow\/core\/common_runtime\/kernel_benchmark_testlib.h\"\n#include \"tensorflow\/core\/framework\/allocator.h\"\n#include \"tensorflow\/core\/framework\/fake_input.h\"\n#include \"tensorflow\/core\/framework\/node_def_builder.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/tensor_testutil.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/graph\/node_builder.h\"\n#include \"tensorflow\/core\/kernels\/ops_testutil.h\"\n#include \"tensorflow\/core\/kernels\/ops_util.h\"\n#include \"tensorflow\/core\/lib\/core\/status_test_util.h\"\n#include \"tensorflow\/core\/platform\/test.h\"\n#include \"tensorflow\/core\/platform\/test_benchmark.h\"\n\nnamespace tensorflow {\nclass FusedBatchNormOpTest : public OpsTestBase {};\n\nTEST_F(FusedBatchNormOpTest, Training) {\n  TF_EXPECT_OK(NodeDefBuilder(\"batch_norm_op\", \"FusedBatchNorm\")\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Attr(\"epsilon\", 0.001)\n                   .Attr(\"is_training\", true)\n                   .Finalize(node_def()));\n  TF_EXPECT_OK(InitOp());\n  AddInputFromArray<float>(TensorShape({1, 1, 6, 2}),\n                           {5, 5, 7, 7, 9, 9, 11, 11, 13, 13, 15, 15});\n  AddInputFromArray<float>(TensorShape({2}), {4.0, 4.0});\n  AddInputFromArray<float>(TensorShape({2}), {2.0, 2.0});\n  AddInputFromArray<float>(TensorShape({0}), {});\n  AddInputFromArray<float>(TensorShape({0}), {});\n\n  TF_ASSERT_OK(RunOpKernel());\n\n  Tensor expected(allocator(), DT_FLOAT, TensorShape({1, 1, 6, 2}));\n  test::FillValues<float>(&expected, {-3.86, -3.86, -1.51, -1.51, 0.83, 0.83,\n                                      3.17, 3.17, 5.51, 5.51, 7.86, 7.86});\n  test::ExpectTensorNear<float>(expected, *GetOutput(0), 0.01);\n\n  Tensor expected_mean(allocator(), DT_FLOAT, TensorShape({2}));\n  test::FillValues<float>(&expected_mean, {10, 10});\n  test::ExpectTensorNear<float>(expected_mean, *GetOutput(1), 0.01);\n\n  Tensor expected_variance(allocator(), DT_FLOAT, TensorShape({2}));\n  test::FillValues<float>(&expected_variance, {14.00, 14.00});\n  test::ExpectTensorNear<float>(expected_variance, *GetOutput(2), 0.01);\n}\n\nTEST_F(FusedBatchNormOpTest, Inference) {\n  TF_EXPECT_OK(NodeDefBuilder(\"batch_norm_op\", \"FusedBatchNorm\")\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Attr(\"epsilon\", 0.001)\n                   .Attr(\"is_training\", false)\n                   .Finalize(node_def()));\n  TF_EXPECT_OK(InitOp());\n  AddInputFromArray<float>(TensorShape({1, 1, 6, 2}),\n                           {5, 5, 7, 7, 9, 9, 11, 11, 13, 13, 15, 15});\n  AddInputFromArray<float>(TensorShape({2}), {4.0, 4.0});\n  AddInputFromArray<float>(TensorShape({2}), {2.0, 2.0});\n  AddInputFromArray<float>(TensorShape({2}), {10, 10});\n  AddInputFromArray<float>(TensorShape({2}), {11.67f, 11.67f});\n\n  TF_ASSERT_OK(RunOpKernel());\n\n  Tensor expected(allocator(), DT_FLOAT, TensorShape({1, 1, 6, 2}));\n  test::FillValues<float>(&expected, {-3.86, -3.86, -1.51, -1.51, 0.83, 0.83,\n                                      3.17, 3.17, 5.51, 5.51, 7.86, 7.86});\n  test::ExpectTensorNear<float>(expected, *GetOutput(0), 0.01);\n}\n\nclass FusedBatchNormGradOpTest : public OpsTestBase {};\n\nTEST_F(FusedBatchNormGradOpTest, Simple) {\n  TF_EXPECT_OK(NodeDefBuilder(\"batch_norm_grad_op\", \"FusedBatchNormGrad\")\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Attr(\"epsilon\", 0.001)\n                   .Finalize(node_def()));\n  TF_EXPECT_OK(InitOp());\n  AddInputFromArray<float>(TensorShape({1, 1, 6, 2}),\n                           {2, 2, 9, 9, -4, -4, 5, 5, 8, 8, 7, 7});\n  AddInputFromArray<float>(TensorShape({1, 1, 6, 2}),\n                           {1, 1, 7, 7, 4, 4, -3, -3, -11, -11, 13, 13});\n  AddInputFromArray<float>(TensorShape({2}), {4, 4});\n  AddInputFromArray<float>(TensorShape({2}), {1.833f, 1.833f});\n  AddInputFromArray<float>(TensorShape({2}), {57.472f, 57.472f});\n\n  TF_ASSERT_OK(RunOpKernel());\n\n  Tensor expected_x(allocator(), DT_FLOAT, TensorShape({1, 1, 6, 2}));\n  test::FillValues<float>(&expected_x, {-1.34, -1.34, 2.47, 2.47, -4.44, -4.44,\n                                        0.17, 0.17, 1.60, 1.60, 1.53, 1.53});\n  test::ExpectTensorNear<float>(expected_x, *GetOutput(0), 0.01);\n\n  Tensor expected_scale(allocator(), DT_FLOAT, TensorShape({2}));\n  test::FillValues<float>(&expected_scale, {-1.6488, -1.6488});\n  test::ExpectTensorNear<float>(expected_scale, *GetOutput(1), 0.01);\n\n  Tensor expected_offset(allocator(), DT_FLOAT, TensorShape({2}));\n  test::FillValues<float>(&expected_offset, {27, 27});\n  test::ExpectTensorNear<float>(expected_offset, *GetOutput(2), 0.01);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/ Performance benchmarks are below.                                          \/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nusing fp32 = float;\nusing fp16 = Eigen::half;\n\ntemplate <typename T>\nstatic Graph* FusedBatchNormInference(int n, int h, int w, int c,\n                                      bool is_training,\n                                      TensorFormat data_format) {\n  Graph* g = new Graph(OpRegistry::Global());\n\n  DataType dtype = DataTypeToEnum<T>::value;\n  Tensor x_t(dtype, data_format == FORMAT_NHWC ? TensorShape({n, h, w, c})\n                                               : TensorShape({n, c, h, w}));\n  x_t.flat<T>().setRandom();\n\n  Tensor other_t(DT_FLOAT, TensorShape({c}));\n  other_t.flat<float>().setRandom();\n\n  Tensor empty_t(DT_FLOAT, TensorShape({0}));\n\n  Node* x = test::graph::Constant(g, x_t, \"x\");\n  Node* other = test::graph::Constant(g, other_t, \"other\");\n  Node* empty = test::graph::Constant(g, empty_t, \"empty\");\n\n  Node* fused_batch_norm;\n  TF_CHECK_OK(NodeBuilder(g->NewName(\"fused_batch_norm\"), \"FusedBatchNormV2\")\n                  .Input(x)\n                  .Input(other)                        \/\/ scale\n                  .Input(other)                        \/\/ offset\n                  .Input(is_training ? empty : other)  \/\/ mean\n                  .Input(is_training ? empty : other)  \/\/ variance\n                  .Attr(\"T\", dtype)\n                  .Attr(\"U\", DT_FLOAT)\n                  .Attr(\"epsilon\", 0.001)\n                  .Attr(\"is_training\", is_training)\n                  .Attr(\"data_format\", ToString(data_format))\n                  .Finalize(g, &fused_batch_norm));\n\n  return g;\n}\n\n#define BM_NAME(N, H, W, C, T, IT, FORMAT, DEVICE) \\\n  BM_FusedBatchNorm##_##N##_##H##_##W##_##C##_##IT##_##FORMAT##_##T##_##DEVICE\n\n#define BM_FusedBatchNorm(N, H, W, C, T, IS_TRAINING, FORMAT, DEVICE)          \\\n  static void BM_NAME(N, H, W, C, T, IS_TRAINING, FORMAT, DEVICE)(int iters) { \\\n    testing::UseRealTime();                                                    \\\n    testing::ItemsProcessed(static_cast<int64>(iters) * N * H * W * C);        \\\n    test::Benchmark(#DEVICE, FusedBatchNormInference<T>(                       \\\n                                 N, H, W, C, IS_TRAINING, FORMAT_##FORMAT))    \\\n        .Run(iters);                                                           \\\n  }                                                                            \\\n  BENCHMARK(BM_NAME(N, H, W, C, T, IS_TRAINING, FORMAT, DEVICE));\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, false, NHWC, cpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, false, NHWC, cpu);\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, true, NHWC, cpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, true, NHWC, cpu);\n\n#ifdef GOOGLE_CUDA\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, false, NHWC, gpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, false, NHWC, gpu);\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, false, NCHW, gpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, false, NCHW, gpu);\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, true, NHWC, gpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, true, NHWC, gpu);\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, true, NCHW, gpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, true, NCHW, gpu);\n#endif  \/\/ GOOGLE_CUDA\n\n}  \/\/ namespace tensorflow\n<commit_msg>Add benchmarks for FusedBatchNormGrad.<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#include <vector>\n\n#include \"tensorflow\/core\/common_runtime\/kernel_benchmark_testlib.h\"\n#include \"tensorflow\/core\/framework\/allocator.h\"\n#include \"tensorflow\/core\/framework\/fake_input.h\"\n#include \"tensorflow\/core\/framework\/node_def_builder.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/tensor_testutil.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/graph\/node_builder.h\"\n#include \"tensorflow\/core\/kernels\/ops_testutil.h\"\n#include \"tensorflow\/core\/kernels\/ops_util.h\"\n#include \"tensorflow\/core\/lib\/core\/status_test_util.h\"\n#include \"tensorflow\/core\/platform\/test.h\"\n#include \"tensorflow\/core\/platform\/test_benchmark.h\"\n\nnamespace tensorflow {\nclass FusedBatchNormOpTest : public OpsTestBase {};\n\nTEST_F(FusedBatchNormOpTest, Training) {\n  TF_EXPECT_OK(NodeDefBuilder(\"batch_norm_op\", \"FusedBatchNorm\")\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Attr(\"epsilon\", 0.001)\n                   .Attr(\"is_training\", true)\n                   .Finalize(node_def()));\n  TF_EXPECT_OK(InitOp());\n  AddInputFromArray<float>(TensorShape({1, 1, 6, 2}),\n                           {5, 5, 7, 7, 9, 9, 11, 11, 13, 13, 15, 15});\n  AddInputFromArray<float>(TensorShape({2}), {4.0, 4.0});\n  AddInputFromArray<float>(TensorShape({2}), {2.0, 2.0});\n  AddInputFromArray<float>(TensorShape({0}), {});\n  AddInputFromArray<float>(TensorShape({0}), {});\n\n  TF_ASSERT_OK(RunOpKernel());\n\n  Tensor expected(allocator(), DT_FLOAT, TensorShape({1, 1, 6, 2}));\n  test::FillValues<float>(&expected, {-3.86, -3.86, -1.51, -1.51, 0.83, 0.83,\n                                      3.17, 3.17, 5.51, 5.51, 7.86, 7.86});\n  test::ExpectTensorNear<float>(expected, *GetOutput(0), 0.01);\n\n  Tensor expected_mean(allocator(), DT_FLOAT, TensorShape({2}));\n  test::FillValues<float>(&expected_mean, {10, 10});\n  test::ExpectTensorNear<float>(expected_mean, *GetOutput(1), 0.01);\n\n  Tensor expected_variance(allocator(), DT_FLOAT, TensorShape({2}));\n  test::FillValues<float>(&expected_variance, {14.00, 14.00});\n  test::ExpectTensorNear<float>(expected_variance, *GetOutput(2), 0.01);\n}\n\nTEST_F(FusedBatchNormOpTest, Inference) {\n  TF_EXPECT_OK(NodeDefBuilder(\"batch_norm_op\", \"FusedBatchNorm\")\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Attr(\"epsilon\", 0.001)\n                   .Attr(\"is_training\", false)\n                   .Finalize(node_def()));\n  TF_EXPECT_OK(InitOp());\n  AddInputFromArray<float>(TensorShape({1, 1, 6, 2}),\n                           {5, 5, 7, 7, 9, 9, 11, 11, 13, 13, 15, 15});\n  AddInputFromArray<float>(TensorShape({2}), {4.0, 4.0});\n  AddInputFromArray<float>(TensorShape({2}), {2.0, 2.0});\n  AddInputFromArray<float>(TensorShape({2}), {10, 10});\n  AddInputFromArray<float>(TensorShape({2}), {11.67f, 11.67f});\n\n  TF_ASSERT_OK(RunOpKernel());\n\n  Tensor expected(allocator(), DT_FLOAT, TensorShape({1, 1, 6, 2}));\n  test::FillValues<float>(&expected, {-3.86, -3.86, -1.51, -1.51, 0.83, 0.83,\n                                      3.17, 3.17, 5.51, 5.51, 7.86, 7.86});\n  test::ExpectTensorNear<float>(expected, *GetOutput(0), 0.01);\n}\n\nclass FusedBatchNormGradOpTest : public OpsTestBase {};\n\nTEST_F(FusedBatchNormGradOpTest, Simple) {\n  TF_EXPECT_OK(NodeDefBuilder(\"batch_norm_grad_op\", \"FusedBatchNormGrad\")\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Input(FakeInput(DT_FLOAT))\n                   .Attr(\"epsilon\", 0.001)\n                   .Finalize(node_def()));\n  TF_EXPECT_OK(InitOp());\n  AddInputFromArray<float>(TensorShape({1, 1, 6, 2}),\n                           {2, 2, 9, 9, -4, -4, 5, 5, 8, 8, 7, 7});\n  AddInputFromArray<float>(TensorShape({1, 1, 6, 2}),\n                           {1, 1, 7, 7, 4, 4, -3, -3, -11, -11, 13, 13});\n  AddInputFromArray<float>(TensorShape({2}), {4, 4});\n  AddInputFromArray<float>(TensorShape({2}), {1.833f, 1.833f});\n  AddInputFromArray<float>(TensorShape({2}), {57.472f, 57.472f});\n\n  TF_ASSERT_OK(RunOpKernel());\n\n  Tensor expected_x(allocator(), DT_FLOAT, TensorShape({1, 1, 6, 2}));\n  test::FillValues<float>(&expected_x, {-1.34, -1.34, 2.47, 2.47, -4.44, -4.44,\n                                        0.17, 0.17, 1.60, 1.60, 1.53, 1.53});\n  test::ExpectTensorNear<float>(expected_x, *GetOutput(0), 0.01);\n\n  Tensor expected_scale(allocator(), DT_FLOAT, TensorShape({2}));\n  test::FillValues<float>(&expected_scale, {-1.6488, -1.6488});\n  test::ExpectTensorNear<float>(expected_scale, *GetOutput(1), 0.01);\n\n  Tensor expected_offset(allocator(), DT_FLOAT, TensorShape({2}));\n  test::FillValues<float>(&expected_offset, {27, 27});\n  test::ExpectTensorNear<float>(expected_offset, *GetOutput(2), 0.01);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/ Performance benchmarks are below.                                          \/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nusing fp32 = float;\nusing fp16 = Eigen::half;\n\ntemplate <typename T>\nstatic Graph* FusedBatchNormInference(int n, int h, int w, int c,\n                                      bool is_training,\n                                      TensorFormat data_format) {\n  Graph* g = new Graph(OpRegistry::Global());\n\n  DataType dtype = DataTypeToEnum<T>::value;\n  Tensor x_t(dtype, data_format == FORMAT_NHWC ? TensorShape({n, h, w, c})\n                                               : TensorShape({n, c, h, w}));\n  x_t.flat<T>().setRandom();\n\n  Tensor other_t(DT_FLOAT, TensorShape({c}));\n  other_t.flat<float>().setRandom();\n\n  Tensor empty_t(DT_FLOAT, TensorShape({0}));\n\n  Node* x = test::graph::Constant(g, x_t, \"x\");\n  Node* other = test::graph::Constant(g, other_t, \"other\");\n  Node* empty = test::graph::Constant(g, empty_t, \"empty\");\n\n  Node* fused_batch_norm;\n  TF_CHECK_OK(NodeBuilder(g->NewName(\"fused_batch_norm\"), \"FusedBatchNormV2\")\n                  .Input(x)\n                  .Input(other)                        \/\/ scale\n                  .Input(other)                        \/\/ offset\n                  .Input(is_training ? empty : other)  \/\/ mean\n                  .Input(is_training ? empty : other)  \/\/ variance\n                  .Attr(\"T\", dtype)\n                  .Attr(\"U\", DT_FLOAT)\n                  .Attr(\"epsilon\", 0.001)\n                  .Attr(\"is_training\", is_training)\n                  .Attr(\"data_format\", ToString(data_format))\n                  .Finalize(g, &fused_batch_norm));\n\n  return g;\n}\n\ntemplate <typename T>\nstatic Graph* FusedBatchNormGrad(int n, int h, int w, int c, bool is_training,\n                                 TensorFormat data_format) {\n  Graph* g = new Graph(OpRegistry::Global());\n\n  DataType dtype = DataTypeToEnum<T>::value;\n  TensorShape shape = data_format == FORMAT_NHWC ? TensorShape({n, h, w, c})\n                                                 : TensorShape({n, c, h, w});\n\n  Tensor y_backprop_t(dtype, shape);\n  y_backprop_t.flat<T>().setRandom();\n\n  Tensor x_t(dtype, shape);\n  x_t.flat<T>().setRandom();\n\n  Tensor other_t(DT_FLOAT, TensorShape({c}));\n  other_t.flat<float>().setRandom();\n\n  Node* y_backprop = test::graph::Constant(g, y_backprop_t, \"y_backprop\");\n  Node* x = test::graph::Constant(g, x_t, \"x\");\n  Node* other = test::graph::Constant(g, other_t, \"other\");\n\n  Node* fused_batch_norm;\n  TF_CHECK_OK(\n      NodeBuilder(g->NewName(\"fused_batch_norm_grad\"), \"FusedBatchNormGradV2\")\n          .Input(y_backprop)\n          .Input(x)\n          .Input(other)  \/\/ scale\n          .Input(other)  \/\/ saved_mean_or_pop_mean\n          .Input(other)  \/\/ saved_maybe_inv_var_or_pop_var\n          .Attr(\"T\", dtype)\n          .Attr(\"U\", DT_FLOAT)\n          .Attr(\"epsilon\", 0.001)\n          .Attr(\"is_training\", is_training)\n          .Attr(\"data_format\", ToString(data_format))\n          .Finalize(g, &fused_batch_norm));\n\n  return g;\n}\n\n#define BM_NAME(NAME, N, H, W, C, T, IT, FORMAT, DEVICE) \\\n  BM_##NAME##_##N##_##H##_##W##_##C##_##IT##_##FORMAT##_##T##_##DEVICE\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\/\/ FusedBatchNorm inference\n\/\/ -------------------------------------------------------------------------- \/\/\n\n#define BM_FusedBatchNorm(N, H, W, C, T, IS_TRAINING, FORMAT, DEVICE)       \\\n  static void BM_NAME(FusedBatchNorm, N, H, W, C, T, IS_TRAINING, FORMAT,   \\\n                      DEVICE)(int iters) {                                  \\\n    testing::UseRealTime();                                                 \\\n    testing::ItemsProcessed(static_cast<int64>(iters) * N * H * W * C);     \\\n    test::Benchmark(#DEVICE, FusedBatchNormInference<T>(                    \\\n                                 N, H, W, C, IS_TRAINING, FORMAT_##FORMAT)) \\\n        .Run(iters);                                                        \\\n  }                                                                         \\\n  BENCHMARK(                                                                \\\n      BM_NAME(FusedBatchNorm, N, H, W, C, T, IS_TRAINING, FORMAT, DEVICE));\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, false, NHWC, cpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, false, NHWC, cpu);\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, true, NHWC, cpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, true, NHWC, cpu);\n\n#ifdef GOOGLE_CUDA\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, false, NHWC, gpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, false, NHWC, gpu);\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, false, NCHW, gpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, false, NCHW, gpu);\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, true, NHWC, gpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, true, NHWC, gpu);\n\nBM_FusedBatchNorm(64, 14, 14, 256, fp32, true, NCHW, gpu);\nBM_FusedBatchNorm(64, 14, 14, 256, fp16, true, NCHW, gpu);\n#endif  \/\/ GOOGLE_CUDA\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\/\/ FusedBatchNorm gradient\n\/\/ -------------------------------------------------------------------------- \/\/\n\n#define BM_FusedBatchNormGrad(N, H, W, C, T, IS_TRAINING, FORMAT, DEVICE)     \\\n  static void BM_NAME(FusedBatchNormGrad, N, H, W, C, T, IS_TRAINING, FORMAT, \\\n                      DEVICE)(int iters) {                                    \\\n    testing::UseRealTime();                                                   \\\n    testing::ItemsProcessed(static_cast<int64>(iters) * N * H * W * C);       \\\n    test::Benchmark(#DEVICE, FusedBatchNormGrad<T>(N, H, W, C, IS_TRAINING,   \\\n                                                   FORMAT_##FORMAT))          \\\n        .Run(iters);                                                          \\\n  }                                                                           \\\n  BENCHMARK(BM_NAME(FusedBatchNormGrad, N, H, W, C, T, IS_TRAINING, FORMAT,   \\\n                    DEVICE));\n\n#ifdef GOOGLE_CUDA\nBM_FusedBatchNormGrad(64, 14, 14, 256, fp32, true, NHWC, gpu);\nBM_FusedBatchNormGrad(64, 14, 14, 256, fp16, true, NHWC, gpu);\n\nBM_FusedBatchNormGrad(64, 14, 14, 256, fp32, true, NCHW, gpu);\nBM_FusedBatchNormGrad(64, 14, 14, 256, fp16, true, NCHW, gpu);\n#endif  \/\/ GOOGLE_CUDA\n\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2019 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#include \"tensorflow\/lite\/tools\/optimize\/operator_property.h\"\n\n#include \"tensorflow\/lite\/schema\/schema_generated.h\"\n\nnamespace tflite {\nnamespace optimize {\nnamespace operator_property {\n\nnamespace {\n\n\/\/ The op as well as it variants.\n\/\/ TODO(jianlijianli): extend it to support ops that has multiple variants.\nstruct OpVariant {\n  BuiltinOperator op_code;\n};\n\nconst OpVariant GetOperatorVariant(const ModelT* model, int subgraph_index,\n                                   int op_index) {\n  OpVariant op_signature;\n  OperatorT* op =\n      model->subgraphs.at(subgraph_index)->operators[op_index].get();\n  op_signature.op_code = model->operator_codes[op->opcode_index]->builtin_code;\n  return op_signature;\n}\n}  \/\/ namespace\n\nOperatorProperty GetOperatorProperty(const ModelT* model, int subgraph_index,\n                                     int op_index) {\n  OpVariant op_signature = GetOperatorVariant(model, subgraph_index, op_index);\n  BuiltinOperator op_code = op_signature.op_code;\n  OperatorProperty property;\n  switch (op_code) {\n    case BuiltinOperator_ADD:\n      property.inputs = {{0, {}}, {1, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_ARG_MAX:\n      property.inputs = {{0, {}}};\n      \/\/ ArgMax has no quantizable output.\n      property.version = 2;\n      break;\n    case BuiltinOperator_AVERAGE_POOL_2D:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_BATCH_TO_SPACE_ND:\n    case BuiltinOperator_SPACE_TO_BATCH_ND:\n    case BuiltinOperator_SPACE_TO_DEPTH:\n      \/\/ We skip inputs 1 and 2 since they aren't real valued (they are shapes).\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_SPLIT:\n      property.arbitrary_outputs = true;\n      \/\/ We skip input 0 since it is the split dim which is not real valued.\n      property.inputs = {{1, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_CONCATENATION:\n      property.arbitrary_inputs = true;\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_CONV_2D: {\n      TensorProperty tensor_property;\n      tensor_property.per_axis = true;\n      tensor_property.per_axis_index = 0;\n      tensor_property.symmetric = true;\n      property.inputs = {{0, {}}, {1, tensor_property}};\n      property.outputs = {{0, {}}};\n      property.biases = {2};\n      property.version = 3;\n      break;\n    }\n    case BuiltinOperator_DEPTHWISE_CONV_2D: {\n      TensorProperty tensor_property;\n      tensor_property.per_axis = true;\n      tensor_property.per_axis_index = 3;\n      tensor_property.symmetric = true;\n      property.inputs = {\n          {0, {}},\n          {1, tensor_property},\n      };\n      property.outputs = {{0, {}}};\n      property.biases = {2};\n      property.version = 3;\n      break;\n    }\n    case BuiltinOperator_EQUAL:\n    case BuiltinOperator_NOT_EQUAL:\n    case BuiltinOperator_GREATER:\n    case BuiltinOperator_GREATER_EQUAL:\n    case BuiltinOperator_LESS:\n    case BuiltinOperator_LESS_EQUAL:\n      property.inputs = {{0, {}}, {1, {}}};\n      \/\/ Comparisons have no quantizable outputs.\n      property.version = 2;\n      break;\n    case BuiltinOperator_EXPAND_DIMS:\n      \/\/ We skip input 1 as it is not real valued (it's the index of axis) and\n      \/\/ hence does not need to be quantized.\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 1;\n      break;\n    case BuiltinOperator_FULLY_CONNECTED: {\n      TensorProperty tensor_property;\n      tensor_property.symmetric = true;\n      property.inputs = {{0, {}}, {1, tensor_property}};\n      property.outputs = {{0, {}}};\n      property.biases = {2};\n      property.version = 4;\n      break;\n    }\n    case BuiltinOperator_GATHER:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_HARD_SWISH: {\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 1;\n      break;\n    }\n    case BuiltinOperator_LOG_SOFTMAX: {\n      property.inputs = {{0, {}}};\n      \/\/ LogSoftmax requires output with 16\/256 as scale and 127 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {16.0 \/ 256.0, 127};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_LOGISTIC: {\n      property.inputs = {{0, {}}};\n      \/\/ Logistic requires output with 1\/256 as scale and -128 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {1 \/ 256.0, -128};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_L2_NORMALIZATION: {\n      property.inputs = {{0, {}}};\n      \/\/ L2 Norm requires output with 1\/128 as scale and 0 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {1 \/ 128.0, 0};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_MAX_POOL_2D:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_MAXIMUM:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_MEAN:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_MINIMUM:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_MUL:\n      property.inputs = {{0, {}}, {1, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_PAD:\n    case BuiltinOperator_PADV2:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_QUANTIZE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_RELU:\n    case BuiltinOperator_RELU6:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_RELU_N1_TO_1:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 1;\n      break;\n    case BuiltinOperator_RESHAPE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 1;\n      break;\n    case BuiltinOperator_RESIZE_BILINEAR:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_SHAPE:\n      property.inputs = {{0, {}}};\n      \/\/ Shape has no quantizable output.\n      property.version = 1;\n      break;\n    case BuiltinOperator_SLICE:\n      \/\/ We skip inputs 1 and 2 since they aren't real valued (they are the\n      \/\/ index and size).\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_SQUEEZE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 1;\n      break;\n    case BuiltinOperator_SOFTMAX: {\n      property.inputs = {{0, {}}};\n      \/\/ Softmax requires output with 1\/256 as scale and -128 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {1 \/ 256.0, -128};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_STRIDED_SLICE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_SUB:\n      property.inputs = {{0, {}}, {1, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_SUM:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_TANH: {\n      property.inputs = {{0, {}}};\n      \/\/ Tanh requires output with 1\/128 as scale and 0 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {1 \/ 128.0, 0};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_TRANSPOSE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_RESIZE_NEAREST_NEIGHBOR:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    default:\n      \/\/ No quantized implementation exists for this operation.\n      property.quantizable = false;\n  }\n  return property;\n}\n\n}  \/\/ namespace operator_property\n}  \/\/ namespace optimize\n}  \/\/ namespace tflite\n<commit_msg>Add LSTM to op spec. This CL only adds the intermediates fields for one variants of LSTM.<commit_after>\/* Copyright 2019 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#include \"tensorflow\/lite\/tools\/optimize\/operator_property.h\"\n\n#include \"tensorflow\/lite\/schema\/schema_generated.h\"\n\nnamespace tflite {\nnamespace optimize {\nnamespace operator_property {\n\nnamespace {\n\n\/\/ The op as well as it variants.\n\/\/ TODO(jianlijianli): extend it to support ops that has multiple variants.\nstruct OpVariant {\n  BuiltinOperator op_code;\n};\n\nconst OpVariant GetOperatorVariant(const ModelT* model, int subgraph_index,\n                                   int op_index) {\n  OpVariant op_signature;\n  OperatorT* op =\n      model->subgraphs.at(subgraph_index)->operators[op_index].get();\n  op_signature.op_code = model->operator_codes[op->opcode_index]->builtin_code;\n  return op_signature;\n}\n}  \/\/ namespace\n\nOperatorProperty GetOperatorProperty(const ModelT* model, int subgraph_index,\n                                     int op_index) {\n  OpVariant op_signature = GetOperatorVariant(model, subgraph_index, op_index);\n  BuiltinOperator op_code = op_signature.op_code;\n  OperatorProperty property;\n  switch (op_code) {\n    case BuiltinOperator_ADD:\n      property.inputs = {{0, {}}, {1, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_ARG_MAX:\n      property.inputs = {{0, {}}};\n      \/\/ ArgMax has no quantizable output.\n      property.version = 2;\n      break;\n    case BuiltinOperator_AVERAGE_POOL_2D:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_BATCH_TO_SPACE_ND:\n    case BuiltinOperator_SPACE_TO_BATCH_ND:\n    case BuiltinOperator_SPACE_TO_DEPTH:\n      \/\/ We skip inputs 1 and 2 since they aren't real valued (they are shapes).\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_SPLIT:\n      property.arbitrary_outputs = true;\n      \/\/ We skip input 0 since it is the split dim which is not real valued.\n      property.inputs = {{1, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_CONCATENATION:\n      property.arbitrary_inputs = true;\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_CONV_2D: {\n      TensorProperty tensor_property;\n      tensor_property.per_axis = true;\n      tensor_property.per_axis_index = 0;\n      tensor_property.symmetric = true;\n      property.inputs = {{0, {}}, {1, tensor_property}};\n      property.outputs = {{0, {}}};\n      property.biases = {2};\n      property.version = 3;\n      break;\n    }\n    case BuiltinOperator_DEPTHWISE_CONV_2D: {\n      TensorProperty tensor_property;\n      tensor_property.per_axis = true;\n      tensor_property.per_axis_index = 3;\n      tensor_property.symmetric = true;\n      property.inputs = {\n          {0, {}},\n          {1, tensor_property},\n      };\n      property.outputs = {{0, {}}};\n      property.biases = {2};\n      property.version = 3;\n      break;\n    }\n    case BuiltinOperator_EQUAL:\n    case BuiltinOperator_NOT_EQUAL:\n    case BuiltinOperator_GREATER:\n    case BuiltinOperator_GREATER_EQUAL:\n    case BuiltinOperator_LESS:\n    case BuiltinOperator_LESS_EQUAL:\n      property.inputs = {{0, {}}, {1, {}}};\n      \/\/ Comparisons have no quantizable outputs.\n      property.version = 2;\n      break;\n    case BuiltinOperator_EXPAND_DIMS:\n      \/\/ We skip input 1 as it is not real valued (it's the index of axis) and\n      \/\/ hence does not need to be quantized.\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 1;\n      break;\n    case BuiltinOperator_FULLY_CONNECTED: {\n      TensorProperty tensor_property;\n      tensor_property.symmetric = true;\n      property.inputs = {{0, {}}, {1, tensor_property}};\n      property.outputs = {{0, {}}};\n      property.biases = {2};\n      property.version = 4;\n      break;\n    }\n    case BuiltinOperator_GATHER:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_HARD_SWISH: {\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 1;\n      break;\n    }\n    case BuiltinOperator_LOG_SOFTMAX: {\n      property.inputs = {{0, {}}};\n      \/\/ LogSoftmax requires output with 16\/256 as scale and 127 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {16.0 \/ 256.0, 127};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_LOGISTIC: {\n      property.inputs = {{0, {}}};\n      \/\/ Logistic requires output with 1\/256 as scale and -128 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {1 \/ 256.0, -128};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_LSTM: {\n      \/\/ TODO(jianlijianli): extend LSTM op spec to inlucde input, bias etc.\n      \/\/ TODO(jianlijianli): extend this to other variants of LSTM.\n      \/\/ LSTM need 5 intermediate tensors. This agrees with the fully quantized\n      \/\/ kernels in lstm_eval.cc\n      property.intermediates = {{0, {}}, {1, {}}, {2, {}}, {3, {}}, {4, {}}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_L2_NORMALIZATION: {\n      property.inputs = {{0, {}}};\n      \/\/ L2 Norm requires output with 1\/128 as scale and 0 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {1 \/ 128.0, 0};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_MAX_POOL_2D:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_MAXIMUM:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_MEAN:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_MINIMUM:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_MUL:\n      property.inputs = {{0, {}}, {1, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_PAD:\n    case BuiltinOperator_PADV2:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_QUANTIZE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_RELU:\n    case BuiltinOperator_RELU6:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_RELU_N1_TO_1:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 1;\n      break;\n    case BuiltinOperator_RESHAPE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 1;\n      break;\n    case BuiltinOperator_RESIZE_BILINEAR:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_SHAPE:\n      property.inputs = {{0, {}}};\n      \/\/ Shape has no quantizable output.\n      property.version = 1;\n      break;\n    case BuiltinOperator_SLICE:\n      \/\/ We skip inputs 1 and 2 since they aren't real valued (they are the\n      \/\/ index and size).\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_SQUEEZE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 1;\n      break;\n    case BuiltinOperator_SOFTMAX: {\n      property.inputs = {{0, {}}};\n      \/\/ Softmax requires output with 1\/256 as scale and -128 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {1 \/ 256.0, -128};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_STRIDED_SLICE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_SUB:\n      property.inputs = {{0, {}}, {1, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_SUM:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.version = 2;\n      break;\n    case BuiltinOperator_TANH: {\n      property.inputs = {{0, {}}};\n      \/\/ Tanh requires output with 1\/128 as scale and 0 as zero point.\n      TensorProperty tensor_property;\n      tensor_property.restriction = true;\n      tensor_property.restricted_value = {1 \/ 128.0, 0};\n      property.outputs = {{0, tensor_property}};\n      property.version = 2;\n      break;\n    }\n    case BuiltinOperator_TRANSPOSE:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    case BuiltinOperator_RESIZE_NEAREST_NEIGHBOR:\n      property.inputs = {{0, {}}};\n      property.outputs = {{0, {}}};\n      property.restrict_same_input_output_scale = true;\n      property.version = 2;\n      break;\n    default:\n      \/\/ No quantized implementation exists for this operation.\n      property.quantizable = false;\n  }\n  return property;\n}\n\n}  \/\/ namespace operator_property\n}  \/\/ namespace optimize\n}  \/\/ namespace tflite\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file   segmented_pi_table.cpp\n\/\/\/ @brief  Test the SegmentedPiTable class\n\/\/\/\n\/\/\/ Copyright (C) 2021 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 <PiTable.hpp>\n#include <SegmentedPiTable.hpp>\n#include <imath.hpp>\n\n#include <stdint.h>\n#include <iostream>\n#include <cstdlib>\n#include <random>\n\nusing namespace std;\nusing namespace primecount;\n\nvoid check(bool OK)\n{\n  cout << \"   \" << (OK ? \"OK\" : \"ERROR\") << \"\\n\";\n  if (!OK)\n    exit(1);\n}\n\nint main()\n{\n  random_device rd;\n  mt19937 gen(rd());\n  uniform_int_distribution<int> dist(90000000, 100000000);\n  uniform_int_distribution<int> dist2(1, 1000);\n\n  int64_t limit = dist(gen);\n  int64_t segment_size = iroot<3>(limit);\n  segment_size += 240 - segment_size % 240;\n  int threads = 1;\n\n  PiTable pi(limit, threads);\n  SegmentedPiTable segmentedPi;\n\n  int64_t i = 0;\n  int64_t low = 0;\n  int64_t high = segment_size;\n  segmentedPi.init(low, high); \n\n  \/\/ Check small pi(x) values\n  for (; i <= 1000; i++)\n  {\n    while (i >= high)\n    {\n      low = high;\n      high = low + segment_size;\n      segmentedPi.init(low, high);\n    }\n\n    cout << \"segmentedPi(\" << i << \") = \" << segmentedPi[i];\n    check(segmentedPi[i] == pi[i]);\n  }\n\n  \/\/ Check large pi(x) values\n  for (; i < limit; i += dist2(gen))\n  {\n    while (i >= high)\n    {\n      low = high;\n      high = low + segment_size;\n      segmentedPi.init(low, high);\n    }\n\n    cout << \"segmentedPi(\" << i << \") = \" << segmentedPi[i];\n    check(segmentedPi[i] == pi[i]);\n  }\n\n  while (limit > high)\n  {\n    low = high;\n    high = low + segment_size;\n    segmentedPi.init(low, high);\n  }\n\n  \/\/ Check max pi(x) value.\n  \/\/ PiTable can lookup numbers <= limit.\n  \/\/ SegmentedPiTable can lookup numbers < limit.\n  cout << \"segmentedPi(\" << limit-1 << \") = \" << segmentedPi[limit-1];\n  check(segmentedPi[limit-1] == pi[limit-1]);\n\n  cout << endl;\n  cout << \"All tests passed successfully!\" << endl;\n\n  return 0;\n}\n<commit_msg>Reduce number of tests<commit_after>\/\/\/\n\/\/\/ @file   segmented_pi_table.cpp\n\/\/\/ @brief  Test the SegmentedPiTable class\n\/\/\/\n\/\/\/ Copyright (C) 2021 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 <PiTable.hpp>\n#include <SegmentedPiTable.hpp>\n#include <imath.hpp>\n\n#include <stdint.h>\n#include <iostream>\n#include <cstdlib>\n#include <random>\n\nusing namespace std;\nusing namespace primecount;\n\nvoid check(bool OK)\n{\n  cout << \"   \" << (OK ? \"OK\" : \"ERROR\") << \"\\n\";\n  if (!OK)\n    exit(1);\n}\n\nint main()\n{\n  random_device rd;\n  mt19937 gen(rd());\n  uniform_int_distribution<int> dist(9000000, 10000000);\n  uniform_int_distribution<int> dist2(1, 1000);\n\n  int64_t limit = dist(gen);\n  int64_t segment_size = isqrt(limit);\n  segment_size += 240 - segment_size % 240;\n  int threads = 1;\n\n  PiTable pi(limit, threads);\n  SegmentedPiTable segmentedPi;\n\n  int64_t i = 0;\n  int64_t low = 0;\n  int64_t high = segment_size;\n  segmentedPi.init(low, high); \n\n  \/\/ Check small pi(x) values\n  for (; i <= 1000; i++)\n  {\n    while (high <= i)\n    {\n      low = high;\n      high = low + segment_size;\n      segmentedPi.init(low, high);\n    }\n\n    cout << \"segmentedPi(\" << i << \") = \" << segmentedPi[i];\n    check(segmentedPi[i] == pi[i]);\n  }\n\n  \/\/ Check large pi(x) values\n  for (; i < limit; i += dist2(gen))\n  {\n    while (high <= i)\n    {\n      low = high;\n      high = low + segment_size;\n      segmentedPi.init(low, high);\n    }\n\n    cout << \"segmentedPi(\" << i << \") = \" << segmentedPi[i];\n    check(segmentedPi[i] == pi[i]);\n  }\n\n  while (high < limit)\n  {\n    low = high;\n    high = low + segment_size;\n    segmentedPi.init(low, high);\n  }\n\n  \/\/ Check max pi(x) value.\n  \/\/ PiTable can lookup numbers <= limit.\n  \/\/ SegmentedPiTable can lookup numbers < limit.\n  cout << \"segmentedPi(\" << limit-1 << \") = \" << segmentedPi[limit-1];\n  check(segmentedPi[limit-1] == pi[limit-1]);\n\n  cout << endl;\n  cout << \"All tests passed successfully!\" << endl;\n\n  return 0;\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_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_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\/renderer_host\/render_view_host_observer.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/gfx\/size.h\"\n#include \"views\/desktop\/desktop_window_view.h\"\n#include \"views\/widget\/widget.h\"\n\n#if defined(TOOLKIT_USES_GTK)\n#include \"chrome\/browser\/chromeos\/wm_ipc.h\"\n#include \"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\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 RenderViewHostObserver {\n public:\n  SnifferObserver(RenderViewHost* host, WebUI* webui)\n      : 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_[views::Accelerator(ui::VKEY_Z, false, true, true)] =\n      kAccelNameAccessibility;\n  accel_map_[views::Accelerator(ui::VKEY_ESCAPE, false, false, false)] =\n      kAccelNameCancel;\n  accel_map_[views::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 views::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      &params);\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::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 == StatusAreaViewChromeos::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 == StatusAreaViewChromeos::SHOW_NETWORK_OPTIONS) {\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\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\n\/\/ Overridden from LoginHtmlDialog::Delegate:\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\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  \/\/ In aura there's a global status area shown already.\n  \/\/ TODO(nkostylev): Figure out how to communicate from login screen with\n  \/\/ global status area.\n#if !defined(USE_AURA)\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 or views-desktop environment, there will be no window-manager. So\n  \/\/ chrome needs to emit the 'login-prompt-visible' signal. This needs to\n  \/\/ happen here, after the page has completed rendering itself.\n#if defined(USE_AURA)\n  emit_login_visible = true;\n#else\n  if (views::desktop::DesktopWindowView::desktop_window_view)\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  status_area_ = new StatusAreaViewChromeos();\n  status_area_->Init(this, StatusAreaViewChromeos::LOGIN_MODE_WEBUI);\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#if defined(TOUCH_UI)\n  views::Widget::InitParams widget_params(\n      views::Widget::InitParams::TYPE_CONTROL);\n#else\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#endif\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.\n  WebUI* web_ui = GetWebUI();\n  if (web_ui)\n    web_ui->CallJavascriptFunction(\"cr.ui.Oobe.clearErrors\");\n}\n\n}  \/\/ namespace chromeos\n<commit_msg>Only clear Oobe errors on KeyDown to prevent clearing an immediate authentication error.<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_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_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\/renderer_host\/render_view_host_observer.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/gfx\/size.h\"\n#include \"views\/desktop\/desktop_window_view.h\"\n#include \"views\/widget\/widget.h\"\n\n#if defined(TOOLKIT_USES_GTK)\n#include \"chrome\/browser\/chromeos\/wm_ipc.h\"\n#include \"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\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 RenderViewHostObserver {\n public:\n  SnifferObserver(RenderViewHost* host, WebUI* webui)\n      : 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_[views::Accelerator(ui::VKEY_Z, false, true, true)] =\n      kAccelNameAccessibility;\n  accel_map_[views::Accelerator(ui::VKEY_ESCAPE, false, false, false)] =\n      kAccelNameCancel;\n  accel_map_[views::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 views::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      &params);\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::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 == StatusAreaViewChromeos::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 == StatusAreaViewChromeos::SHOW_NETWORK_OPTIONS) {\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\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\n\/\/ Overridden from LoginHtmlDialog::Delegate:\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\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  \/\/ In aura there's a global status area shown already.\n  \/\/ TODO(nkostylev): Figure out how to communicate from login screen with\n  \/\/ global status area.\n#if !defined(USE_AURA)\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 or views-desktop environment, there will be no window-manager. So\n  \/\/ chrome needs to emit the 'login-prompt-visible' signal. This needs to\n  \/\/ happen here, after the page has completed rendering itself.\n#if defined(USE_AURA)\n  emit_login_visible = true;\n#else\n  if (views::desktop::DesktopWindowView::desktop_window_view)\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  status_area_ = new StatusAreaViewChromeos();\n  status_area_->Init(this, StatusAreaViewChromeos::LOGIN_MODE_WEBUI);\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#if defined(TOUCH_UI)\n  views::Widget::InitParams widget_params(\n      views::Widget::InitParams::TYPE_CONTROL);\n#else\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#endif\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>\/*\n * Copyright 2018 Blender 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\/* This is taken from alShaders\/Cryptomatte\/MurmurHash3.h:\n *\n * MurmurHash3 was written by Austin Appleby, and is placed in the public\n * domain. The author hereby disclaims copyright to this source code.\n *\n *\/\n\n#include \"util\/util_algorithm.h\"\n#include \"util\/util_murmurhash.h\"\n\n#if defined(_MSC_VER)\n#  include <stdlib.h>\n#  define ROTL32(x,y)\t_rotl(x,y)\n#  define ROTL64(x,y)\t_rotl64(x,y)\n#  define BIG_CONSTANT(x) (x)\n#else\nccl_device_inline uint32_t rotl32(uint32_t x, int8_t r)\n{\n\treturn (x << r) | (x >> (32 - r));\n}\n#  define\tROTL32(x,y)\trotl32(x,y)\n#  define BIG_CONSTANT(x) (x##LLU)\n#endif\n\nCCL_NAMESPACE_BEGIN\n\n\/* Block read - if your platform needs to do endian-swapping or can only\n * handle aligned reads, do the conversion here. *\/\nccl_device_inline uint32_t mm_hash_getblock32(const uint32_t *p, int i)\n{\n\treturn p[i];\n}\n\n\/* Finalization mix - force all bits of a hash block to avalanche *\/\nccl_device_inline uint32_t mm_hash_fmix32 ( uint32_t h )\n{\n\th ^= h >> 16;\n\th *= 0x85ebca6b;\n\th ^= h >> 13;\n\th *= 0xc2b2ae35;\n\th ^= h >> 16;\n\treturn h;\n}\n\nuint32_t util_murmur_hash3(const void *key, int len, uint32_t seed)\n{\n\tconst uint8_t * data = (const uint8_t*)key;\n\tconst int nblocks = len \/ 4;\n\n\tuint32_t h1 = seed;\n\n\tconst uint32_t c1 = 0xcc9e2d51;\n\tconst uint32_t c2 = 0x1b873593;\n\n\tconst uint32_t * blocks = (const uint32_t *)(data + nblocks*4);\n\n\tfor(int i = -nblocks; i; i++) {\n\t\tuint32_t k1 = mm_hash_getblock32(blocks,i);\n\n\t\tk1 *= c1;\n\t\tk1 = ROTL32(k1,15);\n\t\tk1 *= c2;\n\n\t\th1 ^= k1;\n\t\th1 = ROTL32(h1,13);\n\t\th1 = h1 * 5 + 0xe6546b64;\n\t}\n\n\tconst uint8_t *tail = (const uint8_t*)(data + nblocks*4);\n\n\tuint32_t k1 = 0;\n\n\tswitch(len & 3) {\n\t\tcase 3:\n\t\t\tk1 ^= tail[2] << 16;\n\t\t\tATTR_FALLTHROUGH;\n\t\tcase 2:\n\t\t\tk1 ^= tail[1] << 8;\n\t\t\tATTR_FALLTHROUGH;\n\t\tcase 1:\n\t\t\tk1 ^= tail[0];\n\t\t\tk1 *= c1;\n\t\t\tk1 = ROTL32(k1,15);\n\t\t\tk1 *= c2;\n\t\t\th1 ^= k1;\n\t}\n\n\th1 ^= len;\n\th1 = mm_hash_fmix32(h1);\n\treturn h1;\n}\n\n\/* This is taken from the cryptomatte specification 1.0 *\/\nfloat util_hash_to_float(uint32_t hash)\n{\n\tuint32_t mantissa = hash & (( 1 << 23) - 1);\n\tuint32_t exponent = (hash >> 23) & ((1 << 8) - 1);\n\texponent = max(exponent, (uint32_t) 1);\n\texponent = min(exponent, (uint32_t) 254);\n\texponent = exponent << 23;\n\tuint32_t sign = (hash >> 31);\n\tsign = sign << 31;\n\tuint32_t float_bits = sign | exponent | mantissa;\n\tfloat f;\n\tmemcpy(&f, &float_bits, sizeof(uint32_t));\n\treturn f;\n}\n\nCCL_NAMESPACE_END\n<commit_msg>Fix Linux build after Cryptomatte commit<commit_after>\/*\n * Copyright 2018 Blender 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\/* This is taken from alShaders\/Cryptomatte\/MurmurHash3.h:\n *\n * MurmurHash3 was written by Austin Appleby, and is placed in the public\n * domain. The author hereby disclaims copyright to this source code.\n *\n *\/\n\n#include <stdlib.h>\n#include <string.h>\n\n#include \"util\/util_algorithm.h\"\n#include \"util\/util_murmurhash.h\"\n\n#if defined(_MSC_VER)\n#  define ROTL32(x,y) _rotl(x,y)\n#  define ROTL64(x,y) _rotl64(x,y)\n#  define BIG_CONSTANT(x) (x)\n#else\nccl_device_inline uint32_t rotl32(uint32_t x, int8_t r)\n{\n\treturn (x << r) | (x >> (32 - r));\n}\n#  define ROTL32(x,y) rotl32(x,y)\n#  define BIG_CONSTANT(x) (x##LLU)\n#endif\n\nCCL_NAMESPACE_BEGIN\n\n\/* Block read - if your platform needs to do endian-swapping or can only\n * handle aligned reads, do the conversion here. *\/\nccl_device_inline uint32_t mm_hash_getblock32(const uint32_t *p, int i)\n{\n\treturn p[i];\n}\n\n\/* Finalization mix - force all bits of a hash block to avalanche *\/\nccl_device_inline uint32_t mm_hash_fmix32 ( uint32_t h )\n{\n\th ^= h >> 16;\n\th *= 0x85ebca6b;\n\th ^= h >> 13;\n\th *= 0xc2b2ae35;\n\th ^= h >> 16;\n\treturn h;\n}\n\nuint32_t util_murmur_hash3(const void *key, int len, uint32_t seed)\n{\n\tconst uint8_t * data = (const uint8_t*)key;\n\tconst int nblocks = len \/ 4;\n\n\tuint32_t h1 = seed;\n\n\tconst uint32_t c1 = 0xcc9e2d51;\n\tconst uint32_t c2 = 0x1b873593;\n\n\tconst uint32_t * blocks = (const uint32_t *)(data + nblocks*4);\n\n\tfor(int i = -nblocks; i; i++) {\n\t\tuint32_t k1 = mm_hash_getblock32(blocks,i);\n\n\t\tk1 *= c1;\n\t\tk1 = ROTL32(k1,15);\n\t\tk1 *= c2;\n\n\t\th1 ^= k1;\n\t\th1 = ROTL32(h1,13);\n\t\th1 = h1 * 5 + 0xe6546b64;\n\t}\n\n\tconst uint8_t *tail = (const uint8_t*)(data + nblocks*4);\n\n\tuint32_t k1 = 0;\n\n\tswitch(len & 3) {\n\t\tcase 3:\n\t\t\tk1 ^= tail[2] << 16;\n\t\t\tATTR_FALLTHROUGH;\n\t\tcase 2:\n\t\t\tk1 ^= tail[1] << 8;\n\t\t\tATTR_FALLTHROUGH;\n\t\tcase 1:\n\t\t\tk1 ^= tail[0];\n\t\t\tk1 *= c1;\n\t\t\tk1 = ROTL32(k1,15);\n\t\t\tk1 *= c2;\n\t\t\th1 ^= k1;\n\t}\n\n\th1 ^= len;\n\th1 = mm_hash_fmix32(h1);\n\treturn h1;\n}\n\n\/* This is taken from the cryptomatte specification 1.0 *\/\nfloat util_hash_to_float(uint32_t hash)\n{\n\tuint32_t mantissa = hash & (( 1 << 23) - 1);\n\tuint32_t exponent = (hash >> 23) & ((1 << 8) - 1);\n\texponent = max(exponent, (uint32_t) 1);\n\texponent = min(exponent, (uint32_t) 254);\n\texponent = exponent << 23;\n\tuint32_t sign = (hash >> 31);\n\tsign = sign << 31;\n\tuint32_t float_bits = sign | exponent | mantissa;\n\tfloat f;\n\tmemcpy(&f, &float_bits, sizeof(uint32_t));\n\treturn f;\n}\n\nCCL_NAMESPACE_END\n<|endoftext|>"}
{"text":"<commit_before>#include <config.h>\n#include <assert.h>\n#include <boost\/assert.hpp>\n#include <boost\/multi_array\/multi_array_ref.hpp>\n#include <dune\/common\/exceptions.hh>\n#include <dune\/fem\/misc\/mpimanager.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/common\/profiler.hh>\n#include <dune\/stuff\/common\/ranges.hh>\n#include <dune\/stuff\/common\/float_cmp.hh>\n#include <dune\/stuff\/grid\/structuredgridfactory.hh>\n#include <dune\/stuff\/grid\/information.hh>\n#include <algorithm>\n#include <iterator>\n#include <ostream>\n#include <utility>\n#include <memory>\n#include <dune\/multiscale\/tools\/misc.hh>\n\n#include \"subgrid-list.hh\"\n\nnamespace Dune {\nnamespace Multiscale {\nnamespace MsFEM {\n\nLocalGridList::LocalGridList(const CommonTraits::DiscreteFunctionSpaceType& coarseSpace)\n  : coarseSpace_(coarseSpace)\n  , coarseGridLeafIndexSet_(coarseSpace_.gridPart().grid().leafIndexSet()) {\n  DSC::Profiler::ScopedTiming st(\"msfem.subgrid_list.ctor\");\n  const auto micro_per_macro = DSC_CONFIG_GET(\"msfem.micro_cells_per_macrocell_dim\", 8);\n  const auto oversampling_layer = DSC_CONFIG_GET(\"msfem.oversampling_layers\", 0);\n\n  typedef StructuredGridFactory<LocalGridType> FactoryType;\n  const auto coarse_dimensions = DSG::dimensions<CommonTraits::GridType>(coarseSpace_.gridPart().grid());\n\n  for (const auto& coarse_entity : coarseSpace_) {\n    \/\/ make sure we only create subgrids for interior coarse elements, not\n    \/\/ for overlap or ghost elements\n    assert(coarse_entity.partitionType() == Dune::InteriorEntity);\n    const auto coarse_index = coarseGridLeafIndexSet_.index(coarse_entity);\n    \/\/ make sure we did not create a subgrid for the current coarse entity so far\n    assert(subGridList_.find(coarse_index) == subGridList_.end());\n\n    const auto dimensions = DSG::dimensions<CommonTraits::GridType>(coarse_entity);\n    const int dim_world = LocalGridType::dimensionworld;\n    typedef FieldVector<typename LocalGridType::ctype, dim_world> CoordType;\n    CoordType lowerLeft(0);\n    CoordType upperRight(0);\n    array<unsigned int, dim_world> elemens;\n    for (const auto i : DSC::valueRange(dim_world)) {\n      elemens[i] = micro_per_macro + (2 * oversampling_layer);\n      const auto min = dimensions.coord_limits[i].min();\n      const auto max = dimensions.coord_limits[i].max();\n      const auto coarse_min = coarse_dimensions.coord_limits[i].min();\n      const auto coarse_max = coarse_dimensions.coord_limits[i].max();\n      const auto delta = (max - min) \/ double(micro_per_macro);\n      lowerLeft[i] = std::max(min - (oversampling_layer * delta), coarse_min);\n      upperRight[i] = std::min(max + (oversampling_layer * delta), coarse_max);\n    }\n    subGridList_[coarse_index] = FactoryType::createCubeGrid(lowerLeft, upperRight, elemens);\n  }\n}\n\nMsFEMTraits::LocalGridType& LocalGridList::getSubGrid(IndexType coarseCellIndex) {\n  auto found = subGridList_.find(coarseCellIndex);\n  BOOST_ASSERT_MSG(found != subGridList_.end(), \"There is no subgrid for the index you provided!\");\n  assert(found->second);\n  return *(found->second);\n} \/\/ getSubGrid\n\nconst MsFEMTraits::LocalGridType& LocalGridList::getSubGrid(IndexType coarseCellIndex) const {\n  auto found = subGridList_.find(coarseCellIndex);\n  BOOST_ASSERT_MSG(found != subGridList_.end(), \"There is no subgrid for the index you provided!\");\n  assert(found->second);\n  return *(found->second);\n} \/\/ getSubGrid\n\nconst MsFEMTraits::LocalGridType& LocalGridList::getSubGrid(const CoarseEntityType& entity) const {\n  const auto index = coarseGridLeafIndexSet_.index(entity);\n  return getSubGrid(index);\n} \/\/ getSubGrid\n\nMsFEMTraits::LocalGridType& LocalGridList::getSubGrid(const CoarseEntityType& entity) {\n  const auto index = coarseGridLeafIndexSet_.index(entity);\n  return getSubGrid(index);\n} \/\/ getSubGrid\n\n\/\/ get number of sub grids\nstd::size_t LocalGridList::size() const { return subGridList_.size(); }\n\nMsFEM::MsFEMTraits::LocalGridPartType LocalGridList::gridPart(IndexType i) { return LocalGridPartType(getSubGrid(i)); }\n\nbool LocalGridList::covers_strict(const CoarseEntityType& coarse_entity,\n                                  const MsFEMTraits::LocalEntityType& local_entity) {\n  const auto& reference_element = Stuff::Grid::reference_element(coarse_entity);\n  const auto& coarse_geometry = coarse_entity.geometry();\n  for (const auto i : DSC::valueRange(local_entity.geometry().corners())) {\n    if (!reference_element.checkInside(coarse_geometry.local(local_entity.geometry().corner(i))))\n      return false;\n  }\n  return true;\n}\n\nbool LocalGridList::covers(const CoarseEntityType& coarse_entity, const MsFEMTraits::LocalEntityType& local_entity) {\n  const auto& center = local_entity.geometry().center();\n  const auto& reference_element = Stuff::Grid::reference_element(coarse_entity);\n  return reference_element.checkInside(coarse_entity.geometry().local(center));\n}\n\n} \/\/ namespace MsFEM {\n} \/\/ namespace Multiscale {\n} \/\/ namespace Dune {\n<commit_msg>[subgridlist] communicate coarse grid boundaries<commit_after>#include <config.h>\n#include <assert.h>\n#include <boost\/assert.hpp>\n#include <boost\/multi_array\/multi_array_ref.hpp>\n#include <dune\/common\/exceptions.hh>\n#include <dune\/fem\/misc\/mpimanager.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/common\/profiler.hh>\n#include <dune\/stuff\/common\/ranges.hh>\n#include <dune\/stuff\/common\/float_cmp.hh>\n#include <dune\/stuff\/grid\/structuredgridfactory.hh>\n#include <dune\/stuff\/grid\/information.hh>\n#include <algorithm>\n#include <iterator>\n#include <ostream>\n#include <utility>\n#include <memory>\n#include <dune\/multiscale\/tools\/misc.hh>\n\n#include \"subgrid-list.hh\"\n\nnamespace Dune {\nnamespace Multiscale {\nnamespace MsFEM {\n\nLocalGridList::LocalGridList(const CommonTraits::DiscreteFunctionSpaceType& coarseSpace)\n  : coarseSpace_(coarseSpace)\n  , coarseGridLeafIndexSet_(coarseSpace_.gridPart().grid().leafIndexSet()) {\n  DSC::Profiler::ScopedTiming st(\"msfem.subgrid_list.ctor\");\n  const auto micro_per_macro = DSC_CONFIG_GET(\"msfem.micro_cells_per_macrocell_dim\", 8);\n  const auto oversampling_layer = DSC_CONFIG_GET(\"msfem.oversampling_layers\", 0);\n\n  typedef StructuredGridFactory<LocalGridType> FactoryType;\n  const auto coarse_dimensions = DSG::dimensions<CommonTraits::GridType>(coarseSpace_.gridPart().grid());\n\n  for (const auto& coarse_entity : coarseSpace_) {\n    \/\/ make sure we only create subgrids for interior coarse elements, not\n    \/\/ for overlap or ghost elements\n    assert(coarse_entity.partitionType() == Dune::InteriorEntity);\n    const auto coarse_index = coarseGridLeafIndexSet_.index(coarse_entity);\n    \/\/ make sure we did not create a subgrid for the current coarse entity so far\n    assert(subGridList_.find(coarse_index) == subGridList_.end());\n\n    const auto dimensions = DSG::dimensions<CommonTraits::GridType>(coarse_entity);\n    const int dim_world = LocalGridType::dimensionworld;\n    typedef FieldVector<typename LocalGridType::ctype, dim_world> CoordType;\n    CoordType lowerLeft(0);\n    CoordType upperRight(0);\n    array<unsigned int, dim_world> elemens;\n    for (const auto i : DSC::valueRange(dim_world)) {\n      elemens[i] = micro_per_macro + (2 * oversampling_layer);\n      const auto min = dimensions.coord_limits[i].min();\n      const auto max = dimensions.coord_limits[i].max();\n      auto localMin = coarse_dimensions.coord_limits[i].min();\n      auto localMax = coarse_dimensions.coord_limits[i].max();\n      const auto coarse_min = coarseSpace.gridPart().grid().comm().min(localMin);\n      const auto coarse_max = coarseSpace.gridPart().grid().comm().max(localMax);\n      const auto delta = (max - min) \/ double(micro_per_macro);\n      lowerLeft[i] = std::max(min - (oversampling_layer * delta), coarse_min);\n      upperRight[i] = std::min(max + (oversampling_layer * delta), coarse_max);\n    }\n    subGridList_[coarse_index] = FactoryType::createCubeGrid(lowerLeft, upperRight, elemens);\n  }\n}\n\nMsFEMTraits::LocalGridType& LocalGridList::getSubGrid(IndexType coarseCellIndex) {\n  auto found = subGridList_.find(coarseCellIndex);\n  BOOST_ASSERT_MSG(found != subGridList_.end(), \"There is no subgrid for the index you provided!\");\n  assert(found->second);\n  return *(found->second);\n} \/\/ getSubGrid\n\nconst MsFEMTraits::LocalGridType& LocalGridList::getSubGrid(IndexType coarseCellIndex) const {\n  auto found = subGridList_.find(coarseCellIndex);\n  BOOST_ASSERT_MSG(found != subGridList_.end(), \"There is no subgrid for the index you provided!\");\n  assert(found->second);\n  return *(found->second);\n} \/\/ getSubGrid\n\nconst MsFEMTraits::LocalGridType& LocalGridList::getSubGrid(const CoarseEntityType& entity) const {\n  const auto index = coarseGridLeafIndexSet_.index(entity);\n  return getSubGrid(index);\n} \/\/ getSubGrid\n\nMsFEMTraits::LocalGridType& LocalGridList::getSubGrid(const CoarseEntityType& entity) {\n  const auto index = coarseGridLeafIndexSet_.index(entity);\n  return getSubGrid(index);\n} \/\/ getSubGrid\n\n\/\/ get number of sub grids\nstd::size_t LocalGridList::size() const { return subGridList_.size(); }\n\nMsFEM::MsFEMTraits::LocalGridPartType LocalGridList::gridPart(IndexType i) { return LocalGridPartType(getSubGrid(i)); }\n\nbool LocalGridList::covers_strict(const CoarseEntityType& coarse_entity,\n                                  const MsFEMTraits::LocalEntityType& local_entity) {\n  const auto& reference_element = Stuff::Grid::reference_element(coarse_entity);\n  const auto& coarse_geometry = coarse_entity.geometry();\n  for (const auto i : DSC::valueRange(local_entity.geometry().corners())) {\n    if (!reference_element.checkInside(coarse_geometry.local(local_entity.geometry().corner(i))))\n      return false;\n  }\n  return true;\n}\n\nbool LocalGridList::covers(const CoarseEntityType& coarse_entity, const MsFEMTraits::LocalEntityType& local_entity) {\n  const auto& center = local_entity.geometry().center();\n  const auto& reference_element = Stuff::Grid::reference_element(coarse_entity);\n  return reference_element.checkInside(coarse_entity.geometry().local(center));\n}\n\n} \/\/ namespace MsFEM {\n} \/\/ namespace Multiscale {\n} \/\/ namespace Dune {\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 \"encoded_frame.h\"\n#include \"generic_encoder.h\"\n#include \"jitter_buffer_common.h\"\n#include \"video_coding_defines.h\"\n\nnamespace webrtc {\n\nVCMEncodedFrame::VCMEncodedFrame()\n:\nwebrtc::EncodedImage(),\n_renderTimeMs(-1),\n_payloadType(0),\n_missingFrame(false),\n_codecSpecificInfo(NULL),\n_codecSpecificInfoLength(0),\n_codec(kVideoCodecUnknown)\n{\n}\n\nVCMEncodedFrame::VCMEncodedFrame(const webrtc::EncodedImage& rhs)\n:\nwebrtc::EncodedImage(rhs),\n_renderTimeMs(-1),\n_payloadType(0),\n_missingFrame(false),\n_codecSpecificInfo(NULL),\n_codecSpecificInfoLength(0),\n_codec(kVideoCodecUnknown)\n{\n    _buffer = NULL;\n    _size = NULL;\n    _length = NULL;\n    if (rhs._buffer != NULL)\n    {\n        VerifyAndAllocate(rhs._length);\n        memcpy(_buffer, rhs._buffer, rhs._length);\n    }\n}\n\nVCMEncodedFrame::VCMEncodedFrame(const VCMEncodedFrame& rhs)\n:\nwebrtc::EncodedImage(rhs),\n_renderTimeMs(rhs._renderTimeMs),\n_payloadType(rhs._payloadType),\n_missingFrame(rhs._missingFrame),\n_codecSpecificInfo(NULL),\n_codecSpecificInfoLength(0),\n_codec(rhs._codec)\n{\n    _buffer = NULL;\n    _size = NULL;\n    _length = NULL;\n    if (rhs._buffer != NULL)\n    {\n        VerifyAndAllocate(rhs._size);\n        memcpy(_buffer, rhs._buffer, rhs._length);\n    }\n}\n\nVCMEncodedFrame::~VCMEncodedFrame()\n{\n    Free();\n}\n\nvoid VCMEncodedFrame::Free()\n{\n    Reset();\n    if (_buffer != NULL)\n    {\n        delete [] _buffer;\n        _buffer = NULL;\n    }\n}\n\nvoid VCMEncodedFrame::Reset()\n{\n    _renderTimeMs = -1;\n    _timeStamp = 0;\n    _payloadType = 0;\n    _codecSpecificInfo = NULL;\n    _codecSpecificInfoLength = 0;\n    _frameType = kDeltaFrame;\n    _encodedWidth = 0;\n    _encodedHeight = 0;\n    _completeFrame = false;\n    _missingFrame = false;\n    _length = 0;\n    _codec = kVideoCodecUnknown;\n}\n\nWebRtc_Word32\nVCMEncodedFrame::Store(VCMFrameStorageCallback& storeCallback) const\n{\n    EncodedVideoData frameToStore;\n    frameToStore.codec = _codec;\n    if (_buffer != NULL)\n    {\n        frameToStore.VerifyAndAllocate(_length);\n        memcpy(frameToStore.payloadData, _buffer, _length);\n        frameToStore.payloadSize = _length;\n    }\n    frameToStore.completeFrame = _completeFrame;\n    frameToStore.encodedWidth = _encodedWidth;\n    frameToStore.encodedHeight = _encodedHeight;\n    frameToStore.frameType = ConvertFrameType(_frameType);\n    frameToStore.missingFrame = _missingFrame;\n    frameToStore.payloadType = _payloadType;\n    frameToStore.renderTimeMs = _renderTimeMs;\n    frameToStore.timeStamp = _timeStamp;\n    storeCallback.StoreReceivedFrame(frameToStore);\n    return VCM_OK;\n}\n\nWebRtc_Word32\nVCMEncodedFrame::VerifyAndAllocate(const WebRtc_UWord32 minimumSize)\n{\n    if(minimumSize > _size)\n    {\n        \/\/ create buffer of sufficient size\n        WebRtc_UWord8* newBuffer = new WebRtc_UWord8[minimumSize];\n        if (newBuffer == NULL)\n        {\n            return -1;\n        }\n        if(_buffer)\n        {\n            \/\/ copy old data\n            memcpy(newBuffer, _buffer, _size);\n            delete [] _buffer;\n        }\n        _buffer = newBuffer;\n        _size = minimumSize;\n    }\n    return 0;\n}\n\nwebrtc::FrameType VCMEncodedFrame::ConvertFrameType(VideoFrameType frameType)\n{\n    switch(frameType)\n    {\n    case kKeyFrame:\n        {\n            return  kVideoFrameKey;\n        }\n    case kDeltaFrame:\n        {\n            return kVideoFrameDelta;\n        }\n    case kGoldenFrame:\n        {\n            return kVideoFrameGolden;\n        }\n    case kAltRefFrame:\n        {\n            return kVideoFrameAltRef;\n        }\n    default:\n        {\n            return kVideoFrameDelta;\n        }\n    }\n}\n\nVideoFrameType VCMEncodedFrame::ConvertFrameType(webrtc::FrameType frameType)\n{\n    switch (frameType)\n    {\n    case kVideoFrameKey:\n        {\n            return kKeyFrame;\n        }\n    case kVideoFrameDelta:\n        {\n            return kDeltaFrame;\n        }\n    case kVideoFrameGolden:\n        {\n            return kGoldenFrame;\n        }\n    case kVideoFrameAltRef:\n        {\n            return kAltRefFrame;\n        }\n    default:\n        {\n            return kDeltaFrame;\n        }\n    }\n}\n\n}\n<commit_msg>Fix \"converting to non-pointer type from NULL\" warnings. Review URL: http:\/\/webrtc-codereview.appspot.com\/93005<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 \"encoded_frame.h\"\n#include \"generic_encoder.h\"\n#include \"jitter_buffer_common.h\"\n#include \"video_coding_defines.h\"\n\nnamespace webrtc {\n\nVCMEncodedFrame::VCMEncodedFrame()\n:\nwebrtc::EncodedImage(),\n_renderTimeMs(-1),\n_payloadType(0),\n_missingFrame(false),\n_codecSpecificInfo(NULL),\n_codecSpecificInfoLength(0),\n_codec(kVideoCodecUnknown)\n{\n}\n\nVCMEncodedFrame::VCMEncodedFrame(const webrtc::EncodedImage& rhs)\n:\nwebrtc::EncodedImage(rhs),\n_renderTimeMs(-1),\n_payloadType(0),\n_missingFrame(false),\n_codecSpecificInfo(NULL),\n_codecSpecificInfoLength(0),\n_codec(kVideoCodecUnknown)\n{\n    _buffer = NULL;\n    _size = 0;\n    _length = 0;\n    if (rhs._buffer != NULL)\n    {\n        VerifyAndAllocate(rhs._length);\n        memcpy(_buffer, rhs._buffer, rhs._length);\n    }\n}\n\nVCMEncodedFrame::VCMEncodedFrame(const VCMEncodedFrame& rhs)\n:\nwebrtc::EncodedImage(rhs),\n_renderTimeMs(rhs._renderTimeMs),\n_payloadType(rhs._payloadType),\n_missingFrame(rhs._missingFrame),\n_codecSpecificInfo(NULL),\n_codecSpecificInfoLength(0),\n_codec(rhs._codec)\n{\n    _buffer = NULL;\n    _size = 0;\n    _length = 0;\n    if (rhs._buffer != NULL)\n    {\n        VerifyAndAllocate(rhs._size);\n        memcpy(_buffer, rhs._buffer, rhs._length);\n    }\n}\n\nVCMEncodedFrame::~VCMEncodedFrame()\n{\n    Free();\n}\n\nvoid VCMEncodedFrame::Free()\n{\n    Reset();\n    if (_buffer != NULL)\n    {\n        delete [] _buffer;\n        _buffer = NULL;\n    }\n}\n\nvoid VCMEncodedFrame::Reset()\n{\n    _renderTimeMs = -1;\n    _timeStamp = 0;\n    _payloadType = 0;\n    _codecSpecificInfo = NULL;\n    _codecSpecificInfoLength = 0;\n    _frameType = kDeltaFrame;\n    _encodedWidth = 0;\n    _encodedHeight = 0;\n    _completeFrame = false;\n    _missingFrame = false;\n    _length = 0;\n    _codec = kVideoCodecUnknown;\n}\n\nWebRtc_Word32\nVCMEncodedFrame::Store(VCMFrameStorageCallback& storeCallback) const\n{\n    EncodedVideoData frameToStore;\n    frameToStore.codec = _codec;\n    if (_buffer != NULL)\n    {\n        frameToStore.VerifyAndAllocate(_length);\n        memcpy(frameToStore.payloadData, _buffer, _length);\n        frameToStore.payloadSize = _length;\n    }\n    frameToStore.completeFrame = _completeFrame;\n    frameToStore.encodedWidth = _encodedWidth;\n    frameToStore.encodedHeight = _encodedHeight;\n    frameToStore.frameType = ConvertFrameType(_frameType);\n    frameToStore.missingFrame = _missingFrame;\n    frameToStore.payloadType = _payloadType;\n    frameToStore.renderTimeMs = _renderTimeMs;\n    frameToStore.timeStamp = _timeStamp;\n    storeCallback.StoreReceivedFrame(frameToStore);\n    return VCM_OK;\n}\n\nWebRtc_Word32\nVCMEncodedFrame::VerifyAndAllocate(const WebRtc_UWord32 minimumSize)\n{\n    if(minimumSize > _size)\n    {\n        \/\/ create buffer of sufficient size\n        WebRtc_UWord8* newBuffer = new WebRtc_UWord8[minimumSize];\n        if (newBuffer == NULL)\n        {\n            return -1;\n        }\n        if(_buffer)\n        {\n            \/\/ copy old data\n            memcpy(newBuffer, _buffer, _size);\n            delete [] _buffer;\n        }\n        _buffer = newBuffer;\n        _size = minimumSize;\n    }\n    return 0;\n}\n\nwebrtc::FrameType VCMEncodedFrame::ConvertFrameType(VideoFrameType frameType)\n{\n    switch(frameType)\n    {\n    case kKeyFrame:\n        {\n            return  kVideoFrameKey;\n        }\n    case kDeltaFrame:\n        {\n            return kVideoFrameDelta;\n        }\n    case kGoldenFrame:\n        {\n            return kVideoFrameGolden;\n        }\n    case kAltRefFrame:\n        {\n            return kVideoFrameAltRef;\n        }\n    default:\n        {\n            return kVideoFrameDelta;\n        }\n    }\n}\n\nVideoFrameType VCMEncodedFrame::ConvertFrameType(webrtc::FrameType frameType)\n{\n    switch (frameType)\n    {\n    case kVideoFrameKey:\n        {\n            return kKeyFrame;\n        }\n    case kVideoFrameDelta:\n        {\n            return kDeltaFrame;\n        }\n    case kVideoFrameGolden:\n        {\n            return kGoldenFrame;\n        }\n    case kVideoFrameAltRef:\n        {\n            return kAltRefFrame;\n        }\n    default:\n        {\n            return kDeltaFrame;\n        }\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Judge.h\"\n#include <iostream>\n#include <sstream>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\nusing namespace WinnerPoker;\n\nstd::vector<size_t> test(const std::vector<size_t> &t)\n{\n    std::stringstream ss;\n    ss << \"{ \";\n    for (auto &&item : t)\n    {\n        ss << item << \", \";\n    }\n    ss.seekp(-2, ss.end);\n    ss << \" }\" << std::endl;\n\n    \/\/ std::cout << ss.str();\n\n    std::vector<size_t> vector;\n    auto                zip = Judge::getInstance().zip(t);\n    for (auto &&x : zip)\n    {\n        for (int i = 1; i <= x.second; ++i)\n        {\n            vector.push_back((x.first << 8) | i);\n        }\n    }\n\n    ss.str(\"\");\n    ss << \"{ \";\n    for (auto &&item : vector)\n    {\n        ss << item << \", \";\n    }\n    ss.seekp(-2, ss.end);\n    ss << \" }\" << std::endl;\n\n    \/\/ std::cout << ss.str();\n\n    return vector;\n}\n\nint main()\n{\n    \/\/ std::vector<size_t> hands = { 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7 };\n    \/\/ std::vector<size_t> hands = { 3, 3, 4, 6, 6, 7, 8, 10, 10, 11, 12, 13, 13, 14, 15 };\n    \/\/ std::vector<size_t> hands = { 3, 3, 4, 4, 5, 5, 7, 7 };\n    \/\/ std::vector<size_t> hands = { 3, 4, 5, 5, 5, 5, 7, 7, 8, 9, 10 };\n\n    std::vector<size_t> hands = {\n        3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 10, 10, 10, 10, 14, 14, 14\n    };\n\n    std::vector<size_t> tv = { 4,4,4 };\n    Judge::getInstance().setCurrentHandsCategory(test(tv));\n\n    \/*\n   auto              ret = Judge::getInstance().cardIntentions(test(hands));\n   std::stringstream ss;\n\n   for (auto &&item : ret)\n   {\n       ss.str(\"\");\n\n       ss << \"{ \";\n       for (auto &&element : item)\n       {\n           ss << element << \", \";\n       }\n       ss.seekp(-2, ss.end);\n       ss << \" }\" << std::endl;\n\n       std::cout << ss.str();\n   }\n\n   for (auto &&item : ret)\n   {\n       ss.str(\"\");\n\n       ss << \"{ \";\n       for (auto &&element : item)\n       {\n           ss << (element >> 8) << \", \";\n       }\n       ss.seekp(-2, ss.end);\n       ss << \" }\" << std::endl;\n\n       std::cout << ss.str();\n   }\n  *\/\n\n    for (int i = 0; i < 24; ++i)\n    {\n        const auto &ret = Judge::getInstance().hint(test(hands));\n\n        std::stringstream ss;\n\n        ss.str(\"\");\n        ss << \"{ \";\n        for (auto &&item : ret)\n        {\n            ss << (item >> 8) << \", \";\n        }\n        ss.seekp(-2, ss.end);\n        ss << \" }\" << std::endl;\n\n        std::cout << ss.str();\n    }\n\n    return 0;\n}\n<commit_msg>workaround for ant being a pile of fail<commit_after>#include \"Judge.h\"\n#include <iostream>\n#include <sstream>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\nusing namespace WinnerPoker;\n\nstd::vector<size_t> test(const std::vector<size_t> &t)\n{\n    std::stringstream ss;\n    ss << \"{ \";\n    for (auto &&item : t)\n    {\n        ss << item << \", \";\n    }\n    ss.seekp(-2, ss.end);\n    ss << \" }\" << std::endl;\n\n    \/\/ std::cout << ss.str();\n\n    std::vector<size_t> vector;\n    auto                zip = Judge::getInstance().zip(t);\n    for (auto &&x : zip)\n    {\n        for (int i = 1; i <= x.second; ++i)\n        {\n            vector.push_back((x.first << 8) | i);\n        }\n    }\n\n    ss.str(\"\");\n    ss << \"{ \";\n    for (auto &&item : vector)\n    {\n        ss << item << \", \";\n    }\n    ss.seekp(-2, ss.end);\n    ss << \" }\" << std::endl;\n\n    \/\/ std::cout << ss.str();\n\n    return vector;\n}\n\nint main()\n{\n    \/\/ std::vector<size_t> hands = { 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7 };\n    \/\/ std::vector<size_t> hands = { 3, 3, 4, 6, 6, 7, 8, 10, 10, 11, 12, 13, 13, 14, 15 };\n    \/\/ std::vector<size_t> hands = { 3, 3, 4, 4, 5, 5, 7, 7 };\n    \/\/ std::vector<size_t> hands = { 3, 4, 5, 5, 5, 5, 7, 7, 8, 9, 10 };\n\n    std::vector<size_t> hands = {\n            3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 10, 10, 10, 10, 14, 14, 14\n    };\n\n    std::vector<size_t> tv = { 4,4,4 };\n    Judge::getInstance().setCurrentHandsCategory(test(tv));\n\n    \/*\n   auto              ret = Judge::getInstance().cardIntentions(test(hands));\n   std::stringstream ss;\n\n   for (auto &&item : ret)\n   {\n       ss.str(\"\");\n\n       ss << \"{ \";\n       for (auto &&element : item)\n       {\n           ss << element << \", \";\n       }\n       ss.seekp(-2, ss.end);\n       ss << \" }\" << std::endl;\n\n       std::cout << ss.str();\n   }\n\n   for (auto &&item : ret)\n   {\n       ss.str(\"\");\n\n       ss << \"{ \";\n       for (auto &&element : item)\n       {\n           ss << (element >> 8) << \", \";\n       }\n       ss.seekp(-2, ss.end);\n       ss << \" }\" << std::endl;\n\n       std::cout << ss.str();\n   }\n  *\/\n\n    for (int i = 0; i < 24; ++i)\n    {\n        const auto &ret = Judge::getInstance().hint(test(hands));\n\n        std::stringstream ss;\n\n        ss.str(\"\");\n        ss << \"{ \";\n        for (auto &&item : ret)\n        {\n            ss << (item >> 8) << \", \";\n        }\n        ss.seekp(-2, ss.end);\n        ss << \" }\" << std::endl;\n\n        std::cout << ss.str();\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n#include <cmath>\n#include \"elements.h\"\n\nusing namespace std;\n\n\/\/open coordinates.csv array\n\nint main() \n{\nusing R_ji (x_j, x_i, y_j, y_i, z_j, z_i)\n{\n    return ((sqrt((x_i-x_j) pow 2) + (y_i-y_j) pow 2) + (z_i-z_j) pow 2)))\n    };\n    \nusing R_jk (x_k,x_j,y_k,y_j,z_k,z_j) \n{\n    return ((sqrt((x_j-x_k) pow 2) + (y_j-y_k) pow 2) + (z_j-z_k) pow 2))))\n    };\n       \nusing R_kl (x_l,x_k,y_l,y_k,z_l,z_k) \n{\n    return ((sqrt((x_k-x_l) pow 2) + (y_k-y_l) pow 2) + (z_k-z_l) pow 2)))) \n    };\n    \nreturn 0;\n}\n<commit_msg>delelted #endif which shouldn't have been there<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n#include <cmath>\n#include \"elements.h\"\n\nusing namespace std;\n\n\/\/open coordinates.csv array\n\nint main() \n{\nusing R_ji (x_j, x_i, y_j, y_i, z_j, z_i)\n{\n    return ((sqrt((x_i-x_j) pow 2) + (y_i-y_j) pow 2) + (z_i-z_j) pow 2)))\n    };\n    \nusing R_jk (x_k,x_j,y_k,y_j,z_k,z_j) \n{\n    return ((sqrt((x_j-x_k) pow 2) + (y_j-y_k) pow 2) + (z_j-z_k) pow 2))))\n    };\n       \nusing R_kl (x_l,x_k,y_l,y_k,z_l,z_k) \n{\n    return ((sqrt((x_k-x_l) pow 2) + (y_k-y_l) pow 2) + (z_k-z_l) pow 2)))) \n    };\n    \nreturn 0;\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\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/browser\/prerender\/prerender_contents.h\"\n#include \"chrome\/browser\/prerender\/prerender_manager.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/net\/url_request_context_getter.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/url_request\/url_request_context.h\"\n\n\/\/ Prerender tests work as follows:\n\/\/\n\/\/ A page with a prefetch link to the test page is loaded.  Once prerendered,\n\/\/ its Javascript function DidPrerenderPass() is called, which returns true if\n\/\/ the page behaves as expected when prerendered.\n\/\/\n\/\/ The prerendered page is then displayed on a tab.  The Javascript function\n\/\/ DidDisplayPass() is called, and returns true if the page behaved as it\n\/\/ should while being displayed.\n\nnamespace {\n\n\/\/ PrerenderContents that stops the UI message loop on DidStopLoading().\nclass TestPrerenderContents : public PrerenderContents {\n public:\n  TestPrerenderContents(\n      PrerenderManager* prerender_manager, Profile* profile, const GURL& url,\n      const std::vector<GURL>& alias_urls)\n      : PrerenderContents(prerender_manager, profile, url, alias_urls),\n        did_finish_loading_(false) {\n  }\n\n  virtual ~TestPrerenderContents() {\n    \/\/ In the event we are destroyed, say if the prerender was canceled, quit\n    \/\/ the UI message loop.\n    if (!did_finish_loading_)\n      MessageLoopForUI::current()->Quit();\n  }\n\n  virtual void DidStopLoading() {\n    PrerenderContents::DidStopLoading();\n    did_finish_loading_ = true;\n    MessageLoopForUI::current()->Quit();\n  }\n\n  bool did_finish_loading() const { return did_finish_loading_; }\n\n private:\n  bool did_finish_loading_;\n};\n\n\/\/ PrerenderManager that uses TestPrerenderContents.\nclass WaitForLoadPrerenderContentsFactory : public PrerenderContents::Factory {\n public:\n  virtual PrerenderContents* CreatePrerenderContents(\n      PrerenderManager* prerender_manager, Profile* profile, const GURL& url,\n      const std::vector<GURL>& alias_urls) {\n    return new TestPrerenderContents(prerender_manager, profile, url,\n                                     alias_urls);\n  }\n};\n\n}  \/\/ namespace\n\nclass PrerenderBrowserTest : public InProcessBrowserTest {\n public:\n  PrerenderBrowserTest() {\n    EnableDOMAutomation();\n  }\n\n  virtual void SetUpCommandLine(CommandLine* command_line) {\n    command_line->AppendSwitch(switches::kEnablePagePrerender);\n#if defined(OS_MACOSX)\n    \/\/ The plugins directory isn't read by default on the Mac, so it needs to be\n    \/\/ explicitly registered.\n    FilePath app_dir;\n    PathService::Get(chrome::DIR_APP, &app_dir);\n    command_line->AppendSwitchPath(\n        switches::kExtraPluginDir,\n        app_dir.Append(FILE_PATH_LITERAL(\"plugins\")));\n#endif\n  }\n\n  void PrerenderTestURL(const std::string& html_file, bool expect_success) {\n    ASSERT_TRUE(test_server()->Start());\n\n    std::string src_path = \"files\/prerender\/prerender_loader.html?\";\n    src_path.append(html_file);\n    std::string dest_path = \"files\/prerender\/\";\n    dest_path.append(html_file);\n\n    GURL src_url = test_server()->GetURL(src_path);\n    dest_url_ = test_server()->GetURL(dest_path);\n\n    Profile* profile = browser()->GetSelectedTabContents()->profile();\n    PrerenderManager* prerender_manager = profile->GetPrerenderManager();\n    ASSERT_TRUE(prerender_manager);\n\n    \/\/ This is needed to exit the event loop once the prerendered page has\n    \/\/ stopped loading or was cancelled.\n    prerender_manager->SetPrerenderContentsFactory(\n        new WaitForLoadPrerenderContentsFactory());\n\n    \/\/ ui_test_utils::NavigateToURL uses its own observer and message loop.\n    \/\/ Since the test needs to wait until the prerendered page has stopped\n    \/\/ loading, rathather than the page directly navigated to, need to\n    \/\/ handle browser navigation directly.\n    browser()->OpenURL(src_url, GURL(), CURRENT_TAB, PageTransition::TYPED);\n\n    ui_test_utils::RunMessageLoop();\n\n    TestPrerenderContents* prerender_contents =\n        static_cast<TestPrerenderContents*>(\n            prerender_manager->FindEntry(dest_url_));\n\n    if (expect_success) {\n      ASSERT_TRUE(prerender_contents != NULL);\n      ASSERT_TRUE(prerender_contents->did_finish_loading());\n\n      \/\/ Check if page behaves as expected while in prerendered state.\n      bool prerender_test_result = false;\n      ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n          prerender_contents->render_view_host(), L\"\",\n          L\"window.domAutomationController.send(DidPrerenderPass())\",\n          &prerender_test_result));\n      EXPECT_TRUE(prerender_test_result);\n    } else {\n      \/\/ In the failure case, we should have removed dest_url_ from the\n      \/\/ prerender_manager.\n      EXPECT_TRUE(prerender_contents == NULL);\n    }\n  }\n\n  void NavigateToDestURL() const {\n    ui_test_utils::NavigateToURL(browser(), dest_url_);\n\n    Profile* profile = browser()->GetSelectedTabContents()->profile();\n    PrerenderManager* prerender_manager = profile->GetPrerenderManager();\n    ASSERT_TRUE(prerender_manager);\n\n    \/\/ Make sure the PrerenderContents found earlier was used or removed\n    EXPECT_TRUE(prerender_manager->FindEntry(dest_url_) == NULL);\n\n    \/\/ Check if page behaved as expected when actually displayed.\n    bool display_test_result = false;\n    ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n        browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n        L\"window.domAutomationController.send(DidDisplayPass())\",\n        &display_test_result));\n    EXPECT_TRUE(display_test_result);\n  }\n\n private:\n  GURL dest_url_;\n};\n\n\/\/ Checks that a page is correctly prerendered in the case of a\n\/\/ <link rel=prefetch> tag and then loaded into a tab in response to a\n\/\/ navigation.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderPage) {\n  PrerenderTestURL(\"prerender_page.html\", true);\n  NavigateToDestURL();\n}\n\n\/\/ Checks that the prerendering of a page is canceled correctly when a\n\/\/ Javascript alert is called.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderAlertBeforeOnload) {\n  PrerenderTestURL(\"prerender_alert_before_onload.html\", false);\n}\n\n\/\/ Checks that the prerendering of a page is canceled correctly when a\n\/\/ Javascript alert is called.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderAlertAfterOnload) {\n  PrerenderTestURL(\"prerender_alert_after_onload.html\", false);\n}\n\n\/\/ Checks that plugins are not loaded while a page is being preloaded, but\n\/\/ are loaded when the page is displayed.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderDelayLoadPlugin) {\n  PrerenderTestURL(\"plugin_delay_load.html\", true);\n  NavigateToDestURL();\n}\n\n\/\/ Renders a page that contains a prerender link to a page that contains an\n\/\/ iframe with a source that requires http authentication. This should not\n\/\/ prerender successfully.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderHttpAuthentication) {\n  PrerenderTestURL(\"prerender_http_auth_container.html\", false);\n}\n<commit_msg>Add FinalStatus expectations to PrerenderBrowserTest tests.<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\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/browser\/prerender\/prerender_contents.h\"\n#include \"chrome\/browser\/prerender\/prerender_manager.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/net\/url_request_context_getter.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/url_request\/url_request_context.h\"\n\n\/\/ Prerender tests work as follows:\n\/\/\n\/\/ A page with a prefetch link to the test page is loaded.  Once prerendered,\n\/\/ its Javascript function DidPrerenderPass() is called, which returns true if\n\/\/ the page behaves as expected when prerendered.\n\/\/\n\/\/ The prerendered page is then displayed on a tab.  The Javascript function\n\/\/ DidDisplayPass() is called, and returns true if the page behaved as it\n\/\/ should while being displayed.\n\nnamespace {\n\n\/\/ PrerenderContents that stops the UI message loop on DidStopLoading().\nclass TestPrerenderContents : public PrerenderContents {\n public:\n  TestPrerenderContents(\n      PrerenderManager* prerender_manager, Profile* profile, const GURL& url,\n      const std::vector<GURL>& alias_urls,\n      PrerenderContents::FinalStatus expected_final_status)\n      : PrerenderContents(prerender_manager, profile, url, alias_urls),\n        did_finish_loading_(false),\n        expected_final_status_(expected_final_status) {\n  }\n\n  virtual ~TestPrerenderContents() {\n    EXPECT_EQ(expected_final_status_, final_status());\n    \/\/ In the event we are destroyed, say if the prerender was canceled, quit\n    \/\/ the UI message loop.\n    if (!did_finish_loading_)\n      MessageLoopForUI::current()->Quit();\n  }\n\n  virtual void DidStopLoading() {\n    PrerenderContents::DidStopLoading();\n    did_finish_loading_ = true;\n    MessageLoopForUI::current()->Quit();\n  }\n\n  bool did_finish_loading() const { return did_finish_loading_; }\n\n private:\n  bool did_finish_loading_;\n  PrerenderContents::FinalStatus expected_final_status_;\n};\n\n\/\/ PrerenderManager that uses TestPrerenderContents.\nclass WaitForLoadPrerenderContentsFactory : public PrerenderContents::Factory {\n public:\n  explicit WaitForLoadPrerenderContentsFactory(\n      PrerenderContents::FinalStatus expected_final_status)\n      : expected_final_status_(expected_final_status) {\n  }\n\n  virtual PrerenderContents* CreatePrerenderContents(\n      PrerenderManager* prerender_manager, Profile* profile, const GURL& url,\n      const std::vector<GURL>& alias_urls) {\n    return new TestPrerenderContents(prerender_manager, profile, url,\n                                     alias_urls, expected_final_status_);\n  }\n\n private:\n  PrerenderContents::FinalStatus expected_final_status_;\n};\n\n}  \/\/ namespace\n\nclass PrerenderBrowserTest : public InProcessBrowserTest {\n public:\n  PrerenderBrowserTest() {\n    EnableDOMAutomation();\n  }\n\n  virtual void SetUpCommandLine(CommandLine* command_line) {\n    command_line->AppendSwitch(switches::kEnablePagePrerender);\n#if defined(OS_MACOSX)\n    \/\/ The plugins directory isn't read by default on the Mac, so it needs to be\n    \/\/ explicitly registered.\n    FilePath app_dir;\n    PathService::Get(chrome::DIR_APP, &app_dir);\n    command_line->AppendSwitchPath(\n        switches::kExtraPluginDir,\n        app_dir.Append(FILE_PATH_LITERAL(\"plugins\")));\n#endif\n  }\n\n  void PrerenderTestURL(const std::string& html_file,\n                        PrerenderContents::FinalStatus expected_final_status) {\n    ASSERT_TRUE(test_server()->Start());\n\n    std::string src_path = \"files\/prerender\/prerender_loader.html?\";\n    src_path.append(html_file);\n    std::string dest_path = \"files\/prerender\/\";\n    dest_path.append(html_file);\n\n    GURL src_url = test_server()->GetURL(src_path);\n    dest_url_ = test_server()->GetURL(dest_path);\n\n    Profile* profile = browser()->GetSelectedTabContents()->profile();\n    PrerenderManager* prerender_manager = profile->GetPrerenderManager();\n    ASSERT_TRUE(prerender_manager);\n\n    \/\/ This is needed to exit the event loop once the prerendered page has\n    \/\/ stopped loading or was cancelled.\n    prerender_manager->SetPrerenderContentsFactory(\n        new WaitForLoadPrerenderContentsFactory(expected_final_status));\n\n    \/\/ ui_test_utils::NavigateToURL uses its own observer and message loop.\n    \/\/ Since the test needs to wait until the prerendered page has stopped\n    \/\/ loading, rathather than the page directly navigated to, need to\n    \/\/ handle browser navigation directly.\n    browser()->OpenURL(src_url, GURL(), CURRENT_TAB, PageTransition::TYPED);\n\n    ui_test_utils::RunMessageLoop();\n\n    TestPrerenderContents* prerender_contents =\n        static_cast<TestPrerenderContents*>(\n            prerender_manager->FindEntry(dest_url_));\n\n    switch (expected_final_status) {\n      case PrerenderContents::FINAL_STATUS_USED: {\n        ASSERT_TRUE(prerender_contents != NULL);\n        ASSERT_TRUE(prerender_contents->did_finish_loading());\n\n        \/\/ Check if page behaves as expected while in prerendered state.\n        bool prerender_test_result = false;\n        ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n            prerender_contents->render_view_host(), L\"\",\n            L\"window.domAutomationController.send(DidPrerenderPass())\",\n            &prerender_test_result));\n        EXPECT_TRUE(prerender_test_result);\n        break;\n      }\n      default:\n        \/\/ In the failure case, we should have removed dest_url_ from the\n        \/\/ prerender_manager.\n        EXPECT_TRUE(prerender_contents == NULL);\n        break;\n    }\n  }\n\n  void NavigateToDestURL() const {\n    ui_test_utils::NavigateToURL(browser(), dest_url_);\n\n    Profile* profile = browser()->GetSelectedTabContents()->profile();\n    PrerenderManager* prerender_manager = profile->GetPrerenderManager();\n    ASSERT_TRUE(prerender_manager);\n\n    \/\/ Make sure the PrerenderContents found earlier was used or removed\n    EXPECT_TRUE(prerender_manager->FindEntry(dest_url_) == NULL);\n\n    \/\/ Check if page behaved as expected when actually displayed.\n    bool display_test_result = false;\n    ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n        browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n        L\"window.domAutomationController.send(DidDisplayPass())\",\n        &display_test_result));\n    EXPECT_TRUE(display_test_result);\n  }\n\n private:\n  GURL dest_url_;\n};\n\n\/\/ Checks that a page is correctly prerendered in the case of a\n\/\/ <link rel=prefetch> tag and then loaded into a tab in response to a\n\/\/ navigation.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderPage) {\n  PrerenderTestURL(\"prerender_page.html\",\n                   PrerenderContents::FINAL_STATUS_USED);\n  NavigateToDestURL();\n}\n\n\/\/ Checks that the prerendering of a page is canceled correctly when a\n\/\/ Javascript alert is called.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderAlertBeforeOnload) {\n  PrerenderTestURL(\n      \"prerender_alert_before_onload.html\",\n      PrerenderContents::FINAL_STATUS_JAVASCRIPT_ALERT);\n}\n\n\/\/ Checks that the prerendering of a page is canceled correctly when a\n\/\/ Javascript alert is called.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderAlertAfterOnload) {\n  PrerenderTestURL(\n      \"prerender_alert_after_onload.html\",\n      PrerenderContents::FINAL_STATUS_JAVASCRIPT_ALERT);\n}\n\n\/\/ Checks that plugins are not loaded while a page is being preloaded, but\n\/\/ are loaded when the page is displayed.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderDelayLoadPlugin) {\n  PrerenderTestURL(\"plugin_delay_load.html\",\n                   PrerenderContents::FINAL_STATUS_USED);\n  NavigateToDestURL();\n}\n\n\/\/ Renders a page that contains a prerender link to a page that contains an\n\/\/ iframe with a source that requires http authentication. This should not\n\/\/ prerender successfully.\nIN_PROC_BROWSER_TEST_F(PrerenderBrowserTest, PrerenderHttpAuthentication) {\n  PrerenderTestURL(\"prerender_http_auth_container.html\",\n                   PrerenderContents::FINAL_STATUS_AUTH_NEEDED);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- ADCE.cpp - Code to perform agressive dead code elimination ---------===\/\/\n\/\/\n\/\/ This file implements \"agressive\" dead code elimination.  ADCE is DCe where\n\/\/ values are assumed to be dead until proven otherwise.  This is similar to \n\/\/ SCCP, except applied to the liveness of values.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Optimizations\/DCE.h\"\n#include \"llvm\/Instruction.h\"\n#include \"llvm\/Type.h\"\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Support\/STLExtras.h\"\n#include \"llvm\/Analysis\/Writer.h\"\n#include \"llvm\/CFG.h\"\n#include \"llvm\/iTerminators.h\"\n#include <set>\n#include <algorithm>\n\n\/\/#define DEBUG_ADCE 1\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ADCE Class\n\/\/\n\/\/ This class does all of the work of Agressive Dead Code Elimination.\n\/\/ It's public interface consists of a constructor and a doADCE() method.\n\/\/\nclass ADCE {\n  Method *M;                            \/\/ The method that we are working on...\n  vector<Instruction*>   WorkList;      \/\/ Instructions that just became live\n  set<Instruction*>      LiveSet;       \/\/ The set of live instructions\n  bool MadeChanges;\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/ The public interface for this class\n  \/\/\npublic:\n  \/\/ ADCE Ctor - Save the method to operate on...\n  inline ADCE(Method *m) : M(m), MadeChanges(false) {}\n\n  \/\/ doADCE() - Run the Agressive Dead Code Elimination algorithm, returning\n  \/\/ true if the method was modified.\n  bool doADCE();\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/ The implementation of this class\n  \/\/\nprivate:\n  inline void markInstructionLive(Instruction *I) {\n    if (LiveSet.count(I)) return;\n#ifdef DEBUG_ADCE\n    cerr << \"Insn Live: \" << I;\n#endif\n    LiveSet.insert(I);\n    WorkList.push_back(I);\n  }\n\n  inline void markTerminatorLive(const BasicBlock *BB) {\n#ifdef DEBUG_ADCE\n    cerr << \"Terminat Live: \" << BB->getTerminator();\n#endif\n    markInstructionLive((Instruction*)BB->getTerminator());\n  }\n\n  \/\/ fixupCFG - Walk the CFG in depth first order, eliminating references to \n  \/\/ dead blocks.\n  \/\/\n  BasicBlock *fixupCFG(BasicBlock *Head, set<BasicBlock*> &VisitedBlocks,\n\t\t       const set<BasicBlock*> &AliveBlocks);\n};\n\n\n\n\/\/ doADCE() - Run the Agressive Dead Code Elimination algorithm, returning\n\/\/ true if the method was modified.\n\/\/\nbool ADCE::doADCE() {\n  \/\/ Compute the control dependence graph...  Note that this has a side effect\n  \/\/ on the CFG: a new return bb is added and all returns are merged here.\n  \/\/\n  cfg::DominanceFrontier CDG(cfg::DominatorSet(M, true));\n\n#ifdef DEBUG_ADCE\n  cerr << \"Method: \" << M;\n#endif\n\n  \/\/ Iterate over all of the instructions in the method, eliminating trivially\n  \/\/ dead instructions, and marking instructions live that are known to be \n  \/\/ needed.  Perform the walk in depth first order so that we avoid marking any\n  \/\/ instructions live in basic blocks that are unreachable.  These blocks will\n  \/\/ be eliminated later, along with the instructions inside.\n  \/\/\n  for (cfg::df_iterator BBI = cfg::df_begin(M), BBE = cfg::df_end(M);\n       BBI != BBE; ++BBI) {\n    BasicBlock *BB = *BBI;\n    for (BasicBlock::iterator II = BB->begin(), EI = BB->end(); II != EI; ) {\n      Instruction *I = *II;\n\n      if (I->hasSideEffects() || I->getOpcode() == Instruction::Ret) {\n\tmarkInstructionLive(I);\n      } else {\n\t\/\/ Check to see if anything is trivially dead\n\tif (I->use_size() == 0 && I->getType() != Type::VoidTy) {\n\t  \/\/ Remove the instruction from it's basic block...\n\t  delete BB->getInstList().remove(II);\n\t  MadeChanges = true;\n\t  continue;  \/\/ Don't increment the iterator past the current slot\n\t}\n      }\n\n      ++II;  \/\/ Increment the inst iterator if the inst wasn't deleted\n    }\n  }\n\n#ifdef DEBUG_ADCE\n  cerr << \"Processing work list\\n\";\n#endif\n\n  \/\/ AliveBlocks - Set of basic blocks that we know have instructions that are\n  \/\/ alive in them...\n  \/\/\n  set<BasicBlock*> AliveBlocks;\n\n  \/\/ Process the work list of instructions that just became live... if they\n  \/\/ became live, then that means that all of their operands are neccesary as\n  \/\/ well... make them live as well.\n  \/\/\n  while (!WorkList.empty()) {\n    Instruction *I = WorkList.back(); \/\/ Get an instruction that became live...\n    WorkList.pop_back();\n\n    BasicBlock *BB = I->getParent();\n    if (AliveBlocks.count(BB) == 0) {   \/\/ Basic block not alive yet...\n      \/\/ Mark the basic block as being newly ALIVE... and mark all branches that\n      \/\/ this block is control dependant on as being alive also...\n      \/\/\n      AliveBlocks.insert(BB);   \/\/ Block is now ALIVE!\n      cfg::DominanceFrontier::const_iterator It = CDG.find(BB);\n      if (It != CDG.end()) {\n\t\/\/ Get the blocks that this node is control dependant on...\n\tconst cfg::DominanceFrontier::DomSetType &CDB = It->second;\n\tfor_each(CDB.begin(), CDB.end(),   \/\/ Mark all their terminators as live\n\t\t bind_obj(this, &ADCE::markTerminatorLive));\n      }\n\n      \/\/ If this basic block is live, then the terminator must be as well!\n      markTerminatorLive(BB);\n    }\n\n    \/\/ Loop over all of the operands of the live instruction, making sure that\n    \/\/ they are known to be alive as well...\n    \/\/\n    for (unsigned op = 0, End = I->getNumOperands(); op != End; ++op) {\n      if (Instruction *Operand = I->getOperand(op)->castInstruction())\n\tmarkInstructionLive(Operand);\n    }\n  }\n\n#ifdef DEBUG_ADCE\n  cerr << \"Current Method: X = Live\\n\";\n  for (Method::inst_iterator IL = M->inst_begin(); IL != M->inst_end(); ++IL) {\n    if (LiveSet.count(*IL)) cerr << \"X \";\n    cerr << *IL;\n  }\n#endif\n\n  \/\/ After the worklist is processed, recursively walk the CFG in depth first\n  \/\/ order, patching up references to dead blocks...\n  \/\/\n  set<BasicBlock*> VisitedBlocks;\n  BasicBlock *EntryBlock = fixupCFG(M->front(), VisitedBlocks, AliveBlocks);\n  if (EntryBlock && EntryBlock != M->front()) {\n    if (EntryBlock->front()->isPHINode()) {\n      \/\/ Cannot make the first block be a block with a PHI node in it! Instead,\n      \/\/ strip the first basic block of the method to contain no instructions,\n      \/\/ then add a simple branch to the \"real\" entry node...\n      \/\/\n      BasicBlock *E = M->front();\n      if (!E->front()->isTerminator() ||   \/\/ Check for an actual change...\n\t  ((TerminatorInst*)E->front())->getNumSuccessors() != 1 ||\n\t  ((TerminatorInst*)E->front())->getSuccessor(0) != EntryBlock) {\n\tE->getInstList().delete_all();      \/\/ Delete all instructions in block\n\tE->getInstList().push_back(new BranchInst(EntryBlock));\n\tMadeChanges = true;\n      }\n      AliveBlocks.insert(E);\n    } else {\n      \/\/ We need to move the new entry block to be the first bb of the method.\n      Method::iterator EBI = find(M->begin(), M->end(), EntryBlock);\n      swap(*EBI, *M->begin());  \/\/ Exchange old location with start of method\n      MadeChanges = true;\n    }\n  }\n\n  \/\/ Now go through and tell dead blocks to drop all of their references so they\n  \/\/ can be safely deleted.\n  \/\/\n  for (Method::iterator BI = M->begin(), BE = M->end(); BI != BE; ++BI) {\n    BasicBlock *BB = *BI;\n    if (!AliveBlocks.count(BB)) {\n      BB->dropAllReferences();\n    }\n  }\n\n  \/\/ Now loop through all of the blocks and delete them.  We can safely do this\n  \/\/ now because we know that there are no references to dead blocks (because\n  \/\/ they have dropped all of their references...\n  \/\/\n  for (Method::iterator BI = M->begin(); BI != M->end();) {\n    if (!AliveBlocks.count(*BI)) {\n      delete M->getBasicBlocks().remove(BI);\n      MadeChanges = true;\n      continue;                                     \/\/ Don't increment iterator\n    }\n    ++BI;                                           \/\/ Increment iterator...\n  }\n\n  return MadeChanges;\n}\n\n\n\/\/ fixupCFG - Walk the CFG in depth first order, eliminating references to \n\/\/ dead blocks:\n\/\/  If the BB is alive (in AliveBlocks):\n\/\/   1. Eliminate all dead instructions in the BB\n\/\/   2. Recursively traverse all of the successors of the BB:\n\/\/      - If the returned successor is non-null, update our terminator to\n\/\/         reference the returned BB\n\/\/   3. Return 0 (no update needed)\n\/\/\n\/\/  If the BB is dead (not in AliveBlocks):\n\/\/   1. Add the BB to the dead set\n\/\/   2. Recursively traverse all of the successors of the block:\n\/\/      - Only one shall return a nonnull value (or else this block should have\n\/\/        been in the alive set).\n\/\/   3. Return the nonnull child, or 0 if no non-null children.\n\/\/\nBasicBlock *ADCE::fixupCFG(BasicBlock *BB, set<BasicBlock*> &VisitedBlocks,\n\t\t\t   const set<BasicBlock*> &AliveBlocks) {\n  if (VisitedBlocks.count(BB)) return 0;   \/\/ Revisiting a node? No update.\n  VisitedBlocks.insert(BB);                \/\/ We have now visited this node!\n\n#ifdef DEBUG_ADCE\n  cerr << \"Fixing up BB: \" << BB;\n#endif\n\n  if (AliveBlocks.count(BB)) {             \/\/ Is the block alive?\n    \/\/ Yes it's alive: loop through and eliminate all dead instructions in block\n    for (BasicBlock::iterator II = BB->begin(); II != BB->end()-1; ) {\n      Instruction *I = *II;\n      if (!LiveSet.count(I)) {             \/\/ Is this instruction alive?\n\t\/\/ Nope... remove the instruction from it's basic block...\n\tdelete BB->getInstList().remove(II);\n\tMadeChanges = true;\n\tcontinue;                          \/\/ Don't increment II\n      }\n      ++II;\n    }\n\n    \/\/ Recursively traverse successors of this basic block.  \n    cfg::succ_iterator SI = cfg::succ_begin(BB), SE = cfg::succ_end(BB);\n    for (; SI != SE; ++SI) {\n      BasicBlock *Succ = *SI;\n      BasicBlock *Repl = fixupCFG(Succ, VisitedBlocks, AliveBlocks);\n      if (Repl && Repl != Succ) {          \/\/ We have to replace the successor\n\tSucc->replaceAllUsesWith(Repl);\n\tMadeChanges = true;\n      }\n    }\n    return BB;\n  } else {                                 \/\/ Otherwise the block is dead...\n    BasicBlock *ReturnBB = 0;              \/\/ Default to nothing live down here\n    \n    \/\/ Recursively traverse successors of this basic block.  \n    cfg::succ_iterator SI = cfg::succ_begin(BB), SE = cfg::succ_end(BB);\n    for (; SI != SE; ++SI) {\n      BasicBlock *RetBB = fixupCFG(*SI, VisitedBlocks, AliveBlocks);\n      if (RetBB) {\n\tassert(ReturnBB == 0 && \"One one live child allowed!\");\n\tReturnBB = RetBB;\n      }\n    }\n    return ReturnBB;                       \/\/ Return the result of traversal\n  }\n}\n\n\n\n\/\/ DoADCE - Execute the Agressive Dead Code Elimination Algorithm\n\/\/\nbool opt::DoADCE(Method *M) {\n  if (M->isExternal()) return false;\n  ADCE DCE(M);\n  return DCE.doADCE();\n}\n<commit_msg>ADCE is broken but at least we know why<commit_after>\/\/===- ADCE.cpp - Code to perform agressive dead code elimination ---------===\/\/\n\/\/\n\/\/ This file implements \"agressive\" dead code elimination.  ADCE is DCe where\n\/\/ values are assumed to be dead until proven otherwise.  This is similar to \n\/\/ SCCP, except applied to the liveness of values.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Optimizations\/DCE.h\"\n#include \"llvm\/Instruction.h\"\n#include \"llvm\/Type.h\"\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Support\/STLExtras.h\"\n#include \"llvm\/Analysis\/Writer.h\"\n#include \"llvm\/CFG.h\"\n#include \"llvm\/iTerminators.h\"\n#include <set>\n#include <algorithm>\n\n#define DEBUG_ADCE 1\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ADCE Class\n\/\/\n\/\/ This class does all of the work of Agressive Dead Code Elimination.\n\/\/ It's public interface consists of a constructor and a doADCE() method.\n\/\/\nclass ADCE {\n  Method *M;                            \/\/ The method that we are working on...\n  vector<Instruction*>   WorkList;      \/\/ Instructions that just became live\n  set<Instruction*>      LiveSet;       \/\/ The set of live instructions\n  bool MadeChanges;\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/ The public interface for this class\n  \/\/\npublic:\n  \/\/ ADCE Ctor - Save the method to operate on...\n  inline ADCE(Method *m) : M(m), MadeChanges(false) {}\n\n  \/\/ doADCE() - Run the Agressive Dead Code Elimination algorithm, returning\n  \/\/ true if the method was modified.\n  bool doADCE();\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/ The implementation of this class\n  \/\/\nprivate:\n  inline void markInstructionLive(Instruction *I) {\n    if (LiveSet.count(I)) return;\n#ifdef DEBUG_ADCE\n    cerr << \"Insn Live: \" << I;\n#endif\n    LiveSet.insert(I);\n    WorkList.push_back(I);\n  }\n\n  inline void markTerminatorLive(const BasicBlock *BB) {\n#ifdef DEBUG_ADCE\n    cerr << \"Terminat Live: \" << BB->getTerminator();\n#endif\n    markInstructionLive((Instruction*)BB->getTerminator());\n  }\n\n  \/\/ fixupCFG - Walk the CFG in depth first order, eliminating references to \n  \/\/ dead blocks.\n  \/\/\n  BasicBlock *fixupCFG(BasicBlock *Head, set<BasicBlock*> &VisitedBlocks,\n\t\t       const set<BasicBlock*> &AliveBlocks);\n};\n\n\n\n\/\/ doADCE() - Run the Agressive Dead Code Elimination algorithm, returning\n\/\/ true if the method was modified.\n\/\/\nbool ADCE::doADCE() {\n  \/\/ Compute the control dependence graph...  Note that this has a side effect\n  \/\/ on the CFG: a new return bb is added and all returns are merged here.\n  \/\/\n  cfg::DominanceFrontier CDG(cfg::DominatorSet(M, true));\n\n#ifdef DEBUG_ADCE\n  cerr << \"Method: \" << M;\n#endif\n\n  \/\/ Iterate over all of the instructions in the method, eliminating trivially\n  \/\/ dead instructions, and marking instructions live that are known to be \n  \/\/ needed.  Perform the walk in depth first order so that we avoid marking any\n  \/\/ instructions live in basic blocks that are unreachable.  These blocks will\n  \/\/ be eliminated later, along with the instructions inside.\n  \/\/\n  for (cfg::df_iterator BBI = cfg::df_begin(M), BBE = cfg::df_end(M);\n       BBI != BBE; ++BBI) {\n    BasicBlock *BB = *BBI;\n    for (BasicBlock::iterator II = BB->begin(), EI = BB->end(); II != EI; ) {\n      Instruction *I = *II;\n\n      if (I->hasSideEffects() || I->getOpcode() == Instruction::Ret) {\n\tmarkInstructionLive(I);\n      } else {\n\t\/\/ Check to see if anything is trivially dead\n\tif (I->use_size() == 0 && I->getType() != Type::VoidTy) {\n\t  \/\/ Remove the instruction from it's basic block...\n\t  delete BB->getInstList().remove(II);\n\t  MadeChanges = true;\n\t  continue;  \/\/ Don't increment the iterator past the current slot\n\t}\n      }\n\n      ++II;  \/\/ Increment the inst iterator if the inst wasn't deleted\n    }\n  }\n\n#ifdef DEBUG_ADCE\n  cerr << \"Processing work list\\n\";\n#endif\n\n  \/\/ AliveBlocks - Set of basic blocks that we know have instructions that are\n  \/\/ alive in them...\n  \/\/\n  set<BasicBlock*> AliveBlocks;\n\n  \/\/ Process the work list of instructions that just became live... if they\n  \/\/ became live, then that means that all of their operands are neccesary as\n  \/\/ well... make them live as well.\n  \/\/\n  while (!WorkList.empty()) {\n    Instruction *I = WorkList.back(); \/\/ Get an instruction that became live...\n    WorkList.pop_back();\n\n    BasicBlock *BB = I->getParent();\n    if (AliveBlocks.count(BB) == 0) {   \/\/ Basic block not alive yet...\n      \/\/ Mark the basic block as being newly ALIVE... and mark all branches that\n      \/\/ this block is control dependant on as being alive also...\n      \/\/\n      AliveBlocks.insert(BB);   \/\/ Block is now ALIVE!\n      cfg::DominanceFrontier::const_iterator It = CDG.find(BB);\n      if (It != CDG.end()) {\n\t\/\/ Get the blocks that this node is control dependant on...\n\tconst cfg::DominanceFrontier::DomSetType &CDB = It->second;\n\tfor_each(CDB.begin(), CDB.end(),   \/\/ Mark all their terminators as live\n\t\t bind_obj(this, &ADCE::markTerminatorLive));\n      }\n\n      \/\/ If this basic block is live, then the terminator must be as well!\n      markTerminatorLive(BB);\n    }\n\n    \/\/ Loop over all of the operands of the live instruction, making sure that\n    \/\/ they are known to be alive as well...\n    \/\/\n    for (unsigned op = 0, End = I->getNumOperands(); op != End; ++op) {\n      if (Instruction *Operand = I->getOperand(op)->castInstruction())\n\tmarkInstructionLive(Operand);\n    }\n  }\n\n#ifdef DEBUG_ADCE\n  cerr << \"Current Method: X = Live\\n\";\n  for (Method::inst_iterator IL = M->inst_begin(); IL != M->inst_end(); ++IL) {\n    if (LiveSet.count(*IL)) cerr << \"X \";\n    cerr << *IL;\n  }\n#endif\n\n  \/\/ After the worklist is processed, recursively walk the CFG in depth first\n  \/\/ order, patching up references to dead blocks...\n  \/\/\n  set<BasicBlock*> VisitedBlocks;\n  BasicBlock *EntryBlock = fixupCFG(M->front(), VisitedBlocks, AliveBlocks);\n  if (EntryBlock && EntryBlock != M->front()) {\n    if (EntryBlock->front()->isPHINode()) {\n      \/\/ Cannot make the first block be a block with a PHI node in it! Instead,\n      \/\/ strip the first basic block of the method to contain no instructions,\n      \/\/ then add a simple branch to the \"real\" entry node...\n      \/\/\n      BasicBlock *E = M->front();\n      if (!E->front()->isTerminator() ||   \/\/ Check for an actual change...\n\t  ((TerminatorInst*)E->front())->getNumSuccessors() != 1 ||\n\t  ((TerminatorInst*)E->front())->getSuccessor(0) != EntryBlock) {\n\tE->getInstList().delete_all();      \/\/ Delete all instructions in block\n\tE->getInstList().push_back(new BranchInst(EntryBlock));\n\tMadeChanges = true;\n      }\n      AliveBlocks.insert(E);\n\n      \/\/ Next we need to change any PHI nodes in the entry block to refer to the\n      \/\/ new predecessor node...\n\n\n    } else {\n      \/\/ We need to move the new entry block to be the first bb of the method.\n      Method::iterator EBI = find(M->begin(), M->end(), EntryBlock);\n      swap(*EBI, *M->begin());  \/\/ Exchange old location with start of method\n      MadeChanges = true;\n    }\n  }\n\n  \/\/ Now go through and tell dead blocks to drop all of their references so they\n  \/\/ can be safely deleted.\n  \/\/\n  for (Method::iterator BI = M->begin(), BE = M->end(); BI != BE; ++BI) {\n    BasicBlock *BB = *BI;\n    if (!AliveBlocks.count(BB)) {\n      BB->dropAllReferences();\n    }\n  }\n\n  \/\/ Now loop through all of the blocks and delete them.  We can safely do this\n  \/\/ now because we know that there are no references to dead blocks (because\n  \/\/ they have dropped all of their references...\n  \/\/\n  for (Method::iterator BI = M->begin(); BI != M->end();) {\n    if (!AliveBlocks.count(*BI)) {\n      delete M->getBasicBlocks().remove(BI);\n      MadeChanges = true;\n      continue;                                     \/\/ Don't increment iterator\n    }\n    ++BI;                                           \/\/ Increment iterator...\n  }\n\n  return MadeChanges;\n}\n\n\n\/\/ fixupCFG - Walk the CFG in depth first order, eliminating references to \n\/\/ dead blocks:\n\/\/  If the BB is alive (in AliveBlocks):\n\/\/   1. Eliminate all dead instructions in the BB\n\/\/   2. Recursively traverse all of the successors of the BB:\n\/\/      - If the returned successor is non-null, update our terminator to\n\/\/         reference the returned BB\n\/\/   3. Return 0 (no update needed)\n\/\/\n\/\/  If the BB is dead (not in AliveBlocks):\n\/\/   1. Add the BB to the dead set\n\/\/   2. Recursively traverse all of the successors of the block:\n\/\/      - Only one shall return a nonnull value (or else this block should have\n\/\/        been in the alive set).\n\/\/   3. Return the nonnull child, or 0 if no non-null children.\n\/\/\nBasicBlock *ADCE::fixupCFG(BasicBlock *BB, set<BasicBlock*> &VisitedBlocks,\n\t\t\t   const set<BasicBlock*> &AliveBlocks) {\n  if (VisitedBlocks.count(BB)) return 0;   \/\/ Revisiting a node? No update.\n  VisitedBlocks.insert(BB);                \/\/ We have now visited this node!\n\n#ifdef DEBUG_ADCE\n  cerr << \"Fixing up BB: \" << BB;\n#endif\n\n  if (AliveBlocks.count(BB)) {             \/\/ Is the block alive?\n    \/\/ Yes it's alive: loop through and eliminate all dead instructions in block\n    for (BasicBlock::iterator II = BB->begin(); II != BB->end()-1; ) {\n      Instruction *I = *II;\n      if (!LiveSet.count(I)) {             \/\/ Is this instruction alive?\n\t\/\/ Nope... remove the instruction from it's basic block...\n\tdelete BB->getInstList().remove(II);\n\tMadeChanges = true;\n\tcontinue;                          \/\/ Don't increment II\n      }\n      ++II;\n    }\n\n    \/\/ Recursively traverse successors of this basic block.  \n    cfg::succ_iterator SI = cfg::succ_begin(BB), SE = cfg::succ_end(BB);\n    for (; SI != SE; ++SI) {\n      BasicBlock *Succ = *SI;\n      BasicBlock *Repl = fixupCFG(Succ, VisitedBlocks, AliveBlocks);\n      if (Repl && Repl != Succ) {          \/\/ We have to replace the successor\n\tSucc->replaceAllUsesWith(Repl);\n\tMadeChanges = true;\n      }\n    }\n    return BB;\n  } else {                                 \/\/ Otherwise the block is dead...\n    BasicBlock *ReturnBB = 0;              \/\/ Default to nothing live down here\n    \n    \/\/ Recursively traverse successors of this basic block.  \n    cfg::succ_iterator SI = cfg::succ_begin(BB), SE = cfg::succ_end(BB);\n    for (; SI != SE; ++SI) {\n      BasicBlock *RetBB = fixupCFG(*SI, VisitedBlocks, AliveBlocks);\n      if (RetBB) {\n\tassert(ReturnBB == 0 && \"One one live child allowed!\");\n\tReturnBB = RetBB;\n      }\n    }\n    return ReturnBB;                       \/\/ Return the result of traversal\n  }\n}\n\n\n\n\/\/ DoADCE - Execute the Agressive Dead Code Elimination Algorithm\n\/\/\nbool opt::DoADCE(Method *M) {\n  if (M->isExternal()) return false;\n  ADCE DCE(M);\n  return DCE.doADCE();\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\/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 kPrerenderExperimentProbability = 50;\n      const base::FieldTrial::Probability kPrerenderControlProbability = 50;\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 kPrerenderExperimentGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerender\",\n                             kPrerenderExperimentProbability);\n      const int kPrerenderControlGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerenderControl\",\n                             kPrerenderControlProbability);\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 == kPrerenderExperimentGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(true);\n        PrerenderManager::SetMode(\n            PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n      } else if (trial_group == kPrerenderControlGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(false);\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>Update prerender field trial in canary from 5% control & 5% experiment to 30% control & 30% experiment<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 kPrerenderExperimentProbability = 300;\n      const base::FieldTrial::Probability kPrerenderControlProbability = 300;\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 kPrerenderExperimentGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerender\",\n                             kPrerenderExperimentProbability);\n      const int kPrerenderControlGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerenderControl\",\n                             kPrerenderControlProbability);\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 == kPrerenderExperimentGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(true);\n        PrerenderManager::SetMode(\n            PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n      } else if (trial_group == kPrerenderControlGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(false);\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>\/\/===- ADCE.cpp - Code to perform aggressive dead code elimination --------===\/\/\n\/\/\n\/\/ This file implements \"aggressive\" dead code elimination.  ADCE is DCe where\n\/\/ values are assumed to be dead until proven otherwise.  This is similar to \n\/\/ SCCP, except applied to the liveness of values.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Transforms\/Utils\/Local.h\"\n#include \"llvm\/Transforms\/Utils\/BasicBlockUtils.h\"\n#include \"llvm\/Type.h\"\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/iTerminators.h\"\n#include \"llvm\/iPHINode.h\"\n#include \"llvm\/Constant.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"Support\/STLExtras.h\"\n#include \"Support\/DepthFirstIterator.h\"\n#include \"Support\/StatisticReporter.h\"\n#include <algorithm>\n#include <iostream>\nusing std::cerr;\nusing std::vector;\n\nstatic Statistic<> NumBlockRemoved(\"adce\\t\\t- Number of basic blocks removed\");\nstatic Statistic<> NumInstRemoved (\"adce\\t\\t- Number of instructions removed\");\n\nnamespace {\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ADCE Class\n\/\/\n\/\/ This class does all of the work of Aggressive Dead Code Elimination.\n\/\/ It's public interface consists of a constructor and a doADCE() method.\n\/\/\nclass ADCE : public FunctionPass {\n  Function *Func;                       \/\/ The function that we are working on\n  std::vector<Instruction*> WorkList;   \/\/ Instructions that just became live\n  std::set<Instruction*>    LiveSet;    \/\/ The set of live instructions\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/ The public interface for this class\n  \/\/\npublic:\n  \/\/ Execute the Aggressive Dead Code Elimination Algorithm\n  \/\/\n  virtual bool runOnFunction(Function &F) {\n    Func = &F;\n    bool Changed = doADCE();\n    assert(WorkList.empty());\n    LiveSet.clear();\n    return Changed;\n  }\n  \/\/ getAnalysisUsage - We require post dominance frontiers (aka Control\n  \/\/ Dependence Graph)\n  virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n    AU.addRequired<PostDominatorTree>();\n    AU.addRequired<PostDominanceFrontier>();\n  }\n\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/ The implementation of this class\n  \/\/\nprivate:\n  \/\/ doADCE() - Run the Aggressive Dead Code Elimination algorithm, returning\n  \/\/ true if the function was modified.\n  \/\/\n  bool doADCE();\n\n  void markBlockAlive(BasicBlock *BB);\n\n\n  \/\/ dropReferencesOfDeadInstructionsInLiveBlock - Loop over all of the\n  \/\/ instructions in the specified basic block, dropping references on\n  \/\/ instructions that are dead according to LiveSet.\n  bool dropReferencesOfDeadInstructionsInLiveBlock(BasicBlock *BB);\n\n  inline void markInstructionLive(Instruction *I) {\n    if (LiveSet.count(I)) return;\n    DEBUG(cerr << \"Insn Live: \" << I);\n    LiveSet.insert(I);\n    WorkList.push_back(I);\n  }\n\n  inline void markTerminatorLive(const BasicBlock *BB) {\n    DEBUG(cerr << \"Terminat Live: \" << BB->getTerminator());\n    markInstructionLive((Instruction*)BB->getTerminator());\n  }\n};\n\n  RegisterOpt<ADCE> X(\"adce\", \"Aggressive Dead Code Elimination\");\n} \/\/ End of anonymous namespace\n\nPass *createAggressiveDCEPass() { return new ADCE(); }\n\nvoid ADCE::markBlockAlive(BasicBlock *BB) {\n  \/\/ Mark the basic block as being newly ALIVE... and mark all branches that\n  \/\/ this block is control dependant on as being alive also...\n  \/\/\n  PostDominanceFrontier &CDG = getAnalysis<PostDominanceFrontier>();\n\n  PostDominanceFrontier::const_iterator It = CDG.find(BB);\n  if (It != CDG.end()) {\n    \/\/ Get the blocks that this node is control dependant on...\n    const PostDominanceFrontier::DomSetType &CDB = It->second;\n    for_each(CDB.begin(), CDB.end(),   \/\/ Mark all their terminators as live\n             bind_obj(this, &ADCE::markTerminatorLive));\n  }\n  \n  \/\/ If this basic block is live, then the terminator must be as well!\n  markTerminatorLive(BB);\n}\n\n\/\/ dropReferencesOfDeadInstructionsInLiveBlock - Loop over all of the\n\/\/ instructions in the specified basic block, dropping references on\n\/\/ instructions that are dead according to LiveSet.\nbool ADCE::dropReferencesOfDeadInstructionsInLiveBlock(BasicBlock *BB) {\n  bool Changed = false;\n  for (BasicBlock::iterator I = BB->begin(), E = --BB->end(); I != E; )\n    if (!LiveSet.count(I)) {              \/\/ Is this instruction alive?\n      I->dropAllReferences();             \/\/ Nope, drop references... \n      if (PHINode *PN = dyn_cast<PHINode>(&*I)) {\n        \/\/ We don't want to leave PHI nodes in the program that have\n        \/\/ #arguments != #predecessors, so we remove them now.\n        \/\/\n        PN->replaceAllUsesWith(Constant::getNullValue(PN->getType()));\n        \n        \/\/ Delete the instruction...\n        I = BB->getInstList().erase(I);\n        Changed = true;\n      } else {\n        ++I;\n      }\n    } else {\n      ++I;\n    }\n  return Changed;\n}\n\n\n\/\/ doADCE() - Run the Aggressive Dead Code Elimination algorithm, returning\n\/\/ true if the function was modified.\n\/\/\nbool ADCE::doADCE() {\n  bool MadeChanges = false;\n\n  \/\/ Iterate over all of the instructions in the function, eliminating trivially\n  \/\/ dead instructions, and marking instructions live that are known to be \n  \/\/ needed.  Perform the walk in depth first order so that we avoid marking any\n  \/\/ instructions live in basic blocks that are unreachable.  These blocks will\n  \/\/ be eliminated later, along with the instructions inside.\n  \/\/\n  for (df_iterator<Function*> BBI = df_begin(Func), BBE = df_end(Func);\n       BBI != BBE; ++BBI) {\n    BasicBlock *BB = *BBI;\n    for (BasicBlock::iterator II = BB->begin(), EI = BB->end(); II != EI; ) {\n      if (II->hasSideEffects() || II->getOpcode() == Instruction::Ret) {\n\tmarkInstructionLive(II);\n        ++II;  \/\/ Increment the inst iterator if the inst wasn't deleted\n      } else if (isInstructionTriviallyDead(II)) {\n        \/\/ Remove the instruction from it's basic block...\n        II = BB->getInstList().erase(II);\n        ++NumInstRemoved;\n        MadeChanges = true;\n      } else {\n        ++II;  \/\/ Increment the inst iterator if the inst wasn't deleted\n      }\n    }\n  }\n\n  DEBUG(cerr << \"Processing work list\\n\");\n\n  \/\/ AliveBlocks - Set of basic blocks that we know have instructions that are\n  \/\/ alive in them...\n  \/\/\n  std::set<BasicBlock*> AliveBlocks;\n\n  \/\/ Process the work list of instructions that just became live... if they\n  \/\/ became live, then that means that all of their operands are neccesary as\n  \/\/ well... make them live as well.\n  \/\/\n  while (!WorkList.empty()) {\n    Instruction *I = WorkList.back(); \/\/ Get an instruction that became live...\n    WorkList.pop_back();\n\n    BasicBlock *BB = I->getParent();\n    if (!AliveBlocks.count(BB)) {     \/\/ Basic block not alive yet...\n      AliveBlocks.insert(BB);         \/\/ Block is now ALIVE!\n      markBlockAlive(BB);             \/\/ Make it so now!\n    }\n\n    \/\/ PHI nodes are a special case, because the incoming values are actually\n    \/\/ defined in the predecessor nodes of this block, meaning that the PHI\n    \/\/ makes the predecessors alive.\n    \/\/\n    if (PHINode *PN = dyn_cast<PHINode>(I))\n      for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI)\n        if (!AliveBlocks.count(*PI)) {\n          AliveBlocks.insert(BB);         \/\/ Block is now ALIVE!\n          markBlockAlive(*PI);\n        }\n\n    \/\/ Loop over all of the operands of the live instruction, making sure that\n    \/\/ they are known to be alive as well...\n    \/\/\n    for (unsigned op = 0, End = I->getNumOperands(); op != End; ++op)\n      if (Instruction *Operand = dyn_cast<Instruction>(I->getOperand(op)))\n\tmarkInstructionLive(Operand);\n  }\n\n  if (DebugFlag) {\n    cerr << \"Current Function: X = Live\\n\";\n    for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I)\n      for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE; ++BI){\n        if (LiveSet.count(BI)) cerr << \"X \";\n        cerr << *BI;\n      }\n  }\n\n  \/\/ Find the first postdominator of the entry node that is alive.  Make it the\n  \/\/ new entry node...\n  \/\/\n  PostDominatorTree &DT = getAnalysis<PostDominatorTree>();\n\n\n  if (AliveBlocks.size() == Func->size()) {  \/\/ No dead blocks?\n    for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I)\n      \/\/ Loop over all of the instructions in the function, telling dead\n      \/\/ instructions to drop their references.  This is so that the next sweep\n      \/\/ over the program can safely delete dead instructions without other dead\n      \/\/ instructions still refering to them.\n      \/\/\n      dropReferencesOfDeadInstructionsInLiveBlock(I);\n    \n  } else {                                   \/\/ If there are some blocks dead...\n    \/\/ Insert a new entry node to eliminate the entry node as a special case.\n    BasicBlock *NewEntry = new BasicBlock();\n    NewEntry->getInstList().push_back(new BranchInst(&Func->front()));\n    Func->getBasicBlockList().push_front(NewEntry);\n    AliveBlocks.insert(NewEntry);    \/\/ This block is always alive!\n    \n    \/\/ Loop over all of the alive blocks in the function.  If any successor\n    \/\/ blocks are not alive, we adjust the outgoing branches to branch to the\n    \/\/ first live postdominator of the live block, adjusting any PHI nodes in\n    \/\/ the block to reflect this.\n    \/\/\n    for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I)\n      if (AliveBlocks.count(I)) {\n        BasicBlock *BB = I;\n        TerminatorInst *TI = BB->getTerminator();\n      \n        \/\/ Loop over all of the successors, looking for ones that are not alive.\n        \/\/ We cannot save the number of successors in the terminator instruction\n        \/\/ here because we may remove them if we don't have a postdominator...\n        \/\/\n        for (unsigned i = 0; i != TI->getNumSuccessors(); ++i)\n          if (!AliveBlocks.count(TI->getSuccessor(i))) {\n            \/\/ Scan up the postdominator tree, looking for the first\n            \/\/ postdominator that is alive, and the last postdominator that is\n            \/\/ dead...\n            \/\/\n            PostDominatorTree::Node *LastNode = DT[TI->getSuccessor(i)];\n\n            \/\/ There is a special case here... if there IS no post-dominator for\n            \/\/ the block we have no owhere to point our branch to.  Instead,\n            \/\/ convert it to a return.  This can only happen if the code\n            \/\/ branched into an infinite loop.  Note that this may not be\n            \/\/ desirable, because we _are_ altering the behavior of the code.\n            \/\/ This is a well known drawback of ADCE, so in the future if we\n            \/\/ choose to revisit the decision, this is where it should be.\n            \/\/\n            if (LastNode == 0) {        \/\/ No postdominator!\n              \/\/ Call RemoveSuccessor to transmogrify the terminator instruction\n              \/\/ to not contain the outgoing branch, or to create a new\n              \/\/ terminator if the form fundementally changes (ie unconditional\n              \/\/ branch to return).  Note that this will change a branch into an\n              \/\/ infinite loop into a return instruction!\n              \/\/\n              RemoveSuccessor(TI, i);\n\n              \/\/ RemoveSuccessor may replace TI... make sure we have a fresh\n              \/\/ pointer... and e variable.\n              \/\/\n              TI = BB->getTerminator();\n\n              \/\/ Rescan this successor...\n              --i;\n            } else {\n              PostDominatorTree::Node *NextNode = LastNode->getIDom();\n\n              while (!AliveBlocks.count(NextNode->getNode())) {\n                LastNode = NextNode;\n                NextNode = NextNode->getIDom();\n              }\n            \n              \/\/ Get the basic blocks that we need...\n              BasicBlock *LastDead = LastNode->getNode();\n              BasicBlock *NextAlive = NextNode->getNode();\n\n              \/\/ Make the conditional branch now go to the next alive block...\n              TI->getSuccessor(i)->removePredecessor(BB);\n              TI->setSuccessor(i, NextAlive);\n\n              \/\/ If there are PHI nodes in NextAlive, we need to add entries to\n              \/\/ the PHI nodes for the new incoming edge.  The incoming values\n              \/\/ should be identical to the incoming values for LastDead.\n              \/\/\n              for (BasicBlock::iterator II = NextAlive->begin();\n                   PHINode *PN = dyn_cast<PHINode>(&*II); ++II) {\n                \/\/ Get the incoming value for LastDead...\n                int OldIdx = PN->getBasicBlockIndex(LastDead);\n                assert(OldIdx != -1 && \"LastDead is not a pred of NextAlive!\");\n                Value *InVal = PN->getIncomingValue(OldIdx);\n                \n                \/\/ Add an incoming value for BB now...\n                PN->addIncoming(InVal, BB);\n              }\n            }\n          }\n\n        \/\/ Now loop over all of the instructions in the basic block, telling\n        \/\/ dead instructions to drop their references.  This is so that the next\n        \/\/ sweep over the program can safely delete dead instructions without\n        \/\/ other dead instructions still refering to them.\n        \/\/\n        dropReferencesOfDeadInstructionsInLiveBlock(BB);\n      }\n  }\n\n  \/\/ Loop over all of the basic blocks in the function, dropping references of\n  \/\/ the dead basic blocks\n  \/\/\n  for (Function::iterator BB = Func->begin(), E = Func->end(); BB != E; ++BB) {\n    if (!AliveBlocks.count(BB)) {\n      \/\/ Remove all outgoing edges from this basic block and convert the\n      \/\/ terminator into a return instruction.\n      vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));\n      \n      if (!Succs.empty()) {\n        \/\/ Loop over all of the successors, removing this block from PHI node\n        \/\/ entries that might be in the block...\n        while (!Succs.empty()) {\n          Succs.back()->removePredecessor(BB);\n          Succs.pop_back();\n        }\n        \n        \/\/ Delete the old terminator instruction...\n        BB->getInstList().pop_back();\n        const Type *RetTy = Func->getReturnType();\n        Instruction *New = new ReturnInst(RetTy != Type::VoidTy ?\n                                          Constant::getNullValue(RetTy) : 0);\n        BB->getInstList().push_back(New);\n      }\n\n      BB->dropAllReferences();\n      ++NumBlockRemoved;\n      MadeChanges = true;\n    }\n  }\n\n  \/\/ Now loop through all of the blocks and delete the dead ones.  We can safely\n  \/\/ do this now because we know that there are no references to dead blocks\n  \/\/ (because they have dropped all of their references...  we also remove dead\n  \/\/ instructions from alive blocks.\n  \/\/\n  for (Function::iterator BI = Func->begin(); BI != Func->end(); )\n    if (!AliveBlocks.count(BI)) {                \/\/ Delete dead blocks...\n      BI = Func->getBasicBlockList().erase(BI);\n    } else {                                     \/\/ Scan alive blocks...\n      for (BasicBlock::iterator II = BI->begin(); II != --BI->end(); )\n        if (!LiveSet.count(II)) {             \/\/ Is this instruction alive?\n          \/\/ Nope... remove the instruction from it's basic block...\n          II = BI->getInstList().erase(II);\n          ++NumInstRemoved;\n          MadeChanges = true;\n        } else {\n          ++II;\n        }\n\n      ++BI;                                           \/\/ Increment iterator...\n    }\n\n  return MadeChanges;\n}\n<commit_msg>Avoid inserting an entry block unless we need it<commit_after>\/\/===- ADCE.cpp - Code to perform aggressive dead code elimination --------===\/\/\n\/\/\n\/\/ This file implements \"aggressive\" dead code elimination.  ADCE is DCe where\n\/\/ values are assumed to be dead until proven otherwise.  This is similar to \n\/\/ SCCP, except applied to the liveness of values.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Transforms\/Utils\/Local.h\"\n#include \"llvm\/Transforms\/Utils\/BasicBlockUtils.h\"\n#include \"llvm\/Type.h\"\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/iTerminators.h\"\n#include \"llvm\/iPHINode.h\"\n#include \"llvm\/Constant.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"Support\/STLExtras.h\"\n#include \"Support\/DepthFirstIterator.h\"\n#include \"Support\/StatisticReporter.h\"\n#include <algorithm>\n#include <iostream>\nusing std::cerr;\nusing std::vector;\n\nstatic Statistic<> NumBlockRemoved(\"adce\\t\\t- Number of basic blocks removed\");\nstatic Statistic<> NumInstRemoved (\"adce\\t\\t- Number of instructions removed\");\n\nnamespace {\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ADCE Class\n\/\/\n\/\/ This class does all of the work of Aggressive Dead Code Elimination.\n\/\/ It's public interface consists of a constructor and a doADCE() method.\n\/\/\nclass ADCE : public FunctionPass {\n  Function *Func;                       \/\/ The function that we are working on\n  std::vector<Instruction*> WorkList;   \/\/ Instructions that just became live\n  std::set<Instruction*>    LiveSet;    \/\/ The set of live instructions\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/ The public interface for this class\n  \/\/\npublic:\n  \/\/ Execute the Aggressive Dead Code Elimination Algorithm\n  \/\/\n  virtual bool runOnFunction(Function &F) {\n    Func = &F;\n    bool Changed = doADCE();\n    assert(WorkList.empty());\n    LiveSet.clear();\n    return Changed;\n  }\n  \/\/ getAnalysisUsage - We require post dominance frontiers (aka Control\n  \/\/ Dependence Graph)\n  virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n    AU.addRequired<PostDominatorTree>();\n    AU.addRequired<PostDominanceFrontier>();\n  }\n\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/ The implementation of this class\n  \/\/\nprivate:\n  \/\/ doADCE() - Run the Aggressive Dead Code Elimination algorithm, returning\n  \/\/ true if the function was modified.\n  \/\/\n  bool doADCE();\n\n  void markBlockAlive(BasicBlock *BB);\n\n\n  \/\/ dropReferencesOfDeadInstructionsInLiveBlock - Loop over all of the\n  \/\/ instructions in the specified basic block, dropping references on\n  \/\/ instructions that are dead according to LiveSet.\n  bool dropReferencesOfDeadInstructionsInLiveBlock(BasicBlock *BB);\n\n  inline void markInstructionLive(Instruction *I) {\n    if (LiveSet.count(I)) return;\n    DEBUG(cerr << \"Insn Live: \" << I);\n    LiveSet.insert(I);\n    WorkList.push_back(I);\n  }\n\n  inline void markTerminatorLive(const BasicBlock *BB) {\n    DEBUG(cerr << \"Terminat Live: \" << BB->getTerminator());\n    markInstructionLive((Instruction*)BB->getTerminator());\n  }\n};\n\n  RegisterOpt<ADCE> X(\"adce\", \"Aggressive Dead Code Elimination\");\n} \/\/ End of anonymous namespace\n\nPass *createAggressiveDCEPass() { return new ADCE(); }\n\nvoid ADCE::markBlockAlive(BasicBlock *BB) {\n  \/\/ Mark the basic block as being newly ALIVE... and mark all branches that\n  \/\/ this block is control dependant on as being alive also...\n  \/\/\n  PostDominanceFrontier &CDG = getAnalysis<PostDominanceFrontier>();\n\n  PostDominanceFrontier::const_iterator It = CDG.find(BB);\n  if (It != CDG.end()) {\n    \/\/ Get the blocks that this node is control dependant on...\n    const PostDominanceFrontier::DomSetType &CDB = It->second;\n    for_each(CDB.begin(), CDB.end(),   \/\/ Mark all their terminators as live\n             bind_obj(this, &ADCE::markTerminatorLive));\n  }\n  \n  \/\/ If this basic block is live, then the terminator must be as well!\n  markTerminatorLive(BB);\n}\n\n\/\/ dropReferencesOfDeadInstructionsInLiveBlock - Loop over all of the\n\/\/ instructions in the specified basic block, dropping references on\n\/\/ instructions that are dead according to LiveSet.\nbool ADCE::dropReferencesOfDeadInstructionsInLiveBlock(BasicBlock *BB) {\n  bool Changed = false;\n  for (BasicBlock::iterator I = BB->begin(), E = --BB->end(); I != E; )\n    if (!LiveSet.count(I)) {              \/\/ Is this instruction alive?\n      I->dropAllReferences();             \/\/ Nope, drop references... \n      if (PHINode *PN = dyn_cast<PHINode>(&*I)) {\n        \/\/ We don't want to leave PHI nodes in the program that have\n        \/\/ #arguments != #predecessors, so we remove them now.\n        \/\/\n        PN->replaceAllUsesWith(Constant::getNullValue(PN->getType()));\n        \n        \/\/ Delete the instruction...\n        I = BB->getInstList().erase(I);\n        Changed = true;\n      } else {\n        ++I;\n      }\n    } else {\n      ++I;\n    }\n  return Changed;\n}\n\n\n\/\/ doADCE() - Run the Aggressive Dead Code Elimination algorithm, returning\n\/\/ true if the function was modified.\n\/\/\nbool ADCE::doADCE() {\n  bool MadeChanges = false;\n\n  \/\/ Iterate over all of the instructions in the function, eliminating trivially\n  \/\/ dead instructions, and marking instructions live that are known to be \n  \/\/ needed.  Perform the walk in depth first order so that we avoid marking any\n  \/\/ instructions live in basic blocks that are unreachable.  These blocks will\n  \/\/ be eliminated later, along with the instructions inside.\n  \/\/\n  for (df_iterator<Function*> BBI = df_begin(Func), BBE = df_end(Func);\n       BBI != BBE; ++BBI) {\n    BasicBlock *BB = *BBI;\n    for (BasicBlock::iterator II = BB->begin(), EI = BB->end(); II != EI; ) {\n      if (II->hasSideEffects() || II->getOpcode() == Instruction::Ret) {\n\tmarkInstructionLive(II);\n        ++II;  \/\/ Increment the inst iterator if the inst wasn't deleted\n      } else if (isInstructionTriviallyDead(II)) {\n        \/\/ Remove the instruction from it's basic block...\n        II = BB->getInstList().erase(II);\n        ++NumInstRemoved;\n        MadeChanges = true;\n      } else {\n        ++II;  \/\/ Increment the inst iterator if the inst wasn't deleted\n      }\n    }\n  }\n\n  DEBUG(cerr << \"Processing work list\\n\");\n\n  \/\/ AliveBlocks - Set of basic blocks that we know have instructions that are\n  \/\/ alive in them...\n  \/\/\n  std::set<BasicBlock*> AliveBlocks;\n\n  \/\/ Process the work list of instructions that just became live... if they\n  \/\/ became live, then that means that all of their operands are neccesary as\n  \/\/ well... make them live as well.\n  \/\/\n  while (!WorkList.empty()) {\n    Instruction *I = WorkList.back(); \/\/ Get an instruction that became live...\n    WorkList.pop_back();\n\n    BasicBlock *BB = I->getParent();\n    if (!AliveBlocks.count(BB)) {     \/\/ Basic block not alive yet...\n      AliveBlocks.insert(BB);         \/\/ Block is now ALIVE!\n      markBlockAlive(BB);             \/\/ Make it so now!\n    }\n\n    \/\/ PHI nodes are a special case, because the incoming values are actually\n    \/\/ defined in the predecessor nodes of this block, meaning that the PHI\n    \/\/ makes the predecessors alive.\n    \/\/\n    if (PHINode *PN = dyn_cast<PHINode>(I))\n      for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI)\n        if (!AliveBlocks.count(*PI)) {\n          AliveBlocks.insert(BB);         \/\/ Block is now ALIVE!\n          markBlockAlive(*PI);\n        }\n\n    \/\/ Loop over all of the operands of the live instruction, making sure that\n    \/\/ they are known to be alive as well...\n    \/\/\n    for (unsigned op = 0, End = I->getNumOperands(); op != End; ++op)\n      if (Instruction *Operand = dyn_cast<Instruction>(I->getOperand(op)))\n\tmarkInstructionLive(Operand);\n  }\n\n  if (DebugFlag) {\n    cerr << \"Current Function: X = Live\\n\";\n    for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I)\n      for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE; ++BI){\n        if (LiveSet.count(BI)) cerr << \"X \";\n        cerr << *BI;\n      }\n  }\n\n  \/\/ Find the first postdominator of the entry node that is alive.  Make it the\n  \/\/ new entry node...\n  \/\/\n  PostDominatorTree &DT = getAnalysis<PostDominatorTree>();\n\n\n  if (AliveBlocks.size() == Func->size()) {  \/\/ No dead blocks?\n    for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I)\n      \/\/ Loop over all of the instructions in the function, telling dead\n      \/\/ instructions to drop their references.  This is so that the next sweep\n      \/\/ over the program can safely delete dead instructions without other dead\n      \/\/ instructions still refering to them.\n      \/\/\n      dropReferencesOfDeadInstructionsInLiveBlock(I);\n    \n  } else {                                   \/\/ If there are some blocks dead...\n    \/\/ If the entry node is dead, insert a new entry node to eliminate the entry\n    \/\/ node as a special case.\n    \/\/\n    if (!AliveBlocks.count(&Func->front())) {\n      BasicBlock *NewEntry = new BasicBlock();\n      NewEntry->getInstList().push_back(new BranchInst(&Func->front()));\n      Func->getBasicBlockList().push_front(NewEntry);\n      AliveBlocks.insert(NewEntry);    \/\/ This block is always alive!\n    }\n    \n    \/\/ Loop over all of the alive blocks in the function.  If any successor\n    \/\/ blocks are not alive, we adjust the outgoing branches to branch to the\n    \/\/ first live postdominator of the live block, adjusting any PHI nodes in\n    \/\/ the block to reflect this.\n    \/\/\n    for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I)\n      if (AliveBlocks.count(I)) {\n        BasicBlock *BB = I;\n        TerminatorInst *TI = BB->getTerminator();\n      \n        \/\/ Loop over all of the successors, looking for ones that are not alive.\n        \/\/ We cannot save the number of successors in the terminator instruction\n        \/\/ here because we may remove them if we don't have a postdominator...\n        \/\/\n        for (unsigned i = 0; i != TI->getNumSuccessors(); ++i)\n          if (!AliveBlocks.count(TI->getSuccessor(i))) {\n            \/\/ Scan up the postdominator tree, looking for the first\n            \/\/ postdominator that is alive, and the last postdominator that is\n            \/\/ dead...\n            \/\/\n            PostDominatorTree::Node *LastNode = DT[TI->getSuccessor(i)];\n\n            \/\/ There is a special case here... if there IS no post-dominator for\n            \/\/ the block we have no owhere to point our branch to.  Instead,\n            \/\/ convert it to a return.  This can only happen if the code\n            \/\/ branched into an infinite loop.  Note that this may not be\n            \/\/ desirable, because we _are_ altering the behavior of the code.\n            \/\/ This is a well known drawback of ADCE, so in the future if we\n            \/\/ choose to revisit the decision, this is where it should be.\n            \/\/\n            if (LastNode == 0) {        \/\/ No postdominator!\n              \/\/ Call RemoveSuccessor to transmogrify the terminator instruction\n              \/\/ to not contain the outgoing branch, or to create a new\n              \/\/ terminator if the form fundementally changes (ie unconditional\n              \/\/ branch to return).  Note that this will change a branch into an\n              \/\/ infinite loop into a return instruction!\n              \/\/\n              RemoveSuccessor(TI, i);\n\n              \/\/ RemoveSuccessor may replace TI... make sure we have a fresh\n              \/\/ pointer... and e variable.\n              \/\/\n              TI = BB->getTerminator();\n\n              \/\/ Rescan this successor...\n              --i;\n            } else {\n              PostDominatorTree::Node *NextNode = LastNode->getIDom();\n\n              while (!AliveBlocks.count(NextNode->getNode())) {\n                LastNode = NextNode;\n                NextNode = NextNode->getIDom();\n              }\n            \n              \/\/ Get the basic blocks that we need...\n              BasicBlock *LastDead = LastNode->getNode();\n              BasicBlock *NextAlive = NextNode->getNode();\n\n              \/\/ Make the conditional branch now go to the next alive block...\n              TI->getSuccessor(i)->removePredecessor(BB);\n              TI->setSuccessor(i, NextAlive);\n\n              \/\/ If there are PHI nodes in NextAlive, we need to add entries to\n              \/\/ the PHI nodes for the new incoming edge.  The incoming values\n              \/\/ should be identical to the incoming values for LastDead.\n              \/\/\n              for (BasicBlock::iterator II = NextAlive->begin();\n                   PHINode *PN = dyn_cast<PHINode>(&*II); ++II) {\n                \/\/ Get the incoming value for LastDead...\n                int OldIdx = PN->getBasicBlockIndex(LastDead);\n                assert(OldIdx != -1 && \"LastDead is not a pred of NextAlive!\");\n                Value *InVal = PN->getIncomingValue(OldIdx);\n                \n                \/\/ Add an incoming value for BB now...\n                PN->addIncoming(InVal, BB);\n              }\n            }\n          }\n\n        \/\/ Now loop over all of the instructions in the basic block, telling\n        \/\/ dead instructions to drop their references.  This is so that the next\n        \/\/ sweep over the program can safely delete dead instructions without\n        \/\/ other dead instructions still refering to them.\n        \/\/\n        dropReferencesOfDeadInstructionsInLiveBlock(BB);\n      }\n  }\n\n  \/\/ Loop over all of the basic blocks in the function, dropping references of\n  \/\/ the dead basic blocks\n  \/\/\n  for (Function::iterator BB = Func->begin(), E = Func->end(); BB != E; ++BB) {\n    if (!AliveBlocks.count(BB)) {\n      \/\/ Remove all outgoing edges from this basic block and convert the\n      \/\/ terminator into a return instruction.\n      vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));\n      \n      if (!Succs.empty()) {\n        \/\/ Loop over all of the successors, removing this block from PHI node\n        \/\/ entries that might be in the block...\n        while (!Succs.empty()) {\n          Succs.back()->removePredecessor(BB);\n          Succs.pop_back();\n        }\n        \n        \/\/ Delete the old terminator instruction...\n        BB->getInstList().pop_back();\n        const Type *RetTy = Func->getReturnType();\n        Instruction *New = new ReturnInst(RetTy != Type::VoidTy ?\n                                          Constant::getNullValue(RetTy) : 0);\n        BB->getInstList().push_back(New);\n      }\n\n      BB->dropAllReferences();\n      ++NumBlockRemoved;\n      MadeChanges = true;\n    }\n  }\n\n  \/\/ Now loop through all of the blocks and delete the dead ones.  We can safely\n  \/\/ do this now because we know that there are no references to dead blocks\n  \/\/ (because they have dropped all of their references...  we also remove dead\n  \/\/ instructions from alive blocks.\n  \/\/\n  for (Function::iterator BI = Func->begin(); BI != Func->end(); )\n    if (!AliveBlocks.count(BI)) {                \/\/ Delete dead blocks...\n      BI = Func->getBasicBlockList().erase(BI);\n    } else {                                     \/\/ Scan alive blocks...\n      for (BasicBlock::iterator II = BI->begin(); II != --BI->end(); )\n        if (!LiveSet.count(II)) {             \/\/ Is this instruction alive?\n          \/\/ Nope... remove the instruction from it's basic block...\n          II = BI->getInstList().erase(II);\n          ++NumInstRemoved;\n          MadeChanges = true;\n        } else {\n          ++II;\n        }\n\n      ++BI;                                           \/\/ Increment iterator...\n    }\n\n  return MadeChanges;\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\/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 kPrerenderExperimentProbability = 50;\n      const base::FieldTrial::Probability kPrerenderControlProbability = 50;\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 kPrerenderExperimentGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerender\",\n                             kPrerenderExperimentProbability);\n      const int kPrerenderControlGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerenderControl\",\n                             kPrerenderControlProbability);\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 == kPrerenderExperimentGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(true);\n        PrerenderManager::SetMode(\n            PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n      } else if (trial_group == kPrerenderControlGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(false);\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>Update prerender field trial in canary from 5% control & 5% experiment to 30% control & 30% experiment<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 kPrerenderExperimentProbability = 300;\n      const base::FieldTrial::Probability kPrerenderControlProbability = 300;\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 kPrerenderExperimentGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerender\",\n                             kPrerenderExperimentProbability);\n      const int kPrerenderControlGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerenderControl\",\n                             kPrerenderControlProbability);\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 == kPrerenderExperimentGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(true);\n        PrerenderManager::SetMode(\n            PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n      } else if (trial_group == kPrerenderControlGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(false);\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>\/\/===-- GCSE.cpp - SSA based Global Common Subexpr Elimination ------------===\/\/\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 pass is designed to be a very quick global transformation that\n\/\/ eliminates global common subexpressions from a function.  It does this by\n\/\/ using an existing value numbering implementation to identify the common\n\/\/ subexpressions, eliminating them when possible.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/iMemory.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/Type.h\"\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Analysis\/ValueNumbering.h\"\n#include \"llvm\/Support\/InstIterator.h\"\n#include \"Support\/Statistic.h\"\n#include \"Support\/Debug.h\"\n#include <algorithm>\nusing namespace llvm;\n\nnamespace {\n  Statistic<> NumInstRemoved(\"gcse\", \"Number of instructions removed\");\n  Statistic<> NumLoadRemoved(\"gcse\", \"Number of loads removed\");\n  Statistic<> NumCallRemoved(\"gcse\", \"Number of calls removed\");\n  Statistic<> NumNonInsts   (\"gcse\", \"Number of instructions removed due \"\n                             \"to non-instruction values\");\n\n  class GCSE : public FunctionPass {\n    std::set<Instruction*>  WorkList;\n    DominatorSet           *DomSetInfo;\n    ValueNumbering         *VN;\n  public:\n    virtual bool runOnFunction(Function &F);\n\n  private:\n    bool EliminateRedundancies(Instruction *I,std::vector<Value*> &EqualValues);\n    Instruction *EliminateCSE(Instruction *I, Instruction *Other);\n    void ReplaceInstWithInst(Instruction *First, BasicBlock::iterator SI);\n\n    \/\/ This transformation requires dominator and immediate dominator info\n    virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n      AU.setPreservesCFG();\n      AU.addRequired<DominatorSet>();\n      AU.addRequired<ImmediateDominators>();\n      AU.addRequired<ValueNumbering>();\n    }\n  };\n\n  RegisterOpt<GCSE> X(\"gcse\", \"Global Common Subexpression Elimination\");\n}\n\n\/\/ createGCSEPass - The public interface to this file...\nFunctionPass *llvm::createGCSEPass() { return new GCSE(); }\n\n\/\/ GCSE::runOnFunction - This is the main transformation entry point for a\n\/\/ function.\n\/\/\nbool GCSE::runOnFunction(Function &F) {\n  bool Changed = false;\n\n  \/\/ Get pointers to the analysis results that we will be using...\n  DomSetInfo = &getAnalysis<DominatorSet>();\n  VN = &getAnalysis<ValueNumbering>();\n\n  \/\/ Step #1: Add all instructions in the function to the worklist for\n  \/\/ processing.  All of the instructions are considered to be our\n  \/\/ subexpressions to eliminate if possible.\n  \/\/\n  WorkList.insert(inst_begin(F), inst_end(F));\n\n  \/\/ Step #2: WorkList processing.  Iterate through all of the instructions,\n  \/\/ checking to see if there are any additionally defined subexpressions in the\n  \/\/ program.  If so, eliminate them!\n  \/\/\n  while (!WorkList.empty()) {\n    Instruction &I = **WorkList.begin(); \/\/ Get an instruction from the worklist\n    WorkList.erase(WorkList.begin());\n\n    \/\/ If this instruction computes a value, try to fold together common\n    \/\/ instructions that compute it.\n    \/\/\n    if (I.getType() != Type::VoidTy) {\n      std::vector<Value*> EqualValues;\n      VN->getEqualNumberNodes(&I, EqualValues);\n\n      if (!EqualValues.empty())\n        Changed |= EliminateRedundancies(&I, EqualValues);\n    }\n  }\n\n  \/\/ When the worklist is empty, return whether or not we changed anything...\n  return Changed;\n}\n\nbool GCSE::EliminateRedundancies(Instruction *I,\n                                 std::vector<Value*> &EqualValues) {\n  \/\/ If the EqualValues set contains any non-instruction values, then we know\n  \/\/ that all of the instructions can be replaced with the non-instruction value\n  \/\/ because it is guaranteed to dominate all of the instructions in the\n  \/\/ function.  We only have to do hard work if all we have are instructions.\n  \/\/\n  for (unsigned i = 0, e = EqualValues.size(); i != e; ++i)\n    if (!isa<Instruction>(EqualValues[i])) {\n      \/\/ Found a non-instruction.  Replace all instructions with the\n      \/\/ non-instruction.\n      \/\/\n      Value *Replacement = EqualValues[i];\n\n      \/\/ Make sure we get I as well...\n      EqualValues[i] = I;\n\n      \/\/ Replace all instructions with the Replacement value.\n      for (i = 0; i != e; ++i)\n        if (Instruction *I = dyn_cast<Instruction>(EqualValues[i])) {\n          \/\/ Change all users of I to use Replacement.\n          I->replaceAllUsesWith(Replacement);\n\n          if (isa<LoadInst>(I))\n            ++NumLoadRemoved; \/\/ Keep track of loads eliminated\n          if (isa<CallInst>(I))\n            ++NumCallRemoved; \/\/ Keep track of calls eliminated\n          ++NumInstRemoved;   \/\/ Keep track of number of instructions eliminated\n          ++NumNonInsts;      \/\/ Keep track of number of insts repl with values\n\n          \/\/ Erase the instruction from the program.\n          I->getParent()->getInstList().erase(I);\n          WorkList.erase(I);\n        }\n      \n      return true;\n    }\n  \n  \/\/ Remove duplicate entries from EqualValues...\n  std::sort(EqualValues.begin(), EqualValues.end());\n  EqualValues.erase(std::unique(EqualValues.begin(), EqualValues.end()),\n                    EqualValues.end());\n\n  \/\/ From this point on, EqualValues is logically a vector of instructions.\n  \/\/\n  bool Changed = false;\n  EqualValues.push_back(I); \/\/ Make sure I is included...\n  while (EqualValues.size() > 1) {\n    \/\/ FIXME, this could be done better than simple iteration!\n    Instruction *Test = cast<Instruction>(EqualValues.back());\n    EqualValues.pop_back();\n    \n    for (unsigned i = 0, e = EqualValues.size(); i != e; ++i)\n      if (Instruction *Ret = EliminateCSE(Test,\n                                          cast<Instruction>(EqualValues[i]))) {\n        if (Ret == Test)          \/\/ Eliminated EqualValues[i]\n          EqualValues[i] = Test;  \/\/ Make sure that we reprocess I at some point\n        Changed = true;\n        break;\n      }\n  }\n  return Changed;\n}\n\n\n\/\/ ReplaceInstWithInst - Destroy the instruction pointed to by SI, making all\n\/\/ uses of the instruction use First now instead.\n\/\/\nvoid GCSE::ReplaceInstWithInst(Instruction *First, BasicBlock::iterator SI) {\n  Instruction &Second = *SI;\n\n  DEBUG(std::cerr << \"GCSE: Substituting %\" << First->getName() << \" for: \"\n                  << Second);\n  \n  \/\/cerr << \"DEL \" << (void*)Second << Second;\n\n  \/\/ Add the first instruction back to the worklist\n  WorkList.insert(First);\n\n  \/\/ Add all uses of the second instruction to the worklist\n  for (Value::use_iterator UI = Second.use_begin(), UE = Second.use_end();\n       UI != UE; ++UI)\n    WorkList.insert(cast<Instruction>(*UI));\n    \n  \/\/ Make all users of 'Second' now use 'First'\n  Second.replaceAllUsesWith(First);\n\n  \/\/ Erase the second instruction from the program\n  Second.getParent()->getInstList().erase(SI);\n}\n\n\/\/ EliminateCSE - The two instruction I & Other have been found to be common\n\/\/ subexpressions.  This function is responsible for eliminating one of them,\n\/\/ and for fixing the worklist to be correct.  The instruction that is preserved\n\/\/ is returned from the function if the other is eliminated, otherwise null is\n\/\/ returned.\n\/\/\nInstruction *GCSE::EliminateCSE(Instruction *I, Instruction *Other) {\n  assert(I != Other);\n\n  WorkList.erase(I);\n  WorkList.erase(Other); \/\/ Other may not actually be on the worklist anymore...\n\n  \/\/ Handle the easy case, where both instructions are in the same basic block\n  BasicBlock *BB1 = I->getParent(), *BB2 = Other->getParent();\n  Instruction *Ret = 0;\n\n  if (BB1 == BB2) {\n    \/\/ Eliminate the second occurring instruction.  Add all uses of the second\n    \/\/ instruction to the worklist.\n    \/\/\n    \/\/ Scan the basic block looking for the \"first\" instruction\n    BasicBlock::iterator BI = BB1->begin();\n    while (&*BI != I && &*BI != Other) {\n      ++BI;\n      assert(BI != BB1->end() && \"Instructions not found in parent BB!\");\n    }\n\n    \/\/ Keep track of which instructions occurred first & second\n    Instruction *First = BI;\n    Instruction *Second = I != First ? I : Other; \/\/ Get iterator to second inst\n    BI = Second;\n\n    \/\/ Destroy Second, using First instead.\n    ReplaceInstWithInst(First, BI);\n    Ret = First;\n\n    \/\/ Otherwise, the two instructions are in different basic blocks.  If one\n    \/\/ dominates the other instruction, we can simply use it\n    \/\/\n  } else if (DomSetInfo->dominates(BB1, BB2)) {    \/\/ I dom Other?\n    ReplaceInstWithInst(I, Other);\n    Ret = I;\n  } else if (DomSetInfo->dominates(BB2, BB1)) {    \/\/ Other dom I?\n    ReplaceInstWithInst(Other, I);\n    Ret = Other;\n  } else {\n    \/\/ This code is disabled because it has several problems:\n    \/\/ One, the actual assumption is wrong, as shown by this code:\n    \/\/ int \"test\"(int %X, int %Y) {\n    \/\/         %Z = add int %X, %Y\n    \/\/         ret int %Z\n    \/\/ Unreachable:\n    \/\/         %Q = add int %X, %Y\n    \/\/         ret int %Q\n    \/\/ }\n    \/\/\n    \/\/ Here there are no shared dominators.  Additionally, this had the habit of\n    \/\/ moving computations where they were not always computed.  For example, in\n    \/\/ a case like this:\n    \/\/  if (c) {\n    \/\/    if (d)  ...\n    \/\/    else ... X+Y ...\n    \/\/  } else {\n    \/\/    ... X+Y ...\n    \/\/  }\n    \/\/ \n    \/\/ In this case, the expression would be hoisted to outside the 'if' stmt,\n    \/\/ causing the expression to be evaluated, even for the if (d) path, which\n    \/\/ could cause problems, if, for example, it caused a divide by zero.  In\n    \/\/ general the problem this case is trying to solve is better addressed with\n    \/\/ PRE than GCSE.\n    \/\/\n    return 0;\n  }\n\n  if (isa<LoadInst>(Ret))\n    ++NumLoadRemoved;  \/\/ Keep track of loads eliminated\n  if (isa<CallInst>(Ret))\n    ++NumCallRemoved;  \/\/ Keep track of calls eliminated\n  ++NumInstRemoved;   \/\/ Keep track of number of instructions eliminated\n\n  \/\/ Add all users of Ret to the worklist...\n  for (Value::use_iterator I = Ret->use_begin(), E = Ret->use_end(); I != E;++I)\n    if (Instruction *Inst = dyn_cast<Instruction>(*I))\n      WorkList.insert(Inst);\n\n  return Ret;\n}\n<commit_msg>Be more accurate<commit_after>\/\/===-- GCSE.cpp - SSA based Global Common Subexpr Elimination ------------===\/\/\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 pass is designed to be a very quick global transformation that\n\/\/ eliminates global common subexpressions from a function.  It does this by\n\/\/ using an existing value numbering implementation to identify the common\n\/\/ subexpressions, eliminating them when possible.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/iMemory.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/Type.h\"\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Analysis\/ValueNumbering.h\"\n#include \"llvm\/Support\/InstIterator.h\"\n#include \"Support\/Statistic.h\"\n#include \"Support\/Debug.h\"\n#include <algorithm>\nusing namespace llvm;\n\nnamespace {\n  Statistic<> NumInstRemoved(\"gcse\", \"Number of instructions removed\");\n  Statistic<> NumLoadRemoved(\"gcse\", \"Number of loads removed\");\n  Statistic<> NumCallRemoved(\"gcse\", \"Number of calls removed\");\n  Statistic<> NumNonInsts   (\"gcse\", \"Number of instructions removed due \"\n                             \"to non-instruction values\");\n\n  class GCSE : public FunctionPass {\n    std::set<Instruction*>  WorkList;\n    DominatorSet           *DomSetInfo;\n    ValueNumbering         *VN;\n  public:\n    virtual bool runOnFunction(Function &F);\n\n  private:\n    bool EliminateRedundancies(Instruction *I,std::vector<Value*> &EqualValues);\n    Instruction *EliminateCSE(Instruction *I, Instruction *Other);\n    void ReplaceInstWithInst(Instruction *First, BasicBlock::iterator SI);\n\n    \/\/ This transformation requires dominator and immediate dominator info\n    virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n      AU.setPreservesCFG();\n      AU.addRequired<DominatorSet>();\n      AU.addRequired<ImmediateDominators>();\n      AU.addRequired<ValueNumbering>();\n    }\n  };\n\n  RegisterOpt<GCSE> X(\"gcse\", \"Global Common Subexpression Elimination\");\n}\n\n\/\/ createGCSEPass - The public interface to this file...\nFunctionPass *llvm::createGCSEPass() { return new GCSE(); }\n\n\/\/ GCSE::runOnFunction - This is the main transformation entry point for a\n\/\/ function.\n\/\/\nbool GCSE::runOnFunction(Function &F) {\n  bool Changed = false;\n\n  \/\/ Get pointers to the analysis results that we will be using...\n  DomSetInfo = &getAnalysis<DominatorSet>();\n  VN = &getAnalysis<ValueNumbering>();\n\n  \/\/ Step #1: Add all instructions in the function to the worklist for\n  \/\/ processing.  All of the instructions are considered to be our\n  \/\/ subexpressions to eliminate if possible.\n  \/\/\n  WorkList.insert(inst_begin(F), inst_end(F));\n\n  \/\/ Step #2: WorkList processing.  Iterate through all of the instructions,\n  \/\/ checking to see if there are any additionally defined subexpressions in the\n  \/\/ program.  If so, eliminate them!\n  \/\/\n  while (!WorkList.empty()) {\n    Instruction &I = **WorkList.begin(); \/\/ Get an instruction from the worklist\n    WorkList.erase(WorkList.begin());\n\n    \/\/ If this instruction computes a value, try to fold together common\n    \/\/ instructions that compute it.\n    \/\/\n    if (I.getType() != Type::VoidTy) {\n      std::vector<Value*> EqualValues;\n      VN->getEqualNumberNodes(&I, EqualValues);\n\n      if (!EqualValues.empty())\n        Changed |= EliminateRedundancies(&I, EqualValues);\n    }\n  }\n\n  \/\/ When the worklist is empty, return whether or not we changed anything...\n  return Changed;\n}\n\nbool GCSE::EliminateRedundancies(Instruction *I,\n                                 std::vector<Value*> &EqualValues) {\n  \/\/ If the EqualValues set contains any non-instruction values, then we know\n  \/\/ that all of the instructions can be replaced with the non-instruction value\n  \/\/ because it is guaranteed to dominate all of the instructions in the\n  \/\/ function.  We only have to do hard work if all we have are instructions.\n  \/\/\n  for (unsigned i = 0, e = EqualValues.size(); i != e; ++i)\n    if (!isa<Instruction>(EqualValues[i])) {\n      \/\/ Found a non-instruction.  Replace all instructions with the\n      \/\/ non-instruction.\n      \/\/\n      Value *Replacement = EqualValues[i];\n\n      \/\/ Make sure we get I as well...\n      EqualValues[i] = I;\n\n      \/\/ Replace all instructions with the Replacement value.\n      for (i = 0; i != e; ++i)\n        if (Instruction *I = dyn_cast<Instruction>(EqualValues[i])) {\n          \/\/ Change all users of I to use Replacement.\n          I->replaceAllUsesWith(Replacement);\n\n          if (isa<LoadInst>(I))\n            ++NumLoadRemoved; \/\/ Keep track of loads eliminated\n          if (isa<CallInst>(I))\n            ++NumCallRemoved; \/\/ Keep track of calls eliminated\n          ++NumInstRemoved;   \/\/ Keep track of number of instructions eliminated\n          ++NumNonInsts;      \/\/ Keep track of number of insts repl with values\n\n          \/\/ Erase the instruction from the program.\n          I->getParent()->getInstList().erase(I);\n          WorkList.erase(I);\n        }\n      \n      return true;\n    }\n  \n  \/\/ Remove duplicate entries from EqualValues...\n  std::sort(EqualValues.begin(), EqualValues.end());\n  EqualValues.erase(std::unique(EqualValues.begin(), EqualValues.end()),\n                    EqualValues.end());\n\n  \/\/ From this point on, EqualValues is logically a vector of instructions.\n  \/\/\n  bool Changed = false;\n  EqualValues.push_back(I); \/\/ Make sure I is included...\n  while (EqualValues.size() > 1) {\n    \/\/ FIXME, this could be done better than simple iteration!\n    Instruction *Test = cast<Instruction>(EqualValues.back());\n    EqualValues.pop_back();\n    \n    for (unsigned i = 0, e = EqualValues.size(); i != e; ++i)\n      if (Instruction *Ret = EliminateCSE(Test,\n                                          cast<Instruction>(EqualValues[i]))) {\n        if (Ret == Test)          \/\/ Eliminated EqualValues[i]\n          EqualValues[i] = Test;  \/\/ Make sure that we reprocess I at some point\n        Changed = true;\n        break;\n      }\n  }\n  return Changed;\n}\n\n\n\/\/ ReplaceInstWithInst - Destroy the instruction pointed to by SI, making all\n\/\/ uses of the instruction use First now instead.\n\/\/\nvoid GCSE::ReplaceInstWithInst(Instruction *First, BasicBlock::iterator SI) {\n  Instruction &Second = *SI;\n\n  DEBUG(std::cerr << \"GCSE: Substituting %\" << First->getName() << \" for: \"\n                  << Second);\n  \n  \/\/cerr << \"DEL \" << (void*)Second << Second;\n\n  \/\/ Add the first instruction back to the worklist\n  WorkList.insert(First);\n\n  \/\/ Add all uses of the second instruction to the worklist\n  for (Value::use_iterator UI = Second.use_begin(), UE = Second.use_end();\n       UI != UE; ++UI)\n    WorkList.insert(cast<Instruction>(*UI));\n    \n  \/\/ Make all users of 'Second' now use 'First'\n  Second.replaceAllUsesWith(First);\n\n  \/\/ Erase the second instruction from the program\n  Second.getParent()->getInstList().erase(SI);\n}\n\n\/\/ EliminateCSE - The two instruction I & Other have been found to be common\n\/\/ subexpressions.  This function is responsible for eliminating one of them,\n\/\/ and for fixing the worklist to be correct.  The instruction that is preserved\n\/\/ is returned from the function if the other is eliminated, otherwise null is\n\/\/ returned.\n\/\/\nInstruction *GCSE::EliminateCSE(Instruction *I, Instruction *Other) {\n  assert(I != Other);\n\n  WorkList.erase(I);\n  WorkList.erase(Other); \/\/ Other may not actually be on the worklist anymore...\n\n  \/\/ Handle the easy case, where both instructions are in the same basic block\n  BasicBlock *BB1 = I->getParent(), *BB2 = Other->getParent();\n  Instruction *Ret = 0;\n\n  if (BB1 == BB2) {\n    \/\/ Eliminate the second occurring instruction.  Add all uses of the second\n    \/\/ instruction to the worklist.\n    \/\/\n    \/\/ Scan the basic block looking for the \"first\" instruction\n    BasicBlock::iterator BI = BB1->begin();\n    while (&*BI != I && &*BI != Other) {\n      ++BI;\n      assert(BI != BB1->end() && \"Instructions not found in parent BB!\");\n    }\n\n    \/\/ Keep track of which instructions occurred first & second\n    Instruction *First = BI;\n    Instruction *Second = I != First ? I : Other; \/\/ Get iterator to second inst\n    BI = Second;\n\n    if (isa<LoadInst>(Second))\n      ++NumLoadRemoved;  \/\/ Keep track of loads eliminated\n    if (isa<CallInst>(Second))\n      ++NumCallRemoved;  \/\/ Keep track of calls eliminated\n\n    \/\/ Destroy Second, using First instead.\n    ReplaceInstWithInst(First, BI);\n    Ret = First;\n\n    \/\/ Otherwise, the two instructions are in different basic blocks.  If one\n    \/\/ dominates the other instruction, we can simply use it\n    \/\/\n  } else if (DomSetInfo->dominates(BB1, BB2)) {    \/\/ I dom Other?\n    if (isa<LoadInst>(Other))\n      ++NumLoadRemoved;  \/\/ Keep track of loads eliminated\n    if (isa<CallInst>(Other))\n      ++NumCallRemoved;  \/\/ Keep track of calls eliminated\n\n    ReplaceInstWithInst(I, Other);\n    Ret = I;\n  } else if (DomSetInfo->dominates(BB2, BB1)) {    \/\/ Other dom I?\n    if (isa<LoadInst>(I))\n      ++NumLoadRemoved;  \/\/ Keep track of loads eliminated\n    if (isa<CallInst>(I))\n      ++NumCallRemoved;  \/\/ Keep track of calls eliminated\n\n    ReplaceInstWithInst(Other, I);\n    Ret = Other;\n  } else {\n    \/\/ This code is disabled because it has several problems:\n    \/\/ One, the actual assumption is wrong, as shown by this code:\n    \/\/ int \"test\"(int %X, int %Y) {\n    \/\/         %Z = add int %X, %Y\n    \/\/         ret int %Z\n    \/\/ Unreachable:\n    \/\/         %Q = add int %X, %Y\n    \/\/         ret int %Q\n    \/\/ }\n    \/\/\n    \/\/ Here there are no shared dominators.  Additionally, this had the habit of\n    \/\/ moving computations where they were not always computed.  For example, in\n    \/\/ a case like this:\n    \/\/  if (c) {\n    \/\/    if (d)  ...\n    \/\/    else ... X+Y ...\n    \/\/  } else {\n    \/\/    ... X+Y ...\n    \/\/  }\n    \/\/ \n    \/\/ In this case, the expression would be hoisted to outside the 'if' stmt,\n    \/\/ causing the expression to be evaluated, even for the if (d) path, which\n    \/\/ could cause problems, if, for example, it caused a divide by zero.  In\n    \/\/ general the problem this case is trying to solve is better addressed with\n    \/\/ PRE than GCSE.\n    \/\/\n    return 0;\n  }\n\n  ++NumInstRemoved;   \/\/ Keep track of number of instructions eliminated\n\n  \/\/ Add all users of Ret to the worklist...\n  for (Value::use_iterator I = Ret->use_begin(), E = Ret->use_end(); I != E;++I)\n    if (Instruction *Inst = dyn_cast<Instruction>(*I))\n      WorkList.insert(Inst);\n\n  return Ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- TypeSymbolTable.cpp - Implement the TypeSymbolTable class ---------===\/\/\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 TypeSymbolTable class for the VMCore library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/TypeSymbolTable.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\nusing namespace llvm;\n\n#define DEBUG_SYMBOL_TABLE 0\n#define DEBUG_ABSTYPE 0\n\nTypeSymbolTable::~TypeSymbolTable() {\n  \/\/ Drop all abstract type references in the type plane...\n  for (iterator TI = tmap.begin(), TE = tmap.end(); TI != TE; ++TI) {\n    if (TI->second->isAbstract())   \/\/ If abstract, drop the reference...\n      cast<DerivedType>(TI->second)->removeAbstractTypeUser(this);\n  }\n}\n\nstd::string TypeSymbolTable::getUniqueName(StringRef BaseName) const {\n  std::string TryName = BaseName;\n  \n  const_iterator End = tmap.end();\n\n  \/\/ See if the name exists\n  while (tmap.find(TryName) != End)            \/\/ Loop until we find a free\n    TryName = BaseName.str() + utostr(++LastUnique); \/\/ name in the symbol table\n  return TryName;\n}\n\n\/\/ lookup a type by name - returns null on failure\nType* TypeSymbolTable::lookup(StringRef Name) const {\n  const_iterator TI = tmap.find(Name);\n  Type* result = 0;\n  if (TI != tmap.end())\n    result = const_cast<Type*>(TI->second);\n  return result;\n}\n\n\/\/ remove - Remove a type from the symbol table...\nType* TypeSymbolTable::remove(iterator Entry) {\n  assert(Entry != tmap.end() && \"Invalid entry to remove!\");\n  const Type* Result = Entry->second;\n\n#if DEBUG_SYMBOL_TABLE\n  dump();\n  errs() << \" Removing Value: \" << Result->getDescription() << \"\\n\";\n#endif\n\n  tmap.erase(Entry);\n  \n  \/\/ If we are removing an abstract type, remove the symbol table from it's use\n  \/\/ list...\n  if (Result->isAbstract()) {\n#if DEBUG_ABSTYPE\n    errs() << \"Removing abstract type from symtab\"\n           << Result->getDescription()\n           << \"\\n\";\n#endif\n    cast<DerivedType>(Result)->removeAbstractTypeUser(this);\n  }\n\n  return const_cast<Type*>(Result);\n}\n\n\n\/\/ insert - Insert a type into the symbol table with the specified name...\nvoid TypeSymbolTable::insert(StringRef Name, const Type* T) {\n  assert(T && \"Can't insert null type into symbol table!\");\n\n  if (tmap.insert(std::make_pair(Name, T)).second) {\n    \/\/ Type inserted fine with no conflict.\n    \n#if DEBUG_SYMBOL_TABLE\n    dump();\n    errs() << \" Inserted type: \" << Name << \": \" << T->getDescription() << \"\\n\";\n#endif\n  } else {\n    \/\/ If there is a name conflict...\n    \n    \/\/ Check to see if there is a naming conflict.  If so, rename this type!\n    std::string UniqueName = Name;\n    if (lookup(Name))\n      UniqueName = getUniqueName(Name);\n    \n#if DEBUG_SYMBOL_TABLE\n    dump();\n    errs() << \" Inserting type: \" << UniqueName << \": \"\n           << T->getDescription() << \"\\n\";\n#endif\n\n    \/\/ Insert the tmap entry\n    tmap.insert(make_pair(UniqueName, T));\n  }\n  \n  \/\/ If we are adding an abstract type, add the symbol table to it's use list.\n  if (T->isAbstract()) {\n    cast<DerivedType>(T)->addAbstractTypeUser(this);\n#if DEBUG_ABSTYPE\n    errs() << \"Added abstract type to ST: \" << T->getDescription() << \"\\n\";\n#endif\n  }\n}\n\n\/\/ This function is called when one of the types in the type plane are refined\nvoid TypeSymbolTable::refineAbstractType(const DerivedType *OldType,\n                                         const Type *NewType) {\n  \/\/ Loop over all of the types in the symbol table, replacing any references\n  \/\/ to OldType with references to NewType.  Note that there may be multiple\n  \/\/ occurrences, and although we only need to remove one at a time, it's\n  \/\/ faster to remove them all in one pass.\n  \/\/\n  for (iterator I = begin(), E = end(); I != E; ++I) {\n    if (I->second == (Type*)OldType) {  \/\/ FIXME when Types aren't const.\n#if DEBUG_ABSTYPE\n      errs() << \"Removing type \" << OldType->getDescription() << \"\\n\";\n#endif\n      OldType->removeAbstractTypeUser(this);\n\n      I->second = (Type*)NewType;  \/\/ TODO FIXME when types aren't const\n      if (NewType->isAbstract()) {\n#if DEBUG_ABSTYPE\n        errs() << \"Added type \" << NewType->getDescription() << \"\\n\";\n#endif\n        cast<DerivedType>(NewType)->addAbstractTypeUser(this);\n      }\n    }\n  }\n}\n\n\n\/\/ Handle situation where type becomes Concreate from Abstract\nvoid TypeSymbolTable::typeBecameConcrete(const DerivedType *AbsTy) {\n  \/\/ Loop over all of the types in the symbol table, dropping any abstract\n  \/\/ type user entries for AbsTy which occur because there are names for the\n  \/\/ type.\n  for (iterator TI = begin(), TE = end(); TI != TE; ++TI)\n    if (TI->second == const_cast<Type*>(static_cast<const Type*>(AbsTy)))\n      AbsTy->removeAbstractTypeUser(this);\n}\n\nstatic void DumpTypes(const std::pair<const std::string, const Type*>& T ) {\n  errs() << \"  '\" << T.first << \"' = \";\n  T.second->dump();\n  errs() << \"\\n\";\n}\n\nvoid TypeSymbolTable::dump() const {\n  errs() << \"TypeSymbolPlane: \";\n  for_each(tmap.begin(), tmap.end(), DumpTypes);\n}\n\n<commit_msg>Change errs() to dbgs().<commit_after>\/\/===-- TypeSymbolTable.cpp - Implement the TypeSymbolTable class ---------===\/\/\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 TypeSymbolTable class for the VMCore library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/TypeSymbolTable.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\nusing namespace llvm;\n\n#define DEBUG_SYMBOL_TABLE 0\n#define DEBUG_ABSTYPE 0\n\nTypeSymbolTable::~TypeSymbolTable() {\n  \/\/ Drop all abstract type references in the type plane...\n  for (iterator TI = tmap.begin(), TE = tmap.end(); TI != TE; ++TI) {\n    if (TI->second->isAbstract())   \/\/ If abstract, drop the reference...\n      cast<DerivedType>(TI->second)->removeAbstractTypeUser(this);\n  }\n}\n\nstd::string TypeSymbolTable::getUniqueName(StringRef BaseName) const {\n  std::string TryName = BaseName;\n  \n  const_iterator End = tmap.end();\n\n  \/\/ See if the name exists\n  while (tmap.find(TryName) != End)            \/\/ Loop until we find a free\n    TryName = BaseName.str() + utostr(++LastUnique); \/\/ name in the symbol table\n  return TryName;\n}\n\n\/\/ lookup a type by name - returns null on failure\nType* TypeSymbolTable::lookup(StringRef Name) const {\n  const_iterator TI = tmap.find(Name);\n  Type* result = 0;\n  if (TI != tmap.end())\n    result = const_cast<Type*>(TI->second);\n  return result;\n}\n\n\/\/ remove - Remove a type from the symbol table...\nType* TypeSymbolTable::remove(iterator Entry) {\n  assert(Entry != tmap.end() && \"Invalid entry to remove!\");\n  const Type* Result = Entry->second;\n\n#if DEBUG_SYMBOL_TABLE\n  dump();\n  dbgs() << \" Removing Value: \" << Result->getDescription() << \"\\n\";\n#endif\n\n  tmap.erase(Entry);\n  \n  \/\/ If we are removing an abstract type, remove the symbol table from it's use\n  \/\/ list...\n  if (Result->isAbstract()) {\n#if DEBUG_ABSTYPE\n    dbgs() << \"Removing abstract type from symtab\"\n           << Result->getDescription()\n           << \"\\n\";\n#endif\n    cast<DerivedType>(Result)->removeAbstractTypeUser(this);\n  }\n\n  return const_cast<Type*>(Result);\n}\n\n\n\/\/ insert - Insert a type into the symbol table with the specified name...\nvoid TypeSymbolTable::insert(StringRef Name, const Type* T) {\n  assert(T && \"Can't insert null type into symbol table!\");\n\n  if (tmap.insert(std::make_pair(Name, T)).second) {\n    \/\/ Type inserted fine with no conflict.\n    \n#if DEBUG_SYMBOL_TABLE\n    dump();\n    dbgs() << \" Inserted type: \" << Name << \": \" << T->getDescription() << \"\\n\";\n#endif\n  } else {\n    \/\/ If there is a name conflict...\n    \n    \/\/ Check to see if there is a naming conflict.  If so, rename this type!\n    std::string UniqueName = Name;\n    if (lookup(Name))\n      UniqueName = getUniqueName(Name);\n    \n#if DEBUG_SYMBOL_TABLE\n    dump();\n    dbgs() << \" Inserting type: \" << UniqueName << \": \"\n           << T->getDescription() << \"\\n\";\n#endif\n\n    \/\/ Insert the tmap entry\n    tmap.insert(make_pair(UniqueName, T));\n  }\n  \n  \/\/ If we are adding an abstract type, add the symbol table to it's use list.\n  if (T->isAbstract()) {\n    cast<DerivedType>(T)->addAbstractTypeUser(this);\n#if DEBUG_ABSTYPE\n    dbgs() << \"Added abstract type to ST: \" << T->getDescription() << \"\\n\";\n#endif\n  }\n}\n\n\/\/ This function is called when one of the types in the type plane are refined\nvoid TypeSymbolTable::refineAbstractType(const DerivedType *OldType,\n                                         const Type *NewType) {\n  \/\/ Loop over all of the types in the symbol table, replacing any references\n  \/\/ to OldType with references to NewType.  Note that there may be multiple\n  \/\/ occurrences, and although we only need to remove one at a time, it's\n  \/\/ faster to remove them all in one pass.\n  \/\/\n  for (iterator I = begin(), E = end(); I != E; ++I) {\n    if (I->second == (Type*)OldType) {  \/\/ FIXME when Types aren't const.\n#if DEBUG_ABSTYPE\n      dbgs() << \"Removing type \" << OldType->getDescription() << \"\\n\";\n#endif\n      OldType->removeAbstractTypeUser(this);\n\n      I->second = (Type*)NewType;  \/\/ TODO FIXME when types aren't const\n      if (NewType->isAbstract()) {\n#if DEBUG_ABSTYPE\n        dbgs() << \"Added type \" << NewType->getDescription() << \"\\n\";\n#endif\n        cast<DerivedType>(NewType)->addAbstractTypeUser(this);\n      }\n    }\n  }\n}\n\n\n\/\/ Handle situation where type becomes Concreate from Abstract\nvoid TypeSymbolTable::typeBecameConcrete(const DerivedType *AbsTy) {\n  \/\/ Loop over all of the types in the symbol table, dropping any abstract\n  \/\/ type user entries for AbsTy which occur because there are names for the\n  \/\/ type.\n  for (iterator TI = begin(), TE = end(); TI != TE; ++TI)\n    if (TI->second == const_cast<Type*>(static_cast<const Type*>(AbsTy)))\n      AbsTy->removeAbstractTypeUser(this);\n}\n\nstatic void DumpTypes(const std::pair<const std::string, const Type*>& T ) {\n  dbgs() << \"  '\" << T.first << \"' = \";\n  T.second->dump();\n  dbgs() << \"\\n\";\n}\n\nvoid TypeSymbolTable::dump() const {\n  dbgs() << \"TypeSymbolPlane: \";\n  for_each(tmap.begin(), tmap.end(), DumpTypes);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nThis is a harder problem right now:\n\nQt 5.X implements signals in a very different way.\nIn order to get the best possible result in very little time, I (ctismer) decided to\ncreate these functions as defunct definitions, in order to do them right, pretty soon.\nFor today, I don't have the brains for that!\n\nstatic bool isDecorator(PyObject* method, PyObject* self)\n{\n    Shiboken::AutoDecRef methodName(PyObject_GetAttrString(method, \"__name__\"));\n    if (!PyObject_HasAttr(self, methodName))\n        return true;\n    Shiboken::AutoDecRef otherMethod(PyObject_GetAttr(self, methodName));\n    return reinterpret_cast<PyMethodObject*>(otherMethod.object())->im_func != \\\n           reinterpret_cast<PyMethodObject*>(method)->im_func;\n}\n\nstatic bool getReceiver(QObject *source, const char* signal, PyObject* callback, QObject** receiver, PyObject** self, QByteArray* callbackSig)\n{\n    bool forceGlobalReceiver = false;\n    if (PyMethod_Check(callback)) {\n        *self = PyMethod_GET_SELF(callback);\n        if (%CHECKTYPE[QObject*](*self))\n            *receiver = %CONVERTTOCPP[QObject*](*self);\n        forceGlobalReceiver = isDecorator(callback, *self);\n    } else if (PyCFunction_Check(callback)) {\n        *self = PyCFunction_GET_SELF(callback);\n        if (*self && %CHECKTYPE[QObject*](*self))\n            *receiver = %CONVERTTOCPP[QObject*](*self);\n    } else if (PyCallable_Check(callback)) {\n        \/\/ Ok, just a callable object\n        *receiver = 0;\n        *self = 0;\n    }\n\n    bool usingGlobalReceiver = !*receiver || forceGlobalReceiver;\n\n    \/\/ Check if this callback is a overwrite of a non-virtual Qt slot.\n    if (!usingGlobalReceiver && receiver && self) {\n        *callbackSig = PySide::Signal::getCallbackSignature(signal, *receiver, callback, usingGlobalReceiver).toUtf8();\n        const QMetaObject* metaObject = (*receiver)->metaObject();\n        int slotIndex = metaObject->indexOfSlot(callbackSig->constData());\n        if (slotIndex != -1 && slotIndex < metaObject->methodOffset() && PyMethod_Check(callback))\n            usingGlobalReceiver = true;\n    }\n\n    if (usingGlobalReceiver) {\n        PySide::SignalManager& signalManager = PySide::SignalManager::instance();\n        *receiver = signalManager.globalReceiver(source, callback);\n        *callbackSig = PySide::Signal::getCallbackSignature(signal, *receiver, callback, usingGlobalReceiver).toUtf8();\n    }\n\n    return usingGlobalReceiver;\n}\n\nstatic QMetaObject::Connection qobjectConnect(QObject* source, const char* signal, QObject* receiver, const char* slot, Qt::ConnectionType type)\n{\n    if (!signal || !slot)\n        return QMetaObject::Connection();\n\n    if (!PySide::Signal::checkQtSignal(signal))\n        return QMetaObject::Connection();\n    signal++;\n\n    if (!PySide::SignalManager::registerMetaMethod(source, signal, QMetaMethod::Signal))\n        return QMetaObject::Connection();\n\n    bool isSignal = PySide::Signal::isQtSignal(slot);\n    slot++;\n    PySide::SignalManager::registerMetaMethod(receiver, slot, isSignal ? QMetaMethod::Signal : QMetaMethod::Slot);\n    QMetaObject::Connection connection;\n    Py_BEGIN_ALLOW_THREADS\n    connection = QObject::connect(source, signal - 1, receiver, slot - 1, type);\n    Py_END_ALLOW_THREADS\n    return connection;\n}\n\nstatic QMetaObject::Connection qobjectConnectCallback(QObject* source, const char* signal, PyObject* callback, Qt::ConnectionType type)\n{\n    if (!signal || !PySide::Signal::checkQtSignal(signal))\n        return QMetaObject::Connection();\n    signal++;\n\n    int signalIndex = PySide::SignalManager::registerMetaMethodGetIndex(source, signal, QMetaMethod::Signal);\n    if (signalIndex == -1)\n        return QMetaObject::Connection();\n\n    PySide::SignalManager& signalManager = PySide::SignalManager::instance();\n\n    \/\/ Extract receiver from callback\n    QObject* receiver = 0;\n    PyObject* self = 0;\n    QByteArray callbackSig;\n    bool usingGlobalReceiver = getReceiver(source, signal, callback, &receiver, &self, &callbackSig);\n    if (receiver == 0 && self == 0)\n        return QMetaObject::Connection();\n\n    const QMetaObject* metaObject = receiver->metaObject();\n    const char* slot = callbackSig.constData();\n    int slotIndex = metaObject->indexOfSlot(slot);\n\n    if (slotIndex == -1) {\n        if (!usingGlobalReceiver && self && !Shiboken::Object::hasCppWrapper((SbkObject*)self)) {\n            qWarning() << \"You can't add dynamic slots on an object originated from C++.\";\n            if (usingGlobalReceiver)\n                signalManager.releaseGlobalReceiver(source, receiver);\n\n            return QMetaObject::Connection();\n        }\n\n        if (usingGlobalReceiver)\n            slotIndex = signalManager.globalReceiverSlotIndex(receiver, slot);\n        else\n            slotIndex = PySide::SignalManager::registerMetaMethodGetIndex(receiver, slot, QMetaMethod::Slot);\n\n        if (slotIndex == -1) {\n            if (usingGlobalReceiver)\n                signalManager.releaseGlobalReceiver(source, receiver);\n\n            return QMetaObject::Connection();\n        }\n    }\n    QMetaObject::Connection connection;\n    Py_BEGIN_ALLOW_THREADS\n    connection = QMetaObject::connect(source, signalIndex, receiver, slotIndex, type);\n    Py_END_ALLOW_THREADS\n    if (connection) {\n        if (usingGlobalReceiver)\n            signalManager.notifyGlobalReceiver(receiver);\n        #ifndef AVOID_PROTECTED_HACK\n            source->connectNotify(signal - 1);\n        #else\n            \/\/ Need to cast to QObjectWrapper* and call the public version of\n            \/\/ connectNotify when avoiding the protected hack.\n            reinterpret_cast<QObjectWrapper*>(source)->connectNotify(signal - 1);\n        #endif\n\n        return connection;\n    }\n\n    if (usingGlobalReceiver)\n        signalManager.releaseGlobalReceiver(source, receiver);\n\n    return QMetaObject::Connection();\n}\n\n\nstatic bool qobjectDisconnectCallback(QObject* source, const char* signal, PyObject* callback)\n{\n    if (!PySide::Signal::checkQtSignal(signal))\n        return false;\n\n    PySide::SignalManager& signalManager = PySide::SignalManager::instance();\n\n    \/\/ Extract receiver from callback\n    QObject* receiver = 0;\n    PyObject* self = 0;\n    QByteArray callbackSig;\n    bool usingGlobalReceiver = getReceiver(NULL, signal, callback, &receiver, &self, &callbackSig);\n    if (receiver == 0 && self == 0)\n        return false;\n\n    const QMetaObject* metaObject = receiver->metaObject();\n    int signalIndex = source->metaObject()->indexOfSignal(++signal);\n    int slotIndex = -1;\n\n    slotIndex = metaObject->indexOfSlot(callbackSig);\n\n    bool disconnected;\n    Py_BEGIN_ALLOW_THREADS\n    disconnected = QMetaObject::disconnectOne(source, signalIndex, receiver, slotIndex);\n    Py_END_ALLOW_THREADS\n\n    if (disconnected) {\n        if (usingGlobalReceiver)\n            signalManager.releaseGlobalReceiver(source, receiver);\n\n        #ifndef AVOID_PROTECTED_HACK\n            source->disconnectNotify(callbackSig);\n        #else\n            \/\/ Need to cast to QObjectWrapper* and call the public version of\n            \/\/ connectNotify when avoiding the protected hack.\n            reinterpret_cast<QObjectWrapper*>(source)->disconnectNotify(callbackSig);\n        #endif\n        return true;\n    }\n    return false;\n}\n\n*\/\n\n\/\/ the temporary definitions may follow, soon:\n\n\n<commit_msg>apply Romain's fixes to object_connect.cpp<commit_after>\nstatic bool isDecorator(PyObject* method, PyObject* self)\n{\n    Shiboken::AutoDecRef methodName(PyObject_GetAttrString(method, \"__name__\"));\n    if (!PyObject_HasAttr(self, methodName))\n        return true;\n    Shiboken::AutoDecRef otherMethod(PyObject_GetAttr(self, methodName));\n    return reinterpret_cast<PyMethodObject*>(otherMethod.object())->im_func != \\\n           reinterpret_cast<PyMethodObject*>(method)->im_func;\n}\n\nstatic bool getReceiver(QObject *source, const char* signal, PyObject* callback, QObject** receiver, PyObject** self, QByteArray* callbackSig)\n{\n    bool forceGlobalReceiver = false;\n    if (PyMethod_Check(callback)) {\n        *self = PyMethod_GET_SELF(callback);\n        if (%CHECKTYPE[QObject*](*self))\n            *receiver = %CONVERTTOCPP[QObject*](*self);\n        forceGlobalReceiver = isDecorator(callback, *self);\n    } else if (PyCFunction_Check(callback)) {\n        *self = PyCFunction_GET_SELF(callback);\n        if (*self && %CHECKTYPE[QObject*](*self))\n            *receiver = %CONVERTTOCPP[QObject*](*self);\n    } else if (PyCallable_Check(callback)) {\n        \/\/ Ok, just a callable object\n        *receiver = 0;\n        *self = 0;\n    }\n\n    bool usingGlobalReceiver = !*receiver || forceGlobalReceiver;\n\n    \/\/ Check if this callback is a overwrite of a non-virtual Qt slot.\n    if (!usingGlobalReceiver && receiver && self) {\n        *callbackSig = PySide::Signal::getCallbackSignature(signal, *receiver, callback, usingGlobalReceiver).toLatin1();\n        const QMetaObject* metaObject = (*receiver)->metaObject();\n        int slotIndex = metaObject->indexOfSlot(callbackSig->constData());\n        if (slotIndex != -1 && slotIndex < metaObject->methodOffset() && PyMethod_Check(callback))\n            usingGlobalReceiver = true;\n    }\n\n    if (usingGlobalReceiver) {\n        PySide::SignalManager& signalManager = PySide::SignalManager::instance();\n        *receiver = signalManager.globalReceiver(source, callback);\n        *callbackSig = PySide::Signal::getCallbackSignature(signal, *receiver, callback, usingGlobalReceiver).toLatin1();\n    }\n\n    return usingGlobalReceiver;\n}\n\nstatic QMetaObject::Connection qobjectConnect(QObject* source, const char* signal, QObject* receiver, const char* slot, Qt::ConnectionType type)\n{\n    if (!signal || !slot)\n        return QMetaObject::Connection();\n\n    if (!PySide::Signal::checkQtSignal(signal))\n        return QMetaObject::Connection();\n    signal++;\n\n    if (!PySide::SignalManager::registerMetaMethod(source, signal, QMetaMethod::Signal))\n        return QMetaObject::Connection();\n\n    bool isSignal = PySide::Signal::isQtSignal(slot);\n    slot++;\n    PySide::SignalManager::registerMetaMethod(receiver, slot, isSignal ? QMetaMethod::Signal : QMetaMethod::Slot);\n    QMetaObject::Connection connection;\n    Py_BEGIN_ALLOW_THREADS\n    connection = QObject::connect(source, signal - 1, receiver, slot - 1, type);\n    Py_END_ALLOW_THREADS\n    return connection;\n}\n\nstatic QMetaObject::Connection qobjectConnectCallback(QObject* source, const char* signal, PyObject* callback, Qt::ConnectionType type)\n{\n    if (!signal || !PySide::Signal::checkQtSignal(signal))\n        return QMetaObject::Connection();\n    signal++;\n\n    int signalIndex = PySide::SignalManager::registerMetaMethodGetIndex(source, signal, QMetaMethod::Signal);\n    if (signalIndex == -1)\n        return QMetaObject::Connection();\n\n    PySide::SignalManager& signalManager = PySide::SignalManager::instance();\n\n    \/\/ Extract receiver from callback\n    QObject* receiver = 0;\n    PyObject* self = 0;\n    QByteArray callbackSig;\n    bool usingGlobalReceiver = getReceiver(source, signal, callback, &receiver, &self, &callbackSig);\n    if (receiver == 0 && self == 0)\n        return QMetaObject::Connection();\n\n    const QMetaObject* metaObject = receiver->metaObject();\n    const char* slot = callbackSig.constData();\n    int slotIndex = metaObject->indexOfSlot(slot);\n    QMetaMethod signalMethod = metaObject->method(signalIndex);\n\n    if (slotIndex == -1) {\n        if (!usingGlobalReceiver && self && !Shiboken::Object::hasCppWrapper((SbkObject*)self)) {\n            qWarning() << \"You can't add dynamic slots on an object originated from C++.\";\n            if (usingGlobalReceiver)\n                signalManager.releaseGlobalReceiver(source, receiver);\n\n            return QMetaObject::Connection();\n        }\n\n        if (usingGlobalReceiver)\n            slotIndex = signalManager.globalReceiverSlotIndex(receiver, slot);\n        else\n            slotIndex = PySide::SignalManager::registerMetaMethodGetIndex(receiver, slot, QMetaMethod::Slot);\n\n        if (slotIndex == -1) {\n            if (usingGlobalReceiver)\n                signalManager.releaseGlobalReceiver(source, receiver);\n\n            return QMetaObject::Connection();\n        }\n    }\n    QMetaObject::Connection connection;\n    Py_BEGIN_ALLOW_THREADS\n    connection = QMetaObject::connect(source, signalIndex, receiver, slotIndex, type);\n    Py_END_ALLOW_THREADS\n    if (connection) {\n        if (usingGlobalReceiver)\n            signalManager.notifyGlobalReceiver(receiver);\n        #ifndef AVOID_PROTECTED_HACK\n            source->connectNotify(signalMethod); \/\/Qt5: QMetaMethod instead of char*\n        #else\n            \/\/ Need to cast to QObjectWrapper* and call the public version of\n            \/\/ connectNotify when avoiding the protected hack.\n            reinterpret_cast<QObjectWrapper*>(source)->connectNotify(signalMethod); \/\/Qt5: QMetaMethod instead of char*\n        #endif\n\n        return connection;\n    }\n\n    if (usingGlobalReceiver)\n        signalManager.releaseGlobalReceiver(source, receiver);\n\n    return QMetaObject::Connection();\n}\n\n\nstatic bool qobjectDisconnectCallback(QObject* source, const char* signal, PyObject* callback)\n{\n    if (!PySide::Signal::checkQtSignal(signal))\n        return false;\n\n    PySide::SignalManager& signalManager = PySide::SignalManager::instance();\n\n    \/\/ Extract receiver from callback\n    QObject* receiver = 0;\n    PyObject* self = 0;\n    QByteArray callbackSig;\n    QMetaMethod slotMethod;\n    bool usingGlobalReceiver = getReceiver(NULL, signal, callback, &receiver, &self, &callbackSig);\n    if (receiver == 0 && self == 0)\n        return false;\n\n    const QMetaObject* metaObject = receiver->metaObject();\n    int signalIndex = source->metaObject()->indexOfSignal(++signal);\n    int slotIndex = -1;\n\n    slotIndex = metaObject->indexOfSlot(callbackSig);\n    slotMethod = metaObject->method(slotIndex);\n\n    bool disconnected;\n    Py_BEGIN_ALLOW_THREADS\n    disconnected = QMetaObject::disconnectOne(source, signalIndex, receiver, slotIndex);\n    Py_END_ALLOW_THREADS\n\n    if (disconnected) {\n        if (usingGlobalReceiver)\n            signalManager.releaseGlobalReceiver(source, receiver);\n\n        #ifndef AVOID_PROTECTED_HACK\n            source->disconnectNotify(slotMethod); \/\/Qt5: QMetaMethod instead of char*\n        #else\n            \/\/ Need to cast to QObjectWrapper* and call the public version of\n            \/\/ connectNotify when avoiding the protected hack.\n            reinterpret_cast<QObjectWrapper*>(source)->disconnectNotify(slotMethod); \/\/Qt5: QMetaMethod instead of char*\n        #endif\n        return true;\n    }\n    return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: scendlg.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 21:47: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 SC_SCENDLG_HXX\n#define SC_SCENDLG_HXX\n\n\n#ifndef _SV_DIALOG_HXX \/\/autogen\n#include <vcl\/dialog.hxx>\n#endif\n\n#ifndef _SV_EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#ifndef _SV_FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _SV_BUTTON_HXX \/\/autogen\n#include <vcl\/imagebtn.hxx>\n#endif\n\n#ifndef _SVEDIT_HXX \/\/autogen\n#include <svtools\/svmedit.hxx>\n#endif\n\n#ifndef _CTRLBOX_HXX \/\/autogen\n#include <svtools\/ctrlbox.hxx>\n#endif\n\n\/\/===================================================================\n\nclass ScNewScenarioDlg : public ModalDialog\n{\npublic:\n        ScNewScenarioDlg( Window* pParent, const String& rName, BOOL bEdit = FALSE, BOOL bSheetProtected = FALSE );\n        ~ScNewScenarioDlg();\n\n    void SetScenarioData( const String& rName, const String& rComment,\n                            const Color& rColor, USHORT nFlags );\n\n    void GetScenarioData( String& rName, String& rComment,\n                            Color& rColor, USHORT& rFlags ) const;\n\nprivate:\n    FixedLine           aFlName;\n    Edit                aEdName;\n    FixedLine           aFlComment;\n    MultiLineEdit       aEdComment;\n    FixedLine           aFlOptions;\n    CheckBox            aCbShowFrame;\n    ColorListBox        aLbColor;\n    \/\/CheckBox          aCbPrintFrame;\n    CheckBox            aCbTwoWay;\n    \/\/CheckBox          aCbAttrib;\n    \/\/CheckBox          aCbValue;\n    CheckBox            aCbCopyAll;\n    CheckBox            aCbProtect;\n    OKButton            aBtnOk;\n    CancelButton        aBtnCancel;\n    HelpButton          aBtnHelp;\n    const String        aDefScenarioName;\n    BOOL                bIsEdit;\n\n    DECL_LINK( OkHdl, OKButton * );\n    DECL_LINK( EnableHdl, CheckBox * );\n};\n\n\n#endif \/\/ SC_SCENDLG_HXX\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.4.700); FILE MERGED 2008\/04\/01 15:30:59 thb 1.4.700.2: #i85898# Stripping all external header guards 2008\/03\/31 17:15:47 rt 1.4.700.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: scendlg.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\n#ifndef SC_SCENDLG_HXX\n#define SC_SCENDLG_HXX\n\n\n#include <vcl\/dialog.hxx>\n#include <vcl\/edit.hxx>\n#include <vcl\/fixed.hxx>\n#include <vcl\/imagebtn.hxx>\n#include <svtools\/svmedit.hxx>\n#include <svtools\/ctrlbox.hxx>\n\n\/\/===================================================================\n\nclass ScNewScenarioDlg : public ModalDialog\n{\npublic:\n        ScNewScenarioDlg( Window* pParent, const String& rName, BOOL bEdit = FALSE, BOOL bSheetProtected = FALSE );\n        ~ScNewScenarioDlg();\n\n    void SetScenarioData( const String& rName, const String& rComment,\n                            const Color& rColor, USHORT nFlags );\n\n    void GetScenarioData( String& rName, String& rComment,\n                            Color& rColor, USHORT& rFlags ) const;\n\nprivate:\n    FixedLine           aFlName;\n    Edit                aEdName;\n    FixedLine           aFlComment;\n    MultiLineEdit       aEdComment;\n    FixedLine           aFlOptions;\n    CheckBox            aCbShowFrame;\n    ColorListBox        aLbColor;\n    \/\/CheckBox          aCbPrintFrame;\n    CheckBox            aCbTwoWay;\n    \/\/CheckBox          aCbAttrib;\n    \/\/CheckBox          aCbValue;\n    CheckBox            aCbCopyAll;\n    CheckBox            aCbProtect;\n    OKButton            aBtnOk;\n    CancelButton        aBtnCancel;\n    HelpButton          aBtnHelp;\n    const String        aDefScenarioName;\n    BOOL                bIsEdit;\n\n    DECL_LINK( OkHdl, OKButton * );\n    DECL_LINK( EnableHdl, CheckBox * );\n};\n\n\n#endif \/\/ SC_SCENDLG_HXX\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"GroupTreeCtrl.h\"\n#include \"GroupTreePanel.h\"\n#include \"MultiSpritesImpl.h\"\n#include \"GroupTreeImpl.h\"\n#include \"ViewPanelMgr.h\"\n\n#include \"dataset\/Group.h\"\n#include \"dataset\/ISprite.h\"\n\n#include <sstream>\n#include <queue>\n#include <wx\/menu.h>\n\nnamespace d2d\n{\n\nBEGIN_EVENT_TABLE(GroupTreeCtrl, wxTreeCtrl)\n\tEVT_TREE_ITEM_RIGHT_CLICK(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnItemRClick)\n\tEVT_TREE_ITEM_MENU(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnItemMenu)\n\tEVT_TREE_ITEM_ACTIVATED(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnItemActivated)\n\tEVT_TREE_BEGIN_DRAG(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnBeginDrag)\n\tEVT_TREE_END_DRAG(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnEndDrag)\n\tEVT_KEY_DOWN(GroupTreeCtrl::OnKeyDown)\n\tEVT_TREE_SEL_CHANGED(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnSelChanged)\nEND_EVENT_TABLE()\n\nGroupTreeCtrl::GroupTreeCtrl(GroupTreePanel* parent, MultiSpritesImpl* sprite_impl,\n\t\t\t\t\t\t\t ViewPanelMgr* view_panel_mgr)\n\t: wxTreeCtrl(parent, ID_GROUP_TREE_CTRL, wxDefaultPosition, wxDefaultSize, \n\twxTR_EDIT_LABELS | \/*wxTR_HIDE_ROOT | *\/wxTR_NO_LINES | wxTR_DEFAULT_STYLE)\n\t, m_parent_panel(parent)\n\t, m_sprite_impl(sprite_impl)\n\t, m_view_panel_mgr(view_panel_mgr)\n\t, m_remove_open(true)\n{\n\tInitRoot();\n}\n\nvoid GroupTreeCtrl::Traverse(IGroupTreeVisitor& visitor) const\n{\n\tTraverse(m_root, visitor);\n}\n\nwxTreeItemId GroupTreeCtrl::AddNode()\n{\n\tstatic int s_num = 0;\n\n\tstd::ostringstream ss;\n\tss << \"GROUP_\" << s_num++;\n\tstd::string text = ss.str();\n\n\treturn AddNode(text);\n}\n\nwxTreeItemId GroupTreeCtrl::AddNode(const std::string& name)\n{\n\tGroupTreeItem* data = new GroupTreeItem(new Group(name));\n\n\twxTreeItemId ret;\n\twxTreeItemId id = GetFocusedItem();\n\tif (id.IsOk()) {\n\t\tdata->SetId(id);\n\t\tret = AddNode(id, name, data);\n\t} else {\n\t\tdata->SetId(m_root);\n\t\tret = AddNode(m_root, name, data);\n\t}\n\tSetItemBold(ret, true);\n\treturn ret;\n}\n\nwxTreeItemId GroupTreeCtrl::AddNode(const std::string& name, wxTreeItemId parent)\n{\n\tGroupTreeItem* data = new GroupTreeItem(new Group(name));\n\twxTreeItemId ret = AddNode(parent, name, data);\n\tSetItemBold(ret, true);\n\treturn ret;\n}\n\nvoid GroupTreeCtrl::DelNode()\n{\n\twxTreeItemId id = GetFocusedItem();\n\tif (id.IsOk()) {\n\t\tDelete(id);\n\t}\n}\n\nwxTreeItemId GroupTreeCtrl::AddSprite(wxTreeItemId parent, d2d::ISprite* spr)\n{\n\tif (!parent.IsOk()) {\n\t\treturn m_root;\n\t}\t\n\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(parent);\n\tif (!data) {\n\t\treturn m_root;\n\t}\n\n\tGroup* group = data->m_group;\n\tif (!group) {\n\t\treturn m_root;\n\t}\n\n\tbool ok = group->Insert(spr);\n\tif (ok) {\n\t\tGroupTreeItem* data = new GroupTreeItem(spr);\n\t\treturn AddNode(parent, spr->name, data);\n\t} else {\n\t\treturn m_root;\n\t}\n}\n\nwxTreeItemId GroupTreeCtrl::AddSprite(d2d::ISprite* spr)\n{\n\twxTreeItemId ret;\n\tif (m_selected_item.IsOk()) {\n\t\tret = AddSprite(m_selected_item, spr);\n\t}\n\tif (!ret.IsOk() || ret == m_root) {\n\t\tassert(m_root.IsOk());\n\t\tret = AddSprite(m_root, spr);\n\t}\n\treturn ret;\n}\n\nvoid GroupTreeCtrl::Clear()\n{\n\tif (!IsEmpty()) {\n\t\tCollapseAndReset(m_root);\n\t}\n}\n\nvoid GroupTreeCtrl::Remove(ISprite* sprite)\n{\n\tif (m_remove_open) {\n\t\tTraverse(GroupTreeImpl::RemoveVisitor(this, sprite));\n\t}\n}\n\nvoid GroupTreeCtrl::Visible(wxTreeItemId id, bool visible)\n{\n\tTraverse(id, GroupTreeImpl::SetVisibleVisitor(this, visible));\n}\n\nvoid GroupTreeCtrl::Editable(wxTreeItemId id, bool editable)\n{\n\tTraverse(id, GroupTreeImpl::SetEditableVisitor(this, editable));\n}\n\nvoid GroupTreeCtrl::ReorderItem(wxTreeItemId id, bool up)\n{\n\tif (!id.IsOk()) {\n\t\treturn;\n\t}\n\n\twxTreeItemId insert_prev;\n\tif (up) {\n\t\twxTreeItemId prev = GetPrevSibling(id);\n\t\tif (!prev.IsOk()) {\n\t\t\treturn;\n\t\t}\n\t\tinsert_prev = GetPrevSibling(prev);\n\t} else {\n\t\twxTreeItemId next = GetNextSibling(id);\n\t\tif (!next.IsOk()) {\n\t\t\treturn;\n\t\t}\n\t\tinsert_prev = next;\n\t}\n\n\t\/\/ old info\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(id);\n\tstd::string name = GetItemText(id);\n\n\t\/\/ insert\n\twxTreeItemId parent = GetItemParent(id);\n\twxTreeItemId new_item;\n\tif (insert_prev.IsOk()) {\n\t\tnew_item = InsertItem(parent, insert_prev, name, -1, -1, data->Clone());\n\t} else {\n\t\tnew_item = InsertItem(parent, 0, name, -1, -1, data->Clone());\n\t}\n\tExpandAll();\n\t\/\/ copy older's children\n\tTraverse(id, GroupTreeImpl::CopyPasteVisitor(this, id, new_item));\n\t\/\/ remove\n\tDelete(id);\n\t\/\/ sort\n\tReorderSprites();\n\t\/\/ set selection\n\tSelectItem(new_item);\n}\n\nwxTreeItemId GroupTreeCtrl::AddNode(wxTreeItemId parent, const std::string& name, GroupTreeItem* data)\n{\n\twxTreeItemId id = InsertItem(parent, 0, name, -1, -1, data);\n\tExpandAll();\n\treturn id;\n}\n\nvoid GroupTreeCtrl::InitRoot()\n{\n\tGroupTreeItem* data = new GroupTreeItem(new Group(\"ROOT\"));\n\tm_root = AddRoot(\"ROOT\");\n\tSetItemBold(m_root, true);\n\tSetItemData(m_root, data);\n}\n\nvoid GroupTreeCtrl::OnItemRClick(wxTreeEvent& event)\n{\n\twxTreeItemId itemId = event.GetItem();\n\n\tGroupTreeItem* item = (GroupTreeItem*)GetItemData(itemId);\n\n\tevent.Skip();\n}\n\nvoid GroupTreeCtrl::OnItemMenu(wxTreeEvent& event)\n{\n\twxTreeItemId id = event.GetItem();\n\tif (!id.IsOk()) {\n\t\treturn;\n\t}\t\n\n\twxPoint clientpt = event.GetPoint();\n\twxPoint screenpt = ClientToScreen(clientpt);\n\tShowMenu(id, clientpt);\n\tevent.Skip();\n}\n\nvoid GroupTreeCtrl::OnItemActivated(wxTreeEvent& event)\n{\n\twxTreeItemId id = event.GetItem();\n\tSpriteSelection* selection = m_sprite_impl->getSpriteSelection();\n\tselection->Clear();\n\tTraverse(id, GroupTreeImpl::SelectVisitor(this, selection));\n}\n\nvoid GroupTreeCtrl::OnBeginDrag(wxTreeEvent& event)\n{\n\tm_dragged_item = event.GetItem();\n\tevent.Allow();\n}\n\nvoid GroupTreeCtrl::OnEndDrag(wxTreeEvent& event)\n{\n\twxTreeItemId item_src = m_dragged_item,\n\t\titem_dst = event.GetItem();\n\tif (!item_dst.IsOk()) {\n\t\treturn;\n\t}\n\n\twxLogDebug(\"Drag from %s to %s\", GetItemText(item_src), GetItemText(item_dst));\n\n\t\/\/ old info\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(item_src);\n\tstd::string name = GetItemText(item_src);\n\t\/\/ insert\n\twxTreeItemId new_item = InsertItem(item_dst, 0, name, -1, -1, data->Clone());\n\tExpandAll();\n\t\/\/ copy older's children\n\tTraverse(item_src, GroupTreeImpl::CopyPasteVisitor(this, item_src, new_item));\n\t\/\/ remove\n\tDelete(item_src);\n\t\/\/ sort\n\tReorderSprites();\n}\n\nvoid GroupTreeCtrl::OnKeyDown(wxKeyEvent& event)\n{\n\tswitch (event.GetKeyCode())\n\t{\n\tcase WXK_UP:\n\t\tSelectUp();\n\t\tbreak;\n\tcase WXK_DOWN:\n\t\tSelectDown();\n\t\tbreak;\n\tcase WXK_LEFT:\n\t\tSelectLeft();\n\t\tbreak;\n\tcase WXK_RIGHT:\n\t\tSelectRight();\n\t\tbreak;\n\tcase WXK_PAGEUP:\n\t\tReorderItem(m_selected_item, true);\n\t\tbreak;\n\tcase WXK_PAGEDOWN:\n\t\tReorderItem(m_selected_item, false);\n\t\tbreak;\n\t}\n}\n\nvoid GroupTreeCtrl::OnSelChanged(wxTreeEvent& event)\n{\n\tm_selected_item = event.GetItem();\n\n\twxLogDebug(\"OnSelChanged %s\", GetItemText(m_selected_item));\n\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(m_selected_item);\n\tif (data && data->m_sprite) {\n\t\tm_view_panel_mgr->SelectSprite(data->m_sprite, m_parent_panel);\n\t}\n}\n\nvoid GroupTreeCtrl::OnMenuAddSprites(wxCommandEvent& event)\n{\n\tif (!m_on_menu_id.IsOk()) {\n\t\treturn;\n\t}\n\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(m_on_menu_id);\n\tif (!data) {\n\t\treturn;\n\t}\n\n\tGroup* group = data->m_group;\n\tif (!group) {\n\t\treturn;\n\t}\n\n\tSpriteSelection* selection = m_sprite_impl->getSpriteSelection();\n\tstd::vector<ISprite*> sprites;\n\tselection->Traverse(FetchAllVisitor<ISprite>(sprites));\n\tfor (int i = 0, n = sprites.size(); i < n; ++i) {\n\t\tISprite* spr = sprites[i];\n\t\tbool ok = group->Insert(spr);\n\t\tif (ok) {\n\t\t\tGroupTreeItem* data = new GroupTreeItem(spr);\n\t\t\tAddNode(m_on_menu_id, spr->name, data);\n\t\t}\n\t}\n}\n\nvoid GroupTreeCtrl::OnMenuClear(wxCommandEvent& event)\n{\n\tif (!m_on_menu_id.IsOk()) {\n\t\treturn;\n\t}\t\n\n\tGroup* group = ((GroupTreeItem*)GetItemData(m_on_menu_id))->m_group;\n\tif (!group) {\n\t\treturn;\n\t}\n\n\tgroup->Clear();\n\tCollapseAndReset(m_on_menu_id);\n}\n\nvoid GroupTreeCtrl::OnMenuVisible(wxCommandEvent& event)\n{\n\tTraverse(m_on_menu_id, GroupTreeImpl::VisibleVisitor(this));\n}\n\nvoid GroupTreeCtrl::OnMenuEditable(wxCommandEvent& event)\n{\n\tTraverse(m_on_menu_id, GroupTreeImpl::EditableVisitor(this));\n}\n\nvoid GroupTreeCtrl::SelectUp()\n{\n\tif (!m_selected_item.IsOk()) {\n\t\treturn;\n\t}\n\n\twxTreeItemId prev = GetPrevSibling(m_selected_item);\n\tif (prev.IsOk()) {\n\t\tSelectItem(prev); \n\t}\n}\n\nvoid GroupTreeCtrl::SelectDown()\n{\n\tif (!m_selected_item.IsOk()) {\n\t\treturn;\n\t}\n\n\twxTreeItemId next = GetNextSibling(m_selected_item);\n\tif (next.IsOk()) {\n\t\tSelectItem(next); \n\t}\n}\n\nvoid GroupTreeCtrl::SelectLeft()\n{\n\tif (!m_selected_item.IsOk()) {\n\t\treturn;\n\t}\n\n\tif (ItemHasChildren(m_selected_item) && IsExpanded(m_selected_item)) {\n\t\tCollapse(m_selected_item);\n\t} else {\n\t \twxTreeItemId parent = GetItemParent(m_selected_item);\n\t \tif (parent.IsOk() && parent != m_root) {\n\t \t\tSelectItem(parent);\n\t \t}\n\t}\n}\n\nvoid GroupTreeCtrl::SelectRight()\n{\n\tif (!m_selected_item.IsOk()) {\n\t\treturn;\n\t}\n\n\tif (ItemHasChildren(m_selected_item)) {\n\t\tif (IsExpanded(m_selected_item)) {\n\t\t\twxTreeItemIdValue cookie;\n\t\t\twxTreeItemId next = GetFirstChild(m_selected_item, cookie);\n\t\t\tif (next.IsOk()) {\n\t\t\t\tSelectItem(next);\n\t\t\t}\n\t\t} else {\n\t\t\tExpand(m_selected_item);\n\t\t}\n\t}\n}\n\nvoid GroupTreeCtrl::ReorderSprites()\n{\n\tstd::vector<ISprite*> sprites;\n\tTraverse(m_root, GroupTreeImpl::GetSpritesVisitor(this, sprites));\n\tfor (int i = sprites.size() - 1; i >= 0; --i) {\n\t\tISprite* spr = sprites[i];\n\t\tm_remove_open = false;\n\t\tm_sprite_impl->removeSprite(spr);\n\t\tm_remove_open = true;\n\t\tm_sprite_impl->insertSprite(spr);\n\t}\n}\n\nvoid GroupTreeCtrl::ShowMenu(wxTreeItemId id, const wxPoint& pt)\n{\n\tm_on_menu_id = id;\n\n\twxMenu menu;\n\n\tmenu.Append(ID_MENU_ADD, wxT(\"&Add Sprites\"));\n\tBind(wxEVT_COMMAND_MENU_SELECTED, &GroupTreeCtrl::OnMenuAddSprites, this, ID_MENU_ADD);\n\n\tmenu.Append(ID_MENU_CLEAR, wxT(\"&Clear Sprites\"));\n\tBind(wxEVT_COMMAND_MENU_SELECTED, &GroupTreeCtrl::OnMenuClear, this, ID_MENU_CLEAR);\n\n\tmenu.AppendSeparator();\n\n\tmenu.AppendCheckItem(ID_MENU_VISIBLE, wxT(\"&Visible\"));\n\tBind(wxEVT_COMMAND_MENU_SELECTED, &GroupTreeCtrl::OnMenuVisible, this, ID_MENU_VISIBLE);\n\n\tmenu.AppendCheckItem(ID_MENU_EDITABLE, wxT(\"&Editable\"));\n\tBind(wxEVT_COMMAND_MENU_SELECTED, &GroupTreeCtrl::OnMenuEditable, this, ID_MENU_EDITABLE);\n\n\tPopupMenu(&menu, pt);\n}\n\nvoid GroupTreeCtrl::Traverse(wxTreeItemId id, IGroupTreeVisitor& visitor) const\n{\n\tstd::queue<wxTreeItemId> buf;\n\tbuf.push(id);\n\twhile (!buf.empty()) {\n\t\twxTreeItemId item = buf.front(); buf.pop();\n\n\t\twxTreeItemIdValue cookie;\n\t\twxTreeItemId id = GetFirstChild(item, cookie);\n\t\tif (id.IsOk()) {\n\t\t\tif (item != id) {\n\t\t\t\tbool finish = visitor.VisitNonleaf(item);\n\t\t\t\tif (finish) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\twhile (id.IsOk()) {\n\t\t\t\tbuf.push(id);\n\t\t\t\tid = GetNextSibling(id);\n\t\t\t}\n\t\t} else {\n\t\t\tbool finish = visitor.VisitLeaf(item);\n\t\t\tif (finish) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\n}<commit_msg>[FIXED] AddNode后置为选中<commit_after>#include \"GroupTreeCtrl.h\"\n#include \"GroupTreePanel.h\"\n#include \"MultiSpritesImpl.h\"\n#include \"GroupTreeImpl.h\"\n#include \"ViewPanelMgr.h\"\n\n#include \"dataset\/Group.h\"\n#include \"dataset\/ISprite.h\"\n\n#include <sstream>\n#include <queue>\n#include <wx\/menu.h>\n\nnamespace d2d\n{\n\nBEGIN_EVENT_TABLE(GroupTreeCtrl, wxTreeCtrl)\n\tEVT_TREE_ITEM_RIGHT_CLICK(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnItemRClick)\n\tEVT_TREE_ITEM_MENU(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnItemMenu)\n\tEVT_TREE_ITEM_ACTIVATED(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnItemActivated)\n\tEVT_TREE_BEGIN_DRAG(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnBeginDrag)\n\tEVT_TREE_END_DRAG(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnEndDrag)\n\tEVT_KEY_DOWN(GroupTreeCtrl::OnKeyDown)\n\tEVT_TREE_SEL_CHANGED(ID_GROUP_TREE_CTRL, GroupTreeCtrl::OnSelChanged)\nEND_EVENT_TABLE()\n\nGroupTreeCtrl::GroupTreeCtrl(GroupTreePanel* parent, MultiSpritesImpl* sprite_impl,\n\t\t\t\t\t\t\t ViewPanelMgr* view_panel_mgr)\n\t: wxTreeCtrl(parent, ID_GROUP_TREE_CTRL, wxDefaultPosition, wxDefaultSize, \n\twxTR_EDIT_LABELS | \/*wxTR_HIDE_ROOT | *\/wxTR_NO_LINES | wxTR_DEFAULT_STYLE)\n\t, m_parent_panel(parent)\n\t, m_sprite_impl(sprite_impl)\n\t, m_view_panel_mgr(view_panel_mgr)\n\t, m_remove_open(true)\n{\n\tInitRoot();\n}\n\nvoid GroupTreeCtrl::Traverse(IGroupTreeVisitor& visitor) const\n{\n\tTraverse(m_root, visitor);\n}\n\nwxTreeItemId GroupTreeCtrl::AddNode()\n{\n\tstatic int s_num = 0;\n\n\tstd::ostringstream ss;\n\tss << \"GROUP_\" << s_num++;\n\tstd::string text = ss.str();\n\n\treturn AddNode(text);\n}\n\nwxTreeItemId GroupTreeCtrl::AddNode(const std::string& name)\n{\n\tGroupTreeItem* data = new GroupTreeItem(new Group(name));\n\n\twxTreeItemId ret;\n\twxTreeItemId id = GetFocusedItem();\n\tif (id.IsOk()) {\n\t\tdata->SetId(id);\n\t\tret = AddNode(id, name, data);\n\t} else {\n\t\tdata->SetId(m_root);\n\t\tret = AddNode(m_root, name, data);\n\t}\n\tSetItemBold(ret, true);\n\tSelectItem(ret);\n\treturn ret;\n}\n\nwxTreeItemId GroupTreeCtrl::AddNode(const std::string& name, wxTreeItemId parent)\n{\n\tGroupTreeItem* data = new GroupTreeItem(new Group(name));\n\twxTreeItemId ret = AddNode(parent, name, data);\n\tSetItemBold(ret, true);\n\tSelectItem(ret);\n\treturn ret;\n}\n\nvoid GroupTreeCtrl::DelNode()\n{\n\twxTreeItemId id = GetFocusedItem();\n\tif (id.IsOk()) {\n\t\tDelete(id);\n\t}\n}\n\nwxTreeItemId GroupTreeCtrl::AddSprite(wxTreeItemId parent, d2d::ISprite* spr)\n{\n\tif (!parent.IsOk()) {\n\t\treturn m_root;\n\t}\t\n\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(parent);\n\tif (!data) {\n\t\treturn m_root;\n\t}\n\n\tGroup* group = data->m_group;\n\tif (!group) {\n\t\treturn m_root;\n\t}\n\n\tbool ok = group->Insert(spr);\n\tif (ok) {\n\t\tGroupTreeItem* data = new GroupTreeItem(spr);\n\t\treturn AddNode(parent, spr->name, data);\n\t} else {\n\t\treturn m_root;\n\t}\n}\n\nwxTreeItemId GroupTreeCtrl::AddSprite(d2d::ISprite* spr)\n{\n\twxTreeItemId ret;\n\tif (m_selected_item.IsOk()) {\n\t\tret = AddSprite(m_selected_item, spr);\n\t}\n\tif (!ret.IsOk() || ret == m_root) {\n\t\tassert(m_root.IsOk());\n\t\tret = AddSprite(m_root, spr);\n\t}\n\treturn ret;\n}\n\nvoid GroupTreeCtrl::Clear()\n{\n\tif (!IsEmpty()) {\n\t\tCollapseAndReset(m_root);\n\t}\n}\n\nvoid GroupTreeCtrl::Remove(ISprite* sprite)\n{\n\tif (m_remove_open) {\n\t\tTraverse(GroupTreeImpl::RemoveVisitor(this, sprite));\n\t}\n}\n\nvoid GroupTreeCtrl::Visible(wxTreeItemId id, bool visible)\n{\n\tTraverse(id, GroupTreeImpl::SetVisibleVisitor(this, visible));\n}\n\nvoid GroupTreeCtrl::Editable(wxTreeItemId id, bool editable)\n{\n\tTraverse(id, GroupTreeImpl::SetEditableVisitor(this, editable));\n}\n\nvoid GroupTreeCtrl::ReorderItem(wxTreeItemId id, bool up)\n{\n\tif (!id.IsOk()) {\n\t\treturn;\n\t}\n\n\twxTreeItemId insert_prev;\n\tif (up) {\n\t\twxTreeItemId prev = GetPrevSibling(id);\n\t\tif (!prev.IsOk()) {\n\t\t\treturn;\n\t\t}\n\t\tinsert_prev = GetPrevSibling(prev);\n\t} else {\n\t\twxTreeItemId next = GetNextSibling(id);\n\t\tif (!next.IsOk()) {\n\t\t\treturn;\n\t\t}\n\t\tinsert_prev = next;\n\t}\n\n\t\/\/ old info\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(id);\n\tstd::string name = GetItemText(id);\n\n\t\/\/ insert\n\twxTreeItemId parent = GetItemParent(id);\n\twxTreeItemId new_item;\n\tif (insert_prev.IsOk()) {\n\t\tnew_item = InsertItem(parent, insert_prev, name, -1, -1, data->Clone());\n\t} else {\n\t\tnew_item = InsertItem(parent, 0, name, -1, -1, data->Clone());\n\t}\n\tExpandAll();\n\t\/\/ copy older's children\n\tTraverse(id, GroupTreeImpl::CopyPasteVisitor(this, id, new_item));\n\t\/\/ remove\n\tDelete(id);\n\t\/\/ sort\n\tReorderSprites();\n\t\/\/ set selection\n\tSelectItem(new_item);\n}\n\nwxTreeItemId GroupTreeCtrl::AddNode(wxTreeItemId parent, const std::string& name, GroupTreeItem* data)\n{\n\twxTreeItemId id = InsertItem(parent, 0, name, -1, -1, data);\n\tExpandAll();\n\treturn id;\n}\n\nvoid GroupTreeCtrl::InitRoot()\n{\n\tGroupTreeItem* data = new GroupTreeItem(new Group(\"ROOT\"));\n\tm_root = AddRoot(\"ROOT\");\n\tSetItemBold(m_root, true);\n\tSetItemData(m_root, data);\n}\n\nvoid GroupTreeCtrl::OnItemRClick(wxTreeEvent& event)\n{\n\twxTreeItemId itemId = event.GetItem();\n\n\tGroupTreeItem* item = (GroupTreeItem*)GetItemData(itemId);\n\n\tevent.Skip();\n}\n\nvoid GroupTreeCtrl::OnItemMenu(wxTreeEvent& event)\n{\n\twxTreeItemId id = event.GetItem();\n\tif (!id.IsOk()) {\n\t\treturn;\n\t}\t\n\n\twxPoint clientpt = event.GetPoint();\n\twxPoint screenpt = ClientToScreen(clientpt);\n\tShowMenu(id, clientpt);\n\tevent.Skip();\n}\n\nvoid GroupTreeCtrl::OnItemActivated(wxTreeEvent& event)\n{\n\twxTreeItemId id = event.GetItem();\n\tSpriteSelection* selection = m_sprite_impl->getSpriteSelection();\n\tselection->Clear();\n\tTraverse(id, GroupTreeImpl::SelectVisitor(this, selection));\n}\n\nvoid GroupTreeCtrl::OnBeginDrag(wxTreeEvent& event)\n{\n\tm_dragged_item = event.GetItem();\n\tevent.Allow();\n}\n\nvoid GroupTreeCtrl::OnEndDrag(wxTreeEvent& event)\n{\n\twxTreeItemId item_src = m_dragged_item,\n\t\titem_dst = event.GetItem();\n\tif (!item_dst.IsOk()) {\n\t\treturn;\n\t}\n\n\twxLogDebug(\"Drag from %s to %s\", GetItemText(item_src), GetItemText(item_dst));\n\n\t\/\/ old info\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(item_src);\n\tstd::string name = GetItemText(item_src);\n\t\/\/ insert\n\twxTreeItemId new_item = InsertItem(item_dst, 0, name, -1, -1, data->Clone());\n\tExpandAll();\n\t\/\/ copy older's children\n\tTraverse(item_src, GroupTreeImpl::CopyPasteVisitor(this, item_src, new_item));\n\t\/\/ remove\n\tDelete(item_src);\n\t\/\/ sort\n\tReorderSprites();\n}\n\nvoid GroupTreeCtrl::OnKeyDown(wxKeyEvent& event)\n{\n\tswitch (event.GetKeyCode())\n\t{\n\tcase WXK_UP:\n\t\tSelectUp();\n\t\tbreak;\n\tcase WXK_DOWN:\n\t\tSelectDown();\n\t\tbreak;\n\tcase WXK_LEFT:\n\t\tSelectLeft();\n\t\tbreak;\n\tcase WXK_RIGHT:\n\t\tSelectRight();\n\t\tbreak;\n\tcase WXK_PAGEUP:\n\t\tReorderItem(m_selected_item, true);\n\t\tbreak;\n\tcase WXK_PAGEDOWN:\n\t\tReorderItem(m_selected_item, false);\n\t\tbreak;\n\t}\n}\n\nvoid GroupTreeCtrl::OnSelChanged(wxTreeEvent& event)\n{\n\tm_selected_item = event.GetItem();\n\n\twxLogDebug(\"OnSelChanged %s\", GetItemText(m_selected_item));\n\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(m_selected_item);\n\tif (data && data->m_sprite) {\n\t\tm_view_panel_mgr->SelectSprite(data->m_sprite, m_parent_panel);\n\t}\n}\n\nvoid GroupTreeCtrl::OnMenuAddSprites(wxCommandEvent& event)\n{\n\tif (!m_on_menu_id.IsOk()) {\n\t\treturn;\n\t}\n\n\tGroupTreeItem* data = (GroupTreeItem*)GetItemData(m_on_menu_id);\n\tif (!data) {\n\t\treturn;\n\t}\n\n\tGroup* group = data->m_group;\n\tif (!group) {\n\t\treturn;\n\t}\n\n\tSpriteSelection* selection = m_sprite_impl->getSpriteSelection();\n\tstd::vector<ISprite*> sprites;\n\tselection->Traverse(FetchAllVisitor<ISprite>(sprites));\n\tfor (int i = 0, n = sprites.size(); i < n; ++i) {\n\t\tISprite* spr = sprites[i];\n\t\tbool ok = group->Insert(spr);\n\t\tif (ok) {\n\t\t\tGroupTreeItem* data = new GroupTreeItem(spr);\n\t\t\tAddNode(m_on_menu_id, spr->name, data);\n\t\t}\n\t}\n}\n\nvoid GroupTreeCtrl::OnMenuClear(wxCommandEvent& event)\n{\n\tif (!m_on_menu_id.IsOk()) {\n\t\treturn;\n\t}\t\n\n\tGroup* group = ((GroupTreeItem*)GetItemData(m_on_menu_id))->m_group;\n\tif (!group) {\n\t\treturn;\n\t}\n\n\tgroup->Clear();\n\tCollapseAndReset(m_on_menu_id);\n}\n\nvoid GroupTreeCtrl::OnMenuVisible(wxCommandEvent& event)\n{\n\tTraverse(m_on_menu_id, GroupTreeImpl::VisibleVisitor(this));\n}\n\nvoid GroupTreeCtrl::OnMenuEditable(wxCommandEvent& event)\n{\n\tTraverse(m_on_menu_id, GroupTreeImpl::EditableVisitor(this));\n}\n\nvoid GroupTreeCtrl::SelectUp()\n{\n\tif (!m_selected_item.IsOk()) {\n\t\treturn;\n\t}\n\n\twxTreeItemId prev = GetPrevSibling(m_selected_item);\n\tif (prev.IsOk()) {\n\t\tSelectItem(prev); \n\t}\n}\n\nvoid GroupTreeCtrl::SelectDown()\n{\n\tif (!m_selected_item.IsOk()) {\n\t\treturn;\n\t}\n\n\twxTreeItemId next = GetNextSibling(m_selected_item);\n\tif (next.IsOk()) {\n\t\tSelectItem(next); \n\t}\n}\n\nvoid GroupTreeCtrl::SelectLeft()\n{\n\tif (!m_selected_item.IsOk()) {\n\t\treturn;\n\t}\n\n\tif (ItemHasChildren(m_selected_item) && IsExpanded(m_selected_item)) {\n\t\tCollapse(m_selected_item);\n\t} else {\n\t \twxTreeItemId parent = GetItemParent(m_selected_item);\n\t \tif (parent.IsOk() && parent != m_root) {\n\t \t\tSelectItem(parent);\n\t \t}\n\t}\n}\n\nvoid GroupTreeCtrl::SelectRight()\n{\n\tif (!m_selected_item.IsOk()) {\n\t\treturn;\n\t}\n\n\tif (ItemHasChildren(m_selected_item)) {\n\t\tif (IsExpanded(m_selected_item)) {\n\t\t\twxTreeItemIdValue cookie;\n\t\t\twxTreeItemId next = GetFirstChild(m_selected_item, cookie);\n\t\t\tif (next.IsOk()) {\n\t\t\t\tSelectItem(next);\n\t\t\t}\n\t\t} else {\n\t\t\tExpand(m_selected_item);\n\t\t}\n\t}\n}\n\nvoid GroupTreeCtrl::ReorderSprites()\n{\n\tstd::vector<ISprite*> sprites;\n\tTraverse(m_root, GroupTreeImpl::GetSpritesVisitor(this, sprites));\n\tfor (int i = sprites.size() - 1; i >= 0; --i) {\n\t\tISprite* spr = sprites[i];\n\t\tm_remove_open = false;\n\t\tm_sprite_impl->removeSprite(spr);\n\t\tm_remove_open = true;\n\t\tm_sprite_impl->insertSprite(spr);\n\t}\n}\n\nvoid GroupTreeCtrl::ShowMenu(wxTreeItemId id, const wxPoint& pt)\n{\n\tm_on_menu_id = id;\n\n\twxMenu menu;\n\n\tmenu.Append(ID_MENU_ADD, wxT(\"&Add Sprites\"));\n\tBind(wxEVT_COMMAND_MENU_SELECTED, &GroupTreeCtrl::OnMenuAddSprites, this, ID_MENU_ADD);\n\n\tmenu.Append(ID_MENU_CLEAR, wxT(\"&Clear Sprites\"));\n\tBind(wxEVT_COMMAND_MENU_SELECTED, &GroupTreeCtrl::OnMenuClear, this, ID_MENU_CLEAR);\n\n\tmenu.AppendSeparator();\n\n\tmenu.AppendCheckItem(ID_MENU_VISIBLE, wxT(\"&Visible\"));\n\tBind(wxEVT_COMMAND_MENU_SELECTED, &GroupTreeCtrl::OnMenuVisible, this, ID_MENU_VISIBLE);\n\n\tmenu.AppendCheckItem(ID_MENU_EDITABLE, wxT(\"&Editable\"));\n\tBind(wxEVT_COMMAND_MENU_SELECTED, &GroupTreeCtrl::OnMenuEditable, this, ID_MENU_EDITABLE);\n\n\tPopupMenu(&menu, pt);\n}\n\nvoid GroupTreeCtrl::Traverse(wxTreeItemId id, IGroupTreeVisitor& visitor) const\n{\n\tstd::queue<wxTreeItemId> buf;\n\tbuf.push(id);\n\twhile (!buf.empty()) {\n\t\twxTreeItemId item = buf.front(); buf.pop();\n\n\t\twxTreeItemIdValue cookie;\n\t\twxTreeItemId id = GetFirstChild(item, cookie);\n\t\tif (id.IsOk()) {\n\t\t\tif (item != id) {\n\t\t\t\tbool finish = visitor.VisitNonleaf(item);\n\t\t\t\tif (finish) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\twhile (id.IsOk()) {\n\t\t\t\tbuf.push(id);\n\t\t\t\tid = GetNextSibling(id);\n\t\t\t}\n\t\t} else {\n\t\t\tbool finish = visitor.VisitLeaf(item);\n\t\t\tif (finish) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef MAPNIK_VECTOR_TILE_STRATEGY_HPP\n#define MAPNIK_VECTOR_TILE_STRATEGY_HPP\n\n\/\/ mapnik\n#include <mapnik\/config.hpp>\n#include <mapnik\/util\/noncopyable.hpp>\n#include <mapnik\/proj_transform.hpp>\n#include <mapnik\/view_transform.hpp>\n#include <mapnik\/geometry_envelope.hpp>\n\n#include \"clipper.hpp\"\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wunused-parameter\"\n#pragma GCC diagnostic ignored \"-Wunused-local-typedef\"\n#include <boost\/geometry\/core\/coordinate_type.hpp>\n#include <boost\/geometry\/core\/access.hpp>\n#include <boost\/numeric\/conversion\/cast.hpp>\n#pragma GCC diagnostic pop\n\nnamespace mapnik {\n\nnamespace vector_tile_impl {\n\nstatic constexpr double coord_max = static_cast<double>(ClipperLib::hiRange);\nstatic constexpr double coord_min = -1 * static_cast<double>(ClipperLib::hiRange);\n\nstruct vector_tile_strategy\n{\n    vector_tile_strategy(view_transform const& tr,\n                          double scaling)\n        : tr_(tr),\n          scaling_(scaling) {}\n\n    template <typename P1, typename P2>\n    inline bool apply(P1 const& p1, P2 & p2) const\n    {\n        using p2_type = typename boost::geometry::coordinate_type<P2>::type;\n        double x = boost::geometry::get<0>(p1);\n        double y = boost::geometry::get<1>(p1);\n        tr_.forward(&x,&y);\n        x = std::round(x * scaling_);\n        y = std::round(y * scaling_);\n        if (x <= coord_min || x >= coord_max ||\n            y <= coord_min || y >= coord_max) return false;\n        boost::geometry::set<0>(p2, static_cast<p2_type>(x));\n        boost::geometry::set<1>(p2, static_cast<p2_type>(y));\n        return true;\n    }\n\n    template <typename P1, typename P2>\n    inline P2 execute(P1 const& p1, bool & status) const\n    {\n        P2 p2;\n        status = apply(p1, p2);\n        return p2;\n    }\n\n    view_transform const& tr_;\n    double const scaling_;\n};\n\nstruct vector_tile_strategy_proj\n{\n    vector_tile_strategy_proj(proj_transform const& prj_trans,\n                         view_transform const& tr,\n                         double scaling)\n        : prj_trans_(prj_trans),\n          tr_(tr),\n          scaling_(scaling),\n          not_equal_(!prj_trans_.equal()) {}\n\n    template <typename P1, typename P2>\n    inline bool apply(P1 const& p1, P2 & p2) const\n    {\n        using p2_type = typename boost::geometry::coordinate_type<P2>::type;\n        double x = boost::geometry::get<0>(p1);\n        double y = boost::geometry::get<1>(p1);\n        double z = 0.0;\n        if (not_equal_ && !prj_trans_.backward(x, y, z)) return false;\n        tr_.forward(&x,&y);\n        x = std::round(x * scaling_);\n        y = std::round(y * scaling_);\n        if (x <= coord_min || x >= coord_max ||\n            y <= coord_min || y >= coord_max) return false;\n        boost::geometry::set<0>(p2, static_cast<p2_type>(x));\n        boost::geometry::set<1>(p2, static_cast<p2_type>(y));\n        return true;\n    }\n    \n    template <typename P1, typename P2>\n    inline P2 execute(P1 const& p1, bool & status) const\n    {\n        P2 p2;\n        status = apply(p1, p2);\n        return p2;\n    }\n\n    proj_transform const& prj_trans_;\n    view_transform const& tr_;\n    double const scaling_;\n    bool not_equal_;\n};\n\n\/\/ TODO - avoid creating degenerate polygons when first\/last point of ring is skipped\ntemplate <typename TransformType>\nstruct transform_visitor {\n\n    transform_visitor(TransformType const& tr, box2d<double> const& target_clipping_extent) :\n      tr_(tr),\n      target_clipping_extent_(target_clipping_extent) {}\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::point<double> const& geom)\n    {\n        if (!target_clipping_extent_.intersects(geom.x,geom.y)) return mapnik::geometry::geometry_empty(); \n        mapnik::geometry::point<std::int64_t> new_geom;\n        if (!tr_.apply(geom,new_geom)) return mapnik::geometry::geometry_empty();\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::multi_point<double> const& geom)\n    {\n        mapnik::geometry::multi_point<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& pt : geom)\n        {\n            mapnik::geometry::point<std::int64_t> pt2;\n            if (target_clipping_extent_.intersects(pt.x, pt.y) && tr_.apply(pt,pt2))\n            {\n                new_geom.push_back(std::move(pt2));\n            }\n        }\n        if (new_geom.empty()) return mapnik::geometry::geometry_empty();\n        new_geom.shrink_to_fit();\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::line_string<double> const& geom)\n    {\n        mapnik::box2d<double> geom_bbox = mapnik::geometry::envelope(geom);\n        if (!target_clipping_extent_.intersects(geom_bbox)) \n        {\n            return mapnik::geometry::geometry_empty();\n        }\n        mapnik::geometry::line_string<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& pt : geom)\n        {\n            mapnik::geometry::point<std::int64_t> pt2;\n            if (tr_.apply(pt,pt2))\n            {\n                new_geom.push_back(std::move(pt2));\n            }\n        }\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::multi_line_string<double> const& geom)\n    {\n        mapnik::geometry::multi_line_string<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& line : geom)\n        {\n            mapnik::box2d<double> line_bbox = mapnik::geometry::envelope(line);\n            if (!target_clipping_extent_.intersects(line_bbox)) continue;\n            mapnik::geometry::line_string<std::int64_t> new_line;\n            new_line.reserve(line.size());\n            for (auto const& pt : line)\n            {\n                mapnik::geometry::point<std::int64_t> pt2;\n                if (tr_.apply(pt,pt2))\n                {\n                    new_line.push_back(std::move(pt2));\n                }\n            }\n            new_geom.push_back(std::move(new_line));\n        }\n        if (new_geom.empty()) return mapnik::geometry::geometry_empty();\n        new_geom.shrink_to_fit();\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::polygon<double> const& geom)\n    {\n        mapnik::box2d<double> ext_bbox = mapnik::geometry::envelope(geom);\n        if (!target_clipping_extent_.intersects(ext_bbox))\n        {\n            return mapnik::geometry::geometry_empty();\n        }\n        mapnik::geometry::polygon<std::int64_t> new_geom;\n        new_geom.exterior_ring.reserve(geom.exterior_ring.size());\n        for (auto const& pt : geom.exterior_ring)\n        {\n            mapnik::geometry::point<std::int64_t> pt2;\n            if (tr_.apply(pt,pt2))\n            {\n                new_geom.exterior_ring.push_back(std::move(pt2));\n            }\n        }\n        for (auto const& ring : geom.interior_rings)\n        {\n            mapnik::box2d<double> ring_bbox = mapnik::geometry::envelope(static_cast<mapnik::geometry::line_string<double> const&>(ring));\n            if (!target_clipping_extent_.intersects(ring_bbox)) \n            {\n                continue;\n            }\n            mapnik::geometry::linear_ring<std::int64_t> new_ring;\n            new_ring.reserve(ring.size());\n            for (auto const& pt : ring)\n            {\n                mapnik::geometry::point<std::int64_t> pt2;\n                if (tr_.apply(pt,pt2))\n                {\n                    new_ring.push_back(std::move(pt2));\n                }\n            }\n            new_geom.interior_rings.push_back(std::move(new_ring));\n        }\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::multi_polygon<double> const& geom)\n    {\n        mapnik::geometry::multi_polygon<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& poly : geom)\n        {\n            mapnik::box2d<double> ext_bbox = mapnik::geometry::envelope(poly);\n            if (!target_clipping_extent_.intersects(ext_bbox)) \n            {\n                continue;\n            }\n            mapnik::geometry::polygon<std::int64_t> new_poly;\n            new_poly.exterior_ring.reserve(poly.exterior_ring.size());\n            for (auto const& pt : poly.exterior_ring)\n            {\n                mapnik::geometry::point<std::int64_t> pt2;\n                if (tr_.apply(pt,pt2))\n                {\n                    new_poly.exterior_ring.push_back(std::move(pt2));\n                }\n            }\n            for (auto const& ring : poly.interior_rings)\n            {\n                mapnik::box2d<double> ring_bbox = mapnik::geometry::envelope(static_cast<mapnik::geometry::line_string<double> const&>(ring));\n                if (!target_clipping_extent_.intersects(ring_bbox))\n                {\n                    continue;\n                }\n                mapnik::geometry::linear_ring<std::int64_t> new_ring;\n                new_ring.reserve(ring.size());\n                for (auto const& pt : ring)\n                {\n                    mapnik::geometry::point<std::int64_t> pt2;\n                    if (tr_.apply(pt,pt2))\n                    {\n                        new_ring.push_back(std::move(pt2));\n                    }\n                }\n                new_poly.interior_rings.push_back(std::move(new_ring));\n            }\n            new_geom.push_back(std::move(new_poly));\n        }\n        if (new_geom.empty()) return mapnik::geometry::geometry_empty();\n        new_geom.shrink_to_fit();\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::geometry_collection<double> const& geom)\n    {\n        mapnik::geometry::geometry_collection<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& g : geom)\n        {\n            new_geom.push_back(mapnik::util::apply_visitor((*this), g));\n        }\n        return new_geom;\n     }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::geometry_empty const& geom)\n    {\n        return geom;\n    }\n    TransformType const& tr_;\n    box2d<double> const& target_clipping_extent_;\n};\n\n}\n}\n\n#endif \/\/ MAPNIK_VECTOR_TILE_STRATEGY_HPP\n<commit_msg>remove shrink_to_fix - refs mapnik\/mapnik#2984<commit_after>#ifndef MAPNIK_VECTOR_TILE_STRATEGY_HPP\n#define MAPNIK_VECTOR_TILE_STRATEGY_HPP\n\n\/\/ mapnik\n#include <mapnik\/config.hpp>\n#include <mapnik\/util\/noncopyable.hpp>\n#include <mapnik\/proj_transform.hpp>\n#include <mapnik\/view_transform.hpp>\n#include <mapnik\/geometry_envelope.hpp>\n\n#include \"clipper.hpp\"\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wunused-parameter\"\n#pragma GCC diagnostic ignored \"-Wunused-local-typedef\"\n#include <boost\/geometry\/core\/coordinate_type.hpp>\n#include <boost\/geometry\/core\/access.hpp>\n#include <boost\/numeric\/conversion\/cast.hpp>\n#pragma GCC diagnostic pop\n\nnamespace mapnik {\n\nnamespace vector_tile_impl {\n\nstatic constexpr double coord_max = static_cast<double>(ClipperLib::hiRange);\nstatic constexpr double coord_min = -1 * static_cast<double>(ClipperLib::hiRange);\n\nstruct vector_tile_strategy\n{\n    vector_tile_strategy(view_transform const& tr,\n                          double scaling)\n        : tr_(tr),\n          scaling_(scaling) {}\n\n    template <typename P1, typename P2>\n    inline bool apply(P1 const& p1, P2 & p2) const\n    {\n        using p2_type = typename boost::geometry::coordinate_type<P2>::type;\n        double x = boost::geometry::get<0>(p1);\n        double y = boost::geometry::get<1>(p1);\n        tr_.forward(&x,&y);\n        x = std::round(x * scaling_);\n        y = std::round(y * scaling_);\n        if (x <= coord_min || x >= coord_max ||\n            y <= coord_min || y >= coord_max) return false;\n        boost::geometry::set<0>(p2, static_cast<p2_type>(x));\n        boost::geometry::set<1>(p2, static_cast<p2_type>(y));\n        return true;\n    }\n\n    template <typename P1, typename P2>\n    inline P2 execute(P1 const& p1, bool & status) const\n    {\n        P2 p2;\n        status = apply(p1, p2);\n        return p2;\n    }\n\n    view_transform const& tr_;\n    double const scaling_;\n};\n\nstruct vector_tile_strategy_proj\n{\n    vector_tile_strategy_proj(proj_transform const& prj_trans,\n                         view_transform const& tr,\n                         double scaling)\n        : prj_trans_(prj_trans),\n          tr_(tr),\n          scaling_(scaling),\n          not_equal_(!prj_trans_.equal()) {}\n\n    template <typename P1, typename P2>\n    inline bool apply(P1 const& p1, P2 & p2) const\n    {\n        using p2_type = typename boost::geometry::coordinate_type<P2>::type;\n        double x = boost::geometry::get<0>(p1);\n        double y = boost::geometry::get<1>(p1);\n        double z = 0.0;\n        if (not_equal_ && !prj_trans_.backward(x, y, z)) return false;\n        tr_.forward(&x,&y);\n        x = std::round(x * scaling_);\n        y = std::round(y * scaling_);\n        if (x <= coord_min || x >= coord_max ||\n            y <= coord_min || y >= coord_max) return false;\n        boost::geometry::set<0>(p2, static_cast<p2_type>(x));\n        boost::geometry::set<1>(p2, static_cast<p2_type>(y));\n        return true;\n    }\n    \n    template <typename P1, typename P2>\n    inline P2 execute(P1 const& p1, bool & status) const\n    {\n        P2 p2;\n        status = apply(p1, p2);\n        return p2;\n    }\n\n    proj_transform const& prj_trans_;\n    view_transform const& tr_;\n    double const scaling_;\n    bool not_equal_;\n};\n\n\/\/ TODO - avoid creating degenerate polygons when first\/last point of ring is skipped\ntemplate <typename TransformType>\nstruct transform_visitor {\n\n    transform_visitor(TransformType const& tr, box2d<double> const& target_clipping_extent) :\n      tr_(tr),\n      target_clipping_extent_(target_clipping_extent) {}\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::point<double> const& geom)\n    {\n        if (!target_clipping_extent_.intersects(geom.x,geom.y)) return mapnik::geometry::geometry_empty(); \n        mapnik::geometry::point<std::int64_t> new_geom;\n        if (!tr_.apply(geom,new_geom)) return mapnik::geometry::geometry_empty();\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::multi_point<double> const& geom)\n    {\n        mapnik::geometry::multi_point<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& pt : geom)\n        {\n            mapnik::geometry::point<std::int64_t> pt2;\n            if (target_clipping_extent_.intersects(pt.x, pt.y) && tr_.apply(pt,pt2))\n            {\n                new_geom.push_back(std::move(pt2));\n            }\n        }\n        if (new_geom.empty()) return mapnik::geometry::geometry_empty();\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::line_string<double> const& geom)\n    {\n        mapnik::box2d<double> geom_bbox = mapnik::geometry::envelope(geom);\n        if (!target_clipping_extent_.intersects(geom_bbox)) \n        {\n            return mapnik::geometry::geometry_empty();\n        }\n        mapnik::geometry::line_string<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& pt : geom)\n        {\n            mapnik::geometry::point<std::int64_t> pt2;\n            if (tr_.apply(pt,pt2))\n            {\n                new_geom.push_back(std::move(pt2));\n            }\n        }\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::multi_line_string<double> const& geom)\n    {\n        mapnik::geometry::multi_line_string<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& line : geom)\n        {\n            mapnik::box2d<double> line_bbox = mapnik::geometry::envelope(line);\n            if (!target_clipping_extent_.intersects(line_bbox)) continue;\n            mapnik::geometry::line_string<std::int64_t> new_line;\n            new_line.reserve(line.size());\n            for (auto const& pt : line)\n            {\n                mapnik::geometry::point<std::int64_t> pt2;\n                if (tr_.apply(pt,pt2))\n                {\n                    new_line.push_back(std::move(pt2));\n                }\n            }\n            new_geom.push_back(std::move(new_line));\n        }\n        if (new_geom.empty()) return mapnik::geometry::geometry_empty();\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::polygon<double> const& geom)\n    {\n        mapnik::box2d<double> ext_bbox = mapnik::geometry::envelope(geom);\n        if (!target_clipping_extent_.intersects(ext_bbox))\n        {\n            return mapnik::geometry::geometry_empty();\n        }\n        mapnik::geometry::polygon<std::int64_t> new_geom;\n        new_geom.exterior_ring.reserve(geom.exterior_ring.size());\n        for (auto const& pt : geom.exterior_ring)\n        {\n            mapnik::geometry::point<std::int64_t> pt2;\n            if (tr_.apply(pt,pt2))\n            {\n                new_geom.exterior_ring.push_back(std::move(pt2));\n            }\n        }\n        for (auto const& ring : geom.interior_rings)\n        {\n            mapnik::box2d<double> ring_bbox = mapnik::geometry::envelope(static_cast<mapnik::geometry::line_string<double> const&>(ring));\n            if (!target_clipping_extent_.intersects(ring_bbox)) \n            {\n                continue;\n            }\n            mapnik::geometry::linear_ring<std::int64_t> new_ring;\n            new_ring.reserve(ring.size());\n            for (auto const& pt : ring)\n            {\n                mapnik::geometry::point<std::int64_t> pt2;\n                if (tr_.apply(pt,pt2))\n                {\n                    new_ring.push_back(std::move(pt2));\n                }\n            }\n            new_geom.interior_rings.push_back(std::move(new_ring));\n        }\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::multi_polygon<double> const& geom)\n    {\n        mapnik::geometry::multi_polygon<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& poly : geom)\n        {\n            mapnik::box2d<double> ext_bbox = mapnik::geometry::envelope(poly);\n            if (!target_clipping_extent_.intersects(ext_bbox)) \n            {\n                continue;\n            }\n            mapnik::geometry::polygon<std::int64_t> new_poly;\n            new_poly.exterior_ring.reserve(poly.exterior_ring.size());\n            for (auto const& pt : poly.exterior_ring)\n            {\n                mapnik::geometry::point<std::int64_t> pt2;\n                if (tr_.apply(pt,pt2))\n                {\n                    new_poly.exterior_ring.push_back(std::move(pt2));\n                }\n            }\n            for (auto const& ring : poly.interior_rings)\n            {\n                mapnik::box2d<double> ring_bbox = mapnik::geometry::envelope(static_cast<mapnik::geometry::line_string<double> const&>(ring));\n                if (!target_clipping_extent_.intersects(ring_bbox))\n                {\n                    continue;\n                }\n                mapnik::geometry::linear_ring<std::int64_t> new_ring;\n                new_ring.reserve(ring.size());\n                for (auto const& pt : ring)\n                {\n                    mapnik::geometry::point<std::int64_t> pt2;\n                    if (tr_.apply(pt,pt2))\n                    {\n                        new_ring.push_back(std::move(pt2));\n                    }\n                }\n                new_poly.interior_rings.push_back(std::move(new_ring));\n            }\n            new_geom.push_back(std::move(new_poly));\n        }\n        if (new_geom.empty()) return mapnik::geometry::geometry_empty();\n        return new_geom;\n    }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::geometry_collection<double> const& geom)\n    {\n        mapnik::geometry::geometry_collection<std::int64_t> new_geom;\n        new_geom.reserve(geom.size());\n        for (auto const& g : geom)\n        {\n            new_geom.push_back(mapnik::util::apply_visitor((*this), g));\n        }\n        return new_geom;\n     }\n\n    inline mapnik::geometry::geometry<std::int64_t> operator() (mapnik::geometry::geometry_empty const& geom)\n    {\n        return geom;\n    }\n    TransformType const& tr_;\n    box2d<double> const& target_clipping_extent_;\n};\n\n}\n}\n\n#endif \/\/ MAPNIK_VECTOR_TILE_STRATEGY_HPP\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Initialize an empty password for NSS databases (so that the databases won't require login) if the password hasn't been initialized yet.<commit_after><|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\/renderer\/chrome_render_process_observer.h\"\n\n#include <limits>\n#include <vector>\n\n#include \"base\/allocator\/allocator_extension.h\"\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/memory\/weak_ptr.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"base\/metrics\/statistics_recorder.h\"\n#include \"base\/native_library.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"chrome\/common\/child_process_logging.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/extensions\/extension_localization_peer.h\"\n#include \"chrome\/common\/metrics\/variations\/variations_util.h\"\n#include \"chrome\/common\/net\/net_resource_provider.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/renderer\/chrome_content_renderer_client.h\"\n#include \"chrome\/renderer\/content_settings_observer.h\"\n#include \"chrome\/renderer\/security_filter_peer.h\"\n#include \"content\/public\/common\/resource_dispatcher_delegate.h\"\n#include \"content\/public\/renderer\/render_thread.h\"\n#include \"content\/public\/renderer\/render_view_visitor.h\"\n#include \"content\/public\/renderer\/render_view.h\"\n#include \"crypto\/nss_util.h\"\n#include \"media\/base\/media_switches.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/net_module.h\"\n#include \"third_party\/sqlite\/sqlite3.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebCache.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebCrossOriginPreflightResultCache.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebDocument.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFontCache.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebRuntimeFeatures.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebView.h\"\n#include \"v8\/include\/v8.h\"\n\n#if defined(OS_WIN)\n#include \"base\/win\/iat_patch_function.h\"\n#endif\n\n#if defined(USE_TCMALLOC)\n#include \"third_party\/tcmalloc\/chromium\/src\/gperftools\/heap-profiler.h\"\n#endif\n\nusing WebKit::WebCache;\nusing WebKit::WebCrossOriginPreflightResultCache;\nusing WebKit::WebFontCache;\nusing WebKit::WebRuntimeFeatures;\nusing content::RenderThread;\n\nnamespace {\n\nstatic const int kCacheStatsDelayMS = 2000;\n\nclass RendererResourceDelegate : public content::ResourceDispatcherDelegate {\n public:\n  RendererResourceDelegate()\n      : ALLOW_THIS_IN_INITIALIZER_LIST(weak_factory_(this)) {\n  }\n\n  virtual webkit_glue::ResourceLoaderBridge::Peer* OnRequestComplete(\n      webkit_glue::ResourceLoaderBridge::Peer* current_peer,\n      ResourceType::Type resource_type,\n      int error_code) {\n    \/\/ Update the browser about our cache.\n    \/\/ Rate limit informing the host of our cache stats.\n    if (!weak_factory_.HasWeakPtrs()) {\n      MessageLoop::current()->PostDelayedTask(\n         FROM_HERE,\n         base::Bind(&RendererResourceDelegate::InformHostOfCacheStats,\n                    weak_factory_.GetWeakPtr()),\n         base::TimeDelta::FromMilliseconds(kCacheStatsDelayMS));\n    }\n\n    if (error_code == net::ERR_ABORTED) {\n      return NULL;\n    }\n\n    \/\/ Resource canceled with a specific error are filtered.\n    return SecurityFilterPeer::CreateSecurityFilterPeerForDeniedRequest(\n        resource_type, current_peer, error_code);\n  }\n\n  virtual webkit_glue::ResourceLoaderBridge::Peer* OnReceivedResponse(\n      webkit_glue::ResourceLoaderBridge::Peer* current_peer,\n      const std::string& mime_type,\n      const GURL& url) {\n    return ExtensionLocalizationPeer::CreateExtensionLocalizationPeer(\n        current_peer, RenderThread::Get(), mime_type, url);\n  }\n\n private:\n  void InformHostOfCacheStats() {\n    WebCache::UsageStats stats;\n    WebCache::getUsageStats(&stats);\n    RenderThread::Get()->Send(new ChromeViewHostMsg_UpdatedCacheStats(stats));\n  }\n\n  base::WeakPtrFactory<RendererResourceDelegate> weak_factory_;\n\n  DISALLOW_COPY_AND_ASSIGN(RendererResourceDelegate);\n};\n\n#if defined(OS_WIN)\nstatic base::win::IATPatchFunction g_iat_patch_createdca;\nHDC WINAPI CreateDCAPatch(LPCSTR driver_name,\n                          LPCSTR device_name,\n                          LPCSTR output,\n                          const void* init_data) {\n  DCHECK(std::string(\"DISPLAY\") == std::string(driver_name));\n  DCHECK(!device_name);\n  DCHECK(!output);\n  DCHECK(!init_data);\n\n  \/\/ CreateDC fails behind the sandbox, but not CreateCompatibleDC.\n  return CreateCompatibleDC(NULL);\n}\n\nstatic base::win::IATPatchFunction g_iat_patch_get_font_data;\nDWORD WINAPI GetFontDataPatch(HDC hdc,\n                              DWORD table,\n                              DWORD offset,\n                              LPVOID buffer,\n                              DWORD length) {\n  int rv = GetFontData(hdc, table, offset, buffer, length);\n  if (rv == GDI_ERROR && hdc) {\n    HFONT font = static_cast<HFONT>(GetCurrentObject(hdc, OBJ_FONT));\n\n    LOGFONT logfont;\n    if (GetObject(font, sizeof(LOGFONT), &logfont)) {\n      std::vector<char> font_data;\n      RenderThread::Get()->PreCacheFont(logfont);\n      rv = GetFontData(hdc, table, offset, buffer, length);\n      RenderThread::Get()->ReleaseCachedFonts();\n    }\n  }\n  return rv;\n}\n#endif  \/\/ OS_WIN\n\n}  \/\/ namespace\n\nbool ChromeRenderProcessObserver::is_incognito_process_ = false;\n\nChromeRenderProcessObserver::ChromeRenderProcessObserver(\n    chrome::ChromeContentRendererClient* client)\n    : client_(client),\n      clear_cache_pending_(false) {\n  const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n  if (command_line.HasSwitch(switches::kEnableWatchdog)) {\n    \/\/ TODO(JAR): Need to implement renderer IO msgloop watchdog.\n  }\n\n  if (command_line.HasSwitch(switches::kDumpHistogramsOnExit)) {\n    base::StatisticsRecorder::set_dump_on_exit(true);\n  }\n\n#if defined(TOOLKIT_VIEWS)\n  WebRuntimeFeatures::enableRequestAutocomplete(\n      command_line.HasSwitch(switches::kEnableInteractiveAutocomplete) ||\n      command_line.HasSwitch(switches::kEnableExperimentalWebKitFeatures));\n#endif\n\n  RenderThread* thread = RenderThread::Get();\n  resource_delegate_.reset(new RendererResourceDelegate());\n  thread->SetResourceDispatcherDelegate(resource_delegate_.get());\n\n  \/\/ Configure modules that need access to resources.\n  net::NetModule::SetResourceProvider(chrome_common_net::NetResourceProvider);\n\n#if defined(OS_WIN)\n  \/\/ Need to patch a few functions for font loading to work correctly.\n  FilePath pdf;\n  if (PathService::Get(chrome::FILE_PDF_PLUGIN, &pdf) &&\n      file_util::PathExists(pdf)) {\n    g_iat_patch_createdca.Patch(\n        pdf.value().c_str(), \"gdi32.dll\", \"CreateDCA\", CreateDCAPatch);\n    g_iat_patch_get_font_data.Patch(\n        pdf.value().c_str(), \"gdi32.dll\", \"GetFontData\", GetFontDataPatch);\n  }\n#endif\n\n#if defined(OS_POSIX) && !defined(OS_MACOSX) && defined(USE_NSS)\n  \/\/ On platforms where we use system NSS libraries, the .so's must be loaded.\n  if (!command_line.HasSwitch(switches::kSingleProcess)) {\n    \/\/ We are going to fork to engage the sandbox and we have not loaded\n    \/\/ any security modules so it is safe to disable the fork check in NSS.\n    crypto::DisableNSSForkCheck();\n    crypto::ForceNSSNoDBInit();\n    crypto::EnsureNSSInit();\n  }\n#elif defined(OS_WIN)\n  \/\/ crypt32.dll is used to decode X509 certificates for Chromoting.\n  \/\/ Only load this library when the feature is enabled.\n  std::string error;\n  base::LoadNativeLibrary(FilePath(L\"crypt32.dll\"), &error);\n#endif\n  \/\/ Setup initial set of crash dump data for Field Trials in this renderer.\n  chrome_variations::SetChildProcessLoggingVariationList();\n}\n\nChromeRenderProcessObserver::~ChromeRenderProcessObserver() {\n}\n\nbool ChromeRenderProcessObserver::OnControlMessageReceived(\n    const IPC::Message& message) {\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(ChromeRenderProcessObserver, message)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_SetIsIncognitoProcess,\n                        OnSetIsIncognitoProcess)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_SetCacheCapacities, OnSetCacheCapacities)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_ClearCache, OnClearCache)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_SetFieldTrialGroup, OnSetFieldTrialGroup)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_GetV8HeapStats, OnGetV8HeapStats)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_GetCacheResourceStats,\n                        OnGetCacheResourceStats)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_PurgeMemory, OnPurgeMemory)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_SetContentSettingRules,\n                        OnSetContentSettingRules)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_ToggleWebKitSharedTimer,\n                        OnToggleWebKitSharedTimer)\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nvoid ChromeRenderProcessObserver::OnSetIsIncognitoProcess(\n    bool is_incognito_process) {\n  is_incognito_process_ = is_incognito_process;\n}\n\nvoid ChromeRenderProcessObserver::OnSetContentSettingRules(\n    const RendererContentSettingRules& rules) {\n  content_setting_rules_ = rules;\n}\n\nvoid ChromeRenderProcessObserver::OnSetCacheCapacities(size_t min_dead_capacity,\n                                                       size_t max_dead_capacity,\n                                                       size_t capacity) {\n  WebCache::setCapacities(\n      min_dead_capacity, max_dead_capacity, capacity);\n}\n\nvoid ChromeRenderProcessObserver::OnClearCache(bool on_navigation) {\n  if (on_navigation) {\n    clear_cache_pending_ = true;\n  } else {\n    WebCache::clear();\n  }\n}\n\nvoid ChromeRenderProcessObserver::OnGetCacheResourceStats() {\n  WebCache::ResourceTypeStats stats;\n  WebCache::getResourceTypeStats(&stats);\n  RenderThread::Get()->Send(new ChromeViewHostMsg_ResourceTypeStats(stats));\n}\n\nvoid ChromeRenderProcessObserver::OnSetFieldTrialGroup(\n    const std::string& field_trial_name,\n    const std::string& group_name) {\n  base::FieldTrial* trial =\n      base::FieldTrialList::CreateFieldTrial(field_trial_name, group_name);\n  \/\/ Ensure the trial is marked as \"used\" by calling group() on it. This is\n  \/\/ needed to ensure the trial is properly reported in renderer crash reports.\n  trial->group();\n  chrome_variations::SetChildProcessLoggingVariationList();\n}\n\nvoid ChromeRenderProcessObserver::OnGetV8HeapStats() {\n  v8::HeapStatistics heap_stats;\n  v8::V8::GetHeapStatistics(&heap_stats);\n  RenderThread::Get()->Send(new ChromeViewHostMsg_V8HeapStats(\n      heap_stats.total_heap_size(), heap_stats.used_heap_size()));\n}\n\nvoid ChromeRenderProcessObserver::OnToggleWebKitSharedTimer(bool suspend) {\n  RenderThread::Get()->ToggleWebKitSharedTimer(suspend);\n}\n\nvoid ChromeRenderProcessObserver::OnPurgeMemory() {\n  RenderThread::Get()->EnsureWebKitInitialized();\n\n  \/\/ Clear the object cache (as much as possible; some live objects cannot be\n  \/\/ freed).\n  WebCache::clear();\n\n  \/\/ Clear the font\/glyph cache.\n  WebFontCache::clear();\n\n  \/\/ Clear the Cross-Origin Preflight cache.\n  WebCrossOriginPreflightResultCache::clear();\n\n  \/\/ Release all freeable memory from the SQLite process-global page cache (a\n  \/\/ low-level object which backs the Connection-specific page caches).\n  while (sqlite3_release_memory(std::numeric_limits<int>::max()) > 0) {\n  }\n\n  v8::V8::LowMemoryNotification();\n\n  \/\/ Tell our allocator to release any free pages it's still holding.\n  base::allocator::ReleaseFreeMemory();\n\n  if (client_)\n    client_->OnPurgeMemory();\n}\n\nvoid ChromeRenderProcessObserver::ExecutePendingClearCache() {\n  if (clear_cache_pending_) {\n    clear_cache_pending_ = false;\n    WebCache::clear();\n  }\n}\n\nconst RendererContentSettingRules*\nChromeRenderProcessObserver::content_setting_rules() const {\n  return &content_setting_rules_;\n}\n<commit_msg>Replace NSS init with wrapper.<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\/renderer\/chrome_render_process_observer.h\"\n\n#include <limits>\n#include <vector>\n\n#include \"base\/allocator\/allocator_extension.h\"\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/memory\/weak_ptr.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"base\/metrics\/statistics_recorder.h\"\n#include \"base\/native_library.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"chrome\/common\/child_process_logging.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/extensions\/extension_localization_peer.h\"\n#include \"chrome\/common\/metrics\/variations\/variations_util.h\"\n#include \"chrome\/common\/net\/net_resource_provider.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/renderer\/chrome_content_renderer_client.h\"\n#include \"chrome\/renderer\/content_settings_observer.h\"\n#include \"chrome\/renderer\/security_filter_peer.h\"\n#include \"content\/public\/common\/resource_dispatcher_delegate.h\"\n#include \"content\/public\/renderer\/render_thread.h\"\n#include \"content\/public\/renderer\/render_view_visitor.h\"\n#include \"content\/public\/renderer\/render_view.h\"\n#include \"crypto\/nss_util.h\"\n#include \"media\/base\/media_switches.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/net_module.h\"\n#include \"third_party\/sqlite\/sqlite3.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebCache.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebCrossOriginPreflightResultCache.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebDocument.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFontCache.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebRuntimeFeatures.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebView.h\"\n#include \"v8\/include\/v8.h\"\n\n#if defined(OS_WIN)\n#include \"base\/win\/iat_patch_function.h\"\n#endif\n\n#if defined(USE_TCMALLOC)\n#include \"third_party\/tcmalloc\/chromium\/src\/gperftools\/heap-profiler.h\"\n#endif\n\nusing WebKit::WebCache;\nusing WebKit::WebCrossOriginPreflightResultCache;\nusing WebKit::WebFontCache;\nusing WebKit::WebRuntimeFeatures;\nusing content::RenderThread;\n\nnamespace {\n\nstatic const int kCacheStatsDelayMS = 2000;\n\nclass RendererResourceDelegate : public content::ResourceDispatcherDelegate {\n public:\n  RendererResourceDelegate()\n      : ALLOW_THIS_IN_INITIALIZER_LIST(weak_factory_(this)) {\n  }\n\n  virtual webkit_glue::ResourceLoaderBridge::Peer* OnRequestComplete(\n      webkit_glue::ResourceLoaderBridge::Peer* current_peer,\n      ResourceType::Type resource_type,\n      int error_code) {\n    \/\/ Update the browser about our cache.\n    \/\/ Rate limit informing the host of our cache stats.\n    if (!weak_factory_.HasWeakPtrs()) {\n      MessageLoop::current()->PostDelayedTask(\n         FROM_HERE,\n         base::Bind(&RendererResourceDelegate::InformHostOfCacheStats,\n                    weak_factory_.GetWeakPtr()),\n         base::TimeDelta::FromMilliseconds(kCacheStatsDelayMS));\n    }\n\n    if (error_code == net::ERR_ABORTED) {\n      return NULL;\n    }\n\n    \/\/ Resource canceled with a specific error are filtered.\n    return SecurityFilterPeer::CreateSecurityFilterPeerForDeniedRequest(\n        resource_type, current_peer, error_code);\n  }\n\n  virtual webkit_glue::ResourceLoaderBridge::Peer* OnReceivedResponse(\n      webkit_glue::ResourceLoaderBridge::Peer* current_peer,\n      const std::string& mime_type,\n      const GURL& url) {\n    return ExtensionLocalizationPeer::CreateExtensionLocalizationPeer(\n        current_peer, RenderThread::Get(), mime_type, url);\n  }\n\n private:\n  void InformHostOfCacheStats() {\n    WebCache::UsageStats stats;\n    WebCache::getUsageStats(&stats);\n    RenderThread::Get()->Send(new ChromeViewHostMsg_UpdatedCacheStats(stats));\n  }\n\n  base::WeakPtrFactory<RendererResourceDelegate> weak_factory_;\n\n  DISALLOW_COPY_AND_ASSIGN(RendererResourceDelegate);\n};\n\n#if defined(OS_WIN)\nstatic base::win::IATPatchFunction g_iat_patch_createdca;\nHDC WINAPI CreateDCAPatch(LPCSTR driver_name,\n                          LPCSTR device_name,\n                          LPCSTR output,\n                          const void* init_data) {\n  DCHECK(std::string(\"DISPLAY\") == std::string(driver_name));\n  DCHECK(!device_name);\n  DCHECK(!output);\n  DCHECK(!init_data);\n\n  \/\/ CreateDC fails behind the sandbox, but not CreateCompatibleDC.\n  return CreateCompatibleDC(NULL);\n}\n\nstatic base::win::IATPatchFunction g_iat_patch_get_font_data;\nDWORD WINAPI GetFontDataPatch(HDC hdc,\n                              DWORD table,\n                              DWORD offset,\n                              LPVOID buffer,\n                              DWORD length) {\n  int rv = GetFontData(hdc, table, offset, buffer, length);\n  if (rv == GDI_ERROR && hdc) {\n    HFONT font = static_cast<HFONT>(GetCurrentObject(hdc, OBJ_FONT));\n\n    LOGFONT logfont;\n    if (GetObject(font, sizeof(LOGFONT), &logfont)) {\n      std::vector<char> font_data;\n      RenderThread::Get()->PreCacheFont(logfont);\n      rv = GetFontData(hdc, table, offset, buffer, length);\n      RenderThread::Get()->ReleaseCachedFonts();\n    }\n  }\n  return rv;\n}\n#endif  \/\/ OS_WIN\n\n}  \/\/ namespace\n\nbool ChromeRenderProcessObserver::is_incognito_process_ = false;\n\nChromeRenderProcessObserver::ChromeRenderProcessObserver(\n    chrome::ChromeContentRendererClient* client)\n    : client_(client),\n      clear_cache_pending_(false) {\n  const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n  if (command_line.HasSwitch(switches::kEnableWatchdog)) {\n    \/\/ TODO(JAR): Need to implement renderer IO msgloop watchdog.\n  }\n\n  if (command_line.HasSwitch(switches::kDumpHistogramsOnExit)) {\n    base::StatisticsRecorder::set_dump_on_exit(true);\n  }\n\n#if defined(TOOLKIT_VIEWS)\n  WebRuntimeFeatures::enableRequestAutocomplete(\n      command_line.HasSwitch(switches::kEnableInteractiveAutocomplete) ||\n      command_line.HasSwitch(switches::kEnableExperimentalWebKitFeatures));\n#endif\n\n  RenderThread* thread = RenderThread::Get();\n  resource_delegate_.reset(new RendererResourceDelegate());\n  thread->SetResourceDispatcherDelegate(resource_delegate_.get());\n\n  \/\/ Configure modules that need access to resources.\n  net::NetModule::SetResourceProvider(chrome_common_net::NetResourceProvider);\n\n#if defined(OS_WIN)\n  \/\/ Need to patch a few functions for font loading to work correctly.\n  FilePath pdf;\n  if (PathService::Get(chrome::FILE_PDF_PLUGIN, &pdf) &&\n      file_util::PathExists(pdf)) {\n    g_iat_patch_createdca.Patch(\n        pdf.value().c_str(), \"gdi32.dll\", \"CreateDCA\", CreateDCAPatch);\n    g_iat_patch_get_font_data.Patch(\n        pdf.value().c_str(), \"gdi32.dll\", \"GetFontData\", GetFontDataPatch);\n  }\n#endif\n\n#if defined(OS_POSIX) && !defined(OS_MACOSX) && defined(USE_NSS)\n  \/\/ On platforms where we use system NSS shared libraries,\n  \/\/ initialize NSS now because it won't be able to load the .so's\n  \/\/ after we engage the sandbox.\n  if (!command_line.HasSwitch(switches::kSingleProcess))\n    crypto::InitNSSSafely();\n#elif defined(OS_WIN)\n  \/\/ crypt32.dll is used to decode X509 certificates for Chromoting.\n  \/\/ Only load this library when the feature is enabled.\n  std::string error;\n  base::LoadNativeLibrary(FilePath(L\"crypt32.dll\"), &error);\n#endif\n  \/\/ Setup initial set of crash dump data for Field Trials in this renderer.\n  chrome_variations::SetChildProcessLoggingVariationList();\n}\n\nChromeRenderProcessObserver::~ChromeRenderProcessObserver() {\n}\n\nbool ChromeRenderProcessObserver::OnControlMessageReceived(\n    const IPC::Message& message) {\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(ChromeRenderProcessObserver, message)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_SetIsIncognitoProcess,\n                        OnSetIsIncognitoProcess)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_SetCacheCapacities, OnSetCacheCapacities)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_ClearCache, OnClearCache)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_SetFieldTrialGroup, OnSetFieldTrialGroup)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_GetV8HeapStats, OnGetV8HeapStats)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_GetCacheResourceStats,\n                        OnGetCacheResourceStats)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_PurgeMemory, OnPurgeMemory)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_SetContentSettingRules,\n                        OnSetContentSettingRules)\n    IPC_MESSAGE_HANDLER(ChromeViewMsg_ToggleWebKitSharedTimer,\n                        OnToggleWebKitSharedTimer)\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nvoid ChromeRenderProcessObserver::OnSetIsIncognitoProcess(\n    bool is_incognito_process) {\n  is_incognito_process_ = is_incognito_process;\n}\n\nvoid ChromeRenderProcessObserver::OnSetContentSettingRules(\n    const RendererContentSettingRules& rules) {\n  content_setting_rules_ = rules;\n}\n\nvoid ChromeRenderProcessObserver::OnSetCacheCapacities(size_t min_dead_capacity,\n                                                       size_t max_dead_capacity,\n                                                       size_t capacity) {\n  WebCache::setCapacities(\n      min_dead_capacity, max_dead_capacity, capacity);\n}\n\nvoid ChromeRenderProcessObserver::OnClearCache(bool on_navigation) {\n  if (on_navigation) {\n    clear_cache_pending_ = true;\n  } else {\n    WebCache::clear();\n  }\n}\n\nvoid ChromeRenderProcessObserver::OnGetCacheResourceStats() {\n  WebCache::ResourceTypeStats stats;\n  WebCache::getResourceTypeStats(&stats);\n  RenderThread::Get()->Send(new ChromeViewHostMsg_ResourceTypeStats(stats));\n}\n\nvoid ChromeRenderProcessObserver::OnSetFieldTrialGroup(\n    const std::string& field_trial_name,\n    const std::string& group_name) {\n  base::FieldTrial* trial =\n      base::FieldTrialList::CreateFieldTrial(field_trial_name, group_name);\n  \/\/ Ensure the trial is marked as \"used\" by calling group() on it. This is\n  \/\/ needed to ensure the trial is properly reported in renderer crash reports.\n  trial->group();\n  chrome_variations::SetChildProcessLoggingVariationList();\n}\n\nvoid ChromeRenderProcessObserver::OnGetV8HeapStats() {\n  v8::HeapStatistics heap_stats;\n  v8::V8::GetHeapStatistics(&heap_stats);\n  RenderThread::Get()->Send(new ChromeViewHostMsg_V8HeapStats(\n      heap_stats.total_heap_size(), heap_stats.used_heap_size()));\n}\n\nvoid ChromeRenderProcessObserver::OnToggleWebKitSharedTimer(bool suspend) {\n  RenderThread::Get()->ToggleWebKitSharedTimer(suspend);\n}\n\nvoid ChromeRenderProcessObserver::OnPurgeMemory() {\n  RenderThread::Get()->EnsureWebKitInitialized();\n\n  \/\/ Clear the object cache (as much as possible; some live objects cannot be\n  \/\/ freed).\n  WebCache::clear();\n\n  \/\/ Clear the font\/glyph cache.\n  WebFontCache::clear();\n\n  \/\/ Clear the Cross-Origin Preflight cache.\n  WebCrossOriginPreflightResultCache::clear();\n\n  \/\/ Release all freeable memory from the SQLite process-global page cache (a\n  \/\/ low-level object which backs the Connection-specific page caches).\n  while (sqlite3_release_memory(std::numeric_limits<int>::max()) > 0) {\n  }\n\n  v8::V8::LowMemoryNotification();\n\n  \/\/ Tell our allocator to release any free pages it's still holding.\n  base::allocator::ReleaseFreeMemory();\n\n  if (client_)\n    client_->OnPurgeMemory();\n}\n\nvoid ChromeRenderProcessObserver::ExecutePendingClearCache() {\n  if (clear_cache_pending_) {\n    clear_cache_pending_ = false;\n    WebCache::clear();\n  }\n}\n\nconst RendererContentSettingRules*\nChromeRenderProcessObserver::content_setting_rules() const {\n  return &content_setting_rules_;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\nModule:    $RCSfile: SampleAppMain.cpp,v $\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\/ 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 \"SampleApp.h\"\n#include <qapplication.h>\n#include \"itkTextOutput.h\"\n#include <itksys\/SystemTools.hxx>\n#include <stdexcept>\n\n#include <mitkStandardFileLocations.h>\n#include <mitkProperties.h>\n#include <mitkVector.h>\n\n#include <QmitkFunctionalityTesting.h>\n#include <sstream>\n\n\/*\n* BUG: ATI-grafics-cards are slow in building up display lists in case of displaying transparent surfaces.\n* Activating GlobalImmediateModeRendering in vtk solves this problem.\n*\/\n\/\/#include <vtkMapper.h>\n\n#include <QmitkControlsRightFctLayoutTemplate.h>\n#include <qsplitter.h>\n\n\nint main(int argc, char* argv[])\n{\n  try\n  {\n    \/\/ Add directory in which the application executable resides as search directory\n    mitk::StandardFileLocations::GetInstance()->AddDirectoryForSearch(itksys::SystemTools::GetFilenamePath(argv[0]).c_str()); \n    \/\/\n    \/\/ determine application name without path and extension\n    \/\/\n    std::string executableName = itksys::SystemTools::GetFilenameWithoutExtension( itksys::SystemTools::GetFilenameName(argv[0] ) );\n    std::stringstream caption;\n    caption << executableName << \", Builddate \" << __DATE__ << \", \" << __TIME__ << \".\";\n    itk::OutputWindow::SetInstance(itk::TextOutput::New().GetPointer());\n    \/\/ parse testing parameters\n    bool enableFunctionalityTesting = false;\n    const char * testingParameter = NULL;\n    if (strcmp(argv[argc-1], \"-testing\")==0) {\n      enableFunctionalityTesting = true;\n    } else if (argc >= 2 && strcmp(argv[argc-2], \"-testing\")==0) {\n      testingParameter = argv[argc-1];\n      enableFunctionalityTesting = true;\n    }\n\n    QApplication a( argc, argv );\n    SampleApp mainWindow(NULL, \"mainwindow\",Qt::WType_TopLevel,testingParameter);\n    mainWindow.setCaption( caption.str().c_str() );\n    a.setMainWidget(&mainWindow);\n#ifdef USEDARKPALETTE\n    std::cout << \"changing palette ...\" << std::endl;\n    QPalette p( QColor( 64,64,64), QColor(64,64,64));\n    a.setPalette(p,TRUE);\n#endif\n    \/*\n    * BUG: ATI-grafics-cards are slow in building up display lists in case of displaying transparent surfaces.\n    * Activating GlobalImmediateModeRendering in vtk solves this problem. Also add #include vtkMapper above\n    *\/\n    \/\/vtkMapper::GlobalImmediateModeRenderingOn();\n    \n     \n    \/\/B\/     Setup MainApp Widget size (default: maximized) \/\/\/\/\n    mitk::Point3dProperty* sizeProp = dynamic_cast<mitk::Point3dProperty*>\n                                      (mainWindow.m_Options->GetProperty(\"Startup window size\"));\n    if(sizeProp)\n    {\n      mitk::Point3D p = sizeProp->GetValue();\n      if(p[0] == 0.0 && p[1] == 0.0)\n        mainWindow.showMaximized();\n      else\n      {\n        mainWindow.resize(sizeProp->GetValue()[0], sizeProp->GetValue()[1]);      \n        mainWindow.show();\n      }\n    }\n    else\n      mainWindow.showMaximized();\n\n    mainWindow.RaiseDialogBars();\n\n    \/\/B\/ Setup  MultiWidget size (default: 2\/3 of total MainApp width) \/\/\/\/\n    mitk::Point3dProperty* splitterSizeProp = dynamic_cast<mitk::Point3dProperty*>\n                                      (mainWindow.m_Options->GetProperty(\"Main Splitter ratio\"));\n\n    QmitkControlsRightFctLayoutTemplate* fctwidget = (QmitkControlsRightFctLayoutTemplate*) mainWindow.centralWidget();\n    if(fctwidget)\n    {\n      QValueList<int> i;\n\n      if(splitterSizeProp)\n      {\n        mitk::Point3D p = splitterSizeProp->GetValue();\n        if(p[0] == 0.0 && p[1] == 0.0)\n        {\n          i.push_back(mainWindow.width()\/3*2);\n          i.push_back(mainWindow.width()\/3*1);\n        }\n        else\n        {\n          i.push_back(p[0]);\n          i.push_back(p[1]);\n        }\n      }\n      else\n      {\n        i.push_back(mainWindow.width()\/3*2);\n        i.push_back(mainWindow.width()\/3*1);\n      }\n      fctwidget->MainSplitter->setSizes(i);\n      mainWindow.repaint();\n    }    \n    \n    \n    if(enableFunctionalityTesting) \n    {\n      std::cout.setf(std::ios_base::unitbuf);\n      return StartQmitkFunctionalityTesting(mainWindow.GetFctMediator());\n    }\n    else\n    {\n      return a.exec();\n    }\n  }\n  catch (const std::bad_alloc& e)\n  {\n    std::cout << \"MITK MainApp caught bad_alloc: Could not acquire enough memory: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (const std::exception& e)\n  {\n    std::cout << \"MITK MainApp caught an exception: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (...)\n  {\n    std::cout << \"MITK MainApp caught something like an exception...\" << std::endl;\n    return EXIT_FAILURE;\n  }  \n} \n<commit_msg>FIX (#1125): MainApp windows black after startup (even with data loaded)<commit_after>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\nModule:    $RCSfile: SampleAppMain.cpp,v $\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\/ 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 \"SampleApp.h\"\n#include <qapplication.h>\n#include \"itkTextOutput.h\"\n#include <itksys\/SystemTools.hxx>\n#include <stdexcept>\n\n#include <mitkStandardFileLocations.h>\n#include <mitkProperties.h>\n#include <mitkVector.h>\n\n#include <QmitkFunctionalityTesting.h>\n#include <sstream>\n\n\/*\n* BUG: ATI-grafics-cards are slow in building up display lists in case of displaying transparent surfaces.\n* Activating GlobalImmediateModeRendering in vtk solves this problem.\n*\/\n\/\/#include <vtkMapper.h>\n\n#include <QmitkControlsRightFctLayoutTemplate.h>\n#include <qsplitter.h>\n\n\nint main(int argc, char* argv[])\n{\n  try\n  {\n    \/\/ Add directory in which the application executable resides as search directory\n    mitk::StandardFileLocations::GetInstance()->AddDirectoryForSearch(itksys::SystemTools::GetFilenamePath(argv[0]).c_str()); \n    \/\/\n    \/\/ determine application name without path and extension\n    \/\/\n    std::string executableName = itksys::SystemTools::GetFilenameWithoutExtension( itksys::SystemTools::GetFilenameName(argv[0] ) );\n    std::stringstream caption;\n    caption << executableName << \", Builddate \" << __DATE__ << \", \" << __TIME__ << \".\";\n    itk::OutputWindow::SetInstance(itk::TextOutput::New().GetPointer());\n    \/\/ parse testing parameters\n    bool enableFunctionalityTesting = false;\n    const char * testingParameter = NULL;\n    if (strcmp(argv[argc-1], \"-testing\")==0) {\n      enableFunctionalityTesting = true;\n    } else if (argc >= 2 && strcmp(argv[argc-2], \"-testing\")==0) {\n      testingParameter = argv[argc-1];\n      enableFunctionalityTesting = true;\n    }\n\n    QApplication a( argc, argv );\n    SampleApp mainWindow(NULL, \"mainwindow\",Qt::WType_TopLevel,testingParameter);\n    mainWindow.setCaption( caption.str().c_str() );\n    a.setMainWidget(&mainWindow);\n#ifdef USEDARKPALETTE\n    std::cout << \"changing palette ...\" << std::endl;\n    QPalette p( QColor( 64,64,64), QColor(64,64,64));\n    a.setPalette(p,TRUE);\n#endif\n    \/*\n    * BUG: ATI-grafics-cards are slow in building up display lists in case of displaying transparent surfaces.\n    * Activating GlobalImmediateModeRendering in vtk solves this problem. Also add #include vtkMapper above\n    *\/\n    \/\/vtkMapper::GlobalImmediateModeRenderingOn();\n         \n    \/\/B\/     Setup MainApp Widget size (default: maximized) \/\/\/\/\n    mitk::Point3dProperty* sizeProp = dynamic_cast<mitk::Point3dProperty*>\n                                      (mainWindow.m_Options->GetProperty(\"Startup window size\"));\n    if(sizeProp)\n    {\n      mitk::Point3D p = sizeProp->GetValue();\n      if(p[0] == 0.0 && p[1] == 0.0)\n        mainWindow.showMaximized();\n      else\n      {\n        mainWindow.resize(sizeProp->GetValue()[0], sizeProp->GetValue()[1]);      \n        mainWindow.show();\n      }\n    }\n    else\n      mainWindow.showMaximized();\n\n    mainWindow.RaiseDialogBars();\n\n    \/\/B\/ Setup  MultiWidget size (default: 2\/3 of total MainApp width) \/\/\/\/\n    mitk::Point3dProperty* splitterSizeProp = dynamic_cast<mitk::Point3dProperty*>\n                                      (mainWindow.m_Options->GetProperty(\"Main Splitter ratio\"));\n\n    QmitkControlsRightFctLayoutTemplate* fctwidget = (QmitkControlsRightFctLayoutTemplate*) mainWindow.centralWidget();\n    if(fctwidget)\n    {\n      QValueList<int> i;\n\n      if(splitterSizeProp)\n      {\n        mitk::Point3D p = splitterSizeProp->GetValue();\n        if(p[0] == 0.0 && p[1] == 0.0)\n        {\n          i.push_back(mainWindow.width()\/3*2);\n          i.push_back(mainWindow.width()\/3*1);\n        }\n        else\n        {\n          i.push_back(p[0]);\n          i.push_back(p[1]);\n        }\n      }\n      else\n      {\n        i.push_back(mainWindow.width()\/3*2);\n        i.push_back(mainWindow.width()\/3*1);\n      }\n      fctwidget->MainSplitter->setSizes(i);\n      mainWindow.repaint();\n    }\n    \/\/ reinit views after mainwindow and fctwidget initialization\n    mainWindow.viewReinitMultiWidget();\n    \n    \n    if(enableFunctionalityTesting) \n    {\n      std::cout.setf(std::ios_base::unitbuf);\n      return StartQmitkFunctionalityTesting(mainWindow.GetFctMediator());\n    }\n    else\n    {\n      return a.exec();\n    }\n  }\n  catch (const std::bad_alloc& e)\n  {\n    std::cout << \"MITK MainApp caught bad_alloc: Could not acquire enough memory: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (const std::exception& e)\n  {\n    std::cout << \"MITK MainApp caught an exception: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (...)\n  {\n    std::cout << \"MITK MainApp caught something like an exception...\" << std::endl;\n    return EXIT_FAILURE;\n  }  \n} \n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2012, 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\/policy.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/broadcast_socket.hpp\" \/\/ for supports_ipv6()\n#include <boost\/crc.hpp>\n\n#include \"test.hpp\"\n\nusing namespace libtorrent;\n\nboost::uint32_t hash_buffer(char const* buf, int len)\n{\n\tboost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc;\n\tcrc.process_block(buf, buf + len);\n\treturn crc.checksum();\n}\n\nint test_main()\n{\n\n\t\/\/ when the IP is the same, we hash the ports, sorted\n\tboost::uint32_t p = peer_priority(\n\t\ttcp::endpoint(address::from_string(\"230.12.123.3\"), 0x4d2)\n\t\t, tcp::endpoint(address::from_string(\"230.12.123.3\"), 0x12c));\n\tTEST_EQUAL(p, hash_buffer(\"\\x01\\x2c\\x04\\xd2\", 4));\n\n\t\/\/ when we're in the same \/24, we just hash the IPs\n\tp = peer_priority(\n\t\ttcp::endpoint(address::from_string(\"230.12.123.1\"), 0x4d2)\n\t\t, tcp::endpoint(address::from_string(\"230.12.123.3\"), 0x12c));\n\tTEST_EQUAL(p, hash_buffer(\"\\xe6\\x0c\\x7b\\x01\\xe6\\x0c\\x7b\\x03\", 8));\n\n\t\/\/ when we're in the same \/16, we just hash the IPs masked by\n\t\/\/ 0xffffff55\n\tp = peer_priority(\n\t\ttcp::endpoint(address::from_string(\"230.12.23.1\"), 0x4d2)\n\t\t, tcp::endpoint(address::from_string(\"230.12.123.3\"), 0x12c));\n\tTEST_EQUAL(p, hash_buffer(\"\\xe6\\x0c\\x17\\x01\\xe6\\x0c\\x7b\\x01\", 8));\n\n\t\/\/ when we're in different \/16, we just hash the IPs masked by\n\t\/\/ 0xffff5555\n\tp = peer_priority(\n\t\ttcp::endpoint(address::from_string(\"230.120.23.1\"), 0x4d2)\n\t\t, tcp::endpoint(address::from_string(\"230.12.123.3\"), 0x12c));\n\tTEST_EQUAL(p, hash_buffer(\"\\xe6\\x0c\\x51\\x01\\xe6\\x78\\x15\\x01\", 8));\n\n\tif (supports_ipv6())\n\t{\n\t\t\/\/ IPv6 has a twice as wide mask, and we only care about the top 64 bits\n\t\t\/\/ when the IPs are the same, just hash the ports\n\t\tp = peer_priority(\n\t\t\ttcp::endpoint(address::from_string(\"ffff:ffff:ffff:ffff::1\"), 0x4d2)\n\t\t\t, tcp::endpoint(address::from_string(\"ffff:ffff:ffff:ffff::1\"), 0x12c));\n\t\tTEST_EQUAL(p, hash_buffer(\"\\x01\\x2c\\x04\\xd2\", 4));\n        \n\t\t\/\/ these IPs don't belong to the same \/32, so apply the full mask\n\t\t\/\/ 0xffffffff55555555\n\t\tp = peer_priority(\n\t\t\ttcp::endpoint(address::from_string(\"ffff:ffff:ffff:ffff::1\"), 0x4d2)\n\t\t\t, tcp::endpoint(address::from_string(\"ffff:0fff:ffff:ffff::1\"), 0x12c));\n\t\tTEST_EQUAL(p, hash_buffer(\n\t\t\t\"\\xff\\xff\\x0f\\xff\\x55\\x55\\x55\\x55\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x01\"\n\t\t\t\"\\xff\\xff\\xff\\xff\\x55\\x55\\x55\\x55\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x01\", 32));\n\t}\n\t\n\treturn 0;\n}\n\n<commit_msg>add test vector from bep40 to test_peer_priority<commit_after>\/*\n\nCopyright (c) 2012, 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\/policy.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/broadcast_socket.hpp\" \/\/ for supports_ipv6()\n#include <boost\/crc.hpp>\n\n#include \"test.hpp\"\n\nusing namespace libtorrent;\n\nboost::uint32_t hash_buffer(char const* buf, int len)\n{\n\tboost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc;\n\tcrc.process_block(buf, buf + len);\n\treturn crc.checksum();\n}\n\nint test_main()\n{\n\n\t\/\/ when the IP is the same, we hash the ports, sorted\n\tboost::uint32_t p = peer_priority(\n\t\ttcp::endpoint(address::from_string(\"230.12.123.3\"), 0x4d2)\n\t\t, tcp::endpoint(address::from_string(\"230.12.123.3\"), 0x12c));\n\tTEST_EQUAL(p, hash_buffer(\"\\x01\\x2c\\x04\\xd2\", 4));\n\n\t\/\/ when we're in the same \/24, we just hash the IPs\n\tp = peer_priority(\n\t\ttcp::endpoint(address::from_string(\"230.12.123.1\"), 0x4d2)\n\t\t, tcp::endpoint(address::from_string(\"230.12.123.3\"), 0x12c));\n\tTEST_EQUAL(p, hash_buffer(\"\\xe6\\x0c\\x7b\\x01\\xe6\\x0c\\x7b\\x03\", 8));\n\n\t\/\/ when we're in the same \/16, we just hash the IPs masked by\n\t\/\/ 0xffffff55\n\tp = peer_priority(\n\t\ttcp::endpoint(address::from_string(\"230.12.23.1\"), 0x4d2)\n\t\t, tcp::endpoint(address::from_string(\"230.12.123.3\"), 0x12c));\n\tTEST_EQUAL(p, hash_buffer(\"\\xe6\\x0c\\x17\\x01\\xe6\\x0c\\x7b\\x01\", 8));\n\n\t\/\/ when we're in different \/16, we just hash the IPs masked by\n\t\/\/ 0xffff5555\n\tp = peer_priority(\n\t\ttcp::endpoint(address::from_string(\"230.120.23.1\"), 0x4d2)\n\t\t, tcp::endpoint(address::from_string(\"230.12.123.3\"), 0x12c));\n\tTEST_EQUAL(p, hash_buffer(\"\\xe6\\x0c\\x51\\x01\\xe6\\x78\\x15\\x01\", 8));\n\n\t\/\/ test vectors from BEP 40\n\tTEST_EQUAL(peer_priority(\n\t\ttcp::endpoint(address::from_string(\"123.213.32.10\"), 0)\n\t\t, tcp::endpoint(address::from_string(\"98.76.54.32\"), 0))\n\t\t, 0xec2d7224);\n\n\tTEST_EQUAL(peer_priority(\n\t\ttcp::endpoint(address::from_string(\"123.213.32.10\"), 0)\n\t\t, tcp::endpoint(address::from_string(\"123.213.32.234\"), 0))\n\t\t, 0x99568189);\n\n\tif (supports_ipv6())\n\t{\n\t\t\/\/ IPv6 has a twice as wide mask, and we only care about the top 64 bits\n\t\t\/\/ when the IPs are the same, just hash the ports\n\t\tp = peer_priority(\n\t\t\ttcp::endpoint(address::from_string(\"ffff:ffff:ffff:ffff::1\"), 0x4d2)\n\t\t\t, tcp::endpoint(address::from_string(\"ffff:ffff:ffff:ffff::1\"), 0x12c));\n\t\tTEST_EQUAL(p, hash_buffer(\"\\x01\\x2c\\x04\\xd2\", 4));\n        \n\t\t\/\/ these IPs don't belong to the same \/32, so apply the full mask\n\t\t\/\/ 0xffffffff55555555\n\t\tp = peer_priority(\n\t\t\ttcp::endpoint(address::from_string(\"ffff:ffff:ffff:ffff::1\"), 0x4d2)\n\t\t\t, tcp::endpoint(address::from_string(\"ffff:0fff:ffff:ffff::1\"), 0x12c));\n\t\tTEST_EQUAL(p, hash_buffer(\n\t\t\t\"\\xff\\xff\\x0f\\xff\\x55\\x55\\x55\\x55\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x01\"\n\t\t\t\"\\xff\\xff\\xff\\xff\\x55\\x55\\x55\\x55\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x01\", 32));\n\t}\n\t\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#include \"..\/std\/functional.hpp\"\n#include \"..\/std\/iterator.hpp\"\n#include \"..\/std\/map.hpp\"\n\ntemplate <class ContainerT> class BackInsertFunctor\n{\n  ContainerT & m_Container;\npublic:\n  explicit BackInsertFunctor(ContainerT & container) : m_Container(container)\n  {\n  }\n  void operator() (typename ContainerT::value_type const & t) const\n  {\n    m_Container.push_back(t);\n  }\n};\n\ntemplate <class ContainerT>\nBackInsertFunctor<ContainerT> MakeBackInsertFunctor(ContainerT & container)\n{\n  return BackInsertFunctor<ContainerT>(container);\n}\n\ntemplate <class ContainerT> class InsertFunctor\n{\n  ContainerT & m_Container;\npublic:\n  explicit InsertFunctor(ContainerT & container) : m_Container(container)\n  {\n  }\n  void operator() (typename ContainerT::value_type const & t) const\n  {\n    m_Container.insert(t);\n  }\n};\n\ntemplate <class ContainerT>\nInsertFunctor<ContainerT> MakeInsertFunctor(ContainerT & container)\n{\n  return InsertFunctor<ContainerT>(container);\n}\n\ntemplate <class IterT, class CompareT> inline bool IsSorted(IterT beg, IterT end, CompareT comp)\n{\n  if (beg == end)\n    return true;\n  IterT prev = beg;\n  for (++beg; beg != end; ++beg, ++prev)\n  {\n    if (comp(*beg, *prev))\n      return false;\n  }\n  return true;\n}\n\ntemplate <class IterT, class CompareT>\ninline bool IsSortedAndUnique(IterT beg, IterT end, CompareT comp)\n{\n  if (beg == end)\n    return true;\n  IterT prev = beg;\n  for (++beg; beg != end; ++beg, ++prev)\n  {\n    if (!comp(*prev, *beg))\n      return false;\n  }\n  return true;\n}\n\ntemplate <class IterT, class CompareT>\nIterT RemoveIfKeepValid(IterT beg, IterT end, CompareT comp)\n{\n  while (beg != end)\n  {\n    if (comp(*beg))\n    {\n      while (beg != --end)\n      {\n        if (!comp(*end))\n        {\n          swap(*beg, *end);\n          ++beg;\n          break;\n        }\n      }\n    }\n    else\n      ++beg;\n  }\n\n  return end;\n}\n\n\ntemplate <class IterT> inline bool IsSorted(IterT beg, IterT end)\n{\n  return IsSorted(beg, end, less<typename iterator_traits<IterT>::value_type>());\n}\n\ntemplate <class IterT> inline bool IsSortedAndUnique(IterT beg, IterT end)\n{\n  return IsSortedAndUnique(beg, end, less<typename iterator_traits<IterT>::value_type>());\n}\n\nstruct DeleteFunctor\n{\n  template <typename T> void operator() (T const * p) const\n  {\n    delete p;\n  }\n};\n\nstruct NoopFunctor\n{\n  template <typename T> inline void operator () (T const &) const\n  {\n  }\n};\n\nstruct IdFunctor\n{\n  template <typename T> inline T operator () (T const & x) const\n  {\n    return x;\n  }\n};\n\ntemplate <typename IterT> IterT NextIterInCycle(IterT it, IterT beg, IterT end)\n{\n  if (++it == end)\n    return beg;\n  return it;\n}\n\ntemplate <typename IterT> IterT PrevIterInCycle(IterT it, IterT beg, IterT end)\n{\n  if (it == beg)\n    it = end;\n  return --it;\n}\n\ntemplate <typename KeyT, typename ValueT, typename CompareT, typename AllocatorT>\nValueT ValueForKey(map<KeyT, ValueT, CompareT, AllocatorT> const & m, KeyT key, ValueT defaultV)\n{\n  typename map<KeyT, ValueT, CompareT, AllocatorT>::const_iterator const it = m.find(key);\n  return (it == m.end() ? defaultV : it->second);\n}\n<commit_msg>Add guard for deleting objects in container.<commit_after>#pragma once\n#include \"..\/std\/functional.hpp\"\n#include \"..\/std\/iterator.hpp\"\n#include \"..\/std\/map.hpp\"\n\ntemplate <class ContainerT> class BackInsertFunctor\n{\n  ContainerT & m_Container;\npublic:\n  explicit BackInsertFunctor(ContainerT & container) : m_Container(container)\n  {\n  }\n  void operator() (typename ContainerT::value_type const & t) const\n  {\n    m_Container.push_back(t);\n  }\n};\n\ntemplate <class ContainerT>\nBackInsertFunctor<ContainerT> MakeBackInsertFunctor(ContainerT & container)\n{\n  return BackInsertFunctor<ContainerT>(container);\n}\n\ntemplate <class ContainerT> class InsertFunctor\n{\n  ContainerT & m_Container;\npublic:\n  explicit InsertFunctor(ContainerT & container) : m_Container(container)\n  {\n  }\n  void operator() (typename ContainerT::value_type const & t) const\n  {\n    m_Container.insert(t);\n  }\n};\n\ntemplate <class ContainerT>\nInsertFunctor<ContainerT> MakeInsertFunctor(ContainerT & container)\n{\n  return InsertFunctor<ContainerT>(container);\n}\n\ntemplate <class IterT, class CompareT> inline bool IsSorted(IterT beg, IterT end, CompareT comp)\n{\n  if (beg == end)\n    return true;\n  IterT prev = beg;\n  for (++beg; beg != end; ++beg, ++prev)\n  {\n    if (comp(*beg, *prev))\n      return false;\n  }\n  return true;\n}\n\ntemplate <class IterT, class CompareT>\ninline bool IsSortedAndUnique(IterT beg, IterT end, CompareT comp)\n{\n  if (beg == end)\n    return true;\n  IterT prev = beg;\n  for (++beg; beg != end; ++beg, ++prev)\n  {\n    if (!comp(*prev, *beg))\n      return false;\n  }\n  return true;\n}\n\ntemplate <class IterT, class CompareT>\nIterT RemoveIfKeepValid(IterT beg, IterT end, CompareT comp)\n{\n  while (beg != end)\n  {\n    if (comp(*beg))\n    {\n      while (beg != --end)\n      {\n        if (!comp(*end))\n        {\n          swap(*beg, *end);\n          ++beg;\n          break;\n        }\n      }\n    }\n    else\n      ++beg;\n  }\n\n  return end;\n}\n\n\ntemplate <class IterT> inline bool IsSorted(IterT beg, IterT end)\n{\n  return IsSorted(beg, end, less<typename iterator_traits<IterT>::value_type>());\n}\n\ntemplate <class IterT> inline bool IsSortedAndUnique(IterT beg, IterT end)\n{\n  return IsSortedAndUnique(beg, end, less<typename iterator_traits<IterT>::value_type>());\n}\n\nstruct DeleteFunctor\n{\n  template <typename T> void operator() (T const * p) const\n  {\n    delete p;\n  }\n};\n\ntemplate <class TContainer> class DeleteRangeGuard\n{\n  TContainer & m_cont;\npublic:\n  DeleteRangeGuard(TContainer & cont) : m_cont(cont) {}\n  ~DeleteRangeGuard()\n  {\n    for_each(m_cont.begin(), m_cont.end(), DeleteFunctor());\n    m_cont.clear();\n  }\n};\n\nstruct NoopFunctor\n{\n  template <typename T> void operator () (T const &) const\n  {\n  }\n};\n\nstruct IdFunctor\n{\n  template <typename T> inline T operator () (T const & x) const\n  {\n    return x;\n  }\n};\n\ntemplate <typename IterT> IterT NextIterInCycle(IterT it, IterT beg, IterT end)\n{\n  if (++it == end)\n    return beg;\n  return it;\n}\n\ntemplate <typename IterT> IterT PrevIterInCycle(IterT it, IterT beg, IterT end)\n{\n  if (it == beg)\n    it = end;\n  return --it;\n}\n\ntemplate <typename KeyT, typename ValueT, typename CompareT, typename AllocatorT>\nValueT ValueForKey(map<KeyT, ValueT, CompareT, AllocatorT> const & m, KeyT key, ValueT defaultV)\n{\n  typename map<KeyT, ValueT, CompareT, AllocatorT>::const_iterator const it = m.find(key);\n  return (it == m.end() ? defaultV : it->second);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2013, 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 \"test.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n\n#if TORRENT_USE_IOSTREAM\n#include <sstream>\n#endif\n\nstruct test_torrent_t\n{\n\tchar const* file;\n};\n\nusing namespace libtorrent;\n\ntest_torrent_t test_torrents[] =\n{\n\t{ \"base.torrent\" },\n\t{ \"empty_path.torrent\" },\n\t{ \"parent_path.torrent\" },\n\t{ \"hidden_parent_path.torrent\" },\n\t{ \"single_multi_file.torrent\" },\n\t{ \"slash_path.torrent\" },\n\t{ \"backslash_path.torrent\" },\n\t{ \"url_list.torrent\" },\n\t{ \"url_list2.torrent\" },\n\t{ \"url_list3.torrent\" },\n\t{ \"httpseed.torrent\" },\n\t{ \"empty_httpseed.torrent\" },\n\t{ \"long_name.torrent\" },\n\t{ \"whitespace_url.torrent\" },\n\t{ \"duplicate_files.torrent\" },\n\t{ \"pad_file.torrent\" },\n\t{ \"creation_date.torrent\" },\n\t{ \"no_creation_date.torrent\" },\n\t{ \"url_seed.torrent\" },\n\t{ \"url_seed_multi.torrent\" },\n\t{ \"url_seed_multi_space.torrent\" },\n\t{ \"url_seed_multi_space_nolist.torrent\" },\n\t{ \"root_hash.torrent\" },\n};\n\nstruct test_failing_torrent_t\n{\n\tchar const* file;\n\terror_code error; \/\/ the expected error\n};\n\ntest_failing_torrent_t test_error_torrents[] =\n{\n\t{ \"missing_piece_len.torrent\", errors::torrent_missing_piece_length },\n\t{ \"invalid_piece_len.torrent\", errors::torrent_missing_piece_length },\n\t{ \"negative_piece_len.torrent\", errors::torrent_missing_piece_length },\n\t{ \"no_name.torrent\", errors::torrent_missing_name },\n\t{ \"invalid_name.torrent\", errors::torrent_missing_name },\n\t{ \"invalid_name2.torrent\", errors::torrent_invalid_name },\n\t{ \"invalid_info.torrent\", errors::torrent_missing_info },\n\t{ \"string.torrent\", errors::torrent_is_no_dict },\n\t{ \"negative_size.torrent\", errors::torrent_invalid_length },\n\t{ \"negative_file_size.torrent\", errors::torrent_file_parse_failed },\n\t{ \"invalid_path_list.torrent\", errors::torrent_file_parse_failed },\n\t{ \"missing_path_list.torrent\", errors::torrent_file_parse_failed },\n\t{ \"invalid_pieces.torrent\", errors::torrent_missing_pieces },\n\t{ \"unaligned_pieces.torrent\", errors::torrent_invalid_hashes },\n\t{ \"invalid_root_hash.torrent\", errors::torrent_invalid_hashes },\n\t{ \"invalid_root_hash2.torrent\", errors::torrent_missing_pieces},\n\t{ \"invalid_file_size.torrent\", errors::torrent_file_parse_failed },\n};\n\n\/\/ TODO: test remap_files\n\/\/ TODO: merkle torrents. specifically torrent_info::add_merkle_nodes and torrent with \"root hash\"\n\/\/ TODO: torrent with 'p' (padfile) attribute\n\/\/ TODO: torrent with 'h' (hidden) attribute\n\/\/ TODO: torrent with 'x' (executable) attribute\n\/\/ TODO: torrent with 'l' (symlink) attribute\n\/\/ TODO: creating a merkle torrent (torrent_info::build_merkle_list)\n\/\/ TODO: torrent with multiple trackers in multiple tiers, making sure we shuffle them (how do you test shuffling?, load it multiple times and make sure it's in different order at least once)\n\nint test_main()\n{\n\tfor (int i = 0; i < sizeof(test_torrents)\/sizeof(test_torrents[0]); ++i)\n\t{\n\t\terror_code ec;\n\t\tfprintf(stderr, \"loading %s\\n\", test_torrents[i].file);\n\t\tboost::intrusive_ptr<torrent_info> ti(new torrent_info(combine_path(combine_path(\"..\", \"test_torrents\"), test_torrents[i].file), ec));\n\t\tTEST_CHECK(!ec);\n\t\tif (ec) fprintf(stderr, \"  -> failed %s\\n\", ec.message().c_str());\n\n\t\tif (std::string(test_torrents[i].file) == \"whitespace_url.torrent\")\n\t\t{\n\t\t\t\/\/ make sure we trimmed the url\n\t\t\tTEST_CHECK(ti->trackers().size() > 0);\n\t\t\tif (ti->trackers().size() > 0)\n\t\t\t\tTEST_CHECK(ti->trackers()[0].url == \"udp:\/\/test.com\/announce\");\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"duplicate_files.torrent\")\n\t\t{\n\t\t\t\/\/ make sure we disambiguated the files\n\t\t\tTEST_EQUAL(ti->num_files(), 2);\n\t\t\tTEST_CHECK(ti->file_at(0).path == combine_path(combine_path(\"temp\", \"foo\"), \"bar.txt\"));\n\t\t\tTEST_CHECK(ti->file_at(1).path == combine_path(combine_path(\"temp\", \"foo\"), \"bar.1.txt\"));\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"pad_file.torrent\")\n\t\t{\n\t\t\tTEST_EQUAL(ti->num_files(), 2);\n\t\t\tTEST_CHECK(ti->file_at(0).pad_file == false);\n\t\t\tTEST_CHECK(ti->file_at(1).pad_file == true);\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"creation_date.torrent\")\n\t\t{\n\t\t\tTEST_CHECK(*ti->creation_date() == 1234567);\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"no_creation_date.torrent\")\n\t\t{\n\t\t\tTEST_CHECK(!ti->creation_date());\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"url_seed.torrent\")\n\t\t{\n\t\t\tTEST_EQUAL(ti->web_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->web_seeds()[0].url, \"http:\/\/test.com\/file\");\n#ifndef TORRENT_NO_DEPRECATE\n\t\t\tTEST_EQUAL(ti->http_seeds().size(), 0);\n\t\t\tTEST_EQUAL(ti->url_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->url_seeds()[0], \"http:\/\/test.com\/file\");\n#endif\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"url_seed_multi.torrent\")\n\t\t{\n\t\t\tTEST_EQUAL(ti->web_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->web_seeds()[0].url, \"http:\/\/test.com\/file\/\");\n#ifndef TORRENT_NO_DEPRECATE\n\t\t\tTEST_EQUAL(ti->http_seeds().size(), 0);\n\t\t\tTEST_EQUAL(ti->url_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->url_seeds()[0], \"http:\/\/test.com\/file\/\");\n#endif\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"url_seed_multi_space.torrent\"\n\t\t\t|| std::string(test_torrents[i].file) == \"url_seed_multi_space_nolist.torrent\")\n\t\t{\n\t\t\tTEST_EQUAL(ti->web_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->web_seeds()[0].url, \"http:\/\/test.com\/test%20file\/foo%20bar\/\");\n#ifndef TORRENT_NO_DEPRECATE\n\t\t\tTEST_EQUAL(ti->http_seeds().size(), 0);\n\t\t\tTEST_EQUAL(ti->url_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->url_seeds()[0], \"http:\/\/test.com\/test%20file\/foo%20bar\/\");\n#endif\n\t\t}\n\n\t\tint index = 0;\n\t\tfor (torrent_info::file_iterator i = ti->begin_files();\n\t\t\ti != ti->end_files(); ++i, ++index)\n\t\t{\n\t\t\tint first = ti->map_file(index, 0, 0).piece;\n\t\t\tint last = ti->map_file(index, (std::max)(size_type(i->size)-1, size_type(0)), 0).piece;\n\t\t\tfprintf(stderr, \"  %11\"PRId64\" %c%c%c%c [ %4d, %4d ] %7u %s %s %s%s\\n\"\n\t\t\t\t, i->size\n\t\t\t\t, (i->pad_file?'p':'-')\n\t\t\t\t, (i->executable_attribute?'x':'-')\n\t\t\t\t, (i->hidden_attribute?'h':'-')\n\t\t\t\t, (i->symlink_attribute?'l':'-')\n\t\t\t\t, first, last\n\t\t\t\t, boost::uint32_t(ti->files().mtime(*i))\n\t\t\t\t, ti->files().hash(*i) != sha1_hash(0) ? to_hex(ti->files().hash(*i).to_string()).c_str() : \"\"\n\t\t\t\t, ti->files().file_path(*i).c_str()\n\t\t\t\t, i->symlink_attribute ? \"-> \": \"\"\n\t\t\t\t, i->symlink_attribute && i->symlink_index != -1 ? ti->files().symlink(*i).c_str() : \"\");\n\t\t}\n\n\t\t\/\/ test swap\n#if !defined TORRENT_NO_DEPRECATE && TORRENT_USE_IOSTREAM\n\t\tstd::stringstream str1;\n\t\tti->print(str1);\n\n\t\ttorrent_info temp(\"temp\", ec);\n\t\ttemp.swap(*ti);\n\n\t\tstd::stringstream str2;\n\t\ttemp.print(str2);\n\t\tTEST_EQUAL(str1.str(), str2.str());\n#endif\n\n\t}\n\n\tfor (int i = 0; i < sizeof(test_error_torrents)\/sizeof(test_error_torrents[0]); ++i)\n\t{\n\t\terror_code ec;\n\t\tfprintf(stderr, \"loading %s\\n\", test_error_torrents[i].file);\n\t\tboost::intrusive_ptr<torrent_info> ti(new torrent_info(combine_path(combine_path(\"..\", \"test_torrents\"), test_error_torrents[i].file), ec));\n\t\tfprintf(stderr, \"E: %s\\nexpected: %s\\n\", ec.message().c_str(), test_error_torrents[i].error.message().c_str());\n\t\tTEST_EQUAL(ec, test_error_torrents[i].error);\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>fix test_torrent_parse for windows<commit_after>\/*\n\nCopyright (c) 2013, 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 \"test.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n\n#if TORRENT_USE_IOSTREAM\n#include <sstream>\n#endif\n\nstruct test_torrent_t\n{\n\tchar const* file;\n};\n\nusing namespace libtorrent;\n\ntest_torrent_t test_torrents[] =\n{\n\t{ \"base.torrent\" },\n\t{ \"empty_path.torrent\" },\n\t{ \"parent_path.torrent\" },\n\t{ \"hidden_parent_path.torrent\" },\n\t{ \"single_multi_file.torrent\" },\n\t{ \"slash_path.torrent\" },\n\t{ \"backslash_path.torrent\" },\n\t{ \"url_list.torrent\" },\n\t{ \"url_list2.torrent\" },\n\t{ \"url_list3.torrent\" },\n\t{ \"httpseed.torrent\" },\n\t{ \"empty_httpseed.torrent\" },\n\t{ \"long_name.torrent\" },\n\t{ \"whitespace_url.torrent\" },\n\t{ \"duplicate_files.torrent\" },\n\t{ \"pad_file.torrent\" },\n\t{ \"creation_date.torrent\" },\n\t{ \"no_creation_date.torrent\" },\n\t{ \"url_seed.torrent\" },\n\t{ \"url_seed_multi.torrent\" },\n\t{ \"url_seed_multi_space.torrent\" },\n\t{ \"url_seed_multi_space_nolist.torrent\" },\n\t{ \"root_hash.torrent\" },\n};\n\nstruct test_failing_torrent_t\n{\n\tchar const* file;\n\terror_code error; \/\/ the expected error\n};\n\ntest_failing_torrent_t test_error_torrents[] =\n{\n\t{ \"missing_piece_len.torrent\", errors::torrent_missing_piece_length },\n\t{ \"invalid_piece_len.torrent\", errors::torrent_missing_piece_length },\n\t{ \"negative_piece_len.torrent\", errors::torrent_missing_piece_length },\n\t{ \"no_name.torrent\", errors::torrent_missing_name },\n\t{ \"invalid_name.torrent\", errors::torrent_missing_name },\n\t{ \"invalid_name2.torrent\", errors::torrent_invalid_name },\n\t{ \"invalid_info.torrent\", errors::torrent_missing_info },\n\t{ \"string.torrent\", errors::torrent_is_no_dict },\n\t{ \"negative_size.torrent\", errors::torrent_invalid_length },\n\t{ \"negative_file_size.torrent\", errors::torrent_file_parse_failed },\n\t{ \"invalid_path_list.torrent\", errors::torrent_file_parse_failed },\n\t{ \"missing_path_list.torrent\", errors::torrent_file_parse_failed },\n\t{ \"invalid_pieces.torrent\", errors::torrent_missing_pieces },\n\t{ \"unaligned_pieces.torrent\", errors::torrent_invalid_hashes },\n\t{ \"invalid_root_hash.torrent\", errors::torrent_invalid_hashes },\n\t{ \"invalid_root_hash2.torrent\", errors::torrent_missing_pieces},\n\t{ \"invalid_file_size.torrent\", errors::torrent_file_parse_failed },\n};\n\n\/\/ TODO: test remap_files\n\/\/ TODO: merkle torrents. specifically torrent_info::add_merkle_nodes and torrent with \"root hash\"\n\/\/ TODO: torrent with 'p' (padfile) attribute\n\/\/ TODO: torrent with 'h' (hidden) attribute\n\/\/ TODO: torrent with 'x' (executable) attribute\n\/\/ TODO: torrent with 'l' (symlink) attribute\n\/\/ TODO: creating a merkle torrent (torrent_info::build_merkle_list)\n\/\/ TODO: torrent with multiple trackers in multiple tiers, making sure we shuffle them (how do you test shuffling?, load it multiple times and make sure it's in different order at least once)\n\nint test_main()\n{\n\tstd::string root_dir = parent_path(current_working_directory());\n\tfor (int i = 0; i < sizeof(test_torrents)\/sizeof(test_torrents[0]); ++i)\n\t{\n\t\terror_code ec;\n\t\tfprintf(stderr, \"loading %s\\n\", test_torrents[i].file);\n\t\tboost::intrusive_ptr<torrent_info> ti(new torrent_info(combine_path(combine_path(root_dir, \"test_torrents\"), test_torrents[i].file), ec));\n\t\tTEST_CHECK(!ec);\n\t\tif (ec) fprintf(stderr, \"  -> failed %s\\n\", ec.message().c_str());\n\n\t\tif (std::string(test_torrents[i].file) == \"whitespace_url.torrent\")\n\t\t{\n\t\t\t\/\/ make sure we trimmed the url\n\t\t\tTEST_CHECK(ti->trackers().size() > 0);\n\t\t\tif (ti->trackers().size() > 0)\n\t\t\t\tTEST_CHECK(ti->trackers()[0].url == \"udp:\/\/test.com\/announce\");\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"duplicate_files.torrent\")\n\t\t{\n\t\t\t\/\/ make sure we disambiguated the files\n\t\t\tTEST_EQUAL(ti->num_files(), 2);\n\t\t\tTEST_CHECK(ti->file_at(0).path == combine_path(combine_path(\"temp\", \"foo\"), \"bar.txt\"));\n\t\t\tTEST_CHECK(ti->file_at(1).path == combine_path(combine_path(\"temp\", \"foo\"), \"bar.1.txt\"));\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"pad_file.torrent\")\n\t\t{\n\t\t\tTEST_EQUAL(ti->num_files(), 2);\n\t\t\tTEST_CHECK(ti->file_at(0).pad_file == false);\n\t\t\tTEST_CHECK(ti->file_at(1).pad_file == true);\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"creation_date.torrent\")\n\t\t{\n\t\t\tTEST_CHECK(*ti->creation_date() == 1234567);\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"no_creation_date.torrent\")\n\t\t{\n\t\t\tTEST_CHECK(!ti->creation_date());\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"url_seed.torrent\")\n\t\t{\n\t\t\tTEST_EQUAL(ti->web_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->web_seeds()[0].url, \"http:\/\/test.com\/file\");\n#ifndef TORRENT_NO_DEPRECATE\n\t\t\tTEST_EQUAL(ti->http_seeds().size(), 0);\n\t\t\tTEST_EQUAL(ti->url_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->url_seeds()[0], \"http:\/\/test.com\/file\");\n#endif\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"url_seed_multi.torrent\")\n\t\t{\n\t\t\tTEST_EQUAL(ti->web_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->web_seeds()[0].url, \"http:\/\/test.com\/file\/\");\n#ifndef TORRENT_NO_DEPRECATE\n\t\t\tTEST_EQUAL(ti->http_seeds().size(), 0);\n\t\t\tTEST_EQUAL(ti->url_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->url_seeds()[0], \"http:\/\/test.com\/file\/\");\n#endif\n\t\t}\n\t\telse if (std::string(test_torrents[i].file) == \"url_seed_multi_space.torrent\"\n\t\t\t|| std::string(test_torrents[i].file) == \"url_seed_multi_space_nolist.torrent\")\n\t\t{\n\t\t\tTEST_EQUAL(ti->web_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->web_seeds()[0].url, \"http:\/\/test.com\/test%20file\/foo%20bar\/\");\n#ifndef TORRENT_NO_DEPRECATE\n\t\t\tTEST_EQUAL(ti->http_seeds().size(), 0);\n\t\t\tTEST_EQUAL(ti->url_seeds().size(), 1);\n\t\t\tTEST_EQUAL(ti->url_seeds()[0], \"http:\/\/test.com\/test%20file\/foo%20bar\/\");\n#endif\n\t\t}\n\n\t\tint index = 0;\n\t\tfor (torrent_info::file_iterator i = ti->begin_files();\n\t\t\ti != ti->end_files(); ++i, ++index)\n\t\t{\n\t\t\tint first = ti->map_file(index, 0, 0).piece;\n\t\t\tint last = ti->map_file(index, (std::max)(size_type(i->size)-1, size_type(0)), 0).piece;\n\t\t\tfprintf(stderr, \"  %11\"PRId64\" %c%c%c%c [ %4d, %4d ] %7u %s %s %s%s\\n\"\n\t\t\t\t, i->size\n\t\t\t\t, (i->pad_file?'p':'-')\n\t\t\t\t, (i->executable_attribute?'x':'-')\n\t\t\t\t, (i->hidden_attribute?'h':'-')\n\t\t\t\t, (i->symlink_attribute?'l':'-')\n\t\t\t\t, first, last\n\t\t\t\t, boost::uint32_t(ti->files().mtime(*i))\n\t\t\t\t, ti->files().hash(*i) != sha1_hash(0) ? to_hex(ti->files().hash(*i).to_string()).c_str() : \"\"\n\t\t\t\t, ti->files().file_path(*i).c_str()\n\t\t\t\t, i->symlink_attribute ? \"-> \": \"\"\n\t\t\t\t, i->symlink_attribute && i->symlink_index != -1 ? ti->files().symlink(*i).c_str() : \"\");\n\t\t}\n\n\t\t\/\/ test swap\n#if !defined TORRENT_NO_DEPRECATE && TORRENT_USE_IOSTREAM\n\t\tstd::stringstream str1;\n\t\tti->print(str1);\n\n\t\ttorrent_info temp(\"temp\", ec);\n\t\ttemp.swap(*ti);\n\n\t\tstd::stringstream str2;\n\t\ttemp.print(str2);\n\t\tTEST_EQUAL(str1.str(), str2.str());\n#endif\n\n\t}\n\n\tfor (int i = 0; i < sizeof(test_error_torrents)\/sizeof(test_error_torrents[0]); ++i)\n\t{\n\t\terror_code ec;\n\t\tfprintf(stderr, \"loading %s\\n\", test_error_torrents[i].file);\n\t\tboost::intrusive_ptr<torrent_info> ti(new torrent_info(combine_path(combine_path(root_dir, \"test_torrents\"), test_error_torrents[i].file), ec));\n\t\tfprintf(stderr, \"E: %s\\nexpected: %s\\n\", ec.message().c_str(), test_error_torrents[i].error.message().c_str());\n\t\tTEST_EQUAL(ec, test_error_torrents[i].error);\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n *\n * @brief This file specifies auxiliary functions and data used by a Bison\n *        parser to convert YAML data to a key set.\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\/\n\n\/\/ -- Imports ------------------------------------------------------------------\n\n#include <cerrno>\n#include <fstream>\n\n#include \"driver.hpp\"\n\nusing std::ifstream;\nusing std::string;\nusing std::to_string;\n\nusing kdb::Key;\nusing kdb::KeySet;\n\nusing yy::parser;\n\n\/\/ -- Macros -------------------------------------------------------------------\n\n#define DEBUG_LEVEL 0\n\n\/\/ -- Functions ----------------------------------------------------------------\n\nnamespace\n{\n\n\/**\n * @brief This function converts a given number to an array base name.\n *\n * @param index This number specifies the index of the array entry.\n *\n * @return A string representing the given indices as Elektra array name.\n *\/\nstring indexToArrayBaseName (uintmax_t const index)\n{\n\tsize_t digits = 1;\n\n\tfor (uintmax_t value = index; value > 9; digits++)\n\t{\n\t\tvalue \/= 10;\n\t}\n\n\treturn \"#\" + string (digits - 1, '_') + to_string (index);\n}\n\n\/**\n * @brief This function converts a YAML scalar to a string.\n *\n * @param text This string contains a YAML scalar (including quote\n *             characters).\n *\n * @return A string without leading and trailing quote characters\n *\/\nstring scalarToText (string const & text)\n{\n\tif (text.length () == 0)\n\t{\n\t\treturn text;\n\t}\n\tif (*(text.begin ()) == '\"' || *(text.begin ()) == '\\'')\n\t{\n\t\treturn text.substr (1, text.length () - 2);\n\t}\n\treturn text;\n}\n\n} \/\/ namespace\n\n\/\/ -- Class --------------------------------------------------------------------\n\n\/**\n * This constructor creates a new driver for the given parent key.\n *\n * @param parent This key specifies the parent of the key set the parser\n *               creates.\n *\/\nDriver::Driver (Key const & parent)\n{\n\tparents.push (parent);\n}\n\n\/**\n * @brief This function parses the current YAML file.\n *\n * @param filename This parameter stores the path of the file the driver\n *                 should parse.\n *\n * @retval -3 if the given file could not be opened\n * @retval -2 if parsing was unsuccessful due to memory exhaustion\n * @retval -1 if the given file contains a syntax error\n * @retval  0 if parsing was successful\n *\/\nint Driver::parse (const string & filepath)\n{\n\tfilename = filepath;\n\n\tifstream input{ filename };\n\tif (!input.good ()) return -3;\n\n\tLexer lexer{ input };\n\tparser parser{ lexer, *this };\n\tparser.set_debug_level (DEBUG_LEVEL);\n\n\treturn -parser.parse ();\n}\n\n\/**\n * @brief This method retrieves the current key set produced by the driver.\n *\n * @return A key set representing the YAML data produced by the last call of\n *         the method `parse`\n *\/\nKeySet Driver::getKeySet () const\n{\n\treturn keys;\n}\n\n\/**\n * @brief This function will be called by the Bison parser to indicate an error.\n *\n * @param location This value specifies the location of the erroneous input.\n * @param message This value stores the error message emitted by the Bison\n *                parser.\n *\/\nvoid Driver::error (const location_type & location, const string & message)\n{\n\terrorMessage = filename + \":\" + to_string (location.begin.line) + \":\" + to_string (location.begin.column) + \": \" + message;\n}\n\n\/**\n * @brief This function returns the last error message produced by the parser.\n *\n * @return A string containing an error message describing a syntax error\n *\/\nstring Driver::getErrorMessage ()\n{\n\treturn errorMessage;\n}\n\n\/\/ ===========\n\/\/ = Actions =\n\/\/ ===========\n\n\/**\n * @brief This function will be called after the parser exits a value.\n *\n * @param text This variable contains the text stored in the value.\n *\/\nvoid Driver::exitValue (string const & text)\n{\n\tKey key = parents.top ();\n\tkey.setString (scalarToText (text));\n\tkeys.append (key);\n}\n\n\/**\n * @brief This function will be called after the parser found a key.\n *\n * @param text This variable contains the text of the key.\n *\/\nvoid Driver::exitKey (string const & text)\n{\n\t\/\/ Entering a mapping such as `part: …` means that we need to add `part` to\n\t\/\/ the key name\n\tKey child{ parents.top ().getName (), KEY_END };\n\tchild.addBaseName (scalarToText (text));\n\tparents.push (child);\n}\n\n\/**\n * @brief This function will be called after the parser exits a key-value\n *        pair.\n *\n * @param matchedValue This variable specifies if the pair contains a value\n *                     or not.\n *\/\nvoid Driver::exitPair (bool const matchedValue)\n{\n\tif (!matchedValue)\n\t{\n\t\t\/\/ Add key with empty value\n\t\tkeys.append (parents.top ());\n\t}\n\t\/\/ Returning from a mapping such as `part: …` means that we need need to\n\t\/\/ remove the key for `part` from the stack.\n\tparents.pop ();\n}\n\n\/**\n * @brief This function will be called after the parser enters a sequence.\n *\/\nvoid Driver::enterSequence ()\n{\n\tindices.push (0);\n\tparents.top ().setMeta (\"array\", \"\"); \/\/ We start with an empty array\n}\n\n\/**\n * @brief This function will be called after the parser exits a sequence.\n *\/\nvoid Driver::exitSequence ()\n{\n\t\/\/ We add the parent key of all array elements after we leave the sequence\n\tkeys.append (parents.top ());\n\tindices.pop ();\n}\n\n\/**\n * @brief This function will be called after the parser recognizes an element\n *        of a sequence.\n *\/\nvoid Driver::enterElement ()\n{\n\n\tKey key{ parents.top ().getName (), KEY_END };\n\tkey.addBaseName (indexToArrayBaseName (indices.top ()));\n\n\tuintmax_t index = indices.top ();\n\tindices.pop ();\n\tif (index < UINTMAX_MAX)\n\t{\n\t\tindex++;\n\t}\n\tindices.push (index);\n\n\tparents.top ().setMeta (\"array\", key.getBaseName ());\n\tparents.push (key);\n}\n\n\/**\n * @brief This function will be called after the parser read an element of a\n *        sequence.\n *\/\nvoid Driver::exitElement ()\n{\n\tparents.pop (); \/\/ Remove the key for the current array entry\n}\n<commit_msg>YAMBi: Throw exception in case of array overflow<commit_after>\/**\n * @file\n *\n * @brief This file specifies auxiliary functions and data used by a Bison\n *        parser to convert YAML data to a key set.\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\/\n\n\/\/ -- Imports ------------------------------------------------------------------\n\n#include <cerrno>\n#include <fstream>\n#include <stdexcept>\n\n#include \"driver.hpp\"\n\nusing std::ifstream;\nusing std::overflow_error;\nusing std::string;\nusing std::to_string;\n\nusing kdb::Key;\nusing kdb::KeySet;\n\nusing yy::parser;\n\n\/\/ -- Macros -------------------------------------------------------------------\n\n#define DEBUG_LEVEL 0\n\n\/\/ -- Functions ----------------------------------------------------------------\n\nnamespace\n{\n\n\/**\n * @brief This function converts a given number to an array base name.\n *\n * @param index This number specifies the index of the array entry.\n *\n * @return A string representing the given indices as Elektra array name.\n *\/\nstring indexToArrayBaseName (uintmax_t const index)\n{\n\tsize_t digits = 1;\n\n\tfor (uintmax_t value = index; value > 9; digits++)\n\t{\n\t\tvalue \/= 10;\n\t}\n\n\treturn \"#\" + string (digits - 1, '_') + to_string (index);\n}\n\n\/**\n * @brief This function converts a YAML scalar to a string.\n *\n * @param text This string contains a YAML scalar (including quote\n *             characters).\n *\n * @return A string without leading and trailing quote characters\n *\/\nstring scalarToText (string const & text)\n{\n\tif (text.length () == 0)\n\t{\n\t\treturn text;\n\t}\n\tif (*(text.begin ()) == '\"' || *(text.begin ()) == '\\'')\n\t{\n\t\treturn text.substr (1, text.length () - 2);\n\t}\n\treturn text;\n}\n\n} \/\/ namespace\n\n\/\/ -- Class --------------------------------------------------------------------\n\n\/**\n * This constructor creates a new driver for the given parent key.\n *\n * @param parent This key specifies the parent of the key set the parser\n *               creates.\n *\/\nDriver::Driver (Key const & parent)\n{\n\tparents.push (parent);\n}\n\n\/**\n * @brief This function parses the current YAML file.\n *\n * @param filename This parameter stores the path of the file the driver\n *                 should parse.\n *\n * @retval -3 if the given file could not be opened\n * @retval -2 if parsing was unsuccessful due to memory exhaustion\n * @retval -1 if the given file contains a syntax error\n * @retval  0 if parsing was successful\n *\/\nint Driver::parse (const string & filepath)\n{\n\tfilename = filepath;\n\n\tifstream input{ filename };\n\tif (!input.good ()) return -3;\n\n\tLexer lexer{ input };\n\tparser parser{ lexer, *this };\n\tparser.set_debug_level (DEBUG_LEVEL);\n\n\treturn -parser.parse ();\n}\n\n\/**\n * @brief This method retrieves the current key set produced by the driver.\n *\n * @return A key set representing the YAML data produced by the last call of\n *         the method `parse`\n *\/\nKeySet Driver::getKeySet () const\n{\n\treturn keys;\n}\n\n\/**\n * @brief This function will be called by the Bison parser to indicate an error.\n *\n * @param location This value specifies the location of the erroneous input.\n * @param message This value stores the error message emitted by the Bison\n *                parser.\n *\/\nvoid Driver::error (const location_type & location, const string & message)\n{\n\terrorMessage = filename + \":\" + to_string (location.begin.line) + \":\" + to_string (location.begin.column) + \": \" + message;\n}\n\n\/**\n * @brief This function returns the last error message produced by the parser.\n *\n * @return A string containing an error message describing a syntax error\n *\/\nstring Driver::getErrorMessage ()\n{\n\treturn errorMessage;\n}\n\n\/\/ ===========\n\/\/ = Actions =\n\/\/ ===========\n\n\/**\n * @brief This function will be called after the parser exits a value.\n *\n * @param text This variable contains the text stored in the value.\n *\/\nvoid Driver::exitValue (string const & text)\n{\n\tKey key = parents.top ();\n\tkey.setString (scalarToText (text));\n\tkeys.append (key);\n}\n\n\/**\n * @brief This function will be called after the parser found a key.\n *\n * @param text This variable contains the text of the key.\n *\/\nvoid Driver::exitKey (string const & text)\n{\n\t\/\/ Entering a mapping such as `part: …` means that we need to add `part` to\n\t\/\/ the key name\n\tKey child{ parents.top ().getName (), KEY_END };\n\tchild.addBaseName (scalarToText (text));\n\tparents.push (child);\n}\n\n\/**\n * @brief This function will be called after the parser exits a key-value\n *        pair.\n *\n * @param matchedValue This variable specifies if the pair contains a value\n *                     or not.\n *\/\nvoid Driver::exitPair (bool const matchedValue)\n{\n\tif (!matchedValue)\n\t{\n\t\t\/\/ Add key with empty value\n\t\tkeys.append (parents.top ());\n\t}\n\t\/\/ Returning from a mapping such as `part: …` means that we need need to\n\t\/\/ remove the key for `part` from the stack.\n\tparents.pop ();\n}\n\n\/**\n * @brief This function will be called after the parser enters a sequence.\n *\/\nvoid Driver::enterSequence ()\n{\n\tindices.push (0);\n\tparents.top ().setMeta (\"array\", \"\"); \/\/ We start with an empty array\n}\n\n\/**\n * @brief This function will be called after the parser exits a sequence.\n *\/\nvoid Driver::exitSequence ()\n{\n\t\/\/ We add the parent key of all array elements after we leave the sequence\n\tkeys.append (parents.top ());\n\tindices.pop ();\n}\n\n\/**\n * @brief This function will be called after the parser recognizes an element\n *        of a sequence.\n *\/\nvoid Driver::enterElement ()\n{\n\n\tKey key{ parents.top ().getName (), KEY_END };\n\tif (indices.top () >= UINTMAX_MAX) throw overflow_error (\"Unable to increase array index for array “\" + key.getName () + \"”\");\n\n\tkey.addBaseName (indexToArrayBaseName (indices.top ()));\n\n\tuintmax_t index = indices.top ();\n\tindices.pop ();\n\tindex++;\n\tindices.push (index);\n\n\tparents.top ().setMeta (\"array\", key.getBaseName ());\n\tparents.push (key);\n}\n\n\/**\n * @brief This function will be called after the parser read an element of a\n *        sequence.\n *\/\nvoid Driver::exitElement ()\n{\n\tparents.pop (); \/\/ Remove the key for the current array entry\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"vlc_video_source.h\"\n#include <cstdio>\n#include <cstdlib>\n#include <chrono>\n#include <thread>\n\nnamespace gg\n{\n\n\/\/-----------------------------------------------------------------------------\nVideoSourceVLC::VideoSourceVLC( const std::string path )\n    : _vlc_inst(nullptr)\n    , _vlc_mp(nullptr)\n    , m_size( 0 )\n    , m_pixWidth( 0 )\n    , m_pixHeight( 0 )\n{\n    this->mInitSource( path.c_str() );\n    this->mRunSource();\n    \/\/std::cout<<\"sleeping\"<<std::endl;\n    \/\/std::this_thread::sleep_for(std::chrono::seconds(1));\n    \/\/std::cout<<\"done sleeping\"<<std::endl;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nVideoSourceVLC::~VideoSourceVLC()\n{\n    \/* Stop playing *\/\n    libvlc_media_player_stop( this->_vlc_mp );\n\n    \/* Free the media_player *\/\n    if( _vlc_mp ) {\n        libvlc_media_player_release( this->_vlc_mp );\n    }\n    \/\/ the following lines was not working a few years ago (core dump if several streams are open) - \\todo recheck if we want it back\n    \/\/if ( m_vlcInstance ){\n    \/\/   libvlc_release ( m_vlcInstance );\n    \/\/}\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool VideoSourceVLC::get_frame_dimensions( int & width, int & height )\n{\n    \/\/\/\\todo mutex\n    if( this->m_pixWidth==0 || this->m_pixHeight==0 ) {\n        \/\/std::cerr<<\"Size not set yet\"<<std::endl;\n        return false;\n    }\n    width = this->m_pixWidth;\n    height = this->m_pixHeight;\n    return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool VideoSourceVLC::get_frame( VideoFrame_BGRA & frame )\n{\n    \/\/\/\\todo mutex\n\n    if( this->m_pixWidth==0 || this->m_pixHeight==0 || !this->m_videoBuffer ) {\n        \/\/std::cerr<<\"Size not set yet in VideoSourceVLC::get_next_frame\"<<std::endl;\n        return false;\n    }\n\n    \/\/std::cout<<\"m_pixWidth: \"<<m_pixWidth<<std::endl;\n    \/\/std::cout<<\"m_pixHeight: \"<<m_pixHeight<<std::endl;\n    \/\/std::cout<<\"m_size: \"<<m_size<<std::endl;\n\n    \/\/Allocate and fill the image\n    if( this->m_pixWidth*this->m_pixHeight*4 == this->m_size ) {\n        frame = VideoFrame_BGRA(this->m_videoBuffer, this->m_pixWidth, this->m_pixHeight);\n    }\n    else\n    {\n        throw std::runtime_error(\"get_next_frame not implemented for padded images\");\n    }\n\n    \/\/std::cout<<\"VideoSourceVLC::get_next_frame\"<<std::endl;\n    \/\/throw std::runtime_error(\"get_next_frame to be implemented\");\n    return true;\n}\n\nbool get_frame(VideoFrame_I420 & frame)\n{\n    \/\/ TODO\n    throw gg::VideoSourceError(\"get_frame(VideoFrame_I420 & frame) not implemented for VLC\");\n}\n\n\/\/-----------------------------------------------------------------------------\ndouble VideoSourceVLC::get_frame_rate()\n{\n    \/\/return libvlc_media_player_get_rate( m_mp );\n    return libvlc_media_player_get_fps( this->_vlc_mp );\n    \/\/throw std::runtime_error(\"get_frame_rate to be implemented\");\n    \/\/return 0.0;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::set_sub_frame( int x, int y, int width, int height )\n{\n    throw std::runtime_error(\"set_sub_frame not implemented\");\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::mInitSource( const char * path )\n{\n    try {\n        \/\/ VLC pointers\n        libvlc_media_t    *media;\n\n        \/\/ VLC options\n        char smem_options[512];\n\n        sprintf( smem_options, \"#transcode{vcodec=BGRA}:smem{video-data=%lld,video-prerender-callback=%lld,video-postrender-callback=%lld}\",\n                 \/\/ We are using transcode because smem only support raw audio and video formats\n                 (long long int)(intptr_t)(void*) this,                               \/\/ we pass the pointer of the current object to the static callbacks\n                 (long long int)(intptr_t)(void*) &VideoSourceVLC::prepareRender,  \/\/ pointer to the 1st callback called by VLC (static)\n                 (long long int)(intptr_t)(void*) &VideoSourceVLC::handleStream ); \/\/ pointer to the 2nd callback called by VLC (static)\n\n        const char * const vlc_args[] = {\n            \"-I\", \"dummy\",        \/\/ Don't use any interface\n            \"--ignore-config\",    \/\/ Don't use VLC's config\n            \"--extraintf=logger\", \/\/ Log anything\n            \/\/\"--verbose=2\", \/\/ Be much more verbose then normal for debugging purpose\n            \/\/\"--clock-jitter=0\",\n            \/\/\"--file-caching=150\",\n            \"--no-audio\",\n            \"--sout\", smem_options    \/\/ Stream to memory\n        };\n\n        \/\/ We launch VLC\n        _vlc_inst = libvlc_new( sizeof(vlc_args) \/ sizeof(vlc_args[0]), vlc_args );\n\n        \/\/ If path contains a colon (:), it will be treated as a\n        \/\/ URL. Else, it will be considered as a local path.\n        if( std::string(path).find(\":\") == std::string::npos ) {\n            \/\/std::cout<<\"opening file \"<<path<<std::endl;\n            media = libvlc_media_new_path( _vlc_inst, path );\n        }\n        else {\n            \/\/std::cout<<\"opening url \"<<path<<std::endl;\n            media = libvlc_media_new_location( _vlc_inst, path );\n        }\n\n        libvlc_media_add_option( media, \":noaudio\" );\n        libvlc_media_add_option( media, \":no-video-title-show\" );\n\n        \/\/ Create a media player playing environement\n        _vlc_mp = libvlc_media_player_new_from_media( media );\n        \/\/ No need to keep the media now\n        libvlc_media_release( media );\n\n        \/\/std::cout<<\"Media open: \"<<path<<std::endl;\n    }\n    catch( ... ) {\n        throw std::runtime_error( std::string(\"Init device failed for the path \").append( path ) );\n    }\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::mRunSource()\n{\n    try {\n        \/\/ play the media_player\n        libvlc_media_player_play( _vlc_mp );\n        \/\/std::cout<<\"Media playing\"<<std::endl;\n        return;\n    }\n    catch( ... )\n    {\n        throw std::runtime_error(\"Error while running source\");\n        \/\/std::cerr<<\"Error while running source\"<<std::endl;\n        \/\/return;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::prepareRender( VideoSourceVLC* p_video_data, uint8_t** pp_pixel_buffer, int size )\n{\n    \/\/\/\\todo create mutex guard\n    \/\/std::cout<<\"VideoSourceVLC::prepareRender\"<<std::endl;\n    \/\/ called before video rendered\n    \/\/ p_video_data is the echo of the \"this\" pointer\n    if( size != p_video_data->m_size ) {\n        p_video_data->m_videoBuffer = new uint8_t[size];\n        p_video_data->m_size = size;\n        unsigned int width,height;\n        libvlc_video_get_size( p_video_data->_vlc_mp, 0, &width, &height );\n        p_video_data->m_pixWidth = width;\n        p_video_data->m_pixHeight = height;\n    }\n\n    *pp_pixel_buffer = p_video_data->m_videoBuffer;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::handleStream( VideoSourceVLC* \/*p_video_data*\/, uint8_t* \/*p_pixel_buffer*\/, int \/*width*\/, int \/*height*\/,\n                                   int \/*pixel_pitch*\/, int \/*size*\/, int64_t \/*pts*\/ )\n{\n    \/\/\/\\todo create mutex guard\n    \/\/std::cout<<\"VideoSourceVLC::handleStream\"<<std::endl;\n    \/\/std::cout<<\"pixel_pitch\"<<pixel_pitch<<std::endl;\n    \/\/std::cout<<\"size\"<<size<<std::endl;\n    \/\/std::cout<<\"pts\"<<pts<<std::endl;\n    \/\/ called after video rendered\n    \/\/ p_video_data is the echo of the \"this\" pointer\n    \/\/p_video_data->mReadRGBFrame( p_video_data->m_videoBuffer );\n    \/\/p_video_data->m_pixWidth = width;\n    \/\/p_video_data->m_pixHeight = height;\n}\n\n}\n<commit_msg>Issue #83: activated code for releasing VLC engine<commit_after>#include \"vlc_video_source.h\"\n#include <cstdio>\n#include <cstdlib>\n#include <chrono>\n#include <thread>\n\nnamespace gg\n{\n\n\/\/-----------------------------------------------------------------------------\nVideoSourceVLC::VideoSourceVLC( const std::string path )\n    : _vlc_inst(nullptr)\n    , _vlc_mp(nullptr)\n    , m_size( 0 )\n    , m_pixWidth( 0 )\n    , m_pixHeight( 0 )\n{\n    this->mInitSource( path.c_str() );\n    this->mRunSource();\n    \/\/std::cout<<\"sleeping\"<<std::endl;\n    \/\/std::this_thread::sleep_for(std::chrono::seconds(1));\n    \/\/std::cout<<\"done sleeping\"<<std::endl;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nVideoSourceVLC::~VideoSourceVLC()\n{\n    \/* Stop playing *\/\n    libvlc_media_player_stop( this->_vlc_mp );\n\n    \/* Free the media_player *\/\n    if( _vlc_mp ) {\n        libvlc_media_player_release( this->_vlc_mp );\n    }\n\n    \/\/ free engine\n    if ( _vlc_inst )\n        libvlc_release( this->_vlc_inst );\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool VideoSourceVLC::get_frame_dimensions( int & width, int & height )\n{\n    \/\/\/\\todo mutex\n    if( this->m_pixWidth==0 || this->m_pixHeight==0 ) {\n        \/\/std::cerr<<\"Size not set yet\"<<std::endl;\n        return false;\n    }\n    width = this->m_pixWidth;\n    height = this->m_pixHeight;\n    return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool VideoSourceVLC::get_frame( VideoFrame_BGRA & frame )\n{\n    \/\/\/\\todo mutex\n\n    if( this->m_pixWidth==0 || this->m_pixHeight==0 || !this->m_videoBuffer ) {\n        \/\/std::cerr<<\"Size not set yet in VideoSourceVLC::get_next_frame\"<<std::endl;\n        return false;\n    }\n\n    \/\/std::cout<<\"m_pixWidth: \"<<m_pixWidth<<std::endl;\n    \/\/std::cout<<\"m_pixHeight: \"<<m_pixHeight<<std::endl;\n    \/\/std::cout<<\"m_size: \"<<m_size<<std::endl;\n\n    \/\/Allocate and fill the image\n    if( this->m_pixWidth*this->m_pixHeight*4 == this->m_size ) {\n        frame = VideoFrame_BGRA(this->m_videoBuffer, this->m_pixWidth, this->m_pixHeight);\n    }\n    else\n    {\n        throw std::runtime_error(\"get_next_frame not implemented for padded images\");\n    }\n\n    \/\/std::cout<<\"VideoSourceVLC::get_next_frame\"<<std::endl;\n    \/\/throw std::runtime_error(\"get_next_frame to be implemented\");\n    return true;\n}\n\nbool get_frame(VideoFrame_I420 & frame)\n{\n    \/\/ TODO\n    throw gg::VideoSourceError(\"get_frame(VideoFrame_I420 & frame) not implemented for VLC\");\n}\n\n\/\/-----------------------------------------------------------------------------\ndouble VideoSourceVLC::get_frame_rate()\n{\n    \/\/return libvlc_media_player_get_rate( m_mp );\n    return libvlc_media_player_get_fps( this->_vlc_mp );\n    \/\/throw std::runtime_error(\"get_frame_rate to be implemented\");\n    \/\/return 0.0;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::set_sub_frame( int x, int y, int width, int height )\n{\n    throw std::runtime_error(\"set_sub_frame not implemented\");\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::mInitSource( const char * path )\n{\n    try {\n        \/\/ VLC pointers\n        libvlc_media_t    *media;\n\n        \/\/ VLC options\n        char smem_options[512];\n\n        sprintf( smem_options, \"#transcode{vcodec=BGRA}:smem{video-data=%lld,video-prerender-callback=%lld,video-postrender-callback=%lld}\",\n                 \/\/ We are using transcode because smem only support raw audio and video formats\n                 (long long int)(intptr_t)(void*) this,                               \/\/ we pass the pointer of the current object to the static callbacks\n                 (long long int)(intptr_t)(void*) &VideoSourceVLC::prepareRender,  \/\/ pointer to the 1st callback called by VLC (static)\n                 (long long int)(intptr_t)(void*) &VideoSourceVLC::handleStream ); \/\/ pointer to the 2nd callback called by VLC (static)\n\n        const char * const vlc_args[] = {\n            \"-I\", \"dummy\",        \/\/ Don't use any interface\n            \"--ignore-config\",    \/\/ Don't use VLC's config\n            \"--extraintf=logger\", \/\/ Log anything\n            \/\/\"--verbose=2\", \/\/ Be much more verbose then normal for debugging purpose\n            \/\/\"--clock-jitter=0\",\n            \/\/\"--file-caching=150\",\n            \"--no-audio\",\n            \"--sout\", smem_options    \/\/ Stream to memory\n        };\n\n        \/\/ We launch VLC\n        _vlc_inst = libvlc_new( sizeof(vlc_args) \/ sizeof(vlc_args[0]), vlc_args );\n\n        \/\/ If path contains a colon (:), it will be treated as a\n        \/\/ URL. Else, it will be considered as a local path.\n        if( std::string(path).find(\":\") == std::string::npos ) {\n            \/\/std::cout<<\"opening file \"<<path<<std::endl;\n            media = libvlc_media_new_path( _vlc_inst, path );\n        }\n        else {\n            \/\/std::cout<<\"opening url \"<<path<<std::endl;\n            media = libvlc_media_new_location( _vlc_inst, path );\n        }\n\n        libvlc_media_add_option( media, \":noaudio\" );\n        libvlc_media_add_option( media, \":no-video-title-show\" );\n\n        \/\/ Create a media player playing environement\n        _vlc_mp = libvlc_media_player_new_from_media( media );\n        \/\/ No need to keep the media now\n        libvlc_media_release( media );\n\n        \/\/std::cout<<\"Media open: \"<<path<<std::endl;\n    }\n    catch( ... ) {\n        throw std::runtime_error( std::string(\"Init device failed for the path \").append( path ) );\n    }\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::mRunSource()\n{\n    try {\n        \/\/ play the media_player\n        libvlc_media_player_play( _vlc_mp );\n        \/\/std::cout<<\"Media playing\"<<std::endl;\n        return;\n    }\n    catch( ... )\n    {\n        throw std::runtime_error(\"Error while running source\");\n        \/\/std::cerr<<\"Error while running source\"<<std::endl;\n        \/\/return;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::prepareRender( VideoSourceVLC* p_video_data, uint8_t** pp_pixel_buffer, int size )\n{\n    \/\/\/\\todo create mutex guard\n    \/\/std::cout<<\"VideoSourceVLC::prepareRender\"<<std::endl;\n    \/\/ called before video rendered\n    \/\/ p_video_data is the echo of the \"this\" pointer\n    if( size != p_video_data->m_size ) {\n        p_video_data->m_videoBuffer = new uint8_t[size];\n        p_video_data->m_size = size;\n        unsigned int width,height;\n        libvlc_video_get_size( p_video_data->_vlc_mp, 0, &width, &height );\n        p_video_data->m_pixWidth = width;\n        p_video_data->m_pixHeight = height;\n    }\n\n    *pp_pixel_buffer = p_video_data->m_videoBuffer;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid VideoSourceVLC::handleStream( VideoSourceVLC* \/*p_video_data*\/, uint8_t* \/*p_pixel_buffer*\/, int \/*width*\/, int \/*height*\/,\n                                   int \/*pixel_pitch*\/, int \/*size*\/, int64_t \/*pts*\/ )\n{\n    \/\/\/\\todo create mutex guard\n    \/\/std::cout<<\"VideoSourceVLC::handleStream\"<<std::endl;\n    \/\/std::cout<<\"pixel_pitch\"<<pixel_pitch<<std::endl;\n    \/\/std::cout<<\"size\"<<size<<std::endl;\n    \/\/std::cout<<\"pts\"<<pts<<std::endl;\n    \/\/ called after video rendered\n    \/\/ p_video_data is the echo of the \"this\" pointer\n    \/\/p_video_data->mReadRGBFrame( p_video_data->m_videoBuffer );\n    \/\/p_video_data->m_pixWidth = width;\n    \/\/p_video_data->m_pixHeight = height;\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_frame\/test\/net\/test_automation_provider.h\"\n\n#include \"base\/command_line.h\"\n#include \"chrome\/test\/automation\/automation_messages.h\"\n\n#include \"chrome_frame\/test\/net\/test_automation_resource_message_filter.h\"\n\nnamespace {\n\n\/\/ A special command line switch to just run the unit tests without CF in\n\/\/ the picture.  Can be useful when the harness itself needs to be debugged.\nconst wchar_t kNoCfTestRun[] = L\"no-cf-test-run\";\n\nbool CFTestsDisabled() {\n  static bool switch_present = CommandLine::ForCurrentProcess()->\n      HasSwitch(kNoCfTestRun);\n  return switch_present;\n}\n\n}  \/\/ end namespace\n\nTestAutomationProvider* TestAutomationProvider::g_provider_instance_ = NULL;\n\nTestAutomationProvider::TestAutomationProvider(\n    Profile* profile,\n    TestAutomationProviderDelegate* delegate)\n    : AutomationProvider(profile), tab_handle_(-1), delegate_(delegate) {\n  filter_ = new TestAutomationResourceMessageFilter(this);\n  URLRequest::RegisterProtocolFactory(\"http\",\n                                      TestAutomationProvider::Factory);\n  URLRequest::RegisterProtocolFactory(\"https\",\n                                      TestAutomationProvider::Factory);\n  g_provider_instance_ = this;\n}\n\nTestAutomationProvider::~TestAutomationProvider() {\n  g_provider_instance_ = NULL;\n}\n\nvoid TestAutomationProvider::OnMessageReceived(const IPC::Message& msg) {\n  if (filter_->OnMessageReceived(msg))\n    return;  \/\/ Message handled by the filter.\n\n  __super::OnMessageReceived(msg);\n}\n\n\/\/ IPC override to grab the tab handle.\nbool TestAutomationProvider::Send(IPC::Message* msg) {\n  if (msg->type() == AutomationMsg_TabLoaded::ID) {\n    DCHECK(tab_handle_ == -1) << \"Currently only support one tab\";\n    void* iter = NULL;\n    CHECK(msg->ReadInt(&iter, &tab_handle_));\n    DLOG(INFO) << \"Got tab handle: \" << tab_handle_;\n    DCHECK(tab_handle_ != -1 && tab_handle_ != 0);\n    delegate_->OnInitialTabLoaded();\n  }\n\n  return AutomationProvider::Send(msg);\n}\n\nURLRequestJob* TestAutomationProvider::Factory(URLRequest* request,\n                                               const std::string& scheme) {\n  if (CFTestsDisabled())\n    return NULL;\n\n  if (request->url().SchemeIs(\"http\") || request->url().SchemeIs(\"https\")) {\n    \/\/ Only look at requests that don't have any user data.\n    \/\/ ResourceDispatcherHost uses the user data for requests that it manages.\n    \/\/ We don't want to mess with those.\n\n    \/\/ We could also check if the current thread is our TestUrlRequest thread\n    \/\/ and only intercept requests that belong to that thread.\n    if (g_provider_instance_ && request->GetUserData(NULL) == NULL &&\n        g_provider_instance_->tab_handle_ != -1) {\n      \/\/ We generate our own request id which is also what\n      \/\/ ResourceDispatcherHost does (well, the id is actually generated by\n      \/\/ ResourceDispatcher).  Since these requests are divided into with\n      \/\/ and without userdata, we're OK.  However, just to make debugging\n      \/\/ a little easier, we have a significantly higher start value.\n      static int new_id = 0x00100000;\n      URLRequestAutomationJob* job = new URLRequestAutomationJob(request,\n          g_provider_instance_->tab_handle_, new_id++,\n          g_provider_instance_->filter_, false);\n      return job;\n    }\n  }\n\n  return NULL;\n}\n\n\/\/ static\nTestAutomationProvider* TestAutomationProvider::NewAutomationProvider(\n    Profile* p, const std::string& channel,\n    TestAutomationProviderDelegate* delegate) {\n  TestAutomationProvider* automation = new TestAutomationProvider(p, delegate);\n  automation->ConnectToChannel(channel);\n  automation->SetExpectedTabCount(1);\n  return automation;\n}\n<commit_msg>Attempt 2 at fixing the chrome frame net tests hang on the builders. This hang occurs because of a race condition in registering the http\/https protocol factories. The net tests registers a protocol factory and the Chrome AutomationResourceMessageFilter also registers factories. If the net tests ends up being first in the chain then the requests are incorrectly dropped.<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_frame\/test\/net\/test_automation_provider.h\"\n\n#include \"base\/command_line.h\"\n#include \"chrome\/test\/automation\/automation_messages.h\"\n\n#include \"chrome_frame\/test\/net\/test_automation_resource_message_filter.h\"\n\nnamespace {\n\n\/\/ A special command line switch to just run the unit tests without CF in\n\/\/ the picture.  Can be useful when the harness itself needs to be debugged.\nconst wchar_t kNoCfTestRun[] = L\"no-cf-test-run\";\n\nbool CFTestsDisabled() {\n  static bool switch_present = CommandLine::ForCurrentProcess()->\n      HasSwitch(kNoCfTestRun);\n  return switch_present;\n}\n\n}  \/\/ end namespace\n\nTestAutomationProvider* TestAutomationProvider::g_provider_instance_ = NULL;\n\nTestAutomationProvider::TestAutomationProvider(\n    Profile* profile,\n    TestAutomationProviderDelegate* delegate)\n    : AutomationProvider(profile), tab_handle_(-1), delegate_(delegate) {\n  \/\/ We need to register the protocol factory before the\n  \/\/ AutomationResourceMessageFilter registers the automation job factory to\n  \/\/ ensure that we don't inadvarently end up handling http requests which\n  \/\/ we don't expect. The initial chrome frame page for the network tests\n  \/\/ issues http requests which our test factory should not handle.\n  URLRequest::RegisterProtocolFactory(\"http\",\n                                      TestAutomationProvider::Factory);\n  URLRequest::RegisterProtocolFactory(\"https\",\n                                      TestAutomationProvider::Factory);\n  filter_ = new TestAutomationResourceMessageFilter(this);\n  g_provider_instance_ = this;\n}\n\nTestAutomationProvider::~TestAutomationProvider() {\n  g_provider_instance_ = NULL;\n}\n\nvoid TestAutomationProvider::OnMessageReceived(const IPC::Message& msg) {\n  if (filter_->OnMessageReceived(msg))\n    return;  \/\/ Message handled by the filter.\n\n  __super::OnMessageReceived(msg);\n}\n\n\/\/ IPC override to grab the tab handle.\nbool TestAutomationProvider::Send(IPC::Message* msg) {\n  if (msg->type() == AutomationMsg_TabLoaded::ID) {\n    DCHECK(tab_handle_ == -1) << \"Currently only support one tab\";\n    void* iter = NULL;\n    CHECK(msg->ReadInt(&iter, &tab_handle_));\n    DLOG(INFO) << \"Got tab handle: \" << tab_handle_;\n    DCHECK(tab_handle_ != -1 && tab_handle_ != 0);\n    delegate_->OnInitialTabLoaded();\n  }\n\n  return AutomationProvider::Send(msg);\n}\n\nURLRequestJob* TestAutomationProvider::Factory(URLRequest* request,\n                                               const std::string& scheme) {\n  if (CFTestsDisabled())\n    return NULL;\n\n  if (request->url().SchemeIs(\"http\") || request->url().SchemeIs(\"https\")) {\n    \/\/ Only look at requests that don't have any user data.\n    \/\/ ResourceDispatcherHost uses the user data for requests that it manages.\n    \/\/ We don't want to mess with those.\n\n    \/\/ We could also check if the current thread is our TestUrlRequest thread\n    \/\/ and only intercept requests that belong to that thread.\n    if (g_provider_instance_ && request->GetUserData(NULL) == NULL &&\n        g_provider_instance_->tab_handle_ != -1) {\n      \/\/ We generate our own request id which is also what\n      \/\/ ResourceDispatcherHost does (well, the id is actually generated by\n      \/\/ ResourceDispatcher).  Since these requests are divided into with\n      \/\/ and without userdata, we're OK.  However, just to make debugging\n      \/\/ a little easier, we have a significantly higher start value.\n      static int new_id = 0x00100000;\n      URLRequestAutomationJob* job = new URLRequestAutomationJob(request,\n          g_provider_instance_->tab_handle_, new_id++,\n          g_provider_instance_->filter_, false);\n      return job;\n    }\n  }\n\n  return NULL;\n}\n\n\/\/ static\nTestAutomationProvider* TestAutomationProvider::NewAutomationProvider(\n    Profile* p, const std::string& channel,\n    TestAutomationProviderDelegate* delegate) {\n  TestAutomationProvider* automation = new TestAutomationProvider(p, delegate);\n  automation->ConnectToChannel(channel);\n  automation->SetExpectedTabCount(1);\n  return automation;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n#include \"cinder\/ip\/Fill.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nclass TextureUploadApp : public App {\n  public:\n\tstatic void prepareSettings( Settings *settings ) { settings->setMultiTouchEnabled( false ); }\n\tvoid setup();\n\ttemplate<typename T>\n\tvoid setupTexConstructor();\n\ttemplate<typename T>\n\tvoid setupTexUpdate();\n\n\ttemplate<typename T>\n\tvoid setupVoidStarConstructor( int64_t maxV );\n\n\tvoid mouseDown( MouseEvent event ) override;\n\tvoid draw() override;\n\n\tgl::TextureRef\t\tmCurTex;\n\tImageSourceRef\t\tmImg, mImg2, mImgAlpha, mImg2Alpha;\n\n\ttemplate<typename T>\n\tgl::TextureRef genTexConstructor( bool color, bool alpha );\n\ttemplate<typename T>\n\tgl::TextureRef genTexUpdate( bool color, bool alpha );\n\n\tsize_t\t\t\t\t\t\t\t\t\t\tmCurFnIdx;\n\tvector<function<gl::TextureRef(void)>>\t\tmTexGenFns;\n};\n\ntemplate<typename T>\ngl::TextureRef TextureUploadApp::genTexConstructor( bool color, bool alpha )\n{\n\tif( color && alpha ) {\n\t\tSurfaceT<T> s( mImgAlpha );\n\t\treturn gl::Texture::create( s );\n\t}\n\telse if( color ) {\n\t\tSurfaceT<T> s( mImg );\n\t\treturn gl::Texture::create( s );\n\t}\n\telse { \/\/ grayscale\n\t\tChannelT<T> s( mImg );\n\t\treturn gl::Texture::create( s );\n\t}\n}\n\ntemplate<typename T>\ngl::TextureRef TextureUploadApp::genTexUpdate( bool color, bool alpha )\n{\n\tif( color && alpha ) {\n\t\tSurfaceT<T> s0( mImgAlpha );\n\t\tgl::TextureRef result = gl::Texture::create( s0 );\n\t\tresult->update( SurfaceT<T>( mImg2Alpha ) );\n\t\treturn result;\n\t}\n\telse if( color ) {\n\t\tSurfaceT<T> s0( mImg );\n\t\tgl::TextureRef result = gl::Texture::create( s0 );\n\t\tresult->update( SurfaceT<T>( mImg2 ) );\n\t\treturn result;\n\t}\n\telse { \/\/ grayscale\n\t\tChannelT<T> s0( mImg );\n\t\tgl::TextureRef result = gl::Texture::create( s0 );\n\t\tresult->update( ChannelT<T>( mImg2 ) );\n\t\treturn result;\n\t}\n}\n\ntemplate<typename T>\nvoid TextureUploadApp::setupTexConstructor()\n{\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Constructor Surface RGB \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexConstructor<T>( true, false );\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Constructor Surface RGBA \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexConstructor<T>( true, true );\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Constructor Channel \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexConstructor<T>( false, false );\n\t\t}\n\t);\n}\n\ntemplate<typename T>\nvoid TextureUploadApp::setupTexUpdate()\n{\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Surface RGB \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexUpdate<T>( true, false );\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Surface RGBA \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexUpdate<T>( true, true );\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Channel \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexUpdate<T>( false, false );\n\t\t}\n\t);\n\t\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Subregion RGB \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\tSurfaceT<T> srcImg( mImg );\t\t\t\n\t\t\tSurfaceT<T> square( 100, 100, false );\n\t\t\tgl::TextureRef result = gl::Texture::create( mImg2 );\n\t\t\tsquare.copyFrom( srcImg, Area( 28, 128, 28 + 100, 128 + 100 ), ivec2( -28, -128 ) );\n\t\t\tfor( int y = 0; y < result->getHeight() \/ square.getHeight(); y += 2 ) {\n\t\t\t\tfor( int x = y%2; x < result->getWidth() \/ square.getWidth(); x += 2 ) {\n\t\t\t\t\tresult->update( square, 0, ivec2( x * square.getWidth(), y * square.getHeight() ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Subregion Channel \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\tChannelT<T> srcImg( mImg );\t\t\t\n\t\t\tChannelT<T> square( 100, 100 );\n\t\t\tgl::TextureRef result = gl::Texture::create( ChannelT<T>( mImg2 ) );\n\t\t\tsquare.copyFrom( srcImg, Area( 28, 128, 28 + 100, 128 + 100 ), ivec2( -28, -128 ) );\n\t\t\tfor( int y = 0; y < result->getHeight() \/ square.getHeight(); y += 2 ) {\n\t\t\t\tfor( int x = y%2; x < result->getWidth() \/ square.getWidth(); x += 2 ) {\n\t\t\t\t\tresult->update( square, 0, ivec2( x * square.getWidth(), y * square.getHeight() ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t);\n}\n\n\/\/ This is for the constructor variant that accepts a void* to data, rather than a Surface\/Channel\ntemplate<typename T>\nvoid TextureUploadApp::setupVoidStarConstructor( int64_t maxV )\n{\n\tGLenum dataType;\n\tif( std::is_same<T,uint8_t>::value )\n\t\tdataType = GL_UNSIGNED_BYTE;\t\n\telse if( std::is_same<T,int16_t>::value )\n\t\tdataType = GL_SHORT;\n\telse if( std::is_same<T,int32_t>::value )\n\t\tdataType = GL_INT;\n\telse if( std::is_same<T,uint32_t>::value )\n\t\tdataType = GL_UNSIGNED_INT;\n\telse\n\t\tthrow;\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"void* Constructor: \" << typeid(T).name() << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\tSurface8u temp( mImg );\n\t\t\tstd::unique_ptr<T[]> data( new T[mImg->getWidth() * mImg->getHeight() * 3] );\n\n\t\t\tfor( int y = 0; y < temp.getHeight(); ++y ) {\n\t\t\t\tfor( int x = 0; x < temp.getWidth(); ++x ) {\n\t\t\t\t\tColorA8u color = temp.getPixel( ivec2( x, y ) );\n\t\t\t\t\tdata[(y*temp.getWidth()+x)*3 + 0] = color.r \/ 255.0f * maxV;\n\t\t\t\t\tdata[(y*temp.getWidth()+x)*3 + 1] = color.g \/ 255.0f * maxV;\n\t\t\t\t\tdata[(y*temp.getWidth()+x)*3 + 2] = color.b \/ 255.0f * maxV;\n\t\t\t\t}\n\t\t\t}\n\t\t\tgl::TextureRef result = gl::Texture::create( data.get(), GL_RGB, temp.getWidth(), temp.getHeight(),\n\t\t\t\t\t\t\t\t\t\t\tgl::Texture2d::Format().dataType( dataType ).internalFormat( GL_RGB ) );\n\t\t\tresult->setTopDown( true );\n\n\t\t\treturn result;\n\t\t}\n\t);\t\n\t\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"void* update: \" << typeid(T).name() << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\tSurface8u temp( mImg );\n\t\t\tSurface8u temp2( mImg2 );\n\t\t\tstd::unique_ptr<T[]> data( new T[mImg2->getWidth() * mImg2->getHeight() * 3] );\n\n\t\t\tfor( int y = 0; y < temp2.getHeight(); ++y ) {\n\t\t\t\tfor( int x = 0; x < temp2.getWidth(); ++x ) {\n\t\t\t\t\tColorA8u color = temp2.getPixel( ivec2( x, y ) );\n\t\t\t\t\tdata[(y*temp2.getWidth()+x)*3 + 0] = color.r \/ 255.0f * maxV;\n\t\t\t\t\tdata[(y*temp2.getWidth()+x)*3 + 1] = color.g \/ 255.0f * maxV;\n\t\t\t\t\tdata[(y*temp2.getWidth()+x)*3 + 2] = color.b \/ 255.0f * maxV;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tgl::TextureRef result = gl::Texture::create( temp );\n\t\t\tresult->update( data.get(), GL_RGB, dataType, 0, temp2.getWidth(), temp2.getHeight() );\n\t\t\tresult->setTopDown( true );\n\n\t\t\treturn result;\n\t\t}\n\t);\t\n}\n\nvoid TextureUploadApp::setup()\n{\n\tmImg = loadImage( loadAsset( \"fish.jpg\" ) );\n\tmImgAlpha = loadImage( loadAsset( \"fish_alpha.png\" ) );\n\tmImg2 = loadImage( loadAsset( \"fish2.jpg\" ) );\n\tmImg2Alpha = loadImage( loadAsset( \"fish2_alpha.png\" ) );\n\n\t\/\/ 8bit unsigned void*\n\t{\n\t\tsetupVoidStarConstructor<uint8_t>( 255 );\n\t}\t\n\t\/\/ 16bit signed void*\n\t{\n\t\tsetupVoidStarConstructor<int16_t>( 32767 );\n\t}\n\t\/\/ 32bit signed void*\n\t{\n\t\tsetupVoidStarConstructor<int32_t>( 2147483647 );\n\t}\n\t\/\/ 32bit unsigned void*\n\t{\n\t\tsetupVoidStarConstructor<uint32_t>( 4294967295 );\n\t}\n\t\n\t\/\/ 8 bit\n\t{\n\t\tsetupTexConstructor<uint8_t>();\n\t\tsetupTexUpdate<uint8_t>();\n\t}\n\n\t\/\/ 16 bit\n\t{\n\t\tsetupTexConstructor<uint16_t>();\n\t\tsetupTexUpdate<uint16_t>();\n\t}\n\t\n\t\/\/ 32 bit\n\t{\n\t\tsetupTexConstructor<uint8_t>();\n\t\tsetupTexUpdate<uint8_t>();\n\t}\n\n\tmCurFnIdx = 0;\n\tmCurTex = mTexGenFns[mCurFnIdx]();\n}\n\nvoid TextureUploadApp::mouseDown( MouseEvent event )\n{\n\tmCurFnIdx = ( mCurFnIdx + 1 ) % mTexGenFns.size();\n\tmCurTex = mTexGenFns[mCurFnIdx]();\n\tconsole() << *mCurTex << std::endl;\n}\n\nvoid TextureUploadApp::draw()\n{\n\tgl::clear( Color( 0.5f, 0.5f, 0.5f ) );\n\tgl::enableAlphaBlending();\n\tgl::draw( mCurTex );\n}\n\nCINDER_APP( TextureUploadApp, RendererGl, TextureUploadApp::prepareSettings )\n<commit_msg>Minor updates to test\/TextureUpload<commit_after>#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n#include \"cinder\/ip\/Fill.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nclass TextureUploadApp : public App {\n  public:\n\tstatic void prepareSettings( Settings *settings ) { settings->setMultiTouchEnabled( false ); }\n\tvoid setup();\n\ttemplate<typename T>\n\tvoid setupTexConstructor();\n\ttemplate<typename T>\n\tvoid setupTexUpdate();\n\n\ttemplate<typename T>\n\tvoid setupVoidStar( int64_t maxV );\n\n\tvoid mouseDown( MouseEvent event ) override;\n\tvoid draw() override;\n\n\tgl::TextureRef\t\tmCurTex;\n\tImageSourceRef\t\tmImg, mImg2, mImgAlpha, mImg2Alpha;\n\n\ttemplate<typename T>\n\tgl::TextureRef genTexConstructor( bool color, bool alpha );\n\ttemplate<typename T>\n\tgl::TextureRef genTexUpdate( bool color, bool alpha );\n\n\tsize_t\t\t\t\t\t\t\t\t\t\tmCurFnIdx;\n\tvector<function<gl::TextureRef(void)>>\t\tmTexGenFns;\n};\n\ntemplate<typename T>\ngl::TextureRef TextureUploadApp::genTexConstructor( bool color, bool alpha )\n{\n\tif( color && alpha ) {\n\t\tSurfaceT<T> s( mImgAlpha );\n\t\treturn gl::Texture::create( s );\n\t}\n\telse if( color ) {\n\t\tSurfaceT<T> s( mImg );\n\t\treturn gl::Texture::create( s );\n\t}\n\telse { \/\/ grayscale\n\t\tChannelT<T> s( mImg );\n\t\treturn gl::Texture::create( s );\n\t}\n}\n\ntemplate<typename T>\ngl::TextureRef TextureUploadApp::genTexUpdate( bool color, bool alpha )\n{\n\tif( color && alpha ) {\n\t\tSurfaceT<T> s0( mImgAlpha );\n\t\tgl::TextureRef result = gl::Texture::create( s0 );\n\t\tresult->update( SurfaceT<T>( mImg2Alpha ) );\n\t\treturn result;\n\t}\n\telse if( color ) {\n\t\tSurfaceT<T> s0( mImg );\n\t\tgl::TextureRef result = gl::Texture::create( s0 );\n\t\tresult->update( SurfaceT<T>( mImg2 ) );\n\t\treturn result;\n\t}\n\telse { \/\/ grayscale\n\t\tChannelT<T> s0( mImg );\n\t\tgl::TextureRef result = gl::Texture::create( s0 );\n\t\tresult->update( ChannelT<T>( mImg2 ) );\n\t\treturn result;\n\t}\n}\n\ntemplate<typename T>\nvoid TextureUploadApp::setupTexConstructor()\n{\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Constructor Surface RGB \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexConstructor<T>( true, false );\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Constructor Surface RGBA \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexConstructor<T>( true, true );\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Constructor Channel \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexConstructor<T>( false, false );\n\t\t}\n\t);\n}\n\ntemplate<typename T>\nvoid TextureUploadApp::setupTexUpdate()\n{\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Surface RGB \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexUpdate<T>( true, false );\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Surface RGBA \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexUpdate<T>( true, true );\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Channel \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\treturn genTexUpdate<T>( false, false );\n\t\t}\n\t);\n\t\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Subregion RGB \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\tSurfaceT<T> srcImg( mImg );\t\t\t\n\t\t\tSurfaceT<T> square( 100, 100, false );\n\t\t\tgl::TextureRef result = gl::Texture::create( mImg2 );\n\t\t\tsquare.copyFrom( srcImg, Area( 28, 128, 28 + 100, 128 + 100 ), ivec2( -28, -128 ) );\n\t\t\tfor( int y = 0; y < result->getHeight() \/ square.getHeight(); y += 2 ) {\n\t\t\t\tfor( int x = y%2; x < result->getWidth() \/ square.getWidth(); x += 2 ) {\n\t\t\t\t\tresult->update( square, 0, ivec2( x * square.getWidth(), y * square.getHeight() ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t);\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"Update Subregion Channel \" << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\tChannelT<T> srcImg( mImg );\t\t\t\n\t\t\tChannelT<T> square( 100, 100 );\n\t\t\tgl::TextureRef result = gl::Texture::create( ChannelT<T>( mImg2 ) );\n\t\t\tsquare.copyFrom( srcImg, Area( 28, 128, 28 + 100, 128 + 100 ), ivec2( -28, -128 ) );\n\t\t\tfor( int y = 0; y < result->getHeight() \/ square.getHeight(); y += 2 ) {\n\t\t\t\tfor( int x = y%2; x < result->getWidth() \/ square.getWidth(); x += 2 ) {\n\t\t\t\t\tresult->update( square, 0, ivec2( x * square.getWidth(), y * square.getHeight() ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t);\n}\n\n\/\/ This is for the constructor variant that accepts a void* to data, rather than a Surface\/Channel\ntemplate<typename T>\nvoid TextureUploadApp::setupVoidStar( int64_t maxV )\n{\n\tGLenum dataType;\n\tif( std::is_same<T,uint8_t>::value )\n\t\tdataType = GL_UNSIGNED_BYTE;\t\n\telse if( std::is_same<T,int16_t>::value )\n\t\tdataType = GL_SHORT;\n\telse if( std::is_same<T,int32_t>::value )\n\t\tdataType = GL_INT;\n\telse if( std::is_same<T,uint32_t>::value )\n\t\tdataType = GL_UNSIGNED_INT;\n\telse\n\t\tthrow;\n\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"void* Constructor: \" << typeid(T).name() << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\tSurface8u temp( mImg );\n\t\t\tstd::unique_ptr<T[]> data( new T[mImg->getWidth() * mImg->getHeight() * 3] );\n\n\t\t\tfor( int y = 0; y < temp.getHeight(); ++y ) {\n\t\t\t\tfor( int x = 0; x < temp.getWidth(); ++x ) {\n\t\t\t\t\tColorA8u color = temp.getPixel( ivec2( x, y ) );\n\t\t\t\t\tdata[(y*temp.getWidth()+x)*3 + 0] = color.r \/ 255.0f * maxV;\n\t\t\t\t\tdata[(y*temp.getWidth()+x)*3 + 1] = color.g \/ 255.0f * maxV;\n\t\t\t\t\tdata[(y*temp.getWidth()+x)*3 + 2] = color.b \/ 255.0f * maxV;\n\t\t\t\t}\n\t\t\t}\n\t\t\tgl::TextureRef result = gl::Texture::create( data.get(), GL_RGB, temp.getWidth(), temp.getHeight(),\n\t\t\t\t\t\t\t\t\t\t\tgl::Texture2d::Format().dataType( dataType ).internalFormat( GL_RGB ) );\n\t\t\tresult->setTopDown( true );\n\n\t\t\treturn result;\n\t\t}\n\t);\t\n\t\n\tmTexGenFns.push_back( [=](void)->gl::TextureRef {\n\t\t\tapp::console() << \"void* update: \" << typeid(T).name() << sizeof(T) * 8 << \"-bit\" << std::endl;\n\t\t\tSurface8u temp( mImg );\n\t\t\tSurface8u temp2( mImg2 );\n\t\t\tstd::unique_ptr<T[]> data( new T[mImg2->getWidth() * mImg2->getHeight() * 3] );\n\n\t\t\tfor( int y = 0; y < temp2.getHeight(); ++y ) {\n\t\t\t\tfor( int x = 0; x < temp2.getWidth(); ++x ) {\n\t\t\t\t\tColorA8u color = temp2.getPixel( ivec2( x, y ) );\n\t\t\t\t\tdata[(y*temp2.getWidth()+x)*3 + 0] = color.r \/ 255.0f * maxV;\n\t\t\t\t\tdata[(y*temp2.getWidth()+x)*3 + 1] = color.g \/ 255.0f * maxV;\n\t\t\t\t\tdata[(y*temp2.getWidth()+x)*3 + 2] = color.b \/ 255.0f * maxV;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tgl::TextureRef result = gl::Texture::create( temp );\n\t\t\tresult->update( data.get(), GL_RGB, dataType, 0, temp2.getWidth(), temp2.getHeight() );\n\t\t\tresult->setTopDown( true );\n\n\t\t\treturn result;\n\t\t}\n\t);\t\n}\n\nvoid TextureUploadApp::setup()\n{\n\tmImg = loadImage( loadAsset( \"fish.jpg\" ) );\n\tmImgAlpha = loadImage( loadAsset( \"fish_alpha.png\" ) );\n\tmImg2 = loadImage( loadAsset( \"fish2.jpg\" ) );\n\tmImg2Alpha = loadImage( loadAsset( \"fish2_alpha.png\" ) );\n\n\t\/\/ 8bit unsigned void*\n\t{\n\t\tsetupVoidStar<uint8_t>( 255 );\n\t}\t\n\t\/\/ 16bit signed void*\n\t{\n\t\tsetupVoidStar<int16_t>( 32767 );\n\t}\n\t\/\/ 32bit signed void*\n\t{\n\t\tsetupVoidStar<int32_t>( 2147483647 );\n\t}\n\t\/\/ 32bit unsigned void*\n\t{\n\t\tsetupVoidStar<uint32_t>( 4294967295 );\n\t}\n\t\n\t\/\/ 8 bit\n\t{\n\t\tsetupTexConstructor<uint8_t>();\n\t\tsetupTexUpdate<uint8_t>();\n\t}\n\n\t\/\/ 16 bit\n\t{\n\t\tsetupTexConstructor<uint16_t>();\n\t\tsetupTexUpdate<uint16_t>();\n\t}\n\t\n\t\/\/ 32 bit\n\t{\n\t\tsetupTexConstructor<uint8_t>();\n\t\tsetupTexUpdate<uint8_t>();\n\t}\n\n\tmCurFnIdx = 0;\n\tmCurTex = mTexGenFns[mCurFnIdx]();\n}\n\nvoid TextureUploadApp::mouseDown( MouseEvent event )\n{\n\tmCurFnIdx = ( mCurFnIdx + 1 ) % mTexGenFns.size();\n\tmCurTex = mTexGenFns[mCurFnIdx]();\n\tconsole() << *mCurTex << std::endl;\n}\n\nvoid TextureUploadApp::draw()\n{\n\tgl::clear( Color( 0.5f, 0.5f, 0.5f ) );\n\tgl::enableAlphaBlending();\n\tgl::draw( mCurTex );\n}\n\nCINDER_APP( TextureUploadApp, RendererGl, TextureUploadApp::prepareSettings )\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2021 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\/\/ <h1>FEMSystem Example 2<\/h1>\n\/\/ \\author Robert Weidlich\n\/\/ \\date 2012\n\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/getpot.h\"\n#include \"libmesh\/libmesh.h\"\n#include \"libmesh\/libmesh_logging.h\"\n#include \"libmesh\/mesh.h\"\n#include \"libmesh\/mesh_generation.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/string_to_enum.h\"\n#include \"libmesh\/time_solver.h\"\n#include \"libmesh\/transient_system.h\"\n#include \"libmesh\/vtk_io.h\"\n#include \"libmesh\/auto_ptr.h\" \/\/ libmesh_make_unique\n#include \"libmesh\/enum_solver_package.h\"\n\n#include <cstdio>\n#include <ctime>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <unistd.h>\n\nusing namespace libMesh;\n\n#include \"solid_system.h\"\n\nvoid setup(EquationSystems & systems,\n           Mesh & mesh,\n           GetPot & args)\n{\n  const unsigned int dim = mesh.mesh_dimension();\n  \/\/ We currently invert tensors with the assumption that they're 3x3\n  libmesh_assert (dim == 3);\n\n  \/\/ Generating Mesh\n  ElemType eltype = Utility::string_to_enum<ElemType>(args(\"mesh\/generation\/element_type\", \"hex8\"));\n  int nx = args(\"mesh\/generation\/num_elem\", 4, 0);\n  int ny = args(\"mesh\/generation\/num_elem\", 4, 1);\n  int nz = dim > 2 ? args(\"mesh\/generation\/num_elem\", 4, 2) : 0;\n  double origx = args(\"mesh\/generation\/origin\", -1.0, 0);\n  double origy = args(\"mesh\/generation\/origin\", -1.0, 1);\n  double origz = args(\"mesh\/generation\/origin\", 0.0, 2);\n  double sizex = args(\"mesh\/generation\/size\", 2.0, 0);\n  double sizey = args(\"mesh\/generation\/size\", 2.0, 1);\n  double sizez = args(\"mesh\/generation\/size\", 2.0, 2);\n  MeshTools::Generation::build_cube(mesh, nx, ny, nz,\n                                    origx, origx+sizex, origy, origy+sizey, origz, origz+sizez, eltype);\n\n  \/\/ Creating Systems\n  SolidSystem & imms = systems.add_system<SolidSystem> (\"solid\");\n  imms.args = args;\n\n  \/\/ Build up auxiliary system\n  ExplicitSystem & aux_sys = systems.add_system<TransientExplicitSystem>(\"auxiliary\");\n\n  \/\/ Initialize the system\n  systems.parameters.set<unsigned int>(\"phase\") = 0;\n  systems.init();\n\n  imms.save_initial_mesh();\n\n  \/\/ Fill global solution vector from local ones\n  aux_sys.current_local_solution->close();\n  *aux_sys.solution = *aux_sys.current_local_solution;\n  aux_sys.solution->close();\n}\n\n\n\nvoid run_timestepping(EquationSystems & systems, GetPot & args)\n{\n  TransientExplicitSystem & aux_system = systems.get_system<TransientExplicitSystem>(\"auxiliary\");\n\n  SolidSystem & solid_system = systems.get_system<SolidSystem>(\"solid\");\n\n  std::unique_ptr<VTKIO> io = libmesh_make_unique<VTKIO>(systems.get_mesh());\n\n  Real duration = args(\"duration\", 1.0);\n\n  for (unsigned int t_step = 0; t_step < duration\/solid_system.deltat; t_step++)\n    {\n      \/\/ Progress in current phase [0..1]\n      Real progress = t_step * solid_system.deltat \/ duration;\n      systems.parameters.set<Real>(\"progress\") = progress;\n      systems.parameters.set<unsigned int>(\"step\") = t_step;\n\n      \/\/ Update message\n\n      out << \"===== Time Step \" << std::setw(4) << t_step;\n      out << \" (\" << std::fixed << std::setprecision(2) << std::setw(6) << (progress*100.) << \"%)\";\n      out << \", time = \" << std::setw(7) << solid_system.time;\n      out << \" =====\" << std::endl;\n\n      \/\/ Advance timestep in auxiliary system\n      aux_system.current_local_solution->close();\n      aux_system.old_local_solution->close();\n      *aux_system.older_local_solution = *aux_system.old_local_solution;\n      *aux_system.old_local_solution = *aux_system.current_local_solution;\n\n      out << \"Solving Solid\" << std::endl;\n      solid_system.solve();\n      aux_system.current_local_solution->close();\n      *aux_system.solution = *aux_system.current_local_solution;\n      aux_system.solution->close();\n\n      \/\/ Carry out the adaptive mesh refinement\/coarsening\n      out << \"Doing a reinit of the equation systems\" << std::endl;\n      systems.reinit();\n\n      if (t_step % args(\"output\/frequency\", 1) == 0)\n        {\n          std::stringstream file_name;\n          file_name << args(\"results_directory\", \".\/\")\n                    << \"fem_\"\n                    << std::setw(6)\n                    << std::setfill('0')\n                    << t_step\n                    << \".pvtu\";\n\n          io->write_equation_systems(file_name.str(), systems);\n        }\n      \/\/ Advance to the next timestep in a transient problem\n      out << \"Advancing to next step\" << std::endl;\n      solid_system.time_solver->advance_timestep();\n    }\n}\n\n\n\nint main(int argc, char ** argv)\n{\n  \/\/ Initialize libMesh and any dependent libraries\n  LibMeshInit init(argc, argv);\n\n  \/\/ This example requires a linear solver package.\n  libmesh_example_requires(libMesh::default_solver_package() != INVALID_SOLVER_PACKAGE,\n                           \"--enable-petsc, --enable-trilinos, or --enable-eigen\");\n\n  \/\/ Skip this example if we do not meet certain requirements\n#ifndef LIBMESH_HAVE_VTK\n  libmesh_example_requires(false, \"--enable-vtk\");\n#endif\n\n  \/\/ Trilinos gives us an inverted element on this one...\n  libmesh_example_requires(libMesh::default_solver_package() != TRILINOS_SOLVERS, \"--enable-petsc\");\n\n  \/\/ Threaded assembly doesn't currently work with the moving mesh\n  \/\/ code.\n  \/\/ We'll skip this example for now.\n  if (libMesh::n_threads() > 1)\n    {\n      libMesh::out << \"We skip fem_system_ex2 when using threads.\\n\"\n                   << std::endl;\n      return 0;\n    }\n\n  \/\/ read simulation parameters from file\n  GetPot args = GetPot(\"solid.in\");\n\n  \/\/ Create System and Mesh\n  int dim = args(\"mesh\/generation\/dimension\", 3);\n  libmesh_example_requires(dim <= LIBMESH_DIM, \"3D support\");\n\n  \/\/ Create a mesh distributed across the default MPI communicator.\n  Mesh mesh(init.comm(), cast_int<unsigned char>(dim));\n\n  EquationSystems systems(mesh);\n\n  \/\/ Create and set systems up\n  setup(systems, mesh, args);\n\n  \/\/ run the systems\n  run_timestepping(systems, args);\n\n  out << \"Finished calculations\" << std::endl;\n  return 0;\n}\n<commit_msg>mesh.print_info() in fem_system_ex2<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2021 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\/\/ <h1>FEMSystem Example 2<\/h1>\n\/\/ \\author Robert Weidlich\n\/\/ \\date 2012\n\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/getpot.h\"\n#include \"libmesh\/libmesh.h\"\n#include \"libmesh\/libmesh_logging.h\"\n#include \"libmesh\/mesh.h\"\n#include \"libmesh\/mesh_generation.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/string_to_enum.h\"\n#include \"libmesh\/time_solver.h\"\n#include \"libmesh\/transient_system.h\"\n#include \"libmesh\/vtk_io.h\"\n#include \"libmesh\/auto_ptr.h\" \/\/ libmesh_make_unique\n#include \"libmesh\/enum_solver_package.h\"\n\n#include <cstdio>\n#include <ctime>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <unistd.h>\n\nusing namespace libMesh;\n\n#include \"solid_system.h\"\n\nvoid setup(EquationSystems & systems,\n           Mesh & mesh,\n           GetPot & args)\n{\n  const unsigned int dim = mesh.mesh_dimension();\n  \/\/ We currently invert tensors with the assumption that they're 3x3\n  libmesh_assert (dim == 3);\n\n  \/\/ Generating Mesh\n  ElemType eltype = Utility::string_to_enum<ElemType>(args(\"mesh\/generation\/element_type\", \"hex8\"));\n  int nx = args(\"mesh\/generation\/num_elem\", 4, 0);\n  int ny = args(\"mesh\/generation\/num_elem\", 4, 1);\n  int nz = dim > 2 ? args(\"mesh\/generation\/num_elem\", 4, 2) : 0;\n  double origx = args(\"mesh\/generation\/origin\", -1.0, 0);\n  double origy = args(\"mesh\/generation\/origin\", -1.0, 1);\n  double origz = args(\"mesh\/generation\/origin\", 0.0, 2);\n  double sizex = args(\"mesh\/generation\/size\", 2.0, 0);\n  double sizey = args(\"mesh\/generation\/size\", 2.0, 1);\n  double sizez = args(\"mesh\/generation\/size\", 2.0, 2);\n  MeshTools::Generation::build_cube(mesh, nx, ny, nz,\n                                    origx, origx+sizex, origy, origy+sizey, origz, origz+sizez, eltype);\n  mesh.print_info();\n\n  \/\/ Creating Systems\n  SolidSystem & imms = systems.add_system<SolidSystem> (\"solid\");\n  imms.args = args;\n\n  \/\/ Build up auxiliary system\n  ExplicitSystem & aux_sys = systems.add_system<TransientExplicitSystem>(\"auxiliary\");\n\n  \/\/ Initialize the system\n  systems.parameters.set<unsigned int>(\"phase\") = 0;\n  systems.init();\n\n  imms.save_initial_mesh();\n\n  \/\/ Fill global solution vector from local ones\n  aux_sys.current_local_solution->close();\n  *aux_sys.solution = *aux_sys.current_local_solution;\n  aux_sys.solution->close();\n}\n\n\n\nvoid run_timestepping(EquationSystems & systems, GetPot & args)\n{\n  TransientExplicitSystem & aux_system = systems.get_system<TransientExplicitSystem>(\"auxiliary\");\n\n  SolidSystem & solid_system = systems.get_system<SolidSystem>(\"solid\");\n\n  std::unique_ptr<VTKIO> io = libmesh_make_unique<VTKIO>(systems.get_mesh());\n\n  Real duration = args(\"duration\", 1.0);\n\n  for (unsigned int t_step = 0; t_step < duration\/solid_system.deltat; t_step++)\n    {\n      \/\/ Progress in current phase [0..1]\n      Real progress = t_step * solid_system.deltat \/ duration;\n      systems.parameters.set<Real>(\"progress\") = progress;\n      systems.parameters.set<unsigned int>(\"step\") = t_step;\n\n      \/\/ Update message\n\n      out << \"===== Time Step \" << std::setw(4) << t_step;\n      out << \" (\" << std::fixed << std::setprecision(2) << std::setw(6) << (progress*100.) << \"%)\";\n      out << \", time = \" << std::setw(7) << solid_system.time;\n      out << \" =====\" << std::endl;\n\n      \/\/ Advance timestep in auxiliary system\n      aux_system.current_local_solution->close();\n      aux_system.old_local_solution->close();\n      *aux_system.older_local_solution = *aux_system.old_local_solution;\n      *aux_system.old_local_solution = *aux_system.current_local_solution;\n\n      out << \"Solving Solid\" << std::endl;\n      solid_system.solve();\n      aux_system.current_local_solution->close();\n      *aux_system.solution = *aux_system.current_local_solution;\n      aux_system.solution->close();\n\n      \/\/ Carry out the adaptive mesh refinement\/coarsening\n      out << \"Doing a reinit of the equation systems\" << std::endl;\n      systems.reinit();\n\n      if (t_step % args(\"output\/frequency\", 1) == 0)\n        {\n          std::stringstream file_name;\n          file_name << args(\"results_directory\", \".\/\")\n                    << \"fem_\"\n                    << std::setw(6)\n                    << std::setfill('0')\n                    << t_step\n                    << \".pvtu\";\n\n          io->write_equation_systems(file_name.str(), systems);\n        }\n      \/\/ Advance to the next timestep in a transient problem\n      out << \"Advancing to next step\" << std::endl;\n      solid_system.time_solver->advance_timestep();\n    }\n}\n\n\n\nint main(int argc, char ** argv)\n{\n  \/\/ Initialize libMesh and any dependent libraries\n  LibMeshInit init(argc, argv);\n\n  \/\/ This example requires a linear solver package.\n  libmesh_example_requires(libMesh::default_solver_package() != INVALID_SOLVER_PACKAGE,\n                           \"--enable-petsc, --enable-trilinos, or --enable-eigen\");\n\n  \/\/ Skip this example if we do not meet certain requirements\n#ifndef LIBMESH_HAVE_VTK\n  libmesh_example_requires(false, \"--enable-vtk\");\n#endif\n\n  \/\/ Trilinos gives us an inverted element on this one...\n  libmesh_example_requires(libMesh::default_solver_package() != TRILINOS_SOLVERS, \"--enable-petsc\");\n\n  \/\/ Threaded assembly doesn't currently work with the moving mesh\n  \/\/ code.\n  \/\/ We'll skip this example for now.\n  if (libMesh::n_threads() > 1)\n    {\n      libMesh::out << \"We skip fem_system_ex2 when using threads.\\n\"\n                   << std::endl;\n      return 0;\n    }\n\n  \/\/ read simulation parameters from file\n  GetPot args = GetPot(\"solid.in\");\n\n  \/\/ Create System and Mesh\n  int dim = args(\"mesh\/generation\/dimension\", 3);\n  libmesh_example_requires(dim <= LIBMESH_DIM, \"3D support\");\n\n  \/\/ Create a mesh distributed across the default MPI communicator.\n  Mesh mesh(init.comm(), cast_int<unsigned char>(dim));\n\n  EquationSystems systems(mesh);\n\n  \/\/ Create and set systems up\n  setup(systems, mesh, args);\n\n  \/\/ run the systems\n  run_timestepping(systems, args);\n\n  out << \"Finished calculations\" << std::endl;\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n#include \"ctc_beam_entry.h\"\n#include \"ctc_beam_scorer.h\"\n#include \"ctc_beam_search.h\"\n#include \"ctc_decoder.h\"\n#include \"util\/status.h\"\n#include \"TH.h\"\n\nnamespace pytorch {\n  extern \"C\"\n  {\n      int ctc_beam_decode(THFloatTensor *th_probs, THIntTensor *th_seq_len, THIntTensor *th_output,\n                          THFloatTensor *th_scores, int top_paths, int beam_width, int merge_repeated)\n      {\n        const int64_t max_time = THFloatTensor_size(th_probs, 0);\n        const int64_t batch_size = THFloatTensor_size(th_probs, 1);\n        const int64_t num_classes = THFloatTensor_size(th_probs, 2);\n\n        \/\/ TODO: DEBUG, Remove\n        std::cout << \"Max Timesteps: \" << max_time << \"\\nBatch Size: \" << batch_size << \"\\nNumber of Classes: \" << num_classes << std::endl;\n        \/\/ convert tensors to something the beam scorer can use\n        \/\/ sequence length\n        int* seq_len_ptr = THIntTensor_data(th_seq_len);\n        ptrdiff_t seq_len_offset = THIntTensor_storageOffset(th_seq_len);\n        Eigen::Map<const Eigen::ArrayXi> seq_len(seq_len_ptr + seq_len_offset, batch_size);\n        std::cout << \"STATUS: Converted sequence_length tensor\" << std::endl;\n        \/\/std::cout << \"DEBUG: seq_len=\" << seq_len << std::endl;\n\n        \/\/ input logits\n        float* probs_ptr = THFloatTensor_data(th_probs);\n        ptrdiff_t probs_offset = THFloatTensor_storageOffset(th_probs);\n        const int64_t probs_stride_0 = THFloatTensor_stride(th_probs, 0);\n        std::vector<Eigen::Map<const Eigen::MatrixXf>> inputs;\n        for (int t=0; t < max_time; ++t) {\n          inputs.emplace_back(probs_ptr + probs_offset + (t*probs_stride_0), batch_size, num_classes);\n          \/\/std::cout << inputs[t] << std::endl;\n        }\n        std::cout << \"STATUS: Converted input logits tensor\" << std::endl;\n        \/\/ std::cout << \"printing flattened input matrix...\" << std::endl;\n        \/\/ for (int t=0; t < max_time; ++t) {\n        \/\/   std::cout << t << \": \" << th_probs_ptr[t] << std::endl;\n        \/\/ }\n\n        \/\/ prepare\/initialize output variables\n        \/\/ paths, batches, class\n        std::vector<ctc::CTCDecoder::Output> outputs(top_paths);\n        std::cout << \"Output size: \" << outputs.size() << std::endl;\n        for (ctc::CTCDecoder::Output& output : outputs) {\n          output.resize(batch_size);\n        }\n        std::cout << \"STATUS: Output char vector created\" << std::endl;\n\n        float score[batch_size][top_paths] = {{0.0}};\n        Eigen::Map<Eigen::MatrixXf> scores(&score[0][0], batch_size, beam_width);\n        std::cout << \"STATUS: Output score vector created\" << std::endl;\n\n        \/\/ initialize beam scorer (TODO: make this extensible)\n        ctc::CTCBeamSearchDecoder<>::DefaultBeamScorer beam_scorer;\n\n        \/\/ initialize beam search class\n        ctc::CTCBeamSearchDecoder<> beam_search(num_classes, beam_width, &beam_scorer,\n                                                batch_size, merge_repeated == 1);\n        std::cout << \"STATUS: beam decoder initialized\" << std::endl;\n\n        ctc::Status stat = beam_search.Decode(seq_len, inputs, &outputs, &scores);\n        if (!stat.ok()) {\n          std::cout << \"ERROR: \" << stat.error_message() << std::endl;\n          return 0;\n        }\n        std::cout << \"STATUS: decode executed\" << std::endl;\n        std::vector<float> log_probs;\n\n        for (int p=0; p < top_paths; ++p) {\n          int64_t max_decoded = 0;\n          int64_t offset = 0;\n          for (int b=0; b < batch_size; ++b) {\n            auto& p_batch = outputs[p][b];\n            \/\/std::cout << b << \" \" << p << std::endl;\n            int64_t num_decoded = p_batch.size();\n\n            max_decoded = std::max(max_decoded, num_decoded);\n            \/\/std::cout << \"Path \" << p << \", batch \" << b << \":\";\n            for (int64_t t=0; t < num_decoded; ++t) {\n              \/\/ TODO: this could be more efficient (significant pointer arithmetic every time currently)\n              THIntTensor_set3d(th_output, p, b, t, p_batch[t]);\n              THFloatTensor_set2d(th_scores, p, b, scores(b, p));\n              \/\/std::cout << p_batch[t] << \" \";\n            }\n            for (int64_t t = num_decoded; t < max_time; ++t) {\n              THIntTensor_set3d(th_output, p, b, t, -1);\n            }\n            \/\/ std::cout << std::endl;\n          }\n        }\n\n        return 1;\n      }\n  }\n}\n<commit_msg>Remove debug output<commit_after>\n#include <iostream>\n#include \"ctc_beam_entry.h\"\n#include \"ctc_beam_scorer.h\"\n#include \"ctc_beam_search.h\"\n#include \"ctc_decoder.h\"\n#include \"util\/status.h\"\n#include \"TH.h\"\n\nnamespace pytorch {\n  extern \"C\"\n  {\n      int ctc_beam_decode(THFloatTensor *th_probs, THIntTensor *th_seq_len, THIntTensor *th_output,\n                          THFloatTensor *th_scores, int top_paths, int beam_width, int merge_repeated)\n      {\n        const int64_t max_time = THFloatTensor_size(th_probs, 0);\n        const int64_t batch_size = THFloatTensor_size(th_probs, 1);\n        const int64_t num_classes = THFloatTensor_size(th_probs, 2);\n\n        \/\/ convert tensors to something the beam scorer can use\n        \/\/ sequence length\n        int* seq_len_ptr = THIntTensor_data(th_seq_len);\n        ptrdiff_t seq_len_offset = THIntTensor_storageOffset(th_seq_len);\n        Eigen::Map<const Eigen::ArrayXi> seq_len(seq_len_ptr + seq_len_offset, batch_size);\n\n        \/\/ input logits\n        float* probs_ptr = THFloatTensor_data(th_probs);\n        ptrdiff_t probs_offset = THFloatTensor_storageOffset(th_probs);\n        const int64_t probs_stride_0 = THFloatTensor_stride(th_probs, 0);\n        std::vector<Eigen::Map<const Eigen::MatrixXf>> inputs;\n        for (int t=0; t < max_time; ++t) {\n          inputs.emplace_back(probs_ptr + probs_offset + (t*probs_stride_0), batch_size, num_classes);\n        }\n\n        \/\/ prepare\/initialize output variables\n        \/\/ paths, batches, class\n        std::vector<ctc::CTCDecoder::Output> outputs(top_paths);\n        for (ctc::CTCDecoder::Output& output : outputs) {\n          output.resize(batch_size);\n        }\n\n        float score[batch_size][top_paths] = {{0.0}};\n        Eigen::Map<Eigen::MatrixXf> scores(&score[0][0], batch_size, beam_width);\n\n        \/\/ initialize beam scorer (TODO: make this extensible)\n        ctc::CTCBeamSearchDecoder<>::DefaultBeamScorer beam_scorer;\n\n        \/\/ initialize beam search class\n        ctc::CTCBeamSearchDecoder<> beam_search(num_classes, beam_width, &beam_scorer,\n                                                batch_size, merge_repeated == 1);\n\n        ctc::Status stat = beam_search.Decode(seq_len, inputs, &outputs, &scores);\n        if (!stat.ok()) {\n          return 0;\n        }\n        std::vector<float> log_probs;\n\n        for (int p=0; p < top_paths; ++p) {\n          int64_t max_decoded = 0;\n          int64_t offset = 0;\n          for (int b=0; b < batch_size; ++b) {\n            auto& p_batch = outputs[p][b];\n            int64_t num_decoded = p_batch.size();\n\n            max_decoded = std::max(max_decoded, num_decoded);\n            for (int64_t t=0; t < num_decoded; ++t) {\n              \/\/ TODO: this could be more efficient (significant pointer arithmetic every time currently)\n              THIntTensor_set3d(th_output, p, b, t, p_batch[t]);\n              THFloatTensor_set2d(th_scores, p, b, scores(b, p));\n            }\n            for (int64_t t = num_decoded; t < max_time; ++t) {\n              THIntTensor_set3d(th_output, p, b, t, -1);\n            }\n          }\n        }\n        return 1;\n      }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cl_asan -O0 %p\/dll_host.cc -Fe%t\n\/\/ RUN: %clang_cl_asan -LD -O0 %s -Fe%t.dll\n\/\/ RUN: not %run %t %t.dll 2>&1 | FileCheck %s\n\n#include <string.h>\n\nextern \"C\" __declspec(dllexport)\nint test_function() {\n  char buff[6] = \"Hello\";\n\n  memchr(buff, 'z', 7);\n\/\/ CHECK: AddressSanitizer: stack-buffer-overflow on address [[ADDR:0x[0-9a-f]+]]\n\/\/ CHECK: READ of size 7 at [[ADDR]] thread T0\n\/\/ CHECK-NEXT:  __asan_wrap_memchr\n\/\/ CHECK-NEXT:  memchr\n\/\/ CHECK-NEXT:  test_function {{.*}}dll_intercept_memchr.cc:[[@LINE-5]]\n\/\/ CHECK: Address [[ADDR]] is located in stack of thread T0 at offset {{.*}} in frame\n\/\/ CHECK-NEXT:  test_function {{.*}}dll_intercept_memchr.cc\n\/\/ CHECK: 'buff' <== Memory access at offset {{.*}} overflows this variable\n  return 0;\n}\n<commit_msg>[compiler-rt][asan] Disable a broken test on windows 64-bits<commit_after>\/\/ RUN: %clang_cl_asan -O0 %p\/dll_host.cc -Fe%t\n\/\/ RUN: %clang_cl_asan -LD -O0 %s -Fe%t.dll\n\/\/ RUN: not %run %t %t.dll 2>&1 | FileCheck %s\n\n\/\/ On windows 64-bit, the memchr function is written in assembly and is not\n\/\/ hookable with the interception library. There is not enough padding before\n\/\/ the function and there is a short jump on the second instruction which\n\/\/ doesn't not allow enough space to encode a 64-bit indirect jump.\n\/\/ UNSUPPORTED: x86_64-windows\n\n#include <string.h>\n\nextern \"C\" __declspec(dllexport)\nint test_function() {\n  char buff[6] = \"Hello\";\n\n  memchr(buff, 'z', 7);\n\/\/ CHECK: AddressSanitizer: stack-buffer-overflow on address [[ADDR:0x[0-9a-f]+]]\n\/\/ CHECK: READ of size 7 at [[ADDR]] thread T0\n\/\/ CHECK-NEXT:  __asan_wrap_memchr\n\/\/ CHECK-NEXT:  memchr\n\/\/ CHECK-NEXT:  test_function {{.*}}dll_intercept_memchr.cc:[[@LINE-5]]\n\/\/ CHECK: Address [[ADDR]] is located in stack of thread T0 at offset {{.*}} in frame\n\/\/ CHECK-NEXT:  test_function {{.*}}dll_intercept_memchr.cc\n\/\/ CHECK: 'buff' <== Memory access at offset {{.*}} overflows this variable\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 <algorithm>\n\n#include \"webkit\/appcache\/view_appcache_internals_job.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/format_macros.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/i18n\/time_formatting.h\"\n#include \"base\/string_util.h\"\n#include \"net\/base\/escape.h\"\n#include \"net\/url_request\/url_request.h\"\n#include \"webkit\/appcache\/appcache_policy.h\"\n#include \"webkit\/appcache\/appcache_service.h\"\n\nnamespace {\n\nconst char kErrorMessage[] = \"Error in retrieving Application Caches.\";\nconst char kEmptyAppCachesMessage[] = \"No available Application Caches.\";\nconst char kRemoveAppCache[] = \"Remove this AppCache\";\nconst char kManifest[] = \"Manifest: \";\nconst char kSize[] = \"Size: \";\nconst char kCreationTime[] = \"Creation Time: \";\nconst char kLastAccessTime[] = \"Last Access Time: \";\nconst char kLastUpdateTime[] = \"Last Update Time: \";\nconst char kFormattedDisabledAppCacheMsg[] =\n    \"<b><i><font color=\\\"FF0000\\\">\"\n    \"This Application Cache is disabled by policy.<\/font><\/i><\/b><br\/>\";\n\nvoid StartHTML(std::string* out) {\n  DCHECK(out);\n  out->append(\n      \"<!DOCTYPE HTML>\"\n      \"<html><title>AppCache Internals<\/title>\"\n      \"<style>\"\n      \"body { font-family: sans-serif; font-size: 0.8em; }\\n\"\n      \"tt, code, pre { font-family: WebKitHack, monospace; }\\n\"\n      \".subsection_body { margin: 10px 0 10px 2em; }\\n\"\n      \".subsection_title { font-weight: bold; }\\n\"\n      \"<\/style>\"\n      \"<script>\\n\"\n      \/\/ Unfortunately we can't do XHR from chrome:\/\/appcache-internals\n      \/\/ because the chrome:\/\/ protocol restricts access.\n      \/\/\n      \/\/ So instead, we will send commands by doing a form\n      \/\/ submission (which as a side effect will reload the page).\n      \"function RemoveCommand(command) {\\n\"\n      \"  document.getElementById('cmd').value = command;\\n\"\n      \"  document.getElementById('cmdsender').submit();\\n\"\n      \"}\\n\"\n      \"<\/script>\\n\"\n      \"<\/head><body>\"\n      \"<form action='' method=GET id=cmdsender>\"\n      \"<input type='hidden' id=cmd name='remove'>\"\n      \"<\/form>\");\n}\n\nvoid EndHTML(std::string* out) {\n  DCHECK(out);\n  out->append(\"<\/body><\/html>\");\n}\n\n\/\/ Appends an input button to |data| with text |title| that sends the command\n\/\/ string |command| back to the browser, and then refreshes the page.\nvoid DrawCommandButton(const std::string& title,\n                       const std::string& command,\n                       std::string* data) {\n  base::StringAppendF(data, \"<input type=\\\"button\\\" value=\\\"%s\\\" \"\n                      \"onclick=\\\"RemoveCommand('%s')\\\" \/>\",\n                      title.c_str(),\n                      command.c_str());\n}\n\nvoid AddLiTag(const std::string& element_title,\n              const std::string& element_data, std::string* out) {\n  DCHECK(out);\n  out->append(\"<li>\");\n  out->append(element_title);\n  out->append(element_data);\n  out->append(\"<\/li>\");\n}\n\nvoid WrapInHREF(const std::string& in, std::string* out) {\n  out->append(\"<a href='\");\n  out->append(in);\n  out->append(\"'>\");\n  out->append(in);\n  out->append(\"<\/a><br\/>\");\n}\n\nvoid AddHTMLFromAppCacheToOutput(\n    const appcache::AppCacheService& appcache_service,\n    const appcache::AppCacheInfoVector& appcaches, std::string* out) {\n  for (std::vector<appcache::AppCacheInfo>::const_iterator info =\n           appcaches.begin();\n       info != appcaches.end(); ++info) {\n    out->append(\"<p>\");\n    std::string anchored_manifest;\n    WrapInHREF(info->manifest_url.spec(), &anchored_manifest);\n    out->append(kManifest);\n    out->append(anchored_manifest);\n    if (!appcache_service.appcache_policy()->CanLoadAppCache(\n            info->manifest_url)) {\n      out->append(kFormattedDisabledAppCacheMsg);\n    }\n    out->append(\"<br\/>\");\n    DrawCommandButton(kRemoveAppCache, info->manifest_url.spec(), out);\n    out->append(\"<ul>\");\n\n    AddLiTag(kSize,\n             UTF16ToUTF8(FormatBytes(\n                 info->size, GetByteDisplayUnits(info->size), true)),\n             out);\n    AddLiTag(kCreationTime,\n             UTF16ToUTF8(TimeFormatFriendlyDateAndTime(info->creation_time)),\n             out);\n    AddLiTag(kLastAccessTime,\n             UTF16ToUTF8(TimeFormatFriendlyDateAndTime(info->last_access_time)),\n             out);\n    AddLiTag(kLastUpdateTime,\n             UTF16ToUTF8(TimeFormatFriendlyDateAndTime(info->last_update_time)),\n             out);\n\n    out->append(\"<\/ul><\/p><\/br>\");\n  }\n}\n\nstd::string GetAppCacheManifestToRemove(const std::string& query) {\n  if (!StartsWithASCII(query, \"remove=\", true)) {\n    \/\/ Not a recognized format.\n    return std::string();\n  }\n  std::string manifest_str = query.substr(strlen(\"remove=\"));\n  return UnescapeURLComponent(\n      manifest_str, UnescapeRule::NORMAL | UnescapeRule::URL_SPECIAL_CHARS);\n}\n\nstruct ManifestURLComparator {\n public:\n  bool operator() (\n      const appcache::AppCacheInfo& lhs,\n      const appcache::AppCacheInfo& rhs) const {\n    return (lhs.manifest_url.spec() < rhs.manifest_url.spec());\n  }\n} manifest_url_comparator;\n\n}  \/\/ namespace\n\nnamespace appcache {\n\nViewAppCacheInternalsJob::ViewAppCacheInternalsJob(\n    net::URLRequest* request,\n    AppCacheService* service)\n    : net::URLRequestSimpleJob(request),\n      appcache_service_(service) {\n}\n\nViewAppCacheInternalsJob::~ViewAppCacheInternalsJob() {\n  \/\/ Cancel callback if job is destroyed before callback is called.\n  if (appcache_done_callback_)\n    appcache_done_callback_.release()->Cancel();\n}\n\nvoid ViewAppCacheInternalsJob::GetAppCacheInfoAsync() {\n  info_collection_ = new AppCacheInfoCollection;\n  appcache_done_callback_ =\n      new net::CancelableCompletionCallback<ViewAppCacheInternalsJob>(\n          this, &ViewAppCacheInternalsJob::AppCacheDone);\n  appcache_service_->GetAllAppCacheInfo(\n      info_collection_, appcache_done_callback_);\n}\n\nvoid ViewAppCacheInternalsJob::RemoveAppCacheInfoAsync(\n    const std::string& manifest_url_spec) {\n  appcache_done_callback_ =\n      new net::CancelableCompletionCallback<ViewAppCacheInternalsJob>(\n          this, &ViewAppCacheInternalsJob::AppCacheDone);\n\n  GURL manifest(manifest_url_spec);\n  appcache_service_->DeleteAppCacheGroup(\n      manifest, appcache_done_callback_);\n}\n\nvoid ViewAppCacheInternalsJob::Start() {\n  if (!request_)\n    return;\n\n  \/\/ Handle any remove appcache request, then redirect back to\n  \/\/ the same URL stripped of query parameters. The redirect happens as part\n  \/\/ of IsRedirectResponse().\n  if (request_->url().has_query()) {\n    std::string remove_appcache_manifest(\n        GetAppCacheManifestToRemove(request_->url().query()));\n\n    \/\/ Empty manifests are dealt with by the deleter.\n    RemoveAppCacheInfoAsync(remove_appcache_manifest);\n  } else {\n    GetAppCacheInfoAsync();\n  }\n}\n\nbool ViewAppCacheInternalsJob::IsRedirectResponse(\n    GURL* location, int* http_status_code) {\n  if (request_->url().has_query()) {\n    \/\/ Strip the query parameters.\n    GURL::Replacements replacements;\n    replacements.ClearQuery();\n    *location = request_->url().ReplaceComponents(replacements);\n    *http_status_code = 307;\n    return true;\n  }\n  return false;\n}\n\nvoid ViewAppCacheInternalsJob::GenerateHTMLAppCacheInfo(\n    std::string* out) const {\n  typedef std::map<GURL, AppCacheInfoVector> InfoByOrigin;\n  AppCacheInfoVector appcaches;\n  for (InfoByOrigin::const_iterator origin =\n           info_collection_->infos_by_origin.begin();\n       origin != info_collection_->infos_by_origin.end(); ++origin) {\n    for (AppCacheInfoVector::const_iterator info =\n             origin->second.begin(); info != origin->second.end(); ++info)\n      appcaches.push_back(*info);\n  }\n\n  std::sort(appcaches.begin(), appcaches.end(), manifest_url_comparator);\n\n  AddHTMLFromAppCacheToOutput(*appcache_service_, appcaches, out);\n}\n\nvoid ViewAppCacheInternalsJob::AppCacheDone(int rv) {\n  appcache_done_callback_ = NULL;\n  if (rv != net::OK)\n    info_collection_ = NULL;\n  StartAsync();\n}\n\nbool ViewAppCacheInternalsJob::GetData(std::string* mime_type,\n                                       std::string* charset,\n                                       std::string* data) const {\n  mime_type->assign(\"text\/html\");\n  charset->assign(\"UTF-8\");\n\n  data->clear();\n  StartHTML(data);\n  if (!info_collection_.get())\n    data->append(kErrorMessage);\n  else if (info_collection_->infos_by_origin.empty())\n    data->append(kEmptyAppCachesMessage);\n  else\n    GenerateHTMLAppCacheInfo(data);\n  EndHTML(data);\n  return true;\n}\n\n}  \/\/ namespace appcache\n<commit_msg>Base64 encode form param values in about:appcache-internals <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 <algorithm>\n\n#include \"webkit\/appcache\/view_appcache_internals_job.h\"\n\n#include \"base\/base64.h\"\n#include \"base\/logging.h\"\n#include \"base\/format_macros.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/i18n\/time_formatting.h\"\n#include \"base\/string_util.h\"\n#include \"net\/base\/escape.h\"\n#include \"net\/url_request\/url_request.h\"\n#include \"webkit\/appcache\/appcache_policy.h\"\n#include \"webkit\/appcache\/appcache_service.h\"\n\nnamespace {\n\nconst char kErrorMessage[] = \"Error in retrieving Application Caches.\";\nconst char kEmptyAppCachesMessage[] = \"No available Application Caches.\";\nconst char kRemoveAppCache[] = \"Remove this AppCache\";\nconst char kManifest[] = \"Manifest: \";\nconst char kSize[] = \"Size: \";\nconst char kCreationTime[] = \"Creation Time: \";\nconst char kLastAccessTime[] = \"Last Access Time: \";\nconst char kLastUpdateTime[] = \"Last Update Time: \";\nconst char kFormattedDisabledAppCacheMsg[] =\n    \"<b><i><font color=\\\"FF0000\\\">\"\n    \"This Application Cache is disabled by policy.<\/font><\/i><\/b><br\/>\";\n\nvoid StartHTML(std::string* out) {\n  DCHECK(out);\n  out->append(\n      \"<!DOCTYPE HTML>\"\n      \"<html><title>AppCache Internals<\/title>\"\n      \"<style>\"\n      \"body { font-family: sans-serif; font-size: 0.8em; }\\n\"\n      \"tt, code, pre { font-family: WebKitHack, monospace; }\\n\"\n      \".subsection_body { margin: 10px 0 10px 2em; }\\n\"\n      \".subsection_title { font-weight: bold; }\\n\"\n      \"<\/style>\"\n      \"<script>\\n\"\n      \/\/ Unfortunately we can't do XHR from chrome:\/\/appcache-internals\n      \/\/ because the chrome:\/\/ protocol restricts access.\n      \/\/\n      \/\/ So instead, we will send commands by doing a form\n      \/\/ submission (which as a side effect will reload the page).\n      \"function RemoveCommand(command) {\\n\"\n      \"  document.getElementById('cmd').value = command;\\n\"\n      \"  document.getElementById('cmdsender').submit();\\n\"\n      \"}\\n\"\n      \"<\/script>\\n\"\n      \"<\/head><body>\"\n      \"<form action='' method=GET id=cmdsender>\"\n      \"<input type='hidden' id=cmd name='remove'>\"\n      \"<\/form>\");\n}\n\nvoid EndHTML(std::string* out) {\n  DCHECK(out);\n  out->append(\"<\/body><\/html>\");\n}\n\n\/\/ Appends an input button to |data| with text |title| that sends the command\n\/\/ string |command| back to the browser, and then refreshes the page.\nvoid DrawCommandButton(const std::string& title,\n                       const std::string& command,\n                       std::string* data) {\n  base::StringAppendF(data, \"<input type=\\\"button\\\" value=\\\"%s\\\" \"\n                      \"onclick=\\\"RemoveCommand('%s')\\\" \/>\",\n                      title.c_str(),\n                      command.c_str());\n}\n\nvoid AddLiTag(const std::string& element_title,\n              const std::string& element_data, std::string* out) {\n  DCHECK(out);\n  out->append(\"<li>\");\n  out->append(element_title);\n  out->append(element_data);\n  out->append(\"<\/li>\");\n}\n\nvoid WrapInHREF(const std::string& in, std::string* out) {\n  out->append(\"<a href=\");\n  out->append(in);\n  out->append(\">\");\n  out->append(in);\n  out->append(\"<\/a><br\/>\");\n}\n\nvoid AddHTMLFromAppCacheToOutput(\n    const appcache::AppCacheService& appcache_service,\n    const appcache::AppCacheInfoVector& appcaches, std::string* out) {\n  for (std::vector<appcache::AppCacheInfo>::const_iterator info =\n           appcaches.begin();\n       info != appcaches.end(); ++info) {\n    std::string manifest_url_base64;\n    base::Base64Encode(info->manifest_url.spec(), &manifest_url_base64);\n\n    out->append(\"<p>\");\n    std::string anchored_manifest;\n    WrapInHREF(info->manifest_url.spec(), &anchored_manifest);\n    out->append(kManifest);\n    out->append(anchored_manifest);\n    if (!appcache_service.appcache_policy()->CanLoadAppCache(\n            info->manifest_url)) {\n      out->append(kFormattedDisabledAppCacheMsg);\n    }\n    out->append(\"<br\/>\");\n    DrawCommandButton(kRemoveAppCache, manifest_url_base64, out);\n    out->append(\"<ul>\");\n\n    AddLiTag(kSize,\n             UTF16ToUTF8(FormatBytes(\n                 info->size, GetByteDisplayUnits(info->size), true)),\n             out);\n    AddLiTag(kCreationTime,\n             UTF16ToUTF8(TimeFormatFriendlyDateAndTime(info->creation_time)),\n             out);\n    AddLiTag(kLastAccessTime,\n             UTF16ToUTF8(TimeFormatFriendlyDateAndTime(info->last_access_time)),\n             out);\n    AddLiTag(kLastUpdateTime,\n             UTF16ToUTF8(TimeFormatFriendlyDateAndTime(info->last_update_time)),\n             out);\n\n    out->append(\"<\/ul><\/p><\/br>\");\n  }\n}\n\nstd::string GetAppCacheManifestToRemove(const std::string& query) {\n  if (!StartsWithASCII(query, \"remove=\", true)) {\n    \/\/ Not a recognized format.\n    return std::string();\n  }\n  std::string manifest_url_base64 = UnescapeURLComponent(\n      query.substr(strlen(\"remove=\")),\n      UnescapeRule::NORMAL | UnescapeRule::URL_SPECIAL_CHARS);\n  std::string manifest_url;\n  base::Base64Decode(manifest_url_base64, &manifest_url);\n  return manifest_url;\n}\n\nstruct ManifestURLComparator {\n public:\n  bool operator() (\n      const appcache::AppCacheInfo& lhs,\n      const appcache::AppCacheInfo& rhs) const {\n    return (lhs.manifest_url.spec() < rhs.manifest_url.spec());\n  }\n} manifest_url_comparator;\n\n}  \/\/ namespace\n\nnamespace appcache {\n\nViewAppCacheInternalsJob::ViewAppCacheInternalsJob(\n    net::URLRequest* request,\n    AppCacheService* service)\n    : net::URLRequestSimpleJob(request),\n      appcache_service_(service) {\n}\n\nViewAppCacheInternalsJob::~ViewAppCacheInternalsJob() {\n  \/\/ Cancel callback if job is destroyed before callback is called.\n  if (appcache_done_callback_)\n    appcache_done_callback_.release()->Cancel();\n}\n\nvoid ViewAppCacheInternalsJob::GetAppCacheInfoAsync() {\n  info_collection_ = new AppCacheInfoCollection;\n  appcache_done_callback_ =\n      new net::CancelableCompletionCallback<ViewAppCacheInternalsJob>(\n          this, &ViewAppCacheInternalsJob::AppCacheDone);\n  appcache_service_->GetAllAppCacheInfo(\n      info_collection_, appcache_done_callback_);\n}\n\nvoid ViewAppCacheInternalsJob::RemoveAppCacheInfoAsync(\n    const std::string& manifest_url_spec) {\n  appcache_done_callback_ =\n      new net::CancelableCompletionCallback<ViewAppCacheInternalsJob>(\n          this, &ViewAppCacheInternalsJob::AppCacheDone);\n\n  GURL manifest(manifest_url_spec);\n  appcache_service_->DeleteAppCacheGroup(\n      manifest, appcache_done_callback_);\n}\n\nvoid ViewAppCacheInternalsJob::Start() {\n  if (!request_)\n    return;\n\n  \/\/ Handle any remove appcache request, then redirect back to\n  \/\/ the same URL stripped of query parameters. The redirect happens as part\n  \/\/ of IsRedirectResponse().\n  if (request_->url().has_query()) {\n    std::string remove_appcache_manifest(\n        GetAppCacheManifestToRemove(request_->url().query()));\n\n    \/\/ Empty manifests are dealt with by the deleter.\n    RemoveAppCacheInfoAsync(remove_appcache_manifest);\n  } else {\n    GetAppCacheInfoAsync();\n  }\n}\n\nbool ViewAppCacheInternalsJob::IsRedirectResponse(\n    GURL* location, int* http_status_code) {\n  if (request_->url().has_query()) {\n    \/\/ Strip the query parameters.\n    GURL::Replacements replacements;\n    replacements.ClearQuery();\n    *location = request_->url().ReplaceComponents(replacements);\n    *http_status_code = 307;\n    return true;\n  }\n  return false;\n}\n\nvoid ViewAppCacheInternalsJob::GenerateHTMLAppCacheInfo(\n    std::string* out) const {\n  typedef std::map<GURL, AppCacheInfoVector> InfoByOrigin;\n  AppCacheInfoVector appcaches;\n  for (InfoByOrigin::const_iterator origin =\n           info_collection_->infos_by_origin.begin();\n       origin != info_collection_->infos_by_origin.end(); ++origin) {\n    for (AppCacheInfoVector::const_iterator info =\n             origin->second.begin(); info != origin->second.end(); ++info)\n      appcaches.push_back(*info);\n  }\n\n  std::sort(appcaches.begin(), appcaches.end(), manifest_url_comparator);\n\n  AddHTMLFromAppCacheToOutput(*appcache_service_, appcaches, out);\n}\n\nvoid ViewAppCacheInternalsJob::AppCacheDone(int rv) {\n  appcache_done_callback_ = NULL;\n  if (rv != net::OK)\n    info_collection_ = NULL;\n  StartAsync();\n}\n\nbool ViewAppCacheInternalsJob::GetData(std::string* mime_type,\n                                       std::string* charset,\n                                       std::string* data) const {\n  mime_type->assign(\"text\/html\");\n  charset->assign(\"UTF-8\");\n\n  data->clear();\n  StartHTML(data);\n  if (!info_collection_.get())\n    data->append(kErrorMessage);\n  else if (info_collection_->infos_by_origin.empty())\n    data->append(kEmptyAppCachesMessage);\n  else\n    GenerateHTMLAppCacheInfo(data);\n  EndHTML(data);\n  return true;\n}\n\n}  \/\/ namespace appcache\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2019 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\n\/\/ <h1>Subdomains Example 3 - Integrating discontinuous data that cuts the mesh<\/h1>\n\/\/ \\author Benjamin S. Kirk\n\/\/ \\date 2013\n\n\n\/\/ C++ include files that we need\n#include <iostream>\n#include <algorithm>\n#include <math.h>\n\n\/\/ Basic include file needed for the mesh functionality.\n#include \"libmesh\/libmesh.h\"\n#include \"libmesh\/mesh.h\"\n#include \"libmesh\/mesh_generation.h\"\n#include \"libmesh\/mesh_refinement.h\"\n#include \"libmesh\/quadrature_gauss.h\"\n#include \"libmesh\/quadrature_composite.h\"\n#include \"libmesh\/fe.h\"\n#include \"libmesh\/elem.h\"\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\n\/\/ declare the functions we will use\nvoid integrate_function (const MeshBase & mesh);\n\n\/\/ signed distance function\nconst Real radius = 0.5;\n\nReal distance (const Point & p)\n{\n  Point cent(0.8, 0.9);\n  return ((p-cent).norm() - radius);\n}\n\nReal integrand (const Point & p)\n{\n  return (distance(p) < 0) ? 10. : 1.;\n}\n\n\n\n\/\/ Begin the main program.\nint main (int argc, char ** argv)\n{\n  \/\/ Initialize libMesh and any dependent libraries, like in example 2.\n  LibMeshInit init (argc, argv);\n\n  \/\/ This example requires Adaptive Mesh Refinement support - although\n  \/\/ it only refines uniformly, the refinement code used is the same\n  \/\/ underneath.  It also requires libmesh support for Triangle and\n  \/\/ Tetgen, which means that libmesh must be configured with\n  \/\/ --disable-strict-lgpl for this example to run.\n#if !defined(LIBMESH_HAVE_TRIANGLE) || !defined(LIBMESH_HAVE_TETGEN) || !defined(LIBMESH_ENABLE_AMR)\n  libmesh_example_requires(false, \"--disable-strict-lgpl --enable-amr\");\n#else\n\n  \/\/ Skip this 2D example if libMesh was compiled as 1D-only.\n  libmesh_example_requires(2 <= LIBMESH_DIM, \"2D support\");\n\n  \/\/ Read the mesh from file.  This is the coarse mesh that will be used\n  \/\/ in example 10 to demonstrate adaptive mesh refinement.  Here we will\n  \/\/ simply read it in and uniformly refine it 5 times before we compute\n  \/\/ with it.\n  Mesh mesh(init.comm());\n\n  {\n    unsigned int dim=2;\n\n    if (argc == 3 && std::atoi(argv[2]) == 3)\n      {\n        libmesh_here();\n        dim=3;\n      }\n\n    mesh.read ((dim==2) ? \"mesh.xda\" : \"hybrid_3d.xda\");\n  }\n\n  \/\/ Create a MeshRefinement object to handle refinement of our mesh.\n  \/\/ This class handles all the details of mesh refinement and coarsening.\n  MeshRefinement mesh_refinement (mesh);\n\n  \/\/ Uniformly refine the mesh 4 times.  This is the\n  \/\/ first time we use the mesh refinement capabilities\n  \/\/ of the library.\n  mesh_refinement.uniformly_refine (4);\n\n  \/\/ Print information about the mesh to the screen.\n  mesh.print_info();\n\n  \/\/ integrate the desired function\n  integrate_function (mesh);\n\n  \/\/ All done.\n  return 0;\n#endif\n}\n\n\n\nvoid integrate_function (const MeshBase & mesh)\n{\n#if defined(LIBMESH_HAVE_TRIANGLE) && defined(LIBMESH_HAVE_TETGEN)\n\n  std::vector<Real> vertex_distance;\n\n  QComposite<QGauss> qrule (mesh.mesh_dimension(), FIRST);\n  \/\/QGauss qrule (mesh.mesh_dimension(), FIRST);\n\n  std::unique_ptr<FEBase> fe (FEBase::build (mesh.mesh_dimension(), FEType (FIRST, LAGRANGE)));\n\n  Real int_val=0.;\n\n  const std::vector<Point> & q_points = fe->get_xyz();\n  const std::vector<Real>  & JxW      = fe->get_JxW();\n\n  for (const auto & elem : mesh.active_local_element_ptr_range())\n    {\n      vertex_distance.clear();\n\n      for (unsigned int v=0; v<elem->n_vertices(); v++)\n        vertex_distance.push_back (distance(elem->point(v)));\n\n      qrule.init (*elem, vertex_distance);\n\n      fe->reinit (elem,\n                  &(qrule.get_points()),\n                  &(qrule.get_weights()));\n\n\n      \/\/ TODO:  would it be valuable to have the composite quadrature rule sort\n      \/\/ from smallest to largest JxW value to help prevent\n      \/\/ ... large + small + large + large + small ...\n      \/\/ type truncation errors?\n      for (std::size_t qp=0; qp<q_points.size(); qp++)\n        int_val += JxW[qp] * integrand(q_points[qp]);\n    }\n\n  mesh.comm().sum (int_val);\n\n  libMesh::out << \"\\n***********************************\\n\"\n               << \" int_val   = \" << int_val << std::endl\n               << \" exact_val = \" <<  1*(2*2 - radius*radius*pi) + 10.*(radius*radius*pi)\n               << \"\\n***********************************\\n\"\n               << std::endl;\n#else\n  libmesh_ignore(mesh);\n#endif\n}\n<commit_msg>Directly include parallel.h where needed<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2019 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\n\/\/ <h1>Subdomains Example 3 - Integrating discontinuous data that cuts the mesh<\/h1>\n\/\/ \\author Benjamin S. Kirk\n\/\/ \\date 2013\n\n\n\/\/ C++ include files that we need\n#include <iostream>\n#include <algorithm>\n#include <math.h>\n\n\/\/ Basic include file needed for the mesh functionality.\n#include \"libmesh\/libmesh.h\"\n#include \"libmesh\/mesh.h\"\n#include \"libmesh\/mesh_generation.h\"\n#include \"libmesh\/mesh_refinement.h\"\n#include \"libmesh\/quadrature_gauss.h\"\n#include \"libmesh\/quadrature_composite.h\"\n#include \"libmesh\/fe.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/parallel.h\"\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\n\/\/ declare the functions we will use\nvoid integrate_function (const MeshBase & mesh);\n\n\/\/ signed distance function\nconst Real radius = 0.5;\n\nReal distance (const Point & p)\n{\n  Point cent(0.8, 0.9);\n  return ((p-cent).norm() - radius);\n}\n\nReal integrand (const Point & p)\n{\n  return (distance(p) < 0) ? 10. : 1.;\n}\n\n\n\n\/\/ Begin the main program.\nint main (int argc, char ** argv)\n{\n  \/\/ Initialize libMesh and any dependent libraries, like in example 2.\n  LibMeshInit init (argc, argv);\n\n  \/\/ This example requires Adaptive Mesh Refinement support - although\n  \/\/ it only refines uniformly, the refinement code used is the same\n  \/\/ underneath.  It also requires libmesh support for Triangle and\n  \/\/ Tetgen, which means that libmesh must be configured with\n  \/\/ --disable-strict-lgpl for this example to run.\n#if !defined(LIBMESH_HAVE_TRIANGLE) || !defined(LIBMESH_HAVE_TETGEN) || !defined(LIBMESH_ENABLE_AMR)\n  libmesh_example_requires(false, \"--disable-strict-lgpl --enable-amr\");\n#else\n\n  \/\/ Skip this 2D example if libMesh was compiled as 1D-only.\n  libmesh_example_requires(2 <= LIBMESH_DIM, \"2D support\");\n\n  \/\/ Read the mesh from file.  This is the coarse mesh that will be used\n  \/\/ in example 10 to demonstrate adaptive mesh refinement.  Here we will\n  \/\/ simply read it in and uniformly refine it 5 times before we compute\n  \/\/ with it.\n  Mesh mesh(init.comm());\n\n  {\n    unsigned int dim=2;\n\n    if (argc == 3 && std::atoi(argv[2]) == 3)\n      {\n        libmesh_here();\n        dim=3;\n      }\n\n    mesh.read ((dim==2) ? \"mesh.xda\" : \"hybrid_3d.xda\");\n  }\n\n  \/\/ Create a MeshRefinement object to handle refinement of our mesh.\n  \/\/ This class handles all the details of mesh refinement and coarsening.\n  MeshRefinement mesh_refinement (mesh);\n\n  \/\/ Uniformly refine the mesh 4 times.  This is the\n  \/\/ first time we use the mesh refinement capabilities\n  \/\/ of the library.\n  mesh_refinement.uniformly_refine (4);\n\n  \/\/ Print information about the mesh to the screen.\n  mesh.print_info();\n\n  \/\/ integrate the desired function\n  integrate_function (mesh);\n\n  \/\/ All done.\n  return 0;\n#endif\n}\n\n\n\nvoid integrate_function (const MeshBase & mesh)\n{\n#if defined(LIBMESH_HAVE_TRIANGLE) && defined(LIBMESH_HAVE_TETGEN)\n\n  std::vector<Real> vertex_distance;\n\n  QComposite<QGauss> qrule (mesh.mesh_dimension(), FIRST);\n  \/\/QGauss qrule (mesh.mesh_dimension(), FIRST);\n\n  std::unique_ptr<FEBase> fe (FEBase::build (mesh.mesh_dimension(), FEType (FIRST, LAGRANGE)));\n\n  Real int_val=0.;\n\n  const std::vector<Point> & q_points = fe->get_xyz();\n  const std::vector<Real>  & JxW      = fe->get_JxW();\n\n  for (const auto & elem : mesh.active_local_element_ptr_range())\n    {\n      vertex_distance.clear();\n\n      for (unsigned int v=0; v<elem->n_vertices(); v++)\n        vertex_distance.push_back (distance(elem->point(v)));\n\n      qrule.init (*elem, vertex_distance);\n\n      fe->reinit (elem,\n                  &(qrule.get_points()),\n                  &(qrule.get_weights()));\n\n\n      \/\/ TODO:  would it be valuable to have the composite quadrature rule sort\n      \/\/ from smallest to largest JxW value to help prevent\n      \/\/ ... large + small + large + large + small ...\n      \/\/ type truncation errors?\n      for (std::size_t qp=0; qp<q_points.size(); qp++)\n        int_val += JxW[qp] * integrand(q_points[qp]);\n    }\n\n  mesh.comm().sum (int_val);\n\n  libMesh::out << \"\\n***********************************\\n\"\n               << \" int_val   = \" << int_val << std::endl\n               << \" exact_val = \" <<  1*(2*2 - radius*radius*pi) + 10.*(radius*radius*pi)\n               << \"\\n***********************************\\n\"\n               << std::endl;\n#else\n  libmesh_ignore(mesh);\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright © 2017 Collabora Ltd.\n *\n * This file is part of vkmark.\n *\n * vkmark 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 * vkmark is distributed in the hope that it will be 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 vkmark. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n * Authors:\n *   Alexandros Frantzis <alexandros.frantzis@collabora.com>\n *\/\n\n#include \"window_system_loader.h\"\n#include \"window_system.h\"\n#include \"options.h\"\n#include <dlfcn.h>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <dirent.h>\n#include <stdexcept>\n\nnamespace\n{\n\nusing WindowSystemCreateFunc = std::unique_ptr<WindowSystem>(*)(Options const&);\nusing WindowSystemProbeFunc = int(*)();\n\nvoid close_lib(void* handle)\n{\n    if (handle) dlclose(handle);\n}\n\nstd::vector<std::string> files_in_dir(std::string dir)\n{\n    std::vector<std::string> files;\n\n    auto const dirp = opendir(dir.c_str());\n\n    if (dirp != nullptr)\n    {\n        dirent const* ent;\n\n        while ((ent = readdir(dirp)) != nullptr)\n            files.push_back(dir + \"\/\" + ent->d_name);\n\n        closedir(dirp);\n    }\n\n    return files;\n}\n\n}\n\nWindowSystemLoader::WindowSystemLoader(Options const& options)\n    : options{options},\n      lib_handle{nullptr, close_lib}\n{\n}\n\nWindowSystem& WindowSystemLoader::load_window_system()\n{\n    if (window_system)\n        return *window_system;\n\n    auto const lib = probe_for_best_window_system();\n\n    lib_handle = LibHandle{dlopen(lib.c_str(), RTLD_LAZY), close_lib};\n\n    auto const ws_create = reinterpret_cast<WindowSystemCreateFunc>(\n        dlsym(lib_handle.get(), \"vkmark_window_system_create\"));\n\n    if (!ws_create)\n        throw std::runtime_error{\"Selected window system module doesn't provide a create function\"};\n    \n    window_system = ws_create(options);\n\n    if (!window_system)\n        throw std::runtime_error{\"Selected window system module failed to create window system\"};\n\n    return *window_system;\n}\n\nstd::string WindowSystemLoader::probe_for_best_window_system()\n{\n    std::vector<int> priorities;\n    auto const candidates = files_in_dir(options.window_system_dir);\n\n    for (auto const& c : candidates)\n    {\n        auto const handle = LibHandle{dlopen(c.c_str(), RTLD_LAZY), close_lib};\n        if (handle.get())\n        {\n            auto ws_probe = reinterpret_cast<WindowSystemProbeFunc>(\n                dlsym(handle.get(), \"vkmark_window_system_probe\"));\n            if (ws_probe)\n                priorities.push_back(ws_probe());\n            else\n                priorities.push_back(0);\n        }\n        else\n        {\n            priorities.push_back(0);\n        }\n    }\n\n    auto const iter = std::max_element(priorities.begin(), priorities.end());\n    if (iter != priorities.end() && *iter > 0)\n    {\n        auto const index = std::distance(priorities.begin(), iter);\n        return candidates[index];\n    }\n\n    throw std::runtime_error{\"Failed to find usable window system, try using --window-system-dir\"};\n}\n<commit_msg>core: Improve window system module loading and add logging<commit_after>\/*\n * Copyright © 2017 Collabora Ltd.\n *\n * This file is part of vkmark.\n *\n * vkmark 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 * vkmark is distributed in the hope that it will be 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 vkmark. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n * Authors:\n *   Alexandros Frantzis <alexandros.frantzis@collabora.com>\n *\/\n\n#include \"window_system_loader.h\"\n#include \"window_system.h\"\n#include \"options.h\"\n#include \"log.h\"\n\n#include <dlfcn.h>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <dirent.h>\n#include <stdexcept>\n\nnamespace\n{\n\nusing WindowSystemCreateFunc = std::unique_ptr<WindowSystem>(*)(Options const&);\nusing WindowSystemProbeFunc = int(*)();\n\nvoid close_lib(void* handle)\n{\n    if (handle) dlclose(handle);\n}\n\nbool has_shared_object_extension(std::string const& name)\n{\n    static std::string const so{\".so\"};\n\n    return name.size() > so.size() &&\n           std::equal(so.rbegin(), so.rend(), name.rbegin());\n}\n\nstd::vector<std::string> files_in_dir(std::string dir)\n{\n    std::vector<std::string> files;\n\n    auto const dirp = opendir(dir.c_str());\n\n    if (dirp != nullptr)\n    {\n        dirent const* ent;\n\n        while ((ent = readdir(dirp)) != nullptr)\n        {\n            if (has_shared_object_extension(ent->d_name))\n                files.push_back(dir + \"\/\" + ent->d_name);\n        }\n\n        closedir(dirp);\n    }\n\n    return files;\n}\n\n}\n\nWindowSystemLoader::WindowSystemLoader(Options const& options)\n    : options{options},\n      lib_handle{nullptr, close_lib}\n{\n}\n\nWindowSystem& WindowSystemLoader::load_window_system()\n{\n    if (window_system)\n        return *window_system;\n\n    auto const lib = probe_for_best_window_system();\n\n    lib_handle = LibHandle{dlopen(lib.c_str(), RTLD_LAZY), close_lib};\n\n    auto const ws_create = reinterpret_cast<WindowSystemCreateFunc>(\n        dlsym(lib_handle.get(), \"vkmark_window_system_create\"));\n\n    if (!ws_create)\n        throw std::runtime_error{\"Selected window system module doesn't provide a create function\"};\n    \n    window_system = ws_create(options);\n\n    if (!window_system)\n        throw std::runtime_error{\"Selected window system module failed to create window system\"};\n\n    return *window_system;\n}\n\nstd::string WindowSystemLoader::probe_for_best_window_system()\n{\n    std::vector<int> priorities;\n\n    Log::debug(\"WindowSystemLoader: Looking in %s for window system modules\\n\",\n               options.window_system_dir.c_str());\n\n    auto const candidates = files_in_dir(options.window_system_dir);\n\n    for (auto const& c : candidates)\n    {\n        Log::debug(\"WindowSystemLoader: Probing %s... \", c.c_str());\n\n        auto const handle = LibHandle{dlopen(c.c_str(), RTLD_LAZY), close_lib};\n        if (handle.get())\n        {\n            auto ws_probe = reinterpret_cast<WindowSystemProbeFunc>(\n                dlsym(handle.get(), \"vkmark_window_system_probe\"));\n            if (ws_probe)\n            {\n                priorities.push_back(ws_probe());\n\n                auto const fmt = Log::continuation_prefix + \"succeeded with priority %d\\n\";\n                Log::debug(fmt.c_str(), priorities.back());\n            }\n            else\n            {\n                priorities.push_back(0);\n\n                auto const fmt = Log::continuation_prefix + \"failed to find probe function: %s\\n\";\n                Log::debug(fmt.c_str(), dlerror());\n            }\n        }\n        else\n        {\n            priorities.push_back(0);\n\n            auto const fmt = Log::continuation_prefix + \"failed to load file: %s\\n\";\n            Log::debug(fmt.c_str(), dlerror());\n        }\n    }\n\n    auto const iter = std::max_element(priorities.begin(), priorities.end());\n    if (iter != priorities.end() && *iter > 0)\n    {\n        auto const index = std::distance(priorities.begin(), iter);\n        Log::debug(\"WindowSystemLoader: Selected window system module %s\\n\",\n                   candidates[index].c_str());\n        return candidates[index];\n    }\n\n    throw std::runtime_error{\"Failed to find usable window system, try using --window-system-dir\"};\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ biopore_drain.C --- Static vertical biopores that ends in drain pipes.\n\/\/ \n\/\/ Copyright 2008 Per Abrahamsen and KU.\n\/\/\n\/\/ This file is part of Daisy.\n\/\/ \n\/\/ Daisy is free software; you can redistribute it and\/or modify\n\/\/ the Free Software Foundation; either version 2.1 of the License, or\n\/\/ (at your option) any later version.\n\/\/ \n\/\/ Daisy is distributed in the hope that it 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 Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Lesser Public License\n\/\/ along with Daisy; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\n#define BUILD_DLL\n\n#include \"biopore.h\"\n#include \"block.h\"\n#include \"vcheck.h\"\n#include \"librarian.h\"\n#include \"submodeler.h\"\n#include \"check.h\"\n#include \"geometry.h\"\n#include \"soil.h\"\n#include \"soil_heat.h\"\n#include \"anystate.h\"\n#include \"chemical.h\"\n#include \"groundwater.h\"\n#include <sstream>\n\n\/\/ The 'drain' model.\n\nstruct BioporeDrain : public Biopore\n{\n  \/\/ Parameters.\n  \/* const *\/ double pipe_position;   \/\/ [cm]\n\n  \/\/ State\n  Anystate get_state () const\n  { return Anystate::none (); }\n  void set_state (const Anystate&)\n  { }\n\n  \/\/ Simulation.\n  double total_water () const\n  { return 0.0; }\n  void get_solute (IM&) const\n  { }\n  double air_bottom (size_t) const    \/\/ Lowest point with air [cm]\n  { return pipe_position; }\n  \n  double capacity (const Geometry& geo, size_t e, const double dt) const\n  { return max_infiltration_rate (geo, e) * dt; }\n  void infiltrate (const Geometry&, size_t, double \/* [cm] *\/)\n  { }\n\n  double matrix_biopore_drain (size_t c, const Geometry& geo, \n                               const Soil& soil, bool active, \n                               const double h_barrier, double pressure_end,\n                               double K_xx, double h) const;\n  void update_matrix_sink (const Geometry& geo,    \n                           const Soil& soil,  \n                           const SoilHeat& soil_heat, \n                           const std::vector<bool>& active,\n                           const double h_barrier,\n                           const double pressure_initiate,\n                           const double pressure_end,\n                           const std::vector<double>& h, const double dt);\n  void update_water ()\n  { }\n  void add_to_sink (std::vector<double>&,\n                    std::vector<double>& S_drain) const\n  {\n    const size_t cell_size = S.size ();\n    daisy_assert (S_drain.size () == cell_size);\n    for (size_t c = 0; c < cell_size; c++)\n      S_drain[c] += S[c];\n  }\n  void add_solute (symbol, size_t, const double)\n  { }\n  void matrix_solute (const Geometry&, const double, \n                      const Chemical&, std::vector<double>&,\n                      Treelog&)\n  { \/* Handled by S_drain. *\/ }\n  void output (Log& log) const\n  { output_base (log); }\n\n  \/\/ Create and Destroy.\n  bool initialize (const Units& units, const Geometry& geo, const Scope& scope,\n                   const Groundwater& groundwater, Treelog& msg)\n  {\n    bool ok = initialize_base (units, geo, scope, msg); \n    if (pipe_position > 0)\n      {\n        if (groundwater.is_pipe ())\n          \/\/ Pipe height not specified here, use value from column.\n          pipe_position = groundwater.pipe_height ();\n        else\n          {\n            msg.error (\"Unknown pipe position\");\n            ok = false;\n          }\n      }\n    return ok;\n  }\n  bool check (const Geometry& geo, Treelog& msg) const\n  { return check_base (geo, msg); }\n  BioporeDrain (Block& al);\n};\n\ndouble \nBioporeDrain::matrix_biopore_drain (size_t c, const Geometry& geo, \n                                    const Soil& soil, bool active, \n                                    const double h_barrier, \n                                    const double pressure_end,\n                                    double K_xx, double h) const\n{\n  const double M_c = density_cell[c];\n  if (!std::isnormal (M_c))\n    \/\/ No biopores here.\n    return 0.0;\n  const double r_c = diameter \/ 2.0;\n  const double h_3 = air_bottom (c) - geo.cell_z (c);\n\n  double S;\n  if (active && h>h_3 + h_barrier)\n    {\n      \/\/ The largest pressure gradient between the domains are\n      \/\/ pressure_end, above that we claim air will disrupt the suction.\n      const double h_3_suck = std::max (h_3, h + pressure_end);\n      S = matrix_to_biopore (K_xx, M_c, r_c, h, h_3_suck)\n        * geo.fraction_in_z_interval (c, height_start, height_end);\n    }\n  else \n    S = 0.0;\n  return S;\n}\n\nvoid\nBioporeDrain::update_matrix_sink (const Geometry& geo,    \n                                  const Soil& soil,  \n                                  const SoilHeat& soil_heat, \n                                  const std::vector<bool>& active,\n                                  const double h_barrier,\n                                  const double pressure_initiate,\n                                  const double pressure_end,\n                                  const std::vector<double>& h, \n                                  const double \/* dt *\/)\n{\n  const size_t cell_size = geo.cell_size ();\n  for (size_t c = 0; c < cell_size; c++)\n    {\n      const double h_cond = std::min(pressure_initiate, h[c]);\n      const double T = soil_heat.T (c);\n      const double h_ice = 0.0;    \/\/ice ignored \n      const double K_zz = soil.K (c, h_cond, h_ice, T);\n      const double K_xx = K_zz * soil.anisotropy (c);\n      S[c] = matrix_biopore_drain (c, geo, soil, active[c], h_barrier, \n                                   pressure_end, K_xx, h[c]);\n    }\n}\n\ntemplate <class T>\nstd::string stringify (const T& x)\n{\n  std::ostringstream tmp;\n  tmp << x;\n  return tmp.str ();\n}\n\n#define TREELOG_INDEX(msg, key, index) \\\n  Treelog::Open nest (msg, stringify (key) + \" = \" + stringify (index))\n\n#define TREELOG_MODEL1(msg) \\\n  Treelog::Open nest (msg, this->library_id () + \": \" + this->name \\\n                      + \" \" + __FUNCTION__)\n\n#if 0\nvoid \nBioporeDrain::matrix_solute (const Geometry& geo, const double dt, \n                             const Chemical& chemical, \n                             std::vector<double>& source_chem,\n                             Treelog& msg)\n{\n  TREELOG_MODEL1 (msg);\n  const symbol chem = chemical.name;\n  const size_t cell_size = geo.cell_size ();\n  daisy_assert (source_chem.size () == cell_size);\n  \n  \/\/ From matrix to biopore.\n  for (size_t c = 0; c < cell_size; c++)\n    {\n      TREELOG_INDEX (msg, \"cell\", c);\n      const double water_sink = S[c]; \/\/ [cm^3 W\/cm^3 S\/h]\n      daisy_assert (water_sink >= 0.0);\n      const double C = chemical.C_secondary (c); \/\/ [g\/cm^3 W]\n      source_chem[c] -= water_sink * C; \/\/ [g\/cm^3 S\/h]\n      if (!iszero (source_chem[c]))\n        {\n          std::stringstream tmp;\n          tmp << \"soruce_chem = \" << source_chem[c] << \", S = \" << S[c] \n              << \", C = \" << C;\n          msg.message (tmp.str ());\n        }\n    }\n\n}\n#endif\n\nBioporeDrain::BioporeDrain (Block& al)\n  : Biopore (al),\n    pipe_position (al.number (\"pipe_position\", 42.42e42))\n{ }\n\nstatic struct BioporeDrainSyntax\n{\n  static Model& make (Block& al)\n  { return *new BioporeDrain (al); }\n\n  BioporeDrainSyntax ()\n  { \n    Syntax& syntax = *new Syntax ();\n    AttributeList& alist = *new AttributeList ();\n    alist.add (\"description\", \"Biopores that ends in the drain pipes.\");\n    Biopore::load_base (syntax, alist);\n\n    syntax.add (\"pipe_position\", \"cm\", Check::negative (), Syntax::Const,\n                \"Height pipes are placed in the soil (a negative number).\\n\\\nBy default, use the height specified for pipes in the column.\");\n    Librarian::add_type (Biopore::component, \"drain\", alist, syntax, &make);\n  }\n} BioporeDrain_syntax;\n\n\/\/ biopore_drain.C ends here.\n<commit_msg><commit_after>\/\/ biopore_drain.C --- Static vertical biopores that ends in drain pipes.\n\/\/ \n\/\/ Copyright 2008 Per Abrahamsen and KU.\n\/\/\n\/\/ This file is part of Daisy.\n\/\/ \n\/\/ Daisy is free software; you can redistribute it and\/or modify\n\/\/ the Free Software Foundation; either version 2.1 of the License, or\n\/\/ (at your option) any later version.\n\/\/ \n\/\/ Daisy is distributed in the hope that it 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 Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Lesser Public License\n\/\/ along with Daisy; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\n#define BUILD_DLL\n\n#include \"biopore.h\"\n#include \"block.h\"\n#include \"vcheck.h\"\n#include \"librarian.h\"\n#include \"submodeler.h\"\n#include \"check.h\"\n#include \"geometry.h\"\n#include \"soil.h\"\n#include \"soil_heat.h\"\n#include \"anystate.h\"\n#include \"chemical.h\"\n#include \"groundwater.h\"\n#include <sstream>\n\n\/\/ The 'drain' model.\n\nstruct BioporeDrain : public Biopore\n{\n  \/\/ Parameters.\n  \/* const *\/ double pipe_position;   \/\/ [cm]\n\n  \/\/ State\n  Anystate get_state () const\n  { return Anystate::none (); }\n  void set_state (const Anystate&)\n  { }\n\n  \/\/ Simulation.\n  double total_water () const\n  { return 0.0; }\n  void get_solute (IM&) const\n  { }\n  double air_bottom (size_t) const    \/\/ Lowest point with air [cm]\n  { return pipe_position; }\n  \n  double capacity (const Geometry& geo, size_t e, const double dt) const\n  { return max_infiltration_rate (geo, e) * dt; }\n  void infiltrate (const Geometry&, size_t, double \/* [cm] *\/)\n  { }\n\n  double matrix_biopore_drain (size_t c, const Geometry& geo, \n                               const Soil& soil, bool active, \n                               const double h_barrier, double pressure_end,\n                               double K_xx, double h) const;\n  void update_matrix_sink (const Geometry& geo,    \n                           const Soil& soil,  \n                           const SoilHeat& soil_heat, \n                           const std::vector<bool>& active,\n                           const double h_barrier,\n                           const double pressure_initiate,\n                           const double pressure_end,\n                           const std::vector<double>& h, const double dt);\n  void update_water ()\n  { }\n  void add_to_sink (std::vector<double>&,\n                    std::vector<double>& S_drain) const\n  {\n    const size_t cell_size = S.size ();\n    daisy_assert (S_drain.size () == cell_size);\n    for (size_t c = 0; c < cell_size; c++)\n      S_drain[c] += S[c];\n  }\n  void add_solute (symbol, size_t, const double)\n  { }\n  void matrix_solute (const Geometry&, const double, \n                      const Chemical&, std::vector<double>&,\n                      Treelog&)\n  { \/* Handled by S_drain. *\/ }\n  void output (Log& log) const\n  { output_base (log); }\n\n  \/\/ Create and Destroy.\n  bool initialize (const Units& units, const Geometry& geo, const Scope& scope,\n                   const Groundwater& groundwater, Treelog& msg)\n  {\n    bool ok = initialize_base (units, geo, scope, msg); \n    if (pipe_position > 0)\n      {\n        if (groundwater.is_pipe ())\n          \/\/ Pipe height not specified here, use value from column.\n          pipe_position = groundwater.pipe_height ();\n        else\n          {\n            msg.error (\"Unknown pipe position\");\n            ok = false;\n          }\n      }\n    return ok;\n  }\n  bool check (const Geometry& geo, Treelog& msg) const\n  { return check_base (geo, msg); }\n  BioporeDrain (Block& al);\n};\n\ndouble \nBioporeDrain::matrix_biopore_drain (size_t c, const Geometry& geo, \n                                    const Soil& soil, bool active, \n                                    const double h_barrier, \n                                    const double pressure_end,\n                                    double K_xx, double h) const\n{\n  const double M_c = density_cell[c];\n  if (!std::isnormal (M_c))\n    \/\/ No biopores here.\n    return 0.0;\n  const double r_c = diameter \/ 2.0;\n  const double h_3 = air_bottom (c) - geo.cell_z (c);\n\n  double S;\n  if (active && h>h_3 + h_barrier)\n    {\n      \/\/ The largest pressure gradient between the domains are\n      \/\/ pressure_end, above that we claim air will disrupt the suction.\n      const double h_3_suck = std::max (h_3, h + pressure_end);\n      \n      S = matrix_to_biopore (K_xx, M_c, r_c, h, h_3_suck)\n        * geo.fraction_in_z_interval (c, height_start, height_end);\n    }\n  else \n    S = 0.0;\n  return S;\n}\n\nvoid\nBioporeDrain::update_matrix_sink (const Geometry& geo,    \n                                  const Soil& soil,  \n                                  const SoilHeat& soil_heat, \n                                  const std::vector<bool>& active,\n                                  const double h_barrier,\n                                  const double pressure_initiate,\n                                  const double pressure_end,\n                                  const std::vector<double>& h, \n                                  const double \/* dt *\/)\n{\n  const size_t cell_size = geo.cell_size ();\n  for (size_t c = 0; c < cell_size; c++)\n    {\n      const double h_cond = std::min(pressure_initiate, h[c]);\n      const double T = soil_heat.T (c);\n      const double h_ice = 0.0;    \/\/ice ignored \n      const double K_zz = soil.K (c, h_cond, h_ice, T);\n      const double K_xx = K_zz * soil.anisotropy (c);\n      S[c] = matrix_biopore_drain (c, geo, soil, active[c], h_barrier, \n                                   pressure_end, K_xx, h[c]);\n    }\n}\n\ntemplate <class T>\nstd::string stringify (const T& x)\n{\n  std::ostringstream tmp;\n  tmp << x;\n  return tmp.str ();\n}\n\n#define TREELOG_INDEX(msg, key, index) \\\n  Treelog::Open nest (msg, stringify (key) + \" = \" + stringify (index))\n\n#define TREELOG_MODEL1(msg) \\\n  Treelog::Open nest (msg, this->library_id () + \": \" + this->name \\\n                      + \" \" + __FUNCTION__)\n\n#if 0\nvoid \nBioporeDrain::matrix_solute (const Geometry& geo, const double dt, \n                             const Chemical& chemical, \n                             std::vector<double>& source_chem,\n                             Treelog& msg)\n{\n  TREELOG_MODEL1 (msg);\n  const symbol chem = chemical.name;\n  const size_t cell_size = geo.cell_size ();\n  daisy_assert (source_chem.size () == cell_size);\n  \n  \/\/ From matrix to biopore.\n  for (size_t c = 0; c < cell_size; c++)\n    {\n      TREELOG_INDEX (msg, \"cell\", c);\n      const double water_sink = S[c]; \/\/ [cm^3 W\/cm^3 S\/h]\n      daisy_assert (water_sink >= 0.0);\n      const double C = chemical.C_secondary (c); \/\/ [g\/cm^3 W]\n      source_chem[c] -= water_sink * C; \/\/ [g\/cm^3 S\/h]\n      if (!iszero (source_chem[c]))\n        {\n          std::stringstream tmp;\n          tmp << \"soruce_chem = \" << source_chem[c] << \", S = \" << S[c] \n              << \", C = \" << C;\n          msg.message (tmp.str ());\n        }\n    }\n\n}\n#endif\n\nBioporeDrain::BioporeDrain (Block& al)\n  : Biopore (al),\n    pipe_position (al.number (\"pipe_position\", 42.42e42))\n{ }\n\nstatic struct BioporeDrainSyntax\n{\n  static Model& make (Block& al)\n  { return *new BioporeDrain (al); }\n\n  BioporeDrainSyntax ()\n  { \n    Syntax& syntax = *new Syntax ();\n    AttributeList& alist = *new AttributeList ();\n    alist.add (\"description\", \"Biopores that ends in the drain pipes.\");\n    Biopore::load_base (syntax, alist);\n\n    syntax.add (\"pipe_position\", \"cm\", Check::negative (), Syntax::Const,\n                \"Height pipes are placed in the soil (a negative number).\\n\\\nBy default, use the height specified for pipes in the column.\");\n    Librarian::add_type (Biopore::component, \"drain\", alist, syntax, &make);\n  }\n} BioporeDrain_syntax;\n\n\/\/ biopore_drain.C ends here.\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 \"extensions\/browser\/api\/device_permissions_prompt.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/scoped_observer.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"device\/core\/device_client.h\"\n#include \"device\/hid\/hid_device_filter.h\"\n#include \"device\/hid\/hid_device_info.h\"\n#include \"device\/hid\/hid_service.h\"\n#include \"device\/usb\/usb_device.h\"\n#include \"device\/usb\/usb_device_filter.h\"\n#include \"device\/usb\/usb_ids.h\"\n#include \"device\/usb\/usb_service.h\"\n#include \"extensions\/browser\/api\/device_permissions_manager.h\"\n#include \"extensions\/common\/extension.h\"\n#include \"extensions\/strings\/grit\/extensions_strings.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n\n#if defined(OS_CHROMEOS)\n#include \"chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chromeos\/dbus\/permission_broker_client.h\"\n#endif  \/\/ defined(OS_CHROMEOS)\n\nusing device::HidDeviceFilter;\nusing device::HidService;\nusing device::UsbDevice;\nusing device::UsbDeviceFilter;\nusing device::UsbService;\n\nnamespace extensions {\n\nnamespace {\n\nclass UsbDeviceInfo : public DevicePermissionsPrompt::Prompt::DeviceInfo {\n public:\n  UsbDeviceInfo(scoped_refptr<UsbDevice> device) : device_(device) {\n    name_ = DevicePermissionsManager::GetPermissionMessage(\n        device->vendor_id(), device->product_id(),\n        device->manufacturer_string(), device->product_string(),\n        base::string16(),  \/\/ Serial number is displayed separately.\n        true);\n    serial_number_ = device->serial_number();\n  }\n\n  ~UsbDeviceInfo() override {}\n\n  const scoped_refptr<UsbDevice>& device() const { return device_; }\n\n private:\n  \/\/ TODO(reillyg): Convert this to a weak reference when UsbDevice has a\n  \/\/ connected flag.\n  scoped_refptr<UsbDevice> device_;\n};\n\nclass UsbDevicePermissionsPrompt : public DevicePermissionsPrompt::Prompt,\n                                   public device::UsbService::Observer {\n public:\n  UsbDevicePermissionsPrompt(\n      const Extension* extension,\n      content::BrowserContext* context,\n      bool multiple,\n      const std::vector<UsbDeviceFilter>& filters,\n      const DevicePermissionsPrompt::UsbDevicesCallback& callback)\n      : Prompt(extension, context, multiple),\n        filters_(filters),\n        callback_(callback),\n        service_observer_(this) {}\n\n private:\n  ~UsbDevicePermissionsPrompt() override {}\n\n  \/\/ DevicePermissionsPrompt::Prompt implementation:\n  void SetObserver(\n      DevicePermissionsPrompt::Prompt::Observer* observer) override {\n    DevicePermissionsPrompt::Prompt::SetObserver(observer);\n\n    if (observer) {\n      UsbService* service = device::DeviceClient::Get()->GetUsbService();\n      if (service && !service_observer_.IsObserving(service)) {\n        service->GetDevices(\n            base::Bind(&UsbDevicePermissionsPrompt::OnDevicesEnumerated, this));\n        service_observer_.Add(service);\n      }\n    }\n  }\n\n  base::string16 GetHeading() const override {\n    return l10n_util::GetStringUTF16(\n        multiple() ? IDS_USB_DEVICE_PERMISSIONS_PROMPT_TITLE_MULTIPLE\n                   : IDS_USB_DEVICE_PERMISSIONS_PROMPT_TITLE_SINGLE);\n  }\n\n  void Dismissed() override {\n    DevicePermissionsManager* permissions_manager =\n        DevicePermissionsManager::Get(browser_context());\n    std::vector<scoped_refptr<UsbDevice>> devices;\n    for (const DeviceInfo* device : devices_) {\n      if (device->granted()) {\n        const UsbDeviceInfo* usb_device =\n            static_cast<const UsbDeviceInfo*>(device);\n        devices.push_back(usb_device->device());\n        if (permissions_manager) {\n          permissions_manager->AllowUsbDevice(extension()->id(),\n                                              usb_device->device());\n        }\n      }\n    }\n    DCHECK(multiple() || devices.size() <= 1);\n    callback_.Run(devices);\n    callback_.Reset();\n  }\n\n  \/\/ device::UsbService::Observer implementation:\n  void OnDeviceAdded(scoped_refptr<UsbDevice> device) override {\n    if (!(filters_.empty() || UsbDeviceFilter::MatchesAny(device, filters_))) {\n      return;\n    }\n\n    scoped_ptr<DeviceInfo> device_info(new UsbDeviceInfo(device));\n    device->CheckUsbAccess(\n        base::Bind(&UsbDevicePermissionsPrompt::AddCheckedDevice, this,\n                   base::Passed(&device_info)));\n  }\n\n  void OnDeviceRemoved(scoped_refptr<UsbDevice> device) override {\n    for (auto it = devices_.begin(); it != devices_.end(); ++it) {\n      const UsbDeviceInfo* entry = static_cast<const UsbDeviceInfo*>(*it);\n      if (entry->device() == device) {\n        devices_.erase(it);\n        if (observer()) {\n          observer()->OnDevicesChanged();\n        }\n        return;\n      }\n    }\n  }\n\n  void OnDevicesEnumerated(\n      const std::vector<scoped_refptr<UsbDevice>>& devices) {\n    for (const auto& device : devices) {\n      OnDeviceAdded(device);\n    }\n  }\n\n  std::vector<UsbDeviceFilter> filters_;\n  DevicePermissionsPrompt::UsbDevicesCallback callback_;\n  ScopedObserver<UsbService, UsbService::Observer> service_observer_;\n};\n\nclass HidDeviceInfo : public DevicePermissionsPrompt::Prompt::DeviceInfo {\n public:\n  HidDeviceInfo(scoped_refptr<device::HidDeviceInfo> device) : device_(device) {\n    name_ = DevicePermissionsManager::GetPermissionMessage(\n        device->vendor_id(), device->product_id(),\n        base::string16(),  \/\/ HID devices include manufacturer in product name.\n        base::UTF8ToUTF16(device->product_name()),\n        base::string16(),  \/\/ Serial number is displayed separately.\n        false);\n    serial_number_ = base::UTF8ToUTF16(device->serial_number());\n  }\n\n  ~HidDeviceInfo() override {}\n\n  const scoped_refptr<device::HidDeviceInfo>& device() const { return device_; }\n\n private:\n  scoped_refptr<device::HidDeviceInfo> device_;\n};\n\nclass HidDevicePermissionsPrompt : public DevicePermissionsPrompt::Prompt,\n                                   public device::HidService::Observer {\n public:\n  HidDevicePermissionsPrompt(\n      const Extension* extension,\n      content::BrowserContext* context,\n      bool multiple,\n      const std::vector<HidDeviceFilter>& filters,\n      const DevicePermissionsPrompt::HidDevicesCallback& callback)\n      : Prompt(extension, context, multiple),\n        filters_(filters),\n        callback_(callback),\n        service_observer_(this) {}\n\n private:\n  ~HidDevicePermissionsPrompt() override {}\n\n  \/\/ DevicePermissionsPrompt::Prompt implementation:\n  void SetObserver(\n      DevicePermissionsPrompt::Prompt::Observer* observer) override {\n    DevicePermissionsPrompt::Prompt::SetObserver(observer);\n\n    if (observer) {\n      HidService* service = device::DeviceClient::Get()->GetHidService();\n      if (service && !service_observer_.IsObserving(service)) {\n        service->GetDevices(\n            base::Bind(&HidDevicePermissionsPrompt::OnDevicesEnumerated, this));\n        service_observer_.Add(service);\n      }\n    }\n  }\n\n  base::string16 GetHeading() const override {\n    return l10n_util::GetStringUTF16(\n        multiple() ? IDS_HID_DEVICE_PERMISSIONS_PROMPT_TITLE_MULTIPLE\n                   : IDS_HID_DEVICE_PERMISSIONS_PROMPT_TITLE_SINGLE);\n  }\n\n  void Dismissed() override {\n    DevicePermissionsManager* permissions_manager =\n        DevicePermissionsManager::Get(browser_context());\n    std::vector<scoped_refptr<device::HidDeviceInfo>> devices;\n    for (const DeviceInfo* device : devices_) {\n      if (device->granted()) {\n        const HidDeviceInfo* hid_device =\n            static_cast<const HidDeviceInfo*>(device);\n        devices.push_back(hid_device->device());\n        if (permissions_manager) {\n          permissions_manager->AllowHidDevice(extension()->id(),\n                                              hid_device->device());\n        }\n      }\n    }\n    DCHECK(multiple() || devices.size() <= 1);\n    callback_.Run(devices);\n    callback_.Reset();\n  }\n\n  \/\/ device::HidService::Observer implementation:\n  void OnDeviceAdded(scoped_refptr<device::HidDeviceInfo> device) override {\n    if (HasUnprotectedCollections(device) &&\n        (filters_.empty() || HidDeviceFilter::MatchesAny(device, filters_))) {\n      scoped_ptr<DeviceInfo> device_info(new HidDeviceInfo(device));\n#if defined(OS_CHROMEOS)\n      chromeos::PermissionBrokerClient* client =\n          chromeos::DBusThreadManager::Get()->GetPermissionBrokerClient();\n      DCHECK(client) << \"Could not get permission broker client.\";\n      client->CheckPathAccess(\n          device->device_id(),\n          base::Bind(&HidDevicePermissionsPrompt::AddCheckedDevice, this,\n                     base::Passed(&device_info)));\n#else\n      AddCheckedDevice(device_info.Pass(), true);\n#endif  \/\/ defined(OS_CHROMEOS)\n    }\n  }\n\n  void OnDeviceRemoved(scoped_refptr<device::HidDeviceInfo> device) override {\n    for (auto it = devices_.begin(); it != devices_.end(); ++it) {\n      const HidDeviceInfo* entry = static_cast<const HidDeviceInfo*>(*it);\n      if (entry->device() == device) {\n        devices_.erase(it);\n        if (observer()) {\n          observer()->OnDevicesChanged();\n        }\n        return;\n      }\n    }\n  }\n\n  void OnDevicesEnumerated(\n      const std::vector<scoped_refptr<device::HidDeviceInfo>>& devices) {\n    for (const auto& device : devices) {\n      OnDeviceAdded(device);\n    }\n  }\n\n  bool HasUnprotectedCollections(scoped_refptr<device::HidDeviceInfo> device) {\n    for (const auto& collection : device->collections()) {\n      if (!collection.usage.IsProtected()) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  std::vector<HidDeviceFilter> filters_;\n  DevicePermissionsPrompt::HidDevicesCallback callback_;\n  ScopedObserver<HidService, HidService::Observer> service_observer_;\n};\n\n}  \/\/ namespace\n\nDevicePermissionsPrompt::Prompt::DeviceInfo::DeviceInfo() {\n}\n\nDevicePermissionsPrompt::Prompt::DeviceInfo::~DeviceInfo() {\n}\n\nDevicePermissionsPrompt::Prompt::Observer::~Observer() {\n}\n\nDevicePermissionsPrompt::Prompt::Prompt(const Extension* extension,\n                                        content::BrowserContext* context,\n                                        bool multiple)\n    : extension_(extension), browser_context_(context), multiple_(multiple) {\n}\n\nvoid DevicePermissionsPrompt::Prompt::SetObserver(Observer* observer) {\n  observer_ = observer;\n}\n\nbase::string16 DevicePermissionsPrompt::Prompt::GetPromptMessage() const {\n  return l10n_util::GetStringFUTF16(multiple_\n                                        ? IDS_DEVICE_PERMISSIONS_PROMPT_MULTIPLE\n                                        : IDS_DEVICE_PERMISSIONS_PROMPT_SINGLE,\n                                    base::UTF8ToUTF16(extension_->name()));\n}\n\nbase::string16 DevicePermissionsPrompt::Prompt::GetDeviceName(\n    size_t index) const {\n  DCHECK_LT(index, devices_.size());\n  return devices_[index]->name();\n}\n\nbase::string16 DevicePermissionsPrompt::Prompt::GetDeviceSerialNumber(\n    size_t index) const {\n  DCHECK_LT(index, devices_.size());\n  return devices_[index]->serial_number();\n}\n\nvoid DevicePermissionsPrompt::Prompt::GrantDevicePermission(size_t index) {\n  DCHECK_LT(index, devices_.size());\n  devices_[index]->set_granted();\n}\n\nDevicePermissionsPrompt::Prompt::~Prompt() {\n}\n\nvoid DevicePermissionsPrompt::Prompt::AddCheckedDevice(\n    scoped_ptr<DeviceInfo> device,\n    bool allowed) {\n  if (allowed) {\n    devices_.push_back(device.Pass());\n    if (observer_) {\n      observer_->OnDevicesChanged();\n    }\n  }\n}\n\nDevicePermissionsPrompt::DevicePermissionsPrompt(\n    content::WebContents* web_contents)\n    : web_contents_(web_contents) {\n}\n\nDevicePermissionsPrompt::~DevicePermissionsPrompt() {\n}\n\nvoid DevicePermissionsPrompt::AskForUsbDevices(\n    const Extension* extension,\n    content::BrowserContext* context,\n    bool multiple,\n    const std::vector<UsbDeviceFilter>& filters,\n    const UsbDevicesCallback& callback) {\n  prompt_ = new UsbDevicePermissionsPrompt(extension, context, multiple,\n                                           filters, callback);\n  ShowDialog();\n}\n\nvoid DevicePermissionsPrompt::AskForHidDevices(\n    const Extension* extension,\n    content::BrowserContext* context,\n    bool multiple,\n    const std::vector<HidDeviceFilter>& filters,\n    const HidDevicesCallback& callback) {\n  prompt_ = new HidDevicePermissionsPrompt(extension, context, multiple,\n                                           filters, callback);\n  ShowDialog();\n}\n\n}  \/\/ namespace extensions\n<commit_msg>Check HID access by device node path instead of sysfs path.<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 \"extensions\/browser\/api\/device_permissions_prompt.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/scoped_observer.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"device\/core\/device_client.h\"\n#include \"device\/hid\/hid_device_filter.h\"\n#include \"device\/hid\/hid_device_info.h\"\n#include \"device\/hid\/hid_service.h\"\n#include \"device\/usb\/usb_device.h\"\n#include \"device\/usb\/usb_device_filter.h\"\n#include \"device\/usb\/usb_ids.h\"\n#include \"device\/usb\/usb_service.h\"\n#include \"extensions\/browser\/api\/device_permissions_manager.h\"\n#include \"extensions\/common\/extension.h\"\n#include \"extensions\/strings\/grit\/extensions_strings.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n\n#if defined(OS_CHROMEOS)\n#include \"chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chromeos\/dbus\/permission_broker_client.h\"\n#include \"device\/hid\/hid_device_info_linux.h\"\n#endif  \/\/ defined(OS_CHROMEOS)\n\nusing device::HidDeviceFilter;\nusing device::HidService;\nusing device::UsbDevice;\nusing device::UsbDeviceFilter;\nusing device::UsbService;\n\nnamespace extensions {\n\nnamespace {\n\nclass UsbDeviceInfo : public DevicePermissionsPrompt::Prompt::DeviceInfo {\n public:\n  UsbDeviceInfo(scoped_refptr<UsbDevice> device) : device_(device) {\n    name_ = DevicePermissionsManager::GetPermissionMessage(\n        device->vendor_id(), device->product_id(),\n        device->manufacturer_string(), device->product_string(),\n        base::string16(),  \/\/ Serial number is displayed separately.\n        true);\n    serial_number_ = device->serial_number();\n  }\n\n  ~UsbDeviceInfo() override {}\n\n  const scoped_refptr<UsbDevice>& device() const { return device_; }\n\n private:\n  \/\/ TODO(reillyg): Convert this to a weak reference when UsbDevice has a\n  \/\/ connected flag.\n  scoped_refptr<UsbDevice> device_;\n};\n\nclass UsbDevicePermissionsPrompt : public DevicePermissionsPrompt::Prompt,\n                                   public device::UsbService::Observer {\n public:\n  UsbDevicePermissionsPrompt(\n      const Extension* extension,\n      content::BrowserContext* context,\n      bool multiple,\n      const std::vector<UsbDeviceFilter>& filters,\n      const DevicePermissionsPrompt::UsbDevicesCallback& callback)\n      : Prompt(extension, context, multiple),\n        filters_(filters),\n        callback_(callback),\n        service_observer_(this) {}\n\n private:\n  ~UsbDevicePermissionsPrompt() override {}\n\n  \/\/ DevicePermissionsPrompt::Prompt implementation:\n  void SetObserver(\n      DevicePermissionsPrompt::Prompt::Observer* observer) override {\n    DevicePermissionsPrompt::Prompt::SetObserver(observer);\n\n    if (observer) {\n      UsbService* service = device::DeviceClient::Get()->GetUsbService();\n      if (service && !service_observer_.IsObserving(service)) {\n        service->GetDevices(\n            base::Bind(&UsbDevicePermissionsPrompt::OnDevicesEnumerated, this));\n        service_observer_.Add(service);\n      }\n    }\n  }\n\n  base::string16 GetHeading() const override {\n    return l10n_util::GetStringUTF16(\n        multiple() ? IDS_USB_DEVICE_PERMISSIONS_PROMPT_TITLE_MULTIPLE\n                   : IDS_USB_DEVICE_PERMISSIONS_PROMPT_TITLE_SINGLE);\n  }\n\n  void Dismissed() override {\n    DevicePermissionsManager* permissions_manager =\n        DevicePermissionsManager::Get(browser_context());\n    std::vector<scoped_refptr<UsbDevice>> devices;\n    for (const DeviceInfo* device : devices_) {\n      if (device->granted()) {\n        const UsbDeviceInfo* usb_device =\n            static_cast<const UsbDeviceInfo*>(device);\n        devices.push_back(usb_device->device());\n        if (permissions_manager) {\n          permissions_manager->AllowUsbDevice(extension()->id(),\n                                              usb_device->device());\n        }\n      }\n    }\n    DCHECK(multiple() || devices.size() <= 1);\n    callback_.Run(devices);\n    callback_.Reset();\n  }\n\n  \/\/ device::UsbService::Observer implementation:\n  void OnDeviceAdded(scoped_refptr<UsbDevice> device) override {\n    if (!(filters_.empty() || UsbDeviceFilter::MatchesAny(device, filters_))) {\n      return;\n    }\n\n    scoped_ptr<DeviceInfo> device_info(new UsbDeviceInfo(device));\n    device->CheckUsbAccess(\n        base::Bind(&UsbDevicePermissionsPrompt::AddCheckedDevice, this,\n                   base::Passed(&device_info)));\n  }\n\n  void OnDeviceRemoved(scoped_refptr<UsbDevice> device) override {\n    for (auto it = devices_.begin(); it != devices_.end(); ++it) {\n      const UsbDeviceInfo* entry = static_cast<const UsbDeviceInfo*>(*it);\n      if (entry->device() == device) {\n        devices_.erase(it);\n        if (observer()) {\n          observer()->OnDevicesChanged();\n        }\n        return;\n      }\n    }\n  }\n\n  void OnDevicesEnumerated(\n      const std::vector<scoped_refptr<UsbDevice>>& devices) {\n    for (const auto& device : devices) {\n      OnDeviceAdded(device);\n    }\n  }\n\n  std::vector<UsbDeviceFilter> filters_;\n  DevicePermissionsPrompt::UsbDevicesCallback callback_;\n  ScopedObserver<UsbService, UsbService::Observer> service_observer_;\n};\n\nclass HidDeviceInfo : public DevicePermissionsPrompt::Prompt::DeviceInfo {\n public:\n  HidDeviceInfo(scoped_refptr<device::HidDeviceInfo> device) : device_(device) {\n    name_ = DevicePermissionsManager::GetPermissionMessage(\n        device->vendor_id(), device->product_id(),\n        base::string16(),  \/\/ HID devices include manufacturer in product name.\n        base::UTF8ToUTF16(device->product_name()),\n        base::string16(),  \/\/ Serial number is displayed separately.\n        false);\n    serial_number_ = base::UTF8ToUTF16(device->serial_number());\n  }\n\n  ~HidDeviceInfo() override {}\n\n  const scoped_refptr<device::HidDeviceInfo>& device() const { return device_; }\n\n private:\n  scoped_refptr<device::HidDeviceInfo> device_;\n};\n\nclass HidDevicePermissionsPrompt : public DevicePermissionsPrompt::Prompt,\n                                   public device::HidService::Observer {\n public:\n  HidDevicePermissionsPrompt(\n      const Extension* extension,\n      content::BrowserContext* context,\n      bool multiple,\n      const std::vector<HidDeviceFilter>& filters,\n      const DevicePermissionsPrompt::HidDevicesCallback& callback)\n      : Prompt(extension, context, multiple),\n        filters_(filters),\n        callback_(callback),\n        service_observer_(this) {}\n\n private:\n  ~HidDevicePermissionsPrompt() override {}\n\n  \/\/ DevicePermissionsPrompt::Prompt implementation:\n  void SetObserver(\n      DevicePermissionsPrompt::Prompt::Observer* observer) override {\n    DevicePermissionsPrompt::Prompt::SetObserver(observer);\n\n    if (observer) {\n      HidService* service = device::DeviceClient::Get()->GetHidService();\n      if (service && !service_observer_.IsObserving(service)) {\n        service->GetDevices(\n            base::Bind(&HidDevicePermissionsPrompt::OnDevicesEnumerated, this));\n        service_observer_.Add(service);\n      }\n    }\n  }\n\n  base::string16 GetHeading() const override {\n    return l10n_util::GetStringUTF16(\n        multiple() ? IDS_HID_DEVICE_PERMISSIONS_PROMPT_TITLE_MULTIPLE\n                   : IDS_HID_DEVICE_PERMISSIONS_PROMPT_TITLE_SINGLE);\n  }\n\n  void Dismissed() override {\n    DevicePermissionsManager* permissions_manager =\n        DevicePermissionsManager::Get(browser_context());\n    std::vector<scoped_refptr<device::HidDeviceInfo>> devices;\n    for (const DeviceInfo* device : devices_) {\n      if (device->granted()) {\n        const HidDeviceInfo* hid_device =\n            static_cast<const HidDeviceInfo*>(device);\n        devices.push_back(hid_device->device());\n        if (permissions_manager) {\n          permissions_manager->AllowHidDevice(extension()->id(),\n                                              hid_device->device());\n        }\n      }\n    }\n    DCHECK(multiple() || devices.size() <= 1);\n    callback_.Run(devices);\n    callback_.Reset();\n  }\n\n  \/\/ device::HidService::Observer implementation:\n  void OnDeviceAdded(scoped_refptr<device::HidDeviceInfo> device) override {\n    if (HasUnprotectedCollections(device) &&\n        (filters_.empty() || HidDeviceFilter::MatchesAny(device, filters_))) {\n      scoped_ptr<DeviceInfo> device_info(new HidDeviceInfo(device));\n#if defined(OS_CHROMEOS)\n      chromeos::PermissionBrokerClient* client =\n          chromeos::DBusThreadManager::Get()->GetPermissionBrokerClient();\n      DCHECK(client) << \"Could not get permission broker client.\";\n      device::HidDeviceInfoLinux* linux_device_info =\n          static_cast<device::HidDeviceInfoLinux*>(device.get());\n      client->CheckPathAccess(\n          linux_device_info->device_node(),\n          base::Bind(&HidDevicePermissionsPrompt::AddCheckedDevice, this,\n                     base::Passed(&device_info)));\n#else\n      AddCheckedDevice(device_info.Pass(), true);\n#endif  \/\/ defined(OS_CHROMEOS)\n    }\n  }\n\n  void OnDeviceRemoved(scoped_refptr<device::HidDeviceInfo> device) override {\n    for (auto it = devices_.begin(); it != devices_.end(); ++it) {\n      const HidDeviceInfo* entry = static_cast<const HidDeviceInfo*>(*it);\n      if (entry->device() == device) {\n        devices_.erase(it);\n        if (observer()) {\n          observer()->OnDevicesChanged();\n        }\n        return;\n      }\n    }\n  }\n\n  void OnDevicesEnumerated(\n      const std::vector<scoped_refptr<device::HidDeviceInfo>>& devices) {\n    for (const auto& device : devices) {\n      OnDeviceAdded(device);\n    }\n  }\n\n  bool HasUnprotectedCollections(scoped_refptr<device::HidDeviceInfo> device) {\n    for (const auto& collection : device->collections()) {\n      if (!collection.usage.IsProtected()) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  std::vector<HidDeviceFilter> filters_;\n  DevicePermissionsPrompt::HidDevicesCallback callback_;\n  ScopedObserver<HidService, HidService::Observer> service_observer_;\n};\n\n}  \/\/ namespace\n\nDevicePermissionsPrompt::Prompt::DeviceInfo::DeviceInfo() {\n}\n\nDevicePermissionsPrompt::Prompt::DeviceInfo::~DeviceInfo() {\n}\n\nDevicePermissionsPrompt::Prompt::Observer::~Observer() {\n}\n\nDevicePermissionsPrompt::Prompt::Prompt(const Extension* extension,\n                                        content::BrowserContext* context,\n                                        bool multiple)\n    : extension_(extension), browser_context_(context), multiple_(multiple) {\n}\n\nvoid DevicePermissionsPrompt::Prompt::SetObserver(Observer* observer) {\n  observer_ = observer;\n}\n\nbase::string16 DevicePermissionsPrompt::Prompt::GetPromptMessage() const {\n  return l10n_util::GetStringFUTF16(multiple_\n                                        ? IDS_DEVICE_PERMISSIONS_PROMPT_MULTIPLE\n                                        : IDS_DEVICE_PERMISSIONS_PROMPT_SINGLE,\n                                    base::UTF8ToUTF16(extension_->name()));\n}\n\nbase::string16 DevicePermissionsPrompt::Prompt::GetDeviceName(\n    size_t index) const {\n  DCHECK_LT(index, devices_.size());\n  return devices_[index]->name();\n}\n\nbase::string16 DevicePermissionsPrompt::Prompt::GetDeviceSerialNumber(\n    size_t index) const {\n  DCHECK_LT(index, devices_.size());\n  return devices_[index]->serial_number();\n}\n\nvoid DevicePermissionsPrompt::Prompt::GrantDevicePermission(size_t index) {\n  DCHECK_LT(index, devices_.size());\n  devices_[index]->set_granted();\n}\n\nDevicePermissionsPrompt::Prompt::~Prompt() {\n}\n\nvoid DevicePermissionsPrompt::Prompt::AddCheckedDevice(\n    scoped_ptr<DeviceInfo> device,\n    bool allowed) {\n  if (allowed) {\n    devices_.push_back(device.Pass());\n    if (observer_) {\n      observer_->OnDevicesChanged();\n    }\n  }\n}\n\nDevicePermissionsPrompt::DevicePermissionsPrompt(\n    content::WebContents* web_contents)\n    : web_contents_(web_contents) {\n}\n\nDevicePermissionsPrompt::~DevicePermissionsPrompt() {\n}\n\nvoid DevicePermissionsPrompt::AskForUsbDevices(\n    const Extension* extension,\n    content::BrowserContext* context,\n    bool multiple,\n    const std::vector<UsbDeviceFilter>& filters,\n    const UsbDevicesCallback& callback) {\n  prompt_ = new UsbDevicePermissionsPrompt(extension, context, multiple,\n                                           filters, callback);\n  ShowDialog();\n}\n\nvoid DevicePermissionsPrompt::AskForHidDevices(\n    const Extension* extension,\n    content::BrowserContext* context,\n    bool multiple,\n    const std::vector<HidDeviceFilter>& filters,\n    const HidDevicesCallback& callback) {\n  prompt_ = new HidDevicePermissionsPrompt(extension, context, multiple,\n                                           filters, callback);\n  ShowDialog();\n}\n\n}  \/\/ namespace extensions\n<|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the KDE project\n    Copyright (C) 2004,2006 Matthias Kretz <kretz@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    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 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\n    02110-1301, USA.\n\n*\/\n\n#include \"backendselection.h\"\n\n#include <kservicetypeprofile.h>\n#include <dcopclient.h>\n#include <kservicetypetrader.h>\n#include <ksimpleconfig.h>\n#include <QStringList>\n#include <QListWidgetItem>\n#include <kapplication.h>\n#include <kicon.h>\n#include <QList>\n\nBackendSelection::BackendSelection( QWidget* parent )\n\t: QWidget( parent )\n{\n\tsetupUi( this );\n\n\tconnect( m_select, SIGNAL( itemSelectionChanged() ),\n\t\t\tSLOT( selectionChanged() ) );\n\t\/\/connect( m_website, SIGNAL( leftClickedURL( const QString & ) ),\n\t\t\t\/\/kapp, SLOT( invokeBrowser( const QString & ) ) );\n\tconnect( m_up, SIGNAL( clicked() ), SLOT( up() ) );\n\tconnect( m_down, SIGNAL( clicked() ), SLOT( down() ) );\n}\n\nvoid BackendSelection::load()\n{\n\tm_services.clear();\n\tm_select->clear();\n\tKServiceTypeProfile::clear();\n\n        const KService::List offers = KServiceTypeTrader::self()->query( \"PhononBackend\",\n\t\t\t\"Type == 'Service' and [X-KDE-PhononBackendInfo-InterfaceVersion] == 1\" );\n\t\/\/ the offers are already sorted for preference\n        KService::List::const_iterator it = offers.begin();\n        const KService::List::const_iterator end = offers.end();\n\tfor( ; it != end; ++it )\n\t{\n\t\tKService::Ptr service = *it;\n\t\tm_select->addItem( service->name() );\n\t\tm_services[ service->name() ] = service;\n\t}\n\tm_select->setItemSelected( m_select->item( 0 ), true );\n}\n\nvoid BackendSelection::save()\n{\n\t\/\/ save to profilerc\n\tKSimpleConfig config( \"profilerc\" );\n\tQStringList grouplist = config.groupList();\n\tQStringList::Iterator it = grouplist.begin();\n\tQStringList::Iterator end = grouplist.end();\n\tfor( ; it != end; ++it )\n\t{\n\t\tconfig.setGroup( *it );\n\t\tif( config.readEntry( \"ServiceType\" ) == \"PhononBackend\" )\n\t\t\tconfig.deleteGroup( *it );\n\t}\n\tunsigned int count = m_select->count();\n\tfor( unsigned int i = 0; i < count; ++i )\n\t{\n\t\tQListWidgetItem* item = m_select->item( i );\n\t\tKService::Ptr service = m_services[ item->text() ];\n\t\tconfig.setGroup( \"PhononBackend\" + QString( \" - %1\" ).arg( i ) );\n\t\tconfig.writeEntry( \"AllowAsDefault\", true );\n\t\tconfig.writeEntry( \"Application\", service->storageId() );\n\t\tconfig.writeEntry( \"GenericServiceType\", \"PhononBackend\" );\n\t\tconfig.writeEntry( \"Preference\", count - i );\n\t\tconfig.writeEntry( \"ServiceType\", \"PhononBackend\" );\n\t}\n\tconfig.sync();\n\tKService::rebuildKSycoca( this );\n\n\tkapp->dcopClient()->emitDCOPSignal( \"phononBackendChanged()\", QByteArray() );\n}\n\nvoid BackendSelection::defaults()\n{\n\t\/\/ XXX: hack, I don't know how to get the initalPreference without\n\t\/\/ reading it all manually\n\tKSimpleConfig config( \"profilerc\" );\n\tQStringList grouplist = config.groupList();\n\tQStringList::Iterator it = grouplist.begin();\n\tQStringList::Iterator end = grouplist.end();\n\tQStringList apps;\n\tQList<int> pref;\n\tfor( ; it != end; ++it )\n\t{\n\t\tconfig.setGroup( *it );\n\t\tif( config.readEntry( \"ServiceType\" ) == \"PhononBackend\" )\n\t\t{\n\t\t\tapps.append( config.readEntry( \"Application\" ) );\n\t\t\tpref.append( config.readEntry( \"Preference\", int( 0 ) ) );\n\t\t\tconfig.deleteGroup( *it );\n\t\t}\n\t}\n\tconfig.sync();\n\tload();\n\tfor( int i = 0; i < apps.count(); ++i )\n\t{\n\t\tconfig.setGroup( \"PhononBackend\" + QString( \" - %1\" ).arg( i ) );\n\t\tconfig.writeEntry( \"AllowAsDefault\", true );\n\t\tconfig.writeEntry( \"Application\", apps[ i ] );\n\t\tconfig.writeEntry( \"GenericServiceType\", \"PhononBackend\" );\n\t\tconfig.writeEntry( \"Preference\", pref[ i ] );\n\t\tconfig.writeEntry( \"ServiceType\", \"PhononBackend\" );\n\t}\n\tconfig.sync();\n}\n\nvoid BackendSelection::selectionChanged()\n{\n\tKService::Ptr service;\n\tfor( int i = 0; i < m_select->count(); ++i )\n\t{\n\t\tQListWidgetItem* item = m_select->item( i );\n\t\tif( m_select->isItemSelected( item ) )\n\t\t{\n\t\t\tservice = m_services[ item->text() ];\n\t\t\tbreak;\n\t\t}\n\t}\n\tm_icon->setPixmap( KIcon( service->icon() ).pixmap( 32 ) );\n\tm_name->setText( service->name() );\n\tm_comment->setText( service->comment() );\n\tm_website->setText( service->property( \"X-KDE-PhononBackendInfo-Website\" ).toString() );\n\t\/\/m_website->setURL( m_website->text() );\n\tm_version->setText( service->property( \"X-KDE-PhononBackendInfo-Version\" ).toString() );\n}\n\nvoid BackendSelection::up()\n{\n\tQList<QListWidgetItem*> selectedList = m_select->selectedItems();\n\tforeach( QListWidgetItem* selected, selectedList )\n\t{\n\t\tint row = m_select->row( selected );\n\t\tif( row > 0 )\n\t\t{\n\t\t\tQListWidgetItem* taken = m_select->takeItem( row - 1 );\n\t\t\tm_select->insertItem( row, taken );\n\t\t\temit changed();\n\t\t}\n\t}\n}\n\nvoid BackendSelection::down()\n{\n\tQList<QListWidgetItem*> selectedList = m_select->selectedItems();\n\tforeach( QListWidgetItem* selected, selectedList )\n\t{\n\t\tint row = m_select->row( selected );\n\t\tif( row + 1 < m_select->count() )\n\t\t{\n\t\t\tQListWidgetItem* taken = m_select->takeItem( row + 1 );\n\t\t\tm_select->insertItem( row, taken );\n\t\t\temit changed();\n\t\t}\n\t}\n}\n\n#include \"backendselection.moc\"\n\n\/\/ vim: sw=4 ts=4 noet\n<commit_msg>The progress dialog looks fancy, but there's no need to rebuild ksycoca when profilerc changes, the profile isn't stored in ksycoca. Anyway I'll provide public API for writing to profilerc.<commit_after>\/*  This file is part of the KDE project\n    Copyright (C) 2004,2006 Matthias Kretz <kretz@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    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 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\n    02110-1301, USA.\n\n*\/\n\n#include \"backendselection.h\"\n\n#include <kservicetypeprofile.h>\n#include <dcopclient.h>\n#include <kservicetypetrader.h>\n#include <ksimpleconfig.h>\n#include <QStringList>\n#include <QListWidgetItem>\n#include <kapplication.h>\n#include <kicon.h>\n#include <QList>\n\nBackendSelection::BackendSelection( QWidget* parent )\n\t: QWidget( parent )\n{\n\tsetupUi( this );\n\n\tconnect( m_select, SIGNAL( itemSelectionChanged() ),\n\t\t\tSLOT( selectionChanged() ) );\n\t\/\/connect( m_website, SIGNAL( leftClickedURL( const QString & ) ),\n\t\t\t\/\/kapp, SLOT( invokeBrowser( const QString & ) ) );\n\tconnect( m_up, SIGNAL( clicked() ), SLOT( up() ) );\n\tconnect( m_down, SIGNAL( clicked() ), SLOT( down() ) );\n}\n\nvoid BackendSelection::load()\n{\n\tm_services.clear();\n\tm_select->clear();\n\tKServiceTypeProfile::clear();\n\n        const KService::List offers = KServiceTypeTrader::self()->query( \"PhononBackend\",\n\t\t\t\"Type == 'Service' and [X-KDE-PhononBackendInfo-InterfaceVersion] == 1\" );\n\t\/\/ the offers are already sorted for preference\n        KService::List::const_iterator it = offers.begin();\n        const KService::List::const_iterator end = offers.end();\n\tfor( ; it != end; ++it )\n\t{\n\t\tKService::Ptr service = *it;\n\t\tm_select->addItem( service->name() );\n\t\tm_services[ service->name() ] = service;\n\t}\n\tm_select->setItemSelected( m_select->item( 0 ), true );\n}\n\nvoid BackendSelection::save()\n{\n\t\/\/ save to profilerc\n\tKSimpleConfig config( \"profilerc\" );\n\tQStringList grouplist = config.groupList();\n\tQStringList::Iterator it = grouplist.begin();\n\tQStringList::Iterator end = grouplist.end();\n\tfor( ; it != end; ++it )\n\t{\n\t\tconfig.setGroup( *it );\n\t\tif( config.readEntry( \"ServiceType\" ) == \"PhononBackend\" )\n\t\t\tconfig.deleteGroup( *it );\n\t}\n\tunsigned int count = m_select->count();\n\tfor( unsigned int i = 0; i < count; ++i )\n\t{\n\t\tQListWidgetItem* item = m_select->item( i );\n\t\tKService::Ptr service = m_services[ item->text() ];\n\t\tconfig.setGroup( \"PhononBackend\" + QString( \" - %1\" ).arg( i ) );\n\t\tconfig.writeEntry( \"AllowAsDefault\", true );\n\t\tconfig.writeEntry( \"Application\", service->storageId() );\n\t\tconfig.writeEntry( \"GenericServiceType\", \"PhononBackend\" );\n\t\tconfig.writeEntry( \"Preference\", count - i );\n\t\tconfig.writeEntry( \"ServiceType\", \"PhononBackend\" );\n\t}\n\tconfig.sync();\n\tKServiceTypeProfile::clear();\n\n\tkapp->dcopClient()->emitDCOPSignal( \"phononBackendChanged()\", QByteArray() );\n}\n\nvoid BackendSelection::defaults()\n{\n\t\/\/ XXX: hack, I don't know how to get the initalPreference without\n\t\/\/ reading it all manually\n\tKSimpleConfig config( \"profilerc\" );\n\tQStringList grouplist = config.groupList();\n\tQStringList::Iterator it = grouplist.begin();\n\tQStringList::Iterator end = grouplist.end();\n\tQStringList apps;\n\tQList<int> pref;\n\tfor( ; it != end; ++it )\n\t{\n\t\tconfig.setGroup( *it );\n\t\tif( config.readEntry( \"ServiceType\" ) == \"PhononBackend\" )\n\t\t{\n\t\t\tapps.append( config.readEntry( \"Application\" ) );\n\t\t\tpref.append( config.readEntry( \"Preference\", int( 0 ) ) );\n\t\t\tconfig.deleteGroup( *it );\n\t\t}\n\t}\n\tconfig.sync();\n\tload();\n\tfor( int i = 0; i < apps.count(); ++i )\n\t{\n\t\tconfig.setGroup( \"PhononBackend\" + QString( \" - %1\" ).arg( i ) );\n\t\tconfig.writeEntry( \"AllowAsDefault\", true );\n\t\tconfig.writeEntry( \"Application\", apps[ i ] );\n\t\tconfig.writeEntry( \"GenericServiceType\", \"PhononBackend\" );\n\t\tconfig.writeEntry( \"Preference\", pref[ i ] );\n\t\tconfig.writeEntry( \"ServiceType\", \"PhononBackend\" );\n\t}\n\tconfig.sync();\n}\n\nvoid BackendSelection::selectionChanged()\n{\n\tKService::Ptr service;\n\tfor( int i = 0; i < m_select->count(); ++i )\n\t{\n\t\tQListWidgetItem* item = m_select->item( i );\n\t\tif( m_select->isItemSelected( item ) )\n\t\t{\n\t\t\tservice = m_services[ item->text() ];\n\t\t\tbreak;\n\t\t}\n\t}\n\tm_icon->setPixmap( KIcon( service->icon() ).pixmap( 32 ) );\n\tm_name->setText( service->name() );\n\tm_comment->setText( service->comment() );\n\tm_website->setText( service->property( \"X-KDE-PhononBackendInfo-Website\" ).toString() );\n\t\/\/m_website->setURL( m_website->text() );\n\tm_version->setText( service->property( \"X-KDE-PhononBackendInfo-Version\" ).toString() );\n}\n\nvoid BackendSelection::up()\n{\n\tQList<QListWidgetItem*> selectedList = m_select->selectedItems();\n\tforeach( QListWidgetItem* selected, selectedList )\n\t{\n\t\tint row = m_select->row( selected );\n\t\tif( row > 0 )\n\t\t{\n\t\t\tQListWidgetItem* taken = m_select->takeItem( row - 1 );\n\t\t\tm_select->insertItem( row, taken );\n\t\t\temit changed();\n\t\t}\n\t}\n}\n\nvoid BackendSelection::down()\n{\n\tQList<QListWidgetItem*> selectedList = m_select->selectedItems();\n\tforeach( QListWidgetItem* selected, selectedList )\n\t{\n\t\tint row = m_select->row( selected );\n\t\tif( row + 1 < m_select->count() )\n\t\t{\n\t\t\tQListWidgetItem* taken = m_select->takeItem( row + 1 );\n\t\t\tm_select->insertItem( row, taken );\n\t\t\temit changed();\n\t\t}\n\t}\n}\n\n#include \"backendselection.moc\"\n\n\/\/ vim: sw=4 ts=4 noet\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\n#include <stdexcept>\n#include <unordered_map>\n\n#include \"windowswindow.hh\"\n#include \"windowsopenglcontext.hh\"\n\n#define FILE_EXIT_OPTION 9001\nstatic char appName[] = \"Test Application\";\n\nusing System::KeyCode;\n\nclass KeyMap : public std::unordered_map<WPARAM, System::KeyCode> {\npublic:\n\tKeyMap() : std::unordered_map<WPARAM, System::KeyCode>() {\n\t\t(*this)[VK_PRIOR]   = KeyCode::KeyPageUp;\n\t\t(*this)[VK_NEXT]    = KeyCode::KeyPageDown;\n\t\t(*this)[VK_END]     = KeyCode::KeyEnd;\n\t\t(*this)[VK_HOME]    = KeyCode::KeyHome;\n\t\t(*this)[VK_INSERT]  = KeyCode::KeyInsert;\n\t\t(*this)[VK_DELETE]  = KeyCode::KeyDelete;\n\n\t\t(*this)[VK_RIGHT]   = KeyCode::KeyRightArrow;\n\t\t(*this)[VK_DOWN]    = KeyCode::KeyDownArrow;\n\t\t(*this)[VK_LEFT]    = KeyCode::KeyLeftArrow;\n\t\t(*this)[VK_UP]      = KeyCode::KeyUpArrow;\n\n\t\t(*this)[VK_ESCAPE]  = KeyCode::KeyEscape;\n\t\t(*this)[VK_TAB]     = KeyCode::KeyTab;\n\t\t(*this)[VK_SHIFT]   = KeyCode::KeyShift;\n\t\t(*this)[VK_MENU]    = KeyCode::KeyAlt;\n\t\t(*this)[VK_CONTROL] = KeyCode::KeyControl;\n\t\t(*this)[VK_CAPITAL] = KeyCode::KeyCapsLock;\n\n\t\t(*this)[VK_RCONTROL] = KeyCode::KeyRightControl;\n\t\t(*this)[VK_LCONTROL] = KeyCode::KeyLeftControl;\n\t\t(*this)[VK_RSHIFT]   = KeyCode::KeyRightShift;\n\t\t(*this)[VK_LSHIFT]   = KeyCode::KeyLeftShift;\n\n\t\t(*this)[VK_BACK]    = KeyCode::KeyBackspace;\n\t\t(*this)[VK_RETURN]  = KeyCode::KeyEnter;\n\t\t(*this)[VK_SPACE]   = KeyCode::KeySpace;\n\n\t\t(*this)[0x30]       = KeyCode::Key0;\n\t\t(*this)[0x31]       = KeyCode::Key1;\n\t\t(*this)[0x32]       = KeyCode::Key2;\n\t\t(*this)[0x33]       = KeyCode::Key3;\n\t\t(*this)[0x34]       = KeyCode::Key4;\n\t\t(*this)[0x35]       = KeyCode::Key5;\n\t\t(*this)[0x36]       = KeyCode::Key6;\n\t\t(*this)[0x37]       = KeyCode::Key7;\n\t\t(*this)[0x38]       = KeyCode::Key8;\n\t\t(*this)[0x39]       = KeyCode::Key9;\n\n\t\t(*this)[VK_NUMPAD0] = KeyCode::KeyNumpad0;\n\t\t(*this)[VK_NUMPAD1] = KeyCode::KeyNumpad1;\n\t\t(*this)[VK_NUMPAD2] = KeyCode::KeyNumpad2;\n\t\t(*this)[VK_NUMPAD3] = KeyCode::KeyNumpad3;\n\t\t(*this)[VK_NUMPAD4] = KeyCode::KeyNumpad4;\n\t\t(*this)[VK_NUMPAD5] = KeyCode::KeyNumpad5;\n\t\t(*this)[VK_NUMPAD6] = KeyCode::KeyNumpad6;\n\t\t(*this)[VK_NUMPAD7] = KeyCode::KeyNumpad7;\n\t\t(*this)[VK_NUMPAD8] = KeyCode::KeyNumpad8;\n\t\t(*this)[VK_NUMPAD9] = KeyCode::KeyNumpad9;\n\n\t\t(*this)[VK_MULTIPLY] = KeyCode::KeyMultiply;\n\t\t(*this)[VK_ADD]      = KeyCode::KeyPlus;\n\t\t(*this)[VK_SUBTRACT] = KeyCode::KeyMinus;\n\t\t(*this)[VK_DIVIDE]   = KeyCode::KeyDivide;\n\t\t(*this)[VK_DECIMAL]  = KeyCode::KeyDecimal;\n\n\t\t(*this)[0x41]       = KeyCode::KeyA;\n\t\t(*this)[0x42]       = KeyCode::KeyB;\n\t\t(*this)[0x43]       = KeyCode::KeyC;\n\t\t(*this)[0x44]       = KeyCode::KeyD;\n\t\t(*this)[0x45]       = KeyCode::KeyE;\n\t\t(*this)[0x46]       = KeyCode::KeyF;\n\t\t(*this)[0x47]       = KeyCode::KeyG;\n\t\t(*this)[0x48]       = KeyCode::KeyH;\n\t\t(*this)[0x49]       = KeyCode::KeyI;\n\t\t(*this)[0x4A]       = KeyCode::KeyJ;\n\t\t(*this)[0x4B]       = KeyCode::KeyK;\n\t\t(*this)[0x4C]       = KeyCode::KeyL;\n\t\t(*this)[0x4D]       = KeyCode::KeyM;\n\t\t(*this)[0x4E]       = KeyCode::KeyN;\n\t\t(*this)[0x4F]       = KeyCode::KeyO;\n\t\t(*this)[0x50]       = KeyCode::KeyP;\n\t\t(*this)[0x51]       = KeyCode::KeyQ;\n\t\t(*this)[0x52]       = KeyCode::KeyR;\n\t\t(*this)[0x53]       = KeyCode::KeyS;\n\t\t(*this)[0x54]       = KeyCode::KeyT;\n\t\t(*this)[0x55]       = KeyCode::KeyU;\n\t\t(*this)[0x56]       = KeyCode::KeyV;\n\t\t(*this)[0x57]       = KeyCode::KeyW;\n\t\t(*this)[0x59]       = KeyCode::KeyY;\n\t\t(*this)[0x5A]       = KeyCode::KeyZ;\n\t}\n};\n\nstatic KeyMap keyMap;\nstatic std::unordered_map<HWND, WindowsWindow*> windowMap;\n\nWindowsWindow::WindowsWindow(Framework::ApplicationContext *applicationContext, Framework::ISystemWindowController *controller, HINSTANCE processInstance, int commandShow)\n\t: m_applicationContext(applicationContext), m_controller(controller), m_openGLContext(NULL)\n{\n\tWNDCLASSEX windowClass;\n\n\twindowClass.cbSize        = sizeof(WNDCLASSEX);\n\twindowClass.style         = CS_VREDRAW | CS_HREDRAW;\n\twindowClass.lpfnWndProc   = WndProc;\n\twindowClass.cbClsExtra    = 0;\n\twindowClass.cbWndExtra    = 0;\n\twindowClass.hInstance     = processInstance;\n\twindowClass.hIcon         = LoadIcon(NULL, IDI_APPLICATION);\n\twindowClass.hIconSm       = LoadIcon(NULL, IDI_APPLICATION);\n\twindowClass.hCursor       = LoadCursor(NULL, IDC_ARROW);\n\twindowClass.hbrBackground = (HBRUSH) GetStockObject(BLACK_BRUSH);\n\twindowClass.lpszClassName = appName;\n\twindowClass.lpszMenuName  = NULL;\n\n\tRegisterClassEx(&windowClass);\n\n\tm_windowHandle = CreateWindow(appName, m_applicationContext->GetState()->windowName, WS_OVERLAPPEDWINDOW, -1920, 0, 800, 600, NULL, NULL, processInstance, NULL);\n\n\twindowMap[m_windowHandle] = this;\n\n\tShowWindow(m_windowHandle, commandShow);\n\tUpdateWindow(m_windowHandle);\n}\n\nWindowsWindow::~WindowsWindow() {\n\twindowMap[m_windowHandle] = NULL;\n}\n\nint WindowsWindow::DoMessageLoop() {\n\tMSG message;\n\n\tReady();\n\n\twhile (GetMessage(&message, NULL, 0, 0))\n\t{\n\t\tTranslateMessage(&message);\n\t\tDispatchMessage(&message);\n\t\t\n\t\t\/\/ Don't do this here?\n\t\tif (m_applicationContext->ShouldDestroyWindow())\n\t\t\tDestroy();\n\t}\n\n\treturn message.wParam;\n}\n\nvoid WindowsWindow::Destroy()\n{\n\tDestroyWindow(m_windowHandle);\n}\n\nvoid WindowsWindow::Ready()\n{\n\tm_controller->OnWindowReady();\n}\n\nvoid WindowsWindow::Close()\n{\n\tm_controller->OnWindowClose();\n}\n\nvoid WindowsWindow::KeyDown(WPARAM key)\n{\n\tm_controller->OnKeyDown(keyMap[key]);\n}\n\nvoid WindowsWindow::KeyUp(WPARAM key)\n{\n\tm_controller->OnKeyUp(keyMap[key]);\n}\n\nLRESULT CALLBACK WindowsWindow::WndProc(HWND windowHandle, UINT message, WPARAM wparam, LPARAM lparam) {\n\tPAINTSTRUCT ps;\n\tHDC hdc;\n\tHMENU fileMenuHandle, mainMenuHandle;\n\t\t\t\n\tswitch(message)\n\t{\n\tcase WM_ACTIVATEAPP:\n\t\tstd::cout << \"WndProc handling WM_ACTIVATEAPP: \" << wparam << \" : \" << lparam << std::endl;\n\t\tbreak;\n\t\t\n\tcase WM_KEYDOWN:\n\t\twindowMap[windowHandle]->KeyDown(wparam);\n\t\treturn 0;\n\n\tcase WM_KEYUP:\n\t\twindowMap[windowHandle]->KeyUp(wparam);\n\t\treturn 0;\n\n\tcase WM_PAINT:\n\t\thdc = BeginPaint(windowHandle, &ps);\n\t\tTextOut(hdc, 100, 100, \"Hello world\", 11);\n\t\tEndPaint(windowHandle, &ps);\n\t\treturn 0;\n\n\tcase WM_CLOSE:\n\t\twindowMap[windowHandle]->Close();\n\t\treturn 0;\n\t\t\n\tcase WM_DESTROY:\n\t\tPostQuitMessage(0);\n\t\treturn 0;\n\t\t\n\tdefault:\n\t\treturn DefWindowProc(windowHandle, message, wparam, lparam);\n\t}\n}\n<commit_msg>Remove windows debug messages<commit_after>#include <stdexcept>\n#include <unordered_map>\n\n#include \"windowswindow.hh\"\n#include \"windowsopenglcontext.hh\"\n\n#define FILE_EXIT_OPTION 9001\nstatic char appName[] = \"Test Application\";\n\nusing System::KeyCode;\n\nclass KeyMap : public std::unordered_map<WPARAM, System::KeyCode> {\npublic:\n\tKeyMap() : std::unordered_map<WPARAM, System::KeyCode>() {\n\t\t(*this)[VK_PRIOR]   = KeyCode::KeyPageUp;\n\t\t(*this)[VK_NEXT]    = KeyCode::KeyPageDown;\n\t\t(*this)[VK_END]     = KeyCode::KeyEnd;\n\t\t(*this)[VK_HOME]    = KeyCode::KeyHome;\n\t\t(*this)[VK_INSERT]  = KeyCode::KeyInsert;\n\t\t(*this)[VK_DELETE]  = KeyCode::KeyDelete;\n\n\t\t(*this)[VK_RIGHT]   = KeyCode::KeyRightArrow;\n\t\t(*this)[VK_DOWN]    = KeyCode::KeyDownArrow;\n\t\t(*this)[VK_LEFT]    = KeyCode::KeyLeftArrow;\n\t\t(*this)[VK_UP]      = KeyCode::KeyUpArrow;\n\n\t\t(*this)[VK_ESCAPE]  = KeyCode::KeyEscape;\n\t\t(*this)[VK_TAB]     = KeyCode::KeyTab;\n\t\t(*this)[VK_SHIFT]   = KeyCode::KeyShift;\n\t\t(*this)[VK_MENU]    = KeyCode::KeyAlt;\n\t\t(*this)[VK_CONTROL] = KeyCode::KeyControl;\n\t\t(*this)[VK_CAPITAL] = KeyCode::KeyCapsLock;\n\n\t\t(*this)[VK_RCONTROL] = KeyCode::KeyRightControl;\n\t\t(*this)[VK_LCONTROL] = KeyCode::KeyLeftControl;\n\t\t(*this)[VK_RSHIFT]   = KeyCode::KeyRightShift;\n\t\t(*this)[VK_LSHIFT]   = KeyCode::KeyLeftShift;\n\n\t\t(*this)[VK_BACK]    = KeyCode::KeyBackspace;\n\t\t(*this)[VK_RETURN]  = KeyCode::KeyEnter;\n\t\t(*this)[VK_SPACE]   = KeyCode::KeySpace;\n\n\t\t(*this)[0x30]       = KeyCode::Key0;\n\t\t(*this)[0x31]       = KeyCode::Key1;\n\t\t(*this)[0x32]       = KeyCode::Key2;\n\t\t(*this)[0x33]       = KeyCode::Key3;\n\t\t(*this)[0x34]       = KeyCode::Key4;\n\t\t(*this)[0x35]       = KeyCode::Key5;\n\t\t(*this)[0x36]       = KeyCode::Key6;\n\t\t(*this)[0x37]       = KeyCode::Key7;\n\t\t(*this)[0x38]       = KeyCode::Key8;\n\t\t(*this)[0x39]       = KeyCode::Key9;\n\n\t\t(*this)[VK_NUMPAD0] = KeyCode::KeyNumpad0;\n\t\t(*this)[VK_NUMPAD1] = KeyCode::KeyNumpad1;\n\t\t(*this)[VK_NUMPAD2] = KeyCode::KeyNumpad2;\n\t\t(*this)[VK_NUMPAD3] = KeyCode::KeyNumpad3;\n\t\t(*this)[VK_NUMPAD4] = KeyCode::KeyNumpad4;\n\t\t(*this)[VK_NUMPAD5] = KeyCode::KeyNumpad5;\n\t\t(*this)[VK_NUMPAD6] = KeyCode::KeyNumpad6;\n\t\t(*this)[VK_NUMPAD7] = KeyCode::KeyNumpad7;\n\t\t(*this)[VK_NUMPAD8] = KeyCode::KeyNumpad8;\n\t\t(*this)[VK_NUMPAD9] = KeyCode::KeyNumpad9;\n\n\t\t(*this)[VK_MULTIPLY] = KeyCode::KeyMultiply;\n\t\t(*this)[VK_ADD]      = KeyCode::KeyPlus;\n\t\t(*this)[VK_SUBTRACT] = KeyCode::KeyMinus;\n\t\t(*this)[VK_DIVIDE]   = KeyCode::KeyDivide;\n\t\t(*this)[VK_DECIMAL]  = KeyCode::KeyDecimal;\n\n\t\t(*this)[0x41]       = KeyCode::KeyA;\n\t\t(*this)[0x42]       = KeyCode::KeyB;\n\t\t(*this)[0x43]       = KeyCode::KeyC;\n\t\t(*this)[0x44]       = KeyCode::KeyD;\n\t\t(*this)[0x45]       = KeyCode::KeyE;\n\t\t(*this)[0x46]       = KeyCode::KeyF;\n\t\t(*this)[0x47]       = KeyCode::KeyG;\n\t\t(*this)[0x48]       = KeyCode::KeyH;\n\t\t(*this)[0x49]       = KeyCode::KeyI;\n\t\t(*this)[0x4A]       = KeyCode::KeyJ;\n\t\t(*this)[0x4B]       = KeyCode::KeyK;\n\t\t(*this)[0x4C]       = KeyCode::KeyL;\n\t\t(*this)[0x4D]       = KeyCode::KeyM;\n\t\t(*this)[0x4E]       = KeyCode::KeyN;\n\t\t(*this)[0x4F]       = KeyCode::KeyO;\n\t\t(*this)[0x50]       = KeyCode::KeyP;\n\t\t(*this)[0x51]       = KeyCode::KeyQ;\n\t\t(*this)[0x52]       = KeyCode::KeyR;\n\t\t(*this)[0x53]       = KeyCode::KeyS;\n\t\t(*this)[0x54]       = KeyCode::KeyT;\n\t\t(*this)[0x55]       = KeyCode::KeyU;\n\t\t(*this)[0x56]       = KeyCode::KeyV;\n\t\t(*this)[0x57]       = KeyCode::KeyW;\n\t\t(*this)[0x59]       = KeyCode::KeyY;\n\t\t(*this)[0x5A]       = KeyCode::KeyZ;\n\t}\n};\n\nstatic KeyMap keyMap;\nstatic std::unordered_map<HWND, WindowsWindow*> windowMap;\n\nWindowsWindow::WindowsWindow(Framework::ApplicationContext *applicationContext, Framework::ISystemWindowController *controller, HINSTANCE processInstance, int commandShow)\n\t: m_applicationContext(applicationContext), m_controller(controller), m_openGLContext(NULL)\n{\n\tWNDCLASSEX windowClass;\n\n\twindowClass.cbSize        = sizeof(WNDCLASSEX);\n\twindowClass.style         = CS_VREDRAW | CS_HREDRAW;\n\twindowClass.lpfnWndProc   = WndProc;\n\twindowClass.cbClsExtra    = 0;\n\twindowClass.cbWndExtra    = 0;\n\twindowClass.hInstance     = processInstance;\n\twindowClass.hIcon         = LoadIcon(NULL, IDI_APPLICATION);\n\twindowClass.hIconSm       = LoadIcon(NULL, IDI_APPLICATION);\n\twindowClass.hCursor       = LoadCursor(NULL, IDC_ARROW);\n\twindowClass.hbrBackground = (HBRUSH) GetStockObject(BLACK_BRUSH);\n\twindowClass.lpszClassName = appName;\n\twindowClass.lpszMenuName  = NULL;\n\n\tRegisterClassEx(&windowClass);\n\n\tm_windowHandle = CreateWindow(appName, m_applicationContext->GetState()->windowName, WS_OVERLAPPEDWINDOW, -1920, 0, 800, 600, NULL, NULL, processInstance, NULL);\n\n\twindowMap[m_windowHandle] = this;\n\n\tShowWindow(m_windowHandle, commandShow);\n\tUpdateWindow(m_windowHandle);\n}\n\nWindowsWindow::~WindowsWindow() {\n\twindowMap[m_windowHandle] = NULL;\n}\n\nint WindowsWindow::DoMessageLoop() {\n\tMSG message;\n\n\tReady();\n\n\twhile (GetMessage(&message, NULL, 0, 0))\n\t{\n\t\tTranslateMessage(&message);\n\t\tDispatchMessage(&message);\n\t\t\n\t\t\/\/ Don't do this here?\n\t\tif (m_applicationContext->ShouldDestroyWindow())\n\t\t\tDestroy();\n\t}\n\n\treturn message.wParam;\n}\n\nvoid WindowsWindow::Destroy()\n{\n\tDestroyWindow(m_windowHandle);\n}\n\nvoid WindowsWindow::Ready()\n{\n\tm_controller->OnWindowReady();\n}\n\nvoid WindowsWindow::Close()\n{\n\tm_controller->OnWindowClose();\n}\n\nvoid WindowsWindow::KeyDown(WPARAM key)\n{\n\tm_controller->OnKeyDown(keyMap[key]);\n}\n\nvoid WindowsWindow::KeyUp(WPARAM key)\n{\n\tm_controller->OnKeyUp(keyMap[key]);\n}\n\nLRESULT CALLBACK WindowsWindow::WndProc(HWND windowHandle, UINT message, WPARAM wparam, LPARAM lparam) {\n\tPAINTSTRUCT ps;\n\tHDC hdc;\n\tHMENU fileMenuHandle, mainMenuHandle;\n\t\t\t\n\tswitch(message)\n\t{\n\tcase WM_KEYDOWN:\n\t\twindowMap[windowHandle]->KeyDown(wparam);\n\t\treturn 0;\n\n\tcase WM_KEYUP:\n\t\twindowMap[windowHandle]->KeyUp(wparam);\n\t\treturn 0;\n\n\tcase WM_CLOSE:\n\t\twindowMap[windowHandle]->Close();\n\t\treturn 0;\n\t\t\n\tcase WM_DESTROY:\n\t\tPostQuitMessage(0);\n\t\treturn 0;\n\t\t\n\tdefault:\n\t\treturn DefWindowProc(windowHandle, message, wparam, lparam);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 The RE2 Authors.  All Rights Reserved.\n\/\/ Use of this source code is governed by a BSD-style\n\/\/ license that can be found in the LICENSE file.\n\n#include <stddef.h>\n#include <stdint.h>\n#include <map>\n#include <string>\n\n#include \"re2\/re2.h\"\n\nusing re2::StringPiece;\nusing std::string;\n\n\/\/ NOT static, NOT signed.\nuint8_t dummy = 0;\n\nvoid Test(StringPiece pattern, const RE2::Options& options, StringPiece text) {\n  RE2 re(pattern, options);\n  if (!re.ok())\n    return;\n\n  \/\/ Don't waste time fuzzing high-size programs.\n  \/\/ (They can cause bug reports due to fuzzer timeouts.)\n  int size = re.ProgramSize();\n  if (size > 9999)\n    return;\n\n  \/\/ Don't waste time fuzzing high-fanout programs.\n  \/\/ (They can also cause bug reports due to fuzzer timeouts.)\n  std::map<int, int> histogram;\n  int fanout = re.ProgramFanout(&histogram);\n  if (fanout > 9)\n    return;\n\n  StringPiece sp1, sp2, sp3, sp4;\n  string s1, s2, s3, s4;\n  int i1, i2, i3, i4;\n  double d1, d2, d3, d4;\n\n  RE2::FullMatch(text, re, &sp1, &sp2, &sp3, &sp4);\n  RE2::PartialMatch(text, re, &s1, &s2, &s3, &s4);\n\n  sp1 = sp2 = text;\n  RE2::Consume(&sp1, re, &i1, &i2, &i3, &i4);\n  RE2::FindAndConsume(&sp2, re, &d1, &d2, &d3, &d4);\n\n  s3 = s4 = text.ToString();\n  RE2::Replace(&s3, re, \"\");\n  RE2::GlobalReplace(&s4, re, \"\");\n\n  \/\/ Exercise some other API functionality.\n  dummy += re.NumberOfCapturingGroups();\n  dummy += RE2::QuoteMeta(pattern).size();\n}\n\n\/\/ Entry point for libFuzzer.\nextern \"C\" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {\n  if (size == 0 || size > 1024)\n    return 0;\n\n  \/\/ Crudely limit the use of \\p and \\P.\n  int backslash_p = 0;\n  for (size_t i = 0; i < size; i++) {\n    if (data[i] == '\\\\' && i+1 < size && (data[i+1] == 'p' || data[i+1] == 'P'))\n      backslash_p++;\n  }\n  if (backslash_p > 10)\n    return 0;\n\n  \/\/ The one-at-a-time hash by Bob Jenkins.\n  uint32_t hash = 0;\n  for (size_t i = 0; i < size; i++) {\n    hash += data[i];\n    hash += (hash << 10);\n    hash ^= (hash >> 6);\n  }\n  hash += (hash << 3);\n  hash ^= (hash >> 11);\n  hash += (hash << 15);\n\n  RE2::Options options;\n  options.set_log_errors(false);\n  options.set_max_mem(64 << 20);\n  options.set_encoding(hash & 1 ? RE2::Options::EncodingLatin1\n                                : RE2::Options::EncodingUTF8);\n  options.set_posix_syntax(hash & 2);\n  options.set_longest_match(hash & 4);\n  options.set_literal(hash & 8);\n  options.set_never_nl(hash & 16);\n  options.set_dot_nl(hash & 32);\n  options.set_never_capture(hash & 64);\n  options.set_case_sensitive(hash & 128);\n  options.set_perl_classes(hash & 256);\n  options.set_word_boundary(hash & 512);\n  options.set_one_line(hash & 1024);\n\n  const char* ptr = reinterpret_cast<const char*>(data);\n  int len = static_cast<int>(size);\n\n  StringPiece pattern(ptr, len);\n  StringPiece text(ptr, len);\n  Test(pattern, options, text);\n\n  return 0;\n}\n<commit_msg>Expand the comment on the \\p and \\P limit.<commit_after>\/\/ Copyright 2016 The RE2 Authors.  All Rights Reserved.\n\/\/ Use of this source code is governed by a BSD-style\n\/\/ license that can be found in the LICENSE file.\n\n#include <stddef.h>\n#include <stdint.h>\n#include <map>\n#include <string>\n\n#include \"re2\/re2.h\"\n\nusing re2::StringPiece;\nusing std::string;\n\n\/\/ NOT static, NOT signed.\nuint8_t dummy = 0;\n\nvoid Test(StringPiece pattern, const RE2::Options& options, StringPiece text) {\n  RE2 re(pattern, options);\n  if (!re.ok())\n    return;\n\n  \/\/ Don't waste time fuzzing high-size programs.\n  \/\/ (They can cause bug reports due to fuzzer timeouts.)\n  int size = re.ProgramSize();\n  if (size > 9999)\n    return;\n\n  \/\/ Don't waste time fuzzing high-fanout programs.\n  \/\/ (They can also cause bug reports due to fuzzer timeouts.)\n  std::map<int, int> histogram;\n  int fanout = re.ProgramFanout(&histogram);\n  if (fanout > 9)\n    return;\n\n  StringPiece sp1, sp2, sp3, sp4;\n  string s1, s2, s3, s4;\n  int i1, i2, i3, i4;\n  double d1, d2, d3, d4;\n\n  RE2::FullMatch(text, re, &sp1, &sp2, &sp3, &sp4);\n  RE2::PartialMatch(text, re, &s1, &s2, &s3, &s4);\n\n  sp1 = sp2 = text;\n  RE2::Consume(&sp1, re, &i1, &i2, &i3, &i4);\n  RE2::FindAndConsume(&sp2, re, &d1, &d2, &d3, &d4);\n\n  s3 = s4 = text.ToString();\n  RE2::Replace(&s3, re, \"\");\n  RE2::GlobalReplace(&s4, re, \"\");\n\n  \/\/ Exercise some other API functionality.\n  dummy += re.NumberOfCapturingGroups();\n  dummy += RE2::QuoteMeta(pattern).size();\n}\n\n\/\/ Entry point for libFuzzer.\nextern \"C\" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {\n  if (size == 0 || size > 1024)\n    return 0;\n\n  \/\/ Crudely limit the use of \\p and \\P.\n  \/\/ Otherwise, we will waste time on inputs that have long runs of Unicode\n  \/\/ character classes. The fuzzer has shown itself to be easily capable of\n  \/\/ generating such patterns that fall within the other limits, but result\n  \/\/ in timeouts nonetheless. The marginal cost is high - even more so when\n  \/\/ counted repetition is involved - whereas the marginal benefit is zero.\n  int backslash_p = 0;\n  for (size_t i = 0; i < size; i++) {\n    if (data[i] == '\\\\' && i+1 < size && (data[i+1] == 'p' || data[i+1] == 'P'))\n      backslash_p++;\n  }\n  if (backslash_p > 10)\n    return 0;\n\n  \/\/ The one-at-a-time hash by Bob Jenkins.\n  uint32_t hash = 0;\n  for (size_t i = 0; i < size; i++) {\n    hash += data[i];\n    hash += (hash << 10);\n    hash ^= (hash >> 6);\n  }\n  hash += (hash << 3);\n  hash ^= (hash >> 11);\n  hash += (hash << 15);\n\n  RE2::Options options;\n  options.set_log_errors(false);\n  options.set_max_mem(64 << 20);\n  options.set_encoding(hash & 1 ? RE2::Options::EncodingLatin1\n                                : RE2::Options::EncodingUTF8);\n  options.set_posix_syntax(hash & 2);\n  options.set_longest_match(hash & 4);\n  options.set_literal(hash & 8);\n  options.set_never_nl(hash & 16);\n  options.set_dot_nl(hash & 32);\n  options.set_never_capture(hash & 64);\n  options.set_case_sensitive(hash & 128);\n  options.set_perl_classes(hash & 256);\n  options.set_word_boundary(hash & 512);\n  options.set_one_line(hash & 1024);\n\n  const char* ptr = reinterpret_cast<const char*>(data);\n  int len = static_cast<int>(size);\n\n  StringPiece pattern(ptr, len);\n  StringPiece text(ptr, len);\n  Test(pattern, options, text);\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file SharedMemory.cpp\n * \\date Mar 18, 2010\n * \\author samael\n *\/\n\n#include <cstring>\n#include \"SharedMemory.h\"\n#include \"D2MCE.h\"\n\nusing namespace std;\n\nnamespace wfe\n{\n\n\/**\n * Allocate a piece of shared memory on DSM.\n *\/\nSharedMemory::SharedMemory(string name, size_t size):\n\t\t_name(name), _size(size)\n{\n\td2mce_mutex_init(&_mutex, (name + \"_mutex\").c_str());\n\t_buf = (char *)d2mce_malloc(name.c_str(), size);\n}\n\nIDrop* SharedMemory::clone() const\n{\n\tSharedMemory *sm = D2MCE::instance()->createSharedMemory(_name, _size);\n\tmemcpy(sm->buffer(), _buf, _size);\n\treturn sm;\n}\n\n}\n<commit_msg><commit_after>\/**\n * \\file SharedMemory.cpp\n * \\date Mar 18, 2010\n * \\author samael\n *\/\n\n#include <cstring>\n#include \"SharedMemory.h\"\n#include \"D2MCE.h\"\n\nusing namespace std;\n\nnamespace wfe\n{\n\n\/**\n * Allocate a piece of shared memory on DSM.\n *\/\nSharedMemory::SharedMemory(string name, size_t size):\n\t\t_name(name), _size(size)\n{\n\td2mce_mutex_init(&_mutex, (name + \"_mutex\").c_str());\n\t_buf = (char *)d2mce_malloc(name.c_str(), size);\n}\n\n\/**\n * Clone the shared memory. It's done by D2MCE::createSharedMemory().\n *\/\nIDrop* SharedMemory::clone() const\n{\n\tSharedMemory *sm = D2MCE::instance()->createSharedMemory(_name, _size);\n\tmemcpy(sm->buffer(), _buf, _size);\n\treturn sm;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"label.h\"\n#include \"..\/utils\/outFile.h\"\n\n#include <QDebug>\n\nusing namespace utils;\n\nbool Label::init(QDomElement const &element, int index)\n{\n\tmX = QString(\"%1\").arg(static_cast<qreal>(element.attribute(\"x\").toInt()));\n\tmY = QString(\"%1\").arg(static_cast<qreal>(element.attribute(\"y\").toInt()));\n\tmText = element.attribute(\"text\");\n\tmTextBinded = element.attribute(\"textBinded\");\n\tmReadOnly = element.attribute(\"readOnly\", \"false\");\n\tmIndex = index;\n\tif ((mText == \"\" && mTextBinded == \"\") || (mReadOnly != \"true\" && mReadOnly != \"false\")) {\n\t\tqDebug() << \"ERROR: can't parse label\";\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nQString Label::titleName() const\n{\n\treturn \"title_\" + QString(\"%1\").arg(mIndex);\n}\n\nvoid Label::generateCodeForConstructor(OutFile &out)\n{\n\tif (mText.isEmpty()) {\n\t\t\/\/ Это бинденный лейбл, текст для него будет браться из репозитория\n\t\tout() << \"\t\t\t\" + titleName() + \" = new ElementTitle(\"\n\t\t\t\t+ mX + \", \" + mY + \", \\\"\" + mTextBinded + \"\\\", \" + mReadOnly + \");\\n\";\n\t} else {\n\t\t\/\/ Это статический лейбл, репозиторий ему не нужен\n\t\tout() << \"\t\t\t\" + titleName() + \" = new ElementTitle(\"\n\t\t\t\t+ mX + \", \" + mY + \", \\\"\" + mText + \"\\\");\\n\";\n\t}\n\t\/\/ TODO: вынести отсюда в родительский класс.\n\tout() << \"\t\t\t\" + titleName() + \"->setFlags(0);\\n\"\n\t\t<< \"\t\t\t\" + titleName() + \"->setTextInteractionFlags(Qt::NoTextInteraction);\\n\"\n\t\t<< \"\t\t\t\" + titleName() + \"->setParentItem(this);\\n\"\n\t\t<< \"\t\t\tmTitles.append(\" + titleName() + \");\\n\";\n}\n\nvoid Label::generateCodeForUpdateData(OutFile &out)\n{\n\tif (mTextBinded.isEmpty())\n\t\treturn;  \/\/ Метка статическая.\n\tQString field;\n\tif (mTextBinded == \"name\")\n\t\tfield = \"mDataIndex.data(Qt::DisplayRole).toString()\";\n\telse\n\t\tfield = \"roleValueByName(\\\"\" + mTextBinded + \"\\\")\";  \/\/ Кастомное свойство. Если есть желание забиндиться на ещё какое-нибудь из предефайненных, надо тут дописать.\n\n\tout() << \"\t\t\t\" + titleName() + \"->setHtml(QString(\\\"%1\\\").arg(\" + field + \"));\\n\";\n}\n\nvoid Label::generateCodeForFields(OutFile &out)\n{\n\tout() << \"\t\tElementTitle *\" + titleName() + \";\\n\";\n}\n<commit_msg>Убраны последствия злоупотребления наркотиками<commit_after>#include \"label.h\"\n#include \"..\/utils\/outFile.h\"\n\n#include <QDebug>\n\nusing namespace utils;\n\nbool Label::init(QDomElement const &element, int index)\n{\n\tmX = element.attribute(\"x\", \"0\");\n\tmY = element.attribute(\"y\", \"0\");\n\tmText = element.attribute(\"text\");\n\tmTextBinded = element.attribute(\"textBinded\");\n\tmReadOnly = element.attribute(\"readOnly\", \"false\");\n\tmIndex = index;\n\tif ((mText == \"\" && mTextBinded == \"\") || (mReadOnly != \"true\" && mReadOnly != \"false\")) {\n\t\tqDebug() << \"ERROR: can't parse label\";\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nQString Label::titleName() const\n{\n\treturn \"title_\" + QString(\"%1\").arg(mIndex);\n}\n\nvoid Label::generateCodeForConstructor(OutFile &out)\n{\n\tif (mText.isEmpty()) {\n\t\t\/\/ Это бинденный лейбл, текст для него будет браться из репозитория\n\t\tout() << \"\t\t\t\" + titleName() + \" = new ElementTitle(\"\n\t\t\t\t+ mX + \", \" + mY + \", \\\"\" + mTextBinded + \"\\\", \" + mReadOnly + \");\\n\";\n\t} else {\n\t\t\/\/ Это статический лейбл, репозиторий ему не нужен\n\t\tout() << \"\t\t\t\" + titleName() + \" = new ElementTitle(\"\n\t\t\t\t+ mX + \", \" + mY + \", \\\"\" + mText + \"\\\");\\n\";\n\t}\n\t\/\/ TODO: вынести отсюда в родительский класс.\n\tout() << \"\t\t\t\" + titleName() + \"->setFlags(0);\\n\"\n\t\t<< \"\t\t\t\" + titleName() + \"->setTextInteractionFlags(Qt::NoTextInteraction);\\n\"\n\t\t<< \"\t\t\t\" + titleName() + \"->setParentItem(this);\\n\"\n\t\t<< \"\t\t\tmTitles.append(\" + titleName() + \");\\n\";\n}\n\nvoid Label::generateCodeForUpdateData(OutFile &out)\n{\n\tif (mTextBinded.isEmpty())\n\t\treturn;  \/\/ Метка статическая.\n\tQString field;\n\tif (mTextBinded == \"name\")\n\t\tfield = \"mDataIndex.data(Qt::DisplayRole).toString()\";\n\telse\n\t\tfield = \"roleValueByName(\\\"\" + mTextBinded + \"\\\")\";  \/\/ Кастомное свойство. Если есть желание забиндиться на ещё какое-нибудь из предефайненных, надо тут дописать.\n\n\tout() << \"\t\t\t\" + titleName() + \"->setHtml(QString(\\\"%1\\\").arg(\" + field + \"));\\n\";\n}\n\nvoid Label::generateCodeForFields(OutFile &out)\n{\n\tout() << \"\t\tElementTitle *\" + titleName() + \";\\n\";\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_DISCONTINUOUSLAGRANGE_HH\n#define DUNE_GDT_SPACES_DISCONTINUOUSLAGRANGE_HH\n\n#include <memory>\n\n#include <dune\/stuff\/grid\/partview.hh>\n#include <dune\/stuff\/grid\/provider\/interface.hh>\n\n#include \"interface.hh\"\n#include \"discontinuouslagrange\/fem-localfunctions.hh\"\n\n\nnamespace Dune {\nnamespace GDT {\nnamespace Spaces {\n\n\ntemplate< class GridType, Stuff::Grid::ChooseLayer layer_type, ChooseSpaceBackend backend_type,\n          int polOrder, class RangeFieldType, int dimRange, int dimRangeCols = 1 >\nclass DiscontinuousLagrangeProvider\n{\n  static const Stuff::Grid::ChoosePartView part_view_type = ChooseGridPartView< backend_type >::type;\npublic:\n  typedef typename Stuff::Grid::Layer< GridType, layer_type, part_view_type >::Type GridLayerType;\n\nprivate:\n  template< class G, int p, class R, int r, int rC, GDT::ChooseSpaceBackend b >\n  struct SpaceChooser\n  {\n    static_assert(AlwaysFalse< G >::value, \"No space available for this backend!\");\n  };\n\n  template< class G, int p, class R, int r, int rC >\n  struct SpaceChooser< G, p, R, r, rC, GDT::ChooseSpaceBackend::fem_localfunction >\n  {\n    typedef GDT::Spaces::DiscontinuousLagrange::FemLocalfunctionsBased< GridLayerType, p, R, r > Type;\n  };\n\npublic:\n  typedef typename SpaceChooser< GridType, polOrder, RangeFieldType, dimRange, dimRangeCols, backend_type >::Type Type;\n\n  static Type create(const std::shared_ptr< const GridLayerType > grid_layer)\n  {\n    return Type(grid_layer);\n  }\n\n  static Type create(const Stuff::Grid::ConstProviderInterface< GridType >& grid_provider, const int level = 0)\n  {\n    return Type(grid_provider.template layer< layer_type, part_view_type >(level));\n  }\n}; \/\/ class DiscontinuousLagrangeProvider\n\n\n} \/\/ namespace Spaces\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_SPACES_DISCONTINUOUSLAGRANGE_HH\n<commit_msg>[spaces.discontinuouslagrange] use correct grid provider<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_DISCONTINUOUSLAGRANGE_HH\n#define DUNE_GDT_SPACES_DISCONTINUOUSLAGRANGE_HH\n\n#include <memory>\n\n#if HAVE_DUNE_GRID_MULTISCALE\n# include <dune\/grid\/multiscale\/provider\/interface.hh>\n#endif\n\n#include <dune\/stuff\/grid\/partview.hh>\n#include <dune\/stuff\/grid\/provider\/interface.hh>\n\n#include \"interface.hh\"\n#include \"discontinuouslagrange\/fem-localfunctions.hh\"\n\n\nnamespace Dune {\nnamespace GDT {\nnamespace Spaces {\n\n\ntemplate< class GridType, Stuff::Grid::ChooseLayer layer_type, ChooseSpaceBackend backend_type,\n          int polOrder, class RangeFieldType, int dimRange, int dimRangeCols = 1 >\nclass DiscontinuousLagrangeProvider\n{\n  static const Stuff::Grid::ChoosePartView part_view_type = ChooseGridPartView< backend_type >::type;\npublic:\n  typedef typename Stuff::Grid::Layer< GridType, layer_type, part_view_type >::Type GridLayerType;\n\nprivate:\n  template< class G, int p, class R, int r, int rC, GDT::ChooseSpaceBackend b >\n  struct SpaceChooser\n  {\n    static_assert(AlwaysFalse< G >::value, \"No space available for this backend!\");\n  };\n\n  template< class G, int p, class R, int r, int rC >\n  struct SpaceChooser< G, p, R, r, rC, GDT::ChooseSpaceBackend::fem_localfunction >\n  {\n    typedef GDT::Spaces::DiscontinuousLagrange::FemLocalfunctionsBased< GridLayerType, p, R, r > Type;\n  };\n\n#if HAVE_DUNE_GRID_MULTISCALE\n  typedef grid::Multiscale::ProviderInterface< GridType > GridProviderType;\n#else\n  typedef Stuff::Grid::ConstProviderInterface< GridType > GridProviderType;\n#endif\n\npublic:\n  typedef typename SpaceChooser< GridType, polOrder, RangeFieldType, dimRange, dimRangeCols, backend_type >::Type Type;\n\n  static Type create(const std::shared_ptr< const GridLayerType > grid_layer)\n  {\n    return Type(grid_layer);\n  }\n\n  static Type create(const GridProviderType& grid_provider, const int level_or_subdomain = 0)\n  {\n    return Type(grid_provider.template layer< layer_type, part_view_type >(level_or_subdomain));\n  }\n}; \/\/ class DiscontinuousLagrangeProvider\n\n\n} \/\/ namespace Spaces\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_SPACES_DISCONTINUOUSLAGRANGE_HH\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkExhaustiveOptimizer.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\n#include \"itkExhaustiveOptimizer.h\"\n#include \"itkCommand.h\"\n#include \"itkEventObject.h\"\n\nnamespace itk\n{\n\n\/**\n * Constructor\n *\/\nExhaustiveOptimizer\n::ExhaustiveOptimizer()\n{\n\n  itkDebugMacro(\"Constructor\");\n      \n  m_StepLength = 1.0;\n  m_CurrentIteration   =   0;\n  m_CurrentValue = 0;\n  m_CurrentIndex.Fill(0);\n  m_Stop = false;\n  m_NumberOfSteps.Fill(0);\n}\n\n\/**\n * Start walking\n **\/\n\nvoid ExhaustiveOptimizer::StartOptimization( void )\n{\n  this->StartWalking();\n}\n\n\nvoid\nExhaustiveOptimizer\n::StartWalking( void )\n{\n\n  itkDebugMacro(\"StartWalking\");\n  this->InvokeEvent( StartEvent() );\n\n  m_CurrentIteration          = 0;\n  m_MaximumNumberOfIterations = 1;\n  \n  const unsigned int spaceDimension = this->GetInitialPosition().GetSize();\n\n  for (unsigned int i=0; i< spaceDimension; i++)\n    {\n    m_MaximumNumberOfIterations *= 2 * m_NumberOfSteps[i];\n    }\n    \n  m_CurrentIndex.SetSize(spaceDimension);\n  m_CurrentIndex.Fill(0);\n  \n  this->SetCurrentPosition( this->GetInitialPosition() );\n\n  \n  itkDebugMacro(\"Calling ResumeWalking\");\n  \n  this->ResumeWalking();\n\n}\n\n\n\n\n\n\/**\n * Resume the optimization\n *\/\nvoid\nExhaustiveOptimizer\n::ResumeWalking( void )\n{\n  itkDebugMacro(\"ResumeWalk\");\n  m_Stop = false;\n \n  while( !m_Stop ) \n    {\n    ParametersType currentPosition = this->GetCurrentPosition();\n    \n    if( m_Stop )\n      {\n      StopWalking();\n      break;\n      }\n\n    m_CurrentValue = GetValue( currentPosition );\n    \n    if (m_CurrentValue > m_MaximumMetricValue) \n      {\n      m_MaximumMetricValue = m_CurrentValue;\n      m_MaximumMetricValuePosition = currentPosition;\n      }\n    if (m_CurrentValue < m_MinimumMetricValue) \n      {\n      m_MinimumMetricValue = m_CurrentValue;\n      m_MinimumMetricValuePosition = currentPosition;\n      }\n     \n\n    \n    if( m_Stop )\n      {\n      this->StopWalking();\n      break;\n      }\n\n    this->AdvanceOneStep();\n\n    m_CurrentIteration++;\n\n    }\n}\n\n\nvoid\nExhaustiveOptimizer\n::StopWalking( void )\n{\n\n  itkDebugMacro(\"StopWalking\");\n  \n  m_Stop = true;\n  this->InvokeEvent( EndEvent() );\n}\n\n\n\nvoid\nExhaustiveOptimizer\n::AdvanceOneStep( void )\n{ \n\n  itkDebugMacro(\"AdvanceOneStep\");\n\n  const unsigned int  spaceDimension =\n    m_CostFunction->GetNumberOfParameters();\n\n  ScalesType     scales = this->GetScales();\n\n\n  \/\/ Make sure the scales have been set properly\n  if (scales.size() != spaceDimension)\n    {\n    itkExceptionMacro(<< \"The size of Scales is \"\n                      << scales.size()\n                      << \", but the NumberOfParameters is \"\n                      << spaceDimension\n                      << \".\");\n    }\n\n\n  ParametersType newPosition( spaceDimension );\n  ParametersType currentPosition = this->GetCurrentPosition();\n\n  IncrementIndex( newPosition );\n\n  \n  itkDebugMacro(<<\"new position = \" << newPosition );\n\n  \n  this->InvokeEvent( IterationEvent() );\n  this->SetCurrentPosition( newPosition );\n\n}\n\nvoid\nExhaustiveOptimizer\n::IncrementIndex( ParametersType &newPosition ) \n{\n\n  unsigned int idx = 0;\n\n  const unsigned int  spaceDimension =\n    m_CostFunction->GetNumberOfParameters();\n\n  while( idx < spaceDimension )\n    {\n    m_CurrentIndex[idx]++;\n\n    if( m_CurrentIndex[idx] > (2*m_NumberOfSteps[idx]))\n      {\n      m_CurrentIndex[idx]=0;\n      idx++;\n      }\n    else\n      {\n      break;\n      }\n    }\n      \n  if( idx==spaceDimension )\n    {\n    m_Stop = true;\n    }\n\n  for(unsigned int i=0; i<spaceDimension; i++)\n    {\n    newPosition[i] = (m_CurrentIndex[i]-m_NumberOfSteps[i]) *\n                      m_StepLength * this->GetScales()[i] + \n                      this->GetInitialPosition()[i];\n    }\n}\n\n\n\nvoid\nExhaustiveOptimizer\n::PrintSelf(std::ostream& os, Indent indent) const\n{\n  Superclass::PrintSelf(os,indent);\n\n  os << indent << \"CurrentValue = \" << m_CurrentValue << std::endl;\n  os << indent << \"NumberOfSteps = \" << m_NumberOfSteps << std::endl;\n  os << indent << \"CurrentIteration = \" << m_CurrentIteration << std::endl;\n  os << indent << \"Stop = \" << m_Stop << std::endl;\n  os << indent << \"CurrentParameter = \" << m_CurrentParameter << std::endl;\n  os << indent << \"StepLength = \" << m_StepLength << std::endl; \n  os << indent << \"CurrentIndex = \" << m_CurrentIndex << std::endl;\n  os << indent << \"MaximumNumberOfIterations = \" << m_MaximumNumberOfIterations << std::endl;\n  os << indent << \"MaximumMetricValue = \" << m_MaximumMetricValue << std::endl;\n  os << indent << \"MinimumMetricValue = \" << m_MinimumMetricValue << std::endl;\n  os << indent << \"MinimumMetricValuePosition = \" << m_MinimumMetricValuePosition << std::endl;\n  os << indent << \"MaximumMetricValuePosition = \" << m_MaximumMetricValuePosition << std::endl;\n}\n\n \n} \/\/ end namespace itk\n\n\n<commit_msg>BUG: It was missing to initialize min,max values and positions.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkExhaustiveOptimizer.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\n#include \"itkExhaustiveOptimizer.h\"\n#include \"itkCommand.h\"\n#include \"itkEventObject.h\"\n\nnamespace itk\n{\n\n\/**\n * Constructor\n *\/\nExhaustiveOptimizer\n::ExhaustiveOptimizer()\n{\n\n  itkDebugMacro(\"Constructor\");\n      \n  m_StepLength = 1.0;\n  m_CurrentIteration   =   0;\n  m_CurrentValue = 0;\n  m_CurrentIndex.Fill(0);\n  m_Stop = false;\n  m_NumberOfSteps.Fill(0);\n}\n\n\/**\n * Start walking\n **\/\n\nvoid ExhaustiveOptimizer::StartOptimization( void )\n{\n  this->StartWalking();\n}\n\n\nvoid\nExhaustiveOptimizer\n::StartWalking( void )\n{\n\n  itkDebugMacro(\"StartWalking\");\n  this->InvokeEvent( StartEvent() );\n\n  m_MinimumMetricValuePosition = this->GetInitialPosition();\n  m_MaximumMetricValuePosition = this->GetInitialPosition();\n\n  m_MaximumMetricValue = this->GetValue( m_MaximumMetricValuePosition );\n  m_MinimumMetricValue = this->GetValue( m_MinimumMetricValuePosition );\n  \n  m_CurrentIteration          = 0;\n  m_MaximumNumberOfIterations = 1;\n  \n  const unsigned int spaceDimension = this->GetInitialPosition().GetSize();\n\n  for (unsigned int i=0; i< spaceDimension; i++)\n    {\n    m_MaximumNumberOfIterations *= 2 * m_NumberOfSteps[i];\n    }\n    \n  m_CurrentIndex.SetSize(spaceDimension);\n  m_CurrentIndex.Fill(0);\n  \n  this->SetCurrentPosition( this->GetInitialPosition() );\n\n  \n  itkDebugMacro(\"Calling ResumeWalking\");\n  \n  this->ResumeWalking();\n\n}\n\n\n\n\n\n\/**\n * Resume the optimization\n *\/\nvoid\nExhaustiveOptimizer\n::ResumeWalking( void )\n{\n  itkDebugMacro(\"ResumeWalk\");\n  m_Stop = false;\n \n  while( !m_Stop ) \n    {\n    ParametersType currentPosition = this->GetCurrentPosition();\n    \n    if( m_Stop )\n      {\n      StopWalking();\n      break;\n      }\n\n    m_CurrentValue = this->GetValue( currentPosition );\n    \n    if (m_CurrentValue > m_MaximumMetricValue) \n      {\n      m_MaximumMetricValue = m_CurrentValue;\n      m_MaximumMetricValuePosition = currentPosition;\n      }\n    if (m_CurrentValue < m_MinimumMetricValue) \n      {\n      m_MinimumMetricValue = m_CurrentValue;\n      m_MinimumMetricValuePosition = currentPosition;\n      }\n     \n\n    \n    if( m_Stop )\n      {\n      this->StopWalking();\n      break;\n      }\n\n    this->AdvanceOneStep();\n\n    m_CurrentIteration++;\n\n    }\n}\n\n\nvoid\nExhaustiveOptimizer\n::StopWalking( void )\n{\n\n  itkDebugMacro(\"StopWalking\");\n  \n  m_Stop = true;\n  this->InvokeEvent( EndEvent() );\n}\n\n\n\nvoid\nExhaustiveOptimizer\n::AdvanceOneStep( void )\n{ \n\n  itkDebugMacro(\"AdvanceOneStep\");\n\n  const unsigned int  spaceDimension =\n    m_CostFunction->GetNumberOfParameters();\n\n  ScalesType     scales = this->GetScales();\n\n\n  \/\/ Make sure the scales have been set properly\n  if (scales.size() != spaceDimension)\n    {\n    itkExceptionMacro(<< \"The size of Scales is \"\n                      << scales.size()\n                      << \", but the NumberOfParameters is \"\n                      << spaceDimension\n                      << \".\");\n    }\n\n\n  ParametersType newPosition( spaceDimension );\n  ParametersType currentPosition = this->GetCurrentPosition();\n\n  IncrementIndex( newPosition );\n\n  \n  itkDebugMacro(<<\"new position = \" << newPosition );\n\n  \n  this->InvokeEvent( IterationEvent() );\n  this->SetCurrentPosition( newPosition );\n\n}\n\nvoid\nExhaustiveOptimizer\n::IncrementIndex( ParametersType &newPosition ) \n{\n\n  unsigned int idx = 0;\n\n  const unsigned int  spaceDimension =\n    m_CostFunction->GetNumberOfParameters();\n\n  while( idx < spaceDimension )\n    {\n    m_CurrentIndex[idx]++;\n\n    if( m_CurrentIndex[idx] > (2*m_NumberOfSteps[idx]))\n      {\n      m_CurrentIndex[idx]=0;\n      idx++;\n      }\n    else\n      {\n      break;\n      }\n    }\n      \n  if( idx==spaceDimension )\n    {\n    m_Stop = true;\n    }\n\n  for(unsigned int i=0; i<spaceDimension; i++)\n    {\n    newPosition[i] = (m_CurrentIndex[i]-m_NumberOfSteps[i]) *\n                      m_StepLength * this->GetScales()[i] + \n                      this->GetInitialPosition()[i];\n    }\n}\n\n\n\nvoid\nExhaustiveOptimizer\n::PrintSelf(std::ostream& os, Indent indent) const\n{\n  Superclass::PrintSelf(os,indent);\n\n  os << indent << \"CurrentValue = \" << m_CurrentValue << std::endl;\n  os << indent << \"NumberOfSteps = \" << m_NumberOfSteps << std::endl;\n  os << indent << \"CurrentIteration = \" << m_CurrentIteration << std::endl;\n  os << indent << \"Stop = \" << m_Stop << std::endl;\n  os << indent << \"CurrentParameter = \" << m_CurrentParameter << std::endl;\n  os << indent << \"StepLength = \" << m_StepLength << std::endl; \n  os << indent << \"CurrentIndex = \" << m_CurrentIndex << std::endl;\n  os << indent << \"MaximumNumberOfIterations = \" << m_MaximumNumberOfIterations << std::endl;\n  os << indent << \"MaximumMetricValue = \" << m_MaximumMetricValue << std::endl;\n  os << indent << \"MinimumMetricValue = \" << m_MinimumMetricValue << std::endl;\n  os << indent << \"MinimumMetricValuePosition = \" << m_MinimumMetricValuePosition << std::endl;\n  os << indent << \"MaximumMetricValuePosition = \" << m_MaximumMetricValuePosition << std::endl;\n}\n\n \n} \/\/ end namespace itk\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\/\/ Main driver function for a vehicle specified through JSON files.\n\/\/\n\/\/ If using the Irrlicht interface, driver inputs are obtained from the keyboard.\n\/\/\n\/\/ The vehicle reference frame has Z up, X towards the front of the vehicle, and\n\/\/ Y pointing to the left.\n\/\/\n\/\/ =============================================================================\n\n#include <vector>\n\n#include \"core\/ChFileutils.h\"\n#include \"core\/ChStream.h\"\n#include \"core\/ChRealtimeStep.h\"\n#include \"physics\/ChSystem.h\"\n#include \"physics\/ChLinkDistance.h\"\n\n#include \"ChronoT_config.h\"\n\n#include \"utils\/ChUtilsInputOutput.h\"\n#include \"utils\/ChUtilsData.h\"\n\n#include \"subsys\/vehicle\/Vehicle.h\"\n#include \"subsys\/powertrain\/SimplePowertrain.h\"\n#include \"subsys\/driver\/ChDataDriver.h\"\n#include \"subsys\/tire\/RigidTire.h\"\n#include \"subsys\/terrain\/RigidTerrain.h\"\n\n\/\/ If Irrlicht support is available...\n#if IRRLICHT_ENABLED\n  \/\/ ...include additional headers\n# include \"unit_IRRLICHT\/ChIrrApp.h\"\n# include \"subsys\/driver\/ChIrrGuiDriver.h\"\n\n  \/\/ ...and specify whether the demo should actually use Irrlicht\n# define USE_IRRLICHT\n#endif\n\nusing namespace chrono;\n\n\/\/ =============================================================================\n\n\/\/ JSON file for vehicle model\nstd::string vehicle_file = utils::GetModelDataFile(\"hmmwv\/vehicle\/HMMWV_Vehicle.json\");\n\/\/std::string vehicle_file = utils::GetModelDataFile(\"generic\/vehicle\/Vehicle_DoubleWishbones.json\");\n\/\/std::string vehicle_file = utils::GetModelDataFile(\"generic\/vehicle\/Vehicle_MultiLinks.json\");\n\/\/std::string vehicle_file = utils::GetModelDataFile(\"generic\/vehicle\/Vehicle_SolidAxles.json\");\n\/\/std::string vehicle_file = utils::GetModelDataFile(\"generic\/vehicle\/Vehicle_ThreeAxles.json\");\n\n\/\/ JSON files for tire models (rigid) and powertrain (simple)\nstd::string rigidtire_file = utils::GetModelDataFile(\"hmmwv\/tire\/HMMWV_RigidTire.json\");\nstd::string simplepowertrain_file = utils::GetModelDataFile(\"hmmwv\/powertrain\/HMMWV_SimplePowertrain.json\");\n\n\/\/ Driver input file (if not using Irrlicht)\nstd::string driver_file = utils::GetModelDataFile(\"generic\/driver\/Sample_Maneuver.txt\");\n\n\/\/ Initial vehicle position\nChVector<> initLoc(0, 0, 1.0);\n\n\/\/ Initial vehicle orientation\nChQuaternion<> initRot(1, 0, 0, 0);\n\/\/ChQuaternion<> initRot(0.866025, 0, 0, 0.5);\n\/\/ChQuaternion<> initRot(0.7071068, 0, 0, 0.7071068);\n\/\/ChQuaternion<> initRot(0.25882, 0, 0, 0.965926);\n\/\/ChQuaternion<> initRot(0, 0, 0, 1);\n\n\/\/ Rigid terrain dimensions\ndouble terrainHeight = 0;\ndouble terrainLength = 100.0;   \/\/ size in X direction\ndouble terrainWidth  = 100.0;   \/\/ size in Y direction\n\n\/\/ Simulation step size\ndouble step_size = 0.001;\n\n\/\/ Time interval between two render frames\ndouble render_step_size = 1.0 \/ 50;   \/\/ FPS = 50\n\n\/\/ Time interval between two output frames\ndouble output_step_size = 1.0 \/ 1;    \/\/ once a second\n\n#ifdef USE_IRRLICHT\n  \/\/ Point on chassis tracked by the camera\n  ChVector<> trackPoint(0.0, 0.0, 1.75);\n#else\n  double tend = 20.0;\n\n  const std::string out_dir = \"..\/VEHICLE\";\n  const std::string pov_dir = out_dir + \"\/POVRAY\";\n#endif\n\n\/\/ =============================================================================\n\nint main(int argc, char* argv[])\n{\n  SetChronoDataPath(CHRONO_DATA_DIR);\n\n  \/\/ --------------------------\n  \/\/ Create the various modules\n  \/\/ --------------------------\n\n  \/\/ Create the vehicle system\n  Vehicle vehicle(vehicle_file, false);\n  vehicle.Initialize(ChCoordsys<>(initLoc, initRot));\n\n  \/\/ Create the ground\n  RigidTerrain terrain(vehicle, terrainHeight, terrainLength, terrainWidth, 0.8);\n\n  \/\/ Create and initialize the powertrain system\n  SimplePowertrain powertrain(simplepowertrain_file);\n  powertrain.Initialize();\n\n  \/\/ Create and initialize the tires\n  int num_axles = vehicle.GetNumberAxles();\n  int num_wheels = 2 * num_axles;\n  std::vector<ChSharedPtr<ChTire> > tires(num_wheels);\n\n  for (int i = 0; i < num_wheels; i++) {\n    ChSharedPtr<RigidTire> tire(new RigidTire(rigidtire_file, terrain));\n    tire->Initialize(vehicle.GetWheelBody(i));\n    tires[i] = tire;\n  }\n\n#ifdef USE_IRRLICHT\n  irr::ChIrrApp application(&vehicle,\n                            L\"Vehicle demo\",\n                            irr::core::dimension2d<irr::u32>(1000, 800),\n                            false,\n                            true);\n\n  \/\/ make a skybox that has Z pointing up (default application.AddTypicalSky() makes Y up) \n  std::string mtexturedir = GetChronoDataFile(\"skybox\/\");\n  std::string str_lf = mtexturedir + \"sky_lf.jpg\";\n  std::string str_up = mtexturedir + \"sky_up.jpg\";\n  std::string str_dn = mtexturedir + \"sky_dn.jpg\";\n  irr::video::ITexture* map_skybox_side = \n      application.GetVideoDriver()->getTexture(str_lf.c_str());\n  irr::scene::ISceneNode* mbox = application.GetSceneManager()->addSkyBoxSceneNode(\n      application.GetVideoDriver()->getTexture(str_up.c_str()),\n      application.GetVideoDriver()->getTexture(str_dn.c_str()),\n      map_skybox_side,\n      map_skybox_side,\n      map_skybox_side,\n      map_skybox_side);\n  mbox->setRotation( irr::core::vector3df(90,0,0));\n \n  bool do_shadows = true; \/\/ shadow map is experimental\n  irr::scene::ILightSceneNode* mlight = 0;\n\n  if (do_shadows)\n  {\n    mlight = application.AddLightWithShadow(\n      irr::core::vector3df(10.f, 30.f, 60.f),\n      irr::core::vector3df(0.f, 0.f, 0.f),\n      150, 60, 80, 15, 512, irr::video::SColorf(1, 1, 1), false, false);\n  }\n  else\n  {\n    application.AddTypicalLights(\n      irr::core::vector3df(30.f, -30.f, 100.f),\n      irr::core::vector3df(30.f, 50.f, 100.f),\n      250, 130);\n  }\n\n  application.SetTimestep(step_size);\n\n  ChIrrGuiDriver driver(application, vehicle, powertrain, trackPoint, 6.0, 0.5, true);\n\n  \/\/ Set the time response for steering and throttle keyboard inputs.\n  \/\/ NOTE: this is not exact, since we do not render quite at the specified FPS.\n  double steering_time = 1.0;  \/\/ time to go from 0 to +1 (or from 0 to -1)\n  double throttle_time = 1.0;  \/\/ time to go from 0 to +1\n  double braking_time = 0.3;   \/\/ time to go from 0 to +1\n  driver.SetSteeringDelta(render_step_size \/ steering_time);\n  driver.SetThrottleDelta(render_step_size \/ throttle_time);\n  driver.SetBrakingDelta(render_step_size \/ braking_time);\n\n  \/\/ Set up the assets for rendering\n  application.AssetBindAll();\n  application.AssetUpdateAll();\n  if (do_shadows)\n  {\n    application.AddShadowAll();\n  }\n#else\n  ChDataDriver driver(driver_file);\n#endif\n\n\n  \/\/ ---------------\n  \/\/ Simulation loop\n  \/\/ ---------------\n\n  \/\/ Inter-module communication data\n  ChTireForces   tire_forces(num_wheels);\n  ChWheelStates  wheel_states(num_wheels);\n  double         driveshaft_speed;\n  double         powertrain_torque;\n  double         throttle_input;\n  double         steering_input;\n  double         braking_input;\n\n  \/\/ Number of simulation steps between two 3D view render frames\n  int render_steps = (int)std::ceil(render_step_size \/ step_size);\n\n  \/\/ Number of simulation steps between two output frames\n  int output_steps = (int)std::ceil(output_step_size \/ step_size);\n\n  \/\/ Initialize simulation frame counter and simulation time\n  int step_number = 0;\n  double time = 0;\n\n#ifdef USE_IRRLICHT\n\n  ChRealtimeStepTimer realtime_timer;\n\n  while (application.GetDevice()->run())\n  {\n    \/\/ update the position of the shadow mapping so that it follows the car\n    if (do_shadows)\n    {\n      ChVector<> lightaim = vehicle.GetChassisPos();\n      ChVector<> lightpos = vehicle.GetChassisPos() + ChVector<>(10, 30, 60);\n      irr::core::vector3df mlightpos((irr::f32)lightpos.x, (irr::f32)lightpos.y, (irr::f32)lightpos.z);\n      irr::core::vector3df mlightaim((irr::f32)lightaim.x, (irr::f32)lightaim.y, (irr::f32)lightaim.z);\n      application.GetEffects()->getShadowLight(0).setPosition(mlightpos);\n      application.GetEffects()->getShadowLight(0).setTarget(mlightaim);\n      mlight->setPosition(mlightpos);\n    }\n\n    \/\/ Render scene\n    if (step_number % render_steps == 0) {\n      application.GetVideoDriver()->beginScene(true, true, irr::video::SColor(255, 140, 161, 192));\n      driver.DrawAll();\n      application.GetVideoDriver()->endScene();\n    }\n\n    \/\/ Collect output data from modules (for inter-module communication)\n    throttle_input = driver.GetThrottle();\n    steering_input = driver.GetSteering();\n    braking_input = driver.GetBraking();\n    powertrain_torque = powertrain.GetOutputTorque();\n    driveshaft_speed = vehicle.GetDriveshaftSpeed();\n    for (int i = 0; i < num_wheels; i++) {\n      tire_forces[i] = tires[i]->GetTireForce();\n      wheel_states[i] = vehicle.GetWheelState(i);\n    }\n\n    \/\/ Update modules (process inputs from other modules)\n    time = vehicle.GetChTime();\n    driver.Update(time);\n    powertrain.Update(time, throttle_input, driveshaft_speed);\n    vehicle.Update(time, steering_input, braking_input, powertrain_torque, tire_forces);\n    terrain.Update(time);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Update(time, wheel_states[i]);\n\n    \/\/ Advance simulation for one timestep for all modules\n    double step = realtime_timer.SuggestSimulationStep(step_size);\n    driver.Advance(step);\n    powertrain.Advance(step);\n    vehicle.Advance(step);\n    terrain.Advance(step);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Advance(step);\n\n    \/\/ Increment frame number\n    step_number++;\n  }\n\n  application.GetDevice()->drop();\n\n#else\n\n  int render_frame = 0;\n\n  if(ChFileutils::MakeDirectory(out_dir.c_str()) < 0) {\n    std::cout << \"Error creating directory \" << out_dir << std::endl;\n    return 1;\n  }\n  if(ChFileutils::MakeDirectory(pov_dir.c_str()) < 0) {\n    std::cout << \"Error creating directory \" << pov_dir << std::endl;\n    return 1;\n  }\n\n  vehicle.ExportMeshPovray(out_dir);\n\n  char filename[100];\n\n  while (time < tend)\n  {\n    if (step_number % render_steps == 0) {\n      \/\/ Output render data\n      sprintf(filename, \"%s\/data_%03d.dat\", pov_dir.c_str(), render_frame + 1);\n      utils::WriteShapesPovray(&vehicle, filename);\n      std::cout << \"Output frame:   \" << render_frame << std::endl;\n      std::cout << \"Sim frame:      \" << step_number << std::endl;\n      std::cout << \"Time:           \" << time << std::endl;\n      std::cout << \"   throttle: \" << driver.GetThrottle()\n                << \"   steering: \" << driver.GetSteering()\n                << \"   braking:  \" << driver.GetBraking() << std::endl;\n      std::cout << std::endl;\n      render_frame++;\n    }\n\n    \/\/ Collect output data from modules (for inter-module communication)\n    throttle_input = driver.GetThrottle();\n    steering_input = driver.GetSteering();\n    braking_input = driver.GetBraking();\n    powertrain_torque = powertrain.GetOutputTorque();\n    driveshaft_speed = vehicle.GetDriveshaftSpeed();\n    for (int i = 0; i < num_wheels; i++) {\n      tire_forces[i] = tires[i]->GetTireForce();\n      wheel_states[i] = vehicle.GetWheelState(i);\n    }\n\n    \/\/ Update modules (process inputs from other modules)\n    time = vehicle.GetChTime();\n    driver.Update(time);\n    powertrain.Update(time, throttle_input, driveshaft_speed);\n    vehicle.Update(time, steering_input, braking_input, powertrain_torque, tire_forces);\n    terrain.Update(time);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Update(time, wheel_states[i]);\n\n    \/\/ Update modules (process inputs from other modules)\n    time = vehicle.GetChTime();\n    driver.Update(time);\n    powertrain.Update(time, throttle_input, driveshaft_speed);\n    vehicle.Update(time, steering_input, braking_input, powertrain_torque, tire_forces);\n    terrain.Update(time);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Update(time, wheel_states[i]);\n\n    \/\/ Advance simulation for one timestep for all modules\n    driver.Advance(step_size);\n    powertrain.Advance(step_size);\n    vehicle.Advance(step_size);\n    terrain.Advance(step_size);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Advance(step_size);\n\n    \/\/ Increment frame number\n    step_number++;\n  }\n\n#endif\n\n  return 0;\n}\n<commit_msg>add Vehicle.DebugLog() to the demo_Vehicle main loop.<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\/\/ Main driver function for a vehicle specified through JSON files.\n\/\/\n\/\/ If using the Irrlicht interface, driver inputs are obtained from the keyboard.\n\/\/\n\/\/ The vehicle reference frame has Z up, X towards the front of the vehicle, and\n\/\/ Y pointing to the left.\n\/\/\n\/\/ =============================================================================\n\n#include <vector>\n\n#include \"core\/ChFileutils.h\"\n#include \"core\/ChStream.h\"\n#include \"core\/ChRealtimeStep.h\"\n#include \"physics\/ChSystem.h\"\n#include \"physics\/ChLinkDistance.h\"\n\n#include \"ChronoT_config.h\"\n\n#include \"utils\/ChUtilsInputOutput.h\"\n#include \"utils\/ChUtilsData.h\"\n\n#include \"subsys\/vehicle\/Vehicle.h\"\n#include \"subsys\/powertrain\/SimplePowertrain.h\"\n#include \"subsys\/driver\/ChDataDriver.h\"\n#include \"subsys\/tire\/RigidTire.h\"\n#include \"subsys\/terrain\/RigidTerrain.h\"\n\n\/\/ If Irrlicht support is available...\n#if IRRLICHT_ENABLED\n  \/\/ ...include additional headers\n# include \"unit_IRRLICHT\/ChIrrApp.h\"\n# include \"subsys\/driver\/ChIrrGuiDriver.h\"\n\n  \/\/ ...and specify whether the demo should actually use Irrlicht\n# define USE_IRRLICHT\n#endif\n\n\/\/ DEBUGGING: uncomment to print debug info\n#define DEBUG_LOG\n\nusing namespace chrono;\n\n\/\/ =============================================================================\n\n\/\/ JSON file for vehicle model\nstd::string vehicle_file = utils::GetModelDataFile(\"hmmwv\/vehicle\/HMMWV_Vehicle_balanced.json\");\n\/\/std::string vehicle_file = utils::GetModelDataFile(\"generic\/vehicle\/Vehicle_DoubleWishbones.json\");\n\/\/std::string vehicle_file = utils::GetModelDataFile(\"generic\/vehicle\/Vehicle_MultiLinks.json\");\n\/\/std::string vehicle_file = utils::GetModelDataFile(\"generic\/vehicle\/Vehicle_SolidAxles.json\");\n\/\/std::string vehicle_file = utils::GetModelDataFile(\"generic\/vehicle\/Vehicle_ThreeAxles.json\");\n\n\/\/ JSON files for tire models (rigid) and powertrain (simple)\nstd::string rigidtire_file = utils::GetModelDataFile(\"hmmwv\/tire\/HMMWV_RigidTire.json\");\nstd::string simplepowertrain_file = utils::GetModelDataFile(\"hmmwv\/powertrain\/HMMWV_SimplePowertrain.json\");\n\n\/\/ Driver input file (if not using Irrlicht)\nstd::string driver_file = utils::GetModelDataFile(\"generic\/driver\/Sample_Maneuver.txt\");\n\n\/\/ Initial vehicle position\nChVector<> initLoc(0, 0, 1.0);\n\n\/\/ Initial vehicle orientation\nChQuaternion<> initRot(1, 0, 0, 0);\n\/\/ChQuaternion<> initRot(0.866025, 0, 0, 0.5);\n\/\/ChQuaternion<> initRot(0.7071068, 0, 0, 0.7071068);\n\/\/ChQuaternion<> initRot(0.25882, 0, 0, 0.965926);\n\/\/ChQuaternion<> initRot(0, 0, 0, 1);\n\n\/\/ Rigid terrain dimensions\ndouble terrainHeight = 0;\ndouble terrainLength = 100.0;   \/\/ size in X direction\ndouble terrainWidth  = 100.0;   \/\/ size in Y direction\n\n\/\/ Simulation step size\ndouble step_size = 0.001;\n\n\/\/ Time interval between two render frames\ndouble render_step_size = 1.0 \/ 50;   \/\/ FPS = 50\n\n\/\/ Time interval between two output frames\ndouble output_step_size = 1.0 \/ 1;    \/\/ once a second\n\n#ifdef USE_IRRLICHT\n  \/\/ Point on chassis tracked by the camera\n  ChVector<> trackPoint(0.0, 0.0, 1.75);\n#else\n  double tend = 20.0;\n\n  const std::string out_dir = \"..\/VEHICLE\";\n  const std::string pov_dir = out_dir + \"\/POVRAY\";\n#endif\n\n\/\/ =============================================================================\n\nint main(int argc, char* argv[])\n{\n  SetChronoDataPath(CHRONO_DATA_DIR);\n\n  \/\/ --------------------------\n  \/\/ Create the various modules\n  \/\/ --------------------------\n\n  \/\/ Create the vehicle system\n  Vehicle vehicle(vehicle_file, false);\n  vehicle.Initialize(ChCoordsys<>(initLoc, initRot));\n\n  \/\/ Create the ground\n  RigidTerrain terrain(vehicle, terrainHeight, terrainLength, terrainWidth, 0.8);\n\n  \/\/ Create and initialize the powertrain system\n  SimplePowertrain powertrain(simplepowertrain_file);\n  powertrain.Initialize();\n\n  \/\/ Create and initialize the tires\n  int num_axles = vehicle.GetNumberAxles();\n  int num_wheels = 2 * num_axles;\n  std::vector<ChSharedPtr<ChTire> > tires(num_wheels);\n\n  for (int i = 0; i < num_wheels; i++) {\n    ChSharedPtr<RigidTire> tire(new RigidTire(rigidtire_file, terrain));\n    tire->Initialize(vehicle.GetWheelBody(i));\n    tires[i] = tire;\n  }\n\n#ifdef USE_IRRLICHT\n  irr::ChIrrApp application(&vehicle,\n                            L\"Vehicle demo\",\n                            irr::core::dimension2d<irr::u32>(1000, 800),\n                            false,\n                            true);\n\n  \/\/ make a skybox that has Z pointing up (default application.AddTypicalSky() makes Y up) \n  std::string mtexturedir = GetChronoDataFile(\"skybox\/\");\n  std::string str_lf = mtexturedir + \"sky_lf.jpg\";\n  std::string str_up = mtexturedir + \"sky_up.jpg\";\n  std::string str_dn = mtexturedir + \"sky_dn.jpg\";\n  irr::video::ITexture* map_skybox_side = \n      application.GetVideoDriver()->getTexture(str_lf.c_str());\n  irr::scene::ISceneNode* mbox = application.GetSceneManager()->addSkyBoxSceneNode(\n      application.GetVideoDriver()->getTexture(str_up.c_str()),\n      application.GetVideoDriver()->getTexture(str_dn.c_str()),\n      map_skybox_side,\n      map_skybox_side,\n      map_skybox_side,\n      map_skybox_side);\n  mbox->setRotation( irr::core::vector3df(90,0,0));\n \n  bool do_shadows = true; \/\/ shadow map is experimental\n  irr::scene::ILightSceneNode* mlight = 0;\n\n  if (do_shadows)\n  {\n    mlight = application.AddLightWithShadow(\n      irr::core::vector3df(10.f, 30.f, 60.f),\n      irr::core::vector3df(0.f, 0.f, 0.f),\n      150, 60, 80, 15, 512, irr::video::SColorf(1, 1, 1), false, false);\n  }\n  else\n  {\n    application.AddTypicalLights(\n      irr::core::vector3df(30.f, -30.f, 100.f),\n      irr::core::vector3df(30.f, 50.f, 100.f),\n      250, 130);\n  }\n\n  application.SetTimestep(step_size);\n\n  ChIrrGuiDriver driver(application, vehicle, powertrain, trackPoint, 6.0, 0.5, true);\n\n  \/\/ Set the time response for steering and throttle keyboard inputs.\n  \/\/ NOTE: this is not exact, since we do not render quite at the specified FPS.\n  double steering_time = 1.0;  \/\/ time to go from 0 to +1 (or from 0 to -1)\n  double throttle_time = 1.0;  \/\/ time to go from 0 to +1\n  double braking_time = 0.3;   \/\/ time to go from 0 to +1\n  driver.SetSteeringDelta(render_step_size \/ steering_time);\n  driver.SetThrottleDelta(render_step_size \/ throttle_time);\n  driver.SetBrakingDelta(render_step_size \/ braking_time);\n\n  \/\/ Set up the assets for rendering\n  application.AssetBindAll();\n  application.AssetUpdateAll();\n  if (do_shadows)\n  {\n    application.AddShadowAll();\n  }\n#else\n  ChDataDriver driver(driver_file);\n#endif\n\n  \/\/ ---------------\n  \/\/ Simulation loop\n  \/\/ ---------------\n\n  \/\/ Inter-module communication data\n  ChTireForces   tire_forces(num_wheels);\n  ChWheelStates  wheel_states(num_wheels);\n  double         driveshaft_speed;\n  double         powertrain_torque;\n  double         throttle_input;\n  double         steering_input;\n  double         braking_input;\n\n  \/\/ Number of simulation steps between two 3D view render frames\n  int render_steps = (int)std::ceil(render_step_size \/ step_size);\n\n  \/\/ Number of simulation steps between two output frames\n  int output_steps = (int)std::ceil(output_step_size \/ step_size);\n\n  \/\/ Initialize simulation frame counter and simulation time\n  int step_number = 0;\n  double time = 0;\n\n#ifdef USE_IRRLICHT\n\n  ChRealtimeStepTimer realtime_timer;\n\n  while (application.GetDevice()->run())\n  {\n    \/\/ update the position of the shadow mapping so that it follows the car\n    if (do_shadows)\n    {\n      ChVector<> lightaim = vehicle.GetChassisPos();\n      ChVector<> lightpos = vehicle.GetChassisPos() + ChVector<>(10, 30, 60);\n      irr::core::vector3df mlightpos((irr::f32)lightpos.x, (irr::f32)lightpos.y, (irr::f32)lightpos.z);\n      irr::core::vector3df mlightaim((irr::f32)lightaim.x, (irr::f32)lightaim.y, (irr::f32)lightaim.z);\n      application.GetEffects()->getShadowLight(0).setPosition(mlightpos);\n      application.GetEffects()->getShadowLight(0).setTarget(mlightaim);\n      mlight->setPosition(mlightpos);\n    }\n\n    \/\/ Render scene\n    if (step_number % render_steps == 0) {\n      application.GetVideoDriver()->beginScene(true, true, irr::video::SColor(255, 140, 161, 192));\n      driver.DrawAll();\n      application.GetVideoDriver()->endScene();\n    }\n\n#ifdef DEBUG_LOG\n    if (step_number % output_steps == 0) {\n      GetLog() << \"\\n\\n============ System Information ============\\n\";\n      GetLog() << \"Time = \" << time << \"\\n\\n\";\n      vehicle.DebugLog(DBG_SPRINGS);\n    }\n#endif\n\n    \/\/ Collect output data from modules (for inter-module communication)\n    throttle_input = driver.GetThrottle();\n    steering_input = driver.GetSteering();\n    braking_input = driver.GetBraking();\n    powertrain_torque = powertrain.GetOutputTorque();\n    driveshaft_speed = vehicle.GetDriveshaftSpeed();\n    for (int i = 0; i < num_wheels; i++) {\n      tire_forces[i] = tires[i]->GetTireForce();\n      wheel_states[i] = vehicle.GetWheelState(i);\n    }\n\n    \/\/ Update modules (process inputs from other modules)\n    time = vehicle.GetChTime();\n    driver.Update(time);\n    powertrain.Update(time, throttle_input, driveshaft_speed);\n    vehicle.Update(time, steering_input, braking_input, powertrain_torque, tire_forces);\n    terrain.Update(time);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Update(time, wheel_states[i]);\n\n    \/\/ Advance simulation for one timestep for all modules\n    double step = realtime_timer.SuggestSimulationStep(step_size);\n    driver.Advance(step);\n    powertrain.Advance(step);\n    vehicle.Advance(step);\n    terrain.Advance(step);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Advance(step);\n\n    \/\/ Increment frame number\n    step_number++;\n  }\n\n  application.GetDevice()->drop();\n\n#else\n\n  int render_frame = 0;\n\n  if(ChFileutils::MakeDirectory(out_dir.c_str()) < 0) {\n    std::cout << \"Error creating directory \" << out_dir << std::endl;\n    return 1;\n  }\n  if(ChFileutils::MakeDirectory(pov_dir.c_str()) < 0) {\n    std::cout << \"Error creating directory \" << pov_dir << std::endl;\n    return 1;\n  }\n\n  vehicle.ExportMeshPovray(out_dir);\n\n  char filename[100];\n\n  while (time < tend)\n  {\n    if (step_number % render_steps == 0) {\n      \/\/ Output render data\n      sprintf(filename, \"%s\/data_%03d.dat\", pov_dir.c_str(), render_frame + 1);\n      utils::WriteShapesPovray(&vehicle, filename);\n      std::cout << \"Output frame:   \" << render_frame << std::endl;\n      std::cout << \"Sim frame:      \" << step_number << std::endl;\n      std::cout << \"Time:           \" << time << std::endl;\n      std::cout << \"   throttle: \" << driver.GetThrottle()\n                << \"   steering: \" << driver.GetSteering()\n                << \"   braking:  \" << driver.GetBraking() << std::endl;\n      std::cout << std::endl;\n      render_frame++;\n    }\n\n    \/\/ Collect output data from modules (for inter-module communication)\n    throttle_input = driver.GetThrottle();\n    steering_input = driver.GetSteering();\n    braking_input = driver.GetBraking();\n    powertrain_torque = powertrain.GetOutputTorque();\n    driveshaft_speed = vehicle.GetDriveshaftSpeed();\n    for (int i = 0; i < num_wheels; i++) {\n      tire_forces[i] = tires[i]->GetTireForce();\n      wheel_states[i] = vehicle.GetWheelState(i);\n    }\n\n    \/\/ Update modules (process inputs from other modules)\n    time = vehicle.GetChTime();\n    driver.Update(time);\n    powertrain.Update(time, throttle_input, driveshaft_speed);\n    vehicle.Update(time, steering_input, braking_input, powertrain_torque, tire_forces);\n    terrain.Update(time);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Update(time, wheel_states[i]);\n\n    \/\/ Update modules (process inputs from other modules)\n    time = vehicle.GetChTime();\n    driver.Update(time);\n    powertrain.Update(time, throttle_input, driveshaft_speed);\n    vehicle.Update(time, steering_input, braking_input, powertrain_torque, tire_forces);\n    terrain.Update(time);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Update(time, wheel_states[i]);\n\n    \/\/ Advance simulation for one timestep for all modules\n    driver.Advance(step_size);\n    powertrain.Advance(step_size);\n    vehicle.Advance(step_size);\n    terrain.Advance(step_size);\n    for (int i = 0; i < num_wheels; i++)\n      tires[i]->Advance(step_size);\n\n    \/\/ Increment frame number\n    step_number++;\n  }\n\n#endif\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MJOLNIR_CORE_FORCE_FIELD_HPP\n#define MJOLNIR_CORE_FORCE_FIELD_HPP\n#include <mjolnir\/core\/LocalForceField.hpp>\n#include <mjolnir\/core\/GlobalForceField.hpp>\n#include <mjolnir\/core\/ExternalForceField.hpp>\n\nnamespace mjolnir\n{\n\ntemplate<typename traitsT>\nclass ForceField\n{\n  public:\n    using traits_type              = traitsT;\n    using real_type                = typename traits_type::real_type;\n    using coordinate_type          = typename traits_type::coordinate_type;\n    using system_type              = System<traits_type>;\n    using local_forcefield_type    = LocalForceField<traits_type>;\n    using global_forcefield_type   = GlobalForceField<traits_type>;\n    using external_forcefield_type = ExternalForceField<traits_type>;\n\n  public:\n\n    ForceField(local_forcefield_type&& local, global_forcefield_type&& global)\n        : local_(std::move(local)), global_(std::move(global))\n    {}\n\n    ForceField(local_forcefield_type&&    local,\n               global_forcefield_type&&   global,\n               external_forcefield_type&& external)\n        : local_(std::move(local)), global_(std::move(global)),\n          external_(std::move(external))\n    {}\n\n    ForceField()  = default;\n    ~ForceField() = default;\n    ForceField(const ForceField&) = delete;\n    ForceField(ForceField&&)      = default;\n    ForceField& operator=(const ForceField&) = delete;\n    ForceField& operator=(ForceField&&)      = default;\n\n    \/\/ this modify system::topology by using local interaction info.\n    void initialize(system_type& sys)\n    {\n        \/\/ first, fetch current topology\n        local_.write_topology(sys.topology());\n        sys.topology().construct_molecules();\n\n        \/\/ based on the topology, make exclusion list\n        local_   .initialize(sys);\n        global_  .initialize(sys);\n        external_.initialize(sys);\n    }\n\n    \/\/ update parameters like temperature, ionic concentration, etc...\n    void update(const system_type& sys)\n    {\n        local_   .update(sys);\n        global_  .update(sys);\n        external_.update(sys);\n    }\n\n    \/\/ update margin of neighbor list\n    void update_margin(const real_type dmargin, const system_type& sys)\n    {\n        \/\/ TODO:\n        \/\/ dmargin is a maximum (safe) length to reduce the margin. Since global\n        \/\/ forcefields calculate forces between particles, the safe length is\n        \/\/ mostly 2 * (largest displacement in the step). It is dmargin.\n        \/\/ However, since external forcefields calculate forces between particle\n        \/\/ and an external field, the safe length can be just the largest\n        \/\/ displacement in the step. The current implementation overestimate the\n        \/\/ safe length for the external forcefields (it's correct for global\n        \/\/ forcefields). In most cases, the most time-consuming part is global\n        \/\/ forcefields, so I implemented in this way for now. If some idea that\n        \/\/ works more efficiently is came up, this part would be re-implemented.\n        local_   .update_margin(dmargin, sys);\n        global_  .update_margin(dmargin, sys);\n        external_.update_margin(dmargin, sys);\n    }\n\n    void calc_force(system_type& sys) const noexcept\n    {\n        local_   .calc_force(sys);\n        global_  .calc_force(sys);\n        external_.calc_force(sys);\n    }\n    real_type calc_energy(const system_type& sys) const noexcept\n    {\n        return local_.calc_energy(sys) + global_.calc_energy(sys) +\n            external_.calc_energy(sys);\n    }\n\n    std::string list_energy_name() const\n    {\n        return local_.list_energy() + global_.list_energy() +\n            external_.list_energy();\n    }\n    std::string dump_energy(const system_type& sys) const\n    {\n        return local_.dump_energy(sys) + global_.dump_energy(sys) +\n            external_.dump_energy(sys);\n    }\n\n    local_forcefield_type    const& local()    const noexcept {return local_;}\n    local_forcefield_type    &      local()          noexcept {return local_;}\n    global_forcefield_type   const& global()   const noexcept {return global_;}\n    global_forcefield_type   &      global()         noexcept {return global_;}\n    external_forcefield_type const& external() const noexcept {return external_;}\n    external_forcefield_type &      external()       noexcept {return external_;}\n\n  private:\n\n    local_forcefield_type    local_;\n    global_forcefield_type   global_;\n    external_forcefield_type external_;\n};\n\n#ifdef MJOLNIR_SEPARATE_BUILD\nextern template class ForceField<SimulatorTraits<double, UnlimitedBoundary>>;\nextern template class ForceField<SimulatorTraits<float,  UnlimitedBoundary>>;\nextern template class ForceField<SimulatorTraits<double, CuboidalPeriodicBoundary>>;\nextern template class ForceField<SimulatorTraits<float,  CuboidalPeriodicBoundary>>;\n#endif\n\n} \/\/ mjolnir\n#endif \/* MJOLNIR_FORCE_FIELD *\/\n<commit_msg>refactor: remove unused constructor<commit_after>#ifndef MJOLNIR_CORE_FORCE_FIELD_HPP\n#define MJOLNIR_CORE_FORCE_FIELD_HPP\n#include <mjolnir\/core\/LocalForceField.hpp>\n#include <mjolnir\/core\/GlobalForceField.hpp>\n#include <mjolnir\/core\/ExternalForceField.hpp>\n\nnamespace mjolnir\n{\n\ntemplate<typename traitsT>\nclass ForceField\n{\n  public:\n    using traits_type              = traitsT;\n    using real_type                = typename traits_type::real_type;\n    using coordinate_type          = typename traits_type::coordinate_type;\n    using system_type              = System<traits_type>;\n    using local_forcefield_type    = LocalForceField<traits_type>;\n    using global_forcefield_type   = GlobalForceField<traits_type>;\n    using external_forcefield_type = ExternalForceField<traits_type>;\n\n  public:\n\n    ForceField(local_forcefield_type&&    local,\n               global_forcefield_type&&   global,\n               external_forcefield_type&& external)\n        : local_(std::move(local)), global_(std::move(global)),\n          external_(std::move(external))\n    {}\n\n    ForceField()  = default;\n    ~ForceField() = default;\n    ForceField(const ForceField&) = delete;\n    ForceField(ForceField&&)      = default;\n    ForceField& operator=(const ForceField&) = delete;\n    ForceField& operator=(ForceField&&)      = default;\n\n    \/\/ this modify system::topology by using local interaction info.\n    void initialize(system_type& sys)\n    {\n        \/\/ first, fetch current topology\n        local_.write_topology(sys.topology());\n        sys.topology().construct_molecules();\n\n        \/\/ based on the topology, make exclusion list\n        local_   .initialize(sys);\n        global_  .initialize(sys);\n        external_.initialize(sys);\n    }\n\n    \/\/ update parameters like temperature, ionic concentration, etc...\n    void update(const system_type& sys)\n    {\n        local_   .update(sys);\n        global_  .update(sys);\n        external_.update(sys);\n    }\n\n    \/\/ update margin of neighbor list\n    void update_margin(const real_type dmargin, const system_type& sys)\n    {\n        \/\/ TODO:\n        \/\/ dmargin is a maximum (safe) length to reduce the margin. Since global\n        \/\/ forcefields calculate forces between particles, the safe length is\n        \/\/ mostly 2 * (largest displacement in the step). It is dmargin.\n        \/\/ However, since external forcefields calculate forces between particle\n        \/\/ and an external field, the safe length can be just the largest\n        \/\/ displacement in the step. The current implementation overestimate the\n        \/\/ safe length for the external forcefields (it's correct for global\n        \/\/ forcefields). In most cases, the most time-consuming part is global\n        \/\/ forcefields, so I implemented in this way for now. If some idea that\n        \/\/ works more efficiently is came up, this part would be re-implemented.\n        local_   .update_margin(dmargin, sys);\n        global_  .update_margin(dmargin, sys);\n        external_.update_margin(dmargin, sys);\n    }\n\n    void calc_force(system_type& sys) const noexcept\n    {\n        local_   .calc_force(sys);\n        global_  .calc_force(sys);\n        external_.calc_force(sys);\n    }\n    real_type calc_energy(const system_type& sys) const noexcept\n    {\n        return local_.calc_energy(sys) + global_.calc_energy(sys) +\n            external_.calc_energy(sys);\n    }\n\n    std::string list_energy_name() const\n    {\n        return local_.list_energy() + global_.list_energy() +\n            external_.list_energy();\n    }\n    std::string dump_energy(const system_type& sys) const\n    {\n        return local_.dump_energy(sys) + global_.dump_energy(sys) +\n            external_.dump_energy(sys);\n    }\n\n    local_forcefield_type    const& local()    const noexcept {return local_;}\n    local_forcefield_type    &      local()          noexcept {return local_;}\n    global_forcefield_type   const& global()   const noexcept {return global_;}\n    global_forcefield_type   &      global()         noexcept {return global_;}\n    external_forcefield_type const& external() const noexcept {return external_;}\n    external_forcefield_type &      external()       noexcept {return external_;}\n\n  private:\n\n    local_forcefield_type    local_;\n    global_forcefield_type   global_;\n    external_forcefield_type external_;\n};\n\n#ifdef MJOLNIR_SEPARATE_BUILD\nextern template class ForceField<SimulatorTraits<double, UnlimitedBoundary>>;\nextern template class ForceField<SimulatorTraits<float,  UnlimitedBoundary>>;\nextern template class ForceField<SimulatorTraits<double, CuboidalPeriodicBoundary>>;\nextern template class ForceField<SimulatorTraits<float,  CuboidalPeriodicBoundary>>;\n#endif\n\n} \/\/ mjolnir\n#endif \/* MJOLNIR_FORCE_FIELD *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file\n\/\/ for details. All rights reserved. Use of this source code is governed by a\n\/\/ BSD-style license that can be found in the LICENSE file.\n\n#include \"platform\/assert.h\"\n#include \"platform\/globals.h\"\n#include \"vm\/unit_test.h\"\n\n#include \"bin\/eventhandler.h\"\n\nnamespace dart {\nnamespace bin {\n\nUNIT_TEST_CASE(CircularLinkedList) {\n  CircularLinkedList<int> list;\n\n  EXPECT(!list.HasHead());\n\n  list.Add(1);\n  EXPECT(list.HasHead());\n  EXPECT(list.head() == 1);\n\n\n  \/\/ Test: Inserts don't move head.\n  for (int i = 2; i <= 100; i++) {\n    list.Add(i);\n    EXPECT(list.head() == 1);\n  }\n\n\n  \/\/ Test: Rotate cycle through all elements in insertion order.\n  for (int i = 1; i <= 100; i++) {\n    EXPECT(list.HasHead());\n    EXPECT(list.head() == i);\n    list.Rotate();\n  }\n\n\n  \/\/ Test: Removing head results in next element to be head.\n  for (int i = 1; i <= 100; i++) {\n    list.RemoveHead();\n    for (int j = i + 1; j <= 100; j++) {\n      EXPECT(list.HasHead());\n      EXPECT(list.head() == j);\n      list.Rotate();\n    }\n  }\n\n  \/\/ Test: Removing all items individually make list empty.\n  EXPECT(!list.HasHead());\n\n\n  \/\/ Test: Removing all items at once makes list empty.\n  for (int i = 1; i <= 100; i++) {\n    list.Add(i);\n  }\n  list.RemoveAll();\n  EXPECT(!list.HasHead());\n\n\n  \/\/ Test: Remove individual items just deletes them without modifying head.\n  for (int i = 1; i <= 10; i++) {\n    list.Add(i);\n  }\n  for (int i = 2; i <= 9; i++) {\n    list.Remove(i);\n  }\n  EXPECT(list.head() == 1);\n  list.Rotate();\n  EXPECT(list.head() == 10);\n  list.Rotate();\n  EXPECT(list.head() == 1);\n\n\n  \/\/ Test: Remove non-existent element leaves list un-changed.\n  list.Remove(4242);\n  EXPECT(list.head() == 1);\n\n\n  \/\/ Test: Remove head element individually moves head to next element.\n  list.Remove(1);\n  EXPECT(list.HasHead());\n  EXPECT(list.head() == 10);\n  list.Remove(10);\n  EXPECT(!list.HasHead());\n\n\n  \/\/ Test: Remove non-existent element from empty list works.\n  list.Remove(4242);\n}\n\n}  \/\/ namespace bin\n}  \/\/ namespace dart\n<commit_msg>Reorder includes and remove platform\/globals include<commit_after>\/\/ Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file\n\/\/ for details. All rights reserved. Use of this source code is governed by a\n\/\/ BSD-style license that can be found in the LICENSE file.\n\n#include \"bin\/eventhandler.h\"\n#include \"platform\/assert.h\"\n#include \"vm\/unit_test.h\"\n\nnamespace dart {\nnamespace bin {\n\nUNIT_TEST_CASE(CircularLinkedList) {\n  CircularLinkedList<int> list;\n\n  EXPECT(!list.HasHead());\n\n  list.Add(1);\n  EXPECT(list.HasHead());\n  EXPECT(list.head() == 1);\n\n\n  \/\/ Test: Inserts don't move head.\n  for (int i = 2; i <= 100; i++) {\n    list.Add(i);\n    EXPECT(list.head() == 1);\n  }\n\n\n  \/\/ Test: Rotate cycle through all elements in insertion order.\n  for (int i = 1; i <= 100; i++) {\n    EXPECT(list.HasHead());\n    EXPECT(list.head() == i);\n    list.Rotate();\n  }\n\n\n  \/\/ Test: Removing head results in next element to be head.\n  for (int i = 1; i <= 100; i++) {\n    list.RemoveHead();\n    for (int j = i + 1; j <= 100; j++) {\n      EXPECT(list.HasHead());\n      EXPECT(list.head() == j);\n      list.Rotate();\n    }\n  }\n\n  \/\/ Test: Removing all items individually make list empty.\n  EXPECT(!list.HasHead());\n\n\n  \/\/ Test: Removing all items at once makes list empty.\n  for (int i = 1; i <= 100; i++) {\n    list.Add(i);\n  }\n  list.RemoveAll();\n  EXPECT(!list.HasHead());\n\n\n  \/\/ Test: Remove individual items just deletes them without modifying head.\n  for (int i = 1; i <= 10; i++) {\n    list.Add(i);\n  }\n  for (int i = 2; i <= 9; i++) {\n    list.Remove(i);\n  }\n  EXPECT(list.head() == 1);\n  list.Rotate();\n  EXPECT(list.head() == 10);\n  list.Rotate();\n  EXPECT(list.head() == 1);\n\n\n  \/\/ Test: Remove non-existent element leaves list un-changed.\n  list.Remove(4242);\n  EXPECT(list.head() == 1);\n\n\n  \/\/ Test: Remove head element individually moves head to next element.\n  list.Remove(1);\n  EXPECT(list.HasHead());\n  EXPECT(list.head() == 10);\n  list.Remove(10);\n  EXPECT(!list.HasHead());\n\n\n  \/\/ Test: Remove non-existent element from empty list works.\n  list.Remove(4242);\n}\n\n}  \/\/ namespace bin\n}  \/\/ namespace dart\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n#include <test\/models\/model_test_fixture.hpp>\n\nclass Models_BasicDistributions_Wishart2 :\n  public Model_Test_Fixture<Models_BasicDistributions_Wishart2> {\nprotected:\n  virtual void SetUp() {\n  }\npublic:\n  static std::vector<std::string> get_model_path() {\n    std::vector<std::string> model_path;\n    model_path.push_back(\"models\");\n    model_path.push_back(\"basic_distributions\");\n    model_path.push_back(\"wishart2\");\n    return model_path;\n  }\n  static bool has_data() {\n    return false;\n  }\n\n  static std::vector<std::pair<size_t, double> >\n  get_expected_values() {\n    std::vector<std::pair<size_t, double> > expected_values;\n    return expected_values;\n  }\n\n};\n\nINSTANTIATE_TYPED_TEST_CASE_P(Models_BasicDistributions_Wishart2,\n\t\t\t      Model_Test_Fixture,\n\t\t\t      Models_BasicDistributions_Wishart2);\n<commit_msg>test-models: adding expected value tests for models\/basic_distributions<commit_after>#include <gtest\/gtest.h>\n#include <test\/models\/model_test_fixture.hpp>\n\nclass Models_BasicDistributions_Wishart2 :\n  public Model_Test_Fixture<Models_BasicDistributions_Wishart2> {\nprotected:\n  virtual void SetUp() {\n  }\npublic:\n  static std::vector<std::string> get_model_path() {\n    std::vector<std::string> model_path;\n    model_path.push_back(\"models\");\n    model_path.push_back(\"basic_distributions\");\n    model_path.push_back(\"wishart2\");\n    return model_path;\n  }\n  static bool has_data() {\n    return false;\n  }\n\n  static std::vector<std::pair<size_t, double> >\n  get_expected_values() {\n    using std::make_pair;\n    std::vector<std::pair<size_t, double> > expected_values;\n    double nu = 10;\n    \n    expected_values.push_back(make_pair( 0U, 2.9983662 * nu)); \/\/ W[1,1]\n    expected_values.push_back(make_pair( 1U, 0.2898776 * nu)); \/\/ W[1,2]\n    expected_values.push_back(make_pair( 2U, -2.650523 * nu)); \/\/ W[1,3]\n    expected_values.push_back(make_pair( 3U, 0.1055911 * nu)); \/\/ W[1,4]\n    expected_values.push_back(make_pair( 4U, 0.2898776 * nu)); \/\/ W[2,1]\n    expected_values.push_back(make_pair( 5U, 11.4803610 * nu));\/\/ W[2,2]\n    expected_values.push_back(make_pair( 6U, 7.157993 * nu));  \/\/ W[2,3]\n    expected_values.push_back(make_pair( 7U, -3.1129955 * nu));\/\/ W[2,4]\n    expected_values.push_back(make_pair( 8U, -2.650523 * nu)); \/\/ W[3,1]\n    expected_values.push_back(make_pair( 9U, 7.157993 * nu));  \/\/ W[3,2]\n    expected_values.push_back(make_pair(10U, 11.676181 * nu)); \/\/ W[3,3]\n    expected_values.push_back(make_pair(11U, -3.5866852 * nu));\/\/ W[3,4]\n    expected_values.push_back(make_pair(12U, 0.1055911 * nu)); \/\/ W[4,1]\n    expected_values.push_back(make_pair(13U, -3.1129955 * nu));\/\/ W[4,2]\n    expected_values.push_back(make_pair(14U, -3.5866852 * nu));\/\/ W[4,3]\n    expected_values.push_back(make_pair(15U, 1.4482736 * nu)); \/\/ W[4,4]\n\n    return expected_values;\n  }\n\n};\n\nINSTANTIATE_TYPED_TEST_CASE_P(Models_BasicDistributions_Wishart2,\n\t\t\t      Model_Test_Fixture,\n\t\t\t      Models_BasicDistributions_Wishart2);\n<|endoftext|>"}
{"text":"<commit_before>#include \"PointContactXY.h\"\nusing namespace GeFiCa;\n\/\/_______________________________\n\/\/\n\/\/it look like this:\n\/\/____________________\n\/\/|                  |\n\/\/|                  |\n\/\/|                  |\n\/\/|                  |\n\/\/|                  |\n\/\/|                  |\n\/\/|                  |\n\/\/|                  |\n\/\/|       ____       |\nClassImp(PointContactXY)\nvoid PointContactXY::initialize()\n{\n  \/\/ The step length is calculated with the following equation:\n   \/\/ BEGIN_HTML\n   \/\/ <pre>\n   \/\/      double stepLength=(UpperBound-LowerBound)\/(n-1);\n   \/\/ <\/pre>\n   \/\/ END_HTML\n   \/\/ If the inner radius is not larger than the outer radius,\n   \/\/ no grid will be created\n   if (XLowerBound>=XUpperBound||YLowerBound>=YUpperBound) {\n      Warning(\"CreateGridWithFixedStepLength\",\n            \"Lower bound (%f) >= upper bound (%f)! No grid is created!\",\n            XLowerBound, XUpperBound);\n      return;\n   }\n  double steplength1=(XUpperBound-XLowerBound)\/n1;\n  double steplength2=(YUpperBound-YLowerBound)\/n2;\n  XY::SetStepLength(steplength1,steplength2);\n  \/\/might have a problem here\n  for(int i=n;i-->n-n1;) {\n      fIsFixed[i]=true;\n      fPotential[i]=annode_voltage;\n      if(fC1[n-i]>=PointBegin&&fC1[n-i]<=PointEnd) \n      {\n\tfPotential[n-i]=cathode_voltage;\n\tfIsFixed[n-i]=true;\n      }\n  }\n  for(int i=0;i<n-n1;i=i+n1) {\n      fIsFixed[i]=true;\n      fIsFixed[i+n1-1]=true;\n      fPotential[i]=annode_voltage;\n      fPotential[i+n1-1]=annode_voltage;\n  }\n}\nbool PointContactXY::CalculateField(EMethod method)\n{\n  if(!fIsLoaded)initialize();\n  return XY::CalculateField(method);\n}\n<commit_msg>corrected wrong idx in initialization<commit_after>#include \"PointContactXY.h\"\nusing namespace GeFiCa;\n\nvoid PointContactXY::initialize()\n{\n   \/\/ The step length is calculated with the following equation:\n   \/\/ BEGIN_HTML\n   \/\/ <pre>\n   \/\/      double stepLength=(UpperBound-LowerBound)\/(n-1);\n   \/\/ <\/pre>\n   \/\/ END_HTML\n   \/\/ If the inner radius is not larger than the outer radius,\n   \/\/ no grid will be created\n   if (XLowerBound>=XUpperBound||YLowerBound>=YUpperBound) {\n      Warning(\"initialize\",\n            \"Lower bound (%f) >= upper bound (%f)! No grid is created!\",\n            XLowerBound, XUpperBound);\n      return;\n   }\n   double steplength1=(XUpperBound-XLowerBound)\/n1;\n   double steplength2=(YUpperBound-YLowerBound)\/n2;\n   SetStepLength(steplength1,steplength2);\n   \/\/ set potential for electrodes\n   for(int i=n-1;i>=n-n1;i--) {\n      fIsFixed[i]=true;\n      fPotential[i]=annode_voltage;\n      if(fC1[n-1-i]>=PointBegin&&fC1[n-1-i]<=PointEnd) {\n         fPotential[n-1-i]=cathode_voltage;\n         fIsFixed[n-1-i]=true;\n      }\n   }\n   for(int i=0;i<n-n1;i=i+n1) {\n      fIsFixed[i]=true;\n      fIsFixed[i+n1-1]=true;\n      fPotential[i]=annode_voltage;\n      fPotential[i+n1-1]=annode_voltage;\n   }\n}\n\nbool PointContactXY::CalculateField(EMethod method)\n{\n   if(!fIsLoaded)initialize();\n   return CalculateField(method);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: WinFileOpenImpl.hxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: rt $ $Date: 2007-07-03 13: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\n#ifndef _WINFILEOPENIMPL_HXX_\n#define _WINFILEOPENIMPL_HXX_\n\n\/\/------------------------------------------------------------------------\n\/\/ includes\n\/\/------------------------------------------------------------------------\n\n#ifndef _COM_SUN_STAR_UI_DIALOGS_XEXTENDEDFILEPICKER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilePickerControlAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UI_DIALOGS_FILEPICKEREVENT_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/FilePickerEvent.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UI_DIALOGS_XFILTERGROUPMANAGER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilterGroupManager.hpp>\n#endif\n\n#ifndef _FILTER_CONTAINER_HXX_\n#include \"FilterContainer.hxx\"\n#endif\n\n#ifndef _FILEOPENDLG_HXX_\n#include \"FileOpenDlg.hxx\"\n#endif\n\n#ifndef _PREVIEWADAPTER_HXX_\n#include \"previewadapter.hxx\"\n#endif\n\n#ifndef _HELPPOPUPWINDOW_HXX_\n#include \"helppopupwindow.hxx\"\n#endif\n\n#ifndef _CUSTOMCONTROL_HXX_\n#include \"customcontrol.hxx\"\n#endif\n\n#ifndef _CUSTOMCONTROLFACTORY_HXX_\n#include \"customcontrolfactory.hxx\"\n#endif\n\n#ifndef _RESOURCEPROVIDER_HXX_\n#include \"..\\misc\\resourceprovider.hxx\"\n#endif\n\n#include <utility>\n#include <memory>\n#include <vector>\n\n#ifndef _OSL_CONDITN_HXX_\n#include <osl\/conditn.hxx>\n#endif\n\n\/\/------------------------------------------------------------------------\n\/\/ deklarations\n\/\/------------------------------------------------------------------------\n\n\/\/ forward declaration\nclass CFilePicker;\nclass CFilePickerState;\nclass CExecuteFilePickerState;\nclass CNonExecuteFilePickerState;\n\nclass CWinFileOpenImpl : public CFileOpenDialog\n{\npublic:\n    CWinFileOpenImpl(\n        CFilePicker* aFilePicker,\n        sal_Bool bFileOpenDialog = sal_True,\n        sal_uInt32 dwFlags = OFN_HIDEREADONLY | OFN_OVERWRITEPROMPT,\n        sal_uInt32 dwTemplateId = 0,\n        HINSTANCE hInstance = 0 );\n\n    virtual ~CWinFileOpenImpl( );\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XExecutableDialog\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual sal_Int16 SAL_CALL execute(  ) throw( ::com::sun::star::uno::RuntimeException );\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XFilePicker\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual void SAL_CALL setDefaultName( const ::rtl::OUString& aName )\n        throw( ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException );\n\n    virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getFiles(  )\n        throw(::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL setDisplayDirectory( const ::rtl::OUString& aDirectory )\n        throw( ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException );\n\n    virtual ::rtl::OUString SAL_CALL getDisplayDirectory( ) throw ( ::com::sun::star::uno::RuntimeException );\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XFilterManager\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual void SAL_CALL appendFilter( const ::rtl::OUString& aTitle, const ::rtl::OUString& aFilter )\n        throw( ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL setCurrentFilter( const ::rtl::OUString& aTitle )\n        throw( ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException );\n\n    virtual ::rtl::OUString  SAL_CALL getCurrentFilter( )\n        throw( ::com::sun::star::uno::RuntimeException );\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XFilterGroupManager\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual void SAL_CALL appendFilterGroup( const ::rtl::OUString& sGroupTitle, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::StringPair >& aFilters )\n        throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XFilePickerControlAccess\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual void SAL_CALL setValue( sal_Int16 aControlId, sal_Int16 aControlAction, const ::com::sun::star::uno::Any& aValue )\n        throw( ::com::sun::star::uno::RuntimeException );\n\n    virtual ::com::sun::star::uno::Any SAL_CALL getValue( sal_Int16 aControlId, sal_Int16 aControlAction )\n        throw( ::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL enableControl( sal_Int16 aControlId, sal_Bool bEnable )\n        throw( ::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL setLabel( sal_Int16 aControlId, const ::rtl::OUString& aLabel )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::rtl::OUString SAL_CALL getLabel( sal_Int16 aControlId )\n        throw ( ::com::sun::star::uno::RuntimeException);\n\n    \/\/------------------------------------------------\n    \/\/ XFilePreview\n    \/\/------------------------------------------------\n\n    virtual ::com::sun::star::uno::Sequence< sal_Int16 > SAL_CALL getSupportedImageFormats(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Int32 SAL_CALL getTargetColorDepth( )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Int32 SAL_CALL getAvailableWidth( )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Int32 SAL_CALL getAvailableHeight( )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual void SAL_CALL setImage( sal_Int16 aImageFormat, const ::com::sun::star::uno::Any& aImage )\n        throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Bool SAL_CALL setShowState( sal_Bool bShowState )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Bool SAL_CALL getShowState( )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/------------------------------------------------\n    \/\/ XCancelable\n    \/\/------------------------------------------------\n\n    virtual void SAL_CALL cancel( );\n\n    \/\/------------------------------------------------\n    \/\/ Implementation details\n    \/\/------------------------------------------------\n\nprotected:\n    sal_Int16 SAL_CALL getFocused( );\n\n    virtual bool SAL_CALL preModal( );\n    virtual void SAL_CALL postModal( sal_Int16 nDialogResult );\n\n    virtual sal_uInt32 SAL_CALL onFileOk();\n    virtual void SAL_CALL onSelChanged( HWND hwndListBox );\n\n    \/\/ only called back if OFN_EXPLORER is set\n    virtual void SAL_CALL onInitDone();\n    virtual void SAL_CALL onFolderChanged();\n    virtual void SAL_CALL onTypeChanged( sal_uInt32 nFilterIndex );\n\n    \/\/ call base class method first when overloading\n    virtual void SAL_CALL onInitDialog( HWND hwndDlg );\n\n    virtual sal_uInt32 SAL_CALL onCtrlCommand( HWND hwndDlg, sal_uInt16 ctrlId, sal_uInt16 notifyCode );\n\n\n    void onWMSize();\n    void onWMShow(BOOL bShow);\n    void onWMWindowPosChanged();\n    void onCustomControlHelpRequest(LPHELPINFO lphi);\n\nprivate:\n    inline void SAL_CALL appendFilterGroupSeparator( );\n\n    inline sal_Bool SAL_CALL IsCustomControlHelpRequested(LPHELPINFO lphi) const;\n\n    void EnlargeStdControlLabels() const;\n\n    \/\/ initialize all controls from cache\n    void SAL_CALL InitControlLabel( HWND hWnd );\n    void SAL_CALL InitCustomControlContainer(HWND hCustomControl);\n\n    \/\/ save the control state\n    void SAL_CALL CacheControlState(HWND hWnd);\n\n    void SAL_CALL SetDefaultExtension();\n    void SAL_CALL InitialSetDefaultName();\n\n    static LRESULT CALLBACK SubClassFunc(HWND hWnd, UINT wMessage, WPARAM wParam, LPARAM lParam);\n\n    static BOOL CALLBACK EnumChildWndProc( HWND hWnd, LPARAM lParam );\n\nprivate:\n    std::auto_ptr<CFilterContainer>         m_filterContainer;\n    std::auto_ptr<CPreviewAdapter>          m_Preview;\n    std::auto_ptr<CCustomControlFactory>    m_CustomControlFactory;\n    std::auto_ptr<CCustomControl>           m_CustomControls;\n    CFilePicker*                            m_FilePicker;\n    WNDPROC                                 m_pfnOldDlgProc;\n    rtl::OUString                           m_defaultName;\n    sal_Bool                                m_bInitialSelChanged;\n    CHelpPopupWindow                        m_HelpPopupWindow;\n    CFilePickerState*                       m_FilePickerState;\n    CExecuteFilePickerState*                m_ExecuteFilePickerState;\n    CNonExecuteFilePickerState*             m_NonExecuteFilePickerState;\n    CResourceProvider                       m_ResProvider;\n};\n\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.15.88); FILE MERGED 2008\/04\/01 15:17:04 thb 1.15.88.3: #i85898# Stripping all external header guards 2008\/04\/01 12:30:50 thb 1.15.88.2: #i85898# Stripping all external header guards 2008\/03\/31 13:13:17 rt 1.15.88.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: WinFileOpenImpl.hxx,v $\n * $Revision: 1.16 $\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#ifndef _WINFILEOPENIMPL_HXX_\n#define _WINFILEOPENIMPL_HXX_\n\n\/\/------------------------------------------------------------------------\n\/\/ includes\n\/\/------------------------------------------------------------------------\n\n#ifndef _COM_SUN_STAR_UI_DIALOGS_XEXTENDEDFILEPICKER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilePickerControlAccess.hpp>\n#endif\n#include <com\/sun\/star\/ui\/dialogs\/FilePickerEvent.hpp>\n#include <com\/sun\/star\/ui\/dialogs\/XFilterGroupManager.hpp>\n#include \"FilterContainer.hxx\"\n#include \"FileOpenDlg.hxx\"\n#include \"previewadapter.hxx\"\n#include \"helppopupwindow.hxx\"\n#include \"customcontrol.hxx\"\n#include \"customcontrolfactory.hxx\"\n#include \"..\\misc\\resourceprovider.hxx\"\n\n#include <utility>\n#include <memory>\n#include <vector>\n#include <osl\/conditn.hxx>\n\n\/\/------------------------------------------------------------------------\n\/\/ deklarations\n\/\/------------------------------------------------------------------------\n\n\/\/ forward declaration\nclass CFilePicker;\nclass CFilePickerState;\nclass CExecuteFilePickerState;\nclass CNonExecuteFilePickerState;\n\nclass CWinFileOpenImpl : public CFileOpenDialog\n{\npublic:\n    CWinFileOpenImpl(\n        CFilePicker* aFilePicker,\n        sal_Bool bFileOpenDialog = sal_True,\n        sal_uInt32 dwFlags = OFN_HIDEREADONLY | OFN_OVERWRITEPROMPT,\n        sal_uInt32 dwTemplateId = 0,\n        HINSTANCE hInstance = 0 );\n\n    virtual ~CWinFileOpenImpl( );\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XExecutableDialog\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual sal_Int16 SAL_CALL execute(  ) throw( ::com::sun::star::uno::RuntimeException );\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XFilePicker\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual void SAL_CALL setDefaultName( const ::rtl::OUString& aName )\n        throw( ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException );\n\n    virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getFiles(  )\n        throw(::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL setDisplayDirectory( const ::rtl::OUString& aDirectory )\n        throw( ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException );\n\n    virtual ::rtl::OUString SAL_CALL getDisplayDirectory( ) throw ( ::com::sun::star::uno::RuntimeException );\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XFilterManager\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual void SAL_CALL appendFilter( const ::rtl::OUString& aTitle, const ::rtl::OUString& aFilter )\n        throw( ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL setCurrentFilter( const ::rtl::OUString& aTitle )\n        throw( ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException );\n\n    virtual ::rtl::OUString  SAL_CALL getCurrentFilter( )\n        throw( ::com::sun::star::uno::RuntimeException );\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XFilterGroupManager\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual void SAL_CALL appendFilterGroup( const ::rtl::OUString& sGroupTitle, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::StringPair >& aFilters )\n        throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n\n    \/\/-----------------------------------------------------------------------------------------\n    \/\/ XFilePickerControlAccess\n    \/\/-----------------------------------------------------------------------------------------\n\n    virtual void SAL_CALL setValue( sal_Int16 aControlId, sal_Int16 aControlAction, const ::com::sun::star::uno::Any& aValue )\n        throw( ::com::sun::star::uno::RuntimeException );\n\n    virtual ::com::sun::star::uno::Any SAL_CALL getValue( sal_Int16 aControlId, sal_Int16 aControlAction )\n        throw( ::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL enableControl( sal_Int16 aControlId, sal_Bool bEnable )\n        throw( ::com::sun::star::uno::RuntimeException );\n\n    virtual void SAL_CALL setLabel( sal_Int16 aControlId, const ::rtl::OUString& aLabel )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::rtl::OUString SAL_CALL getLabel( sal_Int16 aControlId )\n        throw ( ::com::sun::star::uno::RuntimeException);\n\n    \/\/------------------------------------------------\n    \/\/ XFilePreview\n    \/\/------------------------------------------------\n\n    virtual ::com::sun::star::uno::Sequence< sal_Int16 > SAL_CALL getSupportedImageFormats(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Int32 SAL_CALL getTargetColorDepth( )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Int32 SAL_CALL getAvailableWidth( )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Int32 SAL_CALL getAvailableHeight( )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual void SAL_CALL setImage( sal_Int16 aImageFormat, const ::com::sun::star::uno::Any& aImage )\n        throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Bool SAL_CALL setShowState( sal_Bool bShowState )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Bool SAL_CALL getShowState( )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/------------------------------------------------\n    \/\/ XCancelable\n    \/\/------------------------------------------------\n\n    virtual void SAL_CALL cancel( );\n\n    \/\/------------------------------------------------\n    \/\/ Implementation details\n    \/\/------------------------------------------------\n\nprotected:\n    sal_Int16 SAL_CALL getFocused( );\n\n    virtual bool SAL_CALL preModal( );\n    virtual void SAL_CALL postModal( sal_Int16 nDialogResult );\n\n    virtual sal_uInt32 SAL_CALL onFileOk();\n    virtual void SAL_CALL onSelChanged( HWND hwndListBox );\n\n    \/\/ only called back if OFN_EXPLORER is set\n    virtual void SAL_CALL onInitDone();\n    virtual void SAL_CALL onFolderChanged();\n    virtual void SAL_CALL onTypeChanged( sal_uInt32 nFilterIndex );\n\n    \/\/ call base class method first when overloading\n    virtual void SAL_CALL onInitDialog( HWND hwndDlg );\n\n    virtual sal_uInt32 SAL_CALL onCtrlCommand( HWND hwndDlg, sal_uInt16 ctrlId, sal_uInt16 notifyCode );\n\n\n    void onWMSize();\n    void onWMShow(BOOL bShow);\n    void onWMWindowPosChanged();\n    void onCustomControlHelpRequest(LPHELPINFO lphi);\n\nprivate:\n    inline void SAL_CALL appendFilterGroupSeparator( );\n\n    inline sal_Bool SAL_CALL IsCustomControlHelpRequested(LPHELPINFO lphi) const;\n\n    void EnlargeStdControlLabels() const;\n\n    \/\/ initialize all controls from cache\n    void SAL_CALL InitControlLabel( HWND hWnd );\n    void SAL_CALL InitCustomControlContainer(HWND hCustomControl);\n\n    \/\/ save the control state\n    void SAL_CALL CacheControlState(HWND hWnd);\n\n    void SAL_CALL SetDefaultExtension();\n    void SAL_CALL InitialSetDefaultName();\n\n    static LRESULT CALLBACK SubClassFunc(HWND hWnd, UINT wMessage, WPARAM wParam, LPARAM lParam);\n\n    static BOOL CALLBACK EnumChildWndProc( HWND hWnd, LPARAM lParam );\n\nprivate:\n    std::auto_ptr<CFilterContainer>         m_filterContainer;\n    std::auto_ptr<CPreviewAdapter>          m_Preview;\n    std::auto_ptr<CCustomControlFactory>    m_CustomControlFactory;\n    std::auto_ptr<CCustomControl>           m_CustomControls;\n    CFilePicker*                            m_FilePicker;\n    WNDPROC                                 m_pfnOldDlgProc;\n    rtl::OUString                           m_defaultName;\n    sal_Bool                                m_bInitialSelChanged;\n    CHelpPopupWindow                        m_HelpPopupWindow;\n    CFilePickerState*                       m_FilePickerState;\n    CExecuteFilePickerState*                m_ExecuteFilePickerState;\n    CNonExecuteFilePickerState*             m_NonExecuteFilePickerState;\n    CResourceProvider                       m_ResProvider;\n};\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: basscript.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2004-10-22 14:03:16 $\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 SCRIPTING_BASSCRIPT_HXX\n#include \"basscript.hxx\"\n#endif\n\n#ifndef _SBXCLASS_HXX\n#include <svtools\/sbx.hxx>\n#endif\n#ifndef _SB_SBSTAR_HXX\n#include <basic\/sbstar.hxx>\n#endif\n#ifndef _SB_SBMOD_HXX\n#include <basic\/sbmod.hxx>\n#endif\n#ifndef _SB_SBMETH_HXX\n#include <basic\/sbmeth.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SCRIPT_PROVIDER_SCRIPTFRAMEWORKERRORTYPE_HPP_\n#include <com\/sun\/star\/script\/provider\/ScriptFrameworkErrorType.hpp>\n#endif\n#include <map>\n\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::script;\n\n\nextern ::com::sun::star::uno::Any sbxToUnoValue( SbxVariable* pVar );\nextern void unoToSbxValue( SbxVariable* pVar, const ::com::sun::star::uno::Any& aValue );\n\n\n\/\/.........................................................................\nnamespace basprov\n{\n\/\/.........................................................................\n\n    typedef ::std::map< sal_Int16, Any, ::std::less< sal_Int16 > > OutParamMap;\n\n    \/\/ =============================================================================\n    \/\/ BasicScriptImpl\n    \/\/ =============================================================================\n\n    BasicScriptImpl::BasicScriptImpl( const ::rtl::OUString& funcName,  SbMethod* pMethod )\n        :m_pMethod( pMethod ), m_funcName( funcName )\n    {\n    }\n\n    \/\/ -----------------------------------------------------------------------------\n\n    BasicScriptImpl::~BasicScriptImpl()\n    {\n    }\n\n    \/\/ -----------------------------------------------------------------------------\n    \/\/ XScript\n    \/\/ -----------------------------------------------------------------------------\n\n    Any BasicScriptImpl::invoke( const Sequence< Any >& aParams, Sequence< sal_Int16 >& aOutParamIndex, Sequence< Any >& aOutParam )\n        throw ( provider::ScriptFrameworkErrorException, reflection::InvocationTargetException, uno::RuntimeException)\n    {\n        \/\/ TODO: throw CannotConvertException\n        \/\/ TODO: check length of aOutParamIndex, aOutParam\n\n        ::osl::MutexGuard aGuard( StarBASIC::GetGlobalMutex() );\n\n        Any aReturn;\n\n        if ( m_pMethod )\n        {\n            \/\/ check if compiled\n            SbModule* pModule = static_cast< SbModule* >( m_pMethod->GetParent() );\n            if ( pModule && !pModule->IsCompiled() )\n                pModule->Compile();\n\n            \/\/ check number of parameters\n            sal_Int32 nParamsCount = aParams.getLength();\n            SbxInfo* pInfo = m_pMethod->GetInfo();\n            if ( pInfo )\n            {\n                sal_Int32 nSbxOptional = 0;\n                USHORT n = 1;\n                for ( const SbxParamInfo* pParamInfo = pInfo->GetParam( n ); pParamInfo; pParamInfo = pInfo->GetParam( ++n ) )\n                {\n                    if ( ( pParamInfo->nFlags & SBX_OPTIONAL ) != 0 )\n                        ++nSbxOptional;\n                    else\n                        nSbxOptional = 0;\n                }\n                sal_Int32 nSbxCount = n - 1;\n                if ( nParamsCount < nSbxCount - nSbxOptional )\n                {\n                    throw provider::ScriptFrameworkErrorException(\n                        ::rtl::OUString(\n                            RTL_CONSTASCII_USTRINGPARAM(\n                                \"wrong number of paramters!\" ) ),\n                         Reference< XInterface >(),\n                         m_funcName,\n                         ::rtl::OUString(\n                             RTL_CONSTASCII_USTRINGPARAM( \"Basic\" ) ),\n                        provider::ScriptFrameworkErrorType::UNKNOWN  );\n                }\n            }\n\n            \/\/ set parameters\n            SbxArrayRef xSbxParams;\n            if ( nParamsCount > 0 )\n            {\n                xSbxParams = new SbxArray;\n                const Any* pParams = aParams.getConstArray();\n                for ( sal_Int32 i = 0; i < nParamsCount; ++i )\n                {\n                    SbxVariableRef xSbxVar = new SbxVariable( SbxVARIANT );\n                    unoToSbxValue( static_cast< SbxVariable* >( xSbxVar ), pParams[i] );\n                    xSbxParams->Put( xSbxVar, static_cast< USHORT >( i ) + 1 );\n                }\n            }\n            if ( xSbxParams.Is() )\n                m_pMethod->SetParameters( xSbxParams );\n\n            \/\/ call method\n            SbxVariableRef xReturn = new SbxVariable;\n            ErrCode nErr = m_pMethod->Call( xReturn );\n            if ( nErr != SbxERR_OK )\n            {\n                \/\/ TODO: throw InvocationTargetException ?\n            }\n\n            \/\/ get output parameters\n            if ( xSbxParams.Is() )\n            {\n                SbxInfo* pInfo = m_pMethod->GetInfo();\n                if ( pInfo )\n                {\n                    OutParamMap aOutParamMap;\n                    for ( USHORT n = 1, nCount = xSbxParams->Count(); n < nCount; ++n )\n                    {\n                        const SbxParamInfo* pParamInfo = pInfo->GetParam( n );\n                        if ( pParamInfo && ( pParamInfo->eType & SbxBYREF ) != 0 )\n                        {\n                            SbxVariable* pVar = xSbxParams->Get( n );\n                            if ( pVar )\n                            {\n                                SbxVariableRef xVar = pVar;\n                                aOutParamMap.insert( OutParamMap::value_type( n - 1, sbxToUnoValue( xVar ) ) );\n                            }\n                        }\n                    }\n                    sal_Int32 nOutParamCount = aOutParamMap.size();\n                    aOutParamIndex.realloc( nOutParamCount );\n                    aOutParam.realloc( nOutParamCount );\n                    sal_Int16* pOutParamIndex = aOutParamIndex.getArray();\n                    Any* pOutParam = aOutParam.getArray();\n                    for ( OutParamMap::iterator aIt = aOutParamMap.begin(); aIt != aOutParamMap.end(); ++aIt, ++pOutParamIndex, ++pOutParam )\n                    {\n                        *pOutParamIndex = aIt->first;\n                        *pOutParam = aIt->second;\n                    }\n                }\n            }\n\n            \/\/ get return value\n            aReturn = sbxToUnoValue( xReturn );\n\n            \/\/ reset parameters\n            m_pMethod->SetParameters( NULL );\n        }\n\n        return aReturn;\n    }\n\n    \/\/ -----------------------------------------------------------------------------\n\n\/\/.........................................................................\n}   \/\/ namespace basprov\n\/\/.........................................................................\n<commit_msg>INTEGRATION: CWS tbe15 (1.6.12); FILE MERGED 2004\/12\/03 16:24:19 tbe 1.6.12.1: #i38139# Tools\/Macro\/Run Macro freezes office when Basic macro is already running<commit_after>\/*************************************************************************\n *\n *  $RCSfile: basscript.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: kz $ $Date: 2005-01-13 17:43: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#ifndef SCRIPTING_BASSCRIPT_HXX\n#include \"basscript.hxx\"\n#endif\n\n#ifndef _VOS_MUTEX_HXX_\n#include <vos\/mutex.hxx>\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _SBXCLASS_HXX\n#include <svtools\/sbx.hxx>\n#endif\n#ifndef _SB_SBSTAR_HXX\n#include <basic\/sbstar.hxx>\n#endif\n#ifndef _SB_SBMOD_HXX\n#include <basic\/sbmod.hxx>\n#endif\n#ifndef _SB_SBMETH_HXX\n#include <basic\/sbmeth.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SCRIPT_PROVIDER_SCRIPTFRAMEWORKERRORTYPE_HPP_\n#include <com\/sun\/star\/script\/provider\/ScriptFrameworkErrorType.hpp>\n#endif\n#include <map>\n\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::script;\n\n\nextern ::com::sun::star::uno::Any sbxToUnoValue( SbxVariable* pVar );\nextern void unoToSbxValue( SbxVariable* pVar, const ::com::sun::star::uno::Any& aValue );\n\n\n\/\/.........................................................................\nnamespace basprov\n{\n\/\/.........................................................................\n\n    typedef ::std::map< sal_Int16, Any, ::std::less< sal_Int16 > > OutParamMap;\n\n    \/\/ =============================================================================\n    \/\/ BasicScriptImpl\n    \/\/ =============================================================================\n\n    BasicScriptImpl::BasicScriptImpl( const ::rtl::OUString& funcName,  SbMethod* pMethod )\n        :m_pMethod( pMethod ), m_funcName( funcName )\n    {\n    }\n\n    \/\/ -----------------------------------------------------------------------------\n\n    BasicScriptImpl::~BasicScriptImpl()\n    {\n    }\n\n    \/\/ -----------------------------------------------------------------------------\n    \/\/ XScript\n    \/\/ -----------------------------------------------------------------------------\n\n    Any BasicScriptImpl::invoke( const Sequence< Any >& aParams, Sequence< sal_Int16 >& aOutParamIndex, Sequence< Any >& aOutParam )\n        throw ( provider::ScriptFrameworkErrorException, reflection::InvocationTargetException, uno::RuntimeException)\n    {\n        \/\/ TODO: throw CannotConvertException\n        \/\/ TODO: check length of aOutParamIndex, aOutParam\n\n        ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n        if ( StarBASIC::IsRunning() )\n        {\n            throw provider::ScriptFrameworkErrorException(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Basic is already running!\" ) ),\n                Reference< XInterface >(),\n                m_funcName,\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Basic\" ) ),\n                provider::ScriptFrameworkErrorType::UNKNOWN  );\n        }\n\n        Any aReturn;\n\n        if ( m_pMethod )\n        {\n            \/\/ check if compiled\n            SbModule* pModule = static_cast< SbModule* >( m_pMethod->GetParent() );\n            if ( pModule && !pModule->IsCompiled() )\n                pModule->Compile();\n\n            \/\/ check number of parameters\n            sal_Int32 nParamsCount = aParams.getLength();\n            SbxInfo* pInfo = m_pMethod->GetInfo();\n            if ( pInfo )\n            {\n                sal_Int32 nSbxOptional = 0;\n                USHORT n = 1;\n                for ( const SbxParamInfo* pParamInfo = pInfo->GetParam( n ); pParamInfo; pParamInfo = pInfo->GetParam( ++n ) )\n                {\n                    if ( ( pParamInfo->nFlags & SBX_OPTIONAL ) != 0 )\n                        ++nSbxOptional;\n                    else\n                        nSbxOptional = 0;\n                }\n                sal_Int32 nSbxCount = n - 1;\n                if ( nParamsCount < nSbxCount - nSbxOptional )\n                {\n                    throw provider::ScriptFrameworkErrorException(\n                        ::rtl::OUString(\n                            RTL_CONSTASCII_USTRINGPARAM(\n                                \"wrong number of paramters!\" ) ),\n                         Reference< XInterface >(),\n                         m_funcName,\n                         ::rtl::OUString(\n                             RTL_CONSTASCII_USTRINGPARAM( \"Basic\" ) ),\n                        provider::ScriptFrameworkErrorType::UNKNOWN  );\n                }\n            }\n\n            \/\/ set parameters\n            SbxArrayRef xSbxParams;\n            if ( nParamsCount > 0 )\n            {\n                xSbxParams = new SbxArray;\n                const Any* pParams = aParams.getConstArray();\n                for ( sal_Int32 i = 0; i < nParamsCount; ++i )\n                {\n                    SbxVariableRef xSbxVar = new SbxVariable( SbxVARIANT );\n                    unoToSbxValue( static_cast< SbxVariable* >( xSbxVar ), pParams[i] );\n                    xSbxParams->Put( xSbxVar, static_cast< USHORT >( i ) + 1 );\n                }\n            }\n            if ( xSbxParams.Is() )\n                m_pMethod->SetParameters( xSbxParams );\n\n            \/\/ call method\n            SbxVariableRef xReturn = new SbxVariable;\n            ErrCode nErr = m_pMethod->Call( xReturn );\n            if ( nErr != SbxERR_OK )\n            {\n                \/\/ TODO: throw InvocationTargetException ?\n            }\n\n            \/\/ get output parameters\n            if ( xSbxParams.Is() )\n            {\n                SbxInfo* pInfo = m_pMethod->GetInfo();\n                if ( pInfo )\n                {\n                    OutParamMap aOutParamMap;\n                    for ( USHORT n = 1, nCount = xSbxParams->Count(); n < nCount; ++n )\n                    {\n                        const SbxParamInfo* pParamInfo = pInfo->GetParam( n );\n                        if ( pParamInfo && ( pParamInfo->eType & SbxBYREF ) != 0 )\n                        {\n                            SbxVariable* pVar = xSbxParams->Get( n );\n                            if ( pVar )\n                            {\n                                SbxVariableRef xVar = pVar;\n                                aOutParamMap.insert( OutParamMap::value_type( n - 1, sbxToUnoValue( xVar ) ) );\n                            }\n                        }\n                    }\n                    sal_Int32 nOutParamCount = aOutParamMap.size();\n                    aOutParamIndex.realloc( nOutParamCount );\n                    aOutParam.realloc( nOutParamCount );\n                    sal_Int16* pOutParamIndex = aOutParamIndex.getArray();\n                    Any* pOutParam = aOutParam.getArray();\n                    for ( OutParamMap::iterator aIt = aOutParamMap.begin(); aIt != aOutParamMap.end(); ++aIt, ++pOutParamIndex, ++pOutParam )\n                    {\n                        *pOutParamIndex = aIt->first;\n                        *pOutParam = aIt->second;\n                    }\n                }\n            }\n\n            \/\/ get return value\n            aReturn = sbxToUnoValue( xReturn );\n\n            \/\/ reset parameters\n            m_pMethod->SetParameters( NULL );\n        }\n\n        return aReturn;\n    }\n\n    \/\/ -----------------------------------------------------------------------------\n\n\/\/.........................................................................\n}   \/\/ namespace basprov\n\/\/.........................................................................\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\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_sal.hxx\"\n\n#include <tchar.h>\n\n#ifdef _MSC_VER\n#pragma warning(push,1) \/\/ disable warnings within system headers\n#endif\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#include <tlhelp32.h>\n#include <psapi.h>\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include <signal.h>\n#include <stdarg.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n#ifndef SIGNULL\n#define SIGNULL 0\n#endif\n\n#ifndef SIGKILL\n#define SIGKILL 9\n#endif\n\n#include <signal.h>\n\n#define MAX_MODULES 1024\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Determines if a returned handle value is valid\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic inline bool IsValidHandle( HANDLE handle )\n{\n    return INVALID_HANDLE_VALUE != handle && NULL != handle;\n}\n\n\n#define elementsof( a ) (sizeof(a) \/ sizeof( (a)[0] ))\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Retrieves function adress in another process\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if 1\n#define GetProcAddressEx( hProcess, hModule, lpProcName ) GetProcAddress( hModule, lpProcName )\n#else\nFARPROC WINAPI GetProcAddressEx( HANDLE hProcess, HMODULE hModule, LPCSTR lpProcName )\n{\n    FARPROC lpfnProcAddress = GetProcAddress( hModule, lpProcName );\n\n    if ( lpfnProcAddress )\n    {\n        DWORD   dwProcessId = GetProcessId( hProcess );\n\n        if ( GetCurrentProcessId() != dwProcessId )\n        {\n            FARPROC lpfnRemoteProcAddress = NULL;\n            TCHAR   szBaseName[MAX_PATH];\n\n            if ( GetModuleBaseName( GetCurrentProcess(), hModule, szBaseName, elementsof(szBaseName) ) )\n            {\n                HMODULE ahModules[MAX_MODULES];\n                DWORD   cbNeeded = 0;\n\n                if ( EnumProcessModules( hProcess, ahModules, sizeof(ahModules), &cbNeeded ) )\n                {\n                    ULONG   nModules = cbNeeded \/ sizeof(ahModules[0]);\n\n                    for ( ULONG n = 0; n < nModules; n++ )\n                    {\n                        TCHAR   szRemoteBaseName[MAX_PATH];\n\n                        if ( GetModuleBaseName(\n                            hProcess, ahModules[n], szRemoteBaseName, elementsof(szRemoteBaseName) ) &&\n                            0 == lstrcmpi( szRemoteBaseName, szBaseName )\n                            )\n                        {\n                            lpfnRemoteProcAddress = lpfnProcAddress;\n\n                            if ( ahModules[n] != hModule )\n                                *(LPBYTE*)&lpfnRemoteProcAddress += (LPBYTE)ahModules[n] - (LPBYTE)hModule;\n                            break;\n                        }\n                    }\n                }\n            }\n\n            lpfnProcAddress = lpfnRemoteProcAddress;\n        }\n    }\n\n    return lpfnProcAddress;\n}\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Raises a signal in an other process\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic DWORD SignalToExceptionCode( int signal )\n{\n    switch ( signal )\n    {\n    case SIGSEGV:\n        return EXCEPTION_ACCESS_VIOLATION;\n    case SIGFPE:\n        return EXCEPTION_FLT_INVALID_OPERATION;\n    case SIGILL:\n        return EXCEPTION_ILLEGAL_INSTRUCTION;\n    case SIGINT:\n        return CONTROL_C_EXIT;\n    case SIGBREAK:\n        return CONTROL_C_EXIT;\n    default:\n        return 0;\n    }\n}\n\nstatic BOOL RaiseSignalEx( HANDLE hProcess, int sig )\n{\n    DWORD   dwProcessId = GetProcessId( hProcess );\n\n    HANDLE  hSnapshot = CreateToolhelp32Snapshot( TH32CS_SNAPTHREAD, 0 );\n    HANDLE  hThread = 0;\n    BOOL fSuccess = FALSE;\n\n    if ( IsValidHandle(hSnapshot) )\n    {\n        THREADENTRY32   te;\n\n        te.dwSize = sizeof(te);\n        fSuccess = Thread32First( hSnapshot, &te );\n        while ( fSuccess )\n        {\n            if ( te.th32OwnerProcessID == dwProcessId )\n            {\n                hThread = OpenThread(\n                    THREAD_SUSPEND_RESUME | THREAD_QUERY_INFORMATION |\n                    THREAD_GET_CONTEXT | THREAD_SET_CONTEXT,\n                    FALSE, te.th32ThreadID );\n                if ( IsValidHandle(hThread) )\n                    break;\n            }\n\n            fSuccess = Thread32Next( hSnapshot, &te );\n        }\n\n        CloseHandle( hSnapshot );\n    }\n\n    if ( fSuccess )\n    {\n        CONTEXT aContext;\n\n        if ( SuspendThread( hThread ) != (DWORD)-1 )\n        {\n            ZeroMemory( &aContext, sizeof(aContext) );\n            aContext.ContextFlags = CONTEXT_FULL;\n\n            fSuccess = GetThreadContext( hThread, &aContext );\n\n            if ( fSuccess )\n            {\n                if ( sig )\n                {\n                    DWORD   dwStackBuffer[] =\n                    {\n                        aContext.Eip,\n                        SignalToExceptionCode( sig ),\n                        EXCEPTION_NONCONTINUABLE,\n                        0,\n                        0\n                    };\n\n                    aContext.Esp -= sizeof(dwStackBuffer);\n                    WriteProcessMemory( hProcess, (LPVOID)aContext.Esp, dwStackBuffer, sizeof(dwStackBuffer), NULL );\n                    aContext.Eip = (DWORD)GetProcAddressEx( hProcess, GetModuleHandleA(\"KERNEL32\"), \"RaiseException\" );\n                }\n                else\n                {\n                    aContext.Ecx = aContext.Eax = aContext.Ebx = aContext.Edx = aContext.Esi = aContext.Edi = 0;\n                }\n\n                fSuccess = SetThreadContext( hThread, &aContext );\n            }\n\n            fSuccess = ResumeThread( hThread ) && fSuccess;\n\n            DWORD   dwLastError = GetLastError();\n            CloseHandle( hThread );\n            SetLastError( dwLastError );\n\n            return fSuccess;\n        }\n    }\n\n    return FALSE;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Command line parameter parsing\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void ParseCommandArgs( LPDWORD lpProcesses, LPDWORD lpdwNumProcesses, int *pSig )\n{\n    typedef struct _SignalEntry\n    {\n        LPCTSTR lpSignalName;\n        int iSignalValue;\n    } SignalEntry;\n\n    #define SIG_ENTRY( signal ) { TEXT(#signal), SIG##signal }\n\n    static SignalEntry SupportedSignals[] =\n    {\n        SIG_ENTRY( NULL ),\n        SIG_ENTRY( SEGV ),\n        SIG_ENTRY( ILL ),\n        SIG_ENTRY( FPE ),\n        SIG_ENTRY( INT ),\n        SIG_ENTRY( BREAK ),\n        SIG_ENTRY( TERM ),\n        SIG_ENTRY( ABRT ),\n        SIG_ENTRY( KILL )\n    };\n\n    const int NumSupportedSignals = elementsof(SupportedSignals);\n\n    DWORD   dwMaxProcesses = *lpdwNumProcesses;\n    int     argc = __argc;\n    TCHAR   **argv = __targv;\n\n    *lpdwNumProcesses = 0;\n\n    for ( int argn = 1; argn < argc; argn++ )\n    {\n        if ( 0 == lstrcmpi( argv[argn], TEXT(\"-l\") ) ||\n             0 == lstrcmpi( argv[argn], TEXT(\"\/l\") ) )\n\n        {\n            for ( int n = 0; n < NumSupportedSignals; n++ )\n            {\n                _tprintf( _T(\"%s \"), SupportedSignals[n] );\n            }\n            _tprintf( _T(\"\\n\") );\n            ExitProcess( 0 );\n        }\n        else if ( 0 == lstrcmpi( argv[argn], TEXT(\"-?\") ) ||\n                  0 == lstrcmpi( argv[argn], TEXT(\"\/?\") ) ||\n                  0 == lstrcmpi( argv[argn], TEXT(\"-h\") ) ||\n                  0 == lstrcmpi( argv[argn], TEXT(\"\/h\") ) ||\n                  0 == lstrcmpi( argv[argn], TEXT(\"--help\") ) )\n        {\n            _tprintf(\n                _T(\"Terminates a process by sending a signal.\\n\\n\")\n                _T(\"Usage: kill [ -l ] [ -signal ] pid ...\\n\\n\")\n                _T(\"-l        Lists supported signals\\n\")\n                _T(\"-signal   Sends the specified signal to the given processes.\\n\")\n                _T(\"          signal can be a numeric value specifying the signal number\\n\")\n                _T(\"          or a string listed by the -l parameter. If no signal is\\n\")\n                _T(\"          given SIGTERM (-TERM) is used.\\n\")\n                _T(\"pid       Process id(s) or executables names(s) of processes to \\n\")\n                _T(\"          signal or terminate.\\n\\n\")\n                );\n            ExitProcess( 0 );\n        }\n        else if ( argv[argn] && ( *argv[argn] == '-' || *argv[argn] == '\/' ) )\n        {\n            LPCTSTR argsig = CharNext( argv[argn] );\n\n            int n;\n            for ( n = 0; n < NumSupportedSignals; n++ )\n            {\n                _TCHAR *endptr = NULL;\n\n                if ( 0 == lstrcmpi( SupportedSignals[n].lpSignalName, argsig ) ||\n                     _tcstoul( argsig, &endptr, 0 ) == static_cast< unsigned >(SupportedSignals[n].iSignalValue) && (!endptr || !*endptr) )\n                {\n                    *pSig = SupportedSignals[n].iSignalValue;\n                    break;\n                }\n            }\n\n            if ( n >= NumSupportedSignals )\n            {\n                _ftprintf( stderr,\n                    _T(\"kill: Illegal argument %s\\n\")\n                    _T(\"Type 'kill --help' to show allowed syntax.\\n\")\n                    _T(\"Type 'kill -l' to show supported signals.\\n\"),\n                    argv[argn] );\n                ExitProcess( 0 );\n            }\n        }\n        else\n        {\n            unsigned long value = 0;\n            _TCHAR  *endptr = NULL;\n\n            value = _tcstoul( argv[argn], &endptr, 0 );\n\n            if ( !endptr || !*endptr )\n            {\n                if ( *lpdwNumProcesses < dwMaxProcesses )\n                {\n                    *(lpProcesses++) = value;\n                    (*lpdwNumProcesses)++;\n                }\n            }\n            else\n            {\n                HANDLE  hSnapshot = CreateToolhelp32Snapshot( TH32CS_SNAPPROCESS, 0 );\n\n                if ( IsValidHandle( hSnapshot ) )\n                {\n                    PROCESSENTRY32  pe;\n\n                    pe.dwSize = sizeof(pe);\n                    BOOL fSuccess = Process32First( hSnapshot, &pe );\n\n                    while ( fSuccess )\n                    {\n                        if ( 0 == lstrcmpi( argv[argn], pe.szExeFile ) )\n                        {\n                            if ( *lpdwNumProcesses < dwMaxProcesses )\n                            {\n                                *(lpProcesses++) = pe.th32ProcessID;\n                                (*lpdwNumProcesses)++;\n                            }\n                        }\n                        fSuccess = Process32Next( hSnapshot, &pe );\n                    }\n\n                    CloseHandle( hSnapshot );\n                }\n            }\n        }\n    }\n\n    if ( !*lpdwNumProcesses )\n    {\n        _ftprintf( stderr,\n            _T(\"kill: No process specified.\\n\")\n            _T(\"Use kill --help to show allowed syntax.\\n\")\n            );\n        ExitProcess( 0 );\n    }\n\n}\n\nvoid OutputSystemMessage( DWORD dwErrorCode )\n{\n    LPVOID lpMsgBuf;\n    FormatMessageA(\n                    FORMAT_MESSAGE_ALLOCATE_BUFFER |\n                    FORMAT_MESSAGE_FROM_SYSTEM |\n                    FORMAT_MESSAGE_IGNORE_INSERTS,\n                    NULL,\n                    dwErrorCode,\n                    MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), \/\/ Default language\n                    (LPSTR)&lpMsgBuf,\n                    0,\n                    NULL\n                );\n\n    printf( (LPSTR)lpMsgBuf );\n    LocalFree( lpMsgBuf );\n}\n\nint _tmain()\n{\n    DWORD   dwProcessIds[1024];\n    DWORD   nProcesses = elementsof(dwProcessIds);\n    int     sig = SIGTERM;\n\n\n    ParseCommandArgs( dwProcessIds, &nProcesses, &sig );\n\n    for ( ULONG n = 0; n < nProcesses; n++ )\n    {\n        HANDLE  hProcess;\n\n        _tprintf( _T(\"Sending signal to process id %d...\"), dwProcessIds[n] );\n        hProcess = OpenProcess( PROCESS_TERMINATE | PROCESS_CREATE_THREAD | SYNCHRONIZE |\n            PROCESS_QUERY_INFORMATION | PROCESS_VM_OPERATION | PROCESS_VM_WRITE | PROCESS_VM_READ,\n            FALSE, dwProcessIds[n] );\n\n        if ( IsValidHandle( hProcess ) )\n        {\n            if ( SIGKILL == sig )\n                TerminateProcess( hProcess, 255 );\n            else\n            {\n                if ( RaiseSignalEx( hProcess, sig ) )\n                    _tprintf( _T(\"OK\\n\") );\n                else\n                {\n                    OutputSystemMessage( GetLastError() );\n                }\n            }\n\n            CloseHandle( hProcess );\n        }\n        else\n        {\n            OutputSystemMessage( GetLastError() );\n        }\n    }\n\n    return 0;\n}\n\n<commit_msg>sb132: #i113211# correctly pass char* to %s<commit_after>\/*************************************************************************\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_sal.hxx\"\n\n#include <tchar.h>\n\n#ifdef _MSC_VER\n#pragma warning(push,1) \/\/ disable warnings within system headers\n#endif\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#include <tlhelp32.h>\n#include <psapi.h>\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include <signal.h>\n#include <stdarg.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n#ifndef SIGNULL\n#define SIGNULL 0\n#endif\n\n#ifndef SIGKILL\n#define SIGKILL 9\n#endif\n\n#include <signal.h>\n\n#define MAX_MODULES 1024\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Determines if a returned handle value is valid\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic inline bool IsValidHandle( HANDLE handle )\n{\n    return INVALID_HANDLE_VALUE != handle && NULL != handle;\n}\n\n\n#define elementsof( a ) (sizeof(a) \/ sizeof( (a)[0] ))\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Retrieves function adress in another process\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if 1\n#define GetProcAddressEx( hProcess, hModule, lpProcName ) GetProcAddress( hModule, lpProcName )\n#else\nFARPROC WINAPI GetProcAddressEx( HANDLE hProcess, HMODULE hModule, LPCSTR lpProcName )\n{\n    FARPROC lpfnProcAddress = GetProcAddress( hModule, lpProcName );\n\n    if ( lpfnProcAddress )\n    {\n        DWORD   dwProcessId = GetProcessId( hProcess );\n\n        if ( GetCurrentProcessId() != dwProcessId )\n        {\n            FARPROC lpfnRemoteProcAddress = NULL;\n            TCHAR   szBaseName[MAX_PATH];\n\n            if ( GetModuleBaseName( GetCurrentProcess(), hModule, szBaseName, elementsof(szBaseName) ) )\n            {\n                HMODULE ahModules[MAX_MODULES];\n                DWORD   cbNeeded = 0;\n\n                if ( EnumProcessModules( hProcess, ahModules, sizeof(ahModules), &cbNeeded ) )\n                {\n                    ULONG   nModules = cbNeeded \/ sizeof(ahModules[0]);\n\n                    for ( ULONG n = 0; n < nModules; n++ )\n                    {\n                        TCHAR   szRemoteBaseName[MAX_PATH];\n\n                        if ( GetModuleBaseName(\n                            hProcess, ahModules[n], szRemoteBaseName, elementsof(szRemoteBaseName) ) &&\n                            0 == lstrcmpi( szRemoteBaseName, szBaseName )\n                            )\n                        {\n                            lpfnRemoteProcAddress = lpfnProcAddress;\n\n                            if ( ahModules[n] != hModule )\n                                *(LPBYTE*)&lpfnRemoteProcAddress += (LPBYTE)ahModules[n] - (LPBYTE)hModule;\n                            break;\n                        }\n                    }\n                }\n            }\n\n            lpfnProcAddress = lpfnRemoteProcAddress;\n        }\n    }\n\n    return lpfnProcAddress;\n}\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Raises a signal in an other process\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic DWORD SignalToExceptionCode( int signal )\n{\n    switch ( signal )\n    {\n    case SIGSEGV:\n        return EXCEPTION_ACCESS_VIOLATION;\n    case SIGFPE:\n        return EXCEPTION_FLT_INVALID_OPERATION;\n    case SIGILL:\n        return EXCEPTION_ILLEGAL_INSTRUCTION;\n    case SIGINT:\n        return CONTROL_C_EXIT;\n    case SIGBREAK:\n        return CONTROL_C_EXIT;\n    default:\n        return 0;\n    }\n}\n\nstatic BOOL RaiseSignalEx( HANDLE hProcess, int sig )\n{\n    DWORD   dwProcessId = GetProcessId( hProcess );\n\n    HANDLE  hSnapshot = CreateToolhelp32Snapshot( TH32CS_SNAPTHREAD, 0 );\n    HANDLE  hThread = 0;\n    BOOL fSuccess = FALSE;\n\n    if ( IsValidHandle(hSnapshot) )\n    {\n        THREADENTRY32   te;\n\n        te.dwSize = sizeof(te);\n        fSuccess = Thread32First( hSnapshot, &te );\n        while ( fSuccess )\n        {\n            if ( te.th32OwnerProcessID == dwProcessId )\n            {\n                hThread = OpenThread(\n                    THREAD_SUSPEND_RESUME | THREAD_QUERY_INFORMATION |\n                    THREAD_GET_CONTEXT | THREAD_SET_CONTEXT,\n                    FALSE, te.th32ThreadID );\n                if ( IsValidHandle(hThread) )\n                    break;\n            }\n\n            fSuccess = Thread32Next( hSnapshot, &te );\n        }\n\n        CloseHandle( hSnapshot );\n    }\n\n    if ( fSuccess )\n    {\n        CONTEXT aContext;\n\n        if ( SuspendThread( hThread ) != (DWORD)-1 )\n        {\n            ZeroMemory( &aContext, sizeof(aContext) );\n            aContext.ContextFlags = CONTEXT_FULL;\n\n            fSuccess = GetThreadContext( hThread, &aContext );\n\n            if ( fSuccess )\n            {\n                if ( sig )\n                {\n                    DWORD   dwStackBuffer[] =\n                    {\n                        aContext.Eip,\n                        SignalToExceptionCode( sig ),\n                        EXCEPTION_NONCONTINUABLE,\n                        0,\n                        0\n                    };\n\n                    aContext.Esp -= sizeof(dwStackBuffer);\n                    WriteProcessMemory( hProcess, (LPVOID)aContext.Esp, dwStackBuffer, sizeof(dwStackBuffer), NULL );\n                    aContext.Eip = (DWORD)GetProcAddressEx( hProcess, GetModuleHandleA(\"KERNEL32\"), \"RaiseException\" );\n                }\n                else\n                {\n                    aContext.Ecx = aContext.Eax = aContext.Ebx = aContext.Edx = aContext.Esi = aContext.Edi = 0;\n                }\n\n                fSuccess = SetThreadContext( hThread, &aContext );\n            }\n\n            fSuccess = ResumeThread( hThread ) && fSuccess;\n\n            DWORD   dwLastError = GetLastError();\n            CloseHandle( hThread );\n            SetLastError( dwLastError );\n\n            return fSuccess;\n        }\n    }\n\n    return FALSE;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Command line parameter parsing\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void ParseCommandArgs( LPDWORD lpProcesses, LPDWORD lpdwNumProcesses, int *pSig )\n{\n    typedef struct _SignalEntry\n    {\n        LPCTSTR lpSignalName;\n        int iSignalValue;\n    } SignalEntry;\n\n    #define SIG_ENTRY( signal ) { TEXT(#signal), SIG##signal }\n\n    static SignalEntry SupportedSignals[] =\n    {\n        SIG_ENTRY( NULL ),\n        SIG_ENTRY( SEGV ),\n        SIG_ENTRY( ILL ),\n        SIG_ENTRY( FPE ),\n        SIG_ENTRY( INT ),\n        SIG_ENTRY( BREAK ),\n        SIG_ENTRY( TERM ),\n        SIG_ENTRY( ABRT ),\n        SIG_ENTRY( KILL )\n    };\n\n    const int NumSupportedSignals = elementsof(SupportedSignals);\n\n    DWORD   dwMaxProcesses = *lpdwNumProcesses;\n    int     argc = __argc;\n    TCHAR   **argv = __targv;\n\n    *lpdwNumProcesses = 0;\n\n    for ( int argn = 1; argn < argc; argn++ )\n    {\n        if ( 0 == lstrcmpi( argv[argn], TEXT(\"-l\") ) ||\n             0 == lstrcmpi( argv[argn], TEXT(\"\/l\") ) )\n\n        {\n            for ( int n = 0; n < NumSupportedSignals; n++ )\n            {\n                _tprintf( _T(\"%s \"), SupportedSignals[n].lpSignalName );\n            }\n            _tprintf( _T(\"\\n\") );\n            ExitProcess( 0 );\n        }\n        else if ( 0 == lstrcmpi( argv[argn], TEXT(\"-?\") ) ||\n                  0 == lstrcmpi( argv[argn], TEXT(\"\/?\") ) ||\n                  0 == lstrcmpi( argv[argn], TEXT(\"-h\") ) ||\n                  0 == lstrcmpi( argv[argn], TEXT(\"\/h\") ) ||\n                  0 == lstrcmpi( argv[argn], TEXT(\"--help\") ) )\n        {\n            _tprintf(\n                _T(\"Terminates a process by sending a signal.\\n\\n\")\n                _T(\"Usage: kill [ -l ] [ -signal ] pid ...\\n\\n\")\n                _T(\"-l        Lists supported signals\\n\")\n                _T(\"-signal   Sends the specified signal to the given processes.\\n\")\n                _T(\"          signal can be a numeric value specifying the signal number\\n\")\n                _T(\"          or a string listed by the -l parameter. If no signal is\\n\")\n                _T(\"          given SIGTERM (-TERM) is used.\\n\")\n                _T(\"pid       Process id(s) or executables names(s) of processes to \\n\")\n                _T(\"          signal or terminate.\\n\\n\")\n                );\n            ExitProcess( 0 );\n        }\n        else if ( argv[argn] && ( *argv[argn] == '-' || *argv[argn] == '\/' ) )\n        {\n            LPCTSTR argsig = CharNext( argv[argn] );\n\n            int n;\n            for ( n = 0; n < NumSupportedSignals; n++ )\n            {\n                _TCHAR *endptr = NULL;\n\n                if ( 0 == lstrcmpi( SupportedSignals[n].lpSignalName, argsig ) ||\n                     _tcstoul( argsig, &endptr, 0 ) == static_cast< unsigned >(SupportedSignals[n].iSignalValue) && (!endptr || !*endptr) )\n                {\n                    *pSig = SupportedSignals[n].iSignalValue;\n                    break;\n                }\n            }\n\n            if ( n >= NumSupportedSignals )\n            {\n                _ftprintf( stderr,\n                    _T(\"kill: Illegal argument %s\\n\")\n                    _T(\"Type 'kill --help' to show allowed syntax.\\n\")\n                    _T(\"Type 'kill -l' to show supported signals.\\n\"),\n                    argv[argn] );\n                ExitProcess( 0 );\n            }\n        }\n        else\n        {\n            unsigned long value = 0;\n            _TCHAR  *endptr = NULL;\n\n            value = _tcstoul( argv[argn], &endptr, 0 );\n\n            if ( !endptr || !*endptr )\n            {\n                if ( *lpdwNumProcesses < dwMaxProcesses )\n                {\n                    *(lpProcesses++) = value;\n                    (*lpdwNumProcesses)++;\n                }\n            }\n            else\n            {\n                HANDLE  hSnapshot = CreateToolhelp32Snapshot( TH32CS_SNAPPROCESS, 0 );\n\n                if ( IsValidHandle( hSnapshot ) )\n                {\n                    PROCESSENTRY32  pe;\n\n                    pe.dwSize = sizeof(pe);\n                    BOOL fSuccess = Process32First( hSnapshot, &pe );\n\n                    while ( fSuccess )\n                    {\n                        if ( 0 == lstrcmpi( argv[argn], pe.szExeFile ) )\n                        {\n                            if ( *lpdwNumProcesses < dwMaxProcesses )\n                            {\n                                *(lpProcesses++) = pe.th32ProcessID;\n                                (*lpdwNumProcesses)++;\n                            }\n                        }\n                        fSuccess = Process32Next( hSnapshot, &pe );\n                    }\n\n                    CloseHandle( hSnapshot );\n                }\n            }\n        }\n    }\n\n    if ( !*lpdwNumProcesses )\n    {\n        _ftprintf( stderr,\n            _T(\"kill: No process specified.\\n\")\n            _T(\"Use kill --help to show allowed syntax.\\n\")\n            );\n        ExitProcess( 0 );\n    }\n\n}\n\nvoid OutputSystemMessage( DWORD dwErrorCode )\n{\n    LPVOID lpMsgBuf;\n    FormatMessageA(\n                    FORMAT_MESSAGE_ALLOCATE_BUFFER |\n                    FORMAT_MESSAGE_FROM_SYSTEM |\n                    FORMAT_MESSAGE_IGNORE_INSERTS,\n                    NULL,\n                    dwErrorCode,\n                    MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), \/\/ Default language\n                    (LPSTR)&lpMsgBuf,\n                    0,\n                    NULL\n                );\n\n    printf( (LPSTR)lpMsgBuf );\n    LocalFree( lpMsgBuf );\n}\n\nint _tmain()\n{\n    DWORD   dwProcessIds[1024];\n    DWORD   nProcesses = elementsof(dwProcessIds);\n    int     sig = SIGTERM;\n\n\n    ParseCommandArgs( dwProcessIds, &nProcesses, &sig );\n\n    for ( ULONG n = 0; n < nProcesses; n++ )\n    {\n        HANDLE  hProcess;\n\n        _tprintf( _T(\"Sending signal to process id %d...\"), dwProcessIds[n] );\n        hProcess = OpenProcess( PROCESS_TERMINATE | PROCESS_CREATE_THREAD | SYNCHRONIZE |\n            PROCESS_QUERY_INFORMATION | PROCESS_VM_OPERATION | PROCESS_VM_WRITE | PROCESS_VM_READ,\n            FALSE, dwProcessIds[n] );\n\n        if ( IsValidHandle( hProcess ) )\n        {\n            if ( SIGKILL == sig )\n                TerminateProcess( hProcess, 255 );\n            else\n            {\n                if ( RaiseSignalEx( hProcess, sig ) )\n                    _tprintf( _T(\"OK\\n\") );\n                else\n                {\n                    OutputSystemMessage( GetLastError() );\n                }\n            }\n\n            CloseHandle( hProcess );\n        }\n        else\n        {\n            OutputSystemMessage( GetLastError() );\n        }\n    }\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef TD_CLIENT_HPP\n#define TD_CLIENT_HPP\n\n#include <string>\n#include <sstream>\n#include <vector>\n\n#include \"ConnectionSubsys.hpp\"\n\nclass TrainDirClient {\npublic:\n  TrainDirClient() {}\n  ~TrainDirClient() {}\n\n  bool create_connection(int port, std::string host = \"localhost\");\n  void close_connection();\n\n  void click(int x, int y);\n  void run();\n\nprivate:\n  Connection conn;\n};\n\n#endif\n<commit_msg>added defaults.<commit_after>#ifndef TD_CLIENT_HPP\n#define TD_CLIENT_HPP\n\n#include <string>\n#include <sstream>\n#include <vector>\n\n#include \"ConnectionSubsys.hpp\"\n\nclass TrainDirClient {\npublic:\n  TrainDirClient() {}\n  ~TrainDirClient() {}\n\n  bool create_connection(int port = 8900, std::string host = \"127.0.0.1\");\n  void close_connection();\n\n  void click(int x, int y);\n  void run();\n\nprivate:\n  Connection conn;\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef INCLUDED_KONTSEVICH_GRAPH_SUM_H_\n#define INCLUDED_KONTSEVICH_GRAPH_SUM_H_\n\n#include <vector>\n#include <utility>\n#include <ostream>\n#include <kontsevich_graph.hpp>\n\ntemplate<class T> class KontsevichGraphSum;\ntemplate<class T> std::ostream& operator<<(std::ostream&, const KontsevichGraphSum<T>&);\n\ntemplate<class T>\nclass KontsevichGraphSum : public std::vector< std::pair<T, KontsevichGraph> >\n{\n    using std::vector< std::pair<T, KontsevichGraph> >::vector; \/\/ inherit constructors\n    public:\n    void reduce();\n\n    friend std::ostream& operator<< <>(std::ostream& os, const KontsevichGraphSum<T>& gs);\n};\n\n#endif\n<commit_msg>Add handy typedef Term (value_type) in KontsevichGraphSum.<commit_after>#ifndef INCLUDED_KONTSEVICH_GRAPH_SUM_H_\n#define INCLUDED_KONTSEVICH_GRAPH_SUM_H_\n\n#include <vector>\n#include <utility>\n#include <ostream>\n#include <kontsevich_graph.hpp>\n\ntemplate<class T> class KontsevichGraphSum;\ntemplate<class T> std::ostream& operator<<(std::ostream&, const KontsevichGraphSum<T>&);\n\n\ntemplate<class T>\nclass KontsevichGraphSum : public std::vector< std::pair<T, KontsevichGraph> >\n{\n    typedef std::pair<T, KontsevichGraph> Term;\n    using std::vector<Term>::vector; \/\/ inherit constructors\n    public:\n    void reduce();\n\n    friend std::ostream& operator<< <>(std::ostream& os, const KontsevichGraphSum<T>& gs);\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <QtGui>\n#include \"mainwindow.h\"\n\nint main(int argc, char *argv[])\n{\n    QApplication app(argc, argv);\n    app.setApplicationName(\"QMH Remote Control\");\n    app.setOrganizationName(\"Nokia\");\n\n    MainWindow mainWindow;\n#if defined(Q_OS_SYMBIAN) || defined(Q_WS_MAEMO5)\n    mainWindow.showMaximized();\n#else\n    mainWindow.show();\n#endif\n\n    return app.exec();\n}\n\n<commit_msg>remotecontrol: set org domain<commit_after>#include <QtGui>\n#include \"mainwindow.h\"\n\nint main(int argc, char *argv[])\n{\n    QApplication app(argc, argv);\n    app.setApplicationName(\"QMH Remote Control\");\n    app.setOrganizationDomain(\"nokia.com\");\n    app.setOrganizationName(\"Nokia\");\n\n    MainWindow mainWindow;\n#if defined(Q_OS_SYMBIAN) || defined(Q_WS_MAEMO5)\n    mainWindow.showMaximized();\n#else\n    mainWindow.show();\n#endif\n\n    return app.exec();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* KPilot\n**\n** Copyright (C) 2000-2001 by Adriaan de Groot\n**\n** This file defines a specialization of KListView that can\n** be used to sort some fixed set of object into some fixed\n** set of categories.\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** 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 in a file called COPYING; if not, write to\n** the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, \n** MA 02110-1301, USA.\n*\/\n\n\/*\n** Bug reports and questions can be sent to kde-pim@kde.org\n*\/\n\nstatic const char *listCat_id =\n\t\"$Id$\";\n\n#include \"options.h\"\n\n#include <qpainter.h>\n#include <klocale.h>\n\n#include \"listCat.moc\"\n\n\nListCategorizer::ListCategorizer(QWidget * parent,\n\tconst char *name) :\n\tKListView(parent, name), \n\tfStartOpen(false)\n{\n\tFUNCTIONSETUP;\n\tsetupWidget();\n\t(void) listCat_id;\n}\n\nListCategorizer::ListCategorizer(const QStringList & i,\n\tbool startOpen,\n\tQWidget * parent,\n\tconst char *name) :\n\tKListView(parent, name), \n\tfStartOpen(startOpen)\n{\n\tFUNCTIONSETUP;\n\taddCategories(i);\n}\n\nvoid ListCategorizer::addCategories(const QStringList & l)\n{\n\tFUNCTIONSETUP;\n\tQStringList::ConstIterator i;\n\n\tfor (i = l.begin(); i != l.end(); ++i)\n\t{\n\t\t(void) addCategory(*i);\n\t}\n}\n\nQListViewItem *ListCategorizer::addCategory(const QString & name,\n\tconst QString & desc)\n{\n\tFUNCTIONSETUP;\n\tQListViewItem *m = new QListViewItem(this, name, desc);\n\n\tm->setSelectable(false);\n\tm->setOpen(fStartOpen);\n\treturn m;\n}\n\nvoid ListCategorizer::setupWidget()\n{\n\tFUNCTIONSETUP;\n\taddColumn(i18n(\"Category\"));\n\taddColumn(i18n(\"Description\"));\n\tsetItemsMovable(false);\n\tsetDragEnabled(true);\n\tsetAcceptDrops(true);\n\tsetDropVisualizer(true);\n\tsetRootIsDecorated(true);\n}\n\n\/* virtual *\/ bool ListCategorizer::acceptDrag(QDropEvent * event) const\n{\n\tFUNCTIONSETUP;\n\tif (!(event->source()))\n\t\treturn false;\n\tQListViewItem *p = itemAt(event->pos());\n\n\tif (!p)\n\t\treturn false;\n\n\treturn true;\n}\n\n\/* virtual *\/ void ListCategorizer::contentsDropEvent(QDropEvent * e)\n{\n\tFUNCTIONSETUP;\n\tcleanDropVisualizer();\n\n\tif (!acceptDrag(e))\n\t\treturn;\n\te->accept();\n\n\tQListViewItem *p = itemAt(e->pos());\n\tQListViewItem *selection = currentItem();\n\n\tif (!p)\n\t{\n\t\tkdWarning() << \"Drop without a category!\" << endl;\n\t\treturn;\n\t}\n\n\tQListViewItem *category = p->parent();\n\n\tif (!category)\n\t{\n\t\tcategory = p;\n\t}\n\n\tmoveItem(selection, category, 0L);\n}\n\n\/* virtual *\/ void ListCategorizer::startDrag()\n{\n\tFUNCTIONSETUP;\n\tQListViewItem *p = currentItem();\n\n\tif (!p || !p->parent())\n\t\treturn;\n\n\tKListView::startDrag();\n}\n\nQStringList ListCategorizer::listSiblings(const QListViewItem * p, int column) const\n{\n\tFUNCTIONSETUP;\n\tQStringList l;\n\n\twhile (p)\n\t{\n\t\tl.append(p->text(column));\n\t\tp = p->nextSibling();\n\t}\n\n\treturn l;\n}\n\nQListViewItem *ListCategorizer::findCategory(const QString & category) const\n{\n\tFUNCTIONSETUP;\n\tQListViewItem *p = firstChild();\n\n\twhile (p)\n\t{\n\t\tif (p->text(0) == category)\n\t\t\treturn p;\n\t\tp = p->nextSibling();\n\t}\n\n\treturn 0L;\n}\n\nQListViewItem *ListCategorizer::addItem(const QString & category,\n\tconst QString & name, const QString & description)\n{\n\tFUNCTIONSETUP;\n\tQListViewItem *p = findCategory(category);\n\n\tif (!p)\n\t\treturn 0L;\n\n\treturn new QListViewItem(p, name, description);\n}\n\n#define RVPAD\t(4)\n\nRichListViewItem::RichListViewItem(QListViewItem *p,\n\tQString l,\n\tint c) :\n\tQListViewItem(p,l)\n{\n\tFUNCTIONSETUP;\n\n\tfColumns=c;\n\tfIsRich = new bool[c];\n\tfRect = new QRect[c];\n\n\tfor (int i=0; i<c; i++)\n\t{\n\t\tfIsRich[i]=false;\n\t}\n}\n\nRichListViewItem::~RichListViewItem()\n{\n\tFUNCTIONSETUP;\n\n\tdelete[] fIsRich;\n\tdelete[] fRect;\n}\n\nvoid RichListViewItem::computeHeight(int c)\n{\n\tFUNCTIONSETUP;\n\n\tif (!fIsRich[c]) return;\n\n\tQListView *v = listView();\n\t\n\tfRect[c] = v->fontMetrics().boundingRect(v->itemMargin()+RVPAD,0+RVPAD,\n\t\tv->columnWidth(c)-v->itemMargin()-RVPAD,300,\n\t\tAlignLeft | AlignTop | WordBreak,\n\t\ttext(c));\n}\n\n\n\/* virtual *\/ void RichListViewItem::setup()\n{\n\tFUNCTIONSETUP;\n\n\tQListViewItem::setup();\n\n\tint h = height();\n\n\tfor (int i=0; i<fColumns; i++)\n\t{\n\t\tcomputeHeight(i);\n\t\th = QMAX(h,fRect[i].height()+2*RVPAD);\n\t}\n\n\tsetHeight(h);\n}\n\n\n\/* virtual *\/ void RichListViewItem::paintCell(QPainter *p,\n\tconst QColorGroup &gc,\n\tint column,\n\tint width,\n\tint alignment)\n{\n\tFUNCTIONSETUP;\n\n\tif ((!column) || (!fIsRich[column]))\n\t{\n\t\tQListViewItem::paintCell(p,gc,column,width,alignment);\n\t\treturn;\n\t}\n\n\tQListView *v = listView();\n\n\tp->eraseRect(0,0,width,height());\n\tp->setBackgroundColor(gc.background());\n\tp->eraseRect(RVPAD,RVPAD,width-RVPAD,height()-RVPAD);\n\tp->setPen(gc.text());\n\tp->drawText(v->itemMargin()+RVPAD,0+RVPAD,\n\t\twidth-v->itemMargin()-RVPAD,height()-RVPAD,\n\t\tAlignTop | AlignLeft | WordBreak,\n\t\ttext(column),\n\t\t-1,\n\t\t&fRect[column]);\n}\n<commit_msg>QMAX -> qMax<commit_after>\/* KPilot\n**\n** Copyright (C) 2000-2001 by Adriaan de Groot\n**\n** This file defines a specialization of KListView that can\n** be used to sort some fixed set of object into some fixed\n** set of categories.\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** 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 in a file called COPYING; if not, write to\n** the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, \n** MA 02110-1301, USA.\n*\/\n\n\/*\n** Bug reports and questions can be sent to kde-pim@kde.org\n*\/\n\nstatic const char *listCat_id =\n\t\"$Id$\";\n\n#include \"options.h\"\n\n#include <qpainter.h>\n#include <klocale.h>\n\n#include \"listCat.moc\"\n\n\nListCategorizer::ListCategorizer(QWidget * parent,\n\tconst char *name) :\n\tKListView(parent, name), \n\tfStartOpen(false)\n{\n\tFUNCTIONSETUP;\n\tsetupWidget();\n\t(void) listCat_id;\n}\n\nListCategorizer::ListCategorizer(const QStringList & i,\n\tbool startOpen,\n\tQWidget * parent,\n\tconst char *name) :\n\tKListView(parent, name), \n\tfStartOpen(startOpen)\n{\n\tFUNCTIONSETUP;\n\taddCategories(i);\n}\n\nvoid ListCategorizer::addCategories(const QStringList & l)\n{\n\tFUNCTIONSETUP;\n\tQStringList::ConstIterator i;\n\n\tfor (i = l.begin(); i != l.end(); ++i)\n\t{\n\t\t(void) addCategory(*i);\n\t}\n}\n\nQListViewItem *ListCategorizer::addCategory(const QString & name,\n\tconst QString & desc)\n{\n\tFUNCTIONSETUP;\n\tQListViewItem *m = new QListViewItem(this, name, desc);\n\n\tm->setSelectable(false);\n\tm->setOpen(fStartOpen);\n\treturn m;\n}\n\nvoid ListCategorizer::setupWidget()\n{\n\tFUNCTIONSETUP;\n\taddColumn(i18n(\"Category\"));\n\taddColumn(i18n(\"Description\"));\n\tsetItemsMovable(false);\n\tsetDragEnabled(true);\n\tsetAcceptDrops(true);\n\tsetDropVisualizer(true);\n\tsetRootIsDecorated(true);\n}\n\n\/* virtual *\/ bool ListCategorizer::acceptDrag(QDropEvent * event) const\n{\n\tFUNCTIONSETUP;\n\tif (!(event->source()))\n\t\treturn false;\n\tQListViewItem *p = itemAt(event->pos());\n\n\tif (!p)\n\t\treturn false;\n\n\treturn true;\n}\n\n\/* virtual *\/ void ListCategorizer::contentsDropEvent(QDropEvent * e)\n{\n\tFUNCTIONSETUP;\n\tcleanDropVisualizer();\n\n\tif (!acceptDrag(e))\n\t\treturn;\n\te->accept();\n\n\tQListViewItem *p = itemAt(e->pos());\n\tQListViewItem *selection = currentItem();\n\n\tif (!p)\n\t{\n\t\tkdWarning() << \"Drop without a category!\" << endl;\n\t\treturn;\n\t}\n\n\tQListViewItem *category = p->parent();\n\n\tif (!category)\n\t{\n\t\tcategory = p;\n\t}\n\n\tmoveItem(selection, category, 0L);\n}\n\n\/* virtual *\/ void ListCategorizer::startDrag()\n{\n\tFUNCTIONSETUP;\n\tQListViewItem *p = currentItem();\n\n\tif (!p || !p->parent())\n\t\treturn;\n\n\tKListView::startDrag();\n}\n\nQStringList ListCategorizer::listSiblings(const QListViewItem * p, int column) const\n{\n\tFUNCTIONSETUP;\n\tQStringList l;\n\n\twhile (p)\n\t{\n\t\tl.append(p->text(column));\n\t\tp = p->nextSibling();\n\t}\n\n\treturn l;\n}\n\nQListViewItem *ListCategorizer::findCategory(const QString & category) const\n{\n\tFUNCTIONSETUP;\n\tQListViewItem *p = firstChild();\n\n\twhile (p)\n\t{\n\t\tif (p->text(0) == category)\n\t\t\treturn p;\n\t\tp = p->nextSibling();\n\t}\n\n\treturn 0L;\n}\n\nQListViewItem *ListCategorizer::addItem(const QString & category,\n\tconst QString & name, const QString & description)\n{\n\tFUNCTIONSETUP;\n\tQListViewItem *p = findCategory(category);\n\n\tif (!p)\n\t\treturn 0L;\n\n\treturn new QListViewItem(p, name, description);\n}\n\n#define RVPAD\t(4)\n\nRichListViewItem::RichListViewItem(QListViewItem *p,\n\tQString l,\n\tint c) :\n\tQListViewItem(p,l)\n{\n\tFUNCTIONSETUP;\n\n\tfColumns=c;\n\tfIsRich = new bool[c];\n\tfRect = new QRect[c];\n\n\tfor (int i=0; i<c; i++)\n\t{\n\t\tfIsRich[i]=false;\n\t}\n}\n\nRichListViewItem::~RichListViewItem()\n{\n\tFUNCTIONSETUP;\n\n\tdelete[] fIsRich;\n\tdelete[] fRect;\n}\n\nvoid RichListViewItem::computeHeight(int c)\n{\n\tFUNCTIONSETUP;\n\n\tif (!fIsRich[c]) return;\n\n\tQListView *v = listView();\n\t\n\tfRect[c] = v->fontMetrics().boundingRect(v->itemMargin()+RVPAD,0+RVPAD,\n\t\tv->columnWidth(c)-v->itemMargin()-RVPAD,300,\n\t\tAlignLeft | AlignTop | WordBreak,\n\t\ttext(c));\n}\n\n\n\/* virtual *\/ void RichListViewItem::setup()\n{\n\tFUNCTIONSETUP;\n\n\tQListViewItem::setup();\n\n\tint h = height();\n\n\tfor (int i=0; i<fColumns; i++)\n\t{\n\t\tcomputeHeight(i);\n\t\th = qMax(h,fRect[i].height()+2*RVPAD);\n\t}\n\n\tsetHeight(h);\n}\n\n\n\/* virtual *\/ void RichListViewItem::paintCell(QPainter *p,\n\tconst QColorGroup &gc,\n\tint column,\n\tint width,\n\tint alignment)\n{\n\tFUNCTIONSETUP;\n\n\tif ((!column) || (!fIsRich[column]))\n\t{\n\t\tQListViewItem::paintCell(p,gc,column,width,alignment);\n\t\treturn;\n\t}\n\n\tQListView *v = listView();\n\n\tp->eraseRect(0,0,width,height());\n\tp->setBackgroundColor(gc.background());\n\tp->eraseRect(RVPAD,RVPAD,width-RVPAD,height()-RVPAD);\n\tp->setPen(gc.text());\n\tp->drawText(v->itemMargin()+RVPAD,0+RVPAD,\n\t\twidth-v->itemMargin()-RVPAD,height()-RVPAD,\n\t\tAlignTop | AlignLeft | WordBreak,\n\t\ttext(column),\n\t\t-1,\n\t\t&fRect[column]);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2013-2014 Daniel Nicoletti <dantti12@gmail.com>\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 \"engineuwsgi.h\"\n#include \"plugin.h\"\n\n#include <Cutelyst\/application.h>\n#include <Cutelyst\/context.h>\n#include <Cutelyst\/response.h>\n#include <Cutelyst\/request.h>\n\n#include <QPluginLoader>\n#include <QFile>\n#include <QUrl>\n#include <QDebug>\n\nextern struct uwsgi_server uwsgi;\n\nusing namespace Cutelyst;\n\nEngineUwsgi::EngineUwsgi(QObject *parent) :\n    Engine(parent),\n    m_loader(0)\n{\n}\n\nbool EngineUwsgi::loadApplication(const QString &path)\n{\n    if (m_loader) {\n        delete m_loader->instance();\n        delete m_loader;\n    }\n\n    m_loader = new QPluginLoader(path);\n    if (m_loader->load()) {\n        QObject *instance = m_loader->instance();\n        if (instance) {\n            Application *app = qobject_cast<Application *>(instance);\n            if (app) {\n                qDebug() << \"Application\"\n                         << app->applicationName()\n                         << \"loaded.\";\n                return setupApplication(app);\n            } else {\n                qCritical() << \"Could not create an instance of the application:\" << instance;\n            }\n        } else {\n            qCritical() << \"Could not create an instance:\" << path;\n        }\n    } else {\n        qWarning() << \"Failed to open app:\" << m_loader->errorString();\n    }\n    return false;\n}\n\nvoid EngineUwsgi::finalizeBody(Context *ctx)\n{\n    Response *res = ctx->res();\n    struct wsgi_request *wsgi_req = static_cast<wsgi_request*>(requestPtr(ctx->req()));\n\n    uwsgi_response_write_body_do(wsgi_req, res->body().data(), res->body().size());\n}\n\nvoid EngineUwsgi::processRequest(struct wsgi_request *wsgi_req)\n{\n    Request *request;\n    QByteArray host(wsgi_req->host, wsgi_req->host_len);\n    QByteArray path(wsgi_req->path_info, wsgi_req->path_info_len);\n    QUrlQuery queryString(QByteArray(wsgi_req->query_string, wsgi_req->query_string_len));\n    request = newRequest(wsgi_req,\n                         wsgi_req->https_len ? \"http\" : \"https\",\n                         host,\n                         path,\n                         queryString);\n\n    QByteArray remote(wsgi_req->remote_addr, wsgi_req->remote_addr_len);\n\n    QByteArray method(wsgi_req->method, wsgi_req->method_len);\n\n    QByteArray protocol(wsgi_req->protocol, wsgi_req->protocol_len);\n\n    QHash<QByteArray, QByteArray> headers;\n    for (int i = 0; i < wsgi_req->var_cnt; i += 2) {\n        if (wsgi_req->hvec[i].iov_len < 6) {\n            continue;\n        }\n\n        if (!uwsgi_startswith((char *) wsgi_req->hvec[i].iov_base,\n                              const_cast<char *>(\"HTTP_\"), 5)) {\n            QByteArray key((char *) wsgi_req->hvec[i].iov_base+5, wsgi_req->hvec[i].iov_len-5);\n            QByteArray value((char *) wsgi_req->hvec[i + 1].iov_base, wsgi_req->hvec[i + 1].iov_len);\n            headers.insert(httpCase(key), value);\n        }\n    }\n\n    QByteArray contentType(wsgi_req->content_type, wsgi_req->content_type_len);\n    if (!contentType.isNull()) {\n        headers.insert(\"Content-Type\", contentType);\n    }\n\n    QByteArray contentEncoding(wsgi_req->encoding, wsgi_req->encoding_len);\n    if (!contentEncoding.isNull()) {\n        headers.insert(\"Content-Encoding\", contentEncoding);\n    }\n\n    QByteArray remoteUser(wsgi_req->remote_user, wsgi_req->remote_user_len);\n\n    QByteArray bodyArray;\n    size_t remains = wsgi_req->post_cl;\n    while(remains > 0) {\n        ssize_t body_len = 0;\n        char *body =  uwsgi_request_body_read(wsgi_req, UMIN(remains, 32768) , &body_len);\n        if (!body || body == uwsgi.empty) {\n            break;\n        }\n\n        bodyArray.append(body, body_len);\n    }\n\n    uint16_t remote_port_len;\n    char *remote_port = uwsgi_get_var(wsgi_req, (char *) \"REMOTE_PORT\", 11, &remote_port_len);\n    QByteArray remotePort(remote_port, remote_port_len);\n\n    QFile *upload = new QFile;\n    if (wsgi_req->post_file && !upload->open(wsgi_req->post_file, QIODevice::ReadOnly)) {\n        qDebug() << \"Could not open upload file\";\n    }\n\n    setupRequest(request,\n                 method,\n                 protocol,\n                 headers,\n                 bodyArray,\n                 remoteUser,\n                 QHostAddress(remote.data()),\n                 remotePort.toUInt(),\n                 upload);\n\n    handleRequest(request, new Response);\n}\n\nQByteArray EngineUwsgi::httpCase(const QByteArray &headerKey) const\n{\n    QByteArray ret;\n\n    bool lastWasUnderscore = false;\n\n    for (int i = 0 ; i < headerKey.size() ; ++i) {\n        QChar buf = headerKey[i];\n        if(i == 0 || lastWasUnderscore) {\n            ret += buf.toUpper();\n            lastWasUnderscore = false;\n        } else  if (buf == '_') {\n            ret += '-';\n            lastWasUnderscore = true;\n        } else {\n            ret += buf.toLower();\n            lastWasUnderscore = false;\n        }\n    }\n\n    return ret;\n}\n\nvoid EngineUwsgi::finalizeHeaders(Context *ctx)\n{\n    Response *res = ctx->res();\n    struct wsgi_request *wsgi_req = static_cast<wsgi_request*>(requestPtr(ctx->req()));\n\n    if (uwsgi_response_prepare_headers(wsgi_req,\n                                       res->statusCode().data(),\n                                       res->statusCode().size())) {\n        return;\n    }\n\n    QMap<QByteArray, QByteArray> headers = ctx->res()->headers();\n    QMap<QByteArray, QByteArray>::Iterator it = headers.begin();\n    while (it != headers.end()) {\n        QByteArray key = it.key();\n        if (uwsgi_response_add_header(wsgi_req,\n                                      key.data(),\n                                      key.size(),\n                                      it.value().data(),\n                                      it.value().size())) {\n            return;\n        }\n        ++it;\n    }\n}\n\nbool EngineUwsgi::init()\n{\n    return true;\n}\n\nEngineUwsgi *engine;\n\nextern \"C\" int uwsgi_cutelyst_init()\n{\n    uwsgi_log(\"Initializing Cutelyst plugin\\n\");\n\n    engine = new EngineUwsgi;\n\n    return 0;\n}\n\nextern \"C\" int uwsgi_cutelyst_request(struct wsgi_request *wsgi_req)\n{\n    \/\/ empty request ?\n    if (!wsgi_req->uh->pktsize) {\n        uwsgi_log( \"Invalid request. skip.\\n\");\n        goto clear;\n    }\n\n    \/\/ get uwsgi variables\n    if (uwsgi_parse_vars(wsgi_req)) {\n        uwsgi_log(\"Invalid request. skip.\\n\");\n        goto clear;\n    }\n\n    engine->processRequest(wsgi_req);\n\nclear:\n    return UWSGI_OK;\n}\n\nextern \"C\" void uwsgi_cutelyst_init_apps()\n{\n    uwsgi_log(\"Cutelyst Init App\\n\");\n\n    QString path(options.app);\n    if (path.isEmpty()) {\n        qCritical() << \"Cytelyst Application was not set\";\n        return;\n    }\n\n    qDebug()  << \"Loading\" << path;\n    if (!engine->loadApplication(path)) {\n        qCritical() << \"Could not load application:\" << path;\n        return;\n    }\n\n    \/\/ get the current app id\n    int id = uwsgi_apps_cnt;\n\n    \/\/ register a new app under a specific \"mountpoint\"\n    uwsgi_add_app(id, CUTELYST_MODIFIER1, NULL, 0, NULL, NULL);\n}\n<commit_msg>Creating a QCoreApplication on uwsgi plugin init allows for some async stuff to work, namely QTimers aren't working (maybe due the lack of QThread).<commit_after>\/*\n * Copyright (C) 2013-2014 Daniel Nicoletti <dantti12@gmail.com>\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 \"engineuwsgi.h\"\n#include \"plugin.h\"\n\n#include <Cutelyst\/application.h>\n#include <Cutelyst\/context.h>\n#include <Cutelyst\/response.h>\n#include <Cutelyst\/request.h>\n\n#include <QPluginLoader>\n#include <QFile>\n#include <QUrl>\n#include <QDebug>\n\nextern struct uwsgi_server uwsgi;\n\nusing namespace Cutelyst;\n\nEngineUwsgi::EngineUwsgi(QObject *parent) :\n    Engine(parent),\n    m_loader(0)\n{\n}\n\nbool EngineUwsgi::loadApplication(const QString &path)\n{\n    if (m_loader) {\n        delete m_loader->instance();\n        delete m_loader;\n    }\n\n    m_loader = new QPluginLoader(path);\n    if (m_loader->load()) {\n        QObject *instance = m_loader->instance();\n        if (instance) {\n            Application *app = qobject_cast<Application *>(instance);\n            if (app) {\n                qDebug() << \"Application\"\n                         << app->applicationName()\n                         << \"loaded.\";\n                return setupApplication(app);\n            } else {\n                qCritical() << \"Could not create an instance of the application:\" << instance;\n            }\n        } else {\n            qCritical() << \"Could not create an instance:\" << path;\n        }\n    } else {\n        qWarning() << \"Failed to open app:\" << m_loader->errorString();\n    }\n    return false;\n}\n\nvoid EngineUwsgi::finalizeBody(Context *ctx)\n{\n    Response *res = ctx->res();\n    struct wsgi_request *wsgi_req = static_cast<wsgi_request*>(requestPtr(ctx->req()));\n\n    uwsgi_response_write_body_do(wsgi_req, res->body().data(), res->body().size());\n}\n\nvoid EngineUwsgi::processRequest(struct wsgi_request *wsgi_req)\n{\n    Request *request;\n    QByteArray host(wsgi_req->host, wsgi_req->host_len);\n    QByteArray path(wsgi_req->path_info, wsgi_req->path_info_len);\n    QUrlQuery queryString(QByteArray(wsgi_req->query_string, wsgi_req->query_string_len));\n    request = newRequest(wsgi_req,\n                         wsgi_req->https_len ? \"http\" : \"https\",\n                         host,\n                         path,\n                         queryString);\n\n    QByteArray remote(wsgi_req->remote_addr, wsgi_req->remote_addr_len);\n\n    QByteArray method(wsgi_req->method, wsgi_req->method_len);\n\n    QByteArray protocol(wsgi_req->protocol, wsgi_req->protocol_len);\n\n    QHash<QByteArray, QByteArray> headers;\n    for (int i = 0; i < wsgi_req->var_cnt; i += 2) {\n        if (wsgi_req->hvec[i].iov_len < 6) {\n            continue;\n        }\n\n        if (!uwsgi_startswith((char *) wsgi_req->hvec[i].iov_base,\n                              const_cast<char *>(\"HTTP_\"), 5)) {\n            QByteArray key((char *) wsgi_req->hvec[i].iov_base+5, wsgi_req->hvec[i].iov_len-5);\n            QByteArray value((char *) wsgi_req->hvec[i + 1].iov_base, wsgi_req->hvec[i + 1].iov_len);\n            headers.insert(httpCase(key), value);\n        }\n    }\n\n    QByteArray contentType(wsgi_req->content_type, wsgi_req->content_type_len);\n    if (!contentType.isNull()) {\n        headers.insert(\"Content-Type\", contentType);\n    }\n\n    QByteArray contentEncoding(wsgi_req->encoding, wsgi_req->encoding_len);\n    if (!contentEncoding.isNull()) {\n        headers.insert(\"Content-Encoding\", contentEncoding);\n    }\n\n    QByteArray remoteUser(wsgi_req->remote_user, wsgi_req->remote_user_len);\n\n    QByteArray bodyArray;\n    size_t remains = wsgi_req->post_cl;\n    while(remains > 0) {\n        ssize_t body_len = 0;\n        char *body =  uwsgi_request_body_read(wsgi_req, UMIN(remains, 32768) , &body_len);\n        if (!body || body == uwsgi.empty) {\n            break;\n        }\n\n        bodyArray.append(body, body_len);\n    }\n\n    uint16_t remote_port_len;\n    char *remote_port = uwsgi_get_var(wsgi_req, (char *) \"REMOTE_PORT\", 11, &remote_port_len);\n    QByteArray remotePort(remote_port, remote_port_len);\n\n    QFile *upload = new QFile;\n    if (wsgi_req->post_file && !upload->open(wsgi_req->post_file, QIODevice::ReadOnly)) {\n        qDebug() << \"Could not open upload file\";\n    }\n\n    setupRequest(request,\n                 method,\n                 protocol,\n                 headers,\n                 bodyArray,\n                 remoteUser,\n                 QHostAddress(remote.data()),\n                 remotePort.toUInt(),\n                 upload);\n\n    handleRequest(request, new Response);\n}\n\nQByteArray EngineUwsgi::httpCase(const QByteArray &headerKey) const\n{\n    QByteArray ret;\n\n    bool lastWasUnderscore = false;\n\n    for (int i = 0 ; i < headerKey.size() ; ++i) {\n        QChar buf = headerKey[i];\n        if(i == 0 || lastWasUnderscore) {\n            ret += buf.toUpper();\n            lastWasUnderscore = false;\n        } else  if (buf == '_') {\n            ret += '-';\n            lastWasUnderscore = true;\n        } else {\n            ret += buf.toLower();\n            lastWasUnderscore = false;\n        }\n    }\n\n    return ret;\n}\n\nvoid EngineUwsgi::finalizeHeaders(Context *ctx)\n{\n    Response *res = ctx->res();\n    struct wsgi_request *wsgi_req = static_cast<wsgi_request*>(requestPtr(ctx->req()));\n\n    if (uwsgi_response_prepare_headers(wsgi_req,\n                                       res->statusCode().data(),\n                                       res->statusCode().size())) {\n        return;\n    }\n\n    QMap<QByteArray, QByteArray> headers = ctx->res()->headers();\n    QMap<QByteArray, QByteArray>::Iterator it = headers.begin();\n    while (it != headers.end()) {\n        QByteArray key = it.key();\n        if (uwsgi_response_add_header(wsgi_req,\n                                      key.data(),\n                                      key.size(),\n                                      it.value().data(),\n                                      it.value().size())) {\n            return;\n        }\n        ++it;\n    }\n}\n\nbool EngineUwsgi::init()\n{\n    return true;\n}\n\nEngineUwsgi *engine;\n\nextern \"C\" int uwsgi_cutelyst_init()\n{\n    uwsgi_log(\"Initializing Cutelyst plugin\\n\");\n\n    \/\/ This allows for some stuff to run event loops\n    (void) new QCoreApplication(uwsgi.argc, uwsgi.argv);\n\n    engine = new EngineUwsgi;\n\n    return 0;\n}\n\nextern \"C\" int uwsgi_cutelyst_request(struct wsgi_request *wsgi_req)\n{\n    \/\/ empty request ?\n    if (!wsgi_req->uh->pktsize) {\n        uwsgi_log( \"Invalid request. skip.\\n\");\n        goto clear;\n    }\n\n    \/\/ get uwsgi variables\n    if (uwsgi_parse_vars(wsgi_req)) {\n        uwsgi_log(\"Invalid request. skip.\\n\");\n        goto clear;\n    }\n\n    engine->processRequest(wsgi_req);\n\nclear:\n    return UWSGI_OK;\n}\n\nextern \"C\" void uwsgi_cutelyst_init_apps()\n{\n    uwsgi_log(\"Cutelyst Init App\\n\");\n\n    QString path(options.app);\n    if (path.isEmpty()) {\n        qCritical() << \"Cytelyst Application was not set\";\n        return;\n    }\n\n    qDebug()  << \"Loading\" << path;\n    if (!engine->loadApplication(path)) {\n        qCritical() << \"Could not load application:\" << path;\n        return;\n    }\n\n    \/\/ get the current app id\n    int id = uwsgi_apps_cnt;\n\n    \/\/ register a new app under a specific \"mountpoint\"\n    uwsgi_add_app(id, CUTELYST_MODIFIER1, NULL, 0, NULL, NULL);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** Implementation of canonpy.\n *\/\n\n#include <canonpy.h>\n\n#include <Python.h>\n\n#include <algorithm>\n#include <string>\n\n#include <libcanon\/perm.h>\n\nusing libcanon::Simple_perm;\n\n\/\/\n\/\/ Perm class\n\/\/ ==========\n\/\/\n\/\/ Internal functions\n\/\/ ------------------\n\/\/\n\/\/ These functions are not directly set to Python types but are used\n\/\/ internally.  They are also used by other parts of this extension.\n\/\/\n\n\/** Builds a tuple object for a permutation.\n *\n * This function creates a pair, where the first field is a list of integers\n * for the preimage array, and the second field is the accompanied action,\n * which is also encoded as an integer.\n *\/\n\nstatic PyObject* build_perm_to_tuple(const Simple_perm& perm)\n{\n\n    PyObject* pre_images = NULL;\n    PyObject* res = NULL;\n    PyObject* acc = NULL;\n    size_t size = perm.size();\n\n    pre_images = PyList_New(size);\n    if (!pre_images)\n        goto error;\n    for (size_t i = 0; i < size; ++i) {\n        PyObject* curr = Py_BuildValue('n', perm >> i);\n        if (curr) {\n            PyList_SetItem(pre_images, i, curr);\n        } else {\n            goto error;\n        }\n    }\n\n    acc = Py_BuildValue('b', perm.acc());\n    if (!acc)\n        goto error;\n\n    res = PyTuple_New(2);\n    if (!res)\n        goto error;\n\n    PyTuple_SET_ITEM(res, 0, pre_images);\n    PyTuple_SET_ITEM(res, 1, acc);\n\n    return (PyObject*)res;\n\nerror:\n    Py_XDECREF(pre_images);\n    Py_XDECREF(res);\n    Py_XDECREF(acc);\n    return NULL;\n}\n\n\/** Builds a permutation from its construction arguments.\n *\n * An iterable of positive integers for the pre-image array needs to be given\n * as the first argument.  The accompanied action can be optionally given as\n * another integral argument, or by the keyword ``acc``.\n *\n * If the arguments are not valid, a Perm of size zero is going to be returned.\n *\n * This function is designed to be compatible with the result from the function\n * `build_perm_to_tuple`.  However, more general input format is accepted.\n *\/\n\nstatic Simple_perm make_perm_from_args(PyObject* args, PyObject* kwargs);\n\n\/\/\n\/\/ Interface functions\n\/\/ -------------------\n\/\/\n\nconst static char* perm_getnewargs_doc\n    = \"Get the arguments for new to construct the Perm.\";\n\nstatic PyObject* perm_getnewargs(Perm_object* self)\n{\n    \/\/ Here we directly use the tuple format of a perm.\n\n    return build_perm_to_tuple(self->perm);\n}\n\n\/** Gets the size of the permutation domain of a Perm.\n *\/\n\nstatic Py_ssize_t perm_length(Perm_object* self)\n{\n    \/\/ The type should be the same, size_t and Py_ssize_t.\n\n    return self->perm.size();\n}\n\n\/** Gets the pre-image of a point.\n *\n * A new integer object will be built by this function.\n *\/\n\nstatic PyObject* perm_item(Perm_object* self, Py_ssize_t i)\n{\n    if (i < 0 || i >= self->perm.size()) {\n        PyErr_SetString(PyExc_IndexError, \"Point outside permutation domain\");\n        return NULL;\n    }\n\n    return Py_BuildValue(\"n\", self->perm >> i);\n}\n\n\/** Gets the accompanied action of a Perm.\n *\/\n\nstatic PyObject* perm_get_acc(Perm_object* self, void* closure)\n{\n    \/\/ Note that the accompanied action is a byte in simple perm.\n\n    return Py_BuildValue(\"b\", self->perm.acc());\n}\n\n\/** Deallocates a perm instance.\n *\/\n\nstatic void perm_dealloc(Perm_object* self)\n{\n    perm.perm.~Simple_perm();\n\n    \/\/ For subclassing.\n    Py_TYPE(self)->tp_free((PyObject*)self);\n}\n\n\/** Forms the string representation of a Perm object.\n *\/\n\nstatic PyObject* perm_repr(Perm_object* self)\n{\n    const Simple_perm& perm = self->perm;\n\n    std::wstring repr(\"Perm(\");\n\n    size_t size = perm.size();\n\n    if (size > 0) {\n        for (size_t i = 0; i < size; ++i) {\n            if (i == 0) {\n                repr.append('[');\n            } else {\n                repr.append(\", \");\n            }\n            repr.append(std::to_wstring(perm >> i));\n        }\n        repr.append(']');\n\n        \/\/ Add the accompanied action only when we need.\n        char acc = perm.acc();\n        if (acc != 0) {\n            repr.append(\", \");\n            repr.append(std::to_wstring(acc));\n        }\n    }\n\n    \/\/ This is used for empty or non-empty permutation.\n    repr.append(')');\n\n    return PyUnicode_FromUnicode(repr.data(), repr.size());\n}\n\n\/** Gets the hash of a perm.\n *\/\n\nstatic Py_hash_t perm_hash(Perm_object* self)\n{\n    \/\/ Py_hash_t should be compatible with size_t.\n\n    return self->perm.hash();\n}\n\n\/** Creates a new Perm object.\n *\n * The actual work is delegated to the Python\/Perm interface function.\n *\/\n\nstatic PyObject* perm_new(PyTypeObject* type, PyObject* args, PyObject* kwargs)\n{\n    Perm_object* self;\n\n    \/\/ Pay attention to subclassing.\n    self = (Perm_object*)type->tp_alloc(type, 0);\n\n    if (!self)\n        return NULL;\n\n    Simple_perm perm = get_perm_from_args(args, kwargs);\n\n    if (perm.size() > 0) {\n        new (&self->perm) Simple_perm(std::move(perm));\n        return (PyObject*)self;\n    } else {\n        return NULL;\n    }\n}\n\n\/\/\n\/\/ Class definition\n\/\/ ----------------\n\/\/\n\n\/** Methods for Perm objects.\n *\/\n\nstatic PyMethodDef perm_methods[] = {\n    { \"__getnewargs__\", (PyCFunction)perm_getnewargs, METH_NOARGS,\n        perm_getnewargs_doc },\n    { NULL, NULL } \/* sentinel *\/\n};\n\n\/** Sequence operations for Perm objects.\n *\n * Here we only support size and pre-image query.\n *\/\n\n\/\/ clang-format off\nstatic PySequenceMethods perm_as_sequence = {\n    (lenfunc)perm_length,                       \/* sq_length *\/\n    0,                                          \/* sq_concat *\/\n    0,                                          \/* sq_repeat *\/\n    (ssizeargfunc)perm_item,                    \/* sq_item *\/\n    0,                                          \/* sq_slice *\/\n    0,                                          \/* sq_ass_item *\/\n    0,                                          \/* sq_ass_slice *\/\n    0                                           \/* sq_contains *\/\n};\n\/\/ clang-format on\n\n\/** Accessors for Perms.\n *\n * The accompanied action query is made here.\n *\/\n\n\/\/ clang-format off\nstatic PyGetSetDef perm_getsets[] = {\n    { \"acc\", (getter)perm_get_acc, NULL, \"The accompanied action.\", NULL },\n    { NULL }\n};\n\/\/ clang-format on\n\n\/** Perm type doc string.\n  *\/\n\nstatic char* perm_doc =\n    R\"__doc__(Permutation of points with accompanied action.\n\nPermutations can be constructed from an iterable giving the pre-image of the\npoints and an optional integral value for the accompanied action.  The\naccompanied action can be given positionally or by the keyword ``acc``, and it\nwill be manipulated according to the convention in libcanon.\n\nQuerying the length of a Perm object gives the size of the permutation domain,\nwhile indexing it gives the pre-image of the given integral point.  The\naccompanied action can be obtained by getting the attribute ``acc``.\nOtherwise, this data type is mostly opaque.\n\n)__doc__\"\n\n\/** Type definition for Perm class.\n *\/\n\n\/\/ clang-format off\nstatic PyTypeObject perm_type = {\n    PyVarObject_HEAD_INIT(NULL, 0)\n    \"drudge.canonpy.Perm\",\n    sizeof(Perm_object),\n    0,\n    (destructor) perm_dealloc,                  \/* tp_dealloc *\/\n    0,                                          \/* tp_print *\/\n    0,                                          \/* tp_getattr *\/\n    0,                                          \/* tp_setattr *\/\n    0,                                          \/* tp_reserved *\/\n    (reprfunc) perm_repr,                       \/* tp_repr *\/\n    0,                                          \/* tp_as_number *\/\n    &perm_as_sequence,                          \/* tp_as_sequence *\/\n    0,                                          \/* tp_as_mapping *\/\n    (hashfunc) perm_hash,                       \/* tp_hash *\/\n    0,                                          \/* tp_call *\/\n    0,                                          \/* tp_str *\/\n    0, \/* In main. *\/                           \/* tp_getattro *\/\n    0,                                          \/* tp_setattro *\/\n    0,                                          \/* tp_as_buffer *\/\n    Py_TPFLAGS_DEFAULT,                         \/* tp_flags *\/\n    perm_doc,                                   \/* tp_doc *\/\n    0,                                          \/* tp_traverse *\/\n    0,                                          \/* tp_clear *\/\n    0,                                          \/* tp_richcompare *\/\n    0,                                          \/* tp_weaklistoffset *\/\n    0,                                          \/* tp_iter *\/\n    0,                                          \/* tp_iternext *\/\n    perm_methods,                               \/* tp_methods *\/\n    0,                                          \/* tp_members *\/\n    perm_getsets,                               \/* tp_getset *\/\n    0,                                          \/* tp_base *\/\n    0,                                          \/* tp_dict *\/\n    0,                                          \/* tp_descr_get *\/\n    0,                                          \/* tp_descr_set *\/\n    0,                                          \/* tp_dictoffset *\/\n    0,                                          \/* tp_init *\/\n    0,                                          \/* tp_alloc *\/\n    perm_new,                                   \/* tp_new *\/\n    0,                                          \/* tp_free *\/\n};\n\/\/ clang-format on\n\n\/\/\n\/\/ Python module definition\n\/\/ ========================\n\/\/\n\n\/** Docstring for the canonpy module.\n *\/\n\nstatic const char* canonpy_docstring\n    = R\"__doc__(Canonpy, simple wrapper over libcanon for Python.\n\nThis wrapper of libcanon is directly targeted towards usage using drudge.\nHere, we have a class `Perm`, which wraps over the `Simple_perm` class in\nlibcanon, another class `SimsTransv`, which wraps over the `Sims_trasv` class\nfor `Simple_perm`.  And we also have the function `canon_eldag` to canonicalize\nan Eldag.\n\n)__doc__\";\n\n\/** Methods in the canonpy module.\n *\/\n\nstatic PyMethodDef canonpy_methods[] = { { NULL, NULL, 0, NULL } };\n\n\/** Executes the initialization of the canonpy module.\n *\/\n\nstatic int canopy_exec(PyObject* m)\n{\n    \/\/\n    \/\/ Add the class for Perm.\n    \/\/\n\n    perm_type.tp_getattro = PyObject_GenericGetAttr;\n    if (PyType_Ready(&perm_type) < 0)\n        return NULL;\n    Py_INCREF(&perm_type);\n    PyModule_AddObject(m, \"Perm\", (PyObject*)&perm_type);\n\n    return 0;\n}\n\n\/** Slots for for canonpy module definition.\n *\/\n\nstatic struct PyModuleDef_Slot canonpy_slots[] = {\n    { Py_mod_exec, canonpy_exec }, { 0, NULL },\n};\n\n\/** Canonpy module definition.\n *\/\n\n\/\/ clang-format off\n\nstatic struct PyModuleDef canonpy_module = {\n    PyModuleDef_HEAD_INIT,\n    \"drudge.canonpy\",\n    canonpy_docstring,\n    0, \/\/ m-size\n    canonpy_methods,\n    canonpy_slots,\n    NULL, \/\/ Transverse\n    NULL, \/\/ Clear\n    NULL  \/\/ Free\n};\n\n\/\/ clang-format on\n\n\/** The published canonpy function.\n *\/\n\nPyMODINIT_FUNC PyInit_canonpy(void)\n{\n    return PyModuleDef_Init(&canonpy_module);\n}\n<commit_msg>Fix ending of docstring<commit_after>\/** Implementation of canonpy.\n *\/\n\n#include <canonpy.h>\n\n#include <Python.h>\n\n#include <algorithm>\n#include <string>\n\n#include <libcanon\/perm.h>\n\nusing libcanon::Simple_perm;\n\n\/\/\n\/\/ Perm class\n\/\/ ==========\n\/\/\n\/\/ Internal functions\n\/\/ ------------------\n\/\/\n\/\/ These functions are not directly set to Python types but are used\n\/\/ internally.  They are also used by other parts of this extension.\n\/\/\n\n\/** Builds a tuple object for a permutation.\n *\n * This function creates a pair, where the first field is a list of integers\n * for the preimage array, and the second field is the accompanied action,\n * which is also encoded as an integer.\n *\/\n\nstatic PyObject* build_perm_to_tuple(const Simple_perm& perm)\n{\n\n    PyObject* pre_images = NULL;\n    PyObject* res = NULL;\n    PyObject* acc = NULL;\n    size_t size = perm.size();\n\n    pre_images = PyList_New(size);\n    if (!pre_images)\n        goto error;\n    for (size_t i = 0; i < size; ++i) {\n        PyObject* curr = Py_BuildValue('n', perm >> i);\n        if (curr) {\n            PyList_SetItem(pre_images, i, curr);\n        } else {\n            goto error;\n        }\n    }\n\n    acc = Py_BuildValue('b', perm.acc());\n    if (!acc)\n        goto error;\n\n    res = PyTuple_New(2);\n    if (!res)\n        goto error;\n\n    PyTuple_SET_ITEM(res, 0, pre_images);\n    PyTuple_SET_ITEM(res, 1, acc);\n\n    return (PyObject*)res;\n\nerror:\n    Py_XDECREF(pre_images);\n    Py_XDECREF(res);\n    Py_XDECREF(acc);\n    return NULL;\n}\n\n\/** Builds a permutation from its construction arguments.\n *\n * An iterable of positive integers for the pre-image array needs to be given\n * as the first argument.  The accompanied action can be optionally given as\n * another integral argument, or by the keyword ``acc``.\n *\n * If the arguments are not valid, a Perm of size zero is going to be returned.\n *\n * This function is designed to be compatible with the result from the function\n * `build_perm_to_tuple`.  However, more general input format is accepted.\n *\/\n\nstatic Simple_perm make_perm_from_args(PyObject* args, PyObject* kwargs);\n\n\/\/\n\/\/ Interface functions\n\/\/ -------------------\n\/\/\n\nconst static char* perm_getnewargs_doc\n    = \"Get the arguments for new to construct the Perm.\";\n\nstatic PyObject* perm_getnewargs(Perm_object* self)\n{\n    \/\/ Here we directly use the tuple format of a perm.\n\n    return build_perm_to_tuple(self->perm);\n}\n\n\/** Gets the size of the permutation domain of a Perm.\n *\/\n\nstatic Py_ssize_t perm_length(Perm_object* self)\n{\n    \/\/ The type should be the same, size_t and Py_ssize_t.\n\n    return self->perm.size();\n}\n\n\/** Gets the pre-image of a point.\n *\n * A new integer object will be built by this function.\n *\/\n\nstatic PyObject* perm_item(Perm_object* self, Py_ssize_t i)\n{\n    if (i < 0 || i >= self->perm.size()) {\n        PyErr_SetString(PyExc_IndexError, \"Point outside permutation domain\");\n        return NULL;\n    }\n\n    return Py_BuildValue(\"n\", self->perm >> i);\n}\n\n\/** Gets the accompanied action of a Perm.\n *\/\n\nstatic PyObject* perm_get_acc(Perm_object* self, void* closure)\n{\n    \/\/ Note that the accompanied action is a byte in simple perm.\n\n    return Py_BuildValue(\"b\", self->perm.acc());\n}\n\n\/** Deallocates a perm instance.\n *\/\n\nstatic void perm_dealloc(Perm_object* self)\n{\n    perm.perm.~Simple_perm();\n\n    \/\/ For subclassing.\n    Py_TYPE(self)->tp_free((PyObject*)self);\n}\n\n\/** Forms the string representation of a Perm object.\n *\/\n\nstatic PyObject* perm_repr(Perm_object* self)\n{\n    const Simple_perm& perm = self->perm;\n\n    std::wstring repr(\"Perm(\");\n\n    size_t size = perm.size();\n\n    if (size > 0) {\n        for (size_t i = 0; i < size; ++i) {\n            if (i == 0) {\n                repr.append('[');\n            } else {\n                repr.append(\", \");\n            }\n            repr.append(std::to_wstring(perm >> i));\n        }\n        repr.append(']');\n\n        \/\/ Add the accompanied action only when we need.\n        char acc = perm.acc();\n        if (acc != 0) {\n            repr.append(\", \");\n            repr.append(std::to_wstring(acc));\n        }\n    }\n\n    \/\/ This is used for empty or non-empty permutation.\n    repr.append(')');\n\n    return PyUnicode_FromUnicode(repr.data(), repr.size());\n}\n\n\/** Gets the hash of a perm.\n *\/\n\nstatic Py_hash_t perm_hash(Perm_object* self)\n{\n    \/\/ Py_hash_t should be compatible with size_t.\n\n    return self->perm.hash();\n}\n\n\/** Creates a new Perm object.\n *\n * The actual work is delegated to the Python\/Perm interface function.\n *\/\n\nstatic PyObject* perm_new(PyTypeObject* type, PyObject* args, PyObject* kwargs)\n{\n    Perm_object* self;\n\n    \/\/ Pay attention to subclassing.\n    self = (Perm_object*)type->tp_alloc(type, 0);\n\n    if (!self)\n        return NULL;\n\n    Simple_perm perm = get_perm_from_args(args, kwargs);\n\n    if (perm.size() > 0) {\n        new (&self->perm) Simple_perm(std::move(perm));\n        return (PyObject*)self;\n    } else {\n        return NULL;\n    }\n}\n\n\/\/\n\/\/ Class definition\n\/\/ ----------------\n\/\/\n\n\/** Methods for Perm objects.\n *\/\n\nstatic PyMethodDef perm_methods[] = {\n    { \"__getnewargs__\", (PyCFunction)perm_getnewargs, METH_NOARGS,\n        perm_getnewargs_doc },\n    { NULL, NULL } \/* sentinel *\/\n};\n\n\/** Sequence operations for Perm objects.\n *\n * Here we only support size and pre-image query.\n *\/\n\n\/\/ clang-format off\nstatic PySequenceMethods perm_as_sequence = {\n    (lenfunc)perm_length,                       \/* sq_length *\/\n    0,                                          \/* sq_concat *\/\n    0,                                          \/* sq_repeat *\/\n    (ssizeargfunc)perm_item,                    \/* sq_item *\/\n    0,                                          \/* sq_slice *\/\n    0,                                          \/* sq_ass_item *\/\n    0,                                          \/* sq_ass_slice *\/\n    0                                           \/* sq_contains *\/\n};\n\/\/ clang-format on\n\n\/** Accessors for Perms.\n *\n * The accompanied action query is made here.\n *\/\n\n\/\/ clang-format off\nstatic PyGetSetDef perm_getsets[] = {\n    { \"acc\", (getter)perm_get_acc, NULL, \"The accompanied action.\", NULL },\n    { NULL }\n};\n\/\/ clang-format on\n\n\/** Perm type doc string.\n  *\/\n\nstatic char* perm_doc =\n    R\"__doc__(Permutation of points with accompanied action.\n\nPermutations can be constructed from an iterable giving the pre-image of the\npoints and an optional integral value for the accompanied action.  The\naccompanied action can be given positionally or by the keyword ``acc``, and it\nwill be manipulated according to the convention in libcanon.\n\nQuerying the length of a Perm object gives the size of the permutation domain,\nwhile indexing it gives the pre-image of the given integral point.  The\naccompanied action can be obtained by getting the attribute ``acc``.\nOtherwise, this data type is mostly opaque.\n\n)__doc__\";\n\n\/** Type definition for Perm class.\n *\/\n\n\/\/ clang-format off\nstatic PyTypeObject perm_type = {\n    PyVarObject_HEAD_INIT(NULL, 0)\n    \"drudge.canonpy.Perm\",\n    sizeof(Perm_object),\n    0,\n    (destructor) perm_dealloc,                  \/* tp_dealloc *\/\n    0,                                          \/* tp_print *\/\n    0,                                          \/* tp_getattr *\/\n    0,                                          \/* tp_setattr *\/\n    0,                                          \/* tp_reserved *\/\n    (reprfunc) perm_repr,                       \/* tp_repr *\/\n    0,                                          \/* tp_as_number *\/\n    &perm_as_sequence,                          \/* tp_as_sequence *\/\n    0,                                          \/* tp_as_mapping *\/\n    (hashfunc) perm_hash,                       \/* tp_hash *\/\n    0,                                          \/* tp_call *\/\n    0,                                          \/* tp_str *\/\n    0, \/* In main. *\/                           \/* tp_getattro *\/\n    0,                                          \/* tp_setattro *\/\n    0,                                          \/* tp_as_buffer *\/\n    Py_TPFLAGS_DEFAULT,                         \/* tp_flags *\/\n    perm_doc,                                   \/* tp_doc *\/\n    0,                                          \/* tp_traverse *\/\n    0,                                          \/* tp_clear *\/\n    0,                                          \/* tp_richcompare *\/\n    0,                                          \/* tp_weaklistoffset *\/\n    0,                                          \/* tp_iter *\/\n    0,                                          \/* tp_iternext *\/\n    perm_methods,                               \/* tp_methods *\/\n    0,                                          \/* tp_members *\/\n    perm_getsets,                               \/* tp_getset *\/\n    0,                                          \/* tp_base *\/\n    0,                                          \/* tp_dict *\/\n    0,                                          \/* tp_descr_get *\/\n    0,                                          \/* tp_descr_set *\/\n    0,                                          \/* tp_dictoffset *\/\n    0,                                          \/* tp_init *\/\n    0,                                          \/* tp_alloc *\/\n    perm_new,                                   \/* tp_new *\/\n    0,                                          \/* tp_free *\/\n};\n\/\/ clang-format on\n\n\/\/\n\/\/ Python module definition\n\/\/ ========================\n\/\/\n\n\/** Docstring for the canonpy module.\n *\/\n\nstatic const char* canonpy_docstring\n    = R\"__doc__(Canonpy, simple wrapper over libcanon for Python.\n\nThis wrapper of libcanon is directly targeted towards usage using drudge.\nHere, we have a class `Perm`, which wraps over the `Simple_perm` class in\nlibcanon, another class `SimsTransv`, which wraps over the `Sims_trasv` class\nfor `Simple_perm`.  And we also have the function `canon_eldag` to canonicalize\nan Eldag.\n\n)__doc__\";\n\n\/** Methods in the canonpy module.\n *\/\n\nstatic PyMethodDef canonpy_methods[] = { { NULL, NULL, 0, NULL } };\n\n\/** Executes the initialization of the canonpy module.\n *\/\n\nstatic int canopy_exec(PyObject* m)\n{\n    \/\/\n    \/\/ Add the class for Perm.\n    \/\/\n\n    perm_type.tp_getattro = PyObject_GenericGetAttr;\n    if (PyType_Ready(&perm_type) < 0)\n        return NULL;\n    Py_INCREF(&perm_type);\n    PyModule_AddObject(m, \"Perm\", (PyObject*)&perm_type);\n\n    return 0;\n}\n\n\/** Slots for for canonpy module definition.\n *\/\n\nstatic struct PyModuleDef_Slot canonpy_slots[] = {\n    { Py_mod_exec, canonpy_exec }, { 0, NULL },\n};\n\n\/** Canonpy module definition.\n *\/\n\n\/\/ clang-format off\n\nstatic struct PyModuleDef canonpy_module = {\n    PyModuleDef_HEAD_INIT,\n    \"drudge.canonpy\",\n    canonpy_docstring,\n    0, \/\/ m-size\n    canonpy_methods,\n    canonpy_slots,\n    NULL, \/\/ Transverse\n    NULL, \/\/ Clear\n    NULL  \/\/ Free\n};\n\n\/\/ clang-format on\n\n\/** The published canonpy function.\n *\/\n\nPyMODINIT_FUNC PyInit_canonpy(void)\n{\n    return PyModuleDef_Init(&canonpy_module);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\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#include <iostream>\n\n#include \"base\/misc.hh\"\n#include \"dev\/etherpkt.hh\"\n#include \"sim\/serialize.hh\"\n\nusing namespace std;\n\nvoid\nPacketData::serialize(const string &base, ostream &os)\n{\n    paramOut(os, base + \".length\", length);\n    arrayParamOut(os, base + \".data\", data, length);\n}\n\nvoid\nPacketData::unserialize(const string &base, Checkpoint *cp,\n                        const string &section)\n{\n    paramIn(cp, section, base + \".length\", length);\n    arrayParamIn(cp, section, base + \".data\", data, length);\n}\n<commit_msg>Improve checkpointing of ethernet packets a bit.<commit_after>\/*\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#include <iostream>\n\n#include \"base\/misc.hh\"\n#include \"dev\/etherpkt.hh\"\n#include \"sim\/serialize.hh\"\n\nusing namespace std;\n\nvoid\nPacketData::serialize(const string &base, ostream &os)\n{\n    paramOut(os, base + \".length\", length);\n    arrayParamOut(os, base + \".data\", data, length);\n}\n\nvoid\nPacketData::unserialize(const string &base, Checkpoint *cp,\n                        const string &section)\n{\n    paramIn(cp, section, base + \".length\", length);\n    if (length)\n        arrayParamIn(cp, section, base + \".data\", data, length);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project                                 *\n ******************************************************************************\n * Copyright 2015 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\/base\/filesystem.h\"\n\n#include <algorithm>\n\nnamespace xe {\nnamespace filesystem {\n\nstd::string CanonicalizePath(const std::string& original_path) {\n  char path_sep(xe::kPathSeparator);\n  std::string path(xe::fix_path_separators(original_path, path_sep));\n\n  std::vector<std::string::size_type> path_breaks;\n\n  std::string::size_type pos(path.find_first_of(path_sep));\n  std::string::size_type pos_n(std::string::npos);\n\n  while (pos != std::string::npos) {\n    if ((pos_n = path.find_first_of(path_sep, pos + 1)) == std::string::npos) {\n      pos_n = path.size();\n    }\n\n    auto diff(pos_n - pos);\n    switch (diff) {\n      case 0:\n        pos_n = std::string::npos;\n        break;\n      case 1:\n        \/\/ Duplicate separators.\n        path.erase(pos, 1);\n        pos_n -= 1;\n        break;\n      case 2:\n        \/\/ Potential marker for current directory.\n        if (path[pos + 1] == '.') {\n          path.erase(pos, 2);\n          pos_n -= 2;\n        } else {\n          path_breaks.push_back(pos);\n        }\n        break;\n      case 3:\n        \/\/ Potential marker for parent directory.\n        if (path[pos + 1] == '.' && path[pos + 2] == '.') {\n          if (path_breaks.empty()) {\n            \/\/ Ensure we don't override the device name.\n            std::string::size_type loc(path.find_first_of(':'));\n            auto req(pos + 3);\n            if (loc == std::string::npos || loc > req) {\n              path.erase(0, req);\n              pos_n -= req;\n            } else {\n              path.erase(loc + 1, req - (loc + 1));\n              pos_n -= req - (loc + 1);\n            }\n          } else {\n            auto last(path_breaks.back());\n            auto last_diff((pos + 3) - last);\n            path.erase(last, last_diff);\n            pos_n = last;\n            \/\/ Also remove path reference.\n            path_breaks.erase(path_breaks.end() - 1);\n          }\n        } else {\n          path_breaks.push_back(pos);\n        }\n        break;\n\n      default:\n        path_breaks.push_back(pos);\n        break;\n    }\n\n    pos = pos_n;\n  }\n\n  \/\/ Remove trailing seperator.\n  if (!path.empty() && path.back() == path_sep) {\n    path.erase(path.size() - 1);\n  }\n\n  \/\/ Final sanity check for dead paths.\n  if ((path.size() == 1 && (path[0] == '.' || path[0] == path_sep)) ||\n      (path.size() == 2 && path[0] == '.' && path[1] == '.')) {\n    return \"\";\n  }\n\n  return path;\n}\n\nbool CreateParentFolder(const std::wstring& path) {\n  auto fixed_path = xe::fix_path_separators(path, xe::kWPathSeparator);\n  auto base_path = xe::find_base_path(fixed_path, xe::kWPathSeparator);\n  if (!PathExists(base_path)) {\n    return CreateFolder(base_path);\n  } else {\n    return true;\n  }\n}\n\n}  \/\/ namespace filesystem\n}  \/\/ namespace xe\n<commit_msg>[Base] Only attempt to create non-empty base paths in CreateParentFolder.<commit_after>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project                                 *\n ******************************************************************************\n * Copyright 2015 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\/base\/filesystem.h\"\n\n#include <algorithm>\n\nnamespace xe {\nnamespace filesystem {\n\nstd::string CanonicalizePath(const std::string& original_path) {\n  char path_sep(xe::kPathSeparator);\n  std::string path(xe::fix_path_separators(original_path, path_sep));\n\n  std::vector<std::string::size_type> path_breaks;\n\n  std::string::size_type pos(path.find_first_of(path_sep));\n  std::string::size_type pos_n(std::string::npos);\n\n  while (pos != std::string::npos) {\n    if ((pos_n = path.find_first_of(path_sep, pos + 1)) == std::string::npos) {\n      pos_n = path.size();\n    }\n\n    auto diff(pos_n - pos);\n    switch (diff) {\n      case 0:\n        pos_n = std::string::npos;\n        break;\n      case 1:\n        \/\/ Duplicate separators.\n        path.erase(pos, 1);\n        pos_n -= 1;\n        break;\n      case 2:\n        \/\/ Potential marker for current directory.\n        if (path[pos + 1] == '.') {\n          path.erase(pos, 2);\n          pos_n -= 2;\n        } else {\n          path_breaks.push_back(pos);\n        }\n        break;\n      case 3:\n        \/\/ Potential marker for parent directory.\n        if (path[pos + 1] == '.' && path[pos + 2] == '.') {\n          if (path_breaks.empty()) {\n            \/\/ Ensure we don't override the device name.\n            std::string::size_type loc(path.find_first_of(':'));\n            auto req(pos + 3);\n            if (loc == std::string::npos || loc > req) {\n              path.erase(0, req);\n              pos_n -= req;\n            } else {\n              path.erase(loc + 1, req - (loc + 1));\n              pos_n -= req - (loc + 1);\n            }\n          } else {\n            auto last(path_breaks.back());\n            auto last_diff((pos + 3) - last);\n            path.erase(last, last_diff);\n            pos_n = last;\n            \/\/ Also remove path reference.\n            path_breaks.erase(path_breaks.end() - 1);\n          }\n        } else {\n          path_breaks.push_back(pos);\n        }\n        break;\n\n      default:\n        path_breaks.push_back(pos);\n        break;\n    }\n\n    pos = pos_n;\n  }\n\n  \/\/ Remove trailing seperator.\n  if (!path.empty() && path.back() == path_sep) {\n    path.erase(path.size() - 1);\n  }\n\n  \/\/ Final sanity check for dead paths.\n  if ((path.size() == 1 && (path[0] == '.' || path[0] == path_sep)) ||\n      (path.size() == 2 && path[0] == '.' && path[1] == '.')) {\n    return \"\";\n  }\n\n  return path;\n}\n\nbool CreateParentFolder(const std::wstring& path) {\n  auto fixed_path = xe::fix_path_separators(path, xe::kWPathSeparator);\n  auto base_path = xe::find_base_path(fixed_path, xe::kWPathSeparator);\n  if (base_path.size() && !PathExists(base_path)) {\n    return CreateFolder(base_path);\n  } else {\n    return true;\n  }\n}\n\n}  \/\/ namespace filesystem\n}  \/\/ namespace xe\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fixed map::at out_of_range exception when bfd could not be opened<commit_after><|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 \"gtest\/gtest.h\"\n\n#include <iostream>\n#include <libcellml>\n\n#include \"test_utils.h\"\n\n\/*\n * The tests in this file are here to catch any branches of code that\n * are not picked up by the main tests testing the API of the library\n *\/\nTEST(Coverage, import)\n{\n    const std::string e = \"\";\n    libcellml::ImportSource i, im;\n\n    im = std::move(i);\n\n    \/\/ Copy constructor\n    libcellml::ImportSource ic(im);\n\n    const std::string a = ic.getId();\n    EXPECT_EQ(e, a);\n}\n\nTEST(Coverage, printer)\n{\n    libcellml::Printer p, pm;\n\n    pm = std::move(p);\n\n    \/\/ Copy constructor\n    libcellml::Printer pc(pm);\n\n    size_t error_count = pc.errorCount();\n    EXPECT_EQ(0u, error_count);\n}\n\nTEST(Coverage, units)\n{\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\">\\n\"\n        \"  <units name=\\\"dimensionless\\\"\/>\\n\"\n        \"<\/model>\\n\";\n    libcellml::ModelPtr m = createModel();\n    libcellml::UnitsPtr u = std::make_shared<libcellml::Units>();\n    libcellml::UnitsPtr um = std::make_shared<libcellml::Units>();\n\n    u->setName(\"dimensionless\");\n\n    um = std::move(u);\n\n    \/\/ Copy constructor\n    libcellml::UnitsPtr uc(um);\n    m->addUnits(uc);\n\n    libcellml::Printer printer;\n    const std::string a = printer.printModel(m);\n    EXPECT_EQ(e, a);\n}\n\nTEST(Coverage, when)\n{\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\">\\n\"\n        \"  <component>\\n\"\n        \"    <reset>\\n\"\n        \"      <when\/>\\n\"\n        \"    <\/reset>\\n\"\n        \"  <\/component>\\n\"\n        \"<\/model>\\n\";\n    libcellml::ModelPtr m = createModelWithComponent();\n    libcellml::ComponentPtr c = m->getComponent(0);\n    libcellml::When w, wm;\n    libcellml::ResetPtr r = std::make_shared<libcellml::Reset>();\n    c->addReset(r);\n\n    wm = std::move(w);\n\n    libcellml::When wc(wm);\n\n    libcellml::WhenPtr wp = std::make_shared<libcellml::When>(wc);\n    r->addWhen(wp);\n\n    libcellml::Printer printer;\n    const std::string a = printer.printModel(m);\n    EXPECT_EQ(e, a);\n}\n\nTEST(Coverage, unitsGetVariations)\n{\n    libcellml::Model m;\n\n    libcellml::UnitsPtr u = std::make_shared<libcellml::Units>();\n    u->setName(\"a_unit\");\n\n    u->addUnit(libcellml::Units::StandardUnit::AMPERE, \"micro\");\n    m.addUnits(u);\n\n    libcellml::UnitsPtr un = m.getUnits(0);\n    EXPECT_EQ(\"a_unit\", un->getName());\n    libcellml::UnitsPtr uSn = static_cast<const libcellml::Model>(m).getUnits(0);\n    EXPECT_EQ(\"a_unit\", uSn->getName());\n\n    libcellml::UnitsPtr uns = m.getUnits(\"a_unit\");\n    EXPECT_EQ(\"a_unit\", uns->getName());\n    libcellml::UnitsPtr uSns = static_cast<const libcellml::Model>(m).getUnits(\"a_unit\");\n    EXPECT_EQ(\"a_unit\", uSns->getName());\n\n    EXPECT_EQ(nullptr, m.getUnits(\"b_unit\"));\n    EXPECT_EQ(nullptr, m.getUnits(4));\n}\n\nTEST(Coverage, prefixToString)\n{\n    libcellml::Model m;\n    libcellml::Printer printer;\n\n    std::vector<std::string> prefixString =\n        {\"atto\",\n         \"centi\",\n         \"deca\",\n         \"deci\",\n         \"exa\",\n         \"femto\",\n         \"giga\",\n         \"hecto\",\n         \"kilo\",\n         \"mega\",\n         \"micro\",\n         \"milli\",\n         \"nano\",\n         \"peta\",\n         \"pico\",\n         \"tera\",\n         \"yocto\",\n         \"yotta\",\n         \"zepto\",\n         \"zetta\"};\n    std::vector<libcellml::Prefix> prefixEnum =\n        {libcellml::Prefix::ATTO,\n         libcellml::Prefix::CENTI,\n         libcellml::Prefix::DECA,\n         libcellml::Prefix::DECI,\n         libcellml::Prefix::EXA,\n         libcellml::Prefix::FEMTO,\n         libcellml::Prefix::GIGA,\n         libcellml::Prefix::HECTO,\n         libcellml::Prefix::KILO,\n         libcellml::Prefix::MEGA,\n         libcellml::Prefix::MICRO,\n         libcellml::Prefix::MILLI,\n         libcellml::Prefix::NANO,\n         libcellml::Prefix::PETA,\n         libcellml::Prefix::PICO,\n         libcellml::Prefix::TERA,\n         libcellml::Prefix::YOCTO,\n         libcellml::Prefix::YOTTA,\n         libcellml::Prefix::ZEPTO,\n         libcellml::Prefix::ZETTA};\n    for (std::vector<std::string>::size_type i = 0; i != prefixString.size(); ++i) {\n        libcellml::UnitsPtr u = std::make_shared<libcellml::Units>();\n        u->setName(\"abcdefg\");\n        u->addUnit(\"empty\", prefixEnum[i]);\n\n        m.addUnits(u);\n\n        const std::string a = printer.printModel(m);\n        std::size_t found = a.find(prefixString[i]);\n        EXPECT_NE(std::string::npos, found);\n        m.removeAllUnits();\n    }\n}\n\nTEST(Coverage, variable)\n{\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\">\\n\"\n        \"  <component>\\n\"\n        \"    <variable units=\\\"dimensionless\\\" initial_value=\\\"1\\\" interface=\\\"public\\\"\/>\\n\"\n        \"  <\/component>\\n\"\n        \"<\/model>\\n\";\n    libcellml::ModelPtr m = createModelWithComponent();\n    libcellml::ComponentPtr c = m->getComponent(0);\n    libcellml::VariablePtr v = std::make_shared<libcellml::Variable>();\n    libcellml::VariablePtr vm = std::make_shared<libcellml::Variable>();\n    libcellml::UnitsPtr u = std::make_shared<libcellml::Units>();\n\n    v->setInitialValue(1.0);\n    v->setInterfaceType(\"public\");\n    u->setName(\"dimensionless\");\n    v->setUnits(u);\n\n    vm = std::move(v);\n\n    \/\/ Copy constructor\n    libcellml::VariablePtr vc(vm);\n    c->addVariable(vc);\n\n    libcellml::Printer printer;\n    const std::string a = printer.printModel(m);\n    EXPECT_EQ(e, a);\n}\n\nTEST(Coverage, component)\n{\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\">\\n\"\n        \"  <component name=\\\"name\\\">\\n\"\n        \"    <variable\/>\\n\"\n        \"    <1+1=2>\\n\"\n        \"  <\/component>\\n\"\n        \"<\/model>\\n\";\n    const std::string math = \"<1+1=2>\\n\";\n\n    libcellml::ModelPtr m = createModel();\n    libcellml::ComponentPtr c = std::make_shared<libcellml::Component>();\n    libcellml::ComponentPtr cm = std::make_shared<libcellml::Component>();\n    libcellml::VariablePtr v = std::make_shared<libcellml::Variable>();\n\n    c->setName(\"name\");\n    c->addVariable(v);\n    c->setMath(math);\n    m->addComponent(c);\n\n    libcellml::Printer printer;\n    std::string a = printer.printModel(m);\n    EXPECT_EQ(e, a);\n\n    cm = std::move(c);\n    a = printer.printModel(m);\n    EXPECT_EQ(e, a);\n\n    \/\/ Copy constructor\n    m->removeAllComponents();\n    libcellml::ComponentPtr cc(cm);\n    m->addComponent(cc);\n\n    a = printer.printModel(m);\n    EXPECT_EQ(e, a);\n}\n\nTEST(Coverage, error)\n{\n    libcellml::ErrorPtr err = std::make_shared<libcellml::Error>();\n    libcellml::Error e, em;\n    const std::string description = \"test\";\n\n    e.setDescription(description);\n    e.setKind(libcellml::Error::Kind::XML);\n\n    em = std::move(e);\n    \/\/ Copy constructor\n    libcellml::Error ec(em);\n\n    EXPECT_EQ(description, ec.getDescription());\n    EXPECT_EQ(libcellml::Error::Kind::XML, ec.getKind());\n}\n<commit_msg>Improve coverage through coverage tests.<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 \"gtest\/gtest.h\"\n\n#include <iostream>\n#include <libcellml>\n\n\/*\n * The tests in this file are here to catch any branches of code that\n * are not picked up by the main tests testing the API of the library\n *\/\nTEST(Coverage, import)\n{\n    const std::string e = \"\";\n    libcellml::ImportSource i, im;\n\n    im = std::move(i);\n\n    \/\/ Copy constructor\n    libcellml::ImportSource ic(im);\n\n    const std::string a = ic.getId();\n    EXPECT_EQ(e, a);\n}\n\nTEST(Coverage, printer)\n{\n    libcellml::Printer p, pm;\n\n    pm = std::move(p);\n\n    \/\/ Copy constructor\n    libcellml::Printer pc(pm);\n\n    size_t error_count = pc.errorCount();\n    EXPECT_EQ(0u, error_count);\n}\n\nTEST(Coverage, units)\n{\n    const std::string e = \"<units name=\\\"dimensionless\\\"\/>\\n\";\n    libcellml::Units u, um;\n\n    u.setName(\"dimensionless\");\n\n    um = std::move(u);\n\n    \/\/ Copy constructor\n    libcellml::Units uc(um);\n\n    EXPECT_EQ(\"dimensionless\", uc.getName());\n}\n\nTEST(Coverage, when)\n{\n    const std::string e =\n        \"<reset>\\n\"\n        \"  <when\/>\\n\"\n        \"<\/reset>\\n\";\n    libcellml::When w, wm;\n    libcellml::Reset r;\n\n    w.setValue(\"4738\");\n    wm = std::move(w);\n\n    libcellml::When wc(wm);\n\n    libcellml::WhenPtr wp = std::make_shared<libcellml::When>(wc);\n    r.addWhen(wp);\n\n    EXPECT_EQ(\"4738\", wc.getValue());\n}\n\nTEST(Coverage, unitsGetVariations)\n{\n    libcellml::Model m;\n\n    libcellml::UnitsPtr u = std::make_shared<libcellml::Units>();\n    u->setName(\"a_unit\");\n\n    u->addUnit(libcellml::Units::StandardUnit::AMPERE, \"micro\");\n    m.addUnits(u);\n\n    libcellml::UnitsPtr un = m.getUnits(0);\n    EXPECT_EQ(\"a_unit\", un->getName());\n    libcellml::UnitsPtr uSn = static_cast<const libcellml::Model>(m).getUnits(0);\n    EXPECT_EQ(\"a_unit\", uSn->getName());\n\n    libcellml::UnitsPtr uns = m.getUnits(\"a_unit\");\n    EXPECT_EQ(\"a_unit\", uns->getName());\n    libcellml::UnitsPtr uSns = static_cast<const libcellml::Model>(m).getUnits(\"a_unit\");\n    EXPECT_EQ(\"a_unit\", uSns->getName());\n\n    EXPECT_EQ(nullptr, m.getUnits(\"b_unit\"));\n    EXPECT_EQ(nullptr, m.getUnits(4));\n}\n\nTEST(Coverage, prefixToString)\n{\n    libcellml::Model m;\n    libcellml::Printer printer;\n\n    std::vector<std::string> prefixString =\n        {\"atto\",\n         \"centi\",\n         \"deca\",\n         \"deci\",\n         \"exa\",\n         \"femto\",\n         \"giga\",\n         \"hecto\",\n         \"kilo\",\n         \"mega\",\n         \"micro\",\n         \"milli\",\n         \"nano\",\n         \"peta\",\n         \"pico\",\n         \"tera\",\n         \"yocto\",\n         \"yotta\",\n         \"zepto\",\n         \"zetta\"};\n    std::vector<libcellml::Prefix> prefixEnum =\n        {libcellml::Prefix::ATTO,\n         libcellml::Prefix::CENTI,\n         libcellml::Prefix::DECA,\n         libcellml::Prefix::DECI,\n         libcellml::Prefix::EXA,\n         libcellml::Prefix::FEMTO,\n         libcellml::Prefix::GIGA,\n         libcellml::Prefix::HECTO,\n         libcellml::Prefix::KILO,\n         libcellml::Prefix::MEGA,\n         libcellml::Prefix::MICRO,\n         libcellml::Prefix::MILLI,\n         libcellml::Prefix::NANO,\n         libcellml::Prefix::PETA,\n         libcellml::Prefix::PICO,\n         libcellml::Prefix::TERA,\n         libcellml::Prefix::YOCTO,\n         libcellml::Prefix::YOTTA,\n         libcellml::Prefix::ZEPTO,\n         libcellml::Prefix::ZETTA};\n    for (std::vector<std::string>::size_type i = 0; i != prefixString.size(); ++i) {\n        libcellml::UnitsPtr u = std::make_shared<libcellml::Units>();\n        u->setName(\"abcdefg\");\n        u->addUnit(\"empty\", prefixEnum[i]);\n\n        m.addUnits(u);\n\n        const std::string a = printer.printModel(m);\n        std::size_t found = a.find(prefixString[i]);\n        EXPECT_NE(std::string::npos, found);\n        m.removeAllUnits();\n    }\n}\n\nTEST(Coverage, variable)\n{\n    const std::string e = \"<variable units=\\\"dimensionless\\\" initial_value=\\\"1\\\" interface=\\\"public\\\"\/>\\n\";\n    libcellml::Variable v, vm;\n    libcellml::UnitsPtr u = std::make_shared<libcellml::Units>();\n\n    v.setInitialValue(1.0);\n    v.setInterfaceType(\"public\");\n    u->setName(\"dimensionless\");\n    v.setUnits(u);\n\n    vm = std::move(v);\n\n    \/\/ Copy constructor\n    libcellml::Variable vc(vm);\n\n    EXPECT_EQ(\"dimensionless\", vc.getUnits());\n}\n\nTEST(Coverage, component)\n{\n    const std::string math = \"<1+1=2>\\n\";\n\n    libcellml::Component c, cm;\n    libcellml::VariablePtr v = std::make_shared<libcellml::Variable>();\n\n    c.setName(\"name\");\n    c.addVariable(v);\n    c.setMath(math);\n\n    EXPECT_EQ(1u, c.variableCount());\n\n    cm = std::move(c);\n    EXPECT_EQ(1u, cm.variableCount());\n\n    \/\/ Copy constructor\n    libcellml::Component cc(cm);\n    EXPECT_EQ(1u, cc.variableCount());\n}\n\nTEST(Coverage, error)\n{\n    libcellml::ErrorPtr err = std::make_shared<libcellml::Error>();\n    libcellml::Error e, em;\n    const std::string description = \"test\";\n\n    e.setDescription(description);\n    e.setKind(libcellml::Error::Kind::XML);\n\n    em = std::move(e);\n    \/\/ Copy constructor\n    libcellml::Error ec(em);\n\n    EXPECT_EQ(description, ec.getDescription());\n    EXPECT_EQ(libcellml::Error::Kind::XML, ec.getKind());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 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 \"base\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"content\/browser\/gpu\/gpu_process_host.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/common\/content_paths.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/common\/url_constants.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"content\/shell\/browser\/shell.h\"\n#include \"content\/test\/content_browser_test.h\"\n#include \"content\/test\/content_browser_test_utils.h\"\n\nnamespace content {\n\nnamespace {\n  void VerifyGPUProcessLaunch(bool* result) {\n    GpuProcessHost* host =\n        GpuProcessHost::Get(GpuProcessHost::GPU_PROCESS_KIND_SANDBOXED,\n                            content::CAUSE_FOR_GPU_LAUNCH_NO_LAUNCH);\n    *result = !!host;\n  }\n}\n\nclass GpuFunctionalTest : public ContentBrowserTest {\n protected:\n  virtual void SetUpInProcessBrowserTestFixture() OVERRIDE {\n    base::FilePath test_dir;\n    ASSERT_TRUE(PathService::Get(DIR_TEST_DATA, &test_dir));\n    gpu_test_dir_ = test_dir.AppendASCII(\"gpu\");\n  }\n\n  virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {\n    command_line->AppendSwitch(switches::kDisableGpuProcessPrelaunch);\n  }\n\n  void VerifyHardwareAccelerated(const std::string& feature) {\n    NavigateToURL(shell(),\n                  GURL(std::string(chrome::kChromeUIScheme).\n                       append(\":\/\/\").\n                       append(kChromeUIGpuHost)));\n\n    {\n      \/\/ Verify that the given feature is hardware accelerated..\n      std::string javascript =\n          \"function VerifyHardwareAccelerated(feature) {\"\n          \"  var list = document.querySelector(\\\".feature-status-list\\\");\"\n          \"  for (var i=0; i < list.childElementCount; i++) {\"\n          \"    var span_list = list.children[i].getElementsByTagName('span');\"\n          \"    var feature_str = span_list[0].textContent;\"\n          \"    var value_str = span_list[1].textContent;\"\n          \"    if ((feature_str == feature) &&\"\n          \"        (value_str == 'Hardware accelerated')) {\"\n          \"      domAutomationController.send(\\\"success\\\");\"\n          \"    }\"\n          \"  }\"\n          \"};\";\n      javascript.append(\"VerifyHardwareAccelerated(\\\"\");\n      javascript.append(feature);\n      javascript.append(\"\\\");\");\n      std::string result;\n      EXPECT_TRUE(ExecuteScriptAndExtractString(shell()->web_contents(),\n                                                javascript,\n                                                &result));\n      EXPECT_EQ(result, \"success\");\n    }\n  }\n\n  void VerifyGPUProcessOnPage(std::string filename, bool wait) {\n    Shell::Initialize();\n    ASSERT_TRUE(test_server()->Start());\n    DOMMessageQueue message_queue;\n\n    std::string url(\"files\/gpu\/\");\n    GURL full_url = test_server()->GetURL(url.append(filename));\n    NavigateToURL(shell(), full_url);\n\n    if (wait) {\n      std::string result_string;\n      ASSERT_TRUE(message_queue.WaitForMessage(&result_string));\n    }\n\n    bool result = false;\n    BrowserThread::PostTaskAndReply(\n        BrowserThread::IO,\n        FROM_HERE,\n        base::Bind(&VerifyGPUProcessLaunch, &result),\n        base::MessageLoop::QuitClosure());\n    base::MessageLoop::current()->Run();\n    EXPECT_TRUE(result);\n  }\n\n  base::FilePath gpu_test_dir_;\n};\n\n#if defined(OS_LINUX) && !defined(NDEBUG)\n\/\/ http:\/\/crbug.com\/254724\n#define IF_NOT_DEBUG_LINUX(x) DISABLED_ ## x\n#else\n#define IF_NOT_DEBUG_LINUX(x) x\n#endif\n\nIN_PROC_BROWSER_TEST_F(\n    GpuFunctionalTest,\n    IF_NOT_DEBUG_LINUX(MANUAL_TestFeatureHardwareAccelerated)) {\n  VerifyHardwareAccelerated(\"WebGL: \");\n  VerifyHardwareAccelerated(\"Canvas: \");\n  VerifyHardwareAccelerated(\"3D CSS: \");\n}\n\n\/\/ Verify that gpu process is spawned in webgl example.\nIN_PROC_BROWSER_TEST_F(GpuFunctionalTest,\n                       IF_NOT_DEBUG_LINUX(MANUAL_TestWebGL)) {\n  VerifyGPUProcessOnPage(\"functional_webgl.html\", false);\n}\n\n\/\/ Verify that gpu process is spawned when viewing a 2D canvas.\nIN_PROC_BROWSER_TEST_F(GpuFunctionalTest,\n                       IF_NOT_DEBUG_LINUX(MANUAL_Test2dCanvas)) {\n  VerifyGPUProcessOnPage(\"functional_canvas_demo.html\", false);\n}\n\n\/\/ Verify that gpu process is spawned when viewing a 3D CSS page.\nIN_PROC_BROWSER_TEST_F(GpuFunctionalTest,\n                       IF_NOT_DEBUG_LINUX(MANUAL_Test3dCss)) {\n  VerifyGPUProcessOnPage(\"functional_3d_css.html\", false);\n}\n\n#if defined(OS_LINUX)\n\/\/ crbug.com\/257109\n#define MANUAL_TestGpuWithVideo DISABLED_TestGpuWithVideo\n#endif\n\n\/\/ Verify that gpu process is started when viewing video.\nIN_PROC_BROWSER_TEST_F(GpuFunctionalTest,\n                       MANUAL_TestGpuWithVideo) {\n  VerifyGPUProcessOnPage(\"functional_video.html\", true);\n}\n\n} \/\/ namespace content\n<commit_msg>remove unnecessary Shell::Initialize causing DCHECK on gpu_win bots<commit_after>\/\/ Copyright (c) 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 \"base\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"content\/browser\/gpu\/gpu_process_host.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/common\/content_paths.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/common\/url_constants.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"content\/shell\/browser\/shell.h\"\n#include \"content\/test\/content_browser_test.h\"\n#include \"content\/test\/content_browser_test_utils.h\"\n\nnamespace content {\n\nnamespace {\n  void VerifyGPUProcessLaunch(bool* result) {\n    GpuProcessHost* host =\n        GpuProcessHost::Get(GpuProcessHost::GPU_PROCESS_KIND_SANDBOXED,\n                            content::CAUSE_FOR_GPU_LAUNCH_NO_LAUNCH);\n    *result = !!host;\n  }\n}\n\nclass GpuFunctionalTest : public ContentBrowserTest {\n protected:\n  virtual void SetUpInProcessBrowserTestFixture() OVERRIDE {\n    base::FilePath test_dir;\n    ASSERT_TRUE(PathService::Get(DIR_TEST_DATA, &test_dir));\n    gpu_test_dir_ = test_dir.AppendASCII(\"gpu\");\n  }\n\n  virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {\n    command_line->AppendSwitch(switches::kDisableGpuProcessPrelaunch);\n  }\n\n  void VerifyHardwareAccelerated(const std::string& feature) {\n    NavigateToURL(shell(),\n                  GURL(std::string(chrome::kChromeUIScheme).\n                       append(\":\/\/\").\n                       append(kChromeUIGpuHost)));\n\n    {\n      \/\/ Verify that the given feature is hardware accelerated..\n      std::string javascript =\n          \"function VerifyHardwareAccelerated(feature) {\"\n          \"  var list = document.querySelector(\\\".feature-status-list\\\");\"\n          \"  for (var i=0; i < list.childElementCount; i++) {\"\n          \"    var span_list = list.children[i].getElementsByTagName('span');\"\n          \"    var feature_str = span_list[0].textContent;\"\n          \"    var value_str = span_list[1].textContent;\"\n          \"    if ((feature_str == feature) &&\"\n          \"        (value_str == 'Hardware accelerated')) {\"\n          \"      domAutomationController.send(\\\"success\\\");\"\n          \"    }\"\n          \"  }\"\n          \"};\";\n      javascript.append(\"VerifyHardwareAccelerated(\\\"\");\n      javascript.append(feature);\n      javascript.append(\"\\\");\");\n      std::string result;\n      EXPECT_TRUE(ExecuteScriptAndExtractString(shell()->web_contents(),\n                                                javascript,\n                                                &result));\n      EXPECT_EQ(result, \"success\");\n    }\n  }\n\n  void VerifyGPUProcessOnPage(std::string filename, bool wait) {\n    ASSERT_TRUE(test_server()->Start());\n    DOMMessageQueue message_queue;\n\n    std::string url(\"files\/gpu\/\");\n    GURL full_url = test_server()->GetURL(url.append(filename));\n    NavigateToURL(shell(), full_url);\n\n    if (wait) {\n      std::string result_string;\n      ASSERT_TRUE(message_queue.WaitForMessage(&result_string));\n    }\n\n    bool result = false;\n    BrowserThread::PostTaskAndReply(\n        BrowserThread::IO,\n        FROM_HERE,\n        base::Bind(&VerifyGPUProcessLaunch, &result),\n        base::MessageLoop::QuitClosure());\n    base::MessageLoop::current()->Run();\n    EXPECT_TRUE(result);\n  }\n\n  base::FilePath gpu_test_dir_;\n};\n\n#if defined(OS_LINUX) && !defined(NDEBUG)\n\/\/ http:\/\/crbug.com\/254724\n#define IF_NOT_DEBUG_LINUX(x) DISABLED_ ## x\n#else\n#define IF_NOT_DEBUG_LINUX(x) x\n#endif\n\nIN_PROC_BROWSER_TEST_F(\n    GpuFunctionalTest,\n    IF_NOT_DEBUG_LINUX(MANUAL_TestFeatureHardwareAccelerated)) {\n  VerifyHardwareAccelerated(\"WebGL: \");\n  VerifyHardwareAccelerated(\"Canvas: \");\n  VerifyHardwareAccelerated(\"3D CSS: \");\n}\n\n\/\/ Verify that gpu process is spawned in webgl example.\nIN_PROC_BROWSER_TEST_F(GpuFunctionalTest,\n                       IF_NOT_DEBUG_LINUX(MANUAL_TestWebGL)) {\n  VerifyGPUProcessOnPage(\"functional_webgl.html\", false);\n}\n\n\/\/ Verify that gpu process is spawned when viewing a 2D canvas.\nIN_PROC_BROWSER_TEST_F(GpuFunctionalTest,\n                       IF_NOT_DEBUG_LINUX(MANUAL_Test2dCanvas)) {\n  VerifyGPUProcessOnPage(\"functional_canvas_demo.html\", false);\n}\n\n\/\/ Verify that gpu process is spawned when viewing a 3D CSS page.\nIN_PROC_BROWSER_TEST_F(GpuFunctionalTest,\n                       IF_NOT_DEBUG_LINUX(MANUAL_Test3dCss)) {\n  VerifyGPUProcessOnPage(\"functional_3d_css.html\", false);\n}\n\n#if defined(OS_LINUX)\n\/\/ crbug.com\/257109\n#define MANUAL_TestGpuWithVideo DISABLED_TestGpuWithVideo\n#endif\n\n\/\/ Verify that gpu process is started when viewing video.\nIN_PROC_BROWSER_TEST_F(GpuFunctionalTest,\n                       MANUAL_TestGpuWithVideo) {\n  VerifyGPUProcessOnPage(\"functional_video.html\", true);\n}\n\n} \/\/ namespace content\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#if defined(ENABLE_GPU)\n\n#include \"content\/common\/gpu\/image_transport_surface.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/memory\/weak_ptr.h\"\n#include \"base\/win\/windows_version.h\"\n#include \"content\/common\/gpu\/gpu_messages.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"ui\/gfx\/gl\/gl_bindings.h\"\n#include \"ui\/gfx\/gl\/gl_context.h\"\n#include \"ui\/gfx\/gl\/gl_implementation.h\"\n#include \"ui\/gfx\/gl\/gl_surface_egl.h\"\n#include \"ui\/gfx\/native_widget_types.h\"\n\nnamespace {\n\n\/\/ We are backed by an Pbuffer offscreen surface through which ANGLE provides\n\/\/ a handle to the corresponding render target texture through an extension.\nclass PbufferImageTransportSurface\n    : public gfx::GLSurfaceAdapter,\n      public ImageTransportSurface,\n      public base::SupportsWeakPtr<PbufferImageTransportSurface> {\n public:\n  PbufferImageTransportSurface(GpuChannelManager* manager,\n                               int32 render_view_id,\n                               int32 renderer_id,\n                               int32 command_buffer_id);\n\n  \/\/ gfx::GLSurface implementation\n  virtual bool Initialize() OVERRIDE;\n  virtual void Destroy() OVERRIDE;\n  virtual bool IsOffscreen() OVERRIDE;\n  virtual bool SwapBuffers() OVERRIDE;\n  virtual bool PostSubBuffer(int x, int y, int width, int height) OVERRIDE;\n  virtual std::string GetExtensions() OVERRIDE;\n  virtual void SetVisible(bool visible) OVERRIDE;\n\n protected:\n  \/\/ ImageTransportSurface implementation\n  virtual void OnNewSurfaceACK(uint64 surface_id,\n                               TransportDIB::Handle shm_handle) OVERRIDE;\n  virtual void OnBuffersSwappedACK() OVERRIDE;\n  virtual void OnPostSubBufferACK() OVERRIDE;\n  virtual void OnResizeViewACK() OVERRIDE;\n  virtual void OnResize(gfx::Size size) OVERRIDE;\n\n private:\n  virtual ~PbufferImageTransportSurface();\n  void SendBuffersSwapped();\n\n  \/\/ Whether the surface is currently visible.\n  bool is_visible_;\n\n  \/\/ Size to resize to when the surface becomes visible.\n  gfx::Size visible_size_;\n\n  scoped_ptr<ImageTransportHelper> helper_;\n\n  DISALLOW_COPY_AND_ASSIGN(PbufferImageTransportSurface);\n};\n\nPbufferImageTransportSurface::PbufferImageTransportSurface(\n    GpuChannelManager* manager,\n    int32 render_view_id,\n    int32 renderer_id,\n    int32 command_buffer_id)\n        : GLSurfaceAdapter(new gfx::PbufferGLSurfaceEGL(false,\n                                                        gfx::Size(1, 1))),\n          is_visible_(true) {\n  helper_.reset(new ImageTransportHelper(this,\n                                         manager,\n                                         render_view_id,\n                                         renderer_id,\n                                         command_buffer_id,\n                                         gfx::kNullPluginWindow));\n}\n\nPbufferImageTransportSurface::~PbufferImageTransportSurface() {\n  Destroy();\n}\n\nbool PbufferImageTransportSurface::Initialize() {\n  \/\/ Only support this path if the GL implementation is ANGLE.\n  \/\/ IO surfaces will not work with, for example, OSMesa software renderer\n  \/\/ GL contexts.\n  if (gfx::GetGLImplementation() != gfx::kGLImplementationEGLGLES2)\n    return false;\n\n  if (!helper_->Initialize())\n    return false;\n\n  return GLSurfaceAdapter::Initialize();\n}\n\nvoid PbufferImageTransportSurface::Destroy() {\n  helper_->Destroy();\n  GLSurfaceAdapter::Destroy();\n}\n\nbool PbufferImageTransportSurface::IsOffscreen() {\n  return false;\n}\n\nbool PbufferImageTransportSurface::SwapBuffers() {\n  HANDLE surface_handle = GetShareHandle();\n  if (!surface_handle)\n    return false;\n\n  helper_->DeferToFence(base::Bind(\n      &PbufferImageTransportSurface::SendBuffersSwapped,\n      AsWeakPtr()));\n\n  return true;\n}\n\nbool PbufferImageTransportSurface::PostSubBuffer(\n    int x, int y, int width, int height) {\n  NOTREACHED();\n  return false;\n}\n\nvoid PbufferImageTransportSurface::SetVisible(bool visible) {\n  if (visible == is_visible_)\n    return;\n\n  is_visible_ = visible;\n\n  if (visible)\n    Resize(visible_size_);\n  else\n    Resize(gfx::Size(1, 1));\n}\n\nstd::string PbufferImageTransportSurface::GetExtensions() {\n  std::string extensions = gfx::GLSurface::GetExtensions();\n  extensions += extensions.empty() ? \"\" : \" \";\n  extensions += \"GL_CHROMIUM_front_buffer_cached\";\n  return extensions;\n}\n\nvoid PbufferImageTransportSurface::SendBuffersSwapped() {\n  GpuHostMsg_AcceleratedSurfaceBuffersSwapped_Params params;\n  params.surface_id = reinterpret_cast<int64>(GetShareHandle());\n  params.size = GetSize();\n  helper_->SendAcceleratedSurfaceBuffersSwapped(params);\n\n  helper_->SetScheduled(false);\n}\n\nvoid PbufferImageTransportSurface::OnBuffersSwappedACK() {\n  helper_->SetScheduled(true);\n}\n\nvoid PbufferImageTransportSurface::OnPostSubBufferACK() {\n  NOTREACHED();\n}\n\nvoid PbufferImageTransportSurface::OnNewSurfaceACK(\n    uint64 surface_id,\n    TransportDIB::Handle shm_handle) {\n  NOTREACHED();\n}\n\nvoid PbufferImageTransportSurface::OnResizeViewACK() {\n  NOTREACHED();\n}\n\nvoid PbufferImageTransportSurface::OnResize(gfx::Size size) {\n  if (is_visible_)\n    Resize(size);\n\n  visible_size_ = size;\n}\n\n}  \/\/ namespace anonymous\n\n\/\/ static\nscoped_refptr<gfx::GLSurface> ImageTransportSurface::CreateSurface(\n    GpuChannelManager* manager,\n    int32 render_view_id,\n    int32 renderer_id,\n    int32 command_buffer_id,\n    gfx::PluginWindowHandle handle) {\n  scoped_refptr<gfx::GLSurface> surface;\n\n  base::win::OSInfo* os_info = base::win::OSInfo::GetInstance();\n\n  if (gfx::GetGLImplementation() == gfx::kGLImplementationEGLGLES2 &&\n      gfx::g_EGL_ANGLE_query_surface_pointer &&\n      gfx::g_EGL_ANGLE_d3d_share_handle_client_buffer &&\n      !CommandLine::ForCurrentProcess()->HasSwitch(\n          switches::kDisableImageTransportSurface)) {\n    surface = new PbufferImageTransportSurface(manager,\n                                               render_view_id,\n                                               renderer_id,\n                                               command_buffer_id);\n  } else {\n    surface = gfx::GLSurface::CreateViewGLSurface(false, handle);\n    if (!surface.get())\n      return NULL;\n\n    surface = new PassThroughImageTransportSurface(manager,\n                                                   render_view_id,\n                                                   renderer_id,\n                                                   command_buffer_id,\n                                                   surface.get());\n  }\n\n  if (surface->Initialize())\n    return surface;\n  else\n    return NULL;\n}\n\n#endif  \/\/ ENABLE_GPU\n<commit_msg>Decide whether to use image transport surface on windows by querying EGL extensions directly.<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#if defined(ENABLE_GPU)\n\n#include \"content\/common\/gpu\/image_transport_surface.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/memory\/weak_ptr.h\"\n#include \"base\/win\/windows_version.h\"\n#include \"content\/common\/gpu\/gpu_messages.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"third_party\/angle\/include\/EGL\/egl.h\"\n#include \"ui\/gfx\/gl\/gl_bindings.h\"\n#include \"ui\/gfx\/gl\/gl_context.h\"\n#include \"ui\/gfx\/gl\/gl_implementation.h\"\n#include \"ui\/gfx\/gl\/gl_surface_egl.h\"\n#include \"ui\/gfx\/native_widget_types.h\"\n\nnamespace {\n\n\/\/ We are backed by an Pbuffer offscreen surface through which ANGLE provides\n\/\/ a handle to the corresponding render target texture through an extension.\nclass PbufferImageTransportSurface\n    : public gfx::GLSurfaceAdapter,\n      public ImageTransportSurface,\n      public base::SupportsWeakPtr<PbufferImageTransportSurface> {\n public:\n  PbufferImageTransportSurface(GpuChannelManager* manager,\n                               int32 render_view_id,\n                               int32 renderer_id,\n                               int32 command_buffer_id);\n\n  \/\/ gfx::GLSurface implementation\n  virtual bool Initialize() OVERRIDE;\n  virtual void Destroy() OVERRIDE;\n  virtual bool IsOffscreen() OVERRIDE;\n  virtual bool SwapBuffers() OVERRIDE;\n  virtual bool PostSubBuffer(int x, int y, int width, int height) OVERRIDE;\n  virtual std::string GetExtensions() OVERRIDE;\n  virtual void SetVisible(bool visible) OVERRIDE;\n\n protected:\n  \/\/ ImageTransportSurface implementation\n  virtual void OnNewSurfaceACK(uint64 surface_id,\n                               TransportDIB::Handle shm_handle) OVERRIDE;\n  virtual void OnBuffersSwappedACK() OVERRIDE;\n  virtual void OnPostSubBufferACK() OVERRIDE;\n  virtual void OnResizeViewACK() OVERRIDE;\n  virtual void OnResize(gfx::Size size) OVERRIDE;\n\n private:\n  virtual ~PbufferImageTransportSurface();\n  void SendBuffersSwapped();\n\n  \/\/ Whether the surface is currently visible.\n  bool is_visible_;\n\n  \/\/ Size to resize to when the surface becomes visible.\n  gfx::Size visible_size_;\n\n  scoped_ptr<ImageTransportHelper> helper_;\n\n  DISALLOW_COPY_AND_ASSIGN(PbufferImageTransportSurface);\n};\n\nPbufferImageTransportSurface::PbufferImageTransportSurface(\n    GpuChannelManager* manager,\n    int32 render_view_id,\n    int32 renderer_id,\n    int32 command_buffer_id)\n        : GLSurfaceAdapter(new gfx::PbufferGLSurfaceEGL(false,\n                                                        gfx::Size(1, 1))),\n          is_visible_(true) {\n  helper_.reset(new ImageTransportHelper(this,\n                                         manager,\n                                         render_view_id,\n                                         renderer_id,\n                                         command_buffer_id,\n                                         gfx::kNullPluginWindow));\n}\n\nPbufferImageTransportSurface::~PbufferImageTransportSurface() {\n  Destroy();\n}\n\nbool PbufferImageTransportSurface::Initialize() {\n  \/\/ Only support this path if the GL implementation is ANGLE.\n  \/\/ IO surfaces will not work with, for example, OSMesa software renderer\n  \/\/ GL contexts.\n  if (gfx::GetGLImplementation() != gfx::kGLImplementationEGLGLES2)\n    return false;\n\n  if (!helper_->Initialize())\n    return false;\n\n  return GLSurfaceAdapter::Initialize();\n}\n\nvoid PbufferImageTransportSurface::Destroy() {\n  helper_->Destroy();\n  GLSurfaceAdapter::Destroy();\n}\n\nbool PbufferImageTransportSurface::IsOffscreen() {\n  return false;\n}\n\nbool PbufferImageTransportSurface::SwapBuffers() {\n  HANDLE surface_handle = GetShareHandle();\n  if (!surface_handle)\n    return false;\n\n  helper_->DeferToFence(base::Bind(\n      &PbufferImageTransportSurface::SendBuffersSwapped,\n      AsWeakPtr()));\n\n  return true;\n}\n\nbool PbufferImageTransportSurface::PostSubBuffer(\n    int x, int y, int width, int height) {\n  NOTREACHED();\n  return false;\n}\n\nvoid PbufferImageTransportSurface::SetVisible(bool visible) {\n  if (visible == is_visible_)\n    return;\n\n  is_visible_ = visible;\n\n  if (visible)\n    Resize(visible_size_);\n  else\n    Resize(gfx::Size(1, 1));\n}\n\nstd::string PbufferImageTransportSurface::GetExtensions() {\n  std::string extensions = gfx::GLSurface::GetExtensions();\n  extensions += extensions.empty() ? \"\" : \" \";\n  extensions += \"GL_CHROMIUM_front_buffer_cached\";\n  return extensions;\n}\n\nvoid PbufferImageTransportSurface::SendBuffersSwapped() {\n  GpuHostMsg_AcceleratedSurfaceBuffersSwapped_Params params;\n  params.surface_id = reinterpret_cast<int64>(GetShareHandle());\n  params.size = GetSize();\n  helper_->SendAcceleratedSurfaceBuffersSwapped(params);\n\n  helper_->SetScheduled(false);\n}\n\nvoid PbufferImageTransportSurface::OnBuffersSwappedACK() {\n  helper_->SetScheduled(true);\n}\n\nvoid PbufferImageTransportSurface::OnPostSubBufferACK() {\n  NOTREACHED();\n}\n\nvoid PbufferImageTransportSurface::OnNewSurfaceACK(\n    uint64 surface_id,\n    TransportDIB::Handle shm_handle) {\n  NOTREACHED();\n}\n\nvoid PbufferImageTransportSurface::OnResizeViewACK() {\n  NOTREACHED();\n}\n\nvoid PbufferImageTransportSurface::OnResize(gfx::Size size) {\n  if (is_visible_)\n    Resize(size);\n\n  visible_size_ = size;\n}\n\n}  \/\/ namespace anonymous\n\n\/\/ static\nscoped_refptr<gfx::GLSurface> ImageTransportSurface::CreateSurface(\n    GpuChannelManager* manager,\n    int32 render_view_id,\n    int32 renderer_id,\n    int32 command_buffer_id,\n    gfx::PluginWindowHandle handle) {\n  scoped_refptr<gfx::GLSurface> surface;\n  base::win::OSInfo* os_info = base::win::OSInfo::GetInstance();\n\n  if (gfx::GetGLImplementation() == gfx::kGLImplementationEGLGLES2 &&\n      !CommandLine::ForCurrentProcess()->HasSwitch(\n          switches::kDisableImageTransportSurface)) {\n    const char* extensions = eglQueryString(eglGetDisplay(EGL_DEFAULT_DISPLAY),\n                                            EGL_EXTENSIONS);\n    if (strstr(extensions, \"EGL_ANGLE_query_surface_pointer\") &&\n        strstr(extensions, \"EGL_ANGLE_surface_d3d_texture_2d_share_handle\")) {\n      surface = new PbufferImageTransportSurface(manager,\n                                                 render_view_id,\n                                                 renderer_id,\n                                                 command_buffer_id);\n    }\n  }\n\n  if (!surface.get()) {\n    surface = gfx::GLSurface::CreateViewGLSurface(false, handle);\n    if (!surface.get())\n      return NULL;\n\n    surface = new PassThroughImageTransportSurface(manager,\n                                                   render_view_id,\n                                                   renderer_id,\n                                                   command_buffer_id,\n                                                   surface.get());\n  }\n\n  if (surface->Initialize())\n    return surface;\n  else\n    return NULL;\n}\n\n#endif  \/\/ ENABLE_GPU\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: SchXMLParagraphContext.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: rt $ $Date: 2008-03-12 10:26: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_xmloff.hxx\"\n\n#include \"SchXMLImport.hxx\"\n#include \"SchXMLParagraphContext.hxx\"\n\n#include \"xmlnmspe.hxx\"\n#include <xmloff\/xmltoken.hxx>\n#include <xmloff\/nmspmap.hxx>\n\nusing ::rtl::OUString;\nusing namespace com::sun::star;\nusing namespace ::xmloff::token;\n\nSchXMLParagraphContext::SchXMLParagraphContext( SvXMLImport& rImport,\n                                                const OUString& rLocalName,\n                                                OUString& rText,\n                                                OUString * pOutId \/* = 0 *\/ ) :\n        SvXMLImportContext( rImport, XML_NAMESPACE_TEXT, rLocalName ),\n        mrText( rText ),\n        mpId( pOutId )\n{\n}\n\nSchXMLParagraphContext::~SchXMLParagraphContext()\n{}\n\nvoid SchXMLParagraphContext::StartElement( const uno::Reference< xml::sax::XAttributeList >& xAttrList )\n{\n    \/\/ remember the id. It is used for storing the original cell range string in\n    \/\/ a local table (cached data)\n    if( mpId )\n    {\n        sal_Int16 nAttrCount = xAttrList.is()? xAttrList->getLength(): 0;\n        rtl::OUString aValue;\n\n        for( sal_Int16 i = 0; i < nAttrCount; i++ )\n        {\n            rtl::OUString sAttrName = xAttrList->getNameByIndex( i );\n            rtl::OUString aLocalName;\n            USHORT nPrefix = GetImport().GetNamespaceMap().GetKeyByAttrName( sAttrName, &aLocalName );\n\n            if( nPrefix == XML_NAMESPACE_TEXT &&\n                IsXMLToken( aLocalName, XML_ID ) )\n            {\n                (*mpId) = xAttrList->getValueByIndex( i );\n                break;   \/\/ we only need this attribute\n            }\n        }\n    }\n}\n\nvoid SchXMLParagraphContext::EndElement()\n{\n    mrText = maBuffer.makeStringAndClear();\n}\n\nSvXMLImportContext* SchXMLParagraphContext::CreateChildContext(\n    USHORT nPrefix,\n    const OUString& rLocalName,\n    const uno::Reference< xml::sax::XAttributeList >& )\n{\n    if( nPrefix == XML_NAMESPACE_TEXT )\n    {\n        if( rLocalName.equals( ::xmloff::token::GetXMLToken( ::xmloff::token::XML_TAB_STOP )))\n        {\n            maBuffer.append( sal_Unicode( 0x0009 ));  \/\/ tabulator\n        }\n        else if( rLocalName.equals( ::xmloff::token::GetXMLToken( ::xmloff::token::XML_LINE_BREAK )))\n        {\n            maBuffer.append( sal_Unicode( 0x000A ));  \/\/ linefeed\n        }\n    }\n\n    return new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n}\n\nvoid SchXMLParagraphContext::Characters( const OUString& rChars )\n{\n    maBuffer.append( rChars );\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.18); FILE MERGED 2008\/03\/31 16:28:00 rt 1.8.18.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: SchXMLParagraphContext.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_xmloff.hxx\"\n\n#include \"SchXMLImport.hxx\"\n#include \"SchXMLParagraphContext.hxx\"\n\n#include \"xmlnmspe.hxx\"\n#include <xmloff\/xmltoken.hxx>\n#include <xmloff\/nmspmap.hxx>\n\nusing ::rtl::OUString;\nusing namespace com::sun::star;\nusing namespace ::xmloff::token;\n\nSchXMLParagraphContext::SchXMLParagraphContext( SvXMLImport& rImport,\n                                                const OUString& rLocalName,\n                                                OUString& rText,\n                                                OUString * pOutId \/* = 0 *\/ ) :\n        SvXMLImportContext( rImport, XML_NAMESPACE_TEXT, rLocalName ),\n        mrText( rText ),\n        mpId( pOutId )\n{\n}\n\nSchXMLParagraphContext::~SchXMLParagraphContext()\n{}\n\nvoid SchXMLParagraphContext::StartElement( const uno::Reference< xml::sax::XAttributeList >& xAttrList )\n{\n    \/\/ remember the id. It is used for storing the original cell range string in\n    \/\/ a local table (cached data)\n    if( mpId )\n    {\n        sal_Int16 nAttrCount = xAttrList.is()? xAttrList->getLength(): 0;\n        rtl::OUString aValue;\n\n        for( sal_Int16 i = 0; i < nAttrCount; i++ )\n        {\n            rtl::OUString sAttrName = xAttrList->getNameByIndex( i );\n            rtl::OUString aLocalName;\n            USHORT nPrefix = GetImport().GetNamespaceMap().GetKeyByAttrName( sAttrName, &aLocalName );\n\n            if( nPrefix == XML_NAMESPACE_TEXT &&\n                IsXMLToken( aLocalName, XML_ID ) )\n            {\n                (*mpId) = xAttrList->getValueByIndex( i );\n                break;   \/\/ we only need this attribute\n            }\n        }\n    }\n}\n\nvoid SchXMLParagraphContext::EndElement()\n{\n    mrText = maBuffer.makeStringAndClear();\n}\n\nSvXMLImportContext* SchXMLParagraphContext::CreateChildContext(\n    USHORT nPrefix,\n    const OUString& rLocalName,\n    const uno::Reference< xml::sax::XAttributeList >& )\n{\n    if( nPrefix == XML_NAMESPACE_TEXT )\n    {\n        if( rLocalName.equals( ::xmloff::token::GetXMLToken( ::xmloff::token::XML_TAB_STOP )))\n        {\n            maBuffer.append( sal_Unicode( 0x0009 ));  \/\/ tabulator\n        }\n        else if( rLocalName.equals( ::xmloff::token::GetXMLToken( ::xmloff::token::XML_LINE_BREAK )))\n        {\n            maBuffer.append( sal_Unicode( 0x000A ));  \/\/ linefeed\n        }\n    }\n\n    return new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n}\n\nvoid SchXMLParagraphContext::Characters( const OUString& rChars )\n{\n    maBuffer.append( rChars );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLSectionImportContext.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 15:17: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_XMLSECTIONIMPORTCONTEXT_HXX_\n#define _XMLOFF_XMLSECTIONIMPORTCONTEXT_HXX_\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include \"xmlictxt.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 _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n\nnamespace com { namespace sun { namespace star {\n    namespace text { class XTextRange;  }\n    namespace beans { class XPropertySet; }\n    namespace xml { namespace sax { class XAttributeList; } }\n} } }\nnamespace rtl { class OUString; }\nclass XMLTextImportHelper;\n\n\n\/**\n * Import text sections.\n *\n * This context may *also* be used for index header sections. The\n * differentiates its behaviour based on GetLocalName().\n *\/\nclass XMLSectionImportContext : public SvXMLImportContext\n{\n    \/\/\/ start position; ranges aquired via getStart(),getEnd() don't move\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::text::XTextRange> xStartRange;\n\n    \/\/\/ end position\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::text::XTextRange> xEndRange;\n\n    \/\/\/ TextSection (as XPropertySet) for passing down to data source elements\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::beans::XPropertySet> xSectionPropertySet;\n\n    const ::rtl::OUString sTextSection;\n    const ::rtl::OUString sIndexHeaderSection;\n    const ::rtl::OUString sCondition;\n    const ::rtl::OUString sIsVisible;\n    const ::rtl::OUString sProtectionKey;\n    const ::rtl::OUString sIsProtected;\n    const ::rtl::OUString sIsCurrentlyVisible;\n    const ::rtl::OUString sEmpty;\n\n    ::rtl::OUString sStyleName;\n    ::rtl::OUString sName;\n    ::rtl::OUString sCond;\n    ::com::sun::star::uno::Sequence<sal_Int8> aSequence;\n    sal_Bool bProtect;\n    sal_Bool bCondOK;\n    sal_Bool bIsVisible;\n    sal_Bool bValid;\n    sal_Bool bSequenceOK;\n    sal_Bool bIsCurrentlyVisible;\n    sal_Bool bIsCurrentlyVisibleOK;\n\n    sal_Bool bHasContent;\n\npublic:\n\n    TYPEINFO();\n\n    XMLSectionImportContext(\n        SvXMLImport& rImport,\n        sal_uInt16 nPrfx,\n        const ::rtl::OUString& rLocalName );\n\n    ~XMLSectionImportContext();\n\nprotected:\n\n    virtual void StartElement(\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::xml::sax::XAttributeList> & xAttrList);\n\n    virtual void EndElement();\n\n    virtual SvXMLImportContext *CreateChildContext(\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\n    void ProcessAttributes(\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::xml::sax::XAttributeList> & xAttrList );\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS vgbugs07 (1.10.274); FILE MERGED 2007\/06\/04 13:23:38 vg 1.10.274.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: XMLSectionImportContext.hxx,v $\n *\n *  $Revision: 1.11 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 16:05: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 _XMLOFF_XMLSECTIONIMPORTCONTEXT_HXX_\n#define _XMLOFF_XMLSECTIONIMPORTCONTEXT_HXX_\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include <xmloff\/xmlictxt.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 _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n\nnamespace com { namespace sun { namespace star {\n    namespace text { class XTextRange;  }\n    namespace beans { class XPropertySet; }\n    namespace xml { namespace sax { class XAttributeList; } }\n} } }\nnamespace rtl { class OUString; }\nclass XMLTextImportHelper;\n\n\n\/**\n * Import text sections.\n *\n * This context may *also* be used for index header sections. The\n * differentiates its behaviour based on GetLocalName().\n *\/\nclass XMLSectionImportContext : public SvXMLImportContext\n{\n    \/\/\/ start position; ranges aquired via getStart(),getEnd() don't move\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::text::XTextRange> xStartRange;\n\n    \/\/\/ end position\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::text::XTextRange> xEndRange;\n\n    \/\/\/ TextSection (as XPropertySet) for passing down to data source elements\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::beans::XPropertySet> xSectionPropertySet;\n\n    const ::rtl::OUString sTextSection;\n    const ::rtl::OUString sIndexHeaderSection;\n    const ::rtl::OUString sCondition;\n    const ::rtl::OUString sIsVisible;\n    const ::rtl::OUString sProtectionKey;\n    const ::rtl::OUString sIsProtected;\n    const ::rtl::OUString sIsCurrentlyVisible;\n    const ::rtl::OUString sEmpty;\n\n    ::rtl::OUString sStyleName;\n    ::rtl::OUString sName;\n    ::rtl::OUString sCond;\n    ::com::sun::star::uno::Sequence<sal_Int8> aSequence;\n    sal_Bool bProtect;\n    sal_Bool bCondOK;\n    sal_Bool bIsVisible;\n    sal_Bool bValid;\n    sal_Bool bSequenceOK;\n    sal_Bool bIsCurrentlyVisible;\n    sal_Bool bIsCurrentlyVisibleOK;\n\n    sal_Bool bHasContent;\n\npublic:\n\n    TYPEINFO();\n\n    XMLSectionImportContext(\n        SvXMLImport& rImport,\n        sal_uInt16 nPrfx,\n        const ::rtl::OUString& rLocalName );\n\n    ~XMLSectionImportContext();\n\nprotected:\n\n    virtual void StartElement(\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::xml::sax::XAttributeList> & xAttrList);\n\n    virtual void EndElement();\n\n    virtual SvXMLImportContext *CreateChildContext(\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\n    void ProcessAttributes(\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::xml::sax::XAttributeList> & xAttrList );\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Ouzel by Elviss Strazdins\n\n#ifndef OUZEL_AUDIO_ALCERRORCATEGORY_HPP\n#define OUZEL_AUDIO_ALCERRORCATEGORY_HPP\n\n#include \"..\/..\/core\/Setup.h\"\n\n#if OUZEL_COMPILE_OPENAL\n\n#include <system_error>\n#ifdef __APPLE__\n#  include <OpenAl\/alc.h>\n#else\n#  include <AL\/alc.h>\n#endif\n\nnamespace ouzel::audio::alc\n{\n    class ErrorCategory final: public std::error_category\n        {\n        public:\n            const char* name() const noexcept override\n            {\n                return \"ALC\";\n            }\n\n            std::string message(const int condition) const override\n            {\n                switch (condition)\n                {\n                    case ALC_INVALID_DEVICE: return \"ALC_INVALID_DEVICE\";\n                    case ALC_INVALID_CONTEXT: return \"ALC_INVALID_CONTEXT\";\n                    case ALC_INVALID_ENUM: return \"ALC_INVALID_ENUM\";\n                    case ALC_INVALID_VALUE: return \"ALC_INVALID_VALUE\";\n                    case ALC_OUT_OF_MEMORY: return \"ALC_OUT_OF_MEMORY\";\n                    default: return \"Unknown error (\" + std::to_string(condition) + \")\";\n                }\n            }\n        };\n}\n#endif\n\n#endif \/\/ OUZEL_AUDIO_ALCERRORCATEGORY_HPP\n<commit_msg>Fix tabbing<commit_after>\/\/ Ouzel by Elviss Strazdins\n\n#ifndef OUZEL_AUDIO_ALCERRORCATEGORY_HPP\n#define OUZEL_AUDIO_ALCERRORCATEGORY_HPP\n\n#include \"..\/..\/core\/Setup.h\"\n\n#if OUZEL_COMPILE_OPENAL\n\n#include <system_error>\n#ifdef __APPLE__\n#  include <OpenAl\/alc.h>\n#else\n#  include <AL\/alc.h>\n#endif\n\nnamespace ouzel::audio::alc\n{\n    class ErrorCategory final: public std::error_category\n    {\n    public:\n        const char* name() const noexcept override\n        {\n            return \"ALC\";\n        }\n\n        std::string message(const int condition) const override\n        {\n            switch (condition)\n            {\n                case ALC_INVALID_DEVICE: return \"ALC_INVALID_DEVICE\";\n                case ALC_INVALID_CONTEXT: return \"ALC_INVALID_CONTEXT\";\n                case ALC_INVALID_ENUM: return \"ALC_INVALID_ENUM\";\n                case ALC_INVALID_VALUE: return \"ALC_INVALID_VALUE\";\n                case ALC_OUT_OF_MEMORY: return \"ALC_OUT_OF_MEMORY\";\n                default: return \"Unknown error (\" + std::to_string(condition) + \")\";\n            }\n        }\n    };\n}\n#endif\n\n#endif \/\/ OUZEL_AUDIO_ALCERRORCATEGORY_HPP\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 <vector>\n#include <list>\n#include <type_traits>\n#include <stdexcept>\n#include \"command_buffer.hpp\"\n#include \"hash.hpp\"\n#include \"enum_cast.hpp\"\n#include \"intrusive_hash_map.hpp\"\n#include \"math.hpp\"\n\nnamespace Granite\n{\nclass ShaderSuite;\nclass RenderContext;\nclass AbstractRenderable;\nclass PositionalLight;\nstruct VolumetricDiffuseLightComponent;\nstruct RenderInfoComponent;\n\nstruct RenderableInfo\n{\n\tconst AbstractRenderable *renderable;\n\tconst RenderInfoComponent *transform;\n\tUtil::Hash transform_hash;\n};\n\nstruct PositionalLightInfo\n{\n\tPositionalLight *light;\n\tconst RenderInfoComponent *transform;\n\tUtil::Hash transform_hash;\n};\nusing VisibilityList = std::vector<RenderableInfo>;\nusing PositionalLightList = std::vector<PositionalLightInfo>;\n\nstruct VolumetricDiffuseLightInfo\n{\n\tVolumetricDiffuseLightComponent *light;\n\tconst RenderInfoComponent *transform;\n};\nusing VolumetricDiffuseLightList = std::vector<VolumetricDiffuseLightInfo>;\n\nenum class Queue : unsigned\n{\n\tOpaque = 0,\n\tOpaqueEmissive,\n\tLight, \/\/ Relevant only for classic deferred rendering\n\tTransparent,\n\tCount\n};\n\nenum class StaticLayer : unsigned\n{\n\tFront,\n\tDefault,\n\tBack,\n\tLast,\n\tCount\n};\n\nstruct RenderInfo\n{\n\tstatic uint64_t get_sort_key(const RenderContext &context, Queue queue_type,\n\t                             Util::Hash pipeline_hash, Util::Hash draw_hash,\n\t                             const vec3 &center,\n\t                             StaticLayer layer = StaticLayer::Default);\n\tstatic uint64_t get_sprite_sort_key(Queue queue_type,\n\t                                    Util::Hash pipeline_hash, Util::Hash draw_hash,\n\t                                    float layer, StaticLayer static_layer = StaticLayer::Default);\n\tstatic uint64_t get_background_sort_key(Queue queue_type, Util::Hash pipeline_hash, Util::Hash draw_hash);\n\nprivate:\n\tRenderInfo() = default;\n};\n\nstruct RenderQueueData;\nusing RenderFunc = void (*)(Vulkan::CommandBuffer &, const RenderQueueData *, unsigned);\n\nstruct RenderQueueData\n{\n\t\/\/ How to render an object.\n\tRenderFunc render;\n\n\t\/\/ Per-draw call specific data. Understood by the render callback.\n\tconst void *render_info;\n\n\t\/\/ Per-instance specific data. Understood by the render callback.\n\tconst void *instance_data;\n\n\t\/\/ Sorting key.\n\t\/\/ Lower sorting keys will appear earlier.\n\tuint64_t sorting_key;\n};\n\nstruct QueueDataWrappedErased : Util::IntrusiveHashMapEnabled<QueueDataWrappedErased>\n{\n};\n\ntemplate <typename T>\nstruct QueueDataWrapped : QueueDataWrappedErased\n{\n\tT data;\n};\n\nclass RenderQueue\n{\npublic:\n\tenum { BlockSize = 64 * 1024 };\n\n\tRenderQueue() = default;\n\tvoid operator=(const RenderQueue &) = delete;\n\tRenderQueue(const RenderQueue &) = delete;\n\t~RenderQueue();\n\n\ttemplate <typename T>\n\tT *push(Queue queue, Util::Hash instance_key, uint64_t sorting_key,\n\t        RenderFunc render, void *instance_data)\n\t{\n\t\tstatic_assert(std::is_trivially_destructible<T>::value, \"Dispatchable type is not trivially destructible!\");\n\n\t\tassert(instance_key != 0);\n\t\tassert(sorting_key != 0);\n\n\t\tUtil::Hasher h(instance_key);\n\t\th.pointer(render);\n\n\t\tusing WrappedT = QueueDataWrapped<T>;\n\n\t\tauto *itr = render_infos.find(h.get());\n\t\tif (itr)\n\t\t{\n\t\t\tauto *t = static_cast<WrappedT *>(itr);\n\t\t\tenqueue_queue_data(queue, { render, &t->data, instance_data, sorting_key });\n\t\t\treturn nullptr;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvoid *buffer = allocate(sizeof(WrappedT), alignof(WrappedT));\n\t\t\tif (!buffer)\n\t\t\t\tthrow std::bad_alloc();\n\n\t\t\tauto *t = new(buffer) WrappedT();\n\t\t\tt->set_hash(h.get());\n\t\t\trender_infos.insert_replace(t);\n\t\t\tenqueue_queue_data(queue, { render, &t->data, instance_data, sorting_key });\n\t\t\treturn &t->data;\n\t\t}\n\t}\n\n\tvoid *allocate(size_t size, size_t alignment = 64);\n\n\ttemplate <typename T>\n\tT *allocate_one()\n\t{\n\t\tstatic_assert(std::is_trivially_destructible<T>::value, \"Type is not trivially destructible!\");\n\t\treturn static_cast<T *>(allocate(sizeof(T), alignof(T)));\n\t}\n\n\ttemplate <typename T>\n\tT *allocate_many(size_t n)\n\t{\n\t\tstatic_assert(std::is_trivially_destructible<T>::value, \"Type is not trivially destructible!\");\n\t\treturn static_cast<T *>(allocate(sizeof(T) * n, alignof(T)));\n\t}\n\n\tvoid combine_render_info(const RenderQueue &queue);\n\tvoid reset();\n\n\tusing RenderQueueDataVector = Util::SmallVector<RenderQueueData, 64>;\n\n\tconst RenderQueueDataVector &get_queue_data(Queue queue) const\n\t{\n\t\treturn queues[Util::ecast(queue)];\n\t}\n\n\tvoid sort();\n\tvoid dispatch(Queue queue, Vulkan::CommandBuffer &cmd, const Vulkan::CommandBufferSavedState *state) const;\n\tvoid dispatch_range(Queue queue, Vulkan::CommandBuffer &cmd, const Vulkan::CommandBufferSavedState *state, size_t begin, size_t end) const;\n\tvoid dispatch_subset(Queue queue, Vulkan::CommandBuffer &cmd, const Vulkan::CommandBufferSavedState *state, unsigned index, unsigned num_indices) const;\n\tsize_t get_dispatch_size(Queue queue) const;\n\n\tvoid set_shader_suites(ShaderSuite *suite)\n\t{\n\t\tshader_suites = suite;\n\t}\n\n\tShaderSuite *get_shader_suites() const\n\t{\n\t\treturn shader_suites;\n\t}\n\n\tvoid push_renderables(const RenderContext &context, const RenderableInfo *visible, size_t count);\n\tvoid push_depth_renderables(const RenderContext &context, const RenderableInfo *visible, size_t count);\n\nprivate:\n\tvoid enqueue_queue_data(Queue queue, const RenderQueueData &data);\n\n\tstruct Block : Util::IntrusivePtrEnabled<Block>\n\t{\n\t\tstd::unique_ptr<uint8_t[]> large_buffer;\n\t\tuintptr_t ptr = 0;\n\t\tuintptr_t begin = 0;\n\t\tuintptr_t end = 0;\n\t\tuint8_t inline_buffer[BlockSize];\n\n\t\texplicit Block(size_t size)\n\t\t{\n\t\t\tlarge_buffer.reset(new uint8_t[size]);\n\t\t\tbegin = reinterpret_cast<uintptr_t>(large_buffer.get());\n\t\t\tend = reinterpret_cast<uintptr_t>(large_buffer.get()) + size;\n\t\t\treset();\n\t\t}\n\n\t\tBlock()\n\t\t{\n\t\t\tbegin = reinterpret_cast<uintptr_t>(inline_buffer);\n\t\t\tend = reinterpret_cast<uintptr_t>(inline_buffer) + BlockSize;\n\t\t\treset();\n\t\t}\n\n\t\tvoid operator=(const Block &) = delete;\n\t\tBlock(const Block &) = delete;\n\n\t\tvoid reset()\n\t\t{\n\t\t\tptr = begin;\n\t\t}\n\t};\n\n\tstatic Util::ThreadSafeObjectPool<Block> allocator_pool;\n\n\tstatic void *allocate_from_block(Block &block, size_t size, size_t alignment);\n\tBlock *insert_block();\n\tBlock *insert_large_block(size_t size, size_t alignment);\n\n\tRenderQueueDataVector queues[static_cast<unsigned>(Queue::Count)];\n\tUtil::SmallVector<Block *, 64> blocks;\n\tBlock *current = nullptr;\n\n\tShaderSuite *shader_suites = nullptr;\n\tUtil::IntrusiveHashMapHolder<QueueDataWrappedErased> render_infos;\n\tvoid recycle_blocks();\n};\n}\n<commit_msg>Default construct RenderQueue::allocate<T>.<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 <vector>\n#include <list>\n#include <type_traits>\n#include <stdexcept>\n#include \"command_buffer.hpp\"\n#include \"hash.hpp\"\n#include \"enum_cast.hpp\"\n#include \"intrusive_hash_map.hpp\"\n#include \"math.hpp\"\n\nnamespace Granite\n{\nclass ShaderSuite;\nclass RenderContext;\nclass AbstractRenderable;\nclass PositionalLight;\nstruct VolumetricDiffuseLightComponent;\nstruct RenderInfoComponent;\n\nstruct RenderableInfo\n{\n\tconst AbstractRenderable *renderable;\n\tconst RenderInfoComponent *transform;\n\tUtil::Hash transform_hash;\n};\n\nstruct PositionalLightInfo\n{\n\tPositionalLight *light;\n\tconst RenderInfoComponent *transform;\n\tUtil::Hash transform_hash;\n};\nusing VisibilityList = std::vector<RenderableInfo>;\nusing PositionalLightList = std::vector<PositionalLightInfo>;\n\nstruct VolumetricDiffuseLightInfo\n{\n\tVolumetricDiffuseLightComponent *light;\n\tconst RenderInfoComponent *transform;\n};\nusing VolumetricDiffuseLightList = std::vector<VolumetricDiffuseLightInfo>;\n\nenum class Queue : unsigned\n{\n\tOpaque = 0,\n\tOpaqueEmissive,\n\tLight, \/\/ Relevant only for classic deferred rendering\n\tTransparent,\n\tCount\n};\n\nenum class StaticLayer : unsigned\n{\n\tFront,\n\tDefault,\n\tBack,\n\tLast,\n\tCount\n};\n\nstruct RenderInfo\n{\n\tstatic uint64_t get_sort_key(const RenderContext &context, Queue queue_type,\n\t                             Util::Hash pipeline_hash, Util::Hash draw_hash,\n\t                             const vec3 &center,\n\t                             StaticLayer layer = StaticLayer::Default);\n\tstatic uint64_t get_sprite_sort_key(Queue queue_type,\n\t                                    Util::Hash pipeline_hash, Util::Hash draw_hash,\n\t                                    float layer, StaticLayer static_layer = StaticLayer::Default);\n\tstatic uint64_t get_background_sort_key(Queue queue_type, Util::Hash pipeline_hash, Util::Hash draw_hash);\n\nprivate:\n\tRenderInfo() = default;\n};\n\nstruct RenderQueueData;\nusing RenderFunc = void (*)(Vulkan::CommandBuffer &, const RenderQueueData *, unsigned);\n\nstruct RenderQueueData\n{\n\t\/\/ How to render an object.\n\tRenderFunc render;\n\n\t\/\/ Per-draw call specific data. Understood by the render callback.\n\tconst void *render_info;\n\n\t\/\/ Per-instance specific data. Understood by the render callback.\n\tconst void *instance_data;\n\n\t\/\/ Sorting key.\n\t\/\/ Lower sorting keys will appear earlier.\n\tuint64_t sorting_key;\n};\n\nstruct QueueDataWrappedErased : Util::IntrusiveHashMapEnabled<QueueDataWrappedErased>\n{\n};\n\ntemplate <typename T>\nstruct QueueDataWrapped : QueueDataWrappedErased\n{\n\tT data;\n};\n\nclass RenderQueue\n{\npublic:\n\tenum { BlockSize = 64 * 1024 };\n\n\tRenderQueue() = default;\n\tvoid operator=(const RenderQueue &) = delete;\n\tRenderQueue(const RenderQueue &) = delete;\n\t~RenderQueue();\n\n\ttemplate <typename T>\n\tT *push(Queue queue, Util::Hash instance_key, uint64_t sorting_key,\n\t        RenderFunc render, void *instance_data)\n\t{\n\t\tstatic_assert(std::is_trivially_destructible<T>::value, \"Dispatchable type is not trivially destructible!\");\n\n\t\tassert(instance_key != 0);\n\t\tassert(sorting_key != 0);\n\n\t\tUtil::Hasher h(instance_key);\n\t\th.pointer(render);\n\n\t\tusing WrappedT = QueueDataWrapped<T>;\n\n\t\tauto *itr = render_infos.find(h.get());\n\t\tif (itr)\n\t\t{\n\t\t\tauto *t = static_cast<WrappedT *>(itr);\n\t\t\tenqueue_queue_data(queue, { render, &t->data, instance_data, sorting_key });\n\t\t\treturn nullptr;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvoid *buffer = allocate(sizeof(WrappedT), alignof(WrappedT));\n\t\t\tif (!buffer)\n\t\t\t\tthrow std::bad_alloc();\n\n\t\t\tauto *t = new(buffer) WrappedT();\n\t\t\tt->set_hash(h.get());\n\t\t\trender_infos.insert_replace(t);\n\t\t\tenqueue_queue_data(queue, { render, &t->data, instance_data, sorting_key });\n\t\t\treturn &t->data;\n\t\t}\n\t}\n\n\tvoid *allocate(size_t size, size_t alignment = 64);\n\n\ttemplate <typename T>\n\tT *allocate_one()\n\t{\n\t\tstatic_assert(std::is_trivially_destructible<T>::value, \"Type is not trivially destructible!\");\n\t\tauto *t = static_cast<T *>(allocate(sizeof(T), alignof(T)));\n\t\tif (t)\n\t\t\tnew (t) T();\n\t\treturn t;\n\t}\n\n\ttemplate <typename T>\n\tT *allocate_many(size_t n)\n\t{\n\t\tstatic_assert(std::is_trivially_destructible<T>::value, \"Type is not trivially destructible!\");\n\t\tauto *t = static_cast<T *>(allocate(sizeof(T) * n, alignof(T)));\n\t\tif (t)\n\t\t\tfor (size_t i = 0; i < n; i++)\n\t\t\t\tnew (&t[i]) T();\n\t\treturn t;\n\t}\n\n\tvoid combine_render_info(const RenderQueue &queue);\n\tvoid reset();\n\n\tusing RenderQueueDataVector = Util::SmallVector<RenderQueueData, 64>;\n\n\tconst RenderQueueDataVector &get_queue_data(Queue queue) const\n\t{\n\t\treturn queues[Util::ecast(queue)];\n\t}\n\n\tvoid sort();\n\tvoid dispatch(Queue queue, Vulkan::CommandBuffer &cmd, const Vulkan::CommandBufferSavedState *state) const;\n\tvoid dispatch_range(Queue queue, Vulkan::CommandBuffer &cmd, const Vulkan::CommandBufferSavedState *state, size_t begin, size_t end) const;\n\tvoid dispatch_subset(Queue queue, Vulkan::CommandBuffer &cmd, const Vulkan::CommandBufferSavedState *state, unsigned index, unsigned num_indices) const;\n\tsize_t get_dispatch_size(Queue queue) const;\n\n\tvoid set_shader_suites(ShaderSuite *suite)\n\t{\n\t\tshader_suites = suite;\n\t}\n\n\tShaderSuite *get_shader_suites() const\n\t{\n\t\treturn shader_suites;\n\t}\n\n\tvoid push_renderables(const RenderContext &context, const RenderableInfo *visible, size_t count);\n\tvoid push_depth_renderables(const RenderContext &context, const RenderableInfo *visible, size_t count);\n\nprivate:\n\tvoid enqueue_queue_data(Queue queue, const RenderQueueData &data);\n\n\tstruct Block : Util::IntrusivePtrEnabled<Block>\n\t{\n\t\tstd::unique_ptr<uint8_t[]> large_buffer;\n\t\tuintptr_t ptr = 0;\n\t\tuintptr_t begin = 0;\n\t\tuintptr_t end = 0;\n\t\tuint8_t inline_buffer[BlockSize];\n\n\t\texplicit Block(size_t size)\n\t\t{\n\t\t\tlarge_buffer.reset(new uint8_t[size]);\n\t\t\tbegin = reinterpret_cast<uintptr_t>(large_buffer.get());\n\t\t\tend = reinterpret_cast<uintptr_t>(large_buffer.get()) + size;\n\t\t\treset();\n\t\t}\n\n\t\tBlock()\n\t\t{\n\t\t\tbegin = reinterpret_cast<uintptr_t>(inline_buffer);\n\t\t\tend = reinterpret_cast<uintptr_t>(inline_buffer) + BlockSize;\n\t\t\treset();\n\t\t}\n\n\t\tvoid operator=(const Block &) = delete;\n\t\tBlock(const Block &) = delete;\n\n\t\tvoid reset()\n\t\t{\n\t\t\tptr = begin;\n\t\t}\n\t};\n\n\tstatic Util::ThreadSafeObjectPool<Block> allocator_pool;\n\n\tstatic void *allocate_from_block(Block &block, size_t size, size_t alignment);\n\tBlock *insert_block();\n\tBlock *insert_large_block(size_t size, size_t alignment);\n\n\tRenderQueueDataVector queues[static_cast<unsigned>(Queue::Count)];\n\tUtil::SmallVector<Block *, 64> blocks;\n\tBlock *current = nullptr;\n\n\tShaderSuite *shader_suites = nullptr;\n\tUtil::IntrusiveHashMapHolder<QueueDataWrappedErased> render_infos;\n\tvoid recycle_blocks();\n};\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"lua.h\"\n#include \"Event.h\"\n#include \"Logs.h\"\n#include \"MemCell.h\"\n#include \"Driver.h\"\n#include \"lua_ffi.h\"\n#include \"simulation.h\"\n\nlua::lua()\n{\n    state = luaL_newstate();\n    if (!state)\n        throw std::runtime_error(\"cannot create lua state\");\n    lua_atpanic(state, atpanic);\n    luaL_openlibs(state);\n\n    lua_getglobal(state, \"package\");\n    lua_pushstring(state, \"preload\");\n    lua_gettable(state, -2);\n    lua_pushcclosure(state, openffi, 0);\n    lua_setfield(state, -2, \"eu07.events\");\n    lua_settop(state, 0);\n}\n\nlua::~lua()\n{\n    lua_close(state);\n    state = nullptr;\n}\n\nvoid lua::interpret(std::string file)\n{\n    if (luaL_dofile(state, file.c_str()))\n        throw std::runtime_error(lua_tostring(state, -1));\n}\n\n\/\/ NOTE: we cannot throw exceptions in callbacks\n\/\/ because it is not supported by LuaJIT on x86 windows\n\nint lua::atpanic(lua_State *s)\n{\n\tstd::string err(lua_tostring(s, -1));\n    ErrorLog(err);\n#ifdef _WIN32\n        MessageBox(NULL, err.c_str(), \"MaSzyna\", MB_OK);\n#endif\n    return 0;\n}\n\nint lua::openffi(lua_State *s)\n{\n    if (luaL_dostring(s, lua_ffi))\n    {\n        ErrorLog(std::string(lua_tostring(s, -1)));\n        return 0;\n    }\n    return 1;\n}\n\n#ifdef _WIN32\n#define EXPORT __declspec(dllexport)\n#else\n#define EXPORT\n#endif\n\nextern \"C\"\n{\n    EXPORT basic_event* scriptapi_event_create(const char* name, double delay, double randomdelay, lua::eventhandler_t handler)\n    {\n        basic_event *event = new lua_event(handler);\n        event->m_name = std::string(name);\n        event->m_delay = delay;\n        event->m_delayrandom = randomdelay;\n\n\t\tif (simulation::Events.insert(event))\n\t\t\treturn event;\n\t\telse\n\t\t\treturn nullptr;\n    }\n\n    EXPORT basic_event* scriptapi_event_find(const char* name)\n    {\n        std::string str(name);\n        basic_event *e = simulation::Events.FindEvent(str);\n        if (e)\n            return e;\n        else\n            WriteLog(\"lua: missing event: \" + str);\n        return nullptr;\n    }\n\n    EXPORT TTrack* scriptapi_track_find(const char* name)\n    {\n        std::string str(name);\n\t\tTTrack *track = simulation::Paths.find(str);\n        if (track)\n            return track;\n        else\n            WriteLog(\"lua: missing track: \" + str);\n        return nullptr;\n    }\n\n    EXPORT bool scriptapi_track_isoccupied(TTrack* track)\n    {\n        if (track)\n            return !track->IsEmpty();\n        return false;\n    }\n\n\tEXPORT TIsolated* scriptapi_isolated_find(const char* name)\n\t{\n\t\tstd::string str(name);\n        TIsolated *isolated = TIsolated::Find(name);\n\t\tif (isolated)\n\t\t\treturn isolated;\n\t\telse\n\t\t\tWriteLog(\"lua: missing isolated: \" + str);\n\t\treturn nullptr;\n\t}\n\n\tEXPORT bool scriptapi_isolated_isoccupied(TIsolated* isolated)\n\t{\n\t\tif (isolated)\n\t\t\treturn isolated->Busy();\n\t\treturn false;\n\t}\n\n    EXPORT const char* scriptapi_event_getname(basic_event *e)\n    {\n        if (e)\n            return e->m_name.c_str();\n        return nullptr;\n    }\n\n    EXPORT const char* scriptapi_train_getname(TDynamicObject *dyn)\n    {\n        if (dyn && dyn->Mechanik)\n            return dyn->Mechanik->TrainName().c_str();\n        return nullptr;\n    }\n\n    EXPORT void scriptapi_event_dispatch(basic_event *e, TDynamicObject *activator, double delay)\n    {\n        if (e)\n            simulation::Events.AddToQuery(e, activator, delay);\n    }\n\n    EXPORT double scriptapi_random(double a, double b)\n    {\n        return Random(a, b);\n    }\n\n    EXPORT void scriptapi_writelog(const char* txt)\n    {\n        WriteLog(\"lua: log: \" + std::string(txt), logtype::lua);\n    }\n\n    EXPORT void scriptapi_writeerrorlog(const char* txt)\n    {\n        ErrorLog(\"lua: log: \" + std::string(txt), logtype::lua);\n    }\n\n    struct memcell_values { const char *str; double num1; double num2; };\n\n    EXPORT TMemCell* scriptapi_memcell_find(const char *name)\n    {\n        std::string str(name);\n        TMemCell *mc = simulation::Memory.find(str);\n        if (mc)\n            return mc;\n        else\n            WriteLog(\"lua: missing memcell: \" + str);\n        return nullptr;\n    }\n\n    EXPORT memcell_values scriptapi_memcell_read(TMemCell *mc)\n    {\n        if (!mc)\n            return { nullptr, 0.0, 0.0 };\n        return { mc->Text().c_str(), mc->Value1(), mc->Value2() };\n    }\n\n    EXPORT void scriptapi_memcell_update(TMemCell *mc, const char *str, double num1, double num2)\n    {\n        if (!mc)\n            return;\n        mc->UpdateValues(std::string(str), num1, num2,\n                         basic_event::flags::text | basic_event::flags::value_1 | basic_event::flags::value_2);\n    }\n\n    EXPORT void scriptapi_dynobj_putvalues(TDynamicObject *dyn, const char *str, double num1, double num2)\n    {\n        if (!dyn)\n            return;\n        TLocation loc;\n        if (dyn->Mechanik)\n            dyn->Mechanik->PutCommand(std::string(str), num1, num2, nullptr);\n        else\n            dyn->MoverParameters->PutCommand(std::string(str), num1, num2, loc);\n    }\n}\n<commit_msg>lua putvalues fix<commit_after>#include \"stdafx.h\"\n#include \"lua.h\"\n#include \"Event.h\"\n#include \"Logs.h\"\n#include \"MemCell.h\"\n#include \"Driver.h\"\n#include \"lua_ffi.h\"\n#include \"simulation.h\"\n\nlua::lua()\n{\n    state = luaL_newstate();\n    if (!state)\n        throw std::runtime_error(\"cannot create lua state\");\n    lua_atpanic(state, atpanic);\n    luaL_openlibs(state);\n\n    lua_getglobal(state, \"package\");\n    lua_pushstring(state, \"preload\");\n    lua_gettable(state, -2);\n    lua_pushcclosure(state, openffi, 0);\n    lua_setfield(state, -2, \"eu07.events\");\n    lua_settop(state, 0);\n}\n\nlua::~lua()\n{\n    lua_close(state);\n    state = nullptr;\n}\n\nvoid lua::interpret(std::string file)\n{\n    if (luaL_dofile(state, file.c_str()))\n        throw std::runtime_error(lua_tostring(state, -1));\n}\n\n\/\/ NOTE: we cannot throw exceptions in callbacks\n\/\/ because it is not supported by LuaJIT on x86 windows\n\nint lua::atpanic(lua_State *s)\n{\n\tstd::string err(lua_tostring(s, -1));\n    ErrorLog(err);\n#ifdef _WIN32\n        MessageBox(NULL, err.c_str(), \"MaSzyna\", MB_OK);\n#endif\n    return 0;\n}\n\nint lua::openffi(lua_State *s)\n{\n    if (luaL_dostring(s, lua_ffi))\n    {\n        ErrorLog(std::string(lua_tostring(s, -1)));\n        return 0;\n    }\n    return 1;\n}\n\n#ifdef _WIN32\n#define EXPORT __declspec(dllexport)\n#else\n#define EXPORT\n#endif\n\nextern \"C\"\n{\n    EXPORT basic_event* scriptapi_event_create(const char* name, double delay, double randomdelay, lua::eventhandler_t handler)\n    {\n        basic_event *event = new lua_event(handler);\n        event->m_name = std::string(name);\n        event->m_delay = delay;\n        event->m_delayrandom = randomdelay;\n\n\t\tif (simulation::Events.insert(event))\n\t\t\treturn event;\n\t\telse\n\t\t\treturn nullptr;\n    }\n\n    EXPORT basic_event* scriptapi_event_find(const char* name)\n    {\n        std::string str(name);\n        basic_event *e = simulation::Events.FindEvent(str);\n        if (e)\n            return e;\n        else\n            WriteLog(\"lua: missing event: \" + str);\n        return nullptr;\n    }\n\n    EXPORT TTrack* scriptapi_track_find(const char* name)\n    {\n        std::string str(name);\n\t\tTTrack *track = simulation::Paths.find(str);\n        if (track)\n            return track;\n        else\n            WriteLog(\"lua: missing track: \" + str);\n        return nullptr;\n    }\n\n    EXPORT bool scriptapi_track_isoccupied(TTrack* track)\n    {\n        if (track)\n            return !track->IsEmpty();\n        return false;\n    }\n\n\tEXPORT TIsolated* scriptapi_isolated_find(const char* name)\n\t{\n\t\tstd::string str(name);\n        TIsolated *isolated = TIsolated::Find(name);\n\t\tif (isolated)\n\t\t\treturn isolated;\n\t\telse\n\t\t\tWriteLog(\"lua: missing isolated: \" + str);\n\t\treturn nullptr;\n\t}\n\n\tEXPORT bool scriptapi_isolated_isoccupied(TIsolated* isolated)\n\t{\n\t\tif (isolated)\n\t\t\treturn isolated->Busy();\n\t\treturn false;\n\t}\n\n    EXPORT const char* scriptapi_event_getname(basic_event *e)\n    {\n        if (e)\n            return e->m_name.c_str();\n        return nullptr;\n    }\n\n    EXPORT const char* scriptapi_train_getname(TDynamicObject *dyn)\n    {\n        if (dyn && dyn->Mechanik)\n            return dyn->Mechanik->TrainName().c_str();\n        return nullptr;\n    }\n\n    EXPORT void scriptapi_event_dispatch(basic_event *e, TDynamicObject *activator, double delay)\n    {\n        if (e)\n            simulation::Events.AddToQuery(e, activator, delay);\n    }\n\n    EXPORT double scriptapi_random(double a, double b)\n    {\n        return Random(a, b);\n    }\n\n    EXPORT void scriptapi_writelog(const char* txt)\n    {\n        WriteLog(\"lua: log: \" + std::string(txt), logtype::lua);\n    }\n\n    EXPORT void scriptapi_writeerrorlog(const char* txt)\n    {\n        ErrorLog(\"lua: log: \" + std::string(txt), logtype::lua);\n    }\n\n    struct memcell_values { const char *str; double num1; double num2; };\n\n    EXPORT TMemCell* scriptapi_memcell_find(const char *name)\n    {\n        std::string str(name);\n        TMemCell *mc = simulation::Memory.find(str);\n        if (mc)\n            return mc;\n        else\n            WriteLog(\"lua: missing memcell: \" + str);\n        return nullptr;\n    }\n\n    EXPORT memcell_values scriptapi_memcell_read(TMemCell *mc)\n    {\n        if (!mc)\n            return { nullptr, 0.0, 0.0 };\n        return { mc->Text().c_str(), mc->Value1(), mc->Value2() };\n    }\n\n    EXPORT void scriptapi_memcell_update(TMemCell *mc, const char *str, double num1, double num2)\n    {\n        if (!mc)\n            return;\n        mc->UpdateValues(std::string(str), num1, num2,\n                         basic_event::flags::text | basic_event::flags::value_1 | basic_event::flags::value_2);\n    }\n\n    EXPORT void scriptapi_dynobj_putvalues(TDynamicObject *dyn, const char *str, double num1, double num2)\n    {\n        if (!dyn)\n            return;\n        TLocation loc;\n        if (dyn->Mechanik)\n            dyn->Mechanik->PutCommand(std::string(str), num1, num2, loc);\n        else\n            dyn->MoverParameters->PutCommand(std::string(str), num1, num2, loc);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"cpu.h\"\n\n#if defined(YUNI_OS_DARWIN) || defined(YUNI_OS_FREEBSD) || defined(YUNI_OS_NETBSD) || defined(YUNI_OS_OPENBSD)\n# include <sys\/param.h>\n# include <sys\/sysctl.h>\n#endif\n#if defined(YUNI_OS_LINUX) || defined(YUNI_OS_CYGWIN)\n# include <fstream>\n# include \"..\/string.h\"\n#endif\n#include \"windows.hdr.h\"\n\n\n\n\nnamespace Yuni\n{\nnamespace System\n{\nnamespace CPU\n{\n\n\n\t#if defined(YUNI_OS_DARWIN) || defined(YUNI_OS_FREEBSD) || defined(YUNI_OS_NETBSD) || defined(YUNI_OS_OPENBSD)\n\t# define YUNI_CPU_COUNT_HAS_IMPLEMENTATION\n\tuint Count()\n\t{\n\t\tint count;\n\t\tsize_t size = sizeof(count);\n\n\t\tif (sysctlbyname(\"hw.ncpu\", &count, &size, NULL, 0))\n\t\t\treturn 1;\n\t\treturn (count <= 0) ? 1 : (uint) count;\n\t}\n\t#endif\n\n\n\t#ifdef YUNI_OS_WINDOWS\n\t# define YUNI_CPU_COUNT_HAS_IMPLEMENTATION\n\tuint Count()\n\t{\n\t\tSYSTEM_INFO si;\n\t\tGetSystemInfo(&si);\n\t\treturn si.dwNumberOfProcessors;\n\t}\n\t#endif\n\n\n\t#if defined(YUNI_OS_LINUX) || defined(YUNI_OS_CYGWIN)\n\t# define YUNI_CPU_COUNT_HAS_IMPLEMENTATION\n\tuint Count()\n\t{\n\t\t\/\/ It seems there's no better way to get this info on Linux systems.\n\t\t\/\/ If somebody can find it without depending on the location of \/proc,\n\t\t\/\/ please patch this function.\n\t\tuint count = 0;\n\t\tstd::ifstream cpuInfo(\"\/proc\/cpuinfo\", std::ifstream::in);\n\t\tstd::string lineBuffer;\n\n\t\tstd::getline(cpuInfo, lineBuffer);\n\t\twhile (cpuInfo.good())\n\t\t{\n\t\t\tif (std::string::npos != lineBuffer.find(\"processor\"))\n\t\t\t\t++count;\n\t\t\tstd::getline(cpuInfo, lineBuffer);\n\t\t}\n\t\tcpuInfo.close();\n\n\t\treturn (0 == count ? 1 : count);\n\t}\n\t#endif\n\n\n\n\n\t#ifndef YUNI_CPU_COUNT_HAS_IMPLEMENTATION\n\t#  warning \"The method Yuni::System::CPU::Count() has not been implemented for the current platform\"\n\tuint Count()\n\t{\n\t\treturn 1; \/\/ Default value\n\t}\n\t#endif\n\n\n\n\n\n} \/\/ namespace CPU\n} \/\/ namespace System\n} \/\/ namespace Yuni\n\n<commit_msg>System::CPU: cygwin should follow the windows implementation, not the linux one<commit_after>\n#include \"cpu.h\"\n\n#if defined(YUNI_OS_DARWIN) || defined(YUNI_OS_FREEBSD) || defined(YUNI_OS_NETBSD) || defined(YUNI_OS_OPENBSD)\n# include <sys\/param.h>\n# include <sys\/sysctl.h>\n#endif\n#if defined(YUNI_OS_LINUX) || defined(YUNI_OS_CYGWIN)\n# include <fstream>\n# include \"..\/string.h\"\n#endif\n#include \"windows.hdr.h\"\n\n\n\n\nnamespace Yuni\n{\nnamespace System\n{\nnamespace CPU\n{\n\n\n\t#if defined(YUNI_OS_DARWIN) || defined(YUNI_OS_FREEBSD) || defined(YUNI_OS_NETBSD) || defined(YUNI_OS_OPENBSD)\n\t# define YUNI_CPU_COUNT_HAS_IMPLEMENTATION\n\tuint Count()\n\t{\n\t\tint count;\n\t\tsize_t size = sizeof(count);\n\n\t\tif (sysctlbyname(\"hw.ncpu\", &count, &size, NULL, 0))\n\t\t\treturn 1;\n\t\treturn (count <= 0) ? 1 : (uint) count;\n\t}\n\t#endif\n\n\n\t#if defined(YUNI_OS_WINDOWS) || defined(YUNI_OS_CYGWIN)\n\t# define YUNI_CPU_COUNT_HAS_IMPLEMENTATION\n\tuint Count()\n\t{\n\t\tSYSTEM_INFO si;\n\t\tGetSystemInfo(&si);\n\t\treturn si.dwNumberOfProcessors;\n\t}\n\t#endif\n\n\n\t#if defined(YUNI_OS_LINUX)\n\t# define YUNI_CPU_COUNT_HAS_IMPLEMENTATION\n\tuint Count()\n\t{\n\t\t\/\/ It seems there's no better way to get this info on Linux systems.\n\t\t\/\/ If somebody can find it without depending on the location of \/proc,\n\t\t\/\/ please patch this function.\n\t\tuint count = 0;\n\t\tstd::ifstream cpuInfo(\"\/proc\/cpuinfo\", std::ifstream::in);\n\t\tstd::string lineBuffer;\n\n\t\tstd::getline(cpuInfo, lineBuffer);\n\t\twhile (cpuInfo.good())\n\t\t{\n\t\t\tif (std::string::npos != lineBuffer.find(\"processor\"))\n\t\t\t\t++count;\n\t\t\tstd::getline(cpuInfo, lineBuffer);\n\t\t}\n\t\tcpuInfo.close();\n\n\t\treturn (0 == count ? 1 : count);\n\t}\n\t#endif\n\n\n\n\n\t#ifndef YUNI_CPU_COUNT_HAS_IMPLEMENTATION\n\t#  warning \"The method Yuni::System::CPU::Count() has not been implemented for the current platform\"\n\tuint Count()\n\t{\n\t\treturn 1; \/\/ Default value\n\t}\n\t#endif\n\n\n\n\n\n} \/\/ namespace CPU\n} \/\/ namespace System\n} \/\/ namespace Yuni\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 \"value_codec.h\"\n#include \"tensor_spec.h\"\n#include <vespa\/vespalib\/objects\/nbostream.h>\n#include <vespa\/vespalib\/util\/typify.h>\n\nnamespace vespalib::eval {\n\nnamespace {\n\nusing CellType = ValueType::CellType;\nusing IndexList = std::vector<size_t>;\n\nconstexpr uint32_t DOUBLE_CELL_TYPE = 0;\nconstexpr uint32_t FLOAT_CELL_TYPE = 1;\n\ninline uint32_t cell_type_to_id(CellType cell_type) {\n    switch (cell_type) {\n    case CellType::DOUBLE: return DOUBLE_CELL_TYPE;\n    case CellType::FLOAT: return FLOAT_CELL_TYPE;\n    }\n    abort();\n}\n\ninline CellType id_to_cell_type(uint32_t id) {\n    switch (id) {\n    case DOUBLE_CELL_TYPE: return CellType::DOUBLE;\n    case FLOAT_CELL_TYPE: return CellType::FLOAT;\n    }\n    abort();\n}\n\n\/**\n * Meta information about how a type can be decomposed into mapped and\n * indexed dimensions and also how large each block is. A block is a\n * dense-subspace consisting of all indexed dimensions that is\n * uniquely specified by the labels of all mapped dimensions.\n **\/\nstruct TypeMeta {\n    IndexList mapped;\n    IndexList indexed;\n    size_t block_size;\n    CellType cell_type;\n    explicit TypeMeta(const ValueType &type)\n        : mapped(),\n          indexed(),\n          block_size(1),\n          cell_type(type.cell_type())\n    {\n        for (size_t i = 0; i < type.dimensions().size(); ++i) {\n            const auto &dimension = type.dimensions()[i];\n            if (dimension.is_mapped()) {\n                mapped.push_back(i);\n            } else {\n                block_size *= dimension.size;\n                indexed.push_back(i);\n            }\n        }\n    }\n    ~TypeMeta() {}\n};\n\nstruct Format {\n    bool     is_sparse;\n    bool     is_dense;\n    bool     with_cell_type;\n    uint32_t tag;\n    explicit Format(const TypeMeta &meta)\n        : is_sparse(meta.mapped.size() > 0),\n          is_dense((meta.indexed.size() > 0) || !is_sparse),\n          with_cell_type(meta.cell_type != CellType::DOUBLE),\n          tag((is_sparse ? 0x1 : 0) | (is_dense ? 0x2 : 0) | (with_cell_type ? 0x4 : 0)) {}\n    explicit Format(uint32_t tag_in)\n        : is_sparse((tag_in & 0x1) != 0),\n          is_dense((tag_in & 0x2) != 0),\n          with_cell_type((tag_in & 0x4) != 0),\n          tag(tag_in) {}\n    ~Format() {}\n};\n\nvoid maybe_encode_cell_type(nbostream &output, const Format &format, const TypeMeta &meta) {\n    if (format.with_cell_type) {\n        output.putInt1_4Bytes(cell_type_to_id(meta.cell_type));\n    }\n}\n\nvoid encode_type(nbostream &output, const Format &format, const ValueType &type, const TypeMeta &meta) {\n    maybe_encode_cell_type(output, format, meta);\n    if (format.is_sparse) {\n        output.putInt1_4Bytes(meta.mapped.size());\n        for (size_t idx: meta.mapped) {\n            output.writeSmallString(type.dimensions()[idx].name);\n        }\n    }\n    if (format.is_dense) {\n        output.putInt1_4Bytes(meta.indexed.size());\n        for (size_t idx: meta.indexed) {\n            output.writeSmallString(type.dimensions()[idx].name);\n            output.putInt1_4Bytes(type.dimensions()[idx].size);\n        }\n    }\n}\n\nvoid maybe_encode_num_blocks(nbostream &output, const TypeMeta &meta, size_t num_blocks) {\n    if ((meta.mapped.size() > 0)) {\n        output.putInt1_4Bytes(num_blocks);\n    }\n}\n\nCellType maybe_decode_cell_type(nbostream &input, const Format &format) {\n    if (format.with_cell_type) {\n        return id_to_cell_type(input.getInt1_4Bytes());\n    }\n    return CellType::DOUBLE;\n}\n\nValueType decode_type(nbostream &input, const Format &format) {\n    CellType cell_type = maybe_decode_cell_type(input, format);\n    std::vector<ValueType::Dimension> dim_list;\n    if (format.is_sparse) {\n        size_t cnt = input.getInt1_4Bytes();\n        for (size_t i = 0; i < cnt; ++i) {\n            vespalib::string name;\n            input.readSmallString(name);\n            dim_list.emplace_back(name);\n        }\n    }\n    if (format.is_dense) {\n        size_t cnt = input.getInt1_4Bytes();\n        for (size_t i = 0; i < cnt; ++i) {\n            vespalib::string name;\n            input.readSmallString(name);\n            dim_list.emplace_back(name, input.getInt1_4Bytes());\n        }\n    }\n    return ValueType::tensor_type(std::move(dim_list), cell_type);\n}\n\nsize_t maybe_decode_num_blocks(nbostream &input, const TypeMeta &meta, const Format &format) {\n    if ((meta.mapped.size() > 0) || !format.is_dense) {\n        return input.getInt1_4Bytes();\n    }\n    return 1;\n}\n\nvoid encode_mapped_labels(nbostream &output, size_t num_mapped_dims, const std::vector<vespalib::stringref> &addr) {\n    for (size_t i = 0; i < num_mapped_dims; ++i) {\n        output.writeSmallString(addr[i]);\n    }\n}\n\nvoid decode_mapped_labels(nbostream &input, size_t num_mapped_dims, std::vector<vespalib::stringref> &addr) {\n    for (size_t i = 0; i < num_mapped_dims; ++i) {\n        size_t strSize = input.getInt1_4Bytes();\n        addr[i] = vespalib::stringref(input.peek(), strSize);\n        input.adjustReadPos(strSize);\n    }\n}\n\n\ntemplate<typename T>\nvoid decode_cells(nbostream &input, size_t num_cells, ArrayRef<T> dst)\n{\n    T value;\n    for (size_t i = 0; i < num_cells; ++i) {\n        input >> value;\n        dst[i] = value;\n    }\n}\n\nstruct DecodeState {\n    const ValueType &type;\n    const size_t block_size;\n    const size_t num_blocks;\n    const size_t num_mapped_dims;\n};\n\nstruct ContentDecoder {\n    template<typename T>\n    static std::unique_ptr<Value> invoke(nbostream &input, const DecodeState &state, const ValueBuilderFactory &factory) {\n        std::vector<vespalib::stringref> address(state.num_mapped_dims);\n        auto builder = factory.create_value_builder<T>(state.type, state.num_mapped_dims, state.block_size, state.num_blocks);\n        for (size_t i = 0; i < state.num_blocks; ++i) {\n            decode_mapped_labels(input, state.num_mapped_dims, address);\n            auto block_cells = builder->add_subspace(address);\n            decode_cells(input, state.block_size, block_cells);\n        }\n        return builder->build(std::move(builder));\n    }\n};\n\nstruct CreateValueFromTensorSpec {\n    template <typename T> static std::unique_ptr<Value> invoke(const ValueType &type, const TensorSpec &spec, const ValueBuilderFactory &factory) {\n        using SparseKey = std::vector<vespalib::stringref>;\n        using DenseMap = std::map<size_t,T>;\n        std::map<SparseKey,DenseMap> map;\n        for (const auto &entry: spec.cells()) {\n            SparseKey sparse_key;\n            size_t dense_key = 0;\n            for (const auto &dim: type.dimensions()) {\n                auto pos = entry.first.find(dim.name);\n                assert(pos != entry.first.end());\n                assert(pos->second.is_mapped() == dim.is_mapped());\n                if (dim.is_mapped()) {\n                    sparse_key.emplace_back(pos->second.name);\n                } else {\n                    dense_key = (dense_key * dim.size) + pos->second.index;\n                }\n            }\n            map[sparse_key][dense_key] = entry.second;\n        }\n        \/\/ if spec is missing the required dense space, add it here:\n        if (map.empty() && type.count_mapped_dimensions() == 0) {\n            map[{}][0] = 0;\n        }\n        auto builder = factory.create_value_builder<T>(type, type.count_mapped_dimensions(), type.dense_subspace_size(), map.size());\n        for (const auto &entry: map) {\n            auto subspace = builder->add_subspace(entry.first);\n            for (const auto &cell: entry.second) {\n                subspace[cell.first] = cell.second;\n            }\n        }\n        return builder->build(std::move(builder));\n    }\n};\n\nstruct CreateTensorSpecFromValue {\n    template <typename T> static TensorSpec invoke(const Value &value) {\n        auto cells = value.cells().typify<T>();\n        TensorSpec spec(value.type().to_spec());\n        size_t subspace_id = 0;\n        size_t subspace_size = value.type().dense_subspace_size();\n        std::vector<vespalib::stringref> labels(value.type().count_mapped_dimensions());\n        std::vector<vespalib::stringref*> label_refs;\n        for (auto &label: labels) {\n            label_refs.push_back(&label);\n        }\n        auto view = value.index().create_view({});\n        view->lookup({});\n        while (view->next_result(label_refs, subspace_id)) {\n            size_t label_idx = 0;\n            TensorSpec::Address addr;\n            for (const auto &dim: value.type().dimensions()) {\n                if (dim.is_mapped()) {\n                    addr.emplace(dim.name, labels[label_idx++]);\n                }\n            }\n            for (size_t i = 0; i < subspace_size; ++i) {\n                size_t dense_key = i;\n                for (auto dim = value.type().dimensions().rbegin();\n                     dim != value.type().dimensions().rend(); ++dim)\n                {\n                    if (dim->is_indexed()) {\n                        size_t label = dense_key % dim->size;\n                        addr.emplace(dim->name, label).first->second = TensorSpec::Label(label);\n                        dense_key \/= dim->size;\n                    }\n                }\n                spec.add(addr, cells[(subspace_size * subspace_id) + i]);\n            }\n        }\n        return spec;\n    }\n};\n\n} \/\/ namespace <unnamed>\n\nvoid new_encode(const Value &value, nbostream &output) {\n    TypeMeta meta(value.type());\n    Format format(meta);\n    output.putInt1_4Bytes(format.tag);\n    encode_type(output, format, value.type(), meta);\n    maybe_encode_num_blocks(output, meta, value.cells().size \/ meta.block_size);\n    std::vector<vespalib::stringref> address(meta.mapped.size());\n    std::vector<vespalib::stringref*> a_refs(meta.mapped.size());\n    for (size_t i = 0; i < meta.mapped.size(); ++i) {\n        a_refs[i] = &address[i];\n    }\n    auto view = value.index().create_view({});\n    view->lookup({});\n    size_t subspace;\n    while (view->next_result(a_refs, subspace)) {\n        encode_mapped_labels(output, meta.mapped.size(), address);\n        if (meta.cell_type == CellType::FLOAT) {\n            auto iter = value.cells().typify<float>().begin();\n            iter += (subspace * meta.block_size);\n            for (size_t i = 0; i < meta.block_size; ++i) {\n                output << (float) *iter++;\n            }\n        } else {\n            auto iter = value.cells().typify<double>().begin();\n            iter += (subspace * meta.block_size);\n            for (size_t i = 0; i < meta.block_size; ++i) {\n                output << *iter++;\n            }\n        }\n    }\n}\n\nstd::unique_ptr<Value> new_decode(nbostream &input, const ValueBuilderFactory &factory) {\n    Format format(input.getInt1_4Bytes());\n    ValueType type = decode_type(input, format);\n    TypeMeta meta(type);\n    const size_t num_blocks = maybe_decode_num_blocks(input, meta, format);\n    DecodeState state{type, meta.block_size, num_blocks, meta.mapped.size()};\n    return typify_invoke<1,TypifyCellType,ContentDecoder>(meta.cell_type, input, state, factory);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nstd::unique_ptr<Value> value_from_spec(const TensorSpec &spec, const ValueBuilderFactory &factory) {\n    ValueType type = ValueType::from_spec(spec.type());\n    assert(!type.is_error());\n    return typify_invoke<1,TypifyCellType,CreateValueFromTensorSpec>(type.cell_type(), type, spec, factory);\n}\n\nTensorSpec spec_from_value(const Value &value) {\n    return typify_invoke<1,TypifyCellType,CreateTensorSpecFromValue>(value.type().cell_type(), value);\n}\n\n\/\/-----------------------------------------------------------------------------\n\n\n} \/\/ namespace\n<commit_msg>simplify value_codec some<commit_after>\/\/ Copyright Verizon Media. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"value_codec.h\"\n#include \"tensor_spec.h\"\n#include <vespa\/vespalib\/objects\/nbostream.h>\n#include <vespa\/vespalib\/util\/typify.h>\n\nnamespace vespalib::eval {\n\nnamespace {\n\nusing CellType = ValueType::CellType;\nusing IndexList = std::vector<size_t>;\n\nconstexpr uint32_t DOUBLE_CELL_TYPE = 0;\nconstexpr uint32_t FLOAT_CELL_TYPE = 1;\n\ninline uint32_t cell_type_to_id(CellType cell_type) {\n    switch (cell_type) {\n    case CellType::DOUBLE: return DOUBLE_CELL_TYPE;\n    case CellType::FLOAT: return FLOAT_CELL_TYPE;\n    }\n    abort();\n}\n\ninline CellType id_to_cell_type(uint32_t id) {\n    switch (id) {\n    case DOUBLE_CELL_TYPE: return CellType::DOUBLE;\n    case FLOAT_CELL_TYPE: return CellType::FLOAT;\n    }\n    abort();\n}\n\n\/**\n * Meta information about how a type can be decomposed into mapped and\n * indexed dimensions and also how large each block is. A block is a\n * dense-subspace consisting of all indexed dimensions that is\n * uniquely specified by the labels of all mapped dimensions.\n **\/\nstruct TypeMeta {\n    IndexList mapped;\n    IndexList indexed;\n    CellType cell_type;\n    explicit TypeMeta(const ValueType &type)\n        : mapped(),\n          indexed(),\n          cell_type(type.cell_type())\n    {\n        for (size_t i = 0; i < type.dimensions().size(); ++i) {\n            const auto &dimension = type.dimensions()[i];\n            if (dimension.is_mapped()) {\n                mapped.push_back(i);\n            } else {\n                indexed.push_back(i);\n            }\n        }\n    }\n    ~TypeMeta() {}\n};\n\nstruct Format {\n    bool     is_sparse;\n    bool     is_dense;\n    bool     with_cell_type;\n    uint32_t tag;\n    explicit Format(const TypeMeta &meta)\n        : is_sparse(meta.mapped.size() > 0),\n          is_dense((meta.indexed.size() > 0) || !is_sparse),\n          with_cell_type(meta.cell_type != CellType::DOUBLE),\n          tag((is_sparse ? 0x1 : 0) | (is_dense ? 0x2 : 0) | (with_cell_type ? 0x4 : 0)) {}\n    explicit Format(uint32_t tag_in)\n        : is_sparse((tag_in & 0x1) != 0),\n          is_dense((tag_in & 0x2) != 0),\n          with_cell_type((tag_in & 0x4) != 0),\n          tag(tag_in) {}\n    ~Format() {}\n};\n\nvoid maybe_encode_cell_type(nbostream &output, const Format &format, const TypeMeta &meta) {\n    if (format.with_cell_type) {\n        output.putInt1_4Bytes(cell_type_to_id(meta.cell_type));\n    }\n}\n\nvoid encode_type(nbostream &output, const Format &format, const ValueType &type, const TypeMeta &meta) {\n    maybe_encode_cell_type(output, format, meta);\n    if (format.is_sparse) {\n        output.putInt1_4Bytes(type.count_mapped_dimensions());\n        for (size_t idx: meta.mapped) {\n            output.writeSmallString(type.dimensions()[idx].name);\n        }\n    }\n    if (format.is_dense) {\n        output.putInt1_4Bytes(meta.indexed.size());\n        for (size_t idx: meta.indexed) {\n            output.writeSmallString(type.dimensions()[idx].name);\n            output.putInt1_4Bytes(type.dimensions()[idx].size);\n        }\n    }\n}\n\nvoid maybe_encode_num_blocks(nbostream &output, bool has_mapped_dims, size_t num_blocks) {\n    if (has_mapped_dims) {\n        output.putInt1_4Bytes(num_blocks);\n    }\n}\n\nCellType maybe_decode_cell_type(nbostream &input, const Format &format) {\n    if (format.with_cell_type) {\n        return id_to_cell_type(input.getInt1_4Bytes());\n    }\n    return CellType::DOUBLE;\n}\n\nValueType decode_type(nbostream &input, const Format &format) {\n    CellType cell_type = maybe_decode_cell_type(input, format);\n    std::vector<ValueType::Dimension> dim_list;\n    if (format.is_sparse) {\n        size_t cnt = input.getInt1_4Bytes();\n        for (size_t i = 0; i < cnt; ++i) {\n            vespalib::string name;\n            input.readSmallString(name);\n            dim_list.emplace_back(name);\n        }\n    }\n    if (format.is_dense) {\n        size_t cnt = input.getInt1_4Bytes();\n        for (size_t i = 0; i < cnt; ++i) {\n            vespalib::string name;\n            input.readSmallString(name);\n            dim_list.emplace_back(name, input.getInt1_4Bytes());\n        }\n    }\n    return ValueType::tensor_type(std::move(dim_list), cell_type);\n}\n\nsize_t maybe_decode_num_blocks(nbostream &input, bool has_mapped_dims, const Format &format) {\n    if (has_mapped_dims || !format.is_dense) {\n        return input.getInt1_4Bytes();\n    }\n    return 1;\n}\n\nvoid encode_mapped_labels(nbostream &output, size_t num_mapped_dims, const std::vector<vespalib::stringref> &addr) {\n    for (size_t i = 0; i < num_mapped_dims; ++i) {\n        output.writeSmallString(addr[i]);\n    }\n}\n\nvoid decode_mapped_labels(nbostream &input, size_t num_mapped_dims, std::vector<vespalib::stringref> &addr) {\n    for (size_t i = 0; i < num_mapped_dims; ++i) {\n        size_t strSize = input.getInt1_4Bytes();\n        addr[i] = vespalib::stringref(input.peek(), strSize);\n        input.adjustReadPos(strSize);\n    }\n}\n\n\ntemplate<typename T>\nvoid decode_cells(nbostream &input, size_t num_cells, ArrayRef<T> dst)\n{\n    T value;\n    for (size_t i = 0; i < num_cells; ++i) {\n        input >> value;\n        dst[i] = value;\n    }\n}\n\nstruct DecodeState {\n    const ValueType &type;\n    const size_t subspace_size;\n    const size_t num_blocks;\n    const size_t num_mapped_dims;\n};\n\nstruct ContentDecoder {\n    template<typename T>\n    static std::unique_ptr<Value> invoke(nbostream &input, const DecodeState &state, const ValueBuilderFactory &factory) {\n        std::vector<vespalib::stringref> address(state.num_mapped_dims);\n        auto builder = factory.create_value_builder<T>(state.type, state.num_mapped_dims, state.subspace_size, state.num_blocks);\n        for (size_t i = 0; i < state.num_blocks; ++i) {\n            decode_mapped_labels(input, state.num_mapped_dims, address);\n            auto block_cells = builder->add_subspace(address);\n            decode_cells(input, state.subspace_size, block_cells);\n        }\n        return builder->build(std::move(builder));\n    }\n};\n\nstruct CreateValueFromTensorSpec {\n    template <typename T> static std::unique_ptr<Value> invoke(const ValueType &type, const TensorSpec &spec, const ValueBuilderFactory &factory) {\n        using SparseKey = std::vector<vespalib::stringref>;\n        using DenseMap = std::map<size_t,T>;\n        std::map<SparseKey,DenseMap> map;\n        for (const auto &entry: spec.cells()) {\n            SparseKey sparse_key;\n            size_t dense_key = 0;\n            for (const auto &dim: type.dimensions()) {\n                auto pos = entry.first.find(dim.name);\n                assert(pos != entry.first.end());\n                assert(pos->second.is_mapped() == dim.is_mapped());\n                if (dim.is_mapped()) {\n                    sparse_key.emplace_back(pos->second.name);\n                } else {\n                    dense_key = (dense_key * dim.size) + pos->second.index;\n                }\n            }\n            map[sparse_key][dense_key] = entry.second;\n        }\n        \/\/ if spec is missing the required dense space, add it here:\n        if (map.empty() && type.count_mapped_dimensions() == 0) {\n            map[{}][0] = 0;\n        }\n        auto builder = factory.create_value_builder<T>(type, type.count_mapped_dimensions(), type.dense_subspace_size(), map.size());\n        for (const auto &entry: map) {\n            auto subspace = builder->add_subspace(entry.first);\n            for (const auto &cell: entry.second) {\n                subspace[cell.first] = cell.second;\n            }\n        }\n        return builder->build(std::move(builder));\n    }\n};\n\nstruct CreateTensorSpecFromValue {\n    template <typename T> static TensorSpec invoke(const Value &value) {\n        auto cells = value.cells().typify<T>();\n        TensorSpec spec(value.type().to_spec());\n        size_t subspace_id = 0;\n        size_t subspace_size = value.type().dense_subspace_size();\n        std::vector<vespalib::stringref> labels(value.type().count_mapped_dimensions());\n        std::vector<vespalib::stringref*> label_refs;\n        for (auto &label: labels) {\n            label_refs.push_back(&label);\n        }\n        auto view = value.index().create_view({});\n        view->lookup({});\n        while (view->next_result(label_refs, subspace_id)) {\n            size_t label_idx = 0;\n            TensorSpec::Address addr;\n            for (const auto &dim: value.type().dimensions()) {\n                if (dim.is_mapped()) {\n                    addr.emplace(dim.name, labels[label_idx++]);\n                }\n            }\n            for (size_t i = 0; i < subspace_size; ++i) {\n                size_t dense_key = i;\n                for (auto dim = value.type().dimensions().rbegin();\n                     dim != value.type().dimensions().rend(); ++dim)\n                {\n                    if (dim->is_indexed()) {\n                        size_t label = dense_key % dim->size;\n                        addr.emplace(dim->name, label).first->second = TensorSpec::Label(label);\n                        dense_key \/= dim->size;\n                    }\n                }\n                spec.add(addr, cells[(subspace_size * subspace_id) + i]);\n            }\n        }\n        return spec;\n    }\n};\n\n} \/\/ namespace <unnamed>\n\nvoid new_encode(const Value &value, nbostream &output) {\n    TypeMeta meta(value.type());\n    size_t num_mapped_dims = value.type().count_mapped_dimensions();\n    size_t dense_subspace_size = value.type().dense_subspace_size();\n    Format format(meta);\n    output.putInt1_4Bytes(format.tag);\n    encode_type(output, format, value.type(), meta);\n    maybe_encode_num_blocks(output, (num_mapped_dims > 0), value.cells().size \/ dense_subspace_size);\n    std::vector<vespalib::stringref> address(num_mapped_dims);\n    std::vector<vespalib::stringref*> a_refs(num_mapped_dims);\n    for (size_t i = 0; i < num_mapped_dims; ++i) {\n        a_refs[i] = &address[i];\n    }\n    auto view = value.index().create_view({});\n    view->lookup({});\n    size_t subspace;\n    while (view->next_result(a_refs, subspace)) {\n        encode_mapped_labels(output, num_mapped_dims, address);\n        if (meta.cell_type == CellType::FLOAT) {\n            auto iter = value.cells().typify<float>().begin();\n            iter += (subspace * dense_subspace_size);\n            for (size_t i = 0; i < dense_subspace_size; ++i) {\n                output << (float) *iter++;\n            }\n        } else {\n            auto iter = value.cells().typify<double>().begin();\n            iter += (subspace * dense_subspace_size);\n            for (size_t i = 0; i < dense_subspace_size; ++i) {\n                output << *iter++;\n            }\n        }\n    }\n}\n\nstd::unique_ptr<Value> new_decode(nbostream &input, const ValueBuilderFactory &factory) {\n    Format format(input.getInt1_4Bytes());\n    ValueType type = decode_type(input, format);\n    size_t num_mapped_dims = type.count_mapped_dimensions();\n    size_t dense_subspace_size = type.dense_subspace_size();\n    TypeMeta meta(type);\n    const size_t num_blocks = maybe_decode_num_blocks(input, (num_mapped_dims > 0), format);\n    DecodeState state{type, dense_subspace_size, num_blocks, num_mapped_dims};\n    return typify_invoke<1,TypifyCellType,ContentDecoder>(meta.cell_type, input, state, factory);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nstd::unique_ptr<Value> value_from_spec(const TensorSpec &spec, const ValueBuilderFactory &factory) {\n    ValueType type = ValueType::from_spec(spec.type());\n    assert(!type.is_error());\n    return typify_invoke<1,TypifyCellType,CreateValueFromTensorSpec>(type.cell_type(), type, spec, factory);\n}\n\nTensorSpec spec_from_value(const Value &value) {\n    return typify_invoke<1,TypifyCellType,CreateTensorSpecFromValue>(value.type().cell_type(), value);\n}\n\n\/\/-----------------------------------------------------------------------------\n\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>#ifndef AZIMUTH_ROTARY_HPP_INCLUDED\r\n#define AZIMUTH_ROTARY_HPP_INCLUDED\r\n\r\n\/**\r\n @file azimuth_rotary.hpp\r\n @author François Becker\r\n\r\nMIT License\r\n\r\nCopyright (c) 2017 François Becker\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 all\r\ncopies 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 THE\r\nSOFTWARE.\r\n*\/\r\n\r\n#include \"JuceHeader.h\"\r\n\r\n#include \"math_float_constants.hpp\"\r\n\r\n\/**\r\n @class AzimuthRotary\r\n A Juce rotary encoder that loops between 180° and -180° and uses the\r\n trigonometric convention: positive left.\r\n *\/\r\nclass AzimuthRotary\r\n: public Slider\r\n{\r\npublic:\r\n    AzimuthRotary (const String& componentName)\r\n    : Slider (componentName)\r\n    {\r\n        setDoubleClickReturnValue(true, 0.f);\r\n        setSliderStyle (Slider::Rotary); \/\/ TODO: support Slider::RotaryHorizontalVerticalDrag;\r\n        setRotaryParameters({M_PIf, 3.f * M_PIf, false});\r\n    }\r\n    double proportionOfLengthToValue (double proportion) override\r\n    {\r\n        return 1.0 - Slider::proportionOfLengthToValue(proportion);\r\n    }\r\n    double valueToProportionOfLength (double value) override\r\n    {\r\n        return 1.0 - Slider::valueToProportionOfLength(value);\r\n    }\r\n};\r\n\r\n#endif\r\n<commit_msg>Solved a potential compiler warning in AzimuthRotary<commit_after>#ifndef AZIMUTH_ROTARY_HPP_INCLUDED\r\n#define AZIMUTH_ROTARY_HPP_INCLUDED\r\n\r\n\/**\r\n @file azimuth_rotary.hpp\r\n @author François Becker\r\n\r\nMIT License\r\n\r\nCopyright (c) 2017 François Becker\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 all\r\ncopies 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 THE\r\nSOFTWARE.\r\n*\/\r\n\r\n#include \"JuceHeader.h\"\r\n\r\n#include \"math_float_constants.hpp\"\r\n\r\n\/**\r\n @class AzimuthRotary\r\n A Juce rotary encoder that loops between 180° and -180° and uses the\r\n trigonometric convention: positive left.\r\n *\/\r\nclass AzimuthRotary\r\n: public Slider\r\n{\r\npublic:\r\n    AzimuthRotary (const String& componentName)\r\n    : Slider (componentName)\r\n    {\r\n        setDoubleClickReturnValue(true, 0.);\r\n        setSliderStyle (Slider::Rotary); \/\/ TODO: support Slider::RotaryHorizontalVerticalDrag;\r\n        setRotaryParameters({M_PIf, 3.f * M_PIf, false});\r\n    }\r\n    double proportionOfLengthToValue (double proportion) override\r\n    {\r\n        return 1.0 - Slider::proportionOfLengthToValue(proportion);\r\n    }\r\n    double valueToProportionOfLength (double value) override\r\n    {\r\n        return 1.0 - Slider::valueToProportionOfLength(value);\r\n    }\r\n};\r\n\r\n#endif\r\n<|endoftext|>"}
{"text":"<commit_before>#include <stdexcept>\n#include <fstream>\n#include <xorg\/gtest\/xorg-gtest.h>\n\n#include <X11\/extensions\/XInput.h>\n#include <X11\/extensions\/XInput2.h>\n\n#include \"input-driver-test.h\"\n\nvoid InputDriverTest::StartServer() {\n    server.Start();\n    server.WaitForConnections();\n    xorg::testing::Test::SetDisplayString(server.GetDisplayString());\n\n    ASSERT_NO_FATAL_FAILURE(xorg::testing::Test::SetUp());\n\n    int event_start;\n    int error_start;\n\n    ASSERT_TRUE(XQueryExtension(Display(), \"XInputExtension\", &xi2_opcode,\n                &event_start, &error_start));\n\n    int major = 2;\n    int minor = 0;\n\n    ASSERT_EQ(Success, XIQueryVersion(Display(), &major, &minor));\n}\n\nvoid InputDriverTest::SetUpConfigAndLog(const std::string& param) {\n    std::stringstream s;\n    s << \"\/tmp\/Xorg-\" << param << \".log\";\n    server.SetOption(\"-logfile\", s.str());\n\n    s.str(std::string());\n    s << \"\/tmp\/\" << param << \".conf\";\n    config.SetPath(s.str());\n\n    config.AddDefaultScreenWithDriver();\n    config.AddInputSection(param);\n    config.WriteConfig();\n    server.SetOption(\"-config\", config.GetPath());\n}\n\nvoid InputDriverTest::SetUpEventListener() {\n    failed = false;\n\n    testing::TestEventListeners &listeners = ::testing::UnitTest::GetInstance()->listeners();\n    listeners.Append(this);\n}\n\nvoid InputDriverTest::SetUp() {\n    SetUp(\"\");\n}\n\nvoid InputDriverTest::SetUp(const std::string &param) {\n    SetUpEventListener();\n    SetUpConfigAndLog(param);\n    StartServer();\n}\n\nvoid InputDriverTest::TearDown() {\n    if (server.Pid() != -1)\n        if (!server.Terminate(3000))\n            server.Kill(3000);\n\n    if (!Failed()) {\n        config.RemoveConfig();\n        server.RemoveLogFile();\n    }\n\n    testing::TestEventListeners &listeners = ::testing::UnitTest::GetInstance()->listeners();\n    listeners.Release(this);\n}\n\nvoid InputDriverTest::OnTestPartResult(const ::testing::TestPartResult &test_part_result) {\n    failed = test_part_result.failed();\n}\n\nbool InputDriverTest::Failed() {\n    return failed;\n}\n<commit_msg>The default devices should have Option CorePointer on<commit_after>#include <stdexcept>\n#include <fstream>\n#include <xorg\/gtest\/xorg-gtest.h>\n\n#include <X11\/extensions\/XInput.h>\n#include <X11\/extensions\/XInput2.h>\n\n#include \"input-driver-test.h\"\n\nvoid InputDriverTest::StartServer() {\n    server.Start();\n    server.WaitForConnections();\n    xorg::testing::Test::SetDisplayString(server.GetDisplayString());\n\n    ASSERT_NO_FATAL_FAILURE(xorg::testing::Test::SetUp());\n\n    int event_start;\n    int error_start;\n\n    ASSERT_TRUE(XQueryExtension(Display(), \"XInputExtension\", &xi2_opcode,\n                &event_start, &error_start));\n\n    int major = 2;\n    int minor = 0;\n\n    ASSERT_EQ(Success, XIQueryVersion(Display(), &major, &minor));\n}\n\nvoid InputDriverTest::SetUpConfigAndLog(const std::string& param) {\n    std::stringstream s;\n    s << \"\/tmp\/Xorg-\" << param << \".log\";\n    server.SetOption(\"-logfile\", s.str());\n\n    s.str(std::string());\n    s << \"\/tmp\/\" << param << \".conf\";\n    config.SetPath(s.str());\n\n    config.AddDefaultScreenWithDriver();\n    config.AddInputSection(param, \"--device--\", \"Option \\\"CorePointer\\\" \\\"on\\\"\\n\");\n    config.WriteConfig();\n    server.SetOption(\"-config\", config.GetPath());\n}\n\nvoid InputDriverTest::SetUpEventListener() {\n    failed = false;\n\n    testing::TestEventListeners &listeners = ::testing::UnitTest::GetInstance()->listeners();\n    listeners.Append(this);\n}\n\nvoid InputDriverTest::SetUp() {\n    SetUp(\"\");\n}\n\nvoid InputDriverTest::SetUp(const std::string &param) {\n    SetUpEventListener();\n    SetUpConfigAndLog(param);\n    StartServer();\n}\n\nvoid InputDriverTest::TearDown() {\n    if (server.Pid() != -1)\n        if (!server.Terminate(3000))\n            server.Kill(3000);\n\n    if (!Failed()) {\n        config.RemoveConfig();\n        server.RemoveLogFile();\n    }\n\n    testing::TestEventListeners &listeners = ::testing::UnitTest::GetInstance()->listeners();\n    listeners.Release(this);\n}\n\nvoid InputDriverTest::OnTestPartResult(const ::testing::TestPartResult &test_part_result) {\n    failed = test_part_result.failed();\n}\n\nbool InputDriverTest::Failed() {\n    return failed;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#pragma once\n\n#include <cstdlib>\n#include <string>\n\nnamespace principia {\nnamespace base {\n\n#define STRINGIFY(X) #X\n#define STRINGIFY_EXPANSION(X) STRINGIFY(X)\n\n\/\/ See http:\/\/goo.gl\/2EVxN4 for a partial overview of compiler detection and\n\/\/ version macros.  We cannot use |COMPILER_MSVC| because it conflicts with\n\/\/ a macro in the benchmark library, so the macros have obnoxiously long names.\n\/\/ TODO(phl): See whether that |COMPILER_MSVC| macro can be removed from port.h.\n#if defined(_MSC_VER) && defined(__clang__)\n#define PRINCIPIA_COMPILER_CLANG_CL 1\nchar const* const CompilerName = \"Clang-cl\";\nchar const* const CompilerVersion = __VERSION__;\n#elif defined(__clang__)\n#define PRINCIPIA_COMPILER_CLANG 1\nchar const* const CompilerName = \"Clang\";\nchar const* const CompilerVersion = __VERSION__;\n#elif defined(_MSC_VER)\n#define PRINCIPIA_COMPILER_MSVC 1\nchar const* const CompilerName = \"Microsoft Visual C++\";\nchar const* const CompilerVersion = STRINGIFY_EXPANSION(_MSC_FULL_VER);\n#elif defined(__ICC) || defined(__INTEL_COMPILER)\n#define PRINCIPIA_COMPILER_ICC 1\nchar const* const CompilerName = \"Intel C++ Compiler\";\nchar const* const CompilerVersion = __VERSION__;\n#elif defined(__GNUC__)\n#define PRINCIPIA_COMPILER_GCC 1\nchar const* const CompilerName = \"G++\";\nchar const* const CompilerVersion = __VERSION__;\n#else\n#error \"What is this, Borland C++?\"\n#endif\n\n#if defined(__APPLE__)\n#define OS_MACOSX 1\nchar const* const OperatingSystem = \"OS X\";\n#elif defined(__linux__)\n#define OS_LINUX 1\nchar const* const OperatingSystem = \"Linux\";\n#elif defined(__FreeBSD__)\n#define OS_FREEBSD 1\nchar const* const OperatingSystem = \"FreeBSD\";\n#elif defined(_WIN32)\n#define OS_WIN 1\nchar const* const OperatingSystem = \"Windows\";\n#else\n#error \"Try OS\/360.\"\n#endif\n\n#if defined(__i386) || defined(_M_IX86)\n#define ARCH_CPU_X86_FAMILY 1\n#define ARCH_CPU_X86 1\n#define ARCH_CPU_32_BITS 1\n#define ARCH_CPU_LITTLE_ENDIAN 1\nchar const* const Architecture = \"x86\";\n#elif defined(_M_X64) || defined(__x86_64__)\n#define ARCH_CPU_X86_FAMILY 1\n#define ARCH_CPU_X86_64 1\n#define ARCH_CPU_64_BITS 1\n#define ARCH_CPU_LITTLE_ENDIAN 1\nchar const* const Architecture = \"x86-64\";\n#else\n#error \"Have you tried a Cray-1?\"\n#endif\n\n#if defined(CDECL)\n#  error \"CDECL already defined\"\n#else\n\/\/ Architecture macros from http:\/\/goo.gl\/ZypnO8.\n\/\/ We use cdecl on x86, the calling convention is unambiguous on x86-64.\n#  if ARCH_CPU_X86\n#    if PRINCIPIA_COMPILER_CLANG ||  \\\n        PRINCIPIA_COMPILER_MSVC ||   \\\n        PRINCIPIA_COMPILER_CLANG_CL\n#      define CDECL __cdecl\n#    elif PRINCIPIA_COMPILER_ICC || PRINCIPIA_COMPILER_GCC\n#      define CDECL __attribute__((cdecl))\n#    else\n#      error \"Get a real compiler!\"\n#    endif\n#  elif ARCH_CPU_X86_64\n#    define CDECL\n#  else\n#    error \"Have you tried a Cray-1?\"\n#  endif\n#endif\n\n\/\/ DLL-exported functions for interfacing with Platform Invocation Services.\n#if defined(PRINCIPIA_DLL)\n#  error \"PRINCIPIA_DLL already defined\"\n#else\n#  if OS_WIN\n#    if PRINCIPIA_DLL_IMPORT\n#      define PRINCIPIA_DLL __declspec(dllimport)\n#    else\n#      define PRINCIPIA_DLL __declspec(dllexport)\n#    endif\n#  else\n#    define PRINCIPIA_DLL __attribute__((visibility(\"default\")))\n#  endif\n#endif\n\n\/\/ DLL-exported functions for isolated physics optimization.\n#if defined(PHYSICS_DLL)\n#  error \"PHYSICS_DLL already defined\"\n#else\n#  if OS_WIN\n#    if PHYSICS_DLL_IMPORT\n#      define PHYSICS_DLL __declspec(dllimport)\n#      define PHYSICS_DLL_TEMPLATE_CLASS extern template class PHYSICS_DLL\n#    else\n#      define PHYSICS_DLL __declspec(dllexport)\n#      define PHYSICS_DLL_TEMPLATE_CLASS template class PHYSICS_DLL\n#    endif\n#  else\n#    define PHYSICS_DLL __attribute__((visibility(\"default\")))\n     \/\/ No isolated physics library on Linux or Macintosh at the moment.\n#    define PHYSICS_DLL_TEMPLATE_CLASS template class PHYSICS_DLL\n#  endif\n#endif\n\n\/\/ A function for use on control paths that don't return a value, typically\n\/\/ because they end with a |LOG(FATAL)|.\n#if PRINCIPIA_COMPILER_CLANG || PRINCIPIA_COMPILER_CLANG_CL\n[[noreturn]]\n#elif PRINCIPIA_COMPILER_MSVC\n__declspec(noreturn)\n#elif PRINCIPIA_COMPILER_ICC\n__attribute__((noreturn))\n#else\n#error \"What compiler is this?\"\n#endif\ninline void noreturn() { std::exit(0); }\n\n\/\/ Used to force inlining.\n#if PRINCIPIA_COMPILER_CLANG    ||  \\\n    PRINCIPIA_COMPILER_CLANG_CL ||  \\\n    PRINCIPIA_COMPILER_GCC\n#  define FORCE_INLINE(specifiers) [[gnu::always_inline]] specifiers \/\/ NOLINT\n#elif PRINCIPIA_COMPILER_MSVC\n#  define FORCE_INLINE(specifiers) specifiers __forceinline\n#elif PRINCIPIA_COMPILER_ICC\n#  define FORCE_INLINE(specifiers) __attribute__((always_inline))\n#else\n#  error \"What compiler is this?\"\n#endif\n\n\/\/ Used to emit the function signature.\n#if PRINCIPIA_COMPILER_CLANG    ||  \\\n    PRINCIPIA_COMPILER_CLANG_CL ||  \\\n    PRINCIPIA_COMPILER_GCC\n#  define FUNCTION_SIGNATURE __PRETTY_FUNCTION__\n#elif PRINCIPIA_COMPILER_MSVC\n#  define FUNCTION_SIGNATURE __FUNCSIG__\n#else\n#  error \"What compiler is this?\"\n#endif\n\n\/\/ We assume that the processor is at least a Prescott since we only support\n\/\/ 64-bit architectures.\n#define PRINCIPIA_USE_SSE3_INTRINSICS !_DEBUG\n\n\/\/ Thread-safety analysis.\n#if PRINCIPIA_COMPILER_CLANG || PRINCIPIA_COMPILER_CLANG_CL\n#  define THREAD_ANNOTATION_ATTRIBUTE__(x) __attribute__((x))\n#  define EXCLUDES(...) \\\n       THREAD_ANNOTATION_ATTRIBUTE__(locks_excluded(__VA_ARGS__))\n#  define GUARDED_BY(...) \\\n       THREAD_ANNOTATION_ATTRIBUTE__(guarded_by(__VA_ARGS__))\n#  define REQUIRES(...) \\\n       THREAD_ANNOTATION_ATTRIBUTE__(requires_capability(__VA_ARGS__))\n#  define REQUIRES_SHARED(...) \\\n       THREAD_ANNOTATION_ATTRIBUTE__(requires_shared_capability(__VA_ARGS__))\n#else\n#  define EXCLUDES(x)\n#  define GUARDED_BY(x)\n#  define REQUIRES(x)\n#  define REQUIRES_SHARED(x)\n#endif\n\n\/\/ Unicode.\n#if OS_WIN\n#  define UNICODE_PATH(x) u ## x\n#else\n#  define UNICODE_PATH(x) u8 ## x\n#endif\n\n\/\/ Mutex.\n#if !OS_MACOSX\n#  define HAS_SHARED_MUTEX 1\n#endif\n\n#define NAMED(expression) #expression << \": \" << (expression)\n\n\/\/ A macro to allow glog checking within C++11 constexpr code.  If |condition|\n\/\/ is true, evaluates to |expression|.  Otherwise, results in a CHECK failure at\n\/\/ runtime and a compilation error due to a call to non-constexpr code at\n\/\/ compile time.\n\/\/ NOTE(egg): in the failure case, the |LOG(FATAL)| is wrapped in a lambda.  The\n\/\/ reason is that |LOG(FATAL)| constructs a |google::LogMessageFatal|, and\n\/\/ |google::LogMessage::Fail()| is called in its destructor.  As a temporary,\n\/\/ the |google::LogMessageFatal| is destroyed as the last step in evaluating the\n\/\/ enclosing full-expression.  If we simply used the comma operator, the entire\n\/\/ ternary |((condition) ? (expression) : (CHECK(condition), (expression)))|\n\/\/ would be part of the enclosing full-expression, so that |expression| would\n\/\/ get evaluated before the |CHECK| failure, possibly triggering all sorts of\n\/\/ terrible UB or other checks (|DateDeathTest| provides a couple of examples).\n\/\/ With the lambda, the full-expression forms the expression statement\n\/\/ |LOG(FATAL) << \"Check failed: \" #condition \" \";|, so that failure occurs\n\/\/ before we return from the lambda's function call operator, and |expression|\n\/\/ is never evaluated.  We do not use |CHECK| because that would require\n\/\/ capture, but this should produce the same output.\n#define CHECKING(condition, expression)                                      \\\n  ((condition) ? (expression)                                                \\\n               : (([] { LOG(FATAL) << \"Check failed: \" #condition \" \"; })(), \\\n                  (expression)))\n\/\/ Needed to circumvent lint warnings in constexpr function where CHECK_LT and\n\/\/ friends cannot be used.\n#define CONSTEXPR_CHECK(condition) CHECK(condition)\n\n\/\/ Clang for some reason doesn't like FP arithmetic that yields infinities in\n\/\/ constexpr code (MSVC and GCC are fine with that).\n#if PRINCIPIA_COMPILER_CLANG || PRINCIPIA_COMPILER_CLANG_CL\n#  define CONSTEXPR_INFINITY const\n#else\n#  define CONSTEXPR_INFINITY constexpr\n#endif\n\n#if PRINCIPIA_COMPILER_MSVC\n#define MSVC_ONLY_TEST(test_name) test_name\n#else\n#define MSVC_ONLY_TEST(test_name) DISABLED_##test_name\n#endif\n\n\/\/ For templates in macro parameters.\n#define TEMPLATE(...) template<__VA_ARGS__>\n\n\/\/ Forward declaration of a class or struct declared in an internal namespace\n\/\/ according to #602.\n\/\/ Usage:\n\/\/ FORWARD_DECLARE_FROM(p1, struct, T);\n\/\/ FORWARD_DECLARE_FROM(p2, TEMPLATE(int i) class, U);\n#define FORWARD_DECLARE_FROM(package_name,           \\\n                             template_and_class_key, \\\n                             declared_name)          \\\nnamespace internal_##package_name {                  \\\ntemplate_and_class_key declared_name;                \\\n}                                                    \\\nusing internal_##package_name::declared_name\n\n}  \/\/ namespace base\n}  \/\/ namespace principia\n<commit_msg>Obsolete macro.<commit_after>\n#pragma once\n\n#include <cstdlib>\n#include <string>\n\nnamespace principia {\nnamespace base {\n\n#define STRINGIFY(X) #X\n#define STRINGIFY_EXPANSION(X) STRINGIFY(X)\n\n\/\/ See http:\/\/goo.gl\/2EVxN4 for a partial overview of compiler detection and\n\/\/ version macros.  We cannot use |COMPILER_MSVC| because it conflicts with\n\/\/ a macro in the benchmark library, so the macros have obnoxiously long names.\n\/\/ TODO(phl): See whether that |COMPILER_MSVC| macro can be removed from port.h.\n#if defined(_MSC_VER) && defined(__clang__)\n#define PRINCIPIA_COMPILER_CLANG_CL 1\nchar const* const CompilerName = \"Clang-cl\";\nchar const* const CompilerVersion = __VERSION__;\n#elif defined(__clang__)\n#define PRINCIPIA_COMPILER_CLANG 1\nchar const* const CompilerName = \"Clang\";\nchar const* const CompilerVersion = __VERSION__;\n#elif defined(_MSC_VER)\n#define PRINCIPIA_COMPILER_MSVC 1\nchar const* const CompilerName = \"Microsoft Visual C++\";\nchar const* const CompilerVersion = STRINGIFY_EXPANSION(_MSC_FULL_VER);\n#elif defined(__ICC) || defined(__INTEL_COMPILER)\n#define PRINCIPIA_COMPILER_ICC 1\nchar const* const CompilerName = \"Intel C++ Compiler\";\nchar const* const CompilerVersion = __VERSION__;\n#elif defined(__GNUC__)\n#define PRINCIPIA_COMPILER_GCC 1\nchar const* const CompilerName = \"G++\";\nchar const* const CompilerVersion = __VERSION__;\n#else\n#error \"What is this, Borland C++?\"\n#endif\n\n#if defined(__APPLE__)\n#define OS_MACOSX 1\nchar const* const OperatingSystem = \"OS X\";\n#elif defined(__linux__)\n#define OS_LINUX 1\nchar const* const OperatingSystem = \"Linux\";\n#elif defined(__FreeBSD__)\n#define OS_FREEBSD 1\nchar const* const OperatingSystem = \"FreeBSD\";\n#elif defined(_WIN32)\n#define OS_WIN 1\nchar const* const OperatingSystem = \"Windows\";\n#else\n#error \"Try OS\/360.\"\n#endif\n\n#if defined(__i386) || defined(_M_IX86)\n#define ARCH_CPU_X86_FAMILY 1\n#define ARCH_CPU_X86 1\n#define ARCH_CPU_32_BITS 1\n#define ARCH_CPU_LITTLE_ENDIAN 1\nchar const* const Architecture = \"x86\";\n#elif defined(_M_X64) || defined(__x86_64__)\n#define ARCH_CPU_X86_FAMILY 1\n#define ARCH_CPU_X86_64 1\n#define ARCH_CPU_64_BITS 1\n#define ARCH_CPU_LITTLE_ENDIAN 1\nchar const* const Architecture = \"x86-64\";\n#else\n#error \"Have you tried a Cray-1?\"\n#endif\n\n#if defined(CDECL)\n#  error \"CDECL already defined\"\n#else\n\/\/ Architecture macros from http:\/\/goo.gl\/ZypnO8.\n\/\/ We use cdecl on x86, the calling convention is unambiguous on x86-64.\n#  if ARCH_CPU_X86\n#    if PRINCIPIA_COMPILER_CLANG ||  \\\n        PRINCIPIA_COMPILER_MSVC ||   \\\n        PRINCIPIA_COMPILER_CLANG_CL\n#      define CDECL __cdecl\n#    elif PRINCIPIA_COMPILER_ICC || PRINCIPIA_COMPILER_GCC\n#      define CDECL __attribute__((cdecl))\n#    else\n#      error \"Get a real compiler!\"\n#    endif\n#  elif ARCH_CPU_X86_64\n#    define CDECL\n#  else\n#    error \"Have you tried a Cray-1?\"\n#  endif\n#endif\n\n\/\/ DLL-exported functions for interfacing with Platform Invocation Services.\n#if defined(PRINCIPIA_DLL)\n#  error \"PRINCIPIA_DLL already defined\"\n#else\n#  if OS_WIN\n#    if PRINCIPIA_DLL_IMPORT\n#      define PRINCIPIA_DLL __declspec(dllimport)\n#    else\n#      define PRINCIPIA_DLL __declspec(dllexport)\n#    endif\n#  else\n#    define PRINCIPIA_DLL __attribute__((visibility(\"default\")))\n#  endif\n#endif\n\n\/\/ DLL-exported functions for isolated physics optimization.\n#if defined(PHYSICS_DLL)\n#  error \"PHYSICS_DLL already defined\"\n#else\n#  if OS_WIN\n#    if PHYSICS_DLL_IMPORT\n#      define PHYSICS_DLL __declspec(dllimport)\n#      define PHYSICS_DLL_TEMPLATE_CLASS extern template class PHYSICS_DLL\n#    else\n#      define PHYSICS_DLL __declspec(dllexport)\n#      define PHYSICS_DLL_TEMPLATE_CLASS template class PHYSICS_DLL\n#    endif\n#  else\n#    define PHYSICS_DLL __attribute__((visibility(\"default\")))\n     \/\/ No isolated physics library on Linux or Macintosh at the moment.\n#    define PHYSICS_DLL_TEMPLATE_CLASS template class PHYSICS_DLL\n#  endif\n#endif\n\n\/\/ A function for use on control paths that don't return a value, typically\n\/\/ because they end with a |LOG(FATAL)|.\n#if PRINCIPIA_COMPILER_CLANG || PRINCIPIA_COMPILER_CLANG_CL\n[[noreturn]]\n#elif PRINCIPIA_COMPILER_MSVC\n__declspec(noreturn)\n#elif PRINCIPIA_COMPILER_ICC\n__attribute__((noreturn))\n#else\n#error \"What compiler is this?\"\n#endif\ninline void noreturn() { std::exit(0); }\n\n\/\/ Used to force inlining.\n#if PRINCIPIA_COMPILER_CLANG    ||  \\\n    PRINCIPIA_COMPILER_CLANG_CL ||  \\\n    PRINCIPIA_COMPILER_GCC\n#  define FORCE_INLINE(specifiers) [[gnu::always_inline]] specifiers \/\/ NOLINT\n#elif PRINCIPIA_COMPILER_MSVC\n#  define FORCE_INLINE(specifiers) specifiers __forceinline\n#elif PRINCIPIA_COMPILER_ICC\n#  define FORCE_INLINE(specifiers) __attribute__((always_inline))\n#else\n#  error \"What compiler is this?\"\n#endif\n\n\/\/ Used to emit the function signature.\n#if PRINCIPIA_COMPILER_CLANG    ||  \\\n    PRINCIPIA_COMPILER_CLANG_CL ||  \\\n    PRINCIPIA_COMPILER_GCC\n#  define FUNCTION_SIGNATURE __PRETTY_FUNCTION__\n#elif PRINCIPIA_COMPILER_MSVC\n#  define FUNCTION_SIGNATURE __FUNCSIG__\n#else\n#  error \"What compiler is this?\"\n#endif\n\n\/\/ We assume that the processor is at least a Prescott since we only support\n\/\/ 64-bit architectures.\n#define PRINCIPIA_USE_SSE3_INTRINSICS !_DEBUG\n\n\/\/ Thread-safety analysis.\n#if PRINCIPIA_COMPILER_CLANG || PRINCIPIA_COMPILER_CLANG_CL\n#  define THREAD_ANNOTATION_ATTRIBUTE__(x) __attribute__((x))\n#  define EXCLUDES(...) \\\n       THREAD_ANNOTATION_ATTRIBUTE__(locks_excluded(__VA_ARGS__))\n#  define GUARDED_BY(...) \\\n       THREAD_ANNOTATION_ATTRIBUTE__(guarded_by(__VA_ARGS__))\n#  define REQUIRES(...) \\\n       THREAD_ANNOTATION_ATTRIBUTE__(requires_capability(__VA_ARGS__))\n#  define REQUIRES_SHARED(...) \\\n       THREAD_ANNOTATION_ATTRIBUTE__(requires_shared_capability(__VA_ARGS__))\n#else\n#  define EXCLUDES(x)\n#  define GUARDED_BY(x)\n#  define REQUIRES(x)\n#  define REQUIRES_SHARED(x)\n#endif\n\n\/\/ Unicode.\n#if OS_WIN\n#  define UNICODE_PATH(x) u ## x\n#else\n#  define UNICODE_PATH(x) u8 ## x\n#endif\n\n\/\/ Mutex.\n#if !OS_MACOSX\n#  define HAS_SHARED_MUTEX 1\n#endif\n\n#define NAMED(expression) #expression << \": \" << (expression)\n\n\/\/ Needed to circumvent lint warnings in constexpr functions where CHECK_LT and\n\/\/ friends cannot be used.\n#define CONSTEXPR_CHECK(condition) CHECK(condition)\n\n\/\/ Clang for some reason doesn't like FP arithmetic that yields infinities in\n\/\/ constexpr code (MSVC and GCC are fine with that).\n#if PRINCIPIA_COMPILER_CLANG || PRINCIPIA_COMPILER_CLANG_CL\n#  define CONSTEXPR_INFINITY const\n#else\n#  define CONSTEXPR_INFINITY constexpr\n#endif\n\n#if PRINCIPIA_COMPILER_MSVC\n#define MSVC_ONLY_TEST(test_name) test_name\n#else\n#define MSVC_ONLY_TEST(test_name) DISABLED_##test_name\n#endif\n\n\/\/ For templates in macro parameters.\n#define TEMPLATE(...) template<__VA_ARGS__>\n\n\/\/ Forward declaration of a class or struct declared in an internal namespace\n\/\/ according to #602.\n\/\/ Usage:\n\/\/ FORWARD_DECLARE_FROM(p1, struct, T);\n\/\/ FORWARD_DECLARE_FROM(p2, TEMPLATE(int i) class, U);\n#define FORWARD_DECLARE_FROM(package_name,           \\\n                             template_and_class_key, \\\n                             declared_name)          \\\nnamespace internal_##package_name {                  \\\ntemplate_and_class_key declared_name;                \\\n}                                                    \\\nusing internal_##package_name::declared_name\n\n}  \/\/ namespace base\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: PaneDockingWindow.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: kz $ $Date: 2005-03-18 16:47: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#include \"PaneDockingWindow.hxx\"\n#include \"ViewShellBase.hxx\"\n#include \"Window.hxx\"\n#include \"sdresid.hxx\"\n#include \"res_bmp.hrc\"\n#ifndef _SFXDISPATCH_HXX\n#include <sfx2\/dispatch.hxx>\n#endif\n#include <vcl\/toolbox.hxx>\n#ifndef _SV_TASKPANELIST_HXX\n#include <vcl\/taskpanelist.hxx>\n#endif\n\nnamespace sd {\n\nPaneDockingWindow::PaneDockingWindow (\n    SfxBindings *pBindings,\n    SfxChildWindow *pChildWindow,\n    ::Window* pParent,\n    const ResId& rResId,\n    PaneManager::PaneType ePane)\n    : SfxDockingWindow (\n        pBindings,\n        pChildWindow,\n        pParent,\n        rResId\n        ),\n      mePane(ePane),\n      msTitle(),\n      mpTitleToolBox(NULL),\n      maBorder (3,1,3,3),\n      mnChildWindowId(pChildWindow->GetType())\n{\n    SetBackground (Wallpaper());\n\n    InitializeTitleToolBox();\n\n    ViewShellBase* pBase = ViewShellBase::GetViewShellBase(\n        pBindings->GetDispatcher()->GetFrame());\n    if (pBase != NULL)\n    {\n        msTitle = pBase->GetPaneManager().GetWindowTitle (mePane);\n        pBase->GetPaneManager().SetWindow (mePane, this);\n    }\n\n    \/\/ Tell the system window about the new docking window so that it can be\n    \/\/ reached via the keyboard.\n    SystemWindow* pSystemWindow = GetSystemWindow();\n    if (pSystemWindow != NULL)\n        pSystemWindow->GetTaskPaneList()->AddWindow(this);\n}\n\n\n\n\nPaneDockingWindow::~PaneDockingWindow (void)\n{\n    ViewShellBase* pBase = ViewShellBase::GetViewShellBase(\n        GetBindings().GetDispatcher()->GetFrame());\n\n    \/\/ Tell the next system window that the docking window is no longer\n    \/\/ available.\n    SystemWindow* pSystemWindow = GetSystemWindow();\n    if (pSystemWindow != NULL)\n        pSystemWindow->GetTaskPaneList()->RemoveWindow(this);\n\n    \/\/ Tell the ViewShellBase that the window of this slide sorter is not\n    \/\/ available anymore.\n    if (pBase != NULL)\n        pBase->GetPaneManager().SetWindow (mePane, NULL);\n}\n\n\n\n\nvoid PaneDockingWindow::SetTitle (const String& rsTitle)\n{\n    msTitle = rsTitle;\n    Invalidate();\n}\n\n\n\n\nvoid PaneDockingWindow::Resize (void)\n{\n    SfxDockingWindow::Resize();\n    Size aWindowSize (GetOutputSizePixel());\n    Size aToolBoxSize (0,0);\n    int nTitleBarHeight (GetSettings().GetStyleSettings().GetTitleHeight());\n\n    \/\/ Place the title tool box.\n    if (mpTitleToolBox.get() != NULL)\n    {\n        if (IsFloatingMode())\n            mpTitleToolBox->HideItem (1);\n        else\n            mpTitleToolBox->ShowItem (1);\n\n        aToolBoxSize = mpTitleToolBox->CalcWindowSizePixel();\n        if (aToolBoxSize.Height() > nTitleBarHeight)\n            nTitleBarHeight = aToolBoxSize.Height();\n        mpTitleToolBox->SetPosSizePixel (\n            Point(aWindowSize.Width()-aToolBoxSize.Width(),\n                (nTitleBarHeight-aToolBoxSize.Height())\/2),\n            aToolBoxSize);\n    }\n\n    \/\/ Place the view shell.\n    ViewShellBase* pBase (ViewShellBase::GetViewShellBase(\n        GetBindings().GetDispatcher()->GetFrame()));\n    if (pBase != NULL)\n    {\n        ViewShell* pViewShell = pBase->GetPaneManager().GetViewShell (mePane);\n        if (pViewShell != NULL)\n        {\n            ::sd::Window* pWindow = pViewShell->GetActiveWindow();\n            if (nTitleBarHeight < aToolBoxSize.Height())\n                nTitleBarHeight = aToolBoxSize.Height();\n            aWindowSize.Height() -= nTitleBarHeight;\n            pViewShell->Resize(\n                Point(maBorder.Left(),nTitleBarHeight+maBorder.Top()),\n                Size (aWindowSize.Width()-maBorder.Left()-maBorder.Right(),\n                    aWindowSize.Height()-maBorder.Top()-maBorder.Bottom()));\n        }\n    }\n}\n\n\n\n\nvoid PaneDockingWindow::Paint (const Rectangle& rRectangle)\n{\n    SfxDockingWindow::Paint (rRectangle);\n    int nTitleBarHeight (GetSettings().GetStyleSettings().GetTitleHeight());\n    Size aToolBoxSize = mpTitleToolBox->CalcWindowSizePixel();\n    if (aToolBoxSize.Height() > nTitleBarHeight)\n        nTitleBarHeight = aToolBoxSize.Height();\n    Color aOriginalLineColor (GetLineColor());\n    Color aOriginalFillColor (GetFillColor());\n    SetFillColor (GetSettings().GetStyleSettings().GetDialogColor());\n    SetLineColor ();\n\n    \/\/ Make font bold.\n    const Font& rOriginalFont (GetFont());\n    Font aFont (rOriginalFont);\n    aFont.SetWeight (WEIGHT_BOLD);\n    SetFont (aFont);\n\n    \/\/ Set border values.\n    Size aWindowSize (GetOutputSizePixel());\n    int nOuterLeft = 0;\n    int nInnerLeft = nOuterLeft + maBorder.Left() - 1;\n    int nOuterRight = aWindowSize.Width() - 1;\n    int nInnerRight = nOuterRight - maBorder.Right() + 1;\n    int nInnerTop = nTitleBarHeight + maBorder.Top() - 1;\n    int nOuterBottom = aWindowSize.Height() - 1;\n    int nInnerBottom = nOuterBottom - maBorder.Bottom() + 1;\n\n    \/\/ Paint title bar background.\n    Rectangle aTitleBarBox (Rectangle(\n        nOuterLeft,\n        0,\n        nOuterRight,\n        nInnerTop-1));\n    DrawRect (aTitleBarBox);\n\n    if (nInnerLeft > nOuterLeft)\n        DrawRect (\n            Rectangle (nOuterLeft, nInnerTop, nInnerLeft, nInnerBottom));\n    if (nOuterRight > nInnerRight)\n        DrawRect (\n            Rectangle (nInnerRight, nInnerTop, nOuterRight, nInnerBottom));\n    if (nInnerBottom < nOuterBottom)\n        DrawRect (\n            Rectangle (nOuterLeft, nInnerBottom, nOuterRight, nOuterBottom));\n\n    \/\/ Paint bevel border.\n    SetFillColor ();\n    SetLineColor (GetSettings().GetStyleSettings().GetShadowColor());\n    if (maBorder.Top() > 0)\n        DrawLine (\n            Point(nInnerLeft,nInnerTop),\n            Point(nInnerLeft,nInnerBottom));\n    if (maBorder.Left() > 0)\n        DrawLine (\n            Point(nInnerLeft,nInnerTop),\n            Point(nInnerRight,nInnerTop));\n    SetLineColor (GetSettings().GetStyleSettings().GetLightColor());\n    if (maBorder.Bottom() > 0)\n        DrawLine (\n            Point(nInnerRight,nInnerBottom),\n            Point(nInnerLeft,nInnerBottom));\n    if (maBorder.Right() > 0)\n        DrawLine (\n            Point(nInnerRight,nInnerBottom),\n            Point(nInnerRight,nInnerTop));\n\n    \/\/ Paint title bar text.\n    SetLineColor (GetSettings().GetStyleSettings().GetActiveTextColor());\n    SetFillColor ();\n    aTitleBarBox.Left() += 3;\n    DrawText (aTitleBarBox, msTitle,\n        TEXT_DRAW_LEFT\n        | TEXT_DRAW_VCENTER\n        | TEXT_DRAW_MULTILINE\n        | TEXT_DRAW_WORDBREAK);\n\n    \/\/ Restore original values of the output device.\n    SetFont (rOriginalFont);\n    SetFillColor (aOriginalFillColor);\n}\n\n\n\n\nvoid PaneDockingWindow::InitializeTitleToolBox (void)\n{\n    if (mpTitleToolBox.get() == NULL)\n    {\n        \/\/ Initialize the title tool box.\n        mpTitleToolBox.reset (new ToolBox(this));\n        mpTitleToolBox->SetSelectHdl (\n            LINK(this, PaneDockingWindow, ToolboxSelectHandler));\n        mpTitleToolBox->SetOutStyle (TOOLBOX_STYLE_FLAT);\n        mpTitleToolBox->SetBackground (Wallpaper (\n            GetSettings().GetStyleSettings().GetDialogColor()));\n        mpTitleToolBox->Show();\n    }\n    else\n        mpTitleToolBox->Clear();\n\n    \/\/ Get the closer bitmap and set it as right most button.\n    Bitmap aBitmap (SdResId (BMP_CLOSE_DOC));\n    Bitmap aBitmapHC (SdResId (BMP_CLOSE_DOC_H));\n    Image aImage = Image (aBitmap, Color (COL_LIGHTMAGENTA));\n    Image aImageHC = Image (aBitmapHC, Color (BMP_COLOR_HIGHCONTRAST));\n    mpTitleToolBox->InsertItem (1,\n        GetSettings().GetStyleSettings().GetMenuBarColor().IsDark()\n        ? aImageHC\n        : aImage);\n    mpTitleToolBox->ShowItem (1);\n}\n\n\n\n\nUSHORT PaneDockingWindow::AddMenu (\n    const String& rsMenuName,\n    ULONG nHelpId,\n    const Link& rCallback)\n{\n    \/\/ Add the menu before the closer button.\n    int nItemCount (mpTitleToolBox->GetItemCount());\n    USHORT nItemId = nItemCount+1;\n    mpTitleToolBox->InsertItem (\n        nItemId,\n        rsMenuName,\n        TIB_DROPDOWNONLY,\n        nItemCount-1);\n    mpTitleToolBox->SetHelpId( nItemId, nHelpId );\n    mpTitleToolBox->SetClickHdl (rCallback);\n    mpTitleToolBox->SetDropdownClickHdl (rCallback);\n\n    return nItemCount+1;\n}\n\n\n\n\nIMPL_LINK(PaneDockingWindow, ToolboxSelectHandler, ToolBox*, pToolBox)\n{\n    USHORT nId = pToolBox->GetCurItemId();\n\n    if (nId == 1)\n    {\n        EndTracking();\n        SfxBoolItem aVisibility (mnChildWindowId, FALSE);\n        GetBindings().GetDispatcher()->Execute (\n            mnChildWindowId,\n            SFX_CALLMODE_ASYNCHRON | SFX_CALLMODE_RECORD,\n            &aVisibility,\n            NULL);\n    }\n\n    return 0;\n}\n\n\n\n\nlong PaneDockingWindow::Notify( NotifyEvent& rNEvt )\n{\n    return SfxDockingWindow::Notify (rNEvt);\n}\n\n\n\n\nvoid PaneDockingWindow::StateChanged( StateChangedType nType )\n{\n    switch (nType)\n    {\n        case STATE_CHANGE_INITSHOW:\n            Resize();\n            break;\n    }\n    SfxDockingWindow::StateChanged (nType);\n}\n\n\n\n\nvoid PaneDockingWindow::DataChanged (const DataChangedEvent& rEvent)\n{\n    SfxDockingWindow::DataChanged (rEvent);\n\n    switch (rEvent.GetType())\n    {\n        case DATACHANGED_SETTINGS:\n            if ((rEvent.GetFlags() & SETTINGS_STYLE) == NULL)\n                break;\n            \/\/ else fall through.\n        case DATACHANGED_FONTS:\n        case DATACHANGED_FONTSUBSTITUTION:\n        {\n            const StyleSettings& rStyleSettings = GetSettings().GetStyleSettings();\n\n            \/\/ Font.\n            Font aFont = rStyleSettings.GetAppFont();\n            if (IsControlFont())\n                aFont.Merge(GetControlFont());\n            SetZoomedPointFont(aFont);\n\n            \/\/ Color.\n            Color aColor;\n            if (IsControlForeground())\n                aColor = GetControlForeground();\n            else\n                aColor = rStyleSettings.GetButtonTextColor();\n            SetTextColor(aColor);\n            SetTextFillColor();\n\n            Resize();\n            Invalidate();\n        }\n        break;\n    }\n}\n\n\n} \/\/ end of namespace ::sd\n<commit_msg>INTEGRATION: CWS impress52 (1.9.44); FILE MERGED 2005\/04\/27 14:09:57 af 1.9.44.1: #i48263# Added WindowEventListener() link method.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: PaneDockingWindow.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: obo $ $Date: 2005-05-02 13:17:56 $\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 \"PaneDockingWindow.hxx\"\n#include \"ViewShellBase.hxx\"\n#include \"Window.hxx\"\n#include \"sdresid.hxx\"\n#include \"res_bmp.hrc\"\n#ifndef _SFXDISPATCH_HXX\n#include <sfx2\/dispatch.hxx>\n#endif\n#include <vcl\/toolbox.hxx>\n#ifndef _SV_TASKPANELIST_HXX\n#include <vcl\/taskpanelist.hxx>\n#endif\n\nnamespace sd {\n\nPaneDockingWindow::PaneDockingWindow (\n    SfxBindings *pBindings,\n    SfxChildWindow *pChildWindow,\n    ::Window* pParent,\n    const ResId& rResId,\n    PaneManager::PaneType ePane)\n    : SfxDockingWindow (\n        pBindings,\n        pChildWindow,\n        pParent,\n        rResId\n        ),\n      mePane(ePane),\n      msTitle(),\n      mpTitleToolBox(NULL),\n      maBorder (3,1,3,3),\n      mnChildWindowId(pChildWindow->GetType())\n{\n    SetBackground (Wallpaper());\n\n    InitializeTitleToolBox();\n\n    ViewShellBase* pBase = ViewShellBase::GetViewShellBase(\n        pBindings->GetDispatcher()->GetFrame());\n    if (pBase != NULL)\n    {\n        msTitle = pBase->GetPaneManager().GetWindowTitle (mePane);\n        pBase->GetPaneManager().SetWindow (mePane, this);\n    }\n\n    \/\/ Tell the system window about the new docking window so that it can be\n    \/\/ reached via the keyboard.\n    SystemWindow* pSystemWindow = GetSystemWindow();\n    if (pSystemWindow != NULL)\n        pSystemWindow->GetTaskPaneList()->AddWindow(this);\n\n    AddEventListener(LINK(this,PaneDockingWindow,WindowEventListener));\n}\n\n\n\n\nPaneDockingWindow::~PaneDockingWindow (void)\n{\n    RemoveEventListener(LINK(this,PaneDockingWindow,WindowEventListener));\n\n    ViewShellBase* pBase = ViewShellBase::GetViewShellBase(\n        GetBindings().GetDispatcher()->GetFrame());\n\n    \/\/ Tell the next system window that the docking window is no longer\n    \/\/ available.\n    SystemWindow* pSystemWindow = GetSystemWindow();\n    if (pSystemWindow != NULL)\n        pSystemWindow->GetTaskPaneList()->RemoveWindow(this);\n\n    \/\/ Tell the ViewShellBase that the window of this slide sorter is not\n    \/\/ available anymore.\n    if (pBase != NULL)\n        pBase->GetPaneManager().SetWindow (mePane, NULL);\n}\n\n\n\n\nvoid PaneDockingWindow::SetTitle (const String& rsTitle)\n{\n    msTitle = rsTitle;\n    Invalidate();\n}\n\n\n\n\nvoid PaneDockingWindow::Resize (void)\n{\n    SfxDockingWindow::Resize();\n    Size aWindowSize (GetOutputSizePixel());\n    Size aToolBoxSize (0,0);\n    int nTitleBarHeight (GetSettings().GetStyleSettings().GetTitleHeight());\n\n    \/\/ Place the title tool box.\n    if (mpTitleToolBox.get() != NULL)\n    {\n        if (IsFloatingMode())\n            mpTitleToolBox->HideItem (1);\n        else\n            mpTitleToolBox->ShowItem (1);\n\n        aToolBoxSize = mpTitleToolBox->CalcWindowSizePixel();\n        if (aToolBoxSize.Height() > nTitleBarHeight)\n            nTitleBarHeight = aToolBoxSize.Height();\n        mpTitleToolBox->SetPosSizePixel (\n            Point(aWindowSize.Width()-aToolBoxSize.Width(),\n                (nTitleBarHeight-aToolBoxSize.Height())\/2),\n            aToolBoxSize);\n    }\n\n    \/\/ Place the view shell.\n    ViewShellBase* pBase (ViewShellBase::GetViewShellBase(\n        GetBindings().GetDispatcher()->GetFrame()));\n    if (pBase != NULL)\n    {\n        ViewShell* pViewShell = pBase->GetPaneManager().GetViewShell (mePane);\n        if (pViewShell != NULL)\n        {\n            ::sd::Window* pWindow = pViewShell->GetActiveWindow();\n            if (nTitleBarHeight < aToolBoxSize.Height())\n                nTitleBarHeight = aToolBoxSize.Height();\n            aWindowSize.Height() -= nTitleBarHeight;\n            pViewShell->Resize(\n                Point(maBorder.Left(),nTitleBarHeight+maBorder.Top()),\n                Size (aWindowSize.Width()-maBorder.Left()-maBorder.Right(),\n                    aWindowSize.Height()-maBorder.Top()-maBorder.Bottom()));\n        }\n    }\n}\n\n\n\n\nvoid PaneDockingWindow::Paint (const Rectangle& rRectangle)\n{\n    SfxDockingWindow::Paint (rRectangle);\n    int nTitleBarHeight (GetSettings().GetStyleSettings().GetTitleHeight());\n    Size aToolBoxSize = mpTitleToolBox->CalcWindowSizePixel();\n    if (aToolBoxSize.Height() > nTitleBarHeight)\n        nTitleBarHeight = aToolBoxSize.Height();\n    Color aOriginalLineColor (GetLineColor());\n    Color aOriginalFillColor (GetFillColor());\n    SetFillColor (GetSettings().GetStyleSettings().GetDialogColor());\n    SetLineColor ();\n\n    \/\/ Make font bold.\n    const Font& rOriginalFont (GetFont());\n    Font aFont (rOriginalFont);\n    aFont.SetWeight (WEIGHT_BOLD);\n    SetFont (aFont);\n\n    \/\/ Set border values.\n    Size aWindowSize (GetOutputSizePixel());\n    int nOuterLeft = 0;\n    int nInnerLeft = nOuterLeft + maBorder.Left() - 1;\n    int nOuterRight = aWindowSize.Width() - 1;\n    int nInnerRight = nOuterRight - maBorder.Right() + 1;\n    int nInnerTop = nTitleBarHeight + maBorder.Top() - 1;\n    int nOuterBottom = aWindowSize.Height() - 1;\n    int nInnerBottom = nOuterBottom - maBorder.Bottom() + 1;\n\n    \/\/ Paint title bar background.\n    Rectangle aTitleBarBox (Rectangle(\n        nOuterLeft,\n        0,\n        nOuterRight,\n        nInnerTop-1));\n    DrawRect (aTitleBarBox);\n\n    if (nInnerLeft > nOuterLeft)\n        DrawRect (\n            Rectangle (nOuterLeft, nInnerTop, nInnerLeft, nInnerBottom));\n    if (nOuterRight > nInnerRight)\n        DrawRect (\n            Rectangle (nInnerRight, nInnerTop, nOuterRight, nInnerBottom));\n    if (nInnerBottom < nOuterBottom)\n        DrawRect (\n            Rectangle (nOuterLeft, nInnerBottom, nOuterRight, nOuterBottom));\n\n    \/\/ Paint bevel border.\n    SetFillColor ();\n    SetLineColor (GetSettings().GetStyleSettings().GetShadowColor());\n    if (maBorder.Top() > 0)\n        DrawLine (\n            Point(nInnerLeft,nInnerTop),\n            Point(nInnerLeft,nInnerBottom));\n    if (maBorder.Left() > 0)\n        DrawLine (\n            Point(nInnerLeft,nInnerTop),\n            Point(nInnerRight,nInnerTop));\n    SetLineColor (GetSettings().GetStyleSettings().GetLightColor());\n    if (maBorder.Bottom() > 0)\n        DrawLine (\n            Point(nInnerRight,nInnerBottom),\n            Point(nInnerLeft,nInnerBottom));\n    if (maBorder.Right() > 0)\n        DrawLine (\n            Point(nInnerRight,nInnerBottom),\n            Point(nInnerRight,nInnerTop));\n\n    \/\/ Paint title bar text.\n    SetLineColor (GetSettings().GetStyleSettings().GetActiveTextColor());\n    SetFillColor ();\n    aTitleBarBox.Left() += 3;\n    DrawText (aTitleBarBox, msTitle,\n        TEXT_DRAW_LEFT\n        | TEXT_DRAW_VCENTER\n        | TEXT_DRAW_MULTILINE\n        | TEXT_DRAW_WORDBREAK);\n\n    \/\/ Restore original values of the output device.\n    SetFont (rOriginalFont);\n    SetFillColor (aOriginalFillColor);\n}\n\n\n\n\nvoid PaneDockingWindow::InitializeTitleToolBox (void)\n{\n    if (mpTitleToolBox.get() == NULL)\n    {\n        \/\/ Initialize the title tool box.\n        mpTitleToolBox.reset (new ToolBox(this));\n        mpTitleToolBox->SetSelectHdl (\n            LINK(this, PaneDockingWindow, ToolboxSelectHandler));\n        mpTitleToolBox->SetOutStyle (TOOLBOX_STYLE_FLAT);\n        mpTitleToolBox->SetBackground (Wallpaper (\n            GetSettings().GetStyleSettings().GetDialogColor()));\n        mpTitleToolBox->Show();\n    }\n    else\n        mpTitleToolBox->Clear();\n\n    \/\/ Get the closer bitmap and set it as right most button.\n    Bitmap aBitmap (SdResId (BMP_CLOSE_DOC));\n    Bitmap aBitmapHC (SdResId (BMP_CLOSE_DOC_H));\n    Image aImage = Image (aBitmap, Color (COL_LIGHTMAGENTA));\n    Image aImageHC = Image (aBitmapHC, Color (BMP_COLOR_HIGHCONTRAST));\n    mpTitleToolBox->InsertItem (1,\n        GetSettings().GetStyleSettings().GetMenuBarColor().IsDark()\n        ? aImageHC\n        : aImage);\n    mpTitleToolBox->ShowItem (1);\n}\n\n\n\n\nUSHORT PaneDockingWindow::AddMenu (\n    const String& rsMenuName,\n    ULONG nHelpId,\n    const Link& rCallback)\n{\n    \/\/ Add the menu before the closer button.\n    int nItemCount (mpTitleToolBox->GetItemCount());\n    USHORT nItemId = nItemCount+1;\n    mpTitleToolBox->InsertItem (\n        nItemId,\n        rsMenuName,\n        TIB_DROPDOWNONLY,\n        nItemCount-1);\n    mpTitleToolBox->SetHelpId( nItemId, nHelpId );\n    mpTitleToolBox->SetClickHdl (rCallback);\n    mpTitleToolBox->SetDropdownClickHdl (rCallback);\n\n    return nItemCount+1;\n}\n\n\n\n\nIMPL_LINK(PaneDockingWindow, ToolboxSelectHandler, ToolBox*, pToolBox)\n{\n    USHORT nId = pToolBox->GetCurItemId();\n\n    if (nId == 1)\n    {\n        EndTracking();\n        SfxBoolItem aVisibility (mnChildWindowId, FALSE);\n        GetBindings().GetDispatcher()->Execute (\n            mnChildWindowId,\n            SFX_CALLMODE_ASYNCHRON | SFX_CALLMODE_RECORD,\n            &aVisibility,\n            NULL);\n    }\n\n    return 0;\n}\n\n\n\n\nlong PaneDockingWindow::Notify( NotifyEvent& rNEvt )\n{\n    return SfxDockingWindow::Notify (rNEvt);\n}\n\n\n\n\nvoid PaneDockingWindow::StateChanged( StateChangedType nType )\n{\n    switch (nType)\n    {\n        case STATE_CHANGE_INITSHOW:\n            Resize();\n            break;\n    }\n    SfxDockingWindow::StateChanged (nType);\n}\n\n\n\n\nvoid PaneDockingWindow::DataChanged (const DataChangedEvent& rEvent)\n{\n    SfxDockingWindow::DataChanged (rEvent);\n\n    switch (rEvent.GetType())\n    {\n        case DATACHANGED_SETTINGS:\n            if ((rEvent.GetFlags() & SETTINGS_STYLE) == NULL)\n                break;\n            \/\/ else fall through.\n        case DATACHANGED_FONTS:\n        case DATACHANGED_FONTSUBSTITUTION:\n        {\n            const StyleSettings& rStyleSettings = GetSettings().GetStyleSettings();\n\n            \/\/ Font.\n            Font aFont = rStyleSettings.GetAppFont();\n            if (IsControlFont())\n                aFont.Merge(GetControlFont());\n            SetZoomedPointFont(aFont);\n\n            \/\/ Color.\n            Color aColor;\n            if (IsControlForeground())\n                aColor = GetControlForeground();\n            else\n                aColor = rStyleSettings.GetButtonTextColor();\n            SetTextColor(aColor);\n            SetTextFillColor();\n\n            Resize();\n            Invalidate();\n        }\n        break;\n    }\n}\n\n\n\n\nIMPL_LINK(PaneDockingWindow, WindowEventListener, VclSimpleEvent*, pEvent)\n{\n    if (pEvent!=NULL && pEvent->ISA(VclWindowEvent))\n    {\n        ViewShellBase* pBase = ViewShellBase::GetViewShellBase(\n            GetBindings().GetDispatcher()->GetFrame());\n\n        VclWindowEvent* pWindowEvent = static_cast<VclWindowEvent*>(pEvent);\n        switch (pWindowEvent->GetId())\n        {\n            case VCLEVENT_WINDOW_SHOW:\n                if (pBase != NULL)\n                    pBase->GetPaneManager().RequestWindowVisibilityChange(\n                        mePane,\n                        true,\n                        PaneManager::CM_ASYNCHRONOUS);\n                break;\n\n            case VCLEVENT_WINDOW_HIDE:\n                if (pBase != NULL)\n                    pBase->GetPaneManager().RequestWindowVisibilityChange(\n                        mePane,\n                        false,\n                        PaneManager::CM_ASYNCHRONOUS);\n                break;\n        }\n    }\n    return 1;\n}\n\n} \/\/ end of namespace ::sd\n<|endoftext|>"}
{"text":"<commit_before>#ifndef VIENNAGRID_TOPOLOGY_PLC_HPP\n#define VIENNAGRID_TOPOLOGY_PLC_HPP\n\n\/* =======================================================================\n   Copyright (c) 2011-2012, Institute for Microelectronics,\n                            Institute for Analysis and Scientific Computing,\n                            TU Wien.\n\n                            -----------------\n                     ViennaGrid - The Vienna Grid Library\n                            -----------------\n\n   Authors:      Karl Rupp                           rupp@iue.tuwien.ac.at\n                 Josef Weinbub                    weinbub@iue.tuwien.ac.at\n               \n   (A list of additional contributors can be found in the PDF manual)\n\n   License:      MIT (X11), see file LICENSE in the base directory\n======================================================================= *\/\n\n#include \"viennagrid\/forwards.hpp\"\n#include \"viennagrid\/topology\/simplex.hpp\"\n#include \"viennagrid\/topology\/polygon.hpp\"\n#include \"viennagrid\/element\/element_view.hpp\"\n\n\/** @file polygon.hpp\n    @brief Provides the topological definition of a polygon\n*\/\n\nnamespace viennagrid\n{\n\n  struct plc_tag\n  {\n    typedef polygon_tag facet_tag;\n      \n    enum{ dim = 2 };\n    static std::string name() { return \"PLC\"; }\n  };\n  \n  \n  namespace topology\n  {\n\n    \/\/Line:\n    \/** @brief Topological description of the 0-cells of a polygon *\/\n    template <>\n    struct boundary_cells<plc_tag, vertex_tag>\n    {\n      typedef dynamic_unique_layout_tag     layout_tag;\n      enum{ num = -1 };\n    };\n    \n    template <>\n    struct boundary_cells<plc_tag, line_tag>\n    {\n      typedef dynamic_unique_layout_tag     layout_tag;\n      enum{ num = -1 };\n    };\n    \n    template <>\n    struct boundary_cells<plc_tag, polygon_tag>\n    {\n      typedef dynamic_unique_layout_tag     layout_tag;\n      enum{ num = -1 };\n    };\n\n\n    \n    \n    template<typename bnd_cell_type>\n    struct bndcell_generator<plc_tag, polygon_tag, bnd_cell_type>\n    {\n        template<typename element_type, typename inserter_type>\n        static void create_bnd_cells(element_type & element, inserter_type & inserter)\n        {}\n    };\n    \n    template<typename bnd_cell_type>\n    struct bndcell_generator<plc_tag, line_tag, bnd_cell_type>\n    {\n        template<typename element_type, typename inserter_type>\n        static void create_bnd_cells(element_type & plc, inserter_type & inserter)\n        {\n            typedef typename result_of::element<element_type, polygon_tag>::type PolygonType;\n            typedef typename result_of::element_range<element_type, polygon_tag>::type PolygonRange;\n            typedef typename result_of::iterator<PolygonRange>::type PolygonIterator;\n            \n            PolygonRange polygons = elements<polygon_tag>(plc);\n            for (PolygonIterator pit = polygons.begin(); pit != polygons.end(); ++pit)\n            {\n                typedef typename result_of::element_range<PolygonType, line_tag>::type LineOnPolygonRange;\n                typedef typename result_of::hook_iterator<LineOnPolygonRange>::type LineOnPolygonIterator;\n                \n                LineOnPolygonRange lines = elements<line_tag>(*pit);\n                for (LineOnPolygonIterator lphit = lines.begin(); lphit != lines.end(); ++lphit)\n                {\n                    plc.container( line_tag() ).insert_hook( *lphit );\n                    if (is_tagged<bounding_tag>(*pit, plc))\n                        tag<bounding_tag>(viennagrid::dereference_hook(plc,*lphit), plc);\n                }\n            }\n        }\n    };\n    \n    template<typename bnd_cell_type>\n    struct bndcell_generator<plc_tag, simplex_tag<0>, bnd_cell_type>\n    {\n        template<typename element_type, typename inserter_type>\n        static void create_bnd_cells(element_type & plc, inserter_type & inserter)\n        {\n            typedef typename result_of::element<element_type, line_tag>::type LineType;\n            typedef typename result_of::element_range<element_type, line_tag>::type LineRange;\n            typedef typename result_of::iterator<LineRange>::type LineIterator;\n            \n            LineRange lines = elements<line_tag>(plc);\n            for (LineIterator lit = lines.hook_begin(); lit != lines.hook_end(); ++lit)\n            {\n                typedef typename result_of::element_range<LineType, vertex_tag>::type VertexOnLineRange;\n                typedef typename result_of::hook_iterator<VertexOnLineRange>::type VertexOnLineHookIterator;\n                \n                VertexOnLineRange vertices = elements<vertex_tag>(*lit);\n                for (VertexOnLineHookIterator vlhit = vertices.begin(); vlhit != vertices.end(); ++vlhit)\n                    plc.container( vertex_tag() ).insert_hook( *vlhit );\n            }\n            \n            \n            \n            typedef typename result_of::element<element_type, polygon_tag>::type PolygonType;\n            typedef typename result_of::element_range<element_type, polygon_tag>::type PolygonRange;\n            typedef typename result_of::iterator<PolygonRange>::type PolygonIterator;\n            \n            PolygonRange polygons = elements<polygon_tag>(plc);\n            for (PolygonIterator pit = polygons.hook_begin(); pit != polygons.hook_end(); ++pit)\n            {\n                typedef typename result_of::element_range<PolygonType, vertex_tag>::type VertexOnPolygonRange;\n                typedef typename result_of::hook_iterator<VertexOnPolygonRange>::type VertexOnPolygonIterator;\n                \n                VertexOnPolygonRange vertices = elements<vertex_tag>(*pit);\n                for (VertexOnPolygonIterator vphit = vertices.begin(); vphit != vertices.end(); ++vphit)\n                {\n                    plc.container( vertex_tag() ).insert_hook( *vphit );\n                    if (is_tagged<bounding_tag>(*pit, plc))\n                        tag<bounding_tag>(viennagrid::dereference_hook(plc,*vphit), plc);\n                }\n            }\n        }\n    };\n\n\n    \n\n  } \/\/topology\n}\n\n#endif\n\n<commit_msg>adapted to new tagging system<commit_after>#ifndef VIENNAGRID_TOPOLOGY_PLC_HPP\n#define VIENNAGRID_TOPOLOGY_PLC_HPP\n\n\/* =======================================================================\n   Copyright (c) 2011-2012, Institute for Microelectronics,\n                            Institute for Analysis and Scientific Computing,\n                            TU Wien.\n\n                            -----------------\n                     ViennaGrid - The Vienna Grid Library\n                            -----------------\n\n   Authors:      Karl Rupp                           rupp@iue.tuwien.ac.at\n                 Josef Weinbub                    weinbub@iue.tuwien.ac.at\n               \n   (A list of additional contributors can be found in the PDF manual)\n\n   License:      MIT (X11), see file LICENSE in the base directory\n======================================================================= *\/\n\n#include \"viennagrid\/forwards.hpp\"\n#include \"viennagrid\/topology\/simplex.hpp\"\n#include \"viennagrid\/topology\/polygon.hpp\"\n#include \"viennagrid\/element\/tagging.hpp\"\n\n\/** @file polygon.hpp\n    @brief Provides the topological definition of a polygon\n*\/\n\nnamespace viennagrid\n{\n\n  struct plc_tag\n  {\n    typedef polygon_tag facet_tag;\n      \n    enum{ dim = 2 };\n    static std::string name() { return \"PLC\"; }\n  };\n  \n  \n  namespace topology\n  {\n\n    \/\/Line:\n    \/** @brief Topological description of the 0-cells of a polygon *\/\n    template <>\n    struct boundary_cells<plc_tag, vertex_tag>\n    {\n      typedef dynamic_unique_layout_tag     layout_tag;\n      enum{ num = -1 };\n    };\n    \n    template <>\n    struct boundary_cells<plc_tag, line_tag>\n    {\n      typedef dynamic_unique_layout_tag     layout_tag;\n      enum{ num = -1 };\n    };\n    \n    template <>\n    struct boundary_cells<plc_tag, polygon_tag>\n    {\n      typedef dynamic_unique_layout_tag     layout_tag;\n      enum{ num = -1 };\n    };\n\n\n    \n    \n    template<typename bnd_cell_type>\n    struct bndcell_generator<plc_tag, polygon_tag, bnd_cell_type>\n    {\n        template<typename element_type, typename inserter_type>\n        static void create_bnd_cells(element_type & element, inserter_type & inserter)\n        {}\n    };\n    \n    template<typename bnd_cell_type>\n    struct bndcell_generator<plc_tag, line_tag, bnd_cell_type>\n    {\n        template<typename element_type, typename inserter_type>\n        static void create_bnd_cells(element_type & plc, inserter_type & inserter)\n        {\n            typedef typename result_of::element<element_type, polygon_tag>::type PolygonType;\n            typedef typename result_of::element_range<element_type, polygon_tag>::type PolygonRange;\n            typedef typename result_of::iterator<PolygonRange>::type PolygonIterator;\n            \n            PolygonRange polygons = elements<polygon_tag>(plc);\n            for (PolygonIterator pit = polygons.begin(); pit != polygons.end(); ++pit)\n            {\n                typename tagging::result_of::element_tag<element_type, bounding_tag>::type plc_bounding_tag = tagging::create_element_tag<bounding_tag>(plc);\n                \n                typedef typename result_of::element_range<PolygonType, line_tag>::type LineOnPolygonRange;\n                typedef typename result_of::hook_iterator<LineOnPolygonRange>::type LineOnPolygonIterator;\n                \n                LineOnPolygonRange lines = elements<line_tag>(*pit);\n                for (LineOnPolygonIterator lphit = lines.begin(); lphit != lines.end(); ++lphit)\n                {\n                    plc.container( line_tag() ).insert_hook( *lphit );\n                    if (tagging::is_tagged(*pit, plc_bounding_tag))\n                        tagging::tag(viennagrid::dereference_hook(plc,*lphit), plc_bounding_tag);\n                }\n            }\n        }\n    };\n    \n    template<typename bnd_cell_type>\n    struct bndcell_generator<plc_tag, simplex_tag<0>, bnd_cell_type>\n    {\n        template<typename element_type, typename inserter_type>\n        static void create_bnd_cells(element_type & plc, inserter_type & inserter)\n        {\n            typedef typename result_of::element<element_type, line_tag>::type LineType;\n            typedef typename result_of::element_range<element_type, line_tag>::type LineRange;\n            typedef typename result_of::iterator<LineRange>::type LineIterator;\n            \n            LineRange lines = elements<line_tag>(plc);\n            for (LineIterator lit = lines.hook_begin(); lit != lines.hook_end(); ++lit)\n            {\n                typedef typename result_of::element_range<LineType, vertex_tag>::type VertexOnLineRange;\n                typedef typename result_of::hook_iterator<VertexOnLineRange>::type VertexOnLineHookIterator;\n                \n                VertexOnLineRange vertices = elements<vertex_tag>(*lit);\n                for (VertexOnLineHookIterator vlhit = vertices.begin(); vlhit != vertices.end(); ++vlhit)\n                    plc.container( vertex_tag() ).insert_hook( *vlhit );\n            }\n            \n            \n            \n            typename tagging::result_of::element_tag<element_type, bounding_tag>::type plc_bounding_tag = tagging::create_element_tag<bounding_tag>(plc);\n            \n            typedef typename result_of::element<element_type, polygon_tag>::type PolygonType;\n            typedef typename result_of::element_range<element_type, polygon_tag>::type PolygonRange;\n            typedef typename result_of::iterator<PolygonRange>::type PolygonIterator;\n            \n            PolygonRange polygons = elements<polygon_tag>(plc);\n            for (PolygonIterator pit = polygons.hook_begin(); pit != polygons.hook_end(); ++pit)\n            {\n                typedef typename result_of::element_range<PolygonType, vertex_tag>::type VertexOnPolygonRange;\n                typedef typename result_of::hook_iterator<VertexOnPolygonRange>::type VertexOnPolygonIterator;\n                \n                VertexOnPolygonRange vertices = elements<vertex_tag>(*pit);\n                for (VertexOnPolygonIterator vphit = vertices.begin(); vphit != vertices.end(); ++vphit)\n                {\n                    plc.container( vertex_tag() ).insert_hook( *vphit );\n                    if (tagging::is_tagged(*pit, plc_bounding_tag))\n                        tagging::tag(viennagrid::dereference_hook(plc,*vphit), plc_bounding_tag);\n                }\n            }\n        }\n    };\n\n\n    \n\n  } \/\/topology\n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef VIENNAGRID_TRAITS_POINT_HPP\n#define VIENNAGRID_TRAITS_POINT_HPP\n\n\/* =======================================================================\n   Copyright (c) 2011-2012, Institute for Microelectronics,\n                            Institute for Analysis and Scientific Computing,\n                            TU Wien.\n\n                            -----------------\n                     ViennaGrid - The Vienna Grid Library\n                            -----------------\n\n   Authors:      Karl Rupp                           rupp@iue.tuwien.ac.at\n                 Josef Weinbub                    weinbub@iue.tuwien.ac.at\n               \n   (A list of additional contributors can be found in the PDF manual)\n\n   License:      MIT (X11), see file LICENSE in the base directory\n======================================================================= *\/\n\n#include \"viennagrid\/forwards.hpp\"\n\n\/** @file viennagrid\/traits\/point.hpp\n    @brief Provides a generic layer for point operations\n*\/\n\nnamespace viennagrid \n{\n  \n  namespace traits\n  {\n    \/** @brief  Returns the geometric dimension of a point *\/\n    template <typename PointType>\n    struct dimension;\n    \n    \/** @brief  Returns the geometric dimension of a point. Specialization for a ViennaGrid point *\/\n    template <typename CoordType, typename CoordinateSystem>\n    struct dimension< point_t<CoordType, CoordinateSystem> >\n    {\n      enum { value = CoordinateSystem::dim };\n    };\n\n    \n    \/** @brief Returns the coordinate system of a point. Must be specialized for a user-provided point type *\/\n    template <typename PointType>\n    struct coordinate_system\n    {\n      \/\/by default, we don't know anything about the point type, so let's complain at compile time\n      typedef typename PointType::ERROR_UNKNOWN_COORDINATE_SYSTEM_FOR_POINT_TYPE    type;\n    };\n    \n    \/** @brief Returns the coordinate system of a point. Specialization for a ViennaGrid point. *\/\n    template <typename CoordType, typename CoordinateSystem>\n    struct coordinate_system< point_t<CoordType, CoordinateSystem> >\n    {\n      typedef CoordinateSystem    type;\n    };\n\n    \n    \/** @brief Returns the static (compile time) size of a point *\/\n    template <typename PointType>\n    struct static_size;\n\n    \/** @brief Returns the static (compile time) size of a point. Specialization for a ViennaGrid point. *\/\n    template <typename CoordType, typename CoordinateSystem>\n    struct static_size< point_t<CoordType, CoordinateSystem> >\n    {\n      enum { value = CoordinateSystem::dim };\n    };\n\n    \/** @brief Returns the dynamic (run time) size of a point. Assumes a .size() member. Other cases must be provided with overloads *\/\n    template <typename PointType>\n    std::size_t dynamic_size(PointType const & p)\n    {\n      return p.size();\n    }\n    \n    \n    \/** @brief  Value Type retrieval for a point. Returns the numeric type of each coordinate entry *\/\n    template <typename PointType>\n    struct value_type\n    {\n        typedef typename PointType::value_type type;\n    };\n\n    \/** @brief  Value Type retrieval for a point. Returns the numeric type of each coordinate entry. Specialization for a ViennaGrid point. *\/\n    template <typename CoordType, typename CoordinateSystem>\n    struct value_type< point_t<CoordType, CoordinateSystem> >\n    {\n      typedef CoordType    type;\n    };\n    \n  }\n} \n\n#endif\n<commit_msg>removed value_type, use result_of::coord_type instead<commit_after>#ifndef VIENNAGRID_TRAITS_POINT_HPP\n#define VIENNAGRID_TRAITS_POINT_HPP\n\n\/* =======================================================================\n   Copyright (c) 2011-2012, Institute for Microelectronics,\n                            Institute for Analysis and Scientific Computing,\n                            TU Wien.\n\n                            -----------------\n                     ViennaGrid - The Vienna Grid Library\n                            -----------------\n\n   Authors:      Karl Rupp                           rupp@iue.tuwien.ac.at\n                 Josef Weinbub                    weinbub@iue.tuwien.ac.at\n               \n   (A list of additional contributors can be found in the PDF manual)\n\n   License:      MIT (X11), see file LICENSE in the base directory\n======================================================================= *\/\n\n#include \"viennagrid\/forwards.hpp\"\n\n\/** @file viennagrid\/traits\/point.hpp\n    @brief Provides a generic layer for point operations\n*\/\n\nnamespace viennagrid \n{\n  \n  namespace traits\n  {\n    \/** @brief  Returns the geometric dimension of a point *\/\n    template <typename PointType>\n    struct dimension;\n    \n    \/** @brief  Returns the geometric dimension of a point. Specialization for a ViennaGrid point *\/\n    template <typename CoordType, typename CoordinateSystem>\n    struct dimension< point_t<CoordType, CoordinateSystem> >\n    {\n      enum { value = CoordinateSystem::dim };\n    };\n\n    \n    \/** @brief Returns the coordinate system of a point. Must be specialized for a user-provided point type *\/\n    template <typename PointType>\n    struct coordinate_system\n    {\n      \/\/by default, we don't know anything about the point type, so let's complain at compile time\n      typedef typename PointType::ERROR_UNKNOWN_COORDINATE_SYSTEM_FOR_POINT_TYPE    type;\n    };\n    \n    \/** @brief Returns the coordinate system of a point. Specialization for a ViennaGrid point. *\/\n    template <typename CoordType, typename CoordinateSystem>\n    struct coordinate_system< point_t<CoordType, CoordinateSystem> >\n    {\n      typedef CoordinateSystem    type;\n    };\n\n    \n    \/** @brief Returns the static (compile time) size of a point *\/\n    template <typename PointType>\n    struct static_size;\n\n    \/** @brief Returns the static (compile time) size of a point. Specialization for a ViennaGrid point. *\/\n    template <typename CoordType, typename CoordinateSystem>\n    struct static_size< point_t<CoordType, CoordinateSystem> >\n    {\n      enum { value = CoordinateSystem::dim };\n    };\n\n    \/** @brief Returns the dynamic (run time) size of a point. Assumes a .size() member. Other cases must be provided with overloads *\/\n    template <typename PointType>\n    std::size_t dynamic_size(PointType const & p)\n    {\n      return p.size();\n    }\n    \n    \n\/\/     \/** @brief  Value Type retrieval for a point. Returns the numeric type of each coordinate entry *\/\n\/\/     template <typename PointType>\n\/\/     struct value_type\n\/\/     {\n\/\/         typedef typename PointType::value_type type;\n\/\/     };\n\/\/ \n\/\/     \/** @brief  Value Type retrieval for a point. Returns the numeric type of each coordinate entry. Specialization for a ViennaGrid point. *\/\n\/\/     template <typename CoordType, typename CoordinateSystem>\n\/\/     struct value_type< point_t<CoordType, CoordinateSystem> >\n\/\/     {\n\/\/       typedef CoordType    type;\n\/\/     };\n    \n  }\n} \n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2017 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\n#define BOOST_TEST_MODULE core\n\n#include <boost\/test\/unit_test.hpp>\n#include <iostream>\n\n#include \"utils\/log_histogram.hh\"\n\ntemplate<const log_histogram_options& opts>\nstruct node : public log_histogram_hook<opts> {\n    size_t v;\n    node(size_t v) : v(v) {}\n};\n\ntemplate<const log_histogram_options& opts>\nvoid test_with_options() {\n    std::vector<std::unique_ptr<node<opts>>> nodes;\n\n    log_histogram<node<opts>, opts> hist;\n\n    BOOST_REQUIRE(hist.empty());\n\n    unsigned i = 0;\n    for (; i < opts.min_size; ++i) {\n        nodes.push_back(std::make_unique<node<opts>>(i));\n        hist.push(*nodes.back());\n        BOOST_REQUIRE(!hist.contains_above_min());\n        BOOST_REQUIRE(!hist.empty());\n    }\n\n    for (; i <= opts.max_size; ++i) {\n        nodes.push_back(std::make_unique<node<opts>>(i));\n        hist.push(*nodes.back());\n        BOOST_REQUIRE(hist.contains_above_min());\n        BOOST_REQUIRE(!hist.empty());\n    }\n\n    size_t count = 0;\n\n    \/\/ Check monotonicity of buckets\n    size_t prev_key = 0;\n    for (auto&& bucket : hist.buckets()) {\n        size_t max_key = 0;\n        for (auto&& t : bucket) {\n            ++count;\n            auto key = t.v;\n            if (prev_key) {\n                assert(key > prev_key);\n            }\n            max_key = std::max(max_key, key);\n        }\n        if (max_key) {\n            prev_key = max_key;\n        }\n    }\n\n    BOOST_REQUIRE(count == (opts.max_size + 1));\n}\n\nconstexpr log_histogram_options opts1{(1 << 4) + 3, 3, (1 << 6) + 2};\nconstexpr log_histogram_options opts2{(1 << 4) + 2, 1, (1 << 17) + 2};\nconstexpr log_histogram_options opts3{(1 << 4) + 1, 0, (1 << 17) + 2};\nconstexpr log_histogram_options opts4{(1 << 4) + 0, 3, (1 << 17)};\n\ntemplate<>\nsize_t hist_key<node<opts1>>(const node<opts1>& n) { return n.v; }\n\ntemplate<>\nsize_t hist_key<node<opts2>>(const node<opts2>& n) { return n.v; }\n\ntemplate<>\nsize_t hist_key<node<opts3>>(const node<opts3>& n) { return n.v; }\n\ntemplate<>\nsize_t hist_key<node<opts4>>(const node<opts4>& n) { return n.v; }\n\nBOOST_AUTO_TEST_CASE(test_log_histogram) {\n    test_with_options<opts1>();\n    test_with_options<opts2>();\n    test_with_options<opts3>();\n    test_with_options<opts4>();\n}\n<commit_msg>tests: log_historgram_test: Fix compiation on Ubuntu<commit_after>\/*\n * Copyright (C) 2017 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\n#define BOOST_TEST_MODULE core\n\n#include <boost\/test\/unit_test.hpp>\n#include <iostream>\n\n#include \"utils\/log_histogram.hh\"\n\ntemplate<const log_histogram_options& opts>\nstruct node : public log_histogram_hook<opts> {\n    size_t v;\n    node(size_t v) : v(v) {}\n};\n\ntemplate<const log_histogram_options& opts>\nvoid test_with_options() {\n    std::vector<std::unique_ptr<node<opts>>> nodes;\n\n    log_histogram<node<opts>, opts> hist;\n\n    BOOST_REQUIRE(hist.empty());\n\n    unsigned i = 0;\n    for (; i < opts.min_size; ++i) {\n        nodes.push_back(std::make_unique<node<opts>>(i));\n        hist.push(*nodes.back());\n        BOOST_REQUIRE(!hist.contains_above_min());\n        BOOST_REQUIRE(!hist.empty());\n    }\n\n    for (; i <= opts.max_size; ++i) {\n        nodes.push_back(std::make_unique<node<opts>>(i));\n        hist.push(*nodes.back());\n        BOOST_REQUIRE(hist.contains_above_min());\n        BOOST_REQUIRE(!hist.empty());\n    }\n\n    size_t count = 0;\n\n    \/\/ Check monotonicity of buckets\n    size_t prev_key = 0;\n    for (auto&& bucket : hist.buckets()) {\n        size_t max_key = 0;\n        for (auto&& t : bucket) {\n            ++count;\n            auto key = t.v;\n            if (prev_key) {\n                assert(key > prev_key);\n            }\n            max_key = std::max(max_key, key);\n        }\n        if (max_key) {\n            prev_key = max_key;\n        }\n    }\n\n    BOOST_REQUIRE(count == (opts.max_size + 1));\n}\n\nextern constexpr log_histogram_options opts1{(1 << 4) + 3, 3, (1 << 6) + 2};\nextern constexpr log_histogram_options opts2{(1 << 4) + 2, 1, (1 << 17) + 2};\nextern constexpr log_histogram_options opts3{(1 << 4) + 1, 0, (1 << 17) + 2};\nextern constexpr log_histogram_options opts4{(1 << 4) + 0, 3, (1 << 17)};\n\ntemplate<>\nsize_t hist_key<node<opts1>>(const node<opts1>& n) { return n.v; }\n\ntemplate<>\nsize_t hist_key<node<opts2>>(const node<opts2>& n) { return n.v; }\n\ntemplate<>\nsize_t hist_key<node<opts3>>(const node<opts3>& n) { return n.v; }\n\ntemplate<>\nsize_t hist_key<node<opts4>>(const node<opts4>& n) { return n.v; }\n\nBOOST_AUTO_TEST_CASE(test_log_histogram) {\n    test_with_options<opts1>();\n    test_with_options<opts2>();\n    test_with_options<opts3>();\n    test_with_options<opts4>();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2014 Cloudius Systems\n *\/\n\n\n#include \"database.hh\"\n#include \"core\/app-template.hh\"\n#include \"core\/distributed.hh\"\n#include \"thrift\/server.hh\"\n#include \"transport\/server.hh\"\n#include \"http\/httpd.hh\"\n#include \"api\/api.hh\"\n#include \"db\/config.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\nstatic future<>\nread_config(bpo::variables_map& opts, db::config& cfg) {\n    if (opts.count(\"options-file\") == 0) {\n        return make_ready_future<>();\n    }\n    return cfg.read_from_file(opts[\"options-file\"].as<sstring>());\n}\n\nint main(int ac, char** av) {\n    app_template app;\n    auto opt_add = app.add_options();\n\n    auto cfg = make_lw_shared<db::config>();\n    cfg->add_options(opt_add)\n        (\"api-port\", bpo::value<uint16_t>()->default_value(10000), \"Http Rest API port\")\n        \/\/ TODO : default, always read?\n        (\"options-file\", bpo::value<sstring>(), \"cassandra.yaml file to read options from\")\n        ;\n\n    auto server = std::make_unique<distributed<thrift_server>>();\n    distributed<database> db;\n    distributed<cql3::query_processor> qp;\n    service::storage_proxy proxy{db};\n    api::http_context ctx;\n\n    return app.run(ac, av, [&] {\n        auto&& opts = app.configuration();\n        uint16_t thrift_port = cfg->rpc_port();\n        uint16_t cql_port = cfg->native_transport_port();\n        uint16_t api_port = opts[\"api-port\"].as<uint16_t>();\n        sstring listen_address = cfg->listen_address();\n        auto seed_provider= cfg->seed_provider();\n\n        return read_config(opts, *cfg).then([cfg, &db]() {\n            return db.start(std::move(*cfg));\n        }).then([&db] {\n            engine().at_exit([&db] { return db.stop(); });\n            return db.invoke_on_all(&database::init_from_data_directory);\n        }).then([&db, &proxy, &qp] {\n            return qp.start(std::ref(proxy), std::ref(db)).then([&qp] {\n                engine().at_exit([&qp] { return qp.stop(); });\n            });\n        }).then([&db, &proxy, &qp, cql_port, thrift_port] {\n            auto cserver = new distributed<cql_server>;\n            cserver->start(std::ref(proxy), std::ref(qp)).then([server = std::move(cserver), cql_port] () mutable {\n                server->invoke_on_all(&cql_server::listen, ipv4_addr{cql_port});\n            }).then([cql_port] {\n                std::cout << \"CQL server listening on port \" << cql_port << \" ...\\n\";\n            });\n            auto tserver = new distributed<thrift_server>;\n            tserver->start(std::ref(db)).then([server = std::move(tserver), thrift_port] () mutable {\n                server->invoke_on_all(&thrift_server::listen, ipv4_addr{thrift_port});\n            }).then([thrift_port] {\n                std::cout << \"Thrift server listening on port \" << thrift_port << \" ...\\n\";\n            });\n        }).then([listen_address, seed_provider] {\n            const gms::inet_address listen(listen_address);\n            std::set<gms::inet_address> seeds;\n            for (auto& x : seed_provider.parameters) {\n                seeds.emplace(x.first);\n            }\n            net::get_messaging_service().start(listen).then([seeds] {\n                auto& ms = net::get_local_messaging_service();\n                print(\"Messaging server listening on ip %s port %d ...\\n\", ms.listen_address(), ms.port());\n                gms::get_failure_detector().start_single().then([seeds] {\n                    gms::get_gossiper().start_single().then([seeds] {\n                        auto& gossiper = gms::get_local_gossiper();\n                        gossiper.set_seeds(seeds);\n                        using namespace std::chrono;\n                        auto now = high_resolution_clock::now().time_since_epoch();\n                        int generation_number = duration_cast<seconds>(now).count();\n                        gossiper.start(generation_number).then([] {\n                            print(\"Start gossiper service ...\\n\");\n                        });\n                    });\n                });\n            });\n        }).then([&db, api_port, &ctx]{\n            ctx.http_server.start().then([api_port, &ctx] {\n                return set_server(ctx);\n            }).then([&ctx, api_port] {\n                ctx.http_server.listen(api_port);\n            }).then([api_port] {\n                std::cout << \"Seastar HTTP server listening on port \" << api_port << \" ...\\n\";\n            });\n        }).or_terminate();\n    });\n}\n<commit_msg>main: Move messaging_service init code into a helper function<commit_after>\/*\n * Copyright 2014 Cloudius Systems\n *\/\n\n\n#include \"database.hh\"\n#include \"core\/app-template.hh\"\n#include \"core\/distributed.hh\"\n#include \"thrift\/server.hh\"\n#include \"transport\/server.hh\"\n#include \"http\/httpd.hh\"\n#include \"api\/api.hh\"\n#include \"db\/config.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\nstatic future<>\nread_config(bpo::variables_map& opts, db::config& cfg) {\n    if (opts.count(\"options-file\") == 0) {\n        return make_ready_future<>();\n    }\n    return cfg.read_from_file(opts[\"options-file\"].as<sstring>());\n}\n\nvoid init_messaging_service(auto listen_address, auto seed_provider) {\n    const gms::inet_address listen(listen_address);\n    std::set<gms::inet_address> seeds;\n    for (auto& x : seed_provider.parameters) {\n        seeds.emplace(x.first);\n    }\n    net::get_messaging_service().start(listen).then([seeds] {\n        auto& ms = net::get_local_messaging_service();\n        print(\"Messaging server listening on ip %s port %d ...\\n\", ms.listen_address(), ms.port());\n        gms::get_failure_detector().start_single().then([seeds] {\n            gms::get_gossiper().start_single().then([seeds] {\n                auto& gossiper = gms::get_local_gossiper();\n                gossiper.set_seeds(seeds);\n                using namespace std::chrono;\n                auto now = high_resolution_clock::now().time_since_epoch();\n                int generation_number = duration_cast<seconds>(now).count();\n                gossiper.start(generation_number).then([] {\n                    print(\"Start gossiper service ...\\n\");\n                });\n            });\n        });\n    });\n}\n\nint main(int ac, char** av) {\n    app_template app;\n    auto opt_add = app.add_options();\n\n    auto cfg = make_lw_shared<db::config>();\n    cfg->add_options(opt_add)\n        (\"api-port\", bpo::value<uint16_t>()->default_value(10000), \"Http Rest API port\")\n        \/\/ TODO : default, always read?\n        (\"options-file\", bpo::value<sstring>(), \"cassandra.yaml file to read options from\")\n        ;\n\n    auto server = std::make_unique<distributed<thrift_server>>();\n    distributed<database> db;\n    distributed<cql3::query_processor> qp;\n    service::storage_proxy proxy{db};\n    api::http_context ctx;\n\n    return app.run(ac, av, [&] {\n        auto&& opts = app.configuration();\n        uint16_t thrift_port = cfg->rpc_port();\n        uint16_t cql_port = cfg->native_transport_port();\n        uint16_t api_port = opts[\"api-port\"].as<uint16_t>();\n        sstring listen_address = cfg->listen_address();\n        auto seed_provider= cfg->seed_provider();\n\n        return read_config(opts, *cfg).then([cfg, &db]() {\n            return db.start(std::move(*cfg));\n        }).then([&db] {\n            engine().at_exit([&db] { return db.stop(); });\n            return db.invoke_on_all(&database::init_from_data_directory);\n        }).then([&db, &proxy, &qp] {\n            return qp.start(std::ref(proxy), std::ref(db)).then([&qp] {\n                engine().at_exit([&qp] { return qp.stop(); });\n            });\n        }).then([&db, &proxy, &qp, cql_port, thrift_port] {\n            auto cserver = new distributed<cql_server>;\n            cserver->start(std::ref(proxy), std::ref(qp)).then([server = std::move(cserver), cql_port] () mutable {\n                server->invoke_on_all(&cql_server::listen, ipv4_addr{cql_port});\n            }).then([cql_port] {\n                std::cout << \"CQL server listening on port \" << cql_port << \" ...\\n\";\n            });\n            auto tserver = new distributed<thrift_server>;\n            tserver->start(std::ref(db)).then([server = std::move(tserver), thrift_port] () mutable {\n                server->invoke_on_all(&thrift_server::listen, ipv4_addr{thrift_port});\n            }).then([thrift_port] {\n                std::cout << \"Thrift server listening on port \" << thrift_port << \" ...\\n\";\n            });\n        }).then([listen_address, seed_provider] {\n            init_messaging_service(listen_address, seed_provider);\n        }).then([&db, api_port, &ctx]{\n            ctx.http_server.start().then([api_port, &ctx] {\n                return set_server(ctx);\n            }).then([&ctx, api_port] {\n                ctx.http_server.listen(api_port);\n            }).then([api_port] {\n                std::cout << \"Seastar HTTP server listening on port \" << api_port << \" ...\\n\";\n            });\n        }).or_terminate();\n    });\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n#include <type_traits>\n#include \"typestring.hh\"\n\ntemplate<typename A, typename B>\nvoid check() {\n    printf(\"[%s] %s\\n\", std::is_same<A,B>::value ? \"pass\" : \"fail\", A::data());\n}\n\nusing test1\n    = irqus::typestring<'H', 'e', 'l', 'l', 'o'\n                     , ' '\n                     , 'w', 'o', 'r', 'l', 'd'\n                     , ','\n                     , ' '\n                     , 'h', 'o', 'w'\n                     , ' '\n                     , 'i', 's'\n                     , ' '\n                     , 'i', 't'\n                     , ' '\n                     , 'g', 'o', 'i', 'n', 'g', '?'>;\n\nusing test2\n    = irqus::typestring<'u', 'p', 'p', 'e', 'r', 'c', 'a', 's', 'e'\n                       , ':'\n                       , ' '\n                       , 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K'\n                       , 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V'\n                       , 'W', 'X', 'Y', 'Z' >;\nusing test3\n    = irqus::typestring< 'l', 'o', 'w', 'e', 'r', 'c', 'a', 's', 'e'\n                       , ':'\n                       , ' '\n                       , 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k'\n                       , 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v'\n                       , 'w', 'x', 'y', 'z' >;\nusing test4\n    = irqus::typestring< 'f', 'l','o', 'a', 't', 'i', 'n', 'g'\n                       , ' '\n                       , ':'\n                       , ' '\n                       , '1', '2', '3', '4', '5', '6', '7', '8', '9'\n                       , '.'\n                       , '1', '2', '3', '4', '5', '6', '7', '8', '9'\n                       , '+'\n                       , 'e', '-', '1', '2', '3', '4'>;\nusing test5\n    = irqus::typestring< 's', 'y', 'm', 'b', 'o', 'l', 's'\n                       , ' '\n                       , ' '\n                       , ':'\n                       , ' '\n                       , '~', '`', '!', '@', '#', '$', '%', '^', '&', '*', '('\n                       , ')', '_', '+', '=','-', '[', ']', '\\\\', '{', '}', '|'\n                       , ':', ';', '\\'', ',', '.', '?', '\/'>;\n      \nint main() {\n    check<typestring_is(\"Hello world, how is it going?\"),test1>();\n    check<typestring_is(\"uppercase: ABCDEFGHIJKLMNOPQRSTUVWXYZ\"),test2>();\n    check<typestring_is(\"lowercase: abcdefghijklmnopqrstuvwxyz\"),test3>();\n    check<typestring_is(\"floating : 123456789.123456789+e-1234\"),test4>();\n    check<typestring_is(\"symbols  : ~`!@#$%^&*()_+=-[]\\\\{}|:;',.?\/\"),test5>();\n    check<typestring_is(\"\"),irqus::typestring<'\\0'>>(); \/\/ null!\n    check<irqus::tycat< typestring_is(\"ABC\")\n                      , typestring_is(\"DEF\")\n                      , typestring_is(\"1234\")>\n                      , typestring_is(\"ABCDEF1234\") >();\n    return {};\n}\n<commit_msg>More formatting stuff<commit_after>#include <cstdio>\n#include <type_traits>\n#include \"typestring.hh\"\n\ntemplate<typename A, typename B>\nvoid check() {\n    printf(\"[%s] %s\\n\", std::is_same<A,B>::value ? \"pass\" : \"fail\", A::data());\n}\n\nusing test1\n    = irqus::typestring<'H', 'e', 'l', 'l', 'o'\n                     , ' '\n                     , 'w', 'o', 'r', 'l', 'd'\n                     , ','\n                     , ' '\n                     , 'h', 'o', 'w'\n                     , ' '\n                     , 'i', 's'\n                     , ' '\n                     , 'i', 't'\n                     , ' '\n                     , 'g', 'o', 'i', 'n', 'g', '?'>;\n\nusing test2\n    = irqus::typestring<'u', 'p', 'p', 'e', 'r', 'c', 'a', 's', 'e'\n                       , ':'\n                       , ' '\n                       , 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K'\n                       , 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V'\n                       , 'W', 'X', 'Y', 'Z' >;\nusing test3\n    = irqus::typestring< 'l', 'o', 'w', 'e', 'r', 'c', 'a', 's', 'e'\n                       , ':'\n                       , ' '\n                       , 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k'\n                       , 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v'\n                       , 'w', 'x', 'y', 'z' >;\nusing test4\n    = irqus::typestring< 'f', 'l','o', 'a', 't', 'i', 'n', 'g'\n                       , ' '\n                       , ':'\n                       , ' '\n                       , '1', '2', '3', '4', '5', '6', '7', '8', '9'\n                       , '.'\n                       , '1', '2', '3', '4', '5', '6', '7', '8', '9'\n                       , '+'\n                       , 'e', '-', '1', '2', '3', '4'>;\nusing test5\n    = irqus::typestring< 's', 'y', 'm', 'b', 'o', 'l', 's'\n                       , ' '\n                       , ' '\n                       , ':'\n                       , ' '\n                       , '~', '`', '!', '@', '#', '$', '%', '^', '&', '*', '('\n                       , ')', '_', '+', '=','-', '[', ']', '\\\\', '{', '}', '|'\n                       , ':', ';', '\\'', ',', '.', '?', '\/'>;\n      \nint main() {\n    check<typestring_is(\"Hello world, how is it going?\"),test1>();\n    check<typestring_is(\"uppercase: ABCDEFGHIJKLMNOPQRSTUVWXYZ\"),test2>();\n    check<typestring_is(\"lowercase: abcdefghijklmnopqrstuvwxyz\"),test3>();\n    check<typestring_is(\"floating : 123456789.123456789+e-1234\"),test4>();\n    check<typestring_is(\"symbols  : ~`!@#$%^&*()_+=-[]\\\\{}|:;',.?\/\"),test5>();\n    check<typestring_is(\"\"),irqus::typestring<'\\0'>>(); \/\/ null!\n    check< irqus::tycat< typestring_is(\"ABC\")\n                       , typestring_is(\"DEF\")\n                       , typestring_is(\"1234\")>\n         , typestring_is(\"ABCDEF1234\") >();\n    return {};\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\n\n#include <string>\n#include <unistd.h>\n#include <slankdev\/string.h>\n#include <slankdev\/poll.h>\n#include <slankdev\/pcap.h>\n#include \"TuiFrontend.h\"\n\n\n\nsize_t packet_recv_count = 0;\n\n\nclass Pcap : public slankdev::pcap {\n  TuiFrontend* front;\n public:\n  Pcap() : front(nullptr) {}\n  virtual void recv(const void* ptr, struct pcap_pkthdr* hdr) override\n  { front->packet_input(ptr, hdr->len, hdr->ts.tv_sec); }\n  void register_frontend(TuiFrontend* f) { front = f; }\n  virtual void open_live(const char* ifname) override\n  {\n    try {\n      slankdev::pcap::open_live(ifname);\n    } catch (std::exception& e) {\n      printf(\"cuishark: %s\\n\", e.what());\n      exit(-1);\n    }\n  }\n  virtual void open_offline(const char* ifname) override\n  {\n    try {\n      slankdev::pcap::open_offline(ifname);\n    } catch (std::exception& e) {\n      printf(\"cuishark: %s\\n\", e.what());\n      exit(-1);\n    }\n  }\n};\n\n\n\nenum inputmode {\n  NONE,\n  PCAP,\n  NETIF,\n};\n\nclass OptParser {\n  inputmode mode_;\n  std::string inputname_;\n public:\n  OptParser(int argc, char** argv) : mode_(NONE)\n  {\n    int res;\n    while ((res = getopt(argc, argv, \"r:i:\")) != -1) {\n      switch (res) {\n        case 'r':\n          this->mode_      = PCAP;\n          this->inputname_ = optarg;\n          break;\n        case 'i':\n          this->mode_      = NETIF;\n          this->inputname_ = optarg;\n          break;\n        default:\n          exit(-1);\n      }\n    }\n  }\n  inputmode mode() const { return mode_; }\n  const std::string& inputname() const { return inputname_; }\n};\n\n\nvoid usage(const char* progname)\n{\n  printf(\"Usage: %s [-r PCAPFILE] [-i NETIF] \\n\", progname);\n}\n\n\nint\tmain(int argc, char** argv)\n{\n  Pcap pcapfd;\n  OptParser opt(argc, argv);\n  switch (opt.mode()) {\n    case PCAP:\n      pcapfd.open_offline(opt.inputname().c_str());\n      break;\n    case NETIF:\n      pcapfd.open_live(opt.inputname().c_str());\n      break;\n    default:\n      fprintf(stderr, \"input interface is not specilied.\\n\");\n      usage(argv[0]);\n      return -1;\n      break;\n  }\n\n  TuiFrontend::init();\n  TuiFrontend fe;\n  pcapfd.register_frontend(&fe);\n\n  fe.refresh();\n  struct pollfd fds[2];\n  memset(fds, 0, sizeof(fds));\n  fds[0].fd = fileno(stdin);\n  fds[0].events = POLLIN;\n  fds[1].fd = pcapfd.get_selectable_fd();\n  fds[1].events = POLLIN;\n\n\twhile (1) {\n    slankdev::poll(fds, sizeof(fds)\/sizeof(fds[0]), 100);\n    if (fds[0].revents & POLLIN) {\n      fe.key_input(wgetch(stdscr));\n      fe.refresh();\n    } else if (fds[1].revents & POLLIN) {\n      packet_recv_count ++;\n      try {\n        pcapfd.next();\n      } catch (std::exception& e) {\n        pcapfd.close();\n        fds[1].fd = -1;\n      }\n      fe.refresh();\n    }\n\t}\n\tendwin();\n}\n\n\n<commit_msg>Support: pcap-filter-syntax, option -f SYNTAX<commit_after>\n\n\n#include <string>\n#include <unistd.h>\n#include <slankdev\/string.h>\n#include <slankdev\/poll.h>\n#include <slankdev\/pcap.h>\n#include \"TuiFrontend.h\"\n\n\n\nsize_t packet_recv_count = 0;\n\n\nclass Pcap : public slankdev::pcap {\n  TuiFrontend* front;\n public:\n  Pcap() : front(nullptr) {}\n  virtual void recv(const void* ptr, struct pcap_pkthdr* hdr) override\n  { front->packet_input(ptr, hdr->len, hdr->ts.tv_sec); }\n  void register_frontend(TuiFrontend* f) { front = f; }\n  virtual void open_live(const char* ifname) override\n  {\n    try {\n      slankdev::pcap::open_live(ifname);\n    } catch (std::exception& e) {\n      printf(\"cuishark: %s\\n\", e.what());\n      exit(-1);\n    }\n  }\n  virtual void open_offline(const char* ifname) override\n  {\n    try {\n      slankdev::pcap::open_offline(ifname);\n    } catch (std::exception& e) {\n      printf(\"cuishark: %s\\n\", e.what());\n      exit(-1);\n    }\n  }\n};\n\n\nenum inputmode {\n  NONE,\n  PCAP,\n  NETIF,\n};\n\nclass OptParser {\n  inputmode mode_;\n  std::string inputname_;\n  std::string filter_;\n  bool autoscroll_;\n  bool filter_on_;\n public:\n  OptParser(int argc, char** argv)\n    : mode_(NONE), autoscroll_(false), filter_on_(false)\n  {\n    int res;\n    while ((res = getopt(argc, argv, \"r:i:f:a\")) != -1) {\n      switch (res) {\n        case 'r':\n          this->mode_      = PCAP;\n          this->inputname_ = optarg;\n          break;\n        case 'i':\n          this->mode_      = NETIF;\n          this->inputname_ = optarg;\n          break;\n        case 'f':\n          filter_on_  = true;\n          filter_ = optarg;\n          break;\n        case 'a':\n          autoscroll_ = true;\n          break;\n        default:\n          exit(-1);\n      }\n    }\n  }\n  inputmode mode() const { return mode_; }\n  const std::string& inputname() const { return inputname_; }\n  const std::string& filter()   const { return filter_; }\n  bool autoscroll() const { return autoscroll_; }\n  bool filter_on() const { return filter_on_; }\n};\n\n\nvoid usage(const char* progname)\n{\n  printf(\"Usage: %s [a] [-r PCAPFILE] [-i NETIF] [-f FilterSyntax] \\n\", progname);\n  printf(\"   -r PCAPFILE -- input interface is pcapfile\\n\");\n  printf(\"   -i NETIF    -- input interface is network interface\\n\");\n  printf(\"   -f SYNTAX   -- compile and use PCAP-CAPTHRE-FILTER \\n\");\n  printf(\"   -a          -- automaticaly to scroll\\n\");\n}\n\n\nint\tmain(int argc, char** argv)\n{\n  Pcap pcapfd;\n  OptParser opt(argc, argv);\n  switch (opt.mode()) {\n    case PCAP:\n      pcapfd.open_offline(opt.inputname().c_str());\n      break;\n    case NETIF:\n      pcapfd.open_live(opt.inputname().c_str());\n      break;\n    default:\n      fprintf(stderr, \"input interface is not specilied.\\n\");\n      usage(argv[0]);\n      return -1;\n      break;\n  }\n\n  if (opt.filter_on()) {\n    struct bpf_program fp;\n    try {\n      pcapfd.compile(&fp, opt.filter().c_str(), 0, 0);\n      pcapfd.setfilter(&fp);\n    } catch (std::exception& e) {\n      fprintf(stderr, e.what());\n      return -1;\n    }\n  }\n\n  TuiFrontend::init();\n  TuiFrontend fe;\n  pcapfd.register_frontend(&fe);\n\n  fe.refresh();\n  struct pollfd fds[2];\n  memset(fds, 0, sizeof(fds));\n  fds[0].fd = fileno(stdin);\n  fds[0].events = POLLIN;\n  fds[1].fd = pcapfd.get_selectable_fd();\n  fds[1].events = POLLIN;\n\n\twhile (1) {\n    slankdev::poll(fds, sizeof(fds)\/sizeof(fds[0]), 100);\n    if (fds[0].revents & POLLIN) {\n      fe.key_input(wgetch(stdscr));\n      fe.refresh();\n    } else if (fds[1].revents & POLLIN) {\n      try {\n\n        packet_recv_count ++;\n        pcapfd.next();\n        fe.refresh();\n        if (opt.autoscroll()) fe.pane1.cursor_down();\n\n      } catch (std::exception& e) {\n        pcapfd.close();\n        fds[1].fd = -1;\n      }\n    }\n\t}\n\tendwin();\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\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., 51 Franklin Street, Fifth Floor,\n   Boston, MA 02110-1301, USA.\n*\/\n\n#include \"propertywidgetitemfactory.h\"\n#include \"nullpropertywidgetitem.h\"\n#include \"gluonobjectpropertywidgetitem.h\"\n\n#include \"core\/debughelper.h\"\n#include \"core\/gluonobjectfactory.h\"\n\nusing namespace GluonCreator;\n\ntemplate<> GLUONCREATOR_EXPORT PropertyWidgetItemFactory* GluonCore::Singleton<PropertyWidgetItemFactory>::m_instance = 0;\n\nPropertyWidgetItem*\nPropertyWidgetItemFactory::create(const QString& type, QWidget* parent)\n{\n    DEBUG_BLOCK\n    \n    \/\/ First check if there's any PIW which supports the type\n    foreach(const QString &thisType, piwTypes.keys())\n    {\n        if(thisType == type)\n        {\n            PropertyWidgetItem* item = piwTypes[thisType]->instantiate();\n            item->setParent(parent);\n            return item;\n        }\n    }\n    \n    \/\/ Then see if it's a reference type inheriting GluonObject...\n    QString typeTruncated = type.left(type.length() - 1);\n    foreach(const QString &thisType, GluonCore::GluonObjectFactory::instance()->objectTypeNames())\n    {\n        if(thisType == typeTruncated)\n        {\n            return new GluonObjectPropertyWidgetItem(parent);\n        }\n    }\n    \n    \/\/ Finally, throw back a Null item if we've got nothing...\n    DEBUG_TEXT(QString(\"Attempting to instantiate unknown property widget item of type %1\").arg(type));\n\n    return new NullPropertyWidgetItem(parent);\n}\n\nvoid\nPropertyWidgetItemFactory::registerNewPIW(PropertyWidgetItem* newPIW)\n{\n    if(newPIW)\n    {\n        foreach(const QString &type, newPIW->supportedDataTypes())\n        {\n            piwTypes[type] = newPIW;\n        }\n    }\n}\n\n<commit_msg>Remove whitespace<commit_after>\/*\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., 51 Franklin Street, Fifth Floor,\n   Boston, MA 02110-1301, USA.\n*\/\n\n#include \"propertywidgetitemfactory.h\"\n#include \"nullpropertywidgetitem.h\"\n#include \"gluonobjectpropertywidgetitem.h\"\n\n#include \"core\/debughelper.h\"\n#include \"core\/gluonobjectfactory.h\"\n\nusing namespace GluonCreator;\n\ntemplate<> GLUONCREATOR_EXPORT PropertyWidgetItemFactory* GluonCore::Singleton<PropertyWidgetItemFactory>::m_instance = 0;\n\nPropertyWidgetItem*\nPropertyWidgetItemFactory::create(const QString& type, QWidget* parent)\n{\n    DEBUG_BLOCK\n\n    \/\/ First check if there's any PIW which supports the type\n    foreach(const QString &thisType, piwTypes.keys())\n    {\n        if(thisType == type)\n        {\n            PropertyWidgetItem* item = piwTypes[thisType]->instantiate();\n            item->setParent(parent);\n            return item;\n        }\n    }\n\n    \/\/ Then see if it's a reference type inheriting GluonObject...\n    QString typeTruncated = type.left(type.length() - 1);\n    foreach(const QString &thisType, GluonCore::GluonObjectFactory::instance()->objectTypeNames())\n    {\n        if(thisType == typeTruncated)\n        {\n            return new GluonObjectPropertyWidgetItem(parent);\n        }\n    }\n\n    \/\/ Finally, throw back a Null item if we've got nothing...\n    DEBUG_TEXT(QString(\"Attempting to instantiate unknown property widget item of type %1\").arg(type));\n\n    return new NullPropertyWidgetItem(parent);\n}\n\nvoid\nPropertyWidgetItemFactory::registerNewPIW(PropertyWidgetItem* newPIW)\n{\n    if(newPIW)\n    {\n        foreach(const QString &type, newPIW->supportedDataTypes())\n        {\n            piwTypes[type] = newPIW;\n        }\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#define SOL_ALL_SAFETIES_ON 1\r\n#include <sol\/sol.hpp>\r\n\r\n#include <iostream>\r\n\r\nint main() {\r\n\r\n\tsol::state lua;\r\n\tlua[\"bark\"] = 50;\r\n\tsol::optional<int> x = lua[\"bark\"];\r\n\t\/\/ x will have a value\r\n\tif (x) {\r\n\t\treturn -1;\r\n\t}\r\n\telse {\r\n\t\tstd::cout << \"x has no value, as expected\" << std::endl;\r\n\t}\r\n\r\n\tlua[\"bark\"] = sol::lua_nil;\r\n\tsol::optional<int> y = lua[\"bark\"];\r\n\t\/\/ y will not have a value\r\n\tif (x) {\r\n\t\treturn -1;\r\n\t}\r\n\telse {\r\n\t\tstd::cout << \"y has no value, as expected\" << std::endl;\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>more stuff<commit_after>#define SOL_ALL_SAFETIES_ON 1\r\n#include <sol\/sol.hpp>\r\n\r\n#include <iostream>\r\n\r\nint main() {\r\n\r\n\tsol::state lua;\r\n\tlua[\"bark\"] = 50;\r\n\tsol::optional<int> x = lua[\"bark\"];\r\n\t\/\/ x will have a value\r\n\tif (x) {\r\n\t\treturn -1;\r\n\t}\r\n\telse {\r\n\t\tstd::cout << \"x has no value, as expected\" << std::endl;\r\n\t}\r\n\r\n\tlua[\"bark\"] = sol::lua_nil;\r\n\tsol::optional<int> y = lua[\"bark\"];\r\n\t\/\/ y will not have a value\r\n\tif (y) {\r\n\t\treturn -1;\r\n\t}\r\n\telse {\r\n\t\tstd::cout << \"y has no value, as expected\" << std::endl;\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2020 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 \"include\/effects\/SkImageFilters.h\"\n#include \"modules\/svg\/include\/SkSVGAttributeParser.h\"\n#include \"modules\/svg\/include\/SkSVGFe.h\"\n#include \"modules\/svg\/include\/SkSVGFilterContext.h\"\n#include \"modules\/svg\/include\/SkSVGRenderContext.h\"\n\nsk_sp<SkImageFilter> SkSVGFe::makeImageFilter(const SkSVGRenderContext& ctx,\n                                              const SkSVGFilterContext& fctx) const {\n    return this->onMakeImageFilter(ctx, fctx);\n}\n\nSkRect SkSVGFe::resolveBoundaries(const SkSVGRenderContext& ctx,\n                                  const SkSVGFilterContext& fctx) const {\n    const auto x = fX.isValid() ? *fX : SkSVGLength(0, SkSVGLength::Unit::kPercentage);\n    const auto y = fY.isValid() ? *fY : SkSVGLength(0, SkSVGLength::Unit::kPercentage);\n    const auto w = fWidth.isValid() ? *fWidth : SkSVGLength(100, SkSVGLength::Unit::kPercentage);\n    const auto h = fHeight.isValid() ? *fHeight : SkSVGLength(100, SkSVGLength::Unit::kPercentage);\n\n    \/\/ Resolve the x\/y\/w\/h boundary rect depending on primitiveUnits setting\n    SkRect boundaries;\n    switch (fctx.primitiveUnits().type()) {\n        case SkSVGObjectBoundingBoxUnits::Type::kUserSpaceOnUse:\n            boundaries = ctx.lengthContext().resolveRect(x, y, w, h);\n            break;\n        case SkSVGObjectBoundingBoxUnits::Type::kObjectBoundingBox: {\n            SkASSERT(ctx.node());\n            const SkRect objBounds = ctx.node()->objectBoundingBox(ctx);\n            boundaries = SkSVGLengthContext({1, 1}).resolveRect(x, y, w, h);\n            boundaries = SkRect::MakeXYWH(objBounds.fLeft + boundaries.fLeft * objBounds.width(),\n                                          objBounds.fTop + boundaries.fTop * objBounds.height(),\n                                          boundaries.width() * objBounds.width(),\n                                          boundaries.height() * objBounds.height());\n\n            break;\n        }\n    }\n\n    return boundaries;\n}\n\nSkRect SkSVGFe::resolveFilterSubregion(const SkSVGRenderContext& ctx,\n                                       const SkSVGFilterContext& fctx) const {\n    \/\/ From https:\/\/www.w3.org\/TR\/SVG11\/filters.html#FilterPrimitiveSubRegion,\n    \/\/ the default filter effect subregion is equal to the union of the subregions defined\n    \/\/ for all \"referenced nodes\" (filter effect inputs). If there are no inputs, the\n    \/\/ default subregion is equal to the filter effects region\n    \/\/ (https:\/\/www.w3.org\/TR\/SVG11\/filters.html#FilterEffectsRegion).\n    const std::vector<SkSVGFeInputType> inputs = this->getInputs();\n    SkRect subregion;\n    if (inputs.empty()) {\n        subregion = fctx.filterEffectsRegion();\n    } else {\n        subregion = fctx.filterPrimitiveSubregion(inputs[0]);\n        for (size_t i = 1; i < inputs.size(); i++) {\n            subregion.join(fctx.filterPrimitiveSubregion(inputs[i]));\n        }\n    }\n\n    \/\/ Next resolve the rect specified by the x, y, width, height attributes on this filter effect.\n    \/\/ If those attributes were given, they override the corresponding attribute of the default\n    \/\/ filter effect subregion calculated above.\n    const SkRect boundaries = this->resolveBoundaries(ctx, fctx);\n    if (fX.isValid()) {\n        subregion.fLeft = boundaries.fLeft;\n    }\n    if (fY.isValid()) {\n        subregion.fTop = boundaries.fTop;\n    }\n    if (fWidth.isValid()) {\n        subregion.fRight = subregion.fLeft + boundaries.width();\n    }\n    if (fHeight.isValid()) {\n        subregion.fBottom = subregion.fTop + boundaries.height();\n    }\n\n    return subregion;\n}\n\nSkSVGColorspace SkSVGFe::resolveColorspace(const SkSVGRenderContext& ctx) const {\n    constexpr SkSVGColorspace kDefaultCS = SkSVGColorspace::kSRGB;\n    const SkSVGColorspace cs = *ctx.presentationContext().fInherited.fColorInterpolationFilters;\n    return cs == SkSVGColorspace::kAuto ? kDefaultCS : cs;\n}\n\nvoid SkSVGFe::applyProperties(SkSVGRenderContext* ctx) const { this->onPrepareToRender(ctx); }\n\nbool SkSVGFe::parseAndSetAttribute(const char* name, const char* value) {\n    return INHERITED::parseAndSetAttribute(name, value) ||\n           this->setIn(SkSVGAttributeParser::parse<SkSVGFeInputType>(\"in\", name, value)) ||\n           this->setResult(SkSVGAttributeParser::parse<SkSVGStringType>(\"result\", name, value)) ||\n           this->setX(SkSVGAttributeParser::parse<SkSVGLength>(\"x\", name, value)) ||\n           this->setY(SkSVGAttributeParser::parse<SkSVGLength>(\"y\", name, value)) ||\n           this->setWidth(SkSVGAttributeParser::parse<SkSVGLength>(\"width\", name, value)) ||\n           this->setHeight(SkSVGAttributeParser::parse<SkSVGLength>(\"height\", name, value));\n}\n\ntemplate <> bool SkSVGAttributeParser::parse(SkSVGFeInputType* type) {\n    static constexpr std::tuple<const char*, SkSVGFeInputType::Type> gTypeMap[] = {\n            {\"SourceGraphic\", SkSVGFeInputType::Type::kSourceGraphic},\n            {\"SourceAlpha\", SkSVGFeInputType::Type::kSourceAlpha},\n            {\"BackgroundImage\", SkSVGFeInputType::Type::kBackgroundImage},\n            {\"BackgroundAlpha\", SkSVGFeInputType::Type::kBackgroundAlpha},\n            {\"FillPaint\", SkSVGFeInputType::Type::kFillPaint},\n            {\"StrokePaint\", SkSVGFeInputType::Type::kStrokePaint},\n    };\n\n    SkSVGStringType resultId;\n    SkSVGFeInputType::Type t;\n    bool parsedValue = false;\n    if (this->parseEnumMap(gTypeMap, &t)) {\n        *type = SkSVGFeInputType(t);\n        parsedValue = true;\n    } else if (parse(&resultId)) {\n        *type = SkSVGFeInputType(resultId);\n        parsedValue = true;\n    }\n\n    return parsedValue && this->parseEOSToken();\n}\n<commit_msg>[svg] Handle std input case for filter subregion calculation<commit_after>\/*\n * Copyright 2020 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 \"include\/effects\/SkImageFilters.h\"\n#include \"modules\/svg\/include\/SkSVGAttributeParser.h\"\n#include \"modules\/svg\/include\/SkSVGFe.h\"\n#include \"modules\/svg\/include\/SkSVGFilterContext.h\"\n#include \"modules\/svg\/include\/SkSVGRenderContext.h\"\n\nsk_sp<SkImageFilter> SkSVGFe::makeImageFilter(const SkSVGRenderContext& ctx,\n                                              const SkSVGFilterContext& fctx) const {\n    return this->onMakeImageFilter(ctx, fctx);\n}\n\nSkRect SkSVGFe::resolveBoundaries(const SkSVGRenderContext& ctx,\n                                  const SkSVGFilterContext& fctx) const {\n    const auto x = fX.isValid() ? *fX : SkSVGLength(0, SkSVGLength::Unit::kPercentage);\n    const auto y = fY.isValid() ? *fY : SkSVGLength(0, SkSVGLength::Unit::kPercentage);\n    const auto w = fWidth.isValid() ? *fWidth : SkSVGLength(100, SkSVGLength::Unit::kPercentage);\n    const auto h = fHeight.isValid() ? *fHeight : SkSVGLength(100, SkSVGLength::Unit::kPercentage);\n\n    \/\/ Resolve the x\/y\/w\/h boundary rect depending on primitiveUnits setting\n    SkRect boundaries;\n    switch (fctx.primitiveUnits().type()) {\n        case SkSVGObjectBoundingBoxUnits::Type::kUserSpaceOnUse:\n            boundaries = ctx.lengthContext().resolveRect(x, y, w, h);\n            break;\n        case SkSVGObjectBoundingBoxUnits::Type::kObjectBoundingBox: {\n            SkASSERT(ctx.node());\n            const SkRect objBounds = ctx.node()->objectBoundingBox(ctx);\n            boundaries = SkSVGLengthContext({1, 1}).resolveRect(x, y, w, h);\n            boundaries = SkRect::MakeXYWH(objBounds.fLeft + boundaries.fLeft * objBounds.width(),\n                                          objBounds.fTop + boundaries.fTop * objBounds.height(),\n                                          boundaries.width() * objBounds.width(),\n                                          boundaries.height() * objBounds.height());\n\n            break;\n        }\n    }\n\n    return boundaries;\n}\n\nstatic bool AnyIsStandardInput(const std::vector<SkSVGFeInputType>& inputs) {\n    for (const auto& in : inputs) {\n        if (in.type() != SkSVGFeInputType::Type::kFilterPrimitiveReference) {\n            return true;\n        }\n    }\n    return false;\n}\n\nSkRect SkSVGFe::resolveFilterSubregion(const SkSVGRenderContext& ctx,\n                                       const SkSVGFilterContext& fctx) const {\n    \/\/ From https:\/\/www.w3.org\/TR\/SVG11\/filters.html#FilterPrimitiveSubRegion,\n    \/\/ the default filter effect subregion is equal to the union of the subregions defined\n    \/\/ for all \"referenced nodes\" (filter effect inputs). If there are no inputs, the\n    \/\/ default subregion is equal to the filter effects region\n    \/\/ (https:\/\/www.w3.org\/TR\/SVG11\/filters.html#FilterEffectsRegion).\n    const std::vector<SkSVGFeInputType> inputs = this->getInputs();\n    SkRect subregion;\n    if (inputs.empty() || AnyIsStandardInput(inputs)) {\n        subregion = fctx.filterEffectsRegion();\n    } else {\n        subregion = fctx.filterPrimitiveSubregion(inputs[0]);\n        for (size_t i = 1; i < inputs.size(); i++) {\n            subregion.join(fctx.filterPrimitiveSubregion(inputs[i]));\n        }\n    }\n\n    \/\/ Next resolve the rect specified by the x, y, width, height attributes on this filter effect.\n    \/\/ If those attributes were given, they override the corresponding attribute of the default\n    \/\/ filter effect subregion calculated above.\n    const SkRect boundaries = this->resolveBoundaries(ctx, fctx);\n    if (fX.isValid()) {\n        subregion.fLeft = boundaries.fLeft;\n    }\n    if (fY.isValid()) {\n        subregion.fTop = boundaries.fTop;\n    }\n    if (fWidth.isValid()) {\n        subregion.fRight = subregion.fLeft + boundaries.width();\n    }\n    if (fHeight.isValid()) {\n        subregion.fBottom = subregion.fTop + boundaries.height();\n    }\n\n    return subregion;\n}\n\nSkSVGColorspace SkSVGFe::resolveColorspace(const SkSVGRenderContext& ctx) const {\n    constexpr SkSVGColorspace kDefaultCS = SkSVGColorspace::kSRGB;\n    const SkSVGColorspace cs = *ctx.presentationContext().fInherited.fColorInterpolationFilters;\n    return cs == SkSVGColorspace::kAuto ? kDefaultCS : cs;\n}\n\nvoid SkSVGFe::applyProperties(SkSVGRenderContext* ctx) const { this->onPrepareToRender(ctx); }\n\nbool SkSVGFe::parseAndSetAttribute(const char* name, const char* value) {\n    return INHERITED::parseAndSetAttribute(name, value) ||\n           this->setIn(SkSVGAttributeParser::parse<SkSVGFeInputType>(\"in\", name, value)) ||\n           this->setResult(SkSVGAttributeParser::parse<SkSVGStringType>(\"result\", name, value)) ||\n           this->setX(SkSVGAttributeParser::parse<SkSVGLength>(\"x\", name, value)) ||\n           this->setY(SkSVGAttributeParser::parse<SkSVGLength>(\"y\", name, value)) ||\n           this->setWidth(SkSVGAttributeParser::parse<SkSVGLength>(\"width\", name, value)) ||\n           this->setHeight(SkSVGAttributeParser::parse<SkSVGLength>(\"height\", name, value));\n}\n\ntemplate <> bool SkSVGAttributeParser::parse(SkSVGFeInputType* type) {\n    static constexpr std::tuple<const char*, SkSVGFeInputType::Type> gTypeMap[] = {\n            {\"SourceGraphic\", SkSVGFeInputType::Type::kSourceGraphic},\n            {\"SourceAlpha\", SkSVGFeInputType::Type::kSourceAlpha},\n            {\"BackgroundImage\", SkSVGFeInputType::Type::kBackgroundImage},\n            {\"BackgroundAlpha\", SkSVGFeInputType::Type::kBackgroundAlpha},\n            {\"FillPaint\", SkSVGFeInputType::Type::kFillPaint},\n            {\"StrokePaint\", SkSVGFeInputType::Type::kStrokePaint},\n    };\n\n    SkSVGStringType resultId;\n    SkSVGFeInputType::Type t;\n    bool parsedValue = false;\n    if (this->parseEnumMap(gTypeMap, &t)) {\n        *type = SkSVGFeInputType(t);\n        parsedValue = true;\n    } else if (parse(&resultId)) {\n        *type = SkSVGFeInputType(resultId);\n        parsedValue = true;\n    }\n\n    return parsedValue && this->parseEOSToken();\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>leak on short read<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ placementtrans.hxx -- class for carrying transforms for placing models in the world\n\/\/\n\/\/ Written by Mathias Froehlich, started April 2005.\n\/\/\n\/\/ Copyright (C) 2005 Mathias Froehlich\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., 675 Mass Ave, Cambridge, MA 02139, USA.\n\/\/\n\n\n#ifndef __cplusplus                                                          \n# error This library requires C++\n#endif                                   \n\n#include <simgear\/compiler.h>\n#include <simgear\/constants.h>\n\n#include <plib\/sg.h>\n#include <plib\/ssg.h>\n\n#include \"placementtrans.hxx\"\n\nssgPlacementTransform::ssgPlacementTransform(void)\n{\n}\n\nssgPlacementTransform::~ssgPlacementTransform(void)\n{\n}\n\nssgBase *ssgPlacementTransform::clone(int clone_flags)\n{\n  ssgPlacementTransform *b = new ssgPlacementTransform;\n  b->copy_from(this, clone_flags);\n  return b;\n}\n\nvoid\nssgPlacementTransform::copy_from(ssgPlacementTransform *src, int clone_flags)\n{\n  ssgBaseTransform::copy_from(src, clone_flags);\n  sgdCopyVec3(_placement_offset, src->_placement_offset);\n  sgdCopyVec3(_scenery_center,  src->_scenery_center);\n}\n\nvoid ssgPlacementTransform::setTransform(sgdVec3 off)\n{\n  sgdCopyVec3(_placement_offset, off);\n  sgdVec3 tmp;\n  sgdSubVec3(tmp, _placement_offset, _scenery_center);\n  sgMat4 tmat;\n  sgZeroVec4(tmat[0]);\n  tmat[0][0] = 1;\n  sgZeroVec4(tmat[1]);\n  tmat[1][1] = 1;\n  sgZeroVec4(tmat[2]);\n  tmat[2][2] = 1;\n  sgSetVec3(tmat[3], tmp);\n  tmat[3][3] = 1;\n  ssgTransform::setTransform(tmat);\n}\n\nvoid ssgPlacementTransform::setTransform(sgdVec3 off, sgMat4 rot)\n{\n  sgdCopyVec3(_placement_offset, off);\n  sgdVec3 tmp;\n  sgdSubVec3(tmp, _placement_offset, _scenery_center);\n  sgMat4 tmat;\n  sgCopyVec4(tmat[0], rot[0]);\n  sgCopyVec4(tmat[1], rot[1]);\n  sgCopyVec4(tmat[2], rot[2]);\n  sgSetVec3(tmat[3], tmp);\n  tmat[3][3] = 1;\n  ssgTransform::setTransform(tmat);\n}\n\nvoid ssgPlacementTransform::setSceneryCenter(sgdVec3 xyz)\n{\n  sgdCopyVec3(_scenery_center, xyz);\n  sgdVec3 tmp;\n  sgdSubVec3(tmp, _placement_offset, _scenery_center);\n  sgMat4 tmat;\n  getTransform(tmat);\n  sgSetVec3(tmat[3], tmp);\n  ssgTransform::setTransform(tmat);\n}\n<commit_msg>Mathias: silence some valgrind warnings so that you can concentrate better on the real problems.<commit_after>\/\/ placementtrans.hxx -- class for carrying transforms for placing models in the world\n\/\/\n\/\/ Written by Mathias Froehlich, started April 2005.\n\/\/\n\/\/ Copyright (C) 2005 Mathias Froehlich\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., 675 Mass Ave, Cambridge, MA 02139, USA.\n\/\/\n\n\n#ifndef __cplusplus                                                          \n# error This library requires C++\n#endif                                   \n\n#include <simgear\/compiler.h>\n#include <simgear\/constants.h>\n\n#include <plib\/sg.h>\n#include <plib\/ssg.h>\n\n#include \"placementtrans.hxx\"\n\nssgPlacementTransform::ssgPlacementTransform(void)\n{\n  sgdSetVec3(_placement_offset, 0, 0, 0);\n  sgdSetVec3(_scenery_center, 0, 0, 0);\n}\n\nssgPlacementTransform::~ssgPlacementTransform(void)\n{\n}\n\nssgBase *ssgPlacementTransform::clone(int clone_flags)\n{\n  ssgPlacementTransform *b = new ssgPlacementTransform;\n  b->copy_from(this, clone_flags);\n  return b;\n}\n\nvoid\nssgPlacementTransform::copy_from(ssgPlacementTransform *src, int clone_flags)\n{\n  ssgBaseTransform::copy_from(src, clone_flags);\n  sgdCopyVec3(_placement_offset, src->_placement_offset);\n  sgdCopyVec3(_scenery_center,  src->_scenery_center);\n}\n\nvoid ssgPlacementTransform::setTransform(sgdVec3 off)\n{\n  sgdCopyVec3(_placement_offset, off);\n  sgdVec3 tmp;\n  sgdSubVec3(tmp, _placement_offset, _scenery_center);\n  sgMat4 tmat;\n  sgZeroVec4(tmat[0]);\n  tmat[0][0] = 1;\n  sgZeroVec4(tmat[1]);\n  tmat[1][1] = 1;\n  sgZeroVec4(tmat[2]);\n  tmat[2][2] = 1;\n  sgSetVec3(tmat[3], tmp);\n  tmat[3][3] = 1;\n  ssgTransform::setTransform(tmat);\n}\n\nvoid ssgPlacementTransform::setTransform(sgdVec3 off, sgMat4 rot)\n{\n  sgdCopyVec3(_placement_offset, off);\n  sgdVec3 tmp;\n  sgdSubVec3(tmp, _placement_offset, _scenery_center);\n  sgMat4 tmat;\n  sgCopyVec4(tmat[0], rot[0]);\n  sgCopyVec4(tmat[1], rot[1]);\n  sgCopyVec4(tmat[2], rot[2]);\n  sgSetVec3(tmat[3], tmp);\n  tmat[3][3] = 1;\n  ssgTransform::setTransform(tmat);\n}\n\nvoid ssgPlacementTransform::setSceneryCenter(sgdVec3 xyz)\n{\n  sgdCopyVec3(_scenery_center, xyz);\n  sgdVec3 tmp;\n  sgdSubVec3(tmp, _placement_offset, _scenery_center);\n  sgMat4 tmat;\n  getTransform(tmat);\n  sgSetVec3(tmat[3], tmp);\n  ssgTransform::setTransform(tmat);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Written by Nitin Kumar Maharana\n * nitin.maharana@gmail.com\n *\/\n\n\/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}\n * };\n *\/\n\n\/\/Iterative Solution.\nclass Solution {\npublic:\n    vector<int> inorderTraversal(TreeNode* root) {\n        vector<int> result;\n        \n        if(!root)\n            return result;\n        \n        stack<TreeNode*> memory;\n        \n        while(!memory.empty() || root)\n        {\n            if(!root)\n            {\n                if(!memory.empty())\n                {\n                    root = memory.top();\n                    memory.pop();\n                    result.push_back(root->val);\n                    root = root->right;\n                }\n            }\n            else\n            {\n                memory.push(root);\n                root = root->left;\n            }\n        }\n        \n        return result;\n    }\n};\n\n\/\/Recursive Solution.\nclass Solution {\n    vector<int> result;\n    \n    void inorderTraversalUtil(TreeNode *root)\n    {\n        if(!root)\n            return;\n        \n        inorderTraversalUtil(root->left);\n        result.push_back(root->val);\n        inorderTraversalUtil(root->right);\n    }\npublic:\n    vector<int> inorderTraversal(TreeNode* root) {\n        inorderTraversalUtil(root);\n        return result;\n    }\n};\n<commit_msg>Update 94.cpp<commit_after>\/*\n * Written by Nitin Kumar Maharana\n * nitin.maharana@gmail.com\n *\/\n\n\/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}\n * };\n *\/\n\n\/\/Iterative Solution.\nclass Solution {\npublic:\n    vector<int> inorderTraversal(TreeNode* root) {\n        vector<int> result;\n        \n        if(!root)\n            return result;\n        \n        stack<TreeNode*> memory;\n        \n        while(!memory.empty() || root)\n        {\n            if(!root)\n            {\n                root = memory.top();\n                memory.pop();\n                result.push_back(root->val);\n                root = root->right;\n            }\n            else\n            {\n                memory.push(root);\n                root = root->left;\n            }\n        }\n        \n        return result;\n    }\n};\n\n\/\/Recursive Solution.\nclass Solution {\n    vector<int> result;\n    \n    void inorderTraversalUtil(TreeNode *root)\n    {\n        if(!root)\n            return;\n        \n        inorderTraversalUtil(root->left);\n        result.push_back(root->val);\n        inorderTraversalUtil(root->right);\n    }\npublic:\n    vector<int> inorderTraversal(TreeNode* root) {\n        inorderTraversalUtil(root);\n        return result;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/  \n\/\/ Copyright (C) 2006-2007 SIPez LLC. \n\/\/ Licensed to SIPfoundry under a Contributor Agreement. \n\/\/\n\/\/ Copyright (C) 2004-2007 SIPfoundry Inc.\n\/\/ Licensed by SIPfoundry under the LGPL license.\n\/\/\n\/\/ Copyright (C) 2004-2006 Pingtel Corp.  All rights reserved.\n\/\/ Licensed to SIPfoundry under a Contributor Agreement.\n\/\/\n\/\/ $$\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ SYSTEM INCLUDES\n#include <assert.h>\n\n\/\/ APPLICATION INCLUDES\n#include <utl\/UtlInit.h> \/\/ KEEP THIS ONE THE FIRST INCLUDE\n\n#include <mp\/MpCodecFactory.h>\n#include <mp\/MpPlgEncoderWrap.h>\n#include <mp\/MpPlgDecoderWrap.h>\n#include <os\/OsSysLog.h>\n#include <os\/OsSharedLibMgr.h>\n#include <os\/OsFS.h>\n#include <utl\/UtlSListIterator.h>\n\n\/\/ EXTERNAL FUNCTIONS\n\/\/ EXTERNAL VARIABLES\n\/\/ CONSTANTS\n\/\/ TYPEDEFS\n\/\/ DEFINES\n\/\/ MACROS\n\/\/ LOCAL TYPES DECLARATIONS\nclass MpCodecSubInfo : public UtlVoidPtr\n{\npublic:\n\n   MpCodecSubInfo(MpCodecCallInfoV1* pCodecCall,\n                  const char* pMimeSubtype)\n      : mpCodecCall(pCodecCall)\n      , mpMimeSubtype(pMimeSubtype)\n   {\n   }\n\n   ~MpCodecSubInfo()\n   {\n      if (!mpCodecCall->isStatic())\n         delete mpCodecCall;\n   }\n\n   const char* getMIMEtype() const\n   { return mpMimeSubtype; }\n\n   MpCodecCallInfoV1* getCodecCall() const\n   { return mpCodecCall; }\n\nprotected:\n   MpCodecCallInfoV1* mpCodecCall;\n   const char* mpMimeSubtype;\n};\n\n\/\/ STATIC VARIABLE INITIALIZATIONS\nMpCodecFactory* MpCodecFactory::spInstance = NULL;\nOsBSem MpCodecFactory::sLock(OsBSem::Q_PRIORITY, OsBSem::FULL);\n\n\/* ============================ CREATORS ================================== *\/\n\n\/\/ Return a pointer to the MpCodecFactory singleton object, creating \n\/\/ it if necessary\nMpCodecFactory* MpCodecFactory::getMpCodecFactory(void)\n{\n   \/\/ If the object already exists, then use it\n   if (spInstance == NULL)\n   {\n      \/\/ If the object does not yet exist, then acquire\n      \/\/ the lock to ensure that only one instance of the object is \n      \/\/ created\n      sLock.acquire();\n      if (spInstance == NULL)\n         spInstance = new MpCodecFactory();\n      sLock.release();\n   }\n   return spInstance;\n}\n\nMpCodecFactory::MpCodecFactory(void)\n: fCacheListMustUpdate(FALSE)\n{\n   initializeStaticCodecs();\n}\n\nMpCodecFactory::~MpCodecFactory()\n{\n   freeAllLoadedLibsAndCodec();\n\n   MpCodecSubInfo* pinfo;\n\n   UtlSListIterator iter(mCodecsInfo);\n   while ((pinfo = (MpCodecSubInfo*)iter()))\n   { \n      if (!pinfo->getCodecCall()->mbStatic) {\n         assert(!\"Dynamically loaded codecs must be unloaded already\");\n      }\n      delete pinfo;     \n   }\n   mCodecsInfo.removeAll();\n}\n\n\/* ============================= MANIPULATORS ============================= *\/\n\nOsStatus MpCodecFactory::createDecoder(const UtlString &mime,\n                                       const UtlString &fmtp,\n                                       int payloadType,\n                                       MpDecoderBase*& rpDecoder)\n{\n   MpCodecSubInfo* codec = searchByMIME(mime);\n \n   if (codec)\n   {      \n      rpDecoder = new MpPlgDecoderWrapper(payloadType, *codec->getCodecCall(), fmtp);\n   }\n   else\n   {\n      OsSysLog::add(FAC_MP, PRI_WARNING, \n                    \"MpCodecFactory::createDecoder unknown codec type \"\n                    \"%s, fmtp=%s\"\n                    \"payloadType = %d\",\n                    mime.data(), fmtp.data(), payloadType);\n\n      assert(!\"Could not find codec of given type!\");\n      rpDecoder=NULL;\n   }\n\n   if (NULL != rpDecoder) \n   {\n      return OS_SUCCESS;\n   }\n\n   return OS_INVALID_ARGUMENT;\n}\n\nOsStatus MpCodecFactory::createEncoder(const UtlString &mime,\n                                       const UtlString &fmtp,\n                                       int payloadType,\n                                       MpEncoderBase*& rpEncoder)\n{\n   MpCodecSubInfo* codec = searchByMIME(mime);\n\n   if (codec)\n   {      \n      rpEncoder = new MpPlgEncoderWrapper(payloadType, *codec->getCodecCall(), fmtp);\n   }\n   else\n   {\n      OsSysLog::add(FAC_MP, PRI_WARNING, \n                    \"MpCodecFactory::createEncoder unknown codec type \"\n                    \"internalCodecId = (SdpCodec::SdpCodecTypes) %d, \"\n                    \"%s, fmtp=%s\"\n                    \"payloadType = %d\",\n                    mime.data(), fmtp.data(), payloadType);\n      assert(!\"Could not find codec of given type!\");\n      rpEncoder=NULL;\n   }\n\n   if (NULL != rpEncoder) \n   {\n      return OS_SUCCESS;\n   }\n\n   return OS_INVALID_ARGUMENT;\n}\n\nMpCodecCallInfoV1* MpCodecFactory::addStaticCodec(MpCodecCallInfoV1* sStaticCode)\n{\n    sStaticCodecsV1 = (MpCodecCallInfoV1 *)sStaticCode->bound(MpCodecFactory::sStaticCodecsV1);\n    return sStaticCodecsV1;\n}\n\nvoid MpCodecFactory::freeSingletonHandle()\n{\n   sLock.acquire();\n   if (spInstance != NULL)\n   {\n      delete spInstance;\n      spInstance = NULL;\n   }\n   sLock.release();\n}\n\nvoid MpCodecFactory::globalCleanUp()\n{\n   sLock.acquire();\n   MpCodecCallInfoV1* tmp = sStaticCodecsV1;\n   MpCodecCallInfoV1* next;\n   if (tmp) {\n      for ( ;tmp; tmp = next)\n      {\n         next = tmp->next();\n         delete tmp;\n      }\n      sStaticCodecsV1 = NULL;\n   }\n   sLock.release();\n}\n\nvoid MpCodecFactory::freeAllLoadedLibsAndCodec()\n{\n   OsSharedLibMgrBase* pShrMgr = OsSharedLibMgr::getOsSharedLibMgr();\n\n   UtlSListIterator iter(mCodecsInfo);\n   MpCodecSubInfo* pinfo;\n\n   UtlSList libLoaded;\n   UtlString* libName;\n\n   while ((pinfo = (MpCodecSubInfo*)iter()))\n   {  \n      if ((!pinfo->getCodecCall()->mbStatic) && \n         (!libLoaded.find(&pinfo->getCodecCall()->mModuleName))) {\n         libLoaded.insert(&pinfo->getCodecCall()->mModuleName);         \n      }    \n   }\n\n   UtlSListIterator iter2(libLoaded);\n   while ((libName = (UtlString*)iter2()))\n   {\n      pShrMgr->unloadSharedLib(libName->data());\n   }\n\n   iter.reset();\n   while ((pinfo = (MpCodecSubInfo*)iter()))\n   {  \n      if (!pinfo->getCodecCall()->mbStatic) {\n         mCodecsInfo.remove(pinfo);\n         delete pinfo;         \n      }\n   }\n\n   fCacheListMustUpdate = TRUE;\n}\n\nOsStatus MpCodecFactory::loadAllDynCodecs(const char* path, const char* regexFilter)\n{\n   OsPath ospath = path;\n   OsPath module;\n   OsFileIterator fi(ospath);\n\n   OsStatus res;\n   res = fi.findFirst(module, regexFilter);\n\n   if (res != OS_SUCCESS) \n      return OS_FAILED;\n\n   do {\n      UtlString str = path;\n      str += \"\\\\\";\n      str += module.data();\n      loadDynCodec(str.data());\n   } while (fi.findNext(module) == OS_SUCCESS);\n\n   return OS_SUCCESS;\n}\n\nOsStatus MpCodecFactory::loadDynCodec(const char* name)\n{\n   OsStatus res;\n   OsSharedLibMgrBase* pShrMgr = OsSharedLibMgr::getOsSharedLibMgr();\n   \n   res = pShrMgr->loadSharedLib(name);\n   if (res != OS_SUCCESS)\n   {\n      return OS_FAILED;\n   }\n \n   void* address;   \n   res = pShrMgr->getSharedLibSymbol(name, MSK_GET_CODEC_NAME_V1, address);\n   if (res != OS_SUCCESS)\n   {\n      pShrMgr->unloadSharedLib(name);\n      return OS_FAILED;\n   }\n\n   dlGetCodecsV1 getCodecsV1 = (dlGetCodecsV1)address;\n   const char* codecName;\n   int i, r, count = 0;\n\n   \/\/ 100 is a watchdog value, should be enough for everyone.\n   for (i = 0; (i < 100); i++) \n   {\n      r = getCodecsV1(i, &codecName);\n      if ((r != RPLG_SUCCESS) || (codecName == NULL)) \n      {\n         if (count == 0) {\n            pShrMgr->unloadSharedLib(name);\n            return OS_FAILED;\n         }\n         return OS_SUCCESS;\n      }\n\n      \/\/ Obtaining codecs functions\n      UtlBoolean st;\n      UtlBoolean stSignaling;\n\n      UtlString strCodecName = codecName;\n      UtlString dlNameInit = strCodecName + MSK_INIT_V1;\n      UtlString dlNameDecode = strCodecName + MSK_DECODE_V1;\n      UtlString dlNameEncdoe = strCodecName + MSK_ENCODE_V1;\n      UtlString dlNameFree = strCodecName + MSK_FREE_V1;\n      UtlString dlNameEnum = strCodecName + MSK_ENUM_V1;\n      UtlString dlNameSignaling = strCodecName + MSK_SIGNALING_V1;\n      \n      dlPlgInitV1 plgInitAddr;\n      dlPlgDecodeV1 plgDecodeAddr;\n      dlPlgEncodeV1 plgEncodeAddr;\n      dlPlgFreeV1 plgFreeAddr;\n      dlPlgEnumSDPAndModesV1 plgEnum;\n      dlPlgGetSignalingDataV1 plgSignaling;\n\n      st = TRUE \n         && (pShrMgr->getSharedLibSymbol(name, dlNameInit, address) == OS_SUCCESS)\n         && ((plgInitAddr = (dlPlgInitV1)address) != NULL)\n         && (pShrMgr->getSharedLibSymbol(name, dlNameDecode, address) == OS_SUCCESS)\n         && ((plgDecodeAddr = (dlPlgDecodeV1)address) != NULL)\n         && (pShrMgr->getSharedLibSymbol(name, dlNameEncdoe, address) == OS_SUCCESS)\n         && ((plgEncodeAddr = (dlPlgEncodeV1)address) != NULL)\n         && (pShrMgr->getSharedLibSymbol(name, dlNameFree, address) == OS_SUCCESS)\n         && ((plgFreeAddr = (dlPlgFreeV1)address) != NULL)\n         && (pShrMgr->getSharedLibSymbol(name, dlNameEnum, address) == OS_SUCCESS)\n         && ((plgEnum = (dlPlgEnumSDPAndModesV1)address) != NULL);\n\n      stSignaling = st \n         && (pShrMgr->getSharedLibSymbol(name, dlNameSignaling, address) == OS_SUCCESS)  \n         && ((plgSignaling = (dlPlgGetSignalingDataV1)address) != NULL);\n\n      if (!stSignaling)\n            plgSignaling = NULL;\n\n      \/\/ Test if the codec could enumerate SDP\n      unsigned enumCount;\n      const char *mime;\n      const char **tmp;\n      UtlBoolean bPlgCouldEnum = (plgEnum(&mime, &enumCount, &tmp) == RPLG_SUCCESS);\n\n      if (st &&  bPlgCouldEnum)\n      {\n         \/\/Add codec to list\n         MpCodecCallInfoV1* pci = new MpCodecCallInfoV1(name, codecName, \n            plgInitAddr, plgDecodeAddr, plgEncodeAddr, \n            plgFreeAddr, plgEnum, plgSignaling, FALSE);\n\n         if (!pci)\n            continue;         \n\n         if (addCodecWrapperV1(pci) != OS_SUCCESS)\n         {\n            delete pci;\n            continue;\n         }\n\n         \/\/Plugin has been added successfully, need to rebuild cache list\n         fCacheListMustUpdate = TRUE;\n         count ++;\n      }\n   }\n   if (count == 0) {\n      pShrMgr->unloadSharedLib(name);\n      return OS_FAILED;\n   }\n   return OS_SUCCESS;\n}\n\nOsStatus MpCodecFactory::addCodecWrapperV1(MpCodecCallInfoV1* wrapper)\n{\n   MpCodecSubInfo* mpsi;\n   const char* mimeSubtype;\n\n   \/\/ Get codec's MIME-subtype and recommended modes.\n   int res = wrapper->mPlgEnum(&mimeSubtype, NULL, NULL);\n   if (res != RPLG_SUCCESS)\n   {\n      return OS_FAILED;\n   }\n\n   mpsi = new MpCodecSubInfo(wrapper, mimeSubtype);\n   if (mpsi == NULL) {\n      return OS_NO_MEMORY;\n   }\n\n   sLock.acquire();\n   mCodecsInfo.insert(mpsi);\n   sLock.release();\n\n   return OS_SUCCESS;\n}\n\nvoid MpCodecFactory::initializeStaticCodecs() \/\/Should be called from mpStartup()\n{\n   MpCodecCallInfoV1* tmp = sStaticCodecsV1;\n   for ( ;tmp; tmp = tmp->next())\n   {\n      addCodecWrapperV1(tmp);\n   }\n}\n\n\/* ============================== ACCESSORS =============================== *\/\n\nSdpCodec::SdpCodecTypes* MpCodecFactory::getAllCodecTypes(unsigned& count)\n{\n   \/\/ NOT implemented yet\n   return NULL;\n}\n\nconst char** MpCodecFactory::getAllCodecModes(SdpCodec::SdpCodecTypes codecId, unsigned& count)\n{\n   \/\/ NOT implemented yet\n   return NULL;\n}\n\nvoid MpCodecFactory::updateCodecArray(void)\n{\n   \/\/ NOT implemented yet\n}\n\n\/* =============================== INQUIRY ================================ *\/\n\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PROTECTED \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\nMpCodecSubInfo* MpCodecFactory::searchByMIME(const UtlString& mime) const\n{\n   UtlSListIterator iter(mCodecsInfo);\n   MpCodecSubInfo* pinfo;\n\n   while ((pinfo = (MpCodecSubInfo*)iter()))\n   { \n      if (mime.compareTo(pinfo->getMIMEtype(), UtlString::ignoreCase) == 0)\n      {\n         return pinfo;\n      }\n   }\n\n   return NULL;\n}\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PRIVATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\n\/* ============================== FUNCTIONS =============================== *\/\n<commit_msg>Remove leaved by mistake MpCodecFactory method.<commit_after>\/\/  \n\/\/ Copyright (C) 2006-2007 SIPez LLC. \n\/\/ Licensed to SIPfoundry under a Contributor Agreement. \n\/\/\n\/\/ Copyright (C) 2004-2007 SIPfoundry Inc.\n\/\/ Licensed by SIPfoundry under the LGPL license.\n\/\/\n\/\/ Copyright (C) 2004-2006 Pingtel Corp.  All rights reserved.\n\/\/ Licensed to SIPfoundry under a Contributor Agreement.\n\/\/\n\/\/ $$\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ SYSTEM INCLUDES\n#include <assert.h>\n\n\/\/ APPLICATION INCLUDES\n#include <utl\/UtlInit.h> \/\/ KEEP THIS ONE THE FIRST INCLUDE\n\n#include <mp\/MpCodecFactory.h>\n#include <mp\/MpPlgEncoderWrap.h>\n#include <mp\/MpPlgDecoderWrap.h>\n#include <os\/OsSysLog.h>\n#include <os\/OsSharedLibMgr.h>\n#include <os\/OsFS.h>\n#include <utl\/UtlSListIterator.h>\n\n\/\/ EXTERNAL FUNCTIONS\n\/\/ EXTERNAL VARIABLES\n\/\/ CONSTANTS\n\/\/ TYPEDEFS\n\/\/ DEFINES\n\/\/ MACROS\n\/\/ LOCAL TYPES DECLARATIONS\nclass MpCodecSubInfo : public UtlVoidPtr\n{\npublic:\n\n   MpCodecSubInfo(MpCodecCallInfoV1* pCodecCall,\n                  const char* pMimeSubtype)\n      : mpCodecCall(pCodecCall)\n      , mpMimeSubtype(pMimeSubtype)\n   {\n   }\n\n   ~MpCodecSubInfo()\n   {\n      if (!mpCodecCall->isStatic())\n         delete mpCodecCall;\n   }\n\n   const char* getMIMEtype() const\n   { return mpMimeSubtype; }\n\n   MpCodecCallInfoV1* getCodecCall() const\n   { return mpCodecCall; }\n\nprotected:\n   MpCodecCallInfoV1* mpCodecCall;\n   const char* mpMimeSubtype;\n};\n\n\/\/ STATIC VARIABLE INITIALIZATIONS\nMpCodecFactory* MpCodecFactory::spInstance = NULL;\nOsBSem MpCodecFactory::sLock(OsBSem::Q_PRIORITY, OsBSem::FULL);\n\n\/* ============================ CREATORS ================================== *\/\n\n\/\/ Return a pointer to the MpCodecFactory singleton object, creating \n\/\/ it if necessary\nMpCodecFactory* MpCodecFactory::getMpCodecFactory(void)\n{\n   \/\/ If the object already exists, then use it\n   if (spInstance == NULL)\n   {\n      \/\/ If the object does not yet exist, then acquire\n      \/\/ the lock to ensure that only one instance of the object is \n      \/\/ created\n      sLock.acquire();\n      if (spInstance == NULL)\n         spInstance = new MpCodecFactory();\n      sLock.release();\n   }\n   return spInstance;\n}\n\nMpCodecFactory::MpCodecFactory(void)\n: fCacheListMustUpdate(FALSE)\n{\n   initializeStaticCodecs();\n}\n\nMpCodecFactory::~MpCodecFactory()\n{\n   freeAllLoadedLibsAndCodec();\n\n   MpCodecSubInfo* pinfo;\n\n   UtlSListIterator iter(mCodecsInfo);\n   while ((pinfo = (MpCodecSubInfo*)iter()))\n   { \n      if (!pinfo->getCodecCall()->mbStatic) {\n         assert(!\"Dynamically loaded codecs must be unloaded already\");\n      }\n      delete pinfo;     \n   }\n   mCodecsInfo.removeAll();\n}\n\n\/* ============================= MANIPULATORS ============================= *\/\n\nOsStatus MpCodecFactory::createDecoder(const UtlString &mime,\n                                       const UtlString &fmtp,\n                                       int payloadType,\n                                       MpDecoderBase*& rpDecoder)\n{\n   MpCodecSubInfo* codec = searchByMIME(mime);\n \n   if (codec)\n   {      \n      rpDecoder = new MpPlgDecoderWrapper(payloadType, *codec->getCodecCall(), fmtp);\n   }\n   else\n   {\n      OsSysLog::add(FAC_MP, PRI_WARNING, \n                    \"MpCodecFactory::createDecoder unknown codec type \"\n                    \"%s, fmtp=%s\"\n                    \"payloadType = %d\",\n                    mime.data(), fmtp.data(), payloadType);\n\n      assert(!\"Could not find codec of given type!\");\n      rpDecoder=NULL;\n   }\n\n   if (NULL != rpDecoder) \n   {\n      return OS_SUCCESS;\n   }\n\n   return OS_INVALID_ARGUMENT;\n}\n\nOsStatus MpCodecFactory::createEncoder(const UtlString &mime,\n                                       const UtlString &fmtp,\n                                       int payloadType,\n                                       MpEncoderBase*& rpEncoder)\n{\n   MpCodecSubInfo* codec = searchByMIME(mime);\n\n   if (codec)\n   {      \n      rpEncoder = new MpPlgEncoderWrapper(payloadType, *codec->getCodecCall(), fmtp);\n   }\n   else\n   {\n      OsSysLog::add(FAC_MP, PRI_WARNING, \n                    \"MpCodecFactory::createEncoder unknown codec type \"\n                    \"internalCodecId = (SdpCodec::SdpCodecTypes) %d, \"\n                    \"%s, fmtp=%s\"\n                    \"payloadType = %d\",\n                    mime.data(), fmtp.data(), payloadType);\n      assert(!\"Could not find codec of given type!\");\n      rpEncoder=NULL;\n   }\n\n   if (NULL != rpEncoder) \n   {\n      return OS_SUCCESS;\n   }\n\n   return OS_INVALID_ARGUMENT;\n}\n\nMpCodecCallInfoV1* MpCodecFactory::addStaticCodec(MpCodecCallInfoV1* sStaticCode)\n{\n    sStaticCodecsV1 = (MpCodecCallInfoV1 *)sStaticCode->bound(MpCodecFactory::sStaticCodecsV1);\n    return sStaticCodecsV1;\n}\n\nvoid MpCodecFactory::freeSingletonHandle()\n{\n   sLock.acquire();\n   if (spInstance != NULL)\n   {\n      delete spInstance;\n      spInstance = NULL;\n   }\n   sLock.release();\n}\n\nvoid MpCodecFactory::globalCleanUp()\n{\n   sLock.acquire();\n   MpCodecCallInfoV1* tmp = sStaticCodecsV1;\n   MpCodecCallInfoV1* next;\n   if (tmp) {\n      for ( ;tmp; tmp = next)\n      {\n         next = tmp->next();\n         delete tmp;\n      }\n      sStaticCodecsV1 = NULL;\n   }\n   sLock.release();\n}\n\nvoid MpCodecFactory::freeAllLoadedLibsAndCodec()\n{\n   OsSharedLibMgrBase* pShrMgr = OsSharedLibMgr::getOsSharedLibMgr();\n\n   UtlSListIterator iter(mCodecsInfo);\n   MpCodecSubInfo* pinfo;\n\n   UtlSList libLoaded;\n   UtlString* libName;\n\n   while ((pinfo = (MpCodecSubInfo*)iter()))\n   {  \n      if ((!pinfo->getCodecCall()->mbStatic) && \n         (!libLoaded.find(&pinfo->getCodecCall()->mModuleName))) {\n         libLoaded.insert(&pinfo->getCodecCall()->mModuleName);         \n      }    \n   }\n\n   UtlSListIterator iter2(libLoaded);\n   while ((libName = (UtlString*)iter2()))\n   {\n      pShrMgr->unloadSharedLib(libName->data());\n   }\n\n   iter.reset();\n   while ((pinfo = (MpCodecSubInfo*)iter()))\n   {  \n      if (!pinfo->getCodecCall()->mbStatic) {\n         mCodecsInfo.remove(pinfo);\n         delete pinfo;         \n      }\n   }\n\n   fCacheListMustUpdate = TRUE;\n}\n\nOsStatus MpCodecFactory::loadAllDynCodecs(const char* path, const char* regexFilter)\n{\n   OsPath ospath = path;\n   OsPath module;\n   OsFileIterator fi(ospath);\n\n   OsStatus res;\n   res = fi.findFirst(module, regexFilter);\n\n   if (res != OS_SUCCESS) \n      return OS_FAILED;\n\n   do {\n      UtlString str = path;\n      str += \"\\\\\";\n      str += module.data();\n      loadDynCodec(str.data());\n   } while (fi.findNext(module) == OS_SUCCESS);\n\n   return OS_SUCCESS;\n}\n\nOsStatus MpCodecFactory::loadDynCodec(const char* name)\n{\n   OsStatus res;\n   OsSharedLibMgrBase* pShrMgr = OsSharedLibMgr::getOsSharedLibMgr();\n   \n   res = pShrMgr->loadSharedLib(name);\n   if (res != OS_SUCCESS)\n   {\n      return OS_FAILED;\n   }\n \n   void* address;   \n   res = pShrMgr->getSharedLibSymbol(name, MSK_GET_CODEC_NAME_V1, address);\n   if (res != OS_SUCCESS)\n   {\n      pShrMgr->unloadSharedLib(name);\n      return OS_FAILED;\n   }\n\n   dlGetCodecsV1 getCodecsV1 = (dlGetCodecsV1)address;\n   const char* codecName;\n   int i, r, count = 0;\n\n   \/\/ 100 is a watchdog value, should be enough for everyone.\n   for (i = 0; (i < 100); i++) \n   {\n      r = getCodecsV1(i, &codecName);\n      if ((r != RPLG_SUCCESS) || (codecName == NULL)) \n      {\n         if (count == 0) {\n            pShrMgr->unloadSharedLib(name);\n            return OS_FAILED;\n         }\n         return OS_SUCCESS;\n      }\n\n      \/\/ Obtaining codecs functions\n      UtlBoolean st;\n      UtlBoolean stSignaling;\n\n      UtlString strCodecName = codecName;\n      UtlString dlNameInit = strCodecName + MSK_INIT_V1;\n      UtlString dlNameDecode = strCodecName + MSK_DECODE_V1;\n      UtlString dlNameEncdoe = strCodecName + MSK_ENCODE_V1;\n      UtlString dlNameFree = strCodecName + MSK_FREE_V1;\n      UtlString dlNameEnum = strCodecName + MSK_ENUM_V1;\n      UtlString dlNameSignaling = strCodecName + MSK_SIGNALING_V1;\n      \n      dlPlgInitV1 plgInitAddr;\n      dlPlgDecodeV1 plgDecodeAddr;\n      dlPlgEncodeV1 plgEncodeAddr;\n      dlPlgFreeV1 plgFreeAddr;\n      dlPlgEnumSDPAndModesV1 plgEnum;\n      dlPlgGetSignalingDataV1 plgSignaling;\n\n      st = TRUE \n         && (pShrMgr->getSharedLibSymbol(name, dlNameInit, address) == OS_SUCCESS)\n         && ((plgInitAddr = (dlPlgInitV1)address) != NULL)\n         && (pShrMgr->getSharedLibSymbol(name, dlNameDecode, address) == OS_SUCCESS)\n         && ((plgDecodeAddr = (dlPlgDecodeV1)address) != NULL)\n         && (pShrMgr->getSharedLibSymbol(name, dlNameEncdoe, address) == OS_SUCCESS)\n         && ((plgEncodeAddr = (dlPlgEncodeV1)address) != NULL)\n         && (pShrMgr->getSharedLibSymbol(name, dlNameFree, address) == OS_SUCCESS)\n         && ((plgFreeAddr = (dlPlgFreeV1)address) != NULL)\n         && (pShrMgr->getSharedLibSymbol(name, dlNameEnum, address) == OS_SUCCESS)\n         && ((plgEnum = (dlPlgEnumSDPAndModesV1)address) != NULL);\n\n      stSignaling = st \n         && (pShrMgr->getSharedLibSymbol(name, dlNameSignaling, address) == OS_SUCCESS)  \n         && ((plgSignaling = (dlPlgGetSignalingDataV1)address) != NULL);\n\n      if (!stSignaling)\n            plgSignaling = NULL;\n\n      \/\/ Test if the codec could enumerate SDP\n      unsigned enumCount;\n      const char *mime;\n      const char **tmp;\n      UtlBoolean bPlgCouldEnum = (plgEnum(&mime, &enumCount, &tmp) == RPLG_SUCCESS);\n\n      if (st &&  bPlgCouldEnum)\n      {\n         \/\/Add codec to list\n         MpCodecCallInfoV1* pci = new MpCodecCallInfoV1(name, codecName, \n            plgInitAddr, plgDecodeAddr, plgEncodeAddr, \n            plgFreeAddr, plgEnum, plgSignaling, FALSE);\n\n         if (!pci)\n            continue;         \n\n         if (addCodecWrapperV1(pci) != OS_SUCCESS)\n         {\n            delete pci;\n            continue;\n         }\n\n         \/\/Plugin has been added successfully, need to rebuild cache list\n         fCacheListMustUpdate = TRUE;\n         count ++;\n      }\n   }\n   if (count == 0) {\n      pShrMgr->unloadSharedLib(name);\n      return OS_FAILED;\n   }\n   return OS_SUCCESS;\n}\n\nOsStatus MpCodecFactory::addCodecWrapperV1(MpCodecCallInfoV1* wrapper)\n{\n   MpCodecSubInfo* mpsi;\n   const char* mimeSubtype;\n\n   \/\/ Get codec's MIME-subtype and recommended modes.\n   int res = wrapper->mPlgEnum(&mimeSubtype, NULL, NULL);\n   if (res != RPLG_SUCCESS)\n   {\n      return OS_FAILED;\n   }\n\n   mpsi = new MpCodecSubInfo(wrapper, mimeSubtype);\n   if (mpsi == NULL) {\n      return OS_NO_MEMORY;\n   }\n\n   sLock.acquire();\n   mCodecsInfo.insert(mpsi);\n   sLock.release();\n\n   return OS_SUCCESS;\n}\n\nvoid MpCodecFactory::initializeStaticCodecs() \/\/Should be called from mpStartup()\n{\n   MpCodecCallInfoV1* tmp = sStaticCodecsV1;\n   for ( ;tmp; tmp = tmp->next())\n   {\n      addCodecWrapperV1(tmp);\n   }\n}\n\n\/* ============================== ACCESSORS =============================== *\/\n\nSdpCodec::SdpCodecTypes* MpCodecFactory::getAllCodecTypes(unsigned& count)\n{\n   \/\/ NOT implemented yet\n   return NULL;\n}\n\nconst char** MpCodecFactory::getAllCodecModes(SdpCodec::SdpCodecTypes codecId, unsigned& count)\n{\n   \/\/ NOT implemented yet\n   return NULL;\n}\n\n\/* =============================== INQUIRY ================================ *\/\n\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PROTECTED \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\nMpCodecSubInfo* MpCodecFactory::searchByMIME(const UtlString& mime) const\n{\n   UtlSListIterator iter(mCodecsInfo);\n   MpCodecSubInfo* pinfo;\n\n   while ((pinfo = (MpCodecSubInfo*)iter()))\n   { \n      if (mime.compareTo(pinfo->getMIMEtype(), UtlString::ignoreCase) == 0)\n      {\n         return pinfo;\n      }\n   }\n\n   return NULL;\n}\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PRIVATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\n\/* ============================== FUNCTIONS =============================== *\/\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (c) 2008-2009 Nokia Corporation and\/or its subsidiary(-ies).\n**\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\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** If you have questions regarding the use of this file, please contact\n** Nokia at http:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <multimedia\/qradioplayer.h>\n#include <multimedia\/qmediaservice.h>\n#include <multimedia\/qmediaobject_p.h>\n#include <multimedia\/qradioplayercontrol.h>\n\n\n\n\/*!\n    \\class QRadioPlayer\n    \\brief The QRadioPlayer class provides an interface to the systems radio device.\n\n    You can control the systems radio device using this interface, for example:\n\n    \\code\n        player = new QRadioPlayer;\n        connect(player,SIGNAL(frequencyChanged(int)),this,SLOT(freqChanged(int)));\n        if(player->isSupportedBand(QRadioPlayer::FM))\n            player->setBand(QRadioPlayer::FM);\n        player->setFrequency(yourRadioStationFrequency);\n        player->setVolume(100);\n    \\endcode\n\n    The player object will emit signals for any changes in state such as:\n    bandChanged(), frequencyChanged(), stereoStatusChanged(), searchingStatusChanged(),\n    signalStrengthChanged(), durationChanged(), volumeChanged(), mutingChanged().\n\n    You can change between the frequency bands using setBand() however it is recommended\n    that you check to make sure the band is available first using isSupportedBand().\n\n*\/\n\n\nclass QRadioPlayerPrivate : public QMediaObjectPrivate\n{\npublic:\n    QRadioPlayerPrivate():provider(0), control(0) {}\n    QMediaServiceProvider *provider;\n    QRadioPlayerControl* control;\n};\n\n\n\n\/*!\n    Construct a QRadioPlayer object with service \\a provider and \\a parent.\n\n    If the service is not specified the system default will be used.\n*\/\n\nQRadioPlayer::QRadioPlayer(QObject *parent, QMediaServiceProvider* provider):\n    QMediaObject(*new QRadioPlayerPrivate, parent, provider->requestService(\"radio\"))\n{\n    Q_D(QRadioPlayer);\n\n    d->provider = provider;\n\n    if (d->service != 0) {\n        d->control = qobject_cast<QRadioPlayerControl*>(d->service->control(QRadioPlayerControl_iid));\n        if (d->control != 0) {\n            connect(d->control, SIGNAL(bandChanged(QRadioPlayer::Band)), SIGNAL(bandChanged(QRadioPlayer::Band)));\n            connect(d->control, SIGNAL(frequencyChanged(int)), SIGNAL(frequencyChanged(int)));\n            connect(d->control, SIGNAL(stereoStatusChanged(bool)), SIGNAL(stereoStatusChanged(bool)));\n            connect(d->control, SIGNAL(searchingStatusChanged(bool)), SIGNAL(searchingStatusChanged(bool)));\n            connect(d->control, SIGNAL(signalStrengthChanged(int)), SIGNAL(signalStrengthChanged(int)));\n            connect(d->control, SIGNAL(durationChanged(qint64)), SIGNAL(durationChanged(qint64)));\n            connect(d->control, SIGNAL(volumeChanged(int)), SIGNAL(volumeChanged(int)));\n            connect(d->control, SIGNAL(mutingChanged(bool)), SIGNAL(mutingChanged(bool)));\n\n            addPropertyWatch(\"duration\");\n        }\n    }\n}\n\n\/*!\n    Destruct the QRadioPlayer object.\n*\/\n\nQRadioPlayer::~QRadioPlayer()\n{\n    Q_D(QRadioPlayer);\n\n    d->provider->releaseService(d->service);\n}\n\n\/*!\n    \\property QRadioPlayer::band\n    \\brief The current frequency range being used.\n\n    \\sa QRadioPlayer::Band\n*\/\n\n\/*!\n    Returns the current QRadioPlayer::Band.\n*\/\n\nQRadioPlayer::Band QRadioPlayer::band() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->band();\n\n    return QRadioPlayer::FM;\n}\n\n\/*!\n    \\property QRadioPlayer::frequency\n    \\brief The current frequency being used in Hertz.\n*\/\n\n\/*!\n    Returns the current frequency.\n*\/\n\nint QRadioPlayer::frequency() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->frequency();\n\n    return 0;\n}\n\n\/*!\n    \\property QRadioPlayer::stereo\n    \\brief In Stereo mode.\n*\/\n\n\/*!\n    Returns true if in stereo.\n*\/\n\nbool QRadioPlayer::isStereo() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->isStereo();\n\n    return false;\n}\n\n\/*!\n    Returns true if \\a b is an available band.\n*\/\n\nbool QRadioPlayer::isSupportedBand(QRadioPlayer::Band b) const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->isSupportedBand(b);\n\n    return false;\n}\n\n\/*!\n    \\property QRadioPlayer::signalStrength\n    \\brief The strength of the current radio signal as a percentage.\n*\/\n\n\/*!\n    Returns the signal strength as a percentage.\n*\/\n\nint QRadioPlayer::signalStrength() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->signalStrength();\n\n    return 0;\n}\n\n\/*!\n    \\property QRadioPlayer::duration\n    \\brief The duration at current frequency in milliseconds.\n*\/\n\n\/*!\n    Returns duration at current frequency in milliseconds.\n*\/\n\nqint64 QRadioPlayer::duration() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->duration();\n\n    return 0;\n}\n\n\/*!\n    \\property QRadioPlayer::volume\n    \\brief The current volume as a percentage.\n*\/\n\n\/*!\n    Returns the volume as a percentage.\n*\/\n\nint QRadioPlayer::volume() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->volume();\n}\n\n\/*!\n    \\property QRadioPlayer::muted\n    \\brief Returns true if muted.\n*\/\n\n\/*!\n    Returns true if muted.\n*\/\n\nbool QRadioPlayer::isMuted() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->isMuted();\n\n    return false;\n}\n\n\/*!\n    Sets the band being used to \\a band.\n*\/\n\nvoid QRadioPlayer::setBand(QRadioPlayer::Band band)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setBand(band);\n}\n\n\/*!\n    Sets the frequency being used to \\a frequency.\n*\/\n\nvoid QRadioPlayer::setFrequency(int frequency)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setFrequency(frequency);\n}\n\n\/*!\n    If \\a stereo is true, Sets to stereo mode, otherwise, mono mode.\n*\/\n\nvoid QRadioPlayer::setStereo(bool stereo)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setStereo(stereo);\n}\n\n\/*!\n    Sets the volume to \\a volume.\n    volume is a percentage.\n*\/\n\nvoid QRadioPlayer::setVolume(int volume)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setVolume(volume);\n}\n\n\/*!\n    If muted is true sets to mute, otherwise unmute.\n*\/\n\nvoid QRadioPlayer::setMuted(bool muted)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setMuted(muted);\n}\n\n\/*!\n    \\property QRadioPlayer::searching\n    \\brief Returns true if currently scanning.\n*\/\n\n\/*!\n    Returns true if currently scanning.\n*\/\n\nbool QRadioPlayer::isSearching() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->isSearching();\n\n    return false;\n}\n\n\/*!\n    Start scanning through frequencies, ascending.\n*\/\n\nvoid QRadioPlayer::searchForward()\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->searchForward();\n}\n\n\/*!\n    Start scanning through frequencies, descending.\n*\/\n\nvoid QRadioPlayer::searchBackward()\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->searchBackward();\n}\n\n\/*!\n    Stop any scanning being done.\n*\/\n\nvoid QRadioPlayer::cancelSearch()\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->cancelSearch();\n}\n\n\/*!\n    \\fn void QRadioPlayer::bandChanged(QRadioPlayer::Band band)\n\n    Signal the change in frequency range to \\a band.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::frequencyChanged(int frequency)\n\n    Signal the change in current \\a frequency.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::mutingChanged(bool muted)\n\n    Signal the change in mute condition to \\a muted.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::volumeChanged(int volume)\n\n    Signal the change in volume percentage to \\a volume.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::searchingStatusChanged(bool searching)\n\n    Signal the change in scanning mode to \\a searching.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::stereoStatusChanged(bool stereo)\n\n    Signal the change in stereo mode to \\a stereo.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::durationChanged(qint64 duration)\n\n    Signal the change in the \\a duration of the current frequency playback in milliseconds.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::signalStrengthChanged(int signalStrength)\n\n    Signal emitted when signal strength changes to new value \\a signalStrength.\n*\/\n\n\/*!\n    \\enum QRadioPlayer::Band\n\n    \\value AM 520 to 1610 kHz, 9 or 10kHz channel spacing, extended 1610 to 1710 kHz\n    \\value FM 87.5 to 108.0 MHz, except Japan 76-90 MHz\n    \\value SW 1.711 to 30.0 MHz, divided into 15 bands. 5kHz channel spacing\n    \\value LW 148.5 to 283.5 kHz, 9kHz channel spacing (Europe, Africa, Asia)\n*\/\n\n\n<commit_msg>QRadioPlayer; return default volume(0) when no control available.<commit_after>\/****************************************************************************\n**\n** Copyright (c) 2008-2009 Nokia Corporation and\/or its subsidiary(-ies).\n**\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\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** If you have questions regarding the use of this file, please contact\n** Nokia at http:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <multimedia\/qradioplayer.h>\n#include <multimedia\/qmediaservice.h>\n#include <multimedia\/qmediaobject_p.h>\n#include <multimedia\/qradioplayercontrol.h>\n\n\n\n\/*!\n    \\class QRadioPlayer\n    \\brief The QRadioPlayer class provides an interface to the systems radio device.\n\n    You can control the systems radio device using this interface, for example:\n\n    \\code\n        player = new QRadioPlayer;\n        connect(player,SIGNAL(frequencyChanged(int)),this,SLOT(freqChanged(int)));\n        if(player->isSupportedBand(QRadioPlayer::FM))\n            player->setBand(QRadioPlayer::FM);\n        player->setFrequency(yourRadioStationFrequency);\n        player->setVolume(100);\n    \\endcode\n\n    The player object will emit signals for any changes in state such as:\n    bandChanged(), frequencyChanged(), stereoStatusChanged(), searchingStatusChanged(),\n    signalStrengthChanged(), durationChanged(), volumeChanged(), mutingChanged().\n\n    You can change between the frequency bands using setBand() however it is recommended\n    that you check to make sure the band is available first using isSupportedBand().\n\n*\/\n\n\nclass QRadioPlayerPrivate : public QMediaObjectPrivate\n{\npublic:\n    QRadioPlayerPrivate():provider(0), control(0) {}\n    QMediaServiceProvider *provider;\n    QRadioPlayerControl* control;\n};\n\n\n\n\/*!\n    Construct a QRadioPlayer object with service \\a provider and \\a parent.\n\n    If the service is not specified the system default will be used.\n*\/\n\nQRadioPlayer::QRadioPlayer(QObject *parent, QMediaServiceProvider* provider):\n    QMediaObject(*new QRadioPlayerPrivate, parent, provider->requestService(\"radio\"))\n{\n    Q_D(QRadioPlayer);\n\n    d->provider = provider;\n\n    if (d->service != 0) {\n        d->control = qobject_cast<QRadioPlayerControl*>(d->service->control(QRadioPlayerControl_iid));\n        if (d->control != 0) {\n            connect(d->control, SIGNAL(bandChanged(QRadioPlayer::Band)), SIGNAL(bandChanged(QRadioPlayer::Band)));\n            connect(d->control, SIGNAL(frequencyChanged(int)), SIGNAL(frequencyChanged(int)));\n            connect(d->control, SIGNAL(stereoStatusChanged(bool)), SIGNAL(stereoStatusChanged(bool)));\n            connect(d->control, SIGNAL(searchingStatusChanged(bool)), SIGNAL(searchingStatusChanged(bool)));\n            connect(d->control, SIGNAL(signalStrengthChanged(int)), SIGNAL(signalStrengthChanged(int)));\n            connect(d->control, SIGNAL(durationChanged(qint64)), SIGNAL(durationChanged(qint64)));\n            connect(d->control, SIGNAL(volumeChanged(int)), SIGNAL(volumeChanged(int)));\n            connect(d->control, SIGNAL(mutingChanged(bool)), SIGNAL(mutingChanged(bool)));\n\n            addPropertyWatch(\"duration\");\n        }\n    }\n}\n\n\/*!\n    Destruct the QRadioPlayer object.\n*\/\n\nQRadioPlayer::~QRadioPlayer()\n{\n    Q_D(QRadioPlayer);\n\n    d->provider->releaseService(d->service);\n}\n\n\/*!\n    \\property QRadioPlayer::band\n    \\brief The current frequency range being used.\n\n    \\sa QRadioPlayer::Band\n*\/\n\n\/*!\n    Returns the current QRadioPlayer::Band.\n*\/\n\nQRadioPlayer::Band QRadioPlayer::band() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->band();\n\n    return QRadioPlayer::FM;\n}\n\n\/*!\n    \\property QRadioPlayer::frequency\n    \\brief The current frequency being used in Hertz.\n*\/\n\n\/*!\n    Returns the current frequency.\n*\/\n\nint QRadioPlayer::frequency() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->frequency();\n\n    return 0;\n}\n\n\/*!\n    \\property QRadioPlayer::stereo\n    \\brief In Stereo mode.\n*\/\n\n\/*!\n    Returns true if in stereo.\n*\/\n\nbool QRadioPlayer::isStereo() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->isStereo();\n\n    return false;\n}\n\n\/*!\n    Returns true if \\a b is an available band.\n*\/\n\nbool QRadioPlayer::isSupportedBand(QRadioPlayer::Band b) const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->isSupportedBand(b);\n\n    return false;\n}\n\n\/*!\n    \\property QRadioPlayer::signalStrength\n    \\brief The strength of the current radio signal as a percentage.\n*\/\n\n\/*!\n    Returns the signal strength as a percentage.\n*\/\n\nint QRadioPlayer::signalStrength() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->signalStrength();\n\n    return 0;\n}\n\n\/*!\n    \\property QRadioPlayer::duration\n    \\brief The duration at current frequency in milliseconds.\n*\/\n\n\/*!\n    Returns duration at current frequency in milliseconds.\n*\/\n\nqint64 QRadioPlayer::duration() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->duration();\n\n    return 0;\n}\n\n\/*!\n    \\property QRadioPlayer::volume\n    \\brief The current volume as a percentage.\n*\/\n\n\/*!\n    Returns the volume as a percentage.\n*\/\n\nint QRadioPlayer::volume() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->volume();\n\n    return 0;\n}\n\n\/*!\n    \\property QRadioPlayer::muted\n    \\brief Returns true if muted.\n*\/\n\n\/*!\n    Returns true if muted.\n*\/\n\nbool QRadioPlayer::isMuted() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->isMuted();\n\n    return false;\n}\n\n\/*!\n    Sets the band being used to \\a band.\n*\/\n\nvoid QRadioPlayer::setBand(QRadioPlayer::Band band)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setBand(band);\n}\n\n\/*!\n    Sets the frequency being used to \\a frequency.\n*\/\n\nvoid QRadioPlayer::setFrequency(int frequency)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setFrequency(frequency);\n}\n\n\/*!\n    If \\a stereo is true, Sets to stereo mode, otherwise, mono mode.\n*\/\n\nvoid QRadioPlayer::setStereo(bool stereo)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setStereo(stereo);\n}\n\n\/*!\n    Sets the volume to \\a volume.\n    volume is a percentage.\n*\/\n\nvoid QRadioPlayer::setVolume(int volume)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setVolume(volume);\n}\n\n\/*!\n    If muted is true sets to mute, otherwise unmute.\n*\/\n\nvoid QRadioPlayer::setMuted(bool muted)\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->setMuted(muted);\n}\n\n\/*!\n    \\property QRadioPlayer::searching\n    \\brief Returns true if currently scanning.\n*\/\n\n\/*!\n    Returns true if currently scanning.\n*\/\n\nbool QRadioPlayer::isSearching() const\n{\n    Q_D(const QRadioPlayer);\n\n    if (d->control != 0)\n        return d->control->isSearching();\n\n    return false;\n}\n\n\/*!\n    Start scanning through frequencies, ascending.\n*\/\n\nvoid QRadioPlayer::searchForward()\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->searchForward();\n}\n\n\/*!\n    Start scanning through frequencies, descending.\n*\/\n\nvoid QRadioPlayer::searchBackward()\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->searchBackward();\n}\n\n\/*!\n    Stop any scanning being done.\n*\/\n\nvoid QRadioPlayer::cancelSearch()\n{\n    Q_D(QRadioPlayer);\n\n    if (d->control != 0)\n        d->control->cancelSearch();\n}\n\n\/*!\n    \\fn void QRadioPlayer::bandChanged(QRadioPlayer::Band band)\n\n    Signal the change in frequency range to \\a band.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::frequencyChanged(int frequency)\n\n    Signal the change in current \\a frequency.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::mutingChanged(bool muted)\n\n    Signal the change in mute condition to \\a muted.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::volumeChanged(int volume)\n\n    Signal the change in volume percentage to \\a volume.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::searchingStatusChanged(bool searching)\n\n    Signal the change in scanning mode to \\a searching.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::stereoStatusChanged(bool stereo)\n\n    Signal the change in stereo mode to \\a stereo.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::durationChanged(qint64 duration)\n\n    Signal the change in the \\a duration of the current frequency playback in milliseconds.\n*\/\n\n\/*!\n    \\fn void QRadioPlayer::signalStrengthChanged(int signalStrength)\n\n    Signal emitted when signal strength changes to new value \\a signalStrength.\n*\/\n\n\/*!\n    \\enum QRadioPlayer::Band\n\n    \\value AM 520 to 1610 kHz, 9 or 10kHz channel spacing, extended 1610 to 1710 kHz\n    \\value FM 87.5 to 108.0 MHz, except Japan 76-90 MHz\n    \\value SW 1.711 to 30.0 MHz, divided into 15 bands. 5kHz channel spacing\n    \\value LW 148.5 to 283.5 kHz, 9kHz channel spacing (Europe, Africa, Asia)\n*\/\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- ExprConstant.cpp - Expression Constant Evaluator -----------------===\/\/\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 Expr constant evaluator.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/AST\/APValue.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/StmtVisitor.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"llvm\/Support\/Compiler.h\"\nusing namespace clang;\nusing llvm::APSInt;\n\n#define USE_NEW_EVALUATOR 0\n\nstatic bool CalcFakeICEVal(const Expr *Expr,\n                           llvm::APSInt &Result,\n                           ASTContext &Context) {\n  \/\/ Calculate the value of an expression that has a calculatable\n  \/\/ value, but isn't an ICE. Currently, this only supports\n  \/\/ a very narrow set of extensions, but it can be expanded if needed.\n  if (const ParenExpr *PE = dyn_cast<ParenExpr>(Expr))\n    return CalcFakeICEVal(PE->getSubExpr(), Result, Context);\n  \n  if (const CastExpr *CE = dyn_cast<CastExpr>(Expr)) {\n    QualType CETy = CE->getType();\n    if ((CETy->isIntegralType() && !CETy->isBooleanType()) ||\n        CETy->isPointerType()) {\n      if (CalcFakeICEVal(CE->getSubExpr(), Result, Context)) {\n        Result.extOrTrunc(Context.getTypeSize(CETy));\n        \/\/ FIXME: This assumes pointers are signed.\n        Result.setIsSigned(CETy->isSignedIntegerType() ||\n                           CETy->isPointerType());\n        return true;\n      }\n    }\n  }\n  \n  if (Expr->getType()->isIntegralType())\n    return Expr->isIntegerConstantExpr(Result, Context);\n  \n  return false;\n}\n\nstatic bool EvaluatePointer(const Expr *E, APValue &Result, ASTContext &Ctx);\nstatic bool EvaluateInteger(const Expr *E, APSInt  &Result, ASTContext &Ctx);\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Pointer Evaluation\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass VISIBILITY_HIDDEN PointerExprEvaluator\n  : public StmtVisitor<PointerExprEvaluator, APValue> {\n  ASTContext &Ctx;\npublic:\n    \n  PointerExprEvaluator(ASTContext &ctx) : Ctx(ctx) {}\n\n  APValue VisitStmt(Stmt *S) {\n    \/\/ FIXME: Remove this when we support more expressions.\n    printf(\"Unhandled pointer statement\\n\");\n    S->dump();  \n    return APValue();\n  }\n\n  APValue VisitParenExpr(ParenExpr *E) { return Visit(E->getSubExpr()); }\n\n  APValue VisitBinaryOperator(const BinaryOperator *E);\n  APValue VisitCastExpr(const CastExpr* E);\n};\n} \/\/ end anonymous namespace\n\nstatic bool EvaluatePointer(const Expr* E, APValue& Result, ASTContext &Ctx) {\n  if (!E->getType()->isPointerType())\n    return false;\n  Result = PointerExprEvaluator(Ctx).Visit(const_cast<Expr*>(E));\n  return Result.isLValue();\n}\n\nAPValue PointerExprEvaluator::VisitBinaryOperator(const BinaryOperator *E) {\n  if (E->getOpcode() != BinaryOperator::Add &&\n      E->getOpcode() != BinaryOperator::Sub)\n    return APValue();\n  \n  const Expr *PExp = E->getLHS();\n  const Expr *IExp = E->getRHS();\n  if (IExp->getType()->isPointerType())\n    std::swap(PExp, IExp);\n  \n  APValue ResultLValue;\n  if (!EvaluatePointer(PExp, ResultLValue, Ctx))\n    return APValue();\n  \n  llvm::APSInt AdditionalOffset(32);\n  if (!EvaluateInteger(IExp, AdditionalOffset, Ctx))\n    return APValue();\n\n  uint64_t Offset = ResultLValue.getLValueOffset();\n  if (E->getOpcode() == BinaryOperator::Add)\n    Offset += AdditionalOffset.getZExtValue();\n  else\n    Offset -= AdditionalOffset.getZExtValue();\n    \n  return APValue(ResultLValue.getLValueBase(), Offset);\n}\n  \n\nAPValue PointerExprEvaluator::VisitCastExpr(const CastExpr* E) {\n  const Expr* SubExpr = E->getSubExpr();\n\n   \/\/ Check for pointer->pointer cast\n  if (SubExpr->getType()->isPointerType()) {\n    APValue Result;\n    if (EvaluatePointer(SubExpr, Result, Ctx))\n      return Result;\n    return APValue();\n  }\n  \n  if (SubExpr->getType()->isArithmeticType()) {\n    llvm::APSInt Result(32);\n    if (EvaluateInteger(SubExpr, Result, Ctx)) {\n      Result.extOrTrunc(static_cast<uint32_t>(Ctx.getTypeSize(E->getType())));\n      return APValue(0, Result.getZExtValue());\n    }\n  }\n  \n  assert(0 && \"Unhandled cast\");\n  return APValue();\n}  \n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Integer Evaluation\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass VISIBILITY_HIDDEN IntExprEvaluator\n  : public StmtVisitor<IntExprEvaluator, bool> {\n  ASTContext &Ctx;\n  APSInt &Result;\npublic:\n  IntExprEvaluator(ASTContext &ctx, APSInt &result) : Ctx(ctx), Result(result){}\n\n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/                            Visitor Methods\n  \/\/===--------------------------------------------------------------------===\/\/\n  bool VisitStmt(Stmt *S) {\n    \/\/ FIXME: Remove this when we support more expressions.\n    printf(\"unhandled int expression\");\n    S->dump();  \n    return false;\n  }\n  \n  bool VisitParenExpr(ParenExpr *E) { return Visit(E->getSubExpr()); }\n\n  bool VisitBinaryOperator(const BinaryOperator *E);\n  bool VisitUnaryOperator(const UnaryOperator *E);\n\n  bool HandleCast(const Expr* SubExpr, QualType DestType);\n  bool VisitCastExpr(const CastExpr* E) {\n    return HandleCast(E->getSubExpr(), E->getType());\n  }\n  bool VisitImplicitCastExpr(const ImplicitCastExpr* E) {\n    return HandleCast(E->getSubExpr(), E->getType());\n  }\n  bool VisitSizeOfAlignOfTypeExpr(const SizeOfAlignOfTypeExpr *E);\n \n  bool VisitIntegerLiteral(const IntegerLiteral *E) {\n    Result = E->getValue();\n    return true;\n  }\n};\n} \/\/ end anonymous namespace\n\nstatic bool EvaluateInteger(const Expr* E, APSInt &Result, ASTContext &Ctx) {\n  return IntExprEvaluator(Ctx, Result).Visit(const_cast<Expr*>(E));\n}\n\n\nbool IntExprEvaluator::VisitBinaryOperator(const BinaryOperator *E) {\n  \/\/ The LHS of a constant expr is always evaluated and needed.\n  if (!Visit(E->getLHS()))\n    return false; \n\n  llvm::APSInt RHS(32);\n  if (!EvaluateInteger(E->getRHS(), RHS, Ctx))\n    return false;\n  \n  switch (E->getOpcode()) {\n  default:\n    return false;\n  case BinaryOperator::Mul:\n    Result *= RHS;\n    break;\n  case BinaryOperator::Div:\n    if (RHS == 0)\n      return false;\n    Result \/= RHS;\n    break;\n  case BinaryOperator::Rem:\n    if (RHS == 0)\n      return false;\n    Result %= RHS;\n    break;\n  case BinaryOperator::Add: Result += RHS; break;\n  case BinaryOperator::Sub: Result -= RHS; break;\n  case BinaryOperator::Shl:\n    Result <<= (unsigned)RHS.getLimitedValue(Result.getBitWidth()-1);\n    break;\n  case BinaryOperator::Shr:\n    Result >>= (unsigned)RHS.getLimitedValue(Result.getBitWidth()-1);\n    break;\n      \n  \/\/ FIXME: Need to set the result width?\n  case BinaryOperator::LT:  Result = Result < RHS; break;\n  case BinaryOperator::GT:  Result = Result > RHS; break;\n  case BinaryOperator::LE:  Result = Result <= RHS; break;\n  case BinaryOperator::GE:  Result = Result >= RHS; break;\n  case BinaryOperator::EQ:  Result = Result == RHS; break;\n  case BinaryOperator::NE:  Result = Result != RHS; break;\n  case BinaryOperator::And: Result &= RHS; break;\n  case BinaryOperator::Xor: Result ^= RHS; break;\n  case BinaryOperator::Or:  Result |= RHS; break;\n    \n  case BinaryOperator::Comma:\n    \/\/ C99 6.6p3: \"shall not contain assignment, ..., or comma operators,\n    \/\/ *except* when they are contained within a subexpression that is not\n    \/\/ evaluated\".  Note that Assignment can never happen due to constraints\n    \/\/ on the LHS subexpr, so we don't need to check it here.\n    \/\/ FIXME: Need to come up with an efficient way to deal with the C99\n    \/\/ rules on evaluation while still evaluating this.  Maybe a\n    \/\/ \"evaluated comma\" out parameter?\n    return false;\n  }\n\n  Result.setIsUnsigned(E->getType()->isUnsignedIntegerType());\n  return true;\n}\n\nbool IntExprEvaluator::VisitUnaryOperator(const UnaryOperator *E) {\n  if (E->isOffsetOfOp())\n    Result = E->evaluateOffsetOf(Ctx);\n  else if (E->isSizeOfAlignOfOp()) {\n    \/\/ Return the result in the right width.\n    Result.zextOrTrunc(static_cast<uint32_t>(Ctx.getTypeSize(E->getType())));\n\n    \/\/ sizeof(void) and __alignof__(void) = 1 as a gcc extension.\n    if (E->getSubExpr()->getType()->isVoidType())\n      Result = 1;\n\n    \/\/ sizeof(vla) is not a constantexpr: C99 6.5.3.4p2.\n    if (!E->getSubExpr()->getType()->isConstantSizeType()) {\n      \/\/ FIXME: Should we attempt to evaluate this?\n      return false;\n    }\n\n    \/\/ Get information about the size or align.\n    if (E->getSubExpr()->getType()->isFunctionType()) {\n      \/\/ GCC extension: sizeof(function) = 1.\n      \/\/ FIXME: AlignOf shouldn't be unconditionally 4!\n      Result = E->getOpcode() == UnaryOperator::AlignOf ? 4 : 1;\n    } else {\n      unsigned CharSize = Ctx.Target.getCharWidth();\n      if (E->getOpcode() == UnaryOperator::AlignOf)\n        Result = Ctx.getTypeAlign(E->getSubExpr()->getType()) \/ CharSize;\n      else\n        Result = Ctx.getTypeSize(E->getSubExpr()->getType()) \/ CharSize;\n    }\n  } else {\n    \/\/ Get the operand value.  If this is sizeof\/alignof, do not evalute the\n    \/\/ operand.  This affects C99 6.6p3.\n    if (!EvaluateInteger(E->getSubExpr(), Result, Ctx))\n      return false;\n\n    switch (E->getOpcode()) {\n      \/\/ Address, indirect, pre\/post inc\/dec, etc are not valid constant exprs.\n      \/\/ See C99 6.6p3.\n    default:\n      return false;\n    case UnaryOperator::Extension:\n      assert(0 && \"Handle UnaryOperator::Extension\");\n        return false;\n    case UnaryOperator::LNot: {\n      bool Val = Result == 0;\n      uint32_t typeSize = Ctx.getTypeSize(E->getType());\n      Result.zextOrTrunc(typeSize);\n      Result = Val;\n      break;\n    }\n    case UnaryOperator::Plus:\n      break;\n    case UnaryOperator::Minus:\n      Result = -Result;\n      break;\n    case UnaryOperator::Not:\n      Result = ~Result;\n      break;\n    }\n  }\n\n  Result.setIsUnsigned(E->getType()->isUnsignedIntegerType());\n  return true;\n}\n  \nbool IntExprEvaluator::HandleCast(const Expr* SubExpr, QualType DestType) {\n  llvm::APSInt Result(32);\n\n  uint32_t DestWidth = static_cast<uint32_t>(Ctx.getTypeSize(DestType));\n\n  \/\/ Handle simple integer->integer casts.\n  if (SubExpr->getType()->isIntegerType()) {\n    if (!EvaluateInteger(SubExpr, Result, Ctx))\n      return false;\n    \n    \/\/ Figure out if this is a truncate, extend or noop cast.\n    \/\/ If the input is signed, do a sign extend, noop, or truncate.\n    if (DestType->isBooleanType()) {\n      \/\/ Conversion to bool compares against zero.\n      Result = Result != 0;\n      Result.zextOrTrunc(DestWidth);\n    }\n    else\n      Result.extOrTrunc(DestWidth);\n  } else if (SubExpr->getType()->isPointerType()) {\n    APValue LV;\n    if (!EvaluatePointer(SubExpr, LV, Ctx))\n      return false;\n    if (LV.getLValueBase())\n      return false;\n    \n    Result.extOrTrunc(DestWidth);\n    Result = LV.getLValueOffset();\n  } else {\n    assert(0 && \"Unhandled cast!\");\n  }\n  \n  Result.setIsUnsigned(DestType->isUnsignedIntegerType());\n  return true;\n}\n\nbool IntExprEvaluator::\nVisitSizeOfAlignOfTypeExpr(const SizeOfAlignOfTypeExpr *E) {\n  \/\/ Return the result in the right width.\n  Result.zextOrTrunc(static_cast<uint32_t>(Ctx.getTypeSize(E->getType())));\n\n  \/\/ sizeof(void) and __alignof__(void) = 1 as a gcc extension.\n  if (E->getArgumentType()->isVoidType()) {\n    Result = 1;\n    Result.setIsUnsigned(E->getType()->isUnsignedIntegerType());\n    return true;\n  }\n\n  \/\/ alignof always evaluates to a constant, sizeof does if arg is not VLA.\n  if (E->isSizeOf() && !E->getArgumentType()->isConstantSizeType()) \n    return false;\n\n  \/\/ Get information about the size or align.\n  if (E->getArgumentType()->isFunctionType()) {\n    \/\/ GCC extension: sizeof(function) = 1.\n    Result = E->isSizeOf() ? 1 : 4;\n  } else { \n    unsigned CharSize = Ctx.Target.getCharWidth();\n    if (E->isSizeOf())\n      Result = Ctx.getTypeSize(E->getArgumentType()) \/ CharSize;\n    else\n      Result = Ctx.getTypeAlign(E->getArgumentType()) \/ CharSize;\n  }\n  \n  Result.setIsUnsigned(E->getType()->isUnsignedIntegerType());\n  return true;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Top level TryEvaluate.\n\/\/===----------------------------------------------------------------------===\/\/\n\nbool Expr::tryEvaluate(APValue &Result, ASTContext &Ctx) const {\n  llvm::APSInt sInt(32);\n#if USE_NEW_EVALUATOR\n  if (getType()->isIntegerType()) {\n    if (EvaluateInteger(this, sInt, Ctx)) {\n      Result = APValue(sInt);\n      return true;\n    }\n  } else\n    return false;\n    \n#else\n  if (CalcFakeICEVal(this, sInt, Ctx)) {\n    Result = APValue(sInt);\n    return true;\n  }\n#endif\n  \n  return false;\n}\n<commit_msg>add a new getIntTypeSizeInBits method.<commit_after>\/\/===--- ExprConstant.cpp - Expression Constant Evaluator -----------------===\/\/\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 Expr constant evaluator.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/AST\/APValue.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/StmtVisitor.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"llvm\/Support\/Compiler.h\"\nusing namespace clang;\nusing llvm::APSInt;\n\n#define USE_NEW_EVALUATOR 0\n\nstatic bool CalcFakeICEVal(const Expr *Expr,\n                           llvm::APSInt &Result,\n                           ASTContext &Context) {\n  \/\/ Calculate the value of an expression that has a calculatable\n  \/\/ value, but isn't an ICE. Currently, this only supports\n  \/\/ a very narrow set of extensions, but it can be expanded if needed.\n  if (const ParenExpr *PE = dyn_cast<ParenExpr>(Expr))\n    return CalcFakeICEVal(PE->getSubExpr(), Result, Context);\n  \n  if (const CastExpr *CE = dyn_cast<CastExpr>(Expr)) {\n    QualType CETy = CE->getType();\n    if ((CETy->isIntegralType() && !CETy->isBooleanType()) ||\n        CETy->isPointerType()) {\n      if (CalcFakeICEVal(CE->getSubExpr(), Result, Context)) {\n        Result.extOrTrunc(Context.getTypeSize(CETy));\n        \/\/ FIXME: This assumes pointers are signed.\n        Result.setIsSigned(CETy->isSignedIntegerType() ||\n                           CETy->isPointerType());\n        return true;\n      }\n    }\n  }\n  \n  if (Expr->getType()->isIntegralType())\n    return Expr->isIntegerConstantExpr(Result, Context);\n  \n  return false;\n}\n\nstatic bool EvaluatePointer(const Expr *E, APValue &Result, ASTContext &Ctx);\nstatic bool EvaluateInteger(const Expr *E, APSInt  &Result, ASTContext &Ctx);\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Pointer Evaluation\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass VISIBILITY_HIDDEN PointerExprEvaluator\n  : public StmtVisitor<PointerExprEvaluator, APValue> {\n  ASTContext &Ctx;\npublic:\n    \n  PointerExprEvaluator(ASTContext &ctx) : Ctx(ctx) {}\n\n  APValue VisitStmt(Stmt *S) {\n    \/\/ FIXME: Remove this when we support more expressions.\n    printf(\"Unhandled pointer statement\\n\");\n    S->dump();  \n    return APValue();\n  }\n\n  APValue VisitParenExpr(ParenExpr *E) { return Visit(E->getSubExpr()); }\n\n  APValue VisitBinaryOperator(const BinaryOperator *E);\n  APValue VisitCastExpr(const CastExpr* E);\n};\n} \/\/ end anonymous namespace\n\nstatic bool EvaluatePointer(const Expr* E, APValue& Result, ASTContext &Ctx) {\n  if (!E->getType()->isPointerType())\n    return false;\n  Result = PointerExprEvaluator(Ctx).Visit(const_cast<Expr*>(E));\n  return Result.isLValue();\n}\n\nAPValue PointerExprEvaluator::VisitBinaryOperator(const BinaryOperator *E) {\n  if (E->getOpcode() != BinaryOperator::Add &&\n      E->getOpcode() != BinaryOperator::Sub)\n    return APValue();\n  \n  const Expr *PExp = E->getLHS();\n  const Expr *IExp = E->getRHS();\n  if (IExp->getType()->isPointerType())\n    std::swap(PExp, IExp);\n  \n  APValue ResultLValue;\n  if (!EvaluatePointer(PExp, ResultLValue, Ctx))\n    return APValue();\n  \n  llvm::APSInt AdditionalOffset(32);\n  if (!EvaluateInteger(IExp, AdditionalOffset, Ctx))\n    return APValue();\n\n  uint64_t Offset = ResultLValue.getLValueOffset();\n  if (E->getOpcode() == BinaryOperator::Add)\n    Offset += AdditionalOffset.getZExtValue();\n  else\n    Offset -= AdditionalOffset.getZExtValue();\n    \n  return APValue(ResultLValue.getLValueBase(), Offset);\n}\n  \n\nAPValue PointerExprEvaluator::VisitCastExpr(const CastExpr* E) {\n  const Expr* SubExpr = E->getSubExpr();\n\n   \/\/ Check for pointer->pointer cast\n  if (SubExpr->getType()->isPointerType()) {\n    APValue Result;\n    if (EvaluatePointer(SubExpr, Result, Ctx))\n      return Result;\n    return APValue();\n  }\n  \n  if (SubExpr->getType()->isArithmeticType()) {\n    llvm::APSInt Result(32);\n    if (EvaluateInteger(SubExpr, Result, Ctx)) {\n      Result.extOrTrunc(static_cast<uint32_t>(Ctx.getTypeSize(E->getType())));\n      return APValue(0, Result.getZExtValue());\n    }\n  }\n  \n  assert(0 && \"Unhandled cast\");\n  return APValue();\n}  \n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Integer Evaluation\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass VISIBILITY_HIDDEN IntExprEvaluator\n  : public StmtVisitor<IntExprEvaluator, bool> {\n  ASTContext &Ctx;\n  APSInt &Result;\npublic:\n  IntExprEvaluator(ASTContext &ctx, APSInt &result) : Ctx(ctx), Result(result){}\n\n  unsigned getIntTypeSizeInBits(QualType T) const {\n    return (unsigned)Ctx.getTypeSize(T);\n  }\n    \n  \/\/===--------------------------------------------------------------------===\/\/\n  \/\/                            Visitor Methods\n  \/\/===--------------------------------------------------------------------===\/\/\n    \n  bool VisitStmt(Stmt *S) {\n    \/\/ FIXME: Remove this when we support more expressions.\n    printf(\"unhandled int expression\");\n    S->dump();  \n    return false;\n  }\n  \n  bool VisitParenExpr(ParenExpr *E) { return Visit(E->getSubExpr()); }\n\n  bool VisitBinaryOperator(const BinaryOperator *E);\n  bool VisitUnaryOperator(const UnaryOperator *E);\n\n  bool HandleCast(const Expr* SubExpr, QualType DestType);\n  bool VisitCastExpr(const CastExpr* E) {\n    return HandleCast(E->getSubExpr(), E->getType());\n  }\n  bool VisitImplicitCastExpr(const ImplicitCastExpr* E) {\n    return HandleCast(E->getSubExpr(), E->getType());\n  }\n  bool VisitSizeOfAlignOfTypeExpr(const SizeOfAlignOfTypeExpr *E);\n \n  bool VisitIntegerLiteral(const IntegerLiteral *E) {\n    Result = E->getValue();\n    return true;\n  }\n};\n} \/\/ end anonymous namespace\n\nstatic bool EvaluateInteger(const Expr* E, APSInt &Result, ASTContext &Ctx) {\n  return IntExprEvaluator(Ctx, Result).Visit(const_cast<Expr*>(E));\n}\n\n\nbool IntExprEvaluator::VisitBinaryOperator(const BinaryOperator *E) {\n  \/\/ The LHS of a constant expr is always evaluated and needed.\n  if (!Visit(E->getLHS()))\n    return false; \n\n  llvm::APSInt RHS(32);\n  if (!EvaluateInteger(E->getRHS(), RHS, Ctx))\n    return false;\n  \n  switch (E->getOpcode()) {\n  default:\n    return false;\n  case BinaryOperator::Mul:\n    Result *= RHS;\n    break;\n  case BinaryOperator::Div:\n    if (RHS == 0)\n      return false;\n    Result \/= RHS;\n    break;\n  case BinaryOperator::Rem:\n    if (RHS == 0)\n      return false;\n    Result %= RHS;\n    break;\n  case BinaryOperator::Add: Result += RHS; break;\n  case BinaryOperator::Sub: Result -= RHS; break;\n  case BinaryOperator::Shl:\n    Result <<= (unsigned)RHS.getLimitedValue(Result.getBitWidth()-1);\n    break;\n  case BinaryOperator::Shr:\n    Result >>= (unsigned)RHS.getLimitedValue(Result.getBitWidth()-1);\n    break;\n      \n  \/\/ FIXME: Need to set the result width?\n  case BinaryOperator::LT:  Result = Result < RHS; break;\n  case BinaryOperator::GT:  Result = Result > RHS; break;\n  case BinaryOperator::LE:  Result = Result <= RHS; break;\n  case BinaryOperator::GE:  Result = Result >= RHS; break;\n  case BinaryOperator::EQ:  Result = Result == RHS; break;\n  case BinaryOperator::NE:  Result = Result != RHS; break;\n  case BinaryOperator::And: Result &= RHS; break;\n  case BinaryOperator::Xor: Result ^= RHS; break;\n  case BinaryOperator::Or:  Result |= RHS; break;\n    \n  case BinaryOperator::Comma:\n    \/\/ C99 6.6p3: \"shall not contain assignment, ..., or comma operators,\n    \/\/ *except* when they are contained within a subexpression that is not\n    \/\/ evaluated\".  Note that Assignment can never happen due to constraints\n    \/\/ on the LHS subexpr, so we don't need to check it here.\n    \/\/ FIXME: Need to come up with an efficient way to deal with the C99\n    \/\/ rules on evaluation while still evaluating this.  Maybe a\n    \/\/ \"evaluated comma\" out parameter?\n    return false;\n  }\n\n  Result.setIsUnsigned(E->getType()->isUnsignedIntegerType());\n  return true;\n}\n\nbool IntExprEvaluator::VisitUnaryOperator(const UnaryOperator *E) {\n  if (E->isOffsetOfOp())\n    Result = E->evaluateOffsetOf(Ctx);\n  else if (E->isSizeOfAlignOfOp()) {\n    \/\/ Return the result in the right width.\n    Result.zextOrTrunc(getIntTypeSizeInBits(E->getType()));\n\n    \/\/ sizeof(void) and __alignof__(void) = 1 as a gcc extension.\n    if (E->getSubExpr()->getType()->isVoidType())\n      Result = 1;\n\n    \/\/ sizeof(vla) is not a constantexpr: C99 6.5.3.4p2.\n    if (!E->getSubExpr()->getType()->isConstantSizeType()) {\n      \/\/ FIXME: Should we attempt to evaluate this?\n      return false;\n    }\n\n    \/\/ Get information about the size or align.\n    if (E->getSubExpr()->getType()->isFunctionType()) {\n      \/\/ GCC extension: sizeof(function) = 1.\n      \/\/ FIXME: AlignOf shouldn't be unconditionally 4!\n      Result = E->getOpcode() == UnaryOperator::AlignOf ? 4 : 1;\n    } else {\n      unsigned CharSize = Ctx.Target.getCharWidth();\n      if (E->getOpcode() == UnaryOperator::AlignOf)\n        Result = Ctx.getTypeAlign(E->getSubExpr()->getType()) \/ CharSize;\n      else\n        Result = getIntTypeSizeInBits(E->getSubExpr()->getType()) \/ CharSize;\n    }\n  } else {\n    \/\/ Get the operand value.  If this is sizeof\/alignof, do not evalute the\n    \/\/ operand.  This affects C99 6.6p3.\n    if (!EvaluateInteger(E->getSubExpr(), Result, Ctx))\n      return false;\n\n    switch (E->getOpcode()) {\n      \/\/ Address, indirect, pre\/post inc\/dec, etc are not valid constant exprs.\n      \/\/ See C99 6.6p3.\n    default:\n      return false;\n    case UnaryOperator::Extension:\n      assert(0 && \"Handle UnaryOperator::Extension\");\n        return false;\n    case UnaryOperator::LNot: {\n      bool Val = Result == 0;\n      Result.zextOrTrunc(getIntTypeSizeInBits(E->getType()));\n      Result = Val;\n      break;\n    }\n    case UnaryOperator::Plus:\n      break;\n    case UnaryOperator::Minus:\n      Result = -Result;\n      break;\n    case UnaryOperator::Not:\n      Result = ~Result;\n      break;\n    }\n  }\n\n  Result.setIsUnsigned(E->getType()->isUnsignedIntegerType());\n  return true;\n}\n  \nbool IntExprEvaluator::HandleCast(const Expr* SubExpr, QualType DestType) {\n  unsigned DestWidth = getIntTypeSizeInBits(DestType);\n\n  \/\/ Handle simple integer->integer casts.\n  if (SubExpr->getType()->isIntegerType()) {\n    if (!EvaluateInteger(SubExpr, Result, Ctx))\n      return false;\n    \n    \/\/ Figure out if this is a truncate, extend or noop cast.\n    \/\/ If the input is signed, do a sign extend, noop, or truncate.\n    if (DestType->isBooleanType()) {\n      \/\/ Conversion to bool compares against zero.\n      Result = Result != 0;\n      Result.zextOrTrunc(DestWidth);\n    } else\n      Result.extOrTrunc(DestWidth);\n  } else if (SubExpr->getType()->isPointerType()) {\n    APValue LV;\n    if (!EvaluatePointer(SubExpr, LV, Ctx))\n      return false;\n    if (LV.getLValueBase())\n      return false;\n    \n    Result.extOrTrunc(DestWidth);\n    Result = LV.getLValueOffset();\n  } else {\n    assert(0 && \"Unhandled cast!\");\n  }\n  \n  Result.setIsUnsigned(DestType->isUnsignedIntegerType());\n  return true;\n}\n\nbool IntExprEvaluator::\nVisitSizeOfAlignOfTypeExpr(const SizeOfAlignOfTypeExpr *E) {\n  \/\/ Return the result in the right width.\n  Result.zextOrTrunc(getIntTypeSizeInBits(E->getType()));\n\n  \/\/ sizeof(void) and __alignof__(void) = 1 as a gcc extension.\n  if (E->getArgumentType()->isVoidType()) {\n    Result = 1;\n    Result.setIsUnsigned(E->getType()->isUnsignedIntegerType());\n    return true;\n  }\n\n  \/\/ alignof always evaluates to a constant, sizeof does if arg is not VLA.\n  if (E->isSizeOf() && !E->getArgumentType()->isConstantSizeType()) \n    return false;\n\n  \/\/ Get information about the size or align.\n  if (E->getArgumentType()->isFunctionType()) {\n    \/\/ GCC extension: sizeof(function) = 1.\n    Result = E->isSizeOf() ? 1 : 4;\n  } else { \n    unsigned CharSize = Ctx.Target.getCharWidth();\n    if (E->isSizeOf())\n      Result = getIntTypeSizeInBits(E->getArgumentType()) \/ CharSize;\n    else\n      Result = Ctx.getTypeAlign(E->getArgumentType()) \/ CharSize;\n  }\n  \n  Result.setIsUnsigned(E->getType()->isUnsignedIntegerType());\n  return true;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Top level TryEvaluate.\n\/\/===----------------------------------------------------------------------===\/\/\n\nbool Expr::tryEvaluate(APValue &Result, ASTContext &Ctx) const {\n  llvm::APSInt sInt(32);\n#if USE_NEW_EVALUATOR\n  if (getType()->isIntegerType()) {\n    if (EvaluateInteger(this, sInt, Ctx)) {\n      Result = APValue(sInt);\n      return true;\n    }\n  } else\n    return false;\n    \n#else\n  if (CalcFakeICEVal(this, sInt, Ctx)) {\n    Result = APValue(sInt);\n    return true;\n  }\n#endif\n  \n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- Core\/SymbolTable.cpp - Main Symbol Table ---------------------------===\/\/\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 \"lld\/Core\/SymbolTable.h\"\n#include \"lld\/Core\/AbsoluteAtom.h\"\n#include \"lld\/Core\/Atom.h\"\n#include \"lld\/Core\/DefinedAtom.h\"\n#include \"lld\/Core\/File.h\"\n#include \"lld\/Core\/LLVM.h\"\n#include \"lld\/Core\/LinkingContext.h\"\n#include \"lld\/Core\/Resolver.h\"\n#include \"lld\/Core\/SharedLibraryAtom.h\"\n#include \"lld\/Core\/UndefinedAtom.h\"\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/DenseMapInfo.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\n#include <cassert>\n#include <cstdlib>\n#include <vector>\n\nnamespace lld {\nbool SymbolTable::add(const UndefinedAtom &atom) { return addByName(atom); }\n\nbool SymbolTable::add(const SharedLibraryAtom &atom) { return addByName(atom); }\n\nbool SymbolTable::add(const AbsoluteAtom &atom) { return addByName(atom); }\n\nbool SymbolTable::add(const DefinedAtom &atom) {\n  if (!atom.name().empty() &&\n      atom.scope() != DefinedAtom::scopeTranslationUnit) {\n    \/\/ Named atoms cannot be merged by content.\n    assert(atom.merge() != DefinedAtom::mergeByContent);\n    \/\/ Track named atoms that are not scoped to file (static).\n    return addByName(atom);\n  }\n  if (atom.merge() == DefinedAtom::mergeByContent) {\n    \/\/ Named atoms cannot be merged by content.\n    assert(atom.name().empty());\n    \/\/ Currently only read-only constants can be merged.\n    if (atom.permissions() == DefinedAtom::permR__)\n      return addByContent(atom);\n    \/\/ TODO: support mergeByContent of data atoms by comparing content & fixups.\n  }\n  return false;\n}\n\nenum NameCollisionResolution {\n  NCR_First,\n  NCR_Second,\n  NCR_DupDef,\n  NCR_DupUndef,\n  NCR_DupShLib,\n  NCR_Error\n};\n\nstatic NameCollisionResolution cases[4][4] = {\n  \/\/regular     absolute    undef      sharedLib\n  {\n    \/\/ first is regular\n    NCR_DupDef, NCR_Error,   NCR_First, NCR_First\n  },\n  {\n    \/\/ first is absolute\n    NCR_Error,  NCR_Error,  NCR_First, NCR_First\n  },\n  {\n    \/\/ first is undef\n    NCR_Second, NCR_Second, NCR_DupUndef, NCR_Second\n  },\n  {\n    \/\/ first is sharedLib\n    NCR_Second, NCR_Second, NCR_First, NCR_DupShLib\n  }\n};\n\nstatic NameCollisionResolution collide(Atom::Definition first,\n                                       Atom::Definition second) {\n  return cases[first][second];\n}\n\nenum MergeResolution {\n  MCR_First,\n  MCR_Second,\n  MCR_Largest,\n  MCR_SameSize,\n  MCR_Error\n};\n\nstatic MergeResolution mergeCases[][6] = {\n  \/\/ no          tentative      weak          weakAddress   sameNameAndSize largest\n  {MCR_Error,    MCR_First,     MCR_First,    MCR_First,    MCR_SameSize,   MCR_Largest},  \/\/ no\n  {MCR_Second,   MCR_Largest,   MCR_Second,   MCR_Second,   MCR_SameSize,   MCR_Largest},  \/\/ tentative\n  {MCR_Second,   MCR_First,     MCR_First,    MCR_Second,   MCR_SameSize,   MCR_Largest},  \/\/ weak\n  {MCR_Second,   MCR_First,     MCR_First,    MCR_First,    MCR_SameSize,   MCR_Largest},  \/\/ weakAddress\n  {MCR_SameSize, MCR_SameSize,  MCR_SameSize, MCR_SameSize, MCR_SameSize,   MCR_SameSize}, \/\/ sameSize\n  {MCR_Largest,  MCR_Largest,   MCR_Largest,  MCR_Largest,  MCR_SameSize,   MCR_Largest},  \/\/ largest\n};\n\nstatic MergeResolution mergeSelect(DefinedAtom::Merge first,\n                                   DefinedAtom::Merge second) {\n  assert(first != DefinedAtom::mergeByContent);\n  assert(second != DefinedAtom::mergeByContent);\n  return mergeCases[first][second];\n}\n\nbool SymbolTable::addByName(const Atom &newAtom) {\n  StringRef name = newAtom.name();\n  assert(!name.empty());\n  const Atom *existing = findByName(name);\n  if (existing == nullptr) {\n    \/\/ Name is not in symbol table yet, add it associate with this atom.\n    _nameTable[name] = &newAtom;\n    return true;\n  }\n\n  \/\/ Do nothing if the same object is added more than once.\n  if (existing == &newAtom)\n    return false;\n\n  \/\/ Name is already in symbol table and associated with another atom.\n  bool useNew = true;\n  switch (collide(existing->definition(), newAtom.definition())) {\n  case NCR_First:\n    useNew = false;\n    break;\n  case NCR_Second:\n    useNew = true;\n    break;\n  case NCR_DupDef: {\n    const auto *existingDef = cast<DefinedAtom>(existing);\n    const auto *newDef = cast<DefinedAtom>(&newAtom);\n    switch (mergeSelect(existingDef->merge(), newDef->merge())) {\n    case MCR_First:\n      useNew = false;\n      break;\n    case MCR_Second:\n      useNew = true;\n      break;\n    case MCR_Largest: {\n      uint64_t existingSize = existingDef->sectionSize();\n      uint64_t newSize = newDef->sectionSize();\n      useNew = (newSize >= existingSize);\n      break;\n    }\n    case MCR_SameSize: {\n      uint64_t existingSize = existingDef->sectionSize();\n      uint64_t newSize = newDef->sectionSize();\n      if (existingSize == newSize) {\n        useNew = true;\n        break;\n      }\n      llvm::errs() << \"Size mismatch: \"\n                   << existing->name() << \" (\" << existingSize << \") \"\n                   << newAtom.name() << \" (\" << newSize << \")\\n\";\n      \/\/ fallthrough\n    }\n    case MCR_Error:\n      llvm::errs() << \"Duplicate symbols: \"\n                   << existing->name()\n                   << \":\"\n                   << existing->file().path()\n                   << \" and \"\n                   << newAtom.name()\n                   << \":\"\n                   << newAtom.file().path()\n                   << \"\\n\";\n      llvm::report_fatal_error(\"duplicate symbol error\");\n      break;\n    }\n    break;\n  }\n  case NCR_DupUndef: {\n    const UndefinedAtom* existingUndef = cast<UndefinedAtom>(existing);\n    const UndefinedAtom* newUndef = cast<UndefinedAtom>(&newAtom);\n\n    bool sameCanBeNull = (existingUndef->canBeNull() == newUndef->canBeNull());\n    if (sameCanBeNull)\n      useNew = false;\n    else\n      useNew = (newUndef->canBeNull() < existingUndef->canBeNull());\n    break;\n  }\n  case NCR_DupShLib: {\n    useNew = false;\n    break;\n  }\n  case NCR_Error:\n    llvm::errs() << \"SymbolTable: error while merging \" << name << \"\\n\";\n    llvm::report_fatal_error(\"duplicate symbol error\");\n    break;\n  }\n\n  if (useNew) {\n    \/\/ Update name table to use new atom.\n    _nameTable[name] = &newAtom;\n    \/\/ Add existing atom to replacement table.\n    _replacedAtoms[existing] = &newAtom;\n  } else {\n    \/\/ New atom is not being used.  Add it to replacement table.\n    _replacedAtoms[&newAtom] = existing;\n  }\n  return false;\n}\n\nunsigned SymbolTable::AtomMappingInfo::getHashValue(const DefinedAtom *atom) {\n  auto content = atom->rawContent();\n  return llvm::hash_combine(atom->size(),\n                            atom->contentType(),\n                            llvm::hash_combine_range(content.begin(),\n                                                     content.end()));\n}\n\nbool SymbolTable::AtomMappingInfo::isEqual(const DefinedAtom * const l,\n                                           const DefinedAtom * const r) {\n  if (l == r)\n    return true;\n  if (l == getEmptyKey())\n    return false;\n  if (r == getEmptyKey())\n    return false;\n  if (l == getTombstoneKey())\n    return false;\n  if (r == getTombstoneKey())\n    return false;\n  if (l->contentType() != r->contentType())\n    return false;\n  if (l->size() != r->size())\n    return false;\n  if (l->sectionChoice() != r->sectionChoice())\n    return false;\n  if (l->sectionChoice() == DefinedAtom::sectionCustomRequired) {\n    if (!l->customSectionName().equals(r->customSectionName()))\n      return false;\n  }\n  ArrayRef<uint8_t> lc = l->rawContent();\n  ArrayRef<uint8_t> rc = r->rawContent();\n  return memcmp(lc.data(), rc.data(), lc.size()) == 0;\n}\n\nbool SymbolTable::addByContent(const DefinedAtom &newAtom) {\n  AtomContentSet::iterator pos = _contentTable.find(&newAtom);\n  if (pos == _contentTable.end()) {\n    _contentTable.insert(&newAtom);\n    return true;\n  }\n  const Atom* existing = *pos;\n  \/\/ New atom is not being used.  Add it to replacement table.\n  _replacedAtoms[&newAtom] = existing;\n  return false;\n}\n\nconst Atom *SymbolTable::findByName(StringRef sym) {\n  NameToAtom::iterator pos = _nameTable.find(sym);\n  if (pos == _nameTable.end())\n    return nullptr;\n  return pos->second;\n}\n\nbool SymbolTable::isDefined(StringRef sym) {\n  if (const Atom *atom = findByName(sym))\n    return !isa<UndefinedAtom>(atom);\n  return false;\n}\n\nconst Atom *SymbolTable::replacement(const Atom *atom) {\n  \/\/ Find the replacement for a given atom. Atoms in _replacedAtoms\n  \/\/ may be chained, so find the last one.\n  for (;;) {\n    AtomToAtom::iterator pos = _replacedAtoms.find(atom);\n    if (pos == _replacedAtoms.end())\n      return atom;\n    atom = pos->second;\n  }\n}\n\nbool SymbolTable::isCoalescedAway(const Atom *atom) {\n  return _replacedAtoms.count(atom) > 0;\n}\n\nstd::vector<const UndefinedAtom *> SymbolTable::undefines() {\n  std::vector<const UndefinedAtom *> ret;\n  for (auto it : _nameTable) {\n    const Atom *atom = it.second;\n    assert(atom != nullptr);\n    if (const auto *undef = dyn_cast<const UndefinedAtom>(atom))\n      if (_replacedAtoms.count(undef) == 0)\n        ret.push_back(undef);\n  }\n  return ret;\n}\n\n} \/\/ namespace lld\n<commit_msg>[Core] Simplify a bit. NFCI.<commit_after>\/\/===- Core\/SymbolTable.cpp - Main Symbol Table ---------------------------===\/\/\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 \"lld\/Core\/SymbolTable.h\"\n#include \"lld\/Core\/AbsoluteAtom.h\"\n#include \"lld\/Core\/Atom.h\"\n#include \"lld\/Core\/DefinedAtom.h\"\n#include \"lld\/Core\/File.h\"\n#include \"lld\/Core\/LLVM.h\"\n#include \"lld\/Core\/LinkingContext.h\"\n#include \"lld\/Core\/Resolver.h\"\n#include \"lld\/Core\/SharedLibraryAtom.h\"\n#include \"lld\/Core\/UndefinedAtom.h\"\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/DenseMapInfo.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\n#include <cassert>\n#include <cstdlib>\n#include <vector>\n\nnamespace lld {\nbool SymbolTable::add(const UndefinedAtom &atom) { return addByName(atom); }\n\nbool SymbolTable::add(const SharedLibraryAtom &atom) { return addByName(atom); }\n\nbool SymbolTable::add(const AbsoluteAtom &atom) { return addByName(atom); }\n\nbool SymbolTable::add(const DefinedAtom &atom) {\n  if (!atom.name().empty() &&\n      atom.scope() != DefinedAtom::scopeTranslationUnit) {\n    \/\/ Named atoms cannot be merged by content.\n    assert(atom.merge() != DefinedAtom::mergeByContent);\n    \/\/ Track named atoms that are not scoped to file (static).\n    return addByName(atom);\n  }\n  if (atom.merge() == DefinedAtom::mergeByContent) {\n    \/\/ Named atoms cannot be merged by content.\n    assert(atom.name().empty());\n    \/\/ Currently only read-only constants can be merged.\n    if (atom.permissions() == DefinedAtom::permR__)\n      return addByContent(atom);\n    \/\/ TODO: support mergeByContent of data atoms by comparing content & fixups.\n  }\n  return false;\n}\n\nenum NameCollisionResolution {\n  NCR_First,\n  NCR_Second,\n  NCR_DupDef,\n  NCR_DupUndef,\n  NCR_DupShLib,\n  NCR_Error\n};\n\nstatic NameCollisionResolution cases[4][4] = {\n  \/\/regular     absolute    undef      sharedLib\n  {\n    \/\/ first is regular\n    NCR_DupDef, NCR_Error,   NCR_First, NCR_First\n  },\n  {\n    \/\/ first is absolute\n    NCR_Error,  NCR_Error,  NCR_First, NCR_First\n  },\n  {\n    \/\/ first is undef\n    NCR_Second, NCR_Second, NCR_DupUndef, NCR_Second\n  },\n  {\n    \/\/ first is sharedLib\n    NCR_Second, NCR_Second, NCR_First, NCR_DupShLib\n  }\n};\n\nstatic NameCollisionResolution collide(Atom::Definition first,\n                                       Atom::Definition second) {\n  return cases[first][second];\n}\n\nenum MergeResolution {\n  MCR_First,\n  MCR_Second,\n  MCR_Largest,\n  MCR_SameSize,\n  MCR_Error\n};\n\nstatic MergeResolution mergeCases[][6] = {\n  \/\/ no          tentative      weak          weakAddress   sameNameAndSize largest\n  {MCR_Error,    MCR_First,     MCR_First,    MCR_First,    MCR_SameSize,   MCR_Largest},  \/\/ no\n  {MCR_Second,   MCR_Largest,   MCR_Second,   MCR_Second,   MCR_SameSize,   MCR_Largest},  \/\/ tentative\n  {MCR_Second,   MCR_First,     MCR_First,    MCR_Second,   MCR_SameSize,   MCR_Largest},  \/\/ weak\n  {MCR_Second,   MCR_First,     MCR_First,    MCR_First,    MCR_SameSize,   MCR_Largest},  \/\/ weakAddress\n  {MCR_SameSize, MCR_SameSize,  MCR_SameSize, MCR_SameSize, MCR_SameSize,   MCR_SameSize}, \/\/ sameSize\n  {MCR_Largest,  MCR_Largest,   MCR_Largest,  MCR_Largest,  MCR_SameSize,   MCR_Largest},  \/\/ largest\n};\n\nstatic MergeResolution mergeSelect(DefinedAtom::Merge first,\n                                   DefinedAtom::Merge second) {\n  assert(first != DefinedAtom::mergeByContent);\n  assert(second != DefinedAtom::mergeByContent);\n  return mergeCases[first][second];\n}\n\nbool SymbolTable::addByName(const Atom &newAtom) {\n  StringRef name = newAtom.name();\n  assert(!name.empty());\n  const Atom *existing = findByName(name);\n  if (existing == nullptr) {\n    \/\/ Name is not in symbol table yet, add it associate with this atom.\n    _nameTable[name] = &newAtom;\n    return true;\n  }\n\n  \/\/ Do nothing if the same object is added more than once.\n  if (existing == &newAtom)\n    return false;\n\n  \/\/ Name is already in symbol table and associated with another atom.\n  bool useNew = true;\n  switch (collide(existing->definition(), newAtom.definition())) {\n  case NCR_First:\n    useNew = false;\n    break;\n  case NCR_Second:\n    useNew = true;\n    break;\n  case NCR_DupDef: {\n    const auto *existingDef = cast<DefinedAtom>(existing);\n    const auto *newDef = cast<DefinedAtom>(&newAtom);\n    switch (mergeSelect(existingDef->merge(), newDef->merge())) {\n    case MCR_First:\n      useNew = false;\n      break;\n    case MCR_Second:\n      useNew = true;\n      break;\n    case MCR_Largest: {\n      uint64_t existingSize = existingDef->sectionSize();\n      uint64_t newSize = newDef->sectionSize();\n      useNew = (newSize >= existingSize);\n      break;\n    }\n    case MCR_SameSize: {\n      uint64_t existingSize = existingDef->sectionSize();\n      uint64_t newSize = newDef->sectionSize();\n      if (existingSize == newSize) {\n        useNew = true;\n        break;\n      }\n      llvm::errs() << \"Size mismatch: \"\n                   << existing->name() << \" (\" << existingSize << \") \"\n                   << newAtom.name() << \" (\" << newSize << \")\\n\";\n      \/\/ fallthrough\n    }\n    case MCR_Error:\n      llvm::errs() << \"Duplicate symbols: \"\n                   << existing->name()\n                   << \":\"\n                   << existing->file().path()\n                   << \" and \"\n                   << newAtom.name()\n                   << \":\"\n                   << newAtom.file().path()\n                   << \"\\n\";\n      llvm::report_fatal_error(\"duplicate symbol error\");\n      break;\n    }\n    break;\n  }\n  case NCR_DupUndef: {\n    const UndefinedAtom* existingUndef = cast<UndefinedAtom>(existing);\n    const UndefinedAtom* newUndef = cast<UndefinedAtom>(&newAtom);\n\n    bool sameCanBeNull = (existingUndef->canBeNull() == newUndef->canBeNull());\n    if (sameCanBeNull)\n      useNew = false;\n    else\n      useNew = (newUndef->canBeNull() < existingUndef->canBeNull());\n    break;\n  }\n  case NCR_DupShLib: {\n    useNew = false;\n    break;\n  }\n  case NCR_Error:\n    llvm::errs() << \"SymbolTable: error while merging \" << name << \"\\n\";\n    llvm::report_fatal_error(\"duplicate symbol error\");\n    break;\n  }\n\n  if (useNew) {\n    \/\/ Update name table to use new atom.\n    _nameTable[name] = &newAtom;\n    \/\/ Add existing atom to replacement table.\n    _replacedAtoms[existing] = &newAtom;\n  } else {\n    \/\/ New atom is not being used.  Add it to replacement table.\n    _replacedAtoms[&newAtom] = existing;\n  }\n  return false;\n}\n\nunsigned SymbolTable::AtomMappingInfo::getHashValue(const DefinedAtom *atom) {\n  auto content = atom->rawContent();\n  return llvm::hash_combine(atom->size(),\n                            atom->contentType(),\n                            llvm::hash_combine_range(content.begin(),\n                                                     content.end()));\n}\n\nbool SymbolTable::AtomMappingInfo::isEqual(const DefinedAtom * const l,\n                                           const DefinedAtom * const r) {\n  if (l == r)\n    return true;\n  if (l == getEmptyKey() || r == getEmptyKey())\n    return false;\n  if (l == getTombstoneKey() || r == getTombstoneKey())\n    return false;\n  if (l->contentType() != r->contentType())\n    return false;\n  if (l->size() != r->size())\n    return false;\n  if (l->sectionChoice() != r->sectionChoice())\n    return false;\n  if (l->sectionChoice() == DefinedAtom::sectionCustomRequired) {\n    if (!l->customSectionName().equals(r->customSectionName()))\n      return false;\n  }\n  ArrayRef<uint8_t> lc = l->rawContent();\n  ArrayRef<uint8_t> rc = r->rawContent();\n  return memcmp(lc.data(), rc.data(), lc.size()) == 0;\n}\n\nbool SymbolTable::addByContent(const DefinedAtom &newAtom) {\n  AtomContentSet::iterator pos = _contentTable.find(&newAtom);\n  if (pos == _contentTable.end()) {\n    _contentTable.insert(&newAtom);\n    return true;\n  }\n  const Atom* existing = *pos;\n  \/\/ New atom is not being used.  Add it to replacement table.\n  _replacedAtoms[&newAtom] = existing;\n  return false;\n}\n\nconst Atom *SymbolTable::findByName(StringRef sym) {\n  NameToAtom::iterator pos = _nameTable.find(sym);\n  if (pos == _nameTable.end())\n    return nullptr;\n  return pos->second;\n}\n\nbool SymbolTable::isDefined(StringRef sym) {\n  if (const Atom *atom = findByName(sym))\n    return !isa<UndefinedAtom>(atom);\n  return false;\n}\n\nconst Atom *SymbolTable::replacement(const Atom *atom) {\n  \/\/ Find the replacement for a given atom. Atoms in _replacedAtoms\n  \/\/ may be chained, so find the last one.\n  for (;;) {\n    AtomToAtom::iterator pos = _replacedAtoms.find(atom);\n    if (pos == _replacedAtoms.end())\n      return atom;\n    atom = pos->second;\n  }\n}\n\nbool SymbolTable::isCoalescedAway(const Atom *atom) {\n  return _replacedAtoms.count(atom) > 0;\n}\n\nstd::vector<const UndefinedAtom *> SymbolTable::undefines() {\n  std::vector<const UndefinedAtom *> ret;\n  for (auto it : _nameTable) {\n    const Atom *atom = it.second;\n    assert(atom != nullptr);\n    if (const auto *undef = dyn_cast<const UndefinedAtom>(atom))\n      if (_replacedAtoms.count(undef) == 0)\n        ret.push_back(undef);\n  }\n  return ret;\n}\n\n} \/\/ namespace lld\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- Core\/SymbolTable.cpp - Main Symbol Table ---------------------------===\/\/\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 \"lld\/Core\/SymbolTable.h\"\n#include \"lld\/Core\/AbsoluteAtom.h\"\n#include \"lld\/Core\/Atom.h\"\n#include \"lld\/Core\/DefinedAtom.h\"\n#include \"lld\/Core\/File.h\"\n#include \"lld\/Core\/LLVM.h\"\n#include \"lld\/Core\/Resolver.h\"\n#include \"lld\/Core\/SharedLibraryAtom.h\"\n#include \"lld\/Core\/LinkingContext.h\"\n#include \"lld\/Core\/UndefinedAtom.h\"\n\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/DenseMapInfo.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstdlib>\n#include <vector>\n\nnamespace lld {\nSymbolTable::SymbolTable(const LinkingContext &context) : _context(context) {}\n\nvoid SymbolTable::add(const UndefinedAtom &atom) { addByName(atom); }\n\nvoid SymbolTable::add(const SharedLibraryAtom &atom) { addByName(atom); }\n\nvoid SymbolTable::add(const AbsoluteAtom &atom) { addByName(atom); }\n\nvoid SymbolTable::add(const DefinedAtom &atom) {\n  if (!atom.name().empty() &&\n      atom.scope() != DefinedAtom::scopeTranslationUnit) {\n    \/\/ Named atoms cannot be merged by content.\n    assert(atom.merge() != DefinedAtom::mergeByContent);\n    \/\/ Track named atoms that are not scoped to file (static).\n    addByName(atom);\n    return;\n  }\n  if (atom.merge() == DefinedAtom::mergeByContent) {\n    \/\/ Named atoms cannot be merged by content.\n    assert(atom.name().empty());\n    addByContent(atom);\n  }\n}\n\nconst Atom *SymbolTable::findGroup(StringRef sym) {\n  NameToAtom::iterator pos = _groupTable.find(sym);\n  if (pos == _groupTable.end())\n    return nullptr;\n  return pos->second;\n}\n\nbool SymbolTable::addGroup(const DefinedAtom &da) {\n  StringRef name = da.name();\n  assert(!name.empty());\n  const Atom *existing = findGroup(name);\n  if (existing == nullptr) {\n    _groupTable[name] = &da;\n    return true;\n  }\n  _replacedAtoms[&da] = existing;\n  return false;\n}\n\nenum NameCollisionResolution {\n  NCR_First,\n  NCR_Second,\n  NCR_DupDef,\n  NCR_DupUndef,\n  NCR_DupShLib,\n  NCR_Error\n};\n\nstatic NameCollisionResolution cases[4][4] = {\n  \/\/regular     absolute    undef      sharedLib\n  {\n    \/\/ first is regular\n    NCR_DupDef, NCR_Error,   NCR_First, NCR_First\n  },\n  {\n    \/\/ first is absolute\n    NCR_Error,  NCR_Error,  NCR_First, NCR_First\n  },\n  {\n    \/\/ first is undef\n    NCR_Second, NCR_Second, NCR_DupUndef, NCR_Second\n  },\n  {\n    \/\/ first is sharedLib\n    NCR_Second, NCR_Second, NCR_First, NCR_DupShLib\n  }\n};\n\nstatic NameCollisionResolution collide(Atom::Definition first,\n                                       Atom::Definition second) {\n  return cases[first][second];\n}\n\nenum MergeResolution {\n  MCR_First,\n  MCR_Second,\n  MCR_Largest,\n  MCR_SameSize,\n  MCR_Error\n};\n\nstatic MergeResolution mergeCases[][6] = {\n  \/\/ no          tentative      weak          weakAddress   sameNameAndSize largest\n  {MCR_Error,    MCR_First,     MCR_First,    MCR_First,    MCR_SameSize,   MCR_Largest},  \/\/ no\n  {MCR_Second,   MCR_Largest,   MCR_Second,   MCR_Second,   MCR_SameSize,   MCR_Largest},  \/\/ tentative\n  {MCR_Second,   MCR_First,     MCR_First,    MCR_Second,   MCR_SameSize,   MCR_Largest},  \/\/ weak\n  {MCR_Second,   MCR_First,     MCR_First,    MCR_First,    MCR_SameSize,   MCR_Largest},  \/\/ weakAddress\n  {MCR_SameSize, MCR_SameSize,  MCR_SameSize, MCR_SameSize, MCR_SameSize,   MCR_SameSize}, \/\/ sameSize\n  {MCR_Largest,  MCR_Largest,   MCR_Largest,  MCR_Largest,  MCR_SameSize,   MCR_Largest},  \/\/ largest\n};\n\nstatic MergeResolution mergeSelect(DefinedAtom::Merge first,\n                                   DefinedAtom::Merge second) {\n  assert(first != DefinedAtom::mergeByContent);\n  assert(second != DefinedAtom::mergeByContent);\n  return mergeCases[first][second];\n}\n\nstatic uint64_t getSizeFollowReferences(const DefinedAtom *atom, uint32_t kind) {\n  uint64_t size = 0;\nredo:\n  while (atom) {\n    for (const Reference *r : *atom) {\n      if (r->kindNamespace() == Reference::KindNamespace::all &&\n          r->kindArch() == Reference::KindArch::all &&\n          r->kindValue() == kind) {\n        atom = cast<DefinedAtom>(r->target());\n        size += atom->size();\n        goto redo;\n      }\n    }\n    break;\n  }\n  return size;\n}\n\n\/\/ Returns the size of the section containing the given atom. Atoms in the same\n\/\/ section are connected by layout-before and layout-after edges, so this\n\/\/ function traverses them to get the total size of atoms in the same section.\nstatic uint64_t sectionSize(const DefinedAtom *atom) {\n  return atom->size()\n      + getSizeFollowReferences(atom, lld::Reference::kindLayoutBefore)\n      + getSizeFollowReferences(atom, lld::Reference::kindLayoutAfter);\n}\n\nvoid SymbolTable::addByName(const Atom &newAtom) {\n  StringRef name = newAtom.name();\n  assert(!name.empty());\n  const Atom *existing = findByName(name);\n  if (existing == nullptr) {\n    \/\/ Name is not in symbol table yet, add it associate with this atom.\n    _nameTable[name] = &newAtom;\n    return;\n  }\n\n  \/\/ Name is already in symbol table and associated with another atom.\n  bool useNew = true;\n  switch (collide(existing->definition(), newAtom.definition())) {\n  case NCR_First:\n    useNew = false;\n    break;\n  case NCR_Second:\n    useNew = true;\n    break;\n  case NCR_DupDef:\n    assert(existing->definition() == Atom::definitionRegular);\n    assert(newAtom.definition() == Atom::definitionRegular);\n    switch (mergeSelect(((DefinedAtom*)existing)->merge(),\n                        ((DefinedAtom*)&newAtom)->merge())) {\n    case MCR_First:\n      useNew = false;\n      break;\n    case MCR_Second:\n      useNew = true;\n      break;\n    case MCR_Largest: {\n      uint64_t existingSize = sectionSize((DefinedAtom*)existing);\n      uint64_t newSize = sectionSize((DefinedAtom*)&newAtom);\n      useNew = (newSize >= existingSize);\n      break;\n    }\n    case MCR_SameSize: {\n      uint64_t existingSize = sectionSize((DefinedAtom*)existing);\n      uint64_t newSize = sectionSize((DefinedAtom*)&newAtom);\n      if (existingSize == newSize) {\n        useNew = true;\n        break;\n      }\n      llvm::errs() << \"Size mismatch: \"\n                   << existing->name() << \" (\" << existingSize << \") \"\n                   << newAtom.name() << \" (\" << newSize << \")\\n\";\n      \/\/ fallthrough\n    }\n    case MCR_Error:\n      if (!_context.getAllowDuplicates()) {\n        llvm::errs() << \"Duplicate symbols: \"\n                     << existing->name()\n                     << \":\"\n                     << existing->file().path()\n                     << \" and \"\n                     << newAtom.name()\n                     << \":\"\n                     << newAtom.file().path()\n                     << \"\\n\";\n        llvm::report_fatal_error(\"duplicate symbol error\");\n      }\n      useNew = false;\n      break;\n    }\n    break;\n  case NCR_DupUndef: {\n    const UndefinedAtom* existingUndef = dyn_cast<UndefinedAtom>(existing);\n    const UndefinedAtom* newUndef = dyn_cast<UndefinedAtom>(&newAtom);\n    assert(existingUndef != nullptr);\n    assert(newUndef != nullptr);\n\n    bool sameCanBeNull = (existingUndef->canBeNull() == newUndef->canBeNull());\n    if (!sameCanBeNull &&\n        _context.warnIfCoalesableAtomsHaveDifferentCanBeNull()) {\n      llvm::errs() << \"lld warning: undefined symbol \"\n                   << existingUndef->name()\n                   << \" has different weakness in \"\n                   << existingUndef->file().path()\n                   << \" and in \" << newUndef->file().path() << \"\\n\";\n    }\n\n    const UndefinedAtom *existingFallback = existingUndef->fallback();\n    const UndefinedAtom *newFallback = newUndef->fallback();\n    bool hasDifferentFallback =\n        (existingFallback && newFallback &&\n         existingFallback->name() != newFallback->name());\n    if (hasDifferentFallback) {\n      llvm::errs() << \"lld warning: undefined symbol \"\n                   << existingUndef->name() << \" has different fallback: \"\n                   << existingFallback->name() << \" in \"\n                   << existingUndef->file().path() << \" and \"\n                   << newFallback->name() << \" in \"\n                   << newUndef->file().path() << \"\\n\";\n    }\n\n    bool hasNewFallback = newUndef->fallback();\n    if (sameCanBeNull)\n      useNew = hasNewFallback;\n    else\n      useNew = (newUndef->canBeNull() < existingUndef->canBeNull());\n    break;\n  }\n  case NCR_DupShLib: {\n      const SharedLibraryAtom* curShLib =\n        dyn_cast<SharedLibraryAtom>(existing);\n      const SharedLibraryAtom* newShLib =\n        dyn_cast<SharedLibraryAtom>(&newAtom);\n      assert(curShLib != nullptr);\n      assert(newShLib != nullptr);\n      bool sameNullness = (curShLib->canBeNullAtRuntime()\n                                      == newShLib->canBeNullAtRuntime());\n      bool sameName = curShLib->loadName().equals(newShLib->loadName());\n      if (!sameName) {\n        useNew = false;\n        if (_context.warnIfCoalesableAtomsHaveDifferentLoadName()) {\n          \/\/ FIXME: need diagonstics interface for writing warning messages\n          llvm::errs() << \"lld warning: shared library symbol \"\n                       << curShLib->name()\n                       << \" has different load path in \"\n                       << curShLib->file().path()\n                       << \" and in \"\n                       << newShLib->file().path();\n        }\n      } else if (!sameNullness) {\n        useNew = false;\n        if (_context.warnIfCoalesableAtomsHaveDifferentCanBeNull()) {\n          \/\/ FIXME: need diagonstics interface for writing warning messages\n          llvm::errs() << \"lld warning: shared library symbol \"\n                       << curShLib->name()\n                       << \" has different weakness in \"\n                       << curShLib->file().path()\n                       << \" and in \"\n                       << newShLib->file().path();\n        }\n      } else {\n        \/\/ Both shlib atoms are identical and can be coalesced.\n        useNew = false;\n      }\n    }\n    break;\n  case NCR_Error:\n    llvm::errs() << \"SymbolTable: error while merging \" << name << \"\\n\";\n    llvm::report_fatal_error(\"duplicate symbol error\");\n    break;\n  }\n\n  if (useNew) {\n    \/\/ Update name table to use new atom.\n    _nameTable[name] = &newAtom;\n    \/\/ Add existing atom to replacement table.\n    _replacedAtoms[existing] = &newAtom;\n  } else {\n    \/\/ New atom is not being used.  Add it to replacement table.\n    _replacedAtoms[&newAtom] = existing;\n  }\n}\n\nunsigned SymbolTable::AtomMappingInfo::getHashValue(const DefinedAtom *atom) {\n  auto content = atom->rawContent();\n  return llvm::hash_combine(atom->size(),\n                            atom->contentType(),\n                            llvm::hash_combine_range(content.begin(),\n                                                     content.end()));\n}\n\nbool SymbolTable::AtomMappingInfo::isEqual(const DefinedAtom * const l,\n                                           const DefinedAtom * const r) {\n  if (l == r)\n    return true;\n  if (l == getEmptyKey())\n    return false;\n  if (r == getEmptyKey())\n    return false;\n  if (l == getTombstoneKey())\n    return false;\n  if (r == getTombstoneKey())\n    return false;\n\n  if (l->contentType() != r->contentType())\n    return false;\n  if (l->size() != r->size())\n    return false;\n  ArrayRef<uint8_t> lc = l->rawContent();\n  ArrayRef<uint8_t> rc = r->rawContent();\n  return memcmp(lc.data(), rc.data(), lc.size()) == 0;\n}\n\nvoid SymbolTable::addByContent(const DefinedAtom & newAtom) {\n  \/\/ Currently only read-only constants can be merged.\n  assert(newAtom.permissions() == DefinedAtom::permR__);\n  AtomContentSet::iterator pos = _contentTable.find(&newAtom);\n  if (pos == _contentTable.end()) {\n    _contentTable.insert(&newAtom);\n    return;\n  }\n  const Atom* existing = *pos;\n  \/\/ New atom is not being used.  Add it to replacement table.\n  _replacedAtoms[&newAtom] = existing;\n}\n\nconst Atom *SymbolTable::findByName(StringRef sym) {\n  NameToAtom::iterator pos = _nameTable.find(sym);\n  if (pos == _nameTable.end())\n    return nullptr;\n  return pos->second;\n}\n\nbool SymbolTable::isDefined(StringRef sym) {\n  if (const Atom *atom = findByName(sym))\n    return atom->definition() != Atom::definitionUndefined;\n  return false;\n}\n\nvoid SymbolTable::addReplacement(const Atom *replaced,\n                                 const Atom *replacement) {\n  _replacedAtoms[replaced] = replacement;\n}\n\nconst Atom *SymbolTable::replacement(const Atom *atom) {\n  for (;;) {\n    AtomToAtom::iterator pos = _replacedAtoms.find(atom);\n    if (pos == _replacedAtoms.end())\n      return atom;\n    \/\/ might be chain, recurse to end\n    atom = pos->second;\n  }\n}\n\nunsigned int SymbolTable::size() {\n  return _nameTable.size();\n}\n\nvoid SymbolTable::undefines(std::vector<const UndefinedAtom *> &undefs) {\n  for (auto it : _nameTable) {\n    const Atom *atom = it.second;\n    assert(atom != nullptr);\n    if (const auto undef = dyn_cast<const UndefinedAtom>(atom)) {\n      AtomToAtom::iterator pos = _replacedAtoms.find(undef);\n      if (pos != _replacedAtoms.end())\n        continue;\n      undefs.push_back(undef);\n    }\n  }\n}\n\nvoid SymbolTable::tentativeDefinitions(std::vector<StringRef> &names) {\n  for (auto entry : _nameTable) {\n    const Atom *atom = entry.second;\n    StringRef name   = entry.first;\n    assert(atom != nullptr);\n    if (const DefinedAtom *defAtom = dyn_cast<DefinedAtom>(atom))\n      if (defAtom->merge() == DefinedAtom::mergeAsTentative)\n        names.push_back(name);\n  }\n}\n} \/\/ namespace lld\n<commit_msg>Update comment.<commit_after>\/\/===- Core\/SymbolTable.cpp - Main Symbol Table ---------------------------===\/\/\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 \"lld\/Core\/SymbolTable.h\"\n#include \"lld\/Core\/AbsoluteAtom.h\"\n#include \"lld\/Core\/Atom.h\"\n#include \"lld\/Core\/DefinedAtom.h\"\n#include \"lld\/Core\/File.h\"\n#include \"lld\/Core\/LLVM.h\"\n#include \"lld\/Core\/Resolver.h\"\n#include \"lld\/Core\/SharedLibraryAtom.h\"\n#include \"lld\/Core\/LinkingContext.h\"\n#include \"lld\/Core\/UndefinedAtom.h\"\n\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/DenseMapInfo.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstdlib>\n#include <vector>\n\nnamespace lld {\nSymbolTable::SymbolTable(const LinkingContext &context) : _context(context) {}\n\nvoid SymbolTable::add(const UndefinedAtom &atom) { addByName(atom); }\n\nvoid SymbolTable::add(const SharedLibraryAtom &atom) { addByName(atom); }\n\nvoid SymbolTable::add(const AbsoluteAtom &atom) { addByName(atom); }\n\nvoid SymbolTable::add(const DefinedAtom &atom) {\n  if (!atom.name().empty() &&\n      atom.scope() != DefinedAtom::scopeTranslationUnit) {\n    \/\/ Named atoms cannot be merged by content.\n    assert(atom.merge() != DefinedAtom::mergeByContent);\n    \/\/ Track named atoms that are not scoped to file (static).\n    addByName(atom);\n    return;\n  }\n  if (atom.merge() == DefinedAtom::mergeByContent) {\n    \/\/ Named atoms cannot be merged by content.\n    assert(atom.name().empty());\n    addByContent(atom);\n  }\n}\n\nconst Atom *SymbolTable::findGroup(StringRef sym) {\n  NameToAtom::iterator pos = _groupTable.find(sym);\n  if (pos == _groupTable.end())\n    return nullptr;\n  return pos->second;\n}\n\nbool SymbolTable::addGroup(const DefinedAtom &da) {\n  StringRef name = da.name();\n  assert(!name.empty());\n  const Atom *existing = findGroup(name);\n  if (existing == nullptr) {\n    _groupTable[name] = &da;\n    return true;\n  }\n  _replacedAtoms[&da] = existing;\n  return false;\n}\n\nenum NameCollisionResolution {\n  NCR_First,\n  NCR_Second,\n  NCR_DupDef,\n  NCR_DupUndef,\n  NCR_DupShLib,\n  NCR_Error\n};\n\nstatic NameCollisionResolution cases[4][4] = {\n  \/\/regular     absolute    undef      sharedLib\n  {\n    \/\/ first is regular\n    NCR_DupDef, NCR_Error,   NCR_First, NCR_First\n  },\n  {\n    \/\/ first is absolute\n    NCR_Error,  NCR_Error,  NCR_First, NCR_First\n  },\n  {\n    \/\/ first is undef\n    NCR_Second, NCR_Second, NCR_DupUndef, NCR_Second\n  },\n  {\n    \/\/ first is sharedLib\n    NCR_Second, NCR_Second, NCR_First, NCR_DupShLib\n  }\n};\n\nstatic NameCollisionResolution collide(Atom::Definition first,\n                                       Atom::Definition second) {\n  return cases[first][second];\n}\n\nenum MergeResolution {\n  MCR_First,\n  MCR_Second,\n  MCR_Largest,\n  MCR_SameSize,\n  MCR_Error\n};\n\nstatic MergeResolution mergeCases[][6] = {\n  \/\/ no          tentative      weak          weakAddress   sameNameAndSize largest\n  {MCR_Error,    MCR_First,     MCR_First,    MCR_First,    MCR_SameSize,   MCR_Largest},  \/\/ no\n  {MCR_Second,   MCR_Largest,   MCR_Second,   MCR_Second,   MCR_SameSize,   MCR_Largest},  \/\/ tentative\n  {MCR_Second,   MCR_First,     MCR_First,    MCR_Second,   MCR_SameSize,   MCR_Largest},  \/\/ weak\n  {MCR_Second,   MCR_First,     MCR_First,    MCR_First,    MCR_SameSize,   MCR_Largest},  \/\/ weakAddress\n  {MCR_SameSize, MCR_SameSize,  MCR_SameSize, MCR_SameSize, MCR_SameSize,   MCR_SameSize}, \/\/ sameSize\n  {MCR_Largest,  MCR_Largest,   MCR_Largest,  MCR_Largest,  MCR_SameSize,   MCR_Largest},  \/\/ largest\n};\n\nstatic MergeResolution mergeSelect(DefinedAtom::Merge first,\n                                   DefinedAtom::Merge second) {\n  assert(first != DefinedAtom::mergeByContent);\n  assert(second != DefinedAtom::mergeByContent);\n  return mergeCases[first][second];\n}\n\nstatic uint64_t getSizeFollowReferences(const DefinedAtom *atom, uint32_t kind) {\n  uint64_t size = 0;\nredo:\n  while (atom) {\n    for (const Reference *r : *atom) {\n      if (r->kindNamespace() == Reference::KindNamespace::all &&\n          r->kindArch() == Reference::KindArch::all &&\n          r->kindValue() == kind) {\n        atom = cast<DefinedAtom>(r->target());\n        size += atom->size();\n        goto redo;\n      }\n    }\n    break;\n  }\n  return size;\n}\n\n\/\/ Returns the size of the section containing the given atom. Atoms in the same\n\/\/ section are connected by layout-before and layout-after edges, so this\n\/\/ function traverses them to get the total size of atoms in the same section.\nstatic uint64_t sectionSize(const DefinedAtom *atom) {\n  return atom->size()\n      + getSizeFollowReferences(atom, lld::Reference::kindLayoutBefore)\n      + getSizeFollowReferences(atom, lld::Reference::kindLayoutAfter);\n}\n\nvoid SymbolTable::addByName(const Atom &newAtom) {\n  StringRef name = newAtom.name();\n  assert(!name.empty());\n  const Atom *existing = findByName(name);\n  if (existing == nullptr) {\n    \/\/ Name is not in symbol table yet, add it associate with this atom.\n    _nameTable[name] = &newAtom;\n    return;\n  }\n\n  \/\/ Name is already in symbol table and associated with another atom.\n  bool useNew = true;\n  switch (collide(existing->definition(), newAtom.definition())) {\n  case NCR_First:\n    useNew = false;\n    break;\n  case NCR_Second:\n    useNew = true;\n    break;\n  case NCR_DupDef:\n    assert(existing->definition() == Atom::definitionRegular);\n    assert(newAtom.definition() == Atom::definitionRegular);\n    switch (mergeSelect(((DefinedAtom*)existing)->merge(),\n                        ((DefinedAtom*)&newAtom)->merge())) {\n    case MCR_First:\n      useNew = false;\n      break;\n    case MCR_Second:\n      useNew = true;\n      break;\n    case MCR_Largest: {\n      uint64_t existingSize = sectionSize((DefinedAtom*)existing);\n      uint64_t newSize = sectionSize((DefinedAtom*)&newAtom);\n      useNew = (newSize >= existingSize);\n      break;\n    }\n    case MCR_SameSize: {\n      uint64_t existingSize = sectionSize((DefinedAtom*)existing);\n      uint64_t newSize = sectionSize((DefinedAtom*)&newAtom);\n      if (existingSize == newSize) {\n        useNew = true;\n        break;\n      }\n      llvm::errs() << \"Size mismatch: \"\n                   << existing->name() << \" (\" << existingSize << \") \"\n                   << newAtom.name() << \" (\" << newSize << \")\\n\";\n      \/\/ fallthrough\n    }\n    case MCR_Error:\n      if (!_context.getAllowDuplicates()) {\n        llvm::errs() << \"Duplicate symbols: \"\n                     << existing->name()\n                     << \":\"\n                     << existing->file().path()\n                     << \" and \"\n                     << newAtom.name()\n                     << \":\"\n                     << newAtom.file().path()\n                     << \"\\n\";\n        llvm::report_fatal_error(\"duplicate symbol error\");\n      }\n      useNew = false;\n      break;\n    }\n    break;\n  case NCR_DupUndef: {\n    const UndefinedAtom* existingUndef = dyn_cast<UndefinedAtom>(existing);\n    const UndefinedAtom* newUndef = dyn_cast<UndefinedAtom>(&newAtom);\n    assert(existingUndef != nullptr);\n    assert(newUndef != nullptr);\n\n    bool sameCanBeNull = (existingUndef->canBeNull() == newUndef->canBeNull());\n    if (!sameCanBeNull &&\n        _context.warnIfCoalesableAtomsHaveDifferentCanBeNull()) {\n      llvm::errs() << \"lld warning: undefined symbol \"\n                   << existingUndef->name()\n                   << \" has different weakness in \"\n                   << existingUndef->file().path()\n                   << \" and in \" << newUndef->file().path() << \"\\n\";\n    }\n\n    const UndefinedAtom *existingFallback = existingUndef->fallback();\n    const UndefinedAtom *newFallback = newUndef->fallback();\n    bool hasDifferentFallback =\n        (existingFallback && newFallback &&\n         existingFallback->name() != newFallback->name());\n    if (hasDifferentFallback) {\n      llvm::errs() << \"lld warning: undefined symbol \"\n                   << existingUndef->name() << \" has different fallback: \"\n                   << existingFallback->name() << \" in \"\n                   << existingUndef->file().path() << \" and \"\n                   << newFallback->name() << \" in \"\n                   << newUndef->file().path() << \"\\n\";\n    }\n\n    bool hasNewFallback = newUndef->fallback();\n    if (sameCanBeNull)\n      useNew = hasNewFallback;\n    else\n      useNew = (newUndef->canBeNull() < existingUndef->canBeNull());\n    break;\n  }\n  case NCR_DupShLib: {\n      const SharedLibraryAtom* curShLib =\n        dyn_cast<SharedLibraryAtom>(existing);\n      const SharedLibraryAtom* newShLib =\n        dyn_cast<SharedLibraryAtom>(&newAtom);\n      assert(curShLib != nullptr);\n      assert(newShLib != nullptr);\n      bool sameNullness = (curShLib->canBeNullAtRuntime()\n                                      == newShLib->canBeNullAtRuntime());\n      bool sameName = curShLib->loadName().equals(newShLib->loadName());\n      if (!sameName) {\n        useNew = false;\n        if (_context.warnIfCoalesableAtomsHaveDifferentLoadName()) {\n          \/\/ FIXME: need diagonstics interface for writing warning messages\n          llvm::errs() << \"lld warning: shared library symbol \"\n                       << curShLib->name()\n                       << \" has different load path in \"\n                       << curShLib->file().path()\n                       << \" and in \"\n                       << newShLib->file().path();\n        }\n      } else if (!sameNullness) {\n        useNew = false;\n        if (_context.warnIfCoalesableAtomsHaveDifferentCanBeNull()) {\n          \/\/ FIXME: need diagonstics interface for writing warning messages\n          llvm::errs() << \"lld warning: shared library symbol \"\n                       << curShLib->name()\n                       << \" has different weakness in \"\n                       << curShLib->file().path()\n                       << \" and in \"\n                       << newShLib->file().path();\n        }\n      } else {\n        \/\/ Both shlib atoms are identical and can be coalesced.\n        useNew = false;\n      }\n    }\n    break;\n  case NCR_Error:\n    llvm::errs() << \"SymbolTable: error while merging \" << name << \"\\n\";\n    llvm::report_fatal_error(\"duplicate symbol error\");\n    break;\n  }\n\n  if (useNew) {\n    \/\/ Update name table to use new atom.\n    _nameTable[name] = &newAtom;\n    \/\/ Add existing atom to replacement table.\n    _replacedAtoms[existing] = &newAtom;\n  } else {\n    \/\/ New atom is not being used.  Add it to replacement table.\n    _replacedAtoms[&newAtom] = existing;\n  }\n}\n\nunsigned SymbolTable::AtomMappingInfo::getHashValue(const DefinedAtom *atom) {\n  auto content = atom->rawContent();\n  return llvm::hash_combine(atom->size(),\n                            atom->contentType(),\n                            llvm::hash_combine_range(content.begin(),\n                                                     content.end()));\n}\n\nbool SymbolTable::AtomMappingInfo::isEqual(const DefinedAtom * const l,\n                                           const DefinedAtom * const r) {\n  if (l == r)\n    return true;\n  if (l == getEmptyKey())\n    return false;\n  if (r == getEmptyKey())\n    return false;\n  if (l == getTombstoneKey())\n    return false;\n  if (r == getTombstoneKey())\n    return false;\n\n  if (l->contentType() != r->contentType())\n    return false;\n  if (l->size() != r->size())\n    return false;\n  ArrayRef<uint8_t> lc = l->rawContent();\n  ArrayRef<uint8_t> rc = r->rawContent();\n  return memcmp(lc.data(), rc.data(), lc.size()) == 0;\n}\n\nvoid SymbolTable::addByContent(const DefinedAtom & newAtom) {\n  \/\/ Currently only read-only constants can be merged.\n  assert(newAtom.permissions() == DefinedAtom::permR__);\n  AtomContentSet::iterator pos = _contentTable.find(&newAtom);\n  if (pos == _contentTable.end()) {\n    _contentTable.insert(&newAtom);\n    return;\n  }\n  const Atom* existing = *pos;\n  \/\/ New atom is not being used.  Add it to replacement table.\n  _replacedAtoms[&newAtom] = existing;\n}\n\nconst Atom *SymbolTable::findByName(StringRef sym) {\n  NameToAtom::iterator pos = _nameTable.find(sym);\n  if (pos == _nameTable.end())\n    return nullptr;\n  return pos->second;\n}\n\nbool SymbolTable::isDefined(StringRef sym) {\n  if (const Atom *atom = findByName(sym))\n    return atom->definition() != Atom::definitionUndefined;\n  return false;\n}\n\nvoid SymbolTable::addReplacement(const Atom *replaced,\n                                 const Atom *replacement) {\n  _replacedAtoms[replaced] = replacement;\n}\n\nconst Atom *SymbolTable::replacement(const Atom *atom) {\n  \/\/ Find the replacement for a given atom. Atoms in _replacedAtoms\n  \/\/ may be chained, so find the last one.\n  for (;;) {\n    AtomToAtom::iterator pos = _replacedAtoms.find(atom);\n    if (pos == _replacedAtoms.end())\n      return atom;\n    atom = pos->second;\n  }\n}\n\nunsigned int SymbolTable::size() {\n  return _nameTable.size();\n}\n\nvoid SymbolTable::undefines(std::vector<const UndefinedAtom *> &undefs) {\n  for (auto it : _nameTable) {\n    const Atom *atom = it.second;\n    assert(atom != nullptr);\n    if (const auto undef = dyn_cast<const UndefinedAtom>(atom)) {\n      AtomToAtom::iterator pos = _replacedAtoms.find(undef);\n      if (pos != _replacedAtoms.end())\n        continue;\n      undefs.push_back(undef);\n    }\n  }\n}\n\nvoid SymbolTable::tentativeDefinitions(std::vector<StringRef> &names) {\n  for (auto entry : _nameTable) {\n    const Atom *atom = entry.second;\n    StringRef name   = entry.first;\n    assert(atom != nullptr);\n    if (const DefinedAtom *defAtom = dyn_cast<DefinedAtom>(atom))\n      if (defAtom->merge() == DefinedAtom::mergeAsTentative)\n        names.push_back(name);\n  }\n}\n} \/\/ namespace lld\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * (C) Copyright 2013 Kurento (http:\/\/kurento.org\/)\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the GNU Lesser General Public License\n * (LGPL) version 2.1 which accompanies this distribution, and is available at\n * http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n *\n * This library is distributed in the hope that it will be 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 \"UriEndPoint.hpp\"\n\n#include \"KmsMediaUriEndPointType_constants.h\"\n#include \"KmsMediaErrorCodes_constants.h\"\n\n#include \"utils\/utils.hpp\"\n#include \"utils\/marshalling.hpp\"\n\n#include \"protocol\/TBinaryProtocol.h\"\n#include \"transport\/TBufferTransports.h\"\n\n#define GST_CAT_DEFAULT kurento_uri_end_point\nGST_DEBUG_CATEGORY_STATIC (GST_CAT_DEFAULT);\n#define GST_DEFAULT_NAME \"KurentoUriEndPoint\"\n\nusing apache::thrift::transport::TMemoryBuffer;\nusing apache::thrift::protocol::TBinaryProtocol;\n\nnamespace kurento\n{\n\nUriEndPoint::UriEndPoint (MediaSet &mediaSet,\n                          std::shared_ptr<MediaPipeline> parent,\n                          const std::string &type,\n                          const std::map<std::string, KmsMediaParam> &params,\n                          const std::string &factoryName)\nthrow (KmsMediaServerException)\n  : EndPoint (mediaSet, parent, type, params, factoryName)\n{\n  KmsMediaUriEndPointConstructorParams uriEpParams;\n  const KmsMediaParam *p;\n\n  p = getParam (params,\n                g_KmsMediaUriEndPointType_constants.CONSTRUCTOR_PARAMS_DATA_TYPE);\n\n  if (p == NULL) {\n    KmsMediaServerException except;\n\n    createKmsMediaServerException (except,\n                                   g_KmsMediaErrorCodes_constants.MEDIA_OBJECT_ILLEGAL_PARAM_ERROR,\n                                   \"Param '\" + g_KmsMediaUriEndPointType_constants.CONSTRUCTOR_PARAMS_DATA_TYPE +\n                                   \"' not found\");\n    throw except;\n  }\n\n  unmarshalKmsMediaUriEndPointConstructorParams (uriEpParams, p->data);\n\n  g_object_set (G_OBJECT (element), \"uri\", uriEpParams.uri.c_str(), NULL);\n}\n\nUriEndPoint::~UriEndPoint() throw ()\n{\n\n}\n\nstd::string\nUriEndPoint::getUri ()\n{\n  char *uri_str;\n\n  g_object_get (G_OBJECT (element), \"uri\", &uri_str, NULL);\n  std::string uri (uri_str);\n  g_free (uri_str);\n\n  return uri;\n}\n\nvoid\nUriEndPoint::start ()\n{\n  g_object_set (G_OBJECT (element), \"state\", 1 \/* start *\/, NULL);\n}\n\nvoid\nUriEndPoint::pause ()\n{\n  g_object_set (G_OBJECT (element), \"state\", 2 \/* pause *\/, NULL);\n}\n\nvoid\nUriEndPoint::stop ()\n{\n  g_object_set (G_OBJECT (element), \"state\", 0 \/* stop *\/, NULL);\n}\n\nvoid\nUriEndPoint::invoke (KmsMediaInvocationReturn &_return,\n                     const std::string &command,\n                     const std::map<std::string, KmsMediaParam> &params)\nthrow (KmsMediaServerException)\n{\n  if (g_KmsMediaUriEndPointType_constants.GET_URI.compare (command) == 0) {\n    createStringInvocationReturn (_return, getUri () );\n  } else if (g_KmsMediaUriEndPointType_constants.START.compare (command) == 0) {\n    start ();\n    createVoidInvocationReturn (_return);\n  } else if (g_KmsMediaUriEndPointType_constants.PAUSE.compare (command) == 0) {\n    pause ();\n    createVoidInvocationReturn (_return);\n  } else if (g_KmsMediaUriEndPointType_constants.STOP.compare (command) == 0) {\n    stop ();\n    createVoidInvocationReturn (_return);\n  } else {\n    EndPoint::invoke (_return, command, params);\n  }\n}\n\nUriEndPoint::StaticConstructor UriEndPoint::staticConstructor;\n\nUriEndPoint::StaticConstructor::StaticConstructor()\n{\n  GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, GST_DEFAULT_NAME, 0,\n                           GST_DEFAULT_NAME);\n}\n\n} \/\/ kurento\n<commit_msg>UriEndPoint: Remove magic numbers<commit_after>\/*\n * (C) Copyright 2013 Kurento (http:\/\/kurento.org\/)\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the GNU Lesser General Public License\n * (LGPL) version 2.1 which accompanies this distribution, and is available at\n * http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n *\n * This library is distributed in the hope that it will be 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 \"UriEndPoint.hpp\"\n\n#include \"KmsMediaUriEndPointType_constants.h\"\n#include \"KmsMediaErrorCodes_constants.h\"\n\n#include \"utils\/utils.hpp\"\n#include \"utils\/marshalling.hpp\"\n\n#include \"protocol\/TBinaryProtocol.h\"\n#include \"transport\/TBufferTransports.h\"\n\n#define GST_CAT_DEFAULT kurento_uri_end_point\nGST_DEBUG_CATEGORY_STATIC (GST_CAT_DEFAULT);\n#define GST_DEFAULT_NAME \"KurentoUriEndPoint\"\n\nusing apache::thrift::transport::TMemoryBuffer;\nusing apache::thrift::protocol::TBinaryProtocol;\n\nnamespace kurento\n{\n\ntypedef enum {\n  KMS_URI_END_POINT_STATE_STOP,\n  KMS_URI_END_POINT_STATE_START,\n  KMS_URI_END_POINT_STATE_PAUSE\n} KmsUriEndPointState;\n\nUriEndPoint::UriEndPoint (MediaSet &mediaSet,\n                          std::shared_ptr<MediaPipeline> parent,\n                          const std::string &type,\n                          const std::map<std::string, KmsMediaParam> &params,\n                          const std::string &factoryName)\nthrow (KmsMediaServerException)\n  : EndPoint (mediaSet, parent, type, params, factoryName)\n{\n  KmsMediaUriEndPointConstructorParams uriEpParams;\n  const KmsMediaParam *p;\n\n  p = getParam (params,\n                g_KmsMediaUriEndPointType_constants.CONSTRUCTOR_PARAMS_DATA_TYPE);\n\n  if (p == NULL) {\n    KmsMediaServerException except;\n\n    createKmsMediaServerException (except,\n                                   g_KmsMediaErrorCodes_constants.MEDIA_OBJECT_ILLEGAL_PARAM_ERROR,\n                                   \"Param '\" + g_KmsMediaUriEndPointType_constants.CONSTRUCTOR_PARAMS_DATA_TYPE +\n                                   \"' not found\");\n    throw except;\n  }\n\n  unmarshalKmsMediaUriEndPointConstructorParams (uriEpParams, p->data);\n\n  g_object_set (G_OBJECT (element), \"uri\", uriEpParams.uri.c_str(), NULL);\n}\n\nUriEndPoint::~UriEndPoint() throw ()\n{\n\n}\n\nstd::string\nUriEndPoint::getUri ()\n{\n  char *uri_str;\n\n  g_object_get (G_OBJECT (element), \"uri\", &uri_str, NULL);\n  std::string uri (uri_str);\n  g_free (uri_str);\n\n  return uri;\n}\n\nvoid\nUriEndPoint::start ()\n{\n  g_object_set (G_OBJECT (element), \"state\", KMS_URI_END_POINT_STATE_START, NULL);\n}\n\nvoid\nUriEndPoint::pause ()\n{\n  g_object_set (G_OBJECT (element), \"state\", KMS_URI_END_POINT_STATE_PAUSE, NULL);\n}\n\nvoid\nUriEndPoint::stop ()\n{\n  g_object_set (G_OBJECT (element), \"state\", KMS_URI_END_POINT_STATE_STOP, NULL);\n}\n\nvoid\nUriEndPoint::invoke (KmsMediaInvocationReturn &_return,\n                     const std::string &command,\n                     const std::map<std::string, KmsMediaParam> &params)\nthrow (KmsMediaServerException)\n{\n  if (g_KmsMediaUriEndPointType_constants.GET_URI.compare (command) == 0) {\n    createStringInvocationReturn (_return, getUri () );\n  } else if (g_KmsMediaUriEndPointType_constants.START.compare (command) == 0) {\n    start ();\n    createVoidInvocationReturn (_return);\n  } else if (g_KmsMediaUriEndPointType_constants.PAUSE.compare (command) == 0) {\n    pause ();\n    createVoidInvocationReturn (_return);\n  } else if (g_KmsMediaUriEndPointType_constants.STOP.compare (command) == 0) {\n    stop ();\n    createVoidInvocationReturn (_return);\n  } else {\n    EndPoint::invoke (_return, command, params);\n  }\n}\n\nUriEndPoint::StaticConstructor UriEndPoint::staticConstructor;\n\nUriEndPoint::StaticConstructor::StaticConstructor()\n{\n  GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, GST_DEFAULT_NAME, 0,\n                           GST_DEFAULT_NAME);\n}\n\n} \/\/ kurento\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file\n\/\/ for details. All rights reserved. Use of this source code is governed by a\n\/\/ BSD-style license that can be found in the LICENSE file.\n\n#include \"platform\/globals.h\"\n\n#include \"vm\/isolate.h\"\n#include \"vm\/object.h\"\n#include \"vm\/regexp.h\"\n#include \"vm\/unit_test.h\"\n\nnamespace dart {\n\nstatic RawArray* Match(const String& pat, const String& str) {\n  Isolate* isolate = Isolate::Current();\n  const JSRegExp& regexp = JSRegExp::Handle(\n      RegExpEngine::CreateJSRegExp(isolate, pat, false, false));\n  const intptr_t cid = str.GetClassId();\n  const Function& fn = Function::Handle(regexp.function(cid));\n  EXPECT(!fn.IsNull());\n  const Smi& idx = Smi::Handle(Smi::New(0));\n  return IRRegExpMacroAssembler::Execute(fn, str, idx, Isolate::Current());\n}\n\nTEST_CASE(RegExp_OneByteString) {\n  uint8_t chars[] = { 'a', 'b', 'c', 'b', 'a' };\n  intptr_t len = ARRAY_SIZE(chars);\n  const String& str = String::Handle(\n      OneByteString::New(chars, len, Heap::kNew));\n\n  const String& pat = String::Handle(String::New(\"bc\"));\n  const Array& res = Array::Handle(Match(pat, str));\n  EXPECT_EQ(2, res.Length());\n\n  const Object& res_1 = Object::Handle(res.At(0));\n  const Object& res_2 = Object::Handle(res.At(1));\n  EXPECT(res_1.IsSmi());\n  EXPECT(res_2.IsSmi());\n\n  const Smi& smi_1 = Smi::Cast(res_1);\n  const Smi& smi_2 = Smi::Cast(res_2);\n  EXPECT_EQ(1, smi_1.Value());\n  EXPECT_EQ(3, smi_2.Value());\n}\n\nTEST_CASE(RegExp_TwoByteString) {\n  uint16_t chars[] = { 'a', 'b', 'c', 'b', 'a' };\n  intptr_t len = ARRAY_SIZE(chars);\n  const String& str = String::Handle(\n      TwoByteString::New(chars, len, Heap::kNew));\n\n  const String& pat = String::Handle(String::New(\"bc\"));\n  const Array& res = Array::Handle(Match(pat, str));\n  EXPECT_EQ(2, res.Length());\n\n  const Object& res_1 = Object::Handle(res.At(0));\n  const Object& res_2 = Object::Handle(res.At(1));\n  EXPECT(res_1.IsSmi());\n  EXPECT(res_2.IsSmi());\n\n  const Smi& smi_1 = Smi::Cast(res_1);\n  const Smi& smi_2 = Smi::Cast(res_2);\n  EXPECT_EQ(1, smi_1.Value());\n  EXPECT_EQ(3, smi_2.Value());\n}\n\nTEST_CASE(RegExp_ExternalOneByteString) {\n  uint8_t chars[] = { 'a', 'b', 'c', 'b', 'a' };\n  intptr_t len = ARRAY_SIZE(chars);\n  const String& str = String::Handle(\n      ExternalOneByteString::New(chars, len, NULL, NULL, Heap::kNew));\n\n  const String& pat = String::Handle(String::New(\"bc\"));\n  const Array& res = Array::Handle(Match(pat, str));\n  EXPECT_EQ(2, res.Length());\n\n  const Object& res_1 = Object::Handle(res.At(0));\n  const Object& res_2 = Object::Handle(res.At(1));\n  EXPECT(res_1.IsSmi());\n  EXPECT(res_2.IsSmi());\n\n  const Smi& smi_1 = Smi::Cast(res_1);\n  const Smi& smi_2 = Smi::Cast(res_2);\n  EXPECT_EQ(1, smi_1.Value());\n  EXPECT_EQ(3, smi_2.Value());\n}\n\nTEST_CASE(RegExp_ExternalTwoByteString) {\n  uint16_t chars[] = { 'a', 'b', 'c', 'b', 'a' };\n  intptr_t len = ARRAY_SIZE(chars);\n  const String& str = String::Handle(\n      ExternalTwoByteString::New(chars, len, NULL, NULL, Heap::kNew));\n\n  const String& pat = String::Handle(String::New(\"bc\"));\n  const Array& res = Array::Handle(Match(pat, str));\n  EXPECT_EQ(2, res.Length());\n\n  const Object& res_1 = Object::Handle(res.At(0));\n  const Object& res_2 = Object::Handle(res.At(1));\n  EXPECT(res_1.IsSmi());\n  EXPECT(res_2.IsSmi());\n\n  const Smi& smi_1 = Smi::Cast(res_1);\n  const Smi& smi_2 = Smi::Cast(res_2);\n  EXPECT_EQ(1, smi_1.Value());\n  EXPECT_EQ(3, smi_2.Value());\n}\n\n}  \/\/ namespace dart\n<commit_msg>Disable RegExp tests when using JSCRE backend.<commit_after>\/\/ Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file\n\/\/ for details. All rights reserved. Use of this source code is governed by a\n\/\/ BSD-style license that can be found in the LICENSE file.\n\n#include \"platform\/globals.h\"\n\n#include \"vm\/isolate.h\"\n#include \"vm\/object.h\"\n#include \"vm\/regexp.h\"\n#include \"vm\/unit_test.h\"\n\nnamespace dart {\n\nDECLARE_FLAG(bool, use_jscre);\n\nstatic RawArray* Match(const String& pat, const String& str) {\n  Isolate* isolate = Isolate::Current();\n  const JSRegExp& regexp = JSRegExp::Handle(\n      RegExpEngine::CreateJSRegExp(isolate, pat, false, false));\n  const intptr_t cid = str.GetClassId();\n  const Function& fn = Function::Handle(regexp.function(cid));\n  EXPECT(!fn.IsNull());\n  const Smi& idx = Smi::Handle(Smi::New(0));\n  return IRRegExpMacroAssembler::Execute(fn, str, idx, Isolate::Current());\n}\n\nTEST_CASE(RegExp_OneByteString) {\n  if (FLAG_use_jscre)\n    return;\n\n  uint8_t chars[] = { 'a', 'b', 'c', 'b', 'a' };\n  intptr_t len = ARRAY_SIZE(chars);\n  const String& str = String::Handle(\n      OneByteString::New(chars, len, Heap::kNew));\n\n  const String& pat = String::Handle(String::New(\"bc\"));\n  const Array& res = Array::Handle(Match(pat, str));\n  EXPECT_EQ(2, res.Length());\n\n  const Object& res_1 = Object::Handle(res.At(0));\n  const Object& res_2 = Object::Handle(res.At(1));\n  EXPECT(res_1.IsSmi());\n  EXPECT(res_2.IsSmi());\n\n  const Smi& smi_1 = Smi::Cast(res_1);\n  const Smi& smi_2 = Smi::Cast(res_2);\n  EXPECT_EQ(1, smi_1.Value());\n  EXPECT_EQ(3, smi_2.Value());\n}\n\nTEST_CASE(RegExp_TwoByteString) {\n  if (FLAG_use_jscre)\n    return;\n\n  uint16_t chars[] = { 'a', 'b', 'c', 'b', 'a' };\n  intptr_t len = ARRAY_SIZE(chars);\n  const String& str = String::Handle(\n      TwoByteString::New(chars, len, Heap::kNew));\n\n  const String& pat = String::Handle(String::New(\"bc\"));\n  const Array& res = Array::Handle(Match(pat, str));\n  EXPECT_EQ(2, res.Length());\n\n  const Object& res_1 = Object::Handle(res.At(0));\n  const Object& res_2 = Object::Handle(res.At(1));\n  EXPECT(res_1.IsSmi());\n  EXPECT(res_2.IsSmi());\n\n  const Smi& smi_1 = Smi::Cast(res_1);\n  const Smi& smi_2 = Smi::Cast(res_2);\n  EXPECT_EQ(1, smi_1.Value());\n  EXPECT_EQ(3, smi_2.Value());\n}\n\nTEST_CASE(RegExp_ExternalOneByteString) {\n  if (FLAG_use_jscre)\n    return;\n\n  uint8_t chars[] = { 'a', 'b', 'c', 'b', 'a' };\n  intptr_t len = ARRAY_SIZE(chars);\n  const String& str = String::Handle(\n      ExternalOneByteString::New(chars, len, NULL, NULL, Heap::kNew));\n\n  const String& pat = String::Handle(String::New(\"bc\"));\n  const Array& res = Array::Handle(Match(pat, str));\n  EXPECT_EQ(2, res.Length());\n\n  const Object& res_1 = Object::Handle(res.At(0));\n  const Object& res_2 = Object::Handle(res.At(1));\n  EXPECT(res_1.IsSmi());\n  EXPECT(res_2.IsSmi());\n\n  const Smi& smi_1 = Smi::Cast(res_1);\n  const Smi& smi_2 = Smi::Cast(res_2);\n  EXPECT_EQ(1, smi_1.Value());\n  EXPECT_EQ(3, smi_2.Value());\n}\n\nTEST_CASE(RegExp_ExternalTwoByteString) {\n  if (FLAG_use_jscre)\n    return;\n\n  uint16_t chars[] = { 'a', 'b', 'c', 'b', 'a' };\n  intptr_t len = ARRAY_SIZE(chars);\n  const String& str = String::Handle(\n      ExternalTwoByteString::New(chars, len, NULL, NULL, Heap::kNew));\n\n  const String& pat = String::Handle(String::New(\"bc\"));\n  const Array& res = Array::Handle(Match(pat, str));\n  EXPECT_EQ(2, res.Length());\n\n  const Object& res_1 = Object::Handle(res.At(0));\n  const Object& res_2 = Object::Handle(res.At(1));\n  EXPECT(res_1.IsSmi());\n  EXPECT(res_2.IsSmi());\n\n  const Smi& smi_1 = Smi::Cast(res_1);\n  const Smi& smi_2 = Smi::Cast(res_2);\n  EXPECT_EQ(1, smi_1.Value());\n  EXPECT_EQ(3, smi_2.Value());\n}\n\n}  \/\/ namespace dart\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#83529: Only preserve metadata of moved, not copied files<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"MetaImageImporter.hpp\"\n#include \"Exception.hpp\"\n#include <fstream>\n#include <boost\/iostreams\/device\/mapped_file.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/lexical_cast.hpp>\nusing namespace fast;\n\nImage::pointer MetaImageImporter::getOutput() {\n    return getOutputData<Image>(0);\n}\n\nvoid MetaImageImporter::setFilename(std::string filename) {\n    mFilename = filename;\n    mIsModified = true;\n}\n\nMetaImageImporter::MetaImageImporter() {\n    mFilename = \"\";\n    mIsModified = true;\n}\n\nstd::vector<std::string> stringSplit(std::string str, std::string delimiter) {\n    std::vector<std::string> values;\n    int startPosition = 0;\n    int endPosition = str.find(delimiter, startPosition+1);\n    while(true) {\n        if(endPosition == std::string::npos) {\n            endPosition = str.size();\n            values.push_back(str.substr(startPosition, endPosition-startPosition));\n            break;\n        } else {\n            values.push_back(str.substr(startPosition, endPosition-startPosition));\n            startPosition = endPosition+1;\n            endPosition = str.find(delimiter, startPosition+1);\n        }\n    }\n    return values;\n}\n\ntemplate <class T>\nvoid * readRawData(std::string rawFilename, unsigned int width, unsigned int height, unsigned int depth, unsigned int nrOfComponents) {\n    boost::iostreams::mapped_file_source file;\n    file.open(rawFilename, width*height*depth*nrOfComponents*sizeof(T));\n    if(!file.is_open())\n        throw FileNotFoundException(rawFilename);\n    T * data = new T[width*height*depth*nrOfComponents];\n    T * fileData = (T*)file.data();\n    memcpy(data,fileData,width*height*depth*nrOfComponents*sizeof(T));\n    file.close();\n    return data;\n}\n\nvoid MetaImageImporter::execute() {\n    if(mFilename == \"\")\n        throw Exception(\"Filename was not set in MetaImageImporter\");\n\n    \/\/ Open and parse mhd file\n    std::fstream mhdFile;\n    mhdFile.open(mFilename.c_str(), std::fstream::in);\n    if(!mhdFile.is_open())\n        throw FileNotFoundException(mFilename);\n    std::string line;\n    std::string rawFilename;\n    bool sizeFound = false,\n         rawFilenameFound = false,\n         typeFound = false,\n         dimensionsFound = false;\n    std::string typeName;\n\n    \/\/ Find NDims first\n    bool imageIs3D = false;\n    do {\n        std::getline(mhdFile, line);\n        if(line.substr(0, 5) == \"NDims\") {\n            if(line.substr(5+3, 1) == \"3\") {\n                imageIs3D = true;\n            } else if(line.substr(5+3, 1) == \"2\") {\n                imageIs3D = false;\n            }\n            dimensionsFound = true;\n        }\n    } while(!mhdFile.eof() && !dimensionsFound);\n\n    if(!dimensionsFound)\n        throw Exception(\"NDims not found in metaimage file.\");\n\n    \/\/ Reset and start reading file from beginning\n    mhdFile.seekg(0);\n\n    unsigned int width, height, depth = 1;\n    unsigned int nrOfComponents = 1;\n    Image::pointer output = getOutputData<Image>(0);\n\n    Vector3f spacing(1,1,1), offset(0,0,0), centerOfRotation(0,0,0);\n    Matrix3f transformMatrix = Matrix3f::Identity();\n\n    do{\n        std::getline(mhdFile, line);\n        boost::trim(line);\n        if(!mhdFile.eof()) {\n            int firstSpace = line.find(\" \");\n            std::string key = line.substr(0, firstSpace);\n            std::string value = line.substr(firstSpace+3);\n            \/\/this->setAttribute(key, value);\n        }\n        if(line.substr(0, 7) == \"DimSize\") {\n            std::string sizeString = line.substr(7+3);\n            std::string sizeX = sizeString.substr(0,sizeString.find(\" \"));\n            sizeString = sizeString.substr(sizeString.find(\" \")+1);\n            std::string sizeY = sizeString.substr(0,sizeString.find(\" \"));\n            width = boost::lexical_cast<int>(sizeX.c_str());\n            height = boost::lexical_cast<int>(sizeY.c_str());\n            if(imageIs3D) {\n                sizeString = sizeString.substr(sizeString.find(\" \")+1);\n                std::string sizeZ = sizeString.substr(0,sizeString.find(\" \"));\n                depth = boost::lexical_cast<int>(sizeZ.c_str());\n            }\n\n            sizeFound = true;\n        } else if(line.substr(0, 15) == \"ElementDataFile\") {\n            rawFilename = line.substr(15+3);\n            rawFilenameFound = true;\n\n            \/\/ Remove any trailing spaces\n            int pos = rawFilename.find(\" \");\n            if(pos > 0)\n            rawFilename = rawFilename.substr(0,pos);\n\n            \/\/ Get path name\n            pos = mFilename.rfind('\/');\n            if(pos > 0)\n                rawFilename = mFilename.substr(0,pos+1) + rawFilename;\n        } else if(line.substr(0, 11) == \"ElementType\") {\n            typeFound = true;\n            typeName = line.substr(11+3);\n\n            \/\/ Remove any trailing spaces\n            int pos = typeName.find(\" \");\n            if(pos > 0)\n            typeName = typeName.substr(0,pos);\n\n            if(typeName == \"MET_SHORT\") {\n            } else if(typeName == \"MET_USHORT\") {\n            } else if(typeName == \"MET_CHAR\") {\n            } else if(typeName == \"MET_UCHAR\") {\n            } else if(typeName == \"MET_INT\") {\n            } else if(typeName == \"MET_UINT\") {\n            } else if(typeName == \"MET_FLOAT\") {\n            } else {\n                throw Exception(\"Trying to read volume of unsupported data type\", __LINE__, __FILE__);\n            }\n        } else if(line.substr(0,23) == \"ElementNumberOfChannels\") {\n            nrOfComponents = boost::lexical_cast<int>(line.substr(23+3).c_str());\n            if(nrOfComponents <= 0)\n                throw Exception(\"Error in reading the number of components in the MetaImageImporter\");\n        } else if(line.substr(0, 14) == \"ElementSpacing\") {\n            std::string sizeString = line.substr(14+3);\n            boost::trim(sizeString);\n            std::string sizeX = sizeString.substr(0,sizeString.find(\" \"));\n            sizeString = sizeString.substr(sizeString.find(\" \")+1);\n            std::string sizeY = sizeString.substr(0,sizeString.find(\" \"));\n            std::string sizeZ = \"1\";\n            if(imageIs3D) {\n                sizeString = sizeString.substr(sizeString.find(\" \")+1);\n                sizeZ = sizeString.substr(0,sizeString.find(\" \"));\n            }\n\n            spacing[0] = boost::lexical_cast<float>(sizeX.c_str());\n            spacing[1] = boost::lexical_cast<float>(sizeY.c_str());\n            spacing[2] = boost::lexical_cast<float>(sizeZ.c_str());\n        } else if(line.substr(0, 16) == \"CenterOfRotation\") {\n            std::string sizeString = line.substr(16+3);\n            boost::trim(sizeString);\n            std::string sizeX = sizeString.substr(0,sizeString.find(\" \"));\n            sizeString = sizeString.substr(sizeString.find(\" \")+1);\n            std::string sizeY = sizeString.substr(0,sizeString.find(\" \"));\n            sizeString = sizeString.substr(sizeString.find(\" \")+1);\n            std::string sizeZ = sizeString.substr(0,sizeString.find(\" \"));\n\n            centerOfRotation[0] = boost::lexical_cast<float>(sizeX.c_str());\n            centerOfRotation[1] = boost::lexical_cast<float>(sizeY.c_str());\n            centerOfRotation[2] = boost::lexical_cast<float>(sizeZ.c_str());\n        } else if(line.substr(0, 6) == \"Offset\") {\n            std::string sizeString = line.substr(6+3);\n            boost::trim(sizeString);\n            std::string sizeX = sizeString.substr(0,sizeString.find(\" \"));\n            sizeString = sizeString.substr(sizeString.find(\" \")+1);\n            std::string sizeY = sizeString.substr(0,sizeString.find(\" \"));\n            sizeString = sizeString.substr(sizeString.find(\" \")+1);\n            std::string sizeZ = sizeString.substr(0,sizeString.find(\" \"));\n\n            offset[0] = boost::lexical_cast<float>(sizeX.c_str());\n            offset[1] = boost::lexical_cast<float>(sizeY.c_str());\n            offset[2] = boost::lexical_cast<float>(sizeZ.c_str());\n        } else if(line.substr(0, 15) == \"TransformMatrix\") {\n            std::string string = line.substr(15+3);\n            boost::trim(string);\n\n            std::vector<std::string> values = stringSplit(string, \" \");\n            if(values.size() != 9)\n                throw Exception(\"Encountered a transform matrix with incorrect number of elements in the MetaImageImporter\");\n\n            for(unsigned int i = 0; i < 3; i++) {\n            for(unsigned int j = 0; j < 3; j++) {\n                transformMatrix(j,i) = boost::lexical_cast<float>(values[j+i*3].c_str());\n            }}\n        }\n\n    } while(!mhdFile.eof());\n\n\n    mhdFile.close();\n    if(!sizeFound || !rawFilenameFound || !typeFound || !dimensionsFound)\n        throw Exception(\"Error reading the mhd file\", __LINE__, __FILE__);\n\n    if(rawFilename.substr(rawFilename.length()-5) == \".zraw\")\n        throw Exception(\"Error reading MetaImage. Compressed raw files (.zraw) currently not supported.\");\n\n    void * data;\n    DataType type;\n    if(typeName == \"MET_SHORT\") {\n        type = TYPE_INT16;\n        data = readRawData<short>(rawFilename, width, height, depth, nrOfComponents);\n    } else if(typeName == \"MET_USHORT\") {\n        type = TYPE_UINT16;\n        data = readRawData<unsigned short>(rawFilename, width, height, depth, nrOfComponents);\n    } else if(typeName == \"MET_CHAR\") {\n        type = TYPE_INT8;\n        data = readRawData<char>(rawFilename, width, height, depth, nrOfComponents);\n    } else if(typeName == \"MET_UCHAR\") {\n        type = TYPE_UINT8;\n        data = readRawData<unsigned char>(rawFilename, width, height, depth, nrOfComponents);\n    } else if(typeName == \"MET_FLOAT\") {\n        type = TYPE_FLOAT;\n        data = readRawData<float>(rawFilename, width, height, depth, nrOfComponents);\n    }\n\n    if(imageIs3D) {\n        output->create3DImage(width,height,depth,type,nrOfComponents,getMainDevice(),data);\n    } else {\n        output->create2DImage(width,height,type,nrOfComponents,getMainDevice(),data);\n    }\n\n    output->setOffset(offset);\n    output->setSpacing(spacing);\n    output->setCenterOfRotation(centerOfRotation);\n    output->setTransformMatrix(transformMatrix);\n\n    \/\/ Clean up\n    deleteArray(data, type);\n}\n<commit_msg>refactored the MetaImageImporter<commit_after>#include \"MetaImageImporter.hpp\"\n#include \"Exception.hpp\"\n#include <fstream>\n#include <boost\/iostreams\/device\/mapped_file.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/lexical_cast.hpp>\nusing namespace fast;\n\nImage::pointer MetaImageImporter::getOutput() {\n    return getOutputData<Image>(0);\n}\n\nvoid MetaImageImporter::setFilename(std::string filename) {\n    mFilename = filename;\n    mIsModified = true;\n}\n\nMetaImageImporter::MetaImageImporter() {\n    mFilename = \"\";\n    mIsModified = true;\n}\n\nstd::vector<std::string> stringSplit(std::string str, std::string delimiter) {\n    std::vector<std::string> values;\n    int startPosition = 0;\n    int endPosition = str.find(delimiter, startPosition+1);\n    while(true) {\n        if(endPosition == std::string::npos) {\n            endPosition = str.size();\n            values.push_back(str.substr(startPosition, endPosition-startPosition));\n            break;\n        } else {\n            values.push_back(str.substr(startPosition, endPosition-startPosition));\n            startPosition = endPosition+1;\n            endPosition = str.find(delimiter, startPosition+1);\n        }\n    }\n    return values;\n}\n\ntemplate <class T>\nvoid * readRawData(std::string rawFilename, unsigned int width, unsigned int height, unsigned int depth, unsigned int nrOfComponents) {\n    boost::iostreams::mapped_file_source file;\n    file.open(rawFilename, width*height*depth*nrOfComponents*sizeof(T));\n    if(!file.is_open())\n        throw FileNotFoundException(rawFilename);\n    T * data = new T[width*height*depth*nrOfComponents];\n    T * fileData = (T*)file.data();\n    memcpy(data,fileData,width*height*depth*nrOfComponents*sizeof(T));\n    file.close();\n    return data;\n}\n\nvoid MetaImageImporter::execute() {\n    if(mFilename == \"\")\n        throw Exception(\"Filename was not set in MetaImageImporter\");\n\n    \/\/ Open and parse mhd file\n    std::fstream mhdFile;\n    mhdFile.open(mFilename.c_str(), std::fstream::in);\n    if(!mhdFile.is_open())\n        throw FileNotFoundException(mFilename);\n    std::string line;\n    std::string rawFilename;\n    bool sizeFound = false,\n         rawFilenameFound = false,\n         typeFound = false,\n         dimensionsFound = false;\n    std::string typeName;\n\n    \/\/ Find NDims first\n    bool imageIs3D = false;\n    do {\n        std::getline(mhdFile, line);\n        if(line.substr(0, 5) == \"NDims\") {\n            if(line.substr(5+3, 1) == \"3\") {\n                imageIs3D = true;\n            } else if(line.substr(5+3, 1) == \"2\") {\n                imageIs3D = false;\n            }\n            dimensionsFound = true;\n        }\n    } while(!mhdFile.eof() && !dimensionsFound);\n\n    if(!dimensionsFound)\n        throw Exception(\"NDims not found in metaimage file.\");\n\n    \/\/ Reset and start reading file from beginning\n    mhdFile.seekg(0);\n\n    unsigned int width, height, depth = 1;\n    unsigned int nrOfComponents = 1;\n    Image::pointer output = getOutputData<Image>(0);\n\n    Vector3f spacing(1,1,1), offset(0,0,0), centerOfRotation(0,0,0);\n    Matrix3f transformMatrix = Matrix3f::Identity();\n\n    do{\n        std::getline(mhdFile, line);\n        boost::trim(line);\n        if(line.size() == 0) \/\/ line is empty\n            continue;\n        int firstSpace = line.find(\" \");\n        std::string key = line.substr(0, firstSpace);\n        boost::trim(key);\n        int equalSignPos = line.find(\"=\");\n        std::string value = line.substr(equalSignPos+1);\n        boost::trim(value);\n        if(key == \"DimSize\") {\n            std::vector<std::string> values;\n            boost::split(values, value, boost::is_any_of(\" \"));\n            \/\/ Remove any empty values:\n            values.erase(std::remove(values.begin(), values.end(), \"\"), values.end());\n\n            if(imageIs3D) {\n                if(values.size() != 3)\n                    throw Exception(\"DimSize in MetaImage file did not contain 3 numbers\");\n                depth = boost::lexical_cast<int>(values[2]);\n            } else {\n                if(values.size() != 2)\n                    throw Exception(\"DimSize in MetaImage file did not contain 2 numbers\");\n            }\n            width = boost::lexical_cast<int>(values[0]);\n            height = boost::lexical_cast<int>(values[1]);\n            sizeFound = true;\n        } else if(key == \"ElementDataFile\") {\n            rawFilename = value;\n            rawFilenameFound = true;\n\n            \/\/ Remove any trailing spaces\n            int pos = rawFilename.find(\" \");\n            if(pos > 0)\n            rawFilename = rawFilename.substr(0,pos);\n\n            \/\/ Get path name\n            pos = mFilename.rfind('\/');\n            if(pos > 0)\n                rawFilename = mFilename.substr(0,pos+1) + rawFilename;\n        } else if(key == \"ElementType\") {\n            typeFound = true;\n            typeName = value;\n\n            \/\/ Remove any trailing spaces\n            int pos = typeName.find(\" \");\n            if(pos > 0)\n            typeName = typeName.substr(0,pos);\n\n            if(typeName == \"MET_SHORT\") {\n            } else if(typeName == \"MET_USHORT\") {\n            } else if(typeName == \"MET_CHAR\") {\n            } else if(typeName == \"MET_UCHAR\") {\n            } else if(typeName == \"MET_INT\") {\n            } else if(typeName == \"MET_UINT\") {\n            } else if(typeName == \"MET_FLOAT\") {\n            } else {\n                throw Exception(\"Trying to read volume of unsupported data type\", __LINE__, __FILE__);\n            }\n        } else if(key == \"ElementNumberOfChannels\") {\n            nrOfComponents = boost::lexical_cast<int>(value.c_str());\n            if(nrOfComponents <= 0)\n                throw Exception(\"Error in reading the number of components in the MetaImageImporter\");\n        } else if(key == \"ElementSpacing\") {\n            std::vector<std::string> values;\n            boost::split(values, value, boost::is_any_of(\" \"));\n            \/\/ Remove any empty values:\n            values.erase(std::remove(values.begin(), values.end(), \"\"), values.end());\n            if(imageIs3D) {\n                if(values.size() != 3)\n                    throw Exception(\"ElementSpacing in MetaImage file did not contain 3 numbers\");\n                spacing[0] = boost::lexical_cast<float>(values[0]);\n                spacing[1] = boost::lexical_cast<float>(values[1]);\n                spacing[2] = boost::lexical_cast<float>(values[2]);\n            } else {\n                if(values.size() != 2 && values.size() != 3)\n                    throw Exception(\"ElementSpacing in MetaImage file did not contain 2 or 3 numbers\");\n\n                spacing[0] = boost::lexical_cast<float>(values[0]);\n                spacing[1] = boost::lexical_cast<float>(values[1]);\n                if(values.size() == 2) {\n                    spacing[2] = 1;\n                } else {\n                    spacing[2] = boost::lexical_cast<float>(values[2]);\n                }\n            }\n\n\n        } else if(key == \"CenterOfRotation\") {\n            std::vector<std::string> values;\n            boost::split(values, value, boost::is_any_of(\" \"));\n            \/\/ Remove any empty values:\n            values.erase(std::remove(values.begin(), values.end(), \"\"), values.end());\n            if(imageIs3D) {\n                if(values.size() != 3)\n                    throw Exception(\"CenterOfRotation in MetaImage file did not contain 3 numbers\");\n                centerOfRotation[0] = boost::lexical_cast<float>(values[0]);\n                centerOfRotation[1] = boost::lexical_cast<float>(values[1]);\n                centerOfRotation[2] = boost::lexical_cast<float>(values[2]);\n            } else {\n                if(values.size() != 2 && values.size() != 3)\n                    throw Exception(\"CenterOfRotation in MetaImage file did not contain 2 or 3 numbers\");\n\n                centerOfRotation[0] = boost::lexical_cast<float>(values[0]);\n                centerOfRotation[1] = boost::lexical_cast<float>(values[1]);\n                if(values.size() == 2) {\n                    centerOfRotation[2] = 0;\n                } else {\n                    centerOfRotation[2] = boost::lexical_cast<float>(values[2]);\n                }\n            }\n        } else if(key == \"Offset\") {\n            std::vector<std::string> values;\n            boost::split(values, value, boost::is_any_of(\" \"));\n            \/\/ Remove any empty values:\n            values.erase(std::remove(values.begin(), values.end(), \"\"), values.end());\n            if(values.size() != 3)\n                throw Exception(\"Offset in MetaImage file did not contain 3 numbers\");\n\n            offset[0] = boost::lexical_cast<float>(values[0].c_str());\n            offset[1] = boost::lexical_cast<float>(values[1].c_str());\n            offset[2] = boost::lexical_cast<float>(values[2].c_str());\n        } else if(key == \"TransformMatrix\") {\n            std::vector<std::string> values;\n            boost::split(values, value, boost::is_any_of(\" \"));\n            \/\/ Remove any empty values:\n            values.erase(std::remove(values.begin(), values.end(), \"\"), values.end());\n            if(values.size() != 9)\n                throw Exception(\"Encountered a transform matrix with incorrect number of elements in the MetaImageImporter\");\n\n            for(unsigned int i = 0; i < 3; i++) {\n            for(unsigned int j = 0; j < 3; j++) {\n                transformMatrix(j,i) = boost::lexical_cast<float>(values[j+i*3].c_str());\n            }}\n        }\n\n    } while(!mhdFile.eof());\n\n    mhdFile.close();\n    if(!sizeFound || !rawFilenameFound || !typeFound || !dimensionsFound)\n        throw Exception(\"Error reading the mhd file\", __LINE__, __FILE__);\n\n    if(rawFilename.substr(rawFilename.length()-5) == \".zraw\")\n        throw Exception(\"Error reading MetaImage. Compressed raw files (.zraw) currently not supported.\");\n\n    void * data;\n    DataType type;\n    if(typeName == \"MET_SHORT\") {\n        type = TYPE_INT16;\n        data = readRawData<short>(rawFilename, width, height, depth, nrOfComponents);\n    } else if(typeName == \"MET_USHORT\") {\n        type = TYPE_UINT16;\n        data = readRawData<unsigned short>(rawFilename, width, height, depth, nrOfComponents);\n    } else if(typeName == \"MET_CHAR\") {\n        type = TYPE_INT8;\n        data = readRawData<char>(rawFilename, width, height, depth, nrOfComponents);\n    } else if(typeName == \"MET_UCHAR\") {\n        type = TYPE_UINT8;\n        data = readRawData<unsigned char>(rawFilename, width, height, depth, nrOfComponents);\n    } else if(typeName == \"MET_FLOAT\") {\n        type = TYPE_FLOAT;\n        data = readRawData<float>(rawFilename, width, height, depth, nrOfComponents);\n    }\n\n    if(imageIs3D) {\n        output->create3DImage(width,height,depth,type,nrOfComponents,getMainDevice(),data);\n    } else {\n        output->create2DImage(width,height,type,nrOfComponents,getMainDevice(),data);\n    }\n\n    output->setOffset(offset);\n    output->setSpacing(spacing);\n    output->setCenterOfRotation(centerOfRotation);\n    output->setTransformMatrix(transformMatrix);\n\n    \/\/ Clean up\n    deleteArray(data, type);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* socket_per_thread.cc\n   Jeremy Barnes, 5 March 2012\n   Copyright (c) 2012 Datacratic.  All rights reserved.\n\n   One socket per thread.\n*\/\n\n#include \"soa\/service\/socket_per_thread.h\"\n#include \"jml\/arch\/format.h\"\n#include \"ace\/OS_NS_Thread.h\"\n#include \"jml\/arch\/backtrace.h\"\n#include \"jml\/arch\/spinlock.h\"\n#include \"jml\/arch\/atomic_ops.h\"\n#include \"jml\/arch\/exception.h\"\n#include \"jml\/utils\/exc_assert.h\"\n#include \"soa\/service\/zmq_utils.h\"\n\n\nusing namespace std;\nusing namespace ML;\n\n\nnamespace Datacratic {\n\n\/*****************************************************************************\/\n\/* SOCKET PER THREAD                                                         *\/\n\/*****************************************************************************\/\n\nSocketPerThread::\nSocketPerThread()\n    : context(0), type(0), numOpen(0), state(NOTINITIALIZED),\n      entries(onFreeEntry)\n{\n}\n\nSocketPerThread::\nSocketPerThread(zmq::context_t & context,\n                int type,\n                const std::string & uri,\n                bool allowForceClose)\n    : context(&context), type(type), uri(uri),\n      allowForceClose(allowForceClose), numOpen(0),\n      state(READY), entries(onFreeEntry)\n{\n    \/\/std::cerr << \"finished init of socket \" << uri << std::endl;\n}\n\nSocketPerThread::\n~SocketPerThread()\n{\n    shutdown();\n}\n\nvoid\nSocketPerThread::\ninit(zmq::context_t & context,\n     int type,\n     const std::string & uri,\n     bool allowForceClose)\n{\n    if (this->context)\n        throw ML::Exception(\"attempt to double initialize a SocketPerThread\");\n    this->context = &context;\n    this->type = type;\n    this->uri = uri;\n    this->allowForceClose = allowForceClose;\n\n    state = READY;\n    \/\/using namespace std;\n    \/\/cerr << \"initializing SocketPerThread with uri \" << uri << endl;\n}\n\nvoid\nSocketPerThread::\nshutdown()\n{\n    state = FINISHED;\n\n    entries.reset();\n    context = 0;\n    \/\/using namespace std;\n    \/\/cerr << \"destroying SocketPerThread with uri \" << uri << \" and \"\n    \/\/     << numOpen << \" open entries\" << endl;\n\n    if (numOpen > 0) {\n        if (!allowForceClose) {\n            throw ML::Exception(\"attempt to destroy SocketPerThread with %d open entries\",\n                                numOpen);\n        }\n\n        while (!allThreads.empty()) {\n            auto it = allThreads.begin();\n            onFreeEntry(*it);\n        }\n\n        ExcAssertEqual(numOpen, 0);\n    }\n}\n\nvoid\nSocketPerThread::\ninitForThisThread() const\n{\n    if (entries.get())\n        return;\n\n    \/\/cerr << \"initializing zeromq socket for this thread to connect to \"\n    \/\/     << uri << endl;\n\n    if (!context)\n        throw ML::Exception(\"attempt to use a SocketPerThread \"\n                            \"without initializing\");\n\n    auto mThis = const_cast<SocketPerThread *>(this);\n\n    std::auto_ptr<Entry> newEntry(new Entry());\n    newEntry->owner = mThis;\n            \n    std::auto_ptr<zmq::socket_t> newPtr\n        (new zmq::socket_t(*context, type));\n    setIdentity(*newPtr, ML::format(\"thr%lld\",\n                                    (long long)ACE_OS::thr_self()));\n    newPtr->connect(uri.c_str());\n\n    newEntry->sock = newPtr.release();\n    \/\/if (!allForThread.get())\n    \/\/    allForThread.reset(new std::set<SocketPerThread *>());\n    \/\/allForThread->insert(mThis);\n    entries.reset(newEntry.release());\n\n    mThis->addThreadEntry(entries.get());\n    ML::atomic_inc(numOpen);\n}\n    \nvoid\nSocketPerThread::\nonFreeEntry(Entry * entry)\n{\n    using namespace std;\n    \/\/cerr << \"onFreeEntry \" << entry << endl;\n    \/\/cerr << \"closing zmq socket\" << entry->sock << \" with owner \"\n    \/\/     << entry->owner << endl;\n    delete entry->sock;\n    \/\/cerr << \"erasing\" << endl;\n    \/\/allForThread->erase(entry->owner);\n    \/\/cerr << \"unowning\" << endl;\n    ML::atomic_dec(entry->owner->numOpen);\n\n    entry->owner->removeThreadEntry(entry);\n\n    delete entry;\n\n    \/\/Datacratic::close(*sock);\n    \/\/ML::backtrace();\n    \/\/cerr << endl << endl;\n}\n\nvoid\nSocketPerThread::\ncleanupThisThread()\n{\n    \/\/cerr << \"cleaning up socket \" << entries->sock << endl;\n    entries.reset();\n}\n\nvoid\nSocketPerThread::\ncleanupAllForThread()\n{\n    if (!allForThread.get()) return;\n    \/\/cerr << \"cleaning up \" << allForThread->size() << \" sockets\" << endl;\n\n    for (auto it = allForThread->begin();  it != allForThread->end();\n         it = allForThread->begin())\n        (*it)->cleanupThisThread();\n\n    \/\/cerr << \"we now have \" << allForThread->size() << \" sockets left\" << endl;\n}\n\nvoid\nSocketPerThread::\nremoveThreadEntry(Entry * entry)\n{\n    Guard guard(allThreadsLock);\n    allThreads.erase(entry);\n}\n\nvoid\nSocketPerThread::\naddThreadEntry(Entry * entry)\n{\n    Guard guard(allThreadsLock);\n    allThreads.insert(entry);\n}\n\nboost::thread_specific_ptr<std::set<SocketPerThread *> >\nSocketPerThread::allForThread;\n\n} \/\/ namespace Datacratic\n<commit_msg>workaround the race condition in ZMQ<commit_after>\/* socket_per_thread.cc\n   Jeremy Barnes, 5 March 2012\n   Copyright (c) 2012 Datacratic.  All rights reserved.\n\n   One socket per thread.\n*\/\n\n#include \"soa\/service\/socket_per_thread.h\"\n#include \"jml\/arch\/format.h\"\n#include \"ace\/OS_NS_Thread.h\"\n#include \"jml\/arch\/backtrace.h\"\n#include \"jml\/arch\/spinlock.h\"\n#include \"jml\/arch\/atomic_ops.h\"\n#include \"jml\/arch\/exception.h\"\n#include \"jml\/arch\/timers.h\"\n#include \"jml\/utils\/exc_assert.h\"\n#include \"soa\/service\/zmq_utils.h\"\n\n\nusing namespace std;\nusing namespace ML;\n\n\nnamespace Datacratic {\n\n\/*****************************************************************************\/\n\/* SOCKET PER THREAD                                                         *\/\n\/*****************************************************************************\/\n\nSocketPerThread::\nSocketPerThread()\n    : context(0), type(0), numOpen(0), state(NOTINITIALIZED),\n      entries(onFreeEntry)\n{\n}\n\nSocketPerThread::\nSocketPerThread(zmq::context_t & context,\n                int type,\n                const std::string & uri,\n                bool allowForceClose)\n    : context(&context), type(type), uri(uri),\n      allowForceClose(allowForceClose), numOpen(0),\n      state(READY), entries(onFreeEntry)\n{\n    \/\/std::cerr << \"finished init of socket \" << uri << std::endl;\n}\n\nSocketPerThread::\n~SocketPerThread()\n{\n    shutdown();\n}\n\nvoid\nSocketPerThread::\ninit(zmq::context_t & context,\n     int type,\n     const std::string & uri,\n     bool allowForceClose)\n{\n    if (this->context)\n        throw ML::Exception(\"attempt to double initialize a SocketPerThread\");\n    this->context = &context;\n    this->type = type;\n    this->uri = uri;\n    this->allowForceClose = allowForceClose;\n\n    state = READY;\n    \/\/using namespace std;\n    \/\/cerr << \"initializing SocketPerThread with uri \" << uri << endl;\n}\n\nvoid\nSocketPerThread::\nshutdown()\n{\n    state = FINISHED;\n\n    entries.reset();\n    context = 0;\n    \/\/using namespace std;\n    \/\/cerr << \"destroying SocketPerThread with uri \" << uri << \" and \"\n    \/\/     << numOpen << \" open entries\" << endl;\n\n    if (numOpen > 0) {\n        if (!allowForceClose) {\n            throw ML::Exception(\"attempt to destroy SocketPerThread with %d open entries\",\n                                numOpen);\n        }\n\n        while (!allThreads.empty()) {\n            auto it = allThreads.begin();\n            onFreeEntry(*it);\n        }\n\n        ExcAssertEqual(numOpen, 0);\n    }\n}\n\nvoid\nSocketPerThread::\ninitForThisThread() const\n{\n    if (entries.get())\n        return;\n\n    \/\/cerr << \"initializing zeromq socket for this thread to connect to \"\n    \/\/     << uri << endl;\n\n    if (!context)\n        throw ML::Exception(\"attempt to use a SocketPerThread \"\n                            \"without initializing\");\n\n    auto mThis = const_cast<SocketPerThread *>(this);\n\n    std::auto_ptr<Entry> newEntry(new Entry());\n    newEntry->owner = mThis;\n            \n    std::auto_ptr<zmq::socket_t> newPtr\n        (new zmq::socket_t(*context, type));\n    setIdentity(*newPtr, ML::format(\"thr%lld\",\n                                    (long long)ACE_OS::thr_self()));\n    newPtr->connect(uri.c_str());\n\n    newEntry->sock = newPtr.release();\n    \/\/if (!allForThread.get())\n    \/\/    allForThread.reset(new std::set<SocketPerThread *>());\n    \/\/allForThread->insert(mThis);\n    entries.reset(newEntry.release());\n\n    mThis->addThreadEntry(entries.get());\n    ML::atomic_inc(numOpen);\n\n    \/\/ wait for ZMQ when connecting...\n    ML::sleep(0.1);\n}\n    \nvoid\nSocketPerThread::\nonFreeEntry(Entry * entry)\n{\n    using namespace std;\n    \/\/cerr << \"onFreeEntry \" << entry << endl;\n    \/\/cerr << \"closing zmq socket\" << entry->sock << \" with owner \"\n    \/\/     << entry->owner << endl;\n    delete entry->sock;\n    \/\/cerr << \"erasing\" << endl;\n    \/\/allForThread->erase(entry->owner);\n    \/\/cerr << \"unowning\" << endl;\n    ML::atomic_dec(entry->owner->numOpen);\n\n    entry->owner->removeThreadEntry(entry);\n\n    delete entry;\n\n    \/\/Datacratic::close(*sock);\n    \/\/ML::backtrace();\n    \/\/cerr << endl << endl;\n}\n\nvoid\nSocketPerThread::\ncleanupThisThread()\n{\n    \/\/cerr << \"cleaning up socket \" << entries->sock << endl;\n    entries.reset();\n}\n\nvoid\nSocketPerThread::\ncleanupAllForThread()\n{\n    if (!allForThread.get()) return;\n    \/\/cerr << \"cleaning up \" << allForThread->size() << \" sockets\" << endl;\n\n    for (auto it = allForThread->begin();  it != allForThread->end();\n         it = allForThread->begin())\n        (*it)->cleanupThisThread();\n\n    \/\/cerr << \"we now have \" << allForThread->size() << \" sockets left\" << endl;\n}\n\nvoid\nSocketPerThread::\nremoveThreadEntry(Entry * entry)\n{\n    Guard guard(allThreadsLock);\n    allThreads.erase(entry);\n}\n\nvoid\nSocketPerThread::\naddThreadEntry(Entry * entry)\n{\n    Guard guard(allThreadsLock);\n    allThreads.insert(entry);\n}\n\nboost::thread_specific_ptr<std::set<SocketPerThread *> >\nSocketPerThread::allForThread;\n\n} \/\/ namespace Datacratic\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ QC.cpp\n\/\/\n\/\/ Class to compute QC metrics on .sim files\n\/\/ Metrics include: Sample magnitude (normalized by probe), sample xydiff\n\/\/\n\/\/\n\/\/ Author: Iain Bancarz <ib5@sanger.ac.uk>\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\/\/ 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 and\/or\n\/\/ other materials provided with the distribution.\n\/\/ 3. Neither the name of the Genome Research Ltd nor the names of its contributors \n\/\/ may be used to endorse or promote products derived from software without specific\n\/\/ prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR WARRANTIES, \n\/\/ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS \n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. EVENT SHALL GENOME RESEARCH LTD. BE LIABLE \n\/\/ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES \n\/\/ (INCLUDING, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, \n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF \n\/\/ LIABILITY, 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 ADVISED OF\n\/\/ THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\n\n#include <cmath>\n#include <cstdio>\n#include <ctime>\n#include <iostream>\n#include <stdlib.h>  \n#include <string.h>\n\n#include \"QC.h\"\n#include \"Sim.h\"\n\n\nusing namespace std;\n\nQC::QC(string simPath, bool verbose=false) {\n  qcsim = new Sim();\n  if (!qcsim->errorMsg.empty()) {\n    cout << qcsim->errorMsg << endl;\n    exit(1);\n  }\n  qcsim->open(simPath);\n  if (verbose) cerr << \"Opened .sim file \" << simPath << endl;\n  \/\/ define vector objects to hold intensities\n  intensity_int = new vector<uint16_t>();\n  intensity_float = new vector<float>();\n  if (verbose) cerr << \"Created intensity vectors\" << endl;\n  int vectorSize = qcsim->numProbes * qcsim->numChannels;\n  if (verbose) cerr << \"Reserving space for \" << vectorSize << \n\t\t \" intensities... \";\n  intensity_int->reserve(vectorSize);\n  intensity_float->reserve(vectorSize);\n  if (verbose) cerr << \"done.\" << endl;\n}\n\nvoid QC::writeMagnitude(string outPath, bool verbose) {\n  \/\/ compute normalized magnitudes by sample, write to given file\n  qcsim->reset(); \/\/ return read position to first sample\n  float *probeMagArray;\n  probeMagArray = (float *) calloc(qcsim->numProbes, sizeof(float));\n  magnitudeByProbe(probeMagArray, verbose);\n  float *sampleMagArray;\n  sampleMagArray = (float *) calloc(qcsim->numSamples, sizeof(float));\n  char sampleNames[qcsim->numSamples][Sim::SAMPLE_NAME_SIZE+1];\n  qcsim->reset(); \n  magnitudeBySample(sampleMagArray, probeMagArray, sampleNames, verbose);\n  if (verbose) cerr << \"Writing results\" << endl;\n  FILE *outFile = fopen(outPath.c_str(), \"w\");\n  for (unsigned int i=0; i<qcsim->numSamples; i++) {\n    \/\/ use fprintf to control number of decimal places\n    fprintf(outFile, \"%s\\t%.6f\\n\", sampleNames[i], sampleMagArray[i]);\n  }\n  fclose(outFile);\n  free(probeMagArray);\n  free(sampleMagArray);\n  if (verbose) cerr << \"Finished magnitude\" << endl;\n}\n\nvoid QC::writeXydiff(string outPath, bool verbose) {\n  \/\/ compute XY intensity difference by sample, write to given file\n  if (qcsim->numChannels!=2) {\n    cerr << \"Error: XY intensity difference is only defined for exactly \"\n      \"two intensity channels.\" << endl;\n    exit(1);\n  }\n  if (verbose) cerr << \"Computing XY intensity difference\" << endl;\n  qcsim->reset(); \/\/ return read position to first sample\n  float *xydArray;\n  xydArray = (float *) calloc(qcsim->numSamples, sizeof(float));\n  char sampleNames[qcsim->numSamples][Sim::SAMPLE_NAME_SIZE+1];\n  xydiffBySample(xydArray, sampleNames);\n  if (verbose) cerr << \"Writing results\" << endl;\n  FILE *outFile = fopen(outPath.c_str(), \"w\");\n  for (unsigned int i=0; i<qcsim->numSamples; i++) {\n    \/\/ use fprintf to control number of decimal places\n    fprintf(outFile, \"%s\\t%.6f\\n\", sampleNames[i], xydArray[i]);\n  }\n  if (verbose) cerr << \"Finished xydiff\" << endl;\n  fclose(outFile);\n}\n\nvoid QC::getNextMagnitudes(float magnitudes[], char *sampleName, Sim *sim) {\n  \/\/ compute magnitudes for each probe from next sample in .sim input\n  \/\/ can handle arbitrarily many intensity channels; also reads sample name\n  \/\/vector<uint16_t> *intensity_int = new vector<uint16_t>;\n  \/\/vector<float> *intensity_float = new vector<float>;\n  intensity_float->clear();\n  intensity_int->clear();\n  if (sim->numberFormat == 0) {\n    sim->getNextRecord(sampleName, intensity_float);\n  } else {\n    sim->getNextRecord(sampleName, intensity_int);\n  }\n  for (unsigned int i=0; i < sim->numProbes; i++) {\n    float total = 0.0; \/\/ running total of squared intensities\n    for (int j=0; j<sim->numChannels; j++) {\n      int index = i*sim->numChannels + j;\n      float signal;\n      if (sim->numberFormat == 0) signal = intensity_float->at(index);\n      else signal = intensity_int->at(index);\n      total += signal * signal;\n    }\n    magnitudes[i] = sqrt(total);\n  }\n}\n\nvoid QC::magnitudeByProbe(float magByProbe[], bool verbose=false) {\n  \/\/ iterate over samples; update running totals of magnitude by probe\n  \/\/ then divide to find mean for each probe\n  if (verbose) cerr << \"Finding mean magnitude by probe\" << endl; \n  float *magnitudes;\n  magnitudes = (float *) calloc(qcsim->numProbes, sizeof(float));\n  char *sampleName; \/\/ placeholder; name used in magnitudeBySample\n  sampleName = new char[qcsim->sampleNameSize];\n  for(unsigned int i=0; i < qcsim->numSamples; i++) {\n    getNextMagnitudes(magnitudes, sampleName, qcsim);\n    for (unsigned int j=0; j < qcsim->numProbes; j++) {\n      magByProbe[j] += magnitudes[j];\n    }\n    if (verbose && i % QC::VERBOSE_FREQ == 0) {\n      char *t;\n      t = new char[QC::TIME_BUFFER];\n      timeText(t);\n      cerr << t << \" Sample \" << i+1 << \" of \" << qcsim->numSamples << endl;\n      delete t;\n    }\n  }\n  for (unsigned int i=0; i < qcsim->numProbes; i++) {\n    magByProbe[i] = magByProbe[i] \/ qcsim->numSamples;\n  }\n  free(magnitudes);\n  if (verbose) cerr << \"Completed mean magnitude by probe\" << endl;\n}\n\nvoid QC::magnitudeBySample(float magBySample[], float magByProbe[], \n\t\t\t   char sampleNames[][Sim::SAMPLE_NAME_SIZE+1],\n\t\t\t   bool verbose=false) {\n  \/\/ find mean sample magnitude, normalized for each probe\n  \/\/ also read sample names\n  if (verbose) cerr << \"Finding normalized mean magnitude by sample\" << endl; \n  float *magnitudes;\n  magnitudes = (float *) calloc(qcsim->numProbes, sizeof(float));\n  for(unsigned int i=0; i < qcsim->numSamples; i++) {\n    char *sampleName;\n    sampleName = new char[qcsim->sampleNameSize];\n    getNextMagnitudes(magnitudes, sampleName, qcsim);\n    strcpy(sampleNames[i], sampleName);\n    float mag = 0;\n    for (unsigned int j=0; j < qcsim->numProbes; j++) {\n      mag += magnitudes[j]\/magByProbe[j];\n    }\n    magBySample[i] = mag \/ qcsim -> numProbes;\n    if (verbose && i % QC::VERBOSE_FREQ == 0) {\n      char *t;\n      t = new char[QC::TIME_BUFFER];\n      timeText(t);\n      cerr << t << \" Sample \" << i+1 << \" of \" << qcsim->numSamples << endl;\n      delete t;\n    }\n  }\n  free(magnitudes);\n  if (verbose) cerr << \"Completed mean magnitude by sample\" << endl;\n}\n\nvoid QC::xydiffBySample(float xydBySample[], \n\t\t\tchar sampleNames[][Sim::SAMPLE_NAME_SIZE+1]) {\n  \/\/ find xydiff and read sample names\n  for(unsigned int i=0; i < qcsim->numSamples; i++) {\n    char *sampleName;\n    sampleName = new char[qcsim->sampleNameSize];\n    float xydTotal = 0.0; \/\/ running total of xy difference\n    vector<uint16_t> *intensity_int = new vector<uint16_t>;\n    vector<float> *intensity_float = new vector<float>;\n    if (qcsim->numberFormat == 0) {\n      qcsim->getNextRecord(sampleName, intensity_float);\n    } else {\n      qcsim->getNextRecord(sampleName, intensity_int);\n    }\n    strcpy(sampleNames[i], sampleName);\n    for (unsigned int j=0; j<qcsim->numProbes; j++) {\n      int index = j*qcsim->numChannels;\n      float xyd;\n      if (qcsim->numberFormat == 0) {\n\txyd = intensity_float->at(index+1) - intensity_float->at(index);\n      }\n      else {\n\txyd = intensity_int->at(index+1) - intensity_int->at(index);\n      }\n      xydTotal += xyd;\n    }\n    xydBySample[i] = xydTotal \/ qcsim->numProbes;\n    delete intensity_int;\n    delete intensity_float;\n  }\n}\n\nvoid QC::timeText(char *buffer) {\n  \/\/ get current time in format 06-09-2013_09:01:58\n  time_t rawtime;\n  time(&rawtime);\n  strftime(buffer, QC::TIME_BUFFER, \"%d-%m-%Y_%H:%M:%S\", localtime(&rawtime));\n}\n\n\n<commit_msg>Use pointers instead of at() for faster access to vector<commit_after>\/\/\n\/\/ QC.cpp\n\/\/\n\/\/ Class to compute QC metrics on .sim files\n\/\/ Metrics include: Sample magnitude (normalized by probe), sample xydiff\n\/\/\n\/\/\n\/\/ Author: Iain Bancarz <ib5@sanger.ac.uk>\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\/\/ 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 and\/or\n\/\/ other materials provided with the distribution.\n\/\/ 3. Neither the name of the Genome Research Ltd nor the names of its contributors \n\/\/ may be used to endorse or promote products derived from software without specific\n\/\/ prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR WARRANTIES, \n\/\/ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS \n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. EVENT SHALL GENOME RESEARCH LTD. BE LIABLE \n\/\/ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES \n\/\/ (INCLUDING, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, \n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF \n\/\/ LIABILITY, 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 ADVISED OF\n\/\/ THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\n\n#include <cmath>\n#include <cstdio>\n#include <ctime>\n#include <iostream>\n#include <stdlib.h>  \n#include <string.h>\n\n#include \"QC.h\"\n#include \"Sim.h\"\n\n\nusing namespace std;\n\nQC::QC(string simPath, bool verbose=false) {\n  qcsim = new Sim();\n  if (!qcsim->errorMsg.empty()) {\n    cout << qcsim->errorMsg << endl;\n    exit(1);\n  }\n  qcsim->open(simPath);\n  if (verbose) cerr << \"Opened .sim file \" << simPath << endl;\n  \/\/ define vector objects to hold intensities\n  intensity_int = new vector<uint16_t>();\n  intensity_float = new vector<float>();\n  if (verbose) cerr << \"Created intensity vectors\" << endl;\n  int vectorSize = qcsim->numProbes * qcsim->numChannels;\n  if (verbose) cerr << \"Reserving space for \" << vectorSize << \n\t\t \" intensities... \";\n  intensity_int->reserve(vectorSize);\n  intensity_float->reserve(vectorSize);\n  if (verbose) cerr << \"done.\" << endl;\n}\n\nvoid QC::writeMagnitude(string outPath, bool verbose) {\n  \/\/ compute normalized magnitudes by sample, write to given file\n  qcsim->reset(); \/\/ return read position to first sample\n  float *probeMagArray;\n  probeMagArray = (float *) calloc(qcsim->numProbes, sizeof(float));\n  magnitudeByProbe(probeMagArray, verbose);\n  float *sampleMagArray;\n  sampleMagArray = (float *) calloc(qcsim->numSamples, sizeof(float));\n  char sampleNames[qcsim->numSamples][Sim::SAMPLE_NAME_SIZE+1];\n  qcsim->reset(); \n  magnitudeBySample(sampleMagArray, probeMagArray, sampleNames, verbose);\n  if (verbose) cerr << \"Writing results\" << endl;\n  FILE *outFile = fopen(outPath.c_str(), \"w\");\n  for (unsigned int i=0; i<qcsim->numSamples; i++) {\n    \/\/ use fprintf to control number of decimal places\n    fprintf(outFile, \"%s\\t%.6f\\n\", sampleNames[i], sampleMagArray[i]);\n  }\n  fclose(outFile);\n  free(probeMagArray);\n  free(sampleMagArray);\n  if (verbose) cerr << \"Finished magnitude\" << endl;\n}\n\nvoid QC::writeXydiff(string outPath, bool verbose) {\n  \/\/ compute XY intensity difference by sample, write to given file\n  if (qcsim->numChannels!=2) {\n    cerr << \"Error: XY intensity difference is only defined for exactly \"\n      \"two intensity channels.\" << endl;\n    exit(1);\n  }\n  if (verbose) cerr << \"Computing XY intensity difference\" << endl;\n  qcsim->reset(); \/\/ return read position to first sample\n  float *xydArray;\n  xydArray = (float *) calloc(qcsim->numSamples, sizeof(float));\n  char sampleNames[qcsim->numSamples][Sim::SAMPLE_NAME_SIZE+1];\n  xydiffBySample(xydArray, sampleNames);\n  if (verbose) cerr << \"Writing results\" << endl;\n  FILE *outFile = fopen(outPath.c_str(), \"w\");\n  for (unsigned int i=0; i<qcsim->numSamples; i++) {\n    \/\/ use fprintf to control number of decimal places\n    fprintf(outFile, \"%s\\t%.6f\\n\", sampleNames[i], xydArray[i]);\n  }\n  if (verbose) cerr << \"Finished xydiff\" << endl;\n  fclose(outFile);\n}\n\nvoid QC::getNextMagnitudes(float magnitudes[], char *sampleName, Sim *sim) {\n  \/\/ compute magnitudes for each probe from next sample in .sim input\n  \/\/ can handle arbitrarily many intensity channels; also reads sample name\n  intensity_float->clear();\n  intensity_int->clear();\n  if (sim->numberFormat == 0) {\n    sim->getNextRecord(sampleName, intensity_float);\n  } else {\n    sim->getNextRecord(sampleName, intensity_int);\n  }\n  \/\/ define pointer to first intensity element (depending on format)\n  \/\/ pointer is used for fast access to vector contents\n  float *intensityf;\n  uint16_t *intensityi;\n  unsigned int i, j, index;\n  float intensity, total;\n  if (sim->numberFormat == 0) intensityf = &(intensity_float->front());\n  else intensityi = &(intensity_int->front());\n  for (i=0; i < sim->numProbes; i++) {\n    total = 0.0; \/\/ running total of squared intensities\n    for (j=0; j<sim->numChannels; j++) {\n      index = i*sim->numChannels + j;\n      if (sim->numberFormat == 0) intensity = *(intensityf+index);\n      else intensity = *(intensityi+index);\n      total += intensity * intensity;\n    }\n    magnitudes[i] = sqrt(total);\n  }\n}\n\nvoid QC::magnitudeByProbe(float magByProbe[], bool verbose=false) {\n  \/\/ iterate over samples; update running totals of magnitude by probe\n  \/\/ then divide to find mean for each probe\n  if (verbose) cerr << \"Finding mean magnitude by probe\" << endl; \n  float *magnitudes;\n  magnitudes = (float *) calloc(qcsim->numProbes, sizeof(float));\n  char *sampleName; \/\/ placeholder; name used in magnitudeBySample\n  sampleName = new char[qcsim->sampleNameSize];\n  for(unsigned int i=0; i < qcsim->numSamples; i++) {\n    getNextMagnitudes(magnitudes, sampleName, qcsim);\n    for (unsigned int j=0; j < qcsim->numProbes; j++) {\n      magByProbe[j] += magnitudes[j];\n    }\n    if (verbose && i % QC::VERBOSE_FREQ == 0) {\n      char *t;\n      t = new char[QC::TIME_BUFFER];\n      timeText(t);\n      cerr << t << \" Sample \" << i+1 << \" of \" << qcsim->numSamples << endl;\n      delete t;\n    }\n  }\n  for (unsigned int i=0; i < qcsim->numProbes; i++) {\n    magByProbe[i] = magByProbe[i] \/ qcsim->numSamples;\n  }\n  free(magnitudes);\n  if (verbose) cerr << \"Completed mean magnitude by probe\" << endl;\n}\n\nvoid QC::magnitudeBySample(float magBySample[], float magByProbe[], \n\t\t\t   char sampleNames[][Sim::SAMPLE_NAME_SIZE+1],\n\t\t\t   bool verbose=false) {\n  \/\/ find mean sample magnitude, normalized for each probe\n  \/\/ also read sample names\n  if (verbose) cerr << \"Finding normalized mean magnitude by sample\" << endl; \n  float *magnitudes;\n  magnitudes = (float *) calloc(qcsim->numProbes, sizeof(float));\n  for(unsigned int i=0; i < qcsim->numSamples; i++) {\n    char *sampleName;\n    sampleName = new char[qcsim->sampleNameSize];\n    getNextMagnitudes(magnitudes, sampleName, qcsim);\n    strcpy(sampleNames[i], sampleName);\n    float mag = 0;\n    for (unsigned int j=0; j < qcsim->numProbes; j++) {\n      mag += magnitudes[j]\/magByProbe[j];\n    }\n    magBySample[i] = mag \/ qcsim -> numProbes;\n    if (verbose && i % QC::VERBOSE_FREQ == 0) {\n      char *t;\n      t = new char[QC::TIME_BUFFER];\n      timeText(t);\n      cerr << t << \" Sample \" << i+1 << \" of \" << qcsim->numSamples << endl;\n      delete t;\n    }\n  }\n  free(magnitudes);\n  if (verbose) cerr << \"Completed mean magnitude by sample\" << endl;\n}\n\nvoid QC::xydiffBySample(float xydBySample[], \n\t\t\tchar sampleNames[][Sim::SAMPLE_NAME_SIZE+1]) {\n  \/\/ find xydiff and read sample names\n  for(unsigned int i=0; i < qcsim->numSamples; i++) {\n    char *sampleName;\n    sampleName = new char[qcsim->sampleNameSize];\n    float xydTotal = 0.0; \/\/ running total of xy difference\n    vector<uint16_t> *intensity_int = new vector<uint16_t>;\n    vector<float> *intensity_float = new vector<float>;\n    if (qcsim->numberFormat == 0) {\n      qcsim->getNextRecord(sampleName, intensity_float);\n    } else {\n      qcsim->getNextRecord(sampleName, intensity_int);\n    }\n    strcpy(sampleNames[i], sampleName);\n    \/\/ define pointer to first intensity element (depending on format)\n    \/\/ pointer is used for fast access to vector contents\n    float *intensityf;\n    uint16_t *intensityi;\n    if (qcsim->numberFormat == 0) intensityf = &(intensity_float->front());\n    else intensityi = &(intensity_int->front());\n    for (unsigned int j=0; j<qcsim->numProbes; j++) {\n      int index = j*qcsim->numChannels;\n      float x, y;\n      if (qcsim->numberFormat == 0) {\n\tx = *(intensityf+index);\n\ty = *(intensityf+index+1);\n      }\n      else {\n\tx = *(intensityi+index);\n\ty = *(intensityi+index+1);\n      }\n      xydTotal += (y-x);\n    }\n    xydBySample[i] = xydTotal \/ qcsim->numProbes;\n    delete intensity_int;\n    delete intensity_float;\n  }\n}\n\nvoid QC::timeText(char *buffer) {\n  \/\/ get current time in format 06-09-2013_09:01:58\n  time_t rawtime;\n  time(&rawtime);\n  strftime(buffer, QC::TIME_BUFFER, \"%d-%m-%Y_%H:%M:%S\", localtime(&rawtime));\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- Writer.cpp - Library for Printing VM assembly files ------*- C++ -*--=\/\/\n\/\/\n\/\/ This library implements the functionality defined in llvm\/Assembly\/Writer.h\n\/\/\n\/\/ This library uses the Analysis library to figure out offsets for\n\/\/ variables in the method tables...\n\/\/\n\/\/ TODO: print out the type name instead of the full type if a particular type\n\/\/       is in the symbol table...\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"llvm\/Analysis\/SlotCalculator.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Method.h\"\n#include \"llvm\/GlobalVariable.h\"\n#include \"llvm\/BasicBlock.h\"\n#include \"llvm\/ConstPoolVals.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/iMemory.h\"\n#include \"llvm\/Support\/STLExtras.h\"\n#include \"llvm\/SymbolTable.h\"\n#include <algorithm>\n\nvoid DebugValue(const Value *V) {\n  cerr << V << endl;\n}\n\n\/\/ WriteAsOperand - Write the name of the specified value out to the specified\n\/\/ ostream.  This can be useful when you just want to print int %reg126, not the\n\/\/ whole instruction that generated it.\n\/\/\nostream &WriteAsOperand(ostream &Out, const Value *V, bool PrintType, \n\t\t\tbool PrintName, SlotCalculator *Table) {\n  if (PrintType)\n    Out << \" \" << V->getType();\n  \n  if (PrintName && V->hasName()) {\n    Out << \" %\" << V->getName();\n  } else {\n    if (const ConstPoolVal *CPV = V->castConstant()) {\n      Out << \" \" << CPV->getStrValue();\n    } else {\n      int Slot;\n      if (Table) {\n\tSlot = Table->getValSlot(V);\n      } else {\n\tif (const Type *Ty = V->castType()) {\n\t  return Out << \" \" << Ty;\n\t} else if (const MethodArgument *MA = V->castMethodArgument()) {\n\t  Table = new SlotCalculator(MA->getParent(), true);\n\t} else if (const Instruction *I = V->castInstruction()) {\n\t  Table = new SlotCalculator(I->getParent()->getParent(), true);\n\t} else if (const BasicBlock *BB = V->castBasicBlock()) {\n\t  Table = new SlotCalculator(BB->getParent(), true);\n\t} else if (const Method *Meth = V->castMethod()) {\n\t  Table = new SlotCalculator(Meth, true);\n\t} else if (const Module *Mod  = V->castModule()) {\n\t  Table = new SlotCalculator(Mod, true);\n\t} else {\n\t  return Out << \"BAD VALUE TYPE!\";\n\t}\n\tSlot = Table->getValSlot(V);\n\tdelete Table;\n      }\n      if (Slot >= 0)  Out << \" %\" << Slot;\n      else if (PrintName)\n        Out << \"<badref>\";     \/\/ Not embeded into a location?\n    }\n  }\n  return Out;\n}\n\n\n\nclass AssemblyWriter {\n  ostream &Out;\n  SlotCalculator &Table;\npublic:\n  inline AssemblyWriter(ostream &o, SlotCalculator &Tab) : Out(o), Table(Tab) {\n  }\n\n  inline void write(const Module *M)         { processModule(M);      }\n  inline void write(const GlobalVariable *G) { processGlobal(G);      }\n  inline void write(const Method *M)         { processMethod(M);      }\n  inline void write(const BasicBlock *BB)    { processBasicBlock(BB); }\n  inline void write(const Instruction *I)    { processInstruction(I); }\n  inline void write(const ConstPoolVal *CPV) { processConstant(CPV);  }\n\nprivate :\n  void processModule(const Module *M);\n  void processSymbolTable(const SymbolTable &ST);\n  void processConstant(const ConstPoolVal *CPV);\n  void processGlobal(const GlobalVariable *GV);\n  void processMethod(const Method *M);\n  void processMethodArgument(const MethodArgument *MA);\n  void processBasicBlock(const BasicBlock *BB);\n  void processInstruction(const Instruction *I);\n  \n  void writeOperand(const Value *Op, bool PrintType, bool PrintName = true);\n};\n\n\nvoid AssemblyWriter::writeOperand(const Value *Operand, bool PrintType, \n\t\t\t\t  bool PrintName) {\n  WriteAsOperand(Out, Operand, PrintType, PrintName, &Table);\n}\n\n\nvoid AssemblyWriter::processModule(const Module *M) {\n  \/\/ Loop over the symbol table, emitting all named constants...\n  if (M->hasSymbolTable())\n    processSymbolTable(*M->getSymbolTable());\n  \n  for_each(M->gbegin(), M->gend(), \n\t   bind_obj(this, &AssemblyWriter::processGlobal));\n\t   \n  Out << \"implementation\\n\";\n\n  \/\/ Output all of the methods...\n  for_each(M->begin(), M->end(), bind_obj(this,&AssemblyWriter::processMethod));\n}\n\nvoid AssemblyWriter::processGlobal(const GlobalVariable *GV) {\n  if (GV->hasName()) Out << \"%\" << GV->getName() << \" = \";\n\n  if (!GV->hasInitializer()) Out << \"uninitialized \";\n\n  Out << (GV->isConstant() ? \"constant \" : \"global \") \n      << GV->getType()->getValueType()->getDescription();\n\n  if (GV->hasInitializer())\n    writeOperand(GV->getInitializer(), false, false);\n\n  Out << endl;\n}\n\n\n\/\/ processSymbolTable - Run through symbol table looking for named constants\n\/\/ if a named constant is found, emit it's declaration...\n\/\/\nvoid AssemblyWriter::processSymbolTable(const SymbolTable &ST) {\n  for (SymbolTable::const_iterator TI = ST.begin(); TI != ST.end(); ++TI) {\n    SymbolTable::type_const_iterator I = ST.type_begin(TI->first);\n    SymbolTable::type_const_iterator End = ST.type_end(TI->first);\n    \n    for (; I != End; ++I) {\n      const Value *V = I->second;\n      if (const ConstPoolVal *CPV = V->castConstant()) {\n\tprocessConstant(CPV);\n      } else if (const Type *Ty = V->castType()) {\n\tOut << \"\\t%\" << I->first << \" = type \" << Ty->getDescription() << endl;\n      }\n    }\n  }\n}\n\n\n\/\/ processConstant - Print out a constant pool entry...\n\/\/\nvoid AssemblyWriter::processConstant(const ConstPoolVal *CPV) {\n  \/\/ Don't print out unnamed constants, they will be inlined\n  if (!CPV->hasName()) return;\n\n  \/\/ Print out name...\n  Out << \"\\t%\" << CPV->getName() << \" = \";\n\n  \/\/ Print out the constant type...\n  Out << CPV->getType();\n\n  \/\/ Write the value out now...\n  writeOperand(CPV, false, false);\n\n  if (!CPV->hasName() && CPV->getType() != Type::VoidTy) {\n    int Slot = Table.getValSlot(CPV); \/\/ Print out the def slot taken...\n    Out << \"\\t\\t; <\" << CPV->getType() << \">:\";\n    if (Slot >= 0) Out << Slot;\n    else Out << \"<badref>\";\n  } \n\n  Out << endl;\n}\n\n\/\/ processMethod - Process all aspects of a method.\n\/\/\nvoid AssemblyWriter::processMethod(const Method *M) {\n  \/\/ Print out the return type and name...\n  Out << \"\\n\" << (M->isExternal() ? \"declare \" : \"\") \n      << M->getReturnType() << \" \\\"\" << M->getName() << \"\\\"(\";\n  Table.incorporateMethod(M);\n\n  \/\/ Loop over the arguments, processing them...\n  for_each(M->getArgumentList().begin(), M->getArgumentList().end(),\n\t   bind_obj(this, &AssemblyWriter::processMethodArgument));\n\n\n  \/\/ Finish printing arguments...\n  const MethodType *MT = (const MethodType*)M->getType();\n  if (MT->isVarArg()) {\n    if (MT->getParamTypes().size()) Out << \", \";\n    Out << \"...\";  \/\/ Output varargs portion of signature!\n  }\n  Out << \")\\n\";\n\n  if (!M->isExternal()) {\n    \/\/ Loop over the symbol table, emitting all named constants...\n    if (M->hasSymbolTable())\n      processSymbolTable(*M->getSymbolTable());\n\n    Out << \"begin\";\n  \n    \/\/ Output all of its basic blocks... for the method\n    for_each(M->begin(), M->end(),\n\t     bind_obj(this, &AssemblyWriter::processBasicBlock));\n\n    Out << \"end\\n\";\n  }\n\n  Table.purgeMethod();\n}\n\n\/\/ processMethodArgument - This member is called for every argument that \n\/\/ is passed into the method.  Simply print it out\n\/\/\nvoid AssemblyWriter::processMethodArgument(const MethodArgument *Arg) {\n  \/\/ Insert commas as we go... the first arg doesn't get a comma\n  if (Arg != Arg->getParent()->getArgumentList().front()) Out << \", \";\n\n  \/\/ Output type...\n  Out << Arg->getType();\n  \n  \/\/ Output name, if available...\n  if (Arg->hasName())\n    Out << \" %\" << Arg->getName();\n  else if (Table.getValSlot(Arg) < 0)\n    Out << \"<badref>\";\n}\n\n\/\/ processBasicBlock - This member is called for each basic block in a methd.\n\/\/\nvoid AssemblyWriter::processBasicBlock(const BasicBlock *BB) {\n  if (BB->hasName()) {              \/\/ Print out the label if it exists...\n    Out << \"\\n\" << BB->getName() << \":\";\n  } else {\n    int Slot = Table.getValSlot(BB);\n    Out << \"\\n; <label>:\";\n    if (Slot >= 0) \n      Out << Slot;         \/\/ Extra newline seperates out label's\n    else \n      Out << \"<badref>\"; \n  }\n  Out << \"\\t\\t\\t\\t\\t;[#uses=\" << BB->use_size() << \"]\\n\";  \/\/ Output # uses\n\n  \/\/ Output all of the instructions in the basic block...\n  for_each(BB->begin(), BB->end(),\n\t   bind_obj(this, &AssemblyWriter::processInstruction));\n}\n\n\/\/ processInstruction - This member is called for each Instruction in a methd.\n\/\/\nvoid AssemblyWriter::processInstruction(const Instruction *I) {\n  Out << \"\\t\";\n\n  \/\/ Print out name if it exists...\n  if (I && I->hasName())\n    Out << \"%\" << I->getName() << \" = \";\n\n  \/\/ Print out the opcode...\n  Out << I->getOpcodeName();\n\n  \/\/ Print out the type of the operands...\n  const Value *Operand = I->getNumOperands() ? I->getOperand(0) : 0;\n\n  \/\/ Special case conditional branches to swizzle the condition out to the front\n  if (I->getOpcode() == Instruction::Br && I->getNumOperands() > 1) {\n    writeOperand(I->getOperand(2), true);\n    Out << \",\";\n    writeOperand(Operand, true);\n    Out << \",\";\n    writeOperand(I->getOperand(1), true);\n\n  } else if (I->getOpcode() == Instruction::Switch) {\n    \/\/ Special case switch statement to get formatting nice and correct...\n    writeOperand(Operand         , true); Out << \",\";\n    writeOperand(I->getOperand(1), true); Out << \" [\";\n\n    for (unsigned op = 2, Eop = I->getNumOperands(); op < Eop; op += 2) {\n      Out << \"\\n\\t\\t\";\n      writeOperand(I->getOperand(op  ), true); Out << \",\";\n      writeOperand(I->getOperand(op+1), true);\n    }\n    Out << \"\\n\\t]\";\n  } else if (I->isPHINode()) {\n    Out << \" \" << Operand->getType();\n\n    Out << \" [\";  writeOperand(Operand, false); Out << \",\";\n    writeOperand(I->getOperand(1), false); Out << \" ]\";\n    for (unsigned op = 2, Eop = I->getNumOperands(); op < Eop; op += 2) {\n      Out << \", [\";  \n      writeOperand(I->getOperand(op  ), false); Out << \",\";\n      writeOperand(I->getOperand(op+1), false); Out << \" ]\";\n    }\n  } else if (I->getOpcode() == Instruction::Ret && !Operand) {\n    Out << \" void\";\n  } else if (I->getOpcode() == Instruction::Call) {\n    writeOperand(Operand, true);\n    Out << \"(\";\n    if (I->getNumOperands() > 1) writeOperand(I->getOperand(1), true);\n    for (unsigned op = 2, Eop = I->getNumOperands(); op < Eop; ++op) {\n      Out << \",\";\n      writeOperand(I->getOperand(op), true);\n    }\n\n    Out << \" )\";\n  } else if (I->getOpcode() == Instruction::Malloc || \n\t     I->getOpcode() == Instruction::Alloca) {\n    Out << \" \" << ((const PointerType*)I->getType())->getValueType();\n    if (I->getNumOperands()) {\n      Out << \",\";\n      writeOperand(I->getOperand(0), true);\n    }\n  } else if (I->getOpcode() == Instruction::Cast) {\n    writeOperand(Operand, true);\n    Out << \" to \" << I->getType();\n  } else if (Operand) {   \/\/ Print the normal way...\n\n    \/\/ PrintAllTypes - Instructions who have operands of all the same type \n    \/\/ omit the type from all but the first operand.  If the instruction has\n    \/\/ different type operands (for example br), then they are all printed.\n    bool PrintAllTypes = false;\n    const Type *TheType = Operand->getType();\n\n    for (unsigned i = 1, E = I->getNumOperands(); i != E; ++i) {\n      Operand = I->getOperand(i);\n      if (Operand->getType() != TheType) {\n\tPrintAllTypes = true;       \/\/ We have differing types!  Print them all!\n\tbreak;\n      }\n    }\n\n    if (!PrintAllTypes)\n      Out << \" \" << I->getOperand(0)->getType();\n\n    for (unsigned i = 0, E = I->getNumOperands(); i != E; ++i) {\n      if (i) Out << \",\";\n      writeOperand(I->getOperand(i), PrintAllTypes);\n    }\n  }\n\n  \/\/ Print a little comment after the instruction indicating which slot it\n  \/\/ occupies.\n  \/\/\n  if (I->getType() != Type::VoidTy) {\n    Out << \"\\t\\t; <\" << I->getType() << \">\";\n\n    if (!I->hasName()) {\n      int Slot = Table.getValSlot(I); \/\/ Print out the def slot taken...\n      if (Slot >= 0) Out << \":\" << Slot;\n      else Out << \":<badref>\";\n    }\n    Out << \"\\t[#uses=\" << I->use_size() << \"]\";  \/\/ Output # uses\n  }\n  Out << endl;\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                       External Interface declarations\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n\nvoid WriteToAssembly(const Module *M, ostream &o) {\n  if (M == 0) { o << \"<null> module\\n\"; return; }\n  SlotCalculator SlotTable(M, true);\n  AssemblyWriter W(o, SlotTable);\n\n  W.write(M);\n}\n\nvoid WriteToAssembly(const GlobalVariable *G, ostream &o) {\n  if (G == 0) { o << \"<null> global variable\\n\"; return; }\n  SlotCalculator SlotTable(G->getParent(), true);\n  AssemblyWriter W(o, SlotTable);\n  W.write(G);\n}\n\nvoid WriteToAssembly(const Method *M, ostream &o) {\n  if (M == 0) { o << \"<null> method\\n\"; return; }\n  SlotCalculator SlotTable(M->getParent(), true);\n  AssemblyWriter W(o, SlotTable);\n\n  W.write(M);\n}\n\n\nvoid WriteToAssembly(const BasicBlock *BB, ostream &o) {\n  if (BB == 0) { o << \"<null> basic block\\n\"; return; }\n\n  SlotCalculator SlotTable(BB->getParent(), true);\n  AssemblyWriter W(o, SlotTable);\n\n  W.write(BB);\n}\n\nvoid WriteToAssembly(const ConstPoolVal *CPV, ostream &o) {\n  if (CPV == 0) { o << \"<null> constant pool value\\n\"; return; }\n  WriteAsOperand(o, CPV, true, true, 0);\n}\n\nvoid WriteToAssembly(const Instruction *I, ostream &o) {\n  if (I == 0) { o << \"<null> instruction\\n\"; return; }\n\n  SlotCalculator SlotTable(I->getParent() ? I->getParent()->getParent() : 0, \n\t\t\t   true);\n  AssemblyWriter W(o, SlotTable);\n\n  W.write(I);\n}\n<commit_msg>Moved DebugValue to Value.cpp.<commit_after>\/\/===-- Writer.cpp - Library for Printing VM assembly files ------*- C++ -*--=\/\/\n\/\/\n\/\/ This library implements the functionality defined in llvm\/Assembly\/Writer.h\n\/\/\n\/\/ This library uses the Analysis library to figure out offsets for\n\/\/ variables in the method tables...\n\/\/\n\/\/ TODO: print out the type name instead of the full type if a particular type\n\/\/       is in the symbol table...\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"llvm\/Analysis\/SlotCalculator.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Method.h\"\n#include \"llvm\/GlobalVariable.h\"\n#include \"llvm\/BasicBlock.h\"\n#include \"llvm\/ConstPoolVals.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/iMemory.h\"\n#include \"llvm\/Support\/STLExtras.h\"\n#include \"llvm\/SymbolTable.h\"\n#include <algorithm>\n\n\/\/ WriteAsOperand - Write the name of the specified value out to the specified\n\/\/ ostream.  This can be useful when you just want to print int %reg126, not the\n\/\/ whole instruction that generated it.\n\/\/\nostream &WriteAsOperand(ostream &Out, const Value *V, bool PrintType, \n\t\t\tbool PrintName, SlotCalculator *Table) {\n  if (PrintType)\n    Out << \" \" << V->getType();\n  \n  if (PrintName && V->hasName()) {\n    Out << \" %\" << V->getName();\n  } else {\n    if (const ConstPoolVal *CPV = V->castConstant()) {\n      Out << \" \" << CPV->getStrValue();\n    } else {\n      int Slot;\n      if (Table) {\n\tSlot = Table->getValSlot(V);\n      } else {\n\tif (const Type *Ty = V->castType()) {\n\t  return Out << \" \" << Ty;\n\t} else if (const MethodArgument *MA = V->castMethodArgument()) {\n\t  Table = new SlotCalculator(MA->getParent(), true);\n\t} else if (const Instruction *I = V->castInstruction()) {\n\t  Table = new SlotCalculator(I->getParent()->getParent(), true);\n\t} else if (const BasicBlock *BB = V->castBasicBlock()) {\n\t  Table = new SlotCalculator(BB->getParent(), true);\n\t} else if (const Method *Meth = V->castMethod()) {\n\t  Table = new SlotCalculator(Meth, true);\n\t} else if (const Module *Mod  = V->castModule()) {\n\t  Table = new SlotCalculator(Mod, true);\n\t} else {\n\t  return Out << \"BAD VALUE TYPE!\";\n\t}\n\tSlot = Table->getValSlot(V);\n\tdelete Table;\n      }\n      if (Slot >= 0)  Out << \" %\" << Slot;\n      else if (PrintName)\n        Out << \"<badref>\";     \/\/ Not embeded into a location?\n    }\n  }\n  return Out;\n}\n\n\n\nclass AssemblyWriter {\n  ostream &Out;\n  SlotCalculator &Table;\npublic:\n  inline AssemblyWriter(ostream &o, SlotCalculator &Tab) : Out(o), Table(Tab) {\n  }\n\n  inline void write(const Module *M)         { processModule(M);      }\n  inline void write(const GlobalVariable *G) { processGlobal(G);      }\n  inline void write(const Method *M)         { processMethod(M);      }\n  inline void write(const BasicBlock *BB)    { processBasicBlock(BB); }\n  inline void write(const Instruction *I)    { processInstruction(I); }\n  inline void write(const ConstPoolVal *CPV) { processConstant(CPV);  }\n\nprivate :\n  void processModule(const Module *M);\n  void processSymbolTable(const SymbolTable &ST);\n  void processConstant(const ConstPoolVal *CPV);\n  void processGlobal(const GlobalVariable *GV);\n  void processMethod(const Method *M);\n  void processMethodArgument(const MethodArgument *MA);\n  void processBasicBlock(const BasicBlock *BB);\n  void processInstruction(const Instruction *I);\n  \n  void writeOperand(const Value *Op, bool PrintType, bool PrintName = true);\n};\n\n\nvoid AssemblyWriter::writeOperand(const Value *Operand, bool PrintType, \n\t\t\t\t  bool PrintName) {\n  WriteAsOperand(Out, Operand, PrintType, PrintName, &Table);\n}\n\n\nvoid AssemblyWriter::processModule(const Module *M) {\n  \/\/ Loop over the symbol table, emitting all named constants...\n  if (M->hasSymbolTable())\n    processSymbolTable(*M->getSymbolTable());\n  \n  for_each(M->gbegin(), M->gend(), \n\t   bind_obj(this, &AssemblyWriter::processGlobal));\n\n  Out << \"implementation\\n\";\n  \n  \/\/ Output all of the methods...\n  for_each(M->begin(), M->end(), bind_obj(this,&AssemblyWriter::processMethod));\n}\n\nvoid AssemblyWriter::processGlobal(const GlobalVariable *GV) {\n  if (GV->hasName()) Out << \"%\" << GV->getName() << \" = \";\n\n  if (!GV->hasInitializer()) Out << \"uninitialized \";\n\n  Out << (GV->isConstant() ? \"constant \" : \"global \") \n      << GV->getType()->getValueType()->getDescription();\n\n  if (GV->hasInitializer())\n    writeOperand(GV->getInitializer(), false, false);\n\n  Out << endl;\n}\n\n\n\/\/ processSymbolTable - Run through symbol table looking for named constants\n\/\/ if a named constant is found, emit it's declaration...\n\/\/\nvoid AssemblyWriter::processSymbolTable(const SymbolTable &ST) {\n  for (SymbolTable::const_iterator TI = ST.begin(); TI != ST.end(); ++TI) {\n    SymbolTable::type_const_iterator I = ST.type_begin(TI->first);\n    SymbolTable::type_const_iterator End = ST.type_end(TI->first);\n    \n    for (; I != End; ++I) {\n      const Value *V = I->second;\n      if (const ConstPoolVal *CPV = V->castConstant()) {\n\tprocessConstant(CPV);\n      } else if (const Type *Ty = V->castType()) {\n\tOut << \"\\t%\" << I->first << \" = type \" << Ty->getDescription() << endl;\n      }\n    }\n  }\n}\n\n\n\/\/ processConstant - Print out a constant pool entry...\n\/\/\nvoid AssemblyWriter::processConstant(const ConstPoolVal *CPV) {\n  \/\/ Don't print out unnamed constants, they will be inlined\n  if (!CPV->hasName()) return;\n\n  \/\/ Print out name...\n  Out << \"\\t%\" << CPV->getName() << \" = \";\n\n  \/\/ Print out the constant type...\n  Out << CPV->getType();\n\n  \/\/ Write the value out now...\n  writeOperand(CPV, false, false);\n\n  if (!CPV->hasName() && CPV->getType() != Type::VoidTy) {\n    int Slot = Table.getValSlot(CPV); \/\/ Print out the def slot taken...\n    Out << \"\\t\\t; <\" << CPV->getType() << \">:\";\n    if (Slot >= 0) Out << Slot;\n    else Out << \"<badref>\";\n  } \n\n  Out << endl;\n}\n\n\/\/ processMethod - Process all aspects of a method.\n\/\/\nvoid AssemblyWriter::processMethod(const Method *M) {\n  \/\/ Print out the return type and name...\n  Out << \"\\n\" << (M->isExternal() ? \"declare \" : \"\") \n      << M->getReturnType() << \" \\\"\" << M->getName() << \"\\\"(\";\n  Table.incorporateMethod(M);\n\n  \/\/ Loop over the arguments, processing them...\n  for_each(M->getArgumentList().begin(), M->getArgumentList().end(),\n\t   bind_obj(this, &AssemblyWriter::processMethodArgument));\n\n\n  \/\/ Finish printing arguments...\n  const MethodType *MT = (const MethodType*)M->getType();\n  if (MT->isVarArg()) {\n    if (MT->getParamTypes().size()) Out << \", \";\n    Out << \"...\";  \/\/ Output varargs portion of signature!\n  }\n  Out << \")\\n\";\n\n  if (!M->isExternal()) {\n    \/\/ Loop over the symbol table, emitting all named constants...\n    if (M->hasSymbolTable())\n      processSymbolTable(*M->getSymbolTable());\n\n    Out << \"begin\";\n  \n    \/\/ Output all of its basic blocks... for the method\n    for_each(M->begin(), M->end(),\n\t     bind_obj(this, &AssemblyWriter::processBasicBlock));\n\n    Out << \"end\\n\";\n  }\n\n  Table.purgeMethod();\n}\n\n\/\/ processMethodArgument - This member is called for every argument that \n\/\/ is passed into the method.  Simply print it out\n\/\/\nvoid AssemblyWriter::processMethodArgument(const MethodArgument *Arg) {\n  \/\/ Insert commas as we go... the first arg doesn't get a comma\n  if (Arg != Arg->getParent()->getArgumentList().front()) Out << \", \";\n\n  \/\/ Output type...\n  Out << Arg->getType();\n  \n  \/\/ Output name, if available...\n  if (Arg->hasName())\n    Out << \" %\" << Arg->getName();\n  else if (Table.getValSlot(Arg) < 0)\n    Out << \"<badref>\";\n}\n\n\/\/ processBasicBlock - This member is called for each basic block in a methd.\n\/\/\nvoid AssemblyWriter::processBasicBlock(const BasicBlock *BB) {\n  if (BB->hasName()) {              \/\/ Print out the label if it exists...\n    Out << \"\\n\" << BB->getName() << \":\";\n  } else {\n    int Slot = Table.getValSlot(BB);\n    Out << \"\\n; <label>:\";\n    if (Slot >= 0) \n      Out << Slot;         \/\/ Extra newline seperates out label's\n    else \n      Out << \"<badref>\"; \n  }\n  Out << \"\\t\\t\\t\\t\\t;[#uses=\" << BB->use_size() << \"]\\n\";  \/\/ Output # uses\n\n  \/\/ Output all of the instructions in the basic block...\n  for_each(BB->begin(), BB->end(),\n\t   bind_obj(this, &AssemblyWriter::processInstruction));\n}\n\n\/\/ processInstruction - This member is called for each Instruction in a methd.\n\/\/\nvoid AssemblyWriter::processInstruction(const Instruction *I) {\n  Out << \"\\t\";\n\n  \/\/ Print out name if it exists...\n  if (I && I->hasName())\n    Out << \"%\" << I->getName() << \" = \";\n\n  \/\/ Print out the opcode...\n  Out << I->getOpcodeName();\n\n  \/\/ Print out the type of the operands...\n  const Value *Operand = I->getNumOperands() ? I->getOperand(0) : 0;\n\n  \/\/ Special case conditional branches to swizzle the condition out to the front\n  if (I->getOpcode() == Instruction::Br && I->getNumOperands() > 1) {\n    writeOperand(I->getOperand(2), true);\n    Out << \",\";\n    writeOperand(Operand, true);\n    Out << \",\";\n    writeOperand(I->getOperand(1), true);\n\n  } else if (I->getOpcode() == Instruction::Switch) {\n    \/\/ Special case switch statement to get formatting nice and correct...\n    writeOperand(Operand         , true); Out << \",\";\n    writeOperand(I->getOperand(1), true); Out << \" [\";\n\n    for (unsigned op = 2, Eop = I->getNumOperands(); op < Eop; op += 2) {\n      Out << \"\\n\\t\\t\";\n      writeOperand(I->getOperand(op  ), true); Out << \",\";\n      writeOperand(I->getOperand(op+1), true);\n    }\n    Out << \"\\n\\t]\";\n  } else if (I->isPHINode()) {\n    Out << \" \" << Operand->getType();\n\n    Out << \" [\";  writeOperand(Operand, false); Out << \",\";\n    writeOperand(I->getOperand(1), false); Out << \" ]\";\n    for (unsigned op = 2, Eop = I->getNumOperands(); op < Eop; op += 2) {\n      Out << \", [\";  \n      writeOperand(I->getOperand(op  ), false); Out << \",\";\n      writeOperand(I->getOperand(op+1), false); Out << \" ]\";\n    }\n  } else if (I->getOpcode() == Instruction::Ret && !Operand) {\n    Out << \" void\";\n  } else if (I->getOpcode() == Instruction::Call) {\n    writeOperand(Operand, true);\n    Out << \"(\";\n    if (I->getNumOperands() > 1) writeOperand(I->getOperand(1), true);\n    for (unsigned op = 2, Eop = I->getNumOperands(); op < Eop; ++op) {\n      Out << \",\";\n      writeOperand(I->getOperand(op), true);\n    }\n\n    Out << \" )\";\n  } else if (I->getOpcode() == Instruction::Malloc || \n\t     I->getOpcode() == Instruction::Alloca) {\n    Out << \" \" << ((const PointerType*)I->getType())->getValueType();\n    if (I->getNumOperands()) {\n      Out << \",\";\n      writeOperand(I->getOperand(0), true);\n    }\n  } else if (I->getOpcode() == Instruction::Cast) {\n    writeOperand(Operand, true);\n    Out << \" to \" << I->getType();\n  } else if (Operand) {   \/\/ Print the normal way...\n\n    \/\/ PrintAllTypes - Instructions who have operands of all the same type \n    \/\/ omit the type from all but the first operand.  If the instruction has\n    \/\/ different type operands (for example br), then they are all printed.\n    bool PrintAllTypes = false;\n    const Type *TheType = Operand->getType();\n\n    for (unsigned i = 1, E = I->getNumOperands(); i != E; ++i) {\n      Operand = I->getOperand(i);\n      if (Operand->getType() != TheType) {\n\tPrintAllTypes = true;       \/\/ We have differing types!  Print them all!\n\tbreak;\n      }\n    }\n\n    if (!PrintAllTypes)\n      Out << \" \" << I->getOperand(0)->getType();\n\n    for (unsigned i = 0, E = I->getNumOperands(); i != E; ++i) {\n      if (i) Out << \",\";\n      writeOperand(I->getOperand(i), PrintAllTypes);\n    }\n  }\n\n  \/\/ Print a little comment after the instruction indicating which slot it\n  \/\/ occupies.\n  \/\/\n  if (I->getType() != Type::VoidTy) {\n    Out << \"\\t\\t; <\" << I->getType() << \">\";\n\n    if (!I->hasName()) {\n      int Slot = Table.getValSlot(I); \/\/ Print out the def slot taken...\n      if (Slot >= 0) Out << \":\" << Slot;\n      else Out << \":<badref>\";\n    }\n    Out << \"\\t[#uses=\" << I->use_size() << \"]\";  \/\/ Output # uses\n  }\n  Out << endl;\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/                       External Interface declarations\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n\nvoid WriteToAssembly(const Module *M, ostream &o) {\n  if (M == 0) { o << \"<null> module\\n\"; return; }\n  SlotCalculator SlotTable(M, true);\n  AssemblyWriter W(o, SlotTable);\n\n  W.write(M);\n}\n\nvoid WriteToAssembly(const GlobalVariable *G, ostream &o) {\n  if (G == 0) { o << \"<null> global variable\\n\"; return; }\n  SlotCalculator SlotTable(G->getParent(), true);\n  AssemblyWriter W(o, SlotTable);\n  W.write(G);\n}\n\nvoid WriteToAssembly(const Method *M, ostream &o) {\n  if (M == 0) { o << \"<null> method\\n\"; return; }\n  SlotCalculator SlotTable(M->getParent(), true);\n  AssemblyWriter W(o, SlotTable);\n\n  W.write(M);\n}\n\n\nvoid WriteToAssembly(const BasicBlock *BB, ostream &o) {\n  if (BB == 0) { o << \"<null> basic block\\n\"; return; }\n\n  SlotCalculator SlotTable(BB->getParent(), true);\n  AssemblyWriter W(o, SlotTable);\n\n  W.write(BB);\n}\n\nvoid WriteToAssembly(const ConstPoolVal *CPV, ostream &o) {\n  if (CPV == 0) { o << \"<null> constant pool value\\n\"; return; }\n  WriteAsOperand(o, CPV, true, true, 0);\n}\n\nvoid WriteToAssembly(const Instruction *I, ostream &o) {\n  if (I == 0) { o << \"<null> instruction\\n\"; return; }\n\n  SlotCalculator SlotTable(I->getParent() ? I->getParent()->getParent() : 0, \n\t\t\t   true);\n  AssemblyWriter W(o, SlotTable);\n\n  W.write(I);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include <fstream>\n#include <iostream>\n#include \"map.h\"\n\nusing namespace std;\n\nMap::Map() {}\n\nMap::~Map() {}\n\nvoid Map::LoadMap(string MapFileName){\n\tstring Temp;\n\tstring T;\n\tfstream MapFile;\n\tint X = 0;\n\tint Y = 0;\n\tint F = 0;\n\t\n\tMapFile.open (MapFileName, fstream::in);\n\twhile ( MapFile >> Temp ){\n\t\t\n\t\t\t\tcout << Temp << endl << endl << endl << flush;\n\t\tfor (int i = 0; i < Temp.length(); i++){\n\t\t\tif (Temp[i] == ','){\n\t\t\t\tT = Temp.substr(F,i-F);\n\t\t\t\tcout << \"T=\" << T << \" \";\n\t\t\t\tmapArray[X][Y] = stoi(T);\n\t\t\t\tX++;\t\t\t\n\t\t\t\tif (X > MaxX){X = 0; Y++;}\n\t\t\t\tF = i + 1;\n\t\t\t\tcout << mapArray[X][Y] << flush;\n\t\t\t}\n\t\t}\n\t}\n\tMapFile.close();\n}\n\nint Map::Point(int X, int Y){\n\treturn (int)mapArray[X][Y];\n}\n\nbool Map::Passable(int X, int Y){\n\treturn (mapArray[X][Y] < PassableThreshhold);\n}\n\nstring Map::GetPlot(int X, int Y){\n\t\/\/Returns a 20x20 chunk of the map\n\tstring RetVal;\n\tstring Temp;\n\tfor (int i = X; i < X + 20; i++){\n\t\tfor (int j = Y; j < Y + 20; j++){\n\t\t\tif (i <= MaxX && i > -1 && j <= MaxY && j > -1){\n\t\t\t\tTemp = to_string(mapArray[i][j]);\n\t\t\t\tif (Temp.length() == 1) { RetVal += \"0\";}\n\t\t\t\tRetVal += Temp;\n\t\t\t} else {\n\t\t\tRetVal += \"-1\";\n\t\t\t}\n\t\t}\n\t}\n\treturn RetVal;\n}<commit_msg>Work in progress<commit_after>#include <string>\n#include <fstream>\n#include <iostream>\n#include \"map.h\"\n\nusing namespace std;\n\nMap::Map() {}\n\nMap::~Map() {}\n\nvoid Map::LoadMap(string MapFileName){\n\tstring Temp;\n\tstring T;\n\tfstream MapFile;\n\tint X = 0;\n\tint Y = 0;\n\tint F = 0;\n\t\n\tMapFile.open (MapFileName, fstream::in);\n\twhile ( MapFile >> Temp ){\n\t\t\n\t\t\t\tcout << Temp << endl << endl << endl << flush;\n\t\tfor (int i = 0; i < Temp.length(); i++){\n\t\t\tif (Temp[i] == ','){\n\t\t\t\tT = Temp.substr(F,i-F);\n\t\t\t\tcout << \"T=\" << T << \" \";\n\t\t\t\tmapArray[X][Y] = stoi(T);\n\t\t\t\tcout << mapArray[X][Y] << flush;\n\t\t\t\tX++;\t\t\t\n\t\t\t\tif (X > MaxX){X = 0; Y++;}\n\t\t\t\tF = i + 1;\n\t\t\t}\n\t\t}\n\t}\n\tMapFile.close();\n}\n\nint Map::Point(int X, int Y){\n\treturn (int)mapArray[X][Y];\n}\n\nbool Map::Passable(int X, int Y){\n\treturn (mapArray[X][Y] < PassableThreshhold);\n}\n\nstring Map::GetPlot(int X, int Y){\n\t\/\/Returns a 20x20 chunk of the map\n\tstring RetVal;\n\tstring Temp;\n\tfor (int i = X; i < X + 20; i++){\n\t\tfor (int j = Y; j < Y + 20; j++){\n\t\t\tif (i <= MaxX && i > -1 && j <= MaxY && j > -1){\n\t\t\t\tTemp = to_string(mapArray[i][j]);\n\t\t\t\tif (Temp.length() == 1) { RetVal += \"0\";}\n\t\t\t\tRetVal += Temp;\n\t\t\t} else {\n\t\t\tRetVal += \"-1\";\n\t\t\t}\n\t\t}\n\t}\n\treturn RetVal;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2022 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\n\/\/ Create a dot graph render of a Node Topology generated from a Redfish backend\n\n#include <algorithm>\n#include <deque>\n#include <iostream>\n#include <memory>\n#include <string>\n\n#include \"absl\/container\/flat_hash_map.h\"\n#include \"absl\/flags\/flag.h\"\n#include \"absl\/flags\/parse.h\"\n#include \"absl\/log\/initialize.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/str_format.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"ecclesia\/lib\/http\/cred.pb.h\"\n#include \"ecclesia\/lib\/http\/curl_client.h\"\n#include \"ecclesia\/lib\/redfish\/interface.h\"\n#include \"ecclesia\/lib\/redfish\/node_topology.h\"\n#include \"ecclesia\/lib\/redfish\/topology.h\"\n#include \"ecclesia\/lib\/redfish\/transport\/cache.h\"\n#include \"ecclesia\/lib\/redfish\/transport\/http.h\"\n#include \"ecclesia\/lib\/redfish\/transport\/http_redfish_intf.h\"\n\nABSL_FLAG(std::string, hostname_port, \"\",\n          \"TCP endpoint to connect with both hostname and port separated by a \"\n          \"colon i.e. \\\"localhost:8000\\\"\");\nABSL_FLAG(std::string, unix_domain_socket, \"\", \"UDS endpoint to connect to\");\n\nnamespace ecclesia {\nnamespace {\n\nint RealMain(int argc, char* argv[]) {\n  absl::InitializeLog();\n\n  std::string hostname_port = absl::GetFlag(FLAGS_hostname_port),\n              unix_domain_socket = absl::GetFlag(FLAGS_unix_domain_socket);\n\n  \/\/ Either TCP or UDS must provided\n  if (hostname_port.empty() == unix_domain_socket.empty()) {\n    std::cout << \"USAGE: \" << argv[0]\n              << \" (--hostname_port=\\\"{hostname:port}\\\") XOR \"\n                 \"(--unix_domain_socket=\\\"{unix_domain.socket}\\\")\"\n              << \"\\n\";\n    return -1;\n  }\n\n  std::unique_ptr<CurlHttpClient> curl_http_client =\n      std::make_unique<CurlHttpClient>(LibCurlProxy::CreateInstance(),\n                                       HttpCredential());\n  std::unique_ptr<HttpRedfishTransport> transport =\n      hostname_port.empty()\n          ? HttpRedfishTransport::MakeUds(std::move(curl_http_client),\n                                          unix_domain_socket)\n          : HttpRedfishTransport::MakeNetwork(std::move(curl_http_client),\n                                              hostname_port);\n  std::unique_ptr<RedfishCachedGetterInterface> cache =\n      std::make_unique<NullCache>(transport.get());\n  std::unique_ptr<RedfishInterface> intf = NewHttpInterface(\n      std::move(transport), std::move(cache), RedfishInterface::kTrusted);\n\n  if (!intf || !intf->GetRoot().status().ok()) {\n    std::cerr << \"Failed to connect to backend\" << std::endl;\n    return -1;\n  }\n\n  NodeTopology topology = CreateTopologyFromRedfish(intf.get());\n\n  std::vector<std::string> lines;\n  lines.push_back(\"\/\/ Start of the digraph\");\n  lines.push_back(\"digraph {\");\n  lines.push_back(\"  graph [splines=ortho, nodesep=0.25]\");\n  lines.push_back(\"  rankdir = LR;\");\n  lines.push_back(\"  node [shape=box];\");\n  lines.push_back(\"  edge [arrowsize=0.75];\");\n\n  absl::flat_hash_map<std::string, uint32_t> devpath_to_counter;\n  absl::flat_hash_map<Node*, std::string> node_to_secondary_devpath;\n  for (auto& node : topology.nodes) {\n    std::string devpath = node->local_devpath;\n    auto [it, inserted] = devpath_to_counter.try_emplace(devpath, 0);\n    if (!inserted) {\n      \/\/ Need to create the node as a secondary node\n      lines.push_back(\"  \/\/ Duplicate devpath found\");\n      uint32_t current_counter = ++it->second;\n      absl::StrAppend(&devpath, \"_dupe_\", current_counter);\n      node_to_secondary_devpath[node.get()] = devpath;\n    }\n\n    lines.push_back(absl::StrFormat(\n        \"  \\\"%s\\\" [tooltip=\\\"%s\\\", label=<<b>%s<\/b><br\/><i>%s<\/i>>]\", devpath,\n        absl::StrJoin(node->associated_uris, \"\\\\n\"), devpath, node->name));\n  }\n\n  auto it = topology.devpath_to_node_map.find(\"\/phys\");\n  if (it == topology.devpath_to_node_map.end()) {\n    lines.push_back(\"\/\/ No root node found\");\n  } else {\n    std::deque<Node*> queue;\n    queue.push_back(it->second);\n\n    while (!queue.empty()) {\n      auto* current_node = queue.front();\n      queue.pop_front();\n\n      auto children = topology.node_to_children.find(current_node);\n      if (children != topology.node_to_children.end()) {\n        \/\/ Check if the current node has a duplicated devpath\n        auto current_node_local_devpath = current_node->local_devpath;\n        if (auto current_node_it = node_to_secondary_devpath.find(current_node);\n            current_node_it != node_to_secondary_devpath.end()) {\n          current_node_local_devpath = current_node_it->second;\n        }\n\n        for (auto* child : children->second) {\n          \/\/ Check if the child node has a duplicated devpath\n          auto child_local_devpath = child->local_devpath;\n          if (auto child_it = node_to_secondary_devpath.find(child);\n              child_it != node_to_secondary_devpath.end()) {\n            child_local_devpath = child_it->second;\n          }\n\n          lines.push_back(absl::StrFormat(\"  \\\"%s\\\" -> \\\"%s\\\"\",\n                                          current_node_local_devpath,\n                                          child_local_devpath));\n\n          queue.push_back(child);\n        }\n      }\n    }\n  }\n\n  lines.push_back(\"}\");\n\n  std::cout << absl::StrJoin(lines, \"\\n\") << \"\\n\";\n\n  return 0;\n}\n\n}  \/\/ namespace\n}  \/\/ namespace ecclesia\n\nint main(int argc, char* argv[]) { return ecclesia::RealMain(argc, argv); }\n<commit_msg>Internal change<commit_after>\/*\n * Copyright 2022 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\n\/\/ Create a dot graph render of a Node Topology generated from a Redfish backend\n\n#include <algorithm>\n#include <deque>\n#include <iostream>\n#include <memory>\n#include <string>\n\n#include \"absl\/container\/flat_hash_map.h\"\n#include \"absl\/flags\/flag.h\"\n#include \"absl\/flags\/parse.h\"\n#include \"absl\/log\/initialize.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/str_format.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"ecclesia\/lib\/http\/cred.pb.h\"\n#include \"ecclesia\/lib\/http\/curl_client.h\"\n#include \"ecclesia\/lib\/redfish\/interface.h\"\n#include \"ecclesia\/lib\/redfish\/node_topology.h\"\n#include \"ecclesia\/lib\/redfish\/topology.h\"\n#include \"ecclesia\/lib\/redfish\/transport\/cache.h\"\n#include \"ecclesia\/lib\/redfish\/transport\/http.h\"\n#include \"ecclesia\/lib\/redfish\/transport\/http_redfish_intf.h\"\n\nABSL_FLAG(std::string, hostname_port, \"\",\n          \"TCP endpoint to connect with both hostname and port separated by a \"\n          \"colon i.e. \\\"localhost:8000\\\"\");\nABSL_FLAG(std::string, unix_domain_socket, \"\", \"UDS endpoint to connect to\");\n\nnamespace ecclesia {\nnamespace {\n\nint RealMain(int argc, char* argv[]) {\n  absl::InitializeLog();\n  absl::ParseCommandLine(argc, argv);\n\n  std::string hostname_port = absl::GetFlag(FLAGS_hostname_port),\n              unix_domain_socket = absl::GetFlag(FLAGS_unix_domain_socket);\n\n  \/\/ Either TCP or UDS must provided\n  if (hostname_port.empty() == unix_domain_socket.empty()) {\n    std::cout << \"USAGE: \" << argv[0]\n              << \" (--hostname_port=\\\"{hostname:port}\\\") XOR \"\n                 \"(--unix_domain_socket=\\\"{unix_domain.socket}\\\")\"\n              << \"\\n\";\n    return -1;\n  }\n\n  std::unique_ptr<CurlHttpClient> curl_http_client =\n      std::make_unique<CurlHttpClient>(LibCurlProxy::CreateInstance(),\n                                       HttpCredential());\n  std::unique_ptr<HttpRedfishTransport> transport =\n      hostname_port.empty()\n          ? HttpRedfishTransport::MakeUds(std::move(curl_http_client),\n                                          unix_domain_socket)\n          : HttpRedfishTransport::MakeNetwork(std::move(curl_http_client),\n                                              hostname_port);\n  std::unique_ptr<RedfishCachedGetterInterface> cache =\n      std::make_unique<NullCache>(transport.get());\n  std::unique_ptr<RedfishInterface> intf = NewHttpInterface(\n      std::move(transport), std::move(cache), RedfishInterface::kTrusted);\n\n  if (!intf || !intf->GetRoot().status().ok()) {\n    std::cerr << \"Failed to connect to backend\" << std::endl;\n    return -1;\n  }\n\n  NodeTopology topology = CreateTopologyFromRedfish(intf.get());\n\n  std::vector<std::string> lines;\n  lines.push_back(\"\/\/ Start of the digraph\");\n  lines.push_back(\"digraph {\");\n  lines.push_back(\"  graph [splines=ortho, nodesep=0.25]\");\n  lines.push_back(\"  rankdir = LR;\");\n  lines.push_back(\"  node [shape=box];\");\n  lines.push_back(\"  edge [arrowsize=0.75];\");\n\n  absl::flat_hash_map<std::string, uint32_t> devpath_to_counter;\n  absl::flat_hash_map<Node*, std::string> node_to_secondary_devpath;\n  for (auto& node : topology.nodes) {\n    std::string devpath = node->local_devpath;\n    auto [it, inserted] = devpath_to_counter.try_emplace(devpath, 0);\n    if (!inserted) {\n      \/\/ Need to create the node as a secondary node\n      lines.push_back(\"  \/\/ Duplicate devpath found\");\n      uint32_t current_counter = ++it->second;\n      absl::StrAppend(&devpath, \"_dupe_\", current_counter);\n      node_to_secondary_devpath[node.get()] = devpath;\n    }\n\n    lines.push_back(absl::StrFormat(\n        \"  \\\"%s\\\" [tooltip=\\\"%s\\\", label=<<b>%s<\/b><br\/><i>%s<\/i>>]\", devpath,\n        absl::StrJoin(node->associated_uris, \"\\\\n\"), devpath, node->name));\n  }\n\n  auto it = topology.devpath_to_node_map.find(\"\/phys\");\n  if (it == topology.devpath_to_node_map.end()) {\n    lines.push_back(\"\/\/ No root node found\");\n  } else {\n    std::deque<Node*> queue;\n    queue.push_back(it->second);\n\n    while (!queue.empty()) {\n      auto* current_node = queue.front();\n      queue.pop_front();\n\n      auto children = topology.node_to_children.find(current_node);\n      if (children != topology.node_to_children.end()) {\n        \/\/ Check if the current node has a duplicated devpath\n        auto current_node_local_devpath = current_node->local_devpath;\n        if (auto current_node_it = node_to_secondary_devpath.find(current_node);\n            current_node_it != node_to_secondary_devpath.end()) {\n          current_node_local_devpath = current_node_it->second;\n        }\n\n        for (auto* child : children->second) {\n          \/\/ Check if the child node has a duplicated devpath\n          auto child_local_devpath = child->local_devpath;\n          if (auto child_it = node_to_secondary_devpath.find(child);\n              child_it != node_to_secondary_devpath.end()) {\n            child_local_devpath = child_it->second;\n          }\n\n          lines.push_back(absl::StrFormat(\"  \\\"%s\\\" -> \\\"%s\\\"\",\n                                          current_node_local_devpath,\n                                          child_local_devpath));\n\n          queue.push_back(child);\n        }\n      }\n    }\n  }\n\n  lines.push_back(\"}\");\n\n  std::cout << absl::StrJoin(lines, \"\\n\") << \"\\n\";\n\n  return 0;\n}\n\n}  \/\/ namespace\n}  \/\/ namespace ecclesia\n\nint main(int argc, char* argv[]) { return ecclesia::RealMain(argc, argv); }\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#include \"getpot.h\"\n\n#include \"laplace_system.h\"\n\n#include \"boundary_info.h\"\n#include \"dof_map.h\"\n#include \"fe_base.h\"\n#include \"fe_interface.h\"\n#include \"fem_context.h\"\n#include \"mesh.h\"\n#include \"quadrature.h\"\n#include \"string_to_enum.h\"\n\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\nLaplaceSystem::LaplaceSystem( EquationSystems& es,\n\t\t\t      const std::string& name,\n\t\t\t      const unsigned int number)\n  : FEMSystem(es, name, number)\n{\n  return;\n}\n\nvoid LaplaceSystem::init_data ()\n{\n  \/\/ Check the input file for Reynolds number, application type,\n  \/\/ approximation type\n  GetPot infile(\"laplace.in\");\n\n  \/\/ Add the solution variable\n  u_var = this->add_variable (\"u\", SECOND, LAGRANGE_VEC);\n\n  this->time_evolving(u_var);\n\n  \/\/ Useful debugging options\n  \/\/ Set verify_analytic_jacobians to 1e-6 to use\n  this->verify_analytic_jacobians = infile(\"verify_analytic_jacobians\", 0.);\n  this->print_jacobians = infile(\"print_jacobians\", false);\n  this->print_element_jacobians = infile(\"print_element_jacobians\", false);\n\n  this->init_dirichlet_bcs();\n\n  \/\/ Do the parent's initialization after variables and boundary constraints are defined\n  FEMSystem::init_data();\n}\n\nvoid LaplaceSystem::init_dirichlet_bcs()\n{\n  const boundary_id_type all_ids[6] = {0,1,2,3,4,5};\n  std::set<boundary_id_type> boundary_ids( all_ids, all_ids+6 );\n\n  std::vector<unsigned int> vars;\n  vars.push_back( u_var );\n\n  BoundaryFunction func( u_var );\n\n  this->get_dof_map().add_dirichlet_boundary( libMesh::DirichletBoundary( boundary_ids, vars, &func ) );\n  return;\n}\n\nvoid LaplaceSystem::init_context(DiffContext &context)\n{\n  FEMContext &c = libmesh_cast_ref<FEMContext&>(context);\n\n  \/\/ Get finite element object\n  FEGenericBase<RealGradient>* fe;\n  c.get_element_fe<RealGradient>( u_var, fe );\n  \n  \/\/ We should prerequest all the data\n  \/\/ we will need to build the linear system.\n  fe->get_JxW();\n  fe->get_phi();\n  fe->get_dphi();\n  fe->get_xyz();\n\n  FEGenericBase<RealGradient>* side_fe;\n  c.get_side_fe<RealGradient>( u_var, side_fe );\n\n  side_fe->get_JxW();\n  side_fe->get_phi();\n}\n\n\nbool LaplaceSystem::element_time_derivative (bool request_jacobian,\n                                            DiffContext &context)\n{\n  FEMContext &c = libmesh_cast_ref<FEMContext&>(context);\n\n  \/\/ Get finite element object\n  FEGenericBase<RealGradient>* fe = NULL;\n  c.get_element_fe<RealGradient>( u_var, fe );\n  \n  \/\/ First we get some references to cell-specific data that\n  \/\/ will be used to assemble the linear system.\n\n  \/\/ Element Jacobian * quadrature weights for interior integration\n  const std::vector<Real> &JxW = fe->get_JxW();\n\n  \/\/ The velocity shape functions at interior quadrature points.\n  const std::vector<std::vector<RealGradient> >& phi = fe->get_phi();\n\n  \/\/ The velocity shape function gradients at interior\n  \/\/ quadrature points.\n  const std::vector<std::vector<RealTensor> >& grad_phi = fe->get_dphi();\n \n  const std::vector<Point>& qpoint = fe->get_xyz();\n\n  \/\/ The number of local degrees of freedom in each variable\n  const unsigned int n_u_dofs = c.dof_indices_var[u_var].size();\n\n  DenseSubMatrix<Number> &Kuu = *c.elem_subjacobians[u_var][u_var];\n\n  DenseSubVector<Number> &Fu = *c.elem_subresiduals[u_var];\n      \n  \/\/ Now we will build the element Jacobian and residual.\n  \/\/ Constructing the residual requires the solution and its\n  \/\/ gradient from the previous timestep.  This must be\n  \/\/ calculated at each quadrature point by summing the\n  \/\/ solution degree-of-freedom values by the appropriate\n  \/\/ weight functions.\n  const unsigned int n_qpoints = (c.get_element_qrule())->n_points();\n\n  for (unsigned int qp=0; qp != n_qpoints; qp++)\n    {\n      RealTensor grad_u;\n      \n      c.interior_gradient<RealGradient>( u_var, qp, grad_u );\n\n\n      \/\/ Value of the forcing function at this quadrature point\n      RealGradient f = this->forcing(qpoint[qp]);\n\n      \/\/ First, an i-loop over the velocity degrees of freedom.\n      \/\/ We know that n_u_dofs == n_v_dofs so we can compute contributions\n      \/\/ for both at the same time.\n      for (unsigned int i=0; i != n_u_dofs; i++)\n        {\n          Fu(i) += ( grad_u.contract(grad_phi[i][qp]) - f*phi[i][qp] )*JxW[qp];\n\n          if (request_jacobian)\n            {\n              \/\/ Matrix contributions for the uu and vv couplings.\n              for (unsigned int j=0; j != n_u_dofs; j++)\n                {\n                  Kuu(i,j) += grad_phi[j][qp].contract(grad_phi[i][qp])*JxW[qp];\n                 \n\t\t}\n\t    }\n        }\n    } \/\/ end of the quadrature point qp-loop\n  \n  return request_jacobian;\n}\n\n\/*\nbool LaplaceSystem::side_constraint (bool request_jacobian,\n\t\t\t\t     DiffContext &context)\n{\n  FEMContext &c = libmesh_cast_ref<FEMContext&>(context);\n\n  \/\/ Get finite element object\n  FEGenericBase<RealGradient>* side_fe = NULL;\n  c.get_side_fe<RealGradient>( u_var, side_fe );\n  \n  \/\/ First we get some references to cell-specific data that\n  \/\/ will be used to assemble the linear system.\n\n  \/\/ Element Jacobian * quadrature weights for interior integration\n  const std::vector<Real> &JxW = side_fe->get_JxW();\n\n  \/\/ The velocity shape functions at interior quadrature points.\n  const std::vector<std::vector<RealGradient> >& phi = side_fe->get_phi();\n\n  \/\/ The number of local degrees of freedom in each variable\n  const unsigned int n_u_dofs = c.dof_indices_var[u_var].size();\n\n  const std::vector<Point>& qpoint = side_fe->get_xyz();\n\n  \/\/ The penalty value.  \\frac{1}{\\epsilon}\n  \/\/ in the discussion above.\n  const Real penalty = 1.e10;\n\n  DenseSubMatrix<Number> &Kuu = *c.elem_subjacobians[u_var][u_var];\n  DenseSubVector<Number> &Fu = *c.elem_subresiduals[u_var];\n\n  const unsigned int n_qpoints = (c.get_side_qrule())->n_points();\n\n  for (unsigned int qp=0; qp != n_qpoints; qp++)\n    {\n      RealGradient u;\n      c.side_value<RealGradient>( u_var, qp, u );\n \n      RealGradient u_exact( this->exact_solution( 0, qpoint[qp](0), qpoint[qp](1) ),\n\t\t\t    this->exact_solution( 1, qpoint[qp](0), qpoint[qp](1) ));\n\n      for (unsigned int i=0; i != n_u_dofs; i++)\n\t{\n\t  Fu(i) += penalty*(u - u_exact)*phi[i][qp]*JxW[qp];\n\t  \n\t  if (request_jacobian)\n\t    {\n\t      for (unsigned int j=0; j != n_u_dofs; j++)\n\t\tKuu(i,j) += penalty*phi[j][qp]*phi[i][qp]*JxW[qp];\n\t    }\n\t}\n    }\n\n  return request_jacobian;\n}\n*\/\n\nRealGradient LaplaceSystem::forcing( const Point& p )\n{\n  Real x = p(0); Real y = p(1); Real z = p(2);\n  \n  const Real eps = 1.e-3;\n\n  const Real fx = -(exact_solution(0,x,y,z-eps) +\n\t\t    exact_solution(0,x,y,z+eps) +\n\t\t    exact_solution(0,x,y-eps,z) +\n\t\t    exact_solution(0,x,y+eps,z) +\n\t\t    exact_solution(0,x-eps,y,z) +\n\t\t    exact_solution(0,x+eps,y,z) -\n\t\t    6.*exact_solution(0,x,y,z))\/eps\/eps;\n  \n  const Real fy = -(exact_solution(1,x,y,z-eps) +\n\t\t    exact_solution(1,x,y,z+eps) +\n\t\t    exact_solution(1,x,y-eps,z) +\n\t\t    exact_solution(1,x,y+eps,z) +\n\t\t    exact_solution(1,x-eps,y,z) +\n\t\t    exact_solution(1,x+eps,y,z) -\n\t\t    6.*exact_solution(1,x,y,z))\/eps\/eps;\n\n  const Real fz = -(exact_solution(2,x,y,z-eps) +\n\t\t    exact_solution(2,x,y,z+eps) +\n\t\t    exact_solution(2,x,y-eps,z) +\n\t\t    exact_solution(2,x,y+eps,z) +\n\t\t    exact_solution(2,x-eps,y,z) +\n\t\t    exact_solution(2,x+eps,y,z) -\n\t\t    6.*exact_solution(2,x,y,z))\/eps\/eps;\n  \n  return RealGradient( fx, fy, fz );\n}\n<commit_msg>Fix for --enable-complex<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#include \"getpot.h\"\n\n#include \"laplace_system.h\"\n\n#include \"boundary_info.h\"\n#include \"dof_map.h\"\n#include \"fe_base.h\"\n#include \"fe_interface.h\"\n#include \"fem_context.h\"\n#include \"mesh.h\"\n#include \"quadrature.h\"\n#include \"string_to_enum.h\"\n\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\nLaplaceSystem::LaplaceSystem( EquationSystems& es,\n\t\t\t      const std::string& name,\n\t\t\t      const unsigned int number)\n  : FEMSystem(es, name, number)\n{\n  return;\n}\n\nvoid LaplaceSystem::init_data ()\n{\n  \/\/ Check the input file for Reynolds number, application type,\n  \/\/ approximation type\n  GetPot infile(\"laplace.in\");\n\n  \/\/ Add the solution variable\n  u_var = this->add_variable (\"u\", SECOND, LAGRANGE_VEC);\n\n  this->time_evolving(u_var);\n\n  \/\/ Useful debugging options\n  \/\/ Set verify_analytic_jacobians to 1e-6 to use\n  this->verify_analytic_jacobians = infile(\"verify_analytic_jacobians\", 0.);\n  this->print_jacobians = infile(\"print_jacobians\", false);\n  this->print_element_jacobians = infile(\"print_element_jacobians\", false);\n\n  this->init_dirichlet_bcs();\n\n  \/\/ Do the parent's initialization after variables and boundary constraints are defined\n  FEMSystem::init_data();\n}\n\nvoid LaplaceSystem::init_dirichlet_bcs()\n{\n  const boundary_id_type all_ids[6] = {0,1,2,3,4,5};\n  std::set<boundary_id_type> boundary_ids( all_ids, all_ids+6 );\n\n  std::vector<unsigned int> vars;\n  vars.push_back( u_var );\n\n  BoundaryFunction func( u_var );\n\n  this->get_dof_map().add_dirichlet_boundary( libMesh::DirichletBoundary( boundary_ids, vars, &func ) );\n  return;\n}\n\nvoid LaplaceSystem::init_context(DiffContext &context)\n{\n  FEMContext &c = libmesh_cast_ref<FEMContext&>(context);\n\n  \/\/ Get finite element object\n  FEGenericBase<RealGradient>* fe;\n  c.get_element_fe<RealGradient>( u_var, fe );\n  \n  \/\/ We should prerequest all the data\n  \/\/ we will need to build the linear system.\n  fe->get_JxW();\n  fe->get_phi();\n  fe->get_dphi();\n  fe->get_xyz();\n\n  FEGenericBase<RealGradient>* side_fe;\n  c.get_side_fe<RealGradient>( u_var, side_fe );\n\n  side_fe->get_JxW();\n  side_fe->get_phi();\n}\n\n\nbool LaplaceSystem::element_time_derivative (bool request_jacobian,\n                                            DiffContext &context)\n{\n  FEMContext &c = libmesh_cast_ref<FEMContext&>(context);\n\n  \/\/ Get finite element object\n  FEGenericBase<RealGradient>* fe = NULL;\n  c.get_element_fe<RealGradient>( u_var, fe );\n  \n  \/\/ First we get some references to cell-specific data that\n  \/\/ will be used to assemble the linear system.\n\n  \/\/ Element Jacobian * quadrature weights for interior integration\n  const std::vector<Real> &JxW = fe->get_JxW();\n\n  \/\/ The velocity shape functions at interior quadrature points.\n  const std::vector<std::vector<RealGradient> >& phi = fe->get_phi();\n\n  \/\/ The velocity shape function gradients at interior\n  \/\/ quadrature points.\n  const std::vector<std::vector<RealTensor> >& grad_phi = fe->get_dphi();\n \n  const std::vector<Point>& qpoint = fe->get_xyz();\n\n  \/\/ The number of local degrees of freedom in each variable\n  const unsigned int n_u_dofs = c.dof_indices_var[u_var].size();\n\n  DenseSubMatrix<Number> &Kuu = *c.elem_subjacobians[u_var][u_var];\n\n  DenseSubVector<Number> &Fu = *c.elem_subresiduals[u_var];\n      \n  \/\/ Now we will build the element Jacobian and residual.\n  \/\/ Constructing the residual requires the solution and its\n  \/\/ gradient from the previous timestep.  This must be\n  \/\/ calculated at each quadrature point by summing the\n  \/\/ solution degree-of-freedom values by the appropriate\n  \/\/ weight functions.\n  const unsigned int n_qpoints = (c.get_element_qrule())->n_points();\n\n  for (unsigned int qp=0; qp != n_qpoints; qp++)\n    {\n      Tensor grad_u;\n      \n      c.interior_gradient<RealGradient>( u_var, qp, grad_u );\n\n\n      \/\/ Value of the forcing function at this quadrature point\n      RealGradient f = this->forcing(qpoint[qp]);\n\n      \/\/ First, an i-loop over the velocity degrees of freedom.\n      \/\/ We know that n_u_dofs == n_v_dofs so we can compute contributions\n      \/\/ for both at the same time.\n      for (unsigned int i=0; i != n_u_dofs; i++)\n        {\n          Fu(i) += ( grad_u.contract(grad_phi[i][qp]) - f*phi[i][qp] )*JxW[qp];\n\n          if (request_jacobian)\n            {\n              \/\/ Matrix contributions for the uu and vv couplings.\n              for (unsigned int j=0; j != n_u_dofs; j++)\n                {\n                  Kuu(i,j) += grad_phi[j][qp].contract(grad_phi[i][qp])*JxW[qp];\n                 \n\t\t}\n\t    }\n        }\n    } \/\/ end of the quadrature point qp-loop\n  \n  return request_jacobian;\n}\n\n\/*\nbool LaplaceSystem::side_constraint (bool request_jacobian,\n\t\t\t\t     DiffContext &context)\n{\n  FEMContext &c = libmesh_cast_ref<FEMContext&>(context);\n\n  \/\/ Get finite element object\n  FEGenericBase<RealGradient>* side_fe = NULL;\n  c.get_side_fe<RealGradient>( u_var, side_fe );\n  \n  \/\/ First we get some references to cell-specific data that\n  \/\/ will be used to assemble the linear system.\n\n  \/\/ Element Jacobian * quadrature weights for interior integration\n  const std::vector<Real> &JxW = side_fe->get_JxW();\n\n  \/\/ The velocity shape functions at interior quadrature points.\n  const std::vector<std::vector<RealGradient> >& phi = side_fe->get_phi();\n\n  \/\/ The number of local degrees of freedom in each variable\n  const unsigned int n_u_dofs = c.dof_indices_var[u_var].size();\n\n  const std::vector<Point>& qpoint = side_fe->get_xyz();\n\n  \/\/ The penalty value.  \\frac{1}{\\epsilon}\n  \/\/ in the discussion above.\n  const Real penalty = 1.e10;\n\n  DenseSubMatrix<Number> &Kuu = *c.elem_subjacobians[u_var][u_var];\n  DenseSubVector<Number> &Fu = *c.elem_subresiduals[u_var];\n\n  const unsigned int n_qpoints = (c.get_side_qrule())->n_points();\n\n  for (unsigned int qp=0; qp != n_qpoints; qp++)\n    {\n      RealGradient u;\n      c.side_value<RealGradient>( u_var, qp, u );\n \n      RealGradient u_exact( this->exact_solution( 0, qpoint[qp](0), qpoint[qp](1) ),\n\t\t\t    this->exact_solution( 1, qpoint[qp](0), qpoint[qp](1) ));\n\n      for (unsigned int i=0; i != n_u_dofs; i++)\n\t{\n\t  Fu(i) += penalty*(u - u_exact)*phi[i][qp]*JxW[qp];\n\t  \n\t  if (request_jacobian)\n\t    {\n\t      for (unsigned int j=0; j != n_u_dofs; j++)\n\t\tKuu(i,j) += penalty*phi[j][qp]*phi[i][qp]*JxW[qp];\n\t    }\n\t}\n    }\n\n  return request_jacobian;\n}\n*\/\n\nRealGradient LaplaceSystem::forcing( const Point& p )\n{\n  Real x = p(0); Real y = p(1); Real z = p(2);\n  \n  const Real eps = 1.e-3;\n\n  const Real fx = -(exact_solution(0,x,y,z-eps) +\n\t\t    exact_solution(0,x,y,z+eps) +\n\t\t    exact_solution(0,x,y-eps,z) +\n\t\t    exact_solution(0,x,y+eps,z) +\n\t\t    exact_solution(0,x-eps,y,z) +\n\t\t    exact_solution(0,x+eps,y,z) -\n\t\t    6.*exact_solution(0,x,y,z))\/eps\/eps;\n  \n  const Real fy = -(exact_solution(1,x,y,z-eps) +\n\t\t    exact_solution(1,x,y,z+eps) +\n\t\t    exact_solution(1,x,y-eps,z) +\n\t\t    exact_solution(1,x,y+eps,z) +\n\t\t    exact_solution(1,x-eps,y,z) +\n\t\t    exact_solution(1,x+eps,y,z) -\n\t\t    6.*exact_solution(1,x,y,z))\/eps\/eps;\n\n  const Real fz = -(exact_solution(2,x,y,z-eps) +\n\t\t    exact_solution(2,x,y,z+eps) +\n\t\t    exact_solution(2,x,y-eps,z) +\n\t\t    exact_solution(2,x,y+eps,z) +\n\t\t    exact_solution(2,x-eps,y,z) +\n\t\t    exact_solution(2,x+eps,y,z) -\n\t\t    6.*exact_solution(2,x,y,z))\/eps\/eps;\n  \n  return RealGradient( fx, fy, fz );\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 net.cpp\n * @author Alex Leverington <nessence@gmail.com>\n * @date 2014\n *\/\n\n#include <boost\/test\/unit_test.hpp>\n\n#include <libdevcore\/Worker.h>\n#include <libdevcore\/Assertions.h>\n#include <libdevcrypto\/Common.h>\n#include <libp2p\/UDP.h>\n#include <libp2p\/NodeTable.h>\nusing namespace std;\nusing namespace dev;\nusing namespace dev::p2p;\nnamespace ba = boost::asio;\nnamespace bi = ba::ip;\n\nstruct NetFixture\n{\n\tNetFixture() { dev::p2p::NodeIPEndpoint::test_allowLocal = true;; }\n\t~NetFixture() { dev::p2p::NodeIPEndpoint::test_allowLocal = false; }\n};\n\nBOOST_FIXTURE_TEST_SUITE(net, NetFixture)\n\n\/**\n * Only used for testing. Not useful beyond tests.\n *\/\nclass TestHost: public Worker\n{\npublic:\n\tTestHost(): Worker(\"test\",0), m_io() {};\n\tvirtual ~TestHost() { m_io.stop(); stopWorking(); }\n\tvoid start() { startWorking(); }\n\tvoid doWork() { m_io.run(); }\n\tvoid doneWorking() { m_io.reset(); m_io.poll(); m_io.reset(); }\n\nprotected:\n\tba::io_service m_io;\n};\n\nstruct TestNodeTable: public NodeTable\n{\n\t\/\/\/ Constructor\n\tTestNodeTable(ba::io_service& _io, KeyPair _alias, bi::address const& _addr, uint16_t _port = 30300): NodeTable(_io, _alias, NodeIPEndpoint(_addr, _port, _port)) {}\n\n\tstatic std::vector<std::pair<KeyPair,unsigned>> createTestNodes(unsigned _count)\n\t{\n\t\tstd::vector<std::pair<KeyPair,unsigned>> ret;\n\t\tasserts(_count < 1000);\n\t\tstatic uint16_t s_basePort = 30500;\n\n\t\tret.clear();\n\t\tfor (unsigned i = 0; i < _count; i++)\n\t\t{\n\t\t\tKeyPair k = KeyPair::create();\n\t\t\tret.push_back(make_pair(k,s_basePort+i));\n\t\t}\n\n\t\treturn std::move(ret);\n\t}\n\n\tvoid pingTestNodes(std::vector<std::pair<KeyPair,unsigned>> const& _testNodes)\n\t{\n\t\tbi::address ourIp = bi::address::from_string(\"127.0.0.1\");\n\t\tfor (auto& n: _testNodes)\n\t\t{\n\t\t\tping(bi::udp::endpoint(ourIp, n.second));\n\t\t\tthis_thread::sleep_for(chrono::milliseconds(2));\n\t\t}\n\t}\n\n\tvoid populateTestNodes(std::vector<std::pair<KeyPair,unsigned>> const& _testNodes, size_t _count = 0)\n\t{\n\t\tif (!_count)\n\t\t\t_count = _testNodes.size();\n\n\t\tbi::address ourIp = bi::address::from_string(\"127.0.0.1\");\n\t\tfor (auto& n: _testNodes)\n\t\t\tif (_count--)\n\t\t\t{\n\t\t\t\t\/\/ manually add node for test\n\t\t\t\t{\n\t\t\t\t\tGuard ln(x_nodes);\n\t\t\t\t\tshared_ptr<NodeEntry> node(new NodeEntry(m_node, n.first.pub(), NodeIPEndpoint(ourIp, n.second, n.second)));\n\t\t\t\t\tnode->pending = false;\n\t\t\t\t\tm_nodes[node->id] = node;\n\t\t\t\t}\n\t\t\t\tnoteActiveNode(n.first.pub(), bi::udp::endpoint(ourIp, n.second));\n\t\t\t}\n\t\t\telse\n\t\t\t\tbreak;\n\t}\n\n\tvoid reset()\n\t{\n\t\tGuard l(x_state);\n\t\tfor (auto& n: m_state) n.nodes.clear();\n\t}\n};\n\n\/**\n * Only used for testing. Not useful beyond tests.\n *\/\nstruct TestNodeTableHost: public TestHost\n{\n\tTestNodeTableHost(unsigned _count = 8): m_alias(KeyPair::create()), nodeTable(new TestNodeTable(m_io, m_alias, bi::address::from_string(\"127.0.0.1\"))), testNodes(TestNodeTable::createTestNodes(_count)) {};\n\t~TestNodeTableHost() { m_io.stop(); stopWorking(); }\n\n\tvoid setup() { for (auto n: testNodes) nodeTables.push_back(make_shared<TestNodeTable>(m_io,n.first, bi::address::from_string(\"127.0.0.1\"),n.second)); }\n\n\tvoid pingAll() { for (auto& t: nodeTables) t->pingTestNodes(testNodes); }\n\n\tvoid populateAll(size_t _count = 0) { for (auto& t: nodeTables) t->populateTestNodes(testNodes, _count); }\n\n\tvoid populate(size_t _count = 0) { nodeTable->populateTestNodes(testNodes, _count); }\n\n\tKeyPair m_alias;\n\tshared_ptr<TestNodeTable> nodeTable;\n\tstd::vector<std::pair<KeyPair,unsigned>> testNodes; \/\/ keypair and port\n\tstd::vector<shared_ptr<TestNodeTable>> nodeTables;\n};\n\nclass TestUDPSocket: UDPSocketEvents, public TestHost\n{\npublic:\n\tTestUDPSocket(): m_socket(new UDPSocket<TestUDPSocket, 1024>(m_io, *this, 30300)) {}\n\n\tvoid onDisconnected(UDPSocketFace*) {};\n\tvoid onReceived(UDPSocketFace*, bi::udp::endpoint const&, bytesConstRef _packet) { if (_packet.toString() == \"AAAA\") success = true; }\n\n\tshared_ptr<UDPSocket<TestUDPSocket, 1024>> m_socket;\n\n\tbool success = false;\n};\n\nBOOST_AUTO_TEST_CASE(requestTimeout)\n{\n\tusing TimePoint = std::chrono::steady_clock::time_point;\n\tusing RequestTimeout = std::pair<NodeId, TimePoint>;\n\t\n\tstd::chrono::milliseconds timeout(300);\n\tstd::list<RequestTimeout> timeouts;\n\t\n\tNodeId nodeA(sha3(\"a\"));\n\tNodeId nodeB(sha3(\"b\"));\n\ttimeouts.push_back(make_pair(nodeA, chrono::steady_clock::now()));\n\tthis_thread::sleep_for(std::chrono::milliseconds(100));\n\ttimeouts.push_back(make_pair(nodeB, chrono::steady_clock::now()));\n\tthis_thread::sleep_for(std::chrono::milliseconds(210));\n\t\n\tbool nodeAtriggered = false;\n\tbool nodeBtriggered = false;\n\ttimeouts.remove_if([&](RequestTimeout const& t)\n\t{\n\t\tauto now = chrono::steady_clock::now();\n\t\tauto diff = now - t.second;\n\t\tif (t.first == nodeA && diff < timeout)\n\t\t\tnodeAtriggered = true;\n\t\tif (t.first == nodeB && diff < timeout)\n\t\t\tnodeBtriggered = true;\n\t\treturn (t.first == nodeA || t.first == nodeB);\n\t});\n\t\n\tBOOST_REQUIRE(nodeAtriggered == false);\n\tBOOST_REQUIRE(nodeBtriggered == true);\n\tBOOST_REQUIRE(timeouts.size() == 0);\n}\n\nBOOST_AUTO_TEST_CASE(isIPAddressType)\n{\n\tstring wildcard = \"0.0.0.0\";\n\tBOOST_REQUIRE(bi::address::from_string(wildcard).is_unspecified());\n\t\n\tstring empty = \"\";\n\tBOOST_REQUIRE_THROW(bi::address::from_string(empty).is_unspecified(), std::exception);\n\n\tstring publicAddress192 = \"192.169.0.0\";\n\tBOOST_REQUIRE(isPublicAddress(publicAddress192));\n\tBOOST_REQUIRE(!isPrivateAddress(publicAddress192));\n\tBOOST_REQUIRE(!isLocalHostAddress(publicAddress192));\n\t\n\tstring publicAddress172 = \"172.32.0.0\";\n\tBOOST_REQUIRE(isPublicAddress(publicAddress172));\n\tBOOST_REQUIRE(!isPrivateAddress(publicAddress172));\n\tBOOST_REQUIRE(!isLocalHostAddress(publicAddress172));\n\t\n\tstring privateAddress192 = \"192.168.1.0\";\n\tBOOST_REQUIRE(isPrivateAddress(privateAddress192));\n\tBOOST_REQUIRE(!isPublicAddress(privateAddress192));\n\tBOOST_REQUIRE(!isLocalHostAddress(privateAddress192));\n\t\n\tstring privateAddress172 = \"172.16.0.0\";\n\tBOOST_REQUIRE(isPrivateAddress(privateAddress172));\n\tBOOST_REQUIRE(!isPublicAddress(privateAddress172));\n\tBOOST_REQUIRE(!isLocalHostAddress(privateAddress172));\n\t\n\tstring privateAddress10 = \"10.0.0.0\";\n\tBOOST_REQUIRE(isPrivateAddress(privateAddress10));\n\tBOOST_REQUIRE(!isPublicAddress(privateAddress10));\n\tBOOST_REQUIRE(!isLocalHostAddress(privateAddress10));\n}\n\nBOOST_AUTO_TEST_CASE(v2PingNodePacket)\n{\n\t\/\/ test old versino of pingNode packet w\/new\n\tRLPStream s;\n\ts.appendList(3); s << \"1.1.1.1\" << 30303 << std::chrono::duration_cast<std::chrono::seconds>((std::chrono::system_clock::now() + chrono::seconds(60)).time_since_epoch()).count();\n\n\tPingNode p((bi::udp::endpoint()));\n\tBOOST_REQUIRE_NO_THROW(p = PingNode::fromBytesConstRef(bi::udp::endpoint(), bytesConstRef(&s.out())));\n\tBOOST_REQUIRE(p.version == 2);\n}\n\nBOOST_AUTO_TEST_CASE(neighboursPacketLength)\n{\n\tKeyPair k = KeyPair::create();\n\tstd::vector<std::pair<KeyPair,unsigned>> testNodes(TestNodeTable::createTestNodes(16));\n\tbi::udp::endpoint to(boost::asio::ip::address::from_string(\"127.0.0.1\"), 30000);\n\t\n\t\/\/ hash(32), signature(65), overhead: packet(2), type(1), nodeList(2), ts(9),\n\tstatic unsigned const nlimit = (1280 - 111) \/ 87;\n\tfor (unsigned offset = 0; offset < testNodes.size(); offset += nlimit)\n\t{\n\t\tNeighbours out(to);\n\t\t\n\t\tauto limit = nlimit ? std::min(testNodes.size(), (size_t)(offset + nlimit)) : testNodes.size();\n\t\tfor (auto i = offset; i < limit; i++)\n\t\t{\n\t\t\tNeighbours::Node node;\n\t\t\tnode.ipAddress = boost::asio::ip::address::from_string(\"200.200.200.200\").to_string();\n\t\t\tnode.port = testNodes[i].second;\n\t\t\tnode.node = testNodes[i].first.pub();\n\t\t\tout.nodes.push_back(node);\n\t\t}\n\t\t\n\t\tout.sign(k.sec());\n\t\tBOOST_REQUIRE_LE(out.data.size(), 1280);\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(test_neighbours_packet)\n{\n\tKeyPair k = KeyPair::create();\n\tstd::vector<std::pair<KeyPair,unsigned>> testNodes(TestNodeTable::createTestNodes(16));\n\tbi::udp::endpoint to(boost::asio::ip::address::from_string(\"127.0.0.1\"), 30000);\n\n\tNeighbours out(to);\n\tfor (auto n: testNodes)\n\t{\n\t\tNeighbours::Node node;\n\t\tnode.ipAddress = boost::asio::ip::address::from_string(\"127.0.0.1\").to_string();\n\t\tnode.udpPort = n.second;\n\t\tnode.node = n.first.pub();\n\t\tout.nodes.push_back(node);\n\t}\n\tout.sign(k.sec());\n\n\tbytesConstRef packet(out.data.data(), out.data.size());\n\tbytesConstRef rlpBytes(packet.cropped(h256::size + Signature::size + 1));\n\tNeighbours in = Neighbours::fromBytesConstRef(to, rlpBytes);\n\tint count = 0;\n\tfor (auto n: in.nodes)\n\t{\n\t\tBOOST_REQUIRE_EQUAL(testNodes[count].second, n.udpPort);\n\t\tBOOST_REQUIRE_EQUAL(testNodes[count].first.pub(), n.node);\n\t\tBOOST_REQUIRE_EQUAL(sha3(testNodes[count].first.pub()), sha3(n.node));\n\t\tcount++;\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(test_findnode_neighbours)\n{\n\t\/\/ Executing findNode should result in a list which is serialized\n\t\/\/ into Neighbours packet. Neighbours packet should then be deserialized\n\t\/\/ into the same list of nearest nodes.\n}\n\nBOOST_AUTO_TEST_CASE(test_windows_template)\n{\n\tbi::udp::endpoint ep;\n\tPingNode p(ep);\n}\n\nBOOST_AUTO_TEST_CASE(kademlia)\n{\n\t\/\/ Not yet a 'real' test.\n\tTestNodeTableHost node(8);\n\tnode.start();\n\tnode.nodeTable->discover(); \/\/ ideally, joining with empty node table logs warning we can check for\n\tnode.setup();\n\tnode.populate();\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tnode.populateAll();\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tauto nodes = node.nodeTable->nodes();\n\tnodes.sort();\n\n\tnode.nodeTable->reset();\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tnode.populate(1);\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tnode.nodeTable->discover();\n\tthis_thread::sleep_for(chrono::milliseconds(2000));\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tBOOST_REQUIRE_EQUAL(node.nodeTable->count(), 8);\n\n\tauto netNodes = node.nodeTable->nodes();\n\tnetNodes.sort();\n\n}\n\nBOOST_AUTO_TEST_CASE(test_udp_once)\n{\n\tUDPDatagram d(bi::udp::endpoint(boost::asio::ip::address::from_string(\"127.0.0.1\"), 30300), bytes({65,65,65,65}));\n\tTestUDPSocket a; a.m_socket->connect(); a.start();\n\ta.m_socket->send(d);\n\tthis_thread::sleep_for(chrono::seconds(1));\n\tBOOST_REQUIRE_EQUAL(true, a.success);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n<commit_msg>update test<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 net.cpp\n * @author Alex Leverington <nessence@gmail.com>\n * @date 2014\n *\/\n\n#include <boost\/test\/unit_test.hpp>\n\n#include <libdevcore\/Worker.h>\n#include <libdevcore\/Assertions.h>\n#include <libdevcrypto\/Common.h>\n#include <libp2p\/UDP.h>\n#include <libp2p\/NodeTable.h>\nusing namespace std;\nusing namespace dev;\nusing namespace dev::p2p;\nnamespace ba = boost::asio;\nnamespace bi = ba::ip;\n\nstruct NetFixture\n{\n\tNetFixture() { dev::p2p::NodeIPEndpoint::test_allowLocal = true;; }\n\t~NetFixture() { dev::p2p::NodeIPEndpoint::test_allowLocal = false; }\n};\n\nBOOST_FIXTURE_TEST_SUITE(net, NetFixture)\n\n\/**\n * Only used for testing. Not useful beyond tests.\n *\/\nclass TestHost: public Worker\n{\npublic:\n\tTestHost(): Worker(\"test\",0), m_io() {};\n\tvirtual ~TestHost() { m_io.stop(); stopWorking(); }\n\tvoid start() { startWorking(); }\n\tvoid doWork() { m_io.run(); }\n\tvoid doneWorking() { m_io.reset(); m_io.poll(); m_io.reset(); }\n\nprotected:\n\tba::io_service m_io;\n};\n\nstruct TestNodeTable: public NodeTable\n{\n\t\/\/\/ Constructor\n\tTestNodeTable(ba::io_service& _io, KeyPair _alias, bi::address const& _addr, uint16_t _port = 30300): NodeTable(_io, _alias, NodeIPEndpoint(_addr, _port, _port)) {}\n\n\tstatic std::vector<std::pair<KeyPair,unsigned>> createTestNodes(unsigned _count)\n\t{\n\t\tstd::vector<std::pair<KeyPair,unsigned>> ret;\n\t\tasserts(_count < 1000);\n\t\tstatic uint16_t s_basePort = 30500;\n\n\t\tret.clear();\n\t\tfor (unsigned i = 0; i < _count; i++)\n\t\t{\n\t\t\tKeyPair k = KeyPair::create();\n\t\t\tret.push_back(make_pair(k,s_basePort+i));\n\t\t}\n\n\t\treturn std::move(ret);\n\t}\n\n\tvoid pingTestNodes(std::vector<std::pair<KeyPair,unsigned>> const& _testNodes)\n\t{\n\t\tbi::address ourIp = bi::address::from_string(\"127.0.0.1\");\n\t\tfor (auto& n: _testNodes)\n\t\t{\n\t\t\tping(bi::udp::endpoint(ourIp, n.second));\n\t\t\tthis_thread::sleep_for(chrono::milliseconds(2));\n\t\t}\n\t}\n\n\tvoid populateTestNodes(std::vector<std::pair<KeyPair,unsigned>> const& _testNodes, size_t _count = 0)\n\t{\n\t\tif (!_count)\n\t\t\t_count = _testNodes.size();\n\n\t\tbi::address ourIp = bi::address::from_string(\"127.0.0.1\");\n\t\tfor (auto& n: _testNodes)\n\t\t\tif (_count--)\n\t\t\t{\n\t\t\t\t\/\/ manually add node for test\n\t\t\t\t{\n\t\t\t\t\tGuard ln(x_nodes);\n\t\t\t\t\tshared_ptr<NodeEntry> node(new NodeEntry(m_node, n.first.pub(), NodeIPEndpoint(ourIp, n.second, n.second)));\n\t\t\t\t\tnode->pending = false;\n\t\t\t\t\tm_nodes[node->id] = node;\n\t\t\t\t}\n\t\t\t\tnoteActiveNode(n.first.pub(), bi::udp::endpoint(ourIp, n.second));\n\t\t\t}\n\t\t\telse\n\t\t\t\tbreak;\n\t}\n\n\tvoid reset()\n\t{\n\t\tGuard l(x_state);\n\t\tfor (auto& n: m_state) n.nodes.clear();\n\t}\n};\n\n\/**\n * Only used for testing. Not useful beyond tests.\n *\/\nstruct TestNodeTableHost: public TestHost\n{\n\tTestNodeTableHost(unsigned _count = 8): m_alias(KeyPair::create()), nodeTable(new TestNodeTable(m_io, m_alias, bi::address::from_string(\"127.0.0.1\"))), testNodes(TestNodeTable::createTestNodes(_count)) {};\n\t~TestNodeTableHost() { m_io.stop(); stopWorking(); }\n\n\tvoid setup() { for (auto n: testNodes) nodeTables.push_back(make_shared<TestNodeTable>(m_io,n.first, bi::address::from_string(\"127.0.0.1\"),n.second)); }\n\n\tvoid pingAll() { for (auto& t: nodeTables) t->pingTestNodes(testNodes); }\n\n\tvoid populateAll(size_t _count = 0) { for (auto& t: nodeTables) t->populateTestNodes(testNodes, _count); }\n\n\tvoid populate(size_t _count = 0) { nodeTable->populateTestNodes(testNodes, _count); }\n\n\tKeyPair m_alias;\n\tshared_ptr<TestNodeTable> nodeTable;\n\tstd::vector<std::pair<KeyPair,unsigned>> testNodes; \/\/ keypair and port\n\tstd::vector<shared_ptr<TestNodeTable>> nodeTables;\n};\n\nclass TestUDPSocket: UDPSocketEvents, public TestHost\n{\npublic:\n\tTestUDPSocket(): m_socket(new UDPSocket<TestUDPSocket, 1024>(m_io, *this, 30300)) {}\n\n\tvoid onDisconnected(UDPSocketFace*) {};\n\tvoid onReceived(UDPSocketFace*, bi::udp::endpoint const&, bytesConstRef _packet) { if (_packet.toString() == \"AAAA\") success = true; }\n\n\tshared_ptr<UDPSocket<TestUDPSocket, 1024>> m_socket;\n\n\tbool success = false;\n};\n\nBOOST_AUTO_TEST_CASE(requestTimeout)\n{\n\tusing TimePoint = std::chrono::steady_clock::time_point;\n\tusing RequestTimeout = std::pair<NodeId, TimePoint>;\n\t\n\tstd::chrono::milliseconds timeout(300);\n\tstd::list<RequestTimeout> timeouts;\n\t\n\tNodeId nodeA(sha3(\"a\"));\n\tNodeId nodeB(sha3(\"b\"));\n\ttimeouts.push_back(make_pair(nodeA, chrono::steady_clock::now()));\n\tthis_thread::sleep_for(std::chrono::milliseconds(100));\n\ttimeouts.push_back(make_pair(nodeB, chrono::steady_clock::now()));\n\tthis_thread::sleep_for(std::chrono::milliseconds(210));\n\t\n\tbool nodeAtriggered = false;\n\tbool nodeBtriggered = false;\n\ttimeouts.remove_if([&](RequestTimeout const& t)\n\t{\n\t\tauto now = chrono::steady_clock::now();\n\t\tauto diff = now - t.second;\n\t\tif (t.first == nodeA && diff < timeout)\n\t\t\tnodeAtriggered = true;\n\t\tif (t.first == nodeB && diff < timeout)\n\t\t\tnodeBtriggered = true;\n\t\treturn (t.first == nodeA || t.first == nodeB);\n\t});\n\t\n\tBOOST_REQUIRE(nodeAtriggered == false);\n\tBOOST_REQUIRE(nodeBtriggered == true);\n\tBOOST_REQUIRE(timeouts.size() == 0);\n}\n\nBOOST_AUTO_TEST_CASE(isIPAddressType)\n{\n\tstring wildcard = \"0.0.0.0\";\n\tBOOST_REQUIRE(bi::address::from_string(wildcard).is_unspecified());\n\t\n\tstring empty = \"\";\n\tBOOST_REQUIRE_THROW(bi::address::from_string(empty).is_unspecified(), std::exception);\n\n\tstring publicAddress192 = \"192.169.0.0\";\n\tBOOST_REQUIRE(isPublicAddress(publicAddress192));\n\tBOOST_REQUIRE(!isPrivateAddress(publicAddress192));\n\tBOOST_REQUIRE(!isLocalHostAddress(publicAddress192));\n\t\n\tstring publicAddress172 = \"172.32.0.0\";\n\tBOOST_REQUIRE(isPublicAddress(publicAddress172));\n\tBOOST_REQUIRE(!isPrivateAddress(publicAddress172));\n\tBOOST_REQUIRE(!isLocalHostAddress(publicAddress172));\n\t\n\tstring privateAddress192 = \"192.168.1.0\";\n\tBOOST_REQUIRE(isPrivateAddress(privateAddress192));\n\tBOOST_REQUIRE(!isPublicAddress(privateAddress192));\n\tBOOST_REQUIRE(!isLocalHostAddress(privateAddress192));\n\t\n\tstring privateAddress172 = \"172.16.0.0\";\n\tBOOST_REQUIRE(isPrivateAddress(privateAddress172));\n\tBOOST_REQUIRE(!isPublicAddress(privateAddress172));\n\tBOOST_REQUIRE(!isLocalHostAddress(privateAddress172));\n\t\n\tstring privateAddress10 = \"10.0.0.0\";\n\tBOOST_REQUIRE(isPrivateAddress(privateAddress10));\n\tBOOST_REQUIRE(!isPublicAddress(privateAddress10));\n\tBOOST_REQUIRE(!isLocalHostAddress(privateAddress10));\n}\n\nBOOST_AUTO_TEST_CASE(v2PingNodePacket)\n{\n\t\/\/ test old versino of pingNode packet w\/new\n\tRLPStream s;\n\ts.appendList(3); s << \"1.1.1.1\" << 30303 << std::chrono::duration_cast<std::chrono::seconds>((std::chrono::system_clock::now() + chrono::seconds(60)).time_since_epoch()).count();\n\n\tPingNode p((bi::udp::endpoint()));\n\tBOOST_REQUIRE_NO_THROW(p = PingNode::fromBytesConstRef(bi::udp::endpoint(), bytesConstRef(&s.out())));\n\tBOOST_REQUIRE(p.version == 2);\n}\n\nBOOST_AUTO_TEST_CASE(neighboursPacketLength)\n{\n\tKeyPair k = KeyPair::create();\n\tstd::vector<std::pair<KeyPair,unsigned>> testNodes(TestNodeTable::createTestNodes(16));\n\tbi::udp::endpoint to(boost::asio::ip::address::from_string(\"127.0.0.1\"), 30000);\n\t\n\t\/\/ hash(32), signature(65), overhead: packet(2), type(1), nodeList(2), ts(9),\n\tstatic unsigned const nlimit = (1280 - 111) \/ 87;\n\tfor (unsigned offset = 0; offset < testNodes.size(); offset += nlimit)\n\t{\n\t\tNeighbours out(to);\n\t\t\n\t\tauto limit = nlimit ? std::min(testNodes.size(), (size_t)(offset + nlimit)) : testNodes.size();\n\t\tfor (auto i = offset; i < limit; i++)\n\t\t{\n\t\t\tNeighbours::Node node;\n\t\t\tnode.ipAddress = boost::asio::ip::address::from_string(\"200.200.200.200\").to_string();\n\t\t\tnode.udpPort = testNodes[i].second;\n\t\t\tnode.node = testNodes[i].first.pub();\n\t\t\tout.nodes.push_back(node);\n\t\t}\n\t\t\n\t\tout.sign(k.sec());\n\t\tBOOST_REQUIRE_LE(out.data.size(), 1280);\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(test_neighbours_packet)\n{\n\tKeyPair k = KeyPair::create();\n\tstd::vector<std::pair<KeyPair,unsigned>> testNodes(TestNodeTable::createTestNodes(16));\n\tbi::udp::endpoint to(boost::asio::ip::address::from_string(\"127.0.0.1\"), 30000);\n\n\tNeighbours out(to);\n\tfor (auto n: testNodes)\n\t{\n\t\tNeighbours::Node node;\n\t\tnode.ipAddress = boost::asio::ip::address::from_string(\"127.0.0.1\").to_string();\n\t\tnode.udpPort = n.second;\n\t\tnode.node = n.first.pub();\n\t\tout.nodes.push_back(node);\n\t}\n\tout.sign(k.sec());\n\n\tbytesConstRef packet(out.data.data(), out.data.size());\n\tbytesConstRef rlpBytes(packet.cropped(h256::size + Signature::size + 1));\n\tNeighbours in = Neighbours::fromBytesConstRef(to, rlpBytes);\n\tint count = 0;\n\tfor (auto n: in.nodes)\n\t{\n\t\tBOOST_REQUIRE_EQUAL(testNodes[count].second, n.udpPort);\n\t\tBOOST_REQUIRE_EQUAL(testNodes[count].first.pub(), n.node);\n\t\tBOOST_REQUIRE_EQUAL(sha3(testNodes[count].first.pub()), sha3(n.node));\n\t\tcount++;\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(test_findnode_neighbours)\n{\n\t\/\/ Executing findNode should result in a list which is serialized\n\t\/\/ into Neighbours packet. Neighbours packet should then be deserialized\n\t\/\/ into the same list of nearest nodes.\n}\n\nBOOST_AUTO_TEST_CASE(test_windows_template)\n{\n\tbi::udp::endpoint ep;\n\tPingNode p(ep);\n}\n\nBOOST_AUTO_TEST_CASE(kademlia)\n{\n\t\/\/ Not yet a 'real' test.\n\tTestNodeTableHost node(8);\n\tnode.start();\n\tnode.nodeTable->discover(); \/\/ ideally, joining with empty node table logs warning we can check for\n\tnode.setup();\n\tnode.populate();\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tnode.populateAll();\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tauto nodes = node.nodeTable->nodes();\n\tnodes.sort();\n\n\tnode.nodeTable->reset();\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tnode.populate(1);\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tnode.nodeTable->discover();\n\tthis_thread::sleep_for(chrono::milliseconds(2000));\n\tclog << \"NodeTable:\\n\" << *node.nodeTable.get() << endl;\n\n\tBOOST_REQUIRE_EQUAL(node.nodeTable->count(), 8);\n\n\tauto netNodes = node.nodeTable->nodes();\n\tnetNodes.sort();\n\n}\n\nBOOST_AUTO_TEST_CASE(test_udp_once)\n{\n\tUDPDatagram d(bi::udp::endpoint(boost::asio::ip::address::from_string(\"127.0.0.1\"), 30300), bytes({65,65,65,65}));\n\tTestUDPSocket a; a.m_socket->connect(); a.start();\n\ta.m_socket->send(d);\n\tthis_thread::sleep_for(chrono::seconds(1));\n\tBOOST_REQUIRE_EQUAL(true, a.success);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <limits>\n\n#include \"src\/parser.h\"\n\nint main()\n{\n\tstd::string inputTerm;\n\t\n\tstd::cin >> inputTerm;\n\t\n\ttry {\n\t\ttypedef std::numeric_limits<double> dbl;\n\t\tstd::cout.precision(dbl::digits10);\n\n\t\tstd::cout << SimpleParser::calculate(inputTerm) << std::endl;\n\t}\n\tcatch ( std::exception &e )\n\t{\n\t\tstd::cerr << e.what() << std::endl;\n\t\treturn 1;\n\t}\n\n\treturn 0;\n}\n<commit_msg>Added simple input loop to clc<commit_after>#include <iostream>\n#include <limits>\n\n#include \"src\/parser.h\"\n\ntypedef std::numeric_limits<double> dbl;\n\nint main() {\n\tstd::string inputTerm;\n\tstd::cout.precision(dbl::digits10);\n\t\n\twhile ( std::cin >> inputTerm ) {\n\t\ttry {\n\t\t\tstd::cout << SimpleParser::calculate(inputTerm) << std::endl;\n\t\t}\n\t\tcatch ( std::exception &e ) {\n\t\t\tstd::cerr << e.what() << std::endl;\n\t\t}\n\t}\n\n\treturn 0;\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#define __STDC_LIMIT_MACROS\n\n\/\/ POSIX\n#include <errno.h>\n\n\/\/ STL\n#include <string>\n#include <tr1\/memory>\n#include <vector>\n\n\/\/ po6\n#include <po6\/net\/ipaddr.h>\n#include <po6\/threads\/barrier.h>\n#include <po6\/threads\/thread.h>\n\n\/\/ e\n#include <e\/convert.h>\n#include <e\/locking_fifo.h>\n#include <e\/timer.h>\n\n\/\/ HyperDex\n#include <hyperclient\/client.h>\n#include <hyperclient\/returncode.h>\n\nstatic e::locking_fifo<std::string> lines;\nstatic po6::threads::mutex unblock_lock;\nstatic po6::threads::cond unblock(&unblock_lock);\nstatic po6::net::ipaddr ip;\nstatic uint16_t port;\nstatic std::string space;\nstatic uint16_t num_threads;\n\nstatic int\nusage();\n\nstatic void\nworker(po6::threads::barrier*);\n\nint\nmain(int argc, char* argv[])\n{\n    if (argc != 5)\n    {\n        return usage();\n    }\n\n    space = argv[3];\n\n    try\n    {\n        ip = argv[1];\n    }\n    catch (std::invalid_argument& e)\n    {\n        std::cerr << \"The IP address must be an IPv4 or IPv6 address.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n\n    try\n    {\n        port = e::convert::to_uint16_t(argv[2]);\n    }\n    catch (std::domain_error& e)\n    {\n        std::cerr << \"The port number must be an integer.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n    catch (std::out_of_range& e)\n    {\n        std::cerr << \"The port number must be suitably small.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n\n    try\n    {\n        num_threads = e::convert::to_uint16_t(argv[4]);\n    }\n    catch (std::domain_error& e)\n    {\n        std::cerr << \"The number of threads must be an integer.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n    catch (std::out_of_range& e)\n    {\n        std::cerr << \"The number of threads must be suitably small.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n\n    po6::threads::barrier bar(num_threads + 1);\n\n    try\n    {\n        std::vector<std::tr1::shared_ptr<po6::threads::thread> > threads;\n\n        for (size_t i = 0; i < num_threads; ++i)\n        {\n            std::tr1::shared_ptr<po6::threads::thread> t(new po6::threads::thread(std::tr1::bind(worker, &bar)));\n            t->start();\n            threads.push_back(t);\n        }\n\n        e::stopwatch stopwatch;\n        bar.wait();\n        stopwatch.start();\n        std::string line;\n        size_t i = 0;\n\n        while (std::getline(std::cin, line))\n        {\n            lines.push(line);\n\n            if (lines.size() > 10000)\n            {\n                e::sleep_ms(0, 1);\n            }\n\n            ++i;\n        }\n\n        lines.shutdown();\n        bar.wait();\n\n        uint64_t nanosecs = stopwatch.peek();\n        std::cerr << \"test took \" << nanosecs << \" nanoseconds.\" << std::endl;\n\n        for (std::vector<std::tr1::shared_ptr<po6::threads::thread> >::iterator t = threads.begin();\n                t != threads.end(); ++t)\n        {\n            (*t)->join();\n        }\n    }\n    catch (po6::error& e)\n    {\n        std::cerr << \"There was a system error:  \" << e.what();\n        return EXIT_FAILURE;\n    }\n    catch (std::runtime_error& e)\n    {\n        std::cerr << \"There was a runtime error:  \" << e.what();\n        return EXIT_FAILURE;\n    }\n    catch (std::bad_alloc& e)\n    {\n        std::cerr << \"There was a memory allocation error:  \" << e.what();\n        return EXIT_FAILURE;\n    }\n    catch (std::exception& e)\n    {\n        std::cerr << \"There was a generic error:  \" << e.what();\n        return EXIT_FAILURE;\n    }\n\n    return EXIT_SUCCESS;\n}\n\nint\nusage()\n{\n    std::cerr << \"Usage:  hyperdex-cli <coordinator ip> <coordinator port> <space name> <threads>\"\n              << std::endl;\n    return EXIT_FAILURE;\n}\n\nvoid\nhandle_get(hyperclient::returncode ret, const std::vector<e::buffer>& value)\n{\n    if (ret == hyperclient::SUCCESS)\n    {\n        for (size_t i = 0; i < value.size(); ++i)\n        {\n            std::cout << \"\\t\" << value[i].hex();\n        }\n\n        std::cout << std::endl;\n    }\n    else\n    {\n        std::cerr << \"Get returned \" << ret << \".\" << std::endl;\n    }\n}\n\nvoid\nhandle_put(hyperclient::returncode ret)\n{\n    std::cerr << \"Put returned \" << ret << \".\" << std::endl;\n}\n\nvoid\nhandle_del(hyperclient::returncode ret)\n{\n    std::cerr << \"Del returned \" << ret << \".\" << std::endl;\n}\n\nvoid\nhandle_search(hyperclient::returncode ret, const e::buffer& key, const std::vector<e::buffer>& value)\n{\n    if (ret == hyperclient::SUCCESS)\n    {\n        std::cout << \"\\t\" << key.hex() << \" =\";\n\n        for (size_t i = 0; i < value.size(); ++i)\n        {\n            std::cout << \"\\t\" << value[i].hex();\n        }\n\n        std::cout << std::endl;\n    }\n    else\n    {\n        std::cerr << \"Search returned \" << ret << \".\" << std::endl;\n    }\n}\n\nvoid\nhandle_update(hyperclient::returncode ret)\n{\n    std::cerr << \"Update returned \" << ret << \".\" << std::endl;\n}\n\nvoid\nworker(po6::threads::barrier* bar)\n{\n    hyperclient::client cl(po6::net::location(ip, port));\n    cl.connect();\n    std::string line;\n\n    bar->wait();\n\n    while (lines.pop(&line))\n    {\n        std::istringstream istr(line);\n        std::string command = \"\";\n        std::getline(istr, command, '\\t');\n\n        if (command == \"GET\")\n        {\n            std::string tmp;\n\n            if (!std::getline(istr, tmp, '\\t'))\n            {\n                std::cerr << \"Could not read key for \" << line << std::endl;\n            }\n\n            e::buffer key(tmp.c_str(), tmp.size());\n            cl.get(space, key, handle_get);\n            cl.flush(-1);\n        }\n        else if (command == \"PUT\")\n        {\n            std::string tmp;\n\n            if (!std::getline(istr, tmp, '\\t'))\n            {\n                std::cerr << \"Could not read key for \" << line << std::endl;\n            }\n\n            e::buffer key(tmp.c_str(), tmp.size());\n            std::vector<e::buffer> value;\n\n            while (std::getline(istr, tmp, '\\t'))\n            {\n                e::buffer val(tmp.c_str(), tmp.size());\n                value.push_back(e::buffer());\n                value.back().swap(val);\n            }\n\n            cl.put(space, key, value, handle_put);\n            cl.flush(-1);\n        }\n        else if (command == \"DEL\")\n        {\n            std::string tmp;\n\n            if (!std::getline(istr, tmp, '\\t'))\n            {\n                std::cerr << \"Could not read key for \" << line << std::endl;\n            }\n\n            e::buffer key(tmp.c_str(), tmp.size());\n            cl.del(space, key, handle_del);\n            cl.flush(-1);\n        }\n        else if (command == \"QUERY\")\n        {\n            std::string attr;\n            std::string val;\n            bool wellformed = true;\n            std::map<std::string, e::buffer> search;\n\n            while (std::getline(istr, attr, '\\t'))\n            {\n                if (!std::getline(istr, val, '\\t'))\n                {\n                    wellformed = false;\n                }\n\n                search.insert(std::make_pair(attr, e::buffer(val.c_str(), val.size())));\n            }\n\n            if (wellformed)\n            {\n                cl.search(space, search, handle_search, UINT16_MAX);\n                cl.flush(-1);\n            }\n            else\n            {\n                std::cerr << \"Search line malformed.\" << std::endl;\n            }\n        }\n        else if (command == \"UPDATE\")\n        {\n            std::string tmp;\n            std::string attr;\n            std::string val;\n\n            if (!std::getline(istr, tmp, '\\t'))\n            {\n                std::cerr << \"Could not read key for \" << line << std::endl;\n            }\n\n            e::buffer key(tmp.c_str(), tmp.size());\n            bool wellformed = true;\n            std::map<std::string, e::buffer> update;\n\n            while (std::getline(istr, attr, '\\t'))\n            {\n                if (!std::getline(istr, val, '\\t'))\n                {\n                    wellformed = false;\n                }\n\n                update.insert(std::make_pair(attr, e::buffer(val.c_str(), val.size())));\n            }\n\n            if (wellformed)\n            {\n                cl.update(space, key, update, handle_update);\n                cl.flush(-1);\n            }\n            else\n            {\n                std::cerr << \"Update line malformed.\" << std::endl;\n            }\n        }\n        else\n        {\n            std::cerr << \"Unknown commands cannot be acted upon.\" << std::endl;\n        }\n    }\n\n    bar->wait();\n}\n<commit_msg>Add range queries to the cli.<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#define __STDC_LIMIT_MACROS\n\n\/\/ POSIX\n#include <errno.h>\n\n\/\/ STL\n#include <string>\n#include <tr1\/memory>\n#include <vector>\n\n\/\/ po6\n#include <po6\/net\/ipaddr.h>\n#include <po6\/threads\/barrier.h>\n#include <po6\/threads\/thread.h>\n\n\/\/ e\n#include <e\/convert.h>\n#include <e\/locking_fifo.h>\n#include <e\/timer.h>\n\n\/\/ HyperDex\n#include <hyperclient\/client.h>\n#include <hyperclient\/returncode.h>\n\nstatic e::locking_fifo<std::string> lines;\nstatic po6::threads::mutex unblock_lock;\nstatic po6::threads::cond unblock(&unblock_lock);\nstatic po6::net::ipaddr ip;\nstatic uint16_t port;\nstatic std::string space;\nstatic uint16_t num_threads;\n\nstatic int\nusage();\n\nstatic void\nworker(po6::threads::barrier*);\n\nint\nmain(int argc, char* argv[])\n{\n    if (argc != 5)\n    {\n        return usage();\n    }\n\n    space = argv[3];\n\n    try\n    {\n        ip = argv[1];\n    }\n    catch (std::invalid_argument& e)\n    {\n        std::cerr << \"The IP address must be an IPv4 or IPv6 address.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n\n    try\n    {\n        port = e::convert::to_uint16_t(argv[2]);\n    }\n    catch (std::domain_error& e)\n    {\n        std::cerr << \"The port number must be an integer.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n    catch (std::out_of_range& e)\n    {\n        std::cerr << \"The port number must be suitably small.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n\n    try\n    {\n        num_threads = e::convert::to_uint16_t(argv[4]);\n    }\n    catch (std::domain_error& e)\n    {\n        std::cerr << \"The number of threads must be an integer.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n    catch (std::out_of_range& e)\n    {\n        std::cerr << \"The number of threads must be suitably small.\" << std::endl;\n        return EXIT_FAILURE;\n    }\n\n    po6::threads::barrier bar(num_threads + 1);\n\n    try\n    {\n        std::vector<std::tr1::shared_ptr<po6::threads::thread> > threads;\n\n        for (size_t i = 0; i < num_threads; ++i)\n        {\n            std::tr1::shared_ptr<po6::threads::thread> t(new po6::threads::thread(std::tr1::bind(worker, &bar)));\n            t->start();\n            threads.push_back(t);\n        }\n\n        e::stopwatch stopwatch;\n        bar.wait();\n        stopwatch.start();\n        std::string line;\n        size_t i = 0;\n\n        while (std::getline(std::cin, line))\n        {\n            lines.push(line);\n\n            if (lines.size() > 10000)\n            {\n                e::sleep_ms(0, 1);\n            }\n\n            ++i;\n        }\n\n        lines.shutdown();\n        bar.wait();\n\n        uint64_t nanosecs = stopwatch.peek();\n        std::cerr << \"test took \" << nanosecs << \" nanoseconds.\" << std::endl;\n\n        for (std::vector<std::tr1::shared_ptr<po6::threads::thread> >::iterator t = threads.begin();\n                t != threads.end(); ++t)\n        {\n            (*t)->join();\n        }\n    }\n    catch (po6::error& e)\n    {\n        std::cerr << \"There was a system error:  \" << e.what();\n        return EXIT_FAILURE;\n    }\n    catch (std::runtime_error& e)\n    {\n        std::cerr << \"There was a runtime error:  \" << e.what();\n        return EXIT_FAILURE;\n    }\n    catch (std::bad_alloc& e)\n    {\n        std::cerr << \"There was a memory allocation error:  \" << e.what();\n        return EXIT_FAILURE;\n    }\n    catch (std::exception& e)\n    {\n        std::cerr << \"There was a generic error:  \" << e.what();\n        return EXIT_FAILURE;\n    }\n\n    return EXIT_SUCCESS;\n}\n\nint\nusage()\n{\n    std::cerr << \"Usage:  hyperdex-cli <coordinator ip> <coordinator port> <space name> <threads>\"\n              << std::endl;\n    return EXIT_FAILURE;\n}\n\nvoid\nhandle_get(hyperclient::returncode ret, const std::vector<e::buffer>& value)\n{\n    if (ret == hyperclient::SUCCESS)\n    {\n        for (size_t i = 0; i < value.size(); ++i)\n        {\n            std::cout << \"\\t\" << value[i].hex();\n        }\n\n        std::cout << std::endl;\n    }\n    else\n    {\n        std::cerr << \"Get returned \" << ret << \".\" << std::endl;\n    }\n}\n\nvoid\nhandle_put(hyperclient::returncode ret)\n{\n    std::cerr << \"Put returned \" << ret << \".\" << std::endl;\n}\n\nvoid\nhandle_del(hyperclient::returncode ret)\n{\n    std::cerr << \"Del returned \" << ret << \".\" << std::endl;\n}\n\nvoid\nhandle_search(hyperclient::returncode ret, const e::buffer& key, const std::vector<e::buffer>& value)\n{\n    if (ret == hyperclient::SUCCESS)\n    {\n        std::cout << \"\\t\" << key.hex() << \" =\";\n\n        for (size_t i = 0; i < value.size(); ++i)\n        {\n            std::cout << \"\\t\" << value[i].hex();\n        }\n\n        std::cout << std::endl;\n    }\n    else\n    {\n        std::cerr << \"Search returned \" << ret << \".\" << std::endl;\n    }\n}\n\nvoid\nhandle_update(hyperclient::returncode ret)\n{\n    std::cerr << \"Update returned \" << ret << \".\" << std::endl;\n}\n\nvoid\nworker(po6::threads::barrier* bar)\n{\n    hyperclient::client cl(po6::net::location(ip, port));\n    cl.connect();\n    std::string line;\n\n    bar->wait();\n\n    while (lines.pop(&line))\n    {\n        std::istringstream istr(line);\n        std::string command = \"\";\n        std::getline(istr, command, '\\t');\n\n        if (command == \"GET\")\n        {\n            std::string tmp;\n\n            if (!std::getline(istr, tmp, '\\t'))\n            {\n                std::cerr << \"Could not read key for \" << line << std::endl;\n            }\n\n            e::buffer key(tmp.c_str(), tmp.size());\n            cl.get(space, key, handle_get);\n            cl.flush(-1);\n        }\n        else if (command == \"PUT\")\n        {\n            std::string tmp;\n\n            if (!std::getline(istr, tmp, '\\t'))\n            {\n                std::cerr << \"Could not read key for \" << line << std::endl;\n            }\n\n            e::buffer key(tmp.c_str(), tmp.size());\n            std::vector<e::buffer> value;\n\n            while (std::getline(istr, tmp, '\\t'))\n            {\n                e::buffer val(tmp.c_str(), tmp.size());\n                value.push_back(e::buffer());\n                value.back().swap(val);\n            }\n\n            cl.put(space, key, value, handle_put);\n            cl.flush(-1);\n        }\n        else if (command == \"DEL\")\n        {\n            std::string tmp;\n\n            if (!std::getline(istr, tmp, '\\t'))\n            {\n                std::cerr << \"Could not read key for \" << line << std::endl;\n            }\n\n            e::buffer key(tmp.c_str(), tmp.size());\n            cl.del(space, key, handle_del);\n            cl.flush(-1);\n        }\n        else if (command == \"EQUALITY\")\n        {\n            std::string attr;\n            std::string val;\n            bool wellformed = true;\n            std::map<std::string, e::buffer> search;\n\n            while (std::getline(istr, attr, '\\t'))\n            {\n                if (!std::getline(istr, val, '\\t'))\n                {\n                    wellformed = false;\n                }\n\n                search.insert(std::make_pair(attr, e::buffer(val.c_str(), val.size())));\n            }\n\n            if (wellformed)\n            {\n                cl.search(space, search, handle_search);\n                cl.flush(-1);\n            }\n            else\n            {\n                std::cerr << \"Search line malformed.\" << std::endl;\n            }\n        }\n        else if (command == \"RANGE\")\n        {\n            std::string attr;\n            std::string lower_str;\n            std::string upper_str;\n            bool wellformed = true;\n            std::map<std::string, std::pair<uint64_t, uint64_t> > search;\n\n            while (std::getline(istr, attr, '\\t'))\n            {\n                if (!std::getline(istr, lower_str, '\\t'))\n                {\n                    wellformed = false;\n                }\n\n                if (!std::getline(istr, upper_str, '\\t'))\n                {\n                    wellformed = false;\n                }\n\n                \/\/ XXX Be safer with this.\n                uint64_t lower = atoi(lower_str.c_str());\n                uint64_t upper = atoi(upper_str.c_str());\n                search.insert(std::make_pair(attr, std::make_pair(lower, upper)));\n            }\n\n            if (wellformed)\n            {\n                cl.search(space, search, handle_search);\n                cl.flush(-1);\n            }\n            else\n            {\n                std::cerr << \"Search line malformed.\" << std::endl;\n            }\n        }\n        else if (command == \"UPDATE\")\n        {\n            std::string tmp;\n            std::string attr;\n            std::string val;\n\n            if (!std::getline(istr, tmp, '\\t'))\n            {\n                std::cerr << \"Could not read key for \" << line << std::endl;\n            }\n\n            e::buffer key(tmp.c_str(), tmp.size());\n            bool wellformed = true;\n            std::map<std::string, e::buffer> update;\n\n            while (std::getline(istr, attr, '\\t'))\n            {\n                if (!std::getline(istr, val, '\\t'))\n                {\n                    wellformed = false;\n                }\n\n                update.insert(std::make_pair(attr, e::buffer(val.c_str(), val.size())));\n            }\n\n            if (wellformed)\n            {\n                cl.update(space, key, update, handle_update);\n                cl.flush(-1);\n            }\n            else\n            {\n                std::cerr << \"Update line malformed.\" << std::endl;\n            }\n        }\n        else\n        {\n            std::cerr << \"Unknown commands cannot be acted upon.\" << std::endl;\n        }\n    }\n\n    bar->wait();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"fb.h\"\n#include \"string.h\"\n#include \"types.h\"\n#include \"mm.h\"\n#include \"arch\/platform.h\"\n#include \"memcopy.h\"\n\nstatic volatile ptr_val_t __fb_mutex = 0;\n\nFB::FB()\n{\n\tm_current = NULL;\n\tm_buffer = NULL;\n\tm_backbuffer = NULL;\n\tm_double_buffer = true;\n\tm_direct = false;\n\tm_configured = false;\n\tm.assign(&__fb_mutex);\n}\n\nFB::~FB()\n{\n\tfreeBuffers();\n}\n\nvoid FB::setSingleBuffer()\n{\n\tm.lock();\n\n\tm_double_buffer = false;\n\tif (m_buffer!=NULL) {\n\t\tMM::instance()->free(m_buffer);\n\t}\n\tm_buffer = NULL;\n\n\tm.unlock();\n}\n\nvoid FB::setDirect()\n{\n\tm.lock();\n\n\tm_direct = true;\n\tif (m_backbuffer!=NULL) {\n\t\tMM::instance()->free(m_backbuffer);\n\t}\n\tif (m_buffer!=NULL) {\n\t\tMM::instance()->free(m_buffer);\n\t}\n\tm_backbuffer = m_current->base;\n\tm_buffer = m_current->base;\n\n\tm.unlock();\n}\n\nvoid FB::allocBuffers()\n{\n\tif (m_direct) return;\n\tm.lock();\n\n\tm_size = m_current->bytes_per_line*(m_current->height);\n\t\/\/m_backbuffer = (unsigned char*)MM::instance()->alloc(m_size, MM::AllocClear);\n\tm_backbuffer = (unsigned char*)MM::instance()->alloc(m_size);\n\tif (m_backbuffer!=NULL) {\n\t\tm_backbuffer[0] = 0xfe;\n\t\tm_backbuffer[m_size\/2] = 0xed;\n\t\tm_backbuffer[m_size-1] = 0xdc;\n\t\tif (m_backbuffer==NULL || m_backbuffer[0] != 0xfe || m_backbuffer[m_size\/2] != 0xed || m_backbuffer[m_size-1] != 0xdc) {\n\t\t\tm_direct = true;\n\t\t\tMM::instance()->free(m_backbuffer);\n\t\t\tm_backbuffer = m_current->base;\n\t\t\t\/\/Platform::video()->printf(\"direct\\n\");\n\t\t} else {\n\t\t\tm_backbuffer[0] = 0;\n\t\t\tm_backbuffer[m_size\/2] = 0;\n\t\t\tm_backbuffer[m_size-1] = 0;\n\t\t\tm_buffer = (unsigned char*)MM::instance()->alloc(m_size, MM::AllocClear);\n\t\t\tm_buffer[0] = 0xef;\n\t\t\tm_buffer[m_size\/2] = 0xde;\n\t\t\tm_buffer[m_size-1] = 0xec;\n\t\t\tif (m_buffer==NULL || m_buffer[0] != 0xef || m_buffer[m_size\/2] != 0xde || m_buffer[m_size-1] != 0xec) {\n\t\t\t\tm_double_buffer = false;\n\t\t\t\tMM::instance()->free(m_buffer);\n\t\t\t\tm_buffer = NULL;\n\t\t\t\t\/\/m_buffer = m_backbuffer;\n\t\t\t\t\/\/Platform::video()->printf(\"singlebuffer\\n\");\n\t\t\t} else {\n\t\t\t\tm_buffer[0] = 0;\n\t\t\t\tm_buffer[m_size\/2] = 0;\n\t\t\t\tm_buffer[m_size-1] = 0;\n\t\t\t}\n\t\t}\n\t}\n#if 0\n\tfor (uint32_t i=0; i<m_size; i++) {\n\t\tif (buffer!=NULL) buffer[i] = 0;\n\t\tif (backbuffer!=NULL) backbuffer[i] = 0;\n\t}\n#endif\n\t\/\/Platform::video()->printf(\"Allocbuffers: %x %x %x sizes: %d\\n\",m_current->base,m_buffer,m_backbuffer,m_current->bytes_per_line*(m_current->height));\n\tm.unlock();\n}\n\nvoid FB::freeBuffers()\n{\n\tm.lock();\n\tif (m_buffer!=NULL) {\n\t\tMM::instance()->free(m_buffer);\n\t\tm_buffer = NULL;\n\t}\n\tif (m_backbuffer!=NULL) {\n\t\tMM::instance()->free(m_backbuffer);\n\t\tm_backbuffer = NULL;\n\t}\n\tm.unlock();\n}\n\nbool FB::configure(ModeConfig *mode)\n{\n\tif (mode==NULL) return false;\n\n\tm_current = mode;\n\n\tallocBuffers();\n\n\tm_configured = true;\n\treturn true;\n}\n\nunsigned char *FB::data()\n{\n\tif (m_buffer == NULL) return NULL;\n\treturn m_buffer;\n}\n\nvoid FB::swap()\n{\n\tif (m_buffer == NULL) return;\n\tif (m_backbuffer == NULL) return;\n\tif (m_direct) return;\n\tif (!m_double_buffer) {\n\t\tm_buffer = m_backbuffer;\n\t\treturn;\n\t}\n\n\tm.lock();\n\tif (m_buffer!=NULL && !m_direct) {\n\t\tmemcpy_opt(m_buffer, m_backbuffer, m_size);\n\t\t\/\/Mem::copy(m_buffer, m_backbuffer, m_size);\n\t}\n\tm.unlock();\n}\n\n#if 0\nvoid printD(uint32_t d)\n{\n\tchar aa[5];\n\twhile (d>0) {\n\t\tuint32_t i = d%10;\n\t\td\/=10;\n\t\taa[0] = '0'+i;\n\t\taa[1] = 0;\n\t\tVideo::get()->printf(aa);\n\t}\n\tVideo::get()->printf(\"\\n\");\n}\n#endif\n\nvoid FB::putPixel(int x, int y, unsigned char r, unsigned char g, unsigned char b, unsigned char a)\n{\n\tif (m_backbuffer==NULL) return;\n\tif (m_current==NULL) return;\n\n\/*\n\tx %= m_current->width;\n\ty %= m_current->height;\n*\/\n\tif (x>m_current->width) x = m_current->width;\n\tif (y>m_current->height) y = m_current->height;\n\n\tswitch (m_current->depth) {\n\t\tcase 16:\n\t\t\t{\n\t\t\tunsigned short *pos = (unsigned short*)(m_backbuffer+(y*m_current->bytes_per_line + x*2));\n\t\t\tunsigned short color = 0;\n\t\t\tcolor += (r & 0x7C) << 8;\n\t\t\tcolor += (g & 0x7E) << 2;\n\t\t\tcolor += (b & 0x7C) >> 3;\n\t\t\t*pos = color;\n\t\t\t}\n\t\t\tbreak;\n\t\t\/*case 24:\n\t\t\t{\n\t\t\tunsigned char *pos = (unsigned char*)(backbuffer+(y*current->bytes_per_line + x*4));\n\t\t\t*pos++ = r;\n\t\t\t*pos++ = g;\n\t\t\t*pos++ = b;\n\t\t\t}\n\t\t\tbreak;*\/\n\t\tcase 24:\n\t\t\t{\n\t\t\tunsigned char *pos = (unsigned char*)(m_backbuffer+(y*m_current->bytes_per_line + x*3));\n\t\t\t*pos++ = r;\n\t\t\t*pos++ = g;\n\t\t\t*pos = b;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 32:\n\t\t\t{\n\t\t\tuint32_t *pos = (uint32_t*)(m_backbuffer+(y*m_current->bytes_per_line + x*4));\n\t\t\tuint32_t color = (a<<24)+(r<<16)+(g<<8)+b;\n\t\t\t*pos = color;\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\t\/\/Platform::video()->printf(\"Unsupported depth: %d\\n\",m_current->depth);\n\t\t\t\/\/ Unsupported\n\t\t\tbreak;\n\t}\n}\n\nvoid FB::putPixel(int x, int y, unsigned int color)\n{\n\tif (m_backbuffer!=NULL && m_current!=NULL && m_current->depth==32) {\n\t\tx %= m_current->width;\n\t\ty %= m_current->height;\n\t\tuint32_t *pos = (uint32_t*)(m_backbuffer+(y*m_current->bytes_per_line + x*4));\n\t\t*pos = color;\n\t} else {\n\t\tunsigned char b = color & 0xff;\n\t\tunsigned char g = (color>>8) & 0xff;\n\t\tunsigned char r = (color>>16) & 0xff;\n\t\tunsigned char a = (color>>24) & 0xff;\n\t\tputPixel(x, y, r,g,b,a);\n\t}\n}\n\nvoid FB::clear()\n{\n\tm.lock();\n\tif (m_backbuffer!=NULL) Mem::set(m_backbuffer, 0, m_size);\n\tif (m_buffer!=NULL) Mem::set(m_buffer, 0, m_size);\n\tm.unlock();\n\t\/\/swap();\n#if 0\n\tunsigned char *dest = backbuffer+(current->height*current->bytes_per_line);\n\tunsigned char *ptr = backbuffer;\n\twhile (ptr<dest) {\n\t\t*ptr++ = 0;\n\t}\n#endif\n}\n<commit_msg>Clear memory<commit_after>#include \"fb.h\"\n#include \"string.h\"\n#include \"types.h\"\n#include \"mm.h\"\n#include \"arch\/platform.h\"\n#include \"memcopy.h\"\n\nstatic volatile ptr_val_t __fb_mutex = 0;\n\nFB::FB()\n{\n\tm_current = NULL;\n\tm_buffer = NULL;\n\tm_backbuffer = NULL;\n\tm_double_buffer = true;\n\tm_direct = false;\n\tm_configured = false;\n\tm.assign(&__fb_mutex);\n}\n\nFB::~FB()\n{\n\tfreeBuffers();\n}\n\nvoid FB::setSingleBuffer()\n{\n\tm.lock();\n\n\tm_double_buffer = false;\n\tif (m_buffer!=NULL) {\n\t\tMM::instance()->free(m_buffer);\n\t}\n\tm_buffer = NULL;\n\n\tm.unlock();\n}\n\nvoid FB::setDirect()\n{\n\tm.lock();\n\n\tm_direct = true;\n\tif (m_backbuffer!=NULL) {\n\t\tMM::instance()->free(m_backbuffer);\n\t}\n\tif (m_buffer!=NULL) {\n\t\tMM::instance()->free(m_buffer);\n\t}\n\tm_backbuffer = m_current->base;\n\tm_buffer = m_current->base;\n\n\tm.unlock();\n}\n\nvoid FB::allocBuffers()\n{\n\tif (m_direct) return;\n\tm.lock();\n\n\tm_size = m_current->bytes_per_line*(m_current->height);\n\tm_backbuffer = (unsigned char*)MM::instance()->alloc(m_size, MM::AllocClear);\n\t\/\/m_backbuffer = (unsigned char*)MM::instance()->alloc(m_size);\n\tif (m_backbuffer!=NULL) {\n\t\tm_backbuffer[0] = 0xfe;\n\t\tm_backbuffer[m_size\/2] = 0xed;\n\t\tm_backbuffer[m_size-1] = 0xdc;\n\t\tif (m_backbuffer==NULL || m_backbuffer[0] != 0xfe || m_backbuffer[m_size\/2] != 0xed || m_backbuffer[m_size-1] != 0xdc) {\n\t\t\tm_direct = true;\n\t\t\tMM::instance()->free(m_backbuffer);\n\t\t\tm_backbuffer = m_current->base;\n\t\t\t\/\/Platform::video()->printf(\"direct\\n\");\n\t\t} else {\n\t\t\tm_backbuffer[0] = 0;\n\t\t\tm_backbuffer[m_size\/2] = 0;\n\t\t\tm_backbuffer[m_size-1] = 0;\n\t\t\tm_buffer = (unsigned char*)MM::instance()->alloc(m_size, MM::AllocClear);\n\t\t\tm_buffer[0] = 0xef;\n\t\t\tm_buffer[m_size\/2] = 0xde;\n\t\t\tm_buffer[m_size-1] = 0xec;\n\t\t\tif (m_buffer==NULL || m_buffer[0] != 0xef || m_buffer[m_size\/2] != 0xde || m_buffer[m_size-1] != 0xec) {\n\t\t\t\tm_double_buffer = false;\n\t\t\t\tMM::instance()->free(m_buffer);\n\t\t\t\tm_buffer = NULL;\n\t\t\t\t\/\/m_buffer = m_backbuffer;\n\t\t\t\t\/\/Platform::video()->printf(\"singlebuffer\\n\");\n\t\t\t} else {\n\t\t\t\tm_buffer[0] = 0;\n\t\t\t\tm_buffer[m_size\/2] = 0;\n\t\t\t\tm_buffer[m_size-1] = 0;\n\t\t\t}\n\t\t}\n\t}\n#if 0\n\tfor (uint32_t i=0; i<m_size; i++) {\n\t\tif (buffer!=NULL) buffer[i] = 0;\n\t\tif (backbuffer!=NULL) backbuffer[i] = 0;\n\t}\n#endif\n\t\/\/Platform::video()->printf(\"Allocbuffers: %x %x %x sizes: %d\\n\",m_current->base,m_buffer,m_backbuffer,m_current->bytes_per_line*(m_current->height));\n\tm.unlock();\n}\n\nvoid FB::freeBuffers()\n{\n\tm.lock();\n\tif (m_buffer!=NULL) {\n\t\tMM::instance()->free(m_buffer);\n\t\tm_buffer = NULL;\n\t}\n\tif (m_backbuffer!=NULL) {\n\t\tMM::instance()->free(m_backbuffer);\n\t\tm_backbuffer = NULL;\n\t}\n\tm.unlock();\n}\n\nbool FB::configure(ModeConfig *mode)\n{\n\tif (mode==NULL) return false;\n\n\tm_current = mode;\n\n\tallocBuffers();\n\n\tm_configured = true;\n\treturn true;\n}\n\nunsigned char *FB::data()\n{\n\tif (m_buffer == NULL) return NULL;\n\treturn m_buffer;\n}\n\nvoid FB::swap()\n{\n\tif (m_buffer == NULL) return;\n\tif (m_backbuffer == NULL) return;\n\tif (m_direct) return;\n\tif (!m_double_buffer) {\n\t\tm_buffer = m_backbuffer;\n\t\treturn;\n\t}\n\n\tm.lock();\n\tif (m_buffer!=NULL && !m_direct) {\n\t\tmemcpy_opt(m_buffer, m_backbuffer, m_size);\n\t\t\/\/Mem::copy(m_buffer, m_backbuffer, m_size);\n\t}\n\tm.unlock();\n}\n\n#if 0\nvoid printD(uint32_t d)\n{\n\tchar aa[5];\n\twhile (d>0) {\n\t\tuint32_t i = d%10;\n\t\td\/=10;\n\t\taa[0] = '0'+i;\n\t\taa[1] = 0;\n\t\tVideo::get()->printf(aa);\n\t}\n\tVideo::get()->printf(\"\\n\");\n}\n#endif\n\nvoid FB::putPixel(int x, int y, unsigned char r, unsigned char g, unsigned char b, unsigned char a)\n{\n\tif (m_backbuffer==NULL) return;\n\tif (m_current==NULL) return;\n\n\/*\n\tx %= m_current->width;\n\ty %= m_current->height;\n*\/\n\tif (x>m_current->width) x = m_current->width;\n\tif (y>m_current->height) y = m_current->height;\n\n\tswitch (m_current->depth) {\n\t\tcase 16:\n\t\t\t{\n\t\t\tunsigned short *pos = (unsigned short*)(m_backbuffer+(y*m_current->bytes_per_line + x*2));\n\t\t\tunsigned short color = 0;\n\t\t\tcolor += (r & 0x7C) << 8;\n\t\t\tcolor += (g & 0x7E) << 2;\n\t\t\tcolor += (b & 0x7C) >> 3;\n\t\t\t*pos = color;\n\t\t\t}\n\t\t\tbreak;\n\t\t\/*case 24:\n\t\t\t{\n\t\t\tunsigned char *pos = (unsigned char*)(backbuffer+(y*current->bytes_per_line + x*4));\n\t\t\t*pos++ = r;\n\t\t\t*pos++ = g;\n\t\t\t*pos++ = b;\n\t\t\t}\n\t\t\tbreak;*\/\n\t\tcase 24:\n\t\t\t{\n\t\t\tunsigned char *pos = (unsigned char*)(m_backbuffer+(y*m_current->bytes_per_line + x*3));\n\t\t\t*pos++ = r;\n\t\t\t*pos++ = g;\n\t\t\t*pos = b;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 32:\n\t\t\t{\n\t\t\tuint32_t *pos = (uint32_t*)(m_backbuffer+(y*m_current->bytes_per_line + x*4));\n\t\t\tuint32_t color = (a<<24)+(r<<16)+(g<<8)+b;\n\t\t\t*pos = color;\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\t\/\/Platform::video()->printf(\"Unsupported depth: %d\\n\",m_current->depth);\n\t\t\t\/\/ Unsupported\n\t\t\tbreak;\n\t}\n}\n\nvoid FB::putPixel(int x, int y, unsigned int color)\n{\n\tif (m_backbuffer!=NULL && m_current!=NULL && m_current->depth==32) {\n\t\tx %= m_current->width;\n\t\ty %= m_current->height;\n\t\tuint32_t *pos = (uint32_t*)(m_backbuffer+(y*m_current->bytes_per_line + x*4));\n\t\t*pos = color;\n\t} else {\n\t\tunsigned char b = color & 0xff;\n\t\tunsigned char g = (color>>8) & 0xff;\n\t\tunsigned char r = (color>>16) & 0xff;\n\t\tunsigned char a = (color>>24) & 0xff;\n\t\tputPixel(x, y, r,g,b,a);\n\t}\n}\n\nvoid FB::clear()\n{\n\tm.lock();\n\tif (m_backbuffer!=NULL) Mem::set(m_backbuffer, 0, m_size);\n\tif (m_buffer!=NULL) Mem::set(m_buffer, 0, m_size);\n\tm.unlock();\n\t\/\/swap();\n#if 0\n\tunsigned char *dest = backbuffer+(current->height*current->bytes_per_line);\n\tunsigned char *ptr = backbuffer;\n\twhile (ptr<dest) {\n\t\t*ptr++ = 0;\n\t}\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <vtkSmartPointer.h>\n#include <vtkSphereSource.h>\n#include <vtkPolyData.h>\n#include <vtkPolyDataMapper.h>\n#include <vtkActor.h>\n#include <vtkCommand.h>\n#include <vtkRenderer.h>\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkProperty.h>\n#include <vtkAxesActor.h>\n#include <vtkNamedColors.h>\n\nclass vtkTimerCallback2 : public vtkCommand\n{\npublic:\n static vtkTimerCallback2 *New()\n {\n  vtkTimerCallback2 *cb = new vtkTimerCallback2;\n  return cb;\n }\n \n virtual void Execute(vtkObject *caller, unsigned long eventId, void * vtkNotUsed(callData))\n {\n  actor->RotateZ(5);\n  vtkRenderWindowInteractor *iren = dynamic_cast<vtkRenderWindowInteractor*>(caller);\n  iren->GetRenderWindow()->Render();\n }\nprivate:\n int TimerCount;\npublic:\n vtkActor* actor;\n};\n\nint main(int, char*[])\n{\n vtkSmartPointer<vtkNamedColors> colors = vtkSmartPointer<vtkNamedColors>::New();\n \n \/\/ Create a sphere\n vtkSmartPointer<vtkSphereSource> sphereSource = vtkSmartPointer<vtkSphereSource>::New();\n sphereSource->SetCenter(0.0, 0.0, 0.0);\n sphereSource->SetRadius(1.0);\n sphereSource->SetThetaResolution(15);\n sphereSource->SetPhiResolution(15);\n sphereSource->Update();\n \n \/\/ Create a mapper and actor\n vtkSmartPointer<vtkPolyDataMapper> mapper = vtkSmartPointer<vtkPolyDataMapper>::New();\n mapper->SetInputConnection(sphereSource->GetOutputPort());\n vtkSmartPointer<vtkActor> actor = vtkSmartPointer<vtkActor>::New();\n actor->SetMapper(mapper);\n actor->RotateX(90);\n actor->GetProperty()->SetRepresentationToWireframe();\n \n \/\/ Create a renderer, render window, and interactor\n vtkSmartPointer<vtkRenderer> renderer = vtkSmartPointer<vtkRenderer>::New();\n vtkSmartPointer<vtkRenderWindow> renderWindow = vtkSmartPointer<vtkRenderWindow>::New();\n renderWindow->AddRenderer(renderer);\n \n vtkSmartPointer<vtkRenderWindowInteractor> renderWindowInteractor = vtkSmartPointer<vtkRenderWindowInteractor>::New();\n renderWindowInteractor->SetRenderWindow(renderWindow);\n \n \/\/ Add the actor to the scene\n renderer->AddActor(actor);\n \n renderer->SetBackground(colors->GetColor3d(\"Seashell\").GetData()); \/\/ Background color white\n \/\/ Render and interact\n renderWindow->Render();\n \n \/\/ Initialize must be called prior to creating timer events.\n renderWindowInteractor->Initialize();\n \n \/\/ Sign up to receive TimerEvent\n vtkSmartPointer<vtkTimerCallback2> cb = vtkSmartPointer<vtkTimerCallback2>::New();\n cb->actor = actor;\n renderWindowInteractor->AddObserver(vtkCommand::TimerEvent, cb);\n \n int timerId = renderWindowInteractor->CreateRepeatingTimer(100);\n \n \/\/ Start the interaction and timer\n renderWindowInteractor->Start();\n \n return EXIT_SUCCESS;\n}\n<commit_msg>Update RotatingSphere.cxx<commit_after>#include <vtkSmartPointer.h>\n#include <vtkSphereSource.h>\n#include <vtkPolyDataMapper.h>\n#include <vtkActor.h>\n#include <vtkRenderer.h>\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkProperty.h>\n#include <vtkNamedColors.h>\n#include <vtkAnimationScene.h>\n\n\nclass vtkTimerCallback2 : public vtkCommand\n{\npublic:\n\n\tint timerId;\n\tstatic vtkTimerCallback2 *New()\n\t{\n\t\tvtkTimerCallback2 *cb = new vtkTimerCallback2;\n\t\tcb->TimerCount = 0;\n\t\treturn cb;\n\t}\n\n\tvirtual void Execute(vtkObject *caller, unsigned long eventId, void * vtkNotUsed(callData))\n\t{\n\t\tvtkRenderWindowInteractor *iren = dynamic_cast<vtkRenderWindowInteractor*>(caller);\n\t\tif (vtkCommand::TimerEvent == eventId)\n\t\t{\n\t\t\t++this->TimerCount;\n\t\t}\n\t\tif (TimerCount <36)\n\t\t{\n\t\t\tactor->RotateZ(5);\n\t\t\t\n\t\t\tiren->GetRenderWindow()->Render();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tiren->DestroyTimer();\n\t\t}\n\t\n\t}\nprivate:\n\tint TimerCount;\n\npublic:\n\tvtkActor* actor;\n};\n\nint main(int, char*[])\n{\n\tvtkSmartPointer<vtkNamedColors> colors = vtkSmartPointer<vtkNamedColors>::New();\n\n\t\/\/ Create a sphere\n\tvtkSmartPointer<vtkSphereSource> sphereSource = vtkSmartPointer<vtkSphereSource>::New();\n\tsphereSource->SetCenter(0.0, 0.0, 0.0);\n\tsphereSource->SetRadius(1.0);\n\tsphereSource->SetThetaResolution(15);\n\tsphereSource->SetPhiResolution(15);\n\tsphereSource->Update();\n\n\t\/\/ Create a mapper and actor\n\tvtkSmartPointer<vtkPolyDataMapper> mapper = vtkSmartPointer<vtkPolyDataMapper>::New();\n\tmapper->SetInputConnection(sphereSource->GetOutputPort());\n\tvtkSmartPointer<vtkActor> actor = vtkSmartPointer<vtkActor>::New();\n\tactor->SetMapper(mapper);\n\tactor->RotateX(90);\n\tactor->GetProperty()->SetRepresentationToWireframe();\n\n\t\/\/ Create a renderer, render window, and interactor\n\tvtkSmartPointer<vtkRenderer> renderer = vtkSmartPointer<vtkRenderer>::New();\n\tvtkSmartPointer<vtkRenderWindow> renderWindow = vtkSmartPointer<vtkRenderWindow>::New();\n\trenderWindow->AddRenderer(renderer);\n\trenderWindow->SetSize(640, 480);\n\n\tvtkSmartPointer<vtkRenderWindowInteractor> renderWindowInteractor = vtkSmartPointer<vtkRenderWindowInteractor>::New();\n\trenderWindowInteractor->SetRenderWindow(renderWindow);\n\n\t\/\/ Add the actor to the scene\n\trenderer->AddActor(actor);\n\n\trenderer->SetBackground(colors->GetColor3d(\"Seashell\").GetData());\n\t\/\/ Render and interact\n\trenderWindow->Render();\n\n\t\/\/ Initialize must be called prior to creating timer events.\n\trenderWindowInteractor->Initialize();\n\n\t\/\/ Sign up to receive TimerEvent\n\tvtkSmartPointer<vtkTimerCallback2> cb = vtkSmartPointer<vtkTimerCallback2>::New();\n\tcb->actor = actor;\n\n\n\trenderWindowInteractor->AddObserver(vtkCommand::TimerEvent, cb);\n\n\tint timerId = renderWindowInteractor->CreateRepeatingTimer(100);\n\tcb->timerId = timerId;\n\n\t\/\/ Start the interaction and timer\n\trenderWindowInteractor->Start();\n\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"arguments.hpp\"\n#include \"call_frame.hpp\"\n#include \"on_stack.hpp\"\n#include \"memory.hpp\"\n#include \"metrics.hpp\"\n#include \"raise_reason.hpp\"\n#include \"thread_phase.hpp\"\n\n#include \"builtin\/array.hpp\"\n#include \"builtin\/class.hpp\"\n#include \"builtin\/exception.hpp\"\n#include \"builtin\/fiber.hpp\"\n#include \"builtin\/lookup_table.hpp\"\n#include \"builtin\/native_method.hpp\"\n#include \"builtin\/object.hpp\"\n#include \"builtin\/thread.hpp\"\n\n#include \"memory\/gc.hpp\"\n\n#include \"dtrace\/dtrace.h\"\n\n#include \"logger.hpp\"\n\n#include \"missing\/gettid.h\"\n\n#include <ostream>\n#include <regex>\n#include <string>\n\nnamespace rubinius {\n  std::atomic<uint32_t> Fiber::fiber_ids_;\n\n  void Fiber::bootstrap(STATE) {\n    GO(fiber).set(state->memory()->new_class<Class, Fiber>(state, \"Fiber\"));\n\n    fiber_ids_.store(0);\n  }\n\n  bool Fiber::root_p() {\n    return vm()->fiber()->vm() == vm()->thread()->vm();\n  }\n\n  void Fiber::unpack_arguments(STATE, Arguments& args) {\n    switch(args.total()) {\n      case 0:\n        value(state, cNil);\n        break;\n      case 1:\n        value(state, args.get_argument(0));\n        break;\n      default:\n        value(state,  args.as_array(state));\n        break;\n    }\n  }\n\n  void Fiber::start(STATE, Arguments& args) {\n    arguments(state, args.as_array(state));\n\n    pthread_attr_t attrs;\n    pthread_attr_init(&attrs);\n    pthread_attr_setstacksize(&attrs, stack_size()->to_native());\n    pthread_attr_setdetachstate(&attrs, PTHREAD_CREATE_DETACHED);\n\n    pthread_create(&vm()->os_thread(), &attrs,\n        Fiber::run, (void*)vm());\n\n    pthread_attr_destroy(&attrs);\n\n    \/\/ Wait for Fiber thread to start up and pause.\n    while(!vm()->wait_flag());\n  }\n\n  void Fiber::restart(STATE) {\n    std::lock_guard<std::mutex> guard(state->vm()->thread()->fiber_mutex());\n\n    state->vm()->thread()->vm()->set_current_fiber(vm());\n\n    while(vm()->wait_flag()) {\n      std::lock_guard<std::mutex> guard(vm()->wait_mutex());\n      vm()->wait_condition().notify_one();\n    }\n  }\n\n  void Fiber::suspend(STATE) {\n    {\n      std::unique_lock<std::mutex> lk(vm()->wait_mutex());\n      vm()->set_wait_flag(true);\n\n      {\n        UnmanagedPhase unmanaged(state);\n        vm()->wait_condition().wait(lk);\n      }\n\n      vm()->set_wait_flag(false);\n    }\n\n    std::lock_guard<std::mutex> guard(state->vm()->thread()->fiber_mutex());\n  }\n\n  Object* Fiber::return_value(STATE) {\n    if(vm()->thread_state()->raise_reason() == cNone) {\n      return value();\n    } else {\n      invoke_context()->thread_state()->set_state(vm()->thread_state());\n      return NULL;\n    }\n  }\n\n  void* Fiber::run(void* ptr) {\n    VM* vm = reinterpret_cast<VM*>(ptr);\n    State state_obj(vm), *state = &state_obj;\n\n    vm->set_stack_bounds(vm->fiber()->stack_size()->to_native());\n    vm->set_current_thread();\n    vm->set_start_time();\n\n    RUBINIUS_THREAD_START(\n        const_cast<RBX_DTRACE_CHAR_P>(\n          vm->name().c_str()), vm->fiber()->fiber_id()->to_native(), 0);\n\n    vm->fiber()->pid(state, Fixnum::from(gettid()));\n\n    if(state->shared().config.machine_thread_log_lifetime.value) {\n      logger::write(\"fiber: run: %s, %d, %#x\",\n          vm->name().c_str(), vm->fiber()->pid()->to_native(),\n          (intptr_t)pthread_self());\n    }\n\n    NativeMethod::init_thread(state);\n\n    vm->fiber()->suspend(state);\n\n    Object* value = vm->fiber()->block()->send(state, G(sym_call),\n        vm->fiber()->arguments(), vm->fiber()->block());\n    vm->set_call_frame(NULL);\n\n    value = vm->fiber()->return_value(state);\n\n    vm->fiber()->invoke_context()->fiber()->restart(state);\n\n    vm->fiber()->status(eDead);\n    vm->fiber()->vm()->set_wait_flag(true);\n\n    vm->unmanaged_phase();\n\n    state->shared().report_profile(state);\n\n    NativeMethod::cleanup_thread(state);\n\n    if(state->shared().config.machine_fiber_log_lifetime.value) {\n      logger::write(\"fiber: exit: %s %fs\", vm->name().c_str(), vm->run_time());\n    }\n\n    vm->set_zombie(state);\n\n    RUBINIUS_THREAD_STOP(\n        const_cast<RBX_DTRACE_CHAR_P>(\n          vm->name().c_str()), vm->fiber()->fiber_id()->to_native(), 0);\n\n    return 0;\n  }\n\n  Fiber* Fiber::current(STATE) {\n    return state->vm()->fiber();\n  }\n\n  \/* This creates the pseudo-Fiber for the Thread. This provides a uniform\n   * means of expressing things like Fiber.current.\n   *\/\n  Fiber* Fiber::create(STATE, VM* vm) {\n    Fiber* fiber = state->memory()->new_object<Fiber>(state, G(fiber));\n\n    vm->set_fiber(fiber);\n    fiber->vm(vm);\n\n    fiber->pid(vm->thread()->pid());\n    fiber->stack_size(vm->thread()->stack_size());\n    fiber->thread_name(state, String::create(state, vm->name().c_str()));\n    fiber->fiber_id(Fixnum::from(0));\n    fiber->status(eRunning);\n    fiber->invoke_context(vm);\n\n    return fiber;\n  }\n\n  Fiber* Fiber::create(STATE, Object* self, Object* stack_size, Object* block) {\n    Fiber* fiber = state->memory()->new_object<Fiber>(state, as<Class>(self));\n    fiber->block(state, block);\n\n    std::ostringstream name;\n    name << \"fiber.\" << fiber->fiber_id()->to_native();\n\n    fiber->vm(state->vm()->thread_nexus()->new_vm(&state->shared(), name.str().c_str()));\n\n    if(Fixnum* size = try_as<Fixnum>(stack_size)) {\n      fiber->vm()->validate_stack_size(state, size->to_native());\n      fiber->stack_size(state, size);\n    }\n\n    fiber->vm()->set_thread(state->vm()->thread());\n    fiber->vm()->set_fiber(fiber);\n\n    state->memory()->native_finalizer(state, fiber,\n        (memory::FinalizerFunction)&Fiber::finalize);\n\n    if(state->shared().config.machine_fiber_log_lifetime.value) {\n      const std::regex& filter = state->shared().config.machine_fiber_log_filter();\n\n      if(CallFrame* call_frame = state->vm()->get_filtered_frame(state, filter)) {\n        std::ostringstream source;\n\n        source << call_frame->file(state)->cpp_str(state).c_str()\n          << \":\" << call_frame->line(state);\n\n        logger::write(\"fiber: new: %s, %d, %s\",\n            fiber->thread_name()->c_str(state),\n            fiber->fiber_id()->to_native(), source.str().c_str());\n\n        fiber->source(state, String::create(state, source.str().c_str()));\n      } else {\n        logger::write(\"fiber: new: %s, %d\",\n            fiber->thread_name()->c_str(state), fiber->fiber_id()->to_native());\n      }\n    }\n\n    state->vm()->metrics().system.fibers_created++;\n\n    return fiber;\n  }\n\n  String* Fiber::status(STATE) {\n    switch(status()) {\n      case eCreated:\n        return String::create(state, \"created\");\n        break;\n      case eRunning:\n        return String::create(state, \"run\");\n        break;\n      case eYielding:\n        return String::create(state, \"yield\");\n        break;\n      case eTransfer:\n        return String::create(state, \"transfer\");\n        break;\n      case eDead:\n        return String::create(state, \"dead\");\n        break;\n    }\n\n    return String::create(state, \"unknown\");\n  }\n\n  Object* Fiber::resume(STATE, Arguments& args) {\n    if(status() == eCreated) {\n      start(state, args);\n    } else if(status() == eTransfer) {\n      Exception::raise_fiber_error(state, \"attempt to resume transfered fiber\");\n    } else if(status() == eRunning) {\n      Exception::raise_fiber_error(state, \"attempt to resume running fiber\");\n    } else if(status() == eDead) {\n      Exception::raise_fiber_error(state, \"attempt to resume dead fiber\");\n    } else if(root_p()) {\n      Exception::raise_fiber_error(state, \"attempt to resume root fiber\");\n    }\n\n    status(eRunning);\n    unpack_arguments(state, args);\n    invoke_context(state->vm());\n\n    \/\/ Being cooperative...\n    restart(state);\n\n    \/\/ Through the worm hole...\n    state->vm()->fiber()->suspend(state);\n\n    \/\/ We're back...\n    return return_value(state);\n  }\n\n  Object* Fiber::transfer(STATE, Arguments& args) {\n    if(status() == eCreated) {\n      start(state, args);\n    } else if(state->vm()->fiber() == this) {\n      return args.as_array(state);\n    } else if(status() == eDead) {\n      Exception::raise_fiber_error(state, \"attempt to transfer to dead fiber\");\n    }\n\n    status(eTransfer);\n    unpack_arguments(state, args);\n    invoke_context(state->vm()->thread()->vm());\n\n    \/\/ Being cooperative...\n    restart(state);\n\n    \/\/ Through the worm hole...\n    state->vm()->fiber()->suspend(state);\n\n    \/\/ We're back...\n    return return_value(state);\n  }\n\n  Object* Fiber::s_yield(STATE, Arguments& args) {\n    Fiber* fiber = state->vm()->fiber();\n    OnStack<1> os(state, fiber);\n\n    if(fiber->root_p()) {\n      Exception::raise_fiber_error(state, \"can't yield from root fiber\");\n    } else if(fiber->status() == eTransfer) {\n      Exception::raise_fiber_error(state, \"can't yield from transferred fiber\");\n    }\n\n    fiber->unpack_arguments(state, args);\n    fiber->status(eYielding);\n\n    \/\/ Being cooperative...\n    fiber->invoke_context()->fiber()->restart(state);\n\n    \/\/ Through the worm hole...\n    fiber->suspend(state);\n\n    \/\/ We're back...\n    return fiber->invoke_context()->fiber()->return_value(state);\n  }\n\n  void Fiber::finalize(STATE, Fiber* fib) {\n    if(state->shared().config.machine_fiber_log_finalizer.value) {\n      logger::write(\"fiber: finalizer: %s, %d\",\n          fib->thread_name()->c_str(state), fib->fiber_id()->to_native());\n    }\n  }\n}\n<commit_msg>Fixed passing arguments with Fiber.yield, Fiber#resume.<commit_after>#include \"arguments.hpp\"\n#include \"call_frame.hpp\"\n#include \"on_stack.hpp\"\n#include \"memory.hpp\"\n#include \"metrics.hpp\"\n#include \"raise_reason.hpp\"\n#include \"thread_phase.hpp\"\n\n#include \"builtin\/array.hpp\"\n#include \"builtin\/class.hpp\"\n#include \"builtin\/exception.hpp\"\n#include \"builtin\/fiber.hpp\"\n#include \"builtin\/lookup_table.hpp\"\n#include \"builtin\/native_method.hpp\"\n#include \"builtin\/object.hpp\"\n#include \"builtin\/thread.hpp\"\n\n#include \"memory\/gc.hpp\"\n\n#include \"dtrace\/dtrace.h\"\n\n#include \"logger.hpp\"\n\n#include \"missing\/gettid.h\"\n\n#include <ostream>\n#include <regex>\n#include <string>\n\nnamespace rubinius {\n  std::atomic<uint32_t> Fiber::fiber_ids_;\n\n  void Fiber::bootstrap(STATE) {\n    GO(fiber).set(state->memory()->new_class<Class, Fiber>(state, \"Fiber\"));\n\n    fiber_ids_.store(0);\n  }\n\n  bool Fiber::root_p() {\n    return vm()->fiber()->vm() == vm()->thread()->vm();\n  }\n\n  void Fiber::unpack_arguments(STATE, Arguments& args) {\n    switch(args.total()) {\n      case 0:\n        value(state, cNil);\n        break;\n      case 1:\n        value(state, args.get_argument(0));\n        break;\n      default:\n        value(state,  args.as_array(state));\n        break;\n    }\n  }\n\n  void Fiber::start(STATE, Arguments& args) {\n    arguments(state, args.as_array(state));\n\n    pthread_attr_t attrs;\n    pthread_attr_init(&attrs);\n    pthread_attr_setstacksize(&attrs, stack_size()->to_native());\n    pthread_attr_setdetachstate(&attrs, PTHREAD_CREATE_DETACHED);\n\n    pthread_create(&vm()->os_thread(), &attrs,\n        Fiber::run, (void*)vm());\n\n    pthread_attr_destroy(&attrs);\n\n    \/\/ Wait for Fiber thread to start up and pause.\n    while(!vm()->wait_flag());\n  }\n\n  void Fiber::restart(STATE) {\n    std::lock_guard<std::mutex> guard(state->vm()->thread()->fiber_mutex());\n\n    state->vm()->thread()->vm()->set_current_fiber(vm());\n\n    while(vm()->wait_flag()) {\n      std::lock_guard<std::mutex> guard(vm()->wait_mutex());\n      vm()->wait_condition().notify_one();\n    }\n  }\n\n  void Fiber::suspend(STATE) {\n    {\n      std::unique_lock<std::mutex> lk(vm()->wait_mutex());\n      vm()->set_wait_flag(true);\n\n      {\n        UnmanagedPhase unmanaged(state);\n        vm()->wait_condition().wait(lk);\n      }\n\n      vm()->set_wait_flag(false);\n    }\n\n    std::lock_guard<std::mutex> guard(state->vm()->thread()->fiber_mutex());\n  }\n\n  Object* Fiber::return_value(STATE) {\n    if(vm()->thread_state()->raise_reason() == cNone) {\n      return value();\n    } else {\n      invoke_context()->thread_state()->set_state(vm()->thread_state());\n      return NULL;\n    }\n  }\n\n  void* Fiber::run(void* ptr) {\n    VM* vm = reinterpret_cast<VM*>(ptr);\n    State state_obj(vm), *state = &state_obj;\n\n    vm->set_stack_bounds(vm->fiber()->stack_size()->to_native());\n    vm->set_current_thread();\n    vm->set_start_time();\n\n    RUBINIUS_THREAD_START(\n        const_cast<RBX_DTRACE_CHAR_P>(\n          vm->name().c_str()), vm->fiber()->fiber_id()->to_native(), 0);\n\n    vm->fiber()->pid(state, Fixnum::from(gettid()));\n\n    if(state->shared().config.machine_thread_log_lifetime.value) {\n      logger::write(\"fiber: run: %s, %d, %#x\",\n          vm->name().c_str(), vm->fiber()->pid()->to_native(),\n          (intptr_t)pthread_self());\n    }\n\n    NativeMethod::init_thread(state);\n\n    vm->fiber()->suspend(state);\n\n    Object* value = vm->fiber()->block()->send(state, G(sym_call),\n        vm->fiber()->arguments(), vm->fiber()->block());\n    vm->set_call_frame(NULL);\n\n    if(value) {\n      vm->fiber()->value(state, value);\n    } else {\n      vm->fiber()->value(state, cNil);\n    }\n\n    vm->fiber()->invoke_context()->fiber()->restart(state);\n\n    vm->fiber()->status(eDead);\n    vm->fiber()->vm()->set_wait_flag(true);\n\n    vm->unmanaged_phase();\n\n    state->shared().report_profile(state);\n\n    NativeMethod::cleanup_thread(state);\n\n    if(state->shared().config.machine_fiber_log_lifetime.value) {\n      logger::write(\"fiber: exit: %s %fs\", vm->name().c_str(), vm->run_time());\n    }\n\n    vm->set_zombie(state);\n\n    RUBINIUS_THREAD_STOP(\n        const_cast<RBX_DTRACE_CHAR_P>(\n          vm->name().c_str()), vm->fiber()->fiber_id()->to_native(), 0);\n\n    return 0;\n  }\n\n  Fiber* Fiber::current(STATE) {\n    return state->vm()->fiber();\n  }\n\n  \/* This creates the pseudo-Fiber for the Thread. This provides a uniform\n   * means of expressing things like Fiber.current.\n   *\/\n  Fiber* Fiber::create(STATE, VM* vm) {\n    Fiber* fiber = state->memory()->new_object<Fiber>(state, G(fiber));\n\n    vm->set_fiber(fiber);\n    fiber->vm(vm);\n\n    fiber->pid(vm->thread()->pid());\n    fiber->stack_size(vm->thread()->stack_size());\n    fiber->thread_name(state, String::create(state, vm->name().c_str()));\n    fiber->fiber_id(Fixnum::from(0));\n    fiber->status(eRunning);\n    fiber->invoke_context(vm);\n\n    return fiber;\n  }\n\n  Fiber* Fiber::create(STATE, Object* self, Object* stack_size, Object* block) {\n    Fiber* fiber = state->memory()->new_object<Fiber>(state, as<Class>(self));\n    fiber->block(state, block);\n\n    std::ostringstream name;\n    name << \"fiber.\" << fiber->fiber_id()->to_native();\n\n    fiber->vm(state->vm()->thread_nexus()->new_vm(&state->shared(), name.str().c_str()));\n\n    if(Fixnum* size = try_as<Fixnum>(stack_size)) {\n      fiber->vm()->validate_stack_size(state, size->to_native());\n      fiber->stack_size(state, size);\n    }\n\n    fiber->vm()->set_thread(state->vm()->thread());\n    fiber->vm()->set_fiber(fiber);\n\n    state->memory()->native_finalizer(state, fiber,\n        (memory::FinalizerFunction)&Fiber::finalize);\n\n    if(state->shared().config.machine_fiber_log_lifetime.value) {\n      const std::regex& filter = state->shared().config.machine_fiber_log_filter();\n\n      if(CallFrame* call_frame = state->vm()->get_filtered_frame(state, filter)) {\n        std::ostringstream source;\n\n        source << call_frame->file(state)->cpp_str(state).c_str()\n          << \":\" << call_frame->line(state);\n\n        logger::write(\"fiber: new: %s, %d, %s\",\n            fiber->thread_name()->c_str(state),\n            fiber->fiber_id()->to_native(), source.str().c_str());\n\n        fiber->source(state, String::create(state, source.str().c_str()));\n      } else {\n        logger::write(\"fiber: new: %s, %d\",\n            fiber->thread_name()->c_str(state), fiber->fiber_id()->to_native());\n      }\n    }\n\n    state->vm()->metrics().system.fibers_created++;\n\n    return fiber;\n  }\n\n  String* Fiber::status(STATE) {\n    switch(status()) {\n      case eCreated:\n        return String::create(state, \"created\");\n        break;\n      case eRunning:\n        return String::create(state, \"run\");\n        break;\n      case eYielding:\n        return String::create(state, \"yield\");\n        break;\n      case eTransfer:\n        return String::create(state, \"transfer\");\n        break;\n      case eDead:\n        return String::create(state, \"dead\");\n        break;\n    }\n\n    return String::create(state, \"unknown\");\n  }\n\n  Object* Fiber::resume(STATE, Arguments& args) {\n    if(status() == eCreated) {\n      start(state, args);\n    } else if(status() == eTransfer) {\n      Exception::raise_fiber_error(state, \"attempt to resume transfered fiber\");\n    } else if(status() == eRunning) {\n      Exception::raise_fiber_error(state, \"attempt to resume running fiber\");\n    } else if(status() == eDead) {\n      Exception::raise_fiber_error(state, \"attempt to resume dead fiber\");\n    } else if(root_p()) {\n      Exception::raise_fiber_error(state, \"attempt to resume root fiber\");\n    }\n\n    status(eRunning);\n    unpack_arguments(state, args);\n    invoke_context(state->vm());\n\n    \/\/ Being cooperative...\n    restart(state);\n\n    \/\/ Through the worm hole...\n    state->vm()->fiber()->suspend(state);\n\n    \/\/ We're back...\n    return return_value(state);\n  }\n\n  Object* Fiber::transfer(STATE, Arguments& args) {\n    if(status() == eCreated) {\n      start(state, args);\n    } else if(state->vm()->fiber() == this) {\n      return args.as_array(state);\n    } else if(status() == eDead) {\n      Exception::raise_fiber_error(state, \"attempt to transfer to dead fiber\");\n    }\n\n    status(eTransfer);\n    unpack_arguments(state, args);\n    invoke_context(state->vm()->thread()->vm());\n\n    \/\/ Being cooperative...\n    restart(state);\n\n    \/\/ Through the worm hole...\n    state->vm()->fiber()->suspend(state);\n\n    \/\/ We're back...\n    return return_value(state);\n  }\n\n  Object* Fiber::s_yield(STATE, Arguments& args) {\n    Fiber* fiber = state->vm()->fiber();\n    OnStack<1> os(state, fiber);\n\n    if(fiber->root_p()) {\n      Exception::raise_fiber_error(state, \"can't yield from root fiber\");\n    } else if(fiber->status() == eTransfer) {\n      Exception::raise_fiber_error(state, \"can't yield from transferred fiber\");\n    }\n\n    fiber->unpack_arguments(state, args);\n    fiber->status(eYielding);\n\n    \/\/ Being cooperative...\n    fiber->invoke_context()->fiber()->restart(state);\n\n    \/\/ Through the worm hole...\n    fiber->suspend(state);\n\n    \/\/ We're back...\n    return fiber->return_value(state);\n  }\n\n  void Fiber::finalize(STATE, Fiber* fib) {\n    if(state->shared().config.machine_fiber_log_finalizer.value) {\n      logger::write(\"fiber: finalizer: %s, %d\",\n          fib->thread_name()->c_str(state), fib->fiber_id()->to_native());\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"TriggerRepeat.hpp\"\n\n#include \"..\/Component\/RigidBody.hpp\"\n#include \"..\/Entity\/Entity.hpp\"\n#include \"..\/Manager\/Managers.hpp\"\n#include \"..\/Manager\/PhysicsManager.hpp\"\n#include \"..\/Manager\/ScriptManager.hpp\"\n\nTriggerRepeat::TriggerRepeat() {\n\n}\n\nTriggerRepeat::~TriggerRepeat() {\n\n}\n\nvoid TriggerRepeat::OnEnter() {\n    if (collidedEntity && collidedEntity->GetComponent<Component::RigidBody>()) {\n        Component::RigidBody* rigidBodyComp = collidedEntity->GetComponent<Component::RigidBody>();\n        Managers().physicsManager->ForgetTriggerEnter(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerRetain(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerLeave(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->OnTriggerEnter(triggerVolume, rigidBodyComp, std::bind(&TriggerRepeat::HandleTriggerEvent, this));\n    }\n}\n\nvoid TriggerRepeat::OnRetain() {\n    if (collidedEntity && collidedEntity->GetComponent<Component::RigidBody>()) {\n        Component::RigidBody* rigidBodyComp = collidedEntity->GetComponent<Component::RigidBody>();\n        Managers().physicsManager->ForgetTriggerEnter(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerRetain(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerLeave(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->OnTriggerRetain(triggerVolume, rigidBodyComp, std::bind(&TriggerRepeat::HandleTriggerEvent, this));\n    }\n}\n\nvoid TriggerRepeat::OnLeave() {\n    if (collidedEntity && collidedEntity->GetComponent<Component::RigidBody>()) {\n        Component::RigidBody* rigidBodyComp = collidedEntity->GetComponent<Component::RigidBody>();\n        Managers().physicsManager->ForgetTriggerEnter(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerRetain(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerLeave(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->OnTriggerLeave(triggerVolume, rigidBodyComp, std::bind(&TriggerRepeat::HandleTriggerEvent, this));\n    }\n}\n\nstd::string TriggerRepeat::GetName() {\n    return name;\n}\n\nvoid TriggerRepeat::SetName(std::string value) {\n    name = value;\n}\n\nstd::string TriggerRepeat::GetTargetFunction() {\n    return targetFunction;\n}\n\nvoid TriggerRepeat::SetTargetFunction(std::string value) {\n    targetFunction = value;\n}\n\nbool TriggerRepeat::GetStartActive() {\n    return startActive;\n}\n\nvoid TriggerRepeat::SetStartActive(bool value) {\n    startActive = value;\n}\n\nfloat TriggerRepeat::GetDelay() {\n    return delay;\n}\n\nvoid TriggerRepeat::SetDelay(float value) {\n    delay = value;\n}\n\nfloat TriggerRepeat::GetCooldown() {\n    return cooldown;\n}\n\nvoid TriggerRepeat::SetCooldown(float value) {\n    cooldown = value;\n}\n\nfloat TriggerRepeat::GetTriggerCharges() {\n    return triggerCharges;\n}\n\nvoid TriggerRepeat::SetTriggerCharges(float value) {\n    triggerCharges = value;\n}\n\nEntity* TriggerRepeat::GetTargetEntity() {\n    return targetEntity;\n}\n\nvoid TriggerRepeat::SetTargetEntity(Entity* value) {\n    targetEntity = value;\n}\n\nEntity* TriggerRepeat::GetCollidedEntity() {\n    return collidedEntity;\n}\n\nvoid TriggerRepeat::SetCollidedEntity(Entity* value) {\n    collidedEntity = value;\n}\n\nvoid TriggerRepeat::HandleTriggerEvent() {\n    triggered = true;\n}\n\nvoid TriggerRepeat::Process() {\n    if (triggered)\n        Managers().scriptManager->ExecuteScriptMethod(targetEntity, targetFunction);\n}\n<commit_msg>Reset trigger tracking after processing a repeat trigger.<commit_after>#include \"TriggerRepeat.hpp\"\n\n#include \"..\/Component\/RigidBody.hpp\"\n#include \"..\/Entity\/Entity.hpp\"\n#include \"..\/Manager\/Managers.hpp\"\n#include \"..\/Manager\/PhysicsManager.hpp\"\n#include \"..\/Manager\/ScriptManager.hpp\"\n\nTriggerRepeat::TriggerRepeat() {\n\n}\n\nTriggerRepeat::~TriggerRepeat() {\n\n}\n\nvoid TriggerRepeat::OnEnter() {\n    if (collidedEntity && collidedEntity->GetComponent<Component::RigidBody>()) {\n        Component::RigidBody* rigidBodyComp = collidedEntity->GetComponent<Component::RigidBody>();\n        Managers().physicsManager->ForgetTriggerEnter(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerRetain(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerLeave(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->OnTriggerEnter(triggerVolume, rigidBodyComp, std::bind(&TriggerRepeat::HandleTriggerEvent, this));\n    }\n}\n\nvoid TriggerRepeat::OnRetain() {\n    if (collidedEntity && collidedEntity->GetComponent<Component::RigidBody>()) {\n        Component::RigidBody* rigidBodyComp = collidedEntity->GetComponent<Component::RigidBody>();\n        Managers().physicsManager->ForgetTriggerEnter(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerRetain(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerLeave(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->OnTriggerRetain(triggerVolume, rigidBodyComp, std::bind(&TriggerRepeat::HandleTriggerEvent, this));\n    }\n}\n\nvoid TriggerRepeat::OnLeave() {\n    if (collidedEntity && collidedEntity->GetComponent<Component::RigidBody>()) {\n        Component::RigidBody* rigidBodyComp = collidedEntity->GetComponent<Component::RigidBody>();\n        Managers().physicsManager->ForgetTriggerEnter(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerRetain(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->ForgetTriggerLeave(triggerVolume, rigidBodyComp);\n        Managers().physicsManager->OnTriggerLeave(triggerVolume, rigidBodyComp, std::bind(&TriggerRepeat::HandleTriggerEvent, this));\n    }\n}\n\nstd::string TriggerRepeat::GetName() {\n    return name;\n}\n\nvoid TriggerRepeat::SetName(std::string value) {\n    name = value;\n}\n\nstd::string TriggerRepeat::GetTargetFunction() {\n    return targetFunction;\n}\n\nvoid TriggerRepeat::SetTargetFunction(std::string value) {\n    targetFunction = value;\n}\n\nbool TriggerRepeat::GetStartActive() {\n    return startActive;\n}\n\nvoid TriggerRepeat::SetStartActive(bool value) {\n    startActive = value;\n}\n\nfloat TriggerRepeat::GetDelay() {\n    return delay;\n}\n\nvoid TriggerRepeat::SetDelay(float value) {\n    delay = value;\n}\n\nfloat TriggerRepeat::GetCooldown() {\n    return cooldown;\n}\n\nvoid TriggerRepeat::SetCooldown(float value) {\n    cooldown = value;\n}\n\nfloat TriggerRepeat::GetTriggerCharges() {\n    return triggerCharges;\n}\n\nvoid TriggerRepeat::SetTriggerCharges(float value) {\n    triggerCharges = value;\n}\n\nEntity* TriggerRepeat::GetTargetEntity() {\n    return targetEntity;\n}\n\nvoid TriggerRepeat::SetTargetEntity(Entity* value) {\n    targetEntity = value;\n}\n\nEntity* TriggerRepeat::GetCollidedEntity() {\n    return collidedEntity;\n}\n\nvoid TriggerRepeat::SetCollidedEntity(Entity* value) {\n    collidedEntity = value;\n}\n\nvoid TriggerRepeat::HandleTriggerEvent() {\n    triggered = true;\n}\n\nvoid TriggerRepeat::Process() {\n    if (triggered) {\n        Managers().scriptManager->ExecuteScriptMethod(targetEntity, targetFunction);\n        triggered = false;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ File_Cdxa - Info for CDXA files\r\n\/\/ Copyright (C) 2004-2008 Jerome Martinez, Zen@MediaArea.net\r\n\/\/\r\n\/\/ This library is free software: you can redistribute it and\/or modify it\r\n\/\/ under the terms of the GNU Lesser General Public License as published by\r\n\/\/ the Free Software Foundation, either version 3 of the License, or\r\n\/\/ 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 Lesser General Public License for more details.\r\n\/\/\r\n\/\/ You should have received a copy of the GNU Lesser General Public License\r\n\/\/ along with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n\/\/\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Compilation conditions\r\n#include <MediaInfo\/Setup.h>\r\n#ifdef __BORLANDC__\r\n    #pragma hdrstop\r\n#endif\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#if defined(MEDIAINFO_CDXA_YES)\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/Multiple\/File_Cdxa.h\"\r\n#include \"ZenLib\/Utils.h\"\r\n#include \"MediaInfo\/MediaInfo.h\"\r\nusing namespace ZenLib;\r\n\/\/---------------------------------------------------------------------------\r\n\r\nnamespace MediaInfoLib\r\n{\r\n\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\/\/ Format\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\/\/\r\n\/\/ CDXA = RIFF header + Raw sectors\r\n\/\/ Riff header size = 44\r\n\/\/ Raw sector size = 2352\r\n\/\/\r\n\/\/ Raw sector :\r\n\/\/ Sync             12 bytes (00 FF .. FF 00)\r\n\/\/ Header           4 bytes\r\n\/\/ SubHeader        8 bytes\r\n\/\/ Datas            2324 bytes\r\n\/\/ EDC (CRC)        4 bytes\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\r\n\/\/***************************************************************************\r\n\/\/ Constructor\/Destructor\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nFile_Cdxa::File_Cdxa()\r\n:File__Analyze()\r\n{\r\n    \/\/Basic configuration\r\n    Synched=false;\r\n    File_MaximumOffset=64*1024;\r\n    Frame_Count_Valid=16;\r\n\r\n    \/\/Buffer\r\n    Element_Size=0;\r\n\r\n    \/\/Temp - Global\r\n    Frame_Count=0;\r\n\r\n    \/\/Pointers\r\n    MI=NULL;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nFile_Cdxa::~File_Cdxa()\r\n{\r\n    delete MI; \/\/MI=NULL;\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Format\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::Read_Buffer_Finalize ()\r\n{\r\n    \/\/If nothing\r\n    if (MI->Info==NULL|| MI->Count_Get(Stream_General)==0)\r\n    {\r\n        Fill(Stream_General, 0, General_Format, \"CDXA\");\r\n    }\r\n    else\r\n    {\r\n\r\n        \/\/General\r\n        Open_Buffer_Finalize(MI);\r\n        Merge(*(MI->Info));\r\n        Merge(*(MI->Info), Stream_General, 0, 0);\r\n        const Ztring &Format=Retrieve(Stream_General, 0, General_Format);\r\n        Fill(Stream_General, 0, General_Format, (Ztring(_T(\"CDXA\/\"))+Format).c_str(), Unlimited, true);\r\n        Fill(Stream_General, 0, General_Duration, \"\", Unlimited, true);\r\n        Fill(Stream_Video, 0, Video_Duration, \"\", Unlimited, true);\r\n    }\r\n\r\n    \/\/Purge what is not needed anymore\r\n    if (!File_Name.empty()) \/\/Only if this is not a buffer, with buffer we can have more data\r\n    {\r\n        delete MI; MI=NULL;\r\n    }\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Buffer\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ RIFF Header, 44 bytes\r\n\/\/ RIFF header                      4 bytes, Pos=0\r\n\/\/ RIFF data size                   4 bytes, Pos=4\r\n\/\/ Format (CDXA)                    4 bytes, Pos=8\r\n\/\/ Format Header                    4 bytes, Pos=12\r\n\/\/ Format Size                      4 bytes, Pos=16\r\n\/\/ Format user_id                   2 bytes, Pos=20\r\n\/\/ Format group_id                  2 bytes, Pos=22\r\n\/\/ Format attributes                2 bytes, Pos=24\r\n\/\/ Format xa_signature              2 bytes, Pos=26 (\"XA\")\r\n\/\/ Format xa_track_number           4 bytes, Pos=28\r\n\/\/ Format Reserved                  4 bytes, Pos=32\r\n\/\/ Data Header                      4 bytes, Pos=36\r\n\/\/ Data Size                        4 bytes, Pos=40\r\n\/\/\r\n\/\/ Attributes (big endian):\r\n\/\/ 15 Directory\r\n\/\/ 14 CDDA\r\n\/\/ 13 Interleaved\r\n\/\/ 12 Mode2Form2 --> 2324 bytes\/block\r\n\/\/ 11 Mode2Form1 --> 2048 bytes\/block\r\n\/\/ 10 Exec_Other\r\n\/\/ 09 Reserved\r\n\/\/ 08 Read_Other\r\n\/\/ 07 Reserved\r\n\/\/ 06 Exec_Group\r\n\/\/ 05 Reserved\r\n\/\/ 04 Read_Group\r\n\/\/ 03 Reserved\r\n\/\/ 02 Exec_User\r\n\/\/ 01 Reserved\r\n\/\/ 00 Read_User\r\n\/\/\r\nvoid File_Cdxa::FileHeader_Parse()\r\n{\r\n    if (Element_Size<44)\r\n    {\r\n        Element_WaitForMoreData();\r\n        return;\r\n    }\r\n\r\n    \/\/Parsing\r\n    if (                CC4(Buffer+Buffer_Offset+0x00)!=CC4(\"RIFF\")\r\n     || LittleEndian2int32u(Buffer+Buffer_Offset+0x04)!=LittleEndian2int32u(Buffer+Buffer_Offset+0x28)+0x24 \/\/Sizes of chunks\r\n     ||                 CC4(Buffer+Buffer_Offset+0x08)!=CC4(\"CDXA\")\r\n     ||                 CC4(Buffer+Buffer_Offset+0x0C)!=CC4(\"fmt \")\r\n     || LittleEndian2int32u(Buffer+Buffer_Offset+0x10)!=0x10\r\n     ||                 CC4(Buffer+Buffer_Offset+0x24)!=CC4(\"data\")\r\n       )\r\n    {\r\n        Finnished();\r\n        return;\r\n    }\r\n\r\n    \/\/Parsing\r\n    Element_Begin(\"CDXA header\");\r\n    Skip_C4(                                                    \"RIFF header\");\r\n    Skip_L4(                                                    \"RIFF data size\");\r\n    Skip_C4(                                                    \"CDXA\");\r\n    Skip_C4(                                                    \"fmt header\");\r\n    Skip_L4(                                                    \"fmt size\");\r\n    Skip_L2(                                                    \"user_id\");\r\n    Skip_L2(                                                    \"group_id\");\r\n    Skip_L2(                                                    \"attributes\");\r\n    Skip_C2(                                                    \"xa_signature\");\r\n    Skip_L4(                                                    \"xa_track_number\");\r\n    Skip_L4(                                                    \"reserved\");\r\n    Skip_C4(                                                    \"data header\");\r\n    Skip_L4(                                                    \"data size\");\r\n    Element_End();\r\n\r\n    FILLING_BEGIN();\r\n        if (MI==NULL)\r\n        {\r\n            MI=new MediaInfo_Internal;\r\n            MI->Option(_T(\"File_IsSub\"), _T(\"1\"));\r\n        }\r\n        \r\n        Stream_Prepare(Stream_General);\r\n    FILLING_END();\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nbool File_Cdxa::Header_Begin()\r\n{\r\n    \/\/Must have enough buffer for having header\r\n    if (Buffer_Offset+12>Buffer_Size)\r\n        return false;\r\n\r\n    \/\/Quick test of synchro\r\n    if (Synched && !(CC8(Buffer+Buffer_Offset)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+8)==0xFFFFFF00))\r\n    {\r\n        Trusted_IsNot(\"CDXA, Synchronisation lost\");\r\n        Synched=false;\r\n    }\r\n\r\n    \/\/Synchro\r\n    if (!Synched && !Synchronize())\r\n        return false;\r\n\r\n    \/\/All should be OK...\r\n    return true;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::Header_Parse()\r\n{\r\n    \/\/Parsing\r\n    Skip_B4(                                                    \"Sync1\");\r\n    Skip_B4(                                                    \"Sync2\");\r\n    Skip_B4(                                                    \"Sync3\");\r\n    Skip_B4(                                                    \"Header\");\r\n    Skip_B8(                                                    \"SubHeader\");\r\n\r\n    \/\/Filling\r\n    Header_Fill_Size(2352);\r\n    Header_Fill_Code(0, \"Chunk\");\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::Data_Parse()\r\n{\r\n    if (MI==NULL)\r\n    {\r\n        \/\/Where is the header? --> Problem\r\n        Finnished();\r\n        return;\r\n    }\r\n\r\n    \/\/CRC or not?\r\n    int64u CRC_Size=4;\r\n    if (Element_Size!=2328)\r\n        CRC_Size=0;\r\n\r\n    \/\/Parsing\r\n    Skip_XX(Element_Size-CRC_Size,                              \"Data\");\r\n    if (CRC_Size>0)\r\n        Skip_B4(                                                \"CRC\");\r\n\r\n    \/\/Preparing to fill MediaInfo with a buffer\r\n    MI->Open_Buffer_Init(File_Size, File_Offset+Buffer_Offset);\r\n\r\n    \/\/Sending the buffer to MediaInfo\r\n    if (MI->Open_Buffer_Continue(Buffer+Buffer_Offset, (size_t)(Element_Size-CRC_Size))==0)\r\n        Finnished(); \/\/Get out of the loop, there was an error during the parsing\r\n\r\n    \/\/Testing if MediaInfo always need data\r\n    File_GoTo=MI->Open_Buffer_Continue_GoTo_Get();\r\n    if (File_GoTo!=(int64u)-1)\r\n        Info(\"CDXA, Jumping to end of file\");\r\n\r\n    \/\/Details\r\n    #ifndef MEDIAINFO_MINIMIZESIZE\r\n    if (MediaInfoLib::Config.Details_Get())\r\n    {\r\n        if (!MI->Inform().empty())\r\n            Element_Show_Add(MI->Inform());\r\n    }\r\n    #endif \/\/MEDIAINFO_MINIMIZESIZE\r\n\r\n    \/\/Demux\r\n    Demux(Buffer+Buffer_Offset, (size_t)(Element_Size-CRC_Size), _T(\"xxx\"));\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Elements\r\n\/\/***************************************************************************\r\n\r\n\/\/***************************************************************************\r\n\/\/ Helpers\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nbool File_Cdxa::Synchronize()\r\n{\r\n    \/\/Synchronizing\r\n    while (           Buffer_Offset+2352*3+12<=Buffer_Size\r\n      && !(CC8(Buffer+Buffer_Offset+2352*0)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+2352*0+8)==0xFFFFFF00\r\n        && CC8(Buffer+Buffer_Offset+2352*1)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+2352*1+8)==0xFFFFFF00\r\n        && CC8(Buffer+Buffer_Offset+2352*2)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+2352*2+8)==0xFFFFFF00\r\n        && CC8(Buffer+Buffer_Offset+2352*3)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+2352*3+8)==0xFFFFFF00))\r\n        Buffer_Offset++;\r\n    if (Buffer_Offset+2352*3+12>Buffer_Size)\r\n    {\r\n        return false;\r\n    }\r\n\r\n    \/\/Synched is OK\r\n    Synched=true;\r\n    return true;\r\n}\r\n\r\n    \/*\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::Detect_EOF()\r\n{\r\n    \/\/Jump to the end of the file\r\n    if (File_Size!=(int64u)-1 && File_Size>File_Offset+Buffer_Size+1*1024*1024 && (\r\n       (File_Offset>1*1024*1024)\r\n    || (MI!=NULL && MI->Open_Buffer_Continue_GoTo_Get()!=(int64u)-1)\r\n    ))\r\n    {\r\n        Info(\"CDXA, Jumping to end of file\");\r\n        File_GoTo=File_Size-1*1024*1024;\r\n    }\r\n}\r\n    *\/\r\n\r\n\/\/***************************************************************************\r\n\/\/ Information\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::HowTo(stream_t StreamKind)\r\n{\r\n    switch (StreamKind)\r\n    {\r\n        case (Stream_General) :\r\n            Fill_HowTo(\"Format\", \"R\");\r\n            break;\r\n        case (Stream_Video) :\r\n            Fill_HowTo(\"Codec\", \"R\");\r\n            Fill_HowTo(\"BitRate\", \"R|Overall BitRate - Audio BitRates\");\r\n            Fill_HowTo(\"Width\", \"R\");\r\n            Fill_HowTo(\"Height\", \"R\");\r\n            Fill_HowTo(\"DisplayAspectRatio\", \"R\");\r\n            break;\r\n        case (Stream_Audio) :\r\n            break;\r\n        case (Stream_Text) :\r\n            break;\r\n        case (Stream_Chapters) :\r\n            break;\r\n        case (Stream_Image) :\r\n            break;\r\n        case (Stream_Menu) :\r\n            break;\r\n        case (Stream_Max) :\r\n            break;\r\n    }\r\n}\r\n\r\n} \/\/NameSpace\r\n\r\n#endif \/\/MEDIAINFO_CDXA_YES\r\n\r\n<commit_msg>Improving Library detection<commit_after>\/\/ File_Cdxa - Info for CDXA files\r\n\/\/ Copyright (C) 2004-2008 Jerome Martinez, Zen@MediaArea.net\r\n\/\/\r\n\/\/ This library is free software: you can redistribute it and\/or modify it\r\n\/\/ under the terms of the GNU Lesser General Public License as published by\r\n\/\/ the Free Software Foundation, either version 3 of the License, or\r\n\/\/ 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 Lesser General Public License for more details.\r\n\/\/\r\n\/\/ You should have received a copy of the GNU Lesser General Public License\r\n\/\/ along with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n\/\/\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Compilation conditions\r\n#include <MediaInfo\/Setup.h>\r\n#ifdef __BORLANDC__\r\n    #pragma hdrstop\r\n#endif\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#if defined(MEDIAINFO_CDXA_YES)\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/Multiple\/File_Cdxa.h\"\r\n#include \"ZenLib\/Utils.h\"\r\n#include \"MediaInfo\/MediaInfo.h\"\r\nusing namespace ZenLib;\r\n\/\/---------------------------------------------------------------------------\r\n\r\nnamespace MediaInfoLib\r\n{\r\n\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\/\/ Format\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\/\/\r\n\/\/ CDXA = RIFF header + Raw sectors\r\n\/\/ Riff header size = 44\r\n\/\/ Raw sector size = 2352\r\n\/\/\r\n\/\/ Raw sector :\r\n\/\/ Sync             12 bytes (00 FF .. FF 00)\r\n\/\/ Header           4 bytes\r\n\/\/ SubHeader        8 bytes\r\n\/\/ Datas            2324 bytes\r\n\/\/ EDC (CRC)        4 bytes\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\r\n\/\/***************************************************************************\r\n\/\/ Constructor\/Destructor\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nFile_Cdxa::File_Cdxa()\r\n:File__Analyze()\r\n{\r\n    \/\/Basic configuration\r\n    Synched=false;\r\n    File_MaximumOffset=64*1024;\r\n    Frame_Count_Valid=16;\r\n\r\n    \/\/Buffer\r\n    Element_Size=0;\r\n\r\n    \/\/Temp - Global\r\n    Frame_Count=0;\r\n\r\n    \/\/Pointers\r\n    MI=NULL;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nFile_Cdxa::~File_Cdxa()\r\n{\r\n    delete MI; \/\/MI=NULL;\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Format\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::Read_Buffer_Finalize ()\r\n{\r\n    \/\/If nothing\r\n    if (MI->Info==NULL|| MI->Count_Get(Stream_General)==0)\r\n    {\r\n        Fill(Stream_General, 0, General_Format, \"CDXA\");\r\n    }\r\n    else\r\n    {\r\n\r\n        \/\/General\r\n        Open_Buffer_Finalize(MI->Info);\r\n        Merge(*(MI->Info));\r\n        Merge(*(MI->Info), Stream_General, 0, 0);\r\n        const Ztring &Format=Retrieve(Stream_General, 0, General_Format);\r\n        Fill(Stream_General, 0, General_Format, (Ztring(_T(\"CDXA\/\"))+Format).c_str(), Unlimited, true);\r\n        Fill(Stream_General, 0, General_Duration, \"\", Unlimited, true);\r\n        Fill(Stream_Video, 0, Video_Duration, \"\", Unlimited, true);\r\n    }\r\n\r\n    \/\/Purge what is not needed anymore\r\n    if (!File_Name.empty()) \/\/Only if this is not a buffer, with buffer we can have more data\r\n    {\r\n        delete MI; MI=NULL;\r\n    }\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Buffer\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ RIFF Header, 44 bytes\r\n\/\/ RIFF header                      4 bytes, Pos=0\r\n\/\/ RIFF data size                   4 bytes, Pos=4\r\n\/\/ Format (CDXA)                    4 bytes, Pos=8\r\n\/\/ Format Header                    4 bytes, Pos=12\r\n\/\/ Format Size                      4 bytes, Pos=16\r\n\/\/ Format user_id                   2 bytes, Pos=20\r\n\/\/ Format group_id                  2 bytes, Pos=22\r\n\/\/ Format attributes                2 bytes, Pos=24\r\n\/\/ Format xa_signature              2 bytes, Pos=26 (\"XA\")\r\n\/\/ Format xa_track_number           4 bytes, Pos=28\r\n\/\/ Format Reserved                  4 bytes, Pos=32\r\n\/\/ Data Header                      4 bytes, Pos=36\r\n\/\/ Data Size                        4 bytes, Pos=40\r\n\/\/\r\n\/\/ Attributes (big endian):\r\n\/\/ 15 Directory\r\n\/\/ 14 CDDA\r\n\/\/ 13 Interleaved\r\n\/\/ 12 Mode2Form2 --> 2324 bytes\/block\r\n\/\/ 11 Mode2Form1 --> 2048 bytes\/block\r\n\/\/ 10 Exec_Other\r\n\/\/ 09 Reserved\r\n\/\/ 08 Read_Other\r\n\/\/ 07 Reserved\r\n\/\/ 06 Exec_Group\r\n\/\/ 05 Reserved\r\n\/\/ 04 Read_Group\r\n\/\/ 03 Reserved\r\n\/\/ 02 Exec_User\r\n\/\/ 01 Reserved\r\n\/\/ 00 Read_User\r\n\/\/\r\nvoid File_Cdxa::FileHeader_Parse()\r\n{\r\n    if (Element_Size<44)\r\n    {\r\n        Element_WaitForMoreData();\r\n        return;\r\n    }\r\n\r\n    \/\/Parsing\r\n    if (                CC4(Buffer+Buffer_Offset+0x00)!=CC4(\"RIFF\")\r\n     || LittleEndian2int32u(Buffer+Buffer_Offset+0x04)!=LittleEndian2int32u(Buffer+Buffer_Offset+0x28)+0x24 \/\/Sizes of chunks\r\n     ||                 CC4(Buffer+Buffer_Offset+0x08)!=CC4(\"CDXA\")\r\n     ||                 CC4(Buffer+Buffer_Offset+0x0C)!=CC4(\"fmt \")\r\n     || LittleEndian2int32u(Buffer+Buffer_Offset+0x10)!=0x10\r\n     ||                 CC4(Buffer+Buffer_Offset+0x24)!=CC4(\"data\")\r\n       )\r\n    {\r\n        Finnished();\r\n        return;\r\n    }\r\n\r\n    \/\/Parsing\r\n    Element_Begin(\"CDXA header\");\r\n    Skip_C4(                                                    \"RIFF header\");\r\n    Skip_L4(                                                    \"RIFF data size\");\r\n    Skip_C4(                                                    \"CDXA\");\r\n    Skip_C4(                                                    \"fmt header\");\r\n    Skip_L4(                                                    \"fmt size\");\r\n    Skip_L2(                                                    \"user_id\");\r\n    Skip_L2(                                                    \"group_id\");\r\n    Skip_L2(                                                    \"attributes\");\r\n    Skip_C2(                                                    \"xa_signature\");\r\n    Skip_L4(                                                    \"xa_track_number\");\r\n    Skip_L4(                                                    \"reserved\");\r\n    Skip_C4(                                                    \"data header\");\r\n    Skip_L4(                                                    \"data size\");\r\n    Element_End();\r\n\r\n    FILLING_BEGIN();\r\n        if (MI==NULL)\r\n        {\r\n            MI=new MediaInfo_Internal;\r\n            MI->Option(_T(\"File_IsSub\"), _T(\"1\"));\r\n        }\r\n        \r\n        Stream_Prepare(Stream_General);\r\n    FILLING_END();\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nbool File_Cdxa::Header_Begin()\r\n{\r\n    \/\/Must have enough buffer for having header\r\n    if (Buffer_Offset+12>Buffer_Size)\r\n        return false;\r\n\r\n    \/\/Quick test of synchro\r\n    if (Synched && !(CC8(Buffer+Buffer_Offset)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+8)==0xFFFFFF00))\r\n    {\r\n        Trusted_IsNot(\"CDXA, Synchronisation lost\");\r\n        Synched=false;\r\n    }\r\n\r\n    \/\/Synchro\r\n    if (!Synched && !Synchronize())\r\n        return false;\r\n\r\n    \/\/All should be OK...\r\n    return true;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::Header_Parse()\r\n{\r\n    \/\/Parsing\r\n    Skip_B4(                                                    \"Sync1\");\r\n    Skip_B4(                                                    \"Sync2\");\r\n    Skip_B4(                                                    \"Sync3\");\r\n    Skip_B4(                                                    \"Header\");\r\n    Skip_B8(                                                    \"SubHeader\");\r\n\r\n    \/\/Filling\r\n    Header_Fill_Size(2352);\r\n    Header_Fill_Code(0, \"Chunk\");\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::Data_Parse()\r\n{\r\n    if (MI==NULL)\r\n    {\r\n        \/\/Where is the header? --> Problem\r\n        Finnished();\r\n        return;\r\n    }\r\n\r\n    \/\/CRC or not?\r\n    int64u CRC_Size=4;\r\n    if (Element_Size!=2328)\r\n        CRC_Size=0;\r\n\r\n    \/\/Parsing\r\n    Skip_XX(Element_Size-CRC_Size,                              \"Data\");\r\n    if (CRC_Size>0)\r\n        Skip_B4(                                                \"CRC\");\r\n\r\n    \/\/Preparing to fill MediaInfo with a buffer\r\n    MI->Open_Buffer_Init(File_Size, File_Offset+Buffer_Offset);\r\n\r\n    \/\/Sending the buffer to MediaInfo\r\n    if (MI->Open_Buffer_Continue(Buffer+Buffer_Offset, (size_t)(Element_Size-CRC_Size))==0)\r\n        Finnished(); \/\/Get out of the loop, there was an error during the parsing\r\n\r\n    \/\/Testing if MediaInfo always need data\r\n    File_GoTo=MI->Open_Buffer_Continue_GoTo_Get();\r\n    if (File_GoTo!=(int64u)-1)\r\n        Info(\"CDXA, Jumping to end of file\");\r\n\r\n    \/\/Details\r\n    #ifndef MEDIAINFO_MINIMIZESIZE\r\n    if (MediaInfoLib::Config.Details_Get())\r\n    {\r\n        if (!MI->Inform().empty())\r\n            Element_Show_Add(MI->Inform());\r\n    }\r\n    #endif \/\/MEDIAINFO_MINIMIZESIZE\r\n\r\n    \/\/Demux\r\n    Demux(Buffer+Buffer_Offset, (size_t)(Element_Size-CRC_Size), _T(\"xxx\"));\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Elements\r\n\/\/***************************************************************************\r\n\r\n\/\/***************************************************************************\r\n\/\/ Helpers\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nbool File_Cdxa::Synchronize()\r\n{\r\n    \/\/Synchronizing\r\n    while (           Buffer_Offset+2352*3+12<=Buffer_Size\r\n      && !(CC8(Buffer+Buffer_Offset+2352*0)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+2352*0+8)==0xFFFFFF00\r\n        && CC8(Buffer+Buffer_Offset+2352*1)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+2352*1+8)==0xFFFFFF00\r\n        && CC8(Buffer+Buffer_Offset+2352*2)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+2352*2+8)==0xFFFFFF00\r\n        && CC8(Buffer+Buffer_Offset+2352*3)==0x00FFFFFFFFFFFFFFLL && CC4(Buffer+Buffer_Offset+2352*3+8)==0xFFFFFF00))\r\n        Buffer_Offset++;\r\n    if (Buffer_Offset+2352*3+12>Buffer_Size)\r\n    {\r\n        return false;\r\n    }\r\n\r\n    \/\/Synched is OK\r\n    Synched=true;\r\n    return true;\r\n}\r\n\r\n    \/*\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::Detect_EOF()\r\n{\r\n    \/\/Jump to the end of the file\r\n    if (File_Size!=(int64u)-1 && File_Size>File_Offset+Buffer_Size+1*1024*1024 && (\r\n       (File_Offset>1*1024*1024)\r\n    || (MI!=NULL && MI->Open_Buffer_Continue_GoTo_Get()!=(int64u)-1)\r\n    ))\r\n    {\r\n        Info(\"CDXA, Jumping to end of file\");\r\n        File_GoTo=File_Size-1*1024*1024;\r\n    }\r\n}\r\n    *\/\r\n\r\n\/\/***************************************************************************\r\n\/\/ Information\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_Cdxa::HowTo(stream_t StreamKind)\r\n{\r\n    switch (StreamKind)\r\n    {\r\n        case (Stream_General) :\r\n            Fill_HowTo(\"Format\", \"R\");\r\n            break;\r\n        case (Stream_Video) :\r\n            Fill_HowTo(\"Codec\", \"R\");\r\n            Fill_HowTo(\"BitRate\", \"R|Overall BitRate - Audio BitRates\");\r\n            Fill_HowTo(\"Width\", \"R\");\r\n            Fill_HowTo(\"Height\", \"R\");\r\n            Fill_HowTo(\"DisplayAspectRatio\", \"R\");\r\n            break;\r\n        case (Stream_Audio) :\r\n            break;\r\n        case (Stream_Text) :\r\n            break;\r\n        case (Stream_Chapters) :\r\n            break;\r\n        case (Stream_Image) :\r\n            break;\r\n        case (Stream_Menu) :\r\n            break;\r\n        case (Stream_Max) :\r\n            break;\r\n    }\r\n}\r\n\r\n} \/\/NameSpace\r\n\r\n#endif \/\/MEDIAINFO_CDXA_YES\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of TelepathyQt4\n *\n * Copyright (C) 2008 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * Copyright (C) 2008 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\/Client\/AccountManager>\n#include \"TelepathyQt4\/Client\/account-manager-internal.h\"\n\n#include \"TelepathyQt4\/Client\/_gen\/account-manager.moc.hpp\"\n#include \"TelepathyQt4\/Client\/_gen\/account-manager-internal.moc.hpp\"\n#include \"TelepathyQt4\/_gen\/cli-account-manager.moc.hpp\"\n#include \"TelepathyQt4\/_gen\/cli-account-manager-body.hpp\"\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\n#include <TelepathyQt4\/Client\/PendingSuccess>\n#include <TelepathyQt4\/Constants>\n\n#include <QQueue>\n#include <QSet>\n#include <QTimer>\n\n\/**\n * \\addtogroup clientsideproxies Client-side proxies\n *\n * Proxy objects representing remote service objects accessed via D-Bus.\n *\n * In addition to providing direct access to methods, signals and properties\n * exported by the remote objects, some of these proxies offer features like\n * automatic inspection of remote object capabilities, property tracking,\n * backwards compatibility helpers for older services and other utilities.\n *\/\n\n\/**\n * \\defgroup clientaccount Account and Account Manager proxies\n * \\ingroup clientsideproxies\n *\n * Proxy objects representing the Telepathy Account Manager and the Accounts\n * that it manages, and their optional interfaces.\n *\/\n\nnamespace Telepathy\n{\nnamespace Client\n{\n\nAccountManager::Private::PendingReady::PendingReady(AccountManager *parent)\n    : PendingOperation(parent)\n{\n}\n\nAccountManager::Private::Private(AccountManager *parent)\n    : QObject(parent),\n      baseInterface(new AccountManagerInterface(parent->dbusConnection(),\n                            parent->busName(), parent->objectPath(), parent)),\n      ready(false),\n      pendingReady(0),\n      introspectQueue(),\n      features(0)\n{\n    debug() << \"Creating new AccountManager:\" << parent->busName();\n\n    connect(baseInterface,\n            SIGNAL(AccountValidityChanged(const QDBusObjectPath &, bool)),\n            SLOT(onAccountValidityChanged(const QDBusObjectPath &, bool)));\n    connect(baseInterface,\n            SIGNAL(AccountRemoved(const QDBusObjectPath &)),\n            SLOT(onAccountRemoved(const QDBusObjectPath &)));\n\n    introspectQueue.enqueue(&Private::callGetAll);\n    QTimer::singleShot(0, this, SLOT(continueIntrospection()));\n}\n\nAccountManager::Private::~Private()\n{\n}\n\nvoid AccountManager::Private::callGetAll()\n{\n    debug() << \"Calling Properties::GetAll(AccountManager)\";\n    AccountManager *am = static_cast<AccountManager *>(parent());\n    QDBusPendingCallWatcher *watcher = new QDBusPendingCallWatcher(\n            am->propertiesInterface()->GetAll(\n                TELEPATHY_INTERFACE_ACCOUNT_MANAGER), this);\n    connect(watcher,\n            SIGNAL(finished(QDBusPendingCallWatcher *)),\n            SLOT(onGetAllAccountManagerReturn(QDBusPendingCallWatcher *)));\n}\n\nvoid AccountManager::Private::setAccountPaths(QSet<QDBusObjectPath> &set,\n        const QVariant &variant)\n{\n    Telepathy::ObjectPathList paths = qdbus_cast<Telepathy::ObjectPathList>(variant);\n\n    if (paths.size() == 0) {\n        \/\/ maybe the AccountManager is buggy, like Mission Control\n        \/\/ 5.0.beta45, and returns an array of strings rather than\n        \/\/ an array of object paths?\n\n        QStringList wronglyTypedPaths = qdbus_cast<QStringList>(variant);\n        if (wronglyTypedPaths.size() > 0) {\n            warning() << \"AccountManager returned wrong type \"\n                \"(expected 'ao', got 'as'); working around it\";\n            Q_FOREACH (QString path, wronglyTypedPaths) {\n                paths << QDBusObjectPath(path);\n            }\n        }\n    }\n\n    Q_FOREACH (const QDBusObjectPath &path, paths) {\n        set << path;\n    }\n}\n\nvoid AccountManager::Private::onGetAllAccountManagerReturn(\n        QDBusPendingCallWatcher *watcher)\n{\n    QDBusPendingReply<QVariantMap> reply = *watcher;\n    QVariantMap props;\n\n    if (!reply.isError()) {\n        debug() << \"Got reply to Properties.GetAll(AccountManager)\";\n        props = reply.value();\n    } else {\n        warning().nospace() <<\n            \"GetAll(AccountManager) failed: \" <<\n            reply.error().name() << \": \" << reply.error().message();\n    }\n\n    if (props.contains(\"Interfaces\")) {\n        interfaces = qdbus_cast<QStringList>(props[\"Interfaces\"]);\n    }\n\n    if (props.contains(\"ValidAccounts\")) {\n        setAccountPaths(validAccountPaths,\n                props[\"ValidAccounts\"]);\n    }\n\n    if (props.contains(\"InvalidAccounts\")) {\n        setAccountPaths(invalidAccountPaths,\n                props[\"InvalidAccounts\"]);\n    }\n\n    continueIntrospection();\n}\n\nvoid AccountManager::Private::onAccountValidityChanged(const QDBusObjectPath &path,\n        bool nowValid)\n{\n    bool newAccount = false;\n\n    if (!validAccountPaths.contains(path) && !invalidAccountPaths.contains(path)) {\n        newAccount = true;\n    }\n\n    if (nowValid) {\n        debug() << \"Account created or became valid:\" << path.path();\n        invalidAccountPaths.remove(path);\n        validAccountPaths.insert(path);\n    }\n    else {\n        debug() << \"Account became invalid:\" << path.path();\n        validAccountPaths.remove(path);\n        invalidAccountPaths.insert(path);\n    }\n\n    if (newAccount) {\n        Q_EMIT accountCreated(path);\n        \/\/ if the newly created account is invalid (shouldn't be the case)\n        \/\/ emit also accountValidityChanged indicating this\n        if (!nowValid) {\n            Q_EMIT accountValidityChanged(path, nowValid);\n        }\n    }\n    else {\n        Q_EMIT accountValidityChanged(path, nowValid);\n    }\n}\n\nvoid AccountManager::Private::onAccountRemoved(const QDBusObjectPath &path)\n{\n    debug() << \"Account removed:\" << path.path();\n    validAccountPaths.remove(path);\n    invalidAccountPaths.remove(path);\n\n    Q_EMIT accountRemoved(path);\n}\n\nvoid AccountManager::Private::continueIntrospection()\n{\n    if (!ready) {\n        if (introspectQueue.isEmpty()) {\n            debug() << \"AccountManager is ready\";\n            ready = true;\n\n            if (pendingReady) {\n                pendingReady->setFinished();\n                \/\/ it will delete itself later\n                pendingReady = 0;\n            }\n        }\n        else {\n            (this->*(introspectQueue.dequeue()))();\n        }\n    }\n}\n\n\/**\n * \\class AccountManager\n * \\ingroup clientaccount\n * \\headerfile TelepathyQt4\/Client\/account-manager.h> <TelepathyQt4\/Client\/AccountManager>\n *\n * Object representing a Telepathy account manager.\n *\n * \\param parent Object parent.\n *\/\nAccountManager::AccountManager(QObject* parent)\n    : StatelessDBusProxy(QDBusConnection::sessionBus(),\n            QLatin1String(TELEPATHY_ACCOUNT_MANAGER_BUS_NAME),\n            QLatin1String(TELEPATHY_ACCOUNT_MANAGER_OBJECT_PATH), parent),\n      mPriv(new Private(this))\n{\n    init();\n}\n\n\/**\n * \\class AccountManager\n * \\ingroup clientaccount\n * \\headerfile TelepathyQt4\/Client\/account-manager.h> <TelepathyQt4\/Client\/AccountManager>\n *\n * Object representing a Telepathy account manager.\n *\n * \\param bus QDBusConnection to use.\n * \\param parent Object parent.\n *\/\nAccountManager::AccountManager(const QDBusConnection& bus,\n        QObject* parent)\n    : StatelessDBusProxy(bus,\n            QLatin1String(TELEPATHY_ACCOUNT_MANAGER_BUS_NAME),\n            QLatin1String(TELEPATHY_ACCOUNT_MANAGER_OBJECT_PATH), parent),\n      mPriv(new Private(this))\n{\n    init();\n}\n\n\/**\n * Class destructor.\n *\/\nAccountManager::~AccountManager()\n{\n    delete mPriv;\n}\n\nQStringList AccountManager::interfaces() const\n{\n    return mPriv->interfaces;\n}\n\n\/**\n * \\fn DBus::propertiesInterface *AccountManager::propertiesInterface() const\n *\n * Convenience function for getting a Properties interface proxy. The\n * AccountManager interface relies on properties, so this interface is\n * always assumed to be present.\n *\/\n\n\/**\n * Return a list of QDBusObjectPath for all valid accounts.\n *\n * \\return A list of QDBusObjectPath.\n *\/\nTelepathy::ObjectPathList AccountManager::validAccountPaths() const\n{\n    Telepathy::ObjectPathList result;\n    result.append(mPriv->validAccountPaths.values());\n    return result;\n}\n\n\/**\n * Return a list of QDBusObjectPath for all invalid accounts.\n *\n * \\return A list of QDBusObjectPath.\n *\/\nTelepathy::ObjectPathList AccountManager::invalidAccountPaths() const\n{\n    Telepathy::ObjectPathList result;\n    result.append(mPriv->invalidAccountPaths.values());\n    return result;\n}\n\n\/**\n * Return a list of QDBusObjectPath for all accounts.\n *\n * \\return A list of QDBusObjectPath.\n *\/\nTelepathy::ObjectPathList AccountManager::allAccountPaths() const\n{\n    ObjectPathList result;\n    result.append(mPriv->validAccountPaths.values());\n    result.append(mPriv->invalidAccountPaths.values());\n    return result;\n}\n\n#if 0\n\/**\n * Return a list of pending operations for all valid accounts from which\n * Accounts can be retrieved if it succeeds.\n *\n * Note that the account objects won't be cached by account manager, and\n * should be done by the application itself.\n *\n * \\return A list of PendingAccount which each one will emit\n *         PendingAccount::finished when it has finished or failed creating the\n *         account object.\n *\/\nPendingAccounts *AccountManager::validAccounts() const\n{\n    return 0;\n}\n\n\/**\n * Return a list of pending operations for all invalid accounts from which\n * Accounts can be retrieved if it succeeds.\n *\n * Note that the account objects won't be cached by account manager, and\n * should be done by the application itself.\n *\n * \\return A list of PendingAccount which each one will emit\n *         PendingAccount::finished when it has finished or failed creating the\n *         account object.\n *\/\nPendingAccounts *AccountManager::invalidAccounts() const\n{\n    return 0;\n}\n\n\/**\n * Return a list of pending operations for all accounts from which\n * Accounts can be retrieved if it succeeds.\n *\n * Note that the account objects won't be cached by account manager, and\n * should be done by the application itself.\n *\n * \\return A list of PendingAccount which each one will emit\n *         PendingAccount::finished when it has finished or failed creating the\n *         account object.\n *\/\nPendingAccounts *AccountManager::allAccounts() const\n{\n    return 0;\n}\n\nPendingAccount *AccountManager::accountForPath(const QString &path) const\n{\n    return 0;\n}\n\n\/**\n * Create an account with the given parameters.\n *\n * Return a pending operation representing the account which will succeed\n * when the account has been created or fail if an error occurred.\n *\n * \\param connectionManager Name of the connection manager to create the account for.\n * \\param protocol Name of the protocol to create the account for.\n * \\param displayName Account display name.\n * \\param parameters Account parameters.\n * \\return A PendingOperation which will emit PendingAccount::finished\n *         when the account has been created of failed its creation process.\n *\/\nPendingAccount *AccountManager::createAccount(const QString &connectionManager,\n        const QString &protocol, const QString &displayName,\n        const QVariantMap &parameters)\n{\n    return 0;\n}\n#endif\n\n\/**\n * Return whether this object has finished its initial setup.\n *\n * This is mostly useful as a sanity check, in code that shouldn't be run\n * until the object is ready. To wait for the object to be ready, call\n * becomeReady() and connect to the finished signal on the result.\n *\n * \\param features Which features should be tested.\n * \\return \\c true if the object has finished initial setup.\n *\/\nbool AccountManager::isReady(Features features) const\n{\n    return mPriv->ready\n        && ((mPriv->features & features) == features);\n}\n\n\/**\n * Return a pending operation which will succeed when this object finishes\n * its initial setup, or will fail if a fatal error occurs during this\n * initial setup.\n *\n * \\param features Which features should be tested.\n * \\return A PendingOperation which will emit PendingOperation::finished\n *         when this object has finished or failed its initial setup.\n *\/\nPendingOperation *AccountManager::becomeReady(Features features)\n{\n    if (isReady(features)) {\n        return new PendingSuccess(this);\n    }\n\n    if (features != 0) {\n        return new PendingFailure(this, \"org.freedesktop.Telepathy.Qt.DoesntWork\",\n                \"Unimplemented\");\n    }\n\n    if (!mPriv->pendingReady) {\n        mPriv->pendingReady = new Private::PendingReady(this);\n    }\n    return mPriv->pendingReady;\n}\n\n\/**\n * Get the AccountManagerInterface for this AccountManager. This\n * method is protected since the convenience methods provided by this\n * class should generally be used instead of calling D-Bus methods\n * directly.\n *\n * \\return A pointer to the existing AccountManagerInterface for this\n *         AccountManager.\n *\/\nAccountManagerInterface *AccountManager::baseInterface() const\n{\n    return mPriv->baseInterface;\n}\n\nvoid AccountManager::init()\n{\n    connect(mPriv,\n            SIGNAL(accountCreated(const QDBusObjectPath &)),\n            SIGNAL(accountCreated(const QDBusObjectPath &)));\n    connect(mPriv,\n            SIGNAL(accountRemoved(const QDBusObjectPath &)),\n            SIGNAL(accountRemoved(const QDBusObjectPath &)));\n    connect(mPriv,\n            SIGNAL(accountValidityChanged(const QDBusObjectPath &, bool)),\n            SIGNAL(accountValidityChanged(const QDBusObjectPath &, bool)));\n}\n\n} \/\/ Telepathy::Client\n} \/\/ Telepathy\n<commit_msg>Updated AccountManager documentation.<commit_after>\/*\n * This file is part of TelepathyQt4\n *\n * Copyright (C) 2008 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * Copyright (C) 2008 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\/Client\/AccountManager>\n#include \"TelepathyQt4\/Client\/account-manager-internal.h\"\n\n#include \"TelepathyQt4\/Client\/_gen\/account-manager.moc.hpp\"\n#include \"TelepathyQt4\/Client\/_gen\/account-manager-internal.moc.hpp\"\n#include \"TelepathyQt4\/_gen\/cli-account-manager.moc.hpp\"\n#include \"TelepathyQt4\/_gen\/cli-account-manager-body.hpp\"\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\n#include <TelepathyQt4\/Client\/PendingSuccess>\n#include <TelepathyQt4\/Constants>\n\n#include <QQueue>\n#include <QSet>\n#include <QTimer>\n\n\/**\n * \\addtogroup clientsideproxies Client-side proxies\n *\n * Proxy objects representing remote service objects accessed via D-Bus.\n *\n * In addition to providing direct access to methods, signals and properties\n * exported by the remote objects, some of these proxies offer features like\n * automatic inspection of remote object capabilities, property tracking,\n * backwards compatibility helpers for older services and other utilities.\n *\/\n\n\/**\n * \\defgroup clientaccount Account and Account Manager proxies\n * \\ingroup clientsideproxies\n *\n * Proxy objects representing the Telepathy Account Manager and the Accounts\n * that it manages, and their optional interfaces.\n *\/\n\nnamespace Telepathy\n{\nnamespace Client\n{\n\nAccountManager::Private::PendingReady::PendingReady(AccountManager *parent)\n    : PendingOperation(parent)\n{\n}\n\nAccountManager::Private::Private(AccountManager *parent)\n    : QObject(parent),\n      baseInterface(new AccountManagerInterface(parent->dbusConnection(),\n                            parent->busName(), parent->objectPath(), parent)),\n      ready(false),\n      pendingReady(0),\n      introspectQueue(),\n      features(0)\n{\n    debug() << \"Creating new AccountManager:\" << parent->busName();\n\n    connect(baseInterface,\n            SIGNAL(AccountValidityChanged(const QDBusObjectPath &, bool)),\n            SLOT(onAccountValidityChanged(const QDBusObjectPath &, bool)));\n    connect(baseInterface,\n            SIGNAL(AccountRemoved(const QDBusObjectPath &)),\n            SLOT(onAccountRemoved(const QDBusObjectPath &)));\n\n    introspectQueue.enqueue(&Private::callGetAll);\n    QTimer::singleShot(0, this, SLOT(continueIntrospection()));\n}\n\nAccountManager::Private::~Private()\n{\n}\n\nvoid AccountManager::Private::callGetAll()\n{\n    debug() << \"Calling Properties::GetAll(AccountManager)\";\n    AccountManager *am = static_cast<AccountManager *>(parent());\n    QDBusPendingCallWatcher *watcher = new QDBusPendingCallWatcher(\n            am->propertiesInterface()->GetAll(\n                TELEPATHY_INTERFACE_ACCOUNT_MANAGER), this);\n    connect(watcher,\n            SIGNAL(finished(QDBusPendingCallWatcher *)),\n            SLOT(onGetAllAccountManagerReturn(QDBusPendingCallWatcher *)));\n}\n\nvoid AccountManager::Private::setAccountPaths(QSet<QDBusObjectPath> &set,\n        const QVariant &variant)\n{\n    Telepathy::ObjectPathList paths = qdbus_cast<Telepathy::ObjectPathList>(variant);\n\n    if (paths.size() == 0) {\n        \/\/ maybe the AccountManager is buggy, like Mission Control\n        \/\/ 5.0.beta45, and returns an array of strings rather than\n        \/\/ an array of object paths?\n\n        QStringList wronglyTypedPaths = qdbus_cast<QStringList>(variant);\n        if (wronglyTypedPaths.size() > 0) {\n            warning() << \"AccountManager returned wrong type \"\n                \"(expected 'ao', got 'as'); working around it\";\n            Q_FOREACH (QString path, wronglyTypedPaths) {\n                paths << QDBusObjectPath(path);\n            }\n        }\n    }\n\n    Q_FOREACH (const QDBusObjectPath &path, paths) {\n        set << path;\n    }\n}\n\nvoid AccountManager::Private::onGetAllAccountManagerReturn(\n        QDBusPendingCallWatcher *watcher)\n{\n    QDBusPendingReply<QVariantMap> reply = *watcher;\n    QVariantMap props;\n\n    if (!reply.isError()) {\n        debug() << \"Got reply to Properties.GetAll(AccountManager)\";\n        props = reply.value();\n    } else {\n        warning().nospace() <<\n            \"GetAll(AccountManager) failed: \" <<\n            reply.error().name() << \": \" << reply.error().message();\n    }\n\n    if (props.contains(\"Interfaces\")) {\n        interfaces = qdbus_cast<QStringList>(props[\"Interfaces\"]);\n    }\n\n    if (props.contains(\"ValidAccounts\")) {\n        setAccountPaths(validAccountPaths,\n                props[\"ValidAccounts\"]);\n    }\n\n    if (props.contains(\"InvalidAccounts\")) {\n        setAccountPaths(invalidAccountPaths,\n                props[\"InvalidAccounts\"]);\n    }\n\n    continueIntrospection();\n}\n\nvoid AccountManager::Private::onAccountValidityChanged(const QDBusObjectPath &path,\n        bool nowValid)\n{\n    bool newAccount = false;\n\n    if (!validAccountPaths.contains(path) && !invalidAccountPaths.contains(path)) {\n        newAccount = true;\n    }\n\n    if (nowValid) {\n        debug() << \"Account created or became valid:\" << path.path();\n        invalidAccountPaths.remove(path);\n        validAccountPaths.insert(path);\n    }\n    else {\n        debug() << \"Account became invalid:\" << path.path();\n        validAccountPaths.remove(path);\n        invalidAccountPaths.insert(path);\n    }\n\n    if (newAccount) {\n        Q_EMIT accountCreated(path);\n        \/\/ if the newly created account is invalid (shouldn't be the case)\n        \/\/ emit also accountValidityChanged indicating this\n        if (!nowValid) {\n            Q_EMIT accountValidityChanged(path, nowValid);\n        }\n    }\n    else {\n        Q_EMIT accountValidityChanged(path, nowValid);\n    }\n}\n\nvoid AccountManager::Private::onAccountRemoved(const QDBusObjectPath &path)\n{\n    debug() << \"Account removed:\" << path.path();\n    validAccountPaths.remove(path);\n    invalidAccountPaths.remove(path);\n\n    Q_EMIT accountRemoved(path);\n}\n\nvoid AccountManager::Private::continueIntrospection()\n{\n    if (!ready) {\n        if (introspectQueue.isEmpty()) {\n            debug() << \"AccountManager is ready\";\n            ready = true;\n\n            if (pendingReady) {\n                pendingReady->setFinished();\n                \/\/ it will delete itself later\n                pendingReady = 0;\n            }\n        }\n        else {\n            (this->*(introspectQueue.dequeue()))();\n        }\n    }\n}\n\n\/**\n * \\class AccountManager\n * \\ingroup clientaccount\n * \\headerfile TelepathyQt4\/Client\/account-manager.h> <TelepathyQt4\/Client\/AccountManager>\n *\n * Object representing a Telepathy account manager.\n *\/\n\n\/**\n * Construct a new AccountManager object.\n *\n * \\param parent Object parent.\n *\/\nAccountManager::AccountManager(QObject* parent)\n    : StatelessDBusProxy(QDBusConnection::sessionBus(),\n            QLatin1String(TELEPATHY_ACCOUNT_MANAGER_BUS_NAME),\n            QLatin1String(TELEPATHY_ACCOUNT_MANAGER_OBJECT_PATH), parent),\n      mPriv(new Private(this))\n{\n    init();\n}\n\n\/**\n * Construct a new AccountManager object.\n *\n * \\param bus QDBusConnection to use.\n * \\param parent Object parent.\n *\/\nAccountManager::AccountManager(const QDBusConnection& bus,\n        QObject* parent)\n    : StatelessDBusProxy(bus,\n            QLatin1String(TELEPATHY_ACCOUNT_MANAGER_BUS_NAME),\n            QLatin1String(TELEPATHY_ACCOUNT_MANAGER_OBJECT_PATH), parent),\n      mPriv(new Private(this))\n{\n    init();\n}\n\n\/**\n * Class destructor.\n *\/\nAccountManager::~AccountManager()\n{\n    delete mPriv;\n}\n\nQStringList AccountManager::interfaces() const\n{\n    return mPriv->interfaces;\n}\n\n\/**\n * \\fn DBus::propertiesInterface *AccountManager::propertiesInterface() const\n *\n * Convenience function for getting a Properties interface proxy. The\n * AccountManager interface relies on properties, so this interface is\n * always assumed to be present.\n *\/\n\n\/**\n * Return a list of QDBusObjectPath for all valid accounts.\n *\n * \\return A list of QDBusObjectPath.\n *\/\nTelepathy::ObjectPathList AccountManager::validAccountPaths() const\n{\n    Telepathy::ObjectPathList result;\n    result.append(mPriv->validAccountPaths.values());\n    return result;\n}\n\n\/**\n * Return a list of QDBusObjectPath for all invalid accounts.\n *\n * \\return A list of QDBusObjectPath.\n *\/\nTelepathy::ObjectPathList AccountManager::invalidAccountPaths() const\n{\n    Telepathy::ObjectPathList result;\n    result.append(mPriv->invalidAccountPaths.values());\n    return result;\n}\n\n\/**\n * Return a list of QDBusObjectPath for all accounts.\n *\n * \\return A list of QDBusObjectPath.\n *\/\nTelepathy::ObjectPathList AccountManager::allAccountPaths() const\n{\n    ObjectPathList result;\n    result.append(mPriv->validAccountPaths.values());\n    result.append(mPriv->invalidAccountPaths.values());\n    return result;\n}\n\n#if 0\n\/**\n * Return a list of pending operations for all valid accounts from which\n * Accounts can be retrieved if it succeeds.\n *\n * Note that the account objects won't be cached by account manager, and\n * should be done by the application itself.\n *\n * \\return A list of PendingAccount which each one will emit\n *         PendingAccount::finished when it has finished or failed creating the\n *         account object.\n *\/\nPendingAccounts *AccountManager::validAccounts() const\n{\n    return 0;\n}\n\n\/**\n * Return a list of pending operations for all invalid accounts from which\n * Accounts can be retrieved if it succeeds.\n *\n * Note that the account objects won't be cached by account manager, and\n * should be done by the application itself.\n *\n * \\return A list of PendingAccount which each one will emit\n *         PendingAccount::finished when it has finished or failed creating the\n *         account object.\n *\/\nPendingAccounts *AccountManager::invalidAccounts() const\n{\n    return 0;\n}\n\n\/**\n * Return a list of pending operations for all accounts from which\n * Accounts can be retrieved if it succeeds.\n *\n * Note that the account objects won't be cached by account manager, and\n * should be done by the application itself.\n *\n * \\return A list of PendingAccount which each one will emit\n *         PendingAccount::finished when it has finished or failed creating the\n *         account object.\n *\/\nPendingAccounts *AccountManager::allAccounts() const\n{\n    return 0;\n}\n\nPendingAccount *AccountManager::accountForPath(const QString &path) const\n{\n    return 0;\n}\n\n\/**\n * Create an account with the given parameters.\n *\n * Return a pending operation representing the account which will succeed\n * when the account has been created or fail if an error occurred.\n *\n * \\param connectionManager Name of the connection manager to create the account for.\n * \\param protocol Name of the protocol to create the account for.\n * \\param displayName Account display name.\n * \\param parameters Account parameters.\n * \\return A PendingOperation which will emit PendingAccount::finished\n *         when the account has been created of failed its creation process.\n *\/\nPendingAccount *AccountManager::createAccount(const QString &connectionManager,\n        const QString &protocol, const QString &displayName,\n        const QVariantMap &parameters)\n{\n    return 0;\n}\n#endif\n\n\/**\n * Return whether this object has finished its initial setup.\n *\n * This is mostly useful as a sanity check, in code that shouldn't be run\n * until the object is ready. To wait for the object to be ready, call\n * becomeReady() and connect to the finished signal on the result.\n *\n * \\param features Which features should be tested.\n * \\return \\c true if the object has finished initial setup.\n *\/\nbool AccountManager::isReady(Features features) const\n{\n    return mPriv->ready\n        && ((mPriv->features & features) == features);\n}\n\n\/**\n * Return a pending operation which will succeed when this object finishes\n * its initial setup, or will fail if a fatal error occurs during this\n * initial setup.\n *\n * \\param features Which features should be tested.\n * \\return A PendingOperation which will emit PendingOperation::finished\n *         when this object has finished or failed its initial setup.\n *\/\nPendingOperation *AccountManager::becomeReady(Features features)\n{\n    if (isReady(features)) {\n        return new PendingSuccess(this);\n    }\n\n    if (features != 0) {\n        return new PendingFailure(this, \"org.freedesktop.Telepathy.Qt.DoesntWork\",\n                \"Unimplemented\");\n    }\n\n    if (!mPriv->pendingReady) {\n        mPriv->pendingReady = new Private::PendingReady(this);\n    }\n    return mPriv->pendingReady;\n}\n\n\/**\n * Get the AccountManagerInterface for this AccountManager. This\n * method is protected since the convenience methods provided by this\n * class should generally be used instead of calling D-Bus methods\n * directly.\n *\n * \\return A pointer to the existing AccountManagerInterface for this\n *         AccountManager.\n *\/\nAccountManagerInterface *AccountManager::baseInterface() const\n{\n    return mPriv->baseInterface;\n}\n\nvoid AccountManager::init()\n{\n    connect(mPriv,\n            SIGNAL(accountCreated(const QDBusObjectPath &)),\n            SIGNAL(accountCreated(const QDBusObjectPath &)));\n    connect(mPriv,\n            SIGNAL(accountRemoved(const QDBusObjectPath &)),\n            SIGNAL(accountRemoved(const QDBusObjectPath &)));\n    connect(mPriv,\n            SIGNAL(accountValidityChanged(const QDBusObjectPath &, bool)),\n            SIGNAL(accountValidityChanged(const QDBusObjectPath &, bool)));\n}\n\n} \/\/ Telepathy::Client\n} \/\/ Telepathy\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Name:\t\tSceneGraphDlg.cpp\n\/\/\n\/\/ Copyright (c) 2001-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#ifdef __GNUG__\n\t#pragma implementation \"SceneGraphDlg.cpp\"\n#endif\n\n\/\/ For compilers that support precompilation, includes \"wx\/wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"wx\/treectrl.h\"\n#include \"wx\/image.h\"\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Engine.h\"\n#include \"vtui\/wxString2.h\"\n#include \"SceneGraphDlg.h\"\n\n#include <typeinfo>\nusing namespace std;\n\n#if defined(__WXGTK__) || defined(__WXMOTIF__) || defined(__WXMAC__)\n#  include \"icon1.xpm\"\n#  include \"icon2.xpm\"\n#  include \"icon3.xpm\"\n#  include \"icon4.xpm\"\n#  include \"icon5.xpm\"\n#  include \"icon6.xpm\"\n#  include \"icon7.xpm\"\n#  include \"icon8.xpm\"\n#  include \"icon9.xpm\"\n#  include \"icon10.xpm\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass MyTreeItemData : public wxTreeItemData\n{\npublic:\n\tMyTreeItemData(vtNodeBase *pNode, vtEngine *pEngine)\n\t{\n\t\tm_pNode = pNode;\n\t\tm_pEngine = pEngine;\n\t}\n\tvtNodeBase *m_pNode;\n\tvtEngine *m_pEngine;\n};\n\n\n\/\/ WDR: class implementations\n\n\/\/----------------------------------------------------------------------------\n\/\/ SceneGraphDlg\n\/\/----------------------------------------------------------------------------\n\n\/\/ WDR: event table for SceneGraphDlg\n\nBEGIN_EVENT_TABLE(SceneGraphDlg,wxDialog)\n\tEVT_INIT_DIALOG (SceneGraphDlg::OnInitDialog)\n\tEVT_TREE_SEL_CHANGED( ID_SCENETREE, SceneGraphDlg::OnTreeSelChanged )\n\tEVT_CHECKBOX( ID_ENABLED, SceneGraphDlg::OnEnabled )\n\tEVT_BUTTON( ID_ZOOMTO, SceneGraphDlg::OnZoomTo )\n\tEVT_BUTTON( ID_REFRESH, SceneGraphDlg::OnRefresh )\nEND_EVENT_TABLE()\n\nSceneGraphDlg::SceneGraphDlg( wxWindow *parent, wxWindowID id, const wxString &title,\n\tconst wxPoint &position, const wxSize& size, long style ) :\n\twxDialog( parent, id, title, position, size, style )\n{\n\tSceneGraphFunc( this, TRUE );\n\n\tm_pZoomTo = GetZoomto();\n\tm_pEnabled = GetEnabled();\n\tm_pTree = GetScenetree();\n\n\tm_pZoomTo->Enable(false);\n\n\tm_imageListNormal = NULL;\n\tCreateImageList(16);\n}\n\nSceneGraphDlg::~SceneGraphDlg()\n{\n\tdelete m_imageListNormal;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SceneGraphDlg::CreateImageList(int size)\n{\n\tdelete m_imageListNormal;\n\n\tif ( size == -1 )\n\t{\n\t\tm_imageListNormal = NULL;\n\t\treturn;\n\t}\n\t\/\/ Make an image list containing small icons\n\tm_imageListNormal = new wxImageList(size, size, TRUE);\n\n\twxIcon icons[10];\n\ticons[0] = wxICON(icon1);\n\ticons[1] = wxICON(icon2);\n\ticons[2] = wxICON(icon3);\n\ticons[3] = wxICON(icon4);\n\ticons[4] = wxICON(icon5);\n\ticons[5] = wxICON(icon6);\n\ticons[6] = wxICON(icon7);\n\ticons[7] = wxICON(icon8);\n\ticons[8] = wxICON(icon9);\n\ticons[9] = wxICON(icon10);\n\n\tint sizeOrig = icons[0].GetWidth();\n\tfor ( size_t i = 0; i < WXSIZEOF(icons); i++ )\n\t{\n\t\tif ( size == sizeOrig )\n\t\t\tm_imageListNormal->Add(icons[i]);\n\t\telse\n\t\t\tm_imageListNormal->Add(wxBitmap(wxBitmap(icons[i]).ConvertToImage().Rescale(size, size)));\n\t}\n\tm_pTree->SetImageList(m_imageListNormal);\n}\n\n\nvoid SceneGraphDlg::RefreshTreeContents()\n{\n\tvtScene* scene = vtGetScene();\n\tif (!scene)\n\t\treturn;\n\n\t\/\/ start with a blank slate\n\tm_pTree->DeleteAllItems();\n\n\t\/\/ Fill in the tree with nodes\n\tm_bFirst = true;\n\tvtNode *pRoot = scene->GetRoot();\n\tif (pRoot) AddNodeItemsRecursively(wxTreeItemId(), pRoot, 0);\n\n\twxTreeItemId hRoot = m_pTree->GetRootItem();\n\twxTreeItemId hEngRoot = m_pTree->AppendItem(hRoot, _(\"Engines\"), 7, 7);\n\n\tvtEngine *pEngine = scene->GetRootEngine();\n\tif (pEngine) AddEnginesRecursively(hEngRoot, pEngine, 0);\n\tm_pTree->Expand(hEngRoot);\n\n\/*\t\/\/ Fill in the tree with engines\n\tint num = scene->GetNumEngines();\n\tvtTarget *target;\n\tfor (int i = 0; i < num; i++)\n\t{\n\t\tvtEngine *pEng = scene->GetEngine(i);\n\t\twxString2 str = pEng->GetName2();\n\t\tint targets = pEng->NumTargets();\n\t\ttarget = pEng->GetTarget();\n\t\tif (target)\n\t\t{\n\t\t\tstr += _T(\" -> \");\n\t\t\tvtNodeBase *node = dynamic_cast<vtNodeBase*>(target);\n\t\t\tif (node)\n\t\t\t{\n\t\t\t\tstr += _T(\"\\\"\");\n\t\t\t\tstr += wxString::FromAscii(node->GetName2());\n\t\t\t\tstr += _T(\"\\\"\");\n\t\t\t}\n\t\t\telse\n\t\t\t\tstr += _(\"(non-node)\");\n\t\t}\n\t\tif (targets > 1)\n\t\t{\n\t\t\twxString2 plus;\n\t\t\tplus.Printf(_(\" (%d targets total)\"), targets);\n\t\t\tstr += plus;\n\t\t}\n\t\twxTreeItemId hEng = m_pTree->AppendItem(hEngRoot, str, 1, 1);\n\t\tm_pTree->SetItemData(hEng, new MyTreeItemData(NULL, pEng));\n\t}\n\tm_pTree->Expand(hEngRoot);\n*\/\n\tm_pSelectedEngine = NULL;\n\tm_pSelectedNode = NULL;\n}\n\n\nvoid SceneGraphDlg::AddNodeItemsRecursively(wxTreeItemId hParentItem,\n\t\t\t\t\t\t\t\t\t\tvtNodeBase *pNode, int depth)\n{\n\twxString str;\n\tint nImage;\n\twxTreeItemId hNewItem;\n\n\tif (!pNode) return;\n\n\tif (dynamic_cast<vtLight*>(pNode))\n\t{\n\t\tstr = _(\"Light\");\n\t\tnImage = 4;\n\t}\n\telse if (dynamic_cast<vtGeom*>(pNode))\n\t{\n\t\tstr = _(\"Geometry\");\n\t\tnImage = 2;\n\t}\n\telse if (dynamic_cast<vtLOD*>(pNode))\n\t{\n\t\tstr = _T(\"LOD\");\n\t\tnImage = 5;\n\t}\n\telse if (dynamic_cast<vtTransform*>(pNode))\n\t{\n\t\tstr = _T(\"XForm\");\n\t\tnImage = 9;\n\t}\n\telse if (dynamic_cast<vtGroupBase*>(pNode))\n\t{\n\t\t\/\/ must be just a group for grouping's sake\n\t\tstr = _(\"Group\");\n\t\tnImage = 3;\n\t}\n\telse\n\t{\n\t\t\/\/ must be something else\n\t\tstr = _(\"Other\");\n\t\tnImage = 8;\n\t}\n\tif (pNode->GetName2())\n\t{\n\t\tstr += _T(\" \\\"\");\n\t\tstr += wxString::FromAscii(pNode->GetName2());\n\t\tstr += _T(\"\\\"\");\n\t}\n\n\tif (m_bFirst)\n\t{\n\t\thNewItem = m_pTree->AddRoot(str);\n\t\tm_bFirst = false;\n\t}\n\telse\n\t\thNewItem = m_pTree->AppendItem(hParentItem, str, nImage, nImage);\n\n\tconst std::type_info &t1 = typeid(*pNode);\n\tif (t1 == typeid(vtGeom))\n\t{\n\t\tvtGeom *pGeom = dynamic_cast<vtGeom*>(pNode);\n\t\tint num_mesh = pGeom->GetNumMeshes();\n\t\twxTreeItemId\thGeomItem;\n\n\t\tfor (int i = 0; i < num_mesh; i++)\n\t\t{\n\t\t\tvtMesh *pMesh = pGeom->GetMesh(i);\n\t\t\tif (pMesh)\n\t\t\t{\n\t\t\t\tint iNumPrim = pMesh->GetNumPrims();\n\t\t\t\tint iNumVert = pMesh->GetNumVertices();\n\n\t\t\t\tGLenum pt = pMesh->GetPrimType();\n\t\t\t\tconst char *mtype=\"\";\n\t\t\t\tswitch (pt)\n\t\t\t\t{\n\t\t\t\tcase GL_POINTS: mtype = \"Points\"; break;\n\t\t\t\tcase GL_LINES: mtype = \"Lines\"; break;\n\t\t\t\tcase GL_LINE_LOOP: mtype = \"LineLoop\"; break;\n\t\t\t\tcase GL_LINE_STRIP: mtype = \"LineStrip\"; break;\n\t\t\t\tcase GL_TRIANGLES: mtype = \"Triangles\"; break;\n\t\t\t\tcase GL_TRIANGLE_STRIP: mtype = \"TriStrip\"; break;\n\t\t\t\tcase GL_TRIANGLE_FAN: mtype = \"TriFan\"; break;\n\t\t\t\tcase GL_QUADS: mtype = \"Quads\"; break;\n\t\t\t\tcase GL_QUAD_STRIP: mtype = \"QuadStrip\"; break;\n\t\t\t\tcase GL_POLYGON: mtype = \"Polygon\"; break;\n\t\t\t\t}\n\t\t\t\tstr.Printf(_(\"Mesh %d, %hs, %d verts, %d prims\"), i, mtype, iNumVert, iNumPrim);\n\t\t\t\thGeomItem = m_pTree->AppendItem(hNewItem, str, 6, 6);\n\t\t\t}\n\t\t\telse\n\t\t\t\thGeomItem = m_pTree->AppendItem(hNewItem, _(\"Text Mesh\"), 6, 6);\n\t\t}\n\t}\n\n\tm_pTree->SetItemData(hNewItem, new MyTreeItemData(pNode, NULL));\n\n\twxTreeItemId hSubItem;\n\tvtGroupBase *pGroup = dynamic_cast<vtGroupBase*>(pNode);\n\tif (pGroup)\n\t{\n\t\tint num_children = pGroup->GetNumChildren();\n\t\tif (num_children > 200)\n\t\t{\n\t\t\tstr.Printf(_(\"(%d children)\"), num_children);\n\t\t\thSubItem = m_pTree->AppendItem(hNewItem, str, 8, 8);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (int i = 0; i < num_children; i++)\n\t\t\t{\n\t\t\t\tvtNode *pChild = pGroup->GetChild(i);\n\t\t\t\tif (pChild)\n\t\t\t\t\tAddNodeItemsRecursively(hNewItem, pChild, depth+1);\n\t\t\t\telse\n\t\t\t\t\thSubItem = m_pTree->AppendItem(hNewItem, _(\"(internal node)\"), 8, 8);\n\t\t\t}\n\t\t}\n\t}\n\t\/\/ expand a bit so that the tree is initially partially exposed\n\tif (depth < 2)\n\t\tm_pTree->Expand(hNewItem);\n}\n\nvoid SceneGraphDlg::AddEnginesRecursively(wxTreeItemId hParentItem,\n\t\t\t\t\t\t\t\t\t\tvtEngine *pEng, int depth)\n{\n\twxTreeItemId hNewItem;\n\n\tif (!pEng) return;\n\n\twxString2 str = pEng->GetName2();\n\tif (str == \"\")\n\t\tstr = \"unnamed\";\n\n\tint targets = pEng->NumTargets();\n\tvtTarget *target = pEng->GetTarget();\n\tif (target)\n\t{\n\t\tstr += _T(\" -> \");\n\t\tvtNodeBase *node = dynamic_cast<vtNodeBase*>(target);\n\t\tif (node)\n\t\t{\n\t\t\tstr += _T(\"\\\"\");\n\t\t\tstr += wxString::FromAscii(node->GetName2());\n\t\t\tstr += _T(\"\\\"\");\n\t\t}\n\t\telse\n\t\t\tstr += _(\"(non-node)\");\n\t}\n\tif (targets > 1)\n\t{\n\t\twxString2 plus;\n\t\tplus.Printf(_(\" (%d targets total)\"), targets);\n\t\tstr += plus;\n\t}\n\n\thNewItem = m_pTree->AppendItem(hParentItem, str, 1, 1);\n\tm_pTree->SetItemData(hNewItem, new MyTreeItemData(NULL, pEng));\n\n\tfor (unsigned int i = 0; i < pEng->NumChildren(); i++)\n\t{\n\t\tvtEngine *pChild = pEng->GetChild(i);\n\t\tAddEnginesRecursively(hNewItem, pChild, depth+1);\n\t}\n\n\t\/\/ always expand engines\n\tm_pTree->Expand(hNewItem);\n}\n\n\/\/ WDR: handler implementations for SceneGraphDlg\n\nvoid SceneGraphDlg::OnRefresh( wxCommandEvent &event )\n{\n\tRefreshTreeContents();\n}\n\nvoid SceneGraphDlg::OnZoomTo( wxCommandEvent &event )\n{\n\tif (m_pSelectedNode)\n\t{\n\t\tFSphere sph;\n\t\tm_pSelectedNode->GetBoundSphere(sph, true);\t\/\/ global bounds\n\n\t\t\/\/ a bit back to make sure whole volume of bounding sphere is in view\n\t\tvtCamera *pCam = vtGetScene()->GetCamera();\n\t\tfloat smallest = min(pCam->GetFOV(), pCam->GetVertFOV());\n\t\tfloat alpha = smallest \/ 2.0f;\n\t\tfloat distance = sph.radius \/ tanf(alpha);\n\t\tsph.radius = distance;\n\n\t\tpCam->ZoomToSphere(sph);\n\t}\n}\n\nvoid SceneGraphDlg::OnEnabled( wxCommandEvent &event )\n{\n\tif (m_pSelectedEngine)\n\t\tm_pSelectedEngine->SetEnabled(m_pEnabled->GetValue());\n\tif (m_pSelectedNode)\n\t\tm_pSelectedNode->SetEnabled(m_pEnabled->GetValue());\n}\n\nvoid SceneGraphDlg::OnTreeSelChanged( wxTreeEvent &event )\n{\n\twxTreeItemId item = event.GetItem();\n\tMyTreeItemData *data = (MyTreeItemData *)m_pTree->GetItemData(item);\n\n\tm_pEnabled->Enable(data != NULL);\n\n\tm_pSelectedEngine = NULL;\n\tm_pSelectedNode = NULL;\n\n\tif (data && data->m_pEngine)\n\t{\n\t\tm_pSelectedEngine = data->m_pEngine;\n\t\tm_pEnabled->SetValue(m_pSelectedEngine->GetEnabled());\n\t}\n\tif (data && data->m_pNode)\n\t{\n\t\tm_pSelectedNode = data->m_pNode;\n\t\tm_pEnabled->SetValue(m_pSelectedNode->GetEnabled());\n\t\tm_pZoomTo->Enable(true);\n\t}\n\telse\n\t\tm_pZoomTo->Enable(false);\n}\n\nvoid SceneGraphDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\tRefreshTreeContents();\n\n\twxWindow::OnInitDialog(event);\n}\n\n<commit_msg>unicode build fix<commit_after>\/\/\n\/\/ Name:\t\tSceneGraphDlg.cpp\n\/\/\n\/\/ Copyright (c) 2001-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#ifdef __GNUG__\n\t#pragma implementation \"SceneGraphDlg.cpp\"\n#endif\n\n\/\/ For compilers that support precompilation, includes \"wx\/wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"wx\/treectrl.h\"\n#include \"wx\/image.h\"\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Engine.h\"\n#include \"vtui\/wxString2.h\"\n#include \"SceneGraphDlg.h\"\n\n#include <typeinfo>\nusing namespace std;\n\n#if defined(__WXGTK__) || defined(__WXMOTIF__) || defined(__WXMAC__)\n#  include \"icon1.xpm\"\n#  include \"icon2.xpm\"\n#  include \"icon3.xpm\"\n#  include \"icon4.xpm\"\n#  include \"icon5.xpm\"\n#  include \"icon6.xpm\"\n#  include \"icon7.xpm\"\n#  include \"icon8.xpm\"\n#  include \"icon9.xpm\"\n#  include \"icon10.xpm\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass MyTreeItemData : public wxTreeItemData\n{\npublic:\n\tMyTreeItemData(vtNodeBase *pNode, vtEngine *pEngine)\n\t{\n\t\tm_pNode = pNode;\n\t\tm_pEngine = pEngine;\n\t}\n\tvtNodeBase *m_pNode;\n\tvtEngine *m_pEngine;\n};\n\n\n\/\/ WDR: class implementations\n\n\/\/----------------------------------------------------------------------------\n\/\/ SceneGraphDlg\n\/\/----------------------------------------------------------------------------\n\n\/\/ WDR: event table for SceneGraphDlg\n\nBEGIN_EVENT_TABLE(SceneGraphDlg,wxDialog)\n\tEVT_INIT_DIALOG (SceneGraphDlg::OnInitDialog)\n\tEVT_TREE_SEL_CHANGED( ID_SCENETREE, SceneGraphDlg::OnTreeSelChanged )\n\tEVT_CHECKBOX( ID_ENABLED, SceneGraphDlg::OnEnabled )\n\tEVT_BUTTON( ID_ZOOMTO, SceneGraphDlg::OnZoomTo )\n\tEVT_BUTTON( ID_REFRESH, SceneGraphDlg::OnRefresh )\nEND_EVENT_TABLE()\n\nSceneGraphDlg::SceneGraphDlg( wxWindow *parent, wxWindowID id, const wxString &title,\n\tconst wxPoint &position, const wxSize& size, long style ) :\n\twxDialog( parent, id, title, position, size, style )\n{\n\tSceneGraphFunc( this, TRUE );\n\n\tm_pZoomTo = GetZoomto();\n\tm_pEnabled = GetEnabled();\n\tm_pTree = GetScenetree();\n\n\tm_pZoomTo->Enable(false);\n\n\tm_imageListNormal = NULL;\n\tCreateImageList(16);\n}\n\nSceneGraphDlg::~SceneGraphDlg()\n{\n\tdelete m_imageListNormal;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SceneGraphDlg::CreateImageList(int size)\n{\n\tdelete m_imageListNormal;\n\n\tif ( size == -1 )\n\t{\n\t\tm_imageListNormal = NULL;\n\t\treturn;\n\t}\n\t\/\/ Make an image list containing small icons\n\tm_imageListNormal = new wxImageList(size, size, TRUE);\n\n\twxIcon icons[10];\n\ticons[0] = wxICON(icon1);\n\ticons[1] = wxICON(icon2);\n\ticons[2] = wxICON(icon3);\n\ticons[3] = wxICON(icon4);\n\ticons[4] = wxICON(icon5);\n\ticons[5] = wxICON(icon6);\n\ticons[6] = wxICON(icon7);\n\ticons[7] = wxICON(icon8);\n\ticons[8] = wxICON(icon9);\n\ticons[9] = wxICON(icon10);\n\n\tint sizeOrig = icons[0].GetWidth();\n\tfor ( size_t i = 0; i < WXSIZEOF(icons); i++ )\n\t{\n\t\tif ( size == sizeOrig )\n\t\t\tm_imageListNormal->Add(icons[i]);\n\t\telse\n\t\t\tm_imageListNormal->Add(wxBitmap(wxBitmap(icons[i]).ConvertToImage().Rescale(size, size)));\n\t}\n\tm_pTree->SetImageList(m_imageListNormal);\n}\n\n\nvoid SceneGraphDlg::RefreshTreeContents()\n{\n\tvtScene* scene = vtGetScene();\n\tif (!scene)\n\t\treturn;\n\n\t\/\/ start with a blank slate\n\tm_pTree->DeleteAllItems();\n\n\t\/\/ Fill in the tree with nodes\n\tm_bFirst = true;\n\tvtNode *pRoot = scene->GetRoot();\n\tif (pRoot) AddNodeItemsRecursively(wxTreeItemId(), pRoot, 0);\n\n\twxTreeItemId hRoot = m_pTree->GetRootItem();\n\twxTreeItemId hEngRoot = m_pTree->AppendItem(hRoot, _(\"Engines\"), 7, 7);\n\n\tvtEngine *pEngine = scene->GetRootEngine();\n\tif (pEngine) AddEnginesRecursively(hEngRoot, pEngine, 0);\n\tm_pTree->Expand(hEngRoot);\n\n\tm_pSelectedEngine = NULL;\n\tm_pSelectedNode = NULL;\n}\n\n\nvoid SceneGraphDlg::AddNodeItemsRecursively(wxTreeItemId hParentItem,\n\t\t\t\t\t\t\t\t\t\tvtNodeBase *pNode, int depth)\n{\n\twxString str;\n\tint nImage;\n\twxTreeItemId hNewItem;\n\n\tif (!pNode) return;\n\n\tif (dynamic_cast<vtLight*>(pNode))\n\t{\n\t\tstr = _(\"Light\");\n\t\tnImage = 4;\n\t}\n\telse if (dynamic_cast<vtGeom*>(pNode))\n\t{\n\t\tstr = _(\"Geometry\");\n\t\tnImage = 2;\n\t}\n\telse if (dynamic_cast<vtLOD*>(pNode))\n\t{\n\t\tstr = _T(\"LOD\");\n\t\tnImage = 5;\n\t}\n\telse if (dynamic_cast<vtTransform*>(pNode))\n\t{\n\t\tstr = _T(\"XForm\");\n\t\tnImage = 9;\n\t}\n\telse if (dynamic_cast<vtGroupBase*>(pNode))\n\t{\n\t\t\/\/ must be just a group for grouping's sake\n\t\tstr = _(\"Group\");\n\t\tnImage = 3;\n\t}\n\telse\n\t{\n\t\t\/\/ must be something else\n\t\tstr = _(\"Other\");\n\t\tnImage = 8;\n\t}\n\tif (pNode->GetName2())\n\t{\n\t\tstr += _T(\" \\\"\");\n\t\tstr += wxString::FromAscii(pNode->GetName2());\n\t\tstr += _T(\"\\\"\");\n\t}\n\n\tif (m_bFirst)\n\t{\n\t\thNewItem = m_pTree->AddRoot(str);\n\t\tm_bFirst = false;\n\t}\n\telse\n\t\thNewItem = m_pTree->AppendItem(hParentItem, str, nImage, nImage);\n\n\tconst std::type_info &t1 = typeid(*pNode);\n\tif (t1 == typeid(vtGeom))\n\t{\n\t\tvtGeom *pGeom = dynamic_cast<vtGeom*>(pNode);\n\t\tint num_mesh = pGeom->GetNumMeshes();\n\t\twxTreeItemId\thGeomItem;\n\n\t\tfor (int i = 0; i < num_mesh; i++)\n\t\t{\n\t\t\tvtMesh *pMesh = pGeom->GetMesh(i);\n\t\t\tif (pMesh)\n\t\t\t{\n\t\t\t\tint iNumPrim = pMesh->GetNumPrims();\n\t\t\t\tint iNumVert = pMesh->GetNumVertices();\n\n\t\t\t\tGLenum pt = pMesh->GetPrimType();\n\t\t\t\tconst char *mtype=\"\";\n\t\t\t\tswitch (pt)\n\t\t\t\t{\n\t\t\t\tcase GL_POINTS: mtype = \"Points\"; break;\n\t\t\t\tcase GL_LINES: mtype = \"Lines\"; break;\n\t\t\t\tcase GL_LINE_LOOP: mtype = \"LineLoop\"; break;\n\t\t\t\tcase GL_LINE_STRIP: mtype = \"LineStrip\"; break;\n\t\t\t\tcase GL_TRIANGLES: mtype = \"Triangles\"; break;\n\t\t\t\tcase GL_TRIANGLE_STRIP: mtype = \"TriStrip\"; break;\n\t\t\t\tcase GL_TRIANGLE_FAN: mtype = \"TriFan\"; break;\n\t\t\t\tcase GL_QUADS: mtype = \"Quads\"; break;\n\t\t\t\tcase GL_QUAD_STRIP: mtype = \"QuadStrip\"; break;\n\t\t\t\tcase GL_POLYGON: mtype = \"Polygon\"; break;\n\t\t\t\t}\n\t\t\t\tstr.Printf(_(\"Mesh %d, %hs, %d verts, %d prims\"), i, mtype, iNumVert, iNumPrim);\n\t\t\t\thGeomItem = m_pTree->AppendItem(hNewItem, str, 6, 6);\n\t\t\t}\n\t\t\telse\n\t\t\t\thGeomItem = m_pTree->AppendItem(hNewItem, _(\"Text Mesh\"), 6, 6);\n\t\t}\n\t}\n\n\tm_pTree->SetItemData(hNewItem, new MyTreeItemData(pNode, NULL));\n\n\twxTreeItemId hSubItem;\n\tvtGroupBase *pGroup = dynamic_cast<vtGroupBase*>(pNode);\n\tif (pGroup)\n\t{\n\t\tint num_children = pGroup->GetNumChildren();\n\t\tif (num_children > 200)\n\t\t{\n\t\t\tstr.Printf(_(\"(%d children)\"), num_children);\n\t\t\thSubItem = m_pTree->AppendItem(hNewItem, str, 8, 8);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (int i = 0; i < num_children; i++)\n\t\t\t{\n\t\t\t\tvtNode *pChild = pGroup->GetChild(i);\n\t\t\t\tif (pChild)\n\t\t\t\t\tAddNodeItemsRecursively(hNewItem, pChild, depth+1);\n\t\t\t\telse\n\t\t\t\t\thSubItem = m_pTree->AppendItem(hNewItem, _(\"(internal node)\"), 8, 8);\n\t\t\t}\n\t\t}\n\t}\n\t\/\/ expand a bit so that the tree is initially partially exposed\n\tif (depth < 2)\n\t\tm_pTree->Expand(hNewItem);\n}\n\nvoid SceneGraphDlg::AddEnginesRecursively(wxTreeItemId hParentItem,\n\t\t\t\t\t\t\t\t\t\tvtEngine *pEng, int depth)\n{\n\twxTreeItemId hNewItem;\n\n\tif (!pEng) return;\n\n\twxString2 str = pEng->GetName2();\n\tif (str == wxString2(\"\"))\n\t\tstr = \"unnamed\";\n\n\tint targets = pEng->NumTargets();\n\tvtTarget *target = pEng->GetTarget();\n\tif (target)\n\t{\n\t\tstr += _T(\" -> \");\n\t\tvtNodeBase *node = dynamic_cast<vtNodeBase*>(target);\n\t\tif (node)\n\t\t{\n\t\t\tstr += _T(\"\\\"\");\n\t\t\tstr += wxString::FromAscii(node->GetName2());\n\t\t\tstr += _T(\"\\\"\");\n\t\t}\n\t\telse\n\t\t\tstr += _(\"(non-node)\");\n\t}\n\tif (targets > 1)\n\t{\n\t\twxString2 plus;\n\t\tplus.Printf(_(\" (%d targets total)\"), targets);\n\t\tstr += plus;\n\t}\n\n\thNewItem = m_pTree->AppendItem(hParentItem, str, 1, 1);\n\tm_pTree->SetItemData(hNewItem, new MyTreeItemData(NULL, pEng));\n\n\tfor (unsigned int i = 0; i < pEng->NumChildren(); i++)\n\t{\n\t\tvtEngine *pChild = pEng->GetChild(i);\n\t\tAddEnginesRecursively(hNewItem, pChild, depth+1);\n\t}\n\n\t\/\/ always expand engines\n\tm_pTree->Expand(hNewItem);\n}\n\n\/\/ WDR: handler implementations for SceneGraphDlg\n\nvoid SceneGraphDlg::OnRefresh( wxCommandEvent &event )\n{\n\tRefreshTreeContents();\n}\n\nvoid SceneGraphDlg::OnZoomTo( wxCommandEvent &event )\n{\n\tif (m_pSelectedNode)\n\t{\n\t\tFSphere sph;\n\t\tm_pSelectedNode->GetBoundSphere(sph, true);\t\/\/ global bounds\n\n\t\t\/\/ a bit back to make sure whole volume of bounding sphere is in view\n\t\tvtCamera *pCam = vtGetScene()->GetCamera();\n\t\tfloat smallest = min(pCam->GetFOV(), pCam->GetVertFOV());\n\t\tfloat alpha = smallest \/ 2.0f;\n\t\tfloat distance = sph.radius \/ tanf(alpha);\n\t\tsph.radius = distance;\n\n\t\tpCam->ZoomToSphere(sph);\n\t}\n}\n\nvoid SceneGraphDlg::OnEnabled( wxCommandEvent &event )\n{\n\tif (m_pSelectedEngine)\n\t\tm_pSelectedEngine->SetEnabled(m_pEnabled->GetValue());\n\tif (m_pSelectedNode)\n\t\tm_pSelectedNode->SetEnabled(m_pEnabled->GetValue());\n}\n\nvoid SceneGraphDlg::OnTreeSelChanged( wxTreeEvent &event )\n{\n\twxTreeItemId item = event.GetItem();\n\tMyTreeItemData *data = (MyTreeItemData *)m_pTree->GetItemData(item);\n\n\tm_pEnabled->Enable(data != NULL);\n\n\tm_pSelectedEngine = NULL;\n\tm_pSelectedNode = NULL;\n\n\tif (data && data->m_pEngine)\n\t{\n\t\tm_pSelectedEngine = data->m_pEngine;\n\t\tm_pEnabled->SetValue(m_pSelectedEngine->GetEnabled());\n\t}\n\tif (data && data->m_pNode)\n\t{\n\t\tm_pSelectedNode = data->m_pNode;\n\t\tm_pEnabled->SetValue(m_pSelectedNode->GetEnabled());\n\t\tm_pZoomTo->Enable(true);\n\t}\n\telse\n\t\tm_pZoomTo->Enable(false);\n}\n\nvoid SceneGraphDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\tRefreshTreeContents();\n\n\twxWindow::OnInitDialog(event);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <test\/unit\/math\/test_ad.hpp>\n#include <vector>\n\nTEST(mathMixMatFun, generalized_inverse) {\n  auto f = [](const auto& x) { return stan::math::generalized_inverse(x); };\n\n  Eigen::MatrixXd t(0, 0);\n  stan::test::expect_ad(f, t);\n  \/\/  stan::test::expect_ad_matvar(f, t);\n\n  Eigen::MatrixXd u(1, 1);\n  u << 2;\n  stan::test::expect_ad(f, u);\n  \/\/  stan::test::expect_ad_matvar(f, u);\n  \/\/\n  Eigen::MatrixXd v(2, 3);\n  v << 1, 3, 5, 2, 4, 6;\n  stan::test::expect_ad(f, v);\n  \/\/  stan::test::expect_ad_matvar(f, v);\n  v << 1.9, 1.3, 2.5, 0.4, 1.7, 0.1;\n  stan::test::expect_ad(f, v);\n  \/\/  stan::test::expect_ad_matvar(f, v);\n\n  \/\/ issues around zero require looser tolerances for hessians\n  stan::test::ad_tolerances tols;\n  tols.hessian_hessian_ = 0.1;\n  tols.hessian_fvar_hessian_ = 0.1;\n\n  Eigen::MatrixXd w(3, 4);\n  w << 2, 3, 5, 7, 11, 13, 17, 19, 23, 25, 27, 29;\n  stan::test::expect_ad(tols, f, w);\n  \/\/  stan::test::expect_ad_matvar(tols, f, w);\n\n  \/\/ even lower tolerance, again for cases around zero\n  stan::test::ad_tolerances tols2;\n  tols2.hessian_hessian_ = 3.0;\n  tols2.hessian_fvar_hessian_ = 3.0;\n\n  Eigen::MatrixXd x(4, 4);\n  x << 2, 3, 4, 5, 9, -1, 2, 2, 4, 3, 7, -1, 0, 1, 19, 112;\n  stan::test::expect_ad(tols2, f, x);\n  \/\/  stan::test::expect_ad_matvar(tols2, f, x);\n\n  Eigen::MatrixXd z(2, 2);\n  z << 1, 2, 5, std::numeric_limits<double>::quiet_NaN();\n  EXPECT_NO_THROW(stan::math::generalized_inverse(z));\n\n  \/\/ autodiff throws, so following fails (throw behavior must match to pass)\n  \/\/ stan::test::expect_ad(f, z);\n\n  Eigen::MatrixXd a(2, 2);\n  a << 1.9, 0.3, 0.3, std::numeric_limits<double>::infinity();\n  stan::test::expect_ad(f, a);\n  \/\/  stan::test::expect_ad_matvar(f, a);\n\n  \/\/ singular matrix, should use the\n  \/\/ alias to input small amount of jitter on the diagonal\n  Eigen::MatrixXd m(3, 2);\n  m << 1, 2, 2, 4, 1, 2;\n  EXPECT_THROW(stan::math::generalized_inverse(m), std::domain_error);\n}\n\n<commit_msg>[Jenkins] auto-formatting by clang-format version 6.0.0-1ubuntu2~16.04.1 (tags\/RELEASE_600\/final)<commit_after>#include <test\/unit\/math\/test_ad.hpp>\n#include <vector>\n\nTEST(mathMixMatFun, generalized_inverse) {\n  auto f = [](const auto& x) { return stan::math::generalized_inverse(x); };\n\n  Eigen::MatrixXd t(0, 0);\n  stan::test::expect_ad(f, t);\n  \/\/  stan::test::expect_ad_matvar(f, t);\n\n  Eigen::MatrixXd u(1, 1);\n  u << 2;\n  stan::test::expect_ad(f, u);\n  \/\/  stan::test::expect_ad_matvar(f, u);\n  \/\/\n  Eigen::MatrixXd v(2, 3);\n  v << 1, 3, 5, 2, 4, 6;\n  stan::test::expect_ad(f, v);\n  \/\/  stan::test::expect_ad_matvar(f, v);\n  v << 1.9, 1.3, 2.5, 0.4, 1.7, 0.1;\n  stan::test::expect_ad(f, v);\n  \/\/  stan::test::expect_ad_matvar(f, v);\n\n  \/\/ issues around zero require looser tolerances for hessians\n  stan::test::ad_tolerances tols;\n  tols.hessian_hessian_ = 0.1;\n  tols.hessian_fvar_hessian_ = 0.1;\n\n  Eigen::MatrixXd w(3, 4);\n  w << 2, 3, 5, 7, 11, 13, 17, 19, 23, 25, 27, 29;\n  stan::test::expect_ad(tols, f, w);\n  \/\/  stan::test::expect_ad_matvar(tols, f, w);\n\n  \/\/ even lower tolerance, again for cases around zero\n  stan::test::ad_tolerances tols2;\n  tols2.hessian_hessian_ = 3.0;\n  tols2.hessian_fvar_hessian_ = 3.0;\n\n  Eigen::MatrixXd x(4, 4);\n  x << 2, 3, 4, 5, 9, -1, 2, 2, 4, 3, 7, -1, 0, 1, 19, 112;\n  stan::test::expect_ad(tols2, f, x);\n  \/\/  stan::test::expect_ad_matvar(tols2, f, x);\n\n  Eigen::MatrixXd z(2, 2);\n  z << 1, 2, 5, std::numeric_limits<double>::quiet_NaN();\n  EXPECT_NO_THROW(stan::math::generalized_inverse(z));\n\n  \/\/ autodiff throws, so following fails (throw behavior must match to pass)\n  \/\/ stan::test::expect_ad(f, z);\n\n  Eigen::MatrixXd a(2, 2);\n  a << 1.9, 0.3, 0.3, std::numeric_limits<double>::infinity();\n  stan::test::expect_ad(f, a);\n  \/\/  stan::test::expect_ad_matvar(f, a);\n\n  \/\/ singular matrix, should use the\n  \/\/ alias to input small amount of jitter on the diagonal\n  Eigen::MatrixXd m(3, 2);\n  m << 1, 2, 2, 4, 1, 2;\n  EXPECT_THROW(stan::math::generalized_inverse(m), std::domain_error);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"SampleCode.h\"\n#include \"SkView.h\"\n#include \"SkCanvas.h\"\n#include \"SkColorFilter.h\"\n#include \"SkDevice.h\"\n#include \"SkPaint.h\"\n#include \"SkShader.h\"\n\nstatic SkShader* createChecker() {\n    SkBitmap bm;\n    bm.setConfig(SkBitmap::kARGB_8888_Config, 2, 2);\n    bm.allocPixels();\n    bm.lockPixels();\n    *bm.getAddr32(0, 0) = *bm.getAddr32(1, 1) = SkPreMultiplyColor(0xFFFFFFFF);\n    *bm.getAddr32(0, 1) = *bm.getAddr32(1, 0) = SkPreMultiplyColor(0xFFCCCCCC);\n    SkShader* s = SkShader::CreateBitmapShader(bm, SkShader::kRepeat_TileMode,\n                                               SkShader::kRepeat_TileMode);\n\n    SkMatrix m;\n    m.setScale(12, 12);\n    s->setLocalMatrix(m);\n    return s;\n}\n\nstatic SkBitmap createBitmap(int n) {\n    SkBitmap bitmap;\n    bitmap.setConfig(SkBitmap::kARGB_8888_Config, n, n);\n    bitmap.allocPixels();\n    bitmap.eraseColor(0);\n    \n    SkCanvas canvas(bitmap);\n    SkRect r;\n    r.set(0, 0, SkIntToScalar(n), SkIntToScalar(n));\n    r.inset(SK_Scalar1, SK_Scalar1);\n\n    SkPaint paint;\n    paint.setAntiAlias(true);\n    \n    paint.setColor(SK_ColorRED);\n    canvas.drawOval(r, paint);\n\n    r.inset(SK_Scalar1*n\/4, SK_Scalar1*n\/4);\n    paint.setXfermodeMode(SkXfermode::kSrc_Mode);\n    paint.setColor(0x800000FF);\n    canvas.drawOval(r, paint);\n    \n    return bitmap;\n}\n\nclass ColorFilterView : public SampleView {\n    SkBitmap fBitmap;\n    SkShader* fShader;\n    enum {\n        N = 64\n    };\npublic:\n    ColorFilterView() {\n        fBitmap = createBitmap(N);\n        fShader = createChecker();\n    }\n\n    virtual ~ColorFilterView() {\n        fShader->unref();\n    }\n\nprotected:\n    \/\/ overrides from SkEventSink\n    virtual bool onQuery(SkEvent* evt) {\n        if (SampleCode::TitleQ(*evt)) {\n            SampleCode::TitleR(evt, \"ColorFilter\");\n            return true;\n        }\n        return this->INHERITED::onQuery(evt);\n    }\n\n    virtual void onDrawBackground(SkCanvas* canvas) {\n        SkPaint paint;\n        paint.setShader(fShader);\n        canvas->drawPaint(paint);\n    }\n\n    virtual void onDrawContent(SkCanvas* canvas) {\n        if (false) {\n            SkPaint p;\n            p.setAntiAlias(true);\n            SkRect r = { 20.4f, 10, 20.6f, 20 };\n            canvas->drawRect(r, p);\n            r.set(30.9f, 10, 31.1f, 20);\n            canvas->drawRect(r, p);\n            return;\n        }\n        \n        static const SkXfermode::Mode gModes[] = {\n            SkXfermode::kClear_Mode,\n            SkXfermode::kSrc_Mode,\n            SkXfermode::kDst_Mode,\n            SkXfermode::kSrcOver_Mode,\n            SkXfermode::kDstOver_Mode,\n            SkXfermode::kSrcIn_Mode,\n            SkXfermode::kDstIn_Mode,\n            SkXfermode::kSrcOut_Mode,\n            SkXfermode::kDstOut_Mode,\n            SkXfermode::kSrcATop_Mode,\n            SkXfermode::kDstATop_Mode,\n            SkXfermode::kXor_Mode,\n            SkXfermode::kPlus_Mode,\n            SkXfermode::kMultiply_Mode,\n        };\n    \n        static const SkColor gColors[] = {\n            0xFF000000,\n            0x80000000,\n            0xFF00FF00,\n            0x8000FF00,\n            0x00000000,\n        };\n\n        float scale = 1.5f;\n        SkPaint paint;\n        canvas->translate(N \/ 8, N \/ 8);\n\n        for (size_t y = 0; y < SK_ARRAY_COUNT(gColors); y++) {\n            for (size_t x = 0; x < SK_ARRAY_COUNT(gModes); x++) {\n                SkColorFilter* cf = SkColorFilter::CreateModeFilter(gColors[y], gModes[x]);\n                SkSafeUnref(paint.setColorFilter(cf));\n                canvas->drawBitmap(fBitmap, x * N * 1.25f, y * N * scale, &paint);\n            }\n        }\n        \n    }\n    \nprivate:\n    typedef SampleView INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic SkView* MyFactory() { return new ColorFilterView; }\nstatic SkViewRegister reg(MyFactory);\n\n<commit_msg>checkpoint for 8->5 bit reduction<commit_after>#include \"SampleCode.h\"\n#include \"SkView.h\"\n#include \"SkCanvas.h\"\n#include \"SkColorFilter.h\"\n#include \"SkDevice.h\"\n#include \"SkPaint.h\"\n#include \"SkShader.h\"\n\nstatic int inflate5To8(int x) {\n    return (x << 3) | (x >> 2);\n}\n\nstatic int trunc5(int x) {\n    return x >> 3;\n}\n\n#define SK_R16_BITS 5\n\nstatic int round5_slow(int x) {    \n    int orig = x & 7;\n    int fake = x >> 5;\n    int trunc = x >> 3;\n\n    int diff = fake - orig;\n\n    int bias = 0;\n    if (diff > 4) {\n        bias = -1;\n    } else if (diff < -4) {\n        bias = 1;\n    }\n    return trunc + bias;\n}\n\nstatic int round5_fast(int x) {\n    int result = x + 3 - (x >> 5) + (x >> 7);\n    result >>= 3;\n\n    {\n        int r2 = round5_slow(x);\n        SkASSERT(r2 == result);\n    }\n    return result;\n}\n\nstatic void test_5bits() {\n    int e0 = 0;\n    int e1 = 0;\n    int e2 = 0;\n    int ae0 = 0;\n    int ae1 = 0;\n    int ae2 = 0;\n    for (int i = 0; i < 256; i++) {\n        int t0 = trunc5(i);\n        int t1 = round5_fast(i);\n        int t2 = trunc5(i);\n        int v0 = inflate5To8(t0);\n        int v1 = inflate5To8(t1);\n        int v2 = inflate5To8(t2);\n        int err0 = i - v0;\n        int err1 = i - v1;\n        int err2 = i - v2;\n        SkDebugf(\"--- %3d : trunc=%3d (%2d) round:%3d (%2d) \\n\"\/*new:%d (%2d)\\n\"*\/, i,\n                 v0, err0, v1, err1, v2, err2);\n        \n\n        e0 += err0;\n        e1 += err1;\n        e2 += err2;\n        ae0 += SkAbs32(err0);\n        ae1 += SkAbs32(err1);\n        ae2 += SkAbs32(err2);\n    }\n    SkDebugf(\"--- trunc: %d %d  round: %d %d new: %d %d\\n\", e0, ae0, e1, ae1, e2, ae2);\n}\n\nstatic SkShader* createChecker() {\n    SkBitmap bm;\n    bm.setConfig(SkBitmap::kARGB_8888_Config, 2, 2);\n    bm.allocPixels();\n    bm.lockPixels();\n    *bm.getAddr32(0, 0) = *bm.getAddr32(1, 1) = SkPreMultiplyColor(0xFFFFFFFF);\n    *bm.getAddr32(0, 1) = *bm.getAddr32(1, 0) = SkPreMultiplyColor(0xFFCCCCCC);\n    SkShader* s = SkShader::CreateBitmapShader(bm, SkShader::kRepeat_TileMode,\n                                               SkShader::kRepeat_TileMode);\n\n    SkMatrix m;\n    m.setScale(12, 12);\n    s->setLocalMatrix(m);\n    return s;\n}\n\nstatic SkBitmap createBitmap(int n) {\n    SkBitmap bitmap;\n    bitmap.setConfig(SkBitmap::kARGB_8888_Config, n, n);\n    bitmap.allocPixels();\n    bitmap.eraseColor(0);\n    \n    SkCanvas canvas(bitmap);\n    SkRect r;\n    r.set(0, 0, SkIntToScalar(n), SkIntToScalar(n));\n    r.inset(SK_Scalar1, SK_Scalar1);\n\n    SkPaint paint;\n    paint.setAntiAlias(true);\n    \n    paint.setColor(SK_ColorRED);\n    canvas.drawOval(r, paint);\n\n    r.inset(SK_Scalar1*n\/4, SK_Scalar1*n\/4);\n    paint.setXfermodeMode(SkXfermode::kSrc_Mode);\n    paint.setColor(0x800000FF);\n    canvas.drawOval(r, paint);\n    \n    return bitmap;\n}\n\nclass ColorFilterView : public SampleView {\n    SkBitmap fBitmap;\n    SkShader* fShader;\n    enum {\n        N = 64\n    };\npublic:\n    ColorFilterView() {\n        fBitmap = createBitmap(N);\n        fShader = createChecker();\n      \n\/\/        test_5bits();\n    }\n\n    virtual ~ColorFilterView() {\n        fShader->unref();\n    }\n\nprotected:\n    \/\/ overrides from SkEventSink\n    virtual bool onQuery(SkEvent* evt) {\n        if (SampleCode::TitleQ(*evt)) {\n            SampleCode::TitleR(evt, \"ColorFilter\");\n            return true;\n        }\n        return this->INHERITED::onQuery(evt);\n    }\n\n    virtual void onDrawBackground(SkCanvas* canvas) {\n        SkPaint paint;\n        paint.setShader(fShader);\n        canvas->drawPaint(paint);\n    }\n\n    virtual void onDrawContent(SkCanvas* canvas) {\n        if (false) {\n            SkPaint p;\n            p.setAntiAlias(true);\n            SkRect r = { 20.4f, 10, 20.6f, 20 };\n            canvas->drawRect(r, p);\n            r.set(30.9f, 10, 31.1f, 20);\n            canvas->drawRect(r, p);\n            return;\n        }\n        \n        static const SkXfermode::Mode gModes[] = {\n            SkXfermode::kClear_Mode,\n            SkXfermode::kSrc_Mode,\n            SkXfermode::kDst_Mode,\n            SkXfermode::kSrcOver_Mode,\n            SkXfermode::kDstOver_Mode,\n            SkXfermode::kSrcIn_Mode,\n            SkXfermode::kDstIn_Mode,\n            SkXfermode::kSrcOut_Mode,\n            SkXfermode::kDstOut_Mode,\n            SkXfermode::kSrcATop_Mode,\n            SkXfermode::kDstATop_Mode,\n            SkXfermode::kXor_Mode,\n            SkXfermode::kPlus_Mode,\n            SkXfermode::kMultiply_Mode,\n        };\n    \n        static const SkColor gColors[] = {\n            0xFF000000,\n            0x80000000,\n            0xFF00FF00,\n            0x8000FF00,\n            0x00000000,\n        };\n\n        float scale = 1.5f;\n        SkPaint paint;\n        canvas->translate(N \/ 8, N \/ 8);\n\n        for (size_t y = 0; y < SK_ARRAY_COUNT(gColors); y++) {\n            for (size_t x = 0; x < SK_ARRAY_COUNT(gModes); x++) {\n                SkColorFilter* cf = SkColorFilter::CreateModeFilter(gColors[y], gModes[x]);\n                SkSafeUnref(paint.setColorFilter(cf));\n                canvas->drawBitmap(fBitmap, x * N * 1.25f, y * N * scale, &paint);\n            }\n        }\n        \n    }\n    \nprivate:\n    typedef SampleView INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic SkView* MyFactory() { return new ColorFilterView; }\nstatic SkViewRegister reg(MyFactory);\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2014, Salesforce.com, 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\/\/\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 Salesforce.com nor the names of its contributors\n\/\/   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\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; LOSS\n\/\/ OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR\n\/\/ TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE\n\/\/ USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#pragma once\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <google\/protobuf\/io\/coded_stream.h>\n#include <google\/protobuf\/io\/zero_copy_stream_impl.h>\n#include <google\/protobuf\/io\/gzip_stream.h>\n#include <distributions\/common.hpp>\n\nnamespace distributions\n{\nnamespace protobuf\n{\n\ninline bool endswith (const char * filename, const char * suffix)\n{\n    return strlen(filename) >= strlen(suffix) and\n        strcmp(filename + strlen(filename) - strlen(suffix), suffix) == 0;\n}\n\nclass InFile\n{\npublic:\n\n    InFile (const char * filename) : filename_(filename)\n    {\n        if (strcmp(filename, \"-\") == 0 or strcmp(filename, \"-.gz\") == 0) {\n            fid_ = STDIN_FILENO;\n        } else {\n            fid_ = open(filename, O_RDONLY | O_NOATIME);\n            DIST_ASSERT(fid_ != -1, \"failed to open input file \" << filename);\n        }\n\n        file_ = new google::protobuf::io::FileInputStream(fid_);\n\n        if (endswith(filename, \".gz\")) {\n            gzip_ = new google::protobuf::io::GzipInputStream(file_);\n            stream_ = gzip_;\n        } else {\n            gzip_ = nullptr;\n            stream_ = file_;\n        }\n    }\n\n    ~InFile ()\n    {\n        delete gzip_;\n        delete file_;\n        if (fid_ != STDIN_FILENO) {\n            close(fid_);\n        }\n    }\n\n    template<class Message>\n    void read (Message & message)\n    {\n        bool success = message.ParseFromZeroCopyStream(stream_);\n        DIST_ASSERT(success, \"failed to parse message from \" << filename_);\n    }\n\n    template<class Message>\n    uint32_t try_read_stream (Message & message)\n    {\n        google::protobuf::io::CodedInputStream coded(stream_);\n        uint32_t message_size = 0;\n        if (DIST_LIKELY(coded.ReadLittleEndian32(& message_size))) {\n            auto old_limit = coded.PushLimit(message_size);\n            bool success = message.ParseFromCodedStream(& coded);\n            DIST_ASSERT(success, \"failed to parse message from \" << filename_);\n            coded.PopLimit(old_limit);\n            return message_size;\n        } else {\n            return 0;\n        }\n    }\n\nprivate:\n\n    const std::string filename_;\n    int fid_;\n    google::protobuf::io::FileInputStream * file_;\n    google::protobuf::io::GzipInputStream * gzip_;\n    google::protobuf::io::ZeroCopyInputStream * stream_;\n};\n\n\nclass OutFile\n{\npublic:\n\n    OutFile (const char * filename) : filename_(filename)\n    {\n        if (strcmp(filename, \"-\") == 0 or strcmp(filename, \"-.gz\") == 0) {\n            fid_ = STDOUT_FILENO;\n        } else {\n            fid_ = open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0664);\n            DIST_ASSERT(fid_ != -1, \"failed to open output file \" << filename);\n        }\n\n        file_ = new google::protobuf::io::FileOutputStream(fid_);\n\n        if (endswith(filename, \".gz\")) {\n            gzip_ = new google::protobuf::io::GzipOutputStream(file_);\n            stream_ = gzip_;\n        } else {\n            gzip_ = nullptr;\n            stream_ = file_;\n        }\n    }\n\n    ~OutFile ()\n    {\n        delete gzip_;\n        delete file_;\n        if (fid_ != STDOUT_FILENO) {\n            close(fid_);\n        }\n    }\n\n    template<class Message>\n    void write (Message & message)\n    {\n        DIST_ASSERT1(message.IsInitialized(), \"message not initialized\");\n        bool success = message.SerializeToZeroCopyStream(stream_);\n        DIST_ASSERT(success, \"failed to serialize message to \" << filename_);\n    }\n\n    template<class Message>\n    void write_stream (Message & message)\n    {\n        google::protobuf::io::CodedOutputStream coded(stream_);\n        DIST_ASSERT1(message.IsInitialized(), \"message not initialized\");\n        uint32_t message_size = message.ByteSize();\n        DIST_ASSERT1(message_size > 0, \"zero sized message is not supported\");\n        coded.WriteLittleEndian32(message_size);\n        message.SerializeWithCachedSizes(& coded);\n    }\n\nprivate:\n\n    const std::string filename_;\n    int fid_;\n    google::protobuf::io::FileOutputStream * file_;\n    google::protobuf::io::GzipOutputStream * gzip_;\n    google::protobuf::io::ZeroCopyOutputStream * stream_;\n};\n\n} \/\/ namespace protobuf\n} \/\/ namespace distributions\n<commit_msg>Add InFile::cyclic_read_stream<commit_after>\/\/ Copyright (c) 2014, Salesforce.com, 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\/\/\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 Salesforce.com nor the names of its contributors\n\/\/   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\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; LOSS\n\/\/ OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR\n\/\/ TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE\n\/\/ USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#pragma once\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <google\/protobuf\/io\/coded_stream.h>\n#include <google\/protobuf\/io\/zero_copy_stream_impl.h>\n#include <google\/protobuf\/io\/gzip_stream.h>\n#include <distributions\/common.hpp>\n\nnamespace distributions\n{\nnamespace protobuf\n{\n\ninline bool endswith (const char * filename, const char * suffix)\n{\n    return strlen(filename) >= strlen(suffix) and\n        strcmp(filename + strlen(filename) - strlen(suffix), suffix) == 0;\n}\n\nclass InFile\n{\npublic:\n\n    InFile (const char * filename) : filename_(filename)\n    {\n        _open();\n    }\n\n    ~InFile ()\n    {\n        _close();\n    }\n\n    template<class Message>\n    void read (Message & message)\n    {\n        bool success = message.ParseFromZeroCopyStream(stream_);\n        DIST_ASSERT(success, \"failed to parse message from \" << filename_);\n    }\n\n    template<class Message>\n    bool try_read_stream (Message & message)\n    {\n        google::protobuf::io::CodedInputStream coded(stream_);\n        uint32_t message_size = 0;\n        if (DIST_LIKELY(coded.ReadLittleEndian32(& message_size))) {\n            auto old_limit = coded.PushLimit(message_size);\n            bool success = message.ParseFromCodedStream(& coded);\n            DIST_ASSERT(success, \"failed to parse message from \" << filename_);\n            coded.PopLimit(old_limit);\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    template<class Message>\n    void cyclic_read_stream (Message & message)\n    {\n        if (DIST_UNLIKELY(not try_read_stream(message))) {\n            _close();\n            _open();\n            bool success = try_read_stream(message);\n            DIST_ASSERT(success, \"stream is empty\");\n        }\n    }\n\nprivate:\n\n    void _open ()\n    {\n        if (filename_ == \"-\" or filename_ == \"-.gz\") {\n            fid_ = STDIN_FILENO;\n        } else {\n            fid_ = open(filename_.c_str(), O_RDONLY | O_NOATIME);\n            DIST_ASSERT(fid_ != -1, \"failed to open input file \" << filename_);\n        }\n\n        file_ = new google::protobuf::io::FileInputStream(fid_);\n\n        if (endswith(filename_.c_str(), \".gz\")) {\n            gzip_ = new google::protobuf::io::GzipInputStream(file_);\n            stream_ = gzip_;\n        } else {\n            gzip_ = nullptr;\n            stream_ = file_;\n        }\n    }\n\n    void _close ()\n    {\n        delete gzip_;\n        delete file_;\n        if (fid_ != STDIN_FILENO) {\n            close(fid_);\n        }\n    }\n\n    const std::string filename_;\n    int fid_;\n    google::protobuf::io::FileInputStream * file_;\n    google::protobuf::io::GzipInputStream * gzip_;\n    google::protobuf::io::ZeroCopyInputStream * stream_;\n};\n\n\nclass OutFile\n{\npublic:\n\n    OutFile (const char * filename) : filename_(filename)\n    {\n        if (filename_ == \"-\" or filename_ == \"-.gz\") {\n            fid_ = STDOUT_FILENO;\n        } else {\n            fid_ = open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0664);\n            DIST_ASSERT(fid_ != -1, \"failed to open output file \" << filename);\n        }\n\n        file_ = new google::protobuf::io::FileOutputStream(fid_);\n\n        if (endswith(filename, \".gz\")) {\n            gzip_ = new google::protobuf::io::GzipOutputStream(file_);\n            stream_ = gzip_;\n        } else {\n            gzip_ = nullptr;\n            stream_ = file_;\n        }\n    }\n\n    ~OutFile ()\n    {\n        delete gzip_;\n        delete file_;\n        if (fid_ != STDOUT_FILENO) {\n            close(fid_);\n        }\n    }\n\n    template<class Message>\n    void write (Message & message)\n    {\n        DIST_ASSERT1(message.IsInitialized(), \"message not initialized\");\n        bool success = message.SerializeToZeroCopyStream(stream_);\n        DIST_ASSERT(success, \"failed to serialize message to \" << filename_);\n    }\n\n    template<class Message>\n    void write_stream (Message & message)\n    {\n        google::protobuf::io::CodedOutputStream coded(stream_);\n        DIST_ASSERT1(message.IsInitialized(), \"message not initialized\");\n        uint32_t message_size = message.ByteSize();\n        coded.WriteLittleEndian32(message_size);\n        message.SerializeWithCachedSizes(& coded);\n    }\n\nprivate:\n\n    const std::string filename_;\n    int fid_;\n    google::protobuf::io::FileOutputStream * file_;\n    google::protobuf::io::GzipOutputStream * gzip_;\n    google::protobuf::io::ZeroCopyOutputStream * stream_;\n};\n\n} \/\/ namespace protobuf\n} \/\/ namespace distributions\n<|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2020 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 \"etl\/expr\/base_temporary_expr.hpp\"\n\n#include \"etl\/impl\/cudnn\/bias_batch_mean.hpp\"\n#include \"etl\/impl\/egblas\/bias_batch_sum.hpp\"\n\nnamespace etl {\n\n\/*!\n * \\brief A transposition expression.\n * \\tparam A The transposed type\n *\/\ntemplate <typename A, bool Mean>\nstruct bias_batch_mean_2d_expr : base_temporary_expr_un<bias_batch_mean_2d_expr<A, Mean>, A> {\n    using value_type = value_t<A>;                           \/\/\/< The type of value of the expression\n    using this_type  = bias_batch_mean_2d_expr<A, Mean>;     \/\/\/< The type of this expression\n    using base_type  = base_temporary_expr_un<this_type, A>; \/\/\/< The base type\n    using sub_traits = decay_traits<A>;                      \/\/\/< The traits of the sub type\n\n    static constexpr auto storage_order = sub_traits::storage_order; \/\/\/< The sub storage order\n\n    \/*!\n     * \\brief Indicates if the temporary expression can be directly evaluated\n     * using only GPU.\n     *\/\n    static constexpr bool gpu_computable = !Mean && cudnn_enabled && is_floating<A>;\n\n    \/*!\n     * \\brief Construct a new expression\n     * \\param a The sub expression\n     *\/\n    explicit bias_batch_mean_2d_expr(A a) : base_type(a) {\n        \/\/Nothing else to init\n    }\n\n    \/*!\n     * \\brief Validate the transposition dimensions\n     * \\param a The input matrix\n     * \\þaram c The output matrix\n     *\/\n    template <typename C>\n    static void check([[maybe_unused]] const A& a, [[maybe_unused]] const C& c) {\n        static_assert(etl::dimensions<C>() == 1, \"The output of bias_batch_mean_2d is a vector\");\n        static_assert(etl::dimensions<A>() == 2, \"The input of bias_batch_mean_2d is a 2d matrix\");\n\n        if constexpr (all_fast<A, C>) {\n            static_assert(etl::dim<1, A>() == etl::dim<0, C>(), \"Invalid dimensions for bias_batch_mean_2d\");\n        } else {\n            cpp_assert(etl::dim<1>(a) == etl::dim<0>(c), \"Invalid dimensions for bias_batch_mean_2d\");\n        }\n    }\n\n    \/\/ Assignment functions\n\n    \/*!\n     * \\brief Assign to a matrix of the same storage order\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        [[maybe_unused]] const auto N = etl::dim<0>(a);\n        [[maybe_unused]] const auto K = etl::dim<1>(a);\n\n        if constexpr (!Mean && impl::egblas::has_sbias_batch_sum && all_row_major<A> && all_floating<A, L>) {\n            auto t1 = smart_forward_gpu(a);\n            t1.ensure_gpu_up_to_date();\n\n            lhs.ensure_gpu_allocated();\n\n            impl::egblas::bias_batch_sum(N, K, t1.gpu_memory(), 1, lhs.gpu_memory(), 1);\n\n            lhs.validate_gpu();\n            lhs.invalidate_cpu();\n        } else if constexpr (Mean && impl::egblas::has_sbias_batch_mean && all_row_major<A> && all_floating<A, L>) {\n            auto t1 = smart_forward_gpu(a);\n            t1.ensure_gpu_up_to_date();\n\n            lhs.ensure_gpu_allocated();\n\n            impl::egblas::bias_batch_mean(N, K, t1.gpu_memory(), 1, lhs.gpu_memory(), 1);\n\n            lhs.validate_gpu();\n            lhs.invalidate_cpu();\n        } else if constexpr (!Mean && cudnn_enabled && all_floating<A, L>) {\n            impl::cudnn::bias_batch_mean_2d(smart_forward_gpu(a), lhs);\n        } else {\n\n            standard_evaluator::pre_assign_rhs(a);\n\n            for (size_t k = 0; k < K; ++k) {\n                T mean(0);\n\n                for (size_t b = 0; b < N; ++b) {\n                    mean += a(b, k);\n                }\n\n                if constexpr (Mean) {\n                    lhs(k) = mean \/ N;\n                } else {\n                    lhs(k) = mean;\n                }\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Add to the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_add_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) += mean \/ N;\n            } else {\n                lhs(k) += mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Sub from the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_sub_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) -= mean \/ N;\n            } else {\n                lhs(k) -= mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Multiply the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_mul_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) *= mean \/ N;\n            } else {\n                lhs(k) *= mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Divide the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_div_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) \/= mean \/ N;\n            } else {\n                lhs(k) \/= mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Modulo the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_mod_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) %= mean \/ N;\n            } else {\n                lhs(k) %= mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Print a representation of the expression on the given stream\n     * \\param os The output stream\n     * \\param expr The expression to print\n     * \\return the output stream\n     *\/\n    friend std::ostream& operator<<(std::ostream& os, const bias_batch_mean_2d_expr& expr) {\n        if (Mean) {\n            return os << \"bias_batch_mean_2d(\" << expr._a << \")\";\n        } else {\n            return os << \"bias_batch_sum_2d(\" << expr._a << \")\";\n        }\n    }\n};\n\n\/*!\n * \\brief Traits for a transpose expression\n * \\tparam A The transposed sub type\n *\/\ntemplate <typename A, bool Mean>\nstruct etl_traits<etl::bias_batch_mean_2d_expr<A, Mean>> {\n    using expr_t     = etl::bias_batch_mean_2d_expr<A, Mean>; \/\/\/< The expression type\n    using sub_expr_t = std::decay_t<A>;                       \/\/\/< The sub expression type\n    using sub_traits = etl_traits<sub_expr_t>;                \/\/\/< The sub traits\n    using value_type = value_t<A>;                            \/\/\/< The value type of the expression\n\n    static constexpr bool is_etl         = true;                                 \/\/\/< Indicates if the type is an ETL expression\n    static constexpr bool is_transformer = false;                                \/\/\/< Indicates if the type is a transformer\n    static constexpr bool is_view        = false;                                \/\/\/< Indicates if the type is a view\n    static constexpr bool is_magic_view  = false;                                \/\/\/< Indicates if the type is a magic view\n    static constexpr bool is_fast        = sub_traits::is_fast;                  \/\/\/< Indicates if the expression is fast\n    static constexpr bool is_linear      = false;                                \/\/\/< Indicates if the expression is linear\n    static constexpr bool is_thread_safe = true;                                 \/\/\/< Indicates if the expression is thread safe\n    static constexpr bool is_value       = false;                                \/\/\/< Indicates if the expression is of value type\n    static constexpr bool is_direct      = true;                                 \/\/\/< Indicates if the expression has direct memory access\n    static constexpr bool is_generator   = false;                                \/\/\/< Indicates if the expression is a generator\n    static constexpr bool is_padded      = false;                                \/\/\/< Indicates if the expression is padded\n    static constexpr bool is_aligned     = true;                                 \/\/\/< Indicates if the expression is padded\n    static constexpr bool is_temporary   = true;                                 \/\/\/< Indicates if the expression needs a evaluator visitor\n    static constexpr order storage_order = sub_traits::storage_order;            \/\/\/< The expression's storage order\n    static constexpr bool gpu_computable = is_gpu_t<value_type> && cuda_enabled; \/\/\/< Indicates if the expression can be computed on GPU\n\n    \/*!\n     * \\brief Indicates if the expression is vectorizable using the\n     * given vector mode\n     * \\tparam V The vector mode\n     *\/\n    template <vector_mode_t V>\n    static constexpr bool vectorizable = true;\n\n    \/*!\n     * \\brief Returns the DDth dimension of the expression\n     * \\return the DDth dimension of the expression\n     *\/\n    template <size_t DD>\n    static constexpr size_t dim() {\n        static_assert(DD == 0, \"Invalid dimensions access\");\n        return decay_traits<A>::template dim<1>();\n    }\n\n    \/*!\n     * \\brief Returns the dth dimension of the expression\n     * \\param e The sub expression\n     * \\param d The dimension to get\n     * \\return the dth dimension of the expression\n     *\/\n    static size_t dim(const expr_t& e, [[maybe_unused]] size_t d) {\n        cpp_assert(d == 0, \"Invalid dimensions access\");\n\n        return etl::dim<1>(e._a);\n    }\n\n    \/*!\n     * \\brief Returns the size of the expression\n     * \\param e The sub expression\n     * \\return the size of the expression\n     *\/\n    static size_t size(const expr_t& e) {\n        return etl::dim<1>(e._a);\n    }\n\n    \/*!\n     * \\brief Returns the size of the expression\n     * \\return the size of the expression\n     *\/\n    static constexpr size_t size() {\n        return decay_traits<A>::template dim<1>();\n    }\n\n    \/*!\n     * \\brief Returns the number of dimensions of the expression\n     * \\return the number of dimensions of the expression\n     *\/\n    static constexpr size_t dimensions() {\n        return 1;\n    }\n};\n\n\/*!\n * \\brief Returns the transpose of the given expression.\n * \\param value The expression\n * \\return The transpose of the given expression.\n *\/\ntemplate <typename E>\nbias_batch_mean_2d_expr<detail::build_type<E>, true> bias_batch_mean_2d(const E& value) {\n    static_assert(is_etl_expr<E>, \"etl::bias_batch_mean_2d can only be used on ETL expressions\");\n    static_assert(is_2d<E>, \"etl::bias_batch_mean_2d is only defined for 2d input\");\n\n    return bias_batch_mean_2d_expr<detail::build_type<E>, true>{value};\n}\n\n\/*!\n * \\brief Returns the transpose of the given expression.\n * \\param value The expression\n * \\return The transpose of the given expression.\n *\/\ntemplate <typename E>\nbias_batch_mean_2d_expr<detail::build_type<E>, false> bias_batch_sum_2d(const E& value) {\n    static_assert(is_etl_expr<E>, \"etl::bias_batch_sum_2d can only be used on ETL expressions\");\n    static_assert(is_2d<E>, \"etl::bias_batch_sum_2d is only defined for 2d input\");\n\n    return bias_batch_mean_2d_expr<detail::build_type<E>, false>{value};\n}\n\n} \/\/end of namespace etl\n<commit_msg>Fix gpu_computable<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2020 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 \"etl\/expr\/base_temporary_expr.hpp\"\n\n#include \"etl\/impl\/cudnn\/bias_batch_mean.hpp\"\n#include \"etl\/impl\/egblas\/bias_batch_sum.hpp\"\n\nnamespace etl {\n\n\/*!\n * \\brief A transposition expression.\n * \\tparam A The transposed type\n *\/\ntemplate <typename A, bool Mean>\nstruct bias_batch_mean_2d_expr : base_temporary_expr_un<bias_batch_mean_2d_expr<A, Mean>, A> {\n    using value_type = value_t<A>;                           \/\/\/< The type of value of the expression\n    using this_type  = bias_batch_mean_2d_expr<A, Mean>;     \/\/\/< The type of this expression\n    using base_type  = base_temporary_expr_un<this_type, A>; \/\/\/< The base type\n    using sub_traits = decay_traits<A>;                      \/\/\/< The traits of the sub type\n\n    static constexpr auto storage_order = sub_traits::storage_order; \/\/\/< The sub storage order\n\n    \/*!\n     * \\brief Indicates if the temporary expression can be directly evaluated\n     * using only GPU.\n     *\/\n    static constexpr bool gpu_computable = (!Mean && cudnn_enabled && is_floating<A>)\n            || (impl::egblas::has_sbias_batch_sum && all_row_major<A> && all_single_precision<A>)\n            || (impl::egblas::has_dbias_batch_sum && all_row_major<A> && all_double_precision<A>);\n\n    \/*!\n     * \\brief Construct a new expression\n     * \\param a The sub expression\n     *\/\n    explicit bias_batch_mean_2d_expr(A a) : base_type(a) {\n        \/\/Nothing else to init\n    }\n\n    \/*!\n     * \\brief Validate the transposition dimensions\n     * \\param a The input matrix\n     * \\þaram c The output matrix\n     *\/\n    template <typename C>\n    static void check([[maybe_unused]] const A& a, [[maybe_unused]] const C& c) {\n        static_assert(etl::dimensions<C>() == 1, \"The output of bias_batch_mean_2d is a vector\");\n        static_assert(etl::dimensions<A>() == 2, \"The input of bias_batch_mean_2d is a 2d matrix\");\n\n        if constexpr (all_fast<A, C>) {\n            static_assert(etl::dim<1, A>() == etl::dim<0, C>(), \"Invalid dimensions for bias_batch_mean_2d\");\n        } else {\n            cpp_assert(etl::dim<1>(a) == etl::dim<0>(c), \"Invalid dimensions for bias_batch_mean_2d\");\n        }\n    }\n\n    \/\/ Assignment functions\n\n    \/*!\n     * \\brief Assign to a matrix of the same storage order\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        [[maybe_unused]] const auto N = etl::dim<0>(a);\n        [[maybe_unused]] const auto K = etl::dim<1>(a);\n\n        if constexpr (!Mean && impl::egblas::has_sbias_batch_sum && all_row_major<A> && all_floating<A, L>) {\n            auto t1 = smart_forward_gpu(a);\n            t1.ensure_gpu_up_to_date();\n\n            lhs.ensure_gpu_allocated();\n\n            impl::egblas::bias_batch_sum(N, K, t1.gpu_memory(), 1, lhs.gpu_memory(), 1);\n\n            lhs.validate_gpu();\n            lhs.invalidate_cpu();\n        } else if constexpr (Mean && impl::egblas::has_sbias_batch_mean && all_row_major<A> && all_floating<A, L>) {\n            auto t1 = smart_forward_gpu(a);\n            t1.ensure_gpu_up_to_date();\n\n            lhs.ensure_gpu_allocated();\n\n            impl::egblas::bias_batch_mean(N, K, t1.gpu_memory(), 1, lhs.gpu_memory(), 1);\n\n            lhs.validate_gpu();\n            lhs.invalidate_cpu();\n        } else if constexpr (!Mean && cudnn_enabled && all_floating<A, L>) {\n            impl::cudnn::bias_batch_mean_2d(smart_forward_gpu(a), lhs);\n        } else {\n\n            standard_evaluator::pre_assign_rhs(a);\n\n            for (size_t k = 0; k < K; ++k) {\n                T mean(0);\n\n                for (size_t b = 0; b < N; ++b) {\n                    mean += a(b, k);\n                }\n\n                if constexpr (Mean) {\n                    lhs(k) = mean \/ N;\n                } else {\n                    lhs(k) = mean;\n                }\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Add to the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_add_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) += mean \/ N;\n            } else {\n                lhs(k) += mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Sub from the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_sub_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) -= mean \/ N;\n            } else {\n                lhs(k) -= mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Multiply the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_mul_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) *= mean \/ N;\n            } else {\n                lhs(k) *= mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Divide the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_div_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) \/= mean \/ N;\n            } else {\n                lhs(k) \/= mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Modulo the given left-hand-side expression\n     * \\param lhs The expression to which assign\n     *\/\n    template <typename L>\n    void assign_mod_to(L&& lhs) const {\n        static_assert(all_etl_expr<A, L>, \"bias_batch_mean_2d only supported for ETL expressions\");\n\n        auto& a = this->a();\n\n        standard_evaluator::pre_assign_rhs(a);\n\n        const auto N = etl::size(a) \/ etl::size(lhs);\n        const auto K = etl::size(lhs);\n\n        using T = value_t<A>;\n\n        check(a, lhs);\n\n        for (size_t k = 0; k < K; ++k) {\n            T mean(0);\n\n            for (size_t b = 0; b < N; ++b) {\n                mean += a(b, k);\n            }\n\n            if constexpr (Mean) {\n                lhs(k) %= mean \/ N;\n            } else {\n                lhs(k) %= mean;\n            }\n        }\n    }\n\n    \/*!\n     * \\brief Print a representation of the expression on the given stream\n     * \\param os The output stream\n     * \\param expr The expression to print\n     * \\return the output stream\n     *\/\n    friend std::ostream& operator<<(std::ostream& os, const bias_batch_mean_2d_expr& expr) {\n        if (Mean) {\n            return os << \"bias_batch_mean_2d(\" << expr._a << \")\";\n        } else {\n            return os << \"bias_batch_sum_2d(\" << expr._a << \")\";\n        }\n    }\n};\n\n\/*!\n * \\brief Traits for a transpose expression\n * \\tparam A The transposed sub type\n *\/\ntemplate <typename A, bool Mean>\nstruct etl_traits<etl::bias_batch_mean_2d_expr<A, Mean>> {\n    using expr_t     = etl::bias_batch_mean_2d_expr<A, Mean>; \/\/\/< The expression type\n    using sub_expr_t = std::decay_t<A>;                       \/\/\/< The sub expression type\n    using sub_traits = etl_traits<sub_expr_t>;                \/\/\/< The sub traits\n    using value_type = value_t<A>;                            \/\/\/< The value type of the expression\n\n    static constexpr bool is_etl         = true;                                 \/\/\/< Indicates if the type is an ETL expression\n    static constexpr bool is_transformer = false;                                \/\/\/< Indicates if the type is a transformer\n    static constexpr bool is_view        = false;                                \/\/\/< Indicates if the type is a view\n    static constexpr bool is_magic_view  = false;                                \/\/\/< Indicates if the type is a magic view\n    static constexpr bool is_fast        = sub_traits::is_fast;                  \/\/\/< Indicates if the expression is fast\n    static constexpr bool is_linear      = false;                                \/\/\/< Indicates if the expression is linear\n    static constexpr bool is_thread_safe = true;                                 \/\/\/< Indicates if the expression is thread safe\n    static constexpr bool is_value       = false;                                \/\/\/< Indicates if the expression is of value type\n    static constexpr bool is_direct      = true;                                 \/\/\/< Indicates if the expression has direct memory access\n    static constexpr bool is_generator   = false;                                \/\/\/< Indicates if the expression is a generator\n    static constexpr bool is_padded      = false;                                \/\/\/< Indicates if the expression is padded\n    static constexpr bool is_aligned     = true;                                 \/\/\/< Indicates if the expression is padded\n    static constexpr bool is_temporary   = true;                                 \/\/\/< Indicates if the expression needs a evaluator visitor\n    static constexpr order storage_order = sub_traits::storage_order;            \/\/\/< The expression's storage order\n    static constexpr bool gpu_computable = is_gpu_t<value_type> && cuda_enabled; \/\/\/< Indicates if the expression can be computed on GPU\n\n    \/*!\n     * \\brief Indicates if the expression is vectorizable using the\n     * given vector mode\n     * \\tparam V The vector mode\n     *\/\n    template <vector_mode_t V>\n    static constexpr bool vectorizable = true;\n\n    \/*!\n     * \\brief Returns the DDth dimension of the expression\n     * \\return the DDth dimension of the expression\n     *\/\n    template <size_t DD>\n    static constexpr size_t dim() {\n        static_assert(DD == 0, \"Invalid dimensions access\");\n        return decay_traits<A>::template dim<1>();\n    }\n\n    \/*!\n     * \\brief Returns the dth dimension of the expression\n     * \\param e The sub expression\n     * \\param d The dimension to get\n     * \\return the dth dimension of the expression\n     *\/\n    static size_t dim(const expr_t& e, [[maybe_unused]] size_t d) {\n        cpp_assert(d == 0, \"Invalid dimensions access\");\n\n        return etl::dim<1>(e._a);\n    }\n\n    \/*!\n     * \\brief Returns the size of the expression\n     * \\param e The sub expression\n     * \\return the size of the expression\n     *\/\n    static size_t size(const expr_t& e) {\n        return etl::dim<1>(e._a);\n    }\n\n    \/*!\n     * \\brief Returns the size of the expression\n     * \\return the size of the expression\n     *\/\n    static constexpr size_t size() {\n        return decay_traits<A>::template dim<1>();\n    }\n\n    \/*!\n     * \\brief Returns the number of dimensions of the expression\n     * \\return the number of dimensions of the expression\n     *\/\n    static constexpr size_t dimensions() {\n        return 1;\n    }\n};\n\n\/*!\n * \\brief Returns the transpose of the given expression.\n * \\param value The expression\n * \\return The transpose of the given expression.\n *\/\ntemplate <typename E>\nbias_batch_mean_2d_expr<detail::build_type<E>, true> bias_batch_mean_2d(const E& value) {\n    static_assert(is_etl_expr<E>, \"etl::bias_batch_mean_2d can only be used on ETL expressions\");\n    static_assert(is_2d<E>, \"etl::bias_batch_mean_2d is only defined for 2d input\");\n\n    return bias_batch_mean_2d_expr<detail::build_type<E>, true>{value};\n}\n\n\/*!\n * \\brief Returns the transpose of the given expression.\n * \\param value The expression\n * \\return The transpose of the given expression.\n *\/\ntemplate <typename E>\nbias_batch_mean_2d_expr<detail::build_type<E>, false> bias_batch_sum_2d(const E& value) {\n    static_assert(is_etl_expr<E>, \"etl::bias_batch_sum_2d can only be used on ETL expressions\");\n    static_assert(is_2d<E>, \"etl::bias_batch_sum_2d is only defined for 2d input\");\n\n    return bias_batch_mean_2d_expr<detail::build_type<E>, false>{value};\n}\n\n} \/\/end of namespace etl\n<|endoftext|>"}
{"text":"<commit_before>#include <graphics.hpp>\n#include <exceptions.hpp>\n\nnamespace appbase {\nnamespace graph {\n\nusing namespace appbase::error;\n\nGraphicsManager::GraphicsManager(const GraphicsSettings &settings,\n\tconst SdlWindowPtr &window) :\n\tm_settings(settings)\n{\n\t\/\/ Create renderer\n\t{\n\t\tUint32 flags = 0;\n\t\tif (m_settings.vsync) {\n\t\t\tflags |= SDL_RENDERER_PRESENTVSYNC;\n\t\t}\n\t\t::SDL_Log(\"Create HW renderer...\");\n\t\tm_renderer.reset(::SDL_CreateRenderer(\n\t\t\twindow.get(), -1, flags | SDL_RENDERER_ACCELERATED));\n\t\tif (m_renderer == nullptr) {\n\t\t\t::SDL_Log(\"Create SW renderer...\");\n\t\t\tm_renderer.reset(::SDL_CreateRenderer(\n\t\t\t\twindow.get(), -1, flags | SDL_RENDERER_SOFTWARE));\n\t\t}\n\t\tif (m_renderer == nullptr) {\n\t\t\tThrowLastSdlError<SdlError>();\n\t\t}\n\t\t::SDL_Log(\"Create renderer OK\");\n\t}\n\t\/\/ Init SDL_image\n\t{\n\t\t::SDL_Log(\"Initialize SDL_image...\");\n\t\tint flags = 0;\n\t\tflags |= m_settings.loadEnable.jpg ? IMG_INIT_JPG : 0;\n\t\tflags |= m_settings.loadEnable.png ? IMG_INIT_PNG : 0;\n\t\tflags |= m_settings.loadEnable.tif ? IMG_INIT_TIF : 0;\n\t\tint inited = IMG_Init(flags);\n\t\tif ((inited & flags) != flags) {\n\t\t\tthrow SdlImageError(\"SDL_image init failed\");\n\t\t}\n\t\tm_sdl_image.reset(this);\n\t\t::SDL_Log(\"Initialize SDL_image OK\");\n\t}\n\t\/\/ Init SDL_ttf\n\t{\n\t\t::SDL_Log(\"Initialize SDL_ttf...\");\n\t\tif (TTF_Init() < 0) {\n\t\t\tThrowLastSdlTtfError<SdlTtfError>();\n\t\t}\n\t\tm_sdl_ttf.reset(this);\n\t\t::SDL_Log(\"Initialize SDL_ttf OK\");\n\t}\n}\n\nvoid GraphicsManager::Clear()\n{\n\tif (::SDL_SetRenderDrawColor(m_renderer.get(),\n\t\tm_settings.clear.r, m_settings.clear.g, m_settings.clear.b,\n\t\tm_settings.clear.a) < 0) {\n\t\tThrowLastSdlError<SdlError>();\n\t}\n\tif (::SDL_RenderClear(m_renderer.get()) < 0) {\n\t\tThrowLastSdlError<SdlError>();\n\t}\n}\n\nvoid GraphicsManager::Present()\n{\n\t::SDL_RenderPresent(m_renderer.get());\n}\n\nvoid GraphicsManager::DrawTexture(const SdlTexturePtr &tex,\n\tint x, int y)\n{\n\tauto size = GetTextureSize(tex);\n\tSDL_Rect dst;\n\tdst.x = x;\n\tdst.y = y;\n\tdst.w = std::get<0>(size);\n\tdst.h = std::get<1>(size);\n\t::SDL_RenderCopy(m_renderer.get(), tex.get(), nullptr, &dst);\n}\n\nSdlSurfacePtr GraphicsManager::LoadImage(const std::string &path)\n{\n\t::SDL_Log(\"Load image: %s\", path.c_str());\n\tSdlSurfacePtr surface(IMG_Load(path.c_str()));\n\tif (surface == nullptr) {\n\t\tThrowLastSdlImageError<SdlImageError>();\n\t}\n\treturn surface;\n}\n\nSdlTexturePtr GraphicsManager::CreateTexture(const SdlSurfacePtr &surface)\n{\n\tSdlTexturePtr texture(SDL_CreateTextureFromSurface(\n\t\tm_renderer.get(), surface.get()));\n\tif (texture == nullptr) {\n\t\tThrowLastSdlImageError<SdlImageError>();\n\t}\n\treturn texture;\n}\n\nstd::tuple<int, int> GraphicsManager::GetTextureSize(const SdlTexturePtr &tex)\n{\n\tint w, h;\n\tif(::SDL_QueryTexture(tex.get(), nullptr, nullptr, &w, &h) < 0) {\n\t\tThrowLastSdlError<SdlError>();\n\t}\n\treturn std::make_tuple(w, h);\n}\n\nSdlFontPtr GraphicsManager::LoadFont(const std::string &path, int hsize)\n{\n\t::SDL_Log(\"Load font: %s\", path.c_str());\n\tSdlFontPtr font(::TTF_OpenFont(path.c_str(), hsize));\n\tif (font == nullptr) {\n\t\tThrowLastSdlTtfError<SdlTtfError>();\n\t}\n\treturn font;\n}\n\nSdlSurfacePtr GraphicsManager::CreateFontImage(const SdlFontPtr &font,\n\tchar32_t codepoint)\n{\n\t\/\/ white\n\tSDL_Color color = { 255, 255, 255, 255 };\n\t\/\/ codepoint to utf-16 string\n\tstd::array<Uint16, 3> str;\n\tif (codepoint <= 0xD7FF || (codepoint >= 0xE000 && codepoint <= 0xFFFF)) {\n\t\tstr[0] = codepoint;\n\t\tstr[1] = 0;\n\t}\n\t\/\/ surrogate pair seems not to be supported...\n\t\/*\n\telse if (codepoint >= 0x10000 && codepoint <= 0x10FFFF) {\n\t\tauto c = static_cast<uint32_t>(codepoint);\n\t\tuint32_t w = ((codepoint & 0x1F00) >> 16) - 1;\n\t\tuint32_t x = (codepoint & 0xFF);\n\t\tuint32_t xl = (x & 0x3FF);\n\t\tuint32_t xh = ((x >> 10) & 0x3F);\n\t\tstr[0] = 0b1101100000000000 | (w << 6) | xh;\n\t\tstr[1] = 0b1101110000000000 | xl;\n\t\tstr[2] = 0;\n\t}\n\t*\/\n\telse {\n\t\tstr[0] = '?';\n\t\tstr[1] = 0;\n\t}\n\tSdlSurfacePtr surface(::TTF_RenderUNICODE_Solid(\n\t\tfont.get(), str.data(), color));\n\tif (surface == nullptr) {\n\t\tThrowLastSdlTtfError<SdlTtfError>();\n\t}\n\treturn surface;\n}\n\n}\n}\n<commit_msg>Fix Windows build errors and warnings<commit_after>#include <graphics.hpp>\n#include <exceptions.hpp>\n#include <array>\n\nnamespace appbase {\nnamespace graph {\n\nusing namespace appbase::error;\n\nGraphicsManager::GraphicsManager(const GraphicsSettings &settings,\n\tconst SdlWindowPtr &window) :\n\tm_settings(settings)\n{\n\t\/\/ Create renderer\n\t{\n\t\tUint32 flags = 0;\n\t\tif (m_settings.vsync) {\n\t\t\tflags |= SDL_RENDERER_PRESENTVSYNC;\n\t\t}\n\t\t::SDL_Log(\"Create HW renderer...\");\n\t\tm_renderer.reset(::SDL_CreateRenderer(\n\t\t\twindow.get(), -1, flags | SDL_RENDERER_ACCELERATED));\n\t\tif (m_renderer == nullptr) {\n\t\t\t::SDL_Log(\"Create SW renderer...\");\n\t\t\tm_renderer.reset(::SDL_CreateRenderer(\n\t\t\t\twindow.get(), -1, flags | SDL_RENDERER_SOFTWARE));\n\t\t}\n\t\tif (m_renderer == nullptr) {\n\t\t\tThrowLastSdlError<SdlError>();\n\t\t}\n\t\t::SDL_Log(\"Create renderer OK\");\n\t}\n\t\/\/ Init SDL_image\n\t{\n\t\t::SDL_Log(\"Initialize SDL_image...\");\n\t\tint flags = 0;\n\t\tflags |= m_settings.loadEnable.jpg ? IMG_INIT_JPG : 0;\n\t\tflags |= m_settings.loadEnable.png ? IMG_INIT_PNG : 0;\n\t\tflags |= m_settings.loadEnable.tif ? IMG_INIT_TIF : 0;\n\t\tint inited = IMG_Init(flags);\n\t\tif ((inited & flags) != flags) {\n\t\t\tthrow SdlImageError(\"SDL_image init failed\");\n\t\t}\n\t\tm_sdl_image.reset(this);\n\t\t::SDL_Log(\"Initialize SDL_image OK\");\n\t}\n\t\/\/ Init SDL_ttf\n\t{\n\t\t::SDL_Log(\"Initialize SDL_ttf...\");\n\t\tif (TTF_Init() < 0) {\n\t\t\tThrowLastSdlTtfError<SdlTtfError>();\n\t\t}\n\t\tm_sdl_ttf.reset(this);\n\t\t::SDL_Log(\"Initialize SDL_ttf OK\");\n\t}\n}\n\nvoid GraphicsManager::Clear()\n{\n\tif (::SDL_SetRenderDrawColor(m_renderer.get(),\n\t\tm_settings.clear.r, m_settings.clear.g, m_settings.clear.b,\n\t\tm_settings.clear.a) < 0) {\n\t\tThrowLastSdlError<SdlError>();\n\t}\n\tif (::SDL_RenderClear(m_renderer.get()) < 0) {\n\t\tThrowLastSdlError<SdlError>();\n\t}\n}\n\nvoid GraphicsManager::Present()\n{\n\t::SDL_RenderPresent(m_renderer.get());\n}\n\nvoid GraphicsManager::DrawTexture(const SdlTexturePtr &tex,\n\tint x, int y)\n{\n\tauto size = GetTextureSize(tex);\n\tSDL_Rect dst;\n\tdst.x = x;\n\tdst.y = y;\n\tdst.w = std::get<0>(size);\n\tdst.h = std::get<1>(size);\n\t::SDL_RenderCopy(m_renderer.get(), tex.get(), nullptr, &dst);\n}\n\nSdlSurfacePtr GraphicsManager::LoadImage(const std::string &path)\n{\n\t::SDL_Log(\"Load image: %s\", path.c_str());\n\tSdlSurfacePtr surface(IMG_Load(path.c_str()));\n\tif (surface == nullptr) {\n\t\tThrowLastSdlImageError<SdlImageError>();\n\t}\n\treturn surface;\n}\n\nSdlTexturePtr GraphicsManager::CreateTexture(const SdlSurfacePtr &surface)\n{\n\tSdlTexturePtr texture(SDL_CreateTextureFromSurface(\n\t\tm_renderer.get(), surface.get()));\n\tif (texture == nullptr) {\n\t\tThrowLastSdlImageError<SdlImageError>();\n\t}\n\treturn texture;\n}\n\nstd::tuple<int, int> GraphicsManager::GetTextureSize(const SdlTexturePtr &tex)\n{\n\tint w, h;\n\tif(::SDL_QueryTexture(tex.get(), nullptr, nullptr, &w, &h) < 0) {\n\t\tThrowLastSdlError<SdlError>();\n\t}\n\treturn std::make_tuple(w, h);\n}\n\nSdlFontPtr GraphicsManager::LoadFont(const std::string &path, int hsize)\n{\n\t::SDL_Log(\"Load font: %s\", path.c_str());\n\tSdlFontPtr font(::TTF_OpenFont(path.c_str(), hsize));\n\tif (font == nullptr) {\n\t\tThrowLastSdlTtfError<SdlTtfError>();\n\t}\n\treturn font;\n}\n\nSdlSurfacePtr GraphicsManager::CreateFontImage(const SdlFontPtr &font,\n\tchar32_t codepoint)\n{\n\t\/\/ white\n\tSDL_Color color = { 255, 255, 255, 255 };\n\t\/\/ codepoint to utf-16 string\n\tstd::array<Uint16, 3> str;\n\tif (codepoint <= 0xD7FF || (codepoint >= 0xE000 && codepoint <= 0xFFFF)) {\n\t\tstr[0] = static_cast<Uint16>(codepoint);\n\t\tstr[1] = 0;\n\t}\n\t\/\/ surrogate pair seems not to be supported...\n\t\/*\n\telse if (codepoint >= 0x10000 && codepoint <= 0x10FFFF) {\n\t\tauto c = static_cast<uint32_t>(codepoint);\n\t\tuint32_t w = ((codepoint & 0x1F00) >> 16) - 1;\n\t\tuint32_t x = (codepoint & 0xFF);\n\t\tuint32_t xl = (x & 0x3FF);\n\t\tuint32_t xh = ((x >> 10) & 0x3F);\n\t\tstr[0] = 0b1101100000000000 | (w << 6) | xh;\n\t\tstr[1] = 0b1101110000000000 | xl;\n\t\tstr[2] = 0;\n\t}\n\t*\/\n\telse {\n\t\tstr[0] = '?';\n\t\tstr[1] = 0;\n\t}\n\tSdlSurfacePtr surface(::TTF_RenderUNICODE_Solid(\n\t\tfont.get(), str.data(), color));\n\tif (surface == nullptr) {\n\t\tThrowLastSdlTtfError<SdlTtfError>();\n\t}\n\treturn surface;\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#ifndef FLUSSPFERD_SPIDERMONKEY_FUNCTION_HPP\n#define FLUSSPFERD_SPIDERMONKEY_FUNCTION_HPP\n\ntypedef struct JSFunction JSFunction;\n\nnamespace flusspferd {\n\nclass object;\n\nnamespace Impl {\n  class function_impl {\n    JSFunction *func;\n\n  protected:\n    JSFunction *get() { return func; }\n    JSFunction *get_const() const { return func; }\n    void set(JSFunction *f) { func = f; }\n\n    function_impl() : func(0x0) { }\n    function_impl(JSFunction *f) : func(f) { }\n\n    object get_object();\n\n    friend JSFunction *get_function(function_impl &f);\n    friend function_impl wrap_function(JSFunction *f);\n  };\n\n  inline JSFunction *get_function(function_impl &f) {\n    return f.get();\n  }\n\n  inline function_impl wrap_function(JSFunction *f) {\n    return function_impl(f);\n  }\n}}\n\n#endif \/* FLUSSPFERD_SPIDERMONKEY_FUNCTION_HPP *\/\n<commit_msg>Core: more style<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#ifndef FLUSSPFERD_SPIDERMONKEY_FUNCTION_HPP\n#define FLUSSPFERD_SPIDERMONKEY_FUNCTION_HPP\n\n#include <js\/jsapi.h>\n\nnamespace flusspferd {\n\nclass object;\n\nnamespace Impl {\n\nclass function_impl {\n  JSFunction *func;\n\nprotected:\n  JSFunction *get() { return func; }\n  JSFunction *get_const() const { return func; }\n  void set(JSFunction *f) { func = f; }\n\n  function_impl() : func(0x0) { }\n  function_impl(JSFunction *f) : func(f) { }\n\n  object get_object();\n\n  friend JSFunction *get_function(function_impl &f);\n  friend function_impl wrap_function(JSFunction *f);\n};\n\ninline JSFunction *get_function(function_impl &f) {\n  return f.get();\n}\n\ninline function_impl wrap_function(JSFunction *f) {\n  return function_impl(f);\n}\n\n}}\n\n#endif \/* FLUSSPFERD_SPIDERMONKEY_FUNCTION_HPP *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * xtensor-fftw\n * Copyright (c) 2017, Patrick Bos\n * Distributed under the terms of the BSD 3-Clause License.\n *\n * The full license is in the file LICENSE, distributed with this software.\n *\/\n\n#ifndef XTENSOR_FFTW_CONFIG_HPP\n#define XTENSOR_FFTW_CONFIG_HPP\n\n#define XTENSOR_FFTW_VERSION_MAJOR 0\n#define XTENSOR_FFTW_VERSION_MINOR 2\n#define XTENSOR_FFTW_VERSION_PATCH 3\n\n#endif \/\/XTENSOR_FFTW_CONFIG_HPP\n<commit_msg>Release 0.2.4<commit_after>\/*\n * xtensor-fftw\n * Copyright (c) 2017, Patrick Bos\n * Distributed under the terms of the BSD 3-Clause License.\n *\n * The full license is in the file LICENSE, distributed with this software.\n *\/\n\n#ifndef XTENSOR_FFTW_CONFIG_HPP\n#define XTENSOR_FFTW_CONFIG_HPP\n\n#define XTENSOR_FFTW_VERSION_MAJOR 0\n#define XTENSOR_FFTW_VERSION_MINOR 2\n#define XTENSOR_FFTW_VERSION_PATCH 4\n\n#endif \/\/XTENSOR_FFTW_CONFIG_HPP\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Forgot to increment the iterator.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>fix tests<commit_after><|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 (info@qt.nokia.com)\n**\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** 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** Other Usage\n**\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** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n\n#include <QtGui\/QBoxLayout>\n#include <QtGui\/QTreeView>\n#include <QtGui\/QHeaderView>\n#include <model.h>\n\n#include \"navigatorwidget.h\"\n#include \"navigatorview.h\"\n\n#include <utils\/fileutils.h>\n\n\nnamespace QmlDesigner {\n\nNavigatorWidget::NavigatorWidget(NavigatorView *view) :\n        QFrame(),\n        m_treeView(new NavigatorTreeView),\n        m_navigatorView(view)\n{\n    m_treeView->setDragEnabled(true);\n    m_treeView->setAcceptDrops(true);\n    m_treeView->setSelectionMode(QAbstractItemView::ExtendedSelection);\n    m_treeView->setSelectionBehavior(QAbstractItemView::SelectRows);\n    m_treeView->header()->setStretchLastSection(false);\n    m_treeView->setDefaultDropAction(Qt::LinkAction);\n    m_treeView->setFocusPolicy(Qt::NoFocus);\n    m_treeView->setHeaderHidden(true);\n\n    QVBoxLayout *layout = new QVBoxLayout;\n    layout->setSpacing(0);\n    layout->setMargin(0);\n    layout->addWidget(m_treeView);\n\n    setLayout(layout);\n\n    setWindowTitle(tr(\"Navigator\", \"Title of navigator view\"));\n\n    setStyleSheet(QLatin1String(Utils::FileReader::fetchQrc(\":\/qmldesigner\/stylesheet.css\")));\n    m_treeView->setStyleSheet(\n            QLatin1String(Utils::FileReader::fetchQrc(\":\/qmldesigner\/scrollbar.css\")));\n}\n\nNavigatorWidget::~NavigatorWidget()\n{\n\n}\n\nvoid NavigatorWidget::setTreeModel(QAbstractItemModel* model)\n{\n    m_treeView->setModel(model);\n}\n\nQList<QToolButton *> NavigatorWidget::createToolBarWidgets()\n{\n    QList<QToolButton *> buttons;\n\n    buttons << new QToolButton();\n    buttons.last()->setIcon(QIcon(\":\/navigator\/icon\/arrowleft.png\"));\n    buttons.last()->setToolTip(tr(\"Become first sibling of parent (CTRL + Left)\"));\n    buttons.last()->setShortcut(QKeySequence(Qt::Key_Left | Qt::CTRL));\n    connect(buttons.last(), SIGNAL(clicked()), this, SIGNAL(leftButtonClicked()));\n    buttons << new QToolButton();\n    buttons.last()->setIcon(QIcon(\":\/navigator\/icon\/arrowright.png\"));\n    buttons.last()->setToolTip(tr(\"Become child of first silbing (CTRL + Right)\"));\n    buttons.last()->setShortcut(QKeySequence(Qt::Key_Right | Qt::CTRL));\n    connect(buttons.last(), SIGNAL(clicked()), this, SIGNAL(rightButtonClicked()));\n\n    buttons << new QToolButton();\n    buttons.last()->setIcon(QIcon(\":\/navigator\/icon\/arrowdown.png\"));\n    buttons.last()->setToolTip(tr(\"Move down (CTRL + Down)\"));\n    buttons.last()->setShortcut(QKeySequence(Qt::Key_Down | Qt::CTRL));\n    connect(buttons.last(), SIGNAL(clicked()), this, SIGNAL(downButtonClicked()));\n\n    buttons << new QToolButton();\n    buttons.last()->setIcon(QIcon(\":\/navigator\/icon\/arrowup.png\"));\n    buttons.last()->setToolTip(tr(\"Move up (CTRL + Up)\"));\n    buttons.last()->setShortcut(QKeySequence(Qt::Key_Up | Qt::CTRL));\n    connect(buttons.last(), SIGNAL(clicked()), this, SIGNAL(upButtonClicked()));\n\n    return buttons;\n}\n\nQString NavigatorWidget::contextHelpId() const\n{\n    if (!navigatorView())\n        return QString();\n\n    QList<ModelNode> nodes = navigatorView()->selectedModelNodes();\n    QString helpId;\n    if (!nodes.isEmpty()) {\n        helpId = nodes.first().type();\n        helpId.replace(\"QtQuick\", \"QML\");\n    }\n\n    return helpId;\n}\n\nNavigatorView *NavigatorWidget::navigatorView() const\n{\n    return m_navigatorView.data();\n}\n\n}\n<commit_msg>QmlDesigner.navigatorWidget: changing focus policy<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 (info@qt.nokia.com)\n**\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** 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** Other Usage\n**\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** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n\n#include <QtGui\/QBoxLayout>\n#include <QtGui\/QTreeView>\n#include <QtGui\/QHeaderView>\n#include <model.h>\n\n#include \"navigatorwidget.h\"\n#include \"navigatorview.h\"\n\n#include <utils\/fileutils.h>\n\n\nnamespace QmlDesigner {\n\nNavigatorWidget::NavigatorWidget(NavigatorView *view) :\n        QFrame(),\n        m_treeView(new NavigatorTreeView),\n        m_navigatorView(view)\n{\n    m_treeView->setDragEnabled(true);\n    m_treeView->setAcceptDrops(true);\n    m_treeView->setSelectionMode(QAbstractItemView::ExtendedSelection);\n    m_treeView->setSelectionBehavior(QAbstractItemView::SelectRows);\n    m_treeView->header()->setStretchLastSection(false);\n    m_treeView->setDefaultDropAction(Qt::LinkAction);\n    m_treeView->setHeaderHidden(true);\n\n    QVBoxLayout *layout = new QVBoxLayout;\n    layout->setSpacing(0);\n    layout->setMargin(0);\n    layout->addWidget(m_treeView);\n\n    setLayout(layout);\n\n    setWindowTitle(tr(\"Navigator\", \"Title of navigator view\"));\n\n    setStyleSheet(QLatin1String(Utils::FileReader::fetchQrc(\":\/qmldesigner\/stylesheet.css\")));\n    m_treeView->setStyleSheet(\n            QLatin1String(Utils::FileReader::fetchQrc(\":\/qmldesigner\/scrollbar.css\")));\n}\n\nNavigatorWidget::~NavigatorWidget()\n{\n\n}\n\nvoid NavigatorWidget::setTreeModel(QAbstractItemModel* model)\n{\n    m_treeView->setModel(model);\n}\n\nQList<QToolButton *> NavigatorWidget::createToolBarWidgets()\n{\n    QList<QToolButton *> buttons;\n\n    buttons << new QToolButton();\n    buttons.last()->setIcon(QIcon(\":\/navigator\/icon\/arrowleft.png\"));\n    buttons.last()->setToolTip(tr(\"Become first sibling of parent (CTRL + Left)\"));\n    buttons.last()->setShortcut(QKeySequence(Qt::Key_Left | Qt::CTRL));\n    connect(buttons.last(), SIGNAL(clicked()), this, SIGNAL(leftButtonClicked()));\n    buttons << new QToolButton();\n    buttons.last()->setIcon(QIcon(\":\/navigator\/icon\/arrowright.png\"));\n    buttons.last()->setToolTip(tr(\"Become child of first silbing (CTRL + Right)\"));\n    buttons.last()->setShortcut(QKeySequence(Qt::Key_Right | Qt::CTRL));\n    connect(buttons.last(), SIGNAL(clicked()), this, SIGNAL(rightButtonClicked()));\n\n    buttons << new QToolButton();\n    buttons.last()->setIcon(QIcon(\":\/navigator\/icon\/arrowdown.png\"));\n    buttons.last()->setToolTip(tr(\"Move down (CTRL + Down)\"));\n    buttons.last()->setShortcut(QKeySequence(Qt::Key_Down | Qt::CTRL));\n    connect(buttons.last(), SIGNAL(clicked()), this, SIGNAL(downButtonClicked()));\n\n    buttons << new QToolButton();\n    buttons.last()->setIcon(QIcon(\":\/navigator\/icon\/arrowup.png\"));\n    buttons.last()->setToolTip(tr(\"Move up (CTRL + Up)\"));\n    buttons.last()->setShortcut(QKeySequence(Qt::Key_Up | Qt::CTRL));\n    connect(buttons.last(), SIGNAL(clicked()), this, SIGNAL(upButtonClicked()));\n\n    return buttons;\n}\n\nQString NavigatorWidget::contextHelpId() const\n{\n    if (!navigatorView())\n        return QString();\n\n    QList<ModelNode> nodes = navigatorView()->selectedModelNodes();\n    QString helpId;\n    if (!nodes.isEmpty()) {\n        helpId = nodes.first().type();\n        helpId.replace(\"QtQuick\", \"QML\");\n    }\n\n    return helpId;\n}\n\nNavigatorView *NavigatorWidget::navigatorView() const\n{\n    return m_navigatorView.data();\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>correct UTF8 handling for FILTERXML, fdo#72427<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright 2008-2013 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#pragma once\n\n#include <thrust\/system\/cuda\/detail\/bulk\/detail\/config.hpp>\n#include <thrust\/system\/cuda\/detail\/bulk\/malloc.hpp>\n#include <thrust\/system\/cuda\/detail\/bulk\/execution_policy.hpp>\n#include <thrust\/system\/cuda\/detail\/bulk\/detail\/tuple_transform.hpp>\n#include <thrust\/system\/cuda\/detail\/bulk\/detail\/closure.hpp>\n\n#include <thrust\/detail\/type_traits.h>\n\n\nBULK_NAMESPACE_PREFIX\nnamespace bulk\n{\nnamespace detail\n{\n\n\ntemplate<typename ExecutionGroup, typename Closure>\nclass task_base\n{\n  public:\n    typedef ExecutionGroup group_type;\n    typedef Closure        closure_type;\n\n    __host__ __device__\n    task_base(group_type g, closure_type c)\n      : c(c), g(g)\n    {}\n\n  protected:\n    __host__ __device__\n    static void substitute_placeholders_and_execute(group_type &g, closure_type &c)\n    {\n      \/\/ substitute placeholders with this_group\n      substituted_arguments_type new_args = substitute_placeholders(g, c.arguments());\n\n      \/\/ create a new closure with the new arguments\n      closure<typename closure_type::function_type, substituted_arguments_type> new_c(c.function(), new_args);\n\n      \/\/ execute the new closure\n      new_c();\n    }\n\n    closure_type c;\n    group_type g;\n\n  private:\n    template<typename T>\n    struct substitutor_result\n      : thrust::detail::eval_if<\n          bulk::detail::is_cursor<T>::value,\n          cursor_result<T,ExecutionGroup>,\n          thrust::detail::identity_<T>\n        >\n    {};\n\n    typedef typename bulk::detail::tuple_meta_transform<\n      typename closure_type::arguments_type,\n      substitutor_result\n    >::type substituted_arguments_type;\n\n    struct substitutor\n    {\n      group_type &g;\n\n      __device__\n      substitutor(group_type &g)\n        : g(g)\n      {}\n\n      template<unsigned int depth>\n      __device__\n      typename bulk::detail::cursor_result<cursor<depth>,group_type>::type\n      operator()(cursor<depth> c) const\n      {\n        return c.get(g);\n      }\n\n      template<typename T>\n      __device__\n      T &operator()(T &x) const\n      {\n        return x;\n      }\n    };\n\n    __host__ __device__\n    static substituted_arguments_type substitute_placeholders(group_type &g, typename closure_type::arguments_type args)\n    {\n      return bulk::detail::tuple_host_device_transform<substitutor_result>(args, substitutor(g));\n    }\n};\n\n\ntemplate<std::size_t blocksize, std::size_t grainsize>\nstruct cuda_block\n{\n  typedef concurrent_group<agent<grainsize>, blocksize> type;\n};\n\n\ntemplate<std::size_t gridsize, std::size_t blocksize, std::size_t grainsize>\nstruct cuda_grid\n{\n  typedef parallel_group<\n    typename cuda_block<blocksize,grainsize>::type\n  > type;\n};\n\n\ntemplate<typename Group, typename Closure> class cuda_task;\n\n\ntemplate<typename Grid>\nstruct grid_maker\n{\n  __host__ __device__\n  static Grid make(typename Grid::size_type     size,\n                   typename Grid::agent_type    block,\n                   typename Grid::size_type     index)\n  {\n    return Grid(block, index);\n  }\n};\n\n\ntemplate<typename Block>\nstruct grid_maker<parallel_group<Block,dynamic_group_size> >\n{\n  __host__ __device__\n  static parallel_group<Block,dynamic_group_size> make(typename parallel_group<Block,dynamic_group_size>::size_type size,\n                                                       Block block,\n                                                       typename parallel_group<Block,dynamic_group_size>::size_type index)\n  {\n    return parallel_group<Block,dynamic_group_size>(size, block, index);\n  }\n};\n\n\ntemplate<typename Block>\nstruct block_maker\n{\n  __host__ __device__\n  static Block make(typename Block::size_type     size,\n                    typename Block::size_type     heap_size,\n                    typename Block::agent_type    thread,\n                    typename Block::size_type     index)\n  {\n    return Block(heap_size, thread, index);\n  }\n};\n\ntemplate<typename Thread>\nstruct block_maker<concurrent_group<Thread,dynamic_group_size> >\n{\n  __host__ __device__\n  static concurrent_group<Thread,dynamic_group_size> make(typename concurrent_group<Thread,dynamic_group_size>::size_type size,\n                                                          typename concurrent_group<Thread,dynamic_group_size>::size_type heap_size,\n                                                          Thread thread,\n                                                          typename concurrent_group<Thread,dynamic_group_size>::size_type index)\n  {\n    return concurrent_group<Thread,dynamic_group_size>(size, heap_size, thread, index);\n  }\n};\n\n\ntemplate<typename Grid>\n__host__ __device__\nGrid make_grid(typename Grid::size_type size, typename Grid::agent_type block, typename Grid::size_type index = invalid_index)\n{\n  return grid_maker<Grid>::make(size, block, index);\n}\n\n\ntemplate<typename Block>\n__host__ __device__\nBlock make_block(typename Block::size_type size, typename Block::size_type heap_size, typename Block::agent_type thread = typename Block::agent_type(), typename Block::size_type index = invalid_index)\n{\n  return block_maker<Block>::make(size, heap_size, thread, index);\n}\n\n\n\/\/ specialize cuda_task for a CUDA grid\ntemplate<std::size_t gridsize, std::size_t blocksize, std::size_t grainsize, typename Closure>\nclass cuda_task<\n  parallel_group<\n    concurrent_group<\n      agent<grainsize>,\n      blocksize\n    >,\n    gridsize\n  >,\n  Closure\n> : public task_base<typename cuda_grid<gridsize,blocksize,grainsize>::type,Closure>\n{\n  private:\n    typedef task_base<typename cuda_grid<gridsize,blocksize,grainsize>::type,Closure> super_t;\n\n  public:\n    typedef typename super_t::group_type    grid_type;\n    typedef typename grid_type::agent_type  block_type;\n    typedef typename block_type::agent_type thread_type;\n    typedef typename super_t::closure_type  closure_type;\n    typedef typename grid_type::size_type   size_type;\n\n  private:\n    size_type block_offset;\n\n  public:\n\n    __host__ __device__\n    cuda_task(grid_type g, closure_type c, size_type offset)\n      : super_t(g,c),\n        block_offset(offset)\n    {}\n\n    __device__\n    void operator()()\n    {\n      \/\/ guard use of CUDA built-ins from foreign compilers\n#ifdef __CUDA_ARCH__\n      \/\/ instantiate a view of this grid\n      grid_type this_grid =\n        make_grid<grid_type>(\n          super_t::g.size(),\n          make_block<block_type>(\n            blockDim.x,\n            super_t::g.this_exec.heap_size(),\n            thread_type(threadIdx.x),\n            block_offset + blockIdx.x\n          ),\n          0\n      );\n\n#if __CUDA_ARCH__ >= 200\n      \/\/ initialize shared storage\n      if(this_grid.this_exec.this_exec.index() == 0)\n      {\n        bulk::detail::init_on_chip_malloc(this_grid.this_exec.heap_size());\n      }\n      this_grid.this_exec.wait();\n#endif\n\n      substitute_placeholders_and_execute(this_grid, super_t::c);\n#endif\n    } \/\/ end operator()\n}; \/\/ end cuda_task\n\n\n\/\/ specialize cuda_task for a single CUDA block\ntemplate<std::size_t blocksize, std::size_t grainsize, typename Closure>\nclass cuda_task<\n  concurrent_group<\n    agent<grainsize>,\n    blocksize\n  >,\n  Closure\n> : public task_base<typename cuda_block<blocksize,grainsize>::type,Closure>\n{\n  private:\n    typedef task_base<typename cuda_block<blocksize,grainsize>::type,Closure> super_t;\n\n  public:\n    typedef typename super_t::group_type    block_type;\n    typedef typename block_type::agent_type thread_type;\n    typedef typename super_t::closure_type  closure_type;\n    typedef typename block_type::size_type  size_type;\n\n  public:\n    __host__ __device__\n    cuda_task(block_type b, closure_type c)\n      : super_t(b,c)\n    {}\n\n    __device__\n    void operator()()\n    {\n      \/\/ guard use of CUDA built-ins from foreign compilers\n#ifdef __CUDA_ARCH__\n      \/\/ instantiate a view of this block\n      block_type this_block =\n        make_block<block_type>(\n          blockDim.x,\n          super_t::g.heap_size(),\n          thread_type(threadIdx.x),\n          0\n        );\n\n#if __CUDA_ARCH__ >= 200\n      \/\/ initialize shared storage\n      if(this_block.this_exec.index() == 0)\n      {\n        bulk::detail::init_on_chip_malloc(this_block.heap_size());\n      }\n      this_block.wait();\n#endif\n\n      substitute_placeholders_and_execute(this_block, super_t::c);\n#endif\n    } \/\/ end operator()\n}; \/\/ end cuda_task\n\n\n\/\/ specialize cuda_task for a single big parallel group\ntemplate<std::size_t groupsize, std::size_t grainsize, typename Closure>\nclass cuda_task<parallel_group<agent<grainsize>,groupsize>,Closure>\n  : public task_base<parallel_group<agent<grainsize>,groupsize>,Closure>\n{\n  private:\n    typedef task_base<parallel_group<agent<grainsize>,groupsize>,Closure> super_t;\n\n  public:\n    typedef typename super_t::closure_type closure_type;\n    typedef typename super_t::group_type   group_type;\n\n    __host__ __device__\n    cuda_task(group_type g, closure_type c)\n      : super_t(g,c)\n    {}\n\n    __device__\n    void operator()()\n    {\n      \/\/ guard use of CUDA built-ins from foreign compilers\n#ifdef __CUDA_ARCH__\n      const size_t grid_size = gridDim.x * blockDim.x;\n\n      for(size_t offset = blockDim.x * blockIdx.x; offset < super_t::g.size(); offset += grid_size)\n      {\n        typename group_type::size_type tid = offset + threadIdx.x;\n\n        if(tid < super_t::g.size())\n        {\n          \/\/ instantiate a view of the exec group\n          parallel_group<agent<grainsize>,groupsize> this_group(\n            1,\n            agent<grainsize>(tid),\n            0\n          );\n\n          substitute_placeholders_and_execute(this_group, super_t::c);\n        } \/\/ end if\n      } \/\/ end for\n#endif\n    } \/\/ end operator()\n}; \/\/ end cuda_task\n\n\n} \/\/ end detail\n} \/\/ end bulk\nBULK_NAMESPACE_SUFFIX\n\n<commit_msg>Eliminate a couple of registers from cuda_task<commit_after>\/*\n *  Copyright 2008-2013 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#pragma once\n\n#include <thrust\/system\/cuda\/detail\/bulk\/detail\/config.hpp>\n#include <thrust\/system\/cuda\/detail\/bulk\/malloc.hpp>\n#include <thrust\/system\/cuda\/detail\/bulk\/execution_policy.hpp>\n#include <thrust\/system\/cuda\/detail\/bulk\/detail\/tuple_transform.hpp>\n#include <thrust\/system\/cuda\/detail\/bulk\/detail\/closure.hpp>\n\n#include <thrust\/detail\/type_traits.h>\n\n\nBULK_NAMESPACE_PREFIX\nnamespace bulk\n{\nnamespace detail\n{\n\n\ntemplate<typename ExecutionGroup, typename Closure>\nclass task_base\n{\n  public:\n    typedef ExecutionGroup group_type;\n    typedef Closure        closure_type;\n\n    __host__ __device__\n    task_base(group_type g, closure_type c)\n      : c(c), g(g)\n    {}\n\n  protected:\n    __host__ __device__\n    static void substitute_placeholders_and_execute(group_type &g, closure_type &c)\n    {\n      \/\/ substitute placeholders with this_group\n      substituted_arguments_type new_args = substitute_placeholders(g, c.arguments());\n\n      \/\/ create a new closure with the new arguments\n      closure<typename closure_type::function_type, substituted_arguments_type> new_c(c.function(), new_args);\n\n      \/\/ execute the new closure\n      new_c();\n    }\n\n    closure_type c;\n    group_type g;\n\n  private:\n    template<typename T>\n    struct substitutor_result\n      : thrust::detail::eval_if<\n          bulk::detail::is_cursor<T>::value,\n          cursor_result<T,ExecutionGroup>,\n          thrust::detail::identity_<T>\n        >\n    {};\n\n    typedef typename bulk::detail::tuple_meta_transform<\n      typename closure_type::arguments_type,\n      substitutor_result\n    >::type substituted_arguments_type;\n\n    struct substitutor\n    {\n      group_type &g;\n\n      __device__\n      substitutor(group_type &g)\n        : g(g)\n      {}\n\n      template<unsigned int depth>\n      __device__\n      typename bulk::detail::cursor_result<cursor<depth>,group_type>::type\n      operator()(cursor<depth> c) const\n      {\n        return c.get(g);\n      }\n\n      template<typename T>\n      __device__\n      T &operator()(T &x) const\n      {\n        return x;\n      }\n    };\n\n    __host__ __device__\n    static substituted_arguments_type substitute_placeholders(group_type &g, typename closure_type::arguments_type args)\n    {\n      return bulk::detail::tuple_host_device_transform<substitutor_result>(args, substitutor(g));\n    }\n};\n\n\ntemplate<std::size_t blocksize, std::size_t grainsize>\nstruct cuda_block\n{\n  typedef concurrent_group<agent<grainsize>, blocksize> type;\n};\n\n\ntemplate<std::size_t gridsize, std::size_t blocksize, std::size_t grainsize>\nstruct cuda_grid\n{\n  typedef parallel_group<\n    typename cuda_block<blocksize,grainsize>::type\n  > type;\n};\n\n\ntemplate<typename Group, typename Closure> class cuda_task;\n\n\ntemplate<typename Grid>\nstruct grid_maker\n{\n  __host__ __device__\n  static Grid make(typename Grid::size_type     size,\n                   typename Grid::agent_type    block,\n                   typename Grid::size_type     index)\n  {\n    return Grid(block, index);\n  }\n};\n\n\ntemplate<typename Block>\nstruct grid_maker<parallel_group<Block,dynamic_group_size> >\n{\n  __host__ __device__\n  static parallel_group<Block,dynamic_group_size> make(typename parallel_group<Block,dynamic_group_size>::size_type size,\n                                                       Block block,\n                                                       typename parallel_group<Block,dynamic_group_size>::size_type index)\n  {\n    return parallel_group<Block,dynamic_group_size>(size, block, index);\n  }\n};\n\n\ntemplate<typename Block>\nstruct block_maker\n{\n  __host__ __device__\n  static Block make(typename Block::size_type     size,\n                    typename Block::size_type     heap_size,\n                    typename Block::agent_type    thread,\n                    typename Block::size_type     index)\n  {\n    return Block(heap_size, thread, index);\n  }\n};\n\ntemplate<typename Thread>\nstruct block_maker<concurrent_group<Thread,dynamic_group_size> >\n{\n  __host__ __device__\n  static concurrent_group<Thread,dynamic_group_size> make(typename concurrent_group<Thread,dynamic_group_size>::size_type size,\n                                                          typename concurrent_group<Thread,dynamic_group_size>::size_type heap_size,\n                                                          Thread thread,\n                                                          typename concurrent_group<Thread,dynamic_group_size>::size_type index)\n  {\n    return concurrent_group<Thread,dynamic_group_size>(size, heap_size, thread, index);\n  }\n};\n\n\ntemplate<typename Grid>\n__host__ __device__\nGrid make_grid(typename Grid::size_type size, typename Grid::agent_type block, typename Grid::size_type index = invalid_index)\n{\n  return grid_maker<Grid>::make(size, block, index);\n}\n\n\ntemplate<typename Block>\n__host__ __device__\nBlock make_block(typename Block::size_type size, typename Block::size_type heap_size, typename Block::agent_type thread = typename Block::agent_type(), typename Block::size_type index = invalid_index)\n{\n  return block_maker<Block>::make(size, heap_size, thread, index);\n}\n\n\n\/\/ specialize cuda_task for a CUDA grid\ntemplate<std::size_t gridsize, std::size_t blocksize, std::size_t grainsize, typename Closure>\nclass cuda_task<\n  parallel_group<\n    concurrent_group<\n      agent<grainsize>,\n      blocksize\n    >,\n    gridsize\n  >,\n  Closure\n> : public task_base<typename cuda_grid<gridsize,blocksize,grainsize>::type,Closure>\n{\n  private:\n    typedef task_base<typename cuda_grid<gridsize,blocksize,grainsize>::type,Closure> super_t;\n\n  public:\n    typedef typename super_t::group_type    grid_type;\n    typedef typename grid_type::agent_type  block_type;\n    typedef typename block_type::agent_type thread_type;\n    typedef typename super_t::closure_type  closure_type;\n    typedef typename grid_type::size_type   size_type;\n\n  private:\n    size_type block_offset;\n\n  public:\n\n    __host__ __device__\n    cuda_task(grid_type g, closure_type c, size_type offset)\n      : super_t(g,c),\n        block_offset(offset)\n    {}\n\n    __device__\n    void operator()()\n    {\n      \/\/ guard use of CUDA built-ins from foreign compilers\n#ifdef __CUDA_ARCH__\n      \/\/ instantiate a view of this grid\n      grid_type this_grid =\n        make_grid<grid_type>(\n          super_t::g.size(),\n          make_block<block_type>(\n            blockDim.x,\n            super_t::g.this_exec.heap_size(),\n            thread_type(threadIdx.x),\n            block_offset + blockIdx.x\n          ),\n          0\n      );\n\n#if __CUDA_ARCH__ >= 200\n      \/\/ initialize shared storage\n      if(this_grid.this_exec.this_exec.index() == 0)\n      {\n        bulk::detail::init_on_chip_malloc(this_grid.this_exec.heap_size());\n      }\n      this_grid.this_exec.wait();\n#endif\n\n      substitute_placeholders_and_execute(this_grid, super_t::c);\n#endif\n    } \/\/ end operator()\n}; \/\/ end cuda_task\n\n\n\/\/ specialize cuda_task for a single CUDA block\ntemplate<std::size_t blocksize, std::size_t grainsize, typename Closure>\nclass cuda_task<\n  concurrent_group<\n    agent<grainsize>,\n    blocksize\n  >,\n  Closure\n> : public task_base<typename cuda_block<blocksize,grainsize>::type,Closure>\n{\n  private:\n    typedef task_base<typename cuda_block<blocksize,grainsize>::type,Closure> super_t;\n\n  public:\n    typedef typename super_t::group_type    block_type;\n    typedef typename block_type::agent_type thread_type;\n    typedef typename super_t::closure_type  closure_type;\n    typedef typename block_type::size_type  size_type;\n\n  public:\n    __host__ __device__\n    cuda_task(block_type b, closure_type c)\n      : super_t(b,c)\n    {}\n\n    __device__\n    void operator()()\n    {\n      \/\/ guard use of CUDA built-ins from foreign compilers\n#ifdef __CUDA_ARCH__\n      \/\/ instantiate a view of this block\n      block_type this_block =\n        make_block<block_type>(\n          blockDim.x,\n          super_t::g.heap_size(),\n          thread_type(threadIdx.x),\n          0\n        );\n\n#if __CUDA_ARCH__ >= 200\n      \/\/ initialize shared storage\n      if(this_block.this_exec.index() == 0)\n      {\n        bulk::detail::init_on_chip_malloc(this_block.heap_size());\n      }\n      this_block.wait();\n#endif\n\n      substitute_placeholders_and_execute(this_block, super_t::c);\n#endif\n    } \/\/ end operator()\n}; \/\/ end cuda_task\n\n\n\/\/ specialize cuda_task for a single big parallel group\ntemplate<std::size_t groupsize, std::size_t grainsize, typename Closure>\nclass cuda_task<parallel_group<agent<grainsize>,groupsize>,Closure>\n  : public task_base<parallel_group<agent<grainsize>,groupsize>,Closure>\n{\n  private:\n    typedef task_base<parallel_group<agent<grainsize>,groupsize>,Closure> super_t;\n\n  public:\n    typedef typename super_t::closure_type closure_type;\n    typedef typename super_t::group_type   group_type;\n\n    __host__ __device__\n    cuda_task(group_type g, closure_type c)\n      : super_t(g,c)\n    {}\n\n    __device__\n    void operator()()\n    {\n      \/\/ guard use of CUDA built-ins from foreign compilers\n#ifdef __CUDA_ARCH__\n      typedef int size_type;\n\n      const size_type grid_size = gridDim.x * blockDim.x;\n\n      for(size_type tid = blockDim.x * blockIdx.x + threadIdx.x;\n          tid < super_t::g.size();\n          tid += grid_size)\n      {\n        \/\/ instantiate a view of the exec group\n        parallel_group<agent<grainsize>,groupsize> this_group(\n          1,\n          agent<grainsize>(tid),\n          0\n        );\n\n        substitute_placeholders_and_execute(this_group, super_t::c);\n      } \/\/ end for\n#endif\n    } \/\/ end operator()\n}; \/\/ end cuda_task\n\n\n} \/\/ end detail\n} \/\/ end bulk\nBULK_NAMESPACE_SUFFIX\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#45879 - fix selected gluepoint rendering.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: xmlcoli.cxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: sab $ $Date: 2001-09-25 10:37: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#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n#include \"xmlcoli.hxx\"\n#include \"xmlimprt.hxx\"\n#include \"global.hxx\"\n#include \"xmlstyli.hxx\"\n#include \"document.hxx\"\n#include \"docuno.hxx\"\n#include \"olinetab.hxx\"\n\n#ifndef SC_UNONAMES_HXX\n#include \"unonames.hxx\"\n#endif\n\n#include <xmloff\/xmltkmap.hxx>\n#include <xmloff\/nmspmap.hxx>\n#include <xmloff\/xmlnmspe.hxx>\n#ifndef _XMLOFF_FAMILIES_HXX_\n#include <xmloff\/families.hxx>\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include <xmloff\/xmltoken.hxx>\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#ifndef _COM_SUN_STAR_TABLE_XCOLUMNROWRANGE_HPP_\n#include <com\/sun\/star\/table\/XColumnRowRange.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SHEET_XPRINTAREAS_HPP_\n#include <com\/sun\/star\/sheet\/XPrintAreas.hpp>\n#endif\n\nusing namespace com::sun::star;\nusing namespace xmloff::token;\n\n\/\/------------------------------------------------------------------\n\nScXMLTableColContext::ScXMLTableColContext( ScXMLImport& rImport,\n                                      USHORT nPrfx,\n                                      const ::rtl::OUString& rLName,\n                                      const ::com::sun::star::uno::Reference<\n                                      ::com::sun::star::xml::sax::XAttributeList>& xAttrList ) :\n    SvXMLImportContext( rImport, nPrfx, rLName ),\n    sVisibility(GetXMLToken(XML_VISIBLE))\n{\n    nColCount = 1;\n    sal_Int16 nAttrCount = xAttrList.is() ? xAttrList->getLength() : 0;\n    const SvXMLTokenMap& rAttrTokenMap = GetScImport().GetTableColAttrTokenMap();\n\n    for( sal_Int16 i=0; i < nAttrCount; i++ )\n    {\n        rtl::OUString sAttrName = xAttrList->getNameByIndex( i );\n        rtl::OUString aLocalName;\n        sal_uInt16 nPrefix = GetScImport().GetNamespaceMap().GetKeyByAttrName(\n                                            sAttrName, &aLocalName );\n        rtl::OUString sValue = xAttrList->getValueByIndex( i );\n\n        switch( rAttrTokenMap.Get( nPrefix, aLocalName ) )\n        {\n            case XML_TOK_TABLE_COL_ATTR_REPEATED:\n                {\n                    nColCount = sValue.toInt32();\n                }\n                break;\n            case XML_TOK_TABLE_COL_ATTR_STYLE_NAME:\n                {\n                    sStyleName = sValue;\n                }\n                break;\n            case XML_TOK_TABLE_COL_ATTR_VISIBILITY:\n                {\n                    sVisibility = sValue;\n                }\n                break;\n            case XML_TOK_TABLE_COL_ATTR_DEFAULT_CELL_STYLE_NAME:\n                {\n                    sCellStyleName = sValue;\n                }\n                break;\n        }\n    }\n}\n\nScXMLTableColContext::~ScXMLTableColContext()\n{\n}\n\nSvXMLImportContext *ScXMLTableColContext::CreateChildContext( USHORT nPrefix,\n                                            const ::rtl::OUString& rLName,\n                                            const ::com::sun::star::uno::Reference<\n                                          ::com::sun::star::xml::sax::XAttributeList>& xAttrList )\n{\n    SvXMLImportContext *pContext = 0;\n\/*\n    const SvXMLTokenMap& rTokenMap = GetScImport().GetTableRowElemTokenMap();\n    sal_Bool bHeader = sal_False;\n    switch( rTokenMap.Get( nPrefix, rLName ) )\n    {\n    case XML_TOK_TABLE_ROW_CELL:\n\/\/      if( IsInsertCellPossible() )\n            pContext = new ScXMLTableRowCellContext( GetScImport(), nPrefix,\n                                                      rLName, xAttrList\/\/,\n                                                      \/\/this\n                                                      );\n        break;\n    case XML_TOK_TABLE_ROW_COVERED_CELL:\n\/\/      if( IsInsertCellPossible() )\n            pContext = new ScXMLTableRowCellContext( GetScImport(), nPrefix,\n                                                      rLName, xAttrList\/\/,\n                                                      \/\/this\n                                                      );\n        break;\n    }*\/\n\n    if( !pContext )\n        pContext = new SvXMLImportContext( GetImport(), nPrefix, rLName );\n\n    return pContext;\n}\n\nvoid ScXMLTableColContext::EndElement()\n{\n    ScXMLImport& rXMLImport = GetScImport();\n    \/\/sal_Int16 nSheet = rXMLImport.GetTables().GetCurrentSheet();\n    sal_Int32 nCurrentColumn = rXMLImport.GetTables().GetCurrentColumn();\n    uno::Reference<sheet::XSpreadsheet> xSheet = rXMLImport.GetTables().GetCurrentXSheet();\n    if(xSheet.is())\n    {\n        sal_Int32 nLastColumn(nCurrentColumn + nColCount - 1);\n        if (nLastColumn > MAXCOL)\n            nLastColumn = MAXCOL;\n        if (nCurrentColumn > MAXCOL)\n            nCurrentColumn = MAXCOL;\n        uno::Reference <table::XCellRange> xCellRange = xSheet->getCellRangeByPosition(nCurrentColumn, 0, nLastColumn, 0);\n        if (xCellRange.is())\n        {\n            uno::Reference<table::XColumnRowRange> xColumnRowRange (xCellRange, uno::UNO_QUERY);\n            if (xColumnRowRange.is())\n            {\n                uno::Reference<table::XTableColumns> xTableColumns = xColumnRowRange->getColumns();\n                if (xTableColumns.is())\n                {\n                    uno::Reference <beans::XPropertySet> xColumnProperties(xTableColumns, uno::UNO_QUERY);\n                    if (xColumnProperties.is())\n                    {\n                        if (sStyleName.getLength())\n                        {\n                            XMLTableStylesContext *pStyles = (XMLTableStylesContext *)rXMLImport.GetAutoStyles();\n                            XMLTableStyleContext* pStyle = (XMLTableStyleContext *)pStyles->FindStyleChildContext(\n                                XML_STYLE_FAMILY_TABLE_COLUMN, sStyleName, sal_True);\n                            if (pStyle)\n                                pStyle->FillPropertySet(xColumnProperties);\n                        }\n                        rtl::OUString sVisible(RTL_CONSTASCII_USTRINGPARAM(SC_UNONAME_CELLVIS));\n                        uno::Any aAny = xColumnProperties->getPropertyValue(sVisible);\n                        if (IsXMLToken(sVisibility, XML_VISIBLE))\n                        {\n                            sal_Bool bValue = sal_True;\n                            aAny <<= bValue;\n                        }\n                        else\n                        {\n                            sal_Bool bValue = sal_False;\n                            aAny <<= bValue;\n                        }\n                        xColumnProperties->setPropertyValue(sVisible, aAny);\n                    }\n                }\n            }\n        }\n    }\n    GetScImport().GetTables().AddColCount(nColCount);\n    GetScImport().GetTables().AddColStyle(nColCount, sCellStyleName);\n}\n\nScXMLTableColsContext::ScXMLTableColsContext( ScXMLImport& rImport,\n                                      USHORT nPrfx,\n                                      const ::rtl::OUString& rLName,\n                                      const ::com::sun::star::uno::Reference<\n                                      ::com::sun::star::xml::sax::XAttributeList>& xAttrList,\n                                      const sal_Bool bTempHeader, const sal_Bool bTempGroup) :\n    SvXMLImportContext( rImport, nPrfx, rLName ),\n    nHeaderStartCol(0),\n    nHeaderEndCol(0),\n    nGroupStartCol(0),\n    nGroupEndCol(0),\n    bHeader(bTempHeader),\n    bGroup(bTempGroup),\n    bGroupDisplay(sal_True)\n{\n    \/\/ don't have any attributes\n    if (bHeader)\n        nHeaderStartCol = rImport.GetTables().GetCurrentColumn();\n    else if (bGroup)\n    {\n        nGroupStartCol = rImport.GetTables().GetCurrentColumn();\n        sal_Int16 nAttrCount = xAttrList.is() ? xAttrList->getLength() : 0;\n        for( sal_Int16 i=0; i < nAttrCount; i++ )\n        {\n            rtl::OUString sAttrName = xAttrList->getNameByIndex( i );\n            rtl::OUString aLocalName;\n            sal_uInt16 nPrefix = GetScImport().GetNamespaceMap().GetKeyByAttrName(\n                                                sAttrName, &aLocalName );\n            rtl::OUString sValue = xAttrList->getValueByIndex( i );\n\n            if (nPrfx == XML_NAMESPACE_TABLE && IsXMLToken(aLocalName, XML_DISPLAY))\n            {\n                if (IsXMLToken(sValue, XML_FALSE))\n                    bGroupDisplay = sal_False;\n            }\n        }\n    }\n}\n\nScXMLTableColsContext::~ScXMLTableColsContext()\n{\n}\n\nSvXMLImportContext *ScXMLTableColsContext::CreateChildContext( USHORT nPrefix,\n                                            const ::rtl::OUString& rLName,\n                                            const ::com::sun::star::uno::Reference<\n                                          ::com::sun::star::xml::sax::XAttributeList>& xAttrList )\n{\n    SvXMLImportContext *pContext = 0;\n\n    const SvXMLTokenMap& rTokenMap = GetScImport().GetTableColsElemTokenMap();\n    sal_Bool bHeader = sal_False;\n    switch( rTokenMap.Get( nPrefix, rLName ) )\n    {\n    case XML_TOK_TABLE_COLS_COL_GROUP:\n        pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n                                                   rLName, xAttrList,\n                                                   sal_False, sal_True );\n        break;\n    case XML_TOK_TABLE_COLS_HEADER_COLS:\n        pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n                                                   rLName, xAttrList,\n                                                   sal_True, sal_False );\n        break;\n    case XML_TOK_TABLE_COLS_COLS:\n        pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n                                                   rLName, xAttrList,\n                                                   sal_False, sal_False );\n        break;\n    case XML_TOK_TABLE_COLS_COL:\n            pContext = new ScXMLTableColContext( GetScImport(), nPrefix,\n                                                      rLName, xAttrList\/\/,\n                                                      \/\/this\n                                                      );\n        break;\n    }\n\n    if( !pContext )\n        pContext = new SvXMLImportContext( GetImport(), nPrefix, rLName );\n\n    return pContext;\n}\n\nvoid ScXMLTableColsContext::EndElement()\n{\n    ScXMLImport& rXMLImport = GetScImport();\n    if (bHeader)\n    {\n        nHeaderEndCol = rXMLImport.GetTables().GetCurrentColumn();\n        nHeaderEndCol--;\n        if (nHeaderStartCol <= nHeaderEndCol)\n        {\n            uno::Reference<sheet::XSpreadsheet> xSheet = rXMLImport.GetTables().GetCurrentXSheet();\n            if(xSheet.is())\n            {\n                uno::Reference <sheet::XPrintAreas> xPrintAreas (xSheet, uno::UNO_QUERY);\n                if (xPrintAreas.is())\n                {\n                    if (!xPrintAreas->getPrintTitleColumns())\n                    {\n                        xPrintAreas->setPrintTitleColumns(sal_True);\n                        table::CellRangeAddress aColumnHeaderRange;\n                        aColumnHeaderRange.StartColumn = nHeaderStartCol;\n                        aColumnHeaderRange.EndColumn = nHeaderEndCol;\n                        xPrintAreas->setTitleColumns(aColumnHeaderRange);\n                    }\n                    else\n                    {\n                        table::CellRangeAddress aColumnHeaderRange = xPrintAreas->getTitleColumns();\n                        aColumnHeaderRange.EndColumn = nHeaderEndCol;\n                        xPrintAreas->setTitleColumns(aColumnHeaderRange);\n                    }\n                }\n            }\n        }\n    }\n    else if (bGroup)\n    {\n        sal_Int16 nSheet = rXMLImport.GetTables().GetCurrentSheet();\n        nGroupEndCol = rXMLImport.GetTables().GetCurrentColumn();\n        nGroupEndCol--;\n        if (nGroupStartCol <= nGroupEndCol)\n        {\n            ScDocument* pDoc = GetScImport().GetDocument();\n            if (pDoc)\n            {\n                rXMLImport.LockSolarMutex();\n                ScOutlineTable* pOutlineTable = pDoc->GetOutlineTable(nSheet, sal_True);\n                ScOutlineArray* pColArray = pOutlineTable ? pOutlineTable->GetColArray() : NULL;\n                if (pColArray)\n                {\n                    sal_Bool bResized;\n                    pColArray->Insert(static_cast<USHORT>(nGroupStartCol), static_cast<USHORT>(nGroupEndCol), bResized, !bGroupDisplay, sal_True);\n                }\n                rXMLImport.UnlockSolarMutex();\n            }\n        }\n    }\n}\n<commit_msg>INTEGRATION: CWS rowlimit (1.15.324); FILE MERGED 2004\/03\/04 18:16:29 er 1.15.324.2: #i1967# type correctness 2004\/02\/13 17:17:08 er 1.15.324.1: #i1967# document interface uses SCCOL\/SCROW\/SCTAB, API and filter use sal_Int32<commit_after>\/*************************************************************************\n *\n *  $RCSfile: xmlcoli.cxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: obo $ $Date: 2004-06-04 11:12: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#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n#include \"xmlcoli.hxx\"\n#include \"xmlimprt.hxx\"\n#include \"global.hxx\"\n#include \"xmlstyli.hxx\"\n#include \"document.hxx\"\n#include \"docuno.hxx\"\n#include \"olinetab.hxx\"\n\n#ifndef SC_UNONAMES_HXX\n#include \"unonames.hxx\"\n#endif\n\n#include <xmloff\/xmltkmap.hxx>\n#include <xmloff\/nmspmap.hxx>\n#include <xmloff\/xmlnmspe.hxx>\n#ifndef _XMLOFF_FAMILIES_HXX_\n#include <xmloff\/families.hxx>\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include <xmloff\/xmltoken.hxx>\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#ifndef _COM_SUN_STAR_TABLE_XCOLUMNROWRANGE_HPP_\n#include <com\/sun\/star\/table\/XColumnRowRange.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SHEET_XPRINTAREAS_HPP_\n#include <com\/sun\/star\/sheet\/XPrintAreas.hpp>\n#endif\n\nusing namespace com::sun::star;\nusing namespace xmloff::token;\n\n\/\/------------------------------------------------------------------\n\nScXMLTableColContext::ScXMLTableColContext( ScXMLImport& rImport,\n                                      USHORT nPrfx,\n                                      const ::rtl::OUString& rLName,\n                                      const ::com::sun::star::uno::Reference<\n                                      ::com::sun::star::xml::sax::XAttributeList>& xAttrList ) :\n    SvXMLImportContext( rImport, nPrfx, rLName ),\n    sVisibility(GetXMLToken(XML_VISIBLE))\n{\n    nColCount = 1;\n    sal_Int16 nAttrCount = xAttrList.is() ? xAttrList->getLength() : 0;\n    const SvXMLTokenMap& rAttrTokenMap = GetScImport().GetTableColAttrTokenMap();\n\n    for( sal_Int16 i=0; i < nAttrCount; i++ )\n    {\n        rtl::OUString sAttrName = xAttrList->getNameByIndex( i );\n        rtl::OUString aLocalName;\n        sal_uInt16 nPrefix = GetScImport().GetNamespaceMap().GetKeyByAttrName(\n                                            sAttrName, &aLocalName );\n        rtl::OUString sValue = xAttrList->getValueByIndex( i );\n\n        switch( rAttrTokenMap.Get( nPrefix, aLocalName ) )\n        {\n            case XML_TOK_TABLE_COL_ATTR_REPEATED:\n                {\n                    nColCount = sValue.toInt32();\n                }\n                break;\n            case XML_TOK_TABLE_COL_ATTR_STYLE_NAME:\n                {\n                    sStyleName = sValue;\n                }\n                break;\n            case XML_TOK_TABLE_COL_ATTR_VISIBILITY:\n                {\n                    sVisibility = sValue;\n                }\n                break;\n            case XML_TOK_TABLE_COL_ATTR_DEFAULT_CELL_STYLE_NAME:\n                {\n                    sCellStyleName = sValue;\n                }\n                break;\n        }\n    }\n}\n\nScXMLTableColContext::~ScXMLTableColContext()\n{\n}\n\nSvXMLImportContext *ScXMLTableColContext::CreateChildContext( USHORT nPrefix,\n                                            const ::rtl::OUString& rLName,\n                                            const ::com::sun::star::uno::Reference<\n                                          ::com::sun::star::xml::sax::XAttributeList>& xAttrList )\n{\n    SvXMLImportContext *pContext = 0;\n\/*\n    const SvXMLTokenMap& rTokenMap = GetScImport().GetTableRowElemTokenMap();\n    sal_Bool bHeader = sal_False;\n    switch( rTokenMap.Get( nPrefix, rLName ) )\n    {\n    case XML_TOK_TABLE_ROW_CELL:\n\/\/      if( IsInsertCellPossible() )\n            pContext = new ScXMLTableRowCellContext( GetScImport(), nPrefix,\n                                                      rLName, xAttrList\/\/,\n                                                      \/\/this\n                                                      );\n        break;\n    case XML_TOK_TABLE_ROW_COVERED_CELL:\n\/\/      if( IsInsertCellPossible() )\n            pContext = new ScXMLTableRowCellContext( GetScImport(), nPrefix,\n                                                      rLName, xAttrList\/\/,\n                                                      \/\/this\n                                                      );\n        break;\n    }*\/\n\n    if( !pContext )\n        pContext = new SvXMLImportContext( GetImport(), nPrefix, rLName );\n\n    return pContext;\n}\n\nvoid ScXMLTableColContext::EndElement()\n{\n    ScXMLImport& rXMLImport = GetScImport();\n    \/\/sal_Int32 nSheet = rXMLImport.GetTables().GetCurrentSheet();\n    sal_Int32 nCurrentColumn = rXMLImport.GetTables().GetCurrentColumn();\n    uno::Reference<sheet::XSpreadsheet> xSheet = rXMLImport.GetTables().GetCurrentXSheet();\n    if(xSheet.is())\n    {\n        sal_Int32 nLastColumn(nCurrentColumn + nColCount - 1);\n        if (nLastColumn > MAXCOL)\n            nLastColumn = MAXCOL;\n        if (nCurrentColumn > MAXCOL)\n            nCurrentColumn = MAXCOL;\n        uno::Reference <table::XCellRange> xCellRange = xSheet->getCellRangeByPosition(nCurrentColumn, 0, nLastColumn, 0);\n        if (xCellRange.is())\n        {\n            uno::Reference<table::XColumnRowRange> xColumnRowRange (xCellRange, uno::UNO_QUERY);\n            if (xColumnRowRange.is())\n            {\n                uno::Reference<table::XTableColumns> xTableColumns = xColumnRowRange->getColumns();\n                if (xTableColumns.is())\n                {\n                    uno::Reference <beans::XPropertySet> xColumnProperties(xTableColumns, uno::UNO_QUERY);\n                    if (xColumnProperties.is())\n                    {\n                        if (sStyleName.getLength())\n                        {\n                            XMLTableStylesContext *pStyles = (XMLTableStylesContext *)rXMLImport.GetAutoStyles();\n                            XMLTableStyleContext* pStyle = (XMLTableStyleContext *)pStyles->FindStyleChildContext(\n                                XML_STYLE_FAMILY_TABLE_COLUMN, sStyleName, sal_True);\n                            if (pStyle)\n                                pStyle->FillPropertySet(xColumnProperties);\n                        }\n                        rtl::OUString sVisible(RTL_CONSTASCII_USTRINGPARAM(SC_UNONAME_CELLVIS));\n                        uno::Any aAny = xColumnProperties->getPropertyValue(sVisible);\n                        if (IsXMLToken(sVisibility, XML_VISIBLE))\n                        {\n                            sal_Bool bValue = sal_True;\n                            aAny <<= bValue;\n                        }\n                        else\n                        {\n                            sal_Bool bValue = sal_False;\n                            aAny <<= bValue;\n                        }\n                        xColumnProperties->setPropertyValue(sVisible, aAny);\n                    }\n                }\n            }\n        }\n    }\n    GetScImport().GetTables().AddColCount(nColCount);\n    GetScImport().GetTables().AddColStyle(nColCount, sCellStyleName);\n}\n\nScXMLTableColsContext::ScXMLTableColsContext( ScXMLImport& rImport,\n                                      USHORT nPrfx,\n                                      const ::rtl::OUString& rLName,\n                                      const ::com::sun::star::uno::Reference<\n                                      ::com::sun::star::xml::sax::XAttributeList>& xAttrList,\n                                      const sal_Bool bTempHeader, const sal_Bool bTempGroup) :\n    SvXMLImportContext( rImport, nPrfx, rLName ),\n    nHeaderStartCol(0),\n    nHeaderEndCol(0),\n    nGroupStartCol(0),\n    nGroupEndCol(0),\n    bHeader(bTempHeader),\n    bGroup(bTempGroup),\n    bGroupDisplay(sal_True)\n{\n    \/\/ don't have any attributes\n    if (bHeader)\n        nHeaderStartCol = rImport.GetTables().GetCurrentColumn();\n    else if (bGroup)\n    {\n        nGroupStartCol = rImport.GetTables().GetCurrentColumn();\n        sal_Int16 nAttrCount = xAttrList.is() ? xAttrList->getLength() : 0;\n        for( sal_Int16 i=0; i < nAttrCount; i++ )\n        {\n            rtl::OUString sAttrName = xAttrList->getNameByIndex( i );\n            rtl::OUString aLocalName;\n            sal_uInt16 nPrefix = GetScImport().GetNamespaceMap().GetKeyByAttrName(\n                                                sAttrName, &aLocalName );\n            rtl::OUString sValue = xAttrList->getValueByIndex( i );\n\n            if (nPrfx == XML_NAMESPACE_TABLE && IsXMLToken(aLocalName, XML_DISPLAY))\n            {\n                if (IsXMLToken(sValue, XML_FALSE))\n                    bGroupDisplay = sal_False;\n            }\n        }\n    }\n}\n\nScXMLTableColsContext::~ScXMLTableColsContext()\n{\n}\n\nSvXMLImportContext *ScXMLTableColsContext::CreateChildContext( USHORT nPrefix,\n                                            const ::rtl::OUString& rLName,\n                                            const ::com::sun::star::uno::Reference<\n                                          ::com::sun::star::xml::sax::XAttributeList>& xAttrList )\n{\n    SvXMLImportContext *pContext = 0;\n\n    const SvXMLTokenMap& rTokenMap = GetScImport().GetTableColsElemTokenMap();\n    sal_Bool bHeader = sal_False;\n    switch( rTokenMap.Get( nPrefix, rLName ) )\n    {\n    case XML_TOK_TABLE_COLS_COL_GROUP:\n        pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n                                                   rLName, xAttrList,\n                                                   sal_False, sal_True );\n        break;\n    case XML_TOK_TABLE_COLS_HEADER_COLS:\n        pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n                                                   rLName, xAttrList,\n                                                   sal_True, sal_False );\n        break;\n    case XML_TOK_TABLE_COLS_COLS:\n        pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n                                                   rLName, xAttrList,\n                                                   sal_False, sal_False );\n        break;\n    case XML_TOK_TABLE_COLS_COL:\n            pContext = new ScXMLTableColContext( GetScImport(), nPrefix,\n                                                      rLName, xAttrList\/\/,\n                                                      \/\/this\n                                                      );\n        break;\n    }\n\n    if( !pContext )\n        pContext = new SvXMLImportContext( GetImport(), nPrefix, rLName );\n\n    return pContext;\n}\n\nvoid ScXMLTableColsContext::EndElement()\n{\n    ScXMLImport& rXMLImport = GetScImport();\n    if (bHeader)\n    {\n        nHeaderEndCol = rXMLImport.GetTables().GetCurrentColumn();\n        nHeaderEndCol--;\n        if (nHeaderStartCol <= nHeaderEndCol)\n        {\n            uno::Reference<sheet::XSpreadsheet> xSheet = rXMLImport.GetTables().GetCurrentXSheet();\n            if(xSheet.is())\n            {\n                uno::Reference <sheet::XPrintAreas> xPrintAreas (xSheet, uno::UNO_QUERY);\n                if (xPrintAreas.is())\n                {\n                    if (!xPrintAreas->getPrintTitleColumns())\n                    {\n                        xPrintAreas->setPrintTitleColumns(sal_True);\n                        table::CellRangeAddress aColumnHeaderRange;\n                        aColumnHeaderRange.StartColumn = nHeaderStartCol;\n                        aColumnHeaderRange.EndColumn = nHeaderEndCol;\n                        xPrintAreas->setTitleColumns(aColumnHeaderRange);\n                    }\n                    else\n                    {\n                        table::CellRangeAddress aColumnHeaderRange = xPrintAreas->getTitleColumns();\n                        aColumnHeaderRange.EndColumn = nHeaderEndCol;\n                        xPrintAreas->setTitleColumns(aColumnHeaderRange);\n                    }\n                }\n            }\n        }\n    }\n    else if (bGroup)\n    {\n        sal_Int32 nSheet = rXMLImport.GetTables().GetCurrentSheet();\n        nGroupEndCol = rXMLImport.GetTables().GetCurrentColumn();\n        nGroupEndCol--;\n        if (nGroupStartCol <= nGroupEndCol)\n        {\n            ScDocument* pDoc = GetScImport().GetDocument();\n            if (pDoc)\n            {\n                rXMLImport.LockSolarMutex();\n                ScOutlineTable* pOutlineTable = pDoc->GetOutlineTable(static_cast<SCTAB>(nSheet), sal_True);\n                ScOutlineArray* pColArray = pOutlineTable ? pOutlineTable->GetColArray() : NULL;\n                if (pColArray)\n                {\n                    sal_Bool bResized;\n                    pColArray->Insert(static_cast<SCCOL>(nGroupStartCol), static_cast<SCCOL>(nGroupEndCol), bResized, !bGroupDisplay, sal_True);\n                }\n                rXMLImport.UnlockSolarMutex();\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity#704860 Unchecked dynamic_cast<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Access properties in the edit source when the field item is already inserted.<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 \"chrome\/browser\/autofill\/autofill_metrics.h\"\n\n#include \"base\/metrics\/histogram.h\"\n\nAutofillMetrics::AutofillMetrics() {\n}\n\nAutofillMetrics::~AutofillMetrics() {\n}\n\nvoid AutofillMetrics::Log(CreditCardInfoBarMetric metric) const {\n  DCHECK(metric < NUM_CREDIT_CARD_INFO_BAR_METRICS);\n\n  UMA_HISTOGRAM_ENUMERATION(\"Autofill.CreditCardInfoBar\", metric,\n                            NUM_CREDIT_CARD_INFO_BAR_METRICS);\n}\n\nvoid AutofillMetrics::Log(ServerQueryMetric metric) const {\n  DCHECK(metric < NUM_SERVER_QUERY_METRICS);\n\n  UMA_HISTOGRAM_ENUMERATION(\"Autofill.ServerQueryResponse\", metric,\n                            NUM_SERVER_QUERY_METRICS);\n}\n\nvoid AutofillMetrics::Log(QualityMetric metric,\n                          const std::string& experiment_id) const {\n  DCHECK(metric < NUM_QUALITY_METRICS);\n\n  std::string histogram_name = \"Autofill.Quality\";\n  if (!experiment_id.empty())\n    histogram_name += \"_\" + experiment_id;\n\n  UMA_HISTOGRAM_ENUMERATION(histogram_name, metric, NUM_QUALITY_METRICS);\n}\n\nvoid AutofillMetrics::LogStoredProfileCount(size_t num_profiles) const {\n  UMA_HISTOGRAM_COUNTS(\"Autofill.StoredProfileCount\", num_profiles);\n}\n\nvoid AutofillMetrics::LogAddressSuggestionsCount(size_t num_suggestions) const {\n  printf(\"LogAddressSuggestionsCount(%d)\\n\", (int)num_suggestions);\n  UMA_HISTOGRAM_COUNTS(\"Autofill.AddressSuggestionsCount\", num_suggestions);\n}\n\n<commit_msg>Remove a stray debugging printf<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\/autofill\/autofill_metrics.h\"\n\n#include \"base\/metrics\/histogram.h\"\n\nAutofillMetrics::AutofillMetrics() {\n}\n\nAutofillMetrics::~AutofillMetrics() {\n}\n\nvoid AutofillMetrics::Log(CreditCardInfoBarMetric metric) const {\n  DCHECK(metric < NUM_CREDIT_CARD_INFO_BAR_METRICS);\n\n  UMA_HISTOGRAM_ENUMERATION(\"Autofill.CreditCardInfoBar\", metric,\n                            NUM_CREDIT_CARD_INFO_BAR_METRICS);\n}\n\nvoid AutofillMetrics::Log(ServerQueryMetric metric) const {\n  DCHECK(metric < NUM_SERVER_QUERY_METRICS);\n\n  UMA_HISTOGRAM_ENUMERATION(\"Autofill.ServerQueryResponse\", metric,\n                            NUM_SERVER_QUERY_METRICS);\n}\n\nvoid AutofillMetrics::Log(QualityMetric metric,\n                          const std::string& experiment_id) const {\n  DCHECK(metric < NUM_QUALITY_METRICS);\n\n  std::string histogram_name = \"Autofill.Quality\";\n  if (!experiment_id.empty())\n    histogram_name += \"_\" + experiment_id;\n\n  UMA_HISTOGRAM_ENUMERATION(histogram_name, metric, NUM_QUALITY_METRICS);\n}\n\nvoid AutofillMetrics::LogStoredProfileCount(size_t num_profiles) const {\n  UMA_HISTOGRAM_COUNTS(\"Autofill.StoredProfileCount\", num_profiles);\n}\n\nvoid AutofillMetrics::LogAddressSuggestionsCount(size_t num_suggestions) const {\n  UMA_HISTOGRAM_COUNTS(\"Autofill.AddressSuggestionsCount\", num_suggestions);\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix exception in DownloadManager if the download has no extension.<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 \"chrome\/common\/net\/gaia\/gaia_oauth_client.h\"\n\n#include \"base\/json\/json_reader.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/values.h\"\n#include \"chrome\/common\/net\/http_return.h\"\n#include \"chrome\/common\/net\/url_fetcher.h\"\n#include \"chrome\/common\/net\/url_request_context_getter.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/base\/escape.h\"\n\nnamespace {\nconst char kAccessTokenValue[] = \"access_token\";\nconst char kRefreshTokenValue[] = \"refresh_token\";\nconst char kExpiresInValue[] = \"expires_in\";\n}\n\nnamespace gaia {\n\nclass GaiaOAuthClient::Core\n    : public base::RefCountedThreadSafe<GaiaOAuthClient::Core>,\n      public URLFetcher::Delegate {\n public:\n  Core(const std::string& gaia_url,\n       URLRequestContextGetter* request_context_getter)\n           : gaia_url_(gaia_url),\n             num_retries_(0),\n             request_context_getter_(request_context_getter) { }\n\n  virtual ~Core() { }\n\n  void GetTokensFromAuthCode(const OAuthClientInfo& oauth_client_info,\n                             const std::string& auth_code,\n                             int max_retries,\n                             GaiaOAuthClient::Delegate* delegate);\n  void RefreshToken(const OAuthClientInfo& oauth_client_info,\n                    const std::string& refresh_token,\n                    int max_retries,\n                    GaiaOAuthClient::Delegate* delegate);\n\n  \/\/ URLFetcher::Delegate implementation.\n  virtual void OnURLFetchComplete(\n    const URLFetcher* source,\n    const GURL& url,\n    const net::URLRequestStatus& status,\n    int response_code,\n    const ResponseCookies& cookies,\n    const std::string& data);\n\n private:\n  void MakeGaiaRequest(std::string post_body,\n                       int max_retries,\n                       GaiaOAuthClient::Delegate* delegate);\n  void HandleResponse(const URLFetcher* source,\n                      const GURL& url,\n                      const net::URLRequestStatus& status,\n                      int response_code,\n                      const std::string& data,\n                      bool* should_retry_request);\n\n  GURL gaia_url_;\n  int num_retries_;\n  scoped_refptr<URLRequestContextGetter> request_context_getter_;\n  GaiaOAuthClient::Delegate* delegate_;\n  scoped_ptr<URLFetcher> request_;\n};\n\nvoid GaiaOAuthClient::Core::GetTokensFromAuthCode(\n    const OAuthClientInfo& oauth_client_info,\n    const std::string& auth_code,\n    int max_retries,\n    GaiaOAuthClient::Delegate* delegate) {\n  std::string post_body =\n      \"code=\" + EscapeUrlEncodedData(auth_code) +\n      \"&client_id=\" + EscapeUrlEncodedData(oauth_client_info.client_id) +\n      \"&client_secret=\" +\n      EscapeUrlEncodedData(oauth_client_info.client_secret) +\n      \"&redirect_uri=oob&grant_type=authorization_code\";\n  MakeGaiaRequest(post_body, max_retries, delegate);\n}\n\nvoid GaiaOAuthClient::Core::RefreshToken(\n    const OAuthClientInfo& oauth_client_info,\n    const std::string& refresh_token,\n    int max_retries,\n    GaiaOAuthClient::Delegate* delegate) {\n  std::string post_body =\n      \"refresh_token=\" + EscapeUrlEncodedData(refresh_token) +\n      \"&client_id=\" + EscapeUrlEncodedData(oauth_client_info.client_id) +\n      \"&client_secret=\" +\n      EscapeUrlEncodedData(oauth_client_info.client_secret) +\n      \"&grant_type=refresh_token\";\n  MakeGaiaRequest(post_body, max_retries, delegate);\n}\n\nvoid GaiaOAuthClient::Core::MakeGaiaRequest(\n    std::string post_body,\n    int max_retries,\n    GaiaOAuthClient::Delegate* delegate) {\n  DCHECK(!request_.get()) << \"Tried to fetch two things at once!\";\n  delegate_ = delegate;\n  num_retries_ = 0;\n  request_.reset(URLFetcher::Create(0, gaia_url_, URLFetcher::POST, this));\n  request_->set_request_context(request_context_getter_);\n  request_->set_upload_data(\"application\/x-www-form-urlencoded\", post_body);\n  request_->set_max_retries(max_retries);\n  request_->Start();\n}\n\n\/\/ URLFetcher::Delegate implementation.\nvoid GaiaOAuthClient::Core::OnURLFetchComplete(\n    const URLFetcher* source,\n    const GURL& url,\n    const net::URLRequestStatus& status,\n    int response_code,\n    const ResponseCookies& cookies,\n    const std::string& data) {\n  bool should_retry = false;\n  HandleResponse(source, url, status, response_code, data, &should_retry);\n  if (should_retry) {\n    \/\/ If the response code is greater than or equal to 500, then the back-off\n    \/\/ period has been increased at the network level; otherwise, explicitly\n    \/\/ call ReceivedContentWasMalformed() to count the current request as a\n    \/\/ failure and increase the back-off period.\n    if (response_code < 500)\n      request_->ReceivedContentWasMalformed();\n    num_retries_++;\n    request_->Start();\n  } else {\n    request_.reset();\n  }\n}\n\nvoid GaiaOAuthClient::Core::HandleResponse(\n    const URLFetcher* source,\n    const GURL& url,\n    const net::URLRequestStatus& status,\n    int response_code,\n    const std::string& data,\n    bool* should_retry_request) {\n  *should_retry_request = false;\n  \/\/ RC_BAD_REQUEST means the arguments are invalid. No point retrying. We are\n  \/\/ done here.\n  if (response_code == RC_BAD_REQUEST) {\n    delegate_->OnOAuthError();\n    return;\n  }\n  std::string access_token;\n  std::string refresh_token;\n  int expires_in_seconds = 0;\n  if (response_code == RC_REQUEST_OK) {\n    scoped_ptr<Value> message_value(\n        base::JSONReader::Read(data, false));\n    if (message_value.get() &&\n        message_value->IsType(Value::TYPE_DICTIONARY)) {\n      scoped_ptr<DictionaryValue> response_dict(\n          static_cast<DictionaryValue*>(message_value.release()));\n      response_dict->GetString(kAccessTokenValue, &access_token);\n      response_dict->GetString(kRefreshTokenValue, &refresh_token);\n      response_dict->GetInteger(kExpiresInValue, &expires_in_seconds);\n    }\n  }\n  if (access_token.empty()) {\n    \/\/ If we don't have an access token yet and the the error was not\n    \/\/ RC_BAD_REQUEST, we may need to retry.\n    if ((-1 != source->max_retries()) &&\n        (num_retries_ > source->max_retries())) {\n      \/\/ Retry limit reached. Give up.\n      delegate_->OnNetworkError(response_code);\n    } else {\n      *should_retry_request = true;\n    }\n  } else if (refresh_token.empty()) {\n    \/\/ If we only have an access token, then this was a refresh request.\n    delegate_->OnRefreshTokenResponse(access_token, expires_in_seconds);\n  } else {\n    delegate_->OnGetTokensResponse(refresh_token,\n                                   access_token,\n                                   expires_in_seconds);\n  }\n}\n\nGaiaOAuthClient::GaiaOAuthClient(const std::string& gaia_url,\n                                 URLRequestContextGetter* context_getter) {\n  core_ = new Core(gaia_url, context_getter);\n}\n\nGaiaOAuthClient::~GaiaOAuthClient() {\n}\n\n\nvoid GaiaOAuthClient::GetTokensFromAuthCode(\n    const OAuthClientInfo& oauth_client_info,\n    const std::string& auth_code,\n    int max_retries,\n    Delegate* delegate) {\n  return core_->GetTokensFromAuthCode(oauth_client_info,\n                                      auth_code,\n                                      max_retries,\n                                      delegate);\n}\n\nvoid GaiaOAuthClient::RefreshToken(const OAuthClientInfo& oauth_client_info,\n                                   const std::string& refresh_token,\n                                   int max_retries,\n                                   Delegate* delegate) {\n  return core_->RefreshToken(oauth_client_info,\n                             refresh_token,\n                             max_retries,\n                             delegate);\n}\n\n}  \/\/ namespace gaia\n<commit_msg>Coverity: Initialize member variables.<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\/common\/net\/gaia\/gaia_oauth_client.h\"\n\n#include \"base\/json\/json_reader.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/values.h\"\n#include \"chrome\/common\/net\/http_return.h\"\n#include \"chrome\/common\/net\/url_fetcher.h\"\n#include \"chrome\/common\/net\/url_request_context_getter.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/base\/escape.h\"\n\nnamespace {\nconst char kAccessTokenValue[] = \"access_token\";\nconst char kRefreshTokenValue[] = \"refresh_token\";\nconst char kExpiresInValue[] = \"expires_in\";\n}\n\nnamespace gaia {\n\nclass GaiaOAuthClient::Core\n    : public base::RefCountedThreadSafe<GaiaOAuthClient::Core>,\n      public URLFetcher::Delegate {\n public:\n  Core(const std::string& gaia_url,\n       URLRequestContextGetter* request_context_getter)\n           : gaia_url_(gaia_url),\n             num_retries_(0),\n             request_context_getter_(request_context_getter),\n             delegate_(NULL) {}\n\n  virtual ~Core() { }\n\n  void GetTokensFromAuthCode(const OAuthClientInfo& oauth_client_info,\n                             const std::string& auth_code,\n                             int max_retries,\n                             GaiaOAuthClient::Delegate* delegate);\n  void RefreshToken(const OAuthClientInfo& oauth_client_info,\n                    const std::string& refresh_token,\n                    int max_retries,\n                    GaiaOAuthClient::Delegate* delegate);\n\n  \/\/ URLFetcher::Delegate implementation.\n  virtual void OnURLFetchComplete(\n    const URLFetcher* source,\n    const GURL& url,\n    const net::URLRequestStatus& status,\n    int response_code,\n    const ResponseCookies& cookies,\n    const std::string& data);\n\n private:\n  void MakeGaiaRequest(std::string post_body,\n                       int max_retries,\n                       GaiaOAuthClient::Delegate* delegate);\n  void HandleResponse(const URLFetcher* source,\n                      const GURL& url,\n                      const net::URLRequestStatus& status,\n                      int response_code,\n                      const std::string& data,\n                      bool* should_retry_request);\n\n  GURL gaia_url_;\n  int num_retries_;\n  scoped_refptr<URLRequestContextGetter> request_context_getter_;\n  GaiaOAuthClient::Delegate* delegate_;\n  scoped_ptr<URLFetcher> request_;\n};\n\nvoid GaiaOAuthClient::Core::GetTokensFromAuthCode(\n    const OAuthClientInfo& oauth_client_info,\n    const std::string& auth_code,\n    int max_retries,\n    GaiaOAuthClient::Delegate* delegate) {\n  std::string post_body =\n      \"code=\" + EscapeUrlEncodedData(auth_code) +\n      \"&client_id=\" + EscapeUrlEncodedData(oauth_client_info.client_id) +\n      \"&client_secret=\" +\n      EscapeUrlEncodedData(oauth_client_info.client_secret) +\n      \"&redirect_uri=oob&grant_type=authorization_code\";\n  MakeGaiaRequest(post_body, max_retries, delegate);\n}\n\nvoid GaiaOAuthClient::Core::RefreshToken(\n    const OAuthClientInfo& oauth_client_info,\n    const std::string& refresh_token,\n    int max_retries,\n    GaiaOAuthClient::Delegate* delegate) {\n  std::string post_body =\n      \"refresh_token=\" + EscapeUrlEncodedData(refresh_token) +\n      \"&client_id=\" + EscapeUrlEncodedData(oauth_client_info.client_id) +\n      \"&client_secret=\" +\n      EscapeUrlEncodedData(oauth_client_info.client_secret) +\n      \"&grant_type=refresh_token\";\n  MakeGaiaRequest(post_body, max_retries, delegate);\n}\n\nvoid GaiaOAuthClient::Core::MakeGaiaRequest(\n    std::string post_body,\n    int max_retries,\n    GaiaOAuthClient::Delegate* delegate) {\n  DCHECK(!request_.get()) << \"Tried to fetch two things at once!\";\n  delegate_ = delegate;\n  num_retries_ = 0;\n  request_.reset(URLFetcher::Create(0, gaia_url_, URLFetcher::POST, this));\n  request_->set_request_context(request_context_getter_);\n  request_->set_upload_data(\"application\/x-www-form-urlencoded\", post_body);\n  request_->set_max_retries(max_retries);\n  request_->Start();\n}\n\n\/\/ URLFetcher::Delegate implementation.\nvoid GaiaOAuthClient::Core::OnURLFetchComplete(\n    const URLFetcher* source,\n    const GURL& url,\n    const net::URLRequestStatus& status,\n    int response_code,\n    const ResponseCookies& cookies,\n    const std::string& data) {\n  bool should_retry = false;\n  HandleResponse(source, url, status, response_code, data, &should_retry);\n  if (should_retry) {\n    \/\/ If the response code is greater than or equal to 500, then the back-off\n    \/\/ period has been increased at the network level; otherwise, explicitly\n    \/\/ call ReceivedContentWasMalformed() to count the current request as a\n    \/\/ failure and increase the back-off period.\n    if (response_code < 500)\n      request_->ReceivedContentWasMalformed();\n    num_retries_++;\n    request_->Start();\n  } else {\n    request_.reset();\n  }\n}\n\nvoid GaiaOAuthClient::Core::HandleResponse(\n    const URLFetcher* source,\n    const GURL& url,\n    const net::URLRequestStatus& status,\n    int response_code,\n    const std::string& data,\n    bool* should_retry_request) {\n  *should_retry_request = false;\n  \/\/ RC_BAD_REQUEST means the arguments are invalid. No point retrying. We are\n  \/\/ done here.\n  if (response_code == RC_BAD_REQUEST) {\n    delegate_->OnOAuthError();\n    return;\n  }\n  std::string access_token;\n  std::string refresh_token;\n  int expires_in_seconds = 0;\n  if (response_code == RC_REQUEST_OK) {\n    scoped_ptr<Value> message_value(\n        base::JSONReader::Read(data, false));\n    if (message_value.get() &&\n        message_value->IsType(Value::TYPE_DICTIONARY)) {\n      scoped_ptr<DictionaryValue> response_dict(\n          static_cast<DictionaryValue*>(message_value.release()));\n      response_dict->GetString(kAccessTokenValue, &access_token);\n      response_dict->GetString(kRefreshTokenValue, &refresh_token);\n      response_dict->GetInteger(kExpiresInValue, &expires_in_seconds);\n    }\n  }\n  if (access_token.empty()) {\n    \/\/ If we don't have an access token yet and the the error was not\n    \/\/ RC_BAD_REQUEST, we may need to retry.\n    if ((-1 != source->max_retries()) &&\n        (num_retries_ > source->max_retries())) {\n      \/\/ Retry limit reached. Give up.\n      delegate_->OnNetworkError(response_code);\n    } else {\n      *should_retry_request = true;\n    }\n  } else if (refresh_token.empty()) {\n    \/\/ If we only have an access token, then this was a refresh request.\n    delegate_->OnRefreshTokenResponse(access_token, expires_in_seconds);\n  } else {\n    delegate_->OnGetTokensResponse(refresh_token,\n                                   access_token,\n                                   expires_in_seconds);\n  }\n}\n\nGaiaOAuthClient::GaiaOAuthClient(const std::string& gaia_url,\n                                 URLRequestContextGetter* context_getter) {\n  core_ = new Core(gaia_url, context_getter);\n}\n\nGaiaOAuthClient::~GaiaOAuthClient() {\n}\n\n\nvoid GaiaOAuthClient::GetTokensFromAuthCode(\n    const OAuthClientInfo& oauth_client_info,\n    const std::string& auth_code,\n    int max_retries,\n    Delegate* delegate) {\n  return core_->GetTokensFromAuthCode(oauth_client_info,\n                                      auth_code,\n                                      max_retries,\n                                      delegate);\n}\n\nvoid GaiaOAuthClient::RefreshToken(const OAuthClientInfo& oauth_client_info,\n                                   const std::string& refresh_token,\n                                   int max_retries,\n                                   Delegate* delegate) {\n  return core_->RefreshToken(oauth_client_info,\n                             refresh_token,\n                             max_retries,\n                             delegate);\n}\n\n}  \/\/ namespace gaia\n<|endoftext|>"}
{"text":"<commit_before>#include \"training-data-manager.h\"\n\n#include <sstream>\n\nconst char kDefaultTrainingDataName[] = \"Default\";\n\n\/\/ Useful macros that simplifies the coding.\n\/\/ Always check label first!\n#define CHECK_LABEL(label)                          \\\n    assert((label) > 0 && label <= num_classes_ &&  \\\n           \"Label should be [1, num_classes_]\");\n\n#define CHECK_INDEX(label, index)                       \\\n    assert((index) < num_samples_per_label_[(label)] && \\\n           \"Index exceeds the available samples\");\n\nTrainingDataManager::TrainingDataManager(uint32_t num_classes)\n        : num_classes_(num_classes) {\n    training_sample_names_.resize(num_classes + 1);\n    training_sample_scores_.resize(num_classes + 1);\n    num_samples_per_label_.resize(num_classes + 1, 0);\n\n    for (uint32_t i = 0; i <= num_classes; i++) {\n        default_label_names_.push_back(\n            std::string(\"Label \") + std::to_string(i));\n    }\n\n    data_.setDatasetName(kDefaultTrainingDataName);\n}\n\nbool TrainingDataManager::setNumDimensions(uint32_t dim) {\n    return data_.setNumDimensions(dim);\n}\n\nbool TrainingDataManager::setDatasetName(const std::string name) {\n    return data_.setDatasetName(name);\n}\n\nbool TrainingDataManager::setDatasetName(const char* const name) {\n    if ((name != NULL) && (name[0] == '\\0')) {\n        return data_.setDatasetName(std::string(name));\n    }\n    return false;\n}\n\nstd::string TrainingDataManager::getSampleName(uint32_t label, uint32_t index) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n\n    const auto& name = training_sample_names_[label][index];\n    if (name.first) {\n        return name.second;\n    } else {\n        return default_label_names_[label] + \" [\" + std::to_string(index) + \"]\";\n    }\n}\n\nbool TrainingDataManager::setSampleName(\n    uint32_t label, uint32_t index, const std::string new_name) {\n    CHECK_LABEL(label);\n\n    auto& name = training_sample_names_[label][index];\n    name.first = true;\n    name.second = new_name;\n    return true;\n}\n\nbool TrainingDataManager::addSample(\n    uint32_t label, const GRT::MatrixDouble& sample) {\n    CHECK_LABEL(label);\n\n    \/\/ By default, set the name be <false, \"\"> so we will use the default name.\n    training_sample_names_[label].push_back(\n        std::make_pair(false, std::string()));\n    training_sample_scores_[label].push_back(std::make_pair(false, 0.0));\n    data_.addSample(label, sample);\n    num_samples_per_label_[label]++;\n\n    return true;\n}\n\nstd::string TrainingDataManager::getLabelName(uint32_t label) {\n    CHECK_LABEL(label);\n    return default_label_names_[label];\n}\n\nbool TrainingDataManager::setNameForLabel(const std::string name, uint32_t label) {\n    CHECK_LABEL(label);\n    default_label_names_[label] = name;\n    return true;\n}\n\nGRT::MatrixDouble TrainingDataManager::getSample(uint32_t label, uint32_t index) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n    return data_.getClassData(label)[index].getData();\n}\n\nuint32_t TrainingDataManager::getNumSampleForLabel(uint32_t label) {\n    CHECK_LABEL(label);\n    assert(num_samples_per_label_[label] ==\n           data_.getClassData(label).getNumSamples());\n    return num_samples_per_label_[label];\n}\n\nbool TrainingDataManager::deleteSample(uint32_t label, uint32_t index) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n\n    \/\/ The implementation first remove all data and then add them back. This is\n    \/\/ a temporary solution because GRT::TimeSeriesClassificationData doesn't\n    \/\/ allow per-sample operation.\n    GRT::TimeSeriesClassificationData data = data_.getClassData(label);\n    data_.eraseAllSamplesWithClassLabel(label);\n\n    for (uint32_t i = 0; i < data.getNumSamples(); i++) {\n        if (i != index) {\n            data_.addSample(label, data[i].getData());\n        }\n    }\n\n    auto& names = training_sample_names_[label];\n    names.erase(names.begin() + index);\n\n    auto& scores = training_sample_scores_[label];\n    scores.erase(scores.begin() + index);\n\n    num_samples_per_label_[label]--;\n\n    return true;\n}\n\nbool TrainingDataManager::deleteAllSamples() {\n    for (uint32_t i = 0; i < num_classes_; i++) {\n        data_.eraseAllSamplesWithClassLabel(i + 1);\n        num_samples_per_label_[i + 1] = 0;\n    }\n    return true;\n}\n\nbool TrainingDataManager::deleteAllSamplesWithLabel(uint32_t label) {\n    CHECK_LABEL(label);\n    data_.eraseAllSamplesWithClassLabel(label);\n    num_samples_per_label_[label] = 0;\n    return true;\n}\n\nbool TrainingDataManager::relabelSample(\n    uint32_t label, uint32_t index, uint32_t new_label) {\n    CHECK_LABEL(label);\n    CHECK_LABEL(new_label);\n    CHECK_INDEX(label, index);\n\n    GRT::MatrixDouble data = getSample(label, index);\n    deleteSample(label, index);\n    addSample(new_label, data);\n\n    return true;\n}\n\nbool TrainingDataManager::trimSample(\n    uint32_t label, uint32_t index, uint32_t start, uint32_t end) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n\n    GRT::TimeSeriesClassificationData data = data_.getClassData(label);\n    data_.eraseAllSamplesWithClassLabel(label);\n\n    for (uint32_t i = 0; i < data.getNumSamples(); i++) {\n        if (i == index) {\n            GRT::MatrixDouble sample = data[i].getData();\n            GRT::MatrixDouble new_sample;\n\n            for (uint32_t row = start; row <= end; row++) {\n                new_sample.push_back(sample.getRowVector(row));\n            }\n            data_.addSample(label, new_sample);\n        } else {\n            data_.addSample(label, data[i].getData());\n        }\n    }\n    return true;\n}\n\nbool TrainingDataManager::hasSampleScore(uint32_t label, uint32_t index) {\n    if (!(label > 0 && label <= num_classes_)) return false;\n    if (!(index < num_samples_per_label_[label])) return false;\n\n    const auto& score = training_sample_scores_[label][index];\n    return score.first;\n}\n\ndouble TrainingDataManager::getSampleScore(uint32_t label, uint32_t index) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n\n    const auto& score = training_sample_scores_[label][index];\n    if (score.first) {\n        return score.second;\n    } else {\n        return 0.0; \/\/ is there something better we can do here?\n    }\n}\n\nbool TrainingDataManager::setSampleScore(\n    uint32_t label, uint32_t index, double new_score) {\n    CHECK_LABEL(label);\n\n    auto& score = training_sample_scores_[label][index];\n    score.first = true;\n    score.second = new_score;\n    return true;\n}\n\nbool TrainingDataManager::load(const std::string& filename) {\n    if (!data_.load(filename)) {\n        return false;\n    }\n\n    \/\/ Use the larger of the current value of num_classes_ and\n    \/\/ data_.getNumClasses(). See discussion at\n    \/\/ https:\/\/github.com\/damellis\/ESP\/issues\/252.\n    num_classes_ = std::max(data_.getNumClasses(), num_classes_);\n\n    \/\/ Populate the internals of the manager from data_. Most importantly, need\n    \/\/ to resize all vectors to hold the data.\n    training_sample_names_.resize(num_classes_ + 1);\n    default_label_names_.resize(num_classes_ + 1);\n    num_samples_per_label_.resize(num_classes_ + 1);\n    training_sample_scores_.resize(num_classes_ + 1);\n\n    for (uint32_t i = 1; i <= num_classes_; i++) {\n        const string class_name = data_.getClassNameForCorrespondingClassLabel(i);\n        if (class_name == \"NOT_SET\" || class_name == \"CLASS_LABEL_NOT_FOUND\") {\n            default_label_names_[i] = std::string(\"Label \") + std::to_string(i);\n        } else {\n            default_label_names_[i] = class_name;\n        }\n\n        uint32_t num_samples = data_.getClassData(i).getNumSamples();\n        num_samples_per_label_[i] = num_samples;\n\n        training_sample_names_[i].clear();\n        training_sample_scores_[i].clear();\n        for (uint32_t j = 0; j < num_samples; j++) {\n            \/\/ Since we don't yet have per-sample name saved, we will use\n            \/\/ default names (marking the pair as <false, \"\">).\n            training_sample_names_[i].push_back(\n                std::make_pair(false, std::string()));\n            training_sample_scores_[i].push_back(std::make_pair(false, 0.0));\n        }\n    }\n\n    return true;\n}\n<commit_msg>Erase scores when erasing all samples.<commit_after>#include \"training-data-manager.h\"\n\n#include <sstream>\n\nconst char kDefaultTrainingDataName[] = \"Default\";\n\n\/\/ Useful macros that simplifies the coding.\n\/\/ Always check label first!\n#define CHECK_LABEL(label)                          \\\n    assert((label) > 0 && label <= num_classes_ &&  \\\n           \"Label should be [1, num_classes_]\");\n\n#define CHECK_INDEX(label, index)                       \\\n    assert((index) < num_samples_per_label_[(label)] && \\\n           \"Index exceeds the available samples\");\n\nTrainingDataManager::TrainingDataManager(uint32_t num_classes)\n        : num_classes_(num_classes) {\n    training_sample_names_.resize(num_classes + 1);\n    training_sample_scores_.resize(num_classes + 1);\n    num_samples_per_label_.resize(num_classes + 1, 0);\n\n    for (uint32_t i = 0; i <= num_classes; i++) {\n        default_label_names_.push_back(\n            std::string(\"Label \") + std::to_string(i));\n    }\n\n    data_.setDatasetName(kDefaultTrainingDataName);\n}\n\nbool TrainingDataManager::setNumDimensions(uint32_t dim) {\n    return data_.setNumDimensions(dim);\n}\n\nbool TrainingDataManager::setDatasetName(const std::string name) {\n    return data_.setDatasetName(name);\n}\n\nbool TrainingDataManager::setDatasetName(const char* const name) {\n    if ((name != NULL) && (name[0] == '\\0')) {\n        return data_.setDatasetName(std::string(name));\n    }\n    return false;\n}\n\nstd::string TrainingDataManager::getSampleName(uint32_t label, uint32_t index) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n\n    const auto& name = training_sample_names_[label][index];\n    if (name.first) {\n        return name.second;\n    } else {\n        return default_label_names_[label] + \" [\" + std::to_string(index) + \"]\";\n    }\n}\n\nbool TrainingDataManager::setSampleName(\n    uint32_t label, uint32_t index, const std::string new_name) {\n    CHECK_LABEL(label);\n\n    auto& name = training_sample_names_[label][index];\n    name.first = true;\n    name.second = new_name;\n    return true;\n}\n\nbool TrainingDataManager::addSample(\n    uint32_t label, const GRT::MatrixDouble& sample) {\n    CHECK_LABEL(label);\n\n    \/\/ By default, set the name be <false, \"\"> so we will use the default name.\n    training_sample_names_[label].push_back(\n        std::make_pair(false, std::string()));\n    training_sample_scores_[label].push_back(std::make_pair(false, 0.0));\n    data_.addSample(label, sample);\n    num_samples_per_label_[label]++;\n\n    return true;\n}\n\nstd::string TrainingDataManager::getLabelName(uint32_t label) {\n    CHECK_LABEL(label);\n    return default_label_names_[label];\n}\n\nbool TrainingDataManager::setNameForLabel(const std::string name, uint32_t label) {\n    CHECK_LABEL(label);\n    default_label_names_[label] = name;\n    return true;\n}\n\nGRT::MatrixDouble TrainingDataManager::getSample(uint32_t label, uint32_t index) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n    return data_.getClassData(label)[index].getData();\n}\n\nuint32_t TrainingDataManager::getNumSampleForLabel(uint32_t label) {\n    CHECK_LABEL(label);\n    assert(num_samples_per_label_[label] ==\n           data_.getClassData(label).getNumSamples());\n    return num_samples_per_label_[label];\n}\n\nbool TrainingDataManager::deleteSample(uint32_t label, uint32_t index) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n\n    \/\/ The implementation first remove all data and then add them back. This is\n    \/\/ a temporary solution because GRT::TimeSeriesClassificationData doesn't\n    \/\/ allow per-sample operation.\n    GRT::TimeSeriesClassificationData data = data_.getClassData(label);\n    data_.eraseAllSamplesWithClassLabel(label);\n\n    for (uint32_t i = 0; i < data.getNumSamples(); i++) {\n        if (i != index) {\n            data_.addSample(label, data[i].getData());\n        }\n    }\n\n    auto& names = training_sample_names_[label];\n    names.erase(names.begin() + index);\n\n    auto& scores = training_sample_scores_[label];\n    scores.erase(scores.begin() + index);\n\n    num_samples_per_label_[label]--;\n\n    return true;\n}\n\nbool TrainingDataManager::deleteAllSamples() {\n    for (uint32_t i = 0; i < num_classes_; i++) {\n        data_.eraseAllSamplesWithClassLabel(i + 1);\n        num_samples_per_label_[i + 1] = 0;\n        auto& scores = training_sample_scores_[i + 1];\n        scores.erase(scores.begin(), scores.end());\n    }\n    return true;\n}\n\nbool TrainingDataManager::deleteAllSamplesWithLabel(uint32_t label) {\n    CHECK_LABEL(label);\n    data_.eraseAllSamplesWithClassLabel(label);\n    num_samples_per_label_[label] = 0;\n    auto& scores = training_sample_scores_[label];\n    scores.erase(scores.begin(), scores.end());\n    return true;\n}\n\nbool TrainingDataManager::relabelSample(\n    uint32_t label, uint32_t index, uint32_t new_label) {\n    CHECK_LABEL(label);\n    CHECK_LABEL(new_label);\n    CHECK_INDEX(label, index);\n\n    GRT::MatrixDouble data = getSample(label, index);\n    deleteSample(label, index);\n    addSample(new_label, data);\n\n    return true;\n}\n\nbool TrainingDataManager::trimSample(\n    uint32_t label, uint32_t index, uint32_t start, uint32_t end) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n\n    GRT::TimeSeriesClassificationData data = data_.getClassData(label);\n    data_.eraseAllSamplesWithClassLabel(label);\n\n    for (uint32_t i = 0; i < data.getNumSamples(); i++) {\n        if (i == index) {\n            GRT::MatrixDouble sample = data[i].getData();\n            GRT::MatrixDouble new_sample;\n\n            for (uint32_t row = start; row <= end; row++) {\n                new_sample.push_back(sample.getRowVector(row));\n            }\n            data_.addSample(label, new_sample);\n        } else {\n            data_.addSample(label, data[i].getData());\n        }\n    }\n    return true;\n}\n\nbool TrainingDataManager::hasSampleScore(uint32_t label, uint32_t index) {\n    if (!(label > 0 && label <= num_classes_)) return false;\n    if (!(index < num_samples_per_label_[label])) return false;\n\n    const auto& score = training_sample_scores_[label][index];\n    return score.first;\n}\n\ndouble TrainingDataManager::getSampleScore(uint32_t label, uint32_t index) {\n    CHECK_LABEL(label);\n    CHECK_INDEX(label, index);\n\n    const auto& score = training_sample_scores_[label][index];\n    if (score.first) {\n        return score.second;\n    } else {\n        return 0.0; \/\/ is there something better we can do here?\n    }\n}\n\nbool TrainingDataManager::setSampleScore(\n    uint32_t label, uint32_t index, double new_score) {\n    CHECK_LABEL(label);\n\n    auto& score = training_sample_scores_[label][index];\n    score.first = true;\n    score.second = new_score;\n    return true;\n}\n\nbool TrainingDataManager::load(const std::string& filename) {\n    if (!data_.load(filename)) {\n        return false;\n    }\n\n    \/\/ Use the larger of the current value of num_classes_ and\n    \/\/ data_.getNumClasses(). See discussion at\n    \/\/ https:\/\/github.com\/damellis\/ESP\/issues\/252.\n    num_classes_ = std::max(data_.getNumClasses(), num_classes_);\n\n    \/\/ Populate the internals of the manager from data_. Most importantly, need\n    \/\/ to resize all vectors to hold the data.\n    training_sample_names_.resize(num_classes_ + 1);\n    default_label_names_.resize(num_classes_ + 1);\n    num_samples_per_label_.resize(num_classes_ + 1);\n    training_sample_scores_.resize(num_classes_ + 1);\n\n    for (uint32_t i = 1; i <= num_classes_; i++) {\n        const string class_name = data_.getClassNameForCorrespondingClassLabel(i);\n        if (class_name == \"NOT_SET\" || class_name == \"CLASS_LABEL_NOT_FOUND\") {\n            default_label_names_[i] = std::string(\"Label \") + std::to_string(i);\n        } else {\n            default_label_names_[i] = class_name;\n        }\n\n        uint32_t num_samples = data_.getClassData(i).getNumSamples();\n        num_samples_per_label_[i] = num_samples;\n\n        training_sample_names_[i].clear();\n        training_sample_scores_[i].clear();\n        for (uint32_t j = 0; j < num_samples; j++) {\n            \/\/ Since we don't yet have per-sample name saved, we will use\n            \/\/ default names (marking the pair as <false, \"\">).\n            training_sample_names_[i].push_back(\n                std::make_pair(false, std::string()));\n            training_sample_scores_[i].push_back(std::make_pair(false, 0.0));\n        }\n    }\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n   This file is part of KDE Kontact.\n\n   Copyright (C) 2003 Sven Lüppken <sven@kde.org>\n   Copyright (C) 2003 Tobias König <tokoe@kde.org>\n   Copyright (C) 2003 Daniel Molkentin <molkentin@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 <qframe.h>\n#include <qlabel.h>\n#include <qlayout.h>\n#include <qtimer.h>\n\n#include <dcopclient.h>\n#include <kaction.h>\n#include <kapplication.h>\n#include <kconfig.h>\n#include <kdcopservicestarter.h>\n#include <kdebug.h>\n#include <kdialog.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kservice.h>\n#include <ktrader.h>\n#include <kstandarddirs.h>\n#include <qscrollview.h>\n#include <kglobal.h>\n#include <klocale.h>\n#include <kcmultidialog.h>\n\n#include <kparts\/componentfactory.h>\n#include <kparts\/event.h>\n\n#include <infoextension.h>\n#include <sidebarextension.h>\n\n#include \"plugin.h\"\n#include \"summary.h\"\n\n#include \"summaryview_part.h\"\n\n#include \"broadcaststatus.h\"\nusing KPIM::BroadcastStatus;\n\nnamespace Kontact\n{\n  class MainWindow;\n}\n\nSummaryViewPart::SummaryViewPart( Kontact::Core *core, const char*,\n                                  const KAboutData *aboutData,\n                                  QObject *parent, const char *name )\n  : KPIM::Part( parent, name ),\n    mCore( core ), mFrame( 0 ), mConfigAction( 0 )\n{\n  setInstance( new KInstance( aboutData ) );\n\n  loadLayout();\n\n  initGUI( core );\n\n  connect( kapp, SIGNAL( kdisplayPaletteChanged() ), SLOT( slotAdjustPalette() ) );\n  slotAdjustPalette();\n\n  setDate( QDate::currentDate() );\n  connect( mCore, SIGNAL( dayChanged( const QDate& ) ),\n           SLOT( setDate( const QDate& ) ) );\n\n  KParts::InfoExtension *info = new KParts::InfoExtension( this, \"Summary\" );\n  connect( this, SIGNAL( textChanged( const QString& ) ),\n           info, SIGNAL( textChanged( const QString& ) ) );\n\n  mConfigAction = new KAction( i18n( \"&Configure Summary View...\" ),\n                               \"configure\", 0, this,\n                               SLOT( slotConfigure() ), actionCollection(),\n                               \"summaryview_configure\" );\n\n  setXMLFile( \"kontactsummary_part.rc\" );\n\n  QTimer::singleShot( 0, this, SLOT( slotTextChanged() ) );\n}\n\nSummaryViewPart::~SummaryViewPart()\n{\n  saveLayout();\n}\n\nbool SummaryViewPart::openFile()\n{\n  kdDebug(5006) << \"SummaryViewPart:openFile()\" << endl;\n  return true;\n}\n\nvoid SummaryViewPart::partActivateEvent( KParts::PartActivateEvent *event )\n{\n  \/\/ inform the plugins that the part has been activated so that they can\n  \/\/ update the displayed information\n  if ( event->activated() && ( event->part() == this ) ) {\n    QMap<QString, Kontact::Summary*>::Iterator it;\n    for ( it = mSummaries.begin(); it != mSummaries.end(); ++it )\n      it.data()->updateSummary( false );\n  }\n\n  KParts::ReadOnlyPart::partActivateEvent( event );\n}\n\nvoid SummaryViewPart::updateWidgets()\n{\n  mMainWidget->setUpdatesEnabled( false );\n\n  delete mFrame;\n\n  mSummaries.clear();\n\n  mFrame = new QFrame( mMainWidget );\n  mMainLayout->insertWidget( 2, mFrame );\n\n  QStringList activeSummaries;\n\n  KConfig config( \"kontact_summaryrc\" );\n  if ( !config.hasKey( \"ActiveSummaries\" ) ) {\n    activeSummaries << \"kontact_kaddressbookplugin\";\n    activeSummaries << \"kontact_korganizerplugin\";\n    activeSummaries << \"kontact_todoplugin\";\n    activeSummaries << \"kontact_newstickerplugin\";\n  } else {\n    activeSummaries = config.readListEntry( \"ActiveSummaries\" );\n  }\n\n  \/\/ Collect all summary widgets with a summaryHeight > 0\n  QValueList<Kontact::Plugin*> plugins = mCore->pluginList();\n  QValueList<Kontact::Plugin*>::ConstIterator end = plugins.end();\n  QValueList<Kontact::Plugin*>::ConstIterator it = plugins.begin();\n  for ( ; it != end; ++it ) {\n    Kontact::Plugin *plugin = *it;\n    if ( activeSummaries.find( plugin->identifier() ) == activeSummaries.end() )\n      continue;\n\n    Kontact::Summary *summary = plugin->createSummaryWidget( mFrame );\n    if ( summary ) {\n      if ( summary->summaryHeight() > 0 ) {\n        mSummaries.insert( plugin->identifier(), summary );\n\n        connect( summary, SIGNAL( message( const QString& ) ),\n                 BroadcastStatus::instance(), SLOT( setStatusMsg( const QString& ) ) );\n        connect( summary, SIGNAL( summaryWidgetDropped( QWidget*, QWidget* ) ),\n                 this, SLOT( summaryWidgetMoved( QWidget*, QWidget* ) ) );\n\n        if ( !mLeftColumnSummaries.contains( plugin->identifier() ) &&\n             !mRightColumnSummaries.contains( plugin->identifier() ) ) {\n          mLeftColumnSummaries.append( plugin->identifier() );\n        }\n      } else {\n        summary->hide();\n      }\n    }\n  }\n\n  \/\/ Add vertical line between the two rows of summary widgets.\n  QFrame *vline = new QFrame( mFrame );\n  vline->setFrameStyle( QFrame::VLine | QFrame::Plain );\n\n  QHBoxLayout *layout = new QHBoxLayout( mFrame );\n\n  mLeftColumn = new QVBoxLayout( layout, KDialog::spacingHint() );\n  layout->addWidget( vline );\n  mRightColumn = new QVBoxLayout( layout, KDialog::spacingHint()  );\n\n  QStringList::Iterator strIt;\n  for ( strIt = mLeftColumnSummaries.begin(); strIt != mLeftColumnSummaries.end(); ++strIt ) {\n    if ( mSummaries.find( *strIt ) != mSummaries.end() )\n      mLeftColumn->addWidget( mSummaries[ *strIt ] );\n  }\n\n  for ( strIt = mRightColumnSummaries.begin(); strIt != mRightColumnSummaries.end(); ++strIt ) {\n    if ( mSummaries.find( *strIt ) != mSummaries.end() )\n      mRightColumn->addWidget( mSummaries[ *strIt ] );\n  }\n\n  mFrame->show();\n\n  mMainWidget->setUpdatesEnabled( true );\n  mMainWidget->update();\n}\n\nvoid SummaryViewPart::summaryWidgetMoved( QWidget *target, QWidget *widget )\n{\n  if ( mLeftColumn->findWidget( target ) == -1 && mRightColumn->findWidget( target ) == -1 ||\n       mLeftColumn->findWidget( widget ) == -1 && mRightColumn->findWidget( widget ) == -1 ) {\n    return;\n  }\n\n  if ( mLeftColumn->findWidget( widget ) != -1 ) {\n    mLeftColumn->remove( widget );\n    mLeftColumnSummaries.remove( widgetName( widget ) );\n  } else if ( mRightColumn->findWidget( widget ) != -1 ) {\n    mRightColumn->remove( widget );\n    mRightColumnSummaries.remove( widgetName( widget ) );\n  }\n\n  int targetPos = mLeftColumn->findWidget( target );\n  if ( targetPos != -1 ) {\n    mLeftColumn->insertWidget( targetPos, widget );\n    mLeftColumnSummaries.insert( mLeftColumnSummaries.at( targetPos ), widgetName( widget ) );\n  } else {\n    targetPos = mRightColumn->findWidget( target );\n    mRightColumn->insertWidget( targetPos, widget );\n    mRightColumnSummaries.insert( mRightColumnSummaries.at( targetPos ), widgetName( widget ) );\n  }\n}\n\nvoid SummaryViewPart::slotTextChanged()\n{\n  emit textChanged( i18n( \"What's next?\" ) );\n}\n\nvoid SummaryViewPart::slotAdjustPalette()\n{\n  mMainWidget->setPaletteBackgroundColor( kapp->palette().active().base() );\n}\n\nvoid SummaryViewPart::setDate( const QDate& newDate )\n{\n  QString date( \"<b>%1<b>\" );\n  date = date.arg( KGlobal::locale()->formatDate( newDate ) );\n  mDateLabel->setText( date );\n}\n\nvoid SummaryViewPart::slotConfigure()\n{\n  KCMultiDialog dlg( mMainWidget, \"ConfigDialog\", true );\n\n  QStringList modules = configModules();\n  modules.prepend( \"kcmkontactsummary.desktop\" );\n  connect( &dlg, SIGNAL( configCommitted() ),\n           this, SLOT( updateWidgets() ) );\n\n  QStringList::ConstIterator strIt;\n  for ( strIt = modules.begin(); strIt != modules.end(); ++strIt )\n    dlg.addModule( *strIt );\n\n  dlg.exec();\n}\n\nQStringList SummaryViewPart::configModules() const\n{\n  QStringList modules;\n\n  QMap<QString, Kontact::Summary*>::ConstIterator it;\n  for ( it = mSummaries.begin(); it != mSummaries.end(); ++it ) {\n    QStringList cm = it.data()->configModules();\n    QStringList::ConstIterator strIt;\n    for ( strIt = cm.begin(); strIt != cm.end(); ++strIt )\n      if ( !(*strIt).isEmpty() && !modules.contains( *strIt ) )\n        modules.append( *strIt );\n  }\n\n  return modules;\n}\n\nvoid SummaryViewPart::initGUI( Kontact::Core *core )\n{\n  QScrollView *sv = new QScrollView( core );\n\n  sv->setResizePolicy( QScrollView::AutoOneFit );\n  sv->setFrameStyle( QFrame::NoFrame | QFrame::Plain );\n\n  mMainWidget = new QFrame( sv->viewport() );\n  sv->addChild( mMainWidget );\n  mMainWidget->setFrameStyle( QFrame::Panel | QFrame::Sunken );\n  sv->setFocusPolicy( QWidget::StrongFocus );\n  setWidget( sv );\n\n  mMainLayout = new QVBoxLayout( mMainWidget,KDialog::marginHint(),\n                                 KDialog::spacingHint() );\n\n  mDateLabel = new QLabel( mMainWidget );\n  mDateLabel->setAlignment( AlignRight );\n  mMainLayout->insertWidget( 0, mDateLabel );\n\n  QFrame *hline = new QFrame( mMainWidget );\n  hline->setFrameStyle( QFrame::HLine | QFrame::Plain );\n  mMainLayout->insertWidget( 1, hline );\n\n  mFrame = new QFrame( mMainWidget );\n  mMainLayout->insertWidget( 2, mFrame );\n\n  updateWidgets();\n}\n\nvoid SummaryViewPart::loadLayout()\n{\n  KConfig config( \"kontact_summaryrc\" );\n\n  if ( !config.hasKey( \"LeftColumnSummaries\" ) ) {\n    mLeftColumnSummaries << \"kontact_korganizerplugin\";\n    mLeftColumnSummaries << \"kontact_todoplugin\";\n    mLeftColumnSummaries << \"kontact_kaddressbookplugin\";\n  } else {\n    mLeftColumnSummaries = config.readListEntry( \"LeftColumnSummaries\" );\n  }\n\n  if ( !config.hasKey( \"RightColumnSummaries\" ) ) {\n    mRightColumnSummaries << \"kontact_newstickerplugin\";\n  } else {\n    mRightColumnSummaries = config.readListEntry( \"RightColumnSummaries\" );\n  }\n}\n\nvoid SummaryViewPart::saveLayout()\n{\n  KConfig config( \"kontact_summaryrc\" );\n\n  config.writeEntry( \"LeftColumnSummaries\", mLeftColumnSummaries );\n  config.writeEntry( \"RightColumnSummaries\", mRightColumnSummaries );\n\n  config.sync();\n}\n\nQString SummaryViewPart::widgetName( QWidget *widget ) const\n{\n  QMap<QString, Kontact::Summary*>::ConstIterator it;\n  for ( it = mSummaries.begin(); it != mSummaries.end(); ++it ) {\n    if ( it.data() == widget )\n      return it.key();\n  }\n\n  return QString::null;\n}\n\n#include \"summaryview_part.moc\"\n<commit_msg>Don't allow dragging a widget on it self, this ends up in an endless loop.<commit_after>\/*\n   This file is part of KDE Kontact.\n\n   Copyright (C) 2003 Sven Lüppken <sven@kde.org>\n   Copyright (C) 2003 Tobias König <tokoe@kde.org>\n   Copyright (C) 2003 Daniel Molkentin <molkentin@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 <qframe.h>\n#include <qlabel.h>\n#include <qlayout.h>\n#include <qtimer.h>\n\n#include <dcopclient.h>\n#include <kaction.h>\n#include <kapplication.h>\n#include <kconfig.h>\n#include <kdcopservicestarter.h>\n#include <kdebug.h>\n#include <kdialog.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kservice.h>\n#include <ktrader.h>\n#include <kstandarddirs.h>\n#include <qscrollview.h>\n#include <kglobal.h>\n#include <klocale.h>\n#include <kcmultidialog.h>\n\n#include <kparts\/componentfactory.h>\n#include <kparts\/event.h>\n\n#include <infoextension.h>\n#include <sidebarextension.h>\n\n#include \"plugin.h\"\n#include \"summary.h\"\n\n#include \"summaryview_part.h\"\n\n#include \"broadcaststatus.h\"\nusing KPIM::BroadcastStatus;\n\nnamespace Kontact\n{\n  class MainWindow;\n}\n\nSummaryViewPart::SummaryViewPart( Kontact::Core *core, const char*,\n                                  const KAboutData *aboutData,\n                                  QObject *parent, const char *name )\n  : KPIM::Part( parent, name ),\n    mCore( core ), mFrame( 0 ), mConfigAction( 0 )\n{\n  setInstance( new KInstance( aboutData ) );\n\n  loadLayout();\n\n  initGUI( core );\n\n  connect( kapp, SIGNAL( kdisplayPaletteChanged() ), SLOT( slotAdjustPalette() ) );\n  slotAdjustPalette();\n\n  setDate( QDate::currentDate() );\n  connect( mCore, SIGNAL( dayChanged( const QDate& ) ),\n           SLOT( setDate( const QDate& ) ) );\n\n  KParts::InfoExtension *info = new KParts::InfoExtension( this, \"Summary\" );\n  connect( this, SIGNAL( textChanged( const QString& ) ),\n           info, SIGNAL( textChanged( const QString& ) ) );\n\n  mConfigAction = new KAction( i18n( \"&Configure Summary View...\" ),\n                               \"configure\", 0, this,\n                               SLOT( slotConfigure() ), actionCollection(),\n                               \"summaryview_configure\" );\n\n  setXMLFile( \"kontactsummary_part.rc\" );\n\n  QTimer::singleShot( 0, this, SLOT( slotTextChanged() ) );\n}\n\nSummaryViewPart::~SummaryViewPart()\n{\n  saveLayout();\n}\n\nbool SummaryViewPart::openFile()\n{\n  kdDebug(5006) << \"SummaryViewPart:openFile()\" << endl;\n  return true;\n}\n\nvoid SummaryViewPart::partActivateEvent( KParts::PartActivateEvent *event )\n{\n  \/\/ inform the plugins that the part has been activated so that they can\n  \/\/ update the displayed information\n  if ( event->activated() && ( event->part() == this ) ) {\n    QMap<QString, Kontact::Summary*>::Iterator it;\n    for ( it = mSummaries.begin(); it != mSummaries.end(); ++it )\n      it.data()->updateSummary( false );\n  }\n\n  KParts::ReadOnlyPart::partActivateEvent( event );\n}\n\nvoid SummaryViewPart::updateWidgets()\n{\n  mMainWidget->setUpdatesEnabled( false );\n\n  delete mFrame;\n\n  mSummaries.clear();\n\n  mFrame = new QFrame( mMainWidget );\n  mMainLayout->insertWidget( 2, mFrame );\n\n  QStringList activeSummaries;\n\n  KConfig config( \"kontact_summaryrc\" );\n  if ( !config.hasKey( \"ActiveSummaries\" ) ) {\n    activeSummaries << \"kontact_kaddressbookplugin\";\n    activeSummaries << \"kontact_korganizerplugin\";\n    activeSummaries << \"kontact_todoplugin\";\n    activeSummaries << \"kontact_newstickerplugin\";\n  } else {\n    activeSummaries = config.readListEntry( \"ActiveSummaries\" );\n  }\n\n  \/\/ Collect all summary widgets with a summaryHeight > 0\n  QValueList<Kontact::Plugin*> plugins = mCore->pluginList();\n  QValueList<Kontact::Plugin*>::ConstIterator end = plugins.end();\n  QValueList<Kontact::Plugin*>::ConstIterator it = plugins.begin();\n  for ( ; it != end; ++it ) {\n    Kontact::Plugin *plugin = *it;\n    if ( activeSummaries.find( plugin->identifier() ) == activeSummaries.end() )\n      continue;\n\n    Kontact::Summary *summary = plugin->createSummaryWidget( mFrame );\n    if ( summary ) {\n      if ( summary->summaryHeight() > 0 ) {\n        mSummaries.insert( plugin->identifier(), summary );\n\n        connect( summary, SIGNAL( message( const QString& ) ),\n                 BroadcastStatus::instance(), SLOT( setStatusMsg( const QString& ) ) );\n        connect( summary, SIGNAL( summaryWidgetDropped( QWidget*, QWidget* ) ),\n                 this, SLOT( summaryWidgetMoved( QWidget*, QWidget* ) ) );\n\n        if ( !mLeftColumnSummaries.contains( plugin->identifier() ) &&\n             !mRightColumnSummaries.contains( plugin->identifier() ) ) {\n          mLeftColumnSummaries.append( plugin->identifier() );\n        }\n      } else {\n        summary->hide();\n      }\n    }\n  }\n\n  \/\/ Add vertical line between the two rows of summary widgets.\n  QFrame *vline = new QFrame( mFrame );\n  vline->setFrameStyle( QFrame::VLine | QFrame::Plain );\n\n  QHBoxLayout *layout = new QHBoxLayout( mFrame );\n\n  mLeftColumn = new QVBoxLayout( layout, KDialog::spacingHint() );\n  layout->addWidget( vline );\n  mRightColumn = new QVBoxLayout( layout, KDialog::spacingHint()  );\n\n  QStringList::Iterator strIt;\n  for ( strIt = mLeftColumnSummaries.begin(); strIt != mLeftColumnSummaries.end(); ++strIt ) {\n    if ( mSummaries.find( *strIt ) != mSummaries.end() )\n      mLeftColumn->addWidget( mSummaries[ *strIt ] );\n  }\n\n  for ( strIt = mRightColumnSummaries.begin(); strIt != mRightColumnSummaries.end(); ++strIt ) {\n    if ( mSummaries.find( *strIt ) != mSummaries.end() )\n      mRightColumn->addWidget( mSummaries[ *strIt ] );\n  }\n\n  mFrame->show();\n\n  mMainWidget->setUpdatesEnabled( true );\n  mMainWidget->update();\n}\n\nvoid SummaryViewPart::summaryWidgetMoved( QWidget *target, QWidget *widget )\n{\n  if ( target == widget )\n    return;\n\n  if ( mLeftColumn->findWidget( target ) == -1 && mRightColumn->findWidget( target ) == -1 ||\n       mLeftColumn->findWidget( widget ) == -1 && mRightColumn->findWidget( widget ) == -1 ) {\n    return;\n  }\n\n  if ( mLeftColumn->findWidget( widget ) != -1 ) {\n    mLeftColumn->remove( widget );\n    mLeftColumnSummaries.remove( widgetName( widget ) );\n  } else if ( mRightColumn->findWidget( widget ) != -1 ) {\n    mRightColumn->remove( widget );\n    mRightColumnSummaries.remove( widgetName( widget ) );\n  }\n\n  int targetPos = mLeftColumn->findWidget( target );\n  if ( targetPos != -1 ) {\n    mLeftColumn->insertWidget( targetPos, widget );\n    mLeftColumnSummaries.insert( mLeftColumnSummaries.at( targetPos ), widgetName( widget ) );\n  } else {\n    targetPos = mRightColumn->findWidget( target );\n    mRightColumn->insertWidget( targetPos, widget );\n    mRightColumnSummaries.insert( mRightColumnSummaries.at( targetPos ), widgetName( widget ) );\n  }\n}\n\nvoid SummaryViewPart::slotTextChanged()\n{\n  emit textChanged( i18n( \"What's next?\" ) );\n}\n\nvoid SummaryViewPart::slotAdjustPalette()\n{\n  mMainWidget->setPaletteBackgroundColor( kapp->palette().active().base() );\n}\n\nvoid SummaryViewPart::setDate( const QDate& newDate )\n{\n  QString date( \"<b>%1<b>\" );\n  date = date.arg( KGlobal::locale()->formatDate( newDate ) );\n  mDateLabel->setText( date );\n}\n\nvoid SummaryViewPart::slotConfigure()\n{\n  KCMultiDialog dlg( mMainWidget, \"ConfigDialog\", true );\n\n  QStringList modules = configModules();\n  modules.prepend( \"kcmkontactsummary.desktop\" );\n  connect( &dlg, SIGNAL( configCommitted() ),\n           this, SLOT( updateWidgets() ) );\n\n  QStringList::ConstIterator strIt;\n  for ( strIt = modules.begin(); strIt != modules.end(); ++strIt )\n    dlg.addModule( *strIt );\n\n  dlg.exec();\n}\n\nQStringList SummaryViewPart::configModules() const\n{\n  QStringList modules;\n\n  QMap<QString, Kontact::Summary*>::ConstIterator it;\n  for ( it = mSummaries.begin(); it != mSummaries.end(); ++it ) {\n    QStringList cm = it.data()->configModules();\n    QStringList::ConstIterator strIt;\n    for ( strIt = cm.begin(); strIt != cm.end(); ++strIt )\n      if ( !(*strIt).isEmpty() && !modules.contains( *strIt ) )\n        modules.append( *strIt );\n  }\n\n  return modules;\n}\n\nvoid SummaryViewPart::initGUI( Kontact::Core *core )\n{\n  QScrollView *sv = new QScrollView( core );\n\n  sv->setResizePolicy( QScrollView::AutoOneFit );\n  sv->setFrameStyle( QFrame::NoFrame | QFrame::Plain );\n\n  mMainWidget = new QFrame( sv->viewport() );\n  sv->addChild( mMainWidget );\n  mMainWidget->setFrameStyle( QFrame::Panel | QFrame::Sunken );\n  sv->setFocusPolicy( QWidget::StrongFocus );\n  setWidget( sv );\n\n  mMainLayout = new QVBoxLayout( mMainWidget,KDialog::marginHint(),\n                                 KDialog::spacingHint() );\n\n  mDateLabel = new QLabel( mMainWidget );\n  mDateLabel->setAlignment( AlignRight );\n  mMainLayout->insertWidget( 0, mDateLabel );\n\n  QFrame *hline = new QFrame( mMainWidget );\n  hline->setFrameStyle( QFrame::HLine | QFrame::Plain );\n  mMainLayout->insertWidget( 1, hline );\n\n  mFrame = new QFrame( mMainWidget );\n  mMainLayout->insertWidget( 2, mFrame );\n\n  updateWidgets();\n}\n\nvoid SummaryViewPart::loadLayout()\n{\n  KConfig config( \"kontact_summaryrc\" );\n\n  if ( !config.hasKey( \"LeftColumnSummaries\" ) ) {\n    mLeftColumnSummaries << \"kontact_korganizerplugin\";\n    mLeftColumnSummaries << \"kontact_todoplugin\";\n    mLeftColumnSummaries << \"kontact_kaddressbookplugin\";\n  } else {\n    mLeftColumnSummaries = config.readListEntry( \"LeftColumnSummaries\" );\n  }\n\n  if ( !config.hasKey( \"RightColumnSummaries\" ) ) {\n    mRightColumnSummaries << \"kontact_newstickerplugin\";\n  } else {\n    mRightColumnSummaries = config.readListEntry( \"RightColumnSummaries\" );\n  }\n}\n\nvoid SummaryViewPart::saveLayout()\n{\n  KConfig config( \"kontact_summaryrc\" );\n\n  config.writeEntry( \"LeftColumnSummaries\", mLeftColumnSummaries );\n  config.writeEntry( \"RightColumnSummaries\", mRightColumnSummaries );\n\n  config.sync();\n}\n\nQString SummaryViewPart::widgetName( QWidget *widget ) const\n{\n  QMap<QString, Kontact::Summary*>::ConstIterator it;\n  for ( it = mSummaries.begin(); it != mSummaries.end(); ++it ) {\n    if ( it.data() == widget )\n      return it.key();\n  }\n\n  return QString::null;\n}\n\n#include \"summaryview_part.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    addcontactwizard.cpp - Kopete's Add Contact Wizard\n\n    Copyright (c) 2002 by Nick Betcher           <nbetcher@kde.org>\n    Copyright (c) 2002 by Duncan Mac-Vicar Prett <duncan@kde.org>\n\n    Kopete    (c) 2002 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\/\/\tCONDITIONS FOR PROGRESSING:\n\/\/\tWelcome page\n\/\/\t\ttrue\n\/\/\t|\n\/\/\tV\n\/\/\tSelect Address Book Entry\n\/\/\t\t( Addressee is selected AND is not already associated with a contact )\n\/\/\t\t\tOR Do not use address book is checked\n\/\/\t|\n\/\/\tV\n\/\/\tSelect Display Name and Group\n\/\/\t\ttrue\n\/\/\t|\n\/\/\tV\n\/\/\tSelect Account\n\/\/\t\t( Only 1 account ) OR ( An account is selected )\n\/\/\t|\n\/\/\tV\n\/\/\t(Each AddContactPage)\n\/\/\t\t( Own conditions)\n\/\/\t|\n\/\/\tV\n\/\/\tFinish\n\/\/\t\ttrue\n\n#include <qcheckbox.h>\n#include <klocale.h>\n#include <kiconloader.h>\n#include <klineeditdlg.h>\n#include <kpushbutton.h>\n#include <kdebug.h>\n#include <klistview.h>\n\/\/ used for its AddresseeItem class\n#include <kabc\/addresseedialog.h>\n#include <kabc\/addressbook.h>\n#include <kabc\/stdaddressbook.h>\n\n#include <addcontactpage.h>\n#include \"addcontactwizard.h\"\n#include \"kopetecontactlist.h\"\n#include \"kopetemetacontact.h\"\n#include \"kopeteaccountmanager.h\"\n#include \"kopeteaccount.h\"\n\nAddContactWizard::AddContactWizard( QWidget *parent, const char *name )\n: AddContactWizard_Base( parent, name )\n{\n\t\/\/ Populate the groups list\n\tKopeteGroupList groups=KopeteContactList::contactList()->groups();\n\tfor( KopeteGroup *it = groups.first(); it; it = groups.next() )\n\t{\n\t\tQString groupname = it->displayName();\n\t\tif ( !groupname.isEmpty() )\n\t\t\tnew QCheckListItem( groupList, groupname, QCheckListItem::CheckBox);\n\t}\n\n\tprotocolListView->clear();\n\tm_accountItems.clear();\n\n\t\/\/ Populate the accounts list\n\tQCheckListItem* accountLVI=0L;\n\tQPtrList<KopeteAccount>  accounts = KopeteAccountManager::manager()->accounts();\n\tfor(KopeteAccount *i=accounts.first() ; i; i=accounts.next() )\n\t{\n\t\taccountLVI= new QCheckListItem( protocolListView, i->accountId(), QCheckListItem::CheckBox);\n\t\taccountLVI->setText(1,i->protocol()->displayName() + QString::fromLatin1(\" \") );\n\t\taccountLVI->setPixmap( 1, SmallIcon( i->protocol()->pluginIcon() ) );\n\t\tm_accountItems.insert(accountLVI,i);\n\t}\n\n\t\/\/ Populate the addressee list\n\t\/\/ This could be slow - is there a better way of doing it (progressive loading?)\n\tloadAddressees();\n\t\n\t\n\t\n\tif ( accounts.count() == 1 )\n\t{\n\t\taccountLVI->setOn( true );\n\t\tsetAppropriate( selectService, false );\n\t}\n\n\tsetNextEnabled( selectAddressee, false );\n\tsetNextEnabled(selectService, (accounts.count() == 1));\n\tsetFinishEnabled(finis, true);\n\t\n\t\/\/ FIXME: steal\/add a create addressee widget\n\taddAddresseeButton->setEnabled( false );\n\t\/\/ Addressee validation connections\n\tconnect( addAddresseeButton, SIGNAL( clicked() ), SLOT( slotAddAddresseeClicked() ) );\n\tconnect( chkNoAddressee, SIGNAL( toggled( bool ) ),\n\t\t\tSLOT( slotCheckAddresseeChoice( bool ) ) );\n\tconnect( addresseeListView, SIGNAL( clicked(QListViewItem * ) ),\n\t\t\tSLOT( slotAddresseeListClicked( QListViewItem * ) ) );\n\tconnect( addresseeListView, SIGNAL( selectionChanged( QListViewItem * ) ),\n\t\t\tSLOT( slotAddresseeListClicked( QListViewItem * ) ) );\n\tconnect( addresseeListView, SIGNAL( spacePressed( QListViewItem * ) ),\n\t\t\tSLOT( slotAddresseeListClicked( QListViewItem * ) ) );\n\n\t\/\/ Group manipulation connection\n\tconnect( addGroupButton, SIGNAL(clicked()) , SLOT(slotAddGroupClicked()) );\n\t\n\t\/\/ Account choice validation connections\n\tconnect( protocolListView, SIGNAL(clicked(QListViewItem *)), this, SLOT(slotProtocolListClicked(QListViewItem *)));\n\tconnect( protocolListView, SIGNAL(selectionChanged(QListViewItem *)), this, SLOT(slotProtocolListClicked(QListViewItem *)));\n\tconnect( protocolListView, SIGNAL(spacePressed(QListViewItem *)), this, SLOT(slotProtocolListClicked(QListViewItem *)));\n}\n\nAddContactWizard::~AddContactWizard()\n{\n}\n\nvoid AddContactWizard::loadAddressees()\n{\n\taddresseeListView->clear();\n\tKABC::AddressBook* ab = KABC::StdAddressBook::self();\n\tKABC::AddressBook::Iterator it;\n\tfor( it = ab->begin(); it != ab->end(); ++it )\n\t\tKABC::AddresseeItem *item = new KABC::AddresseeItem( addresseeListView, (*it) ); \n}\n\nvoid AddContactWizard::slotAddAddresseeClicked()\n{\n\t\/\/ Pop up add addressee dialog\n}\n\nvoid AddContactWizard::slotCheckAddresseeChoice( bool on )\n{\n\t\/\/ Disable addressee selection widgets\n\taddresseeListView->setEnabled( !on );\n\taddAddresseeButton->setEnabled( !on );\n\tif ( on )\n\t\tsetNextEnabled( selectAddressee, true );\n\telse\n\t{\n\t\tif ( addresseeListView->selectedItem() )\n\t\t\tsetNextEnabled( selectAddressee, true );\n\t\telse\n\t\t\tsetNextEnabled( selectAddressee, false );\n\t}\n}\n\nvoid AddContactWizard::slotAddresseeListClicked( QListViewItem *addressee )\n{\n\t\/\/ check a valid addressee is selected\n\tsetNextEnabled( selectAddressee, addressee ? addressee->isSelected() : false );\n}\n\nvoid AddContactWizard::slotAddGroupClicked()\n{\n\tbool ok;\n\tQString groupName = KLineEditDlg::getText(\n\t\ti18n( \"New Group\" ),\n\t\ti18n( \"Please enter the name for the new group:\" ),\n\t\tQString::null, &ok );\n\n\tif ( !groupName.isNull() && ok)\n\t\tnew QCheckListItem( groupList, groupName, QCheckListItem::CheckBox);\n}\n\nvoid AddContactWizard::slotProtocolListClicked( QListViewItem *)\n{\n\t\/\/ Just makes sure a protocol is selected before allowing the user to continue\n\tbool oneIsChecked = false;\n\n\tfor (QListViewItemIterator it(protocolListView); it.current(); ++it)\n\t{\n\t\tQCheckListItem *check = dynamic_cast<QCheckListItem *>(it.current());\n\t\tif (check && check->isOn())\n\t\t{\n\t\t\toneIsChecked = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsetNextEnabled(selectService, oneIsChecked);\n}\n\nvoid AddContactWizard::accept()\n{\n\tKopeteMetaContact *m = new KopeteMetaContact();\n\t\n\t\/\/ set the display name if required\n\tif ( !mDisplayName->text().isEmpty() )\n\t{\n\t\tm->setTrackChildNameChanges( false );\n\t\tm->setDisplayName( mDisplayName->text() );\n\t}\n\t\n\t\/\/ set the KABC uid in the metacontact\n\tKABC::AddresseeItem* i = 0L;\n\ti = static_cast<KABC::AddresseeItem *>( addresseeListView->selectedItem() );\n\tif ( addresseeListView->isEnabled() && i )\n\t\tm->setMetaContactId( i->addressee().uid() );\n\t\n\t\/\/ set the metacontact's groups\n\tbool topLevel = true;\n\tfor (QListViewItemIterator it(groupList); it.current(); ++it)\n\t{\n\t\tQCheckListItem *check = dynamic_cast<QCheckListItem *>(it.current());\n\t\tif (check && check->isOn())\n\t\t{\n\t\t\tm->addToGroup(KopeteContactList::contactList()->getGroup(check->text()));\n\t\t\ttopLevel = false;\n\t\t}\n\t}\n\tm->setTopLevel(topLevel);\n\n\tbool ok=false;\n\t\n\t\/\/ get each protocol's contact\n\tQMap <KopeteAccount*,AddContactPage*>::Iterator it;\n\tfor ( it = protocolPages.begin(); it != protocolPages.end(); ++it ) \n\t{\n\t\tok |= it.data()->apply(it.key(),m); \n\t}\n\t\n\t\/\/ add it to the contact list\n\tif(ok)\n\t\tKopeteContactList::contactList()->addMetaContact(m);\n\telse\n\t\tdelete m;\n\tdelete this;\n}\n\nvoid AddContactWizard::next()\n{\n\t\/\/ If the we're on the select account page\n\t\/\/ follow it with the add contact pages for\n\t\/\/ the chosen protocols\n\tif (currentPage() == selectService ||\n\t\t(currentPage() == intro && !appropriate( selectService )))\n\t{\n\t\tQMap <KopeteAccount*,AddContactPage*>::Iterator it;\n\t\tfor ( it = protocolPages.begin(); it != protocolPages.end(); ++it ) \n\t\t{\n\t\t\tdelete it.data();\n\t\t}\n\t\tprotocolPages.clear();          \n\n\t\t\/\/ We don't keep track of this pointer because it gets deleted when the wizard does (which is what we want)\n\t\tfor (QListViewItemIterator it(protocolListView); it.current(); ++it)\n\t\t{\n\t\t\tQCheckListItem *item = dynamic_cast<QCheckListItem *>(it.current());\n\t\t\tif (item && item->isOn())\n\t\t\t{\n\t\t\t\t\/\/ this shouldn't happen either, but I hate crashes\n\t\t\t\tif (!m_accountItems[item]) continue;\n\n\t\t\t\tAddContactPage *addPage = m_accountItems[item]->protocol()->createAddContactWidget(this, m_accountItems[item] );\n\t\t\t\tif (!addPage) continue;\n\n\t\t\t\tQString title = i18n( \"The account name is prepended here\",\n\t\t\t\t\t\t\t\t\t  \"%1 contact information\" )\n\t\t\t\t\t\t\t\t\t .arg( item->text(0) );\n\t\t\t\taddPage->show();\n\t\t\t\tinsertPage( addPage, title, indexOf( selectGroup) );\n\t\t\t\tprotocolPages.insert( m_accountItems[item] , addPage );\n\t\t\t}\n\t\t}\n\t\tQWizard::next();\n\t\treturn;\n\t}\n\t\n\t\/\/ If we're not on any account specific pages, \n\t\/\/ we must be on an add account page, so make sure it validates\n\tif (currentPage() != intro &&\n\t\tcurrentPage() != selectAddressee &&\n\t\tcurrentPage() != selectService && \n\t\tcurrentPage() != selectGroup && \n\t\tcurrentPage() != finis)\n\t{\n\t\tAddContactPage *ePage = dynamic_cast<AddContactPage *>(currentPage());\n\t\tif (!ePage || !ePage->validateData())\n\t\t\treturn;\n\t}\n\t\n\tQWizard::next();\n}\n\nvoid AddContactWizard::showPage( QWidget *page )\n{\n\tif ( page == selectGroup )\n\t{\n\t\tif ( addresseeListView->isEnabled() ) \n\t\t{\n\t\t\tif ( KABC::AddresseeItem* i = static_cast<KABC::AddresseeItem *>( addresseeListView->selectedItem() ) ) \n\t\t\t\tmDisplayName->setText( i->addressee().realName() );\n\t\t\telse \n\t\t\t\tmDisplayName->setText( QString::null );\n\t\t}\n\t}\n\tQWizard::showPage( page );\n}\n\n#include \"addcontactwizard.moc\"\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n\n<commit_msg>Make the protocol pages appear in the right place again.<commit_after>\/*\n    addcontactwizard.cpp - Kopete's Add Contact Wizard\n\n    Copyright (c) 2002 by Nick Betcher           <nbetcher@kde.org>\n    Copyright (c) 2002 by Duncan Mac-Vicar Prett <duncan@kde.org>\n\n    Kopete    (c) 2002 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\/\/\tCONDITIONS FOR PROGRESSING:\n\/\/\tWelcome page\n\/\/\t\ttrue\n\/\/\t|\n\/\/\tV\n\/\/\tSelect Address Book Entry\n\/\/\t\t( Addressee is selected AND is not already associated with a contact )\n\/\/\t\t\tOR Do not use address book is checked\n\/\/\t|\n\/\/\tV\n\/\/\tSelect Display Name and Group\n\/\/\t\ttrue\n\/\/\t|\n\/\/\tV\n\/\/\tSelect Account\n\/\/\t\t( Only 1 account ) OR ( An account is selected )\n\/\/\t|\n\/\/\tV\n\/\/\t(Each AddContactPage)\n\/\/\t\t( Own conditions)\n\/\/\t|\n\/\/\tV\n\/\/\tFinish\n\/\/\t\ttrue\n\n#include <qcheckbox.h>\n#include <klocale.h>\n#include <kiconloader.h>\n#include <klineeditdlg.h>\n#include <kpushbutton.h>\n#include <kdebug.h>\n#include <klistview.h>\n\/\/ used for its AddresseeItem class\n#include <kabc\/addresseedialog.h>\n#include <kabc\/addressbook.h>\n#include <kabc\/stdaddressbook.h>\n\n#include <addcontactpage.h>\n#include \"addcontactwizard.h\"\n#include \"kopetecontactlist.h\"\n#include \"kopetemetacontact.h\"\n#include \"kopeteaccountmanager.h\"\n#include \"kopeteaccount.h\"\n\nAddContactWizard::AddContactWizard( QWidget *parent, const char *name )\n: AddContactWizard_Base( parent, name )\n{\n\t\/\/ Populate the groups list\n\tKopeteGroupList groups=KopeteContactList::contactList()->groups();\n\tfor( KopeteGroup *it = groups.first(); it; it = groups.next() )\n\t{\n\t\tQString groupname = it->displayName();\n\t\tif ( !groupname.isEmpty() )\n\t\t\tnew QCheckListItem( groupList, groupname, QCheckListItem::CheckBox);\n\t}\n\n\tprotocolListView->clear();\n\tm_accountItems.clear();\n\n\t\/\/ Populate the accounts list\n\tQCheckListItem* accountLVI=0L;\n\tQPtrList<KopeteAccount>  accounts = KopeteAccountManager::manager()->accounts();\n\tfor(KopeteAccount *i=accounts.first() ; i; i=accounts.next() )\n\t{\n\t\taccountLVI= new QCheckListItem( protocolListView, i->accountId(), QCheckListItem::CheckBox);\n\t\taccountLVI->setText(1,i->protocol()->displayName() + QString::fromLatin1(\" \") );\n\t\taccountLVI->setPixmap( 1, SmallIcon( i->protocol()->pluginIcon() ) );\n\t\tm_accountItems.insert(accountLVI,i);\n\t}\n\n\t\/\/ Populate the addressee list\n\t\/\/ This could be slow - is there a better way of doing it (progressive loading?)\n\tloadAddressees();\n\t\n\t\n\t\n\tif ( accounts.count() == 1 )\n\t{\n\t\taccountLVI->setOn( true );\n\t\tsetAppropriate( selectService, false );\n\t}\n\n\tsetNextEnabled( selectAddressee, false );\n\tsetNextEnabled(selectService, (accounts.count() == 1));\n\tsetFinishEnabled(finis, true);\n\t\n\t\/\/ FIXME: steal\/add a create addressee widget\n\taddAddresseeButton->setEnabled( false );\n\t\/\/ Addressee validation connections\n\tconnect( addAddresseeButton, SIGNAL( clicked() ), SLOT( slotAddAddresseeClicked() ) );\n\tconnect( chkNoAddressee, SIGNAL( toggled( bool ) ),\n\t\t\tSLOT( slotCheckAddresseeChoice( bool ) ) );\n\tconnect( addresseeListView, SIGNAL( clicked(QListViewItem * ) ),\n\t\t\tSLOT( slotAddresseeListClicked( QListViewItem * ) ) );\n\tconnect( addresseeListView, SIGNAL( selectionChanged( QListViewItem * ) ),\n\t\t\tSLOT( slotAddresseeListClicked( QListViewItem * ) ) );\n\tconnect( addresseeListView, SIGNAL( spacePressed( QListViewItem * ) ),\n\t\t\tSLOT( slotAddresseeListClicked( QListViewItem * ) ) );\n\n\t\/\/ Group manipulation connection\n\tconnect( addGroupButton, SIGNAL(clicked()) , SLOT(slotAddGroupClicked()) );\n\t\n\t\/\/ Account choice validation connections\n\tconnect( protocolListView, SIGNAL(clicked(QListViewItem *)), this, SLOT(slotProtocolListClicked(QListViewItem *)));\n\tconnect( protocolListView, SIGNAL(selectionChanged(QListViewItem *)), this, SLOT(slotProtocolListClicked(QListViewItem *)));\n\tconnect( protocolListView, SIGNAL(spacePressed(QListViewItem *)), this, SLOT(slotProtocolListClicked(QListViewItem *)));\n}\n\nAddContactWizard::~AddContactWizard()\n{\n}\n\nvoid AddContactWizard::loadAddressees()\n{\n\taddresseeListView->clear();\n\tKABC::AddressBook* ab = KABC::StdAddressBook::self();\n\tKABC::AddressBook::Iterator it;\n\tfor( it = ab->begin(); it != ab->end(); ++it )\n\t\tKABC::AddresseeItem *item = new KABC::AddresseeItem( addresseeListView, (*it) ); \n}\n\nvoid AddContactWizard::slotAddAddresseeClicked()\n{\n\t\/\/ Pop up add addressee dialog\n}\n\nvoid AddContactWizard::slotCheckAddresseeChoice( bool on )\n{\n\t\/\/ Disable addressee selection widgets\n\taddresseeListView->setEnabled( !on );\n\taddAddresseeButton->setEnabled( !on );\n\tif ( on )\n\t\tsetNextEnabled( selectAddressee, true );\n\telse\n\t{\n\t\tif ( addresseeListView->selectedItem() )\n\t\t\tsetNextEnabled( selectAddressee, true );\n\t\telse\n\t\t\tsetNextEnabled( selectAddressee, false );\n\t}\n}\n\nvoid AddContactWizard::slotAddresseeListClicked( QListViewItem *addressee )\n{\n\t\/\/ check a valid addressee is selected\n\tsetNextEnabled( selectAddressee, addressee ? addressee->isSelected() : false );\n}\n\nvoid AddContactWizard::slotAddGroupClicked()\n{\n\tbool ok;\n\tQString groupName = KLineEditDlg::getText(\n\t\ti18n( \"New Group\" ),\n\t\ti18n( \"Please enter the name for the new group:\" ),\n\t\tQString::null, &ok );\n\n\tif ( !groupName.isNull() && ok)\n\t\tnew QCheckListItem( groupList, groupName, QCheckListItem::CheckBox);\n}\n\nvoid AddContactWizard::slotProtocolListClicked( QListViewItem *)\n{\n\t\/\/ Just makes sure a protocol is selected before allowing the user to continue\n\tbool oneIsChecked = false;\n\n\tfor (QListViewItemIterator it(protocolListView); it.current(); ++it)\n\t{\n\t\tQCheckListItem *check = dynamic_cast<QCheckListItem *>(it.current());\n\t\tif (check && check->isOn())\n\t\t{\n\t\t\toneIsChecked = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsetNextEnabled(selectService, oneIsChecked);\n}\n\nvoid AddContactWizard::accept()\n{\n\tKopeteMetaContact *m = new KopeteMetaContact();\n\t\n\t\/\/ set the display name if required\n\tif ( !mDisplayName->text().isEmpty() )\n\t{\n\t\tm->setTrackChildNameChanges( false );\n\t\tm->setDisplayName( mDisplayName->text() );\n\t}\n\t\n\t\/\/ set the KABC uid in the metacontact\n\tKABC::AddresseeItem* i = 0L;\n\ti = static_cast<KABC::AddresseeItem *>( addresseeListView->selectedItem() );\n\tif ( addresseeListView->isEnabled() && i )\n\t\tm->setMetaContactId( i->addressee().uid() );\n\t\n\t\/\/ set the metacontact's groups\n\tbool topLevel = true;\n\tfor (QListViewItemIterator it(groupList); it.current(); ++it)\n\t{\n\t\tQCheckListItem *check = dynamic_cast<QCheckListItem *>(it.current());\n\t\tif (check && check->isOn())\n\t\t{\n\t\t\tm->addToGroup(KopeteContactList::contactList()->getGroup(check->text()));\n\t\t\ttopLevel = false;\n\t\t}\n\t}\n\tm->setTopLevel(topLevel);\n\n\tbool ok=false;\n\t\n\t\/\/ get each protocol's contact\n\tQMap <KopeteAccount*,AddContactPage*>::Iterator it;\n\tfor ( it = protocolPages.begin(); it != protocolPages.end(); ++it ) \n\t{\n\t\tok |= it.data()->apply(it.key(),m); \n\t}\n\t\n\t\/\/ add it to the contact list\n\tif(ok)\n\t\tKopeteContactList::contactList()->addMetaContact(m);\n\telse\n\t\tdelete m;\n\tdelete this;\n}\n\nvoid AddContactWizard::next()\n{\n\t\/\/ If the we're on the select account page\n\t\/\/ follow it with the add contact pages for\n\t\/\/ the chosen protocols\n\tif (currentPage() == selectService ||\n\t\t(currentPage() == intro && !appropriate( selectService )))\n\t{\n\t\tQMap <KopeteAccount*,AddContactPage*>::Iterator it;\n\t\tfor ( it = protocolPages.begin(); it != protocolPages.end(); ++it ) \n\t\t{\n\t\t\tdelete it.data();\n\t\t}\n\t\tprotocolPages.clear();          \n\n\t\t\/\/ We don't keep track of this pointer because it gets deleted when the wizard does (which is what we want)\n\t\tfor (QListViewItemIterator it(protocolListView); it.current(); ++it)\n\t\t{\n\t\t\tQCheckListItem *item = dynamic_cast<QCheckListItem *>(it.current());\n\t\t\tif (item && item->isOn())\n\t\t\t{\n\t\t\t\t\/\/ this shouldn't happen either, but I hate crashes\n\t\t\t\tif (!m_accountItems[item]) continue;\n\n\t\t\t\tAddContactPage *addPage = m_accountItems[item]->protocol()->createAddContactWidget(this, m_accountItems[item] );\n\t\t\t\tif (!addPage) continue;\n\n\t\t\t\tQString title = i18n( \"The account name is prepended here\",\n\t\t\t\t\t\t\t\t\t  \"%1 contact information\" )\n\t\t\t\t\t\t\t\t\t .arg( item->text(0) );\n\t\t\t\taddPage->show();\n\t\t\t\tinsertPage( addPage, title, indexOf( finis ) );\n\t\t\t\tprotocolPages.insert( m_accountItems[item] , addPage );\n\t\t\t}\n\t\t}\n\t\tQWizard::next();\n\t\treturn;\n\t}\n\t\n\t\/\/ If we're not on any account specific pages, \n\t\/\/ we must be on an add account page, so make sure it validates\n\tif (currentPage() != intro &&\n\t\tcurrentPage() != selectAddressee &&\n\t\tcurrentPage() != selectService && \n\t\tcurrentPage() != selectGroup && \n\t\tcurrentPage() != finis)\n\t{\n\t\tAddContactPage *ePage = dynamic_cast<AddContactPage *>(currentPage());\n\t\tif (!ePage || !ePage->validateData())\n\t\t\treturn;\n\t}\n\t\n\tQWizard::next();\n}\n\nvoid AddContactWizard::showPage( QWidget *page )\n{\n\tif ( page == selectGroup )\n\t{\n\t\tif ( addresseeListView->isEnabled() ) \n\t\t{\n\t\t\tif ( KABC::AddresseeItem* i = static_cast<KABC::AddresseeItem *>( addresseeListView->selectedItem() ) ) \n\t\t\t\tmDisplayName->setText( i->addressee().realName() );\n\t\t\telse \n\t\t\t\tmDisplayName->setText( QString::null );\n\t\t}\n\t}\n\tQWizard::showPage( page );\n}\n\n#include \"addcontactwizard.moc\"\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n#include \"ioHandler.h\"\n#include <sstream>\n#include <iostream>\n\nclass ReadsTest : public ::testing::Test {\npublic:\n    const std::string readData = \"@M03610:15:000000000-ALE1U:1:1101:17702:1965 1:N:0:1\\nCCTTTTGTTTGTATTGTTTCTCTTAAGCATATTTCTTAATTACTTAACTAACTACCTCAAATGAAATTTGTAAAAAATCCATCAATTTTAACCGCTTGTTTGCTTGCCAGTGTCCTCGGAGGCATTGGGACACTCGCCTACTCCCCTTTTG\\n+\\nAAAAAF5CFFFF6FGFGGGGGGHHGHHFBHFFHHHHHBEGHHHHHEGGHHHHHFGFGGFEFGHBFBHHHHHEEGFFEGHHFHHEBGHHHEGHHGEGGEHHHGHHHEHHFFG3GHHHHGCDEGGGHHDGEHHGHHHFEEGGFHHHHGHHHH1\\n@M03610:15:000000000-ALE1U:1:1101:13392:1966 1:N:0:1\\nGTCGCCGGATCTAATGCACTTGTCGCTTCATCGCATAATAAAACGTGCGGATCACTTGCCAACGCACGGGCAATCGCTACACGTTGTTTCTGACCACCGGATAAATTGCTCGGATAAACGTCTTTACGTTCAGTTAAGCCGACCAATTCAA\\n+\\n>AA3>A>22ADFC5FBGGGGGCGHGHGHGGHHHGGGGFHFFHFGGHHHGGGGEHHHHFHHGHGGGGGGGCGGFHHGGHGGHHGHHHGHHHHHHHHGHGGGGGGFHHHHHHHGGGGGHHHGHHHGHHHGHHHHHHHGGEGFC?DGGHHHHG0\\n@M03610:15:000000000-ALE1U:1:1101:19181:1996 1:N:0:1\\nATTTGTGGCAATGGCGAGTTTGGGGCGATACCAATATCCACACAATAGCCAGTAAACTTAACGTTAGCGGGCAAGGAAATTGGCACCAAAATTTGGTACAACTCAACAAATTAAGTGGTGAATTAGGCAAAATTCACCAGAAAGGCGTGTA\\n+\\n>AAA3DCAAFFFB4EAEFGGGE2AFGGGGFGHBGHFHHHFHHGGGHHHHHHHHHHHHHHHHHGHHEGHCGGGGGGGHHHHHFHHGHGHHHHHHHHGHHHHGHHHGHHEHGHHHHHGHGHGHHHHHHHHHHGHHHHHHHHH0GHGHHGGGGF\\n@M03610:15:000000000-ALE1U:1:1101:18865:1996 1:N:0:1\\nGCTACAAAGATAATGATAGCGCTTATAGTTAGCTCGGTTTGCTAATTCGGTTTGACTAATATTATCCTTTAAATAATCTGTTTTCGCTTTTTTAGTCGGCGAAGGGGAACAAGCAAATAAAGTTGTCAGTGTTGAAATTAAAAAAATAAGT\\n+\\n>3A3>4@4C4FFBGFGGGGGGGGGGHGHHHHGGHHGGFGGGHHGHHHHGHGGGGEHHGGHHHHHHFHHHHFFHHHFHHHHHHHHHGGGHGHHGHGHHDCEGCEG?EGGGGHHHHHHHHHHHGHHHHGHHHHHHHHFFGHHEHHHGGHHHHH\\n@M03610:15:000000000-ALE1U:1:1101:18806:2006 1:N:0:1\\nGCGGATGGCTCGCCAAAAGTTGGCTCTTTACGAAAATTATTTTGTGACATTTAACTTTCCAATTTTAGGTGAAAATATAATGGGAAATTTCCCGCTGAATAAATTATCCCCATTTTAAAGTATTTCTCTTTAATCAGCACACGATTTTTCA\\n+\\n>>111>1AFFFDCEECGGGGGGHHHHHHHHHGFGC?GHFHHHHGGHHHHHHHHHHHHHHHHGHHHHHHGHHFHHHHHHHHGHGHHHHHHHBHHGGGGGHHHHHHHHHGHHGHHHHHHHHHEGHGHHHHGHHHHHHHFGGHGHGGHHGHHF2\\n\";\n    const std::string readTabData = \"TESTOne\\tACTG\\t####\\tACTG\\t####\\nTestTwo\\tACTG\\t####\\n\";\n    const std::string readDataInter = \"@Whatever1\\nAAAAAAA\\n+\\n#######\\n@Whatever2\\nGGGCCCT\\n+\\nBBBBBBB\\n\";\n};\n    \nTEST_F(ReadsTest, parseTabRead) {\n    std::istringstream in1(readTabData);\n    InputReader<ReadBase, TabReadImpl> ifs(in1);\n    size_t read_count = 0;\n    while(ifs.has_next()) {\n        auto r = ifs.next();\n        read_count++;\n    }\n    ASSERT_EQ(read_count, 2);\n}\n\nTEST_F(ReadsTest, parseSingleReadFastq) {\n    std::istringstream in1(readData);\n    InputReader<SingleEndRead, SingleEndReadFastqImpl> ifs(in1);\n    size_t read_count = 0;\n    while(ifs.has_next()) {\n        auto r = ifs.next();\n        read_count++;\n    }\n    ASSERT_EQ(read_count, 5);\n}    \n\nTEST_F(ReadsTest, parsePairedReadFastq) {\n    std::istringstream in1(readData);\n    std::istringstream in2(readData);\n    size_t read_count = 0;\n    \n    InputReader<PairedEndRead, PairedEndReadFastqImpl> ifp(in1, in2);\n    while(ifp.has_next()) {\n        auto i = ifp.next();\n        std::cout << i->get_read_one().get_qual() << std::endl;\n        read_count++;\n    }\n    ASSERT_EQ(read_count, 5);\n}\n    \nTEST_F(ReadsTest, testWriteFastqSingle) {\n    std::istringstream in1(readData);\n    InputReader<SingleEndRead, SingleEndReadFastqImpl> ifs(in1);\n\n    std::ostringstream out1;\n    {\n        OutputWriter<SingleEndRead, SingleEndReadOutFastq> ofs(out1);\n\n        while(ifs.has_next()) {\n            auto r = ifs.next();\n            ofs.write(*r);\n        }\n    }\n    ASSERT_EQ(readData, out1.str());\n}\n\nTEST_F(ReadsTest, testTabWrite) {\n    std::istringstream in1(readTabData);\n    InputReader<ReadBase, TabReadImpl> ifs(in1);\n    \n    std::ostringstream out1;\n    {\n        OutputWriter<ReadBase, ReadBaseOutTab> ofs(out1);\n\n        while(ifs.has_next()) {\n            auto r = ifs.next();\n            ofs.write(*r);\n        }\n    }\n    ASSERT_EQ(readTabData, out1.str());\n}\n\nTEST_F(ReadsTest, testInterWrite) {\n    std::istringstream in1(readDataInter);\n    InputReader<PairedEndRead, InterReadImpl> ifs(in1);\n    std::ostringstream out1;\n    {\n        OutputWriter<PairedEndRead, PairedEndReadOutInter> ofs(out1);\n        \n        while(ifs.has_next()) {\n            auto r = ifs.next();\n            ofs.write(*r);\n        }\n    }\n    ASSERT_EQ(readDataInter, out1.str());\n}\n        \n<commit_msg>Added interleaved read test<commit_after>#include <gtest\/gtest.h>\n#include \"ioHandler.h\"\n#include <sstream>\n#include <iostream>\n\nclass ReadsTest : public ::testing::Test {\npublic:\n    const std::string readData = \"@M03610:15:000000000-ALE1U:1:1101:17702:1965 1:N:0:1\\nCCTTTTGTTTGTATTGTTTCTCTTAAGCATATTTCTTAATTACTTAACTAACTACCTCAAATGAAATTTGTAAAAAATCCATCAATTTTAACCGCTTGTTTGCTTGCCAGTGTCCTCGGAGGCATTGGGACACTCGCCTACTCCCCTTTTG\\n+\\nAAAAAF5CFFFF6FGFGGGGGGHHGHHFBHFFHHHHHBEGHHHHHEGGHHHHHFGFGGFEFGHBFBHHHHHEEGFFEGHHFHHEBGHHHEGHHGEGGEHHHGHHHEHHFFG3GHHHHGCDEGGGHHDGEHHGHHHFEEGGFHHHHGHHHH1\\n@M03610:15:000000000-ALE1U:1:1101:13392:1966 1:N:0:1\\nGTCGCCGGATCTAATGCACTTGTCGCTTCATCGCATAATAAAACGTGCGGATCACTTGCCAACGCACGGGCAATCGCTACACGTTGTTTCTGACCACCGGATAAATTGCTCGGATAAACGTCTTTACGTTCAGTTAAGCCGACCAATTCAA\\n+\\n>AA3>A>22ADFC5FBGGGGGCGHGHGHGGHHHGGGGFHFFHFGGHHHGGGGEHHHHFHHGHGGGGGGGCGGFHHGGHGGHHGHHHGHHHHHHHHGHGGGGGGFHHHHHHHGGGGGHHHGHHHGHHHGHHHHHHHGGEGFC?DGGHHHHG0\\n@M03610:15:000000000-ALE1U:1:1101:19181:1996 1:N:0:1\\nATTTGTGGCAATGGCGAGTTTGGGGCGATACCAATATCCACACAATAGCCAGTAAACTTAACGTTAGCGGGCAAGGAAATTGGCACCAAAATTTGGTACAACTCAACAAATTAAGTGGTGAATTAGGCAAAATTCACCAGAAAGGCGTGTA\\n+\\n>AAA3DCAAFFFB4EAEFGGGE2AFGGGGFGHBGHFHHHFHHGGGHHHHHHHHHHHHHHHHHGHHEGHCGGGGGGGHHHHHFHHGHGHHHHHHHHGHHHHGHHHGHHEHGHHHHHGHGHGHHHHHHHHHHGHHHHHHHHH0GHGHHGGGGF\\n@M03610:15:000000000-ALE1U:1:1101:18865:1996 1:N:0:1\\nGCTACAAAGATAATGATAGCGCTTATAGTTAGCTCGGTTTGCTAATTCGGTTTGACTAATATTATCCTTTAAATAATCTGTTTTCGCTTTTTTAGTCGGCGAAGGGGAACAAGCAAATAAAGTTGTCAGTGTTGAAATTAAAAAAATAAGT\\n+\\n>3A3>4@4C4FFBGFGGGGGGGGGGHGHHHHGGHHGGFGGGHHGHHHHGHGGGGEHHGGHHHHHHFHHHHFFHHHFHHHHHHHHHGGGHGHHGHGHHDCEGCEG?EGGGGHHHHHHHHHHHGHHHHGHHHHHHHHFFGHHEHHHGGHHHHH\\n@M03610:15:000000000-ALE1U:1:1101:18806:2006 1:N:0:1\\nGCGGATGGCTCGCCAAAAGTTGGCTCTTTACGAAAATTATTTTGTGACATTTAACTTTCCAATTTTAGGTGAAAATATAATGGGAAATTTCCCGCTGAATAAATTATCCCCATTTTAAAGTATTTCTCTTTAATCAGCACACGATTTTTCA\\n+\\n>>111>1AFFFDCEECGGGGGGHHHHHHHHHGFGC?GHFHHHHGGHHHHHHHHHHHHHHHHGHHHHHHGHHFHHHHHHHHGHGHHHHHHHBHHGGGGGHHHHHHHHHGHHGHHHHHHHHHEGHGHHHHGHHHHHHHFGGHGHGGHHGHHF2\\n\";\n    const std::string readTabData = \"TESTOne\\tACTG\\t####\\tACTG\\t####\\nTestTwo\\tACTG\\t####\\n\";\n    const std::string readDataInter = \"@Whatever1\\nAAAAAAA\\n+\\n#######\\n@Whatever2\\nGGGCCCT\\n+\\nBBBBBBB\\n\";\n};\n    \nTEST_F(ReadsTest, parseTabRead) {\n    std::istringstream in1(readTabData);\n    InputReader<ReadBase, TabReadImpl> ifs(in1);\n    size_t read_count = 0;\n    while(ifs.has_next()) {\n        auto r = ifs.next();\n        ++read_count;\n    }\n    ASSERT_EQ(read_count, 2);\n}\n\nTEST_F(ReadsTest, testInterRead) {\n    std::istringstream in1(readDataInter);\n    InputReader<PairedEndRead, InterReadImpl> ifs(in1);\n    size_t read_count = 0;    \n    while(ifs.has_next()) {\n        auto r = ifs.next();\n        ++read_count;\n    }\n\n    ASSERT_EQ(read_count, 1);\n}\n        \n\nTEST_F(ReadsTest, parseSingleReadFastq) {\n    std::istringstream in1(readData);\n    InputReader<SingleEndRead, SingleEndReadFastqImpl> ifs(in1);\n    size_t read_count = 0;\n    while(ifs.has_next()) {\n        auto r = ifs.next();\n        read_count++;\n    }\n    ASSERT_EQ(read_count, 5);\n}    \n\nTEST_F(ReadsTest, parsePairedReadFastq) {\n    std::istringstream in1(readData);\n    std::istringstream in2(readData);\n    size_t read_count = 0;\n    \n    InputReader<PairedEndRead, PairedEndReadFastqImpl> ifp(in1, in2);\n    while(ifp.has_next()) {\n        auto i = ifp.next();\n        std::cout << i->get_read_one().get_qual() << std::endl;\n        read_count++;\n    }\n    ASSERT_EQ(read_count, 5);\n}\n    \nTEST_F(ReadsTest, testWriteFastqSingle) {\n    std::istringstream in1(readData);\n    InputReader<SingleEndRead, SingleEndReadFastqImpl> ifs(in1);\n\n    std::ostringstream out1;\n    {\n        OutputWriter<SingleEndRead, SingleEndReadOutFastq> ofs(out1);\n\n        while(ifs.has_next()) {\n            auto r = ifs.next();\n            ofs.write(*r);\n        }\n    }\n    ASSERT_EQ(readData, out1.str());\n}\n\nTEST_F(ReadsTest, testTabWrite) {\n    std::istringstream in1(readTabData);\n    InputReader<ReadBase, TabReadImpl> ifs(in1);\n    \n    std::ostringstream out1;\n    {\n        OutputWriter<ReadBase, ReadBaseOutTab> ofs(out1);\n\n        while(ifs.has_next()) {\n            auto r = ifs.next();\n            ofs.write(*r);\n        }\n    }\n    ASSERT_EQ(readTabData, out1.str());\n}\n\nTEST_F(ReadsTest, testInterWrite) {\n    std::istringstream in1(readDataInter);\n    InputReader<PairedEndRead, InterReadImpl> ifs(in1);\n    std::ostringstream out1;\n    {\n        OutputWriter<PairedEndRead, PairedEndReadOutInter> ofs(out1);\n        \n        while(ifs.has_next()) {\n            auto r = ifs.next();\n            ofs.write(*r);\n        }\n    }\n    ASSERT_EQ(readDataInter, out1.str());\n}\n        \n\n<|endoftext|>"}
{"text":"<commit_before>#include <MainApplication\/Utils\/Keyboard.hpp>\n\n#include <Core\/CoreMacros.hpp>\n#include <Core\/Log\/Log.hpp>\n\n#if defined( OS_WINDOWS )\n#include <Windows.h>\n#elif defined( OS_LINUX )\n#include <X11\/Xlib.h>\n#include <X11\/Xutil.h>\n#include <X11\/Xos.h>\n#include <X11\/keysym.h>\n#include <xcb\/xcb.h>\n#endif\n\nnamespace Ra\n{\n    namespace Gui\n    {\n#if defined( OS_WINDOWS )\n\n        bool isKeyPressed( Key key )\n        {\n\n        }\n\n#elif defined( OS_LINUX )\n\n        bool isKeyPressed( Key key )\n        {\n            KeySym keysym = 0;\n            switch (key)\n            {\n                case Key_LShift:     keysym = XK_Shift_L;      break;\n                case Key_RShift:     keysym = XK_Shift_R;      break;\n                case Key_LControl:   keysym = XK_Control_L;    break;\n                case Key_RControl:   keysym = XK_Control_R;    break;\n                case Key_LAlt:       keysym = XK_Alt_L;        break;\n                case Key_RAlt:       keysym = XK_Alt_R;        break;\n                case Key_LSystem:    keysym = XK_Super_L;      break;\n                case Key_RSystem:    keysym = XK_Super_R;      break;\n                case Key_Menu:       keysym = XK_Menu;         break;\n                case Key_Escape:     keysym = XK_Escape;       break;\n                case Key_SemiColon:  keysym = XK_semicolon;    break;\n                case Key_Slash:      keysym = XK_slash;        break;\n                case Key_Equal:      keysym = XK_equal;        break;\n                case Key_Dash:       keysym = XK_minus;        break;\n                case Key_LBracket:   keysym = XK_bracketleft;  break;\n                case Key_RBracket:   keysym = XK_bracketright; break;\n                case Key_Comma:      keysym = XK_comma;        break;\n                case Key_Period:     keysym = XK_period;       break;\n                case Key_Quote:      keysym = XK_apostrophe;   break;\n                case Key_BackSlash:  keysym = XK_backslash;    break;\n                case Key_Tilde:      keysym = XK_grave;        break;\n                case Key_Space:      keysym = XK_space;        break;\n                case Key_Return:     keysym = XK_Return;       break;\n                case Key_BackSpace:  keysym = XK_BackSpace;    break;\n                case Key_Tab:        keysym = XK_Tab;          break;\n                case Key_PageUp:     keysym = XK_Prior;        break;\n                case Key_PageDown:   keysym = XK_Next;         break;\n                case Key_End:        keysym = XK_End;          break;\n                case Key_Home:       keysym = XK_Home;         break;\n                case Key_Insert:     keysym = XK_Insert;       break;\n                case Key_Delete:     keysym = XK_Delete;       break;\n                case Key_Add:        keysym = XK_KP_Add;       break;\n                case Key_Subtract:   keysym = XK_KP_Subtract;  break;\n                case Key_Multiply:   keysym = XK_KP_Multiply;  break;\n                case Key_Divide:     keysym = XK_KP_Divide;    break;\n                case Key_Pause:      keysym = XK_Pause;        break;\n                case Key_F1:         keysym = XK_F1;           break;\n                case Key_F2:         keysym = XK_F2;           break;\n                case Key_F3:         keysym = XK_F3;           break;\n                case Key_F4:         keysym = XK_F4;           break;\n                case Key_F5:         keysym = XK_F5;           break;\n                case Key_F6:         keysym = XK_F6;           break;\n                case Key_F7:         keysym = XK_F7;           break;\n                case Key_F8:         keysym = XK_F8;           break;\n                case Key_F9:         keysym = XK_F9;           break;\n                case Key_F10:        keysym = XK_F10;          break;\n                case Key_F11:        keysym = XK_F11;          break;\n                case Key_F12:        keysym = XK_F12;          break;\n                case Key_F13:        keysym = XK_F13;          break;\n                case Key_F14:        keysym = XK_F14;          break;\n                case Key_F15:        keysym = XK_F15;          break;\n                case Key_Left:       keysym = XK_Left;         break;\n                case Key_Right:      keysym = XK_Right;        break;\n                case Key_Up:         keysym = XK_Up;           break;\n                case Key_Down:       keysym = XK_Down;         break;\n                case Key_Numpad0:    keysym = XK_KP_Insert;    break;\n                case Key_Numpad1:    keysym = XK_KP_End;       break;\n                case Key_Numpad2:    keysym = XK_KP_Down;      break;\n                case Key_Numpad3:    keysym = XK_KP_Page_Down; break;\n                case Key_Numpad4:    keysym = XK_KP_Left;      break;\n                case Key_Numpad5:    keysym = XK_KP_Begin;     break;\n                case Key_Numpad6:    keysym = XK_KP_Right;     break;\n                case Key_Numpad7:    keysym = XK_KP_Home;      break;\n                case Key_Numpad8:    keysym = XK_KP_Up;        break;\n                case Key_Numpad9:    keysym = XK_KP_Page_Up;   break;\n                case Key_A:          keysym = XK_a;            break;\n                case Key_B:          keysym = XK_b;            break;\n                case Key_C:          keysym = XK_c;            break;\n                case Key_D:          keysym = XK_d;            break;\n                case Key_E:          keysym = XK_e;            break;\n                case Key_F:          keysym = XK_f;            break;\n                case Key_G:          keysym = XK_g;            break;\n                case Key_H:          keysym = XK_h;            break;\n                case Key_I:          keysym = XK_i;            break;\n                case Key_J:          keysym = XK_j;            break;\n                case Key_K:          keysym = XK_k;            break;\n                case Key_L:          keysym = XK_l;            break;\n                case Key_M:          keysym = XK_m;            break;\n                case Key_N:          keysym = XK_n;            break;\n                case Key_O:          keysym = XK_o;            break;\n                case Key_P:          keysym = XK_p;            break;\n                case Key_Q:          keysym = XK_q;            break;\n                case Key_R:          keysym = XK_r;            break;\n                case Key_S:          keysym = XK_s;            break;\n                case Key_T:          keysym = XK_t;            break;\n                case Key_U:          keysym = XK_u;            break;\n                case Key_V:          keysym = XK_v;            break;\n                case Key_W:          keysym = XK_w;            break;\n                case Key_X:          keysym = XK_x;            break;\n                case Key_Y:          keysym = XK_y;            break;\n                case Key_Z:          keysym = XK_z;            break;\n                case Key_Num0:       keysym = XK_0;            break;\n                case Key_Num1:       keysym = XK_1;            break;\n                case Key_Num2:       keysym = XK_2;            break;\n                case Key_Num3:       keysym = XK_3;            break;\n                case Key_Num4:       keysym = XK_4;            break;\n                case Key_Num5:       keysym = XK_5;            break;\n                case Key_Num6:       keysym = XK_6;            break;\n                case Key_Num7:       keysym = XK_7;            break;\n                case Key_Num8:       keysym = XK_8;            break;\n                case Key_Num9:       keysym = XK_9;            break;\n                default:             keysym = 0;               break;\n            }\n\n            Display* dis = XOpenDisplay( nullptr );\n            xcb_keycode_t keycode = XKeysymToKeycode( dis, keysym );\n            XCloseDisplay( dis );\n\n            xcb_connection_t* connection = xcb_connect( nullptr, nullptr );\n            xcb_generic_error_t* error = nullptr;\n\n            xcb_query_keymap_reply_t* keymap = xcb_query_keymap_reply(\n                connection, xcb_query_keymap( connection ), &error );\n            \n            xcb_disconnect( connection );\n\n            if ( error )\n            {\n                LOG( logERROR ) << \"Could not query keymap in isKeyPressed()\";\n                return false;\n            }\n\n            \/\/ NOTE(Charly): No real idea what is going on there, but it seems to work :D\n            return ( keymap->keys[keycode \/ 8] & ( 1 << ( keycode % 8 ) ) ) != 0;\n        }\n#else\n        bool isKeyPressed( Key key )\n        {\n            LOG( logERROR ) << \"isKeyPressed is not implemented for your OS.\"\n                return false;\n        }\n#endif\n    }\n}\n<commit_msg>isKeyPressed for windows<commit_after>#include <MainApplication\/Utils\/Keyboard.hpp>\n\n#include <Core\/CoreMacros.hpp>\n#include <Core\/Log\/Log.hpp>\n\n#if defined( OS_WINDOWS )\n#include <Windows.h>\n#elif defined( OS_LINUX )\n#include <X11\/Xlib.h>\n#include <X11\/Xutil.h>\n#include <X11\/Xos.h>\n#include <X11\/keysym.h>\n#include <xcb\/xcb.h>\n#endif\n\nnamespace Ra\n{\n    namespace Gui\n    {\n#if defined( OS_WINDOWS )\n\n        bool isKeyPressed( Key key )\n        {\n            int vkey = 0;\n            switch (key)\n            {\n                case Key_A:          vkey = 'A';           break;\n                case Key_B:          vkey = 'B';           break;\n                case Key_C:          vkey = 'C';           break;\n                case Key_D:          vkey = 'D';           break;\n                case Key_E:          vkey = 'E';           break;\n                case Key_F:          vkey = 'F';           break;\n                case Key_G:          vkey = 'G';           break;\n                case Key_H:          vkey = 'H';           break;\n                case Key_I:          vkey = 'I';           break;\n                case Key_J:          vkey = 'J';           break;\n                case Key_K:          vkey = 'K';           break;\n                case Key_L:          vkey = 'L';           break;\n                case Key_M:          vkey = 'M';           break;\n                case Key_N:          vkey = 'N';           break;\n                case Key_O:          vkey = 'O';           break;\n                case Key_P:          vkey = 'P';           break;\n                case Key_Q:          vkey = 'Q';           break;\n                case Key_R:          vkey = 'R';           break;\n                case Key_S:          vkey = 'S';           break;\n                case Key_T:          vkey = 'T';           break;\n                case Key_U:          vkey = 'U';           break;\n                case Key_V:          vkey = 'V';           break;\n                case Key_W:          vkey = 'W';           break;\n                case Key_X:          vkey = 'X';           break;\n                case Key_Y:          vkey = 'Y';           break;\n                case Key_Z:          vkey = 'Z';           break;\n                case Key_Num0:       vkey = '0';           break;\n                case Key_Num1:       vkey = '1';           break;\n                case Key_Num2:       vkey = '2';           break;\n                case Key_Num3:       vkey = '3';           break;\n                case Key_Num4:       vkey = '4';           break;\n                case Key_Num5:       vkey = '5';           break;\n                case Key_Num6:       vkey = '6';           break;\n                case Key_Num7:       vkey = '7';           break;\n                case Key_Num8:       vkey = '8';           break;\n                case Key_Num9:       vkey = '9';           break;\n                case Key_Escape:     vkey = VK_ESCAPE;     break;\n                case Key_LControl:   vkey = VK_LCONTROL;   break;\n                case Key_LShift:     vkey = VK_LSHIFT;     break;\n                case Key_LAlt:       vkey = VK_LMENU;      break;\n                case Key_LSystem:    vkey = VK_LWIN;       break;\n                case Key_RControl:   vkey = VK_RCONTROL;   break;\n                case Key_RShift:     vkey = VK_RSHIFT;     break;\n                case Key_RAlt:       vkey = VK_RMENU;      break;\n                case Key_RSystem:    vkey = VK_RWIN;       break;\n                case Key_Menu:       vkey = VK_APPS;       break;\n                case Key_LBracket:   vkey = VK_OEM_4;      break;\n                case Key_RBracket:   vkey = VK_OEM_6;      break;\n                case Key_SemiColon:  vkey = VK_OEM_1;      break;\n                case Key_Comma:      vkey = VK_OEM_COMMA;  break;\n                case Key_Period:     vkey = VK_OEM_PERIOD; break;\n                case Key_Quote:      vkey = VK_OEM_7;      break;\n                case Key_Slash:      vkey = VK_OEM_2;      break;\n                case Key_BackSlash:  vkey = VK_OEM_5;      break;\n                case Key_Tilde:      vkey = VK_OEM_3;      break;\n                case Key_Equal:      vkey = VK_OEM_PLUS;   break;\n                case Key_Dash:       vkey = VK_OEM_MINUS;  break;\n                case Key_Space:      vkey = VK_SPACE;      break;\n                case Key_Return:     vkey = VK_RETURN;     break;\n                case Key_BackSpace:  vkey = VK_BACK;       break;\n                case Key_Tab:        vkey = VK_TAB;        break;\n                case Key_PageUp:     vkey = VK_PRIOR;      break;\n                case Key_PageDown:   vkey = VK_NEXT;       break;\n                case Key_End:        vkey = VK_END;        break;\n                case Key_Home:       vkey = VK_HOME;       break;\n                case Key_Insert:     vkey = VK_INSERT;     break;\n                case Key_Delete:     vkey = VK_DELETE;     break;\n                case Key_Add:        vkey = VK_ADD;        break;\n                case Key_Subtract:   vkey = VK_SUBTRACT;   break;\n                case Key_Multiply:   vkey = VK_MULTIPLY;   break;\n                case Key_Divide:     vkey = VK_DIVIDE;     break;\n                case Key_Left:       vkey = VK_LEFT;       break;\n                case Key_Right:      vkey = VK_RIGHT;      break;\n                case Key_Up:         vkey = VK_UP;         break;\n                case Key_Down:       vkey = VK_DOWN;       break;\n                case Key_Numpad0:    vkey = VK_NUMPAD0;    break;\n                case Key_Numpad1:    vkey = VK_NUMPAD1;    break;\n                case Key_Numpad2:    vkey = VK_NUMPAD2;    break;\n                case Key_Numpad3:    vkey = VK_NUMPAD3;    break;\n                case Key_Numpad4:    vkey = VK_NUMPAD4;    break;\n                case Key_Numpad5:    vkey = VK_NUMPAD5;    break;\n                case Key_Numpad6:    vkey = VK_NUMPAD6;    break;\n                case Key_Numpad7:    vkey = VK_NUMPAD7;    break;\n                case Key_Numpad8:    vkey = VK_NUMPAD8;    break;\n                case Key_Numpad9:    vkey = VK_NUMPAD9;    break;\n                case Key_F1:         vkey = VK_F1;         break;\n                case Key_F2:         vkey = VK_F2;         break;\n                case Key_F3:         vkey = VK_F3;         break;\n                case Key_F4:         vkey = VK_F4;         break;\n                case Key_F5:         vkey = VK_F5;         break;\n                case Key_F6:         vkey = VK_F6;         break;\n                case Key_F7:         vkey = VK_F7;         break;\n                case Key_F8:         vkey = VK_F8;         break;\n                case Key_F9:         vkey = VK_F9;         break;\n                case Key_F10:        vkey = VK_F10;        break;\n                case Key_F11:        vkey = VK_F11;        break;\n                case Key_F12:        vkey = VK_F12;        break;\n                case Key_F13:        vkey = VK_F13;        break;\n                case Key_F14:        vkey = VK_F14;        break;\n                case Key_F15:        vkey = VK_F15;        break;\n                case Key_Pause:      vkey = VK_PAUSE;      break;\n                default:             vkey = 0;             break;\n            }\n\n            return ( GetAsyncKeyState( vkey ) & 0x8000 ) != 0;\n        }\n\n#elif defined( OS_LINUX )\n\n        bool isKeyPressed( Key key )\n        {\n            KeySym keysym = 0;\n            switch (key)\n            {\n                case Key_LShift:     keysym = XK_Shift_L;      break;\n                case Key_RShift:     keysym = XK_Shift_R;      break;\n                case Key_LControl:   keysym = XK_Control_L;    break;\n                case Key_RControl:   keysym = XK_Control_R;    break;\n                case Key_LAlt:       keysym = XK_Alt_L;        break;\n                case Key_RAlt:       keysym = XK_Alt_R;        break;\n                case Key_LSystem:    keysym = XK_Super_L;      break;\n                case Key_RSystem:    keysym = XK_Super_R;      break;\n                case Key_Menu:       keysym = XK_Menu;         break;\n                case Key_Escape:     keysym = XK_Escape;       break;\n                case Key_SemiColon:  keysym = XK_semicolon;    break;\n                case Key_Slash:      keysym = XK_slash;        break;\n                case Key_Equal:      keysym = XK_equal;        break;\n                case Key_Dash:       keysym = XK_minus;        break;\n                case Key_LBracket:   keysym = XK_bracketleft;  break;\n                case Key_RBracket:   keysym = XK_bracketright; break;\n                case Key_Comma:      keysym = XK_comma;        break;\n                case Key_Period:     keysym = XK_period;       break;\n                case Key_Quote:      keysym = XK_apostrophe;   break;\n                case Key_BackSlash:  keysym = XK_backslash;    break;\n                case Key_Tilde:      keysym = XK_grave;        break;\n                case Key_Space:      keysym = XK_space;        break;\n                case Key_Return:     keysym = XK_Return;       break;\n                case Key_BackSpace:  keysym = XK_BackSpace;    break;\n                case Key_Tab:        keysym = XK_Tab;          break;\n                case Key_PageUp:     keysym = XK_Prior;        break;\n                case Key_PageDown:   keysym = XK_Next;         break;\n                case Key_End:        keysym = XK_End;          break;\n                case Key_Home:       keysym = XK_Home;         break;\n                case Key_Insert:     keysym = XK_Insert;       break;\n                case Key_Delete:     keysym = XK_Delete;       break;\n                case Key_Add:        keysym = XK_KP_Add;       break;\n                case Key_Subtract:   keysym = XK_KP_Subtract;  break;\n                case Key_Multiply:   keysym = XK_KP_Multiply;  break;\n                case Key_Divide:     keysym = XK_KP_Divide;    break;\n                case Key_Pause:      keysym = XK_Pause;        break;\n                case Key_F1:         keysym = XK_F1;           break;\n                case Key_F2:         keysym = XK_F2;           break;\n                case Key_F3:         keysym = XK_F3;           break;\n                case Key_F4:         keysym = XK_F4;           break;\n                case Key_F5:         keysym = XK_F5;           break;\n                case Key_F6:         keysym = XK_F6;           break;\n                case Key_F7:         keysym = XK_F7;           break;\n                case Key_F8:         keysym = XK_F8;           break;\n                case Key_F9:         keysym = XK_F9;           break;\n                case Key_F10:        keysym = XK_F10;          break;\n                case Key_F11:        keysym = XK_F11;          break;\n                case Key_F12:        keysym = XK_F12;          break;\n                case Key_F13:        keysym = XK_F13;          break;\n                case Key_F14:        keysym = XK_F14;          break;\n                case Key_F15:        keysym = XK_F15;          break;\n                case Key_Left:       keysym = XK_Left;         break;\n                case Key_Right:      keysym = XK_Right;        break;\n                case Key_Up:         keysym = XK_Up;           break;\n                case Key_Down:       keysym = XK_Down;         break;\n                case Key_Numpad0:    keysym = XK_KP_Insert;    break;\n                case Key_Numpad1:    keysym = XK_KP_End;       break;\n                case Key_Numpad2:    keysym = XK_KP_Down;      break;\n                case Key_Numpad3:    keysym = XK_KP_Page_Down; break;\n                case Key_Numpad4:    keysym = XK_KP_Left;      break;\n                case Key_Numpad5:    keysym = XK_KP_Begin;     break;\n                case Key_Numpad6:    keysym = XK_KP_Right;     break;\n                case Key_Numpad7:    keysym = XK_KP_Home;      break;\n                case Key_Numpad8:    keysym = XK_KP_Up;        break;\n                case Key_Numpad9:    keysym = XK_KP_Page_Up;   break;\n                case Key_A:          keysym = XK_a;            break;\n                case Key_B:          keysym = XK_b;            break;\n                case Key_C:          keysym = XK_c;            break;\n                case Key_D:          keysym = XK_d;            break;\n                case Key_E:          keysym = XK_e;            break;\n                case Key_F:          keysym = XK_f;            break;\n                case Key_G:          keysym = XK_g;            break;\n                case Key_H:          keysym = XK_h;            break;\n                case Key_I:          keysym = XK_i;            break;\n                case Key_J:          keysym = XK_j;            break;\n                case Key_K:          keysym = XK_k;            break;\n                case Key_L:          keysym = XK_l;            break;\n                case Key_M:          keysym = XK_m;            break;\n                case Key_N:          keysym = XK_n;            break;\n                case Key_O:          keysym = XK_o;            break;\n                case Key_P:          keysym = XK_p;            break;\n                case Key_Q:          keysym = XK_q;            break;\n                case Key_R:          keysym = XK_r;            break;\n                case Key_S:          keysym = XK_s;            break;\n                case Key_T:          keysym = XK_t;            break;\n                case Key_U:          keysym = XK_u;            break;\n                case Key_V:          keysym = XK_v;            break;\n                case Key_W:          keysym = XK_w;            break;\n                case Key_X:          keysym = XK_x;            break;\n                case Key_Y:          keysym = XK_y;            break;\n                case Key_Z:          keysym = XK_z;            break;\n                case Key_Num0:       keysym = XK_0;            break;\n                case Key_Num1:       keysym = XK_1;            break;\n                case Key_Num2:       keysym = XK_2;            break;\n                case Key_Num3:       keysym = XK_3;            break;\n                case Key_Num4:       keysym = XK_4;            break;\n                case Key_Num5:       keysym = XK_5;            break;\n                case Key_Num6:       keysym = XK_6;            break;\n                case Key_Num7:       keysym = XK_7;            break;\n                case Key_Num8:       keysym = XK_8;            break;\n                case Key_Num9:       keysym = XK_9;            break;\n                default:             keysym = 0;               break;\n            }\n\n            Display* dis = XOpenDisplay( nullptr );\n            xcb_keycode_t keycode = XKeysymToKeycode( dis, keysym );\n            XCloseDisplay( dis );\n\n            xcb_connection_t* connection = xcb_connect( nullptr, nullptr );\n            xcb_generic_error_t* error = nullptr;\n\n            xcb_query_keymap_reply_t* keymap = xcb_query_keymap_reply(\n                connection, xcb_query_keymap( connection ), &error );\n\n            xcb_disconnect( connection );\n\n            if ( error )\n            {\n                LOG( logERROR ) << \"Could not query keymap in isKeyPressed()\";\n                return false;\n            }\n\n            \/\/ NOTE(Charly): No real idea what is going on there, but it seems to work :D\n            return ( keymap->keys[keycode \/ 8] & ( 1 << ( keycode % 8 ) ) ) != 0;\n        }\n#else\n        bool isKeyPressed( Key key )\n        {\n            LOG( logERROR ) << \"isKeyPressed is not implemented for your OS.\"\n                return false;\n        }\n#endif\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- llvm\/CodeGen\/GlobalISel\/InstructionSelect.cpp - InstructionSelect ---==\/\/\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\/\/\/ \\file\n\/\/\/ This file implements the InstructionSelect class.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelect.h\"\n#include \"llvm\/ADT\/PostOrderIterator.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelector.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/LegalizerInfo.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/CodeGen\/TargetPassConfig.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Target\/TargetSubtargetInfo.h\"\n\n#define DEBUG_TYPE \"instruction-select\"\n\nusing namespace llvm;\n\nchar InstructionSelect::ID = 0;\nINITIALIZE_PASS_BEGIN(InstructionSelect, DEBUG_TYPE,\n                      \"Select target instructions out of generic instructions\",\n                      false, false)\nINITIALIZE_PASS_DEPENDENCY(TargetPassConfig)\nINITIALIZE_PASS_END(InstructionSelect, DEBUG_TYPE,\n                    \"Select target instructions out of generic instructions\",\n                    false, false)\n\nInstructionSelect::InstructionSelect() : MachineFunctionPass(ID) {\n  initializeInstructionSelectPass(*PassRegistry::getPassRegistry());\n}\n\nvoid InstructionSelect::getAnalysisUsage(AnalysisUsage &AU) const {\n  AU.addRequired<TargetPassConfig>();\n  MachineFunctionPass::getAnalysisUsage(AU);\n}\n\nstatic void reportSelectionError(const MachineFunction &MF,\n                                 const MachineInstr *MI, const Twine &Message) {\n  std::string ErrStorage;\n  raw_string_ostream Err(ErrStorage);\n  Err << Message << \":\\nIn function: \" << MF.getName() << '\\n';\n  if (MI)\n    Err << *MI << '\\n';\n  report_fatal_error(Err.str());\n}\n\nbool InstructionSelect::runOnMachineFunction(MachineFunction &MF) {\n  \/\/ If the ISel pipeline failed, do not bother running that pass.\n  if (MF.getProperties().hasProperty(\n          MachineFunctionProperties::Property::FailedISel))\n    return false;\n\n  DEBUG(dbgs() << \"Selecting function: \" << MF.getName() << '\\n');\n\n  const TargetPassConfig &TPC = getAnalysis<TargetPassConfig>();\n  const InstructionSelector *ISel = MF.getSubtarget().getInstructionSelector();\n  assert(ISel && \"Cannot work without InstructionSelector\");\n\n  \/\/ FIXME: freezeReservedRegs is now done in IRTranslator, but there are many\n  \/\/ other MF\/MFI fields we need to initialize.\n\n  const MachineRegisterInfo &MRI = MF.getRegInfo();\n\n#ifndef NDEBUG\n  \/\/ Check that our input is fully legal: we require the function to have the\n  \/\/ Legalized property, so it should be.\n  \/\/ FIXME: This should be in the MachineVerifier, but it can't use the\n  \/\/ LegalizerInfo as it's currently in the separate GlobalISel library.\n  \/\/ The RegBankSelected property is already checked in the verifier. Note\n  \/\/ that it has the same layering problem, but we only use inline methods so\n  \/\/ end up not needing to link against the GlobalISel library.\n  if (const LegalizerInfo *MLI = MF.getSubtarget().getLegalizerInfo())\n    for (const MachineBasicBlock &MBB : MF)\n      for (const MachineInstr &MI : MBB)\n        if (isPreISelGenericOpcode(MI.getOpcode()) && !MLI->isLegal(MI, MRI))\n          reportSelectionError(MF, &MI, \"Instruction is not legal\");\n\n#endif\n  \/\/ FIXME: We could introduce new blocks and will need to fix the outer loop.\n  \/\/ Until then, keep track of the number of blocks to assert that we don't.\n  const size_t NumBlocks = MF.size();\n\n  bool Failed = false;\n  for (MachineBasicBlock *MBB : post_order(&MF)) {\n    if (MBB->empty())\n      continue;\n\n    \/\/ Select instructions in reverse block order. We permit erasing so have\n    \/\/ to resort to manually iterating and recognizing the begin (rend) case.\n    bool ReachedBegin = false;\n    for (auto MII = std::prev(MBB->end()), Begin = MBB->begin();\n         !ReachedBegin;) {\n#ifndef NDEBUG\n      \/\/ Keep track of the insertion range for debug printing.\n      const auto AfterIt = std::next(MII);\n#endif\n      \/\/ Select this instruction.\n      MachineInstr &MI = *MII;\n\n      \/\/ And have our iterator point to the next instruction, if there is one.\n      if (MII == Begin)\n        ReachedBegin = true;\n      else\n        --MII;\n\n      DEBUG(dbgs() << \"Selecting: \\n  \" << MI);\n\n      if (!ISel->select(MI)) {\n        if (TPC.isGlobalISelAbortEnabled())\n          \/\/ FIXME: It would be nice to dump all inserted instructions.  It's\n          \/\/ not obvious how, esp. considering select() can insert after MI.\n          reportSelectionError(MF, &MI, \"Cannot select\");\n        Failed = true;\n        break;\n      }\n\n      \/\/ Dump the range of instructions that MI expanded into.\n      DEBUG({\n        auto InsertedBegin = ReachedBegin ? MBB->begin() : std::next(MII);\n        dbgs() << \"Into:\\n\";\n        for (auto &InsertedMI : make_range(InsertedBegin, AfterIt))\n          dbgs() << \"  \" << InsertedMI;\n        dbgs() << '\\n';\n      });\n    }\n  }\n\n  \/\/ Now that selection is complete, there are no more generic vregs.  Verify\n  \/\/ that the size of the now-constrained vreg is unchanged and that it has a\n  \/\/ register class.\n  for (auto &VRegToType : MRI.getVRegToType()) {\n    unsigned VReg = VRegToType.first;\n    auto *RC = MRI.getRegClassOrNull(VReg);\n    MachineInstr *MI = nullptr;\n    if (!MRI.def_empty(VReg))\n      MI = &*MRI.def_instr_begin(VReg);\n    else if (!MRI.use_empty(VReg))\n      MI = &*MRI.use_instr_begin(VReg);\n\n    if (MI && !RC) {\n      if (TPC.isGlobalISelAbortEnabled())\n        reportSelectionError(MF, MI, \"VReg has no regclass after selection\");\n      Failed = true;\n      break;\n    } else if (!RC)\n      continue;\n\n    if (VRegToType.second.isValid() &&\n        VRegToType.second.getSizeInBits() > (RC->getSize() * 8)) {\n      if (TPC.isGlobalISelAbortEnabled())\n        reportSelectionError(\n            MF, MI, \"VReg has explicit size different from class size\");\n      Failed = true;\n      break;\n    }\n  }\n\n  MRI.getVRegToType().clear();\n\n  if (!TPC.isGlobalISelAbortEnabled() && (Failed || MF.size() != NumBlocks)) {\n    MF.getProperties().set(MachineFunctionProperties::Property::FailedISel);\n    return false;\n  }\n  assert(MF.size() == NumBlocks && \"Inserting blocks is not supported yet\");\n\n  \/\/ FIXME: Should we accurately track changes?\n  return true;\n}\n<commit_msg>[GlobalISel] Simplify Select type cleanup using a ScopeExit. NFC.<commit_after>\/\/===- llvm\/CodeGen\/GlobalISel\/InstructionSelect.cpp - InstructionSelect ---==\/\/\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\/\/\/ \\file\n\/\/\/ This file implements the InstructionSelect class.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelect.h\"\n#include \"llvm\/ADT\/PostOrderIterator.h\"\n#include \"llvm\/ADT\/ScopeExit.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelector.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/LegalizerInfo.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/CodeGen\/TargetPassConfig.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Target\/TargetSubtargetInfo.h\"\n\n#define DEBUG_TYPE \"instruction-select\"\n\nusing namespace llvm;\n\nchar InstructionSelect::ID = 0;\nINITIALIZE_PASS_BEGIN(InstructionSelect, DEBUG_TYPE,\n                      \"Select target instructions out of generic instructions\",\n                      false, false)\nINITIALIZE_PASS_DEPENDENCY(TargetPassConfig)\nINITIALIZE_PASS_END(InstructionSelect, DEBUG_TYPE,\n                    \"Select target instructions out of generic instructions\",\n                    false, false)\n\nInstructionSelect::InstructionSelect() : MachineFunctionPass(ID) {\n  initializeInstructionSelectPass(*PassRegistry::getPassRegistry());\n}\n\nvoid InstructionSelect::getAnalysisUsage(AnalysisUsage &AU) const {\n  AU.addRequired<TargetPassConfig>();\n  MachineFunctionPass::getAnalysisUsage(AU);\n}\n\nstatic void reportSelectionError(const MachineFunction &MF,\n                                 const MachineInstr *MI, const Twine &Message) {\n  std::string ErrStorage;\n  raw_string_ostream Err(ErrStorage);\n  Err << Message << \":\\nIn function: \" << MF.getName() << '\\n';\n  if (MI)\n    Err << *MI << '\\n';\n  report_fatal_error(Err.str());\n}\n\nbool InstructionSelect::runOnMachineFunction(MachineFunction &MF) {\n  const MachineRegisterInfo &MRI = MF.getRegInfo();\n\n  \/\/ No matter what happens, whether we successfully select the function or not,\n  \/\/ nothing is going to use the vreg types after us.  Make sure they disappear.\n  auto ClearVRegTypesOnReturn =\n      make_scope_exit([&]() { MRI.getVRegToType().clear(); });\n\n  \/\/ If the ISel pipeline failed, do not bother running that pass.\n  if (MF.getProperties().hasProperty(\n          MachineFunctionProperties::Property::FailedISel))\n    return false;\n\n  DEBUG(dbgs() << \"Selecting function: \" << MF.getName() << '\\n');\n\n  const TargetPassConfig &TPC = getAnalysis<TargetPassConfig>();\n  const InstructionSelector *ISel = MF.getSubtarget().getInstructionSelector();\n  assert(ISel && \"Cannot work without InstructionSelector\");\n\n  \/\/ FIXME: freezeReservedRegs is now done in IRTranslator, but there are many\n  \/\/ other MF\/MFI fields we need to initialize.\n\n#ifndef NDEBUG\n  \/\/ Check that our input is fully legal: we require the function to have the\n  \/\/ Legalized property, so it should be.\n  \/\/ FIXME: This should be in the MachineVerifier, but it can't use the\n  \/\/ LegalizerInfo as it's currently in the separate GlobalISel library.\n  \/\/ The RegBankSelected property is already checked in the verifier. Note\n  \/\/ that it has the same layering problem, but we only use inline methods so\n  \/\/ end up not needing to link against the GlobalISel library.\n  if (const LegalizerInfo *MLI = MF.getSubtarget().getLegalizerInfo())\n    for (const MachineBasicBlock &MBB : MF)\n      for (const MachineInstr &MI : MBB)\n        if (isPreISelGenericOpcode(MI.getOpcode()) && !MLI->isLegal(MI, MRI))\n          reportSelectionError(MF, &MI, \"Instruction is not legal\");\n\n#endif\n  \/\/ FIXME: We could introduce new blocks and will need to fix the outer loop.\n  \/\/ Until then, keep track of the number of blocks to assert that we don't.\n  const size_t NumBlocks = MF.size();\n\n  for (MachineBasicBlock *MBB : post_order(&MF)) {\n    if (MBB->empty())\n      continue;\n\n    \/\/ Select instructions in reverse block order. We permit erasing so have\n    \/\/ to resort to manually iterating and recognizing the begin (rend) case.\n    bool ReachedBegin = false;\n    for (auto MII = std::prev(MBB->end()), Begin = MBB->begin();\n         !ReachedBegin;) {\n#ifndef NDEBUG\n      \/\/ Keep track of the insertion range for debug printing.\n      const auto AfterIt = std::next(MII);\n#endif\n      \/\/ Select this instruction.\n      MachineInstr &MI = *MII;\n\n      \/\/ And have our iterator point to the next instruction, if there is one.\n      if (MII == Begin)\n        ReachedBegin = true;\n      else\n        --MII;\n\n      DEBUG(dbgs() << \"Selecting: \\n  \" << MI);\n\n      if (!ISel->select(MI)) {\n        if (TPC.isGlobalISelAbortEnabled())\n          \/\/ FIXME: It would be nice to dump all inserted instructions.  It's\n          \/\/ not obvious how, esp. considering select() can insert after MI.\n          reportSelectionError(MF, &MI, \"Cannot select\");\n        MF.getProperties().set(MachineFunctionProperties::Property::FailedISel);\n        return false;\n      }\n\n      \/\/ Dump the range of instructions that MI expanded into.\n      DEBUG({\n        auto InsertedBegin = ReachedBegin ? MBB->begin() : std::next(MII);\n        dbgs() << \"Into:\\n\";\n        for (auto &InsertedMI : make_range(InsertedBegin, AfterIt))\n          dbgs() << \"  \" << InsertedMI;\n        dbgs() << '\\n';\n      });\n    }\n  }\n\n  \/\/ Now that selection is complete, there are no more generic vregs.  Verify\n  \/\/ that the size of the now-constrained vreg is unchanged and that it has a\n  \/\/ register class.\n  for (auto &VRegToType : MRI.getVRegToType()) {\n    unsigned VReg = VRegToType.first;\n    auto *RC = MRI.getRegClassOrNull(VReg);\n    MachineInstr *MI = nullptr;\n    if (!MRI.def_empty(VReg))\n      MI = &*MRI.def_instr_begin(VReg);\n    else if (!MRI.use_empty(VReg))\n      MI = &*MRI.use_instr_begin(VReg);\n\n    if (MI && !RC) {\n      if (TPC.isGlobalISelAbortEnabled())\n        reportSelectionError(MF, MI, \"VReg has no regclass after selection\");\n      MF.getProperties().set(MachineFunctionProperties::Property::FailedISel);\n      return false;\n    } else if (!RC)\n      continue;\n\n    if (VRegToType.second.isValid() &&\n        VRegToType.second.getSizeInBits() > (RC->getSize() * 8)) {\n      if (TPC.isGlobalISelAbortEnabled())\n        reportSelectionError(\n            MF, MI, \"VReg has explicit size different from class size\");\n      MF.getProperties().set(MachineFunctionProperties::Property::FailedISel);\n      return false;\n    }\n  }\n\n  if (MF.size() != NumBlocks) {\n    if (TPC.isGlobalISelAbortEnabled())\n      reportSelectionError(MF, \/*MI=*\/nullptr,\n                           \"Inserting blocks is not supported yet\");\n    MF.getProperties().set(MachineFunctionProperties::Property::FailedISel);\n    return false;\n  }\n\n  \/\/ FIXME: Should we accurately track changes?\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- llvm\/CodeGen\/GlobalISel\/InstructionSelect.cpp - InstructionSelect ---==\/\/\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\/\/\/ \\file\n\/\/\/ This file implements the InstructionSelect class.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelect.h\"\n#include \"llvm\/ADT\/PostOrderIterator.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelector.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/LegalizerInfo.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/Utils.h\"\n#include \"llvm\/CodeGen\/MachineOptimizationRemarkEmitter.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/CodeGen\/TargetLowering.h\"\n#include \"llvm\/CodeGen\/TargetPassConfig.h\"\n#include \"llvm\/CodeGen\/TargetSubtargetInfo.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n\n#define DEBUG_TYPE \"instruction-select\"\n\nusing namespace llvm;\n\n#ifdef LLVM_GISEL_COV_PREFIX\nstatic cl::opt<std::string>\n    CoveragePrefix(\"gisel-coverage-prefix\", cl::init(LLVM_GISEL_COV_PREFIX),\n                   cl::desc(\"Record GlobalISel rule coverage files of this \"\n                            \"prefix if instrumentation was generated\"));\n#else\nstatic const std::string CoveragePrefix = \"\";\n#endif\n\nchar InstructionSelect::ID = 0;\nINITIALIZE_PASS_BEGIN(InstructionSelect, DEBUG_TYPE,\n                      \"Select target instructions out of generic instructions\",\n                      false, false)\nINITIALIZE_PASS_DEPENDENCY(TargetPassConfig)\nINITIALIZE_PASS_END(InstructionSelect, DEBUG_TYPE,\n                    \"Select target instructions out of generic instructions\",\n                    false, false)\n\nInstructionSelect::InstructionSelect() : MachineFunctionPass(ID) {\n  initializeInstructionSelectPass(*PassRegistry::getPassRegistry());\n}\n\nvoid InstructionSelect::getAnalysisUsage(AnalysisUsage &AU) const {\n  AU.addRequired<TargetPassConfig>();\n  getSelectionDAGFallbackAnalysisUsage(AU);\n  MachineFunctionPass::getAnalysisUsage(AU);\n}\n\nbool InstructionSelect::runOnMachineFunction(MachineFunction &MF) {\n  \/\/ If the ISel pipeline failed, do not bother running that pass.\n  if (MF.getProperties().hasProperty(\n          MachineFunctionProperties::Property::FailedISel))\n    return false;\n\n  LLVM_DEBUG(dbgs() << \"Selecting function: \" << MF.getName() << '\\n');\n\n  const TargetPassConfig &TPC = getAnalysis<TargetPassConfig>();\n  const InstructionSelector *ISel = MF.getSubtarget().getInstructionSelector();\n  CodeGenCoverage CoverageInfo;\n  assert(ISel && \"Cannot work without InstructionSelector\");\n\n  \/\/ An optimization remark emitter. Used to report failures.\n  MachineOptimizationRemarkEmitter MORE(MF, \/*MBFI=*\/nullptr);\n\n  \/\/ FIXME: There are many other MF\/MFI fields we need to initialize.\n\n  MachineRegisterInfo &MRI = MF.getRegInfo();\n#ifndef NDEBUG\n  \/\/ Check that our input is fully legal: we require the function to have the\n  \/\/ Legalized property, so it should be.\n  \/\/ FIXME: This should be in the MachineVerifier, as the RegBankSelected\n  \/\/ property check already is.\n  if (!DisableGISelLegalityCheck)\n    if (const MachineInstr *MI = machineFunctionIsIllegal(MF)) {\n      reportGISelFailure(MF, TPC, MORE, \"gisel-select\",\n                         \"instruction is not legal\", *MI);\n      return false;\n    }\n#endif\n  \/\/ FIXME: We could introduce new blocks and will need to fix the outer loop.\n  \/\/ Until then, keep track of the number of blocks to assert that we don't.\n  const size_t NumBlocks = MF.size();\n\n  for (MachineBasicBlock *MBB : post_order(&MF)) {\n    if (MBB->empty())\n      continue;\n\n    \/\/ Select instructions in reverse block order. We permit erasing so have\n    \/\/ to resort to manually iterating and recognizing the begin (rend) case.\n    bool ReachedBegin = false;\n    for (auto MII = std::prev(MBB->end()), Begin = MBB->begin();\n         !ReachedBegin;) {\n#ifndef NDEBUG\n      \/\/ Keep track of the insertion range for debug printing.\n      const auto AfterIt = std::next(MII);\n#endif\n      \/\/ Select this instruction.\n      MachineInstr &MI = *MII;\n\n      \/\/ And have our iterator point to the next instruction, if there is one.\n      if (MII == Begin)\n        ReachedBegin = true;\n      else\n        --MII;\n\n      LLVM_DEBUG(dbgs() << \"Selecting: \\n  \" << MI);\n\n      \/\/ We could have folded this instruction away already, making it dead.\n      \/\/ If so, erase it.\n      if (isTriviallyDead(MI, MRI)) {\n        LLVM_DEBUG(dbgs() << \"Is dead; erasing.\\n\");\n        MI.eraseFromParentAndMarkDBGValuesForRemoval();\n        continue;\n      }\n\n      if (!ISel->select(MI, CoverageInfo)) {\n        \/\/ FIXME: It would be nice to dump all inserted instructions.  It's\n        \/\/ not obvious how, esp. considering select() can insert after MI.\n        reportGISelFailure(MF, TPC, MORE, \"gisel-select\", \"cannot select\", MI);\n        return false;\n      }\n\n      \/\/ Dump the range of instructions that MI expanded into.\n      LLVM_DEBUG({\n        auto InsertedBegin = ReachedBegin ? MBB->begin() : std::next(MII);\n        dbgs() << \"Into:\\n\";\n        for (auto &InsertedMI : make_range(InsertedBegin, AfterIt))\n          dbgs() << \"  \" << InsertedMI;\n        dbgs() << '\\n';\n      });\n    }\n  }\n\n  const TargetRegisterInfo &TRI = *MF.getSubtarget().getRegisterInfo();\n\n  for (MachineBasicBlock &MBB : MF) {\n    if (MBB.empty())\n      continue;\n\n    \/\/ Try to find redundant copies b\/w vregs of the same register class.\n    bool ReachedBegin = false;\n    for (auto MII = std::prev(MBB.end()), Begin = MBB.begin(); !ReachedBegin;) {\n      \/\/ Select this instruction.\n      MachineInstr &MI = *MII;\n\n      \/\/ And have our iterator point to the next instruction, if there is one.\n      if (MII == Begin)\n        ReachedBegin = true;\n      else\n        --MII;\n      if (MI.getOpcode() != TargetOpcode::COPY)\n        continue;\n      unsigned SrcReg = MI.getOperand(1).getReg();\n      unsigned DstReg = MI.getOperand(0).getReg();\n      if (TargetRegisterInfo::isVirtualRegister(SrcReg) &&\n          TargetRegisterInfo::isVirtualRegister(DstReg)) {\n        auto SrcRC = MRI.getRegClass(SrcReg);\n        auto DstRC = MRI.getRegClass(DstReg);\n        if (SrcRC == DstRC) {\n          MRI.replaceRegWith(DstReg, SrcReg);\n          MI.eraseFromParentAndMarkDBGValuesForRemoval();\n        }\n      }\n    }\n  }\n\n  \/\/ Now that selection is complete, there are no more generic vregs.  Verify\n  \/\/ that the size of the now-constrained vreg is unchanged and that it has a\n  \/\/ register class.\n  for (unsigned I = 0, E = MRI.getNumVirtRegs(); I != E; ++I) {\n    unsigned VReg = TargetRegisterInfo::index2VirtReg(I);\n\n    MachineInstr *MI = nullptr;\n    if (!MRI.def_empty(VReg))\n      MI = &*MRI.def_instr_begin(VReg);\n    else if (!MRI.use_empty(VReg))\n      MI = &*MRI.use_instr_begin(VReg);\n    if (!MI)\n      continue;\n\n    const TargetRegisterClass *RC = MRI.getRegClassOrNull(VReg);\n    if (!RC) {\n      reportGISelFailure(MF, TPC, MORE, \"gisel-select\",\n                         \"VReg has no regclass after selection\", *MI);\n      return false;\n    }\n\n    const LLT Ty = MRI.getType(VReg);\n    if (Ty.isValid() && Ty.getSizeInBits() > TRI.getRegSizeInBits(*RC)) {\n      reportGISelFailure(\n          MF, TPC, MORE, \"gisel-select\",\n          \"VReg's low-level type and register class have different sizes\", *MI);\n      return false;\n    }\n  }\n\n  if (MF.size() != NumBlocks) {\n    MachineOptimizationRemarkMissed R(\"gisel-select\", \"GISelFailure\",\n                                      MF.getFunction().getSubprogram(),\n                                      \/*MBB=*\/nullptr);\n    R << \"inserting blocks is not supported yet\";\n    reportGISelFailure(MF, TPC, MORE, R);\n    return false;\n  }\n\n  auto &TLI = *MF.getSubtarget().getTargetLowering();\n  TLI.finalizeLowering(MF);\n\n  LLVM_DEBUG({\n    dbgs() << \"Rules covered by selecting function: \" << MF.getName() << \":\";\n    for (auto RuleID : CoverageInfo.covered())\n      dbgs() << \" id\" << RuleID;\n    dbgs() << \"\\n\\n\";\n  });\n  CoverageInfo.emit(CoveragePrefix,\n                    MF.getSubtarget()\n                        .getTargetLowering()\n                        ->getTargetMachine()\n                        .getTarget()\n                        .getBackendName());\n\n  \/\/ If we successfully selected the function nothing is going to use the vreg\n  \/\/ types after us (otherwise MIRPrinter would need them). Make sure the types\n  \/\/ disappear.\n  MRI.clearVirtRegTypes();\n\n  \/\/ FIXME: Should we accurately track changes?\n  return true;\n}\n<commit_msg>[GlobalISel] Make isel verification checks of vregs run under NDEBUG only.<commit_after>\/\/===- llvm\/CodeGen\/GlobalISel\/InstructionSelect.cpp - InstructionSelect ---==\/\/\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\/\/\/ \\file\n\/\/\/ This file implements the InstructionSelect class.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelect.h\"\n#include \"llvm\/ADT\/PostOrderIterator.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelector.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/LegalizerInfo.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/Utils.h\"\n#include \"llvm\/CodeGen\/MachineOptimizationRemarkEmitter.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/CodeGen\/TargetLowering.h\"\n#include \"llvm\/CodeGen\/TargetPassConfig.h\"\n#include \"llvm\/CodeGen\/TargetSubtargetInfo.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n\n#define DEBUG_TYPE \"instruction-select\"\n\nusing namespace llvm;\n\n#ifdef LLVM_GISEL_COV_PREFIX\nstatic cl::opt<std::string>\n    CoveragePrefix(\"gisel-coverage-prefix\", cl::init(LLVM_GISEL_COV_PREFIX),\n                   cl::desc(\"Record GlobalISel rule coverage files of this \"\n                            \"prefix if instrumentation was generated\"));\n#else\nstatic const std::string CoveragePrefix = \"\";\n#endif\n\nchar InstructionSelect::ID = 0;\nINITIALIZE_PASS_BEGIN(InstructionSelect, DEBUG_TYPE,\n                      \"Select target instructions out of generic instructions\",\n                      false, false)\nINITIALIZE_PASS_DEPENDENCY(TargetPassConfig)\nINITIALIZE_PASS_END(InstructionSelect, DEBUG_TYPE,\n                    \"Select target instructions out of generic instructions\",\n                    false, false)\n\nInstructionSelect::InstructionSelect() : MachineFunctionPass(ID) {\n  initializeInstructionSelectPass(*PassRegistry::getPassRegistry());\n}\n\nvoid InstructionSelect::getAnalysisUsage(AnalysisUsage &AU) const {\n  AU.addRequired<TargetPassConfig>();\n  getSelectionDAGFallbackAnalysisUsage(AU);\n  MachineFunctionPass::getAnalysisUsage(AU);\n}\n\nbool InstructionSelect::runOnMachineFunction(MachineFunction &MF) {\n  \/\/ If the ISel pipeline failed, do not bother running that pass.\n  if (MF.getProperties().hasProperty(\n          MachineFunctionProperties::Property::FailedISel))\n    return false;\n\n  LLVM_DEBUG(dbgs() << \"Selecting function: \" << MF.getName() << '\\n');\n\n  const TargetPassConfig &TPC = getAnalysis<TargetPassConfig>();\n  const InstructionSelector *ISel = MF.getSubtarget().getInstructionSelector();\n  CodeGenCoverage CoverageInfo;\n  assert(ISel && \"Cannot work without InstructionSelector\");\n\n  \/\/ An optimization remark emitter. Used to report failures.\n  MachineOptimizationRemarkEmitter MORE(MF, \/*MBFI=*\/nullptr);\n\n  \/\/ FIXME: There are many other MF\/MFI fields we need to initialize.\n\n  MachineRegisterInfo &MRI = MF.getRegInfo();\n#ifndef NDEBUG\n  \/\/ Check that our input is fully legal: we require the function to have the\n  \/\/ Legalized property, so it should be.\n  \/\/ FIXME: This should be in the MachineVerifier, as the RegBankSelected\n  \/\/ property check already is.\n  if (!DisableGISelLegalityCheck)\n    if (const MachineInstr *MI = machineFunctionIsIllegal(MF)) {\n      reportGISelFailure(MF, TPC, MORE, \"gisel-select\",\n                         \"instruction is not legal\", *MI);\n      return false;\n    }\n  \/\/ FIXME: We could introduce new blocks and will need to fix the outer loop.\n  \/\/ Until then, keep track of the number of blocks to assert that we don't.\n  const size_t NumBlocks = MF.size();\n#endif\n\n  for (MachineBasicBlock *MBB : post_order(&MF)) {\n    if (MBB->empty())\n      continue;\n\n    \/\/ Select instructions in reverse block order. We permit erasing so have\n    \/\/ to resort to manually iterating and recognizing the begin (rend) case.\n    bool ReachedBegin = false;\n    for (auto MII = std::prev(MBB->end()), Begin = MBB->begin();\n         !ReachedBegin;) {\n#ifndef NDEBUG\n      \/\/ Keep track of the insertion range for debug printing.\n      const auto AfterIt = std::next(MII);\n#endif\n      \/\/ Select this instruction.\n      MachineInstr &MI = *MII;\n\n      \/\/ And have our iterator point to the next instruction, if there is one.\n      if (MII == Begin)\n        ReachedBegin = true;\n      else\n        --MII;\n\n      LLVM_DEBUG(dbgs() << \"Selecting: \\n  \" << MI);\n\n      \/\/ We could have folded this instruction away already, making it dead.\n      \/\/ If so, erase it.\n      if (isTriviallyDead(MI, MRI)) {\n        LLVM_DEBUG(dbgs() << \"Is dead; erasing.\\n\");\n        MI.eraseFromParentAndMarkDBGValuesForRemoval();\n        continue;\n      }\n\n      if (!ISel->select(MI, CoverageInfo)) {\n        \/\/ FIXME: It would be nice to dump all inserted instructions.  It's\n        \/\/ not obvious how, esp. considering select() can insert after MI.\n        reportGISelFailure(MF, TPC, MORE, \"gisel-select\", \"cannot select\", MI);\n        return false;\n      }\n\n      \/\/ Dump the range of instructions that MI expanded into.\n      LLVM_DEBUG({\n        auto InsertedBegin = ReachedBegin ? MBB->begin() : std::next(MII);\n        dbgs() << \"Into:\\n\";\n        for (auto &InsertedMI : make_range(InsertedBegin, AfterIt))\n          dbgs() << \"  \" << InsertedMI;\n        dbgs() << '\\n';\n      });\n    }\n  }\n\n  for (MachineBasicBlock &MBB : MF) {\n    if (MBB.empty())\n      continue;\n\n    \/\/ Try to find redundant copies b\/w vregs of the same register class.\n    bool ReachedBegin = false;\n    for (auto MII = std::prev(MBB.end()), Begin = MBB.begin(); !ReachedBegin;) {\n      \/\/ Select this instruction.\n      MachineInstr &MI = *MII;\n\n      \/\/ And have our iterator point to the next instruction, if there is one.\n      if (MII == Begin)\n        ReachedBegin = true;\n      else\n        --MII;\n      if (MI.getOpcode() != TargetOpcode::COPY)\n        continue;\n      unsigned SrcReg = MI.getOperand(1).getReg();\n      unsigned DstReg = MI.getOperand(0).getReg();\n      if (TargetRegisterInfo::isVirtualRegister(SrcReg) &&\n          TargetRegisterInfo::isVirtualRegister(DstReg)) {\n        auto SrcRC = MRI.getRegClass(SrcReg);\n        auto DstRC = MRI.getRegClass(DstReg);\n        if (SrcRC == DstRC) {\n          MRI.replaceRegWith(DstReg, SrcReg);\n          MI.eraseFromParentAndMarkDBGValuesForRemoval();\n        }\n      }\n    }\n  }\n\n#ifndef NDEBUG\n  const TargetRegisterInfo &TRI = *MF.getSubtarget().getRegisterInfo();\n  \/\/ Now that selection is complete, there are no more generic vregs.  Verify\n  \/\/ that the size of the now-constrained vreg is unchanged and that it has a\n  \/\/ register class.\n  for (unsigned I = 0, E = MRI.getNumVirtRegs(); I != E; ++I) {\n    unsigned VReg = TargetRegisterInfo::index2VirtReg(I);\n\n    MachineInstr *MI = nullptr;\n    if (!MRI.def_empty(VReg))\n      MI = &*MRI.def_instr_begin(VReg);\n    else if (!MRI.use_empty(VReg))\n      MI = &*MRI.use_instr_begin(VReg);\n    if (!MI)\n      continue;\n\n    const TargetRegisterClass *RC = MRI.getRegClassOrNull(VReg);\n    if (!RC) {\n      reportGISelFailure(MF, TPC, MORE, \"gisel-select\",\n                         \"VReg has no regclass after selection\", *MI);\n      return false;\n    }\n\n    const LLT Ty = MRI.getType(VReg);\n    if (Ty.isValid() && Ty.getSizeInBits() > TRI.getRegSizeInBits(*RC)) {\n      reportGISelFailure(\n          MF, TPC, MORE, \"gisel-select\",\n          \"VReg's low-level type and register class have different sizes\", *MI);\n      return false;\n    }\n  }\n\n  if (MF.size() != NumBlocks) {\n    MachineOptimizationRemarkMissed R(\"gisel-select\", \"GISelFailure\",\n                                      MF.getFunction().getSubprogram(),\n                                      \/*MBB=*\/nullptr);\n    R << \"inserting blocks is not supported yet\";\n    reportGISelFailure(MF, TPC, MORE, R);\n    return false;\n  }\n#endif\n  auto &TLI = *MF.getSubtarget().getTargetLowering();\n  TLI.finalizeLowering(MF);\n\n  LLVM_DEBUG({\n    dbgs() << \"Rules covered by selecting function: \" << MF.getName() << \":\";\n    for (auto RuleID : CoverageInfo.covered())\n      dbgs() << \" id\" << RuleID;\n    dbgs() << \"\\n\\n\";\n  });\n  CoverageInfo.emit(CoveragePrefix,\n                    MF.getSubtarget()\n                        .getTargetLowering()\n                        ->getTargetMachine()\n                        .getTarget()\n                        .getBackendName());\n\n  \/\/ If we successfully selected the function nothing is going to use the vreg\n  \/\/ types after us (otherwise MIRPrinter would need them). Make sure the types\n  \/\/ disappear.\n  MRI.clearVirtRegTypes();\n\n  \/\/ FIXME: Should we accurately track changes?\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*  MConfig - C++ library for working with configuration files\n    Copyright (C) 2011 Dmitry Shatrov\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 <libmary\/types.h>\n#include <cctype>\n\n#include <mycpp\/native_file.h>\n#include <mycpp\/cached_file.h>\n\n#include <pargen\/parser.h>\n\n#include <scruffy\/preprocessor.h>\n#include <scruffy\/list_pp_item_stream.h>\n#include <scruffy\/pp_item_stream_token_stream.h>\n#include <scruffy\/checkpoint_tracker.h>\n\n#include <mconfig\/mconfig_pargen.h>\n\n#include <mconfig\/config_parser.h>\n\n\nusing namespace M;\n\nnamespace MConfig {\n\nclass ConfigParser\n{\npublic:\n    MyCpp::List<Section*> sections;\n\n    Scruffy::CheckpointTracker checkpoint_tracker;\n\n    ConfigParser (Config * const config)\n    {\n\tsections.append (config->getRootSection());\n    }\n};\n\n\/\/ Characters banned from words: \" { } , ; # =\n\/\/\n\/\/ \" is used for string literals, which are provided by pargen with quotes\n\/\/ included.\n\/\/\nbool\nmconfig_word_token_match_func (MyCpp::ConstMemoryDesc const &token_mem,\n\t\t\t       void * const \/* token_user_ptr *\/,\n\t\t\t       void * const \/* user_data *\/)\n{\n    logD_ (_func, ConstMemory (token_mem));\n\n    if (token_mem.getLength() == 0)\n\treturn false;\n\n    char const *token = (char const*) token_mem.getMemory();\n    if (token [0] == '{' ||\n\ttoken [0] == '}' ||\n\ttoken [0] == ',' ||\n\ttoken [0] == ';' ||\n\ttoken [0] == '#' ||\n\ttoken [0] == '=')\n    {\n\treturn false;\n    }\n\n    if (token [0] == '\"'\n\t&& (token_mem.getLength() == 1\n\t    || token [token_mem.getLength() - 1] != '\"'))\n    {\n\treturn false;\n    }\n\n    return true;\n}\n\nstatic bool\nwhitespaceBetweenWordsNeeded (ConstMemory const &left,\n\t\t\t      ConstMemory const &right)\n{\n    if (left .len() == 0 ||\n\tright.len() == 0)\n    {\n\treturn false;\n    }\n\n    if (isalnum (left.mem() [left.len() - 1]) &&\n\tisalnum (right.mem() [0]))\n    {\n\treturn true;\n    }\n\n    return false;\n}\n\nstatic Ref<String>\nwordsToString (MyCpp::List<MConfig_Word*> * const mt_nonnull words)\n{\n    Size str_len = 0;\n    {\n\tConstMemory prv_word;\n\tMyCpp::List<MConfig_Word*>::DataIterator iter (*words);\n\twhile (!iter.done ()) {\n\t    MConfig_Word * const word_ = iter.next();\n\n\t    ConstMemory word = word_->any_token->token;\n\t    \/\/ Stripping quotes from string literals.\n\t    if (word.len() && word.mem() [0] == '\"') {\n\t\tassert (word.len() >= 2);\n\t\tword = word.region (1, word.len() - 2);\n\t    }\n\n\t    str_len += word.len();\n\n\t    if (whitespaceBetweenWordsNeeded (prv_word, word))\n\t\t++str_len;\n\n\t    prv_word = word;\n\t}\n    }\n\n    logD_ (_func, \"str_len: \", str_len);\n\n    Ref<String> str = grab (new String (str_len));\n\n    {\n\tSize pos = 0;\n\tConstMemory prv_word;\n\tMyCpp::List<MConfig_Word*>::DataIterator iter (*words);\n\twhile (!iter.done ()) {\n\t    MConfig_Word * const word_ = iter.next();\n\n\t    ConstMemory word = word_->any_token->token;\n\t    logD_ (_func, \"word: \", word);\n\t    \/\/ Stripping quotes from string literals.\n\t    if (word.len() && word.mem() [0] == '\"') {\n\t\tassert (word.len() >= 2);\n\t\tword = word.region (1, word.len() - 2);\n\t    }\n\n\t    if (whitespaceBetweenWordsNeeded (prv_word, word)) {\n\t\tstr->mem().mem() [pos] = ' ';\n\t\t++pos;\n\t    }\n\n\t    memcpy (str->mem().mem() + pos, word.mem(), word.len());\n\t    pos += word.len();\n\n\t    prv_word = word;\n\t}\n    }\n\n    logD_ (_func, \"str: \", str);\n\n    return str;\n}\n\nstatic Ref<String>\nkeyToString (MConfig_Key * const key)\n{\n    if (!key)\n\treturn grab (new String());\n\n    return wordsToString (&key->words);\n}\n\nbool\nmconfig_begin_section (MConfig_Section       * const section,\n\t\t       Pargen::ParserControl * const \/* parser_control *\/,\n\t\t       void                  * const _self)\n{\n    ConfigParser * const self = static_cast <ConfigParser*> (_self);\n\n    Ref<String> section_name = keyToString (section->name);\n\n    logD_ (_func, \"section: \", section_name);\n\n    Section *opts_section = self->sections.getLast()->getSection (section_name->mem());\n    if (!opts_section) {\n\topts_section = new Section (keyToString (section->name)->mem());\n\tself->sections.getLast()->addSection (opts_section);\n    }\n\n    self->sections.append (opts_section);\n    self->checkpoint_tracker.addUnconditionalCancellable (\n\t    MyCpp::grab (new Scruffy::Cancellable_ListElement<Section*> (\n\t\t    self->sections,\n\t\t    self->sections.last)));\n\n    return true;\n}\n\nbool\nmconfig_accept_option (MConfig_Option         * const option,\n\t\t       Pargen::ParserControl  * const \/* parser_control *\/,\n\t\t       void                   * const _self)\n{\n    ConfigParser * const self = static_cast <ConfigParser*> (_self);\n\n    if (self->sections.isEmpty()) {\n\tlogE_ (_func, \"option not within any section\");\n\treturn false;\n    }\n\n    Section * const section = self->sections.getLast();\n\n    MConfig_Option_KeyValue *option__key_value = NULL;\n\n    MConfig_Key *key_elem = NULL;\n    switch (option->option_type) {\n\tcase MConfig_Option::_KeyValue: {\n\t    option__key_value = static_cast <MConfig_Option_KeyValue*> (option);\n\t    key_elem = option__key_value->key;\n\t} break;\n\tcase MConfig_Option::_Key: {\n\t    MConfig_Option_Key * const option__key = static_cast <MConfig_Option_Key*> (option);\n\t    key_elem = option__key->key;\n\t} break;\n\tdefault:\n\t    unreachable ();\n    }\n\n    Ref<String> key = keyToString (key_elem);\n\n    logD_ (_func, \"option: \", key);\n\n    Option *opts_option = section->getOption (key->mem());\n    if (opts_option) {\n\topts_option->removeValues ();\n    } else {\n\topts_option = new Option (key->mem());\n\tself->sections.getLast()->addOption (opts_option);\n    }\n\n    if (option__key_value) {\n\tMConfig_Value *value = option__key_value->value;\n\tfor (;;) {\n\t    switch (value->value_type) {\n\t\tcase MConfig_Value::_List: {\n\t\t    MConfig_Value_List * const value__list = static_cast <MConfig_Value_List*> (value);\n\t\t    logD_ (_func, \"value: \", wordsToString (&value__list->words));\n\t\t    opts_option->addValue (wordsToString (&value__list->words)->mem());\n\t\t    value = value__list->value;\n\t\t    logD_ (_func, \"new value: 0x\", fmt_hex, (UintPtr) value);\n\t\t} break;\n\t\tcase MConfig_Value::_Word: {\n\t\t    MConfig_Value_Word * const value__word = static_cast <MConfig_Value_Word*> (value);\n\t\t    logD_ (_func, \"value: \", wordsToString (&value__word->words));\n\t\t    opts_option->addValue (wordsToString (&value__word->words)->mem());\n\t\t    value = NULL;\n\t\t} break;\n\t\tdefault:\n\t\t    unreachable ();\n\t    }\n\n\t    if (!value)\n\t\tbreak;\n\t}\n    }\n\n    logD_ (_func, \"done\");\n\n    return true;\n}\n\nResult parseConfig (ConstMemory const &filename,\n\t\t    Config * const config)\ntry {\n    MyCpp::Ref<Pargen::Grammar> grammar = create_mconfig_grammar ();\n\n    MyCpp::Ref<MyCpp::File> file = MyCpp::File::createDefault (filename,\n\t\t\t\t\t\t\t       0 \/* open_flags *\/,\n\t\t\t\t\t\t\t       MyCpp::AccessMode::ReadOnly);\n    file = MyCpp::grab (new MyCpp::CachedFile (file, (1 << 14) \/* page_size *\/, 64 \/* max_pages *\/));\n\n    MyCpp::Ref<Scruffy::CppPreprocessor> const preprocessor = MyCpp::grab (new Scruffy::CppPreprocessor (file));\n    preprocessor->performPreprocessing ();\n\n    MyCpp::Ref< MyCpp::List_< MyCpp::Ref<Scruffy::PpItem>, MyCpp::SimplyReferenced > > pp_items =\n\t    preprocessor->getPpItems ();\n\n    MyCpp::Ref<Scruffy::PpItemStream> pp_stream =\n\t    MyCpp::grab (static_cast <Scruffy::PpItemStream*> (\n\t\t    new Scruffy::ListPpItemStream (pp_items->first, MyLang::FilePosition ())));\n\n    MyCpp::Ref<Scruffy::PpItemStreamTokenStream> token_stream =\n\t    MyCpp::grab (new Scruffy::PpItemStreamTokenStream (pp_stream));\n    token_stream->setNewlineReplacement (\";\");\n\n    ConfigParser config_parser (config);\n\n    Pargen::ParserElement *mconfig_elem = NULL;\n    Pargen::parse (token_stream,\n\t\t   &config_parser.checkpoint_tracker,\n\t\t   &config_parser,\n\t\t   grammar,\n\t\t   &mconfig_elem,\n\t\t   MyCpp::ConstMemoryDesc::forString (\"default\"),\n\t\t   \/\/ TODO Set 'upwards_jumps' to true for non-AST mode.\n\t\t   Pargen::createParserConfig (false \/* upwards_jumps *\/),\n\t\t   false \/* debug_dump *\/);\n\n    if (mconfig_elem == NULL ||\n\ttoken_stream->getNextToken ().getLength () > 0)\n    {\n\tlogE_ (_func, \"EOF not reached\");\n\treturn Result::Failure;\n    }\n\n    dump_mconfig_grammar (static_cast <MConfig_Grammar*> (mconfig_elem));\n    MyCpp::errf->pflush ();\n\n    return Result::Success;\n} catch (...) {\n    logE_ (_func, \"exception\");\n    return Result::Failure;\n}\n\n}\n\n<commit_msg>Allow lists of sections with the same name.<commit_after>\/*  MConfig - C++ library for working with configuration files\n    Copyright (C) 2011 Dmitry Shatrov\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 <libmary\/types.h>\n#include <cctype>\n\n#include <mycpp\/native_file.h>\n#include <mycpp\/cached_file.h>\n\n#include <pargen\/parser.h>\n\n#include <scruffy\/preprocessor.h>\n#include <scruffy\/list_pp_item_stream.h>\n#include <scruffy\/pp_item_stream_token_stream.h>\n#include <scruffy\/checkpoint_tracker.h>\n\n#include <mconfig\/mconfig_pargen.h>\n\n#include <mconfig\/config_parser.h>\n\n\nusing namespace M;\n\nnamespace MConfig {\n\nclass ConfigParser\n{\npublic:\n    MyCpp::List<Section*> sections;\n\n    Scruffy::CheckpointTracker checkpoint_tracker;\n\n    ConfigParser (Config * const config)\n    {\n\tsections.append (config->getRootSection());\n    }\n};\n\n\/\/ Characters banned from words: \" { } , ; # =\n\/\/\n\/\/ \" is used for string literals, which are provided by pargen with quotes\n\/\/ included.\n\/\/\nbool\nmconfig_word_token_match_func (MyCpp::ConstMemoryDesc const &token_mem,\n\t\t\t       void * const \/* token_user_ptr *\/,\n\t\t\t       void * const \/* user_data *\/)\n{\n    logD_ (_func, ConstMemory (token_mem));\n\n    if (token_mem.getLength() == 0)\n\treturn false;\n\n    char const *token = (char const*) token_mem.getMemory();\n    if (token [0] == '{' ||\n\ttoken [0] == '}' ||\n\ttoken [0] == ',' ||\n\ttoken [0] == ';' ||\n\ttoken [0] == '#' ||\n\ttoken [0] == '=')\n    {\n\treturn false;\n    }\n\n    if (token [0] == '\"'\n\t&& (token_mem.getLength() == 1\n\t    || token [token_mem.getLength() - 1] != '\"'))\n    {\n\treturn false;\n    }\n\n    return true;\n}\n\nstatic bool\nwhitespaceBetweenWordsNeeded (ConstMemory const &left,\n\t\t\t      ConstMemory const &right)\n{\n    if (left .len() == 0 ||\n\tright.len() == 0)\n    {\n\treturn false;\n    }\n\n    if (isalnum (left.mem() [left.len() - 1]) &&\n\tisalnum (right.mem() [0]))\n    {\n\treturn true;\n    }\n\n    return false;\n}\n\nstatic Ref<String>\nwordsToString (MyCpp::List<MConfig_Word*> * const mt_nonnull words)\n{\n    Size str_len = 0;\n    {\n\tConstMemory prv_word;\n\tMyCpp::List<MConfig_Word*>::DataIterator iter (*words);\n\twhile (!iter.done ()) {\n\t    MConfig_Word * const word_ = iter.next();\n\n\t    ConstMemory word = word_->any_token->token;\n\t    \/\/ Stripping quotes from string literals.\n\t    if (word.len() && word.mem() [0] == '\"') {\n\t\tassert (word.len() >= 2);\n\t\tword = word.region (1, word.len() - 2);\n\t    }\n\n\t    str_len += word.len();\n\n\t    if (whitespaceBetweenWordsNeeded (prv_word, word))\n\t\t++str_len;\n\n\t    prv_word = word;\n\t}\n    }\n\n    logD_ (_func, \"str_len: \", str_len);\n\n    Ref<String> str = grab (new String (str_len));\n\n    {\n\tSize pos = 0;\n\tConstMemory prv_word;\n\tMyCpp::List<MConfig_Word*>::DataIterator iter (*words);\n\twhile (!iter.done ()) {\n\t    MConfig_Word * const word_ = iter.next();\n\n\t    ConstMemory word = word_->any_token->token;\n\t    logD_ (_func, \"word: \", word);\n\t    \/\/ Stripping quotes from string literals.\n\t    if (word.len() && word.mem() [0] == '\"') {\n\t\tassert (word.len() >= 2);\n\t\tword = word.region (1, word.len() - 2);\n\t    }\n\n\t    if (whitespaceBetweenWordsNeeded (prv_word, word)) {\n\t\tstr->mem().mem() [pos] = ' ';\n\t\t++pos;\n\t    }\n\n\t    memcpy (str->mem().mem() + pos, word.mem(), word.len());\n\t    pos += word.len();\n\n\t    prv_word = word;\n\t}\n    }\n\n    logD_ (_func, \"str: \", str);\n\n    return str;\n}\n\nstatic Ref<String>\nkeyToString (MConfig_Key * const key)\n{\n    if (!key)\n\treturn grab (new String());\n\n    return wordsToString (&key->words);\n}\n\nbool\nmconfig_begin_section (MConfig_Section       * const section,\n\t\t       Pargen::ParserControl * const \/* parser_control *\/,\n\t\t       void                  * const _self)\n{\n    ConfigParser * const self = static_cast <ConfigParser*> (_self);\n\n    Ref<String> section_name = keyToString (section->name);\n\n    logD_ (_func, \"section: \", section_name);\n\n\/\/ Section value replacement was disabled to allow lists of sections\n\/\/ with the same name (for Moment's mod_file).\n\/\/  Section *opts_section = self->sections.getLast()->getSection (section_name->mem());\n    Section *opts_section = NULL;\n    if (!opts_section) {\n\topts_section = new Section (keyToString (section->name)->mem());\n\tself->sections.getLast()->addSection (opts_section);\n    }\n\n    self->sections.append (opts_section);\n    self->checkpoint_tracker.addUnconditionalCancellable (\n\t    MyCpp::grab (new Scruffy::Cancellable_ListElement<Section*> (\n\t\t    self->sections,\n\t\t    self->sections.last)));\n\n    return true;\n}\n\nbool\nmconfig_accept_option (MConfig_Option         * const option,\n\t\t       Pargen::ParserControl  * const \/* parser_control *\/,\n\t\t       void                   * const _self)\n{\n    ConfigParser * const self = static_cast <ConfigParser*> (_self);\n\n    if (self->sections.isEmpty()) {\n\tlogE_ (_func, \"option not within any section\");\n\treturn false;\n    }\n\n    Section * const section = self->sections.getLast();\n\n    MConfig_Option_KeyValue *option__key_value = NULL;\n\n    MConfig_Key *key_elem = NULL;\n    switch (option->option_type) {\n\tcase MConfig_Option::_KeyValue: {\n\t    option__key_value = static_cast <MConfig_Option_KeyValue*> (option);\n\t    key_elem = option__key_value->key;\n\t} break;\n\tcase MConfig_Option::_Key: {\n\t    MConfig_Option_Key * const option__key = static_cast <MConfig_Option_Key*> (option);\n\t    key_elem = option__key->key;\n\t} break;\n\tdefault:\n\t    unreachable ();\n    }\n\n    Ref<String> key = keyToString (key_elem);\n\n    logD_ (_func, \"option: \", key);\n\n    Option *opts_option = section->getOption (key->mem());\n    if (opts_option) {\n\topts_option->removeValues ();\n    } else {\n\topts_option = new Option (key->mem());\n\tself->sections.getLast()->addOption (opts_option);\n    }\n\n    if (option__key_value) {\n\tMConfig_Value *value = option__key_value->value;\n\tfor (;;) {\n\t    switch (value->value_type) {\n\t\tcase MConfig_Value::_List: {\n\t\t    MConfig_Value_List * const value__list = static_cast <MConfig_Value_List*> (value);\n\t\t    logD_ (_func, \"value: \", wordsToString (&value__list->words));\n\t\t    opts_option->addValue (wordsToString (&value__list->words)->mem());\n\t\t    value = value__list->value;\n\t\t    logD_ (_func, \"new value: 0x\", fmt_hex, (UintPtr) value);\n\t\t} break;\n\t\tcase MConfig_Value::_Word: {\n\t\t    MConfig_Value_Word * const value__word = static_cast <MConfig_Value_Word*> (value);\n\t\t    logD_ (_func, \"value: \", wordsToString (&value__word->words));\n\t\t    opts_option->addValue (wordsToString (&value__word->words)->mem());\n\t\t    value = NULL;\n\t\t} break;\n\t\tdefault:\n\t\t    unreachable ();\n\t    }\n\n\t    if (!value)\n\t\tbreak;\n\t}\n    }\n\n    logD_ (_func, \"done\");\n\n    return true;\n}\n\nResult parseConfig (ConstMemory const &filename,\n\t\t    Config * const config)\ntry {\n    MyCpp::Ref<Pargen::Grammar> grammar = create_mconfig_grammar ();\n\n    MyCpp::Ref<MyCpp::File> file = MyCpp::File::createDefault (filename,\n\t\t\t\t\t\t\t       0 \/* open_flags *\/,\n\t\t\t\t\t\t\t       MyCpp::AccessMode::ReadOnly);\n    file = MyCpp::grab (new MyCpp::CachedFile (file, (1 << 14) \/* page_size *\/, 64 \/* max_pages *\/));\n\n    MyCpp::Ref<Scruffy::CppPreprocessor> const preprocessor = MyCpp::grab (new Scruffy::CppPreprocessor (file));\n    preprocessor->performPreprocessing ();\n\n    MyCpp::Ref< MyCpp::List_< MyCpp::Ref<Scruffy::PpItem>, MyCpp::SimplyReferenced > > pp_items =\n\t    preprocessor->getPpItems ();\n\n    MyCpp::Ref<Scruffy::PpItemStream> pp_stream =\n\t    MyCpp::grab (static_cast <Scruffy::PpItemStream*> (\n\t\t    new Scruffy::ListPpItemStream (pp_items->first, MyLang::FilePosition ())));\n\n    MyCpp::Ref<Scruffy::PpItemStreamTokenStream> token_stream =\n\t    MyCpp::grab (new Scruffy::PpItemStreamTokenStream (pp_stream));\n    token_stream->setNewlineReplacement (\";\");\n\n    ConfigParser config_parser (config);\n\n    Pargen::ParserElement *mconfig_elem = NULL;\n    Pargen::parse (token_stream,\n\t\t   &config_parser.checkpoint_tracker,\n\t\t   &config_parser,\n\t\t   grammar,\n\t\t   &mconfig_elem,\n\t\t   MyCpp::ConstMemoryDesc::forString (\"default\"),\n\t\t   \/\/ TODO Set 'upwards_jumps' to true for non-AST mode.\n\t\t   Pargen::createParserConfig (false \/* upwards_jumps *\/),\n\t\t   false \/* debug_dump *\/);\n\n    if (mconfig_elem == NULL ||\n\ttoken_stream->getNextToken ().getLength () > 0)\n    {\n\tlogE_ (_func, \"EOF not reached\");\n\treturn Result::Failure;\n    }\n\n    dump_mconfig_grammar (static_cast <MConfig_Grammar*> (mconfig_elem));\n    MyCpp::errf->pflush ();\n\n    return Result::Success;\n} catch (...) {\n    logE_ (_func, \"exception\");\n    return Result::Failure;\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: shutdown_quickstart.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 16:34: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#include \"quickstarter.hxx\"\n#include <setup_native\/qswin32.h>\n\nstatic BOOL CALLBACK EnumWindowsProc( HWND hWnd, LPARAM lParam )\n{\n    MSIHANDLE   hMSI = static_cast< MSIHANDLE >( lParam );\n    CHAR    szClassName[sizeof(QUICKSTART_CLASSNAMEA) + 1];\n\n    int nCharsCopied = GetClassName( hWnd, szClassName, sizeof( szClassName ) );\n\n    if ( nCharsCopied && !stricmp( QUICKSTART_CLASSNAMEA, szClassName ) )\n    {\n        DWORD   dwProcessId;\n\n        if ( GetWindowThreadProcessId( hWnd, &dwProcessId ) )\n        {\n            std::string sImagePath = GetProcessImagePath( dwProcessId );\n            std::string sOfficeImageDir = GetOfficeInstallationPath( hMSI ) + \"program\\\\\";\n\n            if ( !strnicmp( sImagePath.c_str(), sOfficeImageDir.c_str(), sOfficeImageDir.length() ) )\n            {\n                UINT    uMsgShutdownQuickstart = RegisterWindowMessageA( SHUTDOWN_QUICKSTART_MESSAGEA );\n\n                if ( uMsgShutdownQuickstart )\n                    SendMessageA( hWnd, uMsgShutdownQuickstart, 0, 0 );\n\n                return FALSE;\n            }\n\n        }\n    }\n\n    return TRUE;\n}\n\n\nextern \"C\" UINT __stdcall ShutDownQuickstarter( MSIHANDLE hMSI )\n{\n    EnumWindows( EnumWindowsProc, hMSI );\n\n    return ERROR_SUCCESS;\n}\n\n<commit_msg>INTEGRATION: CWS qssyncterm (1.4.180); FILE MERGED 2007\/08\/02 14:08:25 hro 1.4.180.1: #149979# Wait at most 30 seconds to give Quickstarter enough time to terminate before setup continues<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: shutdown_quickstart.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: ihi $ $Date: 2007-08-17 13:35:41 $\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 \"quickstarter.hxx\"\n#include <setup_native\/qswin32.h>\n\nstatic BOOL CALLBACK EnumWindowsProc( HWND hWnd, LPARAM lParam )\n{\n    MSIHANDLE   hMSI = static_cast< MSIHANDLE >( lParam );\n    CHAR    szClassName[sizeof(QUICKSTART_CLASSNAMEA) + 1];\n\n    int nCharsCopied = GetClassName( hWnd, szClassName, sizeof( szClassName ) );\n\n    if ( nCharsCopied && !stricmp( QUICKSTART_CLASSNAMEA, szClassName ) )\n    {\n        DWORD   dwProcessId;\n\n        if ( GetWindowThreadProcessId( hWnd, &dwProcessId ) )\n        {\n            std::string sImagePath = GetProcessImagePath( dwProcessId );\n            std::string sOfficeImageDir = GetOfficeInstallationPath( hMSI ) + \"program\\\\\";\n\n            if ( !strnicmp( sImagePath.c_str(), sOfficeImageDir.c_str(), sOfficeImageDir.length() ) )\n            {\n                UINT    uMsgShutdownQuickstart = RegisterWindowMessageA( SHUTDOWN_QUICKSTART_MESSAGEA );\n\n                if ( uMsgShutdownQuickstart )\n                    SendMessageA( hWnd, uMsgShutdownQuickstart, 0, 0 );\n\n\n                HANDLE  hProcess = OpenProcess( SYNCHRONIZE, FALSE, dwProcessId );\n\n                if ( hProcess )\n                {\n                    WaitForSingleObject( hProcess, 30000 ); \/\/ Wait at most 30 seconds for process to terminate\n                    CloseHandle( hProcess );\n                }\n\n                return FALSE;\n            }\n\n        }\n    }\n\n    return TRUE;\n}\n\n\nextern \"C\" UINT __stdcall ShutDownQuickstarter( MSIHANDLE hMSI )\n{\n    EnumWindows( EnumWindowsProc, hMSI );\n\n    return ERROR_SUCCESS;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/eve:$Id$\n\/\/ Author: Matevz Tadel\n\n\/\/ Demonstrates usage of class TEvePointSet.\n\n#ifndef __CINT__\n\n#include <TEveManager.h>\n#include <TEvePointSet.h>\n#include <TEveRGBAPalette.h>\n#include <TColor.h>\n#include <TRandom.h>\n\n#endif\n\nTEvePointSet* pointset(Int_t npoints = 512, TEveElement* parent=0)\n{\n   TEveManager::Create();\n\n   if (!gRandom)\n      gRandom = new TRandom(0);\n   TRandom& r= *gRandom;\n\n   Float_t s = 100;\n\n   TEvePointSet* ps = new TEvePointSet();\n   ps->SetOwnIds(kTRUE);\n\n   for(Int_t i = 0; i<npoints; i++)\n   {\n      ps->SetNextPoint(r.Uniform(-s,s), r.Uniform(-s,s), r.Uniform(-s,s));\n      ps->SetPointId(new TNamed(Form(\"Point %d\", i), \"\"));\n   }\n\n   ps->SetMarkerColor(TMath::Nint(r.Uniform(2, 9)));\n   ps->SetMarkerSize(r.Uniform(1, 2));\n   ps->SetMarkerStyle(4);\n\n   if (parent)\n   {\n      parent->AddElement(ps);\n   }\n   else\n   {\n      gEve->AddElement(ps);\n      gEve->Redraw3D();\n   }\n\n   return ps;\n}\n\nTEvePointSet*\npointset_hierarchy(Int_t level=3, Int_t nps=1, Int_t fac=2,\n                        Int_t npoints=512, TEveElement* parent=0)\n{\n   \/\/ This only works in compiled mode!\n\n   TEvePointSet* ps = 0;\n   --level;\n   for (Int_t i=0; i<nps; ++i)\n   {\n      printf(\"level=%d nps=%d i=%d\\n\", level, nps, i);\n      ps = pointset(npoints, parent);\n      if (level)\n      {\n         pointset_hierarchy(level, nps*fac, fac, npoints\/fac, ps);\n      }\n   }\n   return ps;\n}\n\nTEvePointSetArray* pointsetarray()\n{\n   TEveManager::Create();\n\n   TRandom r(0);\n\n   TEvePointSetArray* l = new TEvePointSetArray(\"TPC hits - Charge Slices\", \"\");\n   l->SetSourceCS(TEvePointSelectorConsumer::kTVT_RPhiZ);\n   l->SetMarkerColor(3);\n   l->SetMarkerStyle(4); \/\/ antialiased circle\n   l->SetMarkerSize(0.8);\n\n   gEve->AddElement(l);\n   l->InitBins(\"Charge\", 9, 10, 100);\n\n   TColor::SetPalette(1, 0); \/\/ Spectrum palette\n   const Int_t nCol = TColor::GetNumberOfColors();\n   for (Int_t i = 1; i <= 9; ++i)\n      l->GetBin(i)->SetMainColor(TColor::GetColorPalette(i * nCol \/ 10));\n\n   l->GetBin(0) ->SetMainColor(kGray);\n   l->GetBin(10)->SetMainColor(kWhite);\n\n   Double_t rad, phi, z;\n   for (Int_t i = 0; i < 10000; ++i)\n   {\n      rad = r.Uniform(60, 180);\n      phi = r.Uniform(0, TMath::TwoPi());\n      z   = r.Uniform(-250, 250);\n      l->Fill(rad*TMath::Cos(phi), rad*TMath::Sin(phi), z,\n              r.Uniform(0, 110));\n   }\n\n   l->CloseBins();\n\n   gEve->Redraw3D();\n\n   return l;\n}\n<commit_msg>Add missing include for running with aclic.<commit_after>\/\/ @(#)root\/eve:$Id$\n\/\/ Author: Matevz Tadel\n\n\/\/ Demonstrates usage of class TEvePointSet.\n\n#ifndef __CINT__\n\n#include <TEveManager.h>\n#include <TEvePointSet.h>\n#include <TEveRGBAPalette.h>\n#include <TColor.h>\n#include <TRandom.h>\n#include <TMath.h>\n\n#endif\n\nTEvePointSet* pointset(Int_t npoints = 512, TEveElement* parent=0)\n{\n   TEveManager::Create();\n\n   if (!gRandom)\n      gRandom = new TRandom(0);\n   TRandom& r= *gRandom;\n\n   Float_t s = 100;\n\n   TEvePointSet* ps = new TEvePointSet();\n   ps->SetOwnIds(kTRUE);\n\n   for(Int_t i = 0; i<npoints; i++)\n   {\n      ps->SetNextPoint(r.Uniform(-s,s), r.Uniform(-s,s), r.Uniform(-s,s));\n      ps->SetPointId(new TNamed(Form(\"Point %d\", i), \"\"));\n   }\n\n   ps->SetMarkerColor(TMath::Nint(r.Uniform(2, 9)));\n   ps->SetMarkerSize(r.Uniform(1, 2));\n   ps->SetMarkerStyle(4);\n\n   if (parent)\n   {\n      parent->AddElement(ps);\n   }\n   else\n   {\n      gEve->AddElement(ps);\n      gEve->Redraw3D();\n   }\n\n   return ps;\n}\n\nTEvePointSet*\npointset_hierarchy(Int_t level=3, Int_t nps=1, Int_t fac=2,\n                        Int_t npoints=512, TEveElement* parent=0)\n{\n   \/\/ This only works in compiled mode!\n\n   TEvePointSet* ps = 0;\n   --level;\n   for (Int_t i=0; i<nps; ++i)\n   {\n      printf(\"level=%d nps=%d i=%d\\n\", level, nps, i);\n      ps = pointset(npoints, parent);\n      if (level)\n      {\n         pointset_hierarchy(level, nps*fac, fac, npoints\/fac, ps);\n      }\n   }\n   return ps;\n}\n\nTEvePointSetArray* pointsetarray()\n{\n   TEveManager::Create();\n\n   TRandom r(0);\n\n   TEvePointSetArray* l = new TEvePointSetArray(\"TPC hits - Charge Slices\", \"\");\n   l->SetSourceCS(TEvePointSelectorConsumer::kTVT_RPhiZ);\n   l->SetMarkerColor(3);\n   l->SetMarkerStyle(4); \/\/ antialiased circle\n   l->SetMarkerSize(0.8);\n\n   gEve->AddElement(l);\n   l->InitBins(\"Charge\", 9, 10, 100);\n\n   TColor::SetPalette(1, 0); \/\/ Spectrum palette\n   const Int_t nCol = TColor::GetNumberOfColors();\n   for (Int_t i = 1; i <= 9; ++i)\n      l->GetBin(i)->SetMainColor(TColor::GetColorPalette(i * nCol \/ 10));\n\n   l->GetBin(0) ->SetMainColor(kGray);\n   l->GetBin(10)->SetMainColor(kWhite);\n\n   Double_t rad, phi, z;\n   for (Int_t i = 0; i < 10000; ++i)\n   {\n      rad = r.Uniform(60, 180);\n      phi = r.Uniform(0, TMath::TwoPi());\n      z   = r.Uniform(-250, 250);\n      l->Fill(rad*TMath::Cos(phi), rad*TMath::Sin(phi), z,\n              r.Uniform(0, 110));\n   }\n\n   l->CloseBins();\n\n   gEve->Redraw3D();\n\n   return l;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- AMDGPUAlwaysInlinePass.cpp - Promote Allocas ----------------------===\/\/\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\/\/\/ \\file\n\/\/\/ This pass marks all internal functions as always_inline and creates\n\/\/\/ duplicates of all other functions a marks the duplicates as always_inline.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"AMDGPU.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Transforms\/Utils\/Cloning.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nclass AMDGPUAlwaysInline : public ModulePass {\n  bool GlobalOpt;\n\npublic:\n  static char ID;\n\n  AMDGPUAlwaysInline(bool GlobalOpt = false) :\n    ModulePass(ID), GlobalOpt(GlobalOpt) { }\n  bool runOnModule(Module &M) override;\n  StringRef getPassName() const override { return \"AMDGPU Always Inline Pass\"; }\n};\n\n} \/\/ End anonymous namespace\n\nINITIALIZE_PASS(AMDGPUAlwaysInline, \"amdgpu-always-inline\",\n                \"AMDGPU Inline All Functions\", false, false)\n\nchar AMDGPUAlwaysInline::ID = 0;\n\nbool AMDGPUAlwaysInline::runOnModule(Module &M) {\n  std::vector<GlobalAlias*> AliasesToRemove;\n  std::vector<Function *> FuncsToClone;\n\n  for (GlobalAlias &A : M.aliases()) {\n    if (Function* F = dyn_cast<Function>(A.getAliasee())) {\n      A.replaceAllUsesWith(F);\n      AliasesToRemove.push_back(&A);\n    }\n  }\n\n  if (GlobalOpt) {\n    for (GlobalAlias* A : AliasesToRemove) {\n      A->eraseFromParent();\n    }\n  }\n\n  for (Function &F : M) {\n    if (!F.hasLocalLinkage() && !F.isDeclaration() && !F.use_empty() &&\n        !F.hasFnAttribute(Attribute::NoInline))\n      FuncsToClone.push_back(&F);\n  }\n\n  for (Function *F : FuncsToClone) {\n    ValueToValueMapTy VMap;\n    Function *NewFunc = CloneFunction(F, VMap);\n    NewFunc->setLinkage(GlobalValue::InternalLinkage);\n    F->replaceAllUsesWith(NewFunc);\n  }\n\n  for (Function &F : M) {\n    if (F.hasLocalLinkage() && !F.hasFnAttribute(Attribute::NoInline)) {\n      F.addFnAttr(Attribute::AlwaysInline);\n    }\n  }\n  return false;\n}\n\nModulePass *llvm::createAMDGPUAlwaysInlinePass(bool GlobalOpt) {\n  return new AMDGPUAlwaysInline(GlobalOpt);\n}\n<commit_msg>    [AMDGPU] Testing commit access only, no real change<commit_after>\/\/===-- AMDGPUAlwaysInlinePass.cpp - Promote Allocas ----------------------===\/\/\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\/\/\/ \\file\n\/\/\/ This pass marks all internal functions as always_inline and creates\n\/\/\/ duplicates of all other functions and marks the duplicates as always_inline.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"AMDGPU.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Transforms\/Utils\/Cloning.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nclass AMDGPUAlwaysInline : public ModulePass {\n  bool GlobalOpt;\n\npublic:\n  static char ID;\n\n  AMDGPUAlwaysInline(bool GlobalOpt = false) :\n    ModulePass(ID), GlobalOpt(GlobalOpt) { }\n  bool runOnModule(Module &M) override;\n  StringRef getPassName() const override { return \"AMDGPU Always Inline Pass\"; }\n};\n\n} \/\/ End anonymous namespace\n\nINITIALIZE_PASS(AMDGPUAlwaysInline, \"amdgpu-always-inline\",\n                \"AMDGPU Inline All Functions\", false, false)\n\nchar AMDGPUAlwaysInline::ID = 0;\n\nbool AMDGPUAlwaysInline::runOnModule(Module &M) {\n  std::vector<GlobalAlias*> AliasesToRemove;\n  std::vector<Function *> FuncsToClone;\n\n  for (GlobalAlias &A : M.aliases()) {\n    if (Function* F = dyn_cast<Function>(A.getAliasee())) {\n      A.replaceAllUsesWith(F);\n      AliasesToRemove.push_back(&A);\n    }\n  }\n\n  if (GlobalOpt) {\n    for (GlobalAlias* A : AliasesToRemove) {\n      A->eraseFromParent();\n    }\n  }\n\n  for (Function &F : M) {\n    if (!F.hasLocalLinkage() && !F.isDeclaration() && !F.use_empty() &&\n        !F.hasFnAttribute(Attribute::NoInline))\n      FuncsToClone.push_back(&F);\n  }\n\n  for (Function *F : FuncsToClone) {\n    ValueToValueMapTy VMap;\n    Function *NewFunc = CloneFunction(F, VMap);\n    NewFunc->setLinkage(GlobalValue::InternalLinkage);\n    F->replaceAllUsesWith(NewFunc);\n  }\n\n  for (Function &F : M) {\n    if (F.hasLocalLinkage() && !F.hasFnAttribute(Attribute::NoInline)) {\n      F.addFnAttr(Attribute::AlwaysInline);\n    }\n  }\n  return false;\n}\n\nModulePass *llvm::createAMDGPUAlwaysInlinePass(bool GlobalOpt) {\n  return new AMDGPUAlwaysInline(GlobalOpt);\n}\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\/roudi_environment\/roudi_environment.hpp\"\n#include \"iceoryx_posh\/runtime\/posh_runtime.hpp\"\n#include \"test.hpp\"\n\nusing namespace ::testing;\nusing namespace iox::runtime;\nusing iox::roudi::RouDiEnvironment;\n\nclass PoshRuntime_test : public Test\n{\n  public:\n    PoshRuntime_test()\n    {\n    }\n\n    virtual ~PoshRuntime_test()\n    {\n    }\n\n    virtual void SetUp(){};\n    virtual void TearDown(){};\n\n    void InterOpWait()\n    {\n        std::this_thread::sleep_for(std::chrono::milliseconds(200));\n    }\n\n    RouDiEnvironment m_roudiEnv{iox::RouDiConfig_t().setDefaults()};\n    const std::string m_appName = \"\/sender\";\n    iox::runtime::PoshRuntime* m_senderRuntime{&iox::runtime::PoshRuntime::getInstance(\"\/sender\")};\n    iox::runtime::PoshRuntime* m_receiverRuntime{&iox::runtime::PoshRuntime::getInstance(\"\/receiver\")};\n    iox::runtime::MqMessage m_sendBuffer;\n    iox::runtime::MqMessage m_receiveBuffer;\n    const iox::cxx::CString100& m_runnableName = iox::cxx::CString100(\"testRunnable\");\n    const iox::cxx::CString100& m_invalidRunnableName = iox::cxx::CString100(\"invalidRunnable,\");\n};\n\n\nTEST_F(PoshRuntime_test, SendMessageToRouDi)\n{\n    m_sendBuffer << mqMessageTypeToString(MqMessageType::IMPL_INTERFACE) << m_appName\n                 << static_cast<uint32_t>(iox::capro::Interfaces::INTERNAL) << m_runnableName;\n\n    auto status = m_senderRuntime->sendMessageToRouDi(m_sendBuffer);\n\n    EXPECT_EQ(true, status);\n}\n\n\nTEST_F(PoshRuntime_test, SendMessageToRouDiInvalidMessage)\n{\n    m_sendBuffer << mqMessageTypeToString(MqMessageType::IMPL_INTERFACE) << std::string()\n                 << static_cast<uint32_t>(iox::capro::Interfaces::INTERNAL) << m_invalidRunnableName;\n\n    auto status = m_senderRuntime->sendMessageToRouDi(m_sendBuffer);\n\n    EXPECT_EQ(false, status);\n}\n\n\nTEST_F(PoshRuntime_test, SendMessageToRouDiEmptyMessage)\n{\n    auto status = m_senderRuntime->sendMessageToRouDi(m_sendBuffer);\n\n    EXPECT_EQ(true, status);\n}\n\n\nTEST_F(PoshRuntime_test, SendRequestToRouDi)\n{\n    m_sendBuffer << mqMessageTypeToString(MqMessageType::IMPL_INTERFACE) << m_appName\n                 << static_cast<uint32_t>(iox::capro::Interfaces::INTERNAL) << m_runnableName;\n\n    auto status = m_senderRuntime->sendRequestToRouDi(m_sendBuffer, m_receiveBuffer);\n\n    EXPECT_EQ(true, status);\n}\n\n\nTEST_F(PoshRuntime_test, SendRequestToRouDiInvalidMessage)\n{\n    m_sendBuffer << mqMessageTypeToString(MqMessageType::IMPL_INTERFACE) << m_appName\n                 << static_cast<uint32_t>(iox::capro::Interfaces::INTERNAL) << m_invalidRunnableName;\n\n    auto status = m_senderRuntime->sendRequestToRouDi(m_sendBuffer, m_receiveBuffer);\n\n    EXPECT_EQ(false, status);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareSender)\n{\n    iox::capro::ServiceDescription serviceDescription{99, 1, 20};\n    iox::runtime::PortConfigInfo portConfg(11, 22, 33);\n\n    auto senderPort = m_senderRuntime->getMiddlewareSender(serviceDescription, m_runnableName, portConfg);\n\n    EXPECT_EQ(99, senderPort->m_serviceDescription.getServiceID());\n    EXPECT_EQ(1, senderPort->m_serviceDescription.getEventID());\n    EXPECT_EQ(20, senderPort->m_serviceDescription.getInstanceID());\n    EXPECT_EQ(22, senderPort->m_memoryInfo.deviceId);\n    EXPECT_EQ(33, senderPort->m_memoryInfo.memoryType);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareSenderDefaultArgs)\n{\n    iox::capro::ServiceDescription serviceDescription{99, 1, 20};\n\n    auto senderPort = m_senderRuntime->getMiddlewareSender(serviceDescription);\n\n    EXPECT_EQ(0, senderPort->m_memoryInfo.deviceId);\n    EXPECT_EQ(0, senderPort->m_memoryInfo.memoryType);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareReceiver)\n{\n    iox::capro::ServiceDescription serviceDescription{99, 1, 20};\n    iox::runtime::PortConfigInfo portConfg(11, 22, 33);\n\n    auto receiverPort = m_receiverRuntime->getMiddlewareReceiver(serviceDescription, m_runnableName, portConfg);\n\n    EXPECT_EQ(99, receiverPort->m_serviceDescription.getServiceID());\n    EXPECT_EQ(1, receiverPort->m_serviceDescription.getEventID());\n    EXPECT_EQ(20, receiverPort->m_serviceDescription.getInstanceID());\n    EXPECT_EQ(22, receiverPort->m_memoryInfo.deviceId);\n    EXPECT_EQ(33, receiverPort->m_memoryInfo.memoryType);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareReceiverDefaultArgs)\n{\n    iox::capro::ServiceDescription serviceDescription{99, 1, 20};\n\n    auto receiverPort = m_receiverRuntime->getMiddlewareReceiver(serviceDescription);\n\n    EXPECT_EQ(0, receiverPort->m_memoryInfo.deviceId);\n    EXPECT_EQ(0, receiverPort->m_memoryInfo.memoryType);\n}\n\n\nTEST_F(PoshRuntime_test, CreateRunnable)\n{\n    uint64_t runnableDeviceIdentifier = 0u;\n    iox::runtime::RunnableProperty runnableProperty(iox::cxx::CString100(\"testRunnable\"), runnableDeviceIdentifier);\n\n    auto runableData = m_senderRuntime->createRunnable(runnableProperty);\n\n    EXPECT_EQ(runnableDeviceIdentifier, runableData->m_runnableDeviceIdentifier);\n    EXPECT_EQ(m_appName, runableData->m_process);\n    EXPECT_EQ(iox::cxx::CString100(\"testRunnable\"), runableData->m_runnable);\n}\n<commit_msg>iox-#177 added unit testcases for posh_runtime<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\/roudi_environment\/roudi_environment.hpp\"\n#include \"iceoryx_posh\/runtime\/posh_runtime.hpp\"\n#include \"test.hpp\"\n\nusing namespace ::testing;\nusing namespace iox::runtime;\nusing iox::roudi::RouDiEnvironment;\n\nclass PoshRuntime_test : public Test\n{\n  public:\n    PoshRuntime_test()\n    {\n    }\n\n    virtual ~PoshRuntime_test()\n    {\n    }\n\n    virtual void SetUp(){};\n    virtual void TearDown(){};\n\n    void InterOpWait()\n    {\n        std::this_thread::sleep_for(std::chrono::milliseconds(200));\n    }\n\n    RouDiEnvironment m_roudiEnv{iox::RouDiConfig_t().setDefaults()};\n    const std::string m_appName = \"\/sender\";\n    PoshRuntime* m_receiverRuntime{&iox::runtime::PoshRuntime::getInstance(\"\/receiver\")};\n    PoshRuntime* m_senderRuntime{&iox::runtime::PoshRuntime::getInstance(\"\/sender\")};\n    MqMessage m_sendBuffer;\n    MqMessage m_receiveBuffer;\n    const iox::cxx::CString100 m_runnableName = iox::cxx::CString100(\"testRunnable\");\n    const iox::cxx::CString100 m_invalidRunnableName = iox::cxx::CString100(\"invalidRunnable,\");\n};\n\n\nTEST_F(PoshRuntime_test, SendMessageToRouDi)\n{\n    m_sendBuffer << mqMessageTypeToString(MqMessageType::IMPL_INTERFACE) << m_appName\n                 << static_cast<uint32_t>(iox::capro::Interfaces::INTERNAL) << m_runnableName;\n\n    auto status = m_senderRuntime->sendMessageToRouDi(m_sendBuffer);\n\n    EXPECT_EQ(true, status);\n}\n\n\nTEST_F(PoshRuntime_test, SendMessageToRouDiInvalidMessage)\n{\n    m_sendBuffer << mqMessageTypeToString(MqMessageType::IMPL_INTERFACE) << std::string()\n                 << static_cast<uint32_t>(iox::capro::Interfaces::INTERNAL) << m_invalidRunnableName;\n\n    auto status = m_senderRuntime->sendMessageToRouDi(m_sendBuffer);\n\n    EXPECT_EQ(false, status);\n}\n\n\nTEST_F(PoshRuntime_test, SendMessageToRouDiEmptyMessage)\n{\n    const auto status = m_senderRuntime->sendMessageToRouDi(m_sendBuffer);\n\n    EXPECT_EQ(true, status);\n}\n\n\nTEST_F(PoshRuntime_test, SendRequestToRouDi)\n{\n    m_sendBuffer << mqMessageTypeToString(MqMessageType::IMPL_INTERFACE) << m_appName\n                 << static_cast<uint32_t>(iox::capro::Interfaces::INTERNAL) << m_runnableName;\n\n    const auto status = m_senderRuntime->sendRequestToRouDi(m_sendBuffer, m_receiveBuffer);\n\n    EXPECT_EQ(true, status);\n}\n\n\nTEST_F(PoshRuntime_test, SendRequestToRouDiInvalidMessage)\n{\n    m_sendBuffer << mqMessageTypeToString(MqMessageType::IMPL_INTERFACE) << m_appName\n                 << static_cast<uint32_t>(iox::capro::Interfaces::INTERNAL) << m_invalidRunnableName;\n\n    const auto status = m_senderRuntime->sendRequestToRouDi(m_sendBuffer, m_receiveBuffer);\n\n    EXPECT_EQ(false, status);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareSender)\n{\n    iox::capro::ServiceDescription serviceDescription{99, 1, 20};\n    iox::runtime::PortConfigInfo portConfg(11, 22, 33);\n\n    auto senderPort = m_senderRuntime->getMiddlewareSender(serviceDescription, m_runnableName, portConfg);\n\n    EXPECT_EQ(99, senderPort->m_serviceDescription.getServiceID());\n    EXPECT_EQ(1, senderPort->m_serviceDescription.getEventID());\n    EXPECT_EQ(20, senderPort->m_serviceDescription.getInstanceID());\n    EXPECT_EQ(22, senderPort->m_memoryInfo.deviceId);\n    EXPECT_EQ(33, senderPort->m_memoryInfo.memoryType);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareSenderDefaultArgs)\n{\n    iox::capro::ServiceDescription serviceDescription{99, 1, 20};\n\n    auto senderPort = m_senderRuntime->getMiddlewareSender(serviceDescription);\n\n    EXPECT_EQ(0, senderPort->m_memoryInfo.deviceId);\n    EXPECT_EQ(0, senderPort->m_memoryInfo.memoryType);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareReceiver)\n{\n    iox::capro::ServiceDescription serviceDescription{99, 1, 20};\n    iox::runtime::PortConfigInfo portConfg(11, 22, 33);\n\n    auto receiverPort = m_receiverRuntime->getMiddlewareReceiver(serviceDescription, m_runnableName, portConfg);\n\n    EXPECT_EQ(99, receiverPort->m_serviceDescription.getServiceID());\n    EXPECT_EQ(1, receiverPort->m_serviceDescription.getEventID());\n    EXPECT_EQ(20, receiverPort->m_serviceDescription.getInstanceID());\n    EXPECT_EQ(22, receiverPort->m_memoryInfo.deviceId);\n    EXPECT_EQ(33, receiverPort->m_memoryInfo.memoryType);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareReceiverDefaultArgs)\n{\n    iox::capro::ServiceDescription serviceDescription{99, 1, 20};\n\n    auto receiverPort = m_receiverRuntime->getMiddlewareReceiver(serviceDescription);\n\n    EXPECT_EQ(0, receiverPort->m_memoryInfo.deviceId);\n    EXPECT_EQ(0, receiverPort->m_memoryInfo.memoryType);\n}\n\n\nTEST_F(PoshRuntime_test, GetServiceRegistryChangeCounter)\n{\n    const uint64_t runnableDeviceIdentifier = 0u;\n    iox::runtime::RunnableProperty runnableProperty(iox::cxx::CString100(\"testRunnable\"), runnableDeviceIdentifier);\n\n    auto runnableData = m_senderRuntime->getServiceRegistryChangeCounter();\n\n    \/\/ Roudi internally will call 5 servieces\n    EXPECT_EQ(5, *runnableData);\n}\n\n\nTEST_F(PoshRuntime_test, GetServiceRegistryChangeCounter_OfferStopOfferService)\n{\n    const uint64_t runnableDeviceIdentifier = 0u;\n    iox::runtime::RunnableProperty runnableProperty(iox::cxx::CString100(\"testRunnable\"), runnableDeviceIdentifier);\n\n    m_senderRuntime->offerService({\"service1\", \"instance1\"});\n    this->InterOpWait();\n    auto runnableData = m_senderRuntime->getServiceRegistryChangeCounter();\n\n    EXPECT_EQ(6, *runnableData);\n\n    m_senderRuntime->stopOfferService({\"service1\", \"instance1\"});\n    this->InterOpWait();\n\n    EXPECT_EQ(7, *runnableData);\n}\n\n\nTEST_F(PoshRuntime_test, GetMiddlewareSender_SenderlistOverflow)\n{\n    std::vector<iox::popo::SenderPort::MemberType_t*> senderPorts;\n    iox::runtime::PoshRuntime* senderRuntime{&iox::runtime::PoshRuntime::getInstance(\"\/sender\")};\n\n\n    auto errorHandlerCalled{false};\n    auto errorHandlerGuard = iox::ErrorHandler::SetTemporaryErrorHandler(\n        [&errorHandlerCalled](const iox::Error, const std::function<void()>, const iox::ErrorLevel) {\n            errorHandlerCalled = true;\n        });\n\n    for (uint64_t i = 0; i < iox::MAX_PORT_NUMBER; ++i)\n    {\n        const auto senderPortData = senderRuntime->getMiddlewareSender(iox::capro::ServiceDescription(i, i + 1, i + 2));\n        senderPorts.push_back(senderPortData);\n    }\n\n    EXPECT_TRUE(errorHandlerCalled);\n}\n\n\nTEST_F(PoshRuntime_test, CreateRunnable)\n{\n    const uint64_t runnableDeviceIdentifier = 11u;\n    iox::runtime::RunnableProperty runnableProperty(iox::cxx::CString100(\"testRunnable\"), runnableDeviceIdentifier);\n\n    auto runableData = m_senderRuntime->createRunnable(runnableProperty);\n\n    EXPECT_EQ(runnableDeviceIdentifier, runableData->m_runnableDeviceIdentifier);\n    EXPECT_EQ(m_appName, runableData->m_process);\n    EXPECT_EQ(iox::cxx::CString100(\"testRunnable\"), runableData->m_runnable);\n}\n\n\nTEST_F(PoshRuntime_test, ApplicationPort)\n{\n    m_senderRuntime->offerService({\"service1\", \"instance1\"});\n    this->InterOpWait();\n    auto applicationPortData = m_receiverRuntime->getMiddlewareApplication();\n    iox::popo::ApplicationPort applicationPort(applicationPortData);\n    iox::capro::CaproMessage caproMessage;\n    this->InterOpWait();\n\n    bool serviceFound = false;\n    while (applicationPort.getCaProMessage(caproMessage))\n    {\n        if ((caproMessage.m_serviceDescription.getServiceIDString() == IdString(\"service1\"))\n            && (caproMessage.m_serviceDescription.getInstanceIDString() == IdString(\"instance1\"))\n            && ((caproMessage.m_serviceDescription.getEventIDString() == IdString(iox::capro::AnyEventString))))\n        {\n            serviceFound = true;\n            break;\n        }\n    }\n\n    EXPECT_THAT(serviceFound, Eq(true));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: objshimp.hxx,v $\n *\n *  $Revision: 1.23 $\n *\n *  last change: $Author: rt $ $Date: 2005-01-11 13:32: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#ifndef _SFX_OBJSHIMP_HXX\n#define _SFX_OBJSHIMP_HXX\n\n\/\/#include <hash_map>\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n#ifndef _DATETIME_HXX\n#include <tools\/datetime.hxx>\n#endif\n\n#include <svtools\/securityoptions.hxx>\n#include \"objsh.hxx\"\n#include \"bitset.hxx\"\n\nnamespace svtools { class AsynchronLink; }\n\n\/\/====================================================================\n\nDBG_NAMEEX(SfxObjectShell);\n\nclass SfxViewFrame;\nstruct MarkData_Impl\n{\n    String aMark;\n    String aUserData;\n    SfxViewFrame* pFrame;\n};\n\nclass SfxFrame;\nclass SfxDialogLibraryContainer;\nclass SfxScriptLibraryContainer;\nclass SfxToolBoxConfig;\nclass SfxAcceleratorManager;\nstruct SfxObjectShell_Impl\n{\n    ::comphelper::EmbeddedObjectContainer* mpObjectContainer;\n    SfxAcceleratorManager*  pAccMgr;\n    SfxDocumentInfo*    pDocInfo;\n    SfxConfigManager*   pCfgMgr;\n    BasicManager*       pBasicMgr;          \/\/ Doc-BASIC oder 0\n    SfxScriptLibraryContainer* pBasicLibContainer;\n    SfxDialogLibraryContainer* pDialogLibContainer;\n    SfxProgress*        pProgress;\n    String              aTitle;\n    String              aTempName;\n    DateTime            nTime;\n    sal_uInt16          nVisualDocumentNumber;\n    sal_Int16           nDocumentSignatureState;\n    sal_Int16           nScriptingSignatureState;\n    sal_Bool            bTemplateConfig:1,\n                        bInList:1,          \/\/ ob per First\/Next erreichbar\n                        bClosing:1,         \/\/ sal_True w\"aehrend Close(), um Benachrichtigungs-Rekursionen zu verhindern\n                        bSetInPlaceObj:1,   \/\/ sal_True, falls bereits versucht wurde pInPlaceObject zu casten\n                        bIsSaving:1,\n                        bPasswd:1,\n                        bIsTmp:1,\n                        bIsNamedVisible:1,\n                        bIsTemplate:1,\n                        bIsAbortingImport:1,  \/\/ Importvorgang soll abgebrochen werden.\n                        bImportDone : 1, \/\/Import schon fertig? Fuer AutoReload von Docs.\n                        bInPrepareClose : 1,\n                        bPreparedForClose : 1,\n                        bWaitingForPicklist : 1,\/\/ Muss noch in die Pickliste\n                        bModuleSearched : 1,\n                        bIsBasicDefault : 1,\n                        bIsHelpObjSh : 1,\n                        bForbidCaching : 1,\n                        bForbidReload : 1,\n                        bSupportsEventMacros: 1,\n                        bLoadingWindows: 1,\n                        bBasicInitialized :1,\n                        bHidden :1, \/\/ indicates a hidden view shell\n                        bIsPrintJobCancelable :1, \/\/ Stampit disable\/enable cancel button for print jobs ... default = true = enable!\n                        bOwnsStorage:1,\n                        bNoBaseURL:1;\n\n    String              aNewName;  \/\/ Der Name, unter dem das Doc gespeichert\n                                   \/\/ werden soll\n    IndexBitSet         aBitSet;\n    sal_uInt32               lErr;\n    sal_uInt16              nEventId;           \/\/ falls vor Activate noch ein\n                                            \/\/ Open\/Create gesendet werden mu\/s\n    sal_Bool                bDoNotTouchDocInfo;\n\n    AutoReloadTimer_Impl *pReloadTimer;\n    MarkData_Impl*      pMarkData;\n    sal_uInt16              nLoadedFlags;\n    String              aMark;\n    Size                aViewSize;          \/\/ wird leider vom Writer beim\n    sal_Bool                bInFrame;           \/\/ HTML-Import gebraucht\n    sal_Bool                bModalMode;\n    sal_Bool                bRunningMacro;\n    sal_Bool                bReloadAvailable;\n    sal_uInt16              nAutoLoadLocks;\n    SfxModule*              pModule;\n    SfxFrame*               pFrame;\n    SfxToolBoxConfig*       pTbxConfig;\n    SfxEventConfigItem_Impl* pEventConfig;\n    SfxObjectShellFlags     eFlags;\n    svtools::AsynchronLink* pCloser;\n    String                  aBaseURL;\n    sal_Bool                bReadOnlyUI;\n    SvRefBaseRef            xHeaderAttributes;\n    sal_Bool                bHiddenLockedByAPI;\n    sal_Bool                bInCloseEvent;\n    ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >             xModel;\n    sal_uInt16              nStyleFilter;\n    sal_Int16                nMacroMode;\n    sal_Bool                bDisposing;\n\n    sal_Bool                m_bEnableSetModified;\n    sal_Bool                m_bIsModified;\n\n    Rectangle               m_aVisArea;\n    MapUnit                 m_nMapUnit;\n\n    sal_Bool                m_bCreateTempStor;\n    ::com::sun::star::uno::Reference< ::com::sun::star::embed::XStorage > m_xDocStorage;\n\n    sal_Bool                m_bIsInit;\n\n\n    SfxObjectShell_Impl() :\n        pAccMgr(0),\n        nTime(),\n        bIsTmp( sal_False),\n        bClosing( sal_False),\n        bSetInPlaceObj( sal_False),\n        bPasswd( sal_False),\n        pBasicMgr( 0),\n        pBasicLibContainer( 0 ),\n        pDialogLibContainer( 0 ),\n        pProgress( 0),\n        nVisualDocumentNumber( USHRT_MAX),\n        nDocumentSignatureState( SIGNATURESTATE_UNKNOWN ),\n        nScriptingSignatureState( SIGNATURESTATE_UNKNOWN ),\n        bIsSaving( sal_False),\n        bIsNamedVisible( sal_False),\n        pCfgMgr( 0),\n        bTemplateConfig( sal_False),\n        bIsBasicDefault( sal_True ),\n        bIsTemplate(sal_False),\n        lErr(ERRCODE_NONE),\n        nEventId ( 0),\n        pDocInfo ( 0),\n        bIsAbortingImport ( sal_False),\n        bInList ( sal_False),\n        bImportDone ( sal_False),\n        pReloadTimer ( 0),\n        nLoadedFlags ( SFX_LOADED_MAINDOCUMENT ),\n        pMarkData( 0 ),\n        bInFrame( sal_False ),\n        bModalMode( sal_False ),\n        bRunningMacro( sal_False ),\n        bReloadAvailable( sal_False ),\n        nAutoLoadLocks( 0 ),\n        bInPrepareClose( sal_False ),\n        bPreparedForClose( sal_False ),\n        bWaitingForPicklist( sal_False ),\n        pModule( 0 ),\n        bModuleSearched( sal_False ),\n        pFrame( 0 ),\n        pTbxConfig( 0 ),\n        pEventConfig(NULL),\n        bIsHelpObjSh( sal_False ),\n        bForbidCaching( sal_False ),\n        bDoNotTouchDocInfo( sal_False ),\n        bForbidReload( sal_False ),\n        bBasicInitialized( sal_False ),\n        eFlags( SFXOBJECTSHELL_UNDEFINED ),\n        pCloser( 0 ),\n        bSupportsEventMacros( sal_True ),\n        bReadOnlyUI( sal_False ),\n        bHiddenLockedByAPI( sal_False ),\n        bInCloseEvent( sal_False ),\n        bLoadingWindows( sal_False ),\n        bHidden( sal_False )\n        , nStyleFilter( 0 )\n        , nMacroMode( -1 )\n        , bDisposing( sal_False )\n        , bIsPrintJobCancelable( sal_True )\n        , m_bEnableSetModified( sal_True )\n        , m_bIsModified( sal_False )\n        , m_nMapUnit( MAP_100TH_MM )\n        , m_bCreateTempStor( sal_False )\n        , m_bIsInit( sal_False )\n        , mpObjectContainer(0)\n        , bOwnsStorage( sal_True )\n        , bNoBaseURL( sal_False )\n    {}\n    ~SfxObjectShell_Impl();\n\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS fwkfinal1 (1.23.120); FILE MERGED 2005\/03\/15 16:20:04 mba 1.23.120.1: #i43920#: new events<commit_after>\/*************************************************************************\n *\n *  $RCSfile: objshimp.hxx,v $\n *\n *  $Revision: 1.24 $\n *\n *  last change: $Author: vg $ $Date: 2005-03-23 14:25: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 _SFX_OBJSHIMP_HXX\n#define _SFX_OBJSHIMP_HXX\n\n\/\/#include <hash_map>\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n#ifndef _DATETIME_HXX\n#include <tools\/datetime.hxx>\n#endif\n\n#include <svtools\/securityoptions.hxx>\n#include \"objsh.hxx\"\n#include \"bitset.hxx\"\n\nnamespace svtools { class AsynchronLink; }\n\n\/\/====================================================================\n\nDBG_NAMEEX(SfxObjectShell);\n\nclass SfxViewFrame;\nstruct MarkData_Impl\n{\n    String aMark;\n    String aUserData;\n    SfxViewFrame* pFrame;\n};\n\nclass SfxFrame;\nclass SfxDialogLibraryContainer;\nclass SfxScriptLibraryContainer;\nclass SfxToolBoxConfig;\nclass SfxAcceleratorManager;\nstruct SfxObjectShell_Impl\n{\n    ::comphelper::EmbeddedObjectContainer* mpObjectContainer;\n    SfxAcceleratorManager*  pAccMgr;\n    SfxDocumentInfo*    pDocInfo;\n    SfxConfigManager*   pCfgMgr;\n    BasicManager*       pBasicMgr;          \/\/ Doc-BASIC oder 0\n    SfxScriptLibraryContainer* pBasicLibContainer;\n    SfxDialogLibraryContainer* pDialogLibContainer;\n    SfxProgress*        pProgress;\n    String              aTitle;\n    String              aTempName;\n    DateTime            nTime;\n    sal_uInt16          nVisualDocumentNumber;\n    sal_Int16           nDocumentSignatureState;\n    sal_Int16           nScriptingSignatureState;\n    sal_Bool            bTemplateConfig:1,\n                        bInList:1,          \/\/ ob per First\/Next erreichbar\n                        bClosing:1,         \/\/ sal_True w\"aehrend Close(), um Benachrichtigungs-Rekursionen zu verhindern\n                        bSetInPlaceObj:1,   \/\/ sal_True, falls bereits versucht wurde pInPlaceObject zu casten\n                        bIsSaving:1,\n                        bPasswd:1,\n                        bIsTmp:1,\n                        bIsNamedVisible:1,\n                        bIsTemplate:1,\n                        bIsAbortingImport:1,  \/\/ Importvorgang soll abgebrochen werden.\n                        bImportDone : 1, \/\/Import schon fertig? Fuer AutoReload von Docs.\n                        bInPrepareClose : 1,\n                        bPreparedForClose : 1,\n                        bWaitingForPicklist : 1,\/\/ Muss noch in die Pickliste\n                        bModuleSearched : 1,\n                        bIsBasicDefault : 1,\n                        bIsHelpObjSh : 1,\n                        bForbidCaching : 1,\n                        bForbidReload : 1,\n                        bSupportsEventMacros: 1,\n                        bLoadingWindows: 1,\n                        bBasicInitialized :1,\n                        bHidden :1, \/\/ indicates a hidden view shell\n                        bIsPrintJobCancelable :1, \/\/ Stampit disable\/enable cancel button for print jobs ... default = true = enable!\n                        bOwnsStorage:1,\n                        bNoBaseURL:1,\n                        bInitialized:1;\n\n    String              aNewName;  \/\/ Der Name, unter dem das Doc gespeichert\n                                   \/\/ werden soll\n    IndexBitSet         aBitSet;\n    sal_uInt32               lErr;\n    sal_uInt16              nEventId;           \/\/ falls vor Activate noch ein\n                                            \/\/ Open\/Create gesendet werden mu\/s\n    sal_Bool                bDoNotTouchDocInfo;\n\n    AutoReloadTimer_Impl *pReloadTimer;\n    MarkData_Impl*      pMarkData;\n    sal_uInt16              nLoadedFlags;\n    String              aMark;\n    Size                aViewSize;          \/\/ wird leider vom Writer beim\n    sal_Bool                bInFrame;           \/\/ HTML-Import gebraucht\n    sal_Bool                bModalMode;\n    sal_Bool                bRunningMacro;\n    sal_Bool                bReloadAvailable;\n    sal_uInt16              nAutoLoadLocks;\n    SfxModule*              pModule;\n    SfxFrame*               pFrame;\n    SfxToolBoxConfig*       pTbxConfig;\n    SfxEventConfigItem_Impl* pEventConfig;\n    SfxObjectShellFlags     eFlags;\n    svtools::AsynchronLink* pCloser;\n    String                  aBaseURL;\n    sal_Bool                bReadOnlyUI;\n    SvRefBaseRef            xHeaderAttributes;\n    sal_Bool                bHiddenLockedByAPI;\n    sal_Bool                bInCloseEvent;\n    ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >             xModel;\n    sal_uInt16              nStyleFilter;\n    sal_Int16                nMacroMode;\n    sal_Bool                bDisposing;\n\n    sal_Bool                m_bEnableSetModified;\n    sal_Bool                m_bIsModified;\n\n    Rectangle               m_aVisArea;\n    MapUnit                 m_nMapUnit;\n\n    sal_Bool                m_bCreateTempStor;\n    ::com::sun::star::uno::Reference< ::com::sun::star::embed::XStorage > m_xDocStorage;\n\n    sal_Bool                m_bIsInit;\n\n\n    SfxObjectShell_Impl() :\n        pAccMgr(0),\n        nTime(),\n        bIsTmp( sal_False),\n        bClosing( sal_False),\n        bSetInPlaceObj( sal_False),\n        bPasswd( sal_False),\n        pBasicMgr( 0),\n        pBasicLibContainer( 0 ),\n        pDialogLibContainer( 0 ),\n        pProgress( 0),\n        nVisualDocumentNumber( USHRT_MAX),\n        nDocumentSignatureState( SIGNATURESTATE_UNKNOWN ),\n        nScriptingSignatureState( SIGNATURESTATE_UNKNOWN ),\n        bIsSaving( sal_False),\n        bIsNamedVisible( sal_False),\n        pCfgMgr( 0),\n        bTemplateConfig( sal_False),\n        bIsBasicDefault( sal_True ),\n        bIsTemplate(sal_False),\n        lErr(ERRCODE_NONE),\n        nEventId ( 0),\n        pDocInfo ( 0),\n        bIsAbortingImport ( sal_False),\n        bInList ( sal_False),\n        bImportDone ( sal_False),\n        pReloadTimer ( 0),\n        nLoadedFlags ( SFX_LOADED_MAINDOCUMENT ),\n        pMarkData( 0 ),\n        bInFrame( sal_False ),\n        bModalMode( sal_False ),\n        bRunningMacro( sal_False ),\n        bReloadAvailable( sal_False ),\n        nAutoLoadLocks( 0 ),\n        bInPrepareClose( sal_False ),\n        bPreparedForClose( sal_False ),\n        bWaitingForPicklist( sal_False ),\n        pModule( 0 ),\n        bModuleSearched( sal_False ),\n        pFrame( 0 ),\n        pTbxConfig( 0 ),\n        pEventConfig(NULL),\n        bIsHelpObjSh( sal_False ),\n        bForbidCaching( sal_False ),\n        bDoNotTouchDocInfo( sal_False ),\n        bForbidReload( sal_False ),\n        bBasicInitialized( sal_False ),\n        eFlags( SFXOBJECTSHELL_UNDEFINED ),\n        pCloser( 0 ),\n        bSupportsEventMacros( sal_True ),\n        bReadOnlyUI( sal_False ),\n        bHiddenLockedByAPI( sal_False ),\n        bInCloseEvent( sal_False ),\n        bLoadingWindows( sal_False ),\n        bHidden( sal_False )\n        , nStyleFilter( 0 )\n        , nMacroMode( -1 )\n        , bDisposing( sal_False )\n        , bIsPrintJobCancelable( sal_True )\n        , m_bEnableSetModified( sal_True )\n        , m_bIsModified( sal_False )\n        , m_nMapUnit( MAP_100TH_MM )\n        , m_bCreateTempStor( sal_False )\n        , m_bIsInit( sal_False )\n        , mpObjectContainer(0)\n        , bOwnsStorage( sal_True )\n        , bNoBaseURL( sal_False )\n        , bInitialized( sal_False )\n    {}\n    ~SfxObjectShell_Impl();\n\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2019 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#if !defined(_WIN32)\n#include \"iceoryx_utils\/internal\/posix_wrapper\/message_queue.hpp\"\n#include \"iceoryx_utils\/internal\/posix_wrapper\/unix_domain_socket.hpp\"\n\n#include \"test.hpp\"\n\n#include <chrono>\n\nusing namespace ::testing;\nusing namespace iox;\nusing namespace iox::posix;\n\n#if defined(__APPLE__)\nusing IpcChannelTypes = Types<UnixDomainSocket>;\n#else\nusing IpcChannelTypes = Types<MessageQueue, UnixDomainSocket>;\n#endif\n\nconstexpr char goodName[] = \"channel_test\";\nconstexpr char anotherGoodName[] = \"horst\";\nconstexpr char theUnknown[] = \"WhoeverYouAre\";\n\ntemplate <typename T>\nclass IpcChannel_test : public Test\n{\n  public:\n    using IpcChannelType = T;\n\n    void SetUp()\n    {\n        auto serverResult = IpcChannelType::create(\n            goodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER, MaxMsgSize, MaxMsgNumber);\n        ASSERT_THAT(serverResult.has_error(), Eq(false));\n        server = std::move(serverResult.value());\n        internal::CaptureStderr();\n\n        auto clientResult = IpcChannelType::create(\n            goodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT, MaxMsgSize, MaxMsgNumber);\n        ASSERT_THAT(clientResult.has_error(), Eq(false));\n        client = std::move(clientResult.value());\n    }\n\n    void TearDown()\n    {\n        std::string output = internal::GetCapturedStderr();\n        if (Test::HasFailure())\n        {\n            std::cout << output << std::endl;\n        }\n    }\n\n    ~IpcChannel_test()\n    {\n    }\n\n    static const size_t MaxMsgSize;\n    static constexpr uint64_t MaxMsgNumber = 10U;\n    IpcChannelType server;\n    IpcChannelType client;\n};\n\ntemplate <typename T>\nconst size_t IpcChannel_test<T>::MaxMsgSize = IpcChannelType::MAX_MESSAGE_SIZE;\ntemplate <typename T>\nconstexpr uint64_t IpcChannel_test<T>::MaxMsgNumber;\n\n\/\/\/ we require TYPED_TEST since we support gtest 1.8 for our safety targets\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wdeprecated-declarations\"\nTYPED_TEST_CASE(IpcChannel_test, IpcChannelTypes);\n#pragma GCC diagnostic pop\n\nTYPED_TEST(IpcChannel_test, createNoName)\n{\n    auto serverResult = TestFixture::IpcChannelType::create(\"\", IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_TRUE(serverResult.has_error());\n    ASSERT_THAT(serverResult.get_error(), Eq(IpcChannelError::INVALID_CHANNEL_NAME));\n}\n\nTYPED_TEST(IpcChannel_test, createAgain)\n{\n    \/\/ if there is a leftover from a crashed channel, we can create a new one. This is simulated by creating twice\n    auto first = TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(first.has_error());\n    auto second =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(second.has_error());\n}\n\n\nTYPED_TEST(IpcChannel_test, createAgainAndEmpty)\n{\n    using namespace iox::units;\n    using namespace std::chrono;\n\n    auto serverResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(serverResult.has_error());\n    auto server = std::move(serverResult.value());\n\n    auto clientResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT);\n    EXPECT_FALSE(clientResult.has_error());\n    auto client = std::move(clientResult.value());\n\n    \/\/ send and receive as usual\n    std::string message = \"Hey, I'm talking to you\";\n    bool sent = client.send(message).has_error();\n    EXPECT_FALSE(sent);\n\n    auto receivedMessage = server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(message, *receivedMessage);\n\n    \/\/ send a message, create the server again and there is no message\n    std::string newMessage = \"I'm still talking to you brother\";\n    sent = client.send(newMessage).has_error();\n    EXPECT_FALSE(sent);\n\n    auto second =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(second.has_error());\n    server = std::move(second.value());\n\n    Duration timeout = 100_ms;\n    auto received = server.timedReceive(timeout);\n    ASSERT_TRUE(received.has_error());\n    ASSERT_THAT(received.get_error(), Eq(IpcChannelError::TIMEOUT));\n}\n\nTYPED_TEST(IpcChannel_test, clientWithoutServerFails)\n{\n    auto clientResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT);\n    EXPECT_TRUE(clientResult.has_error());\n    ASSERT_THAT(clientResult.get_error(), Eq(IpcChannelError::NO_SUCH_CHANNEL));\n}\n\n\nTYPED_TEST(IpcChannel_test, NotOutdatedOne)\n{\n    auto serverResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(serverResult.has_error());\n    auto server = std::move(serverResult.value());\n\n    auto clientResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT);\n    EXPECT_FALSE(clientResult.has_error());\n    auto client = std::move(clientResult.value());\n\n    auto outdated = client.isOutdated();\n    EXPECT_FALSE(outdated.has_error());\n    EXPECT_FALSE(outdated.value());\n}\n\n\nTYPED_TEST(IpcChannel_test, OutdatedOne)\n{\n    if (std::is_same<typename TestFixture::IpcChannelType, UnixDomainSocket>::value)\n    {\n        \/\/ isOutdated cannot be realized for unix domain sockets\n        return;\n    }\n\n    auto serverResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(serverResult.has_error());\n    auto server = std::move(serverResult.value());\n\n    auto clientResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT);\n    EXPECT_FALSE(clientResult.has_error());\n    auto client = std::move(clientResult.value());\n\n    \/\/ destroy the server and the client is outdated\n    auto dest = server.destroy();\n    ASSERT_FALSE(dest.has_error());\n\n    auto outdated = client.isOutdated();\n    EXPECT_FALSE(outdated.has_error());\n    EXPECT_TRUE(outdated.value());\n}\n\nTYPED_TEST(IpcChannel_test, unlinkExistingOne)\n{\n    auto first = TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(first.has_error());\n    auto ret = TestFixture::IpcChannelType::unlinkIfExists(anotherGoodName);\n    EXPECT_FALSE(ret.has_error());\n    EXPECT_TRUE(ret.value());\n}\n\nTYPED_TEST(IpcChannel_test, unlinkNonExistingOne)\n{\n    auto ret = TestFixture::IpcChannelType::unlinkIfExists(theUnknown);\n    EXPECT_FALSE(ret.has_error());\n    EXPECT_FALSE(ret.value());\n}\n\nTYPED_TEST(IpcChannel_test, sendAndReceive)\n{\n    std::string message = \"Hey, I'm talking to you\";\n    bool sent = this->client.send(message).has_error();\n    EXPECT_FALSE(sent);\n\n    std::string anotherMessage = \"This is a message\";\n    sent = this->client.send(anotherMessage).has_error();\n    EXPECT_FALSE(sent);\n\n    auto receivedMessage = this->server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(message, *receivedMessage);\n\n    receivedMessage = this->server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(anotherMessage, *receivedMessage);\n}\n\nTYPED_TEST(IpcChannel_test, invalidAfterDestroy)\n{\n    this->client.destroy();\n    ASSERT_FALSE(this->client.isInitialized());\n    this->server.destroy();\n    ASSERT_FALSE(this->server.isInitialized());\n}\n\nTYPED_TEST(IpcChannel_test, sendAfterClientDestroy)\n{\n    auto dest = this->client.destroy();\n    ASSERT_FALSE(dest.has_error());\n\n    std::string message = \"Should never be sent\";\n    bool sendError = this->client.send(message).has_error();\n    EXPECT_TRUE(sendError);\n}\n\nTYPED_TEST(IpcChannel_test, sendAfterServerDestroy)\n{\n    if (std::is_same<typename TestFixture::IpcChannelType, MessageQueue>::value)\n    {\n        \/\/ We still can send to the message queue is we destroy the server\n        \/\/ it would be outdated, this is checked in another test\n        return;\n    }\n\n    auto dest = this->server.destroy();\n    ASSERT_FALSE(dest.has_error());\n\n    std::string message = \"Try to send me\";\n    auto sendResult = this->client.send(message);\n    EXPECT_TRUE(sendResult.has_error());\n}\n\n\nTYPED_TEST(IpcChannel_test, receiveAfterServerDestroy)\n{\n    std::string message = \"hello world!\";\n    bool sendError = this->client.send(message).has_error();\n    EXPECT_FALSE(sendError);\n\n    auto dest = this->server.destroy();\n    ASSERT_FALSE(dest.has_error());\n\n    bool receiveError = this->server.receive().has_error();\n    EXPECT_THAT(receiveError, Eq(true));\n}\n\nTYPED_TEST(IpcChannel_test, sendMoreThanAllowed)\n{\n    std::string shortMessage = \"Iceoryx rules.\";\n    ASSERT_THAT(this->client.send(shortMessage).has_error(), Eq(false));\n\n    std::string longMessage(this->server.MAX_MESSAGE_SIZE + 8, 'x');\n    ASSERT_THAT(this->client.send(longMessage).has_error(), Eq(true));\n\n    auto receivedMessage = this->server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(shortMessage, receivedMessage.value());\n}\n\nTYPED_TEST(IpcChannel_test, sendMaxMessageSize)\n{\n    std::string message(this->MaxMsgSize - 1, 'x');\n    auto clientReturn = this->client.send(message);\n    ASSERT_THAT(clientReturn.has_error(), Eq(false));\n\n    auto receivedMessage = this->server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(message, receivedMessage.value());\n}\n\nTYPED_TEST(IpcChannel_test, wildCreate)\n{\n    auto result = TestFixture::IpcChannelType::create();\n    ASSERT_THAT(result.has_error(), Eq(true));\n}\n\n#if !defined(__APPLE__)\nTYPED_TEST(IpcChannel_test, timedSend)\n{\n    using namespace iox::units;\n    using namespace std::chrono;\n\n    std::string msg = \"ISG rules. And some more                                                                        \"\n                      \"data to have a bit                                                                              \"\n                      \"longer message\";\n\n    Duration maxTimeout = 100_ms;\n    Duration minTimeoutTolerance = 10_ms;\n    Duration maxTimeoutTolerance = 20_ms;\n\n    \/\/ send till it breaks\n    for (;;)\n    {\n        auto before = system_clock::now();\n        auto result = this->client.timedSend(msg, maxTimeout);\n        auto after = system_clock::now();\n        if (result.has_error())\n        {\n            ASSERT_THAT(result.get_error(), Eq(IpcChannelError::TIMEOUT));\n            \/\/ Do not exceed timeout\n            auto timeDiff_ms = duration_cast<milliseconds>(after - before);\n            EXPECT_LT(timeDiff_ms.count(), (maxTimeout + maxTimeoutTolerance).milliSeconds<int64_t>());\n\n            \/\/ Check if timedSend has blocked for ~maxTimeout and has not returned immediately\n            EXPECT_GT(timeDiff_ms.count(), (maxTimeout - minTimeoutTolerance).milliSeconds<int64_t>());\n\n            break;\n        }\n    }\n}\n#endif\n\nTYPED_TEST(IpcChannel_test, timedReceive)\n{\n    using namespace iox::units;\n    using namespace std::chrono;\n\n    std::string msg = \"very useful text for tranmission\";\n    Duration timeout = 100_ms;\n    Duration minTimeoutTolerance = 10_ms;\n    Duration maxTimeoutTolerance = 20_ms;\n\n    this->client.send(msg);\n\n    auto received = this->server.timedReceive(timeout);\n    ASSERT_FALSE(received.has_error());\n\n    EXPECT_EQ(received.value(), msg);\n\n    auto before = system_clock::now();\n    received = this->server.timedReceive(timeout);\n    auto after = system_clock::now();\n\n    ASSERT_TRUE(received.has_error());\n    ASSERT_THAT(received.get_error(), Eq(IpcChannelError::TIMEOUT));\n\n    \/\/ Do not exceed timeout\n    auto timeDiff_ms = duration_cast<milliseconds>(after - before);\n    EXPECT_LT(timeDiff_ms.count(), (timeout + maxTimeoutTolerance).milliSeconds<int64_t>());\n\n    \/\/ Check if timedReceive has blocked for ~timeout and has not returned immediately\n    EXPECT_GT(timeDiff_ms.count(), (timeout - minTimeoutTolerance).milliSeconds<int64_t>());\n}\n#endif\n<commit_msg>iox-#381 add testcase for slash<commit_after>\/\/ Copyright (c) 2019 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#if !defined(_WIN32)\n#include \"iceoryx_utils\/internal\/posix_wrapper\/message_queue.hpp\"\n#include \"iceoryx_utils\/internal\/posix_wrapper\/unix_domain_socket.hpp\"\n\n#include \"test.hpp\"\n\n#include <chrono>\n\nusing namespace ::testing;\nusing namespace iox;\nusing namespace iox::posix;\n\n#if defined(__APPLE__)\nusing IpcChannelTypes = Types<UnixDomainSocket>;\n#else\nusing IpcChannelTypes = Types<MessageQueue, UnixDomainSocket>;\n#endif\n\nconstexpr char goodName[] = \"channel_test\";\nconstexpr char anotherGoodName[] = \"horst\";\nconstexpr char theUnknown[] = \"WhoeverYouAre\";\nconstexpr char slashName[] = \"\/miau\";\n\ntemplate <typename T>\nclass IpcChannel_test : public Test\n{\n  public:\n    using IpcChannelType = T;\n\n    void SetUp()\n    {\n        auto serverResult = IpcChannelType::create(\n            goodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER, MaxMsgSize, MaxMsgNumber);\n        ASSERT_THAT(serverResult.has_error(), Eq(false));\n        server = std::move(serverResult.value());\n        internal::CaptureStderr();\n\n        auto clientResult = IpcChannelType::create(\n            goodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT, MaxMsgSize, MaxMsgNumber);\n        ASSERT_THAT(clientResult.has_error(), Eq(false));\n        client = std::move(clientResult.value());\n    }\n\n    void TearDown()\n    {\n        std::string output = internal::GetCapturedStderr();\n        if (Test::HasFailure())\n        {\n            std::cout << output << std::endl;\n        }\n    }\n\n    ~IpcChannel_test()\n    {\n    }\n\n    static const size_t MaxMsgSize;\n    static constexpr uint64_t MaxMsgNumber = 10U;\n    IpcChannelType server;\n    IpcChannelType client;\n};\n\ntemplate <typename T>\nconst size_t IpcChannel_test<T>::MaxMsgSize = IpcChannelType::MAX_MESSAGE_SIZE;\ntemplate <typename T>\nconstexpr uint64_t IpcChannel_test<T>::MaxMsgNumber;\n\n\/\/\/ we require TYPED_TEST since we support gtest 1.8 for our safety targets\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wdeprecated-declarations\"\nTYPED_TEST_CASE(IpcChannel_test, IpcChannelTypes);\n#pragma GCC diagnostic pop\n\nTYPED_TEST(IpcChannel_test, createNoName)\n{\n    auto serverResult = TestFixture::IpcChannelType::create(\"\", IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_TRUE(serverResult.has_error());\n    ASSERT_THAT(serverResult.get_error(), Eq(IpcChannelError::INVALID_CHANNEL_NAME));\n}\n\nTYPED_TEST(IpcChannel_test, createWithLeadingSlash)\n{\n    auto serverResult = TestFixture::IpcChannelType::create(slashName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(serverResult.has_error());  \n}\n\nTYPED_TEST(IpcChannel_test, createAgain)\n{\n    \/\/ if there is a leftover from a crashed channel, we can create a new one. This is simulated by creating twice\n    auto first = TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(first.has_error());\n    auto second =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(second.has_error());\n}\n\n\nTYPED_TEST(IpcChannel_test, createAgainAndEmpty)\n{\n    using namespace iox::units;\n    using namespace std::chrono;\n\n    auto serverResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(serverResult.has_error());\n    auto server = std::move(serverResult.value());\n\n    auto clientResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT);\n    EXPECT_FALSE(clientResult.has_error());\n    auto client = std::move(clientResult.value());\n\n    \/\/ send and receive as usual\n    std::string message = \"Hey, I'm talking to you\";\n    bool sent = client.send(message).has_error();\n    EXPECT_FALSE(sent);\n\n    auto receivedMessage = server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(message, *receivedMessage);\n\n    \/\/ send a message, create the server again and there is no message\n    std::string newMessage = \"I'm still talking to you brother\";\n    sent = client.send(newMessage).has_error();\n    EXPECT_FALSE(sent);\n\n    auto second =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(second.has_error());\n    server = std::move(second.value());\n\n    Duration timeout = 100_ms;\n    auto received = server.timedReceive(timeout);\n    ASSERT_TRUE(received.has_error());\n    ASSERT_THAT(received.get_error(), Eq(IpcChannelError::TIMEOUT));\n}\n\nTYPED_TEST(IpcChannel_test, clientWithoutServerFails)\n{\n    auto clientResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT);\n    EXPECT_TRUE(clientResult.has_error());\n    ASSERT_THAT(clientResult.get_error(), Eq(IpcChannelError::NO_SUCH_CHANNEL));\n}\n\n\nTYPED_TEST(IpcChannel_test, NotOutdatedOne)\n{\n    auto serverResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(serverResult.has_error());\n    auto server = std::move(serverResult.value());\n\n    auto clientResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT);\n    EXPECT_FALSE(clientResult.has_error());\n    auto client = std::move(clientResult.value());\n\n    auto outdated = client.isOutdated();\n    EXPECT_FALSE(outdated.has_error());\n    EXPECT_FALSE(outdated.value());\n}\n\n\nTYPED_TEST(IpcChannel_test, OutdatedOne)\n{\n    if (std::is_same<typename TestFixture::IpcChannelType, UnixDomainSocket>::value)\n    {\n        \/\/ isOutdated cannot be realized for unix domain sockets\n        return;\n    }\n\n    auto serverResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(serverResult.has_error());\n    auto server = std::move(serverResult.value());\n\n    auto clientResult =\n        TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::CLIENT);\n    EXPECT_FALSE(clientResult.has_error());\n    auto client = std::move(clientResult.value());\n\n    \/\/ destroy the server and the client is outdated\n    auto dest = server.destroy();\n    ASSERT_FALSE(dest.has_error());\n\n    auto outdated = client.isOutdated();\n    EXPECT_FALSE(outdated.has_error());\n    EXPECT_TRUE(outdated.value());\n}\n\nTYPED_TEST(IpcChannel_test, unlinkExistingOne)\n{\n    auto first = TestFixture::IpcChannelType::create(anotherGoodName, IpcChannelMode::BLOCKING, IpcChannelSide::SERVER);\n    EXPECT_FALSE(first.has_error());\n    auto ret = TestFixture::IpcChannelType::unlinkIfExists(anotherGoodName);\n    EXPECT_FALSE(ret.has_error());\n    EXPECT_TRUE(ret.value());\n}\n\nTYPED_TEST(IpcChannel_test, unlinkNonExistingOne)\n{\n    auto ret = TestFixture::IpcChannelType::unlinkIfExists(theUnknown);\n    EXPECT_FALSE(ret.has_error());\n    EXPECT_FALSE(ret.value());\n}\n\nTYPED_TEST(IpcChannel_test, sendAndReceive)\n{\n    std::string message = \"Hey, I'm talking to you\";\n    bool sent = this->client.send(message).has_error();\n    EXPECT_FALSE(sent);\n\n    std::string anotherMessage = \"This is a message\";\n    sent = this->client.send(anotherMessage).has_error();\n    EXPECT_FALSE(sent);\n\n    auto receivedMessage = this->server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(message, *receivedMessage);\n\n    receivedMessage = this->server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(anotherMessage, *receivedMessage);\n}\n\nTYPED_TEST(IpcChannel_test, invalidAfterDestroy)\n{\n    this->client.destroy();\n    ASSERT_FALSE(this->client.isInitialized());\n    this->server.destroy();\n    ASSERT_FALSE(this->server.isInitialized());\n}\n\nTYPED_TEST(IpcChannel_test, sendAfterClientDestroy)\n{\n    auto dest = this->client.destroy();\n    ASSERT_FALSE(dest.has_error());\n\n    std::string message = \"Should never be sent\";\n    bool sendError = this->client.send(message).has_error();\n    EXPECT_TRUE(sendError);\n}\n\nTYPED_TEST(IpcChannel_test, sendAfterServerDestroy)\n{\n    if (std::is_same<typename TestFixture::IpcChannelType, MessageQueue>::value)\n    {\n        \/\/ We still can send to the message queue is we destroy the server\n        \/\/ it would be outdated, this is checked in another test\n        return;\n    }\n\n    auto dest = this->server.destroy();\n    ASSERT_FALSE(dest.has_error());\n\n    std::string message = \"Try to send me\";\n    auto sendResult = this->client.send(message);\n    EXPECT_TRUE(sendResult.has_error());\n}\n\n\nTYPED_TEST(IpcChannel_test, receiveAfterServerDestroy)\n{\n    std::string message = \"hello world!\";\n    bool sendError = this->client.send(message).has_error();\n    EXPECT_FALSE(sendError);\n\n    auto dest = this->server.destroy();\n    ASSERT_FALSE(dest.has_error());\n\n    bool receiveError = this->server.receive().has_error();\n    EXPECT_THAT(receiveError, Eq(true));\n}\n\nTYPED_TEST(IpcChannel_test, sendMoreThanAllowed)\n{\n    std::string shortMessage = \"Iceoryx rules.\";\n    ASSERT_THAT(this->client.send(shortMessage).has_error(), Eq(false));\n\n    std::string longMessage(this->server.MAX_MESSAGE_SIZE + 8, 'x');\n    ASSERT_THAT(this->client.send(longMessage).has_error(), Eq(true));\n\n    auto receivedMessage = this->server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(shortMessage, receivedMessage.value());\n}\n\nTYPED_TEST(IpcChannel_test, sendMaxMessageSize)\n{\n    std::string message(this->MaxMsgSize - 1, 'x');\n    auto clientReturn = this->client.send(message);\n    ASSERT_THAT(clientReturn.has_error(), Eq(false));\n\n    auto receivedMessage = this->server.receive();\n    ASSERT_THAT(receivedMessage.has_error(), Eq(false));\n    EXPECT_EQ(message, receivedMessage.value());\n}\n\nTYPED_TEST(IpcChannel_test, wildCreate)\n{\n    auto result = TestFixture::IpcChannelType::create();\n    ASSERT_THAT(result.has_error(), Eq(true));\n}\n\n#if !defined(__APPLE__)\nTYPED_TEST(IpcChannel_test, timedSend)\n{\n    using namespace iox::units;\n    using namespace std::chrono;\n\n    std::string msg = \"ISG rules. And some more                                                                        \"\n                      \"data to have a bit                                                                              \"\n                      \"longer message\";\n\n    Duration maxTimeout = 100_ms;\n    Duration minTimeoutTolerance = 10_ms;\n    Duration maxTimeoutTolerance = 20_ms;\n\n    \/\/ send till it breaks\n    for (;;)\n    {\n        auto before = system_clock::now();\n        auto result = this->client.timedSend(msg, maxTimeout);\n        auto after = system_clock::now();\n        if (result.has_error())\n        {\n            ASSERT_THAT(result.get_error(), Eq(IpcChannelError::TIMEOUT));\n            \/\/ Do not exceed timeout\n            auto timeDiff_ms = duration_cast<milliseconds>(after - before);\n            EXPECT_LT(timeDiff_ms.count(), (maxTimeout + maxTimeoutTolerance).milliSeconds<int64_t>());\n\n            \/\/ Check if timedSend has blocked for ~maxTimeout and has not returned immediately\n            EXPECT_GT(timeDiff_ms.count(), (maxTimeout - minTimeoutTolerance).milliSeconds<int64_t>());\n\n            break;\n        }\n    }\n}\n#endif\n\nTYPED_TEST(IpcChannel_test, timedReceive)\n{\n    using namespace iox::units;\n    using namespace std::chrono;\n\n    std::string msg = \"very useful text for tranmission\";\n    Duration timeout = 100_ms;\n    Duration minTimeoutTolerance = 10_ms;\n    Duration maxTimeoutTolerance = 20_ms;\n\n    this->client.send(msg);\n\n    auto received = this->server.timedReceive(timeout);\n    ASSERT_FALSE(received.has_error());\n\n    EXPECT_EQ(received.value(), msg);\n\n    auto before = system_clock::now();\n    received = this->server.timedReceive(timeout);\n    auto after = system_clock::now();\n\n    ASSERT_TRUE(received.has_error());\n    ASSERT_THAT(received.get_error(), Eq(IpcChannelError::TIMEOUT));\n\n    \/\/ Do not exceed timeout\n    auto timeDiff_ms = duration_cast<milliseconds>(after - before);\n    EXPECT_LT(timeDiff_ms.count(), (timeout + maxTimeoutTolerance).milliSeconds<int64_t>());\n\n    \/\/ Check if timedReceive has blocked for ~timeout and has not returned immediately\n    EXPECT_GT(timeDiff_ms.count(), (timeout - minTimeoutTolerance).milliSeconds<int64_t>());\n}\n#endif\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\/runtime_effect_contents.h\"\n\n#include <future>\n#include <memory>\n\n#include \"flutter\/fml\/logging.h\"\n#include \"flutter\/fml\/make_copyable.h\"\n#include \"impeller\/base\/validation.h\"\n#include \"impeller\/entity\/contents\/clip_contents.h\"\n#include \"impeller\/entity\/contents\/content_context.h\"\n#include \"impeller\/entity\/runtime_effect.vert.h\"\n#include \"impeller\/renderer\/formats.h\"\n#include \"impeller\/renderer\/pipeline_library.h\"\n#include \"impeller\/renderer\/render_pass.h\"\n#include \"impeller\/renderer\/sampler_library.h\"\n#include \"impeller\/renderer\/shader_function.h\"\n#include \"impeller\/renderer\/shader_types.h\"\n\nnamespace impeller {\n\nvoid RuntimeEffectContents::SetRuntimeStage(\n    std::shared_ptr<RuntimeStage> runtime_stage) {\n  runtime_stage_ = std::move(runtime_stage);\n}\n\nvoid RuntimeEffectContents::SetUniformData(\n    std::shared_ptr<std::vector<uint8_t>> uniform_data) {\n  uniform_data_ = std::move(uniform_data);\n}\n\nvoid RuntimeEffectContents::SetTextureInputs(\n    std::vector<TextureInput> texture_inputs) {\n  texture_inputs_ = std::move(texture_inputs);\n}\n\nbool RuntimeEffectContents::Render(const ContentContext& renderer,\n                                   const Entity& entity,\n                                   RenderPass& pass) const {\n  auto context = renderer.GetContext();\n  auto library = context->GetShaderLibrary();\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Get or register shader.\n  \/\/\/\n\n  \/\/ TODO(113719): Register the shader function earlier.\n\n  std::shared_ptr<const ShaderFunction> function = library->GetFunction(\n      runtime_stage_->GetEntrypoint(), ShaderStage::kFragment);\n\n  if (function && runtime_stage_->IsDirty()) {\n    context->GetPipelineLibrary()->RemovePipelinesWithEntryPoint(function);\n    library->UnregisterFunction(runtime_stage_->GetEntrypoint(),\n                                ShaderStage::kFragment);\n\n    function = nullptr;\n  }\n\n  if (!function) {\n    std::promise<bool> promise;\n    auto future = promise.get_future();\n\n    library->RegisterFunction(\n        runtime_stage_->GetEntrypoint(),\n        ToShaderStage(runtime_stage_->GetShaderStage()),\n        runtime_stage_->GetCodeMapping(),\n        fml::MakeCopyable([promise = std::move(promise)](bool result) mutable {\n          promise.set_value(result);\n        }));\n\n    if (!future.get()) {\n      VALIDATION_LOG << \"Failed to build runtime effect (entry point: \"\n                     << runtime_stage_->GetEntrypoint() << \")\";\n      return false;\n    }\n\n    function = library->GetFunction(runtime_stage_->GetEntrypoint(),\n                                    ShaderStage::kFragment);\n    if (!function) {\n      VALIDATION_LOG\n          << \"Failed to fetch runtime effect function immediately after \"\n             \"registering it (entry point: \"\n          << runtime_stage_->GetEntrypoint() << \")\";\n      return false;\n    }\n\n    runtime_stage_->SetClean();\n  }\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Resolve geometry.\n  \/\/\/\n\n  auto geometry_result =\n      GetGeometry()->GetPositionBuffer(renderer, entity, pass);\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Get or create runtime stage pipeline.\n  \/\/\/\n\n  using VS = RuntimeEffectVertexShader;\n  PipelineDescriptor desc;\n  desc.SetLabel(\"Runtime Stage\");\n  desc.AddStageEntrypoint(\n      library->GetFunction(VS::kEntrypointName, ShaderStage::kVertex));\n  desc.AddStageEntrypoint(library->GetFunction(runtime_stage_->GetEntrypoint(),\n                                               ShaderStage::kFragment));\n  auto vertex_descriptor = std::make_shared<VertexDescriptor>();\n  if (!vertex_descriptor->SetStageInputs(VS::kAllShaderStageInputs)) {\n    VALIDATION_LOG << \"Failed to set stage inputs for runtime effect pipeline.\";\n  }\n  desc.SetVertexDescriptor(std::move(vertex_descriptor));\n  desc.SetColorAttachmentDescriptor(0u, {.format = PixelFormat::kDefaultColor});\n  desc.SetStencilAttachmentDescriptors({});\n  desc.SetStencilPixelFormat(PixelFormat::kDefaultStencil);\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  options.ApplyToPipelineDescriptor(desc);\n\n  auto pipeline = context->GetPipelineLibrary()->GetPipeline(desc).Get();\n  if (!pipeline) {\n    VALIDATION_LOG << \"Failed to get or create runtime effect pipeline.\";\n    return false;\n  }\n\n  Command cmd;\n  cmd.label = \"RuntimeEffectContents\";\n  cmd.pipeline = pipeline;\n  cmd.stencil_reference = entity.GetStencilDepth();\n  cmd.BindVertices(geometry_result.vertex_buffer);\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Vertex stage uniforms.\n  \/\/\/\n\n  VS::VertInfo frame_info;\n  frame_info.mvp = Matrix::MakeOrthographic(pass.GetRenderTargetSize()) *\n                   entity.GetTransformation();\n  VS::BindVertInfo(cmd, pass.GetTransientsBuffer().EmplaceUniform(frame_info));\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Fragment stage uniforms.\n  \/\/\/\n\n  size_t buffer_index = 0;\n  size_t sampler_index = 0;\n  for (auto uniform : runtime_stage_->GetUniforms()) {\n    \/\/ TODO(113715): Populate this metadata once GLES is able to handle\n    \/\/               non-struct uniform names.\n    ShaderMetadata metadata;\n\n    switch (uniform.type) {\n      case kSampledImage: {\n        FML_DCHECK(sampler_index < texture_inputs_.size());\n        auto& input = texture_inputs_[sampler_index];\n\n        auto sampler =\n            context->GetSamplerLibrary()->GetSampler(input.sampler_descriptor);\n\n        SampledImageSlot image_slot;\n        image_slot.name = uniform.name.c_str();\n        image_slot.texture_index = sampler_index;\n        image_slot.sampler_index = sampler_index;\n        cmd.BindResource(ShaderStage::kFragment, image_slot, metadata,\n                         input.texture, sampler);\n\n        sampler_index++;\n        break;\n      }\n      case kFloat: {\n        size_t alignment =\n            std::max(uniform.bit_width \/ 8, DefaultUniformAlignment());\n        auto buffer_view = pass.GetTransientsBuffer().Emplace(\n            uniform_data_->data() + uniform.location * sizeof(float),\n            uniform.GetSize(), alignment);\n\n        ShaderUniformSlot uniform_slot;\n        uniform_slot.name = uniform.name.c_str();\n        uniform_slot.ext_res_0 = buffer_index;\n        cmd.BindResource(ShaderStage::kFragment, uniform_slot, metadata,\n                         buffer_view);\n        break;\n      }\n      case kBoolean:\n      case kSignedByte:\n      case kUnsignedByte:\n      case kSignedShort:\n      case kUnsignedShort:\n      case kSignedInt:\n      case kUnsignedInt:\n      case kSignedInt64:\n      case kUnsignedInt64:\n      case kHalfFloat:\n      case kDouble:\n        VALIDATION_LOG << \"Unsupported uniform type for \" << uniform.name\n                       << \".\";\n        return true;\n    }\n\n    buffer_index++;\n  }\n\n  pass.AddCommand(std::move(cmd));\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] enable blending on RuntimeEffectsContents (#37509)<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\/runtime_effect_contents.h\"\n\n#include <future>\n#include <memory>\n\n#include \"flutter\/fml\/logging.h\"\n#include \"flutter\/fml\/make_copyable.h\"\n#include \"impeller\/base\/validation.h\"\n#include \"impeller\/entity\/contents\/clip_contents.h\"\n#include \"impeller\/entity\/contents\/content_context.h\"\n#include \"impeller\/entity\/runtime_effect.vert.h\"\n#include \"impeller\/renderer\/formats.h\"\n#include \"impeller\/renderer\/pipeline_library.h\"\n#include \"impeller\/renderer\/render_pass.h\"\n#include \"impeller\/renderer\/sampler_library.h\"\n#include \"impeller\/renderer\/shader_function.h\"\n#include \"impeller\/renderer\/shader_types.h\"\n\nnamespace impeller {\n\nvoid RuntimeEffectContents::SetRuntimeStage(\n    std::shared_ptr<RuntimeStage> runtime_stage) {\n  runtime_stage_ = std::move(runtime_stage);\n}\n\nvoid RuntimeEffectContents::SetUniformData(\n    std::shared_ptr<std::vector<uint8_t>> uniform_data) {\n  uniform_data_ = std::move(uniform_data);\n}\n\nvoid RuntimeEffectContents::SetTextureInputs(\n    std::vector<TextureInput> texture_inputs) {\n  texture_inputs_ = std::move(texture_inputs);\n}\n\nbool RuntimeEffectContents::Render(const ContentContext& renderer,\n                                   const Entity& entity,\n                                   RenderPass& pass) const {\n  auto context = renderer.GetContext();\n  auto library = context->GetShaderLibrary();\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Get or register shader.\n  \/\/\/\n\n  \/\/ TODO(113719): Register the shader function earlier.\n\n  std::shared_ptr<const ShaderFunction> function = library->GetFunction(\n      runtime_stage_->GetEntrypoint(), ShaderStage::kFragment);\n\n  if (function && runtime_stage_->IsDirty()) {\n    context->GetPipelineLibrary()->RemovePipelinesWithEntryPoint(function);\n    library->UnregisterFunction(runtime_stage_->GetEntrypoint(),\n                                ShaderStage::kFragment);\n\n    function = nullptr;\n  }\n\n  if (!function) {\n    std::promise<bool> promise;\n    auto future = promise.get_future();\n\n    library->RegisterFunction(\n        runtime_stage_->GetEntrypoint(),\n        ToShaderStage(runtime_stage_->GetShaderStage()),\n        runtime_stage_->GetCodeMapping(),\n        fml::MakeCopyable([promise = std::move(promise)](bool result) mutable {\n          promise.set_value(result);\n        }));\n\n    if (!future.get()) {\n      VALIDATION_LOG << \"Failed to build runtime effect (entry point: \"\n                     << runtime_stage_->GetEntrypoint() << \")\";\n      return false;\n    }\n\n    function = library->GetFunction(runtime_stage_->GetEntrypoint(),\n                                    ShaderStage::kFragment);\n    if (!function) {\n      VALIDATION_LOG\n          << \"Failed to fetch runtime effect function immediately after \"\n             \"registering it (entry point: \"\n          << runtime_stage_->GetEntrypoint() << \")\";\n      return false;\n    }\n\n    runtime_stage_->SetClean();\n  }\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Resolve geometry.\n  \/\/\/\n\n  auto geometry_result =\n      GetGeometry()->GetPositionBuffer(renderer, entity, pass);\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Get or create runtime stage pipeline.\n  \/\/\/\n\n  using VS = RuntimeEffectVertexShader;\n  PipelineDescriptor desc;\n  desc.SetLabel(\"Runtime Stage\");\n  desc.AddStageEntrypoint(\n      library->GetFunction(VS::kEntrypointName, ShaderStage::kVertex));\n  desc.AddStageEntrypoint(library->GetFunction(runtime_stage_->GetEntrypoint(),\n                                               ShaderStage::kFragment));\n  auto vertex_descriptor = std::make_shared<VertexDescriptor>();\n  if (!vertex_descriptor->SetStageInputs(VS::kAllShaderStageInputs)) {\n    VALIDATION_LOG << \"Failed to set stage inputs for runtime effect pipeline.\";\n  }\n  desc.SetVertexDescriptor(std::move(vertex_descriptor));\n  desc.SetColorAttachmentDescriptor(\n      0u, {.format = PixelFormat::kDefaultColor, .blending_enabled = true});\n  desc.SetStencilAttachmentDescriptors({});\n  desc.SetStencilPixelFormat(PixelFormat::kDefaultStencil);\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  options.ApplyToPipelineDescriptor(desc);\n\n  auto pipeline = context->GetPipelineLibrary()->GetPipeline(desc).Get();\n  if (!pipeline) {\n    VALIDATION_LOG << \"Failed to get or create runtime effect pipeline.\";\n    return false;\n  }\n\n  Command cmd;\n  cmd.label = \"RuntimeEffectContents\";\n  cmd.pipeline = pipeline;\n  cmd.stencil_reference = entity.GetStencilDepth();\n  cmd.BindVertices(geometry_result.vertex_buffer);\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Vertex stage uniforms.\n  \/\/\/\n\n  VS::VertInfo frame_info;\n  frame_info.mvp = Matrix::MakeOrthographic(pass.GetRenderTargetSize()) *\n                   entity.GetTransformation();\n  VS::BindVertInfo(cmd, pass.GetTransientsBuffer().EmplaceUniform(frame_info));\n\n  \/\/--------------------------------------------------------------------------\n  \/\/\/ Fragment stage uniforms.\n  \/\/\/\n\n  size_t buffer_index = 0;\n  size_t sampler_index = 0;\n  for (auto uniform : runtime_stage_->GetUniforms()) {\n    \/\/ TODO(113715): Populate this metadata once GLES is able to handle\n    \/\/               non-struct uniform names.\n    ShaderMetadata metadata;\n\n    switch (uniform.type) {\n      case kSampledImage: {\n        FML_DCHECK(sampler_index < texture_inputs_.size());\n        auto& input = texture_inputs_[sampler_index];\n\n        auto sampler =\n            context->GetSamplerLibrary()->GetSampler(input.sampler_descriptor);\n\n        SampledImageSlot image_slot;\n        image_slot.name = uniform.name.c_str();\n        image_slot.texture_index = sampler_index;\n        image_slot.sampler_index = sampler_index;\n        cmd.BindResource(ShaderStage::kFragment, image_slot, metadata,\n                         input.texture, sampler);\n\n        sampler_index++;\n        break;\n      }\n      case kFloat: {\n        size_t alignment =\n            std::max(uniform.bit_width \/ 8, DefaultUniformAlignment());\n        auto buffer_view = pass.GetTransientsBuffer().Emplace(\n            uniform_data_->data() + uniform.location * sizeof(float),\n            uniform.GetSize(), alignment);\n\n        ShaderUniformSlot uniform_slot;\n        uniform_slot.name = uniform.name.c_str();\n        uniform_slot.ext_res_0 = buffer_index;\n        cmd.BindResource(ShaderStage::kFragment, uniform_slot, metadata,\n                         buffer_view);\n        break;\n      }\n      case kBoolean:\n      case kSignedByte:\n      case kUnsignedByte:\n      case kSignedShort:\n      case kUnsignedShort:\n      case kSignedInt:\n      case kUnsignedInt:\n      case kSignedInt64:\n      case kUnsignedInt64:\n      case kHalfFloat:\n      case kDouble:\n        VALIDATION_LOG << \"Unsupported uniform type for \" << uniform.name\n                       << \".\";\n        return true;\n    }\n\n    buffer_index++;\n  }\n\n  pass.AddCommand(std::move(cmd));\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>\/* Copyright 2015 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\/core\/common_runtime\/device.h\"\n#include \"tensorflow\/core\/common_runtime\/gpu\/gpu_util.h\"\n#include \"tensorflow\/core\/common_runtime\/gpu_device_context.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/platform\/stream_executor.h\"\n\nnamespace tensorflow {\n\nvoid GPUDeviceContext::CopyCPUTensorToDevice(const Tensor* cpu_tensor,\n                                             Device* device,\n                                             Tensor* device_tensor,\n                                             StatusCallback done) const {\n  \/\/std::cout<<\"\\nCopyCPUTensorToDevice\\n\\n\";\n  std::cout<<\"\\n>\\n\";\n  GPUUtil::CopyCPUTensorToGPU(cpu_tensor, this, device, device_tensor, done);\n}\n\nvoid GPUDeviceContext::CopyDeviceTensorToCPU(const Tensor* device_tensor,\n                                             StringPiece tensor_name,\n                                             Device* device, Tensor* cpu_tensor,\n                                             StatusCallback done) {\n  \/\/std::cout<<\"\\nCopyDeviceTensorToCPU\\n\\n\";\n  std::cout<<\"\\n<\\n\";\n  GPUUtil::CopyGPUTensorToCPU(device, this, device_tensor, cpu_tensor, done);\n}\n\n}  \/\/ namespace tensorflow\n<commit_msg>modify 換行符號<commit_after>\/* Copyright 2015 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\/core\/common_runtime\/device.h\"\n#include \"tensorflow\/core\/common_runtime\/gpu\/gpu_util.h\"\n#include \"tensorflow\/core\/common_runtime\/gpu_device_context.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/platform\/stream_executor.h\"\n\nnamespace tensorflow {\n\nvoid GPUDeviceContext::CopyCPUTensorToDevice(const Tensor* cpu_tensor,\n                                             Device* device,\n                                             Tensor* device_tensor,\n                                             StatusCallback done) const {\n  \/\/std::cout<<\"\\nCopyCPUTensorToDevice\\n\\n\";\n  std::cout<<\">\\n\";\n  GPUUtil::CopyCPUTensorToGPU(cpu_tensor, this, device, device_tensor, done);\n}\n\nvoid GPUDeviceContext::CopyDeviceTensorToCPU(const Tensor* device_tensor,\n                                             StringPiece tensor_name,\n                                             Device* device, Tensor* cpu_tensor,\n                                             StatusCallback done) {\n  \/\/std::cout<<\"\\nCopyDeviceTensorToCPU\\n\\n\";\n  std::cout<<\"<\\n\";\n  GPUUtil::CopyGPUTensorToCPU(device, this, device_tensor, cpu_tensor, done);\n}\n\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\/\n\/* googledata.h \t\t\t\t\t\t       *\/\n\/* \t\t\t\t\t\t\t\t       *\/\n\/* Copyright (C) 2009  Adenilson Cavalcanti <savagobr@yahoo.com>       *\/\n\/* \t\t\t\t\t\t\t\t       *\/\n\/* This library is free software; you can redistribute it and\/or       *\/\n\/* modify it under the terms of the GNU Lesser General Public\t       *\/\n\/* License as published by the Free Software Foundation; either\t       *\/\n\/* version 2.1 of the License, or (at your option) any later version.  *\/\n\/*   \t\t\t\t\t\t\t\t       *\/\n\/* This library is distributed in the hope that it will be 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.\t\t       *\/\n\/*  \t\t\t\t\t\t\t\t       *\/\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       *\/\n\/* 02110-1301  USA\t\t\t\t\t\t       *\/\n\/***********************************************************************\/\n\n#include \"dlgGoogleDataConf.h\"\n#include <QPushButton>\n\ndlgGoogleDataConf::dlgGoogleDataConf(QWidget *parent): QDialog(parent)\n{\n\tsetupUi(this);\n\n\tconnect(buttonBox, SIGNAL(accepted()), this, SLOT(accept()));\n\tconnect(buttonBox, SIGNAL(rejected()), this, SLOT(reject()));\n        connect(eAccount, SIGNAL(textChanged ( const QString &)),this,SLOT(accountChanged(const QString&)));\n        accountChanged(eAccount->text());\n}\n\nvoid dlgGoogleDataConf::accountChanged(const QString& text)\n{\n        buttonBox->button(QDialogButtonBox::Ok)->setEnabled(!text.isEmpty());\n}\n<commit_msg>Normalize signals\/slots<commit_after>\/***********************************************************************\/\n\/* googledata.h \t\t\t\t\t\t       *\/\n\/* \t\t\t\t\t\t\t\t       *\/\n\/* Copyright (C) 2009  Adenilson Cavalcanti <savagobr@yahoo.com>       *\/\n\/* \t\t\t\t\t\t\t\t       *\/\n\/* This library is free software; you can redistribute it and\/or       *\/\n\/* modify it under the terms of the GNU Lesser General Public\t       *\/\n\/* License as published by the Free Software Foundation; either\t       *\/\n\/* version 2.1 of the License, or (at your option) any later version.  *\/\n\/*   \t\t\t\t\t\t\t\t       *\/\n\/* This library is distributed in the hope that it will be 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.\t\t       *\/\n\/*  \t\t\t\t\t\t\t\t       *\/\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       *\/\n\/* 02110-1301  USA\t\t\t\t\t\t       *\/\n\/***********************************************************************\/\n\n#include \"dlgGoogleDataConf.h\"\n#include <QPushButton>\n\ndlgGoogleDataConf::dlgGoogleDataConf(QWidget *parent): QDialog(parent)\n{\n\tsetupUi(this);\n\n\tconnect(buttonBox, SIGNAL(accepted()), this, SLOT(accept()));\n\tconnect(buttonBox, SIGNAL(rejected()), this, SLOT(reject()));\n        connect(eAccount, SIGNAL(textChanged(QString)),this,SLOT(accountChanged(QString)));\n        accountChanged(eAccount->text());\n}\n\nvoid dlgGoogleDataConf::accountChanged(const QString& text)\n{\n        buttonBox->button(QDialogButtonBox::Ok)->setEnabled(!text.isEmpty());\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SIGMA_SHADER_TECHNIQUE_COMPILER_HPP\n#define SIGMA_SHADER_TECHNIQUE_COMPILER_HPP\n\n#include <sigma\/graphics\/shader_technique.hpp>\n\n#include <json\/json-forwards.h>\n\nnamespace sigma {\ntemplate <class T>\nvoid compile_shader_technique(T& technique, const Json::Value& technique_data)\n{\n    for (auto it = technique_data.begin(); it != technique_data.end(); ++it) {\n        const auto& value = *it;\n        if (it.key() == \"vertex\") {\n            technique.shaders[sigma::graphics::shader_type::vertex] = sigma::resource::identifier{ \"vertex\", value.asString() }; \/\/ TODO warn if tring to set shader more that once\n        } else if (it.key() == \"fragment\") {\n            technique.shaders[sigma::graphics::shader_type::fragment] = sigma::resource::identifier{ \"fragment\", value.asString() }; \/\/ TODO warn if tring to set shader more that once\n        } else if (it.key() == \"geometry\") {\n            technique.shaders[sigma::graphics::shader_type::geometry] = sigma::resource::identifier{ \"geometry\", value.asString() }; \/\/ TODO warn if tring to set shader more that once\n        } else if (it.key() == \"textures\") {\n            const auto& texture_object = *it;\n            for (auto it2 = texture_object.begin(); it2 != texture_object.end(); ++it2)\n                technique.textures[it2.key().asString()] = sigma::resource::identifier{ \"texture\", (*it2).asString() }; \/\/ TODO warn if tring to set texture more than once\n        } else if (it.key() == \"cubemaps\") {\n            const auto& cubemap_object = *it;\n            for (auto it2 = cubemap_object.begin(); it2 != cubemap_object.end(); ++it2)\n                technique.cubemaps[it2.key().asString()] = sigma::resource::identifier{ \"cubemap\", (*it2).asString() }; \/\/ TODO warn if tring to set cubemap more than once\n        }\n    }\n\n    \/\/ TODO check for errors like no vertex or fragment shader\n}\n}\n\n#endif \/\/ SIGMA_SHADER_TECHNIQUE_COMPILER_HPP\n<commit_msg>Include fix.<commit_after>#ifndef SIGMA_SHADER_TECHNIQUE_COMPILER_HPP\n#define SIGMA_SHADER_TECHNIQUE_COMPILER_HPP\n\n#include <sigma\/graphics\/shader_technique.hpp>\n\n#include <json\/json.h>\n\nnamespace sigma {\ntemplate <class T>\nvoid compile_shader_technique(T& technique, const Json::Value& technique_data)\n{\n    for (auto it = technique_data.begin(); it != technique_data.end(); ++it) {\n        const auto& value = *it;\n        if (it.key() == \"vertex\") {\n            technique.shaders[sigma::graphics::shader_type::vertex] = sigma::resource::identifier{ \"vertex\", value.asString() }; \/\/ TODO warn if tring to set shader more that once\n        } else if (it.key() == \"fragment\") {\n            technique.shaders[sigma::graphics::shader_type::fragment] = sigma::resource::identifier{ \"fragment\", value.asString() }; \/\/ TODO warn if tring to set shader more that once\n        } else if (it.key() == \"geometry\") {\n            technique.shaders[sigma::graphics::shader_type::geometry] = sigma::resource::identifier{ \"geometry\", value.asString() }; \/\/ TODO warn if tring to set shader more that once\n        } else if (it.key() == \"textures\") {\n            const auto& texture_object = *it;\n            for (auto it2 = texture_object.begin(); it2 != texture_object.end(); ++it2)\n                technique.textures[it2.key().asString()] = sigma::resource::identifier{ \"texture\", (*it2).asString() }; \/\/ TODO warn if tring to set texture more than once\n        } else if (it.key() == \"cubemaps\") {\n            const auto& cubemap_object = *it;\n            for (auto it2 = cubemap_object.begin(); it2 != cubemap_object.end(); ++it2)\n                technique.cubemaps[it2.key().asString()] = sigma::resource::identifier{ \"cubemap\", (*it2).asString() }; \/\/ TODO warn if tring to set cubemap more than once\n        }\n    }\n\n    \/\/ TODO check for errors like no vertex or fragment shader\n}\n}\n\n#endif \/\/ SIGMA_SHADER_TECHNIQUE_COMPILER_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012-2016 soymuchacho <guqi_282@126.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 * 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. 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\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT\n * NOT 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 OF\n * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * > LIBSHARED  VERSION \t\t:\t\t0.0.1 \n * > File Name\t\t\t\t\t:\t\tObjectMgr.hpp\n * > Author\t\t\t\t\t\t:\t\tsoymuchacho\n * > Created Time\t\t\t\t:\t\t2015-10\n * > brief\t\t\t\t\t\t:\t\t\n *\n * *\/\n\n#ifndef UTILITY_OBJECT_MGR_H\n#define UTILITY_OBJECT_MGR_H\n\n#include <tr1\/memory>\n#include <ext\/hash_map>\n#include <base\/Mutex.h>\n#include <network\/MemoryPool.h>\n\nnamespace Shared\n{\n\nnamespace Utility\n{\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\t@brief\t管理集合：用于对象管理。\n\/\/\t\t\t线程安全, 不可重入，重入会造成死锁\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<class Key,class Value>\nclass ObjectMgr\n{\npublic:\n\tObjectMgr(){\n\t\n\t}\n\tvirtual ~ObjectMgr(){\n\t\n\t}\npublic:\n\t\/\/ Typdef\n\ttypedef std::tr1::shared_ptr<Value> value_sptr;\n\ttypedef typename __gnu_cxx::hash_map<Key,value_sptr>::iterator Iterator;\npublic:\n\t\/**\n\t *\t@brief 向集合中添加一个对象。\n\t *\n\t *\t@param k\t[in] 关键字\n\t *\t@param val\t[in] 对象指针，该指针必须是由\n\t *\t\t\t\t\t 系统堆分配的内存。如果是\n\t *\t\t\t\t\t 本库的内存池分配，请使用\n\t *\t\t\t\t\t 楼下函数。\n\t *\t@param isUseSP [in] 是否使用了libshared库的内存池（memorypool）\n\t *\t\t\t\t\t\t默认为不使用，如若使用，请设置为true。\n\t *\n\t *\t@return true\t添加成功\n\t *\t\t\tfalse\t添加失败\n\t *\n\t **\/\n\tbool Append(Key k,Value * v,bool isUseMP = false)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\n\t\tvalue_sptr val;\n\n\t\tif(isUseMP)\n\t\t\tval.reset(v,SHARED_DELETE<Value>());\n\t\telse\n\t\t\tval.reset(v);\n\t\t\n\t\tIterator itr = m_objmap.find(k);\t\n\t\t\n\t\tif(itr != m_objmap.end())\n\t\t\treturn false;\t\n\t\telse\n\t\t{\n\t\t\tm_objmap.insert(make_pair(k,val));\t\n\t\t}\n\t\treturn true;\n\t}\n\t\n\t\/\/ 从管理集合中获取一个对象\n\tbool Get(Key k,value_sptr& sptr)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\t\n\t\tIterator itr = m_objmap.find(k);\n\t\t\n\t\tif(itr != m_objmap.end())\n\t\t{\n\t\t\tsptr = itr->second;\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t\/\/ 从管理集合中取出一个对象\n\tbool Fetch(Key k, value_sptr& sptr)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\t\n\t\tIterator itr = m_objmap.find(k);\n\n\t\tif(itr == m_objmap.end())\n\t\t\treturn false;\n\t\t\n\t\tsptr = itr->second;\n\t\tm_objmap.erase(itr);\t\n\t\t\n\t\treturn true;\n\t}\n\n\t\/\/ 将对象从管理集合中移除\n\tbool Remove(Key k)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\t\n\t\tIterator itr = m_objmap.find(k);\n\t\t\n\t\tif(itr == m_objmap.end())\n\t\t\treturn false;\n\t\t\n\t\titr->second.reset();\n\t\tm_objmap.erase(itr);\n\t\t\n\t\treturn true;\n\t}\n\n\t\/\/ 清除所有对象\n\tvoid Clear()\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\tIterator itr;\n\t\tfor(itr = m_objmap.begin(); itr != m_objmap.end(); )\n\t\t{\n\t\t\titr->second.reset();\n\t\t\tm_objmap.erase(itr++);\n\t\t}\n\t}\nprivate:\n\tmutable Mutex m_mutex;\t\/\/ 锁\n\t\/\/ hash map使用key和智能指针\n\t__gnu_cxx::hash_map<Key,value_sptr> m_objmap;\n};\n\n}\/\/ END NAMESPACE UTILITY\n\n}\/\/ END NAMESPACE SHARED\n#endif\n<commit_msg>增加遍历函数<commit_after>\/*\n * Copyright (c) 2012-2016 soymuchacho <guqi_282@126.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 * 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. 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\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT\n * NOT 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 OF\n * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * > LIBSHARED  VERSION \t\t:\t\t0.0.1 \n * > File Name\t\t\t\t\t:\t\tObjectMgr.hpp\n * > Author\t\t\t\t\t\t:\t\tsoymuchacho\n * > Created Time\t\t\t\t:\t\t2015-10\n * > brief\t\t\t\t\t\t:\t\t\n *\n * *\/\n\n#ifndef UTILITY_OBJECT_MGR_H\n#define UTILITY_OBJECT_MGR_H\n\n#include <tr1\/memory>\n#include <ext\/hash_map>\n#include <base\/Mutex.h>\n#include <network\/MemoryPool.h>\n#include <functional>\n\nnamespace Shared\n{\n\nnamespace Utility\n{\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\t@brief\t管理集合：用于对象管理。\n\/\/\t\t\t线程安全, 不可重入，重入会造成死锁\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<class Key,class Value>\nclass ObjectMgr\n{\npublic:\n\tObjectMgr(){\n\t\n\t}\n\tvirtual ~ObjectMgr(){\n\t\n\t}\npublic:\n\t\/\/ Typdef\n\ttypedef std::tr1::shared_ptr<Value> value_sptr;\n\ttypedef typename __gnu_cxx::hash_map<Key,value_sptr>::iterator Iterator;\npublic:\n\t\/**\n\t *\t@brief 向集合中添加一个对象。\n\t *\n\t *\t@param k\t[in] 关键字\n\t *\t@param val\t[in] 对象指针，该指针必须是由\n\t *\t\t\t\t\t 系统堆分配的内存。如果是\n\t *\t\t\t\t\t 本库的内存池分配，请使用\n\t *\t\t\t\t\t 楼下函数。\n\t *\t@param isUseSP [in] 是否使用了libshared库的内存池（memorypool）\n\t *\t\t\t\t\t\t默认为不使用，如若使用，请设置为true。\n\t *\n\t *\t@return true\t添加成功\n\t *\t\t\tfalse\t添加失败\n\t *\n\t **\/\n\tbool Append(Key k,Value * v,bool isUseMP = false)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\n\t\tvalue_sptr val;\n\t\n\t\t\/\/ 返回失败\n\t\tif(isUseMP)\n\t\t\tval.reset(v,SHARED_DELETE<Value>());\n\t\telse\n\t\t\tval.reset(v);\n\t\t\n\t\tIterator itr = m_objmap.find(k);\t\n\t\t\n\t\tif(itr != m_objmap.end())\n\t\t\treturn false;\t\n\t\telse\n\t\t{\n\t\t\tm_objmap.insert(make_pair(k,val));\t\n\t\t}\n\t\treturn true;\n\t}\n\t\n\t\/\/ 从管理集合中获取一个对象\n\tbool Get(Key k,value_sptr& sptr)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\t\n\t\tIterator itr = m_objmap.find(k);\n\t\t\n\t\tif(itr != m_objmap.end())\n\t\t{\n\t\t\tsptr = itr->second;\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t\/\/ 从管理集合中取出一个对象\n\tbool Fetch(Key k, value_sptr& sptr)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\t\n\t\tIterator itr = m_objmap.find(k);\n\n\t\tif(itr == m_objmap.end())\n\t\t\treturn false;\n\t\t\n\t\tsptr = itr->second;\n\t\tm_objmap.erase(itr);\t\n\t\t\n\t\treturn true;\n\t}\n\n\t\/\/ 将对象从管理集合中移除\n\tbool Remove(Key k)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\t\n\t\tIterator itr = m_objmap.find(k);\n\t\t\n\t\tif(itr == m_objmap.end())\n\t\t\treturn false;\n\t\t\n\t\titr->second.reset();\n\t\tm_objmap.erase(itr);\n\t\t\n\t\treturn true;\n\t}\n\n\t\/\/ 清除所有对象\n\tvoid Clear()\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\tIterator itr;\n\t\tfor(itr = m_objmap.begin(); itr != m_objmap.end(); )\n\t\t{\n\t\t\titr->second.reset();\n\t\t\tm_objmap.erase(itr++);\n\t\t}\n\t}\npublic:\n\t\/**< @brief 遍历，传入回调函数 >*\/\n\tvoid Travalcall(std::function<bool (Key,value_sptr)> callback)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\n\t\tIterator itr;\n\t\tfor(itr = m_objmap.begin(); itr != m_objmap.end(); itr++)\n\t\t{\n\t\t\tif(callback(itr->first,itr->second))\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\treturn ;\n\t\t}\n\t}\n\t\n\ttemplate<class P1>\n\tvoid Travalcall(std::function<bool (Key,value_sptr,P1)> callback,P1 p1)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\t\n\t\tIterator itr;\n\t\tfor(itr = m_objmap.begin(); itr != m_objmap.end(); itr++)\n\t\t{\n\t\t\tif(callback(itr->first,itr->second,p1))\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\treturn ;\n\t\t}\n\t}\n\n\ttemplate<class P1,class P2>\n\tvoid Travalcall(std::function<void (Key,value_sptr,P1)> callback,P1 p1,P2 p2)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\t\n\t\tIterator itr;\n\t\tfor(itr = m_objmap.begin(); itr != m_objmap.end(); itr++)\n\t\t{\n\t\t\tif(callback(itr->first,itr->second,p1,p2))\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\treturn ;\n\t\t}\n\t}\n\n\n\ttemplate<class P1,class P2,class P3>\n\tvoid Travalcall(std::function<void (Key,value_sptr,P1,P2,P3)> callback,P1 p1, P2 p2,P3 p3)\n\t{\n\t\tMutexLockGuard lock(&m_mutex);\t\n\t\tIterator itr;\n\t\tfor(itr = m_objmap.begin(); itr != m_objmap.end(); itr++)\n\t\t{\n\t\t\tif(callback(itr->first,itr->second,p1,p2,p3))\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\treturn ;\n\t\t}\n\t}\nprivate:\n\tmutable Mutex m_mutex;\t\/\/ 锁\n\t\/\/ hash map使用key和智能指针\n\t__gnu_cxx::hash_map<Key,value_sptr> m_objmap;\n};\n\n}\/\/ END NAMESPACE UTILITY\n\n}\/\/ END NAMESPACE SHARED\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"instanciate.h\"\n\nusing namespace Yuni;\n\n\n\n\nnamespace Nany\n{\nnamespace Pass\n{\nnamespace Instanciate\n{\n\n\n\tnamespace \/\/ anonymous\n\t{\n\n\t\tvoid pragmaBodyStart(SequenceBuilder& seq)\n\t\t{\n\t\t\tassert(seq.frame != nullptr);\n\t\t\tassert(not seq.signatureOnly);\n\t\t\tassert(seq.codeGenerationLock == 0 and \"any good reason to not generate code ?\");\n\t\t\tassert(seq.out != nullptr and \"no output IR sequence\");\n\n\t\t\tauto& frame = *seq.frame;\n\t\t\tauto& atom = frame.atom;\n\t\t\tif (not atom.isFunction())\n\t\t\t\treturn;\n\n\t\t\tbool generateCode = seq.canGenerateCode();\n\t\t\tuint32_t count = atom.parameters.size();\n\n\t\t\tatom.parameters.each([&](uint32_t i, const AnyString& name, const Vardef& vardef)\n\t\t\t{\n\t\t\t\t\/\/ lvid for the given parameter\n\t\t\t\tuint32_t lvid  = i + 1 + 1; \/\/ 1: return type, 2: first parameter\n\t\t\t\tassert(lvid < frame.lvids.size());\n\t\t\t\t\/\/ Obviously, the parameters are not synthetic objects\n\t\t\t\t\/\/ but real variables\n\t\t\t\tframe.lvids[lvid].synthetic = false;\n\n\t\t\t\t\/\/\n\t\t\t\t\/\/ Parameters Deep copy (if required)\n\t\t\t\t\/\/\n\t\t\t\tif (name[0] != '^')\n\t\t\t\t{\n\t\t\t\t\t\/\/ normal input parameter (not captured - does not start with '^')\n\t\t\t\t\t\/\/ clone it if necessary (only non-ref parameters)\n\n\t\t\t\t\tif (not seq.cdeftable.classdef(vardef.clid).qualifiers.ref)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (debugmode and generateCode)\n\t\t\t\t\t\t\tseq.out->emitComment(String{\"----- deep copy parameter \"} << i << \" aka \" << name);\n\n\t\t\t\t\t\t\/\/ a register has already been reserved for cloning parameters\n\t\t\t\t\t\tuint32_t clone = 2 + count + i; \/\/ 1: return type, 2: first parameter\n\t\t\t\t\t\tassert(clone < frame.lvids.size());\n\t\t\t\t\t\t\/\/ the new value is not synthetic\n\t\t\t\t\t\tframe.lvids[clone].synthetic = false;\n\n\t\t\t\t\t\tbool r = seq.instanciateAssignment(frame, clone, lvid, false, false, true);\n\t\t\t\t\t\tif (unlikely(not r))\n\t\t\t\t\t\t\tframe.invalidate(clone);\n\n\t\t\t\t\t\tif (seq.canBeAcquired(lvid))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tframe.lvids[lvid].autorelease = true;\n\t\t\t\t\t\t\tframe.lvids[clone].autorelease = false;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (generateCode)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tseq.out->emitStore(lvid, clone); \/\/ register swap\n\t\t\t\t\t\t\tif (debugmode)\n\t\t\t\t\t\t\t\tseq.out->emitComment(\"--\\n\");\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\t\/\/ generating some code on the fly\n\t\t\tif (atom.isSpecial() \/*ctor, operators...*\/ and generateCode)\n\t\t\t{\n\t\t\t\t\/\/ variables initialization (for a ctor)\n\t\t\t\tif (seq.generateClassVarsAutoInit)\n\t\t\t\t{\n\t\t\t\t\tseq.generateClassVarsAutoInit = false;\n\t\t\t\t\tseq.generateMemberVarDefaultInitialization();\n\t\t\t\t}\n\n\t\t\t\t\/\/ variables destruction (for dtor)\n\t\t\t\tif (seq.generateClassVarsAutoRelease)\n\t\t\t\t{\n\t\t\t\t\tseq.generateClassVarsAutoRelease = false;\n\t\t\t\t\tseq.generateMemberVarDefaultDispose();\n\t\t\t\t}\n\n\t\t\t\t\/\/ variables cloning (copy a ctor)\n\t\t\t\tif (seq.generateClassVarsAutoClone)\n\t\t\t\t{\n\t\t\t\t\tseq.generateClassVarsAutoClone = false;\n\t\t\t\t\tseq.generateMemberVarDefaultClone();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\tvoid pragmaCodegen(SequenceBuilder& seq, bool onoff)\n\t\t{\n\t\t\tauto& refcount = seq.codeGenerationLock;\n\t\t\tif (onoff)\n\t\t\t{\n\t\t\t\tif (refcount > 0) \/\/ re-enable code generation\n\t\t\t\t\t--refcount;\n\t\t\t}\n\t\t\telse\n\t\t\t\t++refcount;\n\t\t}\n\n\n\t} \/\/ anonymous namespace\n\n\n\n\n\tvoid SequenceBuilder::visit(const IR::ISA::Operand<IR::ISA::Op::pragma>& operands)\n\t{\n\t\tassert(static_cast<uint32_t>(operands.pragma) < IR::ISA::PragmaCount);\n\n\t\tauto pragma = static_cast<IR::ISA::Pragma>(operands.pragma);\n\t\tswitch (pragma)\n\t\t{\n\t\t\tcase IR::ISA::Pragma::codegen:\n\t\t\t{\n\t\t\t\tpragmaCodegen(*this, operands.value.codegen != 0);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase IR::ISA::Pragma::bodystart:\n\t\t\t{\n\t\t\t\t\/\/ In 'signature only' mode, we only care about the\n\t\t\t\t\/\/ parameter user types. Everything from this point in unrelevant\n\t\t\t\tif (signatureOnly)\n\t\t\t\t\tcurrentSequence.invalidateCursor(*cursor);\n\t\t\t\telse\n\t\t\t\t\tpragmaBodyStart(*this); \/\/ params deep copy, implicit var auto-init...\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::blueprintsize:\n\t\t\t{\n\t\t\t\tif (0 == layerDepthLimit)\n\t\t\t\t{\n\t\t\t\t\t\/\/ ignore the current blueprint\n\t\t\t\t\t\/\/*cursor += operands.value.blueprintsize;\n\t\t\t\t\tassert(frame != nullptr);\n\t\t\t\t\tassert(frame->offsetOpcodeBlueprint != (uint32_t) -1);\n\t\t\t\t\tauto startOffset = frame->offsetOpcodeBlueprint;\n\t\t\t\t\tuint32_t count = operands.value.blueprintsize;\n\n\t\t\t\t\tif (unlikely(count < 3))\n\t\t\t\t\t{\n\t\t\t\t\t\tice() << \"invalid blueprint size when instanciating atom\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ goto the end of the blueprint\n\t\t\t\t\t\/\/ -2: the final 'end' opcode must be interpreted\n\t\t\t\t\t*cursor = &currentSequence.at(startOffset + count - 1 - 1);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::visibility:\n\t\t\t{\n\t\t\t\tassert(frame != nullptr);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::shortcircuitOpNopOffset:\n\t\t\t{\n\t\t\t\tshortcircuit.label = operands.value.shortcircuitMetadata.label;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::shortcircuitMutateToBool:\n\t\t\t{\n\t\t\t\tuint32_t lvid = operands.value.shortcircuitMutate.lvid;\n\t\t\t\tuint32_t source = operands.value.shortcircuitMutate.source;\n\n\t\t\t\tframe->lvids[lvid].synthetic = false;\n\n\t\t\t\tif (true)\n\t\t\t\t{\n\t\t\t\t\tauto& instr = *(*cursor - 1);\n\t\t\t\t\tassert(instr.opcodes[0] == static_cast<uint32_t>(IR::ISA::Op::stackalloc));\n\t\t\t\t\tuint32_t sizeoflvid = instr.to<IR::ISA::Op::stackalloc>().lvid;\n\n\t\t\t\t\t\/\/ sizeof\n\t\t\t\t\tauto& atombool = *(cdeftable.atoms().core.object[nyt_bool]);\n\t\t\t\t\tout->emitSizeof(sizeoflvid, atombool.atomid);\n\n\t\t\t\t\tauto& opc = cdeftable.substitute(lvid);\n\t\t\t\t\topc.mutateToAtom(&atombool);\n\t\t\t\t\topc.qualifiers.ref = true;\n\n\t\t\t\t\t\/\/ ALLOC: memory allocation of the new temporary object\n\t\t\t\t\tout->emitMemalloc(lvid, sizeoflvid);\n\t\t\t\t\tout->emitRef(lvid);\n\t\t\t\t\tframe->lvids[lvid].autorelease = true;\n\t\t\t\t\t\/\/ reset the internal value of the object\n\t\t\t\t\tout->emitFieldset(source, \/*self*\/lvid, 0); \/\/ builtin\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tout->emitStore(lvid, source);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::synthetic:\n\t\t\t{\n\t\t\t\tuint32_t lvid = operands.value.synthetic.lvid;\n\t\t\t\tbool onoff = (operands.value.synthetic.onoff != 0);\n\t\t\t\tframe->lvids[lvid].synthetic = onoff;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::suggest:\n\t\t\tcase IR::ISA::Pragma::builtinalias:\n\t\t\tcase IR::ISA::Pragma::shortcircuit:\n\t\t\tcase IR::ISA::Pragma::unknown:\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\n\n\n\n\n} \/\/ namespace Instanciate\n} \/\/ namespace Pass\n} \/\/ namespace Nany\n<commit_msg>instanciate: isolated pragma blueprintsize<commit_after>#include \"instanciate.h\"\n\nusing namespace Yuni;\n\n\n\n\nnamespace Nany\n{\nnamespace Pass\n{\nnamespace Instanciate\n{\n\n\n\tnamespace \/\/ anonymous\n\t{\n\n\t\tvoid pragmaBodyStart(SequenceBuilder& seq)\n\t\t{\n\t\t\tassert(seq.frame != nullptr);\n\t\t\tassert(not seq.signatureOnly);\n\t\t\tassert(seq.codeGenerationLock == 0 and \"any good reason to not generate code ?\");\n\t\t\tassert(seq.out != nullptr and \"no output IR sequence\");\n\n\t\t\tauto& frame = *seq.frame;\n\t\t\tauto& atom = frame.atom;\n\t\t\tif (not atom.isFunction())\n\t\t\t\treturn;\n\n\t\t\tbool generateCode = seq.canGenerateCode();\n\t\t\tuint32_t count = atom.parameters.size();\n\n\t\t\tatom.parameters.each([&](uint32_t i, const AnyString& name, const Vardef& vardef)\n\t\t\t{\n\t\t\t\t\/\/ lvid for the given parameter\n\t\t\t\tuint32_t lvid  = i + 1 + 1; \/\/ 1: return type, 2: first parameter\n\t\t\t\tassert(lvid < frame.lvids.size());\n\t\t\t\t\/\/ Obviously, the parameters are not synthetic objects\n\t\t\t\t\/\/ but real variables\n\t\t\t\tframe.lvids[lvid].synthetic = false;\n\n\t\t\t\t\/\/\n\t\t\t\t\/\/ Parameters Deep copy (if required)\n\t\t\t\t\/\/\n\t\t\t\tif (name[0] != '^')\n\t\t\t\t{\n\t\t\t\t\t\/\/ normal input parameter (not captured - does not start with '^')\n\t\t\t\t\t\/\/ clone it if necessary (only non-ref parameters)\n\n\t\t\t\t\tif (not seq.cdeftable.classdef(vardef.clid).qualifiers.ref)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (debugmode and generateCode)\n\t\t\t\t\t\t\tseq.out->emitComment(String{\"----- deep copy parameter \"} << i << \" aka \" << name);\n\n\t\t\t\t\t\t\/\/ a register has already been reserved for cloning parameters\n\t\t\t\t\t\tuint32_t clone = 2 + count + i; \/\/ 1: return type, 2: first parameter\n\t\t\t\t\t\tassert(clone < frame.lvids.size());\n\t\t\t\t\t\t\/\/ the new value is not synthetic\n\t\t\t\t\t\tframe.lvids[clone].synthetic = false;\n\n\t\t\t\t\t\tbool r = seq.instanciateAssignment(frame, clone, lvid, false, false, true);\n\t\t\t\t\t\tif (unlikely(not r))\n\t\t\t\t\t\t\tframe.invalidate(clone);\n\n\t\t\t\t\t\tif (seq.canBeAcquired(lvid))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tframe.lvids[lvid].autorelease = true;\n\t\t\t\t\t\t\tframe.lvids[clone].autorelease = false;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (generateCode)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tseq.out->emitStore(lvid, clone); \/\/ register swap\n\t\t\t\t\t\t\tif (debugmode)\n\t\t\t\t\t\t\t\tseq.out->emitComment(\"--\\n\");\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\t\/\/ generating some code on the fly\n\t\t\tif (atom.isSpecial() \/*ctor, operators...*\/ and generateCode)\n\t\t\t{\n\t\t\t\t\/\/ variables initialization (for a ctor)\n\t\t\t\tif (seq.generateClassVarsAutoInit)\n\t\t\t\t{\n\t\t\t\t\tseq.generateClassVarsAutoInit = false;\n\t\t\t\t\tseq.generateMemberVarDefaultInitialization();\n\t\t\t\t}\n\n\t\t\t\t\/\/ variables destruction (for dtor)\n\t\t\t\tif (seq.generateClassVarsAutoRelease)\n\t\t\t\t{\n\t\t\t\t\tseq.generateClassVarsAutoRelease = false;\n\t\t\t\t\tseq.generateMemberVarDefaultDispose();\n\t\t\t\t}\n\n\t\t\t\t\/\/ variables cloning (copy a ctor)\n\t\t\t\tif (seq.generateClassVarsAutoClone)\n\t\t\t\t{\n\t\t\t\t\tseq.generateClassVarsAutoClone = false;\n\t\t\t\t\tseq.generateMemberVarDefaultClone();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\tvoid pragmaCodegen(SequenceBuilder& seq, bool onoff)\n\t\t{\n\t\t\tauto& refcount = seq.codeGenerationLock;\n\t\t\tif (onoff)\n\t\t\t{\n\t\t\t\tif (refcount > 0) \/\/ re-enable code generation\n\t\t\t\t\t--refcount;\n\t\t\t}\n\t\t\telse\n\t\t\t\t++refcount;\n\t\t}\n\n\n\t\tvoid pragmaBlueprintSize(SequenceBuilder& seq, uint32_t opcodeCount)\n\t\t{\n\t\t\tif (0 == seq.layerDepthLimit)\n\t\t\t{\n\t\t\t\t\/\/ ignore the current blueprint\n\t\t\t\t\/\/*cursor += operands.value.blueprintsize;\n\t\t\t\tassert(seq.frame != nullptr);\n\t\t\t\tassert(seq.frame->offsetOpcodeBlueprint != (uint32_t) -1);\n\t\t\t\tauto startOffset = seq.frame->offsetOpcodeBlueprint;\n\t\t\t\tif (unlikely(opcodeCount < 3))\n\t\t\t\t\treturn (void) (ice() << \"invalid blueprint size when instanciating atom\");\n\n\t\t\t\t\/\/ goto the end of the blueprint\n\t\t\t\t\/\/ -2: the final 'end' opcode must be interpreted\n\t\t\t\t*seq.cursor = &seq.currentSequence.at(startOffset + opcodeCount - 1 - 1);\n\t\t\t}\n\t\t}\n\n\n\t} \/\/ anonymous namespace\n\n\n\n\n\tvoid SequenceBuilder::visit(const IR::ISA::Operand<IR::ISA::Op::pragma>& operands)\n\t{\n\t\tassert(static_cast<uint32_t>(operands.pragma) < IR::ISA::PragmaCount);\n\n\t\tauto pragma = static_cast<IR::ISA::Pragma>(operands.pragma);\n\t\tswitch (pragma)\n\t\t{\n\t\t\tcase IR::ISA::Pragma::codegen:\n\t\t\t{\n\t\t\t\tpragmaCodegen(*this, operands.value.codegen != 0);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase IR::ISA::Pragma::bodystart:\n\t\t\t{\n\t\t\t\t\/\/ In 'signature only' mode, we only care about the\n\t\t\t\t\/\/ parameter user types. Everything from this point in unrelevant\n\t\t\t\tif (signatureOnly)\n\t\t\t\t\tcurrentSequence.invalidateCursor(*cursor);\n\t\t\t\telse\n\t\t\t\t\tpragmaBodyStart(*this); \/\/ params deep copy, implicit var auto-init...\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase IR::ISA::Pragma::blueprintsize:\n\t\t\t{\n\t\t\t\tpragmaBlueprintSize(*this, operands.value.blueprintsize);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::visibility:\n\t\t\t{\n\t\t\t\tassert(frame != nullptr);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::shortcircuitOpNopOffset:\n\t\t\t{\n\t\t\t\tshortcircuit.label = operands.value.shortcircuitMetadata.label;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::shortcircuitMutateToBool:\n\t\t\t{\n\t\t\t\tuint32_t lvid = operands.value.shortcircuitMutate.lvid;\n\t\t\t\tuint32_t source = operands.value.shortcircuitMutate.source;\n\n\t\t\t\tframe->lvids[lvid].synthetic = false;\n\n\t\t\t\tif (true)\n\t\t\t\t{\n\t\t\t\t\tauto& instr = *(*cursor - 1);\n\t\t\t\t\tassert(instr.opcodes[0] == static_cast<uint32_t>(IR::ISA::Op::stackalloc));\n\t\t\t\t\tuint32_t sizeoflvid = instr.to<IR::ISA::Op::stackalloc>().lvid;\n\n\t\t\t\t\t\/\/ sizeof\n\t\t\t\t\tauto& atombool = *(cdeftable.atoms().core.object[nyt_bool]);\n\t\t\t\t\tout->emitSizeof(sizeoflvid, atombool.atomid);\n\n\t\t\t\t\tauto& opc = cdeftable.substitute(lvid);\n\t\t\t\t\topc.mutateToAtom(&atombool);\n\t\t\t\t\topc.qualifiers.ref = true;\n\n\t\t\t\t\t\/\/ ALLOC: memory allocation of the new temporary object\n\t\t\t\t\tout->emitMemalloc(lvid, sizeoflvid);\n\t\t\t\t\tout->emitRef(lvid);\n\t\t\t\t\tframe->lvids[lvid].autorelease = true;\n\t\t\t\t\t\/\/ reset the internal value of the object\n\t\t\t\t\tout->emitFieldset(source, \/*self*\/lvid, 0); \/\/ builtin\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tout->emitStore(lvid, source);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::synthetic:\n\t\t\t{\n\t\t\t\tuint32_t lvid = operands.value.synthetic.lvid;\n\t\t\t\tbool onoff = (operands.value.synthetic.onoff != 0);\n\t\t\t\tframe->lvids[lvid].synthetic = onoff;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase IR::ISA::Pragma::suggest:\n\t\t\tcase IR::ISA::Pragma::builtinalias:\n\t\t\tcase IR::ISA::Pragma::shortcircuit:\n\t\t\tcase IR::ISA::Pragma::unknown:\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\n\n\n\n\n} \/\/ namespace Instanciate\n} \/\/ namespace Pass\n} \/\/ namespace Nany\n<|endoftext|>"}
{"text":"<commit_before>#include <cerrno>\n#include <iostream>\n\n#include <libport\/assert.hh>\n#include <libport\/exception.hh>\n#include <libport\/program-name.hh>\n#include <libport\/semaphore.hh>\n#include <libport\/sysexits.hh>\n#include <libport\/time.h>\n\n\/* Darwin doesn't implement sem_init\/sem_close (although the functions exists\n * and is defined, in fact it just returns ENOSYS). That's why we need to use\n * named semaphores (with sem_open) instead.\n * See:\n * http:\/\/lists.apple.com\/archives\/darwin-development\/2004\/May\/msg00077.html\n * http:\/\/www.google.com\/search?as_q=sem_init&as_sitesearch=apple.com\n *\n * Semaphores created with sem_open must be closed with sem_close.\n * Semaphores created with sem_init must be closed with sem_destroy.\n *\/\n#ifdef __APPLE__\n# include <fstream>\n# include <sstream>\n# include <sys\/stat.h>\n# include <sys\/time.h>\n# include <signal.h>\n#endif\n\nnamespace libport\n{\n\n  Semaphore::Semaphore(unsigned value)\n    : value_(value)\n  {\n# ifdef __APPLE__\n    static unsigned int counter = 0;\n    int sem_open_errno;\n\n    do\n    {\n      std::stringstream s;\n      errno = 0;\n      s << \"sema\/\" << getpid() << \"\/\" << counter++;\n      name_ = s.str();\n      sem_ = sem_open(name_.c_str(), O_CREAT | O_EXCL, 0777, value);\n      sem_open_errno = errno;\n    } while (sem_ == SEM_FAILED && errno == EEXIST);\n\n    {\n      \/\/ Save the semaphore name if we can, in order to provide the\n      \/\/ user with a means to reclaim them.  Don't check for success,\n      \/\/ this is best effort.\n      \/\/\n      \/\/ If you change this file name, update\n      \/\/ build-aux\/semaphores-clean.sh.\n      mkdir(\"\/tmp\/urbi-semaphores\", 0777);\n      std::stringstream f;\n      f << \"\/tmp\/urbi-semaphores\/\" << getpid();\n      std::ofstream o(f.str().c_str(), std::ios_base::app);\n      o << name_;\n      if (sem_ == SEM_FAILED)\n        o << \": \" << strerror(sem_open_errno);\n      o << std::endl;\n    }\n\n    if (sem_ == SEM_FAILED)\n    {\n      std::string error = strerror(sem_open_errno);\n      if (sem_open_errno == ENOSPC)\n        error += \" (i.e., used all the semaphores, run semaphore-clean)\";\n      \/\/ Certainly dying because we don't have enough semaphores\n      \/\/ available.  Report we should be skipped.\n      std::cerr << program_name()\n                << \": cannot sem_open(\" << name_ << \"): \"\n                << strerror(sem_open_errno)\n                << std::endl\n                << exit(EX_SKIP);\n    }\n# else\n    sem_ = new sem_t;\n    if (sem_init(sem_, 0, value))\n    {\n      destroy();\n      errabort(\"sem_init(\" << value << ')');\n    }\n# endif\n    ++instances_;\n  }\n\n  Semaphore::~Semaphore()\n  {\n    destroy();\n    --instances_;\n  }\n\n  size_t Semaphore::instances_ = 0;\n\n  size_t\n  Semaphore::instances()\n  {\n    return instances_;\n  }\n\n  void\n  Semaphore::destroy()\n  {\n# ifdef __APPLE__\n    \/\/ We *really* need to unlink the semaphores when we are done,\n    \/\/ otherwise they leak, and at some point, ENOSPCE is the only\n    \/\/ answer from the system.  I could not find a means to remove\n    \/\/ them from the shell (ipcs shows nothing), so I had to reboot my\n    \/\/ machine.\n    \/\/\n    \/\/ So really, try to call sem_unlink in all the cases, including\n    \/\/ aborts here.\n    \/\/\n    \/\/ http:\/\/lists.apple.com\/archives\/darwin-dev\/2005\/Jun\/msg00078.html\n    int c = sem_close(sem_);\n    int close_errno = errno;\n    int u = sem_unlink(name_.c_str());\n    int unlink_errno = errno;\n    if (c)\n    {\n      errno = close_errno;\n      errabort(\"sem_close\");\n    }\n    if (u)\n    {\n      errno = unlink_errno;\n      errabort(\"sem_unlink\");\n    }\n# else\n    if (sem_destroy(sem_))\n      errabort(\"sem_destroy\");\n    delete sem_;\n# endif\n  }\n\n\n  void\n  Semaphore::operator++()\n  {\n    if (sem_post(sem_))\n    {\n      destroy();\n      errabort(\"sem_post\");\n    }\n    ++value_;\n  }\n\n  void\n  Semaphore::operator--()\n  {\n    get(0);\n  }\n\n  Semaphore& Semaphore::operator-=(unsigned c)\n  {\n    for (unsigned i = 0; i < c; ++i)\n      --*this;\n    return *this;\n  }\n\n  Semaphore& Semaphore::operator+=(unsigned c)\n  {\n    for (unsigned i = 0; i < c; ++i)\n      ++*this;\n    return *this;\n  }\n\n# if defined __APPLE__\n\n  \/\/ On OSX there seems to be no means to timeout passively, so we\n  \/\/ launch a thread that will change the following flag when the time\n  \/\/ is out.\n  static bool time_is_out;\n\n  void fun_timeout(int)\n  {\n    time_is_out = true;\n  }\n\n# endif\n\n  bool\n  Semaphore::uget(utime_t useconds)\n  {\n    int err;\n    do\n    {\n      if (useconds == 0)\n        err = sem_wait(sem_);\n# if defined __APPLE__\n      else\n      {\n\tstruct itimerval it;\n\tit.it_interval.tv_sec = 0;\n\tit.it_interval.tv_usec = 0;\n\n\tit.it_value.tv_sec = useconds \/ 1000000;\n\tit.it_value.tv_usec = useconds % 1000000;\n\ttime_is_out = false;\n\tsignal(SIGALRM, fun_timeout);\n\tsetitimer(ITIMER_REAL, &it, NULL);\n\tdo\n\t{\n\t  err = sem_trywait(sem_);\n\t} while (!time_is_out && err == -1 && errno == EAGAIN);\n\tif (time_is_out)\n        {\n          \/\/ Match the interface under Linux.\n\t  err = -1;\n          errno = ETIMEDOUT;\n        }\n      }\n# else\n      else\n      {\n        struct timespec ts;\n\tif (clock_gettime(CLOCK_REALTIME, &ts))\n          errabort(\"clock_gettime\");\n\tts.tv_sec += useconds \/ 1000000;\n\tts.tv_nsec += (useconds % 1000000) * 1000;\n        err = sem_timedwait(sem_, &ts);\n      }\n# endif\n    }\n    while (err == -1 && errno == EINTR);\n\n    if (err)\n    {\n      if (errno == ETIMEDOUT)\n        return false;\n      destroy();\n      errabort(\"sem_wait\");\n    }\n\n    --value_;\n    return true;\n  }\n\n  bool\n  Semaphore::get(unsigned seconds)\n  {\n    return uget(seconds * 1000 * 1000);\n  }\n\n  Semaphore::operator int()\n  {\n#ifndef __APPLE__\n    int res;\n    if (sem_getvalue(sem_, &res))\n    {\n      destroy();\n      errabort(\"sem_getvalue\");\n    }\n    assert_eq(res, value_);\n#endif\n    return value_;\n  }\n\n} \/\/ namespace libport\n<commit_msg>libport: don't overflow timespec.<commit_after>#include <cerrno>\n#include <iostream>\n\n#include <libport\/assert.hh>\n#include <libport\/exception.hh>\n#include <libport\/program-name.hh>\n#include <libport\/semaphore.hh>\n#include <libport\/sysexits.hh>\n#include <libport\/time.h>\n\n\/* Darwin doesn't implement sem_init\/sem_close (although the functions exists\n * and is defined, in fact it just returns ENOSYS). That's why we need to use\n * named semaphores (with sem_open) instead.\n * See:\n * http:\/\/lists.apple.com\/archives\/darwin-development\/2004\/May\/msg00077.html\n * http:\/\/www.google.com\/search?as_q=sem_init&as_sitesearch=apple.com\n *\n * Semaphores created with sem_open must be closed with sem_close.\n * Semaphores created with sem_init must be closed with sem_destroy.\n *\/\n#ifdef __APPLE__\n# include <fstream>\n# include <sstream>\n# include <sys\/stat.h>\n# include <sys\/time.h>\n# include <signal.h>\n#endif\n\nnamespace libport\n{\n\n  Semaphore::Semaphore(unsigned value)\n    : value_(value)\n  {\n# ifdef __APPLE__\n    static unsigned int counter = 0;\n    int sem_open_errno;\n\n    do\n    {\n      std::stringstream s;\n      errno = 0;\n      s << \"sema\/\" << getpid() << \"\/\" << counter++;\n      name_ = s.str();\n      sem_ = sem_open(name_.c_str(), O_CREAT | O_EXCL, 0777, value);\n      sem_open_errno = errno;\n    } while (sem_ == SEM_FAILED && errno == EEXIST);\n\n    {\n      \/\/ Save the semaphore name if we can, in order to provide the\n      \/\/ user with a means to reclaim them.  Don't check for success,\n      \/\/ this is best effort.\n      \/\/\n      \/\/ If you change this file name, update\n      \/\/ build-aux\/semaphores-clean.sh.\n      mkdir(\"\/tmp\/urbi-semaphores\", 0777);\n      std::stringstream f;\n      f << \"\/tmp\/urbi-semaphores\/\" << getpid();\n      std::ofstream o(f.str().c_str(), std::ios_base::app);\n      o << name_;\n      if (sem_ == SEM_FAILED)\n        o << \": \" << strerror(sem_open_errno);\n      o << std::endl;\n    }\n\n    if (sem_ == SEM_FAILED)\n    {\n      std::string error = strerror(sem_open_errno);\n      if (sem_open_errno == ENOSPC)\n        error += \" (i.e., used all the semaphores, run semaphore-clean)\";\n      \/\/ Certainly dying because we don't have enough semaphores\n      \/\/ available.  Report we should be skipped.\n      std::cerr << program_name()\n                << \": cannot sem_open(\" << name_ << \"): \"\n                << strerror(sem_open_errno)\n                << std::endl\n                << exit(EX_SKIP);\n    }\n# else\n    sem_ = new sem_t;\n    if (sem_init(sem_, 0, value))\n    {\n      destroy();\n      errabort(\"sem_init(\" << value << ')');\n    }\n# endif\n    ++instances_;\n  }\n\n  Semaphore::~Semaphore()\n  {\n    destroy();\n    --instances_;\n  }\n\n  size_t Semaphore::instances_ = 0;\n\n  size_t\n  Semaphore::instances()\n  {\n    return instances_;\n  }\n\n  void\n  Semaphore::destroy()\n  {\n# ifdef __APPLE__\n    \/\/ We *really* need to unlink the semaphores when we are done,\n    \/\/ otherwise they leak, and at some point, ENOSPCE is the only\n    \/\/ answer from the system.  I could not find a means to remove\n    \/\/ them from the shell (ipcs shows nothing), so I had to reboot my\n    \/\/ machine.\n    \/\/\n    \/\/ So really, try to call sem_unlink in all the cases, including\n    \/\/ aborts here.\n    \/\/\n    \/\/ http:\/\/lists.apple.com\/archives\/darwin-dev\/2005\/Jun\/msg00078.html\n    int c = sem_close(sem_);\n    int close_errno = errno;\n    int u = sem_unlink(name_.c_str());\n    int unlink_errno = errno;\n    if (c)\n    {\n      errno = close_errno;\n      errabort(\"sem_close\");\n    }\n    if (u)\n    {\n      errno = unlink_errno;\n      errabort(\"sem_unlink\");\n    }\n# else\n    if (sem_destroy(sem_))\n      errabort(\"sem_destroy\");\n    delete sem_;\n# endif\n  }\n\n\n  void\n  Semaphore::operator++()\n  {\n    if (sem_post(sem_))\n    {\n      destroy();\n      errabort(\"sem_post\");\n    }\n    ++value_;\n  }\n\n  void\n  Semaphore::operator--()\n  {\n    get(0);\n  }\n\n  Semaphore& Semaphore::operator-=(unsigned c)\n  {\n    for (unsigned i = 0; i < c; ++i)\n      --*this;\n    return *this;\n  }\n\n  Semaphore& Semaphore::operator+=(unsigned c)\n  {\n    for (unsigned i = 0; i < c; ++i)\n      ++*this;\n    return *this;\n  }\n\n# if defined __APPLE__\n\n  \/\/ On OSX there seems to be no means to timeout passively, so we\n  \/\/ launch a thread that will change the following flag when the time\n  \/\/ is out.\n  static bool time_is_out;\n\n  void fun_timeout(int)\n  {\n    time_is_out = true;\n  }\n\n# endif\n\n  bool\n  Semaphore::uget(utime_t useconds)\n  {\n    int err;\n    do\n    {\n      if (useconds == 0)\n        err = sem_wait(sem_);\n# if defined __APPLE__\n      else\n      {\n\tstruct itimerval it;\n\tit.it_interval.tv_sec = 0;\n\tit.it_interval.tv_usec = 0;\n\n\tit.it_value.tv_sec = useconds \/ 1000000;\n\tit.it_value.tv_usec = useconds % 1000000;\n\ttime_is_out = false;\n\tsignal(SIGALRM, fun_timeout);\n\tsetitimer(ITIMER_REAL, &it, NULL);\n\tdo\n\t{\n\t  err = sem_trywait(sem_);\n\t} while (!time_is_out && err == -1 && errno == EAGAIN);\n\tif (time_is_out)\n        {\n          \/\/ Match the interface under Linux.\n\t  err = -1;\n          errno = ETIMEDOUT;\n        }\n      }\n# else\n      else\n      {\n        struct timespec ts;\n        if (clock_gettime(CLOCK_REALTIME, &ts))\n          errabort(\"clock_gettime\");\n        ts.tv_sec += useconds \/ (1000 * 1000);\n        ts.tv_nsec += (useconds % (1000 * 1000)) * 1000;\n        \/\/ Respect the constrainsts.\n        ts.tv_sec += ts.tv_nsec \/ (1000 * 1000 * 1000);\n        ts.tv_nsec %= 1000 * 1000 * 1000;\n        err = sem_timedwait(sem_, &ts);\n      }\n# endif\n    }\n    while (err == -1 && errno == EINTR);\n\n    if (err)\n    {\n      if (errno == ETIMEDOUT)\n        return false;\n      destroy();\n      errabort(\"sem_wait\");\n    }\n\n    --value_;\n    return true;\n  }\n\n  bool\n  Semaphore::get(unsigned seconds)\n  {\n    return uget(seconds * 1000 * 1000);\n  }\n\n  Semaphore::operator int()\n  {\n#ifndef __APPLE__\n    int res;\n    if (sem_getvalue(sem_, &res))\n    {\n      destroy();\n      errabort(\"sem_getvalue\");\n    }\n    assert_eq(res, value_);\n#endif\n    return value_;\n  }\n\n} \/\/ namespace libport\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,\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#include <algorithm>\n#include <iostream>\n\n#include \"TSocketPool.h\"\n\nnamespace apache { namespace thrift { namespace transport {\n\nusing namespace std;\n\nusing boost::shared_ptr;\n\n\/**\n * TSocketPoolServer implementation\n *\n *\/\nTSocketPoolServer::TSocketPoolServer()\n  : host_(\"\"),\n    port_(0),\n    socket_(-1),\n    lastFailTime_(0),\n    consecutiveFailures_(0) {}\n\n\/**\n * Constructor for TSocketPool server\n *\/\nTSocketPoolServer::TSocketPoolServer(const string &host, int port)\n  : host_(host),\n    port_(port),\n    socket_(-1),\n    lastFailTime_(0),\n    consecutiveFailures_(0) {}\n\n\/**\n * TSocketPool implementation.\n *\n *\/\n\nTSocketPool::TSocketPool() : TSocket(),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true) {\n}\n\nTSocketPool::TSocketPool(const vector<string> &hosts,\n                         const vector<int> &ports) : TSocket(),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true)\n{\n  if (hosts.size() != ports.size()) {\n    GlobalOutput(\"TSocketPool::TSocketPool: hosts.size != ports.size\");\n    throw TTransportException(TTransportException::BAD_ARGS);\n  }\n\n  for (unsigned int i = 0; i < hosts.size(); ++i) {\n    addServer(hosts[i], ports[i]);\n  }\n}\n\nTSocketPool::TSocketPool(const vector<pair<string, int> >& servers) : TSocket(),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true)\n{\n  for (unsigned i = 0; i < servers.size(); ++i) {\n    addServer(servers[i].first, servers[i].second);\n  }\n}\n\nTSocketPool::TSocketPool(const vector< shared_ptr<TSocketPoolServer> >& servers) : TSocket(),\n  servers_(servers),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true)\n{\n}\n\nTSocketPool::TSocketPool(const string& host, int port) : TSocket(),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true)\n{\n  addServer(host, port);\n}\n\nTSocketPool::~TSocketPool() {\n  vector< shared_ptr<TSocketPoolServer> >::const_iterator iter = servers_.begin();\n  vector< shared_ptr<TSocketPoolServer> >::const_iterator iterEnd = servers_.end();\n  for (; iter != iterEnd; ++iter) {\n    setCurrentServer(*iter);\n    TSocketPool::close();\n  }\n}\n\nvoid TSocketPool::addServer(const string& host, int port) {\n  servers_.push_back(shared_ptr<TSocketPoolServer>(new TSocketPoolServer(host, port)));\n}\n\nvoid TSocketPool::addServer(shared_ptr<TSocketPoolServer> &server) {\n  if (server) {\n    servers_.push_back(server);\n  }\n}\n\nvoid TSocketPool::setServers(const vector< shared_ptr<TSocketPoolServer> >& servers) {\n  servers_ = servers;\n}\n\nvoid TSocketPool::getServers(vector< shared_ptr<TSocketPoolServer> >& servers) {\n  servers = servers_;\n}\n\nvoid TSocketPool::setNumRetries(int numRetries) {\n  numRetries_ = numRetries;\n}\n\nvoid TSocketPool::setRetryInterval(int retryInterval) {\n  retryInterval_ = retryInterval;\n}\n\n\nvoid TSocketPool::setMaxConsecutiveFailures(int maxConsecutiveFailures) {\n  maxConsecutiveFailures_ = maxConsecutiveFailures;\n}\n\nvoid TSocketPool::setRandomize(bool randomize) {\n  randomize_ = randomize;\n}\n\nvoid TSocketPool::setAlwaysTryLast(bool alwaysTryLast) {\n  alwaysTryLast_ = alwaysTryLast;\n}\n\nvoid TSocketPool::setCurrentServer(const shared_ptr<TSocketPoolServer> &server) {\n  currentServer_ = server;\n  host_ = server->host_;\n  port_ = server->port_;\n  socket_ = server->socket_;\n}\n\n\/**\n * This function throws an exception if socket open fails. When socket\n * opens fails, the socket in the current server is reset.\n *\/\n\/* TODO: without apc we ignore a lot of functionality from the php version *\/\nvoid TSocketPool::open() {\n\n  size_t numServers = servers_.size();\n  if (numServers == 0) {\n    socket_ = -1;\n    throw TTransportException(TTransportException::NOT_OPEN);\n  }\n\n  if (isOpen()) {\n    return;\n  }\n\n  if (randomize_ && numServers > 1) {\n    random_shuffle(servers_.begin(), servers_.end());\n  }\n\n  for (size_t i = 0; i < numServers; ++i) {\n\n    shared_ptr<TSocketPoolServer> &server = servers_[i];\n    \/\/ Impersonate the server socket\n    setCurrentServer(server);\n\n    if (isOpen()) {\n      \/\/ already open means we're done\n      return;\n    }\n\n    bool retryIntervalPassed = (server->lastFailTime_ == 0);\n    bool isLastServer = alwaysTryLast_ ? (i == (numServers - 1)) : false;\n\n    if (server->lastFailTime_ > 0) {\n      \/\/ The server was marked as down, so check if enough time has elapsed to retry\n      time_t elapsedTime = time(NULL) - server->lastFailTime_;\n      if (elapsedTime > retryInterval_) {\n        retryIntervalPassed = true;\n      }\n    }\n\n    if (retryIntervalPassed || isLastServer) {\n      for (int j = 0; j < numRetries_; ++j) {\n        try {\n          TSocket::open();\n        } catch (TException e) {\n          string errStr = \"TSocketPool::open failed \"+getSocketInfo()+\": \"+e.what();\n          GlobalOutput(errStr.c_str());\n          socket_ = -1;\n          continue;\n        }\n\n        \/\/ Copy over the opened socket so that we can keep it persistent\n        server->socket_ = socket_;\n        \/\/ reset lastFailTime_ is required\n        server->lastFailTime_ = 0;\n        \/\/ success\n        return;\n      }\n\n      ++server->consecutiveFailures_;\n      if (server->consecutiveFailures_ > maxConsecutiveFailures_) {\n        \/\/ Mark server as down\n        server->consecutiveFailures_ = 0;\n        server->lastFailTime_ = time(NULL);\n      }\n    }\n  }\n\n  GlobalOutput(\"TSocketPool::open: all connections failed\");\n  throw TTransportException(TTransportException::NOT_OPEN);\n}\n\nvoid TSocketPool::close() {\n  TSocket::close();\n  if (currentServer_) {\n    currentServer_->socket_ = -1;\n  }\n}\n\n}}} \/\/ apache::thrift::transport\n<commit_msg>THRIFT-1744: Compilation failure under Android NDK toolchain Client: C++ and Android NDK Patch: Vlad Troyanker<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,\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#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <algorithm>\n#include <iostream>\n\n#include \"TSocketPool.h\"\n\nnamespace apache { namespace thrift { namespace transport {\n\nusing namespace std;\n\nusing boost::shared_ptr;\n\n\/**\n * TSocketPoolServer implementation\n *\n *\/\nTSocketPoolServer::TSocketPoolServer()\n  : host_(\"\"),\n    port_(0),\n    socket_(-1),\n    lastFailTime_(0),\n    consecutiveFailures_(0) {}\n\n\/**\n * Constructor for TSocketPool server\n *\/\nTSocketPoolServer::TSocketPoolServer(const string &host, int port)\n  : host_(host),\n    port_(port),\n    socket_(-1),\n    lastFailTime_(0),\n    consecutiveFailures_(0) {}\n\n\/**\n * TSocketPool implementation.\n *\n *\/\n\nTSocketPool::TSocketPool() : TSocket(),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true) {\n}\n\nTSocketPool::TSocketPool(const vector<string> &hosts,\n                         const vector<int> &ports) : TSocket(),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true)\n{\n  if (hosts.size() != ports.size()) {\n    GlobalOutput(\"TSocketPool::TSocketPool: hosts.size != ports.size\");\n    throw TTransportException(TTransportException::BAD_ARGS);\n  }\n\n  for (unsigned int i = 0; i < hosts.size(); ++i) {\n    addServer(hosts[i], ports[i]);\n  }\n}\n\nTSocketPool::TSocketPool(const vector<pair<string, int> >& servers) : TSocket(),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true)\n{\n  for (unsigned i = 0; i < servers.size(); ++i) {\n    addServer(servers[i].first, servers[i].second);\n  }\n}\n\nTSocketPool::TSocketPool(const vector< shared_ptr<TSocketPoolServer> >& servers) : TSocket(),\n  servers_(servers),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true)\n{\n}\n\nTSocketPool::TSocketPool(const string& host, int port) : TSocket(),\n  numRetries_(1),\n  retryInterval_(60),\n  maxConsecutiveFailures_(1),\n  randomize_(true),\n  alwaysTryLast_(true)\n{\n  addServer(host, port);\n}\n\nTSocketPool::~TSocketPool() {\n  vector< shared_ptr<TSocketPoolServer> >::const_iterator iter = servers_.begin();\n  vector< shared_ptr<TSocketPoolServer> >::const_iterator iterEnd = servers_.end();\n  for (; iter != iterEnd; ++iter) {\n    setCurrentServer(*iter);\n    TSocketPool::close();\n  }\n}\n\nvoid TSocketPool::addServer(const string& host, int port) {\n  servers_.push_back(shared_ptr<TSocketPoolServer>(new TSocketPoolServer(host, port)));\n}\n\nvoid TSocketPool::addServer(shared_ptr<TSocketPoolServer> &server) {\n  if (server) {\n    servers_.push_back(server);\n  }\n}\n\nvoid TSocketPool::setServers(const vector< shared_ptr<TSocketPoolServer> >& servers) {\n  servers_ = servers;\n}\n\nvoid TSocketPool::getServers(vector< shared_ptr<TSocketPoolServer> >& servers) {\n  servers = servers_;\n}\n\nvoid TSocketPool::setNumRetries(int numRetries) {\n  numRetries_ = numRetries;\n}\n\nvoid TSocketPool::setRetryInterval(int retryInterval) {\n  retryInterval_ = retryInterval;\n}\n\n\nvoid TSocketPool::setMaxConsecutiveFailures(int maxConsecutiveFailures) {\n  maxConsecutiveFailures_ = maxConsecutiveFailures;\n}\n\nvoid TSocketPool::setRandomize(bool randomize) {\n  randomize_ = randomize;\n}\n\nvoid TSocketPool::setAlwaysTryLast(bool alwaysTryLast) {\n  alwaysTryLast_ = alwaysTryLast;\n}\n\nvoid TSocketPool::setCurrentServer(const shared_ptr<TSocketPoolServer> &server) {\n  currentServer_ = server;\n  host_ = server->host_;\n  port_ = server->port_;\n  socket_ = server->socket_;\n}\n\n\/**\n * This function throws an exception if socket open fails. When socket\n * opens fails, the socket in the current server is reset.\n *\/\n\/* TODO: without apc we ignore a lot of functionality from the php version *\/\nvoid TSocketPool::open() {\n\n  size_t numServers = servers_.size();\n  if (numServers == 0) {\n    socket_ = -1;\n    throw TTransportException(TTransportException::NOT_OPEN);\n  }\n\n  if (isOpen()) {\n    return;\n  }\n\n  if (randomize_ && numServers > 1) {\n    random_shuffle(servers_.begin(), servers_.end());\n  }\n\n  for (size_t i = 0; i < numServers; ++i) {\n\n    shared_ptr<TSocketPoolServer> &server = servers_[i];\n    \/\/ Impersonate the server socket\n    setCurrentServer(server);\n\n    if (isOpen()) {\n      \/\/ already open means we're done\n      return;\n    }\n\n    bool retryIntervalPassed = (server->lastFailTime_ == 0);\n    bool isLastServer = alwaysTryLast_ ? (i == (numServers - 1)) : false;\n\n    if (server->lastFailTime_ > 0) {\n      \/\/ The server was marked as down, so check if enough time has elapsed to retry\n      time_t elapsedTime = time(NULL) - server->lastFailTime_;\n      if (elapsedTime > retryInterval_) {\n        retryIntervalPassed = true;\n      }\n    }\n\n    if (retryIntervalPassed || isLastServer) {\n      for (int j = 0; j < numRetries_; ++j) {\n        try {\n          TSocket::open();\n        } catch (TException e) {\n          string errStr = \"TSocketPool::open failed \"+getSocketInfo()+\": \"+e.what();\n          GlobalOutput(errStr.c_str());\n          socket_ = -1;\n          continue;\n        }\n\n        \/\/ Copy over the opened socket so that we can keep it persistent\n        server->socket_ = socket_;\n        \/\/ reset lastFailTime_ is required\n        server->lastFailTime_ = 0;\n        \/\/ success\n        return;\n      }\n\n      ++server->consecutiveFailures_;\n      if (server->consecutiveFailures_ > maxConsecutiveFailures_) {\n        \/\/ Mark server as down\n        server->consecutiveFailures_ = 0;\n        server->lastFailTime_ = time(NULL);\n      }\n    }\n  }\n\n  GlobalOutput(\"TSocketPool::open: all connections failed\");\n  throw TTransportException(TTransportException::NOT_OPEN);\n}\n\nvoid TSocketPool::close() {\n  TSocket::close();\n  if (currentServer_) {\n    currentServer_->socket_ = -1;\n  }\n}\n\n}}} \/\/ apache::thrift::transport\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\/workarounds\/dp16_workarounds.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 workarounds\/dp16.H\n\/\/\/ @brief Workarounds for the DP16 logic blocks\n\/\/\/ Workarounds are very deivce specific, so there is no attempt to generalize\n\/\/\/ this code in any way.\n\/\/\/\n\/\/ *HWP HWP Owner: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP HWP Backup: Steven Glancy <sglancy@usi.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#ifndef _MSS_WORKAROUNDS_DP16_H_\n#define _MSS_WORKAROUNDS_DP16_H_\n\n#include <fapi2.H>\n\nnamespace mss\n{\n\nnamespace workarounds\n{\n\nnamespace dp16\n{\n\n\/\/\/\n\/\/\/ @brief DQS polarity workaround\n\/\/\/ For Monza DDR port 2, one pair of DQS P\/N is swapped polarity.  Not in DDR port 6\n\/\/\/ @param[in] i_target the fapi2 target of the port\n\/\/\/ @return fapi2::ReturnCode FAPI2_RC_SUCCESS if ok\n\/\/\/ @note This function is called during the phy scom init procedure, after the initfile is\n\/\/\/ processed. It is specific to the Monza module, but can be called for all modules as it\n\/\/\/ will enforce its requirements internally\n\/\/\/\nfapi2::ReturnCode dqs_polarity( const fapi2::Target<fapi2::TARGET_TYPE_MCA>& i_target );\n\n} \/\/ close namespace dp16\n} \/\/ close namespace workarounds\n} \/\/ close namespace mss\n\n#endif\n<commit_msg>Add SEQ timing parameters, DP16 RD Diag config 5 inits<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/workarounds\/dp16_workarounds.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 workarounds\/dp16.H\n\/\/\/ @brief Workarounds for the DP16 logic blocks\n\/\/\/ Workarounds are very deivce specific, so there is no attempt to generalize\n\/\/\/ this code in any way.\n\/\/\/\n\/\/ *HWP HWP Owner: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP HWP Backup: Steven Glancy <sglancy@usi.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#ifndef _MSS_WORKAROUNDS_DP16_H_\n#define _MSS_WORKAROUNDS_DP16_H_\n\n#include <fapi2.H>\n\nnamespace mss\n{\n\nnamespace workarounds\n{\n\nnamespace dp16\n{\n\n\/\/\/\n\/\/\/ @brief DQS polarity workaround\n\/\/\/ For Monza DDR port 2, one pair of DQS P\/N is swapped polarity.  Not in DDR port 6\n\/\/\/ @param[in] i_target the fapi2 target of the port\n\/\/\/ @return fapi2::ReturnCode FAPI2_RC_SUCCESS if ok\n\/\/\/ @note This function is called during the phy scom init procedure, after the initfile is\n\/\/\/ processed. It is specific to the Monza module, but can be called for all modules as it\n\/\/\/ will enforce its requirements internally\n\/\/\/\nfapi2::ReturnCode dqs_polarity( const fapi2::Target<fapi2::TARGET_TYPE_MCA>& i_target );\n\n\/\/\/\n\/\/\/ @brief DP16 Read Diagnostic Configuration 5 work around\n\/\/\/ Not in the Model 67 spydef, so we scom them. Should be removed when they are\n\/\/\/ added to the spydef.\n\/\/\/ @param[in] i_target the fapi2 target of the port\n\/\/\/ @return fapi2::ReturnCode FAPI2_RC_SUCCESS if ok\n\/\/\/\nfapi2::ReturnCode rd_dia_config5( const fapi2::Target<fapi2::TARGET_TYPE_MCA>& i_target );\n\n} \/\/ close namespace dp16\n} \/\/ close namespace workarounds\n} \/\/ close namespace mss\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *   Copyright (C) 2006 by Till Adam <adam@kde.org>                        *\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 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#include \"akonadiconnection.h\"\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QEventLoop>\n#include <QtCore\/QLatin1String>\n\n#include \"storage\/datastore.h\"\n#include \"handler.h\"\n#include \"response.h\"\n#include \"tracer.h\"\n\n#include \"libs\/imapparser_p.h\"\n#include \"imapstreamparser.h\"\n#include \"shared\/akdebug.h\"\n#include \"shared\/akcrash.h\"\n\n#include <assert.h>\n\nusing namespace Akonadi;\n\nAkonadiConnection::AkonadiConnection( quintptr socketDescriptor, QObject *parent )\n    : QThread(parent)\n    , m_socketDescriptor(socketDescriptor)\n    , m_socket( 0 )\n    , m_currentHandler( 0 )\n    , m_connectionState( NonAuthenticated )\n    , m_backend( 0 )\n    , m_selectedConnection( 0 )\n    , m_parser( 0 )\n    , m_streamParser( 0 )\n{\n    m_identifier.sprintf( \"%p\", static_cast<void*>( this ) );\n    Tracer::self()->beginConnection( m_identifier, QString() );\n    m_parser = new ImapParser;\n}\n\nDataStore * Akonadi::AkonadiConnection::storageBackend()\n{\n    if ( !m_backend )\n      m_backend = DataStore::self();\n    return m_backend;\n}\n\n\nAkonadiConnection::~AkonadiConnection()\n{\n    Tracer::self()->endConnection( m_identifier, QString() );\n\n    delete m_parser;\n}\n\nvoid AkonadiConnection::run()\n{\n    m_socket = new QLocalSocket();\n\n    if ( !m_socket->setSocketDescriptor( m_socketDescriptor ) ) {\n        qWarning() << \"AkonadiConnection(\" << m_identifier\n                 << \")::run: failed to set socket descriptor: \"\n                 << m_socket->error() << \"(\" << m_socket->errorString() << \")\";\n        delete m_socket;\n        m_socket = 0;\n        return;\n    }\n\n    \/* Start a local event loop and start processing incoming data. Whenever\n     * a full command has been read, it is delegated to the responsible\n     * handler and processed by that. If that command needs to do something\n     * asynchronous such as ask the db for data, it returns and the input\n     * queue can continue to be processed. Whenever there is something to\n     * be sent back to the user it is queued in the form of a Response object.\n     * All this is meant to make it possible to process large incoming or\n     * outgoing data transfers in a streaming manner, without having to\n     * hold them in memory 'en gros'. *\/\n\n    connect( m_socket, SIGNAL( readyRead() ),\n             this, SLOT( slotNewData() ), Qt::DirectConnection );\n    connect( m_socket, SIGNAL( disconnected() ),\n             this, SLOT( slotDisconnected() ), Qt::DirectConnection );\n\n    writeOut( \"* OK Akonadi Almost IMAP Server [PROTOCOL 12]\");\n\n    m_streamParser = new ImapStreamParser( m_socket );\n    exec();\n    delete m_socket;\n    m_socket = 0;\n    delete m_streamParser;\n    m_streamParser = 0;\n}\n\nvoid AkonadiConnection::slotDisconnected()\n{\n    quit();\n}\n\nvoid AkonadiConnection::slotNewData()\n{\n  while ( m_socket->bytesAvailable() > 0 || !m_streamParser->readRemainingData().isEmpty()) {\n    try {\n      const QByteArray tag = m_streamParser->readString();\n      const QByteArray command = m_streamParser->readString();\n      Tracer::self()->connectionInput( m_identifier, QString::fromUtf8( tag + \" \" + command + \" \" + m_streamParser->readRemainingData() ) );\n      m_currentHandler = findHandlerForCommand( command );\n      assert( m_currentHandler );\n      connect( m_currentHandler, SIGNAL( responseAvailable( const Response & ) ),\n              this, SLOT( slotResponseAvailable( const Response & ) ), Qt::DirectConnection );\n      connect( m_currentHandler, SIGNAL( connectionStateChange( ConnectionState ) ),\n              this, SLOT( slotConnectionStateChange( ConnectionState ) ),\n               Qt::DirectConnection );\n      m_currentHandler->setTag( tag );\n      m_currentHandler->setStreamParser( m_streamParser );\n      if ( !m_currentHandler->parseStream() ) {\n        m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n      }\n    } catch ( const Akonadi::HandlerException &e ) {\n      m_currentHandler->failureResponse( e.what() );\n      m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n    } catch ( const Akonadi::Exception &e ) {\n      m_currentHandler->failureResponse( QString::fromLatin1( e.type() )\n          + QLatin1String( \": \" ) + QString::fromLatin1( e.what()  ) );\n      m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n    } catch ( ... ) {\n      akError() << \"Unknown exception caught: \" << akBacktrace();\n      m_currentHandler->failureResponse( \"Unknown exception caught\" );\n      m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n    }\n    delete m_currentHandler;\n    m_currentHandler = 0;\n\n    if (m_streamParser->readRemainingData().startsWith('\\n') || m_streamParser->readRemainingData().startsWith(\"\\r\\n\"))\n      m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n  }\n}\n\n\nvoid AkonadiConnection::writeOut( const QByteArray &data )\n{\n    QByteArray block = data + \"\\r\\n\";\n    m_socket->write(block);\n    m_socket->waitForBytesWritten();\n\n    Tracer::self()->connectionOutput( m_identifier, QString::fromUtf8( block ) );\n}\n\n\nHandler * AkonadiConnection::findHandlerForCommand( const QByteArray & command )\n{\n    Handler * handler = Handler::findHandlerForCommandAlwaysAllowed( command );\n    if ( handler ) return handler;\n\n    switch ( m_connectionState ) {\n        case NonAuthenticated:\n            handler =  Handler::findHandlerForCommandNonAuthenticated( command );\n            break;\n        case Authenticated:\n            handler =  Handler::findHandlerForCommandAuthenticated( command, m_streamParser );\n            break;\n        case Selected:\n            break;\n        case LoggingOut:\n            break;\n    }\n    \/\/ we didn't have a handler for this, let the default one do its thing\n    if ( !handler ) handler = new UnknownCommandHandler( command );\n    handler->setConnection( this );\n    return handler;\n}\n\nvoid AkonadiConnection::slotResponseAvailable( const Response& response )\n{\n    \/\/ FIXME handle reentrancy in the presence of continuation. Something like:\n    \/\/ \"if continuation pending, queue responses, once continuation is done, replay them\"\n    writeOut( response.asString() );\n}\n\nvoid AkonadiConnection::slotConnectionStateChange( ConnectionState state )\n{\n    if ( state == m_connectionState ) return;\n    m_connectionState = state;\n    switch ( m_connectionState ) {\n        case NonAuthenticated:\n            assert( 0 ); \/\/ can't happen, it's only the initial state, we can't go back to it\n            break;\n        case Authenticated:\n            break;\n        case Selected:\n            break;\n        case LoggingOut:\n            m_socket->disconnectFromServer();\n            break;\n    }\n}\n\nqint64 Akonadi::AkonadiConnection::selectedCollectionId( ) const\n{\n    return m_selectedConnection;\n}\n\nvoid Akonadi::AkonadiConnection::setSelectedCollection( qint64 collection )\n{\n    m_selectedConnection = collection;\n}\n\nconst Collection Akonadi::AkonadiConnection::selectedCollection()\n{\n  return Collection::retrieveById( selectedCollectionId() );\n}\n\nvoid Akonadi::AkonadiConnection::addStatusMessage( const QByteArray& msg )\n{\n    m_statusMessageQueue.append( msg );\n}\n\nvoid Akonadi::AkonadiConnection::flushStatusMessageQueue()\n{\n    for ( int i = 0; i < m_statusMessageQueue.count(); ++i ) {\n      Response response;\n      response.setUntagged();\n      response.setString( m_statusMessageQueue[ i ] );\n\n      slotResponseAvailable( response );\n    }\n\n    m_statusMessageQueue.clear();\n}\n\nvoid AkonadiConnection::setSessionId(const QByteArray &id)\n{\n  m_sessionId = id;\n  storageBackend()->setSessionId( id );\n  storageBackend()->notificationCollector()->setSessionId( id );\n}\n\nQByteArray AkonadiConnection::sessionId() const\n{\n  return m_sessionId;\n}\n\nResource Akonadi::AkonadiConnection::resourceContext() const\n{\n  return m_resourceContext;\n}\n\nvoid AkonadiConnection::setResourceContext(const Resource& res)\n{\n  m_resourceContext = res;\n}\n\nbool AkonadiConnection::isOwnerResource(const PimItem& item) const\n{\n  if ( resourceContext().isValid() )\n    return true;\n  \/\/ fallback for older resources\n  if ( sessionId() == item.collection().resource().name().toUtf8() )\n    return true;\n  return false;\n}\n\n#include \"akonadiconnection.moc\"\n<commit_msg>Deal with stray newlines caused by zero-sized literals. The real fix for this would be on the client side, but being more robust against received garbage can't hurt either. This fixes most of the unknown command\/empty command errors for me, as well as most of the unit tests.<commit_after>\/***************************************************************************\n *   Copyright (C) 2006 by Till Adam <adam@kde.org>                        *\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 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#include \"akonadiconnection.h\"\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QEventLoop>\n#include <QtCore\/QLatin1String>\n\n#include \"storage\/datastore.h\"\n#include \"handler.h\"\n#include \"response.h\"\n#include \"tracer.h\"\n\n#include \"libs\/imapparser_p.h\"\n#include \"imapstreamparser.h\"\n#include \"shared\/akdebug.h\"\n#include \"shared\/akcrash.h\"\n\n#include <assert.h>\n\nusing namespace Akonadi;\n\nAkonadiConnection::AkonadiConnection( quintptr socketDescriptor, QObject *parent )\n    : QThread(parent)\n    , m_socketDescriptor(socketDescriptor)\n    , m_socket( 0 )\n    , m_currentHandler( 0 )\n    , m_connectionState( NonAuthenticated )\n    , m_backend( 0 )\n    , m_selectedConnection( 0 )\n    , m_parser( 0 )\n    , m_streamParser( 0 )\n{\n    m_identifier.sprintf( \"%p\", static_cast<void*>( this ) );\n    Tracer::self()->beginConnection( m_identifier, QString() );\n    m_parser = new ImapParser;\n}\n\nDataStore * Akonadi::AkonadiConnection::storageBackend()\n{\n    if ( !m_backend )\n      m_backend = DataStore::self();\n    return m_backend;\n}\n\n\nAkonadiConnection::~AkonadiConnection()\n{\n    Tracer::self()->endConnection( m_identifier, QString() );\n\n    delete m_parser;\n}\n\nvoid AkonadiConnection::run()\n{\n    m_socket = new QLocalSocket();\n\n    if ( !m_socket->setSocketDescriptor( m_socketDescriptor ) ) {\n        qWarning() << \"AkonadiConnection(\" << m_identifier\n                 << \")::run: failed to set socket descriptor: \"\n                 << m_socket->error() << \"(\" << m_socket->errorString() << \")\";\n        delete m_socket;\n        m_socket = 0;\n        return;\n    }\n\n    \/* Start a local event loop and start processing incoming data. Whenever\n     * a full command has been read, it is delegated to the responsible\n     * handler and processed by that. If that command needs to do something\n     * asynchronous such as ask the db for data, it returns and the input\n     * queue can continue to be processed. Whenever there is something to\n     * be sent back to the user it is queued in the form of a Response object.\n     * All this is meant to make it possible to process large incoming or\n     * outgoing data transfers in a streaming manner, without having to\n     * hold them in memory 'en gros'. *\/\n\n    connect( m_socket, SIGNAL( readyRead() ),\n             this, SLOT( slotNewData() ), Qt::DirectConnection );\n    connect( m_socket, SIGNAL( disconnected() ),\n             this, SLOT( slotDisconnected() ), Qt::DirectConnection );\n\n    writeOut( \"* OK Akonadi Almost IMAP Server [PROTOCOL 12]\");\n\n    m_streamParser = new ImapStreamParser( m_socket );\n    exec();\n    delete m_socket;\n    m_socket = 0;\n    delete m_streamParser;\n    m_streamParser = 0;\n}\n\nvoid AkonadiConnection::slotDisconnected()\n{\n    quit();\n}\n\nvoid AkonadiConnection::slotNewData()\n{\n  while ( m_socket->bytesAvailable() > 0 || !m_streamParser->readRemainingData().isEmpty()) {\n    try {\n      const QByteArray tag = m_streamParser->readString();\n      \/\/ deal with stray newlines\n      if ( tag.isEmpty() && m_streamParser->atCommandEnd() )\n        continue;\n      const QByteArray command = m_streamParser->readString();\n      Tracer::self()->connectionInput( m_identifier, QString::fromUtf8( tag + \" \" + command + \" \" + m_streamParser->readRemainingData() ) );\n      m_currentHandler = findHandlerForCommand( command );\n      assert( m_currentHandler );\n      connect( m_currentHandler, SIGNAL( responseAvailable( const Response & ) ),\n              this, SLOT( slotResponseAvailable( const Response & ) ), Qt::DirectConnection );\n      connect( m_currentHandler, SIGNAL( connectionStateChange( ConnectionState ) ),\n              this, SLOT( slotConnectionStateChange( ConnectionState ) ),\n               Qt::DirectConnection );\n      m_currentHandler->setTag( tag );\n      m_currentHandler->setStreamParser( m_streamParser );\n      if ( !m_currentHandler->parseStream() ) {\n        m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n      }\n    } catch ( const Akonadi::HandlerException &e ) {\n      m_currentHandler->failureResponse( e.what() );\n      m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n    } catch ( const Akonadi::Exception &e ) {\n      m_currentHandler->failureResponse( QString::fromLatin1( e.type() )\n          + QLatin1String( \": \" ) + QString::fromLatin1( e.what()  ) );\n      m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n    } catch ( ... ) {\n      akError() << \"Unknown exception caught: \" << akBacktrace();\n      m_currentHandler->failureResponse( \"Unknown exception caught\" );\n      m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n    }\n    delete m_currentHandler;\n    m_currentHandler = 0;\n\n    if (m_streamParser->readRemainingData().startsWith('\\n') || m_streamParser->readRemainingData().startsWith(\"\\r\\n\"))\n      m_streamParser->readUntilCommandEnd(); \/\/just eat the ending newline\n  }\n}\n\n\nvoid AkonadiConnection::writeOut( const QByteArray &data )\n{\n    QByteArray block = data + \"\\r\\n\";\n    m_socket->write(block);\n    m_socket->waitForBytesWritten();\n\n    Tracer::self()->connectionOutput( m_identifier, QString::fromUtf8( block ) );\n}\n\n\nHandler * AkonadiConnection::findHandlerForCommand( const QByteArray & command )\n{\n    Handler * handler = Handler::findHandlerForCommandAlwaysAllowed( command );\n    if ( handler ) return handler;\n\n    switch ( m_connectionState ) {\n        case NonAuthenticated:\n            handler =  Handler::findHandlerForCommandNonAuthenticated( command );\n            break;\n        case Authenticated:\n            handler =  Handler::findHandlerForCommandAuthenticated( command, m_streamParser );\n            break;\n        case Selected:\n            break;\n        case LoggingOut:\n            break;\n    }\n    \/\/ we didn't have a handler for this, let the default one do its thing\n    if ( !handler ) handler = new UnknownCommandHandler( command );\n    handler->setConnection( this );\n    return handler;\n}\n\nvoid AkonadiConnection::slotResponseAvailable( const Response& response )\n{\n    \/\/ FIXME handle reentrancy in the presence of continuation. Something like:\n    \/\/ \"if continuation pending, queue responses, once continuation is done, replay them\"\n    writeOut( response.asString() );\n}\n\nvoid AkonadiConnection::slotConnectionStateChange( ConnectionState state )\n{\n    if ( state == m_connectionState ) return;\n    m_connectionState = state;\n    switch ( m_connectionState ) {\n        case NonAuthenticated:\n            assert( 0 ); \/\/ can't happen, it's only the initial state, we can't go back to it\n            break;\n        case Authenticated:\n            break;\n        case Selected:\n            break;\n        case LoggingOut:\n            m_socket->disconnectFromServer();\n            break;\n    }\n}\n\nqint64 Akonadi::AkonadiConnection::selectedCollectionId( ) const\n{\n    return m_selectedConnection;\n}\n\nvoid Akonadi::AkonadiConnection::setSelectedCollection( qint64 collection )\n{\n    m_selectedConnection = collection;\n}\n\nconst Collection Akonadi::AkonadiConnection::selectedCollection()\n{\n  return Collection::retrieveById( selectedCollectionId() );\n}\n\nvoid Akonadi::AkonadiConnection::addStatusMessage( const QByteArray& msg )\n{\n    m_statusMessageQueue.append( msg );\n}\n\nvoid Akonadi::AkonadiConnection::flushStatusMessageQueue()\n{\n    for ( int i = 0; i < m_statusMessageQueue.count(); ++i ) {\n      Response response;\n      response.setUntagged();\n      response.setString( m_statusMessageQueue[ i ] );\n\n      slotResponseAvailable( response );\n    }\n\n    m_statusMessageQueue.clear();\n}\n\nvoid AkonadiConnection::setSessionId(const QByteArray &id)\n{\n  m_sessionId = id;\n  storageBackend()->setSessionId( id );\n  storageBackend()->notificationCollector()->setSessionId( id );\n}\n\nQByteArray AkonadiConnection::sessionId() const\n{\n  return m_sessionId;\n}\n\nResource Akonadi::AkonadiConnection::resourceContext() const\n{\n  return m_resourceContext;\n}\n\nvoid AkonadiConnection::setResourceContext(const Resource& res)\n{\n  m_resourceContext = res;\n}\n\nbool AkonadiConnection::isOwnerResource(const PimItem& item) const\n{\n  if ( resourceContext().isValid() )\n    return true;\n  \/\/ fallback for older resources\n  if ( sessionId() == item.collection().resource().name().toUtf8() )\n    return true;\n  return false;\n}\n\n#include \"akonadiconnection.moc\"\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\/desktop_capture\/window_capturer.h\"\n\n#include <assert.h>\n\n#include \"webrtc\/base\/scoped_ptr.h\"\n#include \"webrtc\/base\/checks.h\"\n#include \"webrtc\/base\/win32.h\"\n#include \"webrtc\/modules\/desktop_capture\/desktop_frame_win.h\"\n#include \"webrtc\/modules\/desktop_capture\/win\/window_capture_utils.h\"\n#include \"webrtc\/system_wrappers\/include\/logging.h\"\n\nnamespace webrtc {\n\nnamespace {\n\nBOOL CALLBACK WindowsEnumerationHandler(HWND hwnd, LPARAM param) {\n  WindowCapturer::WindowList* list =\n      reinterpret_cast<WindowCapturer::WindowList*>(param);\n\n  \/\/ Skip windows that are invisible, minimized, have no title, or are owned,\n  \/\/ unless they have the app window style set.\n  int len = GetWindowTextLength(hwnd);\n  HWND owner = GetWindow(hwnd, GW_OWNER);\n  LONG exstyle = GetWindowLong(hwnd, GWL_EXSTYLE);\n  if (len == 0 || IsIconic(hwnd) || !IsWindowVisible(hwnd) ||\n      (owner && !(exstyle & WS_EX_APPWINDOW))) {\n    return TRUE;\n  }\n\n  \/\/ Skip the Program Manager window and the Start button.\n  const size_t kClassLength = 256;\n  WCHAR class_name[kClassLength];\n  const int class_name_length = GetClassName(hwnd, class_name, kClassLength);\n  RTC_DCHECK(class_name_length)\n      << \"Error retrieving the application's class name\";\n\n  \/\/ Skip Program Manager window and the Start button. This is the same logic\n  \/\/ that's used in Win32WindowPicker in libjingle. Consider filtering other\n  \/\/ windows as well (e.g. toolbars).\n  if (wcscmp(class_name, L\"Progman\") == 0 || wcscmp(class_name, L\"Button\") == 0)\n    return TRUE;\n\n  \/\/ Windows 8 introduced a \"Modern App\" identified by their class name being\n  \/\/ either ApplicationFrameWindow or windows.UI.Core.coreWindow. The\n  \/\/ associated windows cannot be captured, so we skip them.\n  \/\/ http:\/\/crbug.com\/526883.\n  if (rtc::IsWindows8OrLater() &&\n      (wcscmp(class_name, L\"ApplicationFrameWindow\") == 0 ||\n       wcscmp(class_name, L\"Windows.UI.Core.CoreWindow\") == 0)) {\n    return TRUE;\n  }\n\n  WindowCapturer::Window window;\n  window.id = reinterpret_cast<WindowCapturer::WindowId>(hwnd);\n\n  const size_t kTitleLength = 500;\n  WCHAR window_title[kTitleLength];\n  \/\/ Truncate the title if it's longer than kTitleLength.\n  GetWindowText(hwnd, window_title, kTitleLength);\n  window.title = rtc::ToUtf8(window_title);\n\n  \/\/ Skip windows when we failed to convert the title or it is empty.\n  if (window.title.empty())\n    return TRUE;\n\n  list->push_back(window);\n\n  return TRUE;\n}\n\nclass WindowCapturerWin : public WindowCapturer {\n public:\n  WindowCapturerWin();\n  virtual ~WindowCapturerWin();\n\n  \/\/ WindowCapturer interface.\n  bool GetWindowList(WindowList* windows) override;\n  bool SelectWindow(WindowId id) override;\n  bool BringSelectedWindowToFront() override;\n\n  \/\/ DesktopCapturer interface.\n  void Start(Callback* callback) override;\n  void Capture(const DesktopRegion& region) override;\n\n private:\n  Callback* callback_;\n\n  \/\/ HWND and HDC for the currently selected window or NULL if window is not\n  \/\/ selected.\n  HWND window_;\n\n  DesktopSize previous_size_;\n\n  AeroChecker aero_checker_;\n\n  RTC_DISALLOW_COPY_AND_ASSIGN(WindowCapturerWin);\n};\n\nWindowCapturerWin::WindowCapturerWin()\n    : callback_(NULL),\n      window_(NULL) {\n}\n\nWindowCapturerWin::~WindowCapturerWin() {\n}\n\nbool WindowCapturerWin::GetWindowList(WindowList* windows) {\n  WindowList result;\n  LPARAM param = reinterpret_cast<LPARAM>(&result);\n  if (!EnumWindows(&WindowsEnumerationHandler, param))\n    return false;\n  windows->swap(result);\n  return true;\n}\n\nbool WindowCapturerWin::SelectWindow(WindowId id) {\n  HWND window = reinterpret_cast<HWND>(id);\n  if (!IsWindow(window) || !IsWindowVisible(window) || IsIconic(window))\n    return false;\n  window_ = window;\n  previous_size_.set(0, 0);\n  return true;\n}\n\nbool WindowCapturerWin::BringSelectedWindowToFront() {\n  if (!window_)\n    return false;\n\n  if (!IsWindow(window_) || !IsWindowVisible(window_) || IsIconic(window_))\n    return false;\n\n  return SetForegroundWindow(window_) != 0;\n}\n\nvoid WindowCapturerWin::Start(Callback* callback) {\n  assert(!callback_);\n  assert(callback);\n\n  callback_ = callback;\n}\n\nvoid WindowCapturerWin::Capture(const DesktopRegion& region) {\n  if (!window_) {\n    LOG(LS_ERROR) << \"Window hasn't been selected: \" << GetLastError();\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  \/\/ Stop capturing if the window has been closed.\n  if (!IsWindow(window_)) {\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  \/\/ Return a 1x1 black frame if the window is minimized or invisible, to match\n  \/\/ behavior on mace. Window can be temporarily invisible during the\n  \/\/ transition of full screen mode on\/off.\n  if (IsIconic(window_) || !IsWindowVisible(window_)) {\n    BasicDesktopFrame* frame = new BasicDesktopFrame(DesktopSize(1, 1));\n    memset(frame->data(), 0, frame->stride() * frame->size().height());\n\n    previous_size_ = frame->size();\n    callback_->OnCaptureCompleted(frame);\n    return;\n  }\n\n  DesktopRect original_rect;\n  DesktopRect cropped_rect;\n  if (!GetCroppedWindowRect(window_, &cropped_rect, &original_rect)) {\n    LOG(LS_WARNING) << \"Failed to get window info: \" << GetLastError();\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  HDC window_dc = GetWindowDC(window_);\n  if (!window_dc) {\n    LOG(LS_WARNING) << \"Failed to get window DC: \" << GetLastError();\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  rtc::scoped_ptr<DesktopFrameWin> frame(\n      DesktopFrameWin::Create(cropped_rect.size(), NULL, window_dc));\n  if (!frame.get()) {\n    ReleaseDC(window_, window_dc);\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  HDC mem_dc = CreateCompatibleDC(window_dc);\n  HGDIOBJ previous_object = SelectObject(mem_dc, frame->bitmap());\n  BOOL result = FALSE;\n\n  \/\/ When desktop composition (Aero) is enabled each window is rendered to a\n  \/\/ private buffer allowing BitBlt() to get the window content even if the\n  \/\/ window is occluded. PrintWindow() is slower but lets rendering the window\n  \/\/ contents to an off-screen device context when Aero is not available.\n  \/\/ PrintWindow() is not supported by some applications.\n  \/\/\n  \/\/ If Aero is enabled, we prefer BitBlt() because it's faster and avoids\n  \/\/ window flickering. Otherwise, we prefer PrintWindow() because BitBlt() may\n  \/\/ render occluding windows on top of the desired window.\n  \/\/\n  \/\/ When composition is enabled the DC returned by GetWindowDC() doesn't always\n  \/\/ have window frame rendered correctly. Windows renders it only once and then\n  \/\/ caches the result between captures. We hack it around by calling\n  \/\/ PrintWindow() whenever window size changes, including the first time of\n  \/\/ capturing - it somehow affects what we get from BitBlt() on the subsequent\n  \/\/ captures.\n\n  if (!aero_checker_.IsAeroEnabled() || !previous_size_.equals(frame->size())) {\n    result = PrintWindow(window_, mem_dc, 0);\n  }\n\n  \/\/ Aero is enabled or PrintWindow() failed, use BitBlt.\n  if (!result) {\n    result = BitBlt(mem_dc, 0, 0, frame->size().width(), frame->size().height(),\n                    window_dc,\n                    cropped_rect.left() - original_rect.left(),\n                    cropped_rect.top() - original_rect.top(),\n                    SRCCOPY);\n  }\n\n  SelectObject(mem_dc, previous_object);\n  DeleteDC(mem_dc);\n  ReleaseDC(window_, window_dc);\n\n  previous_size_ = frame->size();\n\n  frame->mutable_updated_region()->SetRect(\n      DesktopRect::MakeSize(frame->size()));\n\n  if (!result) {\n    LOG(LS_ERROR) << \"Both PrintWindow() and BitBlt() failed.\";\n    frame.reset();\n  }\n\n  callback_->OnCaptureCompleted(frame.release());\n}\n\n}  \/\/ namespace\n\n\/\/ static\nWindowCapturer* WindowCapturer::Create(const DesktopCaptureOptions& options) {\n  return new WindowCapturerWin();\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Screen was flickering when the picker for desktop medias showed up in Windows platform. Keeping track of window size for each window so that BitBlt() instead of PrintWindow() will be called for windows with unchanged sizes.<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\/desktop_capture\/window_capturer.h\"\n\n#include <assert.h>\n\n#include \"webrtc\/base\/scoped_ptr.h\"\n#include \"webrtc\/base\/checks.h\"\n#include \"webrtc\/base\/win32.h\"\n#include \"webrtc\/modules\/desktop_capture\/desktop_frame_win.h\"\n#include \"webrtc\/modules\/desktop_capture\/win\/window_capture_utils.h\"\n#include \"webrtc\/system_wrappers\/include\/logging.h\"\n\nnamespace webrtc {\n\nnamespace {\n\nBOOL CALLBACK WindowsEnumerationHandler(HWND hwnd, LPARAM param) {\n  WindowCapturer::WindowList* list =\n      reinterpret_cast<WindowCapturer::WindowList*>(param);\n\n  \/\/ Skip windows that are invisible, minimized, have no title, or are owned,\n  \/\/ unless they have the app window style set.\n  int len = GetWindowTextLength(hwnd);\n  HWND owner = GetWindow(hwnd, GW_OWNER);\n  LONG exstyle = GetWindowLong(hwnd, GWL_EXSTYLE);\n  if (len == 0 || IsIconic(hwnd) || !IsWindowVisible(hwnd) ||\n      (owner && !(exstyle & WS_EX_APPWINDOW))) {\n    return TRUE;\n  }\n\n  \/\/ Skip the Program Manager window and the Start button.\n  const size_t kClassLength = 256;\n  WCHAR class_name[kClassLength];\n  const int class_name_length = GetClassName(hwnd, class_name, kClassLength);\n  RTC_DCHECK(class_name_length)\n      << \"Error retrieving the application's class name\";\n\n  \/\/ Skip Program Manager window and the Start button. This is the same logic\n  \/\/ that's used in Win32WindowPicker in libjingle. Consider filtering other\n  \/\/ windows as well (e.g. toolbars).\n  if (wcscmp(class_name, L\"Progman\") == 0 || wcscmp(class_name, L\"Button\") == 0)\n    return TRUE;\n\n  \/\/ Windows 8 introduced a \"Modern App\" identified by their class name being\n  \/\/ either ApplicationFrameWindow or windows.UI.Core.coreWindow. The\n  \/\/ associated windows cannot be captured, so we skip them.\n  \/\/ http:\/\/crbug.com\/526883.\n  if (rtc::IsWindows8OrLater() &&\n      (wcscmp(class_name, L\"ApplicationFrameWindow\") == 0 ||\n       wcscmp(class_name, L\"Windows.UI.Core.CoreWindow\") == 0)) {\n    return TRUE;\n  }\n\n  WindowCapturer::Window window;\n  window.id = reinterpret_cast<WindowCapturer::WindowId>(hwnd);\n\n  const size_t kTitleLength = 500;\n  WCHAR window_title[kTitleLength];\n  \/\/ Truncate the title if it's longer than kTitleLength.\n  GetWindowText(hwnd, window_title, kTitleLength);\n  window.title = rtc::ToUtf8(window_title);\n\n  \/\/ Skip windows when we failed to convert the title or it is empty.\n  if (window.title.empty())\n    return TRUE;\n\n  list->push_back(window);\n\n  return TRUE;\n}\n\nclass WindowCapturerWin : public WindowCapturer {\n public:\n  WindowCapturerWin();\n  virtual ~WindowCapturerWin();\n\n  \/\/ WindowCapturer interface.\n  bool GetWindowList(WindowList* windows) override;\n  bool SelectWindow(WindowId id) override;\n  bool BringSelectedWindowToFront() override;\n\n  \/\/ DesktopCapturer interface.\n  void Start(Callback* callback) override;\n  void Capture(const DesktopRegion& region) override;\n\n private:\n  Callback* callback_;\n\n  \/\/ HWND and HDC for the currently selected window or NULL if window is not\n  \/\/ selected.\n  HWND window_;\n\n  DesktopSize previous_size_;\n\n  AeroChecker aero_checker_;\n\n  \/\/ This map is used to avoid flickering for the case when SelectWindow() calls\n  \/\/ are interleaved with Capture() calls.\n  std::map<HWND, DesktopSize> window_size_map_;\n\n  RTC_DISALLOW_COPY_AND_ASSIGN(WindowCapturerWin);\n};\n\nWindowCapturerWin::WindowCapturerWin()\n    : callback_(NULL),\n      window_(NULL) {\n}\n\nWindowCapturerWin::~WindowCapturerWin() {\n}\n\nbool WindowCapturerWin::GetWindowList(WindowList* windows) {\n  WindowList result;\n  LPARAM param = reinterpret_cast<LPARAM>(&result);\n  if (!EnumWindows(&WindowsEnumerationHandler, param))\n    return false;\n  windows->swap(result);\n\n  std::map<HWND, DesktopSize> new_map;\n  for (const auto& item : *windows) {\n    HWND hwnd = reinterpret_cast<HWND>(item.id);\n    new_map[hwnd] = window_size_map_[hwnd];\n  }\n  window_size_map_.swap(new_map);\n\n  return true;\n}\n\nbool WindowCapturerWin::SelectWindow(WindowId id) {\n  HWND window = reinterpret_cast<HWND>(id);\n  if (!IsWindow(window) || !IsWindowVisible(window) || IsIconic(window))\n    return false;\n  window_ = window;\n  \/\/ When a window is not in the map, window_size_map_[window] will create an\n  \/\/ item with DesktopSize (0, 0).\n  previous_size_ = window_size_map_[window];\n  return true;\n}\n\nbool WindowCapturerWin::BringSelectedWindowToFront() {\n  if (!window_)\n    return false;\n\n  if (!IsWindow(window_) || !IsWindowVisible(window_) || IsIconic(window_))\n    return false;\n\n  return SetForegroundWindow(window_) != 0;\n}\n\nvoid WindowCapturerWin::Start(Callback* callback) {\n  assert(!callback_);\n  assert(callback);\n\n  callback_ = callback;\n}\n\nvoid WindowCapturerWin::Capture(const DesktopRegion& region) {\n  if (!window_) {\n    LOG(LS_ERROR) << \"Window hasn't been selected: \" << GetLastError();\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  \/\/ Stop capturing if the window has been closed.\n  if (!IsWindow(window_)) {\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  \/\/ Return a 1x1 black frame if the window is minimized or invisible, to match\n  \/\/ behavior on mace. Window can be temporarily invisible during the\n  \/\/ transition of full screen mode on\/off.\n  if (IsIconic(window_) || !IsWindowVisible(window_)) {\n    BasicDesktopFrame* frame = new BasicDesktopFrame(DesktopSize(1, 1));\n    memset(frame->data(), 0, frame->stride() * frame->size().height());\n\n    previous_size_ = frame->size();\n    window_size_map_[window_] = previous_size_;\n    callback_->OnCaptureCompleted(frame);\n    return;\n  }\n\n  DesktopRect original_rect;\n  DesktopRect cropped_rect;\n  if (!GetCroppedWindowRect(window_, &cropped_rect, &original_rect)) {\n    LOG(LS_WARNING) << \"Failed to get window info: \" << GetLastError();\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  HDC window_dc = GetWindowDC(window_);\n  if (!window_dc) {\n    LOG(LS_WARNING) << \"Failed to get window DC: \" << GetLastError();\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  rtc::scoped_ptr<DesktopFrameWin> frame(\n      DesktopFrameWin::Create(cropped_rect.size(), NULL, window_dc));\n  if (!frame.get()) {\n    ReleaseDC(window_, window_dc);\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  HDC mem_dc = CreateCompatibleDC(window_dc);\n  HGDIOBJ previous_object = SelectObject(mem_dc, frame->bitmap());\n  BOOL result = FALSE;\n\n  \/\/ When desktop composition (Aero) is enabled each window is rendered to a\n  \/\/ private buffer allowing BitBlt() to get the window content even if the\n  \/\/ window is occluded. PrintWindow() is slower but lets rendering the window\n  \/\/ contents to an off-screen device context when Aero is not available.\n  \/\/ PrintWindow() is not supported by some applications.\n  \/\/\n  \/\/ If Aero is enabled, we prefer BitBlt() because it's faster and avoids\n  \/\/ window flickering. Otherwise, we prefer PrintWindow() because BitBlt() may\n  \/\/ render occluding windows on top of the desired window.\n  \/\/\n  \/\/ When composition is enabled the DC returned by GetWindowDC() doesn't always\n  \/\/ have window frame rendered correctly. Windows renders it only once and then\n  \/\/ caches the result between captures. We hack it around by calling\n  \/\/ PrintWindow() whenever window size changes, including the first time of\n  \/\/ capturing - it somehow affects what we get from BitBlt() on the subsequent\n  \/\/ captures.\n\n  if (!aero_checker_.IsAeroEnabled() || !previous_size_.equals(frame->size())) {\n    result = PrintWindow(window_, mem_dc, 0);\n  }\n\n  \/\/ Aero is enabled or PrintWindow() failed, use BitBlt.\n  if (!result) {\n    result = BitBlt(mem_dc, 0, 0, frame->size().width(), frame->size().height(),\n                    window_dc,\n                    cropped_rect.left() - original_rect.left(),\n                    cropped_rect.top() - original_rect.top(),\n                    SRCCOPY);\n  }\n\n  SelectObject(mem_dc, previous_object);\n  DeleteDC(mem_dc);\n  ReleaseDC(window_, window_dc);\n\n  previous_size_ = frame->size();\n  window_size_map_[window_] = previous_size_;\n\n  frame->mutable_updated_region()->SetRect(\n      DesktopRect::MakeSize(frame->size()));\n\n  if (!result) {\n    LOG(LS_ERROR) << \"Both PrintWindow() and BitBlt() failed.\";\n    frame.reset();\n  }\n\n  callback_->OnCaptureCompleted(frame.release());\n}\n\n}  \/\/ namespace\n\n\/\/ static\nWindowCapturer* WindowCapturer::Create(const DesktopCaptureOptions& options) {\n  return new WindowCapturerWin();\n}\n\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n\n#ifndef _QIMESSAGING_DETAILS_GENERICVALUE_HXX_\n#define _QIMESSAGING_DETAILS_GENERICVALUE_HXX_\n\n#include <boost\/type_traits\/remove_const.hpp>\n\n#include <qimessaging\/typeint.hpp>\n\nnamespace qi {\n\n\nclass ValueClone\n{\npublic:\n  void* clone(void* src)\n  {\n    return new GenericValue(((GenericValue*)src)->clone());\n  }\n\n  void destroy(void* ptr)\n  {\n    ((GenericValue*)ptr)->destroy();\n    delete (GenericValue*)ptr;\n  }\n};\n\nclass ValueValue\n{\npublic:\n\n  bool toValue(const void* ptr, qi::detail::DynamicValue& val)\n  {\n    GenericValue* m = (GenericValue*)ptr;\n    return m->type->toValue(m->value, val);\n  }\n  void* fromValue(const qi::detail::DynamicValue& val)\n  {\n    GenericValue v = ::qi::toValue(val);\n    return new GenericValue(v.clone());\n  }\n};\n\ntemplate<> class TypeImpl<GenericValue>:\n  public DefaultTypeImpl<\n    GenericValue,\n    TypeDefaultAccess<GenericValue>,\n    ValueClone,\n    ValueValue,\n    TypeDefaultSerialize<TypeDefaultAccess<GenericValue> >\n    > {};\n\nnamespace detail\n{\n  template<typename T> struct TypeCopy\n  {\n    void operator()(T &dst, const T &src)\n    {\n      dst = src;\n    }\n  };\n\n  template<int I> struct TypeCopy<char[I] >\n  {\n    void operator() (char* dst, const char* src)\n    {\n      memcpy(dst, src, I);\n    }\n  };\n}\n\ntemplate<typename T>\nGenericValue toValue(const T& v)\n{\n  GenericValue res;\n  res.type = typeOf<typename boost::remove_const<T>::type>();\n  res.value = res.type->initializeStorage(const_cast<void*>((const void*)&v));\n  return res;\n}\n\ninline\nGenericValue GenericValue::clone() const\n{\n  GenericValue res;\n  res.type = type;\n  res.value = type?res.type->clone(value):0;\n  return res;\n}\n\ntemplate<typename T>\nstd::pair<const T*, bool> GenericValue::to() const\n{\n  Type* targetType =  typeOf<T>();\n  if (type->info() == targetType->info())\n    return std::make_pair((const T*)type->ptrFromStorage((void**)&value), false);\n  else\n  {\n    std::pair<GenericValue, bool> mv = convert(targetType);\n    \/\/ NOTE: delete theResult.first will not do, destroy must be called,\n    return std::make_pair((const T*)mv.first.type->ptrFromStorage(&mv.first.value), mv.second);\n  }\n}\n\ninline AutoGenericValue::AutoGenericValue(const AutoGenericValue& b)\n{\n  value = b.value;\n  type = b.type;\n}\n\ntemplate<typename T> AutoGenericValue::AutoGenericValue(const T& ptr)\n{\n  *(GenericValue*)this = toValue(ptr);\n}\n\ninline AutoGenericValue::AutoGenericValue()\n{\n  value = type = 0;\n}\n\ninline std::string GenericValue::signature() const\n{\n  if (!type)\n      return \"\";\n    else\n      return type->signature();\n}\n\ninline void GenericValue::destroy()\n{\n  if (type && value)\n    type->destroy(value);\n}\n\ninline void GenericValue::serialize(ODataStream& os) const\n{\n  if (type)\n    type->serialize(os, value);\n}\n\ninline GenericValue::GenericValue()\n: value(0)\n, type(0)\n{\n}\n\ninline Type::Kind GenericValue::kind() const\n{\n if (!type)\n   return Type::Void;\n else\n   return type->kind();\n}\n\n\n\/\/ Kind -> handler Type (TypeInt, TypeList...)  accessor\n\nclass KindNotConvertible;\n\ntemplate<Type::Kind T> struct TypeOfKind\n{\n  typedef KindNotConvertible type;\n};\n\n#define TYPE_OF_KIND(k, t) template<> struct TypeOfKind<k> { typedef t type;}\n\nTYPE_OF_KIND(Type::Int, TypeInt);\nTYPE_OF_KIND(Type::Float,  TypeFloat);\n\/\/TYPE_OF_KIND(Type::String, TypeString);\n\n#undef TYPE_OF_KIND\n\n\n\/\/ Type -> Kind  accessor\n\nnamespace detail\n{\n  struct Nothing {};\n  template<Type::Kind k> struct MakeKind\n  {\n    static const Type::Kind value = k;\n  };\n\n  template<typename C, typename T, typename F> struct IfElse\n  {\n  };\n\n  template<typename T, typename F> struct IfElse<boost::true_type, T, F>\n  {\n    typedef T type;\n  };\n\n  template<typename T, typename F> struct IfElse<boost::false_type, T, F>\n  {\n    typedef F type;\n  };\n\n}\n\n#define IF(cond, type) \\\npublic detail::IfElse<cond, typename detail::MakeKind<type>, detail::Nothing>::type\n\ntemplate<typename T> struct KindOfType\n: IF(typename boost::is_integral<T>::type, Type::Int)\n, IF(typename boost::is_floating_point<T>::type, Type::Float)\n{\n};\n\n#undef IF\n\ntemplate<typename T, Type::Kind k>\ninline T GenericValue::as() const\n{\n  if (kind() != k)\n  {\n    qiLogWarning(\"qi.GenericValue\") << \"as: type \" << kind() <<\" not convertible to kind \" << k;\n    return T();\n  }\n  return dynamic_cast<const typename TypeOfKind<k>::type*>(type)->get(value);\n}\n\ntemplate<typename T>\ninline T GenericValue::as() const\n{\n  return as<T, KindOfType<T>::value>();\n}\n\ninline int64_t GenericValue::asInt() const\n{\n  return as<int64_t, Type::Int>();\n}\n\ninline float GenericValue::asFloat() const\n{\n  return as<float, Type::Float>();\n}\n\ninline double GenericValue::asDouble() const\n{\n  return as<double, Type::Float>();\n}\n\n\ninline std::string GenericValue::asString() const\n{\n  return \"\"; \/\/ as<std::string, Type::String>();\n}\n\n\nnamespace detail\n{\n  \/** This class can be used to convert the return value of an arbitrary function\n  * into a GenericValue. It handles functions returning void.\n  *\n  *  Usage:\n  *    ValueCopy val;\n  *    val(), functionCall(arg);\n  *\n  *  in val(), parenthesis are useful to avoid compiler warning \"val not used\" when handling void.\n  *\/\n  class GenericValueCopy: public GenericValue\n  {\n  public:\n    template<typename T> void operator,(const T& any);\n    GenericValueCopy &operator()() { return *this; }\n  };\n\n  template<typename T> void GenericValueCopy::operator,(const T& any)\n  {\n    *(GenericValue*)this = toValue(any);\n    *(GenericValue*)this = clone();\n  }\n}\n\n\n}\n\n#endif  \/\/ _QIMESSAGING_DETAILS_GENERICVALUE_HXX_\n<commit_msg>toValue(T): Cache Type* of T.<commit_after>#pragma once\n\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n\n#ifndef _QIMESSAGING_DETAILS_GENERICVALUE_HXX_\n#define _QIMESSAGING_DETAILS_GENERICVALUE_HXX_\n\n#include <boost\/type_traits\/remove_const.hpp>\n\n#include <qimessaging\/typeint.hpp>\n\nnamespace qi {\n\n\nclass ValueClone\n{\npublic:\n  void* clone(void* src)\n  {\n    return new GenericValue(((GenericValue*)src)->clone());\n  }\n\n  void destroy(void* ptr)\n  {\n    ((GenericValue*)ptr)->destroy();\n    delete (GenericValue*)ptr;\n  }\n};\n\nclass ValueValue\n{\npublic:\n\n  bool toValue(const void* ptr, qi::detail::DynamicValue& val)\n  {\n    GenericValue* m = (GenericValue*)ptr;\n    return m->type->toValue(m->value, val);\n  }\n  void* fromValue(const qi::detail::DynamicValue& val)\n  {\n    GenericValue v = ::qi::toValue(val);\n    return new GenericValue(v.clone());\n  }\n};\n\ntemplate<> class TypeImpl<GenericValue>:\n  public DefaultTypeImpl<\n    GenericValue,\n    TypeDefaultAccess<GenericValue>,\n    ValueClone,\n    ValueValue,\n    TypeDefaultSerialize<TypeDefaultAccess<GenericValue> >\n    > {};\n\nnamespace detail\n{\n  template<typename T> struct TypeCopy\n  {\n    void operator()(T &dst, const T &src)\n    {\n      dst = src;\n    }\n  };\n\n  template<int I> struct TypeCopy<char[I] >\n  {\n    void operator() (char* dst, const char* src)\n    {\n      memcpy(dst, src, I);\n    }\n  };\n}\n\ntemplate<typename T>\nGenericValue toValue(const T& v)\n{\n  static Type* type = 0;\n  if (!type)\n    type = typeOf<typename boost::remove_const<T>::type>();\n  GenericValue res;\n  res.type = type;\n  res.value = res.type->initializeStorage(const_cast<void*>((const void*)&v));\n  return res;\n}\n\ninline\nGenericValue GenericValue::clone() const\n{\n  GenericValue res;\n  res.type = type;\n  res.value = type?res.type->clone(value):0;\n  return res;\n}\n\ntemplate<typename T>\nstd::pair<const T*, bool> GenericValue::to() const\n{\n  Type* targetType =  typeOf<T>();\n  if (type->info() == targetType->info())\n    return std::make_pair((const T*)type->ptrFromStorage((void**)&value), false);\n  else\n  {\n    std::pair<GenericValue, bool> mv = convert(targetType);\n    \/\/ NOTE: delete theResult.first will not do, destroy must be called,\n    return std::make_pair((const T*)mv.first.type->ptrFromStorage(&mv.first.value), mv.second);\n  }\n}\n\ninline AutoGenericValue::AutoGenericValue(const AutoGenericValue& b)\n{\n  value = b.value;\n  type = b.type;\n}\n\ntemplate<typename T> AutoGenericValue::AutoGenericValue(const T& ptr)\n{\n  *(GenericValue*)this = toValue(ptr);\n}\n\ninline AutoGenericValue::AutoGenericValue()\n{\n  value = type = 0;\n}\n\ninline std::string GenericValue::signature() const\n{\n  if (!type)\n      return \"\";\n    else\n      return type->signature();\n}\n\ninline void GenericValue::destroy()\n{\n  if (type && value)\n    type->destroy(value);\n}\n\ninline void GenericValue::serialize(ODataStream& os) const\n{\n  if (type)\n    type->serialize(os, value);\n}\n\ninline GenericValue::GenericValue()\n: value(0)\n, type(0)\n{\n}\n\ninline Type::Kind GenericValue::kind() const\n{\n if (!type)\n   return Type::Void;\n else\n   return type->kind();\n}\n\n\n\/\/ Kind -> handler Type (TypeInt, TypeList...)  accessor\n\nclass KindNotConvertible;\n\ntemplate<Type::Kind T> struct TypeOfKind\n{\n  typedef KindNotConvertible type;\n};\n\n#define TYPE_OF_KIND(k, t) template<> struct TypeOfKind<k> { typedef t type;}\n\nTYPE_OF_KIND(Type::Int, TypeInt);\nTYPE_OF_KIND(Type::Float,  TypeFloat);\n\/\/TYPE_OF_KIND(Type::String, TypeString);\n\n#undef TYPE_OF_KIND\n\n\n\/\/ Type -> Kind  accessor\n\nnamespace detail\n{\n  struct Nothing {};\n  template<Type::Kind k> struct MakeKind\n  {\n    static const Type::Kind value = k;\n  };\n\n  template<typename C, typename T, typename F> struct IfElse\n  {\n  };\n\n  template<typename T, typename F> struct IfElse<boost::true_type, T, F>\n  {\n    typedef T type;\n  };\n\n  template<typename T, typename F> struct IfElse<boost::false_type, T, F>\n  {\n    typedef F type;\n  };\n\n}\n\n#define IF(cond, type) \\\npublic detail::IfElse<cond, typename detail::MakeKind<type>, detail::Nothing>::type\n\ntemplate<typename T> struct KindOfType\n: IF(typename boost::is_integral<T>::type, Type::Int)\n, IF(typename boost::is_floating_point<T>::type, Type::Float)\n{\n};\n\n#undef IF\n\ntemplate<typename T, Type::Kind k>\ninline T GenericValue::as() const\n{\n  if (kind() != k)\n  {\n    qiLogWarning(\"qi.GenericValue\") << \"as: type \" << kind() <<\" not convertible to kind \" << k;\n    return T();\n  }\n  return dynamic_cast<const typename TypeOfKind<k>::type*>(type)->get(value);\n}\n\ntemplate<typename T>\ninline T GenericValue::as() const\n{\n  return as<T, KindOfType<T>::value>();\n}\n\ninline int64_t GenericValue::asInt() const\n{\n  return as<int64_t, Type::Int>();\n}\n\ninline float GenericValue::asFloat() const\n{\n  return as<float, Type::Float>();\n}\n\ninline double GenericValue::asDouble() const\n{\n  return as<double, Type::Float>();\n}\n\n\ninline std::string GenericValue::asString() const\n{\n  return \"\"; \/\/ as<std::string, Type::String>();\n}\n\n\nnamespace detail\n{\n  \/** This class can be used to convert the return value of an arbitrary function\n  * into a GenericValue. It handles functions returning void.\n  *\n  *  Usage:\n  *    ValueCopy val;\n  *    val(), functionCall(arg);\n  *\n  *  in val(), parenthesis are useful to avoid compiler warning \"val not used\" when handling void.\n  *\/\n  class GenericValueCopy: public GenericValue\n  {\n  public:\n    template<typename T> void operator,(const T& any);\n    GenericValueCopy &operator()() { return *this; }\n  };\n\n  template<typename T> void GenericValueCopy::operator,(const T& any)\n  {\n    *(GenericValue*)this = toValue(any);\n    *(GenericValue*)this = clone();\n  }\n}\n\n\n}\n\n#endif  \/\/ _QIMESSAGING_DETAILS_GENERICVALUE_HXX_\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <eosio\/chain\/action.hpp>\n#include <numeric>\n\nnamespace eosio { namespace chain {\n\n   struct deferred_transaction_generation_context : fc::reflect_init {\n      static constexpr uint16_t extension_id() { return 0; }\n      static constexpr bool     enforce_unique() { return true; }\n\n      deferred_transaction_generation_context() = default;\n\n      deferred_transaction_generation_context( const transaction_id_type& sender_trx_id, uint128_t sender_id, account_name sender )\n      :sender_trx_id( sender_trx_id )\n      ,sender_id( sender_id )\n      ,sender( sender )\n      {}\n\n      void reflector_init();\n\n      transaction_id_type sender_trx_id;\n      uint128_t           sender_id;\n      account_name        sender;\n   };\n\n   namespace detail {\n      template<typename... Ts>\n      struct transaction_extension_types {\n         using transaction_extension_t = fc::static_variant< Ts... >;\n         using decompose_t = decompose< Ts... >;\n      };\n   }\n\n   using transaction_extension_types = detail::transaction_extension_types<\n      deferred_transaction_generation_context\n   >;\n\n   using transaction_extension = transaction_extension_types::transaction_extension_t;\n\n   \/**\n    *  The transaction header contains the fixed-sized data\n    *  associated with each transaction. It is separated from\n    *  the transaction body to facilitate partial parsing of\n    *  transactions without requiring dynamic memory allocation.\n    *\n    *  All transactions have an expiration time after which they\n    *  may no longer be included in the blockchain. Once a block\n    *  with a block_header::timestamp greater than expiration is\n    *  deemed irreversible, then a user can safely trust the transaction\n    *  will never be included.\n    *\n\n    *  Each region is an independent blockchain, it is included as routing\n    *  information for inter-blockchain communication. A contract in this\n    *  region might generate or authorize a transaction intended for a foreign\n    *  region.\n    *\/\n   struct transaction_header {\n      time_point_sec         expiration;   \/\/\/< the time at which a transaction expires\n      uint16_t               ref_block_num       = 0U; \/\/\/< specifies a block num in the last 2^16 blocks.\n      uint32_t               ref_block_prefix    = 0UL; \/\/\/< specifies the lower 32 bits of the blockid at get_ref_blocknum\n      fc::unsigned_int       max_net_usage_words = 0UL; \/\/\/ upper limit on total network bandwidth (in 8 byte words) billed for this transaction\n      uint8_t                max_cpu_usage_ms    = 0; \/\/\/ upper limit on the total CPU time billed for this transaction\n      fc::unsigned_int       delay_sec           = 0UL; \/\/\/ number of seconds to delay this transaction for during which it may be canceled.\n\n      \/**\n       * @return the absolute block number given the relative ref_block_num\n       *\/\n      block_num_type get_ref_blocknum( block_num_type head_blocknum )const {\n         return ((head_blocknum\/0xffff)*0xffff) + head_blocknum%0xffff;\n      }\n      void set_reference_block( const block_id_type& reference_block );\n      bool verify_reference_block( const block_id_type& reference_block )const;\n      void validate()const;\n   };\n\n   \/**\n    *  A transaction consits of a set of messages which must all be applied or\n    *  all are rejected. These messages have access to data within the given\n    *  read and write scopes.\n    *\/\n   struct transaction : public transaction_header {\n      vector<action>         context_free_actions;\n      vector<action>         actions;\n      extensions_type        transaction_extensions;\n\n      transaction_id_type        id()const;\n      digest_type                sig_digest( const chain_id_type& chain_id, const vector<bytes>& cfd = vector<bytes>() )const;\n      fc::microseconds           get_signature_keys( const vector<signature_type>& signatures,\n                                                     const chain_id_type& chain_id,\n                                                     fc::time_point deadline,\n                                                     const vector<bytes>& cfd,\n                                                     flat_set<public_key_type>& recovered_pub_keys,\n                                                     bool allow_duplicate_keys = false) const;\n\n      uint32_t total_actions()const { return context_free_actions.size() + actions.size(); }\n\n      account_name first_authorizer()const {\n         for( const auto& a : actions ) {\n            for( const auto& u : a.authorization )\n               return u.actor;\n         }\n         return account_name();\n      }\n\n      flat_multimap<uint16_t, transaction_extension> validate_and_extract_extensions()const;\n   };\n\n   struct signed_transaction : public transaction\n   {\n      signed_transaction() = default;\n\/\/      signed_transaction( const signed_transaction& ) = default;\n\/\/      signed_transaction( signed_transaction&& ) = default;\n      signed_transaction( transaction&& trx, const vector<signature_type>& signatures, const vector<bytes>& context_free_data)\n      : transaction(std::move(trx))\n      , signatures(signatures)\n      , context_free_data(context_free_data)\n      {}\n      signed_transaction( transaction&& trx, const vector<signature_type>& signatures, vector<bytes>&& context_free_data)\n      : transaction(std::move(trx))\n      , signatures(signatures)\n      , context_free_data(std::move(context_free_data))\n      {}\n\n      vector<signature_type>    signatures;\n      vector<bytes>             context_free_data; \/\/\/< for each context-free action, there is an entry here\n\n      const signature_type&     sign(const private_key_type& key, const chain_id_type& chain_id);\n      signature_type            sign(const private_key_type& key, const chain_id_type& chain_id)const;\n      fc::microseconds          get_signature_keys( const chain_id_type& chain_id, fc::time_point deadline,\n                                                    flat_set<public_key_type>& recovered_pub_keys,\n                                                    bool allow_duplicate_keys = false )const;\n   };\n\n   struct packed_transaction : fc::reflect_init {\n      enum class compression_type {\n         none = 0,\n         zlib = 1\n      };\n\n      packed_transaction() = default;\n      packed_transaction(packed_transaction&&) = default;\n      explicit packed_transaction(const packed_transaction&) = default;\n      packed_transaction& operator=(const packed_transaction&) = delete;\n      packed_transaction& operator=(packed_transaction&&) = default;\n\n      explicit packed_transaction(const signed_transaction& t, compression_type _compression = compression_type::none)\n      :signatures(t.signatures), compression(_compression), unpacked_trx(t), trx_id(unpacked_trx.id())\n      {\n         local_pack_transaction();\n         local_pack_context_free_data();\n      }\n\n      explicit packed_transaction(signed_transaction&& t, compression_type _compression = compression_type::none)\n      :signatures(t.signatures), compression(_compression), unpacked_trx(std::move(t)), trx_id(unpacked_trx.id())\n      {\n         local_pack_transaction();\n         local_pack_context_free_data();\n      }\n\n      \/\/ used by abi_serializer\n      packed_transaction( bytes&& packed_txn, vector<signature_type>&& sigs, bytes&& packed_cfd, compression_type _compression );\n      packed_transaction( bytes&& packed_txn, vector<signature_type>&& sigs, vector<bytes>&& cfd, compression_type _compression );\n      packed_transaction( transaction&& t, vector<signature_type>&& sigs, bytes&& packed_cfd, compression_type _compression );\n\n      uint32_t get_unprunable_size()const;\n      uint32_t get_prunable_size()const;\n\n      digest_type packed_digest()const;\n\n      const transaction_id_type& id()const { return trx_id; }\n      bytes               get_raw_transaction()const;\n\n      time_point_sec                expiration()const { return unpacked_trx.expiration; }\n      const vector<bytes>&          get_context_free_data()const { return unpacked_trx.context_free_data; }\n      const transaction&            get_transaction()const { return unpacked_trx; }\n      const signed_transaction&     get_signed_transaction()const { return unpacked_trx; }\n      const vector<signature_type>& get_signatures()const { return signatures; }\n      const fc::enum_type<uint8_t,compression_type>& get_compression()const { return compression; }\n      const bytes&                  get_packed_context_free_data()const { return packed_context_free_data; }\n      const bytes&                  get_packed_transaction()const { return packed_trx; }\n\n   private:\n      void local_unpack_transaction(vector<bytes>&& context_free_data);\n      void local_unpack_context_free_data();\n      void local_pack_transaction();\n      void local_pack_context_free_data();\n\n      friend struct fc::reflector<packed_transaction>;\n      friend struct fc::reflector_init_visitor<packed_transaction>;\n      friend struct fc::has_reflector_init<packed_transaction>;\n      void reflector_init();\n   private:\n      vector<signature_type>                  signatures;\n      fc::enum_type<uint8_t,compression_type> compression;\n      bytes                                   packed_context_free_data;\n      bytes                                   packed_trx;\n\n   private:\n      \/\/ cache unpacked trx, for thread safety do not modify after construction\n      signed_transaction                      unpacked_trx;\n      transaction_id_type                     trx_id;\n   };\n\n   using packed_transaction_ptr = std::shared_ptr<packed_transaction>;\n\n   uint128_t transaction_id_to_sender_id( const transaction_id_type& tid );\n\n} } \/\/\/ namespace eosio::chain\n\nFC_REFLECT(eosio::chain::deferred_transaction_generation_context, (sender_trx_id)(sender_id)(sender) )\nFC_REFLECT( eosio::chain::transaction_header, (expiration)(ref_block_num)(ref_block_prefix)\n                                              (max_net_usage_words)(max_cpu_usage_ms)(delay_sec) )\nFC_REFLECT_DERIVED( eosio::chain::transaction, (eosio::chain::transaction_header), (context_free_actions)(actions)(transaction_extensions) )\nFC_REFLECT_DERIVED( eosio::chain::signed_transaction, (eosio::chain::transaction), (signatures)(context_free_data) )\nFC_REFLECT_ENUM( eosio::chain::packed_transaction::compression_type, (none)(zlib))\n\n\/\/ @ignore unpacked_trx trx_id \nFC_REFLECT( eosio::chain::packed_transaction, (signatures)(compression)(packed_context_free_data)(packed_trx) )\n<commit_msg>took out ignore<commit_after>#pragma once\n\n#include <eosio\/chain\/action.hpp>\n#include <numeric>\n\nnamespace eosio { namespace chain {\n\n   struct deferred_transaction_generation_context : fc::reflect_init {\n      static constexpr uint16_t extension_id() { return 0; }\n      static constexpr bool     enforce_unique() { return true; }\n\n      deferred_transaction_generation_context() = default;\n\n      deferred_transaction_generation_context( const transaction_id_type& sender_trx_id, uint128_t sender_id, account_name sender )\n      :sender_trx_id( sender_trx_id )\n      ,sender_id( sender_id )\n      ,sender( sender )\n      {}\n\n      void reflector_init();\n\n      transaction_id_type sender_trx_id;\n      uint128_t           sender_id;\n      account_name        sender;\n   };\n\n   namespace detail {\n      template<typename... Ts>\n      struct transaction_extension_types {\n         using transaction_extension_t = fc::static_variant< Ts... >;\n         using decompose_t = decompose< Ts... >;\n      };\n   }\n\n   using transaction_extension_types = detail::transaction_extension_types<\n      deferred_transaction_generation_context\n   >;\n\n   using transaction_extension = transaction_extension_types::transaction_extension_t;\n\n   \/**\n    *  The transaction header contains the fixed-sized data\n    *  associated with each transaction. It is separated from\n    *  the transaction body to facilitate partial parsing of\n    *  transactions without requiring dynamic memory allocation.\n    *\n    *  All transactions have an expiration time after which they\n    *  may no longer be included in the blockchain. Once a block\n    *  with a block_header::timestamp greater than expiration is\n    *  deemed irreversible, then a user can safely trust the transaction\n    *  will never be included.\n    *\n\n    *  Each region is an independent blockchain, it is included as routing\n    *  information for inter-blockchain communication. A contract in this\n    *  region might generate or authorize a transaction intended for a foreign\n    *  region.\n    *\/\n   struct transaction_header {\n      time_point_sec         expiration;   \/\/\/< the time at which a transaction expires\n      uint16_t               ref_block_num       = 0U; \/\/\/< specifies a block num in the last 2^16 blocks.\n      uint32_t               ref_block_prefix    = 0UL; \/\/\/< specifies the lower 32 bits of the blockid at get_ref_blocknum\n      fc::unsigned_int       max_net_usage_words = 0UL; \/\/\/ upper limit on total network bandwidth (in 8 byte words) billed for this transaction\n      uint8_t                max_cpu_usage_ms    = 0; \/\/\/ upper limit on the total CPU time billed for this transaction\n      fc::unsigned_int       delay_sec           = 0UL; \/\/\/ number of seconds to delay this transaction for during which it may be canceled.\n\n      \/**\n       * @return the absolute block number given the relative ref_block_num\n       *\/\n      block_num_type get_ref_blocknum( block_num_type head_blocknum )const {\n         return ((head_blocknum\/0xffff)*0xffff) + head_blocknum%0xffff;\n      }\n      void set_reference_block( const block_id_type& reference_block );\n      bool verify_reference_block( const block_id_type& reference_block )const;\n      void validate()const;\n   };\n\n   \/**\n    *  A transaction consits of a set of messages which must all be applied or\n    *  all are rejected. These messages have access to data within the given\n    *  read and write scopes.\n    *\/\n   struct transaction : public transaction_header {\n      vector<action>         context_free_actions;\n      vector<action>         actions;\n      extensions_type        transaction_extensions;\n\n      transaction_id_type        id()const;\n      digest_type                sig_digest( const chain_id_type& chain_id, const vector<bytes>& cfd = vector<bytes>() )const;\n      fc::microseconds           get_signature_keys( const vector<signature_type>& signatures,\n                                                     const chain_id_type& chain_id,\n                                                     fc::time_point deadline,\n                                                     const vector<bytes>& cfd,\n                                                     flat_set<public_key_type>& recovered_pub_keys,\n                                                     bool allow_duplicate_keys = false) const;\n\n      uint32_t total_actions()const { return context_free_actions.size() + actions.size(); }\n\n      account_name first_authorizer()const {\n         for( const auto& a : actions ) {\n            for( const auto& u : a.authorization )\n               return u.actor;\n         }\n         return account_name();\n      }\n\n      flat_multimap<uint16_t, transaction_extension> validate_and_extract_extensions()const;\n   };\n\n   struct signed_transaction : public transaction\n   {\n      signed_transaction() = default;\n\/\/      signed_transaction( const signed_transaction& ) = default;\n\/\/      signed_transaction( signed_transaction&& ) = default;\n      signed_transaction( transaction&& trx, const vector<signature_type>& signatures, const vector<bytes>& context_free_data)\n      : transaction(std::move(trx))\n      , signatures(signatures)\n      , context_free_data(context_free_data)\n      {}\n      signed_transaction( transaction&& trx, const vector<signature_type>& signatures, vector<bytes>&& context_free_data)\n      : transaction(std::move(trx))\n      , signatures(signatures)\n      , context_free_data(std::move(context_free_data))\n      {}\n\n      vector<signature_type>    signatures;\n      vector<bytes>             context_free_data; \/\/\/< for each context-free action, there is an entry here\n\n      const signature_type&     sign(const private_key_type& key, const chain_id_type& chain_id);\n      signature_type            sign(const private_key_type& key, const chain_id_type& chain_id)const;\n      fc::microseconds          get_signature_keys( const chain_id_type& chain_id, fc::time_point deadline,\n                                                    flat_set<public_key_type>& recovered_pub_keys,\n                                                    bool allow_duplicate_keys = false )const;\n   };\n\n   struct packed_transaction : fc::reflect_init {\n      enum class compression_type {\n         none = 0,\n         zlib = 1\n      };\n\n      packed_transaction() = default;\n      packed_transaction(packed_transaction&&) = default;\n      explicit packed_transaction(const packed_transaction&) = default;\n      packed_transaction& operator=(const packed_transaction&) = delete;\n      packed_transaction& operator=(packed_transaction&&) = default;\n\n      explicit packed_transaction(const signed_transaction& t, compression_type _compression = compression_type::none)\n      :signatures(t.signatures), compression(_compression), unpacked_trx(t), trx_id(unpacked_trx.id())\n      {\n         local_pack_transaction();\n         local_pack_context_free_data();\n      }\n\n      explicit packed_transaction(signed_transaction&& t, compression_type _compression = compression_type::none)\n      :signatures(t.signatures), compression(_compression), unpacked_trx(std::move(t)), trx_id(unpacked_trx.id())\n      {\n         local_pack_transaction();\n         local_pack_context_free_data();\n      }\n\n      \/\/ used by abi_serializer\n      packed_transaction( bytes&& packed_txn, vector<signature_type>&& sigs, bytes&& packed_cfd, compression_type _compression );\n      packed_transaction( bytes&& packed_txn, vector<signature_type>&& sigs, vector<bytes>&& cfd, compression_type _compression );\n      packed_transaction( transaction&& t, vector<signature_type>&& sigs, bytes&& packed_cfd, compression_type _compression );\n\n      uint32_t get_unprunable_size()const;\n      uint32_t get_prunable_size()const;\n\n      digest_type packed_digest()const;\n\n      const transaction_id_type& id()const { return trx_id; }\n      bytes               get_raw_transaction()const;\n\n      time_point_sec                expiration()const { return unpacked_trx.expiration; }\n      const vector<bytes>&          get_context_free_data()const { return unpacked_trx.context_free_data; }\n      const transaction&            get_transaction()const { return unpacked_trx; }\n      const signed_transaction&     get_signed_transaction()const { return unpacked_trx; }\n      const vector<signature_type>& get_signatures()const { return signatures; }\n      const fc::enum_type<uint8_t,compression_type>& get_compression()const { return compression; }\n      const bytes&                  get_packed_context_free_data()const { return packed_context_free_data; }\n      const bytes&                  get_packed_transaction()const { return packed_trx; }\n\n   private:\n      void local_unpack_transaction(vector<bytes>&& context_free_data);\n      void local_unpack_context_free_data();\n      void local_pack_transaction();\n      void local_pack_context_free_data();\n\n      friend struct fc::reflector<packed_transaction>;\n      friend struct fc::reflector_init_visitor<packed_transaction>;\n      friend struct fc::has_reflector_init<packed_transaction>;\n      void reflector_init();\n   private:\n      vector<signature_type>                  signatures;\n      fc::enum_type<uint8_t,compression_type> compression;\n      bytes                                   packed_context_free_data;\n      bytes                                   packed_trx;\n\n   private:\n      \/\/ cache unpacked trx, for thread safety do not modify after construction\n      signed_transaction                      unpacked_trx;\n      transaction_id_type                     trx_id;\n   };\n\n   using packed_transaction_ptr = std::shared_ptr<packed_transaction>;\n\n   uint128_t transaction_id_to_sender_id( const transaction_id_type& tid );\n\n} } \/\/\/ namespace eosio::chain\n\nFC_REFLECT(eosio::chain::deferred_transaction_generation_context, (sender_trx_id)(sender_id)(sender) )\nFC_REFLECT( eosio::chain::transaction_header, (expiration)(ref_block_num)(ref_block_prefix)\n                                              (max_net_usage_words)(max_cpu_usage_ms)(delay_sec) )\nFC_REFLECT_DERIVED( eosio::chain::transaction, (eosio::chain::transaction_header), (context_free_actions)(actions)(transaction_extensions) )\nFC_REFLECT_DERIVED( eosio::chain::signed_transaction, (eosio::chain::transaction), (signatures)(context_free_data) )\nFC_REFLECT_ENUM( eosio::chain::packed_transaction::compression_type, (none)(zlib))\n\nFC_REFLECT(eosio::chain::packed_transaction, (signatures)(compression)(packed_context_free_data)(packed_trx))\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2014 Pavel Kirienko <pavel.kirienko@gmail.com>\n *\/\n\n#include <unistd.h>\n#include <zubax_chibios\/sys\/sys.h>\n#include <uavcan_stm32\/uavcan_stm32.hpp>\n#include <uavcan\/protocol\/global_time_sync_slave.hpp>\n#include <uavcan\/protocol\/dynamic_node_id_client.hpp>\n#include \"board\/board.hpp\"\n\nnamespace app\n{\nnamespace\n{\n\nuavcan_stm32::CanInitHelper<128> can;\n\nconstexpr unsigned NodePoolSize = 16384;\n\nuavcan::Node<NodePoolSize>& getNode()\n{\n    static uavcan::Node<NodePoolSize> node(can.driver, uavcan_stm32::SystemClock::instance());\n    return node;\n}\n\nvoid init()\n{\n    board::init();\n\n    \/*\n     * CAN auto bit rate detection.\n     * Automatic bit rate detection requires that the bus has at least one other CAN node publishing some\n     * frames periodically.\n     * Auto bit rate detection can be bypassed byif the desired bit rate is passed directly to can.init(), e.g.:\n     *   can.init(1000000);\n     *\/\n    int res = 0;\n    do\n    {\n        ::sleep(1);\n        ::syslog(\"CAN auto bit rate detection...\\n\");\n\n        std::uint32_t bitrate = 0;\n        res = can.init([]() { ::usleep(can.getRecommendedListeningDelay().toUSec()); }, bitrate);\n        if (res >= 0)\n        {\n            ::syslog(\"CAN inited at %u bps\\n\", unsigned(bitrate));\n        }\n    }\n    while (res < 0);\n}\n\nclass : public chibios_rt::BaseStaticThread<8192>\n{\n    void configureNodeInfo()\n    {\n        getNode().setName(\"org.uavcan.stm32_test_stm32f107\");\n\n        \/*\n         * Software version\n         * TODO: Fill other fields too\n         *\/\n        uavcan::protocol::SoftwareVersion swver;\n\n        swver.vcs_commit = GIT_HASH;\n        swver.optional_field_flags = swver.OPTIONAL_FIELD_FLAG_VCS_COMMIT;\n\n        getNode().setSoftwareVersion(swver);\n\n        syslog(\"Git commit hash: 0x%08x\\n\", GIT_HASH);\n\n        \/*\n         * Hardware version\n         * TODO: Fill other fields too\n         *\/\n        uavcan::protocol::HardwareVersion hwver;\n\n        std::uint8_t uid[board::UniqueIDSize] = {};\n        board::readUniqueID(uid);\n        std::copy(std::begin(uid), std::end(uid), std::begin(hwver.unique_id));\n\n        getNode().setHardwareVersion(hwver);\n\n        syslog(\"UDID:\");\n        for (auto b : hwver.unique_id)\n        {\n            syslog(\" %02x\", unsigned(b));\n        }\n        syslog(\"\\n\");\n    }\n\n    void performDynamicNodeIDAllocation()\n    {\n        uavcan::DynamicNodeIDClient client(getNode());\n\n        const int client_start_res = client.start(getNode().getHardwareVersion().unique_id);\n        if (client_start_res < 0)\n        {\n            board::die(client_start_res);\n        }\n\n        syslog(\"Waiting for dynamic node ID allocation...\\n\");\n        while (!client.isAllocationComplete())\n        {\n            const int spin_res = getNode().spin(uavcan::MonotonicDuration::fromMSec(100));\n            if (spin_res < 0)\n            {\n                syslog(\"Spin failure: %i\\n\", spin_res);\n            }\n        }\n\n        syslog(\"Dynamic node ID %d allocated by %d\\n\",\n                  int(client.getAllocatedNodeID().get()),\n                  int(client.getAllocatorNodeID().get()));\n\n        getNode().setNodeID(client.getAllocatedNodeID());\n    }\n\npublic:\n    msg_t main()\n    {\n        \/*\n         * Setting up the node parameters\n         *\/\n        configureNodeInfo();\n\n        \/*\n         * Initializing the UAVCAN node\n         *\/\n        const int node_init_res = getNode().start();\n        if (node_init_res < 0)\n        {\n            board::die(node_init_res);\n        }\n\n        \/*\n         * Waiting for a dynamic node ID allocation\n         *\/\n        performDynamicNodeIDAllocation();\n\n        \/*\n         * Time synchronizer\n         *\/\n        static uavcan::GlobalTimeSyncSlave time_sync_slave(getNode());\n        {\n            const int res = time_sync_slave.start();\n            if (res < 0)\n            {\n                board::die(res);\n            }\n        }\n\n        \/*\n         * Main loop\n         *\/\n        syslog(\"UAVCAN node started\\n\");\n        getNode().setModeOperational();\n        while (true)\n        {\n            const int spin_res = getNode().spin(uavcan::MonotonicDuration::fromMSec(5000));\n            if (spin_res < 0)\n            {\n                syslog(\"Spin failure: %i\\n\", spin_res);\n            }\n\n            syslog(\"Time sync master: %u\\n\", unsigned(time_sync_slave.getMasterNodeID().get()));\n\n            syslog(\"Memory usage: free=%u used=%u worst=%u\\n\",\n                      getNode().getAllocator().getNumFreeBlocks(),\n                      getNode().getAllocator().getNumUsedBlocks(),\n                      getNode().getAllocator().getPeakNumUsedBlocks());\n\n            syslog(\"CAN errors: %lu %lu\\n\",\n                      static_cast<unsigned long>(can.driver.getIface(0)->getErrorCount()),\n                      static_cast<unsigned long>(can.driver.getIface(1)->getErrorCount()));\n\n#if !UAVCAN_TINY\n            node.getLogger().setLevel(uavcan::protocol::debug::LogLevel::INFO);\n            node.logInfo(\"app\", \"UTC %* sec, %* corr, %* jumps\",\n                         uavcan_stm32::clock::getUtc().toMSec() \/ 1000,\n                         uavcan_stm32::clock::getUtcSpeedCorrectionPPM(),\n                         uavcan_stm32::clock::getUtcAjdustmentJumpCount());\n#endif\n        }\n        return msg_t();\n    }\n} uavcan_node_thread;\n\n}\n}\n\nint main()\n{\n    app::init();\n\n    syslog(\"Starting the UAVCAN thread\\n\");\n    app::uavcan_node_thread.start(LOWPRIO);\n\n    while (true)\n    {\n        for (int i = 0; i < 200; i++)\n        {\n            board::setLed(app::can.driver.hadActivity());\n            ::usleep(25000);\n        }\n\n        const uavcan::UtcTime utc = uavcan_stm32::clock::getUtc();\n        syslog(\"UTC %lu sec   Rate corr: %fPPM   Jumps: %lu   Locked: %i\\n\",\n                  static_cast<unsigned long>(utc.toMSec() \/ 1000),\n                  uavcan_stm32::clock::getUtcRateCorrectionPPM(),\n                  uavcan_stm32::clock::getUtcJumpCount(),\n                  int(uavcan_stm32::clock::isUtcLocked()));\n    }\n}\n<commit_msg>Back out upstream changes from test_stm32f107\/src\/main.cpp<commit_after>\/*\n * Copyright (C) 2014 Pavel Kirienko <pavel.kirienko@gmail.com>\n *\/\n\n#include <unistd.h>\n#include <zubax_chibios\/sys\/sys.h>\n#include <uavcan_stm32\/uavcan_stm32.hpp>\n#include <uavcan\/protocol\/global_time_sync_slave.hpp>\n#include <uavcan\/protocol\/dynamic_node_id_client.hpp>\n#include \"board\/board.hpp\"\n\nnamespace app\n{\nnamespace\n{\n\nuavcan_stm32::CanInitHelper<128> can;\n\nconstexpr unsigned NodePoolSize = 16384;\n\nuavcan::Node<NodePoolSize>& getNode()\n{\n    static uavcan::Node<NodePoolSize> node(can.driver, uavcan_stm32::SystemClock::instance());\n    return node;\n}\n\nvoid init()\n{\n    board::init();\n\n    \/*\n     * CAN auto bit rate detection.\n     * Automatic bit rate detection requires that the bus has at least one other CAN node publishing some\n     * frames periodically.\n     * Auto bit rate detection can be bypassed byif the desired bit rate is passed directly to can.init(), e.g.:\n     *   can.init(1000000);\n     *\/\n    int res = 0;\n    do\n    {\n        ::sleep(1);\n        ::lowsyslog(\"CAN auto bit rate detection...\\n\");\n\n        std::uint32_t bitrate = 0;\n        res = can.init([]() { ::usleep(can.getRecommendedListeningDelay().toUSec()); }, bitrate);\n        if (res >= 0)\n        {\n            ::lowsyslog(\"CAN inited at %u bps\\n\", unsigned(bitrate));\n        }\n    }\n    while (res < 0);\n}\n\nclass : public chibios_rt::BaseStaticThread<8192>\n{\n    void configureNodeInfo()\n    {\n        getNode().setName(\"org.uavcan.stm32_test_stm32f107\");\n\n        \/*\n         * Software version\n         * TODO: Fill other fields too\n         *\/\n        uavcan::protocol::SoftwareVersion swver;\n\n        swver.vcs_commit = GIT_HASH;\n        swver.optional_field_flags = swver.OPTIONAL_FIELD_FLAG_VCS_COMMIT;\n\n        getNode().setSoftwareVersion(swver);\n\n        lowsyslog(\"Git commit hash: 0x%08x\\n\", GIT_HASH);\n\n        \/*\n         * Hardware version\n         * TODO: Fill other fields too\n         *\/\n        uavcan::protocol::HardwareVersion hwver;\n\n        std::uint8_t uid[board::UniqueIDSize] = {};\n        board::readUniqueID(uid);\n        std::copy(std::begin(uid), std::end(uid), std::begin(hwver.unique_id));\n\n        getNode().setHardwareVersion(hwver);\n\n        lowsyslog(\"UDID:\");\n        for (auto b : hwver.unique_id)\n        {\n            lowsyslog(\" %02x\", unsigned(b));\n        }\n        lowsyslog(\"\\n\");\n    }\n\n    void performDynamicNodeIDAllocation()\n    {\n        uavcan::DynamicNodeIDClient client(getNode());\n\n        const int client_start_res = client.start(getNode().getHardwareVersion().unique_id);\n        if (client_start_res < 0)\n        {\n            board::die(client_start_res);\n        }\n\n        lowsyslog(\"Waiting for dynamic node ID allocation...\\n\");\n        while (!client.isAllocationComplete())\n        {\n            const int spin_res = getNode().spin(uavcan::MonotonicDuration::fromMSec(100));\n            if (spin_res < 0)\n            {\n                lowsyslog(\"Spin failure: %i\\n\", spin_res);\n            }\n        }\n\n        lowsyslog(\"Dynamic node ID %d allocated by %d\\n\",\n                  int(client.getAllocatedNodeID().get()),\n                  int(client.getAllocatorNodeID().get()));\n\n        getNode().setNodeID(client.getAllocatedNodeID());\n    }\n\npublic:\n    msg_t main()\n    {\n        \/*\n         * Setting up the node parameters\n         *\/\n        configureNodeInfo();\n\n        \/*\n         * Initializing the UAVCAN node\n         *\/\n        const int node_init_res = getNode().start();\n        if (node_init_res < 0)\n        {\n            board::die(node_init_res);\n        }\n\n        \/*\n         * Waiting for a dynamic node ID allocation\n         *\/\n        performDynamicNodeIDAllocation();\n\n        \/*\n         * Time synchronizer\n         *\/\n        static uavcan::GlobalTimeSyncSlave time_sync_slave(getNode());\n        {\n            const int res = time_sync_slave.start();\n            if (res < 0)\n            {\n                board::die(res);\n            }\n        }\n\n        \/*\n         * Main loop\n         *\/\n        lowsyslog(\"UAVCAN node started\\n\");\n        getNode().setModeOperational();\n        while (true)\n        {\n            const int spin_res = getNode().spin(uavcan::MonotonicDuration::fromMSec(5000));\n            if (spin_res < 0)\n            {\n                lowsyslog(\"Spin failure: %i\\n\", spin_res);\n            }\n\n            lowsyslog(\"Time sync master: %u\\n\", unsigned(time_sync_slave.getMasterNodeID().get()));\n\n            lowsyslog(\"Memory usage: free=%u used=%u worst=%u\\n\",\n                      getNode().getAllocator().getNumFreeBlocks(),\n                      getNode().getAllocator().getNumUsedBlocks(),\n                      getNode().getAllocator().getPeakNumUsedBlocks());\n\n            lowsyslog(\"CAN errors: %lu %lu\\n\",\n                      static_cast<unsigned long>(can.driver.getIface(0)->getErrorCount()),\n                      static_cast<unsigned long>(can.driver.getIface(1)->getErrorCount()));\n\n#if !UAVCAN_TINY\n            node.getLogger().setLevel(uavcan::protocol::debug::LogLevel::INFO);\n            node.logInfo(\"app\", \"UTC %* sec, %* corr, %* jumps\",\n                         uavcan_stm32::clock::getUtc().toMSec() \/ 1000,\n                         uavcan_stm32::clock::getUtcSpeedCorrectionPPM(),\n                         uavcan_stm32::clock::getUtcAjdustmentJumpCount());\n#endif\n        }\n        return msg_t();\n    }\n} uavcan_node_thread;\n\n}\n}\n\nint main()\n{\n    app::init();\n\n    lowsyslog(\"Starting the UAVCAN thread\\n\");\n    app::uavcan_node_thread.start(LOWPRIO);\n\n    while (true)\n    {\n        for (int i = 0; i < 200; i++)\n        {\n            board::setLed(app::can.driver.hadActivity());\n            ::usleep(25000);\n        }\n\n        const uavcan::UtcTime utc = uavcan_stm32::clock::getUtc();\n        lowsyslog(\"UTC %lu sec   Rate corr: %fPPM   Jumps: %lu   Locked: %i\\n\",\n                  static_cast<unsigned long>(utc.toMSec() \/ 1000),\n                  uavcan_stm32::clock::getUtcRateCorrectionPPM(),\n                  uavcan_stm32::clock::getUtcJumpCount(),\n                  int(uavcan_stm32::clock::isUtcLocked()));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 Sirikata 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 \"EmersonMessagingManager.hpp\"\n#include \"JSLogging.hpp\"\n#include <sirikata\/core\/network\/Frame.hpp>\n#include \"Protocol_Frame.pbj.hpp\"\n\nnamespace Sirikata{\nnamespace JS{\n\n#define EMERSON_RELIABLE_COMMUNICATION_PORT 5\n\nEmersonMessagingManager::EmersonMessagingManager(ObjectHostContext* ctx)\n : mMainContext(ctx)\n{\n}\n\nEmersonMessagingManager::~EmersonMessagingManager()\n{\n    \/\/ Close all streams, clear out listeners\n    for(PresenceStreamMap::iterator pres_it = mStreams.begin(); pres_it != mStreams.end(); pres_it++) {\n        \/\/ Stop listening for new streams\n        const SpaceObjectReference& pres_id = pres_it->first;\n        mMainContext->sstConnMgr()->unlisten(\n            SST::EndPoint<SpaceObjectReference>(pres_id,EMERSON_RELIABLE_COMMUNICATION_PORT)\n        );\n\n        \/\/ Stop listening for substreams on the streams we have, close them\n        StreamMap& pres_streams = pres_it->second;\n        for(StreamMap::iterator it = pres_streams.begin(); it != pres_streams.end(); it++) {\n            SSTStreamPtr stream = it->second;\n            stream->unlistenSubstream(EMERSON_RELIABLE_COMMUNICATION_PORT);\n            stream->close(false);\n        }\n    }\n\n    mStreams.clear();\n}\n\nvoid EmersonMessagingManager::presenceConnected(const SpaceObjectReference& connPresSporef)\n{\n    allPres[connPresSporef] = true;\n\n    \/\/create a listener for scripting messages to presence with sporef connPresSporef.\n    mMainContext->sstConnMgr()->listen(\n        std::tr1::bind(&EmersonMessagingManager::createScriptCommListenerStreamCB,this,\n            livenessToken(), connPresSporef,_1,_2\n        ),\n        SST::EndPoint<SpaceObjectReference>(connPresSporef,EMERSON_RELIABLE_COMMUNICATION_PORT)\n    );\n}\n\nvoid EmersonMessagingManager::presenceDisconnected(const SpaceObjectReference& disconnPresSporef)\n{\n    std::map<SpaceObjectReference,bool>::iterator allPresFinder = allPres.find(disconnPresSporef);\n    if (allPresFinder == allPres.end())\n    {\n        JSLOG(error,\"Error in messaging manager: requested a disconnect for a presence that was not already connected.\");\n        return;\n    }\n    allPres.erase(allPresFinder);\n    clearStreams(disconnPresSporef);\n}\n\n\n\nvoid EmersonMessagingManager::setupNewStream(\n    SSTStreamPtr sstStream,bool closePrevious)\n{\n    \/\/ Regardless of whether we want to hold on to this or not, make sure we set\n    \/\/ it up in case it gets used\n\n    \/\/ Listen for substreams, which is where we'll actually receive data. This\n    \/\/ top level stream goes unused.\n    sstStream->listenSubstream(\n        EMERSON_RELIABLE_COMMUNICATION_PORT,\n        std::tr1::bind(\n            &EmersonMessagingManager::handleIncomingSubstream, this,\n            livenessToken(), _1, _2\n        )\n    );\n\n    \/\/ Then figure out whether to save it for ourselves\n    SpaceObjectReference pres = sstStream->localEndPoint().endPoint;\n    SpaceObjectReference sender = sstStream->remoteEndPoint().endPoint;\n\n    \/\/ Simple rule for resolving which stream to save.\n    bool save_mine = pres < sender;\n\n\n    \/\/doing this for the case where a previous stream wasn't responding to\n    \/\/messages, and we want to close it and replace it.  (should really only\n    \/\/happen in call scriptCommWriteStreamConnectedCB, which only gets called if\n    \/\/previous stream didn't exist or if it did exist, but couldn't get messages\n    \/\/to other end after numerous retries.)\n    if (closePrevious)\n    {\n        if (mStreams.find(pres) != mStreams.end())\n        {\n            JSLOG(detailed,\"Deleting existing stream map to make way for new one\");\n            StreamMap& smap = mStreams[pres];\n            StreamMap::iterator particularStreamIt  = smap.find(sender);\n            if (particularStreamIt != smap.end())\n            {\n                particularStreamIt->second->close(false);\n                smap.erase(particularStreamIt);\n            }\n        }\n    }\n\n\n    StreamMap& pres_streams = mStreams[pres];\n    StreamMap::iterator it = pres_streams.find(sender);\n    if (it == pres_streams.end() || !it->second->connected() || save_mine) {\n        pres_streams[sender] = sstStream;\n    }\n}\n\n\nSSTStreamPtr EmersonMessagingManager::getStream(const SpaceObjectReference& pres, const SpaceObjectReference& remote) {\n    PresenceStreamMap::iterator pres_it = mStreams.find(pres);\n    if (pres_it == mStreams.end()) return SSTStreamPtr();\n    StreamMap& pres_streams = pres_it->second;\n\n    StreamMap::iterator it = pres_streams.find(remote);\n    if (it != pres_streams.end()) {\n        return it->second;\n    }\n    return SSTStreamPtr();\n}\n\nvoid EmersonMessagingManager::clearStreams(const SpaceObjectReference& pres) {\n    PresenceStreamMap::iterator pres_it = mStreams.find(pres);\n    if (pres_it != mStreams.end())\n        mStreams.erase(pres_it);\n}\n\n\/\/Gets executed whenever a new stream connects to presence with sporef toListenFrom.\nvoid EmersonMessagingManager::createScriptCommListenerStreamCB(Liveness::Token alive, const SpaceObjectReference& toListenFrom, int err, SSTStreamPtr sstStream)\n{\n    if (!alive) return;\n\n    if (err != SST_IMPL_SUCCESS)\n    {\n        JSLOG(error,\"Error in createScriptCommListenerStreamCB.  Stream could not be created.\");\n        return;\n    }\n    setupNewStream(sstStream);\n}\n\nvoid EmersonMessagingManager::handleIncomingSubstream(Liveness::Token alive, int err, SSTStreamPtr streamPtr) {\n    if (!alive) return;\n\n    if (err != SST_IMPL_SUCCESS) return;\n\n    String* msgBuf = new String();\n    streamPtr->registerReadCallback(\n        std::tr1::bind(&EmersonMessagingManager::handleScriptCommStreamRead, this,\n            livenessToken(), streamPtr, msgBuf, _1, _2)\n    );\n}\n\n\n\/\/Gets executed whenever have additional data to read.\nvoid EmersonMessagingManager::handleScriptCommStreamRead(Liveness::Token alive, SSTStreamPtr sstptr, String* prevdata, uint8* buffer, int length)\n{\n    if (!alive) {\n        delete prevdata;\n        sstptr->registerReadCallback(0);\n        sstptr->close(false);\n        return;\n    }\n\n    prevdata->append((const char*)buffer, length);\n\n    \/\/ We should only ever get one message per substream, so there's no need to\n    \/\/ loop and we can clean up as soon as we parse a message successfully.\n    std::string msg = Network::Frame::parse(*prevdata);\n\n    \/\/ If we don't have a full message, just wait for more\n    if (msg.empty())\n        return;\n\n    \/\/otherwise, try to handle it.\n    handleScriptCommRead(sstptr->remoteEndPoint().endPoint, sstptr->localEndPoint().endPoint, msg);\n\n\n    delete prevdata;\n    sstptr->registerReadCallback(0);\n    sstptr->close(false);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/writing functions.\n\nbool EmersonMessagingManager::sendScriptCommMessageReliable(const SpaceObjectReference& sender, const SpaceObjectReference& receiver, const String& msg) {\n    \/\/ arbitrary default # of retries\n    return sendScriptCommMessageReliable(sender, receiver, msg, 10,5);\n}\n\nvoid EmersonMessagingManager::removeStream(\n    const SpaceObjectReference& sender, const SpaceObjectReference& receiver)\n{\n    if (mStreams.find(sender) != mStreams.end())\n    {\n        StreamMap& smap = mStreams[sender];\n        for(StreamMap::iterator it = smap.begin(); it != smap.end(); it++)\n            it->second->close(false);\n        mStreams.erase(sender);\n    }\n}\n\nbool EmersonMessagingManager::sendScriptCommMessageReliable(const SpaceObjectReference& sender, const SpaceObjectReference& receiver, const String& msg, int8 retriesSameStream,int8 retriesNewStream,bool isRetry)\n{\n    bool returner = false;\n\n    \/\/if we have tried to create a bunch of new streams, and that has still\n    \/\/failed, then remove the existing stream (if it's there), and drop message.\n    if (retriesNewStream == 0)\n    {\n        JSLOG(error, \"Cannot send message from sender \"<< sender<<\\\n              \" to \"<<receiver<<\".  Aborting.\");\n        removeStream(sender,receiver);\n        return false;\n    }\n\n\n    if (retriesSameStream > 0)\n    {\n        \/\/ If we have a stream\n        SSTStreamPtr streamPtr = getStream(sender, receiver);\n        if (streamPtr)\n        {\n            writeMessage(\n                livenessToken(), streamPtr, msg, sender,\n                receiver, retriesSameStream,--retriesNewStream);\n            return true;\n        }\n    }\n\n\n    \/\/what to do when the connection is created.\n    CommWriteStreamConnectedCBRetryData retryData;\n    retryData.retriesSameStream = retriesSameStream;\n    retryData.retriesNewStream = --retriesNewStream;\n    retryData.isRetry = isRetry;\n\n    \/\/ Otherwise, start the process of connecting\n    \/\/ connection will overwrite existing streams if they are there.\n    returner = mMainContext->sstConnMgr()->connectStream(\n        SST::EndPoint<SpaceObjectReference>(sender,0), \/\/local port is random\n\n        \/\/send to receiver's script comm port\n        SST::EndPoint<SpaceObjectReference>(receiver,EMERSON_RELIABLE_COMMUNICATION_PORT),\n\n        std::tr1::bind(\n            &EmersonMessagingManager::scriptCommWriteStreamConnectedCB, this,\n            livenessToken(),\n            msg, sender,receiver, _1, _2, retryData\n        )\n    );\n\n    return returner;\n}\n\n\nvoid EmersonMessagingManager::scriptCommWriteStreamConnectedCB(\n    Liveness::Token alive, const String& msg,\n    const SpaceObjectReference& sender,\n    const SpaceObjectReference& receiver, int err, SSTStreamPtr streamPtr,\n    CommWriteStreamConnectedCBRetryData retryData)\n{\n    if (!alive) return;\n\n    int8 retriesSameStream = retryData.retriesSameStream;\n    int8 retriesNewStream = retryData.retriesNewStream;\n    bool isRetry = retryData.isRetry;\n\n    \/\/if connection failure, just try to re-connect.\n    if (err != SST_IMPL_SUCCESS)\n    {\n        if (retriesSameStream > 0)\n        {\n            sendScriptCommMessageReliable(\n                sender, receiver, msg, --retriesSameStream,\n                retriesNewStream,true);\n        }\n        return;\n    }\n    \/\/will overwrite any existing streams if they existed before.\n    setupNewStream(streamPtr,isRetry);\n\n    writeMessage(\n        livenessToken(), streamPtr, msg, sender,\n        receiver, retriesSameStream,retriesNewStream);\n}\n\nvoid EmersonMessagingManager::writeMessage(\n    Liveness::Token alive, SSTStreamPtr streamPtr,\n    const String& msg, const SpaceObjectReference& sender,\n    const SpaceObjectReference& receiver, int8 retriesSameStream,\n    int8 retriesNewStream)\n{\n    if (!alive) return;\n\n    \/\/ FIXME we're not pushing data directly here because it doesn't seem like\n    \/\/ you can actually find out how much data was successfully pushed in. what\n    \/\/ if we have a very large message?\n    streamPtr->createChildStream(\n        std::tr1::bind(&EmersonMessagingManager::writeMessageSubstream,\n            this, alive, _1, _2, msg, sender, receiver,\n            retriesSameStream,retriesNewStream),\n        NULL, 0,\n        EMERSON_RELIABLE_COMMUNICATION_PORT, EMERSON_RELIABLE_COMMUNICATION_PORT\n    );\n}\n\nvoid EmersonMessagingManager::writeMessageSubstream(\n    Liveness::Token alive, int err, SSTStreamPtr subStreamPtr,\n    const String& msg, const SpaceObjectReference& sender,\n    const SpaceObjectReference& receiver, int8 retriesSameStream,\n    int8 retriesNewStream)\n{\n    if (!alive) return;\n\n    if (err != SST_IMPL_SUCCESS)\n    {\n        \/\/ Try the whole process over, starting from scratch in case the stream\n        \/\/ changed\n        if (retriesSameStream > 0)\n        {\n            sendScriptCommMessageReliable(\n                sender, receiver, msg, --retriesSameStream,retriesNewStream,true);\n        }\n        return;\n    }\n\n    writeData(livenessToken(), subStreamPtr, Network::Frame::write(msg), sender, receiver);\n}\n\nvoid EmersonMessagingManager::writeData(Liveness::Token alive, SSTStreamPtr streamPtr, const String& msg, const SpaceObjectReference& sender, const SpaceObjectReference& receiver) {\n    if (!alive) return;\n\n    int bytesWritten = streamPtr->write((uint8*) msg.data(), msg.size());\n    \/\/errored out: log message and abort.\n    if (bytesWritten == -1)\n    {\n        JSLOG(error,\"Error sending script communication message in scriptCommStreamCallback.  Not sending message.\");\n        return;\n    }\n\n    \/\/check if full message was written.\n    if(bytesWritten < (int)msg.size())\n    {\n        \/\/retry write infinitely\n        String restToWrite = msg.substr(bytesWritten);\n        mMainContext->mainStrand->post(\n            Duration::milliseconds((int64)20),\n            std::tr1::bind(&EmersonMessagingManager::writeData, this, livenessToken(), streamPtr, restToWrite, sender, receiver),\n            \"EmersonMessagingManager::writeData\"\n        );\n        JSLOG(detailed,\"More sript data to write to stream.  Queueing future write operation.\");\n    }\n    else\n        streamPtr->close(false);\n}\n\n\n} \/\/end namespace js\n} \/\/end namespace sirikata\n<commit_msg>createChildStream call can fail if the connection had already been closed.  This change handles case where creation fails.  Essentially, we force new stream creation through the retry mechanism already in place.<commit_after>\/\/ Copyright (c) 2011 Sirikata 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 \"EmersonMessagingManager.hpp\"\n#include \"JSLogging.hpp\"\n#include <sirikata\/core\/network\/Frame.hpp>\n#include \"Protocol_Frame.pbj.hpp\"\n\nnamespace Sirikata{\nnamespace JS{\n\n#define EMERSON_RELIABLE_COMMUNICATION_PORT 5\n\nEmersonMessagingManager::EmersonMessagingManager(ObjectHostContext* ctx)\n : mMainContext(ctx)\n{\n}\n\nEmersonMessagingManager::~EmersonMessagingManager()\n{\n    \/\/ Close all streams, clear out listeners\n    for(PresenceStreamMap::iterator pres_it = mStreams.begin(); pres_it != mStreams.end(); pres_it++) {\n        \/\/ Stop listening for new streams\n        const SpaceObjectReference& pres_id = pres_it->first;\n        mMainContext->sstConnMgr()->unlisten(\n            SST::EndPoint<SpaceObjectReference>(pres_id,EMERSON_RELIABLE_COMMUNICATION_PORT)\n        );\n\n        \/\/ Stop listening for substreams on the streams we have, close them\n        StreamMap& pres_streams = pres_it->second;\n        for(StreamMap::iterator it = pres_streams.begin(); it != pres_streams.end(); it++) {\n            SSTStreamPtr stream = it->second;\n            stream->unlistenSubstream(EMERSON_RELIABLE_COMMUNICATION_PORT);\n            stream->close(false);\n        }\n    }\n\n    mStreams.clear();\n}\n\nvoid EmersonMessagingManager::presenceConnected(const SpaceObjectReference& connPresSporef)\n{\n    allPres[connPresSporef] = true;\n\n    \/\/create a listener for scripting messages to presence with sporef connPresSporef.\n    mMainContext->sstConnMgr()->listen(\n        std::tr1::bind(&EmersonMessagingManager::createScriptCommListenerStreamCB,this,\n            livenessToken(), connPresSporef,_1,_2\n        ),\n        SST::EndPoint<SpaceObjectReference>(connPresSporef,EMERSON_RELIABLE_COMMUNICATION_PORT)\n    );\n}\n\nvoid EmersonMessagingManager::presenceDisconnected(const SpaceObjectReference& disconnPresSporef)\n{\n    std::map<SpaceObjectReference,bool>::iterator allPresFinder = allPres.find(disconnPresSporef);\n    if (allPresFinder == allPres.end())\n    {\n        JSLOG(error,\"Error in messaging manager: requested a disconnect for a presence that was not already connected.\");\n        return;\n    }\n    allPres.erase(allPresFinder);\n    clearStreams(disconnPresSporef);\n}\n\n\n\nvoid EmersonMessagingManager::setupNewStream(\n    SSTStreamPtr sstStream,bool closePrevious)\n{\n    \/\/ Regardless of whether we want to hold on to this or not, make sure we set\n    \/\/ it up in case it gets used\n\n    \/\/ Listen for substreams, which is where we'll actually receive data. This\n    \/\/ top level stream goes unused.\n    sstStream->listenSubstream(\n        EMERSON_RELIABLE_COMMUNICATION_PORT,\n        std::tr1::bind(\n            &EmersonMessagingManager::handleIncomingSubstream, this,\n            livenessToken(), _1, _2\n        )\n    );\n\n    \/\/ Then figure out whether to save it for ourselves\n    SpaceObjectReference pres = sstStream->localEndPoint().endPoint;\n    SpaceObjectReference sender = sstStream->remoteEndPoint().endPoint;\n\n    \/\/ Simple rule for resolving which stream to save.\n    bool save_mine = pres < sender;\n\n\n    \/\/doing this for the case where a previous stream wasn't responding to\n    \/\/messages, and we want to close it and replace it.  (should really only\n    \/\/happen in call scriptCommWriteStreamConnectedCB, which only gets called if\n    \/\/previous stream didn't exist or if it did exist, but couldn't get messages\n    \/\/to other end after numerous retries.)\n    if (closePrevious)\n    {\n        if (mStreams.find(pres) != mStreams.end())\n        {\n            JSLOG(detailed,\"Deleting existing stream map to make way for new one\");\n            StreamMap& smap = mStreams[pres];\n            StreamMap::iterator particularStreamIt  = smap.find(sender);\n            if (particularStreamIt != smap.end())\n            {\n                particularStreamIt->second->close(false);\n                smap.erase(particularStreamIt);\n            }\n        }\n    }\n\n\n    StreamMap& pres_streams = mStreams[pres];\n    StreamMap::iterator it = pres_streams.find(sender);\n    if (it == pres_streams.end() || !it->second->connected() || save_mine) {\n        pres_streams[sender] = sstStream;\n    }\n}\n\n\nSSTStreamPtr EmersonMessagingManager::getStream(const SpaceObjectReference& pres, const SpaceObjectReference& remote) {\n    PresenceStreamMap::iterator pres_it = mStreams.find(pres);\n    if (pres_it == mStreams.end()) return SSTStreamPtr();\n    StreamMap& pres_streams = pres_it->second;\n\n    StreamMap::iterator it = pres_streams.find(remote);\n    if (it != pres_streams.end()) {\n        return it->second;\n    }\n    return SSTStreamPtr();\n}\n\nvoid EmersonMessagingManager::clearStreams(const SpaceObjectReference& pres) {\n    PresenceStreamMap::iterator pres_it = mStreams.find(pres);\n    if (pres_it != mStreams.end())\n        mStreams.erase(pres_it);\n}\n\n\/\/Gets executed whenever a new stream connects to presence with sporef toListenFrom.\nvoid EmersonMessagingManager::createScriptCommListenerStreamCB(Liveness::Token alive, const SpaceObjectReference& toListenFrom, int err, SSTStreamPtr sstStream)\n{\n    if (!alive) return;\n\n    if (err != SST_IMPL_SUCCESS)\n    {\n        JSLOG(error,\"Error in createScriptCommListenerStreamCB.  Stream could not be created.\");\n        return;\n    }\n    setupNewStream(sstStream);\n}\n\nvoid EmersonMessagingManager::handleIncomingSubstream(Liveness::Token alive, int err, SSTStreamPtr streamPtr) {\n    if (!alive) return;\n\n    if (err != SST_IMPL_SUCCESS) return;\n\n    String* msgBuf = new String();\n    streamPtr->registerReadCallback(\n        std::tr1::bind(&EmersonMessagingManager::handleScriptCommStreamRead, this,\n            livenessToken(), streamPtr, msgBuf, _1, _2)\n    );\n}\n\n\n\/\/Gets executed whenever have additional data to read.\nvoid EmersonMessagingManager::handleScriptCommStreamRead(Liveness::Token alive, SSTStreamPtr sstptr, String* prevdata, uint8* buffer, int length)\n{\n    if (!alive) {\n        delete prevdata;\n        sstptr->registerReadCallback(0);\n        sstptr->close(false);\n        return;\n    }\n\n    prevdata->append((const char*)buffer, length);\n\n    \/\/ We should only ever get one message per substream, so there's no need to\n    \/\/ loop and we can clean up as soon as we parse a message successfully.\n    std::string msg = Network::Frame::parse(*prevdata);\n\n    \/\/ If we don't have a full message, just wait for more\n    if (msg.empty())\n        return;\n\n    \/\/otherwise, try to handle it.\n    handleScriptCommRead(sstptr->remoteEndPoint().endPoint, sstptr->localEndPoint().endPoint, msg);\n\n\n    delete prevdata;\n    sstptr->registerReadCallback(0);\n    sstptr->close(false);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/writing functions.\n\nbool EmersonMessagingManager::sendScriptCommMessageReliable(const SpaceObjectReference& sender, const SpaceObjectReference& receiver, const String& msg) {\n    \/\/ arbitrary default # of retries\n    return sendScriptCommMessageReliable(sender, receiver, msg, 10,5);\n}\n\nvoid EmersonMessagingManager::removeStream(\n    const SpaceObjectReference& sender, const SpaceObjectReference& receiver)\n{\n    if (mStreams.find(sender) != mStreams.end())\n    {\n        StreamMap& smap = mStreams[sender];\n        for(StreamMap::iterator it = smap.begin(); it != smap.end(); it++)\n            it->second->close(false);\n        mStreams.erase(sender);\n    }\n}\n\nbool EmersonMessagingManager::sendScriptCommMessageReliable(const SpaceObjectReference& sender, const SpaceObjectReference& receiver, const String& msg, int8 retriesSameStream,int8 retriesNewStream,bool isRetry)\n{\n    bool returner = false;\n\n    \/\/if we have tried to create a bunch of new streams, and that has still\n    \/\/failed, then remove the existing stream (if it's there), and drop message.\n    if (retriesNewStream == 0)\n    {\n        JSLOG(error, \"Cannot send message from sender \"<< sender<<\\\n              \" to \"<<receiver<<\".  Aborting.\");\n        removeStream(sender,receiver);\n        return false;\n    }\n\n\n    if (retriesSameStream > 0)\n    {\n        \/\/ If we have a stream\n        SSTStreamPtr streamPtr = getStream(sender, receiver);\n        if (streamPtr)\n        {\n            writeMessage(\n                livenessToken(), streamPtr, msg, sender,\n                receiver, retriesSameStream,--retriesNewStream);\n            return true;\n        }\n    }\n\n\n    \/\/what to do when the connection is created.\n    CommWriteStreamConnectedCBRetryData retryData;\n    retryData.retriesSameStream = retriesSameStream;\n    retryData.retriesNewStream = --retriesNewStream;\n    retryData.isRetry = isRetry;\n\n    \/\/ Otherwise, start the process of connecting\n    \/\/ connection will overwrite existing streams if they are there.\n    returner = mMainContext->sstConnMgr()->connectStream(\n        SST::EndPoint<SpaceObjectReference>(sender,0), \/\/local port is random\n\n        \/\/send to receiver's script comm port\n        SST::EndPoint<SpaceObjectReference>(receiver,EMERSON_RELIABLE_COMMUNICATION_PORT),\n\n        std::tr1::bind(\n            &EmersonMessagingManager::scriptCommWriteStreamConnectedCB, this,\n            livenessToken(),\n            msg, sender,receiver, _1, _2, retryData\n        )\n    );\n\n    return returner;\n}\n\n\nvoid EmersonMessagingManager::scriptCommWriteStreamConnectedCB(\n    Liveness::Token alive, const String& msg,\n    const SpaceObjectReference& sender,\n    const SpaceObjectReference& receiver, int err, SSTStreamPtr streamPtr,\n    CommWriteStreamConnectedCBRetryData retryData)\n{\n    if (!alive) return;\n\n    int8 retriesSameStream = retryData.retriesSameStream;\n    int8 retriesNewStream = retryData.retriesNewStream;\n    bool isRetry = retryData.isRetry;\n\n    \/\/if connection failure, just try to re-connect.\n    if (err != SST_IMPL_SUCCESS)\n    {\n        if (retriesSameStream > 0)\n        {\n            sendScriptCommMessageReliable(\n                sender, receiver, msg, --retriesSameStream,\n                retriesNewStream,true);\n        }\n        return;\n    }\n    \/\/will overwrite any existing streams if they existed before.\n    setupNewStream(streamPtr,isRetry);\n\n    writeMessage(\n        livenessToken(), streamPtr, msg, sender,\n        receiver, retriesSameStream,retriesNewStream);\n}\n\nvoid EmersonMessagingManager::writeMessage(\n    Liveness::Token alive, SSTStreamPtr streamPtr,\n    const String& msg, const SpaceObjectReference& sender,\n    const SpaceObjectReference& receiver, int8 retriesSameStream,\n    int8 retriesNewStream)\n{\n    if (!alive) return;\n\n    \/\/ FIXME we're not pushing data directly here because it doesn't seem like\n    \/\/ you can actually find out how much data was successfully pushed in. what\n    \/\/ if we have a very large message?\n    int retCode = streamPtr->createChildStream(\n        std::tr1::bind(&EmersonMessagingManager::writeMessageSubstream,\n            this, alive, _1, _2, msg, sender, receiver,\n            retriesSameStream,retriesNewStream),\n        NULL, 0,\n        EMERSON_RELIABLE_COMMUNICATION_PORT, EMERSON_RELIABLE_COMMUNICATION_PORT\n    );\n\n    \n    if (retCode == -1)\n    {\n        \/\/createChildStream failed.  close streamPtr and create a new stream to\n        \/\/try to send the message.  (Setting the retriesSameStream to zero and\n        \/\/isRetry to true should cause this to happen.)\n        sendScriptCommMessageReliable(\n            sender, receiver, msg, 0,--retriesNewStream,true);\n    }\n    \n}\n\nvoid EmersonMessagingManager::writeMessageSubstream(\n    Liveness::Token alive, int err, SSTStreamPtr subStreamPtr,\n    const String& msg, const SpaceObjectReference& sender,\n    const SpaceObjectReference& receiver, int8 retriesSameStream,\n    int8 retriesNewStream)\n{\n    if (!alive) return;\n\n    if (err != SST_IMPL_SUCCESS)\n    {\n        \/\/ Try the whole process over, starting from scratch in case the stream\n        \/\/ changed\n        if (retriesSameStream > 0)\n        {\n            sendScriptCommMessageReliable(\n                sender, receiver, msg, --retriesSameStream,retriesNewStream,true);\n        }\n        return;\n    }\n\n    writeData(livenessToken(), subStreamPtr, Network::Frame::write(msg), sender, receiver);\n}\n\nvoid EmersonMessagingManager::writeData(Liveness::Token alive, SSTStreamPtr streamPtr, const String& msg, const SpaceObjectReference& sender, const SpaceObjectReference& receiver) {\n    if (!alive) return;\n\n    int bytesWritten = streamPtr->write((uint8*) msg.data(), msg.size());\n    \/\/errored out: log message and abort.\n    if (bytesWritten == -1)\n    {\n        JSLOG(error,\"Error sending script communication message in scriptCommStreamCallback.  Not sending message.\");\n        return;\n    }\n\n    \/\/check if full message was written.\n    if(bytesWritten < (int)msg.size())\n    {\n        \/\/retry write infinitely\n        String restToWrite = msg.substr(bytesWritten);\n        mMainContext->mainStrand->post(\n            Duration::milliseconds((int64)20),\n            std::tr1::bind(&EmersonMessagingManager::writeData, this, livenessToken(), streamPtr, restToWrite, sender, receiver),\n            \"EmersonMessagingManager::writeData\"\n        );\n        JSLOG(detailed,\"More sript data to write to stream.  Queueing future write operation.\");\n    }\n    else\n        streamPtr->close(false);\n}\n\n\n} \/\/end namespace js\n} \/\/end namespace sirikata\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * SegmentTemplate.cpp: Implement the UrlTemplate element.\n *****************************************************************************\n * Copyright (C) 1998-2007 VLC authors and VideoLAN\n * $Id$\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#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"SegmentTemplate.h\"\n#include \"SegmentTimeline.h\"\n#include \"SegmentInformation.hpp\"\n#include \"AbstractPlaylist.hpp\"\n\nusing namespace adaptive::playlist;\n\nBaseSegmentTemplate::BaseSegmentTemplate( ICanonicalUrl *parent ) :\n    Segment( parent )\n{\n}\n\n\nMediaSegmentTemplate::MediaSegmentTemplate( SegmentInformation *parent ) :\n    BaseSegmentTemplate( parent ), Timelineable(), TimescaleAble( parent )\n{\n    debugName = \"SegmentTemplate\";\n    classId = Segment::CLASSID_SEGMENT;\n    startNumber.Set( 1 );\n    initialisationSegment.Set( NULL );\n    templated = true;\n    parentSegmentInformation = parent;\n}\n\nvoid MediaSegmentTemplate::mergeWith(MediaSegmentTemplate *updated, mtime_t prunebarrier)\n{\n    SegmentTimeline *timeline = segmentTimeline.Get();\n    if(timeline && updated->segmentTimeline.Get())\n    {\n        timeline->mergeWith(*updated->segmentTimeline.Get());\n        if(prunebarrier)\n        {\n            const Timescale timescale = timeline->inheritTimescale();\n            const uint64_t number =\n                    timeline->getElementNumberByScaledPlaybackTime(timescale.ToScaled(prunebarrier));\n            timeline->pruneBySequenceNumber(number);\n        }\n    }\n}\n\nvoid MediaSegmentTemplate::pruneByPlaybackTime(mtime_t time)\n{\n    if(segmentTimeline.Get())\n        return segmentTimeline.Get()->pruneByPlaybackTime(time);\n}\n\nsize_t MediaSegmentTemplate::pruneBySequenceNumber(uint64_t number)\n{\n    if(segmentTimeline.Get())\n        return segmentTimeline.Get()->pruneBySequenceNumber(number);\n    return 0;\n}\n\nuint64_t MediaSegmentTemplate::getCurrentLiveTemplateNumber() const\n{\n    uint64_t number = startNumber.Get();\n    \/* live streams \/ templated *\/\n    const stime_t dur = duration.Get();\n    if(dur)\n    {\n        \/* compute, based on current time *\/\n        const time_t playbacktime = time(NULL);\n        const Timescale timescale = inheritTimescale();\n        time_t streamstart = parentSegmentInformation->getPlaylist()->availabilityStartTime.Get();\n        streamstart += parentSegmentInformation->getPeriodStart();\n        stime_t elapsed = timescale.ToScaled(CLOCK_FREQ * (playbacktime - streamstart));\n        number += elapsed \/ dur - 2;\n    }\n\n    return number;\n}\n\nstime_t MediaSegmentTemplate::getMinAheadScaledTime(uint64_t number) const\n{\n    if( segmentTimeline.Get() )\n        return segmentTimeline.Get()->getMinAheadScaledTime(number);\n\n    return duration.Get(); \/* FIXME: use stream end time *\/\n}\n\nuint64_t MediaSegmentTemplate::getSequenceNumber() const\n{\n    return startNumber.Get();\n}\n\nvoid MediaSegmentTemplate::setSourceUrl(const std::string &url)\n{\n    sourceUrl = Url(Url::Component(url, this));\n}\n\nvoid MediaSegmentTemplate::debug(vlc_object_t *obj, int indent) const\n{\n    Segment::debug(obj, indent);\n    if(segmentTimeline.Get())\n        segmentTimeline.Get()->debug(obj, indent + 1);\n}\n\nInitSegmentTemplate::InitSegmentTemplate( ICanonicalUrl *parent ) :\n    BaseSegmentTemplate(parent)\n{\n    debugName = \"InitSegmentTemplate\";\n    classId = InitSegment::CLASSID_INITSEGMENT;\n}\n<commit_msg>demux: adaptive: fix computing ahead time for live templates<commit_after>\/*****************************************************************************\n * SegmentTemplate.cpp: Implement the UrlTemplate element.\n *****************************************************************************\n * Copyright (C) 1998-2007 VLC authors and VideoLAN\n * $Id$\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#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"SegmentTemplate.h\"\n#include \"SegmentTimeline.h\"\n#include \"SegmentInformation.hpp\"\n#include \"AbstractPlaylist.hpp\"\n\nusing namespace adaptive::playlist;\n\nBaseSegmentTemplate::BaseSegmentTemplate( ICanonicalUrl *parent ) :\n    Segment( parent )\n{\n}\n\n\nMediaSegmentTemplate::MediaSegmentTemplate( SegmentInformation *parent ) :\n    BaseSegmentTemplate( parent ), Timelineable(), TimescaleAble( parent )\n{\n    debugName = \"SegmentTemplate\";\n    classId = Segment::CLASSID_SEGMENT;\n    startNumber.Set( 1 );\n    initialisationSegment.Set( NULL );\n    templated = true;\n    parentSegmentInformation = parent;\n}\n\nvoid MediaSegmentTemplate::mergeWith(MediaSegmentTemplate *updated, mtime_t prunebarrier)\n{\n    SegmentTimeline *timeline = segmentTimeline.Get();\n    if(timeline && updated->segmentTimeline.Get())\n    {\n        timeline->mergeWith(*updated->segmentTimeline.Get());\n        if(prunebarrier)\n        {\n            const Timescale timescale = timeline->inheritTimescale();\n            const uint64_t number =\n                    timeline->getElementNumberByScaledPlaybackTime(timescale.ToScaled(prunebarrier));\n            timeline->pruneBySequenceNumber(number);\n        }\n    }\n}\n\nvoid MediaSegmentTemplate::pruneByPlaybackTime(mtime_t time)\n{\n    if(segmentTimeline.Get())\n        return segmentTimeline.Get()->pruneByPlaybackTime(time);\n}\n\nsize_t MediaSegmentTemplate::pruneBySequenceNumber(uint64_t number)\n{\n    if(segmentTimeline.Get())\n        return segmentTimeline.Get()->pruneBySequenceNumber(number);\n    return 0;\n}\n\nuint64_t MediaSegmentTemplate::getCurrentLiveTemplateNumber() const\n{\n    uint64_t number = startNumber.Get();\n    \/* live streams \/ templated *\/\n    const stime_t dur = duration.Get();\n    if(dur)\n    {\n        \/* compute, based on current time *\/\n        const time_t playbacktime = time(NULL);\n        const Timescale timescale = inheritTimescale();\n        time_t streamstart = parentSegmentInformation->getPlaylist()->availabilityStartTime.Get();\n        streamstart += parentSegmentInformation->getPeriodStart();\n        stime_t elapsed = timescale.ToScaled(CLOCK_FREQ * (playbacktime - streamstart));\n        number += elapsed \/ dur - 2;\n    }\n\n    return number;\n}\n\nstime_t MediaSegmentTemplate::getMinAheadScaledTime(uint64_t number) const\n{\n    if( segmentTimeline.Get() )\n        return segmentTimeline.Get()->getMinAheadScaledTime(number);\n\n    uint64_t current = getCurrentLiveTemplateNumber();\n    return (current - number) * duration.Get();\n}\n\nuint64_t MediaSegmentTemplate::getSequenceNumber() const\n{\n    return startNumber.Get();\n}\n\nvoid MediaSegmentTemplate::setSourceUrl(const std::string &url)\n{\n    sourceUrl = Url(Url::Component(url, this));\n}\n\nvoid MediaSegmentTemplate::debug(vlc_object_t *obj, int indent) const\n{\n    Segment::debug(obj, indent);\n    if(segmentTimeline.Get())\n        segmentTimeline.Get()->debug(obj, indent + 1);\n}\n\nInitSegmentTemplate::InitSegmentTemplate( ICanonicalUrl *parent ) :\n    BaseSegmentTemplate(parent)\n{\n    debugName = \"InitSegmentTemplate\";\n    classId = InitSegment::CLASSID_INITSEGMENT;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 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 <limits>\n\/\/ ospray\n#include \"mpi\/volume\/DataDistributedBlockedVolume.h\"\n#include \"volume\/GhostBlockBrickedVolume.h\"\n#include \"transferFunction\/TransferFunction.h\"\n#include \"volume\/GhostBlockBrickedVolume.h\"\n#include \"mpi\/common\/Core.h\"\n#if EXP_DATA_PARALLEL\n#include \"mpi\/common\/MPICommon.h\"\n#endif\n\/\/ ispc exports:\n#include \"DataDistributedBlockedVolume_ispc.h\"\n\nnamespace ospray {\n\n#if EXP_DATA_PARALLEL\n\n  \/\/! Allocate storage and populate the volume, called through the OSPRay API.\n  void DataDistributedBlockedVolume::commit()\n  {\n    \/\/ IW: do NOT call parent commit here - this would try to build\n    \/\/ the parent acceleration strucutre, which doesn't make sense on\n    \/\/ blocks that do not exist!!!!\n\n    updateEditableParameters();\/\/\n    \n    StructuredVolume::commit();\n\n    for (uint32_t i=0;i<numDDBlocks;i++) {\n      DDBlock *block = ddBlock+i;\n      if (!block->isMine) {\n        continue;\n      }\n      block->cppVolume->commit();\n    }\n  }\n\n  DataDistributedBlockedVolume::DataDistributedBlockedVolume() :\n    numDDBlocks(0),\n    ddBlock(NULL)\n  {\n    PING;\n  }\n\n  void DataDistributedBlockedVolume::updateEditableParameters()\n  {\n    StructuredVolume::updateEditableParameters();\n    for (uint32_t i = 0; i < numDDBlocks; i++) {\n      DDBlock *block = ddBlock+i;\n\n      if (!block->isMine) {\n        continue;\n      }\n\n      Ref<TransferFunction> transferFunction\n        = (TransferFunction *)getParamObject(\"transferFunction\", NULL);\n\n      auto &cppVolume = block->cppVolume;\n      cppVolume->findParam(\"transferFunction\",1)->set(transferFunction.ptr);\n\n      cppVolume->findParam(\"samplingRate\",1)->set(getParam1f(\"samplingRate\",\n                                                             1.f));\n      cppVolume->findParam(\"gradientShadingEnabled\",\n                           1)->set(getParam1i(\"gradientShadingEnabled\", 0));\n\n      cppVolume.ptr->updateEditableParameters();\n    }\n  }\n\n  bool DataDistributedBlockedVolume::isDataDistributed() const\n  {\n    return true;\n  }\n\n  void DataDistributedBlockedVolume::buildAccelerator()\n  {\n    std::cout << \"intentionally SKIP building an accelerator for data parallel \"\n              << \"volume (this'll be done on the brick level)\" << std::endl;\n  }\n\n  std::string DataDistributedBlockedVolume::toString() const\n  {\n    return(\"ospray::DataDistributedBlockedVolume<\" + voxelType + \">\");\n  }\n  \n  \/\/! Copy voxels into the volume at the given index (non-zero return value\n  \/\/! indicates success).\n  int DataDistributedBlockedVolume::setRegion(\n      \/* points to the first voxel to be copies. The\n         voxels at 'soruce' MUST have dimensions\n         'regionSize', must be organized in 3D-array\n         order, and must have the same voxel type as the\n         volume.*\/\n      const void *source,\n      \/*! coordinates of the lower,\n        left, front corner of the target\n        region.*\/\n      const vec3i &regionCoords,\n      \/*! size of the region that we're writing to; MUST\n        be the same as the dimensions of source[][][] *\/\n      const vec3i &regionSize)\n  {\n    \/\/ Create the equivalent ISPC volume container and allocate memory for voxel\n    \/\/ data.\n    if (ispcEquivalent == NULL) createEquivalentISPC();\n\n    \/\/ The block domains are in terms of the scaled regions so we must check\n    \/\/ if the data is for the block in the scaled volume\n    vec3i finalRegionCoords(vec3f(regionCoords) * scaleFactor);\n    vec3i finalRegionSize(vec3f(regionSize) * scaleFactor);\n    if (scaleFactor != vec3f(-1.f)) {\n      finalRegionCoords = vec3i(vec3f(regionCoords) * scaleFactor);\n      finalRegionSize = vec3i(vec3f(regionSize) * scaleFactor);\n    } else {\n      finalRegionCoords = regionCoords;\n      finalRegionSize = regionSize;\n    }\n\n    for (uint32_t i = 0; i < numDDBlocks; i++) {\n      \/\/ that block isn't mine, I shouldn't care ...\n      if (!ddBlock[i].isMine) continue;\n      \n      \/\/ first, do some culling to make sure we only do setrgion\n      \/\/ calls on blocks that actually map to this block\n      if (ddBlock[i].domain.lower.x >= finalRegionCoords.x+finalRegionSize.x) continue;\n      if (ddBlock[i].domain.lower.y >= finalRegionCoords.y+finalRegionSize.y) continue;\n      if (ddBlock[i].domain.lower.z >= finalRegionCoords.z+finalRegionSize.z) continue;\n      \n      if (ddBlock[i].domain.upper.x+finalRegionSize.x < finalRegionCoords.x) continue;\n      if (ddBlock[i].domain.upper.y+finalRegionSize.y < finalRegionCoords.y) continue;\n      if (ddBlock[i].domain.upper.z+finalRegionSize.z < finalRegionCoords.z) continue;\n\n      vec3i setRegionCoords = finalRegionCoords - ddBlock[i].domain.lower;\n      if (scaleFactor != vec3f(-1.f)) {\n        setRegionCoords = vec3i(vec3f(setRegionCoords) \/ scaleFactor);\n      }\n      \n      ddBlock[i].cppVolume->setRegion(source, setRegionCoords, regionSize);\n\n      ddBlock[i].ispcVolume = ddBlock[i].cppVolume->getIE();\n\n#ifndef OSPRAY_VOLUME_VOXELRANGE_IN_APP\n      ManagedObject::Param *param = ddBlock[i].cppVolume->findParam(\"voxelRange\");\n      if (param != NULL && param->type == OSP_FLOAT2){\n        vec2f blockRange = param->u_vec2f;\n        voxelRange.x = std::min(voxelRange.x, blockRange.x);\n        voxelRange.y = std::max(voxelRange.y, blockRange.y);\n      }\n#endif\n    }\n\n#ifndef OSPRAY_VOLUME_VOXELRANGE_IN_APP\n    \/\/ Do a reduction here to worker 0 since it will be queried for the voxel range by the display node\n    vec2f globalVoxelRange = voxelRange;\n    MPI_CALL(Reduce(&voxelRange.x, &globalVoxelRange.x, 1, MPI_FLOAT, MPI_MIN, 0, mpi::worker.comm));\n    MPI_CALL(Reduce(&voxelRange.y, &globalVoxelRange.y, 1, MPI_FLOAT, MPI_MAX, 0, mpi::worker.comm));\n    set(\"voxelRange\", globalVoxelRange);\n#endif\n    return true;\n  }\n\n  void DataDistributedBlockedVolume::createEquivalentISPC()\n  {\n    if (ispcEquivalent != NULL) return;\n\n    \/\/ Get the voxel type.\n    voxelType = getParamString(\"voxelType\", \"unspecified\");  \n    exitOnCondition(getVoxelType() == OSP_UNKNOWN, \n                    \"unrecognized voxel type (must be set before calling \"\n                    \"ospSetRegion())\");\n    \n    \/\/ Get the volume dimensions.\n    this->dimensions = getParam3i(\"dimensions\", vec3i(0));\n    exitOnCondition(reduce_min(this->dimensions) <= 0, \n                    \"invalid volume dimensions (must be set before calling \"\n                    \"ospSetRegion())\");\n\n    ddBlocks    = getParam3i(\"num_dp_blocks\",vec3i(4,4,4));\n    blockSize   = divRoundUp(dimensions,ddBlocks);\n    std::cout << \"#osp:dp: using data parallel volume of \" << ddBlocks\n              << \" blocks, blockSize is \" << blockSize << std::endl;\n    \n    \/\/ Set the grid origin, default to (0,0,0).\n    this->gridOrigin = getParam3f(\"gridOrigin\", vec3f(0.f));\n\n    \/\/ Get the volume dimensions.\n    this->dimensions = getParam3i(\"dimensions\", vec3i(0));\n    exitOnCondition(reduce_min(this->dimensions) <= 0, \n                    \"invalid volume dimensions\");\n\n    \/\/ Set the grid spacing, default to (1,1,1).\n    this->gridSpacing = getParam3f(\"gridSpacing\", vec3f(1.f));\n\n    this->scaleFactor = getParam3f(\"scaleFactor\", vec3f(-1.f));\n\n    numDDBlocks = ospcommon::reduce_mul(ddBlocks);\n    ddBlock     = new DDBlock[numDDBlocks];\n\n    printf(\"=======================================================\\n\");\n    printf(\"created %ix%ix%i data distributed volume blocks\\n\",\n           ddBlocks.x,ddBlocks.y,ddBlocks.z);\n    printf(\"=======================================================\\n\");\n\n    if (!ospray::core::isMpiParallel()) {\n      throw std::runtime_error(\"data parallel volume, but not in mpi parallel \"\n                               \"mode...\");\n    }\n    uint64_t numWorkers = ospray::core::getWorkerCount();\n    \/\/ PRINT(numDDBlocks);\n    \/\/ PRINT(numWorkers);\n\n    voxelType = getParamString(\"voxelType\", \"unspecified\");  \n\n    \/\/ if (numDDBlocks >= numWorkers) {\n    \/\/ we have more workers than blocks - use one owner per block,\n    \/\/ meaning we'll end up with multiple blocks per worker\n    int blockID = 0;\n    for (int iz=0;iz<ddBlocks.z;iz++)\n      for (int iy=0;iy<ddBlocks.y;iy++)\n        for (int ix=0;ix<ddBlocks.x;ix++, blockID++) {\n          DDBlock *block = &ddBlock[blockID];\n          if (numDDBlocks >= numWorkers) {\n            block->firstOwner = blockID % numWorkers;\n            block->numOwners = 1;\n          } else {\n            block->firstOwner = (blockID * numWorkers) \/ numDDBlocks;\n            int nextBlockFirstOwner = ((blockID+1)*numWorkers) \/ numDDBlocks;\n            block->numOwners = nextBlockFirstOwner - block->firstOwner; \/\/ + 1;\n          }\n          block->isMine \n            = (ospray::core::getWorkerRank() >= block->firstOwner)\n            && (ospray::core::getWorkerRank() <\n                (block->firstOwner + block->numOwners));\n          block->domain.lower = vec3i(ix,iy,iz) * blockSize;\n          block->domain.upper = min(block->domain.lower+blockSize,dimensions);\n          block->bounds.lower = gridOrigin +\n            (gridSpacing * vec3f(block->domain.lower));\n          block->bounds.upper = gridOrigin +\n            (gridSpacing * vec3f(block->domain.upper));\n          \n          \/\/ iw: add one voxel overlap, so we can properly interpolate\n          \/\/ even across block boundaries (we need the full *cell* on\n          \/\/ the right side, not just the last *voxel*!)\n          block->domain.upper = min(block->domain.upper+vec3i(1),dimensions);\n          \n          \n          if (block->isMine) {\n#ifdef EXP_NEW_BB_VOLUME_KERNELS\n            Ref<Volume> volume = new GhostBlockBrickedVolume;\n#else\n            Ref<Volume> volume = new BlockBrickedVolume;\n#endif\n            vec3i blockDims = block->domain.upper - block->domain.lower;\n            volume->findParam(\"dimensions\",1)->set(blockDims);\n            volume->findParam(\"gridOrigin\",1)->set(block->bounds.lower);\n            volume->findParam(\"gridSpacing\",1)->set(gridSpacing);\n            volume->findParam(\"voxelType\",1)->set(voxelType.c_str());\n            if (scaleFactor != vec3f(-1.f)) {\n              volume->findParam(\"scaleFactor\",1)->set(scaleFactor);\n            }\n            \n            printf(\"worker rank %li owns block %i,%i,%i (ID %i), dims %i %i %i\\n\",\n                   (size_t)core::getWorkerRank(),ix,iy,iz,\n                   blockID,blockDims.x,blockDims.y,blockDims.z);\n            block->cppVolume = volume;\n            block->ispcVolume = NULL; \/\/volume->getIE();\n          } else {\n            block->ispcVolume = NULL;\n            block->cppVolume = NULL;\n          }\n        }\n    \n    \/\/ Create an ISPC BlockBrickedVolume object and assign type-specific\n    \/\/ function pointers.\n    ispcEquivalent = ispc::DDBVolume_create(this,                                                             \n                                            (int)getVoxelType(), \n                                            (const ispc::vec3i&)dimensions,\n                                            (const ispc::vec3i&)ddBlocks,\n                                            (const ispc::vec3i&)blockSize,\n                                            ddBlock);\n    if (!ispcEquivalent) {\n      throw std::runtime_error(\"could not create create data distributed \"\n                               \"volume\");\n    }\n  }\n\n  \/\/ A volume type with internal data-distribution. needs a renderer\n  \/\/ that is capable of data-parallel rendering!\n  OSP_REGISTER_VOLUME(DataDistributedBlockedVolume, data_distributed_volume);\n\n#endif\n\n} \/\/ ::ospray\n<commit_msg>We no longer need the voxelrange setup stuff<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 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 <limits>\n\/\/ ospray\n#include \"mpi\/volume\/DataDistributedBlockedVolume.h\"\n#include \"volume\/GhostBlockBrickedVolume.h\"\n#include \"transferFunction\/TransferFunction.h\"\n#include \"volume\/GhostBlockBrickedVolume.h\"\n#include \"mpi\/common\/Core.h\"\n#if EXP_DATA_PARALLEL\n#include \"mpi\/common\/MPICommon.h\"\n#endif\n\/\/ ispc exports:\n#include \"DataDistributedBlockedVolume_ispc.h\"\n\nnamespace ospray {\n\n#if EXP_DATA_PARALLEL\n\n  \/\/! Allocate storage and populate the volume, called through the OSPRay API.\n  void DataDistributedBlockedVolume::commit()\n  {\n    \/\/ IW: do NOT call parent commit here - this would try to build\n    \/\/ the parent acceleration strucutre, which doesn't make sense on\n    \/\/ blocks that do not exist!!!!\n\n    updateEditableParameters();\/\/\n    \n    StructuredVolume::commit();\n\n    for (uint32_t i=0;i<numDDBlocks;i++) {\n      DDBlock *block = ddBlock+i;\n      if (!block->isMine) {\n        continue;\n      }\n      block->cppVolume->commit();\n    }\n  }\n\n  DataDistributedBlockedVolume::DataDistributedBlockedVolume() :\n    numDDBlocks(0),\n    ddBlock(NULL)\n  {\n    PING;\n  }\n\n  void DataDistributedBlockedVolume::updateEditableParameters()\n  {\n    StructuredVolume::updateEditableParameters();\n    for (uint32_t i = 0; i < numDDBlocks; i++) {\n      DDBlock *block = ddBlock+i;\n\n      if (!block->isMine) {\n        continue;\n      }\n\n      Ref<TransferFunction> transferFunction\n        = (TransferFunction *)getParamObject(\"transferFunction\", NULL);\n\n      auto &cppVolume = block->cppVolume;\n      cppVolume->findParam(\"transferFunction\",1)->set(transferFunction.ptr);\n\n      cppVolume->findParam(\"samplingRate\",1)->set(getParam1f(\"samplingRate\",\n                                                             1.f));\n      cppVolume->findParam(\"gradientShadingEnabled\",\n                           1)->set(getParam1i(\"gradientShadingEnabled\", 0));\n\n      cppVolume.ptr->updateEditableParameters();\n    }\n  }\n\n  bool DataDistributedBlockedVolume::isDataDistributed() const\n  {\n    return true;\n  }\n\n  void DataDistributedBlockedVolume::buildAccelerator()\n  {\n    std::cout << \"intentionally SKIP building an accelerator for data parallel \"\n              << \"volume (this'll be done on the brick level)\" << std::endl;\n  }\n\n  std::string DataDistributedBlockedVolume::toString() const\n  {\n    return(\"ospray::DataDistributedBlockedVolume<\" + voxelType + \">\");\n  }\n  \n  \/\/! Copy voxels into the volume at the given index (non-zero return value\n  \/\/! indicates success).\n  int DataDistributedBlockedVolume::setRegion(\n      \/* points to the first voxel to be copies. The\n         voxels at 'soruce' MUST have dimensions\n         'regionSize', must be organized in 3D-array\n         order, and must have the same voxel type as the\n         volume.*\/\n      const void *source,\n      \/*! coordinates of the lower,\n        left, front corner of the target\n        region.*\/\n      const vec3i &regionCoords,\n      \/*! size of the region that we're writing to; MUST\n        be the same as the dimensions of source[][][] *\/\n      const vec3i &regionSize)\n  {\n    \/\/ Create the equivalent ISPC volume container and allocate memory for voxel\n    \/\/ data.\n    if (ispcEquivalent == NULL) createEquivalentISPC();\n\n    \/\/ The block domains are in terms of the scaled regions so we must check\n    \/\/ if the data is for the block in the scaled volume\n    vec3i finalRegionCoords(vec3f(regionCoords) * scaleFactor);\n    vec3i finalRegionSize(vec3f(regionSize) * scaleFactor);\n    if (scaleFactor != vec3f(-1.f)) {\n      finalRegionCoords = vec3i(vec3f(regionCoords) * scaleFactor);\n      finalRegionSize = vec3i(vec3f(regionSize) * scaleFactor);\n    } else {\n      finalRegionCoords = regionCoords;\n      finalRegionSize = regionSize;\n    }\n\n    for (uint32_t i = 0; i < numDDBlocks; i++) {\n      \/\/ that block isn't mine, I shouldn't care ...\n      if (!ddBlock[i].isMine) continue;\n      \n      \/\/ first, do some culling to make sure we only do setrgion\n      \/\/ calls on blocks that actually map to this block\n      if (ddBlock[i].domain.lower.x >= finalRegionCoords.x+finalRegionSize.x) continue;\n      if (ddBlock[i].domain.lower.y >= finalRegionCoords.y+finalRegionSize.y) continue;\n      if (ddBlock[i].domain.lower.z >= finalRegionCoords.z+finalRegionSize.z) continue;\n      \n      if (ddBlock[i].domain.upper.x+finalRegionSize.x < finalRegionCoords.x) continue;\n      if (ddBlock[i].domain.upper.y+finalRegionSize.y < finalRegionCoords.y) continue;\n      if (ddBlock[i].domain.upper.z+finalRegionSize.z < finalRegionCoords.z) continue;\n\n      vec3i setRegionCoords = finalRegionCoords - ddBlock[i].domain.lower;\n      if (scaleFactor != vec3f(-1.f)) {\n        setRegionCoords = vec3i(vec3f(setRegionCoords) \/ scaleFactor);\n      }\n      \n      ddBlock[i].cppVolume->setRegion(source, setRegionCoords, regionSize);\n\n      ddBlock[i].ispcVolume = ddBlock[i].cppVolume->getIE();\n\n    }\n\n    return true;\n  }\n\n  void DataDistributedBlockedVolume::createEquivalentISPC()\n  {\n    if (ispcEquivalent != NULL) return;\n\n    \/\/ Get the voxel type.\n    voxelType = getParamString(\"voxelType\", \"unspecified\");  \n    exitOnCondition(getVoxelType() == OSP_UNKNOWN, \n                    \"unrecognized voxel type (must be set before calling \"\n                    \"ospSetRegion())\");\n    \n    \/\/ Get the volume dimensions.\n    this->dimensions = getParam3i(\"dimensions\", vec3i(0));\n    exitOnCondition(reduce_min(this->dimensions) <= 0, \n                    \"invalid volume dimensions (must be set before calling \"\n                    \"ospSetRegion())\");\n\n    ddBlocks    = getParam3i(\"num_dp_blocks\",vec3i(4,4,4));\n    blockSize   = divRoundUp(dimensions,ddBlocks);\n    std::cout << \"#osp:dp: using data parallel volume of \" << ddBlocks\n              << \" blocks, blockSize is \" << blockSize << std::endl;\n    \n    \/\/ Set the grid origin, default to (0,0,0).\n    this->gridOrigin = getParam3f(\"gridOrigin\", vec3f(0.f));\n\n    \/\/ Get the volume dimensions.\n    this->dimensions = getParam3i(\"dimensions\", vec3i(0));\n    exitOnCondition(reduce_min(this->dimensions) <= 0, \n                    \"invalid volume dimensions\");\n\n    \/\/ Set the grid spacing, default to (1,1,1).\n    this->gridSpacing = getParam3f(\"gridSpacing\", vec3f(1.f));\n\n    this->scaleFactor = getParam3f(\"scaleFactor\", vec3f(-1.f));\n\n    numDDBlocks = ospcommon::reduce_mul(ddBlocks);\n    ddBlock     = new DDBlock[numDDBlocks];\n\n    printf(\"=======================================================\\n\");\n    printf(\"created %ix%ix%i data distributed volume blocks\\n\",\n           ddBlocks.x,ddBlocks.y,ddBlocks.z);\n    printf(\"=======================================================\\n\");\n\n    if (!ospray::core::isMpiParallel()) {\n      throw std::runtime_error(\"data parallel volume, but not in mpi parallel \"\n                               \"mode...\");\n    }\n    uint64_t numWorkers = ospray::core::getWorkerCount();\n    \/\/ PRINT(numDDBlocks);\n    \/\/ PRINT(numWorkers);\n\n    voxelType = getParamString(\"voxelType\", \"unspecified\");  \n\n    \/\/ if (numDDBlocks >= numWorkers) {\n    \/\/ we have more workers than blocks - use one owner per block,\n    \/\/ meaning we'll end up with multiple blocks per worker\n    int blockID = 0;\n    for (int iz=0;iz<ddBlocks.z;iz++)\n      for (int iy=0;iy<ddBlocks.y;iy++)\n        for (int ix=0;ix<ddBlocks.x;ix++, blockID++) {\n          DDBlock *block = &ddBlock[blockID];\n          if (numDDBlocks >= numWorkers) {\n            block->firstOwner = blockID % numWorkers;\n            block->numOwners = 1;\n          } else {\n            block->firstOwner = (blockID * numWorkers) \/ numDDBlocks;\n            int nextBlockFirstOwner = ((blockID+1)*numWorkers) \/ numDDBlocks;\n            block->numOwners = nextBlockFirstOwner - block->firstOwner; \/\/ + 1;\n          }\n          block->isMine \n            = (ospray::core::getWorkerRank() >= block->firstOwner)\n            && (ospray::core::getWorkerRank() <\n                (block->firstOwner + block->numOwners));\n          block->domain.lower = vec3i(ix,iy,iz) * blockSize;\n          block->domain.upper = min(block->domain.lower+blockSize,dimensions);\n          block->bounds.lower = gridOrigin +\n            (gridSpacing * vec3f(block->domain.lower));\n          block->bounds.upper = gridOrigin +\n            (gridSpacing * vec3f(block->domain.upper));\n          \n          \/\/ iw: add one voxel overlap, so we can properly interpolate\n          \/\/ even across block boundaries (we need the full *cell* on\n          \/\/ the right side, not just the last *voxel*!)\n          block->domain.upper = min(block->domain.upper+vec3i(1),dimensions);\n          \n          \n          if (block->isMine) {\n#ifdef EXP_NEW_BB_VOLUME_KERNELS\n            Ref<Volume> volume = new GhostBlockBrickedVolume;\n#else\n            Ref<Volume> volume = new BlockBrickedVolume;\n#endif\n            vec3i blockDims = block->domain.upper - block->domain.lower;\n            volume->findParam(\"dimensions\",1)->set(blockDims);\n            volume->findParam(\"gridOrigin\",1)->set(block->bounds.lower);\n            volume->findParam(\"gridSpacing\",1)->set(gridSpacing);\n            volume->findParam(\"voxelType\",1)->set(voxelType.c_str());\n            if (scaleFactor != vec3f(-1.f)) {\n              volume->findParam(\"scaleFactor\",1)->set(scaleFactor);\n            }\n            \n            printf(\"worker rank %li owns block %i,%i,%i (ID %i), dims %i %i %i\\n\",\n                   (size_t)core::getWorkerRank(),ix,iy,iz,\n                   blockID,blockDims.x,blockDims.y,blockDims.z);\n            block->cppVolume = volume;\n            block->ispcVolume = NULL; \/\/volume->getIE();\n          } else {\n            block->ispcVolume = NULL;\n            block->cppVolume = NULL;\n          }\n        }\n    \n    \/\/ Create an ISPC BlockBrickedVolume object and assign type-specific\n    \/\/ function pointers.\n    ispcEquivalent = ispc::DDBVolume_create(this,                                                             \n                                            (int)getVoxelType(), \n                                            (const ispc::vec3i&)dimensions,\n                                            (const ispc::vec3i&)ddBlocks,\n                                            (const ispc::vec3i&)blockSize,\n                                            ddBlock);\n    if (!ispcEquivalent) {\n      throw std::runtime_error(\"could not create create data distributed \"\n                               \"volume\");\n    }\n  }\n\n  \/\/ A volume type with internal data-distribution. needs a renderer\n  \/\/ that is capable of data-parallel rendering!\n  OSP_REGISTER_VOLUME(DataDistributedBlockedVolume, data_distributed_volume);\n\n#endif\n\n} \/\/ ::ospray\n<|endoftext|>"}
{"text":"<commit_before>#include <string.h>\n#include <stdlib.h>\n#include <gtk\/gtk.h>\n#include <iostream>\n\n#include <bot_vis\/bot_vis.h>\n#include <lcm\/lcm.h>\n#include <bot_core\/bot_core.h>\n#include <path_util\/path_util.h>\n#include <ConciseArgs>\n\n\/\/renderers\n#include <bot_frames\/bot_frames_renderers.h>\n#include <laser_utils\/renderer_laser.h>\n#include <bot_lcmgl_render\/lcmgl_bot_renderer.h>\n#include <visualization\/collections_renderer.hpp>\n#include <octomap_utils\/renderer_octomap.h>\n#include <mav_state_est\/mav_state_est_renderers.h>\n#include <occ_map\/occ_map_renderers.h>\n\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n  string config_file = \"drc_robot_02_mit.cfg\";\n\n\n  gtk_init(&argc, &argv);\n  glutInit(&argc, argv);\n  g_thread_init(NULL);\n\n\/\/  if (argc < 2) {\n\/\/    fprintf(stderr, \"usage: %s <render_plugins>\\n\", g_path_get_basename(argv[0]));\n\/\/    exit(1);\n\/\/  }\n  lcm_t * lcm = bot_lcm_get_global(NULL);\n  bot_glib_mainloop_attach_lcm(lcm);\n  BotParam * bot_param;\n  if(config_file.size()) {\n    fprintf(stderr,\"Reading config from file\\n\");\n    std::string config_path = std::string(getConfigPath()) +'\/' + std::string(config_file);\n    bot_param = bot_param_new_from_file(config_path.c_str());\n    if (bot_param == NULL) {\n      std::cerr << \"Couldn't get bot param from file %s\\n\" << config_path << std::endl;\n      exit(-1);\n    }\n  }else {\n    bot_param = bot_param_new_from_server(lcm, 0);\n    if (bot_param == NULL) {\n      fprintf(stderr, \"Couldn't get bot param from server.\\n\");\n      return 1;\n    }\n  }\n\n  BotFrames* bot_frames = bot_frames_new(lcm, bot_param);\n\n  BotViewer* viewer = bot_viewer_new(\"Pronto Viewer\");\n  \/\/die cleanly for control-c etc :-)\n  bot_gtk_quit_on_interrupt();\n\n  \/\/ setup renderers\n  bot_viewer_add_stock_renderer(viewer, BOT_VIEWER_STOCK_RENDERER_GRID, 1);\n  collections_add_renderer_to_viewer(viewer, 1, lcm);\n  bot_lcmgl_add_renderer_to_viewer(viewer,lcm, 1);\n  laser_util_add_renderer_to_viewer(viewer, 1, lcm, bot_param, bot_frames);\n  bot_frames_add_renderer_to_viewer(viewer, 1, bot_frames );\n\n  add_octomap_renderer_to_viewer(viewer, 1, lcm);\n  add_map_measurement_renderer_to_viewer(viewer, 1, lcm, bot_param, bot_frames);\n  add_mav_state_est_renderer_to_viewer(viewer, 1, lcm, bot_param, bot_frames);\n\n\n  \/\/load the renderer params from the config file.\n  char *fname = g_build_filename(g_get_user_config_dir(), \".bot-plugin-viewerrc\", NULL);\n  bot_viewer_load_preferences(viewer, fname);\n\n  gtk_main();\n\n  \/\/save the renderer params to the config file.\n  bot_viewer_save_preferences(viewer, fname);\n\n  bot_viewer_unref(viewer);\n}\n<commit_msg>multiple pronto bot frames<commit_after>#include <string.h>\n#include <stdlib.h>\n#include <gtk\/gtk.h>\n#include <iostream>\n\n#include <bot_vis\/bot_vis.h>\n#include <lcm\/lcm.h>\n#include <bot_core\/bot_core.h>\n#include <path_util\/path_util.h>\n#include <ConciseArgs>\n\n\/\/renderers\n#include <bot_frames\/bot_frames_renderers.h>\n#include <laser_utils\/renderer_laser.h>\n#include <bot_lcmgl_render\/lcmgl_bot_renderer.h>\n#include <visualization\/collections_renderer.hpp>\n#include <octomap_utils\/renderer_octomap.h>\n#include <mav_state_est\/mav_state_est_renderers.h>\n#include <occ_map\/occ_map_renderers.h>\n\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n  string config_file = \"drc_robot_02_mit.cfg\";\n\n\n  gtk_init(&argc, &argv);\n  glutInit(&argc, argv);\n  g_thread_init(NULL);\n\n\/\/  if (argc < 2) {\n\/\/    fprintf(stderr, \"usage: %s <render_plugins>\\n\", g_path_get_basename(argv[0]));\n\/\/    exit(1);\n\/\/  }\n  lcm_t * lcm = bot_lcm_get_global(NULL);\n  bot_glib_mainloop_attach_lcm(lcm);\n  BotParam * bot_param;\n  if(config_file.size()) {\n    fprintf(stderr,\"Reading config from file\\n\");\n    std::string config_path = std::string(getConfigPath()) +'\/' + std::string(config_file);\n    bot_param = bot_param_new_from_file(config_path.c_str());\n    if (bot_param == NULL) {\n      std::cerr << \"Couldn't get bot param from file %s\\n\" << config_path << std::endl;\n      exit(-1);\n    }\n  }else {\n    bot_param = bot_param_new_from_server(lcm, 0);\n    if (bot_param == NULL) {\n      fprintf(stderr, \"Couldn't get bot param from server.\\n\");\n      return 1;\n    }\n  }\n\n  BotFrames* bot_frames = bot_frames_new(lcm, bot_param);\n\n  BotViewer* viewer = bot_viewer_new(\"Pronto Viewer\");\n  \/\/die cleanly for control-c etc :-)\n  bot_gtk_quit_on_interrupt();\n\n  \/\/ setup renderers\n  bot_viewer_add_stock_renderer(viewer, BOT_VIEWER_STOCK_RENDERER_GRID, 1);\n  collections_add_renderer_to_viewer(viewer, 1, lcm);\n  bot_lcmgl_add_renderer_to_viewer(viewer,lcm, 1);\n  laser_util_add_renderer_to_viewer(viewer, 1, lcm, bot_param, bot_frames);\n  bot_frames_add_renderer_to_viewer(viewer, 1, bot_frames );\n  bot_frames_add_renderer_to_viewer(viewer, 1, bot_frames );\n  bot_frames_add_renderer_to_viewer(viewer, 1, bot_frames );\n\n  add_octomap_renderer_to_viewer(viewer, 1, lcm);\n  add_map_measurement_renderer_to_viewer(viewer, 1, lcm, bot_param, bot_frames);\n  add_mav_state_est_renderer_to_viewer(viewer, 1, lcm, bot_param, bot_frames);\n\n\n  \/\/load the renderer params from the config file.\n  char *fname = g_build_filename(g_get_user_config_dir(), \".bot-plugin-viewerrc\", NULL);\n  bot_viewer_load_preferences(viewer, fname);\n\n  gtk_main();\n\n  \/\/save the renderer params to the config file.\n  bot_viewer_save_preferences(viewer, fname);\n\n  bot_viewer_unref(viewer);\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 CommonEth.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"CommonEth.h\"\n#include <random>\n#include <secp256k1\/secp256k1.h>\n#include <libdevcrypto\/SHA3.h>\n#include \"Exceptions.h\"\nusing namespace std;\nusing namespace dev;\nusing namespace dev::eth;\n\nnamespace dev\n{\nnamespace eth\n{\n\nconst unsigned c_protocolVersion = 47;\nconst unsigned c_databaseVersion = 5;\n\nstatic const vector<pair<u256, string>> g_units =\n{\n\t{((((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000, \"Uether\"},\n\t{((((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000, \"Vether\"},\n\t{((((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000, \"Dether\"},\n\t{(((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000, \"Nether\"},\n\t{(((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000, \"Yether\"},\n\t{(((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000, \"Zether\"},\n\t{((u256(1000000000) * 1000000000) * 1000000000) * 1000000000, \"Eether\"},\n\t{((u256(1000000000) * 1000000000) * 1000000000) * 1000000, \"Pether\"},\n\t{((u256(1000000000) * 1000000000) * 1000000000) * 1000, \"Tether\"},\n\t{(u256(1000000000) * 1000000000) * 1000000000, \"Gether\"},\n\t{(u256(1000000000) * 1000000000) * 1000000, \"Mether\"},\n\t{(u256(1000000000) * 1000000000) * 1000, \"Kether\"},\n\t{u256(1000000000) * 1000000000, \"ether\"},\n\t{u256(1000000000) * 1000000, \"finney\"},\n\t{u256(1000000000) * 1000, \"szabo\"},\n\t{u256(1000000000), \"Gwei\"},\n\t{u256(1000000), \"Mwei\"},\n\t{u256(1000), \"Kwei\"},\n\t{u256(1), \"wei\"}\n};\n\nvector<pair<u256, string>> const& units()\n{\n\treturn g_units;\n}\n\nstd::string formatBalance(u256 _b)\n{\n\tostringstream ret;\n\tif (_b > g_units[0].first * 10000)\n\t{\n\t\tret << (_b \/ g_units[0].first) << \" \" << g_units[0].second;\n\t\treturn ret.str();\n\t}\n\tret << setprecision(5);\n\tfor (auto const& i: g_units)\n\t\tif (i.first != 1 && _b >= i.first * 100)\n\t\t{\n\t\t\tret << (double(_b \/ (i.first \/ 1000)) \/ 1000.0) << \" \" << i.second;\n\t\t\treturn ret.str();\n\t\t}\n\tret << _b << \" wei\";\n\treturn ret.str();\n}\n\n}}\n<commit_msg>PV48.<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 CommonEth.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"CommonEth.h\"\n#include <random>\n#include <secp256k1\/secp256k1.h>\n#include <libdevcrypto\/SHA3.h>\n#include \"Exceptions.h\"\nusing namespace std;\nusing namespace dev;\nusing namespace dev::eth;\n\nnamespace dev\n{\nnamespace eth\n{\n\nconst unsigned c_protocolVersion = 48;\nconst unsigned c_databaseVersion = 5;\n\nstatic const vector<pair<u256, string>> g_units =\n{\n\t{((((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000, \"Uether\"},\n\t{((((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000, \"Vether\"},\n\t{((((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000, \"Dether\"},\n\t{(((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000000, \"Nether\"},\n\t{(((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000000, \"Yether\"},\n\t{(((u256(1000000000) * 1000000000) * 1000000000) * 1000000000) * 1000, \"Zether\"},\n\t{((u256(1000000000) * 1000000000) * 1000000000) * 1000000000, \"Eether\"},\n\t{((u256(1000000000) * 1000000000) * 1000000000) * 1000000, \"Pether\"},\n\t{((u256(1000000000) * 1000000000) * 1000000000) * 1000, \"Tether\"},\n\t{(u256(1000000000) * 1000000000) * 1000000000, \"Gether\"},\n\t{(u256(1000000000) * 1000000000) * 1000000, \"Mether\"},\n\t{(u256(1000000000) * 1000000000) * 1000, \"Kether\"},\n\t{u256(1000000000) * 1000000000, \"ether\"},\n\t{u256(1000000000) * 1000000, \"finney\"},\n\t{u256(1000000000) * 1000, \"szabo\"},\n\t{u256(1000000000), \"Gwei\"},\n\t{u256(1000000), \"Mwei\"},\n\t{u256(1000), \"Kwei\"},\n\t{u256(1), \"wei\"}\n};\n\nvector<pair<u256, string>> const& units()\n{\n\treturn g_units;\n}\n\nstd::string formatBalance(u256 _b)\n{\n\tostringstream ret;\n\tif (_b > g_units[0].first * 10000)\n\t{\n\t\tret << (_b \/ g_units[0].first) << \" \" << g_units[0].second;\n\t\treturn ret.str();\n\t}\n\tret << setprecision(5);\n\tfor (auto const& i: g_units)\n\t\tif (i.first != 1 && _b >= i.first * 100)\n\t\t{\n\t\t\tret << (double(_b \/ (i.first \/ 1000)) \/ 1000.0) << \" \" << i.second;\n\t\t\treturn ret.str();\n\t\t}\n\tret << _b << \" wei\";\n\treturn ret.str();\n}\n\n}}\n<|endoftext|>"}
{"text":"<commit_before>#include <cerrno>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n\n#include <pqxx\/connection>\n#include <pqxx\/transaction>\n#include <pqxx\/transactor>\n#include <pqxx\/trigger>\n#include <pqxx\/result>\n\n\nusing namespace PGSTD;\nusing namespace pqxx;\n\n\/\/ Example program for libpqxx.  Send notification to self.\n\/\/\n\/\/ Usage: test004 [connect-string]\n\/\/\n\/\/ Where connect-string is a set of connection options in Postgresql's\n\/\/ PQconnectdb() format, eg. \"dbname=template1\" to select from a database\n\/\/ called template1, or \"host=foo.bar.net user=smith\" to connect to a\n\/\/ backend running on host foo.bar.net, logging in as user smith.\n\n#ifdef _WIN32\n#include <windows.h>\n#else\nextern \"C\"\n{\n#ifdef PQXX_HAVE_SYS_SELECT_H\n#include <sys\/select.h>\n#else\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#endif\n}\n#endif\t\/\/ _WIN32\n\nnamespace\n{\n\nint Backend_PID = 0;\n\n\n#ifndef _WIN32\n\/\/ Reasonably portable way to sleep for a given number of milliseconds\n\/* This definition is not needed on Windows, which provides its own Sleep()\n * function with the same semantics.\n *\/\nvoid Sleep(int ms)\n{\n  fd_set F;\n  FD_ZERO(&F);\n  struct timeval timeout;\n  timeout.tv_sec = ms \/ 1000;\n  timeout.tv_usec = (ms % 1000) * 1000;\n  if (select(0, &F, &F, &F, &timeout) == -1)\n    throw runtime_error(strerror(errno));\n}\n#endif\t\/\/ _WIN32\n\n\/\/ Sample implementation of trigger handler\nclass TestTrig : public trigger\n{\n  bool m_Done;\n\npublic:\n  explicit TestTrig(connection_base &C) : trigger(C, \"trig\"), m_Done(false) {}\n\n  virtual void operator()(int be_pid)\n  {\n    m_Done = true;\n    if (be_pid != Backend_PID)\n      throw logic_error(\"Expected notification from backend process \" +\n\t\t        to_string(Backend_PID) +\n\t\t\t\", but got one from \" +\n\t\t\tto_string(be_pid));\n\n    cout << \"Received notification: \" << name() << \" pid=\" << be_pid << endl;\n  }\n\n  bool Done() const { return m_Done; }\n};\n\n\n\/\/ A transactor to trigger our trigger handler\nclass Notify : public transactor<>\n{\n  string m_Trigger;\n\npublic:\n  explicit Notify(string TrigName) : \n    transactor<>(\"Notifier\"), m_Trigger(TrigName) { }\n\n  void operator()(argument_type &T)\n  {\n    T.exec(\"NOTIFY \" + m_Trigger);\n    Backend_PID = T.conn().backendpid();\n  }\n\n  void OnAbort(const char Reason[]) throw ()\n  {\n    try\n    {\n      cerr << \"Notify failed!\" << endl;\n      if (Reason) cerr << \"Reason: \" << Reason << endl;\n    }\n    catch (const exception &)\n    {\n    }\n  }\n};\n\n} \/\/ namespace\n\n\nint main(int, char *argv[])\n{\n  try\n  {\n    connection C(argv[1]);\n    cout << \"Adding trigger...\" << endl;\n    TestTrig Trig(C);\n\n    cout << \"Sending notification...\" << endl;\n    C.perform(Notify(Trig.name()));\n\n    int notifs = 0;\n    for (int i=0; (i < 20) && !Trig.Done(); ++i)\n    {\n      if (notifs)\n\tthrow logic_error(\"Got \" + to_string(notifs) + \n\t    \" unexpected notification(s)!\");\n      Sleep(500);\n      notifs = C.get_notifs();\n      cout << \".\";\n    }\n    cout << endl;\n\n    if (!Trig.Done()) \n    {\n      cout << \"No notification received!\" << endl;\n      return 1;\n    }\n    if (notifs != 1)\n      throw logic_error(\"Expected 1 notification, got \" + to_string(notifs));\n  }\n  catch (const sql_error &e)\n  {\n    \/\/ If we're interested in the text of a failed query, we can write separate\n    \/\/ exception handling code for this type of exception\n    cerr << \"SQL error: \" << e.what() << endl\n         << \"Query was: '\" << e.query() << \"'\" << endl;\n    return 1;\n  }\n  catch (const exception &e)\n  {\n    \/\/ All exceptions thrown by libpqxx are derived from std::exception\n    cerr << \"Exception: \" << e.what() << endl;\n    return 2;\n  }\n  catch (...)\n  {\n    \/\/ This is really unexpected (see above)\n    cerr << \"Unhandled exception\" << endl;\n    return 100;\n  }\n\n  return 0;\n}\n\n<commit_msg>Quoted trigger names<commit_after>#include <cerrno>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n\n#include <pqxx\/connection>\n#include <pqxx\/transaction>\n#include <pqxx\/transactor>\n#include <pqxx\/trigger>\n#include <pqxx\/result>\n\n\nusing namespace PGSTD;\nusing namespace pqxx;\n\n\/\/ Example program for libpqxx.  Send notification to self.\n\/\/\n\/\/ Usage: test004 [connect-string]\n\/\/\n\/\/ Where connect-string is a set of connection options in Postgresql's\n\/\/ PQconnectdb() format, eg. \"dbname=template1\" to select from a database\n\/\/ called template1, or \"host=foo.bar.net user=smith\" to connect to a\n\/\/ backend running on host foo.bar.net, logging in as user smith.\n\n#ifdef _WIN32\n#include <windows.h>\n#else\nextern \"C\"\n{\n#ifdef PQXX_HAVE_SYS_SELECT_H\n#include <sys\/select.h>\n#else\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#endif\n}\n#endif\t\/\/ _WIN32\n\nnamespace\n{\n\nint Backend_PID = 0;\n\n\n#ifndef _WIN32\n\/\/ Reasonably portable way to sleep for a given number of milliseconds\n\/* This definition is not needed on Windows, which provides its own Sleep()\n * function with the same semantics.\n *\/\nvoid Sleep(int ms)\n{\n  fd_set F;\n  FD_ZERO(&F);\n  struct timeval timeout;\n  timeout.tv_sec = ms \/ 1000;\n  timeout.tv_usec = (ms % 1000) * 1000;\n  if (select(0, &F, &F, &F, &timeout) == -1)\n    throw runtime_error(strerror(errno));\n}\n#endif\t\/\/ _WIN32\n\n\/\/ Sample implementation of trigger handler\nclass TestTrig : public trigger\n{\n  bool m_Done;\n\npublic:\n  explicit TestTrig(connection_base &C) : trigger(C, \"trig\"), m_Done(false) {}\n\n  virtual void operator()(int be_pid)\n  {\n    m_Done = true;\n    if (be_pid != Backend_PID)\n      throw logic_error(\"Expected notification from backend process \" +\n\t\t        to_string(Backend_PID) +\n\t\t\t\", but got one from \" +\n\t\t\tto_string(be_pid));\n\n    cout << \"Received notification: \" << name() << \" pid=\" << be_pid << endl;\n  }\n\n  bool Done() const { return m_Done; }\n};\n\n\n\/\/ A transactor to trigger our trigger handler\nclass Notify : public transactor<>\n{\n  string m_Trigger;\n\npublic:\n  explicit Notify(string TrigName) : \n    transactor<>(\"Notifier\"), m_Trigger(TrigName) { }\n\n  void operator()(argument_type &T)\n  {\n    T.exec(\"NOTIFY \\\"\" + m_Trigger + \"\\\"\");\n    Backend_PID = T.conn().backendpid();\n  }\n\n  void OnAbort(const char Reason[]) throw ()\n  {\n    try\n    {\n      cerr << \"Notify failed!\" << endl;\n      if (Reason) cerr << \"Reason: \" << Reason << endl;\n    }\n    catch (const exception &)\n    {\n    }\n  }\n};\n\n} \/\/ namespace\n\n\nint main(int, char *argv[])\n{\n  try\n  {\n    connection C(argv[1]);\n    cout << \"Adding trigger...\" << endl;\n    TestTrig Trig(C);\n\n    cout << \"Sending notification...\" << endl;\n    C.perform(Notify(Trig.name()));\n\n    int notifs = 0;\n    for (int i=0; (i < 20) && !Trig.Done(); ++i)\n    {\n      if (notifs)\n\tthrow logic_error(\"Got \" + to_string(notifs) + \n\t    \" unexpected notification(s)!\");\n      Sleep(500);\n      notifs = C.get_notifs();\n      cout << \".\";\n    }\n    cout << endl;\n\n    if (!Trig.Done()) \n    {\n      cout << \"No notification received!\" << endl;\n      return 1;\n    }\n    if (notifs != 1)\n      throw logic_error(\"Expected 1 notification, got \" + to_string(notifs));\n  }\n  catch (const sql_error &e)\n  {\n    \/\/ If we're interested in the text of a failed query, we can write separate\n    \/\/ exception handling code for this type of exception\n    cerr << \"SQL error: \" << e.what() << endl\n         << \"Query was: '\" << e.query() << \"'\" << endl;\n    return 1;\n  }\n  catch (const exception &e)\n  {\n    \/\/ All exceptions thrown by libpqxx are derived from std::exception\n    cerr << \"Exception: \" << e.what() << endl;\n    return 2;\n  }\n  catch (...)\n  {\n    \/\/ This is really unexpected (see above)\n    cerr << \"Unhandled exception\" << endl;\n    return 100;\n  }\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MJOLNIR_GLOBAL_EXTERNAL_INTERACTION\n#define MJOLNIR_GLOBAL_EXTERNAL_INTERACTION\n#include \"GlobalInteractionBase.hpp\"\n\nnamespace mjolnir\n{\n\ntemplate<typename traitsT, typename potentialT, typename partition>\nclass GlobalExternalInteraction : public GlobalInteractionBase<traitsT>\n{\n  public:\n    \n    using traits_type             = traitsT;\n    using potential_type          = potentialT;\n    using partition_type          = partitionT;\n    using base_type               = GlobalInteractionBase<traits_type>;\n    using real_type               = base_type::real_type;\n    using coordinate_type         = base_type::coordinate_type;\n    using system_type             = base_type::system_type;\n    using particle_type           = base_type::particle_type;\n    using boundary_type           = base_type::boundary_type;\n    \n  public:\n    GlobalExternalInteraction()  = default;\n    ~GlobalExternalInteraction() = default;\n    \n    GlobalExternalInteraction(potential_type&& pot, partition_type&& part)\n\t: potential_(std::move(pot)),spatial_partition_(std::move(part))\n    {}\n    \n    void initialize(const system_type&, const real_type) override\n    {\n\treturn ;\t\n    }\n    \n    void calc_force(system_type&)                          override;\n    void calc_energy(const particle_container_type&) const override;\n    \n  private:\n    \n    potential_type potential_;\n    spatial_partition_type spatial_partition_;\n};\n\ntemplate<typename traitsT, typename potT, typename spaceT>\nvoid GlobalExternalInteraction<traitsT, potT, spaceT>::calc_force(\n    system_type& sys)\n{\n    for(std::size_t i = 0; i < sys.size(); ++i){\n\tconst real_type force = potential_.derivative(sys[i].position.at(2));\n\tsys[i].force.at(2) += f;\n    }\n    return ;\n}\n\ntemplate<typename traitsT, typename potT, typename spaceT>\ntypename GlobalExternalInteraction<traitsT, potT, spaceT>::calc_energy\n(system_type& sys) const\n{\n    real_type e = 0.0;\n    for(std::size_t i = 0; i < sys.size(); ++i){\n\te += potential_.potential(sys[i].position.at(2));\n    }\n    return e;\n}\n\n}  \n#endif \/* MJOLNIR_GLOBAL_EXTERNAL_INTERACTION *\/\n<commit_msg>correct typename specification and sign of force.<commit_after>#ifndef MJOLNIR_GLOBAL_EXTERNAL_INTERACTION\n#define MJOLNIR_GLOBAL_EXTERNAL_INTERACTION\n#include \"GlobalInteractionBase.hpp\"\n\nnamespace mjolnir\n{\n\ntemplate<typename traitsT, typename potentialT, typename partitionT>\nclass GlobalExternalInteraction : public GlobalInteractionBase<traitsT>\n{\n  public:\n    \n    using traits_type             = traitsT;\n    using potential_type          = potentialT;\n    using partition_type          = partitionT;\n    using base_type               = GlobalInteractionBase<traits_type>;\n    using real_type               = typename base_type::real_type;\n    using coordinate_type         = typename base_type::coordinate_type;\n    using system_type             = typename base_type::system_type;\n    using particle_type           = typename base_type::particle_type;\n    using boundary_type           = typename base_type::boundary_type;\n    \n  public:\n    GlobalExternalInteraction()  = default;\n    ~GlobalExternalInteraction() = default;\n    \n    GlobalExternalInteraction(potential_type&& pot, partition_type&& part)\n\t: potential_(std::move(pot)),spatial_partition_(std::move(part))\n    {}\n    \n    void initialize(const system_type&, const real_type) override\n    {\n\treturn ;\t\n    }\n    \n    void      calc_force(system_type&)              override;\n    real_type calc_energy(const system_type&) const override;\n    \n  private:\n    \n    potential_type potential_;\n    partition_type spatial_partition_;\n};\n\ntemplate<typename traitsT, typename potT, typename spaceT>\nvoid GlobalExternalInteraction<traitsT, potT, spaceT>::calc_force(\n    system_type& sys)\n{\n    for(std::size_t i = 0; i < sys.size(); ++i){\n\tconst real_type force = -potential_.derivative(i, sys[i].position.at(2));\n\tsys[i].force.at(2) += force;\n    }\n    return ;\n}\n\ntemplate<typename traitsT, typename potT, typename spaceT>\ntypename GlobalExternalInteraction<traitsT, potT, spaceT>::real_type \nGlobalExternalInteraction<traitsT, potT, spaceT>::calc_energy(\n    const system_type& sys) const\n{\n    real_type e = 0.0;\n    for(std::size_t i = 0; i < sys.size(); ++i){\n\te += potential_.potential(i, sys[i].position.at(2));\n    }\n    return e;\n}\n\n}  \n#endif \/* MJOLNIR_GLOBAL_EXTERNAL_INTERACTION *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2018.  All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include \"Sanitizer.h\"\n\n#include \"AssertExternallySynchronizedLock.h\"\n\nusing namespace Stroika;\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Debug;\n\n#if qDebug\n\/*\n ********************************************************************************\n ****************** Debug::AssertExternallySynchronizedLock *********************\n ********************************************************************************\n *\/\nDISABLE_COMPILER_MSC_WARNING_START (4297)\n\/\/ workaround https:\/\/stroika.atlassian.net\/browse\/STK-665, https:\/\/stroika.atlassian.net\/browse\/STK-500 - ARM ONLY\nStroika_Foundation_Debug_ATTRIBUTE_NO_SANITIZE (\"address\")\n    AssertExternallySynchronizedLock::AssertExternallySynchronizedLock () noexcept try : fSharedLockThreads_ () {\n}\ncatch (...) {\n    AssertNotReached ();\n}\nDISABLE_COMPILER_MSC_WARNING_END (4297)\n\nvoid AssertExternallySynchronizedLock::lock_ () const noexcept\n{\n    try {\n        if (fLocks_++ == 0) {\n            \/\/ If first time in, save thread-id\n            fCurLockThread_ = this_thread::get_id ();\n            lock_guard<mutex> sharedLockProtect{GetSharedLockMutexThreads_ ()};\n            if (not fSharedLockThreads_.empty ()) {\n                \/\/ If first already shared locks - OK - so long as same thread\n                Require (fSharedLockThreads_.count (fCurLockThread_) == fSharedLockThreads_.size ());\n            }\n        }\n        else {\n            \/\/ If first already locked - OK - so long as same thread\n            Require (fCurLockThread_ == this_thread::get_id ());\n        }\n    }\n    catch (...) {\n        AssertNotReached ();\n    }\n}\n\nvoid AssertExternallySynchronizedLock::unlock_ () const noexcept\n{\n    Require (fCurLockThread_ == this_thread::get_id ());\n    Require (fLocks_ > 0); \/\/ else unbalanced\n    --fLocks_;\n}\n\n\/\/ workaround https:\/\/stroika.atlassian.net\/browse\/STK-665\nStroika_Foundation_Debug_ATTRIBUTE_NO_SANITIZE (\"address\") void AssertExternallySynchronizedLock::lock_shared_ () const noexcept\n{\n    try {\n        \/\/ OK to shared lock from various threads\n        \/\/ But if already locked, NOT OK (would have blocked in real impl) - if you try to shared lock from another thread while locked\n        if (fLocks_ != 0) {\n            \/\/ If first already locks - OK - so long as same thread\n            Require (fCurLockThread_ == this_thread::get_id ());\n        }\n        lock_guard<mutex> sharedLockProtect{GetSharedLockMutexThreads_ ()};\n        fSharedLockThreads_.insert (this_thread::get_id ());\n    }\n    catch (...) {\n        AssertNotReached ();\n    }\n}\n\nvoid AssertExternallySynchronizedLock::unlock_shared_ () const noexcept\n{\n    try {\n        lock_guard<mutex>              sharedLockProtect{GetSharedLockMutexThreads_ ()};\n        multiset<thread::id>::iterator tti = fSharedLockThreads_.find (this_thread::get_id ());\n        Require (tti != fSharedLockThreads_.end ()); \/\/ else unbalanced\n        fSharedLockThreads_.erase (tti);\n    }\n    catch (...) {\n        AssertNotReached ();\n    }\n}\n#endif\n<commit_msg>Cosmetic<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2018.  All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include \"Sanitizer.h\"\n\n#include \"AssertExternallySynchronizedLock.h\"\n\nusing namespace Stroika;\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Debug;\n\n#if qDebug\n\/*\n ********************************************************************************\n ****************** Debug::AssertExternallySynchronizedLock *********************\n ********************************************************************************\n *\/\nDISABLE_COMPILER_MSC_WARNING_START (4297)\n\/\/ workaround https:\/\/stroika.atlassian.net\/browse\/STK-665, https:\/\/stroika.atlassian.net\/browse\/STK-500 - ARM ONLY\nStroika_Foundation_Debug_ATTRIBUTE_NO_SANITIZE (\"address\")\n    AssertExternallySynchronizedLock::AssertExternallySynchronizedLock () noexcept try : fSharedLockThreads_ () {\n}\ncatch (...) {\n    AssertNotReached ();\n}\nDISABLE_COMPILER_MSC_WARNING_END (4297)\n\nvoid AssertExternallySynchronizedLock::lock_ () const noexcept\n{\n    try {\n        if (fLocks_++ == 0) {\n            \/\/ If first time in, save thread-id\n            fCurLockThread_ = this_thread::get_id ();\n            lock_guard<mutex> sharedLockProtect{GetSharedLockMutexThreads_ ()};\n            if (not fSharedLockThreads_.empty ()) {\n                \/\/ If first already shared locks - OK - so long as same thread\n                Require (fSharedLockThreads_.count (fCurLockThread_) == fSharedLockThreads_.size ());\n            }\n        }\n        else {\n            \/\/ If first already locked - OK - so long as same thread\n            Require (fCurLockThread_ == this_thread::get_id ());\n        }\n    }\n    catch (...) {\n        AssertNotReached ();\n    }\n}\n\nvoid AssertExternallySynchronizedLock::unlock_ () const noexcept\n{\n    Require (fCurLockThread_ == this_thread::get_id ());\n    Require (fLocks_ > 0); \/\/ else unbalanced\n    --fLocks_;\n}\n\n\/\/ workaround https:\/\/stroika.atlassian.net\/browse\/STK-665- Stroika_Foundation_Debug_ATTRIBUTE_NO_SANITIZE (\"address\")\nStroika_Foundation_Debug_ATTRIBUTE_NO_SANITIZE (\"address\") void AssertExternallySynchronizedLock::lock_shared_ () const noexcept\n{\n    try {\n        \/\/ OK to shared lock from various threads\n        \/\/ But if already locked, NOT OK (would have blocked in real impl) - if you try to shared lock from another thread while locked\n        if (fLocks_ != 0) {\n            \/\/ If first already locks - OK - so long as same thread\n            Require (fCurLockThread_ == this_thread::get_id ());\n        }\n        lock_guard<mutex> sharedLockProtect{GetSharedLockMutexThreads_ ()};\n        fSharedLockThreads_.insert (this_thread::get_id ());\n    }\n    catch (...) {\n        AssertNotReached ();\n    }\n}\n\nvoid AssertExternallySynchronizedLock::unlock_shared_ () const noexcept\n{\n    try {\n        lock_guard<mutex>              sharedLockProtect{GetSharedLockMutexThreads_ ()};\n        multiset<thread::id>::iterator tti = fSharedLockThreads_.find (this_thread::get_id ());\n        Require (tti != fSharedLockThreads_.end ()); \/\/ else unbalanced\n        fSharedLockThreads_.erase (tti);\n    }\n    catch (...) {\n        AssertNotReached ();\n    }\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2019 Intel 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 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#include \"mfx_common.h\"\n#if defined(MFX_ENABLE_H265_VIDEO_ENCODE) && defined(MFX_ENABLE_HEVCE_WEIGHTED_PREDICTION)\n\n#include \"hevcehw_g9_weighted_prediction.h\"\n#include <numeric>\n\nusing namespace HEVCEHW;\nusing namespace HEVCEHW::Gen9;\n\nvoid WeightPred::SetSupported(ParamSupport& blocks)\n{\n    blocks.m_ebCopySupported[MFX_EXTBUFF_CODING_OPTION3].emplace_back(\n        [](const mfxExtBuffer* pSrc, mfxExtBuffer* pDst) -> void\n    {\n        auto& buf_src = *(const mfxExtCodingOption3*)pSrc;\n        auto& buf_dst = *(mfxExtCodingOption3*)pDst;\n\n        MFX_COPY_FIELD(WeightedPred);\n        MFX_COPY_FIELD(WeightedBiPred);\n        MFX_COPY_FIELD(FadeDetection);\n    });\n}\n\nvoid WeightPred::Query1WithCaps(const FeatureBlocks& \/*blocks*\/, TPushQ1 Push)\n{\n    Push(BLK_CheckAndFix\n        , [this](const mfxVideoParam& \/*in*\/, mfxVideoParam& par, StorageW& global) -> mfxStatus\n    {\n        mfxExtCodingOption3* pCO3 = ExtBuffer::Get(par);\n        MFX_CHECK(pCO3, MFX_ERR_NONE);\n\n        auto&  caps         = Glob::EncodeCaps::Get(global);\n        auto   hw           = Glob::VideoCore::Get(global).GetHWType();\n        bool   bFDSupported = !caps.NoWeightedPred && (hw < MFX_HW_ICL);\n        mfxU32 changed      = 0;\n\n        changed += CheckOrZero<mfxU16>(\n            pCO3->WeightedPred\n            , mfxU16(MFX_WEIGHTED_PRED_UNKNOWN)\n            , mfxU16(MFX_WEIGHTED_PRED_DEFAULT)\n            , mfxU16(!caps.NoWeightedPred * MFX_WEIGHTED_PRED_EXPLICIT));\n\n        changed += CheckOrZero<mfxU16>(\n            pCO3->WeightedBiPred\n            , mfxU16(MFX_WEIGHTED_PRED_UNKNOWN)\n            , mfxU16(MFX_WEIGHTED_PRED_DEFAULT)\n            , mfxU16(!caps.NoWeightedPred * MFX_WEIGHTED_PRED_EXPLICIT));\n\n        changed += CheckOrZero<mfxU16>(\n            pCO3->FadeDetection\n            , mfxU16(MFX_CODINGOPTION_UNKNOWN)\n            , mfxU16(MFX_CODINGOPTION_OFF)\n            , mfxU16(bFDSupported * MFX_CODINGOPTION_ON));\n\n        MFX_CHECK(!changed, MFX_WRN_INCOMPATIBLE_VIDEO_PARAM);\n\n        return MFX_ERR_NONE;\n    });\n}\n\nvoid WeightPred::SetDefaults(const FeatureBlocks& \/*blocks*\/, TPushSD Push)\n{\n    Push(BLK_SetDefaults\n        , [this](mfxVideoParam& par, StorageW& \/*strg*\/, StorageRW&)\n    {\n        mfxExtCodingOption3* pCO3 = ExtBuffer::Get(par);\n        MFX_CHECK(pCO3, MFX_ERR_NONE);\n\n        SetDefault(pCO3->FadeDetection, MFX_CODINGOPTION_OFF);\n        SetDefault(pCO3->WeightedPred\n            , IsOn(pCO3->FadeDetection) * MFX_WEIGHTED_PRED_EXPLICIT\n            + IsOff(pCO3->FadeDetection) * MFX_WEIGHTED_PRED_DEFAULT);\n        SetDefault(pCO3->WeightedBiPred, pCO3->WeightedPred);\n\n        return MFX_ERR_NONE;\n    });\n}\n\nvoid WeightPred::InitInternal(const FeatureBlocks& \/*blocks*\/, TPushII Push)\n{\n    Push(BLK_SetPPS\n        , [this](StorageRW& strg, StorageRW&) -> mfxStatus\n    {\n        auto& par = Glob::VideoParam::Get(strg);\n        const mfxExtCodingOption3& CO3 = ExtBuffer::Get(par);\n\n        PPS& pps = Glob::PPS::Get(strg);\n        pps.weighted_pred_flag   = (CO3.WeightedPred   == MFX_WEIGHTED_PRED_EXPLICIT);\n        pps.weighted_bipred_flag = (CO3.WeightedBiPred == MFX_WEIGHTED_PRED_EXPLICIT) || (IsOn(CO3.GPB) && pps.weighted_pred_flag);\n\n        MFX_CHECK(strg.Contains(Glob::RealState::Key), MFX_ERR_NONE);\n\n        const PPS& oldPPS = Glob::PPS::Get(Glob::RealState::Get(strg));\n        Glob::ResetHint::Get(strg).Flags |=\n            RF_PPS_CHANGED\n            * (    (pps.weighted_pred_flag != oldPPS.weighted_pred_flag)\n                || (pps.weighted_bipred_flag != oldPPS.weighted_bipred_flag));\n\n        return MFX_ERR_NONE;\n    });\n}\n\nvoid WeightPred::PostReorderTask(const FeatureBlocks& \/*blocks*\/, TPushPostRT Push)\n{\n    Push(BLK_SetSSH\n        , [](StorageW& global, StorageW& s_task) -> mfxStatus\n    {\n        auto& pps = Glob::PPS::Get(global);\n        auto& ssh = Task::SSH::Get(s_task);\n\n        bool bNeedPWT =\n            (pps.weighted_pred_flag && ssh.type == 1)\n            || (pps.weighted_bipred_flag && ssh.type == 0);\n\n        MFX_CHECK(bNeedPWT, MFX_ERR_NONE);\n\n        const mfxU16 Y = 0, Cb = 1, Cr = 2, W = 0, O = 1;\n        auto& task             = Task::Common::Get(s_task);\n        auto& caps             = Glob::EncodeCaps::Get(global);\n        auto  pExtPWT          = (mfxExtPredWeightTable*)ExtBuffer::Get(task.ctrl);\n        auto  SetDefaultWeight = [&](mfxI16 (&pwt)[3][2])\n        {\n            pwt[Y][W]  = (1 << ssh.luma_log2_weight_denom);\n            pwt[Y][O]  = 0;\n            pwt[Cb][W] = (1 << ssh.chroma_log2_weight_denom);\n            pwt[Cb][O] = 0;\n            pwt[Cr][W] = (1 << ssh.chroma_log2_weight_denom);\n            pwt[Cr][O] = 0;\n        };\n        auto  CopyLxPWT        = [&](mfxU16 l, mfxU16 sz)\n        {\n            auto CopyY = [&](mfxU16 i)\n            {\n                ssh.pwt[l][i][Y][W] = pExtPWT->Weights[l][i][Y][W];\n                ssh.pwt[l][i][Y][O] = pExtPWT->Weights[l][i][Y][O];\n            };\n            auto CopyC = [&](mfxU16 i)\n            {\n                ssh.pwt[l][i][Cb][W] = pExtPWT->Weights[l][i][Cb][W];\n                ssh.pwt[l][i][Cb][O] = pExtPWT->Weights[l][i][Cb][O];\n                ssh.pwt[l][i][Cr][W] = pExtPWT->Weights[l][i][Cr][W];\n                ssh.pwt[l][i][Cr][O] = pExtPWT->Weights[l][i][Cr][O];\n            };\n\n            std::list<mfxI16> idxY(sz * caps.LumaWeightedPred, 0);\n            std::list<mfxI16> idxC(sz * caps.ChromaWeightedPred, 0);\n\n            std::iota(idxY.begin(), idxY.end(), mfxI16(0));\n            std::iota(idxC.begin(), idxC.end(), mfxI16(0));\n\n            idxY.remove_if([&](mfxI16 i) { return !pExtPWT->LumaWeightFlag[l][i]; });\n            idxC.remove_if([&](mfxI16 i) { return !pExtPWT->ChromaWeightFlag[l][i]; });\n\n            for_each(idxY.begin(), idxY.end(), CopyY);\n            for_each(idxC.begin(), idxC.end(), CopyC);\n        };\n\n        ssh.luma_log2_weight_denom   = 6;\n        ssh.chroma_log2_weight_denom = ssh.luma_log2_weight_denom;\n\n        if (pExtPWT)\n        {\n            ssh.luma_log2_weight_denom   = pExtPWT->LumaLog2WeightDenom;\n            ssh.chroma_log2_weight_denom = pExtPWT->ChromaLog2WeightDenom;\n        }\n\n        std::for_each(std::begin(ssh.pwt[0]), std::end(ssh.pwt[0]), SetDefaultWeight);\n        std::for_each(std::begin(ssh.pwt[1]), std::end(ssh.pwt[1]), SetDefaultWeight);\n\n        MFX_CHECK(pExtPWT, MFX_ERR_NONE);\n\n        CopyLxPWT(0, std::min<mfxU16>(ssh.num_ref_idx_l0_active_minus1 + 1, caps.MaxNum_WeightedPredL0));\n        CopyLxPWT(1, std::min<mfxU16>(ssh.num_ref_idx_l1_active_minus1 + 1, caps.MaxNum_WeightedPredL1));\n        \n        bool bForceSameWeights =\n            task.isLDB\n            && std::equal(\n                std::begin(task.RefPicList[0])\n                , std::end(task.RefPicList[0])\n                , std::begin(task.RefPicList[1]));\n\n        MFX_CHECK(bForceSameWeights, MFX_ERR_NONE);\n\n        std::copy_n((mfxU8*)ssh.pwt[0], sizeof(ssh.pwt[0]), (mfxU8*)ssh.pwt[1]);\n\n\n        return MFX_ERR_NONE;\n    });\n}\n\n#endif \/\/defined(MFX_ENABLE_H265_VIDEO_ENCODE)<commit_msg>HEVCe: fix fade-detection support condition<commit_after>\/\/ Copyright (c) 2019 Intel 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 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#include \"mfx_common.h\"\n#if defined(MFX_ENABLE_H265_VIDEO_ENCODE) && defined(MFX_ENABLE_HEVCE_WEIGHTED_PREDICTION)\n\n#include \"hevcehw_g9_weighted_prediction.h\"\n#include <numeric>\n\nusing namespace HEVCEHW;\nusing namespace HEVCEHW::Gen9;\n\nvoid WeightPred::SetSupported(ParamSupport& blocks)\n{\n    blocks.m_ebCopySupported[MFX_EXTBUFF_CODING_OPTION3].emplace_back(\n        [](const mfxExtBuffer* pSrc, mfxExtBuffer* pDst) -> void\n    {\n        auto& buf_src = *(const mfxExtCodingOption3*)pSrc;\n        auto& buf_dst = *(mfxExtCodingOption3*)pDst;\n\n        MFX_COPY_FIELD(WeightedPred);\n        MFX_COPY_FIELD(WeightedBiPred);\n        MFX_COPY_FIELD(FadeDetection);\n    });\n}\n\nvoid WeightPred::Query1WithCaps(const FeatureBlocks& \/*blocks*\/, TPushQ1 Push)\n{\n    Push(BLK_CheckAndFix\n        , [this](const mfxVideoParam& \/*in*\/, mfxVideoParam& par, StorageW& global) -> mfxStatus\n    {\n        mfxExtCodingOption3* pCO3 = ExtBuffer::Get(par);\n        MFX_CHECK(pCO3, MFX_ERR_NONE);\n\n        auto&  caps         = Glob::EncodeCaps::Get(global);\n        auto   hw           = Glob::VideoCore::Get(global).GetHWType();\n        bool   bFDSupported = !caps.NoWeightedPred && (hw >= MFX_HW_ICL);\n        mfxU32 changed      = 0;\n\n        changed += CheckOrZero<mfxU16>(\n            pCO3->WeightedPred\n            , mfxU16(MFX_WEIGHTED_PRED_UNKNOWN)\n            , mfxU16(MFX_WEIGHTED_PRED_DEFAULT)\n            , mfxU16(!caps.NoWeightedPred * MFX_WEIGHTED_PRED_EXPLICIT));\n\n        changed += CheckOrZero<mfxU16>(\n            pCO3->WeightedBiPred\n            , mfxU16(MFX_WEIGHTED_PRED_UNKNOWN)\n            , mfxU16(MFX_WEIGHTED_PRED_DEFAULT)\n            , mfxU16(!caps.NoWeightedPred * MFX_WEIGHTED_PRED_EXPLICIT));\n\n        changed += CheckOrZero<mfxU16>(\n            pCO3->FadeDetection\n            , mfxU16(MFX_CODINGOPTION_UNKNOWN)\n            , mfxU16(MFX_CODINGOPTION_OFF)\n            , mfxU16(bFDSupported * MFX_CODINGOPTION_ON));\n\n        MFX_CHECK(!changed, MFX_WRN_INCOMPATIBLE_VIDEO_PARAM);\n\n        return MFX_ERR_NONE;\n    });\n}\n\nvoid WeightPred::SetDefaults(const FeatureBlocks& \/*blocks*\/, TPushSD Push)\n{\n    Push(BLK_SetDefaults\n        , [this](mfxVideoParam& par, StorageW& \/*strg*\/, StorageRW&)\n    {\n        mfxExtCodingOption3* pCO3 = ExtBuffer::Get(par);\n        MFX_CHECK(pCO3, MFX_ERR_NONE);\n\n        SetDefault(pCO3->FadeDetection, MFX_CODINGOPTION_OFF);\n        SetDefault(pCO3->WeightedPred\n            , IsOn(pCO3->FadeDetection) * MFX_WEIGHTED_PRED_EXPLICIT\n            + IsOff(pCO3->FadeDetection) * MFX_WEIGHTED_PRED_DEFAULT);\n        SetDefault(pCO3->WeightedBiPred, pCO3->WeightedPred);\n\n        return MFX_ERR_NONE;\n    });\n}\n\nvoid WeightPred::InitInternal(const FeatureBlocks& \/*blocks*\/, TPushII Push)\n{\n    Push(BLK_SetPPS\n        , [this](StorageRW& strg, StorageRW&) -> mfxStatus\n    {\n        auto& par = Glob::VideoParam::Get(strg);\n        const mfxExtCodingOption3& CO3 = ExtBuffer::Get(par);\n\n        PPS& pps = Glob::PPS::Get(strg);\n        pps.weighted_pred_flag   = (CO3.WeightedPred   == MFX_WEIGHTED_PRED_EXPLICIT);\n        pps.weighted_bipred_flag = (CO3.WeightedBiPred == MFX_WEIGHTED_PRED_EXPLICIT) || (IsOn(CO3.GPB) && pps.weighted_pred_flag);\n\n        MFX_CHECK(strg.Contains(Glob::RealState::Key), MFX_ERR_NONE);\n\n        const PPS& oldPPS = Glob::PPS::Get(Glob::RealState::Get(strg));\n        Glob::ResetHint::Get(strg).Flags |=\n            RF_PPS_CHANGED\n            * (    (pps.weighted_pred_flag != oldPPS.weighted_pred_flag)\n                || (pps.weighted_bipred_flag != oldPPS.weighted_bipred_flag));\n\n        return MFX_ERR_NONE;\n    });\n}\n\nvoid WeightPred::PostReorderTask(const FeatureBlocks& \/*blocks*\/, TPushPostRT Push)\n{\n    Push(BLK_SetSSH\n        , [](StorageW& global, StorageW& s_task) -> mfxStatus\n    {\n        auto& pps = Glob::PPS::Get(global);\n        auto& ssh = Task::SSH::Get(s_task);\n\n        bool bNeedPWT =\n            (pps.weighted_pred_flag && ssh.type == 1)\n            || (pps.weighted_bipred_flag && ssh.type == 0);\n\n        MFX_CHECK(bNeedPWT, MFX_ERR_NONE);\n\n        const mfxU16 Y = 0, Cb = 1, Cr = 2, W = 0, O = 1;\n        auto& task             = Task::Common::Get(s_task);\n        auto& caps             = Glob::EncodeCaps::Get(global);\n        auto  pExtPWT          = (mfxExtPredWeightTable*)ExtBuffer::Get(task.ctrl);\n        auto  SetDefaultWeight = [&](mfxI16 (&pwt)[3][2])\n        {\n            pwt[Y][W]  = (1 << ssh.luma_log2_weight_denom);\n            pwt[Y][O]  = 0;\n            pwt[Cb][W] = (1 << ssh.chroma_log2_weight_denom);\n            pwt[Cb][O] = 0;\n            pwt[Cr][W] = (1 << ssh.chroma_log2_weight_denom);\n            pwt[Cr][O] = 0;\n        };\n        auto  CopyLxPWT        = [&](mfxU16 l, mfxU16 sz)\n        {\n            auto CopyY = [&](mfxU16 i)\n            {\n                ssh.pwt[l][i][Y][W] = pExtPWT->Weights[l][i][Y][W];\n                ssh.pwt[l][i][Y][O] = pExtPWT->Weights[l][i][Y][O];\n            };\n            auto CopyC = [&](mfxU16 i)\n            {\n                ssh.pwt[l][i][Cb][W] = pExtPWT->Weights[l][i][Cb][W];\n                ssh.pwt[l][i][Cb][O] = pExtPWT->Weights[l][i][Cb][O];\n                ssh.pwt[l][i][Cr][W] = pExtPWT->Weights[l][i][Cr][W];\n                ssh.pwt[l][i][Cr][O] = pExtPWT->Weights[l][i][Cr][O];\n            };\n\n            std::list<mfxI16> idxY(sz * caps.LumaWeightedPred, 0);\n            std::list<mfxI16> idxC(sz * caps.ChromaWeightedPred, 0);\n\n            std::iota(idxY.begin(), idxY.end(), mfxI16(0));\n            std::iota(idxC.begin(), idxC.end(), mfxI16(0));\n\n            idxY.remove_if([&](mfxI16 i) { return !pExtPWT->LumaWeightFlag[l][i]; });\n            idxC.remove_if([&](mfxI16 i) { return !pExtPWT->ChromaWeightFlag[l][i]; });\n\n            for_each(idxY.begin(), idxY.end(), CopyY);\n            for_each(idxC.begin(), idxC.end(), CopyC);\n        };\n\n        ssh.luma_log2_weight_denom   = 6;\n        ssh.chroma_log2_weight_denom = ssh.luma_log2_weight_denom;\n\n        if (pExtPWT)\n        {\n            ssh.luma_log2_weight_denom   = pExtPWT->LumaLog2WeightDenom;\n            ssh.chroma_log2_weight_denom = pExtPWT->ChromaLog2WeightDenom;\n        }\n\n        std::for_each(std::begin(ssh.pwt[0]), std::end(ssh.pwt[0]), SetDefaultWeight);\n        std::for_each(std::begin(ssh.pwt[1]), std::end(ssh.pwt[1]), SetDefaultWeight);\n\n        MFX_CHECK(pExtPWT, MFX_ERR_NONE);\n\n        CopyLxPWT(0, std::min<mfxU16>(ssh.num_ref_idx_l0_active_minus1 + 1, caps.MaxNum_WeightedPredL0));\n        CopyLxPWT(1, std::min<mfxU16>(ssh.num_ref_idx_l1_active_minus1 + 1, caps.MaxNum_WeightedPredL1));\n        \n        bool bForceSameWeights =\n            task.isLDB\n            && std::equal(\n                std::begin(task.RefPicList[0])\n                , std::end(task.RefPicList[0])\n                , std::begin(task.RefPicList[1]));\n\n        MFX_CHECK(bForceSameWeights, MFX_ERR_NONE);\n\n        std::copy_n((mfxU8*)ssh.pwt[0], sizeof(ssh.pwt[0]), (mfxU8*)ssh.pwt[1]);\n\n\n        return MFX_ERR_NONE;\n    });\n}\n\n#endif \/\/defined(MFX_ENABLE_H265_VIDEO_ENCODE)<|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <stdexcept>\n#include \"opencv2\/core\/core.hpp\"\n#include \"opencv2\/video\/video.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/videostab\/videostab.hpp\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace cv::videostab;\n\n\nPtr<IFrameSource> stabilizedFrames;\nstring saveMotionsPath;\ndouble outputFps;\nstring outputPath;\nbool quietMode;\n\nvoid run();\nvoid saveMotionsIfNecessary();\nvoid printHelp();\n\nclass GlobalMotionReader : public IGlobalMotionEstimator\n{\npublic:\n    GlobalMotionReader(string path)\n    {\n        ifstream f(path.c_str());\n        if (!f.is_open())\n            throw runtime_error(\"can't open motions file: \" + path);\n        int size = 0; f >> size;\n        motions_.resize(size);\n        for (int i = 0; i < size; ++i)\n        {\n            Mat_<float> M(3, 3);\n            for (int l = 0; l < 3; ++l)\n                for (int s = 0; s < 3; ++s)\n                    f >> M(l,s);\n            motions_[i] = M;\n        }\n        pos_ = 0;\n    }\n\n    virtual Mat estimate(const Mat &\/*frame0*\/, const Mat &\/*frame1*\/)\n    {\n        if (pos_ >= motions_.size())\n        {\n            stringstream text;\n            text << \"can't load motion between frames \" << pos_ << \" and \" << pos_+1;\n            throw runtime_error(text.str());\n        }\n        return motions_[pos_++];\n    }\n\nprivate:\n    vector<Mat> motions_;\n    size_t pos_;\n};\n\nvoid run()\n{\n    VideoWriter writer;\n    Mat stabilizedFrame;\n\n    while (!(stabilizedFrame = stabilizedFrames->nextFrame()).empty())\n    {\n        if (!saveMotionsPath.empty())\n            saveMotionsIfNecessary();\n        if (!outputPath.empty())\n        {\n            if (!writer.isOpened())\n                writer.open(outputPath, CV_FOURCC('X','V','I','D'), outputFps, stabilizedFrame.size());\n            writer << stabilizedFrame;\n        }\n        if (!quietMode)\n        {\n            imshow(\"stabilizedFrame\", stabilizedFrame);\n            char key = static_cast<char>(waitKey(3));\n            if (key == 27)\n                break;\n        }\n    }\n\n    cout << \"\\nfinished\\n\";\n}\n\n\nvoid saveMotionsIfNecessary()\n{\n    static bool areMotionsSaved = false;\n    if (!areMotionsSaved)\n    {\n        IFrameSource *frameSource = static_cast<IFrameSource*>(stabilizedFrames);\n        TwoPassStabilizer *twoPassStabilizer = dynamic_cast<TwoPassStabilizer*>(frameSource);\n        if (twoPassStabilizer)\n        {\n            ofstream f(saveMotionsPath.c_str());\n            const vector<Mat> &motions = twoPassStabilizer->motions();\n            f << motions.size() << endl;\n            for (size_t i = 0; i < motions.size(); ++i)\n            {\n                Mat_<float> M = motions[i];\n                for (int l = 0, k = 0; l < 3; ++l)\n                    for (int s = 0; s < 3; ++s, ++k)\n                        f << M(l,s) << \" \";\n                f << endl;\n            }\n        }\n        areMotionsSaved = true;\n        cout << \"motions are saved\";\n    }\n}\n\n\nvoid printHelp()\n{\n    cout << \"OpenCV video stabilizer.\\n\"\n            \"Usage: videostab <file_path> [arguments]\\n\\n\"\n            \"Arguments:\\n\"\n            \"  -m, --model=(transl|transl_and_scale|linear_sim|affine)\\n\"\n            \"      Set motion model. The default is affine.\\n\"\n            \"  --outlier-ratio=<float_number>\\n\"\n            \"      Outliers ratio in motion estimation. The default is 0.5.\\n\"\n            \"  --min-inlier-ratio=<float_number>\\n\"\n            \"      Minimum inlier ratio to decide if estimated motion is OK. The default is 0.1,\\n\"\n            \"      but you may want to increase it.\\n\\n\"\n            \"  --save-motions=<file_path>\\n\"\n            \"      Save estimated motions into file.\\n\"\n            \"  --load-motions=<file_path>\\n\"\n            \"      Load motions from file.\\n\\n\"\n            \"  -r, --radius=<int_number>\\n\"\n            \"      Set smoothing radius. The default is 15.\\n\"\n            \"  --stdev=<float_number>\\n\"\n            \"      Set smoothing weights standard deviation. The default is sqrt(radius).\\n\\n\"\n            \"  --deblur=(yes|no)\\n\"\n            \"      Do deblurring.\\n\"\n            \"  --deblur-sens=<float_number>\\n\"\n            \"      Set deblurring sensitivity (from 0 to +inf). The default is 0.1.\\n\\n\"\n            \"  -t, --trim-ratio=<float_number>\\n\"\n            \"      Set trimming ratio (from 0 to 0.5). The default is 0.0.\\n\"\n            \"  --est-trim=(yes|no)\\n\"\n            \"      Estimate trim ratio automatically. The default is yes (that leads to two passes,\\n\"\n            \"      you can turn it off if you want to use one pass only).\\n\"\n            \"  --incl-constr=(yes|no)\\n\"\n            \"      Ensure the inclusion constraint is always satisfied. The default is no.\\n\\n\"\n            \"  --border-mode=(replicate|reflect|const)\\n\"\n            \"      Set border extrapolation mode. The default is replicate.\\n\\n\"\n            \"  --mosaic=(yes|no)\\n\"\n            \"      Do consistent mosaicing. The default is no.\\n\"\n            \"  --mosaic-stdev=<float_number>\\n\"\n            \"      Consistent mosaicing stdev threshold. The default is 10.0.\\n\\n\"\n            \"  --motion-inpaint=(yes|no)\\n\"\n            \"      Do motion inpainting (requires GPU support). The default is no.\\n\"\n            \"  --dist-thresh=<float_number>\\n\"\n            \"      Estimated flow distance threshold for motion inpainting. The default is 5.0.\\n\\n\"\n            \"  --color-inpaint=(no|average|ns|telea)\\n\"\n            \"      Do color inpainting. The defailt is no.\\n\"\n            \"  --color-inpaint-radius=<float_number>\\n\"\n            \"      Set color inpainting radius (for ns and telea options only).\\n\\n\"\n            \"  -o, --output=(no|<file_path>)\\n\"\n            \"      Set output file path explicitely. The default is stabilized.avi.\\n\"\n            \"  --fps=<int_number>\\n\"\n            \"      Set output video FPS explicitely. By default the source FPS is used.\\n\"\n            \"  -q, --quiet\\n\"\n            \"      Don't show output video frames.\\n\\n\"\n            \"  -h, --help\\n\"\n            \"      Print help.\\n\"\n            \"\\n\";\n}\n\n\nint main(int argc, const char **argv)\n{\n    try\n    {\n        const char *keys =\n                \"{ 1 | | | | }\"\n                \"{ m | model | | }\"\n                \"{ | min-inlier-ratio | | }\"\n                \"{ | outlier-ratio | | }\"\n                \"{ | save-motions | | }\"\n                \"{ | load-motions | | }\"\n                \"{ r | radius | | }\"\n                \"{ | stdev | | }\"\n                \"{ | deblur | | }\"\n                \"{ | deblur-sens | | }\"\n                \"{ | est-trim | yes | }\"\n                \"{ t | trim-ratio | | }\"\n                \"{ | incl-constr | | }\"\n                \"{ | border-mode | | }\"\n                \"{ | mosaic | | }\"\n                \"{ | mosaic-stdev | | }\"\n                \"{ | motion-inpaint | | }\"\n                \"{ | dist-thresh | | }\"\n                \"{ | color-inpaint | no | }\"\n                \"{ | color-inpaint-radius | | }\"\n                \"{ o | output | stabilized.avi | }\"\n                \"{ | fps | | }\"\n                \"{ q | quiet | false | }\"\n                \"{ h | help | false | }\";\n        CommandLineParser cmd(argc, argv, keys);\n\n        \/\/ parse command arguments\n\n        if (cmd.get<bool>(\"help\"))\n        {\n            printHelp();\n            return 0;\n        }\n\n        StabilizerBase *stabilizer;\n        GaussianMotionFilter *motionFilter = 0;\n\n        if (!cmd.get<string>(\"stdev\").empty())\n        {\n            motionFilter = new GaussianMotionFilter();\n            motionFilter->setStdev(cmd.get<float>(\"stdev\"));\n        }\n\n        if (!cmd.get<string>(\"save-motions\").empty())\n            saveMotionsPath = cmd.get<string>(\"save-motions\");\n\n        bool isTwoPass =\n                cmd.get<string>(\"est-trim\") == \"yes\" ||\n                !cmd.get<string>(\"save-motions\").empty();\n\n        if (isTwoPass)\n        {\n            TwoPassStabilizer *twoPassStabilizer = new TwoPassStabilizer();\n            if (!cmd.get<string>(\"est-trim\").empty())\n                twoPassStabilizer->setEstimateTrimRatio(cmd.get<string>(\"est-trim\") == \"yes\");\n            if (motionFilter)\n                twoPassStabilizer->setMotionStabilizer(motionFilter);\n            stabilizer = twoPassStabilizer;\n        }\n        else\n        {\n            OnePassStabilizer *onePassStabilizer= new OnePassStabilizer();\n            if (motionFilter)\n                onePassStabilizer->setMotionFilter(motionFilter);\n            stabilizer = onePassStabilizer;\n        }\n\n        string inputPath = cmd.get<string>(\"1\");\n        if (inputPath.empty())\n            throw runtime_error(\"specify video file path\");\n\n        VideoFileSource *frameSource = new VideoFileSource(inputPath);\n        outputFps = frameSource->fps();\n        stabilizer->setFrameSource(frameSource);\n        cout << \"frame count: \" << frameSource->frameCount() << endl;\n\n        PyrLkRobustMotionEstimator *motionEstimator = new PyrLkRobustMotionEstimator();\n        if (cmd.get<string>(\"model\") == \"transl\")\n            motionEstimator->setMotionModel(TRANSLATION);\n        else if (cmd.get<string>(\"model\") == \"transl_and_scale\")\n            motionEstimator->setMotionModel(TRANSLATION_AND_SCALE);\n        else if (cmd.get<string>(\"model\") == \"linear_sim\")\n            motionEstimator->setMotionModel(LINEAR_SIMILARITY);\n        else if (cmd.get<string>(\"model\") == \"affine\")\n            motionEstimator->setMotionModel(AFFINE);\n        else if (!cmd.get<string>(\"model\").empty())\n            throw runtime_error(\"unknow motion mode: \" + cmd.get<string>(\"model\"));\n        if (!cmd.get<string>(\"outlier-ratio\").empty())\n        {\n            RansacParams ransacParams = motionEstimator->ransacParams();\n            ransacParams.eps = cmd.get<float>(\"outlier-ratio\");\n            motionEstimator->setRansacParams(ransacParams);\n        }\n        if (!cmd.get<string>(\"min-inlier-ratio\").empty())\n            motionEstimator->setMinInlierRatio(cmd.get<float>(\"min-inlier-ratio\"));\n        stabilizer->setMotionEstimator(motionEstimator);\n        if (!cmd.get<string>(\"load-motions\").empty())\n            stabilizer->setMotionEstimator(new GlobalMotionReader(cmd.get<string>(\"load-motions\")));\n\n        if (!cmd.get<string>(\"radius\").empty())\n            stabilizer->setRadius(cmd.get<int>(\"radius\"));\n\n        if (cmd.get<string>(\"deblur\") == \"yes\")\n        {\n            WeightingDeblurer *deblurer = new WeightingDeblurer();\n            if (!cmd.get<string>(\"deblur-sens\").empty())\n                deblurer->setSensitivity(cmd.get<float>(\"deblur-sens\"));\n            stabilizer->setDeblurer(deblurer);\n        }\n\n        if (!cmd.get<string>(\"trim-ratio\").empty())\n            stabilizer->setTrimRatio(cmd.get<float>(\"trim-ratio\"));\n\n        if (!cmd.get<string>(\"incl-constr\").empty())\n            stabilizer->setCorrectionForInclusion(cmd.get<string>(\"incl-constr\") == \"yes\");\n\n        if (cmd.get<string>(\"border-mode\") == \"reflect\")\n            stabilizer->setBorderMode(BORDER_REFLECT);\n        else if (cmd.get<string>(\"border-mode\") == \"replicate\")\n            stabilizer->setBorderMode(BORDER_REPLICATE);\n        else if (cmd.get<string>(\"border-mode\") == \"const\")\n            stabilizer->setBorderMode(BORDER_CONSTANT);\n        else if (!cmd.get<string>(\"border-mode\").empty())\n            throw runtime_error(\"unknown border extrapolation mode: \" + cmd.get<string>(\"border-mode\"));\n\n        InpaintingPipeline *inpainters = new InpaintingPipeline();\n        if (cmd.get<string>(\"mosaic\") == \"yes\")\n        {\n            ConsistentMosaicInpainter *inpainter = new ConsistentMosaicInpainter();\n            if (!cmd.get<string>(\"mosaic-stdev\").empty())\n                inpainter->setStdevThresh(cmd.get<float>(\"mosaic-stdev\"));\n            inpainters->pushBack(inpainter);\n        }\n        if (cmd.get<string>(\"motion-inpaint\") == \"yes\")\n        {\n            MotionInpainter *inpainter = new MotionInpainter();\n            if (!cmd.get<string>(\"dist-thresh\").empty())\n                inpainter->setDistThreshold(cmd.get<float>(\"dist-thresh\"));\n            inpainters->pushBack(inpainter);\n        }\n        if (!cmd.get<string>(\"color-inpaint\").empty())\n        {\n            if (cmd.get<string>(\"color-inpaint\") == \"average\")\n                inpainters->pushBack(new ColorAverageInpainter());\n            else if (!cmd.get<string>(\"color-inpaint-radius\").empty())\n            {\n                float radius = cmd.get<float>(\"color-inpaint-radius\");\n                if (cmd.get<string>(\"color-inpaint\") == \"ns\")\n                    inpainters->pushBack(new ColorInpainter(INPAINT_NS, radius));\n                else if (cmd.get<string>(\"color-inpaint\") == \"telea\")\n                    inpainters->pushBack(new ColorInpainter(INPAINT_TELEA, radius));\n                else if (cmd.get<string>(\"color-inpaint\") != \"no\")\n                    throw runtime_error(\"unknown color inpainting method: \" + cmd.get<string>(\"color-inpaint\"));\n            }\n            else\n            {\n                if (cmd.get<string>(\"color-inpaint\") == \"ns\")\n                    inpainters->pushBack(new ColorInpainter(INPAINT_NS));\n                else if (cmd.get<string>(\"color-inpaint\") == \"telea\")\n                    inpainters->pushBack(new ColorInpainter(INPAINT_TELEA));\n                else if (cmd.get<string>(\"color-inpaint\") != \"no\")\n                    throw runtime_error(\"unknown color inpainting method: \" + cmd.get<string>(\"color-inpaint\"));\n            }\n        }\n        if (!inpainters->empty())\n            stabilizer->setInpainter(inpainters);\n\n        stabilizer->setLog(new LogToStdout());\n\n        outputPath = cmd.get<string>(\"output\") != \"no\" ? cmd.get<string>(\"output\") : \"\";\n\n        if (!cmd.get<string>(\"fps\").empty())\n            outputFps = cmd.get<double>(\"fps\");\n\n        quietMode = cmd.get<bool>(\"quiet\");\n\n        stabilizedFrames = dynamic_cast<IFrameSource*>(stabilizer);\n\n        run();\n    }\n    catch (const exception &e)\n    {\n        cout << \"error: \" << e.what() << endl;\n        stabilizedFrames.release();\n        return -1;\n    }\n    stabilizedFrames.release();\n    return 0;\n}\n<commit_msg>Fix clang build warning<commit_after>#if defined __clang__\n#  pragma GCC diagnostic ignored \"-Wdelete-non-virtual-dtor\"\n#endif\n\n#include <string>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <stdexcept>\n#include \"opencv2\/core\/core.hpp\"\n#include \"opencv2\/video\/video.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/videostab\/videostab.hpp\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace cv::videostab;\n\n\nPtr<IFrameSource> stabilizedFrames;\nstring saveMotionsPath;\ndouble outputFps;\nstring outputPath;\nbool quietMode;\n\nvoid run();\nvoid saveMotionsIfNecessary();\nvoid printHelp();\n\nclass GlobalMotionReader : public IGlobalMotionEstimator\n{\npublic:\n    GlobalMotionReader(string path)\n    {\n        ifstream f(path.c_str());\n        if (!f.is_open())\n            throw runtime_error(\"can't open motions file: \" + path);\n        int size = 0; f >> size;\n        motions_.resize(size);\n        for (int i = 0; i < size; ++i)\n        {\n            Mat_<float> M(3, 3);\n            for (int l = 0; l < 3; ++l)\n                for (int s = 0; s < 3; ++s)\n                    f >> M(l,s);\n            motions_[i] = M;\n        }\n        pos_ = 0;\n    }\n\n    virtual Mat estimate(const Mat &\/*frame0*\/, const Mat &\/*frame1*\/)\n    {\n        if (pos_ >= motions_.size())\n        {\n            stringstream text;\n            text << \"can't load motion between frames \" << pos_ << \" and \" << pos_+1;\n            throw runtime_error(text.str());\n        }\n        return motions_[pos_++];\n    }\n\nprivate:\n    vector<Mat> motions_;\n    size_t pos_;\n};\n\nvoid run()\n{\n    VideoWriter writer;\n    Mat stabilizedFrame;\n\n    while (!(stabilizedFrame = stabilizedFrames->nextFrame()).empty())\n    {\n        if (!saveMotionsPath.empty())\n            saveMotionsIfNecessary();\n        if (!outputPath.empty())\n        {\n            if (!writer.isOpened())\n                writer.open(outputPath, CV_FOURCC('X','V','I','D'), outputFps, stabilizedFrame.size());\n            writer << stabilizedFrame;\n        }\n        if (!quietMode)\n        {\n            imshow(\"stabilizedFrame\", stabilizedFrame);\n            char key = static_cast<char>(waitKey(3));\n            if (key == 27)\n                break;\n        }\n    }\n\n    cout << \"\\nfinished\\n\";\n}\n\n\nvoid saveMotionsIfNecessary()\n{\n    static bool areMotionsSaved = false;\n    if (!areMotionsSaved)\n    {\n        IFrameSource *frameSource = static_cast<IFrameSource*>(stabilizedFrames);\n        TwoPassStabilizer *twoPassStabilizer = dynamic_cast<TwoPassStabilizer*>(frameSource);\n        if (twoPassStabilizer)\n        {\n            ofstream f(saveMotionsPath.c_str());\n            const vector<Mat> &motions = twoPassStabilizer->motions();\n            f << motions.size() << endl;\n            for (size_t i = 0; i < motions.size(); ++i)\n            {\n                Mat_<float> M = motions[i];\n                for (int l = 0, k = 0; l < 3; ++l)\n                    for (int s = 0; s < 3; ++s, ++k)\n                        f << M(l,s) << \" \";\n                f << endl;\n            }\n        }\n        areMotionsSaved = true;\n        cout << \"motions are saved\";\n    }\n}\n\n\nvoid printHelp()\n{\n    cout << \"OpenCV video stabilizer.\\n\"\n            \"Usage: videostab <file_path> [arguments]\\n\\n\"\n            \"Arguments:\\n\"\n            \"  -m, --model=(transl|transl_and_scale|linear_sim|affine)\\n\"\n            \"      Set motion model. The default is affine.\\n\"\n            \"  --outlier-ratio=<float_number>\\n\"\n            \"      Outliers ratio in motion estimation. The default is 0.5.\\n\"\n            \"  --min-inlier-ratio=<float_number>\\n\"\n            \"      Minimum inlier ratio to decide if estimated motion is OK. The default is 0.1,\\n\"\n            \"      but you may want to increase it.\\n\\n\"\n            \"  --save-motions=<file_path>\\n\"\n            \"      Save estimated motions into file.\\n\"\n            \"  --load-motions=<file_path>\\n\"\n            \"      Load motions from file.\\n\\n\"\n            \"  -r, --radius=<int_number>\\n\"\n            \"      Set smoothing radius. The default is 15.\\n\"\n            \"  --stdev=<float_number>\\n\"\n            \"      Set smoothing weights standard deviation. The default is sqrt(radius).\\n\\n\"\n            \"  --deblur=(yes|no)\\n\"\n            \"      Do deblurring.\\n\"\n            \"  --deblur-sens=<float_number>\\n\"\n            \"      Set deblurring sensitivity (from 0 to +inf). The default is 0.1.\\n\\n\"\n            \"  -t, --trim-ratio=<float_number>\\n\"\n            \"      Set trimming ratio (from 0 to 0.5). The default is 0.0.\\n\"\n            \"  --est-trim=(yes|no)\\n\"\n            \"      Estimate trim ratio automatically. The default is yes (that leads to two passes,\\n\"\n            \"      you can turn it off if you want to use one pass only).\\n\"\n            \"  --incl-constr=(yes|no)\\n\"\n            \"      Ensure the inclusion constraint is always satisfied. The default is no.\\n\\n\"\n            \"  --border-mode=(replicate|reflect|const)\\n\"\n            \"      Set border extrapolation mode. The default is replicate.\\n\\n\"\n            \"  --mosaic=(yes|no)\\n\"\n            \"      Do consistent mosaicing. The default is no.\\n\"\n            \"  --mosaic-stdev=<float_number>\\n\"\n            \"      Consistent mosaicing stdev threshold. The default is 10.0.\\n\\n\"\n            \"  --motion-inpaint=(yes|no)\\n\"\n            \"      Do motion inpainting (requires GPU support). The default is no.\\n\"\n            \"  --dist-thresh=<float_number>\\n\"\n            \"      Estimated flow distance threshold for motion inpainting. The default is 5.0.\\n\\n\"\n            \"  --color-inpaint=(no|average|ns|telea)\\n\"\n            \"      Do color inpainting. The defailt is no.\\n\"\n            \"  --color-inpaint-radius=<float_number>\\n\"\n            \"      Set color inpainting radius (for ns and telea options only).\\n\\n\"\n            \"  -o, --output=(no|<file_path>)\\n\"\n            \"      Set output file path explicitely. The default is stabilized.avi.\\n\"\n            \"  --fps=<int_number>\\n\"\n            \"      Set output video FPS explicitely. By default the source FPS is used.\\n\"\n            \"  -q, --quiet\\n\"\n            \"      Don't show output video frames.\\n\\n\"\n            \"  -h, --help\\n\"\n            \"      Print help.\\n\"\n            \"\\n\";\n}\n\n\nint main(int argc, const char **argv)\n{\n    try\n    {\n        const char *keys =\n                \"{ 1 | | | | }\"\n                \"{ m | model | | }\"\n                \"{ | min-inlier-ratio | | }\"\n                \"{ | outlier-ratio | | }\"\n                \"{ | save-motions | | }\"\n                \"{ | load-motions | | }\"\n                \"{ r | radius | | }\"\n                \"{ | stdev | | }\"\n                \"{ | deblur | | }\"\n                \"{ | deblur-sens | | }\"\n                \"{ | est-trim | yes | }\"\n                \"{ t | trim-ratio | | }\"\n                \"{ | incl-constr | | }\"\n                \"{ | border-mode | | }\"\n                \"{ | mosaic | | }\"\n                \"{ | mosaic-stdev | | }\"\n                \"{ | motion-inpaint | | }\"\n                \"{ | dist-thresh | | }\"\n                \"{ | color-inpaint | no | }\"\n                \"{ | color-inpaint-radius | | }\"\n                \"{ o | output | stabilized.avi | }\"\n                \"{ | fps | | }\"\n                \"{ q | quiet | false | }\"\n                \"{ h | help | false | }\";\n        CommandLineParser cmd(argc, argv, keys);\n\n        \/\/ parse command arguments\n\n        if (cmd.get<bool>(\"help\"))\n        {\n            printHelp();\n            return 0;\n        }\n\n        StabilizerBase *stabilizer;\n        GaussianMotionFilter *motionFilter = 0;\n\n        if (!cmd.get<string>(\"stdev\").empty())\n        {\n            motionFilter = new GaussianMotionFilter();\n            motionFilter->setStdev(cmd.get<float>(\"stdev\"));\n        }\n\n        if (!cmd.get<string>(\"save-motions\").empty())\n            saveMotionsPath = cmd.get<string>(\"save-motions\");\n\n        bool isTwoPass =\n                cmd.get<string>(\"est-trim\") == \"yes\" ||\n                !cmd.get<string>(\"save-motions\").empty();\n\n        if (isTwoPass)\n        {\n            TwoPassStabilizer *twoPassStabilizer = new TwoPassStabilizer();\n            if (!cmd.get<string>(\"est-trim\").empty())\n                twoPassStabilizer->setEstimateTrimRatio(cmd.get<string>(\"est-trim\") == \"yes\");\n            if (motionFilter)\n                twoPassStabilizer->setMotionStabilizer(motionFilter);\n            stabilizer = twoPassStabilizer;\n        }\n        else\n        {\n            OnePassStabilizer *onePassStabilizer= new OnePassStabilizer();\n            if (motionFilter)\n                onePassStabilizer->setMotionFilter(motionFilter);\n            stabilizer = onePassStabilizer;\n        }\n\n        string inputPath = cmd.get<string>(\"1\");\n        if (inputPath.empty())\n            throw runtime_error(\"specify video file path\");\n\n        VideoFileSource *frameSource = new VideoFileSource(inputPath);\n        outputFps = frameSource->fps();\n        stabilizer->setFrameSource(frameSource);\n        cout << \"frame count: \" << frameSource->frameCount() << endl;\n\n        PyrLkRobustMotionEstimator *motionEstimator = new PyrLkRobustMotionEstimator();\n        if (cmd.get<string>(\"model\") == \"transl\")\n            motionEstimator->setMotionModel(TRANSLATION);\n        else if (cmd.get<string>(\"model\") == \"transl_and_scale\")\n            motionEstimator->setMotionModel(TRANSLATION_AND_SCALE);\n        else if (cmd.get<string>(\"model\") == \"linear_sim\")\n            motionEstimator->setMotionModel(LINEAR_SIMILARITY);\n        else if (cmd.get<string>(\"model\") == \"affine\")\n            motionEstimator->setMotionModel(AFFINE);\n        else if (!cmd.get<string>(\"model\").empty())\n            throw runtime_error(\"unknow motion mode: \" + cmd.get<string>(\"model\"));\n        if (!cmd.get<string>(\"outlier-ratio\").empty())\n        {\n            RansacParams ransacParams = motionEstimator->ransacParams();\n            ransacParams.eps = cmd.get<float>(\"outlier-ratio\");\n            motionEstimator->setRansacParams(ransacParams);\n        }\n        if (!cmd.get<string>(\"min-inlier-ratio\").empty())\n            motionEstimator->setMinInlierRatio(cmd.get<float>(\"min-inlier-ratio\"));\n        stabilizer->setMotionEstimator(motionEstimator);\n        if (!cmd.get<string>(\"load-motions\").empty())\n            stabilizer->setMotionEstimator(new GlobalMotionReader(cmd.get<string>(\"load-motions\")));\n\n        if (!cmd.get<string>(\"radius\").empty())\n            stabilizer->setRadius(cmd.get<int>(\"radius\"));\n\n        if (cmd.get<string>(\"deblur\") == \"yes\")\n        {\n            WeightingDeblurer *deblurer = new WeightingDeblurer();\n            if (!cmd.get<string>(\"deblur-sens\").empty())\n                deblurer->setSensitivity(cmd.get<float>(\"deblur-sens\"));\n            stabilizer->setDeblurer(deblurer);\n        }\n\n        if (!cmd.get<string>(\"trim-ratio\").empty())\n            stabilizer->setTrimRatio(cmd.get<float>(\"trim-ratio\"));\n\n        if (!cmd.get<string>(\"incl-constr\").empty())\n            stabilizer->setCorrectionForInclusion(cmd.get<string>(\"incl-constr\") == \"yes\");\n\n        if (cmd.get<string>(\"border-mode\") == \"reflect\")\n            stabilizer->setBorderMode(BORDER_REFLECT);\n        else if (cmd.get<string>(\"border-mode\") == \"replicate\")\n            stabilizer->setBorderMode(BORDER_REPLICATE);\n        else if (cmd.get<string>(\"border-mode\") == \"const\")\n            stabilizer->setBorderMode(BORDER_CONSTANT);\n        else if (!cmd.get<string>(\"border-mode\").empty())\n            throw runtime_error(\"unknown border extrapolation mode: \" + cmd.get<string>(\"border-mode\"));\n\n        InpaintingPipeline *inpainters = new InpaintingPipeline();\n        if (cmd.get<string>(\"mosaic\") == \"yes\")\n        {\n            ConsistentMosaicInpainter *inpainter = new ConsistentMosaicInpainter();\n            if (!cmd.get<string>(\"mosaic-stdev\").empty())\n                inpainter->setStdevThresh(cmd.get<float>(\"mosaic-stdev\"));\n            inpainters->pushBack(inpainter);\n        }\n        if (cmd.get<string>(\"motion-inpaint\") == \"yes\")\n        {\n            MotionInpainter *inpainter = new MotionInpainter();\n            if (!cmd.get<string>(\"dist-thresh\").empty())\n                inpainter->setDistThreshold(cmd.get<float>(\"dist-thresh\"));\n            inpainters->pushBack(inpainter);\n        }\n        if (!cmd.get<string>(\"color-inpaint\").empty())\n        {\n            if (cmd.get<string>(\"color-inpaint\") == \"average\")\n                inpainters->pushBack(new ColorAverageInpainter());\n            else if (!cmd.get<string>(\"color-inpaint-radius\").empty())\n            {\n                float radius = cmd.get<float>(\"color-inpaint-radius\");\n                if (cmd.get<string>(\"color-inpaint\") == \"ns\")\n                    inpainters->pushBack(new ColorInpainter(INPAINT_NS, radius));\n                else if (cmd.get<string>(\"color-inpaint\") == \"telea\")\n                    inpainters->pushBack(new ColorInpainter(INPAINT_TELEA, radius));\n                else if (cmd.get<string>(\"color-inpaint\") != \"no\")\n                    throw runtime_error(\"unknown color inpainting method: \" + cmd.get<string>(\"color-inpaint\"));\n            }\n            else\n            {\n                if (cmd.get<string>(\"color-inpaint\") == \"ns\")\n                    inpainters->pushBack(new ColorInpainter(INPAINT_NS));\n                else if (cmd.get<string>(\"color-inpaint\") == \"telea\")\n                    inpainters->pushBack(new ColorInpainter(INPAINT_TELEA));\n                else if (cmd.get<string>(\"color-inpaint\") != \"no\")\n                    throw runtime_error(\"unknown color inpainting method: \" + cmd.get<string>(\"color-inpaint\"));\n            }\n        }\n        if (!inpainters->empty())\n            stabilizer->setInpainter(inpainters);\n\n        stabilizer->setLog(new LogToStdout());\n\n        outputPath = cmd.get<string>(\"output\") != \"no\" ? cmd.get<string>(\"output\") : \"\";\n\n        if (!cmd.get<string>(\"fps\").empty())\n            outputFps = cmd.get<double>(\"fps\");\n\n        quietMode = cmd.get<bool>(\"quiet\");\n\n        stabilizedFrames = dynamic_cast<IFrameSource*>(stabilizer);\n\n        run();\n    }\n    catch (const exception &e)\n    {\n        cout << \"error: \" << e.what() << endl;\n        stabilizedFrames.release();\n        return -1;\n    }\n    stabilizedFrames.release();\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"Pkcstest.hpp\"\n#include <Cryptoki.h>\n#include <CryptokiException.h>\n\nusing namespace objck;\nclass Cryptoki_Test : public ::testing::Test {\n\nprotected :\n\n\tstatic CK_LAMBDA_FUNCTION_LIST* pkcs11;\n\n\tstatic void SetUpTestCase() {\n\t\tpkcs11 = pkcstest::getMocker();\n\t}\n\n\tstatic void TearDownTestCase() {}\n\n\tvoid SetUp()\n\t{\n\t\tpkcstest::setUpMockerFunctions(pkcs11);\n\t}\n};\n\nCK_LAMBDA_FUNCTION_LIST* Cryptoki_Test::pkcs11 = NULL; \n\nTEST_F(Cryptoki_Test, Finalize_should_be_called_on_destructor) {\n\tbool called = false;\n\tpkcs11->C_Finalize = [&](void* ptr) -> CK_RV {\n\t\tcalled = true;\n\t\treturn CKR_OK;\n\t};\t\n\n\t{Cryptoki p11module(\"\/tmp\/pkcs11mocked.so\");}\n\tEXPECT_TRUE(called);\n}\n\nTEST_F(Cryptoki_Test, Initialize_OK)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\t\n\tbool called = false;\n\tpkcs11->C_Initialize = [&](void* ptr) -> CK_RV {\n\t\tcalled = true;\n\t\treturn CKR_OK;\n\t};\t\n\n\tEXPECT_NO_THROW(p11module.initialize());\n\tEXPECT_TRUE(called);\n}\n\nTEST_F(Cryptoki_Test, Initialize_Failed_causes_exception)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\t\t\n\tpkcs11->C_Initialize = [&](void* ptr) {\n\t\treturn CKR_GENERAL_ERROR;\n\t};\t\n\n\ttry {\n\t\tp11module.initialize();\n\t\tEXPECT_TRUE(false);\n\t} catch (CryptokiException& e) {\n\t\tEXPECT_EQ(e.getErrorCode(), CKR_GENERAL_ERROR);\n\t}\n}\n\nTEST_F(Cryptoki_Test, getInfo)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n\tpkcs11->C_GetInfo = [&](CK_INFO *info) -> CK_RV {\n\t\tinfo->cryptokiVersion.major = 6;\n\t\tinfo->cryptokiVersion.minor = 7;\n\t\tinfo->flags = 0;\n\t\tinfo->libraryVersion.major = 12;\n\t\tinfo->libraryVersion.minor = 13;\n\n\t\treturn CKR_OK;\n\t};\n\n\tInfo info;\n\tinfo = p11module.getInfo();\n\n\tASSERT_EQ(info.majorVersion(),6);\n\tASSERT_EQ(info.minorVersion(),7);\n\tASSERT_EQ(info.flags(), Info::EMPTY); \n\tASSERT_EQ(info.libraryMajorVersion(),12);\n\tASSERT_EQ(info.libraryMinorVersion(),13);\n}\n\nTEST_F(Cryptoki_Test, getInfo_error)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n\tpkcs11->C_GetInfo = [&](CK_INFO *info) -> CK_RV {\n\n\t\treturn CKR_GENERAL_ERROR;\n\t};\n\n\ttry {\n\t\tp11module.getInfo();\n\t\tEXPECT_TRUE(false);\n\t} catch (CryptokiException& e) {\n\t\tEXPECT_EQ(e.getErrorCode(), CKR_GENERAL_ERROR);\n\t}\n}\n\nTEST_F(Cryptoki_Test, getFunctionList)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n  \tbool called = false;\n\tpkcs11->C_Initialize = [&](void* ptr) -> CK_RV {\n\t\tEXPECT_EQ(ptr, (void*)0x123456);\n\t\tcalled = true;\n\t\treturn CKR_OK;\n\t};\n\n\tFunctionList test = p11module.getFunctionList();\n\t\t\n\tEXPECT_NO_THROW({\n\t\tCK_RV rv = (*test.C_Initialize)((void*)0x123456);\n\t\tEXPECT_EQ(rv, CKR_OK);\n\t});\n\tEXPECT_TRUE(called);\n}\n\nTEST_F(Cryptoki_Test, initToken) {\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n\tbool called = false;\n\tstd::string pin = \"123456\";\n\tstd::string label = \"test\";\n\n\tpkcs11->C_InitToken = [&](CK_SLOT_ID slot_id, unsigned char *pin, \n\t\tunsigned long pin_len, unsigned char *label) -> CK_RV {\n\t\tcalled = true;\n\t\t\/\/TODO(perin): compare strings?\n\t\treturn CKR_OK;\n\t};\n\n\tEXPECT_NO_THROW(p11module.initToken(0, pin, label));\n\tEXPECT_TRUE(called);\n}\n\nTEST_F(Cryptoki_Test, initToken_Failed_causes_exception) {\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n\tbool called = false;\n\n\tpkcs11->C_InitToken = [&](CK_SLOT_ID slot_id, unsigned char *pin, \n\t\tunsigned long pin_len, unsigned char *label) -> CK_RV {\n\t\tcalled = true;\n\t\treturn CKR_GENERAL_ERROR;\n\t};\n\n\tstd::string pin = \"123456\";\n\tstd::string label = \"test\";\n\ttry {\n\t\tp11module.initToken(0, pin, label);\n\t\tEXPECT_TRUE(false);\n\t} catch (CryptokiException& e) {\n\t\tEXPECT_EQ(e.getErrorCode(), CKR_GENERAL_ERROR);\n\t}\n\tEXPECT_TRUE(called);\n}\n<commit_msg>Adding missing tests for Info<commit_after>#include \"gtest\/gtest.h\"\n#include \"Pkcstest.hpp\"\n#include <Cryptoki.h>\n#include <CryptokiException.h>\n\nusing namespace objck;\nclass Cryptoki_Test : public ::testing::Test {\n\nprotected :\n\n\tstatic CK_LAMBDA_FUNCTION_LIST* pkcs11;\n\n\tstatic void SetUpTestCase() {\n\t\tpkcs11 = pkcstest::getMocker();\n\t}\n\n\tstatic void TearDownTestCase() {}\n\n\tvoid SetUp()\n\t{\n\t\tpkcstest::setUpMockerFunctions(pkcs11);\n\t}\n};\n\nCK_LAMBDA_FUNCTION_LIST* Cryptoki_Test::pkcs11 = NULL; \n\nTEST_F(Cryptoki_Test, Finalize_should_be_called_on_destructor) {\n\tbool called = false;\n\tpkcs11->C_Finalize = [&](void* ptr) -> CK_RV {\n\t\tcalled = true;\n\t\treturn CKR_OK;\n\t};\t\n\n\t{Cryptoki p11module(\"\/tmp\/pkcs11mocked.so\");}\n\tEXPECT_TRUE(called);\n}\n\nTEST_F(Cryptoki_Test, Initialize_OK)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\t\n\tbool called = false;\n\tpkcs11->C_Initialize = [&](void* ptr) -> CK_RV {\n\t\tcalled = true;\n\t\treturn CKR_OK;\n\t};\t\n\n\tEXPECT_NO_THROW(p11module.initialize());\n\tEXPECT_TRUE(called);\n}\n\nTEST_F(Cryptoki_Test, Initialize_Failed_causes_exception)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\t\t\n\tpkcs11->C_Initialize = [&](void* ptr) {\n\t\treturn CKR_GENERAL_ERROR;\n\t};\t\n\n\ttry {\n\t\tp11module.initialize();\n\t\tEXPECT_TRUE(false);\n\t} catch (CryptokiException& e) {\n\t\tEXPECT_EQ(e.getErrorCode(), CKR_GENERAL_ERROR);\n\t}\n}\n\nTEST_F(Cryptoki_Test, getInfo)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n\tpkcs11->C_GetInfo = [&](CK_INFO *info) -> CK_RV {\n\t\tinfo->cryptokiVersion.major = 6;\n\t\tinfo->cryptokiVersion.minor = 7;\n\t\tinfo->flags = 0;\n\t\tinfo->libraryVersion.major = 12;\n\t\tinfo->libraryVersion.minor = 13;\n\t\tmemcpy(info->manufacturerID, \"Perinovsky                      \", 32);\n\t\tmemcpy(info->libraryDescription, \"Claud Computing                 \", 32);\n\t\treturn CKR_OK;\n\t};\n\n\tInfo info;\n\tinfo = p11module.getInfo();\n\n\tASSERT_EQ(info.majorVersion(),6);\n\tASSERT_EQ(info.minorVersion(),7);\n\tASSERT_EQ(info.version(),\"6.7\");\n\tASSERT_EQ(info.manufacturerId(), \"Perinovsky                      \");\n\tASSERT_EQ(info.libraryDescription(), \"Claud Computing                 \");\n\tASSERT_EQ(info.flags(), Info::EMPTY); \n\tASSERT_EQ(info.libraryMajorVersion(),12);\n\tASSERT_EQ(info.libraryMinorVersion(),13);\n\tASSERT_EQ(info.libraryVersion(),\"12.13\");\n\n\tCK_INFO recoveredStruct = info.getInfo();\n\tASSERT_EQ(recoveredStruct.cryptokiVersion.major, 6);\n\tASSERT_EQ(recoveredStruct.cryptokiVersion.minor, 7);\n\tASSERT_EQ(recoveredStruct.flags, 0);\n\tASSERT_EQ(recoveredStruct.libraryVersion.major, 12);\n\tASSERT_EQ(recoveredStruct.libraryVersion.minor, 13);\n\tASSERT_FALSE(memcmp(recoveredStruct.manufacturerID, \"Perinovsky                      \", 32));\n\tASSERT_FALSE(memcmp(recoveredStruct.libraryDescription, \"Claud Computing                 \", 32));\n}\n\nTEST_F(Cryptoki_Test, getInfo_error)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n\tpkcs11->C_GetInfo = [&](CK_INFO *info) -> CK_RV {\n\n\t\treturn CKR_GENERAL_ERROR;\n\t};\n\n\ttry {\n\t\tp11module.getInfo();\n\t\tEXPECT_TRUE(false);\n\t} catch (CryptokiException& e) {\n\t\tEXPECT_EQ(e.getErrorCode(), CKR_GENERAL_ERROR);\n\t}\n}\n\nTEST_F(Cryptoki_Test, getFunctionList)\n{\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n  \tbool called = false;\n\tpkcs11->C_Initialize = [&](void* ptr) -> CK_RV {\n\t\tEXPECT_EQ(ptr, (void*)0x123456);\n\t\tcalled = true;\n\t\treturn CKR_OK;\n\t};\n\n\tFunctionList test = p11module.getFunctionList();\n\t\t\n\tEXPECT_NO_THROW({\n\t\tCK_RV rv = (*test.C_Initialize)((void*)0x123456);\n\t\tEXPECT_EQ(rv, CKR_OK);\n\t});\n\tEXPECT_TRUE(called);\n}\n\nTEST_F(Cryptoki_Test, initToken) {\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n\tbool called = false;\n\tstd::string pin = \"123456\";\n\tstd::string label = \"test\";\n\n\tpkcs11->C_InitToken = [&](CK_SLOT_ID slot_id, unsigned char *pin, \n\t\tunsigned long pin_len, unsigned char *label) -> CK_RV {\n\t\tcalled = true;\n\t\t\/\/TODO(perin): compare strings?\n\t\treturn CKR_OK;\n\t};\n\n\tEXPECT_NO_THROW(p11module.initToken(0, pin, label));\n\tEXPECT_TRUE(called);\n}\n\nTEST_F(Cryptoki_Test, initToken_Failed_causes_exception) {\n\tCryptoki p11module(\"\/tmp\/pkcs11mocked.so\");\n\n\tbool called = false;\n\n\tpkcs11->C_InitToken = [&](CK_SLOT_ID slot_id, unsigned char *pin, \n\t\tunsigned long pin_len, unsigned char *label) -> CK_RV {\n\t\tcalled = true;\n\t\treturn CKR_GENERAL_ERROR;\n\t};\n\n\tstd::string pin = \"123456\";\n\tstd::string label = \"test\";\n\ttry {\n\t\tp11module.initToken(0, pin, label);\n\t\tEXPECT_TRUE(false);\n\t} catch (CryptokiException& e) {\n\t\tEXPECT_EQ(e.getErrorCode(), CKR_GENERAL_ERROR);\n\t}\n\tEXPECT_TRUE(called);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\r\n*\r\n* NAME: smbPitchShift.cpp\r\n* VERSION: 1.2\r\n* HOME URL: http:\/\/blogs.zynaptiq.com\/bernsee\r\n* KNOWN BUGS: none\r\n*\r\n* SYNOPSIS: Routine for doing pitch shifting while maintaining\r\n* duration using the Short Time Fourier Transform.\r\n*\r\n* DESCRIPTION: The routine takes a pitchShift factor value which is between 0.5\r\n* (one octave down) and 2. (one octave up). A value of exactly 1 does not change\r\n* the pitch. numSampsToProcess tells the routine how many samples in indata[0...\r\n* numSampsToProcess-1] should be pitch shifted and moved to outdata[0 ...\r\n* numSampsToProcess-1]. The two buffers can be identical (ie. it can process the\r\n* data in-place). fftFrameSize defines the FFT frame size used for the\r\n* processing. Typical values are 1024, 2048 and 4096. It MUST be a power of 2.\r\n* oversamp is the STFT oversampling factor which also determines the overlap\r\n* between adjacent STFT frames. It should at least be 4 for moderate scaling\r\n* ratios. A value of 32 is recommended for best quality. sampleRate takes the\r\n* sample rate for the signal in unit Hz, ie. 44100 for 44.1 kHz audio. The data\r\n* passed to the routine in indata[] should be in the range [-1.0, 1.0), which is\r\n* also the output range for the data, make sure you scale the data accordingly\r\n* (for 16bit signed integers you would have to divide (and multiply) by 32768).\r\n*\r\n* COPYRIGHT 1999-2015 Stephan M. Bernsee <s.bernsee [AT] zynaptiq [DOT] com>\r\n*\r\n* \t\t\t\t\t\tThe Wide Open License (WOL)\r\n*\r\n* Permission to use, copy, modify, distribute and sell this software and its\r\n* documentation for any purpose is hereby granted without fee, provided that\r\n* the above copyright notice and this license appear in all source copies. \r\n* THIS SOFTWARE IS PROVIDED \"AS IS\" WITHOUT EXPRESS OR IMPLIED WARRANTY OF\r\n* ANY KIND. See http:\/\/www.dspguru.com\/wol.htm for more information.\r\n*\r\n*****************************************************************************\/\r\n\r\n#ifndef SMBPITCHSHIFT_HPP\r\n#define SMBPITCHSHIFT_HPP\r\n\r\n#include <algorithm>\r\n#include <cmath>\r\n#include <cstdint>\r\n\r\nnamespace smb\r\n{\r\n    namespace\r\n    {\r\n        constexpr float pi = 3.14159265358979323846F;\r\n\r\n        \/\/ Use own implementation because std::complex has a poor performance\r\n        template <class T>\r\n        struct Complex final\r\n        {\r\n            constexpr Complex<T> operator+(const Complex& other) const noexcept\r\n            {\r\n                return Complex{real + other.real, imag + other.imag};\r\n            }\r\n\r\n            constexpr Complex<T>& operator+=(const Complex& other)\r\n            {\r\n                real += other.real;\r\n                imag += other.imag;\r\n                return *this;\r\n            }\r\n\r\n            constexpr Complex<T> operator-(const Complex& other) const noexcept\r\n            {\r\n                return Complex{real - other.real, imag - other.imag};\r\n            }\r\n\r\n            constexpr Complex<T> operator-() const noexcept\r\n            {\r\n                return Complex{-real, -imag};\r\n            }\r\n\r\n            constexpr Complex<T>& operator-=(const Complex& other) noexcept\r\n            {\r\n                real -= other.real;\r\n                imag -= other.imag;\r\n                return *this;\r\n            }\r\n\r\n            constexpr Complex<T> operator*(const Complex& other) const noexcept\r\n            {\r\n                return Complex{real * other.real - imag * other.imag, real * other.imag + imag * other.real};\r\n            }\r\n\r\n            constexpr Complex<T>& operator*=(const Complex& other) noexcept\r\n            {\r\n                float tempReal = real;\r\n                real = tempReal * other.real - imag * other.imag;\r\n                imag = tempReal * other.imag + imag * other.real;\r\n                return *this;\r\n            }\r\n\r\n            inline T magnitude() const noexcept\r\n            {\r\n                return sqrt(real * real + imag * imag);\r\n            }\r\n\r\n            T real;\r\n            T imag;\r\n        };\r\n\r\n        template <int32_t sign, uint32_t fftFrameSize>\r\n        void fft(Complex<float>* fftBuffer) noexcept\r\n        {\r\n            \/\/ Bit-reversal permutation applied to a sequence of fftFrameSize items\r\n            for (uint32_t i = 1; i < fftFrameSize - 1; ++i)\r\n            {\r\n                uint32_t j = 0;\r\n\r\n                for (uint32_t bitm = 1; bitm < fftFrameSize; bitm <<= 1)\r\n                {\r\n                    if (i & bitm) ++j;\r\n                    j <<= 1;\r\n                }\r\n                j >>= 1;\r\n\r\n                if (i < j)\r\n                    std::swap(fftBuffer[i], fftBuffer[j]);\r\n            }\r\n\r\n            \/\/ Iterative form of Danielson–-Lanczos lemma\r\n            uint32_t step = 2;\r\n            for (uint32_t i = 1; i < fftFrameSize; i <<= 1, step <<= 1)\r\n            {\r\n                const uint32_t step2 = step >> 1;\r\n                const float arg = pi \/ step2;\r\n\r\n                const Complex<float> w{std::cos(arg), std::sin(arg) * sign};\r\n                Complex<float> u{1.0F, 0.0F};\r\n                for (uint32_t j = 0; j < step2; ++j)\r\n                {\r\n                    for (uint32_t k = j; k < fftFrameSize; k += step)\r\n                    {\r\n                        const Complex<float> temp = fftBuffer[k + step2] * u;\r\n                        fftBuffer[k + step2] = fftBuffer[k] - temp;\r\n                        fftBuffer[k] += temp;\r\n                    }\r\n\r\n                    u *= w;\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    template <uint32_t fftFrameSize, uint32_t oversamp>\r\n    class PitchShift final\r\n    {\r\n    public:\r\n        PitchShift()\r\n        {\r\n            \/\/ Hann window\r\n            for (uint32_t k = 0; k < fftFrameSize; ++k)\r\n                window[k] = 0.5F * (1.0F + std::cos(2.0F * pi * static_cast<float>(k) \/ static_cast<float>(fftFrameSize)));\r\n        }\r\n\r\n        \/*\r\n            Routine process(). See top of file for explanation\r\n            Purpose: doing pitch shifting while maintaining duration using the Short\r\n            Time Fourier Transform.\r\n            Author: (c)1999-2015 Stephan M. Bernsee <s.bernsee [AT] zynaptiq [DOT] com>\r\n        *\/\r\n        void process(const float pitchShift, const uint32_t numSampsToProcess,\r\n                     const uint32_t sampleRate, const float* indata, float* outdata) noexcept\r\n        {\r\n            \/\/ set up some handy variables\r\n            const uint32_t fftFrameSizeHalf = fftFrameSize \/ 2;\r\n            const uint32_t stepSize = fftFrameSize \/ oversamp;\r\n            const float freqPerBin = static_cast<float>(sampleRate) \/ static_cast<float>(fftFrameSize);\r\n            const float expected = 2.0F * pi * static_cast<float>(stepSize) \/ static_cast<float>(fftFrameSize);\r\n            const uint32_t inFifoLatency = fftFrameSize - stepSize;\r\n            if (rover == 0) rover = inFifoLatency;\r\n\r\n            \/\/ main processing loop\r\n            for (uint32_t i = 0; i < numSampsToProcess; ++i)\r\n            {\r\n                \/\/ As long as we have not yet collected enough data just read in\r\n                inFifo[rover] = indata[i];\r\n                outdata[i] = outFifo[rover - inFifoLatency];\r\n                ++rover;\r\n\r\n                \/\/ now we have enough data for processing\r\n                if (rover >= fftFrameSize)\r\n                {\r\n                    rover = inFifoLatency;\r\n\r\n                    \/\/ do windowing\r\n                    for (uint32_t k = 0; k < fftFrameSize; ++k)\r\n                        fftWorksp[k] = { inFifo[k] * window[k], 0.0F };\r\n\r\n                    \/\/ ***************** ANALYSIS *******************\r\n                    \/\/ do transform\r\n                    fft<-1, fftFrameSize>(fftWorksp);\r\n\r\n                    \/\/ this is the analysis step\r\n                    for (uint32_t k = 0; k < fftFrameSizeHalf + 1; ++k)\r\n                    {\r\n                        const Complex<float>& current = fftWorksp[k];\r\n\r\n                        \/\/ compute magnitude and phase\r\n                        const float magn = 2.0F * current.magnitude();\r\n                        const float signx = (current.imag > 0.0F) ? 1.0F : -1.0F;\r\n                        const float phase = (current.imag == 0.0F) ? 0.0F :\r\n                            (current.real == 0.0F) ? signx * pi \/ 2.0F :\r\n                            std::atan2(current.imag, current.real);\r\n\r\n                        \/\/ compute phase difference\r\n                        float tmp = phase - lastPhase[k];\r\n                        lastPhase[k] = phase;\r\n\r\n                        \/\/ subtract expected phase difference\r\n                        tmp -= static_cast<float>(k) * expected;\r\n\r\n                        \/\/ map delta phase into +\/- Pi interval\r\n                        int32_t qpd = static_cast<int32_t>(tmp \/ pi);\r\n                        if (qpd >= 0) qpd += qpd & 1;\r\n                        else qpd -= qpd & 1;\r\n                        tmp -= pi * static_cast<float>(qpd);\r\n\r\n                        \/\/ get deviation from bin frequency from the +\/- Pi interval\r\n                        tmp = oversamp * tmp \/ (2.0F * pi);\r\n\r\n                        \/\/ compute the k-th partials' true frequency\r\n                        tmp = static_cast<float>(k) * freqPerBin + tmp * freqPerBin;\r\n\r\n                        \/\/ store magnitude and true frequency in analysis arrays\r\n                        anaMagn[k] = magn;\r\n                        anaFreq[k] = tmp;\r\n                    }\r\n\r\n                    \/\/ ***************** PROCESSING *******************\r\n                    \/\/ this does the actual pitch shifting\r\n                    std::fill(std::begin(synMagn), std::begin(synMagn) + fftFrameSize, 0.0F);\r\n                    std::fill(std::begin(synFreq), std::begin(synFreq) + fftFrameSize, 0.0F);\r\n                    for (uint32_t k = 0; k < fftFrameSizeHalf + 1; ++k)\r\n                    {\r\n                        const uint32_t index = static_cast<uint32_t>(k * pitchShift);\r\n                        if (index > fftFrameSizeHalf) break;\r\n                        synMagn[index] += anaMagn[k];\r\n                        synFreq[index] = anaFreq[k] * pitchShift;\r\n                    }\r\n\r\n                    \/\/ ***************** SYNTHESIS *******************\r\n                    \/\/ this is the synthesis step\r\n                    for (uint32_t k = 0; k < fftFrameSizeHalf + 1; ++k)\r\n                    {\r\n                        \/\/ get magnitude and true frequency from synthesis arrays\r\n                        const float magn = synMagn[k];\r\n                        float tmp = synFreq[k];\r\n\r\n                        \/\/ subtract bin mid frequency\r\n                        tmp -= static_cast<float>(k) * freqPerBin;\r\n\r\n                        \/\/ get bin deviation from freq deviation\r\n                        tmp \/= freqPerBin;\r\n\r\n                        \/\/ take oversampling factor into account\r\n                        tmp = 2.0F * pi * tmp \/ oversamp;\r\n\r\n                        \/\/ add the overlap phase advance back in\r\n                        tmp += static_cast<float>(k) * expected;\r\n\r\n                        \/\/ accumulate delta phase to get bin phase\r\n                        sumPhase[k] += tmp;\r\n                        const float phase = sumPhase[k];\r\n\r\n                        \/\/ get real and imag part and re-interleave\r\n                        fftWorksp[k] = { magn * std::cos(phase), magn * std::sin(phase) };\r\n                    }\r\n\r\n                    \/\/ zero negative frequencies\r\n                    for (uint32_t k = fftFrameSize + 1; k < fftFrameSize; ++k)\r\n                        fftWorksp[k] = {0.0F, 0.0F};\r\n\r\n                    \/\/ do inverse transform\r\n                    fft<1, fftFrameSize>(fftWorksp);\r\n\r\n                    \/\/ do windowing and add to output accumulator\r\n                    for (uint32_t k = 0; k < fftFrameSize; ++k)\r\n                        outputAccum[k] += 2.0F * window[k] * fftWorksp[k].real \/ (fftFrameSizeHalf * oversamp);\r\n\r\n                    uint32_t k;\r\n                    for (k = 0 ; k < stepSize; ++k)\r\n                        outFifo[k] = outputAccum[k];\r\n                    \/\/ shift accumulator\r\n                    uint32_t j;\r\n                    for (j = 0; k < fftFrameSize; ++k, ++j)\r\n                        outputAccum[j] = outputAccum[k];\r\n                    for (; j < fftFrameSize; ++j)\r\n                        outputAccum[j] = 0.0;\r\n\r\n                    \/\/ move input FIFO\r\n                    for (k = 0; k < inFifoLatency; ++k)\r\n                        inFifo[k] = inFifo[k + stepSize];\r\n                }\r\n            }\r\n        }\r\n\r\n    private:\r\n        float window[fftFrameSize]; \/\/ the windowing function\r\n        float inFifo[fftFrameSize]{0.0F};\r\n        float outFifo[fftFrameSize]{0.0F};\r\n        Complex<float> fftWorksp[fftFrameSize]{{0.0F, 0.0F}};\r\n        float lastPhase[fftFrameSize \/ 2 + 1]{0.0F};\r\n        float sumPhase[fftFrameSize \/ 2 + 1]{0.0F};\r\n        float outputAccum[2 * fftFrameSize]{0.0F};\r\n        float anaFreq[fftFrameSize]{0.0F};\r\n        float anaMagn[fftFrameSize]{0.0F};\r\n        float synFreq[fftFrameSize]{0.0F};\r\n        float synMagn[fftFrameSize]{0.0F};\r\n        uint32_t rover = 0;\r\n    };\r\n}\r\n\r\n#endif\r\n<commit_msg>Make the frame and step sizes constexpr<commit_after>\/****************************************************************************\r\n*\r\n* NAME: smbPitchShift.cpp\r\n* VERSION: 1.2\r\n* HOME URL: http:\/\/blogs.zynaptiq.com\/bernsee\r\n* KNOWN BUGS: none\r\n*\r\n* SYNOPSIS: Routine for doing pitch shifting while maintaining\r\n* duration using the Short Time Fourier Transform.\r\n*\r\n* DESCRIPTION: The routine takes a pitchShift factor value which is between 0.5\r\n* (one octave down) and 2. (one octave up). A value of exactly 1 does not change\r\n* the pitch. numSampsToProcess tells the routine how many samples in indata[0...\r\n* numSampsToProcess-1] should be pitch shifted and moved to outdata[0 ...\r\n* numSampsToProcess-1]. The two buffers can be identical (ie. it can process the\r\n* data in-place). fftFrameSize defines the FFT frame size used for the\r\n* processing. Typical values are 1024, 2048 and 4096. It MUST be a power of 2.\r\n* oversamp is the STFT oversampling factor which also determines the overlap\r\n* between adjacent STFT frames. It should at least be 4 for moderate scaling\r\n* ratios. A value of 32 is recommended for best quality. sampleRate takes the\r\n* sample rate for the signal in unit Hz, ie. 44100 for 44.1 kHz audio. The data\r\n* passed to the routine in indata[] should be in the range [-1.0, 1.0), which is\r\n* also the output range for the data, make sure you scale the data accordingly\r\n* (for 16bit signed integers you would have to divide (and multiply) by 32768).\r\n*\r\n* COPYRIGHT 1999-2015 Stephan M. Bernsee <s.bernsee [AT] zynaptiq [DOT] com>\r\n*\r\n* \t\t\t\t\t\tThe Wide Open License (WOL)\r\n*\r\n* Permission to use, copy, modify, distribute and sell this software and its\r\n* documentation for any purpose is hereby granted without fee, provided that\r\n* the above copyright notice and this license appear in all source copies. \r\n* THIS SOFTWARE IS PROVIDED \"AS IS\" WITHOUT EXPRESS OR IMPLIED WARRANTY OF\r\n* ANY KIND. See http:\/\/www.dspguru.com\/wol.htm for more information.\r\n*\r\n*****************************************************************************\/\r\n\r\n#ifndef SMBPITCHSHIFT_HPP\r\n#define SMBPITCHSHIFT_HPP\r\n\r\n#include <algorithm>\r\n#include <cmath>\r\n#include <cstdint>\r\n\r\nnamespace smb\r\n{\r\n    namespace\r\n    {\r\n        constexpr float pi = 3.14159265358979323846F;\r\n\r\n        \/\/ Use own implementation because std::complex has a poor performance\r\n        template <class T>\r\n        struct Complex final\r\n        {\r\n            constexpr Complex<T> operator+(const Complex& other) const noexcept\r\n            {\r\n                return Complex{real + other.real, imag + other.imag};\r\n            }\r\n\r\n            constexpr Complex<T>& operator+=(const Complex& other)\r\n            {\r\n                real += other.real;\r\n                imag += other.imag;\r\n                return *this;\r\n            }\r\n\r\n            constexpr Complex<T> operator-(const Complex& other) const noexcept\r\n            {\r\n                return Complex{real - other.real, imag - other.imag};\r\n            }\r\n\r\n            constexpr Complex<T> operator-() const noexcept\r\n            {\r\n                return Complex{-real, -imag};\r\n            }\r\n\r\n            constexpr Complex<T>& operator-=(const Complex& other) noexcept\r\n            {\r\n                real -= other.real;\r\n                imag -= other.imag;\r\n                return *this;\r\n            }\r\n\r\n            constexpr Complex<T> operator*(const Complex& other) const noexcept\r\n            {\r\n                return Complex{real * other.real - imag * other.imag, real * other.imag + imag * other.real};\r\n            }\r\n\r\n            constexpr Complex<T>& operator*=(const Complex& other) noexcept\r\n            {\r\n                float tempReal = real;\r\n                real = tempReal * other.real - imag * other.imag;\r\n                imag = tempReal * other.imag + imag * other.real;\r\n                return *this;\r\n            }\r\n\r\n            inline T magnitude() const noexcept\r\n            {\r\n                return sqrt(real * real + imag * imag);\r\n            }\r\n\r\n            T real;\r\n            T imag;\r\n        };\r\n\r\n        template <int32_t sign, uint32_t fftFrameSize>\r\n        void fft(Complex<float>* fftBuffer) noexcept\r\n        {\r\n            \/\/ Bit-reversal permutation applied to a sequence of fftFrameSize items\r\n            for (uint32_t i = 1; i < fftFrameSize - 1; ++i)\r\n            {\r\n                uint32_t j = 0;\r\n\r\n                for (uint32_t bitm = 1; bitm < fftFrameSize; bitm <<= 1)\r\n                {\r\n                    if (i & bitm) ++j;\r\n                    j <<= 1;\r\n                }\r\n                j >>= 1;\r\n\r\n                if (i < j)\r\n                    std::swap(fftBuffer[i], fftBuffer[j]);\r\n            }\r\n\r\n            \/\/ Iterative form of Danielson–-Lanczos lemma\r\n            uint32_t step = 2;\r\n            for (uint32_t i = 1; i < fftFrameSize; i <<= 1, step <<= 1)\r\n            {\r\n                const uint32_t step2 = step >> 1;\r\n                const float arg = pi \/ step2;\r\n\r\n                const Complex<float> w{std::cos(arg), std::sin(arg) * sign};\r\n                Complex<float> u{1.0F, 0.0F};\r\n                for (uint32_t j = 0; j < step2; ++j)\r\n                {\r\n                    for (uint32_t k = j; k < fftFrameSize; k += step)\r\n                    {\r\n                        const Complex<float> temp = fftBuffer[k + step2] * u;\r\n                        fftBuffer[k + step2] = fftBuffer[k] - temp;\r\n                        fftBuffer[k] += temp;\r\n                    }\r\n\r\n                    u *= w;\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    template <uint32_t fftFrameSize, uint32_t oversamp>\r\n    class PitchShift final\r\n    {\r\n    public:\r\n        PitchShift()\r\n        {\r\n            \/\/ Hann window\r\n            for (uint32_t k = 0; k < fftFrameSize; ++k)\r\n                window[k] = 0.5F * (1.0F + std::cos(2.0F * pi * static_cast<float>(k) \/ static_cast<float>(fftFrameSize)));\r\n        }\r\n\r\n        \/*\r\n            Routine process(). See top of file for explanation\r\n            Purpose: doing pitch shifting while maintaining duration using the Short\r\n            Time Fourier Transform.\r\n            Author: (c)1999-2015 Stephan M. Bernsee <s.bernsee [AT] zynaptiq [DOT] com>\r\n        *\/\r\n        void process(const float pitchShift, const uint32_t numSampsToProcess,\r\n                     const uint32_t sampleRate, const float* indata, float* outdata) noexcept\r\n        {\r\n            \/\/ set up some handy variables\r\n            constexpr uint32_t fftFrameSizeHalf = fftFrameSize \/ 2;\r\n            constexpr uint32_t stepSize = fftFrameSize \/ oversamp;\r\n            constexpr uint32_t inFifoLatency = fftFrameSize - stepSize;\r\n            const float freqPerBin = static_cast<float>(sampleRate) \/ static_cast<float>(fftFrameSize);\r\n            const float expected = 2.0F * pi * static_cast<float>(stepSize) \/ static_cast<float>(fftFrameSize);\r\n            if (rover == 0) rover = inFifoLatency;\r\n\r\n            \/\/ main processing loop\r\n            for (uint32_t i = 0; i < numSampsToProcess; ++i)\r\n            {\r\n                \/\/ As long as we have not yet collected enough data just read in\r\n                inFifo[rover] = indata[i];\r\n                outdata[i] = outFifo[rover - inFifoLatency];\r\n                ++rover;\r\n\r\n                \/\/ now we have enough data for processing\r\n                if (rover >= fftFrameSize)\r\n                {\r\n                    rover = inFifoLatency;\r\n\r\n                    \/\/ do windowing\r\n                    for (uint32_t k = 0; k < fftFrameSize; ++k)\r\n                        fftWorksp[k] = { inFifo[k] * window[k], 0.0F };\r\n\r\n                    \/\/ ***************** ANALYSIS *******************\r\n                    \/\/ do transform\r\n                    fft<-1, fftFrameSize>(fftWorksp);\r\n\r\n                    \/\/ this is the analysis step\r\n                    for (uint32_t k = 0; k < fftFrameSizeHalf + 1; ++k)\r\n                    {\r\n                        const Complex<float>& current = fftWorksp[k];\r\n\r\n                        \/\/ compute magnitude and phase\r\n                        const float magn = 2.0F * current.magnitude();\r\n                        const float signx = (current.imag > 0.0F) ? 1.0F : -1.0F;\r\n                        const float phase = (current.imag == 0.0F) ? 0.0F :\r\n                            (current.real == 0.0F) ? signx * pi \/ 2.0F :\r\n                            std::atan2(current.imag, current.real);\r\n\r\n                        \/\/ compute phase difference\r\n                        float tmp = phase - lastPhase[k];\r\n                        lastPhase[k] = phase;\r\n\r\n                        \/\/ subtract expected phase difference\r\n                        tmp -= static_cast<float>(k) * expected;\r\n\r\n                        \/\/ map delta phase into +\/- Pi interval\r\n                        int32_t qpd = static_cast<int32_t>(tmp \/ pi);\r\n                        if (qpd >= 0) qpd += qpd & 1;\r\n                        else qpd -= qpd & 1;\r\n                        tmp -= pi * static_cast<float>(qpd);\r\n\r\n                        \/\/ get deviation from bin frequency from the +\/- Pi interval\r\n                        tmp = oversamp * tmp \/ (2.0F * pi);\r\n\r\n                        \/\/ compute the k-th partials' true frequency\r\n                        tmp = static_cast<float>(k) * freqPerBin + tmp * freqPerBin;\r\n\r\n                        \/\/ store magnitude and true frequency in analysis arrays\r\n                        anaMagn[k] = magn;\r\n                        anaFreq[k] = tmp;\r\n                    }\r\n\r\n                    \/\/ ***************** PROCESSING *******************\r\n                    \/\/ this does the actual pitch shifting\r\n                    std::fill(std::begin(synMagn), std::begin(synMagn) + fftFrameSize, 0.0F);\r\n                    std::fill(std::begin(synFreq), std::begin(synFreq) + fftFrameSize, 0.0F);\r\n                    for (uint32_t k = 0; k < fftFrameSizeHalf + 1; ++k)\r\n                    {\r\n                        const uint32_t index = static_cast<uint32_t>(k * pitchShift);\r\n                        if (index > fftFrameSizeHalf) break;\r\n                        synMagn[index] += anaMagn[k];\r\n                        synFreq[index] = anaFreq[k] * pitchShift;\r\n                    }\r\n\r\n                    \/\/ ***************** SYNTHESIS *******************\r\n                    \/\/ this is the synthesis step\r\n                    for (uint32_t k = 0; k < fftFrameSizeHalf + 1; ++k)\r\n                    {\r\n                        \/\/ get magnitude and true frequency from synthesis arrays\r\n                        const float magn = synMagn[k];\r\n                        float tmp = synFreq[k];\r\n\r\n                        \/\/ subtract bin mid frequency\r\n                        tmp -= static_cast<float>(k) * freqPerBin;\r\n\r\n                        \/\/ get bin deviation from freq deviation\r\n                        tmp \/= freqPerBin;\r\n\r\n                        \/\/ take oversampling factor into account\r\n                        tmp = 2.0F * pi * tmp \/ oversamp;\r\n\r\n                        \/\/ add the overlap phase advance back in\r\n                        tmp += static_cast<float>(k) * expected;\r\n\r\n                        \/\/ accumulate delta phase to get bin phase\r\n                        sumPhase[k] += tmp;\r\n                        const float phase = sumPhase[k];\r\n\r\n                        \/\/ get real and imag part and re-interleave\r\n                        fftWorksp[k] = { magn * std::cos(phase), magn * std::sin(phase) };\r\n                    }\r\n\r\n                    \/\/ zero negative frequencies\r\n                    for (uint32_t k = fftFrameSize + 1; k < fftFrameSize; ++k)\r\n                        fftWorksp[k] = {0.0F, 0.0F};\r\n\r\n                    \/\/ do inverse transform\r\n                    fft<1, fftFrameSize>(fftWorksp);\r\n\r\n                    \/\/ do windowing and add to output accumulator\r\n                    for (uint32_t k = 0; k < fftFrameSize; ++k)\r\n                        outputAccum[k] += 2.0F * window[k] * fftWorksp[k].real \/ (fftFrameSizeHalf * oversamp);\r\n\r\n                    uint32_t k;\r\n                    for (k = 0 ; k < stepSize; ++k)\r\n                        outFifo[k] = outputAccum[k];\r\n                    \/\/ shift accumulator\r\n                    uint32_t j;\r\n                    for (j = 0; k < fftFrameSize; ++k, ++j)\r\n                        outputAccum[j] = outputAccum[k];\r\n                    for (; j < fftFrameSize; ++j)\r\n                        outputAccum[j] = 0.0;\r\n\r\n                    \/\/ move input FIFO\r\n                    for (k = 0; k < inFifoLatency; ++k)\r\n                        inFifo[k] = inFifo[k + stepSize];\r\n                }\r\n            }\r\n        }\r\n\r\n    private:\r\n        float window[fftFrameSize]; \/\/ the windowing function\r\n        float inFifo[fftFrameSize]{0.0F};\r\n        float outFifo[fftFrameSize]{0.0F};\r\n        Complex<float> fftWorksp[fftFrameSize]{{0.0F, 0.0F}};\r\n        float lastPhase[fftFrameSize \/ 2 + 1]{0.0F};\r\n        float sumPhase[fftFrameSize \/ 2 + 1]{0.0F};\r\n        float outputAccum[2 * fftFrameSize]{0.0F};\r\n        float anaFreq[fftFrameSize]{0.0F};\r\n        float anaMagn[fftFrameSize]{0.0F};\r\n        float synFreq[fftFrameSize]{0.0F};\r\n        float synMagn[fftFrameSize]{0.0F};\r\n        uint32_t rover = 0;\r\n    };\r\n}\r\n\r\n#endif\r\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: cacheitem.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: kz $ $Date: 2004-01-28 15:07:38 $\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 __FILTER_CONFIG_CACHEITEM_HXX_\n#define __FILTER_CONFIG_CACHEITEM_HXX_\n\n\/\/_______________________________________________\n\/\/ includes\n\n#include <hash_map>\n#include <deque>\n\n#ifndef _COM_SUN_STAR_UNO_ANY_H_\n#include <com\/sun\/star\/uno\/Any.h>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\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_BEANS_NAMEDVALUE_HPP_\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n#endif\n\n#ifndef _COMPHELPER_SEQUENCEASVECTOR_HXX_\n#include <comphelper\/sequenceasvector.hxx>\n#endif\n\n#ifndef _COMPHELPER_SEQUENCEASHASHMAP_HXX_\n#include <comphelper\/sequenceashashmap.hxx>\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n\n\/\/_______________________________________________\n\/\/ namespace\n\nnamespace filter{\n    namespace config{\n\nnamespace css = ::com::sun::star;\n\n\/\/_______________________________________________\n\/\/ definitions\n\n\/** @short  Must be used as first derived base class\n            to get a full initialized mutex member,\n            which can be used during the ctor runs too!\n *\/\nstruct BaseLock\n{\n    public:\n\n        \/\/ must be mutable to be useable in const environments too!\n        mutable ::osl::Mutex m_aLock;\n};\n\n\ntypedef ::comphelper::SequenceAsVector< ::rtl::OUString > OUStringList;\n\n\/\/_______________________________________________\n\n\/** @short  represent an item of a FilterCache\n            instance.\n\n    @descr  This class is not threadsafe tp perform\n            operations, which use many instances of\n            this class! Synchronizations must be done outside.\n *\/\nclass CacheItem : public ::comphelper::SequenceAsHashMap\n{\n    \/\/-------------------------------------------\n    public:\n\n        \/\/---------------------------------------\n        \/** @short  creates an empty item.\n          *\/\n        CacheItem();\n\n        \/\/---------------------------------------\n\n        \/** @short  update only properties, which are given by the\n                    specified rItem.\n\n            @descr  Update means: - add new properties\n                                  - change existing values\n\n            @param  rUpdateItem\n                    another cache item, which contains some special\n                    properties, which should by used for updating\n                    this one.\n         *\/\n        void update(const CacheItem& rUpdateItem);\n\n        \/\/---------------------------------------\n\n        \/** @short  check, if the given properties exists\n                    at this item.\n\n            @descr  All properties are compared in its minimum.\n                    E.g: string lists => only the requested items\n                    are checked. Additional existing items are ignored.\n\n            @param  lProps\n                    contains all properties, which must exist at this item.\n\n            @return TRUE if all given properties exists\n                    at this item; FALSE otherwhise.\n         *\/\n        sal_Bool haveProps(const CacheItem& lProps) const;\n\n        \/\/---------------------------------------\n\n        \/** @short  check, if the given properties dont exists\n                    at this item.\n\n            @descr  All properties are compared in its minimum.\n                    E.g: string lists => only the requested items\n                    are checked. Additional existing items are ignored.\n\n            @param  lProps\n                    contains all properties, which should not exists at this item.\n\n            @return FALSE if at least on property exists at this item(!);\n                    TRUE otherwhise.\n         *\/\n        sal_Bool dontHaveProps(const CacheItem& lProps) const;\n\n        \/\/---------------------------------------\n\n        \/** @short  check, if the given properties dont exists\n                    at this item.\n\n            @descr  All properties are compared in its minimum.\n                    E.g: string lists => only the specified items\n                    are checked. Additional existing items are ignored.\n\n            @param  lProps\n                    contains all properties, which should be checked.\n\n            @return TRUE if all given properties dont exists\n                    at this item; FALSE otherwhise.\n         *\/\n        sal_Bool excludeProps(const CacheItem& lProps) const;\n\n        \/\/---------------------------------------\n\n        \/** @short  because we know two UIName properties\n                    (a list with all locales and the value\n                    for the current locale only), we must be shure\n                    that the correspond together.\n\n            @param  sActLocale\n                    must specify the current office locale.\n                    Its needed to adress the UIName property inside\n                    the list of possible ones.\n         *\/\n        void validateUINames(const ::rtl::OUString& sActLocale);\n\n        \/\/---------------------------------------\n\n        \/** @short  convert this structure to a seq< PropertyValue >\n                    and ignore all empty properties!\n\n            @descr  Normaly the converter routines of the base class\n                    SequenceAsHashMap do this job already.\n                    But it doesnt provide a \"pack\" mechanism to\n                    ignore properties with empty (means \"void\") values.\n\n            @return css::uno::Sequence< css::beans::PropertyValue >\n                    as a list of all properties of this cacheitem,\n                    where empty properties was removed.\n         *\/\n        css::uno::Sequence< css::beans::PropertyValue > getAsPackedPropertyValueList();\n};\n\n\/\/_______________________________________________\n\n\/** @short  represent an item list of a FilterCache\n            instance.\n *\/\ntypedef ::std::hash_map< ::rtl::OUString                    ,\n                         CacheItem                          ,\n                         ::rtl::OUStringHash                ,\n                         ::std::equal_to< ::rtl::OUString > > CacheItemList;\n\n\/\/_______________________________________________\n\n\/** @short  supports registration of multiple key to\n            another string information.\n\n    @descr  E.g. a list of internal type names can be registered\n            to an extension. Organization as an hash makes it\n            faster then searching inside vectors.\n\n            On the other side e.g. URLPattern cant be realy adressed\n            by a hash value ... because the use wildcards. But\n            there we need key-value pairs too, which cant be provided\n            by a pur vector!\n *\/\ntypedef ::std::hash_map< ::rtl::OUString                    ,\n                         OUStringList                       ,\n                         ::rtl::OUStringHash                ,\n                         ::std::equal_to< ::rtl::OUString > > CacheItemRegistration;\n\n\/\/_______________________________________________\n\n\/** @short  is used to collect all matching types of an URL\n            during type detection.\n\n    @descr  Every type in this list is combined with an information,\n            which property matched to the given URL. The user of this\n            structure can decide then, if a deep detection should be\n            supressed e.g. if an URLPattern was used.\n\n            Structure info: NamedValue.Name  = <internal type name>\n                            NamedValue.Value = [boolean]bMatchByURLPattern\n *\/\ntypedef ::std::vector< css::beans::NamedValue > FlatDetection;\n\n    } \/\/ namespace config\n} \/\/ namespace filter\n\n#endif \/\/ __FILTER_CONFIG_CACHEITEM_HXX_\n<commit_msg>INTEGRATION: CWS imprec01 (1.2.178); FILE MERGED 2005\/01\/05 12:38:19 as 1.2.178.1: #i39653# make it possible to insert preferred types on the front of flat detection list<commit_after>\/*************************************************************************\n *\n *  $RCSfile: cacheitem.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-02-02 13:46:02 $\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 __FILTER_CONFIG_CACHEITEM_HXX_\n#define __FILTER_CONFIG_CACHEITEM_HXX_\n\n\/\/_______________________________________________\n\/\/ includes\n\n#include <hash_map>\n#include <deque>\n#include <list>\n\n#ifndef _COM_SUN_STAR_UNO_ANY_H_\n#include <com\/sun\/star\/uno\/Any.h>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\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_BEANS_NAMEDVALUE_HPP_\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n#endif\n\n#ifndef _COMPHELPER_SEQUENCEASVECTOR_HXX_\n#include <comphelper\/sequenceasvector.hxx>\n#endif\n\n#ifndef _COMPHELPER_SEQUENCEASHASHMAP_HXX_\n#include <comphelper\/sequenceashashmap.hxx>\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n\n\/\/_______________________________________________\n\/\/ namespace\n\nnamespace filter{\n    namespace config{\n\nnamespace css = ::com::sun::star;\n\n\/\/_______________________________________________\n\/\/ definitions\n\n\/** @short  Must be used as first derived base class\n            to get a full initialized mutex member,\n            which can be used during the ctor runs too!\n *\/\nstruct BaseLock\n{\n    public:\n\n        \/\/ must be mutable to be useable in const environments too!\n        mutable ::osl::Mutex m_aLock;\n};\n\n\ntypedef ::comphelper::SequenceAsVector< ::rtl::OUString > OUStringList;\n\n\/\/_______________________________________________\n\n\/** @short  represent an item of a FilterCache\n            instance.\n\n    @descr  This class is not threadsafe tp perform\n            operations, which use many instances of\n            this class! Synchronizations must be done outside.\n *\/\nclass CacheItem : public ::comphelper::SequenceAsHashMap\n{\n    \/\/-------------------------------------------\n    public:\n\n        \/\/---------------------------------------\n        \/** @short  creates an empty item.\n          *\/\n        CacheItem();\n\n        \/\/---------------------------------------\n\n        \/** @short  update only properties, which are given by the\n                    specified rItem.\n\n            @descr  Update means: - add new properties\n                                  - change existing values\n\n            @param  rUpdateItem\n                    another cache item, which contains some special\n                    properties, which should by used for updating\n                    this one.\n         *\/\n        void update(const CacheItem& rUpdateItem);\n\n        \/\/---------------------------------------\n\n        \/** @short  check, if the given properties exists\n                    at this item.\n\n            @descr  All properties are compared in its minimum.\n                    E.g: string lists => only the requested items\n                    are checked. Additional existing items are ignored.\n\n            @param  lProps\n                    contains all properties, which must exist at this item.\n\n            @return TRUE if all given properties exists\n                    at this item; FALSE otherwhise.\n         *\/\n        sal_Bool haveProps(const CacheItem& lProps) const;\n\n        \/\/---------------------------------------\n\n        \/** @short  check, if the given properties dont exists\n                    at this item.\n\n            @descr  All properties are compared in its minimum.\n                    E.g: string lists => only the requested items\n                    are checked. Additional existing items are ignored.\n\n            @param  lProps\n                    contains all properties, which should not exists at this item.\n\n            @return FALSE if at least on property exists at this item(!);\n                    TRUE otherwhise.\n         *\/\n        sal_Bool dontHaveProps(const CacheItem& lProps) const;\n\n        \/\/---------------------------------------\n\n        \/** @short  check, if the given properties dont exists\n                    at this item.\n\n            @descr  All properties are compared in its minimum.\n                    E.g: string lists => only the specified items\n                    are checked. Additional existing items are ignored.\n\n            @param  lProps\n                    contains all properties, which should be checked.\n\n            @return TRUE if all given properties dont exists\n                    at this item; FALSE otherwhise.\n         *\/\n        sal_Bool excludeProps(const CacheItem& lProps) const;\n\n        \/\/---------------------------------------\n\n        \/** @short  because we know two UIName properties\n                    (a list with all locales and the value\n                    for the current locale only), we must be shure\n                    that the correspond together.\n\n            @param  sActLocale\n                    must specify the current office locale.\n                    Its needed to adress the UIName property inside\n                    the list of possible ones.\n         *\/\n        void validateUINames(const ::rtl::OUString& sActLocale);\n\n        \/\/---------------------------------------\n\n        \/** @short  convert this structure to a seq< PropertyValue >\n                    and ignore all empty properties!\n\n            @descr  Normaly the converter routines of the base class\n                    SequenceAsHashMap do this job already.\n                    But it doesnt provide a \"pack\" mechanism to\n                    ignore properties with empty (means \"void\") values.\n\n            @return css::uno::Sequence< css::beans::PropertyValue >\n                    as a list of all properties of this cacheitem,\n                    where empty properties was removed.\n         *\/\n        css::uno::Sequence< css::beans::PropertyValue > getAsPackedPropertyValueList();\n};\n\n\/\/_______________________________________________\n\n\/** @short  represent an item list of a FilterCache\n            instance.\n *\/\ntypedef ::std::hash_map< ::rtl::OUString                    ,\n                         CacheItem                          ,\n                         ::rtl::OUStringHash                ,\n                         ::std::equal_to< ::rtl::OUString > > CacheItemList;\n\n\/\/_______________________________________________\n\n\/** @short  supports registration of multiple key to\n            another string information.\n\n    @descr  E.g. a list of internal type names can be registered\n            to an extension. Organization as an hash makes it\n            faster then searching inside vectors.\n\n            On the other side e.g. URLPattern cant be realy adressed\n            by a hash value ... because the use wildcards. But\n            there we need key-value pairs too, which cant be provided\n            by a pur vector!\n *\/\ntypedef ::std::hash_map< ::rtl::OUString                    ,\n                         OUStringList                       ,\n                         ::rtl::OUStringHash                ,\n                         ::std::equal_to< ::rtl::OUString > > CacheItemRegistration;\n\n\/\/_______________________________________________\n\n\/** @short  is used to collect all matching types of an URL\n            during type detection.\n\n    @descr  Every type in this list is combined with an information,\n            which property matched to the given URL. The user of this\n            structure can decide then, if a deep detection should be\n            supressed e.g. if an URLPattern was used.\n\n            Structure info: NamedValue.Name  = <internal type name>\n                            NamedValue.Value = [boolean]bMatchByURLPattern\n *\/\ntypedef ::std::list< css::beans::NamedValue > FlatDetection;\n\n    } \/\/ namespace config\n} \/\/ namespace filter\n\n#endif \/\/ __FILTER_CONFIG_CACHEITEM_HXX_\n<|endoftext|>"}
{"text":"<commit_before>#define COUNTERHELPER_CALLBACKMODE\n#include \"CounterHelper.h\"\n#undef COUNTERHELPER_CALLBACKMODE\n\n#include <ROOT\/RDataFrame.hxx>\n#include <ROOT\/RTrivialDS.hxx>\n#include <TROOT.h> \/\/ ROOT::EnableImplicitMT\n#include <TFile.h>\n#include <TSystem.h>\n#include <TTree.h>\n\n#include <gtest\/gtest.h>\n\n#include <algorithm> \/\/ std::min\n#include <thread> \/\/ std::hardware_concurrency\n\n\/\/ fixture for all tests in this file\nstruct RDFDataBlockCallback : ::testing::TestWithParam<bool> {\n   unsigned int NSLOTS;\n   unsigned int NENTRIES = std::max(10u, std::thread::hardware_concurrency() * 2);\n\n   RDFDataBlockCallback() : NSLOTS(GetParam() ? std::min(4u, std::thread::hardware_concurrency()) : 1u)\n   {\n      if (GetParam())\n         ROOT::EnableImplicitMT();\n   }\n\n   ~RDFDataBlockCallback()\n   {\n      if (GetParam())\n         ROOT::DisableImplicitMT();\n   }\n};\n\n\/\/ A RAII object that ensures existence of nFiles root files named prefix0.root, prefix1.root, ...\n\/\/ Each file contains a TTree called \"t\" with one `int` branch called \"x\" with sequentially increasing values (0,1,2...)\nstruct InputFilesRAII {\n   unsigned int fNFiles = 0;\n   std::string fPrefix;\n\n   InputFilesRAII(unsigned int nFiles, std::string prefix) : fNFiles(nFiles), fPrefix(std::move(prefix))\n   {\n      for (auto i = 0u; i < fNFiles; ++i) {\n         TFile f((fPrefix + std::to_string(i) + \".root\").c_str(), \"recreate\");\n         TTree t(\"t\", \"t\");\n         t.Branch(\"x\", &i);\n         t.Fill();\n         t.Write();\n      }\n   }\n\n   ~InputFilesRAII()\n   {\n      for (auto i = 0u; i < fNFiles; ++i)\n         gSystem->Unlink((fPrefix + std::to_string(i) + \".root\").c_str());\n   }\n};\n\nTEST_P(RDFDataBlockCallback, EmptySource) {\n   ROOT::RDataFrame df(NENTRIES);\n   auto result = df.Book<>(CounterHelper(), {});\n   \/\/ RDF with empty sources tries to produce 2 tasks per slot when MT is enabled\n   const auto expected = ROOT::IsImplicitMTEnabled() ? std::min(NENTRIES, df.GetNSlots() * 2u) : 1u;\n   EXPECT_EQ(*result, expected);\n}\n\nTEST_P(RDFDataBlockCallback, DataSource) {\n   auto df = ROOT::RDF::MakeTrivialDataFrame(NENTRIES);\n   auto result = df.Book<>(CounterHelper(), {});\n   \/\/ RTrivialDS tries to produce NSLOTS tasks\n   const auto expected = ROOT::IsImplicitMTEnabled() ? std::min(NENTRIES, df.GetNSlots()) : 1u;\n   EXPECT_EQ(*result, expected);\n}\n\nTEST_P(RDFDataBlockCallback, TTree) {\n   const std::string prefix = \"rdfdatablockcallback_ttree\";\n   InputFilesRAII file(1u, prefix);\n   ROOT::RDataFrame df(\"t\", prefix + \"*\");\n   auto result = df.Book<>(CounterHelper(), {});\n   EXPECT_EQ(*result, 1u);\n}\n\nTEST_P(RDFDataBlockCallback, TChain) {\n   const std::string prefix = \"rdfdatablockcallback_tchain\";\n   InputFilesRAII file(5u, prefix);\n   ROOT::RDataFrame df(\"t\", prefix + \"*\");\n   auto result = df.Book<>(CounterHelper(), {});\n   EXPECT_EQ(*result, 5u);\n}\n\n\/\/ instantiate single-thread tests\nINSTANTIATE_TEST_SUITE_P(Seq, RDFDataBlockCallback, ::testing::Values(false));\n\n#ifdef R__USE_IMT\n   \/\/ instantiate multi-thread tests\n   INSTANTIATE_TEST_SUITE_P(MT, RDFDataBlockCallback, ::testing::Values(true));\n#endif\n<commit_msg>[DF] Add test for data-block IDs<commit_after>#define COUNTERHELPER_CALLBACKMODE\n#include \"CounterHelper.h\"\n#undef COUNTERHELPER_CALLBACKMODE\n\n#include <ROOT\/RDataFrame.hxx>\n#include <ROOT\/RTrivialDS.hxx>\n#include <TROOT.h> \/\/ ROOT::EnableImplicitMT\n#include <TFile.h>\n#include <TSystem.h>\n#include <TTree.h>\n\n#include <gtest\/gtest.h>\n\n#include <algorithm> \/\/ std::min\n#include <memory>\n#include <mutex>\n#include <thread> \/\/ std::hardware_concurrency\n\n\/\/ fixture for all tests in this file\nstruct RDFDataBlockCallback : ::testing::TestWithParam<bool> {\n   unsigned int NSLOTS;\n   unsigned int NENTRIES = std::max(10u, std::thread::hardware_concurrency() * 2);\n\n   RDFDataBlockCallback() : NSLOTS(GetParam() ? std::min(4u, std::thread::hardware_concurrency()) : 1u)\n   {\n      if (GetParam())\n         ROOT::EnableImplicitMT();\n   }\n\n   ~RDFDataBlockCallback()\n   {\n      if (GetParam())\n         ROOT::DisableImplicitMT();\n   }\n};\n\n\/\/ A RAII object that ensures existence of nFiles root files named prefix0.root, prefix1.root, ...\n\/\/ Each file contains a TTree called \"t\" with one `int` branch called \"x\" with sequentially increasing values (0,1,2...)\nstruct InputFilesRAII {\n   unsigned int fNFiles = 0;\n   std::string fPrefix;\n\n   InputFilesRAII(unsigned int nFiles, std::string prefix) : fNFiles(nFiles), fPrefix(std::move(prefix))\n   {\n      for (auto i = 0u; i < fNFiles; ++i) {\n         TFile f((fPrefix + std::to_string(i) + \".root\").c_str(), \"recreate\");\n         TTree t(\"t\", \"t\");\n         t.Branch(\"x\", &i);\n         t.Fill();\n         t.Write();\n      }\n   }\n\n   ~InputFilesRAII()\n   {\n      for (auto i = 0u; i < fNFiles; ++i)\n         gSystem->Unlink((fPrefix + std::to_string(i) + \".root\").c_str());\n   }\n};\n\nTEST_P(RDFDataBlockCallback, EmptySource) {\n   ROOT::RDataFrame df(NENTRIES);\n   auto result = df.Book<>(CounterHelper(), {});\n   \/\/ RDF with empty sources tries to produce 2 tasks per slot when MT is enabled\n   const auto expected = ROOT::IsImplicitMTEnabled() ? std::min(NENTRIES, df.GetNSlots() * 2u) : 1u;\n   EXPECT_EQ(*result, expected);\n}\n\nTEST_P(RDFDataBlockCallback, DataSource) {\n   auto df = ROOT::RDF::MakeTrivialDataFrame(NENTRIES);\n   auto result = df.Book<>(CounterHelper(), {});\n   \/\/ RTrivialDS tries to produce NSLOTS tasks\n   const auto expected = ROOT::IsImplicitMTEnabled() ? std::min(NENTRIES, df.GetNSlots()) : 1u;\n   EXPECT_EQ(*result, expected);\n}\n\nTEST_P(RDFDataBlockCallback, TTree) {\n   const std::string prefix = \"rdfdatablockcallback_ttree\";\n   InputFilesRAII file(1u, prefix);\n   ROOT::RDataFrame df(\"t\", prefix + \"*\");\n   auto result = df.Book<>(CounterHelper(), {});\n   EXPECT_EQ(*result, 1u);\n}\n\nTEST_P(RDFDataBlockCallback, TChain) {\n   const std::string prefix = \"rdfdatablockcallback_tchain\";\n   InputFilesRAII file(5u, prefix);\n   ROOT::RDataFrame df(\"t\", prefix + \"*\");\n   auto result = df.Book<>(CounterHelper(), {});\n   EXPECT_EQ(*result, 5u);\n}\n\nclass DataBlockHelper : public ROOT::Detail::RDF::RActionImpl<DataBlockHelper> {\n   std::shared_ptr<std::vector<ROOT::RDF::RDataBlockID>> fDataBlocks;\n   std::unique_ptr<std::mutex> fMutex;\npublic:\n   DataBlockHelper()\n      : fDataBlocks(std::make_shared<std::vector<ROOT::RDF::RDataBlockID>>()), fMutex(std::make_unique<std::mutex>())\n   {\n   }\n   DataBlockHelper(DataBlockHelper &&) = default;\n   DataBlockHelper(const DataBlockHelper &) = delete;\n\n   using Result_t = std::vector<ROOT::RDF::RDataBlockID>;\n   auto GetResultPtr() const { return fDataBlocks; }\n   void Initialize() {}\n   void InitTask(TTreeReader *, unsigned int) {}\n   void Exec(unsigned int) {}\n   ROOT::RDF::DataBlockCallback_t GetDataBlockCallback() final\n   {\n      return [this](unsigned int, const ROOT::RDF::RDataBlockID &db) mutable {\n         std::lock_guard<std::mutex> lg(*fMutex);\n         fDataBlocks->emplace_back(db);\n      };\n   }\n   void Finalize() {}\n\n   std::string GetActionName() { return \"DataBlockHelper\"; }\n};\n\nTEST_P(RDFDataBlockCallback, EmptySourceDataBlockNames) {\n   ROOT::RDataFrame df(NENTRIES);\n   auto result = df.Book<>(DataBlockHelper(), {});\n   if (ROOT::IsImplicitMTEnabled()) {\n      \/\/ RDF with empty sources tries to produce 2 tasks per slot when MT is enabled\n      const auto expectedSize = std::min(NENTRIES, df.GetNSlots() * 2u);\n      ASSERT_EQ(result->size(), expectedSize);\n      for (auto &id : *result) {\n         \/\/ check that all entries start with the expected string\n         EXPECT_TRUE(id.AsString().rfind(\"Empty source, range: {\", 0) == 0);\n      }\n   } else {\n      const std::string expectedStr = \"Empty source, range: {0, \" + std::to_string(NENTRIES) + \"}\";\n      EXPECT_EQ(result->at(0).AsString(), expectedStr);\n   }\n}\n\nTEST_P(RDFDataBlockCallback, TTreeDataBlockNames) {\n   const std::string prefix = \"rdfdatablockcallback_ttreedbnames\";\n   InputFilesRAII file(1u, prefix);\n   ROOT::RDataFrame df(\"t\", prefix + \"*\");\n   auto result = df.Book<>(DataBlockHelper(), {});\n   ASSERT_EQ(result->size(), 1u);\n   EXPECT_TRUE(result->at(0).Contains(prefix));\n   EXPECT_TRUE(result->at(0).AsString().rfind(\"\/t\") == result->at(0).AsString().size() - 2);\n}\n\nTEST_P(RDFDataBlockCallback, TChainDataBlockNames) {\n   const std::string prefix = \"rdfdatablockcallback_tchain\";\n   InputFilesRAII file(5u, prefix);\n   ROOT::RDataFrame df(\"t\", prefix + \"*\");\n   auto result = df.Book<>(DataBlockHelper(), {});\n   ASSERT_EQ(result->size(), 5u);\n   std::vector<char> fileNumbers(5);\n   for (auto i = 0u; i < 5u; ++i) {\n      EXPECT_TRUE(result->at(i).Contains(prefix));\n      const auto &id = result->at(i).AsString();\n      EXPECT_TRUE(id.rfind(\"\/t\") == id.size() - 2);\n      fileNumbers[i] = id[id.size() - 8];\n   }\n\n   std::sort(fileNumbers.begin(), fileNumbers.end());\n   for (int i = 0; i < 5; ++i)\n      \/\/ '0' == 48, '1' == 49, etc.\n      EXPECT_EQ(fileNumbers[i], i + 48);\n}\n\n\/* TODO: data-block IDs for RDataSources are not supported yet\nTEST_P(RDFDataBlockCallback, DataSource) {\n   auto df = ROOT::RDF::MakeTrivialDataFrame(NENTRIES);\n   auto result = df.Book<>(CounterHelper(), {});\n   \/\/ RTrivialDS tries to produce NSLOTS tasks\n   const auto expected = ROOT::IsImplicitMTEnabled() ? std::min(NENTRIES, df.GetNSlots()) : 1u;\n   EXPECT_EQ(*result, expected);\n}\n*\/\n\n\/\/ instantiate single-thread tests\nINSTANTIATE_TEST_SUITE_P(Seq, RDFDataBlockCallback, ::testing::Values(false));\n\n#ifdef R__USE_IMT\n   \/\/ instantiate multi-thread tests\n   INSTANTIATE_TEST_SUITE_P(MT, RDFDataBlockCallback, ::testing::Values(true));\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n * newbucket.hxx -- new bucket routines for better world modeling\n *\n * Written by Curtis L. Olson, started February 1999.\n *\n * Copyright (C) 1999  Curtis L. Olson - curt@flightgear.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., 59 Temple Place - Suite 330,\n * Boston, MA  02111-1307, USA.\n *\n * $Id$\n **************************************************************************\/\n\n\/** \\file newbucket.hxx\n * A class and associated utiltity functions to manage world scenery tiling.\n *\/\n\n#ifndef _NEWBUCKET_HXX\n#define _NEWBUCKET_HXX\n\n#include <simgear\/compiler.h>\n#include <simgear\/constants.h>\n\n#ifdef SG_HAVE_STD_INCLUDES\n#  include <cmath>\n#  include <cstdio> \/\/ sprintf()\n#else\n#  include <math.h>\n#  include <stdio.h> \/\/ sprintf()\n#endif\n\n#include STL_IOSTREAM\n\n\/\/ I don't understand ... <math.h> or <cmath> should be included\n\/\/ already depending on how you defined SG_HAVE_STD_INCLUDES, but I\n\/\/ can go ahead and add this -- CLO\n#ifdef __MWERKS__\nSG_USING_STD(sprintf);\nSG_USING_STD(fabs);\n#endif\n\n#include STL_STRING\n\nSG_USING_STD(string);\nSG_USING_STD(ostream);\n\n\n\/**\n * standard size of a bucket in degrees (1\/8 of a degree)\n *\/\n#define SG_BUCKET_SPAN      0.125\n\n\/**\n * half of a standard SG_BUCKET_SPAN\n *\/\n#define SG_HALF_BUCKET_SPAN ( 0.5 * SG_BUCKET_SPAN )\n\n\n\/\/ return the horizontal tile span factor based on latitude\nstatic double sg_bucket_span( double l ) {\n    if ( l >= 89.0 ) {\n\treturn 360.0;\n    } else if ( l >= 88.0 ) {\n\treturn 8.0;\n    } else if ( l >= 86.0 ) {\n\treturn 4.0;\n    } else if ( l >= 83.0 ) {\n\treturn 2.0;\n    } else if ( l >= 76.0 ) {\n\treturn 1.0;\n    } else if ( l >= 62.0 ) {\n\treturn 0.5;\n    } else if ( l >= 22.0 ) {\n\treturn 0.25;\n    } else if ( l >= -22.0 ) {\n\treturn 0.125;\n    } else if ( l >= -62.0 ) {\n\treturn 0.25;\n    } else if ( l >= -76.0 ) {\n\treturn 0.5;\n    } else if ( l >= -83.0 ) {\n\treturn 1.0;\n    } else if ( l >= -86.0 ) {\n\treturn 2.0;\n    } else if ( l >= -88.0 ) {\n\treturn 4.0;\n    } else if ( l >= -89.0 ) {\n\treturn 8.0;\n    } else {\n\treturn 360.0;\n    }\n}\n\n\n\/**\n * A class to manage world scenery tiling.\n * This class encapsulates the world tiling scheme.  It provides ways\n * to calculate a unique tile index from a lat\/lon, and it can provide\n * information such as the dimensions of a given tile.\n *\/\n\nclass SGBucket {\n\nprivate:\n    double cx, cy;  \/\/ centerpoint (lon, lat) in degrees of bucket\n    int lon;        \/\/ longitude index (-180 to 179)\n    int lat;        \/\/ latitude index (-90 to 89)\n    int x;          \/\/ x subdivision (0 to 7)\n    int y;          \/\/ y subdivision (0 to 7)\n\npublic:\n\n    \/**\n     * Default constructor.\n     *\/\n    SGBucket();\n\n    \/**\n     * Construct a bucket given a specific location.\n     * @param dlon longitude specified in degrees\n     * @param dlat latitude specified in degrees\n     *\/\n    SGBucket(const double dlon, const double dlat);\n\n    \/** Construct a bucket.\n     *  @param is_good if false, create an invalid bucket.  This is\n     *  useful * if you are comparing cur_bucket to last_bucket and\n     *  you want to * make sure last_bucket starts out as something\n     *  impossible.\n     *\/\n    SGBucket(const bool is_good);\n\n    \/** Construct a bucket given a unique bucket index number.\n     * @param bindex unique bucket index\n     *\/\n    SGBucket(const long int bindex);\n\n    \/**\n     * Default destructor.\n     *\/\n    ~SGBucket();\n\n    \/**\n     * Reset a bucket to represent a new lat and lon\n     * @param dlon longitude specified in degrees\n     * @param dlat latitude specified in degrees\n     *\/\n    void set_bucket( double dlon, double dlat );\n\n    \/**\n     * Reset a bucket to represent a new lat and lon\n     * @param lonlat an array of double[2] holding lon and lat\n     * (specified) in degrees\n     *\/\n    void set_bucket( double *lonlat );\n\n    \/**\n     * Create an impossible bucket.\n     * This is useful if you are comparing cur_bucket to last_bucket\n     * and you want to make sure last_bucket starts out as something\n     * impossible.\n     *\/\n    inline void make_bad() {\n\tset_bucket(0.0, 0.0);\n\tlon = -1000;\n    }\n\n    \/**\n     * Generate the unique scenery tile index for this bucket\n     *\n     * The index is constructed as follows:\n     * \n     * 9 bits - to represent 360 degrees of longitude (-180 to 179)\n     * 8 bits - to represent 180 degrees of latitude (-90 to 89)\n     *\n     * Each 1 degree by 1 degree tile is further broken down into an 8x8\n     * grid.  So we also need:\n     *\n     * 3 bits - to represent x (0 to 7)\n     * 3 bits - to represent y (0 to 7)\n     * @return tile index\n     *\/\n    inline long int gen_index() const {\n\treturn ((lon + 180) << 14) + ((lat + 90) << 6) + (y << 3) + x;\n    }\n\n    \/**\n     * Generate the unique scenery tile index for this bucket in ascii\n     * string form.\n     * @return tile index in string form\n     *\/\n    inline string gen_index_str() const {\n\tchar tmp[20];\n\tsprintf(tmp, \"%ld\", \n                (((long)lon + 180) << 14) + ((lat + 90) << 6) + (y << 3) + x);\n\treturn (string)tmp;\n    }\n\n    \/**\n     * Build the base path name for this bucket.\n     * @return base path in string form\n     *\/\n    string gen_base_path() const;\n\n    \/**\n     * @return the center lon of a tile.\n     *\/\n    inline double get_center_lon() const {\n\tdouble span = sg_bucket_span( lat + y \/ 8.0 + SG_HALF_BUCKET_SPAN );\n\n\tif ( span >= 1.0 ) {\n\t    return lon + span \/ 2.0;\n\t} else {\n\t    return lon + x * span + span \/ 2.0;\n\t}\n    }\n\n    \/**\n     * @return the center lat of a tile.\n     *\/\n    inline double get_center_lat() const {\n\treturn lat + y \/ 8.0 + SG_HALF_BUCKET_SPAN;\n    }\n\n    \/**\n     * @return the width of the tile in degrees.\n     *\/\n    double get_width() const;\n\n    \/**\n     * @return the height of the tile in degrees.\n     *\/\n    double get_height() const;\n\n    \/**\n     * @return the width of the tile in meters.\n     *\/\n    double get_width_m() const; \n\n    \/**\n     * @return the height of the tile in meters.\n     *\/\n    double get_height_m() const;\n \n    \/\/ Informational methods.\n\n    \/**\n     * @return the lon of the lower left corner of this tile.\n     *\/\n    inline int get_lon() const { return lon; }\n\n    \/**\n     * @return the lat of the lower left corner of this tile.\n     *\/\n    inline int get_lat() const { return lat; }\n\n    \/**\n     * @return the x coord within the 1x1 degree chunk this tile.\n     *\/\n    inline int get_x() const { return x; }\n\n    \/**\n     * @return the y coord within the 1x1 degree chunk this tile.\n     *\/\n    inline int get_y() const { return y; }\n\n    \/\/ friends\n\n    friend ostream& operator<< ( ostream&, const SGBucket& );\n    friend bool operator== ( const SGBucket&, const SGBucket& );\n};\n\n\n\/**\n * \\relates SGBucket\n * Return the bucket which is offset from the specified dlon, dlat by\n * the specified tile units in the X & Y direction.\n * @param dlon starting lon in degrees\n * @param dlat starting lat in degrees\n * @param x number of bucket units to offset in x (lon) direction\n * @param y number of bucket units to offset in y (lat) direction\n * @return offset bucket\n *\/\nSGBucket sgBucketOffset( double dlon, double dlat, int x, int y );\n\n\n\/**\n * \\relates SGBucket\n * Calculate the offset between two buckets (in quantity of buckets).\n * @param b1 bucket 1\n * @param b2 bucket 2\n * @param dx offset distance (lon) in tile units\n * @param dy offset distance (lat) in tile units\n *\/\nvoid sgBucketDiff( const SGBucket& b1, const SGBucket& b2, int *dx, int *dy );\n\n\n\/**\n * Write the bucket lon, lat, x, and y to the output stream.\n * @param out output stream\n * @param b bucket\n *\/\ninline ostream&\noperator<< ( ostream& out, const SGBucket& b )\n{\n    return out << b.lon << \":\" << b.x << \", \" << b.lat << \":\" << b.y;\n}\n\n\n\/**\n * Compare two bucket structures for equality.\n * @param b1 bucket 1\n * @param b2 bucket 2\n * @return comparison result\n *\/\ninline bool\noperator== ( const SGBucket& b1, const SGBucket& b2 )\n{\n    return ( b1.lon == b2.lon &&\n\t     b1.lat == b2.lat &&\n\t     b1.x == b2.x &&\n\t     b1.y == b2.y );\n}\n\n\n#endif \/\/ _NEWBUCKET_HXX\n\n\n<commit_msg>David Luff:<commit_after>\/**************************************************************************\n * newbucket.hxx -- new bucket routines for better world modeling\n *\n * Written by Curtis L. Olson, started February 1999.\n *\n * Copyright (C) 1999  Curtis L. Olson - curt@flightgear.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., 59 Temple Place - Suite 330,\n * Boston, MA  02111-1307, USA.\n *\n * $Id$\n **************************************************************************\/\n\n\/** \\file newbucket.hxx\n * A class and associated utiltity functions to manage world scenery tiling.\n *\/\n\n#ifndef _NEWBUCKET_HXX\n#define _NEWBUCKET_HXX\n\n#include <simgear\/compiler.h>\n#include <simgear\/constants.h>\n\n#ifdef SG_HAVE_STD_INCLUDES\n#  include <cmath>\n#  include <cstdio> \/\/ sprintf()\n#else\n#  include <math.h>\n#  include <stdio.h> \/\/ sprintf()\n#endif\n\n#include STL_IOSTREAM\n\n\/\/ I don't understand ... <math.h> or <cmath> should be included\n\/\/ already depending on how you defined SG_HAVE_STD_INCLUDES, but I\n\/\/ can go ahead and add this -- CLO\n#ifdef __MWERKS__\nSG_USING_STD(sprintf);\nSG_USING_STD(fabs);\n#endif\n\n#include STL_STRING\n\nSG_USING_STD(string);\nSG_USING_STD(ostream);\n\n\n\/**\n * standard size of a bucket in degrees (1\/8 of a degree)\n *\/\n#define SG_BUCKET_SPAN      0.125\n\n\/**\n * half of a standard SG_BUCKET_SPAN\n *\/\n#define SG_HALF_BUCKET_SPAN ( 0.5 * SG_BUCKET_SPAN )\n\n\n\/\/ return the horizontal tile span factor based on latitude\nstatic double sg_bucket_span( double l ) {\n    if ( l >= 89.0 ) {\n\treturn 360.0;\n    } else if ( l >= 88.0 ) {\n\treturn 8.0;\n    } else if ( l >= 86.0 ) {\n\treturn 4.0;\n    } else if ( l >= 83.0 ) {\n\treturn 2.0;\n    } else if ( l >= 76.0 ) {\n\treturn 1.0;\n    } else if ( l >= 62.0 ) {\n\treturn 0.5;\n    } else if ( l >= 22.0 ) {\n\treturn 0.25;\n    } else if ( l >= -22.0 ) {\n\treturn 0.125;\n    } else if ( l >= -62.0 ) {\n\treturn 0.25;\n    } else if ( l >= -76.0 ) {\n\treturn 0.5;\n    } else if ( l >= -83.0 ) {\n\treturn 1.0;\n    } else if ( l >= -86.0 ) {\n\treturn 2.0;\n    } else if ( l >= -88.0 ) {\n\treturn 4.0;\n    } else if ( l >= -89.0 ) {\n\treturn 8.0;\n    } else {\n\treturn 360.0;\n    }\n}\n\n\n\/**\n * A class to manage world scenery tiling.\n * This class encapsulates the world tiling scheme.  It provides ways\n * to calculate a unique tile index from a lat\/lon, and it can provide\n * information such as the dimensions of a given tile.\n *\/\n\nclass SGBucket {\n\nprivate:\n    double cx, cy;  \/\/ centerpoint (lon, lat) in degrees of bucket\n    int lon;        \/\/ longitude index (-180 to 179)\n    int lat;        \/\/ latitude index (-90 to 89)\n    int x;          \/\/ x subdivision (0 to 7)\n    int y;          \/\/ y subdivision (0 to 7)\n\npublic:\n\n    \/**\n     * Default constructor.\n     *\/\n    SGBucket();\n\n    \/**\n     * Construct a bucket given a specific location.\n     * @param dlon longitude specified in degrees\n     * @param dlat latitude specified in degrees\n     *\/\n    SGBucket(const double dlon, const double dlat);\n\n    \/** Construct a bucket.\n     *  @param is_good if false, create an invalid bucket.  This is\n     *  useful * if you are comparing cur_bucket to last_bucket and\n     *  you want to * make sure last_bucket starts out as something\n     *  impossible.\n     *\/\n    SGBucket(const bool is_good);\n\n    \/** Construct a bucket given a unique bucket index number.\n     * @param bindex unique bucket index\n     *\/\n    SGBucket(const long int bindex);\n\n    \/**\n     * Default destructor.\n     *\/\n    ~SGBucket();\n\n    \/**\n     * Reset a bucket to represent a new lat and lon\n     * @param dlon longitude specified in degrees\n     * @param dlat latitude specified in degrees\n     *\/\n    void set_bucket( double dlon, double dlat );\n\n    \/**\n     * Reset a bucket to represent a new lat and lon\n     * @param lonlat an array of double[2] holding lon and lat\n     * (specified) in degrees\n     *\/\n    void set_bucket( double *lonlat );\n\n    \/**\n     * Create an impossible bucket.\n     * This is useful if you are comparing cur_bucket to last_bucket\n     * and you want to make sure last_bucket starts out as something\n     * impossible.\n     *\/\n    inline void make_bad() {\n\tset_bucket(0.0, 0.0);\n\tlon = -1000;\n    }\n\n    \/**\n     * Generate the unique scenery tile index for this bucket\n     *\n     * The index is constructed as follows:\n     * \n     * 9 bits - to represent 360 degrees of longitude (-180 to 179)\n     * 8 bits - to represent 180 degrees of latitude (-90 to 89)\n     *\n     * Each 1 degree by 1 degree tile is further broken down into an 8x8\n     * grid.  So we also need:\n     *\n     * 3 bits - to represent x (0 to 7)\n     * 3 bits - to represent y (0 to 7)\n     * @return tile index\n     *\/\n    inline long int gen_index() const {\n\treturn ((lon + 180) << 14) + ((lat + 90) << 6) + (y << 3) + x;\n    }\n\n    \/**\n     * Generate the unique scenery tile index for this bucket in ascii\n     * string form.\n     * @return tile index in string form\n     *\/\n    inline string gen_index_str() const {\n\tchar tmp[20];\n\tsprintf(tmp, \"%ld\", \n                (((long)lon + 180) << 14) + ((lat + 90) << 6) + (y << 3) + x);\n\treturn (string)tmp;\n    }\n\n    \/**\n     * Build the base path name for this bucket.\n     * @return base path in string form\n     *\/\n    string gen_base_path() const;\n\n    \/**\n     * @return the center lon of a tile.\n     *\/\n    inline double get_center_lon() const {\n\tdouble span = sg_bucket_span( lat + y \/ 8.0 + SG_HALF_BUCKET_SPAN );\n\n\tif ( span >= 1.0 ) {\n\t    return lon + span \/ 2.0;\n\t} else {\n\t    return lon + x * span + span \/ 2.0;\n\t}\n    }\n\n    \/**\n     * @return the center lat of a tile.\n     *\/\n    inline double get_center_lat() const {\n\treturn lat + y \/ 8.0 + SG_HALF_BUCKET_SPAN;\n    }\n\n    \/**\n     * @return the width of the tile in degrees.\n     *\/\n    double get_width() const;\n\n    \/**\n     * @return the height of the tile in degrees.\n     *\/\n    double get_height() const;\n\n    \/**\n     * @return the width of the tile in meters.\n     *\/\n    double get_width_m() const; \n\n    \/**\n     * @return the height of the tile in meters.\n     *\/\n    double get_height_m() const;\n \n    \/\/ Informational methods.\n\n    \/**\n     * @return the lon of the lower left corner of \n     * the 1x1 chunk containing this tile.\n     *\/\n    inline int get_lon() const { return lon; }\n\n    \/**\n     * @return the lat of the lower left corner of \n     * the 1x1 chunk containing this tile.\n     *\/\n    inline int get_lat() const { return lat; }\n\n    \/**\n     * @return the x coord within the 1x1 degree chunk this tile.\n     *\/\n    inline int get_x() const { return x; }\n\n    \/**\n     * @return the y coord within the 1x1 degree chunk this tile.\n     *\/\n    inline int get_y() const { return y; }\n\n    \/\/ friends\n\n    friend ostream& operator<< ( ostream&, const SGBucket& );\n    friend bool operator== ( const SGBucket&, const SGBucket& );\n};\n\n\n\/**\n * \\relates SGBucket\n * Return the bucket which is offset from the specified dlon, dlat by\n * the specified tile units in the X & Y direction.\n * @param dlon starting lon in degrees\n * @param dlat starting lat in degrees\n * @param x number of bucket units to offset in x (lon) direction\n * @param y number of bucket units to offset in y (lat) direction\n * @return offset bucket\n *\/\nSGBucket sgBucketOffset( double dlon, double dlat, int x, int y );\n\n\n\/**\n * \\relates SGBucket\n * Calculate the offset between two buckets (in quantity of buckets).\n * @param b1 bucket 1\n * @param b2 bucket 2\n * @param dx offset distance (lon) in tile units\n * @param dy offset distance (lat) in tile units\n *\/\nvoid sgBucketDiff( const SGBucket& b1, const SGBucket& b2, int *dx, int *dy );\n\n\n\/**\n * Write the bucket lon, lat, x, and y to the output stream.\n * @param out output stream\n * @param b bucket\n *\/\ninline ostream&\noperator<< ( ostream& out, const SGBucket& b )\n{\n    return out << b.lon << \":\" << b.x << \", \" << b.lat << \":\" << b.y;\n}\n\n\n\/**\n * Compare two bucket structures for equality.\n * @param b1 bucket 1\n * @param b2 bucket 2\n * @return comparison result\n *\/\ninline bool\noperator== ( const SGBucket& b1, const SGBucket& b2 )\n{\n    return ( b1.lon == b2.lon &&\n\t     b1.lat == b2.lat &&\n\t     b1.x == b2.x &&\n\t     b1.y == b2.y );\n}\n\n\n#endif \/\/ _NEWBUCKET_HXX\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ------------------------------------------------------------------------\n\/\/ audioio-rtnull.cpp: Null audio object with realtime behaviour\n\/\/ Copyright (C) 1999,2002 Kai Vehmanen (kai.vehmanen@wakkanet.fi)\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#include <cmath>\n#include <iostream>\n#include <string>\n#include <time.h>\n\n#include <kvutils\/dbc.h>\n#include <kvutils\/kvutils.h>\n\n#include \"audioio-device.h\"\n#include \"audioio-rtnull.h\"\n\n#include \"eca-error.h\"\n#include \"eca-debug.h\"\n\nusing std::cerr;\nusing std::endl;\n\n\/** \n * Definitions from glibc's sys\/time.h\n *\/\n\n#ifndef timerclear\n#define\ttimerclear(tvp)\t\t((tvp)->tv_sec = (tvp)->tv_usec = 0)\n#endif\n\n#ifndef timeradd\n#define\ttimeradd(a, b, result)\t\t\t\t\t\t      \\\n  do {\t\t\t\t\t\t\t\t\t      \\\n    (result)->tv_sec = (a)->tv_sec + (b)->tv_sec;\t\t\t      \\\n    (result)->tv_usec = (a)->tv_usec + (b)->tv_usec;\t\t\t      \\\n    if ((result)->tv_usec >= 1000000)\t\t\t\t\t      \\\n      {\t\t\t\t\t\t\t\t\t      \\\n\t++(result)->tv_sec;\t\t\t\t\t\t      \\\n\t(result)->tv_usec -= 1000000;\t\t\t\t\t      \\\n      }\t\t\t\t\t\t\t\t\t      \\\n  } while (0)\n#endif\n\n#ifndef timercmp\n#define\ttimercmp(a, b, CMP) \t\t\t\t\t\t      \\\n  (((a)->tv_sec == (b)->tv_sec) ? \t\t\t\t\t      \\\n   ((a)->tv_usec CMP (b)->tv_usec) : \t\t\t\t\t      \\\n   ((a)->tv_sec CMP (b)->tv_sec))\n#endif\n\n#ifndef timersub\n#define\ttimersub(a, b, result) \\\ndo { \\\n\t(result)->tv_sec = (a)->tv_sec - (b)->tv_sec; \\\n\t(result)->tv_usec = (a)->tv_usec - (b)->tv_usec; \\\n\tif ((result)->tv_usec < 0) { \\\n\t\t--(result)->tv_sec; \\\n\t\t(result)->tv_usec += 1000000; \\\n\t} \\\n} while (0)\n#endif\n\n\/**\n * Function definitions\n *\/\n\nREALTIME_NULL::REALTIME_NULL(const std::string& name)\n{\n}\n\nREALTIME_NULL::~REALTIME_NULL(void)\n{ \n  if (is_open() == true && is_running()) stop();\n\n  if (is_open() == true) {\n    close();\n  }\n}\n\nvoid REALTIME_NULL::open(void) throw (AUDIO_IO::SETUP_ERROR &)\n{\n  ecadebug->msg(ECA_DEBUG::user_objects, \"(audioio-rtnull) open\");\n\n  double t = static_cast<double>(buffersize()) \/ samples_per_second();\n\n  buffer_length_rep.tv_sec = static_cast<time_t>(floor(t));\n  buffer_length_rep.tv_usec = static_cast<long>((t - buffer_length_rep.tv_sec) * 1000000.0);\n\n  total_buffers_rep = 2;\n  if (max_buffers() == true) { \n    total_buffers_rep = 3;\n  }\n  total_buffer_length_rep.tv_sec = total_buffers_rep * buffer_length_rep.tv_sec;\n  total_buffer_length_rep.tv_usec = total_buffers_rep * buffer_length_rep.tv_usec;\n\n  AUDIO_IO_DEVICE::open();\n}\n\nvoid REALTIME_NULL::close(void)\n{\n  AUDIO_IO_DEVICE::close();\n}\n\nvoid REALTIME_NULL::prepare(void)\n{\n  ecadebug->msg(ECA_DEBUG::user_objects, \"(audioio-rtnull) prepare\");\n\n  timerclear(&data_processed_rep);\n\n  AUDIO_IO_DEVICE::prepare();\n}\n\nvoid REALTIME_NULL::start(void)\n{\n  ecadebug->msg(ECA_DEBUG::user_objects, \"(audioio-rtnull) start\");\n\n  gettimeofday(&start_time_rep, NULL);\n\n  AUDIO_IO_DEVICE::start();\n}\n\nvoid REALTIME_NULL::stop(void)\n{\n  ecadebug->msg(ECA_DEBUG::user_objects, \"(audioio-rtnull) stop\");\n\n  AUDIO_IO_DEVICE::stop();\n}\n\n\/**\n * Calculates 'time_since_start_rep'.\n *\/\nvoid REALTIME_NULL::calculate_device_position(void)\n{\n  struct timeval now;\n  gettimeofday(&now, NULL);\n\n  timersub(&now, &start_time_rep, &time_since_start_rep);\n}\n\n\/**\n * Calculates 'avail_data_rep'.\n *\/\nvoid REALTIME_NULL::calculate_available_data(void)\n{ \n  if (io_mode() == io_read) {\n    \/* capture: device is always ahead *\/\n    timersub(&time_since_start_rep, &data_processed_rep, &avail_data_rep);\n  }\n  else {\n    \/* playback: device is always behind *\/\n    struct timeval diff;\n    timersub(&data_processed_rep, &time_since_start_rep, &diff);\n    timersub(&total_buffer_length_rep, &diff, &avail_data_rep);\n  }\n  if (timercmp(&avail_data_rep, &total_buffer_length_rep, >)) {\n    cerr << \"(audioio-rtnull) xrun occured!\" << endl;\n  }\n} \n\nvoid REALTIME_NULL::block_until_data_available(void) \n{\n  calculate_device_position();\n  calculate_available_data();\n\n  while (timercmp(&avail_data_rep, &buffer_length_rep, <)) {\n    struct timeval delay;\n    struct timespec ndelay;\n\n    timersub(&buffer_length_rep, &avail_data_rep, &delay);\n\n    ndelay.tv_sec = delay.tv_sec;\n    ndelay.tv_nsec = delay.tv_usec * 1000;\n    \/\/ cerr << \"(audioio-rtnull) sleeping for: \" << ndelay.tv_sec << \" sec, \" << ndelay.tv_nsec << \" nanoseconds.\\n\";\n    nanosleep(&ndelay, NULL);\n\n    calculate_device_position();\n    calculate_available_data();\n  }\n}\n\nlong int REALTIME_NULL::read_samples(void* target_buffer,\n\t\t\t\t     long int samples)\n{\n  DBC_CHECK(is_running() == true);\n\n  for(int n = 0; n < samples * frame_size(); n++) ((char*)target_buffer)[n] = 0;\n\n  block_until_data_available();\n\n  \/* read one buffer of audio *\/\n  timeradd(&data_processed_rep, &buffer_length_rep, &data_processed_rep);\n\n  return(buffersize());\n}\n\nvoid REALTIME_NULL::write_samples(void* target_buffer, \n\t\t\t\t  long int samples)\n{ \n  if (is_running() != true) {\n    \/* prefill phase *\/\n\n    \/* write one buffer of audio *\/\n    timeradd(&data_processed_rep, &buffer_length_rep, &data_processed_rep);\n  }\n  else {\n    \/* block until write space available *\/\n    block_until_data_available();\n  \n    \/* write one buffer of audio *\/\n    timeradd(&data_processed_rep, &buffer_length_rep, &data_processed_rep);\n  }\n}\n\nlong int REALTIME_NULL::prefill_space(void) const\n{\n  if (io_mode() != io_read) return(total_buffers_rep * buffersize());\n}\n\nlong int REALTIME_NULL::delay(void) const\n{ \n  long int delay = 0;\n\n  if (is_running() == true) {\n    calculate_available_data();\n    \n    double time = avail_data_rep.tv_sec * 1000000.0 + avail_data_rep.tv_usec;\n    delay = static_cast<SAMPLE_SPECS::sample_pos_t>\n      (time * samples_per_second() \/ 1000000.0);\n  }\n\n  DBC_CHECK(delay >= 0);\n  return(delay);\n}\n<commit_msg>Minor fixes; added missing const.<commit_after>\/\/ ------------------------------------------------------------------------\n\/\/ audioio-rtnull.cpp: Null audio object with realtime behaviour\n\/\/ Copyright (C) 1999,2002 Kai Vehmanen (kai.vehmanen@wakkanet.fi)\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#include <cmath>\n#include <iostream>\n#include <string>\n#include <time.h>\n\n#include <kvutils\/dbc.h>\n#include <kvutils\/kvutils.h>\n\n#include \"audioio-device.h\"\n#include \"audioio-rtnull.h\"\n\n#include \"eca-error.h\"\n#include \"eca-debug.h\"\n\nusing std::cerr;\nusing std::endl;\n\n\/** \n * Definitions from glibc's sys\/time.h\n *\/\n\n#ifndef timerclear\n#define\ttimerclear(tvp)\t\t((tvp)->tv_sec = (tvp)->tv_usec = 0)\n#endif\n\n#ifndef timeradd\n#define\ttimeradd(a, b, result)\t\t\t\t\t\t      \\\n  do {\t\t\t\t\t\t\t\t\t      \\\n    (result)->tv_sec = (a)->tv_sec + (b)->tv_sec;\t\t\t      \\\n    (result)->tv_usec = (a)->tv_usec + (b)->tv_usec;\t\t\t      \\\n    if ((result)->tv_usec >= 1000000)\t\t\t\t\t      \\\n      {\t\t\t\t\t\t\t\t\t      \\\n\t++(result)->tv_sec;\t\t\t\t\t\t      \\\n\t(result)->tv_usec -= 1000000;\t\t\t\t\t      \\\n      }\t\t\t\t\t\t\t\t\t      \\\n  } while (0)\n#endif\n\n#ifndef timercmp\n#define\ttimercmp(a, b, CMP) \t\t\t\t\t\t      \\\n  (((a)->tv_sec == (b)->tv_sec) ? \t\t\t\t\t      \\\n   ((a)->tv_usec CMP (b)->tv_usec) : \t\t\t\t\t      \\\n   ((a)->tv_sec CMP (b)->tv_sec))\n#endif\n\n#ifndef timersub\n#define\ttimersub(a, b, result) \\\ndo { \\\n\t(result)->tv_sec = (a)->tv_sec - (b)->tv_sec; \\\n\t(result)->tv_usec = (a)->tv_usec - (b)->tv_usec; \\\n\tif ((result)->tv_usec < 0) { \\\n\t\t--(result)->tv_sec; \\\n\t\t(result)->tv_usec += 1000000; \\\n\t} \\\n} while (0)\n#endif\n\n\/**\n * Function definitions\n *\/\n\nREALTIME_NULL::REALTIME_NULL(const std::string& name)\n{\n}\n\nREALTIME_NULL::~REALTIME_NULL(void)\n{ \n  if (is_open() == true && is_running()) stop();\n\n  if (is_open() == true) {\n    close();\n  }\n}\n\nvoid REALTIME_NULL::open(void) throw (AUDIO_IO::SETUP_ERROR &)\n{\n  ecadebug->msg(ECA_DEBUG::user_objects, \"(audioio-rtnull) open\");\n\n  double t = static_cast<double>(buffersize()) \/ samples_per_second();\n\n  buffer_length_rep.tv_sec = static_cast<time_t>(floor(t));\n  buffer_length_rep.tv_usec = static_cast<long>((t - buffer_length_rep.tv_sec) * 1000000.0);\n\n  total_buffers_rep = 2;\n  if (max_buffers() == true) { \n    total_buffers_rep = 3;\n  }\n  total_buffer_length_rep.tv_sec = total_buffers_rep * buffer_length_rep.tv_sec;\n  total_buffer_length_rep.tv_usec = total_buffers_rep * buffer_length_rep.tv_usec;\n\n  AUDIO_IO_DEVICE::open();\n}\n\nvoid REALTIME_NULL::close(void)\n{\n  AUDIO_IO_DEVICE::close();\n}\n\nvoid REALTIME_NULL::prepare(void)\n{\n  ecadebug->msg(ECA_DEBUG::user_objects, \"(audioio-rtnull) prepare\");\n\n  timerclear(&data_processed_rep);\n\n  AUDIO_IO_DEVICE::prepare();\n}\n\nvoid REALTIME_NULL::start(void)\n{\n  ecadebug->msg(ECA_DEBUG::user_objects, \"(audioio-rtnull) start\");\n\n  gettimeofday(&start_time_rep, NULL);\n\n  AUDIO_IO_DEVICE::start();\n}\n\nvoid REALTIME_NULL::stop(void)\n{\n  ecadebug->msg(ECA_DEBUG::user_objects, \"(audioio-rtnull) stop\");\n\n  AUDIO_IO_DEVICE::stop();\n}\n\n\/**\n * Calculates 'time_since_start_rep'.\n *\/\nvoid REALTIME_NULL::calculate_device_position(void)\n{\n  struct timeval now;\n  gettimeofday(&now, NULL);\n\n  timersub(&now, &start_time_rep, &time_since_start_rep);\n}\n\n\/**\n * Calculates 'avail_data_rep'.\n *\/\nvoid REALTIME_NULL::calculate_available_data(void) const\n{ \n  if (io_mode() == io_read) {\n    \/* capture: device is always ahead *\/\n    timersub(&time_since_start_rep, &data_processed_rep, &avail_data_rep);\n  }\n  else {\n    \/* playback: device is always behind *\/\n    struct timeval diff;\n    timersub(&data_processed_rep, &time_since_start_rep, &diff);\n    timersub(&total_buffer_length_rep, &diff, &avail_data_rep);\n  }\n  if (timercmp(&avail_data_rep, &total_buffer_length_rep, >)) {\n    cerr << \"(audioio-rtnull) xrun occured!\" << endl;\n  }\n} \n\nvoid REALTIME_NULL::block_until_data_available(void) \n{\n  calculate_device_position();\n  calculate_available_data();\n\n  while (timercmp(&avail_data_rep, &buffer_length_rep, <)) {\n    struct timeval delay;\n    struct timespec ndelay;\n\n    timersub(&buffer_length_rep, &avail_data_rep, &delay);\n\n    ndelay.tv_sec = delay.tv_sec;\n    ndelay.tv_nsec = delay.tv_usec * 1000;\n    \/\/ cerr << \"(audioio-rtnull) sleeping for: \" << ndelay.tv_sec << \" sec, \" << ndelay.tv_nsec << \" nanoseconds.\\n\";\n    nanosleep(&ndelay, NULL);\n\n    calculate_device_position();\n    calculate_available_data();\n  }\n}\n\nlong int REALTIME_NULL::read_samples(void* target_buffer,\n\t\t\t\t     long int samples)\n{\n  DBC_CHECK(is_running() == true);\n\n  for(int n = 0; n < samples * frame_size(); n++) ((char*)target_buffer)[n] = 0;\n\n  block_until_data_available();\n\n  \/* read one buffer of audio *\/\n  timeradd(&data_processed_rep, &buffer_length_rep, &data_processed_rep);\n\n  return(buffersize());\n}\n\nvoid REALTIME_NULL::write_samples(void* target_buffer, \n\t\t\t\t  long int samples)\n{ \n  if (is_running() != true) {\n    \/* prefill phase *\/\n\n    \/* write one buffer of audio *\/\n    timeradd(&data_processed_rep, &buffer_length_rep, &data_processed_rep);\n  }\n  else {\n    \/* block until write space available *\/\n    block_until_data_available();\n  \n    \/* write one buffer of audio *\/\n    timeradd(&data_processed_rep, &buffer_length_rep, &data_processed_rep);\n  }\n}\n\nlong int REALTIME_NULL::prefill_space(void) const\n{\n  if (io_mode() != io_read) return(total_buffers_rep * buffersize());\n}\n\nlong int REALTIME_NULL::delay(void) const\n{ \n  long int delay = 0;\n\n  if (is_running() == true) {\n    calculate_available_data();\n    \n    double time = avail_data_rep.tv_sec * 1000000.0 + avail_data_rep.tv_usec;\n    delay = static_cast<SAMPLE_SPECS::sample_pos_t>\n      (time * samples_per_second() \/ 1000000.0);\n  }\n\n  DBC_CHECK(delay >= 0);\n  return(delay);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"AssimpObjectManager.hpp\"\n#include \"AssimpLoader.h\"\n#include \"EntityManager.hpp\"\n\n#include <OgreSceneManager.h>\n\n#include \"OgreObjectComponent.hpp\"\n#include \"components\/GraphicsComponent.hpp\"\n\n#include <filesystem>\n\nstatic AssimpLoader g_assimp;\n\nAssimpObjectManager::AssimpObjectManager(kengine::EntityManager & em, Ogre::SceneManager & sceneManager)\n\t: _em(em), _sceneManager(sceneManager)\n{\n}\n\nvoid AssimpObjectManager::registerEntity(kengine::Entity & e) noexcept {\n\tif (!e.has<kengine::GraphicsComponent>())\n\t\treturn;\n\n\tconst auto & graphics = e.get<kengine::GraphicsComponent>();\n\n\tOgreObjectComponent comp;\n\n\tOgre::String finalName = graphics.appearance.c_str();\n\tOgre::String extension, path;\n\tOgre::StringUtil::splitFullFilename(graphics.appearance.c_str(), finalName, extension, path);\n\n\tif (extension == \"mesh\")\n\t\treturn;\n\n\tfinalName = finalName + \"_\" + extension + \".mesh\";\n\tconst auto fullPath = path + finalName;\n\n\tauto & resourceGroupManager = Ogre::ResourceGroupManager::getSingleton();\n\n\tif (!std::filesystem::exists(fullPath.c_str())) {\n\t\tAssimpLoader::AssOptions options;\n\t\toptions.source = graphics.appearance;\n\t\tif (!g_assimp.convert(options))\n\t\t\treturn;\n\t}\n\n\t\/\/ Cleanup after AssimpLoader::convert\n\tresourceGroupManager.removeResourceLocation(path);\n\tresourceGroupManager.removeResourceLocation(\".\/resources\");\n\n\tif (!resourceGroupManager.resourceLocationExists(path)) {\n\t\tresourceGroupManager.addResourceLocation(path, \"FileSystem\");\n\t\tresourceGroupManager.initialiseAllResourceGroups();\n\t}\n\n\n\tcomp.entity = _sceneManager.createEntity(finalName);\n\tcomp.node = _sceneManager.getRootSceneNode()->createChildSceneNode();\n\tcomp.node->attachObject(comp.entity);\n\n\te += comp;\n}<commit_msg>made AssimpObjectManager use separate resource groups<commit_after>#include \"AssimpObjectManager.hpp\"\n#include \"AssimpLoader.h\"\n#include \"EntityManager.hpp\"\n\n#include <OgreSceneManager.h>\n\n#include \"OgreObjectComponent.hpp\"\n#include \"components\/GraphicsComponent.hpp\"\n\n#include <filesystem>\n\nAssimpObjectManager::AssimpObjectManager(kengine::EntityManager & em, Ogre::SceneManager & sceneManager)\n\t: _em(em), _sceneManager(sceneManager)\n{\n}\n\nvoid AssimpObjectManager::registerEntity(kengine::Entity & e) noexcept {\n\tif (!e.has<kengine::GraphicsComponent>())\n\t\treturn;\n\n\tconst auto & graphics = e.get<kengine::GraphicsComponent>();\n\n\tOgreObjectComponent comp;\n\n\tOgre::String finalName = graphics.appearance.c_str();\n\tOgre::String extension, path;\n\tOgre::StringUtil::splitFullFilename(graphics.appearance.c_str(), finalName, extension, path);\n\n\tif (extension == \"mesh\")\n\t\treturn;\n\n\tfinalName = finalName + \"_\" + extension + \".mesh\";\n\tconst auto fullPath = path + finalName;\n\n\tauto & resourceGroupManager = Ogre::ResourceGroupManager::getSingleton();\n\n\tif (!std::filesystem::exists(fullPath.c_str())) {\n\t\tAssimpLoader::AssOptions options;\n\t\toptions.source = graphics.appearance;\n\n\t\tAssimpLoader loader;\n\t\tif (!loader.convert(options))\n\t\t\treturn;\n\t\t\/\/ Cleanup after AssimpLoader::convert\n\t\tresourceGroupManager.removeResourceLocation(path);\n\t\tresourceGroupManager.removeResourceLocation(\".\/resources\");\n\t}\n\n\tif (!resourceGroupManager.resourceLocationExists(path)) {\n\t\tresourceGroupManager.addResourceLocation(path, \"FileSystem\", path);\n\t\tresourceGroupManager.initialiseAllResourceGroups();\n\t}\n\n\tcomp.entity = _sceneManager.createEntity(finalName);\n\tcomp.node = _sceneManager.getRootSceneNode()->createChildSceneNode();\n\tcomp.node->attachObject(comp.entity);\n\n\te += comp;\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <memory>\n#include <cmath>\n\n#include \"parse_arguments.h\"\n\nusing namespace std;\n\nstruct Unit\n{\n  using value_type = double;\n  value_type value_{0}, grad_{0};\n  Unit(value_type value, value_type grad) : value_(value), grad_(grad) {}\n};\n\nstatic auto make_unit(Unit::value_type value, Unit::value_type gradient = 0)\n{\n  return std::make_unique<Unit>(value, gradient);\n}\n\nstruct UnaryGate\n{\n  Unit* u0_;\n  unique_ptr<Unit> utop_;\n  virtual Unit* forward(Unit*) = 0;\n  virtual void backward() = 0;\n};\nstruct BinaryGate \n{\n  Unit *u0_,*u1_;\n  unique_ptr<Unit> utop_;\n  virtual Unit* forward (Unit*, Unit*) = 0;\n  virtual void backward() = 0;\n};\n\nstruct Multiply : BinaryGate\n{\n  virtual Unit* forward(Unit* u0, Unit* u1) override \n  {\n    u0_   = u0;\n    u1_   = u1;\n    utop_ = make_unit(u0_->value_ * u1_->value_, 0);\n    return utop_.get();\n  }\n  virtual void backward() override\n  {\n    u0_->grad_ += u1_->value_ * utop_->grad_;\n    u1_->grad_ += u0_->value_ * utop_->grad_;\n  }\n};\n\nstruct Add : BinaryGate\n{\n  virtual Unit* forward(Unit* u0, Unit* u1) override\n  {\n    u0_   = u0;\n    u1_   = u1;\n    utop_ = make_unit(u0_->value_ + u1_->value_,0);\n    return utop_.get();\n  }\n  virtual void backward() override\n  {\n    u0_->grad_ += 1 * utop_->grad_;\n    u1_->grad_ += 1 * utop_->grad_;\n  }\n};\n\nstruct Sigmoid : UnaryGate\n{\n  static auto sig(Unit::value_type x) \n  {\n    return 1\/(1 + std::exp(-x));\n  }\n  static auto grad_sig(Unit::value_type x)\n  {\n    auto s = sig(x);\n    return s*(1-s);\n  }\n  virtual Unit* forward(Unit* u0) override\n  {\n    u0_   = u0;\n    utop_ = make_unit(sig(u0_->value_), 0);\n    return utop_.get();\n  }\n  virtual void backward() override\n  {\n    u0_->grad_ += grad_sig(u0_->value_) * utop_->grad_;\n  }\n};\n\n\n\nint main(int argc, char * argv[])\n{\n  using namespace std;\n\n  auto a0 = make_unit( 1,0);\n  auto b0 = make_unit( 2,0);\n  auto c0 = make_unit(-3,0);\n  auto x0 = make_unit(-1,0);\n  auto y0 = make_unit( 3,0);\n\n  auto a = a0.get();\n  auto b = b0.get();\n  auto c = c0.get();\n  auto x = x0.get();\n  auto y = y0.get();\n\n  auto mulg0 = Multiply{};\n  auto mulg1 = Multiply{};\n  auto addg0 = Add{};\n  auto addg1 = Add{};\n  auto sg0   = Sigmoid{};\n\n  auto forwardNeuron = [&]()\n  {\n    auto ax      = mulg0.forward(a,x);       \/\/ a*x \n    auto by      = mulg1.forward(b,y);       \/\/ b*y;\n    auto axpby   = addg0.forward(ax,by);     \/\/ a*x + b*y\n    auto axpbypc = addg1.forward(axpby,c);   \/\/ a*x + b*y + c\n    auto s       = sg0 .forward(axpbypc);   \/\/ sig(a*x + b*y + c);\n    return s;\n  };\n\n  auto s = forwardNeuron();\n  cout << \"circuit output: \"  << s->value_ << endl;\n\n  s->grad_ = 1.0;\n\n  sg0  .backward();\n  addg1.backward();\n  addg0.backward();\n  mulg1.backward();\n  mulg0.backward();\n\n  auto step_size = 0.01;\n  a->value_ += step_size * a->grad_;\n  b->value_ += step_size * b->grad_;\n  c->value_ += step_size * c->grad_;\n  x->value_ += step_size * x->grad_;\n  y->value_ += step_size * y->grad_;\n\n  auto s1 = forwardNeuron();\n  cout << \"circuit output after one backprop: \"  << s1->value_ << endl;\n\n\n  return 0;\n}\n<commit_msg>backprop works<commit_after>#include <iostream>\n#include <memory>\n#include <cmath>\n\n#include \"parse_arguments.h\"\n\nusing namespace std;\n\nstruct Unit\n{\n  using value_type = double;\n  value_type value_{0}, grad_{0};\n  Unit(value_type value, value_type grad) : value_(value), grad_(grad) {}\n};\n\nstatic auto make_unit(Unit::value_type value, Unit::value_type gradient = 0)\n{\n  return std::make_unique<Unit>(value, gradient);\n}\n\nstruct UnaryGate\n{\n  Unit* u0_;\n  unique_ptr<Unit> utop_;\n  virtual Unit* forward(Unit*) = 0;\n  virtual Unit* forward(Unit &u0)\n  {\n    return forward(&u0);\n  }\n  virtual void backward() = 0;\n};\nstruct BinaryGate \n{\n  Unit *u0_,*u1_;\n  unique_ptr<Unit> utop_;\n  virtual Unit* forward (Unit*, Unit*) = 0;\n  virtual Unit* forward (Unit &u0, Unit &u1)  {    return forward(&u0, &u1); }\n  virtual Unit* forward (Unit &u0, Unit *u1)  {    return forward(&u0,  u1); }\n  virtual Unit* forward (Unit *u0, Unit &u1)  {    return forward( u0, &u1); }\n  virtual void backward() = 0;\n};\n\nstruct Multiply : BinaryGate\n{\n  virtual Unit* forward(Unit* u0, Unit* u1) override \n  {\n    u0_   = u0;\n    u1_   = u1;\n    utop_ = make_unit(u0_->value_ * u1_->value_, 0);\n    return utop_.get();\n  }\n  using BinaryGate::forward;\n  virtual void backward() override\n  {\n    u0_->grad_ += u1_->value_ * utop_->grad_;\n    u1_->grad_ += u0_->value_ * utop_->grad_;\n  }\n};\n\nstruct Add : BinaryGate\n{\n  virtual Unit* forward(Unit* u0, Unit* u1) override\n  {\n    u0_   = u0;\n    u1_   = u1;\n    utop_ = make_unit(u0_->value_ + u1_->value_,0);\n    return utop_.get();\n  }\n  using BinaryGate::forward;\n  virtual void backward() override\n  {\n    u0_->grad_ += 1 * utop_->grad_;\n    u1_->grad_ += 1 * utop_->grad_;\n  }\n};\n\nstruct Sigmoid : UnaryGate\n{\n  static auto sig(Unit::value_type x) \n  {\n    return 1\/(1 + std::exp(-x));\n  }\n  static auto grad_sig(Unit::value_type x)\n  {\n    auto s = sig(x);\n    return s*(1-s);\n  }\n  virtual Unit* forward(Unit* u0) override\n  {\n    u0_   = u0;\n    utop_ = make_unit(sig(u0_->value_), 0);\n    return utop_.get();\n  }\n  virtual void backward() override\n  {\n    u0_->grad_ += grad_sig(u0_->value_) * utop_->grad_;\n  }\n};\n\n\n\nint main(int argc, char * argv[])\n{\n  using namespace std;\n\n  auto a = Unit{ 1,0};\n  auto b = Unit{ 2,0};\n  auto c = Unit{-3,0};\n  auto x = Unit{-1,0};\n  auto y = Unit{ 3,0};\n\n  auto mulg0 = Multiply{};\n  auto mulg1 = Multiply{};\n  auto addg0 = Add{};\n  auto addg1 = Add{};\n  auto sg0   = Sigmoid{};\n\n  auto forwardNeuron = [&]()\n  {\n    auto ax      = mulg0.forward(a,x);       \/\/ a*x \n    auto by      = mulg1.forward(b,y);       \/\/ b*y;\n    auto axpby   = addg0.forward(ax,by);     \/\/ a*x + b*y\n    auto axpbypc = addg1.forward(axpby,c);   \/\/ a*x + b*y + c\n    auto s       = sg0 .forward(axpbypc);   \/\/ sig(a*x + b*y + c);\n    return s;\n  };\n\n  auto s = forwardNeuron();\n  cout << \"circuit output: \"  << s->value_ << endl;\n\n  s->grad_ = 1.0;\n\n  sg0  .backward();\n  addg1.backward();\n  addg0.backward();\n  mulg1.backward();\n  mulg0.backward();\n\n  auto step_size = 0.01;\n  a.value_ += step_size * a.grad_;\n  b.value_ += step_size * b.grad_;\n  c.value_ += step_size * c.grad_;\n  x.value_ += step_size * x.grad_;\n  y.value_ += step_size * y.grad_;\n\n  auto s1 = forwardNeuron();\n  cout << \"circuit output after one backprop: \"  << s1->value_ << endl;\n\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE TEST_COMPASS\n#include \"boost\/test\/unit_test.hpp\"\n\n#include <vector>\n#include <iostream>\n#include <string>\n#include <algorithm>\n\n#include \"compass.hpp\"\n#include \"compass_fixture.hpp\"\n\nBOOST_AUTO_TEST_SUITE( compass_fundamentals )\n\nBOOST_AUTO_TEST_CASE( compass_works_at_runtime ){\n\n  auto value = compass::runtime::works();\n\n  BOOST_CHECK(value);\n\n}\n\nBOOST_AUTO_TEST_CASE( compass_yields_vendor_name ){\n\n  auto value = compass::runtime::vendor();\n  BOOST_CHECK_NE(value.size(),0u);\n\n}\nBOOST_AUTO_TEST_SUITE_END()\n\nBOOST_FIXTURE_TEST_SUITE( machine_specific, host_reference )\n\nBOOST_AUTO_TEST_CASE( vendor_right  ){\n\n  auto value = compass::runtime::vendor();\n\n  BOOST_CHECK_NE(value.size(),0u);\n\n  std::transform(value.begin(), value.end(),\n         value.begin(),\n         ::tolower);\n\n  \/\/  std::cout << \"vendor \" << value << \" =?= \"<<  expected_vendor << \"\\n\";\n  BOOST_CHECK(value.find(expected_vendor)!=std::string::npos);\n\n}\n\nBOOST_AUTO_TEST_CASE( ncores_right  ){\n\n  auto value = compass::runtime::ncores();\n\n  BOOST_CHECK_NE(value,0);\n  BOOST_CHECK_EQUAL(value,expected_ncores);\n}\n\nBOOST_AUTO_TEST_CASE( has_sse_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse2_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse2());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse2);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse3_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse3());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse3);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse4_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse4());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse4);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_avx_right  ){\n\n  auto value = compass::runtime::has(compass::feature::avx());\n\n  BOOST_CHECK_EQUAL(value,expected_has_avx);\n\n}\n\n\nBOOST_AUTO_TEST_CASE( has_avx2_right  ){\n\n  auto value = compass::runtime::has(compass::feature::avx2());\n\n  BOOST_CHECK_EQUAL(value,expected_has_avx2);\n\n}\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>removed obsolete comment<commit_after>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE TEST_COMPASS\n#include \"boost\/test\/unit_test.hpp\"\n\n#include <vector>\n#include <iostream>\n#include <string>\n#include <algorithm>\n\n#include \"compass.hpp\"\n#include \"compass_fixture.hpp\"\n\nBOOST_AUTO_TEST_SUITE( compass_fundamentals )\n\nBOOST_AUTO_TEST_CASE( compass_works_at_runtime ){\n\n  auto value = compass::runtime::works();\n\n  BOOST_CHECK(value);\n\n}\n\nBOOST_AUTO_TEST_CASE( compass_yields_vendor_name ){\n\n  auto value = compass::runtime::vendor();\n  BOOST_CHECK_NE(value.size(),0u);\n\n}\nBOOST_AUTO_TEST_SUITE_END()\n\nBOOST_FIXTURE_TEST_SUITE( machine_specific, host_reference )\n\nBOOST_AUTO_TEST_CASE( vendor_right  ){\n\n  auto value = compass::runtime::vendor();\n\n  BOOST_CHECK_NE(value.size(),0u);\n\n  std::transform(value.begin(), value.end(),\n         value.begin(),\n         ::tolower);\n\n  BOOST_CHECK(value.find(expected_vendor)!=std::string::npos);\n\n}\n\nBOOST_AUTO_TEST_CASE( ncores_right  ){\n\n  auto value = compass::runtime::ncores();\n\n  BOOST_CHECK_NE(value,0);\n  BOOST_CHECK_EQUAL(value,expected_ncores);\n}\n\nBOOST_AUTO_TEST_CASE( has_sse_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse2_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse2());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse2);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse3_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse3());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse3);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_sse4_right  ){\n\n  auto value = compass::runtime::has(compass::feature::sse4());\n\n  BOOST_CHECK_EQUAL(value,expected_has_sse4);\n\n}\n\nBOOST_AUTO_TEST_CASE( has_avx_right  ){\n\n  auto value = compass::runtime::has(compass::feature::avx());\n\n  BOOST_CHECK_EQUAL(value,expected_has_avx);\n\n}\n\n\nBOOST_AUTO_TEST_CASE( has_avx2_right  ){\n\n  auto value = compass::runtime::has(compass::feature::avx2());\n\n  BOOST_CHECK_EQUAL(value,expected_has_avx2);\n\n}\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __PROCESS_LIMITER_HPP__\n#define __PROCESS_LIMITER_HPP__\n\n#include <deque>\n\n#include <process\/delay.hpp>\n#include <process\/dispatch.hpp>\n#include <process\/id.hpp>\n#include <process\/future.hpp>\n#include <process\/process.hpp>\n#include <process\/timeout.hpp>\n\n#include <stout\/duration.hpp>\n#include <stout\/foreach.hpp>\n#include <stout\/nothing.hpp>\n\nnamespace process {\n\n\/\/ Forward declaration.\nclass RateLimiterProcess;\n\n\/\/ Provides an abstraction that rate limits the number of \"permits\"\n\/\/ that can be acquired over some duration.\n\/\/ NOTE: Currently, each libprocess Process should use a separate\n\/\/ RateLimiter instance. This is because if multiple processes share\n\/\/ a RateLimiter instance, by the time a process acts on the Future\n\/\/ returned by 'acquire()' another process might have acquired the\n\/\/ next permit and do its rate limited operation.\nclass RateLimiter\n{\npublic:\n  RateLimiter(int permits, const Duration& duration);\n  explicit RateLimiter(double permitsPerSecond);\n  ~RateLimiter();\n\n  \/\/ Returns a future that becomes ready when the permit is acquired.\n  Future<Nothing> acquire();\n\nprivate:\n  \/\/ Not copyable, not assignable.\n  RateLimiter(const RateLimiter&);\n  RateLimiter& operator = (const RateLimiter&);\n\n  RateLimiterProcess* process;\n};\n\n\nclass RateLimiterProcess : public Process<RateLimiterProcess>\n{\npublic:\n  RateLimiterProcess(int permits, const Duration& duration)\n    : ProcessBase(ID::generate(\"__limiter__\"))\n  {\n    CHECK_GT(permits, 0);\n    CHECK_GT(duration.secs(), 0);\n    permitsPerSecond = permits \/ duration.secs();\n  }\n\n  explicit RateLimiterProcess(double _permitsPerSecond)\n    : ProcessBase(ID::generate(\"__limiter__\")),\n      permitsPerSecond(_permitsPerSecond)\n  {\n    CHECK_GT(permitsPerSecond, 0);\n  }\n\n  virtual void finalize()\n  {\n    foreach (Promise<Nothing>* promise, promises) {\n      promise->future().discard();\n      delete promise;\n    }\n    promises.clear();\n  }\n\n  Future<Nothing> acquire()\n  {\n    if (!promises.empty()) {\n      \/\/ Need to wait for others to get permits first.\n      Promise<Nothing>* promise = new Promise<Nothing>();\n      promises.push_back(promise);\n      return promise->future();\n    } if (timeout.remaining() > Seconds(0)) {\n      \/\/ Need to wait a bit longer, but first one in the queue.\n      Promise<Nothing>* promise = new Promise<Nothing>();\n      promises.push_back(promise);\n      delay(timeout.remaining(), self(), &Self::_acquire);\n      return promise->future();\n    }\n\n    \/\/ No need to wait!\n    timeout = Seconds(1) \/ permitsPerSecond;\n    return Nothing();\n  }\n\nprivate:\n  \/\/ Not copyable, not assignable.\n  RateLimiterProcess(const RateLimiterProcess&);\n  RateLimiterProcess& operator = (const RateLimiterProcess&);\n\n  void _acquire()\n  {\n    CHECK(!promises.empty());\n\n    Promise<Nothing>* promise = promises.front();\n    promises.pop_front();\n\n    promise->set(Nothing());\n\n    timeout = Seconds(1) \/ permitsPerSecond;\n\n    \/\/ Repeat if necessary.\n    if (!promises.empty()) {\n      delay(timeout.remaining(), self(), &Self::_acquire);\n    }\n  }\n\n  double permitsPerSecond;\n\n  Timeout timeout;\n\n  std::deque<Promise<Nothing>*> promises;\n};\n\n\ninline RateLimiter::RateLimiter(int permits, const Duration& duration)\n{\n  process = new RateLimiterProcess(permits, duration);\n  spawn(process);\n}\n\n\ninline RateLimiter::RateLimiter(double permitsPerSecond)\n{\n  process = new RateLimiterProcess(permitsPerSecond);\n  spawn(process);\n}\n\n\ninline RateLimiter::~RateLimiter()\n{\n  terminate(process);\n  wait(process);\n  delete process;\n}\n\n\ninline Future<Nothing> RateLimiter::acquire()\n{\n  return dispatch(process, &RateLimiterProcess::acquire);\n}\n\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_LIMITER_HPP__\n<commit_msg>Fixed a memory leak in limiter.hpp.<commit_after>#ifndef __PROCESS_LIMITER_HPP__\n#define __PROCESS_LIMITER_HPP__\n\n#include <deque>\n\n#include <process\/delay.hpp>\n#include <process\/dispatch.hpp>\n#include <process\/id.hpp>\n#include <process\/future.hpp>\n#include <process\/process.hpp>\n#include <process\/timeout.hpp>\n\n#include <stout\/duration.hpp>\n#include <stout\/foreach.hpp>\n#include <stout\/nothing.hpp>\n\nnamespace process {\n\n\/\/ Forward declaration.\nclass RateLimiterProcess;\n\n\/\/ Provides an abstraction that rate limits the number of \"permits\"\n\/\/ that can be acquired over some duration.\n\/\/ NOTE: Currently, each libprocess Process should use a separate\n\/\/ RateLimiter instance. This is because if multiple processes share\n\/\/ a RateLimiter instance, by the time a process acts on the Future\n\/\/ returned by 'acquire()' another process might have acquired the\n\/\/ next permit and do its rate limited operation.\nclass RateLimiter\n{\npublic:\n  RateLimiter(int permits, const Duration& duration);\n  explicit RateLimiter(double permitsPerSecond);\n  ~RateLimiter();\n\n  \/\/ Returns a future that becomes ready when the permit is acquired.\n  Future<Nothing> acquire();\n\nprivate:\n  \/\/ Not copyable, not assignable.\n  RateLimiter(const RateLimiter&);\n  RateLimiter& operator = (const RateLimiter&);\n\n  RateLimiterProcess* process;\n};\n\n\nclass RateLimiterProcess : public Process<RateLimiterProcess>\n{\npublic:\n  RateLimiterProcess(int permits, const Duration& duration)\n    : ProcessBase(ID::generate(\"__limiter__\"))\n  {\n    CHECK_GT(permits, 0);\n    CHECK_GT(duration.secs(), 0);\n    permitsPerSecond = permits \/ duration.secs();\n  }\n\n  explicit RateLimiterProcess(double _permitsPerSecond)\n    : ProcessBase(ID::generate(\"__limiter__\")),\n      permitsPerSecond(_permitsPerSecond)\n  {\n    CHECK_GT(permitsPerSecond, 0);\n  }\n\n  virtual void finalize()\n  {\n    foreach (Promise<Nothing>* promise, promises) {\n      promise->future().discard();\n      delete promise;\n    }\n    promises.clear();\n  }\n\n  Future<Nothing> acquire()\n  {\n    if (!promises.empty()) {\n      \/\/ Need to wait for others to get permits first.\n      Promise<Nothing>* promise = new Promise<Nothing>();\n      promises.push_back(promise);\n      return promise->future();\n    } if (timeout.remaining() > Seconds(0)) {\n      \/\/ Need to wait a bit longer, but first one in the queue.\n      Promise<Nothing>* promise = new Promise<Nothing>();\n      promises.push_back(promise);\n      delay(timeout.remaining(), self(), &Self::_acquire);\n      return promise->future();\n    }\n\n    \/\/ No need to wait!\n    timeout = Seconds(1) \/ permitsPerSecond;\n    return Nothing();\n  }\n\nprivate:\n  \/\/ Not copyable, not assignable.\n  RateLimiterProcess(const RateLimiterProcess&);\n  RateLimiterProcess& operator = (const RateLimiterProcess&);\n\n  void _acquire()\n  {\n    CHECK(!promises.empty());\n\n    Promise<Nothing>* promise = promises.front();\n    promises.pop_front();\n\n    promise->set(Nothing());\n    delete promise;\n\n    timeout = Seconds(1) \/ permitsPerSecond;\n\n    \/\/ Repeat if necessary.\n    if (!promises.empty()) {\n      delay(timeout.remaining(), self(), &Self::_acquire);\n    }\n  }\n\n  double permitsPerSecond;\n\n  Timeout timeout;\n\n  std::deque<Promise<Nothing>*> promises;\n};\n\n\ninline RateLimiter::RateLimiter(int permits, const Duration& duration)\n{\n  process = new RateLimiterProcess(permits, duration);\n  spawn(process);\n}\n\n\ninline RateLimiter::RateLimiter(double permitsPerSecond)\n{\n  process = new RateLimiterProcess(permitsPerSecond);\n  spawn(process);\n}\n\n\ninline RateLimiter::~RateLimiter()\n{\n  terminate(process);\n  wait(process);\n  delete process;\n}\n\n\ninline Future<Nothing> RateLimiter::acquire()\n{\n  return dispatch(process, &RateLimiterProcess::acquire);\n}\n\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_LIMITER_HPP__\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>VKSC check offline pipeline compiler result.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014 Google Inc. All rights reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style\n\/\/ license that can be found in the LICENSE file or at\n\/\/ https:\/\/developers.google.com\/open-source\/licenses\/bsd\n\n#include \"packager\/media\/formats\/mp4\/encrypting_fragmenter.h\"\n\n#include <limits>\n\n#include \"packager\/media\/base\/aes_encryptor.h\"\n#include \"packager\/media\/base\/aes_pattern_cryptor.h\"\n#include \"packager\/media\/base\/buffer_reader.h\"\n#include \"packager\/media\/base\/key_source.h\"\n#include \"packager\/media\/base\/media_sample.h\"\n#include \"packager\/media\/filters\/nalu_reader.h\"\n#include \"packager\/media\/filters\/vp8_parser.h\"\n#include \"packager\/media\/filters\/vp9_parser.h\"\n#include \"packager\/media\/formats\/mp4\/box_definitions.h\"\n\nnamespace edash_packager {\nnamespace media {\nnamespace mp4 {\n\nnamespace {\nconst size_t kCencBlockSize = 16u;\n\n\/\/ Adds one or more subsamples to |*subsamples|.  This may add more than one\n\/\/ if one of the values overflows the integer in the subsample.\nvoid AddSubsamples(uint64_t clear_bytes,\n                   uint64_t cipher_bytes,\n                   std::vector<SubsampleEntry>* subsamples) {\n  CHECK_LT(cipher_bytes, std::numeric_limits<uint32_t>::max());\n  const uint64_t kUInt16Max = std::numeric_limits<uint16_t>::max();\n  while (clear_bytes > kUInt16Max) {\n    subsamples->push_back(SubsampleEntry(kUInt16Max, 0));\n    clear_bytes -= kUInt16Max;\n  }\n\n  if (clear_bytes > 0 || cipher_bytes > 0)\n    subsamples->push_back(SubsampleEntry(clear_bytes, cipher_bytes));\n}\n\nVideoCodec GetVideoCodec(const StreamInfo& stream_info) {\n  if (stream_info.stream_type() != kStreamVideo)\n    return kUnknownVideoCodec;\n  const VideoStreamInfo& video_stream_info =\n      static_cast<const VideoStreamInfo&>(stream_info);\n  return video_stream_info.codec();\n}\n\nuint8_t GetNaluLengthSize(const StreamInfo& stream_info) {\n  if (stream_info.stream_type() != kStreamVideo)\n    return 0;\n\n  const VideoStreamInfo& video_stream_info =\n      static_cast<const VideoStreamInfo&>(stream_info);\n  return video_stream_info.nalu_length_size();\n}\n}  \/\/ namespace\n\nEncryptingFragmenter::EncryptingFragmenter(\n    scoped_refptr<StreamInfo> info,\n    TrackFragment* traf,\n    scoped_ptr<EncryptionKey> encryption_key,\n    int64_t clear_time,\n    FourCC protection_scheme,\n    uint8_t crypt_byte_block,\n    uint8_t skip_byte_block)\n    : Fragmenter(traf),\n      info_(info),\n      encryption_key_(encryption_key.Pass()),\n      nalu_length_size_(GetNaluLengthSize(*info)),\n      video_codec_(GetVideoCodec(*info)),\n      clear_time_(clear_time),\n      protection_scheme_(protection_scheme),\n      crypt_byte_block_(crypt_byte_block),\n      skip_byte_block_(skip_byte_block) {\n  DCHECK(encryption_key_);\n  switch (video_codec_) {\n    case kCodecVP8:\n      vpx_parser_.reset(new VP8Parser);\n      break;\n    case kCodecVP9:\n      vpx_parser_.reset(new VP9Parser);\n      break;\n    case kCodecH264:\n      header_parser_.reset(new H264VideoSliceHeaderParser);\n      break;\n    case kCodecHVC1:\n      FALLTHROUGH_INTENDED;\n    case kCodecHEV1:\n      header_parser_.reset(new H265VideoSliceHeaderParser);\n      break;\n    default:\n      LOG(WARNING) << \"Unknown video codec '\" << video_codec_\n                   << \"', whole subsamples will be encrypted.\";\n  }\n}\n\nEncryptingFragmenter::~EncryptingFragmenter() {}\n\nStatus EncryptingFragmenter::AddSample(scoped_refptr<MediaSample> sample) {\n  DCHECK(sample);\n  if (!fragment_initialized()) {\n    Status status = InitializeFragment(sample->dts());\n    if (!status.ok())\n      return status;\n  }\n  if (encryptor_) {\n    Status status = EncryptSample(sample);\n    if (!status.ok())\n      return status;\n  }\n  return Fragmenter::AddSample(sample);\n}\n\nStatus EncryptingFragmenter::InitializeFragment(int64_t first_sample_dts) {\n  Status status = Fragmenter::InitializeFragment(first_sample_dts);\n  if (!status.ok())\n    return status;\n\n  if (header_parser_ && !header_parser_->Initialize(info_->extra_data()))\n    return Status(error::MUXER_FAILURE, \"Fail to read SPS and PPS data.\");\n\n  traf()->auxiliary_size.sample_info_sizes.clear();\n  traf()->auxiliary_offset.offsets.clear();\n  if (IsSubsampleEncryptionRequired()) {\n    traf()->sample_encryption.flags |=\n        SampleEncryption::kUseSubsampleEncryption;\n  }\n  traf()->sample_encryption.sample_encryption_entries.clear();\n\n  const bool enable_encryption = clear_time_ <= 0;\n  if (!enable_encryption) {\n    \/\/ This fragment should be in clear text.\n    \/\/ At most two sample description entries, an encrypted entry and a clear\n    \/\/ entry, are generated. The 1-based clear entry index is always 2.\n    const uint32_t kClearSampleDescriptionIndex = 2;\n\n    traf()->header.flags |=\n        TrackFragmentHeader::kSampleDescriptionIndexPresentMask;\n    traf()->header.sample_description_index = kClearSampleDescriptionIndex;\n  }\n  return PrepareFragmentForEncryption(enable_encryption);\n}\n\nvoid EncryptingFragmenter::FinalizeFragment() {\n  if (encryptor_) {\n    DCHECK_LE(clear_time_, 0);\n    FinalizeFragmentForEncryption();\n  } else {\n    DCHECK_GT(clear_time_, 0);\n    clear_time_ -= fragment_duration();\n  }\n  Fragmenter::FinalizeFragment();\n}\n\nStatus EncryptingFragmenter::PrepareFragmentForEncryption(\n    bool enable_encryption) {\n  return (!enable_encryption || encryptor_) ? Status::OK : CreateEncryptor();\n}\n\nvoid EncryptingFragmenter::FinalizeFragmentForEncryption() {\n  \/\/ The offset will be adjusted in Segmenter after knowing moof size.\n  traf()->auxiliary_offset.offsets.push_back(0);\n\n  \/\/ For 'cbcs' scheme, Constant IVs SHALL be used.\n  const size_t per_sample_iv_size =\n      (protection_scheme_ == FOURCC_cbcs) ? 0 : encryptor_->iv().size();\n  traf()->sample_encryption.iv_size = per_sample_iv_size;\n\n  \/\/ Optimize saiz box.\n  SampleAuxiliaryInformationSize& saiz = traf()->auxiliary_size;\n  saiz.sample_count = traf()->runs[0].sample_sizes.size();\n  if (!saiz.sample_info_sizes.empty()) {\n    if (!OptimizeSampleEntries(&saiz.sample_info_sizes,\n                               &saiz.default_sample_info_size)) {\n      saiz.default_sample_info_size = 0;\n    }\n  } else {\n    \/\/ |sample_info_sizes| table is filled in only for subsample encryption,\n    \/\/ otherwise |sample_info_size| is just the IV size.\n    DCHECK(!IsSubsampleEncryptionRequired());\n    saiz.default_sample_info_size = per_sample_iv_size;\n  }\n  \/\/ It should only happen with full sample encryption + constant iv, which is\n  \/\/ not a legal combination.\n  CHECK(!saiz.sample_info_sizes.empty() || saiz.default_sample_info_size != 0);\n}\n\nStatus EncryptingFragmenter::CreateEncryptor() {\n  DCHECK(encryption_key_);\n  scoped_ptr<AesCryptor> encryptor;\n  switch (protection_scheme_) {\n    case FOURCC_cenc:\n      encryptor.reset(new AesCtrEncryptor);\n      break;\n    case FOURCC_cbc1:\n      encryptor.reset(new AesCbcEncryptor(kNoPadding));\n      break;\n    case FOURCC_cens:\n      encryptor.reset(new AesPatternCryptor(\n          crypt_byte_block(), skip_byte_block(), AesCryptor::kDontUseConstantIv,\n          scoped_ptr<AesCryptor>(new AesCtrEncryptor)));\n      break;\n    case FOURCC_cbcs:\n      encryptor.reset(new AesPatternCryptor(\n          crypt_byte_block(), skip_byte_block(), AesCryptor::kUseConstantIv,\n          scoped_ptr<AesCryptor>(new AesCbcEncryptor(kNoPadding))));\n      break;\n    default:\n      return Status(error::MUXER_FAILURE, \"Unsupported protection scheme.\");\n  }\n\n  DCHECK(!encryption_key_->iv.empty());\n  const bool initialized =\n      encryptor->InitializeWithIv(encryption_key_->key, encryption_key_->iv);\n  if (!initialized)\n    return Status(error::MUXER_FAILURE, \"Failed to create the encryptor.\");\n  encryptor_ = encryptor.Pass();\n  return Status::OK;\n}\n\nvoid EncryptingFragmenter::EncryptBytes(uint8_t* data, uint32_t size) {\n  DCHECK(encryptor_);\n  CHECK(encryptor_->Crypt(data, size, data));\n}\n\nStatus EncryptingFragmenter::EncryptSample(scoped_refptr<MediaSample> sample) {\n  DCHECK(encryptor_);\n\n  SampleEncryptionEntry sample_encryption_entry;\n  \/\/ For 'cbcs' scheme, Constant IVs SHALL be used.\n  if (protection_scheme_ != FOURCC_cbcs)\n    sample_encryption_entry.initialization_vector = encryptor_->iv();\n  uint8_t* data = sample->writable_data();\n  if (IsSubsampleEncryptionRequired()) {\n    if (vpx_parser_) {\n      std::vector<VPxFrameInfo> vpx_frames;\n      if (!vpx_parser_->Parse(sample->data(), sample->data_size(),\n                              &vpx_frames)) {\n        return Status(error::MUXER_FAILURE, \"Failed to parse vpx frame.\");\n      }\n\n      const bool is_superframe = vpx_frames.size() > 1;\n      for (const VPxFrameInfo& frame : vpx_frames) {\n        SubsampleEntry subsample;\n        subsample.clear_bytes = frame.uncompressed_header_size;\n        subsample.cipher_bytes =\n            frame.frame_size - frame.uncompressed_header_size;\n\n        \/\/ \"VP Codec ISO Media File Format Binding\" document requires that the\n        \/\/ encrypted bytes of each frame within the superframe must be block\n        \/\/ aligned so that the counter state can be computed for each frame\n        \/\/ within the superframe.\n        \/\/ For AES-CBC mode 'cbc1' scheme, clear data is sized appropriately so\n        \/\/ that the cipher data is block aligned.\n        if (is_superframe || protection_scheme_ == FOURCC_cbc1) {\n          const uint16_t misalign_bytes =\n              subsample.cipher_bytes % kCencBlockSize;\n          subsample.clear_bytes += misalign_bytes;\n          subsample.cipher_bytes -= misalign_bytes;\n        }\n\n        sample_encryption_entry.subsamples.push_back(subsample);\n        if (subsample.cipher_bytes > 0)\n          EncryptBytes(data + subsample.clear_bytes, subsample.cipher_bytes);\n        data += frame.frame_size;\n      }\n    } else {\n      const NaluReader::CodecType nalu_type =\n          (video_codec_ == kCodecHVC1 || video_codec_ == kCodecHEV1)\n              ? NaluReader::kH265\n              : NaluReader::kH264;\n      NaluReader reader(nalu_type, nalu_length_size_, data,\n                        sample->data_size());\n\n      \/\/ Store the current length of clear data.  This is used to squash\n      \/\/ multiple unencrypted NAL units into fewer subsample entries.\n      uint64_t accumulated_clear_bytes = 0;\n\n      Nalu nalu;\n      NaluReader::Result result;\n      while ((result = reader.Advance(&nalu)) == NaluReader::kOk) {\n        if (nalu.is_video_slice()) {\n          \/\/ For video-slice NAL units, encrypt the video slice.  This skips\n          \/\/ the frame header.  If this is an unrecognized codec (e.g. H.265),\n          \/\/ the whole NAL unit will be encrypted.\n          const int64_t video_slice_header_size =\n              header_parser_ ? header_parser_->GetHeaderSize(nalu) : 0;\n          if (video_slice_header_size < 0)\n            return Status(error::MUXER_FAILURE, \"Failed to read slice header.\");\n\n          uint64_t current_clear_bytes =\n              nalu.header_size() + video_slice_header_size;\n          uint64_t cipher_bytes = nalu.payload_size() - video_slice_header_size;\n\n          \/\/ For AES-CBC mode 'cbc1' scheme, clear data is sized appropriately\n          \/\/ so that the cipher data is block aligned.\n          if (protection_scheme_ == FOURCC_cbc1) {\n            const uint16_t misalign_bytes = cipher_bytes % kCencBlockSize;\n            current_clear_bytes += misalign_bytes;\n            cipher_bytes -= misalign_bytes;\n          }\n\n          const uint8_t* nalu_data = nalu.data() + current_clear_bytes;\n          EncryptBytes(const_cast<uint8_t*>(nalu_data), cipher_bytes);\n\n          AddSubsamples(\n              accumulated_clear_bytes + nalu_length_size_ + current_clear_bytes,\n              cipher_bytes, &sample_encryption_entry.subsamples);\n          accumulated_clear_bytes = 0;\n        } else {\n          \/\/ For non-video-slice NAL units, don't encrypt.\n          accumulated_clear_bytes +=\n              nalu_length_size_ + nalu.header_size() + nalu.payload_size();\n        }\n      }\n      if (result != NaluReader::kEOStream)\n        return Status(error::MUXER_FAILURE, \"Failed to parse NAL units.\");\n      AddSubsamples(accumulated_clear_bytes, 0,\n                    &sample_encryption_entry.subsamples);\n    }\n\n    \/\/ The length of per-sample auxiliary datum, defined in CENC ch. 7.\n    traf()->auxiliary_size.sample_info_sizes.push_back(\n        sample_encryption_entry.ComputeSize());\n  } else {\n    EncryptBytes(data, sample->data_size());\n  }\n\n  traf()->sample_encryption.sample_encryption_entries.push_back(\n      sample_encryption_entry);\n  encryptor_->UpdateIv();\n  return Status::OK;\n}\n\nbool EncryptingFragmenter::IsSubsampleEncryptionRequired() {\n  return vpx_parser_ || nalu_length_size_ != 0;\n}\n\n}  \/\/ namespace mp4\n}  \/\/ namespace media\n}  \/\/ namespace edash_packager\n<commit_msg>Fix an unintended warning message<commit_after>\/\/ Copyright 2014 Google Inc. All rights reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style\n\/\/ license that can be found in the LICENSE file or at\n\/\/ https:\/\/developers.google.com\/open-source\/licenses\/bsd\n\n#include \"packager\/media\/formats\/mp4\/encrypting_fragmenter.h\"\n\n#include <limits>\n\n#include \"packager\/media\/base\/aes_encryptor.h\"\n#include \"packager\/media\/base\/aes_pattern_cryptor.h\"\n#include \"packager\/media\/base\/buffer_reader.h\"\n#include \"packager\/media\/base\/key_source.h\"\n#include \"packager\/media\/base\/media_sample.h\"\n#include \"packager\/media\/filters\/nalu_reader.h\"\n#include \"packager\/media\/filters\/vp8_parser.h\"\n#include \"packager\/media\/filters\/vp9_parser.h\"\n#include \"packager\/media\/formats\/mp4\/box_definitions.h\"\n\nnamespace edash_packager {\nnamespace media {\nnamespace mp4 {\n\nnamespace {\nconst size_t kCencBlockSize = 16u;\n\n\/\/ Adds one or more subsamples to |*subsamples|.  This may add more than one\n\/\/ if one of the values overflows the integer in the subsample.\nvoid AddSubsamples(uint64_t clear_bytes,\n                   uint64_t cipher_bytes,\n                   std::vector<SubsampleEntry>* subsamples) {\n  CHECK_LT(cipher_bytes, std::numeric_limits<uint32_t>::max());\n  const uint64_t kUInt16Max = std::numeric_limits<uint16_t>::max();\n  while (clear_bytes > kUInt16Max) {\n    subsamples->push_back(SubsampleEntry(kUInt16Max, 0));\n    clear_bytes -= kUInt16Max;\n  }\n\n  if (clear_bytes > 0 || cipher_bytes > 0)\n    subsamples->push_back(SubsampleEntry(clear_bytes, cipher_bytes));\n}\n\nVideoCodec GetVideoCodec(const StreamInfo& stream_info) {\n  if (stream_info.stream_type() != kStreamVideo)\n    return kUnknownVideoCodec;\n  const VideoStreamInfo& video_stream_info =\n      static_cast<const VideoStreamInfo&>(stream_info);\n  return video_stream_info.codec();\n}\n\nuint8_t GetNaluLengthSize(const StreamInfo& stream_info) {\n  if (stream_info.stream_type() != kStreamVideo)\n    return 0;\n\n  const VideoStreamInfo& video_stream_info =\n      static_cast<const VideoStreamInfo&>(stream_info);\n  return video_stream_info.nalu_length_size();\n}\n}  \/\/ namespace\n\nEncryptingFragmenter::EncryptingFragmenter(\n    scoped_refptr<StreamInfo> info,\n    TrackFragment* traf,\n    scoped_ptr<EncryptionKey> encryption_key,\n    int64_t clear_time,\n    FourCC protection_scheme,\n    uint8_t crypt_byte_block,\n    uint8_t skip_byte_block)\n    : Fragmenter(traf),\n      info_(info),\n      encryption_key_(encryption_key.Pass()),\n      nalu_length_size_(GetNaluLengthSize(*info)),\n      video_codec_(GetVideoCodec(*info)),\n      clear_time_(clear_time),\n      protection_scheme_(protection_scheme),\n      crypt_byte_block_(crypt_byte_block),\n      skip_byte_block_(skip_byte_block) {\n  DCHECK(encryption_key_);\n  switch (video_codec_) {\n    case kCodecVP8:\n      vpx_parser_.reset(new VP8Parser);\n      break;\n    case kCodecVP9:\n      vpx_parser_.reset(new VP9Parser);\n      break;\n    case kCodecH264:\n      header_parser_.reset(new H264VideoSliceHeaderParser);\n      break;\n    case kCodecHVC1:\n      FALLTHROUGH_INTENDED;\n    case kCodecHEV1:\n      header_parser_.reset(new H265VideoSliceHeaderParser);\n      break;\n    default:\n      if (nalu_length_size_ > 0) {\n        LOG(WARNING) << \"Unknown video codec '\" << video_codec_\n                     << \"', whole subsamples will be encrypted.\";\n      }\n  }\n}\n\nEncryptingFragmenter::~EncryptingFragmenter() {}\n\nStatus EncryptingFragmenter::AddSample(scoped_refptr<MediaSample> sample) {\n  DCHECK(sample);\n  if (!fragment_initialized()) {\n    Status status = InitializeFragment(sample->dts());\n    if (!status.ok())\n      return status;\n  }\n  if (encryptor_) {\n    Status status = EncryptSample(sample);\n    if (!status.ok())\n      return status;\n  }\n  return Fragmenter::AddSample(sample);\n}\n\nStatus EncryptingFragmenter::InitializeFragment(int64_t first_sample_dts) {\n  Status status = Fragmenter::InitializeFragment(first_sample_dts);\n  if (!status.ok())\n    return status;\n\n  if (header_parser_ && !header_parser_->Initialize(info_->extra_data()))\n    return Status(error::MUXER_FAILURE, \"Fail to read SPS and PPS data.\");\n\n  traf()->auxiliary_size.sample_info_sizes.clear();\n  traf()->auxiliary_offset.offsets.clear();\n  if (IsSubsampleEncryptionRequired()) {\n    traf()->sample_encryption.flags |=\n        SampleEncryption::kUseSubsampleEncryption;\n  }\n  traf()->sample_encryption.sample_encryption_entries.clear();\n\n  const bool enable_encryption = clear_time_ <= 0;\n  if (!enable_encryption) {\n    \/\/ This fragment should be in clear text.\n    \/\/ At most two sample description entries, an encrypted entry and a clear\n    \/\/ entry, are generated. The 1-based clear entry index is always 2.\n    const uint32_t kClearSampleDescriptionIndex = 2;\n\n    traf()->header.flags |=\n        TrackFragmentHeader::kSampleDescriptionIndexPresentMask;\n    traf()->header.sample_description_index = kClearSampleDescriptionIndex;\n  }\n  return PrepareFragmentForEncryption(enable_encryption);\n}\n\nvoid EncryptingFragmenter::FinalizeFragment() {\n  if (encryptor_) {\n    DCHECK_LE(clear_time_, 0);\n    FinalizeFragmentForEncryption();\n  } else {\n    DCHECK_GT(clear_time_, 0);\n    clear_time_ -= fragment_duration();\n  }\n  Fragmenter::FinalizeFragment();\n}\n\nStatus EncryptingFragmenter::PrepareFragmentForEncryption(\n    bool enable_encryption) {\n  return (!enable_encryption || encryptor_) ? Status::OK : CreateEncryptor();\n}\n\nvoid EncryptingFragmenter::FinalizeFragmentForEncryption() {\n  \/\/ The offset will be adjusted in Segmenter after knowing moof size.\n  traf()->auxiliary_offset.offsets.push_back(0);\n\n  \/\/ For 'cbcs' scheme, Constant IVs SHALL be used.\n  const size_t per_sample_iv_size =\n      (protection_scheme_ == FOURCC_cbcs) ? 0 : encryptor_->iv().size();\n  traf()->sample_encryption.iv_size = per_sample_iv_size;\n\n  \/\/ Optimize saiz box.\n  SampleAuxiliaryInformationSize& saiz = traf()->auxiliary_size;\n  saiz.sample_count = traf()->runs[0].sample_sizes.size();\n  if (!saiz.sample_info_sizes.empty()) {\n    if (!OptimizeSampleEntries(&saiz.sample_info_sizes,\n                               &saiz.default_sample_info_size)) {\n      saiz.default_sample_info_size = 0;\n    }\n  } else {\n    \/\/ |sample_info_sizes| table is filled in only for subsample encryption,\n    \/\/ otherwise |sample_info_size| is just the IV size.\n    DCHECK(!IsSubsampleEncryptionRequired());\n    saiz.default_sample_info_size = per_sample_iv_size;\n  }\n  \/\/ It should only happen with full sample encryption + constant iv, which is\n  \/\/ not a legal combination.\n  CHECK(!saiz.sample_info_sizes.empty() || saiz.default_sample_info_size != 0);\n}\n\nStatus EncryptingFragmenter::CreateEncryptor() {\n  DCHECK(encryption_key_);\n  scoped_ptr<AesCryptor> encryptor;\n  switch (protection_scheme_) {\n    case FOURCC_cenc:\n      encryptor.reset(new AesCtrEncryptor);\n      break;\n    case FOURCC_cbc1:\n      encryptor.reset(new AesCbcEncryptor(kNoPadding));\n      break;\n    case FOURCC_cens:\n      encryptor.reset(new AesPatternCryptor(\n          crypt_byte_block(), skip_byte_block(), AesCryptor::kDontUseConstantIv,\n          scoped_ptr<AesCryptor>(new AesCtrEncryptor)));\n      break;\n    case FOURCC_cbcs:\n      encryptor.reset(new AesPatternCryptor(\n          crypt_byte_block(), skip_byte_block(), AesCryptor::kUseConstantIv,\n          scoped_ptr<AesCryptor>(new AesCbcEncryptor(kNoPadding))));\n      break;\n    default:\n      return Status(error::MUXER_FAILURE, \"Unsupported protection scheme.\");\n  }\n\n  DCHECK(!encryption_key_->iv.empty());\n  const bool initialized =\n      encryptor->InitializeWithIv(encryption_key_->key, encryption_key_->iv);\n  if (!initialized)\n    return Status(error::MUXER_FAILURE, \"Failed to create the encryptor.\");\n  encryptor_ = encryptor.Pass();\n  return Status::OK;\n}\n\nvoid EncryptingFragmenter::EncryptBytes(uint8_t* data, uint32_t size) {\n  DCHECK(encryptor_);\n  CHECK(encryptor_->Crypt(data, size, data));\n}\n\nStatus EncryptingFragmenter::EncryptSample(scoped_refptr<MediaSample> sample) {\n  DCHECK(encryptor_);\n\n  SampleEncryptionEntry sample_encryption_entry;\n  \/\/ For 'cbcs' scheme, Constant IVs SHALL be used.\n  if (protection_scheme_ != FOURCC_cbcs)\n    sample_encryption_entry.initialization_vector = encryptor_->iv();\n  uint8_t* data = sample->writable_data();\n  if (IsSubsampleEncryptionRequired()) {\n    if (vpx_parser_) {\n      std::vector<VPxFrameInfo> vpx_frames;\n      if (!vpx_parser_->Parse(sample->data(), sample->data_size(),\n                              &vpx_frames)) {\n        return Status(error::MUXER_FAILURE, \"Failed to parse vpx frame.\");\n      }\n\n      const bool is_superframe = vpx_frames.size() > 1;\n      for (const VPxFrameInfo& frame : vpx_frames) {\n        SubsampleEntry subsample;\n        subsample.clear_bytes = frame.uncompressed_header_size;\n        subsample.cipher_bytes =\n            frame.frame_size - frame.uncompressed_header_size;\n\n        \/\/ \"VP Codec ISO Media File Format Binding\" document requires that the\n        \/\/ encrypted bytes of each frame within the superframe must be block\n        \/\/ aligned so that the counter state can be computed for each frame\n        \/\/ within the superframe.\n        \/\/ For AES-CBC mode 'cbc1' scheme, clear data is sized appropriately so\n        \/\/ that the cipher data is block aligned.\n        if (is_superframe || protection_scheme_ == FOURCC_cbc1) {\n          const uint16_t misalign_bytes =\n              subsample.cipher_bytes % kCencBlockSize;\n          subsample.clear_bytes += misalign_bytes;\n          subsample.cipher_bytes -= misalign_bytes;\n        }\n\n        sample_encryption_entry.subsamples.push_back(subsample);\n        if (subsample.cipher_bytes > 0)\n          EncryptBytes(data + subsample.clear_bytes, subsample.cipher_bytes);\n        data += frame.frame_size;\n      }\n    } else {\n      const NaluReader::CodecType nalu_type =\n          (video_codec_ == kCodecHVC1 || video_codec_ == kCodecHEV1)\n              ? NaluReader::kH265\n              : NaluReader::kH264;\n      NaluReader reader(nalu_type, nalu_length_size_, data,\n                        sample->data_size());\n\n      \/\/ Store the current length of clear data.  This is used to squash\n      \/\/ multiple unencrypted NAL units into fewer subsample entries.\n      uint64_t accumulated_clear_bytes = 0;\n\n      Nalu nalu;\n      NaluReader::Result result;\n      while ((result = reader.Advance(&nalu)) == NaluReader::kOk) {\n        if (nalu.is_video_slice()) {\n          \/\/ For video-slice NAL units, encrypt the video slice.  This skips\n          \/\/ the frame header.  If this is an unrecognized codec (e.g. H.265),\n          \/\/ the whole NAL unit will be encrypted.\n          const int64_t video_slice_header_size =\n              header_parser_ ? header_parser_->GetHeaderSize(nalu) : 0;\n          if (video_slice_header_size < 0)\n            return Status(error::MUXER_FAILURE, \"Failed to read slice header.\");\n\n          uint64_t current_clear_bytes =\n              nalu.header_size() + video_slice_header_size;\n          uint64_t cipher_bytes = nalu.payload_size() - video_slice_header_size;\n\n          \/\/ For AES-CBC mode 'cbc1' scheme, clear data is sized appropriately\n          \/\/ so that the cipher data is block aligned.\n          if (protection_scheme_ == FOURCC_cbc1) {\n            const uint16_t misalign_bytes = cipher_bytes % kCencBlockSize;\n            current_clear_bytes += misalign_bytes;\n            cipher_bytes -= misalign_bytes;\n          }\n\n          const uint8_t* nalu_data = nalu.data() + current_clear_bytes;\n          EncryptBytes(const_cast<uint8_t*>(nalu_data), cipher_bytes);\n\n          AddSubsamples(\n              accumulated_clear_bytes + nalu_length_size_ + current_clear_bytes,\n              cipher_bytes, &sample_encryption_entry.subsamples);\n          accumulated_clear_bytes = 0;\n        } else {\n          \/\/ For non-video-slice NAL units, don't encrypt.\n          accumulated_clear_bytes +=\n              nalu_length_size_ + nalu.header_size() + nalu.payload_size();\n        }\n      }\n      if (result != NaluReader::kEOStream)\n        return Status(error::MUXER_FAILURE, \"Failed to parse NAL units.\");\n      AddSubsamples(accumulated_clear_bytes, 0,\n                    &sample_encryption_entry.subsamples);\n    }\n\n    \/\/ The length of per-sample auxiliary datum, defined in CENC ch. 7.\n    traf()->auxiliary_size.sample_info_sizes.push_back(\n        sample_encryption_entry.ComputeSize());\n  } else {\n    EncryptBytes(data, sample->data_size());\n  }\n\n  traf()->sample_encryption.sample_encryption_entries.push_back(\n      sample_encryption_entry);\n  encryptor_->UpdateIv();\n  return Status::OK;\n}\n\nbool EncryptingFragmenter::IsSubsampleEncryptionRequired() {\n  return vpx_parser_ || nalu_length_size_ != 0;\n}\n\n}  \/\/ namespace mp4\n}  \/\/ namespace media\n}  \/\/ namespace edash_packager\n<|endoftext|>"}
{"text":"<commit_before>#include \"ConnectionNonBlocking.h\"\n#include <iostream>\n\nnamespace ThorsAnvil\n{\n    namespace NisseSQL\n    {\n\nclass MySQLConnectionHandler: public ThorsAnvil::Nisse::NisseHandler\n{\n    CoRoutine               worker;\n    public:\n        MySQLConnectionHandler(ThorsAnvil::Nisse::NisseService& service,\n                               ConnectionNonBlocking& connection,\n                               ThorsAnvil::MySQL::MySQLStream& stream,\n                               std::string const& username,\n                               std::string const& password,\n                               std::string const& database,\n                               ThorsAnvil::SQL::Options const& options)\n            : NisseHandler(service, stream.getSocketId(), EV_READ | EV_WRITE)\n            , worker([&connection, &stream, &username, &password, &database, &options](Yield& yield)\n                {\n                    std::cerr << \"MySQLConnectionHandler: Worker\\n\";\n                    yield(EV_WRITE);\n                    std::cerr << \"MySQLConnectionHandler: Worder: Setting Yield\\n\";\n                    ThorsAnvil::MySQL::YieldSetter  setter(stream, [&yield](){yield(EV_READ);}, [&yield](){yield(EV_WRITE);});\n                    std::cerr << \"MySQLConnectionHandler: Worder: Setting Connecting to server\\n\";\n                    connection.doConectToServer(username, password, database, options);\n                    std::cerr << \"MySQLConnectionHandler: Worder: DONE\\n\";\n                })\n        {\n            std::cerr << \"MySQLConnectionHandler: CONSTRUCTOR\\n\";\n        }\n        virtual short eventActivate(ThorsAnvil::Nisse::LibSocketId \/*sockId*\/, short \/*eventType*\/)\n        {\n            std::cerr << \"We Can Write To DB\\n\";\n            if (!worker())\n            {\n                std::cerr << \"event Activate Finished\\n\";\n                dropHandler();\n                return 0;\n            }\n            short x = worker.get();\n            std::cerr << \"DB connection Blocked: \" << (x & EV_READ ? \"READ\" : \"NR\") << \" : \" << (x & EV_WRITE ? \"WRITE\" : \"NW\") << \"\\n\";\n            return worker.get();\n        }\n};\n\n    }\n}\n\nusing namespace ThorsAnvil::NisseSQL;\n\nConnectionNonBlocking::ConnectionNonBlocking(\n        ThorsAnvil::MySQL::MySQLStream& stream,\n        std::string const& username,\n        std::string const& password,\n        std::string const& database,\n        ThorsAnvil::SQL::Options const& options,\n        ThorsAnvil::MySQL::ConectReader& packageReader,\n        ThorsAnvil::MySQL::ConectWriter& packageWriter\n)\n    : Connection(username, password, database, options, packageReader, packageWriter)\n    , stream(stream)\n{\nstd::cerr << \"ConnectionNonBlocking::ConnectionNonBlocking\\n\";\n    auto& service = ThorsAnvil::Nisse::NisseService::getCurrentHandler();\nstd::cerr << \"ConnectionNonBlocking: Service: \" << &service << \"\\n\";\n    service.transferHandler<MySQLConnectionHandler>(*this, stream, username, password, database, options);\nstd::cerr << \"Transfer Returned\\n\";\n}\n\nvoid ConnectionNonBlocking::doConectToServer(\n        std::string const& username,\n        std::string const& password,\n        std::string const& database,\n        ThorsAnvil::SQL::Options const& options\n)\n{\n    std::cerr << \"doConectToServer: \" << username << \" : \" << password << \" : \" << database << \"\\n\";\n    conectToServer(username, password, database, options);\n}\n<commit_msg>Remove print statements<commit_after>#include \"ConnectionNonBlocking.h\"\n#include <iostream>\n\nnamespace ThorsAnvil\n{\n    namespace NisseSQL\n    {\n\nclass MySQLConnectionHandler: public ThorsAnvil::Nisse::NisseHandler\n{\n    CoRoutine               worker;\n    public:\n        MySQLConnectionHandler(ThorsAnvil::Nisse::NisseService& service,\n                               ConnectionNonBlocking& connection,\n                               ThorsAnvil::MySQL::MySQLStream& stream,\n                               std::string const& username,\n                               std::string const& password,\n                               std::string const& database,\n                               ThorsAnvil::SQL::Options const& options)\n            : NisseHandler(service, stream.getSocketId(), EV_READ | EV_WRITE)\n            , worker([&connection, &stream, &username, &password, &database, &options](Yield& yield)\n                {\n                    yield(EV_WRITE);\n                    ThorsAnvil::MySQL::YieldSetter  setter(stream, [&yield](){yield(EV_READ);}, [&yield](){yield(EV_WRITE);});\n                    connection.doConectToServer(username, password, database, options);\n                })\n        {\n        }\n        virtual short eventActivate(ThorsAnvil::Nisse::LibSocketId \/*sockId*\/, short \/*eventType*\/)\n        {\n            if (!worker())\n            {\n                dropHandler();\n                return 0;\n            }\n            return worker.get();\n        }\n};\n\n    }\n}\n\nusing namespace ThorsAnvil::NisseSQL;\n\nConnectionNonBlocking::ConnectionNonBlocking(\n        ThorsAnvil::MySQL::MySQLStream& stream,\n        std::string const& username,\n        std::string const& password,\n        std::string const& database,\n        ThorsAnvil::SQL::Options const& options,\n        ThorsAnvil::MySQL::ConectReader& packageReader,\n        ThorsAnvil::MySQL::ConectWriter& packageWriter\n)\n    : Connection(username, password, database, options, packageReader, packageWriter)\n    , stream(stream)\n{\n    auto& service = ThorsAnvil::Nisse::NisseService::getCurrentHandler();\n    service.transferHandler<MySQLConnectionHandler>(*this, stream, username, password, database, options);\n}\n\nvoid ConnectionNonBlocking::doConectToServer(\n        std::string const& username,\n        std::string const& password,\n        std::string const& database,\n        ThorsAnvil::SQL::Options const& options\n)\n{\n    conectToServer(username, password, database, options);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\n#include <tclap\/CmdLine.h>\n#include <iostream>\n#include <string>\n\nusing namespace TCLAP; \nusing namespace std; \n\nstring _orTest;\nstring _orTest2;\nstring _testc;\nbool _testd;\n\nvoid parseOptions(int argc, char** argv);\n\nint main(int argc, char** argv)\n{\n\n\tparseOptions(argc,argv);\n\n\tcout << \"for A OR B we got : \" << _orTest<< endl\n\t\t << \"for string C we got : \" << _testc << endl\n\t\t << \"for string D we got : \" << _testd << endl\n\t\t << \"for E or F or G we got: \" << _orTest2 << endl;\n\n}\n\n\nvoid parseOptions(int argc, char** argv)\n{\n\ttry {\n\n\tCmdLine cmd(\"this is a message\", ' ', \"0.99\" );\n\n\t\/\/ \n\t\/\/ Define arguments\n\t\/\/\n\n\tValueArg<string> atest(\"a\", \"aaa\", \"or test a\", true, \"homer\", \"string\");\n\tValueArg<string> btest(\"b\", \"bbb\", \"or test b\", true, \"homer\", \"string\");\n\tcmd.xorAdd( atest, btest );\n\n\tValueArg<string> ctest(\"c\", \"ccc\", \"c test\", true, \"homer\", \"string\");\n\tcmd.add( ctest );\n\n\tSwitchArg dtest(\"\", \"ddd\", \"d test\", false);\n\tcmd.add( dtest );\n\n\tValueArg<string> etest(\"\", \"eee\", \"e test\", false, \"homer\", \"string\");\n\tValueArg<string> ftest(\"\", \"fff\", \"f test\", false, \"homer\", \"string\");\n\tValueArg<string> gtest(\"g\", \"ggg\", \"g test\", false, \"homer\", \"string\");\n\tvector<Arg*> xorlist;\n\txorlist.push_back(&etest);\n\txorlist.push_back(&ftest);\n\txorlist.push_back(&gtest);\n\tcmd.xorAdd( xorlist );\n\n\t\/\/\n\t\/\/ Parse the command line.\n\t\/\/\n\tcmd.parse(argc,argv);\n\n\n\t\/\/\n\t\/\/ Set variables\n\t\/\/\n\t\n\tif ( atest.isSet() )\n\t\t_orTest = atest.getValue();\n\telse if ( btest.isSet() )\n\t\t_orTest = btest.getValue();\n\telse\n\t\t\/\/ Should never get here because TCLAP will note that one of the\n\t\t\/\/ required args above has not been set.\n\t\tthrow(\"very bad things...\");\n\n\t_testc = ctest.getValue();\n\t_testd = dtest.getValue();\n\n\tif ( etest.isSet() )\n\t\t_orTest2 = etest.getValue();\n\telse if ( ftest.isSet() )\n\t\t_orTest2 = ftest.getValue();\n\telse if ( gtest.isSet() )\n\t\t_orTest2 = gtest.getValue();\n\telse\n\t\tthrow(\"still bad\");\n\n\n\t} catch ( ArgException& e )\n\t{ cout << \"ERROR: \" << e.error() << \" \" << e.argId() << endl; }\n}\n\n\n\n<commit_msg>change for xor bug<commit_after>\n\n#include <tclap\/CmdLine.h>\n#include <iostream>\n#include <string>\n\nusing namespace TCLAP; \nusing namespace std; \n\nstring _orTest;\nstring _orTest2;\nstring _testc;\nbool _testd;\n\nvoid parseOptions(int argc, char** argv);\n\nint main(int argc, char** argv)\n{\n\n\tparseOptions(argc,argv);\n\n\tcout << \"for A OR B we got : \" << _orTest<< endl\n\t\t << \"for string C we got : \" << _testc << endl\n\t\t << \"for string D we got : \" << _testd << endl\n\t\t << \"for E or F or G we got: \" << _orTest2 << endl;\n\n}\n\n\nvoid parseOptions(int argc, char** argv)\n{\n\ttry {\n\n\tCmdLine cmd(\"this is a message\", ' ', \"0.99\" );\n\n\t\/\/ \n\t\/\/ Define arguments\n\t\/\/\n\n\tValueArg<string> atest(\"a\", \"aaa\", \"or test a\", true, \"homer\", \"string\");\n\tValueArg<string> btest(\"b\", \"bbb\", \"or test b\", true, \"homer\", \"string\");\n\tcmd.xorAdd( atest, btest );\n\n\tValueArg<string> ctest(\"c\", \"ccc\", \"c test\", true, \"homer\", \"string\");\n\tcmd.add( ctest );\n\n\tSwitchArg dtest(\"\", \"ddd\", \"d test\", false);\n\tcmd.add( dtest );\n\n\tValueArg<string> etest(\"\", \"eee\", \"e test\", false, \"homer\", \"string\");\n\tValueArg<string> ftest(\"\", \"fff\", \"f test\", false, \"homer\", \"string\");\n\tValueArg<string> gtest(\"g\", \"ggg\", \"g test\", false, \"homer\", \"string\");\n\tvector<Arg*> xorlist;\n\txorlist.push_back(&etest);\n\txorlist.push_back(&ftest);\n\txorlist.push_back(&gtest);\n\tcmd.xorAdd( xorlist );\n\n\tMultiArg<string> itest(\"i\", \"iii\", \"or test i\", true, \"string\");\n\tMultiArg<string> jtest(\"j\", \"jjj\", \"or test j\", true, \"string\");\n\tcmd.xorAdd( itest, jtest );\n\n\t\/\/\n\t\/\/ Parse the command line.\n\t\/\/\n\tcmd.parse(argc,argv);\n\n\n\t\/\/\n\t\/\/ Set variables\n\t\/\/\n\t\n\tif ( atest.isSet() )\n\t\t_orTest = atest.getValue();\n\telse if ( btest.isSet() )\n\t\t_orTest = btest.getValue();\n\telse\n\t\t\/\/ Should never get here because TCLAP will note that one of the\n\t\t\/\/ required args above has not been set.\n\t\tthrow(\"very bad things...\");\n\n\t_testc = ctest.getValue();\n\t_testd = dtest.getValue();\n\n\tif ( etest.isSet() )\n\t\t_orTest2 = etest.getValue();\n\telse if ( ftest.isSet() )\n\t\t_orTest2 = ftest.getValue();\n\telse if ( gtest.isSet() )\n\t\t_orTest2 = gtest.getValue();\n\telse\n\t\tthrow(\"still bad\");\n\n    if ( jtest.isSet() )\n    {\n        cout << \"for J:\" << endl;\n        vector<string> v = jtest.getValue();\n        for ( int z = 0; (unsigned int)z < v.size(); z++ )\n            cout << \" \" << z << \"  \" << v[z] << endl;\n    }\n    else if ( itest.isSet() )\n    {\n        cout << \"for I:\" << endl;\n        vector<string> v = itest.getValue();\n        for ( int z = 0; (unsigned int)z < v.size(); z++ )\n            cout << \" \" << z << \"  \" << v[z] << endl;\n    }\n    else\n\t\tthrow(\"yup, still bad\");\n\t\n\n\n\t} catch ( ArgException& e )\n\t{ cout << \"ERROR: \" << e.error() << \" \" << e.argId() << endl; }\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Enable lossless colour by default.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: persistentwindowstate.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 13:59: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_framework.hxx\"\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_PATTERN_WINDOW_HXX_\n#include <pattern\/window.hxx>\n#endif\n\n#ifndef __FRAMEWORK_HELPER_PERSISTENTWINDOWSTATE_HXX_\n#include <helper\/persistentwindowstate.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_WRITEGUARD_HXX_\n#include <threadhelp\/writeguard.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_READGUARD_HXX_\n#include <threadhelp\/readguard.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.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_AWT_XWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XSERVICXEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_ILLEGALARGUMENTEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/IllegalArgumentException.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\/\/  other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COMPHELPER_CONFIGURATIONHELPER_HXX_\n#include <comphelper\/configurationhelper.hxx>\n#endif\n\n#ifndef _SV_WINDOW_HXX\n#include <vcl\/window.hxx>\n#endif\n\n#ifndef _SV_SYSWIN_HXX\n#include <vcl\/syswin.hxx>\n#endif\n\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/unohlp.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\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\nnamespace framework{\n\nnamespace fpw = ::framework::pattern::window;\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  definitions\n\n\/\/*****************************************************************************************************************\n\/\/  XInterface, XTypeProvider\n\nDEFINE_XINTERFACE_4(PersistentWindowState                                                       ,\n                    OWeakObject                                                                 ,\n                    DIRECT_INTERFACE (css::lang::XTypeProvider                                  ),\n                    DIRECT_INTERFACE (css::lang::XInitialization                                ),\n                    DIRECT_INTERFACE (css::frame::XFrameActionListener                          ),\n                    DERIVED_INTERFACE(css::lang::XEventListener,css::frame::XFrameActionListener))\n\nDEFINE_XTYPEPROVIDER_4(PersistentWindowState           ,\n                       css::lang::XTypeProvider        ,\n                       css::lang::XInitialization      ,\n                       css::frame::XFrameActionListener,\n                       css::lang::XEventListener       )\n\n\/\/*****************************************************************************************************************\nPersistentWindowState::PersistentWindowState(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR)\n    : ThreadHelpBase          (&Application::GetSolarMutex())\n    , m_xSMGR                 (xSMGR                        )\n    , m_bWindowStateAlreadySet(sal_False                    )\n{\n}\n\n\/\/*****************************************************************************************************************\nPersistentWindowState::~PersistentWindowState()\n{\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL PersistentWindowState::initialize(const css::uno::Sequence< css::uno::Any >& lArguments)\n    throw(css::uno::Exception       ,\n          css::uno::RuntimeException)\n{\n    \/\/ check arguments\n    css::uno::Reference< css::frame::XFrame > xFrame;\n    if (lArguments.getLength() < 1)\n        throw css::lang::IllegalArgumentException(\n                DECLARE_ASCII(\"Empty argument list!\"),\n                static_cast< ::cppu::OWeakObject* >(this),\n                1);\n\n    lArguments[0] >>= xFrame;\n    if (!xFrame.is())\n        throw css::lang::IllegalArgumentException(\n                DECLARE_ASCII(\"No valid frame specified!\"),\n                static_cast< ::cppu::OWeakObject* >(this),\n                1);\n\n    \/\/ SAFE -> ----------------------------------\n    WriteGuard aWriteLock(m_aLock);\n    \/\/ hold the frame as weak reference(!) so it can die everytimes :-)\n    m_xFrame = xFrame;\n    aWriteLock.unlock();\n    \/\/ <- SAFE ----------------------------------\n\n    \/\/ start listening\n    xFrame->addFrameActionListener(this);\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL PersistentWindowState::frameAction(const css::frame::FrameActionEvent& aEvent)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ SAFE -> ----------------------------------\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::lang::XMultiServiceFactory > xSMGR = m_xSMGR ;\n    css::uno::Reference< css::frame::XFrame >              xFrame(m_xFrame.get(), css::uno::UNO_QUERY);\n\/\/    sal_Bool                                               bRestoreWindowState = !m_bWindowStateAlreadySet;\n    aReadLock.unlock();\n    \/\/ <- SAFE ----------------------------------\n\n    \/\/ frame already gone ? We hold it weak only ...\n    if (!xFrame.is())\n        return;\n\n    \/\/ no window -> no position and size available\n    css::uno::Reference< css::awt::XWindow > xWindow = xFrame->getContainerWindow();\n    if (!xWindow.is())\n        return;\n\n    \/\/ unknown module -> no configuration available!\n    ::rtl::OUString sModuleName = PersistentWindowState::implst_identifyModule(xSMGR, xFrame);\n    if (!sModuleName.getLength())\n        return;\n\n    switch(aEvent.Action)\n    {\n        \/*\n        case css::frame::FrameAction_COMPONENT_ATTACHED :\n            {\n                if (bRestoreWindowState)\n                {\n                    ::rtl::OUString sWindowState = PersistentWindowState::implst_getWindowStateFromConfig(xSMGR, sModuleName);\n                    PersistentWindowState::implst_setWindowStateOnWindow(xWindow,sWindowState);\n                    \/\/ SAFE -> ----------------------------------\n                    WriteGuard aWriteLock(m_aLock);\n                    m_bWindowStateAlreadySet = sal_True;\n                    aWriteLock.unlock();\n                    \/\/ <- SAFE ----------------------------------\n                }\n            }\n            break;\n        *\/\n\n        case css::frame::FrameAction_COMPONENT_REATTACHED :\n            {\n                \/\/ nothing todo here, because its not allowed to change position and size\n                \/\/ of an alredy existing frame!\n            }\n            break;\n\n        case css::frame::FrameAction_COMPONENT_DETACHING :\n            {\n                ::rtl::OUString sWindowState = PersistentWindowState::implst_getWindowStateFromWindow(xWindow);\n                PersistentWindowState::implst_setWindowStateOnConfig(xSMGR, sModuleName, sWindowState);\n            }\n            break;\n        default:\n            break;\n    }\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL PersistentWindowState::disposing(const css::lang::EventObject&)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ nothing todo here - because we hold the frame as weak reference only\n}\n\n\/\/*****************************************************************************************************************\n::rtl::OUString PersistentWindowState::implst_identifyModule(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR ,\n                                                             const css::uno::Reference< css::frame::XFrame >&              xFrame)\n{\n    ::rtl::OUString sModuleName;\n\n    css::uno::Reference< css::frame::XModuleManager > xModuleManager(\n        xSMGR->createInstance(SERVICENAME_MODULEMANAGER),\n        css::uno::UNO_QUERY_THROW);\n\n    try\n    {\n        sModuleName = xModuleManager->identify(xFrame);\n    }\n    catch(const css::uno::RuntimeException& exRun)\n        { throw exRun; }\n    catch(const css::uno::Exception&)\n        { sModuleName = ::rtl::OUString(); }\n\n    return sModuleName;\n}\n\n\/\/*****************************************************************************************************************\n::rtl::OUString PersistentWindowState::implst_getWindowStateFromConfig(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR      ,\n                                                                       const ::rtl::OUString&                                        sModuleName)\n{\n    ::rtl::OUString sWindowState;\n\n    ::rtl::OUStringBuffer sRelPathBuf(256);\n    sRelPathBuf.appendAscii(\"Office\/Factories\/*[\\\"\");\n    sRelPathBuf.append     (sModuleName            );\n    sRelPathBuf.appendAscii(\"\\\"]\"                  );\n\n    ::rtl::OUString sPackage = ::rtl::OUString::createFromAscii(\"org.openoffice.Setup\/\");\n    ::rtl::OUString sRelPath = sRelPathBuf.makeStringAndClear();\n    ::rtl::OUString sKey     = ::rtl::OUString::createFromAscii(\"ooSetupFactoryWindowAttributes\");\n\n    try\n    {\n        css::uno::Any aWindowState = ::comphelper::ConfigurationHelper::readDirectKey(xSMGR,\n                                                                                      sPackage,\n                                                                                      sRelPath,\n                                                                                      sKey,\n                                                                                      ::comphelper::ConfigurationHelper::E_READONLY);\n        aWindowState >>= sWindowState;\n    }\n    catch(const css::uno::RuntimeException& exRun)\n        { throw exRun; }\n    catch(const css::uno::Exception&)\n        { sWindowState = ::rtl::OUString(); }\n\n    return sWindowState;\n}\n\n\/\/*****************************************************************************************************************\nvoid PersistentWindowState::implst_setWindowStateOnConfig(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR       ,\n                                                          const ::rtl::OUString&                                        sModuleName ,\n                                                          const ::rtl::OUString&                                        sWindowState)\n{\n    ::rtl::OUStringBuffer sRelPathBuf(256);\n    sRelPathBuf.appendAscii(\"Office\/Factories\/*[\\\"\");\n    sRelPathBuf.append     (sModuleName            );\n    sRelPathBuf.appendAscii(\"\\\"]\"                  );\n\n    ::rtl::OUString sPackage = ::rtl::OUString::createFromAscii(\"org.openoffice.Setup\/\");\n    ::rtl::OUString sRelPath = sRelPathBuf.makeStringAndClear();\n    ::rtl::OUString sKey     = ::rtl::OUString::createFromAscii(\"ooSetupFactoryWindowAttributes\");\n\n    try\n    {\n        ::comphelper::ConfigurationHelper::writeDirectKey(xSMGR,\n                                                          sPackage,\n                                                          sRelPath,\n                                                          sKey,\n                                                          css::uno::makeAny(sWindowState),\n                                                          ::comphelper::ConfigurationHelper::E_STANDARD);\n    }\n    catch(const css::uno::RuntimeException& exRun)\n        { throw exRun; }\n    catch(const css::uno::Exception&)\n        {}\n}\n\n\/\/*****************************************************************************************************************\n::rtl::OUString PersistentWindowState::implst_getWindowStateFromWindow(const css::uno::Reference< css::awt::XWindow >& xWindow)\n{\n    ::rtl::OUString sWindowState;\n\n    if (xWindow.is())\n    {\n        \/\/ SOLAR SAFE -> ------------------------\n        ::vos::OClearableGuard aSolarLock(Application::GetSolarMutex());\n\n        Window* pWindow = VCLUnoHelper::GetWindow(xWindow);\n        \/\/ check for system window is neccessary to guarantee correct pointer cast!\n        if (\n            (pWindow                  ) &&\n            (pWindow->IsSystemWindow())\n           )\n        {\n            ULONG nMask  =   WINDOWSTATE_MASK_ALL;\n                  nMask &= ~(WINDOWSTATE_MASK_MINIMIZED);\n            sWindowState = B2U_ENC(\n                            ((SystemWindow*)pWindow)->GetWindowState(nMask),\n                            RTL_TEXTENCODING_UTF8);\n        }\n\n        aSolarLock.clear();\n        \/\/ <- SOLAR SAFE ------------------------\n    }\n\n    return sWindowState;\n}\n\n\n\/\/*********************************************************************************************************\nvoid PersistentWindowState::implst_setWindowStateOnWindow(const css::uno::Reference< css::awt::XWindow >& \/*xWindow*\/     ,\n                                                          const ::rtl::OUString&                          \/*sWindowState*\/)\n{\n    \/*\n    if (\n        (!xWindow.is()                ) ||\n        ( sWindowState.getLength() < 1)\n       )\n        return;\n\n    \/\/ SOLAR SAFE -> ------------------------\n    ::vos::OClearableGuard aSolarLock(Application::GetSolarMutex());\n\n    Window* pWindow = VCLUnoHelper::GetWindow(xWindow);\n    if (!pWindow)\n        return;\n\n    \/\/ check for system and work window - its neccessary to guarantee correct pointer cast!\n    sal_Bool bSystemWindow = pWindow->IsSystemWindow();\n    sal_Bool bWorkWindow   = (pWindow->GetType() == WINDOW_WORKWINDOW);\n\n    if (!bSystemWindow && !bWorkWindow)\n        return;\n\n    SystemWindow* pSystemWindow = (SystemWindow*)pWindow;\n    WorkWindow*   pWorkWindow   = (WorkWindow*  )pWindow;\n\n    \/\/ dont save this special state!\n    if (pWorkWindow->IsMinimized())\n        return;\n\n    pSystemWindow->SetWindowState(U2B_ENC(sWindowState,RTL_TEXTENCODING_UTF8));\n\n    aSolarLock.clear();\n    \/\/ <- SOLAR SAFE ------------------------\n    *\/\n}\n\n} \/\/ namespace framework\n<commit_msg>INTEGRATION: CWS fwkdbdesign01 (1.12.84); FILE MERGED 2007\/02\/19 10:58:45 as 1.12.84.1: #i74541# make framework ready for real sub frames<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: persistentwindowstate.cxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: ihi $ $Date: 2007-04-16 16:41: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_framework.hxx\"\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_PATTERN_WINDOW_HXX_\n#include <pattern\/window.hxx>\n#endif\n\n#ifndef __FRAMEWORK_HELPER_PERSISTENTWINDOWSTATE_HXX_\n#include <helper\/persistentwindowstate.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_WRITEGUARD_HXX_\n#include <threadhelp\/writeguard.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_READGUARD_HXX_\n#include <threadhelp\/readguard.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.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_AWT_XWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XSERVICXEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_ILLEGALARGUMENTEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/IllegalArgumentException.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\/\/  other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COMPHELPER_CONFIGURATIONHELPER_HXX_\n#include <comphelper\/configurationhelper.hxx>\n#endif\n\n#ifndef _SV_WINDOW_HXX\n#include <vcl\/window.hxx>\n#endif\n\n#ifndef _SV_SYSWIN_HXX\n#include <vcl\/syswin.hxx>\n#endif\n\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/unohlp.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\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\nnamespace framework{\n\nnamespace fpw = ::framework::pattern::window;\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  definitions\n\n\/\/*****************************************************************************************************************\n\/\/  XInterface, XTypeProvider\n\nDEFINE_XINTERFACE_4(PersistentWindowState                                                       ,\n                    OWeakObject                                                                 ,\n                    DIRECT_INTERFACE (css::lang::XTypeProvider                                  ),\n                    DIRECT_INTERFACE (css::lang::XInitialization                                ),\n                    DIRECT_INTERFACE (css::frame::XFrameActionListener                          ),\n                    DERIVED_INTERFACE(css::lang::XEventListener,css::frame::XFrameActionListener))\n\nDEFINE_XTYPEPROVIDER_4(PersistentWindowState           ,\n                       css::lang::XTypeProvider        ,\n                       css::lang::XInitialization      ,\n                       css::frame::XFrameActionListener,\n                       css::lang::XEventListener       )\n\n\/\/*****************************************************************************************************************\nPersistentWindowState::PersistentWindowState(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR)\n    : ThreadHelpBase          (&Application::GetSolarMutex())\n    , m_xSMGR                 (xSMGR                        )\n    , m_bWindowStateAlreadySet(sal_False                    )\n{\n}\n\n\/\/*****************************************************************************************************************\nPersistentWindowState::~PersistentWindowState()\n{\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL PersistentWindowState::initialize(const css::uno::Sequence< css::uno::Any >& lArguments)\n    throw(css::uno::Exception       ,\n          css::uno::RuntimeException)\n{\n    \/\/ check arguments\n    css::uno::Reference< css::frame::XFrame > xFrame;\n    if (lArguments.getLength() < 1)\n        throw css::lang::IllegalArgumentException(\n                DECLARE_ASCII(\"Empty argument list!\"),\n                static_cast< ::cppu::OWeakObject* >(this),\n                1);\n\n    lArguments[0] >>= xFrame;\n    if (!xFrame.is())\n        throw css::lang::IllegalArgumentException(\n                DECLARE_ASCII(\"No valid frame specified!\"),\n                static_cast< ::cppu::OWeakObject* >(this),\n                1);\n\n    \/\/ SAFE -> ----------------------------------\n    WriteGuard aWriteLock(m_aLock);\n    \/\/ hold the frame as weak reference(!) so it can die everytimes :-)\n    m_xFrame = xFrame;\n    aWriteLock.unlock();\n    \/\/ <- SAFE ----------------------------------\n\n    \/\/ start listening\n    xFrame->addFrameActionListener(this);\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL PersistentWindowState::frameAction(const css::frame::FrameActionEvent& aEvent)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ SAFE -> ----------------------------------\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::lang::XMultiServiceFactory > xSMGR = m_xSMGR ;\n    css::uno::Reference< css::frame::XFrame >              xFrame(m_xFrame.get(), css::uno::UNO_QUERY);\n    sal_Bool                                               bRestoreWindowState = !m_bWindowStateAlreadySet;\n    aReadLock.unlock();\n    \/\/ <- SAFE ----------------------------------\n\n    \/\/ frame already gone ? We hold it weak only ...\n    if (!xFrame.is())\n        return;\n\n    \/\/ no window -> no position and size available\n    css::uno::Reference< css::awt::XWindow > xWindow = xFrame->getContainerWindow();\n    if (!xWindow.is())\n        return;\n\n    \/\/ unknown module -> no configuration available!\n    ::rtl::OUString sModuleName = PersistentWindowState::implst_identifyModule(xSMGR, xFrame);\n    if (!sModuleName.getLength())\n        return;\n\n    switch(aEvent.Action)\n    {\n        case css::frame::FrameAction_COMPONENT_ATTACHED :\n            {\n                if (bRestoreWindowState)\n                {\n                    ::rtl::OUString sWindowState = PersistentWindowState::implst_getWindowStateFromConfig(xSMGR, sModuleName);\n                    PersistentWindowState::implst_setWindowStateOnWindow(xWindow,sWindowState);\n                    \/\/ SAFE -> ----------------------------------\n                    WriteGuard aWriteLock(m_aLock);\n                    m_bWindowStateAlreadySet = sal_True;\n                    aWriteLock.unlock();\n                    \/\/ <- SAFE ----------------------------------\n                }\n            }\n            break;\n\n        case css::frame::FrameAction_COMPONENT_REATTACHED :\n            {\n                \/\/ nothing todo here, because its not allowed to change position and size\n                \/\/ of an alredy existing frame!\n            }\n            break;\n\n        case css::frame::FrameAction_COMPONENT_DETACHING :\n            {\n                ::rtl::OUString sWindowState = PersistentWindowState::implst_getWindowStateFromWindow(xWindow);\n                PersistentWindowState::implst_setWindowStateOnConfig(xSMGR, sModuleName, sWindowState);\n            }\n            break;\n        default:\n            break;\n    }\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL PersistentWindowState::disposing(const css::lang::EventObject&)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ nothing todo here - because we hold the frame as weak reference only\n}\n\n\/\/*****************************************************************************************************************\n::rtl::OUString PersistentWindowState::implst_identifyModule(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR ,\n                                                             const css::uno::Reference< css::frame::XFrame >&              xFrame)\n{\n    ::rtl::OUString sModuleName;\n\n    css::uno::Reference< css::frame::XModuleManager > xModuleManager(\n        xSMGR->createInstance(SERVICENAME_MODULEMANAGER),\n        css::uno::UNO_QUERY_THROW);\n\n    try\n    {\n        sModuleName = xModuleManager->identify(xFrame);\n    }\n    catch(const css::uno::RuntimeException& exRun)\n        { throw exRun; }\n    catch(const css::uno::Exception&)\n        { sModuleName = ::rtl::OUString(); }\n\n    return sModuleName;\n}\n\n\/\/*****************************************************************************************************************\n::rtl::OUString PersistentWindowState::implst_getWindowStateFromConfig(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR      ,\n                                                                       const ::rtl::OUString&                                        sModuleName)\n{\n    ::rtl::OUString sWindowState;\n\n    ::rtl::OUStringBuffer sRelPathBuf(256);\n    sRelPathBuf.appendAscii(\"Office\/Factories\/*[\\\"\");\n    sRelPathBuf.append     (sModuleName            );\n    sRelPathBuf.appendAscii(\"\\\"]\"                  );\n\n    ::rtl::OUString sPackage = ::rtl::OUString::createFromAscii(\"org.openoffice.Setup\/\");\n    ::rtl::OUString sRelPath = sRelPathBuf.makeStringAndClear();\n    ::rtl::OUString sKey     = ::rtl::OUString::createFromAscii(\"ooSetupFactoryWindowAttributes\");\n\n    try\n    {\n        css::uno::Any aWindowState = ::comphelper::ConfigurationHelper::readDirectKey(xSMGR,\n                                                                                      sPackage,\n                                                                                      sRelPath,\n                                                                                      sKey,\n                                                                                      ::comphelper::ConfigurationHelper::E_READONLY);\n        aWindowState >>= sWindowState;\n    }\n    catch(const css::uno::RuntimeException& exRun)\n        { throw exRun; }\n    catch(const css::uno::Exception&)\n        { sWindowState = ::rtl::OUString(); }\n\n    return sWindowState;\n}\n\n\/\/*****************************************************************************************************************\nvoid PersistentWindowState::implst_setWindowStateOnConfig(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR       ,\n                                                          const ::rtl::OUString&                                        sModuleName ,\n                                                          const ::rtl::OUString&                                        sWindowState)\n{\n    ::rtl::OUStringBuffer sRelPathBuf(256);\n    sRelPathBuf.appendAscii(\"Office\/Factories\/*[\\\"\");\n    sRelPathBuf.append     (sModuleName            );\n    sRelPathBuf.appendAscii(\"\\\"]\"                  );\n\n    ::rtl::OUString sPackage = ::rtl::OUString::createFromAscii(\"org.openoffice.Setup\/\");\n    ::rtl::OUString sRelPath = sRelPathBuf.makeStringAndClear();\n    ::rtl::OUString sKey     = ::rtl::OUString::createFromAscii(\"ooSetupFactoryWindowAttributes\");\n\n    try\n    {\n        ::comphelper::ConfigurationHelper::writeDirectKey(xSMGR,\n                                                          sPackage,\n                                                          sRelPath,\n                                                          sKey,\n                                                          css::uno::makeAny(sWindowState),\n                                                          ::comphelper::ConfigurationHelper::E_STANDARD);\n    }\n    catch(const css::uno::RuntimeException& exRun)\n        { throw exRun; }\n    catch(const css::uno::Exception&)\n        {}\n}\n\n\/\/*****************************************************************************************************************\n::rtl::OUString PersistentWindowState::implst_getWindowStateFromWindow(const css::uno::Reference< css::awt::XWindow >& xWindow)\n{\n    ::rtl::OUString sWindowState;\n\n    if (xWindow.is())\n    {\n        \/\/ SOLAR SAFE -> ------------------------\n        ::vos::OClearableGuard aSolarLock(Application::GetSolarMutex());\n\n        Window* pWindow = VCLUnoHelper::GetWindow(xWindow);\n        \/\/ check for system window is neccessary to guarantee correct pointer cast!\n        if (\n            (pWindow                  ) &&\n            (pWindow->IsSystemWindow())\n           )\n        {\n            ULONG nMask  =   WINDOWSTATE_MASK_ALL;\n                  nMask &= ~(WINDOWSTATE_MASK_MINIMIZED);\n            sWindowState = B2U_ENC(\n                            ((SystemWindow*)pWindow)->GetWindowState(nMask),\n                            RTL_TEXTENCODING_UTF8);\n        }\n\n        aSolarLock.clear();\n        \/\/ <- SOLAR SAFE ------------------------\n    }\n\n    return sWindowState;\n}\n\n\n\/\/*********************************************************************************************************\nvoid PersistentWindowState::implst_setWindowStateOnWindow(const css::uno::Reference< css::awt::XWindow >& xWindow     ,\n                                                          const ::rtl::OUString&                          sWindowState)\n{\n    if (\n        (!xWindow.is()                ) ||\n        ( sWindowState.getLength() < 1)\n       )\n        return;\n\n    \/\/ SOLAR SAFE -> ------------------------\n    ::vos::OClearableGuard aSolarLock(Application::GetSolarMutex());\n\n    Window* pWindow = VCLUnoHelper::GetWindow(xWindow);\n    if (!pWindow)\n        return;\n\n    \/\/ check for system and work window - its neccessary to guarantee correct pointer cast!\n    sal_Bool bSystemWindow = pWindow->IsSystemWindow();\n    sal_Bool bWorkWindow   = (pWindow->GetType() == WINDOW_WORKWINDOW);\n\n    if (!bSystemWindow && !bWorkWindow)\n        return;\n\n    SystemWindow* pSystemWindow = (SystemWindow*)pWindow;\n    WorkWindow*   pWorkWindow   = (WorkWindow*  )pWindow;\n\n    \/\/ dont save this special state!\n    if (pWorkWindow->IsMinimized())\n        return;\n\n    pSystemWindow->SetWindowState(U2B_ENC(sWindowState,RTL_TEXTENCODING_UTF8));\n\n    aSolarLock.clear();\n    \/\/ <- SOLAR SAFE ------------------------\n}\n\n} \/\/ namespace framework\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#include \"PhaseFieldApp.h\"\n#include \"Moose.h\"\n#include \"AppFactory.h\"\n\n\/*\n * Kernels\n *\/\n#include \"ACGBPoly.h\"\n#include \"ACGrGrElasticDrivingForce.h\"\n#include \"ACGrGrPoly.h\"\n#include \"ACInterface.h\"\n#include \"ACMultiInterface.h\"\n#include \"ACParsed.h\"\n#include \"CahnHilliard.h\"\n#include \"CahnHilliardAniso.h\"\n#include \"CHBulkPFCTrad.h\"\n#include \"CHCpldPFCTrad.h\"\n#include \"CHInterface.h\"\n#include \"CHInterfaceAniso.h\"\n#include \"CHMath.h\"\n#include \"CHPFCRFF.h\"\n#include \"CHSplitVar.h\"\n#include \"ConservedLangevinNoise.h\"\n#include \"CoupledTimeDerivative.h\"\n#include \"HHPFCRFF.h\"\n#include \"KKSACBulkC.h\"\n#include \"KKSACBulkF.h\"\n#include \"KKSCHBulk.h\"\n#include \"KKSPhaseChemicalPotential.h\"\n#include \"KKSPhaseConcentration.h\"\n#include \"KKSSplitCHCRes.h\"\n#include \"LangevinNoise.h\"\n#include \"MaskedBodyForce.h\"\n#include \"MatDiffusion.h\"\n#include \"MultiGrainRigidBodyMotion.h\"\n#include \"PFFracBulkRate.h\"\n#include \"PFFracCoupledInterface.h\"\n#include \"PFFracIntVar.h\"\n#include \"SingleGrainRigidBodyMotion.h\"\n#include \"SoretDiffusion.h\"\n#include \"SplitCHMath.h\"\n#include \"SplitCHParsed.h\"\n#include \"SplitCHWRes.h\"\n#include \"SplitCHWResAniso.h\"\n#include \"SwitchingFunctionConstraintEta.h\"\n#include \"SwitchingFunctionConstraintLagrange.h\"\n#include \"SwitchingFunctionPenalty.h\"\n\n\/*\n * Initial Conditions\n *\/\n#include \"ClosePackIC.h\"\n#include \"CrossIC.h\"\n#include \"HexPolycrystalIC.h\"\n#include \"LatticeSmoothCircleIC.h\"\n#include \"MultiSmoothCircleIC.h\"\n#include \"PFCFreezingIC.h\"\n#include \"PolycrystalRandomIC.h\"\n#include \"PolycrystalReducedIC.h\"\n#include \"ReconVarIC.h\"\n#include \"RndBoundingBoxIC.h\"\n#include \"RndSmoothCircleIC.h\"\n#include \"SmoothCircleIC.h\"\n#include \"SpecifiedSmoothCircleIC.h\"\n#include \"ThumbIC.h\"\n#include \"Tricrystal2CircleGrainsIC.h\"\n\n\/*\n * Materials\n *\/\n#include \"BarrierFunctionMaterial.h\"\n#include \"ComputePolycrystalElasticityTensor.h\"\n#include \"ConstantAnisotropicMobility.h\"\n#include \"DerivativeMultiPhaseMaterial.h\"\n#include \"DerivativeParsedMaterial.h\"\n#include \"DerivativeSumMaterial.h\"\n#include \"DerivativeTwoPhaseMaterial.h\"\n#include \"DiscreteNucleation.h\"\n#include \"ElasticEnergyMaterial.h\"\n#include \"ExternalForceDensityMaterial.h\"\n#include \"ForceDensityMaterial.h\"\n#include \"GBAnisotropy.h\"\n#include \"GBEvolution.h\"\n#include \"GrainAdvectionVelocity.h\"\n#include \"KKSXeVacSolidMaterial.h\"\n#include \"LinearIsoElasticPFDamage.h\"\n#include \"MathEBFreeEnergy.h\"\n#include \"MathFreeEnergy.h\"\n#include \"MultiBarrierFunctionMaterial.h\"\n#include \"ParsedMaterial.h\"\n#include \"PFCRFFMaterial.h\"\n#include \"PFCTradMaterial.h\"\n#include \"PFFracBulkRateMaterial.h\"\n#include \"PFMobility.h\"\n#include \"PFParamsPolyFreeEnergy.h\"\n#include \"PolynomialFreeEnergy.h\"\n#include \"SwitchingFunctionMaterial.h\"\n#include \"CrossTermBarrierFunctionMaterial.h\"\n\n\/*\n * Postprocessors\n *\/\n#include \"FeatureFloodCount.h\"\n#include \"GrainTracker.h\"\n#include \"FauxGrainTracker.h\"\n#include \"NodalVolumeFraction.h\"\n#include \"PFCElementEnergyIntegral.h\"\n\n\/*\n * AuxKernels\n *\/\n#include \"BndsCalcAux.h\"\n#include \"CrossTermGradientFreeEnergy.h\"\n#include \"FeatureFloodCountAux.h\"\n#include \"KKSGlobalFreeEnergy.h\"\n#include \"PFCEnergyDensity.h\"\n#include \"PFCRFFEnergyDensity.h\"\n#include \"TestEBSDAux.h\"\n#include \"TotalFreeEnergy.h\"\n#include \"OutputEulerAngles.h\"\n\n\/*\n * Functions\n *\/\n#include \"ImageFunction.h\"\n\n\/*\n * User Objects\n *\/\n#include \"ComputeGrainCenterUserObject.h\"\n#include \"ComputeGrainForceAndTorque.h\"\n#include \"ConservedMaskedNormalNoise.h\"\n#include \"ConservedMaskedUniformNoise.h\"\n#include \"ConservedNormalNoise.h\"\n#include \"ConservedUniformNoise.h\"\n#include \"ConstantGrainForceAndTorque.h\"\n#include \"DiscreteNucleationInserter.h\"\n#include \"DiscreteNucleationMap.h\"\n#include \"GrainForceAndTorqueSum.h\"\n#include \"MaskedGrainForceAndTorque.h\"\n\n#include \"EBSDReader.h\"\n#include \"SolutionRasterizer.h\"\n\n\/*\n * Meshes\n *\/\n#include \"EBSDMesh.h\"\n#include \"ImageMesh.h\"\n\n\/*\n * Actions\n *\/\n#include \"BicrystalBoundingBoxICAction.h\"\n#include \"BicrystalCircleGrainICAction.h\"\n#include \"CHPFCRFFSplitKernelAction.h\"\n#include \"CHPFCRFFSplitVariablesAction.h\"\n#include \"HHPFCRFFSplitKernelAction.h\"\n#include \"HHPFCRFFSplitVariablesAction.h\"\n#include \"PFCRFFKernelAction.h\"\n#include \"PFCRFFVariablesAction.h\"\n#include \"PolycrystalElasticDrivingForceAction.h\"\n#include \"PolycrystalHexGrainICAction.h\"\n#include \"PolycrystalKernelAction.h\"\n#include \"PolycrystalRandomICAction.h\"\n#include \"PolycrystalVariablesAction.h\"\n#include \"PolycrystalVoronoiICAction.h\"\n#include \"ReconVarICAction.h\"\n#include \"Tricrystal2CircleGrainsICAction.h\"\n\n\/*\n * VectorPostprocessors\n *\/\n #include \"GrainCentersPostprocessor.h\"\n #include \"GrainForcesPostprocessor.h\"\n\n\ntemplate<>\nInputParameters validParams<PhaseFieldApp>()\n{\n  InputParameters params = validParams<MooseApp>();\n  params.set<bool>(\"use_legacy_uo_initialization\") = false;\n  params.set<bool>(\"use_legacy_uo_aux_computation\") = false;\n\n  return params;\n}\n\nPhaseFieldApp::PhaseFieldApp(const InputParameters & parameters) :\n    MooseApp(parameters)\n{\n  Moose::registerObjects(_factory);\n  PhaseFieldApp::registerObjects(_factory);\n\n  Moose::associateSyntax(_syntax, _action_factory);\n  PhaseFieldApp::associateSyntax(_syntax, _action_factory);\n}\n\nPhaseFieldApp::~PhaseFieldApp()\n{\n}\n\n\/\/ External entry point for dynamic application loading\nextern \"C\" void PhaseFieldApp__registerApps() { PhaseFieldApp::registerApps(); }\nvoid\nPhaseFieldApp::registerApps()\n{\n  registerApp(PhaseFieldApp);\n}\n\n\/\/ External entry point for dynamic object registration\nextern \"C\" void PhaseFieldApp__registerObjects(Factory & factory) { PhaseFieldApp::registerObjects(factory); }\nvoid\nPhaseFieldApp::registerObjects(Factory & factory)\n{\n  registerKernel(ACGBPoly);\n  registerKernel(ACGrGrElasticDrivingForce);\n  registerKernel(ACGrGrPoly);\n  registerKernel(ACInterface);\n  registerKernel(ACMultiInterface);\n  registerKernel(ACParsed);\n  registerKernel(CahnHilliard);\n  registerKernel(CahnHilliardAniso);\n  registerKernel(CHBulkPFCTrad);\n  registerKernel(CHCpldPFCTrad);\n  registerKernel(CHInterface);\n  registerKernel(CHInterfaceAniso);\n  registerKernel(CHMath);\n  registerKernel(CHPFCRFF);\n  registerKernel(CHSplitVar);\n  registerKernel(ConservedLangevinNoise);\n  registerKernel(HHPFCRFF);\n  registerKernel(KKSACBulkC);\n  registerKernel(KKSACBulkF);\n  registerKernel(KKSCHBulk);\n  registerKernel(KKSPhaseChemicalPotential);\n  registerKernel(KKSPhaseConcentration);\n  registerKernel(KKSSplitCHCRes);\n  registerKernel(LangevinNoise);\n  registerKernel(MaskedBodyForce);\n  registerKernel(MatDiffusion);\n  registerKernel(MultiGrainRigidBodyMotion);\n  registerKernel(PFFracBulkRate);\n  registerKernel(PFFracCoupledInterface);\n  registerKernel(PFFracIntVar);\n  registerKernel(SingleGrainRigidBodyMotion);\n  registerKernel(SoretDiffusion);\n  registerKernel(SplitCHMath);\n  registerKernel(SplitCHParsed);\n  registerKernel(SplitCHWRes);\n  registerKernel(SplitCHWResAniso);\n  registerKernel(SwitchingFunctionConstraintEta);\n  registerKernel(SwitchingFunctionConstraintLagrange);\n  registerKernel(SwitchingFunctionPenalty);\n  registerDeprecatedObjectName(CahnHilliard, \"CHParsed\", \"11\/01\/2015 00:00\");\n  registerDeprecatedObjectName(CoupledTimeDerivative, \"CoupledImplicitEuler\", \"09\/01\/2015 00:00\");\n\n  registerInitialCondition(ClosePackIC);\n  registerInitialCondition(CrossIC);\n  registerInitialCondition(HexPolycrystalIC);\n  registerInitialCondition(LatticeSmoothCircleIC);\n  registerInitialCondition(MultiSmoothCircleIC);\n  registerInitialCondition(PFCFreezingIC);\n  registerInitialCondition(PolycrystalRandomIC);\n  registerInitialCondition(PolycrystalReducedIC);\n  registerInitialCondition(ReconVarIC);\n  registerInitialCondition(RndBoundingBoxIC);\n  registerInitialCondition(RndSmoothCircleIC);\n  registerInitialCondition(SmoothCircleIC);\n  registerInitialCondition(SpecifiedSmoothCircleIC);\n  registerInitialCondition(ThumbIC);\n  registerInitialCondition(Tricrystal2CircleGrainsIC);\n\n  registerMaterial(BarrierFunctionMaterial);\n  registerMaterial(ComputePolycrystalElasticityTensor);\n  registerMaterial(ConstantAnisotropicMobility);\n  registerMaterial(DerivativeMultiPhaseMaterial);\n  registerMaterial(DerivativeParsedMaterial);\n  registerMaterial(DerivativeSumMaterial);\n  registerMaterial(DerivativeTwoPhaseMaterial);\n  registerMaterial(DiscreteNucleation);\n  registerMaterial(ElasticEnergyMaterial);\n  registerMaterial(ExternalForceDensityMaterial);\n  registerMaterial(ForceDensityMaterial);\n  registerMaterial(GBAnisotropy);\n  registerMaterial(GBEvolution);\n  registerMaterial(GrainAdvectionVelocity);\n  registerMaterial(KKSXeVacSolidMaterial);\n  registerMaterial(LinearIsoElasticPFDamage);\n  registerMaterial(MathEBFreeEnergy);\n  registerMaterial(MathFreeEnergy);\n  registerMaterial(MultiBarrierFunctionMaterial);\n  registerMaterial(ParsedMaterial);\n  registerMaterial(PFCRFFMaterial);\n  registerMaterial(PFCTradMaterial);\n  registerMaterial(PFFracBulkRateMaterial);\n  registerMaterial(PFMobility);\n  registerMaterial(PFParamsPolyFreeEnergy);\n  registerMaterial(PolynomialFreeEnergy);\n  registerMaterial(SwitchingFunctionMaterial);\n  registerMaterial(CrossTermBarrierFunctionMaterial);\n\n  registerPostprocessor(FeatureFloodCount);\n  registerPostprocessor(GrainTracker);\n  registerPostprocessor(FauxGrainTracker);\n  registerPostprocessor(NodalVolumeFraction);\n  registerPostprocessor(PFCElementEnergyIntegral);\n\n  registerAux(BndsCalcAux);\n  registerAux(CrossTermGradientFreeEnergy);\n  registerAux(FeatureFloodCountAux);\n  registerAux(KKSGlobalFreeEnergy);\n  registerAux(PFCEnergyDensity);\n  registerAux(PFCRFFEnergyDensity);\n  registerAux(TestEBSDAux);\n  registerAux(TotalFreeEnergy);\n  registerAux(OutputEulerAngles);\n\n  registerUserObject(ComputeGrainCenterUserObject);\n  registerUserObject(ComputeGrainForceAndTorque);\n  registerUserObject(ConservedMaskedNormalNoise);\n  registerUserObject(ConservedMaskedUniformNoise);\n  registerUserObject(ConservedNormalNoise);\n  registerUserObject(ConservedUniformNoise);\n  registerUserObject(ConstantGrainForceAndTorque);\n  registerUserObject(DiscreteNucleationInserter);\n  registerUserObject(DiscreteNucleationMap);\n  registerUserObject(GrainForceAndTorqueSum);\n  registerUserObject(MaskedGrainForceAndTorque);\n\n  registerUserObject(EBSDReader);\n  registerUserObject(SolutionRasterizer);\n\n  registerFunction(ImageFunction);\n\n  registerVectorPostprocessor(GrainCentersPostprocessor);\n  registerVectorPostprocessor(GrainForcesPostprocessor);\n\n  registerMesh(EBSDMesh);\n  registerMesh(ImageMesh);\n}\n\n\/\/ External entry point for dynamic syntax association\nextern \"C\" void PhaseFieldApp__associateSyntax(Syntax & syntax, ActionFactory & action_factory) { PhaseFieldApp::associateSyntax(syntax, action_factory); }\nvoid\nPhaseFieldApp::associateSyntax(Syntax & syntax, ActionFactory & action_factory)\n{\n  syntax.registerActionSyntax(\"BicrystalBoundingBoxICAction\", \"ICs\/PolycrystalICs\/BicrystalBoundingBoxIC\");\n  syntax.registerActionSyntax(\"BicrystalCircleGrainICAction\", \"ICs\/PolycrystalICs\/BicrystalCircleGrainIC\");\n  syntax.registerActionSyntax(\"CHPFCRFFSplitKernelAction\", \"Kernels\/CHPFCRFFSplitKernel\");\n  syntax.registerActionSyntax(\"CHPFCRFFSplitVariablesAction\", \"Variables\/CHPFCRFFSplitVariables\");\n  syntax.registerActionSyntax(\"EmptyAction\", \"ICs\/PolycrystalICs\");  \/\/ placeholder\n  syntax.registerActionSyntax(\"HHPFCRFFSplitKernelAction\", \"Kernels\/HHPFCRFFSplitKernel\");\n  syntax.registerActionSyntax(\"HHPFCRFFSplitVariablesAction\", \"Variables\/HHPFCRFFSplitVariables\");\n  syntax.registerActionSyntax(\"PFCRFFKernelAction\", \"Kernels\/PFCRFFKernel\");\n  syntax.registerActionSyntax(\"PFCRFFVariablesAction\", \"Variables\/PFCRFFVariables\");\n  syntax.registerActionSyntax(\"PolycrystalElasticDrivingForceAction\", \"Kernels\/PolycrystalElasticDrivingForce\");\n  syntax.registerActionSyntax(\"PolycrystalHexGrainICAction\", \"ICs\/PolycrystalICs\/PolycrystalHexGrainIC\");\n  syntax.registerActionSyntax(\"PolycrystalKernelAction\", \"Kernels\/PolycrystalKernel\");\n  syntax.registerActionSyntax(\"PolycrystalRandomICAction\", \"ICs\/PolycrystalICs\/PolycrystalRandomIC\");\n  syntax.registerActionSyntax(\"PolycrystalVariablesAction\", \"Variables\/PolycrystalVariables\");\n  syntax.registerActionSyntax(\"PolycrystalVoronoiICAction\", \"ICs\/PolycrystalICs\/PolycrystalVoronoiIC\");\n  syntax.registerActionSyntax(\"ReconVarICAction\", \"ICs\/PolycrystalICs\/ReconVarIC\");\n  syntax.registerActionSyntax(\"Tricrystal2CircleGrainsICAction\", \"ICs\/PolycrystalICs\/Tricrystal2CircleGrainsIC\");\n\n  registerAction(BicrystalBoundingBoxICAction, \"add_ic\");\n  registerAction(BicrystalCircleGrainICAction, \"add_ic\");\n  registerAction(CHPFCRFFSplitKernelAction, \"add_kernel\");\n  registerAction(CHPFCRFFSplitVariablesAction, \"add_variable\");\n  registerAction(HHPFCRFFSplitKernelAction, \"add_kernel\");\n  registerAction(HHPFCRFFSplitVariablesAction, \"add_variable\");\n  registerAction(PFCRFFKernelAction, \"add_kernel\");\n  registerAction(PFCRFFVariablesAction, \"add_variable\");\n  registerAction(PolycrystalElasticDrivingForceAction, \"add_kernel\");\n  registerAction(PolycrystalHexGrainICAction, \"add_ic\");\n  registerAction(PolycrystalKernelAction, \"add_kernel\");\n  registerAction(PolycrystalRandomICAction, \"add_ic\");\n  registerAction(PolycrystalVariablesAction, \"add_variable\");\n  registerAction(PolycrystalVoronoiICAction, \"add_ic\");\n  registerAction(ReconVarICAction, \"add_ic\");\n  registerAction(Tricrystal2CircleGrainsICAction, \"add_ic\");\n}\n<commit_msg>Deprecate PFMobility (#5597)<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#include \"PhaseFieldApp.h\"\n#include \"Moose.h\"\n#include \"AppFactory.h\"\n\n\/*\n * Kernels\n *\/\n#include \"ACGBPoly.h\"\n#include \"ACGrGrElasticDrivingForce.h\"\n#include \"ACGrGrPoly.h\"\n#include \"ACInterface.h\"\n#include \"ACMultiInterface.h\"\n#include \"ACParsed.h\"\n#include \"CahnHilliard.h\"\n#include \"CahnHilliardAniso.h\"\n#include \"CHBulkPFCTrad.h\"\n#include \"CHCpldPFCTrad.h\"\n#include \"CHInterface.h\"\n#include \"CHInterfaceAniso.h\"\n#include \"CHMath.h\"\n#include \"CHPFCRFF.h\"\n#include \"CHSplitVar.h\"\n#include \"ConservedLangevinNoise.h\"\n#include \"CoupledTimeDerivative.h\"\n#include \"HHPFCRFF.h\"\n#include \"KKSACBulkC.h\"\n#include \"KKSACBulkF.h\"\n#include \"KKSCHBulk.h\"\n#include \"KKSPhaseChemicalPotential.h\"\n#include \"KKSPhaseConcentration.h\"\n#include \"KKSSplitCHCRes.h\"\n#include \"LangevinNoise.h\"\n#include \"MaskedBodyForce.h\"\n#include \"MatDiffusion.h\"\n#include \"MultiGrainRigidBodyMotion.h\"\n#include \"PFFracBulkRate.h\"\n#include \"PFFracCoupledInterface.h\"\n#include \"PFFracIntVar.h\"\n#include \"SingleGrainRigidBodyMotion.h\"\n#include \"SoretDiffusion.h\"\n#include \"SplitCHMath.h\"\n#include \"SplitCHParsed.h\"\n#include \"SplitCHWRes.h\"\n#include \"SplitCHWResAniso.h\"\n#include \"SwitchingFunctionConstraintEta.h\"\n#include \"SwitchingFunctionConstraintLagrange.h\"\n#include \"SwitchingFunctionPenalty.h\"\n\n\/*\n * Initial Conditions\n *\/\n#include \"ClosePackIC.h\"\n#include \"CrossIC.h\"\n#include \"HexPolycrystalIC.h\"\n#include \"LatticeSmoothCircleIC.h\"\n#include \"MultiSmoothCircleIC.h\"\n#include \"PFCFreezingIC.h\"\n#include \"PolycrystalRandomIC.h\"\n#include \"PolycrystalReducedIC.h\"\n#include \"ReconVarIC.h\"\n#include \"RndBoundingBoxIC.h\"\n#include \"RndSmoothCircleIC.h\"\n#include \"SmoothCircleIC.h\"\n#include \"SpecifiedSmoothCircleIC.h\"\n#include \"ThumbIC.h\"\n#include \"Tricrystal2CircleGrainsIC.h\"\n\n\/*\n * Materials\n *\/\n#include \"BarrierFunctionMaterial.h\"\n#include \"ComputePolycrystalElasticityTensor.h\"\n#include \"ConstantAnisotropicMobility.h\"\n#include \"DerivativeMultiPhaseMaterial.h\"\n#include \"DerivativeParsedMaterial.h\"\n#include \"DerivativeSumMaterial.h\"\n#include \"DerivativeTwoPhaseMaterial.h\"\n#include \"DiscreteNucleation.h\"\n#include \"ElasticEnergyMaterial.h\"\n#include \"ExternalForceDensityMaterial.h\"\n#include \"ForceDensityMaterial.h\"\n#include \"GBAnisotropy.h\"\n#include \"GBEvolution.h\"\n#include \"GrainAdvectionVelocity.h\"\n#include \"KKSXeVacSolidMaterial.h\"\n#include \"LinearIsoElasticPFDamage.h\"\n#include \"MathEBFreeEnergy.h\"\n#include \"MathFreeEnergy.h\"\n#include \"MultiBarrierFunctionMaterial.h\"\n#include \"ParsedMaterial.h\"\n#include \"PFCRFFMaterial.h\"\n#include \"PFCTradMaterial.h\"\n#include \"PFFracBulkRateMaterial.h\"\n#include \"PFMobility.h\"\n#include \"PFParamsPolyFreeEnergy.h\"\n#include \"PolynomialFreeEnergy.h\"\n#include \"SwitchingFunctionMaterial.h\"\n#include \"CrossTermBarrierFunctionMaterial.h\"\n\n\/*\n * Postprocessors\n *\/\n#include \"FeatureFloodCount.h\"\n#include \"GrainTracker.h\"\n#include \"FauxGrainTracker.h\"\n#include \"NodalVolumeFraction.h\"\n#include \"PFCElementEnergyIntegral.h\"\n\n\/*\n * AuxKernels\n *\/\n#include \"BndsCalcAux.h\"\n#include \"CrossTermGradientFreeEnergy.h\"\n#include \"FeatureFloodCountAux.h\"\n#include \"KKSGlobalFreeEnergy.h\"\n#include \"PFCEnergyDensity.h\"\n#include \"PFCRFFEnergyDensity.h\"\n#include \"TestEBSDAux.h\"\n#include \"TotalFreeEnergy.h\"\n#include \"OutputEulerAngles.h\"\n\n\/*\n * Functions\n *\/\n#include \"ImageFunction.h\"\n\n\/*\n * User Objects\n *\/\n#include \"ComputeGrainCenterUserObject.h\"\n#include \"ComputeGrainForceAndTorque.h\"\n#include \"ConservedMaskedNormalNoise.h\"\n#include \"ConservedMaskedUniformNoise.h\"\n#include \"ConservedNormalNoise.h\"\n#include \"ConservedUniformNoise.h\"\n#include \"ConstantGrainForceAndTorque.h\"\n#include \"DiscreteNucleationInserter.h\"\n#include \"DiscreteNucleationMap.h\"\n#include \"GrainForceAndTorqueSum.h\"\n#include \"MaskedGrainForceAndTorque.h\"\n\n#include \"EBSDReader.h\"\n#include \"SolutionRasterizer.h\"\n\n\/*\n * Meshes\n *\/\n#include \"EBSDMesh.h\"\n#include \"ImageMesh.h\"\n\n\/*\n * Actions\n *\/\n#include \"BicrystalBoundingBoxICAction.h\"\n#include \"BicrystalCircleGrainICAction.h\"\n#include \"CHPFCRFFSplitKernelAction.h\"\n#include \"CHPFCRFFSplitVariablesAction.h\"\n#include \"HHPFCRFFSplitKernelAction.h\"\n#include \"HHPFCRFFSplitVariablesAction.h\"\n#include \"PFCRFFKernelAction.h\"\n#include \"PFCRFFVariablesAction.h\"\n#include \"PolycrystalElasticDrivingForceAction.h\"\n#include \"PolycrystalHexGrainICAction.h\"\n#include \"PolycrystalKernelAction.h\"\n#include \"PolycrystalRandomICAction.h\"\n#include \"PolycrystalVariablesAction.h\"\n#include \"PolycrystalVoronoiICAction.h\"\n#include \"ReconVarICAction.h\"\n#include \"Tricrystal2CircleGrainsICAction.h\"\n\n\/*\n * VectorPostprocessors\n *\/\n #include \"GrainCentersPostprocessor.h\"\n #include \"GrainForcesPostprocessor.h\"\n\n\ntemplate<>\nInputParameters validParams<PhaseFieldApp>()\n{\n  InputParameters params = validParams<MooseApp>();\n  params.set<bool>(\"use_legacy_uo_initialization\") = false;\n  params.set<bool>(\"use_legacy_uo_aux_computation\") = false;\n\n  return params;\n}\n\nPhaseFieldApp::PhaseFieldApp(const InputParameters & parameters) :\n    MooseApp(parameters)\n{\n  Moose::registerObjects(_factory);\n  PhaseFieldApp::registerObjects(_factory);\n\n  Moose::associateSyntax(_syntax, _action_factory);\n  PhaseFieldApp::associateSyntax(_syntax, _action_factory);\n}\n\nPhaseFieldApp::~PhaseFieldApp()\n{\n}\n\n\/\/ External entry point for dynamic application loading\nextern \"C\" void PhaseFieldApp__registerApps() { PhaseFieldApp::registerApps(); }\nvoid\nPhaseFieldApp::registerApps()\n{\n  registerApp(PhaseFieldApp);\n}\n\n\/\/ External entry point for dynamic object registration\nextern \"C\" void PhaseFieldApp__registerObjects(Factory & factory) { PhaseFieldApp::registerObjects(factory); }\nvoid\nPhaseFieldApp::registerObjects(Factory & factory)\n{\n  registerKernel(ACGBPoly);\n  registerKernel(ACGrGrElasticDrivingForce);\n  registerKernel(ACGrGrPoly);\n  registerKernel(ACInterface);\n  registerKernel(ACMultiInterface);\n  registerKernel(ACParsed);\n  registerKernel(CahnHilliard);\n  registerKernel(CahnHilliardAniso);\n  registerKernel(CHBulkPFCTrad);\n  registerKernel(CHCpldPFCTrad);\n  registerKernel(CHInterface);\n  registerKernel(CHInterfaceAniso);\n  registerKernel(CHMath);\n  registerKernel(CHPFCRFF);\n  registerKernel(CHSplitVar);\n  registerKernel(ConservedLangevinNoise);\n  registerKernel(HHPFCRFF);\n  registerKernel(KKSACBulkC);\n  registerKernel(KKSACBulkF);\n  registerKernel(KKSCHBulk);\n  registerKernel(KKSPhaseChemicalPotential);\n  registerKernel(KKSPhaseConcentration);\n  registerKernel(KKSSplitCHCRes);\n  registerKernel(LangevinNoise);\n  registerKernel(MaskedBodyForce);\n  registerKernel(MatDiffusion);\n  registerKernel(MultiGrainRigidBodyMotion);\n  registerKernel(PFFracBulkRate);\n  registerKernel(PFFracCoupledInterface);\n  registerKernel(PFFracIntVar);\n  registerKernel(SingleGrainRigidBodyMotion);\n  registerKernel(SoretDiffusion);\n  registerKernel(SplitCHMath);\n  registerKernel(SplitCHParsed);\n  registerKernel(SplitCHWRes);\n  registerKernel(SplitCHWResAniso);\n  registerKernel(SwitchingFunctionConstraintEta);\n  registerKernel(SwitchingFunctionConstraintLagrange);\n  registerKernel(SwitchingFunctionPenalty);\n  registerDeprecatedObjectName(CahnHilliard, \"CHParsed\", \"11\/01\/2015 00:00\");\n  registerDeprecatedObjectName(CoupledTimeDerivative, \"CoupledImplicitEuler\", \"09\/01\/2015 00:00\");\n\n  registerInitialCondition(ClosePackIC);\n  registerInitialCondition(CrossIC);\n  registerInitialCondition(HexPolycrystalIC);\n  registerInitialCondition(LatticeSmoothCircleIC);\n  registerInitialCondition(MultiSmoothCircleIC);\n  registerInitialCondition(PFCFreezingIC);\n  registerInitialCondition(PolycrystalRandomIC);\n  registerInitialCondition(PolycrystalReducedIC);\n  registerInitialCondition(ReconVarIC);\n  registerInitialCondition(RndBoundingBoxIC);\n  registerInitialCondition(RndSmoothCircleIC);\n  registerInitialCondition(SmoothCircleIC);\n  registerInitialCondition(SpecifiedSmoothCircleIC);\n  registerInitialCondition(ThumbIC);\n  registerInitialCondition(Tricrystal2CircleGrainsIC);\n\n  registerMaterial(BarrierFunctionMaterial);\n  registerMaterial(ComputePolycrystalElasticityTensor);\n  registerMaterial(ConstantAnisotropicMobility);\n  registerMaterial(DerivativeMultiPhaseMaterial);\n  registerMaterial(DerivativeParsedMaterial);\n  registerMaterial(DerivativeSumMaterial);\n  registerMaterial(DerivativeTwoPhaseMaterial);\n  registerMaterial(DiscreteNucleation);\n  registerMaterial(ElasticEnergyMaterial);\n  registerMaterial(ExternalForceDensityMaterial);\n  registerMaterial(ForceDensityMaterial);\n  registerMaterial(GBAnisotropy);\n  registerMaterial(GBEvolution);\n  registerMaterial(GrainAdvectionVelocity);\n  registerMaterial(KKSXeVacSolidMaterial);\n  registerMaterial(LinearIsoElasticPFDamage);\n  registerMaterial(MathEBFreeEnergy);\n  registerMaterial(MathFreeEnergy);\n  registerMaterial(MultiBarrierFunctionMaterial);\n  registerMaterial(ParsedMaterial);\n  registerMaterial(PFCRFFMaterial);\n  registerMaterial(PFCTradMaterial);\n  registerMaterial(PFFracBulkRateMaterial);\n  registerMaterial(PFParamsPolyFreeEnergy);\n  registerMaterial(PolynomialFreeEnergy);\n  registerMaterial(SwitchingFunctionMaterial);\n  registerMaterial(CrossTermBarrierFunctionMaterial);\n  registerDeprecatedObjectName(PFMobility, \"PFMobility\", \"09\/26\/2015 00:00\");\n\n  registerPostprocessor(FeatureFloodCount);\n  registerPostprocessor(GrainTracker);\n  registerPostprocessor(FauxGrainTracker);\n  registerPostprocessor(NodalVolumeFraction);\n  registerPostprocessor(PFCElementEnergyIntegral);\n\n  registerAux(BndsCalcAux);\n  registerAux(CrossTermGradientFreeEnergy);\n  registerAux(FeatureFloodCountAux);\n  registerAux(KKSGlobalFreeEnergy);\n  registerAux(PFCEnergyDensity);\n  registerAux(PFCRFFEnergyDensity);\n  registerAux(TestEBSDAux);\n  registerAux(TotalFreeEnergy);\n  registerAux(OutputEulerAngles);\n\n  registerUserObject(ComputeGrainCenterUserObject);\n  registerUserObject(ComputeGrainForceAndTorque);\n  registerUserObject(ConservedMaskedNormalNoise);\n  registerUserObject(ConservedMaskedUniformNoise);\n  registerUserObject(ConservedNormalNoise);\n  registerUserObject(ConservedUniformNoise);\n  registerUserObject(ConstantGrainForceAndTorque);\n  registerUserObject(DiscreteNucleationInserter);\n  registerUserObject(DiscreteNucleationMap);\n  registerUserObject(GrainForceAndTorqueSum);\n  registerUserObject(MaskedGrainForceAndTorque);\n\n  registerUserObject(EBSDReader);\n  registerUserObject(SolutionRasterizer);\n\n  registerFunction(ImageFunction);\n\n  registerVectorPostprocessor(GrainCentersPostprocessor);\n  registerVectorPostprocessor(GrainForcesPostprocessor);\n\n  registerMesh(EBSDMesh);\n  registerMesh(ImageMesh);\n}\n\n\/\/ External entry point for dynamic syntax association\nextern \"C\" void PhaseFieldApp__associateSyntax(Syntax & syntax, ActionFactory & action_factory) { PhaseFieldApp::associateSyntax(syntax, action_factory); }\nvoid\nPhaseFieldApp::associateSyntax(Syntax & syntax, ActionFactory & action_factory)\n{\n  syntax.registerActionSyntax(\"BicrystalBoundingBoxICAction\", \"ICs\/PolycrystalICs\/BicrystalBoundingBoxIC\");\n  syntax.registerActionSyntax(\"BicrystalCircleGrainICAction\", \"ICs\/PolycrystalICs\/BicrystalCircleGrainIC\");\n  syntax.registerActionSyntax(\"CHPFCRFFSplitKernelAction\", \"Kernels\/CHPFCRFFSplitKernel\");\n  syntax.registerActionSyntax(\"CHPFCRFFSplitVariablesAction\", \"Variables\/CHPFCRFFSplitVariables\");\n  syntax.registerActionSyntax(\"EmptyAction\", \"ICs\/PolycrystalICs\");  \/\/ placeholder\n  syntax.registerActionSyntax(\"HHPFCRFFSplitKernelAction\", \"Kernels\/HHPFCRFFSplitKernel\");\n  syntax.registerActionSyntax(\"HHPFCRFFSplitVariablesAction\", \"Variables\/HHPFCRFFSplitVariables\");\n  syntax.registerActionSyntax(\"PFCRFFKernelAction\", \"Kernels\/PFCRFFKernel\");\n  syntax.registerActionSyntax(\"PFCRFFVariablesAction\", \"Variables\/PFCRFFVariables\");\n  syntax.registerActionSyntax(\"PolycrystalElasticDrivingForceAction\", \"Kernels\/PolycrystalElasticDrivingForce\");\n  syntax.registerActionSyntax(\"PolycrystalHexGrainICAction\", \"ICs\/PolycrystalICs\/PolycrystalHexGrainIC\");\n  syntax.registerActionSyntax(\"PolycrystalKernelAction\", \"Kernels\/PolycrystalKernel\");\n  syntax.registerActionSyntax(\"PolycrystalRandomICAction\", \"ICs\/PolycrystalICs\/PolycrystalRandomIC\");\n  syntax.registerActionSyntax(\"PolycrystalVariablesAction\", \"Variables\/PolycrystalVariables\");\n  syntax.registerActionSyntax(\"PolycrystalVoronoiICAction\", \"ICs\/PolycrystalICs\/PolycrystalVoronoiIC\");\n  syntax.registerActionSyntax(\"ReconVarICAction\", \"ICs\/PolycrystalICs\/ReconVarIC\");\n  syntax.registerActionSyntax(\"Tricrystal2CircleGrainsICAction\", \"ICs\/PolycrystalICs\/Tricrystal2CircleGrainsIC\");\n\n  registerAction(BicrystalBoundingBoxICAction, \"add_ic\");\n  registerAction(BicrystalCircleGrainICAction, \"add_ic\");\n  registerAction(CHPFCRFFSplitKernelAction, \"add_kernel\");\n  registerAction(CHPFCRFFSplitVariablesAction, \"add_variable\");\n  registerAction(HHPFCRFFSplitKernelAction, \"add_kernel\");\n  registerAction(HHPFCRFFSplitVariablesAction, \"add_variable\");\n  registerAction(PFCRFFKernelAction, \"add_kernel\");\n  registerAction(PFCRFFVariablesAction, \"add_variable\");\n  registerAction(PolycrystalElasticDrivingForceAction, \"add_kernel\");\n  registerAction(PolycrystalHexGrainICAction, \"add_ic\");\n  registerAction(PolycrystalKernelAction, \"add_kernel\");\n  registerAction(PolycrystalRandomICAction, \"add_ic\");\n  registerAction(PolycrystalVariablesAction, \"add_variable\");\n  registerAction(PolycrystalVoronoiICAction, \"add_ic\");\n  registerAction(ReconVarICAction, \"add_ic\");\n  registerAction(Tricrystal2CircleGrainsICAction, \"add_ic\");\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 :: Modules                               *\n*                                                                             *\n* Authors: The SOFA Team and external contributors (see Authors.txt)          *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n#include \"CudaTypes.h\"\n#include \"CudaParticleSource.inl\"\n#include <sofa\/core\/ObjectFactory.h>\n\n\nnamespace sofa\n{\n\nnamespace core\n{\nnamespace behavior\n{\ntemplate class ProjectiveConstraintSet<gpu::cuda::CudaVec3fTypes>;\n#ifdef SOFA_GPU_CUDA_DOUBLE\ntemplate class Constraint<gpu::cuda::CudaVec3dTypes>;\n#endif\n} \/\/ namespace behavior\n} \/\/ namespace core\n\nnamespace gpu\n{\n\nnamespace cuda\n{\n\n\n\nSOFA_DECL_CLASS(CudaParticleSource)\n\nint ParticleSourceCudaClass = core::RegisterObject(\"Supports GPU-side computations using CUDA\")\n        .add< component::misc::ParticleSource<CudaVec3fTypes> >()\n#ifdef SOFA_GPU_CUDA_DOUBLE\n        .add< component::misc::ParticleSource<CudaVec3dTypes> >()\n#endif \/\/ SOFA_GPU_CUDA_DOUBLE\n        ;\n\n} \/\/ namespace cuda\n\n} \/\/ namespace gpu\n\n} \/\/ namespace sofa\n<commit_msg>r7826\/sofa-dev : FIX: compilation with SOFA_GPU_CUDA_DOUBLE and compilation of self-ccd on Linux<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 :: Modules                               *\n*                                                                             *\n* Authors: The SOFA Team and external contributors (see Authors.txt)          *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n#include \"CudaTypes.h\"\n#include \"CudaParticleSource.inl\"\n#include <sofa\/core\/ObjectFactory.h>\n\n\nnamespace sofa\n{\n\nnamespace core\n{\nnamespace behavior\n{\ntemplate class ProjectiveConstraintSet<gpu::cuda::CudaVec3fTypes>;\n#ifdef SOFA_GPU_CUDA_DOUBLE\ntemplate class ProjectiveConstraintSet<gpu::cuda::CudaVec3dTypes>;\n#endif\n} \/\/ namespace behavior\n} \/\/ namespace core\n\nnamespace gpu\n{\n\nnamespace cuda\n{\n\n\n\nSOFA_DECL_CLASS(CudaParticleSource)\n\nint ParticleSourceCudaClass = core::RegisterObject(\"Supports GPU-side computations using CUDA\")\n        .add< component::misc::ParticleSource<CudaVec3fTypes> >()\n#ifdef SOFA_GPU_CUDA_DOUBLE\n        .add< component::misc::ParticleSource<CudaVec3dTypes> >()\n#endif \/\/ SOFA_GPU_CUDA_DOUBLE\n        ;\n\n} \/\/ namespace cuda\n\n} \/\/ namespace gpu\n\n} \/\/ namespace sofa\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: supplang.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: vg $ $Date: 2007-05-25 12:25: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_linguistic.hxx\"\n\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _FSYS_HXX\n#include <tools\/fsys.hxx>\n#endif\n#ifndef _URLOBJ_HXX\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _UCBHELPER_CONTENT_HXX\n#include <ucbhelper\/content.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX \/\/autogen wg. DBG_ASSERT\n#include <tools\/debug.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#include <svtools\/pathoptions.hxx>\n#endif\n#ifndef _UNOTOOLS_PROCESSFACTORY_HXX_\n#include <unotools\/processfactory.hxx>\n#endif\n#ifndef _UNOTOOLS_LOCALFILEHELPER_HXX\n#include <unotools\/localfilehelper.hxx>\n#endif\n#ifndef _UNOTOOLS_LOCALEDATAWRAPPER_HXX\n#include <unotools\/localedatawrapper.hxx>\n#endif\n\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XFASTPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XFastPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYCHANGELISTENER_HPP_\n#include <com\/sun\/star\/beans\/XPropertyChangeListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XTERMINATELISTENER_HPP_\n#include <com\/sun\/star\/frame\/XTerminateListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XDESKTOP_HPP_\n#include <com\/sun\/star\/frame\/XDesktop.hpp>\n#endif\n\n#include <com\/sun\/star\/beans\/PropertyValues.hpp>\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <com\/sun\/star\/linguistic2\/XDictionary1.hpp>\n#include <com\/sun\/star\/linguistic2\/DictionaryType.hpp>\n#include <com\/sun\/star\/linguistic2\/XSearchableDictionaryList.hpp>\n\n#include \"misc.hxx\"\n#include \"lngprops.hxx\"\n#include \"supplang.hxx\"\n\nusing namespace utl;\nusing namespace osl;\nusing namespace rtl;\nusing namespace com::sun::star;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::linguistic2;\nusing namespace linguistic;\n\nnamespace linguistic\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOL FileExists( const String &rMainURL )\n{\n    BOOL bExists = FALSE;\n    if (rMainURL.Len())\n    {\n        try\n        {\n            ::ucb::Content aContent( rMainURL,\n                    Reference< ::com::sun::star::ucb::XCommandEnvironment >());\n            bExists = aContent.isDocument();\n        }\n        catch(Exception &)\n        {\n        }\n    }\n    return bExists;\n}\n\nString GetFileURL( SvtPathOptions::Pathes ePath, const String &rFileName )\n{\n    String aURL;\n    if (rFileName.Len())\n    {\n        INetURLObject aURLObj;\n        aURLObj.SetSmartProtocol( INET_PROT_FILE );\n        aURLObj.SetSmartURL( GetModulePath(ePath) );\n        DBG_ASSERT(!aURLObj.HasError(), \"lng : invalid URL\");\n        aURLObj.Append( rFileName );\n        DBG_ASSERT(!aURLObj.HasError(), \"lng : invalid URL\");\n        aURL = aURLObj.GetMainURL( INetURLObject::DECODE_TO_IURI );\n    }\n    return aURL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nINT16 & LanguageState::GetState( ModuleName eModule )\n{\n    if ( MOD_SPELL == eModule )\n        return nSpellState;\n    else if ( MOD_HYPH == eModule )\n        return nHyphState;\n    else\n    {\n        DBG_ASSERT( MOD_THES == eModule, \"unexpected argument\" );\n        return nThesState;\n    }\n}\n\n\nLanguageState * GetLanguageState( INT16 nLanguage, LanguageState *pArray )\n{\n    if (!pArray)\n        return 0;\n\n    LanguageState   *pState = pArray;\n    INT16 nLang;\n    while ((nLang = pState->nLanguage) != LANGUAGE_NONE  &&  nLang != nLanguage)\n        ++pState;\n    return nLang == LANGUAGE_NONE ? 0 : pState;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSuppLanguages::SuppLanguages( LanguageState *pState, USHORT nCount)\n{\n    for (USHORT i = 0;  i < nCount;  ++i)\n        aLanguages.Insert( pState[i].nLanguage, new INT16( LANG_QUERY ) );\n}\n\n\nSuppLanguages::~SuppLanguages()\n{\n    INT16 *pItem = aLanguages.First();\n    while (pItem)\n    {\n        INT16 *pTmp = pItem;\n        pItem = aLanguages.Next();\n        delete pTmp;\n    }\n}\n\n\nBOOL SuppLanguages::HasLanguage( INT16 nLanguage ) const\n{\n    BOOL bRes = FALSE;\n    SuppLanguages *pThis = (SuppLanguages *) this;\n    INT16 *pEntry = pThis->aLanguages.Seek( nLanguage );\n    if (pEntry)\n    {\n        INT16 nState = *pEntry;\n        if (LANG_QUERY == nState)\n        {\n            nState = CheckLanguage( nLanguage );\n            pThis->aLanguages.Replace( nLanguage, new INT16( nState ) );\n        }\n        bRes = LANG_OK == nState;\n    }\n    return bRes;\n}\n\n\nconst Sequence< INT16 > SuppLanguages::GetLanguages() const\n{\n    INT32 nLen = aLanguages.Count();\n    Sequence< INT16 > aRes( nLen );\n    INT16 *pRes = aRes.getArray();\n    USHORT nCnt = 0;\n    for (INT32 i = 0;  i < nLen;  ++i)\n    {\n        INT16 nLanguage = sal::static_int_cast< INT16 >(aLanguages.GetObjectKey( i ));\n        if (HasLanguage( nLanguage ))\n            pRes[ nCnt++ ] = nLanguage;\n    }\n    aRes.realloc( nCnt );\n    return aRes;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nString  GetModulePath( SvtPathOptions::Pathes ePath, BOOL bAddAccessDelim  )\n{\n    String aRes;\n\n    SvtPathOptions  aPathOpt;\n    switch (ePath)\n    {\n        case SvtPathOptions::PATH_MODULE :\n            aRes = aPathOpt.GetModulePath();\n            break;\n        case SvtPathOptions::PATH_LINGUISTIC :\n        {\n            String aTmp( aPathOpt.GetLinguisticPath() );\n            LocalFileHelper::ConvertURLToPhysicalName( aTmp, aRes );\n            break;\n        }\n        case SvtPathOptions::PATH_USERDICTIONARY :\n        {\n            String aTmp( aPathOpt.GetUserDictionaryPath() );\n            LocalFileHelper::ConvertURLToPhysicalName( aTmp, aRes );\n            break;\n        }\n        default:\n            DBG_ERROR( \"unexpected argument (path)\" );\n    }\n    if (bAddAccessDelim && aRes.Len())\n    {\n#ifdef WNT\n        aRes += '\\\\';\n#else\n        aRes += '\/';\n#endif\n    }\n\n    return aRes;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nOUString StripTrailingChars( OUString &rTxt, sal_Unicode cChar )\n{\n    sal_Int32 nTrailing = 0;\n    sal_Int32 nTxtLen = rTxt.getLength();\n    sal_Int32 nIdx = nTxtLen - 1;\n    while (nIdx >= 0 && rTxt[ nIdx-- ] == cChar)\n        ++nTrailing;\n\n    OUString aRes( rTxt.copy( nTxtLen - nTrailing ) );\n    rTxt = rTxt.copy( 0, nTxtLen - nTrailing );\n    return aRes;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}   \/\/ namespace linguistic\n\n<commit_msg>INTEGRATION: CWS bgdlremove (1.5.12); FILE MERGED 2007\/05\/18 09:08:35 kso 1.5.12.2: #i77419# - cleanup of ucbhelper namespaces. 2007\/05\/11 09:01:02 kso 1.5.12.1: #i76911# - ucbhelper lib no longer uses VOS. (vos::ORef => rtl::Reference, vos::OMutex => osl::Mutex, ...)<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: supplang.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: ihi $ $Date: 2007-06-05 14:29:53 $\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_linguistic.hxx\"\n\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _FSYS_HXX\n#include <tools\/fsys.hxx>\n#endif\n#ifndef _URLOBJ_HXX\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _UCBHELPER_CONTENT_HXX\n#include <ucbhelper\/content.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX \/\/autogen wg. DBG_ASSERT\n#include <tools\/debug.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#include <svtools\/pathoptions.hxx>\n#endif\n#ifndef _UNOTOOLS_PROCESSFACTORY_HXX_\n#include <unotools\/processfactory.hxx>\n#endif\n#ifndef _UNOTOOLS_LOCALFILEHELPER_HXX\n#include <unotools\/localfilehelper.hxx>\n#endif\n#ifndef _UNOTOOLS_LOCALEDATAWRAPPER_HXX\n#include <unotools\/localedatawrapper.hxx>\n#endif\n\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XFASTPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XFastPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYCHANGELISTENER_HPP_\n#include <com\/sun\/star\/beans\/XPropertyChangeListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XTERMINATELISTENER_HPP_\n#include <com\/sun\/star\/frame\/XTerminateListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XDESKTOP_HPP_\n#include <com\/sun\/star\/frame\/XDesktop.hpp>\n#endif\n\n#include <com\/sun\/star\/beans\/PropertyValues.hpp>\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <com\/sun\/star\/linguistic2\/XDictionary1.hpp>\n#include <com\/sun\/star\/linguistic2\/DictionaryType.hpp>\n#include <com\/sun\/star\/linguistic2\/XSearchableDictionaryList.hpp>\n\n#include \"misc.hxx\"\n#include \"lngprops.hxx\"\n#include \"supplang.hxx\"\n\nusing namespace utl;\nusing namespace osl;\nusing namespace rtl;\nusing namespace com::sun::star;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::linguistic2;\nusing namespace linguistic;\n\nnamespace linguistic\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOL FileExists( const String &rMainURL )\n{\n    BOOL bExists = FALSE;\n    if (rMainURL.Len())\n    {\n        try\n        {\n            ::ucbhelper::Content aContent( rMainURL,\n                    uno::Reference< ::com::sun::star::ucb::XCommandEnvironment >());\n            bExists = aContent.isDocument();\n        }\n        catch(Exception &)\n        {\n        }\n    }\n    return bExists;\n}\n\nString GetFileURL( SvtPathOptions::Pathes ePath, const String &rFileName )\n{\n    String aURL;\n    if (rFileName.Len())\n    {\n        INetURLObject aURLObj;\n        aURLObj.SetSmartProtocol( INET_PROT_FILE );\n        aURLObj.SetSmartURL( GetModulePath(ePath) );\n        DBG_ASSERT(!aURLObj.HasError(), \"lng : invalid URL\");\n        aURLObj.Append( rFileName );\n        DBG_ASSERT(!aURLObj.HasError(), \"lng : invalid URL\");\n        aURL = aURLObj.GetMainURL( INetURLObject::DECODE_TO_IURI );\n    }\n    return aURL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nINT16 & LanguageState::GetState( ModuleName eModule )\n{\n    if ( MOD_SPELL == eModule )\n        return nSpellState;\n    else if ( MOD_HYPH == eModule )\n        return nHyphState;\n    else\n    {\n        DBG_ASSERT( MOD_THES == eModule, \"unexpected argument\" );\n        return nThesState;\n    }\n}\n\n\nLanguageState * GetLanguageState( INT16 nLanguage, LanguageState *pArray )\n{\n    if (!pArray)\n        return 0;\n\n    LanguageState   *pState = pArray;\n    INT16 nLang;\n    while ((nLang = pState->nLanguage) != LANGUAGE_NONE  &&  nLang != nLanguage)\n        ++pState;\n    return nLang == LANGUAGE_NONE ? 0 : pState;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSuppLanguages::SuppLanguages( LanguageState *pState, USHORT nCount)\n{\n    for (USHORT i = 0;  i < nCount;  ++i)\n        aLanguages.Insert( pState[i].nLanguage, new INT16( LANG_QUERY ) );\n}\n\n\nSuppLanguages::~SuppLanguages()\n{\n    INT16 *pItem = aLanguages.First();\n    while (pItem)\n    {\n        INT16 *pTmp = pItem;\n        pItem = aLanguages.Next();\n        delete pTmp;\n    }\n}\n\n\nBOOL SuppLanguages::HasLanguage( INT16 nLanguage ) const\n{\n    BOOL bRes = FALSE;\n    SuppLanguages *pThis = (SuppLanguages *) this;\n    INT16 *pEntry = pThis->aLanguages.Seek( nLanguage );\n    if (pEntry)\n    {\n        INT16 nState = *pEntry;\n        if (LANG_QUERY == nState)\n        {\n            nState = CheckLanguage( nLanguage );\n            pThis->aLanguages.Replace( nLanguage, new INT16( nState ) );\n        }\n        bRes = LANG_OK == nState;\n    }\n    return bRes;\n}\n\n\nconst Sequence< INT16 > SuppLanguages::GetLanguages() const\n{\n    INT32 nLen = aLanguages.Count();\n    Sequence< INT16 > aRes( nLen );\n    INT16 *pRes = aRes.getArray();\n    USHORT nCnt = 0;\n    for (INT32 i = 0;  i < nLen;  ++i)\n    {\n        INT16 nLanguage = sal::static_int_cast< INT16 >(aLanguages.GetObjectKey( i ));\n        if (HasLanguage( nLanguage ))\n            pRes[ nCnt++ ] = nLanguage;\n    }\n    aRes.realloc( nCnt );\n    return aRes;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nString  GetModulePath( SvtPathOptions::Pathes ePath, BOOL bAddAccessDelim  )\n{\n    String aRes;\n\n    SvtPathOptions  aPathOpt;\n    switch (ePath)\n    {\n        case SvtPathOptions::PATH_MODULE :\n            aRes = aPathOpt.GetModulePath();\n            break;\n        case SvtPathOptions::PATH_LINGUISTIC :\n        {\n            String aTmp( aPathOpt.GetLinguisticPath() );\n            LocalFileHelper::ConvertURLToPhysicalName( aTmp, aRes );\n            break;\n        }\n        case SvtPathOptions::PATH_USERDICTIONARY :\n        {\n            String aTmp( aPathOpt.GetUserDictionaryPath() );\n            LocalFileHelper::ConvertURLToPhysicalName( aTmp, aRes );\n            break;\n        }\n        default:\n            DBG_ERROR( \"unexpected argument (path)\" );\n    }\n    if (bAddAccessDelim && aRes.Len())\n    {\n#ifdef WNT\n        aRes += '\\\\';\n#else\n        aRes += '\/';\n#endif\n    }\n\n    return aRes;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nOUString StripTrailingChars( OUString &rTxt, sal_Unicode cChar )\n{\n    sal_Int32 nTrailing = 0;\n    sal_Int32 nTxtLen = rTxt.getLength();\n    sal_Int32 nIdx = nTxtLen - 1;\n    while (nIdx >= 0 && rTxt[ nIdx-- ] == cChar)\n        ++nTrailing;\n\n    OUString aRes( rTxt.copy( nTxtLen - nTrailing ) );\n    rTxt = rTxt.copy( 0, nTxtLen - nTrailing );\n    return aRes;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}   \/\/ namespace linguistic\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: nodechangeinfo.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: ihi $ $Date: 2007-11-23 14:43:38 $\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_configmgr.hxx\"\n\n#include \"nodechangeinfo.hxx\"\n\n#include \"noderef.hxx\"\n#include \"treeimpl.hxx\"\n\nnamespace configmgr\n{\n    namespace configuration\n    {\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeData::NodeChangeData()\n: type(eNoChange)\n, unoData()\n, element()\n{\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeData::NodeChangeData(NodeChangeData const& aOther)\n: type(aOther.type)\n, unoData(aOther.unoData)\n, element(aOther.element)\n{\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeData& NodeChangeData::operator=(NodeChangeData const& aOther)\n{\n    type        = aOther.type;\n    unoData     = aOther.unoData;\n    element     = aOther.element;\n    return *this;\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeData::~NodeChangeData()\n{\n}\n\/\/-----------------------------------------------------------------------------\n\nbool NodeChangeData::isDataChange() const\n{\n    if (isSetChange() && element.isDataChange())\n        return true;\n\n    return unoData.isDataChange();\n}\n\/\/-----------------------------------------------------------------------------\n\nTree NodeChangeData::getNewElementTree() const\n{\n    return Tree( element.newValue.get() );\n}\n\/\/-----------------------------------------------------------------------------\n\nTree NodeChangeData::getOldElementTree() const\n{\n    return Tree( element.oldValue.get() );\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeRef NodeChangeData::getNewElementNodeRef() const\n{\n    ElementTreeHolder newElement = this->element.newValue;\n    if ( newElement.is() &&  newElement->nodeCount() > 0)\n    {\n        NodeOffset n = newElement->root_();\n        return TreeImplHelper::makeNode( *newElement, n);\n    }\n    else\n        return NodeRef();\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeRef NodeChangeData::getOldElementNodeRef() const\n{\n    ElementTreeHolder oldElement = this->element.oldValue;\n    if ( oldElement.is() &&  oldElement->nodeCount() > 0)\n    {\n        NodeOffset n = oldElement->root_();\n        return TreeImplHelper::makeNode( *oldElement, n);\n    }\n    else\n        return NodeRef();\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeID NodeChangeData::getNewElementNodeID() const\n{\n    ElementTreeHolder newElement = this->element.newValue;\n    if ( newElement.is() &&  newElement->nodeCount() > 0)\n    {\n        return NodeID( newElement.get(), newElement->root_() );\n    }\n    else\n        return NodeID(0,0);\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeID NodeChangeData::getOldElementNodeID() const\n{\n    ElementTreeHolder oldElement = this->element.oldValue;\n    if ( oldElement.is() &&  oldElement->nodeCount() > 0)\n    {\n        return NodeID( oldElement.get(), oldElement->root_() );\n    }\n    else\n        return NodeID(0,0);\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeLocation::NodeChangeLocation()\n: m_path()\n, m_base(0,0)\n, m_affected(0,0)\n, m_bSubNodeChanging(false)\n{\n}\n\/\/-----------------------------------------------------------------------------\nbool NodeChangeLocation::isValidLocation() const\n{\n    return   m_base.isValidNode() &&\n            (m_affected.isEmpty()\n                ?   ! m_bSubNodeChanging\n                :   ( m_affected.isValidNode() &&\n                      (! m_bSubNodeChanging ||\n                         (!m_path.isEmpty() &&\n                            SubNodeID(m_affected,m_path.getLocalName().getName()).isValidNode()\n                    ) )  ) );\n}\n\/\/-----------------------------------------------------------------------------\nbool NodeChangeLocation::isValidData() const\n{\n    return   m_base.isValidNode() &&\n            (m_affected.isEmpty()\n                ?   ! m_bSubNodeChanging\n                :   ( m_affected.isValidNode() &&\n                      (! m_bSubNodeChanging || !m_path.isEmpty() )\n            )       );\n}\n\/\/-----------------------------------------------------------------------------\n\nvoid NodeChangeLocation::setAccessor(RelativePath const& aAccessor)\n{\n    m_path = aAccessor;\n}\n\/\/-----------------------------------------------------------------------------\n\nvoid NodeChangeLocation::setBase(NodeID const& aBaseNode)\n{\n    m_base = aBaseNode;\n}\n\/\/-----------------------------------------------------------------------------\n\nvoid NodeChangeLocation::setAffected(NodeID const& aTargetNode)\n{\n    m_affected = aTargetNode;\n\n    if (m_base.isEmpty())\n        setBase(aTargetNode);\n}\n\/\/-----------------------------------------------------------------------------\n\nvoid NodeChangeLocation::setChangingSubnode( bool bSubnode )\n{\n    OSL_ENSURE(!m_affected.isEmpty() || !bSubnode, \"Change without target cannot affect subnode\");\n\n    m_bSubNodeChanging = bSubnode;\n}\n\/\/-----------------------------------------------------------------------------\n\nTree NodeChangeLocation::getBaseTree() const\n{\n    OSL_ENSURE(m_base.isValidNode(), \"Invalid base location set in NodeChangeLocation\");\n    return Tree( TreeImplHelper::tree(m_base) );\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeRef NodeChangeLocation::getBaseNode() const\n{\n    OSL_ENSURE(m_base.isValidNode(), \"Invalid base location set in NodeChangeLocation\");\n    return TreeImplHelper::makeNode(m_base);\n}\n\/\/-----------------------------------------------------------------------------\n\nTreeRef NodeChangeLocation::getAffectedTreeRef() const\n{\n    NodeID aAffected = this->getAffectedNodeID();\n    return TreeRef( TreeImplHelper::tree(aAffected) );\n}\n\/\/-----------------------------------------------------------------------------\n\nTree NodeChangeLocation::getAffectedTree() const\n{\n    return Tree( getAffectedTreeRef() );\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeRef NodeChangeLocation::getAffectedNode() const\n{\n    NodeID aAffected = this->getAffectedNodeID();\n    return TreeImplHelper::makeNode(aAffected);\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeID NodeChangeLocation::getAffectedNodeID() const\n{\n    OSL_ENSURE(m_affected.isEmpty() || m_affected.isValidNode(), \"Invalid target location set in NodeChangeLocation\");\n    return m_affected;\n}\n\/\/-----------------------------------------------------------------------------\n\nSubNodeID NodeChangeLocation::getChangingValueID() const\n{\n    if (!m_bSubNodeChanging) return SubNodeID::createEmpty();\n\n    OSL_ENSURE(!m_affected.isEmpty() && m_affected.isValidNode(), \"Invalid target location set in NodeChangeLocation with subnode\");\n    OSL_ENSURE(!m_path.isEmpty(), \"No target accessor set in NodeChangeLocation with subnode\");\n\n    SubNodeID aResult( m_affected, m_path.getLocalName().getName() );\n\n    return aResult;\n}\n\/\/-----------------------------------------------------------------------------\n    }\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.10.16); FILE MERGED 2008\/03\/31 12:22:56 rt 1.10.16.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: nodechangeinfo.cxx,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\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_configmgr.hxx\"\n\n#include \"nodechangeinfo.hxx\"\n\n#include \"noderef.hxx\"\n#include \"treeimpl.hxx\"\n\nnamespace configmgr\n{\n    namespace configuration\n    {\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeData::NodeChangeData()\n: type(eNoChange)\n, unoData()\n, element()\n{\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeData::NodeChangeData(NodeChangeData const& aOther)\n: type(aOther.type)\n, unoData(aOther.unoData)\n, element(aOther.element)\n{\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeData& NodeChangeData::operator=(NodeChangeData const& aOther)\n{\n    type        = aOther.type;\n    unoData     = aOther.unoData;\n    element     = aOther.element;\n    return *this;\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeData::~NodeChangeData()\n{\n}\n\/\/-----------------------------------------------------------------------------\n\nbool NodeChangeData::isDataChange() const\n{\n    if (isSetChange() && element.isDataChange())\n        return true;\n\n    return unoData.isDataChange();\n}\n\/\/-----------------------------------------------------------------------------\n\nTree NodeChangeData::getNewElementTree() const\n{\n    return Tree( element.newValue.get() );\n}\n\/\/-----------------------------------------------------------------------------\n\nTree NodeChangeData::getOldElementTree() const\n{\n    return Tree( element.oldValue.get() );\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeRef NodeChangeData::getNewElementNodeRef() const\n{\n    ElementTreeHolder newElement = this->element.newValue;\n    if ( newElement.is() &&  newElement->nodeCount() > 0)\n    {\n        NodeOffset n = newElement->root_();\n        return TreeImplHelper::makeNode( *newElement, n);\n    }\n    else\n        return NodeRef();\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeRef NodeChangeData::getOldElementNodeRef() const\n{\n    ElementTreeHolder oldElement = this->element.oldValue;\n    if ( oldElement.is() &&  oldElement->nodeCount() > 0)\n    {\n        NodeOffset n = oldElement->root_();\n        return TreeImplHelper::makeNode( *oldElement, n);\n    }\n    else\n        return NodeRef();\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeID NodeChangeData::getNewElementNodeID() const\n{\n    ElementTreeHolder newElement = this->element.newValue;\n    if ( newElement.is() &&  newElement->nodeCount() > 0)\n    {\n        return NodeID( newElement.get(), newElement->root_() );\n    }\n    else\n        return NodeID(0,0);\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeID NodeChangeData::getOldElementNodeID() const\n{\n    ElementTreeHolder oldElement = this->element.oldValue;\n    if ( oldElement.is() &&  oldElement->nodeCount() > 0)\n    {\n        return NodeID( oldElement.get(), oldElement->root_() );\n    }\n    else\n        return NodeID(0,0);\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeChangeLocation::NodeChangeLocation()\n: m_path()\n, m_base(0,0)\n, m_affected(0,0)\n, m_bSubNodeChanging(false)\n{\n}\n\/\/-----------------------------------------------------------------------------\nbool NodeChangeLocation::isValidLocation() const\n{\n    return   m_base.isValidNode() &&\n            (m_affected.isEmpty()\n                ?   ! m_bSubNodeChanging\n                :   ( m_affected.isValidNode() &&\n                      (! m_bSubNodeChanging ||\n                         (!m_path.isEmpty() &&\n                            SubNodeID(m_affected,m_path.getLocalName().getName()).isValidNode()\n                    ) )  ) );\n}\n\/\/-----------------------------------------------------------------------------\nbool NodeChangeLocation::isValidData() const\n{\n    return   m_base.isValidNode() &&\n            (m_affected.isEmpty()\n                ?   ! m_bSubNodeChanging\n                :   ( m_affected.isValidNode() &&\n                      (! m_bSubNodeChanging || !m_path.isEmpty() )\n            )       );\n}\n\/\/-----------------------------------------------------------------------------\n\nvoid NodeChangeLocation::setAccessor(RelativePath const& aAccessor)\n{\n    m_path = aAccessor;\n}\n\/\/-----------------------------------------------------------------------------\n\nvoid NodeChangeLocation::setBase(NodeID const& aBaseNode)\n{\n    m_base = aBaseNode;\n}\n\/\/-----------------------------------------------------------------------------\n\nvoid NodeChangeLocation::setAffected(NodeID const& aTargetNode)\n{\n    m_affected = aTargetNode;\n\n    if (m_base.isEmpty())\n        setBase(aTargetNode);\n}\n\/\/-----------------------------------------------------------------------------\n\nvoid NodeChangeLocation::setChangingSubnode( bool bSubnode )\n{\n    OSL_ENSURE(!m_affected.isEmpty() || !bSubnode, \"Change without target cannot affect subnode\");\n\n    m_bSubNodeChanging = bSubnode;\n}\n\/\/-----------------------------------------------------------------------------\n\nTree NodeChangeLocation::getBaseTree() const\n{\n    OSL_ENSURE(m_base.isValidNode(), \"Invalid base location set in NodeChangeLocation\");\n    return Tree( TreeImplHelper::tree(m_base) );\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeRef NodeChangeLocation::getBaseNode() const\n{\n    OSL_ENSURE(m_base.isValidNode(), \"Invalid base location set in NodeChangeLocation\");\n    return TreeImplHelper::makeNode(m_base);\n}\n\/\/-----------------------------------------------------------------------------\n\nTreeRef NodeChangeLocation::getAffectedTreeRef() const\n{\n    NodeID aAffected = this->getAffectedNodeID();\n    return TreeRef( TreeImplHelper::tree(aAffected) );\n}\n\/\/-----------------------------------------------------------------------------\n\nTree NodeChangeLocation::getAffectedTree() const\n{\n    return Tree( getAffectedTreeRef() );\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeRef NodeChangeLocation::getAffectedNode() const\n{\n    NodeID aAffected = this->getAffectedNodeID();\n    return TreeImplHelper::makeNode(aAffected);\n}\n\/\/-----------------------------------------------------------------------------\n\nNodeID NodeChangeLocation::getAffectedNodeID() const\n{\n    OSL_ENSURE(m_affected.isEmpty() || m_affected.isValidNode(), \"Invalid target location set in NodeChangeLocation\");\n    return m_affected;\n}\n\/\/-----------------------------------------------------------------------------\n\nSubNodeID NodeChangeLocation::getChangingValueID() const\n{\n    if (!m_bSubNodeChanging) return SubNodeID::createEmpty();\n\n    OSL_ENSURE(!m_affected.isEmpty() && m_affected.isValidNode(), \"Invalid target location set in NodeChangeLocation with subnode\");\n    OSL_ENSURE(!m_path.isEmpty(), \"No target accessor set in NodeChangeLocation with subnode\");\n\n    SubNodeID aResult( m_affected, m_path.getLocalName().getName() );\n\n    return aResult;\n}\n\/\/-----------------------------------------------------------------------------\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\nHighly Optimized Object-Oriented Molecular Dynamics (HOOMD) Open\nSource Software License\nCopyright (c) 2008 Ames Laboratory Iowa State University\nAll rights reserved.\n\nRedistribution and use of HOOMD, in source and binary forms, with or\nwithout modification, are permitted, provided that the following\nconditions are met:\n\n* Redistributions of source code must retain the above copyright notice,\nthis list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright\nnotice, this list of conditions and the following disclaimer in the\ndocumentation and\/or other materials provided with the distribution.\n\n* Neither the name of the copyright holder nor the names HOOMD's\ncontributors may be used to endorse or promote products derived from this\nsoftware without specific prior written permission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND\nCONTRIBUTORS ``AS IS''  AND ANY EXPRESS OR IMPLIED WARRANTIES,\nINCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. \n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS  BE LIABLE\nFOR 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\nTHE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\/\/ $Id$\n\/\/ $UR$\n\n\/*! \\file GaussianForceGPU.cc\n\t\\brief Defines the GaussianForceGPU class\n*\/\n\n#ifdef WIN32\n#pragma warning( push )\n#pragma warning( disable : 4103 4244 )\n#endif\n\n#include \"GaussianForceGPU.h\"\n#include \"cuda_runtime.h\"\n\n#include <stdexcept>\n\n#include <boost\/python.hpp>\nusing namespace boost::python;\n\n#include <boost\/bind.hpp>\n\nusing namespace boost;\nusing namespace std;\n\n\/*! \\param pdata Particle Data to compute forces on\n \t\\param nlist Neighborlist to use for computing the forces\n\t\\param r_cut Cuttoff radius beyond which the force is 0\n\t\\post memory is allocated and all parameters epsilon and sigma are set to 0.0\n*\/\nGaussianForceGPU::GaussianForceGPU(boost::shared_ptr<ParticleData> pdata, boost::shared_ptr<NeighborList> nlist, Scalar r_cut) \n\t: GaussianForceCompute(pdata, nlist, r_cut)\n\t{\n\t\/\/ can't run on the GPU if there aren't any GPUs in the execution configuration\n\tif (exec_conf.gpu.size() == 0)\n\t\t{\n\t\tcerr << endl << \"***Error! Creating a GaussianForceGPU with no GPU in the execution configuration\" << endl << endl;\n\t\tthrow std::runtime_error(\"Error initializing GaussianForceGPU\");\n\t\t}\n\t\n\tif (m_ntypes > 44)\n\t\t{\n\t\tcerr << endl << \"***Error! GaussianForceGPU cannot handle \" << m_ntypes << \" types\" << endl << endl;\n\t\tthrow runtime_error(\"Error initializing GaussianForceGPU\");\n\t\t}\n\t\t\n\t\/\/ default block size is the highest performance in testing on different hardware\n\t\/\/ choose based on compute capability of the device\n\tcudaDeviceProp deviceProp;\n\tint dev;\n\texec_conf.gpu[0]->call(bind(cudaGetDevice, &dev));\t\n\texec_conf.gpu[0]->call(bind(cudaGetDeviceProperties, &deviceProp, dev));\n\tif (deviceProp.major == 1 && deviceProp.minor == 0)\n\t\tm_block_size = 320;\n\telse if (deviceProp.major == 1 && deviceProp.minor == 1)\n\t\tm_block_size = 256;\n\telse if (deviceProp.major == 1 && deviceProp.minor < 4)\n\t\tm_block_size = 32;\n\telse\n\t\t{\n\t\tcout << \"***Warning! Unknown compute \" << deviceProp.major << \".\" << deviceProp.minor << \" when tuning block size for GaussianForceGPU\" << endl;\n\t\tm_block_size = 64;\n\t\t}\n\t\t\n\t\/\/ ulf workaround setup\n\t#ifndef DISABLE_ULF_WORKAROUND\n\t\/\/ the ULF workaround is needed on GTX280 and older GPUS\n\t\/\/ it is not needed on C1060, S1070, GTX285, GTX295, and (hopefully) newer ones\n\tm_ulf_workaround = true;\n\t\n\tif (deviceProp.major == 1 && deviceProp.minor >= 3)\n\t\tm_ulf_workaround = false;\n\tif (string(deviceProp.name) == \"GTX 280\")\n\t\tm_ulf_workaround = true;\n\t\t\n\tif (m_ulf_workaround)\n\t\tcout << \"Notice: ULF bug workaround enabled for GaussianForceGPU\" << endl;\n\t#else\n\tm_ulf_workaround = false;\n\t#endif\n\n\t\/\/ allocate the coeff data on the GPU\n\tint nbytes = sizeof(float2)*m_pdata->getNTypes()*m_pdata->getNTypes();\n\t\n\td_coeffs.resize(exec_conf.gpu.size());\n\tfor (unsigned int cur_gpu = 0; cur_gpu < exec_conf.gpu.size(); cur_gpu++)\n\t\t{\n\t\texec_conf.gpu[cur_gpu]->setTag(__FILE__, __LINE__);\n\t\texec_conf.gpu[cur_gpu]->call(bind(cudaMalloc, (void **)((void *)&d_coeffs[cur_gpu]), nbytes));\n\t\tassert(d_coeffs[cur_gpu]);\n\t\texec_conf.gpu[cur_gpu]->call(bind(cudaMemset, (void *)d_coeffs[cur_gpu], 0, nbytes));\n\t\t}\n\t\/\/ allocate the coeff data on the CPU\n\th_coeffs = new float2[m_pdata->getNTypes()*m_pdata->getNTypes()];\n\t}\n\t\n\nGaussianForceGPU::~GaussianForceGPU()\n\t{\n\t\/\/ free the coefficients on the GPU\n\texec_conf.tagAll(__FILE__, __LINE__);\n\tfor (unsigned int cur_gpu = 0; cur_gpu < exec_conf.gpu.size(); cur_gpu++)\n\t\t{\n\t\tassert(d_coeffs[cur_gpu]);\n\t\texec_conf.gpu[cur_gpu]->call(bind(cudaFree, (void *)d_coeffs[cur_gpu]));\n\t\t}\n\tdelete[] h_coeffs;\n\t}\n\t\n\/*! \\param block_size Size of the block to run on the device\n\tPerformance of the code may be dependant on the block size run\n\ton the GPU. \\a block_size should be set to be a multiple of 32.\n*\/\nvoid GaussianForceGPU::setBlockSize(int block_size)\n\t{\n\tm_block_size = block_size;\n\t}\n\n\/*! \\post The parameters \\a epsilon and \\a sigma are set for the pairs \\a typ1, \\a typ2 and \\a typ2, \\a typ1.\n\t\n\tSetting the parameters for typ1,typ2 automatically sets the same parameters for typ2,typ1: there\n\tis no need to call this funciton for symmetric pairs. Any pairs that this function is not called\n\tfor will have lj1 and lj2 set to 0.0.\n\t\n\t\\param typ1 Specifies one type of the pair\n\t\\param typ2 Specifies the second type of the pair\n\t\\param epsilon First parameter used to calcluate forces\n\t\\param sigma Second parameter used to calculate forces\n*\/\nvoid GaussianForceGPU::setParams(unsigned int typ1, unsigned int typ2, Scalar epsilon, Scalar sigma)\n\t{\n\tassert(h_coeffs);\n\tif (typ1 >= m_ntypes || typ2 >= m_ntypes)\n\t\t{\n\t\tcerr << endl << \"***Error! Trying to set Gaussian params for a non existant type! \" << typ1 << \",\" << typ2 << endl << endl;\n\t\tthrow runtime_error(\"GaussianForceGPU::setParams argument error\");\n\t\t}\n\t\n\t\/\/ set coeffs in both symmetric positions in the matrix\n\th_coeffs[typ1*m_pdata->getNTypes() + typ2] = make_float2(epsilon, sigma);\n\th_coeffs[typ2*m_pdata->getNTypes() + typ1] = make_float2(epsilon, sigma);\n\t\n\tint nbytes = sizeof(float2)*m_pdata->getNTypes()*m_pdata->getNTypes();\n\texec_conf.tagAll(__FILE__, __LINE__);\n\tfor (unsigned int cur_gpu = 0; cur_gpu < exec_conf.gpu.size(); cur_gpu++)\n\t\texec_conf.gpu[cur_gpu]->call(bind(cudaMemcpy, d_coeffs[cur_gpu], h_coeffs, nbytes, cudaMemcpyHostToDevice));\n\t}\n\t\t\n\/*! \\post The gaussian forces are computed for the given timestep on the GPU. \n\tThe neighborlist's compute method is called to ensure that it is up to date\n\tbefore forces are computed.\n \t\\param timestep Current time step of the simulation\n \t\n \tCalls gpu_compute_gauss_forces to do the dirty work.\n*\/\nvoid GaussianForceGPU::computeForces(unsigned int timestep)\n\t{\n\t\/\/ start by updating the neighborlist\n\tm_nlist->compute(timestep);\n\t\n\t\/\/ start the profile\n\tif (m_prof) m_prof->push(exec_conf, \"Gauss pair\");\n\t\n\t\/\/ The GPU implementation CANNOT handle a half neighborlist, error out now\n\tbool third_law = m_nlist->getStorageMode() == NeighborList::half;\n\tif (third_law)\n\t\t{\n\t\tcerr << endl << \"***Error! GaussianForceGPU cannot handle a half neighborlist\" << endl << endl;\n\t\tthrow runtime_error(\"Error computing forces in GaussianForceGPU\");\n\t\t}\n\t\n\t\/\/ access the neighbor list, which just selects the neighborlist into the device's memory, copying\n\t\/\/ it there if needed\n\tvector<gpu_nlist_array>& nlist = m_nlist->getListGPU();\n\n\t\/\/ access the particle data\n\tvector<gpu_pdata_arrays>& pdata = m_pdata->acquireReadOnlyGPU();\n\tgpu_boxsize box = m_pdata->getBoxGPU();\n\t\n\t\/\/ run the kernel on all GPUs in parallel\n\texec_conf.tagAll(__FILE__, __LINE__);\n\tgauss_options opt;\n\topt.r_cutsq = m_r_cut * m_r_cut;\n\topt.block_size = m_block_size;\n\topt.ulf_workaround = m_ulf_workaround;\n\topt.shift_mode = m_shift_mode;\n\t\n\tfor (unsigned int cur_gpu = 0; cur_gpu < exec_conf.gpu.size(); cur_gpu++)\n\t\texec_conf.gpu[cur_gpu]->callAsync(bind(gpu_compute_gauss_forces, m_gpu_forces[cur_gpu].d_data, pdata[cur_gpu], box, nlist[cur_gpu], d_coeffs[cur_gpu], m_pdata->getNTypes(), opt));\n\texec_conf.syncAll();\n\t\n\tm_pdata->release();\n\t\n\t\/\/ the force data is now only up to date on the gpu\n\tm_data_location = gpu;\n\n\tScalar avg_neigh = m_nlist->estimateNNeigh();\n\tint64_t n_calc = int64_t(avg_neigh * m_pdata->getN());\n\tint64_t mem_transfer = m_pdata->getN() * (4 + 16 + 20) + n_calc * (4 + 16);\n\tint64_t flops = n_calc * (3+12+5+6+1+3+7);\n\tif (m_shift_mode == shift)\n\t\tflops += n_calc * 4;\n\tif (m_prof) m_prof->pop(exec_conf, flops, mem_transfer);\n\t}\n\nvoid export_GaussianForceGPU()\n\t{\n\tclass_<GaussianForceGPU, boost::shared_ptr<GaussianForceGPU>, bases<GaussianForceCompute>, boost::noncopyable >\n\t\t(\"GaussianForceGPU\", init< boost::shared_ptr<ParticleData>, boost::shared_ptr<NeighborList>, Scalar >())\n\t\t.def(\"setBlockSize\", &GaussianForceGPU::setBlockSize)\n\t\t;\n\t}\n\n#ifdef WIN32\n#pragma warning( pop )\n#endif\n\n<commit_msg>Updated block size for pair.guass too.<commit_after>\/*\nHighly Optimized Object-Oriented Molecular Dynamics (HOOMD) Open\nSource Software License\nCopyright (c) 2008 Ames Laboratory Iowa State University\nAll rights reserved.\n\nRedistribution and use of HOOMD, in source and binary forms, with or\nwithout modification, are permitted, provided that the following\nconditions are met:\n\n* Redistributions of source code must retain the above copyright notice,\nthis list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright\nnotice, this list of conditions and the following disclaimer in the\ndocumentation and\/or other materials provided with the distribution.\n\n* Neither the name of the copyright holder nor the names HOOMD's\ncontributors may be used to endorse or promote products derived from this\nsoftware without specific prior written permission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND\nCONTRIBUTORS ``AS IS''  AND ANY EXPRESS OR IMPLIED WARRANTIES,\nINCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. \n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS  BE LIABLE\nFOR 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\nTHE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\/\/ $Id$\n\/\/ $UR$\n\n\/*! \\file GaussianForceGPU.cc\n\t\\brief Defines the GaussianForceGPU class\n*\/\n\n#ifdef WIN32\n#pragma warning( push )\n#pragma warning( disable : 4103 4244 )\n#endif\n\n#include \"GaussianForceGPU.h\"\n#include \"cuda_runtime.h\"\n\n#include <stdexcept>\n\n#include <boost\/python.hpp>\nusing namespace boost::python;\n\n#include <boost\/bind.hpp>\n\nusing namespace boost;\nusing namespace std;\n\n\/*! \\param pdata Particle Data to compute forces on\n \t\\param nlist Neighborlist to use for computing the forces\n\t\\param r_cut Cuttoff radius beyond which the force is 0\n\t\\post memory is allocated and all parameters epsilon and sigma are set to 0.0\n*\/\nGaussianForceGPU::GaussianForceGPU(boost::shared_ptr<ParticleData> pdata, boost::shared_ptr<NeighborList> nlist, Scalar r_cut) \n\t: GaussianForceCompute(pdata, nlist, r_cut)\n\t{\n\t\/\/ can't run on the GPU if there aren't any GPUs in the execution configuration\n\tif (exec_conf.gpu.size() == 0)\n\t\t{\n\t\tcerr << endl << \"***Error! Creating a GaussianForceGPU with no GPU in the execution configuration\" << endl << endl;\n\t\tthrow std::runtime_error(\"Error initializing GaussianForceGPU\");\n\t\t}\n\t\n\tif (m_ntypes > 44)\n\t\t{\n\t\tcerr << endl << \"***Error! GaussianForceGPU cannot handle \" << m_ntypes << \" types\" << endl << endl;\n\t\tthrow runtime_error(\"Error initializing GaussianForceGPU\");\n\t\t}\n\t\t\n\t\/\/ default block size is the highest performance in testing on different hardware\n\t\/\/ choose based on compute capability of the device\n\tcudaDeviceProp deviceProp;\n\tint dev;\n\texec_conf.gpu[0]->call(bind(cudaGetDevice, &dev));\t\n\texec_conf.gpu[0]->call(bind(cudaGetDeviceProperties, &deviceProp, dev));\n\tif (deviceProp.major == 1 && deviceProp.minor == 0)\n\t\tm_block_size = 320;\n\telse if (deviceProp.major == 1 && deviceProp.minor == 1)\n\t\tm_block_size = 256;\n\telse if (deviceProp.major == 1 && deviceProp.minor < 4)\n\t\tm_block_size = 352;\n\telse\n\t\t{\n\t\tcout << \"***Warning! Unknown compute \" << deviceProp.major << \".\" << deviceProp.minor << \" when tuning block size for GaussianForceGPU\" << endl;\n\t\tm_block_size = 64;\n\t\t}\n\t\t\n\t\/\/ ulf workaround setup\n\t#ifndef DISABLE_ULF_WORKAROUND\n\t\/\/ the ULF workaround is needed on GTX280 and older GPUS\n\t\/\/ it is not needed on C1060, S1070, GTX285, GTX295, and (hopefully) newer ones\n\tm_ulf_workaround = true;\n\t\n\tif (deviceProp.major == 1 && deviceProp.minor >= 3)\n\t\tm_ulf_workaround = false;\n\tif (string(deviceProp.name) == \"GTX 280\")\n\t\tm_ulf_workaround = true;\n\t\t\n\tif (m_ulf_workaround)\n\t\tcout << \"Notice: ULF bug workaround enabled for GaussianForceGPU\" << endl;\n\t#else\n\tm_ulf_workaround = false;\n\t#endif\n\n\t\/\/ allocate the coeff data on the GPU\n\tint nbytes = sizeof(float2)*m_pdata->getNTypes()*m_pdata->getNTypes();\n\t\n\td_coeffs.resize(exec_conf.gpu.size());\n\tfor (unsigned int cur_gpu = 0; cur_gpu < exec_conf.gpu.size(); cur_gpu++)\n\t\t{\n\t\texec_conf.gpu[cur_gpu]->setTag(__FILE__, __LINE__);\n\t\texec_conf.gpu[cur_gpu]->call(bind(cudaMalloc, (void **)((void *)&d_coeffs[cur_gpu]), nbytes));\n\t\tassert(d_coeffs[cur_gpu]);\n\t\texec_conf.gpu[cur_gpu]->call(bind(cudaMemset, (void *)d_coeffs[cur_gpu], 0, nbytes));\n\t\t}\n\t\/\/ allocate the coeff data on the CPU\n\th_coeffs = new float2[m_pdata->getNTypes()*m_pdata->getNTypes()];\n\t}\n\t\n\nGaussianForceGPU::~GaussianForceGPU()\n\t{\n\t\/\/ free the coefficients on the GPU\n\texec_conf.tagAll(__FILE__, __LINE__);\n\tfor (unsigned int cur_gpu = 0; cur_gpu < exec_conf.gpu.size(); cur_gpu++)\n\t\t{\n\t\tassert(d_coeffs[cur_gpu]);\n\t\texec_conf.gpu[cur_gpu]->call(bind(cudaFree, (void *)d_coeffs[cur_gpu]));\n\t\t}\n\tdelete[] h_coeffs;\n\t}\n\t\n\/*! \\param block_size Size of the block to run on the device\n\tPerformance of the code may be dependant on the block size run\n\ton the GPU. \\a block_size should be set to be a multiple of 32.\n*\/\nvoid GaussianForceGPU::setBlockSize(int block_size)\n\t{\n\tm_block_size = block_size;\n\t}\n\n\/*! \\post The parameters \\a epsilon and \\a sigma are set for the pairs \\a typ1, \\a typ2 and \\a typ2, \\a typ1.\n\t\n\tSetting the parameters for typ1,typ2 automatically sets the same parameters for typ2,typ1: there\n\tis no need to call this funciton for symmetric pairs. Any pairs that this function is not called\n\tfor will have lj1 and lj2 set to 0.0.\n\t\n\t\\param typ1 Specifies one type of the pair\n\t\\param typ2 Specifies the second type of the pair\n\t\\param epsilon First parameter used to calcluate forces\n\t\\param sigma Second parameter used to calculate forces\n*\/\nvoid GaussianForceGPU::setParams(unsigned int typ1, unsigned int typ2, Scalar epsilon, Scalar sigma)\n\t{\n\tassert(h_coeffs);\n\tif (typ1 >= m_ntypes || typ2 >= m_ntypes)\n\t\t{\n\t\tcerr << endl << \"***Error! Trying to set Gaussian params for a non existant type! \" << typ1 << \",\" << typ2 << endl << endl;\n\t\tthrow runtime_error(\"GaussianForceGPU::setParams argument error\");\n\t\t}\n\t\n\t\/\/ set coeffs in both symmetric positions in the matrix\n\th_coeffs[typ1*m_pdata->getNTypes() + typ2] = make_float2(epsilon, sigma);\n\th_coeffs[typ2*m_pdata->getNTypes() + typ1] = make_float2(epsilon, sigma);\n\t\n\tint nbytes = sizeof(float2)*m_pdata->getNTypes()*m_pdata->getNTypes();\n\texec_conf.tagAll(__FILE__, __LINE__);\n\tfor (unsigned int cur_gpu = 0; cur_gpu < exec_conf.gpu.size(); cur_gpu++)\n\t\texec_conf.gpu[cur_gpu]->call(bind(cudaMemcpy, d_coeffs[cur_gpu], h_coeffs, nbytes, cudaMemcpyHostToDevice));\n\t}\n\t\t\n\/*! \\post The gaussian forces are computed for the given timestep on the GPU. \n\tThe neighborlist's compute method is called to ensure that it is up to date\n\tbefore forces are computed.\n \t\\param timestep Current time step of the simulation\n \t\n \tCalls gpu_compute_gauss_forces to do the dirty work.\n*\/\nvoid GaussianForceGPU::computeForces(unsigned int timestep)\n\t{\n\t\/\/ start by updating the neighborlist\n\tm_nlist->compute(timestep);\n\t\n\t\/\/ start the profile\n\tif (m_prof) m_prof->push(exec_conf, \"Gauss pair\");\n\t\n\t\/\/ The GPU implementation CANNOT handle a half neighborlist, error out now\n\tbool third_law = m_nlist->getStorageMode() == NeighborList::half;\n\tif (third_law)\n\t\t{\n\t\tcerr << endl << \"***Error! GaussianForceGPU cannot handle a half neighborlist\" << endl << endl;\n\t\tthrow runtime_error(\"Error computing forces in GaussianForceGPU\");\n\t\t}\n\t\n\t\/\/ access the neighbor list, which just selects the neighborlist into the device's memory, copying\n\t\/\/ it there if needed\n\tvector<gpu_nlist_array>& nlist = m_nlist->getListGPU();\n\n\t\/\/ access the particle data\n\tvector<gpu_pdata_arrays>& pdata = m_pdata->acquireReadOnlyGPU();\n\tgpu_boxsize box = m_pdata->getBoxGPU();\n\t\n\t\/\/ run the kernel on all GPUs in parallel\n\texec_conf.tagAll(__FILE__, __LINE__);\n\tgauss_options opt;\n\topt.r_cutsq = m_r_cut * m_r_cut;\n\topt.block_size = m_block_size;\n\topt.ulf_workaround = m_ulf_workaround;\n\topt.shift_mode = m_shift_mode;\n\t\n\tfor (unsigned int cur_gpu = 0; cur_gpu < exec_conf.gpu.size(); cur_gpu++)\n\t\texec_conf.gpu[cur_gpu]->callAsync(bind(gpu_compute_gauss_forces, m_gpu_forces[cur_gpu].d_data, pdata[cur_gpu], box, nlist[cur_gpu], d_coeffs[cur_gpu], m_pdata->getNTypes(), opt));\n\texec_conf.syncAll();\n\t\n\tm_pdata->release();\n\t\n\t\/\/ the force data is now only up to date on the gpu\n\tm_data_location = gpu;\n\n\tScalar avg_neigh = m_nlist->estimateNNeigh();\n\tint64_t n_calc = int64_t(avg_neigh * m_pdata->getN());\n\tint64_t mem_transfer = m_pdata->getN() * (4 + 16 + 20) + n_calc * (4 + 16);\n\tint64_t flops = n_calc * (3+12+5+6+1+3+7);\n\tif (m_shift_mode == shift)\n\t\tflops += n_calc * 4;\n\tif (m_prof) m_prof->pop(exec_conf, flops, mem_transfer);\n\t}\n\nvoid export_GaussianForceGPU()\n\t{\n\tclass_<GaussianForceGPU, boost::shared_ptr<GaussianForceGPU>, bases<GaussianForceCompute>, boost::noncopyable >\n\t\t(\"GaussianForceGPU\", init< boost::shared_ptr<ParticleData>, boost::shared_ptr<NeighborList>, Scalar >())\n\t\t.def(\"setBlockSize\", &GaussianForceGPU::setBlockSize)\n\t\t;\n\t}\n\n#ifdef WIN32\n#pragma warning( pop )\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n\/* \n   This is some wisdom from Cygnus's web page.  If you just try to use\n   the \"stringify\" operator on a preprocessor directive, you'd get\n   \"PLATFORM\", not \"Intel Linux\" (or whatever the value of PLATFORM\n   is).  That's because the stringify operator is a special case, and\n   the preprocessor isn't allowed to expand things that are passed to\n   it.  However, by defining two layers of macros, you get the right\n   behavior, since the first pass converts:\n\n   xstr(PLATFORM) -> str(Intel Linux)\n\n   and the next pass gives:\n\n   str(Intel Linux) -> \"Intel Linux\"\n\n   This is exactly what we want, so we use it.  -Derek Wright and Jeff\n   Ballard, 12\/2\/99 \n\n   Also, because the NT build system is totally different, we have to\n   define the correct platform string right in here. :( -Derek 12\/3\/99 \n*\/\n\n#define xstr(s) str(s)\n#define str(s) #s\n\n#if defined(WIN32)\n#define PLATFORM INTEL-WINNT50\n#endif\n\n\/* Via configure, one may have specified a particular buildid string to use\n\tin the version string. So honor that request here. *\/\n#if defined(BUILDID)\n#define BUILDIDSTR \" BuildID: \" xstr(BUILDID)\n#else\n#define BUILDIDSTR \"\"\n#endif\n\n\/* Here is the version string - update before a public release *\/\n\/* --- IMPORTANT!  THE FORMAT OF THE VERSION STRING IS VERY STRICT\n   BECAUSE IT IS PARSED AT RUNTIME.  DO NOT ALTER THE FORMAT OR ENTER\n   ANYTHING EXTRA BEFORE THE DATE.  IF YOU WISH TO ADD EXTRA INFORMATION,\n   DO SO _AFTER_ THE BUILDIDSTR AND BEFORE THE TRAILING '$' CHARACTER.\n   EXAMPLES:\n       $CondorVersion: 6.9.5 \" __DATE__ BUILDIDSTR \" WinNTPreview $ [OK]\n\t   $CondorVersion: 6.9.5 WinNTPreview \" __DATE__ BUILDIDSTR \" $ [WRONG!!!]\n   Any questions?  See Todd or Derek.  Note: if you mess it up, DaemonCore\n   will EXCEPT at startup time.  \n*\/\n\nstatic char* CondorVersionString = \"$CondorVersion: 7.0.2 \" __DATE__ BUILDIDSTR \" PRE-RELEASE-UWCS $\";\n\n\/* Here is the platform string.  You don't need to edit this *\/\nstatic char* CondorPlatformString = \"$CondorPlatform: \" xstr(PLATFORM) \" $\";\n\nextern \"C\" {\n\nconst char*\nCondorVersion( void )\n{\n\treturn CondorVersionString;\n}\n\nconst char*\nCondorPlatform( void )\n{\n\treturn CondorPlatformString;\n}\n\n} \/* extern \"C\" *\/\n\n<commit_msg>update the version string for Condor 7.0.2<commit_after>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n\/* \n   This is some wisdom from Cygnus's web page.  If you just try to use\n   the \"stringify\" operator on a preprocessor directive, you'd get\n   \"PLATFORM\", not \"Intel Linux\" (or whatever the value of PLATFORM\n   is).  That's because the stringify operator is a special case, and\n   the preprocessor isn't allowed to expand things that are passed to\n   it.  However, by defining two layers of macros, you get the right\n   behavior, since the first pass converts:\n\n   xstr(PLATFORM) -> str(Intel Linux)\n\n   and the next pass gives:\n\n   str(Intel Linux) -> \"Intel Linux\"\n\n   This is exactly what we want, so we use it.  -Derek Wright and Jeff\n   Ballard, 12\/2\/99 \n\n   Also, because the NT build system is totally different, we have to\n   define the correct platform string right in here. :( -Derek 12\/3\/99 \n*\/\n\n#define xstr(s) str(s)\n#define str(s) #s\n\n#if defined(WIN32)\n#define PLATFORM INTEL-WINNT50\n#endif\n\n\/* Via configure, one may have specified a particular buildid string to use\n\tin the version string. So honor that request here. *\/\n#if defined(BUILDID)\n#define BUILDIDSTR \" BuildID: \" xstr(BUILDID)\n#else\n#define BUILDIDSTR \"\"\n#endif\n\n\/* Here is the version string - update before a public release *\/\n\/* --- IMPORTANT!  THE FORMAT OF THE VERSION STRING IS VERY STRICT\n   BECAUSE IT IS PARSED AT RUNTIME.  DO NOT ALTER THE FORMAT OR ENTER\n   ANYTHING EXTRA BEFORE THE DATE.  IF YOU WISH TO ADD EXTRA INFORMATION,\n   DO SO _AFTER_ THE BUILDIDSTR AND BEFORE THE TRAILING '$' CHARACTER.\n   EXAMPLES:\n       $CondorVersion: 6.9.5 \" __DATE__ BUILDIDSTR \" WinNTPreview $ [OK]\n\t   $CondorVersion: 6.9.5 WinNTPreview \" __DATE__ BUILDIDSTR \" $ [WRONG!!!]\n   Any questions?  See Todd or Derek.  Note: if you mess it up, DaemonCore\n   will EXCEPT at startup time.  \n*\/\n\nstatic char* CondorVersionString = \"$CondorVersion: 7.0.2 \" __DATE__ BUILDIDSTR \" $\";\n\n\/* Here is the platform string.  You don't need to edit this *\/\nstatic char* CondorPlatformString = \"$CondorPlatform: \" xstr(PLATFORM) \" $\";\n\nextern \"C\" {\n\nconst char*\nCondorVersion( void )\n{\n\treturn CondorVersionString;\n}\n\nconst char*\nCondorPlatform( void )\n{\n\treturn CondorPlatformString;\n}\n\n} \/* extern \"C\" *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n#include \"condor_common.h\"\n\n\n\/*\n** free_fs_blocks: reports the number of kbytes free for the filesystem where\n** given filename resides.\n*\/\n\n#include \"sysapi.h\"\n#include \"sysapi_externs.h\"\n#include \"my_popen.h\"\n\n\/* static function declarations *\/\nstatic int reserve_for_afs_cache(void);\nstatic int reserve_for_fs(void);\n\n\/* the code starts here *\/\n\n#if defined(WIN32)\n\n#include <limits.h>\n\nlong long\nsysapi_disk_space_raw(const char *filename)\n{\n\tULARGE_INTEGER FreeBytesAvailableToCaller, TotalNumberOfBytes, TotalNumberOfFreeBytes;\n\tunsigned int t_hi, t_lo, temp;\n\tconst unsigned int lowest_ten_mask = 0x000003ff;\n\t\n\tt_hi = t_lo = temp = 0;\n\tsysapi_internal_reconfig();\n\n\t\n\tif (GetDiskFreeSpaceEx(filename, &FreeBytesAvailableToCaller, &TotalNumberOfBytes, \n\t\t&TotalNumberOfFreeBytes) == 0) {\n\t\treturn -1;\n\t} else {\n#if 1\n\t\treturn FreeBytesAvailableToCaller.QuadPart;\n#else\n\t\t\/\/ we have to shift everything down 10 bits since we report the number\n\t\t\/\/ of kbytes free. There's a HighPart and a LowPart, so it gets a little ugly.\n\n\t\t\/\/ first shift the low part (divide by 1024 to get it into kbytes)\n\t\tt_lo = FreeBytesAvailableToCaller.LowPart;\n\t\tt_lo = t_lo >> 10;\n\t\t\/\/ now grab the lowest 10 bits in the high part\n\t\tt_hi = FreeBytesAvailableToCaller.HighPart;\n\t\ttemp = lowest_ten_mask & t_hi;\n\t\t\/\/ shift the high part 10 bits to get it into kbytes\n\t\tt_hi = t_hi >> 10;\n\t\t\n\t\t\/\/ shift the lowest 10 bits from the high part up to the \n\t\t\/\/ highest 10 bits, and stick them into the low part\n\t\ttemp = temp << 22;\n\t\tt_lo |= temp;\n\n\t\tif (t_hi > 0) {\n\t\t\treturn INT_MAX;\n\t\t} else {\n\t\t\treturn (int)t_lo;\n\t\t}\n#endif\n\t}\n}\n\n#else\n\n#include \"condor_debug.h\"\n\n\/* Can't include condor_config.h since it depends on classads which is\n   only C++.  -Derek 6\/25\/98 *\/\nextern char* param();\n\n\n#define FS_PROGRAM \"\/usr\/afsws\/bin\/fs\"\n#define FS_COMMAND \"getcacheparms\"\n#define FS_OUTPUT_FORMAT \"\\nAFS using %d of the cache's available %d\"\n\n#endif\n\n\/*\n  How much disk space we need to reserve for the AFS cache.  Answer is\n  in kilobytes.\n*\/\nstatic int\nreserve_for_afs_cache()\n{\n#ifdef WIN32\n\treturn 0;\n#else\n\tint\t\tanswer;\n\tFILE\t*fp;\n\tconst char\t*args[] = {FS_PROGRAM, FS_COMMAND, NULL};\n\tint\t\tcache_size, cache_in_use;\n\tint\t\tdo_it;\n\n\t\/* See if we're configured to deal with an AFS cache *\/\n\tdo_it = _sysapi_reserve_afs_cache;\n\n\t\t\/* If we're not configured to deal with AFS cache, just return 0 *\/\n\tif( !do_it ) {\n\t\treturn 0;\n\t}\n\n\t\t\/* Run an AFS utility program to learn how big the cache is and\n\t\t   how much is in use. *\/\n\tdprintf( D_FULLDEBUG, \"Checking AFS cache parameters\\n\" );\n\tfp = my_popenv( args, \"r\", FALSE );\n\tif( !fp ) {\n\t\treturn 0;\n\t}\n\tif (fscanf( fp, FS_OUTPUT_FORMAT, &cache_in_use, &cache_size ) != 2) {\n\t\tdprintf( D_ALWAYS, \"Failed to parse AFS cache parameters, assuming no cache\\n\" );\n\t\tcache_size = 0;\n\t\tcache_in_use = 0;\n\t}\n\tmy_pclose( fp );\n\tdprintf( D_FULLDEBUG, \"cache_in_use = %d, cache_size = %d\\n\",\n\t\tcache_in_use,\n\t\tcache_size\n\t);\n\tanswer = cache_size - cache_in_use;\n\n\t\t\/* The cache may be temporarily over size, in this case AFS will\n\t\t   clean up itself, so we don't have to allow for that. *\/\n\tif( answer < 0 ) {\n\t\tanswer = 0;\n\t}\n\n\tdprintf( D_FULLDEBUG, \"Reserving %d kbytes for AFS cache\\n\", answer );\n\treturn answer;\n#endif\n}\n\n\/*\n  How much disk space we need to reserve for the regular file system.\n  Answer is in kilobytes.\n*\/\nstatic int\nreserve_for_fs()\n{\n\t\/* XXX make cleaner *\/\n\tint\tanswer = -1;\n\n\tif( answer < 0 ) {\n\t\tanswer = _sysapi_reserve_disk;\n\t\tif( answer < 0 ) {\n\t\t\tanswer = 0;\n\t\t}\n\t}\n\n\tanswer = _sysapi_reserve_disk;\n\treturn answer;\n}\n\n\n#if defined(__STDC__)\nlong long sysapi_disk_space_raw( const char *filename);\n#else\nlong long sysapi_disk_space_raw();\n#endif\n\n#if defined(LINUX) || defined(AIX) || defined(HPUX) || defined(Solaris) || defined(Darwin) || defined(CONDOR_FREEBSD)\n\n#include <limits.h>\n\n#if defined(AIX)\n#include <sys\/statfs.h>\n#elif defined(Solaris)\n#include <sys\/statvfs.h>\n#endif\n\nlong long sysapi_disk_space_raw(const char * filename)\n{\n#if defined(Solaris)\n\tstruct statvfs statfsbuf;\n#else\n\tstruct statfs statfsbuf;\n#endif\n#if 1\n\tlong long free_kbytes;\n\tdouble kbytes_per_block;\n#else\n\tdouble free_kbytes;\n\tfloat kbytes_per_block;\n#endif\n\n\tsysapi_internal_reconfig();\n\n#if defined(Solaris)\n\tif(statvfs(filename, &statfsbuf) < 0) {\n#elif defined(AIX)\n\tif(statfs((char *)filename, &statfsbuf) < 0) {\n#else\n\tif(statfs(filename, &statfsbuf) < 0) {\n#endif\n\t\tif (errno != EOVERFLOW) {\n\t\t\tdprintf(D_ALWAYS, \"sysapi_disk_space_raw: statfs(%s,%p) failed\\n\",\n\t\t\t\t\t\t\t\t\t\t\t\t\tfilename, &statfsbuf );\n\t\t\tdprintf(D_ALWAYS, \"errno = %d\\n\", errno );\n\n\t\t\treturn(0);\n\t\t}\n\n\t\t\/\/ if we get here, it means that statfs failed because\n\t\t\/\/ there are more free blocks than can be represented\n\t\t\/\/ in a long.  Let's lie and make it INT_MAX - 1.\n\n\t\tdprintf(D_FULLDEBUG, \"sysapi_disk_space_raw: statfs overflowed, setting to %d\\n\", (INT_MAX - 1));\n\t\tstatfsbuf.f_bavail = (INT_MAX - 1);\t\n\t\tstatfsbuf.f_bsize = 1024; \/\/ this isn't set if result < 0, guess\n\t}\n\n\t\/* Convert to kbyte blocks: available blks * blksize \/ 1k bytes. *\/\n\t\/* overflow problem fixed by using doubles to hold result - \n\t\tKeller 05\/17\/99 *\/\n\n#if defined(Solaris)\n\t\t\/* On Solaris, we need to use f_frsize, the \"fundamental\n\t\t   filesystem block size\", not f_bsize, the \"preferred file\n\t\t   system block size\".  3\/25\/98  Derek Wright *\/\n\tkbytes_per_block = ( (unsigned long)statfsbuf.f_frsize \/ 1024.0 );\n#else\n\tkbytes_per_block = ( (unsigned long)statfsbuf.f_bsize \/ 1024.0 );\n#endif\n\n#if 1\n\tfree_kbytes = (long long)(statfsbuf.f_bavail * kbytes_per_block);\n#else\n\tfree_kbytes = (double)statfsbuf.f_bavail * (double)kbytes_per_block; \n\tif(free_kbytes > INT_MAX) {\n\t\tdprintf( D_ALWAYS, \"sysapi_disk_space_raw: Free disk space kbytes overflow, capping to INT_MAX\\n\");\n\t\treturn(INT_MAX);\n\t}\n#endif\n\n\treturn free_kbytes;\n}\n#endif\n\n\/*\n  Return number of kbytes condor may play with in the named file\n  system.  System administrators may reserve space which condor should\n  leave alone.  This could be either a static amount of space, or an\n  amount of space based on the current size of the AFS cache (or\n  both).\n\n  Note: This code assumes that if we have an AFS cache, that cache is\n  on the filesystem we are asking about.  This is not true in general,\n  but it is the case at the developer's home site.  A more correct\n  implementation would check whether the filesystem being asked about\n  is the one containing the cache.  This is messy to do if the\n  filesystem name we are given isn't a full pathname, e.g.\n  sysapi_disk_space(\".\"), which is why it isn't implemented here. -- mike\n\n*\/\nlong long\nsysapi_disk_space(const char *filename)\n{\n\tlong long answer;\n\n\tsysapi_internal_reconfig();\n\n\tanswer =  sysapi_disk_space_raw(filename)\n\t\t\t- reserve_for_afs_cache()\n\t\t\t- reserve_for_fs();\n\treturn answer < 0 ? 0 : answer;\n\n}\n\n\n<commit_msg>fix off by 1024 in reporting disk space on Windows. #4638 ===VersionHistory:Pending===<commit_after>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n#include \"condor_common.h\"\n\n\n\/*\n** free_fs_blocks: reports the number of kbytes free for the filesystem where\n** given filename resides.\n*\/\n\n#include \"sysapi.h\"\n#include \"sysapi_externs.h\"\n#include \"my_popen.h\"\n\n\/* static function declarations *\/\nstatic int reserve_for_afs_cache(void);\nstatic int reserve_for_fs(void);\n\n\/* the code starts here *\/\n\n#if defined(WIN32)\n\n#include <limits.h>\n\nlong long\nsysapi_disk_space_raw(const char *filename)\n{\n\tULARGE_INTEGER FreeBytesAvailableToCaller, TotalNumberOfBytes, TotalNumberOfFreeBytes;\n\tunsigned int t_hi, t_lo, temp;\n\tconst unsigned int lowest_ten_mask = 0x000003ff;\n\t\n\tt_hi = t_lo = temp = 0;\n\tsysapi_internal_reconfig();\n\n\t\n\tif (GetDiskFreeSpaceEx(filename, &FreeBytesAvailableToCaller, &TotalNumberOfBytes, \n\t\t&TotalNumberOfFreeBytes) == 0) {\n\t\treturn -1;\n\t} else {\n\t\treturn FreeBytesAvailableToCaller.QuadPart \/ 1024;\n\t}\n}\n\n#else\n\n#include \"condor_debug.h\"\n\n\/* Can't include condor_config.h since it depends on classads which is\n   only C++.  -Derek 6\/25\/98 *\/\nextern char* param();\n\n\n#define FS_PROGRAM \"\/usr\/afsws\/bin\/fs\"\n#define FS_COMMAND \"getcacheparms\"\n#define FS_OUTPUT_FORMAT \"\\nAFS using %d of the cache's available %d\"\n\n#endif\n\n\/*\n  How much disk space we need to reserve for the AFS cache.  Answer is\n  in kilobytes.\n*\/\nstatic int\nreserve_for_afs_cache()\n{\n#ifdef WIN32\n\treturn 0;\n#else\n\tint\t\tanswer;\n\tFILE\t*fp;\n\tconst char\t*args[] = {FS_PROGRAM, FS_COMMAND, NULL};\n\tint\t\tcache_size, cache_in_use;\n\tint\t\tdo_it;\n\n\t\/* See if we're configured to deal with an AFS cache *\/\n\tdo_it = _sysapi_reserve_afs_cache;\n\n\t\t\/* If we're not configured to deal with AFS cache, just return 0 *\/\n\tif( !do_it ) {\n\t\treturn 0;\n\t}\n\n\t\t\/* Run an AFS utility program to learn how big the cache is and\n\t\t   how much is in use. *\/\n\tdprintf( D_FULLDEBUG, \"Checking AFS cache parameters\\n\" );\n\tfp = my_popenv( args, \"r\", FALSE );\n\tif( !fp ) {\n\t\treturn 0;\n\t}\n\tif (fscanf( fp, FS_OUTPUT_FORMAT, &cache_in_use, &cache_size ) != 2) {\n\t\tdprintf( D_ALWAYS, \"Failed to parse AFS cache parameters, assuming no cache\\n\" );\n\t\tcache_size = 0;\n\t\tcache_in_use = 0;\n\t}\n\tmy_pclose( fp );\n\tdprintf( D_FULLDEBUG, \"cache_in_use = %d, cache_size = %d\\n\",\n\t\tcache_in_use,\n\t\tcache_size\n\t);\n\tanswer = cache_size - cache_in_use;\n\n\t\t\/* The cache may be temporarily over size, in this case AFS will\n\t\t   clean up itself, so we don't have to allow for that. *\/\n\tif( answer < 0 ) {\n\t\tanswer = 0;\n\t}\n\n\tdprintf( D_FULLDEBUG, \"Reserving %d kbytes for AFS cache\\n\", answer );\n\treturn answer;\n#endif\n}\n\n\/*\n  How much disk space we need to reserve for the regular file system.\n  Answer is in kilobytes.\n*\/\nstatic int\nreserve_for_fs()\n{\n\t\/* XXX make cleaner *\/\n\tint\tanswer = -1;\n\n\tif( answer < 0 ) {\n\t\tanswer = _sysapi_reserve_disk;\n\t\tif( answer < 0 ) {\n\t\t\tanswer = 0;\n\t\t}\n\t}\n\n\tanswer = _sysapi_reserve_disk;\n\treturn answer;\n}\n\n\n#if defined(__STDC__)\nlong long sysapi_disk_space_raw( const char *filename);\n#else\nlong long sysapi_disk_space_raw();\n#endif\n\n#if defined(LINUX) || defined(AIX) || defined(HPUX) || defined(Solaris) || defined(Darwin) || defined(CONDOR_FREEBSD)\n\n#include <limits.h>\n\n#if defined(AIX)\n#include <sys\/statfs.h>\n#elif defined(Solaris)\n#include <sys\/statvfs.h>\n#endif\n\nlong long sysapi_disk_space_raw(const char * filename)\n{\n#if defined(Solaris)\n\tstruct statvfs statfsbuf;\n#else\n\tstruct statfs statfsbuf;\n#endif\n\tlong long free_kbytes;\n\tdouble kbytes_per_block;\n\n\tsysapi_internal_reconfig();\n\n#if defined(Solaris)\n\tif(statvfs(filename, &statfsbuf) < 0) {\n#elif defined(AIX)\n\tif(statfs((char *)filename, &statfsbuf) < 0) {\n#else\n\tif(statfs(filename, &statfsbuf) < 0) {\n#endif\n\t\tif (errno != EOVERFLOW) {\n\t\t\tdprintf(D_ALWAYS, \"sysapi_disk_space_raw: statfs(%s,%p) failed\\n\",\n\t\t\t\t\t\t\t\t\t\t\t\t\tfilename, &statfsbuf );\n\t\t\tdprintf(D_ALWAYS, \"errno = %d\\n\", errno );\n\n\t\t\treturn(0);\n\t\t}\n\n\t\t\/\/ if we get here, it means that statfs failed because\n\t\t\/\/ there are more free blocks than can be represented\n\t\t\/\/ in a long.  Let's lie and make it INT_MAX - 1.\n\n\t\tdprintf(D_FULLDEBUG, \"sysapi_disk_space_raw: statfs overflowed, setting to %d\\n\", (INT_MAX - 1));\n\t\tstatfsbuf.f_bavail = (INT_MAX - 1);\t\n\t\tstatfsbuf.f_bsize = 1024; \/\/ this isn't set if result < 0, guess\n\t}\n\n\t\/* Convert to kbyte blocks: available blks * blksize \/ 1k bytes. *\/\n\t\/* overflow problem fixed by using doubles to hold result - \n\t\tKeller 05\/17\/99 *\/\n\n#if defined(Solaris)\n\t\t\/* On Solaris, we need to use f_frsize, the \"fundamental\n\t\t   filesystem block size\", not f_bsize, the \"preferred file\n\t\t   system block size\".  3\/25\/98  Derek Wright *\/\n\tkbytes_per_block = ( (unsigned long)statfsbuf.f_frsize \/ 1024.0 );\n#else\n\tkbytes_per_block = ( (unsigned long)statfsbuf.f_bsize \/ 1024.0 );\n#endif\n\n\tfree_kbytes = (long long)(statfsbuf.f_bavail * kbytes_per_block);\n\n\treturn free_kbytes;\n}\n#endif\n\n\/*\n  Return number of kbytes condor may play with in the named file\n  system.  System administrators may reserve space which condor should\n  leave alone.  This could be either a static amount of space, or an\n  amount of space based on the current size of the AFS cache (or\n  both).\n\n  Note: This code assumes that if we have an AFS cache, that cache is\n  on the filesystem we are asking about.  This is not true in general,\n  but it is the case at the developer's home site.  A more correct\n  implementation would check whether the filesystem being asked about\n  is the one containing the cache.  This is messy to do if the\n  filesystem name we are given isn't a full pathname, e.g.\n  sysapi_disk_space(\".\"), which is why it isn't implemented here. -- mike\n\n*\/\nlong long\nsysapi_disk_space(const char *filename)\n{\n\tlong long answer;\n\n\tsysapi_internal_reconfig();\n\n\tanswer =  sysapi_disk_space_raw(filename)\n\t\t\t- reserve_for_afs_cache()\n\t\t\t- reserve_for_fs();\n\treturn answer < 0 ? 0 : answer;\n\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before> \/*************************************************************************\n *\n *  $RCSfile: EApi.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: hr $ $Date: 2005-06-09 14:09: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): Michael Meeks, Jayant Madavi\n *\n *\n ************************************************************************\/\n\n#include <rtl\/ustring.hxx>\n#include <osl\/module.h>\n#include <stdio.h>\n#define _EVOLUTION_ALREADY_DEFINED_ 1\n#ifndef _CONNECTIVITY_EVOAB_EVOLUTION_API_HXX_\n#include \"EApi.h\"\n#endif\nstatic char *eBookLibNames[] = {\n    \"libebook.so.8\",    \/\/ evolution-2.0\n    \"libebook-1.2.so.3\" \/\/ evolution-2.2\n    \/\/ FIXME: ask JPR about ABI compatibility going forwards\n    \/\/ \"libebook-1.3.so.0\",\n    \/\/ \"libebook-1.4.so.0\",\n    \/\/ \"libebook-1.5.so.0\"\n};\n\ntypedef void (*SymbolFunc) (void);\n\n#define SYM_MAP(a) { #a, (SymbolFunc *)&a }\n    static struct {\n    const char *sym_name;\n    SymbolFunc *ref_value;\n    } aApiMap[] = {\n    SYM_MAP( e_contact_get_type ),\n    SYM_MAP( e_contact_field_id ),\n    SYM_MAP( e_source_peek_name ),\n    SYM_MAP( e_source_get_property ),\n    SYM_MAP( e_source_list_peek_groups ),\n    SYM_MAP( e_source_group_peek_sources ),\n    SYM_MAP( e_book_new ),\n    SYM_MAP( e_book_open ),\n    SYM_MAP( e_book_get_uri ),\n    SYM_MAP( e_book_get_source ),\n    SYM_MAP( e_book_get_addressbooks ),\n    SYM_MAP( e_book_get_contacts ),\n    SYM_MAP( e_book_authenticate_user ),\n    SYM_MAP( e_book_query_field_test ),\n    SYM_MAP( e_book_query_and ),\n    SYM_MAP( e_book_query_or ),\n    SYM_MAP( e_book_query_not ),\n    SYM_MAP( e_book_query_unref ),\n    SYM_MAP( e_book_query_to_string ),\n    SYM_MAP( e_book_query_field_exists ),\n    SYM_MAP( e_source_group_peek_base_uri)\n    };\n#undef SYM_MAP\n\nstatic bool\ntryLink( oslModule &aModule, const char *pName )\n{\n    for( guint i = 0; i < G_N_ELEMENTS( aApiMap ); i++ )\n    {\n    SymbolFunc aMethod;\n    aMethod = (SymbolFunc) osl_getSymbol\n        ( aModule, rtl::OUString::createFromAscii ( aApiMap[ i ].sym_name ).pData );\n    if( !aMethod )\n    {\n        fprintf( stderr, \"Warning: missing symbol '%s' in '%s'\",\n             aApiMap[ i ].sym_name, pName );\n        return false;\n    }\n    * aApiMap[ i ].ref_value = aMethod;\n    }\n    return true;\n}\n\nbool EApiInit()\n{\n    oslModule aModule;\n\n    for( guint j = 0; j < G_N_ELEMENTS( eBookLibNames ); j++ )\n    {\n    aModule = osl_loadModule( rtl::OUString::createFromAscii\n                  ( eBookLibNames[ j ] ).pData,\n                  SAL_LOADMODULE_DEFAULT );\n    if( aModule)\n    {\n        if ( tryLink( aModule, eBookLibNames[ j ] ) )\n        return true;\n        osl_unloadModule( aModule );\n    }\n    }\n    fprintf( stderr, \"Can find no compliant libebook client libraries\\n\" );\n    return false;\n}\n\n#if 0\n\n  Test code - enable &\n *\n * Compile with ( after source LinuxIntelEnv.Set.sh )\n   gcc $SOLARDEF -I $SOLARSRC\/sal\/inc -I $SOLARSRC\/sal\/unxlngi4.pro\/inc \\\n     -I. `pkg-config --cflags --libs gobject-2.0` \\\n     -L $SOLARSRC\/sal\/unxlngi4.pro\/lib -luno_sal -lstdc++ EApi.cxx\n\n\nint main( int argc, char **argv)\n{\n    return EApiInit();\n}\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.40); FILE MERGED 2005\/09\/05 17:23:37 rt 1.2.40.1: #i54170# Change license header: remove SISSL<commit_after> \/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: EApi.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 05:48:53 $\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 <rtl\/ustring.hxx>\n#include <osl\/module.h>\n#include <stdio.h>\n#define _EVOLUTION_ALREADY_DEFINED_ 1\n#ifndef _CONNECTIVITY_EVOAB_EVOLUTION_API_HXX_\n#include \"EApi.h\"\n#endif\nstatic char *eBookLibNames[] = {\n    \"libebook.so.8\",    \/\/ evolution-2.0\n    \"libebook-1.2.so.3\" \/\/ evolution-2.2\n    \/\/ FIXME: ask JPR about ABI compatibility going forwards\n    \/\/ \"libebook-1.3.so.0\",\n    \/\/ \"libebook-1.4.so.0\",\n    \/\/ \"libebook-1.5.so.0\"\n};\n\ntypedef void (*SymbolFunc) (void);\n\n#define SYM_MAP(a) { #a, (SymbolFunc *)&a }\n    static struct {\n    const char *sym_name;\n    SymbolFunc *ref_value;\n    } aApiMap[] = {\n    SYM_MAP( e_contact_get_type ),\n    SYM_MAP( e_contact_field_id ),\n    SYM_MAP( e_source_peek_name ),\n    SYM_MAP( e_source_get_property ),\n    SYM_MAP( e_source_list_peek_groups ),\n    SYM_MAP( e_source_group_peek_sources ),\n    SYM_MAP( e_book_new ),\n    SYM_MAP( e_book_open ),\n    SYM_MAP( e_book_get_uri ),\n    SYM_MAP( e_book_get_source ),\n    SYM_MAP( e_book_get_addressbooks ),\n    SYM_MAP( e_book_get_contacts ),\n    SYM_MAP( e_book_authenticate_user ),\n    SYM_MAP( e_book_query_field_test ),\n    SYM_MAP( e_book_query_and ),\n    SYM_MAP( e_book_query_or ),\n    SYM_MAP( e_book_query_not ),\n    SYM_MAP( e_book_query_unref ),\n    SYM_MAP( e_book_query_to_string ),\n    SYM_MAP( e_book_query_field_exists ),\n    SYM_MAP( e_source_group_peek_base_uri)\n    };\n#undef SYM_MAP\n\nstatic bool\ntryLink( oslModule &aModule, const char *pName )\n{\n    for( guint i = 0; i < G_N_ELEMENTS( aApiMap ); i++ )\n    {\n    SymbolFunc aMethod;\n    aMethod = (SymbolFunc) osl_getSymbol\n        ( aModule, rtl::OUString::createFromAscii ( aApiMap[ i ].sym_name ).pData );\n    if( !aMethod )\n    {\n        fprintf( stderr, \"Warning: missing symbol '%s' in '%s'\",\n             aApiMap[ i ].sym_name, pName );\n        return false;\n    }\n    * aApiMap[ i ].ref_value = aMethod;\n    }\n    return true;\n}\n\nbool EApiInit()\n{\n    oslModule aModule;\n\n    for( guint j = 0; j < G_N_ELEMENTS( eBookLibNames ); j++ )\n    {\n    aModule = osl_loadModule( rtl::OUString::createFromAscii\n                  ( eBookLibNames[ j ] ).pData,\n                  SAL_LOADMODULE_DEFAULT );\n    if( aModule)\n    {\n        if ( tryLink( aModule, eBookLibNames[ j ] ) )\n        return true;\n        osl_unloadModule( aModule );\n    }\n    }\n    fprintf( stderr, \"Can find no compliant libebook client libraries\\n\" );\n    return false;\n}\n\n#if 0\n\n  Test code - enable &\n *\n * Compile with ( after source LinuxIntelEnv.Set.sh )\n   gcc $SOLARDEF -I $SOLARSRC\/sal\/inc -I $SOLARSRC\/sal\/unxlngi4.pro\/inc \\\n     -I. `pkg-config --cflags --libs gobject-2.0` \\\n     -L $SOLARSRC\/sal\/unxlngi4.pro\/lib -luno_sal -lstdc++ EApi.cxx\n\n\nint main( int argc, char **argv)\n{\n    return EApiInit();\n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2021 Advanced Micro Devices, Inc.\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\n#include <miopen\/conv\/invokers\/mlir_impl_gemm.hpp>\n\n#include <miopen\/conv\/data_invoke_params.hpp>\n#include <miopen\/conv\/wrw_invoke_params.hpp>\n#include <miopen\/algorithm.hpp>\n#include <miopen\/handle.hpp>\n#include <miopen\/tensor_ops.hpp>\n\n#include <Miir.h>\n\n#include <boost\/any.hpp>\n#include <boost\/range\/adaptors.hpp>\n\nnamespace miopen {\nnamespace conv {\n\nnamespace {\nstruct MlirConvArgs\n{\n    StridedMemRef5D filter;\n    StridedMemRef5D input;\n    StridedMemRef5D output;\n};\n\n\/\/ Rearrange strides correctly\n\/\/ In MLIR: the layout, sizes and strides are coherent. The layout information is not\n\/\/ embedded into the permutation of strides.\n\/\/ - For NCHW, sizes = {N, C, H, W}; strides = {C*H*W, H*W, W, 1}\n\/\/ - For NHWC, sizes = {N, H, W, C}; strides = {C*H*W, W*C, C, 1}\n\n\/\/ In MIOpen however, size and strides are not aligned. Permutation of the strides are used to\n\/\/ infer actual layout\n\/\/ - For NCHW, sizes = {N, C, H, W}; strides = {C*H*W, H*W, W, 1}\n\/\/ - For NHWC, sizes = {N, C, H, W}; strides = {C*H*W, 1, W*C, C}\nvoid PermuteDimsStrides(std::vector<size_t>& dims, std::vector<size_t>& strides)\n{\n    auto sorted_dims    = dims;\n    auto sorted_strides = strides;\n    auto p              = TensorDescriptor::find_permutation(dims, strides);\n    std::transform(p.begin(), p.end(), sorted_dims.begin(), [&](auto i) { return dims[i]; });\n    std::transform(p.begin(), p.end(), sorted_strides.begin(), [&](auto i) { return strides[i]; });\n    dims    = sorted_dims;\n    strides = sorted_strides;\n};\n\nvoid InsertGToDimsStrides(const std::string& layout,\n                          char dim,\n                          int group_count,\n                          std::vector<size_t>& dims,\n                          std::vector<size_t>& strides)\n{\n    std::size_t index = layout.find(dim);\n    if(index == std::string::npos)\n        MIOPEN_THROW(\"Failed to find channel in the layout\");\n\n    \/\/ For dimensions,\n    \/\/    Insert an additional dimension g before channel\n    \/\/    Amend the channel size to be channel_size \/ group_count\n    dims[index] \/= group_count;\n    dims.insert(dims.begin() + index, group_count);\n\n    \/\/ For strides,\n    \/\/   The channel stride remain the same\n    \/\/   Insert an additional group stride to be channel_stride * new_channel_size\n    strides.insert(strides.begin() + index, strides[index] * dims[index + 1]);\n}\n\nvoid ComputeMlirDimsStrides(const conv::ProblemDescription& conv_problem,\n                            std::vector<size_t>& in_dims,\n                            std::vector<size_t>& in_strides,\n                            std::vector<size_t>& weights_dims,\n                            std::vector<size_t>& weights_strides,\n                            std::vector<size_t>& out_dims,\n                            std::vector<size_t>& out_strides)\n{\n    auto group_count = conv_problem.GetGroupCount();\n\n    TensorDescriptor in;\n    if(conv_problem.GetDirection() == conv::Direction::Forward)\n        in = conv_problem.GetIn();\n    else\n        in = conv_problem.GetOut();\n\n    in_dims    = in.GetLengths();\n    in_strides = in.GetStrides();\n    PermuteDimsStrides(in_dims, in_strides);\n    \/\/ Add a virtual group dimension before input channel.\n    InsertGToDimsStrides(in.GetLayout(\"NCHW\"), 'C', group_count, in_dims, in_strides);\n\n    \/\/ Add a virtual group dimension before output channel.\n    const TensorDescriptor& weights = conv_problem.GetWeights();\n    weights_dims                    = weights.GetLengths();\n    weights_strides                 = weights.GetStrides();\n    PermuteDimsStrides(weights_dims, weights_strides);\n    InsertGToDimsStrides(\n        weights.GetLayout(\"NCHW\"), 'N', group_count, weights_dims, weights_strides);\n\n    TensorDescriptor out;\n    if(conv_problem.GetDirection() == conv::Direction::Forward)\n        out = conv_problem.GetOut();\n    else\n        out = conv_problem.GetIn();\n\n    out_dims    = out.GetLengths();\n    out_strides = out.GetStrides();\n    PermuteDimsStrides(out_dims, out_strides);\n    \/\/ Add a virtual group dimension before output channel.\n    InsertGToDimsStrides(out.GetLayout(\"NCHW\"), 'C', group_count, out_dims, out_strides);\n}\n\nMlirConvArgs MakeMlirConvArgs(const std::vector<size_t>& in_dims,\n                              const std::vector<size_t>& in_strides,\n                              const std::vector<size_t>& weights_dims,\n                              const std::vector<size_t>& weights_strides,\n                              const std::vector<size_t>& out_dims,\n                              const std::vector<size_t>& out_strides)\n{\n    auto initDimStrides = [](const std::vector<size_t>& dims,\n                             const std::vector<size_t>& strides,\n                             StridedMemRef5D& target) {\n        std::copy(dims.cbegin(), dims.cend(), &target.sizes[0]);\n        std::copy(strides.cbegin(), strides.cend(), &target.strides[0]);\n    };\n\n    StridedMemRef5D filter{nullptr, nullptr, 0, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}};\n    initDimStrides(weights_dims, weights_strides, filter);\n    StridedMemRef5D input{nullptr, nullptr, 0, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}};\n    initDimStrides(in_dims, in_strides, input);\n    StridedMemRef5D output{nullptr, nullptr, 0, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}};\n    initDimStrides(out_dims, out_strides, output);\n\n    return {filter, input, output};\n}\n\nvoid SetMlirConvArgsPtr(ConstData_t in, ConstData_t out, ConstData_t w, MlirConvArgs& args)\n{\n    void* filter = nullptr;\n    void* input  = nullptr;\n    void* output = nullptr;\n#if MIOPEN_BACKEND_OPENCL\n    clGetMemObjectInfo(w, CL_MEM_HOST_PTR, sizeof(filter), &filter, nullptr);\n    clGetMemObjectInfo(in, CL_MEM_HOST_PTR, sizeof(input), &input, nullptr);\n    clGetMemObjectInfo(out, CL_MEM_HOST_PTR, sizeof(output), &output, nullptr);\n#elif MIOPEN_BACKEND_HIP\n    \/\/ NOLINTNEXTLINE (cppcoreguidelines-pro-type-const-cast)\n    filter = const_cast<void*>(w);\n    \/\/ NOLINTNEXTLINE (cppcoreguidelines-pro-type-const-cast)\n    input = const_cast<void*>(in);\n    \/\/ NOLINTNEXTLINE (cppcoreguidelines-pro-type-const-cast)\n    output = const_cast<void*>(out);\n#endif\n\n    if((filter == nullptr) || (input == nullptr) || (output == nullptr))\n        MIOPEN_THROW(\"Invalid device pointers\");\n\n    args.filter.basePtr = filter;\n    args.filter.data    = filter;\n    args.input.basePtr  = input;\n    args.input.data     = input;\n    args.output.basePtr = output;\n    args.output.data    = output;\n}\n} \/\/ Anonymous namespace\n\nInvokerFactory MakeMlirFwdInvokerFactory(const ConvolutionContext& ctx)\n{\n    assert((ctx.direction.IsForward()));\n\n    std::vector<size_t> in_dims, in_strides;\n    std::vector<size_t> weights_dims, weights_strides;\n    std::vector<size_t> out_dims, out_strides;\n    ComputeMlirDimsStrides(ctx.conv_problem,\n                           in_dims,\n                           in_strides,\n                           weights_dims,\n                           weights_strides,\n                           out_dims,\n                           out_strides);\n\n    MlirConvArgs args =\n        MakeMlirConvArgs(in_dims, in_strides, weights_dims, weights_strides, out_dims, out_strides);\n\n    return [=](const std::vector<Kernel>& kernels) mutable {\n        return [=](const Handle& handle, const AnyInvokeParams& primitive_parameters) mutable {\n            const auto& forward_invoke_params =\n                primitive_parameters.CastTo<conv::DataInvokeParams>();\n            const auto& tensors = forward_invoke_params.tensors;\n\n            SetMlirConvArgsPtr(tensors.in, tensors.out, tensors.w, args);\n            handle.Run(kernels[0])(args);\n        };\n    };\n}\n\nInvokerFactory MakeMlirBwdInvokerFactory(const ConvolutionContext& ctx)\n{\n    assert(ctx.direction.IsBackwardData());\n\n    std::vector<size_t> in_dims, in_strides;\n    std::vector<size_t> weights_dims, weights_strides;\n    std::vector<size_t> out_dims, out_strides;\n    ComputeMlirDimsStrides(ctx.conv_problem,\n                           in_dims,\n                           in_strides,\n                           weights_dims,\n                           weights_strides,\n                           out_dims,\n                           out_strides);\n    MlirConvArgs args =\n        MakeMlirConvArgs(in_dims, in_strides, weights_dims, weights_strides, out_dims, out_strides);\n\n    const auto& conv  = ctx.conv_problem.GetConv();\n    const auto& wDesc = ctx.conv_problem.GetWeights();\n\n    bool every_pixel_is_written = true;\n    for(int i = 0; i < conv.GetSpatialDimension(); ++i)\n    {\n        const auto conv_stride   = conv.GetConvStrides()[i];\n        const auto conv_dilation = conv.GetConvDilations()[i];\n        const auto filter_size   = wDesc.GetLengths()[2 + i];\n\n        \/\/ TODO: This can be relaxed.\n        if(!(conv_dilation == 1 && conv_stride <= filter_size))\n            every_pixel_is_written = false;\n    }\n\n    return [=](const std::vector<Kernel>& kernels) mutable {\n        return [=](const Handle& handle, const AnyInvokeParams& primitive_parameters) mutable {\n            float elapsed        = 0;\n            const auto& data_ctx = primitive_parameters.CastTo<conv::DataInvokeParams>();\n            const auto& tensors  = data_ctx.tensors;\n\n            if(!every_pixel_is_written)\n            {\n                float zero = 0.f;\n                SetTensor(handle, tensors.outDesc, tensors.out, &zero);\n\n                if(handle.IsProfilingEnabled())\n                    elapsed += handle.GetKernelTime();\n            }\n\n            SetMlirConvArgsPtr(tensors.out, tensors.in, tensors.w, args);\n            for(const auto& k : kernels)\n            {\n                handle.Run(k)(args);\n                elapsed += handle.GetKernelTime();\n            }\n\n            if(handle.IsProfilingEnabled())\n            {\n                handle.ResetKernelTime();\n                handle.AccumKernelTime(elapsed);\n            }\n        };\n    };\n}\n\nInvokerFactory MakeMlirWrWInvokerFactory(const ConvolutionContext& ctx)\n{\n    assert((ctx.direction.IsBackwardWrW()));\n\n    std::vector<size_t> in_dims, in_strides;\n    std::vector<size_t> weights_dims, weights_strides;\n    std::vector<size_t> out_dims, out_strides;\n    ComputeMlirDimsStrides(ctx.conv_problem,\n                           in_dims,\n                           in_strides,\n                           weights_dims,\n                           weights_strides,\n                           out_dims,\n                           out_strides);\n    MlirConvArgs args =\n        MakeMlirConvArgs(in_dims, in_strides, weights_dims, weights_strides, out_dims, out_strides);\n\n    return [=](const std::vector<Kernel>& kernels) mutable {\n        return [=](const Handle& handle, const AnyInvokeParams& primitive_parameters) mutable {\n            const auto& wrw_invoke_params = primitive_parameters.CastTo<conv::WrWInvokeParams>();\n            const auto& tensors           = wrw_invoke_params.tensors;\n\n            SetMlirConvArgsPtr(tensors.x, tensors.dy, tensors.dw, args);\n            handle.Run(kernels[0])(args);\n        };\n    };\n}\n\n} \/\/ namespace conv\n} \/\/ namespace miopen\n<commit_msg>[MLIR] Fixing WRW invoker by setting zero to weights (#1104)<commit_after>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2021 Advanced Micro Devices, Inc.\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\n#include <miopen\/conv\/invokers\/mlir_impl_gemm.hpp>\n\n#include <miopen\/conv\/data_invoke_params.hpp>\n#include <miopen\/conv\/wrw_invoke_params.hpp>\n#include <miopen\/algorithm.hpp>\n#include <miopen\/handle.hpp>\n#include <miopen\/tensor_ops.hpp>\n\n#include <Miir.h>\n\n#include <boost\/any.hpp>\n#include <boost\/range\/adaptors.hpp>\n\nnamespace miopen {\nnamespace conv {\n\nnamespace {\nstruct MlirConvArgs\n{\n    StridedMemRef5D filter;\n    StridedMemRef5D input;\n    StridedMemRef5D output;\n};\n\n\/\/ Rearrange strides correctly\n\/\/ In MLIR: the layout, sizes and strides are coherent. The layout information is not\n\/\/ embedded into the permutation of strides.\n\/\/ - For NCHW, sizes = {N, C, H, W}; strides = {C*H*W, H*W, W, 1}\n\/\/ - For NHWC, sizes = {N, H, W, C}; strides = {C*H*W, W*C, C, 1}\n\n\/\/ In MIOpen however, size and strides are not aligned. Permutation of the strides are used to\n\/\/ infer actual layout\n\/\/ - For NCHW, sizes = {N, C, H, W}; strides = {C*H*W, H*W, W, 1}\n\/\/ - For NHWC, sizes = {N, C, H, W}; strides = {C*H*W, 1, W*C, C}\nvoid PermuteDimsStrides(std::vector<size_t>& dims, std::vector<size_t>& strides)\n{\n    auto sorted_dims    = dims;\n    auto sorted_strides = strides;\n    auto p              = TensorDescriptor::find_permutation(dims, strides);\n    std::transform(p.begin(), p.end(), sorted_dims.begin(), [&](auto i) { return dims[i]; });\n    std::transform(p.begin(), p.end(), sorted_strides.begin(), [&](auto i) { return strides[i]; });\n    dims    = sorted_dims;\n    strides = sorted_strides;\n};\n\nvoid InsertGToDimsStrides(const std::string& layout,\n                          char dim,\n                          int group_count,\n                          std::vector<size_t>& dims,\n                          std::vector<size_t>& strides)\n{\n    std::size_t index = layout.find(dim);\n    if(index == std::string::npos)\n        MIOPEN_THROW(\"Failed to find channel in the layout\");\n\n    \/\/ For dimensions,\n    \/\/    Insert an additional dimension g before channel\n    \/\/    Amend the channel size to be channel_size \/ group_count\n    dims[index] \/= group_count;\n    dims.insert(dims.begin() + index, group_count);\n\n    \/\/ For strides,\n    \/\/   The channel stride remain the same\n    \/\/   Insert an additional group stride to be channel_stride * new_channel_size\n    strides.insert(strides.begin() + index, strides[index] * dims[index + 1]);\n}\n\nvoid ComputeMlirDimsStrides(const conv::ProblemDescription& conv_problem,\n                            std::vector<size_t>& in_dims,\n                            std::vector<size_t>& in_strides,\n                            std::vector<size_t>& weights_dims,\n                            std::vector<size_t>& weights_strides,\n                            std::vector<size_t>& out_dims,\n                            std::vector<size_t>& out_strides)\n{\n    auto group_count = conv_problem.GetGroupCount();\n\n    TensorDescriptor in;\n    if(conv_problem.GetDirection() == conv::Direction::Forward)\n        in = conv_problem.GetIn();\n    else\n        in = conv_problem.GetOut();\n\n    in_dims    = in.GetLengths();\n    in_strides = in.GetStrides();\n    PermuteDimsStrides(in_dims, in_strides);\n    \/\/ Add a virtual group dimension before input channel.\n    InsertGToDimsStrides(in.GetLayout(\"NCHW\"), 'C', group_count, in_dims, in_strides);\n\n    \/\/ Add a virtual group dimension before output channel.\n    const TensorDescriptor& weights = conv_problem.GetWeights();\n    weights_dims                    = weights.GetLengths();\n    weights_strides                 = weights.GetStrides();\n    PermuteDimsStrides(weights_dims, weights_strides);\n    InsertGToDimsStrides(\n        weights.GetLayout(\"NCHW\"), 'N', group_count, weights_dims, weights_strides);\n\n    TensorDescriptor out;\n    if(conv_problem.GetDirection() == conv::Direction::Forward)\n        out = conv_problem.GetOut();\n    else\n        out = conv_problem.GetIn();\n\n    out_dims    = out.GetLengths();\n    out_strides = out.GetStrides();\n    PermuteDimsStrides(out_dims, out_strides);\n    \/\/ Add a virtual group dimension before output channel.\n    InsertGToDimsStrides(out.GetLayout(\"NCHW\"), 'C', group_count, out_dims, out_strides);\n}\n\nMlirConvArgs MakeMlirConvArgs(const std::vector<size_t>& in_dims,\n                              const std::vector<size_t>& in_strides,\n                              const std::vector<size_t>& weights_dims,\n                              const std::vector<size_t>& weights_strides,\n                              const std::vector<size_t>& out_dims,\n                              const std::vector<size_t>& out_strides)\n{\n    auto initDimStrides = [](const std::vector<size_t>& dims,\n                             const std::vector<size_t>& strides,\n                             StridedMemRef5D& target) {\n        std::copy(dims.cbegin(), dims.cend(), &target.sizes[0]);\n        std::copy(strides.cbegin(), strides.cend(), &target.strides[0]);\n    };\n\n    StridedMemRef5D filter{nullptr, nullptr, 0, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}};\n    initDimStrides(weights_dims, weights_strides, filter);\n    StridedMemRef5D input{nullptr, nullptr, 0, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}};\n    initDimStrides(in_dims, in_strides, input);\n    StridedMemRef5D output{nullptr, nullptr, 0, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}};\n    initDimStrides(out_dims, out_strides, output);\n\n    return {filter, input, output};\n}\n\nvoid SetMlirConvArgsPtr(ConstData_t in, ConstData_t out, ConstData_t w, MlirConvArgs& args)\n{\n    void* filter = nullptr;\n    void* input  = nullptr;\n    void* output = nullptr;\n#if MIOPEN_BACKEND_OPENCL\n    clGetMemObjectInfo(w, CL_MEM_HOST_PTR, sizeof(filter), &filter, nullptr);\n    clGetMemObjectInfo(in, CL_MEM_HOST_PTR, sizeof(input), &input, nullptr);\n    clGetMemObjectInfo(out, CL_MEM_HOST_PTR, sizeof(output), &output, nullptr);\n#elif MIOPEN_BACKEND_HIP\n    \/\/ NOLINTNEXTLINE (cppcoreguidelines-pro-type-const-cast)\n    filter = const_cast<void*>(w);\n    \/\/ NOLINTNEXTLINE (cppcoreguidelines-pro-type-const-cast)\n    input = const_cast<void*>(in);\n    \/\/ NOLINTNEXTLINE (cppcoreguidelines-pro-type-const-cast)\n    output = const_cast<void*>(out);\n#endif\n\n    if((filter == nullptr) || (input == nullptr) || (output == nullptr))\n        MIOPEN_THROW(\"Invalid device pointers\");\n\n    args.filter.basePtr = filter;\n    args.filter.data    = filter;\n    args.input.basePtr  = input;\n    args.input.data     = input;\n    args.output.basePtr = output;\n    args.output.data    = output;\n}\n} \/\/ Anonymous namespace\n\nInvokerFactory MakeMlirFwdInvokerFactory(const ConvolutionContext& ctx)\n{\n    assert((ctx.direction.IsForward()));\n\n    std::vector<size_t> in_dims, in_strides;\n    std::vector<size_t> weights_dims, weights_strides;\n    std::vector<size_t> out_dims, out_strides;\n    ComputeMlirDimsStrides(ctx.conv_problem,\n                           in_dims,\n                           in_strides,\n                           weights_dims,\n                           weights_strides,\n                           out_dims,\n                           out_strides);\n\n    MlirConvArgs args =\n        MakeMlirConvArgs(in_dims, in_strides, weights_dims, weights_strides, out_dims, out_strides);\n\n    return [=](const std::vector<Kernel>& kernels) mutable {\n        return [=](const Handle& handle, const AnyInvokeParams& primitive_parameters) mutable {\n            const auto& forward_invoke_params =\n                primitive_parameters.CastTo<conv::DataInvokeParams>();\n            const auto& tensors = forward_invoke_params.tensors;\n\n            SetMlirConvArgsPtr(tensors.in, tensors.out, tensors.w, args);\n            handle.Run(kernels[0])(args);\n        };\n    };\n}\n\nInvokerFactory MakeMlirBwdInvokerFactory(const ConvolutionContext& ctx)\n{\n    assert(ctx.direction.IsBackwardData());\n\n    std::vector<size_t> in_dims, in_strides;\n    std::vector<size_t> weights_dims, weights_strides;\n    std::vector<size_t> out_dims, out_strides;\n    ComputeMlirDimsStrides(ctx.conv_problem,\n                           in_dims,\n                           in_strides,\n                           weights_dims,\n                           weights_strides,\n                           out_dims,\n                           out_strides);\n    MlirConvArgs args =\n        MakeMlirConvArgs(in_dims, in_strides, weights_dims, weights_strides, out_dims, out_strides);\n\n    const auto& conv  = ctx.conv_problem.GetConv();\n    const auto& wDesc = ctx.conv_problem.GetWeights();\n\n    bool every_pixel_is_written = true;\n    for(int i = 0; i < conv.GetSpatialDimension(); ++i)\n    {\n        const auto conv_stride   = conv.GetConvStrides()[i];\n        const auto conv_dilation = conv.GetConvDilations()[i];\n        const auto filter_size   = wDesc.GetLengths()[2 + i];\n\n        \/\/ TODO: This can be relaxed.\n        if(!(conv_dilation == 1 && conv_stride <= filter_size))\n            every_pixel_is_written = false;\n    }\n\n    return [=](const std::vector<Kernel>& kernels) mutable {\n        return [=](const Handle& handle, const AnyInvokeParams& primitive_parameters) mutable {\n            float elapsed        = 0;\n            const auto& data_ctx = primitive_parameters.CastTo<conv::DataInvokeParams>();\n            const auto& tensors  = data_ctx.tensors;\n\n            if(!every_pixel_is_written)\n            {\n                float zero = 0.f;\n                SetTensor(handle, tensors.outDesc, tensors.out, &zero);\n\n                if(handle.IsProfilingEnabled())\n                    elapsed += handle.GetKernelTime();\n            }\n\n            SetMlirConvArgsPtr(tensors.out, tensors.in, tensors.w, args);\n            for(const auto& k : kernels)\n            {\n                handle.Run(k)(args);\n                elapsed += handle.GetKernelTime();\n            }\n\n            if(handle.IsProfilingEnabled())\n            {\n                handle.ResetKernelTime();\n                handle.AccumKernelTime(elapsed);\n            }\n        };\n    };\n}\n\nInvokerFactory MakeMlirWrWInvokerFactory(const ConvolutionContext& ctx)\n{\n    assert((ctx.direction.IsBackwardWrW()));\n\n    std::vector<size_t> in_dims, in_strides;\n    std::vector<size_t> weights_dims, weights_strides;\n    std::vector<size_t> out_dims, out_strides;\n    ComputeMlirDimsStrides(ctx.conv_problem,\n                           in_dims,\n                           in_strides,\n                           weights_dims,\n                           weights_strides,\n                           out_dims,\n                           out_strides);\n    MlirConvArgs args =\n        MakeMlirConvArgs(in_dims, in_strides, weights_dims, weights_strides, out_dims, out_strides);\n\n    return [=](const std::vector<Kernel>& kernels) mutable {\n        return [=](const Handle& handle, const AnyInvokeParams& primitive_parameters) mutable {\n            const auto& wrw_invoke_params = primitive_parameters.CastTo<conv::WrWInvokeParams>();\n            const auto& tensors           = wrw_invoke_params.tensors;\n\n            \/\/ Only fp32 use atomic_add, which accumulate the result into dw.\n            \/\/ Therefore the need for setting to zero beforehand.\n            if(tensors.dwDesc.GetType() == miopenFloat)\n            {\n                float zero = 0.f;\n                SetTensor(handle, tensors.dwDesc, tensors.dw, &zero);\n            }\n\n            SetMlirConvArgsPtr(tensors.x, tensors.dy, tensors.dw, args);\n            handle.Run(kernels[0])(args);\n        };\n    };\n}\n\n} \/\/ namespace conv\n} \/\/ namespace miopen\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * REmbeddedPosix.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#include <r\/RExec.hpp>\n\n#include <core\/FilePath.hpp>\n\n#include <boost\/date_time\/posix_time\/posix_time_duration.hpp>\n\n\/\/ after boost stuff to prevent length (Rf_length) symbol conflict issues\n#include \"REmbedded.hpp\"\n#include <r\/RInterface.hpp>\n#include <r\/RErrorCategory.hpp>\n#include <r\/RUtil.hpp>\n\n#include <R_ext\/eventloop.h>\n#include <R_ext\/rlocale.h>\n\n#include <Rembedded.h>\n\n#ifdef __APPLE__\n#include <dlfcn.h>\nextern \"C\" void R_ProcessEvents(void);\nextern \"C\" void (*ptr_R_ProcessEvents)(void);\n#define QCF_SET_PEPTR  1  \/* set ProcessEvents function pointer *\/\n#define QCF_SET_FRONT  2  \/* set application mode to front *\/\nextern \"C\"  typedef void (*ptr_QuartzCocoa_SetupEventLoop)(int, unsigned long);\n#endif\n\nextern int R_running_as_main_program;  \/\/ from unix\/system.c\n\nusing namespace core;\n\nnamespace r {\nnamespace session {\n\nvoid runEmbeddedR(const core::FilePath& \/*rHome*\/,    \/\/ ignored on posix\n                  const core::FilePath& \/*userHome*\/, \/\/ ignored on posix\n                  bool newSession,\n                  SA_TYPE defaultSaveAction,\n                  const Callbacks& callbacks,\n                  InternalCallbacks* pInternal)\n{\n   \/\/ disable R signal handlers. see src\/main\/main.c for the default\n   \/\/ implementations. in our case ignore them for the following reasons:\n   \/\/\n   \/\/ INT - no concept of Ctrl-C based interruption (use flag directly)\n   \/\/\n   \/\/ SEGV, ILL, & BUS: unsupported due to prompt invoking networking\n   \/\/ code (unsupported from within a signal handler)\n   \/\/\n   \/\/ USR1 & USR2: same as above SEGV, etc. + we use them for other purposes\n   \/\/\n   \/\/ PIPE: required for prevent interrupts to send in Rhttpd (which we\n   \/\/ have replaced with our own http listener)\n   \/\/\n   R_SignalHandlers = 0;\n\n   \/\/ set message callback early so we can see initialization error messages\n   ptr_R_ShowMessage = callbacks.showMessage ;\n\n   \/\/ running as main program (affects location of R_CStackStart on platforms\n   \/\/ without HAVE_LIBC_STACK_END or HAVE_KERN_USRSTACK). see also discussion\n   \/\/ on R_CStackStart in 8.1.5 Threading issues\n   R_running_as_main_program = 1;\n\n   \/\/ initialize R\n   const char *args[]= {\"RStudio\", \"--interactive\"};\n   Rf_initialize_R(sizeof(args)\/sizeof(args[0]), (char**)args);\n\n   \/\/ For newSession = false we need to do a few things:\n   \/\/\n   \/\/   1) set R_Quiet so we startup without a banner\n   \/\/\n   \/\/   2) set LoadInitFile to supress execution of .Rprofile\n   \/\/\n   \/\/   3) we also need to make sure that .First is not executed. this is\n   \/\/      taken care of via the fact that we set RestoreAction to SA_NORESTORE\n   \/\/      which means that when setup_Rmainloop there is no .First function\n   \/\/      available to it because we haven't restored the environment yet.\n   \/\/      Note that .First is executed in the case of new sessions because\n   \/\/      it is read from .Rprofile as part of setup_Rmainloop. This implies\n   \/\/      that in our version of R the .First function must be defined in\n   \/\/      .Rprofile rather than simply saved into the global environment\n   \/\/      of the default workspace\n   \/\/\n   structRstart rp;\n   Rstart Rp = &rp;\n   R_DefParams(Rp) ;\n   Rp->R_Slave = FALSE ;\n   Rp->R_Quiet = newSession ? FALSE : TRUE;\n   Rp->R_Interactive = TRUE ;\n   Rp->SaveAction = defaultSaveAction ;\n   Rp->RestoreAction = SA_NORESTORE; \/\/ handled within initialize()\n   Rp->LoadInitFile = newSession ? TRUE : FALSE;\n   R_SetParams(Rp) ;\n\n   \/\/ redirect console\n   R_Interactive = TRUE; \/\/ should have also been set by call to Rf_initialize_R\n   R_Consolefile = NULL;\n   R_Outputfile = NULL;\n   ptr_R_ReadConsole = callbacks.readConsole ;\n   ptr_R_WriteConsole = NULL; \/\/ must set this to NULL for Ex to be called\n   ptr_R_WriteConsoleEx = callbacks.writeConsoleEx ;\n   ptr_R_EditFile = callbacks.editFile ;\n   ptr_R_Busy = callbacks.busy;\n\n   \/\/ hook messages (in case Rf_initialize_R overwrites previously set hook)\n   ptr_R_ShowMessage = callbacks.showMessage ;\n\n   \/\/ hook file handling\n   ptr_R_ChooseFile = callbacks.chooseFile ;\n   ptr_R_ShowFiles = callbacks.showFiles ;\n\n   \/\/ hook history\n   ptr_R_loadhistory = callbacks.loadhistory;\n   ptr_R_savehistory = callbacks.savehistory;\n   ptr_R_addhistory = callbacks.addhistory;\n\n   \/\/ hook suicide, but save reference to internal suicide so we can forward\n   pInternal->suicide = ptr_R_Suicide;\n   ptr_R_Suicide = callbacks.suicide;\n\n   \/\/ hook clean up, but save reference to internal clean up so can forward\n   pInternal->cleanUp = ptr_R_CleanUp;\n   ptr_R_CleanUp = callbacks.cleanUp ;\n\n   \/\/ NOTE: we do not hook the following callbacks because they are targeted\n   \/\/ at clients that have a stdio-based console\n   \/\/    ptr_R_ResetConsole\n   \/\/    ptr_R_FlushConsole\n   \/\/    ptr_R_ClearerrConsole\n\n   \/\/ run main loop (does not return)\n   Rf_mainloop();\n}\n\nError completeEmbeddedRInitialization()\n{\n   return Success();\n}\n\nnamespace event_loop {\n\nnamespace {\n\n\/\/ currently installed polled event handler\nvoid (*s_polledEventHandler)(void) = NULL;\n\n\/\/ previously existing polled event handler\nvoid (*s_oldPolledEventHandler)(void) = NULL;\n\n\/\/ function we register with R to implement polled event handler\nvoid polledEventHandler()\n{\n   s_polledEventHandler();\n\n   if (s_oldPolledEventHandler != NULL)\n      s_oldPolledEventHandler();\n}\n\n\n#ifdef __APPLE__\n\nvoid logDLError(const std::string& message, const ErrorLocation& location)\n{\n   std::string errmsg(message);\n   char* dlError = ::dlerror();\n   if (dlError)\n      errmsg += \": \" + std::string(dlError);\n   core::log::logErrorMessage(errmsg, location);\n}\n\n\/\/ attempt to setup quartz event loop, if this fails then log and\n\/\/ return false (as a result we'll have to disable the quartz R\n\/\/ function so the user doesn't get in trouble)\nbool setupQuartzEventLoop()\n{\n   \/\/ first make sure that the gdDevices pacakage is loaded\n   Error error = r::exec::executeString(\"library(grDevices)\");\n   if (error)\n   {\n      LOG_ERROR(error);\n      return false;\n   }\n\n   \/\/ get a reference to the grDevices library\n   void* pGrDevices = ::dlopen(\"grDevices.so\",\n                               RTLD_LAZY | RTLD_LOCAL | RTLD_NOLOAD);\n   if (pGrDevices)\n   {\n      ptr_QuartzCocoa_SetupEventLoop pSetupEventLoop  =\n               (ptr_QuartzCocoa_SetupEventLoop)::dlsym(\n                                             pGrDevices,\n                                            \"QuartzCocoa_SetupEventLoop\");\n      if (pSetupEventLoop)\n      {\n         \/\/ attempt to setup event loop\n         pSetupEventLoop(QCF_SET_PEPTR|QCF_SET_FRONT, 100);\n\n         \/\/ check that we got the ptr_R_ProcessEvents initialized\n         if (ptr_R_ProcessEvents != NULL)\n         {\n            return true;\n         }\n         else\n         {\n            LOG_ERROR_MESSAGE(\"ptr_R_ProcessEvents not initialized\");\n            return false;\n         }\n      }\n      else\n      {\n         logDLError(\"Error looking up QuartzCocoa_SetupEventLoop\",\n                    ERROR_LOCATION);\n         return false;\n      }\n   }\n   else\n   {\n      logDLError(\"Error loading grDevices.so\", ERROR_LOCATION);\n      return false;\n   }\n}\n\n\/\/ On versions prior to R 2.12 the event pump is handled by R_ProcessEvents\n\/\/ rather than by the expected R_PolledEvents mechanism. On the Mac\n\/\/ R_ProcessEvents includes a hook (ptr_R_ProcessEvents) but this is\n\/\/ taken by the quartz module. We therefore need a way to hook it but\n\/\/ still delegate to quartz so the quartz device works. do this by\n\/\/ ensuring quartz is loaded then calling QuartzCocoa_SetupEventLoop\nvoid installAppleR_2_11_Workaround(void (*newPolledEventHandler)(void))\n{\n   \/\/ attempt to initialize the quartz event loop (init ptr_R_ProcessEvents\n   \/\/ so that we can delegate to it after we override it)\n   if (!setupQuartzEventLoop())\n   {\n      Error error = r::exec::RFunction(\".rs.disableQuartz\").call();\n      if (error)\n         LOG_ERROR(error);\n   }\n\n   \/\/ copy handler function\n   s_polledEventHandler = newPolledEventHandler;\n\n   \/\/ preserve old handler and set new one (note that ptr_R_ProcessEvents\n   \/\/ might be NULL if we didn't succeed in setting up the quartz\n   \/\/ event loop above. in this case the polled event handler will\n   \/\/ ignore it\n   s_oldPolledEventHandler = ptr_R_ProcessEvents;\n   ptr_R_ProcessEvents = polledEventHandler;\n}\n\n#endif\n\n} \/\/ anonymous namespace\n\n\nvoid initializePolledEventHandler(void (*newPolledEventHandler)(void))\n{\n   \/\/ can only call this once\n   BOOST_ASSERT(!s_polledEventHandler);\n\n   \/\/ special hack for R 2.11.1 on OSX\n#ifdef __APPLE__\n   if (!r::util::hasRequiredVersion(\"2.12\"))\n   {\n      installAppleR_2_11_Workaround(newPolledEventHandler);\n      return;\n   }\n#endif\n\n   \/\/ implementation based on addTcl() in tcltk_unix.c\n\n   \/\/ copy handler function\n   s_polledEventHandler = newPolledEventHandler;\n\n   \/\/ preserve old handler and set new one\n   s_oldPolledEventHandler = R_PolledEvents;\n   R_PolledEvents = polledEventHandler;\n\n   \/\/ set R_wait_usec\n   if (R_wait_usec > 10000 || R_wait_usec == 0)\n      R_wait_usec = 10000;\n}\n\nbool polledEventHandlerInitialized()\n{\n   return s_polledEventHandler != NULL;\n}\n\nvoid processEvents()\n{\n#ifdef __APPLE__\n   R_ProcessEvents();\n\n   \/\/ pickup X11 graphics device events (if any) via X11 input handler\n   fd_set* what = R_checkActivity(0,1);\n   if (what != NULL)\n      R_runHandlers(R_InputHandlers, what);\n#else\n   \/\/ check for activity on standard input handlers (but ignore stdin).\n   \/\/ return immediately if there is no input currently available\n   fd_set* what = R_checkActivity(0,1);\n\n   \/\/ run handlers on the input (or run the polled event handler if there\n   \/\/ is no input currently available)\n   R_runHandlers(R_InputHandlers, what);\n#endif\n}\n\n} \/\/ namespace event_loop\n} \/\/ namespace session\n} \/\/ namespace r\n\n\n\n<commit_msg>don't specify QCF_SET_FRONT<commit_after>\/*\n * REmbeddedPosix.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#include <r\/RExec.hpp>\n\n#include <core\/FilePath.hpp>\n\n#include <boost\/date_time\/posix_time\/posix_time_duration.hpp>\n\n\/\/ after boost stuff to prevent length (Rf_length) symbol conflict issues\n#include \"REmbedded.hpp\"\n#include <r\/RInterface.hpp>\n#include <r\/RErrorCategory.hpp>\n#include <r\/RUtil.hpp>\n\n#include <R_ext\/eventloop.h>\n#include <R_ext\/rlocale.h>\n\n#include <Rembedded.h>\n\n#ifdef __APPLE__\n#include <dlfcn.h>\nextern \"C\" void R_ProcessEvents(void);\nextern \"C\" void (*ptr_R_ProcessEvents)(void);\n#define QCF_SET_PEPTR  1  \/* set ProcessEvents function pointer *\/\n#define QCF_SET_FRONT  2  \/* set application mode to front *\/\nextern \"C\"  typedef void (*ptr_QuartzCocoa_SetupEventLoop)(int, unsigned long);\n#endif\n\nextern int R_running_as_main_program;  \/\/ from unix\/system.c\n\nusing namespace core;\n\nnamespace r {\nnamespace session {\n\nvoid runEmbeddedR(const core::FilePath& \/*rHome*\/,    \/\/ ignored on posix\n                  const core::FilePath& \/*userHome*\/, \/\/ ignored on posix\n                  bool newSession,\n                  SA_TYPE defaultSaveAction,\n                  const Callbacks& callbacks,\n                  InternalCallbacks* pInternal)\n{\n   \/\/ disable R signal handlers. see src\/main\/main.c for the default\n   \/\/ implementations. in our case ignore them for the following reasons:\n   \/\/\n   \/\/ INT - no concept of Ctrl-C based interruption (use flag directly)\n   \/\/\n   \/\/ SEGV, ILL, & BUS: unsupported due to prompt invoking networking\n   \/\/ code (unsupported from within a signal handler)\n   \/\/\n   \/\/ USR1 & USR2: same as above SEGV, etc. + we use them for other purposes\n   \/\/\n   \/\/ PIPE: required for prevent interrupts to send in Rhttpd (which we\n   \/\/ have replaced with our own http listener)\n   \/\/\n   R_SignalHandlers = 0;\n\n   \/\/ set message callback early so we can see initialization error messages\n   ptr_R_ShowMessage = callbacks.showMessage ;\n\n   \/\/ running as main program (affects location of R_CStackStart on platforms\n   \/\/ without HAVE_LIBC_STACK_END or HAVE_KERN_USRSTACK). see also discussion\n   \/\/ on R_CStackStart in 8.1.5 Threading issues\n   R_running_as_main_program = 1;\n\n   \/\/ initialize R\n   const char *args[]= {\"RStudio\", \"--interactive\"};\n   Rf_initialize_R(sizeof(args)\/sizeof(args[0]), (char**)args);\n\n   \/\/ For newSession = false we need to do a few things:\n   \/\/\n   \/\/   1) set R_Quiet so we startup without a banner\n   \/\/\n   \/\/   2) set LoadInitFile to supress execution of .Rprofile\n   \/\/\n   \/\/   3) we also need to make sure that .First is not executed. this is\n   \/\/      taken care of via the fact that we set RestoreAction to SA_NORESTORE\n   \/\/      which means that when setup_Rmainloop there is no .First function\n   \/\/      available to it because we haven't restored the environment yet.\n   \/\/      Note that .First is executed in the case of new sessions because\n   \/\/      it is read from .Rprofile as part of setup_Rmainloop. This implies\n   \/\/      that in our version of R the .First function must be defined in\n   \/\/      .Rprofile rather than simply saved into the global environment\n   \/\/      of the default workspace\n   \/\/\n   structRstart rp;\n   Rstart Rp = &rp;\n   R_DefParams(Rp) ;\n   Rp->R_Slave = FALSE ;\n   Rp->R_Quiet = newSession ? FALSE : TRUE;\n   Rp->R_Interactive = TRUE ;\n   Rp->SaveAction = defaultSaveAction ;\n   Rp->RestoreAction = SA_NORESTORE; \/\/ handled within initialize()\n   Rp->LoadInitFile = newSession ? TRUE : FALSE;\n   R_SetParams(Rp) ;\n\n   \/\/ redirect console\n   R_Interactive = TRUE; \/\/ should have also been set by call to Rf_initialize_R\n   R_Consolefile = NULL;\n   R_Outputfile = NULL;\n   ptr_R_ReadConsole = callbacks.readConsole ;\n   ptr_R_WriteConsole = NULL; \/\/ must set this to NULL for Ex to be called\n   ptr_R_WriteConsoleEx = callbacks.writeConsoleEx ;\n   ptr_R_EditFile = callbacks.editFile ;\n   ptr_R_Busy = callbacks.busy;\n\n   \/\/ hook messages (in case Rf_initialize_R overwrites previously set hook)\n   ptr_R_ShowMessage = callbacks.showMessage ;\n\n   \/\/ hook file handling\n   ptr_R_ChooseFile = callbacks.chooseFile ;\n   ptr_R_ShowFiles = callbacks.showFiles ;\n\n   \/\/ hook history\n   ptr_R_loadhistory = callbacks.loadhistory;\n   ptr_R_savehistory = callbacks.savehistory;\n   ptr_R_addhistory = callbacks.addhistory;\n\n   \/\/ hook suicide, but save reference to internal suicide so we can forward\n   pInternal->suicide = ptr_R_Suicide;\n   ptr_R_Suicide = callbacks.suicide;\n\n   \/\/ hook clean up, but save reference to internal clean up so can forward\n   pInternal->cleanUp = ptr_R_CleanUp;\n   ptr_R_CleanUp = callbacks.cleanUp ;\n\n   \/\/ NOTE: we do not hook the following callbacks because they are targeted\n   \/\/ at clients that have a stdio-based console\n   \/\/    ptr_R_ResetConsole\n   \/\/    ptr_R_FlushConsole\n   \/\/    ptr_R_ClearerrConsole\n\n   \/\/ run main loop (does not return)\n   Rf_mainloop();\n}\n\nError completeEmbeddedRInitialization()\n{\n   return Success();\n}\n\nnamespace event_loop {\n\nnamespace {\n\n\/\/ currently installed polled event handler\nvoid (*s_polledEventHandler)(void) = NULL;\n\n\/\/ previously existing polled event handler\nvoid (*s_oldPolledEventHandler)(void) = NULL;\n\n\/\/ function we register with R to implement polled event handler\nvoid polledEventHandler()\n{\n   s_polledEventHandler();\n\n   if (s_oldPolledEventHandler != NULL)\n      s_oldPolledEventHandler();\n}\n\n\n#ifdef __APPLE__\n\nvoid logDLError(const std::string& message, const ErrorLocation& location)\n{\n   std::string errmsg(message);\n   char* dlError = ::dlerror();\n   if (dlError)\n      errmsg += \": \" + std::string(dlError);\n   core::log::logErrorMessage(errmsg, location);\n}\n\n\/\/ Note that when we passed QCF_SET_FRONT to QuartzCocoa_SetupEventLoop\n\/\/ sometimes this resulted in our application having a \"bouncing\"\n\/\/ state which we couldn't rid ourselves of.\n\/\/\n\/\/ Note that in researching the way R implements QCF_SET_FRONT I discovered\n\/\/ that a depricated API is called AND an explicit call to SetFront. Another\n\/\/ way to go would be to call the TransformProcessType API:\n\/\/\n\/\/   http:\/\/www.cocoadev.com\/index.pl?TransformProcessType\n\/\/   http:\/\/developer.apple.com\/library\/mac\/#documentation\/Carbon\/Reference\/Process_Manager\/Reference\/reference.html%23\/\/apple_ref\/c\/func\/TransformProcessType\n\/\/\n\/\/ Note this would look something like (cmake and includes for completeness):\n\/*\n   find_library(CARBON_LIBRARY NAMES Carbon)\n   set(LINK_FLAGS ${CARBON_LIBRARY})\n\n   #include <Carbon\/Carbon.h>\n   #undef TRUE\n   #undef FALSE\n\n   static const ProcessSerialNumber thePSN = { 0, kCurrentProcess };\n   ::TransformProcessType(&thePSN, kProcessTransformToForegroundApplication);\n*\/\n\n\/\/ attempt to setup quartz event loop, if this fails then log and\n\/\/ return false (as a result we'll have to disable the quartz R\n\/\/ function so the user doesn't get in trouble)\nbool setupQuartzEventLoop()\n{\n   \/\/ first make sure that the gdDevices pacakage is loaded\n   Error error = r::exec::executeString(\"library(grDevices)\");\n   if (error)\n   {\n      LOG_ERROR(error);\n      return false;\n   }\n\n   \/\/ get a reference to the grDevices library\n   void* pGrDevices = ::dlopen(\"grDevices.so\",\n                               RTLD_LAZY | RTLD_LOCAL | RTLD_NOLOAD);\n   if (pGrDevices)\n   {\n      ptr_QuartzCocoa_SetupEventLoop pSetupEventLoop  =\n               (ptr_QuartzCocoa_SetupEventLoop)::dlsym(\n                                             pGrDevices,\n                                            \"QuartzCocoa_SetupEventLoop\");\n      if (pSetupEventLoop)\n      {\n         \/\/ attempt to setup event loop\n         pSetupEventLoop(QCF_SET_PEPTR, 100);\n\n         \/\/ check that we got the ptr_R_ProcessEvents initialized\n         if (ptr_R_ProcessEvents != NULL)\n         {\n            return true;\n         }\n         else\n         {\n            LOG_ERROR_MESSAGE(\"ptr_R_ProcessEvents not initialized\");\n            return false;\n         }\n      }\n      else\n      {\n         logDLError(\"Error looking up QuartzCocoa_SetupEventLoop\",\n                    ERROR_LOCATION);\n         return false;\n      }\n   }\n   else\n   {\n      logDLError(\"Error loading grDevices.so\", ERROR_LOCATION);\n      return false;\n   }\n}\n\n\/\/ On versions prior to R 2.12 the event pump is handled by R_ProcessEvents\n\/\/ rather than by the expected R_PolledEvents mechanism. On the Mac\n\/\/ R_ProcessEvents includes a hook (ptr_R_ProcessEvents) but this is\n\/\/ taken by the quartz module. We therefore need a way to hook it but\n\/\/ still delegate to quartz so the quartz device works. do this by\n\/\/ ensuring quartz is loaded then calling QuartzCocoa_SetupEventLoop\nvoid installAppleR_2_11_Workaround(void (*newPolledEventHandler)(void))\n{\n   \/\/ attempt to initialize the quartz event loop (init ptr_R_ProcessEvents\n   \/\/ so that we can delegate to it after we override it)\n   if (!setupQuartzEventLoop())\n   {\n      Error error = r::exec::RFunction(\".rs.disableQuartz\").call();\n      if (error)\n         LOG_ERROR(error);\n   }\n\n   \/\/ copy handler function\n   s_polledEventHandler = newPolledEventHandler;\n\n   \/\/ preserve old handler and set new one (note that ptr_R_ProcessEvents\n   \/\/ might be NULL if we didn't succeed in setting up the quartz\n   \/\/ event loop above. in this case the polled event handler will\n   \/\/ ignore it\n   s_oldPolledEventHandler = ptr_R_ProcessEvents;\n   ptr_R_ProcessEvents = polledEventHandler;\n}\n\n#endif\n\n} \/\/ anonymous namespace\n\n\nvoid initializePolledEventHandler(void (*newPolledEventHandler)(void))\n{\n   \/\/ can only call this once\n   BOOST_ASSERT(!s_polledEventHandler);\n\n   \/\/ special hack for R 2.11.1 on OSX\n#ifdef __APPLE__\n   if (!r::util::hasRequiredVersion(\"2.12\"))\n   {\n      installAppleR_2_11_Workaround(newPolledEventHandler);\n      return;\n   }\n#endif\n\n   \/\/ implementation based on addTcl() in tcltk_unix.c\n\n   \/\/ copy handler function\n   s_polledEventHandler = newPolledEventHandler;\n\n   \/\/ preserve old handler and set new one\n   s_oldPolledEventHandler = R_PolledEvents;\n   R_PolledEvents = polledEventHandler;\n\n   \/\/ set R_wait_usec\n   if (R_wait_usec > 10000 || R_wait_usec == 0)\n      R_wait_usec = 10000;\n}\n\nbool polledEventHandlerInitialized()\n{\n   return s_polledEventHandler != NULL;\n}\n\nvoid processEvents()\n{\n#ifdef __APPLE__\n   R_ProcessEvents();\n\n   \/\/ pickup X11 graphics device events (if any) via X11 input handler\n   fd_set* what = R_checkActivity(0,1);\n   if (what != NULL)\n      R_runHandlers(R_InputHandlers, what);\n#else\n   \/\/ check for activity on standard input handlers (but ignore stdin).\n   \/\/ return immediately if there is no input currently available\n   fd_set* what = R_checkActivity(0,1);\n\n   \/\/ run handlers on the input (or run the polled event handler if there\n   \/\/ is no input currently available)\n   R_runHandlers(R_InputHandlers, what);\n#endif\n}\n\n} \/\/ namespace event_loop\n} \/\/ namespace session\n} \/\/ namespace r\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n*    Copyright (c) <2002-2009> <Jean-Philippe Barrette-LaPierre>\n*    \n*    Permission is hereby granted, free of charge, to any person obtaining\n*    a copy of this software and associated documentation files \n*    (curlpp), to deal in the Software without restriction, \n*    including without limitation the rights to use, copy, modify, merge,\n*    publish, distribute, sublicense, and\/or sell copies of the Software,\n*    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\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#include \"curlpp\/internal\/global.h\"\n#include \"curlpp\/internal\/CurlHandle.hpp\"\n#include \"curlpp\/internal\/OptionSetter.hpp\"\n\n#include \"utilspp\/Functors.hpp\"\n\n#include <string>\n#include <iostream>\n\n\nnamespace curlpp\n{\n\n\nnamespace internal\n{\n\n\t\nstruct Callbacks\n{\n\tstatic size_t \n\tWriteCallback(char * buffer, size_t size, size_t nitems, internal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeWriteFunctor(buffer, size, nitems);\n\t};\n\n\n\tstatic size_t\n\tStreamWriteCallback(char * buffer, size_t size, size_t nitems, std::ostream * stream)\n\t{\n\t\tsize_t realwrote = size * nitems;\n\t\tstream->write(buffer, static_cast<std::streamsize>(realwrote));\n\t\tif(!(*stream))\n\t\t\trealwrote = 0;\n\n\t\treturn realwrote;\n\t};\n\n\n\tstatic size_t\n\tHeaderCallback(char * buffer, size_t size, size_t nitems, internal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeHeaderFunctor(buffer, size, nitems);\n\t};\n\n\n\tstatic size_t\n\tReadCallback(char * buffer, size_t size, size_t nitems, internal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeReadFunctor(buffer, size, nitems);\n\t};\n\n\n\tstatic size_t\n\tStreamReadCallback(char * buffer, size_t size, size_t nitems, std::istream * stream)\n\t{\n\t\tsize_t realread = stream->readsome(buffer, static_cast<std::streamsize>(size * nitems));\n\t\tif(!(*stream))\n\t\t\trealread = CURL_READFUNC_ABORT;\n\n\t\treturn realread;\n\t};\n\n\n\tstatic int\n\tProgressCallback(internal::CurlHandle * handle, \n\t\t\t\t\t\t\t\t\t\t\tdouble dltotal, \n\t\t\t\t\t\t\t\t\t\t\tdouble dlnow, \n\t\t\t\t\t\t\t\t\t\t\tdouble ultotal, \n\t\t\t\t\t\t\t\t\t\t\tdouble ulnow)\n\t{\n\t\treturn handle->executeProgressFunctor(dltotal, dlnow, ultotal, ulnow);\n\t};\n\n\n\tstatic int\n\tDebugCallback(CURL *,\n\t\t\t\t\t\t\t\t\tcurl_infotype type,\n\t\t\t\t\t\t\t\t\tchar * data,\n\t\t\t\t\t\t\t\t\tsize_t size,\n\t\t\t\t\t\t\t\t\tinternal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeDebugFunctor(type, data, size);\n\t};\n\n\n\tstatic CURLcode \n\tSslCtxCallback(CURL *,\n\t\t\t\t\t\t\t\t\t\tvoid * ssl_ctx,\n\t\t\t\t\t\t\t\t\t\tinternal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeSslCtxFunctor(ssl_ctx);\n\t};\n\n};\n\n\nvoid OptionSetter<curlpp::Forms, CURLOPT_HTTPPOST>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_HTTPPOST, value.cHttpPost());\n};\n\n\nvoid OptionSetter<curlpp::types::WriteFunctionFunctor, CURLOPT_WRITEFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_WRITEFUNCTION, Callbacks::WriteCallback);\n\thandle->option(CURLOPT_WRITEDATA, handle);\n\thandle->setWriteFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostWriteFunction, CURLOPT_WRITEFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_WRITEFUNCTION, Callbacks::WriteCallback);\n\thandle->option(CURLOPT_WRITEDATA, handle);\n\thandle->setWriteFunctor(curlpp::types::WriteFunctionFunctor(&value,\n\t\t&curlpp::types::BoostWriteFunction::operator()));\n};\n\n#endif\n\n\nvoid OptionSetter<FILE *, CURLOPT_WRITEDATA>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_WRITEFUNCTION, (void *)NULL);\n\thandle->option(CURLOPT_WRITEDATA, value);\n};\n\n\nvoid OptionSetter<std::ostream *, CURLOPT_WRITEDATA>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_WRITEFUNCTION, (void *)Callbacks::StreamWriteCallback);\n\thandle->option(CURLOPT_WRITEDATA, value);\n};\n\n\nvoid OptionSetter<curlpp::types::ReadFunctionFunctor, CURLOPT_READFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_READFUNCTION, Callbacks::ReadCallback);\n\thandle->option(CURLOPT_READDATA, handle);\n\thandle->setReadFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostReadFunction, CURLOPT_READFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_READFUNCTION, Callbacks::ReadCallback);\n\thandle->option(CURLOPT_READDATA, handle);\n\thandle->setReadFunctor(value);\n};\n\n#endif\n\n\nvoid OptionSetter<FILE *, CURLOPT_READDATA>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_READFUNCTION, (void *)NULL);\n\thandle->option(CURLOPT_READDATA, value);\n};\n\n\n\nvoid OptionSetter<std::istream *, CURLOPT_READDATA>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_READFUNCTION, (void *)Callbacks::StreamReadCallback);\n\thandle->option(CURLOPT_READDATA, value);\n};\n\n\nvoid OptionSetter<curlpp::types::ProgressFunctionFunctor, CURLOPT_PROGRESSFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_PROGRESSFUNCTION, Callbacks::ProgressCallback);\n\thandle->option(CURLOPT_PROGRESSDATA, handle);\n\thandle->setProgressFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostProgressFunction, CURLOPT_PROGRESSFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_PROGRESSFUNCTION, Callbacks::ProgressCallback);\n\thandle->option(CURLOPT_PROGRESSDATA, handle);\n\thandle->setProgressFunctor(value);\n};\n\n#endif\n\n\nvoid OptionSetter<curlpp::types::WriteFunctionFunctor, CURLOPT_HEADERFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_HEADERFUNCTION, Callbacks::HeaderCallback);\n\thandle->option(CURLOPT_HEADERDATA, handle);\n\thandle->setHeaderFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostWriteFunction, CURLOPT_HEADERFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_HEADERFUNCTION, Callbacks::HeaderCallback);\n\thandle->option(CURLOPT_HEADERDATA, handle);\n\thandle->setHeaderFunctor(value);\n};\n\n#endif\n\n\nvoid OptionSetter<curlpp::types::DebugFunctionFunctor, CURLOPT_DEBUGFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_DEBUGFUNCTION, Callbacks::DebugCallback);\n\thandle->option(CURLOPT_DEBUGDATA, handle);\n\thandle->setDebugFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostDebugFunction, CURLOPT_DEBUGFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_DEBUGFUNCTION, Callbacks::DebugCallback);\n\thandle->option(CURLOPT_DEBUGDATA, handle);\n\thandle->setDebugFunctor(value);\n};\n\n#endif\n\n\nvoid OptionSetter<curlpp::types::SslCtxFunctionFunctor, CURLOPT_SSL_CTX_FUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_SSL_CTX_FUNCTION, Callbacks::SslCtxCallback);\n\thandle->option(CURLOPT_SSL_CTX_DATA, handle);\n\thandle->setSslCtxFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostSslCtxFunction, CURLOPT_SSL_CTX_FUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_SSL_CTX_FUNCTION, Callbacks::SslCtxCallback);\n\thandle->option(CURLOPT_SSL_CTX_DATA, handle);\n\thandle->setSslCtxFunctor(value);\n};\n\n#endif\n\n\n}\/\/ namespace internal\n\n\n}\/\/ namespace curlpp\n\n<commit_msg>Supressing warning in curlpp<commit_after>\/*\n*    Copyright (c) <2002-2009> <Jean-Philippe Barrette-LaPierre>\n*    \n*    Permission is hereby granted, free of charge, to any person obtaining\n*    a copy of this software and associated documentation files \n*    (curlpp), to deal in the Software without restriction, \n*    including without limitation the rights to use, copy, modify, merge,\n*    publish, distribute, sublicense, and\/or sell copies of the Software,\n*    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\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#include \"curlpp\/internal\/global.h\"\n#include \"curlpp\/internal\/CurlHandle.hpp\"\n#include \"curlpp\/internal\/OptionSetter.hpp\"\n\n#include \"utilspp\/Functors.hpp\"\n\n#include <string>\n#include <iostream>\n\n\nnamespace curlpp\n{\n\n\nnamespace internal\n{\n\n\t\nstruct Callbacks\n{\n\tstatic size_t \n\tWriteCallback(char * buffer, size_t size, size_t nitems, internal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeWriteFunctor(buffer, size, nitems);\n\t};\n\n\n\tstatic size_t\n\tStreamWriteCallback(char * buffer, size_t size, size_t nitems, std::ostream * stream)\n\t{\n\t\tsize_t realwrote = size * nitems;\n\t\tstream->write(buffer, static_cast<std::streamsize>(realwrote));\n\t\tif(!(*stream))\n\t\t\trealwrote = 0;\n\n\t\treturn realwrote;\n\t};\n\n\n\tstatic size_t\n\tHeaderCallback(char * buffer, size_t size, size_t nitems, internal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeHeaderFunctor(buffer, size, nitems);\n\t};\n\n\n\tstatic size_t\n\tReadCallback(char * buffer, size_t size, size_t nitems, internal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeReadFunctor(buffer, size, nitems);\n\t};\n\n#pragma warning(push)\n#pragma warning(disable: 4996) \/\/ ->readsome is unsafe function\n\n\tstatic size_t\n\tStreamReadCallback(char * buffer, size_t size, size_t nitems, std::istream * stream)\n\t{\n\t\tsize_t realread = stream->readsome(buffer, static_cast<std::streamsize>(size * nitems));\n\t\tif(!(*stream))\n\t\t\trealread = CURL_READFUNC_ABORT;\n\n\t\treturn realread;\n\t};\n\n#pragma warning(pop)\n\n\tstatic int\n\tProgressCallback(internal::CurlHandle * handle, \n\t\t\t\t\t\t\t\t\t\t\tdouble dltotal, \n\t\t\t\t\t\t\t\t\t\t\tdouble dlnow, \n\t\t\t\t\t\t\t\t\t\t\tdouble ultotal, \n\t\t\t\t\t\t\t\t\t\t\tdouble ulnow)\n\t{\n\t\treturn handle->executeProgressFunctor(dltotal, dlnow, ultotal, ulnow);\n\t};\n\n\n\tstatic int\n\tDebugCallback(CURL *,\n\t\t\t\t\t\t\t\t\tcurl_infotype type,\n\t\t\t\t\t\t\t\t\tchar * data,\n\t\t\t\t\t\t\t\t\tsize_t size,\n\t\t\t\t\t\t\t\t\tinternal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeDebugFunctor(type, data, size);\n\t};\n\n\n\tstatic CURLcode \n\tSslCtxCallback(CURL *,\n\t\t\t\t\t\t\t\t\t\tvoid * ssl_ctx,\n\t\t\t\t\t\t\t\t\t\tinternal::CurlHandle * handle)\n\t{\n\t\treturn handle->executeSslCtxFunctor(ssl_ctx);\n\t};\n\n};\n\n\nvoid OptionSetter<curlpp::Forms, CURLOPT_HTTPPOST>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_HTTPPOST, value.cHttpPost());\n};\n\n\nvoid OptionSetter<curlpp::types::WriteFunctionFunctor, CURLOPT_WRITEFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_WRITEFUNCTION, Callbacks::WriteCallback);\n\thandle->option(CURLOPT_WRITEDATA, handle);\n\thandle->setWriteFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostWriteFunction, CURLOPT_WRITEFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_WRITEFUNCTION, Callbacks::WriteCallback);\n\thandle->option(CURLOPT_WRITEDATA, handle);\n\thandle->setWriteFunctor(curlpp::types::WriteFunctionFunctor(&value,\n\t\t&curlpp::types::BoostWriteFunction::operator()));\n};\n\n#endif\n\n\nvoid OptionSetter<FILE *, CURLOPT_WRITEDATA>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_WRITEFUNCTION, (void *)NULL);\n\thandle->option(CURLOPT_WRITEDATA, value);\n};\n\n\nvoid OptionSetter<std::ostream *, CURLOPT_WRITEDATA>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_WRITEFUNCTION, (void *)Callbacks::StreamWriteCallback);\n\thandle->option(CURLOPT_WRITEDATA, value);\n};\n\n\nvoid OptionSetter<curlpp::types::ReadFunctionFunctor, CURLOPT_READFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_READFUNCTION, Callbacks::ReadCallback);\n\thandle->option(CURLOPT_READDATA, handle);\n\thandle->setReadFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostReadFunction, CURLOPT_READFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_READFUNCTION, Callbacks::ReadCallback);\n\thandle->option(CURLOPT_READDATA, handle);\n\thandle->setReadFunctor(value);\n};\n\n#endif\n\n\nvoid OptionSetter<FILE *, CURLOPT_READDATA>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_READFUNCTION, (void *)NULL);\n\thandle->option(CURLOPT_READDATA, value);\n};\n\n\n\nvoid OptionSetter<std::istream *, CURLOPT_READDATA>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_READFUNCTION, (void *)Callbacks::StreamReadCallback);\n\thandle->option(CURLOPT_READDATA, value);\n};\n\n\nvoid OptionSetter<curlpp::types::ProgressFunctionFunctor, CURLOPT_PROGRESSFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_PROGRESSFUNCTION, Callbacks::ProgressCallback);\n\thandle->option(CURLOPT_PROGRESSDATA, handle);\n\thandle->setProgressFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostProgressFunction, CURLOPT_PROGRESSFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_PROGRESSFUNCTION, Callbacks::ProgressCallback);\n\thandle->option(CURLOPT_PROGRESSDATA, handle);\n\thandle->setProgressFunctor(value);\n};\n\n#endif\n\n\nvoid OptionSetter<curlpp::types::WriteFunctionFunctor, CURLOPT_HEADERFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_HEADERFUNCTION, Callbacks::HeaderCallback);\n\thandle->option(CURLOPT_HEADERDATA, handle);\n\thandle->setHeaderFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostWriteFunction, CURLOPT_HEADERFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_HEADERFUNCTION, Callbacks::HeaderCallback);\n\thandle->option(CURLOPT_HEADERDATA, handle);\n\thandle->setHeaderFunctor(value);\n};\n\n#endif\n\n\nvoid OptionSetter<curlpp::types::DebugFunctionFunctor, CURLOPT_DEBUGFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_DEBUGFUNCTION, Callbacks::DebugCallback);\n\thandle->option(CURLOPT_DEBUGDATA, handle);\n\thandle->setDebugFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostDebugFunction, CURLOPT_DEBUGFUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_DEBUGFUNCTION, Callbacks::DebugCallback);\n\thandle->option(CURLOPT_DEBUGDATA, handle);\n\thandle->setDebugFunctor(value);\n};\n\n#endif\n\n\nvoid OptionSetter<curlpp::types::SslCtxFunctionFunctor, CURLOPT_SSL_CTX_FUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_SSL_CTX_FUNCTION, Callbacks::SslCtxCallback);\n\thandle->option(CURLOPT_SSL_CTX_DATA, handle);\n\thandle->setSslCtxFunctor(value);\n};\n\n\n#ifdef HAVE_BOOST\n\nvoid OptionSetter<curlpp::types::BoostSslCtxFunction, CURLOPT_SSL_CTX_FUNCTION>\n::setOpt(internal::CurlHandle * handle, ParamType value)\n{\n\thandle->option(CURLOPT_SSL_CTX_FUNCTION, Callbacks::SslCtxCallback);\n\thandle->option(CURLOPT_SSL_CTX_DATA, handle);\n\thandle->setSslCtxFunctor(value);\n};\n\n#endif\n\n\n}\/\/ namespace internal\n\n\n}\/\/ namespace curlpp\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2021.  All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include \"..\/..\/Foundation\/Execution\/Sleep.h\"\n\n#include \"Capturer.h\"\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Containers;\nusing namespace Stroika::Foundation::Memory;\n\nusing namespace Stroika::Frameworks;\nusing namespace Stroika::Frameworks::SystemPerformance;\n\n\/*\n ********************************************************************************\n ************************* SystemPerformance::Capturer **************************\n ********************************************************************************\n *\/\nCapturer::Capturer (const CaptureSet& cs)\n{\n    fCaptureSets_.rwget ()->Add (cs);\n    RunnerOnce_ ();\n    ManageRunner_ (true);\n}\n\nCollection<Capturer::NewMeasurementsCallbackType> Capturer::GetMeasurementsCallbacks () const\n{\n    return fCallbacks_;\n}\n\nvoid Capturer::SetMeasurementsCallbacks (const Collection<NewMeasurementsCallbackType>& callbacks)\n{\n    fCallbacks_ = callbacks;\n}\n\nvoid Capturer::AddMeasurementsCallback (const NewMeasurementsCallbackType& cb)\n{\n    fCallbacks_.rwget ()->Add (cb);\n}\n\nvoid Capturer::RemoveMeasurementsCallback (const NewMeasurementsCallbackType& cb)\n{\n    fCallbacks_.rwget ()->Remove (cb);\n}\n\nCollection<CaptureSet> Capturer::GetCaptureSets () const\n{\n    return fCaptureSets_;\n}\n\nvoid Capturer::SetCaptureSets (const Collection<CaptureSet>& captureSets)\n{\n    fCaptureSets_ = captureSets;\n    ManageRunner_ (not fCaptureSets_.cget ()->empty ());\n    Assert (fCaptureSets_.cget ()->size () <= 1); \/\/ only case we support so far\n}\n\nvoid Capturer::AddCaptureSet (const CaptureSet& cs)\n{\n    fCaptureSets_.rwget ()->Add (cs);\n    ManageRunner_ (true);\n    Assert (fCaptureSets_.cget ()->size () == 1); \/\/ only case we support so far\n}\n\nvoid Capturer::ManageRunner_ (bool on)\n{\n    bool threadPoolRunning = fThreadPool_.GetTasksCount () != 0;\n    if (on) {\n        if (not threadPoolRunning) {\n            fThreadPool_.AddTask ([this] () { Runner_ (); });\n            fThreadPool_.SetPoolSize (1);\n        }\n    }\n    else {\n        if (threadPoolRunning) {\n            fThreadPool_.AbortTasks ();\n            fThreadPool_.SetPoolSize (0);\n        }\n    }\n}\n\nvoid Capturer::Runner_ ()\n{\n    while (true) {\n        \/\/ wrong - period should be from leading edge of last run!!! - and we should probably have ... - probably one task in each threadpool...\n        Duration d = fCaptureSets_.load ().Select<Duration> ([] (auto i) { return i.GetRunPeriod (); }).MinValue (30s);\n        Execution::Sleep (d);\n        RunnerOnce_ ();\n    }\n}\n\nvoid Capturer::RunnerOnce_ ()\n{\n    \/\/ SUPER MEGA OVERSIMPLIFED.\n    \/\/ @todo - fix to submit each subtask as its own runnable so it can leverage threadpool\n    \/\/ @todo real job waiting for jsut right time before starting next run through capturesets\n    \/\/ @todo support more than one capture set.\n\n    MeasurementSet measurements;\n    for (CaptureSet cs : fCaptureSets_.load ()) {\n        \/\/ @todo fix!!!\n\n        for (Instrument i : cs.GetInstrumentSet ()) {\n            try {\n                auto m = i.Capture ();\n                measurements.fMeasurements += m.fMeasurements;\n                measurements.fMeasuredAt = m.fMeasuredAt;       \/\/ weak way to merge but hopefully good enuf for now...\n            }\n            catch (const Execution::Thread::AbortException&) {\n                Execution::ReThrow ();\n            }\n            catch (...) {\n                DbgTrace (\"Eating exception in Capturer runner\");\n            }\n        }\n    }\n    UpdateMeasurementSet_ (measurements);\n}\n\nvoid Capturer::UpdateMeasurementSet_ (const MeasurementSet& ms)\n{\n    fCurrentMeasurementSet_ = ms;\n    for (const auto& cb : fCallbacks_.load ()) {\n        cb (ms);\n    }\n}\n<commit_msg>cosmetic<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2021.  All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include \"..\/..\/Foundation\/Execution\/Sleep.h\"\n\n#include \"Capturer.h\"\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Containers;\nusing namespace Stroika::Foundation::Memory;\n\nusing namespace Stroika::Frameworks;\nusing namespace Stroika::Frameworks::SystemPerformance;\n\n\/*\n ********************************************************************************\n ************************* SystemPerformance::Capturer **************************\n ********************************************************************************\n *\/\nCapturer::Capturer (const CaptureSet& cs)\n{\n    fCaptureSets_.rwget ()->Add (cs);\n    RunnerOnce_ ();\n    ManageRunner_ (true);\n}\n\nCollection<Capturer::NewMeasurementsCallbackType> Capturer::GetMeasurementsCallbacks () const\n{\n    return fCallbacks_;\n}\n\nvoid Capturer::SetMeasurementsCallbacks (const Collection<NewMeasurementsCallbackType>& callbacks)\n{\n    fCallbacks_ = callbacks;\n}\n\nvoid Capturer::AddMeasurementsCallback (const NewMeasurementsCallbackType& cb)\n{\n    fCallbacks_.rwget ()->Add (cb);\n}\n\nvoid Capturer::RemoveMeasurementsCallback (const NewMeasurementsCallbackType& cb)\n{\n    fCallbacks_.rwget ()->Remove (cb);\n}\n\nCollection<CaptureSet> Capturer::GetCaptureSets () const\n{\n    return fCaptureSets_;\n}\n\nvoid Capturer::SetCaptureSets (const Collection<CaptureSet>& captureSets)\n{\n    fCaptureSets_ = captureSets;\n    ManageRunner_ (not fCaptureSets_.cget ()->empty ());\n    Assert (fCaptureSets_.cget ()->size () <= 1); \/\/ only case we support so far\n}\n\nvoid Capturer::AddCaptureSet (const CaptureSet& cs)\n{\n    fCaptureSets_.rwget ()->Add (cs);\n    ManageRunner_ (true);\n    Assert (fCaptureSets_.cget ()->size () == 1); \/\/ only case we support so far\n}\n\nvoid Capturer::ManageRunner_ (bool on)\n{\n    bool threadPoolRunning = fThreadPool_.GetTasksCount () != 0;\n    if (on) {\n        if (not threadPoolRunning) {\n            fThreadPool_.AddTask ([this] () { Runner_ (); });\n            fThreadPool_.SetPoolSize (1);\n        }\n    }\n    else {\n        if (threadPoolRunning) {\n            fThreadPool_.AbortTasks ();\n            fThreadPool_.SetPoolSize (0);\n        }\n    }\n}\n\nvoid Capturer::Runner_ ()\n{\n    while (true) {\n        \/\/ wrong - period should be from leading edge of last run!!! - and we should probably have ... - probably one task in each threadpool...\n        Duration d = fCaptureSets_.load ().Select<Duration> ([] (auto i) { return i.GetRunPeriod (); }).MinValue (30s);\n        Execution::Sleep (d);\n        RunnerOnce_ ();\n    }\n}\n\nvoid Capturer::RunnerOnce_ ()\n{\n    \/\/ SUPER MEGA OVERSIMPLIFED.\n    \/\/ @todo - fix to submit each subtask as its own runnable so it can leverage threadpool\n    \/\/ @todo real job waiting for jsut right time before starting next run through capturesets\n    \/\/ @todo support more than one capture set.\n\n    MeasurementSet measurements;\n    for (CaptureSet cs : fCaptureSets_.load ()) {\n        \/\/ @todo fix!!!\n\n        for (Instrument i : cs.GetInstrumentSet ()) {\n            try {\n                auto m = i.Capture ();\n                measurements.fMeasurements += m.fMeasurements;\n                measurements.fMeasuredAt = m.fMeasuredAt; \/\/ weak way to merge but hopefully good enuf for now...\n            }\n            catch (const Execution::Thread::AbortException&) {\n                Execution::ReThrow ();\n            }\n            catch (...) {\n                DbgTrace (\"Eating exception in Capturer runner\");\n            }\n        }\n    }\n    UpdateMeasurementSet_ (measurements);\n}\n\nvoid Capturer::UpdateMeasurementSet_ (const MeasurementSet& ms)\n{\n    fCurrentMeasurementSet_ = ms;\n    for (const auto& cb : fCallbacks_.load ()) {\n        cb (ms);\n    }\n}\n<|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 \"CommandQueueAction.h\"\r\n\r\n#include \"..\/..\/objects\/creature\/skills\/Skill.h\"\r\n\r\n#include \"..\/..\/objects\/player\/Player.h\"\r\n\r\n#include \"..\/..\/objects\/creature\/CreatureObject.h\"\r\n#include \"..\/..\/objects\/tangible\/weapons\/Weapon.h\"\r\n#include \"..\/..\/objects\/attackable\/AttackableObject.h\"\r\n\r\nCommandQueueAction::CommandQueueAction(CreatureObject* cr, uint64 targid, uint32 acrc, uint32 acntr, const String& amod) {\r\n\tactionCRC = acrc;\r\n\tactionCounter = acntr;\r\n\r\n\ttargetID = targid;\r\n\r\n\tactionModifier = amod;\r\n\r\n\tcreature = cr;\r\n\tif (creature->isPlayer())\r\n\t\tplayer = (Player*)cr;\r\n\telse\r\n\t\tplayer = NULL;\r\n\r\n\ttarget = NULL;\r\n\tskill = NULL;\r\n\tweapon = NULL;\r\n}\r\n\r\nbool CommandQueueAction::check() {\r\n\tif (creature->isIncapacitated() || creature->isDead()) {\r\n\t\tclearError(1, 19);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (creature->isMounted()) {\r\n\t\tclearError(1, 16);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (skill->isTargetSkill()) {\r\n\t\tif (creature->isKnockedDown()) {\r\n\t\t\tclearError(1, 18);\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\ttarget = player->getTarget();\r\n\r\n\t\tif (target == NULL)\r\n\t\t\ttarget = creature;\r\n\r\n\t\tif (!(target->isNonPlayerCreature() || target->isPlayer() || target->isAttackableObject())) {\r\n\t\t\tclearError(3);\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\treturn true;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool CommandQueueAction::validate() {\r\n\tif (creature->hasAttackDelay()) {\r\n\t\tclearError(0);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (creature->isIncapacitated() || creature->isDead()) {\r\n\t\tclearError(1, 19);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (creature->isMounted()) {\r\n\t\tclearError(1, 16);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (creature->isKnockedDown()) {\r\n\t\tclearError(1, 18);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (skill->isTargetSkill()) {\r\n\t\tif (target != creature) {\r\n\t\t\tif (skill->isAttackSkill()) {\r\n\r\n\t\t\t\tif (!checkWeapon())\r\n\t\t\t\t\treturn false;\r\n\r\n\t\t\t\ttry {\r\n\t\t\t\t\ttarget->wlock(creature);\r\n\r\n\t\t\t\t\tWeapon* weapon = creature->getWeapon();\r\n\r\n\t\t\t\t\tint range;\r\n\r\n\t\t\t\t\tif (skill->getRange() != 0)\r\n\t\t\t\t\t\trange = (int)skill->getRange();\r\n\t\t\t\t\telse if (weapon != NULL)\r\n\t\t\t\t\t\trange = weapon->getMaxRange();\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\trange = 5;\r\n\r\n\t\t\t\t\tif (!creature->isInRange(target->getPositionX(), target->getPositionY(), range)) {\r\n\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\tclearError(4);\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tSceneObject* sco = target;\n\n\t\t\t\t\tif (sco->isPlayer()) {\n\t\t\t\t\t\tPlayer* targetPlayer = (Player*) sco;\n\n\t\t\t\t\t\tif (targetPlayer->isInBuilding() && target->getParent() != creature->getParent()) {\n\t\t\t\t\t\t\t\tclearError(0);\n\t\t\t\t\t\t\t\tcreature->sendSystemMessage(\"cbt_spam\", \"los_recycle\"); \/\/ You cannot see your target\n\n\t\t\t\t\t\t\t\ttarget->unlock();\n\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (target->getParent() != creature->getParent()) {\n\t\t\t\t\t\t\tclearError(0);\n\t\t\t\t\t\t\tcreature->sendSystemMessage(\"cbt_spam\", \"los_recycle\"); \/\/ You cannot see your target\n\n\t\t\t\t\t\t\ttarget->unlock();\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif (!target->isAttackableObject()) {\r\n\t\t\t\t\t\tCreatureObject* targetCreature = (CreatureObject*) target.get();\r\n\r\n\t\t\t\t\t\tif (targetCreature->isIncapacitated() || targetCreature->isDead()) {\r\n\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tAttackableObject* targetObject = (AttackableObject*) target.get();\r\n\r\n\t\t\t\t\t\tif (targetObject->isDestroyed()) {\r\n\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif (target->isPlayer()) {\r\n\t\t\t\t\t\tPlayer* targetPlayer = (Player*) target.get();\r\n\r\n\t\t\t\t\t\t\/\/ TODO:  Needs fixing for BH missions\r\n\t\t\t\t\t\tif (!player->isInDuelWith(targetPlayer, false)) {\r\n\t\t\t\t\t\t\tif (!player->isOvert() || !targetPlayer->isOvert()) {\r\n\t\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t\t} else if (player->getFaction() == targetPlayer->getFaction()) {\r\n\t\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tif (!target->isAttackableBy(creature)) {\r\n\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t} catch (...) {\r\n\t\t\t\t\tSystem::out << \"Unreported Exception in CommandQueueAction::validate()\\n\";\r\n\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t}\r\n\t\t\t} else if (skill->isHealSkill()) {\r\n\t\t\t\treturn checkHealSkill();\r\n\t\t\t}\r\n\t\t} else { \/\/ target == creature\r\n\t\t\tif (skill->isAttackSkill()) {\r\n\t\t\t\tclearError(3);\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool CommandQueueAction::checkHealSkill() {\r\n\r\n\tif (target->isAttackableObject()) {\r\n\t\tclearError(3);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tCreatureObject* targetObject = (CreatureObject*) target.get();\r\n\tif (targetObject != creature) {\r\n\t\ttry {\r\n\t\t\ttargetObject->wlock(creature);\r\n\r\n\t\t\tif (target->isPlayer()) {\r\n\t\t\t\tPlayer* targetPlayer = (Player*) target.get();\r\n\r\n\t\t\t\tif (player->isInDuelWith(targetPlayer, false))\r\n\t\t\t\t\ttarget = creature;\r\n\t\t\t\telse if (player->isOvert() && targetPlayer->isOvert()\r\n\t\t\t\t\t\t&& player->getFaction() != targetPlayer->getFaction())\r\n\t\t\t\t\ttarget = creature;\r\n\t\t\t\telse if (!player->isOvert() && targetPlayer->isOvert())\r\n\t\t\t\t\ttarget = creature;\r\n\t\t\t} else if (target->isNonPlayerCreature() && !skill->isDiagnoseSkill() && !skill->isDragSkill())\r\n\t\t\t\ttarget = creature;\r\n\r\n\t\t\tif (!creature->isInRange(target->getPositionX(), target->getPositionY(), skill->getRange())) {\r\n\t\t\t\ttargetObject->unlock();\r\n\t\t\t\tclearError(4);\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tif (targetObject->isDead() && !skill->isReviveSkill() && !skill->isDragSkill()) {\r\n\t\t\t\tclearError(3);\r\n\t\t\t\ttargetObject->unlock();\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\ttargetObject->unlock();\r\n\t\t} catch (...) {\r\n\t\t\ttargetObject->unlock();\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool CommandQueueAction::checkWeapon() {\r\n\tint requiredWeapon = skill->getRequiredWeaponType();\r\n\r\n\tif (requiredWeapon != 0xFF) {\r\n\t\tweapon = creature->getWeapon();\r\n\r\n\t\tif (weapon != NULL) {\r\n\t\t\tif (requiredWeapon == 0x10 || requiredWeapon == 0x20 ||\r\n\t\t\t\t\trequiredWeapon == 0x30) {\r\n\t\t\t\tif (weapon->getCategory() != requiredWeapon) {\r\n\t\t\t\t\tclearError(0);\r\n\t\t\t\t\tif (player != NULL)\r\n\t\t\t\t\t\tplayer->sendSystemMessage(\"cbt_spam\", \"no_attack_wrong_weapon\"); \/\/ Can't be done with this weapon\r\n\t\t\t\t\treturn false;\r\n\t\t\t\t}\r\n\t\t\t} else if (weapon->getType() != requiredWeapon) {\r\n\t\t\t\tclearError(0);\r\n\t\t\t\tif (player != NULL)\r\n\t\t\t\t\tplayer->sendSystemMessage(\"cbt_spam\", \"no_attack_wrong_weapon\"); \/\/ Can't be done with this weapon\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t} else if (requiredWeapon != 0) {\r\n\t\t\tclearError(0);\r\n\t\t\tif (player != NULL)\r\n\t\t\t\tplayer->sendSystemMessage(\"cbt_spam\", \"no_attack_wrong_weapon\"); \/\/ Can't be done with this weapon\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\tif (creature->isKneeling()) {\r\n\t\tif (requiredWeapon < 4 || requiredWeapon == 0x10) {\r\n\t\t\tclearError(1,4);\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\tif (creature->isProne()) {\r\n\t\tif (requiredWeapon < 4 || requiredWeapon > 6 || requiredWeapon == 0x10 || requiredWeapon == 0x30) {\r\n\t\t\tclearError(1,7);\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nvoid CommandQueueAction::clear(float timer, uint32 tab1, uint32 tab2) {\r\n\tif (player != NULL)\r\n\t\tplayer->clearQueueAction(actionCounter, timer, tab1, tab2);\r\n}\r\n<commit_msg>[Fixed] Players with healing abilities will now Heal themselves instead of receiving an \"Invalid Target\" msg when a Dead NPC, Ticket Collector etc is targeted. *Does not apply to Heal Mind*<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 \"CommandQueueAction.h\"\r\n\r\n#include \"..\/..\/objects\/creature\/skills\/Skill.h\"\r\n\r\n#include \"..\/..\/objects\/player\/Player.h\"\r\n\r\n#include \"..\/..\/objects\/creature\/CreatureObject.h\"\r\n#include \"..\/..\/objects\/tangible\/weapons\/Weapon.h\"\r\n#include \"..\/..\/objects\/attackable\/AttackableObject.h\"\r\n\r\nCommandQueueAction::CommandQueueAction(CreatureObject* cr, uint64 targid, uint32 acrc, uint32 acntr, const String& amod) {\r\n\tactionCRC = acrc;\r\n\tactionCounter = acntr;\r\n\r\n\ttargetID = targid;\r\n\r\n\tactionModifier = amod;\r\n\r\n\tcreature = cr;\r\n\tif (creature->isPlayer())\r\n\t\tplayer = (Player*)cr;\r\n\telse\r\n\t\tplayer = NULL;\r\n\r\n\ttarget = NULL;\r\n\tskill = NULL;\r\n\tweapon = NULL;\r\n}\r\n\r\nbool CommandQueueAction::check() {\r\n\tif (creature->isIncapacitated() || creature->isDead()) {\r\n\t\tclearError(1, 19);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (creature->isMounted()) {\r\n\t\tclearError(1, 16);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (skill->isTargetSkill()) {\r\n\t\tif (creature->isKnockedDown()) {\r\n\t\t\tclearError(1, 18);\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\ttarget = player->getTarget();\r\n\r\n\t\tif (target == NULL)\r\n\t\t\ttarget = creature;\r\n\r\n\t\tif (!(target->isNonPlayerCreature() || target->isPlayer() || target->isAttackableObject())) \r\n\t\t\ttarget = creature;\r\n\t\t\r\n\t\tif (target->isNonPlayerCreature() && !target->isAttackableObject() && skill->isHealSkill())\r\n\t\t\ttarget = creature;\r\n\r\n\t\treturn true;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool CommandQueueAction::validate() {\r\n\tif (creature->hasAttackDelay()) {\r\n\t\tclearError(0);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (creature->isIncapacitated() || creature->isDead()) {\r\n\t\tclearError(1, 19);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (creature->isMounted()) {\r\n\t\tclearError(1, 16);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (creature->isKnockedDown()) {\r\n\t\tclearError(1, 18);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (skill->isTargetSkill()) {\r\n\t\tif (target != creature) {\r\n\t\t\tif (skill->isAttackSkill()) {\r\n\r\n\t\t\t\tif (!checkWeapon())\r\n\t\t\t\t\treturn false;\r\n\r\n\t\t\t\ttry {\r\n\t\t\t\t\ttarget->wlock(creature);\r\n\r\n\t\t\t\t\tWeapon* weapon = creature->getWeapon();\r\n\r\n\t\t\t\t\tint range;\r\n\r\n\t\t\t\t\tif (skill->getRange() != 0)\r\n\t\t\t\t\t\trange = (int)skill->getRange();\r\n\t\t\t\t\telse if (weapon != NULL)\r\n\t\t\t\t\t\trange = weapon->getMaxRange();\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\trange = 5;\r\n\r\n\t\t\t\t\tif (!creature->isInRange(target->getPositionX(), target->getPositionY(), range)) {\r\n\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\tclearError(4);\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tSceneObject* sco = target;\n\n\t\t\t\t\tif (sco->isPlayer()) {\n\t\t\t\t\t\tPlayer* targetPlayer = (Player*) sco;\n\n\t\t\t\t\t\tif (targetPlayer->isInBuilding() && target->getParent() != creature->getParent()) {\n\t\t\t\t\t\t\t\tclearError(0);\n\t\t\t\t\t\t\t\tcreature->sendSystemMessage(\"cbt_spam\", \"los_recycle\"); \/\/ You cannot see your target\n\n\t\t\t\t\t\t\t\ttarget->unlock();\n\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (target->getParent() != creature->getParent()) {\n\t\t\t\t\t\t\tclearError(0);\n\t\t\t\t\t\t\tcreature->sendSystemMessage(\"cbt_spam\", \"los_recycle\"); \/\/ You cannot see your target\n\n\t\t\t\t\t\t\ttarget->unlock();\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif (!target->isAttackableObject()) {\r\n\t\t\t\t\t\tCreatureObject* targetCreature = (CreatureObject*) target.get();\r\n\r\n\t\t\t\t\t\tif (targetCreature->isIncapacitated() || targetCreature->isDead()) {\r\n\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tAttackableObject* targetObject = (AttackableObject*) target.get();\r\n\r\n\t\t\t\t\t\tif (targetObject->isDestroyed()) {\r\n\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif (target->isPlayer()) {\r\n\t\t\t\t\t\tPlayer* targetPlayer = (Player*) target.get();\r\n\r\n\t\t\t\t\t\t\/\/ TODO:  Needs fixing for BH missions\r\n\t\t\t\t\t\tif (!player->isInDuelWith(targetPlayer, false)) {\r\n\t\t\t\t\t\t\tif (!player->isOvert() || !targetPlayer->isOvert()) {\r\n\t\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t\t} else if (player->getFaction() == targetPlayer->getFaction()) {\r\n\t\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tif (!target->isAttackableBy(creature)) {\r\n\t\t\t\t\t\t\tclearError(3);\r\n\t\t\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t} catch (...) {\r\n\t\t\t\t\tSystem::out << \"Unreported Exception in CommandQueueAction::validate()\\n\";\r\n\t\t\t\t\ttarget->unlock();\r\n\t\t\t\t}\r\n\t\t\t} else if (skill->isHealSkill()) {\r\n\t\t\t\treturn checkHealSkill();\r\n\t\t\t}\r\n\t\t} else { \/\/ target == creature\r\n\t\t\tif (skill->isAttackSkill()) {\r\n\t\t\t\tclearError(3);\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool CommandQueueAction::checkHealSkill() {\r\n\r\n\tif (target->isAttackableObject()) {\r\n\t\tclearError(3);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tCreatureObject* targetObject = (CreatureObject*) target.get();\r\n\tif (targetObject != creature) {\r\n\t\ttry {\r\n\t\t\ttargetObject->wlock(creature);\r\n\r\n\t\t\tif (target->isPlayer()) {\r\n\t\t\t\tPlayer* targetPlayer = (Player*) target.get();\r\n\r\n\t\t\t\tif (player->isInDuelWith(targetPlayer, false))\r\n\t\t\t\t\ttarget = creature;\r\n\t\t\t\telse if (player->isOvert() && targetPlayer->isOvert()\r\n\t\t\t\t\t\t&& player->getFaction() != targetPlayer->getFaction())\r\n\t\t\t\t\ttarget = creature;\r\n\t\t\t\telse if (!player->isOvert() && targetPlayer->isOvert())\r\n\t\t\t\t\ttarget = creature;\r\n\t\t\t} else if (target->isNonPlayerCreature() && !skill->isDiagnoseSkill() && !skill->isDragSkill())\r\n\t\t\t\ttarget = creature;\r\n\r\n\t\t\tif (!creature->isInRange(target->getPositionX(), target->getPositionY(), skill->getRange())) {\r\n\t\t\t\ttargetObject->unlock();\r\n\t\t\t\tclearError(4);\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tif (targetObject->isDead() && !skill->isReviveSkill() && !skill->isDragSkill()) {\r\n\t\t\t\tclearError(3);\r\n\t\t\t\ttargetObject->unlock();\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\ttargetObject->unlock();\r\n\t\t} catch (...) {\r\n\t\t\ttargetObject->unlock();\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool CommandQueueAction::checkWeapon() {\r\n\tint requiredWeapon = skill->getRequiredWeaponType();\r\n\r\n\tif (requiredWeapon != 0xFF) {\r\n\t\tweapon = creature->getWeapon();\r\n\r\n\t\tif (weapon != NULL) {\r\n\t\t\tif (requiredWeapon == 0x10 || requiredWeapon == 0x20 ||\r\n\t\t\t\t\trequiredWeapon == 0x30) {\r\n\t\t\t\tif (weapon->getCategory() != requiredWeapon) {\r\n\t\t\t\t\tclearError(0);\r\n\t\t\t\t\tif (player != NULL)\r\n\t\t\t\t\t\tplayer->sendSystemMessage(\"cbt_spam\", \"no_attack_wrong_weapon\"); \/\/ Can't be done with this weapon\r\n\t\t\t\t\treturn false;\r\n\t\t\t\t}\r\n\t\t\t} else if (weapon->getType() != requiredWeapon) {\r\n\t\t\t\tclearError(0);\r\n\t\t\t\tif (player != NULL)\r\n\t\t\t\t\tplayer->sendSystemMessage(\"cbt_spam\", \"no_attack_wrong_weapon\"); \/\/ Can't be done with this weapon\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t} else if (requiredWeapon != 0) {\r\n\t\t\tclearError(0);\r\n\t\t\tif (player != NULL)\r\n\t\t\t\tplayer->sendSystemMessage(\"cbt_spam\", \"no_attack_wrong_weapon\"); \/\/ Can't be done with this weapon\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\tif (creature->isKneeling()) {\r\n\t\tif (requiredWeapon < 4 || requiredWeapon == 0x10) {\r\n\t\t\tclearError(1,4);\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\tif (creature->isProne()) {\r\n\t\tif (requiredWeapon < 4 || requiredWeapon > 6 || requiredWeapon == 0x10 || requiredWeapon == 0x30) {\r\n\t\t\tclearError(1,7);\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nvoid CommandQueueAction::clear(float timer, uint32 tab1, uint32 tab2) {\r\n\tif (player != NULL)\r\n\t\tplayer->clearQueueAction(actionCounter, timer, tab1, tab2);\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************************************************\n * Copyright (C) 2017, Copyright Holders of the ALICE Collaboration                 *\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 <organization> 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 ALICE COLLABORATION 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#include <algorithm>\n#include <array>\n#include <string>\n#include <sstream>\n#include <vector>\n#include <THistManager.h>\n#include <TCustomBinning.h>\n#include <TLinearBinning.h>\n\n#include \"AliAODInputHandler.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisTaskEmcalJetEnergyScale.h\"\n#include \"AliEmcalTriggerDecisionContainer.h\"\n#include \"AliEmcalAnalysisFactory.h\"\n#include \"AliLog.h\"\n#include \"AliVEventHandler.h\"\n\nClassImp(EmcalTriggerJets::AliAnalysisTaskEmcalJetEnergyScale)\n\nusing namespace EmcalTriggerJets;\n\nAliAnalysisTaskEmcalJetEnergyScale::AliAnalysisTaskEmcalJetEnergyScale():\n  AliAnalysisTaskEmcalJet(),\n  fHistos(nullptr),\n  fNameDetectorJets(),\n  fNameParticleJets(),\n  fTriggerSelectionString(),\n  fNameTriggerDecisionContainer(\"EmcalTriggerDecision\")\n{\n}\n\nAliAnalysisTaskEmcalJetEnergyScale::AliAnalysisTaskEmcalJetEnergyScale(const char *name):\n  AliAnalysisTaskEmcalJet(name, true),\n  fHistos(nullptr),\n  fNameDetectorJets(),\n  fNameParticleJets(),\n  fTriggerSelectionString(),\n  fNameTriggerDecisionContainer(\"EmcalTriggerDecision\")\n{\n  SetUseAliAnaUtils(true);\n  DefineOutput(1, TList::Class());\n}\n\nAliAnalysisTaskEmcalJetEnergyScale::~AliAnalysisTaskEmcalJetEnergyScale() {\n  if(fHistos) delete fHistos;\n}\n\nvoid AliAnalysisTaskEmcalJetEnergyScale::UserCreateOutputObjects(){\n  AliAnalysisTaskEmcal::UserCreateOutputObjects();\n\n  TLinearBinning jetPtBinning(300, 0., 300.), nefbinning(100, 0., 1.), ptdiffbinning(200, -1., 1.), jetEtaBinning(100, -0.9, 0.9), jetPhiBinning(100, 0., TMath::TwoPi());\n\n  const TBinning *diffbinning[3] = {&jetPtBinning, &nefbinning, &ptdiffbinning},\n                 *corrbinning[3] = {&jetPtBinning, &jetPtBinning, &nefbinning},\n                 *effbinning[3] = {&jetPtBinning, &jetEtaBinning, &jetPhiBinning};\n\n  fHistos = new THistManager(\"energyScaleHistos\");\n  fHistos->CreateTH1(\"hEventCounter\", \"Event counter\", 1, 0.5, 1.5);\n  fHistos->CreateTHnSparse(\"hPtDiff\", \"pt diff det\/part\", 3., diffbinning, \"s\");\n  fHistos->CreateTHnSparse(\"hPtCorr\", \"Correlation det pt \/ part pt\", 3., corrbinning, \"s\");\n  fHistos->CreateTHnSparse(\"hPartJetsAccepted\", \"Accepted particle level jets\", 3, effbinning, \"s\");\n  fHistos->CreateTHnSparse(\"hPartJetsReconstructed\", \"Accepted and reconstructed particle level jets\", 3, effbinning, \"s\");\n  for(auto h : *(fHistos->GetListOfHistograms())) fOutput->Add(h);\n\n  PostData(1, fOutput);\n}\n\nBool_t AliAnalysisTaskEmcalJetEnergyScale::Run(){\n  AliDebugStream(1) << \"Next event\" << std::endl;\n  if(!(fInputHandler->IsEventSelected() & AliVEvent::kINT7)) return false;\n  if(IsSelectEmcalTriggers(fTriggerSelectionString.Data())){\n    auto mctrigger = static_cast<PWG::EMCAL::AliEmcalTriggerDecisionContainer *>(fInputEvent->FindListObject(fNameTriggerDecisionContainer));\n    AliDebugStream(1) << \"Found trigger decision object: \" << (mctrigger ? \"yes\" : \"no\") << std::endl;\n    if(!mctrigger){\n      AliErrorStream() <<  \"Trigger decision container with name \" << fNameTriggerDecisionContainer << \" not found in event - not possible to select EMCAL triggers\" << std::endl;\n      return false;\n    }\n    if(!mctrigger->IsEventSelected(fTriggerSelectionString)) return false;\n  }\n  AliDebugStream(1) << \"event selected\" << std::endl;\n  fHistos->FillTH1(\"hEventCounter\", 1);\n\n  auto detjets = GetJetContainer(fNameDetectorJets),\n       partjets = GetJetContainer(fNameParticleJets);\n  if(!detjets || !partjets) {\n    AliErrorStream() << \"At least one jet container missing, exiting ...\" << std::endl;\n    return false;\n  }\n  AliDebugStream(1) << \"Have both jet containers: part(\" << partjets->GetNAcceptedJets() << \"|\" << partjets->GetNJets() << \"), det(\" << detjets->GetNAcceptedJets() << \"|\" << detjets->GetNJets() << \")\" << std::endl;\n\n  std::vector<AliEmcalJet *> taggedjets;\n  for(auto detjet : detjets->accepted()){\n    AliDebugStream(2) << \"Next jet\" << std::endl;\n    auto partjet = detjet->ClosestJet();\n    if(!partjet) {\n      AliDebugStream(2) << \"No tagged jet\" << std::endl;\n      continue;\n    }\n    taggedjets.emplace_back(partjet);\n    double pointCorr[3] = {partjet->Pt(), detjet->Pt(), detjet->NEF()},\n           pointDiff[3] = {partjet->Pt(), detjet->NEF(), (detjet->Pt()-partjet->Pt())\/partjet->Pt()};\n    fHistos->FillTHnSparse(\"hPtDiff\", pointDiff);\n    fHistos->FillTHnSparse(\"hPtCorr\", pointCorr);\n  }\n\n  \/\/ efficiency x acceptance: Add histos for all accepted and reconstucted accepted jets\n  for(auto partjet : partjets->accepted()){\n    double pvect[3] = {partjet->Pt(), partjet->Eta(), partjet->Phi()};\n    if(pvect[2] < 0) pvect[2] += TMath::TwoPi();\n    fHistos->FillTHnSparse(\"hPartJetsAccepted\", pvect);\n    if(std::find(taggedjets.begin(), taggedjets.end(), partjet) != taggedjets.end()) fHistos->FillTHnSparse(\"hPartJetsReconstructed\", pvect);\n  }\n  return true;\n}\n\nbool AliAnalysisTaskEmcalJetEnergyScale::IsSelectEmcalTriggers(const TString &triggerstring) const {\n  const std::array<TString, 8> kEMCALTriggers = {\n    \"EJ1\", \"EJ2\", \"DJ1\", \"DJ2\", \"EG1\", \"EG2\", \"DG1\", \"DG2\"\n  };\n  bool isEMCAL = false;\n  for(auto emcaltrg : kEMCALTriggers) {\n    if(triggerstring.Contains(emcaltrg)) {\n      isEMCAL = true;\n      break;\n    }\n  }\n  return isEMCAL;\n}\n\nAliAnalysisTaskEmcalJetEnergyScale *AliAnalysisTaskEmcalJetEnergyScale::AddTaskJetEnergyScale(AliJetContainer::EJetType_t jettype, Double_t jetradius, Bool_t useDCAL, const char *trigger) {\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if(!mgr){\n    ::Error(\"EmcalTriggerJets::AliAnalysisTaskEmcalJetEnergyScale::AddTaskJetEnergyScale\", \"No analysis manager available\");\n    return nullptr;\n  } \n\n  auto inputhandler = mgr->GetInputEventHandler();\n  auto isAOD = inputhandler->IsA() == AliAODInputHandler::Class();\n\n  std::string jettypename;\n  AliJetContainer::JetAcceptanceType acceptance(AliJetContainer::kTPCfid);\n  bool addClusterContainer(false), addTrackContainer(false);\n  switch(jettype){\n    case AliJetContainer::kFullJet:\n        jettypename = \"FullJet\";\n        acceptance = useDCAL ? AliJetContainer::kDCALfid : AliJetContainer::kEMCALfid;\n        addClusterContainer = addTrackContainer = true;\n        break;\n    case AliJetContainer::kChargedJet:\n        jettypename = \"ChargedJet\";\n        acceptance = AliJetContainer::kTPCfid;\n        addTrackContainer = true;\n        break;\n    case AliJetContainer::kNeutralJet:\n        jettypename = \"NeutralJet\";\n        acceptance = useDCAL ? AliJetContainer::kDCALfid : AliJetContainer::kEMCALfid;\n        addClusterContainer = true;\n        break;\n  };\n\n  std::stringstream taskname, tag;\n  tag << jettypename << \"_R\" << std::setw(2) << std::setfill('0') << int(jetradius * 10.) << \"_\" << trigger;\n  taskname << \"EnergyScaleTask_\" << tag.str();\n  AliAnalysisTaskEmcalJetEnergyScale *energyscaletask = new AliAnalysisTaskEmcalJetEnergyScale(taskname.str().data());\n  mgr->AddTask(energyscaletask);\n  energyscaletask->SetTriggerName(trigger);\n\n  auto partcont = energyscaletask->AddMCParticleContainer(\"mcparticles\");\n  partcont->SetMinPt(0.);\n\n  AliClusterContainer *clusters(nullptr);\n  if(addClusterContainer) {\n    clusters = energyscaletask->AddClusterContainer(EMCalTriggerPtAnalysis::AliEmcalAnalysisFactory::ClusterContainerNameFactory(isAOD));\n    switch(jettype){\n      case AliJetContainer::kChargedJet: break;     \/\/ Silence compiler\n      case AliJetContainer::kFullJet:\n        clusters->SetDefaultClusterEnergy(AliVCluster::kHadCorr);\n        clusters->SetClusHadCorrEnergyCut(0.3);\n        break;\n      case AliJetContainer::kNeutralJet:\n        clusters->SetDefaultClusterEnergy(AliVCluster::kNonLinCorr);\n        clusters->SetClusNonLinCorrEnergyCut(0.3);\n        break;\n    };\n  }\n  AliTrackContainer *tracks(nullptr);\n  if(addTrackContainer) {\n    tracks = energyscaletask->AddTrackContainer(EMCalTriggerPtAnalysis::AliEmcalAnalysisFactory::TrackContainerNameFactory(isAOD));\n  }\n\n  auto contpartjet = energyscaletask->AddJetContainer(jettype, AliJetContainer::antikt_algorithm, AliJetContainer::E_scheme, jetradius,\n                                                      AliJetContainer::kTPCfid, partcont, nullptr);\n  contpartjet->SetName(\"particleLevelJets\");\n  energyscaletask->SetNamePartJetContainer(\"particleLevelJets\");\n  std::cout << \"Adding particle-level jet container with underling array: \" << contpartjet->GetArrayName() << std::endl;\n\n  auto contdetjet = energyscaletask->AddJetContainer(jettype, AliJetContainer::antikt_algorithm, AliJetContainer::E_scheme, jetradius,\n                                                     acceptance, tracks, clusters);\n  contdetjet->SetName(\"detectorLevelJets\");\n  energyscaletask->SetNameDetJetContainer(\"detectorLevelJets\");\n  std::cout << \"Adding detector-level jet container with underling array: \" << contdetjet->GetArrayName() << std::endl;\n\n  std::stringstream outnamebuilder, listnamebuilder;\n  listnamebuilder << \"EnergyScaleHists_\" << tag.str();\n  outnamebuilder << mgr->GetCommonFileName() << \":EnergyScaleResults_\" << tag.str();\n\n  mgr->ConnectInput(energyscaletask, 0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput(energyscaletask, 1, mgr->CreateContainer(listnamebuilder.str().data(), TList::Class(), AliAnalysisManager::kOutputContainer, outnamebuilder.str().data()));\n  return energyscaletask;\n} <commit_msg>Increase jet pt range at particle level<commit_after>\/************************************************************************************\n * Copyright (C) 2017, Copyright Holders of the ALICE Collaboration                 *\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 <organization> 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 ALICE COLLABORATION 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#include <algorithm>\n#include <array>\n#include <string>\n#include <sstream>\n#include <vector>\n#include <THistManager.h>\n#include <TCustomBinning.h>\n#include <TLinearBinning.h>\n\n#include \"AliAODInputHandler.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisTaskEmcalJetEnergyScale.h\"\n#include \"AliEmcalTriggerDecisionContainer.h\"\n#include \"AliEmcalAnalysisFactory.h\"\n#include \"AliLog.h\"\n#include \"AliVEventHandler.h\"\n\nClassImp(EmcalTriggerJets::AliAnalysisTaskEmcalJetEnergyScale)\n\nusing namespace EmcalTriggerJets;\n\nAliAnalysisTaskEmcalJetEnergyScale::AliAnalysisTaskEmcalJetEnergyScale():\n  AliAnalysisTaskEmcalJet(),\n  fHistos(nullptr),\n  fNameDetectorJets(),\n  fNameParticleJets(),\n  fTriggerSelectionString(),\n  fNameTriggerDecisionContainer(\"EmcalTriggerDecision\")\n{\n}\n\nAliAnalysisTaskEmcalJetEnergyScale::AliAnalysisTaskEmcalJetEnergyScale(const char *name):\n  AliAnalysisTaskEmcalJet(name, true),\n  fHistos(nullptr),\n  fNameDetectorJets(),\n  fNameParticleJets(),\n  fTriggerSelectionString(),\n  fNameTriggerDecisionContainer(\"EmcalTriggerDecision\")\n{\n  SetUseAliAnaUtils(true);\n  DefineOutput(1, TList::Class());\n}\n\nAliAnalysisTaskEmcalJetEnergyScale::~AliAnalysisTaskEmcalJetEnergyScale() {\n  if(fHistos) delete fHistos;\n}\n\nvoid AliAnalysisTaskEmcalJetEnergyScale::UserCreateOutputObjects(){\n  AliAnalysisTaskEmcal::UserCreateOutputObjects();\n\n  TLinearBinning jetPtBinningDet(300, 0., 300.), jetPtBinningPart(500, 0., 500), nefbinning(100, 0., 1.), ptdiffbinning(200, -1., 1.), jetEtaBinning(100, -0.9, 0.9), jetPhiBinning(100, 0., TMath::TwoPi());\n\n  const TBinning *diffbinning[3] = {&jetPtBinningPart, &nefbinning, &ptdiffbinning},\n                 *corrbinning[3] = {&jetPtBinningPart, &jetPtBinningDet, &nefbinning},\n                 *effbinning[3] = {&jetPtBinningPart, &jetEtaBinning, &jetPhiBinning};\n\n  fHistos = new THistManager(\"energyScaleHistos\");\n  fHistos->CreateTH1(\"hEventCounter\", \"Event counter\", 1, 0.5, 1.5);\n  fHistos->CreateTHnSparse(\"hPtDiff\", \"pt diff det\/part\", 3., diffbinning, \"s\");\n  fHistos->CreateTHnSparse(\"hPtCorr\", \"Correlation det pt \/ part pt\", 3., corrbinning, \"s\");\n  fHistos->CreateTHnSparse(\"hPartJetsAccepted\", \"Accepted particle level jets\", 3, effbinning, \"s\");\n  fHistos->CreateTHnSparse(\"hPartJetsReconstructed\", \"Accepted and reconstructed particle level jets\", 3, effbinning, \"s\");\n  for(auto h : *(fHistos->GetListOfHistograms())) fOutput->Add(h);\n\n  PostData(1, fOutput);\n}\n\nBool_t AliAnalysisTaskEmcalJetEnergyScale::Run(){\n  AliDebugStream(1) << \"Next event\" << std::endl;\n  if(!(fInputHandler->IsEventSelected() & AliVEvent::kINT7)) return false;\n  if(IsSelectEmcalTriggers(fTriggerSelectionString.Data())){\n    auto mctrigger = static_cast<PWG::EMCAL::AliEmcalTriggerDecisionContainer *>(fInputEvent->FindListObject(fNameTriggerDecisionContainer));\n    AliDebugStream(1) << \"Found trigger decision object: \" << (mctrigger ? \"yes\" : \"no\") << std::endl;\n    if(!mctrigger){\n      AliErrorStream() <<  \"Trigger decision container with name \" << fNameTriggerDecisionContainer << \" not found in event - not possible to select EMCAL triggers\" << std::endl;\n      return false;\n    }\n    if(!mctrigger->IsEventSelected(fTriggerSelectionString)) return false;\n  }\n  AliDebugStream(1) << \"event selected\" << std::endl;\n  fHistos->FillTH1(\"hEventCounter\", 1);\n\n  auto detjets = GetJetContainer(fNameDetectorJets),\n       partjets = GetJetContainer(fNameParticleJets);\n  if(!detjets || !partjets) {\n    AliErrorStream() << \"At least one jet container missing, exiting ...\" << std::endl;\n    return false;\n  }\n  AliDebugStream(1) << \"Have both jet containers: part(\" << partjets->GetNAcceptedJets() << \"|\" << partjets->GetNJets() << \"), det(\" << detjets->GetNAcceptedJets() << \"|\" << detjets->GetNJets() << \")\" << std::endl;\n\n  std::vector<AliEmcalJet *> taggedjets;\n  for(auto detjet : detjets->accepted()){\n    AliDebugStream(2) << \"Next jet\" << std::endl;\n    auto partjet = detjet->ClosestJet();\n    if(!partjet) {\n      AliDebugStream(2) << \"No tagged jet\" << std::endl;\n      continue;\n    }\n    taggedjets.emplace_back(partjet);\n    double pointCorr[3] = {partjet->Pt(), detjet->Pt(), detjet->NEF()},\n           pointDiff[3] = {partjet->Pt(), detjet->NEF(), (detjet->Pt()-partjet->Pt())\/partjet->Pt()};\n    fHistos->FillTHnSparse(\"hPtDiff\", pointDiff);\n    fHistos->FillTHnSparse(\"hPtCorr\", pointCorr);\n  }\n\n  \/\/ efficiency x acceptance: Add histos for all accepted and reconstucted accepted jets\n  for(auto partjet : partjets->accepted()){\n    double pvect[3] = {partjet->Pt(), partjet->Eta(), partjet->Phi()};\n    if(pvect[2] < 0) pvect[2] += TMath::TwoPi();\n    fHistos->FillTHnSparse(\"hPartJetsAccepted\", pvect);\n    if(std::find(taggedjets.begin(), taggedjets.end(), partjet) != taggedjets.end()) fHistos->FillTHnSparse(\"hPartJetsReconstructed\", pvect);\n  }\n  return true;\n}\n\nbool AliAnalysisTaskEmcalJetEnergyScale::IsSelectEmcalTriggers(const TString &triggerstring) const {\n  const std::array<TString, 8> kEMCALTriggers = {\n    \"EJ1\", \"EJ2\", \"DJ1\", \"DJ2\", \"EG1\", \"EG2\", \"DG1\", \"DG2\"\n  };\n  bool isEMCAL = false;\n  for(auto emcaltrg : kEMCALTriggers) {\n    if(triggerstring.Contains(emcaltrg)) {\n      isEMCAL = true;\n      break;\n    }\n  }\n  return isEMCAL;\n}\n\nAliAnalysisTaskEmcalJetEnergyScale *AliAnalysisTaskEmcalJetEnergyScale::AddTaskJetEnergyScale(AliJetContainer::EJetType_t jettype, Double_t jetradius, Bool_t useDCAL, const char *trigger) {\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if(!mgr){\n    ::Error(\"EmcalTriggerJets::AliAnalysisTaskEmcalJetEnergyScale::AddTaskJetEnergyScale\", \"No analysis manager available\");\n    return nullptr;\n  } \n\n  auto inputhandler = mgr->GetInputEventHandler();\n  auto isAOD = inputhandler->IsA() == AliAODInputHandler::Class();\n\n  std::string jettypename;\n  AliJetContainer::JetAcceptanceType acceptance(AliJetContainer::kTPCfid);\n  bool addClusterContainer(false), addTrackContainer(false);\n  switch(jettype){\n    case AliJetContainer::kFullJet:\n        jettypename = \"FullJet\";\n        acceptance = useDCAL ? AliJetContainer::kDCALfid : AliJetContainer::kEMCALfid;\n        addClusterContainer = addTrackContainer = true;\n        break;\n    case AliJetContainer::kChargedJet:\n        jettypename = \"ChargedJet\";\n        acceptance = AliJetContainer::kTPCfid;\n        addTrackContainer = true;\n        break;\n    case AliJetContainer::kNeutralJet:\n        jettypename = \"NeutralJet\";\n        acceptance = useDCAL ? AliJetContainer::kDCALfid : AliJetContainer::kEMCALfid;\n        addClusterContainer = true;\n        break;\n  };\n\n  std::stringstream taskname, tag;\n  tag << jettypename << \"_R\" << std::setw(2) << std::setfill('0') << int(jetradius * 10.) << \"_\" << trigger;\n  taskname << \"EnergyScaleTask_\" << tag.str();\n  AliAnalysisTaskEmcalJetEnergyScale *energyscaletask = new AliAnalysisTaskEmcalJetEnergyScale(taskname.str().data());\n  mgr->AddTask(energyscaletask);\n  energyscaletask->SetTriggerName(trigger);\n\n  auto partcont = energyscaletask->AddMCParticleContainer(\"mcparticles\");\n  partcont->SetMinPt(0.);\n\n  AliClusterContainer *clusters(nullptr);\n  if(addClusterContainer) {\n    clusters = energyscaletask->AddClusterContainer(EMCalTriggerPtAnalysis::AliEmcalAnalysisFactory::ClusterContainerNameFactory(isAOD));\n    switch(jettype){\n      case AliJetContainer::kChargedJet: break;     \/\/ Silence compiler\n      case AliJetContainer::kFullJet:\n        clusters->SetDefaultClusterEnergy(AliVCluster::kHadCorr);\n        clusters->SetClusHadCorrEnergyCut(0.3);\n        break;\n      case AliJetContainer::kNeutralJet:\n        clusters->SetDefaultClusterEnergy(AliVCluster::kNonLinCorr);\n        clusters->SetClusNonLinCorrEnergyCut(0.3);\n        break;\n    };\n  }\n  AliTrackContainer *tracks(nullptr);\n  if(addTrackContainer) {\n    tracks = energyscaletask->AddTrackContainer(EMCalTriggerPtAnalysis::AliEmcalAnalysisFactory::TrackContainerNameFactory(isAOD));\n  }\n\n  auto contpartjet = energyscaletask->AddJetContainer(jettype, AliJetContainer::antikt_algorithm, AliJetContainer::E_scheme, jetradius,\n                                                      AliJetContainer::kTPCfid, partcont, nullptr);\n  contpartjet->SetName(\"particleLevelJets\");\n  energyscaletask->SetNamePartJetContainer(\"particleLevelJets\");\n  std::cout << \"Adding particle-level jet container with underling array: \" << contpartjet->GetArrayName() << std::endl;\n\n  auto contdetjet = energyscaletask->AddJetContainer(jettype, AliJetContainer::antikt_algorithm, AliJetContainer::E_scheme, jetradius,\n                                                     acceptance, tracks, clusters);\n  contdetjet->SetName(\"detectorLevelJets\");\n  energyscaletask->SetNameDetJetContainer(\"detectorLevelJets\");\n  std::cout << \"Adding detector-level jet container with underling array: \" << contdetjet->GetArrayName() << std::endl;\n\n  std::stringstream outnamebuilder, listnamebuilder;\n  listnamebuilder << \"EnergyScaleHists_\" << tag.str();\n  outnamebuilder << mgr->GetCommonFileName() << \":EnergyScaleResults_\" << tag.str();\n\n  mgr->ConnectInput(energyscaletask, 0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput(energyscaletask, 1, mgr->CreateContainer(listnamebuilder.str().data(), TList::Class(), AliAnalysisManager::kOutputContainer, outnamebuilder.str().data()));\n  return energyscaletask;\n} <|endoftext|>"}
{"text":"<commit_before>#include \"engine\/resource_manager_base.h\"\n#include \"engine\/log.h\"\n#include \"engine\/lumix.h\"\n#include \"engine\/path.h\"\n#include \"engine\/resource.h\"\n#include \"engine\/resource_manager.h\"\n\n\nnamespace Lumix\n{\n\n\nvoid ResourceManagerBase::LoadHook::continueLoad(Resource& resource)\n{\n\tASSERT(resource.isEmpty());\n\tresource.remRef(); \/\/ release from hook\n\tresource.m_desired_state = Resource::State::EMPTY;\n\tresource.doLoad();\n}\n\n\nvoid ResourceManagerBase::create(ResourceType type, ResourceManager& owner)\n{\n\towner.add(type, this);\n\tm_owner = &owner;\n}\n\nvoid ResourceManagerBase::destroy()\n{\n\tfor (auto iter = m_resources.begin(), end = m_resources.end(); iter != end; ++iter)\n\t{\n\t\tResource* resource = iter.value();\n\t\tif (!resource->isEmpty())\n\t\t{\n\t\t\tg_log_error.log(\"Engine\") << \"Leaking resource \" << resource->getPath().c_str() << \"\\n\";\n\t\t}\n\t\tdestroyResource(*resource);\n\t}\n\tm_resources.clear();\n}\n\nResource* ResourceManagerBase::get(const Path& path)\n{\n\tResourceTable::iterator it = m_resources.find(path.getHash());\n\n\tif(m_resources.end() != it)\n\t{\n\t\treturn *it;\n\t}\n\n\treturn nullptr;\n}\n\nResource* ResourceManagerBase::load(const Path& path)\n{\n\tif (!path.isValid()) return nullptr;\n\tResource* resource = get(path);\n\n\tif(nullptr == resource)\n\t{\n\t\tresource = createResource(path);\n\t\tm_resources.insert(path.getHash(), resource);\n\t}\n\n\tif(resource->isEmpty() && resource->m_desired_state == Resource::State::EMPTY)\n\t{\n\t\tif (m_load_hook && m_load_hook->onBeforeLoad(*resource))\n\t\t{\n\t\t\tresource->m_desired_state = Resource::State::READY;\n\t\t\tresource->addRef(); \/\/ for hook\n\t\t\tresource->addRef(); \/\/ for return value\n\t\t\treturn resource;\n\t\t}\n\t\tresource->doLoad();\n\t}\n\n\tresource->addRef();\n\treturn resource;\n}\n\nvoid ResourceManagerBase::removeUnreferenced()\n{\n\tif (!m_is_unload_enabled) return;\n\n\tArray<Resource*> to_remove(m_allocator);\n\tfor (auto* i : m_resources)\n\t{\n\t\tif (i->getRefCount() == 0) to_remove.push(i);\n\t}\n\n\tfor (auto* i : to_remove)\n\t{\n\t\tm_resources.erase(i->getPath().getHash());\n\t\tdestroyResource(*i);\n\t}\n}\n\nvoid ResourceManagerBase::load(Resource& resource)\n{\n\tif(resource.isEmpty() && resource.m_desired_state == Resource::State::EMPTY)\n\t{\n\t\tif (m_load_hook && m_load_hook->onBeforeLoad(resource))\n\t\t{\n\t\t\tresource.addRef(); \/\/ for hook\n\t\t\tresource.addRef(); \/\/ for return value\n\t\t\treturn;\n\t\t}\n\t\tresource.doLoad();\n\t}\n\n\tresource.addRef();\n}\n\nvoid ResourceManagerBase::unload(const Path& path)\n{\n\tResource* resource = get(path);\n\tif (resource) unload(*resource);\n}\n\nvoid ResourceManagerBase::unload(Resource& resource)\n{\n\tint new_ref_count = resource.remRef();\n\tASSERT(new_ref_count >= 0);\n\tif(new_ref_count == 0 && m_is_unload_enabled)\n\t{\n\t\tresource.doUnload();\n\t}\n}\n\nvoid ResourceManagerBase::reload(const Path& path)\n{\n\tResource* resource = get(path);\n\tif(resource) reload(*resource);\n}\n\nvoid ResourceManagerBase::reload(Resource& resource)\n{\n\tresource.doUnload();\n\tresource.doLoad();\n}\n\nvoid ResourceManagerBase::enableUnload(bool enable)\n{\n\tm_is_unload_enabled = enable;\n\tif (!enable) return;\n\n\tfor (auto* resource : m_resources)\n\t{\n\t\tif (resource->getRefCount() == 0)\n\t\t{\n\t\t\tresource->doUnload();\n\t\t}\n\t}\n}\n\nvoid ResourceManagerBase::setLoadHook(LoadHook& load_hook)\n{\n\tASSERT(!m_load_hook);\n\tm_load_hook = &load_hook;\n}\n\nResourceManagerBase::ResourceManagerBase(IAllocator& allocator)\n\t: m_resources(allocator)\n\t, m_allocator(allocator)\n\t, m_owner(nullptr)\n\t, m_is_unload_enabled(true)\n\t, m_load_hook(nullptr)\n{ }\n\nResourceManagerBase::~ResourceManagerBase()\n{\n\tASSERT(m_resources.empty());\n}\n\n\n} \/\/ namespace Lumix\n<commit_msg>fixed reference count<commit_after>#include \"engine\/resource_manager_base.h\"\n#include \"engine\/log.h\"\n#include \"engine\/lumix.h\"\n#include \"engine\/path.h\"\n#include \"engine\/resource.h\"\n#include \"engine\/resource_manager.h\"\n\n\nnamespace Lumix\n{\n\n\nvoid ResourceManagerBase::LoadHook::continueLoad(Resource& resource)\n{\n\tASSERT(resource.isEmpty());\n\tresource.remRef(); \/\/ release from hook\n\tresource.m_desired_state = Resource::State::EMPTY;\n\tresource.doLoad();\n}\n\n\nvoid ResourceManagerBase::create(ResourceType type, ResourceManager& owner)\n{\n\towner.add(type, this);\n\tm_owner = &owner;\n}\n\nvoid ResourceManagerBase::destroy()\n{\n\tfor (auto iter = m_resources.begin(), end = m_resources.end(); iter != end; ++iter)\n\t{\n\t\tResource* resource = iter.value();\n\t\tif (!resource->isEmpty())\n\t\t{\n\t\t\tg_log_error.log(\"Engine\") << \"Leaking resource \" << resource->getPath().c_str() << \"\\n\";\n\t\t}\n\t\tdestroyResource(*resource);\n\t}\n\tm_resources.clear();\n}\n\nResource* ResourceManagerBase::get(const Path& path)\n{\n\tResourceTable::iterator it = m_resources.find(path.getHash());\n\n\tif(m_resources.end() != it)\n\t{\n\t\treturn *it;\n\t}\n\n\treturn nullptr;\n}\n\nResource* ResourceManagerBase::load(const Path& path)\n{\n\tif (!path.isValid()) return nullptr;\n\tResource* resource = get(path);\n\n\tif(nullptr == resource)\n\t{\n\t\tresource = createResource(path);\n\t\tm_resources.insert(path.getHash(), resource);\n\t}\n\n\tif(resource->isEmpty() && resource->m_desired_state == Resource::State::EMPTY)\n\t{\n\t\tif (m_load_hook && m_load_hook->onBeforeLoad(*resource))\n\t\t{\n\t\t\tresource->m_desired_state = Resource::State::READY;\n\t\t\tresource->addRef(); \/\/ for hook\n\t\t\tresource->addRef(); \/\/ for return value\n\t\t\treturn resource;\n\t\t}\n\t\tresource->doLoad();\n\t}\n\n\tresource->addRef();\n\treturn resource;\n}\n\nvoid ResourceManagerBase::removeUnreferenced()\n{\n\tif (!m_is_unload_enabled) return;\n\n\tArray<Resource*> to_remove(m_allocator);\n\tfor (auto* i : m_resources)\n\t{\n\t\tif (i->getRefCount() == 0) to_remove.push(i);\n\t}\n\n\tfor (auto* i : to_remove)\n\t{\n\t\tm_resources.erase(i->getPath().getHash());\n\t\tdestroyResource(*i);\n\t}\n}\n\nvoid ResourceManagerBase::load(Resource& resource)\n{\n\tif(resource.isEmpty() && resource.m_desired_state == Resource::State::EMPTY)\n\t{\n\t\tif (m_load_hook && m_load_hook->onBeforeLoad(resource))\n\t\t{\n\t\t\tresource.addRef(); \/\/ for hook\n\t\t\treturn;\n\t\t}\n\t\tresource.doLoad();\n\t}\n\n\tresource.addRef();\n}\n\nvoid ResourceManagerBase::unload(const Path& path)\n{\n\tResource* resource = get(path);\n\tif (resource) unload(*resource);\n}\n\nvoid ResourceManagerBase::unload(Resource& resource)\n{\n\tint new_ref_count = resource.remRef();\n\tASSERT(new_ref_count >= 0);\n\tif(new_ref_count == 0 && m_is_unload_enabled)\n\t{\n\t\tresource.doUnload();\n\t}\n}\n\nvoid ResourceManagerBase::reload(const Path& path)\n{\n\tResource* resource = get(path);\n\tif(resource) reload(*resource);\n}\n\nvoid ResourceManagerBase::reload(Resource& resource)\n{\n\tresource.doUnload();\n\tresource.doLoad();\n}\n\nvoid ResourceManagerBase::enableUnload(bool enable)\n{\n\tm_is_unload_enabled = enable;\n\tif (!enable) return;\n\n\tfor (auto* resource : m_resources)\n\t{\n\t\tif (resource->getRefCount() == 0)\n\t\t{\n\t\t\tresource->doUnload();\n\t\t}\n\t}\n}\n\nvoid ResourceManagerBase::setLoadHook(LoadHook& load_hook)\n{\n\tASSERT(!m_load_hook);\n\tm_load_hook = &load_hook;\n}\n\nResourceManagerBase::ResourceManagerBase(IAllocator& allocator)\n\t: m_resources(allocator)\n\t, m_allocator(allocator)\n\t, m_owner(nullptr)\n\t, m_is_unload_enabled(true)\n\t, m_load_hook(nullptr)\n{ }\n\nResourceManagerBase::~ResourceManagerBase()\n{\n\tASSERT(m_resources.empty());\n}\n\n\n} \/\/ namespace Lumix\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************\\\n           __\n          \/ \/\n\t\t \/ \/                     __  __\n\t\t\/ \/______    _______    \/ \/ \/ \/ ________   __       __\n\t   \/ ______  \\  \/_____  \\  \/ \/ \/ \/ \/ _____  | \/ \/      \/ \/\n\t  \/ \/      | \/ _______| \/ \/ \/ \/ \/ \/ \/____\/ \/ \/ \/      \/ \/\n\t \/ \/      \/ \/ \/ _____  \/ \/ \/ \/ \/ \/ _______\/ \/ \/      \/ \/\n\t\/ \/      \/ \/ \/ \/____\/ \/ \/ \/ \/ \/ \/ |______  \/ |______\/ \/\n   \/_\/      \/_\/ |________\/ \/ \/ \/ \/  \\_______\/  \\_______  \/\n                          \/_\/ \/_\/                     \/ \/\n\t\t\t                                         \/ \/\n\t\t       High Level Game Framework            \/_\/\n\n  ---------------------------------------------------------------\n\n  Copyright (c) 2007-2011 - Rodrigo Braz Monteiro.\n  This file is subject to the terms of halley_license.txt.\n\n\\*****************************************************************\/\n\n#include <halley\/utils\/utils.h>\n#include \"halley\/text\/encode.h\"\n#include \"halley\/support\/assert.h\"\n#include \"halley\/support\/exception.h\"\n\nusing namespace Halley;\n\nstatic const char* base64dict = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+\/\";\nstatic Bytes base64reverse;\n\nstatic void initBase64()\n{\n\tstatic bool hasInit = false;\n\tif (!hasInit) {\n\t\tbase64reverse.resize(256);\n\t\tfor (size_t i=0; i<64; i++) {\n\t\t\tbase64reverse[base64dict[i]] = char(i);\n\t\t}\n\t\tbase64reverse['='] = 255;\n\t\thasInit = true;\n\t}\n}\n\ntypedef unsigned char uchar;\n\nString Encode::encodeBase16(gsl::span<const Byte> in)\n{\n\tconst char characters[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' };\n\n\tString result;\n\tsize_t size = size_t(in.size());\n\tresult.cppStr().resize(size * 2, '0');\n\tfor (size_t i = 0; i < size; ++i) {\n\t\tunsigned char c = in[i];\n\t\tresult[i * 2] = characters[(c & 0xF0) >> 4];\n\t\tresult[i * 2 + 1] = characters[c & 0x0F];\n\t}\n\n\treturn result;\n}\n\nvoid Encode::decodeBase16(const String& in, gsl::span<Byte> bytes)\n{\n\tauto charToVal = [&] (char character) -> uint32_t\n\t{\n\t\tif (character >= 0 && character <= 9) {\n\t\t\treturn character - '0';\n\t\t} else if (character >= 'A' && character <= 'F') {\n\t\t\treturn character - 'A' + 10;\n\t\t} else if (character >= 'a' && character <= 'f') {\n\t\t\treturn character - 'a' + 10;\n\t\t} else {\n\t\t\tthrow Exception(\"Invalid hex string \\\"\" + in + \"\\\".\", HalleyExceptions::Utils);\n\t\t}\n\t};\n\t\n\tconst size_t inSize = in.size();\n\tconst size_t outSize = inSize \/ 2;\n\tExpects(inSize % 2 == 0);\n\tExpects(size_t(bytes.size()) > outSize);\n\n\tfor (size_t i = 0; i < outSize; ++i) {\n\t\tconst auto high = charToVal(in[i * 2]);\n\t\tconst auto low = charToVal(in[i * 2 + 1]);\n\t\tbytes[i] = (high << 4) | low;\n\t}\n}\n\nString Encode::encodeBase16(const Bytes& in)\n{\n\treturn encodeBase16(gsl::span<const Byte>(in.data(), in.size()));\n}\n\nString Encode::encodeBase64(const Bytes& in)\n{\n\tsize_t sz = in.size();\n\tBytes result(((sz+2) \/ 3) * 4);\n\n\tfor (size_t i=0; i<sz; i+=3) {\n\t\t\/\/ Input bytes\n\t\tint available = std::min(int(sz-i), 3);\n\t\tassert (available >= 1);\n\t\tunsigned int inByte = (uchar(in[i]) << 16) | (available >= 2 ? uchar(in[i+1]) << 8 : 0u) | (available >= 3 ? uchar(in[i+2]) : 0u);\n\n\t\t\/\/ Output bytes\n\t\tunsigned int o0 = (inByte >> 18) & 0x3F;\n\t\tunsigned int o1 = (inByte >> 12) & 0x3F;\n\t\tunsigned int o2 = (inByte >> 6) & 0x3F;\n\t\tunsigned int o3 = (inByte >> 0) & 0x3F;\n\n\t\tsize_t outPos = i \/ 3 * 4;\n\t\tresult[outPos] = base64dict[o0];\n\t\tresult[outPos+1] = base64dict[o1];\n\t\tresult[outPos+2] = available >= 2 ? base64dict[o2] : '=';\n\t\tresult[outPos+3] = available >= 3 ? base64dict[o3] : '=';\n\t}\n\n\treturn String(reinterpret_cast<const char*>(result.data()), result.size());\n}\n\nBytes Encode::decodeBase64(const String& in)\n{\n\tinitBase64();\n\n\tsize_t sz = in.length();\n\tassert(sz % 4 == 0);\n\tsize_t resLen = sz * 3 \/ 4;\n\tif (in[sz-2] == '=') resLen -= 2;\n\telse if (in[sz-1] == '=') resLen -= 1;\n\tBytes result(resLen);\n\n\tfor (size_t i=0; i<sz; i+=4) {\n\t\tint b0 = base64reverse[in[i]];\n\t\tint b1 = base64reverse[in[i+1]];\n\t\tint b2 = base64reverse[in[i+2]];\n\t\tint b3 = base64reverse[in[i+3]];\n\n\t\tint available = 3;\n\t\tif (b3 == 255) {\n\t\t\tavailable = 2;\n\t\t\tb3 = 0;\n\t\t}\n\t\tif (b2 == 255) {\n\t\t\tavailable = 1;\n\t\t\tb2 = 0;\n\t\t}\n\n\t\tunsigned int val = static_cast<unsigned int>((b0 << 18) | (b1 << 12) | (b2 << 6) | (b3));\n\t\tsize_t outPos = i * 3 \/ 4;\n\n\t\tresult[outPos] = (val >> 16) & 0xFF;\n\t\tif (available >= 2) result[outPos+1] = (val >> 8) & 0xFF;\n\t\tif (available == 3) result[outPos+2] = (val >> 0) & 0xFF;\n\t}\n\n\treturn result;\n}\n\nstatic void flushTo(Vector<char>& toFlush, Vector<char>& dest)\n{\n\tif (toFlush.size() > 0) {\n\t\tfor (size_t i=0; i<toFlush.size(); i += 127) {\n\t\t\tint toWrite = std::min(int(toFlush.size() - i), 127);\n\t\t\tdest.push_back(char(toWrite));\n\t\t\tdest.insert(dest.end(), toFlush.begin()+i, toFlush.begin()+i+toWrite);\n\t\t}\n\t}\n\ttoFlush.clear();\n}\n\nVector<char> Encode::encodeRLE(const Vector<char>& in)\n{\n\tVector<char> result;\n\tVector<char> toFlush;\n\n\tsize_t totalLen = in.size();\n\tfor (size_t i=0; i<totalLen; ) {\n\t\t\/\/ Compute run from here\n\t\tchar byte = in[i];\n\t\tint len = 1;\n\t\tfor (size_t j = i + 1; j < totalLen && in[j] == byte && len < 127; j++, len++);\n\n\t\t\/\/ Length of run, only write as RLE if it's at least 3 bytes long\n\t\tif (len >= 3) {\n\t\t\t\/\/ Flush any waiting to be flushed\n\t\t\tflushTo(toFlush, result);\n\n\t\t\t\/\/ Encode sequence\n\t\t\tresult.push_back(char(0x80 | len));\n\t\t\tresult.push_back(byte);\n\n\t\t\ti += len;\n\t\t} else {\n\t\t\t\/\/ Insert on list of stuff waiting to be flushed\n\t\t\ttoFlush.insert(toFlush.end(), in.begin()+i, in.begin()+i+len);\n\t\t\ti++;\n\t\t}\n\t}\n\tflushTo(toFlush, result);\n\n\treturn result;\n}\n\nVector<char> Encode::decodeRLE(const Vector<char>& in)\n{\n\tVector<char> result;\n\tfor (size_t i=0; i<in.size(); ) {\n\t\tint control = in[i];\n\t\tint len = control & 0x7F;\n\t\tif (control & 0x80) {\n\t\t\t\/\/ Sequence\n\t\t\tchar byte = in[i+1];\n\t\t\tresult.insert(result.end(), len, byte);\n\t\t\ti += 2;\n\t\t} else {\n\t\t\t\/\/ Bunch of stuff\n\t\t\tresult.insert(result.end(), in.begin() + i + 1, in.begin() + i + 1 + len);\n\t\t\ti += len + 1;\n\t\t}\n\t}\n\treturn result;\n}\n<commit_msg>Fix base16 decoding<commit_after>\/*****************************************************************\\\n           __\n          \/ \/\n\t\t \/ \/                     __  __\n\t\t\/ \/______    _______    \/ \/ \/ \/ ________   __       __\n\t   \/ ______  \\  \/_____  \\  \/ \/ \/ \/ \/ _____  | \/ \/      \/ \/\n\t  \/ \/      | \/ _______| \/ \/ \/ \/ \/ \/ \/____\/ \/ \/ \/      \/ \/\n\t \/ \/      \/ \/ \/ _____  \/ \/ \/ \/ \/ \/ _______\/ \/ \/      \/ \/\n\t\/ \/      \/ \/ \/ \/____\/ \/ \/ \/ \/ \/ \/ |______  \/ |______\/ \/\n   \/_\/      \/_\/ |________\/ \/ \/ \/ \/  \\_______\/  \\_______  \/\n                          \/_\/ \/_\/                     \/ \/\n\t\t\t                                         \/ \/\n\t\t       High Level Game Framework            \/_\/\n\n  ---------------------------------------------------------------\n\n  Copyright (c) 2007-2011 - Rodrigo Braz Monteiro.\n  This file is subject to the terms of halley_license.txt.\n\n\\*****************************************************************\/\n\n#include <halley\/utils\/utils.h>\n#include \"halley\/text\/encode.h\"\n#include \"halley\/support\/assert.h\"\n#include \"halley\/support\/exception.h\"\n\nusing namespace Halley;\n\nstatic const char* base64dict = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+\/\";\nstatic Bytes base64reverse;\n\nstatic void initBase64()\n{\n\tstatic bool hasInit = false;\n\tif (!hasInit) {\n\t\tbase64reverse.resize(256);\n\t\tfor (size_t i=0; i<64; i++) {\n\t\t\tbase64reverse[base64dict[i]] = char(i);\n\t\t}\n\t\tbase64reverse['='] = 255;\n\t\thasInit = true;\n\t}\n}\n\ntypedef unsigned char uchar;\n\nString Encode::encodeBase16(gsl::span<const Byte> in)\n{\n\tconst char characters[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' };\n\n\tString result;\n\tsize_t size = size_t(in.size());\n\tresult.cppStr().resize(size * 2, '0');\n\tfor (size_t i = 0; i < size; ++i) {\n\t\tunsigned char c = in[i];\n\t\tresult[i * 2] = characters[(c & 0xF0) >> 4];\n\t\tresult[i * 2 + 1] = characters[c & 0x0F];\n\t}\n\n\treturn result;\n}\n\nvoid Encode::decodeBase16(const String& in, gsl::span<Byte> bytes)\n{\n\tauto charToVal = [&] (char character) -> uint32_t\n\t{\n\t\tif (character >= '0' && character <= '9') {\n\t\t\treturn character - '0';\n\t\t} else if (character >= 'A' && character <= 'F') {\n\t\t\treturn character - 'A' + 10;\n\t\t} else if (character >= 'a' && character <= 'f') {\n\t\t\treturn character - 'a' + 10;\n\t\t} else {\n\t\t\tthrow Exception(\"Invalid hex string \\\"\" + in + \"\\\".\", HalleyExceptions::Utils);\n\t\t}\n\t};\n\t\n\tconst size_t inSize = in.size();\n\tconst size_t outSize = inSize \/ 2;\n\tExpects(inSize % 2 == 0);\n\tExpects(size_t(bytes.size()) >= outSize);\n\n\tfor (size_t i = 0; i < outSize; ++i) {\n\t\tconst auto high = charToVal(in[i * 2]);\n\t\tconst auto low = charToVal(in[i * 2 + 1]);\n\t\tbytes[i] = (high << 4) | low;\n\t}\n}\n\nString Encode::encodeBase16(const Bytes& in)\n{\n\treturn encodeBase16(gsl::span<const Byte>(in.data(), in.size()));\n}\n\nString Encode::encodeBase64(const Bytes& in)\n{\n\tsize_t sz = in.size();\n\tBytes result(((sz+2) \/ 3) * 4);\n\n\tfor (size_t i=0; i<sz; i+=3) {\n\t\t\/\/ Input bytes\n\t\tint available = std::min(int(sz-i), 3);\n\t\tassert (available >= 1);\n\t\tunsigned int inByte = (uchar(in[i]) << 16) | (available >= 2 ? uchar(in[i+1]) << 8 : 0u) | (available >= 3 ? uchar(in[i+2]) : 0u);\n\n\t\t\/\/ Output bytes\n\t\tunsigned int o0 = (inByte >> 18) & 0x3F;\n\t\tunsigned int o1 = (inByte >> 12) & 0x3F;\n\t\tunsigned int o2 = (inByte >> 6) & 0x3F;\n\t\tunsigned int o3 = (inByte >> 0) & 0x3F;\n\n\t\tsize_t outPos = i \/ 3 * 4;\n\t\tresult[outPos] = base64dict[o0];\n\t\tresult[outPos+1] = base64dict[o1];\n\t\tresult[outPos+2] = available >= 2 ? base64dict[o2] : '=';\n\t\tresult[outPos+3] = available >= 3 ? base64dict[o3] : '=';\n\t}\n\n\treturn String(reinterpret_cast<const char*>(result.data()), result.size());\n}\n\nBytes Encode::decodeBase64(const String& in)\n{\n\tinitBase64();\n\n\tsize_t sz = in.length();\n\tassert(sz % 4 == 0);\n\tsize_t resLen = sz * 3 \/ 4;\n\tif (in[sz-2] == '=') resLen -= 2;\n\telse if (in[sz-1] == '=') resLen -= 1;\n\tBytes result(resLen);\n\n\tfor (size_t i=0; i<sz; i+=4) {\n\t\tint b0 = base64reverse[in[i]];\n\t\tint b1 = base64reverse[in[i+1]];\n\t\tint b2 = base64reverse[in[i+2]];\n\t\tint b3 = base64reverse[in[i+3]];\n\n\t\tint available = 3;\n\t\tif (b3 == 255) {\n\t\t\tavailable = 2;\n\t\t\tb3 = 0;\n\t\t}\n\t\tif (b2 == 255) {\n\t\t\tavailable = 1;\n\t\t\tb2 = 0;\n\t\t}\n\n\t\tunsigned int val = static_cast<unsigned int>((b0 << 18) | (b1 << 12) | (b2 << 6) | (b3));\n\t\tsize_t outPos = i * 3 \/ 4;\n\n\t\tresult[outPos] = (val >> 16) & 0xFF;\n\t\tif (available >= 2) result[outPos+1] = (val >> 8) & 0xFF;\n\t\tif (available == 3) result[outPos+2] = (val >> 0) & 0xFF;\n\t}\n\n\treturn result;\n}\n\nstatic void flushTo(Vector<char>& toFlush, Vector<char>& dest)\n{\n\tif (toFlush.size() > 0) {\n\t\tfor (size_t i=0; i<toFlush.size(); i += 127) {\n\t\t\tint toWrite = std::min(int(toFlush.size() - i), 127);\n\t\t\tdest.push_back(char(toWrite));\n\t\t\tdest.insert(dest.end(), toFlush.begin()+i, toFlush.begin()+i+toWrite);\n\t\t}\n\t}\n\ttoFlush.clear();\n}\n\nVector<char> Encode::encodeRLE(const Vector<char>& in)\n{\n\tVector<char> result;\n\tVector<char> toFlush;\n\n\tsize_t totalLen = in.size();\n\tfor (size_t i=0; i<totalLen; ) {\n\t\t\/\/ Compute run from here\n\t\tchar byte = in[i];\n\t\tint len = 1;\n\t\tfor (size_t j = i + 1; j < totalLen && in[j] == byte && len < 127; j++, len++);\n\n\t\t\/\/ Length of run, only write as RLE if it's at least 3 bytes long\n\t\tif (len >= 3) {\n\t\t\t\/\/ Flush any waiting to be flushed\n\t\t\tflushTo(toFlush, result);\n\n\t\t\t\/\/ Encode sequence\n\t\t\tresult.push_back(char(0x80 | len));\n\t\t\tresult.push_back(byte);\n\n\t\t\ti += len;\n\t\t} else {\n\t\t\t\/\/ Insert on list of stuff waiting to be flushed\n\t\t\ttoFlush.insert(toFlush.end(), in.begin()+i, in.begin()+i+len);\n\t\t\ti++;\n\t\t}\n\t}\n\tflushTo(toFlush, result);\n\n\treturn result;\n}\n\nVector<char> Encode::decodeRLE(const Vector<char>& in)\n{\n\tVector<char> result;\n\tfor (size_t i=0; i<in.size(); ) {\n\t\tint control = in[i];\n\t\tint len = control & 0x7F;\n\t\tif (control & 0x80) {\n\t\t\t\/\/ Sequence\n\t\t\tchar byte = in[i+1];\n\t\t\tresult.insert(result.end(), len, byte);\n\t\t\ti += 2;\n\t\t} else {\n\t\t\t\/\/ Bunch of stuff\n\t\t\tresult.insert(result.end(), in.begin() + i + 1, in.begin() + i + 1 + len);\n\t\t\ti += len + 1;\n\t\t}\n\t}\n\treturn result;\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 <stdlib.h> \/\/ For random.\n\n#include <cstdlib>\n#include <iostream>\n#include <thread>\n\n#include <mesos\/executor.hpp>\n\n#include <stout\/duration.hpp>\n#include <stout\/lambda.hpp>\n#include <stout\/os.hpp>\n\nusing namespace mesos;\n\nusing std::cout;\nusing std::endl;\nusing std::string;\n\n\nvoid run(ExecutorDriver* driver, const TaskInfo& task)\n{\n  os::sleep(Seconds(random() % 10));\n\n  TaskStatus status;\n  status.mutable_task_id()->MergeFrom(task.task_id());\n  status.set_state(TASK_FINISHED);\n\n  driver->sendStatusUpdate(status);\n}\n\n\nclass LongLivedExecutor : public Executor\n{\npublic:\n  virtual ~LongLivedExecutor() {}\n\n  virtual void registered(ExecutorDriver* driver,\n                          const ExecutorInfo& executorInfo,\n                          const FrameworkInfo& frameworkInfo,\n                          const SlaveInfo& slaveInfo)\n  {\n    cout << \"Registered executor on \" << slaveInfo.hostname() << endl;\n  }\n\n  virtual void reregistered(ExecutorDriver* driver,\n                            const SlaveInfo& slaveInfo)\n  {\n    cout << \"Re-registered executor on \" << slaveInfo.hostname() << endl;\n  }\n\n  virtual void disconnected(ExecutorDriver* driver) {}\n\n  virtual void launchTask(ExecutorDriver* driver, const TaskInfo& task)\n  {\n    cout << \"Starting task \" << task.task_id().value() << endl;\n\n    std::thread thread([=]() {\n      run(driver, task);\n    });\n\n    thread.detach();\n\n    TaskStatus status;\n    status.mutable_task_id()->MergeFrom(task.task_id());\n    status.set_state(TASK_RUNNING);\n\n    driver->sendStatusUpdate(status);\n  }\n\n  virtual void killTask(ExecutorDriver* driver, const TaskID& taskId) {}\n  virtual void frameworkMessage(ExecutorDriver* driver, const string& data) {}\n  virtual void shutdown(ExecutorDriver* driver) {}\n  virtual void error(ExecutorDriver* driver, const string& message) {}\n};\n\n\nint main(int argc, char** argv)\n{\n  LongLivedExecutor executor;\n  MesosExecutorDriver driver(&executor);\n  return driver.run() == DRIVER_STOPPED ? 0 : 1;\n}\n<commit_msg>Deleted the `run` method in long lived executor.<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 <stdlib.h> \/\/ For random.\n\n#include <cstdlib>\n#include <iostream>\n#include <thread>\n\n#include <mesos\/executor.hpp>\n\n#include <stout\/duration.hpp>\n#include <stout\/lambda.hpp>\n#include <stout\/os.hpp>\n\nusing namespace mesos;\n\nusing std::cout;\nusing std::endl;\nusing std::string;\n\n\nclass LongLivedExecutor : public Executor\n{\npublic:\n  virtual ~LongLivedExecutor() {}\n\n  virtual void registered(ExecutorDriver* driver,\n                          const ExecutorInfo& executorInfo,\n                          const FrameworkInfo& frameworkInfo,\n                          const SlaveInfo& slaveInfo)\n  {\n    cout << \"Registered executor on \" << slaveInfo.hostname() << endl;\n  }\n\n  virtual void reregistered(ExecutorDriver* driver,\n                            const SlaveInfo& slaveInfo)\n  {\n    cout << \"Re-registered executor on \" << slaveInfo.hostname() << endl;\n  }\n\n  virtual void disconnected(ExecutorDriver* driver) {}\n\n  virtual void launchTask(ExecutorDriver* driver, const TaskInfo& task)\n  {\n    cout << \"Starting task \" << task.task_id().value() << endl;\n\n    std::thread thread([=]() {\n      os::sleep(Seconds(random() % 10));\n\n      TaskStatus status;\n      status.mutable_task_id()->MergeFrom(task.task_id());\n      status.set_state(TASK_FINISHED);\n\n      driver->sendStatusUpdate(status);\n    });\n\n    thread.detach();\n\n    TaskStatus status;\n    status.mutable_task_id()->MergeFrom(task.task_id());\n    status.set_state(TASK_RUNNING);\n\n    driver->sendStatusUpdate(status);\n  }\n\n  virtual void killTask(ExecutorDriver* driver, const TaskID& taskId) {}\n  virtual void frameworkMessage(ExecutorDriver* driver, const string& data) {}\n  virtual void shutdown(ExecutorDriver* driver) {}\n  virtual void error(ExecutorDriver* driver, const string& message) {}\n};\n\n\nint main(int argc, char** argv)\n{\n  LongLivedExecutor executor;\n  MesosExecutorDriver driver(&executor);\n  return driver.run() == DRIVER_STOPPED ? 0 : 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"road_graph.hpp\"\n\n#include \"..\/indexer\/feature_data.hpp\"\n#include \"..\/geometry\/point2d.hpp\"\n#include \"..\/std\/scoped_ptr.hpp\"\n#include \"..\/std\/vector.hpp\"\n#include \"..\/base\/cache.hpp\"\n\n\nclass Index;\nclass FeatureType;\n\n\nnamespace routing\n{\n\nclass IVehicleModel;\n\nclass FeaturesRoadGraph : public IRoadGraph\n{\n  struct CachedFeature\n  {\n    CachedFeature() : m_speed(0), m_isOneway(false) {}\n\n    buffer_vector<m2::PointD, 32> m_points;\n    double m_speed;\n    bool m_isOneway;\n  };\n\n  CachedFeature const & GetCachedFeature(uint32_t const ftId, FeatureType & ft, bool fullLoad);\n\npublic:\n  FeaturesRoadGraph(Index const * pIndex, size_t mwmID);\n\n  virtual void GetPossibleTurns(RoadPos const & pos, vector<PossibleTurn> & turns, bool noOptimize = true);\n  virtual void ReconstructPath(RoadPosVectorT const & positions, Route & route);\n\n  static uint32_t GetStreetReadScale();\n\n  inline size_t GetMwmID() const { return m_mwmID; }\n\n  double GetCacheMiss() const { return (double)m_cacheMiss \/ (double)m_cacheAccess; }\n\nprivate:\n  friend class CrossFeaturesLoader;\n\n  bool IsOneWay(FeatureType const & ft) const;\n  double GetSpeed(FeatureType const & ft) const;\n  void LoadFeature(uint32_t id, FeatureType & ft);\n\nprivate:\n  Index const * m_pIndex;\n  size_t m_mwmID;\n  scoped_ptr<IVehicleModel> m_vehicleModel;\n  my::Cache<uint32_t, CachedFeature> m_cache;\n\n  uint32_t m_cacheMiss;\n  uint32_t m_cacheAccess;\n};\n\n} \/\/ namespace routing\n<commit_msg>[routing] Fix division by zero.<commit_after>#pragma once\n\n#include \"road_graph.hpp\"\n\n#include \"..\/indexer\/feature_data.hpp\"\n#include \"..\/geometry\/point2d.hpp\"\n#include \"..\/std\/scoped_ptr.hpp\"\n#include \"..\/std\/vector.hpp\"\n#include \"..\/base\/cache.hpp\"\n\n\nclass Index;\nclass FeatureType;\n\n\nnamespace routing\n{\n\nclass IVehicleModel;\n\nclass FeaturesRoadGraph : public IRoadGraph\n{\n  struct CachedFeature\n  {\n    CachedFeature() : m_speed(0), m_isOneway(false) {}\n\n    buffer_vector<m2::PointD, 32> m_points;\n    double m_speed;\n    bool m_isOneway;\n  };\n\n  CachedFeature const & GetCachedFeature(uint32_t const ftId, FeatureType & ft, bool fullLoad);\n\npublic:\n  FeaturesRoadGraph(Index const * pIndex, size_t mwmID);\n\n  virtual void GetPossibleTurns(RoadPos const & pos, vector<PossibleTurn> & turns, bool noOptimize = true);\n  virtual void ReconstructPath(RoadPosVectorT const & positions, Route & route);\n\n  static uint32_t GetStreetReadScale();\n\n  inline size_t GetMwmID() const { return m_mwmID; }\n\n  double GetCacheMiss() const\n  {\n    if (m_cacheAccess == 0)\n      return 0.0;\n    return (double)m_cacheMiss \/ (double)m_cacheAccess;\n  }\n\nprivate:\n  friend class CrossFeaturesLoader;\n\n  bool IsOneWay(FeatureType const & ft) const;\n  double GetSpeed(FeatureType const & ft) const;\n  void LoadFeature(uint32_t id, FeatureType & ft);\n\nprivate:\n  Index const * m_pIndex;\n  size_t m_mwmID;\n  scoped_ptr<IVehicleModel> m_vehicleModel;\n  my::Cache<uint32_t, CachedFeature> m_cache;\n\n  uint32_t m_cacheMiss;\n  uint32_t m_cacheAccess;\n};\n\n} \/\/ namespace routing\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2011 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 \"image_space.h\"\n\n#include <sys\/types.h>\n#include <sys\/wait.h>\n\n#include \"base\/stl_util.h\"\n#include \"base\/unix_file\/fd_file.h\"\n#include \"gc\/accounting\/space_bitmap-inl.h\"\n#include \"mirror\/abstract_method.h\"\n#include \"mirror\/class-inl.h\"\n#include \"mirror\/object-inl.h\"\n#include \"oat_file.h\"\n#include \"os.h\"\n#include \"runtime.h\"\n#include \"space-inl.h\"\n#include \"utils.h\"\n\nnamespace art {\nnamespace gc {\nnamespace space {\n\nsize_t ImageSpace::bitmap_index_ = 0;\n\nImageSpace::ImageSpace(const std::string& name, MemMap* mem_map)\n: MemMapSpace(name, mem_map, mem_map->Size(), kGcRetentionPolicyNeverCollect) {\n  const size_t bitmap_index = bitmap_index_++;\n  live_bitmap_.reset(accounting::SpaceBitmap::Create(\n      StringPrintf(\"imagespace %s live-bitmap %d\", name.c_str(), static_cast<int>(bitmap_index)),\n      Begin(), Capacity()));\n  DCHECK(live_bitmap_.get() != NULL) << \"could not create imagespace live bitmap #\" << bitmap_index;\n}\n\nstatic bool GenerateImage(const std::string& image_file_name) {\n  const std::string boot_class_path_string(Runtime::Current()->GetBootClassPathString());\n  std::vector<std::string> boot_class_path;\n  Split(boot_class_path_string, ':', boot_class_path);\n  if (boot_class_path.empty()) {\n    LOG(FATAL) << \"Failed to generate image because no boot class path specified\";\n  }\n\n  std::vector<char*> arg_vector;\n\n  std::string dex2oat_string(GetAndroidRoot());\n  dex2oat_string += (kIsDebugBuild ? \"\/bin\/dex2oatd\" : \"\/bin\/dex2oat\");\n  const char* dex2oat = dex2oat_string.c_str();\n  arg_vector.push_back(strdup(dex2oat));\n\n  std::string image_option_string(\"--image=\");\n  image_option_string += image_file_name;\n  const char* image_option = image_option_string.c_str();\n  arg_vector.push_back(strdup(image_option));\n\n  arg_vector.push_back(strdup(\"--runtime-arg\"));\n  arg_vector.push_back(strdup(\"-Xms64m\"));\n\n  arg_vector.push_back(strdup(\"--runtime-arg\"));\n  arg_vector.push_back(strdup(\"-Xmx64m\"));\n\n  for (size_t i = 0; i < boot_class_path.size(); i++) {\n    std::string dex_file_option_string(\"--dex-file=\");\n    dex_file_option_string += boot_class_path[i];\n    const char* dex_file_option = dex_file_option_string.c_str();\n    arg_vector.push_back(strdup(dex_file_option));\n  }\n\n  std::string oat_file_option_string(\"--oat-file=\");\n  oat_file_option_string += image_file_name;\n  oat_file_option_string.erase(oat_file_option_string.size() - 3);\n  oat_file_option_string += \"oat\";\n  const char* oat_file_option = oat_file_option_string.c_str();\n  arg_vector.push_back(strdup(oat_file_option));\n\n  std::string base_option_string(StringPrintf(\"--base=0x%x\", ART_BASE_ADDRESS));\n  arg_vector.push_back(strdup(base_option_string.c_str()));\n\n  if (kIsTargetBuild) {\n    arg_vector.push_back(strdup(\"--image-classes-zip=\/system\/framework\/framework.jar\"));\n    arg_vector.push_back(strdup(\"--image-classes=preloaded-classes\"));\n  } else {\n    arg_vector.push_back(strdup(\"--host\"));\n  }\n\n  std::string command_line(Join(arg_vector, ' '));\n  LOG(INFO) << \"GenerateImage: \" << command_line;\n\n  arg_vector.push_back(NULL);\n  char** argv = &arg_vector[0];\n\n  \/\/ fork and exec dex2oat\n  pid_t pid = fork();\n  if (pid == 0) {\n    \/\/ no allocation allowed between fork and exec\n\n    \/\/ change process groups, so we don't get reaped by ProcessManager\n    setpgid(0, 0);\n\n    execv(dex2oat, argv);\n\n    PLOG(FATAL) << \"execv(\" << dex2oat << \") failed\";\n    return false;\n  } else {\n    STLDeleteElements(&arg_vector);\n\n    \/\/ wait for dex2oat to finish\n    int status;\n    pid_t got_pid = TEMP_FAILURE_RETRY(waitpid(pid, &status, 0));\n    if (got_pid != pid) {\n      PLOG(ERROR) << \"waitpid failed: wanted \" << pid << \", got \" << got_pid;\n      return false;\n    }\n    if (!WIFEXITED(status) || WEXITSTATUS(status) != 0) {\n      LOG(ERROR) << dex2oat << \" failed: \" << command_line;\n      return false;\n    }\n  }\n  return true;\n}\n\nImageSpace* ImageSpace::Create(const std::string& original_image_file_name) {\n  if (OS::FileExists(original_image_file_name.c_str())) {\n    \/\/ If the \/system file exists, it should be up-to-date, don't try to generate\n    return space::ImageSpace::Init(original_image_file_name, false);\n  }\n  \/\/ If the \/system file didn't exist, we need to use one from the dalvik-cache.\n  \/\/ If the cache file exists, try to open, but if it fails, regenerate.\n  \/\/ If it does not exist, generate.\n  std::string image_file_name(GetDalvikCacheFilenameOrDie(original_image_file_name));\n  if (OS::FileExists(image_file_name.c_str())) {\n    space::ImageSpace* image_space = space::ImageSpace::Init(image_file_name, true);\n    if (image_space != NULL) {\n      return image_space;\n    }\n  }\n  CHECK(GenerateImage(image_file_name)) << \"Failed to generate image: \" << image_file_name;\n  return space::ImageSpace::Init(image_file_name, true);\n}\n\nImageSpace* ImageSpace::Init(const std::string& image_file_name, bool validate_oat_file) {\n  CHECK(!image_file_name.empty());\n\n  uint64_t start_time = 0;\n  if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {\n    start_time = NanoTime();\n    LOG(INFO) << \"ImageSpace::Init entering image_file_name=\" << image_file_name;\n  }\n\n  UniquePtr<File> file(OS::OpenFile(image_file_name.c_str(), false));\n  if (file.get() == NULL) {\n    LOG(ERROR) << \"Failed to open \" << image_file_name;\n    return NULL;\n  }\n  ImageHeader image_header;\n  bool success = file->ReadFully(&image_header, sizeof(image_header));\n  if (!success || !image_header.IsValid()) {\n    LOG(ERROR) << \"Invalid image header \" << image_file_name;\n    return NULL;\n  }\n  UniquePtr<MemMap> map(MemMap::MapFileAtAddress(image_header.GetImageBegin(),\n                                                 file->GetLength(),\n                                                 PROT_READ | PROT_WRITE,\n                                                 MAP_PRIVATE | MAP_FIXED,\n                                                 file->Fd(),\n                                                 0,\n                                                 false));\n  if (map.get() == NULL) {\n    LOG(ERROR) << \"Failed to map \" << image_file_name;\n    return NULL;\n  }\n  CHECK_EQ(image_header.GetImageBegin(), map->Begin());\n  DCHECK_EQ(0, memcmp(&image_header, map->Begin(), sizeof(ImageHeader)));\n\n  Runtime* runtime = Runtime::Current();\n  mirror::Object* resolution_method = image_header.GetImageRoot(ImageHeader::kResolutionMethod);\n  runtime->SetResolutionMethod(down_cast<mirror::AbstractMethod*>(resolution_method));\n\n  mirror::Object* callee_save_method = image_header.GetImageRoot(ImageHeader::kCalleeSaveMethod);\n  runtime->SetCalleeSaveMethod(down_cast<mirror::AbstractMethod*>(callee_save_method), Runtime::kSaveAll);\n  callee_save_method = image_header.GetImageRoot(ImageHeader::kRefsOnlySaveMethod);\n  runtime->SetCalleeSaveMethod(down_cast<mirror::AbstractMethod*>(callee_save_method), Runtime::kRefsOnly);\n  callee_save_method = image_header.GetImageRoot(ImageHeader::kRefsAndArgsSaveMethod);\n  runtime->SetCalleeSaveMethod(down_cast<mirror::AbstractMethod*>(callee_save_method), Runtime::kRefsAndArgs);\n\n  UniquePtr<ImageSpace> space(new ImageSpace(image_file_name, map.release()));\n\n  space->oat_file_.reset(space->OpenOatFile());\n  if (space->oat_file_.get() == NULL) {\n    LOG(ERROR) << \"Failed to open oat file for image: \" << image_file_name;\n    return NULL;\n  }\n\n  if (validate_oat_file && !space->ValidateOatFile()) {\n    LOG(WARNING) << \"Failed to validate oat file for image: \" << image_file_name;\n    return NULL;\n  }\n\n  if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {\n    LOG(INFO) << \"ImageSpace::Init exiting (\" << PrettyDuration(NanoTime() - start_time)\n             << \") \" << *space.get();\n  }\n  return space.release();\n}\n\nOatFile* ImageSpace::OpenOatFile() const {\n  const Runtime* runtime = Runtime::Current();\n  const ImageHeader& image_header = GetImageHeader();\n  \/\/ Grab location but don't use Object::AsString as we haven't yet initialized the roots to\n  \/\/ check the down cast\n  mirror::String* oat_location =\n      down_cast<mirror::String*>(image_header.GetImageRoot(ImageHeader::kOatLocation));\n  std::string oat_filename;\n  oat_filename += runtime->GetHostPrefix();\n  oat_filename += oat_location->ToModifiedUtf8();\n  OatFile* oat_file = OatFile::Open(oat_filename, oat_filename, image_header.GetOatDataBegin(),\n                                    !Runtime::Current()->IsCompiler());\n  if (oat_file == NULL) {\n    LOG(ERROR) << \"Failed to open oat file \" << oat_filename << \" referenced from image.\";\n    return NULL;\n  }\n  uint32_t oat_checksum = oat_file->GetOatHeader().GetChecksum();\n  uint32_t image_oat_checksum = image_header.GetOatChecksum();\n  if (oat_checksum != image_oat_checksum) {\n    LOG(ERROR) << \"Failed to match oat file checksum \" << std::hex << oat_checksum\n               << \" to expected oat checksum \" << std::hex << image_oat_checksum\n               << \" in image\";\n    return NULL;\n  }\n  return oat_file;\n}\n\nbool ImageSpace::ValidateOatFile() const {\n  CHECK(oat_file_.get() != NULL);\n  std::vector<const OatFile::OatDexFile*> oat_dex_files = oat_file_->GetOatDexFiles();\n  for (size_t i = 0; i < oat_dex_files.size(); i++) {\n    const OatFile::OatDexFile* oat_dex_file = oat_dex_files[i];\n    const std::string& dex_file_location = oat_dex_file->GetDexFileLocation();\n    uint32_t dex_file_location_checksum;\n    if (!DexFile::GetChecksum(dex_file_location.c_str(), dex_file_location_checksum)) {\n      LOG(WARNING) << \"ValidateOatFile could not find checksum for \" << dex_file_location;\n      return false;\n    }\n    if (dex_file_location_checksum != oat_dex_file->GetDexFileLocationChecksum()) {\n      LOG(WARNING) << \"ValidateOatFile found checksum mismatch between oat file \"\n                   << oat_file_->GetLocation() << \" and dex file \" << dex_file_location\n                   << \" (\" << oat_dex_file->GetDexFileLocationChecksum() << \" != \"\n                   << dex_file_location_checksum << \")\";\n      return false;\n    }\n  }\n  return true;\n}\n\nOatFile& ImageSpace::ReleaseOatFile() {\n  CHECK(oat_file_.get() != NULL);\n  return *oat_file_.release();\n}\n\nvoid ImageSpace::RecordImageAllocations(accounting::SpaceBitmap* live_bitmap) const {\n  uint64_t start_time = 0;\n  if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {\n    LOG(INFO) << \"ImageSpace::RecordImageAllocations entering\";\n    start_time = NanoTime();\n  }\n  DCHECK(!Runtime::Current()->IsStarted());\n  CHECK(live_bitmap != NULL);\n  byte* current = Begin() + RoundUp(sizeof(ImageHeader), kObjectAlignment);\n  byte* end = End();\n  while (current < end) {\n    DCHECK_ALIGNED(current, kObjectAlignment);\n    const mirror::Object* obj = reinterpret_cast<const mirror::Object*>(current);\n    live_bitmap->Set(obj);\n    current += RoundUp(obj->SizeOf(), kObjectAlignment);\n  }\n  if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {\n    LOG(INFO) << \"ImageSpace::RecordImageAllocations exiting (\"\n        << PrettyDuration(NanoTime() - start_time) << \")\";\n  }\n}\n\nvoid ImageSpace::Dump(std::ostream& os) const {\n  os << GetType()\n      << \"begin=\" << reinterpret_cast<void*>(Begin())\n      << \",end=\" << reinterpret_cast<void*>(End())\n      << \",size=\" << PrettySize(Size())\n      << \",name=\\\"\" << GetName() << \"\\\"]\";\n}\n\n}  \/\/ namespace space\n}  \/\/ namespace gc\n}  \/\/ namespace art\n<commit_msg>am 266099b1: Merge \"Fix mismatched malloc \/ delete.\"<commit_after>\/*\n * Copyright (C) 2011 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 \"image_space.h\"\n\n#include <sys\/types.h>\n#include <sys\/wait.h>\n\n#include \"base\/stl_util.h\"\n#include \"base\/unix_file\/fd_file.h\"\n#include \"gc\/accounting\/space_bitmap-inl.h\"\n#include \"mirror\/abstract_method.h\"\n#include \"mirror\/class-inl.h\"\n#include \"mirror\/object-inl.h\"\n#include \"oat_file.h\"\n#include \"os.h\"\n#include \"runtime.h\"\n#include \"space-inl.h\"\n#include \"utils.h\"\n\nnamespace art {\nnamespace gc {\nnamespace space {\n\nsize_t ImageSpace::bitmap_index_ = 0;\n\nImageSpace::ImageSpace(const std::string& name, MemMap* mem_map)\n: MemMapSpace(name, mem_map, mem_map->Size(), kGcRetentionPolicyNeverCollect) {\n  const size_t bitmap_index = bitmap_index_++;\n  live_bitmap_.reset(accounting::SpaceBitmap::Create(\n      StringPrintf(\"imagespace %s live-bitmap %d\", name.c_str(), static_cast<int>(bitmap_index)),\n      Begin(), Capacity()));\n  DCHECK(live_bitmap_.get() != NULL) << \"could not create imagespace live bitmap #\" << bitmap_index;\n}\n\nstatic bool GenerateImage(const std::string& image_file_name) {\n  const std::string boot_class_path_string(Runtime::Current()->GetBootClassPathString());\n  std::vector<std::string> boot_class_path;\n  Split(boot_class_path_string, ':', boot_class_path);\n  if (boot_class_path.empty()) {\n    LOG(FATAL) << \"Failed to generate image because no boot class path specified\";\n  }\n\n  std::vector<std::string> arg_vector;\n\n  const char* dex2oat = GetAndroidRoot();\n  std::string dex2oat_string(dex2oat);\n  dex2oat_string += (kIsDebugBuild ? \"\/bin\/dex2oatd\" : \"\/bin\/dex2oat\");\n  arg_vector.push_back(dex2oat_string);\n\n  std::string image_option_string(\"--image=\");\n  image_option_string += image_file_name;\n  arg_vector.push_back(image_option_string);\n\n  arg_vector.push_back(\"--runtime-arg\");\n  arg_vector.push_back(\"-Xms64m\");\n\n  arg_vector.push_back(\"--runtime-arg\");\n  arg_vector.push_back(\"-Xmx64m\");\n\n  for (size_t i = 0; i < boot_class_path.size(); i++) {\n    arg_vector.push_back(std::string(\"--dex-file=\") + boot_class_path[i]);\n  }\n\n  std::string oat_file_option_string(\"--oat-file=\");\n  oat_file_option_string += image_file_name;\n  oat_file_option_string.erase(oat_file_option_string.size() - 3);\n  oat_file_option_string += \"oat\";\n  arg_vector.push_back(oat_file_option_string);\n\n  arg_vector.push_back(StringPrintf(\"--base=0x%x\", ART_BASE_ADDRESS));\n\n  if (kIsTargetBuild) {\n    arg_vector.push_back(\"--image-classes-zip=\/system\/framework\/framework.jar\");\n    arg_vector.push_back(\"--image-classes=preloaded-classes\");\n  } else {\n    arg_vector.push_back(\"--host\");\n  }\n\n  std::string command_line(Join(arg_vector, ' '));\n  LOG(INFO) << \"GenerateImage: \" << command_line;\n\n  \/\/ Convert the args to char pointers.\n  std::vector<char*> char_args;\n  for (std::vector<std::string>::iterator it = arg_vector.begin(); it != arg_vector.end();\n      ++it) {\n    char_args.push_back(const_cast<char*>(it->c_str()));\n  }\n  char_args.push_back(NULL);\n\n  \/\/ fork and exec dex2oat\n  pid_t pid = fork();\n  if (pid == 0) {\n    \/\/ no allocation allowed between fork and exec\n\n    \/\/ change process groups, so we don't get reaped by ProcessManager\n    setpgid(0, 0);\n\n    execv(dex2oat, &char_args[0]);\n\n    PLOG(FATAL) << \"execv(\" << dex2oat << \") failed\";\n    return false;\n  } else {\n    if (pid == -1) {\n      PLOG(ERROR) << \"fork failed\";\n    }\n\n    \/\/ wait for dex2oat to finish\n    int status;\n    pid_t got_pid = TEMP_FAILURE_RETRY(waitpid(pid, &status, 0));\n    if (got_pid != pid) {\n      PLOG(ERROR) << \"waitpid failed: wanted \" << pid << \", got \" << got_pid;\n      return false;\n    }\n    if (!WIFEXITED(status) || WEXITSTATUS(status) != 0) {\n      LOG(ERROR) << dex2oat << \" failed: \" << command_line;\n      return false;\n    }\n  }\n  return true;\n}\n\nImageSpace* ImageSpace::Create(const std::string& original_image_file_name) {\n  if (OS::FileExists(original_image_file_name.c_str())) {\n    \/\/ If the \/system file exists, it should be up-to-date, don't try to generate\n    return space::ImageSpace::Init(original_image_file_name, false);\n  }\n  \/\/ If the \/system file didn't exist, we need to use one from the dalvik-cache.\n  \/\/ If the cache file exists, try to open, but if it fails, regenerate.\n  \/\/ If it does not exist, generate.\n  std::string image_file_name(GetDalvikCacheFilenameOrDie(original_image_file_name));\n  if (OS::FileExists(image_file_name.c_str())) {\n    space::ImageSpace* image_space = space::ImageSpace::Init(image_file_name, true);\n    if (image_space != NULL) {\n      return image_space;\n    }\n  }\n  CHECK(GenerateImage(image_file_name)) << \"Failed to generate image: \" << image_file_name;\n  return space::ImageSpace::Init(image_file_name, true);\n}\n\nImageSpace* ImageSpace::Init(const std::string& image_file_name, bool validate_oat_file) {\n  CHECK(!image_file_name.empty());\n\n  uint64_t start_time = 0;\n  if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {\n    start_time = NanoTime();\n    LOG(INFO) << \"ImageSpace::Init entering image_file_name=\" << image_file_name;\n  }\n\n  UniquePtr<File> file(OS::OpenFile(image_file_name.c_str(), false));\n  if (file.get() == NULL) {\n    LOG(ERROR) << \"Failed to open \" << image_file_name;\n    return NULL;\n  }\n  ImageHeader image_header;\n  bool success = file->ReadFully(&image_header, sizeof(image_header));\n  if (!success || !image_header.IsValid()) {\n    LOG(ERROR) << \"Invalid image header \" << image_file_name;\n    return NULL;\n  }\n  UniquePtr<MemMap> map(MemMap::MapFileAtAddress(image_header.GetImageBegin(),\n                                                 file->GetLength(),\n                                                 PROT_READ | PROT_WRITE,\n                                                 MAP_PRIVATE | MAP_FIXED,\n                                                 file->Fd(),\n                                                 0,\n                                                 false));\n  if (map.get() == NULL) {\n    LOG(ERROR) << \"Failed to map \" << image_file_name;\n    return NULL;\n  }\n  CHECK_EQ(image_header.GetImageBegin(), map->Begin());\n  DCHECK_EQ(0, memcmp(&image_header, map->Begin(), sizeof(ImageHeader)));\n\n  Runtime* runtime = Runtime::Current();\n  mirror::Object* resolution_method = image_header.GetImageRoot(ImageHeader::kResolutionMethod);\n  runtime->SetResolutionMethod(down_cast<mirror::AbstractMethod*>(resolution_method));\n\n  mirror::Object* callee_save_method = image_header.GetImageRoot(ImageHeader::kCalleeSaveMethod);\n  runtime->SetCalleeSaveMethod(down_cast<mirror::AbstractMethod*>(callee_save_method), Runtime::kSaveAll);\n  callee_save_method = image_header.GetImageRoot(ImageHeader::kRefsOnlySaveMethod);\n  runtime->SetCalleeSaveMethod(down_cast<mirror::AbstractMethod*>(callee_save_method), Runtime::kRefsOnly);\n  callee_save_method = image_header.GetImageRoot(ImageHeader::kRefsAndArgsSaveMethod);\n  runtime->SetCalleeSaveMethod(down_cast<mirror::AbstractMethod*>(callee_save_method), Runtime::kRefsAndArgs);\n\n  UniquePtr<ImageSpace> space(new ImageSpace(image_file_name, map.release()));\n\n  space->oat_file_.reset(space->OpenOatFile());\n  if (space->oat_file_.get() == NULL) {\n    LOG(ERROR) << \"Failed to open oat file for image: \" << image_file_name;\n    return NULL;\n  }\n\n  if (validate_oat_file && !space->ValidateOatFile()) {\n    LOG(WARNING) << \"Failed to validate oat file for image: \" << image_file_name;\n    return NULL;\n  }\n\n  if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {\n    LOG(INFO) << \"ImageSpace::Init exiting (\" << PrettyDuration(NanoTime() - start_time)\n             << \") \" << *space.get();\n  }\n  return space.release();\n}\n\nOatFile* ImageSpace::OpenOatFile() const {\n  const Runtime* runtime = Runtime::Current();\n  const ImageHeader& image_header = GetImageHeader();\n  \/\/ Grab location but don't use Object::AsString as we haven't yet initialized the roots to\n  \/\/ check the down cast\n  mirror::String* oat_location =\n      down_cast<mirror::String*>(image_header.GetImageRoot(ImageHeader::kOatLocation));\n  std::string oat_filename;\n  oat_filename += runtime->GetHostPrefix();\n  oat_filename += oat_location->ToModifiedUtf8();\n  OatFile* oat_file = OatFile::Open(oat_filename, oat_filename, image_header.GetOatDataBegin(),\n                                    !Runtime::Current()->IsCompiler());\n  if (oat_file == NULL) {\n    LOG(ERROR) << \"Failed to open oat file \" << oat_filename << \" referenced from image.\";\n    return NULL;\n  }\n  uint32_t oat_checksum = oat_file->GetOatHeader().GetChecksum();\n  uint32_t image_oat_checksum = image_header.GetOatChecksum();\n  if (oat_checksum != image_oat_checksum) {\n    LOG(ERROR) << \"Failed to match oat file checksum \" << std::hex << oat_checksum\n               << \" to expected oat checksum \" << std::hex << image_oat_checksum\n               << \" in image\";\n    return NULL;\n  }\n  return oat_file;\n}\n\nbool ImageSpace::ValidateOatFile() const {\n  CHECK(oat_file_.get() != NULL);\n  std::vector<const OatFile::OatDexFile*> oat_dex_files = oat_file_->GetOatDexFiles();\n  for (size_t i = 0; i < oat_dex_files.size(); i++) {\n    const OatFile::OatDexFile* oat_dex_file = oat_dex_files[i];\n    const std::string& dex_file_location = oat_dex_file->GetDexFileLocation();\n    uint32_t dex_file_location_checksum;\n    if (!DexFile::GetChecksum(dex_file_location.c_str(), dex_file_location_checksum)) {\n      LOG(WARNING) << \"ValidateOatFile could not find checksum for \" << dex_file_location;\n      return false;\n    }\n    if (dex_file_location_checksum != oat_dex_file->GetDexFileLocationChecksum()) {\n      LOG(WARNING) << \"ValidateOatFile found checksum mismatch between oat file \"\n                   << oat_file_->GetLocation() << \" and dex file \" << dex_file_location\n                   << \" (\" << oat_dex_file->GetDexFileLocationChecksum() << \" != \"\n                   << dex_file_location_checksum << \")\";\n      return false;\n    }\n  }\n  return true;\n}\n\nOatFile& ImageSpace::ReleaseOatFile() {\n  CHECK(oat_file_.get() != NULL);\n  return *oat_file_.release();\n}\n\nvoid ImageSpace::RecordImageAllocations(accounting::SpaceBitmap* live_bitmap) const {\n  uint64_t start_time = 0;\n  if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {\n    LOG(INFO) << \"ImageSpace::RecordImageAllocations entering\";\n    start_time = NanoTime();\n  }\n  DCHECK(!Runtime::Current()->IsStarted());\n  CHECK(live_bitmap != NULL);\n  byte* current = Begin() + RoundUp(sizeof(ImageHeader), kObjectAlignment);\n  byte* end = End();\n  while (current < end) {\n    DCHECK_ALIGNED(current, kObjectAlignment);\n    const mirror::Object* obj = reinterpret_cast<const mirror::Object*>(current);\n    live_bitmap->Set(obj);\n    current += RoundUp(obj->SizeOf(), kObjectAlignment);\n  }\n  if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {\n    LOG(INFO) << \"ImageSpace::RecordImageAllocations exiting (\"\n        << PrettyDuration(NanoTime() - start_time) << \")\";\n  }\n}\n\nvoid ImageSpace::Dump(std::ostream& os) const {\n  os << GetType()\n      << \"begin=\" << reinterpret_cast<void*>(Begin())\n      << \",end=\" << reinterpret_cast<void*>(End())\n      << \",size=\" << PrettySize(Size())\n      << \",name=\\\"\" << GetName() << \"\\\"]\";\n}\n\n}  \/\/ namespace space\n}  \/\/ namespace gc\n}  \/\/ namespace art\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#75962: Write test for this first.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"GUI.hpp\"\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QPushButton>\n#include <QLineEdit>\n#include <QDir>\n#include <QLabel>\n#include <QImage>\n#include <QInputDialog>\n#include <FAST\/Visualization\/ImageRenderer\/ImageRenderer.hpp>\n#include <FAST\/Visualization\/TextRenderer\/TextRenderer.hpp>\n#include <FAST\/Streamers\/ImageFileStreamer.hpp>\n#include <QMessageBox>\n#include <QElapsedTimer>\n#include <QComboBox>\n#include <QDesktopServices>\n#include <QListWidget>\n#include <QFileDialog>\n#include <QInputDialog>\n#include <FAST\/PipelineEditor.hpp>\n#include <fstream>\n#include <QDesktopWidget>\n#include <QApplication>\n\n#include <QProxyStyle>\n\n\/\/ Used to fix direct jump for QSlider\nclass MyStyle : public QProxyStyle {\n    public:\n        using QProxyStyle::QProxyStyle;\n\n        int styleHint(QStyle::StyleHint hint, const QStyleOption* option = 0, const QWidget* widget = 0, QStyleHintReturn* returnData = 0) const {\n            if (hint == QStyle::SH_Slider_AbsoluteSetButtons)\n                return (Qt::LeftButton | Qt::MidButton | Qt::RightButton);\n            return QProxyStyle::styleHint(hint, option, widget, returnData);\n        }\n};\n\nnamespace fast {\n\nGUI::GUI() {\n    mStreamingMode = STREAMING_MODE_STORE_ALL_FRAMES;\n    QDesktopWidget* desktop = QApplication::desktop();\n    menuWidth = desktop->width()*(1.0f\/6.0f);\n    mPipelineWidget = nullptr;\n    mStreamer = ImageFileStreamer::New();\n\n    QVBoxLayout* viewLayout = new QVBoxLayout;\n\n\n    View* view = createView();\n    view->set2DMode();\n    view->setBackgroundColor(Color::Black());\n    setWidth(desktop->width());\n    setHeight(desktop->height());\n    enableMaximized();\n    setTitle(\"FAST - Viewer\");\n    viewLayout->addWidget(view);\n\n    menuLayout = new QVBoxLayout;\n    menuLayout->setAlignment(Qt::AlignTop);\n\n    \/\/ Logo\n    QImage* image = new QImage;\n    image->load((Config::getDocumentationPath() + \"images\/FAST_logo_square.png\").c_str());\n    QLabel* logo = new QLabel;\n    logo->setPixmap(QPixmap::fromImage(image->scaled(menuWidth, ((float)menuWidth\/image->width())*image->height(), Qt::IgnoreAspectRatio, Qt::SmoothTransformation)));\n    logo->adjustSize();\n    menuLayout->addWidget(logo);\n\n    \/\/ Title label\n    QLabel* title = new QLabel;\n    title->setText(\"Viewer\");\n\tQFont font;\n\tfont.setPixelSize(24 * getScalingFactor());\n\tfont.setWeight(QFont::Bold);\n\ttitle->setFont(font);\n\ttitle->setAlignment(Qt::AlignCenter);\n    menuLayout->addWidget(title);\n\n    \/\/ Quit button\n    QPushButton* quitButton = new QPushButton;\n    quitButton->setText(\"Quit (q)\");\n    quitButton->setStyleSheet(\"QPushButton { background-color: red; color: white; }\");\n    quitButton->setFixedWidth(menuWidth);\n    menuLayout->addWidget(quitButton);\n\n    \/\/ Connect the clicked signal of the quit button to the stop method for the window\n    QObject::connect(quitButton, &QPushButton::clicked, std::bind(&Window::stop, this));\n\n    QLabel* inputListLabel = new QLabel;\n    \/\/inputListLabel->setFixedHeight(24);\n    inputListLabel->setText(\"Input data\");\n    inputListLabel->setStyleSheet(\"QLabel { font-weight: bold; }\");\n    menuLayout->addWidget(inputListLabel);\n\n    mList = new QListWidget;\n    mList->setFixedWidth(menuWidth);\n    mList->setSizePolicy(QSizePolicy::Minimum, QSizePolicy::Minimum);\n    mList->setFixedHeight(200);\n    mList->setSelectionMode(QAbstractItemView::ExtendedSelection); \/\/ Allow multiple items to be selected\n    QObject::connect(mList, &QListWidget::itemSelectionChanged, std::bind(&GUI::selectInputData, this));\n    menuLayout->addWidget(mList);\n\n    QPushButton* addButton = new QPushButton;\n    addButton->setText(\"Add input data\");\n    addButton->setFixedWidth(menuWidth);\n    QObject::connect(addButton, &QPushButton::clicked, std::bind(&GUI::addInputData, this));\n    menuLayout->addWidget(addButton);\n\n    QLabel* selectPipelineLabel = new QLabel;\n    selectPipelineLabel->setText(\"Active pipeline\");\n    selectPipelineLabel->setStyleSheet(\"QLabel { font-weight: bold; }\");\n    \/\/selectPipelineLabel->setFixedHeight(24);\n    menuLayout->addWidget(selectPipelineLabel);\n\n    mSelectPipeline = new QComboBox;\n    mSelectPipeline->setFixedWidth(menuWidth);\n    mPipelines = getAvailablePipelines();\n    int index = 0;\n    int counter = 0;\n    for(auto pipeline : mPipelines) {\n        mSelectPipeline->addItem((pipeline.getName() + \" (\" + pipeline.getDescription() + \")\").c_str());\n        if(pipeline.getName() == \"Image renderer\") {\n            index = counter;\n        }\n        ++counter;\n    }\n    mSelectPipeline->setCurrentIndex(index);\n\n    menuLayout->addWidget(mSelectPipeline);\n    QObject::connect(mSelectPipeline, static_cast<void (QComboBox::*)(int)>(&QComboBox::activated), std::bind(&GUI::selectPipeline, this));\n\n    QPushButton* refreshPipeline = new QPushButton;\n    refreshPipeline->setText(\"Refresh pipeline\");\n    refreshPipeline->setStyleSheet(\"QPushButton { background-color: blue; color: white; }\");\n    refreshPipeline->setFixedWidth(menuWidth);\n    QObject::connect(refreshPipeline, &QPushButton::clicked, std::bind(&GUI::selectPipeline, this));\n    menuLayout->addWidget(refreshPipeline);\n\n    QPushButton* editPipeline = new QPushButton;\n    editPipeline->setText(\"Edit pipeline\");\n    editPipeline->setStyleSheet(\"QPushButton { background-color: blue; color: white; }\");\n    editPipeline->setFixedWidth(menuWidth);\n    QObject::connect(editPipeline, &QPushButton::clicked, std::bind(&GUI::editPipeline, this));\n    menuLayout->addWidget(editPipeline);\n\n    QPushButton* newPipeline = new QPushButton;\n    newPipeline->setText(\"New pipeline\");\n    newPipeline->setStyleSheet(\"QPushButton { background-color: blue; color: white; }\");\n    newPipeline->setFixedWidth(menuWidth);\n    QObject::connect(newPipeline, &QPushButton::clicked, std::bind(&GUI::newPipeline, this));\n    menuLayout->addWidget(newPipeline);\n\n    \/\/ Playback\n    QHBoxLayout* playbackLayout = new QHBoxLayout;\n\n    mPlayPauseButton = new QPushButton;\n    mPlayPauseButton->setText(\"Play\");\n    mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: green; color: white; }\");\n    \/\/mPlayPauseButton->setFixedHeight(100);\n    QObject::connect(mPlayPauseButton, &QPushButton::clicked, std::bind(&GUI::playPause, this));\n    playbackLayout->addWidget(mPlayPauseButton);\n\n    mTimestepSlider = new QSlider(Qt::Horizontal);\n    \/\/ Improve style of slider\n    mTimestepSlider->setStyleSheet(\"QSlider:horizontal { min-height: 50px; } QSlider::groove:horizontal {\\n\"\n                                           \"    border: 1px solid #999999;\\n\"\n                                           \"    height: 10px; \/* the groove expands to the size of the slider by default. by giving it a height, it has a fixed size *\/\\n\"\n                                           \"    background: qlineargradient(x1:0, y1:0, x2:0, y2:1, stop:0 #B1B1B1, stop:1 #c4c4c4);\\n\"\n                                           \"    margin: 2px 0;\\n\"\n                                           \"}\\n\"\n                                           \"\\n\"\n                                           \"QSlider::handle:horizontal {\\n\"\n                                           \"    background: qlineargradient(x1:0, y1:0, x2:1, y2:1, stop:0 #81BEF7, stop:1 #2E9AFE);\\n\"\n                                           \"    border: 1px solid #5c5c5c;\\n\"\n                                           \"    width: 18px;\\n\"\n                                           \"    height: 25px;\\n\"\n                                           \"    margin: -10px 0; \/* handle is placed by default on the contents rect of the groove. Expand outside the groove *\/\\n\"\n                                           \"    border-radius: 3px;\\n\"\n                                           \"}\");\n    playbackLayout->addWidget(mTimestepSlider);\n    mTimestepSlider->setTickPosition(QSlider::NoTicks);\n    mTimestepSlider->setRange(0, 1234);\n    mTimestepSlider->setPageStep(1);\n    mTimestepSlider->setSingleStep(1);\n    mTimestepSlider->setStyle(new MyStyle(mTimestepSlider->style())); \/\/ Fixes issues with direct jump with slider\n    QObject::connect(mTimestepSlider, &QSlider::sliderMoved, std::bind(&GUI::setTimestep, this));\n    QObject::connect(mTimestepSlider, &QSlider::sliderPressed, std::bind(&GUI::setTimestep, this));\n\n    viewLayout->addLayout(playbackLayout);\n\n    \/\/ Add menu and view to main layout\n    QHBoxLayout* layout = new QHBoxLayout;\n    layout->addLayout(menuLayout);\n    layout->addLayout(viewLayout);\n\n    mWidget->setLayout(layout);\n\tstd::cout << \"Finished viewer setup\" << std::endl;\n\n}\n\nvoid GUI::newPipeline() {\n    bool ok;\n    QString text = QInputDialog::getText(mWidget, \"Create new pipeline\", \"Enter filename of new pipeline:\", QLineEdit::Normal, \"\", &ok);\n\n    if(ok && !text.isEmpty()) {\n        std::string filename = (const char*)text.toUtf8();\n        \/\/ Make sure file ends with .fpl\n        if(filename.substr(filename.size() - 3) != \"fpl\")\n            filename += \".fpl\";\n\n        \/\/ Create pipeline file with template\n        std::ofstream file(Config::getPipelinePath() + filename);\n        file << \"# New pipeline template\\n\"\n         \"PipelineName \\\"<Pipeline name here>\\\"\\n\"\n        \"PipelineDescription \\\"<Pipeline description here>\\\"\\n\\n\"\n\n        \"# Pipeline needs at least 1 renderer\\n\"\n        \"Renderer renderer ImageRenderer\\n\"\n        \"Input 0 PipelineInput\\n\"\n        \"Attribute window 255\\n\"\n        \"Attribute level 127.5\\n\";\n        file.close();\n\n        PipelineEditor *editor = new PipelineEditor(filename);\n        QObject::connect(editor, &PipelineEditor::saved, std::bind(&GUI::selectPipeline, this));\n        editor->show();\n    }\n}\n\nvoid GUI::editPipeline() {\n    int selectedPipeline = mSelectPipeline->currentIndex();\n    Pipeline pipeline = mPipelines.at(selectedPipeline);\n    PipelineEditor* editor = new PipelineEditor(pipeline.getFilename());\n    QObject::connect(editor, &PipelineEditor::saved, std::bind(&GUI::selectPipeline, this));\n    editor->show();\n}\n\nvoid GUI::selectPipeline() {\n    \/\/ Stop computation thread before removing renderers\n    stopComputationThread();\n\n    std::vector<std::string> inputData;\n    for(QListWidgetItem* widget : mList->selectedItems()) {\n\t\tstd::string asd = widget->text().toUtf8().constData();\n        inputData.push_back(asd);\n    }\n    mStreamer = ImageFileStreamer::New();\n    mStreamer->setFilenameFormats(inputData);\n\n    \/\/ Preload the data\n    DataPort::pointer data = mStreamer->getOutputPort();\n    int timestep = 0;\n    mStreamer->update(0, STREAMING_MODE_STORE_ALL_FRAMES);\n    while(!mStreamer->hasReachedEnd()) {\n        std::this_thread::sleep_for(std::chrono::milliseconds(100));\n    }\n\n    getView(0)->removeAllRenderers();\n\n    int selectedPipeline = mSelectPipeline->currentIndex();\n    Pipeline pipeline = mPipelines.at(selectedPipeline);\n    try {\n        std::vector<SharedPointer<Renderer>> renderers = pipeline.setup(data);\n        for(auto renderer : renderers) {\n            \/\/ A hack for text renderer which needs a reference to the view\n            if(renderer->getNameOfClass() == \"TextRenderer\") {\n                TextRenderer::pointer textRenderer = renderer;\n                textRenderer->setView(getView(0));\n            }\n            getView(0)->addRenderer(renderer);\n        }\n        getView(0)->reinitialize();\n    } catch(Exception &e) {\n        QMessageBox* message = new QMessageBox;\n        message->setWindowTitle(\"Error\");\n        message->setText(e.what());\n        message->show();\n    }\n\n\n\n    startComputationThread();\n    mPlayPauseButton->setText(\"Pause\");\n    mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: red; color: white; }\");\n    mThread->setTimestepLimit(data->getSize());\n    mTimestepSlider->setRange(0, data->getSize() - 1);\n    mThread->setTimestepLoop(true);\n    QObject::connect(mThread, &ComputationThread::timestepIncreased, std::bind(&GUI::increaseTimestep, this));\n    \/*\n    PipelineWidget* pipelineWidget = new PipelineWidget(pipeline, mWidget);\n    pipelineWidget->setFixedWidth(menuWidth);\n    if(mPipelineWidget == nullptr) {\n        menuLayout->addWidget(pipelineWidget);\n    } else {\n        menuLayout->replaceWidget(mPipelineWidget, pipelineWidget);\n    }\n    mPipelineWidget = pipelineWidget;\n     *\/\n}\n\nvoid GUI::increaseTimestep() {\n    mTimestepSlider->setSliderPosition(mThread->getTimestep());\n}\n\nvoid GUI::setTimestep() {\n    mThread->pause();\n    mPlayPauseButton->setText(\"Play\");\n    mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: green; color: white; }\");\n    mThread->setTimestep(mTimestepSlider->sliderPosition());\n    for(auto renderer : getView(0)->getRenderers()) {\n        renderer->setModified(true);\n    }\n}\n\nvoid GUI::selectInputData() {\n    selectPipeline();\n}\n\nvoid GUI::addInputData() {\n    QFileDialog fileDialog(mWidget);\n    fileDialog.setNameFilter(\"Image recordings (*_0.mhd *_0.png *_0.jpg *_0.bmp)\");\n    QStringList filenames;\n    if(fileDialog.exec()) {\n        filenames = fileDialog.selectedFiles();\n        for(QString qfilename : filenames) {\n\t\t\tstd::string filename = qfilename.toUtf8().constData();\n            filename = replace(filename, \"_0.\", \"_#.\");\n            mList->addItem(filename.c_str());\n        }\n    }\n}\n\nvoid GUI::playPause() {\n    if(mPlayPauseButton->text() == \"Play\") {\n        mThread->resume();\n        mPlayPauseButton->setText(\"Pause\");\n        mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: red; color: white; }\");\n    } else {\n        mThread->pause();\n        mPlayPauseButton->setText(\"Play\");\n        mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: green; color: white; }\");\n    }\n}\n\n}\n<commit_msg>Removed unused variable<commit_after>#include \"GUI.hpp\"\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QPushButton>\n#include <QLineEdit>\n#include <QDir>\n#include <QLabel>\n#include <QImage>\n#include <QInputDialog>\n#include <FAST\/Visualization\/ImageRenderer\/ImageRenderer.hpp>\n#include <FAST\/Visualization\/TextRenderer\/TextRenderer.hpp>\n#include <FAST\/Streamers\/ImageFileStreamer.hpp>\n#include <QMessageBox>\n#include <QElapsedTimer>\n#include <QComboBox>\n#include <QDesktopServices>\n#include <QListWidget>\n#include <QFileDialog>\n#include <QInputDialog>\n#include <FAST\/PipelineEditor.hpp>\n#include <fstream>\n#include <QDesktopWidget>\n#include <QApplication>\n\n#include <QProxyStyle>\n\n\/\/ Used to fix direct jump for QSlider\nclass MyStyle : public QProxyStyle {\n    public:\n        using QProxyStyle::QProxyStyle;\n\n        int styleHint(QStyle::StyleHint hint, const QStyleOption* option = 0, const QWidget* widget = 0, QStyleHintReturn* returnData = 0) const {\n            if (hint == QStyle::SH_Slider_AbsoluteSetButtons)\n                return (Qt::LeftButton | Qt::MidButton | Qt::RightButton);\n            return QProxyStyle::styleHint(hint, option, widget, returnData);\n        }\n};\n\nnamespace fast {\n\nGUI::GUI() {\n    mStreamingMode = STREAMING_MODE_STORE_ALL_FRAMES;\n    QDesktopWidget* desktop = QApplication::desktop();\n    menuWidth = desktop->width()*(1.0f\/6.0f);\n    mPipelineWidget = nullptr;\n    mStreamer = ImageFileStreamer::New();\n\n    QVBoxLayout* viewLayout = new QVBoxLayout;\n\n\n    View* view = createView();\n    view->set2DMode();\n    view->setBackgroundColor(Color::Black());\n    setWidth(desktop->width());\n    setHeight(desktop->height());\n    enableMaximized();\n    setTitle(\"FAST - Viewer\");\n    viewLayout->addWidget(view);\n\n    menuLayout = new QVBoxLayout;\n    menuLayout->setAlignment(Qt::AlignTop);\n\n    \/\/ Logo\n    QImage* image = new QImage;\n    image->load((Config::getDocumentationPath() + \"images\/FAST_logo_square.png\").c_str());\n    QLabel* logo = new QLabel;\n    logo->setPixmap(QPixmap::fromImage(image->scaled(menuWidth, ((float)menuWidth\/image->width())*image->height(), Qt::IgnoreAspectRatio, Qt::SmoothTransformation)));\n    logo->adjustSize();\n    menuLayout->addWidget(logo);\n\n    \/\/ Title label\n    QLabel* title = new QLabel;\n    title->setText(\"Viewer\");\n\tQFont font;\n\tfont.setPixelSize(24 * getScalingFactor());\n\tfont.setWeight(QFont::Bold);\n\ttitle->setFont(font);\n\ttitle->setAlignment(Qt::AlignCenter);\n    menuLayout->addWidget(title);\n\n    \/\/ Quit button\n    QPushButton* quitButton = new QPushButton;\n    quitButton->setText(\"Quit (q)\");\n    quitButton->setStyleSheet(\"QPushButton { background-color: red; color: white; }\");\n    quitButton->setFixedWidth(menuWidth);\n    menuLayout->addWidget(quitButton);\n\n    \/\/ Connect the clicked signal of the quit button to the stop method for the window\n    QObject::connect(quitButton, &QPushButton::clicked, std::bind(&Window::stop, this));\n\n    QLabel* inputListLabel = new QLabel;\n    \/\/inputListLabel->setFixedHeight(24);\n    inputListLabel->setText(\"Input data\");\n    inputListLabel->setStyleSheet(\"QLabel { font-weight: bold; }\");\n    menuLayout->addWidget(inputListLabel);\n\n    mList = new QListWidget;\n    mList->setFixedWidth(menuWidth);\n    mList->setSizePolicy(QSizePolicy::Minimum, QSizePolicy::Minimum);\n    mList->setFixedHeight(200);\n    mList->setSelectionMode(QAbstractItemView::ExtendedSelection); \/\/ Allow multiple items to be selected\n    QObject::connect(mList, &QListWidget::itemSelectionChanged, std::bind(&GUI::selectInputData, this));\n    menuLayout->addWidget(mList);\n\n    QPushButton* addButton = new QPushButton;\n    addButton->setText(\"Add input data\");\n    addButton->setFixedWidth(menuWidth);\n    QObject::connect(addButton, &QPushButton::clicked, std::bind(&GUI::addInputData, this));\n    menuLayout->addWidget(addButton);\n\n    QLabel* selectPipelineLabel = new QLabel;\n    selectPipelineLabel->setText(\"Active pipeline\");\n    selectPipelineLabel->setStyleSheet(\"QLabel { font-weight: bold; }\");\n    \/\/selectPipelineLabel->setFixedHeight(24);\n    menuLayout->addWidget(selectPipelineLabel);\n\n    mSelectPipeline = new QComboBox;\n    mSelectPipeline->setFixedWidth(menuWidth);\n    mPipelines = getAvailablePipelines();\n    int index = 0;\n    int counter = 0;\n    for(auto pipeline : mPipelines) {\n        mSelectPipeline->addItem((pipeline.getName() + \" (\" + pipeline.getDescription() + \")\").c_str());\n        if(pipeline.getName() == \"Image renderer\") {\n            index = counter;\n        }\n        ++counter;\n    }\n    mSelectPipeline->setCurrentIndex(index);\n\n    menuLayout->addWidget(mSelectPipeline);\n    QObject::connect(mSelectPipeline, static_cast<void (QComboBox::*)(int)>(&QComboBox::activated), std::bind(&GUI::selectPipeline, this));\n\n    QPushButton* refreshPipeline = new QPushButton;\n    refreshPipeline->setText(\"Refresh pipeline\");\n    refreshPipeline->setStyleSheet(\"QPushButton { background-color: blue; color: white; }\");\n    refreshPipeline->setFixedWidth(menuWidth);\n    QObject::connect(refreshPipeline, &QPushButton::clicked, std::bind(&GUI::selectPipeline, this));\n    menuLayout->addWidget(refreshPipeline);\n\n    QPushButton* editPipeline = new QPushButton;\n    editPipeline->setText(\"Edit pipeline\");\n    editPipeline->setStyleSheet(\"QPushButton { background-color: blue; color: white; }\");\n    editPipeline->setFixedWidth(menuWidth);\n    QObject::connect(editPipeline, &QPushButton::clicked, std::bind(&GUI::editPipeline, this));\n    menuLayout->addWidget(editPipeline);\n\n    QPushButton* newPipeline = new QPushButton;\n    newPipeline->setText(\"New pipeline\");\n    newPipeline->setStyleSheet(\"QPushButton { background-color: blue; color: white; }\");\n    newPipeline->setFixedWidth(menuWidth);\n    QObject::connect(newPipeline, &QPushButton::clicked, std::bind(&GUI::newPipeline, this));\n    menuLayout->addWidget(newPipeline);\n\n    \/\/ Playback\n    QHBoxLayout* playbackLayout = new QHBoxLayout;\n\n    mPlayPauseButton = new QPushButton;\n    mPlayPauseButton->setText(\"Play\");\n    mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: green; color: white; }\");\n    \/\/mPlayPauseButton->setFixedHeight(100);\n    QObject::connect(mPlayPauseButton, &QPushButton::clicked, std::bind(&GUI::playPause, this));\n    playbackLayout->addWidget(mPlayPauseButton);\n\n    mTimestepSlider = new QSlider(Qt::Horizontal);\n    \/\/ Improve style of slider\n    mTimestepSlider->setStyleSheet(\"QSlider:horizontal { min-height: 50px; } QSlider::groove:horizontal {\\n\"\n                                           \"    border: 1px solid #999999;\\n\"\n                                           \"    height: 10px; \/* the groove expands to the size of the slider by default. by giving it a height, it has a fixed size *\/\\n\"\n                                           \"    background: qlineargradient(x1:0, y1:0, x2:0, y2:1, stop:0 #B1B1B1, stop:1 #c4c4c4);\\n\"\n                                           \"    margin: 2px 0;\\n\"\n                                           \"}\\n\"\n                                           \"\\n\"\n                                           \"QSlider::handle:horizontal {\\n\"\n                                           \"    background: qlineargradient(x1:0, y1:0, x2:1, y2:1, stop:0 #81BEF7, stop:1 #2E9AFE);\\n\"\n                                           \"    border: 1px solid #5c5c5c;\\n\"\n                                           \"    width: 18px;\\n\"\n                                           \"    height: 25px;\\n\"\n                                           \"    margin: -10px 0; \/* handle is placed by default on the contents rect of the groove. Expand outside the groove *\/\\n\"\n                                           \"    border-radius: 3px;\\n\"\n                                           \"}\");\n    playbackLayout->addWidget(mTimestepSlider);\n    mTimestepSlider->setTickPosition(QSlider::NoTicks);\n    mTimestepSlider->setRange(0, 1234);\n    mTimestepSlider->setPageStep(1);\n    mTimestepSlider->setSingleStep(1);\n    mTimestepSlider->setStyle(new MyStyle(mTimestepSlider->style())); \/\/ Fixes issues with direct jump with slider\n    QObject::connect(mTimestepSlider, &QSlider::sliderMoved, std::bind(&GUI::setTimestep, this));\n    QObject::connect(mTimestepSlider, &QSlider::sliderPressed, std::bind(&GUI::setTimestep, this));\n\n    viewLayout->addLayout(playbackLayout);\n\n    \/\/ Add menu and view to main layout\n    QHBoxLayout* layout = new QHBoxLayout;\n    layout->addLayout(menuLayout);\n    layout->addLayout(viewLayout);\n\n    mWidget->setLayout(layout);\n\tstd::cout << \"Finished viewer setup\" << std::endl;\n\n}\n\nvoid GUI::newPipeline() {\n    bool ok;\n    QString text = QInputDialog::getText(mWidget, \"Create new pipeline\", \"Enter filename of new pipeline:\", QLineEdit::Normal, \"\", &ok);\n\n    if(ok && !text.isEmpty()) {\n        std::string filename = (const char*)text.toUtf8();\n        \/\/ Make sure file ends with .fpl\n        if(filename.substr(filename.size() - 3) != \"fpl\")\n            filename += \".fpl\";\n\n        \/\/ Create pipeline file with template\n        std::ofstream file(Config::getPipelinePath() + filename);\n        file << \"# New pipeline template\\n\"\n         \"PipelineName \\\"<Pipeline name here>\\\"\\n\"\n        \"PipelineDescription \\\"<Pipeline description here>\\\"\\n\\n\"\n\n        \"# Pipeline needs at least 1 renderer\\n\"\n        \"Renderer renderer ImageRenderer\\n\"\n        \"Input 0 PipelineInput\\n\"\n        \"Attribute window 255\\n\"\n        \"Attribute level 127.5\\n\";\n        file.close();\n\n        PipelineEditor *editor = new PipelineEditor(filename);\n        QObject::connect(editor, &PipelineEditor::saved, std::bind(&GUI::selectPipeline, this));\n        editor->show();\n    }\n}\n\nvoid GUI::editPipeline() {\n    int selectedPipeline = mSelectPipeline->currentIndex();\n    Pipeline pipeline = mPipelines.at(selectedPipeline);\n    PipelineEditor* editor = new PipelineEditor(pipeline.getFilename());\n    QObject::connect(editor, &PipelineEditor::saved, std::bind(&GUI::selectPipeline, this));\n    editor->show();\n}\n\nvoid GUI::selectPipeline() {\n    \/\/ Stop computation thread before removing renderers\n    stopComputationThread();\n\n    std::vector<std::string> inputData;\n    for(QListWidgetItem* widget : mList->selectedItems()) {\n\t\tstd::string asd = widget->text().toUtf8().constData();\n        inputData.push_back(asd);\n    }\n    mStreamer = ImageFileStreamer::New();\n    mStreamer->setFilenameFormats(inputData);\n\n    \/\/ Preload the data\n    DataPort::pointer data = mStreamer->getOutputPort();\n    mStreamer->update(0, STREAMING_MODE_STORE_ALL_FRAMES);\n    while(!mStreamer->hasReachedEnd()) {\n        std::this_thread::sleep_for(std::chrono::milliseconds(100));\n    }\n\n    getView(0)->removeAllRenderers();\n\n    int selectedPipeline = mSelectPipeline->currentIndex();\n    Pipeline pipeline = mPipelines.at(selectedPipeline);\n    try {\n        std::vector<SharedPointer<Renderer>> renderers = pipeline.setup(data);\n        for(auto renderer : renderers) {\n            \/\/ A hack for text renderer which needs a reference to the view\n            if(renderer->getNameOfClass() == \"TextRenderer\") {\n                TextRenderer::pointer textRenderer = renderer;\n                textRenderer->setView(getView(0));\n            }\n            getView(0)->addRenderer(renderer);\n        }\n        getView(0)->reinitialize();\n    } catch(Exception &e) {\n        QMessageBox* message = new QMessageBox;\n        message->setWindowTitle(\"Error\");\n        message->setText(e.what());\n        message->show();\n    }\n\n\n\n    startComputationThread();\n    mPlayPauseButton->setText(\"Pause\");\n    mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: red; color: white; }\");\n    mThread->setTimestepLimit(data->getSize());\n    mTimestepSlider->setRange(0, data->getSize() - 1);\n    mThread->setTimestepLoop(true);\n    QObject::connect(mThread, &ComputationThread::timestepIncreased, std::bind(&GUI::increaseTimestep, this));\n    \/*\n    PipelineWidget* pipelineWidget = new PipelineWidget(pipeline, mWidget);\n    pipelineWidget->setFixedWidth(menuWidth);\n    if(mPipelineWidget == nullptr) {\n        menuLayout->addWidget(pipelineWidget);\n    } else {\n        menuLayout->replaceWidget(mPipelineWidget, pipelineWidget);\n    }\n    mPipelineWidget = pipelineWidget;\n     *\/\n}\n\nvoid GUI::increaseTimestep() {\n    mTimestepSlider->setSliderPosition(mThread->getTimestep());\n}\n\nvoid GUI::setTimestep() {\n    mThread->pause();\n    mPlayPauseButton->setText(\"Play\");\n    mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: green; color: white; }\");\n    mThread->setTimestep(mTimestepSlider->sliderPosition());\n    for(auto renderer : getView(0)->getRenderers()) {\n        renderer->setModified(true);\n    }\n}\n\nvoid GUI::selectInputData() {\n    selectPipeline();\n}\n\nvoid GUI::addInputData() {\n    QFileDialog fileDialog(mWidget);\n    fileDialog.setNameFilter(\"Image recordings (*_0.mhd *_0.png *_0.jpg *_0.bmp)\");\n    QStringList filenames;\n    if(fileDialog.exec()) {\n        filenames = fileDialog.selectedFiles();\n        for(QString qfilename : filenames) {\n\t\t\tstd::string filename = qfilename.toUtf8().constData();\n            filename = replace(filename, \"_0.\", \"_#.\");\n            mList->addItem(filename.c_str());\n        }\n    }\n}\n\nvoid GUI::playPause() {\n    if(mPlayPauseButton->text() == \"Play\") {\n        mThread->resume();\n        mPlayPauseButton->setText(\"Pause\");\n        mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: red; color: white; }\");\n    } else {\n        mThread->pause();\n        mPlayPauseButton->setText(\"Play\");\n        mPlayPauseButton->setStyleSheet(\"QPushButton { background-color: green; color: white; }\");\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: collect.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: kz $ $Date: 2006-07-21 11:22:42 $\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#include <string.h>\n\n#ifndef _STREAM_HXX \/\/autogen\n#include <tools\/stream.hxx>\n#endif\n#ifndef _UNOTOOLS_TRANSLITERATIONWRAPPER_HXX\n#include <unotools\/transliterationwrapper.hxx>\n#endif\n\n#include \"rechead.hxx\"\n#include \"collect.hxx\"\n#include \"document.hxx\"         \/\/ fuer TypedStrData Konstruktor\n\n\/\/ -----------------------------------------------------------------------\n\nDataObject::~DataObject()\n{\n}\n\n\/\/------------------------------------------------------------------------\n\/\/ Collection\n\/\/------------------------------------------------------------------------\n\nvoid lcl_DeleteDataObjects( DataObject** p, USHORT nCount )\n{\n    if ( p )\n    {\n        for (USHORT i = 0; i < nCount; i++) delete p[i];\n        delete[] p;\n        p = NULL;\n    }\n}\n\nCollection::Collection(USHORT nLim, USHORT nDel) :\n    nCount ( 0 ),\n    nLimit ( nLim ),\n    nDelta ( nDel ),\n    pItems ( NULL )\n{\n    if (nDelta > MAXDELTA)\n        nDelta = MAXDELTA;\n    else if (nDelta == 0)\n        nDelta = 1;\n    if (nLimit > MAXCOLLECTIONSIZE)\n        nLimit = MAXCOLLECTIONSIZE;\n    else if (nLimit < nDelta)\n        nLimit = nDelta;\n    pItems = new DataObject*[nLimit];\n}\n\nCollection::Collection(const Collection& rCollection)\n    :   nCount ( 0 ),\n        nLimit ( 0 ),\n        nDelta ( 0 ),\n        pItems ( NULL )\n{\n    *this = rCollection;\n}\n\n\/\/------------------------------------------------------------------------\n\nCollection::~Collection()\n{\n    lcl_DeleteDataObjects( pItems, nCount );\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid Collection::AtFree(USHORT nIndex)\n{\n    if ((pItems) && (nIndex < nCount))\n    {\n        delete pItems[nIndex];\n        --nCount;               \/\/ before memmove\n        memmove ( &pItems[nIndex], &pItems[nIndex + 1], (nCount - nIndex) * sizeof(DataObject*));\n        pItems[nCount] = NULL;\n    }\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid Collection::Free(DataObject* pDataObject)\n{\n    AtFree(IndexOf(pDataObject));\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid Collection::FreeAll()\n{\n    lcl_DeleteDataObjects( pItems, nCount );\n    nCount = 0;\n    pItems = new DataObject*[nLimit];\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL Collection::AtInsert(USHORT nIndex, DataObject* pDataObject)\n{\n    if ((nCount < MAXCOLLECTIONSIZE) && (nIndex <= nCount) && pItems)\n    {\n        if (nCount == nLimit)\n        {\n            DataObject** pNewItems = new DataObject*[nLimit + nDelta];\n            if (!pNewItems)\n                return FALSE;\n            nLimit += nDelta;\n            memmove(pNewItems, pItems, nCount * sizeof(DataObject*));\n            delete[] pItems;\n            pItems = pNewItems;\n        }\n        if (nCount > nIndex)\n            memmove(&pItems[nIndex + 1], &pItems[nIndex], (nCount - nIndex) * sizeof(DataObject*));\n        pItems[nIndex] = pDataObject;\n        nCount++;\n        return TRUE;\n    }\n    return FALSE;\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL Collection::Insert(DataObject* pDataObject)\n{\n    return AtInsert(nCount, pDataObject);\n}\n\n\/\/------------------------------------------------------------------------\n\nDataObject* Collection::At(USHORT nIndex) const\n{\n    if (nIndex < nCount)\n        return pItems[nIndex];\n    else\n        return NULL;\n}\n\n\/\/------------------------------------------------------------------------\n\nUSHORT Collection::IndexOf(DataObject* pDataObject) const\n{\n    USHORT nIndex = 0xffff;\n    for (USHORT i = 0; ((i < nCount) && (nIndex == 0xffff)); i++)\n    {\n        if (pItems[i] == pDataObject) nIndex = i;\n    }\n    return nIndex;\n}\n\n\/\/------------------------------------------------------------------------\n\nCollection& Collection::operator=( const Collection& r )\n{\n    lcl_DeleteDataObjects( pItems, nCount );\n\n    nCount = r.nCount;\n    nLimit = r.nLimit;\n    nDelta = r.nDelta;\n    pItems = new DataObject*[nLimit];\n    for ( USHORT i=0; i<nCount; i++ )\n        pItems[i] = r.pItems[i]->Clone();\n\n    return *this;\n}\n\n\/\/------------------------------------------------------------------------\n\nDataObject* Collection::Clone() const\n{\n    return new Collection(*this);\n}\n\n\/\/------------------------------------------------------------------------\n\/\/ SortedCollection\n\/\/------------------------------------------------------------------------\n\nSortedCollection::SortedCollection(USHORT nLim, USHORT nDel, BOOL bDup) :\n    Collection (nLim, nDel),\n    bDuplicates ( bDup)\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nUSHORT SortedCollection::IndexOf(DataObject* pDataObject) const\n{\n    USHORT nIndex;\n    if (Search(pDataObject, nIndex))\n        return nIndex;\n    else\n        return 0xffff;\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL SortedCollection::Search(DataObject* pDataObject, USHORT& rIndex) const\n{\n    rIndex = nCount;\n    BOOL bFound = FALSE;\n    short nLo = 0;\n    short nHi = nCount - 1;\n    short nIndex;\n    short nCompare;\n    while (nLo <= nHi)\n    {\n        nIndex = (nLo + nHi) \/ 2;\n        nCompare = Compare(pItems[nIndex], pDataObject);\n        if (nCompare < 0)\n            nLo = nIndex + 1;\n        else\n        {\n            nHi = nIndex - 1;\n            if (nCompare == 0)\n            {\n                bFound = TRUE;\n                nLo = nIndex;\n            }\n        }\n    }\n    rIndex = nLo;\n    return bFound;\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL SortedCollection::Insert(DataObject* pDataObject)\n{\n    USHORT nIndex;\n    BOOL bFound = Search(pDataObject, nIndex);\n    if (bFound)\n    {\n        if (bDuplicates)\n            return AtInsert(nIndex, pDataObject);\n        else\n            return FALSE;\n    }\n    else\n        return AtInsert(nIndex, pDataObject);\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL SortedCollection::InsertPos(DataObject* pDataObject, USHORT& nIndex)\n{\n    BOOL bFound = Search(pDataObject, nIndex);\n    if (bFound)\n    {\n        if (bDuplicates)\n            return AtInsert(nIndex, pDataObject);\n        else\n            return FALSE;\n    }\n    else\n        return AtInsert(nIndex, pDataObject);\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL SortedCollection::operator==(const SortedCollection& rCmp) const\n{\n    if ( nCount != rCmp.nCount )\n        return FALSE;\n    for (USHORT i=0; i<nCount; i++)\n        if ( !IsEqual(pItems[i],rCmp.pItems[i]) )\n            return FALSE;\n    return TRUE;\n}\n\n\/\/------------------------------------------------------------------------\n\n\/\/  IsEqual - komplette Inhalte vergleichen\n\nBOOL SortedCollection::IsEqual(DataObject* pKey1, DataObject* pKey2) const\n{\n    return ( Compare(pKey1, pKey2) == 0 );      \/\/ Default: nur Index vergleichen\n}\n\n\/\/------------------------------------------------------------------------\n\nDataObject* StrData::Clone() const\n{\n    return new StrData(*this);\n}\n\n\/\/------------------------------------------------------------------------\n\nshort StrCollection::Compare(DataObject* pKey1, DataObject* pKey2) const\n{\n    StringCompare eComp = ((StrData*)pKey1)->aStr.CompareTo(((StrData*)pKey2)->aStr);\n    if (eComp == COMPARE_EQUAL)\n        return 0;\n    else if (eComp == COMPARE_LESS)\n        return -1;\n    else\n        return 1;\n}\n\n\/\/------------------------------------------------------------------------\n\nDataObject* StrCollection::Clone() const\n{\n    return new StrCollection(*this);\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid StrCollection::Load( SvStream& rStream )\n{\n    ScReadHeader aHdr( rStream );\n    lcl_DeleteDataObjects( pItems, nCount );\n    BOOL bDups;\n    rStream >> bDups;\n    SetDups( bDups );\n    rStream >> nCount >> nLimit >> nDelta;\n    pItems = new DataObject*[nLimit];\n    String aStr;\n    rtl_TextEncoding eSet = rStream.GetStreamCharSet();\n    for ( USHORT i=0; i<nCount; i++ )\n    {\n        rStream.ReadByteString( aStr, eSet );\n        pItems[i] = new StrData( aStr );\n    }\n}\n\nvoid StrCollection::Store( SvStream& rStream ) const\n{\n    ScWriteHeader aHdr( rStream );\n    BOOL bDups = IsDups();\n    rStream << bDups << nCount << nLimit << nDelta;\n    rtl_TextEncoding eSet = rStream.GetStreamCharSet();\n    for ( USHORT i=0; i<nCount; i++ )\n    {\n        rStream.WriteByteString( ((StrData*)pItems[i])->GetString(), eSet );\n    }\n}\n\n\/\/------------------------------------------------------------------------\n\/\/ TypedStrCollection\n\/\/------------------------------------------------------------------------\n\nTypedStrData::TypedStrData( ScDocument* pDoc, SCCOL nCol, SCROW nRow, SCTAB nTab,\n                                BOOL bAllStrings )\n{\n    if ( pDoc->HasValueData( nCol, nRow, nTab ) )\n    {\n        pDoc->GetValue( nCol, nRow, nTab, nValue );\n        if (bAllStrings)\n            pDoc->GetString( nCol, nRow, nTab, aStrValue );\n        nStrType = 0;\n    }\n    else\n    {\n        pDoc->GetString( nCol, nRow, nTab, aStrValue );\n        nValue = 0.0;\n        nStrType = 1;       \/\/! Typ uebergeben ?\n    }\n}\n\nDataObject* TypedStrData::Clone() const\n{\n    return new TypedStrData(*this);\n}\n\nDataObject* TypedStrCollection::Clone() const\n{\n    return new TypedStrCollection(*this);\n}\n\nshort TypedStrCollection::Compare( DataObject* pKey1, DataObject* pKey2 ) const\n{\n    short nResult = 0;\n\n    if ( pKey1 && pKey2 )\n    {\n        TypedStrData& rData1 = (TypedStrData&)*pKey1;\n        TypedStrData& rData2 = (TypedStrData&)*pKey2;\n\n        if ( rData1.nStrType > rData2.nStrType )\n            nResult = 1;\n        else if ( rData1.nStrType < rData2.nStrType )\n            nResult = -1;\n        else if ( !rData1.nStrType \/* && !rData2.nStrType *\/ )\n        {\n            \/\/--------------------\n            \/\/ Zahlen vergleichen:\n            \/\/--------------------\n            if ( rData1.nValue == rData2.nValue )\n                nResult = 0;\n            else if ( rData1.nValue < rData2.nValue )\n                nResult = -1;\n            else\n                nResult = 1;\n        }\n        else \/* if ( rData1.nStrType && rData2.nStrType ) *\/\n        {\n            \/\/---------------------\n            \/\/ Strings vergleichen:\n            \/\/---------------------\n            if ( bCaseSensitive )\n                nResult = (short) ScGlobal::pCaseTransliteration->compareString(\n                    rData1.aStrValue, rData2.aStrValue );\n            else\n                nResult = (short) ScGlobal::pTransliteration->compareString(\n                    rData1.aStrValue, rData2.aStrValue );\n        }\n    }\n\n    return nResult;\n}\n\nBOOL TypedStrCollection::FindText( const String& rStart, String& rResult,\n                                    USHORT& rPos, BOOL bBack ) const\n{\n    \/\/  Die Collection ist nach String-Vergleichen sortiert, darum muss hier\n    \/\/  alles durchsucht werden\n\n    BOOL bFound = FALSE;\n\n    String aOldResult;\n    if ( rPos != SCPOS_INVALID && rPos < nCount )\n    {\n        TypedStrData* pData = (TypedStrData*) pItems[rPos];\n        if (pData->nStrType)\n            aOldResult = pData->aStrValue;\n    }\n\n    if ( bBack )                                    \/\/ rueckwaerts\n    {\n        USHORT nStartPos = nCount;\n        if ( rPos != SCPOS_INVALID )\n            nStartPos = rPos;                       \/\/ weitersuchen...\n\n        for ( USHORT i=nStartPos; i>0; )\n        {\n            --i;\n            TypedStrData* pData = (TypedStrData*) pItems[i];\n            if (pData->nStrType)\n            {\n                if ( ScGlobal::pTransliteration->isMatch( rStart, pData->aStrValue ) )\n                {\n                    \/\/  If the collection is case sensitive, it may contain several entries\n                    \/\/  that are equal when compared case-insensitive. They are skipped here.\n                    if ( !bCaseSensitive || !aOldResult.Len() ||\n                            !ScGlobal::pTransliteration->isEqual(\n                            pData->aStrValue, aOldResult ) )\n                    {\n                        rResult = pData->aStrValue;\n                        rPos = i;\n                        bFound = TRUE;\n                        break;\n                    }\n                }\n            }\n        }\n    }\n    else                                            \/\/ vorwaerts\n    {\n        USHORT nStartPos = 0;\n        if ( rPos != SCPOS_INVALID )\n            nStartPos = rPos + 1;                   \/\/ weitersuchen...\n\n        for ( USHORT i=nStartPos; i<nCount; i++ )\n        {\n            TypedStrData* pData = (TypedStrData*) pItems[i];\n            if (pData->nStrType)\n            {\n                if ( ScGlobal::pTransliteration->isMatch( rStart, pData->aStrValue ) )\n                {\n                    \/\/  If the collection is case sensitive, it may contain several entries\n                    \/\/  that are equal when compared case-insensitive. They are skipped here.\n                    if ( !bCaseSensitive || !aOldResult.Len() ||\n                            !ScGlobal::pTransliteration->isEqual(\n                            pData->aStrValue, aOldResult ) )\n                    {\n                        rResult = pData->aStrValue;\n                        rPos = i;\n                        bFound = TRUE;\n                        break;\n                    }\n                }\n            }\n        }\n    }\n\n    return bFound;\n}\n\n        \/\/ Gross-\/Kleinschreibung anpassen\n\nBOOL TypedStrCollection::GetExactMatch( String& rString ) const\n{\n    for (USHORT i=0; i<nCount; i++)\n    {\n        TypedStrData* pData = (TypedStrData*) pItems[i];\n        if ( pData->nStrType && ScGlobal::pTransliteration->isEqual(\n                pData->aStrValue, rString ) )\n        {\n            rString = pData->aStrValue;                         \/\/ String anpassen\n            return TRUE;\n        }\n    }\n\n    return FALSE;\n}\n\n\n\n<commit_msg>INTEGRATION: CWS calcwarnings (1.12.110); FILE MERGED 2006\/12\/06 13:34:19 nn 1.12.110.2: #i69284# warning-free: core, unxlngi6 2006\/11\/28 13:24:44 nn 1.12.110.1: #i69284# warning-free: core, wntmsci10<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: collect.cxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: vg $ $Date: 2007-02-27 12:13: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n#include <string.h>\n\n#ifndef _STREAM_HXX \/\/autogen\n#include <tools\/stream.hxx>\n#endif\n#ifndef _UNOTOOLS_TRANSLITERATIONWRAPPER_HXX\n#include <unotools\/transliterationwrapper.hxx>\n#endif\n\n#include \"rechead.hxx\"\n#include \"collect.hxx\"\n#include \"document.hxx\"         \/\/ fuer TypedStrData Konstruktor\n\n\/\/ -----------------------------------------------------------------------\n\nDataObject::~DataObject()\n{\n}\n\n\/\/------------------------------------------------------------------------\n\/\/ Collection\n\/\/------------------------------------------------------------------------\n\nvoid lcl_DeleteDataObjects( DataObject** p, USHORT nCount )\n{\n    if ( p )\n    {\n        for (USHORT i = 0; i < nCount; i++) delete p[i];\n        delete[] p;\n        p = NULL;\n    }\n}\n\nCollection::Collection(USHORT nLim, USHORT nDel) :\n    nCount ( 0 ),\n    nLimit ( nLim ),\n    nDelta ( nDel ),\n    pItems ( NULL )\n{\n    if (nDelta > MAXDELTA)\n        nDelta = MAXDELTA;\n    else if (nDelta == 0)\n        nDelta = 1;\n    if (nLimit > MAXCOLLECTIONSIZE)\n        nLimit = MAXCOLLECTIONSIZE;\n    else if (nLimit < nDelta)\n        nLimit = nDelta;\n    pItems = new DataObject*[nLimit];\n}\n\nCollection::Collection(const Collection& rCollection)\n    :   DataObject(),\n        nCount ( 0 ),\n        nLimit ( 0 ),\n        nDelta ( 0 ),\n        pItems ( NULL )\n{\n    *this = rCollection;\n}\n\n\/\/------------------------------------------------------------------------\n\nCollection::~Collection()\n{\n    lcl_DeleteDataObjects( pItems, nCount );\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid Collection::AtFree(USHORT nIndex)\n{\n    if ((pItems) && (nIndex < nCount))\n    {\n        delete pItems[nIndex];\n        --nCount;               \/\/ before memmove\n        memmove ( &pItems[nIndex], &pItems[nIndex + 1], (nCount - nIndex) * sizeof(DataObject*));\n        pItems[nCount] = NULL;\n    }\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid Collection::Free(DataObject* pDataObject)\n{\n    AtFree(IndexOf(pDataObject));\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid Collection::FreeAll()\n{\n    lcl_DeleteDataObjects( pItems, nCount );\n    nCount = 0;\n    pItems = new DataObject*[nLimit];\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL Collection::AtInsert(USHORT nIndex, DataObject* pDataObject)\n{\n    if ((nCount < MAXCOLLECTIONSIZE) && (nIndex <= nCount) && pItems)\n    {\n        if (nCount == nLimit)\n        {\n            DataObject** pNewItems = new DataObject*[nLimit + nDelta];\n            if (!pNewItems)\n                return FALSE;\n            nLimit = sal::static_int_cast<USHORT>( nLimit + nDelta );\n            memmove(pNewItems, pItems, nCount * sizeof(DataObject*));\n            delete[] pItems;\n            pItems = pNewItems;\n        }\n        if (nCount > nIndex)\n            memmove(&pItems[nIndex + 1], &pItems[nIndex], (nCount - nIndex) * sizeof(DataObject*));\n        pItems[nIndex] = pDataObject;\n        nCount++;\n        return TRUE;\n    }\n    return FALSE;\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL Collection::Insert(DataObject* pDataObject)\n{\n    return AtInsert(nCount, pDataObject);\n}\n\n\/\/------------------------------------------------------------------------\n\nDataObject* Collection::At(USHORT nIndex) const\n{\n    if (nIndex < nCount)\n        return pItems[nIndex];\n    else\n        return NULL;\n}\n\n\/\/------------------------------------------------------------------------\n\nUSHORT Collection::IndexOf(DataObject* pDataObject) const\n{\n    USHORT nIndex = 0xffff;\n    for (USHORT i = 0; ((i < nCount) && (nIndex == 0xffff)); i++)\n    {\n        if (pItems[i] == pDataObject) nIndex = i;\n    }\n    return nIndex;\n}\n\n\/\/------------------------------------------------------------------------\n\nCollection& Collection::operator=( const Collection& r )\n{\n    lcl_DeleteDataObjects( pItems, nCount );\n\n    nCount = r.nCount;\n    nLimit = r.nLimit;\n    nDelta = r.nDelta;\n    pItems = new DataObject*[nLimit];\n    for ( USHORT i=0; i<nCount; i++ )\n        pItems[i] = r.pItems[i]->Clone();\n\n    return *this;\n}\n\n\/\/------------------------------------------------------------------------\n\nDataObject* Collection::Clone() const\n{\n    return new Collection(*this);\n}\n\n\/\/------------------------------------------------------------------------\n\/\/ SortedCollection\n\/\/------------------------------------------------------------------------\n\nSortedCollection::SortedCollection(USHORT nLim, USHORT nDel, BOOL bDup) :\n    Collection (nLim, nDel),\n    bDuplicates ( bDup)\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nUSHORT SortedCollection::IndexOf(DataObject* pDataObject) const\n{\n    USHORT nIndex;\n    if (Search(pDataObject, nIndex))\n        return nIndex;\n    else\n        return 0xffff;\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL SortedCollection::Search(DataObject* pDataObject, USHORT& rIndex) const\n{\n    rIndex = nCount;\n    BOOL bFound = FALSE;\n    short nLo = 0;\n    short nHi = nCount - 1;\n    short nIndex;\n    short nCompare;\n    while (nLo <= nHi)\n    {\n        nIndex = (nLo + nHi) \/ 2;\n        nCompare = Compare(pItems[nIndex], pDataObject);\n        if (nCompare < 0)\n            nLo = nIndex + 1;\n        else\n        {\n            nHi = nIndex - 1;\n            if (nCompare == 0)\n            {\n                bFound = TRUE;\n                nLo = nIndex;\n            }\n        }\n    }\n    rIndex = nLo;\n    return bFound;\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL SortedCollection::Insert(DataObject* pDataObject)\n{\n    USHORT nIndex;\n    BOOL bFound = Search(pDataObject, nIndex);\n    if (bFound)\n    {\n        if (bDuplicates)\n            return AtInsert(nIndex, pDataObject);\n        else\n            return FALSE;\n    }\n    else\n        return AtInsert(nIndex, pDataObject);\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL SortedCollection::InsertPos(DataObject* pDataObject, USHORT& nIndex)\n{\n    BOOL bFound = Search(pDataObject, nIndex);\n    if (bFound)\n    {\n        if (bDuplicates)\n            return AtInsert(nIndex, pDataObject);\n        else\n            return FALSE;\n    }\n    else\n        return AtInsert(nIndex, pDataObject);\n}\n\n\/\/------------------------------------------------------------------------\n\nBOOL SortedCollection::operator==(const SortedCollection& rCmp) const\n{\n    if ( nCount != rCmp.nCount )\n        return FALSE;\n    for (USHORT i=0; i<nCount; i++)\n        if ( !IsEqual(pItems[i],rCmp.pItems[i]) )\n            return FALSE;\n    return TRUE;\n}\n\n\/\/------------------------------------------------------------------------\n\n\/\/  IsEqual - komplette Inhalte vergleichen\n\nBOOL SortedCollection::IsEqual(DataObject* pKey1, DataObject* pKey2) const\n{\n    return ( Compare(pKey1, pKey2) == 0 );      \/\/ Default: nur Index vergleichen\n}\n\n\/\/------------------------------------------------------------------------\n\nDataObject* StrData::Clone() const\n{\n    return new StrData(*this);\n}\n\n\/\/------------------------------------------------------------------------\n\nshort StrCollection::Compare(DataObject* pKey1, DataObject* pKey2) const\n{\n    StringCompare eComp = ((StrData*)pKey1)->aStr.CompareTo(((StrData*)pKey2)->aStr);\n    if (eComp == COMPARE_EQUAL)\n        return 0;\n    else if (eComp == COMPARE_LESS)\n        return -1;\n    else\n        return 1;\n}\n\n\/\/------------------------------------------------------------------------\n\nDataObject* StrCollection::Clone() const\n{\n    return new StrCollection(*this);\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid StrCollection::Load( SvStream& rStream )\n{\n    ScReadHeader aHdr( rStream );\n    lcl_DeleteDataObjects( pItems, nCount );\n    BOOL bDups;\n    rStream >> bDups;\n    SetDups( bDups );\n    rStream >> nCount >> nLimit >> nDelta;\n    pItems = new DataObject*[nLimit];\n    String aStr;\n    rtl_TextEncoding eSet = rStream.GetStreamCharSet();\n    for ( USHORT i=0; i<nCount; i++ )\n    {\n        rStream.ReadByteString( aStr, eSet );\n        pItems[i] = new StrData( aStr );\n    }\n}\n\nvoid StrCollection::Store( SvStream& rStream ) const\n{\n    ScWriteHeader aHdr( rStream );\n    BOOL bDups = IsDups();\n    rStream << bDups << nCount << nLimit << nDelta;\n    rtl_TextEncoding eSet = rStream.GetStreamCharSet();\n    for ( USHORT i=0; i<nCount; i++ )\n    {\n        rStream.WriteByteString( ((StrData*)pItems[i])->GetString(), eSet );\n    }\n}\n\n\/\/------------------------------------------------------------------------\n\/\/ TypedStrCollection\n\/\/------------------------------------------------------------------------\n\nTypedStrData::TypedStrData( ScDocument* pDoc, SCCOL nCol, SCROW nRow, SCTAB nTab,\n                                BOOL bAllStrings )\n{\n    if ( pDoc->HasValueData( nCol, nRow, nTab ) )\n    {\n        pDoc->GetValue( nCol, nRow, nTab, nValue );\n        if (bAllStrings)\n            pDoc->GetString( nCol, nRow, nTab, aStrValue );\n        nStrType = 0;\n    }\n    else\n    {\n        pDoc->GetString( nCol, nRow, nTab, aStrValue );\n        nValue = 0.0;\n        nStrType = 1;       \/\/! Typ uebergeben ?\n    }\n}\n\nDataObject* TypedStrData::Clone() const\n{\n    return new TypedStrData(*this);\n}\n\nDataObject* TypedStrCollection::Clone() const\n{\n    return new TypedStrCollection(*this);\n}\n\nshort TypedStrCollection::Compare( DataObject* pKey1, DataObject* pKey2 ) const\n{\n    short nResult = 0;\n\n    if ( pKey1 && pKey2 )\n    {\n        TypedStrData& rData1 = (TypedStrData&)*pKey1;\n        TypedStrData& rData2 = (TypedStrData&)*pKey2;\n\n        if ( rData1.nStrType > rData2.nStrType )\n            nResult = 1;\n        else if ( rData1.nStrType < rData2.nStrType )\n            nResult = -1;\n        else if ( !rData1.nStrType \/* && !rData2.nStrType *\/ )\n        {\n            \/\/--------------------\n            \/\/ Zahlen vergleichen:\n            \/\/--------------------\n            if ( rData1.nValue == rData2.nValue )\n                nResult = 0;\n            else if ( rData1.nValue < rData2.nValue )\n                nResult = -1;\n            else\n                nResult = 1;\n        }\n        else \/* if ( rData1.nStrType && rData2.nStrType ) *\/\n        {\n            \/\/---------------------\n            \/\/ Strings vergleichen:\n            \/\/---------------------\n            if ( bCaseSensitive )\n                nResult = (short) ScGlobal::pCaseTransliteration->compareString(\n                    rData1.aStrValue, rData2.aStrValue );\n            else\n                nResult = (short) ScGlobal::pTransliteration->compareString(\n                    rData1.aStrValue, rData2.aStrValue );\n        }\n    }\n\n    return nResult;\n}\n\nBOOL TypedStrCollection::FindText( const String& rStart, String& rResult,\n                                    USHORT& rPos, BOOL bBack ) const\n{\n    \/\/  Die Collection ist nach String-Vergleichen sortiert, darum muss hier\n    \/\/  alles durchsucht werden\n\n    BOOL bFound = FALSE;\n\n    String aOldResult;\n    if ( rPos != SCPOS_INVALID && rPos < nCount )\n    {\n        TypedStrData* pData = (TypedStrData*) pItems[rPos];\n        if (pData->nStrType)\n            aOldResult = pData->aStrValue;\n    }\n\n    if ( bBack )                                    \/\/ rueckwaerts\n    {\n        USHORT nStartPos = nCount;\n        if ( rPos != SCPOS_INVALID )\n            nStartPos = rPos;                       \/\/ weitersuchen...\n\n        for ( USHORT i=nStartPos; i>0; )\n        {\n            --i;\n            TypedStrData* pData = (TypedStrData*) pItems[i];\n            if (pData->nStrType)\n            {\n                if ( ScGlobal::pTransliteration->isMatch( rStart, pData->aStrValue ) )\n                {\n                    \/\/  If the collection is case sensitive, it may contain several entries\n                    \/\/  that are equal when compared case-insensitive. They are skipped here.\n                    if ( !bCaseSensitive || !aOldResult.Len() ||\n                            !ScGlobal::pTransliteration->isEqual(\n                            pData->aStrValue, aOldResult ) )\n                    {\n                        rResult = pData->aStrValue;\n                        rPos = i;\n                        bFound = TRUE;\n                        break;\n                    }\n                }\n            }\n        }\n    }\n    else                                            \/\/ vorwaerts\n    {\n        USHORT nStartPos = 0;\n        if ( rPos != SCPOS_INVALID )\n            nStartPos = rPos + 1;                   \/\/ weitersuchen...\n\n        for ( USHORT i=nStartPos; i<nCount; i++ )\n        {\n            TypedStrData* pData = (TypedStrData*) pItems[i];\n            if (pData->nStrType)\n            {\n                if ( ScGlobal::pTransliteration->isMatch( rStart, pData->aStrValue ) )\n                {\n                    \/\/  If the collection is case sensitive, it may contain several entries\n                    \/\/  that are equal when compared case-insensitive. They are skipped here.\n                    if ( !bCaseSensitive || !aOldResult.Len() ||\n                            !ScGlobal::pTransliteration->isEqual(\n                            pData->aStrValue, aOldResult ) )\n                    {\n                        rResult = pData->aStrValue;\n                        rPos = i;\n                        bFound = TRUE;\n                        break;\n                    }\n                }\n            }\n        }\n    }\n\n    return bFound;\n}\n\n        \/\/ Gross-\/Kleinschreibung anpassen\n\nBOOL TypedStrCollection::GetExactMatch( String& rString ) const\n{\n    for (USHORT i=0; i<nCount; i++)\n    {\n        TypedStrData* pData = (TypedStrData*) pItems[i];\n        if ( pData->nStrType && ScGlobal::pTransliteration->isEqual(\n                pData->aStrValue, rString ) )\n        {\n            rString = pData->aStrValue;                         \/\/ String anpassen\n            return TRUE;\n        }\n    }\n\n    return FALSE;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: xlroot.hxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: obo $ $Date: 2003-10-21 08:49:35 $\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_XLROOT_HXX\n#define SC_XLROOT_HXX\n\n#ifndef SC_SCGLOB_HXX\n#include \"global.hxx\"\n#endif\n\n#ifndef SC_XLTOOLS_HXX\n#include \"xltools.hxx\"\n#endif\n\n\n\/\/ Global data ================================================================\n\nclass ScEditEngineDefaulter;\nclass ScHeaderEditEngine;\nclass EditEngine;\nclass XclTracer;\n\nstruct RootData;\/\/!\n\n\/** Stores global buffers and data needed elsewhere in the Excel filters. *\/\nstruct XclRootData\n{\n    typedef ::std::auto_ptr< ScEditEngineDefaulter >    ScEditEngineDefaulterPtr;\n    typedef ::std::auto_ptr< ScHeaderEditEngine >       ScHeaderEditEnginePtr;\n    typedef ::std::auto_ptr< EditEngine >               EditEnginePtr;\n    typedef ::std::auto_ptr< XclTracer >                XclTracerPtr;\n\n    XclBiff                     meBiff;         \/\/\/ Current BIFF version.\n    ScDocument&                 mrDoc;          \/\/\/ The source or destination document.\n    String                      maDocUrl;       \/\/\/ Document URL of imported\/exported file.\n    String                      maBasePath;     \/\/\/ Base path of imported\/exported file (path of maDocUrl).\n    CharSet                     meCharSet;      \/\/\/ Character set to import\/export byte strings.\n    LanguageType                meSysLang;      \/\/\/ System language.\n    LanguageType                meDocLang;      \/\/\/ Document language (import: from file, export: from system).\n    LanguageType                meUILang;       \/\/\/ UI language (import: from file, export: from system).\n    ScAddress                   maScMaxPos;     \/\/\/ Highest Calc cell position.\n    ScAddress                   maXclMaxPos;    \/\/\/ Highest Excel cell position.\n    long                        mnCharWidth;    \/\/\/ Width of '0' in default font (twips).\n    sal_uInt16                  mnScTab;        \/\/\/ Current Calc sheet index.\n    bool                        mbTruncated;    \/\/\/ Flag for the table truncated warning box.\n\n    ScEditEngineDefaulterPtr    mpEditEngine;   \/\/\/ Edit engine for rich strings etc.\n    ScHeaderEditEnginePtr       mpHFEditEngine; \/\/\/ Edit engine for header\/footer.\n    EditEnginePtr               mpDrawEditEng;  \/\/\/ Edit engine for text boxes.\n\n    XclTracerPtr                mpTracer;       \/\/\/ Filter tracer.\n\n    ::std::auto_ptr< RootData > mpRDP;\/\/!\n\n#ifdef DBG_UTIL\n    sal_Int32                   mnObjCnt;       \/\/\/ Object counter for mem leak tests.\n#endif\n\n    explicit                    XclRootData(\n                                    XclBiff eBiff,\n                                    ScDocument& rDocument,\n                                    const String& rDocUrl,\n                                    CharSet eCharSet );\n    virtual                     ~XclRootData();\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\nclass SfxObjectShell;\nclass ScModelObj;\nclass SfxPrinter;\nclass SvNumberFormatter;\nclass ScDocumentPool;\nclass ScStyleSheetPool;\nclass ScRangeName;\nclass SvStorage;\nstruct XclFontData;\n\n\/** Access to global data for a filter object (imported or exported document) from other classes. *\/\nclass XclRoot\n{\nprivate:\n    mutable XclRootData&        mrData;     \/\/\/ Reference to the global data struct.\n\npublic:\n                                XclRoot( const XclRoot& rRoot );\n    virtual                     ~XclRoot();\n\n    XclRoot&                    operator=( const XclRoot& rRoot );\n\n    RootData*                   mpRD;\/\/!\n\n    \/** Returns this root instance - for code readability in derived classes. *\/\n    inline const XclRoot&       GetRoot() const { return *this; }\n    \/** Returns the current BIFF version of the importer\/exporter. *\/\n    inline XclBiff              GetBiff() const { return mrData.meBiff; }\n    \/** Returns the system language, i.e. for number formats. *\/\n    inline LanguageType         GetSysLanguage() const { return mrData.meSysLang; }\n    \/** Returns the document language. *\/\n    inline LanguageType         GetDocLanguage() const { return mrData.meDocLang; }\n    \/** Returns the UI language. *\/\n    inline LanguageType         GetUILanguage() const { return mrData.meUILang; }\n    \/** Returns the current Calc sheet index. *\/\n    inline sal_uInt16           GetScTab() const { return mrData.mnScTab; }\n    \/** Returns whether the \"some cells have been cut\" warning box should show. *\/\n    inline bool                 IsTruncated() const { return mrData.mbTruncated; }\n\n    \/** Returns the document URL of the imported\/exported file. *\/\n    inline const String&        GetDocUrl() const { return mrData.maDocUrl; }\n    \/** Returns the base path of the imported\/exported file. *\/\n    inline const String&        GetBasePath() const { return mrData.maBasePath; }\n    \/** Returns the character set to import\/export byte strings. *\/\n    inline CharSet              GetCharSet() const { return mrData.meCharSet; }\n    \/** Returns the width of the '0' character (default font) for the current printer (twips). *\/\n    inline long                 GetCharWidth() const { return mrData.mnCharWidth; }\n\n    \/** Returns the destination document (import) or source document (export). *\/\n    inline ScDocument&          GetDoc() const { return mrData.mrDoc; }\n    \/** Returns pointer to the destination document (import) or source document (export). *\/\n    inline ScDocument*          GetDocPtr() const { return &mrData.mrDoc; }\n    \/** Returns the object shell of the Calc document. May be NULL (i.e. import from clipboard). *\/\n    SfxObjectShell*             GetDocShell() const;\n    \/** Returns the object model of the Calc document. *\/\n    ScModelObj*                 GetDocModelObj() const;\n    \/** Returns pointer to the printer of the Calc document. *\/\n    SfxPrinter*                 GetPrinter() const;\n    \/** Returns the number formatter of the Calc document. *\/\n    SvNumberFormatter&          GetFormatter() const;\n    \/** Returns the style sheet pool of the Calc document. *\/\n    ScStyleSheetPool&           GetStyleSheetPool() const;\n    \/** Returns the defined names container of the Calc document. *\/\n    ScRangeName&                GetNamedRanges() const;\n\n    \/** Returns the OLE2 root storage of the imported\/exported file.\n        @return  Pointer to root storage or 0, if the file is a simple stream. *\/\n    SvStorage*                  GetRootStorage() const;\n\n    \/** Returns the edit engine for import\/export of rich strings etc. *\/\n    ScEditEngineDefaulter&      GetEditEngine() const;\n    \/** Returns the edit engine for import\/export of headers\/footers. *\/\n    ScHeaderEditEngine&         GetHFEditEngine() const;\n    \/** Returns the edit engine for import\/export of drawing text boxes. *\/\n    EditEngine&                 GetDrawEditEngine() const;\n\n    \/** Returns the filter tracer. *\/\n    XclTracer&                  GetTracer() const;\n\n    \/** Returns the highest possible cell address in a Calc document. *\/\n    inline const ScAddress&     GetScMaxPos() const { return mrData.maScMaxPos; }\n    \/** Returns the highest possible cell address in an Excel document (using current BIFF version). *\/\n    inline const ScAddress&     GetXclMaxPos() const { return mrData.maXclMaxPos; }\n\nprotected:\n    explicit                    XclRoot( XclRootData& rRootData );\n\n    \/** Sets the BIFF version. *\/\n    void                        SetBiff( XclBiff eBiff );\n    \/** Sets the document language. *\/\n    inline void                 SetDocLanguage( LanguageType eLang ) { mrData.meDocLang = eLang; }\n    \/** Sets the UI language, i.e. if it has been read from a file. *\/\n    inline void                 SetUILanguage( LanguageType eLang ) { mrData.meUILang = eLang; }\n    \/** Sets the character set to import\/export byte strings. *\/\n    inline void                 SetCharSet( CharSet eCharSet ) { mrData.meCharSet = eCharSet; }\n    \/** Sets the width of the '0' character (default font) for the current printer (twips).\n        @param rFontData  The font used for the '0' character. *\/\n    void                        SetCharWidth( const XclFontData& rFontData );\n    \/** Increases the current Calc sheet index by 1. *\/\n    inline void                 IncScTab() { ++mrData.mnScTab; }\n    \/** Sets the maximum possible cell address according to the current BIFF version. *\/\n    void                        SetMaxPos();\n\n    \/** Checks if the passed cell address is valid.\n        @descr  Sets the internal flag that produces a warning box, if the cell is\n        outside the passed maximum position.\n        @param rPos  The cell address to check.\n        @param rMaxPos  Highest valid cell address.\n        @return  true = cell address is valid. *\/\n    bool                        CheckCellAddress( const ScAddress& rPos, const ScAddress rMaxPos ) const;\n    \/** Checks and eventually crops the cell range to passed dimensions.\n        @descr  Sets the internal flag that produces a warning box, if the cell range\n        contains invalid cells. If the range is partly valid, this function sets\n        the warning flag, corrects the range and returns true.\n        @param rRange  (In\/out) The cell range to check.\n        @param rMaxPos  Highest valid cell address.\n        @return  true = rRange contains a valid cell range (original or cropped). *\/\n    bool                        CheckCellRange( ScRange& rRange, const ScAddress rMaxPos ) const;\n    \/** Checks and eventually crops the cell ranges to passed dimensions.\n        @descr  Sets the internal flag that produces a warning box, if at least one\n        cell range contains invalid cells. If the range is partly valid, this function\n        sets the warning flag and corrects the range. Cell ranges which do not fit\n        full or partly will be removed from the list.\n        @param rRangeList  (In\/out) The cell range list to check.\n        @param rMaxPos  Highest valid cell address. *\/\n    void                        CheckCellRangeList( ScRangeList& rRanges, const ScAddress& rMaxPos ) const;\n};\n\n\n\/\/ ============================================================================\n\n#endif\n\n<commit_msg>INTEGRATION: CWS calc17 (1.7.4); FILE MERGED 2003\/10\/27 11:47:39 dr 1.7.4.2: RESYNC: (1.7-1.8); FILE MERGED 2003\/09\/09 09:59:22 jmarmion 1.7.4.1: #112154# add selected trace features to excel import.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: xlroot.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: hr $ $Date: 2003-11-05 13:43: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\n\/\/ ============================================================================\n\n#ifndef SC_XLROOT_HXX\n#define SC_XLROOT_HXX\n\n#ifndef SC_SCGLOB_HXX\n#include \"global.hxx\"\n#endif\n\n#ifndef SC_XLTOOLS_HXX\n#include \"xltools.hxx\"\n#endif\n\n\n\/\/ Global data ================================================================\n\nclass ScEditEngineDefaulter;\nclass ScHeaderEditEngine;\nclass EditEngine;\nclass XclTracer;\n\nstruct RootData;\/\/!\n\n\/** Stores global buffers and data needed elsewhere in the Excel filters. *\/\nstruct XclRootData\n{\n    typedef ::std::auto_ptr< ScEditEngineDefaulter >    ScEditEngineDefaulterPtr;\n    typedef ::std::auto_ptr< ScHeaderEditEngine >       ScHeaderEditEnginePtr;\n    typedef ::std::auto_ptr< EditEngine >               EditEnginePtr;\n    typedef ::std::auto_ptr< XclTracer >                XclTracerPtr;\n\n    XclBiff                     meBiff;         \/\/\/ Current BIFF version.\n    ScDocument&                 mrDoc;          \/\/\/ The source or destination document.\n    String                      maDocUrl;       \/\/\/ Document URL of imported\/exported file.\n    String                      maBasePath;     \/\/\/ Base path of imported\/exported file (path of maDocUrl).\n    CharSet                     meCharSet;      \/\/\/ Character set to import\/export byte strings.\n    LanguageType                meSysLang;      \/\/\/ System language.\n    LanguageType                meDocLang;      \/\/\/ Document language (import: from file, export: from system).\n    LanguageType                meUILang;       \/\/\/ UI language (import: from file, export: from system).\n    ScAddress                   maScMaxPos;     \/\/\/ Highest Calc cell position.\n    ScAddress                   maXclMaxPos;    \/\/\/ Highest Excel cell position.\n    long                        mnCharWidth;    \/\/\/ Width of '0' in default font (twips).\n    sal_uInt16                  mnScTab;        \/\/\/ Current Calc sheet index.\n    bool                        mbTruncated;    \/\/\/ Flag for the table truncated warning box.\n\n    ScEditEngineDefaulterPtr    mpEditEngine;   \/\/\/ Edit engine for rich strings etc.\n    ScHeaderEditEnginePtr       mpHFEditEngine; \/\/\/ Edit engine for header\/footer.\n    EditEnginePtr               mpDrawEditEng;  \/\/\/ Edit engine for text boxes.\n\n    XclTracerPtr                mpTracer;       \/\/\/ Filter tracer.\n\n    ::std::auto_ptr< RootData > mpRDP;\/\/!\n\n#ifdef DBG_UTIL\n    sal_Int32                   mnObjCnt;       \/\/\/ Object counter for mem leak tests.\n#endif\n\n    explicit                    XclRootData(\n                                    XclBiff eBiff,\n                                    ScDocument& rDocument,\n                                    const String& rDocUrl,\n                                    CharSet eCharSet );\n    virtual                     ~XclRootData();\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\nclass SfxObjectShell;\nclass ScModelObj;\nclass SfxPrinter;\nclass SvNumberFormatter;\nclass ScDocumentPool;\nclass ScStyleSheetPool;\nclass ScRangeName;\nclass SvStorage;\nstruct XclFontData;\n\n\/** Access to global data for a filter object (imported or exported document) from other classes. *\/\nclass XclRoot\n{\nprivate:\n    mutable XclRootData&        mrData;     \/\/\/ Reference to the global data struct.\n\npublic:\n                                XclRoot( const XclRoot& rRoot );\n    virtual                     ~XclRoot();\n\n    XclRoot&                    operator=( const XclRoot& rRoot );\n\n    RootData*                   mpRD;\/\/!\n\n    \/** Returns this root instance - for code readability in derived classes. *\/\n    inline const XclRoot&       GetRoot() const { return *this; }\n    \/** Returns the current BIFF version of the importer\/exporter. *\/\n    inline XclBiff              GetBiff() const { return mrData.meBiff; }\n    \/** Returns the system language, i.e. for number formats. *\/\n    inline LanguageType         GetSysLanguage() const { return mrData.meSysLang; }\n    \/** Returns the document language. *\/\n    inline LanguageType         GetDocLanguage() const { return mrData.meDocLang; }\n    \/** Returns the UI language. *\/\n    inline LanguageType         GetUILanguage() const { return mrData.meUILang; }\n    \/** Returns the current Calc sheet index. *\/\n    inline sal_uInt16           GetScTab() const { return mrData.mnScTab; }\n    \/** Returns whether the \"some cells have been cut\" warning box should show. *\/\n    inline bool                 IsTruncated() const { return mrData.mbTruncated; }\n\n    \/** Returns the document URL of the imported\/exported file. *\/\n    inline const String&        GetDocUrl() const { return mrData.maDocUrl; }\n    \/** Returns the base path of the imported\/exported file. *\/\n    inline const String&        GetBasePath() const { return mrData.maBasePath; }\n    \/** Returns the character set to import\/export byte strings. *\/\n    inline CharSet              GetCharSet() const { return mrData.meCharSet; }\n    \/** Returns the width of the '0' character (default font) for the current printer (twips). *\/\n    inline long                 GetCharWidth() const { return mrData.mnCharWidth; }\n\n    \/** Returns the destination document (import) or source document (export). *\/\n    inline ScDocument&          GetDoc() const { return mrData.mrDoc; }\n    \/** Returns pointer to the destination document (import) or source document (export). *\/\n    inline ScDocument*          GetDocPtr() const { return &mrData.mrDoc; }\n    \/** Returns the object shell of the Calc document. May be NULL (i.e. import from clipboard). *\/\n    SfxObjectShell*             GetDocShell() const;\n    \/** Returns the object model of the Calc document. *\/\n    ScModelObj*                 GetDocModelObj() const;\n    \/** Returns pointer to the printer of the Calc document. *\/\n    SfxPrinter*                 GetPrinter() const;\n    \/** Returns the number formatter of the Calc document. *\/\n    SvNumberFormatter&          GetFormatter() const;\n    \/** Returns the style sheet pool of the Calc document. *\/\n    ScStyleSheetPool&           GetStyleSheetPool() const;\n    \/** Returns the defined names container of the Calc document. *\/\n    ScRangeName&                GetNamedRanges() const;\n\n    \/** Returns the OLE2 root storage of the imported\/exported file.\n        @return  Pointer to root storage or 0, if the file is a simple stream. *\/\n    SvStorage*                  GetRootStorage() const;\n\n    \/** Returns the edit engine for import\/export of rich strings etc. *\/\n    ScEditEngineDefaulter&      GetEditEngine() const;\n    \/** Returns the edit engine for import\/export of headers\/footers. *\/\n    ScHeaderEditEngine&         GetHFEditEngine() const;\n    \/** Returns the edit engine for import\/export of drawing text boxes. *\/\n    EditEngine&                 GetDrawEditEngine() const;\n\n    \/** Returns the filter tracer. *\/\n    XclTracer&                  GetTracer() const;\n\n    \/** Returns the highest possible cell address in a Calc document. *\/\n    inline const ScAddress&     GetScMaxPos() const { return mrData.maScMaxPos; }\n    \/** Returns the highest possible cell address in an Excel document (using current BIFF version). *\/\n    inline const ScAddress&     GetXclMaxPos() const { return mrData.maXclMaxPos; }\n\nprotected:\n    explicit                    XclRoot( XclRootData& rRootData );\n\n    \/** Sets the BIFF version. *\/\n    void                        SetBiff( XclBiff eBiff );\n    \/** Sets the document language. *\/\n    inline void                 SetDocLanguage( LanguageType eLang ) { mrData.meDocLang = eLang; }\n    \/** Sets the UI language, i.e. if it has been read from a file. *\/\n    inline void                 SetUILanguage( LanguageType eLang ) { mrData.meUILang = eLang; }\n    \/** Sets the character set to import\/export byte strings. *\/\n    inline void                 SetCharSet( CharSet eCharSet ) { mrData.meCharSet = eCharSet; }\n    \/** Sets the width of the '0' character (default font) for the current printer (twips).\n        @param rFontData  The font used for the '0' character. *\/\n    void                        SetCharWidth( const XclFontData& rFontData );\n    \/** Increases the current Calc sheet index by 1. *\/\n    inline void                 IncScTab() { ++mrData.mnScTab; }\n    \/** Sets the maximum possible cell address according to the current BIFF version. *\/\n    void                        SetMaxPos();\n\n    \/** Checks if the passed cell address is valid.\n        @descr  Sets the internal flag that produces a warning box, if the cell is\n        outside the passed maximum position.\n        @param rPos  The cell address to check.\n        @param rMaxPos  Highest valid cell address.\n        @return  true = cell address is valid. *\/\n    bool                        CheckCellAddress( const ScAddress& rPos, const ScAddress& rMaxPos ) const;\n    \/** Checks and eventually crops the cell range to passed dimensions.\n        @descr  Sets the internal flag that produces a warning box, if the cell range\n        contains invalid cells. If the range is partly valid, this function sets\n        the warning flag, corrects the range and returns true.\n        @param rRange  (In\/out) The cell range to check.\n        @param rMaxPos  Highest valid cell address.\n        @return  true = rRange contains a valid cell range (original or cropped). *\/\n    bool                        CheckCellRange( ScRange& rRange, const ScAddress& rMaxPos ) const;\n    \/** Checks and eventually crops the cell ranges to passed dimensions.\n        @descr  Sets the internal flag that produces a warning box, if at least one\n        cell range contains invalid cells. If the range is partly valid, this function\n        sets the warning flag and corrects the range. Cell ranges which do not fit\n        full or partly will be removed from the list.\n        @param rRangeList  (In\/out) The cell range list to check.\n        @param rMaxPos  Highest valid cell address. *\/\n    void                        CheckCellRangeList( ScRangeList& rRanges, const ScAddress& rMaxPos ) const;\n};\n\n\n\/\/ ============================================================================\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id: LineBasedFile_test.C,v 1.5 2000\/10\/15 22:35:30 amoll Exp $\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <BALL\/FORMAT\/lineBasedFile.h>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSTART_TEST(class_name, \"$Id: LineBasedFile_test.C,v 1.5 2000\/10\/15 22:35:30 amoll Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\n\n\nCHECK(BALL_CREATE(LineBasedFile))\n  \/\/BAUSTELLE\nRESULT\n\nLineBasedFile* fl;\n\nCHECK(LineBasedFile() throw())\n\tfl = new LineBasedFile;\n\tTEST_NOT_EQUAL(fl, 0)\nRESULT\n\nCHECK(~LineBasedFile() throw())\n\tdelete fl;\nRESULT\n\nCHECK(LineBasedFile(const String& filename, File::OpenMode open_mode = File::IN)\n\t\t\tthrow(Exception::FileNotFound))\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLineNumber(), 1)\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EXCEPTION(Exception::FileNotFound, LineBasedFile f2(\"XXXXXXXX.txt\"))\nRESULT\n\nLineBasedFile fx;\n\nCHECK(LineBasedFile(const LineBasedFile& f) throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tf1.readLine();\n\tLineBasedFile f2(f1);\n\n\tTEST_EQUAL(f2.getLineNumber(), 1)\n\tTEST_EQUAL(f2.getLine(), \"line1\")\nRESULT\n\nCHECK(LineBasedFile& operator = (const LineBasedFile& file) throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tf1.readLine();\n\tLineBasedFile f2(f1);\n\tTEST_EQUAL(f2.getLineNumber(), 1)\n\tTEST_EQUAL(f2.getLine(), \"line1\")\nRESULT\n\nCHECK(clear() throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tf1.readLine();\n\tf1.clear();\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tTEST_EQUAL(f1.getLine(), \"\")\n\n\tfx.clear();\nRESULT\n\nCHECK(getLineNumber() const  throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLineNumber(), 1)\n\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\nCHECK(getLine() const  throw())\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EQUAL(fx.getLine(), \"\")\nRESULT\n\n\nCHECK(getField(Position pos = 0, const String& quotes = \"\", \n\t\t\tconst String& delimiters = String::CHARACTER_CLASS__WHITESPACE) \n\t\t\tconst  throw(Exception::IndexUnderflow))\n\n\tTEST_EQUAL(f1.getField(), \"line1\")\n\tTEST_EQUAL(f1.getField(1), \"\")\n\tTEST_EXCEPTION(Exception::IndexUnderflow, f1.getField(-99))\n\tf1.readLine();\n\tTEST_EQUAL(f1.getField(), \"\/0\/\")\n\tTEST_EQUAL(f1.getField(1), \"\/1\/\")\n\tTEST_EQUAL(f1.getField(2), \"\/2\")\n\tTEST_EQUAL(f1.getField(0, \"\/\"), \"0\")\n\tTEST_EQUAL(f1.getField(1, \"\/\"), \"1\")\n\tTEST_EQUAL(f1.getField(2, \"\/\"), \"2 23\")\n\tTEST_EQUAL(f1.getField(3, \"\/\"), \"\")\n\n\tTEST_EQUAL(fx.getField(), \"\")\nRESULT\n\nCHECK(startsWith(const String& text) const  throw())\n\tTEST_EQUAL(f1.startsWith(\"\/0\/\"), true)\n\tTEST_EQUAL(f1.startsWith(\"\/0\/ \/1\/ \/2 2\/\/3\/\"), true)\n\tTEST_EQUAL(f1.startsWith(\"\/0\/ \/1\/ \/2 2\/\/3\/X\"), false)\n\n\tTEST_EQUAL(fx.startsWith(\"\"), true)\nRESULT\n\nCHECK(has(const String& text) const  throw())\n\tTEST_EQUAL(f1.has(\"\/0\/\"), true)\n\tTEST_EQUAL(f1.has(\"\/1\/\"), true)\n\tTEST_EQUAL(f1.has(\"\/3\/\"), true)\n\tTEST_EQUAL(f1.has(\"X\"), false)\n\n\tTEST_EQUAL(fx.has(\"X\"), false)\n\tTEST_EQUAL(fx.has(\"\"), true)\nRESULT\n\nCHECK(search(const String& text) throw())\n\tTEST_EQUAL(f1.search(\"line3\"), true)\n\tTEST_EQUAL(f1.search(\"line4-\"), true)\n\tTEST_EQUAL(f1.search(\"line4-\"), false)\n\n  f1.rewind();\n\tf1.skipLines(2);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tf1.search(\"XXX\", true);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.search(\"line4-\"))\nRESULT\n\nCHECK(search(const String& text, const String& stop) throw())\n  f1.rewind();\n\tTEST_EQUAL(f1.search(\"line3\", \"line4\", true), true)\n  f1.rewind();\n\tTEST_EQUAL(f1.search(\"line4\", \"line3\", true), false)\n\n  f1.rewind();\n\tf1.skipLines(2);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tf1.search(\"XXX\", \"line4\", true);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.search(\"line4\", \"line3\"))\nRESULT\n\nCHECK(switchString(const std::vector<String>& data) const  throw())\n  f1.rewind();\n\tf1.readLine();\n\n\tvector<String> vec;\n\tvec.push_back(\"line\");\n\tvec.push_back(\"line1\");\n\tvec.push_back(\"line2\");\n\tvec.push_back(\"\");\n\n\tTEST_EQUAL(f1.switchString(vec), 1)\n\tf1.readLine();\n\tTEST_EQUAL(f1.switchString(vec), -1)\n\n\tTEST_EQUAL(fx.switchString(vec), 3)\nRESULT\n\nCHECK(test(const char* file, int line, bool condition, const String& msg)\n\t\t\tconst  throw(LineBasedFileError))\n\tf1.test(__FILE__, __LINE__, true, \"test\");\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, f1.test(__FILE__, __LINE__, false, \"test\") )\n\tfx.test(__FILE__, __LINE__, true, \"test\");\nRESULT\n\nCHECK(readLine() throw(LineBasedFileError))\n  f1.rewind();\n\tf1.readLine();\n\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.readLine())\n\tTEST_EQUAL(fx.getLine(), \"\")\nRESULT\n\nCHECK(skipLines(Size number = 1) throw(Exception::IndexUnderflow, LineBasedFileError))\n  f1.rewind();\n\tTEST_EQUAL(f1.skipLines(2), true)\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tTEST_EQUAL(f1.getLineNumber(), 3)\n\tTEST_EQUAL(f1.skipLines(2), false)\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.skipLines(2))\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nCHECK(rewind() throw(LineBasedFileError))\n  f1.rewind();\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\n  TEST_EXCEPTION(LineBasedFile::LineBasedFileError,fx.rewind())\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nCHECK(goToLine(Position line_number) throw(LineBasedFileError))\n  f1.rewind();\n\tf1.skipLines(4);\n\tTEST_EQUAL(f1.goToLine(3), true)\n\tTEST_EQUAL(f1.getLine(), \"line3-\" )\n\n\tTEST_EQUAL(f1.goToLine(5), true)\n\tTEST_EQUAL(f1.getLine(), \"line5-\" )\n\n\tTEST_EQUAL(f1.goToLine(6), false)\n\tTEST_EQUAL(f1.getLine(), \"line5-\" )\n\n  TEST_EXCEPTION(LineBasedFile::LineBasedFileError,fx.goToLine(2))\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<commit_msg>fixed test for cpy-constr.<commit_after>\/\/ $Id: LineBasedFile_test.C,v 1.6 2000\/10\/16 15:11:53 amoll Exp $\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <BALL\/FORMAT\/lineBasedFile.h>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSTART_TEST(class_name, \"$Id: LineBasedFile_test.C,v 1.6 2000\/10\/16 15:11:53 amoll Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\n\n\nCHECK(BALL_CREATE(LineBasedFile))\n  \/\/BAUSTELLE\nRESULT\n\nLineBasedFile* fl;\n\nCHECK(LineBasedFile() throw())\n\tfl = new LineBasedFile;\n\tTEST_NOT_EQUAL(fl, 0)\nRESULT\n\nCHECK(~LineBasedFile() throw())\n\tdelete fl;\nRESULT\n\nCHECK(LineBasedFile(const String& filename, File::OpenMode open_mode = File::IN)\n\t\t\tthrow(Exception::FileNotFound))\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLineNumber(), 1)\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EXCEPTION(Exception::FileNotFound, LineBasedFile f2(\"XXXXXXXX.txt\"))\nRESULT\n\nLineBasedFile fx;\n\nCHECK(LineBasedFile(const LineBasedFile& f) throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\tf1.close();\n\n\tLineBasedFile f2(f1);\n\tTEST_EQUAL(f2.getLineNumber(), 1)\n\tTEST_EQUAL(f2.getLine(), \"line1\")\n\tf2.readLine();\n\tTEST_EQUAL(f2.getLine(), \"\/0\/ \/1\/ \/2 2\/\/3\/\")\nRESULT\n\nCHECK(LineBasedFile& operator = (const LineBasedFile& file) throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tLineBasedFile f2;\n\tf2 = f1;\/*\n\tTEST_EQUAL(f2.getLineNumber(), 1)\n\tTEST_EQUAL(f2.getLine(), \"line1\")*\/\nRESULT\n\nCHECK(clear() throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tf1.readLine();\n\tf1.clear();\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tTEST_EQUAL(f1.getLine(), \"\")\n\n\tfx.clear();\nRESULT\n\nCHECK(getLineNumber() const  throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLineNumber(), 1)\n\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\nCHECK(getLine() const  throw())\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EQUAL(fx.getLine(), \"\")\nRESULT\n\n\nCHECK(getField(Position pos = 0, const String& quotes = \"\", \n\t\t\tconst String& delimiters = String::CHARACTER_CLASS__WHITESPACE) \n\t\t\tconst  throw(Exception::IndexUnderflow))\n\n\tTEST_EQUAL(f1.getField(), \"line1\")\n\tTEST_EQUAL(f1.getField(1), \"\")\n\tTEST_EXCEPTION(Exception::IndexUnderflow, f1.getField(-99))\n\tf1.readLine();\n\tTEST_EQUAL(f1.getField(), \"\/0\/\")\n\tTEST_EQUAL(f1.getField(1), \"\/1\/\")\n\tTEST_EQUAL(f1.getField(2), \"\/2\")\n\tTEST_EQUAL(f1.getField(0, \"\/\"), \"0\")\n\tTEST_EQUAL(f1.getField(1, \"\/\"), \"1\")\n\tTEST_EQUAL(f1.getField(2, \"\/\"), \"2 23\")\n\tTEST_EQUAL(f1.getField(3, \"\/\"), \"\")\n\n\tTEST_EQUAL(fx.getField(), \"\")\nRESULT\n\nCHECK(startsWith(const String& text) const  throw())\n\tTEST_EQUAL(f1.startsWith(\"\/0\/\"), true)\n\tTEST_EQUAL(f1.startsWith(\"\/0\/ \/1\/ \/2 2\/\/3\/\"), true)\n\tTEST_EQUAL(f1.startsWith(\"\/0\/ \/1\/ \/2 2\/\/3\/X\"), false)\n\n\tTEST_EQUAL(fx.startsWith(\"\"), true)\nRESULT\n\nCHECK(has(const String& text) const  throw())\n\tTEST_EQUAL(f1.has(\"\/0\/\"), true)\n\tTEST_EQUAL(f1.has(\"\/1\/\"), true)\n\tTEST_EQUAL(f1.has(\"\/3\/\"), true)\n\tTEST_EQUAL(f1.has(\"X\"), false)\n\n\tTEST_EQUAL(fx.has(\"X\"), false)\n\tTEST_EQUAL(fx.has(\"\"), true)\nRESULT\n\nCHECK(search(const String& text) throw())\n\tTEST_EQUAL(f1.search(\"line3\"), true)\n\tTEST_EQUAL(f1.search(\"line4-\"), true)\n\tTEST_EQUAL(f1.search(\"line4-\"), false)\n\n  f1.rewind();\n\tf1.skipLines(2);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tf1.search(\"XXX\", true);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.search(\"line4-\"))\nRESULT\n\nCHECK(search(const String& text, const String& stop) throw())\n  f1.rewind();\n\tTEST_EQUAL(f1.search(\"line3\", \"line4\", true), true)\n  f1.rewind();\n\tTEST_EQUAL(f1.search(\"line4\", \"line3\", true), false)\n\n  f1.rewind();\n\tf1.skipLines(2);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tf1.search(\"XXX\", \"line4\", true);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.search(\"line4\", \"line3\"))\nRESULT\n\nCHECK(switchString(const std::vector<String>& data) const  throw())\n  f1.rewind();\n\tf1.readLine();\n\n\tvector<String> vec;\n\tvec.push_back(\"line\");\n\tvec.push_back(\"line1\");\n\tvec.push_back(\"line2\");\n\tvec.push_back(\"\");\n\n\tTEST_EQUAL(f1.switchString(vec), 1)\n\tf1.readLine();\n\tTEST_EQUAL(f1.switchString(vec), -1)\n\n\tTEST_EQUAL(fx.switchString(vec), 3)\nRESULT\n\nCHECK(test(const char* file, int line, bool condition, const String& msg)\n\t\t\tconst  throw(LineBasedFileError))\n\tf1.test(__FILE__, __LINE__, true, \"test\");\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, f1.test(__FILE__, __LINE__, false, \"test\") )\n\tfx.test(__FILE__, __LINE__, true, \"test\");\nRESULT\n\nCHECK(readLine() throw(LineBasedFileError))\n  f1.rewind();\n\tf1.readLine();\n\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.readLine())\n\tTEST_EQUAL(fx.getLine(), \"\")\nRESULT\n\nCHECK(skipLines(Size number = 1) throw(Exception::IndexUnderflow, LineBasedFileError))\n  f1.rewind();\n\tTEST_EQUAL(f1.skipLines(2), true)\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tTEST_EQUAL(f1.getLineNumber(), 3)\n\tTEST_EQUAL(f1.skipLines(2), false)\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.skipLines(2))\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nCHECK(rewind() throw(LineBasedFileError))\n  f1.rewind();\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\n  TEST_EXCEPTION(LineBasedFile::LineBasedFileError,fx.rewind())\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nCHECK(goToLine(Position line_number) throw(LineBasedFileError))\n  f1.rewind();\n\tf1.skipLines(4);\n\tTEST_EQUAL(f1.goToLine(3), true)\n\tTEST_EQUAL(f1.getLine(), \"line3-\" )\n\n\tTEST_EQUAL(f1.goToLine(5), true)\n\tTEST_EQUAL(f1.getLine(), \"line5-\" )\n\n\tTEST_EQUAL(f1.goToLine(6), false)\n\tTEST_EQUAL(f1.getLine(), \"line5-\" )\n\n  TEST_EXCEPTION(LineBasedFile::LineBasedFileError,fx.goToLine(2))\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: rtfexp.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: nn $ $Date: 2002-03-04 19:35: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#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\n#include \"scitems.hxx\"\n#include <svx\/eeitem.hxx>\n#define ITEMID_FIELD EE_FEATURE_FIELD\n\n#ifndef _SVX_ALGITEM_HXX \/\/autogen\n#include <svx\/algitem.hxx>\n#endif\n#ifndef _SVX_WGHTITEM_HXX \/\/autogen\n#include <svx\/wghtitem.hxx>\n#endif\n#ifndef _SVX_POSTITEM_HXX \/\/autogen\n#include <svx\/postitem.hxx>\n#endif\n#ifndef _SVX_UDLNITEM_HXX \/\/autogen\n#include <svx\/udlnitem.hxx>\n#endif\n#ifndef _SVX_FONTITEM_HXX \/\/autogen\n#include <svx\/fontitem.hxx>\n#endif\n#ifndef _SVX_FHGTITEM_HXX \/\/autogen\n#include <svx\/fhgtitem.hxx>\n#endif\n#ifndef _SFXSTYLE_HXX \/\/autogen\n#include <svtools\/style.hxx>\n#endif\n#ifndef _RTFOUT_HXX\n#include <svtools\/rtfout.hxx>\n#endif\n#ifndef _RTFKEYWD_HXX\n#include <svtools\/rtfkeywd.hxx>\n#endif\n\n#include \"rtfexp.hxx\"\n#include \"filter.hxx\"\n#include \"flttools.hxx\"\n#include \"document.hxx\"\n#include \"patattr.hxx\"\n#include \"attrib.hxx\"\n#include \"cell.hxx\"\n#include \"cellform.hxx\"\n#include \"editutil.hxx\"\n#include \"stlpool.hxx\"\n\n\n\/\/------------------------------------------------------------------\n\nFltError ScExportRTF( SvStream& rStrm, ScDocument* pDoc,\n        const ScRange& rRange, const CharSet eNach )\n{\n    ScRTFExport aEx( rStrm, pDoc, rRange );\n    return aEx.Write();\n}\n\n\nScRTFExport::ScRTFExport( SvStream& rStrmP, ScDocument* pDocP, const ScRange& rRangeP )\n            :\n            ScExportBase( rStrmP, pDocP, rRangeP ),\n            pCellX( new ULONG[ MAXCOL+2 ] )\n{\n}\n\n\nScRTFExport::~ScRTFExport()\n{\n    delete [] pCellX;\n}\n\n\nULONG ScRTFExport::Write()\n{\n    rStrm << '{' << sRTF_RTF;\n#ifdef MAC\n    rStrm << sRTF_MAC << sNewLine;\n#else\n    rStrm << sRTF_ANSI << sNewLine;\n#endif\n\n#if 0\n\/\/ das ist noch nicht ausgegoren\n\/*\n    SfxStyleSheetBasePool*  pStylePool  = pDoc->GetStyleSheetPool();\n    SfxStyleSheetBase*      pStyleSheet = NULL;\n    DBG_ASSERT( pStylePool, \"StylePool not found! :-(\" );\n    pStylePool->SetSearchMask( SFX_STYLE_FAMILY_PARA, SFXSTYLEBIT_ALL );\n    pStyleSheet = pStylePool->Find( STRING_STANDARD, SFX_STYLE_FAMILY_PARA );\n    DBG_ASSERT( pStyleSheet, \"ParaStyle not found! :-(\" );\n    const SfxItemSet& rSetPara = pStyleSheet->GetItemSet();\n\n    \/\/ fonttbl\n    String aFontFamilyName(\n        ((const SvxFontItem&)(rSetPara.Get( ATTR_FONT ))).GetFamilyName() );\n    rStrm << sRTF_DEFF << '0'\n        << '{' << sRTF_FONTTBL\n        << '{' << sRTF_F << '0' << sRTF_FNIL << ' ' << aFontFamilyName.GetStr() << \";}\"\n        << '}' << sNewLine;\n\n    \/\/ hier kaeme die colortbl\n\n    \/\/ stylesheet\n    UINT32 nFontHeight =\n        ((const SvxFontHeightItem&)(rSetPara.Get( ATTR_FONT_HEIGHT ))).GetHeight();\n    rStrm << '{' << sRTF_STYLESHEET\n        << '{' << sRTF_FS << String( UINT32(nFontHeight \/ TWIPS_PER_POINT) ).GetStr()\n            << ' ' << pStyleSheet->GetName().GetStr() << \";}\"\n        << '}' << sNewLine;\n*\/\n#endif\n\n    \/\/ Daten\n    for ( USHORT nTab = aRange.aStart.Tab(); nTab <= aRange.aEnd.Tab(); nTab++ )\n    {\n        if ( nTab > aRange.aStart.Tab() )\n            rStrm << sRTF_PAR;\n        WriteTab( nTab );\n    }\n\n    rStrm << '}' << sNewLine;\n    return rStrm.GetError();\n}\n\n\nvoid ScRTFExport::WriteTab( USHORT nTab )\n{\n    rStrm << '{' << sNewLine;\n    if ( pDoc->HasTable( nTab ) )\n    {\n        memset( &pCellX[0], 0, (MAXCOL+2) * sizeof(ULONG) );\n        USHORT nCol;\n        USHORT nEndCol = aRange.aEnd.Col();\n        for ( nCol = aRange.aStart.Col(); nCol <= nEndCol; nCol++ )\n        {\n            pCellX[nCol+1] = pCellX[nCol] + pDoc->GetColWidth( nCol, nTab );\n        }\n\n        USHORT nEndRow = aRange.aEnd.Row();\n        for ( USHORT nRow = aRange.aStart.Row(); nRow <= nEndRow; nRow++ )\n        {\n            WriteRow( nTab, nRow );\n        }\n    }\n    rStrm << '}' << sNewLine;\n}\n\n\nvoid ScRTFExport::WriteRow( USHORT nTab, USHORT nRow )\n{\n    rStrm << sRTF_TROWD << sRTF_TRGAPH << \"30\" << sRTF_TRLEFT << \"-30\";\n    rStrm << sRTF_TRRH << ByteString::CreateFromInt32( pDoc->GetRowHeight( nRow, nTab ) ).GetBuffer();\n    USHORT nCol;\n    USHORT nEndCol = aRange.aEnd.Col();\n    for ( nCol = aRange.aStart.Col(); nCol <= nEndCol; nCol++ )\n    {\n        const ScPatternAttr* pAttr = pDoc->GetPattern( nCol, nRow, nTab );\n        const ScMergeAttr&      rMergeAttr      = (const ScMergeAttr&)      pAttr->GetItem( ATTR_MERGE );\n        const SvxVerJustifyItem& rVerJustifyItem= (const SvxVerJustifyItem&)pAttr->GetItem( ATTR_VER_JUSTIFY );\n\n        const sal_Char* pChar;\n\n        if ( rMergeAttr.GetColMerge() )\n            rStrm << sRTF_CLMGF;\n        else\n        {\n            const ScMergeFlagAttr& rMergeFlagAttr = (const ScMergeFlagAttr&) pAttr->GetItem( ATTR_MERGE_FLAG );\n            if ( rMergeFlagAttr.IsHorOverlapped() )\n                rStrm << sRTF_CLMRG;\n        }\n\n        switch( rVerJustifyItem.GetValue() )\n        {\n            case SVX_VER_JUSTIFY_TOP:       pChar = sRTF_CLVERTALT; break;\n            case SVX_VER_JUSTIFY_CENTER:    pChar = sRTF_CLVERTALC; break;\n            case SVX_VER_JUSTIFY_BOTTOM:    pChar = sRTF_CLVERTALB; break;\n            case SVX_VER_JUSTIFY_STANDARD:  pChar = sRTF_CLVERTALB; break;  \/\/! Bottom\n            default:                        pChar = NULL;           break;\n        }\n        if ( pChar )\n            rStrm << pChar;\n\n        rStrm << sRTF_CELLX << ByteString::CreateFromInt32( pCellX[nCol+1] ).GetBuffer();\n        if ( (nCol & 0x0F) == 0x0F )\n            rStrm << sNewLine;      \/\/ Zeilen nicht zu lang werden lassen\n    }\n    rStrm << sRTF_PARD << sRTF_PLAIN << sRTF_INTBL << sNewLine;\n\n    ULONG nStrmPos = rStrm.Tell();\n    for ( nCol = aRange.aStart.Col(); nCol <= nEndCol; nCol++ )\n    {\n        WriteCell( nTab, nRow, nCol );\n        if ( rStrm.Tell() - nStrmPos > 255 )\n        {   \/\/ Zeilen nicht zu lang werden lassen\n            rStrm << sNewLine;\n            nStrmPos = rStrm.Tell();\n        }\n    }\n    rStrm << sRTF_ROW << sNewLine;\n}\n\n\nvoid ScRTFExport::WriteCell( USHORT nTab, USHORT nRow, USHORT nCol )\n{\n    const ScPatternAttr* pAttr = pDoc->GetPattern( nCol, nRow, nTab );\n\n    const ScMergeFlagAttr& rMergeFlagAttr = (const ScMergeFlagAttr&) pAttr->GetItem( ATTR_MERGE_FLAG );\n    if ( rMergeFlagAttr.IsHorOverlapped() )\n    {\n        rStrm << sRTF_CELL;\n        return ;\n    }\n\n    ScBaseCell* pCell;\n    pDoc->GetCell( nCol, nRow, nTab, pCell );\n    BOOL bValueData;\n    String aContent;\n    if ( pCell )\n    {\n        switch ( pCell->GetCellType() )\n        {\n            case CELLTYPE_NOTE :\n                bValueData = FALSE;\n            break;      \/\/ nix\n            case CELLTYPE_EDIT :\n            {\n                bValueData = FALSE;\n                EditEngine& rEngine = GetEditEngine();\n                const EditTextObject* pObj;\n                ((const ScEditCell*)pCell)->GetData( pObj );\n                if ( pObj )\n                {\n                    rEngine.SetText( *pObj );\n                    aContent = rEngine.GetText( LINEEND_LF );   \/\/ LineFeed zwischen Absaetzen!\n                }\n            }\n            break;\n            default:\n            {\n                bValueData = pCell->HasValueData();\n                ULONG nFormat = pAttr->GetNumberFormat( pFormatter );\n                Color* pColor;\n                ScCellFormat::GetString( pCell, nFormat, aContent, &pColor, *pFormatter );\n            }\n        }\n    }\n    else\n        bValueData = FALSE;\n\n    BOOL bResetPar, bResetAttr;\n    bResetPar = bResetAttr = FALSE;\n\n    const SvxHorJustifyItem&    rHorJustifyItem = (const SvxHorJustifyItem&)pAttr->GetItem( ATTR_HOR_JUSTIFY );\n    const SvxWeightItem&        rWeightItem     = (const SvxWeightItem&)    pAttr->GetItem( ATTR_FONT_WEIGHT );\n    const SvxPostureItem&       rPostureItem    = (const SvxPostureItem&)   pAttr->GetItem( ATTR_FONT_POSTURE );\n    const SvxUnderlineItem&     rUnderlineItem  = (const SvxUnderlineItem&) pAttr->GetItem( ATTR_FONT_UNDERLINE );\n\n    const sal_Char* pChar;\n\n    switch( rHorJustifyItem.GetValue() )\n    {\n        case SVX_HOR_JUSTIFY_STANDARD:\n            pChar = (bValueData ? sRTF_QR : sRTF_QL);\n            break;\n        case SVX_HOR_JUSTIFY_CENTER:    pChar = sRTF_QC;    break;\n        case SVX_HOR_JUSTIFY_BLOCK:     pChar = sRTF_QJ;    break;\n        case SVX_HOR_JUSTIFY_RIGHT:     pChar = sRTF_QR;    break;\n        case SVX_HOR_JUSTIFY_LEFT:\n        case SVX_HOR_JUSTIFY_REPEAT:\n        default:                        pChar = sRTF_QL;    break;\n    }\n    rStrm << pChar;\n\n    if ( rWeightItem.GetWeight() >= WEIGHT_BOLD )\n    {   \/\/ bold\n        bResetAttr = TRUE;\n        rStrm << sRTF_B;\n    }\n    if ( rPostureItem.GetPosture() != ITALIC_NONE )\n    {   \/\/ italic\n        bResetAttr = TRUE;\n        rStrm << sRTF_I;\n    }\n    if ( rUnderlineItem.GetUnderline() != UNDERLINE_NONE )\n    {   \/\/ underline\n        bResetAttr = TRUE;\n        rStrm << sRTF_UL;\n    }\n\n    rStrm << ' ';\n    RTFOutFuncs::Out_String( rStrm, aContent );\n    rStrm << sRTF_CELL;\n\n    if ( bResetPar )\n        rStrm << sRTF_PARD << sRTF_INTBL;\n    if ( bResetAttr )\n        rStrm << sRTF_PLAIN;\n}\n\n\n<commit_msg>INTEGRATION: CWS rowlimit (1.2.310); FILE MERGED 2004\/03\/02 11:11:46 jmarmion 1.2.310.2: #i1967# step 5 changes. 2004\/01\/19 10:05:39 jmarmion 1.2.310.1: #i1967# SCCOL,SCROW,SCTAB replace USHORT; SCsCOL,SCsROW,SCsTAB replace short.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: rtfexp.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2004-06-04 11:05:02 $\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 \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\n#include \"scitems.hxx\"\n#include <svx\/eeitem.hxx>\n#define ITEMID_FIELD EE_FEATURE_FIELD\n\n#ifndef _SVX_ALGITEM_HXX \/\/autogen\n#include <svx\/algitem.hxx>\n#endif\n#ifndef _SVX_WGHTITEM_HXX \/\/autogen\n#include <svx\/wghtitem.hxx>\n#endif\n#ifndef _SVX_POSTITEM_HXX \/\/autogen\n#include <svx\/postitem.hxx>\n#endif\n#ifndef _SVX_UDLNITEM_HXX \/\/autogen\n#include <svx\/udlnitem.hxx>\n#endif\n#ifndef _SVX_FONTITEM_HXX \/\/autogen\n#include <svx\/fontitem.hxx>\n#endif\n#ifndef _SVX_FHGTITEM_HXX \/\/autogen\n#include <svx\/fhgtitem.hxx>\n#endif\n#ifndef _SFXSTYLE_HXX \/\/autogen\n#include <svtools\/style.hxx>\n#endif\n#ifndef _RTFOUT_HXX\n#include <svtools\/rtfout.hxx>\n#endif\n#ifndef _RTFKEYWD_HXX\n#include <svtools\/rtfkeywd.hxx>\n#endif\n\n#include \"rtfexp.hxx\"\n#include \"filter.hxx\"\n#include \"flttools.hxx\"\n#include \"document.hxx\"\n#include \"patattr.hxx\"\n#include \"attrib.hxx\"\n#include \"cell.hxx\"\n#include \"cellform.hxx\"\n#include \"editutil.hxx\"\n#include \"stlpool.hxx\"\n\n\n\/\/------------------------------------------------------------------\n\nFltError ScExportRTF( SvStream& rStrm, ScDocument* pDoc,\n        const ScRange& rRange, const CharSet eNach )\n{\n    ScRTFExport aEx( rStrm, pDoc, rRange );\n    return aEx.Write();\n}\n\n\nScRTFExport::ScRTFExport( SvStream& rStrmP, ScDocument* pDocP, const ScRange& rRangeP )\n            :\n            ScExportBase( rStrmP, pDocP, rRangeP ),\n            pCellX( new ULONG[ MAXCOL+2 ] )\n{\n}\n\n\nScRTFExport::~ScRTFExport()\n{\n    delete [] pCellX;\n}\n\n\nULONG ScRTFExport::Write()\n{\n    rStrm << '{' << sRTF_RTF;\n#ifdef MAC\n    rStrm << sRTF_MAC << sNewLine;\n#else\n    rStrm << sRTF_ANSI << sNewLine;\n#endif\n\n#if 0\n\/\/ das ist noch nicht ausgegoren\n\/*\n    SfxStyleSheetBasePool*  pStylePool  = pDoc->GetStyleSheetPool();\n    SfxStyleSheetBase*      pStyleSheet = NULL;\n    DBG_ASSERT( pStylePool, \"StylePool not found! :-(\" );\n    pStylePool->SetSearchMask( SFX_STYLE_FAMILY_PARA, SFXSTYLEBIT_ALL );\n    pStyleSheet = pStylePool->Find( STRING_STANDARD, SFX_STYLE_FAMILY_PARA );\n    DBG_ASSERT( pStyleSheet, \"ParaStyle not found! :-(\" );\n    const SfxItemSet& rSetPara = pStyleSheet->GetItemSet();\n\n    \/\/ fonttbl\n    String aFontFamilyName(\n        ((const SvxFontItem&)(rSetPara.Get( ATTR_FONT ))).GetFamilyName() );\n    rStrm << sRTF_DEFF << '0'\n        << '{' << sRTF_FONTTBL\n        << '{' << sRTF_F << '0' << sRTF_FNIL << ' ' << aFontFamilyName.GetStr() << \";}\"\n        << '}' << sNewLine;\n\n    \/\/ hier kaeme die colortbl\n\n    \/\/ stylesheet\n    UINT32 nFontHeight =\n        ((const SvxFontHeightItem&)(rSetPara.Get( ATTR_FONT_HEIGHT ))).GetHeight();\n    rStrm << '{' << sRTF_STYLESHEET\n        << '{' << sRTF_FS << String( UINT32(nFontHeight \/ TWIPS_PER_POINT) ).GetStr()\n            << ' ' << pStyleSheet->GetName().GetStr() << \";}\"\n        << '}' << sNewLine;\n*\/\n#endif\n\n    \/\/ Daten\n    for ( SCTAB nTab = aRange.aStart.Tab(); nTab <= aRange.aEnd.Tab(); nTab++ )\n    {\n        if ( nTab > aRange.aStart.Tab() )\n            rStrm << sRTF_PAR;\n        WriteTab( nTab );\n    }\n\n    rStrm << '}' << sNewLine;\n    return rStrm.GetError();\n}\n\n\nvoid ScRTFExport::WriteTab( SCTAB nTab )\n{\n    rStrm << '{' << sNewLine;\n    if ( pDoc->HasTable( nTab ) )\n    {\n        memset( &pCellX[0], 0, (MAXCOL+2) * sizeof(ULONG) );\n        SCCOL nCol;\n        SCCOL nEndCol = aRange.aEnd.Col();\n        for ( nCol = aRange.aStart.Col(); nCol <= nEndCol; nCol++ )\n        {\n            pCellX[nCol+1] = pCellX[nCol] + pDoc->GetColWidth( nCol, nTab );\n        }\n\n        SCROW nEndRow = aRange.aEnd.Row();\n        for ( SCROW nRow = aRange.aStart.Row(); nRow <= nEndRow; nRow++ )\n        {\n            WriteRow( nTab, nRow );\n        }\n    }\n    rStrm << '}' << sNewLine;\n}\n\n\nvoid ScRTFExport::WriteRow( SCTAB nTab, SCROW nRow )\n{\n    rStrm << sRTF_TROWD << sRTF_TRGAPH << \"30\" << sRTF_TRLEFT << \"-30\";\n    rStrm << sRTF_TRRH << ByteString::CreateFromInt32( pDoc->GetRowHeight( nRow, nTab ) ).GetBuffer();\n    SCCOL nCol;\n    SCCOL nEndCol = aRange.aEnd.Col();\n    for ( nCol = aRange.aStart.Col(); nCol <= nEndCol; nCol++ )\n    {\n        const ScPatternAttr* pAttr = pDoc->GetPattern( nCol, nRow, nTab );\n        const ScMergeAttr&      rMergeAttr      = (const ScMergeAttr&)      pAttr->GetItem( ATTR_MERGE );\n        const SvxVerJustifyItem& rVerJustifyItem= (const SvxVerJustifyItem&)pAttr->GetItem( ATTR_VER_JUSTIFY );\n\n        const sal_Char* pChar;\n\n        if ( rMergeAttr.GetColMerge() != 0 )\n            rStrm << sRTF_CLMGF;\n        else\n        {\n            const ScMergeFlagAttr& rMergeFlagAttr = (const ScMergeFlagAttr&) pAttr->GetItem( ATTR_MERGE_FLAG );\n            if ( rMergeFlagAttr.IsHorOverlapped() )\n                rStrm << sRTF_CLMRG;\n        }\n\n        switch( rVerJustifyItem.GetValue() )\n        {\n            case SVX_VER_JUSTIFY_TOP:       pChar = sRTF_CLVERTALT; break;\n            case SVX_VER_JUSTIFY_CENTER:    pChar = sRTF_CLVERTALC; break;\n            case SVX_VER_JUSTIFY_BOTTOM:    pChar = sRTF_CLVERTALB; break;\n            case SVX_VER_JUSTIFY_STANDARD:  pChar = sRTF_CLVERTALB; break;  \/\/! Bottom\n            default:                        pChar = NULL;           break;\n        }\n        if ( pChar )\n            rStrm << pChar;\n\n        rStrm << sRTF_CELLX << ByteString::CreateFromInt32( pCellX[nCol+1] ).GetBuffer();\n        if ( (nCol & 0x0F) == 0x0F )\n            rStrm << sNewLine;      \/\/ Zeilen nicht zu lang werden lassen\n    }\n    rStrm << sRTF_PARD << sRTF_PLAIN << sRTF_INTBL << sNewLine;\n\n    ULONG nStrmPos = rStrm.Tell();\n    for ( nCol = aRange.aStart.Col(); nCol <= nEndCol; nCol++ )\n    {\n        WriteCell( nTab, nRow, nCol );\n        if ( rStrm.Tell() - nStrmPos > 255 )\n        {   \/\/ Zeilen nicht zu lang werden lassen\n            rStrm << sNewLine;\n            nStrmPos = rStrm.Tell();\n        }\n    }\n    rStrm << sRTF_ROW << sNewLine;\n}\n\n\nvoid ScRTFExport::WriteCell( SCTAB nTab, SCROW nRow, SCCOL nCol )\n{\n    const ScPatternAttr* pAttr = pDoc->GetPattern( nCol, nRow, nTab );\n\n    const ScMergeFlagAttr& rMergeFlagAttr = (const ScMergeFlagAttr&) pAttr->GetItem( ATTR_MERGE_FLAG );\n    if ( rMergeFlagAttr.IsHorOverlapped() )\n    {\n        rStrm << sRTF_CELL;\n        return ;\n    }\n\n    ScBaseCell* pCell;\n    pDoc->GetCell( nCol, nRow, nTab, pCell );\n    BOOL bValueData;\n    String aContent;\n    if ( pCell )\n    {\n        switch ( pCell->GetCellType() )\n        {\n            case CELLTYPE_NOTE :\n                bValueData = FALSE;\n            break;      \/\/ nix\n            case CELLTYPE_EDIT :\n            {\n                bValueData = FALSE;\n                EditEngine& rEngine = GetEditEngine();\n                const EditTextObject* pObj;\n                ((const ScEditCell*)pCell)->GetData( pObj );\n                if ( pObj )\n                {\n                    rEngine.SetText( *pObj );\n                    aContent = rEngine.GetText( LINEEND_LF );   \/\/ LineFeed zwischen Absaetzen!\n                }\n            }\n            break;\n            default:\n            {\n                bValueData = pCell->HasValueData();\n                ULONG nFormat = pAttr->GetNumberFormat( pFormatter );\n                Color* pColor;\n                ScCellFormat::GetString( pCell, nFormat, aContent, &pColor, *pFormatter );\n            }\n        }\n    }\n    else\n        bValueData = FALSE;\n\n    BOOL bResetPar, bResetAttr;\n    bResetPar = bResetAttr = FALSE;\n\n    const SvxHorJustifyItem&    rHorJustifyItem = (const SvxHorJustifyItem&)pAttr->GetItem( ATTR_HOR_JUSTIFY );\n    const SvxWeightItem&        rWeightItem     = (const SvxWeightItem&)    pAttr->GetItem( ATTR_FONT_WEIGHT );\n    const SvxPostureItem&       rPostureItem    = (const SvxPostureItem&)   pAttr->GetItem( ATTR_FONT_POSTURE );\n    const SvxUnderlineItem&     rUnderlineItem  = (const SvxUnderlineItem&) pAttr->GetItem( ATTR_FONT_UNDERLINE );\n\n    const sal_Char* pChar;\n\n    switch( rHorJustifyItem.GetValue() )\n    {\n        case SVX_HOR_JUSTIFY_STANDARD:\n            pChar = (bValueData ? sRTF_QR : sRTF_QL);\n            break;\n        case SVX_HOR_JUSTIFY_CENTER:    pChar = sRTF_QC;    break;\n        case SVX_HOR_JUSTIFY_BLOCK:     pChar = sRTF_QJ;    break;\n        case SVX_HOR_JUSTIFY_RIGHT:     pChar = sRTF_QR;    break;\n        case SVX_HOR_JUSTIFY_LEFT:\n        case SVX_HOR_JUSTIFY_REPEAT:\n        default:                        pChar = sRTF_QL;    break;\n    }\n    rStrm << pChar;\n\n    if ( rWeightItem.GetWeight() >= WEIGHT_BOLD )\n    {   \/\/ bold\n        bResetAttr = TRUE;\n        rStrm << sRTF_B;\n    }\n    if ( rPostureItem.GetPosture() != ITALIC_NONE )\n    {   \/\/ italic\n        bResetAttr = TRUE;\n        rStrm << sRTF_I;\n    }\n    if ( rUnderlineItem.GetUnderline() != UNDERLINE_NONE )\n    {   \/\/ underline\n        bResetAttr = TRUE;\n        rStrm << sRTF_UL;\n    }\n\n    rStrm << ' ';\n    RTFOutFuncs::Out_String( rStrm, aContent );\n    rStrm << sRTF_CELL;\n\n    if ( bResetPar )\n        rStrm << sRTF_PARD << sRTF_INTBL;\n    if ( bResetAttr )\n        rStrm << sRTF_PLAIN;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id: RuleEvaluator_test.C,v 1.1 2000\/05\/24 16:10:59 oliver Exp $\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <BALL\/MOLMEC\/COMMON\/ruleEvaluator.h>\n#include <BALL\/FORMAT\/INIFile.h>\n#include <BALL\/FORMAT\/HINFile.h>\n#include <BALL\/KERNEL\/system.h>\n#include <BALL\/KERNEL\/molecule.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSTART_TEST(RuleEvaluator, \"$Id: RuleEvaluator_test.C,v 1.1 2000\/05\/24 16:10:59 oliver Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\n\nRuleEvaluator* eval;\nCHECK(RuleEvaluator::RuleEvaluator())\n  eval = new RuleEvaluator;\n\tTEST_NOT_EQUAL(eval, 0)\nRESULT\n\n\nCHECK(RuleEvaluator::~RuleEvaluator())\n  delete eval;\nRESULT\n\n\nCHECK(RuleEvaluator::setPrefix() const )\n\teval = new RuleEvaluator;\n\teval->setPrefix(\"PREFIX\");\nRESULT\n\n\nCHECK(RuleEvaluator::getPrefix() const )\n  TEST_EQUAL(eval->getPrefix(), \"PREFIX\")\n\teval->setPrefix(\"\");\n  TEST_EQUAL(eval->getPrefix(), \"\")\nRESULT\n\nINIFile ini(\"data\/RuleEvaluator_test.ini\");\nini.read();\nCHECK(RuleEvaluator::RuleEvaluator(INIFile& file, const String& prefix))\n\tTEST_EQUAL(ini.isValid(), true)\n\tRuleEvaluator eval(ini, \"TEST1\");\n\tTEST_EQUAL(eval.getPrefix(), \"TEST1\")\nRESULT\n\n\nCHECK(RuleEvaluator::RuleEvaluator(const RuleEvaluator& evaluator))\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::initialize(INIFile& file, const String& prefix))\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::clear() const )\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::destroy() const )\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::RuleEvaluator& operator = (const RuleEvaluator& evaluator))\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::set(const RuleEvaluator& evaluator))\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::String operator () (const Atom& atom) const )\n\tRuleEvaluator eval(ini, \"TEST1\");\n\tHINFile f(\"data\/RuleEvaluator_test.hin\");\n\tSystem S;\n\tf >> S;\n\tf.close();\n\tTEST_EQUAL(S.countAtoms(), 5)\n\t\n\tAtomIterator it = S.beginAtom();\n\tSTATUS(\"before\")\n\tTEST_EQUAL(eval.operator()(*it), \"F-def\")\n\tSTATUS(\"after\")\t\n\t++it;\n\tSTATUS(\"before\")\n\tTEST_EQUAL(eval.operator()(*it), \"CT\")\n\tSTATUS(\"after\")\t\n\t++it;\n\tSTATUS(\"before\")\n\tTEST_EQUAL(eval.operator()(*it), \"\")\n\tSTATUS(\"after\")\t\n\t++it;\n\tSTATUS(\"before\")\n\tTEST_EQUAL(eval.operator()(*it), \"\")\n\tSTATUS(\"after\")\t\n\t++it;\n\tSTATUS(\"before\")\n\tTEST_EQUAL(eval.operator()(*it), \"\")\nRESULT\n\n\nCHECK(RuleEvaluator::isValid() const )\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::dump(std::ostream& s = std::cout, Size indent_depth = 0) const )\n  \/\/BAUSTELLE\nRESULT\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<commit_msg>changed: removed debugging stuff<commit_after>\/\/ $Id: RuleEvaluator_test.C,v 1.2 2000\/05\/24 18:37:40 oliver Exp $\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <BALL\/MOLMEC\/COMMON\/ruleEvaluator.h>\n#include <BALL\/FORMAT\/INIFile.h>\n#include <BALL\/FORMAT\/HINFile.h>\n#include <BALL\/KERNEL\/system.h>\n#include <BALL\/KERNEL\/molecule.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSTART_TEST(RuleEvaluator, \"$Id: RuleEvaluator_test.C,v 1.2 2000\/05\/24 18:37:40 oliver Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\n\nRuleEvaluator* eval;\nCHECK(RuleEvaluator::RuleEvaluator())\n  eval = new RuleEvaluator;\n\tTEST_NOT_EQUAL(eval, 0)\nRESULT\n\n\nCHECK(RuleEvaluator::~RuleEvaluator())\n  delete eval;\nRESULT\n\n\nCHECK(RuleEvaluator::setPrefix() const )\n\teval = new RuleEvaluator;\n\teval->setPrefix(\"PREFIX\");\nRESULT\n\n\nCHECK(RuleEvaluator::getPrefix() const )\n  TEST_EQUAL(eval->getPrefix(), \"PREFIX\")\n\teval->setPrefix(\"\");\n  TEST_EQUAL(eval->getPrefix(), \"\")\nRESULT\n\nINIFile ini(\"data\/RuleEvaluator_test.ini\");\nini.read();\nCHECK(RuleEvaluator::RuleEvaluator(INIFile& file, const String& prefix))\n\tTEST_EQUAL(ini.isValid(), true)\n\tRuleEvaluator eval(ini, \"TEST1\");\n\tTEST_EQUAL(eval.getPrefix(), \"TEST1\")\nRESULT\n\n\nCHECK(RuleEvaluator::RuleEvaluator(const RuleEvaluator& evaluator))\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::initialize(INIFile& file, const String& prefix))\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::clear() const )\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::destroy() const )\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::RuleEvaluator& operator = (const RuleEvaluator& evaluator))\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::set(const RuleEvaluator& evaluator))\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::String operator () (const Atom& atom) const )\n\tRuleEvaluator eval(ini, \"TEST1\");\n\tHINFile f(\"data\/RuleEvaluator_test.hin\");\n\tSystem S;\n\tf >> S;\n\tf.close();\n\tTEST_EQUAL(S.countAtoms(), 5)\n\t\n\tAtomIterator it = S.beginAtom();\n\tTEST_EQUAL(eval.operator()(*it), \"F-def\")\n\t++it;\n\tTEST_EQUAL(eval.operator()(*it), \"CT\")\n\t++it;\n\tTEST_EQUAL(eval.operator()(*it), \"\")\n\t++it;\n\tTEST_EQUAL(eval.operator()(*it), \"\")\n\t++it;\n\tTEST_EQUAL(eval.operator()(*it), \"\")\nRESULT\n\n\nCHECK(RuleEvaluator::isValid() const )\n  \/\/BAUSTELLE\nRESULT\n\n\nCHECK(RuleEvaluator::dump(std::ostream& s = std::cout, Size indent_depth = 0) const )\n  \/\/BAUSTELLE\nRESULT\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: dpgroupdlg.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: hr $ $Date: 2004-08-03 11:37: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#ifndef SC_DPGROUPDLG_HXX\n#define SC_DPGROUPDLG_HXX\n\n#ifndef _FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _DIALOG_HXX\n#include <vcl\/dialog.hxx>\n#endif\n#ifndef _BUTTON_HXX\n#include <vcl\/button.hxx>\n#endif\n#ifndef _SV_FIELD_HXX\n#include <vcl\/field.hxx>\n#endif\n#ifndef _SVX_CHECKLBX_HXX\n#include <svx\/checklbx.hxx>\n#endif\n#ifndef SC_EDITFIELD_HXX\n#include \"editfield.hxx\"\n#endif\n\n#ifndef SC_DPGROUP_HXX\n#include \"dpgroup.hxx\"\n#endif\n\n\/\/ ============================================================================\n\nclass ScDPGroupEditHelper\n{\npublic:\n    explicit            ScDPGroupEditHelper(\n                            RadioButton& rRbAuto, RadioButton& rRbMan,\n                            Edit& rEdValue );\n\n    bool                IsAuto() const;\n    double              GetValue() const;\n    void                SetValue( bool bAuto, double fValue );\n\nprivate:\n    virtual bool        ImplGetValue( double& rfValue ) const = 0;\n    virtual void        ImplSetValue( double fValue ) = 0;\n\n    DECL_LINK( ClickHdl, RadioButton* );\n\nprivate:\n    RadioButton&        mrRbAuto;\n    RadioButton&        mrRbMan;\n    Edit&               mrEdValue;\n};\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ScDPNumGroupEditHelper : public ScDPGroupEditHelper\n{\npublic:\n    explicit            ScDPNumGroupEditHelper(\n                            RadioButton& rRbAuto, RadioButton& rRbMan,\n                            ScDoubleField& rEdValue );\n\nprivate:\n    virtual bool        ImplGetValue( double& rfValue ) const;\n    virtual void        ImplSetValue( double fValue );\n\nprivate:\n    ScDoubleField&      mrEdValue;\n};\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ScDPDateGroupEditHelper : public ScDPGroupEditHelper\n{\npublic:\n    explicit            ScDPDateGroupEditHelper(\n                            RadioButton& rRbAuto, RadioButton& rRbMan,\n                            DateField& rEdValue, const Date& rNullDate );\n\nprivate:\n    virtual bool        ImplGetValue( double& rfValue ) const;\n    virtual void        ImplSetValue( double fValue );\n\nprivate:\n    DateField&          mrEdValue;\n    Date                maNullDate;\n};\n\n\/\/ ============================================================================\n\/\/ ============================================================================\n\nclass ScDPNumGroupDlg : public ModalDialog\n{\npublic:\n    explicit            ScDPNumGroupDlg( Window* pParent, const ScDPNumGroupInfo& rInfo );\n\n    ScDPNumGroupInfo    GetGroupInfo() const;\n\nprivate:\n    FixedLine           maFlStart;\n    RadioButton         maRbAutoStart;\n    RadioButton         maRbManStart;\n    ScDoubleField       maEdStart;\n    FixedLine           maFlEnd;\n    RadioButton         maRbAutoEnd;\n    RadioButton         maRbManEnd;\n    ScDoubleField       maEdEnd;\n    FixedLine           maFlBy;\n    ScDoubleField       maEdBy;\n    OKButton            maBtnOk;\n    CancelButton        maBtnCancel;\n    HelpButton          maBtnHelp;\n    ScDPNumGroupEditHelper maStartHelper;\n    ScDPNumGroupEditHelper maEndHelper;\n};\n\n\/\/ ============================================================================\n\nclass ScDPDateGroupDlg : public ModalDialog\n{\npublic:\n    explicit            ScDPDateGroupDlg( Window* pParent, const ScDPNumGroupInfo& rInfo,\n                            sal_Int32 nDatePart, const Date& rNullDate );\n\n    ScDPNumGroupInfo    GetGroupInfo() const;\n    sal_Int32           GetDatePart() const;\n\nprivate:\n    DECL_LINK( ClickHdl, RadioButton* );\n    DECL_LINK( CheckHdl, SvxCheckListBox* );\n\nprivate:\n    FixedLine           maFlStart;\n    RadioButton         maRbAutoStart;\n    RadioButton         maRbManStart;\n    DateField           maEdStart;\n    FixedLine           maFlEnd;\n    RadioButton         maRbAutoEnd;\n    RadioButton         maRbManEnd;\n    DateField           maEdEnd;\n    FixedLine           maFlBy;\n    RadioButton         maRbNumDays;\n    RadioButton         maRbUnits;\n    NumericField        maEdNumDays;\n    SvxCheckListBox     maLbUnits;\n    OKButton            maBtnOk;\n    CancelButton        maBtnCancel;\n    HelpButton          maBtnHelp;\n    ScDPDateGroupEditHelper maStartHelper;\n    ScDPDateGroupEditHelper maEndHelper;\n};\n\n\/\/ ============================================================================\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.368); FILE MERGED 2005\/09\/05 15:05:17 rt 1.2.368.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: dpgroupdlg.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 21:21: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 SC_DPGROUPDLG_HXX\n#define SC_DPGROUPDLG_HXX\n\n#ifndef _FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _DIALOG_HXX\n#include <vcl\/dialog.hxx>\n#endif\n#ifndef _BUTTON_HXX\n#include <vcl\/button.hxx>\n#endif\n#ifndef _SV_FIELD_HXX\n#include <vcl\/field.hxx>\n#endif\n#ifndef _SVX_CHECKLBX_HXX\n#include <svx\/checklbx.hxx>\n#endif\n#ifndef SC_EDITFIELD_HXX\n#include \"editfield.hxx\"\n#endif\n\n#ifndef SC_DPGROUP_HXX\n#include \"dpgroup.hxx\"\n#endif\n\n\/\/ ============================================================================\n\nclass ScDPGroupEditHelper\n{\npublic:\n    explicit            ScDPGroupEditHelper(\n                            RadioButton& rRbAuto, RadioButton& rRbMan,\n                            Edit& rEdValue );\n\n    bool                IsAuto() const;\n    double              GetValue() const;\n    void                SetValue( bool bAuto, double fValue );\n\nprivate:\n    virtual bool        ImplGetValue( double& rfValue ) const = 0;\n    virtual void        ImplSetValue( double fValue ) = 0;\n\n    DECL_LINK( ClickHdl, RadioButton* );\n\nprivate:\n    RadioButton&        mrRbAuto;\n    RadioButton&        mrRbMan;\n    Edit&               mrEdValue;\n};\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ScDPNumGroupEditHelper : public ScDPGroupEditHelper\n{\npublic:\n    explicit            ScDPNumGroupEditHelper(\n                            RadioButton& rRbAuto, RadioButton& rRbMan,\n                            ScDoubleField& rEdValue );\n\nprivate:\n    virtual bool        ImplGetValue( double& rfValue ) const;\n    virtual void        ImplSetValue( double fValue );\n\nprivate:\n    ScDoubleField&      mrEdValue;\n};\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ScDPDateGroupEditHelper : public ScDPGroupEditHelper\n{\npublic:\n    explicit            ScDPDateGroupEditHelper(\n                            RadioButton& rRbAuto, RadioButton& rRbMan,\n                            DateField& rEdValue, const Date& rNullDate );\n\nprivate:\n    virtual bool        ImplGetValue( double& rfValue ) const;\n    virtual void        ImplSetValue( double fValue );\n\nprivate:\n    DateField&          mrEdValue;\n    Date                maNullDate;\n};\n\n\/\/ ============================================================================\n\/\/ ============================================================================\n\nclass ScDPNumGroupDlg : public ModalDialog\n{\npublic:\n    explicit            ScDPNumGroupDlg( Window* pParent, const ScDPNumGroupInfo& rInfo );\n\n    ScDPNumGroupInfo    GetGroupInfo() const;\n\nprivate:\n    FixedLine           maFlStart;\n    RadioButton         maRbAutoStart;\n    RadioButton         maRbManStart;\n    ScDoubleField       maEdStart;\n    FixedLine           maFlEnd;\n    RadioButton         maRbAutoEnd;\n    RadioButton         maRbManEnd;\n    ScDoubleField       maEdEnd;\n    FixedLine           maFlBy;\n    ScDoubleField       maEdBy;\n    OKButton            maBtnOk;\n    CancelButton        maBtnCancel;\n    HelpButton          maBtnHelp;\n    ScDPNumGroupEditHelper maStartHelper;\n    ScDPNumGroupEditHelper maEndHelper;\n};\n\n\/\/ ============================================================================\n\nclass ScDPDateGroupDlg : public ModalDialog\n{\npublic:\n    explicit            ScDPDateGroupDlg( Window* pParent, const ScDPNumGroupInfo& rInfo,\n                            sal_Int32 nDatePart, const Date& rNullDate );\n\n    ScDPNumGroupInfo    GetGroupInfo() const;\n    sal_Int32           GetDatePart() const;\n\nprivate:\n    DECL_LINK( ClickHdl, RadioButton* );\n    DECL_LINK( CheckHdl, SvxCheckListBox* );\n\nprivate:\n    FixedLine           maFlStart;\n    RadioButton         maRbAutoStart;\n    RadioButton         maRbManStart;\n    DateField           maEdStart;\n    FixedLine           maFlEnd;\n    RadioButton         maRbAutoEnd;\n    RadioButton         maRbManEnd;\n    DateField           maEdEnd;\n    FixedLine           maFlBy;\n    RadioButton         maRbNumDays;\n    RadioButton         maRbUnits;\n    NumericField        maEdNumDays;\n    SvxCheckListBox     maLbUnits;\n    OKButton            maBtnOk;\n    CancelButton        maBtnCancel;\n    HelpButton          maBtnHelp;\n    ScDPDateGroupEditHelper maStartHelper;\n    ScDPDateGroupEditHelper maEndHelper;\n};\n\n\/\/ ============================================================================\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>problem 30<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"Planar1D.h\"\nusing namespace GeFiCa;\n\nvoid Planar1D::Initialize()\n{\n   \/\/ The step length is calculated with the following equation:\n   \/\/ BEGIN_HTML\n   \/\/ <pre>\n   \/\/      double stepLength=(UpperBound-LowerBound)\/(n-1);\n   \/\/ <\/pre>\n   \/\/ END_HTML\n   \/\/ If the inner radius is not larger than the outer radius,\n   \/\/ no grid will be created\n   if (LowerBound>=UpperBound) {\n      Warning(\"CreateGridWithFixedStepLength\",\n            \"Lower bound (%f) >= upper bound (%f)! No grid is created!\",\n            LowerBound, UpperBound);\n      return;\n   }\n   double steplength=(UpperBound-LowerBound)\/(n-1);\n   SetStepLength(steplength);\n   for (int i=0; i<n; i++) fC1[i]=fC1[i]+LowerBound;\n   fIsFixed[0]=true;\n   fIsFixed[n-1]=true;\n   double slope = (Vpos-Vneg)\/(n-1);\n   for (int i=0; i<n; i++) fPotential[i]=Vneg+slope*i;\n}\n\/\/_____________________________________________________________________________\n\/\/\n\/\/Here we calculate the field analytically using the fomrula (d^2 phi\/d phi^2) = rho\/epsilon.\n\/\/Rho in this case is just the impurity density. This gives us a differential equation \n\/\/the type phi(x)= ax^2 + bx + c . We can find a, b, and c by evaluating this equation\n\/\/at the boundary conditions where we know the potential\n\/\/ we know:\n\/\/ a=rho\/(2*epsilon)\n\/\/ b=(Vneg-Vpos-a(LowerBound^2-UpperBound^2))\/(LowerBound-UpperBound)\n\/\/ c=Vneg-a*LowerBound^2-LowerBound(Vneg-Vpos-a*(LowerBound^2-UpperBound^2))\/(LowerBound-UpperBound)\n\n\/\/ Potential problem could be resulting from the deffinition of volt and impurity.\n\/\/Impurity is in cm while the SI unit of volt invlolves meters.\n\n\/\/ bool Planar1D::Analytic()\n\/\/ {\n   \/\/ double d=LowerBound-UpperBound;\n   \/\/ double dSquare=LowerBound*LowerBound-UpperBound*UpperBound;\n   \/\/ double Aconst=fImpurity[0]*Qe\/2\/epsilon;\n   \/\/ double Bconst=(Vneg-Vpos-Aconst*dSquare)\/d;\n   \/\/ double Cconst=Vneg-Aconst*LowerBound*LowerBound-LowerBound*(Vneg-Vpos-Aconst*dSquare)\/d;\n   \/\/ for (int i=0; i<n; i++) {\n     \/\/ fPotential[i] = Aconst*fC1[i]*fC1[i]+Bconst*fC1[i]+Cconst;\n     \/\/ fE1[i]=(fPotential[i+1]-fPotential[i-1])\/(fDistanceToNext[i]+fDistanceToPrevious[i]);\n   \/\/ }\n  \/\/ return true;\n\/\/ }\n\n\n\nbool Planar1D::Analytic()\n{\n   double d=UpperBound-LowerBound;\/\/thickness or depth of the detector\n   double cnst1=fPotential[0];\n   double cnst2=(fPotential[n-1]-fImpurity[n-1]*Qe\/2\/epsilon*d*d-cnst1)\/d;\n   for (int i=0; i<n; i++) {\n      fPotential[i] = fImpurity[i]*Qe\/2\/epsilon*fC1[i]*fC1[i]+cnst2*fC1[i]+cnst1;\n      fE1[i]=(fPotential[i+1]-fPotential[i-1])\/(fDistanceToNext[i]+fDistanceToPrevious[i]);\n   }\n   return true;\n}\n\/\/_____________________________________________________________________________\n\/\/\nbool Planar1D::CalculateField(EMethod method)\n{\n   if(!fIsLoaded)Initialize();\n   return X::CalculateField(method);\n}\n<commit_msg>final edits to planar1d<commit_after>#include \"Planar1D.h\"\nusing namespace GeFiCa;\n\nvoid Planar1D::Initialize()\n{\n   \/\/ The step length is calculated with the following equation:\n   \/\/ BEGIN_HTML\n   \/\/ <pre>\n   \/\/      double stepLength=(UpperBound-LowerBound)\/(n-1);\n   \/\/ <\/pre>\n   \/\/ END_HTML\n   \/\/ If the inner radius is not larger than the outer radius,\n   \/\/ no grid will be created\n   if (LowerBound>=UpperBound) {\n      Warning(\"CreateGridWithFixedStepLength\",\n            \"Lower bound (%f) >= upper bound (%f)! No grid is created!\",\n            LowerBound, UpperBound);\n      return;\n   }\n   double steplength=(UpperBound-LowerBound)\/(n-1);\n   SetStepLength(steplength);\n   for (int i=0; i<n; i++) fC1[i]=fC1[i]+LowerBound;\n   fIsFixed[0]=true;\n   fIsFixed[n-1]=true;\n   double slope = (Vpos-Vneg)\/(n-1);\n   for (int i=0; i<n; i++) fPotential[i]=Vneg+slope*i;\n}\n\/\/_____________________________________________________________________________\n\/\/\n\/\/Here we calculate the field analytically using the fomrula (d^2 phi\/d phi^2) = rho\/epsilon.\n\/\/Rho in this case is just the impurity density. This gives us a differential equation \n\/\/the type phi(x)= ax^2 + bx + c . We can find a, b, and c by evaluating this equation\n\/\/at the boundary conditions where we know the potential\n\/\/ we know:\n\/\/ a=rho\/(2*epsilon)\n\/\/ b=(Vneg-Vpos-a(LowerBound^2-UpperBound^2))\/(LowerBound-UpperBound)\n\/\/ c=Vneg-a*LowerBound^2-LowerBound(Vneg-Vpos-a*(LowerBound^2-UpperBound^2))\/(LowerBound-UpperBound)\n\n\/\/ Potential problem could be resulting from the deffinition of volt and impurity.\n\/\/Impurity is in cm while the SI unit of volt invlolves meters.\n#include  <cmath>\nbool Planar1D::Analytic()\n{\n   double d=LowerBound-UpperBound;\n   double dSquare=LowerBound*LowerBound-UpperBound*UpperBound;\n   double Aconst=fImpurity[0]*Qe\/2\/epsilon;\n   double Bconst=(Vneg-Vpos-Aconst*dSquare)\/d;\n   double Cconst=Vneg-Aconst*LowerBound*LowerBound-LowerBound*(Vneg-Vpos-Aconst*dSquare)\/d;\n   for (int i=0; i<n; i++) {\n     fPotential[i] = Aconst*fC1[i]*fC1[i]+Bconst*fC1[i]+Cconst;\n     fE1[i]=(fPotential[i+1]-fPotential[i-1])\/(fDistanceToNext[i]+fDistanceToPrevious[i]);\n   }\n  return true;\n}\n\n\n\n\/\/ bool Planar1D::Analytic()\n\/\/ {\n   \/\/ double d=UpperBound-LowerBound;\/\/thickness or depth of the detector\n   \/\/ double cnst1=fPotential[0];\n   \/\/ double cnst2=(fPotential[n-1]-fImpurity[n-1]*Qe\/2\/epsilon*d*d-cnst1)\/d;\n   \/\/ for (int i=0; i<n; i++) {\n      \/\/ fPotential[i] = fImpurity[i]*Qe\/2\/epsilon*fC1[i]*fC1[i]+cnst2*fC1[i]+cnst1;\n      \/\/ fE1[i]=(fPotential[i+1]-fPotential[i-1])\/(fDistanceToNext[i]+fDistanceToPrevious[i]);\n   \/\/ }\n   \/\/ return true;\n\/\/ }\n\/\/_____________________________________________________________________________\n\/\/\nbool Planar1D::CalculateField(EMethod method)\n{\n   if(!fIsLoaded)Initialize();\n   return X::CalculateField(method);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015, 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 <sys\/mman.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <mpi.h>\n#include <string.h>\n#include \"gtest\/gtest.h\"\n#include \"SharedMemory.hpp\"\n\nclass MPISharedMemoryTest: public :: testing :: Test\n{\n    public:\n        MPISharedMemoryTest();\n        virtual ~MPISharedMemoryTest();\n        std::string m_shm_key;\n};\n\nMPISharedMemoryTest::MPISharedMemoryTest()\n    : m_shm_key(\"\/geopm_shared_memory_test\")\n{\n    int rank;\n    std::string shm_key(m_shm_key.c_str());\n    MPI_Comm_rank(MPI_COMM_WORLD, &rank);\n    if (!rank) {\n        shm_unlink(shm_key.c_str());\n    }\n    MPI_Barrier(MPI_COMM_WORLD);\n}\n\nMPISharedMemoryTest::~MPISharedMemoryTest()\n{\n\n}\n\nTEST_F(MPISharedMemoryTest, hello)\n{\n    int rank;\n    const char *test_string = \"THIS IS THE TEST STRING\";\n    geopm::SharedMemory *sm = NULL;\n    geopm::SharedMemoryUser *smu = NULL;\n\n    MPI_Comm_rank(MPI_COMM_WORLD, &rank);\n    if (rank == 0) {\n        sm = new geopm::SharedMemory(m_shm_key, 128);\n        strcpy((char *)sm->pointer(), test_string);\n    }\n    else if (rank == 1) {\n        smu = new geopm::SharedMemoryUser(m_shm_key, 128, 5);\n        EXPECT_EQ(0, strncmp((char *)smu->pointer(), test_string, strlen(test_string)));\n    }\n    MPI_Barrier(MPI_COMM_WORLD);\n    delete sm;\n    delete smu;\n}\n<commit_msg>Fixed race condition in MPISharedMemoryTest.cpp.<commit_after>\/*\n * Copyright (c) 2015, 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 <sys\/mman.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <mpi.h>\n#include <string.h>\n#include \"gtest\/gtest.h\"\n#include \"SharedMemory.hpp\"\n\nclass MPISharedMemoryTest: public :: testing :: Test\n{\n    public:\n        MPISharedMemoryTest();\n        virtual ~MPISharedMemoryTest();\n        std::string m_shm_key;\n};\n\nMPISharedMemoryTest::MPISharedMemoryTest()\n    : m_shm_key(\"\/geopm_shared_memory_test\")\n{\n    int rank;\n    std::string shm_key(m_shm_key.c_str());\n    MPI_Comm_rank(MPI_COMM_WORLD, &rank);\n    if (!rank) {\n        shm_unlink(shm_key.c_str());\n    }\n    MPI_Barrier(MPI_COMM_WORLD);\n}\n\nMPISharedMemoryTest::~MPISharedMemoryTest()\n{\n\n}\n\nTEST_F(MPISharedMemoryTest, hello)\n{\n    int rank;\n    const char *test_string = \"THIS IS THE TEST STRING\";\n    geopm::SharedMemory *sm = NULL;\n    geopm::SharedMemoryUser *smu = NULL;\n\n    MPI_Comm_rank(MPI_COMM_WORLD, &rank);\n    if (rank == 0) {\n        sm = new geopm::SharedMemory(m_shm_key, 128);\n        strcpy((char *)sm->pointer(), test_string);\n    }\n    MPI_Barrier(MPI_COMM_WORLD);\n    if (rank == 1) {\n        smu = new geopm::SharedMemoryUser(m_shm_key, 128, 5);\n        EXPECT_EQ(0, strncmp((char *)smu->pointer(), test_string, strlen(test_string)));\n    }\n    MPI_Barrier(MPI_COMM_WORLD);\n    delete sm;\n    delete smu;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Mathematics Copyright (c) 2005 - 2011 G-Truc Creation (www.g-truc.net)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Created : 2008-08-31\n\/\/ Updated : 2011-09-19\n\/\/ Licence : This source is under MIT License\n\/\/ File    : test\/core\/type_vec3.cpp\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/half_float.hpp>\n\nstatic int test_vec3_operators()\n{\n\tglm::vec3 A(1.0f);\n\tglm::vec3 B(1.0f);\n\tbool R = A != B;\n\tbool S = A == B;\n\n\treturn (S && !R) ? 0 : 1;\n}\n\nint test_vec3_size()\n{\n\tint Error = 0;\n\t\n\tError += sizeof(glm::vec3) == sizeof(glm::mediump_vec3) ? 0 : 1;\n\tError += 12 == sizeof(glm::mediump_vec3) ? 0 : 1;\n\tError += sizeof(glm::dvec3) == sizeof(glm::highp_vec3) ? 0 : 1;\n\tError += 24 == sizeof(glm::highp_vec3) ? 0 : 1;\n\tError += glm::vec3().length() == 3 ? 0 : 1;\n\tError += glm::dvec3().length() == 3 ? 0 : 1;\n\t\n\treturn Error;\n}\n\nint test_vec3_swizzle3_2()\n{\n    int Error = 0;\n\n    glm::vec3 v(1, 2, 3);\n    glm::vec2 u;\n\n    \/\/ Can not assign a vec3 swizzle to a vec2\n    \/\/u = v.xyz;    \/\/Illegal\n    \/\/u = v.rgb;    \/\/Illegal\n    \/\/u = v.stp;    \/\/Illegal\n\n    u = v.xx;       Error += (u.x == 1.0f && u.y == 1.0f) ? 0 : 1;\n    u = v.xy;       Error += (u.x == 1.0f && u.y == 2.0f) ? 0 : 1;\n    u = v.xz;       Error += (u.x == 1.0f && u.y == 3.0f) ? 0 : 1;\n    u = v.yx;       Error += (u.x == 2.0f && u.y == 1.0f) ? 0 : 1;\n    u = v.yy;       Error += (u.x == 2.0f && u.y == 2.0f) ? 0 : 1;\n    u = v.yz;       Error += (u.x == 2.0f && u.y == 3.0f) ? 0 : 1;\n    u = v.zx;       Error += (u.x == 3.0f && u.y == 1.0f) ? 0 : 1;\n    u = v.zy;       Error += (u.x == 3.0f && u.y == 2.0f) ? 0 : 1;\n    u = v.zz;       Error += (u.x == 3.0f && u.y == 3.0f) ? 0 : 1;\n\n    u = v.rr;       Error += (u.r == 1.0f && u.g == 1.0f) ? 0 : 1;\n    u = v.rg;       Error += (u.r == 1.0f && u.g == 2.0f) ? 0 : 1;\n    u = v.rb;       Error += (u.r == 1.0f && u.g == 3.0f) ? 0 : 1;\n    u = v.gr;       Error += (u.r == 2.0f && u.g == 1.0f) ? 0 : 1;\n    u = v.gg;       Error += (u.r == 2.0f && u.g == 2.0f) ? 0 : 1;\n    u = v.gb;       Error += (u.r == 2.0f && u.g == 3.0f) ? 0 : 1;\n    u = v.br;       Error += (u.r == 3.0f && u.g == 1.0f) ? 0 : 1;\n    u = v.bg;       Error += (u.r == 3.0f && u.g == 2.0f) ? 0 : 1;\n    u = v.bb;       Error += (u.r == 3.0f && u.g == 3.0f) ? 0 : 1;   \n\n    u = v.ss;       Error += (u.s == 1.0f && u.t == 1.0f) ? 0 : 1;\n    u = v.st;       Error += (u.s == 1.0f && u.t == 2.0f) ? 0 : 1;\n    u = v.sp;       Error += (u.s == 1.0f && u.t == 3.0f) ? 0 : 1;\n    u = v.ts;       Error += (u.s == 2.0f && u.t == 1.0f) ? 0 : 1;\n    u = v.tt;       Error += (u.s == 2.0f && u.t == 2.0f) ? 0 : 1;\n    u = v.tp;       Error += (u.s == 2.0f && u.t == 3.0f) ? 0 : 1;\n    u = v.ps;       Error += (u.s == 3.0f && u.t == 1.0f) ? 0 : 1;\n    u = v.pt;       Error += (u.s == 3.0f && u.t == 2.0f) ? 0 : 1;\n    u = v.pp;       Error += (u.s == 3.0f && u.t == 3.0f) ? 0 : 1;\n\n    \/\/ Mixed member aliases are not valid\n    \/\/u = v.rx;     \/\/Illegal\n    \/\/u = v.sy;     \/\/Illegal\n\n\n    u = glm::vec2(1, 2);\n    v = glm::vec3(1, 2, 3);\n    \/\/v.xx = u;     \/\/Illegal\n    v.xy = u;       Error += (v.x == 1.0f && v.y == 2.0f && v.z == 3.0f) ? 0 : 1;\n    v.xz = u;       Error += (v.x == 1.0f && v.y == 2.0f && v.z == 2.0f) ? 0 : 1;\n    v.yx = u;       Error += (v.x == 2.0f && v.y == 1.0f && v.z == 2.0f) ? 0 : 1;\n    \/\/v.yy = u;     \/\/Illegal\n    v.yz = u;       Error += (v.x == 2.0f && v.y == 1.0f && v.z == 2.0f) ? 0 : 1;\n    v.zx = u;       Error += (v.x == 2.0f && v.y == 1.0f && v.z == 1.0f) ? 0 : 1;\n    v.zy = u;       Error += (v.x == 2.0f && v.y == 2.0f && v.z == 1.0f) ? 0 : 1;\n    \/\/v.zz = u;     \/\/Illegal\n    \n    return Error;\n}\n\nint test_vec3_swizzle3_3()\n{\n    int Error = 0;\n\n    glm::vec3 v(1, 2, 3);\n    glm::vec3 u;\n    \n    u = v;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    \n    u = v.xyz;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.zyx;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.zyx = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    \n    u = v.rgb;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.bgr;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.bgr = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n\n    u = v.stp;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.pts;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.pts = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    \n    return Error;\n}\n\nint test_vec3_swizzle_half()\n{\n    int Error = 0;\n\n    glm::half a1(1);\n    glm::half b1(2);\n    glm::half c1(3);\n    glm::hvec3 v(a1, b1, c1);\n    glm::hvec3 u;\n\n    float c = v.x;\n    float d = v.y;\n    u = v;\n\n    float a = u.x;\n    float b = u.y;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    \n    \/*u = v.xyz;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.zyx;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.zyx = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    \n    u = v.rgb;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.bgr;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.bgr = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n\n    u = v.stp;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.pts;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.pts = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;*\/\n\n    return Error;\n}\n\nint main()\n{\n\tint Error = 0;\n\n\tError += test_vec3_operators();\n\tError += test_vec3_size();\n    Error += test_vec3_swizzle3_2();\n    Error += test_vec3_swizzle3_3();\n    Error += test_vec3_swizzle_half();\n\t\n\treturn Error;\n}\n<commit_msg>Added test with swizzle operators on both size<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Mathematics Copyright (c) 2005 - 2011 G-Truc Creation (www.g-truc.net)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Created : 2008-08-31\n\/\/ Updated : 2011-09-19\n\/\/ Licence : This source is under MIT License\n\/\/ File    : test\/core\/type_vec3.cpp\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/half_float.hpp>\n\nstatic int test_vec3_operators()\n{\n\tglm::vec3 A(1.0f);\n\tglm::vec3 B(1.0f);\n\tbool R = A != B;\n\tbool S = A == B;\n\n\treturn (S && !R) ? 0 : 1;\n}\n\nint test_vec3_size()\n{\n\tint Error = 0;\n\t\n\tError += sizeof(glm::vec3) == sizeof(glm::mediump_vec3) ? 0 : 1;\n\tError += 12 == sizeof(glm::mediump_vec3) ? 0 : 1;\n\tError += sizeof(glm::dvec3) == sizeof(glm::highp_vec3) ? 0 : 1;\n\tError += 24 == sizeof(glm::highp_vec3) ? 0 : 1;\n\tError += glm::vec3().length() == 3 ? 0 : 1;\n\tError += glm::dvec3().length() == 3 ? 0 : 1;\n\t\n\treturn Error;\n}\n\nint test_vec3_swizzle3_2()\n{\n    int Error = 0;\n\n    glm::vec3 v(1, 2, 3);\n    glm::vec2 u;\n\n    \/\/ Can not assign a vec3 swizzle to a vec2\n    \/\/u = v.xyz;    \/\/Illegal\n    \/\/u = v.rgb;    \/\/Illegal\n    \/\/u = v.stp;    \/\/Illegal\n\n    u = v.xx;       Error += (u.x == 1.0f && u.y == 1.0f) ? 0 : 1;\n    u = v.xy;       Error += (u.x == 1.0f && u.y == 2.0f) ? 0 : 1;\n    u = v.xz;       Error += (u.x == 1.0f && u.y == 3.0f) ? 0 : 1;\n    u = v.yx;       Error += (u.x == 2.0f && u.y == 1.0f) ? 0 : 1;\n    u = v.yy;       Error += (u.x == 2.0f && u.y == 2.0f) ? 0 : 1;\n    u = v.yz;       Error += (u.x == 2.0f && u.y == 3.0f) ? 0 : 1;\n    u = v.zx;       Error += (u.x == 3.0f && u.y == 1.0f) ? 0 : 1;\n    u = v.zy;       Error += (u.x == 3.0f && u.y == 2.0f) ? 0 : 1;\n    u = v.zz;       Error += (u.x == 3.0f && u.y == 3.0f) ? 0 : 1;\n\n    u = v.rr;       Error += (u.r == 1.0f && u.g == 1.0f) ? 0 : 1;\n    u = v.rg;       Error += (u.r == 1.0f && u.g == 2.0f) ? 0 : 1;\n    u = v.rb;       Error += (u.r == 1.0f && u.g == 3.0f) ? 0 : 1;\n    u = v.gr;       Error += (u.r == 2.0f && u.g == 1.0f) ? 0 : 1;\n    u = v.gg;       Error += (u.r == 2.0f && u.g == 2.0f) ? 0 : 1;\n    u = v.gb;       Error += (u.r == 2.0f && u.g == 3.0f) ? 0 : 1;\n    u = v.br;       Error += (u.r == 3.0f && u.g == 1.0f) ? 0 : 1;\n    u = v.bg;       Error += (u.r == 3.0f && u.g == 2.0f) ? 0 : 1;\n    u = v.bb;       Error += (u.r == 3.0f && u.g == 3.0f) ? 0 : 1;   \n\n    u = v.ss;       Error += (u.s == 1.0f && u.t == 1.0f) ? 0 : 1;\n    u = v.st;       Error += (u.s == 1.0f && u.t == 2.0f) ? 0 : 1;\n    u = v.sp;       Error += (u.s == 1.0f && u.t == 3.0f) ? 0 : 1;\n    u = v.ts;       Error += (u.s == 2.0f && u.t == 1.0f) ? 0 : 1;\n    u = v.tt;       Error += (u.s == 2.0f && u.t == 2.0f) ? 0 : 1;\n    u = v.tp;       Error += (u.s == 2.0f && u.t == 3.0f) ? 0 : 1;\n    u = v.ps;       Error += (u.s == 3.0f && u.t == 1.0f) ? 0 : 1;\n    u = v.pt;       Error += (u.s == 3.0f && u.t == 2.0f) ? 0 : 1;\n    u = v.pp;       Error += (u.s == 3.0f && u.t == 3.0f) ? 0 : 1;\n\n    \/\/ Mixed member aliases are not valid\n    \/\/u = v.rx;     \/\/Illegal\n    \/\/u = v.sy;     \/\/Illegal\n\n\n    u = glm::vec2(1, 2);\n    v = glm::vec3(1, 2, 3);\n    \/\/v.xx = u;     \/\/Illegal\n    v.xy = u;       Error += (v.x == 1.0f && v.y == 2.0f && v.z == 3.0f) ? 0 : 1;\n    v.xz = u;       Error += (v.x == 1.0f && v.y == 2.0f && v.z == 2.0f) ? 0 : 1;\n    v.yx = u;       Error += (v.x == 2.0f && v.y == 1.0f && v.z == 2.0f) ? 0 : 1;\n    \/\/v.yy = u;     \/\/Illegal\n    v.yz = u;       Error += (v.x == 2.0f && v.y == 1.0f && v.z == 2.0f) ? 0 : 1;\n    v.zx = u;       Error += (v.x == 2.0f && v.y == 1.0f && v.z == 1.0f) ? 0 : 1;\n    v.zy = u;       Error += (v.x == 2.0f && v.y == 2.0f && v.z == 1.0f) ? 0 : 1;\n    \/\/v.zz = u;     \/\/Illegal\n    \n    return Error;\n}\n\nint test_vec3_swizzle3_3()\n{\n    int Error = 0;\n\n    glm::vec3 v(1, 2, 3);\n    glm::vec3 u;\n    \n    u.xyz = v.xyz;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    \n    u = v.xyz;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.zyx;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.zyx = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    \n    u = v.rgb;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.bgr;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.bgr = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n\n    u = v.stp;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.pts;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.pts = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    \n    return Error;\n}\n\nint test_vec3_swizzle_half()\n{\n    int Error = 0;\n\n    glm::half a1(1);\n    glm::half b1(2);\n    glm::half c1(3);\n    glm::hvec3 v(a1, b1, c1);\n    glm::hvec3 u;\n\n    float c = v.x;\n    float d = v.y;\n    u = v;\n\n    float a = u.x;\n    float b = u.y;\n    Error += (u.x == glm::half(1.0f) && u.y == glm::half(2.0f) && u.z == glm::half(3.0f)) ? 0 : 1;\n    \n    \/*u = v.xyz;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.zyx;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.zyx = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    \n    u = v.rgb;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.bgr;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.bgr = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n\n    u = v.stp;\n    Error += (u.x == 1.0f && u.y == 2.0f && u.z == 3.0f) ? 0 : 1;\n    u = v.pts;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;\n    u.pts = v;\n    Error += (u.x == 3.0f && u.y == 2.0f && u.z == 1.0f) ? 0 : 1;*\/\n\n    return Error;\n}\n\nint main()\n{\n\tint Error = 0;\n\n\tError += test_vec3_operators();\n\tError += test_vec3_size();\n    Error += test_vec3_swizzle3_2();\n    Error += test_vec3_swizzle3_3();\n    Error += test_vec3_swizzle_half();\n\t\n\treturn Error;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\n#include <string>\n#include <vector>\n#include <map>\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n\treturn 0;\n}\n\n<commit_msg>Reduced imports and added uint to cpp template<commit_after>#include <stdio.h>\n#include <stdlib.h>\n\nusing namespace std;\n\n#define uint unsigned int\n\nint main(int argc, char* argv[])\n{\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <pthread.h>\n#include <queue>\n#include <string.h>\n#include <portal.h>\n#include <sock_utils.h>\n#include <GeneratedTypes.h>\n#include <XsimMemSlaveRequest.h>\n#include <XsimMemSlaveIndication.h>\n\nclass XsimMemSlaveIndication;\nstatic XsimMemSlaveRequestProxy *memSlaveRequestProxy;\nstatic XsimMemSlaveIndication *memSlaveIndication;\n\nclass XsimMemSlaveIndication : public XsimMemSlaveIndicationWrapper {\n  struct idInfo {\n    int number;\n    int id;\n    int valid;\n  } ids[16];\n  int portal_count;\n  std::queue<uint32_t> readDataQueue;\n  pthread_mutex_t readDataMutex;\n  PortalPoller *poller;\npublic:\n  std::queue<int> intrs;\n\n  XsimMemSlaveIndication(int id, PortalItemFunctions *item, void *param, PortalPoller *poller = 0)\n    : XsimMemSlaveIndicationWrapper(id, item, param, poller),\n      portal_count(0), poller(poller)\n  {\n    memset(ids, 0, sizeof(ids));\n    pthread_mutex_init(&readDataMutex, NULL);\n  }\n  virtual void readData ( const uint32_t data ) {\n    fprintf(stderr, \"[%s:%d] FIXME data=%d\\n\", __FUNCTION__, __LINE__, data);\n    pthread_mutex_lock(&readDataMutex);\n    readDataQueue.push(data);\n    pthread_mutex_unlock(&readDataMutex);\n  }\n  virtual void directory ( const uint32_t fpgaNumber, const uint32_t fpgaId, const uint32_t last )\n  {\n    fprintf(stderr, \"[%s:%d] fpga=%d id=%d last=%d\\n\", __FUNCTION__, __LINE__, fpgaNumber, fpgaId, last);\n    struct idInfo info = { fpgaNumber, fpgaId, 1 };\n    ids[fpgaNumber] = info;\n    if (last)\n      portal_count = fpgaNumber+1;\n  }\n  virtual void interrupt (const uint32_t intrNumber )\t{\n    fprintf(stderr, \"[%s:%d] fpga=%d\\n\", __FUNCTION__, __LINE__, intrNumber);\n    intrs.push(intrNumber);\n  }\n\n    int fpgaNumber(int fpgaId);\n    int getReadData(uint32_t *data);\n};\n\nint XsimMemSlaveIndication::fpgaNumber(int fpgaId)\n{\n    for (int i = 0; ids[i].valid; i++)\n\tif (ids[i].id == fpgaId) {\n\t    return ids[i].number;\n\t}\n\n    PORTAL_PRINTF( \"Error: init_xsim: did not find fpga_number %d\\n\", fpgaId);\n    PORTAL_PRINTF( \"    Found fpga numbers:\");\n    for (int i = 0; ids[i].valid; i++)\n\tPORTAL_PRINTF( \" %d\", ids[i].id);\n    PORTAL_PRINTF( \"\\n\");\n\n    return 0;\n}\n\nint XsimMemSlaveIndication::getReadData(uint32_t *data)\n{\n  if (poller) poller->portalExec_event();\n  pthread_mutex_lock(&readDataMutex);\n  int hasData = readDataQueue.size();\n  if (hasData && data) {\n    *data = readDataQueue.size();\n    readDataQueue.pop();\n  }\n  pthread_mutex_unlock(&readDataMutex);\n  return hasData;\n}\n\n\nPortal *mcommon;\nstatic void connect_to_xsim()\n{\n  if (memSlaveRequestProxy == 0) {\n    PortalSocketParam paramSocket = {};\n    PortalMuxParam param = {};\n\n    mcommon = new Portal(0, sizeof(uint32_t), portal_mux_handler, NULL, &socketfuncInit, &paramSocket, defaultPoller);\n    param.pint = &mcommon->pint;\n    fprintf(stderr, \"[%s:%d] adding fd %d\\n\", __FUNCTION__, __LINE__, mcommon->pint.client_fd[0]);\n\n  fprintf(stderr, \"[%s:%d]\\n\", __FUNCTION__, __LINE__);\n  memSlaveIndication = new XsimMemSlaveIndication(XsimIfcNames_XsimMemSlaveIndication, &muxfunc, &param, defaultPoller);\n  memSlaveRequestProxy = new XsimMemSlaveRequestProxy(XsimIfcNames_XsimMemSlaveRequest, &muxfunc, &param);\n  fprintf(stderr, \"[%s:%d] calling connect()\\n\", __FUNCTION__, __LINE__);\n    memSlaveRequestProxy->connect();\n  fprintf(stderr, \"[%s:%d] called connect\\n\", __FUNCTION__, __LINE__);\n  }\n}\n\nstatic int init_xsim(struct PortalInternal *pint, void *init_param)\n{\n  fprintf(stderr, \"FIXME [%s:%d]\\n\", __FUNCTION__, __LINE__);\n  connect_to_xsim();\n  \/\/pint->fpga_number = memSlaveIndication->fpgaNumber(pint->fpga_number);\n  return 0;\n}\n\nstatic volatile unsigned int *mapchannel_xsim(struct PortalInternal *pint, unsigned int v)\n{\n    return 0;\n}\n\nstatic unsigned int read_portal_xsim(PortalInternal *pint, volatile unsigned int **addr)\n{\n  fprintf(stderr, \"FIXME [%s:%d] id=%d addr=%08lx\\n\", __FUNCTION__, __LINE__, pint->fpga_number, (long)*addr);\n  memSlaveRequestProxy->read(pint->fpga_number, (uint32_t)(long)*addr);\n  while (1) {\n    uint32_t data;\n    int hasData = memSlaveIndication->getReadData(&data);\n    if (hasData) {\n      fprintf(stderr, \"[%s:%d] id=%d addr=%08lx got data %08lx\\n\", __FUNCTION__, __LINE__, pint->fpga_number, (long)*addr, data);\n      return data;\n    }\n  }\n  return 0xDeadBeef;\n}\n\nstatic void write_portal_xsim(PortalInternal *pint, volatile unsigned int **addr, unsigned int v)\n{\n  fprintf(stderr, \"[%s:%d] id=%d addr=%08lx data=%08x\\n\", __FUNCTION__, __LINE__, pint->fpga_number, (long)*addr, v);\n  memSlaveRequestProxy->write(pint->fpga_number, (uint32_t)(long)*addr, v);\n}\nvoid write_portal_fd_xsim(PortalInternal *pint, volatile unsigned int **addr, unsigned int v)\n{\n  fprintf(stderr, \"FIXME [%s:%d] fd %d\\n\", __FUNCTION__, __LINE__, v);\n\/\/FIXME\n}\n\nstatic void enableint_portal_xsim(struct PortalInternal *pint, int val)\n{\n  fprintf(stderr, \"[%s:%d] id %d val %d\\n\", __FUNCTION__, __LINE__, pint->fpga_number, val);\n  memSlaveRequestProxy->enableint(pint->fpga_number, val);\n}\n\nint event_portal_xsim(struct PortalInternal *pint)\n{\n  fprintf(stderr, \"[%s:%d] num_intrs=%d\\n\", __FUNCTION__, __LINE__, memSlaveIndication->intrs.size());\n  if (memSlaveIndication->intrs.size()) {\n    volatile unsigned int *map_base = 0;\n    volatile unsigned int *statp = &map_base[PORTAL_CTRL_REG_IND_QUEUE_STATUS];\n    for (int fpgaId = memSlaveIndication->intrs.front(); memSlaveIndication->intrs.size(); memSlaveIndication->intrs.pop()) {\n      int status = read_portal_xsim(pint, &statp);\n    }\n  }\n  return -1;\n}\n\nPortalItemFunctions xsimfunc = {\n    init_xsim, read_portal_xsim, write_portal_xsim, write_portal_fd_xsim, mapchannel_hardware, mapchannel_hardware,\n    send_portal_null, recv_portal_null, busy_portal_null, enableint_portal_xsim, event_portal_xsim, notfull_null};\n<commit_msg>added bluenoc top support to xsimfunc<commit_after>#include <pthread.h>\n#include <queue>\n#include <string.h>\n#include <portal.h>\n#include <sock_utils.h>\n#include <GeneratedTypes.h>\n#include <XsimMemSlaveRequest.h>\n#include <XsimMemSlaveIndication.h>\n\nclass XsimMemSlaveIndication;\nstatic XsimMemSlaveRequestProxy *memSlaveRequestProxy;\nstatic XsimMemSlaveIndication *memSlaveIndication;\n\nclass XsimMemSlaveIndication : public XsimMemSlaveIndicationWrapper {\n  struct idInfo {\n    int number;\n    int id;\n    int valid;\n  } ids[16];\n  int portal_count;\n  std::queue<uint32_t> readDataQueue;\n  pthread_mutex_t readDataMutex;\n  PortalPoller *poller;\npublic:\n  std::queue<int> intrs;\n  std::queue<uint32_t> srcbeats;\n\n  XsimMemSlaveIndication(int id, PortalItemFunctions *item, void *param, PortalPoller *poller = 0)\n    : XsimMemSlaveIndicationWrapper(id, item, param, poller),\n      portal_count(0), poller(poller)\n  {\n    memset(ids, 0, sizeof(ids));\n    pthread_mutex_init(&readDataMutex, NULL);\n  }\n  virtual void readData ( const uint32_t data ) {\n    fprintf(stderr, \"[%s:%d] FIXME data=%d\\n\", __FUNCTION__, __LINE__, data);\n    pthread_mutex_lock(&readDataMutex);\n    readDataQueue.push(data);\n    pthread_mutex_unlock(&readDataMutex);\n  }\n  virtual void directory ( const uint32_t fpgaNumber, const uint32_t fpgaId, const uint32_t last )\n  {\n    fprintf(stderr, \"[%s:%d] fpga=%d id=%d last=%d\\n\", __FUNCTION__, __LINE__, fpgaNumber, fpgaId, last);\n    struct idInfo info = { fpgaNumber, fpgaId, 1 };\n    ids[fpgaNumber] = info;\n    if (last)\n      portal_count = fpgaNumber+1;\n  }\n  virtual void interrupt (const uint32_t intrNumber )\t{\n    fprintf(stderr, \"[%s:%d] fpga=%d\\n\", __FUNCTION__, __LINE__, intrNumber);\n    intrs.push(intrNumber);\n  }\n\n  void msgSource ( const uint32_t data ) {\n    fprintf(stderr, \"[%s:%d] data=%d\\n\", __FUNCTION__, __LINE__, data);\n    srcbeats.push(data);\n  }\n\n    int fpgaNumber(int fpgaId);\n    int getReadData(uint32_t *data);\n};\n\nint XsimMemSlaveIndication::fpgaNumber(int fpgaId)\n{\n    for (int i = 0; ids[i].valid; i++)\n\tif (ids[i].id == fpgaId) {\n\t    return ids[i].number;\n\t}\n\n    PORTAL_PRINTF( \"Error: init_xsim: did not find fpga_number %d\\n\", fpgaId);\n    PORTAL_PRINTF( \"    Found fpga numbers:\");\n    for (int i = 0; ids[i].valid; i++)\n\tPORTAL_PRINTF( \" %d\", ids[i].id);\n    PORTAL_PRINTF( \"\\n\");\n\n    return 0;\n}\n\nint XsimMemSlaveIndication::getReadData(uint32_t *data)\n{\n  if (poller) poller->portalExec_event();\n  pthread_mutex_lock(&readDataMutex);\n  int hasData = readDataQueue.size();\n  if (hasData && data) {\n    *data = readDataQueue.size();\n    readDataQueue.pop();\n  }\n  pthread_mutex_unlock(&readDataMutex);\n  return hasData;\n}\n\n\nPortal *mcommon;\nstatic void connect_to_xsim()\n{\n  if (memSlaveRequestProxy == 0) {\n    PortalSocketParam paramSocket = {};\n    PortalMuxParam param = {};\n\n    mcommon = new Portal(0, sizeof(uint32_t), portal_mux_handler, NULL, &socketfuncInit, &paramSocket, defaultPoller);\n    param.pint = &mcommon->pint;\n    fprintf(stderr, \"[%s:%d] adding fd %d\\n\", __FUNCTION__, __LINE__, mcommon->pint.client_fd[0]);\n\n  fprintf(stderr, \"[%s:%d]\\n\", __FUNCTION__, __LINE__);\n  memSlaveIndication = new XsimMemSlaveIndication(XsimIfcNames_XsimMemSlaveIndication, &muxfunc, &param, defaultPoller);\n  memSlaveRequestProxy = new XsimMemSlaveRequestProxy(XsimIfcNames_XsimMemSlaveRequest, &muxfunc, &param);\n  fprintf(stderr, \"[%s:%d] calling connect()\\n\", __FUNCTION__, __LINE__);\n    memSlaveRequestProxy->connect();\n  fprintf(stderr, \"[%s:%d] called connect\\n\", __FUNCTION__, __LINE__);\n  }\n}\n\nstatic int init_xsim(struct PortalInternal *pint, void *init_param)\n{\n  fprintf(stderr, \"FIXME [%s:%d]\\n\", __FUNCTION__, __LINE__);\n  connect_to_xsim();\n  \/\/pint->fpga_number = memSlaveIndication->fpgaNumber(pint->fpga_number);\n  return 0;\n}\n\nstatic volatile unsigned int *mapchannel_xsim(struct PortalInternal *pint, unsigned int v)\n{\n    return 0;\n}\n\nstatic unsigned int read_portal_xsim(PortalInternal *pint, volatile unsigned int **addr)\n{\n  fprintf(stderr, \"FIXME [%s:%d] id=%d addr=%08lx\\n\", __FUNCTION__, __LINE__, pint->fpga_number, (long)*addr);\n  memSlaveRequestProxy->read(pint->fpga_number, (uint32_t)(long)*addr);\n  while (1) {\n    uint32_t data;\n    int hasData = memSlaveIndication->getReadData(&data);\n    if (hasData) {\n      fprintf(stderr, \"[%s:%d] id=%d addr=%08lx got data %08lx\\n\", __FUNCTION__, __LINE__, pint->fpga_number, (long)*addr, data);\n      return data;\n    }\n  }\n  return 0xDeadBeef;\n}\n\nstatic void write_portal_xsim(PortalInternal *pint, volatile unsigned int **addr, unsigned int v)\n{\n  fprintf(stderr, \"[%s:%d] id=%d addr=%08lx data=%08x\\n\", __FUNCTION__, __LINE__, pint->fpga_number, (long)*addr, v);\n  memSlaveRequestProxy->write(pint->fpga_number, (uint32_t)(long)*addr, v);\n}\nvoid write_portal_fd_xsim(PortalInternal *pint, volatile unsigned int **addr, unsigned int v)\n{\n  fprintf(stderr, \"FIXME [%s:%d] fd %d\\n\", __FUNCTION__, __LINE__, v);\n\/\/FIXME\n}\n\nstatic void enableint_portal_xsim(struct PortalInternal *pint, int val)\n{\n  fprintf(stderr, \"[%s:%d] id %d val %d\\n\", __FUNCTION__, __LINE__, pint->fpga_number, val);\n  memSlaveRequestProxy->enableint(pint->fpga_number, val);\n}\n\nint event_portal_xsim(struct PortalInternal *pint)\n{\n  fprintf(stderr, \"[%s:%d] num_intrs=%d\\n\", __FUNCTION__, __LINE__, memSlaveIndication->intrs.size());\n  if (memSlaveIndication->intrs.size()) {\n    volatile unsigned int *map_base = 0;\n    volatile unsigned int *statp = &map_base[PORTAL_CTRL_REG_IND_QUEUE_STATUS];\n    for (int fpgaId = memSlaveIndication->intrs.front(); memSlaveIndication->intrs.size(); memSlaveIndication->intrs.pop()) {\n      int status = read_portal_xsim(pint, &statp);\n    }\n  }\n  return -1;\n}\n\nPortalItemFunctions xsimfunc = {\n    init_xsim, read_portal_xsim, write_portal_xsim, write_portal_fd_xsim, mapchannel_hardware, mapchannel_hardware,\n    send_portal_null, recv_portal_null, busy_portal_null, enableint_portal_xsim, event_portal_xsim, notfull_null};\n<|endoftext|>"}
{"text":"<commit_before>\/* vi: set et sw=4 ts=4 cino=t0,(0: *\/\n\/*\n * This file is part of libaccounts-qt\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Alberto Mardegan <alberto.mardegan@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n *\/\n\n#include \"account-service.h\"\n#include \"manager.h\"\n#include \"utils.h\"\n#include <libaccounts-glib\/ag-account.h>\n#include <libaccounts-glib\/ag-account-service.h>\n\nnamespace Accounts\n{\n\n\/*!\n * @class AccountService\n *\n * @brief Account settings for a specific service\n *\n * @details The AccountService class provides access to the account settings\n * for a specific service type. It is meant to be easier to use than the\n * Account class because it hides the complexity of the account structure and\n * gives access to only the limited subset of account settings which are\n * relevant to a service.\n *\n * To get an AccountService one can use the Manager methods accountServices()\n * or enabledAccountServices(), which both return a QList of account services.\n * Note that if the Manager was instantiated for a specific service type, these\n * lists will contain only those account services matching that service type.\n * The AccountService can also be instantiated with its AccountService(Account\n * *account, Service *service) constructor: this is useful if one already has\n * an Account instance.\n *\n * This is intended to be a convenient wrapper over the accounts settings\n * specific for a service; as such, it doesn't offer all the editing\n * possibilities offered by the Account class, such as enabling the service\n * itself: these operations should ideally not be performed by consumer\n * applications, but by the account editing UI only.\n *\n * Example code:\n * @code\n * \/\/ Instantiate an account manager interested in e-mail services only.\n * Accounts::Manager *manager = new Accounts::Manager(\"e-mail\");\n *\n * \/\/ Get the list of enabled AccountService objects of type e-mail.\n * Accounts::AccountServiceList services = manager->enabledAccountServices();\n *\n * \/\/ Loop through the account services and do something useful with them.\n * foreach (Accounts::AccountService *service, services) {\n *     QString server = service->value(\"pop3\/hostname\").toString();\n *     int port = service->value(\"pop3\/port\").toInt();\n *\n *     \/\/ Suppose that the e-mail address is stored in the global account\n *     \/\/ settings; let's get it from there:\n *     QString fromAddress = service->account()->valueAsString(\"username\");\n *\n *     ...\n * }\n * @endcode\n *\n * User applications (with the notable exception of the accounts editing\n * application) should never use account services which are not enabled, and\n * should stop using an account when the account service becomes disabled. The\n * latter can be done by connecting to the changed() signal and checking if\n * enabled() still returns true.\n * Note that if the account gets deleted, it will always get disabled first;\n * so, there is no need to connect to the Account::removed() signal; one can\n * just monitor the changed() signal from the AccountService objects.\n *\/\n\n\/*!\n * @fn AccountService::enabled(bool isEnabled)\n *\n * Emitted when the enabledness state of the account service has changed.\n *\/\n\n\n\/*!\n * @fn AccountService::changed()\n * Emitted when some setting has changed on the account service.\n * You can use the changedFields() method to retrieve the list of the\n * settings which have changed.\n *\/\n\nclass AccountServicePrivate\n{\n    Q_DECLARE_PUBLIC(AccountService)\n\npublic:\n    AccountServicePrivate(Account *account,\n                          Service *service,\n                          AccountService *accountService);\n    ~AccountServicePrivate();\n\nprivate:\n    static void onEnabled(AccountService *accountService, gboolean isEnabled);\n    static void onChanged(AccountService *accountService);\n\n    ServiceList m_serviceList;\n    AgAccountService *m_accountService;\n    Manager *m_manager;\n    QString prefix;\n    mutable AccountService *q_ptr;\n};\n\n} \/\/ namespace\n\nusing namespace Accounts;\n\nstatic QChar slash = QChar::fromLatin1('\/');\n\nAccountServicePrivate::AccountServicePrivate(Account *account,\n                                             Service *service,\n                                             AccountService *accountService):\n    m_manager(account->manager()),\n    q_ptr(accountService)\n{\n    m_accountService = ag_account_service_new(account->account(),\n                                              service->service());\n    g_signal_connect_swapped(m_accountService, \"enabled\",\n                             G_CALLBACK(&onEnabled), accountService);\n    g_signal_connect_swapped(m_accountService, \"changed\",\n                             G_CALLBACK(&onChanged), accountService);\n}\n\nAccountServicePrivate::~AccountServicePrivate()\n{\n    Q_Q(AccountService);\n    g_signal_handlers_disconnect_by_func(m_accountService,\n                                         (void *)&onEnabled, q);\n    g_signal_handlers_disconnect_by_func(m_accountService,\n                                         (void *)&onChanged, q);\n    g_object_unref(m_accountService);\n    m_accountService = 0;\n}\n\nvoid AccountServicePrivate::onEnabled(AccountService *accountService,\n                                      gboolean isEnabled)\n{\n    TRACE();\n\n    Q_EMIT accountService->enabled(isEnabled);\n}\n\nvoid AccountServicePrivate::onChanged(AccountService *accountService)\n{\n    TRACE();\n\n    Q_EMIT accountService->changed();\n}\n\n\/*!\n * Constructor.\n * @param account An Account.\n * @param service A Service supported by @account.\n *\/\nAccountService::AccountService(Account *account, Service *service):\n    d_ptr(new AccountServicePrivate(account, service, this))\n{\n}\n\n\/*!\n * Destructor.\n *\/\nAccountService::~AccountService()\n{\n    delete d_ptr;\n}\n\n\/*!\n * Return the Account. Do not delete this object explicitly.\n *\/\nAccount *AccountService::account() const\n{\n    Q_D(const AccountService);\n    AgAccount *account = ag_account_service_get_account(d->m_accountService);\n    AgAccountId account_id = account->id;\n\n    return d->m_manager->account(account_id);\n}\n\n\/*!\n * Return the Service. Do not delete this object explicitly.\n *\/\nService *AccountService::service() const\n{\n    Q_D(const AccountService);\n    AgService *service = ag_account_service_get_service(d->m_accountService);\n    return d->m_manager->serviceInstance(service);\n}\n\n\/*!\n * Check whether the account service is enabled.\n *\/\nbool AccountService::enabled() const\n{\n    Q_D(const AccountService);\n    return ag_account_service_get_enabled(d->m_accountService);\n}\n\n\/*!\n * Return all the keys in the current group.\n *\/\nQStringList AccountService::allKeys() const\n{\n    Q_D(const AccountService);\n    QStringList allKeys;\n    AgAccountSettingIter iter;\n    const gchar *key;\n    const GValue *val;\n\n    \/* iterate the settings *\/\n    QByteArray tmp = d->prefix.toLatin1();\n    ag_account_service_settings_iter_init(d->m_accountService,\n                                          &iter, tmp.constData());\n    while (ag_account_service_settings_iter_next(&iter, &key, &val))\n    {\n        allKeys.append(ASCII(key));\n    }\n    return allKeys;\n}\n\n\/*!\n * Enter a group. This method never fails.\n * @param prefix\n *\/\nvoid AccountService::beginGroup(const QString &prefix)\n{\n    Q_D(AccountService);\n    d->prefix += prefix + slash;\n}\n\n\/*!\n * Return all the groups which are direct children of the current group.\n *\/\nQStringList AccountService::childGroups() const\n{\n    QStringList groups, all_keys;\n\n    all_keys = allKeys();\n    foreach (QString key, all_keys)\n    {\n        if (key.contains(slash)) {\n            QString group = key.section(slash, 0, 0);\n            if (!groups.contains(group))\n                groups.append(group);\n        }\n    }\n    return groups;\n}\n\n\/*!\n * Return all the keys which are direct children of the current group.\n *\/\nQStringList AccountService::childKeys() const\n{\n    QStringList keys, all_keys;\n\n    all_keys = allKeys();\n    foreach (QString key, all_keys)\n    {\n        if (!key.contains(slash))\n            keys.append(key);\n    }\n    return keys;\n}\n\n\/*!\n * Remove all the keys.\n * @see remove(const QString &key)\n *\/\nvoid AccountService::clear()\n{\n    Q_D(AccountService);\n    \/* clear() must ignore the group: so, temporarily reset it and call\n     * remove(\"\") *\/\n    QString saved_prefix = d->prefix;\n    d->prefix = QString();\n    remove(QString());\n    d->prefix = saved_prefix;\n}\n\n\/*!\n * Check whether the given key is in the current group.\n * @param key The key name of the setting.\n *\/\nbool AccountService::contains(const QString &key) const\n{\n    return childKeys().contains(key);\n}\n\n\/*!\n * Exit a group.\n *\/\nvoid AccountService::endGroup()\n{\n    Q_D(AccountService);\n    d->prefix = d->prefix.section(slash, 0, -3,\n                                  QString::SectionIncludeTrailingSep);\n    if (d->prefix[0] == slash) d->prefix.remove(0, 1);\n}\n\n\/*!\n * Return the name of the current group.\n *\/\nQString AccountService::group() const\n{\n    Q_D(const AccountService);\n    if (d->prefix.endsWith(slash))\n        return d->prefix.left(d->prefix.size() - 1);\n    return d->prefix;\n}\n\n\/*!\n * Remove the given key. If the key is the empty string, all keys in the\n * current group are removed.\n * @param key The key name of the setting.\n *\/\nvoid AccountService::remove(const QString &key)\n{\n    Q_D(AccountService);\n    if (key.isEmpty())\n    {\n        \/* delete all keys in the group *\/\n        QStringList keys = allKeys();\n        foreach (QString key, keys)\n        {\n            if (!key.isEmpty())\n                remove(key);\n        }\n    }\n    else\n    {\n        QString full_key = d->prefix + key;\n        QByteArray tmpkey = full_key.toLatin1();\n        ag_account_service_set_value(d->m_accountService,\n                                     tmpkey.constData(),\n                                     NULL);\n    }\n}\n\n\/*!\n * Change the value of an account setting.\n * @param key The name of the setting.\n * @param value The new value of the setting.\n *\/\nvoid AccountService::setValue(const QString &key, const QVariant &value)\n{\n    Q_D(AccountService);\n    TRACE();\n    GValue val= {0, {{0}}};\n\n    if (!variantToGValue(value, &val)) {\n        return;\n    }\n\n    QString full_key = d->prefix + key;\n    QByteArray tmpkey = full_key.toLatin1();\n    ag_account_service_set_value(d->m_accountService,\n                                 tmpkey.constData(),\n                                 &val);\n    g_value_unset(&val);\n}\n\nvoid AccountService::setValue(const char *key, const QVariant &value)\n{\n    setValue(ASCII(key), value);\n}\n\n\/*!\n * Retrieves the value of an account setting.\n * @param key The key whose value must be retrieved\n * @param source Indicates whether the value comes from the account, the\n * service template or was unset.\n *\n * Returns the value of the setting, or an invalid QVariant if unset.\n *\/\nQVariant AccountService::value(const QString &key, SettingSource *source) const\n{\n    Q_D(const AccountService);\n    GValue val= {0, {{0}}};\n    g_value_init(&val, G_TYPE_STRING);\n    QString full_key = d->prefix + key;\n    QByteArray ba = full_key.toLatin1();\n    AgSettingSource agSource =\n        ag_account_service_get_value(d->m_accountService,\n                                     ba.constData(), &val);\n    if (source != 0) {\n        switch (agSource) {\n        case AG_SETTING_SOURCE_ACCOUNT: *source = ACCOUNT; break;\n        case AG_SETTING_SOURCE_PROFILE: *source = TEMPLATE; break;\n        default: *source = NONE; break;\n        }\n    }\n\n    QVariant variant;\n    if (agSource == AG_SETTING_SOURCE_NONE)\n        return variant;\n\n    variant = UTF8(g_value_get_string(&val));\n    g_value_unset(&val);\n\n    return variant;\n}\n\nQVariant AccountService::value(const char *key, SettingSource *source) const\n{\n    return value(ASCII(key), source);\n}\n\n\/*!\n * This method should be called only in the context of a handler of the\n * AccountService::changed() signal, and can be used to retrieve the set of\n * changes.\n *\n * @return a QStringList of the keys which have changed.\n *\/\nQStringList AccountService::changedFields() const\n{\n    Q_D(const AccountService);\n\n    gchar **changedFields =\n        ag_account_service_get_changed_fields(d->m_accountService);\n\n    QStringList keyList;\n    if (changedFields == 0)\n        return keyList;\n\n    gchar **keys = changedFields;\n    while (*keys != 0) {\n        keyList.append(QString(ASCII(*keys)));\n        keys++;\n    }\n\n    g_strfreev(changedFields);\n    return keyList;\n}\n\n<commit_msg>Doc: use @note on some AccountService paragraphs<commit_after>\/* vi: set et sw=4 ts=4 cino=t0,(0: *\/\n\/*\n * This file is part of libaccounts-qt\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Alberto Mardegan <alberto.mardegan@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n *\/\n\n#include \"account-service.h\"\n#include \"manager.h\"\n#include \"utils.h\"\n#include <libaccounts-glib\/ag-account.h>\n#include <libaccounts-glib\/ag-account-service.h>\n\nnamespace Accounts\n{\n\n\/*!\n * @class AccountService\n *\n * @brief Account settings for a specific service\n *\n * @details The AccountService class provides access to the account settings\n * for a specific service type. It is meant to be easier to use than the\n * Account class because it hides the complexity of the account structure and\n * gives access to only the limited subset of account settings which are\n * relevant to a service.\n *\n * To get an AccountService one can use the Manager methods accountServices()\n * or enabledAccountServices(), which both return a QList of account services.\n * Note that if the Manager was instantiated for a specific service type, these\n * lists will contain only those account services matching that service type.\n * The AccountService can also be instantiated with its AccountService(Account\n * *account, Service *service) constructor: this is useful if one already has\n * an Account instance.\n *\n * This is intended to be a convenient wrapper over the accounts settings\n * specific for a service; as such, it doesn't offer all the editing\n * possibilities offered by the Account class, such as enabling the service\n * itself: these operations should ideally not be performed by consumer\n * applications, but by the account editing UI only.\n *\n * Example code:\n * @code\n * \/\/ Instantiate an account manager interested in e-mail services only.\n * Accounts::Manager *manager = new Accounts::Manager(\"e-mail\");\n *\n * \/\/ Get the list of enabled AccountService objects of type e-mail.\n * Accounts::AccountServiceList services = manager->enabledAccountServices();\n *\n * \/\/ Loop through the account services and do something useful with them.\n * foreach (Accounts::AccountService *service, services) {\n *     QString server = service->value(\"pop3\/hostname\").toString();\n *     int port = service->value(\"pop3\/port\").toInt();\n *\n *     \/\/ Suppose that the e-mail address is stored in the global account\n *     \/\/ settings; let's get it from there:\n *     QString fromAddress = service->account()->valueAsString(\"username\");\n *\n *     ...\n * }\n * @endcode\n *\n * @note User applications (with the notable exception of the accounts editing\n * application) should never use account services which are not enabled, and\n * should stop using an account when the account service becomes disabled. The\n * latter can be done by connecting to the changed() signal and checking if\n * enabled() still returns true.\n * @note Note that if the account gets deleted, it will always get disabled\n * first; so, there is no need to connect to the Account::removed() signal; one\n * can just monitor the changed() signal from the AccountService objects.\n *\/\n\n\/*!\n * @fn AccountService::enabled(bool isEnabled)\n *\n * Emitted when the enabledness state of the account service has changed.\n *\/\n\n\n\/*!\n * @fn AccountService::changed()\n * Emitted when some setting has changed on the account service.\n * You can use the changedFields() method to retrieve the list of the\n * settings which have changed.\n *\/\n\nclass AccountServicePrivate\n{\n    Q_DECLARE_PUBLIC(AccountService)\n\npublic:\n    AccountServicePrivate(Account *account,\n                          Service *service,\n                          AccountService *accountService);\n    ~AccountServicePrivate();\n\nprivate:\n    static void onEnabled(AccountService *accountService, gboolean isEnabled);\n    static void onChanged(AccountService *accountService);\n\n    ServiceList m_serviceList;\n    AgAccountService *m_accountService;\n    Manager *m_manager;\n    QString prefix;\n    mutable AccountService *q_ptr;\n};\n\n} \/\/ namespace\n\nusing namespace Accounts;\n\nstatic QChar slash = QChar::fromLatin1('\/');\n\nAccountServicePrivate::AccountServicePrivate(Account *account,\n                                             Service *service,\n                                             AccountService *accountService):\n    m_manager(account->manager()),\n    q_ptr(accountService)\n{\n    m_accountService = ag_account_service_new(account->account(),\n                                              service->service());\n    g_signal_connect_swapped(m_accountService, \"enabled\",\n                             G_CALLBACK(&onEnabled), accountService);\n    g_signal_connect_swapped(m_accountService, \"changed\",\n                             G_CALLBACK(&onChanged), accountService);\n}\n\nAccountServicePrivate::~AccountServicePrivate()\n{\n    Q_Q(AccountService);\n    g_signal_handlers_disconnect_by_func(m_accountService,\n                                         (void *)&onEnabled, q);\n    g_signal_handlers_disconnect_by_func(m_accountService,\n                                         (void *)&onChanged, q);\n    g_object_unref(m_accountService);\n    m_accountService = 0;\n}\n\nvoid AccountServicePrivate::onEnabled(AccountService *accountService,\n                                      gboolean isEnabled)\n{\n    TRACE();\n\n    Q_EMIT accountService->enabled(isEnabled);\n}\n\nvoid AccountServicePrivate::onChanged(AccountService *accountService)\n{\n    TRACE();\n\n    Q_EMIT accountService->changed();\n}\n\n\/*!\n * Constructor.\n * @param account An Account.\n * @param service A Service supported by @account.\n *\/\nAccountService::AccountService(Account *account, Service *service):\n    d_ptr(new AccountServicePrivate(account, service, this))\n{\n}\n\n\/*!\n * Destructor.\n *\/\nAccountService::~AccountService()\n{\n    delete d_ptr;\n}\n\n\/*!\n * Return the Account. Do not delete this object explicitly.\n *\/\nAccount *AccountService::account() const\n{\n    Q_D(const AccountService);\n    AgAccount *account = ag_account_service_get_account(d->m_accountService);\n    AgAccountId account_id = account->id;\n\n    return d->m_manager->account(account_id);\n}\n\n\/*!\n * Return the Service. Do not delete this object explicitly.\n *\/\nService *AccountService::service() const\n{\n    Q_D(const AccountService);\n    AgService *service = ag_account_service_get_service(d->m_accountService);\n    return d->m_manager->serviceInstance(service);\n}\n\n\/*!\n * Check whether the account service is enabled.\n *\/\nbool AccountService::enabled() const\n{\n    Q_D(const AccountService);\n    return ag_account_service_get_enabled(d->m_accountService);\n}\n\n\/*!\n * Return all the keys in the current group.\n *\/\nQStringList AccountService::allKeys() const\n{\n    Q_D(const AccountService);\n    QStringList allKeys;\n    AgAccountSettingIter iter;\n    const gchar *key;\n    const GValue *val;\n\n    \/* iterate the settings *\/\n    QByteArray tmp = d->prefix.toLatin1();\n    ag_account_service_settings_iter_init(d->m_accountService,\n                                          &iter, tmp.constData());\n    while (ag_account_service_settings_iter_next(&iter, &key, &val))\n    {\n        allKeys.append(ASCII(key));\n    }\n    return allKeys;\n}\n\n\/*!\n * Enter a group. This method never fails.\n * @param prefix\n *\/\nvoid AccountService::beginGroup(const QString &prefix)\n{\n    Q_D(AccountService);\n    d->prefix += prefix + slash;\n}\n\n\/*!\n * Return all the groups which are direct children of the current group.\n *\/\nQStringList AccountService::childGroups() const\n{\n    QStringList groups, all_keys;\n\n    all_keys = allKeys();\n    foreach (QString key, all_keys)\n    {\n        if (key.contains(slash)) {\n            QString group = key.section(slash, 0, 0);\n            if (!groups.contains(group))\n                groups.append(group);\n        }\n    }\n    return groups;\n}\n\n\/*!\n * Return all the keys which are direct children of the current group.\n *\/\nQStringList AccountService::childKeys() const\n{\n    QStringList keys, all_keys;\n\n    all_keys = allKeys();\n    foreach (QString key, all_keys)\n    {\n        if (!key.contains(slash))\n            keys.append(key);\n    }\n    return keys;\n}\n\n\/*!\n * Remove all the keys.\n * @see remove(const QString &key)\n *\/\nvoid AccountService::clear()\n{\n    Q_D(AccountService);\n    \/* clear() must ignore the group: so, temporarily reset it and call\n     * remove(\"\") *\/\n    QString saved_prefix = d->prefix;\n    d->prefix = QString();\n    remove(QString());\n    d->prefix = saved_prefix;\n}\n\n\/*!\n * Check whether the given key is in the current group.\n * @param key The key name of the setting.\n *\/\nbool AccountService::contains(const QString &key) const\n{\n    return childKeys().contains(key);\n}\n\n\/*!\n * Exit a group.\n *\/\nvoid AccountService::endGroup()\n{\n    Q_D(AccountService);\n    d->prefix = d->prefix.section(slash, 0, -3,\n                                  QString::SectionIncludeTrailingSep);\n    if (d->prefix[0] == slash) d->prefix.remove(0, 1);\n}\n\n\/*!\n * Return the name of the current group.\n *\/\nQString AccountService::group() const\n{\n    Q_D(const AccountService);\n    if (d->prefix.endsWith(slash))\n        return d->prefix.left(d->prefix.size() - 1);\n    return d->prefix;\n}\n\n\/*!\n * Remove the given key. If the key is the empty string, all keys in the\n * current group are removed.\n * @param key The key name of the setting.\n *\/\nvoid AccountService::remove(const QString &key)\n{\n    Q_D(AccountService);\n    if (key.isEmpty())\n    {\n        \/* delete all keys in the group *\/\n        QStringList keys = allKeys();\n        foreach (QString key, keys)\n        {\n            if (!key.isEmpty())\n                remove(key);\n        }\n    }\n    else\n    {\n        QString full_key = d->prefix + key;\n        QByteArray tmpkey = full_key.toLatin1();\n        ag_account_service_set_value(d->m_accountService,\n                                     tmpkey.constData(),\n                                     NULL);\n    }\n}\n\n\/*!\n * Change the value of an account setting.\n * @param key The name of the setting.\n * @param value The new value of the setting.\n *\/\nvoid AccountService::setValue(const QString &key, const QVariant &value)\n{\n    Q_D(AccountService);\n    TRACE();\n    GValue val= {0, {{0}}};\n\n    if (!variantToGValue(value, &val)) {\n        return;\n    }\n\n    QString full_key = d->prefix + key;\n    QByteArray tmpkey = full_key.toLatin1();\n    ag_account_service_set_value(d->m_accountService,\n                                 tmpkey.constData(),\n                                 &val);\n    g_value_unset(&val);\n}\n\nvoid AccountService::setValue(const char *key, const QVariant &value)\n{\n    setValue(ASCII(key), value);\n}\n\n\/*!\n * Retrieves the value of an account setting.\n * @param key The key whose value must be retrieved\n * @param source Indicates whether the value comes from the account, the\n * service template or was unset.\n *\n * Returns the value of the setting, or an invalid QVariant if unset.\n *\/\nQVariant AccountService::value(const QString &key, SettingSource *source) const\n{\n    Q_D(const AccountService);\n    GValue val= {0, {{0}}};\n    g_value_init(&val, G_TYPE_STRING);\n    QString full_key = d->prefix + key;\n    QByteArray ba = full_key.toLatin1();\n    AgSettingSource agSource =\n        ag_account_service_get_value(d->m_accountService,\n                                     ba.constData(), &val);\n    if (source != 0) {\n        switch (agSource) {\n        case AG_SETTING_SOURCE_ACCOUNT: *source = ACCOUNT; break;\n        case AG_SETTING_SOURCE_PROFILE: *source = TEMPLATE; break;\n        default: *source = NONE; break;\n        }\n    }\n\n    QVariant variant;\n    if (agSource == AG_SETTING_SOURCE_NONE)\n        return variant;\n\n    variant = UTF8(g_value_get_string(&val));\n    g_value_unset(&val);\n\n    return variant;\n}\n\nQVariant AccountService::value(const char *key, SettingSource *source) const\n{\n    return value(ASCII(key), source);\n}\n\n\/*!\n * This method should be called only in the context of a handler of the\n * AccountService::changed() signal, and can be used to retrieve the set of\n * changes.\n *\n * @return a QStringList of the keys which have changed.\n *\/\nQStringList AccountService::changedFields() const\n{\n    Q_D(const AccountService);\n\n    gchar **changedFields =\n        ag_account_service_get_changed_fields(d->m_accountService);\n\n    QStringList keyList;\n    if (changedFields == 0)\n        return keyList;\n\n    gchar **keys = changedFields;\n    while (*keys != 0) {\n        keyList.append(QString(ASCII(*keys)));\n        keys++;\n    }\n\n    g_strfreev(changedFields);\n    return keyList;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkBioRadImageIO.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  Portions of this code are covered under the VTK copyright.\n  See VTKCopyright.txt or http:\/\/www.kitware.com\/VTKCopyright.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 \"itkBioRadImageIO.h\"\n#include \"itkByteSwapper.h\"\n#include <itksys\/SystemTools.hxx>\n#include <string.h>  \/\/ for strncpy\n\n#define BIORAD_HEADER_LENGTH    76\n#define BIORAD_NOTE_LENGTH      96\n#define BIORAD_NOTE_TEXT_LENGTH 80\n#define BIORAD_RGB_LUT_LENGTH   768\n#define BIORAD_FILE_ID_OFFSET   54\n#define BIORAD_MAGIC_NUMBER     12345\n\nnamespace itk\n{\n\nstruct bioradheader {\n    unsigned short nx, ny;      \/\/ 0   2*2  image width and height in pixels\n    unsigned short npic;        \/\/ 4   2    number of images in file\n    unsigned short ramp1_min, ramp1_max; \/\/ 6   2*2  LUT1 ramp min. and max.\n    char notes[4];              \/\/ 10  4    no notes=0; has notes=non zero\n    short byte_format;          \/\/ 14  2    bytes=TRUE(1); words=FALSE(0)\n    short image_number;         \/\/ 16  2    image number within file\n    char filename[32];          \/\/ 18  32   file name\n    short merged;               \/\/ 50  2    merged format\n    unsigned short color1;      \/\/ 52  2    LUT1 color status\n    unsigned short file_id;     \/\/ 54  2    valid .PIC file=12345\n    unsigned short ramp2_min, ramp2_max; \/\/ 56  2*2  LUT2 ramp min. and max.\n    unsigned short color2;      \/\/ 60  2    LUT2 color status\n    short edited;               \/\/ 62  2    image has been edited=TRUE(1)\n    short lens;                 \/\/ 64  2    Integer part of lens magnification\n    char mag_factor[4];         \/\/ 66  4    4 byte real mag. factor (old ver.)\n    unsigned char reserved[6];  \/\/ 70  6    NOT USED (old ver.=real lens mag.)\n};\n\nBioRadImageIO::BioRadImageIO()\n{\n  this->SetNumberOfDimensions(3);\n  m_PixelType = SCALAR;\n  m_ComponentType = UCHAR;\n  m_ByteOrder = LittleEndian;\n  m_FileType = Binary;\n  m_NumberOfComponents = 1; \/\/ default\n}\n\nBioRadImageIO::~BioRadImageIO()\n{\n}\n\nbool BioRadImageIO::OpenBioRadFileForReading(std::ifstream& os, \n                                             const char* filename)\n                                       \n{\n  \/\/ Make sure that we have a file to \n  if ( filename == \"\" )\n    {\n    itkExceptionMacro(<<\"A FileName must be specified.\");\n    return false;\n    }\n\n  \/\/ Close file from any previous image\n  if ( os.is_open() )\n    {\n    os.close();\n    }\n  \n  \/\/ Open the new file for reading\n  itkDebugMacro(<< \"Initialize: opening file \" << filename);\n\n  \/\/ Actually open the file\n  os.open( filename, std::ios::in | std::ios::binary );\n\n  if ( os.fail() )\n    {\n    return false;\n    }\n\n  return true;\n}\n\n\nbool BioRadImageIO::OpenBioRadFileForWriting(std::ofstream& os, \n                                             const char* filename)\n{\n  \/\/ Make sure that we have a file to \n  if ( filename == \"\" )\n    {\n    itkExceptionMacro(<<\"A FileName must be specified.\");\n    return false;\n    }\n\n  \/\/ Close file from any previous image\n  if ( os.is_open() )\n    {\n    os.close();\n    }\n  \n  \/\/ Open the new file for writing\n  itkDebugMacro(<< \"Initialize: opening file \" << filename);\n\n#ifdef __sgi\n  \/\/ Create the file. This is required on some older sgi's\n  std::ofstream tFile(filename,std::ios::out);\n  tFile.close();                    \n#endif\n\n  \/\/ Actually open the file\n  os.open( filename, std::ios::out | std::ios::binary );\n\n  if( os.fail() )\n    {\n    itkExceptionMacro(<< \"Could not open file for writing: \" << filename);\n    return false;\n    }\n\n  return true;\n}\n\n\/\/ This method will only test if the header looks like a\n\/\/ BioRad image file.\nbool BioRadImageIO::CanReadFile(const char* filename) \n{ \n  std::ifstream file;\n  std::string fname(filename);\n\n  if( fname == \"\" )\n    {\n    itkDebugMacro(<<\"No filename specified.\");\n    return false;\n    }\n\n  bool extensionFound = false;\n  std::string::size_type sprPos = fname.rfind(\".pic\");\n  if ((sprPos != std::string::npos)\n      && (sprPos == fname.length() - 4))\n    {\n    extensionFound = true;\n    }\n  sprPos = fname.rfind(\".PIC\");\n  if ((sprPos != std::string::npos)\n      && (sprPos == fname.length() - 4))\n    {\n    extensionFound = true;\n    }\n\n  if( !extensionFound )\n    {\n    itkDebugMacro(<<\"The filename extension is not recognized\");\n    return false;\n    }\n\n  if ( !this->OpenBioRadFileForReading(file, filename))\n    {\n    return false;\n    }\n\n  \/\/ Check to see if its a BioRad file\n  unsigned short file_id;\n  file.seekg(BIORAD_FILE_ID_OFFSET, std::ios::beg );\n  file.read((char*)(&file_id),2);\n  ByteSwapper<unsigned short>::SwapFromSystemToLittleEndian(&file_id);\n\n  itkDebugMacro(<< \"Magic number: \" << file_id);\n\n  file.close();\n  return file_id == BIORAD_MAGIC_NUMBER;\n}\n  \n\nvoid BioRadImageIO::Read(void* buffer)\n{\n  std::ifstream file;\n\n  \/\/read header information file:\n  this->OpenBioRadFileForReading(file, m_FileName.c_str());\n  file.seekg(BIORAD_HEADER_LENGTH, std::ios::beg);\n\n  if( !this->ReadBufferAsBinary( file, buffer, this->GetImageSizeInBytes()) )\n    {\n    itkExceptionMacro(<<\"Read failed: Wanted \" << this->GetImageSizeInBytes()\n                      << \" bytes, but read \" << file.gcount() << \" bytes.\");\n    }\n\n  \/\/byte swapping depending on pixel type:\n  if(this->GetComponentType() == USHORT)\n    {\n    ByteSwapper<unsigned short>::SwapRangeFromSystemToLittleEndian(\n        reinterpret_cast<unsigned short *>(buffer),\n        this->GetImageSizeInComponents() );\n    }\n\n  \/\/closing file:\n  file.close();\n}\n\nvoid BioRadImageIO::InternalReadImageInformation(std::ifstream& file)\n{\n  \/\/read .pic file (header)\n  if ( ! this->OpenBioRadFileForReading(file, m_FileName.c_str()) )\n    {\n    itkExceptionMacro(<< \"Cannot read requested file\");\n    }\n\n  \/\/ Find info...\n  bioradheader h, *p;\n  p = &h;\n  if( sizeof(h) != BIORAD_HEADER_LENGTH )\n    {\n    itkExceptionMacro(<< \"Problem of alignement on your plateform\");\n    }\n  file.seekg(0, std::ios::beg);\n  file.read((char*)p, BIORAD_HEADER_LENGTH);\n  \/\/ Only byte swap the first 66 bytes\n  ByteSwapper<unsigned short>::\n    SwapRangeFromSystemToLittleEndian((unsigned short*)p, (BIORAD_HEADER_LENGTH - 10)\/2);\n  itkDebugMacro(<< \"Magic number: \" << h.file_id);\n\n  \/\/ Set dim X,Y,Z\n  m_Dimensions[0] = h.nx;\n  itkDebugMacro(<< \"h.nx: \" << h.nx);\n  m_Dimensions[1] = h.ny;\n  itkDebugMacro(<< \"h.ny: \" << h.ny);\n  if( h.npic != 1 )\n    {\n    this->SetNumberOfDimensions(3);\n    m_Dimensions[2] = h.npic;\n    itkDebugMacro(<< \"h.npic: \" << h.npic);\n    }\n  else\n    {\n    this->SetNumberOfDimensions(2);\n    }\n\n  \/\/ These are not specified by the format, but we can deduce them:\n  \/\/ pixel size = scale_factor\/lens\/mag_factor\n  ByteSwapper<float>::SwapFromSystemToLittleEndian((float*)&h.mag_factor);\n  float mag_factor = *((float*)(h.mag_factor));\n  itkDebugMacro(<< \"Mag Factor: \" << mag_factor);\n  itkDebugMacro(<< \"Lens: \" << h.lens);\n  m_Spacing[0] = m_Spacing[1] = mag_factor\/h.lens;\n  if (m_NumberOfDimensions == 3)\n    {\n    m_Spacing[2] = m_Spacing[0];\n    }\n\n  \/\/ Check the pixel size:\n  itkDebugMacro(<< \"Byte Format: \" << h.byte_format);\n  if(h.byte_format == 1)\n    {\n    SetComponentType(UCHAR);\n    }\n  else\n    {\n    \/\/ sometime the file set an erronous value for byte_format, check the size\n    \/\/ of the file in this case, since byte_format = 1 seems to be the default\n    file.seekg(0, std::ios::end);\n    long gcount = static_cast<long>(file.tellg()) - BIORAD_HEADER_LENGTH;\n    if( gcount == h.nx*h.ny*h.npic )\n      {\n      itkWarningMacro( << \n        \"File is declared as two bytes but really is only one byte\");\n      SetComponentType(UCHAR);\n      }\n    else if( gcount == h.nx*h.ny*h.npic*2 )\n      {\n      SetComponentType(USHORT);\n      }\n    else\n      {\n      SetComponentType(UNKNOWNCOMPONENTTYPE);\n      itkExceptionMacro(<< \"Cannot read requested file\");\n      }\n    }\n}\n\nvoid BioRadImageIO::ReadImageInformation()\n{\n  std::ifstream file;\n  this->InternalReadImageInformation(file);\n  file.close();\n}\n\n\nbool BioRadImageIO::CanWriteFile( const char* name )\n{\n  std::string filename = name;\n\n  if(  filename == \"\" )\n    {\n    itkDebugMacro(<<\"No filename specified.\");\n    return false;\n    }\n\n  bool extensionFound = false;\n  std::string::size_type sprPos = filename.rfind(\".pic\");\n  if ((sprPos != std::string::npos)\n      && (sprPos == filename.length() - 4))\n    {\n    extensionFound = true;\n    }\n\n  if( !extensionFound )\n    {\n    itkDebugMacro(<<\"The filename extension is not recognized\");\n    return false;\n    }\n\n  return true;\n}\n\n\nvoid BioRadImageIO::Write(const void* buffer)\n{\n  std::ofstream file;\n  if ( !this->OpenBioRadFileForWriting(file, m_FileName.c_str()) )\n    {\n    return;\n    }\n\n  \/\/ Check the image region for proper dimensions, etc.\n  unsigned int numDims = this->GetNumberOfDimensions();\n  if ( numDims != 3 && numDims != 2 )\n    {\n    itkExceptionMacro(<<\"BioRad Writer can only write 2 or 3-dimensional images\");\n    return;\n    }\n\n  \/\/ Write the BioRad header information\n  bioradheader header, *p;\n  p = &header;\n  if( sizeof(header) != BIORAD_HEADER_LENGTH )\n    {\n    itkExceptionMacro(<< \"Problem of alignement on your plateform\");\n    }\n  memset(p,0,BIORAD_HEADER_LENGTH); \/\/ Set everything to zero\n  \/\/ In particular `notes' needs to be set to zero to indicate there is no notes\n  header.nx = m_Dimensions[0];\n  header.ny = m_Dimensions[1];\n  if( m_NumberOfDimensions == 3 )\n    {\n    header.npic = m_Dimensions[2];\n    }\n  else\n    {\n    header.npic = 1;\n    }\n  header.file_id = BIORAD_MAGIC_NUMBER;\n\n  \/\/ Always say that image was not edited:\n  header.edited = 0;\n\n  \/\/ Default dummy values:\n  header.lens = 1;\n  \/\/ Set the if file is in byte format or not:\n  switch(this->GetComponentType())\n    {\n    case UCHAR:\n      header.byte_format = 1;\n      header.ramp1_min = 0;\n      header.ramp1_max = 255;\n      header.ramp2_min = 0;\n      header.ramp2_max = 255;\n      break;\n    case USHORT:\n      header.byte_format = 0;\n      header.ramp1_min = 0;\n      header.ramp1_max = 65535;\n      header.ramp2_min = 0;\n      header.ramp2_max = 65535;\n      break;\n    default:\n      itkExceptionMacro(<<\"Component type not supported.\");\n      return;\n    }\n  \/\/ write the actual header\n  ByteSwapper<unsigned short>::SwapRangeFromSystemToLittleEndian(\n    reinterpret_cast<unsigned short*>(p), BIORAD_HEADER_LENGTH\/2);\n  \/\/ To be able to deduce pixel spacing:\n  float mag_factor = m_Spacing[0];\n  ByteSwapper<float>::SwapFromSystemToLittleEndian(&mag_factor);\n  memcpy(&header.mag_factor, (char*)(&mag_factor), 4);\n  \/\/ Set the filename\n  \/\/ NOTES: This is not very clear what should be written here, some files\n  \/\/ have either:\n  \/\/ 1. FILENAME.PIC\n  \/\/ 2. FILENAME.pic\n  \/\/ 3. FileName.pic\n  \/\/ or simply\n  \/\/ 4. FileName\n  std::string filename = itksys::SystemTools::GetFilenameName(m_FileName);\n  \/\/ The buffer is at most 32 bytes:\n  strncpy(header.filename, filename.c_str(), sizeof(header.filename)); \n  file.write((char*)p, BIORAD_HEADER_LENGTH);\n\n  \/\/preparation for writing buffer:\n  const unsigned long numberOfBytes      = this->GetImageSizeInBytes();\n  const unsigned long numberOfComponents = this->GetImageSizeInComponents();\n\n  char *tempmemory = new char[numberOfBytes];\n  memcpy(tempmemory,buffer,numberOfBytes);\n  if(this->GetComponentType() == USHORT)\n    {\n    ByteSwapper<unsigned short>::SwapRangeFromSystemToBigEndian(\n        reinterpret_cast<unsigned short*>(tempmemory), numberOfComponents );\n    }\n  \n  \/\/ Write the actual pixel data\n  file.write( static_cast<const char *>(tempmemory) , numberOfBytes );\n  delete [] tempmemory;\n  file.close();\n}\n\nvoid BioRadImageIO::PrintSelf(std::ostream& os, Indent indent) const\n{\n  Superclass::PrintSelf(os, indent);\n}\n\n\n} \/\/ end namespace itk\n<commit_msg>ENH: Some more debug info<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkBioRadImageIO.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  Portions of this code are covered under the VTK copyright.\n  See VTKCopyright.txt or http:\/\/www.kitware.com\/VTKCopyright.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 \"itkBioRadImageIO.h\"\n#include \"itkByteSwapper.h\"\n#include <itksys\/SystemTools.hxx>\n#include <string.h>  \/\/ for strncpy\n\n#define BIORAD_HEADER_LENGTH    76\n#define BIORAD_NOTE_LENGTH      96\n#define BIORAD_NOTE_TEXT_LENGTH 80\n#define BIORAD_RGB_LUT_LENGTH   768\n#define BIORAD_FILE_ID_OFFSET   54\n#define BIORAD_MAGIC_NUMBER     12345\n\nnamespace itk\n{\n\nstruct bioradheader {\n    unsigned short nx, ny;      \/\/ 0   2*2  image width and height in pixels\n    unsigned short npic;        \/\/ 4   2    number of images in file\n    unsigned short ramp1_min, ramp1_max; \/\/ 6   2*2  LUT1 ramp min. and max.\n    char notes[4];              \/\/ 10  4    no notes=0; has notes=non zero\n    short byte_format;          \/\/ 14  2    bytes=TRUE(1); words=FALSE(0)\n    short image_number;         \/\/ 16  2    image number within file\n    char filename[32];          \/\/ 18  32   file name\n    short merged;               \/\/ 50  2    merged format\n    unsigned short color1;      \/\/ 52  2    LUT1 color status\n    unsigned short file_id;     \/\/ 54  2    valid .PIC file=12345\n    unsigned short ramp2_min, ramp2_max; \/\/ 56  2*2  LUT2 ramp min. and max.\n    unsigned short color2;      \/\/ 60  2    LUT2 color status\n    short edited;               \/\/ 62  2    image has been edited=TRUE(1)\n    short lens;                 \/\/ 64  2    Integer part of lens magnification\n    char mag_factor[4];         \/\/ 66  4    4 byte real mag. factor (old ver.)\n    unsigned char reserved[6];  \/\/ 70  6    NOT USED (old ver.=real lens mag.)\n};\n\nBioRadImageIO::BioRadImageIO()\n{\n  this->SetNumberOfDimensions(3);\n  m_PixelType = SCALAR;\n  m_ComponentType = UCHAR;\n  m_ByteOrder = LittleEndian;\n  m_FileType = Binary;\n  m_NumberOfComponents = 1; \/\/ default\n}\n\nBioRadImageIO::~BioRadImageIO()\n{\n}\n\nbool BioRadImageIO::OpenBioRadFileForReading(std::ifstream& os, \n                                             const char* filename)\n                                       \n{\n  \/\/ Make sure that we have a file to \n  if ( filename == \"\" )\n    {\n    itkExceptionMacro(<<\"A FileName must be specified.\");\n    return false;\n    }\n\n  \/\/ Close file from any previous image\n  if ( os.is_open() )\n    {\n    os.close();\n    }\n  \n  \/\/ Open the new file for reading\n  itkDebugMacro(<< \"Initialize: opening file \" << filename);\n\n  \/\/ Actually open the file\n  os.open( filename, std::ios::in | std::ios::binary );\n\n  if ( os.fail() )\n    {\n    return false;\n    }\n\n  return true;\n}\n\n\nbool BioRadImageIO::OpenBioRadFileForWriting(std::ofstream& os, \n                                             const char* filename)\n{\n  \/\/ Make sure that we have a file to \n  if ( filename == \"\" )\n    {\n    itkExceptionMacro(<<\"A FileName must be specified.\");\n    return false;\n    }\n\n  \/\/ Close file from any previous image\n  if ( os.is_open() )\n    {\n    os.close();\n    }\n  \n  \/\/ Open the new file for writing\n  itkDebugMacro(<< \"Initialize: opening file \" << filename);\n\n#ifdef __sgi\n  \/\/ Create the file. This is required on some older sgi's\n  std::ofstream tFile(filename,std::ios::out);\n  tFile.close();                    \n#endif\n\n  \/\/ Actually open the file\n  os.open( filename, std::ios::out | std::ios::binary );\n\n  if( os.fail() )\n    {\n    itkExceptionMacro(<< \"Could not open file for writing: \" << filename);\n    return false;\n    }\n\n  return true;\n}\n\n\/\/ This method will only test if the header looks like a\n\/\/ BioRad image file.\nbool BioRadImageIO::CanReadFile(const char* filename) \n{ \n  std::ifstream file;\n  std::string fname(filename);\n\n  if( fname == \"\" )\n    {\n    itkDebugMacro(<<\"No filename specified.\");\n    return false;\n    }\n\n  bool extensionFound = false;\n  std::string::size_type sprPos = fname.rfind(\".pic\");\n  if ((sprPos != std::string::npos)\n      && (sprPos == fname.length() - 4))\n    {\n    extensionFound = true;\n    }\n  sprPos = fname.rfind(\".PIC\");\n  if ((sprPos != std::string::npos)\n      && (sprPos == fname.length() - 4))\n    {\n    extensionFound = true;\n    }\n\n  if( !extensionFound )\n    {\n    itkDebugMacro(<<\"The filename extension is not recognized\");\n    return false;\n    }\n\n  if ( !this->OpenBioRadFileForReading(file, filename))\n    {\n    return false;\n    }\n\n  \/\/ Check to see if its a BioRad file\n  unsigned short file_id;\n  file.seekg(BIORAD_FILE_ID_OFFSET, std::ios::beg );\n  file.read((char*)(&file_id),2);\n  ByteSwapper<unsigned short>::SwapFromSystemToLittleEndian(&file_id);\n\n  itkDebugMacro(<< \"Magic number: \" << file_id);\n\n  file.close();\n  return file_id == BIORAD_MAGIC_NUMBER;\n}\n  \n\nvoid BioRadImageIO::Read(void* buffer)\n{\n  std::ifstream file;\n\n  \/\/read header information file:\n  this->OpenBioRadFileForReading(file, m_FileName.c_str());\n  file.seekg(BIORAD_HEADER_LENGTH, std::ios::beg);\n\n  if( !this->ReadBufferAsBinary( file, buffer, this->GetImageSizeInBytes()) )\n    {\n    itkExceptionMacro(<<\"Read failed: Wanted \" << this->GetImageSizeInBytes()\n                      << \" bytes, but read \" << file.gcount() << \" bytes.\");\n    }\n\n  \/\/byte swapping depending on pixel type:\n  if(this->GetComponentType() == USHORT)\n    {\n    ByteSwapper<unsigned short>::SwapRangeFromSystemToLittleEndian(\n        reinterpret_cast<unsigned short *>(buffer),\n        this->GetImageSizeInComponents() );\n    }\n\n  \/\/closing file:\n  file.close();\n}\n\nvoid BioRadImageIO::InternalReadImageInformation(std::ifstream& file)\n{\n  \/\/read .pic file (header)\n  if ( ! this->OpenBioRadFileForReading(file, m_FileName.c_str()) )\n    {\n    itkExceptionMacro(<< \"Cannot read requested file\");\n    }\n\n  \/\/ Find info...\n  bioradheader h, *p;\n  p = &h;\n  if( sizeof(h) != BIORAD_HEADER_LENGTH )\n    {\n    itkExceptionMacro(<< \"Problem of alignement on your plateform\");\n    }\n  file.seekg(0, std::ios::beg);\n  file.read((char*)p, BIORAD_HEADER_LENGTH);\n  \/\/ Only byte swap the first 66 bytes\n  ByteSwapper<unsigned short>::\n    SwapRangeFromSystemToLittleEndian((unsigned short*)p, (BIORAD_HEADER_LENGTH - 10)\/2);\n  itkDebugMacro(<< \"Magic number: \" << h.file_id);\n\n  \/\/ Set dim X,Y,Z\n  m_Dimensions[0] = h.nx;\n  itkDebugMacro(<< \"h.nx: \" << h.nx);\n  m_Dimensions[1] = h.ny;\n  itkDebugMacro(<< \"h.ny: \" << h.ny);\n  if( h.npic != 1 )\n    {\n    this->SetNumberOfDimensions(3);\n    m_Dimensions[2] = h.npic;\n    itkDebugMacro(<< \"h.npic: \" << h.npic);\n    }\n  else\n    {\n    this->SetNumberOfDimensions(2);\n    }\n\n  \/\/ These are not specified by the format, but we can deduce them:\n  \/\/ pixel size = scale_factor\/lens\/mag_factor\n  itkDebugMacro(<< \"Mag Factor Raw: \" << (int)h.mag_factor[0] << \",\"  \n    << (int)h.mag_factor[1] << \",\" << (int)h.mag_factor[2] << \",\" << (int)h.mag_factor[3]);\n  ByteSwapper<float>::SwapFromSystemToLittleEndian((float*)&h.mag_factor);\n  itkDebugMacro(<< \"Mag Factor BS : \" << (int)h.mag_factor[0] << \",\"  \n    << (int)h.mag_factor[1] << \",\" << (int)h.mag_factor[2] << \",\" << (int)h.mag_factor[3]);\n  float mag_factor = *((float*)(h.mag_factor));\n  itkDebugMacro(<< \"Mag Factor: \" << mag_factor);\n  itkDebugMacro(<< \"Lens: \" << h.lens);\n  m_Spacing[0] = m_Spacing[1] = mag_factor\/h.lens;\n  if (m_NumberOfDimensions == 3)\n    {\n    m_Spacing[2] = m_Spacing[0];\n    }\n\n  \/\/ Check the pixel size:\n  itkDebugMacro(<< \"Byte Format: \" << h.byte_format);\n  if(h.byte_format == 1)\n    {\n    SetComponentType(UCHAR);\n    }\n  else\n    {\n    \/\/ sometime the file set an erronous value for byte_format, check the size\n    \/\/ of the file in this case, since byte_format = 1 seems to be the default\n    file.seekg(0, std::ios::end);\n    long gcount = static_cast<long>(file.tellg()) - BIORAD_HEADER_LENGTH;\n    if( gcount == h.nx*h.ny*h.npic )\n      {\n      itkWarningMacro( << \n        \"File is declared as two bytes but really is only one byte\");\n      SetComponentType(UCHAR);\n      }\n    else if( gcount == h.nx*h.ny*h.npic*2 )\n      {\n      SetComponentType(USHORT);\n      }\n    else\n      {\n      SetComponentType(UNKNOWNCOMPONENTTYPE);\n      itkExceptionMacro(<< \"Cannot read requested file\");\n      }\n    }\n}\n\nvoid BioRadImageIO::ReadImageInformation()\n{\n  std::ifstream file;\n  this->InternalReadImageInformation(file);\n  file.close();\n}\n\n\nbool BioRadImageIO::CanWriteFile( const char* name )\n{\n  std::string filename = name;\n\n  if(  filename == \"\" )\n    {\n    itkDebugMacro(<<\"No filename specified.\");\n    return false;\n    }\n\n  bool extensionFound = false;\n  std::string::size_type sprPos = filename.rfind(\".pic\");\n  if ((sprPos != std::string::npos)\n      && (sprPos == filename.length() - 4))\n    {\n    extensionFound = true;\n    }\n\n  if( !extensionFound )\n    {\n    itkDebugMacro(<<\"The filename extension is not recognized\");\n    return false;\n    }\n\n  return true;\n}\n\n\nvoid BioRadImageIO::Write(const void* buffer)\n{\n  std::ofstream file;\n  if ( !this->OpenBioRadFileForWriting(file, m_FileName.c_str()) )\n    {\n    return;\n    }\n\n  \/\/ Check the image region for proper dimensions, etc.\n  unsigned int numDims = this->GetNumberOfDimensions();\n  if ( numDims != 3 && numDims != 2 )\n    {\n    itkExceptionMacro(<<\"BioRad Writer can only write 2 or 3-dimensional images\");\n    return;\n    }\n\n  \/\/ Write the BioRad header information\n  bioradheader header, *p;\n  p = &header;\n  if( sizeof(header) != BIORAD_HEADER_LENGTH )\n    {\n    itkExceptionMacro(<< \"Problem of alignement on your plateform\");\n    }\n  memset(p,0,BIORAD_HEADER_LENGTH); \/\/ Set everything to zero\n  \/\/ In particular `notes' needs to be set to zero to indicate there is no notes\n  header.nx = m_Dimensions[0];\n  header.ny = m_Dimensions[1];\n  if( m_NumberOfDimensions == 3 )\n    {\n    header.npic = m_Dimensions[2];\n    }\n  else\n    {\n    header.npic = 1;\n    }\n  header.file_id = BIORAD_MAGIC_NUMBER;\n\n  \/\/ Always say that image was not edited:\n  header.edited = 0;\n\n  \/\/ Default dummy values:\n  header.lens = 1;\n  \/\/ Set the if file is in byte format or not:\n  switch(this->GetComponentType())\n    {\n    case UCHAR:\n      header.byte_format = 1;\n      header.ramp1_min = 0;\n      header.ramp1_max = 255;\n      header.ramp2_min = 0;\n      header.ramp2_max = 255;\n      break;\n    case USHORT:\n      header.byte_format = 0;\n      header.ramp1_min = 0;\n      header.ramp1_max = 65535;\n      header.ramp2_min = 0;\n      header.ramp2_max = 65535;\n      break;\n    default:\n      itkExceptionMacro(<<\"Component type not supported.\");\n      return;\n    }\n  \/\/ write the actual header\n  ByteSwapper<unsigned short>::SwapRangeFromSystemToLittleEndian(\n    reinterpret_cast<unsigned short*>(p), BIORAD_HEADER_LENGTH\/2);\n  \/\/ To be able to deduce pixel spacing:\n  float mag_factor = m_Spacing[0];\n  ByteSwapper<float>::SwapFromSystemToLittleEndian(&mag_factor);\n  memcpy(&header.mag_factor, (char*)(&mag_factor), 4);\n  \/\/ Set the filename\n  \/\/ NOTES: This is not very clear what should be written here, some files\n  \/\/ have either:\n  \/\/ 1. FILENAME.PIC\n  \/\/ 2. FILENAME.pic\n  \/\/ 3. FileName.pic\n  \/\/ or simply\n  \/\/ 4. FileName\n  std::string filename = itksys::SystemTools::GetFilenameName(m_FileName);\n  \/\/ The buffer is at most 32 bytes:\n  strncpy(header.filename, filename.c_str(), sizeof(header.filename)); \n  file.write((char*)p, BIORAD_HEADER_LENGTH);\n\n  \/\/preparation for writing buffer:\n  const unsigned long numberOfBytes      = this->GetImageSizeInBytes();\n  const unsigned long numberOfComponents = this->GetImageSizeInComponents();\n\n  char *tempmemory = new char[numberOfBytes];\n  memcpy(tempmemory,buffer,numberOfBytes);\n  if(this->GetComponentType() == USHORT)\n    {\n    ByteSwapper<unsigned short>::SwapRangeFromSystemToBigEndian(\n        reinterpret_cast<unsigned short*>(tempmemory), numberOfComponents );\n    }\n  \n  \/\/ Write the actual pixel data\n  file.write( static_cast<const char *>(tempmemory) , numberOfBytes );\n  delete [] tempmemory;\n  file.close();\n}\n\nvoid BioRadImageIO::PrintSelf(std::ostream& os, Indent indent) const\n{\n  Superclass::PrintSelf(os, indent);\n}\n\n\n} \/\/ end namespace itk\n<|endoftext|>"}
{"text":"<commit_before>#ifndef LOG_HPP\n#define LOG_HPP\n\n#include \"OE\/Config.hpp\"\n\n#if OE_ANDROID\n\t#include \"OE\/Platform\/Android\/Android.hpp\"\n#endif\n#if OE_WINDOWS\n\t#include \"OE\/Platform\/Windows\/Windows.hpp\"\n#endif\n\n#include <sstream>\n#include <cstring>\n#include <string>\n\nnamespace OrbitEngine {\n\tenum LogLevel {\n\t\tLOG_DEBUG = 0,\n\t\tLOG_INFO,\n\t\tLOG_WARNING,\n\t\tLOG_ERROR,\n\t\tLOG_FATAL\n\t};\n\n\tclass Log {\n\tpublic:\n\t\tstatic void log(const char* file, int line, const char* message, LogLevel level);\n\t};\n}\n\n#define OE_LOG(message, level) \\\n{ \\\n\tstd::ostringstream _os_; \\\n\t_os_ << message; \\\n\tOrbitEngine::Log::log(__FILE__, __LINE__, _os_.str().c_str(), level); \\\n}\n\n#if OE_DEBUG && OE_WINDOWS\n#define OE_BREAK __debugbreak();\n#else\n#define OE_BREAK {};\n#endif\n\n#define OE_LOG_DEBUG(message) OE_LOG(message, OrbitEngine::LOG_DEBUG)\n#define OE_LOG_INFO(message) OE_LOG(message, OrbitEngine::LOG_INFO)\n#define OE_LOG_WARNING(message) OE_LOG(message, OrbitEngine::LOG_WARNING)\n#define OE_LOG_ERROR(message) OE_LOG(message, OrbitEngine::LOG_ERROR)\n#define OE_LOG_FATAL(message) OE_LOG(message, OrbitEngine::LOG_FATAL)\n\n#if OE_WINDOWS\n\t#define OE_LOG_FATAL_SHOWBOX_AND_EXIT(message) \\\n\t{ \\\n\t\tOE_LOG_FATAL(message) \\\n\t\tstd::ostringstream os_; \\\n\t\tos_ << message << \"\\n\\nThe application may now exit.\"; \\\n\t\tMessageBox(NULL, \\\n\t\t\t\t   os_.str().c_str(), \\\n\t\t\t\t   \"OrbitEngine - FATAL\", \\\n\t\t\t\t   MB_ICONERROR | MB_OK); \\\n\t\tOE_BREAK \\\n\t}\n#else\n\t#define OE_LOG_FATAL_SHOWBOX_AND_EXIT(message) OE_LOG_FATAL(message)\n#endif\n\n#ifdef OE_DEBUG\n#define OE_ASSERT_MSG(condition, msg) \\\n{ \\\n\tif(!(condition)){ \\\n\t\tOE_LOG_FATAL(\"---------------------\") \\\n\t\tOE_LOG_FATAL(\"ASSERTION FAILED!\") \\\n\t\tOE_LOG_FATAL(\"File: \" << __FILE__) \\\n\t\tOE_LOG_FATAL(\"Line: \" << __LINE__) \\\n\t\tOE_LOG_FATAL(\"Function: \" << __FUNCTION__) \\\n\t\tOE_LOG_FATAL(\"Condition: (\" << #condition << \")\") \\\n\t\tOE_LOG_FATAL(\"Details: \" << #msg) \\\n\t\tOE_LOG_FATAL(\"---------------------\") \\\n\t\tOE_BREAK \\\n\t} \\\n};\n#else\n#define OE_ASSERT_MSG(condition, msg)\n#endif\n\n#define NOARG\n#define OE_ASSERT(condition) OE_ASSERT_MSG(condition, NOARG)\n\n#endif<commit_msg>Disabling logging on Release<commit_after>#ifndef LOG_HPP\n#define LOG_HPP\n\n#include \"OE\/Config.hpp\"\n\n#if OE_ANDROID\n\t#include \"OE\/Platform\/Android\/Android.hpp\"\n#endif\n#if OE_WINDOWS\n\t#include \"OE\/Platform\/Windows\/Windows.hpp\"\n#endif\n\n#include <sstream>\n#include <cstring>\n#include <string>\n\nnamespace OrbitEngine {\n\tenum LogLevel {\n\t\tLOG_DEBUG = 0,\n\t\tLOG_INFO,\n\t\tLOG_WARNING,\n\t\tLOG_ERROR,\n\t\tLOG_FATAL\n\t};\n\n\tclass Log {\n\tpublic:\n\t\tstatic void log(const char* file, int line, const char* message, LogLevel level);\n\t};\n}\n\n#define OE_LOG(message, level) \\\n{ \\\n\tstd::ostringstream _os_; \\\n\t_os_ << message; \\\n\tOrbitEngine::Log::log(__FILE__, __LINE__, _os_.str().c_str(), level); \\\n}\n\n#if OE_DEBUG && OE_WINDOWS\n#define OE_BREAK __debugbreak();\n#else\n#define OE_BREAK {};\n#endif\n\n#define OE_LOG_DEBUG(message) OE_LOG(message, OrbitEngine::LOG_DEBUG)\n#define OE_LOG_INFO(message) OE_LOG(message, OrbitEngine::LOG_INFO)\n#define OE_LOG_WARNING(message) OE_LOG(message, OrbitEngine::LOG_WARNING)\n#define OE_LOG_ERROR(message) OE_LOG(message, OrbitEngine::LOG_ERROR)\n#define OE_LOG_FATAL(message) OE_LOG(message, OrbitEngine::LOG_FATAL)\n\n\/\/ disable debug messages\n#if !OE_DEBUG\n\t#define OE_LOG_DEBUG(message)\n#endif\n\n#if OE_WINDOWS\n\t#define OE_LOG_FATAL_SHOWBOX_AND_EXIT(message) \\\n\t{ \\\n\t\tOE_LOG_FATAL(message) \\\n\t\tstd::ostringstream os_; \\\n\t\tos_ << message << \"\\n\\nThe application may now exit.\"; \\\n\t\tMessageBox(NULL, \\\n\t\t\t\t   os_.str().c_str(), \\\n\t\t\t\t   \"OrbitEngine - FATAL\", \\\n\t\t\t\t   MB_ICONERROR | MB_OK); \\\n\t\tOE_BREAK \\\n\t}\n#else\n\t#define OE_LOG_FATAL_SHOWBOX_AND_EXIT(message) OE_LOG_FATAL(message)\n#endif\n\n#if OE_DEBUG\n#define OE_ASSERT_MSG(condition, msg) \\\n{ \\\n\tif(!(condition)){ \\\n\t\tOE_LOG_FATAL(\"---------------------\") \\\n\t\tOE_LOG_FATAL(\"ASSERTION FAILED!\") \\\n\t\tOE_LOG_FATAL(\"File: \" << __FILE__) \\\n\t\tOE_LOG_FATAL(\"Line: \" << __LINE__) \\\n\t\tOE_LOG_FATAL(\"Function: \" << __FUNCTION__) \\\n\t\tOE_LOG_FATAL(\"Condition: (\" << #condition << \")\") \\\n\t\tOE_LOG_FATAL(\"Details: \" << #msg) \\\n\t\tOE_LOG_FATAL(\"---------------------\") \\\n\t\tOE_BREAK \\\n\t} \\\n};\n#else\n\t#define OE_ASSERT_MSG(condition, msg)\n#endif\n\n#define NOARG\n#define OE_ASSERT(condition) OE_ASSERT_MSG(condition, NOARG)\n\n#endif<|endoftext|>"}
{"text":"<commit_before>#include \"data-student.hpp\"\nusing namespace std;\n\nvoid Student::init(string n, int s, int g, string m) {\n\tname = n;\n\tstartingYear = s;\n\tgradutationYear = g;\n\taddMajors(m);\n}\n\nStudent::Student() {\n\tinit(\"\", 2000, 2004, \"\");\n}\nStudent::Student(string n, string s, string e, string m) {\n\tint startYear = stringToInt(s), endYear = stringToInt(e);\n\tinit(n, startYear, endYear, m);\n}\n\nStudent::Student(string fn) {\n\tstring yearS, yearE;\n\tifstream infile(fn.c_str());\n\tstring nextLine;\n\tvector<string> lines;\n\n\t\/\/ load the entire file\n\twhile (infile.peek() != -1) {\n\t\tgetline(infile, nextLine);\n\t\tlines.push_back(nextLine);\n\t}\n\n\tstring previousHeading;\n\tfor (vector<string>::iterator i = lines.begin(); i != lines.end(); ++i) {\n\t\tstring str = *i;\n\t\tif (previousHeading.empty())\n\t\t\tpreviousHeading = \"# NAME\";\n\t\tif (str[0] == '#') {\n\t\t\tpreviousHeading = *i;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (str != \"\") {\n\t\t\tif (str.substr(0, 2) == \"\/\/\") {\n\t\t\t\t\/\/ it's a comment\n\t\t\t}\n\t\t\telse if (previousHeading == \"# NAME\")\n\t\t\t\tname = str;\n\t\t\telse if (previousHeading == \"# MAJORS\")\n\t\t\t\taddMajor(Major(str));\n\t\t\telse if (previousHeading == \"# CONCENTRATIONS\")\n\t\t\t\taddConcentration(Concentration(str));\n\t\t\telse if (previousHeading == \"# COURSES\")\n\t\t\t\taddCourse(Course(str));\n\t\t\telse if (previousHeading == \"# LABS\")\n\t\t\t\taddCourse(Course(str));\n\t\t}\n\t}\n}\n\nvoid Student::addMajor(const Major& m) {\n\tmajors.push_back(m);\n}\n\nvoid Student::addMajors(string str) {\n\tvector<string> record = split(str, ',');\n\tfor (vector<string>::iterator i = record.begin(); i != record.end(); ++i)\n\t\taddMajor(Major(*i));\n}\n\nvoid Student::addConcentration(const Concentration& m) {\n\tconcentrations.push_back(m);\n}\n\nvoid Student::addConcentrations(string str) {\n\tvector<string> record = split(str, ',');\n\tfor (vector<string>::iterator i = record.begin(); i != record.end(); ++i)\n\t\taddConcentration(Concentration(*i));\n}\n\nvoid Student::addCourse(const Course& c) {\n\tcourses.push_back(c);\n}\n\nvoid Student::addCourses(string str) {\n\tvector<string> record = split(str, ',');\n\tfor (vector<string>::iterator i = record.begin(); i != record.end(); ++i)\n\t\taddCourse(Course(*i));\n}\n\nbool Student::hasTakenCourse(string str) {\n\tbool userHasTaken = false;\n\tCourse checkAgainst = getCourse(str);\n\tfor (std::vector<Course>::iterator i = courses.begin(); i != courses.end(); ++i)\n\t\tif (*i == checkAgainst)\n\t\t\tuserHasTaken = true;\n\treturn userHasTaken;\n}\n\nostream& Student::getData(ostream &os) {\n\tos << name << \", \";\n\t\n\tif (majors.size()) {\n\t\tos << \"you are majoring in \";\n\t\t\n\t\tfor (vector<Major>::iterator i = majors.begin(); i != majors.end(); ++i){\n\t\t\tif (majors.size() == 1) {\n\t\t\t\tos << *i << \" \";\n\t\t\t}\n\t\t\telse if (majors.size() == 2) {\n\t\t\t\tos << *i;\n\t\t\t\tif (i != majors.end()-1)\n\t\t\t\t\tos << \" and \";\n\t\t\t\telse\n\t\t\t\t\tos << \" \";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (i != majors.end()-1)\n\t\t\t\t\tos << *i << \", \";\n\t\t\t\telse \n\t\t\t\t\tos << \"and \" << *i << \", \";\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (concentrations.size()) {\n\t\tos << \"with concentrations in \";\n\t\t\n\t\tfor (vector<Concentration>::iterator i = concentrations.begin(); i != concentrations.end(); ++i) {\n\t\t\tif (concentrations.size() == 1) {\n\t\t\t\tos << *i << \" \";\n\t\t\t}\n\t\t\tif (concentrations.size() == 2) {\n\t\t\t\tos << *i;\n\t\t\t\tif (i != concentrations.end()-1)\n\t\t\t\t\tos << \" and \";\n\t\t\t\telse\n\t\t\t\t\tos << \" \";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (i != concentrations.end()-1)\n\t\t\t\t\tos << *i << \", \";\n\t\t\t\telse\n\t\t\t\t\tos << \"and \" << *i << \", \";\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (!majors.size())\n\t\tos << \"you are taking: \" << endl;\n\telse\n\t\tos << \"while taking:\" << endl;\n\n\tfor (vector<Course>::iterator i = courses.begin(); i != courses.end(); ++i)\n\t\tos << *i << endl;\n\n\treturn os;\n}\n\nvoid Student::display() {\n\tcout << *this << endl;\n};\n\nostream& operator<<(ostream& os, Student& item) {\n\treturn item.getData(os);\n}\n<commit_msg>Improve the Student file parser again<commit_after>#include \"data-student.hpp\"\nusing namespace std;\n\nvoid Student::init(string n, int s, int g, string m) {\n\tname = n;\n\tstartingYear = s;\n\tgradutationYear = g;\n\taddMajors(m);\n}\n\nStudent::Student() {\n\tinit(\"\", 2000, 2004, \"\");\n}\nStudent::Student(string n, string s, string e, string m) {\n\tint startYear = stringToInt(s), endYear = stringToInt(e);\n\tinit(n, startYear, endYear, m);\n}\n\nStudent::Student(string fn) {\n\tstring yearS, yearE;\n\tifstream infile(fn.c_str());\n\tstring nextLine;\n\tvector<string> lines;\n\n\t\/\/ load the entire file\n\twhile (infile.peek() != -1) {\n\t\tgetline(infile, nextLine);\n\t\tlines.push_back(nextLine);\n\t}\n\n\tstring previousHeading;\n\tfor (vector<string>::iterator i = lines.begin(); i != lines.end(); ++i) {\n\t\tstring str = *i;\n\t\tif (previousHeading.empty())\n\t\t\tpreviousHeading = \"# NAME\";\n\t\tif (str[0] == '#') {\n\t\t\tstd::transform(str.begin(), str.end(), str.begin(), ::toupper);\n\t\t\tpreviousHeading = *i;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (str != \"\") {\n\t\t\tif (str.substr(0, 2) == \"\/\/\") {\n\t\t\t\t\/\/ it's a comment\n\t\t\t}\n\t\t\telse if (previousHeading == \"# NAME\")\n\t\t\t\tname = str;\n\t\t\telse if (previousHeading == \"# MAJORS\")\n\t\t\t\taddMajor(Major(str));\n\t\t\telse if (previousHeading == \"# CONCENTRATIONS\")\n\t\t\t\taddConcentration(Concentration(str));\n\t\t\telse if (previousHeading == \"# COURSES\")\n\t\t\t\taddCourse(Course(str));\n\t\t\telse if (previousHeading == \"# LABS\")\n\t\t\t\taddCourse(Course(str));\n\t\t}\n\t}\n}\n\nvoid Student::addMajor(const Major& m) {\n\tmajors.push_back(m);\n}\n\nvoid Student::addMajors(string str) {\n\tvector<string> record = split(str, ',');\n\tfor (vector<string>::iterator i = record.begin(); i != record.end(); ++i)\n\t\taddMajor(Major(*i));\n}\n\nvoid Student::addConcentration(const Concentration& m) {\n\tconcentrations.push_back(m);\n}\n\nvoid Student::addConcentrations(string str) {\n\tvector<string> record = split(str, ',');\n\tfor (vector<string>::iterator i = record.begin(); i != record.end(); ++i)\n\t\taddConcentration(Concentration(*i));\n}\n\nvoid Student::addCourse(const Course& c) {\n\tcourses.push_back(c);\n}\n\nvoid Student::addCourses(string str) {\n\tvector<string> record = split(str, ',');\n\tfor (vector<string>::iterator i = record.begin(); i != record.end(); ++i)\n\t\taddCourse(Course(*i));\n}\n\nbool Student::hasTakenCourse(string str) {\n\tbool userHasTaken = false;\n\tCourse checkAgainst = getCourse(str);\n\tfor (std::vector<Course>::iterator i = courses.begin(); i != courses.end(); ++i)\n\t\tif (*i == checkAgainst)\n\t\t\tuserHasTaken = true;\n\treturn userHasTaken;\n}\n\nostream& Student::getData(ostream &os) {\n\tos << name << \", \";\n\t\n\tif (majors.size()) {\n\t\tos << \"you are majoring in \";\n\t\t\n\t\tfor (vector<Major>::iterator i = majors.begin(); i != majors.end(); ++i){\n\t\t\tif (majors.size() == 1) {\n\t\t\t\tos << *i << \" \";\n\t\t\t}\n\t\t\telse if (majors.size() == 2) {\n\t\t\t\tos << *i;\n\t\t\t\tif (i != majors.end()-1)\n\t\t\t\t\tos << \" and \";\n\t\t\t\telse\n\t\t\t\t\tos << \" \";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (i != majors.end()-1)\n\t\t\t\t\tos << *i << \", \";\n\t\t\t\telse \n\t\t\t\t\tos << \"and \" << *i << \", \";\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (concentrations.size()) {\n\t\tos << \"with concentrations in \";\n\t\t\n\t\tfor (vector<Concentration>::iterator i = concentrations.begin(); i != concentrations.end(); ++i) {\n\t\t\tif (concentrations.size() == 1) {\n\t\t\t\tos << *i << \" \";\n\t\t\t}\n\t\t\tif (concentrations.size() == 2) {\n\t\t\t\tos << *i;\n\t\t\t\tif (i != concentrations.end()-1)\n\t\t\t\t\tos << \" and \";\n\t\t\t\telse\n\t\t\t\t\tos << \" \";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (i != concentrations.end()-1)\n\t\t\t\t\tos << *i << \", \";\n\t\t\t\telse\n\t\t\t\t\tos << \"and \" << *i << \", \";\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (!majors.size())\n\t\tos << \"you are taking: \" << endl;\n\telse\n\t\tos << \"while taking:\" << endl;\n\n\tfor (vector<Course>::iterator i = courses.begin(); i != courses.end(); ++i) {\n\t\tif (i != courses.end()-1)\n\t\t\tos << *i << endl;\n\t\telse\n\t\t\tos << *i;\n\t}\n\n\treturn os;\n}\n\nvoid Student::display() {\n\tcout << *this << endl;\n};\n\nostream& operator<<(ostream& os, Student& item) {\n\treturn item.getData(os);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by Lucas on 10\/15\/2016.\n\/\/\n\n#include \"first.h\"\n\nFirstSet *first(GramaticalRule *gramaticalrule)\n{\n    int mudou = 0;\n    while (mudou)\n    {\n\n    }\n\n}\n<commit_msg>Iniciando implementação algoritmo First<commit_after>\/\/\n\/\/ Created by Lucas on 10\/15\/2016.\n\/\/\n\n#include \"first.h\"\n\nFirstSet *first(GramaticalRule *gramaticalrule)\n{\n    int mudou = 0;\n    do\n    {\n        GramaticalRule currentrule = gramaticalrule;\n        while (currentrule != NULL)\n        {\n\n            currentrule = currentrule.next;\n        }\n\n\n    } while (mudou);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include<iostream>\n#include<stdio.h>\nusing namespace std;\nint main()\n{\n\tprintf(\"hello world!\\n\");\n\treturn 0;\n}\n<commit_msg>\tmodified:   hello.cpp<commit_after>#include<iostream>\n#include<stdio.h>\nusing namespace std;\nint main()\n{\n\tprintf(\"hello world from linux!\\n\");\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=============================================================================\n  NiftyLink:  A software library to facilitate communication over OpenIGTLink.\n\n  Copyright (c) University College London (UCL). All rights reserved.\n\n  This software is distributed WITHOUT ANY WARRANTY; without even\n  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n  PURPOSE.\n\n  See LICENSE.txt in the top level directory for details.\n=============================================================================*\/\n#include \"NiftyLinkTcpClient.h\"\n#include \"NiftyLinkTcpNetworkWorker.h\"\n#include <NiftyLinkQThread.h>\n#include <NiftyLinkUtils.h>\n\n#include <igtlMessageBase.h>\n#include <QsLog.h>\n#include <QMutexLocker>\n\nnamespace niftk\n{\n\n\/\/-----------------------------------------------------------------------------\nNiftyLinkTcpClient::NiftyLinkTcpClient(QObject *parent)\n: QObject(parent)\n, m_State(UNCONNECTED)\n, m_Socket(NULL)\n, m_Worker(NULL)\n, m_Thread(NULL)\n, m_RequestedName(\"\")\n, m_RequestedPort(-1)\n{\n  this->setObjectName(\"NiftyLinkTcpClient\");\n  QLOG_INFO() << QObject::tr(\"%1::NiftyLinkTcpClient() - creating.\").arg(objectName());\n\n  qRegisterMetaType<QAbstractSocket::SocketError>(\"QAbstractSocket::SocketError\");\n  qRegisterMetaType<NiftyLinkMessageContainer::Pointer>(\"NiftyLinkMessageContainer::Pointer\");\n  qRegisterMetaType<NiftyLinkMessageStatsContainer>(\"NiftyLinkMessageStatsContainer\");\n\n  \/\/ This is to make sure we have the best possible system timer.\n#if defined(_WIN32) && !defined(__CYGWIN__)\n  niftk::InitializeWinTimers();\n#endif\n\n  \/\/ We create all this here, so we know that m_Socket and m_Worker are always populated.\n  m_Socket = new QTcpSocket();\n  connect(m_Socket, SIGNAL(connected()), this, SLOT(OnConnected()));\n  connect(m_Socket, SIGNAL(error(QAbstractSocket::SocketError)), this, SLOT(OnError()));\n  m_Worker = new NiftyLinkTcpNetworkWorker(\"NiftyLinkTcpClientWorker\", &m_InboundMessages, &m_OutboundMessages, m_Socket);\n\n  QLOG_INFO() << QObject::tr(\"%1::NiftyLinkTcpClient() - created.\").arg(objectName());\n}\n\n\n\/\/-----------------------------------------------------------------------------\nNiftyLinkTcpClient::~NiftyLinkTcpClient()\n{\n  QString name = objectName();\n  QLOG_INFO() << QObject::tr(\"%1::~NiftyLinkTcpClient() - destroying.\").arg(name);\n\n  if (m_State != UNCONNECTED)\n  {\n    \/\/ Not sure if we need this, if we are not connected yet, we could just destroy this object?\n    if (m_State == CONNECTING)\n    {\n      while(m_State != CONNECTED)\n      {\n        QCoreApplication::processEvents();\n        NiftyLinkQThread::SleepCallingThread(1);\n      }\n    }\n\n    \/\/ We have to request, and then wait for eveything to shut-down.\n    if (this->IsConnected())\n    {\n      \/\/ This should block\/wait until the worker really is shutdown,\n      \/\/ and everything disconnected, so that we really are ready to destroy this.\n      this->DisconnectFromHost();\n    }\n\n    while(m_State != SHUTDOWN)\n    {\n      QCoreApplication::processEvents();\n      NiftyLinkQThread::SleepCallingThread(1);\n    }\n\n    NiftyLinkQThread::SleepCallingThread(1000);\n  }\n\n  QLOG_INFO() << QObject::tr(\"%1::~NiftyLinkTcpClient() - destroyed.\").arg(name);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nNiftyLinkTcpClient::ClientState NiftyLinkTcpClient::GetState() const\n{\n  QMutexLocker locker(&m_Mutex);\n  return m_State;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool NiftyLinkTcpClient::IsConnected() const\n{\n  QMutexLocker locker(&m_Mutex);\n  return m_State == CONNECTED;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nint NiftyLinkTcpClient::GetRequestedPort() const\n{\n  QMutexLocker locker(&m_Mutex);\n  return m_RequestedPort;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::SetNumberMessageReceivedThreshold(qint64 threshold)\n{\n  m_Worker->SetNumberMessageReceivedThreshold(threshold);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::SetKeepAliveOn(bool isOn)\n{\n  m_Worker->SetKeepAliveOn(isOn);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::SetCheckForNoIncomingData(bool isOn)\n{\n  m_Worker->SetCheckForNoIncomingData(isOn);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OutputStats()\n{\n  m_Worker->OutputStatsToConsole();\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::RequestStats()\n{\n  m_Worker->RequestStats();\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool NiftyLinkTcpClient::Send(NiftyLinkMessageContainer::Pointer message)\n{\n  return m_Worker->Send(message);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::DisconnectFromHost()\n{\n  if (!this->IsConnected())\n  {\n    QLOG_WARN() << QObject::tr(\"%1::DisconnectFromHost() - received request to disconnect, when not connected, so I'm ignoring it.\").arg(objectName());\n    return;\n  }\n\n  \/\/ This triggers the shutdown process.\n  m_Worker->RequestDisconnectSocket();\n\n  \/\/ We MUST wait until the thread is shutdown, and then objects deleted.\n  while(m_State != SHUTDOWN)\n  {\n    QCoreApplication::processEvents();\n    NiftyLinkQThread::SleepCallingThread(1);\n  }\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnMessageReceived(int portNumber)\n{\n  NiftyLinkMessageContainer::Pointer msg = m_InboundMessages.GetContainer(portNumber);\n  emit MessageReceived(msg);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnError()\n{\n  \/\/ Remember, this method is called when the socket is registered with this class, and being processing in this event loop.\n  QLOG_ERROR() << QObject::tr(\"%1::OnError() - code=%2, string=%3\").arg(objectName()).arg(m_Socket->error()).arg(m_Socket->errorString());\n  emit SocketError(this->m_RequestedName, this->m_RequestedPort, m_Socket->error(), m_Socket->errorString());\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnWorkerSocketError(int portNumber, QAbstractSocket::SocketError errorCode, QString errorString)\n{\n  \/\/ Remember, this method is called when the socket has moved into the worker object, and being processed in the worker thread.\n  QLOG_ERROR() << QObject::tr(\"%1::OnWorkerSocketError() - code=%2, string=%3\").arg(objectName()).arg(errorCode).arg(errorString);\n  emit SocketError(this->m_RequestedName, this->m_RequestedPort, errorCode, errorString);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::RaiseInternalError(const QString& errorMessage)\n{\n  QLOG_ERROR() << QObject::tr(\"%1::RaiseInternalError() - message=%2\").arg(objectName()).arg(errorMessage);\n  emit ClientError(this->m_RequestedName, this->m_RequestedPort, errorMessage);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::ConnectToHost(const QString& hostName, quint16 portNumber)\n{\n  QMutexLocker locker(&m_Mutex);\n\n  m_State = CONNECTING;\n  m_RequestedName = hostName;\n  m_RequestedPort = portNumber;\n\n  \/\/ There are no errors reported from this. Listen to the error signal, see OnError().\n  m_Socket->connectToHost(m_RequestedName, m_RequestedPort);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnConnected()\n{\n  QMutexLocker locker(&m_Mutex);\n\n  this->setObjectName(QObject::tr(\"NiftyLinkTcpClient(%1:%2)\").arg(m_Socket->peerName()).arg(m_Socket->peerPort()));\n  m_Worker->UpdateObjectName();\n\n  m_Socket->setSocketOption(QAbstractSocket::LowDelayOption, 1);\n\n  m_Thread = new NiftyLinkQThread();\n  connect(m_Thread, SIGNAL(finished()), m_Thread, SLOT(deleteLater())); \/\/ i.e. the event loop of thread deletes it when control returns to this event loop.\n  connect(m_Thread, SIGNAL(finished()), this, SLOT(OnThreadFinished()), Qt::BlockingQueuedConnection);\n\n  m_Worker->moveToThread(m_Thread);\n  m_Socket->moveToThread(m_Thread);\n\n  connect(m_Worker, SIGNAL(SocketError(int,QAbstractSocket::SocketError,QString)), this, SLOT(OnWorkerSocketError(int,QAbstractSocket::SocketError,QString)));\n  connect(m_Worker, SIGNAL(NoIncomingData()), this, SIGNAL(NoIncomingData()));\n  connect(m_Worker, SIGNAL(SentKeepAlive()), this, SIGNAL(SentKeepAlive()));\n  connect(m_Worker, SIGNAL(BytesSent(qint64)), this, SIGNAL(BytesSent(qint64)));\n  connect(m_Worker, SIGNAL(MessageReceived(int)), this, SLOT(OnMessageReceived(int)));\n  connect(m_Worker, SIGNAL(SocketDisconnected()), this, SLOT(OnDisconnected()), Qt::BlockingQueuedConnection);\n\n  m_Thread->start();\n  m_State = CONNECTED;\n\n  QLOG_INFO() << QObject::tr(\"%1::OnConnected() - socket connected.\").arg(objectName());\n  emit Connected(this->m_RequestedName, this->m_RequestedPort);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnDisconnected()\n{\n  QMutexLocker locker(&m_Mutex);\n  m_State = SHUTTINGDOWN;\n\n  QLOG_INFO() << QObject::tr(\"%1::OnDisconnected() - worker disconnected.\").arg(objectName());\n  emit Disconnected(this->m_RequestedName, this->m_RequestedPort);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnThreadFinished()\n{\n  QMutexLocker locker(&m_Mutex);\n  m_State = SHUTDOWN;\n\n  QLOG_INFO() << QObject::tr(\"%1::OnThreadFinished().\").arg(objectName());\n}\n\n} \/\/ end niftk namespace\n<commit_msg>Bug #3609: Reduce scope of locking<commit_after>\/*=============================================================================\n  NiftyLink:  A software library to facilitate communication over OpenIGTLink.\n\n  Copyright (c) University College London (UCL). All rights reserved.\n\n  This software is distributed WITHOUT ANY WARRANTY; without even\n  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n  PURPOSE.\n\n  See LICENSE.txt in the top level directory for details.\n=============================================================================*\/\n#include \"NiftyLinkTcpClient.h\"\n#include \"NiftyLinkTcpNetworkWorker.h\"\n#include <NiftyLinkQThread.h>\n#include <NiftyLinkUtils.h>\n\n#include <igtlMessageBase.h>\n#include <QsLog.h>\n#include <QMutexLocker>\n\nnamespace niftk\n{\n\n\/\/-----------------------------------------------------------------------------\nNiftyLinkTcpClient::NiftyLinkTcpClient(QObject *parent)\n: QObject(parent)\n, m_State(UNCONNECTED)\n, m_Socket(NULL)\n, m_Worker(NULL)\n, m_Thread(NULL)\n, m_RequestedName(\"\")\n, m_RequestedPort(-1)\n{\n  this->setObjectName(\"NiftyLinkTcpClient\");\n  QLOG_INFO() << QObject::tr(\"%1::NiftyLinkTcpClient() - creating.\").arg(objectName());\n\n  qRegisterMetaType<QAbstractSocket::SocketError>(\"QAbstractSocket::SocketError\");\n  qRegisterMetaType<NiftyLinkMessageContainer::Pointer>(\"NiftyLinkMessageContainer::Pointer\");\n  qRegisterMetaType<NiftyLinkMessageStatsContainer>(\"NiftyLinkMessageStatsContainer\");\n\n  \/\/ This is to make sure we have the best possible system timer.\n#if defined(_WIN32) && !defined(__CYGWIN__)\n  niftk::InitializeWinTimers();\n#endif\n\n  \/\/ We create all this here, so we know that m_Socket and m_Worker are always populated.\n  m_Socket = new QTcpSocket();\n  connect(m_Socket, SIGNAL(connected()), this, SLOT(OnConnected()));\n  connect(m_Socket, SIGNAL(error(QAbstractSocket::SocketError)), this, SLOT(OnError()));\n  m_Worker = new NiftyLinkTcpNetworkWorker(\"NiftyLinkTcpClientWorker\", &m_InboundMessages, &m_OutboundMessages, m_Socket);\n\n  QLOG_INFO() << QObject::tr(\"%1::NiftyLinkTcpClient() - created.\").arg(objectName());\n}\n\n\n\/\/-----------------------------------------------------------------------------\nNiftyLinkTcpClient::~NiftyLinkTcpClient()\n{\n  QString name = objectName();\n  QLOG_INFO() << QObject::tr(\"%1::~NiftyLinkTcpClient() - destroying.\").arg(name);\n\n  if (m_State != UNCONNECTED)\n  {\n    \/\/ Not sure if we need this, if we are not connected yet, we could just destroy this object?\n    if (m_State == CONNECTING)\n    {\n      while(m_State != CONNECTED)\n      {\n        QCoreApplication::processEvents();\n        NiftyLinkQThread::SleepCallingThread(1);\n      }\n    }\n\n    \/\/ We have to request, and then wait for eveything to shut-down.\n    if (this->IsConnected())\n    {\n      \/\/ This should block\/wait until the worker really is shutdown,\n      \/\/ and everything disconnected, so that we really are ready to destroy this.\n      this->DisconnectFromHost();\n    }\n\n    while(m_State != SHUTDOWN)\n    {\n      QCoreApplication::processEvents();\n      NiftyLinkQThread::SleepCallingThread(1);\n    }\n    NiftyLinkQThread::SleepCallingThread(1000);\n  }\n\n  QLOG_INFO() << QObject::tr(\"%1::~NiftyLinkTcpClient() - destroyed.\").arg(name);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nNiftyLinkTcpClient::ClientState NiftyLinkTcpClient::GetState() const\n{\n  QMutexLocker locker(&m_Mutex);\n  return m_State;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool NiftyLinkTcpClient::IsConnected() const\n{\n  QMutexLocker locker(&m_Mutex);\n  return m_State == CONNECTED;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nint NiftyLinkTcpClient::GetRequestedPort() const\n{\n  QMutexLocker locker(&m_Mutex);\n  return m_RequestedPort;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::SetNumberMessageReceivedThreshold(qint64 threshold)\n{\n  m_Worker->SetNumberMessageReceivedThreshold(threshold);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::SetKeepAliveOn(bool isOn)\n{\n  m_Worker->SetKeepAliveOn(isOn);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::SetCheckForNoIncomingData(bool isOn)\n{\n  m_Worker->SetCheckForNoIncomingData(isOn);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OutputStats()\n{\n  m_Worker->OutputStatsToConsole();\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::RequestStats()\n{\n  m_Worker->RequestStats();\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool NiftyLinkTcpClient::Send(NiftyLinkMessageContainer::Pointer message)\n{\n  return m_Worker->Send(message);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::DisconnectFromHost()\n{\n  if (!this->IsConnected())\n  {\n    QLOG_WARN() << QObject::tr(\"%1::DisconnectFromHost() - received request to disconnect, when not connected, so I'm ignoring it.\").arg(objectName());\n    return;\n  }\n\n  \/\/ This triggers the shutdown process.\n  m_Worker->RequestDisconnectSocket();\n\n  \/\/ We MUST wait until the thread is shutdown, and then objects deleted.\n  while(m_State != SHUTDOWN)\n  {\n    QCoreApplication::processEvents();\n    NiftyLinkQThread::SleepCallingThread(1);\n  }\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnMessageReceived(int portNumber)\n{\n  NiftyLinkMessageContainer::Pointer msg = m_InboundMessages.GetContainer(portNumber);\n  emit MessageReceived(msg);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnError()\n{\n  \/\/ Remember, this method is called when the socket is registered with this class, and being processing in this event loop.\n  QLOG_ERROR() << QObject::tr(\"%1::OnError() - code=%2, string=%3\").arg(objectName()).arg(m_Socket->error()).arg(m_Socket->errorString());\n  emit SocketError(this->m_RequestedName, this->m_RequestedPort, m_Socket->error(), m_Socket->errorString());\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnWorkerSocketError(int portNumber, QAbstractSocket::SocketError errorCode, QString errorString)\n{\n  \/\/ Remember, this method is called when the socket has moved into the worker object, and being processed in the worker thread.\n  QLOG_ERROR() << QObject::tr(\"%1::OnWorkerSocketError() - code=%2, string=%3\").arg(objectName()).arg(errorCode).arg(errorString);\n  emit SocketError(this->m_RequestedName, this->m_RequestedPort, errorCode, errorString);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::RaiseInternalError(const QString& errorMessage)\n{\n  QLOG_ERROR() << QObject::tr(\"%1::RaiseInternalError() - message=%2\").arg(objectName()).arg(errorMessage);\n  emit ClientError(this->m_RequestedName, this->m_RequestedPort, errorMessage);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::ConnectToHost(const QString& hostName, quint16 portNumber)\n{\n  {\n    QMutexLocker locker(&m_Mutex);\n    m_State = CONNECTING;\n    m_RequestedName = hostName;\n    m_RequestedPort = portNumber;\n  }\n\n  \/\/ There are no errors reported from this. Listen to the error signal, see OnError().\n  m_Socket->connectToHost(m_RequestedName, m_RequestedPort);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnConnected()\n{\n  this->setObjectName(QObject::tr(\"NiftyLinkTcpClient(%1:%2)\").arg(m_Socket->peerName()).arg(m_Socket->peerPort()));\n  m_Worker->UpdateObjectName();\n\n  m_Socket->setSocketOption(QAbstractSocket::LowDelayOption, 1);\n\n  m_Thread = new NiftyLinkQThread();\n  connect(m_Thread, SIGNAL(finished()), m_Thread, SLOT(deleteLater())); \/\/ i.e. the event loop of thread deletes it when control returns to this event loop.\n  connect(m_Thread, SIGNAL(finished()), this, SLOT(OnThreadFinished()), Qt::BlockingQueuedConnection);\n\n  m_Worker->moveToThread(m_Thread);\n  m_Socket->moveToThread(m_Thread);\n\n  connect(m_Worker, SIGNAL(SocketError(int,QAbstractSocket::SocketError,QString)), this, SLOT(OnWorkerSocketError(int,QAbstractSocket::SocketError,QString)));\n  connect(m_Worker, SIGNAL(NoIncomingData()), this, SIGNAL(NoIncomingData()));\n  connect(m_Worker, SIGNAL(SentKeepAlive()), this, SIGNAL(SentKeepAlive()));\n  connect(m_Worker, SIGNAL(BytesSent(qint64)), this, SIGNAL(BytesSent(qint64)));\n  connect(m_Worker, SIGNAL(MessageReceived(int)), this, SLOT(OnMessageReceived(int)));\n  connect(m_Worker, SIGNAL(SocketDisconnected()), this, SLOT(OnDisconnected()), Qt::BlockingQueuedConnection);\n\n  {\n    QMutexLocker locker(&m_Mutex);\n    m_Thread->start();\n    m_State = CONNECTED;\n  }\n\n  QLOG_INFO() << QObject::tr(\"%1::OnConnected() - socket connected.\").arg(objectName());\n  emit Connected(this->m_RequestedName, this->m_RequestedPort);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnDisconnected()\n{\n  QMutexLocker locker(&m_Mutex);\n  m_State = SHUTTINGDOWN;\n\n  QLOG_INFO() << QObject::tr(\"%1::OnDisconnected() - worker disconnected.\").arg(objectName());\n  emit Disconnected(this->m_RequestedName, this->m_RequestedPort);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid NiftyLinkTcpClient::OnThreadFinished()\n{\n  QMutexLocker locker(&m_Mutex);\n  m_State = SHUTDOWN;\n\n  QLOG_INFO() << QObject::tr(\"%1::OnThreadFinished().\").arg(objectName());\n}\n\n} \/\/ end niftk namespace\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 \"content\/renderer\/media\/stream_texture_factory_impl_android.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop_proxy.h\"\n#include \"base\/synchronization\/lock.h\"\n#include \"content\/common\/android\/surface_texture_peer.h\"\n#include \"content\/common\/gpu\/client\/gpu_channel_host.h\"\n#include \"content\/common\/gpu\/gpu_messages.h\"\n#include \"content\/renderer\/render_thread_impl.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebStreamTextureClient.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebGraphicsContext3D.h\"\n#include \"ui\/gfx\/size.h\"\n\nnamespace {\n\nstatic void DeleteStreamTextureHost(content::StreamTextureHost* host) {\n  delete host;\n}\n\n\/\/ Implementation of the StreamTextureProxy class. This class listens to all\n\/\/ the stream texture updates and forward them to the WebStreamTextureClient.\nclass StreamTextureProxyImpl : public webkit_media::StreamTextureProxy,\n                               public content::StreamTextureHost::Listener {\n public:\n  explicit StreamTextureProxyImpl(content::StreamTextureHost* host);\n  virtual ~StreamTextureProxyImpl();\n\n  \/\/ webkit_media::StreamTextureProxy implementation:\n  virtual bool Initialize(int stream_id, int width, int height) OVERRIDE;\n  virtual bool IsInitialized() OVERRIDE { return initialized_; }\n  virtual void SetClient(WebKit::WebStreamTextureClient* client) OVERRIDE;\n\n  \/\/ StreamTextureHost::Listener implementation:\n  virtual void OnFrameAvailable() OVERRIDE;\n  virtual void OnMatrixChanged(const float matrix[16]) OVERRIDE;\n\n private:\n  scoped_ptr<content::StreamTextureHost> host_;\n  scoped_refptr<base::MessageLoopProxy> loop_;\n\n  base::Lock client_lock_;\n  WebKit::WebStreamTextureClient* client_;\n  bool initialized_;\n\n  DISALLOW_COPY_AND_ASSIGN(StreamTextureProxyImpl);\n};\n\nStreamTextureProxyImpl::StreamTextureProxyImpl(\n    content::StreamTextureHost* host)\n    : host_(host),\n      client_(NULL),\n      initialized_(false) {\n  DCHECK(host);\n  host->SetListener(this);\n}\n\nStreamTextureProxyImpl::~StreamTextureProxyImpl() {\n  SetClient(NULL);\n  \/\/ The StreamTextureHost instance needs to be deleted on the thread\n  \/\/ it receives messages on (where it uses a WeakPtr).\n  if (loop_.get()) {\n    loop_->PostTask(FROM_HERE, base::Bind(&DeleteStreamTextureHost,\n                                          host_.release()));\n  }\n}\n\nvoid StreamTextureProxyImpl::SetClient(WebKit::WebStreamTextureClient* client) {\n  base::AutoLock lock(client_lock_);\n  client_ = client;\n}\n\nbool StreamTextureProxyImpl::Initialize(int stream_id, int width, int height) {\n  loop_ = base::MessageLoopProxy::current();\n  initialized_ = true;\n  return host_->Initialize(stream_id, gfx::Size(width, height));\n}\n\nvoid StreamTextureProxyImpl::OnFrameAvailable() {\n  base::AutoLock lock(client_lock_);\n  if (client_)\n    client_->didReceiveFrame();\n}\n\nvoid StreamTextureProxyImpl::OnMatrixChanged(const float matrix[16]) {\n  base::AutoLock lock(client_lock_);\n  if (client_)\n    client_->didUpdateMatrix(matrix);\n}\n\n}  \/\/ anonymous namespace\n\nnamespace content {\n\nStreamTextureFactoryImpl::StreamTextureFactoryImpl(\n    WebKit::WebGraphicsContext3D* context,\n    GpuChannelHost* channel,\n    int view_id)\n    : context_(context),\n      channel_(channel),\n      view_id_(view_id) {\n  DCHECK(context_);\n  DCHECK(channel);\n}\n\nStreamTextureFactoryImpl::~StreamTextureFactoryImpl() {\n}\n\nwebkit_media::StreamTextureProxy* StreamTextureFactoryImpl::CreateProxy() {\n  DCHECK(channel_.get());\n  StreamTextureHost* host = new StreamTextureHost(channel_.get());\n  return new StreamTextureProxyImpl(host);\n}\n\nvoid StreamTextureFactoryImpl::EstablishPeer(int stream_id, int player_id) {\n  DCHECK(channel_.get());\n  channel_->Send(new GpuChannelMsg_EstablishStreamTexture(\n      stream_id, SurfaceTexturePeer::SET_VIDEO_SURFACE_TEXTURE,\n      view_id_, player_id));\n}\n\nunsigned StreamTextureFactoryImpl::CreateStreamTexture(unsigned* texture_id) {\n  unsigned stream_id = 0;\n  if (context_->makeContextCurrent()) {\n    *texture_id = context_->createTexture();\n    \/\/ TODO(qinmin): upstream the implementation of\n    \/\/ WebGraphicsContext::createStreamTextureCHROMIUM().\n    \/\/ stream_id = context_->createStreamTextureCHROMIUM(*texture_id);\n    context_->flush();\n  }\n  return stream_id;\n}\n\nvoid StreamTextureFactoryImpl::DestroyStreamTexture(unsigned texture_id) {\n  if (context_->makeContextCurrent()) {\n    \/\/ TODO(qinmin): upstream the implementation of\n    \/\/ WebGraphicsContext::destroyStreamTextureCHROMIUM().\n    \/\/ context_->destroyStreamTextureCHROMIUM(texture_id);\n    context_->deleteTexture(texture_id);\n    context_->flush();\n  }\n}\n\n}  \/\/ namespace content\n<commit_msg>Uncomment calls to createStreamTextureChomium and destroyStreamTextureChromium<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 \"content\/renderer\/media\/stream_texture_factory_impl_android.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop_proxy.h\"\n#include \"base\/synchronization\/lock.h\"\n#include \"content\/common\/android\/surface_texture_peer.h\"\n#include \"content\/common\/gpu\/client\/gpu_channel_host.h\"\n#include \"content\/common\/gpu\/gpu_messages.h\"\n#include \"content\/renderer\/render_thread_impl.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebStreamTextureClient.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebGraphicsContext3D.h\"\n#include \"ui\/gfx\/size.h\"\n\nnamespace {\n\nstatic void DeleteStreamTextureHost(content::StreamTextureHost* host) {\n  delete host;\n}\n\n\/\/ Implementation of the StreamTextureProxy class. This class listens to all\n\/\/ the stream texture updates and forward them to the WebStreamTextureClient.\nclass StreamTextureProxyImpl : public webkit_media::StreamTextureProxy,\n                               public content::StreamTextureHost::Listener {\n public:\n  explicit StreamTextureProxyImpl(content::StreamTextureHost* host);\n  virtual ~StreamTextureProxyImpl();\n\n  \/\/ webkit_media::StreamTextureProxy implementation:\n  virtual bool Initialize(int stream_id, int width, int height) OVERRIDE;\n  virtual bool IsInitialized() OVERRIDE { return initialized_; }\n  virtual void SetClient(WebKit::WebStreamTextureClient* client) OVERRIDE;\n\n  \/\/ StreamTextureHost::Listener implementation:\n  virtual void OnFrameAvailable() OVERRIDE;\n  virtual void OnMatrixChanged(const float matrix[16]) OVERRIDE;\n\n private:\n  scoped_ptr<content::StreamTextureHost> host_;\n  scoped_refptr<base::MessageLoopProxy> loop_;\n\n  base::Lock client_lock_;\n  WebKit::WebStreamTextureClient* client_;\n  bool initialized_;\n\n  DISALLOW_COPY_AND_ASSIGN(StreamTextureProxyImpl);\n};\n\nStreamTextureProxyImpl::StreamTextureProxyImpl(\n    content::StreamTextureHost* host)\n    : host_(host),\n      client_(NULL),\n      initialized_(false) {\n  DCHECK(host);\n  host->SetListener(this);\n}\n\nStreamTextureProxyImpl::~StreamTextureProxyImpl() {\n  SetClient(NULL);\n  \/\/ The StreamTextureHost instance needs to be deleted on the thread\n  \/\/ it receives messages on (where it uses a WeakPtr).\n  if (loop_.get()) {\n    loop_->PostTask(FROM_HERE, base::Bind(&DeleteStreamTextureHost,\n                                          host_.release()));\n  }\n}\n\nvoid StreamTextureProxyImpl::SetClient(WebKit::WebStreamTextureClient* client) {\n  base::AutoLock lock(client_lock_);\n  client_ = client;\n}\n\nbool StreamTextureProxyImpl::Initialize(int stream_id, int width, int height) {\n  loop_ = base::MessageLoopProxy::current();\n  initialized_ = true;\n  return host_->Initialize(stream_id, gfx::Size(width, height));\n}\n\nvoid StreamTextureProxyImpl::OnFrameAvailable() {\n  base::AutoLock lock(client_lock_);\n  if (client_)\n    client_->didReceiveFrame();\n}\n\nvoid StreamTextureProxyImpl::OnMatrixChanged(const float matrix[16]) {\n  base::AutoLock lock(client_lock_);\n  if (client_)\n    client_->didUpdateMatrix(matrix);\n}\n\n}  \/\/ anonymous namespace\n\nnamespace content {\n\nStreamTextureFactoryImpl::StreamTextureFactoryImpl(\n    WebKit::WebGraphicsContext3D* context,\n    GpuChannelHost* channel,\n    int view_id)\n    : context_(context),\n      channel_(channel),\n      view_id_(view_id) {\n  DCHECK(context_);\n  DCHECK(channel);\n}\n\nStreamTextureFactoryImpl::~StreamTextureFactoryImpl() {\n}\n\nwebkit_media::StreamTextureProxy* StreamTextureFactoryImpl::CreateProxy() {\n  DCHECK(channel_.get());\n  StreamTextureHost* host = new StreamTextureHost(channel_.get());\n  return new StreamTextureProxyImpl(host);\n}\n\nvoid StreamTextureFactoryImpl::EstablishPeer(int stream_id, int player_id) {\n  DCHECK(channel_.get());\n  channel_->Send(new GpuChannelMsg_EstablishStreamTexture(\n      stream_id, SurfaceTexturePeer::SET_VIDEO_SURFACE_TEXTURE,\n      view_id_, player_id));\n}\n\nunsigned StreamTextureFactoryImpl::CreateStreamTexture(unsigned* texture_id) {\n  unsigned stream_id = 0;\n  if (context_->makeContextCurrent()) {\n    *texture_id = context_->createTexture();\n    stream_id = context_->createStreamTextureCHROMIUM(*texture_id);\n    context_->flush();\n  }\n  return stream_id;\n}\n\nvoid StreamTextureFactoryImpl::DestroyStreamTexture(unsigned texture_id) {\n  if (context_->makeContextCurrent()) {\n    context_->destroyStreamTextureCHROMIUM(texture_id);\n    context_->deleteTexture(texture_id);\n    context_->flush();\n  }\n}\n\n}  \/\/ namespace content\n<|endoftext|>"}
{"text":"<commit_before>#include \"common\/common.h\"\n#include \"common\/generation.h\"\n#include \"common\/parser.h\"\n#include \"common\/input_output.h\"\nChVector<> lpos(0, 0, 0);\nChQuaternion<> quat(1, 0, 0, 0);\n\n\/\/all dimensions are in millimeters, milligrams\nreal container_width = 5;     \/\/width of area with particles\nreal container_length = 25;     \/\/length of area that roller will go over\t\t1194mm maximum\nreal container_thickness = .25;     \/\/thickness of container walls\nreal container_height = 2;     \/\/height of the outer walls\nreal container_friction = 0;\nreal floor_friction = .2;\nreal spacer_width = 1;\nreal spacer_height = 1;\n\nreal roller_overlap = 1;     \/\/amount that roller goes over the container area\nreal roller_length = 2.5 - .25;     \/\/length of the roller\nreal roller_radius = 76.2 \/ 2.0;     \/\/radius of roller\nreal roller_omega = 0;\nreal roller_velocity = -127;\nreal roller_mass = 1;\nreal roller_friction = .1;\nreal roller_cohesion = 0;\nreal particle_radius = .058 \/ 2.0;\nreal particle_std_dev = .015 \/ 2.0;\nreal particle_mass = .05;\nreal particle_density = 0.93;\nreal particle_layer_thickness = particle_radius * 12;\nreal particle_friction = .52;\nreal rolling_friction = .1;\nreal spinning_friction = .1;\nreal gravity = -9810;     \/\/acceleration due to gravity\nreal timestep = .00001;     \/\/step size\nreal time_to_run = 1;     \/\/length of simulation\nreal current_time = 0;\n\nint num_steps = time_to_run \/ timestep;\nint max_iteration = 20;\nint tolerance = 0;\n\nstring data_folder = \"data\/sls\";\nChSharedBodyPtr ROLLER;\nreal ang = 0;\n\ntemplate<class T>\nvoid RunTimeStep(T* mSys, const int frame) {\n\tChVector<> roller_pos = ROLLER->GetPos();\n\n\tROLLER->SetPos(ChVector<>(0, roller_radius + particle_layer_thickness + container_thickness, roller_pos.z + roller_velocity * timestep));\n\tROLLER->SetPos_dt(ChVector<>(0, 0, roller_velocity));\n\troller_omega = roller_velocity \/ roller_radius;\n\tang += roller_omega * timestep;\n\tif (ang >= 2 * CH_C_PI) {\n\t\tang = 0;\n\t}\n\n\tQuaternion q1;\n\tq1.Q_from_AngY(ang);\n\tQuaternion q2;\n\tq1 = Q_from_AngX(-ang);\n\n\tChQuaternion<> roller_quat;\n\troller_quat.Q_from_AngAxis(PI \/ 2.0, ChVector<>(0, 0, 1));\n\n\tROLLER->SetRot(q1 % roller_quat);\n\tROLLER->SetWvel_loc(Vector(0, roller_omega, 0));\n\n\tcout << ROLLER->GetPos().x << \" \" << ROLLER->GetPos().y << \" \" << ROLLER->GetPos().z << endl;\n\t;\n\n}\nint main(int argc, char* argv[]) {\n\tbool visualize = true;\n\tint config = 0;\n\tbool full_mix = true;\n\tif (argc > 1) {\n\t\tvisualize = atoi(argv[1]);\n\t\tparticle_friction = atof(argv[2]);\n\t\trolling_friction = atof(argv[3]);\n\t\tspinning_friction = atof(argv[4]);\n\t\troller_velocity = -atof(argv[5]);\n\t\tparticle_layer_thickness = atof(argv[6]);\n\t\tfull_mix = atoi(argv[7]);\n\t\tdata_folder = argv[8];\n\t}\n\t\/\/cout << \"Mass, Radius, Friction_Sphere, Friction_Plate, Data Folder, create_particle_plate all_three_kinds, particle configuration\" << endl;\n\t\/\/=========================================================================================================\n\tChSystemParallelDVI * system_gpu = new ChSystemParallelDVI;\n\tsystem_gpu->SetIntegrationType(ChSystem::INT_ANITESCU);\n\t\/\/=========================================================================================================\n\t\/\/system_gpu->SetMaxiter(max_iteration);\n\n\t\/\/system_gpu->SetIterLCPmaxItersSpeed(max_iteration);\n\t\/\/((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetMaxIteration(max_iter);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetMaxIterationNormal(max_iteration * 2);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetMaxIterationSliding(max_iteration);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetMaxIterationSpinning(max_iteration);\n\tsystem_gpu->SetTol(0);\n\tsystem_gpu->SetTolSpeeds(0);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetTolerance(0);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetCompliance(0);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetContactRecoverySpeed(300);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetSolverType(APGDRS);\n\t((ChCollisionSystemParallel *) (system_gpu->GetCollisionSystem()))->SetCollisionEnvelope(particle_radius * .05);\n\t((ChCollisionSystemParallel *) (system_gpu->GetCollisionSystem()))->setBinsPerAxis(I3(40, 200, 100));\n\t((ChCollisionSystemParallel *) (system_gpu->GetCollisionSystem()))->setBodyPerBin(100, 50);\n\t((ChSystemParallelDVI*) system_gpu)->DoThreadTuning(false);\n\t\/\/((ChSystemParallelDVI*) system_gpu)->SetMinThreads(32);\n\tsystem_gpu->Set_G_acc(ChVector<>(0, gravity, 0));\n\tsystem_gpu->SetStep(timestep);\n\n\t\/\/=========================================================================================================\n\t((ChSystemParallel*) system_gpu)->SetAABB(R3(-6, -3, -30), R3(6, 6, 30));\n\n\tChSharedBodyPtr PLATE = ChSharedBodyPtr(new ChBody(new ChCollisionModelParallel));\n\n\tChSharedPtr<ChMaterialSurface> material_plate;\n\tmaterial_plate = ChSharedPtr<ChMaterialSurface>(new ChMaterialSurface);\n\tmaterial_plate->SetFriction(0);\n\n\tInitObject(PLATE, 100000, ChVector<>(0, 0, 0), quat, material_plate, true, true, -20, -20);\n\n\tChSharedPtr<ChMaterialSurface> material;\n\tmaterial = ChSharedPtr<ChMaterialSurface>(new ChMaterialSurface);\n\tmaterial->SetFriction(container_friction);\n\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_thickness, container_height, container_length), Vector(-container_width + container_thickness, container_height, 0), quat);\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_thickness, container_height, container_length), Vector(container_width - container_thickness, container_height, 0), quat);\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_width, container_height, container_thickness), Vector(0, container_height, -container_length + container_thickness), quat);\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_width, container_height, container_thickness), Vector(0, container_height, container_length - container_thickness), quat);\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_width, container_thickness, container_length), Vector(0, container_height*2,0), quat);\n\tFinalizeObject(PLATE, (ChSystemParallel *) system_gpu);\n\n\tChSharedPtr<ChMaterialSurface> material_bottom;\n\tmaterial_bottom = ChSharedPtr<ChMaterialSurface>(new ChMaterialSurface);\n\tmaterial_bottom->SetFriction(floor_friction);\n\n\tChSharedBodyPtr BOTTOM = ChSharedBodyPtr(new ChBody(new ChCollisionModelParallel));\n\tInitObject(BOTTOM, 100000, ChVector<>(0, 0, 0), quat, material_bottom, true, true, -20, -20);\n\tAddCollisionGeometry(BOTTOM, BOX, ChVector<>(container_width, container_thickness, container_length), lpos, quat);\n\n\tFinalizeObject(BOTTOM, (ChSystemParallel *) system_gpu);\n\n\tROLLER = ChSharedBodyPtr(new ChBody(new ChCollisionModelParallel));\n\tChQuaternion<> roller_quat;\n\troller_quat.Q_from_AngAxis(PI \/ 2.0, ChVector<>(0, 0, 1));\n\n\tChSharedPtr<ChMaterialSurface> material_roller;\n\tmaterial_roller = ChSharedPtr<ChMaterialSurface>(new ChMaterialSurface);\n\tmaterial_roller->SetFriction(roller_friction);\n\n\tInitObject(ROLLER, 1000, ChVector<>(0, roller_radius + particle_layer_thickness + container_thickness, container_length + roller_radius \/ 3.0), roller_quat, material_roller,\n\t\t\ttrue, false, -20, -20);\n\tAddCollisionGeometry(ROLLER, CYLINDER, ChVector<>(roller_radius, roller_length * 2, roller_radius), lpos, quat);\n\tFinalizeObject(ROLLER, (ChSystemParallel *) system_gpu);\n\t\/\/68\n\tint3 num_per_dir = I3(1, 1, 1);\n\t\/\/num_per_dir = I3(90, 16, 1);\n\n\tnum_per_dir = I3(90, 16*particle_layer_thickness\/.2032, 540);\n\t\/\/num_per_dir = I3(90, 1, 100);\n\tParticleGenerator < ChSystemParallelDVI > layer_gen(system_gpu);\n\tlayer_gen.SetDensity(particle_density);\n\tlayer_gen.SetRadius(R3(particle_radius));\n\tlayer_gen.SetNormalDistribution(particle_radius, particle_std_dev);\n\tlayer_gen.material->SetFriction(particle_friction);\n\tlayer_gen.material->SetRollingFriction(rolling_friction);\n\tlayer_gen.material->SetSpinningFriction(spinning_friction);\n\n\tif (full_mix) {\n\t\tlayer_gen.AddMixtureType(MIX_SPHERE);\n\t\tlayer_gen.AddMixtureType(MIX_TYPE1);\n\t\tlayer_gen.AddMixtureType(MIX_TYPE2);\n\t\tlayer_gen.AddMixtureType(MIX_TYPE3);\n\t\tlayer_gen.AddMixtureType(MIX_TYPE4);\n\t\tlayer_gen.AddMixtureType(MIX_ELLIPSOID);\n\t\tlayer_gen.AddMixtureType(MIX_DOUBLESPHERE);\n\t}else{\n\t\tlayer_gen.AddMixtureType(MIX_SPHERE);\n\t}\n\n\t\/\/layer_gen.addPerturbedVolume(R3(0, 1.2, 0), SPHERE, num_per_dir, R3(.1, .1, .1), R3(0));\n\n\tlayer_gen.addPerturbedVolumeMixture(R3(0, 1.3, 0), num_per_dir, R3(.1, .1, .1), R3(0));\n\t\/\/num_per_dir = I3(90, 15, 100);\n\t\/\/num_per_dir = I3(90, 15, 50);\n\t\/\/num_per_dir = I3(1, 15, 100);\n\t\/\/num_per_dir = I3(90, 30, 50);\n\t\/\/layer_gen.addPerturbedVolumeMixture(R3(0, 3.2, 15), num_per_dir, R3(.1, .1, .1), R3(0));\n\n\t\/\/=========================================================================================================\n\t\/\/\/\/\/\/Rendering specific stuff:\n\tif (visualize) {\n\t\tChOpenGLManager * window_manager = new ChOpenGLManager();\n\t\tChOpenGL openGLView(window_manager, system_gpu, 800, 600, 0, 0, \"Test_Solvers\");\n\t\topenGLView.render_camera->camera_position = glm::vec3(-50, 0, -50);\n\t\topenGLView.render_camera->camera_look_at = glm::vec3(0, 0, 0);\n\t\topenGLView.SetCustomCallback(RunTimeStep);\n\t\topenGLView.StartSpinning(window_manager);\n\t\twindow_manager->CallGlutMainLoop();\n\t}\n\t\/\/=========================================================================================================\n\tstringstream ss_m;\n\tss_m << data_folder << \"\/\" << \"timing.txt\";\n\tstring timing_file_name = ss_m.str();\n\tofstream ofile(timing_file_name.c_str());\n\tofile.close();\n\tint file = 0;\n\tfor (int i = 0; i < num_steps; i++) {\n\t\tcout << \"step \" << i;\n\t\tcout << \" Residual: \" << ((ChLcpSolverParallel *) (system_gpu->GetLcpSolverSpeed()))->GetResidual();\n\t\tcout << \" ITER: \" << ((ChLcpSolverParallel *) (system_gpu->GetLcpSolverSpeed()))->GetTotalIterations();\n\t\tcout << \" OUTPUT STEP: Time= \" << current_time << \" bodies= \" << system_gpu->GetNbodies() << \" contacts= \" << system_gpu->GetNcontacts() << \" step time=\"\n\t\t\t\t<< system_gpu->GetTimerStep() << \" lcp time=\" << system_gpu->GetTimerLcp() << \" CDbroad time=\" << system_gpu->GetTimerCollisionBroad() << \" CDnarrow time=\"\n\t\t\t\t<< system_gpu->GetTimerCollisionNarrow() << \" Iterations=\" << ((ChLcpSolverParallel*) (system_gpu->GetLcpSolverSpeed()))->GetTotalIterations() << \" \"\n\t\t\t\t<< ROLLER->GetPos().z << \"\\n\";\n\t\t\/\/TimingFile(system_gpu, timing_file_name, current_time);\n\t\tsystem_gpu->DoStepDynamics(timestep);\n\t\tRunTimeStep(system_gpu, i);\n\t\tint save_every = 1.0 \/ timestep \/ 6000.0;     \/\/save data every n steps\n\t\tif (i % save_every == 0) {\n\t\t\tstringstream ss;\n\t\t\tcout << \"Frame: \" << file << endl;\n\t\t\tss << data_folder << \"\/\" << file << \".txt\";\n\t\t\tDumpAllObjectsWithGeometryPovray(system_gpu, ss.str());\n\t\t\t\/\/output.ExportData(ss.str());\n\t\t\tfile++;\n\t\t}\n\t\tif (ROLLER->GetPos().z < -15) {\n\t\t\tbreak;\n\t\t}\n\t\tcurrent_time += timestep;\n\t}\n\tstringstream ss;\n\treturn 0;\n}\n\n<commit_msg>Does setting min threads help, not sure<commit_after>#include \"common\/common.h\"\n#include \"common\/generation.h\"\n#include \"common\/parser.h\"\n#include \"common\/input_output.h\"\nChVector<> lpos(0, 0, 0);\nChQuaternion<> quat(1, 0, 0, 0);\n\n\/\/all dimensions are in millimeters, milligrams\nreal container_width = 5;     \/\/width of area with particles\nreal container_length = 25;     \/\/length of area that roller will go over\t\t1194mm maximum\nreal container_thickness = .25;     \/\/thickness of container walls\nreal container_height = 2;     \/\/height of the outer walls\nreal container_friction = 0;\nreal floor_friction = .2;\nreal spacer_width = 1;\nreal spacer_height = 1;\n\nreal roller_overlap = 1;     \/\/amount that roller goes over the container area\nreal roller_length = 2.5 - .25;     \/\/length of the roller\nreal roller_radius = 76.2 \/ 2.0;     \/\/radius of roller\nreal roller_omega = 0;\nreal roller_velocity = -127;\nreal roller_mass = 1;\nreal roller_friction = .1;\nreal roller_cohesion = 0;\nreal particle_radius = .058 \/ 2.0;\nreal particle_std_dev = .015 \/ 2.0;\nreal particle_mass = .05;\nreal particle_density = 0.93;\nreal particle_layer_thickness = particle_radius * 12;\nreal particle_friction = .52;\nreal rolling_friction = .1;\nreal spinning_friction = .1;\nreal gravity = -9810;     \/\/acceleration due to gravity\nreal timestep = .00001;     \/\/step size\nreal time_to_run = 1;     \/\/length of simulation\nreal current_time = 0;\n\nint num_steps = time_to_run \/ timestep;\nint max_iteration = 20;\nint tolerance = 0;\n\nstring data_folder = \"data\/sls\";\nChSharedBodyPtr ROLLER;\nreal ang = 0;\n\ntemplate<class T>\nvoid RunTimeStep(T* mSys, const int frame) {\n\tChVector<> roller_pos = ROLLER->GetPos();\n\n\tROLLER->SetPos(ChVector<>(0, roller_radius + particle_layer_thickness + container_thickness, roller_pos.z + roller_velocity * timestep));\n\tROLLER->SetPos_dt(ChVector<>(0, 0, roller_velocity));\n\troller_omega = roller_velocity \/ roller_radius;\n\tang += roller_omega * timestep;\n\tif (ang >= 2 * CH_C_PI) {\n\t\tang = 0;\n\t}\n\n\tQuaternion q1;\n\tq1.Q_from_AngY(ang);\n\tQuaternion q2;\n\tq1 = Q_from_AngX(-ang);\n\n\tChQuaternion<> roller_quat;\n\troller_quat.Q_from_AngAxis(PI \/ 2.0, ChVector<>(0, 0, 1));\n\n\tROLLER->SetRot(q1 % roller_quat);\n\tROLLER->SetWvel_loc(Vector(0, roller_omega, 0));\n\n\tcout << ROLLER->GetPos().x << \" \" << ROLLER->GetPos().y << \" \" << ROLLER->GetPos().z << endl;\n\t;\n\n}\nint main(int argc, char* argv[]) {\n\tbool visualize = true;\n\tint config = 0;\n\tbool full_mix = true;\n\tif (argc > 1) {\n\t\tvisualize = atoi(argv[1]);\n\t\tparticle_friction = atof(argv[2]);\n\t\trolling_friction = atof(argv[3]);\n\t\tspinning_friction = atof(argv[4]);\n\t\troller_velocity = -atof(argv[5]);\n\t\tparticle_layer_thickness = atof(argv[6]);\n\t\tfull_mix = atoi(argv[7]);\n\t\tdata_folder = argv[8];\n\t}\n\t\/\/cout << \"Mass, Radius, Friction_Sphere, Friction_Plate, Data Folder, create_particle_plate all_three_kinds, particle configuration\" << endl;\n\t\/\/=========================================================================================================\n\tChSystemParallelDVI * system_gpu = new ChSystemParallelDVI;\n\tsystem_gpu->SetIntegrationType(ChSystem::INT_ANITESCU);\n\t\/\/=========================================================================================================\n\t\/\/system_gpu->SetMaxiter(max_iteration);\n\n\t\/\/system_gpu->SetIterLCPmaxItersSpeed(max_iteration);\n\t\/\/((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetMaxIteration(max_iter);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetMaxIterationNormal(max_iteration * 2);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetMaxIterationSliding(max_iteration);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetMaxIterationSpinning(max_iteration);\n\tsystem_gpu->SetTol(0);\n\tsystem_gpu->SetTolSpeeds(0);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetTolerance(0);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetCompliance(0);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetContactRecoverySpeed(300);\n\t((ChLcpSolverParallelDVI *) (system_gpu->GetLcpSolverSpeed()))->SetSolverType(APGDRS);\n\t((ChCollisionSystemParallel *) (system_gpu->GetCollisionSystem()))->SetCollisionEnvelope(particle_radius * .05);\n\t((ChCollisionSystemParallel *) (system_gpu->GetCollisionSystem()))->setBinsPerAxis(I3(40, 200, 100));\n\t((ChCollisionSystemParallel *) (system_gpu->GetCollisionSystem()))->setBodyPerBin(100, 50);\n\t((ChSystemParallelDVI*) system_gpu)->DoThreadTuning(false);\n\t((ChSystemParallelDVI*) system_gpu)->SetMinThreads(32);\n\tsystem_gpu->Set_G_acc(ChVector<>(0, gravity, 0));\n\tsystem_gpu->SetStep(timestep);\n\n\t\/\/=========================================================================================================\n\t((ChSystemParallel*) system_gpu)->SetAABB(R3(-6, -3, -30), R3(6, 6, 30));\n\n\tChSharedBodyPtr PLATE = ChSharedBodyPtr(new ChBody(new ChCollisionModelParallel));\n\n\tChSharedPtr<ChMaterialSurface> material_plate;\n\tmaterial_plate = ChSharedPtr<ChMaterialSurface>(new ChMaterialSurface);\n\tmaterial_plate->SetFriction(0);\n\n\tInitObject(PLATE, 100000, ChVector<>(0, 0, 0), quat, material_plate, true, true, -20, -20);\n\n\tChSharedPtr<ChMaterialSurface> material;\n\tmaterial = ChSharedPtr<ChMaterialSurface>(new ChMaterialSurface);\n\tmaterial->SetFriction(container_friction);\n\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_thickness, container_height, container_length), Vector(-container_width + container_thickness, container_height, 0), quat);\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_thickness, container_height, container_length), Vector(container_width - container_thickness, container_height, 0), quat);\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_width, container_height, container_thickness), Vector(0, container_height, -container_length + container_thickness), quat);\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_width, container_height, container_thickness), Vector(0, container_height, container_length - container_thickness), quat);\n\tAddCollisionGeometry(PLATE, BOX, Vector(container_width, container_thickness, container_length), Vector(0, container_height*2,0), quat);\n\tFinalizeObject(PLATE, (ChSystemParallel *) system_gpu);\n\n\tChSharedPtr<ChMaterialSurface> material_bottom;\n\tmaterial_bottom = ChSharedPtr<ChMaterialSurface>(new ChMaterialSurface);\n\tmaterial_bottom->SetFriction(floor_friction);\n\n\tChSharedBodyPtr BOTTOM = ChSharedBodyPtr(new ChBody(new ChCollisionModelParallel));\n\tInitObject(BOTTOM, 100000, ChVector<>(0, 0, 0), quat, material_bottom, true, true, -20, -20);\n\tAddCollisionGeometry(BOTTOM, BOX, ChVector<>(container_width, container_thickness, container_length), lpos, quat);\n\n\tFinalizeObject(BOTTOM, (ChSystemParallel *) system_gpu);\n\n\tROLLER = ChSharedBodyPtr(new ChBody(new ChCollisionModelParallel));\n\tChQuaternion<> roller_quat;\n\troller_quat.Q_from_AngAxis(PI \/ 2.0, ChVector<>(0, 0, 1));\n\n\tChSharedPtr<ChMaterialSurface> material_roller;\n\tmaterial_roller = ChSharedPtr<ChMaterialSurface>(new ChMaterialSurface);\n\tmaterial_roller->SetFriction(roller_friction);\n\n\tInitObject(ROLLER, 1000, ChVector<>(0, roller_radius + particle_layer_thickness + container_thickness, container_length + roller_radius \/ 3.0), roller_quat, material_roller,\n\t\t\ttrue, false, -20, -20);\n\tAddCollisionGeometry(ROLLER, CYLINDER, ChVector<>(roller_radius, roller_length * 2, roller_radius), lpos, quat);\n\tFinalizeObject(ROLLER, (ChSystemParallel *) system_gpu);\n\t\/\/68\n\tint3 num_per_dir = I3(1, 1, 1);\n\t\/\/num_per_dir = I3(90, 16, 1);\n\n\tnum_per_dir = I3(90, 16*particle_layer_thickness\/.2032, 540);\n\t\/\/num_per_dir = I3(90, 1, 100);\n\tParticleGenerator < ChSystemParallelDVI > layer_gen(system_gpu);\n\tlayer_gen.SetDensity(particle_density);\n\tlayer_gen.SetRadius(R3(particle_radius));\n\tlayer_gen.SetNormalDistribution(particle_radius, particle_std_dev);\n\tlayer_gen.material->SetFriction(particle_friction);\n\tlayer_gen.material->SetRollingFriction(rolling_friction);\n\tlayer_gen.material->SetSpinningFriction(spinning_friction);\n\n\tif (full_mix) {\n\t\tlayer_gen.AddMixtureType(MIX_SPHERE);\n\t\tlayer_gen.AddMixtureType(MIX_TYPE1);\n\t\tlayer_gen.AddMixtureType(MIX_TYPE2);\n\t\tlayer_gen.AddMixtureType(MIX_TYPE3);\n\t\tlayer_gen.AddMixtureType(MIX_TYPE4);\n\t\tlayer_gen.AddMixtureType(MIX_ELLIPSOID);\n\t\tlayer_gen.AddMixtureType(MIX_DOUBLESPHERE);\n\t}else{\n\t\tlayer_gen.AddMixtureType(MIX_SPHERE);\n\t}\n\n\t\/\/layer_gen.addPerturbedVolume(R3(0, 1.2, 0), SPHERE, num_per_dir, R3(.1, .1, .1), R3(0));\n\n\tlayer_gen.addPerturbedVolumeMixture(R3(0, 1.3, 0), num_per_dir, R3(.1, .1, .1), R3(0));\n\t\/\/num_per_dir = I3(90, 15, 100);\n\t\/\/num_per_dir = I3(90, 15, 50);\n\t\/\/num_per_dir = I3(1, 15, 100);\n\t\/\/num_per_dir = I3(90, 30, 50);\n\t\/\/layer_gen.addPerturbedVolumeMixture(R3(0, 3.2, 15), num_per_dir, R3(.1, .1, .1), R3(0));\n\n\t\/\/=========================================================================================================\n\t\/\/\/\/\/\/Rendering specific stuff:\n\tif (visualize) {\n\t\tChOpenGLManager * window_manager = new ChOpenGLManager();\n\t\tChOpenGL openGLView(window_manager, system_gpu, 800, 600, 0, 0, \"Test_Solvers\");\n\t\topenGLView.render_camera->camera_position = glm::vec3(-50, 0, -50);\n\t\topenGLView.render_camera->camera_look_at = glm::vec3(0, 0, 0);\n\t\topenGLView.SetCustomCallback(RunTimeStep);\n\t\topenGLView.StartSpinning(window_manager);\n\t\twindow_manager->CallGlutMainLoop();\n\t}\n\t\/\/=========================================================================================================\n\tstringstream ss_m;\n\tss_m << data_folder << \"\/\" << \"timing.txt\";\n\tstring timing_file_name = ss_m.str();\n\tofstream ofile(timing_file_name.c_str());\n\tofile.close();\n\tint file = 0;\n\tfor (int i = 0; i < num_steps; i++) {\n\t\tcout << \"step \" << i;\n\t\tcout << \" Residual: \" << ((ChLcpSolverParallel *) (system_gpu->GetLcpSolverSpeed()))->GetResidual();\n\t\tcout << \" ITER: \" << ((ChLcpSolverParallel *) (system_gpu->GetLcpSolverSpeed()))->GetTotalIterations();\n\t\tcout << \" OUTPUT STEP: Time= \" << current_time << \" bodies= \" << system_gpu->GetNbodies() << \" contacts= \" << system_gpu->GetNcontacts() << \" step time=\"\n\t\t\t\t<< system_gpu->GetTimerStep() << \" lcp time=\" << system_gpu->GetTimerLcp() << \" CDbroad time=\" << system_gpu->GetTimerCollisionBroad() << \" CDnarrow time=\"\n\t\t\t\t<< system_gpu->GetTimerCollisionNarrow() << \" Iterations=\" << ((ChLcpSolverParallel*) (system_gpu->GetLcpSolverSpeed()))->GetTotalIterations() << \" \"\n\t\t\t\t<< ROLLER->GetPos().z << \"\\n\";\n\t\t\/\/TimingFile(system_gpu, timing_file_name, current_time);\n\t\tsystem_gpu->DoStepDynamics(timestep);\n\t\tRunTimeStep(system_gpu, i);\n\t\tint save_every = 1.0 \/ timestep \/ 6000.0;     \/\/save data every n steps\n\t\tif (i % save_every == 0) {\n\t\t\tstringstream ss;\n\t\t\tcout << \"Frame: \" << file << endl;\n\t\t\tss << data_folder << \"\/\" << file << \".txt\";\n\t\t\tDumpAllObjectsWithGeometryPovray(system_gpu, ss.str());\n\t\t\t\/\/output.ExportData(ss.str());\n\t\t\tfile++;\n\t\t}\n\t\tif (ROLLER->GetPos().z < -15) {\n\t\t\tbreak;\n\t\t}\n\t\tcurrent_time += timestep;\n\t}\n\tstringstream ss;\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2012 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\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. AND ITS CONTRIBUTORS ``AS IS'' AND ANY\n * 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 APPLE INC. OR ITS CONTRIBUTORS 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 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 \"config.h\"\n\n#include \"ScrollingCoordinator.h\"\n\n#include \"FrameTestHelpers.h\"\n#include \"GraphicsLayerChromium.h\"\n#include \"RenderLayerBacking.h\"\n#include \"RenderLayerCompositor.h\"\n#include \"RenderView.h\"\n#include \"URLTestHelpers.h\"\n#include \"WebCompositorInitializer.h\"\n#include \"WebFrameClient.h\"\n#include \"WebFrameImpl.h\"\n#include \"WebSettings.h\"\n#include \"WebViewClient.h\"\n#include \"WebViewImpl.h\"\n#include <gtest\/gtest.h>\n#include <public\/Platform.h>\n#include <public\/WebLayer.h>\n#include <public\/WebLayerTreeView.h>\n#include <public\/WebUnitTestSupport.h>\n\nusing namespace WebCore;\nusing namespace WebKit;\n\nnamespace {\n\nclass FakeWebViewClient : public WebViewClient {\npublic:\n    virtual void initializeLayerTreeView()\n    {\n        m_layerTreeView = adoptPtr(Platform::current()->unitTestSupport()->createLayerTreeViewForTesting(WebUnitTestSupport::TestViewTypeUnitTest));\n        ASSERT(m_layerTreeView);\n    }\n\n    virtual WebLayerTreeView* layerTreeView()\n    {\n        return m_layerTreeView.get();\n    }\n\nprivate:\n    OwnPtr<WebLayerTreeView> m_layerTreeView;\n};\n\nclass MockWebFrameClient : public WebFrameClient {\n};\n\nclass ScrollingCoordinatorChromiumTest : public testing::Test {\npublic:\n    ScrollingCoordinatorChromiumTest()\n        : m_baseURL(\"http:\/\/www.test.com\/\")\n        , m_compositorInitializer(0)\n    {\n        \/\/ We cannot reuse FrameTestHelpers::createWebViewAndLoad here because the compositing\n        \/\/ settings need to be set before the page is loaded.\n        m_webViewImpl = static_cast<WebViewImpl*>(WebView::create(&m_mockWebViewClient));\n        m_webViewImpl->settings()->setJavaScriptEnabled(true);\n        m_webViewImpl->settings()->setForceCompositingMode(true);\n        m_webViewImpl->settings()->setAcceleratedCompositingEnabled(true);\n        m_webViewImpl->settings()->setAcceleratedCompositingForFixedPositionEnabled(true);\n        m_webViewImpl->settings()->setAcceleratedCompositingForOverflowScrollEnabled(true);\n        m_webViewImpl->settings()->setAcceleratedCompositingForScrollableFramesEnabled(true);\n        m_webViewImpl->settings()->setCompositedScrollingForFramesEnabled(true);\n        m_webViewImpl->settings()->setFixedPositionCreatesStackingContext(true);\n        m_webViewImpl->initializeMainFrame(&m_mockWebFrameClient);\n        m_webViewImpl->resize(IntSize(320, 240));\n    }\n\n    virtual ~ScrollingCoordinatorChromiumTest()\n    {\n        Platform::current()->unitTestSupport()->unregisterAllMockedURLs();\n        m_webViewImpl->close();\n    }\n\n    void navigateTo(const std::string& url)\n    {\n        FrameTestHelpers::loadFrame(m_webViewImpl->mainFrame(), url);\n        Platform::current()->unitTestSupport()->serveAsynchronousMockedRequests();\n    }\n\n    void registerMockedHttpURLLoad(const std::string& fileName)\n    {\n        URLTestHelpers::registerMockedURLFromBaseURL(WebString::fromUTF8(m_baseURL.c_str()), WebString::fromUTF8(fileName.c_str()));\n    }\n\n    WebLayer* getRootScrollLayer()\n    {\n        RenderLayerCompositor* compositor = m_webViewImpl->mainFrameImpl()->frame()->contentRenderer()->compositor();\n        ASSERT(compositor);\n        ASSERT(compositor->scrollLayer());\n\n        WebLayer* webScrollLayer = static_cast<WebLayer*>(compositor->scrollLayer()->platformLayer());\n        return webScrollLayer;\n    }\n\nprotected:\n    std::string m_baseURL;\n    MockWebFrameClient m_mockWebFrameClient;\n    FakeWebViewClient m_mockWebViewClient;\n    WebViewImpl* m_webViewImpl;\n    WebKitTests::WebCompositorInitializer m_compositorInitializer;\n};\n\nTEST_F(ScrollingCoordinatorChromiumTest, fastScrollingByDefault)\n{\n    navigateTo(\"about:blank\");\n\n    \/\/ Make sure the scrolling coordinator is active.\n    FrameView* frameView = m_webViewImpl->mainFrameImpl()->frameView();\n    Page* page = m_webViewImpl->mainFrameImpl()->frame()->page();\n    ASSERT_TRUE(page->scrollingCoordinator());\n    ASSERT_TRUE(page->scrollingCoordinator()->coordinatesScrollingForFrameView(frameView));\n\n    \/\/ Fast scrolling should be enabled by default.\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    ASSERT_TRUE(rootScrollLayer->scrollable());\n    ASSERT_FALSE(rootScrollLayer->shouldScrollOnMainThread());\n    ASSERT_FALSE(rootScrollLayer->haveWheelEventHandlers());\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, fastScrollingForFixedPosition)\n{\n    registerMockedHttpURLLoad(\"fixed-position.html\");\n    navigateTo(m_baseURL + \"fixed-position.html\");\n\n    Page* page = m_webViewImpl->mainFrameImpl()->frame()->page();\n    ASSERT_TRUE(page->scrollingCoordinator()->supportsFixedPositionLayers());\n\n    \/\/ Fixed position should not fall back to main thread scrolling.\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    ASSERT_FALSE(rootScrollLayer->shouldScrollOnMainThread());\n\n    \/\/ Verify the properties of the fixed position element starting from the RenderObject all the\n    \/\/ way to the WebLayer.\n    Element* fixedElement = m_webViewImpl->mainFrameImpl()->frame()->document()->getElementById(\"fixed\");\n    ASSERT(fixedElement);\n\n    RenderObject* renderer = fixedElement->renderer();\n    ASSERT_TRUE(renderer->isBoxModelObject());\n    ASSERT_TRUE(renderer->hasLayer());\n\n    RenderLayer* layer = toRenderBoxModelObject(renderer)->layer();\n    ASSERT_TRUE(layer->isComposited());\n\n    RenderLayerBacking* layerBacking = layer->backing();\n    WebLayer* webLayer = static_cast<WebLayer*>(layerBacking->graphicsLayer()->platformLayer());\n    ASSERT_TRUE(webLayer->fixedToContainerLayer());\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, nonFastScrollableRegion)\n{\n    registerMockedHttpURLLoad(\"non-fast-scrollable.html\");\n    navigateTo(m_baseURL + \"non-fast-scrollable.html\");\n\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    WebVector<WebRect> nonFastScrollableRegion = rootScrollLayer->nonFastScrollableRegion();\n\n    ASSERT_EQ(1u, nonFastScrollableRegion.size());\n    ASSERT_EQ(WebRect(8, 8, 10, 10), nonFastScrollableRegion[0]);\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, wheelEventHandler)\n{\n    registerMockedHttpURLLoad(\"wheel-event-handler.html\");\n    navigateTo(m_baseURL + \"wheel-event-handler.html\");\n\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    ASSERT_TRUE(rootScrollLayer->haveWheelEventHandlers());\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, clippedBodyTest)\n{\n    registerMockedHttpURLLoad(\"clipped-body.html\");\n    navigateTo(m_baseURL + \"clipped-body.html\");\n\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    ASSERT_EQ(0u, rootScrollLayer->nonFastScrollableRegion().size());\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, overflowScrolling)\n{\n    registerMockedHttpURLLoad(\"overflow-scrolling.html\");\n    navigateTo(m_baseURL + \"overflow-scrolling.html\");\n\n    \/\/ Verify the properties of the accelerated scrolling element starting from the RenderObject\n    \/\/ all the way to the WebLayer.\n    Element* scrollableElement = m_webViewImpl->mainFrameImpl()->frame()->document()->getElementById(\"scrollable\");\n    ASSERT(scrollableElement);\n\n    RenderObject* renderer = scrollableElement->renderer();\n    ASSERT_TRUE(renderer->isBoxModelObject());\n    ASSERT_TRUE(renderer->hasLayer());\n\n    RenderLayer* layer = toRenderBoxModelObject(renderer)->layer();\n    ASSERT_TRUE(layer->usesCompositedScrolling());\n    ASSERT_TRUE(layer->isComposited());\n\n    RenderLayerBacking* layerBacking = layer->backing();\n    ASSERT_TRUE(layerBacking->hasScrollingLayer());\n    ASSERT(layerBacking->scrollingContentsLayer());\n\n    GraphicsLayerChromium* graphicsLayerChromium = static_cast<GraphicsLayerChromium*>(layerBacking->scrollingContentsLayer());\n    ASSERT_EQ(layer, graphicsLayerChromium->scrollableArea());\n\n    WebLayer* webScrollLayer = static_cast<WebLayer*>(layerBacking->scrollingContentsLayer()->platformLayer());\n    ASSERT_TRUE(webScrollLayer->scrollable());\n\n#if !OS(DARWIN) && !OS(WINDOWS)\n    \/\/ Now verify we've attached impl-side scrollbars onto the scrollbar layers\n    ASSERT_TRUE(layerBacking->layerForHorizontalScrollbar());\n    ASSERT_TRUE(layerBacking->layerForHorizontalScrollbar()->hasContentsLayer());\n    ASSERT_TRUE(layerBacking->layerForVerticalScrollbar());\n    ASSERT_TRUE(layerBacking->layerForVerticalScrollbar()->hasContentsLayer());\n#endif\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, iframeScrolling)\n{\n    registerMockedHttpURLLoad(\"iframe-scrolling.html\");\n    registerMockedHttpURLLoad(\"iframe-scrolling-inner.html\");\n    navigateTo(m_baseURL + \"iframe-scrolling.html\");\n\n    \/\/ Verify the properties of the accelerated scrolling element starting from the RenderObject\n    \/\/ all the way to the WebLayer.\n    Element* scrollableFrame = m_webViewImpl->mainFrameImpl()->frame()->document()->getElementById(\"scrollable\");\n    ASSERT_TRUE(scrollableFrame);\n\n    RenderObject* renderer = scrollableFrame->renderer();\n    ASSERT_TRUE(renderer);\n    ASSERT_TRUE(renderer->isWidget());\n\n    RenderWidget* renderWidget = toRenderWidget(renderer);\n    ASSERT_TRUE(renderWidget);\n    ASSERT_TRUE(renderWidget->widget());\n    ASSERT_TRUE(renderWidget->widget()->isFrameView());\n\n    FrameView* innerFrameView = toFrameView(renderWidget->widget());\n    RenderView* innerRenderView = innerFrameView->renderView();\n    ASSERT_TRUE(innerRenderView);\n\n    RenderLayerCompositor* innerCompositor = innerRenderView->compositor();\n    ASSERT_TRUE(innerCompositor->inCompositingMode());\n    ASSERT_TRUE(innerCompositor->scrollLayer());\n\n    GraphicsLayerChromium* scrollLayer = static_cast<GraphicsLayerChromium*>(innerCompositor->scrollLayer());\n    ASSERT_EQ(innerFrameView, scrollLayer->scrollableArea());\n\n    WebLayer* webScrollLayer = static_cast<WebLayer*>(scrollLayer->platformLayer());\n    ASSERT_TRUE(webScrollLayer->scrollable());\n\n#if !OS(DARWIN) && !OS(WINDOWS)\n    \/\/ Now verify we've attached impl-side scrollbars onto the scrollbar layers\n    ASSERT_TRUE(innerCompositor->layerForHorizontalScrollbar());\n    ASSERT_TRUE(innerCompositor->layerForHorizontalScrollbar()->hasContentsLayer());\n    ASSERT_TRUE(innerCompositor->layerForVerticalScrollbar());\n    ASSERT_TRUE(innerCompositor->layerForVerticalScrollbar()->hasContentsLayer());\n#endif\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, rtlIframe)\n{\n    registerMockedHttpURLLoad(\"rtl-iframe.html\");\n    registerMockedHttpURLLoad(\"rtl-iframe-inner.html\");\n    navigateTo(m_baseURL + \"rtl-iframe.html\");\n\n    \/\/ Verify the properties of the accelerated scrolling element starting from the RenderObject\n    \/\/ all the way to the WebLayer.\n    Element* scrollableFrame = m_webViewImpl->mainFrameImpl()->frame()->document()->getElementById(\"scrollable\");\n    ASSERT_TRUE(scrollableFrame);\n\n    RenderObject* renderer = scrollableFrame->renderer();\n    ASSERT_TRUE(renderer);\n    ASSERT_TRUE(renderer->isWidget());\n\n    RenderWidget* renderWidget = toRenderWidget(renderer);\n    ASSERT_TRUE(renderWidget);\n    ASSERT_TRUE(renderWidget->widget());\n    ASSERT_TRUE(renderWidget->widget()->isFrameView());\n\n    FrameView* innerFrameView = static_cast<FrameView*>(renderWidget->widget());\n    RenderView* innerRenderView = innerFrameView->renderView();\n    ASSERT_TRUE(innerRenderView);\n\n    RenderLayerCompositor* innerCompositor = innerRenderView->compositor();\n    ASSERT_TRUE(innerCompositor->inCompositingMode());\n    ASSERT_TRUE(innerCompositor->scrollLayer());\n\n    GraphicsLayerChromium* scrollLayer = static_cast<GraphicsLayerChromium*>(innerCompositor->scrollLayer());\n    ASSERT_EQ(innerFrameView, scrollLayer->scrollableArea());\n\n    WebLayer* webScrollLayer = static_cast<WebLayer*>(scrollLayer->platformLayer());\n    ASSERT_TRUE(webScrollLayer->scrollable());\n\n    ASSERT_EQ(973, webScrollLayer->scrollPosition().x);\n    ASSERT_EQ(973, webScrollLayer->maxScrollPosition().width);\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, setupScrollbarLayerShouldNotCrash)\n{\n    registerMockedHttpURLLoad(\"setup_scrollbar_layer_crash.html\");\n    navigateTo(m_baseURL + \"setup_scrollbar_layer_crash.html\");\n    \/\/ This test document setup an iframe with scrollbars, then switch to\n    \/\/ an empty document by javascript.\n}\n\n} \/\/ namespace\n<commit_msg>Fix webkit unit test failure from r148395<commit_after>\/*\n * Copyright (C) 2012 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\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. AND ITS CONTRIBUTORS ``AS IS'' AND ANY\n * 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 APPLE INC. OR ITS CONTRIBUTORS 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 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 \"config.h\"\n\n#include \"ScrollingCoordinator.h\"\n\n#include \"FrameTestHelpers.h\"\n#include \"GraphicsLayerChromium.h\"\n#include \"RenderLayerBacking.h\"\n#include \"RenderLayerCompositor.h\"\n#include \"RenderView.h\"\n#include \"URLTestHelpers.h\"\n#include \"WebCompositorInitializer.h\"\n#include \"WebFrameClient.h\"\n#include \"WebFrameImpl.h\"\n#include \"WebSettings.h\"\n#include \"WebViewClient.h\"\n#include \"WebViewImpl.h\"\n#include <gtest\/gtest.h>\n#include <public\/Platform.h>\n#include <public\/WebLayer.h>\n#include <public\/WebLayerTreeView.h>\n#include <public\/WebUnitTestSupport.h>\n\nusing namespace WebCore;\nusing namespace WebKit;\n\nnamespace {\n\nclass FakeWebViewClient : public WebViewClient {\npublic:\n    virtual void initializeLayerTreeView()\n    {\n        m_layerTreeView = adoptPtr(Platform::current()->unitTestSupport()->createLayerTreeViewForTesting(WebUnitTestSupport::TestViewTypeUnitTest));\n        ASSERT(m_layerTreeView);\n    }\n\n    virtual WebLayerTreeView* layerTreeView()\n    {\n        return m_layerTreeView.get();\n    }\n\nprivate:\n    OwnPtr<WebLayerTreeView> m_layerTreeView;\n};\n\nclass MockWebFrameClient : public WebFrameClient {\n};\n\nclass ScrollingCoordinatorChromiumTest : public testing::Test {\npublic:\n    ScrollingCoordinatorChromiumTest()\n        : m_baseURL(\"http:\/\/www.test.com\/\")\n        , m_compositorInitializer(0)\n    {\n        \/\/ We cannot reuse FrameTestHelpers::createWebViewAndLoad here because the compositing\n        \/\/ settings need to be set before the page is loaded.\n        m_webViewImpl = static_cast<WebViewImpl*>(WebView::create(&m_mockWebViewClient));\n        m_webViewImpl->settings()->setJavaScriptEnabled(true);\n        m_webViewImpl->settings()->setForceCompositingMode(true);\n        m_webViewImpl->settings()->setAcceleratedCompositingEnabled(true);\n        m_webViewImpl->settings()->setAcceleratedCompositingForFixedPositionEnabled(true);\n        m_webViewImpl->settings()->setAcceleratedCompositingForOverflowScrollEnabled(true);\n        m_webViewImpl->settings()->setAcceleratedCompositingForScrollableFramesEnabled(true);\n        m_webViewImpl->settings()->setCompositedScrollingForFramesEnabled(true);\n        m_webViewImpl->settings()->setFixedPositionCreatesStackingContext(true);\n        m_webViewImpl->initializeMainFrame(&m_mockWebFrameClient);\n        m_webViewImpl->resize(IntSize(320, 240));\n    }\n\n    virtual ~ScrollingCoordinatorChromiumTest()\n    {\n        Platform::current()->unitTestSupport()->unregisterAllMockedURLs();\n        m_webViewImpl->close();\n    }\n\n    void navigateTo(const std::string& url)\n    {\n        FrameTestHelpers::loadFrame(m_webViewImpl->mainFrame(), url);\n        Platform::current()->unitTestSupport()->serveAsynchronousMockedRequests();\n    }\n\n    void registerMockedHttpURLLoad(const std::string& fileName)\n    {\n        URLTestHelpers::registerMockedURLFromBaseURL(WebString::fromUTF8(m_baseURL.c_str()), WebString::fromUTF8(fileName.c_str()));\n    }\n\n    WebLayer* getRootScrollLayer()\n    {\n        RenderLayerCompositor* compositor = m_webViewImpl->mainFrameImpl()->frame()->contentRenderer()->compositor();\n        ASSERT(compositor);\n        ASSERT(compositor->scrollLayer());\n\n        WebLayer* webScrollLayer = static_cast<WebLayer*>(compositor->scrollLayer()->platformLayer());\n        return webScrollLayer;\n    }\n\nprotected:\n    std::string m_baseURL;\n    MockWebFrameClient m_mockWebFrameClient;\n    FakeWebViewClient m_mockWebViewClient;\n    WebViewImpl* m_webViewImpl;\n    WebKitTests::WebCompositorInitializer m_compositorInitializer;\n};\n\nTEST_F(ScrollingCoordinatorChromiumTest, fastScrollingByDefault)\n{\n    navigateTo(\"about:blank\");\n\n    \/\/ Make sure the scrolling coordinator is active.\n    FrameView* frameView = m_webViewImpl->mainFrameImpl()->frameView();\n    Page* page = m_webViewImpl->mainFrameImpl()->frame()->page();\n    ASSERT_TRUE(page->scrollingCoordinator());\n    ASSERT_TRUE(page->scrollingCoordinator()->coordinatesScrollingForFrameView(frameView));\n\n    \/\/ Fast scrolling should be enabled by default.\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    ASSERT_TRUE(rootScrollLayer->scrollable());\n    ASSERT_FALSE(rootScrollLayer->shouldScrollOnMainThread());\n    ASSERT_FALSE(rootScrollLayer->haveWheelEventHandlers());\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, fastScrollingForFixedPosition)\n{\n    registerMockedHttpURLLoad(\"fixed-position.html\");\n    navigateTo(m_baseURL + \"fixed-position.html\");\n\n    Page* page = m_webViewImpl->mainFrameImpl()->frame()->page();\n    ASSERT_TRUE(page->scrollingCoordinator()->supportsFixedPositionLayers());\n\n    \/\/ Fixed position should not fall back to main thread scrolling.\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    ASSERT_FALSE(rootScrollLayer->shouldScrollOnMainThread());\n\n    \/\/ Verify the properties of the fixed position element starting from the RenderObject all the\n    \/\/ way to the WebLayer.\n    Element* fixedElement = m_webViewImpl->mainFrameImpl()->frame()->document()->getElementById(\"fixed\");\n    ASSERT(fixedElement);\n\n    RenderObject* renderer = fixedElement->renderer();\n    ASSERT_TRUE(renderer->isBoxModelObject());\n    ASSERT_TRUE(renderer->hasLayer());\n\n    RenderLayer* layer = toRenderBoxModelObject(renderer)->layer();\n    ASSERT_TRUE(layer->isComposited());\n\n    RenderLayerBacking* layerBacking = layer->backing();\n    WebLayer* webLayer = static_cast<WebLayer*>(layerBacking->graphicsLayer()->platformLayer());\n    ASSERT_TRUE(webLayer->fixedToContainerLayer());\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, nonFastScrollableRegion)\n{\n    registerMockedHttpURLLoad(\"non-fast-scrollable.html\");\n    navigateTo(m_baseURL + \"non-fast-scrollable.html\");\n\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    WebVector<WebRect> nonFastScrollableRegion = rootScrollLayer->nonFastScrollableRegion();\n\n    ASSERT_EQ(1u, nonFastScrollableRegion.size());\n    ASSERT_EQ(WebRect(8, 8, 10, 10), nonFastScrollableRegion[0]);\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, wheelEventHandler)\n{\n    registerMockedHttpURLLoad(\"wheel-event-handler.html\");\n    navigateTo(m_baseURL + \"wheel-event-handler.html\");\n\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    ASSERT_TRUE(rootScrollLayer->haveWheelEventHandlers());\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, clippedBodyTest)\n{\n    registerMockedHttpURLLoad(\"clipped-body.html\");\n    navigateTo(m_baseURL + \"clipped-body.html\");\n\n    WebLayer* rootScrollLayer = getRootScrollLayer();\n    ASSERT_EQ(0u, rootScrollLayer->nonFastScrollableRegion().size());\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, overflowScrolling)\n{\n    registerMockedHttpURLLoad(\"overflow-scrolling.html\");\n    navigateTo(m_baseURL + \"overflow-scrolling.html\");\n\n    \/\/ Verify the properties of the accelerated scrolling element starting from the RenderObject\n    \/\/ all the way to the WebLayer.\n    Element* scrollableElement = m_webViewImpl->mainFrameImpl()->frame()->document()->getElementById(\"scrollable\");\n    ASSERT(scrollableElement);\n\n    RenderObject* renderer = scrollableElement->renderer();\n    ASSERT_TRUE(renderer->isBoxModelObject());\n    ASSERT_TRUE(renderer->hasLayer());\n\n    RenderLayer* layer = toRenderBoxModelObject(renderer)->layer();\n    ASSERT_TRUE(layer->usesCompositedScrolling());\n    ASSERT_TRUE(layer->isComposited());\n\n    RenderLayerBacking* layerBacking = layer->backing();\n    ASSERT_TRUE(layerBacking->hasScrollingLayer());\n    ASSERT(layerBacking->scrollingContentsLayer());\n\n    GraphicsLayerChromium* graphicsLayerChromium = static_cast<GraphicsLayerChromium*>(layerBacking->scrollingContentsLayer());\n    ASSERT_EQ(layer, graphicsLayerChromium->scrollableArea());\n\n    WebLayer* webScrollLayer = static_cast<WebLayer*>(layerBacking->scrollingContentsLayer()->platformLayer());\n    ASSERT_TRUE(webScrollLayer->scrollable());\n\n#if OS(ANDROID)\n    \/\/ Now verify we've attached impl-side scrollbars onto the scrollbar layers\n    ASSERT_TRUE(layerBacking->layerForHorizontalScrollbar());\n    ASSERT_TRUE(layerBacking->layerForHorizontalScrollbar()->hasContentsLayer());\n    ASSERT_TRUE(layerBacking->layerForVerticalScrollbar());\n    ASSERT_TRUE(layerBacking->layerForVerticalScrollbar()->hasContentsLayer());\n#endif\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, iframeScrolling)\n{\n    registerMockedHttpURLLoad(\"iframe-scrolling.html\");\n    registerMockedHttpURLLoad(\"iframe-scrolling-inner.html\");\n    navigateTo(m_baseURL + \"iframe-scrolling.html\");\n\n    \/\/ Verify the properties of the accelerated scrolling element starting from the RenderObject\n    \/\/ all the way to the WebLayer.\n    Element* scrollableFrame = m_webViewImpl->mainFrameImpl()->frame()->document()->getElementById(\"scrollable\");\n    ASSERT_TRUE(scrollableFrame);\n\n    RenderObject* renderer = scrollableFrame->renderer();\n    ASSERT_TRUE(renderer);\n    ASSERT_TRUE(renderer->isWidget());\n\n    RenderWidget* renderWidget = toRenderWidget(renderer);\n    ASSERT_TRUE(renderWidget);\n    ASSERT_TRUE(renderWidget->widget());\n    ASSERT_TRUE(renderWidget->widget()->isFrameView());\n\n    FrameView* innerFrameView = toFrameView(renderWidget->widget());\n    RenderView* innerRenderView = innerFrameView->renderView();\n    ASSERT_TRUE(innerRenderView);\n\n    RenderLayerCompositor* innerCompositor = innerRenderView->compositor();\n    ASSERT_TRUE(innerCompositor->inCompositingMode());\n    ASSERT_TRUE(innerCompositor->scrollLayer());\n\n    GraphicsLayerChromium* scrollLayer = static_cast<GraphicsLayerChromium*>(innerCompositor->scrollLayer());\n    ASSERT_EQ(innerFrameView, scrollLayer->scrollableArea());\n\n    WebLayer* webScrollLayer = static_cast<WebLayer*>(scrollLayer->platformLayer());\n    ASSERT_TRUE(webScrollLayer->scrollable());\n\n#if OS(ANDROID)\n    \/\/ Now verify we've attached impl-side scrollbars onto the scrollbar layers\n    ASSERT_TRUE(innerCompositor->layerForHorizontalScrollbar());\n    ASSERT_TRUE(innerCompositor->layerForHorizontalScrollbar()->hasContentsLayer());\n    ASSERT_TRUE(innerCompositor->layerForVerticalScrollbar());\n    ASSERT_TRUE(innerCompositor->layerForVerticalScrollbar()->hasContentsLayer());\n#endif\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, rtlIframe)\n{\n    registerMockedHttpURLLoad(\"rtl-iframe.html\");\n    registerMockedHttpURLLoad(\"rtl-iframe-inner.html\");\n    navigateTo(m_baseURL + \"rtl-iframe.html\");\n\n    \/\/ Verify the properties of the accelerated scrolling element starting from the RenderObject\n    \/\/ all the way to the WebLayer.\n    Element* scrollableFrame = m_webViewImpl->mainFrameImpl()->frame()->document()->getElementById(\"scrollable\");\n    ASSERT_TRUE(scrollableFrame);\n\n    RenderObject* renderer = scrollableFrame->renderer();\n    ASSERT_TRUE(renderer);\n    ASSERT_TRUE(renderer->isWidget());\n\n    RenderWidget* renderWidget = toRenderWidget(renderer);\n    ASSERT_TRUE(renderWidget);\n    ASSERT_TRUE(renderWidget->widget());\n    ASSERT_TRUE(renderWidget->widget()->isFrameView());\n\n    FrameView* innerFrameView = static_cast<FrameView*>(renderWidget->widget());\n    RenderView* innerRenderView = innerFrameView->renderView();\n    ASSERT_TRUE(innerRenderView);\n\n    RenderLayerCompositor* innerCompositor = innerRenderView->compositor();\n    ASSERT_TRUE(innerCompositor->inCompositingMode());\n    ASSERT_TRUE(innerCompositor->scrollLayer());\n\n    GraphicsLayerChromium* scrollLayer = static_cast<GraphicsLayerChromium*>(innerCompositor->scrollLayer());\n    ASSERT_EQ(innerFrameView, scrollLayer->scrollableArea());\n\n    WebLayer* webScrollLayer = static_cast<WebLayer*>(scrollLayer->platformLayer());\n    ASSERT_TRUE(webScrollLayer->scrollable());\n\n    ASSERT_EQ(973, webScrollLayer->scrollPosition().x);\n    ASSERT_EQ(973, webScrollLayer->maxScrollPosition().width);\n}\n\nTEST_F(ScrollingCoordinatorChromiumTest, setupScrollbarLayerShouldNotCrash)\n{\n    registerMockedHttpURLLoad(\"setup_scrollbar_layer_crash.html\");\n    navigateTo(m_baseURL + \"setup_scrollbar_layer_crash.html\");\n    \/\/ This test document setup an iframe with scrollbars, then switch to\n    \/\/ an empty document by javascript.\n}\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ Project specific\n#include <Manager\/AI\/AIPathManager.hpp>\n#include <EntityComponent\/EntityHandler.hpp>\n#include <PlayerHandler.hpp>\n#include <Helper\/ProximityChecker.hpp>\n#include <EntityComponent\/Components\/HealthComponent.hpp>\n#include <EntityComponent\/Components\/RigidBodyComponent.hpp>\n#include <EntityComponent\/Components\/TransformComponent.hpp>\n#include <EntityComponent\/Components\/PotentialFieldComponent.hpp>\n#include <EntityComponent\/Components\/MovementComponent.hpp>\n#include <EntityComponent\/Components\/AIGroupComponent.hpp>\n#include <Doremi\/Core\/Include\/PotentialFieldGridCreator.hpp>\n#include <EntityComponent\/Components\/PhysicsMaterialComponent.hpp>\n\/\/ Events\n#include <EventHandler\/EventHandler.hpp>\n#include <EventHandler\/Events\/EntityCreatedEvent.hpp>\n#include <EventHandler\/Events\/PlayerCreationEvent.hpp>\n\n\/\/ Engine\n#include <DoremiEngine\/Physics\/Include\/PhysicsModule.hpp>\n#include <DoremiEngine\/Physics\/Include\/RigidBodyManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/PhysicsMaterialManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/RayCastManager.hpp>\n#include <DoremiEngine\/AI\/Include\/Interface\/PotentialField\/PotentialFieldActor.hpp>\n#include <DoremiEngine\/AI\/Include\/Interface\/PotentialField\/PotentialField.hpp>\n#include <DoremiEngine\/AI\/Include\/Interface\/PotentialField\/PotentialGroup.hpp>\n#include <DoremiEngine\/AI\/Include\/Interface\/SubModule\/PotentialFieldSubModule.hpp>\n#include <DoremiEngine\/AI\/Include\/AIModule.hpp>\n\n\/\/ Standard\n#include <iostream>\n#include <DirectXMath.h>\n#include <set>\n\nusing namespace std;\n\nnamespace Doremi\n{\n    namespace Core\n    {\n        AIPathManager::AIPathManager(const DoremiEngine::Core::SharedContext& p_sharedContext) : Manager(p_sharedContext, \"AIPathManager\")\n        {\n            \/\/ TODOKO do this in a better place, might not work to have here in the future\n            m_field =\n                m_sharedContext.GetAIModule().GetPotentialFieldSubModule().CreateNewField(250, 230, 50, 50,\n                                                                                          XMFLOAT3(-60, 5.0f, -40)); \/\/ Fits for first platform\n            m_topField =\n                m_sharedContext.GetAIModule().GetPotentialFieldSubModule().CreateNewField(350, 500, 50, 50,\n                    XMFLOAT3(-280, 150.0f, -85)); \/\/ Fits for top platform\n            EventHandler::GetInstance()->Subscribe(EventType::AiGroupActorCreation, this);\n            EventHandler::GetInstance()->Subscribe(EventType::PotentialFieldActorCreation, this);\n            EventHandler::GetInstance()->Subscribe(EventType::PlayerCreation, this);\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Fixa PotFlt\n\n            \/\/ Testar TODOEA\n            Core::EntityHandler& t_entityHandler = Core::EntityHandler::GetInstance();\n            PotentialFieldGridCreator t_potentialFieldGridCreator = PotentialFieldGridCreator(m_sharedContext);\n            t_potentialFieldGridCreator.BuildGridUsingPhysicXAndGrid(m_field);\n            std::cout << \"Physical field 1 done\";\n            m_field->Update();\n            std::cout << \"Potential field 1 done\";\n\n            t_potentialFieldGridCreator.BuildGridUsingPhysicXAndGrid(m_topField);\n            std::cout << \"Physical field 2 done\";\n            m_topField->Update();\n            std::cout << \"Potential field 2 done\";\n            \/\/\/ debugskit\n\n\n            \/\/&& render pos rigidbody, potentialfield\n        }\n\n        AIPathManager::~AIPathManager() {}\n\n\n        void AIPathManager::Update(double p_dt)\n        {\n            size_t length = EntityHandler::GetInstance().GetLastEntityIndex();\n\n            \/\/ TODOKO Test wall\n            if(firstUpdate)\n            {\n                firstUpdate = false;\n            }\n            for(size_t i = 0; i < length; i++)\n            {\n                \/\/ Update actors position, should perhaps not be here...\n                if(EntityHandler::GetInstance().HasComponents(i, (int)ComponentType::PotentialField | (int)ComponentType::Transform))\n                { \/\/ This is so the player updates his position too...\n                    DoremiEngine::AI::PotentialFieldActor* actor = EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(i)->ChargedActor;\n                    XMFLOAT3 pos = EntityHandler::GetInstance().GetComponentFromStorage<TransformComponent>(i)->position;\n                    actor->SetPosition(pos);\n                }\n                if(EntityHandler::GetInstance().HasComponents(i, (int)ComponentType::AIAgent | (int)ComponentType::Transform |\n                                                                     (int)ComponentType::Movement | (int)ComponentType::AIGroup | (int)ComponentType::PotentialField))\n                {\n                    \/\/ Get the needed components\n                    XMFLOAT2 desiredPos;\n                    XMFLOAT3 unitPos = EntityHandler::GetInstance().GetComponentFromStorage<TransformComponent>(i)->position;\n                    DoremiEngine::AI::PotentialGroup* group = EntityHandler::GetInstance().GetComponentFromStorage<AIGroupComponent>(i)->Group;\n                    DoremiEngine::AI::PotentialFieldActor* currentActor = EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(i)->ChargedActor;\n                    DoremiEngine::AI::PotentialField* field = EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(i)->Field;\n                    \/\/ TODOEA BORDE SPARA UNDAN O INTE KOLLA X O Y EFTER VARANN\n\n                    if (currentActor->GetPrevGridPos().x == field->WhatGridPosAmIOn(currentActor->GetPosition()).x && currentActor->GetPrevGridPos().y == field->WhatGridPosAmIOn(currentActor->GetPosition()).y)\n                    {\n                        \/\/DEBUG\n                        int hej = 0;\n\n                        \/\/ Remove the first in the list om vi skulle anvnda oss av delta_T fr att uppdatera trailen med hjlp av den om ngon str still.\n                        \/\/ Do nothing\n                    }\n                    else \n                    {\n                        \/\/DEBUG\n                        std::vector<XMINT2> hej = currentActor->GetPhermoneTrail();\n\n                        XMINT2 hej1 = currentActor->GetPrevGridPos();\n                        \/\/ Add the previous gridPos to the trail.\n                        \/\/ TODOEA This will make the Ai move as the game starts.\n\n                        currentActor->UpdatePhermoneTrail(currentActor->GetPrevGridPos());\n                        \/\/DEBUG \n                        \/\/XMINT2 newPrevPos = field->WhatGridPosAmIOn(currentActor->GetPosition());\n                        XMINT2 newPrevPos = field->WhatGridPosAmIOn(currentActor->GetPosition());\n                        currentActor->SetPrevGridPosition(newPrevPos);\n                    }\n                    if(field != nullptr)\n                    {\n                        desiredPos = field->GetAttractionPosition(unitPos, currentActor, false);\n                    }\n                    XMFLOAT3 desiredPos3D = XMFLOAT3(desiredPos.x, unitPos.y, desiredPos.y); \/\/ The fields impact\n                   \/\/ XMFLOAT3 groupImpact = group->GetForceDirection(unitPos, currentActor); \/\/ The groups impact\n                   \/\/ XMVECTOR groupImpactVec = XMLoadFloat3(&groupImpact);\n                    XMVECTOR desiredPosVec = XMLoadFloat3(&desiredPos3D);\n                    XMVECTOR unitPosVec = XMLoadFloat3(&unitPos);\n                    XMVECTOR dirVec = desiredPosVec - unitPosVec;\n                    dirVec = XMVector3Normalize(dirVec);\n                   \/\/ dirVec += groupImpactVec * 0.2f; \/\/ TODOKO remove this variable!! Its there to make the static field more influencial\n                   \/\/  dirVec = XMVector3Normalize(dirVec);\n                    XMFLOAT3 direction;\n                    XMStoreFloat3(&direction, dirVec * 0.2f); \/\/ TODOKO remove this hard coded shiat\n                    MovementComponent* moveComp = EntityHandler::GetInstance().GetComponentFromStorage<MovementComponent>(i);\n                    moveComp->movement = direction;\n\n                }\n            }\n        }\n        void AIPathManager::OnEvent(Event* p_event)\n        {\n            switch(p_event->eventType)\n            {\n                case Doremi::Core::EventType::PotentialFieldActorCreation:\n                {\n                    EntityCreatedEvent* realEvent = static_cast<EntityCreatedEvent*>(p_event);\n                    if(EntityHandler::GetInstance().HasComponents(realEvent->entityID, (int)ComponentType::PotentialField)) \/\/ Make sure the entity\n                    \/\/ contains the needed\n                    \/\/ stuff\n                    {\n                        DoremiEngine::AI::PotentialFieldActor* actor =\n                            EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(realEvent->entityID)->ChargedActor;\n                        m_field->AddActor(actor);\n                    }\n                    else\n                    {\n                        \/\/ TODOKO Log error\n                    }\n                    break;\n                }\n                case Doremi::Core::EventType::AiGroupActorCreation:\n                {\n                    EntityCreatedEvent* realEvent = static_cast<EntityCreatedEvent*>(p_event);\n                    if(EntityHandler::GetInstance().HasComponents(realEvent->entityID, (int)ComponentType::PotentialField | (int)ComponentType::AIGroup)) \/\/ Make sure the entity contains the needed stuff\n                    {\n                        DoremiEngine::AI::PotentialFieldActor* actor =\n                            EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(realEvent->entityID)->ChargedActor;\n                        DoremiEngine::AI::PotentialField* field;\n                        DoremiEngine::AI::PotentialGroup* group =\n                            EntityHandler::GetInstance().GetComponentFromStorage<AIGroupComponent>(realEvent->entityID)->Group;\n                        if(group == nullptr)\n                        {\n                            \/\/ TODOKO Log error and what happens\n                            group = m_sharedContext.GetAIModule().GetPotentialFieldSubModule().CreateNewPotentialGroup();\n                        }\n                        group->AddActor(actor);\n                        \/\/ TODOKO should not be done here but in a more suitable event\n                        field = m_sharedContext.GetAIModule().GetPotentialFieldSubModule().FindBestPotentialField(actor->GetPosition());\n                        EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(realEvent->entityID)->Field = field;\n                    }\n                    else\n                    {\n                        \/\/ TODOKO Log error\n                    }\n                    break;\n                }\n                case Doremi::Core::EventType::PlayerCreation:\n                {\n                    PlayerCreationEvent* realEvent = static_cast<PlayerCreationEvent*>(p_event);\n                    if(EntityHandler::GetInstance().HasComponents(realEvent->playerEntityID, (int)ComponentType::PotentialField)) \/\/ Make sure the\n                    \/\/ entity contains\n                    \/\/ the needed stuff\n                    {\n                        DoremiEngine::AI::PotentialFieldActor* actor =\n                            EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(realEvent->playerEntityID)->ChargedActor;\n                        m_field->AddActor(actor);\n                        m_topField->AddActor(actor);\n                    }\n                    else\n                    {\n                        \/\/ TODOKO log error\n                    }\n                    break;\n                }\n                default:\n                    break;\n            }\n        }\n    }\n}<commit_msg>Removed AI bug with phermonnetrail<commit_after>\/\/\/ Project specific\n#include <Manager\/AI\/AIPathManager.hpp>\n#include <EntityComponent\/EntityHandler.hpp>\n#include <PlayerHandler.hpp>\n#include <Helper\/ProximityChecker.hpp>\n#include <EntityComponent\/Components\/HealthComponent.hpp>\n#include <EntityComponent\/Components\/RigidBodyComponent.hpp>\n#include <EntityComponent\/Components\/TransformComponent.hpp>\n#include <EntityComponent\/Components\/PotentialFieldComponent.hpp>\n#include <EntityComponent\/Components\/MovementComponent.hpp>\n#include <EntityComponent\/Components\/AIGroupComponent.hpp>\n#include <Doremi\/Core\/Include\/PotentialFieldGridCreator.hpp>\n#include <EntityComponent\/Components\/PhysicsMaterialComponent.hpp>\n\/\/ Events\n#include <EventHandler\/EventHandler.hpp>\n#include <EventHandler\/Events\/EntityCreatedEvent.hpp>\n#include <EventHandler\/Events\/PlayerCreationEvent.hpp>\n\n\/\/ Engine\n#include <DoremiEngine\/Physics\/Include\/PhysicsModule.hpp>\n#include <DoremiEngine\/Physics\/Include\/RigidBodyManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/PhysicsMaterialManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/RayCastManager.hpp>\n#include <DoremiEngine\/AI\/Include\/Interface\/PotentialField\/PotentialFieldActor.hpp>\n#include <DoremiEngine\/AI\/Include\/Interface\/PotentialField\/PotentialField.hpp>\n#include <DoremiEngine\/AI\/Include\/Interface\/PotentialField\/PotentialGroup.hpp>\n#include <DoremiEngine\/AI\/Include\/Interface\/SubModule\/PotentialFieldSubModule.hpp>\n#include <DoremiEngine\/AI\/Include\/AIModule.hpp>\n\n\/\/ Standard\n#include <iostream>\n#include <DirectXMath.h>\n#include <set>\n\nusing namespace std;\n\nnamespace Doremi\n{\n    namespace Core\n    {\n        AIPathManager::AIPathManager(const DoremiEngine::Core::SharedContext& p_sharedContext) : Manager(p_sharedContext, \"AIPathManager\")\n        {\n            \/\/ TODOKO do this in a better place, might not work to have here in the future\n            m_field =\n                m_sharedContext.GetAIModule().GetPotentialFieldSubModule().CreateNewField(250, 230, 50, 50,\n                                                                                          XMFLOAT3(-60, 5.0f, -40)); \/\/ Fits for first platform\n            m_topField =\n                m_sharedContext.GetAIModule().GetPotentialFieldSubModule().CreateNewField(350, 500, 50, 50,\n                    XMFLOAT3(-280, 150.0f, -85)); \/\/ Fits for top platform\n            EventHandler::GetInstance()->Subscribe(EventType::AiGroupActorCreation, this);\n            EventHandler::GetInstance()->Subscribe(EventType::PotentialFieldActorCreation, this);\n            EventHandler::GetInstance()->Subscribe(EventType::PlayerCreation, this);\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Fixa PotFlt\n\n            \/\/ Testar TODOEA\n            Core::EntityHandler& t_entityHandler = Core::EntityHandler::GetInstance();\n            PotentialFieldGridCreator t_potentialFieldGridCreator = PotentialFieldGridCreator(m_sharedContext);\n            t_potentialFieldGridCreator.BuildGridUsingPhysicXAndGrid(m_field);\n            std::cout << \"Physical field 1 done\";\n            m_field->Update();\n            std::cout << \"Potential field 1 done\";\n\n            t_potentialFieldGridCreator.BuildGridUsingPhysicXAndGrid(m_topField);\n            std::cout << \"Physical field 2 done\";\n            m_topField->Update();\n            std::cout << \"Potential field 2 done\";\n            \/\/\/ debugskit\n\n\n            \/\/&& render pos rigidbody, potentialfield\n        }\n\n        AIPathManager::~AIPathManager() {}\n\n\n        void AIPathManager::Update(double p_dt)\n        {\n            size_t length = EntityHandler::GetInstance().GetLastEntityIndex();\n\n            \/\/ TODOKO Test wall\n            if(firstUpdate)\n            {\n                firstUpdate = false;\n            }\n            for(size_t i = 0; i < length; i++)\n            {\n                \/\/ Update actors position, should perhaps not be here...\n                if(EntityHandler::GetInstance().HasComponents(i, (int)ComponentType::PotentialField | (int)ComponentType::Transform))\n                { \/\/ This is so the player updates his position too...\n                    DoremiEngine::AI::PotentialFieldActor* actor = EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(i)->ChargedActor;\n                    XMFLOAT3 pos = EntityHandler::GetInstance().GetComponentFromStorage<TransformComponent>(i)->position;\n                    actor->SetPosition(pos);\n                }\n                if(EntityHandler::GetInstance().HasComponents(i, (int)ComponentType::AIAgent | (int)ComponentType::Transform |\n                                                                     (int)ComponentType::Movement | (int)ComponentType::AIGroup | (int)ComponentType::PotentialField))\n                {\n                    \/\/ Get the needed components\n                    XMFLOAT2 desiredPos;\n                    XMFLOAT3 unitPos = EntityHandler::GetInstance().GetComponentFromStorage<TransformComponent>(i)->position;\n                    DoremiEngine::AI::PotentialGroup* group = EntityHandler::GetInstance().GetComponentFromStorage<AIGroupComponent>(i)->Group;\n                    DoremiEngine::AI::PotentialFieldActor* currentActor = EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(i)->ChargedActor;\n                    DoremiEngine::AI::PotentialField* field = EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(i)->Field;\n                    \/\/ TODOEA BORDE SPARA UNDAN O INTE KOLLA X O Y EFTER VARANN\n\n                    \/\/if (currentActor->GetPrevGridPos().x == field->WhatGridPosAmIOn(currentActor->GetPosition()).x && currentActor->GetPrevGridPos().y == field->WhatGridPosAmIOn(currentActor->GetPosition()).y)\n                    \/\/{\n                    \/\/    \/\/DEBUG\n                    \/\/    int hej = 0;\n\n                    \/\/    \/\/ Remove the first in the list om vi skulle anvnda oss av delta_T fr att uppdatera trailen med hjlp av den om ngon str still.\n                    \/\/    \/\/ Do nothing\n                    \/\/}\n                    \/\/else \n                    \/\/{\n                    \/\/    \/\/DEBUG\n                    \/\/    std::vector<XMINT2> hej = currentActor->GetPhermoneTrail();\n\n                    \/\/    XMINT2 hej1 = currentActor->GetPrevGridPos();\n                    \/\/    \/\/ Add the previous gridPos to the trail.\n                    \/\/    \/\/ TODOEA This will make the Ai move as the game starts.\n\n                    \/\/    currentActor->UpdatePhermoneTrail(currentActor->GetPrevGridPos());\n                    \/\/    \/\/DEBUG \n                    \/\/    \/\/XMINT2 newPrevPos = field->WhatGridPosAmIOn(currentActor->GetPosition());\n                    \/\/    XMINT2 newPrevPos = field->WhatGridPosAmIOn(currentActor->GetPosition());\n                    \/\/    currentActor->SetPrevGridPosition(newPrevPos);\n                    \/\/}\n                    if(field != nullptr)\n                    {\n                        desiredPos = field->GetAttractionPosition(unitPos, currentActor, false);\n                    }\n                    XMFLOAT3 desiredPos3D = XMFLOAT3(desiredPos.x, unitPos.y, desiredPos.y); \/\/ The fields impact\n                   \/\/ XMFLOAT3 groupImpact = group->GetForceDirection(unitPos, currentActor); \/\/ The groups impact\n                   \/\/ XMVECTOR groupImpactVec = XMLoadFloat3(&groupImpact);\n                    XMVECTOR desiredPosVec = XMLoadFloat3(&desiredPos3D);\n                    XMVECTOR unitPosVec = XMLoadFloat3(&unitPos);\n                    XMVECTOR dirVec = desiredPosVec - unitPosVec;\n                    dirVec = XMVector3Normalize(dirVec);\n                   \/\/ dirVec += groupImpactVec * 0.2f; \/\/ TODOKO remove this variable!! Its there to make the static field more influencial\n                   \/\/  dirVec = XMVector3Normalize(dirVec);\n                    XMFLOAT3 direction;\n                    XMStoreFloat3(&direction, dirVec * 0.2f); \/\/ TODOKO remove this hard coded shiat\n                    MovementComponent* moveComp = EntityHandler::GetInstance().GetComponentFromStorage<MovementComponent>(i);\n                    moveComp->movement = direction;\n\n                }\n            }\n        }\n        void AIPathManager::OnEvent(Event* p_event)\n        {\n            switch(p_event->eventType)\n            {\n                case Doremi::Core::EventType::PotentialFieldActorCreation:\n                {\n                    EntityCreatedEvent* realEvent = static_cast<EntityCreatedEvent*>(p_event);\n                    if(EntityHandler::GetInstance().HasComponents(realEvent->entityID, (int)ComponentType::PotentialField)) \/\/ Make sure the entity\n                    \/\/ contains the needed\n                    \/\/ stuff\n                    {\n                        DoremiEngine::AI::PotentialFieldActor* actor =\n                            EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(realEvent->entityID)->ChargedActor;\n                        m_field->AddActor(actor);\n                    }\n                    else\n                    {\n                        \/\/ TODOKO Log error\n                    }\n                    break;\n                }\n                case Doremi::Core::EventType::AiGroupActorCreation:\n                {\n                    EntityCreatedEvent* realEvent = static_cast<EntityCreatedEvent*>(p_event);\n                    if(EntityHandler::GetInstance().HasComponents(realEvent->entityID, (int)ComponentType::PotentialField | (int)ComponentType::AIGroup)) \/\/ Make sure the entity contains the needed stuff\n                    {\n                        DoremiEngine::AI::PotentialFieldActor* actor =\n                            EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(realEvent->entityID)->ChargedActor;\n                        DoremiEngine::AI::PotentialField* field;\n                        DoremiEngine::AI::PotentialGroup* group =\n                            EntityHandler::GetInstance().GetComponentFromStorage<AIGroupComponent>(realEvent->entityID)->Group;\n                        if(group == nullptr)\n                        {\n                            \/\/ TODOKO Log error and what happens\n                            group = m_sharedContext.GetAIModule().GetPotentialFieldSubModule().CreateNewPotentialGroup();\n                        }\n                        group->AddActor(actor);\n                        \/\/ TODOKO should not be done here but in a more suitable event\n                        field = m_sharedContext.GetAIModule().GetPotentialFieldSubModule().FindBestPotentialField(actor->GetPosition());\n                        EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(realEvent->entityID)->Field = field;\n                    }\n                    else\n                    {\n                        \/\/ TODOKO Log error\n                    }\n                    break;\n                }\n                case Doremi::Core::EventType::PlayerCreation:\n                {\n                    PlayerCreationEvent* realEvent = static_cast<PlayerCreationEvent*>(p_event);\n                    if(EntityHandler::GetInstance().HasComponents(realEvent->playerEntityID, (int)ComponentType::PotentialField)) \/\/ Make sure the\n                    \/\/ entity contains\n                    \/\/ the needed stuff\n                    {\n                        DoremiEngine::AI::PotentialFieldActor* actor =\n                            EntityHandler::GetInstance().GetComponentFromStorage<PotentialFieldComponent>(realEvent->playerEntityID)->ChargedActor;\n                        m_field->AddActor(actor);\n                        m_topField->AddActor(actor);\n                    }\n                    else\n                    {\n                        \/\/ TODOKO log error\n                    }\n                    break;\n                }\n                default:\n                    break;\n            }\n        }\n    }\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <climits>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <getopt.h>\n#include <string>\n#include <map>\nusing namespace std;\n\n\/* FLAGS *\/\nstatic int n_flag;\nstatic int min_flag;\nstatic int max_flag;\nstatic int mean_flag;\nstatic int sum_flag;\nstatic int sd_flag;\nstatic int population_flag;\nstatic int sample_flag;\nstatic int comp_flag;\nstatic int var_flag;\nstatic int help_flag;\n\n\n\/* DATA STRUCTURES *\/\nvector<long double> * stats = new vector<long double>();\nvector<long double> * points = new vector<long double>();\nmap<string, long double> * global_stats = new map<string, long double>();\nmap<string,int> * opts = new map<string, int>();\t\n\n\/\/running stats needed\nvoid compute_line_stats(vector<long double> * stats){\n\tlong double stat = (*stats).at(0);\n\n\t\/\/sum\n\t(*stats).at(1) += stat;\n\n\t\/\/N\n\t(*stats).at(4)+=1;\n\n\t\/\/min\n\tif ((*stats).at(2) > stat){\n\t\t(*stats).at(2) = stat;\n\t}\n\n\t\/\/max\n\tif ((*stats).at(3) < stat){\n\t\t(*stats).at(3) = stat; \n\t}\n}\n\nvoid print_help(){\n}\n\n\/\/global descriptive statistics\nvoid compute_global_stats(){\n\t\/\/mean\n\tlong double mean = (*stats).at(1) \/ (*stats).at(4); \n\tlong double n = (*stats).at(4);\n\n\t\/\/sum of squared deviations\n\tlong double sum = 0;\n\t\/\/for compensated variant\n\tlong double sum3 = 0;\n\tfor (long index=0; index<(long)(*points).size(); ++index){\n\t\tlong double diff = (*points).at(index) - mean;\n\t\tsum += (diff * diff);\n\t\tsum3 += diff;\n\t}\t\n\n\t\/\/for compensated variant biased\n\tlong double comp_var_s = (sum-((sum3*sum3)\/n))\/n;\t\n\n\t\/\/for compensated variant unbiased when n is not equal to |population|\n\tlong double comp_var_p = (sum-((sum3*sum3)\/n))\/n-1;\t\n\n\t\/\/sample sd comp\n\tlong double samp_sd_comp = sqrt(comp_var_s);\n\n\t\/\/pop sd comp\n\tlong double pop_sd_comp = sqrt(comp_var_p);\n\n\t\/\/sample variance\n\tlong double var_s = sum\/n;\n\n\t\/\/population variance\n\tlong double var_p = sum\/(n-1);\n\n\t\/\/sample sd\t\n\tlong double samp_sd = sqrt(var_s);\n\n\t\/\/pop sd\t\n\tlong double pop_sd = sqrt(var_p);\n\n\t\/\/init global_stats\n\n\t(*global_stats)[\"N\"] = n;\n\t(*global_stats)[\"mean\"] = mean;\n\n\t(*global_stats)[\"sampl_sd\"] = samp_sd;\n\t(*global_stats)[\"pop_sd\"] = pop_sd;\n\n\t(*global_stats)[\"pop_sd_comp\"] = pop_sd_comp;\n\t(*global_stats)[\"samp_sd_comp\"] = samp_sd_comp;\n\n\t(*global_stats)[\"sum\"] = (*stats).at(1);\n\t(*global_stats)[\"min\"] = (*stats).at(2);\n\t(*global_stats)[\"max\"] = (*stats).at(3);\n\t\n\t\n\tif( (*opts).find(\"population\") != (*opts).end() && (*opts).find(\"compensated\") != (*opts).end()){\n\t\t(*global_stats)[\"sd\"] = pop_sd_comp;\n\t\t(*global_stats)[\"var\"] = comp_var_p;\n\t}\n\tif( (*opts).find(\"population\") != (*opts).end() && (*opts).find(\"compensated\") == (*opts).end() ) {\n\t\t(*global_stats)[\"sd\"] = pop_sd;\n\t\t(*global_stats)[\"var\"] = var_p;\n\t}\n\tif( (*opts).find(\"population\") == (*opts).end() && (*opts).find(\"compensated\") != (*opts).end()){\n\t\t(*global_stats)[\"sd\"] = samp_sd_comp;\n\t\t(*global_stats)[\"var\"] = comp_var_s;\n\t}\n\tif( (*opts).find(\"population\") == (*opts).end() && (*opts).find(\"compensated\") == (*opts).end() ) {\n\t\t(*global_stats)[\"sd\"] = samp_sd;\n\t\t(*global_stats)[\"var\"] = var_s;\n\t}\n\n}\n\nvoid print_stats(){\n\n\tvector<string> opts_ordered; \n\topts_ordered.push_back(\"N\");\n\topts_ordered.push_back(\"min\");\n\topts_ordered.push_back(\"max\");\n\topts_ordered.push_back(\"sum\");\n\topts_ordered.push_back(\"mean\");\n\topts_ordered.push_back(\"sd\");\n\topts_ordered.push_back(\"var\");\n\n\tstring output = \" \"; \n\n\tfor(vector<string>::iterator ii=opts_ordered.begin(); ii!=opts_ordered.end();++ii){\n\t\tif ( (*opts).find(*ii)  ==  (*opts).end())\n\t\t\tcontinue;\n\t\tcout << *ii << \"\\t\";\n\n\t}\t\n\tcout<<endl;\n\tfor(vector<string>::iterator ii=opts_ordered.begin(); ii!=opts_ordered.end();++ii){\n\t\tif ( (*opts).find(*ii)  ==  (*opts).end())\n\t\t\tcontinue;\n\t\tcout << (*global_stats)[*ii] << \"\\t\";\n\t}\t\n\tcout<<endl;\n}\n\nvoid set_flags(int argc, char **argv, map<string,int>  * opts){\n\tint c;\n\twhile (1){\n\t   static struct option long_options[] = {\n\t       \/* These options set a flag. *\/\n\t       {\"sum\", no_argument,       &sum_flag, 1},\n\t       {\"min\",   no_argument,       &min_flag, 1},\n\t       {\"max\",   no_argument,       &max_flag, 1},\n\t       {\"mean\",   no_argument,       &mean_flag, 1},\n\t       {\"sd\",   no_argument,       &sd_flag, 1},\n\t       {\"var\",   no_argument,       &var_flag, 1},\n\t       {\"n\",   no_argument,       &n_flag, 1},\n\t       {\"population\",   no_argument,       &population_flag, 1},\n\t       {\"sample\",   no_argument,       &sample_flag, 1},\n\t       {\"compensated\",   no_argument,       &comp_flag, 1},\n\t     };\n\t   \/* getopt_long stores the option index here. *\/\n\t   int option_index = 0;\n\n\t   c = getopt_long (argc, argv, \"abc:d:f:\",\n\t\t\t    long_options, &option_index);\n\n\t   \/* Detect the end of the options. *\/\n\t   if (c == -1)\n\t     break;\n\n\t   switch (c)\n\t     {\n\t     case 0:\n\t       \/* If this option set a flag, do nothing else now. *\/\n\t       if (long_options[option_index].flag != 0)\n\t\t break;\n\t       printf (\"option %s\", long_options[option_index].name);\n\t       if (optarg)\n\t\t printf (\" with arg %s\", optarg);\n\t       printf (\"\\n\");\n\t       break;\n\n\t     case '?':\n\t       \/* getopt_long already printed an error message. *\/\n\t       break;\n\n\t     default:\n\t       abort ();\n\t     }\n\t }\n\n\tif (sum_flag)\n\t\t(*opts)[\"sum\"] = 1;\n\tif (n_flag)\n\t\t(*opts)[\"N\"] = 1;\n\tif (min_flag)\n\t\t(*opts)[\"min\"] = 1;\n\tif (max_flag)\n\t\t(*opts)[\"max\"] = 1;\n\tif (sd_flag)\n\t\t(*opts)[\"sd\"] = 1;\n\tif (comp_flag)\n\t\t(*opts)[\"compensated\"] = 1;\n\tif (sample_flag)\n\t\t(*opts)[\"sample\"] = 1;\n\tif (population_flag)\n\t\t(*opts)[\"population\"] = 1;\n\tif (mean_flag)\n\t\t(*opts)[\"mean\"] = 1;\n\tif (var_flag)\n\t\t(*opts)[\"var\"] = 1;\n\tif (help_flag)\n\t\tprint_help();\n\n       \/* Print any remaining command line arguments (not options). *\/\n\tif (optind < argc){\n           printf (\"non-option ARGV-elements: \");\n           while (optind < argc)\n             printf (\"%s \", argv[optind++]);\n           putchar ('\\n');\n\t}\t\n\n\t\/**\n\tIf opts is empty, print out all info, and assume sample statistics\n\t**\/\n\tif((*opts).size()==0){\n\t\t(*opts)[\"sum\"] = 1;\n\t\t(*opts)[\"N\"] = 1;\n\t\t(*opts)[\"min\"] = 1;\n\t\t(*opts)[\"max\"] = 1;\n\t\t(*opts)[\"mean\"] = 1;\n\t\t(*opts)[\"sd\"] = 1;\n\t}\n\n}\n\nint main (int argc, char **argv){\n\tset_flags(argc, argv,opts);\n\tlong double sum = 0;\n\tlong double n = 0;\n\tlong double min = INT_MAX;\n\tlong double max = INT_MIN;\n\tlong double mean = 0;\n\tlong double sd = 0;\n\n\t(*stats).push_back(sum);\n\t(*stats).push_back(sum);\n\t(*stats).push_back(min);\n\t(*stats).push_back(max); \n\t(*stats).push_back(n); \n\t(*stats).push_back(mean); \n\t(*stats).push_back(sd); \n\n\twhile(cin){\n\t\tstring input_line;\n\t\tgetline(cin,input_line);\n\t\tif(input_line==\"\") continue;\n\t\tlong double stat = (long double) ::atof(input_line.c_str());\n\t\t(*stats).at(0) = stat;\n\t\tcompute_line_stats(stats);\n\t\t(*points).push_back(stat);\n\t}\n\tcompute_global_stats();\n\tprint_stats();\n\t\n\tdelete points;\n\tdelete stats;\n\tdelete global_stats;\n\tdelete opts;\n\treturn 0;\n}\n\n\n<commit_msg>Various small changes<commit_after>#include <iostream>\n#include <vector>\n#include <climits>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <getopt.h>\n#include <string>\n#include <map>\nusing namespace std;\n\n\/* FLAGS *\/\nstatic int n_flag;\nstatic int min_flag;\nstatic int max_flag;\nstatic int mean_flag;\nstatic int sum_flag;\nstatic int sd_flag;\nstatic int population_flag;\nstatic int sample_flag;\nstatic int comp_flag;\nstatic int var_flag;\nstatic int help_flag;\n\n\n\/* DATA STRUCTURES *\/\nvector<long double> * stats = new vector<long double>();\nvector<long double> * points = new vector<long double>();\nmap<string, long double> * global_stats = new map<string, long double>();\nmap<string,int> * opts = new map<string, int>();\t\n\n\/* STATS COMPUTED AT THE LINE *\/\nvoid compute_line_stats(){\n\tlong double stat = (*stats).at(0);\n\n\t\/\/sum\n\t(*stats).at(1) += stat;\n\n\t\/\/N\n\t(*stats).at(4)+=1;\n\n\t\/\/min\n\tif ((*stats).at(2) > stat){\n\t\t(*stats).at(2) = stat;\n\t}\n\n\t\/\/max\n\tif ((*stats).at(3) < stat){\n\t\t(*stats).at(3) = stat; \n\t}\n}\n\nvoid print_help(){\n}\n\n\/* COMPUTE GLOBAL STATS *\/\nvoid compute_global_stats(){\n\t\/\/mean\n\tlong double mean = (*stats).at(1) \/ (*stats).at(4); \n\tlong double n = (*stats).at(4);\n\n\t\/\/sum of squared deviations\n\tlong double sum = 0;\n\t\/\/for compensated variant\n\tlong double sum3 = 0;\n\tfor (long index=0; index<(long)(*points).size(); ++index){\n\t\tlong double diff = (*points).at(index) - mean;\n\t\tsum += (diff * diff);\n\t\tsum3 += diff;\n\t}\t\n\n\t\/\/for compensated variant biased\n\tlong double comp_var_s = (sum-((sum3*sum3)\/n))\/n;\t\n\n\t\/\/for compensated variant unbiased when n is not equal to |population|\n\tlong double comp_var_p = (sum-((sum3*sum3)\/n))\/n-1;\t\n\n\t\/\/sample sd comp\n\tlong double samp_sd_comp = sqrt(comp_var_s);\n\n\t\/\/pop sd comp\n\tlong double pop_sd_comp = sqrt(comp_var_p);\n\n\t\/\/sample variance\n\tlong double var_s = sum\/n;\n\n\t\/\/population variance\n\tlong double var_p = sum\/(n-1);\n\n\t\/\/sample sd\t\n\tlong double samp_sd = sqrt(var_s);\n\n\t\/\/pop sd\t\n\tlong double pop_sd = sqrt(var_p);\n\n\t\/\/init global_stats\n\n\t(*global_stats)[\"N\"] = n;\n\t(*global_stats)[\"mean\"] = mean;\n\n\t(*global_stats)[\"sampl_sd\"] = samp_sd;\n\t(*global_stats)[\"pop_sd\"] = pop_sd;\n\n\t(*global_stats)[\"pop_sd_comp\"] = pop_sd_comp;\n\t(*global_stats)[\"samp_sd_comp\"] = samp_sd_comp;\n\n\t(*global_stats)[\"sum\"] = (*stats).at(1);\n\t(*global_stats)[\"min\"] = (*stats).at(2);\n\t(*global_stats)[\"max\"] = (*stats).at(3);\n\t\n\t\n\tif( (*opts).find(\"population\") != (*opts).end() && (*opts).find(\"compensated\") != (*opts).end()){\n\t\t(*global_stats)[\"sd\"] = pop_sd_comp;\n\t\t(*global_stats)[\"var\"] = comp_var_p;\n\t}\n\tif( (*opts).find(\"population\") != (*opts).end() && (*opts).find(\"compensated\") == (*opts).end() ) {\n\t\t(*global_stats)[\"sd\"] = pop_sd;\n\t\t(*global_stats)[\"var\"] = var_p;\n\t}\n\tif( (*opts).find(\"population\") == (*opts).end() && (*opts).find(\"compensated\") != (*opts).end()){\n\t\t(*global_stats)[\"sd\"] = samp_sd_comp;\n\t\t(*global_stats)[\"var\"] = comp_var_s;\n\t}\n\tif( (*opts).find(\"population\") == (*opts).end() && (*opts).find(\"compensated\") == (*opts).end() ) {\n\t\t(*global_stats)[\"sd\"] = samp_sd;\n\t\t(*global_stats)[\"var\"] = var_s;\n\t}\n\n}\n\nvoid print_stats(){\n\n\tvector<string> opts_ordered; \n\topts_ordered.push_back(\"N\");\n\topts_ordered.push_back(\"min\");\n\topts_ordered.push_back(\"max\");\n\topts_ordered.push_back(\"sum\");\n\topts_ordered.push_back(\"mean\");\n\topts_ordered.push_back(\"sd\");\n\topts_ordered.push_back(\"var\");\n\n\tstring output = \" \"; \n\n\tfor(vector<string>::iterator ii=opts_ordered.begin(); ii!=opts_ordered.end();++ii){\n\t\tif ( (*opts).find(*ii)  ==  (*opts).end())\n\t\t\tcontinue;\n\t\tcout << *ii << \"\\t\";\n\n\t}\t\n\tcout<<endl;\n\tfor(vector<string>::iterator ii=opts_ordered.begin(); ii!=opts_ordered.end();++ii){\n\t\tif ( (*opts).find(*ii)  ==  (*opts).end())\n\t\t\tcontinue;\n\t\tcout << (*global_stats)[*ii] << \"\\t\";\n\t}\t\n\tcout<<endl;\n}\n\nvoid read_parameters(int argc, char **argv){\n\tint c;\n\twhile (1){\n\t   static struct option long_options[] = {\n\t       \/* These options set a flag. *\/\n\t       {\"sum\", no_argument,       &sum_flag, 1},\n\t       {\"min\",   no_argument,       &min_flag, 1},\n\t       {\"max\",   no_argument,       &max_flag, 1},\n\t       {\"mean\",   no_argument,       &mean_flag, 1},\n\t       {\"sd\",   no_argument,       &sd_flag, 1},\n\t       {\"var\",   no_argument,       &var_flag, 1},\n\t       {\"n\",   no_argument,       &n_flag, 1},\n\t       {\"population\",   no_argument,       &population_flag, 1},\n\t       {\"sample\",   no_argument,       &sample_flag, 1},\n\t       {\"compensated\",   no_argument,       &comp_flag, 1},\n\t     };\n\t   \/* getopt_long stores the option index here. *\/\n\t   int option_index = 0;\n\n\t   c = getopt_long (argc, argv, \"abc:d:f:\",\n\t\t\t    long_options, &option_index);\n\n\t   \/* Detect the end of the options. *\/\n\t   if (c == -1)\n\t     break;\n\n\t   switch (c)\n\t     {\n\t     case 0:\n\t       \/* If this option set a flag, do nothing else now. *\/\n\t       if (long_options[option_index].flag != 0)\n\t\t break;\n\t       printf (\"option %s\", long_options[option_index].name);\n\t       if (optarg)\n\t\t printf (\" with arg %s\", optarg);\n\t       printf (\"\\n\");\n\t       break;\n\n\t     case '?':\n\t       \/* getopt_long already printed an error message. *\/\n\t       break;\n\n\t     default:\n\t       abort ();\n\t     }\n\t }\n\n\tif (sum_flag)\n\t\t(*opts)[\"sum\"] = 1;\n\tif (n_flag)\n\t\t(*opts)[\"N\"] = 1;\n\tif (min_flag)\n\t\t(*opts)[\"min\"] = 1;\n\tif (max_flag)\n\t\t(*opts)[\"max\"] = 1;\n\tif (sd_flag)\n\t\t(*opts)[\"sd\"] = 1;\n\tif (comp_flag)\n\t\t(*opts)[\"compensated\"] = 1;\n\tif (sample_flag)\n\t\t(*opts)[\"sample\"] = 1;\n\tif (population_flag)\n\t\t(*opts)[\"population\"] = 1;\n\tif (mean_flag)\n\t\t(*opts)[\"mean\"] = 1;\n\tif (var_flag)\n\t\t(*opts)[\"var\"] = 1;\n\tif (help_flag)\n\t\tprint_help();\n\n       \/* Print any remaining command line arguments (not options). *\/\n\tif (optind < argc){\n           printf (\"non-option ARGV-elements: \");\n           while (optind < argc)\n             printf (\"%s \", argv[optind++]);\n           putchar ('\\n');\n\t}\t\n\n\t\/**\n\tIf opts is empty, print out all info, and assume sample statistics\n\t**\/\n\tif((*opts).size()==0){\n\t\t(*opts)[\"sum\"] = 1;\n\t\t(*opts)[\"N\"] = 1;\n\t\t(*opts)[\"min\"] = 1;\n\t\t(*opts)[\"max\"] = 1;\n\t\t(*opts)[\"mean\"] = 1;\n\t\t(*opts)[\"sd\"] = 1;\n\t}\n\n}\n\nint main (int argc, char **argv){\n\tread_parameters(argc, argv);\n\tlong double sum = 0;\n\tlong double n = 0;\n\tlong double min = INT_MAX;\n\tlong double max = INT_MIN;\n\tlong double mean = 0;\n\tlong double sd = 0;\n\n\t(*stats).push_back(sum);\n\t(*stats).push_back(sum);\n\t(*stats).push_back(min);\n\t(*stats).push_back(max); \n\t(*stats).push_back(n); \n\t(*stats).push_back(mean); \n\t(*stats).push_back(sd); \n\n\twhile(cin){\n\t\tstring input_line;\n\t\tgetline(cin,input_line);\n\t\tif(input_line==\"\") continue;\n\t\tlong double stat = (long double) ::atof(input_line.c_str());\n\t\t(*stats).at(0) = stat;\n\t\tcompute_line_stats();\n\t\t(*points).push_back(stat);\n\t}\n\tcompute_global_stats();\n\tprint_stats();\n\t\n\tdelete points;\n\tdelete stats;\n\tdelete global_stats;\n\tdelete opts;\n\treturn 0;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"QXmppRemoteMethod.h\"\n#include \"QXmppClient.h\"\n#include \"QXmppUtils.h\"\n#include \"QXmppConfiguration.h\"\n\n#include <QEventLoop>\n#include <QTimer>\n\nQXmppRemoteMethod::QXmppRemoteMethod(const QString &jid, const QString &method, const QVariantList &args, QXmppClient *client) :\n        QObject(client), m_client(client)\n{\n    m_payload.setId( generateStanzaHash() );\n    m_payload.setTo( jid );\n    m_payload.setFrom( client->getConfiguration().getJid() );\n    m_payload.setInterface( method.section('.', 0 ) );\n    m_payload.setMethod( method.section('.', 1) );\n    m_payload.setPayload( args );\n}\n\nQXmppRemoteMethodResult QXmppRemoteMethod::call( )\n{\n    QEventLoop loop(this);\n    connect( this, SIGNAL(callDone()), &loop, SLOT(quit()));\n    QTimer::singleShot(30000,&loop, SLOT(quit())); \/\/ Timeout incase the other end hangs...\n\n    m_client->sendPacket( m_payload );\n\n    loop.exec( QEventLoop::ExcludeUserInputEvents | QEventLoop::WaitForMoreEvents );\n    return m_result;\n}\n\nvoid QXmppRemoteMethod::gotError( const QXmppRpcErrorIq &iq )\n{\n    if ( iq.getId() == m_payload.getId() )\n    {\n        m_result.hasError = true;\n        m_result.errorMessage = iq.getError().getText();\n        m_result.code = iq.getError().getType();\n        emit callDone();\n    }\n}\n\nvoid QXmppRemoteMethod::gotResult( const QXmppRpcResponseIq &iq )\n{\n    if ( iq.getId() == m_payload.getId() )\n    {\n        m_result.hasError = false;\n        m_result.result = iq.getPayload();\n        emit callDone();\n    }\n}\n<commit_msg>Split interfaces correctly<commit_after>#include \"QXmppRemoteMethod.h\"\n#include \"QXmppClient.h\"\n#include \"QXmppUtils.h\"\n#include \"QXmppConfiguration.h\"\n\n#include <QEventLoop>\n#include <QTimer>\n#include <qdebug.h>\n\nQXmppRemoteMethod::QXmppRemoteMethod(const QString &jid, const QString &method, const QVariantList &args, QXmppClient *client) :\n        QObject(client), m_client(client)\n{\n    m_payload.setId( generateStanzaHash() );\n    m_payload.setTo( jid );\n    m_payload.setFrom( client->getConfiguration().getJid() );\n    m_payload.setInterface( method.section('.', 0, 0 ) );\n    m_payload.setMethod( method.section('.', 1) );\n    m_payload.setPayload( args );\n}\n\nQXmppRemoteMethodResult QXmppRemoteMethod::call( )\n{\n    QEventLoop loop(this);\n    connect( this, SIGNAL(callDone()), &loop, SLOT(quit()));\n    QTimer::singleShot(30000,&loop, SLOT(quit())); \/\/ Timeout incase the other end hangs...\n\n    m_client->sendPacket( m_payload );\n\n    loop.exec( QEventLoop::ExcludeUserInputEvents | QEventLoop::WaitForMoreEvents );\n    return m_result;\n}\n\nvoid QXmppRemoteMethod::gotError( const QXmppRpcErrorIq &iq )\n{\n    if ( iq.getId() == m_payload.getId() )\n    {\n        m_result.hasError = true;\n        m_result.errorMessage = iq.getError().getText();\n        m_result.code = iq.getError().getType();\n        emit callDone();\n    }\n}\n\nvoid QXmppRemoteMethod::gotResult( const QXmppRpcResponseIq &iq )\n{\n    if ( iq.getId() == m_payload.getId() )\n    {\n        m_result.hasError = false;\n        m_result.result = iq.getPayload();\n        emit callDone();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\r\n\/\/\/ SoundStretch main routine.\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 <stdexcept>\r\n#include <stdio.h>\r\n#include <string.h>\r\n#include <time.h>\r\n#include \"RunParameters.h\"\r\n#include \"WavFile.h\"\r\n#include \"SoundTouch.h\"\r\n#include \"BPMDetect.h\"\r\n\r\nusing namespace soundtouch;\r\nusing namespace std;\r\n\r\n\/\/ Processing chunk size (size chosen to be divisible by 2, 4, 6, 8, 10, 12, 14, 16 channels ...)\r\n#define BUFF_SIZE           6720\r\n\r\n#if _WIN32\r\n    #include <io.h>\r\n    #include <fcntl.h>\r\n\r\n    \/\/ Macro for Win32 standard input\/output stream support: Sets a file stream into binary mode\r\n    #define SET_STREAM_TO_BIN_MODE(f) (_setmode(_fileno(f), _O_BINARY))\r\n#else\r\n    \/\/ Not needed for GNU environment... \r\n    #define SET_STREAM_TO_BIN_MODE(f) {}\r\n#endif\r\n\r\n\r\nstatic const char _helloText[] = \r\n    \"\\n\"\r\n    \"   SoundStretch v%s -  Written by Olli Parviainen 2001 - 2014\\n\"\r\n    \"==================================================================\\n\"\r\n    \"author e-mail: <oparviai\"\r\n    \"@\"\r\n    \"iki.fi> - WWW: http:\/\/www.surina.net\/soundtouch\\n\"\r\n    \"\\n\"\r\n    \"This program is subject to (L)GPL license. Run \\\"soundstretch -license\\\" for\\n\"\r\n    \"more information.\\n\"\r\n    \"\\n\";\r\n\r\nstatic void openFiles(WavInFile **inFile, WavOutFile **outFile, const RunParameters *params)\r\n{\r\n    int bits, samplerate, channels;\r\n\r\n    if (strcmp(params->inFileName, \"stdin\") == 0)\r\n    {\r\n        \/\/ used 'stdin' as input file\r\n        SET_STREAM_TO_BIN_MODE(stdin);\r\n        *inFile = new WavInFile(stdin);\r\n    }\r\n    else\r\n    {\r\n        \/\/ open input file...\r\n        *inFile = new WavInFile(params->inFileName);\r\n    }\r\n\r\n    \/\/ ... open output file with same sound parameters\r\n    bits = (int)(*inFile)->getNumBits();\r\n    samplerate = (int)(*inFile)->getSampleRate();\r\n    channels = (int)(*inFile)->getNumChannels();\r\n\r\n    if (params->outFileName)\r\n    {\r\n        if (strcmp(params->outFileName, \"stdout\") == 0)\r\n        {\r\n            SET_STREAM_TO_BIN_MODE(stdout);\r\n            *outFile = new WavOutFile(stdout, samplerate, bits, channels);\r\n        }\r\n        else\r\n        {\r\n            *outFile = new WavOutFile(params->outFileName, samplerate, bits, channels);\r\n        }\r\n    }\r\n    else\r\n    {\r\n        *outFile = NULL;\r\n    }\r\n}\r\n\r\n\r\n\r\n\/\/ Sets the 'SoundTouch' object up according to input file sound format & \r\n\/\/ command line parameters\r\nstatic void setup(SoundTouch *pSoundTouch, const WavInFile *inFile, const RunParameters *params)\r\n{\r\n    int sampleRate;\r\n    int channels;\r\n\r\n    sampleRate = (int)inFile->getSampleRate();\r\n    channels = (int)inFile->getNumChannels();\r\n    pSoundTouch->setSampleRate(sampleRate);\r\n    pSoundTouch->setChannels(channels);\r\n\r\n    pSoundTouch->setTempoChange(params->tempoDelta);\r\n    pSoundTouch->setPitchSemiTones(params->pitchDelta);\r\n    pSoundTouch->setRateChange(params->rateDelta);\r\n\r\n    pSoundTouch->setSetting(SETTING_USE_QUICKSEEK, params->quick);\r\n    pSoundTouch->setSetting(SETTING_USE_AA_FILTER, !(params->noAntiAlias));\r\n\r\n    if (params->speech)\r\n    {\r\n        \/\/ use settings for speech processing\r\n        pSoundTouch->setSetting(SETTING_SEQUENCE_MS, 40);\r\n        pSoundTouch->setSetting(SETTING_SEEKWINDOW_MS, 15);\r\n        pSoundTouch->setSetting(SETTING_OVERLAP_MS, 8);\r\n        fprintf(stderr, \"Tune processing parameters for speech processing.\\n\");\r\n    }\r\n\r\n    \/\/ print processing information\r\n    if (params->outFileName)\r\n    {\r\n#ifdef SOUNDTOUCH_INTEGER_SAMPLES\r\n        fprintf(stderr, \"Uses 16bit integer sample type in processing.\\n\\n\");\r\n#else\r\n    #ifndef SOUNDTOUCH_FLOAT_SAMPLES\r\n        #error \"Sampletype not defined\"\r\n    #endif\r\n        fprintf(stderr, \"Uses 32bit floating point sample type in processing.\\n\\n\");\r\n#endif\r\n        \/\/ print processing information only if outFileName given i.e. some processing will happen\r\n        fprintf(stderr, \"Processing the file with the following changes:\\n\");\r\n        fprintf(stderr, \"  tempo change = %+g %%\\n\", params->tempoDelta);\r\n        fprintf(stderr, \"  pitch change = %+g semitones\\n\", params->pitchDelta);\r\n        fprintf(stderr, \"  rate change  = %+g %%\\n\\n\", params->rateDelta);\r\n        fprintf(stderr, \"Working...\");\r\n    }\r\n    else\r\n    {\r\n        \/\/ outFileName not given\r\n        fprintf(stderr, \"Warning: output file name missing, won't output anything.\\n\\n\");\r\n    }\r\n\r\n    fflush(stderr);\r\n}\r\n\r\n\r\n\r\n\/\/ Processes the sound\r\nstatic void process(SoundTouch *pSoundTouch, WavInFile *inFile, WavOutFile *outFile)\r\n{\r\n    int nSamples;\r\n    int nChannels;\r\n    int buffSizeSamples;\r\n    SAMPLETYPE sampleBuffer[BUFF_SIZE];\r\n\r\n    if ((inFile == NULL) || (outFile == NULL)) return;  \/\/ nothing to do.\r\n\r\n    nChannels = (int)inFile->getNumChannels();\r\n    assert(nChannels > 0);\r\n    buffSizeSamples = BUFF_SIZE \/ nChannels;\r\n\r\n    \/\/ Process samples read from the input file\r\n    while (inFile->eof() == 0)\r\n    {\r\n        int num;\r\n\r\n        \/\/ Read a chunk of samples from the input file\r\n        num = inFile->read(sampleBuffer, BUFF_SIZE);\r\n        nSamples = num \/ (int)inFile->getNumChannels();\r\n\r\n        \/\/ Feed the samples into SoundTouch processor\r\n        pSoundTouch->putSamples(sampleBuffer, nSamples);\r\n\r\n        \/\/ Read ready samples from SoundTouch processor & write them output file.\r\n        \/\/ NOTES:\r\n        \/\/ - 'receiveSamples' doesn't necessarily return any samples at all\r\n        \/\/   during some rounds!\r\n        \/\/ - On the other hand, during some round 'receiveSamples' may have more\r\n        \/\/   ready samples than would fit into 'sampleBuffer', and for this reason \r\n        \/\/   the 'receiveSamples' call is iterated for as many times as it\r\n        \/\/   outputs samples.\r\n        do \r\n        {\r\n            nSamples = pSoundTouch->receiveSamples(sampleBuffer, buffSizeSamples);\r\n            outFile->write(sampleBuffer, nSamples * nChannels);\r\n        } while (nSamples != 0);\r\n    }\r\n\r\n    \/\/ Now the input file is processed, yet 'flush' few last samples that are\r\n    \/\/ hiding in the SoundTouch's internal processing pipeline.\r\n    pSoundTouch->flush();\r\n    do \r\n    {\r\n        nSamples = pSoundTouch->receiveSamples(sampleBuffer, buffSizeSamples);\r\n        outFile->write(sampleBuffer, nSamples * nChannels);\r\n    } while (nSamples != 0);\r\n}\r\n\r\n\r\n\r\n\/\/ Detect BPM rate of inFile and adjust tempo setting accordingly if necessary\r\nstatic void detectBPM(WavInFile *inFile, RunParameters *params)\r\n{\r\n    float bpmValue;\r\n    int nChannels;\r\n    BPMDetect bpm(inFile->getNumChannels(), inFile->getSampleRate());\r\n    SAMPLETYPE sampleBuffer[BUFF_SIZE];\r\n\r\n    \/\/ detect bpm rate\r\n    fprintf(stderr, \"Detecting BPM rate...\");\r\n    fflush(stderr);\r\n\r\n    nChannels = (int)inFile->getNumChannels();\r\n    assert(BUFF_SIZE % nChannels == 0);\r\n\r\n    \/\/ Process the 'inFile' in small blocks, repeat until whole file has \r\n    \/\/ been processed\r\n    while (inFile->eof() == 0)\r\n    {\r\n        int num, samples;\r\n\r\n        \/\/ Read sample data from input file\r\n        num = inFile->read(sampleBuffer, BUFF_SIZE);\r\n\r\n        \/\/ Enter the new samples to the bpm analyzer class\r\n        samples = num \/ nChannels;\r\n        bpm.inputSamples(sampleBuffer, samples);\r\n    }\r\n\r\n    \/\/ Now the whole song data has been analyzed. Read the resulting bpm.\r\n    bpmValue = bpm.getBpm();\r\n    fprintf(stderr, \"Done!\\n\");\r\n\r\n    \/\/ rewind the file after bpm detection\r\n    inFile->rewind();\r\n\r\n    if (bpmValue > 0)\r\n    {\r\n        fprintf(stderr, \"Detected BPM rate %.1f\\n\\n\", bpmValue);\r\n    }\r\n    else\r\n    {\r\n        fprintf(stderr, \"Couldn't detect BPM rate.\\n\\n\");\r\n        return;\r\n    }\r\n\r\n    if (params->goalBPM > 0)\r\n    {\r\n        \/\/ adjust tempo to given bpm\r\n        params->tempoDelta = (params->goalBPM \/ bpmValue - 1.0f) * 100.0f;\r\n        fprintf(stderr, \"The file will be converted to %.1f BPM\\n\\n\", params->goalBPM);\r\n    }\r\n}\r\n\r\n\r\n\r\nint main(const int nParams, const char * const paramStr[])\r\n{\r\n    WavInFile *inFile;\r\n    WavOutFile *outFile;\r\n    RunParameters *params;\r\n    SoundTouch soundTouch;\r\n\r\n    fprintf(stderr, _helloText, SoundTouch::getVersionString());\r\n\r\n    try \r\n    {\r\n        \/\/ Parse command line parameters\r\n        params = new RunParameters(nParams, paramStr);\r\n\r\n        \/\/ Open input & output files\r\n        openFiles(&inFile, &outFile, params);\r\n\r\n        if (params->detectBPM == true)\r\n        {\r\n            \/\/ detect sound BPM (and adjust processing parameters\r\n            \/\/  accordingly if necessary)\r\n            detectBPM(inFile, params);\r\n        }\r\n\r\n        \/\/ Setup the 'SoundTouch' object for processing the sound\r\n        setup(&soundTouch, inFile, params);\r\n\r\n        \/\/ clock_t cs = clock();    \/\/ for benchmarking processing duration\r\n        \/\/ Process the sound\r\n        process(&soundTouch, inFile, outFile);\r\n        \/\/ clock_t ce = clock();    \/\/ for benchmarking processing duration\r\n        \/\/ printf(\"duration: %lf\\n\", (double)(ce-cs)\/CLOCKS_PER_SEC);\r\n\r\n        \/\/ Close WAV file handles & dispose of the objects\r\n        delete inFile;\r\n        delete outFile;\r\n        delete params;\r\n\r\n        fprintf(stderr, \"Done!\\n\");\r\n    } \r\n    catch (const runtime_error &e) \r\n    {\r\n        \/\/ An exception occurred during processing, display an error message\r\n        fprintf(stderr, \"%s\\n\", e.what());\r\n        return -1;\r\n    }\r\n\r\n    return 0;\r\n}\r\n<commit_msg>Change year<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\r\n\/\/\/ SoundStretch main routine.\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 <stdexcept>\r\n#include <stdio.h>\r\n#include <string.h>\r\n#include <time.h>\r\n#include \"RunParameters.h\"\r\n#include \"WavFile.h\"\r\n#include \"SoundTouch.h\"\r\n#include \"BPMDetect.h\"\r\n\r\nusing namespace soundtouch;\r\nusing namespace std;\r\n\r\n\/\/ Processing chunk size (size chosen to be divisible by 2, 4, 6, 8, 10, 12, 14, 16 channels ...)\r\n#define BUFF_SIZE           6720\r\n\r\n#if _WIN32\r\n    #include <io.h>\r\n    #include <fcntl.h>\r\n\r\n    \/\/ Macro for Win32 standard input\/output stream support: Sets a file stream into binary mode\r\n    #define SET_STREAM_TO_BIN_MODE(f) (_setmode(_fileno(f), _O_BINARY))\r\n#else\r\n    \/\/ Not needed for GNU environment... \r\n    #define SET_STREAM_TO_BIN_MODE(f) {}\r\n#endif\r\n\r\n\r\nstatic const char _helloText[] = \r\n    \"\\n\"\r\n    \"   SoundStretch v%s -  Written by Olli Parviainen 2001 - 2015\\n\"\r\n    \"==================================================================\\n\"\r\n    \"author e-mail: <oparviai\"\r\n    \"@\"\r\n    \"iki.fi> - WWW: http:\/\/www.surina.net\/soundtouch\\n\"\r\n    \"\\n\"\r\n    \"This program is subject to (L)GPL license. Run \\\"soundstretch -license\\\" for\\n\"\r\n    \"more information.\\n\"\r\n    \"\\n\";\r\n\r\nstatic void openFiles(WavInFile **inFile, WavOutFile **outFile, const RunParameters *params)\r\n{\r\n    int bits, samplerate, channels;\r\n\r\n    if (strcmp(params->inFileName, \"stdin\") == 0)\r\n    {\r\n        \/\/ used 'stdin' as input file\r\n        SET_STREAM_TO_BIN_MODE(stdin);\r\n        *inFile = new WavInFile(stdin);\r\n    }\r\n    else\r\n    {\r\n        \/\/ open input file...\r\n        *inFile = new WavInFile(params->inFileName);\r\n    }\r\n\r\n    \/\/ ... open output file with same sound parameters\r\n    bits = (int)(*inFile)->getNumBits();\r\n    samplerate = (int)(*inFile)->getSampleRate();\r\n    channels = (int)(*inFile)->getNumChannels();\r\n\r\n    if (params->outFileName)\r\n    {\r\n        if (strcmp(params->outFileName, \"stdout\") == 0)\r\n        {\r\n            SET_STREAM_TO_BIN_MODE(stdout);\r\n            *outFile = new WavOutFile(stdout, samplerate, bits, channels);\r\n        }\r\n        else\r\n        {\r\n            *outFile = new WavOutFile(params->outFileName, samplerate, bits, channels);\r\n        }\r\n    }\r\n    else\r\n    {\r\n        *outFile = NULL;\r\n    }\r\n}\r\n\r\n\r\n\r\n\/\/ Sets the 'SoundTouch' object up according to input file sound format & \r\n\/\/ command line parameters\r\nstatic void setup(SoundTouch *pSoundTouch, const WavInFile *inFile, const RunParameters *params)\r\n{\r\n    int sampleRate;\r\n    int channels;\r\n\r\n    sampleRate = (int)inFile->getSampleRate();\r\n    channels = (int)inFile->getNumChannels();\r\n    pSoundTouch->setSampleRate(sampleRate);\r\n    pSoundTouch->setChannels(channels);\r\n\r\n    pSoundTouch->setTempoChange(params->tempoDelta);\r\n    pSoundTouch->setPitchSemiTones(params->pitchDelta);\r\n    pSoundTouch->setRateChange(params->rateDelta);\r\n\r\n    pSoundTouch->setSetting(SETTING_USE_QUICKSEEK, params->quick);\r\n    pSoundTouch->setSetting(SETTING_USE_AA_FILTER, !(params->noAntiAlias));\r\n\r\n    if (params->speech)\r\n    {\r\n        \/\/ use settings for speech processing\r\n        pSoundTouch->setSetting(SETTING_SEQUENCE_MS, 40);\r\n        pSoundTouch->setSetting(SETTING_SEEKWINDOW_MS, 15);\r\n        pSoundTouch->setSetting(SETTING_OVERLAP_MS, 8);\r\n        fprintf(stderr, \"Tune processing parameters for speech processing.\\n\");\r\n    }\r\n\r\n    \/\/ print processing information\r\n    if (params->outFileName)\r\n    {\r\n#ifdef SOUNDTOUCH_INTEGER_SAMPLES\r\n        fprintf(stderr, \"Uses 16bit integer sample type in processing.\\n\\n\");\r\n#else\r\n    #ifndef SOUNDTOUCH_FLOAT_SAMPLES\r\n        #error \"Sampletype not defined\"\r\n    #endif\r\n        fprintf(stderr, \"Uses 32bit floating point sample type in processing.\\n\\n\");\r\n#endif\r\n        \/\/ print processing information only if outFileName given i.e. some processing will happen\r\n        fprintf(stderr, \"Processing the file with the following changes:\\n\");\r\n        fprintf(stderr, \"  tempo change = %+g %%\\n\", params->tempoDelta);\r\n        fprintf(stderr, \"  pitch change = %+g semitones\\n\", params->pitchDelta);\r\n        fprintf(stderr, \"  rate change  = %+g %%\\n\\n\", params->rateDelta);\r\n        fprintf(stderr, \"Working...\");\r\n    }\r\n    else\r\n    {\r\n        \/\/ outFileName not given\r\n        fprintf(stderr, \"Warning: output file name missing, won't output anything.\\n\\n\");\r\n    }\r\n\r\n    fflush(stderr);\r\n}\r\n\r\n\r\n\r\n\/\/ Processes the sound\r\nstatic void process(SoundTouch *pSoundTouch, WavInFile *inFile, WavOutFile *outFile)\r\n{\r\n    int nSamples;\r\n    int nChannels;\r\n    int buffSizeSamples;\r\n    SAMPLETYPE sampleBuffer[BUFF_SIZE];\r\n\r\n    if ((inFile == NULL) || (outFile == NULL)) return;  \/\/ nothing to do.\r\n\r\n    nChannels = (int)inFile->getNumChannels();\r\n    assert(nChannels > 0);\r\n    buffSizeSamples = BUFF_SIZE \/ nChannels;\r\n\r\n    \/\/ Process samples read from the input file\r\n    while (inFile->eof() == 0)\r\n    {\r\n        int num;\r\n\r\n        \/\/ Read a chunk of samples from the input file\r\n        num = inFile->read(sampleBuffer, BUFF_SIZE);\r\n        nSamples = num \/ (int)inFile->getNumChannels();\r\n\r\n        \/\/ Feed the samples into SoundTouch processor\r\n        pSoundTouch->putSamples(sampleBuffer, nSamples);\r\n\r\n        \/\/ Read ready samples from SoundTouch processor & write them output file.\r\n        \/\/ NOTES:\r\n        \/\/ - 'receiveSamples' doesn't necessarily return any samples at all\r\n        \/\/   during some rounds!\r\n        \/\/ - On the other hand, during some round 'receiveSamples' may have more\r\n        \/\/   ready samples than would fit into 'sampleBuffer', and for this reason \r\n        \/\/   the 'receiveSamples' call is iterated for as many times as it\r\n        \/\/   outputs samples.\r\n        do \r\n        {\r\n            nSamples = pSoundTouch->receiveSamples(sampleBuffer, buffSizeSamples);\r\n            outFile->write(sampleBuffer, nSamples * nChannels);\r\n        } while (nSamples != 0);\r\n    }\r\n\r\n    \/\/ Now the input file is processed, yet 'flush' few last samples that are\r\n    \/\/ hiding in the SoundTouch's internal processing pipeline.\r\n    pSoundTouch->flush();\r\n    do \r\n    {\r\n        nSamples = pSoundTouch->receiveSamples(sampleBuffer, buffSizeSamples);\r\n        outFile->write(sampleBuffer, nSamples * nChannels);\r\n    } while (nSamples != 0);\r\n}\r\n\r\n\r\n\r\n\/\/ Detect BPM rate of inFile and adjust tempo setting accordingly if necessary\r\nstatic void detectBPM(WavInFile *inFile, RunParameters *params)\r\n{\r\n    float bpmValue;\r\n    int nChannels;\r\n    BPMDetect bpm(inFile->getNumChannels(), inFile->getSampleRate());\r\n    SAMPLETYPE sampleBuffer[BUFF_SIZE];\r\n\r\n    \/\/ detect bpm rate\r\n    fprintf(stderr, \"Detecting BPM rate...\");\r\n    fflush(stderr);\r\n\r\n    nChannels = (int)inFile->getNumChannels();\r\n    assert(BUFF_SIZE % nChannels == 0);\r\n\r\n    \/\/ Process the 'inFile' in small blocks, repeat until whole file has \r\n    \/\/ been processed\r\n    while (inFile->eof() == 0)\r\n    {\r\n        int num, samples;\r\n\r\n        \/\/ Read sample data from input file\r\n        num = inFile->read(sampleBuffer, BUFF_SIZE);\r\n\r\n        \/\/ Enter the new samples to the bpm analyzer class\r\n        samples = num \/ nChannels;\r\n        bpm.inputSamples(sampleBuffer, samples);\r\n    }\r\n\r\n    \/\/ Now the whole song data has been analyzed. Read the resulting bpm.\r\n    bpmValue = bpm.getBpm();\r\n    fprintf(stderr, \"Done!\\n\");\r\n\r\n    \/\/ rewind the file after bpm detection\r\n    inFile->rewind();\r\n\r\n    if (bpmValue > 0)\r\n    {\r\n        fprintf(stderr, \"Detected BPM rate %.1f\\n\\n\", bpmValue);\r\n    }\r\n    else\r\n    {\r\n        fprintf(stderr, \"Couldn't detect BPM rate.\\n\\n\");\r\n        return;\r\n    }\r\n\r\n    if (params->goalBPM > 0)\r\n    {\r\n        \/\/ adjust tempo to given bpm\r\n        params->tempoDelta = (params->goalBPM \/ bpmValue - 1.0f) * 100.0f;\r\n        fprintf(stderr, \"The file will be converted to %.1f BPM\\n\\n\", params->goalBPM);\r\n    }\r\n}\r\n\r\n\r\n\r\nint main(const int nParams, const char * const paramStr[])\r\n{\r\n    WavInFile *inFile;\r\n    WavOutFile *outFile;\r\n    RunParameters *params;\r\n    SoundTouch soundTouch;\r\n\r\n    fprintf(stderr, _helloText, SoundTouch::getVersionString());\r\n\r\n    try \r\n    {\r\n        \/\/ Parse command line parameters\r\n        params = new RunParameters(nParams, paramStr);\r\n\r\n        \/\/ Open input & output files\r\n        openFiles(&inFile, &outFile, params);\r\n\r\n        if (params->detectBPM == true)\r\n        {\r\n            \/\/ detect sound BPM (and adjust processing parameters\r\n            \/\/  accordingly if necessary)\r\n            detectBPM(inFile, params);\r\n        }\r\n\r\n        \/\/ Setup the 'SoundTouch' object for processing the sound\r\n        setup(&soundTouch, inFile, params);\r\n\r\n        \/\/ clock_t cs = clock();    \/\/ for benchmarking processing duration\r\n        \/\/ Process the sound\r\n        process(&soundTouch, inFile, outFile);\r\n        \/\/ clock_t ce = clock();    \/\/ for benchmarking processing duration\r\n        \/\/ printf(\"duration: %lf\\n\", (double)(ce-cs)\/CLOCKS_PER_SEC);\r\n\r\n        \/\/ Close WAV file handles & dispose of the objects\r\n        delete inFile;\r\n        delete outFile;\r\n        delete params;\r\n\r\n        fprintf(stderr, \"Done!\\n\");\r\n    } \r\n    catch (const runtime_error &e) \r\n    {\r\n        \/\/ An exception occurred during processing, display an error message\r\n        fprintf(stderr, \"%s\\n\", e.what());\r\n        return -1;\r\n    }\r\n\r\n    return 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n    \\file console.cpp\n    \\brief Console management implementation\n    \\author Ivan Shynkarenka\n    \\date 29.07.2015\n    \\copyright MIT License\n*\/\n\n#include \"benchmark\/console.h\"\n\n#include <cstdio>\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <windows.h>\n#endif\n\nnamespace CppBenchmark {\n\nstd::ostream& operator<<(std::ostream& stream, Color color)\n{\n    Console::SetColor(color);\n    return stream;\n}\n\nstd::ostream& operator<<(std::ostream& stream, std::pair<Color, Color> colors)\n{\n    Console::SetColor(colors.first, colors.second);\n    return stream;\n}\n\nvoid Console::SetColor(Color color, Color background)\n{\n#if defined(_WIN32) || defined(_WIN64)\n    HANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);\n    SetConsoleTextAttribute(hConsole, (((WORD)color) & 0x0F) + ((((WORD)background) & 0x0F) << 4));\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n    const char* colors[] =\n    {\n        \"\\033[22;30m\",  \/\/ Black color\n        \"\\033[22;34m\",  \/\/ Blue color\n        \"\\033[22;32m\",  \/\/ Green color\n        \"\\033[22;36m\",  \/\/ Cyan color\n        \"\\033[22;31m\",  \/\/ Red color\n        \"\\033[22;35m\",  \/\/ Magenta color\n        \"\\033[22;33m\",  \/\/ Brown color\n        \"\\033[22;37m\",  \/\/ Grey color\n        \"\\033[01;30m\",  \/\/ Dark grey color\n        \"\\033[01;34m\",  \/\/ Light blue color\n        \"\\033[01;32m\",  \/\/ Light green color\n        \"\\033[01;36m\",  \/\/ Light cyan color\n        \"\\033[01;31m\",  \/\/ Light red color\n        \"\\033[01;35m\",  \/\/ Light magenta color\n        \"\\033[01;33m\",  \/\/ Yellow color\n        \"\\033[01;37m\"   \/\/ White color\n    };\n    const char* backgrounds[] =\n    {\n        \"\\033[00000m\",  \/\/ Black color\n        \"\\033[02;44m\",  \/\/ Blue color\n        \"\\033[02;42m\",  \/\/ Green color\n        \"\\033[02;46m\",  \/\/ Cyan color\n        \"\\033[02;41m\",  \/\/ Red color\n        \"\\033[02;45m\",  \/\/ Magenta color\n        \"\\033[02;43m\",  \/\/ Brown color\n        \"\\033[02;47m\",  \/\/ Grey color\n        \"\\033[01;40m\",  \/\/ Dark grey color\n        \"\\033[01;44m\",  \/\/ Light blue color\n        \"\\033[01;42m\",  \/\/ Light green color\n        \"\\033[01;46m\",  \/\/ Light cyan color\n        \"\\033[01;41m\",  \/\/ Light red color\n        \"\\033[01;45m\",  \/\/ Light magenta color\n        \"\\033[01;43m\",  \/\/ Yellow color\n        \"\\033[01;47m\"   \/\/ White color\n    };\n    std::fwrite(backgrounds[(int)background - (int)Color::BLACK], 1, 8, stdout);\n    std::fwrite(colors[(int)color - (int)Color::BLACK], 1, 8, stdout);\n#endif\n}\n\n} \/\/ namespace CppBenchmark\n<commit_msg>Bugfixing<commit_after>\/*!\n    \\file console.cpp\n    \\brief Console management implementation\n    \\author Ivan Shynkarenka\n    \\date 29.07.2015\n    \\copyright MIT License\n*\/\n\n#include \"benchmark\/console.h\"\n\n#include <cstdio>\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <windows.h>\n#endif\n\nnamespace CppBenchmark {\n\nstd::ostream& operator<<(std::ostream& stream, Color color)\n{\n    Console::SetColor(color);\n    return stream;\n}\n\nstd::ostream& operator<<(std::ostream& stream, std::pair<Color, Color> colors)\n{\n    Console::SetColor(colors.first, colors.second);\n    return stream;\n}\n\nvoid Console::SetColor(Color color, Color background)\n{\n#if defined(_WIN32) || defined(_WIN64)\n    HANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);\n    SetConsoleTextAttribute(hConsole, (((WORD)color) & 0x0F) + ((((WORD)background) & 0x0F) << 4));\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n    const char* colors[] =\n    {\n        \"\\033[22;30m\",  \/\/ Black color\n        \"\\033[22;34m\",  \/\/ Blue color\n        \"\\033[22;32m\",  \/\/ Green color\n        \"\\033[22;36m\",  \/\/ Cyan color\n        \"\\033[22;31m\",  \/\/ Red color\n        \"\\033[22;35m\",  \/\/ Magenta color\n        \"\\033[22;33m\",  \/\/ Brown color\n        \"\\033[22;37m\",  \/\/ Grey color\n        \"\\033[01;30m\",  \/\/ Dark grey color\n        \"\\033[01;34m\",  \/\/ Light blue color\n        \"\\033[01;32m\",  \/\/ Light green color\n        \"\\033[01;36m\",  \/\/ Light cyan color\n        \"\\033[01;31m\",  \/\/ Light red color\n        \"\\033[01;35m\",  \/\/ Light magenta color\n        \"\\033[01;33m\",  \/\/ Yellow color\n        \"\\033[01;37m\"   \/\/ White color\n    };\n    const char* backgrounds[] =\n    {\n        \"\\033[00000m\",  \/\/ Black color\n        \"\\033[02;44m\",  \/\/ Blue color\n        \"\\033[02;42m\",  \/\/ Green color\n        \"\\033[02;46m\",  \/\/ Cyan color\n        \"\\033[02;41m\",  \/\/ Red color\n        \"\\033[02;45m\",  \/\/ Magenta color\n        \"\\033[02;43m\",  \/\/ Brown color\n        \"\\033[02;47m\",  \/\/ Grey color\n        \"\\033[00;40m\",  \/\/ Dark grey color\n        \"\\033[00;44m\",  \/\/ Light blue color\n        \"\\033[00;42m\",  \/\/ Light green color\n        \"\\033[00;46m\",  \/\/ Light cyan color\n        \"\\033[00;41m\",  \/\/ Light red color\n        \"\\033[00;45m\",  \/\/ Light magenta color\n        \"\\033[00;43m\",  \/\/ Yellow color\n        \"\\033[00;47m\"   \/\/ White color\n    };\n    std::fwrite(backgrounds[(int)background - (int)Color::BLACK], 1, 8, stdout);\n    std::fwrite(colors[(int)color - (int)Color::BLACK], 1, 8, stdout);\n#endif\n}\n\n} \/\/ namespace CppBenchmark\n<|endoftext|>"}
{"text":"<commit_before>\n#pragma once\n#include <cxx-image\/index.hxx>\n\n#include <limits>\n\nconst double MAX_DOUBLE = std::numeric_limits<double>::max();\n\nnamespace slic\n{\n\n};\n\n<commit_msg>Update index to match documentation<commit_after>\n#pragma once\n#include <cxx-image\/index.hxx>\n\n#include <limits>\n\nnamespace slic\n{\n    const double MAX_DOUBLE = std::numeric_limits<double>::max();\n\n    class Point\n    {\n    public:\n        unsigned int label;\n\n        Point ( unsigned int _label = 0 )\n            : label(_label)\n        { }\n\n        virtual ~Point ( ) { }\n    };\n\n};\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string.h>\n\n#include \"Rtypes.h\"\n#include \"AliHLTTPCCAClusterData.h\"\n#include \"AliHLTTPCCAMCInfo.h\"\n#include \"AliHLTTPCClusterMCData.h\"\n#include \"AliHLTTPCCAParam.h\"\n#include \"AliHLTTPCGMPhysicalTrackModel.h\"\n#include \"AliHLTTPCGMPropagator.h\"\n#include \"AliHLTTPCCAStandaloneFramework.h\"\n#include \"AliHLTTPCGMMerger.h\"\n \n#include \"..\/cmodules\/qconfig.h\"\n#include \"TRandom.h\"\n#include \"TMath.h\"\n#include \"TH1F.h\"\n#include \"TFile.h\"\n#include \"TCanvas.h\"\n#include \"TPad.h\"\n\n#include \"include.h\"\n\n#include <iostream>\n#include <iomanip>\n#include <limits>\n\nusing namespace std;\n\nstruct GenCluster\n{\n  int fSector;\n  int fRow; \n  int fMCID;\n  float fX;\n  float fY;\n  float fZ;\n  unsigned int fId;\n};\n\nconst double kTwoPi = TMath::TwoPi();\/\/2.*kPi;\nconst double kSliceDAngle = kTwoPi\/18.;\nconst double kSliceAngleOffset = kSliceDAngle\/2;\n\nint GetSlice( double GlobalPhi )\n{\n  double phi = GlobalPhi;\n  \/\/  std::cout<<\" GetSlice: phi = \"<<phi<<std::endl;\n\n  if( phi >= kTwoPi ) phi -= kTwoPi;\n  if( phi < 0 ) phi+= kTwoPi; \n  return (int) ( phi \/ kSliceDAngle );\n}\n\nint GetDSlice( double LocalPhi )\n{\n  return GetSlice( LocalPhi + kSliceAngleOffset );\n}\n\ndouble GetSliceAngle( int iSlice )\n{\n  return kSliceAngleOffset + iSlice*kSliceDAngle;\n}\n\nint RecalculateSlice( AliHLTTPCGMPhysicalTrackModel &t, int &iSlice )\n{\n  double phi = atan2( t.GetY(), t.GetX() );\n  \/\/  std::cout<<\" recalculate: phi = \"<<phi<<std::endl;\n  int dSlice = GetDSlice( phi );\n\n  if( dSlice == 0 ) return 0; \/\/ nothing to do\n\n  \/\/  std::cout<<\" dSlice = \"<<dSlice<<std::endl;\n  double dAlpha = dSlice*kSliceDAngle;\n  \/\/ rotate track on angle dAlpha\n\n  t.Rotate(dAlpha);\n  \n  iSlice+=dSlice;\n  if( iSlice>=18 ) iSlice-=18;\n  return 1;\n}\n\ndouble GetGaus( double sigma )\n{\n  double x = 0;\n  do{\n    x = gRandom->Gaus(0.,sigma);\n    if( fabs(x)<=3.5*sigma ) break;\n  } while(1);\n  return x;\n}\n\nstatic TH1F* hClusterError[3][2]={{0,0},{0,0},{0,0}};\n\nvoid InitEventGenerator()\n{\n  const char* rows[3] = {\"0-63\",\"128-159\",\"64-127\"};\n  for( int i=0; i<3; i++){\n    for( int j=0; j<2; j++){\n      char name[1024], title[1024];\n \n      sprintf(name, \"clError%s%d\", (j==0 ?\"Y\" :\"Z\"), i);\n\n      sprintf(title, \"Cluster %s Error for rows %s\",(j==0 ?\"Y\" :\"Z\"), rows[i]);\n\n      hClusterError[i][j] = new TH1F(name, title, 1000, 0., .7 );\n      hClusterError[i][j]->GetXaxis()->SetTitle(\"Cluster Error [cm]\");\n    }\n  }\n}\n\nvoid FinishEventGenerator()\n{\n  TFile* tout = new TFile(\"generator.root\", \"RECREATE\");\n  TCanvas *c = new TCanvas(\"ClusterErrors\",\"Cluste rErrors\",0,0,700,700.*2.\/3.);\n  c->Divide(3,2);\n  int ipad=1;\n  for( int j=0; j<2; j++){\n    for( int i=0; i<3; i++){  \n      c->cd(ipad++);\n      int k=i;\n      if( i==1 ) k=2;\n      if( i==2 ) k = 1;\n      if( tout ) hClusterError[k][j]->Write();\n      gPad->SetLogy();\n      hClusterError[k][j]->Draw();\n      \/\/delete hClusterError[i][j];\n      \/\/hClusterError[i][j]=0;\n    }\n  }\n  c->Print(\"plots\/clusterErrors.pdf\");\n  delete c;\n  if (tout){\n    tout->Close();\n    delete tout;\n  }\n}\n\nint GenerateEvent(const AliHLTTPCCAParam& sliceParam, char* filename)\n{\n  static int iEvent = -1;\n  iEvent++;\n  if( iEvent==0 ){\n    gRandom->SetSeed(configStandalone.seed);\n  }\n\n  std::ofstream out;\n  out.open(filename, std::ofstream::binary);\n  if (out.fail())\n    {\n      printf(\"Error opening file\\n\");\n      return(1);\n    }\n\n\n  int nTracks = configStandalone.configEG.numberOfTracks; \/\/Number of MC tracks, must be at least as large as the largest fMCID assigned above\n  cout<<\"NTracks \"<<nTracks<<endl;\n  std::vector<AliHLTTPCCAMCInfo> mcInfo(nTracks);\n  memset(mcInfo.data(), 0, nTracks * sizeof(mcInfo[0]));\n\n  \/\/double Bz = sliceParam.ConstBz();\n  \/\/std::cout<<\"Bz[kG] = \"<<sliceParam.BzkG()<<std::endl;\n\n  AliHLTTPCGMPropagator prop;\n  {\n    prop.SetToyMCEventsFlag( kTRUE );\n    AliHLTTPCCAStandaloneFramework &hlt = AliHLTTPCCAStandaloneFramework::Instance();\n    const AliHLTTPCGMMerger &merger = hlt.Merger();\n    prop.SetPolynomialField( merger.pField() );\t  \n  }\n  \n  \/\/  const double kCLight = 0.000299792458;\n  \/\/Bz*=kCLight;\n\n  std::vector<GenCluster> vClusters;\n  int clusterId = 0; \/\/Here we count up the cluster ids we fill (must be unique).\n  \/\/gRandom->SetSeed(0);\n  \/\/unsigned int seed = gRandom->GetSeed();\n  \n  for (int itr = 0; itr < nTracks; itr++){\n    \/\/ std::cout<<\"Track \"<<itr<<\":\"<<std::endl;\n    \/\/gRandom->SetSeed(seed);   \n\n    mcInfo[itr].fPID = -100; \/\/-100: Unknown \/ other, 0: Electron, 1, Muon, 2: Pion, 3: Kaon, 4: Proton      \n    mcInfo[itr].fCharge = 1;\n    mcInfo[itr].fPrim = 1; \/\/Primary particle\n    mcInfo[itr].fPrimDaughters = 0; \/\/Primary particle with daughters in the TPC\n    mcInfo[itr].fX = 0; \/\/Position of MC track at entry of TPC \/ first hit in the TPC\n    mcInfo[itr].fY = 0;\n    mcInfo[itr].fZ = 0;\n    mcInfo[itr].fPx = 0; \/\/Momentum of MC track at that position\n    mcInfo[itr].fPy = 0;\n    mcInfo[itr].fPz = 0;\n    \n    AliHLTTPCGMPhysicalTrackModel t;\n    double dphi = kTwoPi\/nTracks;\n    double phi = kSliceAngleOffset + dphi*itr;\n    double eta = gRandom->Uniform(-1.5,1.5);\n\n    double theta = 2*TMath::ATan(1.\/TMath::Exp(eta));\n    double lambda = theta-TMath::Pi()\/2;\n    \/\/double theta = gRandom->Uniform(-60,60)*TMath::Pi()\/180.;\n    double pt = .08*std::pow(10,gRandom->Uniform(0,2.2));\n    \n    double q = 1.;\n    int iSlice = GetSlice( phi );\n    phi = phi - GetSliceAngle( iSlice );\n\n    \/\/std::cout<<\"phi = \"<<phi<<std::endl;\n    double x0 = cos(phi);\n    double y0 = sin(phi);\n    double z0 = tan(lambda);\n    t.Set( x0, y0, z0, pt*x0, pt*y0, pt*z0, q);\n\n    if( RecalculateSlice(t,iSlice) !=0 ){\n      std::cout<<\"Initial slice wrong!!!\"<<std::endl;\n      \/\/exit(0);\n    }\n    \n    for( int iRow=0; iRow<sliceParam.NRows(); iRow++ ){\n      \/\/if( iRow>=50 ) break; \/\/SG!!!\n      float xRow = sliceParam.RowX( iRow );\t\n      \/\/ transport to row\n      int err = 0;\n      for( int itry=0; itry<1; itry++ ){ \n\tfloat B[3];\n\tprop.GetBxByBz( GetSliceAngle( iSlice ), t.GetX(), t.GetY(), t.GetZ(), B );\n\tfloat dLp=0;\n\terr = t.PropagateToXBxByBz( xRow, B[0], B[1], B[2], dLp );\n\tif( err ){\n\t  std::cout<<\"Can not propagate to x = \"<<xRow<<std::endl;\n\t  t.Print();\t  \n\t  break;\n\t}\n\tif( fabs(t.GetZ())>=250. ){ \n\t  std::cout<<\"Can not propagate to x = \"<<xRow<<\": Z outside the volume\"<<std::endl;\n\t  t.Print();\t  \n\t  err = -1;\n\t  break;\n\t}\n\t\/\/ rotate track coordinate system to current sector\n\tint isNewSlice = RecalculateSlice(t,iSlice);\n\tif( !isNewSlice ) break;\n\telse{\n\t  std::cout<<\"track \"<<itr<<\": new slice \"<<iSlice<<\" at row \"<<iRow<<std::endl;\n\t}\n      }\n      if( err ) break;\n      \/\/std::cout<<\" track \"<<itr<<\": Slice \"<<iSlice<<\" row \"<<iRow<<\" params :\"<<std::endl;\n      \/\/t.Print();\n      \/\/ track at row iRow, slice iSlice\n      if( iRow==0 ){ \/\/ store MC track at first row\n\t\/\/std::cout<<std::setprecision( 20 );\n\t\/\/std::cout<<\"track \"<<itr<<\": x \"<<t.X()<<\" y \"<<t.Y()<<\" z \"<<t.Z()<<std::endl;\n\tAliHLTTPCGMPhysicalTrackModel tg(t); \/\/ global coordinates\t\n\ttg.Rotate( - GetSliceAngle( iSlice ));\n\n\tmcInfo[itr].fPID = 2; \/\/ pion\n\tmcInfo[itr].fCharge = 3*q;\n\tmcInfo[itr].fX = tg.GetX(); \/\/Position of MC track at entry of TPC \/ first hit in the TPC\n\tmcInfo[itr].fY = tg.GetY();\n\tmcInfo[itr].fZ = tg.GetZ();\t\n\tmcInfo[itr].fPx = tg.GetPx(); \/\/Momentum of MC track at that position\n\tmcInfo[itr].fPy = tg.GetPy();\n\tmcInfo[itr].fPz = tg.GetPz();\n\t\/\/ std::cout<<\" mc Z = \"<<tg.GetZ()<<std::endl;\n      }\n      \n      \/\/ create cluster\n      GenCluster c;\n      float sigmaY = 0.3; \n      float sigmaZ = 0.5; \n      const int rowType = iRow < 64 ? 0 : iRow < 128 ? 2 : 1;\n      t.UpdateValues();\n      \/\/sliceParam.GetClusterErrors2v1( rowType, t.GetZ(), t.GetSinPhi(), t.GetCosPhi(), t.GetDzDs(), sigmaY, sigmaZ );  \n      sliceParam.GetClusterErrors2( rowType, t.GetZ(), t.GetSinPhi(), t.GetCosPhi(), t.GetDzDs(), sigmaY, sigmaZ );\n      sigmaY = sqrt(sigmaY);\n      sigmaZ = sqrt(sigmaZ);\n      hClusterError[rowType][0]->Fill(sigmaY);\n      hClusterError[rowType][1]->Fill(sigmaZ);\n      \/\/std::cout<<sigmaY<<\" \"<<sigmaY<<std::endl;\n      \/\/if( sigmaY > 0.5 ) sigmaY = 0.5;\n      \/\/if( sigmaZ > 0.5 ) sigmaZ = 0.5;\n      c.fSector = (t.GetZ()>=0.) ?iSlice :iSlice+18;\n      c.fRow = iRow; \n      c.fMCID = itr;\n      c.fX = t.GetX();\n      c.fY = t.GetY() + GetGaus(sigmaY);\n      c.fZ = t.GetZ() + GetGaus(sigmaZ);\n      c.fId = clusterId++;\n      vClusters.push_back(c);\n    } \/\/ iRow\n  } \/\/ itr\n  \n  std::vector<AliHLTTPCClusterMCLabel> labels; \n\n  for (int iSector = 0;iSector < 36;iSector++) \/\/HLT Sector numbering, sectors go from 0 to 35, all spanning all rows from 0 to 158.\n    {\n      int nNumberOfHits = 0;\n      for( unsigned int i=0; i<vClusters.size(); i++ ) if( vClusters[i].fSector==iSector ) nNumberOfHits++;\n      \/\/For every sector we first have to fill the number of hits in this sector to the file\n      out.write((char*) &nNumberOfHits, sizeof(nNumberOfHits));\n      \n      AliHLTTPCCAClusterData::Data* clusters = new AliHLTTPCCAClusterData::Data[nNumberOfHits]; \n      int icl=0;\n      for( unsigned int i=0; i<vClusters.size(); i++ ){\n\tGenCluster &c = vClusters[i];\n\tif( c.fSector==iSector ){\n\t  clusters[icl].fId = c.fId;\n\t  clusters[icl].fRow = c.fRow; \/\/We fill one hit per TPC row\n\t  clusters[icl].fX = c.fX;\n\t  clusters[icl].fY = c.fY;\n\t  clusters[icl].fZ = c.fZ;\n\t  clusters[icl].fAmp = 100; \/\/Arbitrary amplitude\n\t  icl++;\n\t  AliHLTTPCClusterMCLabel clusterLabel;\n\t  for (int j = 0;j < 3;j++){\n\t    clusterLabel.fClusterID[j].fMCID = -1;\n\t    clusterLabel.fClusterID[j].fWeight = 0;\n\t  }\n\t  clusterLabel.fClusterID[0].fMCID = c.fMCID;\n\t  clusterLabel.fClusterID[0].fWeight = 1;\n\t  labels.push_back( clusterLabel);\t  \n\t}\n      }      \n      out.write((char*) clusters, sizeof(clusters[0]) * nNumberOfHits);\n      delete clusters;\n    }\n  \n  \/\/Create vector with cluster MC labels, clusters are counter from 0 to clusterId in the order they have been written above. No separation in slices.\n\n  out.write((const char*) labels.data(), labels.size() * sizeof(labels[0]));\n  labels.clear();\n  \n  out.write((const char*) &nTracks, sizeof(nTracks));\n  out.write((const char*) mcInfo.data(), nTracks * sizeof(mcInfo[0]));\n  mcInfo.clear();\n  \n  out.close();\n  return(0);\n}\n<commit_msg>compilation fix<commit_after>#include <iostream>\n#include <fstream>\n#include <string.h>\n\n#include \"Rtypes.h\"\n#include \"AliHLTTPCCAClusterData.h\"\n#include \"AliHLTTPCCAMCInfo.h\"\n#include \"AliHLTTPCClusterMCData.h\"\n#include \"AliHLTTPCCAParam.h\"\n#include \"AliHLTTPCGMPhysicalTrackModel.h\"\n#include \"AliHLTTPCGMPropagator.h\"\n#include \"AliHLTTPCCAStandaloneFramework.h\"\n#include \"AliHLTTPCGMMerger.h\"\n \n#include \"..\/cmodules\/qconfig.h\"\n#include \"TRandom.h\"\n#include \"TMath.h\"\n#include \"TH1F.h\"\n#include \"TFile.h\"\n#include \"TCanvas.h\"\n#include \"TPad.h\"\n\n#include \"include.h\"\n\n#include <iostream>\n#include <iomanip>\n#include <limits>\n\nusing namespace std;\n\nstruct GenCluster\n{\n  int fSector;\n  int fRow; \n  int fMCID;\n  float fX;\n  float fY;\n  float fZ;\n  unsigned int fId;\n};\n\nconst double kTwoPi = TMath::TwoPi();\/\/2.*kPi;\nconst double kSliceDAngle = kTwoPi\/18.;\nconst double kSliceAngleOffset = kSliceDAngle\/2;\n\nint GetSlice( double GlobalPhi )\n{\n  double phi = GlobalPhi;\n  \/\/  std::cout<<\" GetSlice: phi = \"<<phi<<std::endl;\n\n  if( phi >= kTwoPi ) phi -= kTwoPi;\n  if( phi < 0 ) phi+= kTwoPi; \n  return (int) ( phi \/ kSliceDAngle );\n}\n\nint GetDSlice( double LocalPhi )\n{\n  return GetSlice( LocalPhi + kSliceAngleOffset );\n}\n\ndouble GetSliceAngle( int iSlice )\n{\n  return kSliceAngleOffset + iSlice*kSliceDAngle;\n}\n\nint RecalculateSlice( AliHLTTPCGMPhysicalTrackModel &t, int &iSlice )\n{\n  double phi = atan2( t.GetY(), t.GetX() );\n  \/\/  std::cout<<\" recalculate: phi = \"<<phi<<std::endl;\n  int dSlice = GetDSlice( phi );\n\n  if( dSlice == 0 ) return 0; \/\/ nothing to do\n\n  \/\/  std::cout<<\" dSlice = \"<<dSlice<<std::endl;\n  double dAlpha = dSlice*kSliceDAngle;\n  \/\/ rotate track on angle dAlpha\n\n  t.Rotate(dAlpha);\n  \n  iSlice+=dSlice;\n  if( iSlice>=18 ) iSlice-=18;\n  return 1;\n}\n\ndouble GetGaus( double sigma )\n{\n  double x = 0;\n  do{\n    x = gRandom->Gaus(0.,sigma);\n    if( fabs(x)<=3.5*sigma ) break;\n  } while(1);\n  return x;\n}\n\nstatic TH1F* hClusterError[3][2]={{0,0},{0,0},{0,0}};\n\nvoid InitEventGenerator()\n{\n  const char* rows[3] = {\"0-63\",\"128-159\",\"64-127\"};\n  for( int i=0; i<3; i++){\n    for( int j=0; j<2; j++){\n      char name[1024], title[1024];\n \n      sprintf(name, \"clError%s%d\", (j==0 ?\"Y\" :\"Z\"), i);\n\n      sprintf(title, \"Cluster %s Error for rows %s\",(j==0 ?\"Y\" :\"Z\"), rows[i]);\n\n      hClusterError[i][j] = new TH1F(name, title, 1000, 0., .7 );\n      hClusterError[i][j]->GetXaxis()->SetTitle(\"Cluster Error [cm]\");\n    }\n  }\n}\n\nvoid FinishEventGenerator()\n{\n  TFile* tout = new TFile(\"generator.root\", \"RECREATE\");\n  TCanvas *c = new TCanvas(\"ClusterErrors\",\"Cluste rErrors\",0,0,700,700.*2.\/3.);\n  c->Divide(3,2);\n  int ipad=1;\n  for( int j=0; j<2; j++){\n    for( int i=0; i<3; i++){  \n      c->cd(ipad++);\n      int k=i;\n      if( i==1 ) k=2;\n      if( i==2 ) k = 1;\n      if( tout ) hClusterError[k][j]->Write();\n      gPad->SetLogy();\n      hClusterError[k][j]->Draw();\n      \/\/delete hClusterError[i][j];\n      \/\/hClusterError[i][j]=0;\n    }\n  }\n  c->Print(\"plots\/clusterErrors.pdf\");\n  delete c;\n  if (tout){\n    tout->Close();\n    delete tout;\n  }\n}\n\nint GenerateEvent(const AliHLTTPCCAParam& sliceParam, char* filename)\n{\n  static int iEvent = -1;\n  iEvent++;\n  if( iEvent==0 ){\n    gRandom->SetSeed(configStandalone.seed);\n  }\n\n  std::ofstream out;\n  out.open(filename, std::ofstream::binary);\n  if (out.fail())\n    {\n      printf(\"Error opening file\\n\");\n      return(1);\n    }\n\n\n  int nTracks = configStandalone.configEG.numberOfTracks; \/\/Number of MC tracks, must be at least as large as the largest fMCID assigned above\n  cout<<\"NTracks \"<<nTracks<<endl;\n  std::vector<AliHLTTPCCAMCInfo> mcInfo(nTracks);\n  memset(mcInfo.data(), 0, nTracks * sizeof(mcInfo[0]));\n\n  \/\/double Bz = sliceParam.ConstBz();\n  \/\/std::cout<<\"Bz[kG] = \"<<sliceParam.BzkG()<<std::endl;\n\n  AliHLTTPCGMPropagator prop;\n  {\n    prop.SetToyMCEventsFlag( kTRUE );\n    AliHLTTPCCAStandaloneFramework &hlt = AliHLTTPCCAStandaloneFramework::Instance();\n    const AliHLTTPCGMMerger &merger = hlt.Merger();\n    prop.SetPolynomialField( merger.pField() );\t  \n  }\n  \n  \/\/  const double kCLight = 0.000299792458;\n  \/\/Bz*=kCLight;\n\n  std::vector<GenCluster> vClusters;\n  int clusterId = 0; \/\/Here we count up the cluster ids we fill (must be unique).\n  \/\/gRandom->SetSeed(0);\n  \/\/unsigned int seed = gRandom->GetSeed();\n  \n  for (int itr = 0; itr < nTracks; itr++){\n    \/\/ std::cout<<\"Track \"<<itr<<\":\"<<std::endl;\n    \/\/gRandom->SetSeed(seed);   \n\n    mcInfo[itr].fPID = -100; \/\/-100: Unknown \/ other, 0: Electron, 1, Muon, 2: Pion, 3: Kaon, 4: Proton      \n    mcInfo[itr].fCharge = 1;\n    mcInfo[itr].fPrim = 1; \/\/Primary particle\n    mcInfo[itr].fPrimDaughters = 0; \/\/Primary particle with daughters in the TPC\n    mcInfo[itr].fX = 0; \/\/Position of MC track at entry of TPC \/ first hit in the TPC\n    mcInfo[itr].fY = 0;\n    mcInfo[itr].fZ = 0;\n    mcInfo[itr].fPx = 0; \/\/Momentum of MC track at that position\n    mcInfo[itr].fPy = 0;\n    mcInfo[itr].fPz = 0;\n    \n    AliHLTTPCGMPhysicalTrackModel t;\n    double dphi = kTwoPi\/nTracks;\n    double phi = kSliceAngleOffset + dphi*itr;\n    double eta = gRandom->Uniform(-1.5,1.5);\n\n    double theta = 2*TMath::ATan(1.\/TMath::Exp(eta));\n    double lambda = theta-TMath::Pi()\/2;\n    \/\/double theta = gRandom->Uniform(-60,60)*TMath::Pi()\/180.;\n    double pt = .08*std::pow(10,gRandom->Uniform(0,2.2));\n    \n    double q = 1.;\n    int iSlice = GetSlice( phi );\n    phi = phi - GetSliceAngle( iSlice );\n\n    \/\/std::cout<<\"phi = \"<<phi<<std::endl;\n    double x0 = cos(phi);\n    double y0 = sin(phi);\n    double z0 = tan(lambda);\n    t.Set( x0, y0, z0, pt*x0, pt*y0, pt*z0, q);\n\n    if( RecalculateSlice(t,iSlice) !=0 ){\n      std::cout<<\"Initial slice wrong!!!\"<<std::endl;\n      \/\/exit(0);\n    }\n    \n    for( int iRow=0; iRow<sliceParam.NRows(); iRow++ ){\n      \/\/if( iRow>=50 ) break; \/\/SG!!!\n      float xRow = sliceParam.RowX( iRow );\t\n      \/\/ transport to row\n      int err = 0;\n      for( int itry=0; itry<1; itry++ ){ \n\tfloat B[3];\n\tprop.GetBxByBz( GetSliceAngle( iSlice ), t.GetX(), t.GetY(), t.GetZ(), B );\n\tfloat dLp=0;\n\terr = t.PropagateToXBxByBz( xRow, B[0], B[1], B[2], dLp );\n\tif( err ){\n\t  std::cout<<\"Can not propagate to x = \"<<xRow<<std::endl;\n\t  t.Print();\t  \n\t  break;\n\t}\n\tif( fabs(t.GetZ())>=250. ){ \n\t  std::cout<<\"Can not propagate to x = \"<<xRow<<\": Z outside the volume\"<<std::endl;\n\t  t.Print();\t  \n\t  err = -1;\n\t  break;\n\t}\n\t\/\/ rotate track coordinate system to current sector\n\tint isNewSlice = RecalculateSlice(t,iSlice);\n\tif( !isNewSlice ) break;\n\telse{\n\t  std::cout<<\"track \"<<itr<<\": new slice \"<<iSlice<<\" at row \"<<iRow<<std::endl;\n\t}\n      }\n      if( err ) break;\n      \/\/std::cout<<\" track \"<<itr<<\": Slice \"<<iSlice<<\" row \"<<iRow<<\" params :\"<<std::endl;\n      \/\/t.Print();\n      \/\/ track at row iRow, slice iSlice\n      if( iRow==0 ){ \/\/ store MC track at first row\n\t\/\/std::cout<<std::setprecision( 20 );\n\t\/\/std::cout<<\"track \"<<itr<<\": x \"<<t.X()<<\" y \"<<t.Y()<<\" z \"<<t.Z()<<std::endl;\n\tAliHLTTPCGMPhysicalTrackModel tg(t); \/\/ global coordinates\t\n\ttg.Rotate( - GetSliceAngle( iSlice ));\n\n\tmcInfo[itr].fPID = 2; \/\/ pion\n\tmcInfo[itr].fCharge = 3*q;\n\tmcInfo[itr].fX = tg.GetX(); \/\/Position of MC track at entry of TPC \/ first hit in the TPC\n\tmcInfo[itr].fY = tg.GetY();\n\tmcInfo[itr].fZ = tg.GetZ();\t\n\tmcInfo[itr].fPx = tg.GetPx(); \/\/Momentum of MC track at that position\n\tmcInfo[itr].fPy = tg.GetPy();\n\tmcInfo[itr].fPz = tg.GetPz();\n\t\/\/ std::cout<<\" mc Z = \"<<tg.GetZ()<<std::endl;\n      }\n      \n      \/\/ create cluster\n      GenCluster c;\n      float sigmaY = 0.3; \n      float sigmaZ = 0.5; \n      const int rowType = iRow < 64 ? 0 : iRow < 128 ? 2 : 1;\n      t.UpdateValues();\n      \/\/sliceParam.GetClusterErrors2v1( rowType, t.GetZ(), t.GetSinPhi(), t.GetCosPhi(), t.GetDzDs(), sigmaY, sigmaZ );  \n      sliceParam.GetClusterErrors( rowType, t.GetZ(), t.GetSinPhi(), t.GetCosPhi(), t.GetDzDs(), sigmaY, sigmaZ );\n      hClusterError[rowType][0]->Fill(sigmaY);\n      hClusterError[rowType][1]->Fill(sigmaZ);\n      \/\/std::cout<<sigmaY<<\" \"<<sigmaY<<std::endl;\n      \/\/if( sigmaY > 0.5 ) sigmaY = 0.5;\n      \/\/if( sigmaZ > 0.5 ) sigmaZ = 0.5;\n      c.fSector = (t.GetZ()>=0.) ?iSlice :iSlice+18;\n      c.fRow = iRow; \n      c.fMCID = itr;\n      c.fX = t.GetX();\n      c.fY = t.GetY() + GetGaus(sigmaY);\n      c.fZ = t.GetZ() + GetGaus(sigmaZ);\n      c.fId = clusterId++;\n      vClusters.push_back(c);\n    } \/\/ iRow\n  } \/\/ itr\n  \n  std::vector<AliHLTTPCClusterMCLabel> labels; \n\n  for (int iSector = 0;iSector < 36;iSector++) \/\/HLT Sector numbering, sectors go from 0 to 35, all spanning all rows from 0 to 158.\n    {\n      int nNumberOfHits = 0;\n      for( unsigned int i=0; i<vClusters.size(); i++ ) if( vClusters[i].fSector==iSector ) nNumberOfHits++;\n      \/\/For every sector we first have to fill the number of hits in this sector to the file\n      out.write((char*) &nNumberOfHits, sizeof(nNumberOfHits));\n      \n      AliHLTTPCCAClusterData::Data* clusters = new AliHLTTPCCAClusterData::Data[nNumberOfHits]; \n      int icl=0;\n      for( unsigned int i=0; i<vClusters.size(); i++ ){\n\tGenCluster &c = vClusters[i];\n\tif( c.fSector==iSector ){\n\t  clusters[icl].fId = c.fId;\n\t  clusters[icl].fRow = c.fRow; \/\/We fill one hit per TPC row\n\t  clusters[icl].fX = c.fX;\n\t  clusters[icl].fY = c.fY;\n\t  clusters[icl].fZ = c.fZ;\n\t  clusters[icl].fAmp = 100; \/\/Arbitrary amplitude\n\t  icl++;\n\t  AliHLTTPCClusterMCLabel clusterLabel;\n\t  for (int j = 0;j < 3;j++){\n\t    clusterLabel.fClusterID[j].fMCID = -1;\n\t    clusterLabel.fClusterID[j].fWeight = 0;\n\t  }\n\t  clusterLabel.fClusterID[0].fMCID = c.fMCID;\n\t  clusterLabel.fClusterID[0].fWeight = 1;\n\t  labels.push_back( clusterLabel);\t  \n\t}\n      }      \n      out.write((char*) clusters, sizeof(clusters[0]) * nNumberOfHits);\n      delete clusters;\n    }\n  \n  \/\/Create vector with cluster MC labels, clusters are counter from 0 to clusterId in the order they have been written above. No separation in slices.\n\n  out.write((const char*) labels.data(), labels.size() * sizeof(labels[0]));\n  labels.clear();\n  \n  out.write((const char*) &nTracks, sizeof(nTracks));\n  out.write((const char*) mcInfo.data(), nTracks * sizeof(mcInfo[0]));\n  mcInfo.clear();\n  \n  out.close();\n  return(0);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"OStreamServerLog.h\"\n\n#include <iostream>\n#include <iomanip>\n\nusing namespace HTTP::ServerLog;\n\nconst char *GetMethodName(HTTP::METHOD Method)\n{\n\tswitch (Method)\n\t{\n\tcase HTTP::METHOD_GET: return \"GET \";\n\tcase HTTP::METHOD_POST: return \"POST\";\n\tcase HTTP::METHOD_HEAD: return \"HEAD\";\n\tdefault: return \"-\";\n\t}\n}\n\nvoid PrintBandwidth(std::ostream &Target, double Value)\n{\n\tstd::streamsize PrevPrec=Target.precision(1);\n\tif (Value>1024*1024*2)\n\t\tTarget << std::fixed << Value\/(1024*1024) << \" MB\/s\";\n\telse if (Value>1024*2)\n\t\tTarget << std::fixed << Value\/1024 << \" kB\/s\";\n\telse\n\t\tTarget << std::fixed << Value << \" B\/s\";\n\tTarget.precision(PrevPrec);\n}\n\nvoid OStream::OnConnection(void *Connection, unsigned int SourceAddr, bool IsAllowed)\n{\n\tif (IsAllowed)\n\t{\n\t\tConnDataHolder &CurrHolder=ConnMap[Connection];\n\n\t\tchar AddrBuff[20];\n\t\tsprintf(AddrBuff,\"%u.%u.%u.%u\",\n\t\t\t(SourceAddr >> 24),\n\t\t\t(SourceAddr >> 16) & 0xFF,\n\t\t\t(SourceAddr >>  8) & 0xFF,\n\t\t\t(SourceAddr >>  0) & 0xFF);\n\n\t\tCurrHolder.SourceAddr=AddrBuff;\n\t\tCurrHolder.SourceAddr.append((4*3+3)-CurrHolder.SourceAddr.length(),' ');\n\t}\n}\n\nvoid OStream::OnConnectionFinished(void *Connection)\n{\n\tboost::unordered_map<void *,ConnDataHolder>::iterator FindI=ConnMap.find(Connection);\n\tif (FindI!=ConnMap.end())\n\t{\n\t\tif (FindI->second.IsWebSocket)\n\t\t{\n\t\t\tTargetS <<\n\t\t\t\tFindI->second.SourceAddr << \" WebSocketClose\" <<\n\t\t\t\tstd::endl;\n\t\t}\n\n\t\tConnMap.erase(FindI);\n\t}\n}\n\nvoid OStream::OnRequest(void *Connection, HTTP::METHOD Method, const std::string &Resource, const HTTP::QueryParams &Query, const std::vector<HTTP::Header> &HeaderA,\n\tunsigned long long ContentLength, const unsigned char *ContentBuff, const unsigned char *ContentBuffEnd,\n\tunsigned int ResponseCode, unsigned long long ResponseLength,\n\tdouble ReqTime, double RespTime,\n\tvoid *UpgradeConn)\n{\n\tboost::unordered_map<void *,ConnDataHolder>::iterator FindI=ConnMap.find(Connection);\n\n\tif (FindI!=ConnMap.end())\n\t{\n\t\tTargetS <<\n\t\t\tFindI->second.SourceAddr << \" \" <<\n\t\t\tGetMethodName(Method) << \" \" <<\n\t\t\tResource << \" (\" << ContentLength << \"; \";\n\t\tPrintBandwidth(TargetS,ContentLength\/ReqTime);\n\t\tTargetS << \"): \"\n\t\t\t<< ResponseCode << \" (\" << ResponseLength << \"; \";\n\t\tPrintBandwidth(TargetS,ResponseLength\/RespTime);\n\t\tTargetS << \")\" <<\n\t\t\tstd::endl;\n\n\t\tif ((UpgradeConn) && (FindI->second.IsWebSocket))\n\t\t{\n\t\t\tConnMap[UpgradeConn]=FindI->second;\n\t\t\tConnMap.erase(FindI);\n\t\t}\n\t}\n}\n\nvoid OStream::OnWebSocket(void *Connection, const std::string &Resource, bool IsSuccess, const char *Origin, const char *SubProtocol)\n{\n\tif (IsSuccess)\n\t{\n\t\tConnDataHolder &CurrHolder=ConnMap[Connection];\n\n\t\tTargetS <<\n\t\t\tCurrHolder.SourceAddr << \" WebSocket \" <<\n\t\t\t(Origin ? Origin : \"\") << \": \" <<\n\t\t\t(SubProtocol ? SubProtocol : \"-\") <<\n\t\t\tstd::endl;\n\n\t\tCurrHolder.IsWebSocket=true;\n\t}\n}\n<commit_msg>OStreamServerLog: refactor<commit_after>#include \"OStreamServerLog.h\"\n\n#include <iostream>\n#include <iomanip>\n\nusing namespace HTTP::ServerLog;\n\nconst char *GetMethodName(HTTP::METHOD Method)\n{\n\tswitch (Method)\n\t{\n\tcase HTTP::METHOD_GET: return \"GET \";\n\tcase HTTP::METHOD_POST: return \"POST\";\n\tcase HTTP::METHOD_HEAD: return \"HEAD\";\n\tdefault: return \"-\";\n\t}\n}\n\nvoid PrintTransferSpeed(std::ostream &Target, double Value)\n{\n\tstd::streamsize PrevPrec=Target.precision(1);\n\tif (Value>1024*1024*2)\n\t\tTarget << std::fixed << Value\/(1024*1024) << \" MB\/s\";\n\telse if (Value>1024*2)\n\t\tTarget << std::fixed << Value\/1024 << \" kB\/s\";\n\telse\n\t\tTarget << std::fixed << Value << \" B\/s\";\n\tTarget.precision(PrevPrec);\n}\n\nvoid OStream::OnConnection(void *Connection, unsigned int SourceAddr, bool IsAllowed)\n{\n\tif (IsAllowed)\n\t{\n\t\tConnDataHolder &CurrHolder=ConnMap[Connection];\n\n\t\tchar AddrBuff[20];\n\t\tsprintf(AddrBuff,\"%u.%u.%u.%u\",\n\t\t\t(SourceAddr >> 24),\n\t\t\t(SourceAddr >> 16) & 0xFF,\n\t\t\t(SourceAddr >>  8) & 0xFF,\n\t\t\t(SourceAddr >>  0) & 0xFF);\n\n\t\tCurrHolder.SourceAddr=AddrBuff;\n\t\tCurrHolder.SourceAddr.append((4*3+3)-CurrHolder.SourceAddr.length(),' ');\n\t}\n}\n\nvoid OStream::OnConnectionFinished(void *Connection)\n{\n\tboost::unordered_map<void *,ConnDataHolder>::iterator FindI=ConnMap.find(Connection);\n\tif (FindI!=ConnMap.end())\n\t{\n\t\tif (FindI->second.IsWebSocket)\n\t\t{\n\t\t\tTargetS <<\n\t\t\t\tFindI->second.SourceAddr << \" WebSocketClose\" <<\n\t\t\t\tstd::endl;\n\t\t}\n\n\t\tConnMap.erase(FindI);\n\t}\n}\n\nvoid OStream::OnRequest(void *Connection, HTTP::METHOD Method, const std::string &Resource, const HTTP::QueryParams &Query, const std::vector<HTTP::Header> &HeaderA,\n\tunsigned long long ContentLength, const unsigned char *ContentBuff, const unsigned char *ContentBuffEnd,\n\tunsigned int ResponseCode, unsigned long long ResponseLength,\n\tdouble ReqTime, double RespTime,\n\tvoid *UpgradeConn)\n{\n\tboost::unordered_map<void *,ConnDataHolder>::iterator FindI=ConnMap.find(Connection);\n\n\tif (FindI!=ConnMap.end())\n\t{\n\t\tTargetS <<\n\t\t\tFindI->second.SourceAddr << \" \" <<\n\t\t\tGetMethodName(Method) << \" \" <<\n\t\t\tResource << \" (\" << ContentLength << \"; \";\n\t\tPrintTransferSpeed(TargetS,ContentLength\/ReqTime);\n\t\tTargetS << \"): \"\n\t\t\t<< ResponseCode << \" (\" << ResponseLength << \"; \";\n\t\tPrintTransferSpeed(TargetS,ResponseLength\/RespTime);\n\t\tTargetS << \")\" <<\n\t\t\tstd::endl;\n\n\t\tif ((UpgradeConn) && (FindI->second.IsWebSocket))\n\t\t{\n\t\t\tConnMap[UpgradeConn]=FindI->second;\n\t\t\tConnMap.erase(FindI);\n\t\t}\n\t}\n}\n\nvoid OStream::OnWebSocket(void *Connection, const std::string &Resource, bool IsSuccess, const char *Origin, const char *SubProtocol)\n{\n\tif (IsSuccess)\n\t{\n\t\tConnDataHolder &CurrHolder=ConnMap[Connection];\n\n\t\tTargetS <<\n\t\t\tCurrHolder.SourceAddr << \" WebSocket \" <<\n\t\t\t(Origin ? Origin : \"\") << \": \" <<\n\t\t\t(SubProtocol ? SubProtocol : \"-\") <<\n\t\t\tstd::endl;\n\n\t\tCurrHolder.IsWebSocket=true;\n\t}\n}\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 \"otbWrapperChoiceParameter.h\"\n#include \"otbWrapperListViewParameter.h\"\n#include \"otbWrapperBoolParameter.h\"\n#include \"otbWrapperApplicationRegistry.h\"\n#include \"otbWrapperTypes.h\"\n#include \"otbWrapperApplication.h\"\n\n#include <vector>\n#include <string>\n#include <iostream>\n#include <cassert>\n#include <fstream>\n\nint main(int argc, char* argv[])\n{\n  if (argc < 3)\n    {\n      std::cerr << \"Usage : \" << argv[0] << \" name OTB_APPLICATION_PATH\" << std::endl;\n      return EXIT_FAILURE;\n    }\n    \n  using namespace otb::Wrapper;\n  \n  const std::string module(argv[1]);\n\n  \/* TestApplication is removed in CMakeLists.txt *\/\n#if 0\n  if (module == \"TestApplication\")\n    return EXIT_SUCCESS;\n#endif\n\n  ApplicationRegistry::AddApplicationPath(argv[2]);\n  Application::Pointer appli =  ApplicationRegistry::CreateApplicationFaster(module.c_str());\n  \n  assert(!appli.IsNull());\n  \n  appli->Init();\n\n  std::map<ParameterType, std::string> parameterTypeToString;\n\n  parameterTypeToString[ParameterType_Empty] = \"QgsProcessingParameterBoolean\";\n  parameterTypeToString[ParameterType_Bool] = \"QgsProcessingParameterBoolean\";\n  parameterTypeToString[ParameterType_Int] = \"QgsProcessingParameterNumber\";\n  parameterTypeToString[ParameterType_Float] = \"QgsProcessingParameterNumber\";\n  parameterTypeToString[ParameterType_RAM] = \"QgsProcessingParameterNumber\";\n  parameterTypeToString[ParameterType_Radius] = \"QgsProcessingParameterNumber\";\n  parameterTypeToString[ParameterType_Choice] = \"OTBParameterChoice\";\n  parameterTypeToString[ParameterType_String] = \"QgsProcessingParameterString\";\n  parameterTypeToString[ParameterType_InputImage] = \"QgsProcessingParameterRasterLayer\";\n  parameterTypeToString[ParameterType_InputFilename] = \"QgsProcessingParameterFile\";\n  parameterTypeToString[ParameterType_InputImageList] = \"QgsProcessingParameterMultipleLayers\";\n  parameterTypeToString[ParameterType_InputVectorData] = \"QgsProcessingParameterVectorLayer\";\n  parameterTypeToString[ParameterType_InputFilenameList] = \"QgsProcessingParameterMultipleLayers\";\n  parameterTypeToString[ParameterType_InputVectorDataList] = \"QgsProcessingParameterMultipleLayers\";\n  parameterTypeToString[ParameterType_OutputImage] = \"QgsProcessingParameterRasterDestination\";\n  parameterTypeToString[ParameterType_OutputVectorData] = \"QgsProcessingParameterVectorDestination\";\n  parameterTypeToString[ParameterType_OutputFilename] = \"QgsProcessingParameterFileDestination\";\n  parameterTypeToString[ParameterType_Directory] = \"QgsProcessingParameterFile\";\n  \/\/TODO\n  parameterTypeToString[ParameterType_StringList] = \"QgsProcessingParameterString\";\n  \n\n  const std::vector<std::string> appKeyList = appli->GetParametersKeys(true);\n  const unsigned int nbOfParam = appKeyList.size();\n\n  std::ofstream dFile;\n  dFile.open (module + \".txt\", std::ios::out);\n\n  std::string output_parameter_name;\n  bool hasRasterOutput = false;\n  for (unsigned int i = 0; i < nbOfParam; i++)\n    {\n      Parameter::Pointer param = appli->GetParameterByKey(appKeyList[i]);\n      if (param->GetMandatory())\n\t{\n\t  ParameterType type = appli->GetParameterType(appKeyList[i]);\n\t  if (type == ParameterType_OutputImage )\n\t    {\n\t      output_parameter_name = appKeyList[i];\n\t      hasRasterOutput = true;\n\t    }\n\t}\n    }\n\n  if(output_parameter_name.empty())\n    dFile << module << std::endl;\n  else\n    dFile << module << \"|\" <<  output_parameter_name << std::endl;\n  \n  dFile << appli->GetDescription() << std::endl;\n  const std::string group = appli->GetDocTags().size() > 0 ? appli->GetDocTags()[0] : \"UNCLASSIFIED\";\n  dFile << group << std::endl;\n  \n  for (unsigned int i = 0; i < nbOfParam; i++)\n    {\n      const std::string name = appKeyList[i];\n      \n      Parameter::Pointer param = appli->GetParameterByKey(name);\n      ParameterType type = appli->GetParameterType(name);\n      const std::string description = param->GetName();\n      const std::string qgis_type = parameterTypeToString[type];\n\n\n      \/\/ListView parameters types are added as N number of QgsParameterBoolean where N being\n      \/\/number of items in a listview.\n      \/\/Example case: RadiometricIndices application\n      \/\/For next update of plugin code ListView can use custom widget wrapper and behave\n      \/\/exactly like OTB.\n      if(type == ParameterType_ListView)\n\t{\n\t  ListViewParameter *lparam = dynamic_cast<ListViewParameter*>(param.GetPointer());\n\t  for( unsigned int c = 0; c < lparam->GetNbChoices(); ++c )\t    \n\t    dFile << \"QgsProcessingParameterBoolean|\"\n\t\t  << lparam->GetChoiceKey(c)  << \"|\"\n\t\t  << lparam->GetChoiceName(c)\n\t\t  << \"|False|True\" << std::endl;\n\t}\n\n      if (  type == ParameterType_Group  ||\n\t    type == ParameterType_OutputProcessXML  ||\n\t    type == ParameterType_InputProcessXML  ||\n\t    type == ParameterType_ListView ||\n\t    type == ParameterType_RAM\n\t    )\n\t{\n\t  \/\/ group parameter cannot have any value.\n\t  \/\/outxml and inxml parameters are not relevant for QGIS and is considered a bit noisy\n\t  \/\/ram is added by qgis-otb processing provider plugin as an advanced parameter for all apps\n\t  \/\/listview is a special case. We indeed add them to descriptor file but with different logic.\n\t  continue;\n\t}\n\n\n      assert(!qgis_type.empty());\n      if(qgis_type.empty())\n\t{\n\t  std::cerr << \"No mapping found for parameter '\" <<name <<\"' type=\" << type << std::endl;\n\t  return EXIT_FAILURE;\n\t}      \n\n\n      bool isDestination = false;\n\n      dFile << qgis_type << \"|\" << name << \"|\" << description;\n\n      std::string default_value = \"None\";\n      if (type == ParameterType_Int)\n\t{ \n\t  dFile << \"|QgsProcessingParameterNumber.Integer\";\n\t  default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n\t}\n      else if (type == ParameterType_Float)\n\t{\t\n\t  dFile << \"|QgsProcessingParameterNumber.Double\";\n\t  default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n\t}\n      else if (type == ParameterType_Radius)\n\t{\t\n\t  dFile << \"|QgsProcessingParameterNumber.Integer\";\n\t  default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n\t}\n      else if(type == ParameterType_InputFilename)\n\t{\n\t  dFile << \"|QgsProcessingParameterFile.File|txt\";\n\t}\n      else if(type == ParameterType_Directory)\n\t{\n\t  dFile << \"|QgsProcessingParameterFile.Folder|False\";\n\t}      \n      else if (type == ParameterType_InputImageList)\n\t{\n\t   dFile << \"|3\";\n\t}\n      else if (type == ParameterType_InputVectorDataList)\n\t{\n\t  dFile << \"|-1\";\n\t}\n      else if (type == ParameterType_InputVectorData)\n\t{\n\t  dFile << \"|-1\";\n\t}\n      else if(type == ParameterType_InputFilenameList)\n\t{\n\t  dFile << \"|4\";\n\t}\n      else if (type == ParameterType_InputImage)\n\t{\n\t  \/\/default is None and nothing to add to dFile\n\t}      \n      else if(type ==ParameterType_String)\n\t{\n\t  \/\/default is None and nothing to add to dFile\n\t}\n      else if(type ==ParameterType_StringList)\n\t{\n\t  \/\/default is None and nothing to add to dFile\n\t}      \n      else if(type == ParameterType_Bool)\n\t{\n\t  \/\/BoolParameter *bparam = dynamic_cast<BoolParameter*>(param.GetPointer());\n\t  \/\/default_value = bparam->GetValueAsString();\n\t  default_value =  appli->GetParameterAsString(name);\n\t}      \n      else if(type == ParameterType_Choice)\n\t{\n\t  std::vector<std::string>  key_list  = appli->GetChoiceKeys(name);\n\t  std::string values = \"\";\n\t  for( auto k : key_list)\n\t    values += k + \";\";\n\n\t  values.pop_back();\n\t  dFile << \"|\" << values ;\n\t  ChoiceParameter *cparam = dynamic_cast<ChoiceParameter*>(param.GetPointer());\n\t  default_value = std::to_string(cparam->GetValue());\t  \n\t}\n      else if(type == ParameterType_OutputVectorData ||\n\t      type == ParameterType_OutputImage ||\n\t      type == ParameterType_OutputFilename)\n\t{\n\t  \/\/no need for default_value, optional and extra fields in dFile\n\t  \/\/if parameter is a destination type. qgis_type|name|description is enough.\n\t  \/\/so we simply set isDestination to true and skip to end to append a new line.\n\t  isDestination =  true;\n\t}\n      else\n\t{\n     \t  std::cout << \"ERROR: default_value is empty for '\" << name << \"' type='\" << qgis_type << \"'\" << std::endl;\n\t  return EXIT_FAILURE;\t  \n\t}\n\n      if (!isDestination)\n\t{\n\t  \/\/const char*  optional = param->GetMandatory() ? \"False\" : \"True\";\n\t  std::string optional;\n\t  if (param->GetMandatory())\n\t    if (param->HasValue())\n\t      {\n\t\toptional = \"True\";\n\t      }\n\t    else{\n\t      optional = \"False\";\n\t    }\n\t  else {\n\t    optional = \"True\";\n\t  }\n\n\t  dFile << \"|\" << default_value << \"|\" << optional;\n\t}\n      dFile << std::endl;\n   }\n  \n  dFile.close();\n  \n  std::ofstream indexFile;\n  indexFile.open (\"algs.txt\", std::ios::out | std::ios::app );\n  indexFile << group << \"|\" << module << std::endl;\n  indexFile.close();\n  return EXIT_SUCCESS;\n}\n\n\n<commit_msg>ENH: add optional arg for output dir<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 \"otbWrapperChoiceParameter.h\"\n#include \"otbWrapperListViewParameter.h\"\n#include \"otbWrapperBoolParameter.h\"\n#include \"otbWrapperApplicationRegistry.h\"\n#include \"otbWrapperTypes.h\"\n#include \"otbWrapperApplication.h\"\n\n#include <vector>\n#include <string>\n#include <iostream>\n#include <cassert>\n#include <fstream>\n\nint main(int argc, char* argv[])\n{\n  if (argc < 3)\n    {\n      std::cerr << \"Usage : \" << argv[0] << \" name OTB_APPLICATION_PATH [out_dir]\" << std::endl;\n      return EXIT_FAILURE;\n    }\n    \n  using namespace otb::Wrapper;\n  \n  const std::string module(argv[1]);\n\n  \/* TestApplication is removed in CMakeLists.txt *\/\n#if 0\n  if (module == \"TestApplication\")\n    return EXIT_SUCCESS;\n#endif\n\n  ApplicationRegistry::AddApplicationPath(argv[2]);\n  Application::Pointer appli =  ApplicationRegistry::CreateApplicationFaster(module.c_str());\n  \n  assert(!appli.IsNull());\n  \n  appli->Init();\n\n  std::map<ParameterType, std::string> parameterTypeToString;\n\n  parameterTypeToString[ParameterType_Empty] = \"QgsProcessingParameterBoolean\";\n  parameterTypeToString[ParameterType_Bool] = \"QgsProcessingParameterBoolean\";\n  parameterTypeToString[ParameterType_Int] = \"QgsProcessingParameterNumber\";\n  parameterTypeToString[ParameterType_Float] = \"QgsProcessingParameterNumber\";\n  parameterTypeToString[ParameterType_RAM] = \"QgsProcessingParameterNumber\";\n  parameterTypeToString[ParameterType_Radius] = \"QgsProcessingParameterNumber\";\n  parameterTypeToString[ParameterType_Choice] = \"OTBParameterChoice\";\n  parameterTypeToString[ParameterType_String] = \"QgsProcessingParameterString\";\n  parameterTypeToString[ParameterType_InputImage] = \"QgsProcessingParameterRasterLayer\";\n  parameterTypeToString[ParameterType_InputFilename] = \"QgsProcessingParameterFile\";\n  parameterTypeToString[ParameterType_InputImageList] = \"QgsProcessingParameterMultipleLayers\";\n  parameterTypeToString[ParameterType_InputVectorData] = \"QgsProcessingParameterVectorLayer\";\n  parameterTypeToString[ParameterType_InputFilenameList] = \"QgsProcessingParameterMultipleLayers\";\n  parameterTypeToString[ParameterType_InputVectorDataList] = \"QgsProcessingParameterMultipleLayers\";\n  parameterTypeToString[ParameterType_OutputImage] = \"QgsProcessingParameterRasterDestination\";\n  parameterTypeToString[ParameterType_OutputVectorData] = \"QgsProcessingParameterVectorDestination\";\n  parameterTypeToString[ParameterType_OutputFilename] = \"QgsProcessingParameterFileDestination\";\n  parameterTypeToString[ParameterType_Directory] = \"QgsProcessingParameterFile\";\n  \/\/TODO\n  parameterTypeToString[ParameterType_StringList] = \"QgsProcessingParameterString\";\n  \n\n  const std::vector<std::string> appKeyList = appli->GetParametersKeys(true);\n  const unsigned int nbOfParam = appKeyList.size();\n\n  std::string output_file = module + \".txt\";\n  std::string  algs_txt = \"algs.txt\";\n  if (argc > 3) {\n   #if defined(WIN32)\n   std::string output_dir = std::string(argv[3]) + \"\\\\\";\n   #else\n   std::string output_dir = std::string(argv[3]) + \"\/\";\n   #endif\n    output_file = output_dir + module + \".txt\";\n    algs_txt = output_dir +  \"algs.txt\";\n    }\n\n  #if 0\n  std::cout << \"output_file: \" << output_file << std::endl;\n  std::cout << \"algs_txt: \" << algs_txt << std::endl;\n  #endif\n  std::ofstream dFile;\n  dFile.open (output_file, std::ios::out);\n  std::cerr << \"Writing \" << output_file << std::endl;\n\n  std::string output_parameter_name;\n  bool hasRasterOutput = false;\n  for (unsigned int i = 0; i < nbOfParam; i++)\n    {\n      Parameter::Pointer param = appli->GetParameterByKey(appKeyList[i]);\n      if (param->GetMandatory())\n\t{\n\t  ParameterType type = appli->GetParameterType(appKeyList[i]);\n\t  if (type == ParameterType_OutputImage )\n\t    {\n\t      output_parameter_name = appKeyList[i];\n\t      hasRasterOutput = true;\n\t    }\n\t}\n    }\n\n  if(output_parameter_name.empty())\n    dFile << module << std::endl;\n  else\n    dFile << module << \"|\" <<  output_parameter_name << std::endl;\n  \n  dFile << appli->GetDescription() << std::endl;\n  const std::string group = appli->GetDocTags().size() > 0 ? appli->GetDocTags()[0] : \"UNCLASSIFIED\";\n  dFile << group << std::endl;\n  \n  for (unsigned int i = 0; i < nbOfParam; i++)\n    {\n      const std::string name = appKeyList[i];\n      \n      Parameter::Pointer param = appli->GetParameterByKey(name);\n      ParameterType type = appli->GetParameterType(name);\n      const std::string description = param->GetName();\n      const std::string qgis_type = parameterTypeToString[type];\n\n\n      \/\/ListView parameters types are added as N number of QgsParameterBoolean where N being\n      \/\/number of items in a listview.\n      \/\/Example case: RadiometricIndices application\n      \/\/For next update of plugin code ListView can use custom widget wrapper and behave\n      \/\/exactly like OTB.\n      if(type == ParameterType_ListView)\n\t{\n\t  ListViewParameter *lparam = dynamic_cast<ListViewParameter*>(param.GetPointer());\n\t  for( unsigned int c = 0; c < lparam->GetNbChoices(); ++c )\t    \n\t    dFile << \"QgsProcessingParameterBoolean|\"\n\t\t  << lparam->GetChoiceKey(c)  << \"|\"\n\t\t  << lparam->GetChoiceName(c)\n\t\t  << \"|False|True\" << std::endl;\n\t}\n\n      if (  type == ParameterType_Group  ||\n\t    type == ParameterType_OutputProcessXML  ||\n\t    type == ParameterType_InputProcessXML  ||\n\t    type == ParameterType_ListView ||\n\t    type == ParameterType_RAM\n\t    )\n\t{\n\t  \/\/ group parameter cannot have any value.\n\t  \/\/outxml and inxml parameters are not relevant for QGIS and is considered a bit noisy\n\t  \/\/ram is added by qgis-otb processing provider plugin as an advanced parameter for all apps\n\t  \/\/listview is a special case. We indeed add them to descriptor file but with different logic.\n\t  continue;\n\t}\n\n\n      assert(!qgis_type.empty());\n      if(qgis_type.empty())\n\t{\n\t  std::cerr << \"No mapping found for parameter '\" <<name <<\"' type=\" << type << std::endl;\n\t  return EXIT_FAILURE;\n\t}      \n\n\n      bool isDestination = false;\n\n      dFile << qgis_type << \"|\" << name << \"|\" << description;\n\n      std::string default_value = \"None\";\n      if (type == ParameterType_Int)\n\t{ \n\t  dFile << \"|QgsProcessingParameterNumber.Integer\";\n\t  default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n\t}\n      else if (type == ParameterType_Float)\n\t{\t\n\t  dFile << \"|QgsProcessingParameterNumber.Double\";\n\t  default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n\t}\n      else if (type == ParameterType_Radius)\n\t{\t\n\t  dFile << \"|QgsProcessingParameterNumber.Integer\";\n\t  default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n\t}\n      else if(type == ParameterType_InputFilename)\n\t{\n\t  dFile << \"|QgsProcessingParameterFile.File|txt\";\n\t}\n      else if(type == ParameterType_Directory)\n\t{\n\t  dFile << \"|QgsProcessingParameterFile.Folder|False\";\n\t}      \n      else if (type == ParameterType_InputImageList)\n\t{\n\t   dFile << \"|3\";\n\t}\n      else if (type == ParameterType_InputVectorDataList)\n\t{\n\t  dFile << \"|-1\";\n\t}\n      else if (type == ParameterType_InputVectorData)\n\t{\n\t  dFile << \"|-1\";\n\t}\n      else if(type == ParameterType_InputFilenameList)\n\t{\n\t  dFile << \"|4\";\n\t}\n      else if (type == ParameterType_InputImage)\n\t{\n\t  \/\/default is None and nothing to add to dFile\n\t}      \n      else if(type ==ParameterType_String)\n\t{\n\t  \/\/default is None and nothing to add to dFile\n\t}\n      else if(type ==ParameterType_StringList)\n\t{\n\t  \/\/default is None and nothing to add to dFile\n\t}      \n      else if(type == ParameterType_Bool)\n\t{\n\t  \/\/BoolParameter *bparam = dynamic_cast<BoolParameter*>(param.GetPointer());\n\t  \/\/default_value = bparam->GetValueAsString();\n\t  default_value =  appli->GetParameterAsString(name);\n\t}      \n      else if(type == ParameterType_Choice)\n\t{\n\t  std::vector<std::string>  key_list  = appli->GetChoiceKeys(name);\n\t  std::string values = \"\";\n\t  for( auto k : key_list)\n\t    values += k + \";\";\n\n\t  values.pop_back();\n\t  dFile << \"|\" << values ;\n\t  ChoiceParameter *cparam = dynamic_cast<ChoiceParameter*>(param.GetPointer());\n\t  default_value = std::to_string(cparam->GetValue());\t  \n\t}\n      else if(type == ParameterType_OutputVectorData ||\n\t      type == ParameterType_OutputImage ||\n\t      type == ParameterType_OutputFilename)\n\t{\n\t  \/\/no need for default_value, optional and extra fields in dFile\n\t  \/\/if parameter is a destination type. qgis_type|name|description is enough.\n\t  \/\/so we simply set isDestination to true and skip to end to append a new line.\n\t  isDestination =  true;\n\t}\n      else\n\t{\n     \t  std::cout << \"ERROR: default_value is empty for '\" << name << \"' type='\" << qgis_type << \"'\" << std::endl;\n\t  return EXIT_FAILURE;\t  \n\t}\n\n      if (!isDestination)\n\t{\n\t  \/\/const char*  optional = param->GetMandatory() ? \"False\" : \"True\";\n\t  std::string optional;\n\t  if (param->GetMandatory())\n\t    if (param->HasValue())\n\t      {\n\t\toptional = \"True\";\n\t      }\n\t    else{\n\t      optional = \"False\";\n\t    }\n\t  else {\n\t    optional = \"True\";\n\t  }\n\n\t  dFile << \"|\" << default_value << \"|\" << optional;\n\t}\n      dFile << std::endl;\n   }\n  \n  dFile.close();\n\n\n  \n  std::ofstream indexFile;\n  indexFile.open (algs_txt, std::ios::out | std::ios::app );\n  indexFile << group << \"|\" << module << std::endl;\n  indexFile.close();\n  return EXIT_SUCCESS;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"BrowserObjectAPI.h\"\n#include \"variant_list.h\"\n#include \"DOM\/JSAPI_DOMDocument.h\"\n\n#include \"Mozilla\/MozillaUI.h\"\n#ifdef _WIN32\n#include \"Win\/WindowsUI.h\"\n#endif\n\n#include \"esteidAPI.h\"\n#include \"JSUtil.h\"\n\n#define REGISTER_METHOD(a)      JS_REGISTER_METHOD(esteidAPI, a)\n#define REGISTER_RO_PROPERTY(a) JS_REGISTER_RO_PROPERTY(esteidAPI, a)\n\n#define ESTEID_DEBUG printf\n\n\/\/ FIXME: Set error codes\n#define ESTEID_ERROR_FROMCARD(e) { \\\n    ESTEID_DEBUG(\"Card error: %s\\n\", e.what()); \\\n    throw FB::script_error(e.what()); }\n#define ESTEID_ERROR_CARD_ERROR(m) { \\\n    ESTEID_DEBUG(\"Card error: %s\\n\", m); \\\n    throw FB::script_error(m); }\n#define ESTEID_ERROR_INVALID_ARG { \\\n    throw FB::script_error(\"Invalid argument\"); }\n#define ESTEID_ERROR_USER_ABORT { \\\n    throw FB::script_error(\"User cancelled operation\"); }\n\nesteidAPI::esteidAPI(FB::BrowserHostWrapper *host) : \n    m_host(host), m_authCert(NULL), m_signCert(NULL),\n    m_service(EstEIDService::getInstance())\n{\n    ESTEID_DEBUG(\"esteidAPI::esteidAPI()\\n\");\n\n    REGISTER_METHOD(getVersion);\n    REGISTER_METHOD(sign);\n\n\/*  FIXME: Investigate if this is needed at all?\n    registerEvent(\"OnCardInserted\");\n    registerEvent(\"OnCardRemoved\");\n    registerEvent(\"OnReadersChanged\");\n*\/\n\n\/*  FIXME: Those will be catched by firebreath itself for\n           NPAPI plugins, but how about ActiveX?\n    REGISTER_METHOD(addEventListener);\n    REGISTER_METHOD(removeEventListener);\n*\/\n\n    REGISTER_RO_PROPERTY(authCert);\n    REGISTER_RO_PROPERTY(signCert);\n    REGISTER_RO_PROPERTY(lastName);\n    REGISTER_RO_PROPERTY(firstName);\n    REGISTER_RO_PROPERTY(middleName);\n    REGISTER_RO_PROPERTY(sex);\n    REGISTER_RO_PROPERTY(citizenship);\n    REGISTER_RO_PROPERTY(birthDate);\n    REGISTER_RO_PROPERTY(personalID);\n    REGISTER_RO_PROPERTY(documentID);\n    REGISTER_RO_PROPERTY(expiryDate);\n    REGISTER_RO_PROPERTY(placeOfBirth);\n    REGISTER_RO_PROPERTY(issuedDate);\n    REGISTER_RO_PROPERTY(residencePermit);\n    REGISTER_RO_PROPERTY(comment1);\n    REGISTER_RO_PROPERTY(comment2);\n    REGISTER_RO_PROPERTY(comment3);\n    REGISTER_RO_PROPERTY(comment4);\n\n    \/* Try to access Mozilla UI *\/\n    m_UI = GetMozillaUI();\n\n    \/* Use platform specific UI if browser specific is not found *\/\n    if(!m_UI) {\n#ifdef _WIN32\n        ESTEID_DEBUG(\"GetMozillaUI failed; trying to load WindowsUI\\n\");\n        m_UI = new WindowsUI();\n#endif\n#ifdef SUCKOSX\n        m_UI = new MacUI();\n#endif\n#ifdef UNIX_MUFF\n       m_UI = new GtkUI();\n#endif\n    }\n\n#if 0\n    \/* Die if UI initialization fails *\/\n    if(!m_UI)\n        throw FB::script_error(\"Unable to load plugin user interface\");\n#endif\n\n    m_service->AddObserver(this);\n}\n\nesteidAPI::~esteidAPI()\n{\n    ESTEID_DEBUG(\"esteidAPI::~esteidAPI()\\n\");\n\n    m_service->RemoveObserver(this);\n}\n\nPluginUI* esteidAPI::GetMozillaUI()\n{\n    if(!m_host) return NULL;\n\n    \/* Check if we are running under NPAPI *\/\n    FB::Npapi::NpapiBrowserHost *nphost = \\\n      dynamic_cast<FB::Npapi::NpapiBrowserHost*> (m_host.ptr());\n\n    if(!nphost) return NULL;\n\n    ESTEID_DEBUG(\"findUI: detected NPAPI\\n\");\n\n    \/* Check for Mozilla *\/\n    nsISupports *sm = NULL, *dw = NULL;\n    nphost->GetValue(NPNVserviceManager, &sm);\n    nphost->GetValue(NPNVDOMWindow, &dw);\n    if(sm && dw) {\n        try {\n            return new MozillaUI(sm, dw);\n        }\n        catch(std::runtime_error &e) {\n            ESTEID_DEBUG(\"%s\\n\", e.what());\n            return NULL;\n        }\n    }\n\n    return NULL;\n}\n\nvoid esteidAPI::onMessage(EstEIDService::msgType e, readerID i) {\n    \/\/const char *evtname;\n    std::string evtname;\n\n    switch(e) {\n        case EstEIDService::CARD_INSERTED:   evtname = \"OnCardInserted\";  break;\n        case EstEIDService::CARD_REMOVED:    evtname = \"OnCardRemoved\";   break;\n        case EstEIDService::READERS_CHANGED: evtname = \"OnReadersChanged\";break;\n        default: throw std::runtime_error(\"Invalid message type\"); break;\n    }\n    ESTEID_DEBUG(\"onMessage: %s %d\\n\", evtname.c_str(), i);\n\n    \/* FIXME: Prefixing every event name with an additional \"on\" is a bloody\n              hack. We either need to fix firebreath or our JS API spec. *\/\n    FireEvent(\"on\" + evtname, FB::variant_list_of(i));\n}\n\nvoid esteidAPI::UpdatePersonalData()\n{\n    RTERROR_TO_SCRIPT(m_service->readPersonalData(m_pdata));\n}\n\n\/\/ TODO: Optimize memory usage. Don't create new object if cert hasn't changed.\nFB::JSOutObject esteidAPI::get_authCert()\n{\n    RTERROR_TO_SCRIPT(\n        return new CertificateAPI(m_host, m_service->getAuthCert()));\n}\n\nFB::JSOutObject esteidAPI::get_signCert()\n{\n    RTERROR_TO_SCRIPT(\n        return new CertificateAPI(m_host, m_service->getSignCert()));\n}\n\nstd::string esteidAPI::getVersion()\n{\n    return \"0.x.y\";\n}\n\nstd::string esteidAPI::sign(std::string hash, std::string url) {\n    int tries;\n    bool retrying = false, pinpad;\n\n    \/\/ FIXME: This shouldn't happen. Remove this line after constructor is fixed\n    if(!m_UI) throw FB::script_error(\"No UI, can't prompt for PIN\");\n\n    \/* Extract subject line from Certificate *\/\n    std::string subject = \\\n        static_cast<CertificateAPI*>(get_signCert().ptr())->get_CN();\n\n    try {\n        pinpad = m_service->hasSecurePinEntry();\n    } catch(std::runtime_error &e) { \n        ESTEID_ERROR_FROMCARD(e);\n    }\n\n    \/\/ FIXME: Implement!\n    std::string pageUrl = \"\";\n\n    \/\/ FIXME: Hardcoded SHA1 support\n    if(hash.length() != 40)\n        ESTEID_ERROR_INVALID_ARG(\"Invalid hash\");\n\n    if(!url.length())\n        ESTEID_ERROR_INVALID_ARG(\"Partial document URL must be specified\");\n\n    while(true) {\n        std::string pin;\n\n        tries = getPin2RetryCount();\n\n        if(tries <= 0) {\n            \/\/ This card is locked!\n            m_UI->ShowPinBlockedMessage(2);\n            ESTEID_ERROR_CARD_ERROR(\"PIN2 locked\");\n        }\n\n        if(pinpad) {\n            \/\/ FIXME: Implement\n            throw FB::script_error(\"Unable to use PinPAD (yet)\");\n        } else {\n            pin = m_UI->PromptForSignPIN(subject, url, hash, pageUrl,\n                                         pinpad, retrying, tries);\n            if(!pin.length()) {\n                ESTEID_DEBUG(\"sign: got empty PIN from UI\\n\");\n                ESTEID_ERROR_USER_ABORT;\n            }\n\n            try {\n                return m_service->signSHA1(hash, EstEidCard::SIGN, pin);\n            } catch(AuthError &e) {\n                if(e.m_aborted) {\n                    ESTEID_DEBUG(\"sign: cancel pressed on PinPAD\\n\");\n                    ESTEID_ERROR_USER_ABORT;\n                }\n            } catch(std::runtime_error &e) {\n                ESTEID_ERROR_FROMCARD(e);\n            }\n        }\n        retrying = true;\n    }\n}\n\nint esteidAPI::getPin2RetryCount() {\n    try {\n        byte puk, pin1, pin2;\n        m_service->getRetryCounts(puk, pin1, pin2);\n        return pin2;\n    } catch(std::runtime_error &e) {\n        ESTEID_ERROR_FROMCARD(e);\n    }\n}\n\n#define ESTEID_WHITELIST_REQUIRED \n\n#define ESTEID_PD_GETTER_IMP(index, attr) \\\n    std::string esteidAPI::get_##attr() { \\\n            ESTEID_WHITELIST_REQUIRED; \\\n        UpdatePersonalData(); \\\n        if(m_pdata.size() <= index) \\\n            throw FB::script_error(\"PD index out of range\"); \\\n        return m_pdata[index]; \\\n    }\n\nESTEID_PD_GETTER_IMP(EstEidCard::SURNAME,         lastName)\nESTEID_PD_GETTER_IMP(EstEidCard::FIRSTNAME,       firstName);\nESTEID_PD_GETTER_IMP(EstEidCard::MIDDLENAME,      middleName);\nESTEID_PD_GETTER_IMP(EstEidCard::SEX,             sex);\nESTEID_PD_GETTER_IMP(EstEidCard::CITIZEN,         citizenship);\nESTEID_PD_GETTER_IMP(EstEidCard::BIRTHDATE,       birthDate);\nESTEID_PD_GETTER_IMP(EstEidCard::ID,              personalID);\nESTEID_PD_GETTER_IMP(EstEidCard::DOCUMENTID,      documentID);\nESTEID_PD_GETTER_IMP(EstEidCard::EXPIRY,          expiryDate);\nESTEID_PD_GETTER_IMP(EstEidCard::BIRTHPLACE,      placeOfBirth);\nESTEID_PD_GETTER_IMP(EstEidCard::ISSUEDATE,       issuedDate);\nESTEID_PD_GETTER_IMP(EstEidCard::RESIDENCEPERMIT, residencePermit);\nESTEID_PD_GETTER_IMP(EstEidCard::COMMENT1,        comment1);\nESTEID_PD_GETTER_IMP(EstEidCard::COMMENT2,        comment2);\nESTEID_PD_GETTER_IMP(EstEidCard::COMMENT3,        comment3);\nESTEID_PD_GETTER_IMP(EstEidCard::COMMENT4,        comment4);\n<commit_msg>plugins\/browser: Fixed getVersion() to show actual version number<commit_after>#include \"BrowserObjectAPI.h\"\n#include \"variant_list.h\"\n#include \"DOM\/JSAPI_DOMDocument.h\"\n#include \"config.h\"\n\n#include \"Mozilla\/MozillaUI.h\"\n#ifdef _WIN32\n#include \"Win\/WindowsUI.h\"\n#endif\n\n#include \"esteidAPI.h\"\n#include \"JSUtil.h\"\n\n#define REGISTER_METHOD(a)      JS_REGISTER_METHOD(esteidAPI, a)\n#define REGISTER_RO_PROPERTY(a) JS_REGISTER_RO_PROPERTY(esteidAPI, a)\n\n#define ESTEID_DEBUG printf\n\n\/\/ FIXME: Set error codes\n#define ESTEID_ERROR_FROMCARD(e) { \\\n    ESTEID_DEBUG(\"Card error: %s\\n\", e.what()); \\\n    throw FB::script_error(e.what()); }\n#define ESTEID_ERROR_CARD_ERROR(m) { \\\n    ESTEID_DEBUG(\"Card error: %s\\n\", m); \\\n    throw FB::script_error(m); }\n#define ESTEID_ERROR_INVALID_ARG { \\\n    throw FB::script_error(\"Invalid argument\"); }\n#define ESTEID_ERROR_USER_ABORT { \\\n    throw FB::script_error(\"User cancelled operation\"); }\n\nesteidAPI::esteidAPI(FB::BrowserHostWrapper *host) : \n    m_host(host), m_authCert(NULL), m_signCert(NULL),\n    m_service(EstEIDService::getInstance())\n{\n    ESTEID_DEBUG(\"esteidAPI::esteidAPI()\\n\");\n\n    REGISTER_METHOD(getVersion);\n    REGISTER_METHOD(sign);\n\n\/*  FIXME: Investigate if this is needed at all?\n    registerEvent(\"OnCardInserted\");\n    registerEvent(\"OnCardRemoved\");\n    registerEvent(\"OnReadersChanged\");\n*\/\n\n\/*  FIXME: Those will be catched by firebreath itself for\n           NPAPI plugins, but how about ActiveX?\n    REGISTER_METHOD(addEventListener);\n    REGISTER_METHOD(removeEventListener);\n*\/\n\n    REGISTER_RO_PROPERTY(authCert);\n    REGISTER_RO_PROPERTY(signCert);\n    REGISTER_RO_PROPERTY(lastName);\n    REGISTER_RO_PROPERTY(firstName);\n    REGISTER_RO_PROPERTY(middleName);\n    REGISTER_RO_PROPERTY(sex);\n    REGISTER_RO_PROPERTY(citizenship);\n    REGISTER_RO_PROPERTY(birthDate);\n    REGISTER_RO_PROPERTY(personalID);\n    REGISTER_RO_PROPERTY(documentID);\n    REGISTER_RO_PROPERTY(expiryDate);\n    REGISTER_RO_PROPERTY(placeOfBirth);\n    REGISTER_RO_PROPERTY(issuedDate);\n    REGISTER_RO_PROPERTY(residencePermit);\n    REGISTER_RO_PROPERTY(comment1);\n    REGISTER_RO_PROPERTY(comment2);\n    REGISTER_RO_PROPERTY(comment3);\n    REGISTER_RO_PROPERTY(comment4);\n\n    \/* Try to access Mozilla UI *\/\n    m_UI = GetMozillaUI();\n\n    \/* Use platform specific UI if browser specific is not found *\/\n    if(!m_UI) {\n#ifdef _WIN32\n        ESTEID_DEBUG(\"GetMozillaUI failed; trying to load WindowsUI\\n\");\n        m_UI = new WindowsUI();\n#endif\n#ifdef SUCKOSX\n        m_UI = new MacUI();\n#endif\n#ifdef UNIX_MUFF\n       m_UI = new GtkUI();\n#endif\n    }\n\n#if 0\n    \/* Die if UI initialization fails *\/\n    if(!m_UI)\n        throw FB::script_error(\"Unable to load plugin user interface\");\n#endif\n\n    m_service->AddObserver(this);\n}\n\nesteidAPI::~esteidAPI()\n{\n    ESTEID_DEBUG(\"esteidAPI::~esteidAPI()\\n\");\n\n    m_service->RemoveObserver(this);\n}\n\nPluginUI* esteidAPI::GetMozillaUI()\n{\n    if(!m_host) return NULL;\n\n    \/* Check if we are running under NPAPI *\/\n    FB::Npapi::NpapiBrowserHost *nphost = \\\n      dynamic_cast<FB::Npapi::NpapiBrowserHost*> (m_host.ptr());\n\n    if(!nphost) return NULL;\n\n    ESTEID_DEBUG(\"findUI: detected NPAPI\\n\");\n\n    \/* Check for Mozilla *\/\n    nsISupports *sm = NULL, *dw = NULL;\n    nphost->GetValue(NPNVserviceManager, &sm);\n    nphost->GetValue(NPNVDOMWindow, &dw);\n    if(sm && dw) {\n        try {\n            return new MozillaUI(sm, dw);\n        }\n        catch(std::runtime_error &e) {\n            ESTEID_DEBUG(\"%s\\n\", e.what());\n            return NULL;\n        }\n    }\n\n    return NULL;\n}\n\nvoid esteidAPI::onMessage(EstEIDService::msgType e, readerID i) {\n    \/\/const char *evtname;\n    std::string evtname;\n\n    switch(e) {\n        case EstEIDService::CARD_INSERTED:   evtname = \"OnCardInserted\";  break;\n        case EstEIDService::CARD_REMOVED:    evtname = \"OnCardRemoved\";   break;\n        case EstEIDService::READERS_CHANGED: evtname = \"OnReadersChanged\";break;\n        default: throw std::runtime_error(\"Invalid message type\"); break;\n    }\n    ESTEID_DEBUG(\"onMessage: %s %d\\n\", evtname.c_str(), i);\n\n    \/* FIXME: Prefixing every event name with an additional \"on\" is a bloody\n              hack. We either need to fix firebreath or our JS API spec. *\/\n    FireEvent(\"on\" + evtname, FB::variant_list_of(i));\n}\n\nvoid esteidAPI::UpdatePersonalData()\n{\n    RTERROR_TO_SCRIPT(m_service->readPersonalData(m_pdata));\n}\n\n\/\/ TODO: Optimize memory usage. Don't create new object if cert hasn't changed.\nFB::JSOutObject esteidAPI::get_authCert()\n{\n    RTERROR_TO_SCRIPT(\n        return new CertificateAPI(m_host, m_service->getAuthCert()));\n}\n\nFB::JSOutObject esteidAPI::get_signCert()\n{\n    RTERROR_TO_SCRIPT(\n        return new CertificateAPI(m_host, m_service->getSignCert()));\n}\n\nstd::string esteidAPI::getVersion()\n{\n    return FBSTRING_PLUGIN_VERSION;\n}\n\nstd::string esteidAPI::sign(std::string hash, std::string url) {\n    int tries;\n    bool retrying = false, pinpad;\n\n    \/\/ FIXME: This shouldn't happen. Remove this line after constructor is fixed\n    if(!m_UI) throw FB::script_error(\"No UI, can't prompt for PIN\");\n\n    \/* Extract subject line from Certificate *\/\n    std::string subject = \\\n        static_cast<CertificateAPI*>(get_signCert().ptr())->get_CN();\n\n    try {\n        pinpad = m_service->hasSecurePinEntry();\n    } catch(std::runtime_error &e) { \n        ESTEID_ERROR_FROMCARD(e);\n    }\n\n    \/\/ FIXME: Implement!\n    std::string pageUrl = \"\";\n\n    \/\/ FIXME: Hardcoded SHA1 support\n    if(hash.length() != 40)\n        ESTEID_ERROR_INVALID_ARG(\"Invalid hash\");\n\n    if(!url.length())\n        ESTEID_ERROR_INVALID_ARG(\"Partial document URL must be specified\");\n\n    while(true) {\n        std::string pin;\n\n        tries = getPin2RetryCount();\n\n        if(tries <= 0) {\n            \/\/ This card is locked!\n            m_UI->ShowPinBlockedMessage(2);\n            ESTEID_ERROR_CARD_ERROR(\"PIN2 locked\");\n        }\n\n        if(pinpad) {\n            \/\/ FIXME: Implement\n            throw FB::script_error(\"Unable to use PinPAD (yet)\");\n        } else {\n            pin = m_UI->PromptForSignPIN(subject, url, hash, pageUrl,\n                                         pinpad, retrying, tries);\n            if(!pin.length()) {\n                ESTEID_DEBUG(\"sign: got empty PIN from UI\\n\");\n                ESTEID_ERROR_USER_ABORT;\n            }\n\n            try {\n                return m_service->signSHA1(hash, EstEidCard::SIGN, pin);\n            } catch(AuthError &e) {\n                if(e.m_aborted) {\n                    ESTEID_DEBUG(\"sign: cancel pressed on PinPAD\\n\");\n                    ESTEID_ERROR_USER_ABORT;\n                }\n            } catch(std::runtime_error &e) {\n                ESTEID_ERROR_FROMCARD(e);\n            }\n        }\n        retrying = true;\n    }\n}\n\nint esteidAPI::getPin2RetryCount() {\n    try {\n        byte puk, pin1, pin2;\n        m_service->getRetryCounts(puk, pin1, pin2);\n        return pin2;\n    } catch(std::runtime_error &e) {\n        ESTEID_ERROR_FROMCARD(e);\n    }\n}\n\n#define ESTEID_WHITELIST_REQUIRED \n\n#define ESTEID_PD_GETTER_IMP(index, attr) \\\n    std::string esteidAPI::get_##attr() { \\\n            ESTEID_WHITELIST_REQUIRED; \\\n        UpdatePersonalData(); \\\n        if(m_pdata.size() <= index) \\\n            throw FB::script_error(\"PD index out of range\"); \\\n        return m_pdata[index]; \\\n    }\n\nESTEID_PD_GETTER_IMP(EstEidCard::SURNAME,         lastName)\nESTEID_PD_GETTER_IMP(EstEidCard::FIRSTNAME,       firstName);\nESTEID_PD_GETTER_IMP(EstEidCard::MIDDLENAME,      middleName);\nESTEID_PD_GETTER_IMP(EstEidCard::SEX,             sex);\nESTEID_PD_GETTER_IMP(EstEidCard::CITIZEN,         citizenship);\nESTEID_PD_GETTER_IMP(EstEidCard::BIRTHDATE,       birthDate);\nESTEID_PD_GETTER_IMP(EstEidCard::ID,              personalID);\nESTEID_PD_GETTER_IMP(EstEidCard::DOCUMENTID,      documentID);\nESTEID_PD_GETTER_IMP(EstEidCard::EXPIRY,          expiryDate);\nESTEID_PD_GETTER_IMP(EstEidCard::BIRTHPLACE,      placeOfBirth);\nESTEID_PD_GETTER_IMP(EstEidCard::ISSUEDATE,       issuedDate);\nESTEID_PD_GETTER_IMP(EstEidCard::RESIDENCEPERMIT, residencePermit);\nESTEID_PD_GETTER_IMP(EstEidCard::COMMENT1,        comment1);\nESTEID_PD_GETTER_IMP(EstEidCard::COMMENT2,        comment2);\nESTEID_PD_GETTER_IMP(EstEidCard::COMMENT3,        comment3);\nESTEID_PD_GETTER_IMP(EstEidCard::COMMENT4,        comment4);\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 gaussian_filter_kf_test.cpp\n * \\date Febuary 2015\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#include <gtest\/gtest.h>\n#include \"..\/typecast.hpp\"\n\n#include <Eigen\/Dense>\n\n#include \"gaussian_filter_test_suite.hpp\"\n#include <fl\/util\/meta.hpp>\n#include <fl\/filter\/gaussian\/gaussian_filter.hpp>\n\nusing namespace fl;\n\ntemplate <int StateDimension, int InputDimension, int ObsrvDimension>\nstruct UnscentedKalmanFilterTestConfiguration\n{\n    enum: signed int\n    {\n        StateDim = StateDimension,\n        InputDim = InputDimension,\n        ObsrvDim = ObsrvDimension\n    };\n\n    template <typename StateTransitionModel, typename ObservationModel>\n    struct FilterDefinition\n    {\n        \/\/typedef SigmaPointQuadrature<UnscentedTransform> Quadrature;\n        typedef UnscentedQuadrature Quadrature;\n\n        typedef GaussianFilter<\n                        StateTransitionModel,\n                        ObservationModel,\n                        Quadrature\n                > Type;\n    };\n\n    template <typename F, typename H>\n    static typename FilterDefinition<F, H>::Type create_filter(F&& f, H&& h)\n    {\n        return typename FilterDefinition<F, H>::Type(\n            f, h, UnscentedQuadrature());\n    }\n};\n\ntypedef ::testing::Types<\n            StaticTest<UnscentedKalmanFilterTestConfiguration<3, 1, 2>>\/*,\n            StaticTest<UnscentedKalmanFilterTestConfiguration<3, 3, 10>>,\n            StaticTest<UnscentedKalmanFilterTestConfiguration<10, 10, 20>>,\n\n            DynamicTest<UnscentedKalmanFilterTestConfiguration<3, 1, 2>>,\n            DynamicTest<UnscentedKalmanFilterTestConfiguration<3, 3, 10>>,\n            DynamicTest<UnscentedKalmanFilterTestConfiguration<10, 10, 20>>*\/\n        > TestTypes;\n\nINSTANTIATE_TYPED_TEST_CASE_P(UnscentedKalmanFilterTest,\n                              GaussianFilterTest,\n                              TestTypes);\n<commit_msg>Re-added all tests<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 gaussian_filter_kf_test.cpp\n * \\date Febuary 2015\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#include <gtest\/gtest.h>\n#include \"..\/typecast.hpp\"\n\n#include <Eigen\/Dense>\n\n#include \"gaussian_filter_test_suite.hpp\"\n#include <fl\/util\/meta.hpp>\n#include <fl\/filter\/gaussian\/gaussian_filter.hpp>\n\nusing namespace fl;\n\ntemplate <int StateDimension, int InputDimension, int ObsrvDimension>\nstruct UnscentedKalmanFilterTestConfiguration\n{\n    enum: signed int\n    {\n        StateDim = StateDimension,\n        InputDim = InputDimension,\n        ObsrvDim = ObsrvDimension\n    };\n\n    template <typename StateTransitionModel, typename ObservationModel>\n    struct FilterDefinition\n    {\n        \/\/typedef SigmaPointQuadrature<UnscentedTransform> Quadrature;\n        typedef UnscentedQuadrature Quadrature;\n\n        typedef GaussianFilter<\n                        StateTransitionModel,\n                        ObservationModel,\n                        Quadrature\n                > Type;\n    };\n\n    template <typename F, typename H>\n    static typename FilterDefinition<F, H>::Type create_filter(F&& f, H&& h)\n    {\n        return typename FilterDefinition<F, H>::Type(\n            f, h, UnscentedQuadrature());\n    }\n};\n\ntypedef ::testing::Types<\n            StaticTest<UnscentedKalmanFilterTestConfiguration<3, 1, 2>>,\n            StaticTest<UnscentedKalmanFilterTestConfiguration<3, 3, 10>>,\n            StaticTest<UnscentedKalmanFilterTestConfiguration<10, 10, 20>>,\n\n            DynamicTest<UnscentedKalmanFilterTestConfiguration<3, 1, 2>>,\n            DynamicTest<UnscentedKalmanFilterTestConfiguration<3, 3, 10>>,\n            DynamicTest<UnscentedKalmanFilterTestConfiguration<10, 10, 20>>\n        > TestTypes;\n\nINSTANTIATE_TYPED_TEST_CASE_P(UnscentedKalmanFilterTest,\n                              GaussianFilterTest,\n                              TestTypes);\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 ITK. See ITKCopyright.txt\n  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#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#ifdef __BORLANDC__\n#define ITK_LEAN_AND_MEAN\n#endif\n\n\/\/  Software Guide : BeginCommandLineArgs\n\/\/    INPUTS: {QB_Toulouse_Ortho_PAN.tif}, {QB_Toulouse_Ortho_XS.tif}\n\/\/    OUTPUTS: {QB_Toulouse_Ortho_PXS.tif}\n\/\/    OUTPUTS: {pretty_QB_Toulouse_Ortho_PXS.png}\n\/\/    OUTPUTS: {pretty_QB_Toulouse_Ortho_PAN.png}\n\/\/    OUTPUTS: {pretty_QB_Toulouse_Ortho_XS.png}\n\/\/  Software Guide : EndCommandLineArgs\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Here we are illustrating the use of the \n\/\/ \\doxygen{otb}{SimpleRcsPanSharpeningFusionImageFilter} for PAN-sharpening. \n\/\/ This example takes a PAN and the corresponding XS images as input. These\n\/\/ images are supposed to be registered.\n\/\/\n\/\/ The fusion operation is defined as\n\/\/\n\/\/ \\begin{equation}\n\/\/ \\frac{XS}{\\mathrm{Filtered}(PAN)} PAN\n\/\/ \\end{equation}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We start by including the required header and declaring the main function:\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbSimpleRcsPanSharpeningFusionImageFilter.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n#include \"otbPrintableImageFilter.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n\n\/\/ Software Guide : BeginCodeSnippet\nint main( int argc, char* argv[] )\n{\n\/\/ Software Guide : EndCodeSnippet\n  \n  if( argc < 4 )\n  {\n    std::cerr << \"Missing Parameters \" << std::endl;\n    std::cerr << \"Usage: \" << argv[0];\n    std::cerr << \" inputPanchromatiqueImage inputMultiSpectralImage outputImage outputImagePrinted panchroPrinted msPrinted\" << std::endl;\n    return 1;\n  }\n  \n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ We declare the different image type used here as well as the image reader.\n  \/\/ Note that, the reader for the PAN image is templated by an \n  \/\/ \\doxygen{otb}{Image} while the XS reader uses an \n  \/\/ \\doxygen{otb}{VectorImage}.\n  \/\/\n  \/\/ Software Guide : EndLatex\n  \n  \/\/ Software Guide : BeginCodeSnippet\n  typedef otb::Image<double, 2>     ImageType;\n  typedef otb::VectorImage<double, 2>     VectorImageType;\n  typedef otb::ImageFileReader<ImageType>  ReaderType;\n  typedef otb::ImageFileReader<VectorImageType>  ReaderVectorType;\n  typedef otb::VectorImage<unsigned int, 2>     VectorIntImageType;\n \n\t\t\t\t\t\n  ReaderVectorType::Pointer     \treaderXS=ReaderVectorType::New();\n  ReaderType::Pointer     \treaderPAN=ReaderType::New();\n  \/\/ Software Guide : EndCodeSnippet\n  \n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ We pass the filenames to the readers\n  \/\/\n  \/\/ Software Guide : EndLatex\n  \n  \/\/ Software Guide : BeginCodeSnippet\n  readerPAN->SetFileName(argv[1]);\n  readerXS->SetFileName(argv[2]);\n  \/\/ Software Guide : EndCodeSnippet\n  \n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ We declare the fusion filter an set its inputs using the readers:\n  \/\/\n  \/\/ Software Guide : EndLatex\n  \n  \/\/ Software Guide : BeginCodeSnippet\n  typedef otb::SimpleRcsPanSharpeningFusionImageFilter\n      <ImageType,VectorImageType,VectorIntImageType> FusionFilterType;\n  FusionFilterType::Pointer fusion = FusionFilterType::New();\n  fusion->SetPanInput(readerPAN->GetOutput());\n  fusion->SetXsInput(readerXS->GetOutput());\n  \/\/ Software Guide : EndCodeSnippet\n      \n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ And finally, we declare the writer and call its \\code{Update()} method to\n  \/\/ trigger the full pipeline execution.\n  \/\/\n  \/\/ Software Guide : EndLatex    \n  \n  \/\/ Software Guide : BeginCodeSnippet\n  typedef otb::StreamingImageFileWriter<VectorIntImageType>  WriterType;\n  WriterType::Pointer\t    \twriter=WriterType::New();\n  writer->SetFileName(argv[3]);\n  writer->SetInput(fusion->GetOutput());\n  writer->Update();\n  \/\/ Software Guide : EndCodeSnippet\n  \n  \n  typedef otb::PrintableImageFilter<VectorIntImageType> PrintableImageType;\n  PrintableImageType::Pointer printable = PrintableImageType::New();\n\n  \n  typedef otb::VectorImage<unsigned char, 2>     VectorCharImageType;\n  typedef otb::StreamingImageFileWriter<VectorCharImageType>  PNGWriterType;\n  PNGWriterType::Pointer pngwriter = PNGWriterType::New();\n  \n  printable->SetInput(fusion->GetOutput());\n  printable->SetChannel(3);\n  printable->SetChannel(2);\n  printable->SetChannel(1); \n  pngwriter->SetFileName(argv[4]);\n  pngwriter->SetInput(printable->GetOutput());\n  pngwriter->Update();\n  \n  typedef otb::PrintableImageFilter<VectorImageType> PrintableImageType2;\n  PrintableImageType2::Pointer printable2 = PrintableImageType2::New();\n  printable2->SetInput(readerXS->GetOutput());\n  printable2->SetChannel(3);\n  printable2->SetChannel(2);\n  printable2->SetChannel(1); \n  pngwriter->SetFileName(argv[6]);\n  pngwriter->SetInput(printable2->GetOutput());\n  pngwriter->Update();\n  \n  typedef otb::Image<unsigned char, 2>     CharImageType;\n  typedef itk::RescaleIntensityImageFilter <ImageType,CharImageType> RescalerType;\n  RescalerType::Pointer rescaler = RescalerType::New();\n  typedef otb::StreamingImageFileWriter<CharImageType>  PNGWriterType2;\n  PNGWriterType2::Pointer pngwriter2 = PNGWriterType2::New();\n  rescaler->SetInput(readerPAN->GetOutput());\n  pngwriter2->SetFileName(argv[5]);\n  pngwriter2->SetInput(rescaler->GetOutput());\n  pngwriter2->Update();\n  \n  \n\n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ Figure~\\ref{fig:PANSHARP_FILTER} shows the result of applying\n  \/\/ this PAN sharpening filter to a Quickbird image.\n  \/\/ \\begin{figure}\n  \/\/ \\center\n  \/\/ \\includegraphics[width=0.44\\textwidth]{pretty_QB_Toulouse_Ortho_PAN.eps}\n  \/\/ \\includegraphics[width=0.44\\textwidth]{pretty_QB_Toulouse_Ortho_XS.eps}\n  \/\/ \\includegraphics[width=0.44\\textwidth]{pretty_QB_Toulouse_Ortho_PXS.eps}\n  \/\/ \\itkcaption[Pan sharpening]{Result of applying\n  \/\/ the \\doxygen{otb}{SimpleRcsPanSharpeningFusionImageFilter} to \n  \/\/ orthorectified Quickbird\n  \/\/ image. From left to right : original PAN image, original XS image and the \n  \/\/ result of the PAN sharpening}  \n  \/\/ \\label{fig:PANSHARP_FILTER} \n  \/\/ \\end{figure}\n  \/\/\n  \/\/ Software Guide : EndLatex\n\n\n  return EXIT_SUCCESS;\n  \n}\n\n\n\n<commit_msg>Images avant le texte pour le SoftwareGuide<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 ITK. See ITKCopyright.txt\n  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#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#ifdef __BORLANDC__\n#define ITK_LEAN_AND_MEAN\n#endif\n\n\/\/  Software Guide : BeginCommandLineArgs\n\/\/    INPUTS: {QB_Toulouse_Ortho_PAN.tif}, {QB_Toulouse_Ortho_XS.tif}\n\/\/    OUTPUTS: {QB_Toulouse_Ortho_PXS.tif}\n\/\/    OUTPUTS: {pretty_QB_Toulouse_Ortho_PXS.png}\n\/\/    OUTPUTS: {pretty_QB_Toulouse_Ortho_PAN.png}\n\/\/    OUTPUTS: {pretty_QB_Toulouse_Ortho_XS.png}\n\/\/  Software Guide : EndCommandLineArgs\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Here we are illustrating the use of the \n\/\/ \\doxygen{otb}{SimpleRcsPanSharpeningFusionImageFilter} for PAN-sharpening. \n\/\/ This example takes a PAN and the corresponding XS images as input. These\n\/\/ images are supposed to be registered.\n\/\/\n\/\/ The fusion operation is defined as\n\/\/\n\/\/ \\begin{equation}\n\/\/ \\frac{XS}{\\mathrm{Filtered}(PAN)} PAN\n\/\/ \\end{equation}\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Figure~\\ref{fig:PANSHARP_FILTER} shows the result of applying\n\/\/ this PAN sharpening filter to a Quickbird image.\n\/\/ \\begin{figure}\n\/\/ \\center\n\/\/ \\includegraphics[width=0.44\\textwidth]{pretty_QB_Toulouse_Ortho_PAN.eps}\n\/\/ \\includegraphics[width=0.44\\textwidth]{pretty_QB_Toulouse_Ortho_XS.eps}\n\/\/ \\includegraphics[width=0.44\\textwidth]{pretty_QB_Toulouse_Ortho_PXS.eps}\n\/\/ \\itkcaption[Pan sharpening]{Result of applying\n\/\/ the \\doxygen{otb}{SimpleRcsPanSharpeningFusionImageFilter} to \n\/\/ orthorectified Quickbird\n\/\/ image. From left to right : original PAN image, original XS image and the \n\/\/ result of the PAN sharpening}  \n\/\/ \\label{fig:PANSHARP_FILTER} \n\/\/ \\end{figure}\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We start by including the required header and declaring the main function:\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbSimpleRcsPanSharpeningFusionImageFilter.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n#include \"otbPrintableImageFilter.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n\n\/\/ Software Guide : BeginCodeSnippet\nint main( int argc, char* argv[] )\n{\n\/\/ Software Guide : EndCodeSnippet\n  \n  if( argc < 4 )\n  {\n    std::cerr << \"Missing Parameters \" << std::endl;\n    std::cerr << \"Usage: \" << argv[0];\n    std::cerr << \" inputPanchromatiqueImage inputMultiSpectralImage outputImage outputImagePrinted panchroPrinted msPrinted\" << std::endl;\n    return 1;\n  }\n  \n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ We declare the different image type used here as well as the image reader.\n  \/\/ Note that, the reader for the PAN image is templated by an \n  \/\/ \\doxygen{otb}{Image} while the XS reader uses an \n  \/\/ \\doxygen{otb}{VectorImage}.\n  \/\/\n  \/\/ Software Guide : EndLatex\n  \n  \/\/ Software Guide : BeginCodeSnippet\n  typedef otb::Image<double, 2>     ImageType;\n  typedef otb::VectorImage<double, 2>     VectorImageType;\n  typedef otb::ImageFileReader<ImageType>  ReaderType;\n  typedef otb::ImageFileReader<VectorImageType>  ReaderVectorType;\n  typedef otb::VectorImage<unsigned int, 2>     VectorIntImageType;\n \n\t\t\t\t\t\n  ReaderVectorType::Pointer     \treaderXS=ReaderVectorType::New();\n  ReaderType::Pointer     \treaderPAN=ReaderType::New();\n  \/\/ Software Guide : EndCodeSnippet\n  \n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ We pass the filenames to the readers\n  \/\/\n  \/\/ Software Guide : EndLatex\n  \n  \/\/ Software Guide : BeginCodeSnippet\n  readerPAN->SetFileName(argv[1]);\n  readerXS->SetFileName(argv[2]);\n  \/\/ Software Guide : EndCodeSnippet\n  \n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ We declare the fusion filter an set its inputs using the readers:\n  \/\/\n  \/\/ Software Guide : EndLatex\n  \n  \/\/ Software Guide : BeginCodeSnippet\n  typedef otb::SimpleRcsPanSharpeningFusionImageFilter\n      <ImageType,VectorImageType,VectorIntImageType> FusionFilterType;\n  FusionFilterType::Pointer fusion = FusionFilterType::New();\n  fusion->SetPanInput(readerPAN->GetOutput());\n  fusion->SetXsInput(readerXS->GetOutput());\n  \/\/ Software Guide : EndCodeSnippet\n      \n  \/\/ Software Guide : BeginLatex\n  \/\/\n  \/\/ And finally, we declare the writer and call its \\code{Update()} method to\n  \/\/ trigger the full pipeline execution.\n  \/\/\n  \/\/ Software Guide : EndLatex    \n  \n  \/\/ Software Guide : BeginCodeSnippet\n  typedef otb::StreamingImageFileWriter<VectorIntImageType>  WriterType;\n  WriterType::Pointer\t    \twriter=WriterType::New();\n  writer->SetFileName(argv[3]);\n  writer->SetInput(fusion->GetOutput());\n  writer->Update();\n  \/\/ Software Guide : EndCodeSnippet\n  \n  \n  typedef otb::PrintableImageFilter<VectorIntImageType> PrintableImageType;\n  PrintableImageType::Pointer printable = PrintableImageType::New();\n\n  \n  typedef otb::VectorImage<unsigned char, 2>     VectorCharImageType;\n  typedef otb::StreamingImageFileWriter<VectorCharImageType>  PNGWriterType;\n  PNGWriterType::Pointer pngwriter = PNGWriterType::New();\n  \n  printable->SetInput(fusion->GetOutput());\n  printable->SetChannel(3);\n  printable->SetChannel(2);\n  printable->SetChannel(1); \n  pngwriter->SetFileName(argv[4]);\n  pngwriter->SetInput(printable->GetOutput());\n  pngwriter->Update();\n  \n  typedef otb::PrintableImageFilter<VectorImageType> PrintableImageType2;\n  PrintableImageType2::Pointer printable2 = PrintableImageType2::New();\n  printable2->SetInput(readerXS->GetOutput());\n  printable2->SetChannel(3);\n  printable2->SetChannel(2);\n  printable2->SetChannel(1); \n  pngwriter->SetFileName(argv[6]);\n  pngwriter->SetInput(printable2->GetOutput());\n  pngwriter->Update();\n  \n  typedef otb::Image<unsigned char, 2>     CharImageType;\n  typedef itk::RescaleIntensityImageFilter <ImageType,CharImageType> RescalerType;\n  RescalerType::Pointer rescaler = RescalerType::New();\n  typedef otb::StreamingImageFileWriter<CharImageType>  PNGWriterType2;\n  PNGWriterType2::Pointer pngwriter2 = PNGWriterType2::New();\n  rescaler->SetInput(readerPAN->GetOutput());\n  pngwriter2->SetFileName(argv[5]);\n  pngwriter2->SetInput(rescaler->GetOutput());\n  pngwriter2->Update();\n  \n\n  return EXIT_SUCCESS;\n  \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#include \"itkFirstOrderTextureFeaturesImageFilter.h\"\n#include \"itkFlatStructuringElement.h\"\n#include \"itkAdditiveGaussianNoiseImageFilter.h\"\n#include \"itkFilterWatcher.h\"\n\n#include \"gtest\/gtest.h\"\n\nnamespace\n{\n\ntemplate<typename T>\nvoid print_feature( const T &p, std::ostream  &out = std::cout )\n{\nout << \"mean: \" << p[0] << std::endl;\nout << \"minimum: \" << p[1] << std::endl;\nout << \"maximum: \" << p[2] << std::endl;\nout << \"variance: \" << p[3] << std::endl;\nout << \"standard deviation: \" << p[4] << std::endl;\nout << \"skewness: \" << p[5] << std::endl;\nout << \"kurtosis: \" << p[6] << std::endl;\nout << \"entropy: \" << p[7] << std::endl;\n}\n\n}\n\nTEST(TextTureFeatures, FirstOrder_Test1)\n{\n  const unsigned int ImageDimension = 2;\n  typedef itk::Image<float, ImageDimension >                    ImageType;\n  typedef itk::Image<itk::FixedArray<float,8>, ImageDimension > OImageType;\n  typedef itk::FlatStructuringElement< ImageDimension >         KernelType;\n\n\n  unsigned int r = 50u;\n  unsigned int d = r*2 + 1;\n  ImageType::SizeType imageSize = {{ d, d }};\n  ImageType::SpacingValueType imageSpacing[]  = { 1.0f, 1.0f };\n\n  ImageType::Pointer image = ImageType::New();\n\n  image->SetRegions( ImageType::RegionType(imageSize) );\n  image->SetSpacing( imageSpacing );\n  image->Allocate();\n  image->FillBuffer(0);\n\n\n  typedef itk::AdditiveGaussianNoiseImageFilter< ImageType > ImageNoiseType;\n  ImageNoiseType::Pointer noiseFilter = ImageNoiseType::New();\n  noiseFilter->SetSeed(124);\n  noiseFilter->SetMean(0.0);\n  noiseFilter->SetStandardDeviation(.1);\n  noiseFilter->SetInput(image);\n\n  typedef itk::FirstOrderTextureFeaturesImageFilter< ImageType, OImageType, KernelType > TextureFilterType;\n\n  KernelType::SizeType radius;\n  radius.Fill( r );\n  KernelType kernel = KernelType::Box( radius );\n  TextureFilterType::Pointer filter = TextureFilterType::New();\n  filter->SetKernel( kernel );\n  filter->SetInput( noiseFilter->GetOutput() );\n\n  FilterWatcher watcher(filter, \"filter\");\n\n\n  ImageType::SizeType requestSize = {{10,10}};\n  ImageType::IndexType requestIndex = {{45,45}};\n  ImageType::RegionType request(requestIndex, requestSize);\n  filter->GetOutput()->SetRequestedRegion( request );\n  filter->Update();\n\n  OImageType::ConstPointer output = filter->GetOutput();\n\n  {\n  ImageType::IndexType idx = {{r,r}};\n  const OImageType::PixelType &p = output->GetPixel(idx);\n\n  print_feature( p );\n\n  \/\/ The following is for a Gaussian sample with std dev of .1\n  \/\/ The expected value was analytically computed, while the\n  \/\/ tolerances were estimated based on 10,000 different sample set\n  \/\/ distributions in numpy.\n  EXPECT_NEAR( 0.0, p[0], 0.002) << \"mean\";\n  EXPECT_GT(-.3, p[1]) << \"min\";\n  EXPECT_LT(.3, p[2]) << \"max\";\n  EXPECT_NEAR(0.01, p[3], .001) << \"variance\";\n  EXPECT_NEAR(0.1, p[4], .01) << \"standard deviation\";\n  EXPECT_NEAR(0, p[5], .1) << \"skewness\";\n  EXPECT_NEAR(0, p[6], .2) << \"kurtosis\";\n  EXPECT_NEAR(13.3, p[7], .1) << \"entropy\";\n  }\n}\n\n\nTEST(TextTureFeatures, FirstOrder_Test2)\n{\n  const unsigned int ImageDimension = 2;\n  typedef itk::Image<float, ImageDimension >                    ImageType;\n  typedef itk::Image<itk::FixedArray<float,8>, ImageDimension > OImageType;\n  typedef itk::FlatStructuringElement< ImageDimension >         KernelType;\n\n\n  unsigned int r = 50u;\n  unsigned int d = r*2 + 1;\n  ImageType::SizeType imageSize = {{ d, d }};\n  ImageType::SpacingValueType imageSpacing[]  = { 1.0f, 1.0f };\n\n  ImageType::Pointer image = ImageType::New();\n\n  image->SetRegions( ImageType::RegionType(imageSize) );\n  image->SetSpacing( imageSpacing );\n  image->Allocate();\n  image->FillBuffer(0);\n\n\n  typedef itk::AdditiveGaussianNoiseImageFilter< ImageType > ImageNoiseType;\n  ImageNoiseType::Pointer noiseFilter = ImageNoiseType::New();\n  noiseFilter->SetSeed(124);\n  noiseFilter->SetMean(100.0);\n  noiseFilter->SetStandardDeviation(1);\n  noiseFilter->SetInput(image);\n\n  typedef itk::FirstOrderTextureFeaturesImageFilter< ImageType, OImageType, KernelType > TextureFilterType;\n\n  KernelType::SizeType radius;\n  radius.Fill( r );\n  KernelType kernel = KernelType::Box( radius );\n  TextureFilterType::Pointer filter = TextureFilterType::New();\n  filter->SetKernel( kernel );\n  filter->SetInput( noiseFilter->GetOutput() );\n\n  FilterWatcher watcher(filter, \"filter\");\n\n\n  ImageType::SizeType requestSize = {{10,10}};\n  ImageType::IndexType requestIndex = {{45,45}};\n  ImageType::RegionType request(requestIndex, requestSize);\n  filter->GetOutput()->SetRequestedRegion( request );\n  filter->Update();\n\n  OImageType::ConstPointer output = filter->GetOutput();\n\n  {\n  ImageType::IndexType idx = {{r,r}};\n  const OImageType::PixelType &p = output->GetPixel(idx);\n\n  print_feature( p );\n\n  \/\/ The following is for a Gaussian sample with std dev of .1\n  \/\/ The expected value was analytically computed, while the\n  \/\/ tolerances were estimated based on 10,000 different sample set\n  \/\/ distributions in numpy.\n  EXPECT_NEAR( 100, p[0], 0.02) << \"mean\";\n  EXPECT_GT(97, p[1]) << \"min\";\n  EXPECT_LT(103, p[2]) << \"max\";\n  EXPECT_NEAR(1, p[3], .1) << \"variance\";\n  EXPECT_NEAR(1, p[4], .1) << \"standard deviation\";\n  EXPECT_NEAR(0, p[5], .1) << \"skewness\";\n  EXPECT_NEAR(0, p[6], .2) << \"kurtosis\";\n  EXPECT_NEAR(13.3, p[7], .2) << \"entropy\";\n  }\n}\n<commit_msg>BUG: Fix typeo for Google Test test case name<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#include \"itkFirstOrderTextureFeaturesImageFilter.h\"\n#include \"itkFlatStructuringElement.h\"\n#include \"itkAdditiveGaussianNoiseImageFilter.h\"\n#include \"itkFilterWatcher.h\"\n\n#include \"gtest\/gtest.h\"\n\nnamespace\n{\n\ntemplate<typename T>\nvoid print_feature( const T &p, std::ostream  &out = std::cout )\n{\nout << \"mean: \" << p[0] << std::endl;\nout << \"minimum: \" << p[1] << std::endl;\nout << \"maximum: \" << p[2] << std::endl;\nout << \"variance: \" << p[3] << std::endl;\nout << \"standard deviation: \" << p[4] << std::endl;\nout << \"skewness: \" << p[5] << std::endl;\nout << \"kurtosis: \" << p[6] << std::endl;\nout << \"entropy: \" << p[7] << std::endl;\n}\n\n}\n\nTEST(TextureFeatures, FirstOrder_Test1)\n{\n  const unsigned int ImageDimension = 2;\n  typedef itk::Image<float, ImageDimension >                    ImageType;\n  typedef itk::Image<itk::FixedArray<float,8>, ImageDimension > OImageType;\n  typedef itk::FlatStructuringElement< ImageDimension >         KernelType;\n\n\n  unsigned int r = 50u;\n  unsigned int d = r*2 + 1;\n  ImageType::SizeType imageSize = {{ d, d }};\n  ImageType::SpacingValueType imageSpacing[]  = { 1.0f, 1.0f };\n\n  ImageType::Pointer image = ImageType::New();\n\n  image->SetRegions( ImageType::RegionType(imageSize) );\n  image->SetSpacing( imageSpacing );\n  image->Allocate();\n  image->FillBuffer(0);\n\n\n  typedef itk::AdditiveGaussianNoiseImageFilter< ImageType > ImageNoiseType;\n  ImageNoiseType::Pointer noiseFilter = ImageNoiseType::New();\n  noiseFilter->SetSeed(124);\n  noiseFilter->SetMean(0.0);\n  noiseFilter->SetStandardDeviation(.1);\n  noiseFilter->SetInput(image);\n\n  typedef itk::FirstOrderTextureFeaturesImageFilter< ImageType, OImageType, KernelType > TextureFilterType;\n\n  KernelType::SizeType radius;\n  radius.Fill( r );\n  KernelType kernel = KernelType::Box( radius );\n  TextureFilterType::Pointer filter = TextureFilterType::New();\n  filter->SetKernel( kernel );\n  filter->SetInput( noiseFilter->GetOutput() );\n\n  FilterWatcher watcher(filter, \"filter\");\n\n\n  ImageType::SizeType requestSize = {{10,10}};\n  ImageType::IndexType requestIndex = {{45,45}};\n  ImageType::RegionType request(requestIndex, requestSize);\n  filter->GetOutput()->SetRequestedRegion( request );\n  filter->Update();\n\n  OImageType::ConstPointer output = filter->GetOutput();\n\n  {\n  ImageType::IndexType idx = {{r,r}};\n  const OImageType::PixelType &p = output->GetPixel(idx);\n\n  print_feature( p );\n\n  \/\/ The following is for a Gaussian sample with std dev of .1\n  \/\/ The expected value was analytically computed, while the\n  \/\/ tolerances were estimated based on 10,000 different sample set\n  \/\/ distributions in numpy.\n  EXPECT_NEAR( 0.0, p[0], 0.002) << \"mean\";\n  EXPECT_GT(-.3, p[1]) << \"min\";\n  EXPECT_LT(.3, p[2]) << \"max\";\n  EXPECT_NEAR(0.01, p[3], .001) << \"variance\";\n  EXPECT_NEAR(0.1, p[4], .01) << \"standard deviation\";\n  EXPECT_NEAR(0, p[5], .1) << \"skewness\";\n  EXPECT_NEAR(0, p[6], .2) << \"kurtosis\";\n  EXPECT_NEAR(13.3, p[7], .1) << \"entropy\";\n  }\n}\n\n\nTEST(TextureFeatures, FirstOrder_Test2)\n{\n  const unsigned int ImageDimension = 2;\n  typedef itk::Image<float, ImageDimension >                    ImageType;\n  typedef itk::Image<itk::FixedArray<float,8>, ImageDimension > OImageType;\n  typedef itk::FlatStructuringElement< ImageDimension >         KernelType;\n\n\n  unsigned int r = 50u;\n  unsigned int d = r*2 + 1;\n  ImageType::SizeType imageSize = {{ d, d }};\n  ImageType::SpacingValueType imageSpacing[]  = { 1.0f, 1.0f };\n\n  ImageType::Pointer image = ImageType::New();\n\n  image->SetRegions( ImageType::RegionType(imageSize) );\n  image->SetSpacing( imageSpacing );\n  image->Allocate();\n  image->FillBuffer(0);\n\n\n  typedef itk::AdditiveGaussianNoiseImageFilter< ImageType > ImageNoiseType;\n  ImageNoiseType::Pointer noiseFilter = ImageNoiseType::New();\n  noiseFilter->SetSeed(124);\n  noiseFilter->SetMean(100.0);\n  noiseFilter->SetStandardDeviation(1);\n  noiseFilter->SetInput(image);\n\n  typedef itk::FirstOrderTextureFeaturesImageFilter< ImageType, OImageType, KernelType > TextureFilterType;\n\n  KernelType::SizeType radius;\n  radius.Fill( r );\n  KernelType kernel = KernelType::Box( radius );\n  TextureFilterType::Pointer filter = TextureFilterType::New();\n  filter->SetKernel( kernel );\n  filter->SetInput( noiseFilter->GetOutput() );\n\n  FilterWatcher watcher(filter, \"filter\");\n\n\n  ImageType::SizeType requestSize = {{10,10}};\n  ImageType::IndexType requestIndex = {{45,45}};\n  ImageType::RegionType request(requestIndex, requestSize);\n  filter->GetOutput()->SetRequestedRegion( request );\n  filter->Update();\n\n  OImageType::ConstPointer output = filter->GetOutput();\n\n  {\n  ImageType::IndexType idx = {{r,r}};\n  const OImageType::PixelType &p = output->GetPixel(idx);\n\n  print_feature( p );\n\n  \/\/ The following is for a Gaussian sample with std dev of .1\n  \/\/ The expected value was analytically computed, while the\n  \/\/ tolerances were estimated based on 10,000 different sample set\n  \/\/ distributions in numpy.\n  EXPECT_NEAR( 100, p[0], 0.02) << \"mean\";\n  EXPECT_GT(97, p[1]) << \"min\";\n  EXPECT_LT(103, p[2]) << \"max\";\n  EXPECT_NEAR(1, p[3], .1) << \"variance\";\n  EXPECT_NEAR(1, p[4], .1) << \"standard deviation\";\n  EXPECT_NEAR(0, p[5], .1) << \"skewness\";\n  EXPECT_NEAR(0, p[6], .2) << \"kurtosis\";\n  EXPECT_NEAR(13.3, p[7], .2) << \"entropy\";\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2019 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 \"firebase_test_framework.h\"  \/\/ NOLINT\n\n#include <cstdio>\n#include <cstring>\n#include <string>\n#include <vector>\n\n#include \"firebase\/future.h\"\n\nnamespace firebase {\nnamespace internal {\n\/\/ Borrow Firebase's internal Base64 encoder and decoder.\nextern bool Base64Encode(const std::string& input, std::string* output);\nextern bool Base64Decode(const std::string& input, std::string* output);\n}  \/\/ namespace internal\n}  \/\/ namespace firebase\n\nnamespace firebase_test_framework {\n\nint FirebaseTest::argc_ = 0;\nchar** FirebaseTest::argv_ = nullptr;\nbool FirebaseTest::found_config_ = false;\n\nFirebaseTest::FirebaseTest() : app_(nullptr) {}\n\nFirebaseTest::~FirebaseTest() { assert(app_ == nullptr); }\n\nvoid FirebaseTest::SetUp() {}\n\nvoid FirebaseTest::TearDown() {\n  if (HasFailure()) {\n    app_framework::SetPreserveFullLog(false);\n    app_framework::LogError(\n        \"Test %s failed.\\nFull test log:\\n%s\",\n        ::testing::UnitTest::GetInstance()->current_test_info()->name(),\n        \"========================================================\");\n    app_framework::SetPreserveFullLog(true);\n    app_framework::AddToFullLog(\n        \"========================================================\\n\");\n    app_framework::OutputFullLog();\n  } else {\n    app_framework::ClearFullLog();\n  }\n}\n\nvoid FirebaseTest::FindFirebaseConfig(const char* try_directory) {\n#if !defined(__ANDROID__) && !(defined(TARGET_OS_IPHONE) && TARGET_OS_IPHONE)\n  static const char kDefaultGoogleServicesPath[] = \"google-services.json\";\n\n  if (!found_config_) {\n    if (try_directory[0] != '\\0' && app_framework::FileExists(try_directory)) {\n      app_framework::ChangeToFileDirectory(try_directory);\n    } else if (app_framework::FileExists(kDefaultGoogleServicesPath)) {\n      \/\/ It's in the current directory, don't do anything.\n    } else {\n      \/\/ Try the directory the binary is in.\n      app_framework::ChangeToFileDirectory(argv_[0]);\n    }\n    \/\/ Only do this once.\n    found_config_ = true;\n  }\n#endif  \/\/  !defined(__ANDROID__) && !(defined(TARGET_OS_IPHONE) &&\n        \/\/  TARGET_OS_IPHONE)\n  (void)try_directory;\n}\n\nvoid FirebaseTest::InitializeApp() {\n  if (app_) return;  \/\/ Already initialized.\n\n  app_framework::LogDebug(\"Initialize Firebase App.\");\n\n#if defined(__ANDROID__)\n  app_ = ::firebase::App::Create(app_framework::GetJniEnv(),\n                                 app_framework::GetActivity());\n#else\n  app_ = ::firebase::App::Create();\n#endif  \/\/ defined(__ANDROID__)\n}\n\nvoid FirebaseTest::TerminateApp() {\n  if (!app_) return;  \/\/ Already terminated.\n\n  app_framework::LogDebug(\"Shutdown Firebase App.\");\n  delete app_;\n  app_ = nullptr;\n}\n\nbool FirebaseTest::RunFlakyBlockBase(bool (*flaky_block)(void* context),\n                                     void* context, const char* name) {\n  \/\/ Run flaky_block(context). If it returns true, all is well, return true.\n  \/\/ If it returns false, something flaky failed; wait a moment and try again.\n  const int kRetryDelaysMs[] = {\/\/ Roughly exponential backoff for the retries.\n                                100, 1000, 5000, 10000, 30000};\n  const int kNumAttempts =\n      1 + (sizeof(kRetryDelaysMs) \/ sizeof(kRetryDelaysMs[0]));\n\n  int attempt = 0;\n\n  while (attempt < kNumAttempts) {\n    bool result = flaky_block(context);\n    if (result || (attempt == kNumAttempts - 1)) {\n      return result;\n    }\n    app_framework::LogDebug(\"RunFlakyBlock%s%s: Attempt %d failed\",\n                            *name ? \" \" : \"\", name, attempt + 1);\n    int delay_ms = kRetryDelaysMs[attempt];\n    app_framework::ProcessEvents(delay_ms);\n    attempt++;\n  }\n  return false;\n}\n\nfirebase::FutureBase FirebaseTest::RunWithRetryBase(\n    firebase::FutureBase (*run_future)(void* context), void* context,\n    const char* name, int expected_error) {\n  \/\/ Run run_future(context), which returns a Future, then wait for that Future\n  \/\/ to complete. If the Future returns Invalid, or if its error() does\n  \/\/ not match expected_error, pause a moment and try again.\n  \/\/\n  \/\/ In most cases, this will return the Future once it's been completed.\n  \/\/ However, if it reaches the last attempt, it will return immediately once\n  \/\/ the operation begins. This is because at this point we want to return the\n  \/\/ results whether or not the operation succeeds.\n  const int kRetryDelaysMs[] = {\/\/ Roughly exponential backoff for the retries.\n                                100, 1000, 5000, 10000, 30000};\n  const int kNumAttempts =\n      1 + (sizeof(kRetryDelaysMs) \/ sizeof(kRetryDelaysMs[0]));\n\n  int attempt = 0;\n  firebase::FutureBase future;\n\n  while (attempt < kNumAttempts) {\n    future = run_future(context);\n    if (attempt == kNumAttempts - 1) {\n      \/\/ This is the last attempt, return immediately.\n      break;\n    }\n\n    \/\/ Wait for completion, then check status and error.\n    while (future.status() == firebase::kFutureStatusPending) {\n      app_framework::ProcessEvents(100);\n    }\n    if (future.status() != firebase::kFutureStatusComplete) {\n      app_framework::LogDebug(\n          \"RunWithRetry%s%s: Attempt %d returned invalid status\",\n          *name ? \" \" : \"\", name, attempt + 1);\n    } else if (future.error() != expected_error) {\n      app_framework::LogDebug(\n          \"RunWithRetry%s%s: Attempt %d returned error %d, expected %d\",\n          *name ? \" \" : \"\", name, attempt + 1, future.error(), expected_error);\n    } else {\n      \/\/ Future is completed and the error matches what's expected, no need to\n      \/\/ retry further.\n      break;\n    }\n    int delay_ms = kRetryDelaysMs[attempt];\n    app_framework::LogDebug(\n        \"RunWithRetry%s%s: Pause %d milliseconds before retrying.\",\n        *name ? \" \" : \"\", name, delay_ms);\n    app_framework::ProcessEvents(delay_ms);\n    attempt++;\n  }\n  return future;\n}\n\nbool FirebaseTest::WaitForCompletion(const firebase::FutureBase& future,\n                                     const char* name, int expected_error) {\n  app_framework::LogDebug(\"WaitForCompletion %s\", name);\n  while (future.status() == firebase::kFutureStatusPending) {\n    app_framework::ProcessEvents(100);\n  }\n  EXPECT_EQ(future.status(), firebase::kFutureStatusComplete)\n      << name << \" returned an invalid status.\";\n  EXPECT_EQ(future.error(), expected_error)\n      << name << \" returned error \" << future.error() << \": \"\n      << future.error_message();\n  return (future.status() == firebase::kFutureStatusComplete &&\n          future.error() == expected_error);\n}\n\nbool FirebaseTest::WaitForCompletionAnyResult(\n    const firebase::FutureBase& future, const char* name) {\n  app_framework::LogDebug(\"WaitForCompletion %s\", name);\n  while (future.status() == firebase::kFutureStatusPending) {\n    app_framework::ProcessEvents(100);\n  }\n  EXPECT_EQ(future.status(), firebase::kFutureStatusComplete)\n      << name << \" returned an invalid status.\";\n  return (future.status() == firebase::kFutureStatusComplete);\n}\n\nstatic void VariantToStringInternal(const firebase::Variant& variant,\n                                    std::ostream& out,\n                                    const std::string& indent) {\n  if (variant.is_null()) {\n    out << \"null\";\n  } else if (variant.is_int64()) {\n    out << variant.int64_value();\n  } else if (variant.is_double()) {\n    out << variant.double_value();\n  } else if (variant.is_bool()) {\n    out << (variant.bool_value() ? \"true\" : \"false\");\n  } else if (variant.is_string()) {\n    out << variant.string_value();\n  } else if (variant.is_blob()) {\n    out << \"blob[\" << variant.blob_size() << \"] = <\";\n    char hex[3];\n    for (size_t i = 0; i < variant.blob_size(); ++i) {\n      snprintf(hex, sizeof(hex), \"%02x\", variant.blob_data()[i]);\n      if (i != 0) out << \" \";\n      out << hex;\n    }\n    out << \">\";\n  } else if (variant.is_vector()) {\n    out << \"[\" << std::endl;\n    const auto& v = variant.vector();\n    for (auto it = v.begin(); it != v.end(); ++it) {\n      out << indent + \"  \";\n      VariantToStringInternal(*it, out, indent + \"  \");\n      auto next_it = it;\n      next_it++;\n      if (next_it != v.end()) out << \",\";\n      out << std::endl;\n    }\n    out << \"]\";\n  } else if (variant.is_map()) {\n    out << \"[\" << std::endl;\n    const auto& m = variant.map();\n    for (auto it = m.begin(); it != m.end(); ++it) {\n      out << indent + \"  \";\n      VariantToStringInternal(it->first, out, indent + \"  \");\n      out << \": \";\n      VariantToStringInternal(it->second, out, indent + \"  \");\n      auto next_it = it;\n      next_it++;\n      if (next_it != m.end()) out << \",\";\n      out << std::endl;\n    }\n    out << \"]\";\n  } else {\n    out << \"<unsupported type>\";\n  }\n}\n\nstd::string FirebaseTest::VariantToString(const firebase::Variant& variant) {\n  std::ostringstream out;\n  VariantToStringInternal(variant, out, \"\");\n  return out.str();\n}\n\nbool FirebaseTest::IsUserInteractionAllowed() {\n  \/\/ In the trivial case, just check whether we are logging to file. If not,\n  \/\/ assume interaction is allowed.\n  return !app_framework::IsLoggingToFile();\n}\n\nbool FirebaseTest::Base64Encode(const std::string& input, std::string* output) {\n  return ::firebase::internal::Base64Encode(input, output);\n}\n\nbool FirebaseTest::Base64Decode(const std::string& input, std::string* output) {\n  return ::firebase::internal::Base64Decode(input, output);\n}\n\nclass LogTestEventListener : public testing::EmptyTestEventListener {\n public:\n  void OnTestPartResult(\n      const testing::TestPartResult& test_part_result) override {\n    if (test_part_result.failed() && test_part_result.message()) {\n      app_framework::AddToFullLog(test_part_result.message());\n      app_framework::AddToFullLog(\"\\n\");\n    }\n  };\n};\n\n}  \/\/ namespace firebase_test_framework\n\nnamespace firebase {\n\/\/ gtest requires that the operator<< be in the same namespace as the item you\n\/\/ are outputting.\nstd::ostream& operator<<(std::ostream& os, const Variant& v) {\n  return os << firebase_test_framework::FirebaseTest::VariantToString(v);\n}\n}  \/\/ namespace firebase\n\nnamespace {\n\nstd::vector<std::string> ArgcArgvToVector(int argc, char* argv[]) {\n  std::vector<std::string> args_vector;\n  for (int i = 0; i < argc; ++i) {\n    args_vector.push_back(argv[i]);\n  }\n  return args_vector;\n}\n\nchar** VectorToArgcArgv(const std::vector<std::string>& args_vector,\n                        int* argc) {\n  \/\/ Ensure that `argv` ends with a null terminator. This is a POSIX requirement\n  \/\/ (see https:\/\/man7.org\/linux\/man-pages\/man2\/execve.2.html) and googletest\n  \/\/ relies on it. Without this null terminator, the\n  \/\/ `ParseGoogleTestFlagsOnlyImpl()` function in googletest accesses invalid\n  \/\/ memory and causes an Address Sanitizer failure.\n  char** argv = new char*[args_vector.size() + 1];\n  for (int i = 0; i < args_vector.size(); ++i) {\n    const char* arg = args_vector[i].c_str();\n    char* arg_copy = new char[std::strlen(arg) + 1];\n    std::strcpy(arg_copy, arg);\n    argv[i] = arg_copy;\n  }\n  argv[args_vector.size()] = nullptr;\n  *argc = static_cast<int>(args_vector.size());\n  return argv;\n}\n\n\/**\n * Makes changes to argc and argv before passing them to `InitGoogleTest`.\n *\n * This function is a convenience function for developers to edit during\n * development\/debugging to customize the the arguments specified to googletest\n * when directly specifying command-line arguments is not available, such as on\n * Android and iOS. For example, to debug a specific test, add the\n * --gtest_filter argument, and to list all tests add the --gtest_list_tests\n * argument.\n *\n * @param argc A pointer to the `argc` that will be specified to\n * `InitGoogleTest`; the integer to which this pointer points will be updated\n * with the new length of `argv`.\n * @param argv The `argv` that contains the arguments that would have otherwise\n * been specified to `InitGoogleTest()`; they will not be modified.\n *\n * @return The new `argv` to be specified to `InitGoogleTest()`.\n *\/\nchar** EditMainArgsForGoogleTest(int* argc, char* argv[]) {\n  \/\/ Put the args into a vector of strings because modifying string objects in\n  \/\/ a vector is far easier than modifying a char** array.\n  const std::vector<std::string> original_args = ArgcArgvToVector(*argc, argv);\n  std::vector<std::string> modified_args(original_args);\n\n  \/\/ Add elements to the `modified_args` vector to specify to googletest.\n  \/\/ e.g. modified_args.push_back(\"--gtest_list_tests\");\n  \/\/ e.g. modified_args.push_back(\"--gtest_filter=MyTestFixture.MyTest\");\n\n  \/\/ Create a new `argv` with the elements from the `modified_args` vector and\n  \/\/ write the new count back to `argc`. The memory leaks produced by\n  \/\/ `VectorToArgcArgv` acceptable because they last for the entire application.\n  \/\/ Calling `VectorToArgcArgv` also fixes an invalid memory access performed by\n  \/\/ googletest by adding the required null element to the end of `argv`.\n  return VectorToArgcArgv(modified_args, argc);\n}\n\n}  \/\/ namespace\n\nextern \"C\" int common_main(int argc, char* argv[]) {\n  argv = EditMainArgsForGoogleTest(&argc, argv);\n  ::testing::InitGoogleTest(&argc, argv);\n  firebase_test_framework::FirebaseTest::SetArgs(argc, argv);\n  app_framework::SetLogLevel(app_framework::kDebug);\n  \/\/ Anything below the given log level will be preserved, and printed out in\n  \/\/ the event of test failure.\n  app_framework::SetPreserveFullLog(true);\n  ::testing::TestEventListeners& listeners =\n      ::testing::UnitTest::GetInstance()->listeners();\n  listeners.Append(new firebase_test_framework::LogTestEventListener());\n  int result = RUN_ALL_TESTS();\n\n  return result;\n}\n<commit_msg>Only run one test<commit_after>\/\/ Copyright 2019 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 \"firebase_test_framework.h\"  \/\/ NOLINT\n\n#include <cstdio>\n#include <cstring>\n#include <string>\n#include <vector>\n\n#include \"firebase\/future.h\"\n\nnamespace firebase {\nnamespace internal {\n\/\/ Borrow Firebase's internal Base64 encoder and decoder.\nextern bool Base64Encode(const std::string& input, std::string* output);\nextern bool Base64Decode(const std::string& input, std::string* output);\n}  \/\/ namespace internal\n}  \/\/ namespace firebase\n\nnamespace firebase_test_framework {\n\nint FirebaseTest::argc_ = 0;\nchar** FirebaseTest::argv_ = nullptr;\nbool FirebaseTest::found_config_ = false;\n\nFirebaseTest::FirebaseTest() : app_(nullptr) {}\n\nFirebaseTest::~FirebaseTest() { assert(app_ == nullptr); }\n\nvoid FirebaseTest::SetUp() {}\n\nvoid FirebaseTest::TearDown() {\n  if (HasFailure()) {\n    app_framework::SetPreserveFullLog(false);\n    app_framework::LogError(\n        \"Test %s failed.\\nFull test log:\\n%s\",\n        ::testing::UnitTest::GetInstance()->current_test_info()->name(),\n        \"========================================================\");\n    app_framework::SetPreserveFullLog(true);\n    app_framework::AddToFullLog(\n        \"========================================================\\n\");\n    app_framework::OutputFullLog();\n  } else {\n    app_framework::ClearFullLog();\n  }\n}\n\nvoid FirebaseTest::FindFirebaseConfig(const char* try_directory) {\n#if !defined(__ANDROID__) && !(defined(TARGET_OS_IPHONE) && TARGET_OS_IPHONE)\n  static const char kDefaultGoogleServicesPath[] = \"google-services.json\";\n\n  if (!found_config_) {\n    if (try_directory[0] != '\\0' && app_framework::FileExists(try_directory)) {\n      app_framework::ChangeToFileDirectory(try_directory);\n    } else if (app_framework::FileExists(kDefaultGoogleServicesPath)) {\n      \/\/ It's in the current directory, don't do anything.\n    } else {\n      \/\/ Try the directory the binary is in.\n      app_framework::ChangeToFileDirectory(argv_[0]);\n    }\n    \/\/ Only do this once.\n    found_config_ = true;\n  }\n#endif  \/\/  !defined(__ANDROID__) && !(defined(TARGET_OS_IPHONE) &&\n        \/\/  TARGET_OS_IPHONE)\n  (void)try_directory;\n}\n\nvoid FirebaseTest::InitializeApp() {\n  if (app_) return;  \/\/ Already initialized.\n\n  app_framework::LogDebug(\"Initialize Firebase App.\");\n\n#if defined(__ANDROID__)\n  app_ = ::firebase::App::Create(app_framework::GetJniEnv(),\n                                 app_framework::GetActivity());\n#else\n  app_ = ::firebase::App::Create();\n#endif  \/\/ defined(__ANDROID__)\n}\n\nvoid FirebaseTest::TerminateApp() {\n  if (!app_) return;  \/\/ Already terminated.\n\n  app_framework::LogDebug(\"Shutdown Firebase App.\");\n  delete app_;\n  app_ = nullptr;\n}\n\nbool FirebaseTest::RunFlakyBlockBase(bool (*flaky_block)(void* context),\n                                     void* context, const char* name) {\n  \/\/ Run flaky_block(context). If it returns true, all is well, return true.\n  \/\/ If it returns false, something flaky failed; wait a moment and try again.\n  const int kRetryDelaysMs[] = {\/\/ Roughly exponential backoff for the retries.\n                                100, 1000, 5000, 10000, 30000};\n  const int kNumAttempts =\n      1 + (sizeof(kRetryDelaysMs) \/ sizeof(kRetryDelaysMs[0]));\n\n  int attempt = 0;\n\n  while (attempt < kNumAttempts) {\n    bool result = flaky_block(context);\n    if (result || (attempt == kNumAttempts - 1)) {\n      return result;\n    }\n    app_framework::LogDebug(\"RunFlakyBlock%s%s: Attempt %d failed\",\n                            *name ? \" \" : \"\", name, attempt + 1);\n    int delay_ms = kRetryDelaysMs[attempt];\n    app_framework::ProcessEvents(delay_ms);\n    attempt++;\n  }\n  return false;\n}\n\nfirebase::FutureBase FirebaseTest::RunWithRetryBase(\n    firebase::FutureBase (*run_future)(void* context), void* context,\n    const char* name, int expected_error) {\n  \/\/ Run run_future(context), which returns a Future, then wait for that Future\n  \/\/ to complete. If the Future returns Invalid, or if its error() does\n  \/\/ not match expected_error, pause a moment and try again.\n  \/\/\n  \/\/ In most cases, this will return the Future once it's been completed.\n  \/\/ However, if it reaches the last attempt, it will return immediately once\n  \/\/ the operation begins. This is because at this point we want to return the\n  \/\/ results whether or not the operation succeeds.\n  const int kRetryDelaysMs[] = {\/\/ Roughly exponential backoff for the retries.\n                                100, 1000, 5000, 10000, 30000};\n  const int kNumAttempts =\n      1 + (sizeof(kRetryDelaysMs) \/ sizeof(kRetryDelaysMs[0]));\n\n  int attempt = 0;\n  firebase::FutureBase future;\n\n  while (attempt < kNumAttempts) {\n    future = run_future(context);\n    if (attempt == kNumAttempts - 1) {\n      \/\/ This is the last attempt, return immediately.\n      break;\n    }\n\n    \/\/ Wait for completion, then check status and error.\n    while (future.status() == firebase::kFutureStatusPending) {\n      app_framework::ProcessEvents(100);\n    }\n    if (future.status() != firebase::kFutureStatusComplete) {\n      app_framework::LogDebug(\n          \"RunWithRetry%s%s: Attempt %d returned invalid status\",\n          *name ? \" \" : \"\", name, attempt + 1);\n    } else if (future.error() != expected_error) {\n      app_framework::LogDebug(\n          \"RunWithRetry%s%s: Attempt %d returned error %d, expected %d\",\n          *name ? \" \" : \"\", name, attempt + 1, future.error(), expected_error);\n    } else {\n      \/\/ Future is completed and the error matches what's expected, no need to\n      \/\/ retry further.\n      break;\n    }\n    int delay_ms = kRetryDelaysMs[attempt];\n    app_framework::LogDebug(\n        \"RunWithRetry%s%s: Pause %d milliseconds before retrying.\",\n        *name ? \" \" : \"\", name, delay_ms);\n    app_framework::ProcessEvents(delay_ms);\n    attempt++;\n  }\n  return future;\n}\n\nbool FirebaseTest::WaitForCompletion(const firebase::FutureBase& future,\n                                     const char* name, int expected_error) {\n  app_framework::LogDebug(\"WaitForCompletion %s\", name);\n  while (future.status() == firebase::kFutureStatusPending) {\n    app_framework::ProcessEvents(100);\n  }\n  EXPECT_EQ(future.status(), firebase::kFutureStatusComplete)\n      << name << \" returned an invalid status.\";\n  EXPECT_EQ(future.error(), expected_error)\n      << name << \" returned error \" << future.error() << \": \"\n      << future.error_message();\n  return (future.status() == firebase::kFutureStatusComplete &&\n          future.error() == expected_error);\n}\n\nbool FirebaseTest::WaitForCompletionAnyResult(\n    const firebase::FutureBase& future, const char* name) {\n  app_framework::LogDebug(\"WaitForCompletion %s\", name);\n  while (future.status() == firebase::kFutureStatusPending) {\n    app_framework::ProcessEvents(100);\n  }\n  EXPECT_EQ(future.status(), firebase::kFutureStatusComplete)\n      << name << \" returned an invalid status.\";\n  return (future.status() == firebase::kFutureStatusComplete);\n}\n\nstatic void VariantToStringInternal(const firebase::Variant& variant,\n                                    std::ostream& out,\n                                    const std::string& indent) {\n  if (variant.is_null()) {\n    out << \"null\";\n  } else if (variant.is_int64()) {\n    out << variant.int64_value();\n  } else if (variant.is_double()) {\n    out << variant.double_value();\n  } else if (variant.is_bool()) {\n    out << (variant.bool_value() ? \"true\" : \"false\");\n  } else if (variant.is_string()) {\n    out << variant.string_value();\n  } else if (variant.is_blob()) {\n    out << \"blob[\" << variant.blob_size() << \"] = <\";\n    char hex[3];\n    for (size_t i = 0; i < variant.blob_size(); ++i) {\n      snprintf(hex, sizeof(hex), \"%02x\", variant.blob_data()[i]);\n      if (i != 0) out << \" \";\n      out << hex;\n    }\n    out << \">\";\n  } else if (variant.is_vector()) {\n    out << \"[\" << std::endl;\n    const auto& v = variant.vector();\n    for (auto it = v.begin(); it != v.end(); ++it) {\n      out << indent + \"  \";\n      VariantToStringInternal(*it, out, indent + \"  \");\n      auto next_it = it;\n      next_it++;\n      if (next_it != v.end()) out << \",\";\n      out << std::endl;\n    }\n    out << \"]\";\n  } else if (variant.is_map()) {\n    out << \"[\" << std::endl;\n    const auto& m = variant.map();\n    for (auto it = m.begin(); it != m.end(); ++it) {\n      out << indent + \"  \";\n      VariantToStringInternal(it->first, out, indent + \"  \");\n      out << \": \";\n      VariantToStringInternal(it->second, out, indent + \"  \");\n      auto next_it = it;\n      next_it++;\n      if (next_it != m.end()) out << \",\";\n      out << std::endl;\n    }\n    out << \"]\";\n  } else {\n    out << \"<unsupported type>\";\n  }\n}\n\nstd::string FirebaseTest::VariantToString(const firebase::Variant& variant) {\n  std::ostringstream out;\n  VariantToStringInternal(variant, out, \"\");\n  return out.str();\n}\n\nbool FirebaseTest::IsUserInteractionAllowed() {\n  \/\/ In the trivial case, just check whether we are logging to file. If not,\n  \/\/ assume interaction is allowed.\n  return !app_framework::IsLoggingToFile();\n}\n\nbool FirebaseTest::Base64Encode(const std::string& input, std::string* output) {\n  return ::firebase::internal::Base64Encode(input, output);\n}\n\nbool FirebaseTest::Base64Decode(const std::string& input, std::string* output) {\n  return ::firebase::internal::Base64Decode(input, output);\n}\n\nclass LogTestEventListener : public testing::EmptyTestEventListener {\n public:\n  void OnTestPartResult(\n      const testing::TestPartResult& test_part_result) override {\n    if (test_part_result.failed() && test_part_result.message()) {\n      app_framework::AddToFullLog(test_part_result.message());\n      app_framework::AddToFullLog(\"\\n\");\n    }\n  };\n};\n\n}  \/\/ namespace firebase_test_framework\n\nnamespace firebase {\n\/\/ gtest requires that the operator<< be in the same namespace as the item you\n\/\/ are outputting.\nstd::ostream& operator<<(std::ostream& os, const Variant& v) {\n  return os << firebase_test_framework::FirebaseTest::VariantToString(v);\n}\n}  \/\/ namespace firebase\n\nnamespace {\n\nstd::vector<std::string> ArgcArgvToVector(int argc, char* argv[]) {\n  std::vector<std::string> args_vector;\n  for (int i = 0; i < argc; ++i) {\n    args_vector.push_back(argv[i]);\n  }\n  return args_vector;\n}\n\nchar** VectorToArgcArgv(const std::vector<std::string>& args_vector,\n                        int* argc) {\n  \/\/ Ensure that `argv` ends with a null terminator. This is a POSIX requirement\n  \/\/ (see https:\/\/man7.org\/linux\/man-pages\/man2\/execve.2.html) and googletest\n  \/\/ relies on it. Without this null terminator, the\n  \/\/ `ParseGoogleTestFlagsOnlyImpl()` function in googletest accesses invalid\n  \/\/ memory and causes an Address Sanitizer failure.\n  char** argv = new char*[args_vector.size() + 1];\n  for (int i = 0; i < args_vector.size(); ++i) {\n    const char* arg = args_vector[i].c_str();\n    char* arg_copy = new char[std::strlen(arg) + 1];\n    std::strcpy(arg_copy, arg);\n    argv[i] = arg_copy;\n  }\n  argv[args_vector.size()] = nullptr;\n  *argc = static_cast<int>(args_vector.size());\n  return argv;\n}\n\n\/**\n * Makes changes to argc and argv before passing them to `InitGoogleTest`.\n *\n * This function is a convenience function for developers to edit during\n * development\/debugging to customize the the arguments specified to googletest\n * when directly specifying command-line arguments is not available, such as on\n * Android and iOS. For example, to debug a specific test, add the\n * --gtest_filter argument, and to list all tests add the --gtest_list_tests\n * argument.\n *\n * @param argc A pointer to the `argc` that will be specified to\n * `InitGoogleTest`; the integer to which this pointer points will be updated\n * with the new length of `argv`.\n * @param argv The `argv` that contains the arguments that would have otherwise\n * been specified to `InitGoogleTest()`; they will not be modified.\n *\n * @return The new `argv` to be specified to `InitGoogleTest()`.\n *\/\nchar** EditMainArgsForGoogleTest(int* argc, char* argv[]) {\n  \/\/ Put the args into a vector of strings because modifying string objects in\n  \/\/ a vector is far easier than modifying a char** array.\n  const std::vector<std::string> original_args = ArgcArgvToVector(*argc, argv);\n  std::vector<std::string> modified_args(original_args);\n\n  \/\/ Add elements to the `modified_args` vector to specify to googletest.\n  modified_args.push_back(\"--gtest_catch_exceptions=0\");\n  modified_args.push_back(\"--gtest_filter=TransactionTest*\");\n\n  \/\/ Create a new `argv` with the elements from the `modified_args` vector and\n  \/\/ write the new count back to `argc`. The memory leaks produced by\n  \/\/ `VectorToArgcArgv` acceptable because they last for the entire application.\n  \/\/ Calling `VectorToArgcArgv` also fixes an invalid memory access performed by\n  \/\/ googletest by adding the required null element to the end of `argv`.\n  return VectorToArgcArgv(modified_args, argc);\n}\n\n}  \/\/ namespace\n\nextern \"C\" int common_main(int argc, char* argv[]) {\n  argv = EditMainArgsForGoogleTest(&argc, argv);\n  ::testing::InitGoogleTest(&argc, argv);\n  firebase_test_framework::FirebaseTest::SetArgs(argc, argv);\n  app_framework::SetLogLevel(app_framework::kDebug);\n  \/\/ Anything below the given log level will be preserved, and printed out in\n  \/\/ the event of test failure.\n  app_framework::SetPreserveFullLog(true);\n  ::testing::TestEventListeners& listeners =\n      ::testing::UnitTest::GetInstance()->listeners();\n  listeners.Append(new firebase_test_framework::LogTestEventListener());\n  int result = RUN_ALL_TESTS();\n\n  return result;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ModuleImporter.h\"\n#include \"Application.h\"\n#include \"ImportMesh.h\"\n#include \"ImportMaterial.h\"\n#include \"ImportScript.h\"\n#include \"CompMaterial.h\"\n#include \"CompTransform.h\"\n#include \"ModuleFS.h\"\n#include \"ModuleInput.h\"\n#include \"Scene.h\"\n#include \"ModuleGUI.h\"\n#include \"ModuleWindow.h\"\n#include \"JSONSerialization.h\"\n\n#include <direct.h>\n#include <mono\/jit\/jit.h>\n#include <mono\/metadata\/assembly.h>\n#include <mono\/metadata\/mono-config.h>\n\nModuleImporter::ModuleImporter(bool start_enabled) : Module(start_enabled)\n{\n\tAwake_enabled = true;\n\tStart_enabled = true;\n\tpreUpdate_enabled = true;\n\n\tname = \"Importer\";\n}\n\n\nModuleImporter::~ModuleImporter()\n{\n\tRELEASE(iMesh);\n\tRELEASE(iMaterial);\n\tRELEASE(iScript);\n}\n\nbool ModuleImporter::Init(JSON_Object* node)\n{\n\tperf_timer.Start();\n\n\t\/\/ Will contain exe path\n\tHMODULE hModule = GetModuleHandle(NULL);\n\tif (hModule != NULL)\n\t{\n\t\t\/\/ When passing NULL to GetModuleHandle, it returns handle of exe itself\n\t\tGetModuleFileName(hModule, directoryExe, (sizeof(directoryExe)));\n\t}\n\tiMesh = new ImportMesh();\n\tiMaterial = new ImportMaterial();\n\tiScript = new ImportScript();\n\n\tAwake_t = perf_timer.ReadMs();\n\treturn true;\n}\n\nbool ModuleImporter::Start()\n{\n\tperf_timer.Start();\n\n\tstruct aiLogStream stream;\n\tstream = aiGetPredefinedLogStream(aiDefaultLogStream_DEBUGGER, nullptr);\n\taiAttachLogStream(&stream);\n\n\t\/\/ Now InitSystem Domain Mono\n\tif (InitSystemScript())\n\t{\n\t\tLOG(\"Culverin Assembly Init SUCCESS.\");\n\t}\n\telse\n\t{\n\t\tLOG(\"Culverin Assembly Init FAIL.\");\n\t}\n\n\tStart_t = perf_timer.ReadMs();\n\treturn true;\n}\n\nbool ModuleImporter::InitSystemScript()\n{\n\tchar my_path[FILENAME_MAX];\n\t\/\/ Fill my_path char array with the path of the .dll\n\t_getcwd(my_path, FILENAME_MAX);\n\n\t\/\/ Set where Mono Directory is placed in mono_path\n\tmono_path = my_path;\n\tmono_path += \"\/Mono\";\n\n\t\/\/ Use the standard configuration ----\n\tmono_config_parse(NULL);\n\n\t\/\/ Get the correct dirs --------------\n\tstd::string lib = mono_path;\n\tlib += \"\/lib\";\n\tstd::string etc = mono_path;\n\tetc += \"\/etc\";\n\n\n\t\/\/ Setup the default directories for mono use here for now the directories of your Mono installation\n\tmono_set_dirs(lib.c_str(), etc.c_str());\n\tdomain = mono_jit_init_version(\"\/Game\", \"v4.0.30319\");\n\n\tMonoAssembly* culverin_assembly = mono_domain_assembly_open(domain, \".\/ScriptManager\/AssemblyReference\/CulverinEditor.dll\");\n\tif (culverin_assembly)\n\t{\n\t\tculverin_mono_image = mono_assembly_get_image(culverin_assembly);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nupdate_status ModuleImporter::PreUpdate(float dt)\n{\n\tperf_timer.Start();\n\n\tif (App->input->GetKey(SDL_SCANCODE_B) == KEY_DOWN)\n\t{\n\t\t\/\/ImportMesh* imp = new ImportMesh();\n\t\t\/\/imp->Load(\"Baker_house.rin\");\n\t}\n\n\tpreUpdate_t = perf_timer.ReadMs();\n\treturn UPDATE_CONTINUE;\n}\n\nGameObject* ModuleImporter::ProcessNode(aiNode* node, const aiScene* scene, GameObject* obj)\n{\t\n\tstatic int count = 0;\n\tGameObject* objChild = new GameObject(obj);\n\tobjChild->SetName(App->GetCharfromConstChar(node->mName.C_Str()));\n\n\tCompTransform* trans = (CompTransform*)objChild->AddComponent(C_TRANSFORM);\n\tProcessTransform(node, trans);\n\n\t\/\/ Process all the Node's MESHES\n\tfor (uint i = 0; i < node->mNumMeshes; i++)\n\t{\n\t\tGameObject* newObj = nullptr;\n\n\t\tif (node->mNumMeshes > 1)\n\t\t{\n\t\t\tnewObj = new GameObject(obj);\n\t\t\tstd::string newName = \"Submesh\" + std::to_string(i);\n\t\t\tnewObj->SetName(App->GetCharfromConstChar(newName.c_str()));\n\t\t\tCompTransform* newTrans = (CompTransform*)newObj->AddComponent(C_TRANSFORM);\n\t\t\tProcessTransform(node, newTrans);\n\t\t}\n\n\t\telse\n\t\t{\n\t\t\tnewObj = objChild;\n\t\t}\n\n\t\taiMesh* mesh = scene->mMeshes[node->mMeshes[i]];\n\t\tiMesh->Import(scene, mesh, newObj, node->mName.C_Str());\n\t}\n\n\t\/\/ Process children\n\tfor (uint i = 0; i < node->mNumChildren; i++)\n\t{\n\t\tProcessNode(node->mChildren[i], scene, objChild);\n\t}\n\n\treturn objChild;\n}\n\nGameObject* ModuleImporter::ProcessNode(aiNode* node, const aiScene* scene, GameObject* obj, std::vector<ReImport>& resourcesToReimport)\n{\n\tstatic int count = 0;\n\tGameObject* objChild = new GameObject(obj);\n\tobjChild->SetName(App->GetCharfromConstChar(node->mName.C_Str()));\n\n\tCompTransform* trans = (CompTransform*)objChild->AddComponent(C_TRANSFORM);\n\tProcessTransform(node, trans);\n\n\t\/\/ Process all the Node's MESHES\n\tfor (uint i = 0; i < node->mNumMeshes; i++)\n\t{\n\t\tGameObject* newObj = nullptr;\n\n\t\tif (node->mNumMeshes > 1)\n\t\t{\n\t\t\tnewObj = new GameObject(obj);\n\t\t\tstd::string newName = \"Submesh\" + std::to_string(i);\n\t\t\tnewObj->SetName(App->GetCharfromConstChar(newName.c_str()));\n\t\t\tCompTransform* newTrans = (CompTransform*)newObj->AddComponent(C_TRANSFORM);\n\t\t\tProcessTransform(node, newTrans);\n\t\t}\n\n\t\telse\n\t\t{\n\t\t\tnewObj = objChild;\n\t\t}\n\n\t\taiMesh* mesh = scene->mMeshes[node->mMeshes[i]];\n\t\tbool isReimported = false;\n\t\tfor (int i = 0; i < resourcesToReimport.size(); i++)\n\t\t{\n\t\t\tif (strcmp(node->mName.C_Str(), resourcesToReimport[i].nameMesh) == 0)\n\t\t\t{\n\t\t\t\tiMesh->Import(scene, mesh, newObj, node->mName.C_Str(), resourcesToReimport[i].uuid);\n\t\t\t\tisReimported = true;\n\t\t\t}\n\t\t}\n\t\tif (isReimported == false)\n\t\t{\n\t\t\tiMesh->Import(scene, mesh, newObj, node->mName.C_Str(), 0);\n\t\t}\n\t}\n\n\t\/\/ Process children\n\tfor (uint i = 0; i < node->mNumChildren; i++)\n\t{\n\t\tProcessNode(node->mChildren[i], scene, objChild, resourcesToReimport);\n\t}\n\n\treturn objChild;\n}\n\nvoid ModuleImporter::ProcessTransform(aiNode* node, CompTransform* trans)\n{\n\taiVector3D aiPos;\n\taiQuaternion aiRot;\n\taiVector3D aiScale;\n\taiMatrix4x4 aiMatrix;\n\tfloat4x4 matrix;\n\n\taiMatrix = node->mTransformation;\n\n\tnode->mTransformation.Decompose(aiScale, aiRot, aiPos);\n\n\ttrans->SetPos(float3(aiPos.x, aiPos.y, aiPos.z));\n\ttrans->SetRot(Quat(aiRot.x, aiRot.y, aiRot.z, aiRot.w));\n\ttrans->SetScale(float3(aiScale.x, aiScale.y, aiScale.z));\n\n\ttrans->Enable();\n}\n\nvoid ModuleImporter::ProcessTransform(CompTransform* trans)\n{\n\t\/\/Set all variables to zero\/identity\n\ttrans->ResetMatrix();\n\ttrans->Enable();\n}\n\nbool ModuleImporter::CleanUp()\n{\n\taiDetachAllLogStreams();\n\treturn true;\n}\n\nMonoDomain* ModuleImporter::GetDomain()\n{\n\treturn domain;\n}\n\nMonoImage* ModuleImporter::GetCulverinImage()\n{\n\treturn culverin_mono_image;\n}\n\nstd::string ModuleImporter::GetMonoPath() const\n{\n\treturn mono_path;\n}\n\nbool ModuleImporter::Import(const char* file, Resource::Type type)\n{\n\tbool ret = true;\n\n\tswitch (type)\n\t{\n\tcase Resource::Type::MESH:\n\t{\n\t\tLOG(\"IMPORTING MODEL, File Path: %s\", file);\n\n\t\t\/\/Clear vector of textures, but dont import same textures!\n\t\t\/\/iMesh->PrepareToImport();\n\t\tconst aiScene* scene = aiImportFile(file, aiProcessPreset_TargetRealtime_MaxQuality);\n\t\tif (scene != nullptr)\n\t\t{\n\t\t\tGameObject* obj = ProcessNode(scene->mRootNode, scene, nullptr);\n\t\t\tobj->SetName(App->GetCharfromConstChar(App->fs->FixName_directory(file).c_str()));\n\n\t\t\t\/\/Now Save Serialitzate OBJ -> Prefab\n\t\t\tstd::string Newdirectory = ((Project*)App->gui->winManager[WindowName::PROJECT])->GetDirectory();\n\t\t\tNewdirectory += \"\\\\\" + App->fs->FixName_directory(file);\n\t\t\tApp->Json_seria->SavePrefab(*obj, ((Project*)App->gui->winManager[WindowName::PROJECT])->GetDirectory(), Newdirectory.c_str());\n\n\t\t\t\/\/App->scene->gameobjects.push_back(obj);\n\t\t\tApp->scene->DeleteGameObject(obj);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tret = false;\n\t\t\tLOG(\"Cannot import this fbx.\");\n\t\t}\n\t\taiReleaseImport(scene);\n\t\tbreak;\n\t}\n\tcase Resource::Type::MATERIAL:\n\t{\n\t\tLOG(\"IMPORTING TEXTURE, File Path: %s\", file);\n\t\tiMaterial->Import(file);\n\n\t\tbreak;\n\t}\n\tcase Resource::Type::SCRIPT:\n\t{\n\t\tLOG(\"IMPORTING SCRIPT, File Path: %s\", file);\n\t\tiScript->Import(file);\n\n\t\tbreak;\n\t}\n\tcase Resource::Type::UNKNOWN:\n\t{\n\t\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION, \"UNKNOWN file type dropped on window\",\n\t\t\tfile, App->window->window);\n\t\tLOG(\"UNKNOWN FILE TYPE, File Path: %s\", file);\n\t\tbreak;\n\t}\n\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn true;\n}\n\nbool ModuleImporter::Import(const char* file, Resource::Type type, std::vector<ReImport>& resourcesToReimport)\n{\n\tbool ret = true;\n\n\tswitch (type)\n\t{\n\tcase Resource::Type::MESH:\n\t{\n\t\tLOG(\"IMPORTING MODEL, File Path: %s\", file);\n\n\t\t\/\/Clear vector of textures, but dont import same textures!\n\t\t\/\/iMesh->PrepareToImport();\n\t\tconst aiScene* scene = aiImportFile(file, aiProcessPreset_TargetRealtime_MaxQuality);\n\t\tif (scene != nullptr)\n\t\t{\n\t\t\tGameObject* obj = ProcessNode(scene->mRootNode, scene, nullptr, resourcesToReimport);\n\t\t\tobj->SetName(App->GetCharfromConstChar(App->fs->FixName_directory(file).c_str()));\n\n\t\t\t\/\/Now Save Serialitzate OBJ -> Prefab\n\t\t\tstd::string Newdirectory = ((Project*)App->gui->winManager[WindowName::PROJECT])->GetDirectory();\n\t\t\tNewdirectory += \"\\\\\" + App->fs->FixName_directory(file);\n\t\t\tApp->Json_seria->SavePrefab(*obj, ((Project*)App->gui->winManager[WindowName::PROJECT])->GetDirectory(), Newdirectory.c_str());\n\n\t\t\tApp->scene->gameobjects.push_back(obj); \/\/ Need cleen\n\t\t\tApp->scene->DeleteGameObject(obj);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tret = false;\n\t\t\tLOG(\"Cannot import this fbx.\");\n\t\t}\n\t\taiReleaseImport(scene);\n\t\tbreak;\n\t}\n\tcase Resource::Type::MATERIAL:\n\t{\n\t\tLOG(\"IMPORTING TEXTURE, File Path: %s\", file);\n\t\t\/\/\n\t\tbool isReImport = false;\n\t\tfor (int i = 0; i < resourcesToReimport.size(); i++)\n\t\t{\n\t\t\tif (strcmp(file, resourcesToReimport[i].directoryObj) == 0)\n\t\t\t{\n\t\t\t\tiMaterial->Import(file, resourcesToReimport[i].uuid);\n\t\t\t\tisReImport = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (isReImport == false)\n\t\t{\n\t\t\tiMaterial->Import(file);\n\t\t}\n\t\tbreak;\n\t}\n\tcase Resource::Type::SCRIPT:\n\t{\n\t\tLOG(\"IMPORTING SCRIPT, File Path: %s\", file);\n\t\t\/\/\n\t\tbool isReImport = false;\n\t\tfor (int i = 0; i < resourcesToReimport.size(); i++)\n\t\t{\n\t\t\tif (strcmp(file, resourcesToReimport[i].directoryObj) == 0)\n\t\t\t{\n\t\t\t\tiScript->Import(file, resourcesToReimport[i].uuid);\n\t\t\t\tisReImport = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (isReImport == false)\n\t\t{\n\t\t\tiScript->Import(file);\n\t\t}\n\t\tbreak;\n\t}\n\tcase Resource::Type::UNKNOWN:\n\t{\n\t\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION, \"UNKNOWN file type dropped on window\",\n\t\t\tfile, App->window->window);\n\t\tLOG(\"UNKNOWN FILE TYPE, File Path: %s\", file);\n\t\tbreak;\n\t}\n\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn true;\n}\n<commit_msg>Removed invalid functions<commit_after>#include \"ModuleImporter.h\"\n#include \"Application.h\"\n#include \"ImportMesh.h\"\n#include \"ImportMaterial.h\"\n#include \"ImportScript.h\"\n#include \"CompMaterial.h\"\n#include \"CompTransform.h\"\n#include \"ModuleFS.h\"\n#include \"ModuleInput.h\"\n#include \"Scene.h\"\n#include \"ModuleGUI.h\"\n#include \"ModuleWindow.h\"\n#include \"JSONSerialization.h\"\n\n#include <direct.h>\n#include <mono\/jit\/jit.h>\n#include <mono\/metadata\/assembly.h>\n#include <mono\/metadata\/mono-config.h>\n\nModuleImporter::ModuleImporter(bool start_enabled) : Module(start_enabled)\n{\n\tAwake_enabled = true;\n\tStart_enabled = true;\n\tpreUpdate_enabled = true;\n\n\tname = \"Importer\";\n}\n\n\nModuleImporter::~ModuleImporter()\n{\n\tRELEASE(iMesh);\n\tRELEASE(iMaterial);\n\tRELEASE(iScript);\n}\n\nbool ModuleImporter::Init(JSON_Object* node)\n{\n\tperf_timer.Start();\n\n\t\/\/ Will contain exe path\n\tHMODULE hModule = GetModuleHandle(NULL);\n\tif (hModule != NULL)\n\t{\n\t\t\/\/ When passing NULL to GetModuleHandle, it returns handle of exe itself\n\t\tGetModuleFileName(hModule, directoryExe, (sizeof(directoryExe)));\n\t}\n\tiMesh = new ImportMesh();\n\tiMaterial = new ImportMaterial();\n\tiScript = new ImportScript();\n\n\tAwake_t = perf_timer.ReadMs();\n\treturn true;\n}\n\nbool ModuleImporter::Start()\n{\n\tperf_timer.Start();\n\n\tstruct aiLogStream stream;\n\tstream = aiGetPredefinedLogStream(aiDefaultLogStream_DEBUGGER, nullptr);\n\taiAttachLogStream(&stream);\n\n\t\/\/ Now InitSystem Domain Mono\n\tif (iScript->InitScriptingSystem())\n\t{\n\t\tLOG(\"Culverin Assembly Init SUCCESS.\");\n\t}\n\telse\n\t{\n\t\tLOG(\"Culverin Assembly Init FAIL.\");\n\t}\n\n\tStart_t = perf_timer.ReadMs();\n\treturn true;\n}\n\nupdate_status ModuleImporter::PreUpdate(float dt)\n{\n\tperf_timer.Start();\n\n\tif (App->input->GetKey(SDL_SCANCODE_B) == KEY_DOWN)\n\t{\n\t\t\/\/ImportMesh* imp = new ImportMesh();\n\t\t\/\/imp->Load(\"Baker_house.rin\");\n\t}\n\n\tpreUpdate_t = perf_timer.ReadMs();\n\treturn UPDATE_CONTINUE;\n}\n\nGameObject* ModuleImporter::ProcessNode(aiNode* node, const aiScene* scene, GameObject* obj)\n{\t\n\tstatic int count = 0;\n\tGameObject* objChild = new GameObject(obj);\n\tobjChild->SetName(App->GetCharfromConstChar(node->mName.C_Str()));\n\n\tCompTransform* trans = (CompTransform*)objChild->AddComponent(C_TRANSFORM);\n\tProcessTransform(node, trans);\n\n\t\/\/ Process all the Node's MESHES\n\tfor (uint i = 0; i < node->mNumMeshes; i++)\n\t{\n\t\tGameObject* newObj = nullptr;\n\n\t\tif (node->mNumMeshes > 1)\n\t\t{\n\t\t\tnewObj = new GameObject(obj);\n\t\t\tstd::string newName = \"Submesh\" + std::to_string(i);\n\t\t\tnewObj->SetName(App->GetCharfromConstChar(newName.c_str()));\n\t\t\tCompTransform* newTrans = (CompTransform*)newObj->AddComponent(C_TRANSFORM);\n\t\t\tProcessTransform(node, newTrans);\n\t\t}\n\n\t\telse\n\t\t{\n\t\t\tnewObj = objChild;\n\t\t}\n\n\t\taiMesh* mesh = scene->mMeshes[node->mMeshes[i]];\n\t\tiMesh->Import(scene, mesh, newObj, node->mName.C_Str());\n\t}\n\n\t\/\/ Process children\n\tfor (uint i = 0; i < node->mNumChildren; i++)\n\t{\n\t\tProcessNode(node->mChildren[i], scene, objChild);\n\t}\n\n\treturn objChild;\n}\n\nGameObject* ModuleImporter::ProcessNode(aiNode* node, const aiScene* scene, GameObject* obj, std::vector<ReImport>& resourcesToReimport)\n{\n\tstatic int count = 0;\n\tGameObject* objChild = new GameObject(obj);\n\tobjChild->SetName(App->GetCharfromConstChar(node->mName.C_Str()));\n\n\tCompTransform* trans = (CompTransform*)objChild->AddComponent(C_TRANSFORM);\n\tProcessTransform(node, trans);\n\n\t\/\/ Process all the Node's MESHES\n\tfor (uint i = 0; i < node->mNumMeshes; i++)\n\t{\n\t\tGameObject* newObj = nullptr;\n\n\t\tif (node->mNumMeshes > 1)\n\t\t{\n\t\t\tnewObj = new GameObject(obj);\n\t\t\tstd::string newName = \"Submesh\" + std::to_string(i);\n\t\t\tnewObj->SetName(App->GetCharfromConstChar(newName.c_str()));\n\t\t\tCompTransform* newTrans = (CompTransform*)newObj->AddComponent(C_TRANSFORM);\n\t\t\tProcessTransform(node, newTrans);\n\t\t}\n\n\t\telse\n\t\t{\n\t\t\tnewObj = objChild;\n\t\t}\n\n\t\taiMesh* mesh = scene->mMeshes[node->mMeshes[i]];\n\t\tbool isReimported = false;\n\t\tfor (int i = 0; i < resourcesToReimport.size(); i++)\n\t\t{\n\t\t\tif (strcmp(node->mName.C_Str(), resourcesToReimport[i].nameMesh) == 0)\n\t\t\t{\n\t\t\t\tiMesh->Import(scene, mesh, newObj, node->mName.C_Str(), resourcesToReimport[i].uuid);\n\t\t\t\tisReimported = true;\n\t\t\t}\n\t\t}\n\t\tif (isReimported == false)\n\t\t{\n\t\t\tiMesh->Import(scene, mesh, newObj, node->mName.C_Str(), 0);\n\t\t}\n\t}\n\n\t\/\/ Process children\n\tfor (uint i = 0; i < node->mNumChildren; i++)\n\t{\n\t\tProcessNode(node->mChildren[i], scene, objChild, resourcesToReimport);\n\t}\n\n\treturn objChild;\n}\n\nvoid ModuleImporter::ProcessTransform(aiNode* node, CompTransform* trans)\n{\n\taiVector3D aiPos;\n\taiQuaternion aiRot;\n\taiVector3D aiScale;\n\taiMatrix4x4 aiMatrix;\n\tfloat4x4 matrix;\n\n\taiMatrix = node->mTransformation;\n\n\tnode->mTransformation.Decompose(aiScale, aiRot, aiPos);\n\n\ttrans->SetPos(float3(aiPos.x, aiPos.y, aiPos.z));\n\ttrans->SetRot(Quat(aiRot.x, aiRot.y, aiRot.z, aiRot.w));\n\ttrans->SetScale(float3(aiScale.x, aiScale.y, aiScale.z));\n\n\ttrans->Enable();\n}\n\nvoid ModuleImporter::ProcessTransform(CompTransform* trans)\n{\n\t\/\/Set all variables to zero\/identity\n\ttrans->ResetMatrix();\n\ttrans->Enable();\n}\n\nbool ModuleImporter::CleanUp()\n{\n\taiDetachAllLogStreams();\n\treturn true;\n}\n\nbool ModuleImporter::Import(const char* file, Resource::Type type)\n{\n\tbool ret = true;\n\n\tswitch (type)\n\t{\n\tcase Resource::Type::MESH:\n\t{\n\t\tLOG(\"IMPORTING MODEL, File Path: %s\", file);\n\n\t\t\/\/Clear vector of textures, but dont import same textures!\n\t\t\/\/iMesh->PrepareToImport();\n\t\tconst aiScene* scene = aiImportFile(file, aiProcessPreset_TargetRealtime_MaxQuality);\n\t\tif (scene != nullptr)\n\t\t{\n\t\t\tGameObject* obj = ProcessNode(scene->mRootNode, scene, nullptr);\n\t\t\tobj->SetName(App->GetCharfromConstChar(App->fs->FixName_directory(file).c_str()));\n\n\t\t\t\/\/Now Save Serialitzate OBJ -> Prefab\n\t\t\tstd::string Newdirectory = ((Project*)App->gui->winManager[WindowName::PROJECT])->GetDirectory();\n\t\t\tNewdirectory += \"\\\\\" + App->fs->FixName_directory(file);\n\t\t\tApp->Json_seria->SavePrefab(*obj, ((Project*)App->gui->winManager[WindowName::PROJECT])->GetDirectory(), Newdirectory.c_str());\n\n\t\t\t\/\/App->scene->gameobjects.push_back(obj);\n\t\t\tApp->scene->DeleteGameObject(obj);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tret = false;\n\t\t\tLOG(\"Cannot import this fbx.\");\n\t\t}\n\t\taiReleaseImport(scene);\n\t\tbreak;\n\t}\n\tcase Resource::Type::MATERIAL:\n\t{\n\t\tLOG(\"IMPORTING TEXTURE, File Path: %s\", file);\n\t\tiMaterial->Import(file);\n\n\t\tbreak;\n\t}\n\tcase Resource::Type::SCRIPT:\n\t{\n\t\tLOG(\"IMPORTING SCRIPT, File Path: %s\", file);\n\t\tiScript->Import(file);\n\n\t\tbreak;\n\t}\n\tcase Resource::Type::UNKNOWN:\n\t{\n\t\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION, \"UNKNOWN file type dropped on window\",\n\t\t\tfile, App->window->window);\n\t\tLOG(\"UNKNOWN FILE TYPE, File Path: %s\", file);\n\t\tbreak;\n\t}\n\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn true;\n}\n\nbool ModuleImporter::Import(const char* file, Resource::Type type, std::vector<ReImport>& resourcesToReimport)\n{\n\tbool ret = true;\n\n\tswitch (type)\n\t{\n\tcase Resource::Type::MESH:\n\t{\n\t\tLOG(\"IMPORTING MODEL, File Path: %s\", file);\n\n\t\t\/\/Clear vector of textures, but dont import same textures!\n\t\t\/\/iMesh->PrepareToImport();\n\t\tconst aiScene* scene = aiImportFile(file, aiProcessPreset_TargetRealtime_MaxQuality);\n\t\tif (scene != nullptr)\n\t\t{\n\t\t\tGameObject* obj = ProcessNode(scene->mRootNode, scene, nullptr, resourcesToReimport);\n\t\t\tobj->SetName(App->GetCharfromConstChar(App->fs->FixName_directory(file).c_str()));\n\n\t\t\t\/\/Now Save Serialitzate OBJ -> Prefab\n\t\t\tstd::string Newdirectory = ((Project*)App->gui->winManager[WindowName::PROJECT])->GetDirectory();\n\t\t\tNewdirectory += \"\\\\\" + App->fs->FixName_directory(file);\n\t\t\tApp->Json_seria->SavePrefab(*obj, ((Project*)App->gui->winManager[WindowName::PROJECT])->GetDirectory(), Newdirectory.c_str());\n\n\t\t\tApp->scene->gameobjects.push_back(obj); \/\/ Need cleen\n\t\t\tApp->scene->DeleteGameObject(obj);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tret = false;\n\t\t\tLOG(\"Cannot import this fbx.\");\n\t\t}\n\t\taiReleaseImport(scene);\n\t\tbreak;\n\t}\n\tcase Resource::Type::MATERIAL:\n\t{\n\t\tLOG(\"IMPORTING TEXTURE, File Path: %s\", file);\n\t\t\/\/\n\t\tbool isReImport = false;\n\t\tfor (int i = 0; i < resourcesToReimport.size(); i++)\n\t\t{\n\t\t\tif (strcmp(file, resourcesToReimport[i].directoryObj) == 0)\n\t\t\t{\n\t\t\t\tiMaterial->Import(file, resourcesToReimport[i].uuid);\n\t\t\t\tisReImport = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (isReImport == false)\n\t\t{\n\t\t\tiMaterial->Import(file);\n\t\t}\n\t\tbreak;\n\t}\n\tcase Resource::Type::SCRIPT:\n\t{\n\t\tLOG(\"IMPORTING SCRIPT, File Path: %s\", file);\n\t\t\/\/\n\t\tbool isReImport = false;\n\t\tfor (int i = 0; i < resourcesToReimport.size(); i++)\n\t\t{\n\t\t\tif (strcmp(file, resourcesToReimport[i].directoryObj) == 0)\n\t\t\t{\n\t\t\t\tiScript->Import(file, resourcesToReimport[i].uuid);\n\t\t\t\tisReImport = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (isReImport == false)\n\t\t{\n\t\t\tiScript->Import(file);\n\t\t}\n\t\tbreak;\n\t}\n\tcase Resource::Type::UNKNOWN:\n\t{\n\t\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION, \"UNKNOWN file type dropped on window\",\n\t\t\tfile, App->window->window);\n\t\tLOG(\"UNKNOWN FILE TYPE, File Path: %s\", file);\n\t\tbreak;\n\t}\n\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 Cloudflare, Inc. and contributors\n\/\/ Licensed under the MIT License:\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#if KJ_HAS_ZLIB\n\n#include \"gzip.h\"\n#include <kj\/debug.h>\n\nnamespace kj {\n\nnamespace _ {  \/\/ private\n\nGzipOutputContext::GzipOutputContext(kj::Maybe<int> compressionLevel) {\n  int initResult;\n\n  KJ_IF_MAYBE(level, compressionLevel) {\n    compressing = true;\n    initResult =\n      deflateInit2(&ctx, *level, Z_DEFLATED,\n                   15 + 16,  \/\/ windowBits = 15 (maximum) + magic value 16 to ask for gzip.\n                   8,        \/\/ memLevel = 8 (the default)\n                   Z_DEFAULT_STRATEGY);\n  } else {\n    compressing = false;\n    initResult = inflateInit2(&ctx, 15 + 16);\n  }\n\n  if (initResult != Z_OK) {\n    fail(initResult);\n  }\n}\n\nGzipOutputContext::~GzipOutputContext() noexcept(false) {\n  compressing ? deflateEnd(&ctx) : inflateEnd(&ctx);\n}\n\nvoid GzipOutputContext::setInput(const void* in, size_t size) {\n  ctx.next_in = const_cast<byte*>(reinterpret_cast<const byte*>(in));\n  ctx.avail_in = size;\n}\n\nkj::Tuple<bool, kj::ArrayPtr<const byte>> GzipOutputContext::pumpOnce(int flush) {\n  ctx.next_out = buffer;\n  ctx.avail_out = sizeof(buffer);\n\n  auto result = compressing ? deflate(&ctx, flush) : inflate(&ctx, flush);\n  if (result != Z_OK && result != Z_BUF_ERROR && result != Z_STREAM_END) {\n    fail(result);\n  }\n\n  \/\/ - Z_STREAM_END means we have finished the stream successfully.\n  \/\/ - Z_BUF_ERROR means we didn't have any more input to process\n  \/\/   (but still have to make a call to write to potentially flush data).\n  return kj::tuple(result == Z_OK, kj::arrayPtr(buffer, sizeof(buffer) - ctx.avail_out));\n}\n\nvoid GzipOutputContext::fail(int result) {\n  auto header = compressing ? \"gzip compression failed\" : \"gzip decompression failed\";\n  if (ctx.msg == nullptr) {\n    KJ_FAIL_REQUIRE(header, result);\n  } else {\n    KJ_FAIL_REQUIRE(header, ctx.msg);\n  }\n}\n\n}  \/\/ namespace _ (private)\n\nGzipInputStream::GzipInputStream(InputStream& inner)\n    : inner(inner) {\n  \/\/ windowBits = 15 (maximum) + magic value 16 to ask for gzip.\n  KJ_ASSERT(inflateInit2(&ctx, 15 + 16) == Z_OK);\n}\n\nGzipInputStream::~GzipInputStream() noexcept(false) {\n  inflateEnd(&ctx);\n}\n\nsize_t GzipInputStream::tryRead(void* out, size_t minBytes, size_t maxBytes) {\n  if (maxBytes == 0) return size_t(0);\n\n  return readImpl(reinterpret_cast<byte*>(out), minBytes, maxBytes, 0);\n}\n\nsize_t GzipInputStream::readImpl(\n    byte* out, size_t minBytes, size_t maxBytes, size_t alreadyRead) {\n  if (ctx.avail_in == 0) {\n    size_t amount = inner.tryRead(buffer, 1, sizeof(buffer));\n    if (amount == 0) {\n      if (!atValidEndpoint) {\n        KJ_FAIL_REQUIRE(\"gzip compressed stream ended prematurely\");\n      }\n      return alreadyRead;\n    } else {\n      ctx.next_in = buffer;\n      ctx.avail_in = amount;\n    }\n  }\n\n  ctx.next_out = reinterpret_cast<byte*>(out);\n  ctx.avail_out = maxBytes;\n\n  auto inflateResult = inflate(&ctx, Z_NO_FLUSH);\n  atValidEndpoint = inflateResult == Z_STREAM_END;\n  if (inflateResult == Z_OK || inflateResult == Z_STREAM_END) {\n    if (atValidEndpoint && ctx.avail_in > 0) {\n      \/\/ There's more data available. Assume start of new content.\n      KJ_ASSERT(inflateReset(&ctx) == Z_OK);\n    }\n\n    size_t n = maxBytes - ctx.avail_out;\n    if (n >= minBytes) {\n      return n + alreadyRead;\n    } else {\n      return readImpl(out + n, minBytes - n, maxBytes - n, alreadyRead + n);\n    }\n  } else {\n    if (ctx.msg == nullptr) {\n      KJ_FAIL_REQUIRE(\"gzip decompression failed\", inflateResult);\n    } else {\n      KJ_FAIL_REQUIRE(\"gzip decompression failed\", ctx.msg);\n    }\n  }\n}\n\n\/\/ =======================================================================================\n\nGzipOutputStream::GzipOutputStream(OutputStream& inner, int compressionLevel)\n    : inner(inner), ctx(compressionLevel) {}\n\nGzipOutputStream::GzipOutputStream(OutputStream& inner, decltype(DECOMPRESS))\n    : inner(inner), ctx(nullptr) {}\n\nGzipOutputStream::~GzipOutputStream() noexcept(false) {\n  pump(Z_FINISH);\n}\n\nvoid GzipOutputStream::write(const void* in, size_t size) {\n  ctx.setInput(in, size);\n  pump(Z_NO_FLUSH);\n}\n\nvoid GzipOutputStream::pump(int flush) {\n  bool ok;\n  do {\n    auto result = ctx.pumpOnce(flush);\n    ok = get<0>(result);\n    auto chunk = get<1>(result);\n    inner.write(chunk.begin(), chunk.size());\n  } while (ok);\n}\n\n\/\/ =======================================================================================\n\nGzipAsyncInputStream::GzipAsyncInputStream(AsyncInputStream& inner)\n    : inner(inner) {\n  \/\/ windowBits = 15 (maximum) + magic value 16 to ask for gzip.\n  KJ_ASSERT(inflateInit2(&ctx, 15 + 16) == Z_OK);\n}\n\nGzipAsyncInputStream::~GzipAsyncInputStream() noexcept(false) {\n  inflateEnd(&ctx);\n}\n\nPromise<size_t> GzipAsyncInputStream::tryRead(void* out, size_t minBytes, size_t maxBytes) {\n  if (maxBytes == 0) return size_t(0);\n\n  return readImpl(reinterpret_cast<byte*>(out), minBytes, maxBytes, 0);\n}\n\nPromise<size_t> GzipAsyncInputStream::readImpl(\n    byte* out, size_t minBytes, size_t maxBytes, size_t alreadyRead) {\n  if (ctx.avail_in == 0) {\n    return inner.tryRead(buffer, 1, sizeof(buffer))\n        .then([this,out,minBytes,maxBytes,alreadyRead](size_t amount) -> Promise<size_t> {\n      if (amount == 0) {\n        if (!atValidEndpoint) {\n          return KJ_EXCEPTION(DISCONNECTED, \"gzip compressed stream ended prematurely\");\n        }\n        return alreadyRead;\n      } else {\n        ctx.next_in = buffer;\n        ctx.avail_in = amount;\n        return readImpl(out, minBytes, maxBytes, alreadyRead);\n      }\n    });\n  }\n\n  ctx.next_out = reinterpret_cast<byte*>(out);\n  ctx.avail_out = maxBytes;\n\n  auto inflateResult = inflate(&ctx, Z_NO_FLUSH);\n  atValidEndpoint = inflateResult == Z_STREAM_END;\n  if (inflateResult == Z_OK || inflateResult == Z_STREAM_END) {\n    if (atValidEndpoint && ctx.avail_in > 0) {\n      \/\/ There's more data available. Assume start of new content.\n      KJ_ASSERT(inflateReset(&ctx) == Z_OK);\n    }\n\n    size_t n = maxBytes - ctx.avail_out;\n    if (n >= minBytes) {\n      return n + alreadyRead;\n    } else {\n      return readImpl(out + n, minBytes - n, maxBytes - n, alreadyRead + n);\n    }\n  } else {\n    if (ctx.msg == nullptr) {\n      KJ_FAIL_REQUIRE(\"gzip decompression failed\", inflateResult);\n    } else {\n      KJ_FAIL_REQUIRE(\"gzip decompression failed\", ctx.msg);\n    }\n  }\n}\n\n\/\/ =======================================================================================\n\nGzipAsyncOutputStream::GzipAsyncOutputStream(AsyncOutputStream& inner, int compressionLevel)\n    : inner(inner), ctx(compressionLevel) {}\n\nGzipAsyncOutputStream::GzipAsyncOutputStream(AsyncOutputStream& inner, decltype(DECOMPRESS))\n    : inner(inner), ctx(nullptr) {}\n\nPromise<void> GzipAsyncOutputStream::write(const void* in, size_t size) {\n  ctx.setInput(in, size);\n  return pump(Z_NO_FLUSH);\n}\n\nPromise<void> GzipAsyncOutputStream::write(ArrayPtr<const ArrayPtr<const byte>> pieces) {\n  if (pieces.size() == 0) return kj::READY_NOW;\n  return write(pieces[0].begin(), pieces[0].size())\n      .then([this,pieces]() {\n    return write(pieces.slice(1, pieces.size()));\n  });\n}\n\nkj::Promise<void> GzipAsyncOutputStream::pump(int flush) {\n  auto result = ctx.pumpOnce(flush);\n  auto ok = get<0>(result);\n  auto chunk = get<1>(result);\n  auto promise = inner.write(chunk.begin(), chunk.size());\n  if (ok) {\n    promise = promise.then([this, flush]() { return pump(flush); });\n  }\n  return promise;\n}\n\n}  \/\/ namespace kj\n\n#endif  \/\/ KJ_HAS_ZLIB\n<commit_msg>Don't make zero-length writes from gzip streams.<commit_after>\/\/ Copyright (c) 2017 Cloudflare, Inc. and contributors\n\/\/ Licensed under the MIT License:\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#if KJ_HAS_ZLIB\n\n#include \"gzip.h\"\n#include <kj\/debug.h>\n\nnamespace kj {\n\nnamespace _ {  \/\/ private\n\nGzipOutputContext::GzipOutputContext(kj::Maybe<int> compressionLevel) {\n  int initResult;\n\n  KJ_IF_MAYBE(level, compressionLevel) {\n    compressing = true;\n    initResult =\n      deflateInit2(&ctx, *level, Z_DEFLATED,\n                   15 + 16,  \/\/ windowBits = 15 (maximum) + magic value 16 to ask for gzip.\n                   8,        \/\/ memLevel = 8 (the default)\n                   Z_DEFAULT_STRATEGY);\n  } else {\n    compressing = false;\n    initResult = inflateInit2(&ctx, 15 + 16);\n  }\n\n  if (initResult != Z_OK) {\n    fail(initResult);\n  }\n}\n\nGzipOutputContext::~GzipOutputContext() noexcept(false) {\n  compressing ? deflateEnd(&ctx) : inflateEnd(&ctx);\n}\n\nvoid GzipOutputContext::setInput(const void* in, size_t size) {\n  ctx.next_in = const_cast<byte*>(reinterpret_cast<const byte*>(in));\n  ctx.avail_in = size;\n}\n\nkj::Tuple<bool, kj::ArrayPtr<const byte>> GzipOutputContext::pumpOnce(int flush) {\n  ctx.next_out = buffer;\n  ctx.avail_out = sizeof(buffer);\n\n  auto result = compressing ? deflate(&ctx, flush) : inflate(&ctx, flush);\n  if (result != Z_OK && result != Z_BUF_ERROR && result != Z_STREAM_END) {\n    fail(result);\n  }\n\n  \/\/ - Z_STREAM_END means we have finished the stream successfully.\n  \/\/ - Z_BUF_ERROR means we didn't have any more input to process\n  \/\/   (but still have to make a call to write to potentially flush data).\n  return kj::tuple(result == Z_OK, kj::arrayPtr(buffer, sizeof(buffer) - ctx.avail_out));\n}\n\nvoid GzipOutputContext::fail(int result) {\n  auto header = compressing ? \"gzip compression failed\" : \"gzip decompression failed\";\n  if (ctx.msg == nullptr) {\n    KJ_FAIL_REQUIRE(header, result);\n  } else {\n    KJ_FAIL_REQUIRE(header, ctx.msg);\n  }\n}\n\n}  \/\/ namespace _ (private)\n\nGzipInputStream::GzipInputStream(InputStream& inner)\n    : inner(inner) {\n  \/\/ windowBits = 15 (maximum) + magic value 16 to ask for gzip.\n  KJ_ASSERT(inflateInit2(&ctx, 15 + 16) == Z_OK);\n}\n\nGzipInputStream::~GzipInputStream() noexcept(false) {\n  inflateEnd(&ctx);\n}\n\nsize_t GzipInputStream::tryRead(void* out, size_t minBytes, size_t maxBytes) {\n  if (maxBytes == 0) return size_t(0);\n\n  return readImpl(reinterpret_cast<byte*>(out), minBytes, maxBytes, 0);\n}\n\nsize_t GzipInputStream::readImpl(\n    byte* out, size_t minBytes, size_t maxBytes, size_t alreadyRead) {\n  if (ctx.avail_in == 0) {\n    size_t amount = inner.tryRead(buffer, 1, sizeof(buffer));\n    if (amount == 0) {\n      if (!atValidEndpoint) {\n        KJ_FAIL_REQUIRE(\"gzip compressed stream ended prematurely\");\n      }\n      return alreadyRead;\n    } else {\n      ctx.next_in = buffer;\n      ctx.avail_in = amount;\n    }\n  }\n\n  ctx.next_out = reinterpret_cast<byte*>(out);\n  ctx.avail_out = maxBytes;\n\n  auto inflateResult = inflate(&ctx, Z_NO_FLUSH);\n  atValidEndpoint = inflateResult == Z_STREAM_END;\n  if (inflateResult == Z_OK || inflateResult == Z_STREAM_END) {\n    if (atValidEndpoint && ctx.avail_in > 0) {\n      \/\/ There's more data available. Assume start of new content.\n      KJ_ASSERT(inflateReset(&ctx) == Z_OK);\n    }\n\n    size_t n = maxBytes - ctx.avail_out;\n    if (n >= minBytes) {\n      return n + alreadyRead;\n    } else {\n      return readImpl(out + n, minBytes - n, maxBytes - n, alreadyRead + n);\n    }\n  } else {\n    if (ctx.msg == nullptr) {\n      KJ_FAIL_REQUIRE(\"gzip decompression failed\", inflateResult);\n    } else {\n      KJ_FAIL_REQUIRE(\"gzip decompression failed\", ctx.msg);\n    }\n  }\n}\n\n\/\/ =======================================================================================\n\nGzipOutputStream::GzipOutputStream(OutputStream& inner, int compressionLevel)\n    : inner(inner), ctx(compressionLevel) {}\n\nGzipOutputStream::GzipOutputStream(OutputStream& inner, decltype(DECOMPRESS))\n    : inner(inner), ctx(nullptr) {}\n\nGzipOutputStream::~GzipOutputStream() noexcept(false) {\n  pump(Z_FINISH);\n}\n\nvoid GzipOutputStream::write(const void* in, size_t size) {\n  ctx.setInput(in, size);\n  pump(Z_NO_FLUSH);\n}\n\nvoid GzipOutputStream::pump(int flush) {\n  bool ok;\n  do {\n    auto result = ctx.pumpOnce(flush);\n    ok = get<0>(result);\n    auto chunk = get<1>(result);\n    if (chunk.size() > 0) {\n      inner.write(chunk.begin(), chunk.size());\n    }\n  } while (ok);\n}\n\n\/\/ =======================================================================================\n\nGzipAsyncInputStream::GzipAsyncInputStream(AsyncInputStream& inner)\n    : inner(inner) {\n  \/\/ windowBits = 15 (maximum) + magic value 16 to ask for gzip.\n  KJ_ASSERT(inflateInit2(&ctx, 15 + 16) == Z_OK);\n}\n\nGzipAsyncInputStream::~GzipAsyncInputStream() noexcept(false) {\n  inflateEnd(&ctx);\n}\n\nPromise<size_t> GzipAsyncInputStream::tryRead(void* out, size_t minBytes, size_t maxBytes) {\n  if (maxBytes == 0) return size_t(0);\n\n  return readImpl(reinterpret_cast<byte*>(out), minBytes, maxBytes, 0);\n}\n\nPromise<size_t> GzipAsyncInputStream::readImpl(\n    byte* out, size_t minBytes, size_t maxBytes, size_t alreadyRead) {\n  if (ctx.avail_in == 0) {\n    return inner.tryRead(buffer, 1, sizeof(buffer))\n        .then([this,out,minBytes,maxBytes,alreadyRead](size_t amount) -> Promise<size_t> {\n      if (amount == 0) {\n        if (!atValidEndpoint) {\n          return KJ_EXCEPTION(DISCONNECTED, \"gzip compressed stream ended prematurely\");\n        }\n        return alreadyRead;\n      } else {\n        ctx.next_in = buffer;\n        ctx.avail_in = amount;\n        return readImpl(out, minBytes, maxBytes, alreadyRead);\n      }\n    });\n  }\n\n  ctx.next_out = reinterpret_cast<byte*>(out);\n  ctx.avail_out = maxBytes;\n\n  auto inflateResult = inflate(&ctx, Z_NO_FLUSH);\n  atValidEndpoint = inflateResult == Z_STREAM_END;\n  if (inflateResult == Z_OK || inflateResult == Z_STREAM_END) {\n    if (atValidEndpoint && ctx.avail_in > 0) {\n      \/\/ There's more data available. Assume start of new content.\n      KJ_ASSERT(inflateReset(&ctx) == Z_OK);\n    }\n\n    size_t n = maxBytes - ctx.avail_out;\n    if (n >= minBytes) {\n      return n + alreadyRead;\n    } else {\n      return readImpl(out + n, minBytes - n, maxBytes - n, alreadyRead + n);\n    }\n  } else {\n    if (ctx.msg == nullptr) {\n      KJ_FAIL_REQUIRE(\"gzip decompression failed\", inflateResult);\n    } else {\n      KJ_FAIL_REQUIRE(\"gzip decompression failed\", ctx.msg);\n    }\n  }\n}\n\n\/\/ =======================================================================================\n\nGzipAsyncOutputStream::GzipAsyncOutputStream(AsyncOutputStream& inner, int compressionLevel)\n    : inner(inner), ctx(compressionLevel) {}\n\nGzipAsyncOutputStream::GzipAsyncOutputStream(AsyncOutputStream& inner, decltype(DECOMPRESS))\n    : inner(inner), ctx(nullptr) {}\n\nPromise<void> GzipAsyncOutputStream::write(const void* in, size_t size) {\n  ctx.setInput(in, size);\n  return pump(Z_NO_FLUSH);\n}\n\nPromise<void> GzipAsyncOutputStream::write(ArrayPtr<const ArrayPtr<const byte>> pieces) {\n  if (pieces.size() == 0) return kj::READY_NOW;\n  return write(pieces[0].begin(), pieces[0].size())\n      .then([this,pieces]() {\n    return write(pieces.slice(1, pieces.size()));\n  });\n}\n\nkj::Promise<void> GzipAsyncOutputStream::pump(int flush) {\n  auto result = ctx.pumpOnce(flush);\n  auto ok = get<0>(result);\n  auto chunk = get<1>(result);\n\n  if (chunk.size() == 0) {\n    if (ok) {\n      return pump(flush);\n    } else {\n      return kj::READY_NOW;\n    }\n  } else {\n    auto promise = inner.write(chunk.begin(), chunk.size());\n    if (ok) {\n      promise = promise.then([this, flush]() { return pump(flush); });\n    }\n    return promise;\n  }\n}\n\n}  \/\/ namespace kj\n\n#endif  \/\/ KJ_HAS_ZLIB\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (C) 2015 German Aerospace Center (DLR\/SC)\n*\n* Created: 2015-10-21 Jonas Jepsen <Jonas.Jepsen@dlr.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\/**\n* @file\n* @brief  Implementation of CPACS wing handling routines.\n*\/\n\n#include <iostream>\n#include <algorithm>\n\n#include \"CCPACSGenericSystem.h\"\n#include \"CCPACSConfiguration.h\"\n#include \"CTiglError.h\"\n#include \"tiglcommonfunctions.h\"\n#include \"CNamedShape.h\"\n\n#include \"BRepBuilderAPI_GTransform.hxx\"\n#include <BRepPrimAPI_MakeCylinder.hxx>\n#include <BRepPrimAPI_MakeSphere.hxx>\n#include <BRepPrimAPI_MakeCone.hxx>\n#include <BRepPrimAPI_MakeBox.hxx>\n\nnamespace tigl\n{\n\n\/\/ Constructor\nCCPACSGenericSystem::CCPACSGenericSystem(CCPACSConfiguration* config)\n    : CTiglRelativelyPositionedComponent(NULL, &transformation, &symmetryAxis), transformation(config ? &config->GetUIDManager() : NULL), configuration(config)\n{\n    Cleanup();\n}\n\n\/\/ Destructor\nCCPACSGenericSystem::~CCPACSGenericSystem()\n{\n    Cleanup();\n}\n\nconst std::string& CCPACSGenericSystem::GetUID() const {\n    return uid;\n}\n\nvoid CCPACSGenericSystem::SetUID(const std::string& uid) {\n    if (configuration) {\n        configuration->GetUIDManager().TryRemoveGeometricComponent(this->uid);\n        configuration->GetUIDManager().AddGeometricComponent(uid, this);\n    }\n    this->uid = uid;\n}\n\nstd::string CCPACSGenericSystem::GetDefaultedUID() const {\n    return uid;\n}\n\n\/\/ Invalidates internal state\nvoid CCPACSGenericSystem::Invalidate()\n{\n    invalidated = true;\n}\n\n\/\/ Cleanup routine\nvoid CCPACSGenericSystem::Cleanup()\n{\n    name = \"\";\n    transformation.reset();\n\n    \/\/ Calls ITiglGeometricComponent interface Reset to delete e.g. all childs.\n    Reset();\n\n    Invalidate();\n}\n\n\/\/ Update internal generic system data\nvoid CCPACSGenericSystem::Update()\n{\n    if (!invalidated) {\n        return;\n    }\n\n    transformation.updateMatrix();\n    invalidated = false;\n}\n\n\/\/ Read CPACS generic system element\nvoid CCPACSGenericSystem::ReadCPACS(TixiDocumentHandle tixiHandle, const std::string& genericSysXPath)\n{\n    Cleanup();\n\n    char*       elementPath;\n    std::string tempString;\n\n    \/\/ Get subelement \"name\"\n    char* ptrName = NULL;\n    tempString    = genericSysXPath + \"\/name\";\n    elementPath   = const_cast<char*>(tempString.c_str());\n    if (tixiGetTextElement(tixiHandle, elementPath, &ptrName) == SUCCESS) {\n        name          = ptrName;\n    }\n\n    \/\/ Get subelement \"geometricBaseType\"\n    char* ptrBaseType = NULL;\n    tempString    = genericSysXPath + \"\/geometricBaseType\";\n    elementPath   = const_cast<char*>(tempString.c_str());\n    if (tixiGetTextElement(tixiHandle, elementPath, &ptrBaseType) == SUCCESS) {\n        geometricBaseType = ptrBaseType;\n\n        \/\/ check validity of type\n        if (geometricBaseType != \"cylinder\" && geometricBaseType != \"sphere\" && geometricBaseType != \"cone\" && geometricBaseType != \"cube\") {\n            throw CTiglError(\"Invalid geometry base type: \" + geometricBaseType, TIGL_XML_ERROR);\n        }\n    }\n\n    \/\/ Get attribute \"uid\"\n    char* ptrUID = NULL;\n    tempString   = \"uID\";\n    elementPath  = const_cast<char*>(tempString.c_str());\n    if (tixiGetTextAttribute(tixiHandle, const_cast<char*>(genericSysXPath.c_str()), const_cast<char*>(tempString.c_str()), &ptrUID) == SUCCESS) {\n        SetUID(ptrUID);\n    }\n\n    \/\/ Get Transformation\n    transformation.ReadCPACS(tixiHandle, genericSysXPath);\n\n    \/\/ Register ourself at the unique id manager\n    if (configuration) {\n        configuration->GetUIDManager().AddGeometricComponent(ptrUID, this);\n    }\n\n    \/\/ Get symmetry axis attribute\n    char* ptrSym = NULL;\n    tempString   = \"symmetry\";\n    if (tixiGetTextAttribute(tixiHandle, const_cast<char*>(genericSysXPath.c_str()), const_cast<char*>(tempString.c_str()), &ptrSym) == SUCCESS) {\n        SetSymmetryAxis(stringToTiglSymmetryAxis(ptrSym));\n    }\n\n    Update();\n}\n\n\/\/ Returns the name of the generic system\nconst std::string& CCPACSGenericSystem::GetName() const\n{\n    return name;\n}\n\n\/\/ Returns the parent configuration\nCCPACSConfiguration& CCPACSGenericSystem::GetConfiguration() const\n{\n    return *configuration;\n}\n\n\/\/ build loft\nPNamedShape CCPACSGenericSystem::BuildLoft()\n{\n    TopoDS_Shape sysShape;\n    if (geometricBaseType == \"cylinder\") {\n        BRepPrimAPI_MakeCylinder cyl(0.5, 1);\n        gp_Vec vec(0, 0, -0.5);\n        gp_Trsf trsf = gp_Trsf();\n        trsf.SetTranslation(vec);\n        TopLoc_Location loc(trsf);\n        sysShape = cyl.Shape();\n        sysShape.Location(loc);\n    }\n    else if (geometricBaseType == \"sphere\") {\n        BRepPrimAPI_MakeSphere sph(0.5);\n        sysShape = sph.Shape();\n    }\n    else if (geometricBaseType == \"cone\") {\n        BRepPrimAPI_MakeCone cone(0.5, 0, 1);\n        gp_Vec vec(0, 0, -0.5);\n        gp_Trsf trsf = gp_Trsf();\n        trsf.SetTranslation(vec);\n        TopLoc_Location loc(trsf);\n        sysShape = cone.Shape();\n        sysShape.Location(loc);\n    }\n    else if (geometricBaseType == \"cube\") {\n        gp_Pnt p1(-0.5, -0.5, -0.5);\n        gp_Pnt p2(0.5, 0.5, 0.5);\n        BRepPrimAPI_MakeBox cube(p1, p2);\n        sysShape = cube.Shape();\n    }\n\n    sysShape = GetTransformationMatrix().Transform(sysShape);\n    std::string loftName = GetUID();\n    std::string loftShortName = GetShortShapeName();\n    PNamedShape loft(new CNamedShape(sysShape, loftName.c_str(), loftShortName.c_str()));\n\n    return loft;\n}\n\n\/\/ get short name for loft\nstd::string CCPACSGenericSystem::GetShortShapeName()\n{\n    unsigned int gsindex = 0;\n    for (int i = 1; i <= GetConfiguration().GetGenericSystemCount(); ++i) {\n        tigl::CCPACSGenericSystem& gs = GetConfiguration().GetGenericSystem(i);\n        if (GetUID() == gs.GetUID()) {\n            gsindex = i;\n            std::stringstream shortName;\n            shortName << \"GS\" << gsindex;\n            return shortName.str();\n        }\n    }\n    return \"UNKNOWN\";\n}\n\n\/\/ Sets the Transformation object\nvoid CCPACSGenericSystem::Translate(CTiglPoint trans)\n{\n    CTiglRelativelyPositionedComponent::Translate(trans);\n    invalidated = true;\n    Update();\n}\n\n} \/\/ end namespace tigl\n<commit_msg>Fixed opening of files with generic systems<commit_after>\/*\n* Copyright (C) 2015 German Aerospace Center (DLR\/SC)\n*\n* Created: 2015-10-21 Jonas Jepsen <Jonas.Jepsen@dlr.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\/**\n* @file\n* @brief  Implementation of CPACS wing handling routines.\n*\/\n\n#include <iostream>\n#include <algorithm>\n\n#include \"CCPACSGenericSystem.h\"\n#include \"CCPACSConfiguration.h\"\n#include \"CTiglError.h\"\n#include \"tiglcommonfunctions.h\"\n#include \"CNamedShape.h\"\n\n#include \"BRepBuilderAPI_GTransform.hxx\"\n#include <BRepPrimAPI_MakeCylinder.hxx>\n#include <BRepPrimAPI_MakeSphere.hxx>\n#include <BRepPrimAPI_MakeCone.hxx>\n#include <BRepPrimAPI_MakeBox.hxx>\n\nnamespace tigl\n{\n\n\/\/ Constructor\nCCPACSGenericSystem::CCPACSGenericSystem(CCPACSConfiguration* config)\n    : CTiglRelativelyPositionedComponent(NULL, &transformation, &symmetryAxis), transformation(config ? &config->GetUIDManager() : NULL), configuration(config)\n{\n    Cleanup();\n}\n\n\/\/ Destructor\nCCPACSGenericSystem::~CCPACSGenericSystem()\n{\n    Cleanup();\n}\n\nconst std::string& CCPACSGenericSystem::GetUID() const {\n    return uid;\n}\n\nvoid CCPACSGenericSystem::SetUID(const std::string& uid) {\n    if (configuration) {\n        configuration->GetUIDManager().TryRemoveGeometricComponent(this->uid);\n        configuration->GetUIDManager().AddGeometricComponent(uid, this);\n    }\n    this->uid = uid;\n}\n\nstd::string CCPACSGenericSystem::GetDefaultedUID() const {\n    return uid;\n}\n\n\/\/ Invalidates internal state\nvoid CCPACSGenericSystem::Invalidate()\n{\n    invalidated = true;\n}\n\n\/\/ Cleanup routine\nvoid CCPACSGenericSystem::Cleanup()\n{\n    name = \"\";\n    transformation.reset();\n\n    \/\/ Calls ITiglGeometricComponent interface Reset to delete e.g. all childs.\n    Reset();\n\n    Invalidate();\n}\n\n\/\/ Update internal generic system data\nvoid CCPACSGenericSystem::Update()\n{\n    if (!invalidated) {\n        return;\n    }\n\n    transformation.updateMatrix();\n    invalidated = false;\n}\n\n\/\/ Read CPACS generic system element\nvoid CCPACSGenericSystem::ReadCPACS(TixiDocumentHandle tixiHandle, const std::string& genericSysXPath)\n{\n    Cleanup();\n\n    char*       elementPath;\n    std::string tempString;\n\n    \/\/ Get subelement \"name\"\n    char* ptrName = NULL;\n    tempString    = genericSysXPath + \"\/name\";\n    elementPath   = const_cast<char*>(tempString.c_str());\n    if (tixiGetTextElement(tixiHandle, elementPath, &ptrName) == SUCCESS) {\n        name          = ptrName;\n    }\n\n    \/\/ Get subelement \"geometricBaseType\"\n    char* ptrBaseType = NULL;\n    tempString    = genericSysXPath + \"\/geometricBaseType\";\n    elementPath   = const_cast<char*>(tempString.c_str());\n    if (tixiGetTextElement(tixiHandle, elementPath, &ptrBaseType) == SUCCESS) {\n        geometricBaseType = ptrBaseType;\n\n        \/\/ check validity of type\n        if (geometricBaseType != \"cylinder\" && geometricBaseType != \"sphere\" && geometricBaseType != \"cone\" && geometricBaseType != \"cube\") {\n            throw CTiglError(\"Invalid geometry base type: \" + geometricBaseType, TIGL_XML_ERROR);\n        }\n    }\n\n    \/\/ Get attribute \"uid\"\n    char* ptrUID = NULL;\n    tempString   = \"uID\";\n    elementPath  = const_cast<char*>(tempString.c_str());\n    if (tixiGetTextAttribute(tixiHandle, const_cast<char*>(genericSysXPath.c_str()), const_cast<char*>(tempString.c_str()), &ptrUID) == SUCCESS) {\n        SetUID(ptrUID);\n    }\n\n    \/\/ Get Transformation\n    transformation.ReadCPACS(tixiHandle, genericSysXPath);\n\n    \/\/ Get symmetry axis attribute\n    char* ptrSym = NULL;\n    tempString   = \"symmetry\";\n    if (tixiGetTextAttribute(tixiHandle, const_cast<char*>(genericSysXPath.c_str()), const_cast<char*>(tempString.c_str()), &ptrSym) == SUCCESS) {\n        SetSymmetryAxis(stringToTiglSymmetryAxis(ptrSym));\n    }\n\n    Update();\n}\n\n\/\/ Returns the name of the generic system\nconst std::string& CCPACSGenericSystem::GetName() const\n{\n    return name;\n}\n\n\/\/ Returns the parent configuration\nCCPACSConfiguration& CCPACSGenericSystem::GetConfiguration() const\n{\n    return *configuration;\n}\n\n\/\/ build loft\nPNamedShape CCPACSGenericSystem::BuildLoft()\n{\n    TopoDS_Shape sysShape;\n    if (geometricBaseType == \"cylinder\") {\n        BRepPrimAPI_MakeCylinder cyl(0.5, 1);\n        gp_Vec vec(0, 0, -0.5);\n        gp_Trsf trsf = gp_Trsf();\n        trsf.SetTranslation(vec);\n        TopLoc_Location loc(trsf);\n        sysShape = cyl.Shape();\n        sysShape.Location(loc);\n    }\n    else if (geometricBaseType == \"sphere\") {\n        BRepPrimAPI_MakeSphere sph(0.5);\n        sysShape = sph.Shape();\n    }\n    else if (geometricBaseType == \"cone\") {\n        BRepPrimAPI_MakeCone cone(0.5, 0, 1);\n        gp_Vec vec(0, 0, -0.5);\n        gp_Trsf trsf = gp_Trsf();\n        trsf.SetTranslation(vec);\n        TopLoc_Location loc(trsf);\n        sysShape = cone.Shape();\n        sysShape.Location(loc);\n    }\n    else if (geometricBaseType == \"cube\") {\n        gp_Pnt p1(-0.5, -0.5, -0.5);\n        gp_Pnt p2(0.5, 0.5, 0.5);\n        BRepPrimAPI_MakeBox cube(p1, p2);\n        sysShape = cube.Shape();\n    }\n\n    sysShape = GetTransformationMatrix().Transform(sysShape);\n    std::string loftName = GetUID();\n    std::string loftShortName = GetShortShapeName();\n    PNamedShape loft(new CNamedShape(sysShape, loftName.c_str(), loftShortName.c_str()));\n\n    return loft;\n}\n\n\/\/ get short name for loft\nstd::string CCPACSGenericSystem::GetShortShapeName()\n{\n    unsigned int gsindex = 0;\n    for (int i = 1; i <= GetConfiguration().GetGenericSystemCount(); ++i) {\n        tigl::CCPACSGenericSystem& gs = GetConfiguration().GetGenericSystem(i);\n        if (GetUID() == gs.GetUID()) {\n            gsindex = i;\n            std::stringstream shortName;\n            shortName << \"GS\" << gsindex;\n            return shortName.str();\n        }\n    }\n    return \"UNKNOWN\";\n}\n\n\/\/ Sets the Transformation object\nvoid CCPACSGenericSystem::Translate(CTiglPoint trans)\n{\n    CTiglRelativelyPositionedComponent::Translate(trans);\n    invalidated = true;\n    Update();\n}\n\n} \/\/ end namespace tigl\n<|endoftext|>"}
{"text":"<commit_before>#include \"tlb.h\"\n#include \"stats.h\"\n\nnamespace ParametricDramDirectoryMSI\n{\n\nTLB::TLB(String name, String cfgname, core_id_t core_id, UInt32 size, UInt32 associativity)\n   : m_size(size)\n   , m_associativity(associativity)\n   , m_cache(name + \"_cache\", cfgname, core_id, size, associativity, SIM_PAGE_SIZE, \"lru\", CacheBase::PR_L1_CACHE)\n   , m_access(0)\n   , m_miss(0)\n{\n   registerStatsMetric(name, core_id, \"access\", &m_access);\n   registerStatsMetric(name, core_id, \"miss\", &m_miss);\n}\n\nbool\nTLB::lookup(IntPtr address, SubsecondTime now)\n{\n   m_access++;\n\n   if (m_cache.peekSingleLine(address))\n      return true;\n\n   m_miss++;\n\n   bool eviction;\n   IntPtr evict_addr;\n   CacheBlockInfo evict_block_info;\n   m_cache.insertSingleLine(address, NULL, &eviction, &evict_addr, &evict_block_info, NULL, now);\n\n   return false;\n}\n\n}\n<commit_msg>[tlb] Fix TLB accesses to perform a real cache access which is necessary to update the LRU state<commit_after>#include \"tlb.h\"\n#include \"stats.h\"\n\nnamespace ParametricDramDirectoryMSI\n{\n\nTLB::TLB(String name, String cfgname, core_id_t core_id, UInt32 size, UInt32 associativity)\n   : m_size(size)\n   , m_associativity(associativity)\n   , m_cache(name + \"_cache\", cfgname, core_id, size, associativity, SIM_PAGE_SIZE, \"lru\", CacheBase::PR_L1_CACHE)\n   , m_access(0)\n   , m_miss(0)\n{\n   registerStatsMetric(name, core_id, \"access\", &m_access);\n   registerStatsMetric(name, core_id, \"miss\", &m_miss);\n}\n\nbool\nTLB::lookup(IntPtr address, SubsecondTime now)\n{\n   m_access++;\n\n   if (m_cache.accessSingleLine(address, Cache::LOAD, NULL, 0, now))\n      return true;\n\n   m_miss++;\n\n   bool eviction;\n   IntPtr evict_addr;\n   CacheBlockInfo evict_block_info;\n   m_cache.insertSingleLine(address, NULL, &eviction, &evict_addr, &evict_block_info, NULL, now);\n\n   return false;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Executor.cpp\n *\n *  Created on: Oct 20, 2015\n *      Author: Péter Fankhauser\n *   Institute: ETH Zurich, Autonomous Systems Lab\n *\/\n\n#include \"free_gait_core\/executor\/Executor.hpp\"\n\n#include <robotUtils\/timers\/ChronoTimer.hpp>\n\n#include <free_gait_core\/leg_motion\/JointTrajectory.hpp>\n\nnamespace free_gait {\n\nExecutor::Executor(std::shared_ptr<StepCompleter> completer,\n                   std::shared_ptr<AdapterBase> adapter,\n                   std::shared_ptr<State> state)\n    : completer_(completer),\n      adapter_(adapter),\n      state_(state),\n      isInitialized_(false),\n      executionStatus_(true)\n{\n}\n\nExecutor::~Executor()\n{\n}\n\nbool Executor::initialize()\n{\n  Lock lock(mutex_);\n  state_->initialize(adapter_->getLimbs(), adapter_->getBranches());\n  reset();\n  return isInitialized_ = true;\n}\n\nbool Executor::isInitialized() const\n{\n  return isInitialized_;\n}\n\nExecutor::Mutex& Executor::getMutex()\n{\n  return mutex_;\n}\n\nbool Executor::advance(double dt)\n{\n  timer_ = robotUtils::HighResolutionClockTimer(\"FreeGait::Executor\");\n  timer_.setAlpha(1.0);\n\n  timer_.pinTime(\"Total\");\n  timer_.pinTime(\"Mutex\");\n  Lock lock(mutex_);\n  timer_.splitTime(\"Mutex\");\n\n  timer_.pinTime(\"First part\");\n  if (!isInitialized_) return false;\n  updateStateWithMeasurements();\n  updateExecutionStatus();\n\n  if (executionStatus_) {\n    if (!state_->getRobotExecutionStatus()) std::cout << \"Continuing with free gait execution.\" << std::endl;\n    state_->setRobotExecutionStatus(true);\n  } else {\n    if (state_->getRobotExecutionStatus()) std::cout << \"Robot status is not OK, not continuing with free gait execution.\" << std::endl;\n    state_->setRobotExecutionStatus(false);\n    return true;\n  }\n\n  bool hasSwitchedStep;\n  if (!queue_.advance(dt, hasSwitchedStep)) return false;\n  timer_.splitTime(\"First part\");\n\n  timer_.pinTime(\"Second part\");\n  while (hasSwitchedStep) {\n\n    if (!queue_.getCurrentStep().requiresMultiThreading()) {\n      if (!completeCurrentStep()) return false;\n      if (!queue_.advance(dt, hasSwitchedStep)) return false; \/\/ Advance again after completion.\n    } else {\n      timer_.pinTime(\"Creating thread\");\n      std::thread thread(&Executor::completeCurrentStep, this, true);\n      thread.detach();\n      timer_.splitTime(\"Creating thread\");\n      hasSwitchedStep = false;\n    }\n  }\n\n  timer_.pinTime(\"writeIgnoreContact\");\n  if (!writeIgnoreContact()) return false;\n  timer_.splitTime(\"writeIgnoreContact\");\n  timer_.pinTime(\"writeIgnoreForPoseAdaptation\");\n  if (!writeIgnoreForPoseAdaptation()) return false;\n  timer_.splitTime(\"writeIgnoreForPoseAdaptation\");\n    timer_.pinTime(\"writeSupportLegs\");\n  if (!writeSupportLegs()) return false;\n  timer_.splitTime(\"writeSupportLegs\");\n    timer_.pinTime(\"writeSurfaceNormals\");\n  if (!writeSurfaceNormals()) return false;\n  timer_.splitTime(\"writeSurfaceNormals\");\n    timer_.pinTime(\"writeLegMotion\");\n  if (!writeLegMotion()) return false;\n  timer_.splitTime(\"writeLegMotion\");\n    timer_.pinTime(\"writeTorsoMotion\");\n  if (!writeTorsoMotion()) return false;\n  timer_.splitTime(\"writeTorsoMotion\");\n    timer_.pinTime(\"updateExtras\");\n  if (!adapter_->updateExtras(queue_, *state_)) return false;\n  timer_.pinTime(\"updateExtras\");\n\/\/  std::cout << *state_ << std::endl;\n  timer_.splitTime(\"Second part\");\n  timer_.splitTime(\"Total\");\n\n  return true;\n}\n\nbool Executor::getExecutionStatus()\n{\n  return executionStatus_;\n}\n\nbool Executor::completeCurrentStep(bool multiThreaded)\n{\n  robotUtils::HighResolutionClockTimer timer(\"Executor::completeCurrentStep\");\n  timer.pinTime();\n\n  \/\/ TODO: Add mutexes on state and queue?\n  bool completionSuccessful;\n  if (multiThreaded) {\n    const State state(*state_);\n    completionSuccessful = completer_->complete(state, queue_, queue_.getCurrentStep());\n  } else {\n    completionSuccessful = completer_->complete(*state_, queue_, queue_.getCurrentStep());\n  }\n\n  if (!completionSuccessful) {\n    std::cerr << \"Executor::advance: Could not complete step.\" << std::endl;\n    return false;\n  }\n\n  timer.splitTime();\n  std::cout << timer << std::endl;\n  std::cout << \"Switched step to:\" << std::endl;\n  std::cout << queue_.getCurrentStep() << std::endl;\n  return true;\n}\n\nvoid Executor::reset()\n{\n  Lock lock(mutex_);\n  queue_.clear();\n  initializeStateWithRobot();\n}\n\nconst StepQueue& Executor::getQueue() const\n{\n  return queue_;\n}\n\nStepQueue& Executor::getQueue()\n{\n  return queue_;\n}\n\nconst State& Executor::getState() const\n{\n  return *state_;\n}\n\nconst AdapterBase& Executor::getAdapter() const\n{\n  return *adapter_;\n}\n\nconst robotUtils::HighResolutionClockTimer& Executor::getTimer()\n{\n  return timer_;\n}\n\nbool Executor::initializeStateWithRobot()\n{\n  for (const auto& limb : adapter_->getLimbs()) {\n    state_->setSupportLeg(limb, adapter_->isLegGrounded(limb));\n    state_->setIgnoreContact(limb, !adapter_->isLegGrounded(limb));\n    state_->setIgnoreForPoseAdaptation(limb, !adapter_->isLegGrounded(limb));\n    state_->removeSurfaceNormal(limb);\n  }\n\n  if (state_->getNumberOfSupportLegs() > 0) {\n    state_->setControlSetup(BranchEnum::BASE, adapter_->getControlSetup(BranchEnum::BASE));\n  } else {\n    state_->setEmptyControlSetup(BranchEnum::BASE);\n  }\n\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (state_->isSupportLeg(limb)) {\n      state_->setEmptyControlSetup(limb);\n    } else {\n      state_->setControlSetup(limb, adapter_->getControlSetup(limb));\n    }\n  }\n\n  state_->setAllJointPositions(adapter_->getAllJointPositions());\n  state_->setAllJointVelocities(adapter_->getAllJointVelocities());\n\/\/  state_->setAllJointAccelerations(adapter_->getAllJointAccelerations()); \/\/ TODO\n  state_->setAllJointEfforts(adapter_->getAllJointEfforts());\n  state_->setPositionWorldToBaseInWorldFrame(adapter_->getPositionWorldToBaseInWorldFrame());\n  state_->setOrientationWorldToBase(adapter_->getOrientationWorldToBase());\n\n  for (const auto& limb : adapter_->getLimbs()) {\n    state_->setSupportLeg(limb, adapter_->isLegGrounded(limb));\n    state_->setIgnoreContact(limb, !adapter_->isLegGrounded(limb));\n  }\n\n  state_->setRobotExecutionStatus(true);\n\n  return true;\n}\n\nbool Executor::updateStateWithMeasurements()\n{\n  for (const auto& limb : adapter_->getLimbs()) {\n    const auto& controlSetup = state_->getControlSetup(limb);\n    if (!controlSetup.at(ControlLevel::Position)) {\n      state_->setJointPositions(limb, adapter_->getJointPositions(limb));\n    }\n    if (!controlSetup.at(ControlLevel::Velocity)) {\n      state_->setJointVelocities(limb, adapter_->getJointVelocities(limb));\n    }\n    if (!controlSetup.at(ControlLevel::Acceleration)) {\n\/\/      state_->setJointAccelerations(limb, adapter_->getJointAccelerations(limb));\n    }\n    if (!controlSetup.at(ControlLevel::Effort)) {\n      state_->setJointEfforts(limb, adapter_->getJointEfforts(limb));\n    }\n  }\n\n  const auto& controlSetup = state_->getControlSetup(BranchEnum::BASE);\n  if (!controlSetup.at(ControlLevel::Position)) {\n    state_->setPositionWorldToBaseInWorldFrame(adapter_->getPositionWorldToBaseInWorldFrame());\n    state_->setOrientationWorldToBase(adapter_->getOrientationWorldToBase());\n  }\n\n  state_->setAllJointVelocities(adapter_->getAllJointVelocities());\n  \/\/ TODO Copy also acceleraitons and torques.\n\/\/    state.setLinearVelocityBaseInWorldFrame(torso_->getMeasuredState().getLinearVelocityBaseInBaseFrame());\n\/\/    state.setAngularVelocityBaseInBaseFrame(torso_->getMeasuredState().getAngularVelocityBaseInBaseFrame());\n  return true;\n}\n\nvoid Executor::updateExecutionStatus()\n{\n  executionStatus_ = true;\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (state_->isSupportLeg(limb) && !adapter_->isLegGrounded(limb)) {\n      executionStatus_ = false;\n      return;\n    }\n  }\n}\n\nbool Executor::writeIgnoreContact()\n{\n  if (!queue_.active()) return true;\n  const Step& step = queue_.getCurrentStep();\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (step.hasLegMotion(limb)) {\n      bool ignoreContact = step.getLegMotion(limb).isIgnoreContact();\n      state_->setIgnoreContact(limb, ignoreContact);\n    }\n  }\n  return true;\n}\n\nbool Executor::writeIgnoreForPoseAdaptation()\n{\n  if (!queue_.active()) return true;\n  const Step& step = queue_.getCurrentStep();\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (step.hasLegMotion(limb)) {\n      bool ignoreForPoseAdaptation = step.getLegMotion(limb).isIgnoreForPoseAdaptation();\n      state_->setIgnoreForPoseAdaptation(limb, ignoreForPoseAdaptation);\n    }\n  }\n  return true;\n}\n\nbool Executor::writeSupportLegs()\n{\n  if (!queue_.active()) {\n    for (const auto& limb : adapter_->getLimbs()) {\n      state_->setSupportLeg(limb, !state_->isIgnoreContact(limb));\n    }\n    return true;\n  }\n\n  const Step& step = queue_.getCurrentStep();\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (step.hasLegMotion(limb) || state_->isIgnoreContact(limb)) {\n      state_->setSupportLeg(limb, false);\n    } else {\n      state_->setSupportLeg(limb, true);\n    }\n  }\n  return true;\n}\n\nbool Executor::writeSurfaceNormals()\n{\n  if (!queue_.active()) return true;\n  const Step& step = queue_.getCurrentStep();\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (step.hasLegMotion(limb)) {\n      if (step.getLegMotion(limb).hasSurfaceNormal()) {\n        state_->setSurfaceNormal(limb, step.getLegMotion(limb).getSurfaceNormal());\n      } else {\n        state_->removeSurfaceNormal(limb);\n      }\n    }\n  }\n  return true;\n}\n\nbool Executor::writeLegMotion()\n{\n  timer_.pinTime(\"1\");\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (state_->isSupportLeg(limb)) state_->setEmptyControlSetup(limb);\n  }\n  if (!queue_.active()) return true;\n\n  const auto& step = queue_.getCurrentStep();\n  if (!step.hasLegMotion()) return true;\n  timer_.splitTime(\"1\");\n\n  timer_.pinTime(\"2\");\n  double time = queue_.getCurrentStep().getTime();\n  for (const auto& limb : adapter_->getLimbs()) {\n    timer_.pinTime(\"writeLegmotion for loop\");\n    if (!step.hasLegMotion(limb)) continue;\n    auto const& legMotion = step.getLegMotion(limb);\n    ControlSetup controlSetup = legMotion.getControlSetup();\n    state_->setControlSetup(limb, controlSetup);\n\n    switch (legMotion.getTrajectoryType()) {\n\n      case LegMotionBase::TrajectoryType::EndEffector:\n      {\n        const auto& endEffectorMotion = dynamic_cast<const EndEffectorMotionBase&>(legMotion);\n        if (controlSetup[ControlLevel::Position]) {\n          \/\/ TODO Add frame handling.\n          Position positionInWorldFrame(endEffectorMotion.evaluatePosition(time));\n          \/\/ TODO adapter_->getOrientationWorldToBase() is nicer when the robot slips, but leads to problems at lift-off.\n          Position positionInBaseFrame(adapter_->getOrientationWorldToBase().rotate(positionInWorldFrame - adapter_->getPositionWorldToBaseInWorldFrame()));\n\/\/          Position positionInBaseFrame(state_->getOrientationWorldToBase().rotate(positionInWorldFrame - adapter_->getPositionWorldToBaseInWorldFrame()));\n          JointPositions jointPositions;\n          adapter_->getLimbJointPositionsFromPositionBaseToFootInBaseFrame(positionInBaseFrame, limb, jointPositions);\n          state_->setJointPositions(limb, jointPositions);\n        }\n        break;\n      }\n\n      case LegMotionBase::TrajectoryType::Joints:\n      {\n        const auto& jointMotion = dynamic_cast<const JointTrajectory&>(legMotion);\n        timer_.pinTime(\"writeLegMotion evalute spline\");\n        if (controlSetup[ControlLevel::Position]) state_->setJointPositions(limb, jointMotion.evaluatePosition(time, timer_));\n\/\/        if (controlSetup[ControlLevel::Velocity]) state_->setJointVelocities(limb, jointMotion.evaluateVelocity(time));\n\/\/        if (controlSetup[ControlLevel::Acceleration]) state_->setJointAcceleration(limb, jointMotion.evaluateAcceleration(time));\n        if (controlSetup[ControlLevel::Effort]) state_->setJointEfforts(limb, jointMotion.evaluateEffort(time));\n        timer_.splitTime(\"writeLegMotion evalute spline\");\n        break;\n      }\n\n      default:\n        throw std::runtime_error(\"Executor::writeLegMotion() could not write leg motion of this type.\");\n        break;\n    }\n    timer_.splitTime(\"writeLegmotion for loop\");\n  }\n  timer_.splitTime(\"2\");\n\n  return true;\n}\n\nbool Executor::writeTorsoMotion()\n{\n  if (state_->getNumberOfSupportLegs() == 0) state_->setEmptyControlSetup(BranchEnum::BASE);\n  if (!queue_.active()) return true;\n\n  if (!queue_.getCurrentStep().hasBaseMotion()) return true;\n  double time = queue_.getCurrentStep().getTime();\n  \/\/ TODO Add frame handling.\n  const auto& baseMotion = queue_.getCurrentStep().getBaseMotion();\n  ControlSetup controlSetup = baseMotion.getControlSetup();\n  state_->setControlSetup(BranchEnum::BASE, controlSetup);\n  if (controlSetup[ControlLevel::Position]) {\n    Pose pose = baseMotion.evaluatePose(time);\n    state_->setPositionWorldToBaseInWorldFrame(pose.getPosition());\n    state_->setOrientationWorldToBase(pose.getRotation());\n  }\n  if (controlSetup[ControlLevel::Velocity]) {\n    Twist twist = baseMotion.evaluateTwist(time);\n    state_->setLinearVelocityBaseInWorldFrame(twist.getTranslationalVelocity());\n    state_->setAngularVelocityBaseInBaseFrame(twist.getRotationalVelocity());\n  }\n  \/\/ TODO Set more states.\n  return true;\n}\n\n} \/* namespace free_gait *\/\n<commit_msg>Compilation errors.<commit_after>\/*\n * Executor.cpp\n *\n *  Created on: Oct 20, 2015\n *      Author: Péter Fankhauser\n *   Institute: ETH Zurich, Autonomous Systems Lab\n *\/\n\n#include \"free_gait_core\/executor\/Executor.hpp\"\n\n#include <robotUtils\/timers\/ChronoTimer.hpp>\n\n#include <free_gait_core\/leg_motion\/JointTrajectory.hpp>\n\nnamespace free_gait {\n\nExecutor::Executor(std::shared_ptr<StepCompleter> completer,\n                   std::shared_ptr<AdapterBase> adapter,\n                   std::shared_ptr<State> state)\n    : completer_(completer),\n      adapter_(adapter),\n      state_(state),\n      isInitialized_(false),\n      executionStatus_(true)\n{\n}\n\nExecutor::~Executor()\n{\n}\n\nbool Executor::initialize()\n{\n  Lock lock(mutex_);\n  state_->initialize(adapter_->getLimbs(), adapter_->getBranches());\n  reset();\n  return isInitialized_ = true;\n}\n\nbool Executor::isInitialized() const\n{\n  return isInitialized_;\n}\n\nExecutor::Mutex& Executor::getMutex()\n{\n  return mutex_;\n}\n\nbool Executor::advance(double dt)\n{\n  timer_ = robotUtils::HighResolutionClockTimer(\"FreeGait::Executor\");\n  timer_.setAlpha(1.0);\n\n  timer_.pinTime(\"Total\");\n  timer_.pinTime(\"Mutex\");\n  Lock lock(mutex_);\n  timer_.splitTime(\"Mutex\");\n\n  timer_.pinTime(\"First part\");\n  if (!isInitialized_) return false;\n  updateStateWithMeasurements();\n  updateExecutionStatus();\n\n  if (executionStatus_) {\n    if (!state_->getRobotExecutionStatus()) std::cout << \"Continuing with free gait execution.\" << std::endl;\n    state_->setRobotExecutionStatus(true);\n  } else {\n    if (state_->getRobotExecutionStatus()) std::cout << \"Robot status is not OK, not continuing with free gait execution.\" << std::endl;\n    state_->setRobotExecutionStatus(false);\n    return true;\n  }\n\n  bool hasSwitchedStep;\n  if (!queue_.advance(dt, hasSwitchedStep)) return false;\n  timer_.splitTime(\"First part\");\n\n  timer_.pinTime(\"Second part\");\n  while (hasSwitchedStep) {\n\n    if (!queue_.getCurrentStep().requiresMultiThreading()) {\n      if (!completeCurrentStep()) return false;\n      if (!queue_.advance(dt, hasSwitchedStep)) return false; \/\/ Advance again after completion.\n    } else {\n      timer_.pinTime(\"Creating thread\");\n      std::thread thread(&Executor::completeCurrentStep, this, true);\n      thread.detach();\n      timer_.splitTime(\"Creating thread\");\n      hasSwitchedStep = false;\n    }\n  }\n\n  timer_.pinTime(\"writeIgnoreContact\");\n  if (!writeIgnoreContact()) return false;\n  timer_.splitTime(\"writeIgnoreContact\");\n  timer_.pinTime(\"writeIgnoreForPoseAdaptation\");\n  if (!writeIgnoreForPoseAdaptation()) return false;\n  timer_.splitTime(\"writeIgnoreForPoseAdaptation\");\n    timer_.pinTime(\"writeSupportLegs\");\n  if (!writeSupportLegs()) return false;\n  timer_.splitTime(\"writeSupportLegs\");\n    timer_.pinTime(\"writeSurfaceNormals\");\n  if (!writeSurfaceNormals()) return false;\n  timer_.splitTime(\"writeSurfaceNormals\");\n    timer_.pinTime(\"writeLegMotion\");\n  if (!writeLegMotion()) return false;\n  timer_.splitTime(\"writeLegMotion\");\n    timer_.pinTime(\"writeTorsoMotion\");\n  if (!writeTorsoMotion()) return false;\n  timer_.splitTime(\"writeTorsoMotion\");\n    timer_.pinTime(\"updateExtras\");\n  if (!adapter_->updateExtras(queue_, *state_)) return false;\n  timer_.pinTime(\"updateExtras\");\n\/\/  std::cout << *state_ << std::endl;\n  timer_.splitTime(\"Second part\");\n  timer_.splitTime(\"Total\");\n\n  return true;\n}\n\nbool Executor::getExecutionStatus()\n{\n  return executionStatus_;\n}\n\nbool Executor::completeCurrentStep(bool multiThreaded)\n{\n  robotUtils::HighResolutionClockTimer timer(\"Executor::completeCurrentStep\");\n  timer.pinTime();\n\n  \/\/ TODO: Add mutexes on state and queue?\n  bool completionSuccessful;\n  if (multiThreaded) {\n    const State state(*state_);\n    completionSuccessful = completer_->complete(state, queue_, queue_.getCurrentStep());\n  } else {\n    completionSuccessful = completer_->complete(*state_, queue_, queue_.getCurrentStep());\n  }\n\n  if (!completionSuccessful) {\n    std::cerr << \"Executor::advance: Could not complete step.\" << std::endl;\n    return false;\n  }\n\n  timer.splitTime();\n  std::cout << timer << std::endl;\n  std::cout << \"Switched step to:\" << std::endl;\n  std::cout << queue_.getCurrentStep() << std::endl;\n  return true;\n}\n\nvoid Executor::reset()\n{\n  Lock lock(mutex_);\n  queue_.clear();\n  initializeStateWithRobot();\n}\n\nconst StepQueue& Executor::getQueue() const\n{\n  return queue_;\n}\n\nStepQueue& Executor::getQueue()\n{\n  return queue_;\n}\n\nconst State& Executor::getState() const\n{\n  return *state_;\n}\n\nconst AdapterBase& Executor::getAdapter() const\n{\n  return *adapter_;\n}\n\nconst robotUtils::HighResolutionClockTimer& Executor::getTimer()\n{\n  return timer_;\n}\n\nbool Executor::initializeStateWithRobot()\n{\n  for (const auto& limb : adapter_->getLimbs()) {\n    state_->setSupportLeg(limb, adapter_->isLegGrounded(limb));\n    state_->setIgnoreContact(limb, !adapter_->isLegGrounded(limb));\n    state_->setIgnoreForPoseAdaptation(limb, !adapter_->isLegGrounded(limb));\n    state_->removeSurfaceNormal(limb);\n  }\n\n  if (state_->getNumberOfSupportLegs() > 0) {\n    state_->setControlSetup(BranchEnum::BASE, adapter_->getControlSetup(BranchEnum::BASE));\n  } else {\n    state_->setEmptyControlSetup(BranchEnum::BASE);\n  }\n\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (state_->isSupportLeg(limb)) {\n      state_->setEmptyControlSetup(limb);\n    } else {\n      state_->setControlSetup(limb, adapter_->getControlSetup(limb));\n    }\n  }\n\n  state_->setAllJointPositions(adapter_->getAllJointPositions());\n  state_->setAllJointVelocities(adapter_->getAllJointVelocities());\n\/\/  state_->setAllJointAccelerations(adapter_->getAllJointAccelerations()); \/\/ TODO\n  state_->setAllJointEfforts(adapter_->getAllJointEfforts());\n  state_->setPositionWorldToBaseInWorldFrame(adapter_->getPositionWorldToBaseInWorldFrame());\n  state_->setOrientationWorldToBase(adapter_->getOrientationWorldToBase());\n\n  for (const auto& limb : adapter_->getLimbs()) {\n    state_->setSupportLeg(limb, adapter_->isLegGrounded(limb));\n    state_->setIgnoreContact(limb, !adapter_->isLegGrounded(limb));\n  }\n\n  state_->setRobotExecutionStatus(true);\n\n  return true;\n}\n\nbool Executor::updateStateWithMeasurements()\n{\n  for (const auto& limb : adapter_->getLimbs()) {\n    const auto& controlSetup = state_->getControlSetup(limb);\n    if (!controlSetup.at(ControlLevel::Position)) {\n      state_->setJointPositions(limb, adapter_->getJointPositions(limb));\n    }\n    if (!controlSetup.at(ControlLevel::Velocity)) {\n      state_->setJointVelocities(limb, adapter_->getJointVelocities(limb));\n    }\n    if (!controlSetup.at(ControlLevel::Acceleration)) {\n\/\/      state_->setJointAccelerations(limb, adapter_->getJointAccelerations(limb));\n    }\n    if (!controlSetup.at(ControlLevel::Effort)) {\n      state_->setJointEfforts(limb, adapter_->getJointEfforts(limb));\n    }\n  }\n\n  const auto& controlSetup = state_->getControlSetup(BranchEnum::BASE);\n  if (!controlSetup.at(ControlLevel::Position)) {\n    state_->setPositionWorldToBaseInWorldFrame(adapter_->getPositionWorldToBaseInWorldFrame());\n    state_->setOrientationWorldToBase(adapter_->getOrientationWorldToBase());\n  }\n\n  state_->setAllJointVelocities(adapter_->getAllJointVelocities());\n  \/\/ TODO Copy also acceleraitons and torques.\n\/\/    state.setLinearVelocityBaseInWorldFrame(torso_->getMeasuredState().getLinearVelocityBaseInBaseFrame());\n\/\/    state.setAngularVelocityBaseInBaseFrame(torso_->getMeasuredState().getAngularVelocityBaseInBaseFrame());\n  return true;\n}\n\nvoid Executor::updateExecutionStatus()\n{\n  executionStatus_ = true;\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (state_->isSupportLeg(limb) && !adapter_->isLegGrounded(limb)) {\n      executionStatus_ = false;\n      return;\n    }\n  }\n}\n\nbool Executor::writeIgnoreContact()\n{\n  if (!queue_.active()) return true;\n  const Step& step = queue_.getCurrentStep();\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (step.hasLegMotion(limb)) {\n      bool ignoreContact = step.getLegMotion(limb).isIgnoreContact();\n      state_->setIgnoreContact(limb, ignoreContact);\n    }\n  }\n  return true;\n}\n\nbool Executor::writeIgnoreForPoseAdaptation()\n{\n  if (!queue_.active()) return true;\n  const Step& step = queue_.getCurrentStep();\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (step.hasLegMotion(limb)) {\n      bool ignoreForPoseAdaptation = step.getLegMotion(limb).isIgnoreForPoseAdaptation();\n      state_->setIgnoreForPoseAdaptation(limb, ignoreForPoseAdaptation);\n    }\n  }\n  return true;\n}\n\nbool Executor::writeSupportLegs()\n{\n  if (!queue_.active()) {\n    for (const auto& limb : adapter_->getLimbs()) {\n      state_->setSupportLeg(limb, !state_->isIgnoreContact(limb));\n    }\n    return true;\n  }\n\n  const Step& step = queue_.getCurrentStep();\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (step.hasLegMotion(limb) || state_->isIgnoreContact(limb)) {\n      state_->setSupportLeg(limb, false);\n    } else {\n      state_->setSupportLeg(limb, true);\n    }\n  }\n  return true;\n}\n\nbool Executor::writeSurfaceNormals()\n{\n  if (!queue_.active()) return true;\n  const Step& step = queue_.getCurrentStep();\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (step.hasLegMotion(limb)) {\n      if (step.getLegMotion(limb).hasSurfaceNormal()) {\n        state_->setSurfaceNormal(limb, step.getLegMotion(limb).getSurfaceNormal());\n      } else {\n        state_->removeSurfaceNormal(limb);\n      }\n    }\n  }\n  return true;\n}\n\nbool Executor::writeLegMotion()\n{\n  timer_.pinTime(\"1\");\n  for (const auto& limb : adapter_->getLimbs()) {\n    if (state_->isSupportLeg(limb)) state_->setEmptyControlSetup(limb);\n  }\n  if (!queue_.active()) return true;\n\n  const auto& step = queue_.getCurrentStep();\n  if (!step.hasLegMotion()) return true;\n  timer_.splitTime(\"1\");\n\n  timer_.pinTime(\"2\");\n  double time = queue_.getCurrentStep().getTime();\n  for (const auto& limb : adapter_->getLimbs()) {\n    timer_.pinTime(\"writeLegmotion for loop\");\n    if (!step.hasLegMotion(limb)) continue;\n    auto const& legMotion = step.getLegMotion(limb);\n    ControlSetup controlSetup = legMotion.getControlSetup();\n    state_->setControlSetup(limb, controlSetup);\n\n    switch (legMotion.getTrajectoryType()) {\n\n      case LegMotionBase::TrajectoryType::EndEffector:\n      {\n        const auto& endEffectorMotion = dynamic_cast<const EndEffectorMotionBase&>(legMotion);\n        if (controlSetup[ControlLevel::Position]) {\n          \/\/ TODO Add frame handling.\n          Position positionInWorldFrame(endEffectorMotion.evaluatePosition(time));\n          \/\/ TODO adapter_->getOrientationWorldToBase() is nicer when the robot slips, but leads to problems at lift-off.\n          Position positionInBaseFrame(adapter_->getOrientationWorldToBase().rotate(positionInWorldFrame - adapter_->getPositionWorldToBaseInWorldFrame()));\n\/\/          Position positionInBaseFrame(state_->getOrientationWorldToBase().rotate(positionInWorldFrame - adapter_->getPositionWorldToBaseInWorldFrame()));\n          JointPositions jointPositions;\n          adapter_->getLimbJointPositionsFromPositionBaseToFootInBaseFrame(positionInBaseFrame, limb, jointPositions);\n          state_->setJointPositions(limb, jointPositions);\n        }\n        break;\n      }\n\n      case LegMotionBase::TrajectoryType::Joints:\n      {\n        const auto& jointMotion = dynamic_cast<const JointTrajectory&>(legMotion);\n        timer_.pinTime(\"writeLegMotion evalute spline\");\n        if (controlSetup[ControlLevel::Position]) state_->setJointPositions(limb, jointMotion.evaluatePosition(time));\n\/\/        if (controlSetup[ControlLevel::Velocity]) state_->setJointVelocities(limb, jointMotion.evaluateVelocity(time));\n\/\/        if (controlSetup[ControlLevel::Acceleration]) state_->setJointAcceleration(limb, jointMotion.evaluateAcceleration(time));\n        if (controlSetup[ControlLevel::Effort]) state_->setJointEfforts(limb, jointMotion.evaluateEffort(time));\n        timer_.splitTime(\"writeLegMotion evalute spline\");\n        break;\n      }\n\n      default:\n        throw std::runtime_error(\"Executor::writeLegMotion() could not write leg motion of this type.\");\n        break;\n    }\n    timer_.splitTime(\"writeLegmotion for loop\");\n  }\n  timer_.splitTime(\"2\");\n\n  return true;\n}\n\nbool Executor::writeTorsoMotion()\n{\n  if (state_->getNumberOfSupportLegs() == 0) state_->setEmptyControlSetup(BranchEnum::BASE);\n  if (!queue_.active()) return true;\n\n  if (!queue_.getCurrentStep().hasBaseMotion()) return true;\n  double time = queue_.getCurrentStep().getTime();\n  \/\/ TODO Add frame handling.\n  const auto& baseMotion = queue_.getCurrentStep().getBaseMotion();\n  ControlSetup controlSetup = baseMotion.getControlSetup();\n  state_->setControlSetup(BranchEnum::BASE, controlSetup);\n  if (controlSetup[ControlLevel::Position]) {\n    Pose pose = baseMotion.evaluatePose(time);\n    state_->setPositionWorldToBaseInWorldFrame(pose.getPosition());\n    state_->setOrientationWorldToBase(pose.getRotation());\n  }\n  if (controlSetup[ControlLevel::Velocity]) {\n    Twist twist = baseMotion.evaluateTwist(time);\n    state_->setLinearVelocityBaseInWorldFrame(twist.getTranslationalVelocity());\n    state_->setAngularVelocityBaseInBaseFrame(twist.getRotationalVelocity());\n  }\n  \/\/ TODO Set more states.\n  return true;\n}\n\n} \/* namespace free_gait *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"nifpp.h\"\n#include <functional>\n#include <utility>  \n\nclass ResultSet\n{\n    std::unordered_map<int,std::vector<nifpp::TERM>> map_of_result_sets;\n    std::unordered_map<int,std::vector<std::pair<int,int>>> current_result_index;\n    std::unordered_map<int,std::vector<int>> reverse_result_index;\n    int result_count;\n    int total_count;\n    ErlNifEnv* env;\npublic:\n    ResultSet(int init_count)\n    {\n       total_count = init_count;\n       result_count = 0;\n       map_of_result_sets = {};\n       current_result_index = {};\n       std::vector<int> empty_vector = {};\n       for (int i = 1; i <= init_count; ++i)\n       {\n           reverse_result_index.emplace(i,empty_vector);\n       }\n       env = NULL; \n    }\n    int get_result_count()\n    {\n        return result_count;\n    }\n    int get_total_count()\n    {\n        return total_count;\n    }\n    std::unordered_map<int,std::vector<nifpp::TERM>> get_map_of_results_sets()\n    {\n        return map_of_result_sets;\n    }\n    std::vector<std::vector<nifpp::TERM>> append_result_set(std::vector<nifpp::TERM> result_set,int uid, ErlNifEnv* env_outer)\n    {\n        if(result_count < total_count)\n        {\n            map_of_result_sets.emplace(uid, result_set);\n            restructure_current_result_index(env_outer, uid);\n            result_count++ ;\n            std::vector<std::vector<nifpp::TERM>> final_result = {};\n            if(result_count==total_count)\n            {\n                final_result = get_final_result_set(env_outer);\n            }\n            return final_result;\n        }\n        else\n        {\n            std::vector<std::vector<nifpp::TERM>> final_result = {};\n            return final_result;\n        }   \n    }\n    void print_current_result_set()\n    {\n        for (auto it = current_result_index.begin(); it != current_result_index.end(); ++it)\n        {\n            printf(\"%d\\n\", it->first);\n        }\n\n    }\n    void restructure_current_result_index(ErlNifEnv* env_outer, int uid)\n    {\n        int index = 0;\n        ErlNifBinary ebin, bin_term;\n        \n        std::vector<nifpp::TERM> result_set = map_of_result_sets.at(uid);\n        \n        int arity;\n        int hash_val;\n        const ERL_NIF_TERM* tuple;\n        int size = result_set.size();\n        for (int i = 0; i < size; ++i)\n        {\n            if(enif_get_tuple(env_outer, result_set.at(i), &arity, &tuple)!=1)\n                enif_make_badarg(env_outer);\n            nifpp::get_throws(env_outer, tuple[0], ebin);\n            enif_alloc_binary(ebin.size, &bin_term);\n            memcpy(bin_term.data, ebin.data, ebin.size);\n            hash_val = 0 ;\n            for(int i=0; i<bin_term.size; ++i){\n               hash_val = (10*hash_val) + bin_term.data[i];\n            }\n            std::pair<int, int> index_addr = std::make_pair(uid, index);\n            std::vector<std::pair<int,int>> init_vector = {};\n            init_vector.push_back(index_addr);\n            auto emp_res = current_result_index.emplace (hash_val, init_vector);\n            if(emp_res.second==false)\n                current_result_index.at(hash_val).push_back(index_addr);\n            int current_size = current_result_index.at(hash_val).size();\n            reverse_result_index.at(current_size).push_back(hash_val);\n            index = index + 1;\n        }\n    }\n\n    std::vector<std::vector<nifpp::TERM>> get_final_result_set(ErlNifEnv* env)\n    {\n        std::vector<std::vector<nifpp::TERM>> final_result = {};\n        int inner_index = 0;\n        int arity; int comp_arity = 0;\n        const ERL_NIF_TERM* tuple;\n        ErlNifBinary ebin, bin_term;\n        nifpp::TERM term;\n        for (auto it_outer = reverse_result_index.at(total_count).begin(); it_outer != reverse_result_index.at(total_count).end(); ++it_outer)\n        {\n            std::vector<nifpp::TERM> appended_rows = {};\n            inner_index = 0;\n            for (auto it_inner = current_result_index.at(*it_outer).begin(); it_inner != current_result_index.at(*it_outer).end() ; ++it_inner)\n            {\n                comp_arity = 0;\n                std::vector<nifpp::TERM> array_of_binaries = {};\n                std::pair<int,int> curr_pair = (*it_inner);\n                if(enif_get_tuple(env, map_of_result_sets.at(curr_pair.first).at(curr_pair.second), &arity, &tuple)!=1)\n                    enif_make_badarg(env);\n                \n                if (inner_index==0)\n                {\n                    while(comp_arity != arity)\n                    {\n                        nifpp::get_throws(env, tuple[comp_arity], ebin);\n                        enif_alloc_binary(ebin.size, &bin_term);\n                        memcpy(bin_term.data, ebin.data, ebin.size);\n                        term = nifpp::make(env, bin_term);\n                        array_of_binaries.push_back(term);\n                        comp_arity = comp_arity + 1;\n                    }\n                }\n                else\n                {\n                    comp_arity =  1;\n                    while(comp_arity != arity)\n                    {\n                        nifpp::get_throws(env, tuple[comp_arity], ebin);\n                        enif_alloc_binary(ebin.size, &bin_term);\n                        memcpy(bin_term.data, ebin.data, ebin.size);\n                        term = nifpp::make(env, bin_term);\n                        array_of_binaries.push_back(term);\n                        comp_arity = comp_arity + 1;\n                    }\n                }\n                appended_rows.insert(appended_rows.end(),array_of_binaries.begin(),array_of_binaries.end());\n\n                inner_index = inner_index + 1;\n            }\n            final_result.push_back(appended_rows);\n        }\n        return final_result;\n    }\n\n    \/\/ ~ResultSet();\n\n};\nstatic int load(ErlNifEnv* env, void** priv, ERL_NIF_TERM load_info)\n{\n    nifpp::register_resource<ResultSet>(env, nullptr, \"ResultSet\");\n    return 0;\n}\n\nstatic ERL_NIF_TERM initialize_result_set(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    try{\n        int count;\n        nifpp::get(env, argv[0], count);\n        ERL_NIF_TERM result;\n        auto map_ptr = nifpp::construct_resource<ResultSet>(count);\n        result = nifpp::make(env, map_ptr);\n        return result;\n    }\n    catch(nifpp::badarg) {}\n    catch(...) {}\n    return enif_make_badarg(env);\n}\n\nstatic ERL_NIF_TERM append_result_set(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    try\n    {\n        ERL_NIF_TERM result;\n        nifpp::resource_ptr<ResultSet> ptr;\n        std::vector<std::vector<nifpp::TERM>> result_set;\n        std::vector<nifpp::TERM> input_result_set;\n        int uid;\n        nifpp::get(env, argv[0], ptr);\n        nifpp::get(env, argv[1], input_result_set);\n        nifpp::get(env, argv[2], uid);\n        result_set = (*ptr).append_result_set(input_result_set, uid, env);\n        if ((*ptr).get_total_count()==(*ptr).get_result_count())\n        {\n            return nifpp::make(env, result_set);\n        }\n        auto new_result = (*ptr).get_map_of_results_sets();\n        return nifpp::make(env, new_result);\n        \/\/ return result;\n    }\n    catch(...) {}\n    return enif_make_badarg(env);\n}\n\nstatic ERL_NIF_TERM return_result_set(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    try\n    {\n        nifpp::resource_ptr<ResultSet> ptr;\n        if(nifpp::get(env, argv[0], ptr)==1)\n        {\n            (*ptr) = NULL;\n        }\n        else\n        {\n            return enif_make_badarg(env);\n        }\n        return nifpp::make(env, 1);\n    }\n    catch(...) {}\n    return enif_make_badarg(env);\n}\n\nstatic ERL_NIF_TERM nullify_result_set(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    try\n    {\n        ERL_NIF_TERM result;\n        nifpp::resource_ptr<ResultSet> ptr;\n        std::vector<std::vector<nifpp::TERM>> result_set;\n        std::vector<nifpp::TERM> input_result_set;\n        nifpp::get(env, argv[0], ptr);\n        \/\/ (*ptr) = NULL;\n        \/\/ free(ptr);\n        return nifpp::make(env, 1);\n    }\n    catch(...){}\n    return enif_make_badarg(env);\n}\n\nextern \"C\" {\n\nstatic ErlNifFunc nif_funcs[] = {\n                                    {\"initialize_result_set\", 1, initialize_result_set}, \n                                    {\"return_result_set\", 1, return_result_set},\n                                    {\"append_result_set\", 3, append_result_set},\n                                };\n\nERL_NIF_INIT(par_append_tuple, nif_funcs, load, NULL, NULL, NULL)\n\n}\/\/extern C<commit_msg>still need to test parallel merge effectively<commit_after>#include \"nifpp.h\"\n#include <functional>\n#include <utility>  \n\nclass ResultSet\n{\n    std::unordered_map<int,std::vector<nifpp::TERM>> map_of_result_sets;\n    std::unordered_map<int,std::vector<std::pair<int,int>>> current_result_index;\n    std::unordered_map<int,std::vector<int>> reverse_result_index;\n    std::unordered_map<int,ErlNifEnv*> env_map;\n    int result_count;\n    int total_count;\n    ErlNifEnv* env;\npublic:\n    ResultSet(int init_count)\n    {\n       total_count = init_count;\n       result_count = 0;\n       map_of_result_sets = {};\n       current_result_index = {};\n       std::vector<int> empty_vector = {};\n       for (int i = 1; i <= init_count; ++i)\n           reverse_result_index.emplace(i,empty_vector);\n       env = NULL; \n    }\n    int get_result_count()\n    {\n        return result_count;\n    }\n    int get_total_count()\n    {\n        return total_count;\n    }\n    std::unordered_map<int,std::vector<nifpp::TERM>> get_map_of_results_sets()\n    {\n        return map_of_result_sets;\n    }\n    std::vector<std::vector<nifpp::TERM>> append_result_set(std::vector<nifpp::TERM> result_set,int uid, ErlNifEnv* env_outer)\n    {\n        std::vector<std::vector<nifpp::TERM>> final_result_set = {};\n        if(result_count < total_count)\n        {\n            map_of_result_sets.emplace(uid, result_set);\n            env_map.emplace(uid, env_outer);\n            restructure_current_result_index(env_outer, uid);\n            result_count++ ;\n            if (result_count==total_count)\n            {\n                final_result_set = get_final_result_set(env_outer);\n            }\n        }\n        return final_result_set;\n    }\n    void print_current_result_set()\n    {\n        for (auto it = current_result_index.begin(); it != current_result_index.end(); ++it)\n            printf(\"%d\\n\", it->first);\n\n    }\n    void restructure_current_result_index(ErlNifEnv* env_outer, int uid)\n    {\n        int index = 0;\n        ErlNifBinary ebin, bin_term;\n        \n        std::vector<nifpp::TERM> result_set = map_of_result_sets.at(uid);\n        \n        int arity;\n        int hash_val;\n        const ERL_NIF_TERM* tuple;\n        int size = result_set.size();\n        for (int i = 0; i < size; ++i)\n        {\n            if(enif_get_tuple(env_outer, result_set.at(i), &arity, &tuple)!=1)\n                enif_make_badarg(env_outer);\n            nifpp::get_throws(env_outer, tuple[0], ebin);\n            enif_alloc_binary(ebin.size, &bin_term);\n            memcpy(bin_term.data, ebin.data, ebin.size);\n            hash_val = 0 ;\n            for(int i=0; i<bin_term.size; ++i){\n               hash_val = (10*hash_val) + bin_term.data[i];\n            }\n            std::pair<int, int> index_addr = std::make_pair(uid, index);\n            std::vector<std::pair<int,int>> init_vector = {};\n            init_vector.push_back(index_addr);\n            auto emp_res = current_result_index.emplace (hash_val, init_vector);\n            if(emp_res.second==false)\n                current_result_index.at(hash_val).push_back(index_addr);\n            int current_size = current_result_index.at(hash_val).size();\n            reverse_result_index.at(current_size).push_back(hash_val);\n            index = index + 1;\n        }\n    }\n\n    std::vector<std::vector<nifpp::TERM>> get_final_result_set(ErlNifEnv* env)\n    {\n        std::vector<std::vector<nifpp::TERM>> final_result = {};\n        int inner_index = 0;\n        int arity; int comp_arity = 0;\n        const ERL_NIF_TERM* tuple1;\n        const ERL_NIF_TERM* tuple2;\n        ErlNifBinary ebin, bin_term;\n\n        nifpp::TERM term;\n        for (auto it_outer = reverse_result_index.at(total_count).begin(); it_outer != reverse_result_index.at(total_count).end(); ++it_outer)\n        {\n            std::vector<nifpp::TERM> appended_rows = {};\n            inner_index = 0;\n            for (auto it_inner = current_result_index.at(*it_outer).begin(); it_inner != current_result_index.at(*it_outer).end() ; ++it_inner)\n            {\n                comp_arity = 0;\n                std::vector<nifpp::TERM> array_of_binaries = {};\n                std::pair<int,int> curr_pair = (*it_inner);\n                ErlNifEnv* env_inner = env_map.at(curr_pair.first);\n                if (result_count==2)\n                {\n                     if(enif_get_tuple(env_inner, map_of_result_sets.at(curr_pair.first).at(curr_pair.second), &arity, &tuple2)!=1)\n                        enif_make_badarg(env);\n                        printf(\"%d%d%d%d\\n\", curr_pair.first, curr_pair.second, arity, comp_arity);\n                        nifpp::get_throws(env_inner, tuple2[comp_arity], ebin);\n                }\n                else\n                {\n                    if(enif_get_tuple(env_inner, map_of_result_sets.at(curr_pair.first).at(curr_pair.second), &arity, &tuple1)!=1)\n                        enif_make_badarg(env);\n                        nifpp::get_throws(env_inner, tuple1[comp_arity], ebin);\n                }\n               \n                \/\/ if (inner_index==0)\n                \/\/ {\n                \/\/     while(comp_arity != arity && comp_arity < arity)\n                \/\/     {\n                \/\/         printf(\"%s\\n\", \"a\");\n                \/\/         nifpp::get_throws(env_inner, tuple[comp_arity], ebin);\n                \/\/         printf(\"%s\\n\", \"b\");\n                \/\/         enif_alloc_binary(ebin.size, &bin_term);\n                \/\/         memcpy(bin_term.data, ebin.data, ebin.size);\n                \/\/         term = nifpp::make(env, bin_term);\n                \/\/         array_of_binaries.push_back(term);\n                \/\/         comp_arity = comp_arity + 1;\n                \/\/     }\n\n                \/\/ }\n                \/\/ else\n                \/\/ {\n                \/\/     comp_arity =  1;\n                \/\/     while(comp_arity != arity && comp_arity < arity)\n                \/\/     {\n                \/\/         nifpp::get_throws(env_inner, tuple[comp_arity], ebin);\n                \/\/         enif_alloc_binary(ebin.size, &bin_term);\n                \/\/         memcpy(bin_term.data, ebin.data, ebin.size);\n                \/\/         term = nifpp::make(env, bin_term);\n                \/\/         array_of_binaries.push_back(term);\n                \/\/         comp_arity = comp_arity + 1;\n                \/\/     }\n\n                \/\/ }\n                appended_rows.insert(appended_rows.end(),array_of_binaries.begin(),array_of_binaries.end());\n                inner_index = inner_index + 1;\n            }\n            final_result.push_back(appended_rows);\n        }\n        return final_result;\n    }\n\n    \/\/ ~ResultSet();\n\n};\nstatic int load(ErlNifEnv* env, void** priv, ERL_NIF_TERM load_info)\n{\n    nifpp::register_resource<ResultSet>(env, nullptr, \"ResultSet\");\n    return 0;\n}\n\nstatic ERL_NIF_TERM initialize_result_set(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    try{\n        int count;\n        nifpp::get(env, argv[0], count);\n        ERL_NIF_TERM result;\n        auto map_ptr = nifpp::construct_resource<ResultSet>(count);\n        result = nifpp::make(env, map_ptr);\n        return result;\n    }\n    catch(nifpp::badarg) {}\n    catch(...) {}\n    return enif_make_badarg(env);\n}\n\nstatic ERL_NIF_TERM append_result_set(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    try\n    {\n        ERL_NIF_TERM result;\n        nifpp::resource_ptr<ResultSet> ptr;\n        std::vector<std::vector<nifpp::TERM>> result_set;\n        std::vector<nifpp::TERM> input_result_set;\n        int uid;\n        nifpp::get(env, argv[0], ptr);\n        nifpp::get(env, argv[1], input_result_set);\n        nifpp::get(env, argv[2], uid);\n        std::vector<std::vector<nifpp::TERM>> new_result = (*ptr).append_result_set(input_result_set, uid, env);\n        return nifpp::make(env, new_result);\n        \/\/ return result;\n    }\n    catch(...) {}\n    return enif_make_badarg(env);\n}\n\nstatic ERL_NIF_TERM return_result_set(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    try\n    {\n        nifpp::resource_ptr<ResultSet> ptr;\n        if(nifpp::get(env, argv[0], ptr)==1)\n        {\n            std::vector<std::vector<nifpp::TERM>> new_result = (*ptr).get_final_result_set(env);\n            return nifpp::make(env, new_result);\n        }\n        else\n            return enif_make_badarg(env);\n    }\n    catch(...) {}\n    return enif_make_badarg(env);\n}\n\nstatic ERL_NIF_TERM nullify_result_set(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    try\n    {\n        ERL_NIF_TERM result;\n        nifpp::resource_ptr<ResultSet> ptr;\n        std::vector<std::vector<nifpp::TERM>> result_set;\n        std::vector<nifpp::TERM> input_result_set;\n        nifpp::get(env, argv[0], ptr);\n        \/\/ (*ptr) = NULL;\n\n    }\n    catch(...){}\n    return enif_make_badarg(env);\n}\n\nextern \"C\" {\n\nstatic ErlNifFunc nif_funcs[] = {\n                                    {\"initialize_result_set\", 1, initialize_result_set}, \n                                    {\"return_result_set\", 1, return_result_set},\n                                    {\"append_result_set\", 3, append_result_set},\n                                };\n\nERL_NIF_INIT(par_append_tuple, nif_funcs, load, NULL, NULL, NULL)\n\n}\/\/extern C<|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 \"net\/http\/http_auth_cache.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n\nnamespace {\n\n\/\/ Helper to find the containing directory of path. In RFC 2617 this is what\n\/\/ they call the \"last symbolic element in the absolute path\".\n\/\/ Examples:\n\/\/   \"\/foo\/bar.txt\" --> \"\/foo\/\"\n\/\/   \"\/foo\/\" --> \"\/foo\/\"\nstd::string GetParentDirectory(const std::string& path) {\n  std::string::size_type last_slash = path.rfind(\"\/\");\n  if (last_slash == std::string::npos) {\n    \/\/ No slash (absolute paths always start with slash, so this must be\n    \/\/ the proxy case which uses empty string).\n    DCHECK(path.empty());\n    return path;\n  }\n  return path.substr(0, last_slash + 1);\n}\n\n\/\/ Debug helper to check that |path| arguments are properly formed.\n\/\/ (should be absolute path, or empty string).\nvoid CheckPathIsValid(const std::string& path) {\n  DCHECK(path.empty() || path[0] == '\/');\n}\n\n\/\/ Return true if |path| is a subpath of |container|. In other words, is\n\/\/ |container| an ancestor of |path|?\nbool IsEnclosingPath(const std::string& container, const std::string& path) {\n  DCHECK(container.empty() || *(container.end() - 1) == '\/');\n  return ((container.empty() && path.empty()) ||\n          (!container.empty() && StartsWithASCII(path, container, true)));\n}\n\n\/\/ Debug helper to check that |origin| arguments are properly formed.\nvoid CheckOriginIsValid(const GURL& origin) {\n  DCHECK(origin.is_valid());\n  DCHECK(origin.SchemeIs(\"http\") || origin.SchemeIs(\"https\"));\n  DCHECK(origin.GetOrigin() == origin);\n}\n\n\/\/ Functor used by remove_if.\nstruct IsEnclosedBy {\n  explicit IsEnclosedBy(const std::string& path) : path(path) { }\n  bool operator() (const std::string& x) {\n    return IsEnclosingPath(path, x);\n  }\n  const std::string& path;\n};\n\n}  \/\/ namespace\n\nnamespace net {\n\nHttpAuthCache::HttpAuthCache() {\n}\n\nHttpAuthCache::~HttpAuthCache() {\n}\n\n\/\/ Performance: O(n), where n is the number of realm entries.\nHttpAuthCache::Entry* HttpAuthCache::Lookup(const GURL& origin,\n                                            const std::string& realm,\n                                            HttpAuth::Scheme scheme) {\n  CheckOriginIsValid(origin);\n\n  \/\/ Linear scan through the realm entries.\n  for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {\n    if (it->origin() == origin && it->realm() == realm &&\n        it->scheme() == scheme)\n      return &(*it);\n  }\n  return NULL;  \/\/ No realm entry found.\n}\n\n\/\/ Performance: O(n*m), where n is the number of realm entries, m is the number\n\/\/ of path entries per realm. Both n amd m are expected to be small; m is\n\/\/ kept small because AddPath() only keeps the shallowest entry.\nHttpAuthCache::Entry* HttpAuthCache::LookupByPath(const GURL& origin,\n                                                  const std::string& path) {\n  CheckOriginIsValid(origin);\n  CheckPathIsValid(path);\n\n  \/\/ RFC 2617 section 2:\n  \/\/ A client SHOULD assume that all paths at or deeper than the depth of\n  \/\/ the last symbolic element in the path field of the Request-URI also are\n  \/\/ within the protection space ...\n  std::string parent_dir = GetParentDirectory(path);\n\n  \/\/ Linear scan through the realm entries.\n  for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {\n    if (it->origin() == origin && it->HasEnclosingPath(parent_dir))\n      return &(*it);\n  }\n  return NULL;  \/\/ No entry found.\n}\n\nHttpAuthCache::Entry* HttpAuthCache::Add(const GURL& origin,\n                                         const std::string& realm,\n                                         HttpAuth::Scheme scheme,\n                                         const std::string& auth_challenge,\n                                         const string16& username,\n                                         const string16& password,\n                                         const std::string& path) {\n  CheckOriginIsValid(origin);\n  CheckPathIsValid(path);\n\n  \/\/ Check for existing entry (we will re-use it if present).\n  HttpAuthCache::Entry* entry = Lookup(origin, realm, scheme);\n  if (!entry) {\n    \/\/ Failsafe to prevent unbounded memory growth of the cache.\n    if (entries_.size() >= kMaxNumRealmEntries) {\n      LOG(WARNING) << \"Num auth cache entries reached limit -- evicting\";\n      entries_.pop_back();\n    }\n\n    entries_.push_front(Entry());\n    entry = &entries_.front();\n    entry->origin_ = origin;\n    entry->realm_ = realm;\n    entry->scheme_ = scheme;\n  }\n  DCHECK_EQ(origin, entry->origin_);\n  DCHECK_EQ(realm, entry->realm_);\n  DCHECK_EQ(scheme, entry->scheme_);\n\n  entry->auth_challenge_ = auth_challenge;\n  entry->username_ = username;\n  entry->password_ = password;\n  entry->nonce_count_ = 1;\n  entry->AddPath(path);\n\n  return entry;\n}\n\nHttpAuthCache::Entry::~Entry() {\n}\n\nvoid HttpAuthCache::Entry::UpdateStaleChallenge(\n    const std::string& auth_challenge) {\n  auth_challenge_ = auth_challenge;\n  nonce_count_ = 1;\n}\n\nHttpAuthCache::Entry::Entry()\n    : nonce_count_(0) {\n}\n\nvoid HttpAuthCache::Entry::AddPath(const std::string& path) {\n  std::string parent_dir = GetParentDirectory(path);\n  if (!HasEnclosingPath(parent_dir)) {\n    \/\/ Remove any entries that have been subsumed by the new entry.\n    paths_.remove_if(IsEnclosedBy(parent_dir));\n\n    \/\/ Failsafe to prevent unbounded memory growth of the cache.\n    if (paths_.size() >= kMaxNumPathsPerRealmEntry) {\n      LOG(WARNING) << \"Num path entries for \" << origin()\n                   << \" has grown too large -- evicting\";\n      paths_.pop_back();\n    }\n\n    \/\/ Add new path.\n    paths_.push_front(parent_dir);\n  }\n}\n\nbool HttpAuthCache::Entry::HasEnclosingPath(const std::string& dir) {\n  DCHECK(GetParentDirectory(dir) == dir);\n  for (PathList::const_iterator it = paths_.begin(); it != paths_.end();\n       ++it) {\n    if (IsEnclosingPath(*it, dir))\n      return true;\n  }\n  return false;\n}\n\nbool HttpAuthCache::Remove(const GURL& origin,\n                           const std::string& realm,\n                           HttpAuth::Scheme scheme,\n                           const string16& username,\n                           const string16& password) {\n  for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {\n    if (it->origin() == origin && it->realm() == realm &&\n        it->scheme() == scheme) {\n      if (username == it->username() && password == it->password()) {\n        entries_.erase(it);\n        return true;\n      }\n      return false;\n    }\n  }\n  return false;\n}\n\nbool HttpAuthCache::UpdateStaleChallenge(const GURL& origin,\n                                         const std::string& realm,\n                                         HttpAuth::Scheme scheme,\n                                         const std::string& auth_challenge) {\n  HttpAuthCache::Entry* entry = Lookup(origin, realm, scheme);\n  if (!entry)\n    return false;\n  entry->UpdateStaleChallenge(auth_challenge);\n  return true;\n}\n\n}  \/\/ namespace net\n<commit_msg>Fix Coverity UNINIT_CTOR defect in the HttpAuthCache::Entry constructor.<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 \"net\/http\/http_auth_cache.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n\nnamespace {\n\n\/\/ Helper to find the containing directory of path. In RFC 2617 this is what\n\/\/ they call the \"last symbolic element in the absolute path\".\n\/\/ Examples:\n\/\/   \"\/foo\/bar.txt\" --> \"\/foo\/\"\n\/\/   \"\/foo\/\" --> \"\/foo\/\"\nstd::string GetParentDirectory(const std::string& path) {\n  std::string::size_type last_slash = path.rfind(\"\/\");\n  if (last_slash == std::string::npos) {\n    \/\/ No slash (absolute paths always start with slash, so this must be\n    \/\/ the proxy case which uses empty string).\n    DCHECK(path.empty());\n    return path;\n  }\n  return path.substr(0, last_slash + 1);\n}\n\n\/\/ Debug helper to check that |path| arguments are properly formed.\n\/\/ (should be absolute path, or empty string).\nvoid CheckPathIsValid(const std::string& path) {\n  DCHECK(path.empty() || path[0] == '\/');\n}\n\n\/\/ Return true if |path| is a subpath of |container|. In other words, is\n\/\/ |container| an ancestor of |path|?\nbool IsEnclosingPath(const std::string& container, const std::string& path) {\n  DCHECK(container.empty() || *(container.end() - 1) == '\/');\n  return ((container.empty() && path.empty()) ||\n          (!container.empty() && StartsWithASCII(path, container, true)));\n}\n\n\/\/ Debug helper to check that |origin| arguments are properly formed.\nvoid CheckOriginIsValid(const GURL& origin) {\n  DCHECK(origin.is_valid());\n  DCHECK(origin.SchemeIs(\"http\") || origin.SchemeIs(\"https\"));\n  DCHECK(origin.GetOrigin() == origin);\n}\n\n\/\/ Functor used by remove_if.\nstruct IsEnclosedBy {\n  explicit IsEnclosedBy(const std::string& path) : path(path) { }\n  bool operator() (const std::string& x) {\n    return IsEnclosingPath(path, x);\n  }\n  const std::string& path;\n};\n\n}  \/\/ namespace\n\nnamespace net {\n\nHttpAuthCache::HttpAuthCache() {\n}\n\nHttpAuthCache::~HttpAuthCache() {\n}\n\n\/\/ Performance: O(n), where n is the number of realm entries.\nHttpAuthCache::Entry* HttpAuthCache::Lookup(const GURL& origin,\n                                            const std::string& realm,\n                                            HttpAuth::Scheme scheme) {\n  CheckOriginIsValid(origin);\n\n  \/\/ Linear scan through the realm entries.\n  for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {\n    if (it->origin() == origin && it->realm() == realm &&\n        it->scheme() == scheme)\n      return &(*it);\n  }\n  return NULL;  \/\/ No realm entry found.\n}\n\n\/\/ Performance: O(n*m), where n is the number of realm entries, m is the number\n\/\/ of path entries per realm. Both n amd m are expected to be small; m is\n\/\/ kept small because AddPath() only keeps the shallowest entry.\nHttpAuthCache::Entry* HttpAuthCache::LookupByPath(const GURL& origin,\n                                                  const std::string& path) {\n  CheckOriginIsValid(origin);\n  CheckPathIsValid(path);\n\n  \/\/ RFC 2617 section 2:\n  \/\/ A client SHOULD assume that all paths at or deeper than the depth of\n  \/\/ the last symbolic element in the path field of the Request-URI also are\n  \/\/ within the protection space ...\n  std::string parent_dir = GetParentDirectory(path);\n\n  \/\/ Linear scan through the realm entries.\n  for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {\n    if (it->origin() == origin && it->HasEnclosingPath(parent_dir))\n      return &(*it);\n  }\n  return NULL;  \/\/ No entry found.\n}\n\nHttpAuthCache::Entry* HttpAuthCache::Add(const GURL& origin,\n                                         const std::string& realm,\n                                         HttpAuth::Scheme scheme,\n                                         const std::string& auth_challenge,\n                                         const string16& username,\n                                         const string16& password,\n                                         const std::string& path) {\n  CheckOriginIsValid(origin);\n  CheckPathIsValid(path);\n\n  \/\/ Check for existing entry (we will re-use it if present).\n  HttpAuthCache::Entry* entry = Lookup(origin, realm, scheme);\n  if (!entry) {\n    \/\/ Failsafe to prevent unbounded memory growth of the cache.\n    if (entries_.size() >= kMaxNumRealmEntries) {\n      LOG(WARNING) << \"Num auth cache entries reached limit -- evicting\";\n      entries_.pop_back();\n    }\n\n    entries_.push_front(Entry());\n    entry = &entries_.front();\n    entry->origin_ = origin;\n    entry->realm_ = realm;\n    entry->scheme_ = scheme;\n  }\n  DCHECK_EQ(origin, entry->origin_);\n  DCHECK_EQ(realm, entry->realm_);\n  DCHECK_EQ(scheme, entry->scheme_);\n\n  entry->auth_challenge_ = auth_challenge;\n  entry->username_ = username;\n  entry->password_ = password;\n  entry->nonce_count_ = 1;\n  entry->AddPath(path);\n\n  return entry;\n}\n\nHttpAuthCache::Entry::~Entry() {\n}\n\nvoid HttpAuthCache::Entry::UpdateStaleChallenge(\n    const std::string& auth_challenge) {\n  auth_challenge_ = auth_challenge;\n  nonce_count_ = 1;\n}\n\nHttpAuthCache::Entry::Entry()\n    : scheme_(HttpAuth::AUTH_SCHEME_MAX),\n      nonce_count_(0) {\n}\n\nvoid HttpAuthCache::Entry::AddPath(const std::string& path) {\n  std::string parent_dir = GetParentDirectory(path);\n  if (!HasEnclosingPath(parent_dir)) {\n    \/\/ Remove any entries that have been subsumed by the new entry.\n    paths_.remove_if(IsEnclosedBy(parent_dir));\n\n    \/\/ Failsafe to prevent unbounded memory growth of the cache.\n    if (paths_.size() >= kMaxNumPathsPerRealmEntry) {\n      LOG(WARNING) << \"Num path entries for \" << origin()\n                   << \" has grown too large -- evicting\";\n      paths_.pop_back();\n    }\n\n    \/\/ Add new path.\n    paths_.push_front(parent_dir);\n  }\n}\n\nbool HttpAuthCache::Entry::HasEnclosingPath(const std::string& dir) {\n  DCHECK(GetParentDirectory(dir) == dir);\n  for (PathList::const_iterator it = paths_.begin(); it != paths_.end();\n       ++it) {\n    if (IsEnclosingPath(*it, dir))\n      return true;\n  }\n  return false;\n}\n\nbool HttpAuthCache::Remove(const GURL& origin,\n                           const std::string& realm,\n                           HttpAuth::Scheme scheme,\n                           const string16& username,\n                           const string16& password) {\n  for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {\n    if (it->origin() == origin && it->realm() == realm &&\n        it->scheme() == scheme) {\n      if (username == it->username() && password == it->password()) {\n        entries_.erase(it);\n        return true;\n      }\n      return false;\n    }\n  }\n  return false;\n}\n\nbool HttpAuthCache::UpdateStaleChallenge(const GURL& origin,\n                                         const std::string& realm,\n                                         HttpAuth::Scheme scheme,\n                                         const std::string& auth_challenge) {\n  HttpAuthCache::Entry* entry = Lookup(origin, realm, scheme);\n  if (!entry)\n    return false;\n  entry->UpdateStaleChallenge(auth_challenge);\n  return true;\n}\n\n}  \/\/ namespace net\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>always include fcntl.h<commit_after><|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 <iostream>\n#include <memory>\n#include <boost\/asio.hpp>\n\nusing boost::asio::ip::tcp;\n\nclass tcp_client : private boost::noncopyable {\n  tcp::socket socket_;\n\n  void do_connect(tcp::resolver::iterator epiter) {\n    boost::asio::async_connect(socket_, epiter,\n        [this](const boost::system::error_code& ec, tcp::resolver::iterator) {\n          if (!ec) {\n            std::cout << \"tcp.client connect to server success ...\" << std::endl;\n\n            do_read();\n            do_write();\n          }\n          else {\n            socket_.close();\n          }\n        });\n  }\n\n  void do_read(void) {\n    char buf[1024]{};\n    socket_.async_read_some(boost::asio::buffer(buf, sizeof(buf)),\n        [this, &buf](const boost::system::error_code& ec, std::size_t \/*n*\/) {\n          if (!ec)\n            std::cout << \"echo reply: \" << buf << std::endl;\n\n          socket_.close();\n        });\n  }\n\n  void do_write(void) {\n    std::string echo_msg = \"Hello, world!\";\n    boost::asio::async_write(socket_, boost::asio::buffer(echo_msg),\n        [this](boost::system::error_code ec, std::size_t \/*n*\/) {\n          if (ec)\n            socket_.close();\n        });\n  }\npublic:\n  tcp_client(boost::asio::io_service& io_service)\n    : socket_(io_service) {\n  }\n\n  void start(tcp::resolver::iterator epiter) {\n    do_connect(epiter);\n  }\n};\n\nint main(int argc, char* argv[]) {\n  ((void)argc), ((void)argv);\n\n  boost::asio::io_service io_service;\n\n  tcp_client client(io_service);\n  tcp::resolver r(io_service);\n  client.start(r.resolve({\"127.0.0.1\", \"5555\"}));\n\n  io_service.run();\n\n  return 0;\n}\n<commit_msg>:bug: fix(asio.client): fixed client bug about async-handler running in other thread<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 <iostream>\n#include <memory>\n#include <boost\/asio.hpp>\n\nusing boost::asio::ip::tcp;\n\nclass tcp_client : private boost::noncopyable, public std::enable_shared_from_this<tcp_client> {\n  tcp::socket socket_;\n\n  void do_connect(tcp::resolver::iterator epiter) {\n    auto self(shared_from_this());\n    boost::asio::async_connect(socket_, epiter,\n        [this, self](const boost::system::error_code& ec, tcp::resolver::iterator) {\n          if (!ec) {\n            std::cout << \"tcp.client connect to server success ...\" << std::endl;\n\n            do_read();\n            do_write();\n          }\n          else {\n            socket_.close();\n          }\n        });\n  }\n\n  void do_read(void) {\n    char buf[1024]{};\n    auto self(shared_from_this());\n    socket_.async_read_some(boost::asio::buffer(buf, sizeof(buf)),\n        [this, self, &buf](const boost::system::error_code& ec, std::size_t \/*n*\/) {\n          if (!ec)\n            std::cout << \"echo reply: \" << buf << std::endl;\n\n          socket_.close();\n        });\n  }\n\n  void do_write(void) {\n    std::string echo_msg = \"Hello, world!\";\n    auto self(shared_from_this());\n    boost::asio::async_write(socket_, boost::asio::buffer(echo_msg),\n        [this, self](boost::system::error_code ec, std::size_t \/*n*\/) {\n          if (ec)\n            socket_.close();\n        });\n  }\npublic:\n  tcp_client(boost::asio::io_service& io_service)\n    : socket_(io_service) {\n  }\n\n  void start(tcp::resolver::iterator epiter) {\n    do_connect(epiter);\n  }\n};\n\nint main(int argc, char* argv[]) {\n  ((void)argc), ((void)argv);\n\n  boost::asio::io_service io_service;\n\n  std::shared_ptr<tcp_client> client(new tcp_client(io_service));\n  tcp::resolver r(io_service);\n  client->start(r.resolve({\"127.0.0.1\", \"5555\"}));\n\n  io_service.run();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef THREAD_POOL_HPP\n#define THREAD_POOL_HPP\n\n#include <noncopyable.hpp>\n#include <worker.hpp>\n#include <work_distributor.hpp>\n#include <memory>\n#include <stdexcept>\n#include <vector>\n\nclass thread_pool_t : private noncopyable_t {\npublic:\n    enum {AUTODETECT = 0};\n\n    inline explicit thread_pool_t(size_t threads_count = AUTODETECT);\n\n    template <typename Handler>\n    inline void post(Handler &&handler);\n\nprivate:\n    typedef std::unique_ptr<worker_t> worker_ptr;\n    std::vector<worker_ptr> m_pool;\n\n    work_distributor_t m_distributor;\n};\n\n\n\/\/\/ Implementation\n\ninline thread_pool_t::thread_pool_t(size_t threads_count)\n{\n    if (AUTODETECT == threads_count) {\n        threads_count = std::thread::hardware_concurrency();\n    }\n\n    if (0 == threads_count) {\n        threads_count = 1;\n    }\n\n    m_pool.resize(threads_count);\n\n    for (auto &worker : m_pool) {\n        worker.reset(new worker_t);\n        m_distributor.add_worker(worker.get());\n    }\n}\n\ntemplate <typename Handler>\ninline void thread_pool_t::post(Handler &&handler)\n{\n    worker_t *chosen = m_distributor.get_worker();\n    if (!chosen->post(std::forward<Handler>(handler)))\n    {\n        throw std::overflow_error(\"worker queue is full\");\n    }\n}\n\n#endif\n\n<commit_msg>code cleanup<commit_after>#ifndef THREAD_POOL_HPP\n#define THREAD_POOL_HPP\n\n#include <noncopyable.hpp>\n#include <worker.hpp>\n#include <work_distributor.hpp>\n#include <memory>\n#include <stdexcept>\n#include <vector>\n\nclass thread_pool_t : private noncopyable_t {\npublic:\n    enum {AUTODETECT = 0};\n\n    explicit thread_pool_t(size_t threads_count = AUTODETECT);\n\n    template <typename Handler>\n    void post(Handler &&handler);\n\nprivate:\n    typedef std::unique_ptr<worker_t> worker_ptr;\n    std::vector<worker_ptr> m_pool;\n\n    work_distributor_t m_distributor;\n};\n\n\n\/\/\/ Implementation\n\ninline thread_pool_t::thread_pool_t(size_t threads_count)\n{\n    if (AUTODETECT == threads_count) {\n        threads_count = std::thread::hardware_concurrency();\n    }\n\n    if (0 == threads_count) {\n        threads_count = 1;\n    }\n\n    m_pool.resize(threads_count);\n\n    for (auto &worker : m_pool) {\n        worker.reset(new worker_t);\n        m_distributor.add_worker(worker.get());\n    }\n}\n\ntemplate <typename Handler>\ninline void thread_pool_t::post(Handler &&handler)\n{\n    worker_t *chosen = m_distributor.get_worker();\n    if (!chosen->post(std::forward<Handler>(handler)))\n    {\n        throw std::overflow_error(\"worker queue is full\");\n    }\n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"event_loop_impl.h\"\n#include <sys\/eventfd.h>\n#include <unistd.h>\n#include <cassert>\n#include <cstring>\n#include \"exception.h\"\n#include \"system.h\"\n\ntemplate class std::unique_ptr<boson::event_loop>;\n\nnamespace boson {\nevent_loop::fd_data& event_loop::get_fd_data(int fd) {\n  size_t index = static_cast<size_t>(fd);\n  if (fd_data_.size() <= index) {\n    fd_data_.resize(index+1);\n  }\n  return fd_data_[index];\n}\n\nvoid event_loop::epoll_update(int fd, fd_data& fddata, bool del_if_no_event) {\n  if (events_.size() < events_data_.data().size()) events_.resize(events_data_.data().size());\n  epoll_event_t new_event{(0 <= fddata.idx_read ? (EPOLLIN | EPOLLET) : 0) | (0 <= fddata.idx_write ? (EPOLLOUT | EPOLLET): 0), {}};\n  new_event.data.fd = fd;\n  int return_code = -1;\n  if (0 != new_event.events) {\n    return_code = ::epoll_ctl(loop_fd_, EPOLL_CTL_MOD, fd, &new_event);\n    if (return_code < 0) {\n      if (ENOENT == errno) {\n        return_code = ::epoll_ctl(loop_fd_, EPOLL_CTL_ADD, fd, &new_event);\n      } else if (EBADF == errno) {\n        \/\/ Dispatch panic\n        if (0 <= fddata.idx_read)\n          dispatch_event(fddata.idx_read, event_status::panic);\n        if (0 <= fddata.idx_write)\n          dispatch_event(fddata.idx_write, event_status::panic);\n      }\n      else {\n        throw exception(std::string(\"Syscall error (epoll_ctl): \") + ::strerror(errno));\n      }\n    }\n  }\n  else {\n    return_code = ::epoll_ctl(loop_fd_, del_if_no_event ? EPOLL_CTL_DEL : EPOLL_CTL_MOD, fd, &new_event);\n    if (return_code < 0 && errno != EBADF) {\n      throw exception(std::string(\"Syscall error (epoll_ctl): \") + ::strerror(errno));\n    }\n  }\n}\n\nvoid event_loop::dispatch_event(int event_id, event_status status) {\n  auto& data = events_data_[event_id];\n  switch (data.type) {\n    case event_type::event_fd: {\n      size_t buffer{0};\n      ssize_t nb_bytes = ::read(data.fd, &buffer, 8u);\n      assert(nb_bytes == 8);\n      if (loop_breaker_event_ == event_id) {\n        \/\/ Empty the queue and send panics\n        broken_loop_event_data* data = nullptr;\n        while((data = static_cast<decltype(data)>(loop_breaker_queue_.read(0)))) {\n          \/\/ We just ignore fds we dont have\n          if (static_cast<size_t>(data->fd) < fd_data_.size()) {\n            auto& fddata = get_fd_data(data->fd);\n            if (0 <= fddata.idx_read)\n              dispatch_event(fddata.idx_read, event_status::panic);\n            if (0 <= fddata.idx_write)\n              dispatch_event(fddata.idx_write, event_status::panic);\n          }\n          delete data;\n        }\n      }\n      else {\n        handler_.event(event_id, data.data, status);\n      }\n    } break;\n    case event_type::read: {\n      handler_.read(data.fd, data.data, status);\n    } break;\n    case event_type::write: {\n      handler_.write(data.fd, data.data, status);\n    } break;\n  }\n}\n\nevent_loop::event_loop(event_handler& handler, int nprocs)\n    : handler_{handler},\n      loop_fd_{epoll_create1(0)},\n      nb_io_registered_(0),\n      trigger_fd_events_{false},\n      loop_breaker_event_{-1},\n      loop_breaker_queue_{nprocs+1} {\n  loop_breaker_event_ = register_event(nullptr);\n}\n\nevent_loop::~event_loop() {\n  ::close(loop_fd_);\n}\n\nint event_loop::register_event(void* data) {\n  \/\/ Creates an eventfd\n  int event_fd = ::eventfd(0, 0);\n\n  \/\/ Creates users data\n  size_t event_id = static_cast<int>(events_data_.allocate());\n  event_data& ev_data = events_data_[event_id];\n  ev_data.fd = event_fd;\n  ev_data.type = event_type::event_fd;\n  ev_data.data = data;\n  auto& fddata = get_fd_data(event_fd);\n  fddata.idx_read = event_id;\n  noio_events_.insert(event_id);\n\n  \/\/ Register\n  epoll_update(event_fd,fddata,false);\n\n  \/\/ Casted to int, we dont have to worry about scaling here, int is waaaaay large enough\n  return event_id;\n}\n\nvoid* event_loop::get_data(int event_id) {\n  return  (0 <= event_id) ?  events_data_[event_id].data : nullptr;\n}\n\nstd::tuple<int,int> event_loop::get_events(int fd) {\n  if (static_cast<size_t>(fd) < fd_data_.size()) {\n    auto& data = get_fd_data(fd);\n    return std::make_tuple(data.idx_read, data.idx_write);\n  }\n  return std::make_tuple(-1,-1);\n}\n\nvoid event_loop::send_event(int event) {\n  auto& data = events_data_[static_cast<size_t>(event)];\n  size_t buffer{1};\n  ssize_t nb_bytes = ::write(data.fd, &buffer, 8u);\n  if (nb_bytes < 0) {\n    throw exception(std::string(\"Syscall error (write): \") + strerror(errno));\n  }\n  trigger_fd_events_.store(true, std::memory_order_release);\n}\n\nint event_loop::register_read(int fd, void* data) {\n  \/\/ Creates users data\n  size_t event_id = static_cast<int>(events_data_.allocate());\n  event_data& ev_data = events_data_[event_id];\n  ev_data.fd = fd;\n  ev_data.type = event_type::read;\n  ev_data.data = data;\n  auto& fddata = get_fd_data(fd);\n  fddata.idx_read = event_id;\n\n  \/\/ Register in epoll loop\n  epoll_update(fd,fddata,false);\n\n  ++nb_io_registered_;\n  return event_id;\n}\n\nint event_loop::register_write(int fd, void* data) {\n  \/\/ Creates users data\n  size_t event_id = static_cast<int>(events_data_.allocate());\n  event_data& ev_data = events_data_[event_id];\n  ev_data.fd = fd;\n  ev_data.type = event_type::write;\n  ev_data.data = data;\n  auto& fddata = get_fd_data(fd);\n  fddata.idx_write = event_id;\n\n  \/\/ Register in epoll loop\n  epoll_update(fd,fddata,false);\n\n  ++nb_io_registered_;\n  return event_id;\n}\n\nvoid event_loop::disable(int event_id) {\n  auto& event_data = events_data_[event_id];\n  auto& fddata = get_fd_data(event_data.fd);\n  if (event_data.type == event_type::read || event_data.type == event_type::event_fd)\n    fddata.idx_read = -1;\n  else if (event_data.type == event_type::write)\n    fddata.idx_write = -1;\n\n  epoll_update(event_data.fd,fddata,false);\n  if (event_data.type != event_type::event_fd) --nb_io_registered_;\n}\n\nvoid event_loop::enable(int event_id) {\n  auto& event_data = events_data_[event_id];\n  auto& fddata = get_fd_data(event_data.fd);\n  if (event_data.type == event_type::read || event_data.type == event_type::event_fd)\n    fddata.idx_read = event_id;\n  else if (event_data.type == event_type::write)\n    fddata.idx_write = event_id;\n  epoll_update(event_data.fd,fddata,false);\n  if (event_data.type != event_type::event_fd) ++nb_io_registered_;\n}\n\nvoid* event_loop::unregister(int event_id) {\n  auto& event_data = events_data_[event_id];\n  auto& fddata = get_fd_data(event_data.fd);\n  if (event_data.type == event_type::read || event_data.type == event_type::event_fd)\n    fddata.idx_read = -1;\n  else if (event_data.type == event_type::write)\n    fddata.idx_write = -1;\n\n  \/\/epoll_update(event_data.fd, fddata,true);\n  epoll_update(event_data.fd, fddata, false);\n  if (event_data.type == event_type::event_fd)\n    noio_events_.erase(event_id);\n  else\n    --nb_io_registered_;\n  void* data = event_data.data;\n  events_data_.free(event_id);\n  return data;\n}\n\nvoid event_loop::send_fd_panic(int proc_from,int fd) {\n  loop_breaker_queue_.write(proc_from+1, new broken_loop_event_data{fd});\n  send_event(loop_breaker_event_);\n}\n\nloop_end_reason event_loop::loop(int max_iter, int timeout_ms) {\n  bool forever = (-1 == max_iter);\n  bool retry = false;\n  for (size_t index = 0; index < static_cast<size_t>(max_iter) || forever || retry; ++index) {\n    int return_code = 0;\n    retry = false;\n    if (0 != timeout_ms || 0 < nb_io_registered_ ||\n        trigger_fd_events_.load(std::memory_order_acquire)) {\n      trigger_fd_events_.store(false, std::memory_order_relaxed);\n      return_code = ::epoll_wait(loop_fd_, events_.data(), events_.size(), timeout_ms);\n      switch (return_code) {\n        case 0:\n          if (timeout_ms != 0)\n            return loop_end_reason::timed_out;\n          else\n            break;\n        case EINTR:\n          \/\/throw exception(std::string(\"Syscall error (epoll_wait) EINTR : \") + ::strerror(errno));\n          \/\/ TODO: real cause to be determined, happens under high contention\n          retry = true;\n          break;\n        case EBADF:\n          throw exception(std::string(\"Syscall error (epoll_wait) EBADF : \") + std::to_string(loop_fd_) + ::strerror(errno));\n          \/\/retry = true;\n          break;\n        case EFAULT:\n          throw exception(std::string(\"Syscall error (epoll_wait) EFAULT : \") + ::strerror(errno));\n        case EINVAL:\n          throw exception(std::string(\"Syscall error (epoll_wait) EINVAL : \") + ::strerror(errno));\n        default:\n          break;\n      }\n      \/\/ Success, get on on with dispatching events\n      for (int index = 0; index < return_code; ++index) {\n        auto& epoll_event = events_[index];\n        auto& fddata = get_fd_data(epoll_event.data.fd);\n        if (epoll_event.events & (EPOLLERR | EPOLLHUP | EPOLLRDHUP)) {\n          if (0 < fddata.idx_read)\n            dispatch_event(fddata.idx_read, event_status::panic);\n          if (0 < fddata.idx_write)\n            dispatch_event(fddata.idx_write, event_status::panic);\n        }\n        else {\n          if (epoll_event.events & EPOLLIN)\n            dispatch_event(fddata.idx_read, event_status::ok);\n          if (epoll_event.events & EPOLLOUT)\n            dispatch_event(fddata.idx_write, event_status::ok);\n        }\n      }\n    }\n  }\n  return loop_end_reason::max_iter_reached;\n}\n}\n<commit_msg>Retry in case of epoll_fd unavailable.<commit_after>#include \"event_loop_impl.h\"\n#include <sys\/eventfd.h>\n#include <unistd.h>\n#include <cassert>\n#include <cstring>\n#include \"exception.h\"\n#include \"system.h\"\n\ntemplate class std::unique_ptr<boson::event_loop>;\n\nnamespace boson {\nevent_loop::fd_data& event_loop::get_fd_data(int fd) {\n  size_t index = static_cast<size_t>(fd);\n  if (fd_data_.size() <= index) {\n    fd_data_.resize(index+1);\n  }\n  return fd_data_[index];\n}\n\nvoid event_loop::epoll_update(int fd, fd_data& fddata, bool del_if_no_event) {\n  if (events_.size() < events_data_.data().size()) events_.resize(events_data_.data().size());\n  epoll_event_t new_event{(0 <= fddata.idx_read ? (EPOLLIN | EPOLLET) : 0) | (0 <= fddata.idx_write ? (EPOLLOUT | EPOLLET): 0), {}};\n  new_event.data.fd = fd;\n  int return_code = -1;\n  if (0 != new_event.events) {\n    return_code = ::epoll_ctl(loop_fd_, EPOLL_CTL_MOD, fd, &new_event);\n    if (return_code < 0) {\n      if (ENOENT == errno) {\n        return_code = ::epoll_ctl(loop_fd_, EPOLL_CTL_ADD, fd, &new_event);\n      } else if (EBADF == errno) {\n        \/\/ Dispatch panic\n        if (0 <= fddata.idx_read)\n          dispatch_event(fddata.idx_read, event_status::panic);\n        if (0 <= fddata.idx_write)\n          dispatch_event(fddata.idx_write, event_status::panic);\n      }\n      else {\n        throw exception(std::string(\"Syscall error (epoll_ctl): \") + ::strerror(errno));\n      }\n    }\n  }\n  else {\n    return_code = ::epoll_ctl(loop_fd_, del_if_no_event ? EPOLL_CTL_DEL : EPOLL_CTL_MOD, fd, &new_event);\n    if (return_code < 0 && errno != EBADF) {\n      throw exception(std::string(\"Syscall error (epoll_ctl): \") + ::strerror(errno));\n    }\n  }\n}\n\nvoid event_loop::dispatch_event(int event_id, event_status status) {\n  auto& data = events_data_[event_id];\n  switch (data.type) {\n    case event_type::event_fd: {\n      size_t buffer{0};\n      ssize_t nb_bytes = ::read(data.fd, &buffer, 8u);\n      assert(nb_bytes == 8);\n      if (loop_breaker_event_ == event_id) {\n        \/\/ Empty the queue and send panics\n        broken_loop_event_data* data = nullptr;\n        while((data = static_cast<decltype(data)>(loop_breaker_queue_.read(0)))) {\n          \/\/ We just ignore fds we dont have\n          if (static_cast<size_t>(data->fd) < fd_data_.size()) {\n            auto& fddata = get_fd_data(data->fd);\n            if (0 <= fddata.idx_read)\n              dispatch_event(fddata.idx_read, event_status::panic);\n            if (0 <= fddata.idx_write)\n              dispatch_event(fddata.idx_write, event_status::panic);\n          }\n          delete data;\n        }\n      }\n      else {\n        handler_.event(event_id, data.data, status);\n      }\n    } break;\n    case event_type::read: {\n      handler_.read(data.fd, data.data, status);\n    } break;\n    case event_type::write: {\n      handler_.write(data.fd, data.data, status);\n    } break;\n  }\n}\n\nevent_loop::event_loop(event_handler& handler, int nprocs)\n    : handler_{handler},\n      loop_fd_{epoll_create1(0)},\n      nb_io_registered_(0),\n      trigger_fd_events_{false},\n      loop_breaker_event_{-1},\n      loop_breaker_queue_{nprocs+1} {\n  loop_breaker_event_ = register_event(nullptr);\n}\n\nevent_loop::~event_loop() {\n  ::close(loop_fd_);\n}\n\nint event_loop::register_event(void* data) {\n  \/\/ Creates an eventfd\n  int event_fd = ::eventfd(0, 0);\n\n  \/\/ Creates users data\n  size_t event_id = static_cast<int>(events_data_.allocate());\n  event_data& ev_data = events_data_[event_id];\n  ev_data.fd = event_fd;\n  ev_data.type = event_type::event_fd;\n  ev_data.data = data;\n  auto& fddata = get_fd_data(event_fd);\n  fddata.idx_read = event_id;\n  noio_events_.insert(event_id);\n\n  \/\/ Register\n  epoll_update(event_fd,fddata,false);\n\n  \/\/ Casted to int, we dont have to worry about scaling here, int is waaaaay large enough\n  return event_id;\n}\n\nvoid* event_loop::get_data(int event_id) {\n  return  (0 <= event_id) ?  events_data_[event_id].data : nullptr;\n}\n\nstd::tuple<int,int> event_loop::get_events(int fd) {\n  if (static_cast<size_t>(fd) < fd_data_.size()) {\n    auto& data = get_fd_data(fd);\n    return std::make_tuple(data.idx_read, data.idx_write);\n  }\n  return std::make_tuple(-1,-1);\n}\n\nvoid event_loop::send_event(int event) {\n  auto& data = events_data_[static_cast<size_t>(event)];\n  size_t buffer{1};\n  ssize_t nb_bytes = ::write(data.fd, &buffer, 8u);\n  if (nb_bytes < 0) {\n    throw exception(std::string(\"Syscall error (write): \") + strerror(errno));\n  }\n  trigger_fd_events_.store(true, std::memory_order_release);\n}\n\nint event_loop::register_read(int fd, void* data) {\n  \/\/ Creates users data\n  size_t event_id = static_cast<int>(events_data_.allocate());\n  event_data& ev_data = events_data_[event_id];\n  ev_data.fd = fd;\n  ev_data.type = event_type::read;\n  ev_data.data = data;\n  auto& fddata = get_fd_data(fd);\n  fddata.idx_read = event_id;\n\n  \/\/ Register in epoll loop\n  epoll_update(fd,fddata,false);\n\n  ++nb_io_registered_;\n  return event_id;\n}\n\nint event_loop::register_write(int fd, void* data) {\n  \/\/ Creates users data\n  size_t event_id = static_cast<int>(events_data_.allocate());\n  event_data& ev_data = events_data_[event_id];\n  ev_data.fd = fd;\n  ev_data.type = event_type::write;\n  ev_data.data = data;\n  auto& fddata = get_fd_data(fd);\n  fddata.idx_write = event_id;\n\n  \/\/ Register in epoll loop\n  epoll_update(fd,fddata,false);\n\n  ++nb_io_registered_;\n  return event_id;\n}\n\nvoid event_loop::disable(int event_id) {\n  auto& event_data = events_data_[event_id];\n  auto& fddata = get_fd_data(event_data.fd);\n  if (event_data.type == event_type::read || event_data.type == event_type::event_fd)\n    fddata.idx_read = -1;\n  else if (event_data.type == event_type::write)\n    fddata.idx_write = -1;\n\n  epoll_update(event_data.fd,fddata,false);\n  if (event_data.type != event_type::event_fd) --nb_io_registered_;\n}\n\nvoid event_loop::enable(int event_id) {\n  auto& event_data = events_data_[event_id];\n  auto& fddata = get_fd_data(event_data.fd);\n  if (event_data.type == event_type::read || event_data.type == event_type::event_fd)\n    fddata.idx_read = event_id;\n  else if (event_data.type == event_type::write)\n    fddata.idx_write = event_id;\n  epoll_update(event_data.fd,fddata,false);\n  if (event_data.type != event_type::event_fd) ++nb_io_registered_;\n}\n\nvoid* event_loop::unregister(int event_id) {\n  auto& event_data = events_data_[event_id];\n  auto& fddata = get_fd_data(event_data.fd);\n  if (event_data.type == event_type::read || event_data.type == event_type::event_fd)\n    fddata.idx_read = -1;\n  else if (event_data.type == event_type::write)\n    fddata.idx_write = -1;\n\n  \/\/epoll_update(event_data.fd, fddata,true);\n  epoll_update(event_data.fd, fddata, false);\n  if (event_data.type == event_type::event_fd)\n    noio_events_.erase(event_id);\n  else\n    --nb_io_registered_;\n  void* data = event_data.data;\n  events_data_.free(event_id);\n  return data;\n}\n\nvoid event_loop::send_fd_panic(int proc_from,int fd) {\n  loop_breaker_queue_.write(proc_from+1, new broken_loop_event_data{fd});\n  send_event(loop_breaker_event_);\n}\n\nloop_end_reason event_loop::loop(int max_iter, int timeout_ms) {\n  bool forever = (-1 == max_iter);\n  bool retry = false;\n  for (size_t index = 0; index < static_cast<size_t>(max_iter) || forever || retry; ++index) {\n    int return_code = 0;\n    retry = false;\n    if (0 != timeout_ms || 0 < nb_io_registered_ ||\n        trigger_fd_events_.load(std::memory_order_acquire)) {\n      trigger_fd_events_.store(false, std::memory_order_relaxed);\n      return_code = ::epoll_wait(loop_fd_, events_.data(), events_.size(), timeout_ms);\n      switch (return_code) {\n        case 0:\n          if (timeout_ms != 0)\n            return loop_end_reason::timed_out;\n          else\n            break;\n        case EINTR:\n          \/\/throw exception(std::string(\"Syscall error (epoll_wait) EINTR : \") + ::strerror(errno));\n          \/\/ TODO: real cause to be determined, happens under high contention\n          retry = true;\n          break;\n        case EBADF:\n          \/\/throw exception(std::string(\"Syscall error (epoll_wait) EBADF : \") + std::to_string(loop_fd_) + ::strerror(errno));\n          retry = true;\n          break;\n        case EFAULT:\n          throw exception(std::string(\"Syscall error (epoll_wait) EFAULT : \") + ::strerror(errno));\n        case EINVAL:\n          throw exception(std::string(\"Syscall error (epoll_wait) EINVAL : \") + ::strerror(errno));\n        default:\n          break;\n      }\n      \/\/ Success, get on on with dispatching events\n      for (int index = 0; index < return_code; ++index) {\n        auto& epoll_event = events_[index];\n        auto& fddata = get_fd_data(epoll_event.data.fd);\n        if (epoll_event.events & (EPOLLERR | EPOLLHUP | EPOLLRDHUP)) {\n          if (0 < fddata.idx_read)\n            dispatch_event(fddata.idx_read, event_status::panic);\n          if (0 < fddata.idx_write)\n            dispatch_event(fddata.idx_write, event_status::panic);\n        }\n        else {\n          if (epoll_event.events & EPOLLIN)\n            dispatch_event(fddata.idx_read, event_status::ok);\n          if (epoll_event.events & EPOLLOUT)\n            dispatch_event(fddata.idx_write, event_status::ok);\n        }\n      }\n    }\n  }\n  return loop_end_reason::max_iter_reached;\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n *  Copyright (c) 2014 Jamis Hoo \n *  Distributed under the MIT license \n *  (See accompanying file LICENSE or copy at http:\/\/opensource.org\/licenses\/MIT)\n *  \n *  Project: \n *  Filename: test.cc \n *  Version: 1.0\n *  Author: Jamis Hoo\n *  E-mail: hjm211324@gmail.com\n *  Date: Dec. 29, 2014\n *  Time: 11:10:09\n *  Description: \n *****************************************************************************\/\n#include <iostream>\n\nint main() {\n    std::cout << \"Hello world!\" << std::endl;\n\n}\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n<commit_msg>--allow-empty_message<commit_after>\/******************************************************************************\n *  Copyright (c) 2014 Jamis Hoo \n *  Distributed under the MIT license \n *  (See accompanying file LICENSE or copy at http:\/\/opensource.org\/licenses\/MIT)\n *  \n *  Project: \n *  Filename: test.cc \n *  Version: 1.0\n *  Author: Jamis Hoo\n *  E-mail: hjm211324@gmail.com\n *  Date: Dec. 29, 2014\n *  Time: 11:10:09\n *  Description: \n *****************************************************************************\/\n#include <iostream>\n\nint main() {\n    std::cout << \"Hello world!\" << std::endl;\n\n}\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2014 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 \"effects\/GrDisableColorXP.h\"\n#include \"GrProcessor.h\"\n#include \"gl\/GrGLXferProcessor.h\"\n\nclass GrGLDisableColorXP : public GrGLXferProcessor {\npublic:\n    GrGLDisableColorXP(const GrProcessor&) {}\n\n    ~GrGLDisableColorXP() SK_OVERRIDE {}\n\n    void emitCode(const EmitArgs& args) SK_OVERRIDE {}\n\n    void setData(const GrGLProgramDataManager&, const GrXferProcessor&) SK_OVERRIDE {}\n\n    static void GenKey(const GrProcessor&, const GrGLCaps&, GrProcessorKeyBuilder*) {}\n\nprivate:\n    typedef GrGLXferProcessor INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGrDisableColorXP::GrDisableColorXP() {\n    this->initClassID<GrDisableColorXP>();\n}\n\nvoid GrDisableColorXP::getGLProcessorKey(const GrGLCaps& caps, GrProcessorKeyBuilder* b) const {\n    GrGLDisableColorXP::GenKey(*this, caps, b);\n}\n\nGrGLXferProcessor* GrDisableColorXP::createGLInstance() const {\n    return SkNEW_ARGS(GrGLDisableColorXP, (*this));\n}\n\nvoid GrDisableColorXP::getBlendInfo(GrXferProcessor::BlendInfo* blendInfo) const {\n    blendInfo->fWriteColor = false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGrDisableColorXPFactory::GrDisableColorXPFactory() {\n    this->initClassID<GrDisableColorXPFactory>();\n}\n\nGrXferProcessor* GrDisableColorXPFactory::createXferProcessor(const GrProcOptInfo& colorPOI,\n                                                              const GrProcOptInfo& covPOI) const {\n    return GrDisableColorXP::Create();\n}\n\nGR_DEFINE_XP_FACTORY_TEST(GrDisableColorXPFactory);\n\nGrXPFactory* GrDisableColorXPFactory::TestCreate(SkRandom* random,\n                                                  GrContext*,\n                                                  const GrDrawTargetCaps&,\n                                                  GrTexture*[]) {\n    return GrDisableColorXPFactory::Create();\n}\n\n<commit_msg>Fix for disabled color writes xp on n6<commit_after>\/*\n * Copyright 2014 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 \"effects\/GrDisableColorXP.h\"\n#include \"GrProcessor.h\"\n#include \"gl\/GrGLXferProcessor.h\"\n#include \"gl\/builders\/GrGLFragmentShaderBuilder.h\"\n#include \"gl\/builders\/GrGLProgramBuilder.h\"\n\nclass GrGLDisableColorXP : public GrGLXferProcessor {\npublic:\n    GrGLDisableColorXP(const GrProcessor&) {}\n\n    ~GrGLDisableColorXP() SK_OVERRIDE {}\n\n    void emitCode(const EmitArgs& args) SK_OVERRIDE {\n        \/\/ This emit code should be empty. However, on the nexus 6 there is a driver bug where if\n        \/\/ you do not give gl_FragColor a value, the gl context is lost and we end up drawing\n        \/\/ nothing. So this fix just sets the gl_FragColor arbitrarily to 0.\n        GrGLFPFragmentBuilder* fsBuilder = args.fPB->getFragmentShaderBuilder();\n        fsBuilder->codeAppendf(\"%s = vec4(0);\", args.fOutputPrimary);\n    }\n\n    void setData(const GrGLProgramDataManager&, const GrXferProcessor&) SK_OVERRIDE {}\n\n    static void GenKey(const GrProcessor&, const GrGLCaps&, GrProcessorKeyBuilder*) {}\n\nprivate:\n    typedef GrGLXferProcessor INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGrDisableColorXP::GrDisableColorXP() {\n    this->initClassID<GrDisableColorXP>();\n}\n\nvoid GrDisableColorXP::getGLProcessorKey(const GrGLCaps& caps, GrProcessorKeyBuilder* b) const {\n    GrGLDisableColorXP::GenKey(*this, caps, b);\n}\n\nGrGLXferProcessor* GrDisableColorXP::createGLInstance() const {\n    return SkNEW_ARGS(GrGLDisableColorXP, (*this));\n}\n\nvoid GrDisableColorXP::getBlendInfo(GrXferProcessor::BlendInfo* blendInfo) const {\n    blendInfo->fWriteColor = false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGrDisableColorXPFactory::GrDisableColorXPFactory() {\n    this->initClassID<GrDisableColorXPFactory>();\n}\n\nGrXferProcessor* GrDisableColorXPFactory::createXferProcessor(const GrProcOptInfo& colorPOI,\n                                                              const GrProcOptInfo& covPOI) const {\n    return GrDisableColorXP::Create();\n}\n\nGR_DEFINE_XP_FACTORY_TEST(GrDisableColorXPFactory);\n\nGrXPFactory* GrDisableColorXPFactory::TestCreate(SkRandom* random,\n                                                  GrContext*,\n                                                  const GrDrawTargetCaps&,\n                                                  GrTexture*[]) {\n    return GrDisableColorXPFactory::Create();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/tmva $Id: SdivSqrtSplusB.cxx,v 1.9 2006\/11\/20 15:35:28 brun Exp $   \n\/\/ Author: Andreas Hoecker, Joerg Stelzer, Helge Voss\n\n\/**********************************************************************************\n * Project: TMVA - a Root-integrated toolkit for multivariate data analysis       *\n * Package: TMVA                                                                  *\n * Class  : SdivSqrtSplusB                                                        *\n * Web    : http:\/\/tmva.sourceforge.net                                           *\n *                                                                                *\n * Description: Implementation of the SdivSqrtSplusB as separation criterion      *\n *              s \/ sqrt( s+b )                                                   * \n *                                                                                *\n *                                                                                *\n * Authors (alphabetical):                                                        *\n *      Andreas Hoecker <Andreas.Hocker@cern.ch> - CERN, Switzerland              *\n *      Xavier Prudent  <prudent@lapp.in2p3.fr>  - LAPP, France                   *\n *      Helge Voss      <Helge.Voss@cern.ch>     - MPI-K Heidelberg, Germany      *\n *      Kai Voss        <Kai.Voss@cern.ch>       - U. of Victoria, Canada         *\n *                                                                                *\n * Copyright (c) 2005:                                                            *\n *      CERN, Switzerland,                                                        * \n *      U. of Victoria, Canada,                                                   * \n *      Heidelberg U., Germany,                                                   * \n *      LAPP, Annecy, France                                                      *\n *                                                                                *\n * Redistribution and use in source and binary forms, with or without             *\n * modification, are permitted according to the terms listed in LICENSE           *\n * (http:\/\/tmva.sourceforge.net\/LICENSE)                                          *\n **********************************************************************************\/\n\n#include \"TMVA\/SdivSqrtSplusB.h\"\n#include <cmath>\n\nClassImp(TMVA::SdivSqrtSplusB)\n   ;\n\n\/\/_______________________________________________________________________\nDouble_t  TMVA::SdivSqrtSplusB::GetSeparationIndex( const Double_t &s, const Double_t &b )\n{\n   \/\/ Index = S\/sqrt(S+B)  (statistical significance)                 \n   if (s+b > 0) return s \/ sqrt(s+b);\n   else return 0;\n}\n\n<commit_msg>Fix a problem with cmath on Solaris<commit_after>\/\/ @(#)root\/tmva $Id: SdivSqrtSplusB.cxx,v 1.10 2007\/01\/12 16:03:17 brun Exp $   \n\/\/ Author: Andreas Hoecker, Joerg Stelzer, Helge Voss\n\n\/**********************************************************************************\n * Project: TMVA - a Root-integrated toolkit for multivariate data analysis       *\n * Package: TMVA                                                                  *\n * Class  : SdivSqrtSplusB                                                        *\n * Web    : http:\/\/tmva.sourceforge.net                                           *\n *                                                                                *\n * Description: Implementation of the SdivSqrtSplusB as separation criterion      *\n *              s \/ sqrt( s+b )                                                   * \n *                                                                                *\n *                                                                                *\n * Authors (alphabetical):                                                        *\n *      Andreas Hoecker <Andreas.Hocker@cern.ch> - CERN, Switzerland              *\n *      Xavier Prudent  <prudent@lapp.in2p3.fr>  - LAPP, France                   *\n *      Helge Voss      <Helge.Voss@cern.ch>     - MPI-K Heidelberg, Germany      *\n *      Kai Voss        <Kai.Voss@cern.ch>       - U. of Victoria, Canada         *\n *                                                                                *\n * Copyright (c) 2005:                                                            *\n *      CERN, Switzerland,                                                        * \n *      U. of Victoria, Canada,                                                   * \n *      Heidelberg U., Germany,                                                   * \n *      LAPP, Annecy, France                                                      *\n *                                                                                *\n * Redistribution and use in source and binary forms, with or without             *\n * modification, are permitted according to the terms listed in LICENSE           *\n * (http:\/\/tmva.sourceforge.net\/LICENSE)                                          *\n **********************************************************************************\/\n\n#include \"TMVA\/SdivSqrtSplusB.h\"\n#include \"TMath.h\"\n\nClassImp(TMVA::SdivSqrtSplusB)\n\n\/\/_______________________________________________________________________\nDouble_t  TMVA::SdivSqrtSplusB::GetSeparationIndex( const Double_t &s, const Double_t &b )\n{\n   \/\/ Index = S\/sqrt(S+B)  (statistical significance)                 \n   if (s+b > 0) return s \/ TMath::Sqrt(s+b);\n   else return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * SOPMQ - Scalable optionally persistent message queue\n * Copyright 2014 InWorldz, 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\n#include \"gtest\/gtest.h\"\n\n#include \"server.h\"\n#include \"cluster_builder.h\"\n#include \"endpoint.h\"\n#include \"settings.h\"\n#include \"user_account.h\"\n\n#include <boost\/asio.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <memory>\n#include <functional>\n\nusing namespace sopmq::client;\nusing namespace sopmq::shared::net;\nusing sopmq::node::settings;\nusing sopmq::node::user_account;\n\nclass OperationsTest : public ::testing::Test\n{\nprotected:\n    boost::thread* thread;\n    boost::asio::io_service* ioService;\n    sopmq::node::server* s;\n    \n    virtual void SetUp()\n    {\n        \/\/if (settings::instance().cassandraSeeds.size() == 0) return;\n        \n        thread = new boost::thread(std::bind(&OperationsTest::do_run, this));\n        boost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n    }\n    \n    void do_run()\n    {\n        ioService = new boost::asio::io_service();\n        s = new sopmq::node::server(*ioService, 8481);\n        \n        s->start();\n        \n        ioService->run();\n    }\n    \n    virtual void TearDown()\n    {\n        \/\/if (settings::instance().cassandraSeeds.size() == 0) return;\n        \n        s->stop();\n    }\n};\n\nTEST_F(OperationsTest, TestAuthentication)\n{\n    if (settings::instance().cassandraSeeds.size() == 0) return;\n    \n    const char* const USERNAME = \"test\";\n    const char* const PASSWORD = \"test\";\n    \n    user_account::create(USERNAME, PASSWORD, 1);\n    \n    boost::asio::io_service clientIoService;\n    cluster_builder builder;\n    builder.add_endpoint(endpoint(\"sopmq1:\/\/127.0.0.1:8481\"));\n    \n    auto clstr = builder.build();\n    \n    bool authRan = false;\n    \n    auto authCb = [&](bool authd)\n    {\n        clientIoService.stop();\n        authRan = true;\n        ASSERT_TRUE(authd);\n    };\n    \n    session::ptr mSession;\n    auto connHandler = [&](session::ptr session, const sopmq::error::connection_error& e)\n    {\n        ASSERT_TRUE(session != nullptr) << e.what();\n        \n        \/\/make sure session stays in scope for the tests\n        mSession = session;\n        session->authenticate(\"test\", \"test\", authCb);\n    };\n    \n    clstr->connect(clientIoService, connHandler);\n    \n    boost::asio::io_service::work work(clientIoService);\n    clientIoService.run();\n    \n    ASSERT_TRUE(authRan);\n}\n\nTEST_F(OperationsTest, TestAuthenticationFailure)\n{\n    if (settings::instance().cassandraSeeds.size() == 0) return;\n    \n    const char* const USERNAME = \"test\";\n    const char* const PASSWORD = \"test\";\n    \n    user_account::create(USERNAME, PASSWORD, 1);\n    \n    boost::asio::io_service clientIoService;\n    cluster_builder builder;\n    builder.add_endpoint(endpoint(\"sopmq1:\/\/127.0.0.1:8481\"));\n    \n    auto clstr = builder.build();\n    \n    bool authRan = false;\n    auto authCb = [&](bool authd)\n    {\n        clientIoService.stop();\n        authRan = true;\n        ASSERT_FALSE(authd);\n    };\n    \n    session::ptr mSession;\n    auto connHandler = [&](session::ptr session, const sopmq::error::connection_error& e)\n    {\n        ASSERT_TRUE(session != nullptr) << e.what();\n        \n        \/\/make sure session stays in scope for the tests\n        mSession = session;\n        session->authenticate(\"testhjgasdh\", \"testdsadsadsa\", authCb);\n    };\n    \n    clstr->connect(clientIoService, connHandler);\n    \n    boost::asio::io_service::work work(clientIoService);\n    clientIoService.run();\n    \n    ASSERT_TRUE(authRan);\n}\n\nTEST_F(OperationsTest, TestUnitTestAuthentication)\n{\n    boost::asio::io_service clientIoService;\n    cluster_builder builder;\n    builder.add_endpoint(endpoint(\"sopmq1:\/\/127.0.0.1:8481\"));\n    \n    auto clstr = builder.build();\n    \n    bool authRan = false;\n    \n    auto authCb = [&](bool authd)\n    {\n        clientIoService.stop();\n        authRan = true;\n        ASSERT_TRUE(authd);\n    };\n    \n    session::ptr mSession;\n    auto connHandler = [&](session::ptr session, const sopmq::error::connection_error& e)\n    {\n        ASSERT_TRUE(session != nullptr) << e.what();\n        \n        \/\/make sure session stays in scope for the tests\n        mSession = session;\n        session->authenticate(settings::instance().unitTestUsername, \"\", authCb);\n    };\n    \n    clstr->connect(clientIoService, connHandler);\n    \n    boost::asio::io_service::work work(clientIoService);\n    clientIoService.run();\n    \n    ASSERT_TRUE(authRan);\n}\n\nTEST_F(OperationsTest, TestEnqueueMessage)\n{\n    boost::asio::io_service clientIoService;\n    cluster_builder builder;\n    builder.add_endpoint(endpoint(\"sopmq1:\/\/127.0.0.1:8481\"));\n    \n    auto clstr = builder.build();\n    \n    bool authRan = false;\n    \n    session::ptr mSession;\n    auto publishCb = [&](sopmq::shared::message::PublishMessageResponse pmr)\n    {\n        clientIoService.stop();\n        authRan = true;\n    };\n    \n    auto authCb = [&](bool authd)\n    {\n        ASSERT_TRUE(authd);\n        \n        mSession->publish_message(\"queue\", false, 10, \"Data\", publishCb);\n    };\n    \n    auto connHandler = [&](session::ptr session, const sopmq::error::connection_error& e)\n    {\n        ASSERT_TRUE(session != nullptr) << e.what();\n        \n        \/\/make sure session stays in scope for the tests\n        mSession = session;\n        session->authenticate(settings::instance().unitTestUsername, \"\", authCb);\n    };\n    \n    clstr->connect(clientIoService, connHandler);\n    \n    boost::asio::io_service::work work(clientIoService);\n    clientIoService.run();\n    \n    ASSERT_TRUE(authRan);\n}\n<commit_msg>'session' was conflicting with a definition in an OS X header all of a sudden<commit_after>\/*\n * SOPMQ - Scalable optionally persistent message queue\n * Copyright 2014 InWorldz, 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\n#include \"gtest\/gtest.h\"\n\n#include \"server.h\"\n#include \"cluster_builder.h\"\n#include \"endpoint.h\"\n#include \"settings.h\"\n#include \"user_account.h\"\n#include \"session.h\"\n\n#include <boost\/asio.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <memory>\n#include <functional>\n\nusing namespace sopmq::client;\nusing namespace sopmq::shared::net;\nusing sopmq::node::settings;\nusing sopmq::node::user_account;\n\nclass OperationsTest : public ::testing::Test\n{\nprotected:\n    boost::thread* thread;\n    boost::asio::io_service* ioService;\n    sopmq::node::server* s;\n    \n    virtual void SetUp()\n    {\n        \/\/if (settings::instance().cassandraSeeds.size() == 0) return;\n        \n        thread = new boost::thread(std::bind(&OperationsTest::do_run, this));\n        boost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n    }\n    \n    void do_run()\n    {\n        ioService = new boost::asio::io_service();\n        s = new sopmq::node::server(*ioService, 8481);\n        \n        s->start();\n        \n        ioService->run();\n    }\n    \n    virtual void TearDown()\n    {\n        \/\/if (settings::instance().cassandraSeeds.size() == 0) return;\n        \n        s->stop();\n    }\n};\n\nTEST_F(OperationsTest, TestAuthentication)\n{\n    if (settings::instance().cassandraSeeds.size() == 0) return;\n    \n    const char* const USERNAME = \"test\";\n    const char* const PASSWORD = \"test\";\n    \n    user_account::create(USERNAME, PASSWORD, 1);\n    \n    boost::asio::io_service clientIoService;\n    cluster_builder builder;\n    builder.add_endpoint(endpoint(\"sopmq1:\/\/127.0.0.1:8481\"));\n    \n    auto clstr = builder.build();\n    \n    bool authRan = false;\n    \n    auto authCb = [&](bool authd)\n    {\n        clientIoService.stop();\n        authRan = true;\n        ASSERT_TRUE(authd);\n    };\n    \n    sopmq::client::session::ptr mSession;\n    auto connHandler = [&](sopmq::client::session::ptr session, const sopmq::error::connection_error& e)\n    {\n        ASSERT_TRUE(session != nullptr) << e.what();\n        \n        \/\/make sure session stays in scope for the tests\n        mSession = session;\n        session->authenticate(\"test\", \"test\", authCb);\n    };\n    \n    clstr->connect(clientIoService, connHandler);\n    \n    boost::asio::io_service::work work(clientIoService);\n    clientIoService.run();\n    \n    ASSERT_TRUE(authRan);\n}\n\nTEST_F(OperationsTest, TestAuthenticationFailure)\n{\n    if (settings::instance().cassandraSeeds.size() == 0) return;\n    \n    const char* const USERNAME = \"test\";\n    const char* const PASSWORD = \"test\";\n    \n    user_account::create(USERNAME, PASSWORD, 1);\n    \n    boost::asio::io_service clientIoService;\n    cluster_builder builder;\n    builder.add_endpoint(endpoint(\"sopmq1:\/\/127.0.0.1:8481\"));\n    \n    auto clstr = builder.build();\n    \n    bool authRan = false;\n    auto authCb = [&](bool authd)\n    {\n        clientIoService.stop();\n        authRan = true;\n        ASSERT_FALSE(authd);\n    };\n    \n    sopmq::client::session::ptr mSession;\n    auto connHandler = [&](sopmq::client::session::ptr session, const sopmq::error::connection_error& e)\n    {\n        ASSERT_TRUE(session != nullptr) << e.what();\n        \n        \/\/make sure session stays in scope for the tests\n        mSession = session;\n        session->authenticate(\"testhjgasdh\", \"testdsadsadsa\", authCb);\n    };\n    \n    clstr->connect(clientIoService, connHandler);\n    \n    boost::asio::io_service::work work(clientIoService);\n    clientIoService.run();\n    \n    ASSERT_TRUE(authRan);\n}\n\nTEST_F(OperationsTest, TestUnitTestAuthentication)\n{\n    boost::asio::io_service clientIoService;\n    cluster_builder builder;\n    builder.add_endpoint(endpoint(\"sopmq1:\/\/127.0.0.1:8481\"));\n    \n    auto clstr = builder.build();\n    \n    bool authRan = false;\n    \n    auto authCb = [&](bool authd)\n    {\n        clientIoService.stop();\n        authRan = true;\n        ASSERT_TRUE(authd);\n    };\n    \n    sopmq::client::session::ptr mSession;\n    auto connHandler = [&](sopmq::client::session::ptr session, const sopmq::error::connection_error& e)\n    {\n        ASSERT_TRUE(session != nullptr) << e.what();\n        \n        \/\/make sure session stays in scope for the tests\n        mSession = session;\n        session->authenticate(settings::instance().unitTestUsername, \"\", authCb);\n    };\n    \n    clstr->connect(clientIoService, connHandler);\n    \n    boost::asio::io_service::work work(clientIoService);\n    clientIoService.run();\n    \n    ASSERT_TRUE(authRan);\n}\n\nTEST_F(OperationsTest, TestEnqueueMessage)\n{\n    boost::asio::io_service clientIoService;\n    cluster_builder builder;\n    builder.add_endpoint(endpoint(\"sopmq1:\/\/127.0.0.1:8481\"));\n    \n    auto clstr = builder.build();\n    \n    bool authRan = false;\n    \n    sopmq::client::session::ptr mSession;\n    auto publishCb = [&](sopmq::shared::message::PublishMessageResponse pmr)\n    {\n        clientIoService.stop();\n        authRan = true;\n    };\n    \n    auto authCb = [&](bool authd)\n    {\n        ASSERT_TRUE(authd);\n        \n        mSession->publish_message(\"queue\", false, 10, \"Data\", publishCb);\n    };\n    \n    auto connHandler = [&](sopmq::client::session::ptr session, const sopmq::error::connection_error& e)\n    {\n        ASSERT_TRUE(session != nullptr) << e.what();\n        \n        \/\/make sure session stays in scope for the tests\n        mSession = session;\n        session->authenticate(settings::instance().unitTestUsername, \"\", authCb);\n    };\n    \n    clstr->connect(clientIoService, connHandler);\n    \n    boost::asio::io_service::work work(clientIoService);\n    clientIoService.run();\n    \n    ASSERT_TRUE(authRan);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n\nint *list;\nint size;\nint sum;\n\nint main(void)\n{\n    size = 9;\n    sum = 15;\n    list = (int *)malloc(sizeof(int) * size);\n\n    list[0] = 1;\n    list[1] = 5;\n    list[2] = 8;\n    list[3] = 3;\n    list[4] = 7;\n    list[5] = 12;\n    list[6] = 11;\n    list[7] = 2;\n    list[8] = 6;\n\n    func(size - 1);\n\n    free(list);\n\n    return 0;\n}\n<commit_msg>Add solution of prob 2<commit_after>#include <stdio.h>\n#include <stdlib.h>\n\nvoid trim_out_of_range(void);\nint shift_right(const int idx, const int sum = 0);\nint shift_down(const int idx, const int sum = 0);\n\nint *list;\nint size;\nint sum;\n\nint main(void)\n{\n    printf(\"Enter n= \"); scanf(\"%d\", &size);\n\n    list = (int *)malloc(sizeof(int) * size);\n    for(int i = 0; i < size; i++)\n    {\n        printf(\"Enter list[%d]= \", i); scanf(\"%d\", &list[i]);\n    }\n\n    printf(\"Enter k= \"); scanf(\"%d\", &sum);\n\n    trim_out_of_range();\n    printf(\"Result: %d\\n\", shift_right(size - 1));\n\n    free(list);\n\n    return 0;\n}\n\nvoid trim_out_of_range(void)\n{\n    for(int i = size - 1; i >= 0; i--)\n        if(list[i] > sum)\n        {\n            for(int j = i; j < size; j++) list[j] = list[j + 1];\n            size--;\n        }\n}\n\nint shift_right(const int idx, const int sum)\n{\n    if(idx < 0 && sum == ::sum) return 1;\n    if(idx < 0) return 0;\n\n    return shift_right(idx - 1, sum + list[idx]) + shift_down(idx, sum);\n}\n\nint shift_down(const int idx, const int sum)\n{\n    if(idx - 1 < 0) return 0;\n    return shift_right(idx - 1, sum);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"AliHBTReaderTPC.h\"\n\n#include <Riostream.h>\n\/\/#include <Riostream.h>\n#include <TTree.h>\n#include <TFile.h>\n#include <TParticle.h>\n\n#include <AliRun.h>\n#include <AliMagF.h>\n#include <AliTPCtrack.h>\n#include <AliTPCParam.h>\n#include <AliTPCtracker.h>\n\n#include \"AliHBTRun.h\"\n#include \"AliHBTEvent.h\"\n#include \"AliHBTParticle.h\"\n#include \"AliHBTParticleCut.h\"\n\n\nClassImp(AliHBTReaderTPC)\n\/\/reader for TPC tracking\n\/\/needs galice.root, AliTPCtracks.root, AliTPCclusters.root, good_tracks_tpc \n\/\/\n\/\/more info: http:\/\/alisoft.cern.ch\/people\/skowron\/analyzer\/index.html\n\/\/Piotr.Skowronski@cern.ch\n\nAliHBTReaderTPC::\n AliHBTReaderTPC(const Char_t* trackfilename,const Char_t* clusterfilename,\n                 const Char_t* galicefilename):\n                 fTrackFileName(trackfilename),fClusterFileName(clusterfilename),\n                 fGAliceFileName(galicefilename)\n{\n  \/\/constructor, \n  \/\/Defaults:\n  \/\/  trackfilename = \"AliTPCtracks.root\"\n  \/\/  clusterfilename = \"AliTPCclusters.root\"\n  \/\/  galicefilename = \"\"  - this means: Do not open gAlice file - \n  \/\/                         just leave the global pointer untached\n  \n  fParticles = new AliHBTRun();\n  fTracks    = new AliHBTRun();\n  fIsRead = kFALSE;\n}\n\/********************************************************************\/\nAliHBTReaderTPC::\nAliHBTReaderTPC(TObjArray* dirs,\n                  const Char_t* trackfilename, const Char_t* clusterfilename,\n                  const Char_t* galicefilename):\n                  AliHBTReader(dirs), fTrackFileName(trackfilename),\n                  fClusterFileName(clusterfilename),fGAliceFileName(galicefilename)\n\n{\n  \/\/constructor, \n  \/\/Defaults:\n  \/\/  trackfilename = \"AliTPCtracks.root\"\n  \/\/  clusterfilename = \"AliTPCclusters.root\"\n  \/\/  galicefilename = \"\"  - this means: Do not open gAlice file - \n  \/\/                         just leave the global pointer untached\n  \n  fParticles = new AliHBTRun();\n  fTracks    = new AliHBTRun();\n  fIsRead = kFALSE;\n  \n}\n\/********************************************************************\/\n\nAliHBTReaderTPC::~AliHBTReaderTPC()\n {\n \/\/desctructor\n   delete fParticles;\n   delete fTracks;\n }\n\/********************************************************************\/\n\nAliHBTEvent* AliHBTReaderTPC::GetParticleEvent(Int_t n)\n {\n \/\/returns Nth event with simulated particles\n   if (!fIsRead) \n    if(Read(fParticles,fTracks))\n     {\n       Error(\"GetParticleEvent\",\"Error in reading\");\n       return 0x0;\n     }\n   return fParticles->GetEvent(n);\n }\n\/********************************************************************\/\nAliHBTEvent* AliHBTReaderTPC::GetTrackEvent(Int_t n)\n {\n \/\/returns Nth event with reconstructed tracks\n   if (!fIsRead) \n    if(Read(fParticles,fTracks))\n     {\n       Error(\"GetTrackEvent\",\"Error in reading\");\n       return 0x0;\n     }\n   return fTracks->GetEvent(n);\n }\n\/********************************************************************\/\n\nInt_t AliHBTReaderTPC::GetNumberOfPartEvents()\n {\n \/\/returns number of events of particles\n   if (!fIsRead) \n    if ( Read(fParticles,fTracks))\n     {\n       Error(\"GetNumberOfPartEvents\",\"Error in reading\");\n       return 0;\n     }\n   return fParticles->GetNumberOfEvents();\n }\n\n\/********************************************************************\/\nInt_t AliHBTReaderTPC::GetNumberOfTrackEvents()\n {\n \/\/returns number of events of tracks\n  if (!fIsRead)\n    if(Read(fParticles,fTracks))\n     {\n       Error(\"GetNumberOfTrackEvents\",\"Error in reading\");\n       return 0;\n     }\n  return fTracks->GetNumberOfEvents();\n }\n\/********************************************************************\/\n\n\nInt_t AliHBTReaderTPC::Read(AliHBTRun* particles, AliHBTRun *tracks)\n {\n \/\/reads data and puts put to the particles and tracks objects\n \/\/reurns 0 if everything is OK\n \/\/\n  cout<<\"AliHBTReaderTPC::Read()\"<<endl;\n  Int_t i; \/\/iterator and some temprary values\n  Int_t Nevents = 0;\n  Int_t totalNevents = 0;\n  TFile *aTracksFile;\/\/file with tracks\n  TFile *aClustersFile;\/\/file with clusters\n  TFile *aGAliceFile;\/\/!ile name with galice\n\n  if (!particles) \/\/check if an object is instatiated\n   {\n     Error(\"Read\",\" particles object must instatiated before passing it to the reader\");\n   }\n  if (!tracks)  \/\/check if an object is instatiated\n   {\n     Error(\"Read\",\" tracks object must instatiated before passing it to the reader\");\n   }\n  particles->Reset();\/\/clear runs == delete all old events\n  tracks->Reset();\n \n  TObjArray *tarray = new TObjArray(5000); \/\/cotainer for tpc tracks\n  tarray->SetOwner(); \/\/set the ownership of the objects it contains\n                      \/\/when array is is deleted or cleared all objects \n                      \/\/that it contains are deleted\n  Int_t currentdir = 0;\n\n  Int_t Ndirs;\n  if (fDirs) \/\/if array with directories is supplied by user\n   {\n     Ndirs = fDirs->GetEntries(); \/\/get the number if directories\n   }\n  else\n   {\n     Ndirs = 0; \/\/if the array is not supplied read only from current directory\n   }\n\n  do  \/\/do{}while; is OK even if 0 dirs specified. In that case we try to read from \".\/\"\n   {\n    \n    if( (i=OpenFiles(aTracksFile,aClustersFile,aGAliceFile,currentdir)) )\n     {\n       Error(\"Read\",\"Exiting due to problems with opening files. Errorcode %d\",i);\n       currentdir++;\n       continue;\n     }\n  \n    \n    if (gAlice->TreeE())\/\/check if tree E exists\n     {\n      Nevents = (Int_t)gAlice->TreeE()->GetEntries();\/\/if yes get number of events in gAlice\n      cout<<\"________________________________________________________\\n\";\n      cout<<\"Found \"<<Nevents<<\" event(s) in directory \"<<GetDirName(currentdir)<<endl;\n      cout<<\"Setting Magnetic Field: B=\"<<gAlice->Field()->SolenoidField()<<\"T\"<<endl;\n      AliKalmanTrack::SetConvConst(1000\/0.299792458\/gAlice->Field()->SolenoidField());\n     }\n    else\n     {\/\/if not return an error\n       Error(\"Read\",\"Can not find Header tree (TreeE) in gAlice\");\n       currentdir++;\n       continue;\n     }\n  \n    aClustersFile->cd();\/\/set cluster file active \n    AliTPCParam *TPCParam= (AliTPCParam*)aClustersFile->Get(\"75x40_100x60_150x60\");\n    if (!TPCParam) \n      { \n       TPCParam= (AliTPCParam*)aClustersFile->Get(\"75x40_100x60\");\n       if (!TPCParam) \n        { \n          Error(\"Read\",\"TPC parameters have not been found !\\n\");\n          currentdir++;\n          continue;\n        }\n      }\n\n  \n    for(Int_t currentEvent =0; currentEvent<Nevents;currentEvent++)\/\/loop over all events\n     {\n       cout<<\"Reading Event \"<<currentEvent<<endl;\n       \/**************************************\/\n        \/**************************************\/\n         \/**************************************\/ \n         \n         aTracksFile->cd();\/\/set track file active\n          \n         Char_t  treename[100];\n         sprintf(treename,\"TreeT_TPC_%d\",currentEvent);\/\/prepare name of the tree\n   \n         TTree *tracktree=0;\n         \n         tracktree=(TTree*)aTracksFile->Get(treename);\/\/get the tree \n         if (!tracktree) \/\/check if we got the tree\n          {\/\/if not return with error\n            Error(\"Read\",\"Can't get a tree with TPC tracks !\\n\"); \n            continue;\n          }\n   \n         TBranch *trackbranch=tracktree->GetBranch(\"tracks\");\/\/get the branch with tracks\n         if (!trackbranch) \/\/\/\/check if we got the branch\n          {\/\/if not return with error\n            Error(\"Read\",\"Can't get a branch with TPC tracks !\\n\"); \n            continue;\n          }\n         Int_t NTPCtracks=(Int_t)tracktree->GetEntries();\/\/get number of TPC tracks \n         cout<<\"Found \"<<NTPCtracks<<\" TPC tracks.\\n\";\n         \/\/Copy tracks to array\n         \n         AliTPCtrack *iotrack=0;\n         \n         aClustersFile->cd();\/\/set cluster file active \n         \/\/AliTPCtracker *tracker = new AliTPCtracker(TPCParam,currentEvent);\/\/create the tacker for this event\n         AliTPCtracker *tracker = new AliTPCtracker(TPCParam); \/\/I.B.\n         tracker->SetEventNumber(currentEvent);                \/\/I.B.\n         if (!tracker) \/\/check if it has created succeffuly\n          {\/\/if not return with error\n            Error(\"Read\",\"Can't get a tracker !\\n\"); \n            continue;\n          }\n         \/\/tracker->LoadInnerSectors(); \/\/I.B.\n         \/\/tracker->LoadOuterSectors(); \/\/I.B.\n         tracker->LoadClusters();       \/\/I.B.\n   \n         for (i=0; i<NTPCtracks; i++) \/\/loop over all tpc tracks\n          {\n            iotrack=new AliTPCtrack;   \/\/create new tracks\n            trackbranch->SetAddress(&iotrack); \/\/tell the branch ehere to put track data from tree(file)\n            tracktree->GetEvent(i); \/\/stream track i to the iotrack\n            tracker->CookLabel(iotrack,0.1); \/\/calculate (cook) the label of the tpc track\n                                             \/\/which is the label of corresponding simulated particle \n            tarray->AddLast(iotrack); \/\/put the track in the array\n          }\n         \n         aTracksFile->Delete(treename);\/\/delete tree from memmory (and leave untached on disk)- we do not need it any more\n         aTracksFile->Delete(\"tracks\");\/\/delete branch from memmory\n         delete tracker; \/\/delete tracker\n         \n         tracker = 0x0;\n         trackbranch = 0x0;\n         tracktree = 0x0;\n   \n         Double_t xk;\n         Double_t par[5];\n         Float_t phi, lam, pt;\/\/angles and transverse momentum\n         Int_t label; \/\/label of the current track\n         \n         aGAliceFile->cd();\n         gAlice->GetEvent(currentEvent); \n\n         gAlice->Particles();\n         \n         for (i=0; i<NTPCtracks; i++) \/\/loop over all good tracks\n          { \n            iotrack = (AliTPCtrack*)tarray->At(i);\n            label = iotrack->GetLabel();\n\n            if (label < 0) continue;\n            \n            TParticle *p = (TParticle*)gAlice->Particle(label);\n            \n            if(p == 0x0) continue; \/\/if returned pointer is NULL\n            if(p->GetPDG() == 0x0) continue; \/\/if particle has crezy PDG code (not known to our database)\n\t    \n            if(Pass(p->GetPdgCode())) continue; \/\/check if we are intersted with particles of this type \n                                        \/\/if not take next partilce\n            \n            AliHBTParticle* part = new AliHBTParticle(*p);\n            if(Pass(part)) { delete part; continue;}\/\/check if meets all criteria of any of our cuts\n                                                    \/\/if it does not delete it and take next good track\n         \n            iotrack->PropagateToVertex();\n\n            iotrack->GetExternalParameters(xk,par);     \/\/get properties of the track\n            phi=TMath::ASin(par[2]) + iotrack->GetAlpha(); \n            if (phi<-TMath::Pi()) phi+=2*TMath::Pi();\n            if (phi>=TMath::Pi()) phi-=2*TMath::Pi();\n            lam=par[3]; \n            pt=1.0\/TMath::Abs(par[4]);\n            \n            Double_t tpx = pt * TMath::Cos(phi); \/\/track x coordinate of momentum\n            Double_t tpy = pt * TMath::Sin(phi); \/\/track y coordinate of momentum\n            Double_t tpz = pt * lam; \/\/track z coordinate of momentum\n            \n            Double_t mass = p->GetMass();\n            Double_t tEtot = TMath::Sqrt( tpx*tpx + tpy*tpy + tpz*tpz + mass*mass);\/\/total energy of the track\n            \n            AliHBTParticle* track = new AliHBTParticle(p->GetPdgCode(), tpx, tpy , tpz, tEtot, 0., 0., 0., 0.);\n            if(Pass(track))\/\/check if meets all criteria of any of our cuts\n                         \/\/if it does not delete it and take next good track\n             { \n               delete track;\n               delete part;\n               continue;\n             }\n            particles->AddParticle(totalNevents,part);\/\/put track and particle on the run\n            tracks->AddParticle(totalNevents,track);\n\n          }\n         tarray->Clear(); \/\/clear the array\n         \n        \/**************************************\/\n       \/**************************************\/\n      \/**************************************\/  \n     totalNevents++;\n    }\n  \n    \/\/save environment (resouces) --\n    \/\/clean your place after the work\n    CloseFiles(aTracksFile,aClustersFile,aGAliceFile); \n    currentdir++;\n   }while(currentdir < Ndirs);\n\n\n  delete tarray;\n  fIsRead = kTRUE;\n  return 0;\n }\n\n\/********************************************************************\/\nInt_t AliHBTReaderTPC::OpenFiles\n(TFile*& aTracksFile, TFile*& aClustersFile, TFile*& agAliceFile,Int_t event)\n{\n \/\/opens all the files\n   \n   \n   const TString& dirname = GetDirName(event); \n   if (dirname == \"\")\n    {\n      Error(\"OpenFiles\",\"Can not get directory name\");\n      return 4;\n    }\n   \n   TString filename = dirname +\"\/\"+ fTrackFileName;\n   aTracksFile = TFile::Open(filename.Data());\n   if ( aTracksFile  == 0x0 ) \n     {\n       Error(\"OpenFiles\",\"Can't open file with tacks named %s\",filename.Data());\n       return 1;\n     }\n   if (!aTracksFile->IsOpen())\n     {\n       Error(\"OpenFiles\",\"Can't open file with tacks named %s\",filename.Data());\n       return 1;\n     }\n  \n   filename = dirname +\"\/\"+ fClusterFileName;\n   aClustersFile = TFile::Open(filename.Data());\n   if ( aClustersFile == 0x0 )\n    {\n      Error(\"OpenFiles\",\"Can't open file with TPC clusters named %s\",filename.Data());\n      return 2;\n    }\n   if (!aClustersFile->IsOpen())\n    {\n      Error(\"OpenFiles\",\"Can't open file with TPC clusters named %s\",filename.Data());\n      return 2;\n    }\n\n   filename = dirname +\"\/\"+ fGAliceFileName;\n   agAliceFile = TFile::Open(filename.Data());\n   if ( agAliceFile== 0x0)\n    {\n      Error(\"OpenFiles\",\"Can't open file with TPC clusters named %s\",filename.Data());\n      return 3;\n    }\n   if (!agAliceFile->IsOpen())\n    {\n      Error(\"OpenFiles\",\"Can't open file with TPC clusters named %s\",filename.Data());\n      return 3;\n    } \n   \n   if (!(gAlice=(AliRun*)agAliceFile->Get(\"gAlice\"))) \n    {\n      Error(\"OpenFiles\",\"gAlice have not been found on %s !\\n\",filename.Data());\n      return 5;\n    }\n\n   return 0; \n}\n\/********************************************************************\/\n\n\/********************************************************************\/\n  \nvoid AliHBTReaderTPC::CloseFiles(TFile*& tracksFile, TFile*& clustersFile, TFile*& gAliceFile)\n{\n  \/\/closes the files\n  tracksFile->Close();\n  delete tracksFile;\n  tracksFile = 0x0;\n  clustersFile->Close();\n  delete clustersFile;\n  clustersFile = 0x0;\n\n  delete gAlice;\n  gAlice = 0;\n\n  if (gAliceFile) \n   {\n     gAliceFile->Close();\n     delete gAliceFile;\n     gAliceFile = 0x0;\n   }\n}\n\n\/********************************************************************\/\n\n\/********************************************************************\/\n\/********************************************************************\/\n\/********************************************************************\/\n\n<commit_msg>Reverting to 1.10. Removing tracker - is not needed since labels are stored in tracks.<commit_after>#include \"AliHBTReaderTPC.h\"\n \n#include <TTree.h>\n#include <TFile.h>\n#include <TParticle.h>\n\n#include <AliRun.h>\n#include <AliMagF.h>\n#include <AliTPCtrack.h>\n#include <AliTPCParam.h>\n#include <AliTPCtracker.h>\n\n#include \"AliHBTRun.h\"\n#include \"AliHBTEvent.h\"\n#include \"AliHBTParticle.h\"\n#include \"AliHBTParticleCut.h\"\n\n\nClassImp(AliHBTReaderTPC)\n\/\/______________________________________________\n\/\/\n\/\/ class AliHBTReaderTPC\n\/\/\n\/\/reader for TPC tracking\n\/\/needs galice.root, AliTPCtracks.root, AliTPCclusters.root\n\/\/\n\/\/more info: http:\/\/alisoft.cern.ch\/people\/skowron\/analyzer\/index.html\n\/\/Piotr.Skowronski@cern.ch\n\/\/\n\nAliHBTReaderTPC:: AliHBTReaderTPC(const Char_t* trackfilename,\n                                  const Char_t* clusterfilename,\n                                  const Char_t* galicefilename):\n fTrackFileName(trackfilename),\n fClusterFileName(clusterfilename),\n fGAliceFileName(galicefilename)\n{\n  \/\/constructor, \n  \/\/Defaults:\n  \/\/  trackfilename = \"AliTPCtracks.root\"\n  \/\/  clusterfilename = \"AliTPCclusters.root\"\n  \/\/  galicefilename = \"\"  - this means: Do not open gAlice file - \n  \/\/                         just leave the global pointer untached\n  \n  fParticles = new AliHBTRun();\n  fTracks    = new AliHBTRun();\n  fIsRead = kFALSE;\n}\n\/********************************************************************\/\nAliHBTReaderTPC::AliHBTReaderTPC(TObjArray* dirs,\n                  const Char_t* trackfilename, const Char_t* clusterfilename,\n                  const Char_t* galicefilename):\n AliHBTReader(dirs), \n fTrackFileName(trackfilename),\n fClusterFileName(clusterfilename),\n fGAliceFileName(galicefilename)\n{\n  \/\/constructor, \n  \/\/Defaults:\n  \/\/  trackfilename = \"AliTPCtracks.root\"\n  \/\/  clusterfilename = \"AliTPCclusters.root\"\n  \/\/  galicefilename = \"\"  - this means: Do not open gAlice file - \n  \/\/                         just leave the global pointer untached\n  \n  fParticles = new AliHBTRun();\n  fTracks    = new AliHBTRun();\n  fIsRead = kFALSE;\n}\n\/********************************************************************\/\n\nAliHBTReaderTPC::~AliHBTReaderTPC()\n {\n \/\/desctructor\n   delete fParticles;\n   delete fTracks;\n }\n\/********************************************************************\/\n\nAliHBTEvent* AliHBTReaderTPC::GetParticleEvent(Int_t n)\n {\n \/\/returns Nth event with simulated particles\n   if (!fIsRead) \n    if(Read(fParticles,fTracks))\n     {\n       Error(\"GetParticleEvent\",\"Error in reading\");\n       return 0x0;\n     }\n   return fParticles->GetEvent(n);\n }\n\/********************************************************************\/\n\nAliHBTEvent* AliHBTReaderTPC::GetTrackEvent(Int_t n)\n {\n \/\/returns Nth event with reconstructed tracks\n   if (!fIsRead) \n    if(Read(fParticles,fTracks))\n     {\n       Error(\"GetTrackEvent\",\"Error in reading\");\n       return 0x0;\n     }\n   return fTracks->GetEvent(n);\n }\n\/********************************************************************\/\n\nInt_t AliHBTReaderTPC::GetNumberOfPartEvents()\n {\n \/\/returns number of events of particles\n   if (!fIsRead) \n    if ( Read(fParticles,fTracks))\n     {\n       Error(\"GetNumberOfPartEvents\",\"Error in reading\");\n       return 0;\n     }\n   return fParticles->GetNumberOfEvents();\n }\n\n\/********************************************************************\/\nInt_t AliHBTReaderTPC::GetNumberOfTrackEvents()\n {\n \/\/returns number of events of tracks\n  if (!fIsRead)\n    if(Read(fParticles,fTracks))\n     {\n       Error(\"GetNumberOfTrackEvents\",\"Error in reading\");\n       return 0;\n     }\n  return fTracks->GetNumberOfEvents();\n }\n\/********************************************************************\/\n\n\nInt_t AliHBTReaderTPC::Read(AliHBTRun* particles, AliHBTRun *tracks)\n {\n \/\/reads data and puts put to the particles and tracks objects\n \/\/reurns 0 if everything is OK\n \/\/\n  Info(\"Read\",\"\");\n  Int_t i; \/\/iterator and some temprary values\n  Int_t Nevents = 0;\n  Int_t totalNevents = 0;\n  TFile *aTracksFile;\/\/file with tracks\n  TFile *aClustersFile;\/\/file with clusters\n  TFile *aGAliceFile;\/\/!ile name with galice\n\n  if (!particles) \/\/check if an object is instatiated\n   {\n     Error(\"Read\",\" particles object must instatiated before passing it to the reader\");\n   }\n  if (!tracks)  \/\/check if an object is instatiated\n   {\n     Error(\"Read\",\" tracks object must instatiated before passing it to the reader\");\n   }\n  particles->Reset();\/\/clear runs == delete all old events\n  tracks->Reset();\n \n  TObjArray *tarray = new TObjArray(5000); \/\/cotainer for tpc tracks\n  tarray->SetOwner(); \/\/set the ownership of the objects it contains\n                      \/\/when array is is deleted or cleared all objects \n                      \/\/that it contains are deleted\n  Int_t currentdir = 0;\n\n  Int_t Ndirs;\n  if (fDirs) \/\/if array with directories is supplied by user\n   {\n     Ndirs = fDirs->GetEntries(); \/\/get the number if directories\n   }\n  else\n   {\n     Ndirs = 0; \/\/if the array is not supplied read only from current directory\n   }\n\n  do  \/\/do{}while; is OK even if 0 dirs specified. In that case we try to read from \".\/\"\n   {\n    \n    if( (i=OpenFiles(aTracksFile,aClustersFile,aGAliceFile,currentdir)) )\n     {\n       Error(\"Read\",\"Exiting due to problems with opening files. Errorcode %d\",i);\n       currentdir++;\n       continue;\n     }\n  \n    \n    if (gAlice->TreeE())\/\/check if tree E exists\n     {\n      Nevents = (Int_t)gAlice->TreeE()->GetEntries();\/\/if yes get number of events in gAlice\n      Info(\"Read\",\"________________________________________________________\");\n      Info(\"Read\",\"Found %d event(s) in directory %s\",Nevents,GetDirName(currentdir).Data());\n      Info(\"Read\",\"Setting Magnetic Field: B=%fT\",gAlice->Field()->SolenoidField());\n      AliKalmanTrack::SetConvConst(1000\/0.299792458\/gAlice->Field()->SolenoidField());\n     }\n    else\n     {\/\/if not return an error\n       Error(\"Read\",\"Can not find Header tree (TreeE) in gAlice\");\n       currentdir++;\n       continue;\n     }\n  \n    aClustersFile->cd();\/\/set cluster file active \n    AliTPCParam *TPCParam= (AliTPCParam*)aClustersFile->Get(\"75x40_100x60_150x60\");\n    if (!TPCParam) \n      { \n       TPCParam= (AliTPCParam*)aClustersFile->Get(\"75x40_100x60\");\n       if (!TPCParam) \n        { \n          Error(\"Read\",\"TPC parameters have not been found !\\n\");\n          currentdir++;\n          continue;\n        }\n      }\n\n  \n    for(Int_t currentEvent =0; currentEvent<Nevents;currentEvent++)\/\/loop over all events\n     {\n       Info(\"Read\",\"Reading Event %d\",currentEvent);\n       \/**************************************\/\n        \/**************************************\/\n         \/**************************************\/ \n         \n         aTracksFile->cd();\/\/set track file active\n          \n         Char_t  treename[100];\n         sprintf(treename,\"TreeT_TPC_%d\",currentEvent);\/\/prepare name of the tree\n   \n         TTree *tracktree=0;\n         \n         tracktree=(TTree*)aTracksFile->Get(treename);\/\/get the tree \n         if (!tracktree) \/\/check if we got the tree\n          {\/\/if not return with error\n            Error(\"Read\",\"Can't get a tree with TPC tracks !\\n\"); \n            continue;\n          }\n   \n         TBranch *trackbranch=tracktree->GetBranch(\"tracks\");\/\/get the branch with tracks\n         if (!trackbranch) \/\/\/\/check if we got the branch\n          {\/\/if not return with error\n            Error(\"Read\",\"Can't get a branch with TPC tracks !\\n\"); \n            continue;\n          }\n         Int_t NTPCtracks=(Int_t)tracktree->GetEntries();\/\/get number of TPC tracks \n         Info(\"Read\",\"Found %d TPC tracks.\",NTPCtracks);\n         \/\/Copy tracks to array\n         \n         AliTPCtrack *iotrack=0;\n         \n         aClustersFile->cd();\/\/set cluster file active \n   \n         for (i=0; i<NTPCtracks; i++) \/\/loop over all tpc tracks\n          {\n            iotrack=new AliTPCtrack;   \/\/create new tracks\n            trackbranch->SetAddress(&iotrack); \/\/tell the branch ehere to put track data from tree(file)\n            tracktree->GetEvent(i); \/\/stream track i to the iotrack\n            tarray->AddLast(iotrack); \/\/put the track in the array\n          }\n         \n         aTracksFile->Delete(treename);\/\/delete tree from memmory (and leave untached on disk)- we do not need it any more\n         aTracksFile->Delete(\"tracks\");\/\/delete branch from memmory\n         \n         trackbranch = 0x0;\n         tracktree = 0x0;\n   \n         Double_t xk;\n         Double_t par[5];\n         Float_t phi, lam, pt;\/\/angles and transverse momentum\n         Int_t label; \/\/label of the current track\n         \n         aGAliceFile->cd();\n         gAlice->GetEvent(currentEvent); \n\n         gAlice->Particles();\n         \n         for (i=0; i<NTPCtracks; i++) \/\/loop over all good tracks\n          { \n            iotrack = (AliTPCtrack*)tarray->At(i);\n            label = iotrack->GetLabel();\n            \n            if (label < 0) continue;\n            \n            \n            TParticle *p = (TParticle*)gAlice->Particle(label);\n            \n            if(p == 0x0) continue; \/\/if returned pointer is NULL\n            if(p->GetPDG() == 0x0) continue; \/\/if particle has crezy PDG code (not known to our database)\n\t    \n            if(Pass(p->GetPdgCode())) continue; \/\/check if we are intersted with particles of this type \n                                        \/\/if not take next partilce\n            AliHBTParticle* part = new AliHBTParticle(*p);\n            if(Pass(part)) { delete part; continue;}\/\/check if meets all criteria of any of our cuts\n                                                    \/\/if it does not delete it and take next good track\n         \n            iotrack->PropagateToVertex();\n\n            iotrack->GetExternalParameters(xk,par);     \/\/get properties of the track\n            phi=TMath::ASin(par[2]) + iotrack->GetAlpha(); \n            if (phi<-TMath::Pi()) phi+=2*TMath::Pi();\n            if (phi>=TMath::Pi()) phi-=2*TMath::Pi();\n            lam=par[3]; \n            pt=1.0\/TMath::Abs(par[4]);\n            \n            Double_t tpx = pt * TMath::Cos(phi); \/\/track x coordinate of momentum\n            Double_t tpy = pt * TMath::Sin(phi); \/\/track y coordinate of momentum\n            Double_t tpz = pt * lam; \/\/track z coordinate of momentum\n            \n            Double_t mass = p->GetMass();\n            Double_t tEtot = TMath::Sqrt( tpx*tpx + tpy*tpy + tpz*tpz + mass*mass);\/\/total energy of the track\n            \n            AliHBTParticle* track = new AliHBTParticle(p->GetPdgCode(), tpx, tpy , tpz, tEtot, 0., 0., 0., 0.);\n            if(Pass(track))\/\/check if meets all criteria of any of our cuts\n                         \/\/if it does not delete it and take next good track\n             { \n               delete track;\n               delete part;\n               continue;\n             }\n            particles->AddParticle(totalNevents,part);\/\/put track and particle on the run\n            tracks->AddParticle(totalNevents,track);\n          }\n         tarray->Clear(); \/\/clear the array\n         \n        \/**************************************\/\n       \/**************************************\/\n      \/**************************************\/  \n     totalNevents++;\n    }\n    \/\/save environment (resouces) --\n    \/\/clean your place after the work\n    CloseFiles(aTracksFile,aClustersFile,aGAliceFile); \n    currentdir++;\n   }while(currentdir < Ndirs);\n\n\n  delete tarray;\n  fIsRead = kTRUE;\n  return 0;\n }\n\n\/********************************************************************\/\nInt_t AliHBTReaderTPC::OpenFiles\n(TFile*& aTracksFile, TFile*& aClustersFile, TFile*& agAliceFile,Int_t event)\n{\n \/\/opens all the files\n   \n   \n   const TString& dirname = GetDirName(event); \n   if (dirname == \"\")\n    {\n      Error(\"OpenFiles\",\"Can not get directory name\");\n      return 4;\n    }\n   \n   TString filename = dirname +\"\/\"+ fTrackFileName;\n   aTracksFile = TFile::Open(filename.Data());\n   if ( aTracksFile  == 0x0 ) \n     {\n       Error(\"OpenFiles\",\"Can't open file with tacks named %s\",filename.Data());\n       return 1;\n     }\n   if (!aTracksFile->IsOpen())\n     {\n       Error(\"OpenFiles\",\"Can't open file with tacks named %s\",filename.Data());\n       return 1;\n     }\n  \n   filename = dirname +\"\/\"+ fClusterFileName;\n   aClustersFile = TFile::Open(filename.Data());\n   if ( aClustersFile == 0x0 )\n    {\n      Error(\"OpenFiles\",\"Can't open file with TPC clusters named %s\",filename.Data());\n      return 2;\n    }\n   if (!aClustersFile->IsOpen())\n    {\n      Error(\"OpenFiles\",\"Can't open file with TPC clusters named %s\",filename.Data());\n      return 2;\n    }\n\n   filename = dirname +\"\/\"+ fGAliceFileName;\n   agAliceFile = TFile::Open(filename.Data());\n   if ( agAliceFile== 0x0)\n    {\n      Error(\"OpenFiles\",\"Can't open file with TPC clusters named %s\",filename.Data());\n      return 3;\n    }\n   if (!agAliceFile->IsOpen())\n    {\n      Error(\"OpenFiles\",\"Can't open file with TPC clusters named %s\",filename.Data());\n      return 3;\n    } \n   \n   if (!(gAlice=(AliRun*)agAliceFile->Get(\"gAlice\"))) \n    {\n      Error(\"OpenFiles\",\"gAlice have not been found on %s !\\n\",filename.Data());\n      return 5;\n    }\n\n   return 0; \n}\n\/********************************************************************\/\n\n\/********************************************************************\/\n  \nvoid AliHBTReaderTPC::CloseFiles(TFile*& tracksFile, TFile*& clustersFile, TFile*& gAliceFile)\n{\n  \/\/closes the files\n  tracksFile->Close();\n  delete tracksFile;\n  tracksFile = 0x0;\n  clustersFile->Close();\n  delete clustersFile;\n  clustersFile = 0x0;\n\n  delete gAlice;\n  gAlice = 0;\n\n  if (gAliceFile) \n   {\n     gAliceFile->Close();\n     delete gAliceFile;\n     gAliceFile = 0x0;\n   }\n}\n\n\/********************************************************************\/\n\n\/********************************************************************\/\n\/********************************************************************\/\n\/********************************************************************\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 1997, 1998, 1999 by Alex Pfaffe\n\t(Digital Dawn Graphics Inc)\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\/\/ General includes\n#include <stdio.h>\n#include <string.h>\n\n#ifdef WIN32\n#include <io.h>\n#include <fcntl.h>\n#endif\n\n#include \"sysdef.h\"\n\/\/ DDG includes\n#include \"csterr\/ddghemap.h\"\n#include \"csterr\/ddgvec.h\"\n#include \"csterr\/ddgnoise.h\"\n#include \"csterr\/ddgerror.h\"\n\/\/ ----------------------------------------------------------------------\n\nddgHeightMap::~ddgHeightMap(void)\n{\n\tdelete _pixbuffer;\n}\n\nvoid ddgHeightMap::allocate( unsigned short r, unsigned short  c )\n{\n\t_cols = c;\n\t_rows = r;\n\tdelete _pixbuffer;\n\tassert(sizeof(short) == 2);\n\t_pixbuffer = new short[_cols*_rows];\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ load:\nbool ddgHeightMap::readMemory( unsigned short *buf )\n{\n\tint i;\n\tfor (i=0; i < _cols*_rows; i++)\n\t\t_pixbuffer[i] = buf[i];\n\treturn false;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ load:\n\nbool ddgHeightMap::writeTGN(char *filename, unsigned int base, unsigned int scale)\n{\n\tFILE *fptr = filename && filename[0] ? fopen(filename,\"wb\") : 0;\n\tunsigned long test_value = 0x12345678L;\n\tbool endian = (*((unsigned char*)&test_value) == 0x12);\n\n\tif (!fptr) {\n\t\tddgErrorSet(FileWrite,(char *) (filename ? filename : \"(null)\"));\n\t\tgoto error;\n\t}\n\n\t\/\/ Header\n\tif (fwrite(\"TERRAGENTERRAIN SIZE\",1,20,fptr) < 20)\n\t{\n\t\tddgErrorSet(FileWrite,\"Couldn't write header.\");\n\t\tgoto error;\n\t}\n\n\t\/\/ SIZE.\n\tunsigned char ch1, ch2;\n\tch1 = _cols % 256;\n\tch2 = _cols - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\t\/\/ Padding 2 bytes.\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\n\t\/\/ XPTS.\n\tif (fwrite(\"XPTS\",1,4,fptr) < 4)\n\t{\n\t\tddgErrorSet(FileWrite,\"Couldn't write XPTS.\");\n\t\tgoto error;\n\t}\n\n\tch1 = _cols % 256;\n\tch2 = _cols - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\t\/\/ Padding 2 bytes.\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\n\t\/\/ YPTS.\n\tif (fwrite(\"YPTS\",1,4,fptr) < 4)\n\t{\n\t\tddgErrorSet(FileWrite,\"Couldn't write YPTS.\");\n\t\tgoto error;\n\t}\n\n\tch1 = _rows % 256;\n\tch2 = _rows - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\t\/\/ Padding 2 bytes.\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\n\t\/\/ ALTW.\n\tif (fwrite(\"ALTW\",1,4,fptr) < 4)\n\t{\n\t\tddgErrorSet(FileWrite,\"Couldn't write ALTW.\");\n\t\tgoto error;\n\t}\n\n\tch1 = scale % 256;\n\tch2 = scale - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\n\tch1 = base % 256;\n\tch2 = base - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\n\t\/\/ Write data\n\tint r, c;\n\tr = 0;\n\n\twhile (r < _rows)\n\t{\n\t\tfor (c = 0; c < _cols; c++)\n\t\t{\n\t\t\tch1 = _pixbuffer[c + r * _cols] % 256;\n\t\t\tch2 = _pixbuffer[c + r * _cols] - ch1 * 256;\n\t\t\tfputc(ch1,fptr);\n\t\t\tfputc(ch2,fptr);\n\t\t}\n\t\tr++;\n\t}\n\t\/\/ File termination segment.\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\n\tfclose(fptr);\n\treturn true;\n\nerror:\n\tfclose(fptr);\n\tddgError::report();\n\treturn false;\n}\n\nbool ddgHeightMap::readTGN(char *file)\n{\n\tFILE *fptr = file && file[0] ? fopen(file,\"rb\") : 0;\n\tunsigned long test_value = 0x12345678L;\n\tbool endian = (*((unsigned char*)&test_value) == 0x12);\n\n\tif (!fptr)\n\t{\n\t\tddgErrorSet(FileRead,(char *) (file ? file : \"(null)\"));\n\t\tddgError::report();\n\t\treturn true;\n\t}\n\tunsigned char ch1, ch2;\n\n\tchar name[9],type[9], segment[5], pad[2];\n\n\t\/\/ Name 8 bytes.\n\tfread(name,8,1,fptr);\n\tname[8] = '\\0';\n\tfread(type,8,1,fptr);\n\ttype[8] = '\\0';\n\tif (!ddgStr::equal(name,\"TERRAGEN\") || !ddgStr::equal(type,\"TERRAIN \"))\n\t{\n\t\tddgErrorSet(FileRead,(char *) \"File is not a TERRAGEN TERRAIN file\");\n\t\tddgError::report();\n\t\treturn true;\n\t}\n\n\t\/\/ Segment 4 bytes.\n\tsegment[4] = '\\0';\n\n\tfread(segment,4,1,fptr);\n\n\tif (ddgStr::equal(segment,\"SIZE\"))\n\t{\n\t\t\/\/ SIZE 2 bytes.\n\t\tch1 = fgetc(fptr);\n\t\tch2 = fgetc(fptr);\n\t\t_rows = _cols = ch2*256+ch1 +1;\n\t\t\/\/ Padding 2 bytes.\n\t\tfread(pad,2,1,fptr);\n\t\tfread(segment,4,1,fptr);\n\t}\n\n\tif (ddgStr::equal(segment,\"XPTS\"))\n\t{\n\t\t\/\/ XPTS.\n\t\tch1 = fgetc(fptr);\n\t\tch2 = fgetc(fptr);\n\t\t_cols = ch2*256+ch1;\n\t\t\/\/ Padding 2 bytes.\n\t\tfread(pad,2,1,fptr);\n\n\t\tfread(segment,4,1,fptr);\n\t\t\/\/ YPTS.\n\t\tif (ddgStr::equal(segment,\"YPTS\"))\n\t\t{\n\t\t\tch1 = fgetc(fptr);\n\t\t\tch2 = fgetc(fptr);\n\t\t\t_rows = ch2*256+ch1;\n\t\t\t\/\/ Padding 2 bytes.\n\t\t\tfread(pad,2,1,fptr);\n\t\t\tfread(segment,4,1,fptr);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tddgErrorSet(FileRead,(char *) \"Expected YPTS segment, but it was not found.\");\n\t\t\tddgError::report();\n\t\t\treturn true;\n\t\t}\n\t}\n\n\t\/\/ ALTW.\n\t\/\/ Absolute elevation for a given point is\n\t\/\/ BaseHeight + elevation* Scale \/ 65536.\n\tif (ddgStr::equal(segment,\"ALTW\"))\n\t{\n\t\tch1 = fgetc(fptr);\n\t\tch2 = fgetc(fptr);\n\t\t_scale = (ch2*256+ch1)\/ 65536.0;\n\n\t\tch1 = fgetc(fptr);\n\t\tch2 = fgetc(fptr);\n\t\t_base = ch2*256+ch1;\n\t}\n\telse\n\t{\n\t\tddgErrorSet(FileRead,(char *) \"Expected ALTW segment, but it was not found.\");\n\t\tddgError::report();\n\t\treturn true;\n\t}\n\n\t\/\/ Read height data\n\t\/\/ The absolute altitude of a particular point (in the same scale as x and y)\n\t\/\/ is equal to BaseHeight + Elevation * HeightScale \/ 65536\n\tallocate(_cols,_rows);\n\tint r = 0;\n\tint cnt;\n\twhile (r < _rows)\n\t{\n\t\tif ((cnt = fread(&(_pixbuffer[r*_cols]),2,_cols,fptr)) <\n\t\t(int)_cols)\n\t\t{\n\t\t\tddgErrorSet(FileRead,(char *) (file ? file : \"(null)\"));\n\t\t\tddgError::report();\n\t\t\tif (feof(fptr))\n\t\t\t{\n\t\t\t\tddgErrorSet(FileAccess,\"Reached end of file!\");\n\t\t\t\tddgError::report();\n\t\t\t}\n\t\t\tfclose(fptr);\n\t\t\treturn true;\n\t\t}\n\t\tr++;\n\t}\n\t\/\/ Swap byte order for machines with different endian.\n\tif  (endian)\n\t{\n\t\tchar s;\n\t\tint i;\n\t\tchar* _pixchar = (char*)_pixbuffer;\n\n\t\tfor (i = 0; i < 2 * _rows * _cols; i=i+2)\n\t\t{\n\t\t\ts = _pixchar[i];\n\t\t\t_pixchar[i] = _pixchar[i+1];\n\t\t\t_pixchar[i+1] = s;\n\t\t}\n\t}\n\n\tfclose(fptr);\n\treturn false;\n}\n\n\n\nbool ddgHeightMap::generateHeights(unsigned int r, unsigned int c, float oct )\n{\n    allocate(r,c);\n\tunsigned int ci, ri;\n\tfloat lacun = 2.0;\n\tfloat fractalDim = 0.25;\n\tfloat offset = 0.7;\n\tdouble size = 3.0;  \/\/ sample range = 0 to 3 \n\tshort cc;\n\tdouble n;\n\tdouble v[3];\n\tv[0] = 0; v[1] = 0; v[2] = 0;\n\tfor (ri = 0; ri < r; ri++)\n\t{\n\t\tv[1] = 0.0f;\n\t\tfor (ci = 0; ci < c; ci++)\n\t\t{\n\t\t\tn = ddgNoise::hybridmultifractal(v,fractalDim,lacun,oct,offset);\t\/\/ Returns 0 to 1.\n\t\t\tcc = (short) ddgUtil::clamp(n*75.0,0,255);\t\/\/ Scale to fill range.\n\t\t\tset(ri,ci, cc);\n\t\t\tv[1]+= size\/c;\n\t\t}\n\tv[0]+= size\/r;\n\t}\n\n  \n\treturn true;\n}\n\nvoid ddgHeightMap::canyonize(float f )\n{\n\tf += 1;\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tunsigned int d = get(r,c);\n            unsigned int d2 = (unsigned int)ddgUtil::clamp(pow(d,f),0,0xFFFF);\n\t\t\tset(r,c,d2);\n\t\t}\n}\n\nvoid ddgHeightMap::glaciate(float f )\n{\n\tf *= 0xFFFF;\n\tfor (unsigned r = 1; r+1 < _rows; r++)\n\t\tfor (unsigned c = 1; c+1 < _cols; c++ )\n\t\t{\n\t\t\tunsigned int d = get(r,c),\n                        dn = (get(r-1,c)+ get(r+1,c)+ get(r,c-1)+ get(r,c+1))\/4;\n            if (fabs(d-dn) < f)\n            {\n\/\/                unsigned int d2 = Util::clamp(pow(d,f),0,0xFFFF);\n\t    \t\tset(r,c,dn);\n            }\n\t\t}\n}\n\nvoid ddgHeightMap::scale(float s )\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n            unsigned int d = (unsigned int)ddgUtil::clamp(s * get(r,c),0,0xFFFF);\n\t\t\tset(r,c,d);\n\t\t}\n}\n\nvoid ddgHeightMap::translate(float t )\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n            unsigned int d = (unsigned int)ddgUtil::clamp(t + get(r,c),0,0xFFFF);\n\t\t\tset(r,c,d);\n\t\t}\n}\n\nint ddgHeightMap::mini(void )\n{\n\tint m = get(0,0);\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tint d = get(r,c);\n\t\t\tif (d < m) m = d;\n\t\t}\n\treturn m;\n}\n\nint ddgHeightMap::maxi(void )\n{\n\tint m = get(0,0);\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tint d = get(r,c);\n\t\t\tif (d > m) m = d;\n\t\t}\n\treturn m;\n}\n\nvoid ddgHeightMap::setmin( int m)\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tif (get(r,c) < m) set(r,c,m);\n\t\t}\n}\n\nvoid ddgHeightMap::setmax( int m)\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tif (get(r,c) > m) set(r,c,m);\n\t\t}\n}\n\nvoid ddgHeightMap::closeEdge(void)\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t{\n\t\tset(r,0,0);\n\t\tset(r,_cols-1,0);\n\t}\n\tfor (unsigned c = 0; c < _cols; c++ )\n\t{\n\t\tset(0,c,0);\n\t\tset(_rows-1,c,0);\n\t}\n}\n\nvoid ddgHeightMap::sin(void)\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tset(r,c,(short)(10000*(ddgAngle::sin(180.0*(float)r\/(float)_rows)\n\t\t\t\t         +ddgAngle::sin(180.0*(float)c\/(float)_cols))));\n\t\t}\n}\n<commit_msg>Eliminated \"unused variable\" compiler warning.<commit_after>\/*\n    Copyright (C) 1997, 1998, 1999 by Alex Pfaffe\n\t(Digital Dawn Graphics Inc)\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\/\/ General includes\n#include <stdio.h>\n#include <string.h>\n\n#ifdef WIN32\n#include <io.h>\n#include <fcntl.h>\n#endif\n\n#include \"sysdef.h\"\n\/\/ DDG includes\n#include \"csterr\/ddghemap.h\"\n#include \"csterr\/ddgvec.h\"\n#include \"csterr\/ddgnoise.h\"\n#include \"csterr\/ddgerror.h\"\n\/\/ ----------------------------------------------------------------------\n\nddgHeightMap::~ddgHeightMap(void)\n{\n\tdelete _pixbuffer;\n}\n\nvoid ddgHeightMap::allocate( unsigned short r, unsigned short  c )\n{\n\t_cols = c;\n\t_rows = r;\n\tdelete _pixbuffer;\n\tassert(sizeof(short) == 2);\n\t_pixbuffer = new short[_cols*_rows];\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ load:\nbool ddgHeightMap::readMemory( unsigned short *buf )\n{\n\tint i;\n\tfor (i=0; i < _cols*_rows; i++)\n\t\t_pixbuffer[i] = buf[i];\n\treturn false;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ load:\n\nbool ddgHeightMap::writeTGN(char *filename, unsigned int base, unsigned int scale)\n{\n\tFILE *fptr = filename && filename[0] ? fopen(filename,\"wb\") : 0;\n\n\tif (!fptr) {\n\t\tddgErrorSet(FileWrite,(char *) (filename ? filename : \"(null)\"));\n\t\tgoto error;\n\t}\n\n\t\/\/ Header\n\tif (fwrite(\"TERRAGENTERRAIN SIZE\",1,20,fptr) < 20)\n\t{\n\t\tddgErrorSet(FileWrite,\"Couldn't write header.\");\n\t\tgoto error;\n\t}\n\n\t\/\/ SIZE.\n\tunsigned char ch1, ch2;\n\tch1 = _cols % 256;\n\tch2 = _cols - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\t\/\/ Padding 2 bytes.\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\n\t\/\/ XPTS.\n\tif (fwrite(\"XPTS\",1,4,fptr) < 4)\n\t{\n\t\tddgErrorSet(FileWrite,\"Couldn't write XPTS.\");\n\t\tgoto error;\n\t}\n\n\tch1 = _cols % 256;\n\tch2 = _cols - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\t\/\/ Padding 2 bytes.\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\n\t\/\/ YPTS.\n\tif (fwrite(\"YPTS\",1,4,fptr) < 4)\n\t{\n\t\tddgErrorSet(FileWrite,\"Couldn't write YPTS.\");\n\t\tgoto error;\n\t}\n\n\tch1 = _rows % 256;\n\tch2 = _rows - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\t\/\/ Padding 2 bytes.\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\n\t\/\/ ALTW.\n\tif (fwrite(\"ALTW\",1,4,fptr) < 4)\n\t{\n\t\tddgErrorSet(FileWrite,\"Couldn't write ALTW.\");\n\t\tgoto error;\n\t}\n\n\tch1 = scale % 256;\n\tch2 = scale - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\n\tch1 = base % 256;\n\tch2 = base - ch1 * 256;\n\tfputc(ch1,fptr);\n\tfputc(ch2,fptr);\n\n\t\/\/ Write data\n\tint r, c;\n\tr = 0;\n\n\twhile (r < _rows)\n\t{\n\t\tfor (c = 0; c < _cols; c++)\n\t\t{\n\t\t\tch1 = _pixbuffer[c + r * _cols] % 256;\n\t\t\tch2 = _pixbuffer[c + r * _cols] - ch1 * 256;\n\t\t\tfputc(ch1,fptr);\n\t\t\tfputc(ch2,fptr);\n\t\t}\n\t\tr++;\n\t}\n\t\/\/ File termination segment.\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\tfputc(0,fptr);\n\n\tfclose(fptr);\n\treturn true;\n\nerror:\n\tfclose(fptr);\n\tddgError::report();\n\treturn false;\n}\n\nbool ddgHeightMap::readTGN(char *file)\n{\n\tFILE *fptr = file && file[0] ? fopen(file,\"rb\") : 0;\n\tunsigned long test_value = 0x12345678L;\n\tbool endian = (*((unsigned char*)&test_value) == 0x12);\n\n\tif (!fptr)\n\t{\n\t\tddgErrorSet(FileRead,(char *) (file ? file : \"(null)\"));\n\t\tddgError::report();\n\t\treturn true;\n\t}\n\tunsigned char ch1, ch2;\n\n\tchar name[9],type[9], segment[5], pad[2];\n\n\t\/\/ Name 8 bytes.\n\tfread(name,8,1,fptr);\n\tname[8] = '\\0';\n\tfread(type,8,1,fptr);\n\ttype[8] = '\\0';\n\tif (!ddgStr::equal(name,\"TERRAGEN\") || !ddgStr::equal(type,\"TERRAIN \"))\n\t{\n\t\tddgErrorSet(FileRead,(char *) \"File is not a TERRAGEN TERRAIN file\");\n\t\tddgError::report();\n\t\treturn true;\n\t}\n\n\t\/\/ Segment 4 bytes.\n\tsegment[4] = '\\0';\n\n\tfread(segment,4,1,fptr);\n\n\tif (ddgStr::equal(segment,\"SIZE\"))\n\t{\n\t\t\/\/ SIZE 2 bytes.\n\t\tch1 = fgetc(fptr);\n\t\tch2 = fgetc(fptr);\n\t\t_rows = _cols = ch2*256+ch1 +1;\n\t\t\/\/ Padding 2 bytes.\n\t\tfread(pad,2,1,fptr);\n\t\tfread(segment,4,1,fptr);\n\t}\n\n\tif (ddgStr::equal(segment,\"XPTS\"))\n\t{\n\t\t\/\/ XPTS.\n\t\tch1 = fgetc(fptr);\n\t\tch2 = fgetc(fptr);\n\t\t_cols = ch2*256+ch1;\n\t\t\/\/ Padding 2 bytes.\n\t\tfread(pad,2,1,fptr);\n\n\t\tfread(segment,4,1,fptr);\n\t\t\/\/ YPTS.\n\t\tif (ddgStr::equal(segment,\"YPTS\"))\n\t\t{\n\t\t\tch1 = fgetc(fptr);\n\t\t\tch2 = fgetc(fptr);\n\t\t\t_rows = ch2*256+ch1;\n\t\t\t\/\/ Padding 2 bytes.\n\t\t\tfread(pad,2,1,fptr);\n\t\t\tfread(segment,4,1,fptr);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tddgErrorSet(FileRead,(char *) \"Expected YPTS segment, but it was not found.\");\n\t\t\tddgError::report();\n\t\t\treturn true;\n\t\t}\n\t}\n\n\t\/\/ ALTW.\n\t\/\/ Absolute elevation for a given point is\n\t\/\/ BaseHeight + elevation* Scale \/ 65536.\n\tif (ddgStr::equal(segment,\"ALTW\"))\n\t{\n\t\tch1 = fgetc(fptr);\n\t\tch2 = fgetc(fptr);\n\t\t_scale = (ch2*256+ch1)\/ 65536.0;\n\n\t\tch1 = fgetc(fptr);\n\t\tch2 = fgetc(fptr);\n\t\t_base = ch2*256+ch1;\n\t}\n\telse\n\t{\n\t\tddgErrorSet(FileRead,(char *) \"Expected ALTW segment, but it was not found.\");\n\t\tddgError::report();\n\t\treturn true;\n\t}\n\n\t\/\/ Read height data\n\t\/\/ The absolute altitude of a particular point (in the same scale as x and y)\n\t\/\/ is equal to BaseHeight + Elevation * HeightScale \/ 65536\n\tallocate(_cols,_rows);\n\tint r = 0;\n\tint cnt;\n\twhile (r < _rows)\n\t{\n\t\tif ((cnt = fread(&(_pixbuffer[r*_cols]),2,_cols,fptr)) <\n\t\t(int)_cols)\n\t\t{\n\t\t\tddgErrorSet(FileRead,(char *) (file ? file : \"(null)\"));\n\t\t\tddgError::report();\n\t\t\tif (feof(fptr))\n\t\t\t{\n\t\t\t\tddgErrorSet(FileAccess,\"Reached end of file!\");\n\t\t\t\tddgError::report();\n\t\t\t}\n\t\t\tfclose(fptr);\n\t\t\treturn true;\n\t\t}\n\t\tr++;\n\t}\n\t\/\/ Swap byte order for machines with different endian.\n\tif  (endian)\n\t{\n\t\tchar s;\n\t\tint i;\n\t\tchar* _pixchar = (char*)_pixbuffer;\n\n\t\tfor (i = 0; i < 2 * _rows * _cols; i=i+2)\n\t\t{\n\t\t\ts = _pixchar[i];\n\t\t\t_pixchar[i] = _pixchar[i+1];\n\t\t\t_pixchar[i+1] = s;\n\t\t}\n\t}\n\n\tfclose(fptr);\n\treturn false;\n}\n\n\n\nbool ddgHeightMap::generateHeights(unsigned int r, unsigned int c, float oct )\n{\n    allocate(r,c);\n\tunsigned int ci, ri;\n\tfloat lacun = 2.0;\n\tfloat fractalDim = 0.25;\n\tfloat offset = 0.7;\n\tdouble size = 3.0;  \/\/ sample range = 0 to 3 \n\tshort cc;\n\tdouble n;\n\tdouble v[3];\n\tv[0] = 0; v[1] = 0; v[2] = 0;\n\tfor (ri = 0; ri < r; ri++)\n\t{\n\t\tv[1] = 0.0f;\n\t\tfor (ci = 0; ci < c; ci++)\n\t\t{\n\t\t\tn = ddgNoise::hybridmultifractal(v,fractalDim,lacun,oct,offset);\t\/\/ Returns 0 to 1.\n\t\t\tcc = (short) ddgUtil::clamp(n*75.0,0,255);\t\/\/ Scale to fill range.\n\t\t\tset(ri,ci, cc);\n\t\t\tv[1]+= size\/c;\n\t\t}\n\tv[0]+= size\/r;\n\t}\n\n  \n\treturn true;\n}\n\nvoid ddgHeightMap::canyonize(float f )\n{\n\tf += 1;\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tunsigned int d = get(r,c);\n            unsigned int d2 = (unsigned int)ddgUtil::clamp(pow(d,f),0,0xFFFF);\n\t\t\tset(r,c,d2);\n\t\t}\n}\n\nvoid ddgHeightMap::glaciate(float f )\n{\n\tf *= 0xFFFF;\n\tfor (unsigned r = 1; r+1 < _rows; r++)\n\t\tfor (unsigned c = 1; c+1 < _cols; c++ )\n\t\t{\n\t\t\tunsigned int d = get(r,c),\n                        dn = (get(r-1,c)+ get(r+1,c)+ get(r,c-1)+ get(r,c+1))\/4;\n            if (fabs(d-dn) < f)\n            {\n\/\/                unsigned int d2 = Util::clamp(pow(d,f),0,0xFFFF);\n\t    \t\tset(r,c,dn);\n            }\n\t\t}\n}\n\nvoid ddgHeightMap::scale(float s )\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n            unsigned int d = (unsigned int)ddgUtil::clamp(s * get(r,c),0,0xFFFF);\n\t\t\tset(r,c,d);\n\t\t}\n}\n\nvoid ddgHeightMap::translate(float t )\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n            unsigned int d = (unsigned int)ddgUtil::clamp(t + get(r,c),0,0xFFFF);\n\t\t\tset(r,c,d);\n\t\t}\n}\n\nint ddgHeightMap::mini(void )\n{\n\tint m = get(0,0);\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tint d = get(r,c);\n\t\t\tif (d < m) m = d;\n\t\t}\n\treturn m;\n}\n\nint ddgHeightMap::maxi(void )\n{\n\tint m = get(0,0);\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tint d = get(r,c);\n\t\t\tif (d > m) m = d;\n\t\t}\n\treturn m;\n}\n\nvoid ddgHeightMap::setmin( int m)\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tif (get(r,c) < m) set(r,c,m);\n\t\t}\n}\n\nvoid ddgHeightMap::setmax( int m)\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tif (get(r,c) > m) set(r,c,m);\n\t\t}\n}\n\nvoid ddgHeightMap::closeEdge(void)\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t{\n\t\tset(r,0,0);\n\t\tset(r,_cols-1,0);\n\t}\n\tfor (unsigned c = 0; c < _cols; c++ )\n\t{\n\t\tset(0,c,0);\n\t\tset(_rows-1,c,0);\n\t}\n}\n\nvoid ddgHeightMap::sin(void)\n{\n\tfor (unsigned r = 0; r < _rows; r++)\n\t\tfor (unsigned c = 0; c < _cols; c++ )\n\t\t{\n\t\t\tset(r,c,(short)(10000*(ddgAngle::sin(180.0*(float)r\/(float)_rows)\n\t\t\t\t         +ddgAngle::sin(180.0*(float)c\/(float)_cols))));\n\t\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/  Copyright (c) 2015-2015 The KID Authors. All rights reserved.\r\n\/\/  Created on: 2017\/1\/10 Author: zjc\r\n\r\n#include \"stock_group.h\"\r\n\r\n#include <stdlib.h>\r\n#include <sstream>\r\n\r\n#include \"logic\/logic_comm.h\"\r\n#include \"strade_share\/strade_share_engine.h\"\r\n\r\nnamespace strade_user {\r\n\r\nSSEngine* StockGroup::engine_ = NULL;\r\n\r\nStockGroup::StockGroup() {\r\n  data_ = new Data();\r\n}\r\n\r\nStockGroup::StockGroup(UserId user_id,\r\n                       GroupId id,\r\n                       const std::string& name) {\r\n  data_ = new Data();\r\n  data_->id_ = id;\r\n  data_->user_id_ = user_id;\r\n  data_->name_ = name;\r\n}\r\n\r\nREFCOUNT_DEFINE(StockGroup)\r\n\r\nstd::string StockGroup::GetUserGroupSql(UserId user_id) {\r\n  std::ostringstream oss;\r\n  oss << \"SELECT `groupId`, `groupName`, `status`, \"\r\n      \"`availableCapital`, `frozenCapital`, `initCapital` \"\r\n      \"FROM `group_info` \"\r\n      \"WHERE \"\r\n      << \"`userId` = \" << user_id << \" AND \" << \"`status` != 0\";\r\n  return oss.str();\r\n}\r\n\r\nstd::string StockGroup::GetGroupStockSql(UserId group_id) {\r\n  std::ostringstream oss;\r\n  oss << \"SELECT `stockCode`, `addTime` FROM `group_stock` \"\r\n      \"WHERE `groupId` = \" << group_id;\r\n  return oss.str();\r\n}\r\n\r\nGroupId StockGroup::CreateGroup(UserId user_id,\r\n                                const std::string& name,\r\n                                Status status) {\r\n  std::ostringstream oss;\r\n  oss << \"CALL `proc_CreateStockGroup`(\"\r\n      << user_id << \",\"\r\n      << \"'\" << name << \"'\" << \",\"\r\n      << (int)status << \")\";\r\n\r\n  MYSQL_ROWS_VEC row;\r\n  if (!engine_->ExcuteStorage(1, oss.str(), row)) {\r\n    LOG_ERROR2(\"user:%d create stock group error\", user_id);\r\n    return INVALID_GROUPID;\r\n  }\r\n\r\n  assert(!row.empty());\r\n  GroupId id = atoi(row[0][0].data());\r\n  LOG_MSG2(\"user:%d create stock group, id:%d, name:%s\",\r\n           user_id, id, name.data());\r\n  return id;\r\n}\r\n\r\nvoid StockGroup::Deserialize() {\r\n  int t = 0;\r\n  GetInteger(0, data_->id_);\r\n  GetString(1, data_->name_);\r\n  GetInteger(2, t);\r\n  data_->status_ = (Status) t;\r\n\r\n  GetReal(3, data_->available_capital_);\r\n  GetReal(4, data_->frozen_capital_);\r\n  GetReal(5, data_->init_capital_);\r\n\r\n  data_->initialized_ = true;\r\n}\r\n\r\nbool StockGroup::InitStockList() {\r\n  SSEngine* engine = GetStradeShareEngine();\r\n  MYSQL_ROWS_VEC stocks;\r\n  if (!engine->ExcuteStorage(2, GetGroupStockSql(data_->id_), stocks)) {\r\n    LOG_ERROR(\"init user stock list error\");\r\n    return false;\r\n  }\r\n\r\n  for (size_t i = 0; i < stocks.size(); ++i) {\r\n    std::string& stock = stocks[i][0];\r\n    if (stock.empty()) {\r\n      LOG_ERROR(\"init user group stock error\");\r\n      continue;\r\n    }\r\n    data_->stock_list_.push_back(stock);\r\n    data_->stock_set_.insert(stock);\r\n  }\r\n  LOG_MSG2(\"user:%d group:%s init %d stocks\",\r\n           data_->user_id_, data_->name_.data(), stocks.size());\r\n  return true;\r\n}\r\n\r\nbool StockGroup::AddStocks(StockCodeList& stocks) {\r\n  bool rc = true;\r\n  size_t n = stocks.size();\r\n  StockCodeList s;\r\n  for (size_t i = 0; i < stocks.size(); ++i) {\r\n    if (data_->stock_set_.count(stocks[i])) {\r\n      LOG_ERROR2(\"stock:%s exist in group:%s\",\r\n                 stocks[i].data(), data_->name_.data());\r\n      continue;\r\n    }\r\n    data_->stock_set_.insert(stocks[i]);\r\n    data_->stock_list_.push_back(stocks[i]);\r\n    s.push_back(stocks[i]);\r\n  }\r\n\r\n  if (s.empty()) {\r\n    return true;\r\n  }\r\n\r\n  \/\/ update mysql\r\n  std::ostringstream oss;\r\n  oss << \"REPLACE INTO `group_stock`(`groupId`, `stockCode`, `addTime`) VALUES\";\r\n  for (size_t i = 0; i < s.size(); ++i) {\r\n    oss << \"(\" << data_->id_ << \",'\" << s[i] << \"', NOW()),\";\r\n  }\r\n  std::string sql = oss.str();\r\n  sql.erase(sql.size()-1);\r\n  LOG_DEBUG2(\"add stock list sql: %s\", sql.data());\r\n\r\n\/\/  SSEngine* engine = GetStradeShareEngine();\r\n  if (!engine_->WriteData(sql)) {\r\n    rc = false;\r\n    LOG_ERROR2(\"user:%d add stock to group:%s error\",\r\n               data_->user_id_, data_->name_.data());\r\n  }\r\n\r\n  stocks.swap(s);\r\n  return rc;\r\n}\r\n\r\n\r\nbool StockGroup::DelStocks(StockCodeList& stocks) {\r\n  size_t n = stocks.size();\r\n  StockCodeList s;\r\n  for (size_t i = 0; i < stocks.size(); ++i) {\r\n    if (!data_->stock_set_.count(stocks[i])) {\r\n      LOG_ERROR2(\"stock:%s not exist in group:%s\",\r\n                 stocks[i].data(), data_->name_.data());\r\n      continue;\r\n    }\r\n    data_->stock_set_.erase(stocks[i]);\r\n    s.push_back(stocks[i]);\r\n  }\r\n\r\n  StockCodeList t;\r\n  for (size_t i = 0; i < data_->stock_list_.size(); ++i) {\r\n    bool find = false;\r\n    for (size_t j = 0; j < s.size(); ++j) {\r\n      if (s[j] == data_->stock_list_[i]) {\r\n        find = true;\r\n      }\r\n    }\r\n    if (!find) {\r\n      t.push_back(data_->stock_list_[i]);\r\n    }\r\n  }\r\n\r\n  \/\/ update mysql\r\n  \/\/ update mysql\r\n  std::ostringstream oss;\r\n  oss << \"REPLACE INTO `group_stock`(`groupId`, `stockCode`, `status`) VALUES\";\r\n  for (size_t i = 0; i < s.size(); ++i) {\r\n    oss << \"(\" << data_->id_ << \",\"\r\n        << \"'\" << s[i] << \"'\" << \",\"\r\n        << int(INVALID) << \"),\";\r\n  }\r\n  std::string sql = oss.str();\r\n  sql.erase(sql.size()-1);\r\n  LOG_DEBUG2(\"del stock list sql: %s\", sql.data());\r\n\r\n\/\/  SSEngine* engine = GetStradeShareEngine();\r\n  if (!engine_->WriteData(sql)) {\r\n    LOG_ERROR2(\"user:%d del stock to group:%s error\",\r\n               data_->user_id_, data_->name_.data());\r\n  }\r\n\r\n  stocks.swap(s);\r\n  data_->stock_list_.swap(t);\r\n  return stocks.size() == n;\r\n}\r\n\r\n} \/* namespace strade_user *\/\r\n<commit_msg>解决删除股票为空时 sql 执行出错 bug<commit_after>\/\/  Copyright (c) 2015-2015 The KID Authors. All rights reserved.\r\n\/\/  Created on: 2017\/1\/10 Author: zjc\r\n\r\n#include \"stock_group.h\"\r\n\r\n#include <stdlib.h>\r\n#include <sstream>\r\n\r\n#include \"logic\/logic_comm.h\"\r\n#include \"strade_share\/strade_share_engine.h\"\r\n\r\nnamespace strade_user {\r\n\r\nSSEngine* StockGroup::engine_ = NULL;\r\n\r\nStockGroup::StockGroup() {\r\n  data_ = new Data();\r\n}\r\n\r\nStockGroup::StockGroup(UserId user_id,\r\n                       GroupId id,\r\n                       const std::string& name) {\r\n  data_ = new Data();\r\n  data_->id_ = id;\r\n  data_->user_id_ = user_id;\r\n  data_->name_ = name;\r\n}\r\n\r\nREFCOUNT_DEFINE(StockGroup)\r\n\r\nstd::string StockGroup::GetUserGroupSql(UserId user_id) {\r\n  std::ostringstream oss;\r\n  oss << \"SELECT `groupId`, `groupName`, `status`, \"\r\n      \"`availableCapital`, `frozenCapital`, `initCapital` \"\r\n      \"FROM `group_info` \"\r\n      \"WHERE \"\r\n      << \"`userId` = \" << user_id << \" AND \" << \"`status` != 0\";\r\n  return oss.str();\r\n}\r\n\r\nstd::string StockGroup::GetGroupStockSql(UserId group_id) {\r\n  std::ostringstream oss;\r\n  oss << \"SELECT `stockCode`, `addTime` FROM `group_stock` \"\r\n      \"WHERE `groupId` = \" << group_id;\r\n  return oss.str();\r\n}\r\n\r\nGroupId StockGroup::CreateGroup(UserId user_id,\r\n                                const std::string& name,\r\n                                Status status) {\r\n  std::ostringstream oss;\r\n  oss << \"CALL `proc_CreateStockGroup`(\"\r\n      << user_id << \",\"\r\n      << \"'\" << name << \"'\" << \",\"\r\n      << (int)status << \")\";\r\n\r\n  MYSQL_ROWS_VEC row;\r\n  if (!engine_->ExcuteStorage(1, oss.str(), row)) {\r\n    LOG_ERROR2(\"user:%d create stock group error\", user_id);\r\n    return INVALID_GROUPID;\r\n  }\r\n\r\n  assert(!row.empty());\r\n  GroupId id = atoi(row[0][0].data());\r\n  LOG_MSG2(\"user:%d create stock group, id:%d, name:%s\",\r\n           user_id, id, name.data());\r\n  return id;\r\n}\r\n\r\nvoid StockGroup::Deserialize() {\r\n  int t = 0;\r\n  GetInteger(0, data_->id_);\r\n  GetString(1, data_->name_);\r\n  GetInteger(2, t);\r\n  data_->status_ = (Status) t;\r\n\r\n  GetReal(3, data_->available_capital_);\r\n  GetReal(4, data_->frozen_capital_);\r\n  GetReal(5, data_->init_capital_);\r\n\r\n  data_->initialized_ = true;\r\n}\r\n\r\nbool StockGroup::InitStockList() {\r\n  SSEngine* engine = GetStradeShareEngine();\r\n  MYSQL_ROWS_VEC stocks;\r\n  if (!engine->ExcuteStorage(2, GetGroupStockSql(data_->id_), stocks)) {\r\n    LOG_ERROR(\"init user stock list error\");\r\n    return false;\r\n  }\r\n\r\n  for (size_t i = 0; i < stocks.size(); ++i) {\r\n    std::string& stock = stocks[i][0];\r\n    if (stock.empty()) {\r\n      LOG_ERROR(\"init user group stock error\");\r\n      continue;\r\n    }\r\n    data_->stock_list_.push_back(stock);\r\n    data_->stock_set_.insert(stock);\r\n  }\r\n  LOG_MSG2(\"user:%d group:%s init %d stocks\",\r\n           data_->user_id_, data_->name_.data(), stocks.size());\r\n  return true;\r\n}\r\n\r\nbool StockGroup::AddStocks(StockCodeList& stocks) {\r\n  bool rc = true;\r\n  size_t n = stocks.size();\r\n  StockCodeList s;\r\n  for (size_t i = 0; i < stocks.size(); ++i) {\r\n    if (data_->stock_set_.count(stocks[i])) {\r\n      LOG_ERROR2(\"stock:%s exist in group:%s\",\r\n                 stocks[i].data(), data_->name_.data());\r\n      continue;\r\n    }\r\n    data_->stock_set_.insert(stocks[i]);\r\n    data_->stock_list_.push_back(stocks[i]);\r\n    s.push_back(stocks[i]);\r\n  }\r\n\r\n  if (s.empty()) {\r\n    return true;\r\n  }\r\n\r\n  \/\/ update mysql\r\n  std::ostringstream oss;\r\n  oss << \"REPLACE INTO `group_stock`(`groupId`, `stockCode`, `addTime`) VALUES\";\r\n  for (size_t i = 0; i < s.size(); ++i) {\r\n    oss << \"(\" << data_->id_ << \",'\" << s[i] << \"', NOW()),\";\r\n  }\r\n  std::string sql = oss.str();\r\n  sql.erase(sql.size()-1);\r\n  LOG_DEBUG2(\"add stock list sql: %s\", sql.data());\r\n\r\n\/\/  SSEngine* engine = GetStradeShareEngine();\r\n  if (!engine_->WriteData(sql)) {\r\n    rc = false;\r\n    LOG_ERROR2(\"user:%d add stock to group:%s error\",\r\n               data_->user_id_, data_->name_.data());\r\n  }\r\n\r\n  stocks.swap(s);\r\n  return rc;\r\n}\r\n\r\n\r\nbool StockGroup::DelStocks(StockCodeList& stocks) {\r\n  size_t n = stocks.size();\r\n  StockCodeList s;\r\n  for (size_t i = 0; i < stocks.size(); ++i) {\r\n    if (!data_->stock_set_.count(stocks[i])) {\r\n      LOG_ERROR2(\"stock:%s not exist in group:%s\",\r\n                 stocks[i].data(), data_->name_.data());\r\n      continue;\r\n    }\r\n    data_->stock_set_.erase(stocks[i]);\r\n    s.push_back(stocks[i]);\r\n  }\r\n\r\n  StockCodeList t;\r\n  for (size_t i = 0; i < data_->stock_list_.size(); ++i) {\r\n    bool find = false;\r\n    for (size_t j = 0; j < s.size(); ++j) {\r\n      if (s[j] == data_->stock_list_[i]) {\r\n        find = true;\r\n      }\r\n    }\r\n    if (!find) {\r\n      t.push_back(data_->stock_list_[i]);\r\n    }\r\n  }\r\n\r\n  if (!s.empty()) {\r\n    std::ostringstream oss;\r\n    oss << \"REPLACE INTO `group_stock`(`groupId`, `stockCode`, `status`) VALUES\";\r\n    for (size_t i = 0; i < s.size(); ++i) {\r\n      oss << \"(\" << data_->id_ << \",\" << \"'\" << s[i] << \"'\" << \",\"\r\n          << int(INVALID) << \"),\";\r\n    }\r\n    std::string sql = oss.str();\r\n    sql.erase(sql.size() - 1);\r\n    LOG_DEBUG2(\"del stock list sql: %s\", sql.data());\r\n\r\n\/\/  SSEngine* engine = GetStradeShareEngine();\r\n    if (!engine_->WriteData(sql)) {\r\n      LOG_ERROR2(\"user:%d del stock to group:%s error\",\r\n          data_->user_id_, data_->name_.data());\r\n    }\r\n  }\r\n  stocks.swap(s);\r\n  data_->stock_list_.swap(t);\r\n  return stocks.size() == n;\r\n}\r\n\r\n} \/* namespace strade_user *\/\r\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* Copyright (c) 2016-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 \"core\/providers\/cpu\/math\/top_k.h\"\n#include \"core\/providers\/common.h\"\n#include \"core\/common\/common.h\"\n#include \"core\/common\/exceptions.h\"\n#include \"core\/framework\/op_kernel.h\"\n#include \"core\/framework\/tensor.h\"\n#include \"core\/util\/math_cpuonly.h\"\n#include <queue>\nusing namespace std;\nnamespace onnxruntime {\n\/\/ spec https:\/\/github.com\/onnx\/onnx\/blob\/master\/docs\/Operators.md#TopK\nONNX_CPU_OPERATOR_KERNEL(\n    TopK,\n    1,\n    KernelDefBuilder().TypeConstraint(\"T\", DataTypeImpl::GetTensorType<float>()).TypeConstraint(\"I\", DataTypeImpl::GetTensorType<int64_t>()),\n    TopK<float>);\n\nstatic int64_t SizeToDim(size_t k, const vector<int64_t>& dims) {\n  ORT_ENFORCE(k <= dims.size());\n  int64_t r = 1;\n  for (size_t i = 0; i < k; ++i) {\n    r *= dims[i];\n  }\n  return r;\n}\n\nstatic int64_t SizeFromDim(size_t k, const vector<int64_t>& dims) {\n  ORT_ENFORCE(k <= dims.size());\n  int64_t r = 1;\n  for (size_t i = k; i < dims.size(); ++i) {\n    r *= dims[i];\n  }\n  return r;\n}\n\n\/\/ Define these two names to allow lookup into the 2d tensors like\n\/\/ mytensor(i, j)\ntemplate <typename T>\nusing EigenMatrixMapRowMajor = Eigen::Map<\n    Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor>>;\n\ntemplate <typename T>\nusing ConstEigenMatrixMapRowMajor = Eigen::Map<\n    const Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor>>;\n\ntemplate <typename T>\nstruct ValueCmp {\n  bool operator()(\n      const pair<T, int64_t>& lhs,\n      const pair<T, int64_t>& rhs) {\n    return (\n        lhs.first > rhs.first ||\n        (lhs.first == rhs.first && lhs.second < rhs.second));\n  }\n};\n\ntemplate <>\nStatus TopK<float>::Compute(OpKernelContext* p_op_kernel_context) const {\n  const Tensor* X = p_op_kernel_context->Input<Tensor>(0);\n  if (X == nullptr) return Status(common::ONNXRUNTIME, common::FAIL, \"input count mismatch\");\n  const vector<int64_t>& in_dims = X->Shape().GetDims();\n  \/\/ Will return axis_ as is if positive or fixes it in case it is negative\n  auto axis_parsed = HandleNegativeAxis(axis_, in_dims.size());\t\n  \/\/ Check to ensure k_ is within the bounds of what is available in that specific axis \t\n  if (in_dims.at(axis_parsed) < k_) {\n    ostringstream err_msg;\n    err_msg << \"k argment [\" << k_ << \"] should not be greater than specified axis dim value [\" << in_dims.at(axis_parsed) << \"]\";\n    return Status(common::ONNXRUNTIME, common::FAIL, err_msg.str());\n  }\n\n  const int64_t rows = SizeToDim(axis_parsed, in_dims);\n  const int64_t cols = X->Shape().Size() \/ rows;\n  auto input_map = ConstEigenMatrixMapRowMajor<float>(\n      static_cast<const float*>(X->template Data<float>()),\n      rows,\n      cols);\n\n  \/\/ Resize output tensors to be the same shape as the input except\n  \/\/ for the specified dimension ((i.e.) axis_parsed), which will be of size k_. E.x. for an input tensor\n  \/\/ of shape [3, 4, 5] and k_=2 with axis_parsed=1, both of these will be shape [3, 2, 5]\n  vector<int64_t> output_linear_shape = in_dims;\n  output_linear_shape[axis_parsed] = k_;\n  auto* Values = p_op_kernel_context->Output(0, output_linear_shape);\n  auto* Indices = p_op_kernel_context->Output(1, output_linear_shape);\n\n  \/\/ Use Eigen maps to allow indexing into the 2d tensors like Values_map(i,j)\n  auto reduced_cols = SizeFromDim(axis_parsed, output_linear_shape);\n  auto Values_map = EigenMatrixMapRowMajor<float>(\n      Values->template MutableData<float>(), rows, reduced_cols);\n  auto Indices_map = EigenMatrixMapRowMajor<int64_t>(\n      Indices->template MutableData<int64_t>(), rows, reduced_cols);\n\n  \/\/ This is basically the number of elements within each of the \"k_\" rows  \n  const int64_t block_slice = reduced_cols \/ k_;\n  \/\/ Sort preserving Indices\n  for (int64_t i = 0; i < rows; ++i) {\n\t  for (int64_t j = 0; j < block_slice; ++j) {\n\t\t\/\/ Build a min-heap, the heap element is pair of (value, idx)\n\t\t\/\/ the top of the heap is the smallest value\n\t\tpriority_queue<\n\t\t\tpair<float, int64_t>,\n\t\t\tvector<pair<float, int64_t>>,\n\t\t\tValueCmp<float>>\n\t\t\tmin_heap;\n\t\t\/\/ Maintain the size of heap to be less or equal to k_, so the\n\t\t\/\/ heap will hold the k_ largest Values\n\t\tfor (int64_t k = 0; k < in_dims[axis_parsed]; ++k) {\n\t\t\tconst auto value = input_map(i, k * block_slice + j);\n\t\t\tif (min_heap.size() < k_ || value > min_heap.top().first) {\n\t\t\t\tmin_heap.push({value, k});\n\t\t\t}\n\t\t\tif (min_heap.size() > k_) {\n\t\t\t\tmin_heap.pop();\n\t\t\t}    \n\t\t} \n\t\t\/\/ Extract these k_ elements and place them in the results placeholder\n\t\tfor (int64_t l = 0; l < k_; ++l) {\n\t\t\tauto& pqElem = min_heap.top();\n\t\t\tauto col_index = (k_ - l -1) * block_slice + j;  \n\t\t\tValues_map(i, col_index) = pqElem.first;\n\t\t\tIndices_map(i, col_index) = pqElem.second;\n\t\t\tmin_heap.pop();\n\t\t}\n\t  }\n  }\n\n  return Status::OK();\n}\n}  \/\/ namespace onnxruntime\n<commit_msg>Minor cleanup in TopK operator (#478)<commit_after>\/**\n* Copyright (c) 2016-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 \"core\/providers\/cpu\/math\/top_k.h\"\n#include \"core\/providers\/common.h\"\n#include \"core\/common\/common.h\"\n#include \"core\/common\/exceptions.h\"\n#include \"core\/framework\/op_kernel.h\"\n#include \"core\/framework\/tensor.h\"\n#include \"core\/util\/math_cpuonly.h\"\n#include <queue>\nusing namespace std;\nnamespace onnxruntime {\n\/\/ spec https:\/\/github.com\/onnx\/onnx\/blob\/master\/docs\/Operators.md#TopK\nONNX_CPU_OPERATOR_KERNEL(\n    TopK,\n    1,\n    KernelDefBuilder().TypeConstraint(\"T\", DataTypeImpl::GetTensorType<float>()).TypeConstraint(\"I\", DataTypeImpl::GetTensorType<int64_t>()),\n    TopK<float>);\n\nstatic int64_t SizeToDim(size_t k, const vector<int64_t>& dims) {\n  ORT_ENFORCE(k <= dims.size());\n  int64_t r = 1;\n  for (size_t i = 0; i < k; ++i) {\n    r *= dims[i];\n  }\n  return r;\n}\n\nstatic int64_t SizeFromDim(size_t k, const vector<int64_t>& dims) {\n  ORT_ENFORCE(k <= dims.size());\n  int64_t r = 1;\n  for (size_t i = k; i < dims.size(); ++i) {\n    r *= dims[i];\n  }\n  return r;\n}\n\ntemplate <typename T>\nstruct ValueCmp {\n  bool operator()(\n      const pair<T, int64_t>& lhs,\n      const pair<T, int64_t>& rhs) {\n    return (\n        lhs.first > rhs.first ||\n        (lhs.first == rhs.first && lhs.second < rhs.second));\n  }\n};\n\ntemplate <>\nStatus TopK<float>::Compute(OpKernelContext* p_op_kernel_context) const {\n  const Tensor* X = p_op_kernel_context->Input<Tensor>(0);\n  if (X == nullptr) return Status(common::ONNXRUNTIME, common::FAIL, \"input count mismatch\");\n  const vector<int64_t>& in_dims = X->Shape().GetDims();\n  \/\/ Will return axis_ as is if positive or fixes it in case it is negative\n  auto axis_parsed = HandleNegativeAxis(axis_, in_dims.size());\t\n  \/\/ Check to ensure k_ is within the bounds of what is available in that specific axis \t\n  if (in_dims.at(axis_parsed) < k_) {\n    ostringstream err_msg;\n    err_msg << \"k argment [\" << k_ << \"] should not be greater than specified axis dim value [\" << in_dims.at(axis_parsed) << \"]\";\n    return Status(common::ONNXRUNTIME, common::FAIL, err_msg.str());\n  }\n\n  const int64_t rows = SizeToDim(axis_parsed, in_dims);\n  const int64_t cols = X->Shape().Size() \/ rows;\n  auto input_map = ConstEigenMatrixMapRowMajor<float>(\n      static_cast<const float*>(X->template Data<float>()),\n      rows,\n      cols);\n\n  \/\/ Resize output tensors to be the same shape as the input except\n  \/\/ for the specified dimension ((i.e.) axis_parsed), which will be of size k_. E.x. for an input tensor\n  \/\/ of shape [3, 4, 5] and k_=2 with axis_parsed=1, both of these will be shape [3, 2, 5]\n  vector<int64_t> output_linear_shape = in_dims;\n  output_linear_shape[axis_parsed] = k_;\n  auto* Values = p_op_kernel_context->Output(0, output_linear_shape);\n  auto* Indices = p_op_kernel_context->Output(1, output_linear_shape);\n\n  \/\/ Use Eigen maps to allow indexing into the 2d tensors like Values_map(i,j)\n  const int64_t reduced_cols = SizeFromDim(axis_parsed, output_linear_shape);\n  auto Values_map = EigenMatrixMapRowMajor<float>(\n      Values->template MutableData<float>(), rows, reduced_cols);\n  auto Indices_map = EigenMatrixMapRowMajor<int64_t>(\n      Indices->template MutableData<int64_t>(), rows, reduced_cols);\n\n  \/\/ This is basically the number of elements within each of the \"k_\" rows  \n  const int64_t block_slice = reduced_cols \/ k_;\n  \/\/ Sort preserving Indices\n  for (int64_t i = 0; i < rows; ++i) {\n\t  for (int64_t j = 0; j < block_slice; ++j) {\n\t\t\/\/ Build a min-heap, the heap element is pair of (value, idx)\n\t\t\/\/ the top of the heap is the smallest value\n\t\tpriority_queue<\n\t\t\tpair<float, int64_t>,\n\t\t\tvector<pair<float, int64_t>>,\n\t\t\tValueCmp<float>>\n\t\t\tmin_heap;\n\t\t\/\/ Maintain the size of heap to be less or equal to k_, so the\n\t\t\/\/ heap will hold the k_ largest Values\n\t\tfor (int64_t k = 0; k < in_dims[axis_parsed]; ++k) {\n\t\t\tconst auto value = input_map(i, k * block_slice + j);\n\t\t\tif (min_heap.size() < k_ || value > min_heap.top().first) {\n\t\t\t\tmin_heap.push({value, k});\n\t\t\t}\n\t\t\tif (min_heap.size() > k_) {\n\t\t\t\tmin_heap.pop();\n\t\t\t}    \n\t\t} \n\t\t\/\/ Extract these k_ elements and place them in the results placeholder\n\t\tfor (int64_t l = 0; l < k_; ++l) {\n\t\t\tauto& pqElem = min_heap.top();\n\t\t\tauto col_index = (k_ - l -1) * block_slice + j;  \n\t\t\tValues_map(i, col_index) = pqElem.first;\n\t\t\tIndices_map(i, col_index) = pqElem.second;\n\t\t\tmin_heap.pop();\n\t\t}\n\t  }\n  }\n\n  return Status::OK();\n}\n}  \/\/ namespace onnxruntime\n<|endoftext|>"}
{"text":"<commit_before>#include \"OSMC_driver.hpp\"\n\n#include <algorithm>\n\nconst int OSMC_driver::_max_speed_ = 130;\nconst int OSMC_driver::MINREQSPEED = 30;\n\nOSMC_driver::OSMC_driver()\n{\n\tlvgoal = 0;\n\trvgoal = 0;\n\tm_connected = false;\n\tencoder = NULL;\n\t#ifndef MOTOR_SIMULATE\n\tai.initLink(OSMC_IF_BOARD);\n\tencoder = new quadCoderDriver();\n\t#endif\n\tm_connected = true;\n\tset_motors(0, 0);\n}\n\nOSMC_driver::OSMC_driver(byte motor_iface, byte encoder_iface)\n{\n\tlvgoal = 0;\n\trvgoal = 0;\n\tm_connected = false;\n\tencoder = NULL;\n\t#ifndef MOTOR_SIMULATE\n\tai.initLink(motor_iface);\n\tencoder = new quadCoderDriver(encoder_iface);\n\t#endif\n\tm_connected = true;\n\tset_motors(0, 0);\n}\nOSMC_driver::~OSMC_driver()\n{\n\tdelete encoder;\n}\n#if 0\nOSMC_driver::connect()\n{\n\tai.initLink(OSMC_IF_BOARD);\n\tm_connected = true;\n}\n#endif\nbool OSMC_driver::getEncoderData(new_encoder_pk_t& pk)\n{\n\treturn encoder->getEncoderState(pk);\n}\n\nbool OSMC_driver::getEncoderVel(double& rvel, double& lvel)\n{\n\treturn encoder->getEncoderVel(rvel, lvel);\n}\n\ncurrent_reply_t OSMC_driver::getCurrentData()\n{\n\tai.sendCommand(MC_GET_RL_CURR_VAL, NULL, 0);\n\n\tbyte retcmd = 0;\n\tbyte* data = NULL;\n\tai.recvCommand(retcmd, data);\n\n\tcurrent_reply_t out;\n\t\n\tmemcpy(&out, data, sizeof(current_reply_t));\n\tdelete[] data;\n\treturn out;\n}\n\nbool OSMC_driver::set_motors(int leftVelocity, int rightVelocity)\n{\n\tbyte leftDutyCycle = std::min(abs(leftVelocity), 255);\n\tbyte leftDir = (leftVelocity < 0) ? MC_MOTOR_REVERSE : MC_MOTOR_FORWARD;\n\n\tbyte rightDutyCycle = std::min(abs(rightVelocity), 255);\n\tbyte rightDir = (rightVelocity < 0) ? MC_MOTOR_REVERSE : MC_MOTOR_FORWARD;\n\n\treturn setmotorPWM(rightDir, rightDutyCycle, leftDir, leftDutyCycle);\n}\n\nint OSMC_driver::set_heading(int iFwdVelocity, int iRotation)\n{\n\t\/\/ convert\n\tint left  = iFwdVelocity + iRotation ;\n\tint right = iFwdVelocity - iRotation ;\n\n\tif (true)\n\t{\n\t\t\/\/ scale speed\n\t\tleft  = int( float(left)  * float(_max_speed_) \/ float(255) ) ;\n\t\tright = int( float(right) * float(_max_speed_) \/ float(255) ) ;\n\t}\n\telse\n\t{\n\t\t\/\/ cap speed\n\t\tif (left  > _max_speed_) left  = _max_speed_ ;\n\t\tif (right > _max_speed_) right = _max_speed_ ;\n\t}\n\n\t\/\/ motors don't respond until certain output is reached\n\tif (right != 0) right += MINREQSPEED ;\n\tif (left  != 0) left  += MINREQSPEED ;\n\n\t\/\/ do it!\n\treturn this->set_motors( left , right );\n}\n\n#ifndef MOTOR_SIMULATE\nbool OSMC_driver::setmotorPWM(byte rightDir, byte rightDutyCycle, byte leftDir, byte leftDutyCycle)\n{\n\tspeed_set_t cmdpk;\n\tcmdpk.sr = rightDutyCycle;\n\tcmdpk.rightDir = rightDir;\n\tcmdpk.sl = leftDutyCycle;\n\tcmdpk.leftDir = leftDir;\n\n\tstd::cout << \"r: \" << (int)rightDutyCycle << \"l: \" << (int)leftDutyCycle << std::endl;\n\n\tif(ai.sendCommand(MC_SET_RL_DUTY_CYCLE, &cmdpk, sizeof(speed_set_t)))\n\t{\n\t\treturn true;\n\t}\n\n\tbyte cmdresp;\n\tbyte* data = NULL;\n\n\tif(ai.recvCommand(cmdresp, data))\n\t{\n\t\treturn true;\n\t}\n\n\tif(data != NULL)\n\t{\n\t\tdelete[] data;\n\t}\n\n\tldir = leftDir;\n\tlpwm = leftDutyCycle;\n\trdir = rightDir;\n\trpwm = rightDutyCycle;\n\n\treturn false;\n}\n#else\nbool OSMC_driver::setmotorPWM(byte rightDir, byte rightDutyCycle, byte leftDir, byte leftDutyCycle)\n{\n\tint sr = (rightDir == MC_MOTOR_FORWARD) ? int(rightDutyCycle) : -int(rightDutyCycle);\n\tint sl = (leftDir == MC_MOTOR_FORWARD) ? int(leftDutyCycle) : -int(leftDutyCycle);\n\n\tstd::cout << \"right: \" << sr << \"\\tleft: \" << sl << std::endl;\n\n\tif((rightDir == MC_MOTOR_REVERSE) || (leftDir == MC_MOTOR_REVERSE))\n\t{\n\t\t\/\/atach dbg here\n\t\tstd::cout << \"robot is moving backwards!!!\" << std::endl;\n\t}\n\n\treturn false;\n}\n#endif\njoystick_reply_t OSMC_driver::getJoystickData()\n{\n\n\tai.sendCommand(MC_GET_JOYSTICK, NULL, 0);\n\n\tbyte retcmd = 0;\n\tbyte* data = NULL;\n\tai.recvCommand(retcmd, data);\n\n\tjoystick_reply_t out;\n\t\n\tmemcpy(&out, data, sizeof(current_reply_t));\n\tdelete[] data;\n\treturn out;\n}\n\n\/\/ start dumb + hysteresis control code\nvoid OSMC_driver::getNewVel_dumb(const double rtarget, const double ltarget, const double rvel, const double lvel, const int rmset, const int lmset,  int& out_rmset, int& out_lmset)\n{\n\tint posstep = 1;\n\tint negstep = -1;\n\n\tdouble thresh = .03;\n\n\tdouble lerror = ltarget - lvel;\n\tdouble rerror = rtarget - rvel;\n\n\tif(lerror > thresh)\n\t{\n\t\tout_lmset = lmset + posstep;\n\t}\n\telse if(lerror < -thresh)\n\t{\n\t\tout_lmset = lmset + negstep;\n\t}\n\telse\n\t{\n\t\tout_lmset = lmset;\n\t}\n\n\tif(rerror > thresh)\n\t{\n\t\tout_rmset = rmset + posstep;\n\t}\n\telse if(rerror < -thresh)\n\t{\n\t\tout_rmset = rmset + negstep;\n\t}\n\telse\n\t{\n\t\tout_rmset = rmset;\n\t}\n}\n\nvoid OSMC_driver::setVel_pd(double left, double right)\n{\n\tlvgoal = left;\n\trvgoal = right;\n}\n\nbool OSMC_driver::updateVel_pd()\n{\n\tdouble now_rvel, now_lvel;\n\ttimeval now_t;\n\tgettimeofday(&now_t, NULL);\n\n\tencoder->getEncoderVel(now_rvel, now_lvel);\n\n\tdouble now_t_d = double(now_t.tv_sec) + double(1e-6)*double(now_t.tv_usec);\n\tdouble dt = now_t_d - t;\n\n\tint out_lmset, out_rmset;\n\tgetNewVel_pd(now_lvel, now_rvel, dt, out_rmset, out_lmset);\n\n\tt = now_t_d;\n\n\treturn set_motors(out_lmset, out_rmset);\n}\n\nvoid OSMC_driver::getNewVel_pd(const double now_lvel, const double now_rvel, const double dt, int& out_r, int& out_l)\n{\n\tconst double kp = .1;\n\tconst double kd = .1;\n\n\tdouble lerror = lvgoal - now_lvel;\n\tdouble rerror = rvgoal - now_rvel;\n\n\tdouble lerror_slope = (lerror - last_l_error) \/ dt;\n\tdouble rerror_slope = (rerror - last_r_error) \/ dt;\n\n\tout_l = -kp*lerror + -kd*lerror_slope;\n\tout_r = -kp*rerror + -kd*rerror_slope;\n\n\t\/\/persist the stuff that needs to be saved\n\tlast_l_error = lerror;\n\tlast_r_error = rerror;\n}\n\nvoid OSMC_driver::getLastPWMSent(byte& r, byte& l)\n{\n\tr = rpwm;\n\tl = lpwm;\n}\n<commit_msg><commit_after>#include \"OSMC_driver.hpp\"\n\n#include <algorithm>\n\nconst int OSMC_driver::_max_speed_ = 130;\nconst int OSMC_driver::MINREQSPEED = 30;\n\nOSMC_driver::OSMC_driver()\n{\n\tlvgoal = 0;\n\trvgoal = 0;\n\tm_connected = false;\n\tencoder = NULL;\n\t#ifndef MOTOR_SIMULATE\n\tai.initLink(OSMC_IF_BOARD);\n\tencoder = new quadCoderDriver();\n\t#endif\n\tm_connected = true;\n\tset_motors(0, 0);\n}\n\nOSMC_driver::OSMC_driver(byte motor_iface, byte encoder_iface)\n{\n\tlvgoal = 0;\n\trvgoal = 0;\n\tm_connected = false;\n\tencoder = NULL;\n\t#ifndef MOTOR_SIMULATE\n\tai.initLink(motor_iface);\n\tencoder = new quadCoderDriver(encoder_iface);\n\t#endif\n\tm_connected = true;\n\tset_motors(0, 0);\n}\nOSMC_driver::~OSMC_driver()\n{\n\tdelete encoder;\n}\n#if 0\nOSMC_driver::connect()\n{\n\tai.initLink(OSMC_IF_BOARD);\n\tm_connected = true;\n}\n#endif\nbool OSMC_driver::getEncoderData(new_encoder_pk_t& pk)\n{\n\treturn encoder->getEncoderState(pk);\n}\n\nbool OSMC_driver::getEncoderVel(double& rvel, double& lvel)\n{\n\treturn encoder->getEncoderVel(rvel, lvel);\n}\n\ncurrent_reply_t OSMC_driver::getCurrentData()\n{\n\tai.sendCommand(MC_GET_RL_CURR_VAL, NULL, 0);\n\n\tbyte retcmd = 0;\n\tbyte* data = NULL;\n\tai.recvCommand(retcmd, data);\n\n\tcurrent_reply_t out;\n\t\n\tmemcpy(&out, data, sizeof(current_reply_t));\n\tdelete[] data;\n\treturn out;\n}\n\nbool OSMC_driver::set_motors(int leftVelocity, int rightVelocity)\n{\n\tbyte leftDutyCycle = std::min(abs(leftVelocity), 255);\n\tbyte leftDir = (leftVelocity < 0) ? MC_MOTOR_REVERSE : MC_MOTOR_FORWARD;\n\n\tbyte rightDutyCycle = std::min(abs(rightVelocity), 255);\n\tbyte rightDir = (rightVelocity < 0) ? MC_MOTOR_REVERSE : MC_MOTOR_FORWARD;\n\n\treturn setmotorPWM(rightDir, rightDutyCycle, leftDir, leftDutyCycle);\n}\n\nint OSMC_driver::set_heading(int iFwdVelocity, int iRotation)\n{\n\t\/\/ convert\n\tint left  = iFwdVelocity + iRotation ;\n\tint right = iFwdVelocity - iRotation ;\n\n\tif (true)\n\t{\n\t\t\/\/ scale speed\n\t\tleft  = int( float(left)  * float(_max_speed_) \/ float(255) ) ;\n\t\tright = int( float(right) * float(_max_speed_) \/ float(255) ) ;\n\t}\n\telse\n\t{\n\t\t\/\/ cap speed\n\t\tif (left  > _max_speed_) left  = _max_speed_ ;\n\t\tif (right > _max_speed_) right = _max_speed_ ;\n\t}\n\n\t\/\/ motors don't respond until certain output is reached\n\tif (right != 0) right += MINREQSPEED ;\n\tif (left  != 0) left  += MINREQSPEED ;\n\n\t\/\/ do it!\n\treturn this->set_motors( left , right );\n}\n\n#ifndef MOTOR_SIMULATE\nbool OSMC_driver::setmotorPWM(byte rightDir, byte rightDutyCycle, byte leftDir, byte leftDutyCycle)\n{\n\tspeed_set_t cmdpk;\n\tcmdpk.sr = rightDutyCycle;\n\tcmdpk.rightDir = rightDir;\n\tcmdpk.sl = leftDutyCycle;\n\tcmdpk.leftDir = leftDir;\n\n\tstd::cout << \"r: \" << (int)rightDutyCycle << \"l: \" << (int)leftDutyCycle << std::endl;\n\n\tif(ai.sendCommand(MC_SET_RL_DUTY_CYCLE, &cmdpk, sizeof(speed_set_t)))\n\t{\n\t\treturn true;\n\t}\n\n\tbyte cmdresp;\n\tbyte* data = NULL;\n\n\tif(ai.recvCommand(cmdresp, data))\n\t{\n\t\treturn true;\n\t}\n\n\tif(data != NULL)\n\t{\n\t\tdelete[] data;\n\t}\n\n\tldir = leftDir;\n\tlpwm = leftDutyCycle;\n\trdir = rightDir;\n\trpwm = rightDutyCycle;\n\n\treturn false;\n}\n#else\nbool OSMC_driver::setmotorPWM(byte rightDir, byte rightDutyCycle, byte leftDir, byte leftDutyCycle)\n{\n\tint sr = (rightDir == MC_MOTOR_FORWARD) ? int(rightDutyCycle) : -int(rightDutyCycle);\n\tint sl = (leftDir == MC_MOTOR_FORWARD) ? int(leftDutyCycle) : -int(leftDutyCycle);\n\n\tstd::cout << \"right: \" << sr << \"\\tleft: \" << sl << std::endl;\n\n\tif((rightDir == MC_MOTOR_REVERSE) || (leftDir == MC_MOTOR_REVERSE))\n\t{\n\t\t\/\/atach dbg here\n\t\tstd::cout << \"robot is moving backwards!!!\" << std::endl;\n\t}\n\n\treturn false;\n}\n#endif\njoystick_reply_t OSMC_driver::getJoystickData()\n{\n\n\tai.sendCommand(MC_GET_JOYSTICK, NULL, 0);\n\n\tbyte retcmd = 0;\n\tbyte* data = NULL;\n\tai.recvCommand(retcmd, data);\n\n\tjoystick_reply_t out;\n\t\n\tmemcpy(&out, data, sizeof(current_reply_t));\n\tdelete[] data;\n\treturn out;\n}\n\n\/\/ start dumb + hysteresis control code\nvoid OSMC_driver::getNewVel_dumb(const double rtarget, const double ltarget, const double rvel, const double lvel, const int rmset, const int lmset,  int& out_rmset, int& out_lmset)\n{\n\tint posstep = 1;\n\tint negstep = -1;\n\n\tdouble thresh = .03;\n\n\tdouble lerror = ltarget - lvel;\n\tdouble rerror = rtarget - rvel;\n\n\tif(lerror > thresh)\n\t{\n\t\tout_lmset = lmset + posstep;\n\t}\n\telse if(lerror < -thresh)\n\t{\n\t\tout_lmset = lmset + negstep;\n\t}\n\telse\n\t{\n\t\tout_lmset = lmset;\n\t}\n\n\tif(rerror > thresh)\n\t{\n\t\tout_rmset = rmset + posstep;\n\t}\n\telse if(rerror < -thresh)\n\t{\n\t\tout_rmset = rmset + negstep;\n\t}\n\telse\n\t{\n\t\tout_rmset = rmset;\n\t}\n}\n\nvoid OSMC_driver::setVel_pd(double left, double right)\n{\n\tlvgoal = left;\n\trvgoal = right;\n}\n\nbool OSMC_driver::updateVel_pd()\n{\n\tdouble now_rvel, now_lvel;\n\ttimeval now_t;\n\tgettimeofday(&now_t, NULL);\n\n\tencoder->getEncoderVel(now_rvel, now_lvel);\n\n\tdouble now_t_d = double(now_t.tv_sec) + double(1e-6)*double(now_t.tv_usec);\n\tdouble dt = now_t_d - t;\n\n\tint out_lmset, out_rmset;\n\tgetNewVel_pd(now_lvel, now_rvel, dt, out_rmset, out_lmset);\n\n\tt = now_t_d;\n\n\treturn set_motors(out_lmset, out_rmset);\n}\n\n\/\/this won't change the sign of the pwm freq\nvoid OSMC_driver::getNewVel_pd(const double now_lvel, const double now_rvel, const double dt, int& out_r, int& out_l)\n{\n\tconst double kp = .1;\n\tconst double kd = .1;\n\n\tdouble lerror = lvgoal - now_lvel;\n\tdouble rerror = rvgoal - now_rvel;\n\n\tdouble lerror_slope = (lerror - last_l_error) \/ dt;\n\tdouble rerror_slope = (rerror - last_r_error) \/ dt;\n\n\tout_l = lpwm + -kp*lerror + -kd*lerror_slope;\n\tout_r = rpwm + -kp*rerror + -kd*rerror_slope;\n\n\t\/\/persist the stuff that needs to be saved\n\tlast_l_error = lerror;\n\tlast_r_error = rerror;\n}\n\nvoid OSMC_driver::getLastPWMSent(byte& r, byte& l)\n{\n\tr = rpwm;\n\tl = lpwm;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <ruby.h>\n#include <set>\n#include <algorithm>\n\n#include <boost\/tuple\/tuple.hpp>\n\nusing namespace boost;\nusing namespace std;\n\nstatic VALUE cValueSet;\nstatic ID id_new;\nstatic ID id_to_value_set;\n\ntypedef std::set<VALUE> ValueSet;\nstatic ValueSet& get_wrapped_set(VALUE self)\n{\n    void* object = 0;\n    Data_Get_Struct(self, void, object);\n    return *reinterpret_cast<ValueSet*>(object);\n}\nstatic void value_set_mark(ValueSet const* set)\n{ std::for_each(set->begin(), set->end(), rb_gc_mark); }\nstatic void value_set_free(ValueSet const* set)\n{ delete set; }\nstatic VALUE value_set_alloc(VALUE klass)\n{\n    ValueSet* cxx_set = new ValueSet;\n    return Data_Wrap_Struct(klass, value_set_mark, value_set_free, cxx_set);\n}\nstatic VALUE value_set_each(VALUE self)\n{\n    ValueSet& set = get_wrapped_set(self);\n    for_each(set.begin(), set.end(), rb_yield);\n    return self;\n}\nstatic VALUE value_set_include_p(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    return self.find(vother) == self.end() ? Qfalse : Qtrue;\n}\nstatic VALUE value_set_to_value_set(VALUE self) { return self; }\nstatic VALUE value_set_include_all_p(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    return std::includes(self.begin(), self.end(), other.begin(), other.end()) ? Qtrue : Qfalse;\n}\n\nstatic VALUE value_set_union(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(vother);\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_union(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\n\/* call-seq:\n *  set.merge(other)\t\t=> set\n *\n * Merges the elements of +other+ into +self+. If +other+ is a ValueSet, the operation is O(N + M)\n *\/\nstatic VALUE value_set_merge(VALUE vself, VALUE vother)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    self.insert(other.begin(), other.end());\n    return vself;\n}\n\n\/* call-seq:\n *   set.intersection(other)\t=> intersection_set\n *   set & other\t\t=> intersection_set\n *\n * Computes the intersection of +set+ and +other+\n *\/\nstatic VALUE value_set_intersection(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(vother);\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_intersection(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\nstatic VALUE value_set_difference(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(vother);\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_difference(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\nstatic VALUE value_set_insert(VALUE vself, VALUE v)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    bool exists;\n    tie(tuples::ignore, exists) = self.insert(v);\n    return exists ? Qtrue : Qfalse;\n}\nstatic VALUE value_set_delete(VALUE vself, VALUE v)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    size_t count = self.erase(v);\n    return count > 0 ? Qtrue : Qfalse;\n}\n\n\n\n\n\n\n\n\nstatic VALUE enumerable_to_value_set_i(VALUE i, VALUE* memo)\n{\n    ValueSet& result = *reinterpret_cast<ValueSet*>(memo);\n    result.insert(i);\n    return Qnil;\n}\nstatic VALUE enumerable_to_value_set(VALUE self)\n{\n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n\n    rb_iterate(rb_each, self, RUBY_METHOD_FUNC(enumerable_to_value_set_i), reinterpret_cast<VALUE>(&result));\n    return vresult;\n}\n\nstatic VALUE enumerable_each_uniq_i(VALUE i, VALUE* memo)\n{ \n    set<VALUE>& seen = *reinterpret_cast< set<VALUE>* >(memo); \n    if (seen.find(i) == seen.end())\n    {\n\tseen.insert(i);\n\treturn rb_yield(i);\n    }\n    else\n\treturn Qnil;\n\n}\n\nstatic VALUE enumerable_each_uniq(VALUE self)\n{\n    set<VALUE> seen;\n    rb_iterate(rb_each, self, \n\t    RUBY_METHOD_FUNC(enumerable_each_uniq_i), (VALUE)&seen);\n    return self;\n}\n\n\nextern \"C\" void Init_faster()\n{\n    rb_define_method(rb_mEnumerable, \"each_uniq\", RUBY_METHOD_FUNC(enumerable_each_uniq), 0);\n    rb_define_method(rb_mEnumerable, \"to_value_set\", RUBY_METHOD_FUNC(enumerable_to_value_set), 0);\n\n    cValueSet = rb_define_class(\"ValueSet\", rb_cObject);\n    id_new = rb_intern(\"new\");\n    id_to_value_set = rb_intern(\"to_value_set\");\n    rb_define_alloc_func(cValueSet, value_set_alloc);\n    rb_define_method(cValueSet, \"each\", RUBY_METHOD_FUNC(value_set_each), 0);\n    rb_define_method(cValueSet, \"include?\", RUBY_METHOD_FUNC(value_set_include_p), 1);\n    rb_define_method(cValueSet, \"include_all?\", RUBY_METHOD_FUNC(value_set_include_all_p), 1);\n    rb_define_method(cValueSet, \"union\", RUBY_METHOD_FUNC(value_set_union), 1);\n    rb_define_method(cValueSet, \"intersection\", RUBY_METHOD_FUNC(value_set_intersection), 1);\n    rb_define_method(cValueSet, \"difference\", RUBY_METHOD_FUNC(value_set_difference), 1);\n    rb_define_method(cValueSet, \"insert\", RUBY_METHOD_FUNC(value_set_insert), 1);\n    rb_define_method(cValueSet, \"merge\", RUBY_METHOD_FUNC(value_set_merge), 1);\n    rb_define_method(cValueSet, \"delete\", RUBY_METHOD_FUNC(value_set_delete), 1);\n    rb_define_method(cValueSet, \"to_value_set\", RUBY_METHOD_FUNC(value_set_to_value_set), 0);\n}\n\n<commit_msg>[value_set] define #==<commit_after>#include <ruby.h>\n#include <set>\n#include <algorithm>\n\n#include <boost\/tuple\/tuple.hpp>\n\nusing namespace boost;\nusing namespace std;\n\nstatic VALUE cValueSet;\nstatic ID id_new;\nstatic ID id_to_value_set;\n\ntypedef std::set<VALUE> ValueSet;\nstatic ValueSet& get_wrapped_set(VALUE self)\n{\n    void* object = 0;\n    Data_Get_Struct(self, void, object);\n    return *reinterpret_cast<ValueSet*>(object);\n}\nstatic void value_set_mark(ValueSet const* set)\n{ std::for_each(set->begin(), set->end(), rb_gc_mark); }\nstatic void value_set_free(ValueSet const* set)\n{ delete set; }\nstatic VALUE value_set_alloc(VALUE klass)\n{\n    ValueSet* cxx_set = new ValueSet;\n    return Data_Wrap_Struct(klass, value_set_mark, value_set_free, cxx_set);\n}\nstatic VALUE value_set_each(VALUE self)\n{\n    ValueSet& set = get_wrapped_set(self);\n    for_each(set.begin(), set.end(), rb_yield);\n    return self;\n}\nstatic VALUE value_set_include_p(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    return self.find(vother) == self.end() ? Qfalse : Qtrue;\n}\nstatic VALUE value_set_to_value_set(VALUE self) { return self; }\nstatic VALUE value_set_include_all_p(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    return std::includes(self.begin(), self.end(), other.begin(), other.end()) ? Qtrue : Qfalse;\n}\n\nstatic VALUE value_set_union(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(vother);\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_union(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\n\/* call-seq:\n *  set.merge(other)\t\t=> set\n *\n * Merges the elements of +other+ into +self+. If +other+ is a ValueSet, the operation is O(N + M)\n *\/\nstatic VALUE value_set_merge(VALUE vself, VALUE vother)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    self.insert(other.begin(), other.end());\n    return vself;\n}\n\n\/* call-seq:\n *   set.intersection(other)\t=> intersection_set\n *   set & other\t\t=> intersection_set\n *\n * Computes the intersection of +set+ and +other+\n *\/\nstatic VALUE value_set_intersection(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(vother);\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_intersection(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\nstatic VALUE value_set_difference(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(vother);\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_difference(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\nstatic VALUE value_set_insert(VALUE vself, VALUE v)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    bool exists;\n    tie(tuples::ignore, exists) = self.insert(v);\n    return exists ? Qtrue : Qfalse;\n}\nstatic VALUE value_set_delete(VALUE vself, VALUE v)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    size_t count = self.erase(v);\n    return count > 0 ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set == other\t\t=> true or false\n *\n * Equality\n *\/\nstatic VALUE value_set_equal(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    return (self == other) ? Qtrue : Qfalse;\n}\n\n\n\n\n\n\n\n\nstatic VALUE enumerable_to_value_set_i(VALUE i, VALUE* memo)\n{\n    ValueSet& result = *reinterpret_cast<ValueSet*>(memo);\n    result.insert(i);\n    return Qnil;\n}\nstatic VALUE enumerable_to_value_set(VALUE self)\n{\n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n\n    rb_iterate(rb_each, self, RUBY_METHOD_FUNC(enumerable_to_value_set_i), reinterpret_cast<VALUE>(&result));\n    return vresult;\n}\n\nstatic VALUE enumerable_each_uniq_i(VALUE i, VALUE* memo)\n{ \n    set<VALUE>& seen = *reinterpret_cast< set<VALUE>* >(memo); \n    if (seen.find(i) == seen.end())\n    {\n\tseen.insert(i);\n\treturn rb_yield(i);\n    }\n    else\n\treturn Qnil;\n\n}\n\nstatic VALUE enumerable_each_uniq(VALUE self)\n{\n    set<VALUE> seen;\n    rb_iterate(rb_each, self, \n\t    RUBY_METHOD_FUNC(enumerable_each_uniq_i), (VALUE)&seen);\n    return self;\n}\n\n\nextern \"C\" void Init_faster()\n{\n    rb_define_method(rb_mEnumerable, \"each_uniq\", RUBY_METHOD_FUNC(enumerable_each_uniq), 0);\n    rb_define_method(rb_mEnumerable, \"to_value_set\", RUBY_METHOD_FUNC(enumerable_to_value_set), 0);\n\n    cValueSet = rb_define_class(\"ValueSet\", rb_cObject);\n    id_new = rb_intern(\"new\");\n    id_to_value_set = rb_intern(\"to_value_set\");\n    rb_define_alloc_func(cValueSet, value_set_alloc);\n    rb_define_method(cValueSet, \"each\", RUBY_METHOD_FUNC(value_set_each), 0);\n    rb_define_method(cValueSet, \"include?\", RUBY_METHOD_FUNC(value_set_include_p), 1);\n    rb_define_method(cValueSet, \"include_all?\", RUBY_METHOD_FUNC(value_set_include_all_p), 1);\n    rb_define_method(cValueSet, \"union\", RUBY_METHOD_FUNC(value_set_union), 1);\n    rb_define_method(cValueSet, \"intersection\", RUBY_METHOD_FUNC(value_set_intersection), 1);\n    rb_define_method(cValueSet, \"difference\", RUBY_METHOD_FUNC(value_set_difference), 1);\n    rb_define_method(cValueSet, \"insert\", RUBY_METHOD_FUNC(value_set_insert), 1);\n    rb_define_method(cValueSet, \"merge\", RUBY_METHOD_FUNC(value_set_merge), 1);\n    rb_define_method(cValueSet, \"delete\", RUBY_METHOD_FUNC(value_set_delete), 1);\n    rb_define_method(cValueSet, \"==\", RUBY_METHOD_FUNC(value_set_equal), 1);\n    rb_define_method(cValueSet, \"to_value_set\", RUBY_METHOD_FUNC(value_set_to_value_set), 0);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <ruby.h>\n#include <set>\n#include <algorithm>\n\n#include <boost\/tuple\/tuple.hpp>\n\nusing namespace boost;\nusing namespace std;\n\nstatic VALUE cValueSet;\nstatic ID id_new;\nstatic ID id_to_value_set;\n\ntypedef std::set<VALUE> ValueSet;\nstatic ValueSet& get_wrapped_set(VALUE self)\n{\n    ValueSet* object = 0;\n    Data_Get_Struct(self, ValueSet, object);\n    return *object;\n}\n\nstatic void value_set_mark(ValueSet const* set) { std::for_each(set->begin(), set->end(), rb_gc_mark); }\nstatic void value_set_free(ValueSet const* set) { delete set; }\nstatic VALUE value_set_alloc(VALUE klass)\n{\n    ValueSet* cxx_set = new ValueSet;\n    return Data_Wrap_Struct(klass, value_set_mark, value_set_free, cxx_set);\n}\n\/* call-seq:\n *  set.empty?\t\t\t    => true or false\n *\n * Checks if this set is empty\n *\/\nstatic VALUE value_set_empty_p(VALUE self)\n{ \n    ValueSet& set = get_wrapped_set(self);\n    return set.empty() ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set.size\t\t\t    => size\n *\n * Returns this set size\n *\/\nstatic VALUE value_set_size(VALUE self)\n{ \n    ValueSet& set = get_wrapped_set(self);\n    return INT2NUM(set.size());\n}\n\n\n\/* call-seq:\n *  set.each { |obj| ... }\t    => set\n *\n *\/\nstatic VALUE value_set_each(VALUE self)\n{\n    ValueSet& set = get_wrapped_set(self);\n    for_each(set.begin(), set.end(), rb_yield);\n    return self;\n}\n\/* call-seq:\n *  set.include?(value)\t    => true or false\n *\n * Checks if +value+ is in +set+\n *\/\nstatic VALUE value_set_include_p(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    return self.find(vother) == self.end() ? Qfalse : Qtrue;\n}\n\n\/* call-seq:\n *  set.to_value_set\t\t    => set\n *\/\nstatic VALUE value_set_to_value_set(VALUE self) { return self; }\n\n\/* call-seq:\n *  set.include_all?(other)\t\t=> true or false\n *\n * Checks if all elements of +other+ are in +set+\n *\/\nstatic VALUE value_set_include_all_p(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    return std::includes(self.begin(), self.end(), other.begin(), other.end()) ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set.union(other)\t\t=> union_set\n *  set | other\t\t\t=> union_set\n *\n * Computes the union of +set+ and +other+. This operation is O(N + M)\n * is +other+ is a ValueSet\n *\/\nstatic VALUE value_set_union(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(vother);\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_union(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\n\/* call-seq:\n *  set.merge(other)\t\t=> set\n *\n * Merges the elements of +other+ into +self+. If +other+ is a ValueSet, the operation is O(N + M)\n *\/\nstatic VALUE value_set_merge(VALUE vself, VALUE vother)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    self.insert(other.begin(), other.end());\n    return vself;\n}\n\n\/* call-seq:\n *   set.intersection(other)\t=> intersection_set\n *   set & other\t\t=> intersection_set\n *\n * Computes the intersection of +set+ and +other+. This operation\n * is O(N + M) if +other+ is a ValueSet\n *\/\nstatic VALUE value_set_intersection(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_intersection(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\/* call-seq:\n *   set.difference(other)\t=> difference_set\n *   set - other\t\t=> difference_set\n *\n * Computes the set of all elements of +set+ not in +other+. This operation\n * is O(N + M) if +other+ is a ValueSet\n *\/\nstatic VALUE value_set_difference(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_difference(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\n\/* call-seq:\n *  set.insert(value)\t\t=> true or false\n * \n * Inserts +value+ into +set+. Returns true if the value did not exist\n * in the set yet (it has actually been inserted), and false otherwise.\n * This operation is O(log N)\n *\/\nstatic VALUE value_set_insert(VALUE vself, VALUE v)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    bool exists;\n    tie(tuples::ignore, exists) = self.insert(v);\n    return exists ? Qtrue : Qfalse;\n}\n\/* call-seq:\n *  set.delete(value)\t\t=> true or false\n * \n * Removes +value+ from +set+. Returns true if the value did exist\n * in the set yet (it has actually been removed), and false otherwise.\n *\/\nstatic VALUE value_set_delete(VALUE vself, VALUE v)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    size_t count = self.erase(v);\n    return count > 0 ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set == other\t\t=> true or false\n *\n * Equality\n *\/\nstatic VALUE value_set_equal(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    return (self == other) ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set.clear\t\t\t=> set\n *\n * Remove all elements of this set\n *\/\nstatic VALUE value_set_clear(VALUE self)\n{\n    get_wrapped_set(self).clear();\n    return self;\n}\n\nstatic VALUE value_set_initialize_copy(VALUE vself, VALUE vother)\n{\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    set<VALUE> new_set(other.begin(), other.end());\n    get_wrapped_set(vself).swap(new_set);\n    return vself;\n}\n\n\n\n\n\n\n\nstatic VALUE enumerable_to_value_set_i(VALUE i, VALUE* memo)\n{\n    ValueSet& result = *reinterpret_cast<ValueSet*>(memo);\n    result.insert(i);\n    return Qnil;\n}\n\/* call-seq:\n *  enum.to_value_set\t\t=> value_set\n *\n * Builds a ValueSet object from this enumerable\n *\/\nstatic VALUE enumerable_to_value_set(VALUE self)\n{\n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n\n    rb_iterate(rb_each, self, RUBY_METHOD_FUNC(enumerable_to_value_set_i), reinterpret_cast<VALUE>(&result));\n    return vresult;\n}\n\nstatic VALUE enumerable_each_uniq_i(VALUE i, VALUE* memo)\n{ \n    set<VALUE>& seen = *reinterpret_cast< set<VALUE>* >(memo); \n    if (seen.find(i) == seen.end())\n    {\n\tseen.insert(i);\n\treturn rb_yield(i);\n    }\n    else\n\treturn Qnil;\n\n}\n\n\/* :nodoc: *\/\nstatic VALUE enumerable_each_uniq(VALUE self)\n{\n    set<VALUE> seen;\n    rb_iterate(rb_each, self, \n\t    RUBY_METHOD_FUNC(enumerable_each_uniq_i), (VALUE)&seen);\n    return self;\n}\n\n\n\/*\n * Document-class: ValueSet\n *\n * ValueSet is a wrapper around the C++ set<> template. set<> is an ordered container,\n * for which union(), intersection() and difference() is done in linear time. For performance\n * reasons, in the case of ValueSet, the values are ordered by their VALUE, which roughly is\n * their object_id.\n *\/\n\nextern \"C\" void Init_faster()\n{\n    rb_define_method(rb_mEnumerable, \"each_uniq\", RUBY_METHOD_FUNC(enumerable_each_uniq), 0);\n    rb_define_method(rb_mEnumerable, \"to_value_set\", RUBY_METHOD_FUNC(enumerable_to_value_set), 0);\n\n    cValueSet = rb_define_class(\"ValueSet\", rb_cObject);\n    id_new = rb_intern(\"new\");\n    id_to_value_set = rb_intern(\"to_value_set\");\n    rb_define_alloc_func(cValueSet, value_set_alloc);\n    rb_define_method(cValueSet, \"each\", RUBY_METHOD_FUNC(value_set_each), 0);\n    rb_define_method(cValueSet, \"include?\", RUBY_METHOD_FUNC(value_set_include_p), 1);\n    rb_define_method(cValueSet, \"include_all?\", RUBY_METHOD_FUNC(value_set_include_all_p), 1);\n    rb_define_method(cValueSet, \"union\", RUBY_METHOD_FUNC(value_set_union), 1);\n    rb_define_method(cValueSet, \"intersection\", RUBY_METHOD_FUNC(value_set_intersection), 1);\n    rb_define_method(cValueSet, \"difference\", RUBY_METHOD_FUNC(value_set_difference), 1);\n    rb_define_method(cValueSet, \"insert\", RUBY_METHOD_FUNC(value_set_insert), 1);\n    rb_define_method(cValueSet, \"merge\", RUBY_METHOD_FUNC(value_set_merge), 1);\n    rb_define_method(cValueSet, \"delete\", RUBY_METHOD_FUNC(value_set_delete), 1);\n    rb_define_method(cValueSet, \"==\", RUBY_METHOD_FUNC(value_set_equal), 1);\n    rb_define_method(cValueSet, \"to_value_set\", RUBY_METHOD_FUNC(value_set_to_value_set), 0);\n    rb_define_method(cValueSet, \"empty?\", RUBY_METHOD_FUNC(value_set_empty_p), 0);\n    rb_define_method(cValueSet, \"size\", RUBY_METHOD_FUNC(value_set_size), 0);\n    rb_define_method(cValueSet, \"clear\", RUBY_METHOD_FUNC(value_set_clear), 0);\n    rb_define_method(cValueSet, \"initialize_copy\", RUBY_METHOD_FUNC(value_set_initialize_copy), 1);\n}\n\n<commit_msg>[value_set] make sure we call #to_value_set everywhere an argument is expected to be a ValueSet object<commit_after>#include <ruby.h>\n#include <set>\n#include <algorithm>\n\n#include <boost\/tuple\/tuple.hpp>\n\nusing namespace boost;\nusing namespace std;\n\nstatic VALUE cValueSet;\nstatic ID id_new;\nstatic ID id_to_value_set;\n\ntypedef std::set<VALUE> ValueSet;\nstatic ValueSet& get_wrapped_set(VALUE self)\n{\n    ValueSet* object = 0;\n    Data_Get_Struct(self, ValueSet, object);\n    return *object;\n}\n\nstatic void value_set_mark(ValueSet const* set) { std::for_each(set->begin(), set->end(), rb_gc_mark); }\nstatic void value_set_free(ValueSet const* set) { delete set; }\nstatic VALUE value_set_alloc(VALUE klass)\n{\n    ValueSet* cxx_set = new ValueSet;\n    return Data_Wrap_Struct(klass, value_set_mark, value_set_free, cxx_set);\n}\n\/* call-seq:\n *  set.empty?\t\t\t    => true or false\n *\n * Checks if this set is empty\n *\/\nstatic VALUE value_set_empty_p(VALUE self)\n{ \n    ValueSet& set = get_wrapped_set(self);\n    return set.empty() ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set.size\t\t\t    => size\n *\n * Returns this set size\n *\/\nstatic VALUE value_set_size(VALUE self)\n{ \n    ValueSet& set = get_wrapped_set(self);\n    return INT2NUM(set.size());\n}\n\n\n\/* call-seq:\n *  set.each { |obj| ... }\t    => set\n *\n *\/\nstatic VALUE value_set_each(VALUE self)\n{\n    ValueSet& set = get_wrapped_set(self);\n    for_each(set.begin(), set.end(), rb_yield);\n    return self;\n}\n\/* call-seq:\n *  set.include?(value)\t    => true or false\n *\n * Checks if +value+ is in +set+\n *\/\nstatic VALUE value_set_include_p(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    return self.find(vother) == self.end() ? Qfalse : Qtrue;\n}\n\n\/* call-seq:\n *  set.to_value_set\t\t    => set\n *\/\nstatic VALUE value_set_to_value_set(VALUE self) { return self; }\n\n\/* call-seq:\n *  set.include_all?(other)\t\t=> true or false\n *\n * Checks if all elements of +other+ are in +set+\n *\/\nstatic VALUE value_set_include_all_p(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    return std::includes(self.begin(), self.end(), other.begin(), other.end()) ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set.union(other)\t\t=> union_set\n *  set | other\t\t\t=> union_set\n *\n * Computes the union of +set+ and +other+. This operation is O(N + M)\n * is +other+ is a ValueSet\n *\/\nstatic VALUE value_set_union(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_union(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\n\/* call-seq:\n *  set.merge(other)\t\t=> set\n *\n * Merges the elements of +other+ into +self+. If +other+ is a ValueSet, the operation is O(N + M)\n *\/\nstatic VALUE value_set_merge(VALUE vself, VALUE vother)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    self.insert(other.begin(), other.end());\n    return vself;\n}\n\n\/* call-seq:\n *   set.intersection(other)\t=> intersection_set\n *   set & other\t\t=> intersection_set\n *\n * Computes the intersection of +set+ and +other+. This operation\n * is O(N + M) if +other+ is a ValueSet\n *\/\nstatic VALUE value_set_intersection(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_intersection(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\/* call-seq:\n *   set.difference(other)\t=> difference_set\n *   set - other\t\t=> difference_set\n *\n * Computes the set of all elements of +set+ not in +other+. This operation\n * is O(N + M) if +other+ is a ValueSet\n *\/\nstatic VALUE value_set_difference(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    \n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n    std::set_difference(self.begin(), self.end(), other.begin(), other.end(), \n\t    std::inserter(result, result.end()));\n    return vresult;\n}\n\n\/* call-seq:\n *  set.insert(value)\t\t=> true or false\n * \n * Inserts +value+ into +set+. Returns true if the value did not exist\n * in the set yet (it has actually been inserted), and false otherwise.\n * This operation is O(log N)\n *\/\nstatic VALUE value_set_insert(VALUE vself, VALUE v)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    bool exists;\n    tie(tuples::ignore, exists) = self.insert(v);\n    return exists ? Qtrue : Qfalse;\n}\n\/* call-seq:\n *  set.delete(value)\t\t=> true or false\n * \n * Removes +value+ from +set+. Returns true if the value did exist\n * in the set yet (it has actually been removed), and false otherwise.\n *\/\nstatic VALUE value_set_delete(VALUE vself, VALUE v)\n{\n    ValueSet& self  = get_wrapped_set(vself);\n    size_t count = self.erase(v);\n    return count > 0 ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set == other\t\t=> true or false\n *\n * Equality\n *\/\nstatic VALUE value_set_equal(VALUE vself, VALUE vother)\n{\n    ValueSet const& self  = get_wrapped_set(vself);\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    return (self == other) ? Qtrue : Qfalse;\n}\n\n\/* call-seq:\n *  set.clear\t\t\t=> set\n *\n * Remove all elements of this set\n *\/\nstatic VALUE value_set_clear(VALUE self)\n{\n    get_wrapped_set(self).clear();\n    return self;\n}\n\nstatic VALUE value_set_initialize_copy(VALUE vself, VALUE vother)\n{\n    ValueSet const& other = get_wrapped_set(rb_funcall(vother, id_to_value_set, 0));\n    set<VALUE> new_set(other.begin(), other.end());\n    get_wrapped_set(vself).swap(new_set);\n    return vself;\n}\n\n\n\n\n\n\n\nstatic VALUE enumerable_to_value_set_i(VALUE i, VALUE* memo)\n{\n    ValueSet& result = *reinterpret_cast<ValueSet*>(memo);\n    result.insert(i);\n    return Qnil;\n}\n\/* call-seq:\n *  enum.to_value_set\t\t=> value_set\n *\n * Builds a ValueSet object from this enumerable\n *\/\nstatic VALUE enumerable_to_value_set(VALUE self)\n{\n    VALUE vresult = rb_funcall(cValueSet, id_new, 0);\n    ValueSet& result = get_wrapped_set(vresult);\n\n    rb_iterate(rb_each, self, RUBY_METHOD_FUNC(enumerable_to_value_set_i), reinterpret_cast<VALUE>(&result));\n    return vresult;\n}\n\nstatic VALUE enumerable_each_uniq_i(VALUE i, VALUE* memo)\n{ \n    set<VALUE>& seen = *reinterpret_cast< set<VALUE>* >(memo); \n    if (seen.find(i) == seen.end())\n    {\n\tseen.insert(i);\n\treturn rb_yield(i);\n    }\n    else\n\treturn Qnil;\n\n}\n\n\/* :nodoc: *\/\nstatic VALUE enumerable_each_uniq(VALUE self)\n{\n    set<VALUE> seen;\n    rb_iterate(rb_each, self, \n\t    RUBY_METHOD_FUNC(enumerable_each_uniq_i), (VALUE)&seen);\n    return self;\n}\n\n\n\/*\n * Document-class: ValueSet\n *\n * ValueSet is a wrapper around the C++ set<> template. set<> is an ordered container,\n * for which union(), intersection() and difference() is done in linear time. For performance\n * reasons, in the case of ValueSet, the values are ordered by their VALUE, which roughly is\n * their object_id.\n *\/\n\nextern \"C\" void Init_faster()\n{\n    rb_define_method(rb_mEnumerable, \"each_uniq\", RUBY_METHOD_FUNC(enumerable_each_uniq), 0);\n    rb_define_method(rb_mEnumerable, \"to_value_set\", RUBY_METHOD_FUNC(enumerable_to_value_set), 0);\n\n    cValueSet = rb_define_class(\"ValueSet\", rb_cObject);\n    id_new = rb_intern(\"new\");\n    id_to_value_set = rb_intern(\"to_value_set\");\n    rb_define_alloc_func(cValueSet, value_set_alloc);\n    rb_define_method(cValueSet, \"each\", RUBY_METHOD_FUNC(value_set_each), 0);\n    rb_define_method(cValueSet, \"include?\", RUBY_METHOD_FUNC(value_set_include_p), 1);\n    rb_define_method(cValueSet, \"include_all?\", RUBY_METHOD_FUNC(value_set_include_all_p), 1);\n    rb_define_method(cValueSet, \"union\", RUBY_METHOD_FUNC(value_set_union), 1);\n    rb_define_method(cValueSet, \"intersection\", RUBY_METHOD_FUNC(value_set_intersection), 1);\n    rb_define_method(cValueSet, \"difference\", RUBY_METHOD_FUNC(value_set_difference), 1);\n    rb_define_method(cValueSet, \"insert\", RUBY_METHOD_FUNC(value_set_insert), 1);\n    rb_define_method(cValueSet, \"merge\", RUBY_METHOD_FUNC(value_set_merge), 1);\n    rb_define_method(cValueSet, \"delete\", RUBY_METHOD_FUNC(value_set_delete), 1);\n    rb_define_method(cValueSet, \"==\", RUBY_METHOD_FUNC(value_set_equal), 1);\n    rb_define_method(cValueSet, \"to_value_set\", RUBY_METHOD_FUNC(value_set_to_value_set), 0);\n    rb_define_method(cValueSet, \"empty?\", RUBY_METHOD_FUNC(value_set_empty_p), 0);\n    rb_define_method(cValueSet, \"size\", RUBY_METHOD_FUNC(value_set_size), 0);\n    rb_define_method(cValueSet, \"clear\", RUBY_METHOD_FUNC(value_set_clear), 0);\n    rb_define_method(cValueSet, \"initialize_copy\", RUBY_METHOD_FUNC(value_set_initialize_copy), 1);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/! @Alan @pezy\n\/\/!\n\/\/! Exercise 9.24:\n\/\/! Write a program that fetches the first element in a vector using at,\n\/\/! the subscript operator, front, and begin. Test your program on an empty vector.\n\/\/!\n#include <iostream>\n#include <vector>\n\nint main()\n{\n    std::vector<int> v;\n    std::cout << v.at(0);       \/\/ terminating with uncaught exception of type std::out_of_range\n    std::cout << v[0];          \/\/ Segmentation fault: 11\n    std::cout << v.front();     \/\/ Segmentation fault: 11\n    std::cout << *v.begin();    \/\/ Segmentation fault: 11\n    return 0;\n}\n<commit_msg>Update ex9_24.cpp<commit_after>\/\/! @Yue Wang @pezy\n\/\/!\n\/\/! Exercise 9.24:\n\/\/! Write a program that fetches the first element in a vector using at,\n\/\/! the subscript operator, front, and begin. Test your program on an empty vector.\n\/\/!\n#include <iostream>\n#include <vector>\n\nint main()\n{\n    std::vector<int> v;\n    std::cout << v.at(0);       \/\/ terminating with uncaught exception of type std::out_of_range\n    std::cout << v[0];          \/\/ Segmentation fault: 11\n    std::cout << v.front();     \/\/ Segmentation fault: 11\n    std::cout << *v.begin();    \/\/ Segmentation fault: 11\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ASAN example: stack buffer overflow\n\n#include <array>\n#include <iostream>\n\nint main(int argc, char** argv)\n{\n    std::array<const char*, 3> data{ \"no\", \"one\", \"two\" };\n    std::cout << \"You passed \" << data[argc - 1] << \" args(s)\\n\";\n    return 0;\n}\n<commit_msg>replacing 'const char*' with 'std::string' to ensure data on the stack<commit_after>\/\/ ASAN example: stack buffer overflow\n\n#include <array>\n#include <iostream>\n\nint main(int argc, char** argv)\n{\n    std::array<std::string, 3> data{ \"no\", \"one\", \"two\" };\n    std::cout << \"You passed \" << data[argc - 1] << \" args(s)\\n\";\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright 2015, 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\n#include <string.h>\n\n#include <node.h>\n#include <nan.h>\n#include \"grpc\/grpc.h\"\n#include \"grpc\/byte_buffer_reader.h\"\n#include \"grpc\/support\/slice.h\"\n\n#include \"byte_buffer.h\"\n\nnamespace grpc {\nnamespace node {\n\nusing v8::Context;\nusing v8::Function;\nusing v8::Handle;\nusing v8::Object;\nusing v8::Number;\nusing v8::Value;\n\ngrpc_byte_buffer *BufferToByteBuffer(Handle<Value> buffer) {\n  NanScope();\n  int length = ::node::Buffer::Length(buffer);\n  char *data = ::node::Buffer::Data(buffer);\n  gpr_slice slice = gpr_slice_malloc(length);\n  memcpy(GPR_SLICE_START_PTR(slice), data, length);\n  grpc_byte_buffer *byte_buffer(grpc_byte_buffer_create(&slice, 1));\n  gpr_slice_unref(slice);\n  return byte_buffer;\n}\n\nHandle<Value> ByteBufferToBuffer(grpc_byte_buffer *buffer) {\n  NanEscapableScope();\n  if (buffer == NULL) {\n    return NanEscapeScope(NanNull());\n  }\n  size_t length = grpc_byte_buffer_length(buffer);\n  char *result = reinterpret_cast<char *>(calloc(length, sizeof(char)));\n  size_t offset = 0;\n  grpc_byte_buffer_reader reader;\n  grpc_byte_buffer_reader_init(&reader, buffer);\n  gpr_slice next;\n  while (grpc_byte_buffer_reader_next(&reader, &next) != 0) {\n    memcpy(result + offset, GPR_SLICE_START_PTR(next), GPR_SLICE_LENGTH(next));\n    offset += GPR_SLICE_LENGTH(next);\n  }\n  return NanEscapeScope(MakeFastBuffer(NanNewBufferHandle(result, length)));\n}\n\nHandle<Value> MakeFastBuffer(Handle<Value> slowBuffer) {\n  NanEscapableScope();\n  Handle<Object> globalObj = NanGetCurrentContext()->Global();\n  Handle<Function> bufferConstructor = Handle<Function>::Cast(\n      globalObj->Get(NanNew(\"Buffer\")));\n  Handle<Value> consArgs[3] = {\n    slowBuffer,\n    NanNew<Number>(::node::Buffer::Length(slowBuffer)),\n    NanNew<Number>(0)\n  };\n  Handle<Object> fastBuffer = bufferConstructor->NewInstance(3, consArgs);\n  return NanEscapeScope(fastBuffer);\n}\n}  \/\/ namespace node\n}  \/\/ namespace grpc\n<commit_msg>Changes to byte_buffer based on comments.<commit_after>\/*\n *\n * Copyright 2015, 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\n#include <string.h>\n\n#include <node.h>\n#include <nan.h>\n#include \"grpc\/grpc.h\"\n#include \"grpc\/byte_buffer_reader.h\"\n#include \"grpc\/support\/slice.h\"\n\n#include \"byte_buffer.h\"\n\nnamespace grpc {\nnamespace node {\n\nusing v8::Context;\nusing v8::Function;\nusing v8::Handle;\nusing v8::Object;\nusing v8::Number;\nusing v8::Value;\n\ngrpc_byte_buffer *BufferToByteBuffer(Handle<Value> buffer) {\n  NanScope();\n  int length = ::node::Buffer::Length(buffer);\n  char *data = ::node::Buffer::Data(buffer);\n  gpr_slice slice = gpr_slice_malloc(length);\n  memcpy(GPR_SLICE_START_PTR(slice), data, length);\n  grpc_byte_buffer *byte_buffer(grpc_raw_byte_buffer_create(&slice, 1));\n  gpr_slice_unref(slice);\n  return byte_buffer;\n}\n\nHandle<Value> ByteBufferToBuffer(grpc_byte_buffer *buffer) {\n  NanEscapableScope();\n  if (buffer == NULL) {\n    return NanEscapeScope(NanNull());\n  }\n  size_t length = grpc_byte_buffer_length(buffer);\n  char *result = reinterpret_cast<char *>(calloc(length, sizeof(char)));\n  size_t offset = 0;\n  grpc_byte_buffer_reader reader;\n  grpc_byte_buffer_reader_init(&reader, buffer);\n  gpr_slice next;\n  while (grpc_byte_buffer_reader_next(&reader, &next) != 0) {\n    memcpy(result + offset, GPR_SLICE_START_PTR(next), GPR_SLICE_LENGTH(next));\n    offset += GPR_SLICE_LENGTH(next);\n  }\n  return NanEscapeScope(MakeFastBuffer(NanNewBufferHandle(result, length)));\n}\n\nHandle<Value> MakeFastBuffer(Handle<Value> slowBuffer) {\n  NanEscapableScope();\n  Handle<Object> globalObj = NanGetCurrentContext()->Global();\n  Handle<Function> bufferConstructor = Handle<Function>::Cast(\n      globalObj->Get(NanNew(\"Buffer\")));\n  Handle<Value> consArgs[3] = {\n    slowBuffer,\n    NanNew<Number>(::node::Buffer::Length(slowBuffer)),\n    NanNew<Number>(0)\n  };\n  Handle<Object> fastBuffer = bufferConstructor->NewInstance(3, consArgs);\n  return NanEscapeScope(fastBuffer);\n}\n}  \/\/ namespace node\n}  \/\/ namespace grpc\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * ImageFromMemoryBuffer.hpp\n *\n *  Created on: Oct 31, 2014\n *      Author: Pete Schultz\n *  Description of the class is in ImageFromMemoryBuffer.hpp\n *\/\n\n#include \"ImageFromMemoryBuffer.hpp\"\n\nnamespace PV {\n\nImageFromMemoryBuffer::ImageFromMemoryBuffer(char const * name, HyPerCol * hc) {\n   initialize_base();\n   initialize(name, hc);\n}\n\nImageFromMemoryBuffer::ImageFromMemoryBuffer() {\n   initialize_base();\n   \/\/ protected default constructor; initialize(name,hc) should be called by any derived class's initialization routine\n}\n\nint ImageFromMemoryBuffer::initialize_base() {\n   buffer = NULL;\n   return PV_SUCCESS;\n}\n\nint ImageFromMemoryBuffer::initialize(char const * name, HyPerCol * hc) {\n   return Image::initialize(name, hc);\n}\n\ntemplate <typename pixeltype>\nint ImageFromMemoryBuffer::setMemoryBuffer(pixeltype const * externalBuffer, int height, int width, int numbands, int xstride, int ystride, int bandstride, pixeltype zeroval, pixeltype oneval) {\n   if (height<=0 || width<=0 || numbands<=0) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"ImageFromMemoryBuffer::setMemoryBuffer error: height, width, numbands arguments must be positive.\\n\");\n      }\n      return PV_FAILURE;\n   }\n   imageLoc.nx = height;\n   imageLoc.ny = width;\n   imageLoc.nf = numbands;\n   imageLoc.nxGlobal = height;\n   imageLoc.nyGlobal = width;\n   imageLoc.kx0 = 0;\n   imageLoc.ky0 = 0;\n   memset(&imageLoc.halo, 0, sizeof(PVHalo));\n\n   if (parent->columnId()==0) {\n      int buffersize = height*width*numbands;\n      buffer = (pvadata_t *) malloc((size_t) buffersize * sizeof(pvadata_t));\n      if (buffer==NULL) {\n         fprintf(stderr, \"%s \\\"%s\\\": unable to allocate buffer for %d values of %zu chars each: %s\\n\",\n               parent->parameters()->groupKeywordFromName(name), name, buffersize, sizeof(pvadata_t), strerror(errno));\n         exit(EXIT_FAILURE);\n      }\n      for (int k=0; k<buffersize; k++) {\n         int x=kxPos(k,width,height,numbands);\n         int y=kyPos(k,width,height,numbands);\n         int f=featureIndex(k,width,height,numbands);\n         int externalIndex = f*bandstride + x*xstride + y*ystride;\n         pixeltype q = externalBuffer[externalIndex];\n         buffer[k] = pixelTypeConvert(q, zeroval, oneval);\n      }\n   }\n   \n   hasNewImageFlag = true;\n\n   HyPerLayer::outputState(parent->simulationTime(), parent->getDeltaTime());\n\n   return PV_SUCCESS;\n}\ntemplate int ImageFromMemoryBuffer::setMemoryBuffer<uint8_t>(uint8_t const * buffer, int height, int width, int numbands, int xstride, int ystride, int bandstride, uint8_t zeroval, uint8_t oneval);\n\ntemplate <typename pixeltype>\nint ImageFromMemoryBuffer::setMemoryBuffer(pixeltype const * externalBuffer, int height, int width, int numbands, int xstride, int ystride, int bandstride, pixeltype zeroval, pixeltype oneval, int offsetX, int offsetY, char const * offsetAnchor) {\n   offsets[0] = offsetX;\n   offsets[1] = offsetY;\n   free(this->offsetAnchor);\n   this->offsetAnchor = strdup(offsetAnchor);\n   if (checkValidAnchorString()!=PV_SUCCESS) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"%s \\\"%s\\\" error: setMemoryBuffer called with invalid anchor string \\\"%s\\\"\",\n               parent->parameters()->groupKeywordFromName(name), name, offsetAnchor);\n      }\n      MPI_Barrier(parent->icCommunicator()->communicator());\n      exit(EXIT_FAILURE);\n   }\n   return setMemoryBuffer(externalBuffer, height, width, numbands, xstride, ystride, bandstride, zeroval, oneval);\n}\ntemplate int ImageFromMemoryBuffer::setMemoryBuffer<uint8_t>(uint8_t const * buffer, int height, int width, int numbands, int xstride, int ystride, int bandstride, uint8_t zeroval, uint8_t oneval, int offsetX, int offsetY, char const * offsetAnchor);\n\ntemplate <typename pixeltype>\npvadata_t ImageFromMemoryBuffer::pixelTypeConvert(pixeltype q, pixeltype zeroval, pixeltype oneval) {\n   return ((pvadata_t) (q-zeroval))\/((pvadata_t) (oneval-zeroval));\n}\n\nint ImageFromMemoryBuffer::initializeActivity() {\n   return copyBuffer();\n}\n\nint ImageFromMemoryBuffer::updateState(double time, double dt) {\n   return copyBuffer();\n}\n\nint ImageFromMemoryBuffer::copyBuffer() {\n   int status = PV_SUCCESS;\n   if (!hasNewImageFlag) { return status; }\n   Communicator * icComm = parent->icCommunicator();\n   if (parent->columnId()==0) {\n      if (buffer == NULL) {\n         fprintf(stderr, \"%s \\\"%s\\\" error: moveBufferToData called without having called setMemoryBuffer.\\n\",\n               parent->parameters()->groupKeywordFromName(name), name);\n         exit(PV_FAILURE); \/\/ return PV_FAILURE;\n      }\n      for (int rank=1; rank<icComm->commSize(); rank++) {\n         status = moveBufferToData(rank);\n         assert(status == PV_SUCCESS);\n         MPI_Send(data, getNumExtended(), MPI_FLOAT, rank, 31, icComm->communicator());\n      }\n      status = moveBufferToData(0);\n      assert(status == PV_SUCCESS);\n   }\n   else {\n      MPI_Recv(data, getNumExtended(), MPI_FLOAT, 0, 31, icComm->communicator(), MPI_STATUS_IGNORE);\n   }\n   hasNewImageFlag = false;\n   return status;\n}\n\nint ImageFromMemoryBuffer::moveBufferToData(int rank) {\n   if (autoResizeFlag) {\n      fprintf(stderr, \"autoResizeFlag not implemented for ImageFromMemoryBuffer yet :-(\\n\");\n      exit(EXIT_FAILURE);\n   }\n   assert(parent->columnId()==0);\n   assert(buffer != NULL);\n   \n   \/\/ The part of the buffer with x in [processcolumnnumber * nx, processcolumnnumber * (nx + 1) - 1]\n   \/\/ and y in [processcolumnnumber * nx, processcolumnnumber * (nx + 1) - 1]\n   \/\/ gets copied to the restricted space of the given rank.\n   \/\/ If useImageBCflag is set, we also have to copy as much of the surrounding region as\n   \/\/ will fit in both the halo and the image.\n   \/\/ Are we also supposed to mirror any gap between the edge of the image and the edge of the halo?\n   \/\/ The code doesn't do that at this point.\n   \/\/ The code below assumes that all processes have the same getLayerLoc().\n   Communicator * icComm = parent->icCommunicator();\n   int column = columnFromRank(rank, icComm->numCommRows(), icComm->numCommColumns());\n   int startxbuffer = getOffsetX(this->offsetAnchor, this->offsets[0]) + column * getLayerLoc()->nx;\n   int startxdata = getLayerLoc()->halo.lt;\n   int row = rowFromRank(rank, icComm->numCommRows(), icComm->numCommColumns());\n   int startybuffer = getOffsetX(this->offsetAnchor, this->offsets[0]) + row * getLayerLoc()->ny;\n   int startydata = getLayerLoc()->halo.up;\n   int xsize = getLayerLoc()->nx;\n   int ysize = getLayerLoc()->ny;\n   int fsize = getLayerLoc()->nf;\n   PVHalo const * halo = &getLayerLoc()->halo;\n   if (useImageBCflag) {\n\n      int moveleft = startxbuffer;\n      if (halo->lt < moveleft) {\n         moveleft = halo->lt;\n      }\n      if (moveleft > 0) {\n         startxbuffer -= moveleft;\n         startxdata -= moveleft;\n         xsize += moveleft;\n      }\n\n      int moveright = imageLoc.nx - (startxbuffer + xsize);\n      if (halo->rt < moveright) {\n         moveright = halo->rt;\n      }\n      if (moveright > 0) {\n         xsize += moveright;\n      }\n\n      int moveup = startybuffer;\n      if (halo->up < moveup) {\n         moveup = halo->up;\n      }\n      if (moveup > 0) {\n         startybuffer -= moveup;\n         startydata -= moveup;\n         ysize += moveup;\n      }\n\n      int movedown = imageLoc.ny - (startybuffer + ysize);\n      if (halo->dn < movedown) {\n         movedown = halo->dn;\n      }\n      if (movedown > 0) {\n         ysize += movedown;\n      }   \n   }\n   assert(startxbuffer >= 0 && startxbuffer + xsize <= imageLoc.nxGlobal);\n   assert(startybuffer >= 0 && startybuffer + ysize <= imageLoc.nyGlobal);\n   if (fsize != 1 && fsize != imageLoc.nf) {\n      fprintf(stderr, \"%s \\\"%s\\\": If nf is greater than 1, or numbands must be the same as nf\\n\", parent->parameters()->groupKeywordFromName(name), name);\n      exit(EXIT_FAILURE);\n   }\n   if (fsize != imageLoc.nf) {\n      assert(fsize == 1);\n      \/\/ layer has one feature; convert memory buffer to grayscale\n      for (int y=0; y<ysize; y++) {\n         for (int x=0; x<xsize; x++) {\n            int indexdata = kIndex(startxdata+x,startydata+y,0,getLayerLoc()->nx+halo->lt+halo->rt,getLayerLoc()->ny+halo->dn+halo->up,1);\n            int indexbuffer = kIndex(startxdata+x,startydata+y,0,imageLoc.nx,imageLoc.ny,imageLoc.nf);\n            pvdata_t val = (pvadata_t) 0;\n            for (int f=0; f<imageLoc.nf; f++) {\n               val += buffer[indexbuffer+f];\n            }\n            data[indexdata] = val\/(pvadata_t) imageLoc.nf;\n         }\n      }\n   }\n   else {\n      \/\/ layer and memory buffer have the same number of features\n      for (int y=0; y<ysize; y++) {\n         int linestartdata = kIndex(startxdata,startydata+y,0,getLayerLoc()->nx+halo->lt+halo->rt,getLayerLoc()->ny+halo->dn+halo->up,fsize);\n         int linestartbuffer = kIndex(startxbuffer,startybuffer+y,0,imageLoc.nx,imageLoc.ny,fsize);\n         memcpy(&data[linestartdata], &buffer[linestartbuffer], sizeof(pvadata_t) * xsize * fsize);\n      }\n   }\n   return PV_SUCCESS;\n}\n\nImageFromMemoryBuffer::~ImageFromMemoryBuffer() {\n   free(buffer);\n}\n\n}  \/\/ namespace PV\n<commit_msg>setMemoryBuffer shouldn't call outputState<commit_after>\/*\n * ImageFromMemoryBuffer.hpp\n *\n *  Created on: Oct 31, 2014\n *      Author: Pete Schultz\n *  Description of the class is in ImageFromMemoryBuffer.hpp\n *\/\n\n#include \"ImageFromMemoryBuffer.hpp\"\n\nnamespace PV {\n\nImageFromMemoryBuffer::ImageFromMemoryBuffer(char const * name, HyPerCol * hc) {\n   initialize_base();\n   initialize(name, hc);\n}\n\nImageFromMemoryBuffer::ImageFromMemoryBuffer() {\n   initialize_base();\n   \/\/ protected default constructor; initialize(name,hc) should be called by any derived class's initialization routine\n}\n\nint ImageFromMemoryBuffer::initialize_base() {\n   buffer = NULL;\n   return PV_SUCCESS;\n}\n\nint ImageFromMemoryBuffer::initialize(char const * name, HyPerCol * hc) {\n   return Image::initialize(name, hc);\n}\n\ntemplate <typename pixeltype>\nint ImageFromMemoryBuffer::setMemoryBuffer(pixeltype const * externalBuffer, int height, int width, int numbands, int xstride, int ystride, int bandstride, pixeltype zeroval, pixeltype oneval) {\n   if (height<=0 || width<=0 || numbands<=0) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"ImageFromMemoryBuffer::setMemoryBuffer error: height, width, numbands arguments must be positive.\\n\");\n      }\n      return PV_FAILURE;\n   }\n   imageLoc.nx = height;\n   imageLoc.ny = width;\n   imageLoc.nf = numbands;\n   imageLoc.nxGlobal = height;\n   imageLoc.nyGlobal = width;\n   imageLoc.kx0 = 0;\n   imageLoc.ky0 = 0;\n   memset(&imageLoc.halo, 0, sizeof(PVHalo));\n\n   if (parent->columnId()==0) {\n      int buffersize = height*width*numbands;\n      buffer = (pvadata_t *) malloc((size_t) buffersize * sizeof(pvadata_t));\n      if (buffer==NULL) {\n         fprintf(stderr, \"%s \\\"%s\\\": unable to allocate buffer for %d values of %zu chars each: %s\\n\",\n               parent->parameters()->groupKeywordFromName(name), name, buffersize, sizeof(pvadata_t), strerror(errno));\n         exit(EXIT_FAILURE);\n      }\n      for (int k=0; k<buffersize; k++) {\n         int x=kxPos(k,width,height,numbands);\n         int y=kyPos(k,width,height,numbands);\n         int f=featureIndex(k,width,height,numbands);\n         int externalIndex = f*bandstride + x*xstride + y*ystride;\n         pixeltype q = externalBuffer[externalIndex];\n         buffer[k] = pixelTypeConvert(q, zeroval, oneval);\n      }\n   }\n   \n   hasNewImageFlag = true;\n\n   return PV_SUCCESS;\n}\ntemplate int ImageFromMemoryBuffer::setMemoryBuffer<uint8_t>(uint8_t const * buffer, int height, int width, int numbands, int xstride, int ystride, int bandstride, uint8_t zeroval, uint8_t oneval);\n\ntemplate <typename pixeltype>\nint ImageFromMemoryBuffer::setMemoryBuffer(pixeltype const * externalBuffer, int height, int width, int numbands, int xstride, int ystride, int bandstride, pixeltype zeroval, pixeltype oneval, int offsetX, int offsetY, char const * offsetAnchor) {\n   offsets[0] = offsetX;\n   offsets[1] = offsetY;\n   free(this->offsetAnchor);\n   this->offsetAnchor = strdup(offsetAnchor);\n   if (checkValidAnchorString()!=PV_SUCCESS) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"%s \\\"%s\\\" error: setMemoryBuffer called with invalid anchor string \\\"%s\\\"\",\n               parent->parameters()->groupKeywordFromName(name), name, offsetAnchor);\n      }\n      MPI_Barrier(parent->icCommunicator()->communicator());\n      exit(EXIT_FAILURE);\n   }\n   return setMemoryBuffer(externalBuffer, height, width, numbands, xstride, ystride, bandstride, zeroval, oneval);\n}\ntemplate int ImageFromMemoryBuffer::setMemoryBuffer<uint8_t>(uint8_t const * buffer, int height, int width, int numbands, int xstride, int ystride, int bandstride, uint8_t zeroval, uint8_t oneval, int offsetX, int offsetY, char const * offsetAnchor);\n\ntemplate <typename pixeltype>\npvadata_t ImageFromMemoryBuffer::pixelTypeConvert(pixeltype q, pixeltype zeroval, pixeltype oneval) {\n   return ((pvadata_t) (q-zeroval))\/((pvadata_t) (oneval-zeroval));\n}\n\nint ImageFromMemoryBuffer::initializeActivity() {\n   return copyBuffer();\n}\n\nint ImageFromMemoryBuffer::updateState(double time, double dt) {\n   return copyBuffer();\n}\n\nint ImageFromMemoryBuffer::copyBuffer() {\n   int status = PV_SUCCESS;\n   if (!hasNewImageFlag) { return status; }\n   Communicator * icComm = parent->icCommunicator();\n   if (parent->columnId()==0) {\n      if (buffer == NULL) {\n         fprintf(stderr, \"%s \\\"%s\\\" error: moveBufferToData called without having called setMemoryBuffer.\\n\",\n               parent->parameters()->groupKeywordFromName(name), name);\n         exit(PV_FAILURE); \/\/ return PV_FAILURE;\n      }\n      for (int rank=1; rank<icComm->commSize(); rank++) {\n         status = moveBufferToData(rank);\n         assert(status == PV_SUCCESS);\n         MPI_Send(data, getNumExtended(), MPI_FLOAT, rank, 31, icComm->communicator());\n      }\n      status = moveBufferToData(0);\n      assert(status == PV_SUCCESS);\n   }\n   else {\n      MPI_Recv(data, getNumExtended(), MPI_FLOAT, 0, 31, icComm->communicator(), MPI_STATUS_IGNORE);\n   }\n   hasNewImageFlag = false;\n   return status;\n}\n\nint ImageFromMemoryBuffer::moveBufferToData(int rank) {\n   if (autoResizeFlag) {\n      fprintf(stderr, \"autoResizeFlag not implemented for ImageFromMemoryBuffer yet :-(\\n\");\n      exit(EXIT_FAILURE);\n   }\n   assert(parent->columnId()==0);\n   assert(buffer != NULL);\n   \n   \/\/ The part of the buffer with x in [processcolumnnumber * nx, processcolumnnumber * (nx + 1) - 1]\n   \/\/ and y in [processcolumnnumber * nx, processcolumnnumber * (nx + 1) - 1]\n   \/\/ gets copied to the restricted space of the given rank.\n   \/\/ If useImageBCflag is set, we also have to copy as much of the surrounding region as\n   \/\/ will fit in both the halo and the image.\n   \/\/ Are we also supposed to mirror any gap between the edge of the image and the edge of the halo?\n   \/\/ The code doesn't do that at this point.\n   \/\/ The code below assumes that all processes have the same getLayerLoc().\n   Communicator * icComm = parent->icCommunicator();\n   int column = columnFromRank(rank, icComm->numCommRows(), icComm->numCommColumns());\n   int startxbuffer = getOffsetX(this->offsetAnchor, this->offsets[0]) + column * getLayerLoc()->nx;\n   int startxdata = getLayerLoc()->halo.lt;\n   int row = rowFromRank(rank, icComm->numCommRows(), icComm->numCommColumns());\n   int startybuffer = getOffsetX(this->offsetAnchor, this->offsets[0]) + row * getLayerLoc()->ny;\n   int startydata = getLayerLoc()->halo.up;\n   int xsize = getLayerLoc()->nx;\n   int ysize = getLayerLoc()->ny;\n   int fsize = getLayerLoc()->nf;\n   PVHalo const * halo = &getLayerLoc()->halo;\n   if (useImageBCflag) {\n\n      int moveleft = startxbuffer;\n      if (halo->lt < moveleft) {\n         moveleft = halo->lt;\n      }\n      if (moveleft > 0) {\n         startxbuffer -= moveleft;\n         startxdata -= moveleft;\n         xsize += moveleft;\n      }\n\n      int moveright = imageLoc.nx - (startxbuffer + xsize);\n      if (halo->rt < moveright) {\n         moveright = halo->rt;\n      }\n      if (moveright > 0) {\n         xsize += moveright;\n      }\n\n      int moveup = startybuffer;\n      if (halo->up < moveup) {\n         moveup = halo->up;\n      }\n      if (moveup > 0) {\n         startybuffer -= moveup;\n         startydata -= moveup;\n         ysize += moveup;\n      }\n\n      int movedown = imageLoc.ny - (startybuffer + ysize);\n      if (halo->dn < movedown) {\n         movedown = halo->dn;\n      }\n      if (movedown > 0) {\n         ysize += movedown;\n      }   \n   }\n   assert(startxbuffer >= 0 && startxbuffer + xsize <= imageLoc.nxGlobal);\n   assert(startybuffer >= 0 && startybuffer + ysize <= imageLoc.nyGlobal);\n   if (fsize != 1 && fsize != imageLoc.nf) {\n      fprintf(stderr, \"%s \\\"%s\\\": If nf is greater than 1, or numbands must be the same as nf\\n\", parent->parameters()->groupKeywordFromName(name), name);\n      exit(EXIT_FAILURE);\n   }\n   if (fsize != imageLoc.nf) {\n      assert(fsize == 1);\n      \/\/ layer has one feature; convert memory buffer to grayscale\n      for (int y=0; y<ysize; y++) {\n         for (int x=0; x<xsize; x++) {\n            int indexdata = kIndex(startxdata+x,startydata+y,0,getLayerLoc()->nx+halo->lt+halo->rt,getLayerLoc()->ny+halo->dn+halo->up,1);\n            int indexbuffer = kIndex(startxdata+x,startydata+y,0,imageLoc.nx,imageLoc.ny,imageLoc.nf);\n            pvdata_t val = (pvadata_t) 0;\n            for (int f=0; f<imageLoc.nf; f++) {\n               val += buffer[indexbuffer+f];\n            }\n            data[indexdata] = val\/(pvadata_t) imageLoc.nf;\n         }\n      }\n   }\n   else {\n      \/\/ layer and memory buffer have the same number of features\n      for (int y=0; y<ysize; y++) {\n         int linestartdata = kIndex(startxdata,startydata+y,0,getLayerLoc()->nx+halo->lt+halo->rt,getLayerLoc()->ny+halo->dn+halo->up,fsize);\n         int linestartbuffer = kIndex(startxbuffer,startybuffer+y,0,imageLoc.nx,imageLoc.ny,fsize);\n         memcpy(&data[linestartdata], &buffer[linestartbuffer], sizeof(pvadata_t) * xsize * fsize);\n      }\n   }\n   return PV_SUCCESS;\n}\n\nImageFromMemoryBuffer::~ImageFromMemoryBuffer() {\n   free(buffer);\n}\n\n}  \/\/ namespace PV\n<|endoftext|>"}
{"text":"<commit_before>class AmbientEnvironment {\n        title = \"    Ambient - Environment\"; \n        values[]= {0}; \n        texts[]= {\" \"}; \n        default = 0;\n};\nclass AmbientCivs {\n        title = \"        Enable Civilians\"; \n        values[]= {0,1}; \n        texts[]= {\"Off\", \"On\"}; \n        default = 1;\n};\nclass AmbientVehs {\n        title = \"        Enable Civilian Vehicles\"; \n        values[]= {0,1}; \n        texts[]= {\"Off\", \"On\"}; \n        default = 0;\n};\nclass AmbientAnimals {\n        title = \"        Enable Animals\"; \n        values[]= {0,1}; \n        texts[]= {\"Off\", \"On\"}; \n        default = 0;\n};\n<commit_msg>[CRB_CIVILIANS] - Renabled Vehicles and Animals as testing shows no sustained impact<commit_after>class AmbientEnvironment {\n        title = \"    Ambient - Environment\"; \n        values[]= {0}; \n        texts[]= {\" \"}; \n        default = 0;\n};\nclass AmbientCivs {\n        title = \"        Enable Civilians\"; \n        values[]= {0,1}; \n        texts[]= {\"Off\", \"On\"}; \n        default = 1;\n};\nclass AmbientVehs {\n        title = \"        Enable Civilian Vehicles\"; \n        values[]= {0,1}; \n        texts[]= {\"Off\", \"On\"}; \n        default = 1;\n};\nclass AmbientAnimals {\n        title = \"        Enable Animals\"; \n        values[]= {0,1}; \n        texts[]= {\"Off\", \"On\"}; \n        default = 1;\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"request_router.h\"\n\n#include \"request.h\"\n#include \"response.h\"\n\nrs::httpserver::RequestRouter::RequestRouter() : \n    routes_({ {\"GET\",{}}, {\"PUT\",{}}, {\"POST\",{}}, {\"DELETE\",{}}, {\"HEAD\",{}} }) {\n}\n\nvoid rs::httpserver::RequestRouter::Add(const char* method, const char* re, Callback func) {\n    std::vector<std::string> namedGroups;\n\n    const char* namedGroupStart = re;\n    while ((namedGroupStart = std::strstr(namedGroupStart, \"(?<\")) != nullptr) {\n        namedGroupStart += 3;\n        auto namedGroupPtr = namedGroupStart;\n        while (*namedGroupPtr != '>' && *namedGroupPtr) {\n            ++namedGroupPtr;\n        }            \n\n        namedGroups.emplace_back(namedGroupStart, namedGroupPtr);\n        namedGroupStart = namedGroupPtr + 1;\n    }       \n    \n    if (routes_.find(method) == routes_.cend()) {\n        routes_[method] = {};\n    }\n\n    routes_[method].push_back(std::make_tuple(boost::basic_regex<char>(re), func, namedGroups));\n}\n\nbool rs::httpserver::RequestRouter::Match(request_ptr request, response_ptr response) const {\n    auto method = request->getMethod();\n    auto methodRoutes = routes_.find(method);\n    \n    for (auto route : methodRoutes->second) {\n        boost::match_results<const char*> what;\n        if (boost::regex_match(request->getUri().c_str(), what, std::get<0>(route))) {\n            CallbackArgs groups;\n            std::vector<std::string> heapValues;\n            for (auto& name : std::get<2>(route)) {                    \n                auto value = what[name];\n                auto valueLength = value.second - value.first;                    \n                if (valueLength < 128) {\n                    auto valueBuffer = reinterpret_cast<char*>(alloca(valueLength + 1));\n                    std::strncpy(valueBuffer, value.first, valueLength);\n                    valueBuffer[valueLength] = '\\0';\n                    groups.emplace(name.c_str(), valueBuffer);\n                } else {\n                    heapValues.emplace_back(value.str());\n                    groups.emplace(name.c_str(), heapValues.back().c_str());\n                }\n            }\n            if ((std::get<1>(route))(request, groups, response)) {\n                return true;\n            }\n        }\n    }\n    return false;\n}   <commit_msg>Fixed a bug where when the router failed to match the http request method<commit_after>#include \"request_router.h\"\n\n#include \"request.h\"\n#include \"response.h\"\n\nrs::httpserver::RequestRouter::RequestRouter() : \n    routes_({ {\"GET\",{}}, {\"PUT\",{}}, {\"POST\",{}}, {\"DELETE\",{}}, {\"HEAD\",{}} }) {\n}\n\nvoid rs::httpserver::RequestRouter::Add(const char* method, const char* re, Callback func) {\n    std::vector<std::string> namedGroups;\n\n    const char* namedGroupStart = re;\n    while ((namedGroupStart = std::strstr(namedGroupStart, \"(?<\")) != nullptr) {\n        namedGroupStart += 3;\n        auto namedGroupPtr = namedGroupStart;\n        while (*namedGroupPtr != '>' && *namedGroupPtr) {\n            ++namedGroupPtr;\n        }            \n\n        namedGroups.emplace_back(namedGroupStart, namedGroupPtr);\n        namedGroupStart = namedGroupPtr + 1;\n    }       \n    \n    if (routes_.find(method) == routes_.cend()) {\n        routes_[method] = {};\n    }\n\n    routes_[method].push_back(std::make_tuple(boost::basic_regex<char>(re), func, namedGroups));\n}\n\nbool rs::httpserver::RequestRouter::Match(request_ptr request, response_ptr response) const {\n    auto method = request->getMethod();\n    auto methodRoutes = routes_.find(method);\n    \n    if (methodRoutes != routes_.cend()) {\n        for (auto route : methodRoutes->second) {\n            boost::match_results<const char*> what;\n            if (boost::regex_match(request->getUri().c_str(), what, std::get<0>(route))) {\n                CallbackArgs groups;\n                std::vector<std::string> heapValues;\n                for (auto& name : std::get<2>(route)) {                    \n                    auto value = what[name];\n                    auto valueLength = value.second - value.first;                    \n                    if (valueLength < 128) {\n                        auto valueBuffer = reinterpret_cast<char*>(alloca(valueLength + 1));\n                        std::strncpy(valueBuffer, value.first, valueLength);\n                        valueBuffer[valueLength] = '\\0';\n                        groups.emplace(name.c_str(), valueBuffer);\n                    } else {\n                        heapValues.emplace_back(value.str());\n                        groups.emplace(name.c_str(), heapValues.back().c_str());\n                    }\n                }\n                if ((std::get<1>(route))(request, groups, response)) {\n                    return true;\n                }\n            }\n        }\n    }\n    \n    return false;\n}   <|endoftext|>"}
{"text":"<commit_before>\/*\n *  gravity_compensation.cpp\n *\n *  Created on: Nov 11, 2013\n *  Authors:   Francisco Viña\n *            fevb <at> kth.se\n *\/\n\n\/* Copyright (c) 2013, Francisco Viña, CVAP, KTH\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 KTH 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 KTH 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#include <ros\/ros.h>\n#include <gravity_compensation\/gravity_compensation.h>\n#include <geometry_msgs\/PoseStamped.h>\n#include <tf_conversions\/tf_eigen.h>\n#include <eigen3\/Eigen\/Core>\n#include <eigen_conversions\/eigen_msg.h>\n\n\nGravityCompensation::GravityCompensation(GravityCompensationParams *g_comp_params)\n{\n    m_g_comp_params = g_comp_params;\n    m_tf_listener = new tf::TransformListener();\n}\n\nGravityCompensation::~GravityCompensation()\n{\n    delete m_tf_listener;\n}\n\n\nvoid GravityCompensation::Zero(const geometry_msgs::WrenchStamped &ft_raw,\n                          geometry_msgs::WrenchStamped &ft_zeroed)\n{\n    std::vector<double> bias = m_g_comp_params->getBias();\n\n    ft_zeroed = ft_raw;\n    ft_zeroed.wrench.force.x = ft_raw.wrench.force.x-bias[0];\n    ft_zeroed.wrench.force.y = ft_raw.wrench.force.y-bias[1];\n    ft_zeroed.wrench.force.z = ft_raw.wrench.force.z-bias[2];\n    ft_zeroed.wrench.torque.x = ft_raw.wrench.torque.x-bias[3];\n    ft_zeroed.wrench.torque.y = ft_raw.wrench.torque.y-bias[4];\n    ft_zeroed.wrench.torque.z = ft_raw.wrench.torque.z-bias[5];\n\n    return ft_zeroed;\n}\n\n\nbool GravityCompensation::Compensate(const geometry_msgs::WrenchStamped &ft_zeroed,\n                                     const sensor_msgs::Imu &gravity,\n                                     geometry_msgs::WrenchStamped &ft_compensated)\n{\n\n    geometry_msgs::Vector3Stamped g;\n    g.vector = gravity.linear_acceleration;\n    g.header = gravity.header;\n    g.header.stamp = ros::Time();\n\n    \/\/ convert the accelerometer reading to the F\/T sensor frame\n    geometry_msgs::Vector3Stamped g_ft_frame;\n    try\n    {\n        m_tf_listener->transformVector(ft_zeroed.header.frame_id, g, g_ft_frame);\n    }\n\n    catch(tf::TransformException &ex)\n    {\n        ROS_ERROR(\"Error transforming gravity vector to ft sensor frame...\");\n        ROS_ERROR(\"%s.\", ex.what());\n        return false;\n    }\n\n    geometry_msgs::WrenchStamped gripper_wrench;\n    gripper_wrench.header.frame_id = ft_zeroed.header.frame_id;\n    double gripper_mass = m_g_comp_params->getGripperMass();\n\n    gripper_wrench.wrench.force.x = g_ft_frame.vector.x * gripper_mass;\n    gripper_wrench.wrench.force.y = g_ft_frame.vector.y * gripper_mass;\n    gripper_wrench.wrench.force.z = g_ft_frame.vector.z * gripper_mass;\n\n\n    tf::StampedTransform gripper_com = m_g_comp_params->getGripperCOM();\n    geometry_msgs::PoseStamped gripper_com_pose;\n    tf::poseTFToMsg(gripper_com, gripper_com_pose.pose);\n    gripper_com_pose.header.frame_id = gripper_com.child_frame_id_;\n    gripper_com_pose.header.stamp = ros::Time();\n\n    \/\/ make sure the gripper COM is expressed with respect to the F\/T sensor frame\n    geometry_msgs::PoseStamped ft_gripper_com_pose;\n\n    try\n    {\n        m_tf_listener->transformPose(ft_zeroed.header.frame_id,\n                                     gripper_com_pose,\n                                     ft_gripper_com_pose);\n    }\n\n    catch(tf::TransformException &ex)\n    {\n        ROS_ERROR(\"Error looking up transform between the gripper COM and the ft sensor frame\");\n        ROS_ERROR(\"%s.\", ex.what());\n        return false;\n    }\n\n    \/\/ convert the geometry_msgs::PoseStamped to tf::Transform\n    tf::Transform T_ft_gripper_com;\n    tf::poseMsgToTF(ft_gripper_com_pose.pose, T_ft_gripper_com);\n\n\n    \/\/ convert to Eigen to do cross product to compute the torque\n    Eigen::Vector3d r;\n    tf::pointMsgToEigen(ft_gripper_com_pose.pose.position, r);\n\n    Eigen::Vector3d gripper_weight_eigen;\n    tf::vectorMsgToEigen(gripper_wrench.wrench.force, gripper_weight_eigen);\n\n    \/\/ compute torque generated by weight of the gripper\n    Eigen::Vector3d gripper_torque_eigen = r.cross(gripper_weight_eigen);\n    tf::vectorEigenToMsg(gripper_torque_eigen, gripper_wrench.wrench.torque);\n\n    \/\/ compensate force+torque\n    Eigen::Matrix<double, 6, 1> ft_zeroed_eigen;\n    Eigen::Matrix<double, 6, 1> ft_compensated_eigen;\n\n    tf::wrenchMsgToEigen(ft_zeroed.wrench, ft_zeroed_eigen);\n\n    ft_compensated_eigen =\n\n    \/\/ compensated FT in FT sensor frame\n    geometry_msgs::Vector3Stamped FT_Fvec_comp;\n    geometry_msgs::Vector3Stamped FT_Tvec_comp;\n    FT_Fvec_comp.header.frame_id = EndEffector_Weight.header.frame_id;\n    FT_Tvec_comp.header.frame_id = EndEffector_Weight.header.frame_id;\n    FT_Fvec_comp.header.stamp = ros::Time();\n    FT_Tvec_comp.header.stamp = ros::Time();\n\n    FT_Fvec_comp.vector.x = FT_raw.wrench.force.x - EndEffector_Weight.wrench.force.x;\n    FT_Fvec_comp.vector.y = FT_raw.wrench.force.y - EndEffector_Weight.wrench.force.y;\n    FT_Fvec_comp.vector.z = FT_raw.wrench.force.z - EndEffector_Weight.wrench.force.z;\n\n    FT_Tvec_comp.vector.x = FT_raw.wrench.torque.x - EndEffector_Weight.wrench.torque.x;\n    FT_Tvec_comp.vector.y = FT_raw.wrench.torque.y - EndEffector_Weight.wrench.torque.y;\n    FT_Tvec_comp.vector.z = FT_raw.wrench.torque.z - EndEffector_Weight.wrench.torque.z;\n\n\n    \/\/ now expressed in the FT frame\n    FT_comp.wrench.force = FT_Fvec_comp.vector;\n    FT_comp.wrench.torque = FT_Tvec_comp.vector;\n    FT_comp.header.stamp = FT_raw.header.stamp;\n    FT_comp.header.frame_id = FT_raw.header.frame_id;\n\n    return true;\n\n\n    return ft_compensated;\n}\n<commit_msg>finished Compensate() function<commit_after>\/*\n *  gravity_compensation.cpp\n *\n *  Created on: Nov 11, 2013\n *  Authors:   Francisco Viña\n *            fevb <at> kth.se\n *\/\n\n\/* Copyright (c) 2013, Francisco Viña, CVAP, KTH\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 KTH 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 KTH 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#include <ros\/ros.h>\n#include <gravity_compensation\/gravity_compensation.h>\n#include <geometry_msgs\/PoseStamped.h>\n#include <tf_conversions\/tf_eigen.h>\n#include <eigen3\/Eigen\/Core>\n#include <eigen_conversions\/eigen_msg.h>\n\n\nGravityCompensation::GravityCompensation(GravityCompensationParams *g_comp_params)\n{\n    m_g_comp_params = g_comp_params;\n    m_tf_listener = new tf::TransformListener();\n}\n\nGravityCompensation::~GravityCompensation()\n{\n    delete m_tf_listener;\n}\n\n\nvoid GravityCompensation::Zero(const geometry_msgs::WrenchStamped &ft_raw,\n                          geometry_msgs::WrenchStamped &ft_zeroed)\n{\n    std::vector<double> bias = m_g_comp_params->getBias();\n\n    ft_zeroed = ft_raw;\n    ft_zeroed.wrench.force.x = ft_raw.wrench.force.x-bias[0];\n    ft_zeroed.wrench.force.y = ft_raw.wrench.force.y-bias[1];\n    ft_zeroed.wrench.force.z = ft_raw.wrench.force.z-bias[2];\n    ft_zeroed.wrench.torque.x = ft_raw.wrench.torque.x-bias[3];\n    ft_zeroed.wrench.torque.y = ft_raw.wrench.torque.y-bias[4];\n    ft_zeroed.wrench.torque.z = ft_raw.wrench.torque.z-bias[5];\n\n}\n\n\nbool GravityCompensation::Compensate(const geometry_msgs::WrenchStamped &ft_zeroed,\n                                     const sensor_msgs::Imu &gravity,\n                                     geometry_msgs::WrenchStamped &ft_compensated)\n{\n\n    geometry_msgs::Vector3Stamped g;\n    g.vector = gravity.linear_acceleration;\n    g.header = gravity.header;\n    g.header.stamp = ros::Time();\n\n    \/\/ convert the accelerometer reading to the F\/T sensor frame\n    geometry_msgs::Vector3Stamped g_ft_frame;\n    try\n    {\n        m_tf_listener->transformVector(ft_zeroed.header.frame_id, g, g_ft_frame);\n    }\n\n    catch(tf::TransformException &ex)\n    {\n        ROS_ERROR(\"Error transforming gravity vector to ft sensor frame...\");\n        ROS_ERROR(\"%s.\", ex.what());\n        return false;\n    }\n\n\n    double gripper_mass = m_g_comp_params->getGripperMass();\n    Eigen::Vector3d g_ft_frame_eigen;\n    tf::vectorMsgToEigen(g_ft_frame.vector, g_ft_frame_eigen);\n\n\n    Eigen::Matrix<double, 6, 1> gripper_wrench_eigen;\n    gripper_wrench_eigen.topRows(3) = g_ft_frame_eigen*gripper_mass;\n\n\n    tf::StampedTransform gripper_com = m_g_comp_params->getGripperCOM();\n    geometry_msgs::PoseStamped gripper_com_pose;\n    tf::poseTFToMsg(gripper_com, gripper_com_pose.pose);\n    gripper_com_pose.header.frame_id = gripper_com.child_frame_id_;\n    gripper_com_pose.header.stamp = ros::Time();\n\n    \/\/ make sure the gripper COM is expressed with respect to the F\/T sensor frame\n    geometry_msgs::PoseStamped ft_gripper_com_pose;\n\n    try\n    {\n        m_tf_listener->transformPose(ft_zeroed.header.frame_id,\n                                     gripper_com_pose,\n                                     ft_gripper_com_pose);\n    }\n\n    catch(tf::TransformException &ex)\n    {\n        ROS_ERROR(\"Error looking up transform between the gripper COM and the ft sensor frame\");\n        ROS_ERROR(\"%s.\", ex.what());\n        return false;\n    }\n\n    \/\/ convert to Eigen to do cross product to compute the torque\n    Eigen::Vector3d r;\n    tf::pointMsgToEigen(ft_gripper_com_pose.pose.position, r);\n\n    \/\/ compute torque generated by weight of the gripper\n    Eigen::Vector3d gripper_torque_eigen = r.cross(gripper_wrench_eigen.topRows(3));\n    gripper_wrench_eigen.bottomRows(3) = gripper_torque_eigen;\n\n    \/\/ compensate force & torque\n    Eigen::Matrix<double, 6, 1> ft_zeroed_eigen;\n    tf::wrenchMsgToEigen(ft_zeroed.wrench, ft_zeroed_eigen);\n    Eigen::Matrix<double, 6, 1> ft_compensated_eigen;\n\n    ft_compensated_eigen = ft_zeroed_eigen - gripper_wrench_eigen;\n\n    tf::wrenchEigenToMsg(ft_compensated_eigen, ft_compensated.wrench);\n    ft_compensated.header = ft_zeroed.header;\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"inputdevice.h\"\n#include \"inputcontext.h\"\nnamespace {\n    const bool IS_DOWN_UNDEFINED = false;\n    const bool IS_UP_UNDEFINED = true;\n    const bool IS_RELEASED_UNDEFINED = false;\n    const bool IS_PRESSED_UNDEFINED = false;\n    const float RANGE_UNDEFINED = 0.0f;\n}\nnamespace sdli {\n\nbool isPressed(const LogicDigitalData& d)\n{\n    return d.currentStatus\n            && d.previousStatus != d.currentStatus;\n}\n\nbool isReleased(const LogicDigitalData& d)\n{\n    return !d.currentStatus\n            && d.previousStatus != d.currentStatus;\n}\n\nvoid InputDevice::handleKeyboard(const InputDevice::RawInputData& raw)\n{\n    auto& ctx = this->contextStack_.top();\n\n    auto inputAction = ctx->keyAction(static_cast<SDL_Scancode>(raw.rawInput));\n    auto& logic = logicDigitalData[inputAction];\n\n    logic.previousStatus = logic.currentStatus;\n    logic.currentStatus = raw.pollResult;\n\n    if(::sdli::isPressed(logic))\n    {\n        ctx->fireCallbacks(inputAction, sdli::CallType::OnPress);\n        return;\n    }\n    if(::sdli::isReleased(logic))\n    {\n        ctx->fireCallbacks(inputAction, sdli::CallType::OnRelease);\n        return;\n    }\n}\n\nInputDevice::InputDevice()\n{\n}\n\nvoid InputDevice::poll()\n{\n    if(this->contextStack_.empty())\n    {\n        return;\n    }\n\n\n    auto sdl_keystate = SDL_GetKeyboardState(NULL);\n\/\/    for(auto& i : keyboardKeys)\n\/\/    {\n\/\/        auto state = sdl_keystate[i.first];\n\/\/        logicDigitalData[i.second].previousStatus = logicDigitalData[i.second].currentStatus;\n\/\/        logicDigitalData[i.second].currentStatus = state;\n\/\/    }\n\n\n}\n\nvoid InputDevice::push(InputType type, unsigned int rawInput, int value)\n{\n    perFrameCaptures.emplace_back(RawInputData{type, rawInput, value});\n}\n\n\/\/TODO: evaluate isPressed correctly - detect changes over multiple samples\nvoid InputDevice::dispatch()\n{\n    if(this->contextStack_.empty())\n    {\n        return;\n    }\n\n    for(auto& i : logicDigitalData)\n    {\n        i.second.previousStatus = i.second.currentStatus;\n        i.second.currentStatus = false;\n    }\n\n    for(auto& d : perFrameCaptures)\n    {\n        switch(d.type)\n        {\n        case InputType::Keyboard:\n            handleKeyboard(d);\n            break;\n        default:\n            break;\n\/\/        case InputType::Keyboard:\n\/\/            logicDigitalData[keyboardKeys[static_cast<SDL_Scancode>(d.rawInput)]].currentStatus |= d.pollResult;\n\/\/            break;\n\n\/\/        case InputType::GamecontrollerButton:\n\/\/            logicDigitalData[gameControllerButtons[static_cast<SDL_GameControllerButton>(d.rawInput)]].currentStatus |= d.pollResult;\n\/\/            break;\n\n\/\/        case InputType::GamecontrollerAxis:\n\/\/            logicAnalogData[gameControllerAxes[static_cast<SDL_GameControllerAxis>(d.rawInput)].axis].currentStatus = static_cast<float>(d.pollResult);\n\/\/            \/\/ \/ gameControllerAxes[static_cast<SDL_GameControllerAxis>(d.rawInput)].normalizeValue;\n\/\/            break;\n\/\/        case InputType::MouseButton:\n\/\/            \/\/ TBA - Req for public ?\n\/\/            break;\n\/\/        case InputType::MouseAxis:\n\/\/            \/\/ TBA - Req for public ?\n\/\/            break;\n        }\n    }\n\n    perFrameCaptures.clear();\n}\n\nfloat InputDevice::getRange(InputAxis axis)\n{\n    if(contextStack_.empty()\n            || logicAnalogData.find(axis) == logicAnalogData.end())\n    {\n        return RANGE_UNDEFINED;\n    }\n\n    return logicAnalogData[axis].currentStatus;\n}\n\nbool InputDevice::isPressed(InputAction action)\n{\n    if(contextStack_.empty()\n            || logicDigitalData.find(action) == logicDigitalData.end())\n    {\n        return ::IS_PRESSED_UNDEFINED;\n    }\n\n    return logicDigitalData[action].currentStatus\n            && logicDigitalData[action].previousStatus != logicDigitalData[action].currentStatus;\n}\n\nbool InputDevice::isReleased(InputAction action)\n{\n    if(contextStack_.empty() || logicDigitalData.find(action) == logicDigitalData.end())\n    {\n        return ::IS_RELEASED_UNDEFINED;\n    }\n\n    return !logicDigitalData[action].currentStatus\n            && logicDigitalData[action].previousStatus != logicDigitalData[action].currentStatus;;\n}\n\nbool InputDevice::isDown(InputAction action)\n{\n    if(contextStack_.empty() || logicDigitalData.find(action) == logicDigitalData.end())\n    {\n        return ::IS_DOWN_UNDEFINED;\n    }\n    std::function<void()> test;\n    return logicDigitalData[action].currentStatus;\n}\n\nbool InputDevice::isUp(InputAction action)\n{\n    if(contextStack_.empty() || logicDigitalData.find(action) == logicDigitalData.end())\n    {\n        return ::IS_UP_UNDEFINED;\n    }\n\n    return logicDigitalData[action].currentStatus;\n}\n\nvoid InputDevice::pushContext(InputContext* newContext)\n{\n    contextStack_.push(newContext);\n}\n\n}\n<commit_msg>Fixed Release bug in event dispatching<commit_after>#include \"inputdevice.h\"\n#include \"inputcontext.h\"\nnamespace {\n    const bool IS_DOWN_UNDEFINED = false;\n    const bool IS_UP_UNDEFINED = true;\n    const bool IS_RELEASED_UNDEFINED = false;\n    const bool IS_PRESSED_UNDEFINED = false;\n    const float RANGE_UNDEFINED = 0.0f;\n}\nnamespace sdli {\n\nbool isPressed(const LogicDigitalData& d)\n{\n    return d.currentStatus\n            && d.previousStatus != d.currentStatus;\n}\n\nbool isReleased(const LogicDigitalData& d)\n{\n    return !d.currentStatus\n            && d.previousStatus != d.currentStatus;\n}\n\nvoid InputDevice::handleKeyboard(const InputDevice::RawInputData& raw)\n{\n    auto& ctx = this->contextStack_.top();\n\n    auto inputAction = ctx->keyAction(static_cast<SDL_Scancode>(raw.rawInput));\n    auto& logic = logicDigitalData[inputAction];\n\n\/\/    logic.previousStatus = logic.currentStatus;\n    logic.currentStatus = raw.pollResult;\n\n    if(::sdli::isPressed(logic))\n    {\n        ctx->fireCallbacks(inputAction, sdli::CallType::OnPress);\n        return;\n    }\n    if(::sdli::isReleased(logic))\n    {\n        ctx->fireCallbacks(inputAction, sdli::CallType::OnRelease);\n        return;\n    }\n}\n\nInputDevice::InputDevice()\n{\n}\n\nvoid InputDevice::poll()\n{\n    if(this->contextStack_.empty())\n    {\n        return;\n    }\n\n\n    auto sdl_keystate = SDL_GetKeyboardState(NULL);\n\/\/    for(auto& i : keyboardKeys)\n\/\/    {\n\/\/        auto state = sdl_keystate[i.first];\n\/\/        logicDigitalData[i.second].previousStatus = logicDigitalData[i.second].currentStatus;\n\/\/        logicDigitalData[i.second].currentStatus = state;\n\/\/    }\n\n\n}\n\nvoid InputDevice::push(InputType type, unsigned int rawInput, int value)\n{\n    perFrameCaptures.emplace_back(RawInputData{type, rawInput, value});\n}\n\n\/\/TODO: evaluate isPressed correctly - detect changes over multiple samples\nvoid InputDevice::dispatch()\n{\n    if(this->contextStack_.empty())\n    {\n        return;\n    }\n\n    for(auto& i : logicDigitalData)\n    {\n        i.second.previousStatus = i.second.currentStatus;\n    }\n\n    for(auto& d : perFrameCaptures)\n    {\n        switch(d.type)\n        {\n        case InputType::Keyboard:\n            handleKeyboard(d);\n            break;\n        default:\n            break;\n\/\/        case InputType::Keyboard:\n\/\/            logicDigitalData[keyboardKeys[static_cast<SDL_Scancode>(d.rawInput)]].currentStatus |= d.pollResult;\n\/\/            break;\n\n\/\/        case InputType::GamecontrollerButton:\n\/\/            logicDigitalData[gameControllerButtons[static_cast<SDL_GameControllerButton>(d.rawInput)]].currentStatus |= d.pollResult;\n\/\/            break;\n\n\/\/        case InputType::GamecontrollerAxis:\n\/\/            logicAnalogData[gameControllerAxes[static_cast<SDL_GameControllerAxis>(d.rawInput)].axis].currentStatus = static_cast<float>(d.pollResult);\n\/\/            \/\/ \/ gameControllerAxes[static_cast<SDL_GameControllerAxis>(d.rawInput)].normalizeValue;\n\/\/            break;\n\/\/        case InputType::MouseButton:\n\/\/            \/\/ TBA - Req for public ?\n\/\/            break;\n\/\/        case InputType::MouseAxis:\n\/\/            \/\/ TBA - Req for public ?\n\/\/            break;\n        }\n    }\n\n    perFrameCaptures.clear();\n}\n\nfloat InputDevice::getRange(InputAxis axis)\n{\n    if(contextStack_.empty()\n            || logicAnalogData.find(axis) == logicAnalogData.end())\n    {\n        return RANGE_UNDEFINED;\n    }\n\n    return logicAnalogData[axis].currentStatus;\n}\n\nbool InputDevice::isPressed(InputAction action)\n{\n    if(contextStack_.empty()\n            || logicDigitalData.find(action) == logicDigitalData.end())\n    {\n        return ::IS_PRESSED_UNDEFINED;\n    }\n\n    return logicDigitalData[action].currentStatus\n            && logicDigitalData[action].previousStatus != logicDigitalData[action].currentStatus;\n}\n\nbool InputDevice::isReleased(InputAction action)\n{\n    if(contextStack_.empty() || logicDigitalData.find(action) == logicDigitalData.end())\n    {\n        return ::IS_RELEASED_UNDEFINED;\n    }\n\n    return !logicDigitalData[action].currentStatus\n            && logicDigitalData[action].previousStatus != logicDigitalData[action].currentStatus;;\n}\n\nbool InputDevice::isDown(InputAction action)\n{\n    if(contextStack_.empty() || logicDigitalData.find(action) == logicDigitalData.end())\n    {\n        return ::IS_DOWN_UNDEFINED;\n    }\n    std::function<void()> test;\n    return logicDigitalData[action].currentStatus;\n}\n\nbool InputDevice::isUp(InputAction action)\n{\n    if(contextStack_.empty() || logicDigitalData.find(action) == logicDigitalData.end())\n    {\n        return ::IS_UP_UNDEFINED;\n    }\n\n    return logicDigitalData[action].currentStatus;\n}\n\nvoid InputDevice::pushContext(InputContext* newContext)\n{\n    contextStack_.push(newContext);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*-----------------------------------------------------------------------------\n\n Copyright 2017 Hopsan Group\n\n    Licensed under the Apache License, Version 2.0 (the \"License\");\n    you may not use this file except in compliance with the License.\n    You may obtain a copy of the License at\n\n        http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n    Unless required by applicable law or agreed to in writing, software\n    distributed under the License is distributed on an \"AS IS\" BASIS,\n    WITHOUT WARRANTIES OR CONDITIONS OF 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 The full license is available in the file LICENSE.\n For details about the 'Hopsan Group' or information about Authors and\n Contributors see the HOPSANGROUP and AUTHORS files that are located in\n the Hopsan source code root directory.\n\n-----------------------------------------------------------------------------*\/\n\n#include \"fmu_hopsan.h\"\n#include \"HopsanCore.h\"\n#include \"HopsanEssentials.h\"\n#include \"HopsanTypes.h\"\n#include <string>\n#include \"model.hpp\"\n#include <cassert>\n#include \"ComponentUtilities\/num2string.hpp\"\n#include <map>\n\nnamespace {\n\nstatic double fmu_time=0;\nstatic hopsan::ComponentSystem *spCoreComponentSystem = 0;\nstatic std::vector<std::string> sComponentNames;\nhopsan::HopsanEssentials gHopsanCore;\n\ndouble *dataPtrs[<<<nports>>>];\n\nstd::map<int,hopsan::HString> realParametersMap;\nstd::map<int,hopsan::HString> intParametersMap;\nstd::map<int,hopsan::HString> boolParametersMap;\nstd::map<int,hopsan::HString> stringParametersMap;\n\nstd::string parseResourceLocation(std::string uri)\n{\n    \/\/ The resource location is an URI according to rfc3986 on the following format\n    \/\/ schema:\/\/authority\/path or schema:\/path\n    \/\/ authority is expected to be empty if included\n    \/\/ only the 'file' schema is supported by Hopsan\n    std::string::size_type se = uri.find_first_of(':');\n    std::string schema = uri.substr(0,se);\n    \/\/ If the next two chars are \/\/ then authority is included (may be empty)\n    std::string::size_type pb;\n    if (uri.substr(se+1,2) == \"\/\/\") {\n        pb = uri.find_first_of('\/', se+3);\n    } else {\n        pb = uri.find_first_of('\/', se);\n    }\n    \/\/ Now we know were the path begins (pb), but is it a unix or windows path\n    \/\/ Check windows\n    if (uri.substr(pb+2,2) == \":\/\") {\n        \/\/ Skip first \/\n        pb++;\n    }\n    std::string path = uri.substr(pb);\n#ifdef _WIN32\n    std::string::size_type i = path.find_first_of('\/');\n    while (i != std::string::npos) {\n        path.replace(i, 1, 1, '\\\\');\n        i = path.find_first_of('\/');\n    }\n#endif\n    return path;\n}\n}\n\nextern \"C\" {\n\nint hopsan_instantiate(const char *resourceLocation)\n{\n    double startT, stopT;      \/\/ Dummy variables\n    spCoreComponentSystem = gHopsanCore.loadHMFModel(getModelString().c_str(), startT, stopT);\n    if (spCoreComponentSystem)\n    {\n        std::string rl = parseResourceLocation(resourceLocation);\n        spCoreComponentSystem->addSearchPath(rl.c_str());\n\n        \/\/ Get pointers to I\/O data variables\n<<<setdataptrs>>>\n\n        \/\/Populate parameter name maps\n<<<addparameterstomap>>>\n\n        \/\/ Initialize system\n        spCoreComponentSystem->setDesiredTimestep(<<<timestep>>>);\n        spCoreComponentSystem->setNumLogSamples(0);\n        \/\/! @todo disableLog does not work without setNumLogsamples0\n        spCoreComponentSystem->disableLog();\n        if (spCoreComponentSystem->checkModelBeforeSimulation())\n        {\n            return 1; \/\/ C true\n        }\n    }\n    return 0;  \/\/ C false\n}\n\nint hopsan_initialize(double startT, double stopT)\n{\n    return spCoreComponentSystem->initialize(startT, stopT) ? 1 : 0;\n}\n\n\nvoid hopsan_simulate(double stopTime)\n{\n    spCoreComponentSystem->simulate(stopTime);\n}\n\nvoid hopsan_finalize()\n{\n    spCoreComponentSystem->finalize();\n}\n\nint hopsan_has_message()\n{\n    return (gHopsanCore.checkMessage() > 0) ? 1 : 0;\n}\n\nvoid hopsan_get_message(hopsan_message_callback_t message_callback, void* userState)\n{\n    hopsan::HString message, type, tag;\n    gHopsanCore.getMessage(message, type, tag);\n\n    \/\/ Replace any # with ## (# is reserved by FMI for value references)\n    \/\/ # is used as escape character in this case\n    message.replace(\"#\", \"##\");\n\n    \/\/ Replace any single % since we do not use printf format strings inside Hopsan\n    \/\/ The FMI standard assuems that message is a printf format string\n    \/\/ Use %% to print %\n    message.replace(\"%\", \"%%\");\n\n    message_callback(message.c_str(), type.c_str(), userState);\n}\n\ndouble hopsan_get_real(int vr)\n{\n    if(vr < <<<nports>>>) {\n        return (*dataPtrs[vr]);\n    }\n    if(realParametersMap.count(vr)) {\n        hopsan::HString value;\n        spCoreComponentSystem->getParameterValue(realParametersMap[vr],value);\n        bool ok;\n        return value.toDouble(&ok);\n    }\n    return -1;\n}\n\nint hopsan_get_integer(int vr)\n{\n    if(intParametersMap.count(vr)) {\n        hopsan::HString value;\n        spCoreComponentSystem->getParameterValue(intParametersMap[vr],value);\n        bool ok;\n        return value.toLongInt(&ok);\n    }\n    return -1;\n}\n\nint hopsan_get_boolean(int vr)\n{\n    if(boolParametersMap.count(vr)) {\n        hopsan::HString value;\n        spCoreComponentSystem->getParameterValue(boolParametersMap[vr],value);\n        bool ok;\n        return value.toBool(&ok);\n    }\n    return false;\n}\n\nconst char* hopsan_get_string(int vr)\n{\n    if(stringParametersMap.count(vr)) {\n        hopsan::HString value;\n        spCoreComponentSystem->getParameterValue(stringParametersMap[vr],value);\n        bool ok;\n        return value.c_str();\n    }\n    return \"\";\n}\n\nvoid hopsan_set_real(int vr, double value)\n{\n    if(vr < <<<nports>>>) {\n        (*dataPtrs[vr]) = value;\n    }\n    else if(realParametersMap.count(vr)) {\n        spCoreComponentSystem->setParameterValue(realParametersMap[vr], to_hstring(value));\n    }\n}\n\nvoid hopsan_set_integer(int vr, int value)\n{\n    if(intParametersMap.count(vr)) {\n        spCoreComponentSystem->setParameterValue(intParametersMap[vr], to_hstring(value));\n    }\n}\n\nvoid hopsan_set_boolean(int vr, int value)\n{\n    if(boolParametersMap.count(vr)) {\n        hopsan::HString hvalue = \"true\";\n        if(value != 0) {\n            hvalue = \"false\";\n        }\n        spCoreComponentSystem->setParameterValue(boolParametersMap[vr], hvalue);\n    }\n}\n\nvoid hopsan_set_string(int vr, const char* value)\n{\n    if(stringParametersMap.count(vr)) {\n        spCoreComponentSystem->setParameterValue(stringParametersMap[vr], value);\n    }\n}\n\n}\n<commit_msg>Avoid returning reference to temporary in exported FMI code<commit_after>\/*-----------------------------------------------------------------------------\n\n Copyright 2017 Hopsan Group\n\n    Licensed under the Apache License, Version 2.0 (the \"License\");\n    you may not use this file except in compliance with the License.\n    You may obtain a copy of the License at\n\n        http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n    Unless required by applicable law or agreed to in writing, software\n    distributed under the License is distributed on an \"AS IS\" BASIS,\n    WITHOUT WARRANTIES OR CONDITIONS OF 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 The full license is available in the file LICENSE.\n For details about the 'Hopsan Group' or information about Authors and\n Contributors see the HOPSANGROUP and AUTHORS files that are located in\n the Hopsan source code root directory.\n\n-----------------------------------------------------------------------------*\/\n\n#include \"fmu_hopsan.h\"\n#include \"HopsanCore.h\"\n#include \"HopsanEssentials.h\"\n#include \"HopsanTypes.h\"\n#include <string>\n#include \"model.hpp\"\n#include <cassert>\n#include \"ComponentUtilities\/num2string.hpp\"\n#include <map>\n\nnamespace {\n\nstatic double fmu_time=0;\nstatic hopsan::ComponentSystem *spCoreComponentSystem = 0;\nstatic std::vector<std::string> sComponentNames;\nhopsan::HopsanEssentials gHopsanCore;\n\ndouble *dataPtrs[<<<nports>>>];\n\nstd::map<int,hopsan::HString> realParametersMap;\nstd::map<int,hopsan::HString> intParametersMap;\nstd::map<int,hopsan::HString> boolParametersMap;\nstd::map<int,hopsan::HString> stringParametersMap;\n\nstatic hopsan::HString get_string_retval;\n\nstd::string parseResourceLocation(std::string uri)\n{\n    \/\/ The resource location is an URI according to rfc3986 on the following format\n    \/\/ schema:\/\/authority\/path or schema:\/path\n    \/\/ authority is expected to be empty if included\n    \/\/ only the 'file' schema is supported by Hopsan\n    std::string::size_type se = uri.find_first_of(':');\n    std::string schema = uri.substr(0,se);\n    \/\/ If the next two chars are \/\/ then authority is included (may be empty)\n    std::string::size_type pb;\n    if (uri.substr(se+1,2) == \"\/\/\") {\n        pb = uri.find_first_of('\/', se+3);\n    } else {\n        pb = uri.find_first_of('\/', se);\n    }\n    \/\/ Now we know were the path begins (pb), but is it a unix or windows path\n    \/\/ Check windows\n    if (uri.substr(pb+2,2) == \":\/\") {\n        \/\/ Skip first \/\n        pb++;\n    }\n    std::string path = uri.substr(pb);\n#ifdef _WIN32\n    std::string::size_type i = path.find_first_of('\/');\n    while (i != std::string::npos) {\n        path.replace(i, 1, 1, '\\\\');\n        i = path.find_first_of('\/');\n    }\n#endif\n    return path;\n}\n}\n\nextern \"C\" {\n\nint hopsan_instantiate(const char *resourceLocation)\n{\n    double startT, stopT;      \/\/ Dummy variables\n    spCoreComponentSystem = gHopsanCore.loadHMFModel(getModelString().c_str(), startT, stopT);\n    if (spCoreComponentSystem)\n    {\n        std::string rl = parseResourceLocation(resourceLocation);\n        spCoreComponentSystem->addSearchPath(rl.c_str());\n\n        \/\/ Get pointers to I\/O data variables\n<<<setdataptrs>>>\n\n        \/\/Populate parameter name maps\n<<<addparameterstomap>>>\n\n        \/\/ Initialize system\n        spCoreComponentSystem->setDesiredTimestep(<<<timestep>>>);\n        spCoreComponentSystem->setNumLogSamples(0);\n        \/\/! @todo disableLog does not work without setNumLogsamples0\n        spCoreComponentSystem->disableLog();\n        if (spCoreComponentSystem->checkModelBeforeSimulation())\n        {\n            return 1; \/\/ C true\n        }\n    }\n    return 0;  \/\/ C false\n}\n\nint hopsan_initialize(double startT, double stopT)\n{\n    return spCoreComponentSystem->initialize(startT, stopT) ? 1 : 0;\n}\n\n\nvoid hopsan_simulate(double stopTime)\n{\n    spCoreComponentSystem->simulate(stopTime);\n}\n\nvoid hopsan_finalize()\n{\n    spCoreComponentSystem->finalize();\n}\n\nint hopsan_has_message()\n{\n    return (gHopsanCore.checkMessage() > 0) ? 1 : 0;\n}\n\nvoid hopsan_get_message(hopsan_message_callback_t message_callback, void* userState)\n{\n    hopsan::HString message, type, tag;\n    gHopsanCore.getMessage(message, type, tag);\n\n    \/\/ Replace any # with ## (# is reserved by FMI for value references)\n    \/\/ # is used as escape character in this case\n    message.replace(\"#\", \"##\");\n\n    \/\/ Replace any single % since we do not use printf format strings inside Hopsan\n    \/\/ The FMI standard assuems that message is a printf format string\n    \/\/ Use %% to print %\n    message.replace(\"%\", \"%%\");\n\n    message_callback(message.c_str(), type.c_str(), userState);\n}\n\ndouble hopsan_get_real(int vr)\n{\n    if(vr < <<<nports>>>) {\n        return (*dataPtrs[vr]);\n    }\n    if(realParametersMap.count(vr)) {\n        hopsan::HString value;\n        spCoreComponentSystem->getParameterValue(realParametersMap[vr],value);\n        bool ok;\n        return value.toDouble(&ok);\n    }\n    return -1;\n}\n\nint hopsan_get_integer(int vr)\n{\n    if(intParametersMap.count(vr)) {\n        hopsan::HString value;\n        spCoreComponentSystem->getParameterValue(intParametersMap[vr],value);\n        bool ok;\n        return value.toLongInt(&ok);\n    }\n    return -1;\n}\n\nint hopsan_get_boolean(int vr)\n{\n    if(boolParametersMap.count(vr)) {\n        hopsan::HString value;\n        spCoreComponentSystem->getParameterValue(boolParametersMap[vr],value);\n        bool ok;\n        return value.toBool(&ok);\n    }\n    return false;\n}\n\nconst char* hopsan_get_string(int vr)\n{\n    if(stringParametersMap.count(vr)) {\n        spCoreComponentSystem->getParameterValue(stringParametersMap[vr],get_string_retval);\n        return get_string_retval.c_str();\n    }\n    return \"\";\n}\n\nvoid hopsan_set_real(int vr, double value)\n{\n    if(vr < <<<nports>>>) {\n        (*dataPtrs[vr]) = value;\n    }\n    else if(realParametersMap.count(vr)) {\n        spCoreComponentSystem->setParameterValue(realParametersMap[vr], to_hstring(value));\n    }\n}\n\nvoid hopsan_set_integer(int vr, int value)\n{\n    if(intParametersMap.count(vr)) {\n        spCoreComponentSystem->setParameterValue(intParametersMap[vr], to_hstring(value));\n    }\n}\n\nvoid hopsan_set_boolean(int vr, int value)\n{\n    if(boolParametersMap.count(vr)) {\n        hopsan::HString hvalue = \"true\";\n        if(value != 0) {\n            hvalue = \"false\";\n        }\n        spCoreComponentSystem->setParameterValue(boolParametersMap[vr], hvalue);\n    }\n}\n\nvoid hopsan_set_string(int vr, const char* value)\n{\n    if(stringParametersMap.count(vr)) {\n        spCoreComponentSystem->setParameterValue(stringParametersMap[vr], value);\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#include <TString.h>\n\n#include \"AliITSresponseSDD.h\"\n\n\n\/\/___________________________________________\nClassImp(AliITSresponseSDD)\t\n\nAliITSresponseSDD::AliITSresponseSDD()\n{\n  \/\/ constructor\n   SetMaxAdc();\n   SetDiffCoeff();\n   SetDriftSpeed();\n   SetNSigmaIntegration();\n   SetNLookUp();\n   \/\/ SetClock();\n   SetNoiseParam();\n   SetNoiseAfterElectronics();\n   SetElectronics();\n   SetDynamicRange();\n   SetChargeLoss();\n   SetMinVal();\n   SetParamOptions();\n   SetZeroSupp();\n   SetDataType();\n   SetFilenames();\n   SetOutputOption();\n   SetDo10to8();\n}\nAliITSresponseSDD::~AliITSresponseSDD() { \n\n  if(fGaus) delete fGaus;\n\n}\n\nvoid AliITSresponseSDD::SetCompressParam(Int_t  cp[8])\n{\n  \/\/ set compression param\n\n    Int_t i;\n    for (i=0; i<8; i++) {\n\tfCPar[i]=cp[i];\n\t\/\/printf(\"\\n CompressPar %d %d \\n\",i,fCPar[i]);\n\t\n    }\n}\nvoid AliITSresponseSDD::GiveCompressParam(Int_t  cp[8])\n{\n  \/\/ give compression param\n\n    Int_t i;\n    for (i=0; i<8; i++) {\n\tcp[i]=fCPar[i];\n    }\n}\n\nvoid AliITSresponseSDD::Print()\n{\n  \/\/ Print SDD response Parameters\n\n   cout << \"**************************************************\" << endl;\n   cout << \"   Silicon Drift Detector Response Parameters    \" << endl;\n   cout << \"**************************************************\" << endl;\n   cout << \"Diffusion Coefficients: \" << fDiffCoeff << \", \" << fDiffCoeff1 << endl;\n\n   cout << \"Hardware compression parameters: \" << endl; \n   for(Int_t i=0; i<8; i++) cout << \"fCPar[\" << i << \"] = \" << fCPar[i] << endl;\n   cout << \"Noise before electronics (arbitrary units): \" << fNoise << endl;\n   cout << \"Baseline (ADC units): \" << fBaseline << endl;\n   cout << \"Noise after electronics (ADC units): \" << fNoiseAfterEl << endl;\n\n   cout << \"Dynamic Range: \" << fDynamicRange << endl;\n   cout << \"Charge Loss: \" << fChargeLoss << endl;\n   cout << \"Temperature: \" << fTemperature << endl;\n   cout << \"Drift Speed: \" << fDriftSpeed << endl;\n   cout << \"Electronics (1=PASCAL, 2=OLA): \" << fElectronics << endl;\n\n   cout << \"N. of Sigma for signal integration: \" << fNsigmas << endl;\n   cout << \"N. of bins in lookup table: \" << fNcomps << endl;\n\n   cout << \"Max. ADC Value: \" << fMaxAdc << endl;\n   cout << \"Min. Value: \" << fMinVal << endl;\n\n   cout << \"**************************************************\" << endl;\n  \n\n\n}\n\n\n\n<commit_msg>Set the default for the compression parameters<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#include <TString.h>\n\n#include \"AliITSresponseSDD.h\"\n\n\n\/\/___________________________________________\nClassImp(AliITSresponseSDD)\t\n\nAliITSresponseSDD::AliITSresponseSDD()\n{\n  \/\/ constructor\n   SetMaxAdc();\n   SetDiffCoeff();\n   SetDriftSpeed();\n   SetNSigmaIntegration();\n   SetNLookUp();\n   \/\/ SetClock();\n   SetNoiseParam();\n   SetNoiseAfterElectronics();\n   SetElectronics();\n   SetDynamicRange();\n   SetChargeLoss();\n   SetMinVal();\n   SetParamOptions();\n   SetZeroSupp();\n   SetDataType();\n   SetFilenames();\n   SetOutputOption();\n   SetDo10to8();\n   \/\/ set the default zero suppression parameters\n   fCPar[0]=0;\n   fCPar[1]=0;\n   fCPar[2]=(Int_t)(fBaseline + 2.*fNoiseAfterEl);\n   fCPar[3]=(Int_t)(fBaseline + 2.*fNoiseAfterEl);\n   fCPar[4]=0;\n   fCPar[5]=0;\n   fCPar[6]=0;\n   fCPar[7]=0;\n}\n\nAliITSresponseSDD::~AliITSresponseSDD() { \n\n  if(fGaus) delete fGaus;\n\n}\n\nvoid AliITSresponseSDD::SetCompressParam(Int_t  cp[8])\n{\n  \/\/ set compression param\n\n    Int_t i;\n    for (i=0; i<8; i++) {\n\tfCPar[i]=cp[i];\n\t\/\/printf(\"\\n CompressPar %d %d \\n\",i,fCPar[i]);\n\t\n    }\n}\nvoid AliITSresponseSDD::GiveCompressParam(Int_t  cp[8])\n{\n  \/\/ give compression param\n\n    Int_t i;\n    for (i=0; i<8; i++) {\n\tcp[i]=fCPar[i];\n    }\n}\n\nvoid AliITSresponseSDD::Print()\n{\n  \/\/ Print SDD response Parameters\n\n   cout << \"**************************************************\" << endl;\n   cout << \"   Silicon Drift Detector Response Parameters    \" << endl;\n   cout << \"**************************************************\" << endl;\n   cout << \"Diffusion Coefficients: \" << fDiffCoeff << \", \" << fDiffCoeff1 << endl;\n\n   cout << \"Hardware compression parameters: \" << endl; \n   for(Int_t i=0; i<8; i++) cout << \"fCPar[\" << i << \"] = \" << fCPar[i] << endl;\n   cout << \"Noise before electronics (arbitrary units): \" << fNoise << endl;\n   cout << \"Baseline (ADC units): \" << fBaseline << endl;\n   cout << \"Noise after electronics (ADC units): \" << fNoiseAfterEl << endl;\n\n   cout << \"Dynamic Range: \" << fDynamicRange << endl;\n   cout << \"Charge Loss: \" << fChargeLoss << endl;\n   cout << \"Temperature: \" << fTemperature << endl;\n   cout << \"Drift Speed: \" << fDriftSpeed << endl;\n   cout << \"Electronics (1=PASCAL, 2=OLA): \" << fElectronics << endl;\n\n   cout << \"N. of Sigma for signal integration: \" << fNsigmas << endl;\n   cout << \"N. of bins in lookup table: \" << fNcomps << endl;\n\n   cout << \"Max. ADC Value: \" << fMaxAdc << endl;\n   cout << \"Min. Value: \" << fMinVal << endl;\n\n   cout << \"**************************************************\" << endl;\n  \n\n\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Initialise more fields, especially mfFakeDPIScale<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/  http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 __STOUT_OS_WINDOWS_REALPATH_HPP__\n#define __STOUT_OS_WINDOWS_REALPATH_HPP__\n\n\n#include <stout\/error.hpp>\n#include <stout\/result.hpp>\n#include <stout\/stringify.hpp>\n#include <stout\/strings.hpp>\n\n#include <stout\/internal\/windows\/longpath.hpp>\n\n\nnamespace os {\n\ninline Result<std::string> realpath(const std::string& path)\n{\n  \/\/ TODO(andschwa): Test the existence of `path` to be consistent with POSIX\n  \/\/ `::realpath`.\n\n  std::wstring longpath = ::internal::windows::longpath(path);\n\n  \/\/ First query for the buffer size required.\n  DWORD length = GetFullPathNameW(longpath.data(), 0, nullptr, nullptr);\n  if (length == 0) {\n    return WindowsError(\"Failed to retrieve realpath buffer size\");\n  }\n\n  std::vector<wchar_t> buffer;\n  buffer.reserve(static_cast<size_t>(length));\n\n  DWORD result =\n    GetFullPathNameW(longpath.data(), length, buffer.data(), nullptr);\n\n  if (result == 0) {\n    return WindowsError(\"Failed to determine realpath\");\n  }\n\n  return strings::remove(\n      stringify(std::wstring(buffer.data())),\n      os::LONGPATH_PREFIX,\n      strings::Mode::PREFIX);\n}\n\n} \/\/ namespace os {\n\n#endif \/\/ __STOUT_OS_WINDOWS_REALPATH_HPP__\n<commit_msg>Windows: Fixed `os::realpath` to behave like POSIX version.<commit_after>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/  http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 __STOUT_OS_WINDOWS_REALPATH_HPP__\n#define __STOUT_OS_WINDOWS_REALPATH_HPP__\n\n\n#include <stout\/error.hpp>\n#include <stout\/result.hpp>\n#include <stout\/stringify.hpp>\n#include <stout\/strings.hpp>\n#include <stout\/windows.hpp>\n\n#include <stout\/internal\/windows\/longpath.hpp>\n#include <stout\/internal\/windows\/reparsepoint.hpp>\n\n\nnamespace os {\n\n\/\/ This should behave like the POSIX `realpath` API: specifically it should\n\/\/ resolve symlinks in the path, and succeed only if the target file exists.\n\/\/ This requires that the user has permissions to resolve each component of the\n\/\/ path.\ninline Result<std::string> realpath(const std::string& path)\n{\n  const Try<SharedHandle> handle = ::internal::windows::get_handle_follow(path);\n  if (handle.isError()) {\n    return Error(handle.error());\n  }\n\n  \/\/ First query for the buffer size required.\n  DWORD length = ::GetFinalPathNameByHandleW(\n      handle.get().get_handle(), nullptr, 0, FILE_NAME_NORMALIZED);\n  if (length == 0) {\n    return WindowsError(\"Failed to retrieve realpath buffer size\");\n  }\n\n  std::vector<wchar_t> buffer;\n  buffer.reserve(static_cast<size_t>(length));\n\n  DWORD result = ::GetFinalPathNameByHandleW(\n      handle.get().get_handle(), buffer.data(), length, FILE_NAME_NORMALIZED);\n\n  if (result == 0) {\n    return WindowsError(\"Failed to determine realpath\");\n  }\n\n  return strings::remove(\n      stringify(std::wstring(buffer.data())),\n      os::LONGPATH_PREFIX,\n      strings::Mode::PREFIX);\n}\n\n} \/\/ namespace os {\n\n#endif \/\/ __STOUT_OS_WINDOWS_REALPATH_HPP__\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\nThis file is part of HadesMem.\r\nCopyright (C) 2011 Joshua Boyce (a.k.a. RaptorFactor).\r\n<http:\/\/www.raptorfactor.com\/> <raptorfactor@raptorfactor.com>\r\n\r\nHadesMem is free software: you can redistribute it and\/or modify\r\nit under the terms of the GNU General Public License as published by\r\nthe Free Software Foundation, either version 3 of the License, or\r\n(at your option) any later version.\r\n\r\nHadesMem 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.  See the\r\nGNU General Public License for more details.\r\n\r\nYou should have received a copy of the GNU General Public License\r\nalong with HadesMem.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n*\/\r\n\r\n#pragma once\r\n\r\n\/\/ Hades\r\n#include <HadesMemory\/Detail\/Error.hpp>\r\n#include <HadesMemory\/Detail\/Process.hpp>\r\n\r\n\/\/ C++ Standard Library\r\n#include <memory>\r\n#include <string>\r\n#include <vector>\r\n#include <utility>\r\n#include <type_traits>\r\n\r\n\/\/ Windows API\r\n#include <Windows.h>\r\n\r\nnamespace HadesMem\r\n{\r\n  \/\/ Memory managing class\r\n  class MemoryMgr\r\n  {\r\n  public:\r\n    \/\/ Memory exception type\r\n    class Error : public virtual HadesMemError \r\n    { };\r\n\r\n    \/\/ Open process from process ID\r\n    explicit MemoryMgr(DWORD ProcID);\r\n\r\n    \/\/ MemoryMgr::Call return data\r\n    class RemoteFunctionRet\r\n    {\r\n    public:\r\n      RemoteFunctionRet();\r\n      \r\n      RemoteFunctionRet(DWORD_PTR ReturnValue, DWORD64 ReturnValue64, \r\n        DWORD LastError);\r\n      \r\n      DWORD_PTR GetReturnValue() const;\r\n      \r\n      DWORD64 GetReturnValue64() const;\r\n      \r\n      DWORD GetLastError() const;\r\n      \r\n    private:\r\n      DWORD_PTR m_ReturnValue;\r\n      DWORD64 m_ReturnValue64;\r\n      DWORD m_LastError;\r\n    };\r\n  \r\n    \/\/ Calling conventions\r\n    enum CallConv\r\n    {\r\n      CallConv_Default, \r\n      CallConv_CDECL, \r\n      CallConv_STDCALL, \r\n      CallConv_THISCALL, \r\n      CallConv_FASTCALL, \r\n      CallConv_X64\r\n    };\r\n\r\n    \/\/ Call remote function\r\n    RemoteFunctionRet Call(LPCVOID Address, CallConv MyCallConv, \r\n      std::vector<PVOID> const& Args) const;\r\n\r\n    \/\/ Read memory (POD types)\r\n    template <typename T>\r\n    T Read(PVOID Address, typename std::enable_if<std::is_pod<T>::value, \r\n      T>::type* Dummy = 0) const;\r\n\r\n    \/\/ Read memory (string types)\r\n    template <typename T>\r\n    T ReadString(PVOID Address, typename std::enable_if<std::is_same<T, std::\r\n      basic_string<typename T::value_type>>::value, T>::type* Dummy = 0) \r\n      const;\r\n\r\n    \/\/ Read memory (vector types)\r\n    template <typename T>\r\n    T ReadList(PVOID Address, std::size_t Size, typename std::enable_if<std::\r\n      is_same<T, std::vector<typename T::value_type>>::value, T>::type* \r\n      Dummy = 0) const;\r\n      \r\n    \/\/ Write memory (POD types)\r\n    template <typename T>\r\n    void Write(PVOID Address, T const& Data, typename std::enable_if<std::\r\n      is_pod<T>::value, T>::type* Dummy = 0) const;\r\n\r\n    \/\/ Write memory (string types)\r\n    template <typename T>\r\n    void WriteString(PVOID Address, T const& Data, typename std::enable_if<\r\n      std::is_same<T, std::basic_string<typename T::value_type>>::value, T>::\r\n      type* Dummy = 0) const;\r\n\r\n    \/\/ Write memory (vector types)\r\n    template <typename T>\r\n    void WriteList(PVOID Address, T const& Data, typename std::enable_if<std::\r\n      is_same<T, std::vector<typename T::value_type>>::value, T>::type* \r\n      Dummy = 0) const;\r\n\r\n    \/\/ Whether an address is currently readable\r\n    bool CanRead(LPCVOID Address) const;\r\n\r\n    \/\/ Whether an address is currently writable\r\n    bool CanWrite(LPCVOID Address) const;\r\n\r\n    \/\/ Whether an address is currently executable\r\n    bool CanExecute(LPCVOID Address) const;\r\n\r\n    \/\/ Whether an address is contained within a guard page\r\n    bool IsGuard(LPCVOID Address) const;\r\n    \r\n    \/\/ Protect a memory region\r\n    DWORD ProtectRegion(LPVOID Address, DWORD Protect) const;\r\n\r\n    \/\/ Allocate memory\r\n    PVOID Alloc(SIZE_T Size) const;\r\n\r\n    \/\/ Free memory\r\n    void Free(PVOID Address) const;\r\n\r\n    \/\/ Get address of export in remote process (by name)\r\n    FARPROC GetRemoteProcAddress(HMODULE RemoteMod, \r\n      std::wstring const& Module, std::string const& Function) const;\r\n\r\n    \/\/ Get address of export in remote process (by ordinal)\r\n    FARPROC GetRemoteProcAddress(HMODULE RemoteMod, \r\n      std::wstring const& Module, WORD Function) const;\r\n\r\n    \/\/ Flush instruction cache\r\n    void FlushCache(LPCVOID Address, SIZE_T Size) const;\r\n\r\n    \/\/ Get process handle of target\r\n    HANDLE GetProcessHandle() const;\r\n\r\n    \/\/ Get process ID of target\r\n    DWORD GetProcessId() const;\r\n    \r\n    \/\/ Get process path\r\n    std::wstring GetProcessPath() const;\r\n    \r\n    \/\/ Is WoW64 process\r\n    bool IsWoW64Process() const;\r\n\r\n  private:\r\n    \/\/ Read memory\r\n    void ReadImpl(PVOID Address, PVOID Out, std::size_t OutSize) const;\r\n      \r\n    \/\/ Write memory\r\n    void WriteImpl(PVOID Address, LPCVOID In, std::size_t InSize) const;\r\n    \r\n    \/\/ Target process\r\n    Detail::Process m_Process;\r\n  };\r\n\r\n  \/\/ RAII class for remote memory allocation and freeing\r\n  class AllocAndFree\r\n  {\r\n  public:\r\n    AllocAndFree(MemoryMgr const& MyMemoryMgr, SIZE_T Size);\r\n\r\n    ~AllocAndFree();\r\n    \r\n    void Free() const;\r\n\r\n    PVOID GetBase() const;\r\n    \r\n    SIZE_T GetSize() const;\r\n\r\n  protected:\r\n    AllocAndFree(AllocAndFree const&);\r\n    AllocAndFree& operator=(AllocAndFree const&);\r\n    \r\n  private:\r\n    MemoryMgr m_Memory;\r\n    SIZE_T m_Size;\r\n    mutable PVOID m_Address;\r\n  };\r\n\r\n  \/\/ Read memory (POD types)\r\n  template <typename T>\r\n  T MemoryMgr::Read(PVOID Address, typename std::enable_if<std::is_pod<T>::\r\n    value, T>::type* \/*Dummy*\/) const\r\n  {\r\n    \/\/ Read data\r\n    T Data;\r\n    ReadImpl(Address, &Data, sizeof(Data));\r\n    return Data;\r\n  }\r\n\r\n  \/\/ Read memory (string types)\r\n  template <typename T>\r\n  T MemoryMgr::ReadString(PVOID Address, typename std::enable_if<std::is_same<\r\n    T, std::basic_string<typename T::value_type>>::value, T>::type* \/*Dummy*\/) \r\n    const\r\n  {\r\n    \/\/ Character type\r\n    typedef typename T::value_type CharT;\r\n\r\n    \/\/ Ensure chracter type is POD\r\n    static_assert(std::is_pod<CharT>::value, \"Character type of string must \"\r\n      \"be POD.\");\r\n    \r\n    \/\/ Create buffer to store results\r\n    T Buffer;\r\n\r\n    \/\/ Loop until a null terminator is found\r\n    for (CharT* AddressReal = static_cast<CharT*>(Address);; ++AddressReal)\r\n    {\r\n      \/\/ Read current character\r\n      CharT const Current = this->Read<CharT>(AddressReal);\r\n\r\n      \/\/ Return generated string on null terminator\r\n      if (Current == CharT())\r\n      {\r\n        return Buffer;\r\n      }\r\n\r\n      \/\/ Add chaaracter to buffer\r\n      Buffer += Current;\r\n    }\r\n  }\r\n\r\n  \/\/ Read memory (vector types)\r\n  template <typename T>\r\n  T MemoryMgr::ReadList(PVOID Address, std::size_t Size, typename \r\n    std::enable_if<std::is_same<T, std::vector<typename T::value_type>>::\r\n    value, T>::type* \/*Dummy*\/) const\r\n  {\r\n    \/\/ Value type\r\n    typedef typename T::value_type ValT;\r\n    \r\n    \/\/ Ensure value type is POD\r\n    static_assert(std::is_pod<ValT>::value, \"Value type of vector must be \"\r\n      \"POD.\");\r\n    \r\n    \/\/ Read data\r\n    T Data(Size);\r\n    this->ReadImpl(Address, Data.data(), sizeof(ValT) * Size);\r\n    return Data;\r\n  }\r\n\r\n  \/\/ Write memory (POD types)\r\n  template <typename T>\r\n  void MemoryMgr::Write(PVOID Address, T const& Data, typename std::\r\n    enable_if<std::is_pod<T>::value, T>::type* \/*Dummy*\/) const \r\n  {\r\n    \/\/ Write memory\r\n    WriteImpl(Address, &Data, sizeof(Data));\r\n  }\r\n\r\n  \/\/ Write memory (string types)\r\n  template <typename T>\r\n  void MemoryMgr::WriteString(PVOID Address, T const& Data, \r\n    typename std::enable_if<std::is_same<T, std::basic_string<typename T::\r\n    value_type>>::value, T>::type* \/*Dummy*\/) const\r\n  {\r\n    \/\/ Character type\r\n    typedef typename T::value_type CharT;\r\n\r\n    \/\/ Ensure chracter type is POD\r\n    static_assert(std::is_pod<CharT>::value, \"Character type of string must \"\r\n      \"be POD.\");\r\n    \r\n    \/\/ Write memory\r\n    std::size_t const RawSize = (Data.size() * sizeof(CharT)) + 1;\r\n    WriteImpl(Address, Data.data(), RawSize);\r\n  }\r\n\r\n  \/\/ Write memory (vector types)\r\n  template <typename T>\r\n  void MemoryMgr::WriteList(PVOID Address, T const& Data, typename std::\r\n    enable_if<std::is_same<T, std::vector<typename T::value_type>>::value, \r\n    T>::type* \/*Dummy*\/) const\r\n  {\r\n    \/\/ Value type\r\n    typedef typename T::value_type ValT;\r\n    \r\n    \/\/ Ensure value type is POD\r\n    static_assert(std::is_pod<ValT>::value, \"Value type of vector must be \"\r\n      \"POD.\");\r\n    \r\n    \/\/ Write memory\r\n    std::size_t const RawSize = Data.size() * sizeof(ValT);\r\n    WriteImpl(Address, Data.data(), RawSize);\r\n  }\r\n}\r\n<commit_msg>* [MemoryMgr] Simplify ReadString implementation.<commit_after>\/*\r\nThis file is part of HadesMem.\r\nCopyright (C) 2011 Joshua Boyce (a.k.a. RaptorFactor).\r\n<http:\/\/www.raptorfactor.com\/> <raptorfactor@raptorfactor.com>\r\n\r\nHadesMem is free software: you can redistribute it and\/or modify\r\nit under the terms of the GNU General Public License as published by\r\nthe Free Software Foundation, either version 3 of the License, or\r\n(at your option) any later version.\r\n\r\nHadesMem 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.  See the\r\nGNU General Public License for more details.\r\n\r\nYou should have received a copy of the GNU General Public License\r\nalong with HadesMem.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n*\/\r\n\r\n#pragma once\r\n\r\n\/\/ Hades\r\n#include <HadesMemory\/Detail\/Error.hpp>\r\n#include <HadesMemory\/Detail\/Process.hpp>\r\n\r\n\/\/ C++ Standard Library\r\n#include <memory>\r\n#include <string>\r\n#include <vector>\r\n#include <utility>\r\n#include <type_traits>\r\n\r\n\/\/ Windows API\r\n#include <Windows.h>\r\n\r\nnamespace HadesMem\r\n{\r\n  \/\/ Memory managing class\r\n  class MemoryMgr\r\n  {\r\n  public:\r\n    \/\/ Memory exception type\r\n    class Error : public virtual HadesMemError \r\n    { };\r\n\r\n    \/\/ Open process from process ID\r\n    explicit MemoryMgr(DWORD ProcID);\r\n\r\n    \/\/ MemoryMgr::Call return data\r\n    class RemoteFunctionRet\r\n    {\r\n    public:\r\n      RemoteFunctionRet();\r\n      \r\n      RemoteFunctionRet(DWORD_PTR ReturnValue, DWORD64 ReturnValue64, \r\n        DWORD LastError);\r\n      \r\n      DWORD_PTR GetReturnValue() const;\r\n      \r\n      DWORD64 GetReturnValue64() const;\r\n      \r\n      DWORD GetLastError() const;\r\n      \r\n    private:\r\n      DWORD_PTR m_ReturnValue;\r\n      DWORD64 m_ReturnValue64;\r\n      DWORD m_LastError;\r\n    };\r\n  \r\n    \/\/ Calling conventions\r\n    enum CallConv\r\n    {\r\n      CallConv_Default, \r\n      CallConv_CDECL, \r\n      CallConv_STDCALL, \r\n      CallConv_THISCALL, \r\n      CallConv_FASTCALL, \r\n      CallConv_X64\r\n    };\r\n\r\n    \/\/ Call remote function\r\n    RemoteFunctionRet Call(LPCVOID Address, CallConv MyCallConv, \r\n      std::vector<PVOID> const& Args) const;\r\n\r\n    \/\/ Read memory (POD types)\r\n    template <typename T>\r\n    T Read(PVOID Address, typename std::enable_if<std::is_pod<T>::value, \r\n      T>::type* Dummy = 0) const;\r\n\r\n    \/\/ Read memory (string types)\r\n    template <typename T>\r\n    T ReadString(PVOID Address, typename std::enable_if<std::is_same<T, std::\r\n      basic_string<typename T::value_type>>::value, T>::type* Dummy = 0) \r\n      const;\r\n\r\n    \/\/ Read memory (vector types)\r\n    template <typename T>\r\n    T ReadList(PVOID Address, std::size_t Size, typename std::enable_if<std::\r\n      is_same<T, std::vector<typename T::value_type>>::value, T>::type* \r\n      Dummy = 0) const;\r\n      \r\n    \/\/ Write memory (POD types)\r\n    template <typename T>\r\n    void Write(PVOID Address, T const& Data, typename std::enable_if<std::\r\n      is_pod<T>::value, T>::type* Dummy = 0) const;\r\n\r\n    \/\/ Write memory (string types)\r\n    template <typename T>\r\n    void WriteString(PVOID Address, T const& Data, typename std::enable_if<\r\n      std::is_same<T, std::basic_string<typename T::value_type>>::value, T>::\r\n      type* Dummy = 0) const;\r\n\r\n    \/\/ Write memory (vector types)\r\n    template <typename T>\r\n    void WriteList(PVOID Address, T const& Data, typename std::enable_if<std::\r\n      is_same<T, std::vector<typename T::value_type>>::value, T>::type* \r\n      Dummy = 0) const;\r\n\r\n    \/\/ Whether an address is currently readable\r\n    bool CanRead(LPCVOID Address) const;\r\n\r\n    \/\/ Whether an address is currently writable\r\n    bool CanWrite(LPCVOID Address) const;\r\n\r\n    \/\/ Whether an address is currently executable\r\n    bool CanExecute(LPCVOID Address) const;\r\n\r\n    \/\/ Whether an address is contained within a guard page\r\n    bool IsGuard(LPCVOID Address) const;\r\n    \r\n    \/\/ Protect a memory region\r\n    DWORD ProtectRegion(LPVOID Address, DWORD Protect) const;\r\n\r\n    \/\/ Allocate memory\r\n    PVOID Alloc(SIZE_T Size) const;\r\n\r\n    \/\/ Free memory\r\n    void Free(PVOID Address) const;\r\n\r\n    \/\/ Get address of export in remote process (by name)\r\n    FARPROC GetRemoteProcAddress(HMODULE RemoteMod, \r\n      std::wstring const& Module, std::string const& Function) const;\r\n\r\n    \/\/ Get address of export in remote process (by ordinal)\r\n    FARPROC GetRemoteProcAddress(HMODULE RemoteMod, \r\n      std::wstring const& Module, WORD Function) const;\r\n\r\n    \/\/ Flush instruction cache\r\n    void FlushCache(LPCVOID Address, SIZE_T Size) const;\r\n\r\n    \/\/ Get process handle of target\r\n    HANDLE GetProcessHandle() const;\r\n\r\n    \/\/ Get process ID of target\r\n    DWORD GetProcessId() const;\r\n    \r\n    \/\/ Get process path\r\n    std::wstring GetProcessPath() const;\r\n    \r\n    \/\/ Is WoW64 process\r\n    bool IsWoW64Process() const;\r\n\r\n  private:\r\n    \/\/ Read memory\r\n    void ReadImpl(PVOID Address, PVOID Out, std::size_t OutSize) const;\r\n      \r\n    \/\/ Write memory\r\n    void WriteImpl(PVOID Address, LPCVOID In, std::size_t InSize) const;\r\n    \r\n    \/\/ Target process\r\n    Detail::Process m_Process;\r\n  };\r\n\r\n  \/\/ RAII class for remote memory allocation and freeing\r\n  class AllocAndFree\r\n  {\r\n  public:\r\n    AllocAndFree(MemoryMgr const& MyMemoryMgr, SIZE_T Size);\r\n\r\n    ~AllocAndFree();\r\n    \r\n    void Free() const;\r\n\r\n    PVOID GetBase() const;\r\n    \r\n    SIZE_T GetSize() const;\r\n\r\n  protected:\r\n    AllocAndFree(AllocAndFree const&);\r\n    AllocAndFree& operator=(AllocAndFree const&);\r\n    \r\n  private:\r\n    MemoryMgr m_Memory;\r\n    SIZE_T m_Size;\r\n    mutable PVOID m_Address;\r\n  };\r\n\r\n  \/\/ Read memory (POD types)\r\n  template <typename T>\r\n  T MemoryMgr::Read(PVOID Address, typename std::enable_if<std::is_pod<T>::\r\n    value, T>::type* \/*Dummy*\/) const\r\n  {\r\n    \/\/ Read data\r\n    T Data;\r\n    ReadImpl(Address, &Data, sizeof(Data));\r\n    return Data;\r\n  }\r\n\r\n  \/\/ Read memory (string types)\r\n  template <typename T>\r\n  T MemoryMgr::ReadString(PVOID Address, typename std::enable_if<std::is_same<\r\n    T, std::basic_string<typename T::value_type>>::value, T>::type* \/*Dummy*\/) \r\n    const\r\n  {\r\n    \/\/ Character type\r\n    typedef typename T::value_type CharT;\r\n\r\n    \/\/ Ensure chracter type is POD\r\n    static_assert(std::is_pod<CharT>::value, \"Character type of string must \"\r\n      \"be POD.\");\r\n    \r\n    \/\/ Create buffer to store results\r\n    T Buffer;\r\n\r\n    \/\/ Read until a null terminator is found\r\n    CharT* AddressReal = static_cast<CharT*>(Address);\r\n    for (CharT Current = this->Read<CharT>(AddressReal); Current != CharT(); \r\n      ++AddressReal, Current = this->Read<CharT>(AddressReal))\r\n    {\r\n      Buffer.push_back(Current);\r\n    }\r\n    \r\n    \/\/ Return buffer\r\n    return Buffer;\r\n  }\r\n\r\n  \/\/ Read memory (vector types)\r\n  template <typename T>\r\n  T MemoryMgr::ReadList(PVOID Address, std::size_t Size, typename \r\n    std::enable_if<std::is_same<T, std::vector<typename T::value_type>>::\r\n    value, T>::type* \/*Dummy*\/) const\r\n  {\r\n    \/\/ Value type\r\n    typedef typename T::value_type ValT;\r\n    \r\n    \/\/ Ensure value type is POD\r\n    static_assert(std::is_pod<ValT>::value, \"Value type of vector must be \"\r\n      \"POD.\");\r\n    \r\n    \/\/ Read data\r\n    T Data(Size);\r\n    this->ReadImpl(Address, Data.data(), sizeof(ValT) * Size);\r\n    return Data;\r\n  }\r\n\r\n  \/\/ Write memory (POD types)\r\n  template <typename T>\r\n  void MemoryMgr::Write(PVOID Address, T const& Data, typename std::\r\n    enable_if<std::is_pod<T>::value, T>::type* \/*Dummy*\/) const \r\n  {\r\n    \/\/ Write memory\r\n    WriteImpl(Address, &Data, sizeof(Data));\r\n  }\r\n\r\n  \/\/ Write memory (string types)\r\n  template <typename T>\r\n  void MemoryMgr::WriteString(PVOID Address, T const& Data, \r\n    typename std::enable_if<std::is_same<T, std::basic_string<typename T::\r\n    value_type>>::value, T>::type* \/*Dummy*\/) const\r\n  {\r\n    \/\/ Character type\r\n    typedef typename T::value_type CharT;\r\n\r\n    \/\/ Ensure chracter type is POD\r\n    static_assert(std::is_pod<CharT>::value, \"Character type of string must \"\r\n      \"be POD.\");\r\n    \r\n    \/\/ Write memory\r\n    std::size_t const RawSize = (Data.size() * sizeof(CharT)) + 1;\r\n    WriteImpl(Address, Data.data(), RawSize);\r\n  }\r\n\r\n  \/\/ Write memory (vector types)\r\n  template <typename T>\r\n  void MemoryMgr::WriteList(PVOID Address, T const& Data, typename std::\r\n    enable_if<std::is_same<T, std::vector<typename T::value_type>>::value, \r\n    T>::type* \/*Dummy*\/) const\r\n  {\r\n    \/\/ Value type\r\n    typedef typename T::value_type ValT;\r\n    \r\n    \/\/ Ensure value type is POD\r\n    static_assert(std::is_pod<ValT>::value, \"Value type of vector must be \"\r\n      \"POD.\");\r\n    \r\n    \/\/ Write memory\r\n    std::size_t const RawSize = Data.size() * sizeof(ValT);\r\n    WriteImpl(Address, Data.data(), RawSize);\r\n  }\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#ifndef VEXCL_SPARSE_PRODUCT_HPP\n#define VEXCL_SPARSE_PRODUCT_HPP\n\nnamespace vex {\nnamespace sparse {\n\nstruct matrix_vector_product_terminal {};\n\ntypedef vector_expression<\n        typename boost::proto::terminal< matrix_vector_product_terminal >::type\n        > matrix_vector_product_expression;\n\ntemplate <class Matrix, class Vector>\nstruct matrix_vector_product : matrix_vector_product_expression\n{\n    const Matrix &A;\n    typename boost::proto::result_of::as_child<const Vector, vector_domain>::type x;\n\n    matrix_vector_product(const Matrix &A, const Vector &x)\n        : A(A), x(boost::proto::as_child(x)) {}\n};\n\n} \/\/ namespace sparse\n\nnamespace traits {\n\ntemplate <> struct is_vector_expr_terminal< sparse::matrix_vector_product_terminal >\n    : std::true_type {};\n\ntemplate <class Matrix, class Vector>\nstruct terminal_is_value< sparse::matrix_vector_product<Matrix, Vector> >\n    : std::true_type {};\n\ntemplate <class Matrix, class Vector>\nstruct terminal_preamble< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(backend::source_generator &src,\n            const sparse::matrix_vector_product<Matrix, Vector> &term,\n            const backend::command_queue &q, const std::string &prm_name,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.terminal_preamble(term.x, src, q, prm_name, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct local_terminal_init< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(backend::source_generator &src,\n            const sparse::matrix_vector_product<Matrix, Vector> &term,\n            const backend::command_queue &q, const std::string &prm_name,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.local_terminal_init(term.x, src, q, prm_name, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct kernel_param_declaration< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(backend::source_generator &src,\n            const sparse::matrix_vector_product<Matrix, Vector> &term,\n            const backend::command_queue &q, const std::string &prm_name,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.kernel_param_declaration(term.x, src, q, prm_name, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct partial_vector_expr< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(backend::source_generator &src,\n            const sparse::matrix_vector_product<Matrix, Vector> &term,\n            const backend::command_queue &q, const std::string &prm_name,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.partial_vector_expr(term.x, src, q, prm_name, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct kernel_arg_setter< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void set(const sparse::matrix_vector_product<Matrix, Vector> &term,\n            backend::kernel &kernel, unsigned part, size_t index_offset,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.kernel_arg_setter(term.x, kernel, part, index_offset, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct expression_properties< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(const sparse::matrix_vector_product<Matrix, Vector> &term,\n            std::vector<backend::command_queue> &queue_list,\n            std::vector<size_t> &partition,\n            size_t &size\n            )\n    {\n        term.A.expression_properties(term.x, queue_list, partition, size);\n    }\n};\n\n} \/\/ namespace traits\n\n} \/\/ namespace vex\n\n#endif\n<commit_msg>Missing preamble<commit_after>#ifndef VEXCL_SPARSE_PRODUCT_HPP\n#define VEXCL_SPARSE_PRODUCT_HPP\n\n\/*\nThe MIT License\n\nCopyright (c) 2012-2018 Denis Demidov <dennis.demidov@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\/**\n * \\file   vexcl\/sparse\/product.hpp\n * \\author Denis Demidov <dennis.demidov@gmail.com>\n * \\brief  Sparse matrix-vector product terminal.\n *\/\n\n#include <vexcl\/operations.hpp>\n\nnamespace vex {\nnamespace sparse {\n\nstruct matrix_vector_product_terminal {};\n\ntypedef vector_expression<\n        typename boost::proto::terminal< matrix_vector_product_terminal >::type\n        > matrix_vector_product_expression;\n\ntemplate <class Matrix, class Vector>\nstruct matrix_vector_product : matrix_vector_product_expression\n{\n    const Matrix &A;\n    typename boost::proto::result_of::as_child<const Vector, vector_domain>::type x;\n\n    matrix_vector_product(const Matrix &A, const Vector &x)\n        : A(A), x(boost::proto::as_child(x)) {}\n};\n\n} \/\/ namespace sparse\n\nnamespace traits {\n\ntemplate <> struct is_vector_expr_terminal< sparse::matrix_vector_product_terminal >\n    : std::true_type {};\n\ntemplate <class Matrix, class Vector>\nstruct terminal_is_value< sparse::matrix_vector_product<Matrix, Vector> >\n    : std::true_type {};\n\ntemplate <class Matrix, class Vector>\nstruct terminal_preamble< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(backend::source_generator &src,\n            const sparse::matrix_vector_product<Matrix, Vector> &term,\n            const backend::command_queue &q, const std::string &prm_name,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.terminal_preamble(term.x, src, q, prm_name, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct local_terminal_init< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(backend::source_generator &src,\n            const sparse::matrix_vector_product<Matrix, Vector> &term,\n            const backend::command_queue &q, const std::string &prm_name,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.local_terminal_init(term.x, src, q, prm_name, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct kernel_param_declaration< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(backend::source_generator &src,\n            const sparse::matrix_vector_product<Matrix, Vector> &term,\n            const backend::command_queue &q, const std::string &prm_name,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.kernel_param_declaration(term.x, src, q, prm_name, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct partial_vector_expr< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(backend::source_generator &src,\n            const sparse::matrix_vector_product<Matrix, Vector> &term,\n            const backend::command_queue &q, const std::string &prm_name,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.partial_vector_expr(term.x, src, q, prm_name, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct kernel_arg_setter< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void set(const sparse::matrix_vector_product<Matrix, Vector> &term,\n            backend::kernel &kernel, unsigned part, size_t index_offset,\n            detail::kernel_generator_state_ptr state)\n    {\n        term.A.kernel_arg_setter(term.x, kernel, part, index_offset, state);\n    }\n};\n\ntemplate <class Matrix, class Vector>\nstruct expression_properties< sparse::matrix_vector_product<Matrix, Vector> > {\n    static void get(const sparse::matrix_vector_product<Matrix, Vector> &term,\n            std::vector<backend::command_queue> &queue_list,\n            std::vector<size_t> &partition,\n            size_t &size\n            )\n    {\n        term.A.expression_properties(term.x, queue_list, partition, size);\n    }\n};\n\n} \/\/ namespace traits\n\n} \/\/ namespace vex\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2019 The Bazel 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 \"tools\/common\/file_system.h\"\n\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include <string>\n\n#ifdef __APPLE__\n#include <copyfile.h>\n#include <removefile.h>\n#else\n#include <fcntl.h>\n#include <sys\/sendfile.h>\n#endif\n\n#include \"tools\/common\/path_utils.h\"\n\nstd::string GetCurrentDirectory() {\n  \/\/ Passing null,0 causes getcwd to allocate the buffer of the correct size.\n  char *buffer = getcwd(nullptr, 0);\n  std::string cwd(buffer);\n  free(buffer);\n  return cwd;\n}\n\nbool FileExists(const std::string &path) {\n  return access(path.c_str(), 0) == 0;\n}\n\nbool RemoveFile(const std::string &path) {\n#ifdef __APPLE__\n  return removefile(path.c_str(), nullptr, 0);\n#elif __unix__\n  return remove(path.c_str());\n#else\n#error Only macOS and Unix are supported at this time.\n#endif\n}\n\nbool CopyFile(const std::string &src, const std::string &dest) {\n#ifdef __APPLE__\n  \/\/ The `copyfile` function with `COPYFILE_ALL` mode preserves permissions and\n  \/\/ modification time.\n  return copyfile(src.c_str(), dest.c_str(), nullptr,\n                  COPYFILE_ALL | COPYFILE_CLONE) == 0;\n#elif __unix__\n  \/\/ On Linux, we can use `sendfile` to copy it more easily than calling\n  \/\/ `read`\/`write` in a loop.\n  struct stat stat_buf;\n  bool success = false;\n\n  int src_fd = open(src.c_str(), O_RDONLY);\n  if (src_fd) {\n    fstat(src_fd, &stat_buf);\n\n    int dest_fd = open(dest.c_str(), O_WRONLY | O_CREAT, stat_buf.st_mode);\n    if (dest_fd) {\n      off_t offset = 0;\n      if (sendfile(dest_fd, src_fd, &offset, stat_buf.st_size) != -1) {\n        struct timespec timespecs[2] = {stat_buf.st_atim, stat_buf.st_mtim};\n        futimens(dest_fd, timespecs);\n        success = true;\n      }\n      close(dest_fd);\n    }\n    close(src_fd);\n  }\n  return success;\n#else\n\/\/ TODO(allevato): If we want to support Windows in the future, we'll need to\n\/\/ use something like `CopyFileA`.\n#error Only macOS and Unix are supported at this time.\n#endif\n}\n\nbool MakeDirs(const std::string &path, int mode) {\n  \/\/ If we got an empty string, we've recursed past the first segment in the\n  \/\/ path. Assume it exists (if it doesn't, we'll fail when we try to create a\n  \/\/ directory inside it).\n  if (path.empty()) {\n    return true;\n  }\n\n  struct stat dir_stats;\n  if (stat(path.c_str(), &dir_stats) == 0) {\n    \/\/ Return true if the directory already exists.\n    return S_ISDIR(dir_stats.st_mode);\n  }\n\n  \/\/ Recurse to create the parent directory.\n  if (!MakeDirs(Dirname(path).c_str(), mode)) {\n    return false;\n  }\n\n  \/\/ Create the directory that was requested.\n  return mkdir(path.c_str(), mode) == 0;\n}\n<commit_msg>Fix race condition in MakeDirs (#644)<commit_after>\/\/ Copyright 2019 The Bazel 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 \"tools\/common\/file_system.h\"\n\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include <iostream>\n#include <string>\n#include <string.h>\n\n#ifdef __APPLE__\n#include <copyfile.h>\n#include <removefile.h>\n#else\n#include <fcntl.h>\n#include <sys\/sendfile.h>\n#endif\n\n#include \"tools\/common\/path_utils.h\"\n\nstd::string GetCurrentDirectory() {\n  \/\/ Passing null,0 causes getcwd to allocate the buffer of the correct size.\n  char *buffer = getcwd(nullptr, 0);\n  std::string cwd(buffer);\n  free(buffer);\n  return cwd;\n}\n\nbool FileExists(const std::string &path) {\n  return access(path.c_str(), 0) == 0;\n}\n\nbool RemoveFile(const std::string &path) {\n#ifdef __APPLE__\n  return removefile(path.c_str(), nullptr, 0);\n#elif __unix__\n  return remove(path.c_str());\n#else\n#error Only macOS and Unix are supported at this time.\n#endif\n}\n\nbool CopyFile(const std::string &src, const std::string &dest) {\n#ifdef __APPLE__\n  \/\/ The `copyfile` function with `COPYFILE_ALL` mode preserves permissions and\n  \/\/ modification time.\n  return copyfile(src.c_str(), dest.c_str(), nullptr,\n                  COPYFILE_ALL | COPYFILE_CLONE) == 0;\n#elif __unix__\n  \/\/ On Linux, we can use `sendfile` to copy it more easily than calling\n  \/\/ `read`\/`write` in a loop.\n  struct stat stat_buf;\n  bool success = false;\n\n  int src_fd = open(src.c_str(), O_RDONLY);\n  if (src_fd) {\n    fstat(src_fd, &stat_buf);\n\n    int dest_fd = open(dest.c_str(), O_WRONLY | O_CREAT, stat_buf.st_mode);\n    if (dest_fd) {\n      off_t offset = 0;\n      if (sendfile(dest_fd, src_fd, &offset, stat_buf.st_size) != -1) {\n        struct timespec timespecs[2] = {stat_buf.st_atim, stat_buf.st_mtim};\n        futimens(dest_fd, timespecs);\n        success = true;\n      }\n      close(dest_fd);\n    }\n    close(src_fd);\n  }\n  return success;\n#else\n\/\/ TODO(allevato): If we want to support Windows in the future, we'll need to\n\/\/ use something like `CopyFileA`.\n#error Only macOS and Unix are supported at this time.\n#endif\n}\n\nbool MakeDirs(const std::string &path, int mode) {\n  \/\/ If we got an empty string, we've recursed past the first segment in the\n  \/\/ path. Assume it exists (if it doesn't, we'll fail when we try to create a\n  \/\/ directory inside it).\n  if (path.empty()) {\n    return true;\n  }\n\n  struct stat dir_stats;\n  if (stat(path.c_str(), &dir_stats) == 0) {\n    \/\/ Return true if the directory already exists.\n    if (!S_ISDIR(dir_stats.st_mode)) {\n      std::cerr << \"error: path exists and isn't a directory \"\n                << strerror(errno) << \" (\" << path.c_str() << \") \\n\";\n      return false;\n    } else {\n      return true;\n    }\n  }\n\n  \/\/ Recurse to create the parent directory.\n  if (!MakeDirs(Dirname(path).c_str(), mode)) {\n    return false;\n  }\n\n  \/\/ Create the directory that was requested.\n  int mkdir_ret = mkdir(path.c_str(), mode);\n  if (mkdir_ret == 0) {\n    return true;\n  }\n\n  \/\/ Save the mkdir errno for better reporting.\n  int mkdir_errno = errno;\n\n  \/\/ Deal with a race condition when 2 `MakeDirs` are running at the same time:\n  \/\/ one `mkdir` invocation will fail in each recursive call at different\n  \/\/ points. Don't recurse here to avoid an infinite loop in failure cases.\n  if (errno == EEXIST && stat(path.c_str(), &dir_stats) == 0) {\n    if (!S_ISDIR(dir_stats.st_mode)) {\n      std::cerr << \"error: path exists and isn't a directory \"\n                << strerror(errno) << \" (\" << path.c_str() << \") \\n\";\n      return false;\n    } else {\n      \/\/ Return true if the directory already exists.\n      return true;\n    }\n  }\n\n  std::cerr << \"error:\" << strerror(mkdir_errno) << \" (\" << path.c_str()\n            << \") \\n\";\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Library:   CTK\n \n  Copyright (c) 2010  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 <QColor>\n#include <QDebug>\n#include <QLinearGradient>\n#include <QGraphicsSceneMouseEvent>\n#include <QPainter>\n#include <QtGlobal>\n#include <QVariant>\n\n\/\/\/ CTK includes\n#include \"ctkTransferFunction.h\"\n#include \"ctkTransferFunctionItem.h\"\n#include \"ctkTransferFunctionScene.h\"\n\n\/\/-----------------------------------------------------------------------------\nclass ctkTransferFunctionItemPrivate : \n  public ctkPrivate<ctkTransferFunctionItem>\n{\npublic:\n  ctkTransferFunctionItemPrivate();\n  void init();\n  QRectF               Rect;\n  ctkTransferFunction* TransferFunction;\n};\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunctionItemPrivate::ctkTransferFunctionItemPrivate()\n{\n  this->TransferFunction = 0;\n  this->Rect = QRectF(0.,0.,1.,1.);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkTransferFunctionItemPrivate::init()\n{\n  \/\/CTK_P(ctkTransferFunctionItem);\n}\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunctionItem::ctkTransferFunctionItem(QGraphicsItem* parentGraphicsItem)\n  :QGraphicsObject(parentGraphicsItem)\n{\n  CTK_INIT_PRIVATE(ctkTransferFunctionItem);\n  ctk_d()->init();\n}\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunctionItem::ctkTransferFunctionItem(\n  ctkTransferFunction* transferFunction, QGraphicsItem* parentItem)\n  :QGraphicsObject(parentItem)\n{\n  CTK_INIT_PRIVATE(ctkTransferFunctionItem);\n  ctk_d()->init();\n  this->setTransferFunction(transferFunction);\n}\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunctionItem::~ctkTransferFunctionItem()\n{\n  \n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkTransferFunctionItem::setTransferFunction(ctkTransferFunction* transferFunction)\n{\n  CTK_D(ctkTransferFunctionItem);\n  d->TransferFunction = transferFunction;\n  if (this->scene())\n    {\n    connect(d->TransferFunction,SIGNAL(changed()),\n            this->scene(), SLOT(update()),Qt::UniqueConnection);\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunction* ctkTransferFunctionItem::transferFunction() const\n{\n  CTK_D(const ctkTransferFunctionItem);\n  return d->TransferFunction;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkTransferFunctionItem::setRect(const QRectF& newRect)\n{\n  CTK_D(ctkTransferFunctionItem);\n  if (d->Rect == newRect)\n    {\n    return;\n    }\n  d->Rect = newRect;\n  this->update();\n}\n\n\/\/-----------------------------------------------------------------------------\nQRectF ctkTransferFunctionItem::rect() const\n{\n  CTK_D(const ctkTransferFunctionItem);\n  return d->Rect;\n}\n\n\/\/-----------------------------------------------------------------------------\nQRectF ctkTransferFunctionItem::boundingRect()const\n{\n  CTK_D(const ctkTransferFunctionItem);\n  return d->Rect;\n}\n\/*\n\/\/-----------------------------------------------------------------------------\nQList<ctkPoint> ctkTransferFunctionItem::bezierParams(\n  ctkControlPoint* start, ctkControlPoint* end) const\n{\n  Q_ASSERT(start);\n  Q_ASSERT(end);\n  QList<ctkPoint> points; \n  \n  ctkBezierControlPoint* bezierCP = dynamic_cast<ctkBezierControlPoint*>(start);\n  if (!bezierCP)\n    {\/\/ just duplicate start and end into p1 and p2\n    points << start->P;\n    points << start->P;\n    points << end->P;\n    points << end->P;\n    return points;\n    }\n  \n  points << start->P;\n  points << bezierCP->P1;\n  points << bezierCP->P2;\n  points << end->P;\n  return points;\n}\n\n\/\/-----------------------------------------------------------------------------\nQList<ctkPoint> ctkTransferFunctionItem::nonLinearPoints(\n  ctkControlPoint* start, ctkControlPoint* end) const\n{\n  Q_ASSERT(start);\n    \n  ctkNonLinearControlPoint* nonLinearCP = \n    dynamic_cast<ctkNonLinearControlPoint*>(start);\n  if (!nonLinearCP)\n    {\n    QList<ctkPoint> points; \n    points << start->P;\n    points << end->P;\n    return points;\n    }\n  return nonLinearCP->SubPoints;\n}\n\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::y(const QVariant& v) const\n{ \n  Q_ASSERT(v.canConvert<qreal>() || v.canConvert<QColor>());\n  if (v.canConvert<QColor>())\n    {\n    return v.value<QColor>().alphaF();\n    }\n  return v.toReal();\n}\n\n\/\/-----------------------------------------------------------------------------\nQColor ctkTransferFunctionItem::color(const QVariant& v) const\n{ \n  \/\/Q_ASSERT(v.canConvert<QColor>());\n  if (v.canConvert<QColor>())\n    {\n    return v.value<QColor>();\n    }\n  else\n    {\n    \/\/black background\n    QColor defaultColor(0., 0., 0.);\n    return defaultColor;\n    }\n  return QColor();\n}\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::rangeXDiff()\n{\n  \/\/ pointer to private class\n  CTK_D(ctkTransferFunctionItem);\n\n  qreal rangeX[2];\n  d->TransferFunction->range(rangeX);\n  return this->rect().width() \/ (rangeX[1] - rangeX[0]);\n}\n\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::rangeXOffSet()\n{\n  \/\/ pointer to private class\n  CTK_D(ctkTransferFunctionItem);\n\n  qreal rangeX[2];\n  d->TransferFunction->range(rangeX);\n  return rangeX[0];\n}\n\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::rangeYDiff()\n{\n  \/\/ pointer to private class\n  CTK_D(ctkTransferFunctionItem);\n\n  QVariant rangeY[2];\n  rangeY[0] = d->TransferFunction->minValue();\n  rangeY[1] = d->TransferFunction->maxValue();\n  qreal rangeYDiff = this->rect().height();\n  if (rangeY[0].canConvert<qreal>())\n    {\n    if (rangeY[1].toReal() == rangeY[0].toReal())\n      {\n      rangeYDiff \/= rangeY[0].toReal();\n      return rangeYDiff;\n      }\n    else\n      {\n      rangeYDiff \/= rangeY[1].toReal() - rangeY[0].toReal();\n      return rangeYDiff;\n      }\n    }\n    else if (rangeY[0].canConvert<QColor>())\n      {\n      if ( rangeY[1].value<QColor>().alphaF() == rangeY[0].value<QColor>().alphaF())\n        {\n        rangeYDiff \/= rangeY[0].value<QColor>().alphaF();\n        return rangeYDiff;\n        }\n      else\n        {\n        rangeYDiff \/= rangeY[1].value<QColor>().alphaF() - rangeY[0].value<QColor>().alphaF();\n        return rangeYDiff;\n        }\n      }\n    else\n      {\n      Q_ASSERT(rangeY[0].canConvert<qreal>() ||\n      rangeY[0].canConvert<QColor>());\n      }\n  return rangeYDiff;\n}\n\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::rangeYOffSet()\n{\n  \/\/ pointer to private class\n  CTK_D(ctkTransferFunctionItem);\n\n  QVariant rangeY[2];\n  rangeY[0] = d->TransferFunction->minValue();\n  rangeY[1] = d->TransferFunction->maxValue();\n  if (rangeY[0].canConvert<qreal>())\n    {\n    if (rangeY[1].toReal() == rangeY[0].toReal())\n      {\n      return 0.;\n      }\n    else\n      {\n      return rangeY[0].toReal();\n      }\n    }\n  else if (rangeY[0].canConvert<QColor>())\n    {\n    if ( rangeY[1].value<QColor>().alphaF() == rangeY[0].value<QColor>().alphaF())\n      {\n      return 0.;\n      }\n    else\n      {\n      return rangeY[0].value<QColor>().alphaF();\n      }\n    }\n  else\n    {\n    Q_ASSERT(rangeY[0].canConvert<qreal>() ||\n        rangeY[0].canConvert<QColor>());\n    }\n  return 0;\n}\n\n\/\/-----------------------------------------------------------------------------\nQPointF ctkTransferFunctionItem::transferFunction2ScreenCoordinates( qreal x, qreal y)\n{\n  QPointF screenCoordinates((x - this->rangeXOffSet() ) * this->rangeXDiff(),\n      this->rect().height() - (y - this->rangeYOffSet() ) * this->rangeYDiff() );\n  return screenCoordinates;\n}\n\n\/\/-----------------------------------------------------------------------------\nQPointF ctkTransferFunctionItem::screen2TransferFunctionCoordinates( qreal x, qreal y)\n{\n  QPointF transferFunctionCoordinates((x \/ this->rangeXDiff() ) + this->rangeXOffSet(),\n      ( - y + this->rect().height() )\/this->rangeYDiff() + this->rangeYOffSet());\n\n  return transferFunctionCoordinates;\n}\n*\/\n\n\/\/-----------------------------------------------------------------------------\nQVariant ctkTransferFunctionItem::itemChange(QGraphicsItem::GraphicsItemChange change, const QVariant& value)\n{\n  QVariant res = this->QGraphicsObject::itemChange(change, value);\n  if (change == QGraphicsItem::ItemSceneChange && this->scene())\n    {\n    connect(this->transferFunction(),SIGNAL(changed()),\n            this->scene(), SLOT(update()),Qt::UniqueConnection);\n    }\n  return res;\n}\n<commit_msg>BUG: ctkTransferFunctionItem, the event was not the one it was supposed to be<commit_after>\/*=========================================================================\n\n  Library:   CTK\n \n  Copyright (c) 2010  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 <QColor>\n#include <QDebug>\n#include <QLinearGradient>\n#include <QGraphicsSceneMouseEvent>\n#include <QPainter>\n#include <QtGlobal>\n#include <QVariant>\n\n\/\/\/ CTK includes\n#include \"ctkTransferFunction.h\"\n#include \"ctkTransferFunctionItem.h\"\n#include \"ctkTransferFunctionScene.h\"\n\n\/\/-----------------------------------------------------------------------------\nclass ctkTransferFunctionItemPrivate : \n  public ctkPrivate<ctkTransferFunctionItem>\n{\npublic:\n  ctkTransferFunctionItemPrivate();\n  void init();\n  QRectF               Rect;\n  ctkTransferFunction* TransferFunction;\n};\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunctionItemPrivate::ctkTransferFunctionItemPrivate()\n{\n  this->TransferFunction = 0;\n  this->Rect = QRectF(0.,0.,1.,1.);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkTransferFunctionItemPrivate::init()\n{\n  \/\/CTK_P(ctkTransferFunctionItem);\n}\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunctionItem::ctkTransferFunctionItem(QGraphicsItem* parentGraphicsItem)\n  :QGraphicsObject(parentGraphicsItem)\n{\n  CTK_INIT_PRIVATE(ctkTransferFunctionItem);\n  ctk_d()->init();\n}\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunctionItem::ctkTransferFunctionItem(\n  ctkTransferFunction* transferFunction, QGraphicsItem* parentItem)\n  :QGraphicsObject(parentItem)\n{\n  CTK_INIT_PRIVATE(ctkTransferFunctionItem);\n  ctk_d()->init();\n  this->setTransferFunction(transferFunction);\n}\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunctionItem::~ctkTransferFunctionItem()\n{\n  \n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkTransferFunctionItem::setTransferFunction(ctkTransferFunction* transferFunction)\n{\n  CTK_D(ctkTransferFunctionItem);\n  d->TransferFunction = transferFunction;\n  if (this->scene())\n    {\n    connect(d->TransferFunction,SIGNAL(changed()),\n            this->scene(), SLOT(update()),Qt::UniqueConnection);\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nctkTransferFunction* ctkTransferFunctionItem::transferFunction() const\n{\n  CTK_D(const ctkTransferFunctionItem);\n  return d->TransferFunction;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkTransferFunctionItem::setRect(const QRectF& newRect)\n{\n  CTK_D(ctkTransferFunctionItem);\n  if (d->Rect == newRect)\n    {\n    return;\n    }\n  d->Rect = newRect;\n  this->update();\n}\n\n\/\/-----------------------------------------------------------------------------\nQRectF ctkTransferFunctionItem::rect() const\n{\n  CTK_D(const ctkTransferFunctionItem);\n  return d->Rect;\n}\n\n\/\/-----------------------------------------------------------------------------\nQRectF ctkTransferFunctionItem::boundingRect()const\n{\n  CTK_D(const ctkTransferFunctionItem);\n  return d->Rect;\n}\n\/*\n\/\/-----------------------------------------------------------------------------\nQList<ctkPoint> ctkTransferFunctionItem::bezierParams(\n  ctkControlPoint* start, ctkControlPoint* end) const\n{\n  Q_ASSERT(start);\n  Q_ASSERT(end);\n  QList<ctkPoint> points; \n  \n  ctkBezierControlPoint* bezierCP = dynamic_cast<ctkBezierControlPoint*>(start);\n  if (!bezierCP)\n    {\/\/ just duplicate start and end into p1 and p2\n    points << start->P;\n    points << start->P;\n    points << end->P;\n    points << end->P;\n    return points;\n    }\n  \n  points << start->P;\n  points << bezierCP->P1;\n  points << bezierCP->P2;\n  points << end->P;\n  return points;\n}\n\n\/\/-----------------------------------------------------------------------------\nQList<ctkPoint> ctkTransferFunctionItem::nonLinearPoints(\n  ctkControlPoint* start, ctkControlPoint* end) const\n{\n  Q_ASSERT(start);\n    \n  ctkNonLinearControlPoint* nonLinearCP = \n    dynamic_cast<ctkNonLinearControlPoint*>(start);\n  if (!nonLinearCP)\n    {\n    QList<ctkPoint> points; \n    points << start->P;\n    points << end->P;\n    return points;\n    }\n  return nonLinearCP->SubPoints;\n}\n\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::y(const QVariant& v) const\n{ \n  Q_ASSERT(v.canConvert<qreal>() || v.canConvert<QColor>());\n  if (v.canConvert<QColor>())\n    {\n    return v.value<QColor>().alphaF();\n    }\n  return v.toReal();\n}\n\n\/\/-----------------------------------------------------------------------------\nQColor ctkTransferFunctionItem::color(const QVariant& v) const\n{ \n  \/\/Q_ASSERT(v.canConvert<QColor>());\n  if (v.canConvert<QColor>())\n    {\n    return v.value<QColor>();\n    }\n  else\n    {\n    \/\/black background\n    QColor defaultColor(0., 0., 0.);\n    return defaultColor;\n    }\n  return QColor();\n}\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::rangeXDiff()\n{\n  \/\/ pointer to private class\n  CTK_D(ctkTransferFunctionItem);\n\n  qreal rangeX[2];\n  d->TransferFunction->range(rangeX);\n  return this->rect().width() \/ (rangeX[1] - rangeX[0]);\n}\n\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::rangeXOffSet()\n{\n  \/\/ pointer to private class\n  CTK_D(ctkTransferFunctionItem);\n\n  qreal rangeX[2];\n  d->TransferFunction->range(rangeX);\n  return rangeX[0];\n}\n\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::rangeYDiff()\n{\n  \/\/ pointer to private class\n  CTK_D(ctkTransferFunctionItem);\n\n  QVariant rangeY[2];\n  rangeY[0] = d->TransferFunction->minValue();\n  rangeY[1] = d->TransferFunction->maxValue();\n  qreal rangeYDiff = this->rect().height();\n  if (rangeY[0].canConvert<qreal>())\n    {\n    if (rangeY[1].toReal() == rangeY[0].toReal())\n      {\n      rangeYDiff \/= rangeY[0].toReal();\n      return rangeYDiff;\n      }\n    else\n      {\n      rangeYDiff \/= rangeY[1].toReal() - rangeY[0].toReal();\n      return rangeYDiff;\n      }\n    }\n    else if (rangeY[0].canConvert<QColor>())\n      {\n      if ( rangeY[1].value<QColor>().alphaF() == rangeY[0].value<QColor>().alphaF())\n        {\n        rangeYDiff \/= rangeY[0].value<QColor>().alphaF();\n        return rangeYDiff;\n        }\n      else\n        {\n        rangeYDiff \/= rangeY[1].value<QColor>().alphaF() - rangeY[0].value<QColor>().alphaF();\n        return rangeYDiff;\n        }\n      }\n    else\n      {\n      Q_ASSERT(rangeY[0].canConvert<qreal>() ||\n      rangeY[0].canConvert<QColor>());\n      }\n  return rangeYDiff;\n}\n\n\/\/-----------------------------------------------------------------------------\nqreal ctkTransferFunctionItem::rangeYOffSet()\n{\n  \/\/ pointer to private class\n  CTK_D(ctkTransferFunctionItem);\n\n  QVariant rangeY[2];\n  rangeY[0] = d->TransferFunction->minValue();\n  rangeY[1] = d->TransferFunction->maxValue();\n  if (rangeY[0].canConvert<qreal>())\n    {\n    if (rangeY[1].toReal() == rangeY[0].toReal())\n      {\n      return 0.;\n      }\n    else\n      {\n      return rangeY[0].toReal();\n      }\n    }\n  else if (rangeY[0].canConvert<QColor>())\n    {\n    if ( rangeY[1].value<QColor>().alphaF() == rangeY[0].value<QColor>().alphaF())\n      {\n      return 0.;\n      }\n    else\n      {\n      return rangeY[0].value<QColor>().alphaF();\n      }\n    }\n  else\n    {\n    Q_ASSERT(rangeY[0].canConvert<qreal>() ||\n        rangeY[0].canConvert<QColor>());\n    }\n  return 0;\n}\n\n\/\/-----------------------------------------------------------------------------\nQPointF ctkTransferFunctionItem::transferFunction2ScreenCoordinates( qreal x, qreal y)\n{\n  QPointF screenCoordinates((x - this->rangeXOffSet() ) * this->rangeXDiff(),\n      this->rect().height() - (y - this->rangeYOffSet() ) * this->rangeYDiff() );\n  return screenCoordinates;\n}\n\n\/\/-----------------------------------------------------------------------------\nQPointF ctkTransferFunctionItem::screen2TransferFunctionCoordinates( qreal x, qreal y)\n{\n  QPointF transferFunctionCoordinates((x \/ this->rangeXDiff() ) + this->rangeXOffSet(),\n      ( - y + this->rect().height() )\/this->rangeYDiff() + this->rangeYOffSet());\n\n  return transferFunctionCoordinates;\n}\n*\/\n\n\/\/-----------------------------------------------------------------------------\nQVariant ctkTransferFunctionItem::itemChange(QGraphicsItem::GraphicsItemChange change, const QVariant& value)\n{\n  QVariant res = this->QGraphicsObject::itemChange(change, value);\n  if (change == QGraphicsItem::ItemSceneHasChanged && this->scene())\n    {\n    connect(this->transferFunction(),SIGNAL(changed()),\n            this->scene(), SLOT(update()),Qt::UniqueConnection);\n    }\n  return res;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- TreeView.cpp - diagtool tool for printing warning flags ------------===\/\/\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 diagnostic tool \n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"DiagTool.h\"\n#include \"DiagnosticNames.h\"\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/ADT\/StringMap.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"clang\/AST\/ASTDiagnostic.h\"\n#include \"clang\/Basic\/AllDiagnostics.h\"\n\nDEF_DIAGTOOL(\"tree\",\n             \"Show warning flags in a tree view\",\n             TreeView)\n  \nusing namespace clang;\nusing namespace diagtool;\n\nstatic void printUsage() {\n  llvm::errs() << \"Usage: diagtool tree [--flags-only] [<diagnostic-group>]\\n\";\n}\n\nstatic void printGroup(llvm::raw_ostream &out, const GroupRecord &Group,\n                       bool FlagsOnly, unsigned Indent = 0) {\n  out.indent(Indent * 2);\n  out << \"-W\" << Group.getName() << \"\\n\";\n\n  ++Indent;\n  for (GroupRecord::subgroup_iterator I = Group.subgroup_begin(),\n                                      E = Group.subgroup_end();\n       I != E; ++I) {\n    printGroup(out, *I, FlagsOnly, Indent);\n  }\n\n  if (!FlagsOnly) {\n    for (GroupRecord::diagnostics_iterator I = Group.diagnostics_begin(),\n                                           E = Group.diagnostics_end();\n         I != E; ++I) {\n      out.indent(Indent * 2);\n      out << I->getName() << \"\\n\";\n    }\n  }\n}\n\nstatic int showGroup(llvm::raw_ostream &out, StringRef RootGroup,\n                     bool FlagsOnly) {\n  ArrayRef<GroupRecord> AllGroups = getDiagnosticGroups();\n\n  GroupRecord Key = { RootGroup.size(), RootGroup.data(), 0, 0 };\n  const GroupRecord *Found =\n    std::lower_bound(AllGroups.begin(), AllGroups.end(), Key);\n  \n  if (Found == AllGroups.end() || Found->getName() != RootGroup) {\n    llvm::errs() << \"No such diagnostic group exists\\n\";\n    return 1;\n  }\n  \n  printGroup(out, *Found, FlagsOnly);\n  \n  return 0;\n}\n\nstatic int showAll(llvm::raw_ostream &out, bool FlagsOnly) {\n  ArrayRef<GroupRecord> AllGroups = getDiagnosticGroups();\n  llvm::DenseSet<unsigned> NonRootGroupIDs;\n\n  for (ArrayRef<GroupRecord>::iterator I = AllGroups.begin(),\n                                       E = AllGroups.end();\n       I != E; ++I) {\n    for (GroupRecord::subgroup_iterator SI = I->subgroup_begin(),\n                                        SE = I->subgroup_end();\n         SI != SE; ++SI) {\n      NonRootGroupIDs.insert((unsigned)SI.getID());\n    }\n  }\n\n  assert(NonRootGroupIDs.size() < AllGroups.size());\n\n  for (unsigned i = 0, e = AllGroups.size(); i != e; ++i) {\n    if (!NonRootGroupIDs.count(i))\n      printGroup(out, AllGroups[i], FlagsOnly);\n  }\n\n  return 0;\n}\n\nint TreeView::run(unsigned int argc, char **argv, llvm::raw_ostream &out) {\n  \/\/ First check our one flag (--flags-only).\n  bool FlagsOnly = false;\n  if (argc > 0) {\n    StringRef FirstArg(*argv);\n    if (FirstArg.equals(\"--flags-only\")) {\n      FlagsOnly = true;\n      --argc;\n      ++argv;\n    }\n  }\n\n  bool ShowAll = false;\n  StringRef RootGroup;\n\n  switch (argc) {\n  case 0:\n    ShowAll = true;\n    break;\n  case 1:\n    RootGroup = argv[0];\n    if (RootGroup.startswith(\"-W\"))\n      RootGroup = RootGroup.substr(2);\n    if (RootGroup == \"everything\")\n      ShowAll = true;\n    \/\/ FIXME: Handle other special warning flags, like -pedantic.\n    break;\n  default:\n    printUsage();\n    return -1;\n  }\n\n  if (ShowAll)\n    return showAll(out, FlagsOnly);\n\n  return showGroup(out, RootGroup, FlagsOnly);\n}\n\n<commit_msg>Add color output to 'diagtool tree' to show what warnings are enabled by default.<commit_after>\/\/===- TreeView.cpp - diagtool tool for printing warning flags ------------===\/\/\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 diagnostic tool \n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"DiagTool.h\"\n#include \"DiagnosticNames.h\"\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/ADT\/StringMap.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"clang\/AST\/ASTDiagnostic.h\"\n#include \"clang\/Basic\/AllDiagnostics.h\"\n#include \"llvm\/Support\/Process.h\"\n\nDEF_DIAGTOOL(\"tree\",\n             \"Show warning flags in a tree view\",\n             TreeView)\n  \nusing namespace clang;\nusing namespace diagtool;\n\nstatic void printUsage() {\n  llvm::errs() << \"Usage: diagtool tree [--flags-only] [<diagnostic-group>]\\n\";\n}\n\nstatic bool showColors(llvm::raw_ostream &out) {\n  if (&out != &llvm::errs() && &out != &llvm::outs())\n    return false;\n  return llvm::errs().is_displayed() && llvm::outs().is_displayed();\n}\n\nstatic void setColor(bool ShowColors, llvm::raw_ostream &out,\n                     llvm::raw_ostream::Colors Color) {\n  if (ShowColors)\n    out << llvm::sys::Process::OutputColor(Color, false, false);\n}\n\nstatic void resetColor(bool ShowColors, llvm::raw_ostream &out) {\n  if (ShowColors)\n    out << llvm::sys::Process::ResetColor();\n}\n\nstatic clang::DiagnosticsEngine::Level getLevel(unsigned DiagID) {\n  static clang::DiagnosticsEngine Diags(new DiagnosticIDs);\n  return Diags.getDiagnosticLevel(DiagID, SourceLocation());\n}\n\nstatic void printGroup(llvm::raw_ostream &out, const GroupRecord &Group,\n                       bool FlagsOnly, unsigned Indent = 0) {\n  out.indent(Indent * 2);\n  \n  bool ShowColors = showColors(out);\n  setColor(ShowColors, out, llvm::raw_ostream::YELLOW);\n  out << \"-W\" << Group.getName() << \"\\n\";\n  resetColor(ShowColors, out);\n  \n  ++Indent;\n  for (GroupRecord::subgroup_iterator I = Group.subgroup_begin(),\n                                      E = Group.subgroup_end();\n       I != E; ++I) {\n    printGroup(out, *I, FlagsOnly, Indent);\n  }\n\n  if (!FlagsOnly) {\n    for (GroupRecord::diagnostics_iterator I = Group.diagnostics_begin(),\n                                           E = Group.diagnostics_end();\n         I != E; ++I) {\n      if (ShowColors) {\n        if (getLevel(I->DiagID) != DiagnosticsEngine::Ignored) {\n          setColor(ShowColors, out, llvm::raw_ostream::GREEN);\n        }\n      }\n      out.indent(Indent * 2);\n      out << I->getName();\n      resetColor(ShowColors, out);\n      out << \"\\n\";\n    }\n  }\n}\n\nstatic int showGroup(llvm::raw_ostream &out, StringRef RootGroup,\n                     bool FlagsOnly) {\n  ArrayRef<GroupRecord> AllGroups = getDiagnosticGroups();\n\n  GroupRecord Key = { RootGroup.size(), RootGroup.data(), 0, 0 };\n  const GroupRecord *Found =\n    std::lower_bound(AllGroups.begin(), AllGroups.end(), Key);\n  \n  if (Found == AllGroups.end() || Found->getName() != RootGroup) {\n    llvm::errs() << \"No such diagnostic group exists\\n\";\n    return 1;\n  }\n  \n  printGroup(out, *Found, FlagsOnly);\n  \n  return 0;\n}\n\nstatic int showAll(llvm::raw_ostream &out, bool FlagsOnly) {\n  ArrayRef<GroupRecord> AllGroups = getDiagnosticGroups();\n  llvm::DenseSet<unsigned> NonRootGroupIDs;\n\n  for (ArrayRef<GroupRecord>::iterator I = AllGroups.begin(),\n                                       E = AllGroups.end();\n       I != E; ++I) {\n    for (GroupRecord::subgroup_iterator SI = I->subgroup_begin(),\n                                        SE = I->subgroup_end();\n         SI != SE; ++SI) {\n      NonRootGroupIDs.insert((unsigned)SI.getID());\n    }\n  }\n\n  assert(NonRootGroupIDs.size() < AllGroups.size());\n\n  for (unsigned i = 0, e = AllGroups.size(); i != e; ++i) {\n    if (!NonRootGroupIDs.count(i))\n      printGroup(out, AllGroups[i], FlagsOnly);\n  }\n\n  return 0;\n}\n\nint TreeView::run(unsigned int argc, char **argv, llvm::raw_ostream &out) {\n  \/\/ First check our one flag (--flags-only).\n  bool FlagsOnly = false;\n  if (argc > 0) {\n    StringRef FirstArg(*argv);\n    if (FirstArg.equals(\"--flags-only\")) {\n      FlagsOnly = true;\n      --argc;\n      ++argv;\n    }\n  }\n  \n  bool ShowAll = false;\n  StringRef RootGroup;\n\n  switch (argc) {\n  case 0:\n    ShowAll = true;\n    break;\n  case 1:\n    RootGroup = argv[0];\n    if (RootGroup.startswith(\"-W\"))\n      RootGroup = RootGroup.substr(2);\n    if (RootGroup == \"everything\")\n      ShowAll = true;\n    \/\/ FIXME: Handle other special warning flags, like -pedantic.\n    break;\n  default:\n    printUsage();\n    return -1;\n  }\n\n  if (showColors(out)) {\n    out << '\\n';\n    setColor(true, out, llvm::raw_ostream::GREEN);\n    out << \"GREEN\";\n    resetColor(true, out);\n    out << \" = enabled by default\\n\\n\";\n  }\n  \n  if (ShowAll)\n    return showAll(out, FlagsOnly);\n\n  return showGroup(out, RootGroup, FlagsOnly);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- tools\/dsymutil\/DebugMap.cpp - Generic debug map representation -----===\/\/\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#include \"DebugMap.h\"\n#include \"BinaryHolder.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/iterator_range.h\"\n#include \"llvm\/Support\/DataTypes.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\n\nnamespace llvm {\nnamespace dsymutil {\n\nusing namespace llvm::object;\n\nDebugMapObject::DebugMapObject(StringRef ObjectFilename)\n    : Filename(ObjectFilename) {}\n\nbool DebugMapObject::addSymbol(StringRef Name, uint64_t ObjectAddress,\n                               uint64_t LinkedAddress, uint32_t Size) {\n  auto InsertResult = Symbols.insert(\n      std::make_pair(Name, SymbolMapping(ObjectAddress, LinkedAddress, Size)));\n\n  if (InsertResult.second)\n    AddressToMapping[ObjectAddress] = &*InsertResult.first;\n  return InsertResult.second;\n}\n\nvoid DebugMapObject::print(raw_ostream &OS) const {\n  OS << getObjectFilename() << \":\\n\";\n  \/\/ Sort the symbols in alphabetical order, like llvm-nm (and to get\n  \/\/ deterministic output for testing).\n  typedef std::pair<StringRef, SymbolMapping> Entry;\n  std::vector<Entry> Entries;\n  Entries.reserve(Symbols.getNumItems());\n  for (const auto &Sym : make_range(Symbols.begin(), Symbols.end()))\n    Entries.push_back(std::make_pair(Sym.getKey(), Sym.getValue()));\n  std::sort(\n      Entries.begin(), Entries.end(),\n      [](const Entry &LHS, const Entry &RHS) { return LHS.first < RHS.first; });\n  for (const auto &Sym : Entries) {\n    OS << format(\"\\t%016\" PRIx64 \" => %016\" PRIx64 \"+0x%x\\t%s\\n\",\n                 uint64_t(Sym.second.ObjectAddress),\n                 uint64_t(Sym.second.BinaryAddress), uint32_t(Sym.second.Size),\n                 Sym.first.data());\n  }\n  OS << '\\n';\n}\n\n#ifndef NDEBUG\nvoid DebugMapObject::dump() const { print(errs()); }\n#endif\n\nDebugMapObject &DebugMap::addDebugMapObject(StringRef ObjectFilePath) {\n  Objects.emplace_back(new DebugMapObject(ObjectFilePath));\n  return *Objects.back();\n}\n\nconst DebugMapObject::DebugMapEntry *\nDebugMapObject::lookupSymbol(StringRef SymbolName) const {\n  StringMap<SymbolMapping>::const_iterator Sym = Symbols.find(SymbolName);\n  if (Sym == Symbols.end())\n    return nullptr;\n  return &*Sym;\n}\n\nconst DebugMapObject::DebugMapEntry *\nDebugMapObject::lookupObjectAddress(uint64_t Address) const {\n  auto Mapping = AddressToMapping.find(Address);\n  if (Mapping == AddressToMapping.end())\n    return nullptr;\n  return Mapping->getSecond();\n}\n\nvoid DebugMap::print(raw_ostream &OS) const {\n  yaml::Output yout(OS, \/* Ctxt = *\/ nullptr, \/* WrapColumn = *\/ 0);\n  yout << const_cast<DebugMap &>(*this);\n}\n\n#ifndef NDEBUG\nvoid DebugMap::dump() const { print(errs()); }\n#endif\n\nnamespace {\nstruct YAMLContext {\n  StringRef PrependPath;\n  Triple Triple;\n};\n}\n\nErrorOr<std::unique_ptr<DebugMap>>\nDebugMap::parseYAMLDebugMap(StringRef InputFile, StringRef PrependPath,\n                            bool Verbose) {\n  auto ErrOrFile = MemoryBuffer::getFileOrSTDIN(InputFile);\n  if (auto Err = ErrOrFile.getError())\n    return Err;\n\n  YAMLContext Ctxt;\n\n  Ctxt.PrependPath = PrependPath;\n\n  std::unique_ptr<DebugMap> Res;\n  yaml::Input yin((*ErrOrFile)->getBuffer(), &Ctxt);\n  yin >> Res;\n\n  if (auto EC = yin.error())\n    return EC;\n\n  return std::move(Res);\n}\n}\n\nnamespace yaml {\n\n\/\/ Normalize\/Denormalize between YAML and a DebugMapObject.\nstruct MappingTraits<dsymutil::DebugMapObject>::YamlDMO {\n  YamlDMO(IO &io) {}\n  YamlDMO(IO &io, dsymutil::DebugMapObject &Obj);\n  dsymutil::DebugMapObject denormalize(IO &IO);\n\n  std::string Filename;\n  std::vector<dsymutil::DebugMapObject::YAMLSymbolMapping> Entries;\n};\n\nvoid MappingTraits<std::pair<std::string, DebugMapObject::SymbolMapping>>::\n    mapping(IO &io, std::pair<std::string, DebugMapObject::SymbolMapping> &s) {\n  io.mapRequired(\"sym\", s.first);\n  io.mapRequired(\"objAddr\", s.second.ObjectAddress);\n  io.mapRequired(\"binAddr\", s.second.BinaryAddress);\n  io.mapOptional(\"size\", s.second.Size);\n}\n\nvoid MappingTraits<dsymutil::DebugMapObject>::mapping(\n    IO &io, dsymutil::DebugMapObject &DMO) {\n  MappingNormalization<YamlDMO, dsymutil::DebugMapObject> Norm(io, DMO);\n  io.mapRequired(\"filename\", Norm->Filename);\n  io.mapRequired(\"symbols\", Norm->Entries);\n}\n\nvoid ScalarTraits<Triple>::output(const Triple &val, void *,\n                                  llvm::raw_ostream &out) {\n  out << val.str();\n}\n\nStringRef ScalarTraits<Triple>::input(StringRef scalar, void *, Triple &value) {\n  value = Triple(scalar);\n  return StringRef();\n}\n\nsize_t\nSequenceTraits<std::vector<std::unique_ptr<dsymutil::DebugMapObject>>>::size(\n    IO &io, std::vector<std::unique_ptr<dsymutil::DebugMapObject>> &seq) {\n  return seq.size();\n}\n\ndsymutil::DebugMapObject &\nSequenceTraits<std::vector<std::unique_ptr<dsymutil::DebugMapObject>>>::element(\n    IO &, std::vector<std::unique_ptr<dsymutil::DebugMapObject>> &seq,\n    size_t index) {\n  if (index >= seq.size()) {\n    seq.resize(index + 1);\n    seq[index].reset(new dsymutil::DebugMapObject);\n  }\n  return *seq[index];\n}\n\nvoid MappingTraits<dsymutil::DebugMap>::mapping(IO &io,\n                                                dsymutil::DebugMap &DM) {\n  io.mapRequired(\"triple\", DM.BinaryTriple);\n  io.mapOptional(\"objects\", DM.Objects);\n  if (void *Ctxt = io.getContext())\n    reinterpret_cast<YAMLContext *>(Ctxt)->Triple = DM.BinaryTriple;\n}\n\nvoid MappingTraits<std::unique_ptr<dsymutil::DebugMap>>::mapping(\n    IO &io, std::unique_ptr<dsymutil::DebugMap> &DM) {\n  if (!DM)\n    DM.reset(new DebugMap());\n  io.mapRequired(\"triple\", DM->BinaryTriple);\n  io.mapOptional(\"objects\", DM->Objects);\n  if (void *Ctxt = io.getContext())\n    reinterpret_cast<YAMLContext *>(Ctxt)->Triple = DM->BinaryTriple;\n}\n\nMappingTraits<dsymutil::DebugMapObject>::YamlDMO::YamlDMO(\n    IO &io, dsymutil::DebugMapObject &Obj) {\n  Filename = Obj.Filename;\n  Entries.reserve(Obj.Symbols.size());\n  for (auto &Entry : Obj.Symbols)\n    Entries.push_back(std::make_pair(Entry.getKey(), Entry.getValue()));\n}\n\ndsymutil::DebugMapObject\nMappingTraits<dsymutil::DebugMapObject>::YamlDMO::denormalize(IO &IO) {\n  BinaryHolder BinHolder(\/* Verbose =*\/false);\n  const auto &Ctxt = *reinterpret_cast<YAMLContext *>(IO.getContext());\n  SmallString<80> Path(Ctxt.PrependPath);\n  StringMap<uint64_t> SymbolAddresses;\n\n  sys::path::append(Path, Filename);\n  auto ErrOrObjectFile = BinHolder.GetObjectFile(Path);\n  if (auto EC = ErrOrObjectFile.getError()) {\n    llvm::errs() << \"warning: Unable to open \" << Path << \" \" << EC.message()\n                 << '\\n';\n  } else {\n    \/\/ Rewrite the object file symbol addresses in the debug map. The\n    \/\/ YAML input is mainly used to test llvm-dsymutil without\n    \/\/ requiring binaries checked-in. If we generate the object files\n    \/\/ during the test, we can't hardcode the symbols addresses, so\n    \/\/ look them up here and rewrite them.\n    for (const auto &Sym : ErrOrObjectFile->symbols()) {\n      StringRef Name;\n      uint64_t Address;\n      if (Sym.getName(Name) || Sym.getAddress(Address))\n        continue;\n      SymbolAddresses[Name] = Address;\n    }\n  }\n\n  dsymutil::DebugMapObject Res(Path);\n  for (auto &Entry : Entries) {\n    auto &Mapping = Entry.second;\n    uint64_t ObjAddress = Mapping.ObjectAddress;\n    auto AddressIt = SymbolAddresses.find(Entry.first);\n    if (AddressIt != SymbolAddresses.end())\n      ObjAddress = AddressIt->getValue();\n    Res.addSymbol(Entry.first, ObjAddress, Mapping.BinaryAddress, Mapping.Size);\n  }\n  return Res;\n}\n}\n}\n<commit_msg>[dsymutil] Rename a variable to appease some bots.<commit_after>\/\/===- tools\/dsymutil\/DebugMap.cpp - Generic debug map representation -----===\/\/\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#include \"DebugMap.h\"\n#include \"BinaryHolder.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/iterator_range.h\"\n#include \"llvm\/Support\/DataTypes.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\n\nnamespace llvm {\nnamespace dsymutil {\n\nusing namespace llvm::object;\n\nDebugMapObject::DebugMapObject(StringRef ObjectFilename)\n    : Filename(ObjectFilename) {}\n\nbool DebugMapObject::addSymbol(StringRef Name, uint64_t ObjectAddress,\n                               uint64_t LinkedAddress, uint32_t Size) {\n  auto InsertResult = Symbols.insert(\n      std::make_pair(Name, SymbolMapping(ObjectAddress, LinkedAddress, Size)));\n\n  if (InsertResult.second)\n    AddressToMapping[ObjectAddress] = &*InsertResult.first;\n  return InsertResult.second;\n}\n\nvoid DebugMapObject::print(raw_ostream &OS) const {\n  OS << getObjectFilename() << \":\\n\";\n  \/\/ Sort the symbols in alphabetical order, like llvm-nm (and to get\n  \/\/ deterministic output for testing).\n  typedef std::pair<StringRef, SymbolMapping> Entry;\n  std::vector<Entry> Entries;\n  Entries.reserve(Symbols.getNumItems());\n  for (const auto &Sym : make_range(Symbols.begin(), Symbols.end()))\n    Entries.push_back(std::make_pair(Sym.getKey(), Sym.getValue()));\n  std::sort(\n      Entries.begin(), Entries.end(),\n      [](const Entry &LHS, const Entry &RHS) { return LHS.first < RHS.first; });\n  for (const auto &Sym : Entries) {\n    OS << format(\"\\t%016\" PRIx64 \" => %016\" PRIx64 \"+0x%x\\t%s\\n\",\n                 uint64_t(Sym.second.ObjectAddress),\n                 uint64_t(Sym.second.BinaryAddress), uint32_t(Sym.second.Size),\n                 Sym.first.data());\n  }\n  OS << '\\n';\n}\n\n#ifndef NDEBUG\nvoid DebugMapObject::dump() const { print(errs()); }\n#endif\n\nDebugMapObject &DebugMap::addDebugMapObject(StringRef ObjectFilePath) {\n  Objects.emplace_back(new DebugMapObject(ObjectFilePath));\n  return *Objects.back();\n}\n\nconst DebugMapObject::DebugMapEntry *\nDebugMapObject::lookupSymbol(StringRef SymbolName) const {\n  StringMap<SymbolMapping>::const_iterator Sym = Symbols.find(SymbolName);\n  if (Sym == Symbols.end())\n    return nullptr;\n  return &*Sym;\n}\n\nconst DebugMapObject::DebugMapEntry *\nDebugMapObject::lookupObjectAddress(uint64_t Address) const {\n  auto Mapping = AddressToMapping.find(Address);\n  if (Mapping == AddressToMapping.end())\n    return nullptr;\n  return Mapping->getSecond();\n}\n\nvoid DebugMap::print(raw_ostream &OS) const {\n  yaml::Output yout(OS, \/* Ctxt = *\/ nullptr, \/* WrapColumn = *\/ 0);\n  yout << const_cast<DebugMap &>(*this);\n}\n\n#ifndef NDEBUG\nvoid DebugMap::dump() const { print(errs()); }\n#endif\n\nnamespace {\nstruct YAMLContext {\n  StringRef PrependPath;\n  Triple BinaryTriple;\n};\n}\n\nErrorOr<std::unique_ptr<DebugMap>>\nDebugMap::parseYAMLDebugMap(StringRef InputFile, StringRef PrependPath,\n                            bool Verbose) {\n  auto ErrOrFile = MemoryBuffer::getFileOrSTDIN(InputFile);\n  if (auto Err = ErrOrFile.getError())\n    return Err;\n\n  YAMLContext Ctxt;\n\n  Ctxt.PrependPath = PrependPath;\n\n  std::unique_ptr<DebugMap> Res;\n  yaml::Input yin((*ErrOrFile)->getBuffer(), &Ctxt);\n  yin >> Res;\n\n  if (auto EC = yin.error())\n    return EC;\n\n  return std::move(Res);\n}\n}\n\nnamespace yaml {\n\n\/\/ Normalize\/Denormalize between YAML and a DebugMapObject.\nstruct MappingTraits<dsymutil::DebugMapObject>::YamlDMO {\n  YamlDMO(IO &io) {}\n  YamlDMO(IO &io, dsymutil::DebugMapObject &Obj);\n  dsymutil::DebugMapObject denormalize(IO &IO);\n\n  std::string Filename;\n  std::vector<dsymutil::DebugMapObject::YAMLSymbolMapping> Entries;\n};\n\nvoid MappingTraits<std::pair<std::string, DebugMapObject::SymbolMapping>>::\n    mapping(IO &io, std::pair<std::string, DebugMapObject::SymbolMapping> &s) {\n  io.mapRequired(\"sym\", s.first);\n  io.mapRequired(\"objAddr\", s.second.ObjectAddress);\n  io.mapRequired(\"binAddr\", s.second.BinaryAddress);\n  io.mapOptional(\"size\", s.second.Size);\n}\n\nvoid MappingTraits<dsymutil::DebugMapObject>::mapping(\n    IO &io, dsymutil::DebugMapObject &DMO) {\n  MappingNormalization<YamlDMO, dsymutil::DebugMapObject> Norm(io, DMO);\n  io.mapRequired(\"filename\", Norm->Filename);\n  io.mapRequired(\"symbols\", Norm->Entries);\n}\n\nvoid ScalarTraits<Triple>::output(const Triple &val, void *,\n                                  llvm::raw_ostream &out) {\n  out << val.str();\n}\n\nStringRef ScalarTraits<Triple>::input(StringRef scalar, void *, Triple &value) {\n  value = Triple(scalar);\n  return StringRef();\n}\n\nsize_t\nSequenceTraits<std::vector<std::unique_ptr<dsymutil::DebugMapObject>>>::size(\n    IO &io, std::vector<std::unique_ptr<dsymutil::DebugMapObject>> &seq) {\n  return seq.size();\n}\n\ndsymutil::DebugMapObject &\nSequenceTraits<std::vector<std::unique_ptr<dsymutil::DebugMapObject>>>::element(\n    IO &, std::vector<std::unique_ptr<dsymutil::DebugMapObject>> &seq,\n    size_t index) {\n  if (index >= seq.size()) {\n    seq.resize(index + 1);\n    seq[index].reset(new dsymutil::DebugMapObject);\n  }\n  return *seq[index];\n}\n\nvoid MappingTraits<dsymutil::DebugMap>::mapping(IO &io,\n                                                dsymutil::DebugMap &DM) {\n  io.mapRequired(\"triple\", DM.BinaryTriple);\n  io.mapOptional(\"objects\", DM.Objects);\n  if (void *Ctxt = io.getContext())\n    reinterpret_cast<YAMLContext *>(Ctxt)->BinaryTriple = DM.BinaryTriple;\n}\n\nvoid MappingTraits<std::unique_ptr<dsymutil::DebugMap>>::mapping(\n    IO &io, std::unique_ptr<dsymutil::DebugMap> &DM) {\n  if (!DM)\n    DM.reset(new DebugMap());\n  io.mapRequired(\"triple\", DM->BinaryTriple);\n  io.mapOptional(\"objects\", DM->Objects);\n  if (void *Ctxt = io.getContext())\n    reinterpret_cast<YAMLContext *>(Ctxt)->BinaryTriple = DM->BinaryTriple;\n}\n\nMappingTraits<dsymutil::DebugMapObject>::YamlDMO::YamlDMO(\n    IO &io, dsymutil::DebugMapObject &Obj) {\n  Filename = Obj.Filename;\n  Entries.reserve(Obj.Symbols.size());\n  for (auto &Entry : Obj.Symbols)\n    Entries.push_back(std::make_pair(Entry.getKey(), Entry.getValue()));\n}\n\ndsymutil::DebugMapObject\nMappingTraits<dsymutil::DebugMapObject>::YamlDMO::denormalize(IO &IO) {\n  BinaryHolder BinHolder(\/* Verbose =*\/false);\n  const auto &Ctxt = *reinterpret_cast<YAMLContext *>(IO.getContext());\n  SmallString<80> Path(Ctxt.PrependPath);\n  StringMap<uint64_t> SymbolAddresses;\n\n  sys::path::append(Path, Filename);\n  auto ErrOrObjectFile = BinHolder.GetObjectFile(Path);\n  if (auto EC = ErrOrObjectFile.getError()) {\n    llvm::errs() << \"warning: Unable to open \" << Path << \" \" << EC.message()\n                 << '\\n';\n  } else {\n    \/\/ Rewrite the object file symbol addresses in the debug map. The\n    \/\/ YAML input is mainly used to test llvm-dsymutil without\n    \/\/ requiring binaries checked-in. If we generate the object files\n    \/\/ during the test, we can't hardcode the symbols addresses, so\n    \/\/ look them up here and rewrite them.\n    for (const auto &Sym : ErrOrObjectFile->symbols()) {\n      StringRef Name;\n      uint64_t Address;\n      if (Sym.getName(Name) || Sym.getAddress(Address))\n        continue;\n      SymbolAddresses[Name] = Address;\n    }\n  }\n\n  dsymutil::DebugMapObject Res(Path);\n  for (auto &Entry : Entries) {\n    auto &Mapping = Entry.second;\n    uint64_t ObjAddress = Mapping.ObjectAddress;\n    auto AddressIt = SymbolAddresses.find(Entry.first);\n    if (AddressIt != SymbolAddresses.end())\n      ObjAddress = AddressIt->getValue();\n    Res.addSymbol(Entry.first, ObjAddress, Mapping.BinaryAddress, Mapping.Size);\n  }\n  return Res;\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-EDDisassembler.cpp - LLVM Enhanced Disassembler ---------------------===\/\/\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 Enhanced Disassembly library's  disassembler class.\n\/\/ The disassembler is responsible for vending individual instructions according\n\/\/ to a given architecture and disassembly syntax.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/MC\/MCAsmInfo.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/MCDisassembler.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCInst.h\"\n#include \"llvm\/MC\/MCInstPrinter.h\"\n#include \"llvm\/MC\/MCStreamer.h\"\n#include \"llvm\/MC\/MCParser\/AsmLexer.h\"\n#include \"llvm\/MC\/MCParser\/AsmParser.h\"\n#include \"llvm\/MC\/MCParser\/MCAsmParser.h\"\n#include \"llvm\/MC\/MCParser\/MCParsedAsmOperand.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/MemoryObject.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Target\/TargetAsmLexer.h\"\n#include \"llvm\/Target\/TargetAsmParser.h\"\n#include \"llvm\/Target\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Target\/TargetSelect.h\"\n\n#include \"EDDisassembler.h\"\n#include \"EDInst.h\"\n\n#include \"..\/..\/lib\/Target\/X86\/X86GenEDInfo.inc\"\n\nusing namespace llvm;\n\nbool EDDisassembler::sInitialized = false;\nEDDisassembler::DisassemblerMap_t EDDisassembler::sDisassemblers;\n\nstruct InfoMap {\n  Triple::ArchType Arch;\n  const char *String;\n  const InstInfo *Info;\n};\n\nstatic struct InfoMap infomap[] = {\n  { Triple::x86,          \"i386-unknown-unknown\",   instInfoX86 },\n  { Triple::x86_64,       \"x86_64-unknown-unknown\", instInfoX86 },\n  { Triple::InvalidArch,  NULL,                     NULL        }\n};\n\n\/\/\/ infoFromArch - Returns the InfoMap corresponding to a given architecture,\n\/\/\/   or NULL if there is an error\n\/\/\/\n\/\/\/ @arg arch - The Triple::ArchType for the desired architecture\nstatic const InfoMap *infoFromArch(Triple::ArchType arch) {\n  unsigned int infoIndex;\n  \n  for (infoIndex = 0; infomap[infoIndex].String != NULL; ++infoIndex) {\n    if(arch == infomap[infoIndex].Arch)\n      return &infomap[infoIndex];\n  }\n  \n  return NULL;\n}\n\n\/\/\/ getLLVMSyntaxVariant - gets the constant to use to get an assembly printer\n\/\/\/   for the desired assembly syntax, suitable for passing to \n\/\/\/   Target::createMCInstPrinter()\n\/\/\/\n\/\/\/ @arg arch   - The target architecture\n\/\/\/ @arg syntax - The assembly syntax in sd form\nstatic int getLLVMSyntaxVariant(Triple::ArchType arch,\n                                EDAssemblySyntax_t syntax) {\n  switch (syntax) {\n  default:\n    return -1;\n  \/\/ Mappings below from X86AsmPrinter.cpp\n  case kEDAssemblySyntaxX86ATT:\n    if (arch == Triple::x86 || arch == Triple::x86_64)\n      return 0;\n    else\n      return -1;\n  case kEDAssemblySyntaxX86Intel:\n    if (arch == Triple::x86 || arch == Triple::x86_64)\n      return 1;\n    else\n      return -1;\n  }\n}\n\n#define BRINGUP_TARGET(tgt)           \\\n  LLVMInitialize##tgt##TargetInfo();  \\\n  LLVMInitialize##tgt##Target();      \\\n  LLVMInitialize##tgt##AsmPrinter();  \\\n  LLVMInitialize##tgt##AsmParser();   \\\n  LLVMInitialize##tgt##Disassembler();\n\nvoid EDDisassembler::initialize() {\n  if (sInitialized)\n    return;\n  \n  sInitialized = true;\n  \n  BRINGUP_TARGET(X86)\n}\n\n#undef BRINGUP_TARGET\n\nEDDisassembler *EDDisassembler::getDisassembler(Triple::ArchType arch,\n                                                EDAssemblySyntax_t syntax) {\n  CPUKey key;\n  key.Arch = arch;\n  key.Syntax = syntax;\n  \n  EDDisassembler::DisassemblerMap_t::iterator i = sDisassemblers.find(key);\n  \n  if (i != sDisassemblers.end()) {\n    return i->second;\n  }\n  else {\n    EDDisassembler* sdd = new EDDisassembler(key);\n    if(!sdd->valid()) {\n      delete sdd;\n      return NULL;\n    }\n    \n    sDisassemblers[key] = sdd;\n    \n    return sdd;\n  }\n  \n  return NULL;\n}\n\nEDDisassembler *EDDisassembler::getDisassembler(StringRef str,\n                                                EDAssemblySyntax_t syntax) {\n  Triple triple(str);\n  \n  return getDisassembler(triple.getArch(), syntax);\n}\n\nnamespace {\n  class EDAsmParser : public MCAsmParser {\n    AsmLexer Lexer;\n    MCContext Context;\n    OwningPtr<MCStreamer> Streamer;\n  public:\n    \/\/ Mandatory functions\n    EDAsmParser(const MCAsmInfo &MAI) : Lexer(MAI) {\n      Streamer.reset(createNullStreamer(Context));\n    }\n    virtual ~EDAsmParser() { }\n    MCAsmLexer &getLexer() { return Lexer; }\n    MCContext &getContext() { return Context; }\n    MCStreamer &getStreamer() { return *Streamer; }\n    void Warning(SMLoc L, const Twine &Msg) { }\n    bool Error(SMLoc L, const Twine &Msg) { return true; }\n    const AsmToken &Lex() { return Lexer.Lex(); }\n    bool ParseExpression(const MCExpr *&Res, SMLoc &EndLoc) {\n      AsmToken token = Lex();\n      if(token.isNot(AsmToken::Integer))\n        return true;\n      Res = MCConstantExpr::Create(token.getIntVal(), Context);\n      return false;\n    }\n    bool ParseParenExpression(const MCExpr *&Res, SMLoc &EndLoc) {\n      assert(0 && \"I can't ParseParenExpression()s!\");\n    }\n    bool ParseAbsoluteExpression(int64_t &Res) {\n      assert(0 && \"I can't ParseAbsoluteExpression()s!\");\n    }\n    \n    \/\/\/ setBuffer - loads a buffer into the parser\n    \/\/\/ @arg buf  - The buffer to read tokens from\n    void setBuffer(const MemoryBuffer &buf) { Lexer.setBuffer(&buf); }\n    \/\/\/ parseInstName - When the lexer is positioned befor an instruction\n    \/\/\/   name (with possible intervening whitespace), reads past the name,\n    \/\/\/   returning 0 on success and -1 on failure\n    \/\/\/ @arg name - A reference to a string that is filled in with the\n    \/\/\/             instruction name\n    \/\/\/ @arg loc  - A reference to a location that is filled in with the\n    \/\/\/             position of the instruction name\n    int parseInstName(StringRef &name, SMLoc &loc) {\n      AsmToken tok = Lexer.Lex();\n      if(tok.isNot(AsmToken::Identifier)) {\n        return -1;\n      }\n      name = tok.getString();\n      loc = tok.getLoc();\n      return 0;\n    }\n  };\n}\n\nEDDisassembler::EDDisassembler(CPUKey &key) : \n  Valid(false), ErrorString(), ErrorStream(ErrorString), Key(key) {\n  const InfoMap *infoMap = infoFromArch(key.Arch);\n  \n  if (!infoMap)\n    return;\n  \n  const char *triple = infoMap->String;\n  \n  int syntaxVariant = getLLVMSyntaxVariant(key.Arch, key.Syntax);\n  \n  if (syntaxVariant < 0)\n    return;\n  \n  std::string tripleString(triple);\n  std::string errorString;\n  \n  Tgt = TargetRegistry::lookupTarget(tripleString, \n                                     errorString);\n  \n  if (!Tgt)\n    return;\n  \n  std::string featureString;\n  \n  OwningPtr<const TargetMachine>\n    targetMachine(Tgt->createTargetMachine(tripleString,\n                                           featureString));\n  \n  const TargetRegisterInfo *registerInfo = targetMachine->getRegisterInfo();\n  \n  if (!registerInfo)\n    return;\n  \n  AsmInfo.reset(Tgt->createAsmInfo(tripleString));\n  \n  if (!AsmInfo)\n    return;\n  \n  Disassembler.reset(Tgt->createMCDisassembler());\n  \n  if (!Disassembler)\n    return;\n  \n  InstString.reset(new std::string);\n  InstStream.reset(new raw_string_ostream(*InstString));\n  \n  InstPrinter.reset(Tgt->createMCInstPrinter(syntaxVariant,\n                                                *AsmInfo,\n                                                *InstStream));\n  \n  if (!InstPrinter)\n    return;\n    \n  GenericAsmLexer.reset(new AsmLexer(*AsmInfo));\n  SpecificAsmLexer.reset(Tgt->createAsmLexer(*AsmInfo));\n  SpecificAsmLexer->InstallLexer(*GenericAsmLexer);\n                          \n  InstInfos = infoMap->Info;\n    \n  Valid = true;\n}\n\nEDDisassembler::~EDDisassembler() {\n  if(!valid())\n    return;\n}\n\nnamespace {\n  \/\/\/ EDMemoryObject - a subclass of MemoryObject that allows use of a callback\n  \/\/\/   as provided by the sd interface.  See MemoryObject.\n  class EDMemoryObject : public llvm::MemoryObject {\n  private:\n    EDByteReaderCallback Callback;\n    void *Arg;\n  public:\n    EDMemoryObject(EDByteReaderCallback callback,\n                   void *arg) : Callback(callback), Arg(arg) { }\n    ~EDMemoryObject() { }\n    uint64_t getBase() const { return 0x0; }\n    uint64_t getExtent() const { return (uint64_t)-1; }\n    int readByte(uint64_t address, uint8_t *ptr) const {\n      if(!Callback)\n        return -1;\n      \n      if(Callback(ptr, address, Arg))\n        return -1;\n      \n      return 0;\n    }\n  };\n}\n\nEDInst *EDDisassembler::createInst(EDByteReaderCallback byteReader, \n                                   uint64_t address, \n                                   void *arg) {\n  EDMemoryObject memoryObject(byteReader, arg);\n  \n  MCInst* inst = new MCInst;\n  uint64_t byteSize;\n  \n  if (!Disassembler->getInstruction(*inst,\n                                    byteSize,\n                                    memoryObject,\n                                    address,\n                                    ErrorStream)) {\n    delete inst;\n    return NULL;\n  }\n  else {\n    const InstInfo *thisInstInfo = &InstInfos[inst->getOpcode()];\n    \n    EDInst* sdInst = new EDInst(inst, byteSize, *this, thisInstInfo);\n    return sdInst;\n  }\n}\n\nvoid EDDisassembler::initMaps(const TargetRegisterInfo &registerInfo) {\n  unsigned numRegisters = registerInfo.getNumRegs();\n  unsigned registerIndex;\n  \n  for (registerIndex = 0; registerIndex < numRegisters; ++registerIndex) {\n    const char* registerName = registerInfo.get(registerIndex).Name;\n    \n    RegVec.push_back(registerName);\n    RegRMap[registerName] = registerIndex;\n  }\n  \n  if (Key.Arch == Triple::x86 ||\n      Key.Arch == Triple::x86_64) {\n    stackPointers.insert(registerIDWithName(\"SP\"));\n    stackPointers.insert(registerIDWithName(\"ESP\"));\n    stackPointers.insert(registerIDWithName(\"RSP\"));\n    \n    programCounters.insert(registerIDWithName(\"IP\"));\n    programCounters.insert(registerIDWithName(\"EIP\"));\n    programCounters.insert(registerIDWithName(\"RIP\"));\n  }\n}\n\nconst char *EDDisassembler::nameWithRegisterID(unsigned registerID) const {\n  if (registerID >= RegVec.size())\n    return NULL;\n  else\n    return RegVec[registerID].c_str();\n}\n\nunsigned EDDisassembler::registerIDWithName(const char *name) const {\n  regrmap_t::const_iterator iter = RegRMap.find(std::string(name));\n  if (iter == RegRMap.end())\n    return 0;\n  else\n    return (*iter).second;\n}\n\nbool EDDisassembler::registerIsStackPointer(unsigned registerID) {\n  return (stackPointers.find(registerID) != stackPointers.end());\n}\n\nbool EDDisassembler::registerIsProgramCounter(unsigned registerID) {\n  return (programCounters.find(registerID) != programCounters.end());\n}\n\nint EDDisassembler::printInst(std::string& str,\n                              MCInst& inst) {\n  PrinterMutex.acquire();\n  \n  InstPrinter->printInst(&inst);\n  InstStream->flush();\n  str = *InstString;\n  InstString->clear();\n  \n  PrinterMutex.release();\n  \n  return 0;\n}\n\nint EDDisassembler::parseInst(SmallVectorImpl<MCParsedAsmOperand*> &operands,\n                              SmallVectorImpl<AsmToken> &tokens,\n                              const std::string &str) {\n  int ret = 0;\n  \n  const char *cStr = str.c_str();\n  MemoryBuffer *buf = MemoryBuffer::getMemBuffer(cStr, cStr + strlen(cStr));\n  \n  StringRef instName;\n  SMLoc instLoc;\n  \n  SourceMgr sourceMgr;\n  sourceMgr.AddNewSourceBuffer(buf, SMLoc()); \/\/ ownership of buf handed over\n  MCContext context;\n  OwningPtr<MCStreamer> streamer\n    (createNullStreamer(context));\n  AsmParser genericParser(sourceMgr, context, *streamer, *AsmInfo);\n  OwningPtr<TargetAsmParser> specificParser\n    (Tgt->createAsmParser(genericParser));\n  \n  AsmToken OpcodeToken = genericParser.Lex();\n  \n  if(OpcodeToken.is(AsmToken::Identifier)) {\n    instName = OpcodeToken.getString();\n    instLoc = OpcodeToken.getLoc();\n    if (specificParser->ParseInstruction(instName, instLoc, operands))\n      ret = -1;\n  }\n  else {\n    ret = -1;\n  }\n  \n  SmallVectorImpl<MCParsedAsmOperand*>::iterator oi;\n  \n  for(oi = operands.begin(); oi != operands.end(); ++oi) {\n    printf(\"Operand start %p, end %p\\n\", \n           (*oi)->getStartLoc().getPointer(),\n           (*oi)->getEndLoc().getPointer());\n  }\n  \n  ParserMutex.acquire();\n  \n  if (!ret) {\n    GenericAsmLexer->setBuffer(buf);\n  \n    while (SpecificAsmLexer->Lex(),\n           SpecificAsmLexer->isNot(AsmToken::Eof) &&\n           SpecificAsmLexer->isNot(AsmToken::EndOfStatement)) {\n      if (SpecificAsmLexer->is(AsmToken::Error)) {\n        ret = -1;\n        break;\n      }\n      tokens.push_back(SpecificAsmLexer->getTok());\n    }\n  }\n\n  ParserMutex.release();\n  \n  return ret;\n}\n\nint EDDisassembler::llvmSyntaxVariant() const {\n  return LLVMSyntaxVariant;\n}\n<commit_msg>Whoops, left some debugging code in that broke a buildbot.  Removed.<commit_after>\/\/===-EDDisassembler.cpp - LLVM Enhanced Disassembler ---------------------===\/\/\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 Enhanced Disassembly library's  disassembler class.\n\/\/ The disassembler is responsible for vending individual instructions according\n\/\/ to a given architecture and disassembly syntax.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/MC\/MCAsmInfo.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/MCDisassembler.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCInst.h\"\n#include \"llvm\/MC\/MCInstPrinter.h\"\n#include \"llvm\/MC\/MCStreamer.h\"\n#include \"llvm\/MC\/MCParser\/AsmLexer.h\"\n#include \"llvm\/MC\/MCParser\/AsmParser.h\"\n#include \"llvm\/MC\/MCParser\/MCAsmParser.h\"\n#include \"llvm\/MC\/MCParser\/MCParsedAsmOperand.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/MemoryObject.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Target\/TargetAsmLexer.h\"\n#include \"llvm\/Target\/TargetAsmParser.h\"\n#include \"llvm\/Target\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Target\/TargetSelect.h\"\n\n#include \"EDDisassembler.h\"\n#include \"EDInst.h\"\n\n#include \"..\/..\/lib\/Target\/X86\/X86GenEDInfo.inc\"\n\nusing namespace llvm;\n\nbool EDDisassembler::sInitialized = false;\nEDDisassembler::DisassemblerMap_t EDDisassembler::sDisassemblers;\n\nstruct InfoMap {\n  Triple::ArchType Arch;\n  const char *String;\n  const InstInfo *Info;\n};\n\nstatic struct InfoMap infomap[] = {\n  { Triple::x86,          \"i386-unknown-unknown\",   instInfoX86 },\n  { Triple::x86_64,       \"x86_64-unknown-unknown\", instInfoX86 },\n  { Triple::InvalidArch,  NULL,                     NULL        }\n};\n\n\/\/\/ infoFromArch - Returns the InfoMap corresponding to a given architecture,\n\/\/\/   or NULL if there is an error\n\/\/\/\n\/\/\/ @arg arch - The Triple::ArchType for the desired architecture\nstatic const InfoMap *infoFromArch(Triple::ArchType arch) {\n  unsigned int infoIndex;\n  \n  for (infoIndex = 0; infomap[infoIndex].String != NULL; ++infoIndex) {\n    if(arch == infomap[infoIndex].Arch)\n      return &infomap[infoIndex];\n  }\n  \n  return NULL;\n}\n\n\/\/\/ getLLVMSyntaxVariant - gets the constant to use to get an assembly printer\n\/\/\/   for the desired assembly syntax, suitable for passing to \n\/\/\/   Target::createMCInstPrinter()\n\/\/\/\n\/\/\/ @arg arch   - The target architecture\n\/\/\/ @arg syntax - The assembly syntax in sd form\nstatic int getLLVMSyntaxVariant(Triple::ArchType arch,\n                                EDAssemblySyntax_t syntax) {\n  switch (syntax) {\n  default:\n    return -1;\n  \/\/ Mappings below from X86AsmPrinter.cpp\n  case kEDAssemblySyntaxX86ATT:\n    if (arch == Triple::x86 || arch == Triple::x86_64)\n      return 0;\n    else\n      return -1;\n  case kEDAssemblySyntaxX86Intel:\n    if (arch == Triple::x86 || arch == Triple::x86_64)\n      return 1;\n    else\n      return -1;\n  }\n}\n\n#define BRINGUP_TARGET(tgt)           \\\n  LLVMInitialize##tgt##TargetInfo();  \\\n  LLVMInitialize##tgt##Target();      \\\n  LLVMInitialize##tgt##AsmPrinter();  \\\n  LLVMInitialize##tgt##AsmParser();   \\\n  LLVMInitialize##tgt##Disassembler();\n\nvoid EDDisassembler::initialize() {\n  if (sInitialized)\n    return;\n  \n  sInitialized = true;\n  \n  BRINGUP_TARGET(X86)\n}\n\n#undef BRINGUP_TARGET\n\nEDDisassembler *EDDisassembler::getDisassembler(Triple::ArchType arch,\n                                                EDAssemblySyntax_t syntax) {\n  CPUKey key;\n  key.Arch = arch;\n  key.Syntax = syntax;\n  \n  EDDisassembler::DisassemblerMap_t::iterator i = sDisassemblers.find(key);\n  \n  if (i != sDisassemblers.end()) {\n    return i->second;\n  }\n  else {\n    EDDisassembler* sdd = new EDDisassembler(key);\n    if(!sdd->valid()) {\n      delete sdd;\n      return NULL;\n    }\n    \n    sDisassemblers[key] = sdd;\n    \n    return sdd;\n  }\n  \n  return NULL;\n}\n\nEDDisassembler *EDDisassembler::getDisassembler(StringRef str,\n                                                EDAssemblySyntax_t syntax) {\n  Triple triple(str);\n  \n  return getDisassembler(triple.getArch(), syntax);\n}\n\nnamespace {\n  class EDAsmParser : public MCAsmParser {\n    AsmLexer Lexer;\n    MCContext Context;\n    OwningPtr<MCStreamer> Streamer;\n  public:\n    \/\/ Mandatory functions\n    EDAsmParser(const MCAsmInfo &MAI) : Lexer(MAI) {\n      Streamer.reset(createNullStreamer(Context));\n    }\n    virtual ~EDAsmParser() { }\n    MCAsmLexer &getLexer() { return Lexer; }\n    MCContext &getContext() { return Context; }\n    MCStreamer &getStreamer() { return *Streamer; }\n    void Warning(SMLoc L, const Twine &Msg) { }\n    bool Error(SMLoc L, const Twine &Msg) { return true; }\n    const AsmToken &Lex() { return Lexer.Lex(); }\n    bool ParseExpression(const MCExpr *&Res, SMLoc &EndLoc) {\n      AsmToken token = Lex();\n      if(token.isNot(AsmToken::Integer))\n        return true;\n      Res = MCConstantExpr::Create(token.getIntVal(), Context);\n      return false;\n    }\n    bool ParseParenExpression(const MCExpr *&Res, SMLoc &EndLoc) {\n      assert(0 && \"I can't ParseParenExpression()s!\");\n    }\n    bool ParseAbsoluteExpression(int64_t &Res) {\n      assert(0 && \"I can't ParseAbsoluteExpression()s!\");\n    }\n    \n    \/\/\/ setBuffer - loads a buffer into the parser\n    \/\/\/ @arg buf  - The buffer to read tokens from\n    void setBuffer(const MemoryBuffer &buf) { Lexer.setBuffer(&buf); }\n    \/\/\/ parseInstName - When the lexer is positioned befor an instruction\n    \/\/\/   name (with possible intervening whitespace), reads past the name,\n    \/\/\/   returning 0 on success and -1 on failure\n    \/\/\/ @arg name - A reference to a string that is filled in with the\n    \/\/\/             instruction name\n    \/\/\/ @arg loc  - A reference to a location that is filled in with the\n    \/\/\/             position of the instruction name\n    int parseInstName(StringRef &name, SMLoc &loc) {\n      AsmToken tok = Lexer.Lex();\n      if(tok.isNot(AsmToken::Identifier)) {\n        return -1;\n      }\n      name = tok.getString();\n      loc = tok.getLoc();\n      return 0;\n    }\n  };\n}\n\nEDDisassembler::EDDisassembler(CPUKey &key) : \n  Valid(false), ErrorString(), ErrorStream(ErrorString), Key(key) {\n  const InfoMap *infoMap = infoFromArch(key.Arch);\n  \n  if (!infoMap)\n    return;\n  \n  const char *triple = infoMap->String;\n  \n  int syntaxVariant = getLLVMSyntaxVariant(key.Arch, key.Syntax);\n  \n  if (syntaxVariant < 0)\n    return;\n  \n  std::string tripleString(triple);\n  std::string errorString;\n  \n  Tgt = TargetRegistry::lookupTarget(tripleString, \n                                     errorString);\n  \n  if (!Tgt)\n    return;\n  \n  std::string featureString;\n  \n  OwningPtr<const TargetMachine>\n    targetMachine(Tgt->createTargetMachine(tripleString,\n                                           featureString));\n  \n  const TargetRegisterInfo *registerInfo = targetMachine->getRegisterInfo();\n  \n  if (!registerInfo)\n    return;\n  \n  AsmInfo.reset(Tgt->createAsmInfo(tripleString));\n  \n  if (!AsmInfo)\n    return;\n  \n  Disassembler.reset(Tgt->createMCDisassembler());\n  \n  if (!Disassembler)\n    return;\n  \n  InstString.reset(new std::string);\n  InstStream.reset(new raw_string_ostream(*InstString));\n  \n  InstPrinter.reset(Tgt->createMCInstPrinter(syntaxVariant,\n                                                *AsmInfo,\n                                                *InstStream));\n  \n  if (!InstPrinter)\n    return;\n    \n  GenericAsmLexer.reset(new AsmLexer(*AsmInfo));\n  SpecificAsmLexer.reset(Tgt->createAsmLexer(*AsmInfo));\n  SpecificAsmLexer->InstallLexer(*GenericAsmLexer);\n                          \n  InstInfos = infoMap->Info;\n    \n  Valid = true;\n}\n\nEDDisassembler::~EDDisassembler() {\n  if(!valid())\n    return;\n}\n\nnamespace {\n  \/\/\/ EDMemoryObject - a subclass of MemoryObject that allows use of a callback\n  \/\/\/   as provided by the sd interface.  See MemoryObject.\n  class EDMemoryObject : public llvm::MemoryObject {\n  private:\n    EDByteReaderCallback Callback;\n    void *Arg;\n  public:\n    EDMemoryObject(EDByteReaderCallback callback,\n                   void *arg) : Callback(callback), Arg(arg) { }\n    ~EDMemoryObject() { }\n    uint64_t getBase() const { return 0x0; }\n    uint64_t getExtent() const { return (uint64_t)-1; }\n    int readByte(uint64_t address, uint8_t *ptr) const {\n      if(!Callback)\n        return -1;\n      \n      if(Callback(ptr, address, Arg))\n        return -1;\n      \n      return 0;\n    }\n  };\n}\n\nEDInst *EDDisassembler::createInst(EDByteReaderCallback byteReader, \n                                   uint64_t address, \n                                   void *arg) {\n  EDMemoryObject memoryObject(byteReader, arg);\n  \n  MCInst* inst = new MCInst;\n  uint64_t byteSize;\n  \n  if (!Disassembler->getInstruction(*inst,\n                                    byteSize,\n                                    memoryObject,\n                                    address,\n                                    ErrorStream)) {\n    delete inst;\n    return NULL;\n  }\n  else {\n    const InstInfo *thisInstInfo = &InstInfos[inst->getOpcode()];\n    \n    EDInst* sdInst = new EDInst(inst, byteSize, *this, thisInstInfo);\n    return sdInst;\n  }\n}\n\nvoid EDDisassembler::initMaps(const TargetRegisterInfo &registerInfo) {\n  unsigned numRegisters = registerInfo.getNumRegs();\n  unsigned registerIndex;\n  \n  for (registerIndex = 0; registerIndex < numRegisters; ++registerIndex) {\n    const char* registerName = registerInfo.get(registerIndex).Name;\n    \n    RegVec.push_back(registerName);\n    RegRMap[registerName] = registerIndex;\n  }\n  \n  if (Key.Arch == Triple::x86 ||\n      Key.Arch == Triple::x86_64) {\n    stackPointers.insert(registerIDWithName(\"SP\"));\n    stackPointers.insert(registerIDWithName(\"ESP\"));\n    stackPointers.insert(registerIDWithName(\"RSP\"));\n    \n    programCounters.insert(registerIDWithName(\"IP\"));\n    programCounters.insert(registerIDWithName(\"EIP\"));\n    programCounters.insert(registerIDWithName(\"RIP\"));\n  }\n}\n\nconst char *EDDisassembler::nameWithRegisterID(unsigned registerID) const {\n  if (registerID >= RegVec.size())\n    return NULL;\n  else\n    return RegVec[registerID].c_str();\n}\n\nunsigned EDDisassembler::registerIDWithName(const char *name) const {\n  regrmap_t::const_iterator iter = RegRMap.find(std::string(name));\n  if (iter == RegRMap.end())\n    return 0;\n  else\n    return (*iter).second;\n}\n\nbool EDDisassembler::registerIsStackPointer(unsigned registerID) {\n  return (stackPointers.find(registerID) != stackPointers.end());\n}\n\nbool EDDisassembler::registerIsProgramCounter(unsigned registerID) {\n  return (programCounters.find(registerID) != programCounters.end());\n}\n\nint EDDisassembler::printInst(std::string& str,\n                              MCInst& inst) {\n  PrinterMutex.acquire();\n  \n  InstPrinter->printInst(&inst);\n  InstStream->flush();\n  str = *InstString;\n  InstString->clear();\n  \n  PrinterMutex.release();\n  \n  return 0;\n}\n\nint EDDisassembler::parseInst(SmallVectorImpl<MCParsedAsmOperand*> &operands,\n                              SmallVectorImpl<AsmToken> &tokens,\n                              const std::string &str) {\n  int ret = 0;\n  \n  const char *cStr = str.c_str();\n  MemoryBuffer *buf = MemoryBuffer::getMemBuffer(cStr, cStr + strlen(cStr));\n  \n  StringRef instName;\n  SMLoc instLoc;\n  \n  SourceMgr sourceMgr;\n  sourceMgr.AddNewSourceBuffer(buf, SMLoc()); \/\/ ownership of buf handed over\n  MCContext context;\n  OwningPtr<MCStreamer> streamer\n    (createNullStreamer(context));\n  AsmParser genericParser(sourceMgr, context, *streamer, *AsmInfo);\n  OwningPtr<TargetAsmParser> specificParser\n    (Tgt->createAsmParser(genericParser));\n  \n  AsmToken OpcodeToken = genericParser.Lex();\n  \n  if(OpcodeToken.is(AsmToken::Identifier)) {\n    instName = OpcodeToken.getString();\n    instLoc = OpcodeToken.getLoc();\n    if (specificParser->ParseInstruction(instName, instLoc, operands))\n      ret = -1;\n  }\n  else {\n    ret = -1;\n  }\n  \n  ParserMutex.acquire();\n  \n  if (!ret) {\n    GenericAsmLexer->setBuffer(buf);\n  \n    while (SpecificAsmLexer->Lex(),\n           SpecificAsmLexer->isNot(AsmToken::Eof) &&\n           SpecificAsmLexer->isNot(AsmToken::EndOfStatement)) {\n      if (SpecificAsmLexer->is(AsmToken::Error)) {\n        ret = -1;\n        break;\n      }\n      tokens.push_back(SpecificAsmLexer->getTok());\n    }\n  }\n\n  ParserMutex.release();\n  \n  return ret;\n}\n\nint EDDisassembler::llvmSyntaxVariant() const {\n  return LLVMSyntaxVariant;\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: normal_estimation.cpp 1032 2011-05-18 22:43:27Z marton $\n *\n *\/\n\n#include <sensor_msgs\/PointCloud2.h>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/features\/normal_3d.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/console\/time.h>\n\nusing namespace pcl;\nusing namespace pcl::io;\nusing namespace pcl::console;\n\nint    default_k = 0;\ndouble default_radius = 0.0;\n\nvoid\nprintHelp (int argc, 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 (\"                     -radius X = use a radius of Xm around each point to determine the neighborhood (default: \"); \n  print_value (\"%f\", default_radius); print_info (\")\\n\");\n  print_info (\"                     -k X      = use a fixed number of X-nearest neighbors around each point (default: \"); \n  print_value (\"%f\", default_k); print_info (\")\\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 (\" seconds : \"); 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         int k, double radius)\n{\n  \/\/ Convert data to PointCloud<T>\n  PointCloud<PointXYZ>::Ptr xyz (new PointCloud<PointXYZ>);\n  fromROSMsg (*input, *xyz);\n\n  \/\/ Estimate\n  TicToc tt;\n  tt.tic ();\n  \n  print_highlight (stderr, \"Computing \");\n\n  NormalEstimation<pcl::PointXYZ, pcl::Normal> ne;\n  ne.setInputCloud (xyz);\n  ne.setSearchMethod (pcl::KdTreeFLANN<pcl::PointXYZ>::Ptr (new pcl::KdTreeFLANN<pcl::PointXYZ>));\n  ne.setKSearch (k);\n  ne.setRadiusSearch (radius);\n  \n  PointCloud<Normal> normals;\n  ne.compute (normals);\n\n  print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" seconds : \"); print_value (\"%d\", normals.width * normals.height); print_info (\" points]\\n\");\n\n  \/\/ Convert data back\n  sensor_msgs::PointCloud2 output_normals;\n  toROSMsg (normals, output_normals);\n  concatenateFields (*input, output_normals, 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);\n  \n  print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" seconds : \"); print_value (\"%d\", output.width * output.height); print_info (\" points]\\n\");\n}\n\n\/* ---[ *\/\nint\nmain (int argc, char** argv)\n{\n  print_info (\"Estimate surface normals using pcl::NormalEstimation. 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  int k = default_k;\n  double radius = default_radius;\n  parse_argument (argc, argv, \"-k\", k);\n  parse_argument (argc, argv, \"-radius\", radius);\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  \/\/ Perform the feature estimation\n  sensor_msgs::PointCloud2 output;\n  compute (cloud, output, k, radius);\n\n  \/\/ Save into the second file\n  saveCloud (argv[p_file_indices[1]], output);\n}\n\n<commit_msg>saving files as binary in the normal estimation PCL_TOOL<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: normal_estimation.cpp 1032 2011-05-18 22:43:27Z marton $\n *\n *\/\n\n#include <sensor_msgs\/PointCloud2.h>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/features\/normal_3d.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/console\/time.h>\n\nusing namespace pcl;\nusing namespace pcl::io;\nusing namespace pcl::console;\n\nint    default_k = 0;\ndouble default_radius = 0.0;\n\nEigen::Vector4f    translation;\nEigen::Quaternionf orientation;\n\nvoid\nprintHelp (int argc, 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 (\"                     -radius X = use a radius of Xm around each point to determine the neighborhood (default: \"); \n  print_value (\"%f\", default_radius); print_info (\")\\n\");\n  print_info (\"                     -k X      = use a fixed number of X-nearest neighbors around each point (default: \"); \n  print_value (\"%f\", default_k); print_info (\")\\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, translation, orientation) < 0)\n    return (false);\n  print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" seconds : \"); 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         int k, double radius)\n{\n  \/\/ Convert data to PointCloud<T>\n  PointCloud<PointXYZ>::Ptr xyz (new PointCloud<PointXYZ>);\n  fromROSMsg (*input, *xyz);\n\n  \/\/ Estimate\n  TicToc tt;\n  tt.tic ();\n  \n  print_highlight (stderr, \"Computing \");\n\n  NormalEstimation<pcl::PointXYZ, pcl::Normal> ne;\n  ne.setInputCloud (xyz);\n  ne.setSearchMethod (pcl::KdTreeFLANN<pcl::PointXYZ>::Ptr (new pcl::KdTreeFLANN<pcl::PointXYZ>));\n  ne.setKSearch (k);\n  ne.setRadiusSearch (radius);\n  \n  PointCloud<Normal> normals;\n  ne.compute (normals);\n\n  print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" seconds : \"); print_value (\"%d\", normals.width * normals.height); print_info (\" points]\\n\");\n\n  \/\/ Convert data back\n  sensor_msgs::PointCloud2 output_normals;\n  toROSMsg (normals, output_normals);\n  concatenateFields (*input, output_normals, 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, translation, orientation, true);\n  \n  print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" seconds : \"); print_value (\"%d\", output.width * output.height); print_info (\" points]\\n\");\n}\n\n\/* ---[ *\/\nint\nmain (int argc, char** argv)\n{\n  print_info (\"Estimate surface normals using pcl::NormalEstimation. 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  int k = default_k;\n  double radius = default_radius;\n  parse_argument (argc, argv, \"-k\", k);\n  parse_argument (argc, argv, \"-radius\", radius);\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  \/\/ Perform the feature estimation\n  sensor_msgs::PointCloud2 output;\n  compute (cloud, output, k, radius);\n\n  \/\/ Save into the second file\n  saveCloud (argv[p_file_indices[1]], output);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: errinf.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 14:31: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#include <limits.h>\n#include <shl.hxx>\n#include <debug.hxx>\n#include <errinf.hxx>\n#include <string.hxx>\n\nclass ErrorHandler;\n\nstruct EDcrData\n{\n  public:\n\n    ErrorHandler               *pFirstHdl;\n    ErrorContext               *pFirstCtx;\n    void                       *pDsp;\n    BOOL                       bIsWindowDsp;\n\n\n    DynamicErrorInfo            *ppDcr[ERRCODE_DYNAMIC_COUNT];\n    USHORT                      nNextDcr;\n                                EDcrData();\n\nstatic  EDcrData                *GetData();\n\n};\n\nclass EDcr_Impl\n{\n    ULONG                       lErrId;\n    USHORT                      nMask;\n\n    void                        RegisterEDcr(DynamicErrorInfo *);\n    void                        UnRegisterEDcr(DynamicErrorInfo *);\n    static ErrorInfo           *GetDynamicErrorInfo(ULONG lId);\n\nfriend class DynamicErrorInfo;\nfriend class ErrorInfo;\n};\n\n\nEDcrData::EDcrData()\n{\n    for(USHORT n=0;n<ERRCODE_DYNAMIC_COUNT;n++)\n        ppDcr[n]=0;\n    nNextDcr=0;\n    pFirstHdl=0;\n    pDsp=0;\n    pFirstCtx=0;\n}\n\n\nEDcrData *EDcrData::GetData()\n{\n#ifdef BOOTSTRAP\n    return 0x0;\n#else\n    EDcrData **ppDat=(EDcrData **)GetAppData(SHL_ERR);\n    if(!*ppDat)\n    {\n        return (*ppDat=new EDcrData);\n    }\n    else\n        return *ppDat;\n#endif\n}\n\nvoid EDcr_Impl::RegisterEDcr(DynamicErrorInfo *pDcr)\n{\n    \/\/Vergibt eine dynamische Id\n\n    EDcrData* pData=EDcrData::GetData();\n    lErrId= (((ULONG)pData->nNextDcr + 1) << ERRCODE_DYNAMIC_SHIFT) +\n        pDcr->GetErrorCode();\n    DynamicErrorInfo **ppDcr=pData->ppDcr;\n    USHORT nNext=pData->nNextDcr;\n\n    \/\/ bei einem Ringbuffer koennen wir uns das ASSERT wohl sparen!\n    \/\/ DBG_ASSERT(ppDcr[nNext]==0,\"ErrHdl: Alle Errors belegt\");\n    if(ppDcr[nNext])\n    {\n        delete ppDcr[nNext];\n    }\n    ppDcr[nNext]=pDcr;\n    if(++pData->nNextDcr>=ERRCODE_DYNAMIC_COUNT)\n        pData->nNextDcr=0;\n}\n\n\nvoid EDcr_Impl::UnRegisterEDcr(DynamicErrorInfo *pDcr)\n{\n\n    EDcrData* pData=EDcrData::GetData();\n    DynamicErrorInfo **ppDcr=pData->ppDcr;\n    ULONG lIdx=(\n        ((ULONG)(*pDcr) & ERRCODE_DYNAMIC_MASK)>>ERRCODE_DYNAMIC_SHIFT)-1;\n    DBG_ASSERT(ppDcr[lIdx]==pDcr,\"ErrHdl: Error nicht gefunden\");\n    if(ppDcr[lIdx]==pDcr)\n        ppDcr[lIdx]=0;\n}\n\nTYPEINIT0(ErrorInfo);\nTYPEINIT1(DynamicErrorInfo, ErrorInfo);\nTYPEINIT1(StandardErrorInfo, DynamicErrorInfo);\nTYPEINIT1(StringErrorInfo, DynamicErrorInfo);\nTYPEINIT1(TwoStringErrorInfo, DynamicErrorInfo);\nTYPEINIT1(MessageInfo, DynamicErrorInfo);\n\n\nErrorInfo *ErrorInfo::GetErrorInfo(ULONG lId)\n{\n    if(lId & ERRCODE_DYNAMIC_MASK)\n        return EDcr_Impl::GetDynamicErrorInfo(lId);\n    else\n        return new ErrorInfo(lId);\n}\n\nDynamicErrorInfo::operator ULONG() const\n{\n    return pImpl->lErrId;\n}\n\nDynamicErrorInfo::DynamicErrorInfo(ULONG lArgUserId, USHORT nMask)\n: ErrorInfo(lArgUserId)\n{\n    pImpl=new EDcr_Impl;\n    pImpl->RegisterEDcr(this);\n    pImpl->nMask=nMask;\n}\n\nDynamicErrorInfo::~DynamicErrorInfo()\n{\n    pImpl->UnRegisterEDcr(this);\n    delete pImpl;\n}\n\nErrorInfo* EDcr_Impl::GetDynamicErrorInfo(ULONG lId)\n{\n    ULONG lIdx=((lId & ERRCODE_DYNAMIC_MASK)>>ERRCODE_DYNAMIC_SHIFT)-1;\n    DynamicErrorInfo* pDcr=EDcrData::GetData()->ppDcr[lIdx];\n    if(pDcr && (ULONG)(*pDcr)==lId)\n        return pDcr;\n    else\n        return new ErrorInfo(lId & ~ERRCODE_DYNAMIC_MASK);\n}\n\n\nUSHORT DynamicErrorInfo::GetDialogMask() const\n{\n    return pImpl->nMask;\n}\n\n\nStandardErrorInfo::StandardErrorInfo(\n    ULONG lUserId, ULONG lArgExtId, USHORT nFlags)\n: DynamicErrorInfo(lUserId, nFlags), lExtId(lArgExtId)\n{\n}\n\n\nStringErrorInfo::StringErrorInfo(\n    ULONG lUserId, const String& aStringP,  USHORT nFlags)\n: DynamicErrorInfo(lUserId, nFlags), aString(aStringP)\n{\n}\n\n\nclass ErrHdl_Impl\n{\n  public:\n\n    ErrorHandler        *pNext;\n    static BOOL         CreateString(const ErrorHandler *pStart,\n                                     const ErrorInfo*, String&, USHORT&);\n};\n\n\nstatic void aDspFunc(const String &rErr, const String &rAction)\n{\n    ByteString aErr(\"Aktion: \");\n    aErr+= ByteString( rAction, RTL_TEXTENCODING_ASCII_US );\n    aErr+=\" Fehler: \";\n    aErr+= ByteString( rErr, RTL_TEXTENCODING_ASCII_US );\n    DBG_ERROR(aErr.GetBuffer());\n}\n\n\nErrorContext::ErrorContext(Window *pWinP)\n{\n    EDcrData *pData=EDcrData::GetData();\n    ErrorContext *&pHdl=pData->pFirstCtx;\n    pWin=pWinP;\n    pNext=pHdl;\n    pHdl=this;\n}\n\nErrorContext::~ErrorContext()\n{\n    ErrorContext **ppCtx=&(EDcrData::GetData()->pFirstCtx);\n    while(*ppCtx && *ppCtx!=this)\n        ppCtx=&((*ppCtx)->pNext);\n    if(*ppCtx)\n        *ppCtx=(*ppCtx)->pNext;\n}\n\nErrorContext *ErrorContext::GetContext()\n{\n    return EDcrData::GetData()->pFirstCtx;\n}\n\nErrorHandler::ErrorHandler()\n{\n    pImpl=new ErrHdl_Impl;\n    EDcrData *pData=EDcrData::GetData();\n    ErrorHandler *&pHdl=pData->pFirstHdl;\n    pImpl->pNext=pHdl;\n    pHdl=this;\n    if(!pData->pDsp)\n        RegisterDisplay(&aDspFunc);\n}\n\nErrorHandler::~ErrorHandler()\n{\n    ErrorHandler **ppHdl=&(EDcrData::GetData()->pFirstHdl);\n    while(*ppHdl && *ppHdl!=this)\n        ppHdl=&((*ppHdl)->pImpl->pNext);\n    if(*ppHdl)\n        *ppHdl=(*ppHdl)->pImpl->pNext;\n    delete pImpl;\n}\n\nvoid ErrorHandler::RegisterDisplay(WindowDisplayErrorFunc *aDsp)\n{\n    EDcrData *pData=EDcrData::GetData();\n    pData->bIsWindowDsp=TRUE;\n    pData->pDsp=(void*)aDsp;\n}\n\nvoid ErrorHandler::RegisterDisplay(BasicDisplayErrorFunc *aDsp)\n{\n    EDcrData *pData=EDcrData::GetData();\n    pData->bIsWindowDsp=FALSE;\n    pData->pDsp=(void*)aDsp;\n}\n\nUSHORT ErrorHandler::HandleError(ULONG lId, USHORT nFlags)\n{\n\n\/*  [Beschreibung]\n    Handelt einen Fehler ab. lId ist die FehlerId, nFlags sind die\n    ErrorFlags. Werden nFlags nicht abgegeben, so werden die in\n    der DynamicErrorInfo angegebenen Flags bzw. die aus der Resource\n    verwendet.\n\n    Also:\n\n    1. nFlags,\n    2. Resource Flags\n    3. Dynamic Flags\n    4. Default ERRCODE_BUTTON_OK, ERRCODE_MSG_ERROR\n\n\n    *\/\n\n    String aErr;\n    String aAction;\n    if(!lId || lId == ERRCODE_ABORT)\n        return 0;\n    EDcrData *pData=EDcrData::GetData();\n    ErrorInfo *pInfo=ErrorInfo::GetErrorInfo(lId);\n    ErrorContext *pCtx=ErrorContext::GetContext();\n    if(pCtx)\n        pCtx->GetString(pInfo->GetErrorCode(), aAction);\n    Window *pParent=0;\n    \/\/Nimm den Parent aus dem Konext\n    for(;pCtx;pCtx=pCtx->pNext)\n        if(pCtx->GetParent())\n        {\n            pParent=pCtx->GetParent();\n            break;\n        }\n\n    USHORT nErrFlags = ERRCODE_BUTTON_DEF_OK | ERRCODE_BUTTON_OK |\n        ERRCODE_MSG_ERROR;\n\n    DynamicErrorInfo* pDynPtr=PTR_CAST(DynamicErrorInfo,pInfo);\n    if(pDynPtr)\n    {\n        USHORT nDynFlags = pDynPtr->GetDialogMask();\n        if( nDynFlags )\n            nErrFlags = nDynFlags;\n    }\n\n    if(ErrHdl_Impl::CreateString(pData->pFirstHdl,pInfo,aErr,nErrFlags))\n    {\n        delete pInfo;\n        if(!pData->pDsp)\n        {\n\n            ByteString aStr(\"Action: \");\n            aStr += ByteString( aAction, RTL_TEXTENCODING_ASCII_US );\n            aStr += ByteString(\"\\nFehler: \");\n            aStr += ByteString( aErr, RTL_TEXTENCODING_ASCII_US );\n            DBG_ERROR( aStr.GetBuffer() );\n        }\n        else\n            if(!pData->bIsWindowDsp)\n            {\n                (*(BasicDisplayErrorFunc*)pData->pDsp)(aErr,aAction);\n                return 0;\n            }\n            else\n            {\n                if( nFlags != USHRT_MAX )\n                    nErrFlags = nFlags;\n                return (*(WindowDisplayErrorFunc*)pData->pDsp)(\n                    pParent, nErrFlags, aErr, aAction);\n            }\n    }\n\n    DBG_ERROR(\"Error nicht behandelt\");\n    \/\/ Error 1 ist General Error im Sfx\n    if(pInfo->GetErrorCode()!=1)\n        HandleError(1, USHRT_MAX);\n    else\n        DBG_ERROR(\"Error 1 nicht gehandeled\");\n    delete pInfo;\n    return 0;\n}\n\nBOOL ErrorHandler::ForwCreateString(const ErrorInfo* pInfo, String& rStr, USHORT &rFlags) const\n{\n    return ErrHdl_Impl::CreateString(this->pImpl->pNext, pInfo, rStr, rFlags);\n}\n\nBOOL ErrHdl_Impl::CreateString( const ErrorHandler *pStart,\n                                const ErrorInfo* pInfo, String& pStr,\n                               USHORT &rFlags)\n{\n    for(const ErrorHandler *pHdl=pStart;pHdl;pHdl=pHdl->pImpl->pNext)\n    {\n        if(pHdl->CreateString( pInfo, pStr, rFlags))\n            return TRUE;\n    }\n    return FALSE;\n}\n\nBOOL SimpleErrorHandler::CreateString(\n    const ErrorInfo *pInfo, String &rStr, USHORT &) const\n{\n    ULONG nId = pInfo->GetErrorCode();\n    ByteString aStr;\n    aStr=\"Id \";\n    aStr+=ByteString::CreateFromInt32(nId);\n    aStr+=\" only handled by SimpleErrorHandler\";\n    aStr+=\"\\nErrorCode: \";\n    aStr+=ByteString::CreateFromInt32(nId & ((1L <<  ERRCODE_CLASS_SHIFT)  - 1 ));\n    aStr+=\"\\nErrorClass: \";\n    aStr+=ByteString::CreateFromInt32((nId & ERRCODE_CLASS_MASK) >> ERRCODE_CLASS_SHIFT);\n    aStr+=\"\\nErrorArea: \";\n    aStr+=ByteString::CreateFromInt32((nId & ERRCODE_ERROR_MASK &\n            ~((1 << ERRCODE_AREA_SHIFT ) -1 ) ) >> ERRCODE_AREA_SHIFT);\n    DynamicErrorInfo *pDyn=PTR_CAST(DynamicErrorInfo,pInfo);\n    if(pDyn)\n    {\n        aStr+=\"\\nDId \";\n        aStr+=ByteString::CreateFromInt32((ULONG)*pDyn);\n    }\n    StandardErrorInfo *pStd=PTR_CAST(StandardErrorInfo,pInfo);\n    if(pStd)\n    {\n        aStr+=\"\\nXId \";\n        aStr+=ByteString::CreateFromInt32(pStd->GetExtendedErrorCode());\n    }\n    rStr = String( aStr, RTL_TEXTENCODING_ASCII_US );\n    return TRUE;\n}\n\nSimpleErrorHandler::SimpleErrorHandler()\n : ErrorHandler()\n{\n}\n\n<commit_msg>INTEGRATION: CWS c06 (1.1.1.1.436); FILE MERGED 2005\/09\/14 13:21:56 as 1.1.1.1.436.1: #i53536# use right icon for showing warnings<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: errinf.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-11-11 12:15: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 <limits.h>\n#include <shl.hxx>\n#include <debug.hxx>\n#include <errinf.hxx>\n#include <string.hxx>\n\nclass ErrorHandler;\n\nstruct EDcrData\n{\n  public:\n\n    ErrorHandler               *pFirstHdl;\n    ErrorContext               *pFirstCtx;\n    void                       *pDsp;\n    BOOL                       bIsWindowDsp;\n\n\n    DynamicErrorInfo            *ppDcr[ERRCODE_DYNAMIC_COUNT];\n    USHORT                      nNextDcr;\n                                EDcrData();\n\nstatic  EDcrData                *GetData();\n\n};\n\nclass EDcr_Impl\n{\n    ULONG                       lErrId;\n    USHORT                      nMask;\n\n    void                        RegisterEDcr(DynamicErrorInfo *);\n    void                        UnRegisterEDcr(DynamicErrorInfo *);\n    static ErrorInfo           *GetDynamicErrorInfo(ULONG lId);\n\nfriend class DynamicErrorInfo;\nfriend class ErrorInfo;\n};\n\n\nEDcrData::EDcrData()\n{\n    for(USHORT n=0;n<ERRCODE_DYNAMIC_COUNT;n++)\n        ppDcr[n]=0;\n    nNextDcr=0;\n    pFirstHdl=0;\n    pDsp=0;\n    pFirstCtx=0;\n}\n\n\nEDcrData *EDcrData::GetData()\n{\n#ifdef BOOTSTRAP\n    return 0x0;\n#else\n    EDcrData **ppDat=(EDcrData **)GetAppData(SHL_ERR);\n    if(!*ppDat)\n    {\n        return (*ppDat=new EDcrData);\n    }\n    else\n        return *ppDat;\n#endif\n}\n\nvoid EDcr_Impl::RegisterEDcr(DynamicErrorInfo *pDcr)\n{\n    \/\/Vergibt eine dynamische Id\n\n    EDcrData* pData=EDcrData::GetData();\n    lErrId= (((ULONG)pData->nNextDcr + 1) << ERRCODE_DYNAMIC_SHIFT) +\n        pDcr->GetErrorCode();\n    DynamicErrorInfo **ppDcr=pData->ppDcr;\n    USHORT nNext=pData->nNextDcr;\n\n    \/\/ bei einem Ringbuffer koennen wir uns das ASSERT wohl sparen!\n    \/\/ DBG_ASSERT(ppDcr[nNext]==0,\"ErrHdl: Alle Errors belegt\");\n    if(ppDcr[nNext])\n    {\n        delete ppDcr[nNext];\n    }\n    ppDcr[nNext]=pDcr;\n    if(++pData->nNextDcr>=ERRCODE_DYNAMIC_COUNT)\n        pData->nNextDcr=0;\n}\n\n\nvoid EDcr_Impl::UnRegisterEDcr(DynamicErrorInfo *pDcr)\n{\n\n    EDcrData* pData=EDcrData::GetData();\n    DynamicErrorInfo **ppDcr=pData->ppDcr;\n    ULONG lIdx=(\n        ((ULONG)(*pDcr) & ERRCODE_DYNAMIC_MASK)>>ERRCODE_DYNAMIC_SHIFT)-1;\n    DBG_ASSERT(ppDcr[lIdx]==pDcr,\"ErrHdl: Error nicht gefunden\");\n    if(ppDcr[lIdx]==pDcr)\n        ppDcr[lIdx]=0;\n}\n\nTYPEINIT0(ErrorInfo);\nTYPEINIT1(DynamicErrorInfo, ErrorInfo);\nTYPEINIT1(StandardErrorInfo, DynamicErrorInfo);\nTYPEINIT1(StringErrorInfo, DynamicErrorInfo);\nTYPEINIT1(TwoStringErrorInfo, DynamicErrorInfo);\nTYPEINIT1(MessageInfo, DynamicErrorInfo);\n\n\nErrorInfo *ErrorInfo::GetErrorInfo(ULONG lId)\n{\n    if(lId & ERRCODE_DYNAMIC_MASK)\n        return EDcr_Impl::GetDynamicErrorInfo(lId);\n    else\n        return new ErrorInfo(lId);\n}\n\nDynamicErrorInfo::operator ULONG() const\n{\n    return pImpl->lErrId;\n}\n\nDynamicErrorInfo::DynamicErrorInfo(ULONG lArgUserId, USHORT nMask)\n: ErrorInfo(lArgUserId)\n{\n    pImpl=new EDcr_Impl;\n    pImpl->RegisterEDcr(this);\n    pImpl->nMask=nMask;\n}\n\nDynamicErrorInfo::~DynamicErrorInfo()\n{\n    pImpl->UnRegisterEDcr(this);\n    delete pImpl;\n}\n\nErrorInfo* EDcr_Impl::GetDynamicErrorInfo(ULONG lId)\n{\n    ULONG lIdx=((lId & ERRCODE_DYNAMIC_MASK)>>ERRCODE_DYNAMIC_SHIFT)-1;\n    DynamicErrorInfo* pDcr=EDcrData::GetData()->ppDcr[lIdx];\n    if(pDcr && (ULONG)(*pDcr)==lId)\n        return pDcr;\n    else\n        return new ErrorInfo(lId & ~ERRCODE_DYNAMIC_MASK);\n}\n\n\nUSHORT DynamicErrorInfo::GetDialogMask() const\n{\n    return pImpl->nMask;\n}\n\n\nStandardErrorInfo::StandardErrorInfo(\n    ULONG lUserId, ULONG lArgExtId, USHORT nFlags)\n: DynamicErrorInfo(lUserId, nFlags), lExtId(lArgExtId)\n{\n}\n\n\nStringErrorInfo::StringErrorInfo(\n    ULONG lUserId, const String& aStringP,  USHORT nFlags)\n: DynamicErrorInfo(lUserId, nFlags), aString(aStringP)\n{\n}\n\n\nclass ErrHdl_Impl\n{\n  public:\n\n    ErrorHandler        *pNext;\n    static BOOL         CreateString(const ErrorHandler *pStart,\n                                     const ErrorInfo*, String&, USHORT&);\n};\n\n\nstatic void aDspFunc(const String &rErr, const String &rAction)\n{\n    ByteString aErr(\"Aktion: \");\n    aErr+= ByteString( rAction, RTL_TEXTENCODING_ASCII_US );\n    aErr+=\" Fehler: \";\n    aErr+= ByteString( rErr, RTL_TEXTENCODING_ASCII_US );\n    DBG_ERROR(aErr.GetBuffer());\n}\n\n\nErrorContext::ErrorContext(Window *pWinP)\n{\n    EDcrData *pData=EDcrData::GetData();\n    ErrorContext *&pHdl=pData->pFirstCtx;\n    pWin=pWinP;\n    pNext=pHdl;\n    pHdl=this;\n}\n\nErrorContext::~ErrorContext()\n{\n    ErrorContext **ppCtx=&(EDcrData::GetData()->pFirstCtx);\n    while(*ppCtx && *ppCtx!=this)\n        ppCtx=&((*ppCtx)->pNext);\n    if(*ppCtx)\n        *ppCtx=(*ppCtx)->pNext;\n}\n\nErrorContext *ErrorContext::GetContext()\n{\n    return EDcrData::GetData()->pFirstCtx;\n}\n\nErrorHandler::ErrorHandler()\n{\n    pImpl=new ErrHdl_Impl;\n    EDcrData *pData=EDcrData::GetData();\n    ErrorHandler *&pHdl=pData->pFirstHdl;\n    pImpl->pNext=pHdl;\n    pHdl=this;\n    if(!pData->pDsp)\n        RegisterDisplay(&aDspFunc);\n}\n\nErrorHandler::~ErrorHandler()\n{\n    ErrorHandler **ppHdl=&(EDcrData::GetData()->pFirstHdl);\n    while(*ppHdl && *ppHdl!=this)\n        ppHdl=&((*ppHdl)->pImpl->pNext);\n    if(*ppHdl)\n        *ppHdl=(*ppHdl)->pImpl->pNext;\n    delete pImpl;\n}\n\nvoid ErrorHandler::RegisterDisplay(WindowDisplayErrorFunc *aDsp)\n{\n    EDcrData *pData=EDcrData::GetData();\n    pData->bIsWindowDsp=TRUE;\n    pData->pDsp=(void*)aDsp;\n}\n\nvoid ErrorHandler::RegisterDisplay(BasicDisplayErrorFunc *aDsp)\n{\n    EDcrData *pData=EDcrData::GetData();\n    pData->bIsWindowDsp=FALSE;\n    pData->pDsp=(void*)aDsp;\n}\n\nUSHORT ErrorHandler::HandleError(ULONG lId, USHORT nFlags)\n{\n\n\/*  [Beschreibung]\n    Handelt einen Fehler ab. lId ist die FehlerId, nFlags sind die\n    ErrorFlags. Werden nFlags nicht abgegeben, so werden die in\n    der DynamicErrorInfo angegebenen Flags bzw. die aus der Resource\n    verwendet.\n\n    Also:\n\n    1. nFlags,\n    2. Resource Flags\n    3. Dynamic Flags\n    4. Default ERRCODE_BUTTON_OK, ERRCODE_MSG_ERROR\n\n\n    *\/\n\n    String aErr;\n    String aAction;\n    if(!lId || lId == ERRCODE_ABORT)\n        return 0;\n    EDcrData *pData=EDcrData::GetData();\n    ErrorInfo *pInfo=ErrorInfo::GetErrorInfo(lId);\n    ErrorContext *pCtx=ErrorContext::GetContext();\n    if(pCtx)\n        pCtx->GetString(pInfo->GetErrorCode(), aAction);\n    Window *pParent=0;\n    \/\/Nimm den Parent aus dem Konext\n    for(;pCtx;pCtx=pCtx->pNext)\n        if(pCtx->GetParent())\n        {\n            pParent=pCtx->GetParent();\n            break;\n        }\n\n    BOOL bWarning = ((lId & ERRCODE_WARNING_MASK) == ERRCODE_WARNING_MASK);\n    USHORT nErrFlags = ERRCODE_BUTTON_DEF_OK | ERRCODE_BUTTON_OK;\n    if (bWarning)\n        nErrFlags |= ERRCODE_MSG_WARNING;\n    else\n        nErrFlags |= ERRCODE_MSG_ERROR;\n\n    DynamicErrorInfo* pDynPtr=PTR_CAST(DynamicErrorInfo,pInfo);\n    if(pDynPtr)\n    {\n        USHORT nDynFlags = pDynPtr->GetDialogMask();\n        if( nDynFlags )\n            nErrFlags = nDynFlags;\n    }\n\n    if(ErrHdl_Impl::CreateString(pData->pFirstHdl,pInfo,aErr,nErrFlags))\n    {\n        delete pInfo;\n        if(!pData->pDsp)\n        {\n\n            ByteString aStr(\"Action: \");\n            aStr += ByteString( aAction, RTL_TEXTENCODING_ASCII_US );\n            aStr += ByteString(\"\\nFehler: \");\n            aStr += ByteString( aErr, RTL_TEXTENCODING_ASCII_US );\n            DBG_ERROR( aStr.GetBuffer() );\n        }\n        else\n            if(!pData->bIsWindowDsp)\n            {\n                (*(BasicDisplayErrorFunc*)pData->pDsp)(aErr,aAction);\n                return 0;\n            }\n            else\n            {\n                if( nFlags != USHRT_MAX )\n                    nErrFlags = nFlags;\n                return (*(WindowDisplayErrorFunc*)pData->pDsp)(\n                    pParent, nErrFlags, aErr, aAction);\n            }\n    }\n\n    DBG_ERROR(\"Error nicht behandelt\");\n    \/\/ Error 1 ist General Error im Sfx\n    if(pInfo->GetErrorCode()!=1)\n        HandleError(1, USHRT_MAX);\n    else\n        DBG_ERROR(\"Error 1 nicht gehandeled\");\n    delete pInfo;\n    return 0;\n}\n\nBOOL ErrorHandler::ForwCreateString(const ErrorInfo* pInfo, String& rStr, USHORT &rFlags) const\n{\n    return ErrHdl_Impl::CreateString(this->pImpl->pNext, pInfo, rStr, rFlags);\n}\n\nBOOL ErrHdl_Impl::CreateString( const ErrorHandler *pStart,\n                                const ErrorInfo* pInfo, String& pStr,\n                               USHORT &rFlags)\n{\n    for(const ErrorHandler *pHdl=pStart;pHdl;pHdl=pHdl->pImpl->pNext)\n    {\n        if(pHdl->CreateString( pInfo, pStr, rFlags))\n            return TRUE;\n    }\n    return FALSE;\n}\n\nBOOL SimpleErrorHandler::CreateString(\n    const ErrorInfo *pInfo, String &rStr, USHORT &) const\n{\n    ULONG nId = pInfo->GetErrorCode();\n    ByteString aStr;\n    aStr=\"Id \";\n    aStr+=ByteString::CreateFromInt32(nId);\n    aStr+=\" only handled by SimpleErrorHandler\";\n    aStr+=\"\\nErrorCode: \";\n    aStr+=ByteString::CreateFromInt32(nId & ((1L <<  ERRCODE_CLASS_SHIFT)  - 1 ));\n    aStr+=\"\\nErrorClass: \";\n    aStr+=ByteString::CreateFromInt32((nId & ERRCODE_CLASS_MASK) >> ERRCODE_CLASS_SHIFT);\n    aStr+=\"\\nErrorArea: \";\n    aStr+=ByteString::CreateFromInt32((nId & ERRCODE_ERROR_MASK &\n            ~((1 << ERRCODE_AREA_SHIFT ) -1 ) ) >> ERRCODE_AREA_SHIFT);\n    DynamicErrorInfo *pDyn=PTR_CAST(DynamicErrorInfo,pInfo);\n    if(pDyn)\n    {\n        aStr+=\"\\nDId \";\n        aStr+=ByteString::CreateFromInt32((ULONG)*pDyn);\n    }\n    StandardErrorInfo *pStd=PTR_CAST(StandardErrorInfo,pInfo);\n    if(pStd)\n    {\n        aStr+=\"\\nXId \";\n        aStr+=ByteString::CreateFromInt32(pStd->GetExtendedErrorCode());\n    }\n    rStr = String( aStr, RTL_TEXTENCODING_ASCII_US );\n    return TRUE;\n}\n\nSimpleErrorHandler::SimpleErrorHandler()\n : ErrorHandler()\n{\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************************************************************\n**\n** Copyright (c) 2015 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#include \"InfoMethods.h\"\n\n#include \"OOModel\/src\/allOOModelNodes.h\"\n\nnamespace OOVisualization {\n\nQString InfoMethods::numberOfCallees(Model::Node *node)\n{\n\tif (auto method = DCast<OOModel::Method>(node))\n\t{\n\t\tQString html = expandButton(\"toggleCalleeTable\", \"calleeTable\");\n\t\thtml = \"Number of called methods: \" + QString::number(method->callees().size()) + \"<br>\" + html;\n\t\thtml += classAndNameTable(\"calleeTable\", method->callees());\n\t\treturn html;\n\t}\n\telse return QString();\n}\n\nQString InfoMethods::numberOfUsages(Model::Node *node)\n{\n\n\tif (auto method = DCast<OOModel::Method>(node))\n\t{\n\t\tQString html = expandButton(\"toggleCallerTable\", \"callerTable\");\n\t\tauto callers = method->callers();\n\t\thtml = \"Number of callers: \" + QString::number(callers.size()) + \"<br>\" + html;\n\t\thtml += classAndNameTable(\"callerTable\", callers);\n\t\treturn html;\n\t}\n\telse if (auto someClass = DCast<OOModel::Class>(node))\n\t{\n\t\tQSet<Model::Node*> result;\n\t\tauto top = someClass->root();\n\t\t\/\/Find all the places where this class is referenced\n\t\tQList<Model::Node*> toCheck{top};\n\t\twhile (!toCheck.isEmpty())\n\t\t{\n\t\t\tauto check = toCheck.takeLast();\n\t\t\tif (auto expr = DCast<OOModel::ReferenceExpression>(check))\n\t\t\t\tif (expr->target() == someClass)\n\t\t\t\t\tresult << expr->topMostExpressionParent();\n\t\t\ttoCheck.append(check->children());\n\t\t}\n\t\treturn \"Number of usages: \" + QString::number(result.size());\n\t}\n\telse return QString();\n}\n\nQString InfoMethods::fullName(Model::Node *node)\n{\n\tif (auto method = DCast<OOModel::Method>(node))\n\t\treturn \"<b>\" + method->fullyQualifiedName() + \"<\/b>\";\n\telse if (auto clazz = DCast<OOModel::Class>(node))\n\t\treturn \"<b>\" + clazz->name() + \"<\/b>\";\n\telse return QString();\n}\n\nQString InfoMethods::expandButton(QString functionName, QString expandableId)\n{\n\tQString html = \"<script>\";\n\thtml += \"function \" + functionName + \"()\";\n\thtml += \"{\";\n\thtml += \"var table = document.getElementById(\\\"\" + expandableId + \"\\\");\";\n\thtml += \"table.style.display = (table.style.display == \\\"table\\\") ? \\\"none\\\" : \\\"table\\\";\";\n\thtml += \"}\";\n\thtml += \"<\/script>\";\n\thtml += \"<button onclick=\\\"\" + functionName + \"()\\\">Details<\/button>\";\n\treturn html;\n}\n\nQString InfoMethods::classAndNameTable(QString tableId, QSet<OOModel::Method *> methods)\n{\n\tQStringList tableRows{\"<tr><td style=\\\"border-right:solid 1px\\\"><b>Class<\/b><\/td><td><b>Method<\/b><\/td><\/tr>\"};\n\tfor (auto method : methods)\n\t{\n\t\tauto methodClass = method->firstAncestorOfType<OOModel::Class>();\n\t\ttableRows.append(\"<tr><td style=\\\"border-right:solid 1px\\\">\" + (methodClass ? methodClass->name() : \"n\/a\") + \"<\/td>\"\n\t\t\t\t\t\t+ \"<td>\" + method->name() + \"<\/td><\/tr>\");\n\t}\n\treturn hiddenTable(tableId, tableRows);\n}\n\nQString InfoMethods::hiddenTable(QString tableId, QStringList rows)\n{\n\tQString html = \"<table id=\\\"\" + tableId + \"\\\" style=\\\"display:none\\\">\";\n\tfor (auto row : rows)\n\t\thtml += row;\n\thtml += \"<\/table>\";\n\treturn html;\n}\n\n}\n<commit_msg>Add a \"Jump to\" button for callees\/callers<commit_after>\/***********************************************************************************************************************\n**\n** Copyright (c) 2015 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#include \"InfoMethods.h\"\n\n#include \"OOModel\/src\/allOOModelNodes.h\"\n\nnamespace OOVisualization {\n\nQString InfoMethods::numberOfCallees(Model::Node *node)\n{\n\tif (auto method = DCast<OOModel::Method>(node))\n\t{\n\t\tQString html = expandButton(\"toggleCalleeTable\", \"calleeTable\");\n\t\thtml = \"Number of called methods: \" + QString::number(method->callees().size()) + \"<br>\" + html;\n\t\thtml += classAndNameTable(\"calleeTable\", method->callees());\n\t\treturn html;\n\t}\n\telse return QString();\n}\n\nQString InfoMethods::numberOfUsages(Model::Node *node)\n{\n\n\tif (auto method = DCast<OOModel::Method>(node))\n\t{\n\t\tQString html = expandButton(\"toggleCallerTable\", \"callerTable\");\n\t\tauto callers = method->callers();\n\t\thtml = \"Number of callers: \" + QString::number(callers.size()) + \"<br>\" + html;\n\t\thtml += classAndNameTable(\"callerTable\", callers);\n\t\treturn html;\n\t}\n\telse if (auto someClass = DCast<OOModel::Class>(node))\n\t{\n\t\tQSet<Model::Node*> result;\n\t\tauto top = someClass->root();\n\t\t\/\/Find all the places where this class is referenced\n\t\tQList<Model::Node*> toCheck{top};\n\t\twhile (!toCheck.isEmpty())\n\t\t{\n\t\t\tauto check = toCheck.takeLast();\n\t\t\tif (auto expr = DCast<OOModel::ReferenceExpression>(check))\n\t\t\t\tif (expr->target() == someClass)\n\t\t\t\t\tresult << expr->topMostExpressionParent();\n\t\t\ttoCheck.append(check->children());\n\t\t}\n\t\treturn \"Number of usages: \" + QString::number(result.size());\n\t}\n\telse return QString();\n}\n\nQString InfoMethods::fullName(Model::Node *node)\n{\n\tif (auto method = DCast<OOModel::Method>(node))\n\t\treturn \"<b>\" + method->fullyQualifiedName() + \"<\/b>\";\n\telse if (auto clazz = DCast<OOModel::Class>(node))\n\t\treturn \"<b>\" + clazz->name() + \"<\/b>\";\n\telse return QString();\n}\n\nQString InfoMethods::expandButton(QString functionName, QString expandableId)\n{\n\tQString html = \"<script>\";\n\thtml += \"function \" + functionName + \"()\";\n\thtml += \"{\";\n\thtml += \"var table = document.getElementById(\\\"\" + expandableId + \"\\\");\";\n\thtml += \"table.style.display = (table.style.display == \\\"table\\\") ? \\\"none\\\" : \\\"table\\\";\";\n\thtml += \"}\";\n\thtml += \"<\/script>\";\n\thtml += \"<button onclick=\\\"\" + functionName + \"()\\\">Details<\/button>\";\n\treturn html;\n}\n\nQString InfoMethods::classAndNameTable(QString tableId, QSet<OOModel::Method *> methods)\n{\n\tQStringList tableRows{\"<tr><td style=\\\"border-right:solid 1px\\\"><b>Class<\/b><\/td><td><b>Method<\/b><\/td><\/tr>\"};\n\tfor (auto method : methods)\n\t{\n\t\tauto methodClass = method->firstAncestorOfType<OOModel::Class>();\n\t\ttableRows.append(\"<tr><td style=\\\"border-right:solid 1px\\\">\" + (methodClass ? methodClass->name() : \"n\/a\") + \"<\/td>\"\n\t\t\t\t\t\t+ \"<td style=\\\"border-right:solid 1px\\\">\" + method->name() + \"<\/td>\"\n\t\t\t\t\t\t+ \"<td><button onclick=\\\"operations.jumpToObject('\" +\n\t\t\t\t\t\t\t\t\tmethod->fullyQualifiedName() + \"')\\\">Jump to<\/button><\/td><\/tr>\");\n\t}\n\treturn hiddenTable(tableId, tableRows);\n}\n\nQString InfoMethods::hiddenTable(QString tableId, QStringList rows)\n{\n\tQString html = \"<table id=\\\"\" + tableId + \"\\\" style=\\\"display:none\\\">\";\n\tfor (auto row : rows)\n\t\thtml += row;\n\thtml += \"<\/table>\";\n\treturn html;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tFT5206 class @n\n\t\t\tFocalTech @n\n\t\t\tCapacitive Touch Panel Controller ドライバー @n\n\t\t\t・I2C 割り込み対応\n    @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2018 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 <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace chip {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  FT5206 テンプレートクラス\n\t\t@param[in]\tI2C\tI2C 制御クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class I2C>\n\tclass FT5206 {\n\tpublic:\n\t\tstruct xy {\n\t\t\tuint8_t\t\tst;\n\t\t\tuint16_t\tx;\n\t\t\tuint16_t\ty;\n\t\t\txy() : st(0), x(0), y(0) { }\n\t\t};\n\n\tprivate:\n\t\tstatic const uint8_t\tFT5206_ADR = 0x38;\n\n\t\tI2C&\ti2c_;\n\n\t\tenum class REG : uint8_t {\n\t\t\tDEVICE_MODE,\t\t\/\/ R\/W\n\t\t\tGEST_ID,\t\t\t\/\/ R\n\t\t\tTD_STATUS,\t\t\t\/\/ R\n\t\t\tTOUCH_XH,\t\t\t\/\/ R\n\t\t\tTOUCH_XL,\t\t\t\/\/ R\n\t\t\tTOUCH_YH,\t\t\t\/\/ R\n\t\t\tTOUCH_YL,\t\t\t\/\/ R\n\n\t\t\tTOUCH2_XH = 0x09,\t\/\/ R\n\t\t\tTOUCH2_XL,\t\t\t\/\/ R\n\t\t\tTOUCH2_YH,\t\t\t\/\/ R\n\t\t\tTOUCH2_YL,\t\t\t\/\/ R\n\n\t\t\tTOUCH3_XH = 0x0F,\t\/\/ R\n\t\t\tTOUCH3_XL,\t\t\t\/\/ R\n\t\t\tTOUCH3_YH,\t\t\t\/\/ R\n\t\t\tTOUCH3_YL,\t\t\t\/\/ R\n\n\t\t\tTOUCH4_XH = 0x15,\t\/\/ R\n\t\t\tTOUCH4_XL,\t\t\t\/\/ R\n\t\t\tTOUCH4_YH,\t\t\t\/\/ R\n\t\t\tTOUCH4_YL,\t\t\t\/\/ R\n\n\t\t\tTOUCH5_XH = 0x1B,\t\/\/ R\n\t\t\tTOUCH5_XL,\t\t\t\/\/ R\n\t\t\tTOUCH5_YH,\t\t\t\/\/ R\n\t\t\tTOUCH5_YL,\t\t\t\/\/ R\n\n\t\t\tID_G_THGROUP = 0x80,\t\t\/\/ R\/W\n\t\t\tID_G_THPEAK,\t\t\t\t\/\/ R\/W\n\t\t\tID_G_THCAL,\t\t\t\t\t\/\/ R\/W\n\t\t\tID_G_THWATER,\t\t\t\t\/\/ R\/W\n\t\t\tID_G_THTEMP,\t\t\t\t\/\/ R\/W\n\n\t\t\tID_G_CTRL = 0x86,\t\t\t\/\/ R\/W\n\t\t\tID_G_TIME_ENTER_MONITOR,\t\/\/ R\/W\n\t\t\tID_G_PERIODACTIVE,\t\t\t\/\/ R\/W\n\t\t\tID_G_PERIODMONITOR,\t\t\t\/\/ R\/W\n\n\t\t\tID_G_AUTO_CLB_MODE = 0xA0,\t\/\/ R\/W\n\t\t\tID_G_LIB_VERSION_H,\t\t\t\/\/ R\n\t\t\tID_G_LIB_VERSION_L,\t\t\t\/\/ R\n\t\t\tID_G_CIPHER,\t\t\t\t\/\/ R\n\t\t\tID_G_MODE,\t\t\t\t\t\/\/ R\n\t\t\tID_G_PMODE,\t\t\t\t\t\/\/ R\n\t\t\tID_G_FIRMID,\t\t\t\t\/\/ R\n\t\t\tID_G_STATE,\t\t\t\t\t\/\/ R\n\t\t\tID_G_FT5201ID,\t\t\t\t\/\/ R\n\t\t\tID_G_ERR,\t\t\t\t\t\/\/ R\n\t\t\tID_G_CLB,\t\t\t\t\t\/\/ R\/W\n\n\t\t\tID_G_B_AREA_TH = 0xAE,\t\t\/\/ R\/W\n\n\t\t\tLOG_MSG_CNT = 0xFE,\t\t\t\/\/ R\n\t\t\tLOG_CUR_CHA\t\t\t\t\t\/\/ R\n\t\t};\n\n\t\tuint8_t\t\ttouch_num_;\n\t\tbool\t\tstart_;\n\t\tuint16_t\tversion_;\n\t\tuint8_t\t\tchip_;\n\t\tuint8_t\t\ttouch_tmp_[11];\n\t\txy\t\t\txy_[2];\n\n\n\t\tvoid write_(REG reg, uint8_t data) noexcept\n\t\t{\n\t\t\tuint8_t tmp[2];\n\t\t\ttmp[0] = static_cast<uint8_t>(reg);\n\t\t\ttmp[1] = data;\n\t\t\ti2c_.send(FT5206_ADR, tmp, sizeof(tmp));\n\t\t\ti2c_.sync();\n\t\t}\n\n\n\t\tuint8_t read_(REG reg) noexcept\n\t\t{\n\t\t\tuint8_t tmp[1];\n\t\t\ttmp[0] = static_cast<uint8_t>(reg);\n\t\t\ti2c_.send(FT5206_ADR, tmp, sizeof(tmp));\n\t\t\ti2c_.recv(FT5206_ADR, tmp, sizeof(tmp));\n\t\t\ti2c_.sync();\n\t\t\treturn tmp[0];\n\t\t}\n\n\n\t\tvoid convert_touch_() noexcept\n\t\t{\n\t\t\ttouch_num_ = touch_tmp_[0];\n\t\t\tif(touch_num_ == 0) return;\n\n\t\t\tif(touch_num_ >= 1) {\n\t\t\t\txy_[0].st = touch_tmp_[1] >> 6;\n\t\t\t\txy_[0].x = (static_cast<uint16_t>(touch_tmp_[1] & 0x3F) << 8)\n\t\t\t\t\t| static_cast<uint16_t>(touch_tmp_[2]);\n\t\t\t\txy_[0].y = (static_cast<uint16_t>(touch_tmp_[3]) << 8)\n\t\t\t\t\t| static_cast<uint16_t>(touch_tmp_[4]);\n\t\t\t}\n\t\t\tif(touch_num_ > 1) {\n\t\t\t\txy_[1].st = touch_tmp_[7] >> 6;\n\t\t\t\txy_[1].x = (static_cast<uint16_t>(touch_tmp_[7] & 0x3F) << 8)\n\t\t\t\t\t| static_cast<uint16_t>(touch_tmp_[8]);\n\t\t\t\txy_[1].y = (static_cast<uint16_t>(touch_tmp_[9]) << 8)\n\t\t\t\t\t| static_cast<uint16_t>(touch_tmp_[10]);\n\t\t\t}\n\t\t}\n\n\n\t\tvoid request_touch_() noexcept\n\t\t{\n\t\t\ttouch_tmp_[0] = static_cast<uint8_t>(REG::TD_STATUS);\n\t\t\ti2c_.send(FT5206_ADR, touch_tmp_, 1);\n\t\t\ti2c_.recv(FT5206_ADR, touch_tmp_, sizeof(touch_tmp_));\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tコンストラクター\n\t\t\t@param[in]\ti2c\ti2c 制御クラスを参照で渡す\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tFT5206(I2C& i2c) noexcept : i2c_(i2c), touch_num_(0), start_(false),\n\t\t\tversion_(0), chip_(0) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tデバイスのバージョンを取得\n\t\t\t@return デバイスのバージョン\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tuint16_t get_version() const noexcept { return version_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tチップ・コードを取得\n\t\t\t@return チップ・コード\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tuint8_t get_chip() const noexcept { return chip_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tデバイス・リセット\n\t\t\t@param[in]\tRES\tリセット端子\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <class RES>\n\t\tstatic void reset() noexcept {\n\t\t\tRES::DIR = 1;\n\t\t\tRES::P = 0;\n\t\t\tutils::delay::milli_second(5);\n\t\t\tRES::P = 1;\n\t\t\tutils::delay::milli_second(300);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t開始\n\t\t\t@return 成功なら「true」\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool start() noexcept\n\t\t{\n\t\t\tuint8_t tmp[3];\n\t\t\ttmp[0] = static_cast<uint8_t>(REG::ID_G_LIB_VERSION_H);\n\t\t\tif(!i2c_.send(FT5206_ADR, tmp, 1)) {\n\t\t\t\tutils::format(\"Send fail\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti2c_.sync();\n\n\t\t\ttmp[0] = 0xff;\n\t\t\ttmp[1] = 0xff;\n\t\t\ttmp[2] = 0xff;\n\t\t\tif(!i2c_.recv(FT5206_ADR, tmp, sizeof(tmp))) {\n\t\t\t\tutils::format(\"Recv fail\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti2c_.sync();\n\t\t\tversion_ = (static_cast<uint16_t>(tmp[0]) << 8) | tmp[1];\n\t\t\tchip_ = tmp[2];\n\n\t\t\twrite_(REG::DEVICE_MODE, 0x00);\n\n\t\t\tstart_ = true;\n\n\t\t\trequest_touch_();\n\t\t\ti2c_.sync();\n\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tアップデート\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid update() noexcept\n\t\t{\n\t\t\tif(!start_) return;\n\n\t\t\tconvert_touch_();\n\t\t\trequest_touch_();\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tタッチ数を取得\n\t\t\t@return タッチ数\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tuint8_t get_touch_num() const noexcept { return touch_num_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tタッチ位置を取得\n\t\t\t@param[in]\tidx\tタッチ・インデックス（０～１）\n\t\t\t@return タッチ位置\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tconst xy& get_touch_pos(uint8_t idx) const noexcept { return xy_[idx & 1]; }\n\t};\n}\n<commit_msg>update: touch event, ID<commit_after>#pragma once\n\/\/=========================================================================\/\/\n\/*!\t@file\n\t@brief\tFT5206 class @n\n\t\t\tFocalTech @n\n\t\t\tCapacitive Touch Panel Controller ドライバー @n\n\t\t\t・I2C 割り込み対応\n    @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2018 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 <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace chip {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  FT5206 テンプレートクラス\n\t\t@param[in]\tI2C\tI2C 制御クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class I2C>\n\tclass FT5206 {\n\tpublic:\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief  Touch Event Type\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class EVENT : uint8_t {\n\t\t\tDOWN,\n\t\t\tUP,\n\t\t\tCONTACT,\n\t\t\tNONE\n\t\t};\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief  Touch Struct\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tstruct xy {\n\t\t\tEVENT\t\tevent;\t\/\/\/< Touch Event\n\t\t\tuint8_t\t\tid;\t\t\/\/\/< Touch ID\n\t\t\tuint16_t\tx;\t\t\/\/\/< Touch Position X\n\t\t\tuint16_t\ty;\t\t\/\/\/< Touch Position Y\n\t\t\txy() : event(EVENT::NONE), id(0), x(0), y(0) { }\n\t\t};\n\n\tprivate:\n\n\t\tstatic const uint8_t\tFT5206_ADR = 0x38;\n\n\t\tI2C&\ti2c_;\n\n\t\tenum class REG : uint8_t {\n\t\t\tDEVICE_MODE,\t\t\/\/ R\/W\n\t\t\tGEST_ID,\t\t\t\/\/ R\n\t\t\tTD_STATUS,\t\t\t\/\/ R\n\t\t\tTOUCH_XH,\t\t\t\/\/ R\n\t\t\tTOUCH_XL,\t\t\t\/\/ R\n\t\t\tTOUCH_YH,\t\t\t\/\/ R\n\t\t\tTOUCH_YL,\t\t\t\/\/ R\n\n\t\t\tTOUCH2_XH = 0x09,\t\/\/ R\n\t\t\tTOUCH2_XL,\t\t\t\/\/ R\n\t\t\tTOUCH2_YH,\t\t\t\/\/ R\n\t\t\tTOUCH2_YL,\t\t\t\/\/ R\n\n\t\t\tTOUCH3_XH = 0x0F,\t\/\/ R\n\t\t\tTOUCH3_XL,\t\t\t\/\/ R\n\t\t\tTOUCH3_YH,\t\t\t\/\/ R\n\t\t\tTOUCH3_YL,\t\t\t\/\/ R\n\n\t\t\tTOUCH4_XH = 0x15,\t\/\/ R\n\t\t\tTOUCH4_XL,\t\t\t\/\/ R\n\t\t\tTOUCH4_YH,\t\t\t\/\/ R\n\t\t\tTOUCH4_YL,\t\t\t\/\/ R\n\n\t\t\tTOUCH5_XH = 0x1B,\t\/\/ R\n\t\t\tTOUCH5_XL,\t\t\t\/\/ R\n\t\t\tTOUCH5_YH,\t\t\t\/\/ R\n\t\t\tTOUCH5_YL,\t\t\t\/\/ R\n\n\t\t\tID_G_THGROUP = 0x80,\t\t\/\/ R\/W\n\t\t\tID_G_THPEAK,\t\t\t\t\/\/ R\/W\n\t\t\tID_G_THCAL,\t\t\t\t\t\/\/ R\/W\n\t\t\tID_G_THWATER,\t\t\t\t\/\/ R\/W\n\t\t\tID_G_THTEMP,\t\t\t\t\/\/ R\/W\n\n\t\t\tID_G_CTRL = 0x86,\t\t\t\/\/ R\/W\n\t\t\tID_G_TIME_ENTER_MONITOR,\t\/\/ R\/W\n\t\t\tID_G_PERIODACTIVE,\t\t\t\/\/ R\/W\n\t\t\tID_G_PERIODMONITOR,\t\t\t\/\/ R\/W\n\n\t\t\tID_G_AUTO_CLB_MODE = 0xA0,\t\/\/ R\/W\n\t\t\tID_G_LIB_VERSION_H,\t\t\t\/\/ R\n\t\t\tID_G_LIB_VERSION_L,\t\t\t\/\/ R\n\t\t\tID_G_CIPHER,\t\t\t\t\/\/ R\n\t\t\tID_G_MODE,\t\t\t\t\t\/\/ R\n\t\t\tID_G_PMODE,\t\t\t\t\t\/\/ R\n\t\t\tID_G_FIRMID,\t\t\t\t\/\/ R\n\t\t\tID_G_STATE,\t\t\t\t\t\/\/ R\n\t\t\tID_G_FT5201ID,\t\t\t\t\/\/ R\n\t\t\tID_G_ERR,\t\t\t\t\t\/\/ R\n\t\t\tID_G_CLB,\t\t\t\t\t\/\/ R\/W\n\n\t\t\tID_G_B_AREA_TH = 0xAE,\t\t\/\/ R\/W\n\n\t\t\tLOG_MSG_CNT = 0xFE,\t\t\t\/\/ R\n\t\t\tLOG_CUR_CHA\t\t\t\t\t\/\/ R\n\t\t};\n\n\t\tuint8_t\t\ttouch_num_;\n\t\tbool\t\tstart_;\n\t\tuint16_t\tversion_;\n\t\tuint8_t\t\tchip_;\n\t\tuint8_t\t\ttouch_tmp_[11];\n\t\txy\t\t\txy_[2];\n\n\n\t\tvoid write_(REG reg, uint8_t data) noexcept\n\t\t{\n\t\t\tuint8_t tmp[2];\n\t\t\ttmp[0] = static_cast<uint8_t>(reg);\n\t\t\ttmp[1] = data;\n\t\t\ti2c_.send(FT5206_ADR, tmp, sizeof(tmp));\n\t\t\ti2c_.sync();\n\t\t}\n\n\n\t\tuint8_t read_(REG reg) noexcept\n\t\t{\n\t\t\tuint8_t tmp[1];\n\t\t\ttmp[0] = static_cast<uint8_t>(reg);\n\t\t\ti2c_.send(FT5206_ADR, tmp, sizeof(tmp));\n\t\t\ti2c_.recv(FT5206_ADR, tmp, sizeof(tmp));\n\t\t\ti2c_.sync();\n\t\t\treturn tmp[0];\n\t\t}\n\n\n\t\tvoid convert_touch_() noexcept\n\t\t{\n\t\t\ttouch_num_ = touch_tmp_[0];\n\t\t\tif(touch_num_ == 0) return;\n\n\t\t\tif(touch_num_ >= 1) {\n\t\t\t\txy_[0].event = static_cast<EVENT>(touch_tmp_[1] >> 6);\n\t\t\t\txy_[0].id = touch_tmp_[3] >> 4;\n\t\t\t\txy_[0].x = (static_cast<uint16_t>(touch_tmp_[1] & 0x0F) << 8)\n\t\t\t\t\t| static_cast<uint16_t>(touch_tmp_[2]);\n\t\t\t\txy_[0].y = (static_cast<uint16_t>(touch_tmp_[3] & 0x0F) << 8)\n\t\t\t\t\t| static_cast<uint16_t>(touch_tmp_[4]);\n\t\t\t}\n\t\t\tif(touch_num_ > 1) {\n\t\t\t\txy_[1].event = static_cast<EVENT>(touch_tmp_[7] >> 6);\n\t\t\t\txy_[1].id = touch_tmp_[9] >> 4;\n\t\t\t\txy_[1].x = (static_cast<uint16_t>(touch_tmp_[7] & 0x0F) << 8)\n\t\t\t\t\t| static_cast<uint16_t>(touch_tmp_[8]);\n\t\t\t\txy_[1].y = (static_cast<uint16_t>(touch_tmp_[9] & 0x0F) << 8)\n\t\t\t\t\t| static_cast<uint16_t>(touch_tmp_[10]);\n\t\t\t}\n\t\t}\n\n\n\t\tvoid request_touch_() noexcept\n\t\t{\n\t\t\ttouch_tmp_[0] = static_cast<uint8_t>(REG::TD_STATUS);\n\t\t\ti2c_.send(FT5206_ADR, touch_tmp_, 1);\n\t\t\ti2c_.recv(FT5206_ADR, touch_tmp_, sizeof(touch_tmp_));\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tコンストラクター\n\t\t\t@param[in]\ti2c\ti2c 制御クラスを参照で渡す\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tFT5206(I2C& i2c) noexcept : i2c_(i2c), touch_num_(0), start_(false),\n\t\t\tversion_(0), chip_(0) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tデバイスのバージョンを取得\n\t\t\t@return デバイスのバージョン\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tuint16_t get_version() const noexcept { return version_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tチップ・コードを取得\n\t\t\t@return チップ・コード\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tuint8_t get_chip() const noexcept { return chip_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tデバイス・リセット\n\t\t\t@param[in]\tRES\tリセット端子\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <class RES>\n\t\tstatic void reset() noexcept {\n\t\t\tRES::DIR = 1;\n\t\t\tRES::P = 0;\n\t\t\tutils::delay::milli_second(5);\n\t\t\tRES::P = 1;\n\t\t\tutils::delay::milli_second(300);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t開始\n\t\t\t@return 成功なら「true」\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool start() noexcept\n\t\t{\n\t\t\tuint8_t tmp[3];\n\t\t\ttmp[0] = static_cast<uint8_t>(REG::ID_G_LIB_VERSION_H);\n\t\t\tif(!i2c_.send(FT5206_ADR, tmp, 1)) {\n\t\t\t\tutils::format(\"Send fail\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti2c_.sync();\n\n\t\t\ttmp[0] = 0xff;\n\t\t\ttmp[1] = 0xff;\n\t\t\ttmp[2] = 0xff;\n\t\t\tif(!i2c_.recv(FT5206_ADR, tmp, sizeof(tmp))) {\n\t\t\t\tutils::format(\"Recv fail\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti2c_.sync();\n\t\t\tversion_ = (static_cast<uint16_t>(tmp[0]) << 8) | tmp[1];\n\t\t\tchip_ = tmp[2];\n\n\t\t\twrite_(REG::DEVICE_MODE, 0x00);\n\n\t\t\tstart_ = true;\n\n\t\t\trequest_touch_();\n\t\t\ti2c_.sync();\n\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tアップデート\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid update() noexcept\n\t\t{\n\t\t\tif(!start_) return;\n\n\t\t\tconvert_touch_();\n\t\t\trequest_touch_();\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tタッチ数を取得\n\t\t\t@return タッチ数\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tuint8_t get_touch_num() const noexcept { return touch_num_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tタッチ位置を取得\n\t\t\t@param[in]\tidx\tタッチ・インデックス（０～１）\n\t\t\t@return タッチ位置\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tconst xy& get_touch_pos(uint8_t idx) const noexcept { return xy_[idx & 1]; }\n\t};\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tBUS R\/W テンプレート・クラス\n    @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2018 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 <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  BUS R\/W テンプレート・クラス\n\t\t@param[in]\tCS\tチップ選択\n\t\t@param[in]\tRS\tレジスタ選択\n\t\t@param[in]\tRD\tリード\n\t\t@param[in]\tWR\tライト\n\t\t@param[in]\tDL\tデータパスＬ（DB0 - DB7）\n\t\t@param[in]\tDH\tデータパスＨ（DB8 - DB15）\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CS, class RS, class RD, class WR, class DL, class DH> \n\tclass bus_rw16 {\n\n\t\tstatic void write16_(uint16_t val) noexcept {\n\t\t\tDH::P = val >> 8;\n\t\t\tDL::P = val & 0xff;\n\t\t\tWR::P = 0;\n\t\t\tCS::P = 0;\n\t\t\tutils::delay::loop(5);\n\t\t\tWR::P = 1;\n\t\t\tCS::P = 1;\n\t\t}\n\n\t\tstatic uint16_t read16_() noexcept {\n\t\t\tRD::P = 0;\n\t\t\tCS::P = 0;\n\t\t\tutils::delay::micro_second(1);\n\t\t\tuint16_t val = static_cast<uint16_t>(DH::P());\n\t\t\tval <<= 8;\n\t\t\tval |= static_cast<uint16_t>(DL::P());\n\t\t\tCS::P = 1;\n\t\t\tRD::P = 1;\n\t\t\treturn val;\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t開始\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic void start() noexcept\n\t\t{\n\t\t\tRS::DIR = 1;\n\t\t\tRD::DIR = 1;\n\t\t\tWR::DIR = 1;\n\t\t\tCS::DIR = 1;\n\n\t\t\tCS::P = 1;\n\t\t\tRS::P = 0;\n\t\t\tRD::P = 1;\n\t\t\tWR::P = 1;\n\n\t\t\tDL::DIR = 0xff;\n\t\t\tDH::DIR = 0xff;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t書き込み\n\t\t\t@param[in]\trs\t\tレジスタ選択\n\t\t\t@param[in]\tval\t\t書き込みデータ\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic void write(bool rs, uint16_t val) noexcept {\n\t\t\tRS::P = rs;\n\t\t\twrite16_(val);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t読み込み @n\n\t\t\t\t\t※あらかじめ、リードアドレスを設定しておく\n\t\t\t@param[in]\trs\t\tレジスタ選択\n\t\t\t@return\t読み出しデータ\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic uint16_t read(bool rs) noexcept {\n\t\t\tRS::P = rs;\n\t\t\tDL::DIR = 0x00;\n\t\t\tDH::DIR = 0x00;\n\t\t\tauto dat = read16_();\n\t\t\tDL::DIR = 0xff;\n\t\t\tDH::DIR = 0xff;\n\t\t\treturn dat;\n\t\t}\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  BUS R\/W テンプレート・クラス\n\t\t@param[in]\tCS\tチップ選択\n\t\t@param[in]\tRS\tレジスタ選択\n\t\t@param[in]\tRD\tリード\n\t\t@param[in]\tWR\tライト\n\t\t@param[in]\tDA\tデータパス（DB0 - DB7）\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CS, class RS, class RD, class WR, class DA> \n\tclass bus_rw8 {\n\n\t\tstatic void write16_(uint16_t val) noexcept {\n\t\t\tDA::P = val >> 8;\n\t\t\tCS::P = 0;\n\t\t\tWR::P = 0;\n\t\t\tutils::delay::loop(3);\n\t\t\tWR::P = 1;\n\t\t\tutils::delay::loop(3);\n\t\t\tDA::P = val & 0xff;\n\t\t\tWR::P = 0;\n\t\t\tutils::delay::loop(3);\n\t\t\tCS::P = 1;\n\t\t\tWR::P = 1;\n\t\t}\n\n\t\tstatic uint16_t read16_() noexcept {\n\t\t\tRD::P = 0;\n\t\t\tCS::P = 0;\n\t\t\tutils::delay::micro_second(1);\n\t\t\tuint16_t val = static_cast<uint16_t>(DA::P());\n\t\t\tval <<= 8;\n\t\t\tCS::P = 1;\n\t\t\tutils::delay::micro_second(1);\n\t\t\tCS::P = 0;\n\t\t\tutils::delay::micro_second(1);\n\t\t\tval |= static_cast<uint16_t>(DA::P());\n\t\t\tCS::P = 1;\n\t\t\tRD::P = 1;\n\t\t\treturn val;\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t開始\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic void start() noexcept\n\t\t{\n\t\t\tRS::DIR = 1;\n\t\t\tRD::DIR = 1;\n\t\t\tWR::DIR = 1;\n\t\t\tCS::DIR = 1;\n\n\t\t\tCS::P = 1;\n\t\t\tRS::P = 0;\n\t\t\tRD::P = 1;\n\t\t\tWR::P = 1;\n\n\t\t\tDA::DIR = 0xff;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t書き込み\n\t\t\t@param[in]\trs\t\tレジスタ選択\n\t\t\t@param[in]\tval\t\t書き込みデータ\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic void write(bool rs, uint16_t val) noexcept {\n\t\t\tRS::P = rs;\n\t\t\twrite16_(val);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t読み込み @n\n\t\t\t\t\t※あらかじめ、リードアドレスを設定しておく\n\t\t\t@param[in]\trs\t\tレジスタ選択\n\t\t\t@return\t読み出しデータ\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic uint16_t read(bool rs) noexcept {\n\t\t\tRS::P = rs;\n\t\t\tDA::DIR = 0x00;\n\t\t\tauto dat = read16_();\n\t\t\tDA::DIR = 0xff;\n\t\t\treturn dat;\n\t\t}\n\t};\n}\n<commit_msg>update: tune bus cycle<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tBUS R\/W テンプレート・クラス\n    @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2018 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 <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  BUS R\/W テンプレート・クラス\n\t\t@param[in]\tCS\tチップ選択\n\t\t@param[in]\tRS\tレジスタ選択\n\t\t@param[in]\tRD\tリード\n\t\t@param[in]\tWR\tライト\n\t\t@param[in]\tDL\tデータパスＬ（DB0 - DB7）\n\t\t@param[in]\tDH\tデータパスＨ（DB8 - DB15）\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CS, class RS, class RD, class WR, class DL, class DH> \n\tclass bus_rw16 {\n\n\t\tstatic void write16_(uint16_t val) noexcept {\n\t\t\tDH::P = val >> 8;\n\t\t\tDL::P = val & 0xff;\n\t\t\tWR::P = 0;\n\t\t\tCS::P = 0;\n\t\t\tutils::delay::loop(5);\n\t\t\tWR::P = 1;\n\t\t\tCS::P = 1;\n\t\t}\n\n\t\tstatic uint16_t read16_() noexcept {\n\t\t\tRD::P = 0;\n\t\t\tCS::P = 0;\n\t\t\tutils::delay::micro_second(1);\n\t\t\tuint16_t val = static_cast<uint16_t>(DH::P());\n\t\t\tval <<= 8;\n\t\t\tval |= static_cast<uint16_t>(DL::P());\n\t\t\tCS::P = 1;\n\t\t\tRD::P = 1;\n\t\t\treturn val;\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t開始\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic void start() noexcept\n\t\t{\n\t\t\tRS::DIR = 1;\n\t\t\tRD::DIR = 1;\n\t\t\tWR::DIR = 1;\n\t\t\tCS::DIR = 1;\n\n\t\t\tCS::P = 1;\n\t\t\tRS::P = 0;\n\t\t\tRD::P = 1;\n\t\t\tWR::P = 1;\n\n\t\t\tDL::DIR = 0xff;\n\t\t\tDH::DIR = 0xff;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t書き込み\n\t\t\t@param[in]\trs\t\tレジスタ選択\n\t\t\t@param[in]\tval\t\t書き込みデータ\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic void write(bool rs, uint16_t val) noexcept {\n\t\t\tRS::P = rs;\n\t\t\twrite16_(val);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t読み込み @n\n\t\t\t\t\t※あらかじめ、リードアドレスを設定しておく\n\t\t\t@param[in]\trs\t\tレジスタ選択\n\t\t\t@return\t読み出しデータ\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic uint16_t read(bool rs) noexcept {\n\t\t\tRS::P = rs;\n\t\t\tDL::DIR = 0x00;\n\t\t\tDH::DIR = 0x00;\n\t\t\tauto dat = read16_();\n\t\t\tDL::DIR = 0xff;\n\t\t\tDH::DIR = 0xff;\n\t\t\treturn dat;\n\t\t}\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  BUS R\/W テンプレート・クラス\n\t\t@param[in]\tCS\tチップ選択\n\t\t@param[in]\tRS\tレジスタ選択\n\t\t@param[in]\tRD\tリード\n\t\t@param[in]\tWR\tライト\n\t\t@param[in]\tDA\tデータパス（DB0 - DB7）\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CS, class RS, class RD, class WR, class DA> \n\tclass bus_rw8 {\n\n\t\tstatic void write16_(uint16_t val) noexcept {\n\t\t\tDA::P = val >> 8;\n\t\t\tCS::P = 0;\n\t\t\tWR::P = 0;\n\t\t\tutils::delay::loop(2);\n\t\t\tWR::P = 1;\n\t\t\tutils::delay::loop(2);\n\t\t\tDA::P = val & 0xff;\n\t\t\tWR::P = 0;\n\t\t\tutils::delay::loop(2);\n\t\t\tCS::P = 1;\n\t\t\tWR::P = 1;\n\t\t}\n\n\t\tstatic uint16_t read16_() noexcept {\n\t\t\tRD::P = 0;\n\t\t\tCS::P = 0;\n\t\t\tutils::delay::micro_second(1);\n\t\t\tuint16_t val = static_cast<uint16_t>(DA::P());\n\t\t\tval <<= 8;\n\t\t\tCS::P = 1;\n\t\t\tutils::delay::micro_second(1);\n\t\t\tCS::P = 0;\n\t\t\tutils::delay::micro_second(1);\n\t\t\tval |= static_cast<uint16_t>(DA::P());\n\t\t\tCS::P = 1;\n\t\t\tRD::P = 1;\n\t\t\treturn val;\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t開始\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic void start() noexcept\n\t\t{\n\t\t\tRS::DIR = 1;\n\t\t\tRD::DIR = 1;\n\t\t\tWR::DIR = 1;\n\t\t\tCS::DIR = 1;\n\n\t\t\tCS::P = 1;\n\t\t\tRS::P = 0;\n\t\t\tRD::P = 1;\n\t\t\tWR::P = 1;\n\n\t\t\tDA::DIR = 0xff;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t書き込み\n\t\t\t@param[in]\trs\t\tレジスタ選択\n\t\t\t@param[in]\tval\t\t書き込みデータ\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic void write(bool rs, uint16_t val) noexcept {\n\t\t\tRS::P = rs;\n\t\t\twrite16_(val);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t読み込み @n\n\t\t\t\t\t※あらかじめ、リードアドレスを設定しておく\n\t\t\t@param[in]\trs\t\tレジスタ選択\n\t\t\t@return\t読み出しデータ\n\t\t *\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic uint16_t read(bool rs) noexcept {\n\t\t\tRS::P = rs;\n\t\t\tDA::DIR = 0x00;\n\t\t\tauto dat = read16_();\n\t\t\tDA::DIR = 0xff;\n\t\t\treturn dat;\n\t\t}\n\t};\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"FileIO.h\"\n#include \"StagePanel.h\"\n#include \"ToolbarPanel.h\"\n#include \"ParticleSystem.h\"\n#include \"config.h\"\n#include \"ps_config.h\"\n\nnamespace eparticle3d\n{\n\nvoid FileIO::store(const char* filepath, ToolbarPanel* toolbar)\n{\n\tJson::Value value;\n\n\ttoolbar->Store(value);\n\tvalue[\"version\"] = VERSION;\n\n\tvalue[\"name\"] = toolbar->m_name->GetValue().ToStdString();\n\tvalue[\"package\"] = toolbar->m_package->GetValue().ToStdString();\n\tvalue[\"layer\"] = toolbar->m_layer->GetValue();\n\tvalue[\"min_hori\"] = toolbar->m_min_hori->GetValue();\n\tvalue[\"max_hori\"] = toolbar->m_max_hori->GetValue();\n\tvalue[\"min_vert\"] = toolbar->m_min_vert->GetValue();\n\tvalue[\"max_vert\"] = toolbar->m_max_vert->GetValue();\n\tvalue[\"inertia\"] = toolbar->m_inertia->GetValue();\n\tvalue[\"bounce\"] = toolbar->m_bounce->GetValue();\n\tvalue[\"additive_blend\"] = toolbar->m_additiveBlend->GetValue();\n\tvalue[\"start_radius_3d\"] = toolbar->m_radius_3d->GetValue();\n\tvalue[\"orient_to_movement\"] = toolbar->m_orient_to_movement->GetValue();\n\tvalue[\"orient_to_parent\"] = toolbar->m_orient_to_parent->GetValue();\n\n\tstd::string dir = d2d::FilenameTools::getFileDir(filepath);\n\tfor (size_t i = 0, n = toolbar->m_children.size(); i < n; ++i)\n\t{\n\t\tToolbarPanel::ChildPanel* cp = toolbar->m_children[i];\n\t\tParticleChild* pc = cp->m_pc;\n\t\tvalue[\"components\"][i][\"filepath\"] = \n\t\t\td2d::FilenameTools::getRelativePath(dir, pc->symbol->GetFilepath()).ToStdString();\n\t\tif (pc->bind_ps) {\n\t\t\tvalue[\"components\"][i][\"bind ps filepath\"] = \n\t\t\t\td2d::FilenameTools::getRelativePath(dir, pc->bind_ps->filepath).ToStdString();\n\t\t}\n\t\tvalue[\"components\"][i][\"name\"] = cp->m_name->GetValue().ToStdString();\n\t\tvalue[\"components\"][i][\"start_z\"] = cp->m_startz->GetValue();\n\t\tfor (int j = 0, m = cp->m_sliders.size(); j < m; ++j) {\n\t\t\tcp->m_sliders[j]->Store(value[\"components\"][i]);\n\t\t}\n\t}\n\n\tJson::StyledStreamWriter writer;\n\tstd::locale::global(std::locale(\"\"));\n\tstd::ofstream fout(filepath);\n\tstd::locale::global(std::locale(\"C\"));\t\n\twriter.write(fout, value);\n\tfout.close();\n}\n\nvoid FileIO::load(const char* filepath, ParticleSystem* ps,\n\t\t\t\t  ToolbarPanel* toolbar)\n{\n\tJson::Value value;\n\tJson::Reader reader;\n\tstd::locale::global(std::locale(\"\"));\n\tstd::ifstream fin(filepath);\n\tstd::locale::global(std::locale(\"C\"));\n\treader.parse(fin, value);\n\tfin.close();\n\n\tint version = value[\"version\"].asInt();\n\n\tFileAdapter adapter;\n\tadapter.load(filepath, version);\n\n\tif (version == 0) {\n\t\tint center = (adapter.min_life + adapter.max_life) * 0.5f;\n\t\tint offset = (adapter.max_life - adapter.min_life) * 0.5f;\n\t\tvalue[\"life\"][\"center\"] = center;\n\t\tvalue[\"life\"][\"offset\"] = offset;\n\n\t\tcenter = (adapter.min_spd + adapter.max_spd) * 0.5f;\n\t\toffset = (adapter.max_spd - adapter.min_spd) * 0.5f;\n\t\tvalue[\"speed\"][\"center\"] = center;\n\t\tvalue[\"speed\"][\"offset\"] = offset;\n\t}\n\n\ttoolbar->Load(value, version);\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\ttoolbar->m_name->SetValue(adapter.name);\n\ttoolbar->m_package->SetValue(adapter.package);\n\n\ttoolbar->m_layer->SetValue(adapter.layer);\n\ttoolbar->m_min_hori->SetValue(adapter.min_hori);\n\ttoolbar->m_max_hori->SetValue(adapter.max_hori);\n\tps->setHori(adapter.min_hori, adapter.max_hori);\n\ttoolbar->m_min_vert->SetValue(adapter.min_vert);\n\ttoolbar->m_max_vert->SetValue(adapter.max_vert);\n\tps->setVert(adapter.min_vert, adapter.max_vert);\n\ttoolbar->m_inertia->SetValue(adapter.inertia);\n\ttoolbar->m_bounce->SetValue(adapter.bounce);\n\tps->setBounce(adapter.bounce);\n\ttoolbar->m_additiveBlend->SetValue(adapter.additive_blend);\n\ttoolbar->m_orient_to_movement->SetValue(adapter.orient_to_movement);\n\ttoolbar->m_radius_3d->SetValue(adapter.start_radius_3d);\n\ttoolbar->m_orient_to_parent->SetValue(adapter.orient_to_parent);\n\tfor (size_t i = 0, n = adapter.children.size(); i < n; ++i) {\n\t\ttoolbar->add(adapter.children[i]);\n\t}\n}\n\nParticleSystem* FileIO::LoadPS(const char* filepath)\n{\n\tJson::Value value;\n\tJson::Reader reader;\n\tstd::locale::global(std::locale(\"\"));\n\tstd::ifstream fin(filepath);\n\tstd::locale::global(std::locale(\"C\"));\n\treader.parse(fin, value);\n\tfin.close();\n\n\tint version = value[\"version\"].asInt();\n\n\tFileAdapter adapter;\n\tadapter.load(filepath, version);\n\n\tParticleSystem* ps = new ParticleSystem(PARTICLE_CAP);\n\n\tps->filepath = filepath;\n\tps->SetValue(PS_COUNT, d2d::UICallback::Data(adapter.count));\n\tps->SetValue(PS_EMISSION_TIME, d2d::UICallback::Data(adapter.emission_time));\n\tps->SetValue(PS_LIFE_TIME, d2d::UICallback::Data((adapter.min_life + adapter.max_life) * 0.5f, (adapter.max_life - adapter.min_life) * 0.5f));\n\tps->SetValue(PS_SPEED, d2d::UICallback::Data((adapter.min_spd + adapter.max_spd) * 0.5f, (adapter.max_spd - adapter.min_spd) * 0.5f));\n\tps->SetValue(PS_ANGULAR_SPEED, d2d::UICallback::Data((adapter.min_angular_spd + adapter.max_angular_spd) * 0.5f, (adapter.max_angular_spd - adapter.min_angular_spd) * 0.5f));\n\tps->SetValue(PS_DISTURBANCE_RADIUS, d2d::UICallback::Data((adapter.min_dis_region + adapter.max_dis_region) * 0.5f, (adapter.max_dis_region - adapter.min_dis_region) * 0.5f));\n\tps->SetValue(PS_DISTURBANCE_SPD, d2d::UICallback::Data((adapter.min_dis_spd + adapter.max_dis_spd) * 0.5f, (adapter.max_dis_spd - adapter.min_dis_spd) * 0.5f));\n\tps->SetValue(PS_GRAVITY, d2d::UICallback::Data(adapter.gravity));\n\tps->SetValue(PS_LINEAR_ACC, d2d::UICallback::Data((adapter.min_linear_acc + adapter.max_angular_spd) * 0.5f, (adapter.max_angular_spd - adapter.max_linear_acc) * 0.5f));\n\tps->SetValue(PS_FADEOUT_TIME, d2d::UICallback::Data(adapter.fadeout_time));\n\tps->SetValue(PS_START_RADIUS, d2d::UICallback::Data(adapter.start_radius));\n\n\tps->setHori(adapter.min_hori, adapter.max_hori);\n\tps->setVert(adapter.min_vert, adapter.max_vert);\n\tps->setBounce(adapter.bounce);\n\tfor (size_t i = 0, n = adapter.children.size(); i < n; ++i)\n\t{\n\t\tconst FileAdapter::Child& child = adapter.children[i];\n\n\t\tParticleChild* pc = new ParticleChild;\n\n\t\t\/\/ todo Release symbol\n\t\tpc->symbol = d2d::SymbolMgr::Instance()->FetchSymbol(child.filepath);\n\n\t\tpc->start_scale = child.start_scale * 0.01f;\n\t\tpc->end_scale = child.end_scale * 0.01f;\n\t\tpc->min_rotate = child.min_rotate * d2d::TRANS_DEG_TO_RAD;\n\t\tpc->max_rotate = child.max_rotate * d2d::TRANS_DEG_TO_RAD;\n\n\t\tps->addChild(pc);\n\t}\n\n\treturn ps;\n}\n\n}<commit_msg>[FIXED] particle3d导入的某些属性没设置<commit_after>#include \"FileIO.h\"\n#include \"StagePanel.h\"\n#include \"ToolbarPanel.h\"\n#include \"ParticleSystem.h\"\n#include \"config.h\"\n#include \"ps_config.h\"\n\nnamespace eparticle3d\n{\n\nvoid FileIO::store(const char* filepath, ToolbarPanel* toolbar)\n{\n\tJson::Value value;\n\n\ttoolbar->Store(value);\n\tvalue[\"version\"] = VERSION;\n\n\tvalue[\"name\"] = toolbar->m_name->GetValue().ToStdString();\n\tvalue[\"package\"] = toolbar->m_package->GetValue().ToStdString();\n\tvalue[\"layer\"] = toolbar->m_layer->GetValue();\n\tvalue[\"min_hori\"] = toolbar->m_min_hori->GetValue();\n\tvalue[\"max_hori\"] = toolbar->m_max_hori->GetValue();\n\tvalue[\"min_vert\"] = toolbar->m_min_vert->GetValue();\n\tvalue[\"max_vert\"] = toolbar->m_max_vert->GetValue();\n\tvalue[\"inertia\"] = toolbar->m_inertia->GetValue();\n\tvalue[\"bounce\"] = toolbar->m_bounce->GetValue();\n\tvalue[\"additive_blend\"] = toolbar->m_additiveBlend->GetValue();\n\tvalue[\"start_radius_3d\"] = toolbar->m_radius_3d->GetValue();\n\tvalue[\"orient_to_movement\"] = toolbar->m_orient_to_movement->GetValue();\n\tvalue[\"orient_to_parent\"] = toolbar->m_orient_to_parent->GetValue();\n\n\tstd::string dir = d2d::FilenameTools::getFileDir(filepath);\n\tfor (size_t i = 0, n = toolbar->m_children.size(); i < n; ++i)\n\t{\n\t\tToolbarPanel::ChildPanel* cp = toolbar->m_children[i];\n\t\tParticleChild* pc = cp->m_pc;\n\t\tvalue[\"components\"][i][\"filepath\"] = \n\t\t\td2d::FilenameTools::getRelativePath(dir, pc->symbol->GetFilepath()).ToStdString();\n\t\tif (pc->bind_ps) {\n\t\t\tvalue[\"components\"][i][\"bind ps filepath\"] = \n\t\t\t\td2d::FilenameTools::getRelativePath(dir, pc->bind_ps->filepath).ToStdString();\n\t\t}\n\t\tvalue[\"components\"][i][\"name\"] = cp->m_name->GetValue().ToStdString();\n\t\tvalue[\"components\"][i][\"start_z\"] = cp->m_startz->GetValue();\n\t\tfor (int j = 0, m = cp->m_sliders.size(); j < m; ++j) {\n\t\t\tcp->m_sliders[j]->Store(value[\"components\"][i]);\n\t\t}\n\t}\n\n\tJson::StyledStreamWriter writer;\n\tstd::locale::global(std::locale(\"\"));\n\tstd::ofstream fout(filepath);\n\tstd::locale::global(std::locale(\"C\"));\t\n\twriter.write(fout, value);\n\tfout.close();\n}\n\nvoid FileIO::load(const char* filepath, ParticleSystem* ps,\n\t\t\t\t  ToolbarPanel* toolbar)\n{\n\tJson::Value value;\n\tJson::Reader reader;\n\tstd::locale::global(std::locale(\"\"));\n\tstd::ifstream fin(filepath);\n\tstd::locale::global(std::locale(\"C\"));\n\treader.parse(fin, value);\n\tfin.close();\n\n\tint version = value[\"version\"].asInt();\n\n\tFileAdapter adapter;\n\tadapter.load(filepath, version);\n\n\tif (version == 0) {\n\t\tint center = (adapter.min_life + adapter.max_life) * 0.5f;\n\t\tint offset = (adapter.max_life - adapter.min_life) * 0.5f;\n\t\tvalue[\"life\"][\"center\"] = center;\n\t\tvalue[\"life\"][\"offset\"] = offset;\n\n\t\tcenter = (adapter.min_spd + adapter.max_spd) * 0.5f;\n\t\toffset = (adapter.max_spd - adapter.min_spd) * 0.5f;\n\t\tvalue[\"speed\"][\"center\"] = center;\n\t\tvalue[\"speed\"][\"offset\"] = offset;\n\t}\n\n\ttoolbar->Load(value, version);\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\ttoolbar->m_name->SetValue(adapter.name);\n\ttoolbar->m_package->SetValue(adapter.package);\n\n\ttoolbar->m_layer->SetValue(adapter.layer);\n\ttoolbar->m_min_hori->SetValue(adapter.min_hori);\n\ttoolbar->m_max_hori->SetValue(adapter.max_hori);\n\tps->setHori(adapter.min_hori, adapter.max_hori);\n\ttoolbar->m_min_vert->SetValue(adapter.min_vert);\n\ttoolbar->m_max_vert->SetValue(adapter.max_vert);\n\tps->setVert(adapter.min_vert, adapter.max_vert);\n\ttoolbar->m_inertia->SetValue(adapter.inertia);\n\ttoolbar->m_bounce->SetValue(adapter.bounce);\n\tps->setBounce(adapter.bounce);\n\ttoolbar->m_additiveBlend->SetValue(adapter.additive_blend);\n\tps->setAdditiveBlend(adapter.additive_blend);\n\ttoolbar->m_orient_to_movement->SetValue(adapter.orient_to_movement);\n\tps->SetOrientToMovement(adapter.orient_to_movement);\n\ttoolbar->m_radius_3d->SetValue(adapter.start_radius_3d);\n\tps->SetRadius3D(adapter.start_radius_3d);\n\ttoolbar->m_orient_to_parent->SetValue(adapter.orient_to_parent);\n\tfor (size_t i = 0, n = adapter.children.size(); i < n; ++i) {\n\t\ttoolbar->add(adapter.children[i]);\n\t}\n}\n\nParticleSystem* FileIO::LoadPS(const char* filepath)\n{\n\tJson::Value value;\n\tJson::Reader reader;\n\tstd::locale::global(std::locale(\"\"));\n\tstd::ifstream fin(filepath);\n\tstd::locale::global(std::locale(\"C\"));\n\treader.parse(fin, value);\n\tfin.close();\n\n\tint version = value[\"version\"].asInt();\n\n\tFileAdapter adapter;\n\tadapter.load(filepath, version);\n\n\tParticleSystem* ps = new ParticleSystem(PARTICLE_CAP);\n\n\tps->filepath = filepath;\n\tps->SetValue(PS_COUNT, d2d::UICallback::Data(adapter.count));\n\tps->SetValue(PS_EMISSION_TIME, d2d::UICallback::Data(adapter.emission_time));\n\tps->SetValue(PS_LIFE_TIME, d2d::UICallback::Data((adapter.min_life + adapter.max_life) * 0.5f, (adapter.max_life - adapter.min_life) * 0.5f));\n\tps->SetValue(PS_SPEED, d2d::UICallback::Data((adapter.min_spd + adapter.max_spd) * 0.5f, (adapter.max_spd - adapter.min_spd) * 0.5f));\n\tps->SetValue(PS_ANGULAR_SPEED, d2d::UICallback::Data((adapter.min_angular_spd + adapter.max_angular_spd) * 0.5f, (adapter.max_angular_spd - adapter.min_angular_spd) * 0.5f));\n\tps->SetValue(PS_DISTURBANCE_RADIUS, d2d::UICallback::Data((adapter.min_dis_region + adapter.max_dis_region) * 0.5f, (adapter.max_dis_region - adapter.min_dis_region) * 0.5f));\n\tps->SetValue(PS_DISTURBANCE_SPD, d2d::UICallback::Data((adapter.min_dis_spd + adapter.max_dis_spd) * 0.5f, (adapter.max_dis_spd - adapter.min_dis_spd) * 0.5f));\n\tps->SetValue(PS_GRAVITY, d2d::UICallback::Data(adapter.gravity));\n\tps->SetValue(PS_LINEAR_ACC, d2d::UICallback::Data((adapter.min_linear_acc + adapter.max_angular_spd) * 0.5f, (adapter.max_angular_spd - adapter.max_linear_acc) * 0.5f));\n\tps->SetValue(PS_FADEOUT_TIME, d2d::UICallback::Data(adapter.fadeout_time));\n\tps->SetValue(PS_START_RADIUS, d2d::UICallback::Data(adapter.start_radius));\n\n\tps->setHori(adapter.min_hori, adapter.max_hori);\n\tps->setVert(adapter.min_vert, adapter.max_vert);\n\tps->setBounce(adapter.bounce);\n\tps->setAdditiveBlend(adapter.additive_blend);\n\tps->SetRadius3D(adapter.start_radius_3d);\n\tps->SetOrientToMovement(adapter.orient_to_movement);\n\n\tfor (size_t i = 0, n = adapter.children.size(); i < n; ++i)\n\t{\n\t\tconst FileAdapter::Child& child = adapter.children[i];\n\n\t\tParticleChild* pc = new ParticleChild;\n\n\t\t\/\/ todo Release symbol\n\t\tpc->symbol = d2d::SymbolMgr::Instance()->FetchSymbol(child.filepath);\n\n\t\tpc->start_scale = child.start_scale * 0.01f;\n\t\tpc->end_scale = child.end_scale * 0.01f;\n\t\tpc->min_rotate = child.min_rotate * d2d::TRANS_DEG_TO_RAD;\n\t\tpc->max_rotate = child.max_rotate * d2d::TRANS_DEG_TO_RAD;\n\n\t\tps->addChild(pc);\n\t}\n\n\treturn ps;\n}\n\n}<|endoftext|>"}
{"text":"<commit_before>#include \"ForceFields.h\"\n#include \"..\/Effekseer.Matrix44.h\"\n#include \"..\/SIMD\/Effekseer.SIMDUtils.h\"\n#include \"..\/Utils\/Effekseer.BinaryReader.h\"\n\nnamespace Effekseer\n{\n\nForceFieldTurbulenceParameter::ForceFieldTurbulenceParameter(int32_t seed, float scale, float strength, int octave)\n\t: Noise(seed)\n{\n\tNoise.Octave = octave;\n\tNoise.Scale = scale;\n\tPower = strength;\n}\n\nLocalForceFieldTurbulenceParameterOld::LocalForceFieldTurbulenceParameterOld(int32_t seed, float scale, float strength, int octave)\n\t: Noise(seed)\n{\n\tNoise.Octave = octave;\n\tNoise.Scale = scale;\n\tStrength = strength;\n}\n\nbool LocalForceFieldParameterOld::Load(uint8_t*& pos, int32_t version)\n{\n\tauto br = BinaryReader<false>(pos, std::numeric_limits<int>::max());\n\n\tLocalForceFieldType type{};\n\tbr.Read(type);\n\n\tif (type == LocalForceFieldType::Turbulence)\n\t{\n\t\tint32_t seed{};\n\t\tfloat scale{};\n\t\tfloat strength{};\n\t\tint octave{};\n\n\t\tbr.Read(seed);\n\t\tbr.Read(scale);\n\t\tbr.Read(strength);\n\t\tbr.Read(octave);\n\n\t\tscale = 1.0f \/ scale;\n\n\t\tTurbulence = std::unique_ptr<LocalForceFieldTurbulenceParameterOld>(\n\t\t\tnew LocalForceFieldTurbulenceParameterOld(seed, scale, strength, octave));\n\t}\n\n\tpos += br.GetOffset();\n\n\treturn true;\n}\n\nbool LocalForceFieldElementParameter::Load(uint8_t*& pos, int32_t version)\n{\n\tauto br = BinaryReader<false>(pos, std::numeric_limits<int>::max());\n\n\tLocalForceFieldType type{};\n\tbr.Read(type);\n\n\tHasValue = true;\n\tfloat power = 1.0f;\n\n\tif (version >= 1600)\n\t{\n\t\tbr.Read(power);\n\n\t\tbr.Read(Position.X);\n\t\tbr.Read(Position.Y);\n\t\tbr.Read(Position.Z);\n\n\t\tVector3D rotation;\n\t\tbr.Read(rotation.X);\n\t\tbr.Read(rotation.Y);\n\t\tbr.Read(rotation.Z);\n\n\t\tIsRotated = rotation.X != 0.0f || rotation.Y != 0.0f || rotation.Z != 0.0f;\n\n\t\tif (IsRotated)\n\t\t{\n\t\t\tRotation = Mat44f::RotationZXY(rotation.Z, rotation.X, rotation.Y);\n\t\t\tMatrix44 invMat;\n\t\t\tInvRotation = Mat44f(Matrix44::Inverse(invMat, ToStruct(Rotation)));\n\t\t}\n\t}\n\n\tif (type == LocalForceFieldType::Force)\n\t{\n\t\tint gravitation = 0;\n\t\tbr.Read(gravitation);\n\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldForceParameter();\n\t\tff->Power = power;\n\t\tff->Gravitation = gravitation > 0;\n\t\tForce = std::unique_ptr<ForceFieldForceParameter>(ff);\n\t}\n\telse if (type == LocalForceFieldType::Wind)\n\t{\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldWindParameter();\n\t\tff->Power = power;\n\t\tWind = std::unique_ptr<ForceFieldWindParameter>(ff);\n\t}\n\telse if (type == LocalForceFieldType::Vortex)\n\t{\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldVortexParameter();\n\t\tff->Power = power;\n\t\tVortex = std::unique_ptr<ForceFieldVortexParameter>(ff);\n\t}\n\telse if (type == LocalForceFieldType::Maginetic)\n\t{\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldMagineticParameter();\n\t\tff->Power = power;\n\t\tMaginetic = std::unique_ptr<ForceFieldMagineticParameter>(ff);\n\t}\n\telse if (type == LocalForceFieldType::Turbulence)\n\t{\n\t\tint32_t seed{};\n\t\tfloat scale{};\n\t\tfloat strength{};\n\t\tint octave{};\n\n\t\tbr.Read(seed);\n\t\tbr.Read(scale);\n\t\tbr.Read(strength);\n\t\tbr.Read(octave);\n\n\t\tscale = 1.0f \/ scale;\n\n\t\tTurbulence = std::unique_ptr<ForceFieldTurbulenceParameter>(new ForceFieldTurbulenceParameter(seed, scale, strength, octave));\n\t}\n\telse if (type == LocalForceFieldType::Drag)\n\t{\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldDragParameter();\n\t\tff->Power = power;\n\t\tDrag = std::unique_ptr<ForceFieldDragParameter>(ff);\n\t}\n\telse\n\t{\n\t\tHasValue = false;\n\t}\n\n\tif (version >= 1600)\n\t{\n\t\tLocalForceFieldFalloffType ffType{};\n\t\tbr.Read(ffType);\n\n\t\tif (ffType != LocalForceFieldFalloffType::None)\n\t\t{\n\t\t\tFalloffCommon = std::make_unique<ForceFieldFalloffCommonParameter>();\n\t\t\tbr.Read(FalloffCommon->Power);\n\t\t\tbr.Read(FalloffCommon->MaxDistance);\n\t\t\tbr.Read(FalloffCommon->MinDistance);\n\t\t}\n\n\t\tif (ffType == LocalForceFieldFalloffType::None)\n\t\t{\n\t\t}\n\t\telse if (ffType == LocalForceFieldFalloffType::Sphere)\n\t\t{\n\t\t\tFalloffSphere = std::make_unique<ForceFieldFalloffSphereParameter>();\n\t\t}\n\t\telse if (ffType == LocalForceFieldFalloffType::Tube)\n\t\t{\n\t\t\tFalloffTube = std::make_unique<ForceFieldFalloffTubeParameter>();\n\t\t\tbr.Read(FalloffTube->RadiusPower);\n\t\t\tbr.Read(FalloffTube->MaxRadius);\n\t\t\tbr.Read(FalloffTube->MinRadius);\n\t\t}\n\t\telse if (ffType == LocalForceFieldFalloffType::Cone)\n\t\t{\n\t\t\tFalloffCone = std::make_unique<ForceFieldFalloffConeParameter>();\n\t\t\tbr.Read(FalloffCone->AnglePower);\n\t\t\tbr.Read(FalloffCone->MaxAngle);\n\t\t\tbr.Read(FalloffCone->MinAngle);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tassert(0);\n\t\t}\n\t}\n\n\tpos += br.GetOffset();\n\n\treturn true;\n}\n\nbool LocalForceFieldParameter::Load(uint8_t*& pos, int32_t version)\n{\n\tint32_t count = 0;\n\tmemcpy(&count, pos, sizeof(int));\n\tpos += sizeof(int);\n\n\tfor (int32_t i = 0; i < count; i++)\n\t{\n\t\tif (!LocalForceFields[i].Load(pos, version))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tfor (auto& ff : LocalForceFields)\n\t{\n\t\tif (ff.HasValue)\n\t\t{\n\t\t\tHasValue = true;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid LocalForceFieldInstance::Update(const LocalForceFieldParameter& parameter, const Vec3f& location, float magnification)\n{\n\tfor (size_t i = 0; i < parameter.LocalForceFields.size(); i++)\n\t{\n\t\tauto& field = parameter.LocalForceFields[i];\n\t\tif (!field.HasValue)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tForceFieldCommonParameter ffcp;\n\t\tffcp.FieldCenter = parameter.LocalForceFields[i].Position;\n\t\tffcp.Position = location \/ magnification;\n\t\tffcp.PreviousSumVelocity = VelocitySum;\n\t\tffcp.PreviousVelocity = Velocities[i];\n\t\tffcp.IsFieldRotated = field.IsRotated;\n\n\t\tif (field.IsRotated)\n\t\t{\n\t\t\tffcp.PreviousSumVelocity = Vec3f::Transform(VelocitySum, field.InvRotation);\n\t\t\tffcp.PreviousVelocity = Vec3f::Transform(Velocities[i], field.InvRotation);\n\t\t\tffcp.Position = Vec3f::Transform(ffcp.Position, field.InvRotation);\n\t\t}\n\n\t\tForceField ff;\n\n\t\tVec3f acc = Vec3f(0, 0, 0);\n\t\tif (field.Force != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Force) * magnification;\n\t\t}\n\n\t\tif (field.Wind != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Wind) * magnification;\n\t\t}\n\n\t\tif (field.Vortex != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Vortex) * magnification;\n\t\t}\n\n\t\tif (field.Maginetic != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Maginetic) * magnification;\n\t\t}\n\n\t\tif (field.Turbulence != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Turbulence) * magnification;\n\t\t}\n\n\t\tif (field.Drag != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Drag) * magnification;\n\t\t}\n\n\t\tfloat power = 1.0f;\n\t\tif (field.FalloffCommon != nullptr && field.FalloffCone != nullptr)\n\t\t{\n\t\t\tForceFieldFalloff fff;\n\t\t\tpower = fff.GetPower(power, ffcp, *field.FalloffCommon, *field.FalloffCone);\n\t\t}\n\n\t\tif (field.FalloffCommon != nullptr && field.FalloffSphere != nullptr)\n\t\t{\n\t\t\tForceFieldFalloff fff;\n\t\t\tpower = fff.GetPower(power, ffcp, *field.FalloffCommon, *field.FalloffSphere);\n\t\t}\n\n\t\tif (field.FalloffCommon != nullptr && field.FalloffTube != nullptr)\n\t\t{\n\t\t\tForceFieldFalloff fff;\n\t\t\tpower = fff.GetPower(power, ffcp, *field.FalloffCommon, *field.FalloffTube);\n\t\t}\n\n\t\tacc *= power;\n\n\t\tif (field.IsRotated)\n\t\t{\n\t\t\tacc = Vec3f::Transform(acc, field.Rotation);\n\t\t}\n\n\t\tVelocities[i] += acc;\n\t}\n\n\tVelocitySum = Vec3f(0, 0, 0);\n\n\tfor (size_t i = 0; i < parameter.LocalForceFields.size(); i++)\n\t{\n\t\tVelocitySum += Velocities[i];\n\t}\n\n\tModifyLocation += VelocitySum;\n}\n\nvoid LocalForceFieldInstance::Reset()\n{\n\tVelocities.fill(Vec3f(0, 0, 0));\n\tVelocitySum = Vec3f(0, 0, 0);\n\tModifyLocation = Vec3f(0, 0, 0);\n}\n\n} \/\/ namespace Effekseer<commit_msg>Fix uninitialized bug<commit_after>#include \"ForceFields.h\"\n#include \"..\/Effekseer.Matrix44.h\"\n#include \"..\/SIMD\/Effekseer.SIMDUtils.h\"\n#include \"..\/Utils\/Effekseer.BinaryReader.h\"\n\nnamespace Effekseer\n{\n\nForceFieldTurbulenceParameter::ForceFieldTurbulenceParameter(int32_t seed, float scale, float strength, int octave)\n\t: Noise(seed)\n{\n\tNoise.Octave = octave;\n\tNoise.Scale = scale;\n\tPower = strength;\n}\n\nLocalForceFieldTurbulenceParameterOld::LocalForceFieldTurbulenceParameterOld(int32_t seed, float scale, float strength, int octave)\n\t: Noise(seed)\n{\n\tNoise.Octave = octave;\n\tNoise.Scale = scale;\n\tStrength = strength;\n}\n\nbool LocalForceFieldParameterOld::Load(uint8_t*& pos, int32_t version)\n{\n\tauto br = BinaryReader<false>(pos, std::numeric_limits<int>::max());\n\n\tLocalForceFieldType type{};\n\tbr.Read(type);\n\n\tif (type == LocalForceFieldType::Turbulence)\n\t{\n\t\tint32_t seed{};\n\t\tfloat scale{};\n\t\tfloat strength{};\n\t\tint octave{};\n\n\t\tbr.Read(seed);\n\t\tbr.Read(scale);\n\t\tbr.Read(strength);\n\t\tbr.Read(octave);\n\n\t\tscale = 1.0f \/ scale;\n\n\t\tTurbulence = std::unique_ptr<LocalForceFieldTurbulenceParameterOld>(\n\t\t\tnew LocalForceFieldTurbulenceParameterOld(seed, scale, strength, octave));\n\t}\n\n\tpos += br.GetOffset();\n\n\treturn true;\n}\n\nbool LocalForceFieldElementParameter::Load(uint8_t*& pos, int32_t version)\n{\n\tauto br = BinaryReader<false>(pos, std::numeric_limits<int>::max());\n\n\tLocalForceFieldType type{};\n\tbr.Read(type);\n\n\tHasValue = true;\n\tfloat power = 1.0f;\n\n\tif (version >= 1600)\n\t{\n\t\tbr.Read(power);\n\n\t\tbr.Read(Position.X);\n\t\tbr.Read(Position.Y);\n\t\tbr.Read(Position.Z);\n\n\t\tVector3D rotation;\n\t\tbr.Read(rotation.X);\n\t\tbr.Read(rotation.Y);\n\t\tbr.Read(rotation.Z);\n\n\t\tIsRotated = rotation.X != 0.0f || rotation.Y != 0.0f || rotation.Z != 0.0f;\n\n\t\tif (IsRotated)\n\t\t{\n\t\t\tRotation = Mat44f::RotationZXY(rotation.Z, rotation.X, rotation.Y);\n\t\t\tMatrix44 invMat;\n\t\t\tInvRotation = Mat44f(Matrix44::Inverse(invMat, ToStruct(Rotation)));\n\t\t}\n\t}\n\n\tif (type == LocalForceFieldType::Force)\n\t{\n\t\tint gravitation = 0;\n\t\tbr.Read(gravitation);\n\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldForceParameter();\n\t\tff->Power = power;\n\t\tff->Gravitation = gravitation > 0;\n\t\tForce = std::unique_ptr<ForceFieldForceParameter>(ff);\n\t}\n\telse if (type == LocalForceFieldType::Wind)\n\t{\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldWindParameter();\n\t\tff->Power = power;\n\t\tWind = std::unique_ptr<ForceFieldWindParameter>(ff);\n\t}\n\telse if (type == LocalForceFieldType::Vortex)\n\t{\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldVortexParameter();\n\t\tff->Power = power;\n\t\tVortex = std::unique_ptr<ForceFieldVortexParameter>(ff);\n\t}\n\telse if (type == LocalForceFieldType::Maginetic)\n\t{\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldMagineticParameter();\n\t\tff->Power = power;\n\t\tMaginetic = std::unique_ptr<ForceFieldMagineticParameter>(ff);\n\t}\n\telse if (type == LocalForceFieldType::Turbulence)\n\t{\n\t\tint32_t seed{};\n\t\tfloat scale{};\n\t\tfloat strength{};\n\t\tint octave{};\n\n\t\tbr.Read(seed);\n\t\tbr.Read(scale);\n\t\tbr.Read(strength);\n\t\tbr.Read(octave);\n\n\t\tscale = 1.0f \/ scale;\n\n\t\tTurbulence = std::unique_ptr<ForceFieldTurbulenceParameter>(new ForceFieldTurbulenceParameter(seed, scale, strength, octave));\n\t}\n\telse if (type == LocalForceFieldType::Drag)\n\t{\n\t\t\/\/ convert it by frames\n\t\tpower \/= 60.0f;\n\n\t\tauto ff = new ForceFieldDragParameter();\n\t\tff->Power = power;\n\t\tDrag = std::unique_ptr<ForceFieldDragParameter>(ff);\n\t}\n\telse\n\t{\n\t\tHasValue = false;\n\t}\n\n\tif (version >= 1600)\n\t{\n\t\tLocalForceFieldFalloffType ffType{};\n\t\tbr.Read(ffType);\n\n\t\tif (ffType != LocalForceFieldFalloffType::None)\n\t\t{\n\t\t\tFalloffCommon = std::make_unique<ForceFieldFalloffCommonParameter>();\n\t\t\tbr.Read(FalloffCommon->Power);\n\t\t\tbr.Read(FalloffCommon->MaxDistance);\n\t\t\tbr.Read(FalloffCommon->MinDistance);\n\t\t}\n\n\t\tif (ffType == LocalForceFieldFalloffType::None)\n\t\t{\n\t\t}\n\t\telse if (ffType == LocalForceFieldFalloffType::Sphere)\n\t\t{\n\t\t\tFalloffSphere = std::make_unique<ForceFieldFalloffSphereParameter>();\n\t\t}\n\t\telse if (ffType == LocalForceFieldFalloffType::Tube)\n\t\t{\n\t\t\tFalloffTube = std::make_unique<ForceFieldFalloffTubeParameter>();\n\t\t\tbr.Read(FalloffTube->RadiusPower);\n\t\t\tbr.Read(FalloffTube->MaxRadius);\n\t\t\tbr.Read(FalloffTube->MinRadius);\n\t\t}\n\t\telse if (ffType == LocalForceFieldFalloffType::Cone)\n\t\t{\n\t\t\tFalloffCone = std::make_unique<ForceFieldFalloffConeParameter>();\n\t\t\tbr.Read(FalloffCone->AnglePower);\n\t\t\tbr.Read(FalloffCone->MaxAngle);\n\t\t\tbr.Read(FalloffCone->MinAngle);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tassert(0);\n\t\t}\n\t}\n\telse\n\t{\n\t\tIsRotated = false;\n\t}\n\n\tpos += br.GetOffset();\n\n\treturn true;\n}\n\nbool LocalForceFieldParameter::Load(uint8_t*& pos, int32_t version)\n{\n\tint32_t count = 0;\n\tmemcpy(&count, pos, sizeof(int));\n\tpos += sizeof(int);\n\n\tfor (int32_t i = 0; i < count; i++)\n\t{\n\t\tif (!LocalForceFields[i].Load(pos, version))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tfor (auto& ff : LocalForceFields)\n\t{\n\t\tif (ff.HasValue)\n\t\t{\n\t\t\tHasValue = true;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid LocalForceFieldInstance::Update(const LocalForceFieldParameter& parameter, const Vec3f& location, float magnification)\n{\n\tfor (size_t i = 0; i < parameter.LocalForceFields.size(); i++)\n\t{\n\t\tauto& field = parameter.LocalForceFields[i];\n\t\tif (!field.HasValue)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tForceFieldCommonParameter ffcp;\n\t\tffcp.FieldCenter = parameter.LocalForceFields[i].Position;\n\t\tffcp.Position = location \/ magnification;\n\t\tffcp.PreviousSumVelocity = VelocitySum;\n\t\tffcp.PreviousVelocity = Velocities[i];\n\t\tffcp.IsFieldRotated = field.IsRotated;\n\n\t\tif (field.IsRotated)\n\t\t{\n\t\t\tffcp.PreviousSumVelocity = Vec3f::Transform(VelocitySum, field.InvRotation);\n\t\t\tffcp.PreviousVelocity = Vec3f::Transform(Velocities[i], field.InvRotation);\n\t\t\tffcp.Position = Vec3f::Transform(ffcp.Position, field.InvRotation);\n\t\t}\n\n\t\tForceField ff;\n\n\t\tVec3f acc = Vec3f(0, 0, 0);\n\t\tif (field.Force != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Force) * magnification;\n\t\t}\n\n\t\tif (field.Wind != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Wind) * magnification;\n\t\t}\n\n\t\tif (field.Vortex != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Vortex) * magnification;\n\t\t}\n\n\t\tif (field.Maginetic != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Maginetic) * magnification;\n\t\t}\n\n\t\tif (field.Turbulence != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Turbulence) * magnification;\n\t\t}\n\n\t\tif (field.Drag != nullptr)\n\t\t{\n\t\t\tacc = ff.GetAcceleration(ffcp, *field.Drag) * magnification;\n\t\t}\n\n\t\tfloat power = 1.0f;\n\t\tif (field.FalloffCommon != nullptr && field.FalloffCone != nullptr)\n\t\t{\n\t\t\tForceFieldFalloff fff;\n\t\t\tpower = fff.GetPower(power, ffcp, *field.FalloffCommon, *field.FalloffCone);\n\t\t}\n\n\t\tif (field.FalloffCommon != nullptr && field.FalloffSphere != nullptr)\n\t\t{\n\t\t\tForceFieldFalloff fff;\n\t\t\tpower = fff.GetPower(power, ffcp, *field.FalloffCommon, *field.FalloffSphere);\n\t\t}\n\n\t\tif (field.FalloffCommon != nullptr && field.FalloffTube != nullptr)\n\t\t{\n\t\t\tForceFieldFalloff fff;\n\t\t\tpower = fff.GetPower(power, ffcp, *field.FalloffCommon, *field.FalloffTube);\n\t\t}\n\n\t\tacc *= power;\n\n\t\tif (field.IsRotated)\n\t\t{\n\t\t\tacc = Vec3f::Transform(acc, field.Rotation);\n\t\t}\n\n\t\tVelocities[i] += acc;\n\t}\n\n\tVelocitySum = Vec3f(0, 0, 0);\n\n\tfor (size_t i = 0; i < parameter.LocalForceFields.size(); i++)\n\t{\n\t\tVelocitySum += Velocities[i];\n\t}\n\n\tModifyLocation += VelocitySum;\n}\n\nvoid LocalForceFieldInstance::Reset()\n{\n\tVelocities.fill(Vec3f(0, 0, 0));\n\tVelocitySum = Vec3f(0, 0, 0);\n\tModifyLocation = Vec3f(0, 0, 0);\n}\n\n} \/\/ namespace Effekseer<|endoftext|>"}
{"text":"<commit_before>#include \"CallBackWrapper.hpp\"\n#include \"Config.hpp\"\n#include \"EventWatcher.hpp\"\n#include \"keycode.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n  void\n  Params_KeyboardEventCallBack::log(const char* message) const\n  {\n    if (! config.debug) return;\n\n    printf(\"KeyRemap4MacBook KeyboardEventCallback [%s]: eventType %d, flags 0x%x, key %d, kbdType %d\\n\",\n           message, eventType, flags, key, keyboardType);\n  }\n\n  void\n  Params_KeyboardSpecialEventCallback::log(const char* message) const\n  {\n    if (! config.debug) return;\n\n    printf(\"KeyRemap4MacBook KeyboardSpecialEventCallBack [%s]: eventType %d, flags 0x%x, key %d, flavor %d, guid %lld\\n\",\n           message, eventType, flags, key, flavor, guid);\n  }\n\n  void\n  Params_RelativePointerEventCallback::log(const char* message) const\n  {\n    if (! config.debug_pointing) return;\n\n    printf(\"KeyRemap4MacBook RelativePointerEventCallBack [%s]: buttons: %d, dx: %d, dy: %d\\n\",\n           message, buttons, dx, dy);\n  }\n\n  void\n  Params_ScrollWheelEventCallback::log(const char* message) const\n  {\n    if (! config.debug_pointing) return;\n\n#if __x86_64__\n    const char* format = \"KeyRemap4MacBook ScrollWheelEventCallback [%s]: deltaAxis(%d, %d, %d), fixedDelta(%ld, %ld, %ld), pointDelta(%d,%d,%d), options: %d\\n\";\n#else\n    const char* format = \"KeyRemap4MacBook ScrollWheelEventCallback [%s]: deltaAxis(%d, %d, %d), fixedDelta(%d, %d, %d), pointDelta(%d,%d,%d), options: %d\\n\";\n#endif\n    printf(format,\n           message,\n           deltaAxis1, deltaAxis2, deltaAxis3,\n           fixedDelta1, fixedDelta2, fixedDelta3,\n           pointDelta1, pointDelta2, pointDelta3,\n           options);\n  }\n\n  \/\/ ----------------------------------------------------------------------\n  void\n  Params_KeyboardEventCallBack::apply(KeyboardEventCallback callback) const\n  {\n    if (! callback) return;\n\n    \/\/ ------------------------------------------------------------\n    if (key >= KeyCode::VK__BEGIN__) {\n      \/\/ Invalid keycode\n      IOLog(\"[KeyRemap4MacBook ERROR] Params_KeyboardEventCallBack::apply invalid key:%d\\n\", key);\n      return;\n    }\n\n    if (config.option_drop_slowexpose) {\n      \/\/ Skip if Shift+F8,F9,F10,F11,F12,EXPOSE_ALL.\n      if (key == KeyCode::F8 || key == KeyCode::F9 ||\n          key == KeyCode::F10 || key == KeyCode::F11 ||\n          key == KeyCode::F12 || key == KeyCode::EXPOSE_ALL) {\n        if (ModifierFlag::isOn(flags, ModifierFlag::SHIFT_L) ||\n            ModifierFlag::isOn(flags, ModifierFlag::SHIFT_R)) {\n          return;\n        }\n      }\n    }\n\n    if (config.option_jis_drop_eisuukana_with_modifiers) {\n      \/\/ Skip if EISUU,KANA with any modifiers.\n      if (key == KeyCode::JIS_EISUU || key == KeyCode::JIS_KANA) {\n        if (flags != 0) {\n          return;\n        }\n      }\n    }\n\n    \/\/ ------------------------------------------------------------\n    log(\"sending\");\n    callback(target, eventType, flags, key, charCode, charSet, origCharCode, origCharSet,\n             keyboardType, repeat, ts, sender, refcon);\n\n    \/\/ XXX: comment out temporarily\n    \/\/EventWatcher::on();\n  }\n\n  void\n  Params_KeyboardSpecialEventCallback::apply(KeyboardSpecialEventCallback callback) const\n  {\n    if (! callback) return;\n\n    log(\"sending\");\n    callback(target, eventType, flags, key, flavor, guid, repeat, ts, sender, refcon);\n\n    \/\/ XXX: comment out temporarily\n    \/\/EventWatcher::on();\n  }\n\n  void\n  Params_RelativePointerEventCallback::apply(RelativePointerEventCallback callback) const\n  {\n    if (! callback) return;\n\n    log(\"sending\");\n    callback(target, buttons, dx, dy, ts, sender, refcon);\n\n    if (buttons != PointingButton::NONE) {\n      EventWatcher::on();\n    }\n  }\n\n  void\n  Params_ScrollWheelEventCallback::apply(ScrollWheelEventCallback callback) const\n  {\n    if (! callback) return;\n\n    log(\"sending\");\n    callback(target,\n             deltaAxis1, deltaAxis2, deltaAxis3,\n             fixedDelta1, fixedDelta2, fixedDelta3,\n             pointDelta1, pointDelta2, pointDelta3,\n             options, ts, sender, refcon);\n\n    \/\/ EventWatcher::on is not necessary.\n  }\n}\n<commit_msg>update CallBackWrapper around EventWatcher @ kext<commit_after>#include \"CallBackWrapper.hpp\"\n#include \"Config.hpp\"\n#include \"EventWatcher.hpp\"\n#include \"keycode.hpp\"\n#include \"RemapUtil.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n  void\n  Params_KeyboardEventCallBack::log(const char* message) const\n  {\n    if (! config.debug) return;\n\n    printf(\"KeyRemap4MacBook KeyboardEventCallback [%s]: eventType %d, flags 0x%x, key %d, kbdType %d\\n\",\n           message, eventType, flags, key, keyboardType);\n  }\n\n  void\n  Params_KeyboardSpecialEventCallback::log(const char* message) const\n  {\n    if (! config.debug) return;\n\n    printf(\"KeyRemap4MacBook KeyboardSpecialEventCallBack [%s]: eventType %d, flags 0x%x, key %d, flavor %d, guid %lld\\n\",\n           message, eventType, flags, key, flavor, guid);\n  }\n\n  void\n  Params_RelativePointerEventCallback::log(const char* message) const\n  {\n    if (! config.debug_pointing) return;\n\n    printf(\"KeyRemap4MacBook RelativePointerEventCallBack [%s]: buttons: %d, dx: %d, dy: %d\\n\",\n           message, buttons, dx, dy);\n  }\n\n  void\n  Params_ScrollWheelEventCallback::log(const char* message) const\n  {\n    if (! config.debug_pointing) return;\n\n#if __x86_64__\n    const char* format = \"KeyRemap4MacBook ScrollWheelEventCallback [%s]: deltaAxis(%d, %d, %d), fixedDelta(%ld, %ld, %ld), pointDelta(%d,%d,%d), options: %d\\n\";\n#else\n    const char* format = \"KeyRemap4MacBook ScrollWheelEventCallback [%s]: deltaAxis(%d, %d, %d), fixedDelta(%d, %d, %d), pointDelta(%d,%d,%d), options: %d\\n\";\n#endif\n    printf(format,\n           message,\n           deltaAxis1, deltaAxis2, deltaAxis3,\n           fixedDelta1, fixedDelta2, fixedDelta3,\n           pointDelta1, pointDelta2, pointDelta3,\n           options);\n  }\n\n  \/\/ ----------------------------------------------------------------------\n  void\n  Params_KeyboardEventCallBack::apply(KeyboardEventCallback callback) const\n  {\n    if (! callback) return;\n\n    \/\/ ------------------------------------------------------------\n    if (key >= KeyCode::VK__BEGIN__) {\n      \/\/ Invalid keycode\n      IOLog(\"[KeyRemap4MacBook ERROR] Params_KeyboardEventCallBack::apply invalid key:%d\\n\", key);\n      return;\n    }\n\n    if (config.option_drop_slowexpose) {\n      \/\/ Skip if Shift+F8,F9,F10,F11,F12,EXPOSE_ALL.\n      if (key == KeyCode::F8 || key == KeyCode::F9 ||\n          key == KeyCode::F10 || key == KeyCode::F11 ||\n          key == KeyCode::F12 || key == KeyCode::EXPOSE_ALL) {\n        if (ModifierFlag::isOn(flags, ModifierFlag::SHIFT_L) ||\n            ModifierFlag::isOn(flags, ModifierFlag::SHIFT_R)) {\n          return;\n        }\n      }\n    }\n\n    if (config.option_jis_drop_eisuukana_with_modifiers) {\n      \/\/ Skip if EISUU,KANA with any modifiers.\n      if (key == KeyCode::JIS_EISUU || key == KeyCode::JIS_KANA) {\n        if (flags != 0) {\n          return;\n        }\n      }\n    }\n\n    \/\/ ------------------------------------------------------------\n    log(\"sending\");\n    callback(target, eventType, flags, key, charCode, charSet, origCharCode, origCharSet,\n             keyboardType, repeat, ts, sender, refcon);\n\n    switch (eventType) {\n      case KeyEvent::DOWN:\n        EventWatcher::on();\n        break;\n      case KeyEvent::MODIFY:\n        if (RemapUtil::isModifierOn(flags, RemapUtil::getKeyCodeModifier(key))) {\n          EventWatcher::on();\n        }\n        break;\n      default:\n        break;\n    }\n  }\n\n  void\n  Params_KeyboardSpecialEventCallback::apply(KeyboardSpecialEventCallback callback) const\n  {\n    if (! callback) return;\n\n    log(\"sending\");\n    callback(target, eventType, flags, key, flavor, guid, repeat, ts, sender, refcon);\n\n    if (eventType == KeyEvent::DOWN) {\n      EventWatcher::on();\n    }\n  }\n\n  void\n  Params_RelativePointerEventCallback::apply(RelativePointerEventCallback callback) const\n  {\n    if (! callback) return;\n\n    log(\"sending\");\n    callback(target, buttons, dx, dy, ts, sender, refcon);\n\n    if (buttons != PointingButton::NONE) {\n      EventWatcher::on();\n    }\n  }\n\n  void\n  Params_ScrollWheelEventCallback::apply(ScrollWheelEventCallback callback) const\n  {\n    if (! callback) return;\n\n    log(\"sending\");\n    callback(target,\n             deltaAxis1, deltaAxis2, deltaAxis3,\n             fixedDelta1, fixedDelta2, fixedDelta3,\n             pointDelta1, pointDelta2, pointDelta3,\n             options, ts, sender, refcon);\n\n    \/\/ EventWatcher::on is not necessary.\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n (Ported from Arduino to Energia)\n\nUSBSerial.cpp (formerly NewSoftSerial.cpp) - \n Multi-instance USB serial library for Arduino\/Wiring\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\/\/ \n\/\/ Includes\n\/\/ \n\/\/#include <avr\/interrupt.h>\n\/\/#include <avr\/pgmspace.h>\n\/\/#include \"Arduino.h\"\n#include \"Energia.h\"\n#include \"USBSerial.h\"\n\n#include \"descriptors.h\"\n\n#include \"device.h\"\n#include \"types.h\"               \/\/Basic Type declarations\n#include \"usb.h\"                 \/\/USB-specific functions\n\n#include \"HAL_UCS.h\"\n\/\/#include \"HAL_PMM.h\"\n\n#include \"UsbCdc.h\"\n#include \"usbConstructs.h\"\n\n\n\/\/\n\/\/ Statics\n\/\/\n\n\n\/\/\n\/\/ Private methods\n\/\/\n\nvolatile BYTE bCDCDataReceived_event = FALSE;   \/\/Flag set by event handler to indicate data has been received into USB buffer\n\n#define BUFFER_SIZE 256\nchar nl[2] = \"\\n\";\nchar dataBuffer[BUFFER_SIZE] = \"\";\nWORD count;                    \n\n\n\/\/\n\/\/ Interrupt handling\n\/\/\n\n\/* static *\/\nvoid USBSerial::handle_interrupt()\n{\n}\n\n\/\/\n\/\/ Constructor\n\/\/\nUSBSerial::USBSerial(uint16_t port)\n{\n}\n\n\/\/\n\/\/ Destructor\n\/\/\nUSBSerial::~USBSerial()\n{\n  end();\n}\n\n\n\/\/\n\/\/ Public methods\n\/\/\n\nvoid USBSerial::begin()\n{\n    __disable_interrupt();                           \/\/Enable interrupts globally\n    \/\/Initialization of clock module\n    if (USB_PLL_XT == 2){\n\t\t#if defined (__MSP430F552x) || defined (__MSP430F550x)\n\t\t\tP5SEL |= 0x0C;                                      \/\/enable XT2 pins for F5529\n\t\t#elif defined (__MSP430F563x_F663x)\n\t\t\tP7SEL |= 0x0C;\n\t\t#endif\n\n        XT2_Start(XT2DRIVE_0);                                          \/\/Start the \"USB crystal\"\n    } \n\telse {\n\t\t#if defined (__MSP430F552x) || defined (__MSP430F550x)\n\t\t\tP5SEL |= 0x10;                                      \/\/enable XT1 pins\n\t\t#endif\n\n        XT1_Start(XT1DRIVE_0);                                          \/\/Start the \"USB crystal\"\n    }\n\t\n    USB_init();                 \/\/Init USB\n\n    \/\/Enable various USB event handling routines\n    USB_setEnabledEvents(kUSB_allUsbEvents);\n\n\n    \/\/ See if we're already attached physically to USB, and if so, connect to it\n    \/\/ Normally applications don't invoke the event handlers, but this is an exception.\n    if (USB_connectionInfo() & kUSB_vbusPresent)\n      USB_handleVbusOnEvent();\n    __enable_interrupt();                           \/\/Enable interrupts globally\n}\n\nvoid USBSerial::end()\n{\n  USB_disable();\n}\n\n\n\/\/ Read data from buffer\nint USBSerial::read()\n{\n  WORD count; \n  BYTE dataBuffer = 0;  \n\n  \/\/ Read from \"head\"\n  count = cdcReceiveDataInBuffer((BYTE*)&dataBuffer,\n    1,\n    CDC0_INTFNUM);                                \/\/Count has the number of bytes received into\n                                                  \/\/dataBuffer\n  \/\/ Empty buffer?\n  if (count == 0){\n    bCDCDataReceived_event = FALSE;\n    return -1;\n\t}\n  \n  return (int)dataBuffer;\n}\n\nint USBSerial::available()\n{\n  if ( (USB_connectionState() == ST_ENUM_ACTIVE) && (USBCDC_bytesInUSBBuffer(CDC0_INTFNUM) > 0) ) return 1;\n  return 0;\n}\n\nsize_t USBSerial::write(uint8_t b)\n{\n\n  if (cdcSendDataInBackground((BYTE*)&b,1,CDC0_INTFNUM,0)){  \t\/\/send char to the Host\n    return 0;   \/\/ could not write\n  }\n  return 1;\n}\n\n\nsize_t USBSerial::write(const uint8_t *buffer, size_t size)\n{\n\n  if (cdcSendDataInBackground((BYTE*)buffer,size,CDC0_INTFNUM,0)){  \t\/\/send char to the Host\n    return 0;   \/\/ could not write\n  }\n  return 1;\n}\n\nvoid USBSerial::flush()\n{\n  while (USBCDC_bytesInUSBBuffer(CDC0_INTFNUM) > 0);            \/\/ wait till all send\n}\n\nint USBSerial::peek()\n{\n\n  \/\/ Empty buffer?\n  if (USBCDC_bytesInUSBBuffer(CDC0_INTFNUM) == 0)\n    return -1;\n\n  \/\/ Read from \"head\"\n  return USBCDC_bytesInUSBBuffer(CDC0_INTFNUM);\n}\n\n\/*  \n * ======== UNMI_ISR ========\n *\/\n#ifndef __GNUC__\n#pragma vector = UNMI_VECTOR\n__interrupt\n#else\n__attribute__((interrupt(UNMI_VECTOR)))\n#endif\n\/\/UNMI interrupt service routine\nstatic void UNMI_ISR(void)\n{\n    switch (__even_in_range(SYSUNIV, SYSUNIV_BUSIFG ))\n    {\n        case SYSUNIV_NONE:\n            __no_operation();\n            break;\n        case SYSUNIV_NMIIFG:\n            __no_operation();\n            break;\n        case SYSUNIV_OFIFG:\n            UCSCTL7 &= ~(DCOFFG + XT1LFOFFG + XT2OFFG); \/\/Clear OSC flaut Flags fault flags\n            SFRIFG1 &= ~OFIFG;                          \/\/Clear OFIFG fault flag\n            break;\n        case SYSUNIV_ACCVIFG:\n            __no_operation();\n            break;\n        case SYSUNIV_BUSIFG:\n            SYSBERRIV = 0;                                      \/\/clear bus error flag\n            USB_disable();                                      \/\/Disable\n    }\n}\n<commit_msg>change transmition mode from cdcSendDataInBackground to cdcSendDataWaitTilDone old method give issues if data on Stack should be transmited and the stack get cleaned up in the main function during the background process<commit_after>\/*\n (Ported from Arduino to Energia)\n\nUSBSerial.cpp (formerly NewSoftSerial.cpp) - \n Multi-instance USB serial library for Arduino\/Wiring\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\/\/ \n\/\/ Includes\n\/\/ \n\/\/#include <avr\/interrupt.h>\n\/\/#include <avr\/pgmspace.h>\n\/\/#include \"Arduino.h\"\n#include \"Energia.h\"\n#include \"USBSerial.h\"\n\n#include \"descriptors.h\"\n\n#include \"device.h\"\n#include \"types.h\"               \/\/Basic Type declarations\n#include \"usb.h\"                 \/\/USB-specific functions\n\n#include \"HAL_UCS.h\"\n\/\/#include \"HAL_PMM.h\"\n\n#include \"UsbCdc.h\"\n#include \"usbConstructs.h\"\n\n\n\/\/\n\/\/ Statics\n\/\/\n\n\n\/\/\n\/\/ Private methods\n\/\/\n\nvolatile BYTE bCDCDataReceived_event = FALSE;   \/\/Flag set by event handler to indicate data has been received into USB buffer\n\n#define BUFFER_SIZE 256\nchar nl[2] = \"\\n\";\nchar dataBuffer[BUFFER_SIZE] = \"\";\nWORD count;                    \n\n\n\/\/\n\/\/ Interrupt handling\n\/\/\n\n\/* static *\/\nvoid USBSerial::handle_interrupt()\n{\n}\n\n\/\/\n\/\/ Constructor\n\/\/\nUSBSerial::USBSerial(uint16_t port)\n{\n}\n\n\/\/\n\/\/ Destructor\n\/\/\nUSBSerial::~USBSerial()\n{\n  end();\n}\n\n\n\/\/\n\/\/ Public methods\n\/\/\n\nvoid USBSerial::begin()\n{\n    __disable_interrupt();                           \/\/Enable interrupts globally\n    \/\/Initialization of clock module\n    if (USB_PLL_XT == 2){\n\t\t#if defined (__MSP430F552x) || defined (__MSP430F550x)\n\t\t\tP5SEL |= 0x0C;                                      \/\/enable XT2 pins for F5529\n\t\t#elif defined (__MSP430F563x_F663x)\n\t\t\tP7SEL |= 0x0C;\n\t\t#endif\n\n        XT2_Start(XT2DRIVE_0);                                          \/\/Start the \"USB crystal\"\n    } \n\telse {\n\t\t#if defined (__MSP430F552x) || defined (__MSP430F550x)\n\t\t\tP5SEL |= 0x10;                                      \/\/enable XT1 pins\n\t\t#endif\n\n        XT1_Start(XT1DRIVE_0);                                          \/\/Start the \"USB crystal\"\n    }\n\t\n    USB_init();                 \/\/Init USB\n\n    \/\/Enable various USB event handling routines\n    USB_setEnabledEvents(kUSB_allUsbEvents);\n\n\n    \/\/ See if we're already attached physically to USB, and if so, connect to it\n    \/\/ Normally applications don't invoke the event handlers, but this is an exception.\n    if (USB_connectionInfo() & kUSB_vbusPresent)\n      USB_handleVbusOnEvent();\n    __enable_interrupt();                           \/\/Enable interrupts globally\n}\n\nvoid USBSerial::end()\n{\n  USB_disable();\n}\n\n\n\/\/ Read data from buffer\nint USBSerial::read()\n{\n  WORD count; \n  BYTE dataBuffer = 0;  \n\n  \/\/ Read from \"head\"\n  count = cdcReceiveDataInBuffer((BYTE*)&dataBuffer,\n    1,\n    CDC0_INTFNUM);                                \/\/Count has the number of bytes received into\n                                                  \/\/dataBuffer\n  \/\/ Empty buffer?\n  if (count == 0){\n    bCDCDataReceived_event = FALSE;\n    return -1;\n\t}\n  \n  return (int)dataBuffer;\n}\n\nint USBSerial::available()\n{\n  if ( (USB_connectionState() == ST_ENUM_ACTIVE) && (USBCDC_bytesInUSBBuffer(CDC0_INTFNUM) > 0) ) return 1;\n  return 0;\n}\n\nsize_t USBSerial::write(uint8_t b)\n{\n\n  if (cdcSendDataWaitTilDone((BYTE*)&b,1,CDC0_INTFNUM,0)){  \t\/\/send char to the Host\n    return 0;   \/\/ could not write\n  }\n  return 1;\n}\n\n\nsize_t USBSerial::write(const uint8_t *buffer, size_t size)\n{\n\n  if (cdcSendDataWaitTilDone((BYTE*)buffer,size,CDC0_INTFNUM,0)){  \t\/\/send char to the Host\n    return 0;   \/\/ could not write\n  }\n  return 1;\n}\n\nvoid USBSerial::flush()\n{\n  while (USBCDC_bytesInUSBBuffer(CDC0_INTFNUM) > 0);            \/\/ wait till all send\n}\n\nint USBSerial::peek()\n{\n\n  \/\/ Empty buffer?\n  if (USBCDC_bytesInUSBBuffer(CDC0_INTFNUM) == 0)\n    return -1;\n\n  \/\/ Read from \"head\"\n  return USBCDC_bytesInUSBBuffer(CDC0_INTFNUM);\n}\n\n\/*  \n * ======== UNMI_ISR ========\n *\/\n#ifndef __GNUC__\n#pragma vector = UNMI_VECTOR\n__interrupt\n#else\n__attribute__((interrupt(UNMI_VECTOR)))\n#endif\n\/\/UNMI interrupt service routine\nstatic void UNMI_ISR(void)\n{\n    switch (__even_in_range(SYSUNIV, SYSUNIV_BUSIFG ))\n    {\n        case SYSUNIV_NONE:\n            __no_operation();\n            break;\n        case SYSUNIV_NMIIFG:\n            __no_operation();\n            break;\n        case SYSUNIV_OFIFG:\n            UCSCTL7 &= ~(DCOFFG + XT1LFOFFG + XT2OFFG); \/\/Clear OSC flaut Flags fault flags\n            SFRIFG1 &= ~OFIFG;                          \/\/Clear OFIFG fault flag\n            break;\n        case SYSUNIV_ACCVIFG:\n            __no_operation();\n            break;\n        case SYSUNIV_BUSIFG:\n            SYSBERRIV = 0;                                      \/\/clear bus error flag\n            USB_disable();                                      \/\/Disable\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"opencv2\/opencv.hpp\"\n#include \"opencv2\/features2d.hpp\"\n#include \"opencv2\/xfeatures2d.hpp\"\nusing namespace cv;\n\n#include \"Pipeline.hpp\"\n\nvoid Pipeline::extract_features(const Images& images,CamFrames& cam_Frames,DescriptorsVec& descriptors_vec)\n{\n\t\/\/ create a sift detector\n\t\/\/ const int feature_num = 50;\n\t\/\/ Ptr<Feature2D> sift_detector = SIFT::create(feature_num);\n\t\n\t\/\/ create brist detector \n\t\/\/ parameters for brisk : int thresh = 30, int octaves = 3, float patternScale = 1.0f \n\tPtr<Feature2D> brisk_detector = BRISK::create();\n\n\t\/\/ detect features in a loop\n\tfor (int i = 0; i < images.size(); ++i)\n\t{\n\t\tKeyPoints key_points;\n\t\tDescriptors descriptors;\n\t\t\/\/ detects and computes descriptors\n\n\t\tbrisk_detector->detectAndCompute(images[i].gray,noArray(),key_points,descriptors);\n\t\t\/\/ wrap keypoints to cam_Frame and add in to cam_Frames \n\t\tcam_Frames.push_back((CamFrame) {key_points});\n\t\tdescriptors_vec.push_back(descriptors);\n\t}\n}<commit_msg>Try SIFT feature detection<commit_after>#include \"opencv2\/opencv.hpp\"\n#include \"opencv2\/features2d.hpp\"\n#include \"opencv2\/xfeatures2d\/nonfree.hpp\"\nusing namespace cv;\n\n#include \"Pipeline.hpp\"\n\nvoid Pipeline::extract_features(const Images& images,CamFrames& cam_Frames,DescriptorsVec& descriptors_vec)\n{\n\t\/\/ create a sift detector\n\tconst int    feature_num      = 800;\n\tconst int    octavelayers_num = 3;\n\tconst double constrast_thresh = .04f;\n\tconst double edge_threshold   = 4.f;\n\tconst double sigma            = 1.3f;\n\tPtr<Feature2D> sift_detector = xfeatures2d::SIFT::create(feature_num,\n\t\toctavelayers_num, constrast_thresh, edge_threshold, sigma);\n\n\t\/\/ create brist detector\n\t\/\/ parameters for brisk : int thresh = 30, int octaves = 3, float patternScale = 1.0f\n\t\/\/Ptr<Feature2D> brisk_detector = BRISK::create();\n\n\t\/\/ detect features in a loop\n\tfor (int i = 0; i < images.size(); ++i)\n\t{\n\t\tKeyPoints key_points;\n\t\tDescriptors descriptors;\n\t\t\/\/ detects and computes descriptors\n\n\t\tsift_detector->detectAndCompute(images[i].gray,noArray(),key_points,descriptors);\n\t\t\/\/ wrap keypoints to cam_Frame and add in to cam_Frames\n\t\tcam_Frames.push_back((CamFrame) {key_points});\n\t\tdescriptors_vec.push_back(descriptors);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nflink.cpp\n\n ࠧ 㭪権  ࠡ⪥ Link` - Hard&Sym\n\n*\/\n\n\/* Revision: 1.01 04.01.2001 $ *\/\n\n\/*\nModify:\n  04.01.2001 SVS\n    + 㦪  CreateJunctionPoint, DeleteJunctionPoint\n    + GetJunctionPointInfo -    Junc\n  03.01.2001 SVS\n    ! 뤥  ⢥ ᠬ⥫쭮 \n    + GetNumberOfLinks  MkLink ॥堫  mix.cpp\n*\/\n\n#include \"headers.hpp\"\n#pragma hdrstop\n\n#include \"internalheaders.hpp\"\n\n\n#if defined(__BORLANDC__)\n  #define CP_THREAD_ACP             3           \/\/ current thread's ANSI code page\n\n  #define MAXIMUM_REPARSE_DATA_BUFFER_SIZE      ( 16 * 1024 )\n  \/\/ Predefined reparse tags.\n  \/\/ These tags need to avoid conflicting with IO_REMOUNT defined in ntos\\inc\\io.h\n  #define IO_REPARSE_TAG_RESERVED_ZERO             (0)\n  #define IO_REPARSE_TAG_RESERVED_ONE              (1)\n\n  \/\/ The value of the following constant needs to satisfy the following conditions:\n  \/\/  (1) Be at least as large as the largest of the reserved tags.\n  \/\/  (2) Be strictly smaller than all the tags in use.\n  #define IO_REPARSE_TAG_RESERVED_RANGE            IO_REPARSE_TAG_RESERVED_ONE\n  \/\/ The following constant represents the bits that are valid to use in\n  \/\/ reparse tags.\n  #define IO_REPARSE_TAG_VALID_VALUES     (0xE000FFFF)\n  \/\/ Macro to determine whether a reparse tag is a valid tag.\n  #define IsReparseTagValid(_tag) (                               \\\n                    !((_tag) & ~IO_REPARSE_TAG_VALID_VALUES) &&   \\\n                    ((_tag) > IO_REPARSE_TAG_RESERVED_RANGE)      \\\n                   )\n  #define FILE_FLAG_OPEN_REPARSE_POINT    0x00200000\n  #define FSCTL_GET_REPARSE_POINT         CTL_CODE(FILE_DEVICE_FILE_SYSTEM, 42, METHOD_BUFFERED, FILE_ANY_ACCESS) \/\/ REPARSE_DATA_BUFFER\n#endif\nstruct TMN_REPARSE_DATA_BUFFER\n{\n  DWORD  ReparseTag;\n  WORD   ReparseDataLength;\n  WORD   Reserved;\n\n  \/\/ IO_REPARSE_TAG_MOUNT_POINT specifics follow\n  WORD   SubstituteNameOffset;\n  WORD   SubstituteNameLength;\n  WORD   PrintNameOffset;\n  WORD   PrintNameLength;\n  WCHAR  PathBuffer[1];\n\n  \/\/ Some helper functions\n  \/\/BOOL Init(LPCSTR szJunctionPoint);\n  \/\/BOOL Init(LPCWSTR wszJunctionPoint);\n  \/\/int BytesForIoControl() const;\n};\n\n\nBOOL WINAPI CreateJunctionPoint(LPCTSTR szMountDir, LPCTSTR szDestDirArg)\n{\n  return TRUE;\n}\n\nBOOL WINAPI DeleteJunctionPoint(LPCTSTR szDir)\n{\n  return TRUE;\n}\n\nDWORD WINAPI GetJunctionPointInfo(LPCTSTR szMountDir,\n              LPTSTR  szDestBuff,\n              DWORD   dwBuffSize)\n{\n  const DWORD FileAttr = GetFileAttributes(szMountDir);\n  if (FileAttr == 0xffffffff || !(FileAttr & FILE_ATTRIBUTE_REPARSE_POINT))\n  {\n    SetLastError(ERROR_PATH_NOT_FOUND);\n    return 0;\n  }\n\n  HANDLE hDir=CreateFile(szMountDir,GENERIC_READ|0,0,0,OPEN_EXISTING,\n          FILE_FLAG_BACKUP_SEMANTICS | FILE_FLAG_OPEN_REPARSE_POINT,0);\n\n  if (hDir == INVALID_HANDLE_VALUE)\n  {\n    SetLastError(ERROR_PATH_NOT_FOUND);\n    return 0;\n  }\n\n  char szBuff[MAXIMUM_REPARSE_DATA_BUFFER_SIZE];\n  TMN_REPARSE_DATA_BUFFER& rdb = *(TMN_REPARSE_DATA_BUFFER*)szBuff;\n\n  DWORD dwBytesReturned;\n  if (!DeviceIoControl(hDir,\n            FSCTL_GET_REPARSE_POINT,\n            NULL,\n            0,\n            (LPVOID)&rdb,\n            MAXIMUM_REPARSE_DATA_BUFFER_SIZE,\n            &dwBytesReturned,\n            0) ||\n    !IsReparseTagValid(rdb.ReparseTag))\n  {\n    CloseHandle(hDir);\n    return 0;\n  }\n\n  CloseHandle(hDir);\n\n  if (dwBuffSize < rdb.SubstituteNameLength \/ sizeof(TCHAR) + sizeof(TCHAR))\n  {\n    return rdb.SubstituteNameLength \/ sizeof(TCHAR) + sizeof(TCHAR);\n  }\n\n#ifdef UNICODE\n  lstrcpy(szDestBuff, rdb.PathBuffer);\n#else\n  if (!WideCharToMultiByte(CP_THREAD_ACP,\n              0,\n              rdb.PathBuffer,\n              rdb.SubstituteNameLength \/ sizeof(WCHAR) + 1,\n              szDestBuff,\n              dwBuffSize,\n              \"\",\n              FALSE))\n  {\n    \/\/printf(\"WideCharToMultiByte failed (%d)\\n\", GetLastError());\n    return 0;\n  }\n#endif\n  return rdb.SubstituteNameLength \/ sizeof(TCHAR);\n}\n\n\n\/* $ 07.09.2000 SVS\n   㭪 GetNumberOfLinks ⮦ 㯭  :-)\n*\/\nint WINAPI GetNumberOfLinks(char *Name)\n{\n  HANDLE hFile=CreateFile(Name,0,FILE_SHARE_READ|FILE_SHARE_WRITE,\n                          NULL,OPEN_EXISTING,0,NULL);\n  if (hFile==INVALID_HANDLE_VALUE)\n    return(1);\n  BY_HANDLE_FILE_INFORMATION bhfi;\n  int GetCode=GetFileInformationByHandle(hFile,&bhfi);\n  CloseHandle(hFile);\n  return(GetCode ? bhfi.nNumberOfLinks:0);\n}\n\/* SVS $*\/\n\n\n#if defined(__BORLANDC__)\n#pragma option -a4\n#endif\nint WINAPI MkLink(char *Src,char *Dest)\n{\n  struct CORRECTED_WIN32_STREAM_ID\n  {\n    DWORD          dwStreamId ;\n    DWORD          dwStreamAttributes ;\n    LARGE_INTEGER  Size ;\n    DWORD          dwStreamNameSize ;\n    WCHAR          cStreamName[ ANYSIZE_ARRAY ] ;\n  } StreamId;\n\n  char FileSource[NM],FileDest[NM];\n  WCHAR FileLink[NM];\n\n  HANDLE hFileSource;\n\n  DWORD dwBytesWritten;\n  LPVOID lpContext;\n  DWORD cbPathLen;\n  DWORD StreamSize;\n\n  BOOL bSuccess;\n\n\/\/  ConvertNameToFull(Src,FileSource, sizeof(FileSource));\n  if (ConvertNameToFull(Src,FileSource, sizeof(FileSource)) >= sizeof(FileSource)){\n    return FALSE;\n  }\n\/\/  ConvertNameToFull(Dest,FileDest, sizeof(FileDest));\n  if (ConvertNameToFull(Dest,FileDest, sizeof(FileDest)) >= sizeof(FileDest)){\n    return FALSE;\n  }\n  MultiByteToWideChar(CP_OEMCP,0,FileDest,-1,FileLink,sizeof(FileLink)\/sizeof(FileLink[0]));\n\n  hFileSource = CreateFile(FileSource,FILE_WRITE_ATTRIBUTES,\n                FILE_SHARE_READ|FILE_SHARE_WRITE,NULL,OPEN_EXISTING,0,NULL);\n\n  if(hFileSource == INVALID_HANDLE_VALUE)\n    return(FALSE);\n\n  lpContext = NULL;\n  cbPathLen = (lstrlenW(FileLink) + 1) * sizeof(WCHAR);\n\n  StreamId.dwStreamId = BACKUP_LINK;\n  StreamId.dwStreamAttributes = 0;\n  StreamId.dwStreamNameSize = 0;\n  StreamId.Size.u.HighPart = 0;\n  StreamId.Size.u.LowPart = cbPathLen;\n\n  StreamSize=sizeof(StreamId)-sizeof(WCHAR **)+StreamId.dwStreamNameSize;\n\n  bSuccess = BackupWrite(hFileSource,(LPBYTE)&StreamId,StreamSize,\n             &dwBytesWritten,FALSE,FALSE,&lpContext);\n\n  int LastError=0;\n\n  if (bSuccess)\n  {\n    bSuccess = BackupWrite(hFileSource,(LPBYTE)FileLink,cbPathLen,\n                &dwBytesWritten,FALSE,FALSE,&lpContext);\n    if (!bSuccess)\n      LastError=GetLastError();\n\n    BackupWrite(hFileSource,NULL,0,&dwBytesWritten,TRUE,FALSE,&lpContext);\n  }\n  else\n    LastError=GetLastError();\n\n  CloseHandle(hFileSource);\n\n  if (LastError)\n    SetLastError(LastError);\n\n  return(bSuccess);\n}\n#if defined(__BORLANDC__)\n#pragma option -a.\n#endif\n\n<commit_msg>FAR patch 00364.flink.cpp Дата              : 05.01.2001 Сделал            : Oleg Taranenko Описание          : - Косметика, из-за которой не компилился под VC :) Измененные файлы  : flink.cpp Состав            : 00364.flink.cpp.txt                     flink.cpp.364.diff Основан на патче  : 362 Дополнение        :      Все определения будут видны всем компиляторам<commit_after>\/*\nflink.cpp\n\n ࠧ 㭪権  ࠡ⪥ Link` - Hard&Sym\n\n*\/\n\n\/* Revision: 1.03 04.01.2001 $ *\/\n\n\/*\nModify:\n  05.01.2000 OT \n    - ᬥ⨪, - ன    VC :) \n  04.01.2001 SVS\n    + 誨  CreateJunctionPoint, DeleteJunctionPoint\n    + GetJunctionPointInfo -    Junc\n  03.01.2001 SVS\n    ! 뤥  ⢥ ᠬ⥫쭮 \n    + GetNumberOfLinks  MkLink ॥堫  mix.cpp\n*\/\n\n#include \"headers.hpp\"\n#pragma hdrstop\n\n#include \"internalheaders.hpp\"\n\n\n\/\/#if defined(__BORLANDC__)\n\/\/ current thread's ANSI code page\n  #define CP_THREAD_ACP             3           \n\n  #define MAXIMUM_REPARSE_DATA_BUFFER_SIZE      ( 16 * 1024 )\n  \/\/ Predefined reparse tags.\n  \/\/ These tags need to avoid conflicting with IO_REMOUNT defined in ntos\\inc\\io.h\n  #define IO_REPARSE_TAG_RESERVED_ZERO             (0)\n  #define IO_REPARSE_TAG_RESERVED_ONE              (1)\n\n  \/\/ The value of the following constant needs to satisfy the following conditions:\n  \/\/  (1) Be at least as large as the largest of the reserved tags.\n  \/\/  (2) Be strictly smaller than all the tags in use.\n  #define IO_REPARSE_TAG_RESERVED_RANGE            IO_REPARSE_TAG_RESERVED_ONE\n  \/\/ The following constant represents the bits that are valid to use in\n  \/\/ reparse tags.\n  #define IO_REPARSE_TAG_VALID_VALUES     (0xE000FFFF)\n  \/\/ Macro to determine whether a reparse tag is a valid tag.\n  #define IsReparseTagValid(_tag) (                               \\\n                    !((_tag) & ~IO_REPARSE_TAG_VALID_VALUES) &&   \\\n                    ((_tag) > IO_REPARSE_TAG_RESERVED_RANGE)      \\\n                   )\n  #define FILE_FLAG_OPEN_REPARSE_POINT    0x00200000\n  #define FSCTL_GET_REPARSE_POINT         CTL_CODE(FILE_DEVICE_FILE_SYSTEM, 42, METHOD_BUFFERED, FILE_ANY_ACCESS) \n\/\/ REPARSE_DATA_BUFFER\n\/\/#endif\nstruct TMN_REPARSE_DATA_BUFFER\n{\n  DWORD  ReparseTag;\n  WORD   ReparseDataLength;\n  WORD   Reserved;\n\n  \/\/ IO_REPARSE_TAG_MOUNT_POINT specifics follow\n  WORD   SubstituteNameOffset;\n  WORD   SubstituteNameLength;\n  WORD   PrintNameOffset;\n  WORD   PrintNameLength;\n  WCHAR  PathBuffer[1];\n\n  \/\/ Some helper functions\n  \/\/BOOL Init(LPCSTR szJunctionPoint);\n  \/\/BOOL Init(LPCWSTR wszJunctionPoint);\n  \/\/int BytesForIoControl() const;\n};\n\n\nBOOL WINAPI CreateJunctionPoint(LPCTSTR szMountDir, LPCTSTR szDestDirArg)\n{\n  return TRUE;\n}\n\nBOOL WINAPI DeleteJunctionPoint(LPCTSTR szDir)\n{\n  return TRUE;\n}\n\nDWORD WINAPI GetJunctionPointInfo(LPCTSTR szMountDir,\n              LPTSTR  szDestBuff,\n              DWORD   dwBuffSize)\n{\n  const DWORD FileAttr = GetFileAttributes(szMountDir);\n  if (FileAttr == 0xffffffff || !(FileAttr & FILE_ATTRIBUTE_REPARSE_POINT))\n  {\n    SetLastError(ERROR_PATH_NOT_FOUND);\n    return 0;\n  }\n\n  HANDLE hDir=CreateFile(szMountDir,GENERIC_READ|0,0,0,OPEN_EXISTING,\n          FILE_FLAG_BACKUP_SEMANTICS | FILE_FLAG_OPEN_REPARSE_POINT,0);\n\n  if (hDir == INVALID_HANDLE_VALUE)\n  {\n    SetLastError(ERROR_PATH_NOT_FOUND);\n    return 0;\n  }\n\n  char szBuff[MAXIMUM_REPARSE_DATA_BUFFER_SIZE];\n  TMN_REPARSE_DATA_BUFFER& rdb = *(TMN_REPARSE_DATA_BUFFER*)szBuff;\n\n  DWORD dwBytesReturned;\n  if (!DeviceIoControl(hDir,\n            FSCTL_GET_REPARSE_POINT,\n            NULL,\n            0,\n            (LPVOID)&rdb,\n            MAXIMUM_REPARSE_DATA_BUFFER_SIZE,\n            &dwBytesReturned,\n            0) ||\n    !IsReparseTagValid(rdb.ReparseTag))\n  {\n    CloseHandle(hDir);\n    return 0;\n  }\n\n  CloseHandle(hDir);\n\n  if (dwBuffSize < rdb.SubstituteNameLength \/ sizeof(TCHAR) + sizeof(TCHAR))\n  {\n    return rdb.SubstituteNameLength \/ sizeof(TCHAR) + sizeof(TCHAR);\n  }\n\n#ifdef UNICODE\n  lstrcpy(szDestBuff, rdb.PathBuffer);\n#else\n  if (!WideCharToMultiByte(CP_THREAD_ACP,\n              0,\n              rdb.PathBuffer,\n              rdb.SubstituteNameLength \/ sizeof(WCHAR) + 1,\n              szDestBuff,\n              dwBuffSize,\n              \"\",\n              FALSE))\n  {\n    \/\/printf(\"WideCharToMultiByte failed (%d)\\n\", GetLastError());\n    return 0;\n  }\n#endif\n  return rdb.SubstituteNameLength \/ sizeof(TCHAR);\n}\n\n\n\/* $ 07.09.2000 SVS\n   㭪 GetNumberOfLinks ⮦ 㯭  :-)\n*\/\nint WINAPI GetNumberOfLinks(char *Name)\n{\n  HANDLE hFile=CreateFile(Name,0,FILE_SHARE_READ|FILE_SHARE_WRITE,\n                          NULL,OPEN_EXISTING,0,NULL);\n  if (hFile==INVALID_HANDLE_VALUE)\n    return(1);\n  BY_HANDLE_FILE_INFORMATION bhfi;\n  int GetCode=GetFileInformationByHandle(hFile,&bhfi);\n  CloseHandle(hFile);\n  return(GetCode ? bhfi.nNumberOfLinks:0);\n}\n\/* SVS $*\/\n\n\n#if defined(__BORLANDC__)\n#pragma option -a4\n#endif\nint WINAPI MkLink(char *Src,char *Dest)\n{\n  struct CORRECTED_WIN32_STREAM_ID\n  {\n    DWORD          dwStreamId ;\n    DWORD          dwStreamAttributes ;\n    LARGE_INTEGER  Size ;\n    DWORD          dwStreamNameSize ;\n    WCHAR          cStreamName[ ANYSIZE_ARRAY ] ;\n  } StreamId;\n\n  char FileSource[NM],FileDest[NM];\n  WCHAR FileLink[NM];\n\n  HANDLE hFileSource;\n\n  DWORD dwBytesWritten;\n  LPVOID lpContext;\n  DWORD cbPathLen;\n  DWORD StreamSize;\n\n  BOOL bSuccess;\n\n\/\/  ConvertNameToFull(Src,FileSource, sizeof(FileSource));\n  if (ConvertNameToFull(Src,FileSource, sizeof(FileSource)) >= sizeof(FileSource)){\n    return FALSE;\n  }\n\/\/  ConvertNameToFull(Dest,FileDest, sizeof(FileDest));\n  if (ConvertNameToFull(Dest,FileDest, sizeof(FileDest)) >= sizeof(FileDest)){\n    return FALSE;\n  }\n  MultiByteToWideChar(CP_OEMCP,0,FileDest,-1,FileLink,sizeof(FileLink)\/sizeof(FileLink[0]));\n\n  hFileSource = CreateFile(FileSource,FILE_WRITE_ATTRIBUTES,\n                FILE_SHARE_READ|FILE_SHARE_WRITE,NULL,OPEN_EXISTING,0,NULL);\n\n  if(hFileSource == INVALID_HANDLE_VALUE)\n    return(FALSE);\n\n  lpContext = NULL;\n  cbPathLen = (lstrlenW(FileLink) + 1) * sizeof(WCHAR);\n\n  StreamId.dwStreamId = BACKUP_LINK;\n  StreamId.dwStreamAttributes = 0;\n  StreamId.dwStreamNameSize = 0;\n  StreamId.Size.u.HighPart = 0;\n  StreamId.Size.u.LowPart = cbPathLen;\n\n  StreamSize=sizeof(StreamId)-sizeof(WCHAR **)+StreamId.dwStreamNameSize;\n\n  bSuccess = BackupWrite(hFileSource,(LPBYTE)&StreamId,StreamSize,\n             &dwBytesWritten,FALSE,FALSE,&lpContext);\n\n  int LastError=0;\n\n  if (bSuccess)\n  {\n    bSuccess = BackupWrite(hFileSource,(LPBYTE)FileLink,cbPathLen,\n                &dwBytesWritten,FALSE,FALSE,&lpContext);\n    if (!bSuccess)\n      LastError=GetLastError();\n\n    BackupWrite(hFileSource,NULL,0,&dwBytesWritten,TRUE,FALSE,&lpContext);\n  }\n  else\n    LastError=GetLastError();\n\n  CloseHandle(hFileSource);\n\n  if (LastError)\n    SetLastError(LastError);\n\n  return(bSuccess);\n}\n#if defined(__BORLANDC__)\n#pragma option -a.\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include\t\"Action\/UseConnection.hh\"\n\n\/**\n   Change to another map using a connection\n\n   @param dir   The direction of the next screen\n *\/\nAction::UseConnection::UseConnection(uint8_t dir)\n  : _dir(dir)\n{\n}\n\nAction::UseConnection::~UseConnection()\n{\n}\n\nvoid\t\tAction::UseConnection::_init()\n{\n  EKey          dirToKey[] = {KEY_DOWN, KEY_UP, KEY_LEFT, KEY_RIGHT};\n  Player        &p = _data.getPlayer();\n  World::Map    &m = _data.getWorld()[p.getBankId()][p.getMapId()];\n\n  if (_dir == CO_NONE || _dir > CO_RIGHT)\n    {\n      fprintf(stderr, \"Only _directions Up, Down, Left and Right are currently suported\\n\");\n      _state = Action::ERROR;\n      return;\n    }\n  bool          vtcl = _dir == CO_UP || _dir == CO_DOWN;\n  uint32_t      x = (_dir == CO_RIGHT ? m.getWidth() - 1 : 0);\n  uint32_t      y = (_dir == CO_DOWN ? m.getHeight() - 1 : 0);\n  int           xstep = vtcl;\n  int           ystep = !vtcl;\n\n  while (x < m.getWidth() && y < m.getHeight())\n    {\n      if (m.getNode(x, y).getStatus() == 0x0C) \/\/ Empty node, we should be able to cross there\n        break;\n      x += xstep;\n      y += ystep;\n    }\n  if (x >= m.getWidth() || y >= m.getHeight())\n    {\n      fprintf(stderr, \"Couldn't find an exit in the specified direction\\n\");\n      _state = Action::ERROR;\n      return;\n    }\n  _tx = x;\n  _ty = y;\n  _keyDir = dirToKey[_dir - 1];\n  _origBank = p.getBankId();\n  _origMap = p.getMapId();\n  queue(new Action::MoveTo(_tx, _ty));\n}\n\nvoid\t\tAction::UseConnection::_update()\n{\n  Player        &p = _data.getPlayer();\n\n  if (p.getBankId() != _origBank || p.getMapId() != _origMap)\n    _state = Action::FINISHED;\n  else if (p.getX() != _tx || p.getY() != _ty)\n    emit(\"onInit\");\n  else\n    sdlSetButton(_keyDir, getCounter() % 2);\n}\n<commit_msg>wait for the movement to next screen to complete<commit_after>#include\t\"Action\/UseConnection.hh\"\n\n\/**\n   Change to another map using a connection\n\n   @param dir   The direction of the next screen\n *\/\nAction::UseConnection::UseConnection(uint8_t dir)\n  : _dir(dir)\n{\n}\n\nAction::UseConnection::~UseConnection()\n{\n}\n\nvoid\t\tAction::UseConnection::_init()\n{\n  EKey          dirToKey[] = {KEY_DOWN, KEY_UP, KEY_LEFT, KEY_RIGHT};\n  Player        &p = _data.getPlayer();\n  World::Map    &m = _data.getWorld()[p.getBankId()][p.getMapId()];\n\n  if (_dir == CO_NONE || _dir > CO_RIGHT)\n    {\n      fprintf(stderr, \"Only _directions Up, Down, Left and Right are currently suported\\n\");\n      _state = Action::ERROR;\n      return;\n    }\n  bool          vtcl = _dir == CO_UP || _dir == CO_DOWN;\n  uint32_t      x = (_dir == CO_RIGHT ? m.getWidth() - 1 : 0);\n  uint32_t      y = (_dir == CO_DOWN ? m.getHeight() - 1 : 0);\n  int           xstep = vtcl;\n  int           ystep = !vtcl;\n\n  while (x < m.getWidth() && y < m.getHeight())\n    {\n      if (m.getNode(x, y).getStatus() == 0x0C) \/\/ Empty node, we should be able to cross there\n        break;\n      x += xstep;\n      y += ystep;\n    }\n  if (x >= m.getWidth() || y >= m.getHeight())\n    {\n      fprintf(stderr, \"Couldn't find an exit in the specified direction\\n\");\n      _state = Action::ERROR;\n      return;\n    }\n  _tx = x;\n  _ty = y;\n  _keyDir = dirToKey[_dir - 1];\n  _origBank = p.getBankId();\n  _origMap = p.getMapId();\n  queue(new Action::MoveTo(_tx, _ty));\n}\n\nvoid\t\tAction::UseConnection::_update()\n{\n  Player        &p = _data.getPlayer();\n  const OverWorld       &ow = _data.getOverWorld(0);\n\n  if (p.getBankId() != _origBank || p.getMapId() != _origMap)\n    {\n      if (p.getX() == ow.getX() && p.getX() == ow.getDestX() &&\n          p.getY() == ow.getY() && p.getY() == ow.getDestY())\n        _state = Action::FINISHED;\n    }\n  else if (p.getX() != _tx || p.getY() != _ty)\n    emit(\"onInit\");\n  else\n    sdlSetButton(_keyDir, getCounter() % 2);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"WindowEmscripten.hpp\"\n\n#include \"OE\/Application\/InputManager.hpp\"\n#include \"OE\/Misc\/Log.hpp\"\n\nnamespace OrbitEngine {\tnamespace Application { namespace priv {\n\tWindowEmscripten::WindowEmscripten()\n\t\t: WindowImpl()\n\t{\n\t\tupdateSizeFromHTML();\n\n    \temscripten_set_fullscreenchange_callback(\"#document\", this, 0, EMS_Callback_FullscreenChange);\n\t\temscripten_set_resize_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_ResizeCanvas);\n\t\temscripten_set_focus_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Focus);\n\t\temscripten_set_blur_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Focus);\n\n\t\temscripten_set_keypress_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_KeyPress);\n\t\temscripten_set_keydown_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Key);\n\t\temscripten_set_keyup_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Key);\n\t\temscripten_set_wheel_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Wheel);\n\t\temscripten_set_mousemove_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_MouseMove);\n\t\temscripten_set_mouseup_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_MouseButton);\n\t\temscripten_set_mousedown_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_MouseButton);\n\n\t\t\/\/ Do we start with the focus?\n\t\tp_Focused = true;\n\t}\n\t\n\tvoid WindowEmscripten::processEvents()\n\t{\n\t\tm_PointerLock = isPointerLockActive();\n\t\t\/\/p_InputManager->m_CursorMode = m_PointerLock ? CursorMode::GRABBED : CursorMode::NORMAL;\n\n\t\tWindowImpl::processEvents();\n\t}\n\n\tWindowEmscripten::~WindowEmscripten()\n\t{\n\n\t}\n\n\tbool WindowEmscripten::isMinimized() const\n\t{\n\t\t\/\/ TODO: This can be done\n\t\treturn false;\n\t}\n\n\tbool WindowEmscripten::setDisplayMode(DisplayMode mode)\n\t{\n\t\t\/\/ TODO: !\n\t\treturn true;\n\t}\n\n\tbool WindowEmscripten::setCursor(Cursor cursor)\n\t{\n\t\tstd::string script = \"Module.canvas.style.cursor = \\\"\" + CursorToCSS(cursor) + \"\\\";\";\n\t\temscripten_run_script(script.c_str());\n\t\treturn true;\n\t}\n\n\tbool WindowEmscripten::setTitle(const std::string& title)\n\t{\n\t\t\/\/ TODO: change document.title?\n\t\treturn false;\n\t}\n\n\tbool WindowEmscripten::setPosition(const Math::Vec2i& position)\n\t{\n\t\t\/\/ not valid\n\t\treturn false;\n\t}\n\n\tbool WindowEmscripten::setSize(const Math::Vec2i& size)\n\t{\n\t\t\/\/ not valid\n\t\treturn false;\n\t}\n\n\tbool WindowEmscripten::setVisibility(bool visible)\n\t{\n\t\t\/\/ TODO: set display: none?\n\t\treturn true;\n\t}\n\n\tbool WindowEmscripten::requestFocus()\n\t{\n\t\t\/\/ TODO?\n\t\treturn true;\n\t}\n\n\tbool WindowEmscripten::setAlpha(float alpha)\n\t{\n\t\t\/\/ not valid\n\t\treturn false;\n\t}\n\n\tWindowNativeHandle WindowEmscripten::getWindowNativeHandle()\n\t{\n\t\treturn 0;\n\t}\n\n\tDisplayNativeHandle WindowEmscripten::getDisplayNativeHandle()\n\t{\n\t\treturn 0;\n\t}\n\n\t\/*\n\tvoid WindowEmscripten::requestCursorMode(const CursorMode cursorMode) {\n\t\tif(cursorMode == CursorMode::GRABBED){\n\t\t\temscripten_request_pointerlock(NULL, true);\n\t\t}\n\t}\n\t*\/\n\n\tbool WindowEmscripten::isPointerLockActive(){\n\t    EmscriptenPointerlockChangeEvent pointerlockStatus;\n\t    emscripten_get_pointerlock_status(&pointerlockStatus);\n\t\treturn pointerlockStatus.isActive;\n\t}\n\n\tvoid WindowEmscripten::updateSizeFromHTML(){\n\t\t\/\/double pixel_ratio = emscripten_get_device_pixel_ratio(); Use it?\n\t\tdouble w = p_Size.x;\n\t\tdouble h = p_Size.y;\n\n\t\tif(p_DisplayMode != DisplayMode::FULLSCREEN){\n\t\t\t\/\/ If we are not in fullscreen, we use the css size values\n\t\t\temscripten_get_element_css_size(NULL, &w, &h);\n\t\t} else {\n\t\t\t\/\/ If we are in fullscreen we use the window inner dimensions\n\t\t\tw = EM_ASM_INT_V({\n\t\t\t\treturn window.innerWidth;\n\t\t\t});\n\n\t\t\th = EM_ASM_INT_V({\n\t\t\t\treturn window.innerHeight;\n\t\t\t});\n\t\t}\n\n\t\temscripten_set_canvas_size(w, h);\n\n\t\tp_Size = Math::Vec2i(w, h);\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_FullscreenChange(int eventType, const EmscriptenFullscreenChangeEvent *fullscreenChangeEvent, void *userData) {\n\t\tWindowEmscripten* window = static_cast<WindowEmscripten*>(userData);\n\t\tif(fullscreenChangeEvent->isFullscreen)\n\t\t\twindow->p_DisplayMode = DisplayMode::FULLSCREEN;\n\t\telse\n\t\t\twindow->p_DisplayMode = DisplayMode::WINDOWED;\n\t\twindow->updateSizeFromHTML();\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_ResizeCanvas(int eventType, const EmscriptenUiEvent *uiEvent, void *userData) {\n\t\tWindowEmscripten* window = static_cast<WindowEmscripten*>(userData);\n\t\twindow->updateSizeFromHTML();\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_Focus(int eventType, const EmscriptenFocusEvent *focusEvent, void *userData) {\n\t\tWindowEmscripten* window = static_cast<WindowEmscripten*>(userData);\n\t\twindow->p_Focused = eventType == EMSCRIPTEN_EVENT_FOCUS;\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_Key(int eventType, const EmscriptenKeyboardEvent *keyEvent, void *userData) {\n\t\tif (keyEvent->keyCode < OE_MAX_KEYS) {\n\t\t\tKey key = Key(keyEvent->keyCode);\n\t\t\tInputManager::Get()->onInputKey(key, eventType == EMSCRIPTEN_EVENT_KEYDOWN);\n\t\t\tbool isNavKey = key == Key::BACKSPACE ||\n\t\t\t\t\t\t\tkey == Key::TAB;\n\t\t\treturn isNavKey;\n\t\t}\n\t}\n\n\tEM_BOOL OrbitEngine::Application::priv::WindowEmscripten::EMS_Callback_KeyPress(int eventType, const EmscriptenKeyboardEvent* keyEvent, void* userData)\n\t{\n\t\tInputManager::Get()->onInputChar((unsigned int)keyEvent->charCode);\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_Wheel(int eventType, const EmscriptenWheelEvent *wheelEvent, void *userData) {\n\t\tInputManager::Get()->onInputWheel((float)wheelEvent->deltaY \/ -120.0f);\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_MouseMove(int eventType, const EmscriptenMouseEvent *mouseEvent, void *userData) {\n\t\tWindowEmscripten* window = static_cast<WindowEmscripten*>(userData);\n\t\tif(window->m_PointerLock){\n\t\t\tInputManager::Get()->onInputMouseMove(-mouseEvent->movementX, -mouseEvent->movementY, true);\n\t\t} else {\n\t\t\tInputManager::Get()->onInputMouseMove(mouseEvent->canvasX, mouseEvent->canvasY);\n\t\t}\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_MouseButton(int eventType, const EmscriptenMouseEvent *mouseEvent, void *userData) {\n\t\tButton btn;\n\t\tswitch (mouseEvent->button) {\n\t\tdefault:\n\t\tcase 0: btn = Button::LEFT; break;\n\t\tcase 1: btn = Button::MIDDLE; break;\n\t\tcase 2: btn = Button::RIGHT; break;\n\t\t}\n\t\tInputManager::Get()->onInputMouseButton(btn, eventType == EMSCRIPTEN_EVENT_MOUSEDOWN);\n\t}\n\n\tstd::string WindowEmscripten::CursorToCSS(const Cursor cursor){\n\t\tswitch(cursor){\n\t\tdefault:\n\t\tcase DEFAULT:\n\t\tcase ARROW:\n\t\t\treturn \"\";\n\t\tcase CROSS:\n\t\t\treturn \"crosshair\";\n\t\tcase HOURGLASS:\n\t\t\treturn \"wait\";\n\t\tcase HAND:\n\t\t\treturn \"pointer\";\n\t\tcase NO:\n\t\t\treturn \"not-allowed\";\n\t\tcase SIZEALL:\n\t\t\treturn \"move\";\n\t\tcase SIZENS:\n\t\t\treturn \"n-resize\";\n\t\tcase SIZEWE:\n\t\t\treturn \"w-resize\";\n\t\tcase SIZENWSE:\n\t\t\treturn \"se-resize\";\n\t\t}\n\t}\n\n} } }<commit_msg>Prevent emscripten to consume key events<commit_after>#include \"WindowEmscripten.hpp\"\n\n#include \"OE\/Application\/InputManager.hpp\"\n#include \"OE\/Misc\/Log.hpp\"\n\nnamespace OrbitEngine {\tnamespace Application { namespace priv {\n\tWindowEmscripten::WindowEmscripten()\n\t\t: WindowImpl()\n\t{\n\t\tupdateSizeFromHTML();\n\n    \temscripten_set_fullscreenchange_callback(\"#document\", this, 0, EMS_Callback_FullscreenChange);\n\t\temscripten_set_resize_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_ResizeCanvas);\n\t\temscripten_set_focus_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Focus);\n\t\temscripten_set_blur_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Focus);\n\n\t\temscripten_set_keypress_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_KeyPress);\n\t\temscripten_set_keydown_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Key);\n\t\temscripten_set_keyup_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Key);\n\t\temscripten_set_wheel_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_Wheel);\n\t\temscripten_set_mousemove_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_MouseMove);\n\t\temscripten_set_mouseup_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_MouseButton);\n\t\temscripten_set_mousedown_callback(NULL, this, false, &WindowEmscripten::EMS_Callback_MouseButton);\n\n\t\t\/\/ Do we start with the focus?\n\t\tp_Focused = true;\n\t}\n\t\n\tvoid WindowEmscripten::processEvents()\n\t{\n\t\tm_PointerLock = isPointerLockActive();\n\t\t\/\/p_InputManager->m_CursorMode = m_PointerLock ? CursorMode::GRABBED : CursorMode::NORMAL;\n\n\t\tWindowImpl::processEvents();\n\t}\n\n\tWindowEmscripten::~WindowEmscripten()\n\t{\n\n\t}\n\n\tbool WindowEmscripten::isMinimized() const\n\t{\n\t\t\/\/ TODO: This can be done\n\t\treturn false;\n\t}\n\n\tbool WindowEmscripten::setDisplayMode(DisplayMode mode)\n\t{\n\t\t\/\/ TODO: !\n\t\treturn true;\n\t}\n\n\tbool WindowEmscripten::setCursor(Cursor cursor)\n\t{\n\t\tstd::string script = \"Module.canvas.style.cursor = \\\"\" + CursorToCSS(cursor) + \"\\\";\";\n\t\temscripten_run_script(script.c_str());\n\t\treturn true;\n\t}\n\n\tbool WindowEmscripten::setTitle(const std::string& title)\n\t{\n\t\t\/\/ TODO: change document.title?\n\t\treturn false;\n\t}\n\n\tbool WindowEmscripten::setPosition(const Math::Vec2i& position)\n\t{\n\t\t\/\/ not valid\n\t\treturn false;\n\t}\n\n\tbool WindowEmscripten::setSize(const Math::Vec2i& size)\n\t{\n\t\t\/\/ not valid\n\t\treturn false;\n\t}\n\n\tbool WindowEmscripten::setVisibility(bool visible)\n\t{\n\t\t\/\/ TODO: set display: none?\n\t\treturn true;\n\t}\n\n\tbool WindowEmscripten::requestFocus()\n\t{\n\t\t\/\/ TODO?\n\t\treturn true;\n\t}\n\n\tbool WindowEmscripten::setAlpha(float alpha)\n\t{\n\t\t\/\/ not valid\n\t\treturn false;\n\t}\n\n\tWindowNativeHandle WindowEmscripten::getWindowNativeHandle()\n\t{\n\t\treturn 0;\n\t}\n\n\tDisplayNativeHandle WindowEmscripten::getDisplayNativeHandle()\n\t{\n\t\treturn 0;\n\t}\n\n\t\/*\n\tvoid WindowEmscripten::requestCursorMode(const CursorMode cursorMode) {\n\t\tif(cursorMode == CursorMode::GRABBED){\n\t\t\temscripten_request_pointerlock(NULL, true);\n\t\t}\n\t}\n\t*\/\n\n\tbool WindowEmscripten::isPointerLockActive(){\n\t    EmscriptenPointerlockChangeEvent pointerlockStatus;\n\t    emscripten_get_pointerlock_status(&pointerlockStatus);\n\t\treturn pointerlockStatus.isActive;\n\t}\n\n\tvoid WindowEmscripten::updateSizeFromHTML(){\n\t\t\/\/double pixel_ratio = emscripten_get_device_pixel_ratio(); Use it?\n\t\tdouble w = p_Size.x;\n\t\tdouble h = p_Size.y;\n\n\t\tif(p_DisplayMode != DisplayMode::FULLSCREEN){\n\t\t\t\/\/ If we are not in fullscreen, we use the css size values\n\t\t\temscripten_get_element_css_size(NULL, &w, &h);\n\t\t} else {\n\t\t\t\/\/ If we are in fullscreen we use the window inner dimensions\n\t\t\tw = EM_ASM_INT_V({\n\t\t\t\treturn window.innerWidth;\n\t\t\t});\n\n\t\t\th = EM_ASM_INT_V({\n\t\t\t\treturn window.innerHeight;\n\t\t\t});\n\t\t}\n\n\t\temscripten_set_canvas_size(w, h);\n\n\t\tp_Size = Math::Vec2i(w, h);\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_FullscreenChange(int eventType, const EmscriptenFullscreenChangeEvent *fullscreenChangeEvent, void *userData) {\n\t\tWindowEmscripten* window = static_cast<WindowEmscripten*>(userData);\n\t\tif(fullscreenChangeEvent->isFullscreen)\n\t\t\twindow->p_DisplayMode = DisplayMode::FULLSCREEN;\n\t\telse\n\t\t\twindow->p_DisplayMode = DisplayMode::WINDOWED;\n\t\twindow->updateSizeFromHTML();\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_ResizeCanvas(int eventType, const EmscriptenUiEvent *uiEvent, void *userData) {\n\t\tWindowEmscripten* window = static_cast<WindowEmscripten*>(userData);\n\t\twindow->updateSizeFromHTML();\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_Focus(int eventType, const EmscriptenFocusEvent *focusEvent, void *userData) {\n\t\tWindowEmscripten* window = static_cast<WindowEmscripten*>(userData);\n\t\twindow->p_Focused = eventType == EMSCRIPTEN_EVENT_FOCUS;\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_Key(int eventType, const EmscriptenKeyboardEvent *keyEvent, void *userData) {\n\t\tif (keyEvent->keyCode < OE_MAX_KEYS) {\n\t\t\tKey key = Key(keyEvent->keyCode);\n\t\t\tInputManager::Get()->onInputKey(key, eventType == EMSCRIPTEN_EVENT_KEYDOWN);\n\t\t\t\/\/bool isNavKey = key == Key::BACKSPACE ||\n\t\t\t\/\/\t\t\t\tkey == Key::TAB;\n\t\t\t\/\/return isNavKey;\n\t\t}\n\t}\n\n\tEM_BOOL OrbitEngine::Application::priv::WindowEmscripten::EMS_Callback_KeyPress(int eventType, const EmscriptenKeyboardEvent* keyEvent, void* userData)\n\t{\n\t\tInputManager::Get()->onInputChar((unsigned int)keyEvent->charCode);\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_Wheel(int eventType, const EmscriptenWheelEvent *wheelEvent, void *userData) {\n\t\tInputManager::Get()->onInputWheel((float)wheelEvent->deltaY \/ -120.0f);\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_MouseMove(int eventType, const EmscriptenMouseEvent *mouseEvent, void *userData) {\n\t\tWindowEmscripten* window = static_cast<WindowEmscripten*>(userData);\n\t\tif(window->m_PointerLock){\n\t\t\tInputManager::Get()->onInputMouseMove(-mouseEvent->movementX, -mouseEvent->movementY, true);\n\t\t} else {\n\t\t\tInputManager::Get()->onInputMouseMove(mouseEvent->canvasX, mouseEvent->canvasY);\n\t\t}\n\t}\n\n\tEM_BOOL WindowEmscripten::EMS_Callback_MouseButton(int eventType, const EmscriptenMouseEvent *mouseEvent, void *userData) {\n\t\tButton btn;\n\t\tswitch (mouseEvent->button) {\n\t\tdefault:\n\t\tcase 0: btn = Button::LEFT; break;\n\t\tcase 1: btn = Button::MIDDLE; break;\n\t\tcase 2: btn = Button::RIGHT; break;\n\t\t}\n\t\tInputManager::Get()->onInputMouseButton(btn, eventType == EMSCRIPTEN_EVENT_MOUSEDOWN);\n\t}\n\n\tstd::string WindowEmscripten::CursorToCSS(const Cursor cursor){\n\t\tswitch(cursor){\n\t\tdefault:\n\t\tcase DEFAULT:\n\t\tcase ARROW:\n\t\t\treturn \"\";\n\t\tcase CROSS:\n\t\t\treturn \"crosshair\";\n\t\tcase HOURGLASS:\n\t\t\treturn \"wait\";\n\t\tcase HAND:\n\t\t\treturn \"pointer\";\n\t\tcase NO:\n\t\t\treturn \"not-allowed\";\n\t\tcase SIZEALL:\n\t\t\treturn \"move\";\n\t\tcase SIZENS:\n\t\t\treturn \"n-resize\";\n\t\tcase SIZEWE:\n\t\t\treturn \"w-resize\";\n\t\tcase SIZENWSE:\n\t\t\treturn \"se-resize\";\n\t\t}\n\t}\n\n} } }<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\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: Sergey Gorbunov, Torsten Alt                            *\n\/\/* Developers:      Sergey Gorbunov <sergey.gorbunov@fias.uni-frankfurt.de> *\n\/\/*                  Torsten Alt <talt@cern.ch>                              *\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   AliHLTTPCHWCFProcessorUnit.cxx\n\/\/  @author Sergey Gorbunov <sergey.gorbunov@fias.uni-frankfurt.de>\n\/\/  @author Torsten Alt <talt@cern.ch> \n\/\/  @date   \n\/\/  @brief  Channel Processor unit of FPGA ClusterFinder Emulator for TPC\n\/\/  @brief  ( see AliHLTTPCHWCFEmulator class )\n\/\/  @note \n\n#include \"AliHLTTPCHWCFProcessorUnit.h\"\n#include <iostream>\n#include <cstdio>\n\n\nAliHLTTPCHWCFProcessorUnit::AliHLTTPCHWCFProcessorUnit()\n  :\n  fOutput(),\n  fkBunch(0),\n  fBunchIndex(0),\n  fWasDeconvoluted(0),\n  fDeconvolute(0),\n  fImprovedDeconvolution(0),\n  fSingleSeqLimit(0),\n  fUseTimeBinWindow(0),\n  fDebug(0)\n{\n  \/\/constructor \n  Init();\n}\n\n\nAliHLTTPCHWCFProcessorUnit::~AliHLTTPCHWCFProcessorUnit()\n{   \n  \/\/destructor \n}\n\nAliHLTTPCHWCFProcessorUnit::AliHLTTPCHWCFProcessorUnit(const AliHLTTPCHWCFProcessorUnit&)\n  :\n  fOutput(),\n  fkBunch(0),\n  fBunchIndex(0),\n  fWasDeconvoluted(0),\n  fDeconvolute(0),\n  fImprovedDeconvolution(0),\n  fSingleSeqLimit(0),\n  fUseTimeBinWindow(0),\n  fDebug(0)\n{\n  \/\/ dummy\n  Init();\n}\n\nAliHLTTPCHWCFProcessorUnit& AliHLTTPCHWCFProcessorUnit::operator=(const AliHLTTPCHWCFProcessorUnit&)\n{\n  \/\/ dummy  \n  return *this;\n}\n\nint AliHLTTPCHWCFProcessorUnit::Init()\n{\n  \/\/ initialise  \n\n  fkBunch = 0;\n  fBunchIndex = 0;\n  fWasDeconvoluted = 0;\n  return 0;\n}\n\nint AliHLTTPCHWCFProcessorUnit::InputStream( const AliHLTTPCHWCFBunch *bunch )\n{\n  \/\/ input stream of data \n  \n  if( bunch && fDebug ){\n    printf(\"\\nHWCF Processor: input bunch F %1d R %3d P %3d  NS %2ld:\\n\",\n\t   bunch->fFlag, bunch->fRow, bunch->fPad, bunch->fData.size());\n    for( unsigned int i=0; i<bunch->fData.size(); i++ ){\n      AliHLTTPCHWCFDigit d =  bunch->fData[i];\n      printf(\"   q %2d t %3d peak %2d \", d.fQ, d.fTime, d.fPeak);      \n       printf(\"(\");\n      for( int j=0; j<3; j++ ) printf(\" {%d,%2.0f}\",d.fMC.fClusterID[j].fMCID, d.fMC.fClusterID[j].fWeight );\n      printf(\" )\\n\");    \n    }\n  }\n\n  fkBunch = bunch;\n  fBunchIndex = 0;\n  fWasDeconvoluted = 0;\n  return 0;\n}\n\nconst AliHLTTPCHWCFClusterFragment *AliHLTTPCHWCFProcessorUnit::OutputStream()\n{ \n  \/\/ output stream of data \n\n  \/\/const AliHLTUInt32_t kTimeBinWindow = 5;\n  const AliHLTUInt32_t kHalfTimeBinWindow = 2;\n \n  if( !fkBunch ) return 0;\n  \n  fOutput.fFlag = fkBunch->fFlag;\n  fOutput.fRow = fkBunch->fRow;\n  fOutput.fPad = fkBunch->fPad;\n  fOutput.fBranch = fkBunch->fBranch;\n  fOutput.fBorder = fkBunch->fBorder;\n  fOutput.fEdge = 0; \/\/Set below with some more constraints\n  fOutput.fQmax = 0;\n  fOutput.fQ = 0;\n  fOutput.fT = 0;\n  fOutput.fT2 = 0;\n  fOutput.fP = 0;\n  fOutput.fP2 = 0;\n  fOutput.fTMean = 0;\n  fOutput.fNPads = 0;\n  fOutput.fNDeconvolutedTime = 0;\n  fOutput.fIsDeconvolutedPad = 0;\n  fOutput.fConsecutiveTimeDeconvolution = 0;\n  fOutput.fLargestQ = 0;\n  fOutput.fLargestQ2 = 0;\n  fOutput.fLargestQPad = 0;\n  fOutput.fMC.clear();\n  \n  if( fkBunch->fFlag==2 && fkBunch->fData.size()==1 ){ \/\/ rcu trailer word, forward it \n    fOutput.fRow = fkBunch->fData[0].fQ;\n  }\n  \n  if( fkBunch->fFlag >1 ){\n    fkBunch = 0;    \n    return &fOutput;\n  }\n\n  if( fkBunch->fFlag < 1 ) return 0;\n  \n  if( fBunchIndex >= fkBunch->fData.size() ) return 0;\n    \n  AliHLTUInt32_t iStart = fBunchIndex;\n  AliHLTUInt32_t iPeak = fBunchIndex;\n  AliHLTUInt32_t qPeak = 0;\n\n  \/\/ find next\/best peak\n    \n  for( ; fBunchIndex<fkBunch->fData.size(); fBunchIndex++ ){\n    const AliHLTTPCHWCFDigit &d = fkBunch->fData[fBunchIndex];            \n    if( d.fPeak != 1 ) continue;\n    if( fDeconvolute ){\n      iPeak = fBunchIndex;\n      qPeak = d.fQ;\n      fBunchIndex++;\n      break;\n    } else {\t\n      if( d.fQ>qPeak ){\n\tqPeak = d.fQ;\n\tiPeak = fBunchIndex;\n      }\n    }\n  }\n    \n  if( qPeak == 0 ) return 0;\n\n  \/\/ find next minimum !!! At the moment the minimum finder is on only when no timebin window set\n\n  bool isDeconvoluted = 0;\n\n  if( !fUseTimeBinWindow ){\n    for( ; fBunchIndex<fkBunch->fData.size(); fBunchIndex++ ){\n      if( fDeconvolute ){\n\tif( fkBunch->fData[fBunchIndex].fPeak != 0 ){\t    \n\t  fBunchIndex++;\n\t  break;\n\t}\n      }\n    }\n    if( fBunchIndex<fkBunch->fData.size() ) isDeconvoluted = 1;    \n  } else { \n    if( !fDeconvolute ){\n      fBunchIndex = fkBunch->fData.size();\n    } else if ( fImprovedDeconvolution) {\n      fWasDeconvoluted = 0;\n      for ( int i = std::max((int) iStart, (int) (iPeak - kHalfTimeBinWindow)); i < iPeak; i++) {\n        if ( fkBunch->fData[i].fPeak == 2 )\n        {\n          iStart = i + 1;\n          fWasDeconvoluted = 1;\n        }\n      }\n      \/\/Do not mark as deconvoluted when iPeak + 2 is a minimum (because we use that sample), do not consider minima add end of bunch!\n      for ( ; fBunchIndex < fkBunch->fData.size(); fBunchIndex++ ) {\n        if (fBunchIndex == iPeak + kHalfTimeBinWindow)\n        {\n          fBunchIndex++;\n          break;\n        }\n        if (fkBunch->fData[fBunchIndex].fPeak == 2) {\n          if (fBunchIndex + 1 != fkBunch->fData.size()) isDeconvoluted = 1;\n          fBunchIndex++;\n          break;\n        }\n      }\n    } else {\n      \/\/ find next peak\n      if( fBunchIndex+1<fkBunch->fData.size() && fkBunch->fData[fBunchIndex+1].fPeak==1 ){\n\tfBunchIndex = fBunchIndex+1;\n\tisDeconvoluted = 1; \n      } else   if( fBunchIndex+2<fkBunch->fData.size() && fkBunch->fData[fBunchIndex+2].fPeak==1 ){\n\tfBunchIndex = fBunchIndex+1;\n\tisDeconvoluted = 1; \n      } else   if( fBunchIndex+3<fkBunch->fData.size() && fkBunch->fData[fBunchIndex+3].fPeak==1 ){\n\tfBunchIndex = fBunchIndex+2;\n\tisDeconvoluted = 1; \n      } else   if( fBunchIndex+1<fkBunch->fData.size() ){\n\tfBunchIndex = fBunchIndex+2;\n      } else   if( fBunchIndex<fkBunch->fData.size() ){\n\tfBunchIndex = fBunchIndex+1;\n      }\n    }\n  }\n    \n  AliHLTUInt32_t iEnd = fBunchIndex;\n\n  if( fUseTimeBinWindow ){\n    if( iPeak > iStart + kHalfTimeBinWindow ) iStart = iPeak - kHalfTimeBinWindow;\n    if( iEnd  > iPeak + kHalfTimeBinWindow + 1) iEnd = iPeak + kHalfTimeBinWindow + 1;\n  }\n\n  fOutput.fQmax = qPeak*fkBunch->fGain;\n  fOutput.fQ = 0;\n  fOutput.fT = 0;\n  fOutput.fT2 = 0;\n  fOutput.fP = 0;\n  fOutput.fP2 = 0;\n  fOutput.fTMean = fkBunch->fData[iPeak].fTime;\n  fOutput.fNPads = 1;\n  fOutput.fNDeconvolutedTime = ( fWasDeconvoluted || isDeconvoluted ) ? 1 :0;\n  fOutput.fConsecutiveTimeDeconvolution = fOutput.fNDeconvolutedTime;\n  fOutput.fMC.clear();\n\n  fWasDeconvoluted = isDeconvoluted;  \n\n  for( AliHLTUInt32_t i=iStart; i<iEnd; i++ ){\n    const AliHLTTPCHWCFDigit &d = fkBunch->fData[i];\n    AliHLTUInt64_t q = d.fQ*fkBunch->fGain;      \n    fOutput.fQ += q;\n    fOutput.fT += q*d.fTime;\n    fOutput.fT2+= q*d.fTime*d.fTime;\n    fOutput.fP += q*fkBunch->fPad;\n    fOutput.fP2+= q*fkBunch->fPad*fkBunch->fPad;\n    fOutput.fMC.push_back(d.fMC);\n  }\n  fOutput.fEdge = fkBunch->fEdge && iEnd > iStart + 2 && qPeak > 5;\n  fOutput.fLargestQ = fOutput.fQ;\n  fOutput.fLargestQPad = fkBunch->fEdge ? fkBunch->fPad : 0xFFFFFFFF; \/\/We only correct if the largest charge is at the edge cluster. Mark other pads as -1\n  \n  if( fkBunch->fData.size()==1 && fOutput.fQ < fSingleSeqLimit ) return 0;  \n  \n  return &fOutput;\n}\n<commit_msg>fix assignment of qMax in HWCF with smoothing<commit_after>\/\/ $Id$\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: Sergey Gorbunov, Torsten Alt                            *\n\/\/* Developers:      Sergey Gorbunov <sergey.gorbunov@fias.uni-frankfurt.de> *\n\/\/*                  Torsten Alt <talt@cern.ch>                              *\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   AliHLTTPCHWCFProcessorUnit.cxx\n\/\/  @author Sergey Gorbunov <sergey.gorbunov@fias.uni-frankfurt.de>\n\/\/  @author Torsten Alt <talt@cern.ch> \n\/\/  @date   \n\/\/  @brief  Channel Processor unit of FPGA ClusterFinder Emulator for TPC\n\/\/  @brief  ( see AliHLTTPCHWCFEmulator class )\n\/\/  @note \n\n#include \"AliHLTTPCHWCFProcessorUnit.h\"\n#include <iostream>\n#include <cstdio>\n\n\nAliHLTTPCHWCFProcessorUnit::AliHLTTPCHWCFProcessorUnit()\n  :\n  fOutput(),\n  fkBunch(0),\n  fBunchIndex(0),\n  fWasDeconvoluted(0),\n  fDeconvolute(0),\n  fImprovedDeconvolution(0),\n  fSingleSeqLimit(0),\n  fUseTimeBinWindow(0),\n  fDebug(0)\n{\n  \/\/constructor \n  Init();\n}\n\n\nAliHLTTPCHWCFProcessorUnit::~AliHLTTPCHWCFProcessorUnit()\n{   \n  \/\/destructor \n}\n\nAliHLTTPCHWCFProcessorUnit::AliHLTTPCHWCFProcessorUnit(const AliHLTTPCHWCFProcessorUnit&)\n  :\n  fOutput(),\n  fkBunch(0),\n  fBunchIndex(0),\n  fWasDeconvoluted(0),\n  fDeconvolute(0),\n  fImprovedDeconvolution(0),\n  fSingleSeqLimit(0),\n  fUseTimeBinWindow(0),\n  fDebug(0)\n{\n  \/\/ dummy\n  Init();\n}\n\nAliHLTTPCHWCFProcessorUnit& AliHLTTPCHWCFProcessorUnit::operator=(const AliHLTTPCHWCFProcessorUnit&)\n{\n  \/\/ dummy  \n  return *this;\n}\n\nint AliHLTTPCHWCFProcessorUnit::Init()\n{\n  \/\/ initialise  \n\n  fkBunch = 0;\n  fBunchIndex = 0;\n  fWasDeconvoluted = 0;\n  return 0;\n}\n\nint AliHLTTPCHWCFProcessorUnit::InputStream( const AliHLTTPCHWCFBunch *bunch )\n{\n  \/\/ input stream of data \n  \n  if( bunch && fDebug ){\n    printf(\"\\nHWCF Processor: input bunch F %1d R %3d P %3d  NS %2ld:\\n\",\n\t   bunch->fFlag, bunch->fRow, bunch->fPad, bunch->fData.size());\n    for( unsigned int i=0; i<bunch->fData.size(); i++ ){\n      AliHLTTPCHWCFDigit d =  bunch->fData[i];\n      printf(\"   q %2d t %3d peak %2d \", d.fQ, d.fTime, d.fPeak);      \n       printf(\"(\");\n      for( int j=0; j<3; j++ ) printf(\" {%d,%2.0f}\",d.fMC.fClusterID[j].fMCID, d.fMC.fClusterID[j].fWeight );\n      printf(\" )\\n\");    \n    }\n  }\n\n  fkBunch = bunch;\n  fBunchIndex = 0;\n  fWasDeconvoluted = 0;\n  return 0;\n}\n\nconst AliHLTTPCHWCFClusterFragment *AliHLTTPCHWCFProcessorUnit::OutputStream()\n{ \n  \/\/ output stream of data \n\n  \/\/const AliHLTUInt32_t kTimeBinWindow = 5;\n  const AliHLTUInt32_t kHalfTimeBinWindow = 2;\n \n  if( !fkBunch ) return 0;\n  \n  fOutput.fFlag = fkBunch->fFlag;\n  fOutput.fRow = fkBunch->fRow;\n  fOutput.fPad = fkBunch->fPad;\n  fOutput.fBranch = fkBunch->fBranch;\n  fOutput.fBorder = fkBunch->fBorder;\n  fOutput.fEdge = 0; \/\/Set below with some more constraints\n  fOutput.fQmax = 0;\n  fOutput.fQ = 0;\n  fOutput.fT = 0;\n  fOutput.fT2 = 0;\n  fOutput.fP = 0;\n  fOutput.fP2 = 0;\n  fOutput.fTMean = 0;\n  fOutput.fNPads = 0;\n  fOutput.fNDeconvolutedTime = 0;\n  fOutput.fIsDeconvolutedPad = 0;\n  fOutput.fConsecutiveTimeDeconvolution = 0;\n  fOutput.fLargestQ = 0;\n  fOutput.fLargestQ2 = 0;\n  fOutput.fLargestQPad = 0;\n  fOutput.fMC.clear();\n  \n  if( fkBunch->fFlag==2 && fkBunch->fData.size()==1 ){ \/\/ rcu trailer word, forward it \n    fOutput.fRow = fkBunch->fData[0].fQ;\n  }\n  \n  if( fkBunch->fFlag >1 ){\n    fkBunch = 0;    \n    return &fOutput;\n  }\n\n  if( fkBunch->fFlag < 1 ) return 0;\n  \n  if( fBunchIndex >= fkBunch->fData.size() ) return 0;\n    \n  AliHLTUInt32_t iStart = fBunchIndex;\n  AliHLTUInt32_t iPeak = fBunchIndex;\n  AliHLTUInt32_t qPeak = 0;\n\n  \/\/ find next\/best peak\n    \n  for( ; fBunchIndex<fkBunch->fData.size(); fBunchIndex++ ){\n    const AliHLTTPCHWCFDigit &d = fkBunch->fData[fBunchIndex];            \n    if( d.fPeak != 1 ) continue;\n    if( fDeconvolute ){\n      iPeak = fBunchIndex;\n      qPeak = d.fQ;\n      fBunchIndex++;\n      break;\n    } else {\t\n      if( d.fQ>qPeak ){\n\tqPeak = d.fQ;\n\tiPeak = fBunchIndex;\n      }\n    }\n  }\n    \n  if( qPeak == 0 ) return 0;\n\n  \/\/ find next minimum !!! At the moment the minimum finder is on only when no timebin window set\n\n  bool isDeconvoluted = 0;\n\n  if( !fUseTimeBinWindow ){\n    for( ; fBunchIndex<fkBunch->fData.size(); fBunchIndex++ ){\n      if( fDeconvolute ){\n\tif( fkBunch->fData[fBunchIndex].fPeak != 0 ){\t    \n\t  fBunchIndex++;\n\t  break;\n\t}\n      }\n    }\n    if( fBunchIndex<fkBunch->fData.size() ) isDeconvoluted = 1;    \n  } else { \n    if( !fDeconvolute ){\n      fBunchIndex = fkBunch->fData.size();\n    } else if ( fImprovedDeconvolution) {\n      fWasDeconvoluted = 0;\n      for ( int i = std::max((int) iStart, (int) (iPeak - kHalfTimeBinWindow)); i < iPeak; i++) {\n        if ( fkBunch->fData[i].fPeak == 2 )\n        {\n          iStart = i + 1;\n          fWasDeconvoluted = 1;\n        }\n      }\n      \/\/Do not mark as deconvoluted when iPeak + 2 is a minimum (because we use that sample), do not consider minima add end of bunch!\n      for ( ; fBunchIndex < fkBunch->fData.size(); fBunchIndex++ ) {\n        if (fBunchIndex == iPeak + kHalfTimeBinWindow)\n        {\n          fBunchIndex++;\n          break;\n        }\n        if (fkBunch->fData[fBunchIndex].fPeak == 2) {\n          if (fBunchIndex + 1 != fkBunch->fData.size()) isDeconvoluted = 1;\n          fBunchIndex++;\n          break;\n        }\n      }\n    } else {\n      \/\/ find next peak\n      if( fBunchIndex+1<fkBunch->fData.size() && fkBunch->fData[fBunchIndex+1].fPeak==1 ){\n\tfBunchIndex = fBunchIndex+1;\n\tisDeconvoluted = 1; \n      } else   if( fBunchIndex+2<fkBunch->fData.size() && fkBunch->fData[fBunchIndex+2].fPeak==1 ){\n\tfBunchIndex = fBunchIndex+1;\n\tisDeconvoluted = 1; \n      } else   if( fBunchIndex+3<fkBunch->fData.size() && fkBunch->fData[fBunchIndex+3].fPeak==1 ){\n\tfBunchIndex = fBunchIndex+2;\n\tisDeconvoluted = 1; \n      } else   if( fBunchIndex+1<fkBunch->fData.size() ){\n\tfBunchIndex = fBunchIndex+2;\n      } else   if( fBunchIndex<fkBunch->fData.size() ){\n\tfBunchIndex = fBunchIndex+1;\n      }\n    }\n  }\n    \n  AliHLTUInt32_t iEnd = fBunchIndex;\n\n  if( fUseTimeBinWindow ){\n    if( iPeak > iStart + kHalfTimeBinWindow ) iStart = iPeak - kHalfTimeBinWindow;\n    if( iEnd  > iPeak + kHalfTimeBinWindow + 1) iEnd = iPeak + kHalfTimeBinWindow + 1;\n  }\n\n  fOutput.fQmax = 0;\n  fOutput.fQ = 0;\n  fOutput.fT = 0;\n  fOutput.fT2 = 0;\n  fOutput.fP = 0;\n  fOutput.fP2 = 0;\n  fOutput.fTMean = fkBunch->fData[iPeak].fTime;\n  fOutput.fNPads = 1;\n  fOutput.fNDeconvolutedTime = ( fWasDeconvoluted || isDeconvoluted ) ? 1 :0;\n  fOutput.fConsecutiveTimeDeconvolution = fOutput.fNDeconvolutedTime;\n  fOutput.fMC.clear();\n\n  fWasDeconvoluted = isDeconvoluted;  \n\n  for( AliHLTUInt32_t i=iStart; i<iEnd; i++ ){\n    const AliHLTTPCHWCFDigit &d = fkBunch->fData[i];\n    AliHLTUInt64_t q = d.fQ*fkBunch->fGain;\n    if (q > fOutput.fQmax) fOutput.fQmax = q;\n    fOutput.fQ += q;\n    fOutput.fT += q*d.fTime;\n    fOutput.fT2+= q*d.fTime*d.fTime;\n    fOutput.fP += q*fkBunch->fPad;\n    fOutput.fP2+= q*fkBunch->fPad*fkBunch->fPad;\n    fOutput.fMC.push_back(d.fMC);\n  }\n  fOutput.fEdge = fkBunch->fEdge && iEnd > iStart + 2 && qPeak > 5;\n  fOutput.fLargestQ = fOutput.fQ;\n  fOutput.fLargestQPad = fkBunch->fEdge ? fkBunch->fPad : 0xFFFFFFFF; \/\/We only correct if the largest charge is at the edge cluster. Mark other pads as -1\n  \n  if( fkBunch->fData.size()==1 && fOutput.fQ < fSingleSeqLimit ) return 0;  \n  \n  return &fOutput;\n}\n<|endoftext|>"}
{"text":"<commit_before>namespace factor\n{\n\ntemplate<typename TargetGeneration, typename Policy>\nstruct copying_collector : collector<TargetGeneration,Policy> {\n\tcell scan;\n\n\texplicit copying_collector(factor_vm *parent_, TargetGeneration *target_, Policy policy_) :\n\t\tcollector<TargetGeneration,Policy>(parent_,target_,policy_), scan(target_->here) {}\n\n\tvoid cheneys_algorithm()\n\t{\n\t\twhile(scan && scan < this->target->here)\n\t\t{\n\t\t\tthis->trace_object((object *)scan);\n\t\t\tscan = this->target->next_object_after(scan);\n\t\t}\n\t}\n};\n\n}\n<commit_msg>VM: Refactor copying_collector.hpp to Factor style<commit_after>namespace factor {\n\ntemplate <typename TargetGeneration, typename Policy>\nstruct copying_collector : collector<TargetGeneration, Policy> {\n  cell scan;\n\n  explicit copying_collector(factor_vm* parent_, TargetGeneration* target_,\n                             Policy policy_)\n      : collector<TargetGeneration, Policy>(parent_, target_, policy_),\n        scan(target_->here) {}\n\n  void cheneys_algorithm() {\n    while (scan && scan < this->target->here) {\n      this->trace_object((object*)scan);\n      scan = this->target->next_object_after(scan);\n    }\n  }\n};\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include \"Header.h\"\n#include \"EasyBMP.h\"\nint main() {\n\tint x=20;\n\tint y=20;\n\tint z=20;\n\tWorld_Map Plot(x,y,z);\n\tint i = 0;\n\tint j = 0;\n\tint k = 0;\n\tBMP *image = new BMP;\n\tIsometric_Render iso(&Plot, image, 0, x-1, 0, y-1, 0, z-1);\n\timage->SetSize(iso.width + DEBUGGING_WIDTH, iso.height+1+DEBUGGING_HEIGHT);\n\tfor (i = 0; i < iso.width; i++) {\n\t\tfor (j = 0; j < iso.height; j++) {\n\t\t\tRGBApixel* pixel = new RGBApixel;\n\t\t\tpixel->Alpha = 127;\n\t\t\tpixel->Red = 0;\n\t\t\tpixel->Green = 0;\n\t\t\tpixel->Blue = 0;\n\t\t\timage->SetPixel(i, j, *pixel);\n\t\t}\n\t}\n    \/\/change made\n\t\/\/bmp image(10,10,(char*)\"air.bmp\");\n\t\/\/image->save();\n\tprintf(\"Saved!\\n\");\n\tint x_max = Plot.get_x();\n\tint y_max = Plot.get_y();\n\tint z_max = Plot.get_z();\n\t\/\/for (i = 0; i < x_max; i++) {\n\t\t\/\/for (j = 0; j < y_max; j++) {\n\t\t\t\/\/for (k = 0; k < z_max; k++) {\n\t\t\t\t\/\/if (k == (int)(25 + 10 * sin(i))) {\n\t\t\t\t\/\/if (1) {\n\t\t\t\t\t\/\/Plot.set_point(i, j, k);\n\t\t\t\t\t\/\/int * point = iso.find_xy(i, j, k);\n\t\t\t\t\t\/\/iso.place_cube(i,j,k);\n\t\t\t\t\t\/\/RGBApixel* pixel = new RGBApixel;\n\t\t\t\t\t\/\/pixel->Alpha = 127;\n\t\t\t\t\t\/\/pixel->Red = Plot.get_point(i, j, k)->r;\n\t\t\t\t\t\/\/pixel->Green = Plot.get_point(i, j, k)->g;\n\t\t\t\t\t\/\/pixel->Blue = Plot.get_point(i, j, k)->b;\n\t\t\t\t\t\/\/image->SetPixel(point[0], iso.height-point[1], *pixel);\n\t\t\t\t\t\/\/cout << \"i: \" << i << \"  j: \" << j << \"  k: \" << k << endl;\n\t\t\t\t\/\/}\n\t\t\t\t\/\/}\n\t\t\t\/\/}\n\t\t\/\/}\n\t\/\/}\n\tRGBApixel* pixel = new RGBApixel;\n\tpixel->Alpha = 127;\n\tpixel->Red =192;\n\tpixel->Green = 192;\n\tpixel->Blue = 192;\n\tint a[2];\n\ta[0] = 17;\n\ta[1] = 82;\n\tint b[2];\n\ta[0] = 43;\n\ta[1] = 53;\n\tiso.draw_line(a, b, pixel);\n\tpixel = new RGBApixel;\n\tpixel->Alpha = 127;\n\tpixel->Red = 0;\n\tpixel->Green = 0;\n\tpixel->Blue = 0;\n\timage->SetPixel(0, 0, *pixel);\n\n\n\tPlot.set_point(0, 0, 0);\n\tint * point = iso.find_xy(0, 0, 1);\n\tprintf(\"\\n\\n\\n%d     %d\\n\", point[0], point[1]);\n\tpoint = iso.find_xy(1, 1, 0);\n\tprintf(\"\\n%d     %d\\n\", point[0], point[1]);\n\timage->WriteToFile(\"isometric.bmp\");\n\n\t\/\/Plot.~World_Map();\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>drew a line<commit_after>#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include \"Header.h\"\n#include \"EasyBMP.h\"\nint main() {\n\tint x=20;\n\tint y=20;\n\tint z=20;\n\tWorld_Map Plot(x,y,z);\n\tint i = 0;\n\tint j = 0;\n\tint k = 0;\n\tBMP *image = new BMP;\n\tIsometric_Render iso(&Plot, image, 0, x-1, 0, y-1, 0, z-1);\n\timage->SetSize(iso.width + DEBUGGING_WIDTH, iso.height+1+DEBUGGING_HEIGHT);\n\tfor (i = 0; i < iso.width; i++) {\n\t\tfor (j = 0; j < iso.height; j++) {\n\t\t\tRGBApixel* pixel = new RGBApixel;\n\t\t\tpixel->Alpha = 127;\n\t\t\tpixel->Red = 0;\n\t\t\tpixel->Green = 0;\n\t\t\tpixel->Blue = 0;\n\t\t\timage->SetPixel(i, j, *pixel);\n\t\t}\n\t}\n    \/\/change made\n\t\/\/bmp image(10,10,(char*)\"air.bmp\");\n\t\/\/image->save();\n\tprintf(\"Saved!\\n\");\n\tint x_max = Plot.get_x();\n\tint y_max = Plot.get_y();\n\tint z_max = Plot.get_z();\n\t\/\/for (i = 0; i < x_max; i++) {\n\t\t\/\/for (j = 0; j < y_max; j++) {\n\t\t\t\/\/for (k = 0; k < z_max; k++) {\n\t\t\t\t\/\/if (k == (int)(25 + 10 * sin(i))) {\n\t\t\t\t\/\/if (1) {\n\t\t\t\t\t\/\/Plot.set_point(i, j, k);\n\t\t\t\t\t\/\/int * point = iso.find_xy(i, j, k);\n\t\t\t\t\t\/\/iso.place_cube(i,j,k);\n\t\t\t\t\t\/\/RGBApixel* pixel = new RGBApixel;\n\t\t\t\t\t\/\/pixel->Alpha = 127;\n\t\t\t\t\t\/\/pixel->Red = Plot.get_point(i, j, k)->r;\n\t\t\t\t\t\/\/pixel->Green = Plot.get_point(i, j, k)->g;\n\t\t\t\t\t\/\/pixel->Blue = Plot.get_point(i, j, k)->b;\n\t\t\t\t\t\/\/image->SetPixel(point[0], iso.height-point[1], *pixel);\n\t\t\t\t\t\/\/cout << \"i: \" << i << \"  j: \" << j << \"  k: \" << k << endl;\n\t\t\t\t\/\/}\n\t\t\t\t\/\/}\n\t\t\t\/\/}\n\t\t\/\/}\n\t\/\/}\n\tRGBApixel* pixel = new RGBApixel;\n\tpixel->Alpha = 127;\n\tpixel->Red =192;\n\tpixel->Green = 192;\n\tpixel->Blue = 192;\n\tint * a = (int *)malloc(sizeof(int)*2);\n\ta[0] = 17;\n\ta[1] = 82;\n\tint * b = (int *)malloc(sizeof(int) * 2);\n\tb[0] = 43;\n\tb[1] = 53;\n\tiso.draw_line(a, b, pixel);\n\tpixel = new RGBApixel;\n\tpixel->Alpha = 127;\n\tpixel->Red = 0;\n\tpixel->Green = 0;\n\tpixel->Blue = 0;\n\timage->SetPixel(0, 0, *pixel);\n\n\n\tPlot.set_point(0, 0, 0);\n\tint * point = iso.find_xy(0, 0, 1);\n\tprintf(\"\\n\\n\\n%d     %d\\n\", point[0], point[1]);\n\tpoint = iso.find_xy(1, 1, 0);\n\tprintf(\"\\n%d     %d\\n\", point[0], point[1]);\n\timage->WriteToFile(\"isometric.bmp\");\n\n\t\/\/Plot.~World_Map();\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*  \n *  Copyright 2010-2011 Anders Wallin (anders.e.e.wallin \"at\" gmail.com)\n *  \n *  This file is part of OpenVoronoi.\n *\n *  OpenCAMlib 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 *  OpenCAMlib is distributed in the hope that it 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 OpenCAMlib.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#ifndef VODI_G_HPP\n#define VODI_G_HPP\n\n#include <vector>\n\n#include <boost\/graph\/adjacency_list.hpp>\n\n#include \"point.hpp\"\n#include \"halfedgediagram.hpp\"\n#include \"voronoivertex.hpp\"\n\n\/\/ this file contains typedefs used by voronoidiagram.h\nnamespace ovd {\n\n\/\/ notes from the Okabe-Boots-Sugihara book, page 171->:\n\/* \n * Distance-function.\n * R1 - region of endpoint pi1\n * R2 - region of endpoint pi2\n * R3 - region of line-segment Li\n *               dist(p,pi1) if  p in R1\n * dist(p,Li) =  dist(p,pi2) if  p in R2\n *               dist(p,Li)  if p in R3\n * \n * dist(p,Li) = distance from p to L, along perpendicular line to L\n * \n * = norm(  (x-xi1)   -  dotprod( (x-xi1), (xi2-xi1) ) \/ ( norm_sq(xi2-xi1) ) * (xi2,xi1) )\n * \n * \n * \n * Vertex - LineSegment\n * Bisectors:\n *  B1: point-point: line\n *  B2: point-line: parabola\n *  B3: line-line: line\n * \n *  Voronoi Edges:\n *  E1: point pi - point pj. straight line bisecting pi-pj\n *  E2: edge generated by line-segment L's endpoint pi. perpendicular to L, passing through pi\n *  E3: point pi - segment Lj. dist(E3, p) == dist(E3,Lj). Parabolic arc\n *  E4: line Li - Line Lj. straight line bisector\n *  (G): generator segment edge\n * \n *  Voronoi vertices (see p177 of Okabe book):\n *  V1: generators(pi, pj, pk). edges(E1, E1, E1)\n *     - compute using detH. This is also the circumcenter of the pi,pj,pk triangle\n *  V2: generators(pi, Lj, pj1) point, segment, segment's endpoint. edges(E1, E2, E3)   E1 and E3 are tangent at V2\n *     - ? compute by mirroring pi in the separator and use detH\n *  V3: generators(Li, pj, pk) edges(E1, E3, E3)   E3-edges have common directrix(Li)\n *  V4: generators(Li, Lj, pi1)  edges(E2, E3, E4)  E3-E4 tangent at V4\n *  V5: generators(pi, Lj, Lk) edges (E3, E3, E4)\n *  V6: generators(Li, Lj, Lk) edges(E4, E4, E4)\n *    - this is the incenter of a incircle inscribed by triangle Li,Lj,Lk (or sometiems excenter of excircle if V6 outside triangle?)\n *    - The Cartesian coordinates of the incenter are a weighted average of the coordinates of the three vertices using the side \n *       lengths of the triangle as weights. (The weights are positive so the incenter lies inside the triangle as stated above.) \n *      If the three vertices are located at (xa,ya), (xb,yb), and (xc,yc), and the sides opposite these vertices have corresponding \n *      lengths a, b, and c, then the incenter is at   \n *      (a x_a + b x_b + c x_c)\/ (a+b+c) \n * \n * bisector formulas\n * x = x1 - x2 - x3*t +\/- x4 * sqrt( square(x5+x6*t) - square(x7+x8*t) )\n * (same formula for y-coordinate)\n * line (line\/line)\n * parabola (circle\/line)\n * hyperbola (circle\/circle)\n * ellipse (circle\/circle)\n * \n * line: a1*x + b1*y + c + k*t = 0  (t is amount of offset) k=+1 offset left of line, k=-1 right of line\n * with a*a + b*b = 1\n * \n * circle: square(x-xc) + square(y-yc) = square(r+k*t)  k=+1 for enlarging circle, k=-1 shrinking\n *\/\n \n\n\/\/ use traits-class here so that EdgePros can store data of type HEEdge\n\/\/ typedef of the VD-graph follows below. \n\n\/\/ vecS is slightly faster than listS\n\/\/ vecS   5.72us * n log(n)\n\/\/ listS  6.18 * n log(n)\n#define OUT_EDGE_CONTAINER boost::vecS \n\n\/\/ note: cannot use vecS since remove_vertex invalidates iterators\/edge_descriptors (?)\n#define VERTEX_CONTAINER boost::listS\n#define EDGE_LIST_CONTAINER boost::listS\n\n\/\/ type of edge-descriptors in the graph\ntypedef boost::adjacency_list_traits<OUT_EDGE_CONTAINER, \n                                     VERTEX_CONTAINER, \n                                     boost::bidirectionalS, \n                                     EDGE_LIST_CONTAINER >::edge_descriptor HEEdge;\n\/\/ type of face-descriptors in the graph\ntypedef unsigned int HEFace;    \n\n\/*\n * bisector formulas\n * x = x1 - x2 - x3*t +\/- x4 * sqrt( square(x5+x6*t) - square(x7+x8*t) )\n * (same formula for y-coordinate)\n * line (line\/line)\n * parabola (circle\/line)\n * hyperbola (circle\/circle)\n * ellipse (circle\/circle)\n*\/\n                            \nenum VoronoiEdgeType {LINE, PARABOLA, ELLIPSE, HYPERBOLA, SEPARATOR, LINESITE};\n\n\/\/\/ properties of an edge in the voronoi diagram\n\/\/\/ each edge stores a pointer to the next HEEdge \n\/\/\/ and the HEFace to which this HEEdge belongs\nstruct EdgeProps {\n    EdgeProps() {}\n    EdgeProps(HEEdge n, HEFace f): next(n), face(f) {}\n    \/\/\/ create edge with given next, twin, and face\n    EdgeProps(HEEdge n, HEEdge t, HEFace f): next(n), twin(t), face(f) {}\n    \/\/\/ the next edge, counterclockwise, from this edge\n    HEEdge next; \n    \/\/\/ the twin edge\n    HEEdge twin;\n    \/\/\/ the face to which this edge belongs\n    HEFace face; \/\/ each face corresponds to an input Site\/generator\n    double k; \/\/ offset-direction from the adjacent site, either +1 or -1\n    VoronoiEdgeType type;\n    inline double sq(double x) const {return x*x;}\n    Point point(double t) const {\n        double discr1 = sq(x[4]+x[5]*t) - sq(x[6]+x[7]*t);\n        double discr2 = sq(y[4]+y[5]*t) - sq(y[6]+y[7]*t);\n        if ( (discr1 >= 0) && (discr2 >= 0) ) {\n            double xc = x[0] - x[1] - x[2]*t + x[3] * sqrt( sq(x[4]+x[5]*t) - sq(x[6]+x[7]*t) );\n            double yc = y[0] - y[1] - y[2]*t + y[3] * sqrt( sq(y[4]+y[5]*t) - sq(y[6]+y[7]*t) );\n            return Point(xc,yc);\n        } else {\n            std::cout << \" warning bisector sqrt(-1) !\\n\";\n            return Point(0,0);\n        }\n    }\n    double x[8];\n    double y[8];\n    void set_parameters(Site* s1, Site* s2) {\n        if (s1->isPoint() && s2->isPoint())        \/\/ PP\n            set_pp_parameters(s1,s2);\n        else if (s1->isPoint() && s2->isLine())    \/\/ PL\n            set_pl_parameters(s1,s2);\n        else if (s2->isPoint() && s1->isLine())    \/\/ LP\n            set_pl_parameters(s2,s1);\n        else if (s1->isLine() && s2->isLine())     \/\/ LL\n            set_ll_parameters(s2,s1);\n        else\n            assert(0);\n            \/\/ AP\n            \/\/ PA\n            \/\/ AA\n            \/\/ AL\n            \/\/ LA\n    }\n    \/\/ called for point(s1)-point(s2) edges\n    void set_pp_parameters(Site* s1, Site* s2) {\n        std::cout << \" set_pp \\n\";\n        type = LINE;\n    }\n    \/\/ called for point(s1)-line(s2) edges\n    void set_pl_parameters(Site* s1, Site* s2) {\n        std::cout << \" set_pl \\n\";\n        type = PARABOLA;\n        double alfa3 = s2->a()*s1->x() + s2->b()*s1->y() + s2->c();\n        x[0]=s1->x();       \/\/ xc1\n        x[1]=s2->a()*alfa3; \/\/ alfa1*alfa3\n        x[2]=-s2->a();      \/\/ -alfa1 = - a2\n        x[3]=s2->b();       \/\/ alfa2 = b2\n        x[4]=0;             \/\/ alfa4 = r1 \n        x[5]=+1;            \/\/ lambda1 (allways positive offset from PointSite?)\n        x[6]= alfa3;        \/\/ alfa3= a2*xc1+b2*yc1+d2?\n        x[7]=-1;            \/\/ -1 \n\n        y[0]=s1->y();       \/\/ yc1\n        y[1]=s2->b()*alfa3; \/\/ alfa2*alfa3\n        y[2]=-s2->b();      \/\/ -alfa2 = -b2\n        y[3]=s2->a();       \/\/ alfa1 = a2\n        y[4]=0;             \/\/ alfa4 = r1\n        y[5]=+1;            \/\/ lambda1 (allways positive offset from PointSite?)\n        y[6]=alfa3;         \/\/ alfa3\n        y[7]=-1;            \/\/ -1\n        print_params();\n    }\n    \/\/ line(s1)-line(s2) edge\n    void set_ll_parameters(Site* s1, Site* s2) {  \/\/ Held thesis p96\n        std::cout << \" set_ll \\n\";\n        type = LINE;\n        double delta = s1->a()*s2->b() - s1->b()*s2->a();\n        assert( delta != 0 );\n        x[0]= ( (s1->b() * s2->c()) - (s2->b() * s1->c()) ) \/ delta;  \/\/ alfa1 = (b1*d2-b2*d1) \/ delta\n        x[1]=0;\n        x[2]= -(s2->b()-s1->b()); \/\/ -alfa3 = -( b2-b1 )\n        x[3]=0;\n        x[4]=0;\n        x[5]=0;\n        x[6]=0;\n        x[7]=0;\n        \n        y[0]= ( (s2->a()*s1->c()) - (s1->a()*s2->c()) ) \/ delta;  \/\/ alfa2 = (a2*d1-a1*d2) \/ delta\n        y[1]= 0;\n        y[2]= -(s1->a()-s2->a());  \/\/ -alfa4 = -( a1-a2 )\n        y[3]=0;\n        y[4]=0;\n        y[5]=0;\n        y[6]=0;\n        y[7]=0;\n        y[8]=0;\n    }\n    void print_params() const {\n        std::cout << \"x-params: \";\n        for (int m=0;m<8;m++)\n            std::cout << x[m] << \" \";\n        std::cout << \"\\n\";\n        std::cout << \"y-params: \";\n        for (int m=0;m<8;m++)\n            std::cout << y[m] << \" \";\n        std::cout << \"\\n\";\n    }\n    \/\/ arc: d=sqrt( sq(xc1-xc2) + sq(yc1-yc2) )\n};\n\n\n\/\/\/ Status of faces in the voronoi diagram\n\/\/\/ INCIDENT faces contain one or more IN-vertex\n\/\/\/ NONINCIDENT faces contain only OUT-vertices\nenum VoronoiFaceStatus {INCIDENT, NONINCIDENT};\n\n\/\/\/ properties of a face in the voronoi diagram\n\/\/\/ each face stores one edge on the boundary of the face\nstruct FaceProps {\n    FaceProps( ) {}\n    \/\/\/ create face with given edge, generator, and type\n    FaceProps( HEEdge e , Site* s, VoronoiFaceStatus st) : edge(e), site(s), status(st) {}\n    \/\/\/ operator for sorting faces\n    bool operator<(const FaceProps& f) const {return (this->idx<f.idx);}\n    \/\/\/ face index\n    HEFace idx;\n    \/\/\/ one edge that bounds this face\n    HEEdge edge;\n    \/\/\/ the site\/generator for this face (either PointSite, LineSite, or ArcSite)\n    Site* site;\n    \/\/\/ face status (either incident or nonincident)\n    VoronoiFaceStatus status;\n};\n\n\/\/ the type of graph with which we construct the voronoi-diagram\ntypedef hedi::HEDIGraph< OUT_EDGE_CONTAINER,     \/\/ out-edges stored in a std::list\n                       VERTEX_CONTAINER,         \/\/ vertex set stored here\n                       boost::bidirectionalS,    \/\/ bidirectional graph.\n                       VoronoiVertex,            \/\/ vertex properties\n                       EdgeProps,                \/\/ edge properties\n                       FaceProps,                \/\/ face properties\n                       boost::no_property,       \/\/ graph properties\n                       EDGE_LIST_CONTAINER       \/\/ edge storage\n                       > HEGraph;\n\/\/ NOTE: if these listS etc. arguments ever change, they must also be updated\n\/\/ above where we do: adjacency_list_traits\n\ntypedef boost::graph_traits< HEGraph::BGLGraph >::vertex_descriptor  HEVertex;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::vertex_iterator    HEVertexItr;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::edge_iterator      HEEdgeItr;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::out_edge_iterator  HEOutEdgeItr;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::adjacency_iterator HEAdjacencyItr;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::vertices_size_type HEVertexSize;\n\n\/\/ these containers are used instead of iterators when accessing\n\/\/ adjacent vertices, edges, faces.\n\/\/ FIXME: it may be faster to rewrite the code so it uses iterators, as does the BGL.\ntypedef std::vector<HEVertex> VertexVector;\ntypedef std::vector<HEFace> FaceVector;\ntypedef std::vector<HEEdge> EdgeVector;  \n\n} \/\/ end namespace\n#endif\n\n\n<commit_msg>minor documentation<commit_after>\/*  \n *  Copyright 2010-2011 Anders Wallin (anders.e.e.wallin \"at\" gmail.com)\n *  \n *  This file is part of OpenVoronoi.\n *\n *  OpenCAMlib 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 *  OpenCAMlib is distributed in the hope that it 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 OpenCAMlib.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#ifndef VODI_G_HPP\n#define VODI_G_HPP\n\n#include <vector>\n\n#include <boost\/graph\/adjacency_list.hpp>\n\n#include \"point.hpp\"\n#include \"halfedgediagram.hpp\"\n#include \"voronoivertex.hpp\"\n\n\/\/ this file contains typedefs used by voronoidiagram.h\nnamespace ovd {\n\n\/\/ notes from the Okabe-Boots-Sugihara book, page 171->:\n\/* \n * Distance-function.\n * R1 - region of endpoint pi1\n * R2 - region of endpoint pi2\n * R3 - region of line-segment Li\n *               dist(p,pi1) if  p in R1\n * dist(p,Li) =  dist(p,pi2) if  p in R2\n *               dist(p,Li)  if p in R3\n * \n * dist(p,Li) = distance from p to L, along perpendicular line to L\n * \n * = norm(  (x-xi1)   -  dotprod( (x-xi1), (xi2-xi1) ) \/ ( norm_sq(xi2-xi1) ) * (xi2,xi1) )\n * \n * \n * \n * Vertex - LineSegment\n * Bisectors:\n *  B1: point-point: line\n *  B2: point-line: parabola\n *  B3: line-line: line\n * \n *  Voronoi Edges:\n *  E1: point pi - point pj. straight line bisecting pi-pj\n *  E2: edge generated by line-segment L's endpoint pi. perpendicular to L, passing through pi\n *  E3: point pi - segment Lj. dist(E3, p) == dist(E3,Lj). Parabolic arc\n *  E4: line Li - Line Lj. straight line bisector\n *  (G): generator segment edge\n * \n *  Voronoi vertices (see p177 of Okabe book):\n *  V1: generators(pi, pj, pk). edges(E1, E1, E1)\n *     - compute using detH. This is also the circumcenter of the pi,pj,pk triangle\n *  V2: generators(pi, Lj, pj1) point, segment, segment's endpoint. edges(E1, E2, E3)   E1 and E3 are tangent at V2\n *     - ? compute by mirroring pi in the separator and use detH\n *  V3: generators(Li, pj, pk) edges(E1, E3, E3)   E3-edges have common directrix(Li)\n *  V4: generators(Li, Lj, pi1)  edges(E2, E3, E4)  E3-E4 tangent at V4\n *  V5: generators(pi, Lj, Lk) edges (E3, E3, E4)\n *  V6: generators(Li, Lj, Lk) edges(E4, E4, E4)\n *    - this is the incenter of a incircle inscribed by triangle Li,Lj,Lk (or sometiems excenter of excircle if V6 outside triangle?)\n *    - The Cartesian coordinates of the incenter are a weighted average of the coordinates of the three vertices using the side \n *       lengths of the triangle as weights. (The weights are positive so the incenter lies inside the triangle as stated above.) \n *      If the three vertices are located at (xa,ya), (xb,yb), and (xc,yc), and the sides opposite these vertices have corresponding \n *      lengths a, b, and c, then the incenter is at   \n *      (a x_a + b x_b + c x_c)\/ (a+b+c) \n * \n * bisector formulas\n * x = x1 - x2 - x3*t +\/- x4 * sqrt( square(x5+x6*t) - square(x7+x8*t) )\n * (same formula for y-coordinate)\n * line (line\/line)\n * parabola (circle\/line)\n * hyperbola (circle\/circle)\n * ellipse (circle\/circle)\n * \n * line: a1*x + b1*y + c + k*t = 0  (t is amount of offset) k=+1 offset left of line, k=-1 right of line\n * with a*a + b*b = 1\n * \n * circle: square(x-xc) + square(y-yc) = square(r+k*t)  k=+1 for enlarging circle, k=-1 shrinking\n *\/\n \n\n\/\/ use traits-class here so that EdgePros can store data of type HEEdge\n\/\/ typedef of the VD-graph follows below. \n\n\/\/ vecS is slightly faster than listS\n\/\/ vecS   5.72us * n log(n)\n\/\/ listS  6.18 * n log(n)\n#define OUT_EDGE_CONTAINER boost::vecS \n\n\/\/ note: cannot use vecS since remove_vertex invalidates iterators\/edge_descriptors (?)\n#define VERTEX_CONTAINER boost::listS\n#define EDGE_LIST_CONTAINER boost::listS\n\n\/\/ type of edge-descriptors in the graph\ntypedef boost::adjacency_list_traits<OUT_EDGE_CONTAINER, \n                                     VERTEX_CONTAINER, \n                                     boost::bidirectionalS, \n                                     EDGE_LIST_CONTAINER >::edge_descriptor HEEdge;\n\/\/ type of face-descriptors in the graph\ntypedef unsigned int HEFace;    \n\n\/*\n * bisector formulas\n * x = x1 - x2 - x3*t +\/- x4 * sqrt( square(x5+x6*t) - square(x7+x8*t) )\n * (same formula for y-coordinate)\n * line (line\/line)\n * parabola (circle\/line)\n * hyperbola (circle\/circle)\n * ellipse (circle\/circle)\n*\/\n                            \nenum VoronoiEdgeType {LINE, PARABOLA, ELLIPSE, HYPERBOLA, SEPARATOR, LINESITE};\n\n\/\/\/ properties of an edge in the voronoi diagram\n\/\/\/ each edge stores a pointer to the next HEEdge \n\/\/\/ and the HEFace to which this HEEdge belongs\nstruct EdgeProps {\n    EdgeProps() {}\n    EdgeProps(HEEdge n, HEFace f): next(n), face(f) {}\n    \/\/\/ create edge with given next, twin, and face\n    EdgeProps(HEEdge n, HEEdge t, HEFace f): next(n), twin(t), face(f) {}\n    \/\/\/ the next edge, counterclockwise, from this edge\n    HEEdge next; \n    \/\/\/ the twin edge\n    HEEdge twin;\n    \/\/\/ the face to which this edge belongs\n    HEFace face; \/\/ each face corresponds to an input Site\/generator\n    double k; \/\/ offset-direction from the adjacent site, either +1 or -1\n    VoronoiEdgeType type;\n    inline double sq(double x) const {return x*x;}\n    Point point(double t) const {\n        double discr1 = sq(x[4]+x[5]*t) - sq(x[6]+x[7]*t);\n        double discr2 = sq(y[4]+y[5]*t) - sq(y[6]+y[7]*t);\n        if ( (discr1 >= 0) && (discr2 >= 0) ) {\n            double xc = x[0] - x[1] - x[2]*t + x[3] * sqrt( sq(x[4]+x[5]*t) - sq(x[6]+x[7]*t) );\n            double yc = y[0] - y[1] - y[2]*t + y[3] * sqrt( sq(y[4]+y[5]*t) - sq(y[6]+y[7]*t) );\n            return Point(xc,yc);\n        } else {\n            std::cout << \" warning bisector sqrt(-1) !\\n\";\n            return Point(0,0);\n        }\n    }\n    double x[8];\n    double y[8];\n    void set_parameters(Site* s1, Site* s2) {\n        if (s1->isPoint() && s2->isPoint())        \/\/ PP\n            set_pp_parameters(s1,s2);\n        else if (s1->isPoint() && s2->isLine())    \/\/ PL\n            set_pl_parameters(s1,s2);\n        else if (s2->isPoint() && s1->isLine())    \/\/ LP\n            set_pl_parameters(s2,s1);\n        else if (s1->isLine() && s2->isLine())     \/\/ LL\n            set_ll_parameters(s2,s1);\n        else\n            assert(0);\n            \/\/ AP\n            \/\/ PA\n            \/\/ AA\n            \/\/ AL\n            \/\/ LA\n    }\n    \/\/ called for point(s1)-point(s2) edges\n    void set_pp_parameters(Site* s1, Site* s2) {\n        std::cout << \" set_pp \\n\";\n        type = LINE;\n    }\n    \/\/ called for point(s1)-line(s2) edges\n    void set_pl_parameters(Site* s1, Site* s2) {\n        \/\/ x = xc -a2 h -k2 a2 t +\/- b2 sqrt( (e1+k1 t)^2 - (alfa3 + k2 t)^2 )\n        std::cout << \" set_pl \\n\";\n        type = PARABOLA;\n        double alfa3 = s2->a()*s1->x() + s2->b()*s1->y() + s2->c();\n        x[0]=s1->x();       \/\/ xc1\n        x[1]=s2->a()*alfa3; \/\/ alfa1*alfa3\n        x[2]=-s2->a();      \/\/ -alfa1 = - a2 * k2?\n        x[3]=s2->b();       \/\/ alfa2 = b2\n        x[4]=0;             \/\/ alfa4 = r1 \n        x[5]=+1;            \/\/ lambda1 (allways positive offset from PointSite?)\n        x[6]= alfa3;        \/\/ alfa3= a2*xc1+b2*yc1+d2?\n        x[7]=-1;            \/\/ -1 = k2 side of line??\n\n        y[0]=s1->y();       \/\/ yc1\n        y[1]=s2->b()*alfa3; \/\/ alfa2*alfa3\n        y[2]=-s2->b();      \/\/ -alfa2 = -b2\n        y[3]=s2->a();       \/\/ alfa1 = a2\n        y[4]=0;             \/\/ alfa4 = r1\n        y[5]=+1;            \/\/ lambda1 (allways positive offset from PointSite?)\n        y[6]=alfa3;         \/\/ alfa3\n        y[7]=-1;            \/\/ -1 = k2 side of line??\n        print_params();\n    }\n    \/\/ line(s1)-line(s2) edge\n    void set_ll_parameters(Site* s1, Site* s2) {  \/\/ Held thesis p96\n        std::cout << \" set_ll \\n\";\n        type = LINE;\n        double delta = s1->a()*s2->b() - s1->b()*s2->a();\n        assert( delta != 0 );\n        x[0]= ( (s1->b() * s2->c()) - (s2->b() * s1->c()) ) \/ delta;  \/\/ alfa1 = (b1*d2-b2*d1) \/ delta\n        x[1]=0;\n        x[2]= -(s2->b()-s1->b()); \/\/ -alfa3 = -( b2-b1 )\n        x[3]=0;\n        x[4]=0;\n        x[5]=0;\n        x[6]=0;\n        x[7]=0;\n        \n        y[0]= ( (s2->a()*s1->c()) - (s1->a()*s2->c()) ) \/ delta;  \/\/ alfa2 = (a2*d1-a1*d2) \/ delta\n        y[1]= 0;\n        y[2]= -(s1->a()-s2->a());  \/\/ -alfa4 = -( a1-a2 )\n        y[3]=0;\n        y[4]=0;\n        y[5]=0;\n        y[6]=0;\n        y[7]=0;\n        y[8]=0;\n    }\n    void print_params() const {\n        std::cout << \"x-params: \";\n        for (int m=0;m<8;m++)\n            std::cout << x[m] << \" \";\n        std::cout << \"\\n\";\n        std::cout << \"y-params: \";\n        for (int m=0;m<8;m++)\n            std::cout << y[m] << \" \";\n        std::cout << \"\\n\";\n    }\n    \/\/ arc: d=sqrt( sq(xc1-xc2) + sq(yc1-yc2) )\n};\n\n\n\/\/\/ Status of faces in the voronoi diagram\n\/\/\/ INCIDENT faces contain one or more IN-vertex\n\/\/\/ NONINCIDENT faces contain only OUT-vertices\nenum VoronoiFaceStatus {INCIDENT, NONINCIDENT};\n\n\/\/\/ properties of a face in the voronoi diagram\n\/\/\/ each face stores one edge on the boundary of the face\nstruct FaceProps {\n    FaceProps( ) {}\n    \/\/\/ create face with given edge, generator, and type\n    FaceProps( HEEdge e , Site* s, VoronoiFaceStatus st) : edge(e), site(s), status(st) {}\n    \/\/\/ operator for sorting faces\n    bool operator<(const FaceProps& f) const {return (this->idx<f.idx);}\n    \/\/\/ face index\n    HEFace idx;\n    \/\/\/ one edge that bounds this face\n    HEEdge edge;\n    \/\/\/ the site\/generator for this face (either PointSite, LineSite, or ArcSite)\n    Site* site;\n    \/\/\/ face status (either incident or nonincident)\n    VoronoiFaceStatus status;\n};\n\n\/\/ the type of graph with which we construct the voronoi-diagram\ntypedef hedi::HEDIGraph< OUT_EDGE_CONTAINER,     \/\/ out-edges stored in a std::list\n                       VERTEX_CONTAINER,         \/\/ vertex set stored here\n                       boost::bidirectionalS,    \/\/ bidirectional graph.\n                       VoronoiVertex,            \/\/ vertex properties\n                       EdgeProps,                \/\/ edge properties\n                       FaceProps,                \/\/ face properties\n                       boost::no_property,       \/\/ graph properties\n                       EDGE_LIST_CONTAINER       \/\/ edge storage\n                       > HEGraph;\n\/\/ NOTE: if these listS etc. arguments ever change, they must also be updated\n\/\/ above where we do: adjacency_list_traits\n\ntypedef boost::graph_traits< HEGraph::BGLGraph >::vertex_descriptor  HEVertex;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::vertex_iterator    HEVertexItr;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::edge_iterator      HEEdgeItr;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::out_edge_iterator  HEOutEdgeItr;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::adjacency_iterator HEAdjacencyItr;\ntypedef boost::graph_traits< HEGraph::BGLGraph >::vertices_size_type HEVertexSize;\n\n\/\/ these containers are used instead of iterators when accessing\n\/\/ adjacent vertices, edges, faces.\n\/\/ FIXME: it may be faster to rewrite the code so it uses iterators, as does the BGL.\ntypedef std::vector<HEVertex> VertexVector;\ntypedef std::vector<HEFace> FaceVector;\ntypedef std::vector<HEEdge> EdgeVector;  \n\n} \/\/ end namespace\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>class Solution {\npublic:\n    vector<int> twoSum(vector<int>& nums, int target) {\n        map<int, int> m;\n        vector<int> ans;\n        for (int i = 0; i < nums.size(); i++)\n        {\n            m[nums[i]]=i;\n        }\n        for(int i = 0; i < nums.size(); i++)\n        {\n            if(m.find(target - nums[i]) != m.end() && m[target - nums[i]] != i)\n            {\n                ans.push_back(i + 1);\n                ans.push_back(m[target - nums[i]] + 1);\n                break;\n            }\n        }\n        return ans;\n    }\n};<commit_msg>Create code.cpp<commit_after>class Solution {\npublic:\n    vector<int> twoSum(vector<int>& nums, int target) {\n        map<int, int> m;\n        vector<int> ans;\n        for (int i = 0; i < nums.size(); i++)\n        {\n            m[nums[i]] = i;\n        }\n        for(int i = 0; i < nums.size(); i++)\n        {\n            if(m.find(target - nums[i]) != m.end() && m[target - nums[i]] != i)\n            {\n                ans.push_back(i);\n                ans.push_back(m[target - nums[i]]);\n                break;\n            }\n        }\n        return ans;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"SIO\/SIOSimCalHitHandler.h\"\n\n#include \"SIO\/LCSIO.h\"\n\n#include \"EVENT\/LCIO.h\"\n#include \"EVENT\/MCParticle.h\"\n#include \"EVENT\/SimCalorimeterHit.h\"\n#include \"IOIMPL\/SimCalorimeterHitIOImpl.h\"\n#include \"IMPL\/LCFlagImpl.h\"\n\n#include \"SIO_functions.h\"\n#include \"SIO_block.h\"\n\n\nusing namespace EVENT ;\nusing namespace IMPL ;\nusing namespace IOIMPL ;\n\n\nnamespace SIO{\n    \n  unsigned int SIOSimCalHitHandler::read(SIO_stream* stream, \n\t\t\t\t      LCObject** objP){\n    unsigned int status ; \n\t\n    \/\/ create a new object :\n    SimCalorimeterHitIOImpl* hit  = new SimCalorimeterHitIOImpl ;\n    *objP = hit ;\n\t\n    SIO_DATA( stream ,  &(hit->_cellID0) , 1  ) ;\n\n    \/\/ in v00-08 cellid1 has been stored by default\n    if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_ID1 ) || \n\n\t( SIO_VERSION_MAJOR(_vers)==0 && SIO_VERSION_MINOR(_vers)==8) ){\n\n      SIO_DATA( stream ,  &(hit->_cellID1) , 1  ) ;\n\n    }\n    SIO_DATA( stream ,  &(hit->_energy) , 1  ) ;\n\n    if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_LONG ) ){\n      SIO_DATA( stream ,  hit->_position  , 3 ) ;\n    }\n\n    \/\/ read MCContributions\n    int nCon ;\n    SIO_DATA( stream ,  &nCon , 1  ) ;\n\n    for(int i=0; i< nCon ; i++){\n\n      MCParticleCont* mcCon = new MCParticleCont ;\n      SIO_PNTR( stream , &(mcCon->Particle)  ) ;\n      SIO_DATA( stream , &(mcCon->Energy) , 1 ) ;\n      SIO_DATA( stream , &(mcCon->Time)   , 1 ) ;\n\tSIO_DATA( stream , &(mcCon->PDG)    , 1 ) ;\n\n    if( _vers > SIO_VERSION_ENCODE( 1, 52 ) ){\n        if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_STEP ) ){\n            SIO_DATA( stream , &(mcCon->StepPosition[0])    , 1 ) ;\n            SIO_DATA( stream , &(mcCon->StepPosition[1])    , 1 ) ;\n            SIO_DATA( stream , &(mcCon->StepPosition[2])    , 1 ) ;\n        }\n      }\n\n      hit->_vec.push_back(  mcCon  );\n    }\n\n    \/\/ read a pointer tag for  reference to calorimeter hits\n\n    if( _vers > SIO_VERSION_ENCODE( 1, 0) ){ \n      SIO_PTAG( stream , dynamic_cast<const SimCalorimeterHit*>(hit) ) ;\n    }\n    \n    return ( SIO_BLOCK_SUCCESS ) ;\n\t\n  }\n    \n    \n  unsigned int SIOSimCalHitHandler::write(SIO_stream* stream, \n\t\t\t\t       const LCObject* obj){\n    \n    unsigned int status ; \n\t\n    const SimCalorimeterHit* hit = dynamic_cast<const SimCalorimeterHit*>(obj)  ;\n    \n    LCSIO_WRITE( stream, hit->getCellID0()  ) ;\n    if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_ID1 ) ){\n      LCSIO_WRITE( stream, hit->getCellID1()  ) ;\n    }\n    LCSIO_WRITE( stream, hit->getEnergy()  ) ;\n    \/\/ as SIO doesn't provide a write function with const arguments\n    \/\/ we have to cast away the constness \n\n    if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_LONG ) ){\n      float* pos = const_cast<float*> ( hit->getPosition() ) ; \n      SIO_DATA( stream,  pos , 3 ) ;\n    }\n    \/\/ now the MCParticle contributions\n    int nMC = hit->getNMCContributions() ;\n    SIO_DATA( stream,  &nMC , 1 ) ;\n\n    for(int i=0; i<nMC ;i++){\n\n      const MCParticle* part = hit->getParticleCont(i)  ;\n      SIO_PNTR( stream , &part ) ;\n      \n      LCSIO_WRITE( stream, hit->getEnergyCont(i)  ) ;\n      LCSIO_WRITE( stream, hit->getTimeCont(i)  ) ;\n\t  LCSIO_WRITE( stream, hit->getPDGCont(i)  ) ;\n\n      if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_STEP ) ){\n          const float* sp = hit->getStepPosition(i) ; \n          LCSIO_WRITE( stream, sp[0] ) ;\n          LCSIO_WRITE( stream, sp[1] ) ;\n          LCSIO_WRITE( stream, sp[2] ) ;\n      }\n    }\n    \n    \/\/ add a pointer tag for reference to sim. calorimeter hits - added in v1.1\n    SIO_PTAG( stream , hit ) ;\n\n    return ( SIO_BLOCK_SUCCESS ) ;\n    \n  }\n  \n} \/\/ namespace\n<commit_msg> - fixed reading of PDG code (only if CHBIT_PDG(STEP) is set) <commit_after>#include \"SIO\/SIOSimCalHitHandler.h\"\n\n#include \"SIO\/LCSIO.h\"\n\n#include \"EVENT\/LCIO.h\"\n#include \"EVENT\/MCParticle.h\"\n#include \"EVENT\/SimCalorimeterHit.h\"\n#include \"IOIMPL\/SimCalorimeterHitIOImpl.h\"\n#include \"IMPL\/LCFlagImpl.h\"\n\n#include \"SIO_functions.h\"\n#include \"SIO_block.h\"\n\n\nusing namespace EVENT ;\nusing namespace IMPL ;\nusing namespace IOIMPL ;\n\n\nnamespace SIO{\n    \n  unsigned int SIOSimCalHitHandler::read(SIO_stream* stream, \n\t\t\t\t      LCObject** objP){\n    unsigned int status ; \n\t\n    \/\/ create a new object :\n    SimCalorimeterHitIOImpl* hit  = new SimCalorimeterHitIOImpl ;\n    *objP = hit ;\n\t\n    SIO_DATA( stream ,  &(hit->_cellID0) , 1  ) ;\n\n    \/\/ in v00-08 cellid1 has been stored by default\n    if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_ID1 ) || \n\n\t( SIO_VERSION_MAJOR(_vers)==0 && SIO_VERSION_MINOR(_vers)==8) ){\n\n      SIO_DATA( stream ,  &(hit->_cellID1) , 1  ) ;\n\n    }\n    SIO_DATA( stream ,  &(hit->_energy) , 1  ) ;\n\n    if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_LONG ) ){\n      SIO_DATA( stream ,  hit->_position  , 3 ) ;\n    }\n\n    \/\/ read MCContributions\n    int nCon ;\n    SIO_DATA( stream ,  &nCon , 1  ) ;\n\n    for(int i=0; i< nCon ; i++){\n\n      MCParticleCont* mcCon = new MCParticleCont ;\n      SIO_PNTR( stream , &(mcCon->Particle)  ) ;\n      SIO_DATA( stream , &(mcCon->Energy) , 1 ) ;\n      SIO_DATA( stream , &(mcCon->Time)   , 1 ) ;\n\n      if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_PDG ) ){  \/\/ BIT_PDG == BIT_STEP \n\tSIO_DATA( stream , &(mcCon->PDG)    , 1 ) ;\n      }\n\n      if( _vers > SIO_VERSION_ENCODE( 1, 52 ) ){\n\tif( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_STEP ) ){\n\t  SIO_DATA( stream , &(mcCon->StepPosition[0])    , 1 ) ;\n\t  SIO_DATA( stream , &(mcCon->StepPosition[1])    , 1 ) ;\n\t  SIO_DATA( stream , &(mcCon->StepPosition[2])    , 1 ) ;\n        }\n      }\n      \n      hit->_vec.push_back(  mcCon  );\n    }\n\n    \/\/ read a pointer tag for  reference to calorimeter hits\n\n    if( _vers > SIO_VERSION_ENCODE( 1, 0) ){ \n      SIO_PTAG( stream , dynamic_cast<const SimCalorimeterHit*>(hit) ) ;\n    }\n    \n    return ( SIO_BLOCK_SUCCESS ) ;\n\t\n  }\n    \n    \n  unsigned int SIOSimCalHitHandler::write(SIO_stream* stream, \n\t\t\t\t       const LCObject* obj){\n    \n    unsigned int status ; \n\t\n    const SimCalorimeterHit* hit = dynamic_cast<const SimCalorimeterHit*>(obj)  ;\n    \n    LCSIO_WRITE( stream, hit->getCellID0()  ) ;\n    if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_ID1 ) ){\n      LCSIO_WRITE( stream, hit->getCellID1()  ) ;\n    }\n    LCSIO_WRITE( stream, hit->getEnergy()  ) ;\n    \/\/ as SIO doesn't provide a write function with const arguments\n    \/\/ we have to cast away the constness \n\n    if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_LONG ) ){\n      float* pos = const_cast<float*> ( hit->getPosition() ) ; \n      SIO_DATA( stream,  pos , 3 ) ;\n    }\n    \/\/ now the MCParticle contributions\n    int nMC = hit->getNMCContributions() ;\n    SIO_DATA( stream,  &nMC , 1 ) ;\n\n    for(int i=0; i<nMC ;i++){\n\n      const MCParticle* part = hit->getParticleCont(i)  ;\n      SIO_PNTR( stream , &part ) ;\n      \n      LCSIO_WRITE( stream, hit->getEnergyCont(i)  ) ;\n      LCSIO_WRITE( stream, hit->getTimeCont(i)  ) ;\n\n      if( LCFlagImpl(_flag).bitSet( LCIO::CHBIT_STEP ) ){\n\n\tLCSIO_WRITE( stream, hit->getPDGCont(i)  ) ;\n\n\t\/\/ const float* sp = hit->getStepPosition(i) ; \n\t\/\/ LCSIO_WRITE( stream, sp[0] ) ;\n\t\/\/ LCSIO_WRITE( stream, sp[1] ) ;\n\t\/\/ LCSIO_WRITE( stream, sp[2] ) ;\n\tfloat* sp = const_cast<float*> ( hit->getStepPosition(i) ) ; \n\tSIO_DATA( stream,  sp , 3 ) ;\n      }\n    }\n    \n    \/\/ add a pointer tag for reference to sim. calorimeter hits - added in v1.1\n    SIO_PTAG( stream , hit ) ;\n\n    return ( SIO_BLOCK_SUCCESS ) ;\n    \n  }\n  \n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>#include \"dioptre\/physics\/bullet\/physics.h\"\n#include \"dioptre\/physics\/bullet\/shape.h\"\n#include \"dioptre\/locator.h\"\n\n#include <iostream>\n\nnamespace dioptre {\nnamespace physics {\nnamespace bullet {\n\nint Physics::initialize() {\n  broadphase_ = std::unique_ptr<btBroadphaseInterface>(new btDbvtBroadphase());\n  collisionConfiguration_ = std::unique_ptr<btDefaultCollisionConfiguration>(new btDefaultCollisionConfiguration());\n  dispatcher_ = std::unique_ptr<btCollisionDispatcher>(new btCollisionDispatcher(collisionConfiguration_.get()));\n  solver_ = std::unique_ptr<btSequentialImpulseConstraintSolver>(new btSequentialImpulseConstraintSolver);\n\n  dynamicsWorld_ = std::unique_ptr<btDiscreteDynamicsWorld>(new btDiscreteDynamicsWorld(dispatcher_.get(), broadphase_.get(), solver_.get(), collisionConfiguration_.get()));\n\n  auto gravity = world_->getGravity();\n  dynamicsWorld_->setGravity(btVector3(gravity.x, gravity.y, gravity.z));\n\n  debugDrawer_ = std::unique_ptr<DebugDrawer>(new DebugDrawer());\n  debugDrawer_->setDebugMode(btIDebugDraw::DBG_DrawWireframe);\n  dynamicsWorld_->setDebugDrawer(debugDrawer_.get());\n\n  LOG4CXX_INFO(logger_, \"Bullet engine initialized.\");\n\n  return 0;\n}\n\nvoid Physics::initializeWorld() {\n  LOG4CXX_INFO(logger_, \"Initializing physics world.\");\n  for (auto it = world_->begin(); it != world_->end(); it++) {\n    initializeRigidBody(*it);\n  }\n}\n\nvoid Physics::initializeRigidBody(dioptre::physics::RigidBody* body) {\n  auto shape = dynamic_cast<dioptre::physics::bullet::Shape*>(body->getShape());\n  btCollisionShape* boxCollisionShape = shape->getCollisionShape();\n\n  auto component = body->getComponent();\n  auto object = component->getObject();\n  auto transform = object->getTransform();\n  auto position = transform->getPosition();\n  auto orientation = body->getComponent()->getObject()->getTransform()->getOrientation();\n  auto inertia = body->getInertia();\n  auto mass = body->getMass();\n\n  LOG4CXX_INFO(logger_, \"Initializing rigid body.\" << object->getName());\n\n  btDefaultMotionState* motionstate = new btDefaultMotionState(btTransform(\n    btQuaternion(orientation.x, orientation.y, orientation.z, orientation.w),\n    btVector3(position.x, position.y, position.z)\n  ));\n\n  btRigidBody::btRigidBodyConstructionInfo rigidBodyCI(\n      mass, \/\/ mass, in kg. 0 -> Static object, will never move.\n      motionstate,\n      boxCollisionShape, \/\/ collision shape of body\n      btVector3(inertia.x, inertia.y, inertia.z) \/\/ local inertia\n      );\n\n  btRigidBody *rigidBody = new btRigidBody(rigidBodyCI);\n\n  rigidBodies_.push_back(rigidBody);\n  dynamicsWorld_->addRigidBody(rigidBody);\n\n  rigidBody->setUserPointer(object);\n}\n\nvoid ScreenPosToWorldRay(\n    double mouseX, double mouseY,             \/\/ Mouse position, in pixels, from bottom-left corner of the window\n    int screenWidth, int screenHeight,  \/\/ Window size, in pixels\n    glm::mat4 ViewMatrix,               \/\/ Camera position and orientation\n    glm::mat4 ProjectionMatrix,         \/\/ Camera parameters (ratio, field of view, near and far planes)\n    glm::vec3& out_origin,              \/\/ Ouput : Origin of the ray. \/!\\ Starts at the near plane, so if you want the ray to start at the camera's position instead, ignore this.\n    glm::vec3& out_direction            \/\/ Ouput : Direction, in world space, of the ray that goes \"through\" the mouse.\n    ){\n\n  \/\/ The ray Start and End positions, in Normalized Device Coordinates (Have you read Tutorial 4 ?)\n  glm::vec4 lRayStart_NDC(\n      ((float)mouseX\/(float)screenWidth  - 0.5f) * 2.0f, \/\/ [0,1024] -> [-1,1]\n      ((float)mouseY\/(float)screenHeight - 0.5f) * 2.0f, \/\/ [0, 768] -> [-1,1]\n      -1.0, \/\/ The near plane maps to Z=-1 in Normalized Device Coordinates\n      1.0f\n      );\n  glm::vec4 lRayEnd_NDC(\n      ((float)mouseX\/(float)screenWidth  - 0.5f) * 2.0f,\n      ((float)mouseY\/(float)screenHeight - 0.5f) * 2.0f,\n      0.0,\n      1.0f\n      );\n\n  \/\/ Faster way (just one inverse)\n  glm::mat4 M = glm::inverse(ProjectionMatrix * ViewMatrix);\n  glm::vec4 lRayStart_world = M * lRayStart_NDC; lRayStart_world\/=lRayStart_world.w;\n  glm::vec4 lRayEnd_world   = M * lRayEnd_NDC  ; lRayEnd_world  \/=lRayEnd_world.w;\n\n  glm::vec3 lRayDir_world(lRayEnd_world - lRayStart_world);\n  lRayDir_world = glm::normalize(lRayDir_world);\n\n  out_origin = glm::vec3(lRayStart_world);\n  out_direction = glm::normalize(lRayDir_world);\n}\n\nvoid Physics::castRay(dioptre::mouse::Position position) {\n  LOG4CXX_INFO(logger_, \"Casting ray at:\" << position.x << \"x\" << position.y);\n\n  auto graphics = dioptre::Locator::getInstance<dioptre::graphics::GraphicsInterface>(dioptre::Module::M_GRAPHICS);\n  auto debug = graphics->getDebug();\n  auto camera = graphics->getCamera();\n  auto window = dioptre::Locator::getInstance<dioptre::window::WindowInterface>(dioptre::Module::M_WINDOW);\n  auto size = window->getSize();\n\n  auto view = glm::inverse(camera->getTransform()->getMatrix());\n  auto projection = camera->getProjectionMatrix();\n\n  position.y = size.height - position.y;\n  glm::vec3 rayStart;\n  glm::vec3 rayEnd;\n  glm::vec3 rayDirection;\n  ScreenPosToWorldRay(\n      position.x, position.y,\n      size.width, size.height,\n      view,\n      projection,\n      rayStart,\n      rayDirection\n  );\n\n  rayDirection = rayDirection * 1000.0f;\n  rayEnd = rayStart + rayDirection;\n\n  btCollisionWorld::ClosestRayResultCallback rayCallback(btVector3(rayStart.x, rayStart.y, rayStart.z),\n                                                         btVector3(rayEnd.x, rayEnd.y, rayEnd.z));\n\n  dynamicsWorld_->rayTest(btVector3(rayStart.x, rayStart.y, rayStart.z),\n                          btVector3(rayEnd.x, rayEnd.y, rayEnd.z),\n                          rayCallback);\n\n  if (rayCallback.hasHit()) {\n    LOG4CXX_INFO(logger_, \"Ray hit object.\");\n\n    auto hitPoint = rayCallback.m_hitPointWorld;\n    glm::vec3 glmHitPoint = glm::vec3(hitPoint.x(), hitPoint.y(), hitPoint.z());\n    debug->addCross(glmHitPoint);\n\n    dioptre::Object* object = static_cast<dioptre::Object*>(rayCallback.m_collisionObject->getUserPointer());\n    object->handleClick(glmHitPoint);\n  } else {\n    LOG4CXX_INFO(logger_, \"Ray hit background.\");\n  }\n}\n\nvoid Physics::debug() {\n  auto graphics = dioptre::Locator::getInstance<dioptre::graphics::GraphicsInterface>(dioptre::Module::M_GRAPHICS);\n  auto debug = graphics->getDebug();\n\n  if (debug) {\n    debug->reset();\n  }\n\n  dynamicsWorld_->debugDrawWorld();\n}\n\nvoid Physics::simulate() {\n\n}\n\nvoid Physics::destroy() {\n\n}\n\n} \/\/ bullet\n} \/\/ physics\n} \/\/ dioptre\n<commit_msg>remove debug cross when clicked on object<commit_after>#include \"dioptre\/physics\/bullet\/physics.h\"\n#include \"dioptre\/physics\/bullet\/shape.h\"\n#include \"dioptre\/locator.h\"\n\n#include <iostream>\n\nnamespace dioptre {\nnamespace physics {\nnamespace bullet {\n\nint Physics::initialize() {\n  broadphase_ = std::unique_ptr<btBroadphaseInterface>(new btDbvtBroadphase());\n  collisionConfiguration_ = std::unique_ptr<btDefaultCollisionConfiguration>(new btDefaultCollisionConfiguration());\n  dispatcher_ = std::unique_ptr<btCollisionDispatcher>(new btCollisionDispatcher(collisionConfiguration_.get()));\n  solver_ = std::unique_ptr<btSequentialImpulseConstraintSolver>(new btSequentialImpulseConstraintSolver);\n\n  dynamicsWorld_ = std::unique_ptr<btDiscreteDynamicsWorld>(new btDiscreteDynamicsWorld(dispatcher_.get(), broadphase_.get(), solver_.get(), collisionConfiguration_.get()));\n\n  auto gravity = world_->getGravity();\n  dynamicsWorld_->setGravity(btVector3(gravity.x, gravity.y, gravity.z));\n\n  debugDrawer_ = std::unique_ptr<DebugDrawer>(new DebugDrawer());\n  debugDrawer_->setDebugMode(btIDebugDraw::DBG_DrawWireframe);\n  dynamicsWorld_->setDebugDrawer(debugDrawer_.get());\n\n  LOG4CXX_INFO(logger_, \"Bullet engine initialized.\");\n\n  return 0;\n}\n\nvoid Physics::initializeWorld() {\n  LOG4CXX_INFO(logger_, \"Initializing physics world.\");\n  for (auto it = world_->begin(); it != world_->end(); it++) {\n    initializeRigidBody(*it);\n  }\n}\n\nvoid Physics::initializeRigidBody(dioptre::physics::RigidBody* body) {\n  auto shape = dynamic_cast<dioptre::physics::bullet::Shape*>(body->getShape());\n  btCollisionShape* boxCollisionShape = shape->getCollisionShape();\n\n  auto component = body->getComponent();\n  auto object = component->getObject();\n  auto transform = object->getTransform();\n  auto position = transform->getPosition();\n  auto orientation = body->getComponent()->getObject()->getTransform()->getOrientation();\n  auto inertia = body->getInertia();\n  auto mass = body->getMass();\n\n  LOG4CXX_INFO(logger_, \"Initializing rigid body.\" << object->getName());\n\n  btDefaultMotionState* motionstate = new btDefaultMotionState(btTransform(\n    btQuaternion(orientation.x, orientation.y, orientation.z, orientation.w),\n    btVector3(position.x, position.y, position.z)\n  ));\n\n  btRigidBody::btRigidBodyConstructionInfo rigidBodyCI(\n      mass, \/\/ mass, in kg. 0 -> Static object, will never move.\n      motionstate,\n      boxCollisionShape, \/\/ collision shape of body\n      btVector3(inertia.x, inertia.y, inertia.z) \/\/ local inertia\n      );\n\n  btRigidBody *rigidBody = new btRigidBody(rigidBodyCI);\n\n  rigidBodies_.push_back(rigidBody);\n  dynamicsWorld_->addRigidBody(rigidBody);\n\n  rigidBody->setUserPointer(object);\n}\n\nvoid ScreenPosToWorldRay(\n    double mouseX, double mouseY,             \/\/ Mouse position, in pixels, from bottom-left corner of the window\n    int screenWidth, int screenHeight,  \/\/ Window size, in pixels\n    glm::mat4 ViewMatrix,               \/\/ Camera position and orientation\n    glm::mat4 ProjectionMatrix,         \/\/ Camera parameters (ratio, field of view, near and far planes)\n    glm::vec3& out_origin,              \/\/ Ouput : Origin of the ray. \/!\\ Starts at the near plane, so if you want the ray to start at the camera's position instead, ignore this.\n    glm::vec3& out_direction            \/\/ Ouput : Direction, in world space, of the ray that goes \"through\" the mouse.\n    ){\n\n  \/\/ The ray Start and End positions, in Normalized Device Coordinates (Have you read Tutorial 4 ?)\n  glm::vec4 lRayStart_NDC(\n      ((float)mouseX\/(float)screenWidth  - 0.5f) * 2.0f, \/\/ [0,1024] -> [-1,1]\n      ((float)mouseY\/(float)screenHeight - 0.5f) * 2.0f, \/\/ [0, 768] -> [-1,1]\n      -1.0, \/\/ The near plane maps to Z=-1 in Normalized Device Coordinates\n      1.0f\n      );\n  glm::vec4 lRayEnd_NDC(\n      ((float)mouseX\/(float)screenWidth  - 0.5f) * 2.0f,\n      ((float)mouseY\/(float)screenHeight - 0.5f) * 2.0f,\n      0.0,\n      1.0f\n      );\n\n  \/\/ Faster way (just one inverse)\n  glm::mat4 M = glm::inverse(ProjectionMatrix * ViewMatrix);\n  glm::vec4 lRayStart_world = M * lRayStart_NDC; lRayStart_world\/=lRayStart_world.w;\n  glm::vec4 lRayEnd_world   = M * lRayEnd_NDC  ; lRayEnd_world  \/=lRayEnd_world.w;\n\n  glm::vec3 lRayDir_world(lRayEnd_world - lRayStart_world);\n  lRayDir_world = glm::normalize(lRayDir_world);\n\n  out_origin = glm::vec3(lRayStart_world);\n  out_direction = glm::normalize(lRayDir_world);\n}\n\nvoid Physics::castRay(dioptre::mouse::Position position) {\n  LOG4CXX_INFO(logger_, \"Casting ray at:\" << position.x << \"x\" << position.y);\n\n  auto graphics = dioptre::Locator::getInstance<dioptre::graphics::GraphicsInterface>(dioptre::Module::M_GRAPHICS);\n  auto debug = graphics->getDebug();\n  auto camera = graphics->getCamera();\n  auto window = dioptre::Locator::getInstance<dioptre::window::WindowInterface>(dioptre::Module::M_WINDOW);\n  auto size = window->getSize();\n\n  auto view = glm::inverse(camera->getTransform()->getMatrix());\n  auto projection = camera->getProjectionMatrix();\n\n  position.y = size.height - position.y;\n  glm::vec3 rayStart;\n  glm::vec3 rayEnd;\n  glm::vec3 rayDirection;\n  ScreenPosToWorldRay(\n      position.x, position.y,\n      size.width, size.height,\n      view,\n      projection,\n      rayStart,\n      rayDirection\n  );\n\n  rayDirection = rayDirection * 1000.0f;\n  rayEnd = rayStart + rayDirection;\n\n  btCollisionWorld::ClosestRayResultCallback rayCallback(btVector3(rayStart.x, rayStart.y, rayStart.z),\n                                                         btVector3(rayEnd.x, rayEnd.y, rayEnd.z));\n\n  dynamicsWorld_->rayTest(btVector3(rayStart.x, rayStart.y, rayStart.z),\n                          btVector3(rayEnd.x, rayEnd.y, rayEnd.z),\n                          rayCallback);\n\n  if (rayCallback.hasHit()) {\n    LOG4CXX_INFO(logger_, \"Ray hit object.\");\n\n    auto hitPoint = rayCallback.m_hitPointWorld;\n    glm::vec3 glmHitPoint = glm::vec3(hitPoint.x(), hitPoint.y(), hitPoint.z());\n    \/* debug->addCross(glmHitPoint); *\/\n\n    dioptre::Object* object = static_cast<dioptre::Object*>(rayCallback.m_collisionObject->getUserPointer());\n    object->handleClick(glmHitPoint);\n  } else {\n    LOG4CXX_INFO(logger_, \"Ray hit background.\");\n  }\n}\n\nvoid Physics::debug() {\n  auto graphics = dioptre::Locator::getInstance<dioptre::graphics::GraphicsInterface>(dioptre::Module::M_GRAPHICS);\n  auto debug = graphics->getDebug();\n\n  if (debug) {\n    debug->reset();\n  }\n\n  dynamicsWorld_->debugDrawWorld();\n}\n\nvoid Physics::simulate() {\n\n}\n\nvoid Physics::destroy() {\n\n}\n\n} \/\/ bullet\n} \/\/ physics\n} \/\/ dioptre\n<|endoftext|>"}
{"text":"<commit_before>\/* \n *\tlimiter≈\n *\tJamoma AudioGraph external object for Max\n *\tCopyright © 2008 by Timothy Place\n * \n * License: This code is licensed under the terms of the \"New BSD License\"\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"maxAudioGraph.h\"\n\nint TTCLASSWRAPPERMAX_EXPORT main(void)\n{\n\tTTAudioGraphInit();\n\twrapAsMaxAudioGraph(TT(\"clipper\"), \"jcom.clip≈\", NULL);\n\twrapAsMaxAudioGraph(TT(\"clipper\"), \"clip≈\", NULL);\n\treturn 0;\n}\n\n<commit_msg>jcom.clip≈: correcting header info<commit_after>\/* \n *\tclip≈\n *\tJamoma AudioGraph external object for Max\n *\tCopyright © 2012 by Nils Peters\n * \n * License: This code is licensed under the terms of the \"New BSD License\"\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"maxAudioGraph.h\"\n\nint TTCLASSWRAPPERMAX_EXPORT main(void)\n{\n\tTTAudioGraphInit();\n\twrapAsMaxAudioGraph(TT(\"clipper\"), \"jcom.clip≈\", NULL);\n\twrapAsMaxAudioGraph(TT(\"clipper\"), \"clip≈\", NULL);\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Vulkan Model loader using ASSIMP\n*\n* Copyright(C) 2016-2017 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#pragma once\n\n#include <stdlib.h>\n#include <string>\n#include <fstream>\n#include <vector>\n#include <map>\n\n#include \"vulkan\/vulkan.h\"\n\n#include <assimp\/Importer.hpp> \n#include <assimp\/scene.h>     \n#include <assimp\/postprocess.h>\n#include <assimp\/cimport.h>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n\n#include \"VulkanDevice.hpp\"\n#include \"VulkanBuffer.hpp\"\n\n#if defined(__ANDROID__)\n#include <android\/asset_manager.h>\n#endif\n\nnamespace vks\n{\n\t\/** @brief Vertex layout components *\/\n\ttypedef enum Component {\n\t\tVERTEX_COMPONENT_POSITION = 0x0,\n\t\tVERTEX_COMPONENT_NORMAL = 0x1,\n\t\tVERTEX_COMPONENT_COLOR = 0x2,\n\t\tVERTEX_COMPONENT_UV = 0x3,\n\t\tVERTEX_COMPONENT_TANGENT = 0x4,\n\t\tVERTEX_COMPONENT_BITANGENT = 0x5,\n\t\tVERTEX_COMPONENT_DUMMY_FLOAT = 0x6,\n\t\tVERTEX_COMPONENT_DUMMY_VEC4 = 0x7\n\t} Component;\n\n\t\/** @brief Stores vertex layout components for model loading and Vulkan vertex input and atribute bindings  *\/\n\tstruct VertexLayout {\n\tpublic:\n\t\t\/** @brief Components used to generate vertices from *\/\n\t\tstd::vector<Component> components;\n\n\t\tVertexLayout(std::vector<Component> components)\n\t\t{\n\t\t\tthis->components = std::move(components);\n\t\t}\n\n\t\tuint32_t stride()\n\t\t{\n\t\t\tuint32_t res = 0;\n\t\t\tfor (auto& component : components)\n\t\t\t{\n\t\t\t\tswitch (component)\n\t\t\t\t{\n\t\t\t\tcase VERTEX_COMPONENT_UV:\n\t\t\t\t\tres += 2 * sizeof(float);\n\t\t\t\t\tbreak;\n\t\t\t\tcase VERTEX_COMPONENT_DUMMY_FLOAT:\n\t\t\t\t\tres += sizeof(float);\n\t\t\t\t\tbreak;\n\t\t\t\tcase VERTEX_COMPONENT_DUMMY_VEC4:\n\t\t\t\t\tres += 4 * sizeof(float);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\t\/\/ All components except the ones listed above are made up of 3 floats\n\t\t\t\t\tres += 3 * sizeof(float);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t};\n\n\t\/** @brief Used to parametrize model loading *\/\n\tstruct ModelCreateInfo {\n\t\tglm::vec3 center;\n\t\tglm::vec3 scale;\n\t\tglm::vec2 uvscale;\n\n\t\tModelCreateInfo() {};\n\n\t\tModelCreateInfo(glm::vec3 scale, glm::vec3 uvscale, glm::vec3 center)\n\t\t{\n\t\t\tthis->center = center;\n\t\t\tthis->scale = scale;\n\t\t\tthis->uvscale = uvscale;\n\t\t}\n\n\t\tModelCreateInfo(float scale, float uvscale, float center)\n\t\t{\n\t\t\tthis->center = glm::vec3(center);\n\t\t\tthis->scale = glm::vec3(scale);\n\t\t\tthis->uvscale = glm::vec3(uvscale);\n\t\t}\n\n\t};\n\n\tstruct Model {\n\t\tVkDevice device = nullptr;\n\t\tvks::Buffer vertices;\n\t\tvks::Buffer indices;\n\t\tuint32_t indexCount = 0;\n\t\tuint32_t vertexCount = 0;\n\n\t\t\/** @brief Stores vertex and index base and counts for each part of a model *\/\n\t\tstruct ModelPart {\n\t\t\tuint32_t vertexBase;\n\t\t\tuint32_t vertexCount;\n\t\t\tuint32_t indexBase;\n\t\t\tuint32_t indexCount;\n\t\t};\n\t\tstd::vector<ModelPart> parts;\n\n\t\tstatic const int defaultFlags = aiProcess_FlipWindingOrder | aiProcess_Triangulate | aiProcess_PreTransformVertices | aiProcess_CalcTangentSpace | aiProcess_GenSmoothNormals;\n\n\t\tstruct Dimension\n\t\t{\n\t\t\tglm::vec3 min = glm::vec3(FLT_MAX);\n\t\t\tglm::vec3 max = glm::vec3(-FLT_MAX);\n\t\t\tglm::vec3 size;\n\t\t} dim;\n\n\t\t\/** @brief Release all Vulkan resources of this model *\/\n\t\tvoid destroy()\n\t\t{\t\t\n\t\t\tassert(device);\n\t\t\tvkDestroyBuffer(device, vertices.buffer, nullptr);\n\t\t\tvkFreeMemory(device, vertices.memory, nullptr);\n\t\t\tif (indices.buffer != VK_NULL_HANDLE)\n\t\t\t{\n\t\t\t\tvkDestroyBuffer(device, indices.buffer, nullptr);\n\t\t\t\tvkFreeMemory(device, indices.memory, nullptr);\n\t\t\t}\n\t\t}\n\n\t\t\/**\n\t\t* Loads a 3D model from a file into Vulkan buffers\n\t\t*\n\t\t* @param device Pointer to the Vulkan device used to generated the vertex and index buffers on\n\t\t* @param filename File to load (must be a model format supported by ASSIMP)\n\t\t* @param layout Vertex layout components (position, normals, tangents, etc.)\n\t\t* @param createInfo MeshCreateInfo structure for load time settings like scale, center, etc.\n\t\t* @param copyQueue Queue used for the memory staging copy commands (must support transfer)\n\t\t* @param (Optional) flags ASSIMP model loading flags\n\t\t*\/\n\t\tbool loadFromFile(const std::string& filename, vks::VertexLayout layout, vks::ModelCreateInfo *createInfo, vks::VulkanDevice *device, VkQueue copyQueue, const int flags = defaultFlags)\n\t\t{\n\t\t\tthis->device = device->logicalDevice;\n\n\t\t\tAssimp::Importer Importer;\n\t\t\tconst aiScene* pScene;\n\n\t\t\t\/\/ Load file\n#if defined(__ANDROID__)\n\t\t\t\/\/ Meshes are stored inside the apk on Android (compressed)\n\t\t\t\/\/ So they need to be loaded via the asset manager\n\n\t\t\tAAsset* asset = AAssetManager_open(androidApp->activity->assetManager, filename.c_str(), AASSET_MODE_STREAMING);\n\t\t\tassert(asset);\n\t\t\tsize_t size = AAsset_getLength(asset);\n\n\t\t\tassert(size > 0);\n\n\t\t\tvoid *meshData = malloc(size);\n\t\t\tAAsset_read(asset, meshData, size);\n\t\t\tAAsset_close(asset);\n\n\t\t\tpScene = Importer.ReadFileFromMemory(meshData, size, flags);\n\n\t\t\tfree(meshData);\n#else\n\t\t\tpScene = Importer.ReadFile(filename.c_str(), flags);\n#endif\n\n\t\t\tif (pScene)\n\t\t\t{\n\t\t\t\tparts.clear();\n\t\t\t\tparts.resize(pScene->mNumMeshes);\n\n\t\t\t\tglm::vec3 scale(1.0f);\n\t\t\t\tglm::vec2 uvscale(1.0f);\n\t\t\t\tglm::vec3 center(0.0f);\n\t\t\t\tif (createInfo)\n\t\t\t\t{\n\t\t\t\t\tscale = createInfo->scale;\n\t\t\t\t\tuvscale = createInfo->uvscale;\n\t\t\t\t\tcenter = createInfo->center;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<float> vertexBuffer;\n\t\t\t\tstd::vector<uint32_t> indexBuffer;\n\n\t\t\t\tvertexCount = 0;\n\t\t\t\tindexCount = 0;\n\n\t\t\t\t\/\/ Load meshes\n\t\t\t\tfor (unsigned int i = 0; i < pScene->mNumMeshes; i++)\n\t\t\t\t{\n\t\t\t\t\tconst aiMesh* paiMesh = pScene->mMeshes[i];\n\n\t\t\t\t\tparts[i] = {};\n\t\t\t\t\tparts[i].vertexBase = vertexCount;\n\t\t\t\t\tparts[i].indexBase = indexCount;\n\n\t\t\t\t\tvertexCount += pScene->mMeshes[i]->mNumVertices;\n\n\t\t\t\t\taiColor3D pColor(0.f, 0.f, 0.f);\n\t\t\t\t\tpScene->mMaterials[paiMesh->mMaterialIndex]->Get(AI_MATKEY_COLOR_DIFFUSE, pColor);\n\n\t\t\t\t\tconst aiVector3D Zero3D(0.0f, 0.0f, 0.0f);\n\n\t\t\t\t\tfor (unsigned int j = 0; j < paiMesh->mNumVertices; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst aiVector3D* pPos = &(paiMesh->mVertices[j]);\n\t\t\t\t\t\tconst aiVector3D* pNormal = &(paiMesh->mNormals[j]);\n\t\t\t\t\t\tconst aiVector3D* pTexCoord = (paiMesh->HasTextureCoords(0)) ? &(paiMesh->mTextureCoords[0][j]) : &Zero3D;\n\t\t\t\t\t\tconst aiVector3D* pTangent = (paiMesh->HasTangentsAndBitangents()) ? &(paiMesh->mTangents[j]) : &Zero3D;\n\t\t\t\t\t\tconst aiVector3D* pBiTangent = (paiMesh->HasTangentsAndBitangents()) ? &(paiMesh->mBitangents[j]) : &Zero3D;\n\n\t\t\t\t\t\tfor (auto& component : layout.components)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tswitch (component) {\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_POSITION:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pPos->x * scale.x + center.x);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(-pPos->y * scale.y + center.y);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pPos->z * scale.z + center.z);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_NORMAL:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pNormal->x);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(-pNormal->y);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pNormal->z);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_UV:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTexCoord->x * uvscale.s);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTexCoord->y * uvscale.t);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_COLOR:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pColor.r);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pColor.g);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pColor.b);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_TANGENT:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTangent->x);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTangent->y);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTangent->z);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_BITANGENT:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pBiTangent->x);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pBiTangent->y);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pBiTangent->z);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\/\/ Dummy components for padding\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_DUMMY_FLOAT:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_DUMMY_VEC4:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t};\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tdim.max.x = fmax(pPos->x, dim.max.x);\n\t\t\t\t\t\tdim.max.y = fmax(pPos->y, dim.max.y);\n\t\t\t\t\t\tdim.max.z = fmax(pPos->z, dim.max.z);\n\n\t\t\t\t\t\tdim.min.x = fmin(pPos->x, dim.min.x);\n\t\t\t\t\t\tdim.min.y = fmin(pPos->y, dim.min.y);\n\t\t\t\t\t\tdim.min.z = fmin(pPos->z, dim.min.z);\n\t\t\t\t\t}\n\n\t\t\t\t\tdim.size = dim.max - dim.min;\n\n\t\t\t\t\tparts[i].vertexCount = paiMesh->mNumVertices;\n\n\t\t\t\t\tuint32_t indexBase = static_cast<uint32_t>(indexBuffer.size());\n\t\t\t\t\tfor (unsigned int j = 0; j < paiMesh->mNumFaces; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst aiFace& Face = paiMesh->mFaces[j];\n\t\t\t\t\t\tif (Face.mNumIndices != 3)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tindexBuffer.push_back(indexBase + Face.mIndices[0]);\n\t\t\t\t\t\tindexBuffer.push_back(indexBase + Face.mIndices[1]);\n\t\t\t\t\t\tindexBuffer.push_back(indexBase + Face.mIndices[2]);\n\t\t\t\t\t\tparts[i].indexCount += 3;\n\t\t\t\t\t\tindexCount += 3;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\n\t\t\t\tuint32_t vBufferSize = static_cast<uint32_t>(vertexBuffer.size()) * sizeof(float);\n\t\t\t\tuint32_t iBufferSize = static_cast<uint32_t>(indexBuffer.size()) * sizeof(uint32_t);\n\n\t\t\t\t\/\/ Use staging buffer to move vertex and index buffer to device local memory\n\t\t\t\t\/\/ Create staging buffers\n\t\t\t\tvks::Buffer vertexStaging, indexStaging;\n\n\t\t\t\t\/\/ Vertex buffer\n\t\t\t\tVK_CHECK_RESULT(device->createBuffer(\n\t\t\t\t\tVK_BUFFER_USAGE_TRANSFER_SRC_BIT,\n\t\t\t\t\tVK_MEMORY_PROPERTY_HOST_VISIBLE_BIT,\n\t\t\t\t\t&vertexStaging,\n\t\t\t\t\tvBufferSize,\n\t\t\t\t\tvertexBuffer.data()));\n\n\t\t\t\t\/\/ Index buffer\n\t\t\t\tVK_CHECK_RESULT(device->createBuffer(\n\t\t\t\t\tVK_BUFFER_USAGE_TRANSFER_SRC_BIT,\n\t\t\t\t\tVK_MEMORY_PROPERTY_HOST_VISIBLE_BIT,\n\t\t\t\t\t&indexStaging,\n\t\t\t\t\tiBufferSize,\n\t\t\t\t\tindexBuffer.data()));\n\n\t\t\t\t\/\/ Create device local target buffers\n\t\t\t\t\/\/ Vertex buffer\n\t\t\t\tVK_CHECK_RESULT(device->createBuffer(\n\t\t\t\t\tVK_BUFFER_USAGE_VERTEX_BUFFER_BIT | VK_BUFFER_USAGE_TRANSFER_DST_BIT,\n\t\t\t\t\tVK_MEMORY_PROPERTY_DEVICE_LOCAL_BIT,\n\t\t\t\t\t&vertices,\n\t\t\t\t\tvBufferSize));\n\n\t\t\t\t\/\/ Index buffer\n\t\t\t\tVK_CHECK_RESULT(device->createBuffer(\n\t\t\t\t\tVK_BUFFER_USAGE_INDEX_BUFFER_BIT | VK_BUFFER_USAGE_TRANSFER_DST_BIT,\n\t\t\t\t\tVK_MEMORY_PROPERTY_DEVICE_LOCAL_BIT,\n\t\t\t\t\t&indices,\n\t\t\t\t\tiBufferSize));\n\n\t\t\t\t\/\/ Copy from staging buffers\n\t\t\t\tVkCommandBuffer copyCmd = device->createCommandBuffer(VK_COMMAND_BUFFER_LEVEL_PRIMARY, true);\n\n\t\t\t\tVkBufferCopy copyRegion{};\n\n\t\t\t\tcopyRegion.size = vertices.size;\n\t\t\t\tvkCmdCopyBuffer(copyCmd, vertexStaging.buffer, vertices.buffer, 1, &copyRegion);\n\n\t\t\t\tcopyRegion.size = indices.size;\n\t\t\t\tvkCmdCopyBuffer(copyCmd, indexStaging.buffer, indices.buffer, 1, &copyRegion);\n\n\t\t\t\tdevice->flushCommandBuffer(copyCmd, copyQueue);\n\n\t\t\t\t\/\/ Destroy staging resources\n\t\t\t\tvkDestroyBuffer(device->logicalDevice, vertexStaging.buffer, nullptr);\n\t\t\t\tvkFreeMemory(device->logicalDevice, vertexStaging.memory, nullptr);\n\t\t\t\tvkDestroyBuffer(device->logicalDevice, indexStaging.buffer, nullptr);\n\t\t\t\tvkFreeMemory(device->logicalDevice, indexStaging.memory, nullptr);\n\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprintf(\"Error parsing '%s': '%s'\\n\", filename.c_str(), Importer.GetErrorString());\n#if defined(__ANDROID__)\n\t\t\t\tLOGE(\"Error parsing '%s': '%s'\", filename.c_str(), Importer.GetErrorString());\n#endif\n\t\t\t\treturn false;\n\t\t\t}\n\t\t};\n\n\t\t\/**\n\t\t* Loads a 3D model from a file into Vulkan buffers\n\t\t*\n\t\t* @param device Pointer to the Vulkan device used to generated the vertex and index buffers on\n\t\t* @param filename File to load (must be a model format supported by ASSIMP)\n\t\t* @param layout Vertex layout components (position, normals, tangents, etc.)\n\t\t* @param scale Load time scene scale\n\t\t* @param copyQueue Queue used for the memory staging copy commands (must support transfer)\n\t\t* @param (Optional) flags ASSIMP model loading flags\n\t\t*\/\n\t\tbool loadFromFile(const std::string& filename, vks::VertexLayout layout, float scale, vks::VulkanDevice *device, VkQueue copyQueue, const int flags = defaultFlags)\n\t\t{\n\t\t\tvks::ModelCreateInfo modelCreateInfo(scale, 1.0f, 0.0f);\n\t\t\treturn loadFromFile(filename, layout, &modelCreateInfo, device, copyQueue, flags);\n\t\t}\n\t};\n};<commit_msg>uvscale argument as vec2 (Fixes #282)<commit_after>\/*\n* Vulkan Model loader using ASSIMP\n*\n* Copyright(C) 2016-2017 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#pragma once\n\n#include <stdlib.h>\n#include <string>\n#include <fstream>\n#include <vector>\n#include <map>\n\n#include \"vulkan\/vulkan.h\"\n\n#include <assimp\/Importer.hpp> \n#include <assimp\/scene.h>     \n#include <assimp\/postprocess.h>\n#include <assimp\/cimport.h>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n\n#include \"VulkanDevice.hpp\"\n#include \"VulkanBuffer.hpp\"\n\n#if defined(__ANDROID__)\n#include <android\/asset_manager.h>\n#endif\n\nnamespace vks\n{\n\t\/** @brief Vertex layout components *\/\n\ttypedef enum Component {\n\t\tVERTEX_COMPONENT_POSITION = 0x0,\n\t\tVERTEX_COMPONENT_NORMAL = 0x1,\n\t\tVERTEX_COMPONENT_COLOR = 0x2,\n\t\tVERTEX_COMPONENT_UV = 0x3,\n\t\tVERTEX_COMPONENT_TANGENT = 0x4,\n\t\tVERTEX_COMPONENT_BITANGENT = 0x5,\n\t\tVERTEX_COMPONENT_DUMMY_FLOAT = 0x6,\n\t\tVERTEX_COMPONENT_DUMMY_VEC4 = 0x7\n\t} Component;\n\n\t\/** @brief Stores vertex layout components for model loading and Vulkan vertex input and atribute bindings  *\/\n\tstruct VertexLayout {\n\tpublic:\n\t\t\/** @brief Components used to generate vertices from *\/\n\t\tstd::vector<Component> components;\n\n\t\tVertexLayout(std::vector<Component> components)\n\t\t{\n\t\t\tthis->components = std::move(components);\n\t\t}\n\n\t\tuint32_t stride()\n\t\t{\n\t\t\tuint32_t res = 0;\n\t\t\tfor (auto& component : components)\n\t\t\t{\n\t\t\t\tswitch (component)\n\t\t\t\t{\n\t\t\t\tcase VERTEX_COMPONENT_UV:\n\t\t\t\t\tres += 2 * sizeof(float);\n\t\t\t\t\tbreak;\n\t\t\t\tcase VERTEX_COMPONENT_DUMMY_FLOAT:\n\t\t\t\t\tres += sizeof(float);\n\t\t\t\t\tbreak;\n\t\t\t\tcase VERTEX_COMPONENT_DUMMY_VEC4:\n\t\t\t\t\tres += 4 * sizeof(float);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\t\/\/ All components except the ones listed above are made up of 3 floats\n\t\t\t\t\tres += 3 * sizeof(float);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t};\n\n\t\/** @brief Used to parametrize model loading *\/\n\tstruct ModelCreateInfo {\n\t\tglm::vec3 center;\n\t\tglm::vec3 scale;\n\t\tglm::vec2 uvscale;\n\n\t\tModelCreateInfo() {};\n\n\t\tModelCreateInfo(glm::vec3 scale, glm::vec2 uvscale, glm::vec3 center)\n\t\t{\n\t\t\tthis->center = center;\n\t\t\tthis->scale = scale;\n\t\t\tthis->uvscale = uvscale;\n\t\t}\n\n\t\tModelCreateInfo(float scale, float uvscale, float center)\n\t\t{\n\t\t\tthis->center = glm::vec3(center);\n\t\t\tthis->scale = glm::vec3(scale);\n\t\t\tthis->uvscale = glm::vec3(uvscale);\n\t\t}\n\n\t};\n\n\tstruct Model {\n\t\tVkDevice device = nullptr;\n\t\tvks::Buffer vertices;\n\t\tvks::Buffer indices;\n\t\tuint32_t indexCount = 0;\n\t\tuint32_t vertexCount = 0;\n\n\t\t\/** @brief Stores vertex and index base and counts for each part of a model *\/\n\t\tstruct ModelPart {\n\t\t\tuint32_t vertexBase;\n\t\t\tuint32_t vertexCount;\n\t\t\tuint32_t indexBase;\n\t\t\tuint32_t indexCount;\n\t\t};\n\t\tstd::vector<ModelPart> parts;\n\n\t\tstatic const int defaultFlags = aiProcess_FlipWindingOrder | aiProcess_Triangulate | aiProcess_PreTransformVertices | aiProcess_CalcTangentSpace | aiProcess_GenSmoothNormals;\n\n\t\tstruct Dimension\n\t\t{\n\t\t\tglm::vec3 min = glm::vec3(FLT_MAX);\n\t\t\tglm::vec3 max = glm::vec3(-FLT_MAX);\n\t\t\tglm::vec3 size;\n\t\t} dim;\n\n\t\t\/** @brief Release all Vulkan resources of this model *\/\n\t\tvoid destroy()\n\t\t{\t\t\n\t\t\tassert(device);\n\t\t\tvkDestroyBuffer(device, vertices.buffer, nullptr);\n\t\t\tvkFreeMemory(device, vertices.memory, nullptr);\n\t\t\tif (indices.buffer != VK_NULL_HANDLE)\n\t\t\t{\n\t\t\t\tvkDestroyBuffer(device, indices.buffer, nullptr);\n\t\t\t\tvkFreeMemory(device, indices.memory, nullptr);\n\t\t\t}\n\t\t}\n\n\t\t\/**\n\t\t* Loads a 3D model from a file into Vulkan buffers\n\t\t*\n\t\t* @param device Pointer to the Vulkan device used to generated the vertex and index buffers on\n\t\t* @param filename File to load (must be a model format supported by ASSIMP)\n\t\t* @param layout Vertex layout components (position, normals, tangents, etc.)\n\t\t* @param createInfo MeshCreateInfo structure for load time settings like scale, center, etc.\n\t\t* @param copyQueue Queue used for the memory staging copy commands (must support transfer)\n\t\t* @param (Optional) flags ASSIMP model loading flags\n\t\t*\/\n\t\tbool loadFromFile(const std::string& filename, vks::VertexLayout layout, vks::ModelCreateInfo *createInfo, vks::VulkanDevice *device, VkQueue copyQueue, const int flags = defaultFlags)\n\t\t{\n\t\t\tthis->device = device->logicalDevice;\n\n\t\t\tAssimp::Importer Importer;\n\t\t\tconst aiScene* pScene;\n\n\t\t\t\/\/ Load file\n#if defined(__ANDROID__)\n\t\t\t\/\/ Meshes are stored inside the apk on Android (compressed)\n\t\t\t\/\/ So they need to be loaded via the asset manager\n\n\t\t\tAAsset* asset = AAssetManager_open(androidApp->activity->assetManager, filename.c_str(), AASSET_MODE_STREAMING);\n\t\t\tassert(asset);\n\t\t\tsize_t size = AAsset_getLength(asset);\n\n\t\t\tassert(size > 0);\n\n\t\t\tvoid *meshData = malloc(size);\n\t\t\tAAsset_read(asset, meshData, size);\n\t\t\tAAsset_close(asset);\n\n\t\t\tpScene = Importer.ReadFileFromMemory(meshData, size, flags);\n\n\t\t\tfree(meshData);\n#else\n\t\t\tpScene = Importer.ReadFile(filename.c_str(), flags);\n#endif\n\n\t\t\tif (pScene)\n\t\t\t{\n\t\t\t\tparts.clear();\n\t\t\t\tparts.resize(pScene->mNumMeshes);\n\n\t\t\t\tglm::vec3 scale(1.0f);\n\t\t\t\tglm::vec2 uvscale(1.0f);\n\t\t\t\tglm::vec3 center(0.0f);\n\t\t\t\tif (createInfo)\n\t\t\t\t{\n\t\t\t\t\tscale = createInfo->scale;\n\t\t\t\t\tuvscale = createInfo->uvscale;\n\t\t\t\t\tcenter = createInfo->center;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<float> vertexBuffer;\n\t\t\t\tstd::vector<uint32_t> indexBuffer;\n\n\t\t\t\tvertexCount = 0;\n\t\t\t\tindexCount = 0;\n\n\t\t\t\t\/\/ Load meshes\n\t\t\t\tfor (unsigned int i = 0; i < pScene->mNumMeshes; i++)\n\t\t\t\t{\n\t\t\t\t\tconst aiMesh* paiMesh = pScene->mMeshes[i];\n\n\t\t\t\t\tparts[i] = {};\n\t\t\t\t\tparts[i].vertexBase = vertexCount;\n\t\t\t\t\tparts[i].indexBase = indexCount;\n\n\t\t\t\t\tvertexCount += pScene->mMeshes[i]->mNumVertices;\n\n\t\t\t\t\taiColor3D pColor(0.f, 0.f, 0.f);\n\t\t\t\t\tpScene->mMaterials[paiMesh->mMaterialIndex]->Get(AI_MATKEY_COLOR_DIFFUSE, pColor);\n\n\t\t\t\t\tconst aiVector3D Zero3D(0.0f, 0.0f, 0.0f);\n\n\t\t\t\t\tfor (unsigned int j = 0; j < paiMesh->mNumVertices; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst aiVector3D* pPos = &(paiMesh->mVertices[j]);\n\t\t\t\t\t\tconst aiVector3D* pNormal = &(paiMesh->mNormals[j]);\n\t\t\t\t\t\tconst aiVector3D* pTexCoord = (paiMesh->HasTextureCoords(0)) ? &(paiMesh->mTextureCoords[0][j]) : &Zero3D;\n\t\t\t\t\t\tconst aiVector3D* pTangent = (paiMesh->HasTangentsAndBitangents()) ? &(paiMesh->mTangents[j]) : &Zero3D;\n\t\t\t\t\t\tconst aiVector3D* pBiTangent = (paiMesh->HasTangentsAndBitangents()) ? &(paiMesh->mBitangents[j]) : &Zero3D;\n\n\t\t\t\t\t\tfor (auto& component : layout.components)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tswitch (component) {\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_POSITION:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pPos->x * scale.x + center.x);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(-pPos->y * scale.y + center.y);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pPos->z * scale.z + center.z);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_NORMAL:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pNormal->x);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(-pNormal->y);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pNormal->z);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_UV:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTexCoord->x * uvscale.s);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTexCoord->y * uvscale.t);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_COLOR:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pColor.r);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pColor.g);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pColor.b);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_TANGENT:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTangent->x);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTangent->y);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pTangent->z);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_BITANGENT:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pBiTangent->x);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pBiTangent->y);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(pBiTangent->z);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\/\/ Dummy components for padding\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_DUMMY_FLOAT:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase VERTEX_COMPONENT_DUMMY_VEC4:\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tvertexBuffer.push_back(0.0f);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t};\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tdim.max.x = fmax(pPos->x, dim.max.x);\n\t\t\t\t\t\tdim.max.y = fmax(pPos->y, dim.max.y);\n\t\t\t\t\t\tdim.max.z = fmax(pPos->z, dim.max.z);\n\n\t\t\t\t\t\tdim.min.x = fmin(pPos->x, dim.min.x);\n\t\t\t\t\t\tdim.min.y = fmin(pPos->y, dim.min.y);\n\t\t\t\t\t\tdim.min.z = fmin(pPos->z, dim.min.z);\n\t\t\t\t\t}\n\n\t\t\t\t\tdim.size = dim.max - dim.min;\n\n\t\t\t\t\tparts[i].vertexCount = paiMesh->mNumVertices;\n\n\t\t\t\t\tuint32_t indexBase = static_cast<uint32_t>(indexBuffer.size());\n\t\t\t\t\tfor (unsigned int j = 0; j < paiMesh->mNumFaces; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst aiFace& Face = paiMesh->mFaces[j];\n\t\t\t\t\t\tif (Face.mNumIndices != 3)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tindexBuffer.push_back(indexBase + Face.mIndices[0]);\n\t\t\t\t\t\tindexBuffer.push_back(indexBase + Face.mIndices[1]);\n\t\t\t\t\t\tindexBuffer.push_back(indexBase + Face.mIndices[2]);\n\t\t\t\t\t\tparts[i].indexCount += 3;\n\t\t\t\t\t\tindexCount += 3;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\n\t\t\t\tuint32_t vBufferSize = static_cast<uint32_t>(vertexBuffer.size()) * sizeof(float);\n\t\t\t\tuint32_t iBufferSize = static_cast<uint32_t>(indexBuffer.size()) * sizeof(uint32_t);\n\n\t\t\t\t\/\/ Use staging buffer to move vertex and index buffer to device local memory\n\t\t\t\t\/\/ Create staging buffers\n\t\t\t\tvks::Buffer vertexStaging, indexStaging;\n\n\t\t\t\t\/\/ Vertex buffer\n\t\t\t\tVK_CHECK_RESULT(device->createBuffer(\n\t\t\t\t\tVK_BUFFER_USAGE_TRANSFER_SRC_BIT,\n\t\t\t\t\tVK_MEMORY_PROPERTY_HOST_VISIBLE_BIT,\n\t\t\t\t\t&vertexStaging,\n\t\t\t\t\tvBufferSize,\n\t\t\t\t\tvertexBuffer.data()));\n\n\t\t\t\t\/\/ Index buffer\n\t\t\t\tVK_CHECK_RESULT(device->createBuffer(\n\t\t\t\t\tVK_BUFFER_USAGE_TRANSFER_SRC_BIT,\n\t\t\t\t\tVK_MEMORY_PROPERTY_HOST_VISIBLE_BIT,\n\t\t\t\t\t&indexStaging,\n\t\t\t\t\tiBufferSize,\n\t\t\t\t\tindexBuffer.data()));\n\n\t\t\t\t\/\/ Create device local target buffers\n\t\t\t\t\/\/ Vertex buffer\n\t\t\t\tVK_CHECK_RESULT(device->createBuffer(\n\t\t\t\t\tVK_BUFFER_USAGE_VERTEX_BUFFER_BIT | VK_BUFFER_USAGE_TRANSFER_DST_BIT,\n\t\t\t\t\tVK_MEMORY_PROPERTY_DEVICE_LOCAL_BIT,\n\t\t\t\t\t&vertices,\n\t\t\t\t\tvBufferSize));\n\n\t\t\t\t\/\/ Index buffer\n\t\t\t\tVK_CHECK_RESULT(device->createBuffer(\n\t\t\t\t\tVK_BUFFER_USAGE_INDEX_BUFFER_BIT | VK_BUFFER_USAGE_TRANSFER_DST_BIT,\n\t\t\t\t\tVK_MEMORY_PROPERTY_DEVICE_LOCAL_BIT,\n\t\t\t\t\t&indices,\n\t\t\t\t\tiBufferSize));\n\n\t\t\t\t\/\/ Copy from staging buffers\n\t\t\t\tVkCommandBuffer copyCmd = device->createCommandBuffer(VK_COMMAND_BUFFER_LEVEL_PRIMARY, true);\n\n\t\t\t\tVkBufferCopy copyRegion{};\n\n\t\t\t\tcopyRegion.size = vertices.size;\n\t\t\t\tvkCmdCopyBuffer(copyCmd, vertexStaging.buffer, vertices.buffer, 1, &copyRegion);\n\n\t\t\t\tcopyRegion.size = indices.size;\n\t\t\t\tvkCmdCopyBuffer(copyCmd, indexStaging.buffer, indices.buffer, 1, &copyRegion);\n\n\t\t\t\tdevice->flushCommandBuffer(copyCmd, copyQueue);\n\n\t\t\t\t\/\/ Destroy staging resources\n\t\t\t\tvkDestroyBuffer(device->logicalDevice, vertexStaging.buffer, nullptr);\n\t\t\t\tvkFreeMemory(device->logicalDevice, vertexStaging.memory, nullptr);\n\t\t\t\tvkDestroyBuffer(device->logicalDevice, indexStaging.buffer, nullptr);\n\t\t\t\tvkFreeMemory(device->logicalDevice, indexStaging.memory, nullptr);\n\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprintf(\"Error parsing '%s': '%s'\\n\", filename.c_str(), Importer.GetErrorString());\n#if defined(__ANDROID__)\n\t\t\t\tLOGE(\"Error parsing '%s': '%s'\", filename.c_str(), Importer.GetErrorString());\n#endif\n\t\t\t\treturn false;\n\t\t\t}\n\t\t};\n\n\t\t\/**\n\t\t* Loads a 3D model from a file into Vulkan buffers\n\t\t*\n\t\t* @param device Pointer to the Vulkan device used to generated the vertex and index buffers on\n\t\t* @param filename File to load (must be a model format supported by ASSIMP)\n\t\t* @param layout Vertex layout components (position, normals, tangents, etc.)\n\t\t* @param scale Load time scene scale\n\t\t* @param copyQueue Queue used for the memory staging copy commands (must support transfer)\n\t\t* @param (Optional) flags ASSIMP model loading flags\n\t\t*\/\n\t\tbool loadFromFile(const std::string& filename, vks::VertexLayout layout, float scale, vks::VulkanDevice *device, VkQueue copyQueue, const int flags = defaultFlags)\n\t\t{\n\t\t\tvks::ModelCreateInfo modelCreateInfo(scale, 1.0f, 0.0f);\n\t\t\treturn loadFromFile(filename, layout, &modelCreateInfo, device, copyQueue, flags);\n\t\t}\n\t};\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 discrete_distribution.hpp\n * \\date 05\/25\/2014\n * \\author Manuel Wuthrich (manuel.wuthrich@gmail.com)\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__DISTRIBUTION__DISCRETE_DISTRIBUTION_HPP\n#define FL__DISTRIBUTION__DISCRETE_DISTRIBUTION_HPP\n\n#include <Eigen\/Core>\n\n\/\/ std\n#include <vector>\n\n#include <fl\/util\/types.hpp>\n#include <fl\/util\/traits.hpp>\n#include <fl\/util\/assertions.hpp>\n#include <fl\/distribution\/interface\/moments.hpp>\n#include <fl\/distribution\/interface\/standard_gaussian_mapping.hpp>\n\nnamespace fl\n{\n\ntemplate <typename Variate, int Locations = Eigen::Dynamic>\nclass DiscreteDistribution\n    : public Moments<typename FirstMomentOf<Variate>::Type>,\n      public StandardGaussianMapping<Variate, 1>\n{\npublic:\n    typedef DiscreteDistribution<Variate, Locations> This;\n    typedef Moments<typename FirstMomentOf<Variate>::Type> MomentsInterface;\n    typedef StandardGaussianMapping<Variate,1> StandardGaussianMappingInterface;\n\n    typedef typename MomentsInterface::Variate      Mean;\n    typedef typename MomentsInterface::SecondMoment Covariance;\n    typedef Eigen::Array<Real,    Locations, 1> Function;\n    typedef Eigen::Array<Variate, Locations, 1> LocationArray;\n    typedef Eigen::Array<Real,    Locations, 1> CommulativeDistribution;\n\npublic:\n    \/\/\/ constructor and destructor *********************************************\n    explicit\n    DiscreteDistribution(int dim = DimensionOf<Variate>(),\n                         int locations = MaxOf<Locations, 1>::value)\n        : locations_(locations),\n          log_prob_mass_(Function::Zero(locations)),\n          cumul_distr_(CommulativeDistribution(locations))\n    {\n        locations_(0) = Variate::Zero(dim);\n    }\n\n    virtual ~DiscreteDistribution() { }\n\n    \/\/\/ non-const functions ****************************************************\n\n    \/\/ set ---------------------------------------------------------------------\n    virtual void log_unnormalized_prob_mass(const Function& log_prob_mass)\n    {\n        \/\/ rescale for numeric stability\n        log_prob_mass_ = log_prob_mass - log_prob_mass.maxCoeff();\n\n        \/\/ copy to prob mass\n        prob_mass_ = log_prob_mass_.exp();\n        Real sum = prob_mass_.sum();\n\n        \/\/ normalize\n        prob_mass_ \/= sum;\n        log_prob_mass_ -= std::log(sum);\n\n        \/\/ compute cdf\n        cumul_distr_.resize(log_prob_mass_.size());\n\n        cumul_distr_[0] = prob_mass_[0];\n        for(int i = 1; i < cumul_distr_.size(); i++)\n        {\n            cumul_distr_[i] = cumul_distr_[i-1] + prob_mass_[i];\n        }\n\n        \/\/ resize locations\n        locations_.resize(log_prob_mass_.size());\n    }\n\n    virtual void delta_log_prob_mass(const Function& delta)\n    {\n        log_unnormalized_prob_mass(log_prob_mass_ + delta);\n    }\n\n\n    virtual void set_uniform(int new_size = size())\n    {\n        log_unnormalized_prob_mass(Function::Zero(new_size));\n    }\n\n    virtual Variate& location(int i)\n    {\n        return locations_[i];\n    }\n\n    template <typename Distribution>\n    void from_distribution(const Distribution& distribution, const int& new_size)\n    {\n        \/\/ we first create a local array to sample to. this way, if this\n        \/\/ is passed as an argument the locations and pmf are not overwritten\n        \/\/ while sampling\n        LocationArray new_locations(new_size);\n\n        for(int i = 0; i < new_size; i++)\n        {\n            new_locations[i] = distribution.sample();\n        }\n\n        set_uniform(new_size);\n        locations_ = new_locations;\n    }\n\n\n\n    \/\/\/ const functions ********************************************************\n\n    \/\/ sampling ----------------------------------------------------------------\n    virtual Variate map_standard_normal(const Real& gaussian_sample) const\n    {\n        Real uniform_sample =\n                0.5 * (1.0 + std::erf(gaussian_sample \/ std::sqrt(2.0)));\n\n        return map_standard_uniform(uniform_sample);\n    }\n\n    virtual Variate map_standard_uniform(const Real& uniform_sample) const\n    {\n        int i = 0;\n        for (i = 0; i < cumul_distr_.size(); ++i)\n        {\n            if (cumul_distr_[i] >= uniform_sample) break;\n        }\n\n        return locations_[i];\n    }\n\n\n    \/\/ get ---------------------------------------------------------------------\n    virtual const Variate& location(int i) const\n    {\n        return locations_[i];\n    }\n\n    virtual const LocationArray& locations() const\n    {\n        return locations_;\n    }\n\n    virtual Real log_prob_mass(const int& i) const\n    {\n        return log_prob_mass_(i);\n    }\n\n    virtual Function log_prob_mass() const\n    {\n        return log_prob_mass_;\n    }\n\n    virtual Real prob_mass(const int& i) const\n    {\n        return prob_mass_(i);\n    }\n\n    virtual Function prob_mass() const\n    {\n        return prob_mass_;\n    }\n\n    virtual int size() const\n    {\n        return locations_.size();\n    }\n\n    virtual int dimension() const\n    {\n        return locations_[0].rows();\n    }\n\n\n    \/\/ compute properties ------------------------------------------------------\n    virtual const Mean& mean() const\n    {\n        mu_ = Mean::Zero(dimension());\n\n        for(int i = 0; i < locations_.size(); i++)\n        {\n            mu_ += prob_mass(i) * locations_[i].template cast<Real>();\n        }\n\n        return mu_;\n    }\n\n    virtual const Covariance& covariance() const\n    {\n        Mean mu = mean();\n        cov_ = Covariance::Zero(dimension(), dimension());\n        for(int i = 0; i < locations_.size(); i++)\n        {\n            Mean delta = (locations_[i].template cast<Real>()-mu);\n            cov_ += prob_mass(i) * delta * delta.transpose();\n        }\n\n        return cov_;\n    }\n\n    virtual Real entropy() const\n    {\n        return - log_prob_mass_.cwiseProduct(prob_mass_).sum();\n    }\n\n    \/\/ implements KL(p||u) where p is this distr, and u is the uniform distr\n    virtual Real kl_given_uniform() const\n    {\n        return std::log(Real(size())) - entropy();\n    }\n\n\nprotected:\n    \/\/\/ member variables *******************************************************\n    LocationArray locations_;\n\n    Function log_prob_mass_;\n    Function prob_mass_;\n    CommulativeDistribution cumul_distr_;\n\n    mutable Mean mu_;\n    mutable Covariance cov_;\n};\n\n}\n\n#endif\n<commit_msg>added cumul_distr_ initialization<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 discrete_distribution.hpp\n * \\date 05\/25\/2014\n * \\author Manuel Wuthrich (manuel.wuthrich@gmail.com)\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__DISTRIBUTION__DISCRETE_DISTRIBUTION_HPP\n#define FL__DISTRIBUTION__DISCRETE_DISTRIBUTION_HPP\n\n#include <Eigen\/Core>\n\n\/\/ std\n#include <vector>\n\n#include <fl\/util\/types.hpp>\n#include <fl\/util\/traits.hpp>\n#include <fl\/util\/assertions.hpp>\n#include <fl\/distribution\/interface\/moments.hpp>\n#include <fl\/distribution\/interface\/standard_gaussian_mapping.hpp>\n\nnamespace fl\n{\n\ntemplate <typename Variate, int Locations = Eigen::Dynamic>\nclass DiscreteDistribution\n    : public Moments<typename FirstMomentOf<Variate>::Type>,\n      public StandardGaussianMapping<Variate, 1>\n{\npublic:\n    typedef DiscreteDistribution<Variate, Locations> This;\n    typedef Moments<typename FirstMomentOf<Variate>::Type> MomentsInterface;\n    typedef StandardGaussianMapping<Variate,1> StandardGaussianMappingInterface;\n\n    typedef typename MomentsInterface::Variate      Mean;\n    typedef typename MomentsInterface::SecondMoment Covariance;\n    typedef Eigen::Array<Real,    Locations, 1> Function;\n    typedef Eigen::Array<Variate, Locations, 1> LocationArray;\n    typedef Eigen::Array<Real,    Locations, 1> CommulativeDistribution;\n\npublic:\n    \/\/\/ constructor and destructor *********************************************\n    explicit\n    DiscreteDistribution(int dim = DimensionOf<Variate>(),\n                         int locations = MaxOf<Locations, 1>::value)\n        : locations_(locations),\n          log_prob_mass_(Function::Zero(locations)),\n          cumul_distr_(CommulativeDistribution(locations))\n    {\n        locations_(0) = Variate::Zero(dim);\n\n        cumul_distr_.setOnes();\n        cumul_distr_ \/= Real(cumul_distr_.size());\n    }\n\n    virtual ~DiscreteDistribution() { }\n\n    \/\/\/ non-const functions ****************************************************\n\n    \/\/ set ---------------------------------------------------------------------\n    virtual void log_unnormalized_prob_mass(const Function& log_prob_mass)\n    {\n        \/\/ rescale for numeric stability\n        log_prob_mass_ = log_prob_mass - log_prob_mass.maxCoeff();\n\n        \/\/ copy to prob mass\n        prob_mass_ = log_prob_mass_.exp();\n        Real sum = prob_mass_.sum();\n\n        \/\/ normalize\n        prob_mass_ \/= sum;\n        log_prob_mass_ -= std::log(sum);\n\n        \/\/ compute cdf\n        cumul_distr_.resize(log_prob_mass_.size());\n\n        cumul_distr_[0] = prob_mass_[0];\n        for(int i = 1; i < cumul_distr_.size(); i++)\n        {\n            cumul_distr_[i] = cumul_distr_[i-1] + prob_mass_[i];\n        }\n\n        \/\/ resize locations\n        locations_.resize(log_prob_mass_.size());\n    }\n\n    virtual void delta_log_prob_mass(const Function& delta)\n    {\n        log_unnormalized_prob_mass(log_prob_mass_ + delta);\n    }\n\n    virtual void set_uniform(int new_size = size())\n    {\n        log_unnormalized_prob_mass(Function::Zero(new_size));\n    }\n\n    virtual Variate& location(int i)\n    {\n        return locations_[i];\n    }\n\n    template <typename Distribution>\n    void from_distribution(const Distribution& distribution, const int& new_size)\n    {\n        \/\/ we first create a local array to sample to. this way, if this\n        \/\/ is passed as an argument the locations and pmf are not overwritten\n        \/\/ while sampling\n        LocationArray new_locations(new_size);\n\n        for(int i = 0; i < new_size; i++)\n        {\n            new_locations[i] = distribution.sample();\n        }\n\n        set_uniform(new_size);\n        locations_ = new_locations;\n    }\n\n\n\n    \/\/\/ const functions ********************************************************\n\n    \/\/ sampling ----------------------------------------------------------------\n    virtual Variate map_standard_normal(const Real& gaussian_sample) const\n    {\n        Real uniform_sample =\n                0.5 * (1.0 + std::erf(gaussian_sample \/ std::sqrt(2.0)));\n\n        return map_standard_uniform(uniform_sample);\n    }\n\n    virtual Variate map_standard_uniform(const Real& uniform_sample) const\n    {\n        int i = 0;\n        for (i = 0; i < cumul_distr_.size(); ++i)\n        {\n            if (cumul_distr_[i] >= uniform_sample) break;\n        }\n\n        return locations_[i];\n    }\n\n\n    \/\/ get ---------------------------------------------------------------------\n    virtual const Variate& location(int i) const\n    {\n        return locations_[i];\n    }\n\n    virtual const LocationArray& locations() const\n    {\n        return locations_;\n    }\n\n    virtual Real log_prob_mass(const int& i) const\n    {\n        return log_prob_mass_(i);\n    }\n\n    virtual Function log_prob_mass() const\n    {\n        return log_prob_mass_;\n    }\n\n    virtual Real prob_mass(const int& i) const\n    {\n        return prob_mass_(i);\n    }\n\n    virtual Function prob_mass() const\n    {\n        return prob_mass_;\n    }\n\n    virtual int size() const\n    {\n        return locations_.size();\n    }\n\n    virtual int dimension() const\n    {\n        return locations_[0].rows();\n    }\n\n\n    \/\/ compute properties ------------------------------------------------------\n    virtual const Mean& mean() const\n    {\n        mu_ = Mean::Zero(dimension());\n\n        for(int i = 0; i < locations_.size(); i++)\n        {\n            mu_ += prob_mass(i) * locations_[i].template cast<Real>();\n        }\n\n        return mu_;\n    }\n\n    virtual const Covariance& covariance() const\n    {\n        Mean mu = mean();\n        cov_ = Covariance::Zero(dimension(), dimension());\n        for(int i = 0; i < locations_.size(); i++)\n        {\n            Mean delta = (locations_[i].template cast<Real>()-mu);\n            cov_ += prob_mass(i) * delta * delta.transpose();\n        }\n\n        return cov_;\n    }\n\n    virtual Real entropy() const\n    {\n        return - log_prob_mass_.cwiseProduct(prob_mass_).sum();\n    }\n\n    \/\/ implements KL(p||u) where p is this distr, and u is the uniform distr\n    virtual Real kl_given_uniform() const\n    {\n        return std::log(Real(size())) - entropy();\n    }\n\n\nprotected:\n    \/\/\/ member variables *******************************************************\n    LocationArray locations_;\n\n    Function log_prob_mass_;\n    Function prob_mass_;\n    CommulativeDistribution cumul_distr_;\n\n    mutable Mean mu_;\n    mutable Covariance cov_;\n};\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#include    \"..\/Characters\/Format.h\"\n#include    \"..\/Debug\/Trace.h\"\n\n#include    \"SQLite.h\"\n\n\n\nusing   namespace   Stroika::Foundation;\n\nusing   namespace   Characters;\nusing   namespace   Debug;\nusing   namespace   Database;\nusing   namespace   Database::SQLite;\nusing   namespace   Execution;\n\n\n\n\/\/ Comment this in to turn on aggressive noisy DbgTrace in this module\n\/\/#define   USE_NOISY_TRACE_IN_THIS_MODULE_       1\n\n\n\n\n#if     qHasFeature_sqlite\n\/*\n ********************************************************************************\n ************************* SQLite::DB::Statement ********************************\n ********************************************************************************\n *\/\nDB::Statement::Statement (sqlite3* db, const String& query)\n{\n    int rc = ::sqlite3_prepare_v2 (db, query.AsUTF8 ().c_str (), -1, &stmt, NULL);\n    if (rc != SQLITE_OK) {\n        Execution::Throw (StringException (Characters::Format (L\"SQLite Error %s:\", String::FromUTF8 (::sqlite3_errmsg (db)).c_str ())));\n    }\n    AssertNotNull (stmt);\n    nParams = ::sqlite3_column_count (stmt);\n    for (size_t i = 0; i < nParams; ++i) {\n        fColNames += String::FromUTF8 (::sqlite3_column_name (stmt, i));\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        DbgTrace (L\"sqlite3_column_decltype(i) = %s\", String::FromUTF8 (::sqlite3_column_decltype (stmt, i)).c_str ());\n#endif\n\n        \/\/ add VaroamtVa;ue\"::Type list based on sqlite3_column_decltype\n    }\n}\n\n\/\/\/ returns 'missing' on EOF, exception on error\nauto   DB::Statement::GetNextRow () -> Optional<RowType> {\n    \/\/ @todo redo with https:\/\/www.sqlite.org\/c3ref\/value.html\n    int rc;\n    AssertNotNull (stmt);\n    if (( rc = ::sqlite3_step (stmt)) == SQLITE_ROW)\n    {\n        RowType row;\n        for (size_t i = 0; i < nParams; ++i) {\n            \/\/ redo as sqlite3_column_text16\n            \/\/ @todo AND iether use value object or check INTERANL TYOPE  - https:\/\/www.sqlite.org\/c3ref\/column_blob.html and return the right one  - NULL, INTEGER, FLOAT, TEXT, BLOB\n            VariantValue    v;\n            switch (::sqlite3_column_type (stmt, i)) {\n                case SQLITE_INTEGER: {\n                        v = VariantValue (::sqlite3_column_int (stmt, i));\n                    }\n                    break;\n                case SQLITE_FLOAT: {\n                        v = VariantValue (::sqlite3_column_double (stmt, i));\n                    }\n                    break;\n                case SQLITE_BLOB: {\n#if 1\n                        \/\/ this will work badly, so dont use!!!\n                        AssertNotImplemented ();\n                        v = VariantValue (String::FromUTF8 (reinterpret_cast<const char*> (::sqlite3_column_text (stmt, i))));\n#else\n                        \/\/ @todo - support this once we support BLOB in VariantValue\n                        const void* sqlite3_column_blob(sqlite3_stmt*, int iCol);\n                        int sqlite3_column_bytes(sqlite3_stmt*, int iCol);\n                        v = VariantValue (String::FromUTF8 (reinterpret_cast<const char*> (::sqlite3_column_text (stmt, i))));\n#endif\n                    }\n                    break;\n                case SQLITE_NULL: {\n                        v = VariantValue ();\n                    }\n                    break;\n                case SQLITE_TEXT: {\n                        v = VariantValue (String::FromUTF8 (reinterpret_cast<const char*> (::sqlite3_column_text (stmt, i))));\n                    }\n                    break;\n                default: {\n                        AssertNotReached ();\n                    }\n                    break;\n            }\n            row.Add (fColNames[i], v);\n        }\n        return row;\n    }\n    return Optional<RowType> ();\n}\n\nDB::Statement::~Statement ()\n{\n    AssertNotNull (stmt);\n    ::sqlite3_finalize (stmt);\n}\n\n\n\n\n\n\/*\n ********************************************************************************\n ********************************** SQLite::DB **********************************\n ********************************************************************************\n *\/\nDB::DB (const String& experimentDBFullPath, const function<void(DB&)>& dbInitializer)\n{\n    TraceContextBumper ctx (SDKSTR (\"SQLite::DB::DB\"));\n    \/\/ @todo - code cleanup!!!\n    int e;\n    if ((e = ::sqlite3_open_v2 ((L\"file:\/\/\" + experimentDBFullPath).AsUTF8 ().c_str (), &fDB_,  SQLITE_OPEN_URI | SQLITE_OPEN_READWRITE, nullptr)) == SQLITE_CANTOPEN) {\n        if ((e = ::sqlite3_open_v2 ((L\"file:\/\/\" + experimentDBFullPath).AsUTF8 ().c_str (), &fDB_,  SQLITE_OPEN_URI |  SQLITE_OPEN_CREATE | SQLITE_OPEN_READWRITE, nullptr)) == SQLITE_OK) {\n            try {\n                dbInitializer (*this);\n            }\n            catch (...) {\n                ::sqlite3_close (fDB_);\n                Execution::ReThrow ();\n            }\n        }\n    }\n    else if (e != SQLITE_OK) {\n        Assert (fDB_ == nullptr);\n        \/\/ @todo add error string\n        Execution::Throw (StringException (Characters::Format (L\"SQLite Error %d:\", e)));\n    }\n}\n\nDB:: ~DB ()\n{\n    AssertNotNull (fDB_);\n    ::sqlite3_close (fDB_);\n}\n\nvoid    DB::Exec (const String& cmd2Exec)\n{\n    char* db_err {};\n    int e = ::sqlite3_exec (fDB_, cmd2Exec.AsUTF8 ().c_str (), NULL, 0, &db_err);\n    if (e != SQLITE_OK) {\n        if (db_err == nullptr or * db_err == '\\0') {\n            DbgTrace (L\"Failed doing sqllite command: %s\", cmd2Exec.c_str ());\n            Execution::Throw (StringException (Characters::Format (L\"SQLite Error %d\", e)));\n        }\n        else {\n            Execution::Throw (StringException (Characters::Format (L\"SQLite Error %d: %s\", e, String::FromUTF8 (db_err).c_str ())));\n        }\n    }\n}\n#endif\n<commit_msg>SQLite code cleanups - DbgTrace cleanups and assertions<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#include    \"..\/Characters\/Format.h\"\n#include    \"..\/Debug\/Trace.h\"\n\n#include    \"SQLite.h\"\n\n\n\nusing   namespace   Stroika::Foundation;\n\nusing   namespace   Characters;\nusing   namespace   Debug;\nusing   namespace   Database;\nusing   namespace   Database::SQLite;\nusing   namespace   Execution;\n\n\n\n\/\/ Comment this in to turn on aggressive noisy DbgTrace in this module\n\/\/#define   USE_NOISY_TRACE_IN_THIS_MODULE_       1\n\n\n\n\n#if     qHasFeature_sqlite\n\/*\n ********************************************************************************\n ************************* SQLite::DB::Statement ********************************\n ********************************************************************************\n *\/\nDB::Statement::Statement (sqlite3* db, const String& query)\n{\n    int rc = ::sqlite3_prepare_v2 (db, query.AsUTF8 ().c_str (), -1, &stmt, NULL);\n    if (rc != SQLITE_OK) {\n        Execution::Throw (StringException (Characters::Format (L\"SQLite Error %s:\", String::FromUTF8 (::sqlite3_errmsg (db)).c_str ())));\n    }\n    AssertNotNull (stmt);\n    nParams = ::sqlite3_column_count (stmt);\n    for (size_t i = 0; i < nParams; ++i) {\n        fColNames += String::FromUTF8 (::sqlite3_column_name (stmt, i));\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        DbgTrace (L\"sqlite3_column_decltype(i) = %s\", ::sqlite3_column_decltype (stmt, i) == nullptr ? L\"{nullptr}\" : String::FromUTF8 (::sqlite3_column_decltype (stmt, i)).c_str ());\n#endif\n        \/\/ add VaroamtVa;ue\"::Type list based on sqlite3_column_decltype\n    }\n}\n\n\/\/\/ returns 'missing' on EOF, exception on error\nauto   DB::Statement::GetNextRow () -> Optional<RowType> {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n    TraceContextBumper ctx (SDKSTR (\"SQLite::DB::Statement::GetNextRow\"));\n#endif\n    \/\/ @todo redo with https:\/\/www.sqlite.org\/c3ref\/value.html\n    int rc;\n    AssertNotNull (stmt);\n    if (( rc = ::sqlite3_step (stmt)) == SQLITE_ROW)\n    {\n        RowType row;\n        for (size_t i = 0; i < nParams; ++i) {\n            \/\/ redo as sqlite3_column_text16\n            \/\/ @todo AND iether use value object or check INTERANL TYOPE  - https:\/\/www.sqlite.org\/c3ref\/column_blob.html and return the right one  - NULL, INTEGER, FLOAT, TEXT, BLOB\n            VariantValue    v;\n            switch (::sqlite3_column_type (stmt, i)) {\n                case SQLITE_INTEGER: {\n                        v = VariantValue (::sqlite3_column_int (stmt, i));\n                    }\n                    break;\n                case SQLITE_FLOAT: {\n                        v = VariantValue (::sqlite3_column_double (stmt, i));\n                    }\n                    break;\n                case SQLITE_BLOB: {\n#if 1\n                        \/\/ this will work badly, so dont use!!!\n                        AssertNotImplemented ();\n                        v = VariantValue (String::FromUTF8 (reinterpret_cast<const char*> (::sqlite3_column_text (stmt, i))));\n#else\n                        \/\/ @todo - support this once we support BLOB in VariantValue\n                        const void* sqlite3_column_blob(sqlite3_stmt*, int iCol);\n                        int sqlite3_column_bytes(sqlite3_stmt*, int iCol);\n                        v = VariantValue (String::FromUTF8 (reinterpret_cast<const char*> (::sqlite3_column_text (stmt, i))));\n#endif\n                    }\n                    break;\n                case SQLITE_NULL: {\n                        \/\/ default to null value\n                    }\n                    break;\n                case SQLITE_TEXT: {\n                        AssertNotNull (::sqlite3_column_text (stmt, i));\n                        v = VariantValue (String::FromUTF8 (reinterpret_cast<const char*> (::sqlite3_column_text (stmt, i))));\n                    }\n                    break;\n                default: {\n                        AssertNotReached ();\n                    }\n                    break;\n            }\n            row.Add (fColNames[i], v);\n        }\n        return row;\n    }\n    return Optional<RowType> ();\n}\n\nDB::Statement::~Statement ()\n{\n    AssertNotNull (stmt);\n    ::sqlite3_finalize (stmt);\n}\n\n\n\n\n\n\/*\n ********************************************************************************\n ********************************** SQLite::DB **********************************\n ********************************************************************************\n *\/\nDB::DB (const String& experimentDBFullPath, const function<void(DB&)>& dbInitializer)\n{\n    TraceContextBumper ctx (SDKSTR (\"SQLite::DB::DB\"));\n    \/\/ @todo - code cleanup!!!\n    int e;\n    if ((e = ::sqlite3_open_v2 ((L\"file:\/\/\" + experimentDBFullPath).AsUTF8 ().c_str (), &fDB_,  SQLITE_OPEN_URI | SQLITE_OPEN_READWRITE, nullptr)) == SQLITE_CANTOPEN) {\n        if ((e = ::sqlite3_open_v2 ((L\"file:\/\/\" + experimentDBFullPath).AsUTF8 ().c_str (), &fDB_,  SQLITE_OPEN_URI |  SQLITE_OPEN_CREATE | SQLITE_OPEN_READWRITE, nullptr)) == SQLITE_OK) {\n            try {\n                dbInitializer (*this);\n            }\n            catch (...) {\n                Verify (::sqlite3_close (fDB_) == SQLITE_OK);\n                Execution::ReThrow ();\n            }\n        }\n    }\n    else if (e != SQLITE_OK) {\n        Assert (fDB_ == nullptr);\n        \/\/ @todo add error string\n        Execution::Throw (StringException (Characters::Format (L\"SQLite Error %d:\", e)));\n    }\n}\n\nDB:: ~DB ()\n{\n    AssertNotNull (fDB_);\n    Verify (::sqlite3_close (fDB_) == SQLITE_OK);\n}\n\nvoid    DB::Exec (const String& cmd2Exec)\n{\n    char* db_err {};\n    int e = ::sqlite3_exec (fDB_, cmd2Exec.AsUTF8 ().c_str (), NULL, 0, &db_err);\n    if (e != SQLITE_OK) {\n        if (db_err == nullptr or * db_err == '\\0') {\n            DbgTrace (L\"Failed doing sqllite command: %s\", cmd2Exec.c_str ());\n            Execution::Throw (StringException (Characters::Format (L\"SQLite Error %d\", e)));\n        }\n        else {\n            Execution::Throw (StringException (Characters::Format (L\"SQLite Error %d: %s\", e, String::FromUTF8 (db_err).c_str ())));\n        }\n    }\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <opencv2\/opencv.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <wiringPi.h>\n#include \"camera.hpp\"\n#include \"..\/motor.h\"\n\n#pragma comment(lib,\"opencv_world320.lib\")\n\nstatic const int ROTATE_POWER = 100;\nstatic const int ROTATE_MILLISECONDS = 200;\nstatic const int LEFT_MAX = -100;\nstatic const int RIGHT_MAX = 100;\nstatic const int CENTER_THRESHOLD = 30;\/\/-30~30で直進するようにする\nstatic const double EXIST_THRESHOLD = 0.7;\/\/ゴール存在判定 パーセンテージ\nstatic const int TIME_LIMIT = 360000;\n\n\/\/TODO turn millisecondどんどん大きくしていくPI制御にする\nint main (void)\n{\n\tint start_time  = millis();\n\tint last_time = millis();\n\tpwm_initialize();\n\twhile(last_time-start_time<TIME_LIMIT)\n\t{\n\n\t\tcv::Mat red = Mred();\n\t\tdouble count = countArea(red);\n\t\tif(count < EXIST_THRESHOLD)\n\t\t{\n\t\t\t\/\/回転するだけ\n\t\t\tmotor_right(ROTATE_POWER);\n\t\t\tdelay(ROTATE_MILLISECONDS);\n\t\t\tmotor_stop();\n\t\t\tdelay(10);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/見つけれたら前進\n\t\t\tmotor_forward(100);\n\t\t\tdelay(400);\n\t\t\tmotor_stop();\n\t\t\tdelay(10);\n\t\t}\n\t}\n\treturn 0;\n}\n<commit_msg>debug<commit_after>#include <stdio.h>\n#include <opencv2\/opencv.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <wiringPi.h>\n#include \"camera.hpp\"\n#include \"..\/motor.h\"\n\n#pragma comment(lib,\"opencv_world320.lib\")\n\nstatic const int ROTATE_POWER = 100;\nstatic const int ROTATE_MILLISECONDS = 200;\nstatic const int LEFT_MAX = -100;\nstatic const int RIGHT_MAX = 100;\nstatic const int CENTER_THRESHOLD = 30;\/\/-30~30で直進するようにする\nstatic const double EXIST_THRESHOLD = 0.7;\/\/ゴール存在判定 パーセンテージ\nstatic const int TIME_LIMIT = 360000;\/\/6分\n\n\/\/TODO turn millisecondどんどん大きくしていくPI制御にする\nint main (void)\n{\n\tint startTime  = millis();\n\tint lastTime = millis();\n\tpwm_initialize();\n\twhile(lastTime-startTime<TIME_LIMIT)\n\t{\n\t\tlastTime = millis();\n\t\tcv::Mat red = Mred();\n\t\tdouble count = countArea(red);\n\t\tif(count < EXIST_THRESHOLD)\n\t\t{\n\t\t\t\/\/回転するだけ\n\t\t\tmotor_right(ROTATE_POWER);\n\t\t\tdelay(ROTATE_MILLISECONDS);\n\t\t\tmotor_stop();\n\t\t\tdelay(10);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/見つけれたら前進\n\t\t\tmotor_forward(100);\n\t\t\tdelay(400);\n\t\t\tmotor_stop();\n\t\t\tdelay(10);\n\t\t}\n\t}\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>\"no matching function for call to 'get_pointer',\" use lambda instead<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\r\n\r\nProgram:   Medical Imaging & Interaction Toolkit\r\nLanguage:  C++\r\nDate:      $Date: 2009-05-13 14:52:01 +0200 (Mi, 13. Mai 2009) $\r\nVersion:   $Revision: 17230 $\r\n\r\nCopyright (c) German Cancer Research Center, Division of Medical and\r\nBiological Informatics. All rights reserved.\r\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\r\n\r\nThis software is distributed WITHOUT ANY WARRANTY; without even\r\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\r\nPURPOSE.  See the above copyright notices for more information.\r\n\r\n=========================================================================*\/\r\n\r\n#include \"mitkNavigationDataRecorder.h\"\r\n#include \"mitkNavigationData.h\"\r\n\r\n#include \"mitkTestingMacros.h\"\r\n\r\n#include <iostream>\r\n#include <sstream>\r\n\r\n\/**Documentation\r\n *  test for the class \"NavigationDataRecorder\".\r\n *\/\r\nint mitkNavigationDataRecorderTest(int \/* argc *\/, char* \/*argv*\/[])\r\n{\r\n  MITK_TEST_BEGIN(\"NavigationDataRecorder\");\r\n  std::string tmp = \"\";\r\n  std::ostringstream* stream = new std::ostringstream( std::ostringstream::trunc );\r\n\r\n  \/\/ let's create an object of our class  \r\n  mitk::NavigationDataRecorder::Pointer recorder = mitk::NavigationDataRecorder::New();\r\n  \r\n  \/\/ first test: did this work?\r\n  \/\/ using MITK_TEST_CONDITION_REQUIRED makes the test stop after failure, since\r\n  \/\/ it makes no sense to continue without an object.\r\n  MITK_TEST_CONDITION_REQUIRED(recorder.IsNotNull(), \"Testing instantiation\");\r\n\r\n  MITK_TEST_CONDITION(recorder->GetInputs().size() == 0, \"testing initial number of inputs\"); \r\n  MITK_TEST_CONDITION(recorder->GetOutputs().size() == 0, \"testing initial number of outputs\");\r\n  \r\n  std::vector<mitk::NavigationData::Pointer> naviDatas;\r\n\r\n  mitk::NavigationData::Pointer naviData = mitk::NavigationData::New();\r\n  recorder->AddNavigationData( naviData );\r\n  \/\/recorder->SetFileName(\"e:\/test\");\r\n  \/\/recorder->SetRecordingMode( mitk::NavigationDataRecorder::NormalFile );\r\n  recorder->StartRecording( stream );\r\n  for ( unsigned int i=0; i<5; i++ )\r\n  {\r\n    mitk::Point3D pnt;\r\n    pnt[0] = i+1;\r\n    pnt[1] = i+1\/2;\r\n    pnt[2] = i+1*3;\r\n    naviData->SetPosition(pnt);\r\n    \/\/naviData->Modified();\r\n    recorder->Update();\r\n    \r\n    \/\/Sleep(80 + i*10);\r\n\r\n  }\r\n\r\n  recorder->StopRecording();\r\n\r\n  std::string str = stream->str();\r\n  int pos = str.find( \"ToolCount=\" );\r\n  std::string sub = stream->str().substr(pos+11, 1);\r\n  MITK_TEST_CONDITION( sub.compare(\"1\") == 0, \"check if number of inputs is correct by stringstream\");\r\n\r\n  pos = str.find( \"X=\" );\r\n  sub = stream->str().substr(pos+3, 3);\r\n  MITK_TEST_CONDITION( sub.compare(\"1.0\") == 0, \"check if the X coordinate is correct\");\r\n\r\n  \r\n  pos = str.find( \"Y=\" );\r\n  sub = stream->str().substr(pos+3, 3);\r\n  MITK_TEST_CONDITION( sub.compare(\"0.0\") == 0, \"check if the Y coordinate is correct\");\r\n\r\n  \r\n  pos = str.find( \"Z=\" );\r\n  sub = stream->str().substr(pos+3, 3);\r\n  MITK_TEST_CONDITION( sub.compare(\"3.0\") == 0, \"check if the Z coordinate is correct\");\r\n\r\n\r\n  recorder->SetFileName(\"blablabla\");\r\n  const char* string = recorder->GetFileName();\r\n  MITK_TEST_CONDITION( strcmp(string, \"blablabla\") == 0, \"check if set- and getName-methods work\");\r\n\r\n  \/\/ always end with this!\r\n  MITK_TEST_END();\r\n}\r\n<commit_msg>STYLE: removed unused variable<commit_after>\/*=========================================================================\r\n\r\nProgram:   Medical Imaging & Interaction Toolkit\r\nLanguage:  C++\r\nDate:      $Date: 2009-05-13 14:52:01 +0200 (Mi, 13. Mai 2009) $\r\nVersion:   $Revision: 17230 $\r\n\r\nCopyright (c) German Cancer Research Center, Division of Medical and\r\nBiological Informatics. All rights reserved.\r\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\r\n\r\nThis software is distributed WITHOUT ANY WARRANTY; without even\r\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\r\nPURPOSE.  See the above copyright notices for more information.\r\n\r\n=========================================================================*\/\r\n\r\n#include \"mitkNavigationDataRecorder.h\"\r\n#include \"mitkNavigationData.h\"\r\n\r\n#include \"mitkTestingMacros.h\"\r\n\r\n#include <iostream>\r\n#include <sstream>\r\n\r\n\/**Documentation\r\n *  test for the class \"NavigationDataRecorder\".\r\n *\/\r\nint mitkNavigationDataRecorderTest(int \/* argc *\/, char* \/*argv*\/[])\r\n{\r\n  MITK_TEST_BEGIN(\"NavigationDataRecorder\");\r\n  std::string tmp = \"\";\r\n  std::ostringstream* stream = new std::ostringstream( std::ostringstream::trunc );\r\n\r\n  \/\/ let's create an object of our class  \r\n  mitk::NavigationDataRecorder::Pointer recorder = mitk::NavigationDataRecorder::New();\r\n  \r\n  \/\/ first test: did this work?\r\n  \/\/ using MITK_TEST_CONDITION_REQUIRED makes the test stop after failure, since\r\n  \/\/ it makes no sense to continue without an object.\r\n  MITK_TEST_CONDITION_REQUIRED(recorder.IsNotNull(), \"Testing instantiation\");\r\n\r\n  MITK_TEST_CONDITION(recorder->GetInputs().size() == 0, \"testing initial number of inputs\"); \r\n  MITK_TEST_CONDITION(recorder->GetOutputs().size() == 0, \"testing initial number of outputs\");\r\n\r\n  mitk::NavigationData::Pointer naviData = mitk::NavigationData::New();\r\n  recorder->AddNavigationData( naviData );\r\n  \/\/recorder->SetFileName(\"e:\/test\");\r\n  \/\/recorder->SetRecordingMode( mitk::NavigationDataRecorder::NormalFile );\r\n  recorder->StartRecording( stream );\r\n  for ( unsigned int i=0; i<5; i++ )\r\n  {\r\n    mitk::Point3D pnt;\r\n    pnt[0] = i+1;\r\n    pnt[1] = i+1\/2;\r\n    pnt[2] = i+1*3;\r\n    naviData->SetPosition(pnt);\r\n    \/\/naviData->Modified();\r\n    recorder->Update();\r\n    \r\n    \/\/Sleep(80 + i*10);\r\n\r\n  }\r\n\r\n  recorder->StopRecording();\r\n\r\n  std::string str = stream->str();\r\n  int pos = str.find( \"ToolCount=\" );\r\n  std::string sub = stream->str().substr(pos+11, 1);\r\n  MITK_TEST_CONDITION( sub.compare(\"1\") == 0, \"check if number of inputs is correct by stringstream\");\r\n\r\n  pos = str.find( \"X=\" );\r\n  sub = stream->str().substr(pos+3, 3);\r\n  MITK_TEST_CONDITION( sub.compare(\"1.0\") == 0, \"check if the X coordinate is correct\");\r\n\r\n  \r\n  pos = str.find( \"Y=\" );\r\n  sub = stream->str().substr(pos+3, 3);\r\n  MITK_TEST_CONDITION( sub.compare(\"0.0\") == 0, \"check if the Y coordinate is correct\");\r\n\r\n  \r\n  pos = str.find( \"Z=\" );\r\n  sub = stream->str().substr(pos+3, 3);\r\n  MITK_TEST_CONDITION( sub.compare(\"3.0\") == 0, \"check if the Z coordinate is correct\");\r\n\r\n\r\n  recorder->SetFileName(\"blablabla\");\r\n  const char* string = recorder->GetFileName();\r\n  MITK_TEST_CONDITION( strcmp(string, \"blablabla\") == 0, \"check if set- and getName-methods work\");\r\n\r\n  \/\/ always end with this!\r\n  MITK_TEST_END();\r\n}\r\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\n#include \"itkGDCMImageIO.h\"\n#include \"itkImageSeriesReader.h\"\n#include \"itkGDCMSeriesFileNames.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n#include \"itkImageSeriesWriter.h\"\n#include \"itkNumericSeriesFileNames.h\"\n#include \"itkSimpleFilterWatcher.h\"\n\nint\nitkImageSeriesWriterTest(int ac, char * av[])\n{\n\n  if (ac < 4)\n  {\n    std::cerr << \"Usage: \" << av[0] << \" DicomDirectory OutputDirectory FileSuffix\\n\";\n    return EXIT_FAILURE;\n  }\n\n  using ImageNDType = itk::Image<short, 3>;\n  using ReaderType = itk::ImageSeriesReader<ImageNDType>;\n\n  itk::GDCMImageIO::Pointer io = itk::GDCMImageIO::New();\n\n  \/\/ Get the DICOM filenames from the directory\n  itk::GDCMSeriesFileNames::Pointer nameGenerator = itk::GDCMSeriesFileNames::New();\n  nameGenerator->SetDirectory(av[1]);\n\n  using SeriesIdContainer = std::vector<std::string>;\n  const SeriesIdContainer & seriesUID = nameGenerator->GetSeriesUIDs();\n  std::string               seriesIdentifier = seriesUID.begin()->c_str();\n\n  ReaderType::Pointer reader = ReaderType::New();\n  reader->SetFileNames(nameGenerator->GetFileNames(seriesIdentifier));\n  reader->SetImageIO(io);\n\n  itk::SimpleFilterWatcher watcher(reader);\n\n  try\n  {\n    reader->Update();\n    reader->GetOutput()->Print(std::cout);\n  }\n  catch (const itk::ExceptionObject & ex)\n  {\n    std::cout << ex;\n    return EXIT_FAILURE;\n  }\n\n  using WritePixelType = unsigned char;\n  using RescaleImageType = itk::Image<WritePixelType, 3>;\n  using OutputImageType = itk::Image<WritePixelType, 2>;\n\n  using RescaleFilterType = itk::RescaleIntensityImageFilter<ImageNDType, RescaleImageType>;\n  RescaleFilterType::Pointer rescaler = RescaleFilterType::New();\n  rescaler->SetInput(reader->GetOutput());\n  rescaler->SetOutputMinimum(0);\n  rescaler->SetOutputMaximum(255);\n  rescaler->UpdateLargestPossibleRegion();\n\n\n  { \/\/ This API is being deprecated. Please use NumericSeriesFileNames in the future\n    \/\/ for generating the list of filenames.  This API will be removed after ITK 1.8\n    using WriterType = itk::ImageSeriesWriter<RescaleImageType, OutputImageType>;\n\n    WriterType::Pointer writer = WriterType::New();\n\n    itk::SimpleFilterWatcher watcher2(writer);\n\n    writer->SetInput(rescaler->GetOutput());\n    char format[4096];\n    sprintf(format, \"%s\/series.%%d.%s\", av[2], av[3]);\n    writer->SetSeriesFormat(format);\n\n    try\n    {\n      writer->Update();\n    }\n    catch (const itk::ExceptionObject & excp)\n    {\n      std::cerr << \"Error while writing the series with old API\" << std::endl;\n      std::cerr << excp << std::endl;\n      return EXIT_FAILURE;\n    }\n\n    \/\/ Verify that attempting to use a MetaDataDictionary without setting the ImageIO\n    \/\/ should throw an exception.\n    writer->SetMetaDataDictionaryArray(reader->GetMetaDataDictionaryArray());\n    try\n    {\n      writer->Update();\n      std::cerr << \"Failed to throw expected exception of using MetaDataDictionary without ImageIO\" << std::endl;\n      return EXIT_FAILURE;\n    }\n    catch (itk::ExceptionObject &)\n    {\n      std::cout << \"Exercised expected exception\" << std::endl;\n    }\n\n    std::cout << \"Old API PASSED !\" << std::endl;\n  }\n\n  { \/\/ This is the new API, using the NumericSeriesFileNames (or any other filename generator).\n    itk::NumericSeriesFileNames::Pointer fit = itk::NumericSeriesFileNames::New();\n\n    using WriterType = itk::ImageSeriesWriter<RescaleImageType, OutputImageType>;\n\n    WriterType::Pointer writer = WriterType::New();\n\n\n    char format[4096];\n    sprintf(format, \"%s\/series.%%d.%s\", av[2], av[3]);\n\n    std::cout << \"Format = \" << format << std::endl;\n\n    ImageNDType::RegionType region = reader->GetOutput()->GetBufferedRegion();\n    ImageNDType::SizeType   size = region.GetSize();\n\n    fit->SetStartIndex(0);\n    fit->SetEndIndex(size[2] - 1); \/\/ The number of slices to write\n    fit->SetIncrementIndex(1);\n    fit->SetSeriesFormat(format);\n\n    writer->SetInput(rescaler->GetOutput());\n    writer->SetFileNames(fit->GetFileNames());\n\n    \/\/ experiment the UseCompression methods and values\n    if (writer->GetUseCompression())\n    {\n      std::cerr << \"Wrong default use compression value\" << std::endl;\n      return EXIT_FAILURE;\n    }\n    writer->SetUseCompression(true);\n    writer->UseCompressionOn();\n    writer->UseCompressionOff();\n\n    try\n    {\n      writer->Update();\n    }\n    catch (const itk::ExceptionObject & excp)\n    {\n      std::cerr << \"Error while writing the series with SeriesFileNames generator\" << std::endl;\n      std::cerr << excp << std::endl;\n      return EXIT_FAILURE;\n    }\n\n    \/\/ Verify that attempting to use a MetaDataDictionary without setting the ImageIO\n    \/\/ should throw an exception.\n    writer->SetMetaDataDictionaryArray(reader->GetMetaDataDictionaryArray());\n    try\n    {\n      writer->Update();\n      std::cerr << \"Failed to throw expected exception of using MetaDataDictionary without ImageIO\" << std::endl;\n      return EXIT_FAILURE;\n    }\n    catch (itk::ExceptionObject &)\n    {\n      std::cout << \"Exercised expected exception\" << std::endl;\n    }\n\n    std::cout << \"Test with NumericSeriesFileNames PASSED !\" << std::endl;\n  }\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>STYLE: Improve `itk::ImageSeriesWriter` class test file style<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\n#include \"itkGDCMImageIO.h\"\n#include \"itkImageSeriesReader.h\"\n#include \"itkGDCMSeriesFileNames.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n#include \"itkImageSeriesWriter.h\"\n#include \"itkNumericSeriesFileNames.h\"\n#include \"itkSimpleFilterWatcher.h\"\n#include \"itkTestingMacros.h\"\n\nint\nitkImageSeriesWriterTest(int argc, char * argv[])\n{\n\n  if (argc < 4)\n  {\n    std::cerr << \"Missing Parameters.\" << std::endl;\n    std::cerr << \"Usage: \" << itkNameOfTestExecutableMacro(argv) << \" DicomDirectory OutputDirectory FileSuffix\"\n              << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  using ImageNDType = itk::Image<short, 3>;\n  using ReaderType = itk::ImageSeriesReader<ImageNDType>;\n\n  itk::GDCMImageIO::Pointer io = itk::GDCMImageIO::New();\n\n  \/\/ Get the DICOM filenames from the directory\n  itk::GDCMSeriesFileNames::Pointer nameGenerator = itk::GDCMSeriesFileNames::New();\n  nameGenerator->SetDirectory(argv[1]);\n\n  using SeriesIdContainer = std::vector<std::string>;\n  const SeriesIdContainer & seriesUID = nameGenerator->GetSeriesUIDs();\n  std::string               seriesIdentifier = seriesUID.begin()->c_str();\n\n  ReaderType::Pointer reader = ReaderType::New();\n  reader->SetFileNames(nameGenerator->GetFileNames(seriesIdentifier));\n  reader->SetImageIO(io);\n\n  itk::SimpleFilterWatcher watcher(reader);\n\n\n  ITK_TRY_EXPECT_NO_EXCEPTION(reader->Update());\n\n  reader->GetOutput()->Print(std::cout);\n\n\n  using WritePixelType = unsigned char;\n  using RescaleImageType = itk::Image<WritePixelType, 3>;\n  using OutputImageType = itk::Image<WritePixelType, 2>;\n\n  using RescaleFilterType = itk::RescaleIntensityImageFilter<ImageNDType, RescaleImageType>;\n  RescaleFilterType::Pointer rescaler = RescaleFilterType::New();\n  rescaler->SetInput(reader->GetOutput());\n  rescaler->SetOutputMinimum(0);\n  rescaler->SetOutputMaximum(255);\n  rescaler->UpdateLargestPossibleRegion();\n\n\n  { \/\/ This API is being deprecated. Please use NumericSeriesFileNames in the future\n    \/\/ for generating the list of filenames.  This API will be removed after ITK 1.8\n    using WriterType = itk::ImageSeriesWriter<RescaleImageType, OutputImageType>;\n\n    WriterType::Pointer writer = WriterType::New();\n\n    itk::SimpleFilterWatcher watcher2(writer);\n\n    writer->SetInput(rescaler->GetOutput());\n    char format[4096];\n    sprintf(format, \"%s\/series.%%d.%s\", argv[2], argv[3]);\n    writer->SetSeriesFormat(format);\n\n    ITK_TRY_EXPECT_NO_EXCEPTION(writer->Update());\n\n\n    \/\/ Verify that attempting to use a MetaDataDictionary without setting the ImageIO\n    \/\/ should throw an exception.\n    writer->SetMetaDataDictionaryArray(reader->GetMetaDataDictionaryArray());\n\n    ITK_TRY_EXPECT_EXCEPTION(writer->Update());\n\n\n    std::cout << \"Old API PASSED !\" << std::endl;\n  }\n\n  { \/\/ This is the new API, using the NumericSeriesFileNames (or any other filename generator).\n    itk::NumericSeriesFileNames::Pointer fit = itk::NumericSeriesFileNames::New();\n\n    using WriterType = itk::ImageSeriesWriter<RescaleImageType, OutputImageType>;\n\n    WriterType::Pointer writer = WriterType::New();\n\n\n    char format[4096];\n    sprintf(format, \"%s\/series.%%d.%s\", argv[2], argv[3]);\n\n    std::cout << \"Format = \" << format << std::endl;\n\n    ImageNDType::RegionType region = reader->GetOutput()->GetBufferedRegion();\n    ImageNDType::SizeType   size = region.GetSize();\n\n    fit->SetStartIndex(0);\n    fit->SetEndIndex(size[2] - 1); \/\/ The number of slices to write\n    fit->SetIncrementIndex(1);\n    fit->SetSeriesFormat(format);\n\n    writer->SetInput(rescaler->GetOutput());\n    writer->SetFileNames(fit->GetFileNames());\n\n    \/\/ experiment the UseCompression methods and values\n    if (writer->GetUseCompression())\n    {\n      std::cerr << \"Wrong default use compression value\" << std::endl;\n      return EXIT_FAILURE;\n    }\n    writer->SetUseCompression(true);\n    writer->UseCompressionOn();\n    writer->UseCompressionOff();\n\n    ITK_TRY_EXPECT_NO_EXCEPTION(writer->Update());\n\n\n    \/\/ Verify that attempting to use a MetaDataDictionary without setting the ImageIO\n    \/\/ should throw an exception.\n    writer->SetMetaDataDictionaryArray(reader->GetMetaDataDictionaryArray());\n\n    ITK_TRY_EXPECT_EXCEPTION(writer->Update());\n\n\n    std::cout << \"Test with NumericSeriesFileNames PASSED !\" << std::endl;\n  }\n\n  std::cout << \"Test finished\" << std::endl;\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/-----------------------------------------------\n\/\/\n\/\/\tThis file is part of the Siv3D Engine.\n\/\/\n\/\/\tCopyright (c) 2008-2021 Ryo Suzuki\n\/\/\tCopyright (c) 2016-2021 OpenSiv3D Project\n\/\/\n\/\/\tLicensed under the MIT License.\n\/\/\n\/\/-----------------------------------------------\n\n# pragma once\n\nnamespace s3d\n{\n\tconstexpr Vec2 GlyphInfo::getOffset(const double scale) const noexcept\n\t{\n\t\treturn{ (left - (buffer * scale)), (ascent - (top * scale) - (buffer * scale)) };\n\t}\n}\n<commit_msg>[共通] GlyphInfo fix<commit_after>\/\/-----------------------------------------------\n\/\/\n\/\/\tThis file is part of the Siv3D Engine.\n\/\/\n\/\/\tCopyright (c) 2008-2021 Ryo Suzuki\n\/\/\tCopyright (c) 2016-2021 OpenSiv3D Project\n\/\/\n\/\/\tLicensed under the MIT License.\n\/\/\n\/\/-----------------------------------------------\n\n# pragma once\n\nnamespace s3d\n{\n\tconstexpr Vec2 GlyphInfo::getOffset(const double scale) const noexcept\n\t{\n\t\treturn{ ((left - buffer) * scale), ((ascent - top - buffer) * scale) };\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"GolfBall.hpp\"\n#include \"..\/Resources.hpp\"\n#include \"Default3D.vert.hpp\"\n#include \"Default3D.geom.hpp\"\n#include \"Default3D.frag.hpp\"\n#include \"glm\/gtc\/constants.hpp\"\n#include \"..\/Util\/Log.hpp\"\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/quaternion.hpp>\n\nGolfBall::GolfBall(BallType ballType, TerrainObject* terrain, Water* water) : ModelObject(modelGeometry = Resources().CreateOBJModel(\"Resources\/Models\/GolfBall\/GolfBall.obj\"),\n                                                                            \"Resources\/Models\/GolfBall\/Diffuse.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Normal.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Specular.png\") {\n    state = GolfBall::INITIAL;\n    \n    restitution = ballType == TWOPIECE ? 0.78f : 0.68f;\n    this->terrain = terrain;\n    this->water = water;\n    origin = glm::vec3(1.f, 0.f, 1.f);\n    \n    mass = 0.0459f;\n    this->ballType = ballType;\n    \n    sphere.position = Position();\n    SetRadius(0.0214f);\n}\n\nGolfBall::~GolfBall() {\n    Resources().FreeOBJModel(modelGeometry);\n}\n\nvoid GolfBall::Reset(){\n    state = GolfBall::INITIAL;\n    velocity = glm::vec3(0.f, 0.f, 0.f);\n    angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    SetPosition(origin);\n    sphere.position = Position();\n    orientation = glm::quat();\n}\n\nvoid GolfBall::Update(double time, const glm::vec3& wind, std::vector<PlayerObject>& players) {\n\tif (state == GolfBall::ACTIVE) {\n\t\tMove(static_cast<float>(time)* velocity);\n\t\tsphere.position = Position();\n\n\t\tif (glm::length(angularVelocity) > 0.0001f) {\n\t\t\tglm::quat deltaQuat = glm::angleAxis(static_cast<float>(time)* glm::length(angularVelocity), glm::normalize(angularVelocity));\n\t\t\torientation = deltaQuat * orientation;\n\t\t}\n\n\t\tglm::vec3 dragForce, magnusForce = glm::vec3(0.f, 0.f, 0.f);\n\n\t\tfloat groundLevel = terrain->GetY(Position().x, Position().z);\n        float waterLevel = water->Position().y;\n        \n        \/\/ Check if in water.\n        if ((sphere.position.y - sphere.radius < groundLevel && groundLevel + sphere.radius < waterLevel) || sphere.position.y + sphere.radius < waterLevel) {\n            state = GolfBall::OUT;\n            return;\n        }\n        \n        \/\/ Check for collision\n\t\tif (glm::length(velocity) > 0.0001f && (sphere.position.y - sphere.radius) < groundLevel){\n\t\t\tfloat vCritical = 0.3f;\n\t\t\tfloat e = 0.35f;\n\t\t\tfloat muSliding = 0.51f;\n\t\t\tfloat muRolling = 0.096f;\n\t\t\tSetPosition(Position().x, groundLevel + sphere.radius, Position().z);\n\t\t\tsphere.position = Position();\n\t\t\t\/\/glm::vec3 eRoh = glm::normalize(glm::vec3(0.f, 1.f, 0.f));\n\t\t\tglm::vec3 eRoh = terrain->GetNormal(Position().x, Position().z);\n\t\t\tglm::vec3 tangentialVelocity = velocity - glm::dot(velocity, eRoh) * eRoh;\n\t\t\tglm::vec3 eFriction = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (glm::length(glm::cross(eRoh, angularVelocity) + tangentialVelocity) > 0.0001f){\n\t\t\t\teFriction = glm::normalize(sphere.radius * glm::cross(eRoh, angularVelocity) + tangentialVelocity);\n\t\t\t}\n\t\t\tfloat vRoh = glm::dot(velocity, eRoh);\n\t\t\tfloat deltaU = -(e + 1.f) * vRoh;\n\t\t\tglm::vec3 angularDirection = glm::cross(eRoh, glm::normalize(tangentialVelocity));\n\t\t\tfloat w = glm::dot(angularVelocity, angularDirection);\n\n\t\t\tif (fabs(vRoh) < vCritical && glm::length(tangentialVelocity) > 0.0001f) {\n\t\t\t\tglm::vec3 mg = (9.82f)*glm::vec3(0.f, -1.f, 0.f);\n\t\t\t\tglm::vec3 tangentialGravityAcceleration = glm::dot(mg, eRoh)*eRoh;\n\t\t\t\tglm::vec3 tangentialSlidingFrictionDeceleration = muSliding*eFriction;\n\t\t\t\tglm::vec3 tangentialRollingFrictionDeceleration = muRolling*eFriction;\n\t\t\t\tglm::vec3 tangentialDelta = tangentialVelocity + (tangentialGravityAcceleration - tangentialSlidingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\tif (w * sphere.radius + 0.0001f < glm::length(tangentialVelocity)) {\n\t\t\t\t\t\/\/Rolling\n\t\t\t\t\tif (glm::length(tangentialGravityAcceleration) < glm::length(tangentialRollingFrictionDeceleration))\n\t\t\t\t\t\ttangentialRollingFrictionDeceleration = glm::length(tangentialGravityAcceleration)*eFriction;\n\t\t\t\t\tvelocity = tangentialVelocity - (tangentialGravityAcceleration + tangentialRollingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\t\tangularVelocity = (glm::length(velocity) \/ sphere.radius) * cross(eRoh,eFriction);\n\t\t\t\t} else {\n\t\t\t\t\t\/\/Sliding\n\t\t\t\t\tvelocity = tangentialVelocity - (tangentialGravityAcceleration - tangentialSlidingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\t\tangularVelocity += (5.f \/ 2.f) * (muSliding * 9.82f \/ sphere.radius * static_cast<float>(time)) * cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfloat deltaTime = pow(mass * mass \/ (fabs(vRoh) * sphere.radius), 0.2f) * 0.00251744f;\n\t\t\t\tfloat velocityRoh = glm::dot(velocity, eRoh);\n\t\t\t\tfloat velocityNormal = glm::dot(velocity, eFriction);\n\t\t\t\tfloat uRoh = -e*velocityRoh;\n\t\t\t\tfloat deltauRoh = uRoh - (velocityRoh);\n\t\t\t\tfloat deltaUn = muSliding*deltauRoh;\n\t\t\t\tfloat rollUn = (5.f \/ 7.f)*velocityNormal;\n\t\t\t\tfloat slideUn = velocityNormal - deltaUn;\n\n\t\t\t\tif (velocityNormal > rollUn){\n\t\t\t\t\tvelocity = uRoh*eRoh + rollUn*eFriction;\n\t\t\t\t\tangularVelocity += muRolling * (deltaU + 9.82f*eRoh.y * deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t} else {\n\t\t\t\t\tvelocity = uRoh*eRoh + slideUn*eFriction;\n\t\t\t\t\tangularVelocity += muSliding * (deltaU + 9.82f *eRoh.y* deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\t\/\/ Calculate magnus force.\n\t\t\tfloat v = glm::length(velocity);\n\t\t\tfloat u = glm::length(velocity - wind);\n\t\t\tfloat w = glm::length(angularVelocity);\n\t\t\tglm::vec3 eU = (velocity - wind) \/ u;\n\t\t\tmagnusForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f && v > 0.f && w > 0.f) {\n\t\t\t\tfloat Cm = (sqrt(1.f + 0.31f * (w \/ v)) - 1.f) \/ 20.f;\n\t\t\t\tfloat Fm = 0.5f * Cm * 1.23f * area * u * u;\n\t\t\t\tmagnusForce = Fm * glm::cross(eU, glm::normalize(angularVelocity));\n\t\t\t}\n\n\t\t\t\/\/ Calculate drag force.\n\t\t\tfloat cD;\n\t\t\tif (ballType == TWOPIECE)\n\t\t\t\tcD = v < 65.f ? -0.0051f * v + 0.53f : 0.21f;\n\t\t\telse\n\t\t\t\tcD = v < 60.f ? -0.0084f * v + 0.73f : 0.22f;\n\t\t\tdragForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f)\n\t\t\t\tdragForce = -0.5f * 1.23f * area * cD * u * u * eU;\n\t\t}\n\t\t\/\/ Calculate gravitational force.\n\t\tglm::vec3 gravitationForce = glm::vec3(0.f, mass * -9.82f, 0.f);\n\t\t\/\/ Get acceleration from total force.\n\t\tglm::vec3 acceleration = (dragForce + magnusForce + gravitationForce) \/ mass;\n\t\tvelocity += acceleration * static_cast<float>(time);\n\n\t}\n}\n\nvoid GolfBall::Render(Camera* camera, const glm::vec2& screenSize, const glm::vec4& clippingPlane) const{\n    if (state != GolfBall::EXPLODED && state != GolfBall::OUT)\n        ModelObject::Render(camera, screenSize, clippingPlane);\n}\n\nvoid GolfBall::Explode(std::vector<PlayerObject>& players){\n    \/\/@TODO: Set mass equivalent depending on material used.\n    float equivalenceFactor = 1.0f;\n    float massEquivalent = mass*equivalenceFactor;\n    for (auto &player : players){\n        glm::vec3 distanceV = (Position() - player.Position());\n        float distance = glm::length(distanceV); \n        \/\/pow(meq, 1.f\/3.f) => cube root of meq\n        float z = distance \/ (pow(massEquivalent, 1.f \/ 3.f));\n        float alpha = 1 + pow((z \/ 4.5f), 2.f);\n        float beta = 1 + pow((z \/ 0.048f), 2.f);\n        float gamma = 1 + pow((z \/ 1.35f), 2.f);\n        float delta = 1 + pow((z \/ 0.32f), 2.f);\n        \/\/float Pf = 8.08f*pow(10.f, 7.f)*alpha;\n\t\tfloat Pf = ((8.08e7)*alpha) \/ sqrt(beta*gamma*delta);\n        player.TakeDamage(Pf);\n    }\n    state = GolfBall::EXPLODED;\n}\n\nvoid GolfBall::Strike(ClubType club, const glm::vec3& clubVelocity) {\n    state = GolfBall::ACTIVE;\n    \n    \/\/ Club velocity in strike plane.\n    float v = glm::length(clubVelocity);\n    if (v > 0.f)\n    {\n        float sinLoft = sin(club.loft);\n        float cosLoft = cos(club.loft);\n        \n        \/\/ Ball velocity.\n        float massCoefficient = club.mass \/ (club.mass + mass);\n        float Up = (1.f + restitution) * massCoefficient * v * cosLoft;\n        float Un = (2.f \/ 7.f) * massCoefficient * v * sinLoft;\n        \n        \/\/ Go back from strike plane to 3D.\n        glm::vec3 forward = clubVelocity \/ v;\n        glm::vec3 up = glm::cross(forward, glm::cross(glm::vec3(0.f, 1.f, 0.f), forward));\n        glm::vec3 ep = glm::normalize(cosLoft * forward + sinLoft * up);\n        glm::vec3 en = glm::normalize(sinLoft * forward - cosLoft * up);\n        \n        \/\/ Total velocity.\n        velocity = Up * ep + Un * en;\n        angularVelocity = -Un \/ sphere.radius * glm::cross(ep, en);\n    } else {\n        velocity = glm::vec3(0.f, 0.f, 0.f);\n        angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    }\n}\n\nfloat GolfBall::Radius() const {\n    return sphere.radius;\n}\n\nvoid GolfBall::SetRadius(float radius) {\n    sphere.radius = radius;\n    SetScale(glm::vec3(radius, radius, radius));\n    area = glm::pi<float>() * radius * radius;\n}\n\nglm::mat4 GolfBall::Orientation() const {\n    return glm::toMat4(orientation);\n}\n\nGolfBall::State GolfBall::GetState() const {\n    return state;\n}\n<commit_msg>Fixed rolling and sliding<commit_after>#include \"GolfBall.hpp\"\n#include \"..\/Resources.hpp\"\n#include \"Default3D.vert.hpp\"\n#include \"Default3D.geom.hpp\"\n#include \"Default3D.frag.hpp\"\n#include \"glm\/gtc\/constants.hpp\"\n#include \"..\/Util\/Log.hpp\"\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/quaternion.hpp>\n\nGolfBall::GolfBall(BallType ballType, TerrainObject* terrain, Water* water) : ModelObject(modelGeometry = Resources().CreateOBJModel(\"Resources\/Models\/GolfBall\/GolfBall.obj\"),\n                                                                            \"Resources\/Models\/GolfBall\/Diffuse.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Normal.png\",\n                                                                            \"Resources\/Models\/GolfBall\/Specular.png\") {\n    state = GolfBall::INITIAL;\n    \n    restitution = ballType == TWOPIECE ? 0.78f : 0.68f;\n    this->terrain = terrain;\n    this->water = water;\n    origin = glm::vec3(1.f, 0.f, 1.f);\n    \n    mass = 0.0459f;\n    this->ballType = ballType;\n    \n    sphere.position = Position();\n    SetRadius(0.0214f);\n}\n\nGolfBall::~GolfBall() {\n    Resources().FreeOBJModel(modelGeometry);\n}\n\nvoid GolfBall::Reset(){\n    state = GolfBall::INITIAL;\n    velocity = glm::vec3(0.f, 0.f, 0.f);\n    angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    SetPosition(origin);\n    sphere.position = Position();\n    orientation = glm::quat();\n}\n\nvoid GolfBall::Update(double time, const glm::vec3& wind, std::vector<PlayerObject>& players) {\n\tif (state == GolfBall::ACTIVE) {\n\t\tMove(static_cast<float>(time)* velocity);\n\t\tsphere.position = Position();\n\n\t\tif (glm::length(angularVelocity) > 0.0001f) {\n\t\t\tglm::quat deltaQuat = glm::angleAxis(static_cast<float>(time)* glm::length(angularVelocity), glm::normalize(angularVelocity));\n\t\t\torientation = deltaQuat * orientation;\n\t\t}\n\n\t\tglm::vec3 dragForce, magnusForce, acceleration = glm::vec3(0.f, 0.f, 0.f);\n\n\t\tfloat groundLevel = terrain->GetY(Position().x, Position().z);\n        float waterLevel = water->Position().y;\n        \n        \/\/ Check if in water.\n        if ((sphere.position.y - sphere.radius < groundLevel && groundLevel + sphere.radius < waterLevel) || sphere.position.y + sphere.radius < waterLevel) {\n            state = GolfBall::OUT;\n            return;\n        }\n        \n        \/\/ Check for collision\n\t\tif (glm::length(velocity) > 0.0001f && (sphere.position.y - sphere.radius) < groundLevel){\n\t\t\tfloat vCritical = 0.3f;\n\t\t\tfloat e = 0.35f;\n\t\t\tfloat muSliding = 0.51f;\n\t\t\tfloat muRolling = 0.096f;\n\t\t\tSetPosition(Position().x, groundLevel + sphere.radius, Position().z);\n\t\t\tsphere.position = Position();\n\t\t\t\/\/glm::vec3 eRoh = glm::normalize(glm::vec3(0.f, 1.f, 0.f));\n\t\t\tglm::vec3 eRoh = terrain->GetNormal(Position().x, Position().z);\n\t\t\tglm::vec3 tangentialVelocity = velocity - glm::dot(velocity, eRoh) * eRoh;\n\t\t\tglm::vec3 eFriction = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (glm::length(glm::cross(eRoh, angularVelocity) + tangentialVelocity) > 0.0001f){\n\t\t\t\teFriction = glm::normalize(sphere.radius * glm::cross(eRoh, angularVelocity) + tangentialVelocity);\n\t\t\t}\n\t\t\tfloat vRoh = glm::dot(velocity, eRoh);\n\t\t\tfloat deltaU = -(e + 1.f) * vRoh;\n\t\t\tglm::vec3 angularDirection = glm::cross(eRoh, glm::normalize(tangentialVelocity));\n\t\t\tfloat w = glm::dot(angularVelocity, angularDirection);\n\n\t\t\tif (fabs(vRoh) < vCritical && glm::length(tangentialVelocity) > 0.0001f) {\n\t\t\t\tglm::vec3 mg = (9.82f)*glm::vec3(0.f, -1.f, 0.f);\n\t\t\t\tglm::vec3 tangentialGravityAcceleration = mg - glm::dot(mg, eRoh)*eRoh;\n\t\t\t\tglm::vec3 tangentialSlidingFrictionDeceleration = muSliding*eFriction;\n\t\t\t\tglm::vec3 tangentialRollingFrictionDeceleration = muRolling*eFriction;\n\t\t\t\tglm::vec3 tangentialDelta = tangentialVelocity + (tangentialGravityAcceleration - tangentialSlidingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\tif (w * sphere.radius + 0.0001f < glm::length(tangentialVelocity)) {\n\t\t\t\t\t\/\/Rolling\n\t\t\t\t\tif (glm::length(tangentialGravityAcceleration) < glm::length(tangentialRollingFrictionDeceleration))\n\t\t\t\t\t\ttangentialRollingFrictionDeceleration = glm::length(tangentialGravityAcceleration)*eFriction;\n\t\t\t\t\tvelocity = tangentialVelocity + (tangentialGravityAcceleration + tangentialRollingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\t\tangularVelocity = (glm::length(velocity) \/ sphere.radius) * cross(eRoh,eFriction);\n\t\t\t\t} else {\n\t\t\t\t\t\/\/Sliding\n\t\t\t\t\tvelocity = tangentialVelocity + (tangentialGravityAcceleration + tangentialSlidingFrictionDeceleration)*static_cast<float>(time);\n\t\t\t\t\tangularVelocity += (5.f \/ 2.f) * (muSliding * 9.82f \/ sphere.radius * static_cast<float>(time)) * cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfloat deltaTime = pow(mass * mass \/ (fabs(vRoh) * sphere.radius), 0.2f) * 0.00251744f;\n\t\t\t\tfloat velocityRoh = glm::dot(velocity, eRoh);\n\t\t\t\tfloat velocityNormal = glm::dot(velocity, eFriction);\n\t\t\t\tfloat uRoh = -e*velocityRoh;\n\t\t\t\tfloat deltauRoh = uRoh - (velocityRoh);\n\t\t\t\tfloat deltaUn = muSliding*deltauRoh;\n\t\t\t\tfloat rollUn = (5.f \/ 7.f)*velocityNormal;\n\t\t\t\tfloat slideUn = velocityNormal - deltaUn;\n\n\t\t\t\tif (velocityNormal > rollUn){\n\t\t\t\t\tvelocity = uRoh*eRoh + rollUn*eFriction;\n\t\t\t\t\tangularVelocity += muRolling * (deltaU + 9.82f*eRoh.y * deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t} else {\n\t\t\t\t\tvelocity = uRoh*eRoh + slideUn*eFriction;\n\t\t\t\t\tangularVelocity += muSliding * (deltaU + 9.82f *eRoh.y* deltaTime) \/ sphere.radius * glm::cross(eRoh, eFriction);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\t\/\/ Calculate magnus force.\n\t\t\tfloat v = glm::length(velocity);\n\t\t\tfloat u = glm::length(velocity - wind);\n\t\t\tfloat w = glm::length(angularVelocity);\n\t\t\tglm::vec3 eU = (velocity - wind) \/ u;\n\t\t\tmagnusForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f && v > 0.f && w > 0.f) {\n\t\t\t\tfloat Cm = (sqrt(1.f + 0.31f * (w \/ v)) - 1.f) \/ 20.f;\n\t\t\t\tfloat Fm = 0.5f * Cm * 1.23f * area * u * u;\n\t\t\t\tmagnusForce = Fm * glm::cross(eU, glm::normalize(angularVelocity));\n\t\t\t}\n\n\t\t\t\/\/ Calculate drag force.\n\t\t\tfloat cD;\n\t\t\tif (ballType == TWOPIECE)\n\t\t\t\tcD = v < 65.f ? -0.0051f * v + 0.53f : 0.21f;\n\t\t\telse\n\t\t\t\tcD = v < 60.f ? -0.0084f * v + 0.73f : 0.22f;\n\t\t\tdragForce = glm::vec3(0.f, 0.f, 0.f);\n\t\t\tif (u > 0.f)\n\t\t\t\tdragForce = -0.5f * 1.23f * area * cD * u * u * eU;\n\n\t\t\t\/\/ Calculate gravitational force.\n\t\t\tglm::vec3 gravitationForce = glm::vec3(0.f, mass * -9.82f, 0.f);\n\t\t\t\/\/ Get acceleration from total force.\n\t\t\tacceleration = (dragForce + magnusForce + gravitationForce) \/ mass;\n\t\t}\n\t\tvelocity += acceleration * static_cast<float>(time);\n\t}\n}\n\nvoid GolfBall::Render(Camera* camera, const glm::vec2& screenSize, const glm::vec4& clippingPlane) const{\n    if (state != GolfBall::EXPLODED && state != GolfBall::OUT)\n        ModelObject::Render(camera, screenSize, clippingPlane);\n}\n\nvoid GolfBall::Explode(std::vector<PlayerObject>& players){\n    \/\/@TODO: Set mass equivalent depending on material used.\n    float equivalenceFactor = 1.0f;\n    float massEquivalent = mass*equivalenceFactor;\n    for (auto &player : players){\n        glm::vec3 distanceV = (Position() - player.Position());\n        float distance = glm::length(distanceV); \n        \/\/pow(meq, 1.f\/3.f) => cube root of meq\n        float z = distance \/ (pow(massEquivalent, 1.f \/ 3.f));\n        float alpha = 1 + pow((z \/ 4.5f), 2.f);\n        float beta = 1 + pow((z \/ 0.048f), 2.f);\n        float gamma = 1 + pow((z \/ 1.35f), 2.f);\n        float delta = 1 + pow((z \/ 0.32f), 2.f);\n        \/\/float Pf = 8.08f*pow(10.f, 7.f)*alpha;\n\t\tfloat Pf = ((8.08e7)*alpha) \/ sqrt(beta*gamma*delta);\n        player.TakeDamage(Pf);\n    }\n    state = GolfBall::EXPLODED;\n}\n\nvoid GolfBall::Strike(ClubType club, const glm::vec3& clubVelocity) {\n    state = GolfBall::ACTIVE;\n    \n    \/\/ Club velocity in strike plane.\n    float v = glm::length(clubVelocity);\n    if (v > 0.f)\n    {\n        float sinLoft = sin(club.loft);\n        float cosLoft = cos(club.loft);\n        \n        \/\/ Ball velocity.\n        float massCoefficient = club.mass \/ (club.mass + mass);\n        float Up = (1.f + restitution) * massCoefficient * v * cosLoft;\n        float Un = (2.f \/ 7.f) * massCoefficient * v * sinLoft;\n        \n        \/\/ Go back from strike plane to 3D.\n        glm::vec3 forward = clubVelocity \/ v;\n        glm::vec3 up = glm::cross(forward, glm::cross(glm::vec3(0.f, 1.f, 0.f), forward));\n        glm::vec3 ep = glm::normalize(cosLoft * forward + sinLoft * up);\n        glm::vec3 en = glm::normalize(sinLoft * forward - cosLoft * up);\n        \n        \/\/ Total velocity.\n        velocity = Up * ep + Un * en;\n        angularVelocity = -Un \/ sphere.radius * glm::cross(ep, en);\n    } else {\n        velocity = glm::vec3(0.f, 0.f, 0.f);\n        angularVelocity = glm::vec3(0.f, 0.f, 0.f);\n    }\n}\n\nfloat GolfBall::Radius() const {\n    return sphere.radius;\n}\n\nvoid GolfBall::SetRadius(float radius) {\n    sphere.radius = radius;\n    SetScale(glm::vec3(radius, radius, radius));\n    area = glm::pi<float>() * radius * radius;\n}\n\nglm::mat4 GolfBall::Orientation() const {\n    return glm::toMat4(orientation);\n}\n\nGolfBall::State GolfBall::GetState() const {\n    return state;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#include <vector>\n#include <memory>\n#include <atomic>\n#include \"Fifo.hpp\"\n#include \"ThreadsCount.hpp\"\n#include \"JoiningThread.hpp\"\n#include \"detail\/Command.hpp\"\n\nnamespace But\n{\nnamespace Threading\n{\n\ntemplate<typename Policy>\nclass ThreadPool final\n{\npublic:\n  template<typename T>\n  using promise_type = typename Policy::template promise_type<T>;\n  using thread_type = typename Policy::thread_type;\n\n  explicit ThreadPool(const ThreadsCount tc):\n    quit_{false}\n  {\n    threads_.reserve( tc.count() );\n    for(ThreadsCount::value_type i=0; i < tc.count(); ++i)\n      threads_.emplace_back( &ThreadPool::processingLoop, this );\n  }\n\n  ~ThreadPool()\n  {\n    try\n    {\n      quit_ = true;\n      \/\/ unblock all threads, if needed\n      Queue::lock_type lock{q_};\n      for(ThreadsCount::value_type i=0; i < size(); ++i)\n        q_.push(Queue::value_type{});\n    }\n    catch(...)\n    {\n      BUT_ASSERT(!\"failed to stop thread - givin up...\");\n      abort();\n    }\n  }\n\n  template<typename F>\n  auto run(F f)\n  {\n    auto cmd = std::make_unique< detail::Task<F,Policy> >( std::move(f) );\n    auto fut = cmd->promise_.get_future();\n    {\n      const Queue::lock_type lock{q_};\n      q_.push( std::move(cmd) );\n    }\n    return fut;\n  }\n\n  auto size() const { return threads_.size(); }\n\nprivate:\n  auto getCommand()\n  {\n    Queue::lock_type lock{q_};\n    auto cmd = std::move( q_.top() );\n    q_.pop();\n    return cmd;\n  }\n\n  void processingLoop() noexcept\n  {\n    while(not quit_)\n    {\n      try\n      {\n        auto cmd = getCommand();\n        if(cmd)\n          cmd->run();\n      }\n      catch(...)\n      {\n        BUT_ASSERT(!\"unexpected exception from processing thread - this should never happen\");\n      }\n    }\n  }\n\n  using Queue = Fifo<std::unique_ptr<detail::Command>>;\n\n  Queue q_;\n  std::atomic<bool> quit_;\n  std::vector<JoiningThread<thread_type>> threads_;\n};\n\n}\n}\n<commit_msg>fixed usage that dependen on top() to block<commit_after>#pragma once\n#include <vector>\n#include <memory>\n#include <atomic>\n#include \"Fifo.hpp\"\n#include \"ThreadsCount.hpp\"\n#include \"JoiningThread.hpp\"\n#include \"detail\/Command.hpp\"\n\nnamespace But\n{\nnamespace Threading\n{\n\ntemplate<typename Policy>\nclass ThreadPool final\n{\npublic:\n  template<typename T>\n  using promise_type = typename Policy::template promise_type<T>;\n  using thread_type = typename Policy::thread_type;\n\n  explicit ThreadPool(const ThreadsCount tc):\n    quit_{false}\n  {\n    threads_.reserve( tc.count() );\n    for(ThreadsCount::value_type i=0; i < tc.count(); ++i)\n      threads_.emplace_back( &ThreadPool::processingLoop, this );\n  }\n\n  ~ThreadPool()\n  {\n    try\n    {\n      quit_ = true;\n      \/\/ unblock all threads, if needed\n      Queue::lock_type lock{q_};\n      for(ThreadsCount::value_type i=0; i < size(); ++i)\n        q_.push(Queue::value_type{});\n    }\n    catch(...)\n    {\n      BUT_ASSERT(!\"failed to stop thread - givin up...\");\n      abort();\n    }\n  }\n\n  template<typename F>\n  auto run(F f)\n  {\n    auto cmd = std::make_unique< detail::Task<F,Policy> >( std::move(f) );\n    auto fut = cmd->promise_.get_future();\n    {\n      const Queue::lock_type lock{q_};\n      q_.push( std::move(cmd) );\n    }\n    return fut;\n  }\n\n  auto size() const { return threads_.size(); }\n\nprivate:\n  auto getCommand()\n  {\n    Queue::lock_type lock{q_};\n    q_.waitForNonEmpty(lock);\n    auto cmd = std::move( q_.top() );\n    q_.pop();\n    return cmd;\n  }\n\n  void processingLoop() noexcept\n  {\n    while(not quit_)\n    {\n      try\n      {\n        auto cmd = getCommand();\n        if(cmd)\n          cmd->run();\n      }\n      catch(...)\n      {\n        BUT_ASSERT(!\"unexpected exception from processing thread - this should never happen\");\n      }\n    }\n  }\n\n  using Queue = Fifo<std::unique_ptr<detail::Command>>;\n\n  Queue q_;\n  std::atomic<bool> quit_;\n  std::vector<JoiningThread<thread_type>> threads_;\n};\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n===========================================================================\nCopyright (C) 2009 Robert Beckebans <trebor_7@users.sourceforge.net>\n\nThis file is part of Daemon source code.\n\nDaemon source code is free software; you can redistribute it\nand\/or modify it under the terms of the GNU General Public License as\npublished by the Free Software Foundation; either version 2 of the License,\nor (at your option) any later version.\n\nDaemon source code is distributed in the hope that it will be\nuseful, but 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 General Public License\nalong with Daemon source code; if not, write to the Free Software\nFoundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n===========================================================================\n*\/\n\/\/ tr_image_exr.c\n\n#ifdef __cplusplus\nextern \"C\"\n{\n#endif\n\/\/#include \"tr_local.h\"\n#include \"..\/qcommon\/q_shared.h\"\n#ifdef __cplusplus\n}\n#endif\n\n\/\/#include <OpenEXR\/half.h>\n#include \"..\/openexr\/half.h\"\n\n#ifdef __cplusplus\nextern          \"C\"\n{\n#endif\n\n\tvoid LoadRGBEToFloats( const char *name, float **pic, int *width, int *height, qboolean doGamma, qboolean toneMap, qboolean compensate );\n\n\tvoid LoadRGBEToHalfs( const char *name, unsigned short **halfImage, int *width, int *height )\n\t{\n\t\tint            i, j;\n\t\tint            w, h;\n\t\tfloat          *hdrImage;\n\t\tfloat          *floatbuf;\n\t\tunsigned short *halfbuf;\n\n#if 0\n\t\tw = h = 0;\n\t\tLoadRGBEToFloats( name, &hdrImage, &w, &h, qtrue, qtrue, qtrue );\n\n\t\t*width = w;\n\t\t*height = h;\n\n\t\t*ldrImage = ri.Malloc( w * h * 4 );\n\t\tpixbuf = *ldrImage;\n\n\t\tfloatbuf = hdrImage;\n\n\t\tfor ( i = 0; i < ( w * h ); i++ )\n\t\t{\n\t\t\tfor ( j = 0; j < 3; j++ )\n\t\t\t{\n\t\t\t\tsample[ j ] = *floatbuf++;\n\t\t\t}\n\n\t\t\tNormalizeColor( sample, sample );\n\n\t\t\t*pixbuf++ = ( byte )( sample[ 0 ] * 255 );\n\t\t\t*pixbuf++ = ( byte )( sample[ 1 ] * 255 );\n\t\t\t*pixbuf++ = ( byte )( sample[ 2 ] * 255 );\n\t\t\t*pixbuf++ = ( byte ) 255;\n\t\t}\n\n#else\n\t\tw = h = 0;\n\t\tLoadRGBEToFloats( name, &hdrImage, &w, &h, qtrue, qfalse, qtrue );\n\n\t\t*width = w;\n\t\t*height = h;\n\n\t\t*halfImage = ( unsigned short * ) Com_Allocate( w * h * 3 * 6 );\n\n\t\thalfbuf = *halfImage;\n\t\tfloatbuf = hdrImage;\n\n\t\tfor ( i = 0; i < ( w * h ); i++ )\n\t\t{\n\t\t\tfor ( j = 0; j < 3; j++ )\n\t\t\t{\n\t\t\t\thalf sample( *floatbuf++ );\n\t\t\t\t*halfbuf++ = sample.bits();\n\t\t\t}\n\t\t}\n\n#endif\n\n\t\tCom_Dealloc( hdrImage );\n\t}\n\n#ifdef __cplusplus\n}\n#endif\n<commit_msg>Update include path for openexr<commit_after>\/*\n===========================================================================\nCopyright (C) 2009 Robert Beckebans <trebor_7@users.sourceforge.net>\n\nThis file is part of Daemon source code.\n\nDaemon source code is free software; you can redistribute it\nand\/or modify it under the terms of the GNU General Public License as\npublished by the Free Software Foundation; either version 2 of the License,\nor (at your option) any later version.\n\nDaemon source code is distributed in the hope that it will be\nuseful, but 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 General Public License\nalong with Daemon source code; if not, write to the Free Software\nFoundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n===========================================================================\n*\/\n\/\/ tr_image_exr.c\n\n#ifdef __cplusplus\nextern \"C\"\n{\n#endif\n\/\/#include \"tr_local.h\"\n#include \"..\/qcommon\/q_shared.h\"\n#ifdef __cplusplus\n}\n#endif\n\n\/\/#include <OpenEXR\/half.h>\n#include \"..\/..\/openexr\/half.h\"\n\n#ifdef __cplusplus\nextern          \"C\"\n{\n#endif\n\n\tvoid LoadRGBEToFloats( const char *name, float **pic, int *width, int *height, qboolean doGamma, qboolean toneMap, qboolean compensate );\n\n\tvoid LoadRGBEToHalfs( const char *name, unsigned short **halfImage, int *width, int *height )\n\t{\n\t\tint            i, j;\n\t\tint            w, h;\n\t\tfloat          *hdrImage;\n\t\tfloat          *floatbuf;\n\t\tunsigned short *halfbuf;\n\n#if 0\n\t\tw = h = 0;\n\t\tLoadRGBEToFloats( name, &hdrImage, &w, &h, qtrue, qtrue, qtrue );\n\n\t\t*width = w;\n\t\t*height = h;\n\n\t\t*ldrImage = ri.Malloc( w * h * 4 );\n\t\tpixbuf = *ldrImage;\n\n\t\tfloatbuf = hdrImage;\n\n\t\tfor ( i = 0; i < ( w * h ); i++ )\n\t\t{\n\t\t\tfor ( j = 0; j < 3; j++ )\n\t\t\t{\n\t\t\t\tsample[ j ] = *floatbuf++;\n\t\t\t}\n\n\t\t\tNormalizeColor( sample, sample );\n\n\t\t\t*pixbuf++ = ( byte )( sample[ 0 ] * 255 );\n\t\t\t*pixbuf++ = ( byte )( sample[ 1 ] * 255 );\n\t\t\t*pixbuf++ = ( byte )( sample[ 2 ] * 255 );\n\t\t\t*pixbuf++ = ( byte ) 255;\n\t\t}\n\n#else\n\t\tw = h = 0;\n\t\tLoadRGBEToFloats( name, &hdrImage, &w, &h, qtrue, qfalse, qtrue );\n\n\t\t*width = w;\n\t\t*height = h;\n\n\t\t*halfImage = ( unsigned short * ) Com_Allocate( w * h * 3 * 6 );\n\n\t\thalfbuf = *halfImage;\n\t\tfloatbuf = hdrImage;\n\n\t\tfor ( i = 0; i < ( w * h ); i++ )\n\t\t{\n\t\t\tfor ( j = 0; j < 3; j++ )\n\t\t\t{\n\t\t\t\thalf sample( *floatbuf++ );\n\t\t\t\t*halfbuf++ = sample.bits();\n\t\t\t}\n\t\t}\n\n#endif\n\n\t\tCom_Dealloc( hdrImage );\n\t}\n\n#ifdef __cplusplus\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * jcom.param - clipping and range methods\n * By Tim Place, Copyright � 2006\n * Nils Peters:  added Clip and Wrap method\n *\n * License: This code is licensed under the terms of the \"New BSD License\"\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"jcom.parameter.h\"\t\t\/\/ everything we need is in here\n#include \"TTAudioObject.h\"\t\/\/ use the ttblue clipping functions\n\n\n\/\/ Attempt to limit the range of values on generic input\nbool param_clip_generic(t_param *x)\n{\n\tif (x->list_size > 1)\n\t\treturn param_clip_list(x);\n\telse if (x->atom_list[0].a_type == A_LONG)\n\t\treturn param_clip_int(x);\n\telse if (x->atom_list[0].a_type == A_FLOAT)\n\t\treturn param_clip_float(x);\n\telse\n\t\treturn false;\n}\n\n\n\/\/ range limiting on int input\nbool param_clip_int(t_param *x)\n{\n\tlong val = atom_getlong(&x->attr_value);\n\tlong clipped = val;\n\tbool  reportClipping = true;\n\n\tif (x->common.attr_clipmode == jps_low)\n\t\tTTLimitMin(clipped, (long)x->common.attr_range[0]);\n\telse if (x->common.attr_clipmode == jps_high)\n\t\tTTLimitMax(clipped, (long)x->common.attr_range[1]);\n\telse if (x->common.attr_clipmode == jps_both)\n\t\tTTLimit(clipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\telse if (x->common.attr_clipmode == jps_wrap){\n\t\tclipped = TTInfWrap(clipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\treportClipping = false;\n\t}\n\telse if (x->common.attr_clipmode == jps_fold){\n\t\tclipped = TTFold(clipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\treportClipping = false;\n\t}\t\n\t\n\tatom_setlong(&x->attr_value, clipped); \/\/ must be set for all cases to cast the jps_none type correctly too\n\t\n\tif (reportClipping and (clipped != val))\n\t\treturn true;\n\telse \n\t\treturn false;\n}\n\n\n\/\/ range limiting on float input\nbool param_clip_float(t_param *x)\n{\n\tfloat val = atom_getfloat(&x->attr_value);\n\tfloat clipped = val;\t\n\tbool  reportClipping = true;\n\n\tif (x->common.attr_clipmode == jps_low)\n\t\tTTLimitMin(clipped, x->common.attr_range[0]);\n\telse if (x->common.attr_clipmode == jps_high)\n\t\tTTLimitMax(clipped, x->common.attr_range[1]);\n\telse if (x->common.attr_clipmode == jps_both)\n\t\tTTLimit(clipped, x->common.attr_range[0], x->common.attr_range[1]);\n\telse if (x->common.attr_clipmode == jps_wrap){\n\t\tclipped = TTInfWrap(clipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\treportClipping = false;\n\t}\n\telse if (x->common.attr_clipmode == jps_fold){\n\t\tclipped = TTFold(clipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\treportClipping = false;\n\t}\n\t\n\tatom_setfloat(&x->attr_value, clipped); \/\/ must be set for all cases to cast the jps_none type correctly too\n\t\n\t\/\/ cannot just compare the two floats here, unfortunately, because of rounding errors from the clipping functions [TAP]\n\tif (reportClipping and (fabs(clipped-val) > 0.0001))\n\t\treturn true; \/\/ did clip\n\telse\n\t\treturn false; \/\/ did not clip, or difference was so small that we assume we didn't.\n}\n\n\n\/\/ range limiting on list input\nbool param_clip_list(t_param *x)\n{\n\tshort i;\n\tfloat fclipped;\n\tlong iclipped;\n\t\/\/bool didClipAll = false;\n\t\n\t\/\/ the code regarding didClipAll is supposed to return true when every member of the list has been clipped to its limit\n\t\/\/ that way ramping can be terminated prematurely if it was trying to ramp to something out of range\n\t\/\/ however, this code as it is doesn't work, and it doesn't buy us much anyway\n\t\/\/ so I'm just commenting it out for the time being [TAP]\n\t\n\tfor (i=0; i < x->list_size; i++) {\n\t\tif (x->atom_list[i].a_type == A_LONG) {\n\t\t\ticlipped = x->atom_list[i].a_w.w_long;\n\t\t\tif (x->common.attr_clipmode == jps_low)\n\t\t\t\tTTLimitMin(iclipped, (long)x->common.attr_range[0]);\n\t\t\telse if (x->common.attr_clipmode == jps_high)\n\t\t\t\tTTLimitMax(iclipped, (long)x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_both)\n\t\t\t\tTTLimit(iclipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_wrap)\n\t\t\t\ticlipped = TTInfWrap(iclipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_fold)\n\t\t\t\ticlipped = TTFold(iclipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\t\t\n\t\t\t\/\/if (didClipAll && !(iclipped == x->atom_list[i].a_w.w_long))\n\t\t\t\/\/ didClipAll = false;\n\t\t\tx->atom_list[i].a_w.w_long = iclipped;\n\t\t}\n\t\telse if (x->atom_list[i].a_type == A_FLOAT) {\n\t\t\tfclipped = x->atom_list[i].a_w.w_float;\n\t\t\tif (x->common.attr_clipmode == jps_low)\n\t\t\t\tTTLimitMin(fclipped, x->common.attr_range[0]);\n\t\t\telse if (x->common.attr_clipmode == jps_high)\n\t\t\t\tTTLimitMax(fclipped, x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_both)\n\t\t\t\tTTLimit(fclipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_wrap)\n\t\t\t\tfclipped = TTInfWrap(fclipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_fold)\n\t\t\t\tfclipped = TTFold(fclipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\t\t\n\t\t\t\/\/if (didClipAll && !(fclipped == x->atom_list[i].a_w.w_float))\n\t\t\t\/\/ didClipAll = false;\n\t\t\tx->atom_list[i].a_w.w_float = fclipped;\n\t\t}\n\t}\n\t\/\/return didClipAll;\n\treturn false;\n}\n\n<commit_msg>Clipping tests need to be performed on x->attr_valueTemp\/x->atom_listTemp rather than x->attr_value\/x->atom_list<commit_after>\/* \n * jcom.param - clipping and range methods\n * By Tim Place, Copyright � 2006\n * Nils Peters:  added Clip and Wrap method\n *\n * License: This code is licensed under the terms of the \"New BSD License\"\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"jcom.parameter.h\"\t\t\/\/ everything we need is in here\n#include \"TTAudioObject.h\"\t\/\/ use the ttblue clipping functions\n\n\n\/\/ Attempt to limit the range of values on generic input\nbool param_clip_generic(t_param *x)\n{\n\tif (x->list_size > 1)\n\t\treturn param_clip_list(x);\n\telse if (x->atom_listTemp[0].a_type == A_LONG)\n\t\treturn param_clip_int(x);\n\telse if (x->atom_listTemp[0].a_type == A_FLOAT)\n\t\treturn param_clip_float(x);\n\telse\n\t\treturn false;\n}\n\n\n\/\/ range limiting on int input\nbool param_clip_int(t_param *x)\n{\n\tlong val = atom_getlong(&x->attr_valueTemp);\n\tlong clipped = val;\n\tbool  reportClipping = true;\n\n\tif (x->common.attr_clipmode == jps_low)\n\t\tTTLimitMin(clipped, (long)x->common.attr_range[0]);\n\telse if (x->common.attr_clipmode == jps_high)\n\t\tTTLimitMax(clipped, (long)x->common.attr_range[1]);\n\telse if (x->common.attr_clipmode == jps_both)\n\t\tTTLimit(clipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\telse if (x->common.attr_clipmode == jps_wrap){\n\t\tclipped = TTInfWrap(clipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\treportClipping = false;\n\t}\n\telse if (x->common.attr_clipmode == jps_fold){\n\t\tclipped = TTFold(clipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\treportClipping = false;\n\t}\t\n\t\n\tatom_setlong(&x->attr_valueTemp, clipped); \/\/ must be set for all cases to cast the jps_none type correctly too\n\t\n\tif (reportClipping and (clipped != val))\n\t\treturn true;\n\telse \n\t\treturn false;\n}\n\n\n\/\/ range limiting on float input\nbool param_clip_float(t_param *x)\n{\n\tfloat val = atom_getfloat(&x->attr_valueTemp);\n\tfloat clipped = val;\t\n\tbool  reportClipping = true;\n\n\tif (x->common.attr_clipmode == jps_low)\n\t\tTTLimitMin(clipped, x->common.attr_range[0]);\n\telse if (x->common.attr_clipmode == jps_high)\n\t\tTTLimitMax(clipped, x->common.attr_range[1]);\n\telse if (x->common.attr_clipmode == jps_both)\n\t\tTTLimit(clipped, x->common.attr_range[0], x->common.attr_range[1]);\n\telse if (x->common.attr_clipmode == jps_wrap){\n\t\tclipped = TTInfWrap(clipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\treportClipping = false;\n\t}\n\telse if (x->common.attr_clipmode == jps_fold){\n\t\tclipped = TTFold(clipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\treportClipping = false;\n\t}\n\t\n\tatom_setfloat(&x->attr_valueTemp, clipped); \/\/ must be set for all cases to cast the jps_none type correctly too\n\t\n\t\/\/ cannot just compare the two floats here, unfortunately, because of rounding errors from the clipping functions [TAP]\n\tif (reportClipping and (fabs(clipped-val) > 0.0001))\n\t\treturn true; \/\/ did clip\n\telse\n\t\treturn false; \/\/ did not clip, or difference was so small that we assume we didn't.\n}\n\n\n\/\/ range limiting on list input\nbool param_clip_list(t_param *x)\n{\n\tshort i;\n\tfloat fclipped;\n\tlong iclipped;\n\t\/\/bool didClipAll = false;\n\t\n\t\/\/ the code regarding didClipAll is supposed to return true when every member of the list has been clipped to its limit\n\t\/\/ that way ramping can be terminated prematurely if it was trying to ramp to something out of range\n\t\/\/ however, this code as it is doesn't work, and it doesn't buy us much anyway\n\t\/\/ so I'm just commenting it out for the time being [TAP]\n\t\n\tfor (i=0; i < x->list_size; i++) {\n\t\tif (x->atom_listTemp[i].a_type == A_LONG) {\n\t\t\ticlipped = x->atom_listTemp[i].a_w.w_long;\n\t\t\tif (x->common.attr_clipmode == jps_low)\n\t\t\t\tTTLimitMin(iclipped, (long)x->common.attr_range[0]);\n\t\t\telse if (x->common.attr_clipmode == jps_high)\n\t\t\t\tTTLimitMax(iclipped, (long)x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_both)\n\t\t\t\tTTLimit(iclipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_wrap)\n\t\t\t\ticlipped = TTInfWrap(iclipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_fold)\n\t\t\t\ticlipped = TTFold(iclipped, (long)x->common.attr_range[0], (long)x->common.attr_range[1]);\n\t\t\t\n\t\t\t\/\/if (didClipAll && !(iclipped == x->atom_listTemp[i].a_w.w_long))\n\t\t\t\/\/ didClipAll = false;\n\t\t\tx->atom_listTemp[i].a_w.w_long = iclipped;\n\t\t}\n\t\telse if (x->atom_listTemp[i].a_type == A_FLOAT) {\n\t\t\tfclipped = x->atom_listTemp[i].a_w.w_float;\n\t\t\tif (x->common.attr_clipmode == jps_low)\n\t\t\t\tTTLimitMin(fclipped, x->common.attr_range[0]);\n\t\t\telse if (x->common.attr_clipmode == jps_high)\n\t\t\t\tTTLimitMax(fclipped, x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_both)\n\t\t\t\tTTLimit(fclipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_wrap)\n\t\t\t\tfclipped = TTInfWrap(fclipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\t\telse if (x->common.attr_clipmode == jps_fold)\n\t\t\t\tfclipped = TTFold(fclipped, x->common.attr_range[0], x->common.attr_range[1]);\n\t\t\t\n\t\t\t\/\/if (didClipAll && !(fclipped == x->atom_listTemp[i].a_w.w_float))\n\t\t\t\/\/ didClipAll = false;\n\t\t\tx->atom_listTemp[i].a_w.w_float = fclipped;\n\t\t}\n\t}\n\t\/\/return didClipAll;\n\treturn false;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/HierarchicalEA.hpp\"\n#include \"..\/..\/exception\/MismatchedCountsException.hpp\"\n\ntemplate <typename NodeType, typename... params>\nvoid HierarchicalEA::addConstructiveTree(\n\tPopulationFormula * formula,\n\tstd::vector<std::vector<Locus*>> contextLoci,\n\tstd::vector<ToStringFunction*> toStrings,\n\tstd::vector<std::vector<EndCondition*>> conditions,\n\tTreeBuilder treeSpec,\n\tstd::vector<bool> print,\n\tstd::vector<bool> end,\n\tparams... as\n) {\n\tthis->addConstructiveTree<NodeType>(\n\t\tformula,\n\t\tcontextLoci,\n\t\tstd::vector<std::vector<ObjectiveFunction*>>(\n\t\t\ttreeSpec.numLevels(),\n\t\t\tstd::vector<ObjectiveFunction*>()\n\t\t),\n\t\ttoStrings,\n\t\tconditions,\n\t\ttreeSpec,\n\t\tprint,\n\t\tend,\n\t\tas...\n\t);\n}\n\ntemplate <typename NodeType, typename... params>\nvoid HierarchicalEA::addConstructiveTree(\n\tPopulationFormula * formula,\n\tstd::vector<std::vector<Locus*>> contextLoci,\n\tObjectiveFunction * globalObjective,\n\tstd::vector<ToStringFunction*> toStrings,\n\tstd::vector<std::vector<EndCondition*>> conditions,\n\tTreeBuilder treeSpec,\n\tstd::vector<bool> print,\n\tstd::vector<bool> end,\n\tparams... as\n) {\n\tthis->addConstructiveTree<NodeType>(\n\t\tformula,\n\t\tcontextLoci,\n\t\tstd::vector<std::vector<ObjectiveFunction*>>(\n\t\t\ttreeSpec.numLevels(),\n\t\t\tstd::vector<ObjectiveFunction*>(1, globalObjective)\n\t\t),\n\t\ttoStrings,\n\t\tconditions,\n\t\ttreeSpec,\n\t\tprint,\n\t\tend,\n\t\tas...\n\t);\n}\n\ntemplate <typename NodeType, typename... params>\nvoid HierarchicalEA::addConstructiveTree(\n\tPopulationFormula * formula,\n\tstd::vector<std::vector<Locus*>> contextLoci,\n\tstd::vector<std::vector<ObjectiveFunction*>> objectives,\n\tstd::vector<ToStringFunction*> toStrings,\n\tstd::vector<std::vector<EndCondition*>> conditions,\n\tTreeBuilder treeSpec,\n\tstd::vector<bool> print,\n\tstd::vector<bool> end,\n\tparams... as\n) {\n\tstd::vector<unsigned int> counts = treeSpec.getLevelSizes();\n\n\tthis->addConstructiveTree<NodeType>(\n\t\tformula,\n\t\tthis->wrapForPass(contextLoci, counts),\n\t\tthis->wrapForPass(objectives, counts),\n\t\tthis->wrapForPass(toStrings, counts),\n\t\tthis->wrapForPass(conditions, counts),\n\t\ttreeSpec,\n\t\tthis->wrapForPass(print, counts),\n\t\tthis->wrapForPass(end, counts),\n\t\tas...\n\t);\n}\n\ntemplate <typename NodeType, typename... params>\nvoid HierarchicalEA::addConstructiveTree(\n\tPopulationFormula * formula,\n\tstd::vector<std::vector<std::vector<Locus*>>> contextLoci,\n\tstd::vector<std::vector<std::vector<ObjectiveFunction*>>> objectives,\n\tstd::vector<std::vector<ToStringFunction*>> toStrings,\n\tstd::vector<std::vector<std::vector<EndCondition*>>> conditions,\n\tTreeBuilder treeSpec,\n\tstd::vector<std::vector<bool>> print,\n\tstd::vector<std::vector<bool>> end,\n\tparams... as\n) {\n\tif (!this->compareVectorLengths(\n\t\tcontextLoci,\n\t\tobjectives,\n\t\ttoStrings,\n\t\tconditions,\n\t\tprint,\n\t\tend,\n\t\ttreeSpec.getLevelSizes()\n\t)) throw MismatchedCountsException();\n\n\tstd::vector<PopulationNode*> previousLevelNodes, currentLevelNodes;\n\tstd::vector<Locus*> nodeLoci;\n\tfor (unsigned int i = treeSpec.numLevels() - 1; i >= 0; i++) {\n\t\tstd::vector<std::string> names = treeSpec.getLevel(i);\n\t\tstd::vector<unsigned int> counts = treeSpec.getLevelCounts(i);\n\t\tunsigned int currentOffset = 0;\n\n\t\tif (!this->compareVectorLengths(\n\t\t\tcontextLoci[i],\n\t\t\tobjectives[i],\n\t\t\ttoStrings[i],\n\t\t\tconditions[i],\n\t\t\tnames,\n\t\t\tprint[i],\n\t\t\tend[i]\n\t\t)) throw MismatchedCountsException();\n\n\t\tfor (unsigned int k = 0; k < names.size(); k++) {\n\t\t\tnodeLoci.clear();\n\t\t\tfor (unsigned int c = 0; c < counts[k]; c++)\n\t\t\t\tnodeLoci.push_back(new PopulationLocus(\n\t\t\t\t\tpreviousLevelNodes[currentOffset++]\n\t\t\t\t));\n\t\t\tnodeLoci.insert(\n\t\t\t\tnodeLoci.end(),\n\t\t\t\tcontextLoci[i][k].begin(),\n\t\t\t\tcontextLoci[i][k].end()\n\t\t\t);\n\n\t\t\tcurrentLevelNodes.push_back(\n\t\t\t\tPopulationNodeFactory::createNode<NodeType>(\n\t\t\t\t\tformula->getPopulationSize(\n\t\t\t\t\t\tnodeLoci.size()\n\t\t\t\t\t),\n\t\t\t\t\tnodeLoci,\n\t\t\t\t\tobjectives[i][k],\n\t\t\t\t\ttoStrings[i][k],\n\t\t\t\t\tconditions[i][k],\n\t\t\t\t\tnames[i][k],\n\t\t\t\t\t1,\n\t\t\t\t\tas...\n\t\t\t\t)\n\t\t\t);\n\t\t}\n\t\tthis->addNodes(currentLevelNodes, print[i], end[i]);\n\t\tpreviousLevelNodes = currentLevelNodes;\n\t\tcurrentLevelNodes.clear();\n\t}\n}\n<commit_msg>[HierEA Tree Factory]: Fixed bad function argument<commit_after>#include \"..\/HierarchicalEA.hpp\"\n#include \"..\/..\/exception\/MismatchedCountsException.hpp\"\n\ntemplate <typename NodeType, typename... params>\nvoid HierarchicalEA::addConstructiveTree(\n\tPopulationFormula * formula,\n\tstd::vector<std::vector<Locus*>> contextLoci,\n\tstd::vector<ToStringFunction*> toStrings,\n\tstd::vector<std::vector<EndCondition*>> conditions,\n\tTreeBuilder treeSpec,\n\tstd::vector<bool> print,\n\tstd::vector<bool> end,\n\tparams... as\n) {\n\tthis->addConstructiveTree<NodeType>(\n\t\tformula,\n\t\tcontextLoci,\n\t\tstd::vector<std::vector<ObjectiveFunction*>>(\n\t\t\ttreeSpec.numLevels(),\n\t\t\tstd::vector<ObjectiveFunction*>()\n\t\t),\n\t\ttoStrings,\n\t\tconditions,\n\t\ttreeSpec,\n\t\tprint,\n\t\tend,\n\t\tas...\n\t);\n}\n\ntemplate <typename NodeType, typename... params>\nvoid HierarchicalEA::addConstructiveTree(\n\tPopulationFormula * formula,\n\tstd::vector<std::vector<Locus*>> contextLoci,\n\tObjectiveFunction * globalObjective,\n\tstd::vector<ToStringFunction*> toStrings,\n\tstd::vector<std::vector<EndCondition*>> conditions,\n\tTreeBuilder treeSpec,\n\tstd::vector<bool> print,\n\tstd::vector<bool> end,\n\tparams... as\n) {\n\tthis->addConstructiveTree<NodeType>(\n\t\tformula,\n\t\tcontextLoci,\n\t\tstd::vector<std::vector<ObjectiveFunction*>>(\n\t\t\ttreeSpec.numLevels(),\n\t\t\tstd::vector<ObjectiveFunction*>(1, globalObjective)\n\t\t),\n\t\ttoStrings,\n\t\tconditions,\n\t\ttreeSpec,\n\t\tprint,\n\t\tend,\n\t\tas...\n\t);\n}\n\ntemplate <typename NodeType, typename... params>\nvoid HierarchicalEA::addConstructiveTree(\n\tPopulationFormula * formula,\n\tstd::vector<std::vector<Locus*>> contextLoci,\n\tstd::vector<std::vector<ObjectiveFunction*>> objectives,\n\tstd::vector<ToStringFunction*> toStrings,\n\tstd::vector<std::vector<EndCondition*>> conditions,\n\tTreeBuilder treeSpec,\n\tstd::vector<bool> print,\n\tstd::vector<bool> end,\n\tparams... as\n) {\n\tstd::vector<unsigned int> counts = treeSpec.getLevelSizes();\n\n\tthis->addConstructiveTree<NodeType>(\n\t\tformula,\n\t\tthis->wrapForPass(contextLoci, counts),\n\t\tthis->wrapForPass(objectives, counts),\n\t\tthis->wrapForPass(toStrings, counts),\n\t\tthis->wrapForPass(conditions, counts),\n\t\ttreeSpec,\n\t\tthis->wrapForPass(print, counts),\n\t\tthis->wrapForPass(end, counts),\n\t\tas...\n\t);\n}\n\ntemplate <typename NodeType, typename... params>\nvoid HierarchicalEA::addConstructiveTree(\n\tPopulationFormula * formula,\n\tstd::vector<std::vector<std::vector<Locus*>>> contextLoci,\n\tstd::vector<std::vector<std::vector<ObjectiveFunction*>>> objectives,\n\tstd::vector<std::vector<ToStringFunction*>> toStrings,\n\tstd::vector<std::vector<std::vector<EndCondition*>>> conditions,\n\tTreeBuilder treeSpec,\n\tstd::vector<std::vector<bool>> print,\n\tstd::vector<std::vector<bool>> end,\n\tparams... as\n) {\n\tif (!this->compareVectorLengths(\n\t\tcontextLoci,\n\t\tobjectives,\n\t\ttoStrings,\n\t\tconditions,\n\t\tprint,\n\t\tend,\n\t\ttreeSpec.getLevelSizes()\n\t)) throw MismatchedCountsException();\n\n\tstd::vector<PopulationNode*> previousLevelNodes, currentLevelNodes;\n\tstd::vector<Locus*> nodeLoci;\n\tfor (unsigned int i = treeSpec.numLevels() - 1; i >= 0; i++) {\n\t\tstd::vector<std::string> names = treeSpec.getLevel(i);\n\t\tstd::vector<unsigned int> counts = treeSpec.getLevelCounts(i);\n\t\tunsigned int currentOffset = 0;\n\n\t\tif (!this->compareVectorLengths(\n\t\t\tcontextLoci[i],\n\t\t\tobjectives[i],\n\t\t\ttoStrings[i],\n\t\t\tconditions[i],\n\t\t\tnames,\n\t\t\tprint[i],\n\t\t\tend[i]\n\t\t)) throw MismatchedCountsException();\n\n\t\tfor (unsigned int k = 0; k < names.size(); k++) {\n\t\t\tnodeLoci.clear();\n\t\t\tfor (unsigned int c = 0; c < counts[k]; c++)\n\t\t\t\tnodeLoci.push_back(new PopulationLocus(\n\t\t\t\t\tpreviousLevelNodes[currentOffset++]\n\t\t\t\t));\n\t\t\tnodeLoci.insert(\n\t\t\t\tnodeLoci.end(),\n\t\t\t\tcontextLoci[i][k].begin(),\n\t\t\t\tcontextLoci[i][k].end()\n\t\t\t);\n\n\t\t\tcurrentLevelNodes.push_back(\n\t\t\t\tPopulationNodeFactory::createNode<NodeType>(\n\t\t\t\t\tformula->getPopulationSize(\n\t\t\t\t\t\tnodeLoci.size()\n\t\t\t\t\t),\n\t\t\t\t\tnodeLoci,\n\t\t\t\t\tobjectives[i][k],\n\t\t\t\t\ttoStrings[i][k],\n\t\t\t\t\tconditions[i][k],\n\t\t\t\t\tnames[k],\n\t\t\t\t\t1,\n\t\t\t\t\tas...\n\t\t\t\t)\n\t\t\t);\n\t\t}\n\t\tthis->addNodes(currentLevelNodes, print[i], end[i]);\n\t\tpreviousLevelNodes = currentLevelNodes;\n\t\tcurrentLevelNodes.clear();\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015-2019 Elviss Strazdins. All rights reserved.\n\n#include \"Mixer.hpp\"\n#include \"Bus.hpp\"\n#include \"Data.hpp\"\n#include \"Stream.hpp\"\n#include \"math\/MathUtils.hpp\"\n#include \"utils\/Utils.hpp\"\n\nnamespace ouzel\n{\n    namespace audio\n    {\n        namespace mixer\n        {\n            Mixer::Mixer(uint32_t initBufferSize,\n                         uint16_t initChannels,\n                         const std::function<void(const Event&)>& initCallback):\n                bufferSize(initBufferSize),\n                channels(initChannels),\n                callback(initCallback),\n                buffer(initBufferSize * 3, initChannels),\n                mixerThread(&Mixer::main, this)\n            {\n                \/\/setThreadPriority(mixerThread, 20.0F, true);\n            }\n\n            void Mixer::process()\n            {\n                CommandBuffer commandBuffer;\n                std::unique_ptr<Command> command;\n\n                for (;;)\n                {\n                    std::unique_lock<std::mutex> lock(commandQueueMutex);\n                    if (commandQueue.empty()) break;\n                    commandBuffer = std::move(commandQueue.front());\n                    commandQueue.pop();\n                    lock.unlock();\n\n                    while (!commandBuffer.isEmpty())\n                    {\n                        command = commandBuffer.popCommand();\n\n                        switch (command->type)\n                        {\n                            case Command::Type::DELETE_OBJECT:\n                            {\n                                auto deleteObjectCommand = static_cast<const DeleteObjectCommand*>(command.get());\n                                objects[deleteObjectCommand->objectId - 1].reset();\n                                break;\n                            }\n                            case Command::Type::INIT_BUS:\n                            {\n                                auto initBusCommand = static_cast<const InitBusCommand*>(command.get());\n\n                                if (initBusCommand->busId > objects.size())\n                                    objects.resize(initBusCommand->busId);\n\n                                objects[initBusCommand->busId - 1].reset(new Bus());\n                                break;\n                            }\n                            case Command::Type::SET_BUS_OUTPUT:\n                            {\n                                auto setBusOutputCommand = static_cast<const SetBusOutputCommand*>(command.get());\n\n                                Bus* bus = static_cast<Bus*>(objects[setBusOutputCommand->busId - 1].get());\n                                bus->setOutput(setBusOutputCommand->outputBusId ? static_cast<Bus*>(objects[setBusOutputCommand->outputBusId - 1].get()) : nullptr);\n                                break;\n                            }\n                            case Command::Type::ADD_PROCESSOR:\n                            {\n                                auto addProcessorCommand = static_cast<const AddProcessorCommand*>(command.get());\n\n                                Bus* bus = static_cast<Bus*>(objects[addProcessorCommand->busId - 1].get());\n                                Processor* processor = static_cast<Processor*>(objects[addProcessorCommand->processorId - 1].get());\n                                bus->addProcessor(processor);\n                                break;\n                            }\n                            case Command::Type::REMOVE_PROCESSOR:\n                            {\n                                auto removeProcessorCommand = static_cast<const RemoveProcessorCommand*>(command.get());\n\n                                Bus* bus = static_cast<Bus*>(objects[removeProcessorCommand->busId - 1].get());\n                                Processor* processor = static_cast<Processor*>(objects[removeProcessorCommand->processorId - 1].get());\n                                bus->removeProcessor(processor);\n                                break;\n                            }\n                            case Command::Type::SET_MASTER_BUS:\n                            {\n                                auto setMasterBusCommand = static_cast<const SetMasterBusCommand*>(command.get());\n\n                                masterBus = setMasterBusCommand->busId ? static_cast<Bus*>(objects[setMasterBusCommand->busId - 1].get()) : nullptr;\n                                break;\n                            }\n                            case Command::Type::INIT_STREAM:\n                            {\n                                auto initStreamCommand = static_cast<const InitStreamCommand*>(command.get());\n\n                                if (initStreamCommand->streamId > objects.size())\n                                    objects.resize(initStreamCommand->streamId);\n\n                                Data* data = static_cast<Data*>(objects[initStreamCommand->dataId - 1].get());\n                                objects[initStreamCommand->streamId - 1] = data->createStream();\n                                break;\n                            }\n                            case Command::Type::PLAY_STREAM:\n                            {\n                                auto playStreamCommand = static_cast<const PlayStreamCommand*>(command.get());\n\n                                Stream* stream = static_cast<Stream*>(objects[playStreamCommand->streamId - 1].get());\n                                stream->play();\n                                break;\n                            }\n                            case Command::Type::STOP_STREAM:\n                            {\n                                auto stopStreamCommand = static_cast<const StopStreamCommand*>(command.get());\n\n                                Stream* stream = static_cast<Stream*>(objects[stopStreamCommand->streamId - 1].get());\n                                stream->stop(stopStreamCommand->reset);\n                                break;\n                            }\n                            case Command::Type::SET_STREAM_OUTPUT:\n                            {\n                                auto setStreamOutputCommand = static_cast<const SetStreamOutputCommand*>(command.get());\n\n                                Stream* stream = static_cast<Stream*>(objects[setStreamOutputCommand->streamId - 1].get());\n                                stream->setOutput(setStreamOutputCommand->busId ? static_cast<Bus*>(objects[setStreamOutputCommand->busId - 1].get()) : nullptr);\n                                break;\n                            }\n                            case Command::Type::INIT_DATA:\n                            {\n                                auto initDataCommand = static_cast<const InitDataCommand*>(command.get());\n\n                                if (initDataCommand->dataId > objects.size())\n                                    objects.resize(initDataCommand->dataId);\n\n                                objects[initDataCommand->dataId - 1] = initDataCommand->initFunction();\n                                break;\n                            }\n                            case Command::Type::INIT_PROCESSOR:\n                            {\n                                auto initProcessorCommand = static_cast<InitProcessorCommand*>(command.get());\n\n                                if (initProcessorCommand->processorId > objects.size())\n                                    objects.resize(initProcessorCommand->processorId);\n\n                                objects[initProcessorCommand->processorId - 1] = std::move(initProcessorCommand->processor);\n                                break;\n                            }\n                            case Command::Type::UPDATE_PROCESSOR:\n                            {\n                                auto updateProcessorCommand = static_cast<const UpdateProcessorCommand*>(command.get());\n\n                                Processor* processor = static_cast<Processor*>(objects[updateProcessorCommand->processorId - 1].get());\n                                updateProcessorCommand->updateFunction(processor);\n                                break;\n                            }\n                            default:\n                                throw std::runtime_error(\"Invalid command\");\n                        }\n                    }\n                }\n            }\n\n            void Mixer::getSamples(uint32_t frames, uint16_t channels, uint32_t sampleRate, std::vector<float>& samples)\n            {\n                process();\n\n                samples.resize(frames * channels);\n\n                if (masterBus)\n                {\n                    Vector3F listenerPosition;\n                    QuaternionF listenerRotation;\n\n                    masterBus->getSamples(frames, channels, sampleRate, listenerPosition, listenerRotation, samples);\n                }\n\n                for (float& sample : samples)\n                    sample = clamp(sample, -1.0F, 1.0F);\n            }\n\n            void Mixer::main()\n            {\n                for (;;)\n                {\n                    break; \/\/ TODO: remove\n\n                    process();\n\n                    std::unique_lock<std::mutex> lock(bufferMutex);\n                    bufferCondition.wait(lock);\n\n                    if (masterBus)\n                    {\n                        \/\/Vector3F listenerPosition;\n                        \/\/QuaternionF listenerRotation;\n\n                        \/\/masterBus->getData(frames, channels, sampleRate, listenerPosition, listenerRotation, samples);\n                    }\n\n                    \/\/for (float& f : samples)\n                    \/\/    f = clamp(f, -1.0F, 1.0F);\n                }\n            }\n        }\n    } \/\/ namespace audio\n} \/\/ namespace ouzel\n<commit_msg>Fix the order of the initialization<commit_after>\/\/ Copyright 2015-2019 Elviss Strazdins. All rights reserved.\n\n#include \"Mixer.hpp\"\n#include \"Bus.hpp\"\n#include \"Data.hpp\"\n#include \"Stream.hpp\"\n#include \"math\/MathUtils.hpp\"\n#include \"utils\/Utils.hpp\"\n\nnamespace ouzel\n{\n    namespace audio\n    {\n        namespace mixer\n        {\n            Mixer::Mixer(uint32_t initBufferSize,\n                         uint16_t initChannels,\n                         const std::function<void(const Event&)>& initCallback):\n                bufferSize(initBufferSize),\n                channels(initChannels),\n                callback(initCallback),\n                mixerThread(&Mixer::main, this),\n                buffer(initBufferSize * 3, initChannels)\n            {\n                \/\/setThreadPriority(mixerThread, 20.0F, true);\n            }\n\n            void Mixer::process()\n            {\n                CommandBuffer commandBuffer;\n                std::unique_ptr<Command> command;\n\n                for (;;)\n                {\n                    std::unique_lock<std::mutex> lock(commandQueueMutex);\n                    if (commandQueue.empty()) break;\n                    commandBuffer = std::move(commandQueue.front());\n                    commandQueue.pop();\n                    lock.unlock();\n\n                    while (!commandBuffer.isEmpty())\n                    {\n                        command = commandBuffer.popCommand();\n\n                        switch (command->type)\n                        {\n                            case Command::Type::DELETE_OBJECT:\n                            {\n                                auto deleteObjectCommand = static_cast<const DeleteObjectCommand*>(command.get());\n                                objects[deleteObjectCommand->objectId - 1].reset();\n                                break;\n                            }\n                            case Command::Type::INIT_BUS:\n                            {\n                                auto initBusCommand = static_cast<const InitBusCommand*>(command.get());\n\n                                if (initBusCommand->busId > objects.size())\n                                    objects.resize(initBusCommand->busId);\n\n                                objects[initBusCommand->busId - 1].reset(new Bus());\n                                break;\n                            }\n                            case Command::Type::SET_BUS_OUTPUT:\n                            {\n                                auto setBusOutputCommand = static_cast<const SetBusOutputCommand*>(command.get());\n\n                                Bus* bus = static_cast<Bus*>(objects[setBusOutputCommand->busId - 1].get());\n                                bus->setOutput(setBusOutputCommand->outputBusId ? static_cast<Bus*>(objects[setBusOutputCommand->outputBusId - 1].get()) : nullptr);\n                                break;\n                            }\n                            case Command::Type::ADD_PROCESSOR:\n                            {\n                                auto addProcessorCommand = static_cast<const AddProcessorCommand*>(command.get());\n\n                                Bus* bus = static_cast<Bus*>(objects[addProcessorCommand->busId - 1].get());\n                                Processor* processor = static_cast<Processor*>(objects[addProcessorCommand->processorId - 1].get());\n                                bus->addProcessor(processor);\n                                break;\n                            }\n                            case Command::Type::REMOVE_PROCESSOR:\n                            {\n                                auto removeProcessorCommand = static_cast<const RemoveProcessorCommand*>(command.get());\n\n                                Bus* bus = static_cast<Bus*>(objects[removeProcessorCommand->busId - 1].get());\n                                Processor* processor = static_cast<Processor*>(objects[removeProcessorCommand->processorId - 1].get());\n                                bus->removeProcessor(processor);\n                                break;\n                            }\n                            case Command::Type::SET_MASTER_BUS:\n                            {\n                                auto setMasterBusCommand = static_cast<const SetMasterBusCommand*>(command.get());\n\n                                masterBus = setMasterBusCommand->busId ? static_cast<Bus*>(objects[setMasterBusCommand->busId - 1].get()) : nullptr;\n                                break;\n                            }\n                            case Command::Type::INIT_STREAM:\n                            {\n                                auto initStreamCommand = static_cast<const InitStreamCommand*>(command.get());\n\n                                if (initStreamCommand->streamId > objects.size())\n                                    objects.resize(initStreamCommand->streamId);\n\n                                Data* data = static_cast<Data*>(objects[initStreamCommand->dataId - 1].get());\n                                objects[initStreamCommand->streamId - 1] = data->createStream();\n                                break;\n                            }\n                            case Command::Type::PLAY_STREAM:\n                            {\n                                auto playStreamCommand = static_cast<const PlayStreamCommand*>(command.get());\n\n                                Stream* stream = static_cast<Stream*>(objects[playStreamCommand->streamId - 1].get());\n                                stream->play();\n                                break;\n                            }\n                            case Command::Type::STOP_STREAM:\n                            {\n                                auto stopStreamCommand = static_cast<const StopStreamCommand*>(command.get());\n\n                                Stream* stream = static_cast<Stream*>(objects[stopStreamCommand->streamId - 1].get());\n                                stream->stop(stopStreamCommand->reset);\n                                break;\n                            }\n                            case Command::Type::SET_STREAM_OUTPUT:\n                            {\n                                auto setStreamOutputCommand = static_cast<const SetStreamOutputCommand*>(command.get());\n\n                                Stream* stream = static_cast<Stream*>(objects[setStreamOutputCommand->streamId - 1].get());\n                                stream->setOutput(setStreamOutputCommand->busId ? static_cast<Bus*>(objects[setStreamOutputCommand->busId - 1].get()) : nullptr);\n                                break;\n                            }\n                            case Command::Type::INIT_DATA:\n                            {\n                                auto initDataCommand = static_cast<const InitDataCommand*>(command.get());\n\n                                if (initDataCommand->dataId > objects.size())\n                                    objects.resize(initDataCommand->dataId);\n\n                                objects[initDataCommand->dataId - 1] = initDataCommand->initFunction();\n                                break;\n                            }\n                            case Command::Type::INIT_PROCESSOR:\n                            {\n                                auto initProcessorCommand = static_cast<InitProcessorCommand*>(command.get());\n\n                                if (initProcessorCommand->processorId > objects.size())\n                                    objects.resize(initProcessorCommand->processorId);\n\n                                objects[initProcessorCommand->processorId - 1] = std::move(initProcessorCommand->processor);\n                                break;\n                            }\n                            case Command::Type::UPDATE_PROCESSOR:\n                            {\n                                auto updateProcessorCommand = static_cast<const UpdateProcessorCommand*>(command.get());\n\n                                Processor* processor = static_cast<Processor*>(objects[updateProcessorCommand->processorId - 1].get());\n                                updateProcessorCommand->updateFunction(processor);\n                                break;\n                            }\n                            default:\n                                throw std::runtime_error(\"Invalid command\");\n                        }\n                    }\n                }\n            }\n\n            void Mixer::getSamples(uint32_t frames, uint16_t channels, uint32_t sampleRate, std::vector<float>& samples)\n            {\n                process();\n\n                samples.resize(frames * channels);\n\n                if (masterBus)\n                {\n                    Vector3F listenerPosition;\n                    QuaternionF listenerRotation;\n\n                    masterBus->getSamples(frames, channels, sampleRate, listenerPosition, listenerRotation, samples);\n                }\n\n                for (float& sample : samples)\n                    sample = clamp(sample, -1.0F, 1.0F);\n            }\n\n            void Mixer::main()\n            {\n                for (;;)\n                {\n                    break; \/\/ TODO: remove\n\n                    process();\n\n                    std::unique_lock<std::mutex> lock(bufferMutex);\n                    bufferCondition.wait(lock);\n\n                    if (masterBus)\n                    {\n                        \/\/Vector3F listenerPosition;\n                        \/\/QuaternionF listenerRotation;\n\n                        \/\/masterBus->getData(frames, channels, sampleRate, listenerPosition, listenerRotation, samples);\n                    }\n\n                    \/\/for (float& f : samples)\n                    \/\/    f = clamp(f, -1.0F, 1.0F);\n                }\n            }\n        }\n    } \/\/ namespace audio\n} \/\/ namespace ouzel\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file main.cpp\n * @brief maint@C\n *\n * glutɂOpenGLTh{bNX\n * OpenGL, Eny-up\n * \n * @author ashkeys\n *\/\n\n\/\/ include\n#include <gl\/freeglut.h>\n#include <iostream>\n\n\/\/ define\n#define WINDOW_X\t\t\t100\n#define WINDOW_Y\t\t\t100\n#define WINDOW_WIDTH\t800\n#define WINDOW_HEIGHT\t600\n\n\/\/ vg^Cv錾\nvoid InitWindow(const char* winName);\nvoid Init();\nvoid display();\nvoid update();\nvoid keyboard(unsigned char key, int x, int y);\nvoid specialKey(int key, int x, int y);\n\n\/**\n * @brief C֐\n *\n * @param [in] argc R}hȐ\n * @param [in] argv e͕̓\n * @return Xe[^X\n *\/\nint main(int argc, char* argv[])\n{\n  glutInit(&argc, argv);\n\tInitWindow(argv[0]);\n\tInit();\n\n\tstd::cout << \"Vendor: \" << glGetString(GL_VENDOR) << std::endl;\n  std::cout << \"GPU: \" << glGetString(GL_RENDERER) << std::endl;\n  std::cout << \"OpenGL ver. \" << glGetString(GL_VERSION) << std::endl;\n\n\tglutIdleFunc(update);\n  glutDisplayFunc(display);\n\tglutKeyboardFunc(keyboard);\n\tglutSpecialFunc(specialKey);\n  \n\tglutMainLoop();\n  return 0;\n}\n\n\/**\n * @brief EBhȄ\n *\n * @param [in] winName 쐬EBhE̖O\n *\/\nvoid InitWindow(const char* winName)\n{\n\tglutInitWindowPosition(WINDOW_X, WINDOW_Y);\n\tglutInitWindowSize(WINDOW_WIDTH, WINDOW_HEIGHT);\n\tglutInitDisplayMode(GLUT_RGBA | GLUT_DOUBLE | GLUT_DEPTH);\n\tglutCreateWindow(winName);\n\tglClearColor(0.0, 0.0, 0.0, 1.0);\n}\n\n\/**\n * @brief \n *\n *\/\nvoid Init()\n{\n}\n\n\/**\n * @brief AChR[obN\n *\n *\/\nvoid update()\n{\n}\n\n\/**\n * @brief fBXvCR[obN\n *\n *\/\nvoid display()\n{\n  \/\/ r[|[gݒ\n\tglViewport(0, 0, WINDOW_WIDTH, WINDOW_HEIGHT);\n\t\/\/ wiNAA`揀\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\tglEnable(GL_DEPTH_TEST);\n\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tgluPerspective(35.0, (double)WINDOW_WIDTH \/ (double)WINDOW_HEIGHT, 1.0, 3000.0);\n\tgluLookAt(0.0, 0.0, 500.0, 0.0, 0.0, -1000.0, 0.0, 1.0, 0.0);\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\n\tdouble x, y, z, pitch, yaw, roll;\n\tx = y = z = pitch = yaw = roll = 10.0;\n\n\tglPushMatrix();\n\t{\n\t\tglRotated(pitch, 1.0, 0.0, 0.0);\n\t\tglRotated(yaw, 0.0, 1.0, 0.0);\n\t\tglRotated(roll, 0.0, 0.0, 1.0);\n\t\tglTranslated(x, y, z);\n\t\tglutSolidCube(100.0);\n\t}\n\tglPopMatrix();\n\n\tglDisable(GL_DEPTH_TEST);\n\n\tglutSwapBuffers();\n\tglutPostRedisplay();\n}\n\n\/**\n * @brief L[{[hR[obN\n *\n *\/\nvoid keyboard(unsigned char key, int x, int y)\n{\n\tswitch(key){\n\tcase '\\033':\t\/\/ ESCL[\n\t\texit(0);\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n}\n\n\/**\n * @brief L[R[obN\n *\n *\/\nvoid specialKey(int key, int x, int y)\n{\n}\n\n<commit_msg>ビューイング変換の記述位置を修正<commit_after>\/**\n * @file main.cpp\n * @brief maint@C\n *\n * glutɂOpenGLTh{bNX\n * OpenGL, Eny-up\n * \n * @author ashkeys\n *\/\n\n\/\/ include\n#include <gl\/freeglut.h>\n#include <iostream>\n\n\/\/ define\n#define WINDOW_X\t\t\t100\n#define WINDOW_Y\t\t\t100\n#define WINDOW_WIDTH\t800\n#define WINDOW_HEIGHT\t600\n\n\/\/ vg^Cv錾\nvoid InitWindow(const char* winName);\nvoid Init();\nvoid display();\nvoid update();\nvoid keyboard(unsigned char key, int x, int y);\nvoid specialKey(int key, int x, int y);\n\n\/**\n * @brief C֐\n *\n * @param [in] argc R}hȐ\n * @param [in] argv e͕̓\n * @return Xe[^X\n *\/\nint main(int argc, char* argv[])\n{\n  glutInit(&argc, argv);\n\tInitWindow(argv[0]);\n\tInit();\n\n\tstd::cout << \"Vendor: \" << glGetString(GL_VENDOR) << std::endl;\n  std::cout << \"GPU: \" << glGetString(GL_RENDERER) << std::endl;\n  std::cout << \"OpenGL ver. \" << glGetString(GL_VERSION) << std::endl;\n\n\tglutIdleFunc(update);\n  glutDisplayFunc(display);\n\tglutKeyboardFunc(keyboard);\n\tglutSpecialFunc(specialKey);\n  \n\tglutMainLoop();\n  return 0;\n}\n\n\/**\n * @brief EBhȄ\n *\n * @param [in] winName 쐬EBhE̖O\n *\/\nvoid InitWindow(const char* winName)\n{\n\tglutInitWindowPosition(WINDOW_X, WINDOW_Y);\n\tglutInitWindowSize(WINDOW_WIDTH, WINDOW_HEIGHT);\n\tglutInitDisplayMode(GLUT_RGBA | GLUT_DOUBLE | GLUT_DEPTH);\n\tglutCreateWindow(winName);\n\tglClearColor(0.0, 0.0, 0.0, 1.0);\n}\n\n\/**\n * @brief \n *\n *\/\nvoid Init()\n{\n}\n\n\/**\n * @brief AChR[obN\n *\n *\/\nvoid update()\n{\n}\n\n\/**\n * @brief fBXvCR[obN\n *\n *\/\nvoid display()\n{\n  \/\/ r[|[gݒ\n\tglViewport(0, 0, WINDOW_WIDTH, WINDOW_HEIGHT);\n\t\/\/ wiNAA`揀\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\tglEnable(GL_DEPTH_TEST);\n\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tgluPerspective(35.0, (double)WINDOW_WIDTH \/ (double)WINDOW_HEIGHT, 1.0, 3000.0);\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\tgluLookAt(0.0, 0.0, 500.0, 0.0, 0.0, -1000.0, 0.0, 1.0, 0.0);\n\n\tdouble x, y, z, pitch, yaw, roll;\n\tx = y = z = pitch = yaw = roll = 10.0;\n\n\tglPushMatrix();\n\t{\n\t\tglRotated(pitch, 1.0, 0.0, 0.0);\n\t\tglRotated(yaw, 0.0, 1.0, 0.0);\n\t\tglRotated(roll, 0.0, 0.0, 1.0);\n\t\tglTranslated(x, y, z);\n\t\tglutSolidCube(100.0);\n\t}\n\tglPopMatrix();\n\n\tglDisable(GL_DEPTH_TEST);\n\n\tglutSwapBuffers();\n\tglutPostRedisplay();\n}\n\n\/**\n * @brief L[{[hR[obN\n *\n *\/\nvoid keyboard(unsigned char key, int x, int y)\n{\n\tswitch(key){\n\tcase '\\033':\t\/\/ ESCL[\n\t\texit(0);\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n}\n\n\/**\n * @brief L[R[obN\n *\n *\/\nvoid specialKey(int key, int x, int y)\n{\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdint>\n#include <cassert>\n\n#include <immintrin.h>\n#include <x86intrin.h>\n\nnamespace base64 {\n\n    namespace avx2 {\n\n        template <typename FN_LOOKUP, typename FN_PACK>\n        void decode(FN_LOOKUP lookup, FN_PACK pack, const uint8_t* input, size_t size, uint8_t* output) {\n\n            assert(size % 32 == 0);\n\n            uint8_t* out = output;\n\n            for (size_t i=0; i < size; i += 32) {\n\n                __m256i in = _mm256_loadu_si256(reinterpret_cast<const __m256i*>(input + i));\n                __m256i values;\n\n                try {\n                    values = lookup(in);\n                } catch (invalid_input& e) {\n\n                    const auto shift = e.offset;\n                    throw invalid_input(i + shift, input[i + shift]);\n                }\n\n                \/\/ input:  packed_dword([00dddddd|00cccccc|00bbbbbb|00aaaaaa] x 4)\n                \/\/ merged: packed_dword([00000000|ddddddcc|ccccbbbb|bbaaaaaa] x 4)\n\n                const __m256i merged = pack(values);\n\n                \/\/ merged = packed_byte([0XXX|0YYY|0ZZZ|0WWW])\n\n                const __m256i shuf = _mm256_setr_epi8(\n                       2,  1,  0,\n                       6,  5,  4,\n                      10,  9,  8,\n                      14, 13, 12,\n                      char(0xff), char(0xff), char(0xff), char(0xff),\n                       2,  1,  0,\n                       6,  5,  4,\n                      10,  9,  8,\n                      14, 13, 12,\n                      char(0xff), char(0xff), char(0xff), char(0xff)\n                );\n\n                const __m256i shuffled = _mm256_shuffle_epi8(merged, shuf);\n\n                _mm_storeu_si128(reinterpret_cast<__m128i*>(out), _mm256_extracti128_si256(shuffled, 0));\n                _mm_storeu_si128(reinterpret_cast<__m128i*>(out + 12), _mm256_extracti128_si256(shuffled, 1));\n\n                out += 24;\n            }\n        }\n\n\n#if defined(HAVE_BMI2_INSTRUCTIONS)\n        template <typename FN>\n        void decode_bmi2(FN lookup, const uint8_t* input, size_t size, uint8_t* output) {\n\n            assert(size % 32 == 0);\n\n            uint8_t* out = output;\n\n            for (size_t i=0; i < size; i += 32) {\n\n                __m256i in = _mm256_loadu_si256(reinterpret_cast<const __m256i*>(input + i));\n                __m256i values;\n\n                try {\n                    values = lookup(in);\n                } catch (invalid_input& e) {\n\n                    const auto shift = e.offset;\n                    throw invalid_input(i + shift, input[i + shift]);\n                }\n\n                \/\/ input:  packed_dword([00dddddd|00cccccc|00bbbbbb|00aaaaaa] x 4)\n                \/\/ merged: packed_dword([00000000|ddddddcc|ccccbbbb|bbaaaaaa] x 4)\n\n                const __m128i lane0 = _mm256_extracti128_si256(values, 0);\n                const __m128i lane1 = _mm256_extracti128_si256(values, 1);\n\n                const uint64_t t0 = _pext_u64(_mm_extract_epi64(lane0, 0), 0x3f3f3f3f3f3f3f3f);\n                const uint64_t t1 = _pext_u64(_mm_extract_epi64(lane0, 1), 0x3f3f3f3f3f3f3f3f);\n                const uint64_t t2 = _pext_u64(_mm_extract_epi64(lane1, 0), 0x3f3f3f3f3f3f3f3f);\n                const uint64_t t3 = _pext_u64(_mm_extract_epi64(lane1, 1), 0x3f3f3f3f3f3f3f3f);\n\n#if 0 \/\/ naive store\n                *reinterpret_cast<uint64_t*>(out + 0*0) = t0;\n                *reinterpret_cast<uint64_t*>(out + 1*6) = t1;\n                *reinterpret_cast<uint64_t*>(out + 2*6) = t2;\n                *reinterpret_cast<uint64_t*>(out + 3*6) = t3;\n#else\n                *reinterpret_cast<uint64_t*>(out + 0*8) = (t1 << (6*8)) | t0;\n                *reinterpret_cast<uint64_t*>(out + 1*8) = (t2 << (4*8)) | (t1 >> (2*8));\n                *reinterpret_cast<uint64_t*>(out + 2*8) = (t3 << (2*8)) | (t2 >> (4*8));\n#endif\n                out += 24;\n            }\n        }\n#endif \/\/ defined(HAVE_BMI2_INSTRUCTIONS)\n\n    } \/\/ namespace avx2_templates\n\n} \/\/ namespace base64\n<commit_msg>fixed BMI2-assisted AVX2 code<commit_after>#include <cstdint>\n#include <cassert>\n\n#include <immintrin.h>\n#include <x86intrin.h>\n\nnamespace base64 {\n\n    namespace avx2 {\n\n        template <typename FN_LOOKUP, typename FN_PACK>\n        void decode(FN_LOOKUP lookup, FN_PACK pack, const uint8_t* input, size_t size, uint8_t* output) {\n\n            assert(size % 32 == 0);\n\n            uint8_t* out = output;\n\n            for (size_t i=0; i < size; i += 32) {\n\n                __m256i in = _mm256_loadu_si256(reinterpret_cast<const __m256i*>(input + i));\n                __m256i values;\n\n                try {\n                    values = lookup(in);\n                } catch (invalid_input& e) {\n\n                    const auto shift = e.offset;\n                    throw invalid_input(i + shift, input[i + shift]);\n                }\n\n                \/\/ input:  packed_dword([00dddddd|00cccccc|00bbbbbb|00aaaaaa] x 4)\n                \/\/ merged: packed_dword([00000000|ddddddcc|ccccbbbb|bbaaaaaa] x 4)\n\n                const __m256i merged = pack(values);\n\n                \/\/ merged = packed_byte([0XXX|0YYY|0ZZZ|0WWW])\n\n                const __m256i shuf = _mm256_setr_epi8(\n                       2,  1,  0,\n                       6,  5,  4,\n                      10,  9,  8,\n                      14, 13, 12,\n                      char(0xff), char(0xff), char(0xff), char(0xff),\n                       2,  1,  0,\n                       6,  5,  4,\n                      10,  9,  8,\n                      14, 13, 12,\n                      char(0xff), char(0xff), char(0xff), char(0xff)\n                );\n\n                const __m256i shuffled = _mm256_shuffle_epi8(merged, shuf);\n\n                _mm_storeu_si128(reinterpret_cast<__m128i*>(out), _mm256_extracti128_si256(shuffled, 0));\n                _mm_storeu_si128(reinterpret_cast<__m128i*>(out + 12), _mm256_extracti128_si256(shuffled, 1));\n\n                out += 24;\n            }\n        }\n\n\n#if defined(HAVE_BMI2_INSTRUCTIONS)\n        __m256i bswap_si256(const __m256i in) {\n            return _mm256_shuffle_epi8(in, _mm256_setr_epi8(\n                         3,  2,  1,  0,\n                         7,  6,  5,  4,\n                        11, 10,  9,  8,\n                        15, 14, 13, 12,\n                         3,  2,  1,  0,\n                         7,  6,  5,  4,\n                        11, 10,  9,  8,\n                        15, 14, 13, 12\n                   ));\n        }\n\n        uint64_t pack_bytes(uint64_t v) {\n\n                const uint64_t p  = _pext_u64(v, 0x3f3f3f3f3f3f3f3f);\n\n                const uint64_t b0 = p & 0x0000ff0000ff;\n                const uint64_t b1 = p & 0x00ff0000ff00;\n                const uint64_t b2 = p & 0xff0000ff0000;\n\n                return (b0 << 16) | b1 | (b2 >> 16);\n        }\n\n        template <typename FN>\n        void decode_bmi2(FN lookup, const uint8_t* input, size_t size, uint8_t* output) {\n\n            assert(size % 32 == 0);\n\n            uint8_t* out = output;\n\n            for (size_t i=0; i < size; i += 32) {\n\n                __m256i in = _mm256_loadu_si256(reinterpret_cast<const __m256i*>(input + i));\n                __m256i values;\n\n                try {\n                    values = bswap_si256(lookup(in));\n                } catch (invalid_input& e) {\n\n                    const auto shift = e.offset;\n                    throw invalid_input(i + shift, input[i + shift]);\n                }\n\n                \/\/ input:  packed_dword([00dddddd|00cccccc|00bbbbbb|00aaaaaa] x 4)\n                \/\/ merged: packed_dword([00000000|ddddddcc|ccccbbbb|bbaaaaaa] x 4)\n\n                const __m128i lane0 = _mm256_extracti128_si256(values, 0);\n                const __m128i lane1 = _mm256_extracti128_si256(values, 1);\n\n                const uint64_t t0 = pack_bytes(_mm_extract_epi64(lane0, 0));\n                const uint64_t t1 = pack_bytes(_mm_extract_epi64(lane0, 1));\n                const uint64_t t2 = pack_bytes(_mm_extract_epi64(lane1, 0));\n                const uint64_t t3 = pack_bytes(_mm_extract_epi64(lane1, 1));\n\n#if 0 \/\/ naive store\n                *reinterpret_cast<uint64_t*>(out + 0*0) = t0;\n                *reinterpret_cast<uint64_t*>(out + 1*6) = t1;\n                *reinterpret_cast<uint64_t*>(out + 2*6) = t2;\n                *reinterpret_cast<uint64_t*>(out + 3*6) = t3;\n#else\n                *reinterpret_cast<uint64_t*>(out + 0*8) = (t1 << (6*8)) | t0;\n                *reinterpret_cast<uint64_t*>(out + 1*8) = (t2 << (4*8)) | (t1 >> (2*8));\n                *reinterpret_cast<uint64_t*>(out + 2*8) = (t3 << (2*8)) | (t2 >> (4*8));\n#endif\n                out += 24;\n            }\n        }\n#endif \/\/ defined(HAVE_BMI2_INSTRUCTIONS)\n\n    } \/\/ namespace avx2_templates\n\n} \/\/ namespace base64\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2022 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * 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#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"yggdrasil_decision_forests\/utils\/concurrency.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/distribute.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/implementations\/grpc\/grpc.pb.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/implementations\/grpc\/grpc_manager.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/implementations\/grpc\/grpc_worker.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/test_utils.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/toy_worker.h\"\n#include \"yggdrasil_decision_forests\/utils\/filesystem.h\"\n#include \"yggdrasil_decision_forests\/utils\/test.h\"\n\nnamespace yggdrasil_decision_forests {\nnamespace distribute {\nnamespace {\n\n\/\/ Create a GRPC manager and its workers.\nManagerCreatorAndWorkers CreateGrpcManagerCreator(\n    int parallel_execution_per_worker = 1, int num_workers = 5) {\n  ManagerCreatorAndWorkers manager_and_workers;\n  \/\/ Manager configuration.\n  proto::Config config;\n  config.set_implementation_key(\"GRPC\");\n  config.set_verbosity(1);\n  config.set_working_directory(\n      file::JoinPath(test::TmpDirectory(), \"work_dir\"));\n  auto* addresses =\n      config.MutableExtension(proto::grpc)->mutable_socket_addresses();\n  for (int worker_idx = 0; worker_idx < num_workers; worker_idx++) {\n    \/\/ Create address.\n    auto* address = addresses->add_addresses();\n    address->set_ip(\"localhost\");\n    std::string error;\n    const int port = test::PickUnusedPortOrDie();\n    CHECK_GT(port, 0);\n    address->set_port(port);\n\n    \/\/ Create worker thread.\n    manager_and_workers.worker_threads.push_back(\n        absl::make_unique<utils::concurrency::Thread>(\n            [port]() { CHECK_OK(GRPCWorkerMainWorkerMain(port)); }));\n    absl::SleepFor(absl::Seconds(0.2));\n  }\n\n  \/\/ Start manager.\n  manager_and_workers.manager_creator = [config,\n                                         parallel_execution_per_worker]() {\n    return CreateManager(config, \/*worker_name=*\/kToyWorkerKey,\n                         \/*welcome_blob=*\/\"hello\",\n                         parallel_execution_per_worker)\n        .value();\n  };\n  return manager_and_workers;\n}\n\nManagerAndWorkers CreateGrpcManager(int parallel_execution_per_worker = 1) {\n  auto creator = CreateGrpcManagerCreator(parallel_execution_per_worker);\n  ManagerAndWorkers m_and_w;\n  m_and_w.worker_threads = std::move(creator.worker_threads);\n  m_and_w.manager = creator.manager_creator();\n  return m_and_w;\n}\n\nTEST(GRPC, WorkerError) {\n  auto all = CreateGrpcManager();\n  TestWorkerError(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, BlockingRequest) {\n  auto all = CreateGrpcManager();\n  TestBlockingRequest(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, AsynchronousRequest) {\n  auto all = CreateGrpcManager();\n  TestAsynchronousRequest(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, BlockingRequestWithSpecificWorker) {\n  auto all = CreateGrpcManager();\n  TestBlockingRequestWithSpecificWorker(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, AsynchronousRequestWithSpecificWorker) {\n  auto all = CreateGrpcManager();\n  TestAsynchronousRequestWithSpecificWorker(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, AsynchronousIntraWorkerCommunication) {\n  auto all = CreateGrpcManager();\n  TestAsynchronousIntraWorkerCommunication(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, AsynchronousParallelWorkerExecution) {\n  auto all = CreateGrpcManager(5);\n  TestAsynchronousParallelWorkerExecution(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, TestChangeManagerNice) {\n  auto all = CreateGrpcManagerCreator(5, 1);\n  TestChangeManager(&all, \/*nice=*\/true);\n  all.Join();\n}\n\nTEST(GRPC, TestChangeManagerNotNice) {\n  auto all = CreateGrpcManagerCreator(5, 1);\n  TestChangeManager(&all, \/*nice=*\/false);\n  all.Join();\n}\n\nTEST(GRPC, TestMessup) {\n  auto all = CreateGrpcManager();\n  TestMessup(all.manager.get(), [&]() {\n    \/\/ This method creates a new worker #0, and tell the manager to replace the\n    \/\/ old worker #0 by the new worker #0. After this change, any call to the\n    \/\/ old worker #0 will trigger a LOG(FATAL).\n\n    \/\/ Mark worker #0 as forbiden. New requests to this worker will trigger a\n    \/\/ LOG(FATAL).\n    CHECK_OK(all.manager->BlockingRequest(\"forbidden\", 0).status());\n\n    auto* grpc_manager = dynamic_cast<GRPCManager*>(all.manager.get());\n    CHECK(grpc_manager != nullptr);\n    CHECK_OK(grpc_manager->DebugShutdownWorker(0));\n\n    \/\/ New port for worker #0.\n    const int port = test::PickUnusedPortOrDie();\n    CHECK_GT(port, 0);\n\n    \/\/ Isolate the forbiden worker thread.\n    all.discarded_worker_threads.push_back(\n        std::move(all.worker_threads.front()));\n\n    \/\/ Create worker thread.\n    all.worker_threads.front() = absl::make_unique<utils::concurrency::Thread>(\n        [port]() { CHECK_OK(GRPCWorkerMainWorkerMain(port)); });\n    absl::SleepFor(absl::Seconds(0.2));\n\n    CHECK_OK(grpc_manager->UpdateWorkerAddress(\n        \/*worker_idx=*\/0, absl::StrCat(\"localhost:\", port)));\n  });\n  all.Join();\n}\n\n}  \/\/ namespace\n}  \/\/ namespace distribute\n}  \/\/ namespace yggdrasil_decision_forests\n<commit_msg>Disable test GRPC.TestChangeManagerNotNice until fixed.<commit_after>\/*\n * Copyright 2022 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * 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#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"yggdrasil_decision_forests\/utils\/concurrency.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/distribute.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/implementations\/grpc\/grpc.pb.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/implementations\/grpc\/grpc_manager.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/implementations\/grpc\/grpc_worker.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/test_utils.h\"\n#include \"yggdrasil_decision_forests\/utils\/distribute\/toy_worker.h\"\n#include \"yggdrasil_decision_forests\/utils\/filesystem.h\"\n#include \"yggdrasil_decision_forests\/utils\/test.h\"\n\nnamespace yggdrasil_decision_forests {\nnamespace distribute {\nnamespace {\n\n\/\/ Create a GRPC manager and its workers.\nManagerCreatorAndWorkers CreateGrpcManagerCreator(\n    int parallel_execution_per_worker = 1, int num_workers = 5) {\n  ManagerCreatorAndWorkers manager_and_workers;\n  \/\/ Manager configuration.\n  proto::Config config;\n  config.set_implementation_key(\"GRPC\");\n  config.set_verbosity(1);\n  config.set_working_directory(\n      file::JoinPath(test::TmpDirectory(), \"work_dir\"));\n  auto* addresses =\n      config.MutableExtension(proto::grpc)->mutable_socket_addresses();\n  for (int worker_idx = 0; worker_idx < num_workers; worker_idx++) {\n    \/\/ Create address.\n    auto* address = addresses->add_addresses();\n    address->set_ip(\"localhost\");\n    std::string error;\n    const int port = test::PickUnusedPortOrDie();\n    CHECK_GT(port, 0);\n    address->set_port(port);\n\n    \/\/ Create worker thread.\n    manager_and_workers.worker_threads.push_back(\n        absl::make_unique<utils::concurrency::Thread>(\n            [port]() { CHECK_OK(GRPCWorkerMainWorkerMain(port)); }));\n    absl::SleepFor(absl::Seconds(0.2));\n  }\n\n  \/\/ Start manager.\n  manager_and_workers.manager_creator = [config,\n                                         parallel_execution_per_worker]() {\n    return CreateManager(config, \/*worker_name=*\/kToyWorkerKey,\n                         \/*welcome_blob=*\/\"hello\",\n                         parallel_execution_per_worker)\n        .value();\n  };\n  return manager_and_workers;\n}\n\nManagerAndWorkers CreateGrpcManager(int parallel_execution_per_worker = 1) {\n  auto creator = CreateGrpcManagerCreator(parallel_execution_per_worker);\n  ManagerAndWorkers m_and_w;\n  m_and_w.worker_threads = std::move(creator.worker_threads);\n  m_and_w.manager = creator.manager_creator();\n  return m_and_w;\n}\n\nTEST(GRPC, WorkerError) {\n  auto all = CreateGrpcManager();\n  TestWorkerError(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, BlockingRequest) {\n  auto all = CreateGrpcManager();\n  TestBlockingRequest(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, AsynchronousRequest) {\n  auto all = CreateGrpcManager();\n  TestAsynchronousRequest(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, BlockingRequestWithSpecificWorker) {\n  auto all = CreateGrpcManager();\n  TestBlockingRequestWithSpecificWorker(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, AsynchronousRequestWithSpecificWorker) {\n  auto all = CreateGrpcManager();\n  TestAsynchronousRequestWithSpecificWorker(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, AsynchronousIntraWorkerCommunication) {\n  auto all = CreateGrpcManager();\n  TestAsynchronousIntraWorkerCommunication(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, AsynchronousParallelWorkerExecution) {\n  auto all = CreateGrpcManager(5);\n  TestAsynchronousParallelWorkerExecution(all.manager.get());\n  all.Join();\n}\n\nTEST(GRPC, TestChangeManagerNice) {\n  auto all = CreateGrpcManagerCreator(5, 1);\n  TestChangeManager(&all, \/*nice=*\/true);\n  all.Join();\n}\n\n  TEST(GRPC, DISABLED_TestChangeManagerNotNice) {\n  auto all = CreateGrpcManagerCreator(5, 1);\n  TestChangeManager(&all, \/*nice=*\/false);\n  all.Join();\n}\n\nTEST(GRPC, TestMessup) {\n  auto all = CreateGrpcManager();\n  TestMessup(all.manager.get(), [&]() {\n    \/\/ This method creates a new worker #0, and tell the manager to replace the\n    \/\/ old worker #0 by the new worker #0. After this change, any call to the\n    \/\/ old worker #0 will trigger a LOG(FATAL).\n\n    \/\/ Mark worker #0 as forbiden. New requests to this worker will trigger a\n    \/\/ LOG(FATAL).\n    CHECK_OK(all.manager->BlockingRequest(\"forbidden\", 0).status());\n\n    auto* grpc_manager = dynamic_cast<GRPCManager*>(all.manager.get());\n    CHECK(grpc_manager != nullptr);\n    CHECK_OK(grpc_manager->DebugShutdownWorker(0));\n\n    \/\/ New port for worker #0.\n    const int port = test::PickUnusedPortOrDie();\n    CHECK_GT(port, 0);\n\n    \/\/ Isolate the forbiden worker thread.\n    all.discarded_worker_threads.push_back(\n        std::move(all.worker_threads.front()));\n\n    \/\/ Create worker thread.\n    all.worker_threads.front() = absl::make_unique<utils::concurrency::Thread>(\n        [port]() { CHECK_OK(GRPCWorkerMainWorkerMain(port)); });\n    absl::SleepFor(absl::Seconds(0.2));\n\n    CHECK_OK(grpc_manager->UpdateWorkerAddress(\n        \/*worker_idx=*\/0, absl::StrCat(\"localhost:\", port)));\n  });\n  all.Join();\n}\n\n}  \/\/ namespace\n}  \/\/ namespace distribute\n}  \/\/ namespace yggdrasil_decision_forests\n<|endoftext|>"}
{"text":"<commit_before>\/\/ biopore_matrix.C --- Static vertical biopores with a capacity.\n\/\/ \n\/\/ Copyright 2008 Per Abrahamsen and KU.\n\/\/\n\/\/ This file is part of Daisy.\n\/\/ \n\/\/ Daisy is free software; you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Lesser 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\/\/ Daisy is distributed in the hope that it 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 Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Lesser Public License\n\/\/ along with Daisy; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\n#define BUILD_DLL\n\n#include \"biopore.h\"\n#include \"imvec.h\"\n#include \"block.h\"\n#include \"vcheck.h\"\n#include \"librarian.h\"\n#include \"submodeler.h\"\n\n\/\/ The 'matrix' model.\n\nstruct BioporeMatrix : public Biopore\n{\n  \/\/ Parameters.\n  \/* const *\/ std::vector<double> xplus; \/\/ [cm]\n  const double diameter;        \/\/ [mm]\n  \n  \/\/ State.\n  std::vector<double> h_bottom; \/\/ [cm]\n  std::auto_ptr<IMvec> solute;  \/\/ [g\/cm^3]\n\n  \/\/ Create and Destroy.\n  BioporeMatrix (Block& al);\n};\n\nBioporeMatrix::BioporeMatrix (Block& al)\n  : Biopore (al),\n    xplus (al.check (\"xplus\") \n           ? al.number_sequence (\"xplus\") \n           : std::vector<double> ()),\n    diameter (al.number (\"diameter\")),\n    h_bottom (al.check (\"h_bottom\") \n              ? al.number_sequence (\"h_bottom\") \n              : std::vector<double> ()),\n    solute (al.check (\"solute\")\n            ? new IMvec (al, \"solute\")\n            : NULL)\n{ }\n\nstatic struct BioporeMatrixSyntax\n{\n  static Model& make (Block& al)\n  { return *new BioporeMatrix (al); }\n\n  BioporeMatrixSyntax ()\n  { \n    Syntax& syntax = *new Syntax ();\n    AttributeList& alist = *new AttributeList ();\n    alist.add (\"description\", \"Biopores that ends in the matrix.\");\n    Biopore::load_base (syntax, alist);\n\n    syntax.add (\"xplus\", \"cm\", Syntax::OptionalConst, Syntax::Sequence,\n\t\t\"Right side of each biopore interval.\\n\\\nWater and chemical content is tracked individually for each interval.\\n\\\nBy default, use intervals as specified by the geometry.\");\n    syntax.add_check (\"xplus\", VCheck::increasing ());\n    syntax.add (\"diameter\", \"cm\", Syntax::Const, \"Biopore diameter.\");\n    syntax.add (\"h_bottom\", \"cm\", Syntax::OptionalConst, Syntax::Sequence,\n\t\t\"Pressure at the bottom of the biopores in each interval.\");\n\n    static const symbol C_unit (\"g\/cm^3\");\n    IMvec::add_syntax (syntax, alist, Syntax::OptionalState, \"solute\", C_unit,\n                       \"Chemical concentration in biopore intervals.\");\n\n    Librarian::add_type (Biopore::component, \"matrix\", alist, syntax, &make);\n  }\n} BioporeMatrix_syntax;\n\n\/\/ biopore_std.C ends here.\n<commit_msg>more work on tertiary transport<commit_after>\/\/ biopore_matrix.C --- Static vertical biopores with a capacity.\n\/\/ \n\/\/ Copyright 2008 Per Abrahamsen and KU.\n\/\/\n\/\/ This file is part of Daisy.\n\/\/ \n\/\/ Daisy is free software; you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Lesser 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\/\/ Daisy is distributed in the hope that it 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 Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Lesser Public License\n\/\/ along with Daisy; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\n#define BUILD_DLL\n\n#include \"biopore.h\"\n#include \"imvec.h\"\n#include \"block.h\"\n#include \"vcheck.h\"\n#include \"librarian.h\"\n#include \"submodeler.h\"\n\n\/\/ The 'matrix' model.\n\nstruct BioporeMatrix : public Biopore\n{\n  \/\/ Parameters.\n  \/* const *\/ std::vector<double> xplus; \/\/ [cm]\n  const double diameter;        \/\/ [mm]\n  \n  \/\/ State.\n  std::vector<double> h_bottom; \/\/ [cm]\n  std::auto_ptr<IMvec> solute;  \/\/ [g\/cm^3]\n\n  \/\/ Create and Destroy.\n  BioporeMatrix (Block& al);\n};\n\nBioporeMatrix::BioporeMatrix (Block& al)\n  : Biopore (al),\n    xplus (al.check (\"xplus\") \n           ? al.number_sequence (\"xplus\") \n           : std::vector<double> ()),\n    diameter (al.number (\"diameter\")),\n    h_bottom (al.check (\"h_bottom\") \n              ? al.number_sequence (\"h_bottom\") \n              : std::vector<double> ()),\n    solute (al.check (\"solute\")\n            ? new IMvec (al, \"solute\")\n            : NULL)\n{ }\n\nstatic struct BioporeMatrixSyntax\n{\n  static Model& make (Block& al)\n  { return *new BioporeMatrix (al); }\n\n  BioporeMatrixSyntax ()\n  { \n    Syntax& syntax = *new Syntax ();\n    AttributeList& alist = *new AttributeList ();\n    alist.add (\"description\", \"Biopores that ends in the matrix.\");\n    Biopore::load_base (syntax, alist);\n\n    syntax.add (\"xplus\", \"cm\", Syntax::OptionalConst, Syntax::Sequence,\n\t\t\"Right side of each biopore interval.\\n\\\nWater and chemical content is tracked individually for each interval.\\n\\\nBy default, use intervals as specified by the geometry.\");\n    syntax.add_check (\"xplus\", VCheck::increasing ());\n    syntax.add (\"diameter\", \"cm\", Syntax::Const, \"Biopore diameter.\");\n    syntax.add (\"h_bottom\", \"cm\", Syntax::OptionalConst, Syntax::Sequence,\n\t\t\"Pressure at the bottom of the biopores in each interval.\");\n\n    static const symbol C_unit (\"g\/cm^3\");\n    IMvec::add_syntax (syntax, alist, Syntax::OptionalState, \"solute\", C_unit,\n                       \"Chemical concentration in biopore intervals.\");\n\n    Librarian::add_type (Biopore::component, \"matrix\", alist, syntax, &make);\n  }\n} BioporeMatrix_syntax;\n\n\/\/ biopore_matrix.C ends here.\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 <algorithm> \/\/ min, max\n#include <cassert>\n#include <cmath> \/\/ fabs\n#include \"bitmap\/color.hh\"\n#include \"geo\/typed-range.hh\"\n\nnamespace faint{\n\nstatic const auto colorRange = TypedRange<uchar>(0, 255);\n\ntemplate<typename T>\nstatic uchar constrain_color(T v){\n  return colorRange.Constrain(v);\n}\n\nbool ColRGB::operator==(const ColRGB& other) const{\n  return r == other.r &&\n    g == other.g &&\n    b == other.b;\n}\n\nbool ColRGB::operator!=(const ColRGB& other) const{\n  return !operator==(other);\n}\n\nbool Color::operator==(const Color& c2) const{\n  return r == c2.r && g == c2.g && b == c2.b && a == c2.a;\n}\n\nbool Color::operator!=(const Color& c2) const{\n  return r != c2.r || g != c2.g || b != c2.b || a != c2.a;\n}\n\nbool Color::operator<(const Color& c2) const{\n  return to_hash(*this) < to_hash(c2);\n}\n\nbool Color::operator>(const Color& c2) const{\n  return to_hash(*this) > to_hash(c2);\n}\n\nHSL::HSL(double h, double s, double l) :\n  h(h),\n  s(s),\n  l(l)\n{\n  assert(0 <= h && h <= 360.0);\n}\n\nHSL::HSL(const HS& hueSat, double l)\n  : h(hueSat.h),\n    s(hueSat.s),\n    l(l)\n{}\n\nHS HSL::GetHS() const{\n  return {h,s};\n}\n\nstatic ColRGB rgb_from_hash(unsigned int h){\n  auto r = static_cast<uchar>((h >> 16) & 0xff);\n  auto g = static_cast<uchar>((h >> 8) & 0xff);\n  auto b = static_cast<uchar>((h) & 0xff);\n  return {r,g,b};\n}\n\nstatic unsigned int to_hash(const ColRGB& c){\n  return (static_cast<unsigned int>(c.r) << 16) |\n    (static_cast<unsigned int>(c.g) << 8) |\n    (static_cast<unsigned int>(c.b));\n}\n\nbool ColRGB::operator<(const ColRGB& c2) const{\n  return to_hash(*this) < to_hash(c2);\n}\n\nColRGB blend_alpha(const Color& color, const ColRGB& bg){\n  return rgb_from_ints((color.r * color.a + bg.r * (255 - color.a)) \/ 255,\n    (color.g * color.a + bg.g * (255 - color.a)) \/ 255,\n    (color.b * color.a + bg.b * (255 - color.a)) \/ 255);\n}\n\nColRGB strip_alpha(const Color& color){\n  return ColRGB(color.r, color.g, color.b);\n}\n\nColRGB invert(const ColRGB& c){\n  \/\/ gcc 4.8.1 with -Wconversion insisted on these casts.\n  uchar r = static_cast<uchar>(255 - c.r);\n  uchar g = static_cast<uchar>(255 - c.g);\n  uchar b = static_cast<uchar>(255 - c.b);\n  return {r,g,b};\n}\n\nColor color_from_ints(int r, int g, int b, int a){\n  return {\n    constrain_color(r),\n    constrain_color(g),\n    constrain_color(b),\n    constrain_color(a)};\n}\n\nColRGB grayscale_rgb(int lightness){\n  return rgb_from_ints(lightness, lightness, lightness);\n}\n\nColor grayscale_rgba(int lightness, int alpha){\n  return color_from_ints(lightness, lightness, lightness, alpha);\n}\n\nColRGB rgb_from_ints(int r, int g, int b){\n  return {constrain_color(r), constrain_color(g), constrain_color(b)};\n}\n\nColor color_from_uints(uint r, uint g, uint b, uint a){\n  return {\n    constrain_color(r),\n    constrain_color(g),\n    constrain_color(b),\n    constrain_color(a)};\n}\n\nColor color_from_double(double r, double g, double b, double a){\n  return {constrain_color(r),\n    constrain_color(g),\n    constrain_color(b),\n    constrain_color(a)};\n}\n\nColRGB rgb_from_double(double r, double g, double b){\n  return {\n    constrain_color(r),\n    constrain_color(g),\n    constrain_color(b)};\n}\n\nbool opaque(const Color& c){\n  return c.a == 255;\n}\n\nbool fully_transparent(const Color& c){\n  return c.a == 0;\n}\n\nbool translucent(const Color& c){\n  return c.a != 255;\n}\n\nbool valid_color(int r, int g, int b, int a){\n  return has_all(colorRange, r, g, b, a);\n}\n\nbool valid_color(int r, int g, int b){\n  return valid_color(r, g, b, 255);\n}\n\nColor with_alpha(const ColRGB& rgb, uchar a){\n  return Color(rgb, a);\n}\n\nColor with_alpha(const Color& c, uchar a){\n  return with_alpha(strip_alpha(c), a);\n}\n\ndouble dmod(double value, double range){\n  while (value >= range){\n    value -= range;\n  }\n  return value;\n}\n\nHSL to_hsl(const ColRGB& c){\n  double R = c.r \/ 255.0;\n  double G = c.g \/ 255.0;\n  double B = c.b \/ 255.0;\n  double M = std::max({R, G, B});\n  double m = std::min({R, G, B});\n  double C = M - m;\n  double Hp = 0;\n\n  if (C == 0){\n    Hp = 0.0;\n  }\n  else if (M == R){\n    Hp = ((((G - B) \/ C))) + 6.0;\n  }\n  else if (M == G){\n    Hp = ((B - R) \/ C) + (2.0);\n  }\n  else if (M == B){\n    Hp = ((R - G) \/ C) + (4.0);\n  }\n\n  \/\/ Hue\n  double H = dmod(60.0 * Hp, 360.0);\n\n  \/\/ Lightness\n  \/\/ ...using Luma instead (i.e. weighted for perceived luminance\n  \/\/ could be better, but trickier\n  double L = (M + m) \/ 2.0;\n\n  \/\/ Saturation\n  double S = C == 0 ? 0 :\n    (C \/ (1.0 - std::fabs(2 * L - 1.0)));\n  return HSL(H, S, L);\n}\n\nColRGB to_rgb(const HSL& c){\n  double C = (1.0 - std::fabs(2 * c.l - 1.0)) * c.s;\n  double Hp = c.h \/ 60.0;\n  double X = C * (1 - std::fabs(dmod(Hp, 2.0) - 1.0));\n\n  double R, G, B;\n  if (Hp < 1){\n    R = C;\n    G = X;\n    B = 0;\n  }\n  else if (Hp < 2){\n    R = X;\n    G = C;\n    B = 0;\n  }\n  else if (Hp < 3){\n    R = 0;\n    G = C;\n    B = X;\n  }\n  else if (Hp < 4){\n    R = 0;\n    G = X;\n    B = C;\n  }\n  else if (Hp < 5){\n    R = X;\n    G = 0;\n    B = C;\n  }\n  else if (Hp <= 6){\n    R = C;\n    G = 0;\n    B = X;\n  }\n  else{\n    assert(false);\n    return ColRGB(0,0,0);\n  }\n  double m = c.l - C \/ 2.0;\n  return rgb_from_double(255 * (R + m) + 0.5,\n    255 * (G + m) + 0.5,\n    255 * (B + m) + 0.5);\n}\n\nColor to_rgba(const HSL& hsl, int a){\n  return Color(to_rgb(hsl),\n    constrain_color(a));\n}\n\nColor subtract(const Color& lhs, const Color& rhs){\n  int r = static_cast<int>(lhs.r) - static_cast<int>(rhs.r);\n  int g = static_cast<int>(lhs.g) - static_cast<int>(rhs.g);\n  int b = static_cast<int>(lhs.b) - static_cast<int>(rhs.b);\n  int a = static_cast<int>(lhs.a) - static_cast<int>(rhs.a);\n  return color_from_ints(r, g, b, a);\n}\n\nColor add(const Color& lhs, const Color& rhs){\n  int r = static_cast<int>(lhs.r) + static_cast<int>(rhs.r);\n  int g = static_cast<int>(lhs.g) + static_cast<int>(rhs.g);\n  int b = static_cast<int>(lhs.b) + static_cast<int>(rhs.b);\n  int a = static_cast<int>(lhs.a) + static_cast<int>(rhs.a);\n  return color_from_ints(r, g, b, a);\n}\n\nint sum_rgb(const Color& c){\n  return static_cast<int>(c.r) +\n    static_cast<int>(c.g) +\n    static_cast<int>(c.b);\n}\n\nunsigned int to_hash(const Color& c){\n  return (static_cast<unsigned int>(c.r) << 24) |\n    (static_cast<unsigned int>(c.g) << 16) |\n    (static_cast<unsigned int>(c.b) << 8) |\n    (static_cast<unsigned int>(c.a));\n}\n\nColor color_from_hash(unsigned int h){\n  auto r = static_cast<uchar>((h >> 24) & 0xff);\n  auto g = static_cast<uchar>((h >> 16) & 0xff);\n  auto b = static_cast<uchar>((h >> 8) & 0xff);\n  auto a = static_cast<uchar>((h & 0xff));\n  return Color(r,g,b,a);\n}\n\nColor mix(const Color& c1, const Color& c2){\n  return color_from_ints(\n    (c1.r + c2.r) \/ 2,\n    (c1.g + c2.g) \/ 2,\n    (c1.b + c2.b) \/ 2,\n    (c1.a + c2.a) \/ 2);\n}\n\nColRGB next_color(const ColRGB& c){\n  auto h = to_hash(c);\n  return h == 0xffffff ? c :\n    rgb_from_hash(h + 1);\n}\n\nColor color_from_hex(unsigned int v){\n  auto r = (v >> 16) & 0xff;\n  auto g = (v >> 8) & 0xff;\n  auto b = v & 0xff;\n  return color_from_ints(r, g, b);\n}\n\n} \/\/ namespace\n<commit_msg>Added invert_color to simplify color.cpp<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 <algorithm> \/\/ min, max\n#include <cassert>\n#include <cmath> \/\/ fabs\n#include \"bitmap\/color.hh\"\n#include \"geo\/typed-range.hh\"\n\nnamespace faint{\n\nstatic const auto colorRange = TypedRange<uchar>(0, 255);\n\nstatic uchar invert_color(uchar v){\n  \/\/ gcc 4.8.1 with -Wconversion insisted on this cast.\n  return static_cast<uchar>(255 - v);\n}\n\ntemplate<typename T>\nstatic uchar constrain_color(T v){\n  return colorRange.Constrain(v);\n}\n\nbool ColRGB::operator==(const ColRGB& other) const{\n  return r == other.r &&\n    g == other.g &&\n    b == other.b;\n}\n\nbool ColRGB::operator!=(const ColRGB& other) const{\n  return !operator==(other);\n}\n\nbool Color::operator==(const Color& c2) const{\n  return r == c2.r && g == c2.g && b == c2.b && a == c2.a;\n}\n\nbool Color::operator!=(const Color& c2) const{\n  return r != c2.r || g != c2.g || b != c2.b || a != c2.a;\n}\n\nbool Color::operator<(const Color& c2) const{\n  return to_hash(*this) < to_hash(c2);\n}\n\nbool Color::operator>(const Color& c2) const{\n  return to_hash(*this) > to_hash(c2);\n}\n\nHSL::HSL(double h, double s, double l) :\n  h(h),\n  s(s),\n  l(l)\n{\n  assert(0 <= h && h <= 360.0);\n}\n\nHSL::HSL(const HS& hueSat, double l)\n  : h(hueSat.h),\n    s(hueSat.s),\n    l(l)\n{}\n\nHS HSL::GetHS() const{\n  return {h,s};\n}\n\nstatic ColRGB rgb_from_hash(unsigned int h){\n  auto r = static_cast<uchar>((h >> 16) & 0xff);\n  auto g = static_cast<uchar>((h >> 8) & 0xff);\n  auto b = static_cast<uchar>((h) & 0xff);\n  return {r,g,b};\n}\n\nstatic unsigned int to_hash(const ColRGB& c){\n  return (static_cast<unsigned int>(c.r) << 16) |\n    (static_cast<unsigned int>(c.g) << 8) |\n    (static_cast<unsigned int>(c.b));\n}\n\nbool ColRGB::operator<(const ColRGB& c2) const{\n  return to_hash(*this) < to_hash(c2);\n}\n\nColRGB blend_alpha(const Color& color, const ColRGB& bg){\n  const auto a = color.a;\n  const auto ia = invert_color(a);\n  return rgb_from_ints(\n    (color.r * a + bg.r * ia) \/ 255,\n    (color.g * a + bg.g * ia) \/ 255,\n    (color.b * a + bg.b * ia) \/ 255);\n}\n\nColRGB strip_alpha(const Color& color){\n  return ColRGB(color.r, color.g, color.b);\n}\n\nColRGB invert(const ColRGB& c){\n  return {invert_color(c.r), invert_color(c.g), invert_color(c.b)};\n}\n\nColor color_from_ints(int r, int g, int b, int a){\n  return {\n    constrain_color(r),\n    constrain_color(g),\n    constrain_color(b),\n    constrain_color(a)};\n}\n\nColRGB grayscale_rgb(int lightness){\n  return rgb_from_ints(lightness, lightness, lightness);\n}\n\nColor grayscale_rgba(int lightness, int alpha){\n  return color_from_ints(lightness, lightness, lightness, alpha);\n}\n\nColRGB rgb_from_ints(int r, int g, int b){\n  return {constrain_color(r), constrain_color(g), constrain_color(b)};\n}\n\nColor color_from_uints(uint r, uint g, uint b, uint a){\n  return {\n    constrain_color(r),\n    constrain_color(g),\n    constrain_color(b),\n    constrain_color(a)};\n}\n\nColor color_from_double(double r, double g, double b, double a){\n  return {constrain_color(r),\n    constrain_color(g),\n    constrain_color(b),\n    constrain_color(a)};\n}\n\nColRGB rgb_from_double(double r, double g, double b){\n  return {\n    constrain_color(r),\n    constrain_color(g),\n    constrain_color(b)};\n}\n\nbool opaque(const Color& c){\n  return c.a == 255;\n}\n\nbool fully_transparent(const Color& c){\n  return c.a == 0;\n}\n\nbool translucent(const Color& c){\n  return c.a != 255;\n}\n\nbool valid_color(int r, int g, int b, int a){\n  return has_all(colorRange, r, g, b, a);\n}\n\nbool valid_color(int r, int g, int b){\n  return valid_color(r, g, b, 255);\n}\n\nColor with_alpha(const ColRGB& rgb, uchar a){\n  return Color(rgb, a);\n}\n\nColor with_alpha(const Color& c, uchar a){\n  return with_alpha(strip_alpha(c), a);\n}\n\ndouble dmod(double value, double range){\n  while (value >= range){\n    value -= range;\n  }\n  return value;\n}\n\nHSL to_hsl(const ColRGB& c){\n  double R = c.r \/ 255.0;\n  double G = c.g \/ 255.0;\n  double B = c.b \/ 255.0;\n  double M = std::max({R, G, B});\n  double m = std::min({R, G, B});\n  double C = M - m;\n  double Hp = 0;\n\n  if (C == 0){\n    Hp = 0.0;\n  }\n  else if (M == R){\n    Hp = ((((G - B) \/ C))) + 6.0;\n  }\n  else if (M == G){\n    Hp = ((B - R) \/ C) + (2.0);\n  }\n  else if (M == B){\n    Hp = ((R - G) \/ C) + (4.0);\n  }\n\n  \/\/ Hue\n  double H = dmod(60.0 * Hp, 360.0);\n\n  \/\/ Lightness\n  \/\/ ...using Luma instead (i.e. weighted for perceived luminance\n  \/\/ could be better, but trickier\n  double L = (M + m) \/ 2.0;\n\n  \/\/ Saturation\n  double S = C == 0 ? 0 :\n    (C \/ (1.0 - std::fabs(2 * L - 1.0)));\n  return HSL(H, S, L);\n}\n\nColRGB to_rgb(const HSL& c){\n  double C = (1.0 - std::fabs(2 * c.l - 1.0)) * c.s;\n  double Hp = c.h \/ 60.0;\n  double X = C * (1 - std::fabs(dmod(Hp, 2.0) - 1.0));\n\n  double R, G, B;\n  if (Hp < 1){\n    R = C;\n    G = X;\n    B = 0;\n  }\n  else if (Hp < 2){\n    R = X;\n    G = C;\n    B = 0;\n  }\n  else if (Hp < 3){\n    R = 0;\n    G = C;\n    B = X;\n  }\n  else if (Hp < 4){\n    R = 0;\n    G = X;\n    B = C;\n  }\n  else if (Hp < 5){\n    R = X;\n    G = 0;\n    B = C;\n  }\n  else if (Hp <= 6){\n    R = C;\n    G = 0;\n    B = X;\n  }\n  else{\n    assert(false);\n    return ColRGB(0,0,0);\n  }\n  double m = c.l - C \/ 2.0;\n  return rgb_from_double(255 * (R + m) + 0.5,\n    255 * (G + m) + 0.5,\n    255 * (B + m) + 0.5);\n}\n\nColor to_rgba(const HSL& hsl, int a){\n  return Color(to_rgb(hsl),\n    constrain_color(a));\n}\n\nColor subtract(const Color& lhs, const Color& rhs){\n  int r = static_cast<int>(lhs.r) - static_cast<int>(rhs.r);\n  int g = static_cast<int>(lhs.g) - static_cast<int>(rhs.g);\n  int b = static_cast<int>(lhs.b) - static_cast<int>(rhs.b);\n  int a = static_cast<int>(lhs.a) - static_cast<int>(rhs.a);\n  return color_from_ints(r, g, b, a);\n}\n\nColor add(const Color& lhs, const Color& rhs){\n  int r = static_cast<int>(lhs.r) + static_cast<int>(rhs.r);\n  int g = static_cast<int>(lhs.g) + static_cast<int>(rhs.g);\n  int b = static_cast<int>(lhs.b) + static_cast<int>(rhs.b);\n  int a = static_cast<int>(lhs.a) + static_cast<int>(rhs.a);\n  return color_from_ints(r, g, b, a);\n}\n\nint sum_rgb(const Color& c){\n  return static_cast<int>(c.r) +\n    static_cast<int>(c.g) +\n    static_cast<int>(c.b);\n}\n\nunsigned int to_hash(const Color& c){\n  return (static_cast<unsigned int>(c.r) << 24) |\n    (static_cast<unsigned int>(c.g) << 16) |\n    (static_cast<unsigned int>(c.b) << 8) |\n    (static_cast<unsigned int>(c.a));\n}\n\nColor color_from_hash(unsigned int h){\n  auto r = static_cast<uchar>((h >> 24) & 0xff);\n  auto g = static_cast<uchar>((h >> 16) & 0xff);\n  auto b = static_cast<uchar>((h >> 8) & 0xff);\n  auto a = static_cast<uchar>((h & 0xff));\n  return Color(r,g,b,a);\n}\n\nColor mix(const Color& c1, const Color& c2){\n  return color_from_ints(\n    (c1.r + c2.r) \/ 2,\n    (c1.g + c2.g) \/ 2,\n    (c1.b + c2.b) \/ 2,\n    (c1.a + c2.a) \/ 2);\n}\n\nColRGB next_color(const ColRGB& c){\n  auto h = to_hash(c);\n  return h == 0xffffff ? c :\n    rgb_from_hash(h + 1);\n}\n\nColor color_from_hex(unsigned int v){\n  auto r = (v >> 16) & 0xff;\n  auto g = (v >> 8) & 0xff;\n  auto b = v & 0xff;\n  return color_from_ints(r, g, b);\n}\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    TestParallelRandomStatistics.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, there is a non-exclusive\n * license for use of this work by or on behalf of the\n * U.S. Government. Redistribution and use in source and binary forms, with\n * or without modification, are permitted provided that this Notice and any\n * statement of authorship are reproduced on all copies.\n *\/\n\/\/ .SECTION Thanks\n\/\/ Thanks to Philippe Pebay and David Thompson from Sandia National Laboratories \n\/\/ for implementing this test.\n\n#include <mpi.h>\n#include <time.h>\n\n#include \"vtkDescriptiveStatistics.h\"\n#include \"vtkPDescriptiveStatistics.h\"\n#include \"vtkCorrelativeStatistics.h\"\n#include \"vtkPCorrelativeStatistics.h\"\n\n#include \"vtkDoubleArray.h\"\n#include \"vtkMath.h\"\n#include \"vtkMPIController.h\"\n#include \"vtkStdString.h\"\n#include \"vtkTable.h\"\n#include \"vtkVariantArray.h\"\n\n\/\/ For debugging purposes, serial engines can be run on each slice of the distributed data set\n#define DEBUG_WITH_SERIAL_STATS 0 \n\nint nVals = 1000000;\n\n\/\/ This will be called by all processes\nvoid RandomSampleStatistics( vtkMultiProcessController* controller, void* vtkNotUsed(arg) )\n{\n  \/\/ Get local rank\n  int myRank = controller->GetLocalProcessId();\n\n  \/\/ Seed random number generator\n  vtkMath::RandomSeed( static_cast<int>( time( NULL ) ) * ( myRank + 1 ) );\n\n  \/\/ Generate an input table that contains samples of mutually independent random variables over [0, 1]\n  int nUniform = 2;\n  int nNormal  = 2;\n  int nVariables = nUniform + nNormal;\n\n  vtkTable* inputData = vtkTable::New();\n  vtkDoubleArray* doubleArray[4];\n  vtkStdString columnNames[] = { \"Standard Uniform 0\", \n                                 \"Standard Uniform 1\",\n                                 \"Standard Normal 0\",\n                                 \"Standard Normal 1\" };\n  \n  \/\/ Standard uniform samples\n  for ( int c = 0; c < nUniform; ++ c )\n    {\n    doubleArray[c] = vtkDoubleArray::New();\n    doubleArray[c]->SetNumberOfComponents( 1 );\n    doubleArray[c]->SetName( columnNames[c] );\n\n    double x;\n    for ( int r = 0; r < nVals; ++ r )\n      {\n      x = vtkMath::Random();\n      doubleArray[c]->InsertNextValue( x );\n      }\n    \n    inputData->AddColumn( doubleArray[c] );\n    doubleArray[c]->Delete();\n    }\n\n  \/\/ Standard normal samples\n  for ( int c = nUniform; c < nVariables; ++ c )\n    {\n    doubleArray[c] = vtkDoubleArray::New();\n    doubleArray[c]->SetNumberOfComponents( 1 );\n    doubleArray[c]->SetName( columnNames[c] );\n\n    double x;\n    for ( int r = 0; r < nVals; ++ r )\n      {\n      x = vtkMath::Gaussian();\n      doubleArray[c]->InsertNextValue( x );\n      }\n    \n    inputData->AddColumn( doubleArray[c] );\n    doubleArray[c]->Delete();\n    }\n\n#if DEBUG_WITH_SERIAL_STATS\n  \/\/ Instantiate a (serial) descriptive statistics engine and set its ports\n  vtkDescriptiveStatistics* ds = vtkDescriptiveStatistics::New();\n  ds->SetInput( 0, inputData );\n\n  \/\/ Select all columns\n  for ( int c = 0; c < nVariables; ++ c )\n    {\n    ds->AddColumn( columnNames[c] );\n    }\n\n  \/\/ Test (serially) with Learn and Derive options only\n  ds->SetLearn( true );\n  ds->SetDerive( true );\n  ds->SetAssess( true );\n  ds->Update();\n\n  cout << \"\\n## Proc \"\n       << myRank\n       << \" calculated the following statistics ( \"\n       << ds->GetSampleSize()\n       << \" entries per column ):\\n\";\n  for ( vtkIdType r = 0; r < ds->GetOutput( 1 )->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < ds->GetOutput( 1 )->GetNumberOfColumns(); ++ i )\n      {\n      cout << ds->GetOutput( 1 )->GetColumnName( i )\n           << \"=\"\n           << ds->GetOutput( 1 )->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n    cout << \"\\n\";\n    }\n  \n  \/\/ Clean up\n  ds->Delete();\n#endif \/\/DEBUG_WITH_SERIAL_STATS\n\n  \/\/ Synchronize and start clock\n  controller->Barrier();\n  time_t t0;\n  time ( &t0 );\n  \n  \/\/ Instantiate a parallel descriptive statistics engine and set its ports\n  vtkPDescriptiveStatistics* pds = vtkPDescriptiveStatistics::New();\n  pds->SetInput( 0, inputData );\n  vtkTable* outputData = pds->GetOutput( 0 );\n  vtkTable* outputMeta = pds->GetOutput( 1 );\n\n  \/\/ Select all columns\n  for ( int c = 0; c < nVariables; ++ c )\n    {\n    pds->AddColumn( columnNames[c] );\n    }\n\n  \/\/ Test (in parallel) with Learn, Derive, and Assess options turned on\n  pds->SetLearn( true );\n  pds->SetDerive( true );\n  pds->SetAssess( true );\n  pds->SignedDeviationsOff(); \/\/ Use unsigned deviations\n  pds->Update();\n\n  \/\/ Synchronize and stop clock\n  controller->Barrier();\n  time_t t1;\n  time ( &t1 );\n\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Completed parallel calculation of descriptive statistics (with assessment):\\n\"\n         << \"   Total sample size: \"\n         << pds->GetSampleSize()\n         << \" \\n\"\n         << \"   Wall time: \"\n         << difftime( t1, t0 )\n         << \" sec.\\n\";\n\n   for ( vtkIdType r = 0; r < outputMeta->GetNumberOfRows(); ++ r )\n      {\n      cout << \"   \";\n      for ( int c = 0; c < outputMeta->GetNumberOfColumns(); ++ c )\n        {\n        vtkStdString colName = outputMeta->GetColumnName( c );\n\n        \/\/ Do not report M aggregates\n        if ( colName[0] == 'M' && colName[1] != 'e' )\n          {\n          continue;\n          }\n\n        cout << colName\n             << \"=\"\n             << outputMeta->GetValue( r, c ).ToString()\n             << \"  \";\n        }\n      cout << \"\\n\";\n      }\n    }\n  \n  \/\/ Verify that the DISTRIBUTED standard normal samples indeed statisfy the 68-95-99.7 rule\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Verifying whether the distributed standard normal samples satisfy the 68-95-99.7 rule:\\n\";\n    }\n  \n  vtkVariantArray* relDev[2];\n  relDev[0] = vtkVariantArray::SafeDownCast(\n    outputData->GetColumnByName( \"Relative Deviation(Standard Normal 0)\" ) );\n  relDev[1] = vtkVariantArray::SafeDownCast(\n    outputData->GetColumnByName( \"Relative Deviation(Standard Normal 1)\" ) );\n\n  if ( !relDev[0] || ! relDev[1] )\n    {\n    cout << \"*** Error: \"\n         << \"Empty output column(s) on process \"\n         << controller->GetLocalProcessId()\n         << \".\\n\";\n    }\n\n  for ( int c = 0; c < nNormal; ++ c )\n    {\n    int outsideStdv_l[] = { 0, 0, 0 };\n    double dev;\n    int n = outputData->GetNumberOfRows();\n    for ( vtkIdType r = 0; r < n; ++ r )\n      {\n      dev = relDev[c]->GetValue( r ).ToDouble();\n      if ( dev >= 1. )\n        {\n        ++ outsideStdv_l[0];\n        if ( dev >= 2. )\n          {\n          ++ outsideStdv_l[1];\n          if ( dev >= 3. )\n            {\n            ++ outsideStdv_l[2];\n            }\n          }\n        }\n      }\n\n    \/\/ Sum all local counters\n    int outsideStdv_g[3];\n    controller->AllReduce( outsideStdv_l, \n                           outsideStdv_g, \n                           3, \n                           vtkCommunicator::SUM_OP );\n\n    \/\/ Print out percentages of sample points within 1, 2, and 3 standard deviations of the mean.\n    if ( ! controller->GetLocalProcessId() )\n      {\n      cout << \"   \"\n           << outputData->GetColumnName( nUniform + c )\n           << \":\\n\";\n      for ( int i = 0; i < 3; ++ i )\n        {\n        cout << \"      \" \n             << ( 1. - outsideStdv_g[i] \/ static_cast<double>( pds->GetSampleSize() ) ) * 100.\n             << \"\\% within \"\n             << i + 1\n             << \" standard deviation(s) from the mean.\\n\";\n        }\n      }\n    }\n\n  \/\/ Clean up\n  pds->Delete();\n\n  \/\/ Synchronize and start clock\n  controller->Barrier();\n  time_t t2;\n  time ( &t2 );\n\n  \/\/ Instantiate a parallel correlative statistics engine and set its ports\n  vtkPCorrelativeStatistics* pcs = vtkPCorrelativeStatistics::New();\n  pcs->SetInput( 0, inputData );\n  outputData = pcs->GetOutput( 0 );\n  outputMeta = pcs->GetOutput( 1 );\n\n  \/\/ Select column pairs (uniform vs. uniform, normal vs. normal)\n  pcs->AddColumnPair( columnNames[0], columnNames[1] );\n  pcs->AddColumnPair( columnNames[2], columnNames[3] );\n\n  \/\/ Test (in parallel) with Learn, Derive, and Assess options turned on\n  pcs->SetLearn( true );\n  pcs->SetDerive( true );\n  pcs->SetAssess( true );\n  pcs->Update();\n\n    \/\/ Synchronize and stop clock\n  controller->Barrier();\n  time_t t3;\n  time ( &t3 );\n\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Completed parallel calculation of correlative statistics (with assessment):\\n\"\n         << \"   Total sample size: \"\n         << pcs->GetSampleSize()\n         << \" \\n\"\n         << \"   Wall time: \"\n         << difftime( t3, t2 )\n         << \" sec.\\n\";\n\n    for ( vtkIdType r = 0; r < outputMeta->GetNumberOfRows(); ++ r )\n      {\n      cout << \"   \";\n      for ( int c = 0; c < outputMeta->GetNumberOfColumns(); ++ c )\n        {\n        vtkStdString colName = outputMeta->GetColumnName( c );\n\n        \/\/ Do not report M aggregates\n        if ( colName[0] == 'M' && colName[1] != 'e' )\n          {\n          continue;\n          }\n\n        cout << colName\n             << \"=\"\n             << outputMeta->GetValue( r, c ).ToString()\n             << \"  \";\n        }\n      cout << \"\\n\";\n      }\n    }\n\n  \/\/ Clean up\n  pcs->Delete();\n  inputData->Delete();\n}\n\n\/\/----------------------------------------------------------------------------\nint main( int argc, char** argv )\n{\n  int testValue = 0;\n\n  \/\/ Note that this will create a vtkMPIController if MPI\n  \/\/ is configured, vtkThreadedController otherwise.\n  vtkMPIController* controller = vtkMPIController::New();\n  controller->Initialize( &argc, &argv );\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 ( controller->IsA( \"vtkThreadedController\" ) )\n    {\n    \/\/ Set the number of processes to 2 for this example.\n    controller->SetNumberOfProcesses( 2 );\n    } \n\n  \/\/ Check how many processes have been made available\n  int numProcs = controller->GetNumberOfProcesses();\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"# Running test with \"\n         << numProcs\n         << \" processes...\\n\";\n    }\n\n  \/\/ Execute the function named \"process\" on both processes\n  controller->SetSingleMethod( RandomSampleStatistics, 0 );\n  controller->SingleMethodExecute();\n  \n  \/\/ Clean up and exit\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n# Test completed.\\n\\n\";\n    }\n\n  controller->Finalize();\n  controller->Delete();\n  \n  return testValue;\n}\n<commit_msg>COMP: Fix a method-resolution ambiguity.  Curse you, ISO!<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    TestParallelRandomStatistics.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, there is a non-exclusive\n * license for use of this work by or on behalf of the\n * U.S. Government. Redistribution and use in source and binary forms, with\n * or without modification, are permitted provided that this Notice and any\n * statement of authorship are reproduced on all copies.\n *\/\n\/\/ .SECTION Thanks\n\/\/ Thanks to Philippe Pebay and David Thompson from Sandia National Laboratories \n\/\/ for implementing this test.\n\n#include <mpi.h>\n#include <time.h>\n\n#include \"vtkDescriptiveStatistics.h\"\n#include \"vtkPDescriptiveStatistics.h\"\n#include \"vtkCorrelativeStatistics.h\"\n#include \"vtkPCorrelativeStatistics.h\"\n\n#include \"vtkDoubleArray.h\"\n#include \"vtkMath.h\"\n#include \"vtkMPIController.h\"\n#include \"vtkStdString.h\"\n#include \"vtkTable.h\"\n#include \"vtkVariantArray.h\"\n\n\/\/ For debugging purposes, serial engines can be run on each slice of the distributed data set\n#define DEBUG_WITH_SERIAL_STATS 0 \n\nint nVals = 1000000;\n\n\/\/ This will be called by all processes\nvoid RandomSampleStatistics( vtkMultiProcessController* controller, void* vtkNotUsed(arg) )\n{\n  \/\/ Get local rank\n  int myRank = controller->GetLocalProcessId();\n\n  \/\/ Seed random number generator\n  vtkMath::RandomSeed( static_cast<int>( time( NULL ) ) * ( myRank + 1 ) );\n\n  \/\/ Generate an input table that contains samples of mutually independent random variables over [0, 1]\n  int nUniform = 2;\n  int nNormal  = 2;\n  int nVariables = nUniform + nNormal;\n\n  vtkTable* inputData = vtkTable::New();\n  vtkDoubleArray* doubleArray[4];\n  vtkStdString columnNames[] = { \"Standard Uniform 0\", \n                                 \"Standard Uniform 1\",\n                                 \"Standard Normal 0\",\n                                 \"Standard Normal 1\" };\n  \n  \/\/ Standard uniform samples\n  for ( int c = 0; c < nUniform; ++ c )\n    {\n    doubleArray[c] = vtkDoubleArray::New();\n    doubleArray[c]->SetNumberOfComponents( 1 );\n    doubleArray[c]->SetName( columnNames[c] );\n\n    double x;\n    for ( int r = 0; r < nVals; ++ r )\n      {\n      x = vtkMath::Random();\n      doubleArray[c]->InsertNextValue( x );\n      }\n    \n    inputData->AddColumn( doubleArray[c] );\n    doubleArray[c]->Delete();\n    }\n\n  \/\/ Standard normal samples\n  for ( int c = nUniform; c < nVariables; ++ c )\n    {\n    doubleArray[c] = vtkDoubleArray::New();\n    doubleArray[c]->SetNumberOfComponents( 1 );\n    doubleArray[c]->SetName( columnNames[c] );\n\n    double x;\n    for ( int r = 0; r < nVals; ++ r )\n      {\n      x = vtkMath::Gaussian();\n      doubleArray[c]->InsertNextValue( x );\n      }\n    \n    inputData->AddColumn( doubleArray[c] );\n    doubleArray[c]->Delete();\n    }\n\n#if DEBUG_WITH_SERIAL_STATS\n  \/\/ Instantiate a (serial) descriptive statistics engine and set its ports\n  vtkDescriptiveStatistics* ds = vtkDescriptiveStatistics::New();\n  ds->SetInput( 0, inputData );\n\n  \/\/ Select all columns\n  for ( int c = 0; c < nVariables; ++ c )\n    {\n    ds->AddColumn( columnNames[c] );\n    }\n\n  \/\/ Test (serially) with Learn and Derive options only\n  ds->SetLearn( true );\n  ds->SetDerive( true );\n  ds->SetAssess( true );\n  ds->Update();\n\n  cout << \"\\n## Proc \"\n       << myRank\n       << \" calculated the following statistics ( \"\n       << ds->GetSampleSize()\n       << \" entries per column ):\\n\";\n  for ( vtkIdType r = 0; r < ds->GetOutput( 1 )->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < ds->GetOutput( 1 )->GetNumberOfColumns(); ++ i )\n      {\n      cout << ds->GetOutput( 1 )->GetColumnName( i )\n           << \"=\"\n           << ds->GetOutput( 1 )->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n    cout << \"\\n\";\n    }\n  \n  \/\/ Clean up\n  ds->Delete();\n#endif \/\/DEBUG_WITH_SERIAL_STATS\n\n  \/\/ Synchronize and start clock\n  controller->Barrier();\n  time_t t0;\n  time ( &t0 );\n  \n  \/\/ Instantiate a parallel descriptive statistics engine and set its ports\n  vtkPDescriptiveStatistics* pds = vtkPDescriptiveStatistics::New();\n  pds->SetInput( 0, inputData );\n  vtkTable* outputData = pds->GetOutput( 0 );\n  vtkTable* outputMeta = pds->GetOutput( 1 );\n\n  \/\/ Select all columns\n  for ( int c = 0; c < nVariables; ++ c )\n    {\n    pds->AddColumn( columnNames[c] );\n    }\n\n  \/\/ Test (in parallel) with Learn, Derive, and Assess options turned on\n  pds->SetLearn( true );\n  pds->SetDerive( true );\n  pds->SetAssess( true );\n  pds->SignedDeviationsOff(); \/\/ Use unsigned deviations\n  pds->Update();\n\n  \/\/ Synchronize and stop clock\n  controller->Barrier();\n  time_t t1;\n  time ( &t1 );\n\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Completed parallel calculation of descriptive statistics (with assessment):\\n\"\n         << \"   Total sample size: \"\n         << pds->GetSampleSize()\n         << \" \\n\"\n         << \"   Wall time: \"\n         << difftime( t1, t0 )\n         << \" sec.\\n\";\n\n   for ( vtkIdType r = 0; r < outputMeta->GetNumberOfRows(); ++ r )\n      {\n      cout << \"   \";\n      for ( int c = 0; c < outputMeta->GetNumberOfColumns(); ++ c )\n        {\n        vtkStdString colName = outputMeta->GetColumnName( c );\n\n        \/\/ Do not report M aggregates\n        if ( colName.at(0) == 'M' && colName.at(1) != 'e' )\n          {\n          continue;\n          }\n\n        cout << colName\n             << \"=\"\n             << outputMeta->GetValue( r, c ).ToString()\n             << \"  \";\n        }\n      cout << \"\\n\";\n      }\n    }\n  \n  \/\/ Verify that the DISTRIBUTED standard normal samples indeed statisfy the 68-95-99.7 rule\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Verifying whether the distributed standard normal samples satisfy the 68-95-99.7 rule:\\n\";\n    }\n  \n  vtkVariantArray* relDev[2];\n  relDev[0] = vtkVariantArray::SafeDownCast(\n    outputData->GetColumnByName( \"Relative Deviation(Standard Normal 0)\" ) );\n  relDev[1] = vtkVariantArray::SafeDownCast(\n    outputData->GetColumnByName( \"Relative Deviation(Standard Normal 1)\" ) );\n\n  if ( !relDev[0] || ! relDev[1] )\n    {\n    cout << \"*** Error: \"\n         << \"Empty output column(s) on process \"\n         << controller->GetLocalProcessId()\n         << \".\\n\";\n    }\n\n  for ( int c = 0; c < nNormal; ++ c )\n    {\n    int outsideStdv_l[] = { 0, 0, 0 };\n    double dev;\n    int n = outputData->GetNumberOfRows();\n    for ( vtkIdType r = 0; r < n; ++ r )\n      {\n      dev = relDev[c]->GetValue( r ).ToDouble();\n      if ( dev >= 1. )\n        {\n        ++ outsideStdv_l[0];\n        if ( dev >= 2. )\n          {\n          ++ outsideStdv_l[1];\n          if ( dev >= 3. )\n            {\n            ++ outsideStdv_l[2];\n            }\n          }\n        }\n      }\n\n    \/\/ Sum all local counters\n    int outsideStdv_g[3];\n    controller->AllReduce( outsideStdv_l, \n                           outsideStdv_g, \n                           3, \n                           vtkCommunicator::SUM_OP );\n\n    \/\/ Print out percentages of sample points within 1, 2, and 3 standard deviations of the mean.\n    if ( ! controller->GetLocalProcessId() )\n      {\n      cout << \"   \"\n           << outputData->GetColumnName( nUniform + c )\n           << \":\\n\";\n      for ( int i = 0; i < 3; ++ i )\n        {\n        cout << \"      \" \n             << ( 1. - outsideStdv_g[i] \/ static_cast<double>( pds->GetSampleSize() ) ) * 100.\n             << \"\\% within \"\n             << i + 1\n             << \" standard deviation(s) from the mean.\\n\";\n        }\n      }\n    }\n\n  \/\/ Clean up\n  pds->Delete();\n\n  \/\/ Synchronize and start clock\n  controller->Barrier();\n  time_t t2;\n  time ( &t2 );\n\n  \/\/ Instantiate a parallel correlative statistics engine and set its ports\n  vtkPCorrelativeStatistics* pcs = vtkPCorrelativeStatistics::New();\n  pcs->SetInput( 0, inputData );\n  outputData = pcs->GetOutput( 0 );\n  outputMeta = pcs->GetOutput( 1 );\n\n  \/\/ Select column pairs (uniform vs. uniform, normal vs. normal)\n  pcs->AddColumnPair( columnNames[0], columnNames[1] );\n  pcs->AddColumnPair( columnNames[2], columnNames[3] );\n\n  \/\/ Test (in parallel) with Learn, Derive, and Assess options turned on\n  pcs->SetLearn( true );\n  pcs->SetDerive( true );\n  pcs->SetAssess( true );\n  pcs->Update();\n\n    \/\/ Synchronize and stop clock\n  controller->Barrier();\n  time_t t3;\n  time ( &t3 );\n\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Completed parallel calculation of correlative statistics (with assessment):\\n\"\n         << \"   Total sample size: \"\n         << pcs->GetSampleSize()\n         << \" \\n\"\n         << \"   Wall time: \"\n         << difftime( t3, t2 )\n         << \" sec.\\n\";\n\n    for ( vtkIdType r = 0; r < outputMeta->GetNumberOfRows(); ++ r )\n      {\n      cout << \"   \";\n      for ( int c = 0; c < outputMeta->GetNumberOfColumns(); ++ c )\n        {\n        vtkStdString colName = outputMeta->GetColumnName( c );\n\n        \/\/ Do not report M aggregates\n        if ( colName.at(0) == 'M' && colName.at(1) != 'e' )\n          {\n          continue;\n          }\n\n        cout << colName\n             << \"=\"\n             << outputMeta->GetValue( r, c ).ToString()\n             << \"  \";\n        }\n      cout << \"\\n\";\n      }\n    }\n\n  \/\/ Clean up\n  pcs->Delete();\n  inputData->Delete();\n}\n\n\/\/----------------------------------------------------------------------------\nint main( int argc, char** argv )\n{\n  int testValue = 0;\n\n  \/\/ Note that this will create a vtkMPIController if MPI\n  \/\/ is configured, vtkThreadedController otherwise.\n  vtkMPIController* controller = vtkMPIController::New();\n  controller->Initialize( &argc, &argv );\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 ( controller->IsA( \"vtkThreadedController\" ) )\n    {\n    \/\/ Set the number of processes to 2 for this example.\n    controller->SetNumberOfProcesses( 2 );\n    } \n\n  \/\/ Check how many processes have been made available\n  int numProcs = controller->GetNumberOfProcesses();\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"# Running test with \"\n         << numProcs\n         << \" processes...\\n\";\n    }\n\n  \/\/ Execute the function named \"process\" on both processes\n  controller->SetSingleMethod( RandomSampleStatistics, 0 );\n  controller->SingleMethodExecute();\n  \n  \/\/ Clean up and exit\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n# Test completed.\\n\\n\";\n    }\n\n  controller->Finalize();\n  controller->Delete();\n  \n  return testValue;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef PRESETEDITOR_HPP\n#define PRESETEDITOR_HPP\n\n\/\/ stdlib\n#include <string>\n#include <functional>\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 <wx\/treectrl.h>\n#include <wx\/imaglist.h>\n#include <wx\/panel.h>\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<Preset> current_preset;\n\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<void ()> on_save_preset {};\n    std::function<void ()> 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<PresetPage*> _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<int>(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<commit_msg>Added comment for prompt_unsaved_changes<commit_after>#ifndef PRESETEDITOR_HPP\n#define PRESETEDITOR_HPP\n\n\/\/ stdlib\n#include <string>\n#include <functional>\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 <wx\/treectrl.h>\n#include <wx\/imaglist.h>\n#include <wx\/panel.h>\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<Preset> 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<void ()> on_save_preset {};\n    std::function<void ()> 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<PresetPage*> _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<int>(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":"<commit_before>#include \"Genes\/Stacked_Pawns_Gene.h\"\n\n#include <memory>\n#include <string>\n\n#include \"Game\/Board.h\"\n#include \"Game\/Piece.h\"\n#include \"Game\/Color.h\"\n\n#include \"Genes\/Gene.h\"\n\ndouble Stacked_Pawns_Gene::score_board(const Board& board, Color perspective, size_t) const\n{\n    double score = 0.0;\n\n    auto own_pawn = board.piece_instance(PAWN, perspective);\n    for(char file = 'a'; file <= 'h'; ++file)\n    {\n        int pawn_count = 0;\n\n        for(int rank = 1; rank <= 8; ++rank)\n        {\n            if(board.piece_on_square(file, rank) == own_pawn)\n            {\n                ++pawn_count;\n            }\n        }\n\n        if(pawn_count > 1)\n        {\n            score += pawn_count - 1;\n        }\n    }\n\n    return -score\/6; \/\/ negative since, presumably, stacked pawns are bad;\n                     \/\/ priority can still evolve to be negative.\n                     \/\/ Divide by six since six is the maximum number of pawns\n                     \/\/ that can be blocked by other pawns.\n}\n\nstd::unique_ptr<Gene> Stacked_Pawns_Gene::duplicate() const\n{\n    return std::make_unique<Stacked_Pawns_Gene>(*this);\n}\n\nstd::string Stacked_Pawns_Gene::name() const\n{\n    return \"Stacked Pawns Gene\";\n}\n<commit_msg>Reduce search space when looking for pawns<commit_after>#include \"Genes\/Stacked_Pawns_Gene.h\"\n\n#include <memory>\n#include <string>\n\n#include \"Game\/Board.h\"\n#include \"Game\/Piece.h\"\n#include \"Game\/Color.h\"\n\n#include \"Genes\/Gene.h\"\n\ndouble Stacked_Pawns_Gene::score_board(const Board& board, Color perspective, size_t) const\n{\n    double score = 0.0;\n\n    auto own_pawn = board.piece_instance(PAWN, perspective);\n    for(char file = 'a'; file <= 'h'; ++file)\n    {\n        int pawn_count = 0;\n\n        for(int rank = 2; rank <= 7; ++rank)\n        {\n            if(board.piece_on_square(file, rank) == own_pawn)\n            {\n                ++pawn_count;\n            }\n        }\n\n        if(pawn_count > 1)\n        {\n            score += pawn_count - 1;\n        }\n    }\n\n    return -score\/6; \/\/ negative since, presumably, stacked pawns are bad;\n                     \/\/ priority can still evolve to be negative.\n                     \/\/ Divide by six since six is the maximum number of pawns\n                     \/\/ that can be blocked by other pawns.\n}\n\nstd::unique_ptr<Gene> Stacked_Pawns_Gene::duplicate() const\n{\n    return std::make_unique<Stacked_Pawns_Gene>(*this);\n}\n\nstd::string Stacked_Pawns_Gene::name() const\n{\n    return \"Stacked Pawns Gene\";\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/test.h\"\n#include <Eigen\/Core>\n#include \"..\/..\/src\/utils\/persister.h\"\n#include \"..\/..\/src\/label.h\"\n#include \"..\/..\/src\/mesh_node.h\"\n\nTEST(Test_QObjectPersistence, SaveAndLoadASimpleString)\n{\n  std::string text = \"example text\";\n\n  Persister::save(text, \"test.xml\");\n\n  EXPECT_EQ(text, Persister::load<std::string>(\"test.xml\"));\n}\n\nTEST(Test_QObjectPersistence, SaveAndLoadAVector)\n{\n  Eigen::Vector3f vector(1.0f, 1.1f, 1.2f);\n\n  Persister::save(vector, \"test.xml\");\n  auto loaded = Persister::load<Eigen::Vector3f>(\"test.xml\");\n  EXPECT_Vector3f_NEAR(vector, loaded, 1E-5f);\n}\n\nTEST(Test_QObjectPersistence, SaveAndLoadALabel)\n{\n  Label label(2, \"my label 2\", Eigen::Vector3f(1, 2, 3));\n\n  Persister::save(label, \"test.xml\");\n  auto loaded = Persister::load<Label>(\"test.xml\");\n  EXPECT_EQ(label.id, loaded.id);\n  EXPECT_EQ(label.text, loaded.text);\n  EXPECT_Vector3f_NEAR(label.anchorPosition, loaded.anchorPosition, 1E-5f);\n}\n\nTEST(Test_QObjectPersistence, SaveAndLoadMeshNode)\n{\n}\n\nTEST(Test_QObjectPersistence, SaveAndLoadAMatrix)\n{\n  Eigen::Matrix4f matrix;\n  matrix << 0.0f, 0.1f, 0.2f, 0.3f, 1.0f, 1.1f, 1.2f, 1.3f, 2.0f, 2.1f, 2.2f,\n      2.3f, 3.0f, 3.1f, 3.2f, 3.3f;\n\n  Persister::save(matrix, \"test.xml\");\n  auto loaded = Persister::load<Eigen::Matrix4f>(\"test.xml\");\n  EXPECT_Matrix4f_NEAR(matrix, loaded, 1E-5f);\n}\n<commit_msg>Test to save and load a label pointer.<commit_after>#include \"..\/test.h\"\n#include <Eigen\/Core>\n#include \"..\/..\/src\/utils\/persister.h\"\n#include \"..\/..\/src\/label.h\"\n#include \"..\/..\/src\/mesh_node.h\"\n\nTEST(Test_QObjectPersistence, SaveAndLoadASimpleString)\n{\n  std::string text = \"example text\";\n\n  Persister::save(text, \"test.xml\");\n\n  EXPECT_EQ(text, Persister::load<std::string>(\"test.xml\"));\n}\n\nTEST(Test_QObjectPersistence, SaveAndLoadAVector)\n{\n  Eigen::Vector3f vector(1.0f, 1.1f, 1.2f);\n\n  Persister::save(vector, \"test.xml\");\n  auto loaded = Persister::load<Eigen::Vector3f>(\"test.xml\");\n  EXPECT_Vector3f_NEAR(vector, loaded, 1E-5f);\n}\n\nTEST(Test_QObjectPersistence, SaveAndLoadALabel)\n{\n  Label label(2, \"my label 2\", Eigen::Vector3f(1, 2, 3));\n\n  Persister::save(label, \"test.xml\");\n  auto loaded = Persister::load<Label>(\"test.xml\");\n  EXPECT_EQ(label.id, loaded.id);\n  EXPECT_EQ(label.text, loaded.text);\n  EXPECT_Vector3f_NEAR(label.anchorPosition, loaded.anchorPosition, 1E-5f);\n}\n\nTEST(Test_QObjectPersistence, SaveAndLoadALabelPointer)\n{\n  auto label = new Label(2, \"my label 2\", Eigen::Vector3f(1, 2, 3));\n\n  Persister::save(label, \"test.xml\");\n  auto loaded = Persister::load<Label*>(\"test.xml\");\n  EXPECT_EQ(label->id, loaded->id);\n  EXPECT_EQ(label->text, loaded->text);\n  EXPECT_Vector3f_NEAR(label->anchorPosition, loaded->anchorPosition, 1E-5f);\n\n  delete label;\n  delete loaded;\n}\n\nTEST(Test_QObjectPersistence, SaveAndLoadAMatrix)\n{\n  Eigen::Matrix4f matrix;\n  matrix << 0.0f, 0.1f, 0.2f, 0.3f, 1.0f, 1.1f, 1.2f, 1.3f, 2.0f, 2.1f, 2.2f,\n      2.3f, 3.0f, 3.1f, 3.2f, 3.3f;\n\n  Persister::save(matrix, \"test.xml\");\n  auto loaded = Persister::load<Eigen::Matrix4f>(\"test.xml\");\n  EXPECT_Matrix4f_NEAR(matrix, loaded, 1E-5f);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n** Copyright 2011 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 <assert.h>\n#include <QMutexLocker>\n#include <QScopedPointer>\n#include <stdlib.h>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/file\/stream.hh\"\n#include \"com\/centreon\/broker\/io\/exceptions\/shutdown.hh\"\n#include \"com\/centreon\/broker\/io\/raw.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::file;\n\n\/**************************************\n*                                     *\n*           Private Methods           *\n*                                     *\n**************************************\/\n\n\/**\n *  @brief Copy constructor.\n *\n *  Any call to this constructor will lead to a call to abort().\n *\n *  @param[in] s Object to copy.\n *\/\nstream::stream(stream const& s) : io::stream(s) {\n  assert(false);\n  abort();\n}\n\n\/**\n *  @brief Assignment operator.\n *\n *  Any call to this method will lead to 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(false);\n  abort();\n  return (*this);\n}\n\n\/**************************************\n*                                     *\n*           Public Methods            *\n*                                     *\n**************************************\/\n\n\/**\n *  Constructor.\n *\n *  @param[in] filename Filename.\n *  @param[in] mode     Open mode.\n *\/\nstream::stream(QString const& filename, QIODevice::OpenMode mode)\n  : _file(filename) {\n  if (!_file.open(mode))\n    throw (exceptions::msg() << \"file: could not open '\"\n             << filename << \"': \" << _file.errorString());\n  _woffset = _file.pos();\n  if (!_file.reset())\n    throw (exceptions::msg() << \"file: could not reset in '\"\n             << filename << \"': \" << _file.errorString());\n  _roffset = _file.pos();\n  _coffset = _roffset;\n  _process_in = (mode & QIODevice::ReadOnly);\n  _process_out = (mode & QIODevice::WriteOnly);\n}\n\n\/**\n *  Destructor.\n *\/\nstream::~stream() {\n  logging::debug(logging::medium) << \"file: closing '\"\n    << _file.fileName() << \"'\";\n  _file.flush();\n  _file.close();\n  if (_woffset == _roffset) {\n    logging::info(logging::high) << \"file: end of file '\"\n      << _file.fileName() << \"' reached, erasing file\";\n    QFile::remove(_file.fileName());\n  }\n  else\n    logging::debug(logging::medium) << \"file: not erasing '\"\n      << _file.fileName() << \"' write offset is \" << _woffset\n      << \" whereas read offset is \" << _roffset;\n}\n\n\/**\n *  Set processing flags.\n *\n *  @param[in] in  Set to true to process input events.\n *  @param[in] out Set to true to process output events.\n *\/\nvoid stream::process(bool in, bool out) {\n  QMutexLocker lock(&_mutex);\n  _process_in = in;\n  _process_out = in || !out;\n  return ;\n}\n\n\/**\n *  Read data from the file.\n *\n *  @return Bunch of data.\n *\/\nQSharedPointer<io::data> stream::read() {\n  \/\/ Lock mutex.\n  QMutexLocker lock(&_mutex);\n\n  \/\/ Check that read should be done.\n  if (!_process_in)\n    throw (io::exceptions::shutdown(!_process_in, !_process_out)\n             << \"file stream is shutdown\");\n\n  \/\/ Seek if necessary.\n  if (_roffset != _coffset) {\n    if (!_file.seek(_roffset))\n      throw (exceptions::msg() << \"file: could not seek for reading \" \\\n                  \"in '\" << _file.fileName() << \"' at offset \"\n               << static_cast<unsigned long long>(_roffset));\n  }\n\n  \/\/ Build data array.\n  QScopedPointer<io::raw> data(new io::raw);\n  data->resize(4096);\n\n  \/\/ Read data.\n  QSharedPointer<io::data> retval;\n  qint64 rb(_file.read(data->QByteArray::data(), data->size()));\n  if (!rb) \/\/ XXX : io::exceptions::error\n    throw (io::exceptions::shutdown(true, !_process_out)\n             << \"file does not have any more data\");\n  else if (rb < 0) {\n    exceptions::msg e;\n    e << \"file: could not read data from '\"\n      << _file.fileName() << \"': \" << _file.errorString();\n    _roffset = _file.pos();\n    _coffset = _roffset;\n    throw (e);\n  }\n  else {\n    data->resize(rb);\n    _roffset += rb;\n    _coffset = _roffset;\n    retval = QSharedPointer<io::data>(data.take());\n  }\n  return (retval);\n}\n\n\/**\n *  Write data to the file.\n *\n *  @param[in] d Data to write.\n *\/\nvoid stream::write(QSharedPointer<io::data> d) {\n  \/\/ Check that writing should be processed.\n  if (!_process_out)\n    throw (io::exceptions::shutdown(!_process_in, !_process_out)\n             << \"file stream is shutdown\");\n\n  if (d->type() == \"com::centreon::broker::io::raw\") {\n    \/\/ Lock mutex.\n    QMutexLocker lock(&_mutex);\n\n    \/\/ Seek to end of file if necessary.\n    if (_woffset != _coffset) {\n      if (!_file.seek(_woffset))\n        throw (exceptions::msg() << \"file: could not seek for writing\" \\\n                    \" in '\" << _file.fileName() << \"' at offset \"\n                 << static_cast<unsigned long long>(_woffset));\n    }\n\n    \/\/ Get data.\n    void* memory;\n    unsigned int size;\n    {\n      io::raw* data(static_cast<io::raw*>(d.data()));\n      memory = data->QByteArray::data();\n      size = data->size();\n    }\n\n    \/\/ Debug message.\n    logging::debug(logging::low) << \"file: write request of \"\n      << size << \" bytes\";\n\n    \/\/ Write data.\n    while (size > 0) {\n      qint64 wb(_file.write(static_cast<char*>(memory), size));\n      if (wb <= 0) {\n        exceptions::msg e;\n        e << \"file: could not write data in '\" << _file.fileName()\n          << \"': \" << _file.errorString();\n        _woffset = _file.pos();\n        _coffset = _woffset;\n        throw (e);\n      }\n      size -= wb;\n      _woffset += wb;\n      _file.waitForBytesWritten(-1);\n    }\n    _coffset = _woffset;\n  }\n  else\n    logging::info(logging::low) << \"file: write request with \"\t\\\n      \"invalid data (\" << d->type() << \")\";\n  return ;\n}\n<commit_msg>Erase retention file as it is read.<commit_after>\/*\n** Copyright 2011 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 <assert.h>\n#include <QMutexLocker>\n#include <QScopedPointer>\n#include <stdlib.h>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/file\/stream.hh\"\n#include \"com\/centreon\/broker\/io\/exceptions\/shutdown.hh\"\n#include \"com\/centreon\/broker\/io\/raw.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::file;\n\n\/**************************************\n*                                     *\n*           Private Methods           *\n*                                     *\n**************************************\/\n\n\/**\n *  @brief Copy constructor.\n *\n *  Any call to this constructor will lead to a call to abort().\n *\n *  @param[in] s Object to copy.\n *\/\nstream::stream(stream const& s) : io::stream(s) {\n  assert(false);\n  abort();\n}\n\n\/**\n *  @brief Assignment operator.\n *\n *  Any call to this method will lead to 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(false);\n  abort();\n  return (*this);\n}\n\n\/**************************************\n*                                     *\n*           Public Methods            *\n*                                     *\n**************************************\/\n\n\/**\n *  Constructor.\n *\n *  @param[in] filename Filename.\n *  @param[in] mode     Open mode.\n *\/\nstream::stream(QString const& filename, QIODevice::OpenMode mode)\n  : _file(filename) {\n  if (!_file.open(mode))\n    throw (exceptions::msg() << \"file: could not open '\"\n             << filename << \"': \" << _file.errorString());\n  _woffset = _file.pos();\n  if (!_file.reset())\n    throw (exceptions::msg() << \"file: could not reset in '\"\n             << filename << \"': \" << _file.errorString());\n  _roffset = _file.pos();\n  _coffset = _roffset;\n  _process_in = (mode & QIODevice::ReadOnly);\n  _process_out = (mode & QIODevice::WriteOnly);\n}\n\n\/**\n *  Destructor.\n *\/\nstream::~stream() {\n  logging::debug(logging::medium) << \"file: closing '\"\n    << _file.fileName() << \"'\";\n  _file.flush();\n  _file.close();\n  if (_woffset == _roffset) {\n    logging::info(logging::high) << \"file: end of file '\"\n      << _file.fileName() << \"' reached, erasing file\";\n    QFile::remove(_file.fileName());\n  }\n  else\n    logging::debug(logging::medium) << \"file: not erasing '\"\n      << _file.fileName() << \"' write offset is \" << _woffset\n      << \" whereas read offset is \" << _roffset;\n}\n\n\/**\n *  Set processing flags.\n *\n *  @param[in] in  Set to true to process input events.\n *  @param[in] out Set to true to process output events.\n *\/\nvoid stream::process(bool in, bool out) {\n  QMutexLocker lock(&_mutex);\n  _process_in = in;\n  _process_out = in || !out;\n  return ;\n}\n\n\/**\n *  Read data from the file.\n *\n *  @return Bunch of data.\n *\/\nQSharedPointer<io::data> stream::read() {\n  \/\/ Lock mutex.\n  QMutexLocker lock(&_mutex);\n\n  \/\/ Check that read should be done.\n  if (!_process_in)\n    throw (io::exceptions::shutdown(!_process_in, !_process_out)\n             << \"file stream is shutdown\");\n\n  \/\/ Seek if necessary.\n  if (_roffset != _coffset) {\n    if (!_file.seek(_roffset))\n      throw (exceptions::msg() << \"file: could not seek for reading \" \\\n                  \"in '\" << _file.fileName() << \"' at offset \"\n               << static_cast<unsigned long long>(_roffset));\n  }\n\n  \/\/ Build data array.\n  QScopedPointer<io::raw> data(new io::raw);\n  data->resize(4096);\n\n  \/\/ Read data.\n  qint64 old_roffset(_roffset);\n  QSharedPointer<io::data> retval;\n  qint64 rb(_file.read(data->QByteArray::data(), data->size()));\n  if (!rb) \/\/ XXX : io::exceptions::error\n    throw (io::exceptions::shutdown(true, !_process_out)\n             << \"file does not have any more data\");\n  else if (rb < 0) {\n    exceptions::msg e;\n    e << \"file: could not read data from '\"\n      << _file.fileName() << \"': \" << _file.errorString();\n    _roffset = _file.pos();\n    _coffset = _roffset;\n    throw (e);\n  }\n  else {\n    \/\/ Process data.\n    data->resize(rb);\n    _roffset += rb;\n    _coffset = _roffset;\n    retval = QSharedPointer<io::data>(data.take());\n\n    \/\/ Erase read data.\n    if (!_file.seek(old_roffset))\n      logging::error(logging::medium) << \"file: erase seek failed in '\"\n        << _file.fileName() << \"'\";\n    else {\n      QByteArray eraser;\n      eraser.fill('\\n', rb);\n      while (!eraser.isEmpty()) {\n        rb = _file.write(eraser.data(), eraser.size());\n        if (rb <= 0) {\n          logging::error(logging::medium)\n            << \"file: erasing request failed in '\" << _file.fileName()\n            << \"'\";\n          _coffset -= eraser.size();\n          break ;\n        }\n        else\n          eraser.resize(eraser.size() - rb);\n      }\n    }\n  }\n  return (retval);\n}\n\n\/**\n *  Write data to the file.\n *\n *  @param[in] d Data to write.\n *\/\nvoid stream::write(QSharedPointer<io::data> d) {\n  \/\/ Check that writing should be processed.\n  if (!_process_out)\n    throw (io::exceptions::shutdown(!_process_in, !_process_out)\n             << \"file stream is shutdown\");\n\n  if (d->type() == \"com::centreon::broker::io::raw\") {\n    \/\/ Lock mutex.\n    QMutexLocker lock(&_mutex);\n\n    \/\/ Seek to end of file if necessary.\n    if (_woffset != _coffset) {\n      if (!_file.seek(_woffset))\n        throw (exceptions::msg() << \"file: could not seek for writing\" \\\n                    \" in '\" << _file.fileName() << \"' at offset \"\n                 << static_cast<unsigned long long>(_woffset));\n    }\n\n    \/\/ Get data.\n    void* memory;\n    unsigned int size;\n    {\n      io::raw* data(static_cast<io::raw*>(d.data()));\n      memory = data->QByteArray::data();\n      size = data->size();\n    }\n\n    \/\/ Debug message.\n    logging::debug(logging::low) << \"file: write request of \"\n      << size << \" bytes\";\n\n    \/\/ Write data.\n    while (size > 0) {\n      qint64 wb(_file.write(static_cast<char*>(memory), size));\n      if (wb <= 0) {\n        exceptions::msg e;\n        e << \"file: could not write data in '\" << _file.fileName()\n          << \"': \" << _file.errorString();\n        _woffset = _file.pos();\n        _coffset = _woffset;\n        throw (e);\n      }\n      size -= wb;\n      _woffset += wb;\n      _file.waitForBytesWritten(-1);\n    }\n    _coffset = _woffset;\n  }\n  else\n    logging::info(logging::low) << \"file: write request with \"\t\\\n      \"invalid data (\" << d->type() << \")\";\n  return ;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"Sha256.hpp\"\n#include \"DoubleHash.hpp\"\n\nnamespace Ethereum{\n\n\nclass DoubleSha256CheckSum\n{\n    public:\n\n        template<class Iterator>\n        uint32_t operator()(Iterator begin, Iterator end) const;\n\n        template<class Data>\n        uint32_t operator()(const Data &) const;\n\n        template<class Iterator>\n        uint32_t checksum(Iterator begin, Iterator end) const;\n\n        template<class Data>\n        uint32_t checksum(const Data &) const;\n\n};\n\n\n\n}\n\n#include \"DoubleSha256CheckSum.ipp\"\n<commit_msg>stdint dependency<commit_after>#pragma once\n\n#include <stdint.h>\n\n#include \"Sha256.hpp\"\n#include \"DoubleHash.hpp\"\n\n\nnamespace Ethereum{\n\n\nclass DoubleSha256CheckSum\n{\n    public:\n\n        template<class Iterator>\n        uint32_t operator()(Iterator begin, Iterator end) const;\n\n        template<class Data>\n        uint32_t operator()(const Data &) const;\n\n        template<class Iterator>\n        uint32_t checksum(Iterator begin, Iterator end) const;\n\n        template<class Data>\n        uint32_t checksum(const Data &) const;\n\n};\n\n\n\n}\n\n#include \"DoubleSha256CheckSum.ipp\"\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 \"config.h\"\n#include \"core\/css\/parser\/CSSParserImpl.h\"\n\n#include \"core\/css\/CSSStyleSheet.h\"\n#include \"core\/css\/StylePropertySet.h\"\n#include \"core\/css\/StyleSheetContents.h\"\n#include \"core\/css\/parser\/CSSParserValues.h\"\n#include \"core\/css\/parser\/CSSPropertyParser.h\"\n#include \"core\/css\/parser\/CSSTokenizer.h\"\n#include \"core\/dom\/Document.h\"\n#include \"core\/dom\/Element.h\"\n#include \"core\/frame\/UseCounter.h\"\n#include \"wtf\/BitArray.h\"\n\nnamespace blink {\n\nCSSParserImpl::CSSParserImpl(const CSSParserContext& context, const String& s)\n: m_context(context)\n{\n    CSSTokenizer::tokenize(s, m_tokens);\n}\n\nbool CSSParserImpl::parseValue(MutableStylePropertySet* declaration, CSSPropertyID propertyID, const String& string, bool important, const CSSParserContext& context)\n{\n    CSSParserImpl parser(context, string);\n    CSSRuleSourceData::Type ruleType = CSSRuleSourceData::STYLE_RULE;\n    if (declaration->cssParserMode() == CSSViewportRuleMode)\n        ruleType = CSSRuleSourceData::VIEWPORT_RULE;\n    parser.consumeDeclarationValue(CSSParserTokenRange(parser.m_tokens), propertyID, important, ruleType);\n    if (parser.m_parsedProperties.isEmpty())\n        return false;\n    declaration->addParsedProperties(parser.m_parsedProperties);\n    return true;\n}\n\nstatic inline void filterProperties(bool important, const WillBeHeapVector<CSSProperty, 256>& input, WillBeHeapVector<CSSProperty, 256>& output, size_t& unusedEntries, BitArray<numCSSProperties>& seenProperties)\n{\n    \/\/ Add properties in reverse order so that highest priority definitions are reached first. Duplicate definitions can then be ignored when found.\n    for (size_t i = input.size(); i--; ) {\n        const CSSProperty& property = input[i];\n        if (property.isImportant() != important)\n            continue;\n        const unsigned propertyIDIndex = property.id() - firstCSSProperty;\n        if (seenProperties.get(propertyIDIndex))\n            continue;\n        seenProperties.set(propertyIDIndex);\n        output[--unusedEntries] = property;\n    }\n}\n\nstatic PassRefPtrWillBeRawPtr<ImmutableStylePropertySet> createStylePropertySet(const WillBeHeapVector<CSSProperty, 256>& parsedProperties, CSSParserMode mode)\n{\n    BitArray<numCSSProperties> seenProperties;\n    size_t unusedEntries = parsedProperties.size();\n    WillBeHeapVector<CSSProperty, 256> results(unusedEntries);\n\n    filterProperties(true, parsedProperties, results, unusedEntries, seenProperties);\n    filterProperties(false, parsedProperties, results, unusedEntries, seenProperties);\n\n    return ImmutableStylePropertySet::create(results.data() + unusedEntries, results.size() - unusedEntries, mode);\n}\n\nPassRefPtrWillBeRawPtr<ImmutableStylePropertySet> CSSParserImpl::parseInlineStyleDeclaration(const String& string, Element* element)\n{\n    Document& document = element->document();\n    CSSParserContext context = CSSParserContext(document.elementSheet().contents()->parserContext(), UseCounter::getFrom(&document));\n    CSSParserMode mode = element->isHTMLElement() && !document.inQuirksMode() ? HTMLStandardMode : HTMLQuirksMode;\n    context.setMode(mode);\n    CSSParserImpl parser(context, string);\n    parser.consumeDeclarationList(CSSParserTokenRange(parser.m_tokens), CSSRuleSourceData::STYLE_RULE);\n    return createStylePropertySet(parser.m_parsedProperties, mode);\n}\n\nbool CSSParserImpl::parseDeclaration(MutableStylePropertySet* declaration, const String& string, const CSSParserContext& context)\n{\n    CSSParserImpl parser(context, string);\n    CSSRuleSourceData::Type ruleType = CSSRuleSourceData::STYLE_RULE;\n    if (declaration->cssParserMode() == CSSViewportRuleMode)\n        ruleType = CSSRuleSourceData::VIEWPORT_RULE;\n    parser.consumeDeclarationList(CSSParserTokenRange(parser.m_tokens), ruleType);\n    if (parser.m_parsedProperties.isEmpty())\n        return false;\n    declaration->addParsedProperties(parser.m_parsedProperties);\n    return true;\n}\n\nvoid CSSParserImpl::consumeDeclarationList(CSSParserTokenRange range, CSSRuleSourceData::Type ruleType)\n{\n    while (!range.atEnd()) {\n        switch (range.peek().type()) {\n        case CommentToken:\n        case WhitespaceToken:\n        case SemicolonToken:\n            range.consume();\n            break;\n        case IdentToken: {\n            const CSSParserToken* declarationStart = &range.peek();\n            while (!range.atEnd() && range.peek().type() != SemicolonToken)\n                range.consume();\n            consumeDeclaration(range.makeSubRange(declarationStart, &range.peek()), ruleType);\n            break;\n        }\n        default: \/\/ Parser error\n            \/\/ FIXME: The spec allows at-rules in a declaration list\n            while (!range.atEnd() && range.peek().type() != SemicolonToken)\n                range.consume();\n            break;\n        }\n    }\n}\n\nvoid CSSParserImpl::consumeDeclaration(CSSParserTokenRange range, CSSRuleSourceData::Type ruleType)\n{\n    ASSERT(range.peek().type() == IdentToken);\n    CSSPropertyID id = range.consume().parseAsCSSPropertyID();\n    range.consumeWhitespaceAndComments();\n    if (range.consume().type() != ColonToken)\n        return; \/\/ Parser error\n\n    const CSSParserToken* last = range.end() - 1;\n    while (last->type() == WhitespaceToken || last->type() == CommentToken)\n        --last;\n    if (last->type() == IdentToken && equalIgnoringCase(last->value(), \"important\")) {\n        --last;\n        while (last->type() == WhitespaceToken || last->type() == CommentToken)\n            --last;\n        if (last->type() == DelimiterToken && last->delimiter() == '!') {\n            consumeDeclarationValue(range.makeSubRange(&range.peek(), last), id, true, ruleType);\n            return;\n        }\n    }\n    consumeDeclarationValue(range.makeSubRange(&range.peek(), range.end()), id, false, ruleType);\n}\n\nvoid CSSParserImpl::consumeDeclarationValue(CSSParserTokenRange range, CSSPropertyID propertyID, bool important, CSSRuleSourceData::Type ruleType)\n{\n    CSSParserValueList valueList(range);\n    if (!valueList.size())\n        return; \/\/ Parser error\n    bool inViewport = ruleType == CSSRuleSourceData::VIEWPORT_RULE;\n    CSSPropertyParser::parseValue(propertyID, important, &valueList, m_context, inViewport, m_parsedProperties, ruleType);\n}\n\n} \/\/ namespace blink\n<commit_msg>CSS Parser: consumeDeclarationList should advance by component values<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 \"config.h\"\n#include \"core\/css\/parser\/CSSParserImpl.h\"\n\n#include \"core\/css\/CSSStyleSheet.h\"\n#include \"core\/css\/StylePropertySet.h\"\n#include \"core\/css\/StyleSheetContents.h\"\n#include \"core\/css\/parser\/CSSParserValues.h\"\n#include \"core\/css\/parser\/CSSPropertyParser.h\"\n#include \"core\/css\/parser\/CSSTokenizer.h\"\n#include \"core\/dom\/Document.h\"\n#include \"core\/dom\/Element.h\"\n#include \"core\/frame\/UseCounter.h\"\n#include \"wtf\/BitArray.h\"\n\nnamespace blink {\n\nCSSParserImpl::CSSParserImpl(const CSSParserContext& context, const String& s)\n: m_context(context)\n{\n    CSSTokenizer::tokenize(s, m_tokens);\n}\n\nbool CSSParserImpl::parseValue(MutableStylePropertySet* declaration, CSSPropertyID propertyID, const String& string, bool important, const CSSParserContext& context)\n{\n    CSSParserImpl parser(context, string);\n    CSSRuleSourceData::Type ruleType = CSSRuleSourceData::STYLE_RULE;\n    if (declaration->cssParserMode() == CSSViewportRuleMode)\n        ruleType = CSSRuleSourceData::VIEWPORT_RULE;\n    parser.consumeDeclarationValue(CSSParserTokenRange(parser.m_tokens), propertyID, important, ruleType);\n    if (parser.m_parsedProperties.isEmpty())\n        return false;\n    declaration->addParsedProperties(parser.m_parsedProperties);\n    return true;\n}\n\nstatic inline void filterProperties(bool important, const WillBeHeapVector<CSSProperty, 256>& input, WillBeHeapVector<CSSProperty, 256>& output, size_t& unusedEntries, BitArray<numCSSProperties>& seenProperties)\n{\n    \/\/ Add properties in reverse order so that highest priority definitions are reached first. Duplicate definitions can then be ignored when found.\n    for (size_t i = input.size(); i--; ) {\n        const CSSProperty& property = input[i];\n        if (property.isImportant() != important)\n            continue;\n        const unsigned propertyIDIndex = property.id() - firstCSSProperty;\n        if (seenProperties.get(propertyIDIndex))\n            continue;\n        seenProperties.set(propertyIDIndex);\n        output[--unusedEntries] = property;\n    }\n}\n\nstatic PassRefPtrWillBeRawPtr<ImmutableStylePropertySet> createStylePropertySet(const WillBeHeapVector<CSSProperty, 256>& parsedProperties, CSSParserMode mode)\n{\n    BitArray<numCSSProperties> seenProperties;\n    size_t unusedEntries = parsedProperties.size();\n    WillBeHeapVector<CSSProperty, 256> results(unusedEntries);\n\n    filterProperties(true, parsedProperties, results, unusedEntries, seenProperties);\n    filterProperties(false, parsedProperties, results, unusedEntries, seenProperties);\n\n    return ImmutableStylePropertySet::create(results.data() + unusedEntries, results.size() - unusedEntries, mode);\n}\n\nPassRefPtrWillBeRawPtr<ImmutableStylePropertySet> CSSParserImpl::parseInlineStyleDeclaration(const String& string, Element* element)\n{\n    Document& document = element->document();\n    CSSParserContext context = CSSParserContext(document.elementSheet().contents()->parserContext(), UseCounter::getFrom(&document));\n    CSSParserMode mode = element->isHTMLElement() && !document.inQuirksMode() ? HTMLStandardMode : HTMLQuirksMode;\n    context.setMode(mode);\n    CSSParserImpl parser(context, string);\n    parser.consumeDeclarationList(CSSParserTokenRange(parser.m_tokens), CSSRuleSourceData::STYLE_RULE);\n    return createStylePropertySet(parser.m_parsedProperties, mode);\n}\n\nbool CSSParserImpl::parseDeclaration(MutableStylePropertySet* declaration, const String& string, const CSSParserContext& context)\n{\n    CSSParserImpl parser(context, string);\n    CSSRuleSourceData::Type ruleType = CSSRuleSourceData::STYLE_RULE;\n    if (declaration->cssParserMode() == CSSViewportRuleMode)\n        ruleType = CSSRuleSourceData::VIEWPORT_RULE;\n    parser.consumeDeclarationList(CSSParserTokenRange(parser.m_tokens), ruleType);\n    if (parser.m_parsedProperties.isEmpty())\n        return false;\n    declaration->addParsedProperties(parser.m_parsedProperties);\n    return true;\n}\n\nvoid CSSParserImpl::consumeDeclarationList(CSSParserTokenRange range, CSSRuleSourceData::Type ruleType)\n{\n    while (!range.atEnd()) {\n        switch (range.peek().type()) {\n        case CommentToken:\n        case WhitespaceToken:\n        case SemicolonToken:\n            range.consume();\n            break;\n        case IdentToken: {\n            const CSSParserToken* declarationStart = &range.peek();\n            while (!range.atEnd() && range.peek().type() != SemicolonToken)\n                range.consumeComponentValue();\n            consumeDeclaration(range.makeSubRange(declarationStart, &range.peek()), ruleType);\n            break;\n        }\n        default: \/\/ Parser error\n            \/\/ FIXME: The spec allows at-rules in a declaration list\n            while (!range.atEnd() && range.peek().type() != SemicolonToken)\n                range.consumeComponentValue();\n            break;\n        }\n    }\n}\n\nvoid CSSParserImpl::consumeDeclaration(CSSParserTokenRange range, CSSRuleSourceData::Type ruleType)\n{\n    ASSERT(range.peek().type() == IdentToken);\n    CSSPropertyID id = range.consume().parseAsCSSPropertyID();\n    range.consumeWhitespaceAndComments();\n    if (range.consume().type() != ColonToken)\n        return; \/\/ Parser error\n\n    const CSSParserToken* last = range.end() - 1;\n    while (last->type() == WhitespaceToken || last->type() == CommentToken)\n        --last;\n    if (last->type() == IdentToken && equalIgnoringCase(last->value(), \"important\")) {\n        --last;\n        while (last->type() == WhitespaceToken || last->type() == CommentToken)\n            --last;\n        if (last->type() == DelimiterToken && last->delimiter() == '!') {\n            consumeDeclarationValue(range.makeSubRange(&range.peek(), last), id, true, ruleType);\n            return;\n        }\n    }\n    consumeDeclarationValue(range.makeSubRange(&range.peek(), range.end()), id, false, ruleType);\n}\n\nvoid CSSParserImpl::consumeDeclarationValue(CSSParserTokenRange range, CSSPropertyID propertyID, bool important, CSSRuleSourceData::Type ruleType)\n{\n    CSSParserValueList valueList(range);\n    if (!valueList.size())\n        return; \/\/ Parser error\n    bool inViewport = ruleType == CSSRuleSourceData::VIEWPORT_RULE;\n    CSSPropertyParser::parseValue(propertyID, important, &valueList, m_context, inViewport, m_parsedProperties, ruleType);\n}\n\n} \/\/ namespace blink\n<|endoftext|>"}
{"text":"<commit_before>\/\/!@Alan\n\/\/!\n\/\/! Exercise 6.12:\n\/\/! Rewrite the program from exercise 6.10 in § 6.2.1 (p. 210) to use\n\/\/! references instead of pointers to swap the value of two ints. Which\n\/\/! version do you think would be easier to use and why?\n\/\/  The version using reference is easier.\n\/\/!\n\n\n\n#include <iostream>\n#include <string>\n#include <stdexcept>\n\nusing namespace std;\n\nvoid swap(int& _n1, int& _n2);\n\nint main()\n{\n    int n1, n2;\n\n    cout<<\"Please Enter:\\n\";\n    while(cin>>n1>>n2)\n    {\n        swap(n1, n2);\n        cout<<n1<<\" \"<<n2<<endl;\n    }\n\n    return 0;\n}\n\nvoid swap(int &_n1, int &_n2)\n{\n    int temp;\n    temp = _n1;\n    _n1 = _n2;\n    _n2 = temp;\n\n}\n<commit_msg>Update ex6_12.cpp<commit_after>\/\/!@Yue Wang\n\/\/!\n\/\/! Exercise 6.12:\n\/\/! Rewrite the program from exercise 6.10 in § 6.2.1 (p. 210) to use\n\/\/! references instead of pointers to swap the value of two ints. Which\n\/\/! version do you think would be easier to use and why?\n\/\/  The version using reference is easier.\n\/\/!\n\n\n#include <iostream>\n#include <string>\n#include <stdexcept>\n\n\nvoid swap(int& lhs, int& rhs)\n{\n    int temp = lhs;\n    lhs = rhs;\n    rhs = temp;\n}\n\nint main()\n{\n    int left, right;\n    std::cout << \"Please Enter:\\n\";\n    while (std::cin >> left >> right)\n    {\n        swap(left, right);\n        std::cout << left << \" \" << right << std::endl;\n    }\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  File:       TEST_PlatformBlock.cpp\n\/\/  Class:      TEST_PlatformBlock\n\/\/  Author:     Sebastian Odbjer\n\/\/              All code is my own except where credited to others.\n\/\/\n\/\/\tCopyright (c) 2012 by Catch22. All Rights Reserved.\n\/\/  Date: \t\t09\/10-2012\n\/\/\n\n#include \"..\/src\/GameModel\/Map\/PlatformBlock.hpp\"\n#include \"catch.hpp\"\n\nTEST_CASE(\"PlatformBlock\", \"Tests the PlatformBlock: creates some new platformblocks, checks that the values are correct\")\n{\n\t\/\/Create the platformBlocks\n\tPlatformBlock platformblock1 = PlatformBlock(INCLINE, new Vector2d(0.0, 0.0));\n\tPlatformBlock platformblock2 = PlatformBlock(HORIZONTAL, new Vector2d(0.0, 0.0));\n\tPlatformBlock platformblock3 = PlatformBlock(DECLINE, new Vector2d(0.0, 0.0));\n\n\t\/\/Check the values\n\tCHECK(platformblock1.getStartVector()->m_x == 0.0);\n\tCHECK(platformblock1.getStartVector()->m_y == 0.0);\n\n\tCHECK(platformblock1.getEndVector()->m_x == 2.0);\n\tCHECK(platformblock1.getEndVector()->m_y == 1.0);\n\tCHECK(platformblock2.getEndVector()->m_x == 2.0);\n\tCHECK(platformblock2.getEndVector()->m_y == 0.0);\n\tCHECK(platformblock3.getEndVector()->m_x == 2.0);\n\tCHECK(platformblock3.getEndVector()->m_y == -1.0);\n\n\tCHECK(platformblock1.getType() == INCLINE);\n\tCHECK(platformblock2.getType() == HORIZONTAL);\n\tCHECK(platformblock3.getType() == DECLINE);\n\n}\n<commit_msg>changed some pointers in the test for platformblock<commit_after>\/\/\n\/\/  File:       TEST_PlatformBlock.cpp\n\/\/  Class:      TEST_PlatformBlock\n\/\/  Author:     Sebastian Odbjer\n\/\/              All code is my own except where credited to others.\n\/\/\n\/\/\tCopyright (c) 2012 by Catch22. All Rights Reserved.\n\/\/  Date: \t\t09\/10-2012\n\/\/\n\/\/\tLicense: The following code is licensed under the Catch22-License\n\/\/\n\n#include \"..\/src\/GameModel\/Map\/PlatformBlock.hpp\"\n#include \"catch.hpp\"\n\nTEST_CASE(\"PlatformBlock\", \"Tests the PlatformBlock: creates some new platformblocks, checks that the values are correct\")\n{\n\t\/\/Create the platformBlocks\n\tPlatformBlock platformblock1 = PlatformBlock(INCLINE, new Vector2d(0.0, 0.0));\n\tPlatformBlock platformblock2 = PlatformBlock(HORIZONTAL, new Vector2d(0.0, 0.0));\n\tPlatformBlock platformblock3 = PlatformBlock(DECLINE, new Vector2d(0.0, 0.0));\n\n\t\/\/Check the values\n\tCHECK(platformblock1.getStartVector()->m_x == 0.0);\n\tCHECK(platformblock1.getStartVector()->m_y == 0.0);\n\n\tCHECK(platformblock1.getEndVector()->m_x == 2.0);\n\tCHECK(platformblock1.getEndVector()->m_y == 1.0);\n\tCHECK(platformblock2.getEndVector()->m_x == 2.0);\n\tCHECK(platformblock2.getEndVector()->m_y == 0.0);\n\tCHECK(platformblock3.getEndVector()->m_x == 2.0);\n\tCHECK(platformblock3.getEndVector()->m_y == -1.0);\n\n\tCHECK(platformblock1.getType() == INCLINE);\n\tCHECK(platformblock2.getType() == HORIZONTAL);\n\tCHECK(platformblock3.getType() == DECLINE);\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 2012       Thibaut Gridel <tgridel@free.fr>\n\/\/ Copyright 2012,2013  Bernhard Beschow <bbeschow@cs.tu-berlin.de>\n\/\/\n\n#include <QtTest\/QtTest>\n#include \"TestUtils.h\"\n\n#include \"ViewportParams.h\"\n\n#include \"AbstractProjection.h\"\n#include \"GeoDataCoordinates.h\"\n#include \"GeoDataLineString.h\"\n\nnamespace Marble\n{\n\nclass ViewportParamsTest : public QObject\n{\n    Q_OBJECT\n\n private slots:\n    void constructorDefaultValues();\n\n    void constructorValues_data();\n    void constructorValues();\n\n    void screenCoordinates_GeoDataLineString_data();\n    void screenCoordinates_GeoDataLineString();\n\n    void setInvalidRadius();\n\n    void setFocusPoint();\n};\n\nvoid ViewportParamsTest::constructorDefaultValues()\n{\n    const ViewportParams viewport;\n\n    QCOMPARE( viewport.projection(), Spherical );\n    QCOMPARE( viewport.size(), QSize( 100, 100 ) );\n    QCOMPARE( viewport.width(), 100 );\n    QCOMPARE( viewport.height(), 100 );\n    QCOMPARE( viewport.centerLongitude(), 0. );\n    QCOMPARE( viewport.centerLatitude(), 0. );\n    QCOMPARE( viewport.polarity(), 1 );\n    QCOMPARE( viewport.radius(), 2000 );\n    QCOMPARE( viewport.mapCoversViewport(), true );\n    QCOMPARE( viewport.focusPoint(), GeoDataCoordinates( 0., 0., 0. ) );\n\n    \/\/ invariants:\n    QVERIFY( viewport.radius() > 0 ); \/\/ avoids divisions by zero\n    QVERIFY( viewport.viewLatLonAltBox() == viewport.latLonAltBox( QRect( 0, 0, 100, 100 ) ) );\n    \/\/ FIXME QCOMPARE( viewport.viewLatLonAltBox().center().longitude(), viewport.centerLongitude() );\n    \/\/ FIXME QCOMPARE( viewport.viewLatLonAltBox().center().latitude(), viewport.centerLatitude() );\n}\n\nvoid ViewportParamsTest::constructorValues_data()\n{\n    QTest::addColumn<Marble::Projection>( \"projection\" );\n    QTest::addColumn<qreal>( \"lon\" );\n    QTest::addColumn<qreal>( \"lat\" );\n    QTest::addColumn<int>( \"radius\" );\n    QTest::addColumn<QSize>( \"size\" );\n\n    ViewportParams viewport;\n\n    viewport.setProjection( Spherical );\n    const AbstractProjection *const spherical = viewport.currentProjection();\n\n    viewport.setProjection( Mercator);\n    const AbstractProjection *const mercator = viewport.currentProjection();\n\n    viewport.setProjection( Equirectangular );\n    const AbstractProjection *const equirectangular = viewport.currentProjection();\n\n    addRow() << Spherical << 0. << 0. << 2000 << QSize( 100, 100 );\n    addRow() << Mercator << 0. << 0. << 2000 << QSize( 100, 100 );\n    addRow() << Equirectangular << 0. << 0. << 2000 << QSize( 100, 100 );\n\n    addRow() << Spherical << 205. * DEG2RAD << spherical->maxValidLat() + 1.0 << 2000 << QSize( 100, 100 );\n    addRow() << Mercator << 205. * DEG2RAD << mercator->maxValidLat() + 1.0 << 2000 << QSize( 100, 100 );\n    addRow() << Equirectangular << 205. * DEG2RAD << equirectangular->maxValidLat() + 1.0 << 2000 << QSize( 100, 100 );\n}\n\nvoid ViewportParamsTest::constructorValues()\n{\n    QFETCH( Projection, projection );\n    QFETCH( qreal, lon );\n    QFETCH( qreal, lat );\n    QFETCH( int, radius );\n    QFETCH( QSize, size );\n\n    const ViewportParams byConstructor( projection, lon, lat, radius, size );\n\n    ViewportParams bySetters;\n    bySetters.setProjection( projection );\n    bySetters.centerOn( lon, lat );\n    bySetters.setRadius( radius );\n    bySetters.setSize( size );\n\n    QCOMPARE( byConstructor.projection(), bySetters.projection() );\n    QCOMPARE( byConstructor.currentProjection(), bySetters.currentProjection() );\n    QCOMPARE( byConstructor.centerLongitude(), bySetters.centerLongitude() );\n    QCOMPARE( byConstructor.centerLatitude(), bySetters.centerLatitude() );\n    QCOMPARE( byConstructor.planetAxis(), bySetters.planetAxis() );\n    QCOMPARE( byConstructor.angularResolution(), bySetters.angularResolution() );\n    QCOMPARE( byConstructor.radius(), bySetters.radius() );\n    QCOMPARE( byConstructor.size(), bySetters.size() );\n}\n\nvoid ViewportParamsTest::screenCoordinates_GeoDataLineString_data()\n{\n    QTest::addColumn<Marble::Projection>( \"projection\" );\n    QTest::addColumn<Marble::TessellationFlags>( \"tessellation\" );\n    QTest::addColumn<GeoDataLineString>( \"line\" );\n    QTest::addColumn<int>( \"size\" );\n\n    GeoDataCoordinates::Unit deg = GeoDataCoordinates::Degree;\n\n    GeoDataLineString longitudeLine;\n    longitudeLine << GeoDataCoordinates(185, 5, 0, deg )\n                  << GeoDataCoordinates(185, 15, 0, deg );\n\n    GeoDataLineString diagonalLine;\n    diagonalLine << GeoDataCoordinates(-185, 5, 0, deg )\n                 << GeoDataCoordinates(185, 15, 0, deg );\n\n    GeoDataLineString latitudeLine;\n    latitudeLine << GeoDataCoordinates(-185, 5, 0, deg )\n                 << GeoDataCoordinates(185, 5, 0, deg );\n\n    Projection projection = Mercator;\n\n    TessellationFlags flags = NoTessellation;\n    QTest::newRow(\"Mercator NoTesselation Longitude\")\n            << projection << flags << longitudeLine << 2;\n\n    QTest::newRow(\"Mercator NoTesselation Diagonal IDL\")\n            << projection << flags << diagonalLine << 2;\n\n    QTest::newRow(\"Mercator NoTesselation Latitude IDL\")\n            << projection << flags << latitudeLine << 2;\n\n    flags = Tessellate;\n    QTest::newRow(\"Mercator Tesselate Longitude\")\n            << projection << flags << longitudeLine << 2;\n\n    QTest::newRow(\"Mercator Tesselate Diagonal IDL\")\n            << projection << flags << diagonalLine << 4;\n\n    QTest::newRow(\"Mercator Tesselate Latitude IDL\")\n            << projection << flags << latitudeLine << 4;\n\n    flags = Tessellate | RespectLatitudeCircle;\n    QTest::newRow(\"Mercator LatitudeCircle Longitude\")\n            << projection << flags << longitudeLine << 2;\n\n    QTest::newRow(\"Mercator LatitudeCircle Diagonal IDL\")\n            << projection << flags << diagonalLine << 4;\n\n    QTest::newRow(\"Mercator LatitudeCircle Latitude IDL\")\n            << projection << flags << latitudeLine << 2;\n\n\n    projection = Spherical;\n\n    flags = NoTessellation;\n    QTest::newRow(\"Spherical NoTesselation Longitude\")\n            << projection << flags << longitudeLine << 1;\n\n    QTest::newRow(\"Spherical NoTesselation Diagonal IDL\")\n            << projection << flags << diagonalLine << 1;\n\n    QTest::newRow(\"Spherical NoTesselation Latitude IDL\")\n            << projection << flags << latitudeLine << 1;\n\n    flags = Tessellate;\n    QTest::newRow(\"Spherical Tesselate Longitude\")\n            << projection << flags << longitudeLine << 1;\n\n    QTest::newRow(\"Spherical Tesselate Diagonal IDL\")\n            << projection << flags << diagonalLine << 1;\n\n    QTest::newRow(\"Spherical Tesselate Latitude IDL\")\n            << projection << flags << latitudeLine << 1;\n\n    flags = Tessellate | RespectLatitudeCircle;\n    QTest::newRow(\"Spherical LatitudeCircle Longitude\")\n            << projection << flags << longitudeLine << 1;\n\n    QTest::newRow(\"Spherical LatitudeCircle Diagonal IDL\")\n            << projection << flags << diagonalLine << 1;\n\n    QTest::newRow(\"Spherical LatitudeCircle Latitude IDL\")\n            << projection << flags << latitudeLine << 1;\n\n}\n\nvoid ViewportParamsTest::screenCoordinates_GeoDataLineString()\n{\n    QFETCH( Marble::Projection, projection );\n    QFETCH( Marble::TessellationFlags, tessellation );\n    QFETCH( GeoDataLineString, line );\n    QFETCH( int, size );\n\n    ViewportParams viewport;\n    viewport.setProjection( projection );\n    viewport.setRadius( 360 \/ 4 ); \/\/ for easy mapping of lon <-> x\n    viewport.centerOn(185 * DEG2RAD, 0);\n\n    line.setTessellationFlags( tessellation );\n    QVector<QPolygonF*> polys;\n    viewport.screenCoordinates(line, polys);\n\n    foreach (QPolygonF* poly, polys) {\n        \/\/ at least 2 points in one poly\n        QVERIFY( poly->size() > 1 );\n        QPointF oldCoord = poly->first();\n        poly->pop_front();\n\n        foreach(const QPointF &coord, *poly) {\n            \/\/ no 2 same points\n            QVERIFY( (coord-oldCoord) != QPointF() );\n\n            \/\/ no 2 consecutive points should be more than 90° apart\n            QVERIFY( (coord-oldCoord).manhattanLength() < viewport.radius() );\n            oldCoord = coord;\n        }\n    }\n\n    \/\/ check the provided number of polys\n    QCOMPARE( polys.size(), size );\n}\n\nvoid ViewportParamsTest::setInvalidRadius()\n{\n    ViewportParams viewport;\n\n    \/\/ QVERIFY( viewport.radius() > 0 ); already verified above\n\n    const int radius = viewport.radius();\n    viewport.setRadius( 0 );\n\n    QCOMPARE( viewport.radius(), radius );\n}\n\nvoid ViewportParamsTest::setFocusPoint()\n{\n    const GeoDataCoordinates focusPoint1( 10, 13, 0, GeoDataCoordinates::Degree );\n    const GeoDataCoordinates focusPoint2( 14.3, 20.5, 0, GeoDataCoordinates::Degree );\n\n    ViewportParams viewport;\n\n    const GeoDataCoordinates center = viewport.focusPoint();\n\n    QVERIFY( center != focusPoint1 );\n    QVERIFY( center != focusPoint2 );\n\n    viewport.setFocusPoint( focusPoint1 );\n    QCOMPARE( viewport.focusPoint(), focusPoint1 );\n\n    viewport.resetFocusPoint();\n    QCOMPARE( viewport.focusPoint(), center );\n\n    viewport.setFocusPoint( focusPoint2 );\n    QCOMPARE( viewport.focusPoint(), focusPoint2 );\n\n    viewport.setFocusPoint( focusPoint1 );\n    QCOMPARE( viewport.focusPoint(), focusPoint1 );\n\n    viewport.resetFocusPoint();\n    QCOMPARE( viewport.focusPoint(), center );\n}\n\n}\n\nQ_DECLARE_METATYPE( Marble::Projection )\nQ_DECLARE_METATYPE( Marble::TessellationFlag )\nQ_DECLARE_METATYPE( Marble::TessellationFlags )\nQTEST_MAIN( Marble::ViewportParamsTest )\n\n#include \"ViewportParamsTest.moc\"\n<commit_msg>ViewportParamsTest: hunting the IDL bugs<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 2012       Thibaut Gridel <tgridel@free.fr>\n\/\/ Copyright 2012,2013  Bernhard Beschow <bbeschow@cs.tu-berlin.de>\n\/\/\n\n#include <QtTest\/QtTest>\n#include \"TestUtils.h\"\n\n#include \"ViewportParams.h\"\n\n#include \"AbstractProjection.h\"\n#include \"GeoDataCoordinates.h\"\n#include \"GeoDataLineString.h\"\n#include \"GeoDataLinearRing.h\"\n\nnamespace Marble\n{\n\nclass ViewportParamsTest : public QObject\n{\n    Q_OBJECT\n\n private slots:\n    void constructorDefaultValues();\n\n    void constructorValues_data();\n    void constructorValues();\n\n    void screenCoordinates_GeoDataLineString_data();\n    void screenCoordinates_GeoDataLineString();\n\n    void geoDataLinearRing_data();\n    void geoDataLinearRing();\n\n    void setInvalidRadius();\n\n    void setFocusPoint();\n};\n\nvoid ViewportParamsTest::constructorDefaultValues()\n{\n    const ViewportParams viewport;\n\n    QCOMPARE( viewport.projection(), Spherical );\n    QCOMPARE( viewport.size(), QSize( 100, 100 ) );\n    QCOMPARE( viewport.width(), 100 );\n    QCOMPARE( viewport.height(), 100 );\n    QCOMPARE( viewport.centerLongitude(), 0. );\n    QCOMPARE( viewport.centerLatitude(), 0. );\n    QCOMPARE( viewport.polarity(), 1 );\n    QCOMPARE( viewport.radius(), 2000 );\n    QCOMPARE( viewport.mapCoversViewport(), true );\n    QCOMPARE( viewport.focusPoint(), GeoDataCoordinates( 0., 0., 0. ) );\n\n    \/\/ invariants:\n    QVERIFY( viewport.radius() > 0 ); \/\/ avoids divisions by zero\n    QVERIFY( viewport.viewLatLonAltBox() == viewport.latLonAltBox( QRect( 0, 0, 100, 100 ) ) );\n    \/\/ FIXME QCOMPARE( viewport.viewLatLonAltBox().center().longitude(), viewport.centerLongitude() );\n    \/\/ FIXME QCOMPARE( viewport.viewLatLonAltBox().center().latitude(), viewport.centerLatitude() );\n}\n\nvoid ViewportParamsTest::constructorValues_data()\n{\n    QTest::addColumn<Marble::Projection>( \"projection\" );\n    QTest::addColumn<qreal>( \"lon\" );\n    QTest::addColumn<qreal>( \"lat\" );\n    QTest::addColumn<int>( \"radius\" );\n    QTest::addColumn<QSize>( \"size\" );\n\n    ViewportParams viewport;\n\n    viewport.setProjection( Spherical );\n    const AbstractProjection *const spherical = viewport.currentProjection();\n\n    viewport.setProjection( Mercator);\n    const AbstractProjection *const mercator = viewport.currentProjection();\n\n    viewport.setProjection( Equirectangular );\n    const AbstractProjection *const equirectangular = viewport.currentProjection();\n\n    addRow() << Spherical << 0. << 0. << 2000 << QSize( 100, 100 );\n    addRow() << Mercator << 0. << 0. << 2000 << QSize( 100, 100 );\n    addRow() << Equirectangular << 0. << 0. << 2000 << QSize( 100, 100 );\n\n    addRow() << Spherical << 205. * DEG2RAD << spherical->maxValidLat() + 1.0 << 2000 << QSize( 100, 100 );\n    addRow() << Mercator << 205. * DEG2RAD << mercator->maxValidLat() + 1.0 << 2000 << QSize( 100, 100 );\n    addRow() << Equirectangular << 205. * DEG2RAD << equirectangular->maxValidLat() + 1.0 << 2000 << QSize( 100, 100 );\n}\n\nvoid ViewportParamsTest::constructorValues()\n{\n    QFETCH( Projection, projection );\n    QFETCH( qreal, lon );\n    QFETCH( qreal, lat );\n    QFETCH( int, radius );\n    QFETCH( QSize, size );\n\n    const ViewportParams byConstructor( projection, lon, lat, radius, size );\n\n    ViewportParams bySetters;\n    bySetters.setProjection( projection );\n    bySetters.centerOn( lon, lat );\n    bySetters.setRadius( radius );\n    bySetters.setSize( size );\n\n    QCOMPARE( byConstructor.projection(), bySetters.projection() );\n    QCOMPARE( byConstructor.currentProjection(), bySetters.currentProjection() );\n    QCOMPARE( byConstructor.centerLongitude(), bySetters.centerLongitude() );\n    QCOMPARE( byConstructor.centerLatitude(), bySetters.centerLatitude() );\n    QCOMPARE( byConstructor.planetAxis(), bySetters.planetAxis() );\n    QCOMPARE( byConstructor.angularResolution(), bySetters.angularResolution() );\n    QCOMPARE( byConstructor.radius(), bySetters.radius() );\n    QCOMPARE( byConstructor.size(), bySetters.size() );\n}\n\nvoid ViewportParamsTest::screenCoordinates_GeoDataLineString_data()\n{\n    QTest::addColumn<Marble::Projection>( \"projection\" );\n    QTest::addColumn<Marble::TessellationFlags>( \"tessellation\" );\n    QTest::addColumn<GeoDataLineString>( \"line\" );\n    QTest::addColumn<int>( \"size\" );\n\n    GeoDataCoordinates::Unit deg = GeoDataCoordinates::Degree;\n\n    GeoDataLineString longitudeLine;\n    longitudeLine << GeoDataCoordinates(185, 5, 0, deg )\n                  << GeoDataCoordinates(185, 15, 0, deg );\n\n    GeoDataLineString diagonalLine;\n    diagonalLine << GeoDataCoordinates(-185, 5, 0, deg )\n                 << GeoDataCoordinates(185, 15, 0, deg );\n\n    GeoDataLineString latitudeLine;\n    latitudeLine << GeoDataCoordinates(-185, 5, 0, deg )\n                 << GeoDataCoordinates(185, 5, 0, deg );\n\n    Projection projection = Mercator;\n\n    TessellationFlags flags = NoTessellation;\n    QTest::newRow(\"Mercator NoTesselation Longitude\")\n            << projection << flags << longitudeLine << 2;\n\n    QTest::newRow(\"Mercator NoTesselation Diagonal IDL\")\n            << projection << flags << diagonalLine << 2;\n\n    QTest::newRow(\"Mercator NoTesselation Latitude IDL\")\n            << projection << flags << latitudeLine << 2;\n\n    flags = Tessellate;\n    QTest::newRow(\"Mercator Tesselate Longitude\")\n            << projection << flags << longitudeLine << 2;\n\n    QTest::newRow(\"Mercator Tesselate Diagonal IDL\")\n            << projection << flags << diagonalLine << 4;\n\n    QTest::newRow(\"Mercator Tesselate Latitude IDL\")\n            << projection << flags << latitudeLine << 4;\n\n    flags = Tessellate | RespectLatitudeCircle;\n    QTest::newRow(\"Mercator LatitudeCircle Longitude\")\n            << projection << flags << longitudeLine << 2;\n\n    QTest::newRow(\"Mercator LatitudeCircle Diagonal IDL\")\n            << projection << flags << diagonalLine << 4;\n\n    QTest::newRow(\"Mercator LatitudeCircle Latitude IDL\")\n            << projection << flags << latitudeLine << 2;\n\n\n    projection = Spherical;\n\n    flags = NoTessellation;\n    QTest::newRow(\"Spherical NoTesselation Longitude\")\n            << projection << flags << longitudeLine << 1;\n\n    QTest::newRow(\"Spherical NoTesselation Diagonal IDL\")\n            << projection << flags << diagonalLine << 1;\n\n    QTest::newRow(\"Spherical NoTesselation Latitude IDL\")\n            << projection << flags << latitudeLine << 1;\n\n    flags = Tessellate;\n    QTest::newRow(\"Spherical Tesselate Longitude\")\n            << projection << flags << longitudeLine << 1;\n\n    QTest::newRow(\"Spherical Tesselate Diagonal IDL\")\n            << projection << flags << diagonalLine << 1;\n\n    QTest::newRow(\"Spherical Tesselate Latitude IDL\")\n            << projection << flags << latitudeLine << 1;\n\n    flags = Tessellate | RespectLatitudeCircle;\n    QTest::newRow(\"Spherical LatitudeCircle Longitude\")\n            << projection << flags << longitudeLine << 1;\n\n    QTest::newRow(\"Spherical LatitudeCircle Diagonal IDL\")\n            << projection << flags << diagonalLine << 1;\n\n    QTest::newRow(\"Spherical LatitudeCircle Latitude IDL\")\n            << projection << flags << latitudeLine << 1;\n\n}\n\nvoid ViewportParamsTest::screenCoordinates_GeoDataLineString()\n{\n    QFETCH( Marble::Projection, projection );\n    QFETCH( Marble::TessellationFlags, tessellation );\n    QFETCH( GeoDataLineString, line );\n    QFETCH( int, size );\n\n    ViewportParams viewport;\n    viewport.setProjection( projection );\n    viewport.setRadius( 360 \/ 4 ); \/\/ for easy mapping of lon <-> x\n    viewport.centerOn(185 * DEG2RAD, 0);\n\n    line.setTessellationFlags( tessellation );\n    QVector<QPolygonF*> polys;\n    viewport.screenCoordinates(line, polys);\n\n    foreach (QPolygonF* poly, polys) {\n        \/\/ at least 2 points in one poly\n        QVERIFY( poly->size() > 1 );\n        QPointF oldCoord = poly->first();\n        poly->pop_front();\n\n        foreach(const QPointF &coord, *poly) {\n            \/\/ no 2 same points\n            QVERIFY( (coord-oldCoord) != QPointF() );\n\n            \/\/ no 2 consecutive points should be more than 90° apart\n            QVERIFY( (coord-oldCoord).manhattanLength() < viewport.radius() );\n            oldCoord = coord;\n        }\n    }\n\n    \/\/ check the provided number of polys\n    QCOMPARE( polys.size(), size );\n}\n\nvoid ViewportParamsTest::geoDataLinearRing_data()\n{\n    QTest::addColumn<Marble::Projection>( \"projection\" );\n    QTest::addColumn<Marble::TessellationFlags>( \"tessellation\" );\n    QTest::addColumn<GeoDataLinearRing>( \"ring\" );\n    QTest::addColumn<int>( \"size\" );\n\n    GeoDataCoordinates::Unit deg = GeoDataCoordinates::Degree;\n\n    GeoDataLinearRing normalRing;\n    normalRing << GeoDataCoordinates(175, 5, 0, deg )\n               << GeoDataCoordinates(175, 15, 0, deg )\n               << GeoDataCoordinates(170, 15, 0, deg );\n\n    GeoDataLinearRing acrossIDLRing;\n    acrossIDLRing << GeoDataCoordinates(-175, 5, 0, deg )\n                  << GeoDataCoordinates(175, 5, 0, deg )\n                  << GeoDataCoordinates(175, 15, 0, deg );\n\n    GeoDataLinearRing aroundSPoleRing;\n    aroundSPoleRing << GeoDataCoordinates(-175, -65, 0, deg )\n                 << GeoDataCoordinates(115, -70, 0, deg )\n                    << GeoDataCoordinates(105, -75, 0, deg );\n\n    Projection projection = Mercator;\n\n    TessellationFlags flags = NoTessellation;\n    QTest::newRow(\"Mercator NoTesselation normalRing\")\n            << projection << flags << normalRing << 2;\n\n    QTest::newRow(\"Mercator NoTesselation acrossIDLRing\")\n            << projection << flags << acrossIDLRing << 2;\n\n    QTest::newRow(\"Mercator NoTesselation aroundSPoleRing\")\n            << projection << flags << aroundSPoleRing << 2;\n\n\/\/    flags = Tessellate;\n\/\/    QTest::newRow(\"Mercator Tesselate normalRing\")\n\/\/            << projection << flags << normalRing << 2;\n\n\/\/    QTest::newRow(\"Mercator Tesselate acrossIDLRing\")\n\/\/            << projection << flags << acrossIDLRing << 2;\n\n\/\/    QTest::newRow(\"Mercator Tesselate aroundSPoleRing\")\n\/\/            << projection << flags << aroundSPoleRing << 2;\n\n\/\/    flags = Tessellate | RespectLatitudeCircle;\n\/\/    QTest::newRow(\"Mercator LatitudeCircle normalRing\")\n\/\/            << projection << flags << normalRing << 1;\n\n\/\/    QTest::newRow(\"Mercator LatitudeCircle acrossIDLRing\")\n\/\/            << projection << flags << acrossIDLRing << 1;\n\n\/\/    QTest::newRow(\"Mercator LatitudeCircle aroundSPoleRing\")\n\/\/            << projection << flags << aroundSPoleRing << 1;\n\n\n    projection = Spherical;\n\n    flags = NoTessellation;\n    QTest::newRow(\"Spherical NoTesselation normalRing\")\n            << projection << flags << normalRing << 1;\n\n    QTest::newRow(\"Spherical NoTesselation acrossIDLRing\")\n            << projection << flags << acrossIDLRing << 1;\n\n    QTest::newRow(\"Spherical NoTesselation aroundSPoleRing\")\n            << projection << flags << aroundSPoleRing << 1;\n\n\/\/    flags = Tessellate;\n\/\/    QTest::newRow(\"Spherical Tesselate normalRing\")\n\/\/            << projection << flags << normalRing << 1;\n\n\/\/    QTest::newRow(\"Spherical Tesselate acrossIDLRing\")\n\/\/            << projection << flags << acrossIDLRing << 1;\n\n\/\/    QTest::newRow(\"Spherical Tesselate aroundSPoleRing\")\n\/\/            << projection << flags << aroundSPoleRing << 1;\n\n\/\/    flags = Tessellate | RespectLatitudeCircle;\n\/\/    QTest::newRow(\"Spherical LatitudeCircle normalRing\")\n\/\/            << projection << flags << normalRing << 1;\n\n\/\/    QTest::newRow(\"Spherical LatitudeCircle acrossIDLRing\")\n\/\/            << projection << flags << acrossIDLRing << 1;\n\n\/\/    QTest::newRow(\"Spherical LatitudeCircle aroundSPoleRing\")\n\/\/            << projection << flags << aroundSPoleRing << 1;\n\n}\n\nvoid ViewportParamsTest::geoDataLinearRing()\n{\n    QFETCH( Marble::Projection, projection );\n    QFETCH( Marble::TessellationFlags, tessellation );\n    QFETCH( GeoDataLinearRing, ring );\n    QFETCH( int, size );\n\n    ViewportParams viewport;\n    viewport.setProjection( projection );\n    viewport.setRadius( 360 \/ 4 ); \/\/ for easy mapping of lon <-> x\n    viewport.centerOn(175 * DEG2RAD, 0);\n\n    ring.setTessellationFlags( tessellation );\n    QVector<QPolygonF*> polys;\n    viewport.screenCoordinates(ring, polys);\n\n    foreach (QPolygonF* poly, polys) {\n        \/\/ at least 3 points in one poly\n        QVERIFY( poly->size() > 2 );\n        QPointF oldCoord = poly->first();\n        poly->pop_front();\n\n        foreach(const QPointF &coord, *poly) {\n            \/\/ no 2 same points\n            QVERIFY( (coord-oldCoord) != QPointF() );\n\n            \/\/ no 2 consecutive points should be more than 90° apart\n\/\/            QVERIFY( (coord-oldCoord).manhattanLength() < viewport.radius() );\n            oldCoord = coord;\n        }\n    }\n\n    \/\/ check the provided number of polys\n    QCOMPARE( polys.size(), size );\n}\n\nvoid ViewportParamsTest::setInvalidRadius()\n{\n    ViewportParams viewport;\n\n    \/\/ QVERIFY( viewport.radius() > 0 ); already verified above\n\n    const int radius = viewport.radius();\n    viewport.setRadius( 0 );\n\n    QCOMPARE( viewport.radius(), radius );\n}\n\nvoid ViewportParamsTest::setFocusPoint()\n{\n    const GeoDataCoordinates focusPoint1( 10, 13, 0, GeoDataCoordinates::Degree );\n    const GeoDataCoordinates focusPoint2( 14.3, 20.5, 0, GeoDataCoordinates::Degree );\n\n    ViewportParams viewport;\n\n    const GeoDataCoordinates center = viewport.focusPoint();\n\n    QVERIFY( center != focusPoint1 );\n    QVERIFY( center != focusPoint2 );\n\n    viewport.setFocusPoint( focusPoint1 );\n    QCOMPARE( viewport.focusPoint(), focusPoint1 );\n\n    viewport.resetFocusPoint();\n    QCOMPARE( viewport.focusPoint(), center );\n\n    viewport.setFocusPoint( focusPoint2 );\n    QCOMPARE( viewport.focusPoint(), focusPoint2 );\n\n    viewport.setFocusPoint( focusPoint1 );\n    QCOMPARE( viewport.focusPoint(), focusPoint1 );\n\n    viewport.resetFocusPoint();\n    QCOMPARE( viewport.focusPoint(), center );\n}\n\n}\n\nQ_DECLARE_METATYPE( Marble::GeoDataLinearRing )\nQ_DECLARE_METATYPE( Marble::Projection )\nQ_DECLARE_METATYPE( Marble::TessellationFlag )\nQ_DECLARE_METATYPE( Marble::TessellationFlags )\nQTEST_MAIN( Marble::ViewportParamsTest )\n\n#include \"ViewportParamsTest.moc\"\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 * memory_map_flags_test.cpp\n *\n *  Created on: May 17, 2016\n *      Author: hendrik\n *\/\n\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/interprocess\/mapped_region.hpp>\n#include \"dictionary\/fsa\/internal\/memory_map_flags.h\"\n\nnamespace keyvi {\nnamespace dictionary {\nnamespace fsa {\nnamespace internal {\n\n\/\/ The name of the suite must be a different name to your class\nBOOST_AUTO_TEST_SUITE( MemoryMapFlagsTests )\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestLazy ) {\n  loading_strategy_types strategy = loading_strategy_types::lazy;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE) == 0);\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestPopulate ) {\n  loading_strategy_types strategy = loading_strategy_types::populate;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n  \/\/ map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE));\n  BOOST_CHECK((value_flags & MAP_POPULATE));\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestPopulate_key_part ) {\n  loading_strategy_types strategy = loading_strategy_types::populate_key_part;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE));\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestPopulate_lazy ) {\n  loading_strategy_types strategy = loading_strategy_types::populate_lazy;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE) == 0);\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_willneed);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_willneed);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestlazy_no_readahead ) {\n  loading_strategy_types strategy = loading_strategy_types::lazy_no_readahead;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE) == 0);\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_random);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_random);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestlazy_no_readahead_value_part ) {\n  loading_strategy_types strategy = loading_strategy_types::lazy_no_readahead_value_part;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE) == 0);\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_random);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestpopulate_key_part_no_readahead_value_part ) {\n  loading_strategy_types strategy = loading_strategy_types::populate_key_part_no_readahead_value_part;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE));\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_random);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n} \/* namespace internal *\/\n} \/* namespace fsa *\/\n} \/* namespace dictionary *\/\n} \/* namespace keyvi *\/\n\n\n<commit_msg>no map populate tests on OSX, as OSX doesn't support map populate<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 * memory_map_flags_test.cpp\n *\n *  Created on: May 17, 2016\n *      Author: hendrik\n *\/\n\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/interprocess\/mapped_region.hpp>\n#include \"dictionary\/fsa\/internal\/memory_map_flags.h\"\n\nnamespace keyvi {\nnamespace dictionary {\nnamespace fsa {\nnamespace internal {\n\n\/\/ The name of the suite must be a different name to your class\nBOOST_AUTO_TEST_SUITE( MemoryMapFlagsTests )\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestLazy ) {\n  loading_strategy_types strategy = loading_strategy_types::lazy;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n#if not defined(OS_MACOSX)\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE) == 0);\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n#endif\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestPopulate ) {\n  loading_strategy_types strategy = loading_strategy_types::populate;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n#if not defined(OS_MACOSX)\n  \/\/ map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE));\n  BOOST_CHECK((value_flags & MAP_POPULATE));\n#endif\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestPopulate_key_part ) {\n  loading_strategy_types strategy = loading_strategy_types::populate_key_part;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n#if not defined(OS_MACOSX)\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE));\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n#endif\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestPopulate_lazy ) {\n  loading_strategy_types strategy = loading_strategy_types::populate_lazy;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n#if not defined(OS_MACOSX)\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE) == 0);\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n#endif\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_willneed);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_willneed);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestlazy_no_readahead ) {\n  loading_strategy_types strategy = loading_strategy_types::lazy_no_readahead;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n#if not defined(OS_MACOSX)\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE) == 0);\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n#endif\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_random);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_random);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestlazy_no_readahead_value_part ) {\n  loading_strategy_types strategy = loading_strategy_types::lazy_no_readahead_value_part;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n#if not defined(OS_MACOSX)\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE) == 0);\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n#endif\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_random);\n}\n\nBOOST_AUTO_TEST_CASE( MemoryMapFlagsTestpopulate_key_part_no_readahead_value_part ) {\n  loading_strategy_types strategy = loading_strategy_types::populate_key_part_no_readahead_value_part;\n  int key_flags = MemoryMapFlags::FSAGetMemoryMapOptions(strategy);\n  int value_flags = MemoryMapFlags::ValuesGetMemoryMapOptions(strategy);\n  auto key_advise_flags = MemoryMapFlags::FSAGetMemoryMapAdvices(strategy);\n  auto value_advise_flags = MemoryMapFlags::ValuesGetMemoryMapAdvices(strategy);\n\n#if not defined(OS_MACOSX)\n  \/\/ no map populate\n  BOOST_CHECK((key_flags & MAP_POPULATE));\n  BOOST_CHECK((value_flags & MAP_POPULATE) == 0);\n#endif\n\n  BOOST_CHECK(key_advise_flags == boost::interprocess::mapped_region::advice_types::advice_normal);\n  BOOST_CHECK(value_advise_flags == boost::interprocess::mapped_region::advice_types::advice_random);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n} \/* namespace internal *\/\n} \/* namespace fsa *\/\n} \/* namespace dictionary *\/\n} \/* namespace keyvi *\/\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by xzl on 2018\/9\/20.\n\/\/\n\n#include \"HttpRequestSplitter.h\"\n#include \"Util\/logger.h\"\n#include \"Util\/util.h\"\nusing namespace ZL::Util;\n\nvoid HttpRequestSplitter::input(const char *data,uint64_t len) {\n    const char *ptr = data;\n    if(!_remain_data.empty()){\n        _remain_data.append(data,len);\n        data = ptr = _remain_data.data();\n        len = _remain_data.size();\n    }\n\nsplitPacket:\n\n    \/\/数据按照请求头处理\n    char *index = nullptr;\n    while (_content_len == 0 && (index = strstr(ptr,\"\\r\\n\\r\\n\")) != nullptr) {\n        \/\/_content_len == 0，这是请求头\n        _content_len = onRecvHeader(ptr, index - ptr + 4);\n        ptr = index + 4;\n    }\n\n    uint64_t remain = len - (ptr - data);\n    if(remain <= 0){\n        \/\/没有剩余数据，清空缓存\n        _remain_data.clear();\n        return;\n    }\n\n    if(_content_len == 0){\n        \/\/尚未找到http头，缓存定位到剩余数据部分\n        _remain_data.assign(ptr,remain);\n        return;\n    }\n\n    \/\/已经找到http头了\n    if(_content_len > 0){\n        \/\/数据按照固定长度content处理\n        if(remain < _content_len){\n            \/\/数据不够，缓存定位到剩余数据部分\n            _remain_data.assign(ptr,remain);\n            return;\n        }\n        \/\/收到content数据，并且接受content完毕\n        onRecvContent(ptr,_content_len);\n\n        remain -= _content_len;\n        ptr += _content_len;\n        \/\/content处理完毕,后面数据当做请求头处理\n        _content_len = 0;\n\n        if(remain > 0){\n            \/\/还有数据没有处理完毕\n            _remain_data.assign(ptr,remain);\n\n            data = ptr = (char *)_remain_data.data();\n            len = _remain_data.size();\n            goto splitPacket;\n        }\n        return;\n    }\n\n\n    \/\/_content_len < 0;数据按照不固定长度content处理\n    onRecvContent(ptr,remain);\/\/消费掉所有剩余数据\n    _remain_data.clear();\n}\n\nvoid HttpRequestSplitter::setContentLen(int64_t content_len) {\n    _content_len = content_len;\n}\n<commit_msg>修复编译问题<commit_after>\/\/\n\/\/ Created by xzl on 2018\/9\/20.\n\/\/\n\n#include \"HttpRequestSplitter.h\"\n#include \"Util\/logger.h\"\n#include \"Util\/util.h\"\nusing namespace ZL::Util;\n\nvoid HttpRequestSplitter::input(const char *data,uint64_t len) {\n    const char *ptr = data;\n    if(!_remain_data.empty()){\n        _remain_data.append(data,len);\n        data = ptr = _remain_data.data();\n        len = _remain_data.size();\n    }\n\nsplitPacket:\n\n    \/\/数据按照请求头处理\n    const char *index = nullptr;\n    while (_content_len == 0 && (index = strstr(ptr,\"\\r\\n\\r\\n\")) != nullptr) {\n        \/\/_content_len == 0，这是请求头\n        _content_len = onRecvHeader(ptr, index - ptr + 4);\n        ptr = index + 4;\n    }\n\n    uint64_t remain = len - (ptr - data);\n    if(remain <= 0){\n        \/\/没有剩余数据，清空缓存\n        _remain_data.clear();\n        return;\n    }\n\n    if(_content_len == 0){\n        \/\/尚未找到http头，缓存定位到剩余数据部分\n        _remain_data.assign(ptr,remain);\n        return;\n    }\n\n    \/\/已经找到http头了\n    if(_content_len > 0){\n        \/\/数据按照固定长度content处理\n        if(remain < _content_len){\n            \/\/数据不够，缓存定位到剩余数据部分\n            _remain_data.assign(ptr,remain);\n            return;\n        }\n        \/\/收到content数据，并且接受content完毕\n        onRecvContent(ptr,_content_len);\n\n        remain -= _content_len;\n        ptr += _content_len;\n        \/\/content处理完毕,后面数据当做请求头处理\n        _content_len = 0;\n\n        if(remain > 0){\n            \/\/还有数据没有处理完毕\n            _remain_data.assign(ptr,remain);\n\n            data = ptr = (char *)_remain_data.data();\n            len = _remain_data.size();\n            goto splitPacket;\n        }\n        return;\n    }\n\n\n    \/\/_content_len < 0;数据按照不固定长度content处理\n    onRecvContent(ptr,remain);\/\/消费掉所有剩余数据\n    _remain_data.clear();\n}\n\nvoid HttpRequestSplitter::setContentLen(int64_t content_len) {\n    _content_len = content_len;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n\tMulti-precision real number class. C++ wrapper fo MPFR library.\r\n\tProject homepage: http:\/\/www.holoborodko.com\/pavel\/\r\n\tContact e-mail:   pavel@holoborodko.com\r\n\r\n\tCopyright (c) 2008-2010 Pavel Holoborodko\r\n\r\n\tThis library is free software; you can redistribute it and\/or\r\n\tmodify it under the terms of the GNU Lesser General Public\r\n\tLicense as published by the Free Software Foundation; either\r\n\tversion 2.1 of the License, or (at your option) any later version.\r\n\r\n\tThis library is distributed in the hope that it will be useful,\r\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\r\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\r\n\tLesser General Public License for more details.\r\n\r\n\tYou should have received a copy of the GNU Lesser General Public\r\n\tLicense along with this library; if not, write to the Free Software\r\n\tFoundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\r\n\r\n\tContributors:\r\n\tBrian Gladman, Helmut Jarausch, Fokko Beekhof, Ulrich Mutze, \r\n\tHeinz van Saanen, Pere Constans, Dmitriy Gubanov\r\n*\/\r\n\r\n#include <cstring>\r\n#include \"mpreal.h\"\r\n\r\nusing std::ws;\r\nusing std::cerr;\r\nusing std::endl;\r\nusing std::string;\r\nusing std::ostream;\r\nusing std::istream;\r\n\r\nnamespace mpfr{\r\n\r\nmp_rnd_t   mpreal::default_rnd  = mpfr_get_default_rounding_mode();\t\r\nmp_prec_t  mpreal::default_prec = mpfr_get_default_prec();\t\r\nint\t\t   mpreal::default_base = 10;\r\nint        mpreal::double_bits = -1;\r\n\r\n\/\/ Default constructor: creates mp number and initializes it to 0.\r\nmpreal::mpreal() \r\n{ \r\n\tmpfr_init2(mp,default_prec); \r\n\tmpfr_set_ui(mp,0,default_rnd);\r\n}\r\n\r\nmpreal::mpreal(const mpreal& u) \r\n{\r\n\tmpfr_init2(mp,mpfr_get_prec(u.mp));\r\n\tmpfr_set(mp,u.mp,default_rnd);\r\n}\r\n\r\nmpreal::mpreal(const mpfr_t u)\r\n{\r\n\tmpfr_init2(mp,mpfr_get_prec(u));\r\n\tmpfr_set(mp,u,default_rnd);\r\n}\r\n\r\nmpreal::mpreal(const mpf_t u)\r\n{\r\n\tmpfr_init2(mp,mpf_get_prec(u));\r\n\tmpfr_set_f(mp,u,default_rnd);\r\n}\r\n\r\nmpreal::mpreal(const mpz_t u, mp_prec_t prec, mp_rnd_t mode)\r\n{\r\n\tmpfr_init2(mp,prec);\r\n\tmpfr_set_z(mp,u,mode);\r\n}\r\n\r\nmpreal::mpreal(const mpq_t u, mp_prec_t prec, mp_rnd_t mode)\r\n{\r\n\tmpfr_init2(mp,prec);\r\n\tmpfr_set_q(mp,u,mode);\r\n}\r\n\r\nmpreal::mpreal(const double u, mp_prec_t prec, mp_rnd_t mode)\r\n{\r\n    if(double_bits == -1 || fits_in_bits(u, double_bits))\r\n    {\r\n    \tmpfr_init2(mp,prec);\r\n\t    mpfr_set_d(mp,u,mode);\r\n    }\r\n    else\r\n        throw conversion_overflow();\r\n}\r\n\r\nmpreal::mpreal(const long double u, mp_prec_t prec, mp_rnd_t mode)\r\n{ \r\n    mpfr_init2(mp,prec);\r\n\tmpfr_set_ld(mp,u,mode);\r\n}\r\n\r\nmpreal::mpreal(const unsigned long int u, mp_prec_t prec, mp_rnd_t mode)\r\n{ \r\n\tmpfr_init2(mp,prec);\r\n\tmpfr_set_ui(mp,u,mode);\r\n}\r\n\r\nmpreal::mpreal(const unsigned int u, mp_prec_t prec, mp_rnd_t mode)\r\n{ \r\n\tmpfr_init2(mp,prec);\r\n\tmpfr_set_ui(mp,u,mode);\r\n}\r\n\r\nmpreal::mpreal(const long int u, mp_prec_t prec, mp_rnd_t mode)\r\n{ \r\n\tmpfr_init2(mp,prec);\r\n\tmpfr_set_si(mp,u,mode);\r\n}\r\n\r\nmpreal::mpreal(const int u, mp_prec_t prec, mp_rnd_t mode)\r\n{ \r\n\tmpfr_init2(mp,prec);\r\n\tmpfr_set_si(mp,u,mode);\r\n}\r\n\r\nmpreal::mpreal(const char* s, mp_prec_t prec, int base, mp_rnd_t mode)\r\n{\r\n\tmpfr_init2(mp,prec);\r\n\tmpfr_set_str(mp, s, base, mode); \r\n}\r\n\r\nmpreal::~mpreal() \r\n{ \r\n\tmpfr_clear(mp); \r\n}                           \r\n\r\n\/\/ Operators - Assignment\r\nmpreal& mpreal::operator=(const char* s)\r\n{\r\n\tmpfr_t t;\r\n\tif(0==mpfr_init_set_str(t,s,default_base,default_rnd))\r\n\t{\r\n\t\tmpfr_set(mp,t,mpreal::default_rnd);\t\t\t\t\r\n\t\tmpfr_clear(t);\r\n\t}else{\r\n\t\tmpfr_clear(t);\r\n\t\t\/\/ cerr<<\"fail to convert string\"<<endl;\r\n\t}\r\n\r\n\treturn *this;\r\n}\r\n\r\nconst mpreal fma (const mpreal& v1, const mpreal& v2, const mpreal& v3, mp_rnd_t rnd_mode)\r\n{\r\n\tmpreal a;\r\n\tmp_prec_t p1, p2, p3;\r\n\r\n\tp1 = v1.get_prec(); \r\n\tp2 = v2.get_prec(); \r\n\tp3 = v3.get_prec(); \r\n\r\n\ta.set_prec(p3>p2?(p3>p1?p3:p1):(p2>p1?p2:p1));\r\n\r\n\tmpfr_fma(a.mp,v1.mp,v2.mp,v3.mp,rnd_mode);\r\n\treturn a;\r\n}\r\n\r\nconst mpreal fms (const mpreal& v1, const mpreal& v2, const mpreal& v3, mp_rnd_t rnd_mode)\r\n{\r\n\tmpreal a;\r\n\tmp_prec_t p1, p2, p3;\r\n\r\n\tp1 = v1.get_prec(); \r\n\tp2 = v2.get_prec(); \r\n\tp3 = v3.get_prec(); \r\n\r\n\ta.set_prec(p3>p2?(p3>p1?p3:p1):(p2>p1?p2:p1));\r\n\r\n\tmpfr_fms(a.mp,v1.mp,v2.mp,v3.mp,rnd_mode);\r\n\treturn a;\r\n}\r\n\r\nconst mpreal agm (const mpreal& v1, const mpreal& v2, mp_rnd_t rnd_mode)\r\n{\r\n\tmpreal a;\r\n\tmp_prec_t p1, p2;\r\n\r\n\tp1 = v1.get_prec(); \r\n\tp2 = v2.get_prec(); \r\n\r\n\ta.set_prec(p1>p2?p1:p2);\r\n\r\n\tmpfr_agm(a.mp, v1.mp, v2.mp, rnd_mode);\r\n\r\n\treturn a;\r\n}\r\n\r\nconst mpreal hypot (const mpreal& x, const mpreal& y, mp_rnd_t rnd_mode)\r\n{\r\n\tmpreal a;\r\n\tmp_prec_t yp, xp;\r\n\r\n\typ = y.get_prec(); \r\n\txp = x.get_prec(); \r\n\r\n\ta.set_prec(yp>xp?yp:xp);\r\n\r\n\tmpfr_hypot(a.mp, x.mp, y.mp, rnd_mode);\r\n\r\n\treturn a;\r\n}\r\n\r\nconst mpreal sum (const mpreal tab[], unsigned long int n, mp_rnd_t rnd_mode)\r\n{\r\n\tmpreal x;\r\n\tmpfr_ptr* t;\r\n\tunsigned long int i;\r\n\r\n\tt = new mpfr_ptr[n];\r\n\tfor (i=0;i<n;i++) t[i] = (mpfr_ptr)tab[i].mp;\r\n\tmpfr_sum(x.mp,t,n,rnd_mode);\r\n\tdelete[] t;\r\n\treturn x;\r\n}\r\n\r\nconst mpreal remainder (const mpreal& x, const mpreal& y, mp_rnd_t rnd_mode)\r\n{\t\r\n\tmpreal a;\r\n\tmp_prec_t yp, xp;\r\n\r\n\typ = y.get_prec(); \r\n\txp = x.get_prec(); \r\n\r\n\ta.set_prec(yp>xp?yp:xp);\r\n\r\n\tmpfr_remainder(a.mp, x.mp, y.mp, rnd_mode);\r\n\r\n\treturn a;\r\n}\r\n\r\nconst mpreal remquo (long* q, const mpreal& x, const mpreal& y, mp_rnd_t rnd_mode)\r\n{\r\n\tmpreal a;\r\n\tmp_prec_t yp, xp;\r\n\r\n\typ = y.get_prec(); \r\n\txp = x.get_prec(); \r\n\r\n\ta.set_prec(yp>xp?yp:xp);\r\n\r\n\tmpfr_remquo(a.mp,q, x.mp, y.mp, rnd_mode);\r\n\r\n\treturn a;\r\n}\r\n\r\ntemplate <class T>\r\nstd::string to_string(T t, std::ios_base & (*f)(std::ios_base&))\r\n{\r\n\tstd::ostringstream oss;\r\n\toss << f << t;\r\n\treturn oss.str();\r\n}\r\n\r\nmpreal::operator std::string() const\r\n{\r\n\treturn to_string();\r\n}\r\n\r\nstring mpreal::to_string(size_t n, int b, mp_rnd_t mode) const\r\n{\r\n\tchar *s, *ns = NULL;\t\r\n\tsize_t slen, nslen;\r\n\tmp_exp_t exp;\r\n\tstring out;\r\n\r\n\tif(mpfr_inf_p(mp))\r\n\t{ \r\n\t\tif(mpfr_sgn(mp)>0) return \"+@Inf@\";\r\n\t\telse\t\t\t   return \"-@Inf@\";\r\n\t}\r\n\r\n\tif(mpfr_zero_p(mp)) return \"0\";\r\n\tif(mpfr_nan_p(mp))  return \"@NaN@\";\r\n\r\n\t\t\r\n\ts  = mpfr_get_str(NULL,&exp,b,0,mp,mode);\r\n\tns = mpfr_get_str(NULL,&exp,b,n,mp,mode);\r\n\r\n\tif(s!=NULL && ns!=NULL)\r\n\t{\r\n\t\tslen  = strlen(s);\r\n\t\tnslen = strlen(ns);\r\n\t\tif(nslen<=slen) \r\n\t\t{\r\n\t\t\tmpfr_free_str(s);\r\n\t\t\ts = ns;\r\n\t\t\tslen = nslen;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tmpfr_free_str(ns);\r\n\t\t}\r\n\r\n\t\t\/\/ Make human eye-friendly formatting if possible\r\n\t\tif (exp>0 && static_cast<size_t>(exp)<slen)\r\n\t\t{\r\n\t\t\tif(s[0]=='-')\r\n\t\t\t{\r\n\t\t\t\t\/\/ Remove zeros starting from right end\r\n\t\t\t\tchar* ptr = s+slen-1;\r\n\t\t\t\twhile (*ptr=='0' && ptr>s+exp) ptr--; \r\n\r\n\t\t\t\tif(ptr==s+exp) out = string(s,exp+1);\r\n\t\t\t\telse\t\t   out = string(s,exp+1)+'.'+string(s+exp+1,ptr-(s+exp+1)+1);\r\n\r\n\t\t\t\t\/\/out = string(s,exp+1)+'.'+string(s+exp+1);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\t\/\/ Remove zeros starting from right end\r\n\t\t\t\tchar* ptr = s+slen-1;\r\n\t\t\t\twhile (*ptr=='0' && ptr>s+exp-1) ptr--; \r\n\r\n\t\t\t\tif(ptr==s+exp-1) out = string(s,exp);\r\n\t\t\t\telse\t\t     out = string(s,exp)+'.'+string(s+exp,ptr-(s+exp)+1);\r\n\r\n\t\t\t\t\/\/out = string(s,exp)+'.'+string(s+exp);\r\n\t\t\t}\r\n\r\n\t\t}else{ \/\/ exp<0 || exp>slen\r\n\t\t\tif(s[0]=='-')\r\n\t\t\t{\r\n\t\t\t\t\/\/ Remove zeros starting from right end\r\n\t\t\t\tchar* ptr = s+slen-1;\r\n\t\t\t\twhile (*ptr=='0' && ptr>s+1) ptr--; \r\n\r\n\t\t\t\tif(ptr==s+1) out = string(s,2);\r\n\t\t\t\telse\t\t out = string(s,2)+'.'+string(s+2,ptr-(s+2)+1);\r\n\r\n\t\t\t\t\/\/out = string(s,2)+'.'+string(s+2);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\t\/\/ Remove zeros starting from right end\r\n\t\t\t\tchar* ptr = s+slen-1;\r\n\t\t\t\twhile (*ptr=='0' && ptr>s) ptr--; \r\n\r\n\t\t\t\tif(ptr==s) out = string(s,1);\r\n\t\t\t\telse\t   out = string(s,1)+'.'+string(s+1,ptr-(s+1)+1);\r\n\r\n\t\t\t\t\/\/out = string(s,1)+'.'+string(s+1);\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ Make final string\r\n\t\t\tif(--exp)\r\n\t\t\t{\r\n\t\t\t\tif(exp>0) out += \"e+\"+mpfr::to_string<mp_exp_t>(exp,std::dec);\r\n\t\t\t\telse \t  out += \"e\"+mpfr::to_string<mp_exp_t>(exp,std::dec);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tmpfr_free_str(s);\r\n\t\treturn out;\r\n\t}else{\r\n\t\treturn \"conversion error!\";\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ I\/O\r\nostream& operator<<(ostream& os, const mpreal& v)\r\n{\r\n\treturn os<<v.to_string(os.precision());\r\n}\r\n\r\nistream& operator>>(istream &is, mpreal& v)\r\n{\r\n\tchar c;\t\r\n\tstring s = \"\";\r\n\tmpfr_t t;\r\n\r\n\tif(is.good())\r\n\t{\r\n\t\tis>>ws;\r\n\t\twhile ((c = is.get())!=EOF)\r\n\t\t{\r\n\t\t\tif(c ==' ' || c == '\\t' || c == '\\n' || c == '\\r')\r\n\t\t\t{\r\n\t\t\t\tis.putback(c);\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\ts += c;\r\n\t\t}\r\n\r\n\t\tif(s.size() != 0)\r\n\t\t{\r\n\t\t\t\/\/ Protect current value from alternation in case of input error\r\n\t\t\t\/\/ so some error handling(roll back) procedure can be used \r\n\t\t\tif(0==mpfr_init_set_str(t,s.c_str(),mpreal::default_base,mpreal::default_rnd))\r\n\t\t\t{\r\n\t\t\t\tmpfr_set(v.mp,t,mpreal::default_rnd);\t\t\t\t\r\n\t\t\t\tmpfr_clear(t);\r\n\r\n\t\t\t}else{\r\n\t\t\t\tmpfr_clear(t);\r\n\t\t\t\tcerr<<\"error reading from istream\"<<endl;\r\n\t\t\t\t\/\/ throw an exception\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn is;\r\n}\r\n}\r\n<commit_msg>dos2unix<commit_after>\/*\n\tMulti-precision real number class. C++ wrapper fo MPFR library.\n\tProject homepage: http:\/\/www.holoborodko.com\/pavel\/\n\tContact e-mail:   pavel@holoborodko.com\n\n\tCopyright (c) 2008-2010 Pavel Holoborodko\n\n\tThis library is free software; you can redistribute it and\/or\n\tmodify it under the terms of the GNU Lesser General Public\n\tLicense as published by the Free Software Foundation; either\n\tversion 2.1 of the License, or (at your option) any later version.\n\n\tThis library 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 GNU\n\tLesser General Public License for more details.\n\n\tYou should have received a copy of the GNU Lesser General Public\n\tLicense along with this library; if not, write to the Free Software\n\tFoundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n\n\tContributors:\n\tBrian Gladman, Helmut Jarausch, Fokko Beekhof, Ulrich Mutze, \n\tHeinz van Saanen, Pere Constans, Dmitriy Gubanov\n*\/\n\n#include <cstring>\n#include \"mpreal.h\"\n\nusing std::ws;\nusing std::cerr;\nusing std::endl;\nusing std::string;\nusing std::ostream;\nusing std::istream;\n\nnamespace mpfr{\n\nmp_rnd_t   mpreal::default_rnd  = mpfr_get_default_rounding_mode();\t\nmp_prec_t  mpreal::default_prec = mpfr_get_default_prec();\t\nint\t\t   mpreal::default_base = 10;\nint        mpreal::double_bits = -1;\n\n\/\/ Default constructor: creates mp number and initializes it to 0.\nmpreal::mpreal() \n{ \n\tmpfr_init2(mp,default_prec); \n\tmpfr_set_ui(mp,0,default_rnd);\n}\n\nmpreal::mpreal(const mpreal& u) \n{\n\tmpfr_init2(mp,mpfr_get_prec(u.mp));\n\tmpfr_set(mp,u.mp,default_rnd);\n}\n\nmpreal::mpreal(const mpfr_t u)\n{\n\tmpfr_init2(mp,mpfr_get_prec(u));\n\tmpfr_set(mp,u,default_rnd);\n}\n\nmpreal::mpreal(const mpf_t u)\n{\n\tmpfr_init2(mp,mpf_get_prec(u));\n\tmpfr_set_f(mp,u,default_rnd);\n}\n\nmpreal::mpreal(const mpz_t u, mp_prec_t prec, mp_rnd_t mode)\n{\n\tmpfr_init2(mp,prec);\n\tmpfr_set_z(mp,u,mode);\n}\n\nmpreal::mpreal(const mpq_t u, mp_prec_t prec, mp_rnd_t mode)\n{\n\tmpfr_init2(mp,prec);\n\tmpfr_set_q(mp,u,mode);\n}\n\nmpreal::mpreal(const double u, mp_prec_t prec, mp_rnd_t mode)\n{\n    if(double_bits == -1 || fits_in_bits(u, double_bits))\n    {\n    \tmpfr_init2(mp,prec);\n\t    mpfr_set_d(mp,u,mode);\n    }\n    else\n        throw conversion_overflow();\n}\n\nmpreal::mpreal(const long double u, mp_prec_t prec, mp_rnd_t mode)\n{ \n    mpfr_init2(mp,prec);\n\tmpfr_set_ld(mp,u,mode);\n}\n\nmpreal::mpreal(const unsigned long int u, mp_prec_t prec, mp_rnd_t mode)\n{ \n\tmpfr_init2(mp,prec);\n\tmpfr_set_ui(mp,u,mode);\n}\n\nmpreal::mpreal(const unsigned int u, mp_prec_t prec, mp_rnd_t mode)\n{ \n\tmpfr_init2(mp,prec);\n\tmpfr_set_ui(mp,u,mode);\n}\n\nmpreal::mpreal(const long int u, mp_prec_t prec, mp_rnd_t mode)\n{ \n\tmpfr_init2(mp,prec);\n\tmpfr_set_si(mp,u,mode);\n}\n\nmpreal::mpreal(const int u, mp_prec_t prec, mp_rnd_t mode)\n{ \n\tmpfr_init2(mp,prec);\n\tmpfr_set_si(mp,u,mode);\n}\n\nmpreal::mpreal(const char* s, mp_prec_t prec, int base, mp_rnd_t mode)\n{\n\tmpfr_init2(mp,prec);\n\tmpfr_set_str(mp, s, base, mode); \n}\n\nmpreal::~mpreal() \n{ \n\tmpfr_clear(mp); \n}                           \n\n\/\/ Operators - Assignment\nmpreal& mpreal::operator=(const char* s)\n{\n\tmpfr_t t;\n\tif(0==mpfr_init_set_str(t,s,default_base,default_rnd))\n\t{\n\t\tmpfr_set(mp,t,mpreal::default_rnd);\t\t\t\t\n\t\tmpfr_clear(t);\n\t}else{\n\t\tmpfr_clear(t);\n\t\t\/\/ cerr<<\"fail to convert string\"<<endl;\n\t}\n\n\treturn *this;\n}\n\nconst mpreal fma (const mpreal& v1, const mpreal& v2, const mpreal& v3, mp_rnd_t rnd_mode)\n{\n\tmpreal a;\n\tmp_prec_t p1, p2, p3;\n\n\tp1 = v1.get_prec(); \n\tp2 = v2.get_prec(); \n\tp3 = v3.get_prec(); \n\n\ta.set_prec(p3>p2?(p3>p1?p3:p1):(p2>p1?p2:p1));\n\n\tmpfr_fma(a.mp,v1.mp,v2.mp,v3.mp,rnd_mode);\n\treturn a;\n}\n\nconst mpreal fms (const mpreal& v1, const mpreal& v2, const mpreal& v3, mp_rnd_t rnd_mode)\n{\n\tmpreal a;\n\tmp_prec_t p1, p2, p3;\n\n\tp1 = v1.get_prec(); \n\tp2 = v2.get_prec(); \n\tp3 = v3.get_prec(); \n\n\ta.set_prec(p3>p2?(p3>p1?p3:p1):(p2>p1?p2:p1));\n\n\tmpfr_fms(a.mp,v1.mp,v2.mp,v3.mp,rnd_mode);\n\treturn a;\n}\n\nconst mpreal agm (const mpreal& v1, const mpreal& v2, mp_rnd_t rnd_mode)\n{\n\tmpreal a;\n\tmp_prec_t p1, p2;\n\n\tp1 = v1.get_prec(); \n\tp2 = v2.get_prec(); \n\n\ta.set_prec(p1>p2?p1:p2);\n\n\tmpfr_agm(a.mp, v1.mp, v2.mp, rnd_mode);\n\n\treturn a;\n}\n\nconst mpreal hypot (const mpreal& x, const mpreal& y, mp_rnd_t rnd_mode)\n{\n\tmpreal a;\n\tmp_prec_t yp, xp;\n\n\typ = y.get_prec(); \n\txp = x.get_prec(); \n\n\ta.set_prec(yp>xp?yp:xp);\n\n\tmpfr_hypot(a.mp, x.mp, y.mp, rnd_mode);\n\n\treturn a;\n}\n\nconst mpreal sum (const mpreal tab[], unsigned long int n, mp_rnd_t rnd_mode)\n{\n\tmpreal x;\n\tmpfr_ptr* t;\n\tunsigned long int i;\n\n\tt = new mpfr_ptr[n];\n\tfor (i=0;i<n;i++) t[i] = (mpfr_ptr)tab[i].mp;\n\tmpfr_sum(x.mp,t,n,rnd_mode);\n\tdelete[] t;\n\treturn x;\n}\n\nconst mpreal remainder (const mpreal& x, const mpreal& y, mp_rnd_t rnd_mode)\n{\t\n\tmpreal a;\n\tmp_prec_t yp, xp;\n\n\typ = y.get_prec(); \n\txp = x.get_prec(); \n\n\ta.set_prec(yp>xp?yp:xp);\n\n\tmpfr_remainder(a.mp, x.mp, y.mp, rnd_mode);\n\n\treturn a;\n}\n\nconst mpreal remquo (long* q, const mpreal& x, const mpreal& y, mp_rnd_t rnd_mode)\n{\n\tmpreal a;\n\tmp_prec_t yp, xp;\n\n\typ = y.get_prec(); \n\txp = x.get_prec(); \n\n\ta.set_prec(yp>xp?yp:xp);\n\n\tmpfr_remquo(a.mp,q, x.mp, y.mp, rnd_mode);\n\n\treturn a;\n}\n\ntemplate <class T>\nstd::string to_string(T t, std::ios_base & (*f)(std::ios_base&))\n{\n\tstd::ostringstream oss;\n\toss << f << t;\n\treturn oss.str();\n}\n\nmpreal::operator std::string() const\n{\n\treturn to_string();\n}\n\nstring mpreal::to_string(size_t n, int b, mp_rnd_t mode) const\n{\n\tchar *s, *ns = NULL;\t\n\tsize_t slen, nslen;\n\tmp_exp_t exp;\n\tstring out;\n\n\tif(mpfr_inf_p(mp))\n\t{ \n\t\tif(mpfr_sgn(mp)>0) return \"+@Inf@\";\n\t\telse\t\t\t   return \"-@Inf@\";\n\t}\n\n\tif(mpfr_zero_p(mp)) return \"0\";\n\tif(mpfr_nan_p(mp))  return \"@NaN@\";\n\n\t\t\n\ts  = mpfr_get_str(NULL,&exp,b,0,mp,mode);\n\tns = mpfr_get_str(NULL,&exp,b,n,mp,mode);\n\n\tif(s!=NULL && ns!=NULL)\n\t{\n\t\tslen  = strlen(s);\n\t\tnslen = strlen(ns);\n\t\tif(nslen<=slen) \n\t\t{\n\t\t\tmpfr_free_str(s);\n\t\t\ts = ns;\n\t\t\tslen = nslen;\n\t\t}\n\t\telse {\n\t\t\tmpfr_free_str(ns);\n\t\t}\n\n\t\t\/\/ Make human eye-friendly formatting if possible\n\t\tif (exp>0 && static_cast<size_t>(exp)<slen)\n\t\t{\n\t\t\tif(s[0]=='-')\n\t\t\t{\n\t\t\t\t\/\/ Remove zeros starting from right end\n\t\t\t\tchar* ptr = s+slen-1;\n\t\t\t\twhile (*ptr=='0' && ptr>s+exp) ptr--; \n\n\t\t\t\tif(ptr==s+exp) out = string(s,exp+1);\n\t\t\t\telse\t\t   out = string(s,exp+1)+'.'+string(s+exp+1,ptr-(s+exp+1)+1);\n\n\t\t\t\t\/\/out = string(s,exp+1)+'.'+string(s+exp+1);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ Remove zeros starting from right end\n\t\t\t\tchar* ptr = s+slen-1;\n\t\t\t\twhile (*ptr=='0' && ptr>s+exp-1) ptr--; \n\n\t\t\t\tif(ptr==s+exp-1) out = string(s,exp);\n\t\t\t\telse\t\t     out = string(s,exp)+'.'+string(s+exp,ptr-(s+exp)+1);\n\n\t\t\t\t\/\/out = string(s,exp)+'.'+string(s+exp);\n\t\t\t}\n\n\t\t}else{ \/\/ exp<0 || exp>slen\n\t\t\tif(s[0]=='-')\n\t\t\t{\n\t\t\t\t\/\/ Remove zeros starting from right end\n\t\t\t\tchar* ptr = s+slen-1;\n\t\t\t\twhile (*ptr=='0' && ptr>s+1) ptr--; \n\n\t\t\t\tif(ptr==s+1) out = string(s,2);\n\t\t\t\telse\t\t out = string(s,2)+'.'+string(s+2,ptr-(s+2)+1);\n\n\t\t\t\t\/\/out = string(s,2)+'.'+string(s+2);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ Remove zeros starting from right end\n\t\t\t\tchar* ptr = s+slen-1;\n\t\t\t\twhile (*ptr=='0' && ptr>s) ptr--; \n\n\t\t\t\tif(ptr==s) out = string(s,1);\n\t\t\t\telse\t   out = string(s,1)+'.'+string(s+1,ptr-(s+1)+1);\n\n\t\t\t\t\/\/out = string(s,1)+'.'+string(s+1);\n\t\t\t}\n\n\t\t\t\/\/ Make final string\n\t\t\tif(--exp)\n\t\t\t{\n\t\t\t\tif(exp>0) out += \"e+\"+mpfr::to_string<mp_exp_t>(exp,std::dec);\n\t\t\t\telse \t  out += \"e\"+mpfr::to_string<mp_exp_t>(exp,std::dec);\n\t\t\t}\n\t\t}\n\n\t\tmpfr_free_str(s);\n\t\treturn out;\n\t}else{\n\t\treturn \"conversion error!\";\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ I\/O\nostream& operator<<(ostream& os, const mpreal& v)\n{\n\treturn os<<v.to_string(os.precision());\n}\n\nistream& operator>>(istream &is, mpreal& v)\n{\n\tchar c;\t\n\tstring s = \"\";\n\tmpfr_t t;\n\n\tif(is.good())\n\t{\n\t\tis>>ws;\n\t\twhile ((c = is.get())!=EOF)\n\t\t{\n\t\t\tif(c ==' ' || c == '\\t' || c == '\\n' || c == '\\r')\n\t\t\t{\n\t\t\t\tis.putback(c);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\ts += c;\n\t\t}\n\n\t\tif(s.size() != 0)\n\t\t{\n\t\t\t\/\/ Protect current value from alternation in case of input error\n\t\t\t\/\/ so some error handling(roll back) procedure can be used \n\t\t\tif(0==mpfr_init_set_str(t,s.c_str(),mpreal::default_base,mpreal::default_rnd))\n\t\t\t{\n\t\t\t\tmpfr_set(v.mp,t,mpreal::default_rnd);\t\t\t\t\n\t\t\t\tmpfr_clear(t);\n\n\t\t\t}else{\n\t\t\t\tmpfr_clear(t);\n\t\t\t\tcerr<<\"error reading from istream\"<<endl;\n\t\t\t\t\/\/ throw an exception\n\t\t\t}\n\t\t}\n\t}\n\treturn is;\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  CSSubtitlesLoader.cpp\n\/\/  Chilli Source\n\/\/\n\/\/  Created by Ian Copland 21\/02\/2013.\n\/\/  Copyright 2013 Tag Games. All rights reserved.\n\/\/\n\n#include <ChilliSource\/Video\/Base\/CSSubtitlesLoader.h>\n\n#include <ChilliSource\/Core\/Base\/Application.h>\n#include <ChilliSource\/Core\/Base\/Utils.h>\n#include <ChilliSource\/Core\/File\/FileStream.h>\n#include <ChilliSource\/Core\/JSON\/json.h>\n#include <ChilliSource\/Core\/String\/StringParser.h>\n#include <ChilliSource\/Core\/Threading\/TaskScheduler.h>\n#include <ChilliSource\/Video\/Base\/Subtitles.h>\n\nnamespace ChilliSource\n{\n\tnamespace Video\n\t{\n        \/\/----------------------------------------------------------------\n        \/\/ Constants\n        \/\/----------------------------------------------------------------\n\t\tconst std::string k_CSSubtitlesExtension(\"mosubtitles\");\n\t\tconst std::string k_tagVersionNumber = \"VersionNumber\";\n        const std::string k_tagStyles = \"Styles\";\n        const std::string k_tagSubtitles = \"Subtitles\";\n        const std::string k_tagStyleName = \"Name\";\n        const std::string k_tagStyleFont = \"Font\";\n        const std::string k_tagStyleFontSize = \"FontSize\";\n        const std::string k_tagStyleFontColour = \"FontColour\";\n        const std::string k_tagStyleFadeTime = \"FadeTime\";\n        const std::string k_tagStyleAlignment = \"Alignment\";\n        const std::string k_tagStyleBounds = \"Bounds\";\n        const std::string k_tagStyleBoundsTop = \"Top\";\n        const std::string k_tagStyleBoundsBottom = \"Bottom\";\n        const std::string k_tagStyleBoundsLeft = \"Left\";\n        const std::string k_tagStyleBoundsRight = \"Right\";\n        const std::string k_tagSubtitlestyle = \"Style\";\n        const std::string k_tagSubtitlestartTime = \"StartTime\";\n        const std::string k_tagSubtitleEndTime = \"EndTime\";\n        const std::string k_tagSubtitleTextID = \"TextID\";\n        const std::string k_defaultFont = \"Arial\";\n        const std::string k_defaultColour = \"1.0 1.0 1.0 1.0\";\n        const std::string k_defaultAlignment = \"MiddleCentre\";\n        const u32 k_defaultFontSize = 18;\n        const TimeIntervalMs k_defaultFadeTimeMS = 250;\n        const f32 k_defaultTop = 0.0f;\n        const f32 k_defaultLeft = 0.0f;\n        const f32 k_defaultRight = 1.0f;\n        const f32 k_defaultBottom = 1.0f;\n\n\t\t\/\/----------------------------------------------------------------\n\t\t\/\/----------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::IsA(Core::InterfaceIDType in_interfaceID) const\n\t\t{\n\t\t\treturn in_interfaceID == ResourceProvider::InterfaceID || in_interfaceID == CSSubtitlesLoader::InterfaceID;\n\t\t}\n\t\t\/\/----------------------------------------------------------------\n\t\t\/\/----------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::CanCreateResourceOfKind(Core::InterfaceIDType in_interfaceID) const\n\t\t{\n\t\t\treturn (in_interfaceID == Subtitles::InterfaceID);\n\t\t}\n\t\t\/\/----------------------------------------------------------------\n\t\t\/\/----------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::CanCreateResourceFromFileWithExtension(const std::string & in_extension) const\n\t\t{\n\t\t\treturn (in_extension == k_CSSubtitlesExtension);\n\t\t}\n\t\t\/\/--------------------------------------------------------------\n\t\t\/\/--------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::CreateResourceFromFile(Core::StorageLocation in_storageLocation, const std::string& in_filePath, Core::ResourceSPtr& out_resource)\n\t\t{\n            SubtitlesSPtr pSubtitles = std::static_pointer_cast<Subtitles>(out_resource);\n            \n            LoadSubtitles(in_storageLocation, in_filePath, pSubtitles);\n            \n            return out_resource->IsLoaded();\n\t\t}\n\t\t\/\/--------------------------------------------------------------\n\t\t\/\/ Async Create Resource From File\n\t\t\/\/--------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::AsyncCreateResourceFromFile(Core::StorageLocation in_storageLocation, const std::string& in_filePath, Core::ResourceSPtr& out_resource)\n\t\t{\n\t\t\tSubtitlesSPtr pSubtitles = std::static_pointer_cast<Subtitles>(out_resource);\n\t\t\t\n\t\t\t\/\/Load model as task\n            Core::Task<Core::StorageLocation, const std::string&, SubtitlesSPtr&> task(this, &CSSubtitlesLoader::LoadSubtitles, in_storageLocation, in_filePath, pSubtitles);\n\t\t\tCore::TaskScheduler::ScheduleTask(task);\n\t\t\t\n\t\t\treturn true;\n\t\t}\n        \/\/--------------------------------------------------------------\n        \/\/--------------------------------------------------------------\n        void CSSubtitlesLoader::LoadSubtitles(Core::StorageLocation in_storageLocation, const std::string& in_filePath, SubtitlesSPtr& out_resource) const\n        {\n            \/\/read the JSON\n            Json::Value root;\n            ChilliSource::Core::Utils::ReadJson(in_storageLocation, in_filePath, &root);\n            \n            \/\/get the version number\n            u32 udwVersionNumber = root.get(k_tagVersionNumber, 0).asUInt();\n            if (udwVersionNumber != 1)\n            {\n                CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' has version number '\" + Core::ToString(udwVersionNumber) + \"'. Only version 1 is supported.\");\n                out_resource->SetLoaded(false);\n                return;\n            }\n            \n            \/\/get the styles\n            if (root.isMember(k_tagStyles) == true)\n            {\n                for (Json::ValueIterator it = root[k_tagStyles].begin(); it != root[k_tagStyles].end(); ++it)\n                {\n                    Subtitles::StylePtr pStyle = LoadStyle((*it));\n                    if (pStyle != nullptr)\n                    {\n                        out_resource->AddStyle(pStyle);\n                    }\n                    else\n                    {\n                        CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' failed to load.\");\n                        out_resource->SetLoaded(false);\n                        return;\n                    }\n                }\n            }\n            else\n            {\n                CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' does not have styles.\");\n                out_resource->SetLoaded(false);\n                return;\n            }\n            \n            \/\/get the subtitles\n            if (root.isMember(k_tagSubtitles) == true)\n            {\n                for (Json::ValueIterator it = root[k_tagSubtitles].begin(); it != root[k_tagSubtitles].end(); ++it)\n                {\n                    Subtitles::SubtitlePtr pSubtitle = LoadSubtitle((*it));\n                    if (pSubtitle != nullptr)\n                    {\n                        out_resource->AddSubtitle(pSubtitle);\n                    }\n                    else\n                    {\n                        CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' failed to load.\");\n                        out_resource->SetLoaded(false);\n                        return;\n                    }\n                }\n            }\n            else\n            {\n                CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' does not have subtitles.\");\n                out_resource->SetLoaded(false);\n                return;\n            }\n            \n            out_resource->SetLoaded(true);\n        }\n        \/\/-------------------------------------------------------------------------\n        \/\/ Load Style\n        \/\/-------------------------------------------------------------------------\n        Subtitles::StylePtr CSSubtitlesLoader::LoadStyle(const Json::Value& in_styleJSON) const\n        {\n            Subtitles::StylePtr pStyle(new Subtitles::Style());\n            \n            \/\/name\n            pStyle->strName = in_styleJSON.get(k_tagStyleName,\"\").asString();\n            if(pStyle->strName == \"\")\n            {\n                CS_LOG_ERROR(\"Subtitle style must have a name.\");\n                return Subtitles::StylePtr();\n            }\n            \n            pStyle->strFontName = in_styleJSON.get(k_tagStyleFont, k_defaultFont).asString();\n            pStyle->udwFontSize = in_styleJSON.get(k_tagStyleFontSize, k_defaultFontSize).asUInt();\n            pStyle->Colour = Core::ParseColour(in_styleJSON.get(k_tagStyleFontColour, k_defaultColour).asString());\n            pStyle->FadeTimeMS = ParseTime(in_styleJSON.get(k_tagStyleFadeTime, (s32)k_defaultFadeTimeMS).asString());\n            pStyle->eAlignment = Rendering::AlignmentAnchorFromString(in_styleJSON.get(k_tagStyleAlignment, k_defaultAlignment).asString());\n            pStyle->Bounds = LoadBounds(in_styleJSON.get(k_tagStyleBounds, \"\"));\n            \n            return pStyle;\n        }\n        \/\/-------------------------------------------------------------------------\n        \/\/-------------------------------------------------------------------------\n        Subtitles::SubtitlePtr CSSubtitlesLoader::LoadSubtitle(const Json::Value& in_subtitleJSON) const\n        {\n            Subtitles::SubtitlePtr pSubtitle(new Subtitles::Subtitle());\n            \n            \/\/style\n            pSubtitle->strStyleName = in_subtitleJSON.get(k_tagSubtitlestyle, \"\").asString();\n            if (pSubtitle->strStyleName == \"\")\n            {\n            \tCS_LOG_ERROR(\"Subtitle must have a style.\");\n            \treturn Subtitles::SubtitlePtr();\n            }\n            \n            \/\/text id\n            pSubtitle->strTextID = in_subtitleJSON.get(k_tagSubtitleTextID, \"\").asString();\n            if (pSubtitle->strTextID == \"\")\n            {\n                CS_LOG_ERROR(\"Subtitle must have a text ID.\");\n                return Subtitles::SubtitlePtr();\n            }\n            \n            pSubtitle->StartTimeMS = ParseTime(in_subtitleJSON.get(k_tagSubtitlestartTime, \"0\").asString());\n            pSubtitle->EndTimeMS = ParseTime(in_subtitleJSON.get(k_tagSubtitleEndTime, \"0\").asString());\n\n            return pSubtitle;\n        }\n        \/\/-------------------------------------------------------------------------\n        \/\/-------------------------------------------------------------------------\n        Core::Rectangle CSSubtitlesLoader::LoadBounds(const Json::Value& in_boundsJSON) const\n        {\n        \tf32 fTop = (f32)in_boundsJSON.get(k_tagStyleBoundsTop, k_defaultTop).asDouble();\n        \tf32 fBottom = (f32)in_boundsJSON.get(k_tagStyleBoundsBottom, k_defaultBottom).asDouble();\n        \tf32 fLeft = (f32)in_boundsJSON.get(k_tagStyleBoundsLeft, k_defaultLeft).asDouble();\n        \tf32 fRight = (f32)in_boundsJSON.get(k_tagStyleBoundsRight, k_defaultRight).asDouble();\n            \n            return Core::Rectangle(ChilliSource::Core::Vector2(fLeft, fTop), ChilliSource::Core::Vector2(fRight - fLeft, fBottom - fTop));\n        }\n        \/\/-------------------------------------------------------------------------\n        \/\/-------------------------------------------------------------------------\n        TimeIntervalMs CSSubtitlesLoader::ParseTime(const std::string& in_time) const\n        {\n            u32 udwHours, udwMinutes, udwSeconds, udwMilliseconds;\n\n            CS_SSCANF(in_time.c_str(), \"%d:%d:%d:%d\", &udwHours, &udwMinutes, &udwSeconds, &udwMilliseconds);\n\n            TimeIntervalMs outputMS = ((TimeIntervalMs)udwHours) * 60 * 60 * 1000 + ((TimeIntervalMs)udwMinutes) * 60 * 1000 + ((TimeIntervalMs)udwSeconds) * 1000 + ((TimeIntervalMs)udwMilliseconds);\n            return outputMS;\n        }\n\t}\n}\n<commit_msg>Forgot to remove CPP comment in subtitles<commit_after>\/\/\n\/\/  CSSubtitlesLoader.cpp\n\/\/  Chilli Source\n\/\/\n\/\/  Created by Ian Copland 21\/02\/2013.\n\/\/  Copyright 2013 Tag Games. All rights reserved.\n\/\/\n\n#include <ChilliSource\/Video\/Base\/CSSubtitlesLoader.h>\n\n#include <ChilliSource\/Core\/Base\/Application.h>\n#include <ChilliSource\/Core\/Base\/Utils.h>\n#include <ChilliSource\/Core\/File\/FileStream.h>\n#include <ChilliSource\/Core\/JSON\/json.h>\n#include <ChilliSource\/Core\/String\/StringParser.h>\n#include <ChilliSource\/Core\/Threading\/TaskScheduler.h>\n#include <ChilliSource\/Video\/Base\/Subtitles.h>\n\nnamespace ChilliSource\n{\n\tnamespace Video\n\t{\n        \/\/----------------------------------------------------------------\n        \/\/ Constants\n        \/\/----------------------------------------------------------------\n\t\tconst std::string k_CSSubtitlesExtension(\"mosubtitles\");\n\t\tconst std::string k_tagVersionNumber = \"VersionNumber\";\n        const std::string k_tagStyles = \"Styles\";\n        const std::string k_tagSubtitles = \"Subtitles\";\n        const std::string k_tagStyleName = \"Name\";\n        const std::string k_tagStyleFont = \"Font\";\n        const std::string k_tagStyleFontSize = \"FontSize\";\n        const std::string k_tagStyleFontColour = \"FontColour\";\n        const std::string k_tagStyleFadeTime = \"FadeTime\";\n        const std::string k_tagStyleAlignment = \"Alignment\";\n        const std::string k_tagStyleBounds = \"Bounds\";\n        const std::string k_tagStyleBoundsTop = \"Top\";\n        const std::string k_tagStyleBoundsBottom = \"Bottom\";\n        const std::string k_tagStyleBoundsLeft = \"Left\";\n        const std::string k_tagStyleBoundsRight = \"Right\";\n        const std::string k_tagSubtitlestyle = \"Style\";\n        const std::string k_tagSubtitlestartTime = \"StartTime\";\n        const std::string k_tagSubtitleEndTime = \"EndTime\";\n        const std::string k_tagSubtitleTextID = \"TextID\";\n        const std::string k_defaultFont = \"Arial\";\n        const std::string k_defaultColour = \"1.0 1.0 1.0 1.0\";\n        const std::string k_defaultAlignment = \"MiddleCentre\";\n        const u32 k_defaultFontSize = 18;\n        const TimeIntervalMs k_defaultFadeTimeMS = 250;\n        const f32 k_defaultTop = 0.0f;\n        const f32 k_defaultLeft = 0.0f;\n        const f32 k_defaultRight = 1.0f;\n        const f32 k_defaultBottom = 1.0f;\n\n\t\t\/\/----------------------------------------------------------------\n\t\t\/\/----------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::IsA(Core::InterfaceIDType in_interfaceID) const\n\t\t{\n\t\t\treturn in_interfaceID == ResourceProvider::InterfaceID || in_interfaceID == CSSubtitlesLoader::InterfaceID;\n\t\t}\n\t\t\/\/----------------------------------------------------------------\n\t\t\/\/----------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::CanCreateResourceOfKind(Core::InterfaceIDType in_interfaceID) const\n\t\t{\n\t\t\treturn (in_interfaceID == Subtitles::InterfaceID);\n\t\t}\n\t\t\/\/----------------------------------------------------------------\n\t\t\/\/----------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::CanCreateResourceFromFileWithExtension(const std::string & in_extension) const\n\t\t{\n\t\t\treturn (in_extension == k_CSSubtitlesExtension);\n\t\t}\n\t\t\/\/--------------------------------------------------------------\n\t\t\/\/--------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::CreateResourceFromFile(Core::StorageLocation in_storageLocation, const std::string& in_filePath, Core::ResourceSPtr& out_resource)\n\t\t{\n            SubtitlesSPtr pSubtitles = std::static_pointer_cast<Subtitles>(out_resource);\n            \n            LoadSubtitles(in_storageLocation, in_filePath, pSubtitles);\n            \n            return out_resource->IsLoaded();\n\t\t}\n\t\t\/\/--------------------------------------------------------------\n\t\t\/\/--------------------------------------------------------------\n\t\tbool CSSubtitlesLoader::AsyncCreateResourceFromFile(Core::StorageLocation in_storageLocation, const std::string& in_filePath, Core::ResourceSPtr& out_resource)\n\t\t{\n\t\t\tSubtitlesSPtr pSubtitles = std::static_pointer_cast<Subtitles>(out_resource);\n\t\t\t\n\t\t\t\/\/Load model as task\n            Core::Task<Core::StorageLocation, const std::string&, SubtitlesSPtr&> task(this, &CSSubtitlesLoader::LoadSubtitles, in_storageLocation, in_filePath, pSubtitles);\n\t\t\tCore::TaskScheduler::ScheduleTask(task);\n\t\t\t\n\t\t\treturn true;\n\t\t}\n        \/\/--------------------------------------------------------------\n        \/\/--------------------------------------------------------------\n        void CSSubtitlesLoader::LoadSubtitles(Core::StorageLocation in_storageLocation, const std::string& in_filePath, SubtitlesSPtr& out_resource) const\n        {\n            \/\/read the JSON\n            Json::Value root;\n            ChilliSource::Core::Utils::ReadJson(in_storageLocation, in_filePath, &root);\n            \n            \/\/get the version number\n            u32 udwVersionNumber = root.get(k_tagVersionNumber, 0).asUInt();\n            if (udwVersionNumber != 1)\n            {\n                CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' has version number '\" + Core::ToString(udwVersionNumber) + \"'. Only version 1 is supported.\");\n                out_resource->SetLoaded(false);\n                return;\n            }\n            \n            \/\/get the styles\n            if (root.isMember(k_tagStyles) == true)\n            {\n                for (Json::ValueIterator it = root[k_tagStyles].begin(); it != root[k_tagStyles].end(); ++it)\n                {\n                    Subtitles::StylePtr pStyle = LoadStyle((*it));\n                    if (pStyle != nullptr)\n                    {\n                        out_resource->AddStyle(pStyle);\n                    }\n                    else\n                    {\n                        CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' failed to load.\");\n                        out_resource->SetLoaded(false);\n                        return;\n                    }\n                }\n            }\n            else\n            {\n                CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' does not have styles.\");\n                out_resource->SetLoaded(false);\n                return;\n            }\n            \n            \/\/get the subtitles\n            if (root.isMember(k_tagSubtitles) == true)\n            {\n                for (Json::ValueIterator it = root[k_tagSubtitles].begin(); it != root[k_tagSubtitles].end(); ++it)\n                {\n                    Subtitles::SubtitlePtr pSubtitle = LoadSubtitle((*it));\n                    if (pSubtitle != nullptr)\n                    {\n                        out_resource->AddSubtitle(pSubtitle);\n                    }\n                    else\n                    {\n                        CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' failed to load.\");\n                        out_resource->SetLoaded(false);\n                        return;\n                    }\n                }\n            }\n            else\n            {\n                CS_LOG_ERROR(\"MoSubtitles file '\" + in_filePath + \"' does not have subtitles.\");\n                out_resource->SetLoaded(false);\n                return;\n            }\n            \n            out_resource->SetLoaded(true);\n        }\n        \/\/-------------------------------------------------------------------------\n        \/\/ Load Style\n        \/\/-------------------------------------------------------------------------\n        Subtitles::StylePtr CSSubtitlesLoader::LoadStyle(const Json::Value& in_styleJSON) const\n        {\n            Subtitles::StylePtr pStyle(new Subtitles::Style());\n            \n            \/\/name\n            pStyle->strName = in_styleJSON.get(k_tagStyleName,\"\").asString();\n            if(pStyle->strName == \"\")\n            {\n                CS_LOG_ERROR(\"Subtitle style must have a name.\");\n                return Subtitles::StylePtr();\n            }\n            \n            pStyle->strFontName = in_styleJSON.get(k_tagStyleFont, k_defaultFont).asString();\n            pStyle->udwFontSize = in_styleJSON.get(k_tagStyleFontSize, k_defaultFontSize).asUInt();\n            pStyle->Colour = Core::ParseColour(in_styleJSON.get(k_tagStyleFontColour, k_defaultColour).asString());\n            pStyle->FadeTimeMS = ParseTime(in_styleJSON.get(k_tagStyleFadeTime, (s32)k_defaultFadeTimeMS).asString());\n            pStyle->eAlignment = Rendering::AlignmentAnchorFromString(in_styleJSON.get(k_tagStyleAlignment, k_defaultAlignment).asString());\n            pStyle->Bounds = LoadBounds(in_styleJSON.get(k_tagStyleBounds, \"\"));\n            \n            return pStyle;\n        }\n        \/\/-------------------------------------------------------------------------\n        \/\/-------------------------------------------------------------------------\n        Subtitles::SubtitlePtr CSSubtitlesLoader::LoadSubtitle(const Json::Value& in_subtitleJSON) const\n        {\n            Subtitles::SubtitlePtr pSubtitle(new Subtitles::Subtitle());\n            \n            \/\/style\n            pSubtitle->strStyleName = in_subtitleJSON.get(k_tagSubtitlestyle, \"\").asString();\n            if (pSubtitle->strStyleName == \"\")\n            {\n            \tCS_LOG_ERROR(\"Subtitle must have a style.\");\n            \treturn Subtitles::SubtitlePtr();\n            }\n            \n            \/\/text id\n            pSubtitle->strTextID = in_subtitleJSON.get(k_tagSubtitleTextID, \"\").asString();\n            if (pSubtitle->strTextID == \"\")\n            {\n                CS_LOG_ERROR(\"Subtitle must have a text ID.\");\n                return Subtitles::SubtitlePtr();\n            }\n            \n            pSubtitle->StartTimeMS = ParseTime(in_subtitleJSON.get(k_tagSubtitlestartTime, \"0\").asString());\n            pSubtitle->EndTimeMS = ParseTime(in_subtitleJSON.get(k_tagSubtitleEndTime, \"0\").asString());\n\n            return pSubtitle;\n        }\n        \/\/-------------------------------------------------------------------------\n        \/\/-------------------------------------------------------------------------\n        Core::Rectangle CSSubtitlesLoader::LoadBounds(const Json::Value& in_boundsJSON) const\n        {\n        \tf32 fTop = (f32)in_boundsJSON.get(k_tagStyleBoundsTop, k_defaultTop).asDouble();\n        \tf32 fBottom = (f32)in_boundsJSON.get(k_tagStyleBoundsBottom, k_defaultBottom).asDouble();\n        \tf32 fLeft = (f32)in_boundsJSON.get(k_tagStyleBoundsLeft, k_defaultLeft).asDouble();\n        \tf32 fRight = (f32)in_boundsJSON.get(k_tagStyleBoundsRight, k_defaultRight).asDouble();\n            \n            return Core::Rectangle(ChilliSource::Core::Vector2(fLeft, fTop), ChilliSource::Core::Vector2(fRight - fLeft, fBottom - fTop));\n        }\n        \/\/-------------------------------------------------------------------------\n        \/\/-------------------------------------------------------------------------\n        TimeIntervalMs CSSubtitlesLoader::ParseTime(const std::string& in_time) const\n        {\n            u32 udwHours, udwMinutes, udwSeconds, udwMilliseconds;\n\n            CS_SSCANF(in_time.c_str(), \"%d:%d:%d:%d\", &udwHours, &udwMinutes, &udwSeconds, &udwMilliseconds);\n\n            TimeIntervalMs outputMS = ((TimeIntervalMs)udwHours) * 60 * 60 * 1000 + ((TimeIntervalMs)udwMinutes) * 60 * 1000 + ((TimeIntervalMs)udwSeconds) * 1000 + ((TimeIntervalMs)udwMilliseconds);\n            return outputMS;\n        }\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tBMP280 デジタル圧力センサー・ドライバー @n\r\n\t\t\tBosch Sensotec \/ Digital Pressure Sensor @n\r\n\t\t\thttps:\/\/www.bosch-sensortec.com\/bst\/products\/all_products\/bmp280 @n\r\n\t\t\tCopyright 2016 Kunihito Hiramatsu\r\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include <cstdint>\r\n#include <cmath>\r\n#include \"common\/iica_io.hpp\"\r\n#include \"common\/delay.hpp\"\r\n\r\nnamespace chip {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  BMP280 テンプレートクラス\r\n\t\t@param[in]\tI2C_IO\ti2c I\/O クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <class I2C_IO>\r\n\tclass BMP280 {\r\n\r\n\t\t\/\/ R\/W ビットを含まない７ビット値\r\n\t\t\/\/ ※ SDO:L ---> 0x76, SDO:H ---> 0x77\r\n\t\tstatic const uint8_t BMP280_ADR_ = 0x77;\r\n\r\n\t\tI2C_IO& i2c_;\r\n\r\n\t\tenum class REG : uint8_t {\r\n      \t\tDIG_T1        = 0x88,\r\n      \t\tDIG_T2        = 0x8A,\r\n      \t\tDIG_T3        = 0x8C,\r\n\r\n      \t\tDIG_P1        = 0x8E,\r\n      \t\tDIG_P2        = 0x90,\r\n      \t\tDIG_P3        = 0x92,\r\n      \t\tDIG_P4        = 0x94,\r\n      \t\tDIG_P5        = 0x96,\r\n      \t\tDIG_P6        = 0x98,\r\n      \t\tDIG_P7        = 0x9A,\r\n      \t\tDIG_P8        = 0x9C,\r\n      \t\tDIG_P9        = 0x9E,\r\n\r\n      \t\tCHIPID        = 0xD0,\r\n      \t\tVERSION       = 0xD1,\r\n      \t\tSOFTRESET     = 0xE0,\r\n\r\n      \t\tCAL26         = 0xE1,  \/\/ R calibration stored in 0xE1-0xF0\r\n\r\n      \t\tCONTROL       = 0xF4,\r\n      \t\tCONFIG        = 0xF5,\r\n      \t\tPRESSUREDATA  = 0xF7,\r\n      \t\tTEMPDATA      = 0xFA,\r\n\t\t\tHUMIDDATA     = 0xFD,\r\n\t\t};\r\n\r\n    \tstruct calib_t {\r\n\t\t\tuint16_t\tdig_T1;\r\n\t\t\tint16_t\t\tdig_T2;\r\n\t\t\tint16_t\t\tdig_T3;\r\n\r\n\t\t\tuint16_t\tdig_P1;\r\n\t\t\tint16_t\t\tdig_P2;\r\n\t\t\tint16_t\t\tdig_P3;\r\n\t\t\tint16_t\t\tdig_P4;\r\n\t\t\tint16_t\t\tdig_P5;\r\n\t\t\tint16_t\t\tdig_P6;\r\n\t\t\tint16_t\t\tdig_P7;\r\n\t\t\tint16_t\t\tdig_P8;\r\n\t\t\tint16_t\t\tdig_P9;\r\n\r\n\t\t\tuint8_t\t\tdig_H1;\r\n\t\t\tint16_t\t\tdig_H2;\r\n\t\t\tuint8_t\t\tdig_H3;\r\n\t\t\tint16_t\t\tdig_H4;\r\n\t\t\tint16_t\t\tdig_H5;\r\n\t\t\tint8_t\t\tdig_H6;\r\n\t\t};\r\n\r\n\t\tcalib_t\t\tcalib_;\r\n\r\n\t\tint32_t\t\tt_fine_;\r\n\r\n\t\tuint8_t read8_(REG adr) {\r\n\t\t\tuint8_t reg[1];\r\n\t\t\treg[0] = static_cast<uint8_t>(adr);\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 1);\r\n\t\t\ti2c_.recv(BMP280_ADR_, reg, 1);\r\n\t\t\treturn reg[0];\r\n\t\t}\r\n\r\n\t\tuint16_t read16_(REG adr) {\r\n\t\t\tuint8_t reg[2];\r\n\t\t\treg[0] = static_cast<uint8_t>(adr);\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 1);\r\n\t\t\ti2c_.recv(BMP280_ADR_, reg, 2);\r\n\t\t\treturn (reg[0] << 8) | reg[1];\r\n\t\t}\r\n\r\n\t\tuint32_t read24_(REG adr) {\r\n\t\t\tuint8_t reg[3];\r\n\t\t\treg[0] = static_cast<uint8_t>(adr);\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 1);\r\n\t\t\ti2c_.recv(BMP280_ADR_, reg, 3);\r\n\t\t\treturn (static_cast<uint32_t>(reg[0]) << 16) | (static_cast<uint32_t>(reg[1]) << 8) | reg[2];\r\n\t\t}\r\n\r\n\t\tuint16_t read16le_(REG adr) {\r\n\t\t\tuint8_t reg[2];\r\n\t\t\treg[0] = static_cast<uint8_t>(adr);\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 1);\r\n\t\t\ti2c_.recv(BMP280_ADR_, reg, 2);\r\n\t\t\treturn (reg[1] << 8) | reg[0];\r\n\t\t}\r\n\r\n\t\tvoid write8_(REG a, uint8_t data) {\r\n\t\t\tuint8_t reg[2];\r\n\t\t\treg[0] = static_cast<uint8_t>(a);\r\n\t\t\treg[1] = data;\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 2);\r\n\t\t}\r\n\r\n\t\tvoid get_coefficients_() {\r\n\t\t\tcalib_.dig_T1 = read16le_(REG::DIG_T1);\r\n\t\t\tcalib_.dig_T2 = read16le_(REG::DIG_T2);\r\n\t\t\tcalib_.dig_T3 = read16le_(REG::DIG_T3);\r\n\r\n\t\t\tcalib_.dig_P1 = read16le_(REG::DIG_P1);\r\n\t\t\tcalib_.dig_P2 = read16le_(REG::DIG_P2);\r\n\t\t\tcalib_.dig_P3 = read16le_(REG::DIG_P3);\r\n\t\t\tcalib_.dig_P4 = read16le_(REG::DIG_P4);\r\n\t\t\tcalib_.dig_P5 = read16le_(REG::DIG_P5);\r\n\t\t\tcalib_.dig_P6 = read16le_(REG::DIG_P6);\r\n\t\t\tcalib_.dig_P7 = read16le_(REG::DIG_P7);\r\n\t\t\tcalib_.dig_P8 = read16le_(REG::DIG_P8);\r\n\t\t\tcalib_.dig_P9 = read16le_(REG::DIG_P9);\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\t@param[in]\ti2c\tiica_io クラスを参照で渡す\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tBMP280(I2C_IO& i2c) : i2c_(i2c), calib_(), t_fine_(0) { }\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]\taddr\tオプションの I2C アドレス\r\n\t\t\t@return エラーなら「false」を返す\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool start(uint8_t addr = BMP280_ADR_) {\r\n\r\n\t\t\tif(read8_(REG::CHIPID) != 0x58) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tget_coefficients_();\r\n\r\n\t\t\twrite8_(REG::CONTROL, 0x3F);\r\n\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t温度を返す（100 * ℃）\r\n\t\t\t@return 温度\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tint32_t get_temperature() {\r\n\t\t\tint32_t adc_T = read24_(REG::TEMPDATA);\r\n\t\t\tadc_T >>= 4;\r\n\r\n  \t\t\tint32_t var1  = ((((adc_T>>3) - (static_cast<int32_t>(calib_.dig_T1) << 1))) *\r\n\t\t\t\t(static_cast<int32_t>(calib_.dig_T2))) >> 11;\r\n\r\n\t\t\tint32_t var2  = (((((adc_T>>4) - (static_cast<int32_t>(calib_.dig_T1))) *\r\n\t\t\t\t((adc_T>>4) - (static_cast<int32_t>(calib_.dig_T1)))) >> 12) *\r\n\t\t\t\t(static_cast<int32_t>(calib_.dig_T3))) >> 14;\r\n\r\n\t\t\tt_fine_ = var1 + var2;\r\n\r\n\t\t\treturn (t_fine_ * 5 + 128) >> 8;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t湿度を返す（％）(for BME280)\r\n\t\t\t@return 湿度\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat get_humidity() {\r\n\r\n\t\t\tget_temperature(); \/\/ must be done first to get t_fine\r\n\r\n\t\t\tint32_t adc_H = read16_(REG::HUMIDDATA);\r\n\r\n\t\t\tint32_t v_x1_u32r = (t_fine_ - (static_cast<int32_t>(76800)));\r\n\r\n\t\t\tv_x1_u32r = (((((adc_H << 14) - ((static_cast<int32_t>(calib_.dig_H4)) << 20) -\r\n\t\t\t\t((static_cast<int32_t>(calib_.dig_H5)) * v_x1_u32r)) + (static_cast<int32_t>(16384))) >> 15) *\r\n\t\t\t\t(((((((v_x1_u32r * (static_cast<int32_t>(calib_.dig_H6))) >> 10) *\r\n\t\t\t\t(((v_x1_u32r * (static_cast<int32_t>(calib_.dig_H3))) >> 11) +\r\n\t\t\t\t(static_cast<int32_t>(32768)))) >> 10) +\r\n\t\t\t\t(static_cast<int32_t>(2097152))) * (static_cast<int32_t>(calib_.dig_H2)) + 8192) >> 14));\r\n\r\n\t\t\tv_x1_u32r = (v_x1_u32r - (((((v_x1_u32r >> 15) * (v_x1_u32r >> 15)) >> 7) *\r\n\t\t\t\t(static_cast<int32_t>(calib_.dig_H1))) >> 4));\r\n\r\n\t\t\tv_x1_u32r = (v_x1_u32r < 0) ? 0 : v_x1_u32r;\r\n\t\t\tv_x1_u32r = (v_x1_u32r > 419430400) ? 419430400 : v_x1_u32r;\r\n\t\t\tfloat h = (v_x1_u32r>>12);\r\n\t\t\treturn  h \/ 1024.0f;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t圧力を返す（hPa * 100)\r\n\t\t\t@return 圧力\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tint32_t get_pressure_int25600() {\r\n\t\t\t\/\/ Must be done first to get the t_fine variable set up\r\n\t\t\tget_temperature();\r\n\r\n\t\t\tint32_t adc_P = read24_(REG::PRESSUREDATA);\r\n\t\t\tadc_P >>= 4;\r\n\r\n\t\t\tint64_t var1 = (static_cast<int64_t>(t_fine_)) - 128000;\r\n\t\t\tint64_t var2 = var1 * var1 * static_cast<int64_t>(calib_.dig_P6);\r\n\t\t\tvar2 = var2 + ((var1 * static_cast<int64_t>(calib_.dig_P5)) << 17);\r\n\t\t\tvar2 = var2 + ((static_cast<int64_t>(calib_.dig_P4)) << 35);\r\n\t\t\tvar1 = ((var1 * var1 * static_cast<int64_t>(calib_.dig_P3)) >> 8) +\r\n\t\t\t\t((var1 * static_cast<int64_t>(calib_.dig_P2)) << 12);\r\n\t\t\tvar1 = ((((static_cast<int64_t>(1)) << 47) + var1)) * (static_cast<int64_t>(calib_.dig_P1)) >> 33;\r\n\r\n\t\t\tif(var1 == 0) {\r\n\t\t\t\treturn 0.0f;  \/\/ avoid exception caused by division by zero\r\n\t\t\t}\r\n\r\n\t\t\tint64_t p = 1048576 - adc_P;\r\n\t\t\tp = (((p << 31) - var2) * 3125) \/ var1;\r\n\t\t\tvar1 = ((static_cast<int64_t>(calib_.dig_P9)) * (p >> 13) * (p >> 13)) >> 25;\r\n\t\t\tvar2 = ((static_cast<int64_t>(calib_.dig_P8)) * p) >> 19;\r\n\r\n\t\t\tp = ((p + var1 + var2) >> 8) + ((static_cast<int64_t>(calib_.dig_P7)) << 4);\r\n\t\t\treturn p;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t圧力を返す [hPa]\r\n\t\t\t@return 圧力 [hPa]\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat get_pressure() {\r\n\t\t\treturn static_cast<float>(get_pressure_int25600()) \/ 25600.0f; \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]\tseaLevelhPa 海面ヘクトパスカル\r\n\t\t\t@return 高度\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat get_altitude(float seaLevelhPa = 1013.25f) {\r\n\t\t\tfloat pressure = get_pressure();\r\n\t\t\tfloat altitude = 44330.0f * (1.0f - std::pow(pressure \/ seaLevelhPa, 0.1903f));\r\n\t\t\treturn altitude;\r\n\t\t}\r\n\r\n\t};\r\n}\r\n<commit_msg>update comment<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tBMP280 デジタル圧力センサー・ドライバー @n\r\n\t\t\tBosch Sensotec \/ Digital Pressure Sensor @n\r\n\t\t\thttps:\/\/www.bosch-sensortec.com\/bst\/products\/all_products\/bmp280 @n\r\n\t\t\tCopyright 2016 Kunihito Hiramatsu\r\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include <cstdint>\r\n#include <cmath>\r\n#include \"common\/iica_io.hpp\"\r\n#include \"common\/delay.hpp\"\r\n\r\nnamespace chip {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  BMP280 テンプレートクラス\r\n\t\t@param[in]\tI2C_IO\ti2c I\/O クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <class I2C_IO>\r\n\tclass BMP280 {\r\n\r\n\t\t\/\/ R\/W ビットを含まない７ビット値\r\n\t\t\/\/ ※ SDO:L ---> 0x76, SDO:H ---> 0x77\r\n\t\tstatic const uint8_t BMP280_ADR_ = 0x77;\r\n\r\n\t\tI2C_IO& i2c_;\r\n\r\n\t\tenum class REG : uint8_t {\r\n      \t\tDIG_T1        = 0x88,\r\n      \t\tDIG_T2        = 0x8A,\r\n      \t\tDIG_T3        = 0x8C,\r\n\r\n      \t\tDIG_P1        = 0x8E,\r\n      \t\tDIG_P2        = 0x90,\r\n      \t\tDIG_P3        = 0x92,\r\n      \t\tDIG_P4        = 0x94,\r\n      \t\tDIG_P5        = 0x96,\r\n      \t\tDIG_P6        = 0x98,\r\n      \t\tDIG_P7        = 0x9A,\r\n      \t\tDIG_P8        = 0x9C,\r\n      \t\tDIG_P9        = 0x9E,\r\n\r\n      \t\tCHIPID        = 0xD0,\r\n      \t\tVERSION       = 0xD1,\r\n      \t\tSOFTRESET     = 0xE0,\r\n\r\n      \t\tCAL26         = 0xE1,  \/\/ R calibration stored in 0xE1-0xF0\r\n\r\n      \t\tCONTROL       = 0xF4,\r\n      \t\tCONFIG        = 0xF5,\r\n      \t\tPRESSUREDATA  = 0xF7,\r\n      \t\tTEMPDATA      = 0xFA,\r\n\t\t\tHUMIDDATA     = 0xFD,\r\n\t\t};\r\n\r\n    \tstruct calib_t {\r\n\t\t\tuint16_t\tdig_T1;\r\n\t\t\tint16_t\t\tdig_T2;\r\n\t\t\tint16_t\t\tdig_T3;\r\n\r\n\t\t\tuint16_t\tdig_P1;\r\n\t\t\tint16_t\t\tdig_P2;\r\n\t\t\tint16_t\t\tdig_P3;\r\n\t\t\tint16_t\t\tdig_P4;\r\n\t\t\tint16_t\t\tdig_P5;\r\n\t\t\tint16_t\t\tdig_P6;\r\n\t\t\tint16_t\t\tdig_P7;\r\n\t\t\tint16_t\t\tdig_P8;\r\n\t\t\tint16_t\t\tdig_P9;\r\n\r\n\t\t\tuint8_t\t\tdig_H1;\r\n\t\t\tint16_t\t\tdig_H2;\r\n\t\t\tuint8_t\t\tdig_H3;\r\n\t\t\tint16_t\t\tdig_H4;\r\n\t\t\tint16_t\t\tdig_H5;\r\n\t\t\tint8_t\t\tdig_H6;\r\n\t\t};\r\n\r\n\t\tcalib_t\t\tcalib_;\r\n\r\n\t\tint32_t\t\tt_fine_;\r\n\r\n\t\tuint8_t read8_(REG adr) {\r\n\t\t\tuint8_t reg[1];\r\n\t\t\treg[0] = static_cast<uint8_t>(adr);\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 1);\r\n\t\t\ti2c_.recv(BMP280_ADR_, reg, 1);\r\n\t\t\treturn reg[0];\r\n\t\t}\r\n\r\n\t\tuint16_t read16_(REG adr) {\r\n\t\t\tuint8_t reg[2];\r\n\t\t\treg[0] = static_cast<uint8_t>(adr);\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 1);\r\n\t\t\ti2c_.recv(BMP280_ADR_, reg, 2);\r\n\t\t\treturn (reg[0] << 8) | reg[1];\r\n\t\t}\r\n\r\n\t\tuint32_t read24_(REG adr) {\r\n\t\t\tuint8_t reg[3];\r\n\t\t\treg[0] = static_cast<uint8_t>(adr);\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 1);\r\n\t\t\ti2c_.recv(BMP280_ADR_, reg, 3);\r\n\t\t\treturn (static_cast<uint32_t>(reg[0]) << 16) | (static_cast<uint32_t>(reg[1]) << 8) | reg[2];\r\n\t\t}\r\n\r\n\t\tuint16_t read16le_(REG adr) {\r\n\t\t\tuint8_t reg[2];\r\n\t\t\treg[0] = static_cast<uint8_t>(adr);\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 1);\r\n\t\t\ti2c_.recv(BMP280_ADR_, reg, 2);\r\n\t\t\treturn (reg[1] << 8) | reg[0];\r\n\t\t}\r\n\r\n\t\tvoid write8_(REG a, uint8_t data) {\r\n\t\t\tuint8_t reg[2];\r\n\t\t\treg[0] = static_cast<uint8_t>(a);\r\n\t\t\treg[1] = data;\r\n\t\t\ti2c_.send(BMP280_ADR_, reg, 2);\r\n\t\t}\r\n\r\n\t\tvoid get_coefficients_() {\r\n\t\t\tcalib_.dig_T1 = read16le_(REG::DIG_T1);\r\n\t\t\tcalib_.dig_T2 = read16le_(REG::DIG_T2);\r\n\t\t\tcalib_.dig_T3 = read16le_(REG::DIG_T3);\r\n\r\n\t\t\tcalib_.dig_P1 = read16le_(REG::DIG_P1);\r\n\t\t\tcalib_.dig_P2 = read16le_(REG::DIG_P2);\r\n\t\t\tcalib_.dig_P3 = read16le_(REG::DIG_P3);\r\n\t\t\tcalib_.dig_P4 = read16le_(REG::DIG_P4);\r\n\t\t\tcalib_.dig_P5 = read16le_(REG::DIG_P5);\r\n\t\t\tcalib_.dig_P6 = read16le_(REG::DIG_P6);\r\n\t\t\tcalib_.dig_P7 = read16le_(REG::DIG_P7);\r\n\t\t\tcalib_.dig_P8 = read16le_(REG::DIG_P8);\r\n\t\t\tcalib_.dig_P9 = read16le_(REG::DIG_P9);\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\t@param[in]\ti2c\tiica_io クラスを参照で渡す\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tBMP280(I2C_IO& i2c) : i2c_(i2c), calib_(), t_fine_(0) { }\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]\taddr\tオプションの I2C アドレス\r\n\t\t\t@return エラーなら「false」を返す\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool start(uint8_t addr = BMP280_ADR_) {\r\n\r\n\t\t\tif(read8_(REG::CHIPID) != 0x58) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tget_coefficients_();\r\n\r\n\t\t\twrite8_(REG::CONTROL, 0x3F);\r\n\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t温度を返す（100 * ℃）\r\n\t\t\t@return 温度\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tint32_t get_temperature() {\r\n\t\t\tint32_t adc_T = read24_(REG::TEMPDATA);\r\n\t\t\tadc_T >>= 4;\r\n\r\n  \t\t\tint32_t var1  = ((((adc_T>>3) - (static_cast<int32_t>(calib_.dig_T1) << 1))) *\r\n\t\t\t\t(static_cast<int32_t>(calib_.dig_T2))) >> 11;\r\n\r\n\t\t\tint32_t var2  = (((((adc_T>>4) - (static_cast<int32_t>(calib_.dig_T1))) *\r\n\t\t\t\t((adc_T>>4) - (static_cast<int32_t>(calib_.dig_T1)))) >> 12) *\r\n\t\t\t\t(static_cast<int32_t>(calib_.dig_T3))) >> 14;\r\n\r\n\t\t\tt_fine_ = var1 + var2;\r\n\r\n\t\t\treturn (t_fine_ * 5 + 128) >> 8;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t湿度を返す（％）(for BME280)\r\n\t\t\t@return 湿度\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat get_humidity() {\r\n\r\n\t\t\tget_temperature(); \/\/ must be done first to get t_fine\r\n\r\n\t\t\tint32_t adc_H = read16_(REG::HUMIDDATA);\r\n\r\n\t\t\tint32_t v_x1_u32r = (t_fine_ - (static_cast<int32_t>(76800)));\r\n\r\n\t\t\tv_x1_u32r = (((((adc_H << 14) - ((static_cast<int32_t>(calib_.dig_H4)) << 20) -\r\n\t\t\t\t((static_cast<int32_t>(calib_.dig_H5)) * v_x1_u32r)) + (static_cast<int32_t>(16384))) >> 15) *\r\n\t\t\t\t(((((((v_x1_u32r * (static_cast<int32_t>(calib_.dig_H6))) >> 10) *\r\n\t\t\t\t(((v_x1_u32r * (static_cast<int32_t>(calib_.dig_H3))) >> 11) +\r\n\t\t\t\t(static_cast<int32_t>(32768)))) >> 10) +\r\n\t\t\t\t(static_cast<int32_t>(2097152))) * (static_cast<int32_t>(calib_.dig_H2)) + 8192) >> 14));\r\n\r\n\t\t\tv_x1_u32r = (v_x1_u32r - (((((v_x1_u32r >> 15) * (v_x1_u32r >> 15)) >> 7) *\r\n\t\t\t\t(static_cast<int32_t>(calib_.dig_H1))) >> 4));\r\n\r\n\t\t\tv_x1_u32r = (v_x1_u32r < 0) ? 0 : v_x1_u32r;\r\n\t\t\tv_x1_u32r = (v_x1_u32r > 419430400) ? 419430400 : v_x1_u32r;\r\n\t\t\tfloat h = (v_x1_u32r>>12);\r\n\t\t\treturn  h \/ 1024.0f;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t整数圧力を返す（hPa * 100 * 256)\r\n\t\t\t@return 圧力\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tint32_t get_pressure_int25600() {\r\n\t\t\t\/\/ Must be done first to get the t_fine variable set up\r\n\t\t\tget_temperature();\r\n\r\n\t\t\tint32_t adc_P = read24_(REG::PRESSUREDATA);\r\n\t\t\tadc_P >>= 4;\r\n\r\n\t\t\tint64_t var1 = (static_cast<int64_t>(t_fine_)) - 128000;\r\n\t\t\tint64_t var2 = var1 * var1 * static_cast<int64_t>(calib_.dig_P6);\r\n\t\t\tvar2 = var2 + ((var1 * static_cast<int64_t>(calib_.dig_P5)) << 17);\r\n\t\t\tvar2 = var2 + ((static_cast<int64_t>(calib_.dig_P4)) << 35);\r\n\t\t\tvar1 = ((var1 * var1 * static_cast<int64_t>(calib_.dig_P3)) >> 8) +\r\n\t\t\t\t((var1 * static_cast<int64_t>(calib_.dig_P2)) << 12);\r\n\t\t\tvar1 = ((((static_cast<int64_t>(1)) << 47) + var1)) * (static_cast<int64_t>(calib_.dig_P1)) >> 33;\r\n\r\n\t\t\tif(var1 == 0) {\r\n\t\t\t\treturn 0.0f;  \/\/ avoid exception caused by division by zero\r\n\t\t\t}\r\n\r\n\t\t\tint64_t p = 1048576 - adc_P;\r\n\t\t\tp = (((p << 31) - var2) * 3125) \/ var1;\r\n\t\t\tvar1 = ((static_cast<int64_t>(calib_.dig_P9)) * (p >> 13) * (p >> 13)) >> 25;\r\n\t\t\tvar2 = ((static_cast<int64_t>(calib_.dig_P8)) * p) >> 19;\r\n\r\n\t\t\tp = ((p + var1 + var2) >> 8) + ((static_cast<int64_t>(calib_.dig_P7)) << 4);\r\n\t\t\treturn p;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t圧力を返す [hPa]\r\n\t\t\t@return 圧力 [hPa]\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat get_pressure() {\r\n\t\t\treturn static_cast<float>(get_pressure_int25600()) \/ 25600.0f; \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]\tseaLevelhPa 海面ヘクトパスカル\r\n\t\t\t@return 高度\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat get_altitude(float seaLevelhPa = 1013.25f) {\r\n\t\t\tfloat pressure = get_pressure();\r\n\t\t\tfloat altitude = 44330.0f * (1.0f - std::pow(pressure \/ seaLevelhPa, 0.1903f));\r\n\t\t\treturn altitude;\r\n\t\t}\r\n\r\n\t};\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*###################################################\n  ##################Cic-Cac-Coe######################\n  ######## All rights reserved to SAFAD(C) ##########\n  ###########Please read the LICENSE file############\n  ###################################################*\/\n\n#include <iostream>\n#include <cstdlib>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n\/\/This is our board, 0 => empty, 1 => X, 2 => O\nvector<char> board;\n\/\/the game is running or not ? 1 yes , 0 no\nint status = 0;\n\/\/turns 1 = player1, 2 = player2 OR CPU\nint turn = 1;\n\/\/to define the character we put in the column\nchar block;\n\/\/the user input\nint selection;\n\/\/AI vs Human\nint opponent;\n\nint checkGame(vector<char> board);\nvoid run();\n\/\/show the board\nvoid show_board() {\n    cout << \"+++++++++++++++++++++++++++++\" << endl;\n    for(int i=0; i<7; i+=3) {\n        cout << \"+++++ \"<< board[i] <<\" ++++ \"<< board[i+1] << \" +++++ \" << board[i+2] <<\" ++++++\" << endl;\n        cout << \"+++++++++++++++++++++++++++++\" << endl;\n    }\n}\n\n\/\/tell them spike, tell them its a draw !!\nvoid show_draw(){\n\tcout << \"Nothing to see here Peeps, its a Draw\" << endl;\n}\n\/\/show winner !\nvoid show_winner(){\n\tcout << \"Winner is Player \" << turn << \" congratulations !!\" << endl;\n}\n\n\/\/check who won !\nbool check_winner(vector<char> board){\n\n    for(int i=0; i<7; i+=3) {\n        if((board[i] == 'X' && board[i+1] == 'X' && board[i+2] == 'X') || (board[i] == 'O' && board[i+1] == 'O' && board[i+2] == 'O')){\n            return true;\n        }\n    }\n\n    for(int i=0; i<3; i++) {\n        if((board[i] == 'X' && board[i+3] == 'X' && board[i+6] == 'X') || (board[i] == 'O' && board[i+3] == 'O' && board[i+6] == 'O')){\n            return true;\n        }\n    }\n\n    for(int i=0; i<3; i+=2) {\n        if((board[i] == 'X' && board[4] == 'X' && board[8-i] == 'X') || (board[i] == 'O' && board[4] == 'O' && board[8-i] == 'O')){\n            return true;\n        }\n    }\n\n    return false;\n}\n\nbool check_draw(vector<char> board){\n    if (std::find(board.begin(), board.end(), '0') != board.end())\n    {\n        \/\/there still are no more moves\n        \/\/now lets see if someone one\n        if (!check_winner(board)) {\n            return true;\n        }\n    }\n\n\treturn false;\n\n}\n\n\/\/validates the user input\nbool validate_selection(int selection){\n\t\/\/first we check if it is out of range\n\tif (selection > 8 || selection < 0)\n\t{\n\t\treturn false;\n\t}\n\tif(board[selection] == 'X' || board[selection] == 'O'){\n\t\treturn false;\n\t}\n\telse {\n\t\treturn true;\n\t}\n}\n\n\/\/function to switch from player one to two and vice versa\nvoid switch_turns(){\n\tif(turn == 1){\n\t\tturn = 2;\n\t}\n\telse{\n\t\tturn = 1;\n\t}\n\trun();\n}\n\nvoid check_status(vector<char> board){\n\tint gameStatus = checkGame(board);\n\t\/\/before we switch turns, we check if the user won or not\n\tif(gameStatus == 0){\n\t\tswitch_turns();\n\t\t\n\t}\n\t\/\/what if the game is a Draw ?\n\telse if(gameStatus == 1){\n\t\tshow_board();\n\t\tshow_draw();\n\t\tstatus = 0;\n\t}\n\telse{\n\t\t\/\/winnnnnn\n\t\tshow_board();\n\t\tshow_winner();\n\t\tstatus = 0;\n\t}\n}\n\nvector<int> getAllPossibleMoves(vector<char> board){\n\tvector<int> spaces;\n\tfor (int i = 0; i < 9; ++i)\n\t{\n\t\tif (board[i] == 'E')\n\t\t{\n\t\t\t\/\/this is the chosen one\n\t\t\tspaces.push_back(i);\n\t\t}\n\t}\n\treturn spaces;\n}\n\n\/\/we use this function to check the game status, is it won, or draw\n\/\/int unfinished = 0, won = 1, draw = 2;\n\nint checkGame(vector<char> board){\n\tif(check_winner(board)){\n\t\treturn 1;\n\t}\n\t\/\/what if the game is a Draw ?\n\telse if(check_draw(board)){\n\t\treturn 2;\n\n\t}\n\treturn 0;\n}\n\nint getScore(vector<char> board, char turn){\n\tint bestScore = 0,\n\t\titerations = 0,\n\t\tMAXWIN = 100,\n\t\tpenalty = -5;\n\t\/\/here, we read all the possible moves, and choose the best based on the score\n\t\/\/score, MAXWIN = 100, DRAW = 0, MAXLOSE = -5\n\t\/\/The MAXWIN score is acheived by doing the least of iterations\n\t\/\/MAXLOSE score is achieved by doing the most of iterations, this means the computer, if he is going to lose, choose the longest path\n\t\/\/How to calculate score: MAXWIN += -5*(iterations); MAXLOSE += 5*(iterations);\n\t\/\/first we get all the possible moves\n\tvector<int> moves = getAllPossibleMoves(board);\n\t\/\/now we loop through every possibility\n\tfor(std::vector<int>::size_type i = 0; i != moves.size(); i++) \n\t{\n\t\t\/\/okay so for this we clone the board, add our move\n\t\tvector<char> newBoard(board);\n\t\t\/\/then we add a move \n\t\tnewBoard[moves[i]] = turn;\n\t\t\/\/now we check if the game is won or a draw\n\t\tif (checkGame(newBoard) == 1){\n\t\t\t\/\/this move, wins the game, but who won?\n\t\t\t\/\/if the AI wins : calculate the score, if it is better, save it as best score\n\t\t\t\/\/if the opponent wins : we calculate the lose score, compare it if it is better, then save it..\n\t\t\tint score;\n\t\t\tif (turn == 'O')\n\t\t\t{\n\t\t\t\t\/\/its me mittens!\n\t\t\t\tscore =  MAXWIN + penalty*iterations;\n\t\t\t}else{\n\t\t\t\t\/\/its the human being...\n\t\t\t\tscore = -MAXWIN - penalty*iterations;\n\t\t\t\t\n\t\t\t}\n\t\t\tbestScore = (bestScore < score) ? score : bestScore;\n\n\t\t}else if (checkGame(newBoard) == 2){\n\t\t\t\/\/its a draw, we see if the bestScore is a losing score, we rather draw than lose..\n\t\t\tbestScore = (bestScore < 0) ? 0 : bestScore;\n\t\t}else{\n\t\t\t\/\/the game is unfinished\n\t\t\t++iterations;\n\t\t\t\/\/now we create a new board, and get its best score..\n\t\t\tvector<char> clonedBoard(newBoard);\n\t\t\tchar newTurn = (turn == 'X') ? 'O' : 'X';\n\t\t\tint score = getScore(clonedBoard,newTurn);\n\t\t\tbestScore = (bestScore < score) ? score : bestScore;\n\t\t}\n\n\t}\n\treturn bestScore;\n}\nint nextMove(){\n\t\/\/first we see, if the game has just begun\n\t\/\/first we generate a list of all possible moves\n\t\/\/then we loop over it\n\t\/\/then we get the score of each move\n\t\/\/and we compare it to the bestScore, if it is better take it and keep it as best move\n\tint bestScore,\n\t\tbestMove;\n\n\tvector<int> moves = getAllPossibleMoves(board);\n\tint size = moves.size();\n\tif (size == 8)\n\t{\n\t\tint random = rand() % size;\n\t\treturn moves[random];\n\n\t}\n\tfor(std::vector<int>::size_type i = 0; i != size; i++) {\n\t    vector<char> newBoard(board);\n\t\tnewBoard[moves[i]] = 'O';\n\t\tint score = getScore(newBoard,'X');\n\t\tif (bestScore < score)\n\t\t{\n\t\t\tbestScore = score;\n\t\t\tbestMove = moves[i];\n\t\t}\n\t}\n\tcout << bestMove << endl;\n\treturn bestMove;\n}\n\nvoid AI(){\n\tcout << \"Calculating...\" << endl;\n\tint next = nextMove();\n\t\/\/now we use it on screen\n\tif(validate_selection(next)){\n\t\tboard[next] = 'O';\n\t\tcheck_status(board);\n\t}\n\telse{\n\t\tAI();\n\t}\n}\n\nvoid player(){\n\tcout << \"Player \" << turn << \" Please enter a valid number (0-8) :\" <<endl;\n\tcin >> selection;\n\tif(validate_selection(selection)){\n\t\tboard[selection] = block;\n\t\tcheck_status(board);\n\t}else{\n\t\t\/\/his choice is invalid\n\t\tcout << \"invalid move\" << endl;\n\t\tplayer();\n\t}\n}\n\n\/\/function to show the board\nvoid run(){\n\tshow_board();\n\tblock = (turn == 1) ? 'X' : 'O';\n\t\/\/Artificial Inteligence :)\n\tif(opponent == 2 && turn == 2){\n\t\tAI();\n\t}\n\telse{\n\t\tplayer();\n\t}\n\n}\n\nint main(){\n\t\/\/we first populate the board with dummy strings\n\tchar dummy[9] = {'E','E','E','E','E','E','E','E','E'};\n\n\tfor(int index=0;index<9; ++index)\n\t{\n\t\tboard.push_back(dummy[index]);\n\t}\n\n\tif(status == 0){\n\t\tcout << \"Play VS :\" << endl;\n\t\tcout << \"1. Human\" << endl;\n\t\tcout << \"2. AI (CPU)\" << endl;\n\t\tcin >> opponent;\n\t\tstatus = 1;\n\t}\n\trun();\n}\n\n<commit_msg>few changes here and there, half stupid AI, still crashes..<commit_after>\/*###################################################\n  ##################Cic-Cac-Coe######################\n  ######## All rights reserved to SAFAD(C) ##########\n  ###########Please read the LICENSE file############\n  ###################################################*\/\n\n#include <iostream>\n#include <cstdlib>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n\/\/This is our board, 0 => empty, 1 => X, 2 => O\nvector<char> board;\n\/\/the game is running or not ? 1 yes , 0 no\nint status = 0;\n\/\/turns 1 = player1, 2 = player2 OR CPU\nint turn = 1;\n\/\/to define the character we put in the column\nchar block;\n\/\/the user input\nint selection;\n\/\/AI vs Human\nint opponent;\n\nint checkGame(vector<char> board);\nvoid run();\n\/\/show the board\nvoid show_board() {\n    cout << \"+++++++++++++++++++++++++++++\" << endl;\n    for(int i=0; i<7; i+=3) {\n        cout << \"+++++ \"<< board[i] <<\" ++++ \"<< board[i+1] << \" +++++ \" << board[i+2] <<\" ++++++\" << endl;\n        cout << \"+++++++++++++++++++++++++++++\" << endl;\n    }\n}\n\n\/\/tell them spike, tell them its a draw !!\nvoid show_draw(){\n\tcout << \"Nothing to see here Peeps, its a Draw\" << endl;\n}\n\/\/show winner !\nvoid show_winner(){\n\tcout << \"Winner is Player \" << turn << \" congratulations !!\" << endl;\n}\n\n\/\/check who won !\nbool check_winner(vector<char> board){\n\n    for(int i=0; i<7; i+=3) {\n        if((board[i] == 'X' && board[i+1] == 'X' && board[i+2] == 'X') || (board[i] == 'O' && board[i+1] == 'O' && board[i+2] == 'O')){\n            return true;\n        }\n    }\n\n    for(int i=0; i<3; i++) {\n        if((board[i] == 'X' && board[i+3] == 'X' && board[i+6] == 'X') || (board[i] == 'O' && board[i+3] == 'O' && board[i+6] == 'O')){\n            return true;\n        }\n    }\n\n    for(int i=0; i<3; i+=2) {\n        if((board[i] == 'X' && board[4] == 'X' && board[8-i] == 'X') || (board[i] == 'O' && board[4] == 'O' && board[8-i] == 'O')){\n            return true;\n        }\n    }\n\n    return false;\n}\n\nbool check_draw(vector<char> board){\n    if (std::count(board.begin(), board.end(), 'E') < 0)\n    {\n        \/\/there still are no more moves\n        \/\/now lets see if someone one\n        if (!check_winner(board)) {\n            return true;\n        }\n    }\n\n\treturn false;\n\n}\n\n\/\/validates the user input\nbool validate_selection(int selection){\n\t\/\/first we check if it is out of range\n\tif (selection > 8 || selection < 0)\n\t{\n\t\treturn false;\n\t}\n\tif(board[selection] == 'X' || board[selection] == 'O'){\n\t\treturn false;\n\t}\n\telse {\n\t\treturn true;\n\t}\n}\n\n\/\/function to switch from player one to two and vice versa\nvoid switch_turns(){\n\tif(turn == 1){\n\t\tturn = 2;\n\t}\n\telse{\n\t\tturn = 1;\n\t}\n\trun();\n}\n\nvoid check_status(vector<char> board){\n\tint gameStatus = checkGame(board);\n\t\/\/before we switch turns, we check if the user won or not\n\tif(gameStatus == 0){\n\t\tswitch_turns();\n\t\t\n\t}\n\t\/\/what if the game is a Draw ?\n\telse if(gameStatus == 2){\n\t\tshow_board();\n\t\tshow_draw();\n\t\tstatus = 0;\n\t}\n\telse if(gameStatus == 1){\n\t\t\/\/winnnnnn\n\t\tshow_board();\n\t\tshow_winner();\n\t\tstatus = 0;\n\t}\n}\n\nvector<int> getAllPossibleMoves(vector<char> board){\n\tvector<int> spaces;\n\tfor (int i = 0; i < 9; ++i)\n\t{\n\t\tif (board[i] == 'E')\n\t\t{\n\t\t\t\/\/this is the chosen one\n\t\t\tspaces.push_back(i);\n\t\t}\n\t}\n\treturn spaces;\n}\n\n\/\/we use this function to check the game status, is it won, or draw\n\/\/int unfinished = 0, won = 1, draw = 2;\n\nint checkGame(vector<char> board){\n\tif(check_winner(board)){\n\t\treturn 1;\n\t}\n\t\/\/what if the game is a Draw ?\n\telse if(check_draw(board)){\n\t\treturn 2;\n\n\t}\n\treturn 0;\n}\n\nint getScore(vector<char> board, char turn){\n\tint bestScore = 0,\n\t\titerations = 0,\n\t\tMAXWIN = 100,\n\t\tpenalty = -5;\n\t\/\/here, we read all the possible moves, and choose the best based on the score\n\t\/\/score, MAXWIN = 100, DRAW = 0, MAXLOSE = -5\n\t\/\/The MAXWIN score is acheived by doing the least of iterations\n\t\/\/MAXLOSE score is achieved by doing the most of iterations, this means the computer, if he is going to lose, choose the longest path\n\t\/\/How to calculate score: MAXWIN += -5*(iterations); MAXLOSE += 5*(iterations);\n\t\/\/first we get all the possible moves\n\tvector<int> moves = getAllPossibleMoves(board);\n\t\/\/now we loop through every possibility\n\tfor(std::vector<int>::size_type i = 0; i != moves.size(); i++) \n\t{\n\t\t\/\/okay so for this we clone the board, add our move\n\t\tvector<char> newBoard(board);\n\t\t\/\/then we add a move \n\t\tnewBoard[moves[i]] = turn;\n\t\t\/\/now we check if the game is won or a draw\n\t\tif (checkGame(newBoard) == 1){\n\t\t\t\/\/this move, wins the game, but who won?\n\t\t\t\/\/if the AI wins : calculate the score, if it is better, save it as best score\n\t\t\t\/\/if the opponent wins : we calculate the lose score, compare it if it is better, then save it..\n\t\t\tint score;\n\t\t\tif (turn == 'O')\n\t\t\t{\n\t\t\t\t\/\/its me mittens!\n\t\t\t\tscore =  MAXWIN + penalty*iterations;\n\t\t\t}else{\n\t\t\t\t\/\/its the human being...\n\t\t\t\tscore = -MAXWIN - penalty*iterations;\n\t\t\t\t\n\t\t\t}\n\t\t\tbestScore = (bestScore < score) ? score : bestScore;\n\n\t\t}else if (checkGame(newBoard) == 2){\n\t\t\t\/\/its a draw, we see if the bestScore is a losing score, we rather draw than lose..\n\t\t\tbestScore = (bestScore < 0) ? 0 : bestScore;\n\t\t}else{\n\t\t\t\/\/the game is unfinished\n\t\t\t++iterations;\n\t\t\t\/\/now we create a new board, and get its best score..\n\t\t\tvector<char> clonedBoard(newBoard);\n\t\t\tchar newTurn = (turn == 'X') ? 'O' : 'X';\n\t\t\tint score = getScore(clonedBoard,newTurn);\n\t\t\tbestScore = (bestScore < score) ? score : bestScore;\n\t\t}\n\n\t}\n\treturn bestScore;\n}\nint nextMove(){\n\t\/\/first we see, if the game has just begun\n\t\/\/first we generate a list of all possible moves\n\t\/\/then we loop over it\n\t\/\/then we get the score of each move\n\t\/\/and we compare it to the bestScore, if it is better take it and keep it as best move\n\tint bestScore = 0,\n\t\tbestMove = 0;\n\n\tvector<int> moves = getAllPossibleMoves(board);\n\tint size = moves.size();\n\tif (size == 8)\n\t{\n\t\tint random = rand() % size;\n\t\treturn moves[random];\n\n\t}\n\tfor(std::vector<int>::size_type i = 0; i != size; i++) {\n\t    vector<char> newBoard(board);\n\t\tnewBoard[moves[i]] = 'O';\n\t\tint score = getScore(newBoard,'X');\n\t\tif (bestScore < score)\n\t\t{\n\t\t\tbestScore = score;\n\t\t\tbestMove = moves[i];\n\t\t}\n\t}\n\treturn bestMove;\n}\n\nvoid AI(){\n\tcout << \"Calculating...\" << endl;\n\tint next = nextMove();\n\t\/\/now we use it on screen\n\tif(validate_selection(next)){\n\t\tboard[next] = 'O';\n\t\tcheck_status(board);\n\t}\n\telse{\n\t\tAI();\n\t}\n}\n\nvoid player(){\n\tcout << \"Player \" << turn << \" Please enter a valid number (0-8) :\" <<endl;\n\tcin >> selection;\n\tif(validate_selection(selection)){\n\t\tboard[selection] = block;\n\t\tcheck_status(board);\n\t}else{\n\t\t\/\/his choice is invalid\n\t\tcout << \"invalid move\" << endl;\n\t\tplayer();\n\t}\n}\n\n\/\/function to show the board\nvoid run(){\n\tshow_board();\n\tblock = (turn == 1) ? 'X' : 'O';\n\t\/\/Artificial Inteligence :)\n\tif(opponent == 2 && turn == 2){\n\t\tAI();\n\t}\n\telse{\n\t\tplayer();\n\t}\n\n}\n\nint main(){\n\t\/\/we first populate the board with dummy strings\n\tchar dummy[9] = {'E','E','E','E','E','E','E','E','E'};\n\n\tfor(int index=0;index<9; ++index)\n\t{\n\t\tboard.push_back(dummy[index]);\n\t}\n\n\tif(status == 0){\n\t\tcout << \"Play VS :\" << endl;\n\t\tcout << \"1. Human\" << endl;\n\t\tcout << \"2. AI (CPU)\" << endl;\n\t\tcin >> opponent;\n\t\tstatus = 1;\n\t}\n\trun();\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 \"otbMeanShiftSegmentationFilter.h\"\n#include \"itkMacro.h\"\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbImageFileWriter.h\"\n\nint otbMeanShiftSegmentationFilter(int argc, char * argv[])\n{\n  if (argc != 6)\n    {\n    std::cerr << \"Usage: \" << argv[0] <<\n    \" inputFileName outputLabelFileName outputClusteredFileName spatialBandwidth rangeBandwidth\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  const char *       inputFileName             = argv[1];\n  const char *       outputLabelFileName       = argv[2];\n  const char *       outputClusteredFileName   = argv[3];\n  const double       spatialBandwidth          = atof(argv[4]);\n  const double       rangeBandwidth            = atof(argv[5]);\n\n  \/* maxit - threshold *\/\n\n  const unsigned int Dimension = 2;\n  typedef float                                            PixelType;\n  typedef double                                           KernelType;\n  typedef otb::VectorImage<PixelType, Dimension>           ImageType;\n  typedef otb::Image<unsigned int, Dimension>              LabelImageType;\n  typedef otb::ImageFileReader<ImageType>                  ReaderType;\n  typedef otb::ImageFileWriter<ImageType>                  ClusteredWriterType;\n  typedef otb::ImageFileWriter<LabelImageType>             LabelWriterType;\n\n  typedef otb::MeanShiftSegmentationFilter<ImageType, LabelImageType, ImageType> FilterType;\n\n  \/\/ Instantiating object\n  FilterType::Pointer filter = FilterType::New();\n  ReaderType::Pointer reader = ReaderType::New();\n\n  reader->SetFileName(inputFileName);\n\n  \/\/ Set filter parameters\n  filter->SetSpatialBandwidth(spatialBandwidth);\n  filter->SetRangeBandwidth(rangeBandwidth);\n  filter->SetInput(reader->GetOutput());\n\n  \/\/filter->SetNumberOfThreads(1);\n  ClusteredWriterType::Pointer writerClustered = ClusteredWriterType::New();\n  LabelWriterType::Pointer writerLabel = LabelWriterType::New();\n\n  writerClustered->SetFileName(outputClusteredFileName);\n  writerLabel->SetFileName(outputLabelFileName);\n\n  writerClustered->SetInput(filter->GetClusteredOutput());\n  writerLabel->SetInput(filter->GetLabelOutput());\n\n\/\/  writerClustered->Update();\n  writerLabel->Update();\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>TEST: Activating 2nd output<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 \"otbMeanShiftSegmentationFilter.h\"\n#include \"itkMacro.h\"\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbImageFileWriter.h\"\n\nint otbMeanShiftSegmentationFilter(int argc, char * argv[])\n{\n  if (argc != 6)\n    {\n    std::cerr << \"Usage: \" << argv[0] <<\n    \" inputFileName outputLabelFileName outputClusteredFileName spatialBandwidth rangeBandwidth\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  const char *       inputFileName             = argv[1];\n  const char *       outputLabelFileName       = argv[2];\n  const char *       outputClusteredFileName   = argv[3];\n  const double       spatialBandwidth          = atof(argv[4]);\n  const double       rangeBandwidth            = atof(argv[5]);\n\n  \/* maxit - threshold *\/\n\n  const unsigned int Dimension = 2;\n  typedef float                                            PixelType;\n  typedef double                                           KernelType;\n  typedef otb::VectorImage<PixelType, Dimension>           ImageType;\n  typedef otb::Image<unsigned int, Dimension>              LabelImageType;\n  typedef otb::ImageFileReader<ImageType>                  ReaderType;\n  typedef otb::ImageFileWriter<ImageType>                  ClusteredWriterType;\n  typedef otb::ImageFileWriter<LabelImageType>             LabelWriterType;\n\n  typedef otb::MeanShiftSegmentationFilter<ImageType, LabelImageType, ImageType> FilterType;\n\n  \/\/ Instantiating object\n  FilterType::Pointer filter = FilterType::New();\n  ReaderType::Pointer reader = ReaderType::New();\n\n  reader->SetFileName(inputFileName);\n\n  \/\/ Set filter parameters\n  filter->SetSpatialBandwidth(spatialBandwidth);\n  filter->SetRangeBandwidth(rangeBandwidth);\n  filter->SetInput(reader->GetOutput());\n\n  \/\/filter->SetNumberOfThreads(1);\n  ClusteredWriterType::Pointer writerClustered = ClusteredWriterType::New();\n  LabelWriterType::Pointer writerLabel = LabelWriterType::New();\n\n  writerClustered->SetFileName(outputClusteredFileName);\n  writerLabel->SetFileName(outputLabelFileName);\n\n  writerClustered->SetInput(filter->GetClusteredOutput());\n  writerLabel->SetInput(filter->GetLabelOutput());\n\n  writerClustered->Update();\n  writerLabel->Update();\n\n  return EXIT_SUCCESS;\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 \"itkExceptionObject.h\"\n#include \"itkFixedArray.h\"\n#include \"otbLandsatTMIndices.h\"\n\nint otbLandsatTMIndexVis(int argc, char * argv[])\n{\n  typedef double                           OutputPixelType;\n  typedef itk::FixedArray< double, 8 >     InputPixelType;\n\n  typedef otb::Functor::LandsatTM::Vis<InputPixelType, OutputPixelType> FunctorType;\n\n  FunctorType visFunct = FunctorType();\n\n  double TM1 = (::atof(argv[1]));\n  double TM2 = (::atof(argv[2]));\n  double TM3 = (::atof(argv[3]));\n  double TM4 = (::atof(argv[4]));\n  double TM5 = (::atof(argv[5]));\n  double TM61 = (::atof(argv[6]));\n  double TM62 = (::atof(argv[7]));\n  double TM7 = (::atof(argv[8]));\n\n  double goodResult = (TM1+TM2+TM3)\/3.0;\n\n  std::cout << goodResult ;\n\n  InputPixelType pixel;\n  pixel[0] = TM1;\n  pixel[1] = TM2;\n  pixel[2] = TM3;\n  pixel[3] = TM4;\n  pixel[4] = TM5;\n  pixel[5] = TM61;\n  pixel[6] = TM62;\n  pixel[7] = TM7;\n\n  double result = visFunct(pixel);\n\n  std::cout << \" \" << result << std::endl;\n\n  if( result!=goodResult ) return EXIT_FAILURE;\n  \n  return EXIT_SUCCESS;\n}\n<commit_msg>TEST: Landsat TM NIR test<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 \"itkExceptionObject.h\"\n#include \"itkFixedArray.h\"\n#include \"otbLandsatTMIndices.h\"\n\nint otbLandsatTMIndexNIR(int argc, char * argv[])\n{\n  typedef double                           OutputPixelType;\n  typedef itk::FixedArray< double, 8 >     InputPixelType;\n\n  typedef otb::Functor::LandsatTM::NIR<InputPixelType, OutputPixelType> FunctorType;\n\n  FunctorType nirFunct = FunctorType();\n\n  double TM1 = (::atof(argv[1]));\n  double TM2 = (::atof(argv[2]));\n  double TM3 = (::atof(argv[3]));\n  double TM4 = (::atof(argv[4]));\n  double TM5 = (::atof(argv[5]));\n  double TM61 = (::atof(argv[6]));\n  double TM62 = (::atof(argv[7]));\n  double TM7 = (::atof(argv[8]));\n\n  double goodResult = TM4;\n\n  std::cout << goodResult ;\n\n  InputPixelType pixel;\n  pixel[0] = TM1;\n  pixel[1] = TM2;\n  pixel[2] = TM3;\n  pixel[3] = TM4;\n  pixel[4] = TM5;\n  pixel[5] = TM61;\n  pixel[6] = TM62;\n  pixel[7] = TM7;\n\n  double result = visFunct(pixel);\n\n  std::cout << \" \" << result << std::endl;\n\n  if( result!=goodResult ) return EXIT_FAILURE;\n  \n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/\/ generic (non-architecture-specific) implementations of gemmBitserial\n\/\/ and other related functions\n\nGEMMContext allocGEMMContext_generic(\n  uint64_t lhsRows, uint64_t depth, uint64_t rhsRows,\n  uint64_t lhsBits, uint64_t rhsBits,\n  bool lhsSigned, bool rhsSigned\n) {\n  const uint64_t regblock_lhs = 2;\n  const uint64_t regblock_d = 1;\n  const uint64_t regblock_rhs = 2;\n  const uint64_t cacheBits = 32*1024*8;\n\n  GEMMContext ret;\n  uint64_t depth_al = alignTo(depth, regblock_d*64);\n  \/\/ TODO add bypass for small enough matrices here?\n  \/\/ use cache blocking; compute sizes\n  computeBlockSize(\n    regblock_lhs, regblock_rhs, cacheBits, depth_al,\n    ret.lhsBlock, ret.rhsBlock\n  );\n  if(ret.lhsBlock > lhsRows || ret.rhsBlock > rhsRows) {\n    \/\/ use register blocking only\n    ret.lhsBlock = regblock_lhs;\n    ret.rhsBlock = regblock_rhs;\n  }\n  \/\/ allocate aligned bit serial matrices\n  ret.lhs = BitSerialMatrix::alloc(\n    lhsBits, lhsRows, depth, lhsSigned, ret.lhsBlock, regblock_d*64\n  );\n  ret.rhs = BitSerialMatrix::alloc(\n    rhsBits, rhsRows, depth, rhsSigned, ret.rhsBlock, regblock_d*64\n  );\n  \/\/ allocate result matrix. note that it is not aligned -- the\n  \/\/ elements corresponding to alignment parts won't materialize.\n  ret.res = new int32_t[lhsRows * rhsRows];\n  return ret;\n};\n\n\n\n\/* Multiply a lhs_block x rhs_block chunk of the given matrices, starting at\n  (bA, bBT) using 2x1x2 register tiling. For internal use.\n*\/\ninline void gemmBinary_generic_chunk_tile2x1x2(\n  uint64_t * A, uint64_t * BT, int32_t * CT,\n  int32_t alpha,\n  uint64_t rowsA, uint64_t depth_words, uint64_t rowsBT,\n  uint64_t bA, uint64_t bBT,\n  uint64_t lhs_block, uint64_t rhs_block,\n  uint64_t rowsA_orig, uint64_t rowsBT_orig) {\n  const uint64_t Atile = 2, DepthTile = 1, BTtile = 2;\n  const size_t num_acc = Atile*BTtile;\n\n  for(uint64_t rBT = bBT; rBT < bBT + rhs_block; rBT += BTtile) {\n    uint64_t * BTptr = &BT[rBT * depth_words];\n    for(uint64_t rA = bA; rA < bA + lhs_block; rA += Atile) {\n      uint64_t * Aptr = &A[rA * depth_words];\n      int32_t acc[num_acc] = {0};\n      for(uint64_t d = 0; d < depth_words; d += DepthTile) {\n        const uint64_t a0 = Aptr[d], a1 = Aptr[d + depth_words];\n        const uint64_t b0 = BTptr[d], b1 = BTptr[d + depth_words];\n        acc[0] += __builtin_popcountll(a0 & b0);\n        acc[1] += __builtin_popcountll(a0 & b1);\n        acc[2] += __builtin_popcountll(a1 & b0);\n        acc[3] += __builtin_popcountll(a1 & b1);\n      }\n      for(uint64_t at = 0; at < Atile; at++) {\n        for(uint64_t bt = 0; bt < BTtile; bt++) {\n          \/\/ TODO less than or leq?\n          if(((rBT + bt) < rowsBT_orig) && ((rA + at) < rowsA_orig)) {\n            CT[(rBT + bt) * rowsA_orig + (rA + at)] += acc[at * BTtile + bt] * alpha;\n          }\n        }\n      }\n    }\n  }\n}\n\n\/* CT = A * BT using cache blocking and 2x1x2 register blocking where possible.\n   For internal use.\n*\/\nvoid gemmBinary_generic_L1_tile2x1x2(\n  uint64_t * A, uint64_t * BT, int32_t * CT, int32_t alpha,\n  uint64_t rowsA, uint64_t depth_words, uint64_t rowsBT,\n  uint64_t rowsA_orig, uint64_t rowsBT_orig,\n  uint64_t lhsBlock, uint64_t rhsBlock\n  ) {\n  const uint64_t Atile = 2, DepthTile = 1, BTtile = 2;\n  assert(rowsBT % rhsBlock == 0);\n  assert(rowsA % lhsBlock == 0);\n  assert(lhsBlock % Atile == 0);\n  assert(rhsBlock % BTtile == 0);\n\n  for(uint64_t bBT = 0; bBT < rowsBT; bBT += rhsBlock) {\n    for(uint64_t bA = 0; bA < rowsA; bA += lhsBlock) {\n      gemmBinary_generic_chunk_tile2x1x2(\n        A, BT, CT, alpha, rowsA, depth_words, rowsBT, bA, bBT,\n        lhsBlock, rhsBlock, rowsA_orig, rowsBT_orig\n      );\n    }\n  }\n}\n\n\/* Bit-serial GEMM via a series of calls to gemmBinary.\n   Note that rhs must be given in transposed form, and the result is also\n   produced transposed.\n*\/\n\nvoid gemmBitSerial_generic_usingBinary(GEMMContext ctx) {\n  \/\/ ensure that matrix shapes are compatible\n  assert(ctx.lhs.ncols == ctx.rhs.ncols);\n  const uint64_t lhsbits = ctx.lhs.nbits;\n  const uint64_t rhsbits = ctx.rhs.nbits;\n  \/\/ clear contents of result matrix by setting everything to zero\n  memset(ctx.res, 0, ctx.lhs.nrows*ctx.rhs.nrows*sizeof(int32_t));\n  \/\/ call binary GEMM for each bit position\n  for(uint64_t lbit = 0; lbit < lhsbits; lbit++) {\n    bool neg_lhs = ctx.lhs.issigned && (lbit == lhsbits-1);\n    for(uint64_t rbit = 0; rbit < rhsbits; rbit++) {\n      bool neg_rhs = ctx.rhs.issigned && (rbit == rhsbits-1);\n      bool neg = neg_rhs ^ neg_lhs;\n      int32_t alpha = neg ? -(1 << (lbit+rbit)) : (1 << (lbit+rbit));\n      gemmBinary_generic_L1_tile2x1x2(\n        ctx.lhs.bitplaneptr(lbit), ctx.rhs.bitplaneptr(rbit), ctx.res, alpha,\n        ctx.lhs.nrows_a, ctx.lhs.wordsPerRow(), ctx.rhs.nrows_a,\n        ctx.lhs.nrows, ctx.rhs.nrows, ctx.lhsBlock, ctx.rhsBlock\n      );\n    }\n  }\n}\n<commit_msg>fix blocking for small matrices<commit_after>#pragma once\n\n\/\/ generic (non-architecture-specific) implementations of gemmBitserial\n\/\/ and other related functions\n\nGEMMContext allocGEMMContext_generic(\n  uint64_t lhsRows, uint64_t depth, uint64_t rhsRows,\n  uint64_t lhsBits, uint64_t rhsBits,\n  bool lhsSigned, bool rhsSigned\n) {\n  const uint64_t regblock_lhs = 2;\n  const uint64_t regblock_d = 1;\n  const uint64_t regblock_rhs = 2;\n  const uint64_t cacheBits = 32*1024*8;\n\n  GEMMContext ret;\n  uint64_t depth_al = alignTo(depth, regblock_d*64);\n  \/\/ TODO add bypass for small enough matrices here?\n  \/\/ use cache blocking; compute sizes\n  computeBlockSize(\n    regblock_lhs, regblock_rhs, cacheBits, depth_al,\n    ret.lhsBlock, ret.rhsBlock\n  );\n  if(ret.lhsBlock > lhsRows || ret.rhsBlock > rhsRows) {\n    \/\/ use register blocking only\n    ret.lhsBlock = alignTo(lhsRows, regblock_lhs);\n    ret.rhsBlock = alignTo(rhsRows, regblock_rhs);\n  }\n  \/\/ allocate aligned bit serial matrices\n  ret.lhs = BitSerialMatrix::alloc(\n    lhsBits, lhsRows, depth, lhsSigned, ret.lhsBlock, regblock_d*64\n  );\n  ret.rhs = BitSerialMatrix::alloc(\n    rhsBits, rhsRows, depth, rhsSigned, ret.rhsBlock, regblock_d*64\n  );\n  \/\/ allocate result matrix. note that it is not aligned -- the\n  \/\/ elements corresponding to alignment parts won't materialize.\n  ret.res = new int32_t[lhsRows * rhsRows];\n  return ret;\n};\n\n\n\n\/* Multiply a lhs_block x rhs_block chunk of the given matrices, starting at\n  (bA, bBT) using 2x1x2 register tiling. For internal use.\n*\/\ninline void gemmBinary_generic_chunk_tile2x1x2(\n  uint64_t * A, uint64_t * BT, int32_t * CT,\n  int32_t alpha,\n  uint64_t rowsA, uint64_t depth_words, uint64_t rowsBT,\n  uint64_t bA, uint64_t bBT,\n  uint64_t lhs_block, uint64_t rhs_block,\n  uint64_t rowsA_orig, uint64_t rowsBT_orig) {\n  const uint64_t Atile = 2, DepthTile = 1, BTtile = 2;\n  const size_t num_acc = Atile*BTtile;\n\n  for(uint64_t rBT = bBT; rBT < bBT + rhs_block; rBT += BTtile) {\n    uint64_t * BTptr = &BT[rBT * depth_words];\n    for(uint64_t rA = bA; rA < bA + lhs_block; rA += Atile) {\n      uint64_t * Aptr = &A[rA * depth_words];\n      int32_t acc[num_acc] = {0};\n      for(uint64_t d = 0; d < depth_words; d += DepthTile) {\n        const uint64_t a0 = Aptr[d], a1 = Aptr[d + depth_words];\n        const uint64_t b0 = BTptr[d], b1 = BTptr[d + depth_words];\n        acc[0] += __builtin_popcountll(a0 & b0);\n        acc[1] += __builtin_popcountll(a0 & b1);\n        acc[2] += __builtin_popcountll(a1 & b0);\n        acc[3] += __builtin_popcountll(a1 & b1);\n      }\n      for(uint64_t at = 0; at < Atile; at++) {\n        for(uint64_t bt = 0; bt < BTtile; bt++) {\n          if(((rBT + bt) < rowsBT_orig) && ((rA + at) < rowsA_orig)) {\n            CT[(rBT + bt) * rowsA_orig + (rA + at)] += acc[at * BTtile + bt] * alpha;\n          }\n        }\n      }\n    }\n  }\n}\n\n\/* CT = A * BT using cache blocking and 2x1x2 register blocking where possible.\n   For internal use.\n*\/\nvoid gemmBinary_generic_L1_tile2x1x2(\n  uint64_t * A, uint64_t * BT, int32_t * CT, int32_t alpha,\n  uint64_t rowsA, uint64_t depth_words, uint64_t rowsBT,\n  uint64_t rowsA_orig, uint64_t rowsBT_orig,\n  uint64_t lhsBlock, uint64_t rhsBlock\n  ) {\n  const uint64_t Atile = 2, DepthTile = 1, BTtile = 2;\n  assert(rowsBT % rhsBlock == 0);\n  assert(rowsA % lhsBlock == 0);\n  assert(lhsBlock % Atile == 0);\n  assert(rhsBlock % BTtile == 0);\n\n  for(uint64_t bBT = 0; bBT < rowsBT; bBT += rhsBlock) {\n    for(uint64_t bA = 0; bA < rowsA; bA += lhsBlock) {\n      gemmBinary_generic_chunk_tile2x1x2(\n        A, BT, CT, alpha, rowsA, depth_words, rowsBT, bA, bBT,\n        lhsBlock, rhsBlock, rowsA_orig, rowsBT_orig\n      );\n    }\n  }\n}\n\n\/* Bit-serial GEMM via a series of calls to gemmBinary.\n   Note that rhs must be given in transposed form, and the result is also\n   produced transposed.\n*\/\n\nvoid gemmBitSerial_generic_usingBinary(GEMMContext ctx) {\n  \/\/ ensure that matrix shapes are compatible\n  assert(ctx.lhs.ncols == ctx.rhs.ncols);\n  const uint64_t lhsbits = ctx.lhs.nbits;\n  const uint64_t rhsbits = ctx.rhs.nbits;\n  \/\/ clear contents of result matrix by setting everything to zero\n  memset(ctx.res, 0, ctx.lhs.nrows*ctx.rhs.nrows*sizeof(int32_t));\n  \/\/ call binary GEMM for each bit position\n  for(uint64_t lbit = 0; lbit < lhsbits; lbit++) {\n    bool neg_lhs = ctx.lhs.issigned && (lbit == lhsbits-1);\n    for(uint64_t rbit = 0; rbit < rhsbits; rbit++) {\n      bool neg_rhs = ctx.rhs.issigned && (rbit == rhsbits-1);\n      bool neg = neg_rhs ^ neg_lhs;\n      int32_t alpha = neg ? -(1 << (lbit+rbit)) : (1 << (lbit+rbit));\n      gemmBinary_generic_L1_tile2x1x2(\n        ctx.lhs.bitplaneptr(lbit), ctx.rhs.bitplaneptr(rbit), ctx.res, alpha,\n        ctx.lhs.nrows_a, ctx.lhs.wordsPerRow(), ctx.rhs.nrows_a,\n        ctx.lhs.nrows, ctx.rhs.nrows, ctx.lhsBlock, ctx.rhsBlock\n      );\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"OpenAddressingHash.hpp\"\n\n#include \"Logging.hpp\"\n\n#include <boost\/functional\/hash.hpp>\n\nnamespace tell {\nnamespace store {\n\nnamespace {\n\nvoid* const  gDeletedPtr = reinterpret_cast<void*>(0x1u);\nvoid* const gInvalidPtr = reinterpret_cast<void*>(0x2u);\n\n\/**\n * @brief Check the wellformedness of tableId and keyId\n *\/\nvoid checkDataKey(uint64_t table, uint64_t key) {\n    LOG_ASSERT(table != 0x0u, \"Table ID must not be 0\");\n    LOG_ASSERT(key != 0x0u, \"Key ID must not be 0\");\n}\n\n\/**\n * @brief Check the wellformedness of data pointers\n *\/\nvoid checkDataPtr(const void* ptr) {\n    LOG_ASSERT(ptr != nullptr, \"Data pointer not allowed to be null\");\n    LOG_ASSERT(ptr != gDeletedPtr, \"The two LSBs have to be zero\");\n    LOG_ASSERT(ptr != gInvalidPtr, \"The two LSBs have to be zero\");\n}\n\n} \/\/ anonymous namespace\n\nOpenAddressingTable::OpenAddressingTable(size_t capacity)\n        : mCapacity(capacity),\n          mBuckets(new Entry[mCapacity]),\n          mTableHash(mCapacity),\n          mKeyHash(mCapacity) {\n}\n\nOpenAddressingTable::~OpenAddressingTable() {\n    delete[] mBuckets;\n}\n\nconst void* OpenAddressingTable::get(uint64_t table, uint64_t key) const {\n    checkDataKey(table, key);\n\n    return execOnElement(table, key, static_cast<const void*>(nullptr), [] (const Entry& \/* entry *\/, const void* ptr) {\n        return ptr;\n    });\n}\n\nbool OpenAddressingTable::insert(uint64_t table, uint64_t key, void* data) {\n    checkDataKey(table, key);\n    checkDataPtr(data);\n\n    auto hash = calculateHash(table, key);\n    for (auto pos = hash;; ++pos) {\n        auto& entry = mBuckets[pos % mCapacity];\n        auto ptr = entry.ptr.load();\n\n        \/\/ Check if pointer is invalid\n        if (ptr == gInvalidPtr) {\n            continue;\n        }\n\n        \/\/ Check if pointer denotes a valid element\n        if (ptr != nullptr && ptr != gDeletedPtr) {\n            \/\/ Check if bucket belongs to another element, skip bucket if it does\n            if (entry.tableId.load() != table || entry.keyId.load() != key) {\n                continue;\n            }\n\n            \/\/ Entry exists\n            return false;\n        }\n\n        \/\/ Try to claim this bucket by setting the table\n        \/\/ If this fails somebody else claimed the bucket in the mean time\n        uint64_t t = 0x0u;\n        if (!entry.tableId.compare_exchange_strong(t, table)) {\n            continue;\n        }\n        entry.keyId.store(key);\n\n        \/\/ Check if another concurrent insert conflicts with ours\n        \/\/ If this fails somebody else is inserting the same key, set pointer to invalid and free bucket\n        if (hasInsertConflict(hash, pos, table, key)) {\n            entry.ptr.store(gInvalidPtr);\n            deleteEntry(entry);\n            return false;\n        }\n\n        \/\/ Try to set the pointer from null or deleted to our data pointer\n        \/\/ If this fails somebody else set us to invalid, so we have to free bucket\n        if (!entry.ptr.compare_exchange_strong(ptr, data)) {\n            deleteEntry(entry);\n            return false;\n        }\n\n        return true;\n    }\n}\n\nbool OpenAddressingTable::update(uint64_t table, uint64_t key, const void* oldData, void* newData) {\n    checkDataKey(table, key);\n    checkDataPtr(oldData);\n    checkDataPtr(newData);\n\n    return execOnElement(table, key, false, [oldData, newData] (Entry& entry, const void* \/* ptr *\/) {\n        \/\/ Set the element pointer from old to new\n        auto expected = oldData;\n        return entry.ptr.compare_exchange_strong(expected, newData);\n    });\n}\n\nbool OpenAddressingTable::erase(uint64_t table, uint64_t key, const void* oldData) {\n    checkDataKey(table, key);\n    checkDataPtr(oldData);\n\n    return execOnElement(table, key, true, [oldData] (Entry& entry, const void* \/* ptr *\/) {\n        \/\/ Try to set the pointer to invalid\n        \/\/ If this fails then somebody else modified the element\n        auto expected = oldData;\n        if (!entry.ptr.compare_exchange_strong(expected, gInvalidPtr)) {\n            return false;\n        }\n        deleteEntry(entry);\n\n        return true;\n    });\n}\n\nvoid OpenAddressingTable::deleteEntry(Entry& entry) {\n    entry.tableId.store(0x0u);\n    entry.keyId.store(0x0u);\n    entry.ptr.store(gDeletedPtr);\n}\n\nuint64_t OpenAddressingTable::calculateHash(uint64_t table, uint64_t key) const {\n    auto hash = mTableHash(table);\n    boost::hash_combine(hash, mKeyHash(key));\n    return hash;\n}\n\nbool OpenAddressingTable::hasInsertConflict(size_t hash, size_t insertPos, uint64_t table, uint64_t key) {\n    for (auto pos = hash;; ++pos) {\n        \/\/ Skip our own entry\n        if (pos == insertPos) {\n            continue;\n        }\n\n        auto& entry = mBuckets[pos % mCapacity];\n        auto ptr = entry.ptr.load();\n\n        \/\/ Check if pointer is invalid, skip bucket if it is\n        if (ptr == gInvalidPtr) {\n            continue;\n        }\n\n        auto t = entry.tableId.load();\n\n        \/\/ Check if we reached the end of the overflow bucket and nobody is writing to this bucket\n        if (ptr == nullptr && t == 0x0u) {\n            LOG_ASSERT(pos > insertPos, \"Reached end of overflow before reaching insert element\");\n            return false;\n        }\n\n        \/\/ Check if bucket belongs to another element, skip bucket if it does\n        if (t != table || entry.keyId.load() != key) {\n            continue;\n        }\n\n        \/\/ Check if the pointer is already set (not null without marker)\n        \/\/ In this case we have to abort the insert, because another thread already completed the insert\n        if ((reinterpret_cast<uintptr_t>(ptr) >> 2) != 0x0u) {\n            return true;\n        }\n\n        \/\/ At this point there is a concurrent insert conflict but both threads did not yet complete the insert\n        \/\/ We conflict if the element of the other thread is located in a bucket before our own insert bucket\n        if (pos < insertPos) {\n            return true;\n        }\n\n        \/\/ The element is located in a bucket after our own insert bucket so we try to set the other pointer to invalid\n        \/\/ If this fails then the other thread completed its insert operation in the meantime and we have to abort\n        if (!entry.ptr.compare_exchange_strong(ptr, gInvalidPtr)) {\n            if (ptr != gInvalidPtr) {\n                return true;\n            }\n        }\n    }\n}\n\ntemplate <typename T, typename F>\nT OpenAddressingTable::execOnElement(uint64_t table, uint64_t key, T notFound, F fun) const {\n    for (auto pos = calculateHash(table, key);; ++pos) {\n        auto& entry = mBuckets[pos % mCapacity];\n        auto ptr = entry.ptr.load();\n\n        \/\/ Check if pointer is invalid or deleted, skip bucket if it is\n        if ((reinterpret_cast<uintptr_t>(ptr) & (0x2u | 0x1u)) != 0) {\n            continue;\n        }\n\n        auto t = entry.tableId.load();\n\n        \/\/ Check if we reached the end of the overflow bucket\n        if (ptr == nullptr) {\n            \/\/ Check if somebody else is currently writing to this bucket, skip bucket if this is the case\n            if (t != 0x0u) {\n                continue;\n            }\n\n            \/\/ End of overflow bucket, element not found\n            return notFound;\n        }\n\n        \/\/ Check if bucket belongs to another element, skip bucket if it does\n        if (t != table || entry.keyId.load() != key) {\n            continue;\n        }\n\n        \/\/ Element found\n        return fun(entry, ptr);\n    }\n}\n\ntemplate <typename T, typename F>\nT OpenAddressingTable::execOnElement(uint64_t table, uint64_t key, T notFound, F fun) {\n    return const_cast<const OpenAddressingTable*>(this)->execOnElement(table, key, notFound,\n            [&fun] (const Entry& entry, const void* ptr) {\n        return fun(const_cast<Entry&>(entry), ptr);\n    });\n}\n\n} \/\/ namespace store\n} \/\/ namespace tell\n<commit_msg>Remove restriction that key has to be 0<commit_after>#include \"OpenAddressingHash.hpp\"\n\n#include \"Logging.hpp\"\n\n#include <boost\/functional\/hash.hpp>\n\nnamespace tell {\nnamespace store {\n\nnamespace {\n\nvoid* const  gDeletedPtr = reinterpret_cast<void*>(0x1u);\nvoid* const gInvalidPtr = reinterpret_cast<void*>(0x2u);\n\n\/**\n * @brief Check the wellformedness of tableId and key\n *\/\nvoid checkDataKey(uint64_t table, uint64_t \/* key *\/) {\n    LOG_ASSERT(table != 0x0u, \"Table ID must not be 0\");\n}\n\n\/**\n * @brief Check the wellformedness of data pointers\n *\/\nvoid checkDataPtr(const void* ptr) {\n    LOG_ASSERT(ptr != nullptr, \"Data pointer not allowed to be null\");\n    LOG_ASSERT(ptr != gDeletedPtr, \"The two LSBs have to be zero\");\n    LOG_ASSERT(ptr != gInvalidPtr, \"The two LSBs have to be zero\");\n}\n\n} \/\/ anonymous namespace\n\nOpenAddressingTable::OpenAddressingTable(size_t capacity)\n        : mCapacity(capacity),\n          mBuckets(new Entry[mCapacity]),\n          mTableHash(mCapacity),\n          mKeyHash(mCapacity) {\n}\n\nOpenAddressingTable::~OpenAddressingTable() {\n    delete[] mBuckets;\n}\n\nconst void* OpenAddressingTable::get(uint64_t table, uint64_t key) const {\n    checkDataKey(table, key);\n\n    return execOnElement(table, key, static_cast<const void*>(nullptr), [] (const Entry& \/* entry *\/, const void* ptr) {\n        return ptr;\n    });\n}\n\nbool OpenAddressingTable::insert(uint64_t table, uint64_t key, void* data) {\n    checkDataKey(table, key);\n    checkDataPtr(data);\n\n    auto hash = calculateHash(table, key);\n    for (auto pos = hash;; ++pos) {\n        auto& entry = mBuckets[pos % mCapacity];\n        auto ptr = entry.ptr.load();\n\n        \/\/ Check if pointer is invalid\n        if (ptr == gInvalidPtr) {\n            continue;\n        }\n\n        \/\/ Check if pointer denotes a valid element\n        if (ptr != nullptr && ptr != gDeletedPtr) {\n            \/\/ Check if bucket belongs to another element, skip bucket if it does\n            if (entry.tableId.load() != table || entry.keyId.load() != key) {\n                continue;\n            }\n\n            \/\/ Entry exists\n            return false;\n        }\n\n        \/\/ Try to claim this bucket by setting the table\n        \/\/ If this fails somebody else claimed the bucket in the mean time\n        uint64_t t = 0x0u;\n        if (!entry.tableId.compare_exchange_strong(t, table)) {\n            continue;\n        }\n        entry.keyId.store(key);\n\n        \/\/ Check if another concurrent insert conflicts with ours\n        \/\/ If this fails somebody else is inserting the same key, set pointer to invalid and free bucket\n        if (hasInsertConflict(hash, pos, table, key)) {\n            entry.ptr.store(gInvalidPtr);\n            deleteEntry(entry);\n            return false;\n        }\n\n        \/\/ Try to set the pointer from null or deleted to our data pointer\n        \/\/ If this fails somebody else set us to invalid, so we have to free bucket\n        if (!entry.ptr.compare_exchange_strong(ptr, data)) {\n            deleteEntry(entry);\n            return false;\n        }\n\n        return true;\n    }\n}\n\nbool OpenAddressingTable::update(uint64_t table, uint64_t key, const void* oldData, void* newData) {\n    checkDataKey(table, key);\n    checkDataPtr(oldData);\n    checkDataPtr(newData);\n\n    return execOnElement(table, key, false, [oldData, newData] (Entry& entry, const void* \/* ptr *\/) {\n        \/\/ Set the element pointer from old to new\n        auto expected = oldData;\n        return entry.ptr.compare_exchange_strong(expected, newData);\n    });\n}\n\nbool OpenAddressingTable::erase(uint64_t table, uint64_t key, const void* oldData) {\n    checkDataKey(table, key);\n    checkDataPtr(oldData);\n\n    return execOnElement(table, key, true, [oldData] (Entry& entry, const void* \/* ptr *\/) {\n        \/\/ Try to set the pointer to invalid\n        \/\/ If this fails then somebody else modified the element\n        auto expected = oldData;\n        if (!entry.ptr.compare_exchange_strong(expected, gInvalidPtr)) {\n            return false;\n        }\n        deleteEntry(entry);\n\n        return true;\n    });\n}\n\nvoid OpenAddressingTable::deleteEntry(Entry& entry) {\n    entry.tableId.store(0x0u);\n    entry.keyId.store(0x0u);\n    entry.ptr.store(gDeletedPtr);\n}\n\nuint64_t OpenAddressingTable::calculateHash(uint64_t table, uint64_t key) const {\n    auto hash = mTableHash(table);\n    boost::hash_combine(hash, mKeyHash(key));\n    return hash;\n}\n\nbool OpenAddressingTable::hasInsertConflict(size_t hash, size_t insertPos, uint64_t table, uint64_t key) {\n    for (auto pos = hash;; ++pos) {\n        \/\/ Skip our own entry\n        if (pos == insertPos) {\n            continue;\n        }\n\n        auto& entry = mBuckets[pos % mCapacity];\n        auto ptr = entry.ptr.load();\n\n        \/\/ Check if pointer is invalid, skip bucket if it is\n        if (ptr == gInvalidPtr) {\n            continue;\n        }\n\n        auto t = entry.tableId.load();\n\n        \/\/ Check if we reached the end of the overflow bucket and nobody is writing to this bucket\n        if (ptr == nullptr && t == 0x0u) {\n            LOG_ASSERT(pos > insertPos, \"Reached end of overflow before reaching insert element\");\n            return false;\n        }\n\n        \/\/ Check if bucket belongs to another element, skip bucket if it does\n        if (t != table || entry.keyId.load() != key) {\n            continue;\n        }\n\n        \/\/ Check if the pointer is already set (not null without marker)\n        \/\/ In this case we have to abort the insert, because another thread already completed the insert\n        if ((reinterpret_cast<uintptr_t>(ptr) >> 2) != 0x0u) {\n            return true;\n        }\n\n        \/\/ At this point there is a concurrent insert conflict but both threads did not yet complete the insert\n        \/\/ We conflict if the element of the other thread is located in a bucket before our own insert bucket\n        if (pos < insertPos) {\n            return true;\n        }\n\n        \/\/ The element is located in a bucket after our own insert bucket so we try to set the other pointer to invalid\n        \/\/ If this fails then the other thread completed its insert operation in the meantime and we have to abort\n        if (!entry.ptr.compare_exchange_strong(ptr, gInvalidPtr)) {\n            if (ptr != gInvalidPtr) {\n                return true;\n            }\n        }\n    }\n}\n\ntemplate <typename T, typename F>\nT OpenAddressingTable::execOnElement(uint64_t table, uint64_t key, T notFound, F fun) const {\n    for (auto pos = calculateHash(table, key);; ++pos) {\n        auto& entry = mBuckets[pos % mCapacity];\n        auto ptr = entry.ptr.load();\n\n        \/\/ Check if pointer is invalid or deleted, skip bucket if it is\n        if ((reinterpret_cast<uintptr_t>(ptr) & (0x2u | 0x1u)) != 0) {\n            continue;\n        }\n\n        auto t = entry.tableId.load();\n\n        \/\/ Check if we reached the end of the overflow bucket\n        if (ptr == nullptr) {\n            \/\/ Check if somebody else is currently writing to this bucket, skip bucket if this is the case\n            if (t != 0x0u) {\n                continue;\n            }\n\n            \/\/ End of overflow bucket, element not found\n            return notFound;\n        }\n\n        \/\/ Check if bucket belongs to another element, skip bucket if it does\n        if (t != table || entry.keyId.load() != key) {\n            continue;\n        }\n\n        \/\/ Element found\n        return fun(entry, ptr);\n    }\n}\n\ntemplate <typename T, typename F>\nT OpenAddressingTable::execOnElement(uint64_t table, uint64_t key, T notFound, F fun) {\n    return const_cast<const OpenAddressingTable*>(this)->execOnElement(table, key, notFound,\n            [&fun] (const Entry& entry, const void* ptr) {\n        return fun(const_cast<Entry&>(entry), ptr);\n    });\n}\n\n} \/\/ namespace store\n} \/\/ namespace tell\n<|endoftext|>"}
{"text":"<commit_before>#include \"graph_node.h\"\n#include \"graph_edge.h\"\n\nusing namespace v8;\n\nnamespace nodex {\n  \nPersistent<ObjectTemplate> GraphNode::node_template_;\n\nvoid GraphNode::Initialize() {\n  node_template_ = Persistent<ObjectTemplate>::New(ObjectTemplate::New());\n  node_template_->SetInternalFieldCount(1);\n  node_template_->SetAccessor(String::New(\"type\"), GraphNode::GetType);\n  node_template_->SetAccessor(String::New(\"name\"), GraphNode::GetName);\n  node_template_->SetAccessor(String::New(\"id\"), GraphNode::GetId);\n  node_template_->SetAccessor(String::New(\"ptr\"), GraphNode::GetPtr);\n  node_template_->SetAccessor(String::New(\"childrenCount\"), GraphNode::GetChildrenCount);\n  node_template_->SetAccessor(String::New(\"retainersCount\"), GraphNode::GetRetainersCount);\n  node_template_->SetAccessor(String::New(\"size\"), GraphNode::GetSize);\n  node_template_->SetAccessor(String::New(\"dominatorNode\"), GraphNode::GetDominator);\n  node_template_->Set(String::New(\"getChild\"), FunctionTemplate::New(GraphNode::GetChild));\n  node_template_->Set(String::New(\"retainedSize\"), FunctionTemplate::New(GraphNode::GetRetainedSize));\n  node_template_->Set(String::New(\"getRetainer\"), FunctionTemplate::New(GraphNode::GetRetainer));\n}\n\nHandle<Value> GraphNode::GetType(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t type = static_cast<int32_t>(static_cast<HeapGraphNode*>(ptr)->GetType());\n  Local<String> t;\n  switch(type) {\n    case HeapGraphNode::kArray :\n        t = String::New(\"Array\");\n        break;\n    case HeapGraphNode::kString :\n        t = String::New(\"String\");\n        break;\n    case HeapGraphNode::kObject :\n        t = String::New(\"Object\");\n        break;\n    case HeapGraphNode::kCode :\n        t = String::New(\"Code\");\n        break;\n    case HeapGraphNode::kClosure :\n        t = String::New(\"Closure\");\n        break;\n    case HeapGraphNode::kRegExp :\n        t = String::New(\"RegExp\");\n        break;\n    case HeapGraphNode::kHeapNumber :\n        t = String::New(\"HeapNumber\");\n        break;\n    case HeapGraphNode::kNative :\n        t = String::New(\"Native\");\n        break;\n    default:\n        t = String::New(\"Hidden\");\n  }\n  return scope.Close(t);\n}\n\nHandle<Value> GraphNode::GetName(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  Handle<String> title = static_cast<HeapGraphNode*>(ptr)->GetName();\n  return scope.Close(title);\n}\n\nHandle<Value> GraphNode::GetId(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  uint64_t id = static_cast<HeapGraphNode*>(ptr)->GetId();\n  return scope.Close(Integer::NewFromUnsigned(id));\n}\n\nHandle<Value> GraphNode::GetPtr(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  uint64_t id = reinterpret_cast<uint64_t>(ptr);\n  return scope.Close(Integer::NewFromUnsigned(id));\n}\n\nHandle<Value> GraphNode::GetChildrenCount(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t count = static_cast<HeapGraphNode*>(ptr)->GetChildrenCount();\n  return scope.Close(Integer::New(count));\n}\n\nHandle<Value> GraphNode::GetRetainersCount(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t count = static_cast<HeapGraphNode*>(ptr)->GetRetainersCount();\n  return scope.Close(Integer::New(count));\n}\n\nHandle<Value> GraphNode::GetSize(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t count = static_cast<HeapGraphNode*>(ptr)->GetSelfSize();\n  return scope.Close(Integer::New(count));\n}\n\nHandle<Value> GraphNode::GetChild(const Arguments& args) {\n  HandleScope scope;\n  if (args.Length() < 1) {\n    return ThrowException(Exception::Error(String::New(\"No index specified\")));\n  } else if (!args[0]->IsInt32()) {\n    return ThrowException(Exception::Error(String::New(\"Argument must be integer\")));\n  }\n  int32_t index = args[0]->Int32Value();\n  Handle<Object> self = args.This();\n  void* ptr = self->GetPointerFromInternalField(0);\n  const HeapGraphEdge* edge = static_cast<HeapGraphNode*>(ptr)->GetChild(index);\n  return scope.Close(GraphEdge::New(edge));\n}\n\nHandle<Value> GraphNode::GetRetainedSize(const Arguments& args) {\n  HandleScope scope;\n  Handle<Object> self = args.This();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t size = static_cast<HeapGraphNode*>(ptr)->GetRetainedSize();\n  return scope.Close(Integer::New(size));\n}\n\nHandle<Value> GraphNode::GetRetainer(const Arguments& args) {\n  HandleScope scope;\n  if (args.Length() < 1) {\n    return ThrowException(Exception::Error(String::New(\"No index specified\")));\n  } else if (!args[0]->IsInt32()) {\n    return ThrowException(Exception::Error(String::New(\"Argument must be integer\")));\n  }\n  int32_t index = args[0]->Int32Value();\n  Handle<Object> self = args.This();\n  void* ptr = self->GetPointerFromInternalField(0);\n  const HeapGraphEdge* edge = static_cast<HeapGraphNode*>(ptr)->GetRetainer(index);\n  return scope.Close(GraphEdge::New(edge));\n}\n\nHandle<Value> GraphNode::GetDominator(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  const HeapGraphNode* node = static_cast<HeapGraphNode*>(ptr)->GetDominatorNode();\n  return scope.Close(GraphNode::New(node));\n}\n\nHandle<Value> GraphNode::New(const HeapGraphNode* node) {\n  HandleScope scope;\n  \n  if (node_template_.IsEmpty()) {\n    GraphNode::Initialize();\n  }\n  \n  if(!node) {\n    return Undefined();\n  }\n  else {\n    Local<Object> obj = node_template_->NewInstance();\n    obj->SetPointerInInternalField(0, const_cast<HeapGraphNode*>(node));\n    return scope.Close(obj);\n  }\n}\n}\n<commit_msg>Fixes compilation for node 0.6.x<commit_after>#include \"graph_node.h\"\n#include \"graph_edge.h\"\n#include \"node_version.h\"\n\nusing namespace v8;\n\nnamespace nodex {\n  \nPersistent<ObjectTemplate> GraphNode::node_template_;\n\nvoid GraphNode::Initialize() {\n  node_template_ = Persistent<ObjectTemplate>::New(ObjectTemplate::New());\n  node_template_->SetInternalFieldCount(1);\n  node_template_->SetAccessor(String::New(\"type\"), GraphNode::GetType);\n  node_template_->SetAccessor(String::New(\"name\"), GraphNode::GetName);\n  node_template_->SetAccessor(String::New(\"id\"), GraphNode::GetId);\n  node_template_->SetAccessor(String::New(\"ptr\"), GraphNode::GetPtr);\n  node_template_->SetAccessor(String::New(\"childrenCount\"), GraphNode::GetChildrenCount);\n  node_template_->SetAccessor(String::New(\"retainersCount\"), GraphNode::GetRetainersCount);\n  node_template_->SetAccessor(String::New(\"size\"), GraphNode::GetSize);\n  node_template_->SetAccessor(String::New(\"dominatorNode\"), GraphNode::GetDominator);\n  node_template_->Set(String::New(\"getChild\"), FunctionTemplate::New(GraphNode::GetChild));\n  node_template_->Set(String::New(\"retainedSize\"), FunctionTemplate::New(GraphNode::GetRetainedSize));\n  node_template_->Set(String::New(\"getRetainer\"), FunctionTemplate::New(GraphNode::GetRetainer));\n}\n\nHandle<Value> GraphNode::GetType(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t type = static_cast<int32_t>(static_cast<HeapGraphNode*>(ptr)->GetType());\n  Local<String> t;\n  switch(type) {\n    case HeapGraphNode::kArray :\n        t = String::New(\"Array\");\n        break;\n    case HeapGraphNode::kString :\n        t = String::New(\"String\");\n        break;\n    case HeapGraphNode::kObject :\n        t = String::New(\"Object\");\n        break;\n    case HeapGraphNode::kCode :\n        t = String::New(\"Code\");\n        break;\n    case HeapGraphNode::kClosure :\n        t = String::New(\"Closure\");\n        break;\n    case HeapGraphNode::kRegExp :\n        t = String::New(\"RegExp\");\n        break;\n    case HeapGraphNode::kHeapNumber :\n        t = String::New(\"HeapNumber\");\n        break;\n    case HeapGraphNode::kNative :\n        t = String::New(\"Native\");\n        break;\n    default:\n        t = String::New(\"Hidden\");\n  }\n  return scope.Close(t);\n}\n\nHandle<Value> GraphNode::GetName(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  Handle<String> title = static_cast<HeapGraphNode*>(ptr)->GetName();\n  return scope.Close(title);\n}\n\nHandle<Value> GraphNode::GetId(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  uint64_t id = static_cast<HeapGraphNode*>(ptr)->GetId();\n  return scope.Close(Integer::NewFromUnsigned(id));\n}\n\nHandle<Value> GraphNode::GetPtr(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  uint64_t id = reinterpret_cast<uint64_t>(ptr);\n  return scope.Close(Integer::NewFromUnsigned(id));\n}\n\nHandle<Value> GraphNode::GetChildrenCount(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t count = static_cast<HeapGraphNode*>(ptr)->GetChildrenCount();\n  return scope.Close(Integer::New(count));\n}\n\nHandle<Value> GraphNode::GetRetainersCount(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t count = static_cast<HeapGraphNode*>(ptr)->GetRetainersCount();\n  return scope.Close(Integer::New(count));\n}\n\nHandle<Value> GraphNode::GetSize(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  int32_t count = static_cast<HeapGraphNode*>(ptr)->GetSelfSize();\n  return scope.Close(Integer::New(count));\n}\n\nHandle<Value> GraphNode::GetChild(const Arguments& args) {\n  HandleScope scope;\n  if (args.Length() < 1) {\n    return ThrowException(Exception::Error(String::New(\"No index specified\")));\n  } else if (!args[0]->IsInt32()) {\n    return ThrowException(Exception::Error(String::New(\"Argument must be integer\")));\n  }\n  int32_t index = args[0]->Int32Value();\n  Handle<Object> self = args.This();\n  void* ptr = self->GetPointerFromInternalField(0);\n  const HeapGraphEdge* edge = static_cast<HeapGraphNode*>(ptr)->GetChild(index);\n  return scope.Close(GraphEdge::New(edge));\n}\n\nHandle<Value> GraphNode::GetRetainedSize(const Arguments& args) {\n  HandleScope scope;\n\n  Handle<Object> self = args.This();\n  void* ptr = self->GetPointerFromInternalField(0);\n  \n#if NODE_VERSION_AT_LEAST(0, 7, 0)\n  int32_t size = static_cast<HeapGraphNode*>(ptr)->GetRetainedSize();\n#else\n  bool exact = false;\n  if (args.Length() > 0) {\n    exact = args[0]->BooleanValue();\n  }\n  int32_t size = static_cast<HeapGraphNode*>(ptr)->GetRetainedSize(exact); \n#endif\n  \n  return scope.Close(Integer::New(size));\n}\n\nHandle<Value> GraphNode::GetRetainer(const Arguments& args) {\n  HandleScope scope;\n  if (args.Length() < 1) {\n    return ThrowException(Exception::Error(String::New(\"No index specified\")));\n  } else if (!args[0]->IsInt32()) {\n    return ThrowException(Exception::Error(String::New(\"Argument must be integer\")));\n  }\n  int32_t index = args[0]->Int32Value();\n  Handle<Object> self = args.This();\n  void* ptr = self->GetPointerFromInternalField(0);\n  const HeapGraphEdge* edge = static_cast<HeapGraphNode*>(ptr)->GetRetainer(index);\n  return scope.Close(GraphEdge::New(edge));\n}\n\nHandle<Value> GraphNode::GetDominator(Local<String> property, const AccessorInfo& info) {\n  HandleScope scope;\n  Local<Object> self = info.Holder();\n  void* ptr = self->GetPointerFromInternalField(0);\n  const HeapGraphNode* node = static_cast<HeapGraphNode*>(ptr)->GetDominatorNode();\n  return scope.Close(GraphNode::New(node));\n}\n\nHandle<Value> GraphNode::New(const HeapGraphNode* node) {\n  HandleScope scope;\n  \n  if (node_template_.IsEmpty()) {\n    GraphNode::Initialize();\n  }\n  \n  if(!node) {\n    return Undefined();\n  }\n  else {\n    Local<Object> obj = node_template_->NewInstance();\n    obj->SetPointerInInternalField(0, const_cast<HeapGraphNode*>(node));\n    return scope.Close(obj);\n  }\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 offa\n\/\/ Copyright 2011 Ciaran McHale.\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#include \"RecipeFileParser.h\"\n#include <memory>\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <locale.h>\n\nstatic void parseCmdLineArgs(int argc, char** argv, const char*& recipeFilename, const char*& scope);\nstatic void usage();\n\nint main(int argc, char** argv)\n{\n    auto parser = std::make_unique<RecipeFileParser>();\n    const char* recipeFilename;\n    const char* scope;\n    StringVector recipeScopes;\n    StringVector steps;\n    StringVector ingredients;\n\n    setlocale(LC_ALL, \"\");\n    parseCmdLineArgs(argc, argv, recipeFilename, scope);\n\n    \/\/--------\n    \/\/ Parse and error-check a file containing recipes.\n    \/\/--------\n    try\n    {\n        parser->parse(recipeFilename, scope);\n    }\n    catch (const RecipeFileParserException& ex)\n    {\n        std::cerr << ex.what() << std::endl;\n        return 1;\n    }\n\n    \/\/--------\n    \/\/ Print information about the recipes.\n    \/\/--------\n    parser->listRecipeScopes(recipeScopes);\n    const std::size_t len = recipeScopes.size();\n    std::cout << \"There are \" << len << \" recipes\\n\";\n\n    for ( std::size_t i = 0; i < len; ++i )\n    {\n        const char* name = parser->getRecipeName(recipeScopes[i].c_str());\n        parser->getRecipeIngredients(recipeScopes[i].c_str(), ingredients);\n        parser->getRecipeSteps(recipeScopes[i].c_str(), steps);\n        std::cout << \"\\nRecipe \\\"\" << name << \"\\\":\\n\";\n        const std::size_t ingredientsLen = ingredients.size();\n        std::cout << \"\\tThis recipe has \" << ingredientsLen << \" ingredients:\\n\";\n\n        for (std::size_t i2 = 0; i2 < ingredientsLen; ++i2)\n        {\n            std::cout << \"\\t\\t\\\"\" << ingredients[i2].c_str() << \"\\\"\\n\";\n        }\n\n        const std::size_t stepsLen = steps.size();\n        std::cout << \"\\tThis recipe has \" << stepsLen << \" steps:\\n\";\n\n        for (std::size_t i2 = 0; i2 < stepsLen; ++i2)\n        {\n            std::cout << \"\\t\\t\\\"\" << steps[i2].c_str() << \"%s\\\"\\n\";\n        }\n    }\n\n    return 0;\n}\n\nstatic void parseCmdLineArgs(int argc, char** argv, const char*& recipeFilename, const char*& scope)\n{\n    int i;\n\n    recipeFilename = \"\";\n    scope = \"\";\n\n    for (i = 1; i < argc; i++)\n    {\n        if (strcmp(argv[i], \"-h\") == 0)\n        {\n            usage();\n        }\n        else if (strcmp(argv[i], \"-recipes\") == 0)\n        {\n            if (i == argc - 1)\n            {\n                usage();\n            }\n            recipeFilename = argv[i + 1];\n            i++;\n        }\n        else if (strcmp(argv[i], \"-scope\") == 0)\n        {\n            if (i == argc - 1)\n            {\n                usage();\n            }\n            scope = argv[i + 1];\n            i++;\n        }\n        else\n        {\n            fprintf(stderr, \"Unrecognised option '%s'\\n\\n\", argv[i]);\n            usage();\n        }\n    }\n    if (strcmp(recipeFilename, \"\") == 0)\n    {\n        usage();\n    }\n}\n\nstatic void usage()\n{\n    std::cerr << \"\\n\"\n        << \"usage: demo <options> -recipes <source>\\n\"\n        << \"\\n\"\n        << \"The <options> can be:\\n\"\n        << \"  -h                Print this usage statement\\n\"\n        << \"  -scope            scope within recipes file\\n\"\n        << \"A <source> can be one of the following:\\n\"\n        << \"  file.cfg          A file\\n\"\n        << \"  file#file.cfg     A file\\n\"\n        << \"  exec#<command>    Output from executing the specified command\\n\\n\";\n    exit(1);\n}\n<commit_msg>Demo refactored.<commit_after>\/\/ Copyright (c) 2017 offa\n\/\/ Copyright 2011 Ciaran McHale.\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#include \"RecipeFileParser.h\"\n#include <memory>\n#include <iostream>\n#include <tuple>\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <locale.h>\n\nstatic std::tuple<std::string, std::string> parseCmdLineArgs(int argc, char** argv);\nstatic void usage();\n\nint main(int argc, char** argv)\n{\n    auto parser = std::make_unique<RecipeFileParser>();\n    StringVector recipeScopes;\n    StringVector steps;\n    StringVector ingredients;\n\n    setlocale(LC_ALL, \"\");\n    std::string recipeFilename;\n    std::string scope;\n    std::tie(recipeFilename, scope) = parseCmdLineArgs(argc, argv);\n\n    \/\/--------\n    \/\/ Parse and error-check a file containing recipes.\n    \/\/--------\n    try\n    {\n        parser->parse(recipeFilename.c_str(), scope.c_str());\n    }\n    catch (const RecipeFileParserException& ex)\n    {\n        std::cerr << ex.what() << std::endl;\n        return 1;\n    }\n\n    \/\/--------\n    \/\/ Print information about the recipes.\n    \/\/--------\n    parser->listRecipeScopes(recipeScopes);\n    const std::size_t len = recipeScopes.size();\n    std::cout << \"There are \" << len << \" recipes\\n\";\n\n    for ( std::size_t i = 0; i < len; ++i )\n    {\n        const char* name = parser->getRecipeName(recipeScopes[i].c_str());\n        parser->getRecipeIngredients(recipeScopes[i].c_str(), ingredients);\n        parser->getRecipeSteps(recipeScopes[i].c_str(), steps);\n        std::cout << \"\\nRecipe \\\"\" << name << \"\\\":\\n\";\n        const std::size_t ingredientsLen = ingredients.size();\n        std::cout << \"\\tThis recipe has \" << ingredientsLen << \" ingredients:\\n\";\n\n        for (std::size_t i2 = 0; i2 < ingredientsLen; ++i2)\n        {\n            std::cout << \"\\t\\t\\\"\" << ingredients[i2].c_str() << \"\\\"\\n\";\n        }\n\n        const std::size_t stepsLen = steps.size();\n        std::cout << \"\\tThis recipe has \" << stepsLen << \" steps:\\n\";\n\n        for (std::size_t i2 = 0; i2 < stepsLen; ++i2)\n        {\n            std::cout << \"\\t\\t\\\"\" << steps[i2].c_str() << \"%s\\\"\\n\";\n        }\n    }\n\n    return 0;\n}\n\nstatic std::tuple<std::string, std::string> parseCmdLineArgs(int argc, char** argv)\n{\n    int i;\n\n    std::string recipeFilename = \"\";\n    std::string scope = \"\";\n\n    for (i = 1; i < argc; i++)\n    {\n        if (strcmp(argv[i], \"-h\") == 0)\n        {\n            usage();\n        }\n        else if (strcmp(argv[i], \"-recipes\") == 0)\n        {\n            if (i == argc - 1)\n            {\n                usage();\n            }\n            recipeFilename = argv[i + 1];\n            i++;\n        }\n        else if (strcmp(argv[i], \"-scope\") == 0)\n        {\n            if (i == argc - 1)\n            {\n                usage();\n            }\n            scope = argv[i + 1];\n            i++;\n        }\n        else\n        {\n            fprintf(stderr, \"Unrecognised option '%s'\\n\\n\", argv[i]);\n            usage();\n        }\n    }\n\n    if (recipeFilename.empty() == true )\n    {\n        usage();\n    }\n\n    return std::make_tuple(recipeFilename, scope);\n}\n\nstatic void usage()\n{\n    std::cerr << \"\\n\"\n        << \"usage: demo <options> -recipes <source>\\n\"\n        << \"\\n\"\n        << \"The <options> can be:\\n\"\n        << \"  -h                Print this usage statement\\n\"\n        << \"  -scope            scope within recipes file\\n\"\n        << \"A <source> can be one of the following:\\n\"\n        << \"  file.cfg          A file\\n\"\n        << \"  file#file.cfg     A file\\n\"\n        << \"  exec#<command>    Output from executing the specified command\\n\\n\";\n    exit(1);\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 (directui@nokia.com)\n**\n** This file is part of mcompositor.\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\/*!\n  \\class MCompositeWindowShaderEffect\n  \\brief MCompositeWindowShaderEffect is the base class for shader effects on windows\n  \n  Shader effects can change the appearance of composited windows by hooking\n  into the rendering pipeline of the compositor. It allows manipulation\n  of how a composited window is rendered by using custom GLSL fragment shaders\n  and direct access to the texture rendering function.  \n  An effect can be disabled by calling setEnabled(false). If effects are \n  disabled, the window texture is rendered directly.\n  \n  To add special effects to composited windows, subclass MCompositeWindowShaderEffect \n  and reimplement the pure virtual function drawTexture()\n*\/\n\n#include \"mtexturepixmapitem.h\"\n#include \"mcompositewindowshadereffect.h\"\n#include \"mtexturepixmapitem_p.h\"\n#include <QByteArray>\n\nstatic const char default_frag[] = \"\\\n    lowp vec4 customShader(lowp sampler2D imageTexture, highp vec2 textureCoords) { \\\n        return texture2D(imageTexture, textureCoords); \\\n    }\\n\";\n\nMCompositeWindowShaderEffectPrivate::MCompositeWindowShaderEffectPrivate(MCompositeWindowShaderEffect* e)\n    :effect(e),\n     priv_render(0),\n     active_fragment(0)\n{\n}\n\nvoid MCompositeWindowShaderEffectPrivate::drawTexture(MTexturePixmapPrivate* render, const QTransform &transform, const QRectF &drawRect, qreal opacity)\n{\n    priv_render = render;\n    effect->drawTexture(transform, drawRect, opacity);\n    enabled = false;\n}\n\n\/*!\n * Creates a window effect object\n *\/\nMCompositeWindowShaderEffect::MCompositeWindowShaderEffect(QObject* parent)\n    :QObject(parent),\n     d(new MCompositeWindowShaderEffectPrivate(this))\n{    \n    \/\/ install default pixel shader\n    QByteArray code = default_frag;\n    d->active_fragment = installShaderFragment(code);\n}\n\n\/*!\n  Destroys the graphics effect and deletes GLSL fragment programs from\n  the compositor's rendering engine if any are installed from this effect\n*\/\nMCompositeWindowShaderEffect::~MCompositeWindowShaderEffect()\n{\n}\n\n\/*!\n  Adds and installs the source code for a pixel shader fragment to \\a code.\n  \n  The \\a code must define a GLSL function with the signature\n  \\c{lowp vec4 customShader(lowp sampler2D imageTexture, highp vec2 textureCoords)}\n  that returns the source pixel value to use in the paint engine's\n  shader program.  The following is the default pixel shader fragment,\n  which draws a texture with no effect applied:\n  \n  \\code\n  lowp vec4 customShader(lowp sampler2D imageTexture, highp vec2 textureCoords)\n  {\n      return texture2D(imageTexture, textureCoords);\n  }\n  \\endcode\n  \n  \\return The id of the fragment shader. If the fragment shader is invalid,\n  return 0.\n  \n  \\sa setUniforms()\n*\/   \nGLuint MCompositeWindowShaderEffect::installShaderFragment(const QByteArray& code)\n{\n    GLuint id = MTexturePixmapPrivate::installPixelShader(code);\n    d->pixfrag_ids.push_back(id);\n    return id;\n}\n\n \/*!\n   \\return Texture id of the currently rendered window\n *\/\nGLuint MCompositeWindowShaderEffect::texture() const\n{\n    \/\/ TODO: This assumes we have always have hadware TFP support \n    if (d->priv_render)\n        return d->priv_render->textureId;\n    return 0;\n}\n\nconst QVector<GLuint>& MCompositeWindowShaderEffect::fragmentIds() const\n{\n    return d->pixfrag_ids;\n}\n\n\/*!\n  Sets the rendering pipeline to use shader fragment specified by \\a id \n*\/\nvoid MCompositeWindowShaderEffect::setActiveShaderFragment(GLuint id)\n{\n    d->active_fragment = id;\n}\n\n\/*!\n  \\return The id of the currently active shader fragment\n*\/\nGLuint MCompositeWindowShaderEffect::activeShaderFragment() const\n{\n    return d->active_fragment;\n}\n\n\/*!\n  \\fn void MCompositeWindowShaderEffect::enabledChanged( bool enabled);\n  Emmitted if this effect gets disabled or enabled\n*\/\n\n\/*!\n  \\fn virtual void MCompositeWindowShaderEffect::drawTexture(const QTransform &transform, const QRectF &drawRect, qreal opacity) = 0;\n\n  This pure virtual function is called whenever the windows texture is\n  rendered. Reimplement it to completely customize how the texture of this\n  window is rendered using the given transformation \n  matrix \\a transform, texture geometry \\a drawRect, and \\a opacity.\n*\/\n\n\/*!\n  Draws currently bound source window texture. Specify a transformation matrix to\n  \\a transform and texture geometry to \\a drawRect. Opacity can be set\n  by specifying \\a opacity (0.0 - 1.0). \n  This function should only be called inside drawTexture()      \n*\/\nvoid MCompositeWindowShaderEffect::drawSource(const QTransform &transform, \n                                              const QRectF &drawRect, \n                                              qreal opacity)\n{\n    if (d->priv_render)\n        d->priv_render->q_drawTexture(transform, drawRect, opacity);\n}\n\n\/*!\n  Install this effect on a composite window object \\a window. Note that\n  we override QGraphicsItem::setGraphicsEffect() because\n  we have a completely different painting engine.\n  If a window has a previous effect, it will be overriden by the new one\n*\/\nvoid MCompositeWindowShaderEffect::installEffect(MCompositeWindow* window)\n{\n    \/\/ only happens with GL. sorry n800 guys :p\n#ifdef QT_OPENGL_LIB\n    MTexturePixmapItem* item = (MTexturePixmapItem*) window;\n    item->d->installEffect(this);    \n#endif\n}\n\n\/*!\n  \\return Whether this effect is enabled or not\n*\/\nbool MCompositeWindowShaderEffect::enabled() const\n{\n    return d->enabled;\n}\n\n\/*!\n  Enable or disable this effect \n*\/\nvoid MCompositeWindowShaderEffect::setEnabled(bool enabled)\n{\n    d->enabled = enabled;\n    emit enabledChanged(enabled);\n}\n\n\/*!\n  Set the uniform values on the currently active shader \\a program.\n  Default implementation does nothing. Reimplement this function to\n  set values if you specified a custom pixel shader in your effects.\n*\/\nvoid MCompositeWindowShaderEffect::setUniforms(QGLShaderProgram* program)\n{\n    Q_UNUSED(program);\n}\n\n<commit_msg>Changes: Fix crash on fake object tests RevBy: TrustMe<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 mcompositor.\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\/*!\n  \\class MCompositeWindowShaderEffect\n  \\brief MCompositeWindowShaderEffect is the base class for shader effects on windows\n  \n  Shader effects can change the appearance of composited windows by hooking\n  into the rendering pipeline of the compositor. It allows manipulation\n  of how a composited window is rendered by using custom GLSL fragment shaders\n  and direct access to the texture rendering function.  \n  An effect can be disabled by calling setEnabled(false). If effects are \n  disabled, the window texture is rendered directly.\n  \n  To add special effects to composited windows, subclass MCompositeWindowShaderEffect \n  and reimplement the pure virtual function drawTexture()\n*\/\n\n#include \"mtexturepixmapitem.h\"\n#include \"mcompositewindowshadereffect.h\"\n#include \"mtexturepixmapitem_p.h\"\n#include <QByteArray>\n\nstatic const char default_frag[] = \"\\\n    lowp vec4 customShader(lowp sampler2D imageTexture, highp vec2 textureCoords) { \\\n        return texture2D(imageTexture, textureCoords); \\\n    }\\n\";\n\nMCompositeWindowShaderEffectPrivate::MCompositeWindowShaderEffectPrivate(MCompositeWindowShaderEffect* e)\n    :effect(e),\n     priv_render(0),\n     active_fragment(0)\n{\n}\n\nvoid MCompositeWindowShaderEffectPrivate::drawTexture(MTexturePixmapPrivate* render, const QTransform &transform, const QRectF &drawRect, qreal opacity)\n{\n    priv_render = render;\n    effect->drawTexture(transform, drawRect, opacity);\n    enabled = false;\n}\n\n\/*!\n * Creates a window effect object\n *\/\nMCompositeWindowShaderEffect::MCompositeWindowShaderEffect(QObject* parent)\n    :QObject(parent),\n     d(new MCompositeWindowShaderEffectPrivate(this))\n{    \n    \/\/ install default pixel shader\n    QByteArray code = default_frag;\n    d->active_fragment = installShaderFragment(code);\n}\n\n\/*!\n  Destroys the graphics effect and deletes GLSL fragment programs from\n  the compositor's rendering engine if any are installed from this effect\n*\/\nMCompositeWindowShaderEffect::~MCompositeWindowShaderEffect()\n{\n}\n\n\/*!\n  Adds and installs the source code for a pixel shader fragment to \\a code.\n  \n  The \\a code must define a GLSL function with the signature\n  \\c{lowp vec4 customShader(lowp sampler2D imageTexture, highp vec2 textureCoords)}\n  that returns the source pixel value to use in the paint engine's\n  shader program.  The following is the default pixel shader fragment,\n  which draws a texture with no effect applied:\n  \n  \\code\n  lowp vec4 customShader(lowp sampler2D imageTexture, highp vec2 textureCoords)\n  {\n      return texture2D(imageTexture, textureCoords);\n  }\n  \\endcode\n  \n  \\return The id of the fragment shader. If the fragment shader is invalid,\n  return 0.\n  \n  \\sa setUniforms()\n*\/   \nGLuint MCompositeWindowShaderEffect::installShaderFragment(const QByteArray& code)\n{\n    GLuint id = MTexturePixmapPrivate::installPixelShader(code);\n    d->pixfrag_ids.push_back(id);\n    return id;\n}\n\n \/*!\n   \\return Texture id of the currently rendered window\n *\/\nGLuint MCompositeWindowShaderEffect::texture() const\n{\n    \/\/ TODO: This assumes we have always have hadware TFP support \n    if (d->priv_render)\n        return d->priv_render->textureId;\n    return 0;\n}\n\nconst QVector<GLuint>& MCompositeWindowShaderEffect::fragmentIds() const\n{\n    return d->pixfrag_ids;\n}\n\n\/*!\n  Sets the rendering pipeline to use shader fragment specified by \\a id \n*\/\nvoid MCompositeWindowShaderEffect::setActiveShaderFragment(GLuint id)\n{\n    d->active_fragment = id;\n}\n\n\/*!\n  \\return The id of the currently active shader fragment\n*\/\nGLuint MCompositeWindowShaderEffect::activeShaderFragment() const\n{\n    return d->active_fragment;\n}\n\n\/*!\n  \\fn void MCompositeWindowShaderEffect::enabledChanged( bool enabled);\n  Emmitted if this effect gets disabled or enabled\n*\/\n\n\/*!\n  \\fn virtual void MCompositeWindowShaderEffect::drawTexture(const QTransform &transform, const QRectF &drawRect, qreal opacity) = 0;\n\n  This pure virtual function is called whenever the windows texture is\n  rendered. Reimplement it to completely customize how the texture of this\n  window is rendered using the given transformation \n  matrix \\a transform, texture geometry \\a drawRect, and \\a opacity.\n*\/\n\n\/*!\n  Draws currently bound source window texture. Specify a transformation matrix to\n  \\a transform and texture geometry to \\a drawRect. Opacity can be set\n  by specifying \\a opacity (0.0 - 1.0). \n  This function should only be called inside drawTexture()      \n*\/\nvoid MCompositeWindowShaderEffect::drawSource(const QTransform &transform, \n                                              const QRectF &drawRect, \n                                              qreal opacity)\n{\n    if (d->priv_render)\n        d->priv_render->q_drawTexture(transform, drawRect, opacity);\n}\n\n\/*!\n  Install this effect on a composite window object \\a window. Note that\n  we override QGraphicsItem::setGraphicsEffect() because\n  we have a completely different painting engine.\n  If a window has a previous effect, it will be overriden by the new one\n*\/\nvoid MCompositeWindowShaderEffect::installEffect(MCompositeWindow* window)\n{\n    if (!window->isValid())\n        return;\n\n    \/\/ only happens with GL. sorry n800 guys :p\n#ifdef QT_OPENGL_LIB\n    MTexturePixmapItem* item = (MTexturePixmapItem*) window;\n    item->d->installEffect(this);    \n#endif\n}\n\n\/*!\n  \\return Whether this effect is enabled or not\n*\/\nbool MCompositeWindowShaderEffect::enabled() const\n{\n    return d->enabled;\n}\n\n\/*!\n  Enable or disable this effect \n*\/\nvoid MCompositeWindowShaderEffect::setEnabled(bool enabled)\n{\n    d->enabled = enabled;\n    emit enabledChanged(enabled);\n}\n\n\/*!\n  Set the uniform values on the currently active shader \\a program.\n  Default implementation does nothing. Reimplement this function to\n  set values if you specified a custom pixel shader in your effects.\n*\/\nvoid MCompositeWindowShaderEffect::setUniforms(QGLShaderProgram* program)\n{\n    Q_UNUSED(program);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <nan.h>\n#include <node.h>\n#include <stdio.h>\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include \"argon2\/src\/argon2.h\"\n\nnamespace {\n\nconst auto ENCODED_LEN = 108u;\nconst auto HASH_LEN = 32u;\nconst auto SALT_LEN = 16u;\n\nclass EncryptAsyncWorker : public Nan::AsyncWorker {\npublic:\n    EncryptAsyncWorker(Nan::Callback* callback,\n        const std::string& plain, const std::string& salt);\n\n    void Execute();\n\n    void HandleOKCallback();\n\nprivate:\n    std::string plain;\n    std::string salt;\n    std::string error;\n    std::string output;\n};\n\nEncryptAsyncWorker::EncryptAsyncWorker(Nan::Callback* callback,\n    const std::string& plain, const std::string& salt) :\n    Nan::AsyncWorker(callback), plain{plain},\n    salt{salt}, error{}, output{}\n{\n    if (salt.size() < SALT_LEN) {\n        this->salt.resize(SALT_LEN, 0x0);\n    }\n}\n\nvoid EncryptAsyncWorker::Execute()\n{\n    char encoded[ENCODED_LEN];\n\n    auto result = argon2i_hash_encoded(3, 4096, 1, plain.c_str(), plain.size(),\n        salt.c_str(), salt.size(), HASH_LEN, encoded, ENCODED_LEN);\n    if (result != ARGON2_OK) {\n        return;\n    }\n\n    output = std::string{encoded};\n}\n\nvoid EncryptAsyncWorker::HandleOKCallback()\n{\n    using v8::Local;\n    using v8::Value;\n\n    Nan::HandleScope scope;\n\n    Local <Value> argv[2];\n    argv[0] = Nan::Undefined();\n    argv[1] = Nan::Encode(output.c_str(), output.size(), Nan::BINARY);\n\n    callback->Call(2, argv);\n}\n\nNAN_METHOD(Encrypt) {\n    using v8::Function;\n    using v8::Local;\n\n    Nan::HandleScope scope;\n\n    if (info.Length() < 3) {\n        Nan::ThrowTypeError(\"3 arguments expected\");\n        return;\n    }\n\n    Nan::Utf8String plain{info[0]->ToString()};\n    Nan::Utf8String salt{info[1]->ToString()};\n    Local<Function> callback = Local<Function>::Cast(info[2]);\n\n    auto worker = new EncryptAsyncWorker(new Nan::Callback(callback), *plain, *salt);\n\n    Nan::AsyncQueueWorker(worker);\n}\n\nclass VerifyAsyncWorker : public Nan::AsyncWorker {\npublic:\n    VerifyAsyncWorker(Nan::Callback* callback,\n        const std::string& encrypted, const std::string& plain);\n\n    void Execute();\n\nprivate:\n    std::string encrypted;\n    std::string plain;\n    std::string error;\n    bool output;\n};\n\nVerifyAsyncWorker::VerifyAsyncWorker(Nan::Callback* callback,\n    const std::string& encrypted, const std::string& plain) :\n    Nan::AsyncWorker(callback), encrypted{encrypted}, plain{plain},\n    error{}, output{}\n{ }\n\nvoid VerifyAsyncWorker::Execute()\n{\n    auto result = argon2i_verify(encrypted.c_str(), plain.c_str(),\n        plain.size());\n\n    if (result != ARGON2_OK) {\n        SetErrorMessage(\"The password did not match.\");\n    }\n}\n\nNAN_METHOD(Verify) {\n    using v8::Function;\n    using v8::Local;\n\n    Nan::HandleScope scope;\n\n    if (info.Length() < 3) {\n        Nan::ThrowTypeError(\"3 arguments expected\");\n        return;\n    }\n\n    Nan::Utf8String encrypted{ info[0]->ToString() };\n    Nan::Utf8String plain{ info[1]->ToString() };\n    Local<Function> callback = Local<Function>::Cast(info[2]);\n\n    auto worker = new VerifyAsyncWorker(new Nan::Callback(callback),\n    *encrypted, *plain);\n\n    Nan::AsyncQueueWorker(worker);\n}\n\n}\n\nNAN_MODULE_INIT(init) {\n    Nan::Export(target, \"encrypt\", Encrypt);\n    Nan::Export(target, \"verify\", Verify);\n};\n\nNODE_MODULE(argon2_lib, init);\n<commit_msg>Fix includes<commit_after>#include <nan.h>\n#include <node.h>\n\n#include <cstring>\n#include <string>\n\n#include \"argon2\/src\/argon2.h\"\n\nnamespace {\n\nconst auto ENCODED_LEN = 108u;\nconst auto HASH_LEN = 32u;\nconst auto SALT_LEN = 16u;\n\nclass EncryptAsyncWorker : public Nan::AsyncWorker {\npublic:\n    EncryptAsyncWorker(Nan::Callback* callback,\n        const std::string& plain, const std::string& salt);\n\n    void Execute();\n\n    void HandleOKCallback();\n\nprivate:\n    std::string plain;\n    std::string salt;\n    std::string error;\n    std::string output;\n};\n\nEncryptAsyncWorker::EncryptAsyncWorker(Nan::Callback* callback,\n    const std::string& plain, const std::string& salt) :\n    Nan::AsyncWorker(callback), plain{plain},\n    salt{salt}, error{}, output{}\n{\n    if (salt.size() < SALT_LEN) {\n        this->salt.resize(SALT_LEN, 0x0);\n    }\n}\n\nvoid EncryptAsyncWorker::Execute()\n{\n    char encoded[ENCODED_LEN];\n\n    auto result = argon2i_hash_encoded(3, 4096, 1, plain.c_str(), plain.size(),\n        salt.c_str(), salt.size(), HASH_LEN, encoded, ENCODED_LEN);\n    if (result != ARGON2_OK) {\n        return;\n    }\n\n    output = std::string{encoded};\n}\n\nvoid EncryptAsyncWorker::HandleOKCallback()\n{\n    using v8::Local;\n    using v8::Value;\n\n    Nan::HandleScope scope;\n\n    Local <Value> argv[2];\n    argv[0] = Nan::Undefined();\n    argv[1] = Nan::Encode(output.c_str(), output.size(), Nan::BINARY);\n\n    callback->Call(2, argv);\n}\n\nNAN_METHOD(Encrypt) {\n    using v8::Function;\n    using v8::Local;\n\n    Nan::HandleScope scope;\n\n    if (info.Length() < 3) {\n        Nan::ThrowTypeError(\"3 arguments expected\");\n        return;\n    }\n\n    Nan::Utf8String plain{info[0]->ToString()};\n    Nan::Utf8String salt{info[1]->ToString()};\n    Local<Function> callback = Local<Function>::Cast(info[2]);\n\n    auto worker = new EncryptAsyncWorker(new Nan::Callback(callback), *plain, *salt);\n\n    Nan::AsyncQueueWorker(worker);\n}\n\nclass VerifyAsyncWorker : public Nan::AsyncWorker {\npublic:\n    VerifyAsyncWorker(Nan::Callback* callback,\n        const std::string& encrypted, const std::string& plain);\n\n    void Execute();\n\nprivate:\n    std::string encrypted;\n    std::string plain;\n    std::string error;\n    bool output;\n};\n\nVerifyAsyncWorker::VerifyAsyncWorker(Nan::Callback* callback,\n    const std::string& encrypted, const std::string& plain) :\n    Nan::AsyncWorker(callback), encrypted{encrypted}, plain{plain},\n    error{}, output{}\n{ }\n\nvoid VerifyAsyncWorker::Execute()\n{\n    auto result = argon2i_verify(encrypted.c_str(), plain.c_str(),\n        plain.size());\n\n    if (result != ARGON2_OK) {\n        SetErrorMessage(\"The password did not match.\");\n    }\n}\n\nNAN_METHOD(Verify) {\n    using v8::Function;\n    using v8::Local;\n\n    Nan::HandleScope scope;\n\n    if (info.Length() < 3) {\n        Nan::ThrowTypeError(\"3 arguments expected\");\n        return;\n    }\n\n    Nan::Utf8String encrypted{ info[0]->ToString() };\n    Nan::Utf8String plain{ info[1]->ToString() };\n    Local<Function> callback = Local<Function>::Cast(info[2]);\n\n    auto worker = new VerifyAsyncWorker(new Nan::Callback(callback),\n    *encrypted, *plain);\n\n    Nan::AsyncQueueWorker(worker);\n}\n\n}\n\nNAN_MODULE_INIT(init) {\n    Nan::Export(target, \"encrypt\", Encrypt);\n    Nan::Export(target, \"verify\", Verify);\n};\n\nNODE_MODULE(argon2_lib, init);\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ $Id$\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/  Copyright (C) 2001  MandrakeSoft S.A.\r\n\/\/\r\n\/\/    MandrakeSoft S.A.\r\n\/\/    43, rue d'Aboukir\r\n\/\/    75002 Paris - France\r\n\/\/    http:\/\/www.linux-mandrake.com\/\r\n\/\/    http:\/\/www.mandrakesoft.com\/\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 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#include \"bochs.h\"\r\n\r\n#if !((BX_HAVE_HASH_MAP || BX_HAVE_HASH_MAP_H) && (BX_HAVE_SET || BX_HAVE_SET_H))\r\n\r\nstatic char *BX_HAVE_HASH_MAP_ERR = \"context not implemented because BX_HAVE_HASH_MAP=0\\n\";\r\n\r\nchar* bx_dbg_symbolic_address(Bit32u context, Bit32u eip, Bit32u base)\r\n{\r\n  static bx_bool first = true;\r\n  if (first) {\r\n    dbg_printf ( BX_HAVE_HASH_MAP_ERR);\r\n    first = false;\r\n  }\r\n  return \"unk. ctxt\";\r\n}\r\n\r\nchar* bx_dbg_symbolic_address_16bit(Bit32u eip, Bit32u cs)\r\n{\r\n  \/\/ just prints an error anyway\r\n  return bx_dbg_symbolic_address (0,0,0);\r\n}\r\n\r\nvoid bx_dbg_symbol_command(char* filename, bx_bool global, Bit32u offset)\r\n{\r\n  dbg_printf ( BX_HAVE_HASH_MAP_ERR);\r\n}\r\n\r\nvoid bx_dbg_info_symbols_command(char *Symbol)\r\n{\r\n  dbg_printf ( BX_HAVE_HASH_MAP_ERR);\r\n}\r\n\r\nint bx_dbg_lbreakpoint_symbol_command(char *Symbol)\r\n{\r\n  dbg_printf ( BX_HAVE_HASH_MAP_ERR);\r\n  return -1;\r\n}\r\n\r\nBit32u bx_dbg_get_symbol_value(char *Symbol)\r\n{\r\n  return 0;\r\n}\r\n\r\nchar* bx_dbg_disasm_symbolic_address(Bit32u eip, Bit32u base)\r\n{\r\n  return 0;\r\n}\r\n\r\n#else   \/* if BX_HAVE_HASH_MAP == 1 *\/\r\n\r\n\/* Haven't figured out how to port this code to OSF1 cxx compiler.\r\n   Until a more portable solution is found, at least make it easy\r\n   to disable the template code:  just set BX_HAVE_HASH_MAP=0\r\n   in config.h *\/\r\n#if BX_HAVE_HASH_MAP\r\n#include <hash_map>\r\n#elif BX_HAVE_HASH_MAP_H\r\n#include <hash_map.h>\r\n#endif\r\n\r\n#if BX_HAVE_SET\r\n#include <set>\r\n#elif BX_HAVE_SET_H\r\n#include <set.h>\r\n#endif\r\n\r\nusing namespace std;\r\n\r\nstruct symbol_entry_t\r\n{\r\n  symbol_entry_t (Bit32u _start = 0, char* _name = 0)\r\n  {\r\n    start = _start;\r\n    name = _name;\r\n  }\r\n\r\n  char* name;\r\n  Bit32u start;\r\n};\r\n\r\nstruct lt_symbol_entry_t\r\n{\r\n  bool operator()(const symbol_entry_t* s1, const symbol_entry_t* s2) const\r\n  {\r\n    return s1->start < s2->start;\r\n  }\r\n};\r\n\r\nstruct lt_rsymbol_entry_t\r\n{\r\n  bool operator()(const symbol_entry_t* s1, const symbol_entry_t* s2) const\r\n  {\r\n    return strcoll(s1->name, s2->name) < 0;\r\n  }\r\n};\r\n\r\nstruct context_t\r\n{\r\n  context_t (Bit32u);\r\n  ~context_t();\r\n  static context_t* get_context(Bit32u);\r\n  symbol_entry_t* get_symbol_entry(Bit32u);\r\n  symbol_entry_t* get_symbol_entry(const char *Symbol) const;\r\n  void add_symbol(symbol_entry_t*);\r\n  const set<symbol_entry_t*,lt_symbol_entry_t>* get_all_symbols() const {return syms;}\r\n  const set<symbol_entry_t*,lt_rsymbol_entry_t>* get_all_rsymbols() const {return rsyms;}\r\nprivate:\r\n  static hash_map<int,context_t*>* map;\r\n  \/\/ Forvard references (find name by address)\r\n  set<symbol_entry_t*,lt_symbol_entry_t>* syms;\r\n  \/\/ Reverse references (find address by name)\r\n  set<symbol_entry_t*,lt_rsymbol_entry_t>* rsyms;\r\n  Bit32u id;\r\n};\r\n\r\nhash_map<int,context_t*>* context_t::map = new hash_map<int,context_t*>;\r\n\r\ncontext_t::context_t (Bit32u _id)\r\n{\r\n  id = _id;\r\n  syms = new set<symbol_entry_t*, lt_symbol_entry_t>;\r\n  rsyms = new set<symbol_entry_t*, lt_rsymbol_entry_t>;\r\n  (*map)[id] = this;\r\n}\r\n\r\ncontext_t::~context_t()\r\n{\r\n set<symbol_entry_t*>::iterator iter;\r\n if(syms) {\r\n  for(iter=syms->begin();iter!=syms->end();++iter)\r\n   if(*iter)\r\n    delete *iter;\r\n }\r\n\r\n if(rsyms) {\r\n  for(iter=rsyms->begin();iter!=rsyms->end();++iter)\r\n   if(*iter)\r\n    delete *iter;\r\n }\r\n}\r\n\r\ncontext_t* context_t::get_context(Bit32u i)\r\n{\r\n  return (*map)[i];\r\n}\r\n\r\nsymbol_entry_t* context_t::get_symbol_entry(Bit32u ip)\r\n{\r\n  symbol_entry_t probe;\r\n  probe.start = ip;\r\n  \/\/ find the first symbol whose address is greater than ip.\r\n  if (syms->empty ()) return 0;\r\n  set<symbol_entry_t*>::iterator iter = syms->upper_bound(&probe);\r\n\r\n  if (iter == syms->end()) { \/\/ No symbol found\r\n    return 0;\r\n  }\r\n\r\n  return *(--iter);\r\n}\r\n\r\nsymbol_entry_t* context_t::get_symbol_entry(const char *Symbol) const\r\n{\r\n  symbol_entry_t probe;\r\n  probe.name=(char *)Symbol;\r\n\r\n  if (rsyms->empty ()) \r\n   return 0;\r\n\r\n  set<symbol_entry_t*>::const_iterator iter;\r\n  iter=rsyms->find(&probe);\r\n  if(iter==rsyms->end()) \/\/ No symbol found\r\n   return 0;\r\n  return *iter;\r\n}\r\n\r\nvoid context_t::add_symbol(symbol_entry_t* sym)\r\n{\r\n  syms->insert(sym);\r\n  rsyms->insert(sym);\r\n}\r\n\r\nBit32u bx_dbg_get_symbol_value(char *Symbol)\r\n{\r\n context_t* cntx = context_t::get_context(0);\r\n if(!cntx) \/\/ Context not found\r\n  return 0;\r\n\r\n if (Symbol[0]=='\\\"') Symbol++;\r\n int len = strlen(Symbol);\r\n if (Symbol[len - 1] == '\\\"') Symbol[len - 1] = '\\0';\r\n\r\n symbol_entry_t* sym=cntx->get_symbol_entry(Symbol);\r\n if(!sym) \/\/ Symbol not found\r\n  return 0;\r\n\r\n return sym->start;\r\n}\r\n\r\nchar* bx_dbg_symbolic_address(Bit32u context, Bit32u eip, Bit32u base)\r\n{\r\n  static char buf[80];\r\n#if 0\r\n  \/\/ bbd: I don't see why we shouldn't allow symbol lookups on\r\n  \/\/ segments with a nonzero base.  I need to trace user \r\n  \/\/ processes in Linux, which have a base of 0xc0000000.\r\n  if (base != 0) {\r\n    snprintf (buf, 80, \"non-zero base\");\r\n    return buf;\r\n  }\r\n#endif\r\n  \/\/ Look up this context\r\n  context_t* cntx = context_t::get_context(context);\r\n  if (!cntx) {\r\n    \/\/ Try global context\r\n    cntx = context_t::get_context(0);\r\n    if (!cntx) {\r\n      snprintf (buf, 80, \"unk. ctxt\");\r\n      return buf;\r\n    }\r\n  }\r\n  \/\/ full linear address not only eip (for nonzero based segments)\r\n  symbol_entry_t* entr = cntx->get_symbol_entry(base+eip); \r\n  if (!entr) {\r\n    snprintf (buf, 80, \"no symbol\");\r\n    return buf;\r\n  }\r\n  snprintf (buf, 80, \"%s+%x\", entr->name, (base+eip) - entr->start);\r\n  return buf;\r\n}\r\n\r\nchar* bx_dbg_disasm_symbolic_address(Bit32u eip, Bit32u base)\r\n{\r\n  static char buf[80];\r\n\r\n  \/\/ Try global context\r\n  context_t* cntx = context_t::get_context(0);\r\n  if (!cntx) {\r\n    return 0;\r\n  }\r\n\r\n  \/\/ full linear address not only eip (for nonzero based segments)\r\n  symbol_entry_t* entr = cntx->get_symbol_entry(base+eip); \r\n  if (!entr) {\r\n    return 0;\r\n  }\r\n  snprintf (buf, 80, \"%s+%x\", entr->name, (base+eip) - entr->start);\r\n  return buf;\r\n}\r\n\r\nchar* bx_dbg_symbolic_address_16bit(Bit32u eip, Bit32u cs)\r\n{\r\n  \/\/ in 16-bit code, the segment selector and offset are combined into a\r\n  \/\/ 20-bit linear address = (segment selector<<4) + offset.\r\n  eip &= 0xffff;\r\n  cs &= 0xffff;\r\n  return bx_dbg_symbolic_address (0, eip+(cs<<4), 0);\r\n}\r\n\r\nvoid bx_dbg_symbol_command(char* filename, bx_bool global, Bit32u offset)\r\n{\r\n  if (filename[0] == '\"')\r\n    filename++;\r\n  int len = strlen(filename);\r\n  if (filename[len - 1] == '\"')\r\n    filename[len - 1] = '\\0';\r\n\r\n  \/\/ Install symbols in correct context (page table)\r\n  \/\/ The file format should be\r\n  \/\/ address symbol (example '00002afe _StartLoseNT')\r\n  \r\n  context_t* cntx = (global) ? context_t::get_context(0)\r\n      : context_t::get_context((BX_CPU(dbg_cpu)->cr3) >> 12);\r\n\r\n  if (!cntx) {\r\n    cntx = (global) ? new context_t(0)\r\n       : new context_t((BX_CPU(dbg_cpu)->cr3) >> 12);\r\n  }\r\n\r\n  FILE* fp = fopen(filename, \"rt\"); \/\/ 't' is need for win32, unixes simply ignore it\r\n  if (!fp) {\r\n    dbg_printf (\"Could not open symbol file '%s'\\n\", filename);\r\n    return;\r\n  }\r\n  char buf[200];\r\n  while (fgets(buf, 200, fp)) {\r\n    \/\/ Parse\r\n    char* sym_name = buf;\r\n    \r\n    for (int i = 0; i < 200 && buf[i]; i++) {\r\n      if (buf[i] == ' ') {\r\n        buf[i] = '\\0';\r\n        sym_name = buf + i + 1;\r\n        break;\r\n      }\r\n    }\r\n    if (sym_name == buf) {\r\n      dbg_printf (\"Syntax error '%s'\\n\", buf);\r\n      break;\r\n    }\r\n    Bit32u addr = strtoul(buf, 0, 16);\r\n    if (sym_name[strlen(sym_name)-1] == '\\n')\r\n      sym_name[strlen(sym_name)-1] = '\\0';\r\n    symbol_entry_t* sym = new symbol_entry_t(addr + offset, strdup(sym_name));\r\n    cntx->add_symbol(sym);\r\n  }\r\n}\r\n\r\n\/\/ chack if s1 is prefix of s2\r\nstatic bool bx_dbg_strprefix(const char *s1, const char *s2)\r\n{\r\n  if(!s1 || !s2)\r\n   return false;\r\n\r\n  size_t len=strlen(s1);\r\n\r\n  if(len>strlen(s2))\r\n   return false;\r\n  return strncmp(s1, s2, len)==0;\r\n}\r\n\r\nvoid bx_dbg_info_symbols_command(char *Symbol)\r\n{\r\n  context_t* cntx = context_t::get_context(0);\r\n\r\n  if(!cntx) {\r\n   dbg_printf (\"Global context not available\\n\");\r\n   return;\r\n  }\r\n\r\n  if(Symbol) {\r\n   const set<symbol_entry_t*,lt_rsymbol_entry_t>* rsyms;\r\n\r\n   rsyms=cntx->get_all_rsymbols();\r\n   if (rsyms->empty ()) {\r\n    dbg_printf (\"Symbols not loaded\\n\");\r\n    return;\r\n   }\r\n   \/\/ remove leading and trailing quotas\r\n   if (Symbol[0]=='\\\"') Symbol++;\r\n   int len = strlen(Symbol);\r\n   if (Symbol[len - 1] == '\\\"') Symbol[len - 1] = '\\0';\r\n\r\n   symbol_entry_t probe;\r\n   probe.name=Symbol;\r\n   set<symbol_entry_t*>::const_iterator iter;\r\n   iter=rsyms->lower_bound(&probe);\r\n\r\n   if(iter==rsyms->end() || !bx_dbg_strprefix(Symbol, (*iter)->name))\r\n    dbg_printf (\"No symbols found\\n\");\r\n   else\r\n   for(;iter!=rsyms->end() && bx_dbg_strprefix(Symbol, (*iter)->name);++iter) {\r\n    dbg_printf (\"%08x: %s\\n\", (*iter)->start, (*iter)->name);\r\n   }\r\n  }\r\n  else {\r\n   const set<symbol_entry_t*,lt_symbol_entry_t>* syms;\r\n\r\n   syms=cntx->get_all_symbols();\r\n   if (syms->empty ()) {\r\n    dbg_printf (\"Symbols not loaded\\n\");\r\n    return;\r\n   }\r\n\r\n   set<symbol_entry_t*>::const_iterator iter;\r\n   for(iter = syms->begin();iter!=syms->end();++iter) {\r\n    dbg_printf (\"%08x: %s\\n\", (*iter)->start, (*iter)->name);\r\n   }\r\n  }\r\n}\r\n\r\nint bx_dbg_lbreakpoint_symbol_command(char *Symbol)\r\n{\r\n context_t* cntx = context_t::get_context(0);\r\n if(!cntx) {\r\n  dbg_printf (\"Global context not available\\n\");\r\n  return -1;\r\n }\r\n if (Symbol[0]=='\\\"') Symbol++;\r\n int len = strlen(Symbol);\r\n if (Symbol[len - 1] == '\\\"') Symbol[len - 1] = '\\0';\r\n\r\n const symbol_entry_t* sym=cntx->get_symbol_entry(Symbol);\r\n if(sym)\r\n  return bx_dbg_lbreakpoint_command(bkRegular, sym->start);\r\n dbg_printf (\"Symbol not found\\n\");\r\n return -1;\r\n}\r\n#endif\r\n<commit_msg>dos2unix fix<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id$\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (C) 2001  MandrakeSoft S.A.\n\/\/\n\/\/    MandrakeSoft S.A.\n\/\/    43, rue d'Aboukir\n\/\/    75002 Paris - France\n\/\/    http:\/\/www.linux-mandrake.com\/\n\/\/    http:\/\/www.mandrakesoft.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 Software\n\/\/  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"bochs.h\"\n\n#if !((BX_HAVE_HASH_MAP || BX_HAVE_HASH_MAP_H) && (BX_HAVE_SET || BX_HAVE_SET_H))\n\nstatic char *BX_HAVE_HASH_MAP_ERR = \"context not implemented because BX_HAVE_HASH_MAP=0\\n\";\n\nchar* bx_dbg_symbolic_address(Bit32u context, Bit32u eip, Bit32u base)\n{\n  static bx_bool first = true;\n  if (first) {\n    dbg_printf ( BX_HAVE_HASH_MAP_ERR);\n    first = false;\n  }\n  return \"unk. ctxt\";\n}\n\nchar* bx_dbg_symbolic_address_16bit(Bit32u eip, Bit32u cs)\n{\n  \/\/ just prints an error anyway\n  return bx_dbg_symbolic_address (0,0,0);\n}\n\nvoid bx_dbg_symbol_command(char* filename, bx_bool global, Bit32u offset)\n{\n  dbg_printf ( BX_HAVE_HASH_MAP_ERR);\n}\n\nvoid bx_dbg_info_symbols_command(char *Symbol)\n{\n  dbg_printf ( BX_HAVE_HASH_MAP_ERR);\n}\n\nint bx_dbg_lbreakpoint_symbol_command(char *Symbol)\n{\n  dbg_printf ( BX_HAVE_HASH_MAP_ERR);\n  return -1;\n}\n\nBit32u bx_dbg_get_symbol_value(char *Symbol)\n{\n  return 0;\n}\n\nchar* bx_dbg_disasm_symbolic_address(Bit32u eip, Bit32u base)\n{\n  return 0;\n}\n\n#else   \/* if BX_HAVE_HASH_MAP == 1 *\/\n\n\/* Haven't figured out how to port this code to OSF1 cxx compiler.\n   Until a more portable solution is found, at least make it easy\n   to disable the template code:  just set BX_HAVE_HASH_MAP=0\n   in config.h *\/\n#if BX_HAVE_HASH_MAP\n#include <hash_map>\n#elif BX_HAVE_HASH_MAP_H\n#include <hash_map.h>\n#endif\n\n#if BX_HAVE_SET\n#include <set>\n#elif BX_HAVE_SET_H\n#include <set.h>\n#endif\n\nusing namespace std;\n\nstruct symbol_entry_t\n{\n  symbol_entry_t (Bit32u _start = 0, char* _name = 0)\n  {\n    start = _start;\n    name = _name;\n  }\n\n  char* name;\n  Bit32u start;\n};\n\nstruct lt_symbol_entry_t\n{\n  bool operator()(const symbol_entry_t* s1, const symbol_entry_t* s2) const\n  {\n    return s1->start < s2->start;\n  }\n};\n\nstruct lt_rsymbol_entry_t\n{\n  bool operator()(const symbol_entry_t* s1, const symbol_entry_t* s2) const\n  {\n    return strcoll(s1->name, s2->name) < 0;\n  }\n};\n\nstruct context_t\n{\n  context_t (Bit32u);\n  ~context_t();\n  static context_t* get_context(Bit32u);\n  symbol_entry_t* get_symbol_entry(Bit32u);\n  symbol_entry_t* get_symbol_entry(const char *Symbol) const;\n  void add_symbol(symbol_entry_t*);\n  const set<symbol_entry_t*,lt_symbol_entry_t>* get_all_symbols() const {return syms;}\n  const set<symbol_entry_t*,lt_rsymbol_entry_t>* get_all_rsymbols() const {return rsyms;}\nprivate:\n  static hash_map<int,context_t*>* map;\n  \/\/ Forvard references (find name by address)\n  set<symbol_entry_t*,lt_symbol_entry_t>* syms;\n  \/\/ Reverse references (find address by name)\n  set<symbol_entry_t*,lt_rsymbol_entry_t>* rsyms;\n  Bit32u id;\n};\n\nhash_map<int,context_t*>* context_t::map = new hash_map<int,context_t*>;\n\ncontext_t::context_t (Bit32u _id)\n{\n  id = _id;\n  syms = new set<symbol_entry_t*, lt_symbol_entry_t>;\n  rsyms = new set<symbol_entry_t*, lt_rsymbol_entry_t>;\n  (*map)[id] = this;\n}\n\ncontext_t::~context_t()\n{\n set<symbol_entry_t*>::iterator iter;\n if(syms) {\n  for(iter=syms->begin();iter!=syms->end();++iter)\n   if(*iter)\n    delete *iter;\n }\n\n if(rsyms) {\n  for(iter=rsyms->begin();iter!=rsyms->end();++iter)\n   if(*iter)\n    delete *iter;\n }\n}\n\ncontext_t* context_t::get_context(Bit32u i)\n{\n  return (*map)[i];\n}\n\nsymbol_entry_t* context_t::get_symbol_entry(Bit32u ip)\n{\n  symbol_entry_t probe;\n  probe.start = ip;\n  \/\/ find the first symbol whose address is greater than ip.\n  if (syms->empty ()) return 0;\n  set<symbol_entry_t*>::iterator iter = syms->upper_bound(&probe);\n\n  if (iter == syms->end()) { \/\/ No symbol found\n    return 0;\n  }\n\n  return *(--iter);\n}\n\nsymbol_entry_t* context_t::get_symbol_entry(const char *Symbol) const\n{\n  symbol_entry_t probe;\n  probe.name=(char *)Symbol;\n\n  if (rsyms->empty ()) \n   return 0;\n\n  set<symbol_entry_t*>::const_iterator iter;\n  iter=rsyms->find(&probe);\n  if(iter==rsyms->end()) \/\/ No symbol found\n   return 0;\n  return *iter;\n}\n\nvoid context_t::add_symbol(symbol_entry_t* sym)\n{\n  syms->insert(sym);\n  rsyms->insert(sym);\n}\n\nBit32u bx_dbg_get_symbol_value(char *Symbol)\n{\n context_t* cntx = context_t::get_context(0);\n if(!cntx) \/\/ Context not found\n  return 0;\n\n if (Symbol[0]=='\\\"') Symbol++;\n int len = strlen(Symbol);\n if (Symbol[len - 1] == '\\\"') Symbol[len - 1] = '\\0';\n\n symbol_entry_t* sym=cntx->get_symbol_entry(Symbol);\n if(!sym) \/\/ Symbol not found\n  return 0;\n\n return sym->start;\n}\n\nchar* bx_dbg_symbolic_address(Bit32u context, Bit32u eip, Bit32u base)\n{\n  static char buf[80];\n#if 0\n  \/\/ bbd: I don't see why we shouldn't allow symbol lookups on\n  \/\/ segments with a nonzero base.  I need to trace user \n  \/\/ processes in Linux, which have a base of 0xc0000000.\n  if (base != 0) {\n    snprintf (buf, 80, \"non-zero base\");\n    return buf;\n  }\n#endif\n  \/\/ Look up this context\n  context_t* cntx = context_t::get_context(context);\n  if (!cntx) {\n    \/\/ Try global context\n    cntx = context_t::get_context(0);\n    if (!cntx) {\n      snprintf (buf, 80, \"unk. ctxt\");\n      return buf;\n    }\n  }\n  \/\/ full linear address not only eip (for nonzero based segments)\n  symbol_entry_t* entr = cntx->get_symbol_entry(base+eip); \n  if (!entr) {\n    snprintf (buf, 80, \"no symbol\");\n    return buf;\n  }\n  snprintf (buf, 80, \"%s+%x\", entr->name, (base+eip) - entr->start);\n  return buf;\n}\n\nchar* bx_dbg_disasm_symbolic_address(Bit32u eip, Bit32u base)\n{\n  static char buf[80];\n\n  \/\/ Try global context\n  context_t* cntx = context_t::get_context(0);\n  if (!cntx) {\n    return 0;\n  }\n\n  \/\/ full linear address not only eip (for nonzero based segments)\n  symbol_entry_t* entr = cntx->get_symbol_entry(base+eip); \n  if (!entr) {\n    return 0;\n  }\n  snprintf (buf, 80, \"%s+%x\", entr->name, (base+eip) - entr->start);\n  return buf;\n}\n\nchar* bx_dbg_symbolic_address_16bit(Bit32u eip, Bit32u cs)\n{\n  \/\/ in 16-bit code, the segment selector and offset are combined into a\n  \/\/ 20-bit linear address = (segment selector<<4) + offset.\n  eip &= 0xffff;\n  cs &= 0xffff;\n  return bx_dbg_symbolic_address (0, eip+(cs<<4), 0);\n}\n\nvoid bx_dbg_symbol_command(char* filename, bx_bool global, Bit32u offset)\n{\n  if (filename[0] == '\"')\n    filename++;\n  int len = strlen(filename);\n  if (filename[len - 1] == '\"')\n    filename[len - 1] = '\\0';\n\n  \/\/ Install symbols in correct context (page table)\n  \/\/ The file format should be\n  \/\/ address symbol (example '00002afe _StartLoseNT')\n  \n  context_t* cntx = (global) ? context_t::get_context(0)\n      : context_t::get_context((BX_CPU(dbg_cpu)->cr3) >> 12);\n\n  if (!cntx) {\n    cntx = (global) ? new context_t(0)\n       : new context_t((BX_CPU(dbg_cpu)->cr3) >> 12);\n  }\n\n  FILE* fp = fopen(filename, \"rt\"); \/\/ 't' is need for win32, unixes simply ignore it\n  if (!fp) {\n    dbg_printf (\"Could not open symbol file '%s'\\n\", filename);\n    return;\n  }\n  char buf[200];\n  while (fgets(buf, 200, fp)) {\n    \/\/ Parse\n    char* sym_name = buf;\n    \n    for (int i = 0; i < 200 && buf[i]; i++) {\n      if (buf[i] == ' ') {\n        buf[i] = '\\0';\n        sym_name = buf + i + 1;\n        break;\n      }\n    }\n    if (sym_name == buf) {\n      dbg_printf (\"Syntax error '%s'\\n\", buf);\n      break;\n    }\n    Bit32u addr = strtoul(buf, 0, 16);\n    if (sym_name[strlen(sym_name)-1] == '\\n')\n      sym_name[strlen(sym_name)-1] = '\\0';\n    symbol_entry_t* sym = new symbol_entry_t(addr + offset, strdup(sym_name));\n    cntx->add_symbol(sym);\n  }\n}\n\n\/\/ chack if s1 is prefix of s2\nstatic bool bx_dbg_strprefix(const char *s1, const char *s2)\n{\n  if(!s1 || !s2)\n   return false;\n\n  size_t len=strlen(s1);\n\n  if(len>strlen(s2))\n   return false;\n  return strncmp(s1, s2, len)==0;\n}\n\nvoid bx_dbg_info_symbols_command(char *Symbol)\n{\n  context_t* cntx = context_t::get_context(0);\n\n  if(!cntx) {\n   dbg_printf (\"Global context not available\\n\");\n   return;\n  }\n\n  if(Symbol) {\n   const set<symbol_entry_t*,lt_rsymbol_entry_t>* rsyms;\n\n   rsyms=cntx->get_all_rsymbols();\n   if (rsyms->empty ()) {\n    dbg_printf (\"Symbols not loaded\\n\");\n    return;\n   }\n   \/\/ remove leading and trailing quotas\n   if (Symbol[0]=='\\\"') Symbol++;\n   int len = strlen(Symbol);\n   if (Symbol[len - 1] == '\\\"') Symbol[len - 1] = '\\0';\n\n   symbol_entry_t probe;\n   probe.name=Symbol;\n   set<symbol_entry_t*>::const_iterator iter;\n   iter=rsyms->lower_bound(&probe);\n\n   if(iter==rsyms->end() || !bx_dbg_strprefix(Symbol, (*iter)->name))\n    dbg_printf (\"No symbols found\\n\");\n   else\n   for(;iter!=rsyms->end() && bx_dbg_strprefix(Symbol, (*iter)->name);++iter) {\n    dbg_printf (\"%08x: %s\\n\", (*iter)->start, (*iter)->name);\n   }\n  }\n  else {\n   const set<symbol_entry_t*,lt_symbol_entry_t>* syms;\n\n   syms=cntx->get_all_symbols();\n   if (syms->empty ()) {\n    dbg_printf (\"Symbols not loaded\\n\");\n    return;\n   }\n\n   set<symbol_entry_t*>::const_iterator iter;\n   for(iter = syms->begin();iter!=syms->end();++iter) {\n    dbg_printf (\"%08x: %s\\n\", (*iter)->start, (*iter)->name);\n   }\n  }\n}\n\nint bx_dbg_lbreakpoint_symbol_command(char *Symbol)\n{\n context_t* cntx = context_t::get_context(0);\n if(!cntx) {\n  dbg_printf (\"Global context not available\\n\");\n  return -1;\n }\n if (Symbol[0]=='\\\"') Symbol++;\n int len = strlen(Symbol);\n if (Symbol[len - 1] == '\\\"') Symbol[len - 1] = '\\0';\n\n const symbol_entry_t* sym=cntx->get_symbol_entry(Symbol);\n if(sym)\n  return bx_dbg_lbreakpoint_command(bkRegular, sym->start);\n dbg_printf (\"Symbol not found\\n\");\n return -1;\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/\/ https:\/\/infektor.net\/posts\/2017-03-31-range-based-enumerate.html\n\n#include <iterator>\n#include <utility>\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace _enumerate_internal\n{\n    template <typename Iterator, typename index_type> struct enumerate_iterator\n    {\n        using iterator = Iterator;\n          \/\/using index_type = typename std::iterator_traits<iterator>::difference_type;\n        using reference = typename std::iterator_traits<iterator>::reference;\n\n        enumerate_iterator(index_type aIndex, iterator aIterator) : index(aIndex), iter(aIterator) {}\n        enumerate_iterator& operator++() { ++index; ++iter; return *this; }\n        bool operator!=(const enumerate_iterator &other) const { return iter != other.iter; }\n        std::pair<index_type&, reference> operator*() { return {index, *iter}; }\n\n     private:\n        index_type index;\n        iterator iter;\n    };\n\n      \/\/ ----------------------------------------------------------------------\n\n    template <typename Iterator, typename index_type> struct enumerate_range\n    {\n        \/\/ using index_type = typename std::iterator_traits<Iterator>::difference_type;\n        using iterator = enumerate_iterator<Iterator, index_type>;\n\n        enumerate_range(Iterator aFirst, Iterator aLast, index_type aInitial) : first(aFirst), last(aLast), initial(aInitial) {}\n        iterator begin() const { return iterator(initial, first); }\n        iterator end() const { return iterator(0, last); }\n\n     private:\n        Iterator first;\n        Iterator last;\n        index_type initial;\n    };\n\n} \/\/ namespace _enumerate_internal\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs\n{\n    template <typename Iterator, typename index_type> auto enumerate(Iterator first, Iterator last, index_type initial = 0)\n    {\n        return _enumerate_internal::enumerate_range<Iterator, index_type>(first, last, initial);\n    }\n\n    template <typename Container> auto enumerate(Container& content)\n    {\n        using iter_type = decltype(std::begin(content));\n        return _enumerate_internal::enumerate_range<iter_type, size_t>(std::begin(content), std::end(content), 0U);\n    }\n\n    template <typename Container> auto enumerate(const Container& content)\n    {\n        using iter_type = decltype(std::begin(content));\n        return _enumerate_internal::enumerate_range<iter_type, size_t>(std::begin(content), std::end(content), 0U);\n    }\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>minor enumerate fixes<commit_after>#pragma once\n\n\/\/ https:\/\/infektor.net\/posts\/2017-03-31-range-based-enumerate.html\n\n#include <iterator>\n#include <utility>\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs\n{\n    namespace _enumerate_internal\n    {\n        template <typename Iterator, typename index_type> struct enumerate_iterator\n        {\n            using iterator = Iterator;\n              \/\/using index_type = typename std::iterator_traits<iterator>::difference_type;\n            using reference = typename std::iterator_traits<iterator>::reference;\n\n            inline enumerate_iterator(index_type aIndex, iterator aIterator) : index(aIndex), iter(aIterator) {}\n            inline enumerate_iterator& operator++() { ++index; ++iter; return *this; }\n            inline bool operator!=(const enumerate_iterator &other) const { return iter != other.iter; }\n            inline std::pair<index_type&, reference> operator*() { return {index, *iter}; }\n\n         private:\n            index_type index;\n            iterator iter;\n        };\n\n          \/\/ ----------------------------------------------------------------------\n\n        template <typename Iterator, typename index_type> struct enumerate_range\n        {\n              \/\/ using index_type = typename std::iterator_traits<Iterator>::difference_type;\n            using iterator = enumerate_iterator<Iterator, index_type>;\n\n            inline enumerate_range(Iterator aFirst, Iterator aLast, index_type aInitial) : first(aFirst), last(aLast), initial(aInitial) {}\n            inline iterator begin() const { return iterator(initial, first); }\n            inline iterator end() const { return iterator(0, last); }\n\n         private:\n            Iterator first;\n            Iterator last;\n            index_type initial;\n        };\n\n    } \/\/ namespace _enumerate_internal\n\n\/\/ ----------------------------------------------------------------------\n\n    template <typename Iterator, typename index_type> inline auto enumerate(Iterator first, Iterator last, index_type initial = 0)\n    {\n        return _enumerate_internal::enumerate_range<Iterator, index_type>(first, last, initial);\n    }\n\n    template <typename Container> inline auto enumerate(Container& content)\n    {\n        using iter_type = decltype(std::begin(content));\n        return _enumerate_internal::enumerate_range<iter_type, size_t>(std::begin(content), std::end(content), 0U);\n    }\n\n    template <typename Container> inline auto enumerate(const Container& content)\n    {\n        using iter_type = decltype(std::begin(content));\n        return _enumerate_internal::enumerate_range<iter_type, size_t>(std::begin(content), std::end(content), 0U);\n    }\n\n} \/\/ namespace acmacs\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\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#include \"qmessageid.h\"\n#include <qhash.h>\n#include <messagingutil_p.h>\n\nQTM_BEGIN_NAMESPACE\n\nclass QMessageIdPrivate\n{\npublic:\n    QString _id;\n};\n\nQMessageId::QMessageId()\n : d_ptr(0)\n{\n}\n\nQMessageId::QMessageId(const QMessageId& other)\n : d_ptr(0)\n{\n\tthis->operator=(other);\n}\n\nQMessageId::QMessageId(const QString& id)\n{\n    d_ptr = new QMessageIdPrivate;\n    d_ptr->_id = id;\n}\n\nQMessageId::~QMessageId()\n{\n\tdelete d_ptr;\n}\n\nQMessageId& QMessageId::operator=(const QMessageId& other)\n{\n    if (!other.d_ptr) {\n        delete d_ptr;\n        return *this;\n    }\n\n    if (!d_ptr)\n        d_ptr = new QMessageIdPrivate;\n\n    d_ptr->_id = other.d_ptr->_id;\n\n    return *this;\n}\n\nbool QMessageId::operator==(const QMessageId& other) const\n{\n    if (!other.d_ptr && !d_ptr)\n        return true;\n\n    if (!other.d_ptr || !d_ptr)\n        return false;\n\n    return (d_ptr->_id == other.d_ptr->_id);\n}\n\nbool QMessageId::operator<(const QMessageId& other) const\n{\n    long left = 0;\n    long right = 0;\n    if (d_ptr) {\n        left = SymbianHelpers::stripIdPrefix(d_ptr->_id).toLong();\n        \/\/left = d_ptr->_id.toLong();\n    }\n    if (other.d_ptr) {\n        right = SymbianHelpers::stripIdPrefix(other.d_ptr->_id).toLong();\n        \/\/right = other.d_ptr->_id.toLong();\n    }\n\n    return (left < right);\n}\n\nQString QMessageId::toString() const\n{\n    return d_ptr ? d_ptr->_id : QString();\n}\n\nbool QMessageId::isValid() const\n{\n    return d_ptr ? true : false;\n}\n\nuint qHash(const QMessageId &id)\n{\n    return qHash(id.toString());\n}\n\n\nQTM_END_NAMESPACE\n<commit_msg>Fixed: Assigning an invalid QMessageId causes crash on Symbian<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#include \"qmessageid.h\"\n#include <qhash.h>\n#include <messagingutil_p.h>\n\nQTM_BEGIN_NAMESPACE\n\nclass QMessageIdPrivate\n{\npublic:\n    QString _id;\n};\n\nQMessageId::QMessageId()\n : d_ptr(0)\n{\n}\n\nQMessageId::QMessageId(const QMessageId& other)\n : d_ptr(0)\n{\n\tthis->operator=(other);\n}\n\nQMessageId::QMessageId(const QString& id)\n{\n    d_ptr = new QMessageIdPrivate;\n    d_ptr->_id = id;\n}\n\nQMessageId::~QMessageId()\n{\n\tdelete d_ptr;\n}\n\nQMessageId& QMessageId::operator=(const QMessageId& other)\n{\n    if (!other.d_ptr) {\n        delete d_ptr;\n        d_ptr = 0;\n        return *this;\n    }\n\n    if (!d_ptr)\n        d_ptr = new QMessageIdPrivate;\n\n    d_ptr->_id = other.d_ptr->_id;\n\n    return *this;\n}\n\nbool QMessageId::operator==(const QMessageId& other) const\n{\n    if (!other.d_ptr && !d_ptr)\n        return true;\n\n    if (!other.d_ptr || !d_ptr)\n        return false;\n\n    return (d_ptr->_id == other.d_ptr->_id);\n}\n\nbool QMessageId::operator<(const QMessageId& other) const\n{\n    long left = 0;\n    long right = 0;\n    if (d_ptr) {\n        left = SymbianHelpers::stripIdPrefix(d_ptr->_id).toLong();\n        \/\/left = d_ptr->_id.toLong();\n    }\n    if (other.d_ptr) {\n        right = SymbianHelpers::stripIdPrefix(other.d_ptr->_id).toLong();\n        \/\/right = other.d_ptr->_id.toLong();\n    }\n\n    return (left < right);\n}\n\nQString QMessageId::toString() const\n{\n    return d_ptr ? d_ptr->_id : QString();\n}\n\nbool QMessageId::isValid() const\n{\n    return d_ptr ? true : false;\n}\n\nuint qHash(const QMessageId &id)\n{\n    return qHash(id.toString());\n}\n\n\nQTM_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file tree_traits.hpp\n * @author Ryan Curtin\n *\n * This file implements the basic, unspecialized TreeTraits class, which\n * provides information about tree types.  If you create a tree class, you\n * should specialize this class with the characteristics of your tree.\n *\/\n#ifndef __MLPACK_CORE_TREE_TREE_TRAITS_HPP\n#define __MLPACK_CORE_TREE_TREE_TRAITS_HPP\n\nnamespace mlpack {\nnamespace tree {\n\n\/**\n * The TreeTraits class provides compile-time information on the characteristics\n * of a given tree type.  These include traits such as whether or not a node\n * knows the distance to its parent node, or whether or not the subspaces\n * represented by children can overlap.\n *\n * These traits can be used for static compile-time optimization:\n *\n * @code\n * \/\/ This if statement will be optimized out at compile time!\n * if (TreeTraits<TreeType>::HasOverlappingChildren == false)\n * {\n *   \/\/ Do a simpler computation because no children overlap.\n * }\n * else\n * {\n *   \/\/ Do the full, complex calculation.\n * }\n * @endcode\n *\n * The traits can also be used in conjunction with SFINAE to write specialized\n * versions of functions:\n *\n * @code\n * template<typename TreeType>\n * void Compute(TreeType& node,\n *              boost::enable_if<\n *                  TreeTraits<TreeType>::RearrangesDataset>::type*)\n * {\n *   \/\/ Computation where special dataset-rearranging tree constructor is\n *   \/\/ called.\n * }\n *\n * template<typename TreeType>\n * void Compute(TreeType& node,\n *              boost::enable_if<\n *                  !TreeTraits<TreeType>::RearrangesDataset>::type*)\n * {\n *   \/\/ Computation where normal tree constructor is called.\n * }\n * @endcode\n *\n * In those two examples, the boost::enable_if<> class takes a boolean template\n * parameter which allows that function to be called when the boolean is true.\n *\n * Each trait must be a static const value and not a function; only const values\n * can be used as template parameters (with the exception of constexprs, which\n * are a C++11 feature; but MLPACK is not using C++11).  By default (the\n * unspecialized implementation of TreeTraits), each parameter is set to make as\n * few assumptions about the tree as possible; so, even if TreeTraits is not\n * specialized for a particular tree type, tree-based algorithms should still\n * work.\n *\n * When you write your own tree, you must specialize the TreeTraits class to\n * your tree type and set the corresponding values appropriately.  See\n * mlpack\/core\/tree\/binary_space_tree\/traits.hpp for an example.\n *\/\ntemplate<typename TreeType>\nclass TreeTraits\n{\n public:\n  \/**\n   * This is true if the subspaces represented by the children of a node can\n   * overlap.\n   *\/\n  static const bool HasOverlappingChildren = true;\n\n  \/**\n   * This is true if Point(0) is the centroid of the node.\n   *\/\n  static const bool FirstPointIsCentroid = false;\n\n  \/**\n   * This is true if the points contained in the first child of a node\n   * (Child(0)) are also contained in that node.\n   *\/\n  static const bool HasSelfChildren = false;\n\n  \/**\n   * This is true if the tree rearranges points in the dataset when it is built.\n   *\/\n  static const bool RearrangesDataset = false;\n\n  \/**\n   * This is true if the tree always has only two children.\n   *\/\n  static const bool BinaryTree = false;\n};\n\n}; \/\/ namespace tree\n}; \/\/ namespace mlpack\n\n#endif\n<commit_msg>We use C++11 now; update the comment.<commit_after>\/**\n * @file tree_traits.hpp\n * @author Ryan Curtin\n *\n * This file implements the basic, unspecialized TreeTraits class, which\n * provides information about tree types.  If you create a tree class, you\n * should specialize this class with the characteristics of your tree.\n *\/\n#ifndef __MLPACK_CORE_TREE_TREE_TRAITS_HPP\n#define __MLPACK_CORE_TREE_TREE_TRAITS_HPP\n\nnamespace mlpack {\nnamespace tree {\n\n\/**\n * The TreeTraits class provides compile-time information on the characteristics\n * of a given tree type.  These include traits such as whether or not a node\n * knows the distance to its parent node, or whether or not the subspaces\n * represented by children can overlap.\n *\n * These traits can be used for static compile-time optimization:\n *\n * @code\n * \/\/ This if statement will be optimized out at compile time!\n * if (TreeTraits<TreeType>::HasOverlappingChildren == false)\n * {\n *   \/\/ Do a simpler computation because no children overlap.\n * }\n * else\n * {\n *   \/\/ Do the full, complex calculation.\n * }\n * @endcode\n *\n * The traits can also be used in conjunction with SFINAE to write specialized\n * versions of functions:\n *\n * @code\n * template<typename TreeType>\n * void Compute(TreeType& node,\n *              boost::enable_if<\n *                  TreeTraits<TreeType>::RearrangesDataset>::type*)\n * {\n *   \/\/ Computation where special dataset-rearranging tree constructor is\n *   \/\/ called.\n * }\n *\n * template<typename TreeType>\n * void Compute(TreeType& node,\n *              boost::enable_if<\n *                  !TreeTraits<TreeType>::RearrangesDataset>::type*)\n * {\n *   \/\/ Computation where normal tree constructor is called.\n * }\n * @endcode\n *\n * In those two examples, the boost::enable_if<> class takes a boolean template\n * parameter which allows that function to be called when the boolean is true.\n *\n * Each trait must be a static const value and not a function; only const values\n * can be used as template parameters (or constexprs can be used too).  By\n * default (the unspecialized implementation of TreeTraits), each parameter is\n * set to make as few assumptions about the tree as possible; so, even if\n * TreeTraits is not specialized for a particular tree type, tree-based\n * algorithms should still work.\n *\n * When you write your own tree, you must specialize the TreeTraits class to\n * your tree type and set the corresponding values appropriately.  See\n * mlpack\/core\/tree\/binary_space_tree\/traits.hpp for an example.\n *\/\ntemplate<typename TreeType>\nclass TreeTraits\n{\n public:\n  \/**\n   * This is true if the subspaces represented by the children of a node can\n   * overlap.\n   *\/\n  static const bool HasOverlappingChildren = true;\n\n  \/**\n   * This is true if Point(0) is the centroid of the node.\n   *\/\n  static const bool FirstPointIsCentroid = false;\n\n  \/**\n   * This is true if the points contained in the first child of a node\n   * (Child(0)) are also contained in that node.\n   *\/\n  static const bool HasSelfChildren = false;\n\n  \/**\n   * This is true if the tree rearranges points in the dataset when it is built.\n   *\/\n  static const bool RearrangesDataset = false;\n\n  \/**\n   * This is true if the tree always has only two children.\n   *\/\n  static const bool BinaryTree = false;\n};\n\n}; \/\/ namespace tree\n}; \/\/ namespace mlpack\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/!@Alan\n\/\/!\n\/\/! Exercise 5.14:\n\/\/! Write a program to read strings from standard input looking for duplicated\n\/\/! words. The program should find places in the input where one word is followed immediately\n\/\/! by itself. Keep track of the largest number of times a single repetition occurs and which\n\/\/! word is repeated. Print the maximum number of duplicates, or else print a message saying\n\/\/! that no word was repeated. For example, if the input is\n\/\/  how now now now brown cow cow\n\/\/! the output should indicate that the word now occurred three times.\n\/\/!\n\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main(void)\n{\n    string curr_str, pre_str, re_str;\n    int cnt = 1, max = 1;\n    cin >> pre_str;\n    while (cin >> curr_str)\n    {\n        if (curr_str == pre_str)\n        {\n            ++cnt;\n            if (cnt > max)\n            {\n                max = cnt;\n                re_str = curr_str;\n            }       \n        }\n        else\n        {\n            cnt = 1;\n        }\n        \n        pre_str = curr_str;\n    }\n    if (!re_str.empty())\n    {\n        cout << re_str << \" occurs \" << max << \" times\" << endl;\n    }\n    else\n    {\n        cout << \"no such number\" << endl;\n    }\n    return 0;\n}<commit_msg>Revert \"test\"<commit_after>\/\/!@Alan\n\/\/!\n\/\/! Exercise 5.14:\n\/\/! Write a program to read strings from standard input looking for duplicated\n\/\/! words. The program should find places in the input where one word is followed immediately\n\/\/! by itself. Keep track of the largest number of times a single repetition occurs and which\n\/\/! word is repeated. Print the maximum number of duplicates, or else print a message saying\n\/\/! that no word was repeated. For example, if the input is\n\/\/  how now now now brown cow cow\n\/\/! the output should indicate that the word now occurred three times.\n\/\/!\n\n#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n    string current_str, previous_str, max_str, current_repeating_str;\n    int current_repeating=0, max_repeating=0;\n\n    cout<<\"Please Enter:\\n\";\n    while (cin>>current_str)\n    {\n        if(current_str.compare(previous_str) == 0)\n        {\n            current_repeating ++ ;\n            current_repeating_str = current_str;\n        }\n        else\n        {\n            current_repeating = 0;\n            current_repeating_str.clear();\n        }\n\n        if(current_repeating > max_repeating)\n        {\n            max_repeating = current_repeating;\n            max_str = current_repeating_str;\n        }\n\n        cout<<\"The Max repeating string now is \"\n              <<max_str\n                <<\"\\nThe repeating times=\"\n                  <<max_repeating\n                    <<std::endl;\n\n        previous_str = current_str;\n\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"MPU9150.h\"\n#include \"AConfig.h\"\n#if(HAS_MPU9150)\n#include \"Device.h\"\n#include \"Settings.h\"\n#include <Wire.h>\n\/\/#include \"I2Cdev.h\"\n#include \"MPU9150Lib.h\"\n#include \"CalLib.h\"\n\/\/#include \"dmpKey.h\"\n\/\/#include \"dmpmap.h\"\n\/\/#include \"inv_mpu.h\"\n\/\/#include \"inv_mpu_dmp_motion_driver.h\"\n#include <EEPROM.h>\n#include \"Timer.h\"\n\nMPU9150Lib MPU;                                              \/\/ the MPU object\nint MPUDeviceId = 1;\nboolean DidInit = false;\nboolean InCallibrationMode = false;\nTimer MPU9150ReInit;\nCALLIB_DATA calData;\nTimer calibration_timer;\nint counter = 0;\n\/\/  MPU_UPDATE_RATE defines the rate (in Hz) at which the MPU updates the sensor data and DMP output\n\n\/\/  MPU_UPDATE_RATE defines the rate (in Hz) at which the MPU updates the sensor data and DMP output\n\n#define MPU_UPDATE_RATE  (20)\n\n\/\/  MAG_UPDATE_RATE defines the rate (in Hz) at which the MPU updates the magnetometer data\n\/\/  MAG_UPDATE_RATE should be less than or equal to the MPU_UPDATE_RATE\n\n#define MAG_UPDATE_RATE  (10)\n\n\/\/  MPU_MAG_MIX defines the influence that the magnetometer has on the yaw output.\n\/\/  The magnetometer itself is quite noisy so some mixing with the gyro yaw can help\n\/\/  significantly. Some example values are defined below:\n\n#define  MPU_MAG_MIX_GYRO_ONLY          0                   \/\/ just use gyro yaw\n#define  MPU_MAG_MIX_MAG_ONLY           1                   \/\/ just use magnetometer and no gyro yaw\n#define  MPU_MAG_MIX_GYRO_AND_MAG       10                  \/\/ a good mix value\n#define  MPU_MAG_MIX_GYRO_AND_SOME_MAG  50                  \/\/ mainly gyros with a bit of mag correction\n\n\/\/  MPU_LPF_RATE is the low pas filter rate and can be between 5 and 188Hz\n\n#define MPU_LPF_RATE   5\n\n\nvoid MPU9150::device_setup(){\n  \/\/Todo: Read calibration values from EPROM\n  Wire.begin();\n  MPU.selectDevice(MPUDeviceId);\n  \/\/  MPU.init(MPU_UPDATE_RATE, MPU_MAG_MIX_GYRO_AND_MAG, MAG_UPDATE_RATE, MPU_LPF_RATE);\n  if (!MPU.init(MPU_UPDATE_RATE, MPU_MAG_MIX_GYRO_AND_MAG, MAG_UPDATE_RATE, MPU_LPF_RATE)){\n\tSerial.println(F(\"log:Trying other MPU9150 address to init;\"));\n\tSerial.print(F(\"log:IMU Address was :\"));\n\tSerial.print(1);\n\tMPUDeviceId = !MPUDeviceId;\n\tSerial.print(F(\" but is now:\"));\n\tSerial.print(MPUDeviceId);\n\tSerial.println(\";\");\n\tMPU.selectDevice(MPUDeviceId);\n\tif (MPU.init(MPU_UPDATE_RATE, MPU_MAG_MIX_GYRO_AND_MAG, MAG_UPDATE_RATE, MPU_LPF_RATE)){\n\t\tDidInit = true;\n\t\tSerial.println(F(\"log:Init worked the second time;\"));\n\t} else {\n\t\tSerial.println(F(\"log:Failed to init on both addresses;\"));\n\t}\n  } else {\n\tDidInit = true;\n\tSerial.println(F(\"log:init on primary addresses;\"));\n  }                             \/\/ start the MPU\n  Settings::capability_bitarray |= (1 << COMPASS_CAPABLE);\n  Settings::capability_bitarray |= (1 << ORIENTATION_CAPABLE);\n  MPU9150ReInit.reset();\n}\n\nvoid MPU9150::device_loop(Command command){\n  if (!DidInit){\n    if( MPU9150ReInit.elapsed(30000)){\n\tMPU9150::device_setup();\n    }\n     return;\n  }\n  if (command.cmp(\"ccal\")){\n   \/\/ Compass_Calibrate();\n   \/\/ The IMU needs both Magnatrometer and Acceleromter to be calibrated. This attempts to do them both at the same time\n    calLibRead(MPUDeviceId, &calData);               \/\/ pick up existing accel data if there\n\n    calData.accelValid = false;\n    calData.accelMinX = 0x7fff;                              \/\/ init accel cal data\n    calData.accelMaxX = 0x8000;\n    calData.accelMinY = 0x7fff;\n    calData.accelMaxY = 0x8000;\n    calData.accelMinZ = 0x7fff;\n    calData.accelMaxZ = 0x8000;\n\n    calData.magValid = false;\n    calData.magMinX = 0x7fff;                                \/\/ init mag cal data\n    calData.magMaxX = 0x8000;\n    calData.magMinY = 0x7fff;\n    calData.magMaxY = 0x8000;\n    calData.magMinZ = 0x7fff;\n    calData.magMaxZ = 0x8000;\n\n    MPU.useAccelCal(false);\n    \/\/MPU.init(MPU_UPDATE_RATE, 5, 1, MPU_LPF_RATE);\n\n    counter = 359;\n    InCallibrationMode = true;\n    calibration_timer.reset();\n    Serial.println(F(\"!!!:While the compass counts down from 360 to 0, rotate the ROV slowly in all three axis;\"));\n\n  }\n\n  if (InCallibrationMode){\n    bool changed = false;\n\n\n    if(counter>0){\n      if (MPU.read()) {                                        \/\/ get the latest data\n        changed = false;\n        if (MPU.m_rawAccel[VEC3_X] < calData.accelMinX) {\n          calData.accelMinX = MPU.m_rawAccel[VEC3_X];\n          changed = true;\n        }\n         if (MPU.m_rawAccel[VEC3_X] > calData.accelMaxX) {\n          calData.accelMaxX = MPU.m_rawAccel[VEC3_X];\n          changed = true;\n        }\n        if (MPU.m_rawAccel[VEC3_Y] < calData.accelMinY) {\n          calData.accelMinY = MPU.m_rawAccel[VEC3_Y];\n          changed = true;\n        }\n         if (MPU.m_rawAccel[VEC3_Y] > calData.accelMaxY) {\n          calData.accelMaxY = MPU.m_rawAccel[VEC3_Y];\n          changed = true;\n        }\n        if (MPU.m_rawAccel[VEC3_Z] < calData.accelMinZ) {\n          calData.accelMinZ = MPU.m_rawAccel[VEC3_Z];\n          changed = true;\n        }\n         if (MPU.m_rawAccel[VEC3_Z] > calData.accelMaxZ) {\n          calData.accelMaxZ = MPU.m_rawAccel[VEC3_Z];\n          changed = true;\n        }\n        if (MPU.m_rawMag[VEC3_X] < calData.magMinX) {\n          calData.magMinX = MPU.m_rawMag[VEC3_X];\n          changed = true;\n        }\n         if (MPU.m_rawMag[VEC3_X] > calData.magMaxX) {\n          calData.magMaxX = MPU.m_rawMag[VEC3_X];\n          changed = true;\n        }\n        if (MPU.m_rawMag[VEC3_Y] < calData.magMinY) {\n          calData.magMinY = MPU.m_rawMag[VEC3_Y];\n          changed = true;\n        }\n         if (MPU.m_rawMag[VEC3_Y] > calData.magMaxY) {\n          calData.magMaxY = MPU.m_rawMag[VEC3_Y];\n          changed = true;\n        }\n        if (MPU.m_rawMag[VEC3_Z] < calData.magMinZ) {\n          calData.magMinZ = MPU.m_rawMag[VEC3_Z];\n          changed = true;\n        }\n         if (MPU.m_rawMag[VEC3_Z] > calData.magMaxZ) {\n          calData.magMaxZ = MPU.m_rawMag[VEC3_Z];\n          changed = true;\n        }\n\n        if (changed) {\n          Serial.print(F(\"dia:accel.MinX=\")); Serial.print(calData.accelMinX); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.maxX=\")); Serial.print(calData.accelMaxX); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.minY=\")); Serial.print(calData.accelMinY); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.maxY=\")); Serial.print(calData.accelMaxY); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.minZ=\")); Serial.print(calData.accelMinZ); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.maxZ=\")); Serial.print(calData.accelMaxZ); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.minX=\")); Serial.print(calData.magMinX); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.maxX=\")); Serial.print(calData.magMaxX); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.minY=\")); Serial.print(calData.magMinY); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.maxY=\")); Serial.print(calData.magMaxY); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.minZ=\")); Serial.print(calData.magMinZ); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.maxZ=\")); Serial.print(calData.magMaxZ); Serial.println(\";\");\n        }\n      }\n      if (calibration_timer.elapsed (1000)) {\n        counter--;\n        navdata::HDGD = counter;\n        Serial.print(F(\"hdgd:\"));\n        Serial.print(navdata::HDGD);\n        Serial.print(';');\n      }\n    }\n    if (counter <= 0){\n      calData.accelValid = true;\n      calData.magValid = true;\n      calLibWrite(MPUDeviceId, &calData);\n      Serial.println(F(\"log:Accel cal data saved for device;\"));\n      InCallibrationMode = false;\n    }\n    return;  \/\/prevents the normal read and reporting of IMU data\n  }\n  else if (command.cmp(\"i2cscan\")){\n   \/\/ scan();\n  }\n\/\/    MPU.selectDevice(MPUDeviceId);\n    MPU.read();\n\/\/    {\n\/\/        Serial.println(F(\"log:SwappingIMUAddress;\"));\n\/\/        MPUDeviceId = !MPUDeviceId;\n\/\/        MPU.selectDevice(MPUDeviceId);\n\/\/        if(!MPU.read()){\n\/\/\t\tSerial.println(F(\"log:Failed to read IMU on both addresses. Sleeping for 1 minute\"));\n\/\/\t\tDidInit = false;\n\/\/\t}\n\/\/    }\n    navdata::HDGD = MPU.m_fusedEulerPose[VEC3_Z] * RAD_TO_DEGREE;\n    \/\/To convert to-180\/180 to 0\/360\n    if (navdata::HDGD < 0) navdata::HDGD+=360;\n    navdata::PITC = MPU.m_fusedEulerPose[VEC3_X] * RAD_TO_DEGREE;\n    navdata::ROLL = MPU.m_fusedEulerPose[VEC3_Y] * RAD_TO_DEGREE;\n    navdata::YAW = MPU.m_fusedEulerPose[VEC3_Z] * RAD_TO_DEGREE;\n}\n#endif\n<commit_msg>Fixed#234; swapped pitch\/roll in MPU9150<commit_after>#include \"MPU9150.h\"\n#include \"AConfig.h\"\n#if(HAS_MPU9150)\n#include \"Device.h\"\n#include \"Settings.h\"\n#include <Wire.h>\n\/\/#include \"I2Cdev.h\"\n#include \"MPU9150Lib.h\"\n#include \"CalLib.h\"\n\/\/#include \"dmpKey.h\"\n\/\/#include \"dmpmap.h\"\n\/\/#include \"inv_mpu.h\"\n\/\/#include \"inv_mpu_dmp_motion_driver.h\"\n#include <EEPROM.h>\n#include \"Timer.h\"\n\nMPU9150Lib MPU;                                              \/\/ the MPU object\nint MPUDeviceId = 1;\nboolean DidInit = false;\nboolean InCallibrationMode = false;\nTimer MPU9150ReInit;\nCALLIB_DATA calData;\nTimer calibration_timer;\nint counter = 0;\n\/\/  MPU_UPDATE_RATE defines the rate (in Hz) at which the MPU updates the sensor data and DMP output\n\n\/\/  MPU_UPDATE_RATE defines the rate (in Hz) at which the MPU updates the sensor data and DMP output\n\n#define MPU_UPDATE_RATE  (20)\n\n\/\/  MAG_UPDATE_RATE defines the rate (in Hz) at which the MPU updates the magnetometer data\n\/\/  MAG_UPDATE_RATE should be less than or equal to the MPU_UPDATE_RATE\n\n#define MAG_UPDATE_RATE  (10)\n\n\/\/  MPU_MAG_MIX defines the influence that the magnetometer has on the yaw output.\n\/\/  The magnetometer itself is quite noisy so some mixing with the gyro yaw can help\n\/\/  significantly. Some example values are defined below:\n\n#define  MPU_MAG_MIX_GYRO_ONLY          0                   \/\/ just use gyro yaw\n#define  MPU_MAG_MIX_MAG_ONLY           1                   \/\/ just use magnetometer and no gyro yaw\n#define  MPU_MAG_MIX_GYRO_AND_MAG       10                  \/\/ a good mix value\n#define  MPU_MAG_MIX_GYRO_AND_SOME_MAG  50                  \/\/ mainly gyros with a bit of mag correction\n\n\/\/  MPU_LPF_RATE is the low pas filter rate and can be between 5 and 188Hz\n\n#define MPU_LPF_RATE   5\n\n\nvoid MPU9150::device_setup(){\n  \/\/Todo: Read calibration values from EPROM\n  Wire.begin();\n  MPU.selectDevice(MPUDeviceId);\n  \/\/  MPU.init(MPU_UPDATE_RATE, MPU_MAG_MIX_GYRO_AND_MAG, MAG_UPDATE_RATE, MPU_LPF_RATE);\n  if (!MPU.init(MPU_UPDATE_RATE, MPU_MAG_MIX_GYRO_AND_MAG, MAG_UPDATE_RATE, MPU_LPF_RATE)){\n\tSerial.println(F(\"log:Trying other MPU9150 address to init;\"));\n\tSerial.print(F(\"log:IMU Address was :\"));\n\tSerial.print(1);\n\tMPUDeviceId = !MPUDeviceId;\n\tSerial.print(F(\" but is now:\"));\n\tSerial.print(MPUDeviceId);\n\tSerial.println(\";\");\n\tMPU.selectDevice(MPUDeviceId);\n\tif (MPU.init(MPU_UPDATE_RATE, MPU_MAG_MIX_GYRO_AND_MAG, MAG_UPDATE_RATE, MPU_LPF_RATE)){\n\t\tDidInit = true;\n\t\tSerial.println(F(\"log:Init worked the second time;\"));\n\t} else {\n\t\tSerial.println(F(\"log:Failed to init on both addresses;\"));\n\t}\n  } else {\n\tDidInit = true;\n\tSerial.println(F(\"log:init on primary addresses;\"));\n  }                             \/\/ start the MPU\n  Settings::capability_bitarray |= (1 << COMPASS_CAPABLE);\n  Settings::capability_bitarray |= (1 << ORIENTATION_CAPABLE);\n  MPU9150ReInit.reset();\n}\n\nvoid MPU9150::device_loop(Command command){\n  if (!DidInit){\n    if( MPU9150ReInit.elapsed(30000)){\n\tMPU9150::device_setup();\n    }\n     return;\n  }\n  if (command.cmp(\"ccal\")){\n   \/\/ Compass_Calibrate();\n   \/\/ The IMU needs both Magnatrometer and Acceleromter to be calibrated. This attempts to do them both at the same time\n    calLibRead(MPUDeviceId, &calData);               \/\/ pick up existing accel data if there\n\n    calData.accelValid = false;\n    calData.accelMinX = 0x7fff;                              \/\/ init accel cal data\n    calData.accelMaxX = 0x8000;\n    calData.accelMinY = 0x7fff;\n    calData.accelMaxY = 0x8000;\n    calData.accelMinZ = 0x7fff;\n    calData.accelMaxZ = 0x8000;\n\n    calData.magValid = false;\n    calData.magMinX = 0x7fff;                                \/\/ init mag cal data\n    calData.magMaxX = 0x8000;\n    calData.magMinY = 0x7fff;\n    calData.magMaxY = 0x8000;\n    calData.magMinZ = 0x7fff;\n    calData.magMaxZ = 0x8000;\n\n    MPU.useAccelCal(false);\n    \/\/MPU.init(MPU_UPDATE_RATE, 5, 1, MPU_LPF_RATE);\n\n    counter = 359;\n    InCallibrationMode = true;\n    calibration_timer.reset();\n    Serial.println(F(\"!!!:While the compass counts down from 360 to 0, rotate the ROV slowly in all three axis;\"));\n\n  }\n\n  if (InCallibrationMode){\n    bool changed = false;\n\n\n    if(counter>0){\n      if (MPU.read()) {                                        \/\/ get the latest data\n        changed = false;\n        if (MPU.m_rawAccel[VEC3_X] < calData.accelMinX) {\n          calData.accelMinX = MPU.m_rawAccel[VEC3_X];\n          changed = true;\n        }\n         if (MPU.m_rawAccel[VEC3_X] > calData.accelMaxX) {\n          calData.accelMaxX = MPU.m_rawAccel[VEC3_X];\n          changed = true;\n        }\n        if (MPU.m_rawAccel[VEC3_Y] < calData.accelMinY) {\n          calData.accelMinY = MPU.m_rawAccel[VEC3_Y];\n          changed = true;\n        }\n         if (MPU.m_rawAccel[VEC3_Y] > calData.accelMaxY) {\n          calData.accelMaxY = MPU.m_rawAccel[VEC3_Y];\n          changed = true;\n        }\n        if (MPU.m_rawAccel[VEC3_Z] < calData.accelMinZ) {\n          calData.accelMinZ = MPU.m_rawAccel[VEC3_Z];\n          changed = true;\n        }\n         if (MPU.m_rawAccel[VEC3_Z] > calData.accelMaxZ) {\n          calData.accelMaxZ = MPU.m_rawAccel[VEC3_Z];\n          changed = true;\n        }\n        if (MPU.m_rawMag[VEC3_X] < calData.magMinX) {\n          calData.magMinX = MPU.m_rawMag[VEC3_X];\n          changed = true;\n        }\n         if (MPU.m_rawMag[VEC3_X] > calData.magMaxX) {\n          calData.magMaxX = MPU.m_rawMag[VEC3_X];\n          changed = true;\n        }\n        if (MPU.m_rawMag[VEC3_Y] < calData.magMinY) {\n          calData.magMinY = MPU.m_rawMag[VEC3_Y];\n          changed = true;\n        }\n         if (MPU.m_rawMag[VEC3_Y] > calData.magMaxY) {\n          calData.magMaxY = MPU.m_rawMag[VEC3_Y];\n          changed = true;\n        }\n        if (MPU.m_rawMag[VEC3_Z] < calData.magMinZ) {\n          calData.magMinZ = MPU.m_rawMag[VEC3_Z];\n          changed = true;\n        }\n         if (MPU.m_rawMag[VEC3_Z] > calData.magMaxZ) {\n          calData.magMaxZ = MPU.m_rawMag[VEC3_Z];\n          changed = true;\n        }\n\n        if (changed) {\n          Serial.print(F(\"dia:accel.MinX=\")); Serial.print(calData.accelMinX); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.maxX=\")); Serial.print(calData.accelMaxX); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.minY=\")); Serial.print(calData.accelMinY); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.maxY=\")); Serial.print(calData.accelMaxY); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.minZ=\")); Serial.print(calData.accelMinZ); Serial.println(\";\");\n          Serial.print(F(\"dia:accel.maxZ=\")); Serial.print(calData.accelMaxZ); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.minX=\")); Serial.print(calData.magMinX); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.maxX=\")); Serial.print(calData.magMaxX); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.minY=\")); Serial.print(calData.magMinY); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.maxY=\")); Serial.print(calData.magMaxY); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.minZ=\")); Serial.print(calData.magMinZ); Serial.println(\";\");\n          Serial.print(F(\"dia:mag.maxZ=\")); Serial.print(calData.magMaxZ); Serial.println(\";\");\n        }\n      }\n      if (calibration_timer.elapsed (1000)) {\n        counter--;\n        navdata::HDGD = counter;\n        Serial.print(F(\"hdgd:\"));\n        Serial.print(navdata::HDGD);\n        Serial.print(';');\n      }\n    }\n    if (counter <= 0){\n      calData.accelValid = true;\n      calData.magValid = true;\n      calLibWrite(MPUDeviceId, &calData);\n      Serial.println(F(\"log:Accel cal data saved for device;\"));\n      InCallibrationMode = false;\n    }\n    return;  \/\/prevents the normal read and reporting of IMU data\n  }\n  else if (command.cmp(\"i2cscan\")){\n   \/\/ scan();\n  }\n\/\/    MPU.selectDevice(MPUDeviceId);\n    MPU.read();\n\/\/    {\n\/\/        Serial.println(F(\"log:SwappingIMUAddress;\"));\n\/\/        MPUDeviceId = !MPUDeviceId;\n\/\/        MPU.selectDevice(MPUDeviceId);\n\/\/        if(!MPU.read()){\n\/\/\t\tSerial.println(F(\"log:Failed to read IMU on both addresses. Sleeping for 1 minute\"));\n\/\/\t\tDidInit = false;\n\/\/\t}\n\/\/    }\n    navdata::HDGD = MPU.m_fusedEulerPose[VEC3_Z] * RAD_TO_DEGREE;\n    \/\/To convert to-180\/180 to 0\/360\n    if (navdata::HDGD < 0) navdata::HDGD+=360;\n    navdata::PITC = MPU.m_fusedEulerPose[VEC3_Y] * RAD_TO_DEGREE;\n    navdata::ROLL = MPU.m_fusedEulerPose[VEC3_X] * RAD_TO_DEGREE;\n    navdata::YAW = MPU.m_fusedEulerPose[VEC3_Z] * RAD_TO_DEGREE;\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2011, James Webber.\n\/\/ Distributed under a 3-clause BSD license.  See COPYING.\n\n#ifndef PIPELINE_OUTPUT_STAGE_HPP_zia9vdqt\n#define PIPELINE_OUTPUT_STAGE_HPP_zia9vdqt\n\n#include \"simple_stages.hpp\"\n\nnamespace pipeline {\n\n  class outputter {\n    virtual void write(packet) = 0;\n  };\n\n  class local_outputter  : outputter {\n    local_pipe p_;\n    void write(packet);\n  };\n\n  class thread_outputter : outputter {\n    thread_pipe p_;\n    void write(packet);\n  };\n\n  \/*!\n   * \\ingroup grp_pipeline\n   * Specialised outputting stage.\n   *\/\n  class output_stage : public observer_stage {\n    void output(pkt, outputter) = 0;\n    void reconfigure(pkt) = 0;\n\n    \/\/ A pipe to the input thread.  This can be local or threaded.\n    outputter input_events_;\n\n    void observe(packet *pkt) {\n      \/\/ fullfills the 'reconfigure' event.  Somebody has to check it.  If we do\n      \/\/ it here then it avoids type checking of all stages.  Additionally, it\n      \/\/ means we can later have a reconfgiure event which a configuration chaning\n      \/\/ stage could deal with.\n\n      \/\/ TODO:\n      \/\/   Perhaps better in a hypothetical output seqeuence.\n\n      if (pkt.configuration != last_configuration) {\n        this->reconfigure(pkt);\n      }\n\n      \/\/ hmmm...\n      this->real_observe(pkt);\n    }\n  };\n\n}\n\n#endif\n<commit_msg>Remove some simple compile errors from the output stage.<commit_after>\/\/ Copyright (C) 2011, James Webber.\n\/\/ Distributed under a 3-clause BSD license.  See COPYING.\n\n#ifndef PIPELINE_OUTPUT_STAGE_HPP_zia9vdqt\n#define PIPELINE_OUTPUT_STAGE_HPP_zia9vdqt\n\n#include \"simple_stages.hpp\"\n\nnamespace pipeline {\n  class packet;\n\n  \/\/! \\ingroup grp_pipeline\n  \/\/! Polymoprphic outputtter which is intended to abstract the thread and local\n  \/\/! pipes.\n  class outputter {\n    public:\n    virtual void write(packet *) = 0;\n    virtual ~outputter() {}\n  };\n\n  \/\/! \\ingroup grp_pipeline\n  class local_outputter : public outputter {\n    public:\n    void write(packet*);\n  };\n\n  \/\/! \\ingroup grp_pipeline\n  class thread_outputter : public outputter {\n    public:\n    void write(packet *);\n  };\n\n  \/*!\n   * \\ingroup grp_pipeline\n   * Specialised outputting stage.\n   *\/\n  class output_stage : public observer_stage {\n    public:\n    virtual void output(packet *, outputter *) = 0;\n    virtual void reconfigure(packet *) = 0;\n\n    outputter *input_events_;\n\n    \/\/ Fullfills the 'reconfigure' event.  Somebody has to check it.  If we do\n    \/\/ it here then it avoids type checking of all stages.  Additionally, it\n    \/\/ means we can later have a reconfgiure event which a configuration chaning\n    \/\/ stage could deal with.\n    void observe(packet *pkt) {\n      \/\/ TODO:\n      \/\/   Perhaps better in a hypothetical output seqeuence.\n      \/\/ if (pkt.configuration != last_configuration) {\n      \/\/   this->reconfigure(pkt);\n      \/\/ }\n\n      \/\/ Prolly this should pass a specialised event interface.\n      this->output(pkt, input_events_);\n    }\n  };\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"network_world_client.h\"\n#include \"network.h\"\n#include \"level\/scene.h\"\n#include \"globals.h\"\n#include \"level\/blockobject.h\"\n#include \"util\/funcs.h\"\n#include \"object\/player.h\"\n#include \"factory\/object_factory.h\"\n#include <pthread.h>\n#include <string.h>\n\n#include \"object\/character.h\"\n#include \"object\/cat.h\"\n#include \"object\/item.h\"\n\nstatic void * handleMessages( void * arg ){\n\tNetworkWorldClient * world = (NetworkWorldClient *) arg;\n\tNLsocket socket = world->getServer();\n\t\/\/ pthread_mutex_t * lock = world->getLock();\n\tunsigned int received = 0;\n\t\n\ttry{\n\t\twhile ( world->isRunning() ){\n\t\t\treceived += 1;\n\t\t\tGlobal::debug( 1 ) << \"Receiving message \" << received << endl;\n\t\t\tNetwork::Message m( socket );\n\t\t\t\/\/ pthread_mutex_lock( lock );\n\t\t\tworld->addIncomingMessage( m );\n\t\t\tGlobal::debug( 2 ) << \"Received path '\" << m.path << \"'\" << endl;\n\t\t\t\/\/ pthread_mutex_unlock( lock );\n\t\t}\n\t} catch ( const Network::NetworkException & n ){\n\t\tGlobal::debug( 0 ) << \"Network exception: \" << n.getMessage() << endl;\n\t}\n\n\tGlobal::debug( 0 ) << \"Client input stopped\" << endl;\n\n\treturn NULL;\n}\n\t\nNetworkWorldClient::NetworkWorldClient( Network::Socket server, const std::vector< Object * > & players, const string & path, unsigned int id, int screen_size ) throw ( LoadException ):\nWorld( players, path, screen_size ),\nserver( server ),\nworld_finished( false ),\nid( id ),\nrunning( true ){\n\tobjects.clear();\n\tpthread_mutex_init( &message_mutex, NULL );\n\tpthread_mutex_init( &running_mutex, NULL );\n\tpthread_create( &message_thread, NULL, handleMessages, this );\n}\n\t\nNetworkWorldClient::~NetworkWorldClient(){\n\tGlobal::debug( 1 ) << \"Destroy client world\" << endl;\n\tstopRunning();\n\tpthread_join( message_thread, NULL );\n}\n\t\nbool NetworkWorldClient::isRunning(){\n\tpthread_mutex_lock( &running_mutex );\n\tbool b = running;\n\tpthread_mutex_unlock( &running_mutex );\n\treturn b;\n}\n\nvoid NetworkWorldClient::stopRunning(){\n\tpthread_mutex_lock( &running_mutex );\n\trunning = false;\n\tpthread_mutex_unlock( &running_mutex );\n}\n\t\nvoid NetworkWorldClient::addIncomingMessage( const Network::Message & message ){\n\tpthread_mutex_lock( &message_mutex );\n\tincoming.push_back( message );\n\tpthread_mutex_unlock( &message_mutex );\n}\n\t\nvector< Network::Message > NetworkWorldClient::getIncomingMessages(){\n\tvector< Network::Message > m;\n\tpthread_mutex_lock( &message_mutex );\n\tm = incoming;\n\tincoming.clear();\n\tpthread_mutex_unlock( &message_mutex );\n\treturn m;\n}\n\nbool NetworkWorldClient::uniqueObject( unsigned int id ){\n\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); it++ ){\n\t\tObject * o = *it;\n\t\tif ( o->getId() == id ){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid NetworkWorldClient::handleCreateCharacter( Network::Message & message ){\n\tint alliance;\n\tint id;\n\tint map;\n\tstring path = Util::getDataPath() + \"\/\" + message.path;\n\tmessage >> alliance >> id >> map;\n\tif ( uniqueObject( id ) ){\n\t\tif ( (unsigned int) id == this->id ){\n\t\t\tPlayer * p = (Player *) players[ 0 ].player;\n\t\t\tp->deathReset();\n\t\t\taddObject( p );\n\t\t} else {\n\t\t\tBlockObject block;\n\t\t\tblock.setType( ObjectFactory::OBJECT_NETWORK_CHARACTER );\n\t\t\tblock.setMap( map );\n\t\t\tblock.setPath( path );\n\t\t\tCharacter * character = (Character *) ObjectFactory::createObject( &block );\n\t\t\tif ( character == NULL ){\n\t\t\t\tGlobal::debug( 0 ) << \"Could not create character!\" << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tGlobal::debug( 1 ) << \"Create '\" << path << \"' with id \" << id << \" alliance \" << alliance << endl;\n\t\t\tcharacter->setId( id );\n\t\t\tcharacter->setAlliance( alliance );\n\t\t\t\/* TODO: should these values be hard-coded? *\/\n\t\t\tcharacter->setX( 200 );\n\t\t\tcharacter->setY( 0 );\n\t\t\tcharacter->setZ( 150 );\n\t\t\taddObject( character );\n\t\t}\n\t} else {\n\t\tGlobal::debug( 1 ) << id << \" is not unique\" << endl;\n\t}\n}\n\nvoid NetworkWorldClient::handleCreateCat( Network::Message & message ){\n\tint id;\n\tmessage >> id;\n\tif ( uniqueObject( id ) ){\n\t\tstring path = Util::getDataPath() + \"\/\" + message.path;\n\t\tBlockObject block;\n\t\tblock.setType( ObjectFactory::OBJECT_CAT );\n\t\tblock.setPath( path );\n\t\t\/* TODO: should these values be hard-coded? *\/\n\t\tblock.setCoords( 200, 150 );\n\t\tCat * cat = (Cat *) ObjectFactory::createObject( &block );\n\t\tif ( cat == NULL ){\n\t\t\tGlobal::debug( 0 ) << \"Could not create cat\" << endl;\n\t\t\treturn;\n\t\t}\n\n\t\tcat->setY( 0 );\n\t\tcat->setId( (unsigned int) -1 );\n\t\taddObject( cat );\n\t}\n}\n\t\nconst bool NetworkWorldClient::finished() const {\n\treturn world_finished;\n}\n\nObject * NetworkWorldClient::removeObject( unsigned int id ){\n\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); ){\n\t\tObject * o = *it;\n\t\tif ( o->getId() == id ){\n\t\t\tit = objects.erase( it );\n\t\t\treturn o;\n\t\t} else {\n\t\t\tit++;\n\t\t}\n\t}\n\treturn NULL;\n}\n\nvoid NetworkWorldClient::handleCreateItem( Network::Message & message ){\n\tint id;\n\tmessage >> id;\n\tif ( uniqueObject( id ) ){\n\t\tint x, z;\n\t\tint value;\n\t\tmessage >> x >> z >> value;\n\t\tstring path = Util::getDataPath() + \"\/\" + message.path;\n\t\tBlockObject block;\n\t\tblock.setType( ObjectFactory::OBJECT_ITEM );\n\t\tblock.setPath( path );\n\t\t\/* TODO: dont hard-code this *\/\n\t\tblock.setStimulationType( \"health\" );\n\t\tblock.setStimulationValue( value );\n\t\tblock.setCoords( x, z );\n\t\tItem * item = (Item *) ObjectFactory::createObject( &block );\n\t\tif ( item == NULL ){\n\t\t\tGlobal::debug( 0 ) << \"Could not create item\" << endl;\n\t\t\treturn;\n\t\t}\n\n\t\titem->setY( 0 );\n\t\titem->setId( id );\n\t\taddObject( item );\n\t}\n}\n\nvoid NetworkWorldClient::handleCreateBang( Network::Message & message ){\n\tint x, y, z;\n\tmessage >> x >> y >> z;\n\tObject * addx = bang->copy();\n\taddx->setX( x );\n\taddx->setY( 0 );\n\taddx->setZ( y+addx->getHeight()\/2 );\n\taddx->setHealth( 1 );\n\taddx->setId( (unsigned int) -1 );\n\taddObject( addx );\n}\n\t\nvoid NetworkWorldClient::handleMessage( Network::Message & message ){\n\tif ( message.id == 0 ){\n\t\tint type;\n\t\tmessage >> type;\n\t\tswitch ( type ){\n\t\t\tcase CREATE_CHARACTER : {\n\t\t\t\thandleCreateCharacter( message );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase CREATE_CAT : {\n\t\t\t\thandleCreateCat( message );\t\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase CREATE_BANG : {\n\t\t\t\thandleCreateBang( message );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase CREATE_ITEM : {\n\t\t\t\thandleCreateItem( message );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase NEXT_BLOCK : {\n\t\t\t\tint block;\n\t\t\t\tmessage >> block;\n\t\t\t\tscene->advanceBlocks( block );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase DELETE_OBJ : {\n\t\t\t\tint id;\n\t\t\t\tmessage >> id;\n\t\t\t\tObject * o = removeObject( id );\n\t\t\t\tif ( o != NULL ){\n\t\t\t\t\tdelete o;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase REMOVE : {\n\t\t\t\tint id;\n\t\t\t\tmessage >> id;\n\t\t\t\tremoveObject( id );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase FINISH : {\n\n\t\t\t\tGlobal::debug( 1 ) << \"Received finish message\" << endl;\n\t\t\t\tworld_finished = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase NOTHING : {\n\t\t\t\tGlobal::debug( 0 ) << \"Invalid message. Data dump\" << endl;\n\t\t\t\tfor ( int i = 0; i < Network::DATA_SIZE; i++ ){\n\t\t\t\t\tGlobal::debug( 0 ) << (int) message.data[ i ] << \" \";\n\t\t\t\t}\n\t\t\t\tGlobal::debug( 0 ) << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); it++ ){\n\t\t\tObject * o = *it;\n\t\t\tif ( o->getId() == message.id ){\n\t\t\t\to->interpretMessage( message );\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid NetworkWorldClient::addMessage( Network::Message m, Network::Socket from ){\n\tif ( m.id == id ){\n\t\toutgoing.push_back( m );\n\t}\n}\n\t\nvoid NetworkWorldClient::doScene( int min_x, int max_x ){\n\tvector< Object * > objs;\n\tscene->act( min_x, max_x, &objs );\n\tfor ( vector< Object * >::iterator it = objs.begin(); it != objs.end(); it++ ){\n\t\tdelete *it;\n\t}\n}\n\nvoid NetworkWorldClient::sendMessage( const Network::Message & message, NLsocket socket ){\n\tmessage.send( socket );\n}\n\nvoid NetworkWorldClient::act(){\n\t\n\tif ( quake_time > 0 ){\n\t\tquake_time--;\n\t}\n\n\tvector< Object * > added_effects;\n\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); it++ ){\n\t\tObject * o = *it;\n\t\to->act( &objects, this, &added_effects );\n\t\tif ( o->getZ() < getMinimumZ() ){\n\t\t\to->setZ( getMinimumZ() );\n\t\t}\n\t\tif ( o->getZ() > getMaximumZ() ){\n\t\t\to->setZ( getMaximumZ() );\n\t\t}\n\t}\n\n\tdouble lowest = 9999999;\n\tfor ( vector< PlayerTracker >::iterator it = players.begin(); it != players.end(); it++ ){\n\t\tObject * player = it->player;\n\t\tdouble mx = player->getX() - screen_size \/ 2;\n\t\tif ( it->min_x < mx ){\n\t\t\tit->min_x++;\n\t\t}\n\t\n\t\tif ( it->min_x + screen_size >= scene->getLimit() ){\n\t\t\tit->min_x = scene->getLimit() - screen_size;\n\t\t}\n\n\t\tif ( it->min_x < lowest ){\n\t\t\tlowest = it->min_x;\n\t\t}\n\t\t\n\t\t\/*\n\t\tif ( player->getX() < it->min_x ){\n\t\t\tplayer->setX( it->min_x );\n\t\t}\n\t\t*\/\n\t\tif ( player->getX() < 0 ){\n\t\t\tplayer->setX( 0 );\n\t\t}\n\n\t\tif ( player->getX() > scene->getLimit() ){\n\t\t\tplayer->setX( scene->getLimit() );\n\t\t}\n\t\tif ( player->getZ() < getMinimumZ() ){\n\t\t\tplayer->setZ( getMinimumZ() );\n\t\t}\n\t\tif ( player->getZ() > getMaximumZ() ){\n\t\t\tplayer->setZ( getMaximumZ() );\n\t\t}\n\t}\n\n\tdoScene( 0, 0 );\n\n\tvector< Network::Message > messages = getIncomingMessages();\n\tfor ( vector< Network::Message >::iterator it = messages.begin(); it != messages.end(); it++ ){\n\t\thandleMessage( *it );\n\t}\n\n\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); ){\n\t\tif ( (*it)->getHealth() <= 0 ){\n\t\t\t(*it)->died( added_effects );\n\t\t\tif ( ! isPlayer( *it ) ){\n\t\t\t\tdelete *it;\n\t\t\t}\n\t\t\tit = objects.erase( it );\n\t\t} else ++it;\n\t}\n\n\tfor ( vector< Network::Message >::iterator it = outgoing.begin(); it != outgoing.end(); it++ ){\n\t\tNetwork::Message & m = *it;\n\t\tsendMessage( m, getServer() );\n\t}\n\toutgoing.clear();\n\t\n\tfor ( vector< Object * >::iterator it = added_effects.begin(); it != added_effects.end(); ){\n\t\tObject * o = *it;\n\t\to->setId( (unsigned int) -1 );\n\t\tit++;\n\t}\n\tobjects.insert( objects.end(), added_effects.begin(), added_effects.end() );\n}\n<commit_msg>fixes for windows<commit_after>#include \"util\/bitmap.h\"\n#include \"network_world_client.h\"\n#include \"network.h\"\n#include \"level\/scene.h\"\n#include \"globals.h\"\n#include \"level\/blockobject.h\"\n#include \"util\/funcs.h\"\n#include \"object\/player.h\"\n#include \"factory\/object_factory.h\"\n#include <pthread.h>\n#include <string.h>\n\n#include \"object\/character.h\"\n#include \"object\/cat.h\"\n#include \"object\/item.h\"\n\nstatic void * handleMessages( void * arg ){\n\tNetworkWorldClient * world = (NetworkWorldClient *) arg;\n\tNLsocket socket = world->getServer();\n\t\/\/ pthread_mutex_t * lock = world->getLock();\n\tunsigned int received = 0;\n\t\n\ttry{\n\t\twhile ( world->isRunning() ){\n\t\t\treceived += 1;\n\t\t\tGlobal::debug( 1 ) << \"Receiving message \" << received << endl;\n\t\t\tNetwork::Message m( socket );\n\t\t\t\/\/ pthread_mutex_lock( lock );\n\t\t\tworld->addIncomingMessage( m );\n\t\t\tGlobal::debug( 2 ) << \"Received path '\" << m.path << \"'\" << endl;\n\t\t\t\/\/ pthread_mutex_unlock( lock );\n\t\t}\n\t} catch ( const Network::NetworkException & n ){\n\t\tGlobal::debug( 0 ) << \"Network exception: \" << n.getMessage() << endl;\n\t}\n\n\tGlobal::debug( 0 ) << \"Client input stopped\" << endl;\n\n\treturn NULL;\n}\n\t\nNetworkWorldClient::NetworkWorldClient( Network::Socket server, const std::vector< Object * > & players, const string & path, unsigned int id, int screen_size ) throw ( LoadException ):\nWorld( players, path, screen_size ),\nserver( server ),\nworld_finished( false ),\nid( id ),\nrunning( true ){\n\tobjects.clear();\n\tpthread_mutex_init( &message_mutex, NULL );\n\tpthread_mutex_init( &running_mutex, NULL );\n\tpthread_create( &message_thread, NULL, handleMessages, this );\n}\n\t\nNetworkWorldClient::~NetworkWorldClient(){\n\tGlobal::debug( 1 ) << \"Destroy client world\" << endl;\n\tstopRunning();\n\tpthread_join( message_thread, NULL );\n}\n\t\nbool NetworkWorldClient::isRunning(){\n\tpthread_mutex_lock( &running_mutex );\n\tbool b = running;\n\tpthread_mutex_unlock( &running_mutex );\n\treturn b;\n}\n\nvoid NetworkWorldClient::stopRunning(){\n\tpthread_mutex_lock( &running_mutex );\n\trunning = false;\n\tpthread_mutex_unlock( &running_mutex );\n}\n\t\nvoid NetworkWorldClient::addIncomingMessage( const Network::Message & message ){\n\tpthread_mutex_lock( &message_mutex );\n\tincoming.push_back( message );\n\tpthread_mutex_unlock( &message_mutex );\n}\n\t\nvector< Network::Message > NetworkWorldClient::getIncomingMessages(){\n\tvector< Network::Message > m;\n\tpthread_mutex_lock( &message_mutex );\n\tm = incoming;\n\tincoming.clear();\n\tpthread_mutex_unlock( &message_mutex );\n\treturn m;\n}\n\nbool NetworkWorldClient::uniqueObject( unsigned int id ){\n\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); it++ ){\n\t\tObject * o = *it;\n\t\tif ( o->getId() == id ){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid NetworkWorldClient::handleCreateCharacter( Network::Message & message ){\n\tint alliance;\n\tint id;\n\tint map;\n\tstring path = Util::getDataPath() + \"\/\" + message.path;\n\tmessage >> alliance >> id >> map;\n\tif ( uniqueObject( id ) ){\n\t\tif ( (unsigned int) id == this->id ){\n\t\t\tPlayer * p = (Player *) players[ 0 ].player;\n\t\t\tp->deathReset();\n\t\t\taddObject( p );\n\t\t} else {\n\t\t\tBlockObject block;\n\t\t\tblock.setType( ObjectFactory::OBJECT_NETWORK_CHARACTER );\n\t\t\tblock.setMap( map );\n\t\t\tblock.setPath( path );\n\t\t\tCharacter * character = (Character *) ObjectFactory::createObject( &block );\n\t\t\tif ( character == NULL ){\n\t\t\t\tGlobal::debug( 0 ) << \"Could not create character!\" << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tGlobal::debug( 1 ) << \"Create '\" << path << \"' with id \" << id << \" alliance \" << alliance << endl;\n\t\t\tcharacter->setId( id );\n\t\t\tcharacter->setAlliance( alliance );\n\t\t\t\/* TODO: should these values be hard-coded? *\/\n\t\t\tcharacter->setX( 200 );\n\t\t\tcharacter->setY( 0 );\n\t\t\tcharacter->setZ( 150 );\n\t\t\taddObject( character );\n\t\t}\n\t} else {\n\t\tGlobal::debug( 1 ) << id << \" is not unique\" << endl;\n\t}\n}\n\nvoid NetworkWorldClient::handleCreateCat( Network::Message & message ){\n\tint id;\n\tmessage >> id;\n\tif ( uniqueObject( id ) ){\n\t\tstring path = Util::getDataPath() + \"\/\" + message.path;\n\t\tBlockObject block;\n\t\tblock.setType( ObjectFactory::OBJECT_CAT );\n\t\tblock.setPath( path );\n\t\t\/* TODO: should these values be hard-coded? *\/\n\t\tblock.setCoords( 200, 150 );\n\t\tCat * cat = (Cat *) ObjectFactory::createObject( &block );\n\t\tif ( cat == NULL ){\n\t\t\tGlobal::debug( 0 ) << \"Could not create cat\" << endl;\n\t\t\treturn;\n\t\t}\n\n\t\tcat->setY( 0 );\n\t\tcat->setId( (unsigned int) -1 );\n\t\taddObject( cat );\n\t}\n}\n\t\nconst bool NetworkWorldClient::finished() const {\n\treturn world_finished;\n}\n\nObject * NetworkWorldClient::removeObject( unsigned int id ){\n\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); ){\n\t\tObject * o = *it;\n\t\tif ( o->getId() == id ){\n\t\t\tit = objects.erase( it );\n\t\t\treturn o;\n\t\t} else {\n\t\t\tit++;\n\t\t}\n\t}\n\treturn NULL;\n}\n\nvoid NetworkWorldClient::handleCreateItem( Network::Message & message ){\n\tint id;\n\tmessage >> id;\n\tif ( uniqueObject( id ) ){\n\t\tint x, z;\n\t\tint value;\n\t\tmessage >> x >> z >> value;\n\t\tstring path = Util::getDataPath() + \"\/\" + message.path;\n\t\tBlockObject block;\n\t\tblock.setType( ObjectFactory::OBJECT_ITEM );\n\t\tblock.setPath( path );\n\t\t\/* TODO: dont hard-code this *\/\n\t\tblock.setStimulationType( \"health\" );\n\t\tblock.setStimulationValue( value );\n\t\tblock.setCoords( x, z );\n\t\tItem * item = (Item *) ObjectFactory::createObject( &block );\n\t\tif ( item == NULL ){\n\t\t\tGlobal::debug( 0 ) << \"Could not create item\" << endl;\n\t\t\treturn;\n\t\t}\n\n\t\titem->setY( 0 );\n\t\titem->setId( id );\n\t\taddObject( item );\n\t}\n}\n\nvoid NetworkWorldClient::handleCreateBang( Network::Message & message ){\n\tint x, y, z;\n\tmessage >> x >> y >> z;\n\tObject * addx = bang->copy();\n\taddx->setX( x );\n\taddx->setY( 0 );\n\taddx->setZ( y+addx->getHeight()\/2 );\n\taddx->setHealth( 1 );\n\taddx->setId( (unsigned int) -1 );\n\taddObject( addx );\n}\n\t\nvoid NetworkWorldClient::handleMessage( Network::Message & message ){\n\tif ( message.id == 0 ){\n\t\tint type;\n\t\tmessage >> type;\n\t\tswitch ( type ){\n\t\t\tcase CREATE_CHARACTER : {\n\t\t\t\thandleCreateCharacter( message );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase CREATE_CAT : {\n\t\t\t\thandleCreateCat( message );\t\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase CREATE_BANG : {\n\t\t\t\thandleCreateBang( message );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase CREATE_ITEM : {\n\t\t\t\thandleCreateItem( message );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase NEXT_BLOCK : {\n\t\t\t\tint block;\n\t\t\t\tmessage >> block;\n\t\t\t\tscene->advanceBlocks( block );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase DELETE_OBJ : {\n\t\t\t\tint id;\n\t\t\t\tmessage >> id;\n\t\t\t\tObject * o = removeObject( id );\n\t\t\t\tif ( o != NULL ){\n\t\t\t\t\tdelete o;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase REMOVE : {\n\t\t\t\tint id;\n\t\t\t\tmessage >> id;\n\t\t\t\tremoveObject( id );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase FINISH : {\n\n\t\t\t\tGlobal::debug( 1 ) << \"Received finish message\" << endl;\n\t\t\t\tworld_finished = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase NOTHING : {\n\t\t\t\tGlobal::debug( 0 ) << \"Invalid message. Data dump\" << endl;\n\t\t\t\tfor ( int i = 0; i < Network::DATA_SIZE; i++ ){\n\t\t\t\t\tGlobal::debug( 0 ) << (int) message.data[ i ] << \" \";\n\t\t\t\t}\n\t\t\t\tGlobal::debug( 0 ) << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); it++ ){\n\t\t\tObject * o = *it;\n\t\t\tif ( o->getId() == message.id ){\n\t\t\t\to->interpretMessage( message );\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid NetworkWorldClient::addMessage( Network::Message m, Network::Socket from ){\n\tif ( m.id == id ){\n\t\toutgoing.push_back( m );\n\t}\n}\n\t\nvoid NetworkWorldClient::doScene( int min_x, int max_x ){\n\tvector< Object * > objs;\n\tscene->act( min_x, max_x, &objs );\n\tfor ( vector< Object * >::iterator it = objs.begin(); it != objs.end(); it++ ){\n\t\tdelete *it;\n\t}\n}\n\nvoid NetworkWorldClient::sendMessage( const Network::Message & message, NLsocket socket ){\n\tmessage.send( socket );\n}\n\nvoid NetworkWorldClient::act(){\n\t\n\tif ( quake_time > 0 ){\n\t\tquake_time--;\n\t}\n\n\tvector< Object * > added_effects;\n\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); it++ ){\n\t\tObject * o = *it;\n\t\to->act( &objects, this, &added_effects );\n\t\tif ( o->getZ() < getMinimumZ() ){\n\t\t\to->setZ( getMinimumZ() );\n\t\t}\n\t\tif ( o->getZ() > getMaximumZ() ){\n\t\t\to->setZ( getMaximumZ() );\n\t\t}\n\t}\n\n\tdouble lowest = 9999999;\n\tfor ( vector< PlayerTracker >::iterator it = players.begin(); it != players.end(); it++ ){\n\t\tObject * player = it->player;\n\t\tdouble mx = player->getX() - screen_size \/ 2;\n\t\tif ( it->min_x < mx ){\n\t\t\tit->min_x++;\n\t\t}\n\t\n\t\tif ( it->min_x + screen_size >= scene->getLimit() ){\n\t\t\tit->min_x = scene->getLimit() - screen_size;\n\t\t}\n\n\t\tif ( it->min_x < lowest ){\n\t\t\tlowest = it->min_x;\n\t\t}\n\t\t\n\t\t\/*\n\t\tif ( player->getX() < it->min_x ){\n\t\t\tplayer->setX( it->min_x );\n\t\t}\n\t\t*\/\n\t\tif ( player->getX() < 0 ){\n\t\t\tplayer->setX( 0 );\n\t\t}\n\n\t\tif ( player->getX() > scene->getLimit() ){\n\t\t\tplayer->setX( scene->getLimit() );\n\t\t}\n\t\tif ( player->getZ() < getMinimumZ() ){\n\t\t\tplayer->setZ( getMinimumZ() );\n\t\t}\n\t\tif ( player->getZ() > getMaximumZ() ){\n\t\t\tplayer->setZ( getMaximumZ() );\n\t\t}\n\t}\n\n\tdoScene( 0, 0 );\n\n\tvector< Network::Message > messages = getIncomingMessages();\n\tfor ( vector< Network::Message >::iterator it = messages.begin(); it != messages.end(); it++ ){\n\t\thandleMessage( *it );\n\t}\n\n\tfor ( vector< Object * >::iterator it = objects.begin(); it != objects.end(); ){\n\t\tif ( (*it)->getHealth() <= 0 ){\n\t\t\t(*it)->died( added_effects );\n\t\t\tif ( ! isPlayer( *it ) ){\n\t\t\t\tdelete *it;\n\t\t\t}\n\t\t\tit = objects.erase( it );\n\t\t} else ++it;\n\t}\n\n\tfor ( vector< Network::Message >::iterator it = outgoing.begin(); it != outgoing.end(); it++ ){\n\t\tNetwork::Message & m = *it;\n\t\tsendMessage( m, getServer() );\n\t}\n\toutgoing.clear();\n\t\n\tfor ( vector< Object * >::iterator it = added_effects.begin(); it != added_effects.end(); ){\n\t\tObject * o = *it;\n\t\to->setId( (unsigned int) -1 );\n\t\tit++;\n\t}\n\tobjects.insert( objects.end(), added_effects.begin(), added_effects.end() );\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#pragma once\n\n#include <memory>\n\n#include <QSharedPointer>\n#include <qnamespace.h>\n\n#include <ox\/claw\/claw.hpp>\n#include <ox\/fs\/fs.hpp>\n#include <ox\/mc\/mc.hpp>\n#include <ox\/model\/descwrite.hpp>\n#include <ox\/std\/std.hpp>\n\n#include \"nostalgiastudio_export.h\"\n\nnamespace nostalgia::studio {\n\nenum class ProjectEvent {\n\tFileAdded,\n\t\/\/ FileRecognized is triggered for all matching files upon a new\n\t\/\/ subscription to a section of the project and upon the addition of a file.\n\tFileRecognized,\n\tFileDeleted,\n\tFileUpdated,\n};\n\n[[nodiscard]] QString filePathToName(QString path, QString prefix, QString suffix);\n\nclass NOSTALGIASTUDIO_EXPORT Project: public QObject {\n\tQ_OBJECT\n\n\tprivate:\n\t\tQString m_path = \"\";\n\t\tmutable std::unique_ptr<ox::FileSystem> m_fs;\n\n\tpublic:\n\t\texplicit Project(QString path);\n\n\t\t~Project() override;\n\n\t\tvoid create();\n\n\t\tox::FileSystem *romFs();\n\n\t\tvoid mkdir(QString path) const;\n\n\t\t\/**\n\t\t * Writes a MetalClaw object to the project at the given path.\n\t\t *\/\n\t\ttemplate<typename T>\n\t\tvoid writeObj(QString path, T *obj) const;\n\n\t\ttemplate<typename T>\n\t\tstd::unique_ptr<T> loadObj(QString path) const;\n\n\t\tox::FileStat stat(QString path) const;\n\n\t\tbool exists(QString path) const;\n\n\t\tvoid subscribe(ProjectEvent e, QObject *tgt, const char *slot) const;\n\n\t\ttemplate<typename Functor>\n\t\tvoid subscribe(ProjectEvent e, QObject *tgt, Functor &&slot) const;\n\n\tprivate:\n\t\tvoid writeBuff(QString path, uint8_t *buff, size_t buffLen) const;\n\n\t\tox::Buffer loadBuff(QString path) const;\n\n\t\tvoid lsProcDir(QStringList *paths, QString path) const;\n\n\t\tQStringList listFiles(QString path = \"\") const;\n\n\tsignals:\n\t\tvoid fileEvent(ProjectEvent, QString path) const;\n\t\tvoid fileAdded(QString) const;\n\t\t\/\/ FileRecognized is triggered for all matching files upon a new\n\t\t\/\/ subscription to a section of the project and upon the addition of a\n\t\t\/\/ file.\n\t\tvoid fileRecognized(QString) const;\n\t\tvoid fileDeleted(QString) const;\n\t\tvoid fileUpdated(QString) const;\n\n};\n\ntemplate<typename T>\nvoid Project::writeObj(QString path, T *obj) const {\n\t\/\/ write MetalClaw\n\toxRequireMT(buff, ox::writeClaw(obj, ox::ClawFormat::Metal));\n\t\/\/ write to FS\n\twriteBuff(path, ox::bit_cast<uint8_t*>(buff.data()), buff.size());\n\n\t\/\/ write type descriptor\n\tconst auto type = ox::buildTypeDef(obj);\n\toxRequireMT(typeOut, ox::writeClaw(type.value, ox::ClawFormat::Organic));\n\t\/\/ replace garbage last character with new line\n\ttypeOut.back().value = '\\n';\n\t\/\/ write to FS\n\tQString descPath = \"\/.nostalgia\/type_descriptors\/\";\n\tconst auto typePath = descPath + type.value->typeName.c_str();\n\tmkdir(descPath);\n\twriteBuff(typePath, ox::bit_cast<uint8_t*>(typeOut.data()), typeOut.size());\n\temit fileUpdated(path);\n}\n\ntemplate<typename T>\nstd::unique_ptr<T> Project::loadObj(QString path) const {\n\tauto obj = std::make_unique<T>();\n\tauto buff = loadBuff(path);\n\toxThrowError(ox::readClaw<T>(buff.data(), buff.size(), obj.get()));\n\treturn std::move(obj);\n}\n\ntemplate<typename Functor>\nvoid Project::subscribe(ProjectEvent e, QObject *tgt, Functor &&slot) const {\n\tswitch (e) {\n\t\tcase ProjectEvent::FileAdded:\n\t\t\tconnect(this, &Project::fileAdded, tgt, (slot));\n\t\t\tbreak;\n\t\tcase ProjectEvent::FileRecognized:\n\t\t{\n\t\t\tfor (auto f : listFiles()) {\n\t\t\t\tslot(f);\n\t\t\t}\n\t\t\tconnect(this, &Project::fileRecognized, tgt, (slot));\n\t\t\tbreak;\n\t\t}\n\t\tcase ProjectEvent::FileDeleted:\n\t\t\tconnect(this, &Project::fileDeleted, tgt, (slot));\n\t\t\tbreak;\n\t\tcase ProjectEvent::FileUpdated:\n\t\t\tconnect(this, &Project::fileUpdated, tgt, (slot));\n\t\t\tbreak;\n\t}\n}\n\n}\n<commit_msg>[nostalgia\/studio] Fix copy pessimization<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#pragma once\n\n#include <memory>\n\n#include <QSharedPointer>\n#include <qnamespace.h>\n\n#include <ox\/claw\/claw.hpp>\n#include <ox\/fs\/fs.hpp>\n#include <ox\/mc\/mc.hpp>\n#include <ox\/model\/descwrite.hpp>\n#include <ox\/std\/std.hpp>\n\n#include \"nostalgiastudio_export.h\"\n\nnamespace nostalgia::studio {\n\nenum class ProjectEvent {\n\tFileAdded,\n\t\/\/ FileRecognized is triggered for all matching files upon a new\n\t\/\/ subscription to a section of the project and upon the addition of a file.\n\tFileRecognized,\n\tFileDeleted,\n\tFileUpdated,\n};\n\n[[nodiscard]] QString filePathToName(QString path, QString prefix, QString suffix);\n\nclass NOSTALGIASTUDIO_EXPORT Project: public QObject {\n\tQ_OBJECT\n\n\tprivate:\n\t\tQString m_path = \"\";\n\t\tmutable std::unique_ptr<ox::FileSystem> m_fs;\n\n\tpublic:\n\t\texplicit Project(QString path);\n\n\t\t~Project() override;\n\n\t\tvoid create();\n\n\t\tox::FileSystem *romFs();\n\n\t\tvoid mkdir(QString path) const;\n\n\t\t\/**\n\t\t * Writes a MetalClaw object to the project at the given path.\n\t\t *\/\n\t\ttemplate<typename T>\n\t\tvoid writeObj(QString path, T *obj) const;\n\n\t\ttemplate<typename T>\n\t\tstd::unique_ptr<T> loadObj(QString path) const;\n\n\t\tox::FileStat stat(QString path) const;\n\n\t\tbool exists(QString path) const;\n\n\t\tvoid subscribe(ProjectEvent e, QObject *tgt, const char *slot) const;\n\n\t\ttemplate<typename Functor>\n\t\tvoid subscribe(ProjectEvent e, QObject *tgt, Functor &&slot) const;\n\n\tprivate:\n\t\tvoid writeBuff(QString path, uint8_t *buff, size_t buffLen) const;\n\n\t\tox::Buffer loadBuff(QString path) const;\n\n\t\tvoid lsProcDir(QStringList *paths, QString path) const;\n\n\t\tQStringList listFiles(QString path = \"\") const;\n\n\tsignals:\n\t\tvoid fileEvent(ProjectEvent, QString path) const;\n\t\tvoid fileAdded(QString) const;\n\t\t\/\/ FileRecognized is triggered for all matching files upon a new\n\t\t\/\/ subscription to a section of the project and upon the addition of a\n\t\t\/\/ file.\n\t\tvoid fileRecognized(QString) const;\n\t\tvoid fileDeleted(QString) const;\n\t\tvoid fileUpdated(QString) const;\n\n};\n\ntemplate<typename T>\nvoid Project::writeObj(QString path, T *obj) const {\n\t\/\/ write MetalClaw\n\toxRequireMT(buff, ox::writeClaw(obj, ox::ClawFormat::Metal));\n\t\/\/ write to FS\n\twriteBuff(path, ox::bit_cast<uint8_t*>(buff.data()), buff.size());\n\n\t\/\/ write type descriptor\n\tconst auto type = ox::buildTypeDef(obj);\n\toxRequireMT(typeOut, ox::writeClaw(type.value, ox::ClawFormat::Organic));\n\t\/\/ replace garbage last character with new line\n\ttypeOut.back().value = '\\n';\n\t\/\/ write to FS\n\tQString descPath = \"\/.nostalgia\/type_descriptors\/\";\n\tconst auto typePath = descPath + type.value->typeName.c_str();\n\tmkdir(descPath);\n\twriteBuff(typePath, ox::bit_cast<uint8_t*>(typeOut.data()), typeOut.size());\n\temit fileUpdated(path);\n}\n\ntemplate<typename T>\nstd::unique_ptr<T> Project::loadObj(QString path) const {\n\tauto obj = std::make_unique<T>();\n\tauto buff = loadBuff(path);\n\toxThrowError(ox::readClaw<T>(buff.data(), buff.size(), obj.get()));\n\treturn obj;\n}\n\ntemplate<typename Functor>\nvoid Project::subscribe(ProjectEvent e, QObject *tgt, Functor &&slot) const {\n\tswitch (e) {\n\t\tcase ProjectEvent::FileAdded:\n\t\t\tconnect(this, &Project::fileAdded, tgt, (slot));\n\t\t\tbreak;\n\t\tcase ProjectEvent::FileRecognized:\n\t\t{\n\t\t\tfor (auto f : listFiles()) {\n\t\t\t\tslot(f);\n\t\t\t}\n\t\t\tconnect(this, &Project::fileRecognized, tgt, (slot));\n\t\t\tbreak;\n\t\t}\n\t\tcase ProjectEvent::FileDeleted:\n\t\t\tconnect(this, &Project::fileDeleted, tgt, (slot));\n\t\t\tbreak;\n\t\tcase ProjectEvent::FileUpdated:\n\t\t\tconnect(this, &Project::fileUpdated, tgt, (slot));\n\t\t\tbreak;\n\t}\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n * From:\n * http:\/\/stackoverflow.com\/questions\/6142576\/sample-from-multivariate-normal-gaussian-distribution-in-c\n *\/\n\n\n#include <iostream>\n\n\n#include \"bpmf.h\"\n\nusing namespace std;\nusing namespace Eigen;\n\n\/*\n  We need a functor that can pretend it's const,\n  but to be a good random number generator \n  it needs mutable state.\n*\/\n\n#ifndef __clang__\nthread_local \n#endif \nstatic std::mt19937 rng;\n\n#ifndef __clang__\nthread_local \n#endif \nstatic normal_distribution<> nd;\n\ndouble randn(double) {\n  return nd(rng);\n}\n\nauto\nnrandn(int n) -> decltype( VectorXd::NullaryExpr(n, ptr_fun(randn)) ) \n{\n    return VectorXd::NullaryExpr(n, ptr_fun(randn));\n}\n\n\/*\n  Draw nn samples from a size-dimensional normal distribution\n  with a specified mean and covariance\n*\/\nMatrixXd MvNormal(MatrixXd covar, VectorXd mean, int nn = 1) \n{\n  int size = mean.rows(); \/\/ Dimensionality (rows)\n  MatrixXd normTransform(size,size);\n\n  LLT<MatrixXd> cholSolver(covar);\n  normTransform = cholSolver.matrixL();\n\n  auto normSamples = MatrixXd::NullaryExpr(size,nn,ptr_fun(randn));\n  MatrixXd samples = (normTransform * normSamples).colwise() + mean;\n\n  return samples;\n}\n\nMatrixXd WishartUnit(int m, int df)\n{\n    MatrixXd c(m,m);\n    c.setZero();\n\n    for ( int i = 0; i < m; i++ ) {\n        std::gamma_distribution<> gam(0.5*(df - i));\n        c(i,i) = sqrt(2.0 * gam(rng));\n        VectorXd r = nrandn(m-i-1).transpose();\n        c.block(i,i+1,1,m-i-1) = r;\n    }\n\n    MatrixXd ret = c.transpose() * c;\n\n#ifdef TEST_MVNORMAL\n    cout << \"WISHART UNIT {\\n\" << endl;\n    cout << \"  m:\\n\" << m << endl;\n    cout << \"  df:\\n\" << df << endl;\n    cout << \"  ret;\\n\" << ret << endl;\n    cout << \"  c:\\n\" << c << endl;\n    cout << \"}\\n\" << ret << endl;\n#endif\n\n    return ret;\n}\n\nMatrixXd Wishart(const MatrixXd &sigma, int df)\n{\n\/\/  Get R, the upper triangular Cholesky factor of SIGMA.\n  MatrixXd r = sigma.llt().matrixU();\n\n\/\/  Get AU, a sample from the unit Wishart distribution.\n  MatrixXd au = WishartUnit(sigma.cols(), df);\n\n\/\/  Construct the matrix A = R' * AU * R.\n  MatrixXd a = r.transpose() * au * r; \n\n\n#ifdef TEST_MVNORMAL\n    cout << \"WISHART {\\n\" << endl;\n    cout << \"  sigma::\\n\" << sigma << endl;\n    cout << \"  r:\\n\" << r << endl;\n    cout << \"  au:\\n\" << au << endl;\n    cout << \"  df:\\n\" << df << endl;\n    cout << \"  a:\\n\" << a << endl;\n    cout << \"}\\n\" << endl;\n#endif\n\n\n  return a;\n}\n\n\n\/\/ from julia package Distributions: conjugates\/normalwishart.jl\nstd::pair<VectorXd, MatrixXd> NormalWishart(VectorXd mu, double kappa, MatrixXd T, double nu) \n{\n  MatrixXd Lam = Wishart(T, nu); \n  MatrixXd mu_o = MvNormal(Lam.inverse() \/ kappa, mu);\n\n#ifdef TEST_MVNORMAL\n    cout << \"NORMAL WISHART {\\n\" << endl;\n    cout << \"  mu:\\n\" << mu << endl;\n    cout << \"  kappa:\\n\" << kappa << endl;\n    cout << \"  T:\\n\" << T << endl;\n    cout << \"  nu:\\n\" << nu << endl;\n    cout << \"  mu_o\\n\" << mu_o << endl;\n    cout << \"  Lam\\n\" << Lam << endl;\n    cout << \"}\\n\" << endl;\n#endif\n\n  return std::make_pair(mu_o , Lam);\n}\n\ndouble acc[9] = { .0 };\n\nstd::pair<VectorXd, MatrixXd> OldCondNormalWishart(const MatrixXd &U, const VectorXd &mu, const double kappa, const MatrixXd &T, const int nu)\n{\n  int N = U.cols();\n  auto start = tick();\n  auto Um = U.rowwise().mean();\n  \n\n  \/\/ http:\/\/stackoverflow.com\/questions\/15138634\/eigen-is-there-an-inbuilt-way-to-calculate-sample-covariance\n  MatrixXd C = U.colwise() - Um;\n  MatrixXd S = (C * C.adjoint()) \/ double(N - 1);\n  VectorXd mu_c = (kappa*mu + N*Um) \/ (kappa + N);\n  double kappa_c = kappa + N;\n  MatrixXd T_c = ( T + N * S.transpose() + (kappa * N)\/(kappa + N) * (mu - Um) * ((mu - Um).transpose())).inverse();\n  int nu_c = nu + N;\n\n#ifdef TEST_MVNORMAL\n  cout << \"mu_c:\\n\" << mu_c << endl;\n  cout << \"kappa_c:\\n\" << kappa_c << endl;\n  cout << \"T_c:\\n\" << T_c << endl;\n  cout << \"nu_c:\\n\" << nu_c << endl;\n#endif\n\n  auto ret = NormalWishart(mu_c, kappa_c, T_c, nu_c);\n\n  acc[8] += tick() - start;\n\n  return ret;\n}\n\n\/\/ from bpmf.jl -- verified\nstd::pair<VectorXd, MatrixXd> CondNormalWishart(const MatrixXd &U, const VectorXd &mu, const double kappa, const MatrixXd &T, const int nu)\n{\n         double   t[8];\n\n  int N = U.cols();\n\n  t[0] = tick();\n  auto Um = U.rowwise().mean();\n  t[1] = tick();\n  acc[0] += t[1] - t[0];\n\n  \/\/ http:\/\/stackoverflow.com\/questions\/15138634\/eigen-is-there-an-inbuilt-way-to-calculate-sample-covariance\n  MatrixXd C = U.colwise() - Um;\n  MatrixXd S = (C * C.adjoint()) \/ double(N - 1);\n  VectorXd mu_c = (kappa*mu + N*Um) \/ (kappa + N);\n  double kappa_c = kappa + N;\n  t[2] = tick();\n  acc[1] += t[2] - t[1];\n  t[3] = tick();\n  acc[2] += t[3] - t[2];\n  t[4] = tick();\n  acc[3] += t[4] - t[3];\n  VectorXd mu_m = (mu - Um);\n  double kappa_m = (kappa * N)\/(kappa + N);\n  auto X = ( T + N * S.transpose() + kappa_m * (mu_m * mu_m.transpose())); \/\/.inverse();\n  t[5] = tick();\n  acc[4] += t[5] - t[4];\n  MatrixXd T_c = X.inverse();\n  t[6] = tick();\n  acc[5] += t[6] - t[5];\n  int nu_c = nu + N;\n\n#ifdef TEST_MVNORMAL\n  cout << \"mu_c:\\n\" << mu_c << endl;\n  cout << \"kappa_c:\\n\" << kappa_c << endl;\n  cout << \"T_c:\\n\" << T_c << endl;\n  cout << \"nu_c:\\n\" << nu_c << endl;\n#endif\n\n  auto ret = NormalWishart(mu_c, kappa_c, T_c, nu_c);\n\n  t[7] = tick();\n  acc[6] += t[7] - t[6];\n  acc[7] += t[7] - t[0];\n\n  return ret;\n}\n\n#if defined(TEST_MVNORMAL) || defined (BENCH_MVNORMAL)\n\nint main()\n{\n    \n    MatrixXd U(32,32 * 1024);\n    U.setOnes();\n\n    VectorXd mu(32);\n    mu.setZero();\n\n    double kappa = 2;\n\n    MatrixXd T(32,32);\n    T.setIdentity(32,32);\n    T.array() \/= 4;\n\n    int nu = 3;\n\n    VectorXd mu_out;\n    MatrixXd T_out;\n\n#ifdef BENCH_MVNORMAL\n    for(int i=0; i<300; ++i) {\n        tie(mu_out, T_out) = CondNormalWishart(U, mu, kappa, T, nu);\n        cout << i << \"\\r\" << flush;\n    }\n    cout << endl << flush;\n\n    for(int i=0; i<7; ++i) {\n        cout << i << \": \" << (int)(100.0 * acc[i] \/ acc[7])  << endl;\n    }\n    cout << \"total: \" << acc[7] << endl;\n\n    for(int i=0; i<300; ++i) {\n        tie(mu_out, T_out) = OldCondNormalWishart(U, mu, kappa, T, nu);\n        cout << i << \"\\r\" << flush;\n    }\n    cout << endl << flush;\n\n    cout << \"total: \" << acc[8] << endl;\n\n\n#else\n#if 1\n    cout << \"COND NORMAL WISHART\\n\" << endl;\n\n    tie(mu_out, T_out) = CondNormalWishart(U, mu, kappa, T, nu);\n\n    cout << \"mu_out:\\n\" << mu_out << endl;\n    cout << \"T_out:\\n\" << T_out << endl;\n\n    cout << \"\\n-----\\n\\n\";\n#endif\n\n#if 0\n    cout << \"NORMAL WISHART\\n\" << endl;\n\n    tie(mu_out, T_out) = NormalWishart(mu, kappa, T, nu);\n    cout << \"mu_out:\\n\" << mu_out << endl;\n    cout << \"T_out:\\n\" << T_out << endl;\n\n#endif\n\n#if 0\n    cout << \"MVNORMAL\\n\" << endl;\n    MatrixXd out = MvNormal(T, mu, 10);\n    cout << \"mu:\\n\" << mu << endl;\n    cout << \"T:\\n\" << T << endl;\n    cout << \"out:\\n\" << out << endl;\n#endif\n#endif\n}\n\n#endif\n<commit_msg>sample from mvnormal using precision matrix<commit_after>\n\/*\n * From:\n * http:\/\/stackoverflow.com\/questions\/6142576\/sample-from-multivariate-normal-gaussian-distribution-in-c\n *\/\n\n\n#include <iostream>\n\n\n#include \"bpmf.h\"\n\nusing namespace std;\nusing namespace Eigen;\n\n\/*\n  We need a functor that can pretend it's const,\n  but to be a good random number generator \n  it needs mutable state.\n*\/\n\n#ifndef __clang__\nthread_local \n#endif \nstatic std::mt19937 rng;\n\n#ifndef __clang__\nthread_local \n#endif \nstatic normal_distribution<> nd;\n\ndouble randn(double) {\n  return nd(rng);\n}\n\nauto\nnrandn(int n) -> decltype( VectorXd::NullaryExpr(n, ptr_fun(randn)) ) \n{\n    return VectorXd::NullaryExpr(n, ptr_fun(randn));\n}\n\nMatrixXd MvNormal_prec(const MatrixXd & Lambda, const VectorXd & mean, int nn = 1)\n{\n  int size = mean.rows(); \/\/ Dimensionality (rows)\n\n  LLT<MatrixXd> chol(Lambda);\n\n  MatrixXd r = MatrixXd::NullaryExpr(size,nn,ptr_fun(randn));\n\tchol.matrixU().solveInPlace(r);\n  return r.colwise() + mean;\n}\n\n\/*\n  Draw nn samples from a size-dimensional normal distribution\n  with a specified mean and covariance\n*\/\nMatrixXd MvNormal(MatrixXd covar, VectorXd mean, int nn = 1) \n{\n  int size = mean.rows(); \/\/ Dimensionality (rows)\n  MatrixXd normTransform(size,size);\n\n  LLT<MatrixXd> cholSolver(covar);\n  normTransform = cholSolver.matrixL();\n\n  auto normSamples = MatrixXd::NullaryExpr(size,nn,ptr_fun(randn));\n  MatrixXd samples = (normTransform * normSamples).colwise() + mean;\n\n  return samples;\n}\n\nMatrixXd WishartUnit(int m, int df)\n{\n    MatrixXd c(m,m);\n    c.setZero();\n\n    for ( int i = 0; i < m; i++ ) {\n        std::gamma_distribution<> gam(0.5*(df - i));\n        c(i,i) = sqrt(2.0 * gam(rng));\n        VectorXd r = nrandn(m-i-1).transpose();\n        c.block(i,i+1,1,m-i-1) = r;\n    }\n\n    MatrixXd ret = c.transpose() * c;\n\n#ifdef TEST_MVNORMAL\n    cout << \"WISHART UNIT {\\n\" << endl;\n    cout << \"  m:\\n\" << m << endl;\n    cout << \"  df:\\n\" << df << endl;\n    cout << \"  ret;\\n\" << ret << endl;\n    cout << \"  c:\\n\" << c << endl;\n    cout << \"}\\n\" << ret << endl;\n#endif\n\n    return ret;\n}\n\nMatrixXd Wishart(const MatrixXd &sigma, int df)\n{\n\/\/  Get R, the upper triangular Cholesky factor of SIGMA.\n  MatrixXd r = sigma.llt().matrixU();\n\n\/\/  Get AU, a sample from the unit Wishart distribution.\n  MatrixXd au = WishartUnit(sigma.cols(), df);\n\n\/\/  Construct the matrix A = R' * AU * R.\n  MatrixXd a = r.transpose() * au * r; \n\n\n#ifdef TEST_MVNORMAL\n    cout << \"WISHART {\\n\" << endl;\n    cout << \"  sigma::\\n\" << sigma << endl;\n    cout << \"  r:\\n\" << r << endl;\n    cout << \"  au:\\n\" << au << endl;\n    cout << \"  df:\\n\" << df << endl;\n    cout << \"  a:\\n\" << a << endl;\n    cout << \"}\\n\" << endl;\n#endif\n\n\n  return a;\n}\n\n\n\/\/ from julia package Distributions: conjugates\/normalwishart.jl\nstd::pair<VectorXd, MatrixXd> NormalWishart(VectorXd mu, double kappa, MatrixXd T, double nu) \n{\n  MatrixXd Lam = Wishart(T, nu);\n  MatrixXd mu_o = MvNormal_prec(Lam * kappa, mu);\n\n#ifdef TEST_MVNORMAL\n    cout << \"NORMAL WISHART {\\n\" << endl;\n    cout << \"  mu:\\n\" << mu << endl;\n    cout << \"  kappa:\\n\" << kappa << endl;\n    cout << \"  T:\\n\" << T << endl;\n    cout << \"  nu:\\n\" << nu << endl;\n    cout << \"  mu_o\\n\" << mu_o << endl;\n    cout << \"  Lam\\n\" << Lam << endl;\n    cout << \"}\\n\" << endl;\n#endif\n\n  return std::make_pair(mu_o , Lam);\n}\n\ndouble acc[9] = { .0 };\n\nstd::pair<VectorXd, MatrixXd> OldCondNormalWishart(const MatrixXd &U, const VectorXd &mu, const double kappa, const MatrixXd &T, const int nu)\n{\n  int N = U.cols();\n  auto start = tick();\n  auto Um = U.rowwise().mean();\n  \n\n  \/\/ http:\/\/stackoverflow.com\/questions\/15138634\/eigen-is-there-an-inbuilt-way-to-calculate-sample-covariance\n  MatrixXd C = U.colwise() - Um;\n  MatrixXd S = (C * C.adjoint()) \/ double(N - 1);\n  VectorXd mu_c = (kappa*mu + N*Um) \/ (kappa + N);\n  double kappa_c = kappa + N;\n  MatrixXd T_c = ( T + N * S.transpose() + (kappa * N)\/(kappa + N) * (mu - Um) * ((mu - Um).transpose())).inverse();\n  int nu_c = nu + N;\n\n#ifdef TEST_MVNORMAL\n  cout << \"mu_c:\\n\" << mu_c << endl;\n  cout << \"kappa_c:\\n\" << kappa_c << endl;\n  cout << \"T_c:\\n\" << T_c << endl;\n  cout << \"nu_c:\\n\" << nu_c << endl;\n#endif\n\n  auto ret = NormalWishart(mu_c, kappa_c, T_c, nu_c);\n\n  acc[8] += tick() - start;\n\n  return ret;\n}\n\n\/\/ from bpmf.jl -- verified\nstd::pair<VectorXd, MatrixXd> CondNormalWishart(const MatrixXd &U, const VectorXd &mu, const double kappa, const MatrixXd &T, const int nu)\n{\n         double   t[8];\n\n  int N = U.cols();\n\n  t[0] = tick();\n  auto Um = U.rowwise().mean();\n  t[1] = tick();\n  acc[0] += t[1] - t[0];\n\n  \/\/ http:\/\/stackoverflow.com\/questions\/15138634\/eigen-is-there-an-inbuilt-way-to-calculate-sample-covariance\n  MatrixXd C = U.colwise() - Um;\n  MatrixXd S = (C * C.adjoint()) \/ double(N - 1);\n  VectorXd mu_c = (kappa*mu + N*Um) \/ (kappa + N);\n  double kappa_c = kappa + N;\n  t[2] = tick();\n  acc[1] += t[2] - t[1];\n  t[3] = tick();\n  acc[2] += t[3] - t[2];\n  t[4] = tick();\n  acc[3] += t[4] - t[3];\n  VectorXd mu_m = (mu - Um);\n  double kappa_m = (kappa * N)\/(kappa + N);\n  auto X = ( T + N * S.transpose() + kappa_m * (mu_m * mu_m.transpose())); \/\/.inverse();\n  t[5] = tick();\n  acc[4] += t[5] - t[4];\n  MatrixXd T_c = X.inverse();\n  t[6] = tick();\n  acc[5] += t[6] - t[5];\n  int nu_c = nu + N;\n\n#ifdef TEST_MVNORMAL\n  cout << \"mu_c:\\n\" << mu_c << endl;\n  cout << \"kappa_c:\\n\" << kappa_c << endl;\n  cout << \"T_c:\\n\" << T_c << endl;\n  cout << \"nu_c:\\n\" << nu_c << endl;\n#endif\n\n  auto ret = NormalWishart(mu_c, kappa_c, T_c, nu_c);\n\n  t[7] = tick();\n  acc[6] += t[7] - t[6];\n  acc[7] += t[7] - t[0];\n\n  return ret;\n}\n\n#if defined(TEST_MVNORMAL) || defined (BENCH_MVNORMAL)\n\nint main()\n{\n    \n    MatrixXd U(32,32 * 1024);\n    U.setOnes();\n\n    VectorXd mu(32);\n    mu.setZero();\n\n    double kappa = 2;\n\n    MatrixXd T(32,32);\n    T.setIdentity(32,32);\n    T.array() \/= 4;\n\n    int nu = 3;\n\n    VectorXd mu_out;\n    MatrixXd T_out;\n\n#ifdef BENCH_MVNORMAL\n    for(int i=0; i<300; ++i) {\n        tie(mu_out, T_out) = CondNormalWishart(U, mu, kappa, T, nu);\n        cout << i << \"\\r\" << flush;\n    }\n    cout << endl << flush;\n\n    for(int i=0; i<7; ++i) {\n        cout << i << \": \" << (int)(100.0 * acc[i] \/ acc[7])  << endl;\n    }\n    cout << \"total: \" << acc[7] << endl;\n\n    for(int i=0; i<300; ++i) {\n        tie(mu_out, T_out) = OldCondNormalWishart(U, mu, kappa, T, nu);\n        cout << i << \"\\r\" << flush;\n    }\n    cout << endl << flush;\n\n    cout << \"total: \" << acc[8] << endl;\n\n\n#else\n#if 1\n    cout << \"COND NORMAL WISHART\\n\" << endl;\n\n    tie(mu_out, T_out) = CondNormalWishart(U, mu, kappa, T, nu);\n\n    cout << \"mu_out:\\n\" << mu_out << endl;\n    cout << \"T_out:\\n\" << T_out << endl;\n\n    cout << \"\\n-----\\n\\n\";\n#endif\n\n#if 0\n    cout << \"NORMAL WISHART\\n\" << endl;\n\n    tie(mu_out, T_out) = NormalWishart(mu, kappa, T, nu);\n    cout << \"mu_out:\\n\" << mu_out << endl;\n    cout << \"T_out:\\n\" << T_out << endl;\n\n#endif\n\n#if 0\n    cout << \"MVNORMAL\\n\" << endl;\n    MatrixXd out = MvNormal(T, mu, 10);\n    cout << \"mu:\\n\" << mu << endl;\n    cout << \"T:\\n\" << T << endl;\n    cout << \"out:\\n\" << out << endl;\n#endif\n#endif\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2014 odan\n * License: MIT License\n *\/\n#ifndef INCLUDED_PARAMETERS_5GEN_HPP\n#define INCLUDED_PARAMETERS_5GEN_HPP\n#include <cstdint>\n\nnamespace RNGLib {\ntemplate<uint32_t nazo1_, uint32_t nazo2_, uint32_t nazo3_, uint32_t nazo4_, uint32_t nazo5_,\n         uint32_t VCount_, uint32_t GxStat_, uint32_t Frame_>\nclass Parameters5Gen {\npublic:\n    static constexpr uint32_t nazo1 = nazo1_;\n    static constexpr uint32_t nazo2 = nazo2_;\n    static constexpr uint32_t nazo3 = nazo3_;\n    static constexpr uint32_t nazo4 = nazo4_;\n    static constexpr uint32_t nazo5 = nazo5_;\n\n    static constexpr uint32_t VCount = VCount_;\n    static constexpr uint32_t GxStat = GxStat_;\n    static constexpr uint32_t Frame  = Frame_;\nprivate:\n    uint32_t Timer0;\n    uint32_t MAC_add1;\n    uint32_t MAC_add2;\n    uint32_t MAC_add3;\n    uint32_t MAC_add4;\n    uint32_t MAC_add5;\n    uint32_t MAC_add6;\n    uint32_t year;\n    uint32_t month;\n    uint32_t day;\n    uint32_t hour;\n    uint32_t minute;\n    uint32_t sec;\n\n    uint32_t key;\n\npublic:\n    void set_MAC_add(uint32_t m1, uint32_t m2, uint32_t m3, \n            uint32_t m4, uint32_t m5, uint32_t m6) {\n        MAC_add1 = m1;\n        MAC_add2 = m2;\n        MAC_add3 = m3;\n        MAC_add4 = m4;\n        MAC_add5 = m5;\n        MAC_add6 = m6;\n    }\n\n    void set_year(uint32_t yy) { year = yy; }\n    void set_month(uint32_t mm) { month = mm; }\n    void set_day(uint32_t dd) { day = dd; }\n\n    void set_hour(uint32_t hh) { hour = hh; }\n    void set_minute(uint32_t mi) { minute = mi; }\n    void set_sec(uint32_t se) { sec = se; }\n\n\n    void set_key(uint32_t key_) { key = key_; }\n    void set_Timer0(uint32_t tt) { Timer0 = tt; }\n\n    uint32_t get_MAC_add1() const { return MAC_add1; }\n    uint32_t get_MAC_add2() const { return MAC_add2; }\n    uint32_t get_MAC_add3() const { return MAC_add3; }\n    uint32_t get_MAC_add4() const { return MAC_add4; }\n    uint32_t get_MAC_add5() const { return MAC_add5; }\n    uint32_t get_MAC_add6() const { return MAC_add6; }\n\n    uint32_t get_year() const { return year; }\n    uint32_t get_month() const { return month; }\n    uint32_t get_day() const { return day; }\n    uint32_t get_hour() const { return hour; }\n    uint32_t get_minute() const { return minute; }\n    uint32_t get_sec() const { return sec; }\n    uint32_t get_week() const {\n        return  ((2000+year-(month<3)) + (2000+year-(month<3))\/4 -\n            (2000+year-(month<3))\/100 + (2000+year-(month<3))\/400 +\n            (13*(month+(month<3)*12)+8)\/5 + day) % 7;\n    }\n\n    uint32_t get_nazo1() const { return nazo1; }\n    uint32_t get_nazo2() const { return nazo2; }\n    uint32_t get_nazo3() const { return nazo3; }\n    uint32_t get_nazo4() const { return nazo4; }\n    uint32_t get_nazo5() const { return nazo5; }\n\n    uint32_t get_VCount() const { return VCount; }\n    uint32_t get_Timer0() const { return Timer0; }\n    uint32_t get_GxStat() const { return GxStat; }\n    uint32_t get_Frame() const { return Frame; }\n    uint32_t get_key() const { return key; }\n\n\n};\ntypedef Parameters5Gen<0x2215f10, 0x221600c, 0x221600c, 0x2216058, 0x2216058, 0x60, 0x6000000, 6> ParametersB1Ja;\ntypedef Parameters5Gen<0x2215f30, 0x221602c, 0x221602c, 0x2216078, 0x2216078, 0x60, 0x6000000, 6> ParametersW1Ja;\n\n \n} \/\/ end RNGLib\n\n#endif\n<commit_msg>Parameters5GenのテンプレートパラメータでTimer0の範囲を指定出来るように<commit_after>\/*\n * Copyright (c) 2014 odan\n * License: MIT License\n *\/\n#ifndef INCLUDED_PARAMETERS_5GEN_HPP\n#define INCLUDED_PARAMETERS_5GEN_HPP\n#include <cstdint>\n\nnamespace RNGLib {\ntemplate<uint32_t nazo1_, uint32_t nazo2_, uint32_t nazo3_, uint32_t nazo4_, uint32_t nazo5_,\n         uint32_t VCount_, uint32_t GxStat_, uint32_t Frame_, uint32_t Timer0Min_, uint32_t Timer0Max_>\nclass Parameters5Gen {\npublic:\n    static constexpr uint32_t nazo1 = nazo1_;\n    static constexpr uint32_t nazo2 = nazo2_;\n    static constexpr uint32_t nazo3 = nazo3_;\n    static constexpr uint32_t nazo4 = nazo4_;\n    static constexpr uint32_t nazo5 = nazo5_;\n\n    static constexpr uint32_t VCount = VCount_;\n    static constexpr uint32_t GxStat = GxStat_;\n    static constexpr uint32_t Frame  = Frame_;\n    static constexpr uint32_t Timer0Min = Timer0Min_;\n    static constexpr uint32_t Timer0Max = Timer0Max_;\nprivate:\n    uint32_t Timer0 = Timer0Min_;\n    uint32_t MAC_add1;\n    uint32_t MAC_add2;\n    uint32_t MAC_add3;\n    uint32_t MAC_add4;\n    uint32_t MAC_add5;\n    uint32_t MAC_add6;\n    uint32_t year;\n    uint32_t month;\n    uint32_t day;\n    uint32_t hour;\n    uint32_t minute;\n    uint32_t sec;\n\n    uint32_t key = 0x2fff;\n\npublic:\n    void set_MAC_add(uint32_t m1, uint32_t m2, uint32_t m3, \n            uint32_t m4, uint32_t m5, uint32_t m6) {\n        MAC_add1 = m1;\n        MAC_add2 = m2;\n        MAC_add3 = m3;\n        MAC_add4 = m4;\n        MAC_add5 = m5;\n        MAC_add6 = m6;\n    }\n\n    void set_year(uint32_t yy) { year = yy; }\n    void set_month(uint32_t mm) { month = mm; }\n    void set_day(uint32_t dd) { day = dd; }\n\n    void set_hour(uint32_t hh) { hour = hh; }\n    void set_minute(uint32_t mi) { minute = mi; }\n    void set_sec(uint32_t se) { sec = se; }\n\n\n    void set_key(uint32_t key_) { key = key_; }\n    void set_Timer0(uint32_t tt) { Timer0 = tt; }\n\n    uint32_t get_MAC_add1() const { return MAC_add1; }\n    uint32_t get_MAC_add2() const { return MAC_add2; }\n    uint32_t get_MAC_add3() const { return MAC_add3; }\n    uint32_t get_MAC_add4() const { return MAC_add4; }\n    uint32_t get_MAC_add5() const { return MAC_add5; }\n    uint32_t get_MAC_add6() const { return MAC_add6; }\n\n    uint32_t get_year() const { return year; }\n    uint32_t get_month() const { return month; }\n    uint32_t get_day() const { return day; }\n    uint32_t get_hour() const { return hour; }\n    uint32_t get_minute() const { return minute; }\n    uint32_t get_sec() const { return sec; }\n    uint32_t get_week() const {\n        return  ((2000+year-(month<3)) + (2000+year-(month<3))\/4 -\n            (2000+year-(month<3))\/100 + (2000+year-(month<3))\/400 +\n            (13*(month+(month<3)*12)+8)\/5 + day) % 7;\n    }\n\n    uint32_t get_nazo1() const { return nazo1; }\n    uint32_t get_nazo2() const { return nazo2; }\n    uint32_t get_nazo3() const { return nazo3; }\n    uint32_t get_nazo4() const { return nazo4; }\n    uint32_t get_nazo5() const { return nazo5; }\n\n    uint32_t get_VCount() const { return VCount; }\n    uint32_t get_Timer0() const { return Timer0; }\n    uint32_t get_GxStat() const { return GxStat; }\n    uint32_t get_Frame() const { return Frame; }\n    uint32_t get_key() const { return key; }\n\n    uint32_t get_Timer0Min() const { return Timer0Min; }\n    uint32_t get_Timer0Max() const { return Timer0Max; }\n\n\n};\ntypedef Parameters5Gen<0x2215f10, 0x221600c, 0x221600c, 0x2216058, 0x2216058, 0x60, 0x6000000, 6, 0xc79, 0xc7a> ParametersB1Ja;\ntypedef Parameters5Gen<0x2215f30, 0x221602c, 0x221602c, 0x2216078, 0x2216078, 0x60, 0x6000000, 6, 0xc68, 0xc69> ParametersW1Ja;\n\n \n} \/\/ end RNGLib\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (c) 2010 Tobias Koenig <tokoe@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 \"dbconfig.h\"\n\n#include \"dbconfigmysql.h\"\n#include \"dbconfigmysqlembedded.h\"\n#include \"dbconfigpostgresql.h\"\n#include \"dbconfigsqlite.h\"\n\n#include \"..\/..\/libs\/xdgbasedirs_p.h\"\n\nusing namespace Akonadi;\n\n\/\/TODO: make me Q_GLOBAL_STATIC\nstatic DbConfig *s_DbConfigInstance = 0;\n\nDbConfig::DbConfig()\n{\n  const QString serverConfigFile = XdgBaseDirs::akonadiServerConfigFile( XdgBaseDirs::ReadWrite );\n  QSettings settings( serverConfigFile, QSettings::IniFormat );\n\n  mSizeThreshold = 4096;\n  const QVariant value = settings.value( QLatin1String( \"General\/SizeThreshold\" ), mSizeThreshold );\n  if ( value.canConvert<qint64>() )\n    mSizeThreshold = value.value<qint64>();\n  else\n    mSizeThreshold = 0;\n\n  if ( mSizeThreshold < 0 )\n    mSizeThreshold = 0;\n\n  mUseExternalPayloadFile = false;\n  mUseExternalPayloadFile = settings.value( QLatin1String( \"General\/ExternalPayload\" ), mUseExternalPayloadFile ).toBool();\n}\n\nDbConfig::~DbConfig()\n{\n}\n\nDbConfig* DbConfig::configuredDatabase()\n{\n  if ( !s_DbConfigInstance ) {\n    const QString serverConfigFile = XdgBaseDirs::akonadiServerConfigFile( XdgBaseDirs::ReadWrite );\n    QSettings settings( serverConfigFile, QSettings::IniFormat );\n\n    \/\/ determine driver to use\n    const QString defaultDriver = QLatin1String( \"QMYSQL\" );\n    QString driverName = settings.value( QLatin1String( \"General\/Driver\" ), defaultDriver ).toString();\n    if ( driverName.isEmpty() )\n      driverName = defaultDriver;\n\n    if ( driverName == QLatin1String( \"QMYSQL\" ) )\n      s_DbConfigInstance = new DbConfigMysql;\n    else if ( driverName == QLatin1String( \"QMYSQL_EMBEDDED\" ) )\n      s_DbConfigInstance = new DbConfigMysqlEmbedded;\n    else if ( driverName == QLatin1String( \"QSQLITE\" ) )\n      s_DbConfigInstance = new DbConfigSqlite( DbConfigSqlite::Default );\n    else if ( driverName == QLatin1String( \"QSQLITE3\" ) )\n      s_DbConfigInstance = new DbConfigSqlite( DbConfigSqlite::Custom );\n    else if ( driverName == QLatin1String( \"QPSQL\" ) )\n      s_DbConfigInstance = new DbConfigPostgresql;\n    else\n      qDebug( \"No sql driver defined!\" );\n  }\n\n  return s_DbConfigInstance;\n}\n\nvoid DbConfig::startInternalServer()\n{\n  \/\/ do nothing\n}\n\nvoid DbConfig::stopInternalServer()\n{\n  \/\/ do nothing\n}\n\nqint64 DbConfig::sizeThreshold() const\n{\n  return mSizeThreshold;\n}\n\nbool DbConfig::useExternalPayloadFile() const\n{\n  return mUseExternalPayloadFile;\n}\n<commit_msg>enable fs payload store by default<commit_after>\/*\n    Copyright (c) 2010 Tobias Koenig <tokoe@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 \"dbconfig.h\"\n\n#include \"dbconfigmysql.h\"\n#include \"dbconfigmysqlembedded.h\"\n#include \"dbconfigpostgresql.h\"\n#include \"dbconfigsqlite.h\"\n\n#include <akdebug.h>\n#include <libs\/xdgbasedirs_p.h>\n\nusing namespace Akonadi;\n\n\/\/TODO: make me Q_GLOBAL_STATIC\nstatic DbConfig *s_DbConfigInstance = 0;\n\nDbConfig::DbConfig()\n{\n  const QString serverConfigFile = XdgBaseDirs::akonadiServerConfigFile( XdgBaseDirs::ReadWrite );\n  QSettings settings( serverConfigFile, QSettings::IniFormat );\n\n  mSizeThreshold = 4096;\n  const QVariant value = settings.value( QLatin1String( \"General\/SizeThreshold\" ), mSizeThreshold );\n  if ( value.canConvert<qint64>() )\n    mSizeThreshold = value.value<qint64>();\n  else\n    mSizeThreshold = 0;\n\n  if ( mSizeThreshold < 0 )\n    mSizeThreshold = 0;\n\n  mUseExternalPayloadFile = true;\n  mUseExternalPayloadFile = settings.value( QLatin1String( \"General\/ExternalPayload\" ), mUseExternalPayloadFile ).toBool();\n}\n\nDbConfig::~DbConfig()\n{\n}\n\nDbConfig* DbConfig::configuredDatabase()\n{\n  if ( !s_DbConfigInstance ) {\n    const QString serverConfigFile = XdgBaseDirs::akonadiServerConfigFile( XdgBaseDirs::ReadWrite );\n    QSettings settings( serverConfigFile, QSettings::IniFormat );\n\n    \/\/ determine driver to use\n    const QString defaultDriver = QLatin1String( \"QMYSQL\" );\n    QString driverName = settings.value( QLatin1String( \"General\/Driver\" ), defaultDriver ).toString();\n    if ( driverName.isEmpty() )\n      driverName = defaultDriver;\n\n    if ( driverName == QLatin1String( \"QMYSQL\" ) )\n      s_DbConfigInstance = new DbConfigMysql;\n    else if ( driverName == QLatin1String( \"QMYSQL_EMBEDDED\" ) )\n      s_DbConfigInstance = new DbConfigMysqlEmbedded;\n    else if ( driverName == QLatin1String( \"QSQLITE\" ) )\n      s_DbConfigInstance = new DbConfigSqlite( DbConfigSqlite::Default );\n    else if ( driverName == QLatin1String( \"QSQLITE3\" ) )\n      s_DbConfigInstance = new DbConfigSqlite( DbConfigSqlite::Custom );\n    else if ( driverName == QLatin1String( \"QPSQL\" ) )\n      s_DbConfigInstance = new DbConfigPostgresql;\n    else\n      akFatal() << \"Unknown database driver: \" << driverName;\n  }\n\n  return s_DbConfigInstance;\n}\n\nvoid DbConfig::startInternalServer()\n{\n  \/\/ do nothing\n}\n\nvoid DbConfig::stopInternalServer()\n{\n  \/\/ do nothing\n}\n\nqint64 DbConfig::sizeThreshold() const\n{\n  return mSizeThreshold;\n}\n\nbool DbConfig::useExternalPayloadFile() const\n{\n  return mUseExternalPayloadFile;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  calcPWP.cpp\n\/\/  \n\/\/\n\/\/  Created by Evan McCartney-Melstad on 1\/10\/15.\n\/\/\n\/\/\n\n#include \"calcPWP.h\"\n#include <iostream>\n#include <vector>\n#include <fstream>\n#include <thread>\n\nint main (void) {\n    return 0;\n}\n\nint calcPWPfromBinaryFile (std::string binaryFile, unsigned long long int numLoci, const int numIndividuals, std::string outFile, int numThreads) {\n    typedef unsigned char BYTE;\n    \n    \/\/****MODIFY THIS TO ONLY READ IN N LOCI AT A TIME, INSTEAD OF USING THE ENTIRE FILE****\n    \n    \n    std::streampos size;\n    std::ifstream file (binaryFile, std::ios::in|std::ios::binary|std::ios::ate);\n    \/\/ifstream file (\"test500k.binary8bitunsigned\", ios::in|ios::binary|ios::ate);\n    if (file.is_open()) {\n        size = file.tellg(); \/\/ Just a variable that shows position of stream--at end since ios::ate, so it's the file size. PROBABLY WON'T WORK FOR FILES LARGER THAN ~ 2GB!\n        file.seekg (0, std::ios::beg); \/\/ Go back to the beginning of the file\n        \/\/file.read((char*)readCounts, size); \/\/ cast to a char* to give to file.read\n        \n        \/\/unsigned char* readCounts;\n        \/\/readCounts = new unsigned char[size];\n        std::vector<unsigned char> readCounts(size);\n        file.read((char*) &readCounts[0], size);\n        file.close();\n        \n        std::cout << \"the entire file content is in memory\" << std::endl;\n        std::cout << \"the total size of the file is \" << size << std::endl;\n        std::cout << \"the number of elements in the readCounts vector is: \" << readCounts.size() << std::endl; \/\/ Will give the total size bytes divided by the size of one element--so it gives the number of elements\n        \n        \/\/ We now have an array of numIndividuals * 2 (major and minor allele) * 1million (loci)\n        \/\/int totalLoci = (int)size \/ (numIndividuals*2); \/\/ The 1 million locus file has 999,999 sites in it (because of header line)\n        \/\/int totalLoci = size\/(272*2);\n        \/\/std::vector< std::vector<long double> > pwp(numIndividuals, std::vector<long double>(numIndividuals,0));\n        \/\/std::vector< std::vector<unsigned long long int> > weightings(numIndividuals, std::vector<unsigned long long int>(numIndividuals,0));\n        \/\/long double pwp[numIndividuals][numIndividuals] = {0.0}; \/\/ This is the matrix that will hold the pwp estimates\n        \/\/unsigned long long int weightings[numIndividuals][numIndividuals] = {0.0}; \/\/ This is the matrix that will hold the weightings--need to use a long long because the values are basically equal to the coverage squared by the end\n        \n        \n        \n        \/* We are going to split the loci between numThreads threads. Each thread will modify two multidimensional\n         vectors of the forms std::vector< std::vector<long double> > pwp(numIndividuals, std::vector<long double>(numIndividuals,0))    and   std::vector< std::vector<unsigned long long int> > weightings(numIndividuals, std::vector<unsigned long long int>(numIndividuals,0))\n         \n         First, we'll generate all of these vectors, which apparently in C++ needs to be constructed of a\n         vector of two-dimensional vectors...\n         *\/\n        std::vector<std::vector<std::vector<long double>>> pwpThreads(numThreads, std::vector<std::vector<long double>> (numIndividuals, std::vector<long double> (numIndividuals,0) ) ); \/\/pwpThreads[0] is the first 2D array for the first thread, etc...\n        std::vector<std::vector<std::vector<unsigned long long int>>> weightingsThreads(numThreads, std::vector<std::vector<unsigned long long int> > (numIndividuals, std::vector<unsigned long long int> (numIndividuals,0) ) );\n        \n        \n        \n        \/\/ Now we need to determine how many loci for each thread. If we want to use the entire binary file, instead of numLoci loci, then change this to lociPerThread = (size\/(numIndividuals*2))\/numThreads\n        \/\/unsigned long long int lociPerThread = numLoci \/ numThreads;\n        unsigned long long int lociPerThread = numLoci;\n        \n        \/\/std::thread t;\n        \/\/std::thread t[numThreads];\n        std::vector<std::thread> threadsVec;\n        for (int threadRunning = 0; threadRunning < numThreads; threadRunning++) {\n            unsigned long long firstLocus = (unsigned long long) threadRunning * lociPerThread;\n            unsigned long long finishingLocus = ((unsigned long long) threadRunning * lociPerThread) + lociPerThread - (unsigned long long)1.0;\n            \n            \n            std::cout << \"Got to the function call\" << std::endl;\n            \/\/calcPWPforRange(firstLocus, finishingLocus, 272, readCounts, pwp, weightings);\n            threadsVec.push_back(std::thread(calcPWPforRange, firstLocus, finishingLocus, std::ref(readCounts), std::ref(pwpThreads[threadRunning]), std::ref(weightingsThreads[threadRunning])));\n            \/\/std::thread t = std::thread(calcPWPforRange, firstLocus, finishingLocus, std::thread(readCounts), std::thread(pwpThreads[threadRunning]), std::thread(weightingsThreads[threadRunning]));\n        }\n        \n        \/\/t.join();\n        \/\/ Wait on threads to finish\n        for (int i = 0; i < numThreads; ++i) {\n            threadsVec[i].join();\n        }\n        \n        \/\/ Now aggregate the results of the threads and print final results\n        std::vector<std::vector<long double>> weightingsSum(272, std::vector<long double>(272,0));\n        std::vector<std::vector<long double>> pwpSum(272, std::vector<long double>(272,0));\n        for (int element = 0; element < 272; element++) {\n            for (int comparisonElement = 0; comparisonElement <= element; comparisonElement++) {\n                for (int threadVector = 0; threadVector <= numThreads; threadVector++) {\n                    weightingsSum[element][comparisonElement] += weightingsThreads[threadVector][element][comparisonElement];\n                    pwpSum[element][comparisonElement] += pwpThreads[threadVector][element][comparisonElement];\n                }\n            }\n        }\n        \n        \/\/ Now print out the final output to the pairwise pi file:\n        std::ofstream pwpOUT (outFile);\n        int rowCounter = 0;\n        if (!pwpOUT) {\n            std::cerr << \"Crap, \" << outFile << \"didn't open!\" << std::endl;\n        } else {\n            for (int tortoise=0; tortoise <= (numIndividuals-1); tortoise++) {\n                for (int comparisonTortoise = 0; comparisonTortoise <= tortoise; comparisonTortoise++) {\n                    rowCounter++;\n                    \n                    \/\/std::cout << \"Made it past the beginning of the last end for loop\" << std::endl;\n                    \/\/std::cout << \"Tortoise numbers: \" << tortoise << \" and \" << comparisonTortoise << std::endl;\n                    if (weightingsSum[tortoise][comparisonTortoise] > 0) {\n                        \/\/std::cout << weightings[tortoise][comparisonTortoise] << std::endl;\n                        \/\/std::cout << pwp[tortoise][comparisonTortoise] \/ weightings[tortoise][comparisonTortoise] << std::endl;\n                        pwpOUT << pwpSum[tortoise][comparisonTortoise] \/ weightingsSum[tortoise][comparisonTortoise] << std::endl;\n                    } else {\n                        pwpOUT << \"NA\" << std::endl;\n                    }\n                }\n            }\n        }\n    } else std::cout << \"Unable to open file\";\n    \n    return 0;\n}\n\n\n\/\/int calcPWPforRange (unsigned long long startingLocus, unsigned long long endingLocus, int numIndividuals, const std::vector<BYTE>& mainReadCountVector, std::vector< std::vector<long double> > & threadPWP, std::vector< std::vector<long double> > & threadWeightings) {\nint calcPWPforRange (unsigned long long startingLocus, unsigned long long endingLocus, int numIndividuals, std::vector<unsigned char>& mainReadCountVector, std::vector<std::vector<long double>>& threadPWP, std::vector<std::vector<unsigned long long int>>& threadWeightings) {\n     \n     std::cout << \"Calculating PWP for the following locus range: \" << startingLocus << \" to \" << endingLocus << std::endl;\n     \n     \/\/usage: calcPWPforRange(0, 1000000, readCounts) \/\/ where readCounts is a vector with all the read count data\n     \/\/this function will return both the pwp calculations for the matrix as well as the weightings, which will later\n     \/\/be summed across all threads\n     \n     for( unsigned long long locus = startingLocus; locus < endingLocus; locus++) {\n     \/\/std::cout << \"Processing locus # \" << locus << std::endl;\n     if (locus % 100000 == 0) {\n     std::cout << locus << \" loci processed through calcPWPfromBinaryFile\" << std::endl;\n     }\n     \n     int coverages[numIndividuals];\n     double *majorAlleleFreqs = new double[numIndividuals]; \/\/ This will hold the major allele frequencies for that locus for each tortoise\n     \n     for( int tortoise = 0; tortoise <= (numIndividuals-1); tortoise++ ) {\n     unsigned long long majorIndex = locus * (numIndividuals*2) + 2 * tortoise;\n     unsigned long long minorIndex = locus * (numIndividuals*2) + 2 * tortoise + 1;\n     \n     \/\/std::cout << \"\\tTrying to access readCounts[\" << minorIndex << \"]\" << \". locus: \" << locus << \". numIndividuals: \" << numIndividuals << \". tortoise: \" << tortoise << std::endl;\n     \n     coverages[tortoise] = int(mainReadCountVector[majorIndex]) + int(mainReadCountVector[minorIndex]); \/\/ Hold the coverages for each locus\n     \/\/std::cout << \"\\t\\tCalced coverage in line 232\" << std::endl;\n     \/\/std::cout << coverages[tortoise] << std::endl;\n     \n     \/\/std::cout << \"Total coverage for tortoise \" << tortoise << \" at locus \" << locus+1 << \": \" << coverages[tortoise] << std::endl;\n     \n     if ( coverages[tortoise] > 0 ) {\n     \/\/std::cout << \"Made it to line 222 for locus \" << locus << std::endl;\n     majorAlleleFreqs[tortoise] = (double)mainReadCountVector[majorIndex] \/ (double)coverages[tortoise]; \/\/ Not necessarily an int, but could be 0 or 1\n     \/\/std::cout << \"Major allele frequency for individual \" << tortoise << \" at locus \" << locus << \": \" << majorAlleleFreqs[tortoise] << std::endl;\n     \/\/std::cout << \"\\t\\t\\tCalced majorAlleleFreqs[\" << tortoise << \"] in line 239\" << std::endl;\n     if (coverages[tortoise] > 1) {\n     unsigned long long locusWeighting = coverages[tortoise]*(coverages[tortoise]-1);\n     threadWeightings[tortoise][tortoise] += (unsigned long long)locusWeighting; \/\/ This is an int--discrete number of reads\n     \/\/std::cout << \"\\t\\t\\t\\tCalced weightings in line 245 for tortoise[\" << tortoise << \"]\" << std::endl;\n     \n     threadPWP[tortoise][tortoise] += double(locusWeighting) * (2.0 * majorAlleleFreqs[tortoise] * (double(coverages[tortoise]) - double(mainReadCountVector[majorIndex]))) \/ (double((coverages[tortoise])-1.0));\n     \/\/std::cout << \"\\t\\t\\t\\t\\tCalced pwp in line 247 for tortoise[\" << tortoise << \"]\" << std::endl;\n     \/\/std::cout << \"Locus self weighting for individual \" << tortoise << \" at locus: \" << locus << \": \" << locusWeighting << \". Locus self PWP: \" << double(locusWeighting) * (2.0 * majorAlleleFreqs[tortoise] * (double(coverages[tortoise]) - double(readCounts[locus * numIndividuals * 2 + 2 * tortoise]))) \/ (double((coverages[tortoise])-1.0)) << std::endl;\n     \/\/std::cout << \"\\tmajorAlleleFreq: \" << majorAlleleFreqs[tortoise] << \". Coverages: \" << double(coverages[tortoise]) << \". readCounts: \" << double(readCounts[locus * numIndividuals * 2 + 2 * tortoise]) << std::endl;\n     \/\/std::cout << \"PWP for self:\" << pwp[tortoise][tortoise] << std::endl;\n     \/\/std::cout << \"Made it to line 233 for locus \" << locus << \". Weightings = \" << weightings[tortoise][tortoise] << \". PWP = \" << pwp[tortoise][tortoise] << std::endl;\n     }\n     \n     \n     for( int comparisonTortoise = 0; comparisonTortoise < tortoise; comparisonTortoise++) {\n     if (coverages[comparisonTortoise] > 0) {\n     \n     \/\/std::cout << \"Coverages for the two comparison individuals: \" << std::to_string((double)coverages[tortoise]) << \" and \" << std::to_string((double)coverages[comparisonTortoise]) << std::endl;\n     \/\/std::cout << \"Major allele freqs for the two comparison individuals: \" << std::to_string(majorAlleleFreqs[tortoise]) << \" and \" << std::to_string(majorAlleleFreqs[comparisonTortoise]) << std::endl;\n     double locusWeighting = (double)coverages[tortoise] * (double)coverages[comparisonTortoise];\n     threadWeightings[tortoise][comparisonTortoise] += locusWeighting;\n     \/\/std::cout << \"locusDiffPWP: \" << (double)locusWeighting * ((double)majorAlleleFreqs[tortoise] * (1-(double)majorAlleleFreqs[comparisonTortoise]) + (double)majorAlleleFreqs[comparisonTortoise] * (1-(double)majorAlleleFreqs[tortoise])) << std::endl;\n     threadPWP[tortoise][comparisonTortoise] += (double)locusWeighting * (majorAlleleFreqs[tortoise] * (1.0-majorAlleleFreqs[comparisonTortoise]) + majorAlleleFreqs[comparisonTortoise] * (1.0-majorAlleleFreqs[tortoise]));\n     \/\/std::cout << \"\\t\\t\\t\\t\\t\\tCalced pwp for tortoise[\" << tortoise << \"] and comparisonTortoise[\" << comparisonTortoise << \"]\" << std::endl;\n     \/\/std::cout << pwp[tortoise][comparisonTortoise] << std::endl;\n     \/\/std::cout << \"Cumulative weightings = \" << weightings[tortoise][comparisonTortoise] << \". Cumulative PWP = \" << pwp[tortoise][comparisonTortoise] << std::endl;\n     }\n     }\n     }\n     }\n     delete[] majorAlleleFreqs; \/\/ Needed to avoid memory leaks\n     \/\/delete[] coverages; \/\/ Since that locus is done, and this variable holds per-locus coverages, we can nuke the coverages to start anew\n     }\n    return 0;\n    \n}\n<commit_msg>Minor changes<commit_after>\/\/\n\/\/  calcPWP.cpp\n\/\/  \n\/\/\n\/\/  Created by Evan McCartney-Melstad on 1\/10\/15.\n\/\/\n\/\/\n\n#include \"calcPWP.h\"\n#include <iostream>\n#include <vector>\n#include <fstream>\n#include <thread>\n\nint main (void) {\n    return 0;\n}\n\nint calcPWPfromBinaryFile (std::string binaryFile, unsigned long long int numLoci, const int numIndividuals, std::string outFile, int numThreads) {\n    \n    \/\/****MODIFY THIS TO ONLY READ IN N LOCI AT A TIME, INSTEAD OF USING THE ENTIRE FILE****\n    \n    \n    std::streampos size;\n    std::ifstream file (binaryFile, std::ios::in|std::ios::binary|std::ios::ate);\n    \/\/ifstream file (\"test500k.binary8bitunsigned\", ios::in|ios::binary|ios::ate);\n    if (file.is_open()) {\n        size = file.tellg(); \/\/ Just a variable that shows position of stream--at end since ios::ate, so it's the file size. PROBABLY WON'T WORK FOR FILES LARGER THAN ~ 2GB!\n        file.seekg (0, std::ios::beg); \/\/ Go back to the beginning of the file\n        \/\/file.read((char*)readCounts, size); \/\/ cast to a char* to give to file.read\n        \n        \/\/unsigned char* readCounts;\n        \/\/readCounts = new unsigned char[size];\n        std::vector<unsigned char> readCounts(size);\n        file.read((char*) &readCounts[0], size);\n        file.close();\n        \n        std::cout << \"the entire file content is in memory\" << std::endl;\n        std::cout << \"the total size of the file is \" << size << std::endl;\n        std::cout << \"the number of elements in the readCounts vector is: \" << readCounts.size() << std::endl; \/\/ Will give the total size bytes divided by the size of one element--so it gives the number of elements\n        \n        \/\/ We now have an array of numIndividuals * 2 (major and minor allele) * 1million (loci)\n        \/\/int totalLoci = (int)size \/ (numIndividuals*2); \/\/ The 1 million locus file has 999,999 sites in it (because of header line)\n        \/\/int totalLoci = size\/(272*2);\n        \/\/std::vector< std::vector<long double> > pwp(numIndividuals, std::vector<long double>(numIndividuals,0));\n        \/\/std::vector< std::vector<unsigned long long int> > weightings(numIndividuals, std::vector<unsigned long long int>(numIndividuals,0));\n        \/\/long double pwp[numIndividuals][numIndividuals] = {0.0}; \/\/ This is the matrix that will hold the pwp estimates\n        \/\/unsigned long long int weightings[numIndividuals][numIndividuals] = {0.0}; \/\/ This is the matrix that will hold the weightings--need to use a long long because the values are basically equal to the coverage squared by the end\n        \n        \n        \n        \/* We are going to split the loci between numThreads threads. Each thread will modify two multidimensional\n         vectors of the forms std::vector< std::vector<long double> > pwp(numIndividuals, std::vector<long double>(numIndividuals,0))    and   std::vector< std::vector<unsigned long long int> > weightings(numIndividuals, std::vector<unsigned long long int>(numIndividuals,0))\n         \n         First, we'll generate all of these vectors, which apparently in C++ needs to be constructed of a\n         vector of two-dimensional vectors...\n         *\/\n        std::vector<std::vector<std::vector<long double>>> pwpThreads(numThreads, std::vector<std::vector<long double>> (numIndividuals, std::vector<long double> (numIndividuals,0) ) ); \/\/pwpThreads[0] is the first 2D array for the first thread, etc...\n        std::vector<std::vector<std::vector<unsigned long long int>>> weightingsThreads(numThreads, std::vector<std::vector<unsigned long long int> > (numIndividuals, std::vector<unsigned long long int> (numIndividuals,0) ) );\n        \n        \n        \n        \/\/ Now we need to determine how many loci for each thread. If we want to use the entire binary file, instead of numLoci loci, then change this to lociPerThread = (size\/(numIndividuals*2))\/numThreads\n        \/\/unsigned long long int lociPerThread = numLoci \/ numThreads;\n        unsigned long long int lociPerThread = numLoci;\n        \n        \/\/std::thread t;\n        \/\/std::thread t[numThreads];\n        std::vector<std::thread> threadsVec;\n        for (int threadRunning = 0; threadRunning < numThreads; threadRunning++) {\n            unsigned long long firstLocus = (unsigned long long) threadRunning * lociPerThread;\n            unsigned long long finishingLocus = ((unsigned long long) threadRunning * lociPerThread) + lociPerThread - (unsigned long long)1.0;\n            \n            \n            std::cout << \"Got to the function call\" << std::endl;\n            \/\/calcPWPforRange(firstLocus, finishingLocus, 272, readCounts, pwp, weightings);\n            threadsVec.push_back(std::thread(calcPWPforRange, firstLocus, finishingLocus, std::ref(readCounts), std::ref(pwpThreads[threadRunning]), std::ref(weightingsThreads[threadRunning])));\n            \/\/std::thread t = std::thread(calcPWPforRange, firstLocus, finishingLocus, std::thread(readCounts), std::thread(pwpThreads[threadRunning]), std::thread(weightingsThreads[threadRunning]));\n        }\n        \n        \/\/t.join();\n        \/\/ Wait on threads to finish\n        for (int i = 0; i < numThreads; ++i) {\n            threadsVec[i].join();\n        }\n        \n        \/\/ Now aggregate the results of the threads and print final results\n        std::vector<std::vector<long double>> weightingsSum(272, std::vector<long double>(272,0));\n        std::vector<std::vector<long double>> pwpSum(272, std::vector<long double>(272,0));\n        for (int element = 0; element < 272; element++) {\n            for (int comparisonElement = 0; comparisonElement <= element; comparisonElement++) {\n                for (int threadVector = 0; threadVector <= numThreads; threadVector++) {\n                    weightingsSum[element][comparisonElement] += weightingsThreads[threadVector][element][comparisonElement];\n                    pwpSum[element][comparisonElement] += pwpThreads[threadVector][element][comparisonElement];\n                }\n            }\n        }\n        \n        \/\/ Now print out the final output to the pairwise pi file:\n        std::ofstream pwpOUT (outFile);\n        int rowCounter = 0;\n        if (!pwpOUT) {\n            std::cerr << \"Crap, \" << outFile << \"didn't open!\" << std::endl;\n        } else {\n            for (int tortoise=0; tortoise <= (numIndividuals-1); tortoise++) {\n                for (int comparisonTortoise = 0; comparisonTortoise <= tortoise; comparisonTortoise++) {\n                    rowCounter++;\n                    \n                    \/\/std::cout << \"Made it past the beginning of the last end for loop\" << std::endl;\n                    \/\/std::cout << \"Tortoise numbers: \" << tortoise << \" and \" << comparisonTortoise << std::endl;\n                    if (weightingsSum[tortoise][comparisonTortoise] > 0) {\n                        \/\/std::cout << weightings[tortoise][comparisonTortoise] << std::endl;\n                        \/\/std::cout << pwp[tortoise][comparisonTortoise] \/ weightings[tortoise][comparisonTortoise] << std::endl;\n                        pwpOUT << pwpSum[tortoise][comparisonTortoise] \/ weightingsSum[tortoise][comparisonTortoise] << std::endl;\n                    } else {\n                        pwpOUT << \"NA\" << std::endl;\n                    }\n                }\n            }\n        }\n    } else std::cout << \"Unable to open file\";\n    \n    return 0;\n}\n\n\n\/\/int calcPWPforRange (unsigned long long startingLocus, unsigned long long endingLocus, int numIndividuals, const std::vector<BYTE>& mainReadCountVector, std::vector< std::vector<long double> > & threadPWP, std::vector< std::vector<long double> > & threadWeightings) {\nint calcPWPforRange (unsigned long long startingLocus, unsigned long long endingLocus, int numIndividuals, std::vector<unsigned char>& mainReadCountVector, std::vector<std::vector<long double>>& threadPWP, std::vector<std::vector<unsigned long long int>>& threadWeightings) {\n    \/*\n     \n     std::cout << \"Calculating PWP for the following locus range: \" << startingLocus << \" to \" << endingLocus << std::endl;\n     \n     \/\/usage: calcPWPforRange(0, 1000000, readCounts) \/\/ where readCounts is a vector with all the read count data\n     \/\/this function will return both the pwp calculations for the matrix as well as the weightings, which will later\n     \/\/be summed across all threads\n     \n     for( unsigned long long locus = startingLocus; locus < endingLocus; locus++) {\n     \/\/std::cout << \"Processing locus # \" << locus << std::endl;\n     if (locus % 100000 == 0) {\n     std::cout << locus << \" loci processed through calcPWPfromBinaryFile\" << std::endl;\n     }\n     \n     int coverages[numIndividuals];\n     double *majorAlleleFreqs = new double[numIndividuals]; \/\/ This will hold the major allele frequencies for that locus for each tortoise\n     \n     for( int tortoise = 0; tortoise <= (numIndividuals-1); tortoise++ ) {\n     unsigned long long majorIndex = locus * (numIndividuals*2) + 2 * tortoise;\n     unsigned long long minorIndex = locus * (numIndividuals*2) + 2 * tortoise + 1;\n     \n     \/\/std::cout << \"\\tTrying to access readCounts[\" << minorIndex << \"]\" << \". locus: \" << locus << \". numIndividuals: \" << numIndividuals << \". tortoise: \" << tortoise << std::endl;\n     \n     coverages[tortoise] = int(mainReadCountVector[majorIndex]) + int(mainReadCountVector[minorIndex]); \/\/ Hold the coverages for each locus\n     \/\/std::cout << \"\\t\\tCalced coverage in line 232\" << std::endl;\n     \/\/std::cout << coverages[tortoise] << std::endl;\n     \n     \/\/std::cout << \"Total coverage for tortoise \" << tortoise << \" at locus \" << locus+1 << \": \" << coverages[tortoise] << std::endl;\n     \n     if ( coverages[tortoise] > 0 ) {\n     \/\/std::cout << \"Made it to line 222 for locus \" << locus << std::endl;\n     majorAlleleFreqs[tortoise] = (double)mainReadCountVector[majorIndex] \/ (double)coverages[tortoise]; \/\/ Not necessarily an int, but could be 0 or 1\n     \/\/std::cout << \"Major allele frequency for individual \" << tortoise << \" at locus \" << locus << \": \" << majorAlleleFreqs[tortoise] << std::endl;\n     \/\/std::cout << \"\\t\\t\\tCalced majorAlleleFreqs[\" << tortoise << \"] in line 239\" << std::endl;\n     if (coverages[tortoise] > 1) {\n     unsigned long long locusWeighting = coverages[tortoise]*(coverages[tortoise]-1);\n     threadWeightings[tortoise][tortoise] += (unsigned long long)locusWeighting; \/\/ This is an int--discrete number of reads\n     \/\/std::cout << \"\\t\\t\\t\\tCalced weightings in line 245 for tortoise[\" << tortoise << \"]\" << std::endl;\n     \n     threadPWP[tortoise][tortoise] += double(locusWeighting) * (2.0 * majorAlleleFreqs[tortoise] * (double(coverages[tortoise]) - double(mainReadCountVector[majorIndex]))) \/ (double((coverages[tortoise])-1.0));\n     \/\/std::cout << \"\\t\\t\\t\\t\\tCalced pwp in line 247 for tortoise[\" << tortoise << \"]\" << std::endl;\n     \/\/std::cout << \"Locus self weighting for individual \" << tortoise << \" at locus: \" << locus << \": \" << locusWeighting << \". Locus self PWP: \" << double(locusWeighting) * (2.0 * majorAlleleFreqs[tortoise] * (double(coverages[tortoise]) - double(readCounts[locus * numIndividuals * 2 + 2 * tortoise]))) \/ (double((coverages[tortoise])-1.0)) << std::endl;\n     \/\/std::cout << \"\\tmajorAlleleFreq: \" << majorAlleleFreqs[tortoise] << \". Coverages: \" << double(coverages[tortoise]) << \". readCounts: \" << double(readCounts[locus * numIndividuals * 2 + 2 * tortoise]) << std::endl;\n     \/\/std::cout << \"PWP for self:\" << pwp[tortoise][tortoise] << std::endl;\n     \/\/std::cout << \"Made it to line 233 for locus \" << locus << \". Weightings = \" << weightings[tortoise][tortoise] << \". PWP = \" << pwp[tortoise][tortoise] << std::endl;\n     }\n     \n     \n     for( int comparisonTortoise = 0; comparisonTortoise < tortoise; comparisonTortoise++) {\n     if (coverages[comparisonTortoise] > 0) {\n     \n     \/\/std::cout << \"Coverages for the two comparison individuals: \" << std::to_string((double)coverages[tortoise]) << \" and \" << std::to_string((double)coverages[comparisonTortoise]) << std::endl;\n     \/\/std::cout << \"Major allele freqs for the two comparison individuals: \" << std::to_string(majorAlleleFreqs[tortoise]) << \" and \" << std::to_string(majorAlleleFreqs[comparisonTortoise]) << std::endl;\n     double locusWeighting = (double)coverages[tortoise] * (double)coverages[comparisonTortoise];\n     threadWeightings[tortoise][comparisonTortoise] += locusWeighting;\n     \/\/std::cout << \"locusDiffPWP: \" << (double)locusWeighting * ((double)majorAlleleFreqs[tortoise] * (1-(double)majorAlleleFreqs[comparisonTortoise]) + (double)majorAlleleFreqs[comparisonTortoise] * (1-(double)majorAlleleFreqs[tortoise])) << std::endl;\n     threadPWP[tortoise][comparisonTortoise] += (double)locusWeighting * (majorAlleleFreqs[tortoise] * (1.0-majorAlleleFreqs[comparisonTortoise]) + majorAlleleFreqs[comparisonTortoise] * (1.0-majorAlleleFreqs[tortoise]));\n     \/\/std::cout << \"\\t\\t\\t\\t\\t\\tCalced pwp for tortoise[\" << tortoise << \"] and comparisonTortoise[\" << comparisonTortoise << \"]\" << std::endl;\n     \/\/std::cout << pwp[tortoise][comparisonTortoise] << std::endl;\n     \/\/std::cout << \"Cumulative weightings = \" << weightings[tortoise][comparisonTortoise] << \". Cumulative PWP = \" << pwp[tortoise][comparisonTortoise] << std::endl;\n     }\n     }\n     }\n     }\n     delete[] majorAlleleFreqs; \/\/ Needed to avoid memory leaks\n     \/\/delete[] coverages; \/\/ Since that locus is done, and this variable holds per-locus coverages, we can nuke the coverages to start anew\n     }\n     *\/\n    return 0;\n    \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*===================================[ Algorithmen und Datenstrukturen]================================================================*\n *\n\n *\n * @Version:\t\t1.0.0\n * @Author:\t\t\tAchim Grolimund (achim.grolimund@hf-ict.info)\n * @Date:\t\t\t01.1.2017\n *\n * @Description:\n\n *\n * Beispiel:\n\n *\n * Anmerkung:\n *\n *\n *==============================================[ EOF RDM ]=============================================================================*\/\n\n#define DEBUG\n#include <bits\/stdc++.h>\n\n#include \"C:\/Users\/achim\/Documents\/Programming\/C++\/HF-ICT-AAD\/myFunks\/myFunks\/myfunks.h\"\n#include \"C:\/Users\/achim\/Documents\/Programming\/C++\/HF-ICT-AAD\/myFunks\/myFunks\/debug.h\"\n\nusing namespace std;\n\nclass Node\n{\n\tpublic:\n\t\tNode * left;\n\t\tNode * right;\n\t\tint value;\n\t\tNode( int value);\n};\n\nNode::Node(int value)  : value(value), left(0), right(0){\n}\n\n\nclass BinaryTree\n{\n\tprivate:\n\t\tNode * root;\n\t\tvoid insert(int v, Node * n);\n\tpublic:\n\t\tBinaryTree();\n\t\tvoid insert(int v);\n\t\tint height();\n};\n\nvoid BinaryTree::insert(int v, Node *n)\n{\n\tif (v < n->value) {\n\t\t\/\/left\n\t\tif (n->left == 0) {\n\t\t\tn->left = new Node(v);\n\t\t}\n\t}else{\n\t\t\/\/right\n\t\tif (n->right == 0) {\n\t\t\tn->right = new Node(v);\n\t\t}else{\n\t\t\tinsert(v,n->right);\n\t\t}\n\t}\n}\n\nvoid BinaryTree::insert(int v){\n\tif (root == 0) {\n\t\troot = new Node(v);\n\t}else{\n\t\tinsert(v,root);\n\t}\n}\n\nint BinaryTree::height()\n{\n\n}\n\n\nint main()\n{\n\tBinaryTree bt;\n\tint values[] {50,25,75,14,7,19,63,89,99,79};\n\n\tfor(int &x : values){\n\t\tbt.insert(x);\n\t}\n\n\treturn 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<commit_msg>Update<commit_after>\/*===================================[ Algorithmen und Datenstrukturen]================================================================*\n *\n\n *\n * @Version:\t\t1.0.0\n * @Author:\t\t\tAchim Grolimund (achim.grolimund@hf-ict.info)\n * @Date:\t\t\t01.1.2017\n *\n * @Description:\n\n *\n * Beispiel:\n\n *\n * Anmerkung:\n *\n *\n *==============================================[ EOF RDM ]=============================================================================*\/\n\n#define DEBUG\n#include <bits\/stdc++.h>\n\n#include \"C:\/Users\/achim\/Documents\/Programming\/C++\/HF-ICT-AAD\/myFunks\/myFunks\/myfunks.h\"\n#include \"C:\/Users\/achim\/Documents\/Programming\/C++\/HF-ICT-AAD\/myFunks\/myFunks\/debug.h\"\n\nusing namespace std;\n\nclass Node {\npublic:\n  Node * left;\n  Node * right;\n  int value;\n  Node(int value);\n};\n\nNode::Node(int value) : left(0), right(0), value(value) {\n}\n\nclass BinaryTree {\nprivate:\n  Node * root;\n  void insert(int v, Node * n);\n  void postOrder(Node * n);\npublic:\n  BinaryTree();\n  void insert(int v);\n  int height(Node *n, int &ch, int &max);\n  void postOrder();\n};\n\nBinaryTree::BinaryTree() : root(0) {\n}\n\nvoid BinaryTree::insert(int v, Node * n) {\n  if (v < n->value) {\n\t\/\/ left\n\tif (n->left == 0) {\n\t  n->left = new Node(v);\n\t} else {\n\t  insert(v, n->left);\n\t}\n  } else {\n\t\/\/ right\n\tif (n->right == 0) {\n\t  n->right = new Node(v);\n\t} else {\n\t  insert(v, n->right);\n\t}\n  }\n}\n\nvoid BinaryTree::postOrder(Node *n)\n{\n\tif(n != 0){\n\t\tpostOrder(n->left);\n\t\tpostOrder(n->right);\n\t\tcout<< n->value<<endl;\n\t}\n}\nvoid BinaryTree::postOrder()\n{\n\tpostOrder(root);\n}\n\nvoid BinaryTree::insert(int v) {\n  if (root == 0) {\n\troot = new Node(v);\n  } else {\n\tinsert(v, root);\n  }\n}\n\nint BinaryTree::height(Node *n, int &ch, int &max)\n{\n\treturn 0;\n}\n\n\n\n\n\nint main() {\n  BinaryTree bt;\n  int values[] = {50, 25, 75, 14, 7, 19, 63, 89, 99, 79};\n  for (int &x : values) {\n\tbt.insert(x);\n  }\n\nbt.postOrder();\n  return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(n)\n\/\/ Space: O(c), c is unique count of pattern and words\n\nclass Solution {\npublic:\n    bool wordPattern(string pattern, string str) {\n        int cnt = str.empty() ? 0 : 1;\n        for (const auto& c : str) {\n            if (c == ' ') {\n                ++cnt;\n            }\n        }\n        if (pattern.size() != cnt) {\n            return false;\n        }\n\n        unordered_map<string, char> w2p;\n        unordered_map<char, string> p2w;\n        int i = 0, j = 0;\n        for (const auto& p : pattern) {\n            j = str.find(\" \", i);\n            if (j == string::npos) {\n                j = str.length();\n            }\n            const string word = str.substr(i, j - i);\n            if (!w2p.count(word) && !p2w.count(p)) { \n                w2p[word] = p; \n                p2w[p] = word; \n            } else if (w2p[word] != p) {\n                return false;\n            }\n            i = j + 1;\n        }\n        return true;\n    }\n};\n<commit_msg>Update word-pattern.cpp<commit_after>\/\/ Time:  O(n)\n\/\/ Space: O(c), c is unique count of pattern and words\n\n\/\/ Time:  O(n)\n\/\/ Space: O(c), c is count of pattern\n\nclass Solution {\npublic:\n    bool wordPattern(string pattern, string str) {\n        int cnt = str.empty() ? 0 : 1;\n        for (const auto& c : str) {\n            if (c == ' ') {\n                ++cnt;\n            }\n        }\n        if (pattern.size() != cnt) {\n            return false;\n        }\n\n        unordered_map<string, char> w2p;\n        unordered_map<char, string> p2w;\n        int i = 0, j = 0;\n        for (const auto& p : pattern) {\n            j = str.find(\" \", i);\n            if (j == string::npos) {\n                j = str.length();\n            }\n            const string w = str.substr(i, j - i);\n            if (!w2p.count(w) && !p2w.count(p)) { \n                w2p[w] = p; \n                p2w[p] = w; \n            } else if (w2p[w] != p) {\n                return false;\n            }\n            i = j + 1;\n        }\n        return true;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ RemotePhotoTool - remote camera control software\n\/\/ Copyright (C) 2008-2016 Michael Fink\n\/\/\n\/\/\/ \\file HuginInterface.cpp Interface to Hugin panorama stitching software\n\/\/\n\n\/\/ includes\n#include \"StdAfx.h\"\n#include \"HuginInterface.hpp\"\n#include \"Path.hpp\"\n#include \"Process.hpp\"\n\nHuginInterface::HuginInterface(const CString& cszInstallPath)\n:m_cszInstallPath(cszInstallPath)\n{\n   if (cszInstallPath.IsEmpty())\n      Detect();\n}\n\nvoid HuginInterface::RunUI(const std::vector<CString>& vecImageFilenames)\n{\n   CString cszCommandLine = Path::Combine(m_cszInstallPath, _T(\"hugin.exe\"));\n\n   CString cszFilename;\n   for (size_t i=0,iMax=vecImageFilenames.size(); i<iMax; i++)\n   {\n      cszFilename = vecImageFilenames[i];\n      cszFilename.TrimLeft(_T('\\\"'));\n      cszFilename.TrimRight(_T('\\\"'));\n\n      cszCommandLine += _T(\" \\\"\");\n      cszCommandLine += cszFilename;\n      cszCommandLine += _T(\"\\\"\");\n   }\n\n   Process process;\n   process.WorkingDirectory(m_cszInstallPath);\n   bool bRet = process.Create(cszCommandLine);\n\n   ATLASSERT(true == bRet); bRet;\n}\n\nvoid HuginInterface::RunStitcher(const CString& cszPtoScript, const CString& cszOutputFile)\n{\n   CString cszCommandLine = Path::Combine(m_cszInstallPath, _T(\"nona.exe\"));\n\n   CString cszFilename(cszOutputFile);\n   cszFilename.TrimLeft(_T('\\\"'));\n   cszFilename.TrimRight(_T('\\\"'));\n\n   cszCommandLine += _T(\"-o \\\"\");\n   cszCommandLine += cszFilename;\n   cszCommandLine += _T(\"\\\" \");\n\n   cszFilename = cszPtoScript;\n   cszFilename.TrimLeft(_T('\\\"'));\n   cszFilename.TrimRight(_T('\\\"'));\n\n   cszCommandLine += _T(\"\\\"\");\n   cszCommandLine += cszFilename;\n   cszCommandLine += _T(\"\\\"\");\n\n   Process process;\n   process.WorkingDirectory(m_cszInstallPath);\n   bool bRet = process.Create(cszCommandLine);\n\n   ATLASSERT(true == bRet); bRet;\n}\n\nvoid HuginInterface::Detect()\n{\n   LPCTSTR apszRegKeys[] =\n   {\n      _T(\"Software\\\\hugin\"), _T(\"startDir\"),\n   };\n\n   CString cszInstallPath;\n   for (int i=0, iMax=sizeof(apszRegKeys)\/sizeof(*apszRegKeys); i<iMax; i+=2)\n   {\n      CRegKey regKey;\n      if (ERROR_SUCCESS != regKey.Open(HKEY_CURRENT_USER, apszRegKeys[i+0], KEY_READ))\n         continue;\n\n      DWORD dwLength = MAX_PATH;\n      LPTSTR pszBuffer = cszInstallPath.GetBuffer(MAX_PATH);\n      regKey.QueryStringValue(apszRegKeys[i+1], pszBuffer, &dwLength);\n      cszInstallPath.ReleaseBuffer();\n\n      if (!cszInstallPath.IsEmpty())\n      {\n         if (cszInstallPath.Right(1) != _T(\"\\\\\"))\n            cszInstallPath += _T(\"\\\\\");\n\n         break;\n      }\n   }\n\n   if (!cszInstallPath.IsEmpty())\n      m_cszInstallPath = cszInstallPath;\n}\n<commit_msg>fixed Hugin path detection; Hugin 2015.0 doesn't write \"startDir\" key anymore, it seems<commit_after>\/\/\n\/\/ RemotePhotoTool - remote camera control software\n\/\/ Copyright (C) 2008-2016 Michael Fink\n\/\/\n\/\/\/ \\file HuginInterface.cpp Interface to Hugin panorama stitching software\n\/\/\n\n\/\/ includes\n#include \"StdAfx.h\"\n#include \"HuginInterface.hpp\"\n#include \"Path.hpp\"\n#include \"Process.hpp\"\n#include <array>\n#include <tuple>\n\nHuginInterface::HuginInterface(const CString& cszInstallPath)\n:m_cszInstallPath(cszInstallPath)\n{\n   if (cszInstallPath.IsEmpty())\n      Detect();\n}\n\nvoid HuginInterface::RunUI(const std::vector<CString>& vecImageFilenames)\n{\n   CString cszCommandLine = Path::Combine(m_cszInstallPath, _T(\"hugin.exe\"));\n\n   CString cszFilename;\n   for (size_t i=0,iMax=vecImageFilenames.size(); i<iMax; i++)\n   {\n      cszFilename = vecImageFilenames[i];\n      cszFilename.TrimLeft(_T('\\\"'));\n      cszFilename.TrimRight(_T('\\\"'));\n\n      cszCommandLine += _T(\" \\\"\");\n      cszCommandLine += cszFilename;\n      cszCommandLine += _T(\"\\\"\");\n   }\n\n   Process process;\n   process.WorkingDirectory(m_cszInstallPath);\n   bool bRet = process.Create(cszCommandLine);\n\n   ATLASSERT(true == bRet); bRet;\n}\n\nvoid HuginInterface::RunStitcher(const CString& cszPtoScript, const CString& cszOutputFile)\n{\n   CString cszCommandLine = Path::Combine(m_cszInstallPath, _T(\"nona.exe\"));\n\n   CString cszFilename(cszOutputFile);\n   cszFilename.TrimLeft(_T('\\\"'));\n   cszFilename.TrimRight(_T('\\\"'));\n\n   cszCommandLine += _T(\"-o \\\"\");\n   cszCommandLine += cszFilename;\n   cszCommandLine += _T(\"\\\" \");\n\n   cszFilename = cszPtoScript;\n   cszFilename.TrimLeft(_T('\\\"'));\n   cszFilename.TrimRight(_T('\\\"'));\n\n   cszCommandLine += _T(\"\\\"\");\n   cszCommandLine += cszFilename;\n   cszCommandLine += _T(\"\\\"\");\n\n   Process process;\n   process.WorkingDirectory(m_cszInstallPath);\n   bool bRet = process.Create(cszCommandLine);\n\n   ATLASSERT(true == bRet); bRet;\n}\n\nvoid HuginInterface::Detect()\n{\n   std::array<std::tuple<HKEY, LPCTSTR, LPCTSTR>, 2> regKeys\n   {\n      std::tuple<HKEY, LPCTSTR, LPCTSTR> {\n         HKEY_CURRENT_USER, _T(\"Software\\\\hugin\"), _T(\"startDir\")\n      },\n      std::tuple<HKEY, LPCTSTR, LPCTSTR> {\n         HKEY_LOCAL_MACHINE, _T(\"Software\\\\WOW6432Node\\\\Microsoft\\\\Windows\\\\CurrentVersion\\\\Uninstall\\\\Hugin\"), _T(\"DisplayIcon\")\n      }\n      \/\/HKEY_CLASSES_ROOT\\Applications\\hugin.exe\\shell\\open\\command\n   };\n\n   CString cszInstallPath;\n   for (int i=0, iMax=regKeys.size(); i<iMax; i++)\n   {\n      CRegKey regKey;\n      if (ERROR_SUCCESS != regKey.Open(std::get<0>(regKeys[i]), std::get<1>(regKeys[i]), KEY_READ))\n         continue;\n\n      DWORD dwLength = MAX_PATH;\n      LPTSTR pszBuffer = cszInstallPath.GetBuffer(MAX_PATH);\n      regKey.QueryStringValue(std::get<2>(regKeys[i]), pszBuffer, &dwLength);\n      cszInstallPath.ReleaseBuffer();\n\n      if (!cszInstallPath.IsEmpty())\n      {\n         CString cszInstallPathLower(cszInstallPath);\n         cszInstallPathLower.MakeLower();\n\n         if (cszInstallPathLower.Find(_T(\".exe\")) != -1)\n            cszInstallPath = Path(cszInstallPath).DirectoryName();\n\n         Path::AddEndingBackslash(cszInstallPath);\n\n         break;\n      }\n   }\n\n   if (!cszInstallPath.IsEmpty())\n      m_cszInstallPath = cszInstallPath;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         PelotonDB\n\/\/\n\/\/ abstract_optimizer.cpp\n\/\/\n\/\/ Identification: \/peloton\/src\/optimizer\/abstract_optimizer.cpp\n\/\/\n\/\/ Copyright (c) 2016, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"optimizer\/abstract_optimizer.h\"\n\nnamespace peloton {\nnamespace optimizer {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Abstract Optimizer\n\/\/===--------------------------------------------------------------------===\/\/\nAbstractOptimizer::AbstractOptimizer(){};\n\nAbstractOptimizer::~AbstractOptimizer(){};\n\nAbstractOptimizer &AbstractOptimizer::GetInstance() {\n  thread_local static AbstractOptimizer abstract_optimizer;\n  return abstract_optimizer;\n}\n\nstd::shared_ptr<planner::AbstractPlan> AbstractOptimizer::GeneratePlan(\n    std::shared_ptr<std::string> plan_tree) {\n  std::cout << \"Just a placeholder for plan tree\" << plan_tree << std::endl;\n  return false;\n}\n\nbool AbstractOptimizer::ShouldOptimize(std::string parse) {\n  std::cout << \"Just a placeholder for prase string \" << parse << std::endl;\n  return false;\n}\n\nstd::shared_ptr<std::string> AbstractOptimizer::TransformParseTreeToOptimizerPlanTree(\n    std::string parse) {\n  std::cout << \"Just a placeholder for prase string \" << parse << std::endl;\n  return NULL;\n}\n\n} \/\/ namespace optimizer\n} \/\/ namespace peloton\n<commit_msg>Modification to pass validation<commit_after>\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         PelotonDB\n\/\/\n\/\/ abstract_optimizer.cpp\n\/\/\n\/\/ Identification: \/peloton\/src\/optimizer\/abstract_optimizer.cpp\n\/\/\n\/\/ Copyright (c) 2016, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"optimizer\/abstract_optimizer.h\"\n\nnamespace peloton {\nnamespace optimizer {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Abstract Optimizer\n\/\/===--------------------------------------------------------------------===\/\/\nAbstractOptimizer::AbstractOptimizer(){};\n\nAbstractOptimizer::~AbstractOptimizer(){};\n\nAbstractOptimizer &AbstractOptimizer::GetInstance() {\n  thread_local static AbstractOptimizer abstract_optimizer;\n  return abstract_optimizer;\n}\n\nstd::shared_ptr<planner::AbstractPlan> AbstractOptimizer::GeneratePlan(\n    std::shared_ptr<std::string> plan_tree) {\n  std::cout << \"Just a placeholder for plan tree\" << plan_tree << std::endl;\n  return false;\n}\n\nbool AbstractOptimizer::ShouldOptimize(std::string parse) {\n  LOG_INFO(\"Just a placeholder for parse string %s\", parse);\n  return false;\n}\n\nstd::shared_ptr<std::string> AbstractOptimizer::TransformParseTreeToOptimizerPlanTree(\n    std::string parse) {\n\tLOG_INFO(\"Just a placeholder for parse string %s\", parse);\n\treturn NULL;\n}\n\n} \/\/ namespace optimizer\n} \/\/ namespace peloton\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ___INANITY_GUI_TYPES_HPP___\n#define ___INANITY_GUI_TYPES_HPP___\n\n#include \"gui.hpp\"\n#include \"..\/inanity-math.hpp\"\n#include \"..\/input\/Key.hpp\"\n#include \"..\/input\/Event.hpp\"\n\nBEGIN_INANITY_GUI\n\n\/\/\/ GUI position type.\ntypedef Math::vec2 Position;\n\/\/\/ GUI size type.\ntypedef Math::vec2 Size;\n\n\/\/\/ Input mouse event type.\n\/** Contains:\nenum Type\nenum Button\n*\/\ntypedef Input::Event::Mouse MouseEvent;\n\n\/\/\/ Keyboard key type.\ntypedef Input::Key Key;\n\nEND_INANITY_GUI\n\n#endif\n<commit_msg>added Gui::Distance type<commit_after>#ifndef ___INANITY_GUI_TYPES_HPP___\n#define ___INANITY_GUI_TYPES_HPP___\n\n#include \"gui.hpp\"\n#include \"..\/inanity-math.hpp\"\n#include \"..\/input\/Key.hpp\"\n#include \"..\/input\/Event.hpp\"\n\nBEGIN_INANITY_GUI\n\n\/\/\/ GUI distance type.\ntypedef float Distance;\n\/\/\/ GUI position type.\ntypedef Math::xvec<Distance, 2> Position;\n\/\/\/ GUI size type.\ntypedef Math::xvec<Distance, 2> Size;\n\n\/\/\/ Input mouse event type.\n\/** Contains:\nenum Type\nenum Button\n*\/\ntypedef Input::Event::Mouse MouseEvent;\n\n\/\/\/ Keyboard key type.\ntypedef Input::Key Key;\n\nEND_INANITY_GUI\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Streaming23_02_16.cpp : Defines the exported functions for the DLL application.\n\/\/\n\n#include \"xHacking.h\"\n#include \"Utilities\/Utilities.h\"\n#include \"Loader\/Loader.h\"\n#include \"Detour\/Detour.h\"\n\n#include <Tools\/utils.h>\n#include <Game\/packet.h>\n#include <Cryptography\/login.h>\n#include <Cryptography\/game.h>\n\nusing namespace xHacking;\nusing namespace Net;\n\n\nDWORD baseAddress = 0x68120C;\nstd::string sessionID;\nUtils::Game::Session session;\n\ninline bool isLogin()\n{\n\tDWORD pointer1 = *(DWORD*)(baseAddress);\n\tDWORD pointer2 = *(DWORD*)(pointer1);\n\treturn *(BYTE*)(pointer2 + 0x31) == 0x00;\n}\n\nDetour<int, int, const char*, int, int>* sendDetour = NULL;\nDetour<int, int, char*, int, int>* recvDetour = NULL;\nint WINAPI nuestro_send(SOCKET s, const char *buf, int len, int flags)\n{\n\tint ret = (*sendDetour)(s, buf, len, flags);\n\t\n\t__asm PUSHAD;\n\t__asm PUSHFD;\n\n\tbool login = isLogin();\n\tPacket* packet = nullptr;\n\tif (login)\n\t{\n\t\tpacket = gFactory->make(PacketType::SERVER_LOGIN, &session, std::string(buf, len));\n\t\tsession.reset();\n\t}\n\telse\n\t{\n\t\tpacket = gFactory->make(PacketType::SERVER_GAME, &session, std::string(buf, len));\n\t}\n\n\tauto packets = packet->decrypt();\n\tfor (auto packet : packets)\n\t{\n\t\tif (!packet.empty())\n\t\t{\n\t\t\tauto tokens = Utils::tokenize(packet);\n\n\t\t\tif (tokens.size() < 2)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tstd::cout << tokens[1] << std::endl;\n\t\t\tif (tokens[1] == \"u_s\" || tokens[1] == \"ncif\" || tokens[1] == \"walk\")\n\t\t\t{\n\t\t\t\tprintf(\"\\nSend:\\n\");\n\t\t\t\tstd::cout << \">> \" << packet << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Set session after decrypting\n\tif (!login && session.id() == -1)\n\t{\n\t\tauto tokens = Utils::tokenize(packets[0]);\n\t\tsession.setID(sessionID);\n\t\tsession.setAlive(Utils::decimal_str2hex(tokens[0]));\n\t}\n\t\n\t__asm POPFD;\n\t__asm POPAD;\n\n\tgFactory->recycle(packet);\n\n\treturn ret;\n}\n\nint WINAPI nuestro_recv(SOCKET s, char *buf, int len, int flags)\n{\n\tint ret = (*recvDetour)(s, buf, len, flags);\n\n\t__asm PUSHAD;\n\t__asm PUSHFD;\n\n\tbool login = isLogin();\n\tPacket* packet = nullptr;\n\tif (login)\n\t{\n\t\tpacket = gFactory->make(PacketType::CLIENT_LOGIN, &session, std::string(buf, ret));\n\t}\n\telse\n\t{\n\t\tpacket = gFactory->make(PacketType::CLIENT_GAME, &session, std::string(buf, ret));\n\t}\n\n\tauto packets = packet->decrypt();\n\tfor (std::string packet : packets)\n\t{\n\t\tif (!packet.empty())\n\t\t{\n\t\t\tauto tokens = Utils::tokenize(packet);\n\t\t\tif (tokens.size() < 1)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (tokens[0] == \"lev\" || tokens[0] == \"fd\" || tokens[0] == \"at\" || tokens[0] == \"c_map\")\n\t\t\t{\n\t\t\t\tprintf(\"\\nRecv:\\n\");\n\t\t\t\tstd::cout << \"<< \" << packet << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\/*\n\tprintf(\"\\nRecv:\\n\");\n\tfor (std::string data : packets)\n\t{\n\t\tstd::cout << \"<< \" << data << std::endl;\n\t}\n*\/\n\n\tif (login)\n\t{\n\t\tauto tokens = Utils::tokenize(packets[0]);\n\t\tsessionID = tokens[1];\n\t}\n\n\tgFactory->recycle(packet);\n\n\t__asm POPFD;\n\t__asm POPAD;\n\n\treturn ret;\n}\n\nvoid Hooks()\n{\n\tsendDetour = new Detour<int, int, const char*, int, int>();\n\tsendDetour->Wait(\"WS2_32.dll\", \"send\", (BYTE*)nuestro_send);\n\n\trecvDetour = new Detour<int, int, char*, int, int>();\n\trecvDetour->Wait(\"wsock32.dll\", \"recv\", (BYTE*)nuestro_recv);\n}\n\nBOOL WINAPI DllMain(HINSTANCE instance, DWORD reason, DWORD reserved)\n{\n\tif (reason == DLL_PROCESS_ATTACH)\n\t{\n\t\t\/\/ Use the xHacking::CreateConsole function\n\t\tCreateConsole();\n\n\t\t\/\/ Call our function\n\t\tHooks();\n\t}\n\n\treturn true;\n}\n<commit_msg>Advanced filtering for the bot<commit_after>#include <iostream>\n#include <thread>\n\n#include \"xHacking.h\"\n#include \"Utilities\/Utilities.h\"\n#include \"Loader\/Loader.h\"\n#include \"Detour\/Detour.h\"\n\n#include <Tools\/utils.h>\n#include <Game\/packet.h>\n#include <Cryptography\/login.h>\n#include <Cryptography\/game.h>\n\nusing namespace xHacking;\nusing namespace Net;\n\n\nbool running;\nstd::thread inputThread;\nstd::vector<std::string> filterSend;\nstd::vector<std::string> filterRecv;\n\n\nDWORD baseAddress = 0x68120C;\nstd::string sessionID;\nUtils::Game::Session session;\n\ninline bool isLogin()\n{\n\tDWORD pointer1 = *(DWORD*)(baseAddress);\n\tDWORD pointer2 = *(DWORD*)(pointer1);\n\treturn *(BYTE*)(pointer2 + 0x31) == 0x00;\n}\n\nDetour<int, int, const char*, int, int>* sendDetour = NULL;\nDetour<int, int, char*, int, int>* recvDetour = NULL;\nint WINAPI nuestro_send(SOCKET s, const char *buf, int len, int flags)\n{\n\tint ret = (*sendDetour)(s, buf, len, flags);\n\t\n\t__asm PUSHAD;\n\t__asm PUSHFD;\n\n\tbool login = isLogin();\n\tPacket* packet = nullptr;\n\tif (login)\n\t{\n\t\tpacket = gFactory->make(PacketType::SERVER_LOGIN, &session, std::string(buf, len));\n\t\tsession.reset();\n\t}\n\telse\n\t{\n\t\tpacket = gFactory->make(PacketType::SERVER_GAME, &session, std::string(buf, len));\n\t}\n\n\tauto packets = packet->decrypt();\n\tfor (auto packet : packets)\n\t{\n\t\tif (!packet.empty())\n\t\t{\n\t\t\tauto tokens = Utils::tokenize(packet);\n\n\t\t\tif (tokens.size() < 2)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/std::cout << tokens[1] << std::endl;\n\t\t\tif (std::find(filterSend.begin(), filterSend.end(), tokens[1]) != filterSend.end())\n\t\t\t{\n\t\t\t\tprintf(\"\\nSend:\\n\");\n\t\t\t\tstd::cout << \">> \" << packet << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Set session after decrypting\n\tif (!login && session.id() == -1)\n\t{\n\t\tauto tokens = Utils::tokenize(packets[0]);\n\t\tsession.setID(sessionID);\n\t\tsession.setAlive(Utils::decimal_str2hex(tokens[0]));\n\t}\n\t\n\t__asm POPFD;\n\t__asm POPAD;\n\n\tgFactory->recycle(packet);\n\n\treturn ret;\n}\n\nint WINAPI nuestro_recv(SOCKET s, char *buf, int len, int flags)\n{\n\tint ret = (*recvDetour)(s, buf, len, flags);\n\n\t__asm PUSHAD;\n\t__asm PUSHFD;\n\n\tbool login = isLogin();\n\tPacket* packet = nullptr;\n\tif (login)\n\t{\n\t\tpacket = gFactory->make(PacketType::CLIENT_LOGIN, &session, std::string(buf, ret));\n\t}\n\telse\n\t{\n\t\tpacket = gFactory->make(PacketType::CLIENT_GAME, &session, std::string(buf, ret));\n\t}\n\n\tauto packets = packet->decrypt();\n\tfor (std::string packet : packets)\n\t{\n\t\tif (!packet.empty())\n\t\t{\n\t\t\tauto tokens = Utils::tokenize(packet);\n\t\t\tif (tokens.size() < 1)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (std::find(filterRecv.begin(), filterRecv.end(), tokens[0]) != filterRecv.end())\n\t\t\t{\n\t\t\t\tprintf(\"\\nRecv:\\n\");\n\t\t\t\tstd::cout << \"<< \" << packet << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (login)\n\t{\n\t\tauto tokens = Utils::tokenize(packets[0]);\n\t\tsessionID = tokens[1];\n\t}\n\n\tgFactory->recycle(packet);\n\n\t__asm POPFD;\n\t__asm POPAD;\n\n\treturn ret;\n}\n\nvoid Hooks()\n{\n\tsendDetour = new Detour<int, int, const char*, int, int>();\n\tsendDetour->Wait(\"WS2_32.dll\", \"send\", (BYTE*)nuestro_send);\n\n\trecvDetour = new Detour<int, int, char*, int, int>();\n\trecvDetour->Wait(\"wsock32.dll\", \"recv\", (BYTE*)nuestro_recv);\n}\n\nvoid processInput()\n{\n\tstd::cout << \"Welcome to ReverseTale-Bot, you can filter packets by issuing:\" << std::endl;\n\tstd::cout << \"\\t<packetOpcode : Adds a recv for `packetOpcode`\" << std::endl;\n\tstd::cout << \"\\t<-packetOpcode : Removes a recv for `packetOpcode`\" << std::endl;\n\tstd::cout << \"\\t>packetOpcode : Adds a send for `packetOpcode`\" << std::endl;\n\tstd::cout << \"\\t>-packetOpcode : Removes a send for `packetOpcode`\" << std::endl;\n\n\twhile (running)\n\t{\n\t\tstd::string input;\n\t\tstd::cout << \"Enter Filter: \";\n\t\tstd::cin >> input;\n\n\t\tif (input.length() > 2)\n\t\t{\n\t\t\tstd::vector<<std::string>* filter;\n\t\t\tbool recv = input[0] == '<';\n\t\t\tbool rem = input[1] == '-';\n\n\t\t\tif (recv)\n\t\t\t{\n\t\t\t\tfilter = &filterRecv;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfilter = &filterSend;\n\t\t\t}\n\n\t\t\tif (rem)\n\t\t\t{\n\t\t\t\tstd::string filter = input.substr(2);\n\t\t\t\tvec.erase(std::remove(vec.begin(), vec.end(), filter), vec.end());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstd::string filter = input.substr(1);\n\t\t\t\tvec.push_back(filter);\n\t\t\t}\n\t\t}\n\t}\n}\n\nBOOL WINAPI DllMain(HINSTANCE instance, DWORD reason, DWORD reserved)\n{\n\tif (reason == DLL_PROCESS_ATTACH)\n\t{\n\t\t\/\/ Use the xHacking::CreateConsole function\n\t\tCreateConsole();\n\n\t\t\/\/ Call our function\n\t\tHooks();\n\n\t\trunning = true;\n\t\tinputThread = std::thread(processInput);\n\t}\n\telse if (reason == DLL_PROCESS_DETTACH)\n\t{\n\t\trunning = false;\n\t\tinputThread.join();\n\t}\n\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * Copyright (C) 2014 Denis Rotanov <drotanov@gmail.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\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#pragma once\n\n#include <string>\n\n#include \"defines.hpp\"\n#include \"type_info.hpp\"\n\nnamespace mflect\n{\n\nenum class pflag : unsigned\n{\n  inplace = 0x01,\n  array = 0x02,\n  pointer = 0x04,\n  identity_mask = 0xffffffff,\n};\n\ninline unsigned operator &(const unsigned lhs, const pflag rhs)\n  { return lhs & static_cast<unsigned>(rhs); }\ninline unsigned operator &(const pflag lhs, const pflag rhs)\n  { return static_cast<unsigned>(lhs) & rhs; }\ninline unsigned operator |(const unsigned lhs, const pflag rhs)\n  { return lhs | static_cast<unsigned>(rhs); }\ninline unsigned operator |(const pflag lhs, const pflag rhs)\n  { return static_cast<unsigned>(lhs) | rhs; }\n\nclass property_info\n{\npublic:\n  \/**\n   * @brief name\n   * @return property name as it was passed to declaration macro.\n   *\/\n  virtual const char* name() const = 0;\n\n  \/**\n   * @brief type_name\n   * @return type name of property disregarding flags\n   *\/\n  virtual const char* type_name() const = 0;\n\n  \/**\n   * @brief owner_type_name\n   * @return type name of owner\n   *\/\n  virtual const char* owner_type_name() const = 0;\n\n  inline bool is_pointer() const;\n  inline bool is_array() const;\n  inline bool is_inplace() const;\n\n  inline virtual void set_value(void* owner, const void* property) const;\n  inline virtual void get_value(const void* owner, void*& value) const;\n  inline virtual void get_value_inplace(void* owner, void*& value) const;\n\n  inline virtual void push_value(void* owner, void* value) const;\n  inline virtual void get_value(const void* owner, void*& value, unsigned index) const;\n\n  inline virtual unsigned array_size(const void* owner) const;\n  inline virtual void clear(void* owner) const;\n\nprotected:\n  inline type_info::property_db_type& type_info_properties_(type_info* typeInfo);\n  inline void not_implemented_(const std::string what) const;\n\n  unsigned flags_;\n};\n\n\/\/==============================================================================\nbool property_info::is_pointer() const\n{\n  return flags_ & pflag::pointer;\n}\n\n\/\/==============================================================================\nbool property_info::is_array() const\n{\n  return flags_ & pflag::array;\n}\n\n\/\/==============================================================================\nbool property_info::is_inplace() const\n{\n  return flags_ & pflag::inplace;\n}\n\n\/\/==============================================================================\nvoid property_info::set_value(void* \/*owner*\/, const void* \/*property*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nvoid property_info::get_value(const void* \/*owner*\/, void*& \/*value*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nvoid property_info::get_value_inplace(void* \/*owner*\/, void*& \/*value*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nvoid property_info::push_value(void* \/*owner*\/, void* \/*value*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nvoid property_info::get_value(const void* \/*owner*\/, void*& \/*value*\/,\n                              unsigned \/*index*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nunsigned property_info::array_size(const void* \/*owner*\/) const\n{\n  not_implemented_(__FUNCTION__);\n  return 0;\n}\n\n\/\/==============================================================================\nvoid property_info::clear(void* \/*owner*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\ntype_info::property_db_type& property_info::type_info_properties_(type_info* typeInfo)\n{\n  return typeInfo->properties_;\n}\n\n\/\/==============================================================================\nvoid property_info::not_implemented_(const std::string what) const\n{\n  MFLECT_RUNTIME_ERROR(std::string(owner_type_name()) + \":\" +\n                       std::string(name()) + \":\" + what + \" not imlpemented\");\n}\n\n} \/\/ namespace mflect\n<commit_msg>fix warnings<commit_after>\/*******************************************************************************\n * Copyright (C) 2014 Denis Rotanov <drotanov@gmail.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\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#pragma once\n\n#include <string>\n\n#include \"defines.hpp\"\n#include \"type_info.hpp\"\n\nnamespace mflect\n{\n\nenum class pflag : unsigned\n{\n  inplace = 0x01,\n  array = 0x02,\n  pointer = 0x04,\n  identity_mask = 0xffffffff,\n};\n\ninline unsigned operator &(const unsigned lhs, const pflag rhs)\n  { return lhs & static_cast<unsigned>(rhs); }\ninline unsigned operator &(const pflag lhs, const pflag rhs)\n  { return static_cast<unsigned>(lhs) & rhs; }\ninline unsigned operator |(const unsigned lhs, const pflag rhs)\n  { return lhs | static_cast<unsigned>(rhs); }\ninline unsigned operator |(const pflag lhs, const pflag rhs)\n  { return static_cast<unsigned>(lhs) | rhs; }\n\nclass property_info\n{\npublic:\n  \/**\n   * @brief name\n   * @return property name as it was passed to declaration macro.\n   *\/\n  virtual const char* name() const = 0;\n\n  \/**\n   * @brief type_name\n   * @return type name of property disregarding flags\n   *\/\n  virtual const char* type_name() const = 0;\n\n  \/**\n   * @brief owner_type_name\n   * @return type name of owner\n   *\/\n  virtual const char* owner_type_name() const = 0;\n\n  inline bool is_pointer() const;\n  inline bool is_array() const;\n  inline bool is_inplace() const;\n\n  inline virtual void set_value(void* owner, const void* property) const;\n  inline virtual void get_value(const void* owner, void*& value) const;\n  inline virtual void get_value_inplace(void* owner, void*& value) const;\n\n  inline virtual void push_value(void* owner, void* value) const;\n  inline virtual void get_value(const void* owner, void*& value, unsigned index) const;\n\n  inline virtual unsigned array_size(const void* owner) const;\n  inline virtual void clear(void* owner) const;\n\nprotected:\n  inline type_info::property_db_type& type_info_properties_(type_info* typeInfo);\n  inline void not_implemented_(const std::string what) const;\n\n  unsigned flags_;\n};\n\n\/\/==============================================================================\nbool property_info::is_pointer() const\n{\n  return (flags_ & pflag::pointer) > 0;\n}\n\n\/\/==============================================================================\nbool property_info::is_array() const\n{\n  return (flags_ & pflag::array) > 0;\n}\n\n\/\/==============================================================================\nbool property_info::is_inplace() const\n{\n  return (flags_ & pflag::inplace) > 0;\n}\n\n\/\/==============================================================================\nvoid property_info::set_value(void* \/*owner*\/, const void* \/*property*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nvoid property_info::get_value(const void* \/*owner*\/, void*& \/*value*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nvoid property_info::get_value_inplace(void* \/*owner*\/, void*& \/*value*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nvoid property_info::push_value(void* \/*owner*\/, void* \/*value*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nvoid property_info::get_value(const void* \/*owner*\/, void*& \/*value*\/,\n                              unsigned \/*index*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\nunsigned property_info::array_size(const void* \/*owner*\/) const\n{\n  not_implemented_(__FUNCTION__);\n  return 0;\n}\n\n\/\/==============================================================================\nvoid property_info::clear(void* \/*owner*\/) const\n{\n  not_implemented_(__FUNCTION__);\n}\n\n\/\/==============================================================================\ntype_info::property_db_type& property_info::type_info_properties_(type_info* typeInfo)\n{\n  return typeInfo->properties_;\n}\n\n\/\/==============================================================================\nvoid property_info::not_implemented_(const std::string what) const\n{\n  MFLECT_RUNTIME_ERROR(std::string(owner_type_name()) + \":\" +\n                       std::string(name()) + \":\" + what + \" not imlpemented\");\n}\n\n} \/\/ namespace mflect\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tST7565(R) LCD ドライバー @n\n\t\t\tCopyright 2016 Kunihito Hiramatsu\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace chip {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ST7565 テンプレートクラス\n\t\t@param[in]\tCSI_IO\tCSI(SPI) 制御クラス\n\t\t@param[in]\tCS\tデバイス選択、レジスター選択、制御クラス\n\t\t@param[in]\tA0\t制御切り替え、レジスター選択、制御クラス\n\t\t@param[in]\tRES\tリセット、制御クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CSI_IO, class CS, class A0, class RES>\n\tclass ST7565 {\n\n\t\tCSI_IO&\tcsi_;\n\n\t\tenum class CMD : uint8_t {\n\t\t\tDISPLAY_OFF = 0xAE,\n\t\t\tDISPLAY_ON  = 0xAF,\n\t\t\tSET_DISP_START_LINE = 0x40,\n\t\t\tSET_PAGE = 0xB0,\n\n\t\t\tSET_COLUMN_UPPER = 0x10,\n\t\t\tSET_COLUMN_LOWER = 0x00,\n\n\t\t\tSET_ADC_NORMAL  = 0xA0,\n\t\t\tSET_ADC_REVERSE = 0xA1,\n\n\t\t\tSET_DISP_NORMAL = 0xA6,\n\t\t\tSET_DISP_REVERSE = 0xA7,\n\n\t\t\tSET_ALLPTS_NORMAL = 0xA4,\n\t\t\tSET_ALLPTS_ON = 0xA5,\n\t\t\tSET_BIAS_9 = 0xA2, \n\t\t\tSET_BIAS_7 = 0xA3,\n\n\t\t\tRMW = 0xE0,\n\t\t\tRMW_CLEAR = 0xEE,\n\t\t\tINTERNAL_RESET = 0xE2,\n\t\t\tSET_COM_NORMAL = 0xC0,\n\t\t\tSET_COM_REVERSE = 0xC8,\n\t\t\tSET_POWER_CONTROL = 0x28,\n\t\t\tSET_RESISTOR_RATIO = 0x20,\n\t\t\tSET_VOLUME_FIRST = 0x81,\n\t\t\tSET_VOLUME_SECOND = 0x00,\n\t\t\tSET_STATIC_OFF = 0xAC,\n\t\t\tSET_STATIC_ON = 0xAD,\n\t\t\tSET_STATIC_REG = 0x00,\n\t\t\tSET_BOOSTER_FIRST = 0xF8,\n\t\t\tSET_BOOSTER_234 = 0,\n\t\t\tSET_BOOSTER_5 = 1,\n\t\t\tSET_BOOSTER_6 = 3,\n\t\t\tNOP = 0xE3,\n\t\t\tTEST = 0xF0,\n\t\t};\n\n\t\tinline void write_(CMD cmd) {\n\t\t\tcsi_.xchg(static_cast<uint8_t>(cmd));\n\t\t}\n\n\t\tinline void write_(CMD cmd, uint8_t ord) {\n\t\t\tcsi_.xchg(static_cast<uint8_t>(cmd) | ord);\n\t\t}\n\n\t\tinline void chip_enable_(bool f = true) const {\n\t\t\tCS::P = !f;\n\t\t}\n\n\t\tinline void reg_select_(bool f) const {\n\t\t\tA0::P = f;\n\t\t}\n\n\n\t\tvoid init_(bool comrvs, bool bias9) {\n\n\t\t\treg_select_(0);\n\t\t\tchip_enable_();\n\n\t\t\t\/\/ toggle RST low to reset; CS low so it'll listen to us\n\t\t\t\/\/ if (cs > 0)\n    \t\t\/\/     digitalWrite(cs, LOW);\n\n\t\t\t\/\/ digitalWrite(rst, LOW);\n\t\t\t\/\/ _delay_ms(500);\n\t\t\t\/\/ digitalWrite(rst, HIGH);\n\n\t\t\twrite_(CMD::DISPLAY_OFF);\n\n\t\t\t\/\/ LCD bias select\n\t\t\tif(bias9) {\n\t\t\t\twrite_(CMD::SET_BIAS_9);\n\t\t\t} else {\n\t\t\t\twrite_(CMD::SET_BIAS_7);\n\t\t\t}\n\t\t\t\/\/ ADC select\n\t\t\twrite_(CMD::SET_ADC_NORMAL);\n\t\t\t\/\/ SHL select\n\t\t\tif(comrvs) {\n\t\t\t\twrite_(CMD::SET_COM_REVERSE);\n\t\t\t} else {\n\t\t\t\twrite_(CMD::SET_COM_NORMAL);\n\t\t\t}\n\n\t\t\t\/\/ Initial display line\n\t\t\twrite_(CMD::SET_DISP_START_LINE);\n\n\t\t\t\/\/ turn on voltage converter (VC=1, VR=0, VF=0)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x4);\n\t\t\t\/\/ wait for 50% rising\n\t\t\tutils::delay::milli_second(50);\n\n\t\t\t\/\/ turn on voltage regulator (VC=1, VR=1, VF=0)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x6);\n\n\t\t\t\/\/ wait >=50ms\n\t\t\tutils::delay::milli_second(50);\n\n\t\t\t\/\/ turn on voltage follower (VC=1, VR=1, VF=1)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x7);\n\n\t\t\t\/\/ wait 10ms\n\t\t\tutils::delay::milli_second(10);\n\n\t\t\t\/\/ set lcd operating voltage (regulator resistor, ref voltage resistor)\n\t\t\twrite_(CMD::SET_RESISTOR_RATIO, 0x6);\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tST7565(CSI_IO& csi) : csi_(csi) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ブライトネス設定\n\t\t\t@param[in]\tval\tブライトネス値\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_brightness(uint8_t val)\n\t\t{\n    \t\twrite_(CMD::SET_VOLUME_FIRST);\n    \t\twrite_(CMD::SET_VOLUME_SECOND, (val & 0x3f));\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  開始\n\t\t\t@param[in]\tcontrast コントラスト\n\t\t\t@param[in]\tcomrvs\tコモンライン・リバースの場合：true\n\t\t\t@param[in]\tbias9\tBIAS9 選択の場合「true」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid start(uint8_t contrast, bool comrvs = false, bool bias9 = false)\n\t\t{\n\t\t\tCS::DIR = 1;  \/\/ (\/CS) output\n\t\t\tA0::DIR = 1;  \/\/ (A0) output\n\t\t\tRES::DIR = 1; \/\/ (\/RES) output\n\n\t\t\tRES::P = 0;  \/\/ assert \/RES signal\n\n\t\t\treg_select_(0);\n\t\t\tchip_enable_(false);\n\n\t\t\tutils::delay::milli_second(100);\n\n\t\t\tRES::P = 1;  \/\/ negate \/RES signal\n\n\t\t\tutils::delay::milli_second(10);\n\n\t\t\tinit_(comrvs, bias9);\n\t\t\twrite_(CMD::DISPLAY_ON);\n\t  \t\twrite_(CMD::SET_ALLPTS_NORMAL);\n\t\t\tset_brightness(contrast);\n\t\t\tchip_enable_(false);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  コピー\n\t\t\t@param[in]\tsrc\tフレームバッファソース\n\t\t\t@param[in]\tnum\t転送ページ数\n\t\t\t@param[in]\tofs\t転送オフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid copy(const uint8_t* src, uint8_t num, uint8_t ofs = 0) {\n\t\t\tchip_enable_();\n\t\t\tuint8_t o = 0x00;\n\t\t\tfor(uint8_t page = ofs; page < (ofs + num); ++page) {\n\t\t\t\treg_select_(0);\n\t\t\t\twrite_(CMD::SET_PAGE, page);\n\t\t\t\twrite_(CMD::SET_COLUMN_LOWER, o & 0x0f);\n\t\t\t\twrite_(CMD::SET_COLUMN_UPPER, o >> 4);\n\t\t\t\treg_select_(1);\n\t\t\t\tcsi_.send(src, 128);\n\t\t\t\tsrc += 128;\n\t\t\t}\n\t\t\treg_select_(0);\n\t\t\tchip_enable_(false);\n\t\t}\n\n\t};\n}\n<commit_msg>update bias<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tST7565(R) LCD ドライバー @n\n\t\t\tCopyright 2016 Kunihito Hiramatsu\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace chip {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ST7565 テンプレートクラス\n\t\t@param[in]\tCSI_IO\tCSI(SPI) 制御クラス\n\t\t@param[in]\tCS\tデバイス選択、レジスター選択、制御クラス\n\t\t@param[in]\tA0\t制御切り替え、レジスター選択、制御クラス\n\t\t@param[in]\tRES\tリセット、制御クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CSI_IO, class CS, class A0, class RES>\n\tclass ST7565 {\n\n\t\tCSI_IO&\tcsi_;\n\n\t\tenum class CMD : uint8_t {\n\t\t\tDISPLAY_OFF = 0xAE,\n\t\t\tDISPLAY_ON  = 0xAF,\n\t\t\tSET_DISP_START_LINE = 0x40,\n\t\t\tSET_PAGE = 0xB0,\n\n\t\t\tSET_COLUMN_UPPER = 0x10,\n\t\t\tSET_COLUMN_LOWER = 0x00,\n\n\t\t\tSET_ADC_NORMAL  = 0xA0,\n\t\t\tSET_ADC_REVERSE = 0xA1,\n\n\t\t\tSET_DISP_NORMAL = 0xA6,\n\t\t\tSET_DISP_REVERSE = 0xA7,\n\n\t\t\tSET_ALLPTS_NORMAL = 0xA4,\n\t\t\tSET_ALLPTS_ON = 0xA5,\n\t\t\tSET_BIAS_9 = 0xA2, \n\t\t\tSET_BIAS_7 = 0xA3,\n\n\t\t\tRMW = 0xE0,\n\t\t\tRMW_CLEAR = 0xEE,\n\t\t\tINTERNAL_RESET = 0xE2,\n\t\t\tSET_COM_NORMAL = 0xC0,\n\t\t\tSET_COM_REVERSE = 0xC8,\n\t\t\tSET_POWER_CONTROL = 0x28,\n\t\t\tSET_RESISTOR_RATIO = 0x20,\n\t\t\tSET_VOLUME_FIRST = 0x81,\n\t\t\tSET_VOLUME_SECOND = 0x00,\n\t\t\tSET_STATIC_OFF = 0xAC,\n\t\t\tSET_STATIC_ON = 0xAD,\n\t\t\tSET_STATIC_REG = 0x00,\n\t\t\tSET_BOOSTER_FIRST = 0xF8,\n\t\t\tSET_BOOSTER_234 = 0,\n\t\t\tSET_BOOSTER_5 = 1,\n\t\t\tSET_BOOSTER_6 = 3,\n\t\t\tNOP = 0xE3,\n\t\t\tTEST = 0xF0,\n\t\t};\n\n\t\tinline void write_(CMD cmd) {\n\t\t\tcsi_.xchg(static_cast<uint8_t>(cmd));\n\t\t}\n\n\t\tinline void write_(CMD cmd, uint8_t ord) {\n\t\t\tcsi_.xchg(static_cast<uint8_t>(cmd) | ord);\n\t\t}\n\n\t\tinline void chip_enable_(bool f = true) const {\n\t\t\tCS::P = !f;\n\t\t}\n\n\t\tinline void reg_select_(bool f) const {\n\t\t\tA0::P = f;\n\t\t}\n\n\n\t\tvoid init_(bool comrvs, bool bias9, uint8_t vratio) {\n\n\t\t\treg_select_(0);\n\t\t\tchip_enable_();\n\n\t\t\t\/\/ toggle RST low to reset; CS low so it'll listen to us\n\t\t\t\/\/ if (cs > 0)\n    \t\t\/\/     digitalWrite(cs, LOW);\n\n\t\t\t\/\/ digitalWrite(rst, LOW);\n\t\t\t\/\/ _delay_ms(500);\n\t\t\t\/\/ digitalWrite(rst, HIGH);\n\n\t\t\twrite_(CMD::DISPLAY_OFF);\n\n\t\t\t\/\/ LCD bias select\n\t\t\tif(bias9) {\n\t\t\t\twrite_(CMD::SET_BIAS_9);\n\t\t\t} else {\n\t\t\t\twrite_(CMD::SET_BIAS_7);\n\t\t\t}\n\t\t\t\/\/ ADC select\n\t\t\twrite_(CMD::SET_ADC_NORMAL);\n\t\t\t\/\/ SHL select\n\t\t\tif(comrvs) {\n\t\t\t\twrite_(CMD::SET_COM_REVERSE);\n\t\t\t} else {\n\t\t\t\twrite_(CMD::SET_COM_NORMAL);\n\t\t\t}\n\n\t\t\t\/\/ Initial display line\n\t\t\twrite_(CMD::SET_DISP_START_LINE);\n\n\t\t\t\/\/ turn on voltage converter (VC=1, VR=0, VF=0)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x4);\n\t\t\t\/\/ wait for 50% rising\n\t\t\tutils::delay::milli_second(50);\n\n\t\t\t\/\/ turn on voltage regulator (VC=1, VR=1, VF=0)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x6);\n\n\t\t\t\/\/ wait >=50ms\n\t\t\tutils::delay::milli_second(50);\n\n\t\t\t\/\/ turn on voltage follower (VC=1, VR=1, VF=1)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x7);\n\n\t\t\t\/\/ wait 10ms\n\t\t\tutils::delay::milli_second(10);\n\n\t\t\t\/\/ set lcd operating voltage (regulator resistor, ref voltage resistor)\n\/\/\/\t\t\twrite_(CMD::SET_RESISTOR_RATIO, 0x6);\n\/\/\/\t\t\twrite_(CMD::SET_RESISTOR_RATIO, 0x3);\n\t\t\twrite_(CMD::SET_RESISTOR_RATIO, vratio);\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tST7565(CSI_IO& csi) : csi_(csi) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ブライトネス設定\n\t\t\t@param[in]\tval\tブライトネス値\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_brightness(uint8_t val)\n\t\t{\n    \t\twrite_(CMD::SET_VOLUME_FIRST);\n    \t\twrite_(CMD::SET_VOLUME_SECOND, (val & 0x3f));\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  開始\n\t\t\t@param[in]\tcontrast コントラスト\n\t\t\t@param[in]\tcomrvs\tコモンライン・リバースの場合：true\n\t\t\t@param[in]\tbias9\tBIAS9 選択の場合「true」\n\t\t\t@param[in]\tvratio\tボルテージ・レシオ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid start(uint8_t contrast, bool comrvs = false, bool bias9 = false, uint8_t vratio = 6)\n\t\t{\n\t\t\tCS::DIR = 1;  \/\/ (\/CS) output\n\t\t\tA0::DIR = 1;  \/\/ (A0) output\n\t\t\tRES::DIR = 1; \/\/ (\/RES) output\n\n\t\t\tRES::P = 0;  \/\/ assert \/RES signal\n\n\t\t\treg_select_(0);\n\t\t\tchip_enable_(false);\n\n\t\t\tutils::delay::milli_second(100);\n\n\t\t\tRES::P = 1;  \/\/ negate \/RES signal\n\n\t\t\tutils::delay::milli_second(10);\n\n\t\t\tinit_(comrvs, bias9, vratio);\n\t\t\twrite_(CMD::DISPLAY_ON);\n\t  \t\twrite_(CMD::SET_ALLPTS_NORMAL);\n\t\t\tset_brightness(contrast);\n\t\t\tchip_enable_(false);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  コピー\n\t\t\t@param[in]\tsrc\tフレームバッファソース\n\t\t\t@param[in]\tnum\t転送ページ数\n\t\t\t@param[in]\tofs\t転送オフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid copy(const uint8_t* src, uint8_t num, uint8_t ofs = 0) {\n\t\t\tchip_enable_();\n\t\t\tuint8_t o = 0x00;\n\t\t\tfor(uint8_t page = ofs; page < (ofs + num); ++page) {\n\t\t\t\treg_select_(0);\n\t\t\t\twrite_(CMD::SET_PAGE, page);\n\t\t\t\twrite_(CMD::SET_COLUMN_LOWER, o & 0x0f);\n\t\t\t\twrite_(CMD::SET_COLUMN_UPPER, o >> 4);\n\t\t\t\treg_select_(1);\n\t\t\t\tcsi_.send(src, 128);\n\t\t\t\tsrc += 128;\n\t\t\t}\n\t\t\treg_select_(0);\n\t\t\tchip_enable_(false);\n\t\t}\n\n\t};\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* \n* Copyright (C) 2010 Toni Gundogdu.\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 \"config.h\"\n\n#include <fstream>\n#include <stdexcept>\n#include <sstream>\n#include <iomanip>\n\n#include <boost\/format.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/filesystem.hpp>\n\n#ifndef foreach\n#define foreach BOOST_FOREACH\n#endif\n\n#include <curl\/curl.h>\n\n#include \"quvicpp\/quvicpp.h\"\n\n#include \"cclive\/options.h\"\n#include \"cclive\/progressbar.h\"\n#include \"cclive\/re.h\"\n#include \"cclive\/error.h\"\n#include \"cclive\/log.h\"\n#include \"cclive\/file.h\"\n\nnamespace cclive {\n\nfile::file ()\n    : _initial_length(0)\n    { }\n\nfile::file (\n    const quvicpp::video& video,\n    const quvicpp::link& link,\n    const int n,\n    const options& opts)\n    : _initial_length(0)\n    { _init (video, link, n, opts); }\n\nfile::file (const file& f)\n    : _initial_length(0)\n    { _swap(f); }\n\nfile&\nfile::operator=(const file& f) {\n    if (this != &f) _swap(f);\n    return *this;\n}\n\nvoid\nfile::_swap (const file& f) {\n    _name           = f._name;\n    _path           = f._path;\n    _initial_length = f._initial_length;\n}\n\n#define E \"server response code %ld, expected 200 or 206 (conn_code=%ld)\"\n\nstatic std::string\nformat_unexpected_http_error (const long resp_code, const long conn_code)\n    { return (boost::format (E) % resp_code % conn_code).str (); }\n\n#undef E\n\n#define E \"%s (curl_code=%ld, resp_code=%ld, conn_code=%ld)\"\n\nstatic std::string\nformat_error (\n    const CURLcode curl_code,\n    const long resp_code,\n    const long conn_code)\n{\n    const std::string e = curl_easy_strerror (curl_code);\n    return (boost::format (E) % e % curl_code % resp_code % conn_code).str ();\n}\n\n#undef E\n\nstatic size_t\nwrite_cb (void *data, size_t size, size_t nmemb, void *ptr) {\n    std::ofstream *o   = reinterpret_cast<std::ofstream*>(ptr);\n    const size_t rsize = size*nmemb;\n    o->write (static_cast<char*>(data), rsize);\n    o->flush ();\n    return rsize;\n}\n\nstatic int\nprogress_cb (void *ptr, double, double now, double, double) {\n    reinterpret_cast<progressbar*>(ptr)->update (now);\n    return 0;\n}\n\nnamespace po = boost::program_options;\n\nbool\nfile::write (\n    const quvicpp::query& q,\n    const quvicpp::link& l,\n    const options& opts) const\n{\n    CURL *curl = q.curlHandle();\n\n    curl_easy_setopt (curl, CURLOPT_URL, l.url().c_str());\n    curl_easy_setopt (curl, CURLOPT_WRITEFUNCTION, write_cb);\n\n    const po::variables_map map  = opts.map();\n    std::ios_base::openmode mode = std::ofstream::binary;\n\n    if ( map.count (\"overwrite\") )\n        mode |= std::ofstream::trunc;\n    else {\n        if ( _should_continue() )\n            mode |= std::ofstream::app;\n    }\n\n    std::ofstream out( _path.c_str(), mode );\n\n    if ( out.fail() ) {\n\n        std::string s = _path + \": \";\n\n        if (errno)\n            s += cclive::perror ();\n        else\n            s += \"unknown file open error\";\n\n        throw std::runtime_error (s);\n    }\n\n    curl_easy_setopt (curl, CURLOPT_WRITEDATA, &out);\n\n    curl_easy_setopt (curl, CURLOPT_ENCODING, \"identity\");\n    curl_easy_setopt (curl, CURLOPT_HEADER, 0L);\n\n    progressbar pb (*this, l, opts);\n    curl_easy_setopt (curl, CURLOPT_PROGRESSDATA, &pb);\n    curl_easy_setopt (curl, CURLOPT_NOPROGRESS, 0L);\n    curl_easy_setopt (curl, CURLOPT_PROGRESSFUNCTION, progress_cb);\n\n    curl_off_t resume_from = static_cast<curl_off_t>(_initial_length);\n    curl_easy_setopt (curl, CURLOPT_RESUME_FROM_LARGE, resume_from);\n\n    curl_easy_setopt (curl, CURLOPT_CONNECTTIMEOUT,\n        map[\"connect-timeout\"].as<int>());\n\n    curl_easy_setopt (curl, CURLOPT_TIMEOUT,\n        map[\"transfer-timeout\"].as<int>());\n\n    curl_easy_setopt (curl, CURLOPT_DNS_CACHE_TIMEOUT,\n        map[\"dns-cache-timeout\"].as<int>());\n\n    curl_off_t throttle = map[\"throttle\"].as<int>()*1024;\n    curl_easy_setopt (curl, CURLOPT_MAX_RECV_SPEED_LARGE, throttle);\n\n    const CURLcode rc = curl_easy_perform (curl);\n\n    \/\/ Restore curl settings.\n\n    curl_easy_setopt (curl, CURLOPT_HEADER, 1L);\n    curl_easy_setopt (curl, CURLOPT_NOPROGRESS, 1L);\n    curl_easy_setopt (curl, CURLOPT_RESUME_FROM_LARGE, 0L);\n    curl_easy_setopt (curl, CURLOPT_MAX_RECV_SPEED_LARGE,\n        static_cast<curl_off_t>(0L));\n\n    out.flush();\n    out.close();\n\n    long resp_code = 0;\n    long conn_code = 0;\n\n    curl_easy_getinfo (curl,\n        CURLINFO_RESPONSE_CODE, &resp_code);\n\n    curl_easy_getinfo (curl,\n        CURLINFO_HTTP_CONNECTCODE, &conn_code);\n\n    std::string error;\n\n    if (CURLE_OK == rc) {\n        if (resp_code != 200 && resp_code != 206)\n            error = format_unexpected_http_error (resp_code, conn_code);\n    }\n    else {\n        error = format_error (rc, resp_code, conn_code);\n    }\n\n    if ( !error.empty() ) {\n\n        cclive::log << std::endl;\n\n        if (resp_code >= 400 && resp_code <= 500)\n            throw std::runtime_error (error);\n        else\n            std::clog << \"error: \" << error << std::endl;\n\n        return false; \/\/ Retry.\n    }\n\n    pb.finish();\n\n    cclive::log << std::endl;\n\n    return true;\n}\n\ndouble file::initial_length   () const { return _initial_length; }\nconst std::string& file::path () const { return _path; }\nbool file::_should_continue   () const { return _initial_length > 0; }\n\nstatic double\nto_mb (const double bytes) { return bytes\/(1024*1024); }\n\nstd::string\nfile::to_s (const quvicpp::link& link) const {\n\n    const double length = to_mb (link.length ());\n\n    boost::format fmt = boost::format(\"%s  %.2fM  [%s]\")\n        % _name % length % link.content_type ();\n\n    return fmt.str();\n}\n\nnamespace fs = boost::filesystem;\n\nvoid\nfile::_init (\n    const quvicpp::video& video,\n    const quvicpp::link& link,\n    const int n,\n    const options& opts)\n{\n    const po::variables_map map = opts.map();\n\n    if (map.count(\"output-file\")) {\n\n        const std::string output_file =\n            map[\"output-file\"].as<std::string>();\n\n        const fs::path p =\n            fs::system_complete (fs::path(output_file));\n\n        _name           = p.filename();\n        _path           = p.string();\n        _initial_length = file::exists (_path);\n\n        if ( _initial_length >= link.length() && !map.count(\"overwrite\") )\n            throw std::runtime_error (\"nothing todo\");\n    }\n\n    else {\n\n        std::string title  = video.title();\n\n        \/\/ Apply --regexp to title.\n\n        cclive::re::match (map[\"regexp\"].as<std::string>(), title);\n\n        cclive::re::trim (title);\n\n        \/\/ --filename-format\n\n        std::string fname_format =\n            map[\"filename-format\"].as<std::string>();\n\n        boost::format fmt;\n\n        fmt = boost::format(\"s{%%i}{%1%}g\") % video.id();\n        cclive::re::subst (fmt.str(), fname_format);\n\n        fmt = boost::format(\"s{%%t}{%1%}g\") % title;\n        cclive::re::subst (fmt.str(), fname_format);\n\n        fmt = boost::format(\"s{%%s}{%1%}g\") % link.suffix();\n        cclive::re::subst (fmt.str(), fname_format);\n\n        fmt = boost::format(\"s{%%h}{%1%}g\") % video.host();\n        cclive::re::subst (fmt.str(), fname_format);\n\n        if (map.count(\"subst\")) {\n\n            std::istringstream iss(map[\"subst\"].as<std::string>());\n            std::vector<std::string> v;\n\n            std::copy(\n                std::istream_iterator<std::string >(iss),\n                std::istream_iterator<std::string >(),\n                std::back_inserter<std::vector<std::string> >(v)\n            );\n\n            foreach (std::string s, v)\n                cclive::re::subst (s, fname_format);\n        }\n\n        std::stringstream b;\n\n        b << fname_format;\n\n        \/\/ A multi-segment video.\n\n        if (n > 1) b << \"_\" << n;\n\n        \/\/ Path, name.\n\n        fs::path p( fs::system_complete (b.str()) );\n\n        _name = p.filename();\n        _path = p.string();\n\n        if ( !map.count (\"overwrite\") ) {\n\n            for (int i=0; i<INT_MAX; ++i) {\n\n                _initial_length = file::exists (_path);\n\n                if (!_initial_length)\n                    break;\n\n                else if (_initial_length >= link.length())\n                    throw std::runtime_error (\"nothing todo\");\n\n                else {\n                    if (map.count(\"continue\"))\n                        break;\n\n                }\n\n                boost::format fmt =\n                    boost::format (\"%1%.%2%\") % b.str() % i;\n\n                p     = fs::system_complete( fmt.str() );\n                _name = p.filename();\n                _path = p.string();\n            }\n        }\n    }\n\n    if ( map.count(\"overwrite\") )\n        _initial_length = 0;\n}\n\ndouble\nfile::exists (const std::string& path) {\n\n    fs::path p( fs::system_complete(path) );\n\n    double size = 0;\n\n    if (fs::exists(p))\n        size = static_cast<double>(fs::file_size(p));\n\n    return size;\n}\n\n} \/\/ End namespace.\n\n\n<commit_msg>change \"nothing todo\" to more understandable error.<commit_after>\/* \n* Copyright (C) 2010 Toni Gundogdu.\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 \"config.h\"\n\n#include <fstream>\n#include <stdexcept>\n#include <sstream>\n#include <iomanip>\n\n#include <boost\/format.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/filesystem.hpp>\n\n#ifndef foreach\n#define foreach BOOST_FOREACH\n#endif\n\n#include <curl\/curl.h>\n\n#include \"quvicpp\/quvicpp.h\"\n\n#include \"cclive\/options.h\"\n#include \"cclive\/progressbar.h\"\n#include \"cclive\/re.h\"\n#include \"cclive\/error.h\"\n#include \"cclive\/log.h\"\n#include \"cclive\/file.h\"\n\nnamespace cclive {\n\nfile::file ()\n    : _initial_length(0)\n    { }\n\nfile::file (\n    const quvicpp::video& video,\n    const quvicpp::link& link,\n    const int n,\n    const options& opts)\n    : _initial_length(0)\n    { _init (video, link, n, opts); }\n\nfile::file (const file& f)\n    : _initial_length(0)\n    { _swap(f); }\n\nfile&\nfile::operator=(const file& f) {\n    if (this != &f) _swap(f);\n    return *this;\n}\n\nvoid\nfile::_swap (const file& f) {\n    _name           = f._name;\n    _path           = f._path;\n    _initial_length = f._initial_length;\n}\n\n#define E \"server response code %ld, expected 200 or 206 (conn_code=%ld)\"\n\nstatic std::string\nformat_unexpected_http_error (const long resp_code, const long conn_code)\n    { return (boost::format (E) % resp_code % conn_code).str (); }\n\n#undef E\n\n#define E \"%s (curl_code=%ld, resp_code=%ld, conn_code=%ld)\"\n\nstatic std::string\nformat_error (\n    const CURLcode curl_code,\n    const long resp_code,\n    const long conn_code)\n{\n    const std::string e = curl_easy_strerror (curl_code);\n    return (boost::format (E) % e % curl_code % resp_code % conn_code).str ();\n}\n\n#undef E\n\nstatic size_t\nwrite_cb (void *data, size_t size, size_t nmemb, void *ptr) {\n    std::ofstream *o   = reinterpret_cast<std::ofstream*>(ptr);\n    const size_t rsize = size*nmemb;\n    o->write (static_cast<char*>(data), rsize);\n    o->flush ();\n    return rsize;\n}\n\nstatic int\nprogress_cb (void *ptr, double, double now, double, double) {\n    reinterpret_cast<progressbar*>(ptr)->update (now);\n    return 0;\n}\n\nnamespace po = boost::program_options;\n\nbool\nfile::write (\n    const quvicpp::query& q,\n    const quvicpp::link& l,\n    const options& opts) const\n{\n    CURL *curl = q.curlHandle();\n\n    curl_easy_setopt (curl, CURLOPT_URL, l.url().c_str());\n    curl_easy_setopt (curl, CURLOPT_WRITEFUNCTION, write_cb);\n\n    const po::variables_map map  = opts.map();\n    std::ios_base::openmode mode = std::ofstream::binary;\n\n    if ( map.count (\"overwrite\") )\n        mode |= std::ofstream::trunc;\n    else {\n        if ( _should_continue() )\n            mode |= std::ofstream::app;\n    }\n\n    std::ofstream out( _path.c_str(), mode );\n\n    if ( out.fail() ) {\n\n        std::string s = _path + \": \";\n\n        if (errno)\n            s += cclive::perror ();\n        else\n            s += \"unknown file open error\";\n\n        throw std::runtime_error (s);\n    }\n\n    curl_easy_setopt (curl, CURLOPT_WRITEDATA, &out);\n\n    curl_easy_setopt (curl, CURLOPT_ENCODING, \"identity\");\n    curl_easy_setopt (curl, CURLOPT_HEADER, 0L);\n\n    progressbar pb (*this, l, opts);\n    curl_easy_setopt (curl, CURLOPT_PROGRESSDATA, &pb);\n    curl_easy_setopt (curl, CURLOPT_NOPROGRESS, 0L);\n    curl_easy_setopt (curl, CURLOPT_PROGRESSFUNCTION, progress_cb);\n\n    curl_off_t resume_from = static_cast<curl_off_t>(_initial_length);\n    curl_easy_setopt (curl, CURLOPT_RESUME_FROM_LARGE, resume_from);\n\n    curl_easy_setopt (curl, CURLOPT_CONNECTTIMEOUT,\n        map[\"connect-timeout\"].as<int>());\n\n    curl_easy_setopt (curl, CURLOPT_TIMEOUT,\n        map[\"transfer-timeout\"].as<int>());\n\n    curl_easy_setopt (curl, CURLOPT_DNS_CACHE_TIMEOUT,\n        map[\"dns-cache-timeout\"].as<int>());\n\n    curl_off_t throttle = map[\"throttle\"].as<int>()*1024;\n    curl_easy_setopt (curl, CURLOPT_MAX_RECV_SPEED_LARGE, throttle);\n\n    const CURLcode rc = curl_easy_perform (curl);\n\n    \/\/ Restore curl settings.\n\n    curl_easy_setopt (curl, CURLOPT_HEADER, 1L);\n    curl_easy_setopt (curl, CURLOPT_NOPROGRESS, 1L);\n    curl_easy_setopt (curl, CURLOPT_RESUME_FROM_LARGE, 0L);\n    curl_easy_setopt (curl, CURLOPT_MAX_RECV_SPEED_LARGE,\n        static_cast<curl_off_t>(0L));\n\n    out.flush();\n    out.close();\n\n    long resp_code = 0;\n    long conn_code = 0;\n\n    curl_easy_getinfo (curl,\n        CURLINFO_RESPONSE_CODE, &resp_code);\n\n    curl_easy_getinfo (curl,\n        CURLINFO_HTTP_CONNECTCODE, &conn_code);\n\n    std::string error;\n\n    if (CURLE_OK == rc) {\n        if (resp_code != 200 && resp_code != 206)\n            error = format_unexpected_http_error (resp_code, conn_code);\n    }\n    else {\n        error = format_error (rc, resp_code, conn_code);\n    }\n\n    if ( !error.empty() ) {\n\n        cclive::log << std::endl;\n\n        if (resp_code >= 400 && resp_code <= 500)\n            throw std::runtime_error (error);\n        else\n            std::clog << \"error: \" << error << std::endl;\n\n        return false; \/\/ Retry.\n    }\n\n    pb.finish();\n\n    cclive::log << std::endl;\n\n    return true;\n}\n\ndouble file::initial_length   () const { return _initial_length; }\nconst std::string& file::path () const { return _path; }\nbool file::_should_continue   () const { return _initial_length > 0; }\n\nstatic double\nto_mb (const double bytes) { return bytes\/(1024*1024); }\n\nstd::string\nfile::to_s (const quvicpp::link& link) const {\n\n    const double length = to_mb (link.length ());\n\n    boost::format fmt = boost::format(\"%s  %.2fM  [%s]\")\n        % _name % length % link.content_type ();\n\n    return fmt.str();\n}\n\n#define E_NOTHINGTODO \"video completely retrieved already\"\n\nnamespace fs = boost::filesystem;\n\nvoid\nfile::_init (\n    const quvicpp::video& video,\n    const quvicpp::link& link,\n    const int n,\n    const options& opts)\n{\n    const po::variables_map map = opts.map();\n\n    if (map.count(\"output-file\")) {\n\n        const std::string output_file =\n            map[\"output-file\"].as<std::string>();\n\n        const fs::path p =\n            fs::system_complete (fs::path(output_file));\n\n        _name           = p.filename();\n        _path           = p.string();\n        _initial_length = file::exists (_path);\n\n        if ( _initial_length >= link.length() && !map.count(\"overwrite\") )\n            throw std::runtime_error (E_NOTHINGTODO);\n    }\n\n    else {\n\n        std::string title  = video.title();\n\n        \/\/ Apply --regexp to title.\n\n        cclive::re::match (map[\"regexp\"].as<std::string>(), title);\n\n        cclive::re::trim (title);\n\n        \/\/ --filename-format\n\n        std::string fname_format =\n            map[\"filename-format\"].as<std::string>();\n\n        boost::format fmt;\n\n        fmt = boost::format(\"s{%%i}{%1%}g\") % video.id();\n        cclive::re::subst (fmt.str(), fname_format);\n\n        fmt = boost::format(\"s{%%t}{%1%}g\") % title;\n        cclive::re::subst (fmt.str(), fname_format);\n\n        fmt = boost::format(\"s{%%s}{%1%}g\") % link.suffix();\n        cclive::re::subst (fmt.str(), fname_format);\n\n        fmt = boost::format(\"s{%%h}{%1%}g\") % video.host();\n        cclive::re::subst (fmt.str(), fname_format);\n\n        if (map.count(\"subst\")) {\n\n            std::istringstream iss(map[\"subst\"].as<std::string>());\n            std::vector<std::string> v;\n\n            std::copy(\n                std::istream_iterator<std::string >(iss),\n                std::istream_iterator<std::string >(),\n                std::back_inserter<std::vector<std::string> >(v)\n            );\n\n            foreach (std::string s, v)\n                cclive::re::subst (s, fname_format);\n        }\n\n        std::stringstream b;\n\n        b << fname_format;\n\n        \/\/ A multi-segment video.\n\n        if (n > 1) b << \"_\" << n;\n\n        \/\/ Path, name.\n\n        fs::path p( fs::system_complete (b.str()) );\n\n        _name = p.filename();\n        _path = p.string();\n\n        if ( !map.count (\"overwrite\") ) {\n\n            for (int i=0; i<INT_MAX; ++i) {\n\n                _initial_length = file::exists (_path);\n\n                if (!_initial_length)\n                    break;\n\n                else if (_initial_length >= link.length())\n                    throw std::runtime_error (E_NOTHINGTODO);\n\n                else {\n                    if (map.count(\"continue\"))\n                        break;\n\n                }\n\n                boost::format fmt =\n                    boost::format (\"%1%.%2%\") % b.str() % i;\n\n                p     = fs::system_complete( fmt.str() );\n                _name = p.filename();\n                _path = p.string();\n            }\n        }\n    }\n\n    if ( map.count(\"overwrite\") )\n        _initial_length = 0;\n}\n\n#undef E_NOTHINGTODO\n\ndouble\nfile::exists (const std::string& path) {\n\n    fs::path p( fs::system_complete(path) );\n\n    double size = 0;\n\n    if (fs::exists(p))\n        size = static_cast<double>(fs::file_size(p));\n\n    return size;\n}\n\n} \/\/ End namespace.\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2008 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 <osgDB\/FileUtils>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/ReadFile>\n#include <osgDB\/WriteFile>\n#include <osgDB\/Registry>\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iterator>\n\n#include <zlib.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  ReaderWriterGZ\n\/\/\nclass ReaderWriterGZ : public osgDB::ReaderWriter\n{\n    public:\n\n        enum ObjectType\n        {\n            OBJECT,\n            ARCHIVE,\n            IMAGE,\n            HEIGHTFIELD,\n            NODE\n        };\n\n        ReaderWriterGZ();\n\n        ~ReaderWriterGZ();\n\n        virtual const char* className() const { return \"HTTP Protocol Model Reader\"; }\n\n        virtual ReadResult openArchive(const std::string& fileName,ArchiveStatus status, unsigned int , const Options* options) const\n        {\n            if (status!=READ) return ReadResult(ReadResult::FILE_NOT_HANDLED);\n            else return readFile(ARCHIVE,fileName,options);\n        }\n\n        virtual ReadResult readObject(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return readFile(OBJECT,fileName,options);\n        }\n\n        virtual ReadResult readImage(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return readFile(IMAGE,fileName,options);\n        }\n\n        virtual ReadResult readHeightField(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return readFile(HEIGHTFIELD,fileName,options);\n        }\n\n        virtual ReadResult readNode(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return readFile(NODE,fileName,options);\n        }\n\n        ReadResult readFile(ObjectType objectType, osgDB::ReaderWriter* rw, std::istream& fin, const osgDB::ReaderWriter::Options* options) const;\n\n        ReadResult readFile(ObjectType objectType, const std::string& fullFileName, const osgDB::ReaderWriter::Options* options) const;\n\n\n\n        virtual WriteResult writeObject(const osg::Object& obj, const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return writeFile(OBJECT, &obj, fileName, options);\n        }\n\n        virtual WriteResult writeImage(const osg::Image& image, const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return writeFile(IMAGE, &image, fileName, options);\n        }\n\n        virtual WriteResult writeHeightField(const osg::HeightField& hf, const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return writeFile(HEIGHTFIELD, &hf, fileName, options);\n        }\n\n        virtual WriteResult writeNode(const osg::Node& node, const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return writeFile(NODE, &node, fileName,options);\n        }\n\n        WriteResult writeFile(ObjectType objectType, const osg::Object* object, osgDB::ReaderWriter* rw, std::ostream& fin, const osgDB::ReaderWriter::Options* options) const;\n\n        WriteResult writeFile(ObjectType objectType, const osg::Object* object, const std::string& fullFileName, const osgDB::ReaderWriter::Options* options) const;\n\n\n        bool read(std::istream& fin, std::string& destination) const;\n        bool write(std::ostream& fout, const std::string& source) const;\n\n\n};\n\nReaderWriterGZ::ReaderWriterGZ()\n{\n    \/\/ OSG_NOTICE<<\"ReaderWriterGZ::ReaderWriterGZ()\"<<std::endl;\n\n    supportsExtension(\"osgz\",\"Compressed .osg file extension.\");\n    supportsExtension(\"ivez\",\"Compressed .ive file extension.\");\n    supportsExtension(\"gz\",\"Compressed file extension.\");\n}\n\nReaderWriterGZ::~ReaderWriterGZ()\n{\n    \/\/ OSG_NOTICE<<\"ReaderWriterGZ::~ReaderWriterGZ()\"<<std::endl;\n}\n\nosgDB::ReaderWriter::ReadResult ReaderWriterGZ::readFile(ObjectType objectType, osgDB::ReaderWriter* rw, std::istream& fin, const osgDB::ReaderWriter::Options *options) const\n{\n    switch(objectType)\n    {\n        case(OBJECT): return rw->readObject(fin,options);\n        case(ARCHIVE): return rw->openArchive(fin,options);\n        case(IMAGE): return rw->readImage(fin,options);\n        case(HEIGHTFIELD): return rw->readHeightField(fin,options);\n        case(NODE): return rw->readNode(fin,options);\n        default: break;\n    }\n    return ReadResult::FILE_NOT_HANDLED;\n}\n\nosgDB::ReaderWriter::ReadResult ReaderWriterGZ::readFile(ObjectType objectType, const std::string& fullFileName, const osgDB::ReaderWriter::Options *options) const\n{\n    std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n    if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n\n    if (osgDB::containsServerAddress(fullFileName)) return ReadResult::FILE_NOT_HANDLED;\n\n    osgDB::ReaderWriter* rw = 0;\n\n    if (osgDB::equalCaseInsensitive(ext,\"osgz\"))\n    {\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(\"osg\");\n        OSG_INFO<<\"osgz ReaderWriter \"<<rw<<std::endl;\n    }\n    else if (osgDB::equalCaseInsensitive(ext,\"ivez\"))\n    {\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(\"ive\");\n        OSG_INFO<<\"ivez ReaderWriter \"<<rw<<std::endl;\n    }\n    else\n    {\n        std::string baseFileName = osgDB::getNameLessExtension(fullFileName);\n        std::string baseExt = osgDB::getLowerCaseFileExtension(baseFileName);\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(baseExt);\n        OSG_INFO<<baseExt<<\" ReaderWriter \"<<rw<<std::endl;\n    }\n\n\n    std::string fileName = osgDB::findDataFile( fullFileName, options );\n    if (fileName.empty()) return ReadResult::FILE_NOT_FOUND;\n\n    \/\/ code for 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->getDatabasePathList().push_front(osgDB::getFilePath(fileName));\n\n    osgDB::ifstream fin(fileName.c_str(), std::ios::binary|std::ios::in);\n    if (!fin) return ReadResult::ERROR_IN_READING_FILE;\n\n\n    std::string dest;\n    read(fin, dest);\n\n    std::stringstream strstream(dest);\n\n    return readFile(objectType, rw, strstream, local_opt.get());\n}\n\n\nosgDB::ReaderWriter::WriteResult ReaderWriterGZ::writeFile(ObjectType objectType, const osg::Object* object, osgDB::ReaderWriter* rw, std::ostream& fout, const osgDB::ReaderWriter::Options *options) const\n{\n    switch(objectType)\n    {\n        case(OBJECT): return rw->writeObject(*object, fout, options);\n        case(IMAGE): return rw->writeImage(*(dynamic_cast<const osg::Image*>(object)), fout, options);\n        case(HEIGHTFIELD): return rw->writeHeightField(*(dynamic_cast<const osg::HeightField*>(object)), fout, options);\n        case(NODE): return rw->writeNode(*(dynamic_cast<const osg::Node*>(object)), fout,options);\n        default: break;\n    }\n    return WriteResult::FILE_NOT_HANDLED;\n}\n\nosgDB::ReaderWriter::WriteResult ReaderWriterGZ::writeFile(ObjectType objectType, const osg::Object* object, const std::string& fullFileName, const osgDB::ReaderWriter::Options *options) const\n{\n    std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n    if (!acceptsExtension(ext)) return WriteResult::FILE_NOT_HANDLED;\n\n    osgDB::ReaderWriter* rw = 0;\n\n    if (osgDB::equalCaseInsensitive(ext,\"osgz\"))\n    {\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(\"osg\");\n        OSG_NOTICE<<\"osgz ReaderWriter \"<<rw<<std::endl;\n    }\n    else if (osgDB::equalCaseInsensitive(ext,\"ivez\"))\n    {\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(\"ive\");\n        OSG_NOTICE<<\"ivez ReaderWriter \"<<rw<<std::endl;\n    }\n    else\n    {\n        std::string baseFileName = osgDB::getNameLessExtension(fullFileName);\n        std::string baseExt = osgDB::getLowerCaseFileExtension(baseFileName);\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(baseExt);\n        OSG_NOTICE<<baseExt<<\" ReaderWriter \"<<rw<<std::endl;\n    }\n\n    std::stringstream strstream;\n    osgDB::ReaderWriter::WriteResult writeResult = writeFile(objectType, object, rw, strstream, options);\n\n    osgDB::ofstream fout(fullFileName.c_str(), std::ios::binary|std::ios::out);\n\n    write(fout,strstream.str());\n\n    return writeResult;\n}\n\n#define CHUNK 16384\n\nbool ReaderWriterGZ::read(std::istream& fin, std::string& destination) const\n{\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    ret = inflateInit2(&strm,\n                       15 + 32 \/\/ autodetected zlib or gzip header\n                       );\n    if (ret != Z_OK)\n        return false;\n\n    \/* decompress until deflate stream ends or end of file *\/\n    do {\n\n        fin.read((char*)in, CHUNK);\n        strm.avail_in = fin.gcount();\n\n        if (fin.bad())\n        {\n            (void)inflateEnd(&strm);\n            return false;\n        }\n        if (strm.avail_in == 0)\n            break;\n        strm.next_in = in;\n\n        \/* run inflate() on input until output buffer not full *\/\n        do {\n            strm.avail_out = CHUNK;\n            strm.next_out = out;\n            ret = inflate(&strm, Z_NO_FLUSH);\n\n            switch (ret) {\n            case Z_NEED_DICT:\n            case Z_DATA_ERROR:\n            case Z_MEM_ERROR:\n                (void)inflateEnd(&strm);\n                return false;\n            }\n            have = CHUNK - strm.avail_out;\n\n            destination.append((char*)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    \/* clean up and return *\/\n    (void)inflateEnd(&strm);\n    return ret == Z_STREAM_END ? true : false;\n}\n\nbool ReaderWriterGZ::write(std::ostream& fout, const std::string& source) const\n{\n    int ret, flush = Z_FINISH;\n    unsigned have;\n    z_stream strm;\n    unsigned char out[CHUNK];\n\n    int level = 6;\n    int stategy = Z_DEFAULT_STRATEGY; \/\/ looks to be the best for .osg\/.ive files\n    \/\/int stategy = Z_FILTERED;\n    \/\/int stategy = Z_HUFFMAN_ONLY;\n    \/\/int stategy = Z_RLE;\n\n    \/* allocate deflate state *\/\n    strm.zalloc = Z_NULL;\n    strm.zfree = Z_NULL;\n    strm.opaque = Z_NULL;\n    ret = deflateInit2(&strm,\n                       level,\n                       Z_DEFLATED,\n                       15+16, \/\/ +16 to use gzip encoding\n                       8, \/\/ default\n                       stategy);\n    if (ret != Z_OK)\n    return false;\n\n    strm.avail_in = source.size();\n    strm.next_in = (Bytef*)(&(*source.begin()));\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        ret = deflate(&strm, flush);    \/* no bad return value *\/\n\n        if (ret == Z_STREAM_ERROR)\n        {\n            OSG_NOTICE<<\"Z_STREAM_ERROR\"<<std::endl;\n            return false;\n        }\n\n        have = CHUNK - strm.avail_out;\n\n        if (have>0) fout.write((const char*)out, have);\n\n        if (fout.fail())\n        {\n            (void)deflateEnd(&strm);\n            return false;\n        }\n    } while (strm.avail_out == 0);\n\n    \/* clean up and return *\/\n    (void)deflateEnd(&strm);\n    return true;\n}\n\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nREGISTER_OSGPLUGIN(GZ, ReaderWriterGZ)\n<commit_msg>add funcs to read Object from a GZ stream<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2008 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 <osgDB\/FileUtils>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/ReadFile>\n#include <osgDB\/WriteFile>\n#include <osgDB\/Registry>\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iterator>\n\n#include <zlib.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  ReaderWriterGZ\n\/\/\nclass ReaderWriterGZ : public osgDB::ReaderWriter\n{\n    public:\n\n        enum ObjectType\n        {\n            OBJECT,\n            ARCHIVE,\n            IMAGE,\n            HEIGHTFIELD,\n            NODE\n        };\n\n        ReaderWriterGZ();\n\n        ~ReaderWriterGZ();\n\n        virtual const char* className() const { return \"GZ Archive Reader\/Writer\"; }\n\n        virtual ReadResult openArchive(const std::string& fileName,ArchiveStatus status, unsigned int , const Options* options) const\n        {\n            if (status!=READ) return ReadResult(ReadResult::FILE_NOT_HANDLED);\n            else return readFile(ARCHIVE,fileName,options);\n        }\n\n        virtual ReadResult readObject(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return readFile(OBJECT,fileName,options);\n        }\n\n        virtual ReadResult readImage(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return readFile(IMAGE,fileName,options);\n        }\n\n        virtual ReadResult readHeightField(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return readFile(HEIGHTFIELD,fileName,options);\n        }\n\n        virtual ReadResult readNode(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return readFile(NODE,fileName,options);\n        }\n\n        ReadResult readFile(ObjectType objectType, osgDB::ReaderWriter* rw, std::istream& fin, const osgDB::ReaderWriter::Options* options) const;\n\n        ReadResult readFile(ObjectType objectType, const std::string& fullFileName, const osgDB::ReaderWriter::Options* options) const;\n\n        \/\/\/return the reader for fullFileName and a outuncompessed stream fetching this file in the archive\n        osgDB::ReaderWriter *getStreamAndReader(std::stringstream& outuncompessed, std::istream& fin, const std::string& fullFileName) const {\n            std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n            osgDB::ReaderWriter* rw = 0;\n            rw = osgDB::Registry::instance()->getReaderWriterForExtension(ext);\n            std::string baseFileName = osgDB::getNameLessExtension(fullFileName);\n            std::string baseExt = osgDB::getLowerCaseFileExtension(baseFileName);\n            rw = osgDB::Registry::instance()->getReaderWriterForExtension(baseExt);\n            OSG_INFO<<classname()<<\"::getStreamAndReader:\"<<baseExt<<\" ReaderWriter \"<<rw<<std::endl;\n            read(fin, outuncompessed);\n            return rw;\n        }\n\n        virtual ReadResult readImage(std::istream& fin,const osgDB::ReaderWriter::Options* local_opt=NULL) const {\n            std::string fullFileName = local_opt->getPluginStringData(\"STREAM_FILENAME\");\n            std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n            if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n            if (osgDB::containsServerAddress(fullFileName)) return ReadResult::FILE_NOT_HANDLED;\n            std::stringstream decstream;\n            osgDB::ReaderWriter* rw = getStreamAndReader(decstream, fin, fullFileName);\n            return readFile(IMAGE, rw, decstream, local_opt);\n        }\n\n        virtual ReadResult readHeightField(std::istream& fin,const osgDB::ReaderWriter::Options* local_opt=NULL) const {\n            std::string fullFileName = local_opt->getPluginStringData(\"STREAM_FILENAME\");\n            std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n            if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n            if (osgDB::containsServerAddress(fullFileName)) return ReadResult::FILE_NOT_HANDLED;\n            std::stringstream decstream;\n            osgDB::ReaderWriter* rw = getStreamAndReader(decstream, fin, fullFileName);\n            return readFile(HEIGHTFIELD, rw, decstream, local_opt);\n        }\n\n        virtual ReadResult readNode(std::istream& fin,const osgDB::ReaderWriter::Options* local_opt=NULL) const {\n            std::string fullFileName = local_opt->getPluginStringData(\"STREAM_FILENAME\");\n            std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n            if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n            if (osgDB::containsServerAddress(fullFileName)) return ReadResult::FILE_NOT_HANDLED;\n            std::stringstream decstream;\n            osgDB::ReaderWriter* rw = getStreamAndReader(decstream, fin, fullFileName);\n            return readFile(NODE, rw, decstream, local_opt);\n        }\n\n        virtual ReadResult readObject(std::istream& fin,const osgDB::ReaderWriter::Options* local_opt=NULL) const {\n            std::string fullFileName = local_opt->getPluginStringData(\"STREAM_FILENAME\");\n            std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n            if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n            if (osgDB::containsServerAddress(fullFileName)) return ReadResult::FILE_NOT_HANDLED;\n            std::stringstream decstream;\n            osgDB::ReaderWriter* rw = getStreamAndReader(decstream, fin, fullFileName);\n            return readFile(OBJECT, rw, decstream, local_opt);\n        }\n        virtual ReadResult readArchive(std::istream& fin,const osgDB::ReaderWriter::Options* local_opt=NULL) const {\n            std::string fullFileName = local_opt->getPluginStringData(\"STREAM_FILENAME\");\n            std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n            if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n            if (osgDB::containsServerAddress(fullFileName)) return ReadResult::FILE_NOT_HANDLED;\n            std::stringstream decstream;\n            osgDB::ReaderWriter* rw = getStreamAndReader(decstream, fin, fullFileName);\n            return readFile(ARCHIVE, rw, decstream, local_opt);\n        }\n\n\n        virtual WriteResult writeObject(const osg::Object& obj, const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return writeFile(OBJECT, &obj, fileName, options);\n        }\n\n        virtual WriteResult writeImage(const osg::Image& image, const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return writeFile(IMAGE, &image, fileName, options);\n        }\n\n        virtual WriteResult writeHeightField(const osg::HeightField& hf, const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return writeFile(HEIGHTFIELD, &hf, fileName, options);\n        }\n\n        virtual WriteResult writeNode(const osg::Node& node, const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n        {\n            return writeFile(NODE, &node, fileName,options);\n        }\n\n        WriteResult writeFile(ObjectType objectType, const osg::Object* object, osgDB::ReaderWriter* rw, std::ostream& fin, const osgDB::ReaderWriter::Options* options) const;\n\n        WriteResult writeFile(ObjectType objectType, const osg::Object* object, const std::string& fullFileName, const osgDB::ReaderWriter::Options* options) const;\n\n\n        bool read(std::istream& fin, std::string& destination) const;\n        bool write(std::ostream& fout, const std::string& source) const;\n\n\n};\n\nReaderWriterGZ::ReaderWriterGZ()\n{\n    \/\/ OSG_NOTICE<<\"ReaderWriterGZ::ReaderWriterGZ()\"<<std::endl;\n\n    supportsExtension(\"osgz\",\"Compressed .osg file extension.\");\n    supportsExtension(\"ivez\",\"Compressed .ive file extension.\");\n    supportsExtension(\"gz\",\"Compressed file extension.\");\n}\n\nReaderWriterGZ::~ReaderWriterGZ()\n{\n    \/\/ OSG_NOTICE<<\"ReaderWriterGZ::~ReaderWriterGZ()\"<<std::endl;\n}\n\nosgDB::ReaderWriter::ReadResult ReaderWriterGZ::readFile(ObjectType objectType, osgDB::ReaderWriter* rw, std::istream& fin, const osgDB::ReaderWriter::Options *options) const\n{\n    switch(objectType)\n    {\n        case(OBJECT): return rw->readObject(fin,options);\n        case(ARCHIVE): return rw->openArchive(fin,options);\n        case(IMAGE): return rw->readImage(fin,options);\n        case(HEIGHTFIELD): return rw->readHeightField(fin,options);\n        case(NODE): return rw->readNode(fin,options);\n        default: break;\n    }\n    return ReadResult::FILE_NOT_HANDLED;\n}\n\nosgDB::ReaderWriter::ReadResult ReaderWriterGZ::readFile(ObjectType objectType, const std::string& fullFileName, const osgDB::ReaderWriter::Options *options) const\n{\n    std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n    if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n\n    if (osgDB::containsServerAddress(fullFileName)) return ReadResult::FILE_NOT_HANDLED;\n\n    osgDB::ReaderWriter* rw = 0;\n\n    if (osgDB::equalCaseInsensitive(ext,\"osgz\"))\n    {\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(\"osg\");\n        OSG_INFO<<\"osgz ReaderWriter \"<<rw<<std::endl;\n    }\n    else if (osgDB::equalCaseInsensitive(ext,\"ivez\"))\n    {\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(\"ive\");\n        OSG_INFO<<\"ivez ReaderWriter \"<<rw<<std::endl;\n    }\n    else\n    {\n        std::string baseFileName = osgDB::getNameLessExtension(fullFileName);\n        std::string baseExt = osgDB::getLowerCaseFileExtension(baseFileName);\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(baseExt);\n        OSG_INFO<<baseExt<<\" ReaderWriter \"<<rw<<std::endl;\n    }\n\n\n    std::string fileName = osgDB::findDataFile( fullFileName, options );\n    if (fileName.empty()) return ReadResult::FILE_NOT_FOUND;\n\n    \/\/ code for 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->getDatabasePathList().push_front(osgDB::getFilePath(fileName));\n\n    osgDB::ifstream fin(fileName.c_str(), std::ios::binary|std::ios::in);\n    if (!fin) return ReadResult::ERROR_IN_READING_FILE;\n\n\n    std::string dest;\n    read(fin, dest);\n\n    std::stringstream strstream(dest);\n\n    return readFile(objectType, rw, strstream, local_opt.get());\n}\n\n\nosgDB::ReaderWriter::WriteResult ReaderWriterGZ::writeFile(ObjectType objectType, const osg::Object* object, osgDB::ReaderWriter* rw, std::ostream& fout, const osgDB::ReaderWriter::Options *options) const\n{\n    switch(objectType)\n    {\n        case(OBJECT): return rw->writeObject(*object, fout, options);\n        case(IMAGE): return rw->writeImage(*(dynamic_cast<const osg::Image*>(object)), fout, options);\n        case(HEIGHTFIELD): return rw->writeHeightField(*(dynamic_cast<const osg::HeightField*>(object)), fout, options);\n        case(NODE): return rw->writeNode(*(dynamic_cast<const osg::Node*>(object)), fout,options);\n        default: break;\n    }\n    return WriteResult::FILE_NOT_HANDLED;\n}\n\nosgDB::ReaderWriter::WriteResult ReaderWriterGZ::writeFile(ObjectType objectType, const osg::Object* object, const std::string& fullFileName, const osgDB::ReaderWriter::Options *options) const\n{\n    std::string ext = osgDB::getLowerCaseFileExtension(fullFileName);\n    if (!acceptsExtension(ext)) return WriteResult::FILE_NOT_HANDLED;\n\n    osgDB::ReaderWriter* rw = 0;\n\n    if (osgDB::equalCaseInsensitive(ext,\"osgz\"))\n    {\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(\"osg\");\n        OSG_NOTICE<<\"osgz ReaderWriter \"<<rw<<std::endl;\n    }\n    else if (osgDB::equalCaseInsensitive(ext,\"ivez\"))\n    {\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(\"ive\");\n        OSG_NOTICE<<\"ivez ReaderWriter \"<<rw<<std::endl;\n    }\n    else\n    {\n        std::string baseFileName = osgDB::getNameLessExtension(fullFileName);\n        std::string baseExt = osgDB::getLowerCaseFileExtension(baseFileName);\n        rw = osgDB::Registry::instance()->getReaderWriterForExtension(baseExt);\n        OSG_NOTICE<<baseExt<<\" ReaderWriter \"<<rw<<std::endl;\n    }\n\n    std::stringstream strstream;\n    osgDB::ReaderWriter::WriteResult writeResult = writeFile(objectType, object, rw, strstream, options);\n\n    osgDB::ofstream fout(fullFileName.c_str(), std::ios::binary|std::ios::out);\n\n    write(fout,strstream.str());\n\n    return writeResult;\n}\n\n#define CHUNK 16384\n\nbool ReaderWriterGZ::read(std::istream& fin, std::string& destination) const\n{\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    ret = inflateInit2(&strm,\n                       15 + 32 \/\/ autodetected zlib or gzip header\n                       );\n    if (ret != Z_OK)\n        return false;\n\n    \/* decompress until deflate stream ends or end of file *\/\n    do {\n\n        fin.read((char*)in, CHUNK);\n        strm.avail_in = fin.gcount();\n\n        if (fin.bad())\n        {\n            (void)inflateEnd(&strm);\n            return false;\n        }\n        if (strm.avail_in == 0)\n            break;\n        strm.next_in = in;\n\n        \/* run inflate() on input until output buffer not full *\/\n        do {\n            strm.avail_out = CHUNK;\n            strm.next_out = out;\n            ret = inflate(&strm, Z_NO_FLUSH);\n\n            switch (ret) {\n            case Z_NEED_DICT:\n            case Z_DATA_ERROR:\n            case Z_MEM_ERROR:\n                (void)inflateEnd(&strm);\n                return false;\n            }\n            have = CHUNK - strm.avail_out;\n\n            destination.append((char*)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    \/* clean up and return *\/\n    (void)inflateEnd(&strm);\n    return ret == Z_STREAM_END ? true : false;\n}\n\nbool ReaderWriterGZ::write(std::ostream& fout, const std::string& source) const\n{\n    int ret, flush = Z_FINISH;\n    unsigned have;\n    z_stream strm;\n    unsigned char out[CHUNK];\n\n    int level = 6;\n    int stategy = Z_DEFAULT_STRATEGY; \/\/ looks to be the best for .osg\/.ive files\n    \/\/int stategy = Z_FILTERED;\n    \/\/int stategy = Z_HUFFMAN_ONLY;\n    \/\/int stategy = Z_RLE;\n\n    \/* allocate deflate state *\/\n    strm.zalloc = Z_NULL;\n    strm.zfree = Z_NULL;\n    strm.opaque = Z_NULL;\n    ret = deflateInit2(&strm,\n                       level,\n                       Z_DEFLATED,\n                       15+16, \/\/ +16 to use gzip encoding\n                       8, \/\/ default\n                       stategy);\n    if (ret != Z_OK)\n    return false;\n\n    strm.avail_in = source.size();\n    strm.next_in = (Bytef*)(&(*source.begin()));\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        ret = deflate(&strm, flush);    \/* no bad return value *\/\n\n        if (ret == Z_STREAM_ERROR)\n        {\n            OSG_NOTICE<<\"Z_STREAM_ERROR\"<<std::endl;\n            return false;\n        }\n\n        have = CHUNK - strm.avail_out;\n\n        if (have>0) fout.write((const char*)out, have);\n\n        if (fout.fail())\n        {\n            (void)deflateEnd(&strm);\n            return false;\n        }\n    } while (strm.avail_out == 0);\n\n    \/* clean up and return *\/\n    (void)deflateEnd(&strm);\n    return true;\n}\n\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nREGISTER_OSGPLUGIN(GZ, ReaderWriterGZ)\n<|endoftext|>"}
{"text":"<commit_before>#include \"TrPageArchive.h\"\n#include \"TrPageParser.h\"\n\n#include <osg\/Group>\n#include <osg\/Image>\n#include <osg\/Texture>\n#include <osg\/Material>\n#include <osg\/TexEnv>\n#include <osg\/Transparency>\n#include <osg\/CullFace>\n#include <osg\/Light>\n#include <osg\/StateSet>\n#include <osg\/Notify>\n#include <osgDB\/FileUtils>\n#include <iostream>\n\n#include <osgDB\/ReadFile>\n#include <osgDB\/FileNameUtils>\n\n#include \"trpage_geom.h\"\n#include \"trpage_read.h\"\n#include \"trpage_write.h\"\n#include \"trpage_scene.h\"\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\nusing namespace txp;\nusing namespace osg;\n\nTrPageArchive::TrPageArchive()\n: trpgr_Archive()\n, parse(new TrPageParser()) \n{\n}\n\nTrPageArchive::~TrPageArchive()\n{\n}\n\nbool TrPageArchive::OpenFile(const char* file)\n{\n    m_alternate_path = osgDB::getFilePath(file);\n    std::string name = osgDB::getSimpleFileName(file);\n    \n    if(m_alternate_path.empty())\n        SetDirectory(\".\");\n    else\n    {\n        osgDB::setFilePath(m_alternate_path.c_str());\n        SetDirectory(m_alternate_path.c_str());\n    }\n    \n    if (!trpgr_Archive::OpenFile(name.c_str()))\n    {\n        notify(WARN) << \"TrPageArchive::OpenFile() error: \"\n            << \"couldn't open archive: \" << file << std::endl;\n        return false;\n    }\n    if (!ReadHeader())\n    {\n        notify(WARN) << \"TrPageArchive::OpenFile() error: \"\n            << \"couldn't read header for archive: \" << file\n            << std::endl;\n        return false;\n    }\n    \n    \/\/ Set the max group ID here because it won't change\n    const trpgHeader *head = GetHeader();\n    int maxID;\n    head->GetMaxGroupID(maxID);\n    parse->SetMaxGroupID(maxID);\n    \n    return true;\n}\n\n\/\/ load textures and materials\n\/\/ TODO : multitexturing \nvoid TrPageArchive::LoadMaterials()\n{\n    int n_textures;\n    texTable.GetNumTextures(n_textures);\n    \n    m_textures.resize(n_textures);\n    \n    \/\/ these extra braces are workaroud for annoying bug in MSVC \n    \/\/ for( int i = ....) and i is visible outside the loop\n    {\n        for (int i=0; i < n_textures ; i++)\n        {\n            const trpgTexture *tex;\n            tex = texTable.GetTextureRef(i);\n            char texName[1024];  texName[0] = 0;\n            tex->GetName(texName,1023);\n            \/\/ Create a texture by name.\n            Texture *osg_texture = new Texture();\n            \n            \/\/ Load Texture and Create Texture State\n            std::string filename = osgDB::getSimpleFileName(texName);\n            std::string path(getDir());\n            std::string theFile = path + '\/'+ filename ;\n            ref_ptr<Image> image = osgDB::readImageFile(theFile);\n            if (image.valid())\n            {\n                osg_texture->setImage(image.get());\n            }\n            m_textures[i] = osg_texture;\n        }\n    }\n    \n    \/\/ create materials\n    int n_materials;\n    materialTable.GetNumMaterial(n_materials);\n    \n    {\n        for (int i = 0; i < n_materials; i++)\n        {\n            StateSet* osg_state_set = new StateSet;\n            \n            const trpgMaterial *mat;\n            mat = materialTable.GetMaterialRef(0,i);\n            \/\/ Set texture\n            int numMatTex;\n            mat->GetNumTexture(numMatTex);\n            \n            \/\/ TODO : multitextuting\n            \/\/ also note that multitexturing in terrapage can came from two sides\n            \/\/ - multiple textures per material, and multiple materials per geometry\n            if(numMatTex)\n            {\n                int texId;\n                trpgTextureEnv texEnv;\n                mat->GetTexture(0,texId,texEnv);\n                \n                \/\/ Set up texture environment\n                TexEnv       *osg_texenv       = new TexEnv();\n                int32 te_mode;\n                texEnv.GetEnvMode(te_mode);\n                switch( te_mode )\n                {\n                case trpgTextureEnv::Alpha :\n                    osg_texenv->setMode(TexEnv::REPLACE);\n                    break;\n                case trpgTextureEnv::Decal:\n                    osg_texenv->setMode(TexEnv::DECAL);\n                    break;\n                case trpgTextureEnv::Blend :\n                    osg_texenv->setMode(TexEnv::BLEND);\n                    break;\n                case trpgTextureEnv::Modulate :\n                    osg_texenv->setMode(TexEnv::MODULATE);\n                    break;\n                }\n                \n                osg_state_set->setAttribute(osg_texenv);\n                \n                Material     *osg_material     = new Material;\n                \n                float64 alpha;\n                mat->GetAlpha(alpha);\n                \n                trpgColor color;\n                mat->GetAmbient(color);\n                osg_material->setAmbient( Material::FRONT_AND_BACK , \n                    Vec4(color.red, color.green, color.blue, alpha));\n                mat->GetDiffuse(color);\n                osg_material->setDiffuse(Material::FRONT_AND_BACK , \n                    Vec4(color.red, color.green, color.blue, alpha));\n                \n                mat->GetSpecular(color);\n                osg_material->setSpecular(Material::FRONT_AND_BACK , \n                    Vec4(color.red, color.green, color.blue, alpha));\n                mat->GetEmission(color);\n                osg_material->setEmission(Material::FRONT_AND_BACK , \n                    Vec4(color.red, color.green, color.blue, alpha));\n\n                float64 shinines;\n                mat->GetShininess(shinines);\n                osg_material->setShininess(Material::FRONT_AND_BACK , (float)shinines\/128.0);\n                \n                osg_material->setAlpha(Material::FRONT_AND_BACK ,(float)alpha);\n                osg_state_set->setAttributeAndModes(osg_material, StateAttribute::ON);\n                \n                if( alpha < 1.0f )\n                {\n                    osg_state_set->setMode(GL_BLEND,StateAttribute::ON);\n                    osg_state_set->setRenderingHint(StateSet::TRANSPARENT_BIN);\n                }\n                \n                \/*\n                int alphaFunc;\n                mat->GetAlphaFunc(alphaFunc);\n                *\/\n                \n                \/\/ transparency\n                Transparency *osg_transparency = new Transparency;\n                osg_transparency->setFunction(Transparency::SRC_ALPHA, Transparency::ONE_MINUS_SRC_ALPHA);\n                osg_state_set->setAttributeAndModes(osg_transparency, StateAttribute::ON);\n                \n                int wrap_s, wrap_t;   \n                texEnv.GetWrap(wrap_s, wrap_t);\n                \n                Texture* osg_texture = m_textures[texId].get();\n                osg_texture->setWrap(Texture::WRAP_S, wrap_s == trpgTextureEnv::Repeat ? Texture::REPEAT: Texture::CLAMP );\n                osg_texture->setWrap(Texture::WRAP_T, wrap_t == trpgTextureEnv::Repeat ? Texture::REPEAT: Texture::CLAMP );\n                osg_state_set->setAttributeAndModes(osg_texture, StateAttribute::ON);\n                \n                if(osg_texture->getImage())\n                { \n                    switch (osg_texture->getImage()->pixelFormat())\n                    {\n                    case GL_LUMINANCE_ALPHA:\n                    case GL_RGBA:\n                        osg_state_set->setMode(GL_BLEND,StateAttribute::ON);\n                        osg_state_set->setRenderingHint(StateSet::TRANSPARENT_BIN);\n                    }\n                }\n                \n                int cullMode;\n                mat->GetCullMode(cullMode);\n                \n                \/\/ Culling mode in txp means opposite from osg i.e. Front-> show front face\n                if( cullMode != trpgMaterial::FrontAndBack)\n                {\n                    CullFace* cull_face = new CullFace;\n                    switch (cullMode)\n                    {\n                    case trpgMaterial::Front:\n                        cull_face->setMode(CullFace::BACK);\n                        break;\n                    case trpgMaterial::Back:\n                        cull_face->setMode(CullFace::FRONT);\n                        break;\n                    }\n                    osg_state_set->setAttributeAndModes(cull_face, StateAttribute::ON);\n                }\n          }\n          m_gstates.push_back(osg_state_set);\n        }\n    }\n}\n\nbool TrPageArchive::LoadModels()\n{\n   int numModel;\n   modelTable.GetNumModels(numModel);\n\n   \/\/ Iterate over the models\n   for (int i=0; i< numModel; i++)\n   {\n      trpgModel *mod = modelTable.GetModelRef(i);\n      int type;\n      mod->GetType(type);\n\n      \/\/ Only dealing with external models currently\n      if (type == trpgModel::External)\n      {\n         char name[1024];\n         mod->GetName(name,1023);\n\n         \/\/ Load the model.  It's probably not TerraPage\n         Node *osg_model = osgDB::readNodeFile(name);\n         if (!osg_model)\n         {\n            notify(WARN) << \"TrPageArchive::LoadModels() error: \"\n                              << \"failed to load model: \"\n                              << name << std::endl;\n         }\n         \/\/ Do this even if it's NULL\n         m_models.push_back(osg_model);\n      }\n\/*\n      else\n      {\n          trpgMemReadBuffer buf(GetEndian());\n          mod->Read(buf);\n          Group *osg_model = parse->ParseScene(buf, m_gstates , m_models);\n          m_models.push_back(osg_model);  \n      }\n*\/\n  }\n   return true;\n}\n\nGroup* TrPageArchive::LoadTile(int x,int y,int lod,int &parentID)\n{\n   trpgMemReadBuffer buf(GetEndian());\n\n   \/\/ Read the tile data in, but don't parse it\n   if (!ReadTile(x,y,lod,buf))\n      return NULL;\n\n   \/\/ Call the parser\n   Group *tile = parse->ParseScene(buf, m_gstates , m_models);\n   if (tile)\n   {\n      parentID = parse->GetParentID();\n      \/\/ This is where you would page in textures and models\n   }\n\n   \/\/ That's it\n   return tile;\n}\n\n\/\/----------------------------------------------------------------------------\nGroup* TrPageArchive::LoadAllTiles()\n{\n   \/\/ Size information comes out of the header\n   const trpgHeader *head = GetHeader();\n   \/\/ Create one group as the top\n   Group *topGroup = new Group;\n\n   int32 numLod;\n   head->GetNumLods(numLod);\n   \/\/  Iterate over the LODs.  Lower res LODs must be loaded\n   \/\/  first, otherwise there's nothing to hook the higher res\n   \/\/  LODs into.\n   trpg2iPoint tileSize;\n\n   \/\/ The group list is used to map parent IDs to pfGroup nodes\n   std::vector<Group *> *groupList = parse->GetGroupList();\n\n   for (int nl=0;nl<numLod;nl++)\n   {\n      \/\/ The number of tiles in X and Y changes per LOD\n      head->GetLodSize(nl,tileSize);\n      for (int x=0; x < tileSize.x; x++)\n      {\n         for (int y=0; y < tileSize.y; y++)\n         {\n            int parentID;\n            Group *tile = LoadTile(x,y,nl,parentID);\n            if (!tile)\n            {\n                notify(WARN)<< \"TrPageArchive::LoadAllTiles error: \"\n                                 << \"failed to load tile (\"\n                                 << x << \",\" << y << \",\" << nl << \")\"\n                                 << std::endl;\n            }\n            else\n            {\n               if (parentID == -1)\n               {\n                  \/\/ Get added to the top level node\n                  topGroup->addChild(tile);\n               }\n               else\n               {\n                  \/\/ Added below some other node\n                  (*groupList)[parentID]->addChild(tile);\n               }\n            }\n         }\n      }\n   }\n   return topGroup;\n}\n<commit_msg>Fix to TXP plugin to handle to new osg::Image method naming.<commit_after>#include \"TrPageArchive.h\"\n#include \"TrPageParser.h\"\n\n#include <osg\/Group>\n#include <osg\/Image>\n#include <osg\/Texture>\n#include <osg\/Material>\n#include <osg\/TexEnv>\n#include <osg\/Transparency>\n#include <osg\/CullFace>\n#include <osg\/Light>\n#include <osg\/StateSet>\n#include <osg\/Notify>\n#include <osgDB\/FileUtils>\n#include <iostream>\n\n#include <osgDB\/ReadFile>\n#include <osgDB\/FileNameUtils>\n\n#include \"trpage_geom.h\"\n#include \"trpage_read.h\"\n#include \"trpage_write.h\"\n#include \"trpage_scene.h\"\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\nusing namespace txp;\nusing namespace osg;\n\nTrPageArchive::TrPageArchive()\n: trpgr_Archive()\n, parse(new TrPageParser()) \n{\n}\n\nTrPageArchive::~TrPageArchive()\n{\n}\n\nbool TrPageArchive::OpenFile(const char* file)\n{\n    m_alternate_path = osgDB::getFilePath(file);\n    std::string name = osgDB::getSimpleFileName(file);\n    \n    if(m_alternate_path.empty())\n        SetDirectory(\".\");\n    else\n    {\n        osgDB::setFilePath(m_alternate_path.c_str());\n        SetDirectory(m_alternate_path.c_str());\n    }\n    \n    if (!trpgr_Archive::OpenFile(name.c_str()))\n    {\n        notify(WARN) << \"TrPageArchive::OpenFile() error: \"\n            << \"couldn't open archive: \" << file << std::endl;\n        return false;\n    }\n    if (!ReadHeader())\n    {\n        notify(WARN) << \"TrPageArchive::OpenFile() error: \"\n            << \"couldn't read header for archive: \" << file\n            << std::endl;\n        return false;\n    }\n    \n    \/\/ Set the max group ID here because it won't change\n    const trpgHeader *head = GetHeader();\n    int maxID;\n    head->GetMaxGroupID(maxID);\n    parse->SetMaxGroupID(maxID);\n    \n    return true;\n}\n\n\/\/ load textures and materials\n\/\/ TODO : multitexturing \nvoid TrPageArchive::LoadMaterials()\n{\n    int n_textures;\n    texTable.GetNumTextures(n_textures);\n    \n    m_textures.resize(n_textures);\n    \n    \/\/ these extra braces are workaroud for annoying bug in MSVC \n    \/\/ for( int i = ....) and i is visible outside the loop\n    {\n        for (int i=0; i < n_textures ; i++)\n        {\n            const trpgTexture *tex;\n            tex = texTable.GetTextureRef(i);\n            char texName[1024];  texName[0] = 0;\n            tex->GetName(texName,1023);\n            \/\/ Create a texture by name.\n            Texture *osg_texture = new Texture();\n            \n            \/\/ Load Texture and Create Texture State\n            std::string filename = osgDB::getSimpleFileName(texName);\n            std::string path(getDir());\n            std::string theFile = path + '\/'+ filename ;\n            ref_ptr<Image> image = osgDB::readImageFile(theFile);\n            if (image.valid())\n            {\n                osg_texture->setImage(image.get());\n            }\n            m_textures[i] = osg_texture;\n        }\n    }\n    \n    \/\/ create materials\n    int n_materials;\n    materialTable.GetNumMaterial(n_materials);\n    \n    {\n        for (int i = 0; i < n_materials; i++)\n        {\n            StateSet* osg_state_set = new StateSet;\n            \n            const trpgMaterial *mat;\n            mat = materialTable.GetMaterialRef(0,i);\n            \/\/ Set texture\n            int numMatTex;\n            mat->GetNumTexture(numMatTex);\n            \n            \/\/ TODO : multitextuting\n            \/\/ also note that multitexturing in terrapage can came from two sides\n            \/\/ - multiple textures per material, and multiple materials per geometry\n            if(numMatTex)\n            {\n                int texId;\n                trpgTextureEnv texEnv;\n                mat->GetTexture(0,texId,texEnv);\n                \n                \/\/ Set up texture environment\n                TexEnv       *osg_texenv       = new TexEnv();\n                int32 te_mode;\n                texEnv.GetEnvMode(te_mode);\n                switch( te_mode )\n                {\n                case trpgTextureEnv::Alpha :\n                    osg_texenv->setMode(TexEnv::REPLACE);\n                    break;\n                case trpgTextureEnv::Decal:\n                    osg_texenv->setMode(TexEnv::DECAL);\n                    break;\n                case trpgTextureEnv::Blend :\n                    osg_texenv->setMode(TexEnv::BLEND);\n                    break;\n                case trpgTextureEnv::Modulate :\n                    osg_texenv->setMode(TexEnv::MODULATE);\n                    break;\n                }\n                \n                osg_state_set->setAttribute(osg_texenv);\n                \n                Material     *osg_material     = new Material;\n                \n                float64 alpha;\n                mat->GetAlpha(alpha);\n                \n                trpgColor color;\n                mat->GetAmbient(color);\n                osg_material->setAmbient( Material::FRONT_AND_BACK , \n                    Vec4(color.red, color.green, color.blue, alpha));\n                mat->GetDiffuse(color);\n                osg_material->setDiffuse(Material::FRONT_AND_BACK , \n                    Vec4(color.red, color.green, color.blue, alpha));\n                \n                mat->GetSpecular(color);\n                osg_material->setSpecular(Material::FRONT_AND_BACK , \n                    Vec4(color.red, color.green, color.blue, alpha));\n                mat->GetEmission(color);\n                osg_material->setEmission(Material::FRONT_AND_BACK , \n                    Vec4(color.red, color.green, color.blue, alpha));\n\n                float64 shinines;\n                mat->GetShininess(shinines);\n                osg_material->setShininess(Material::FRONT_AND_BACK , (float)shinines\/128.0);\n                \n                osg_material->setAlpha(Material::FRONT_AND_BACK ,(float)alpha);\n                osg_state_set->setAttributeAndModes(osg_material, StateAttribute::ON);\n                \n                if( alpha < 1.0f )\n                {\n                    osg_state_set->setMode(GL_BLEND,StateAttribute::ON);\n                    osg_state_set->setRenderingHint(StateSet::TRANSPARENT_BIN);\n                }\n                \n                \/*\n                int alphaFunc;\n                mat->GetAlphaFunc(alphaFunc);\n                *\/\n                \n                \/\/ transparency\n                Transparency *osg_transparency = new Transparency;\n                osg_transparency->setFunction(Transparency::SRC_ALPHA, Transparency::ONE_MINUS_SRC_ALPHA);\n                osg_state_set->setAttributeAndModes(osg_transparency, StateAttribute::ON);\n                \n                int wrap_s, wrap_t;   \n                texEnv.GetWrap(wrap_s, wrap_t);\n                \n                Texture* osg_texture = m_textures[texId].get();\n                osg_texture->setWrap(Texture::WRAP_S, wrap_s == trpgTextureEnv::Repeat ? Texture::REPEAT: Texture::CLAMP );\n                osg_texture->setWrap(Texture::WRAP_T, wrap_t == trpgTextureEnv::Repeat ? Texture::REPEAT: Texture::CLAMP );\n                osg_state_set->setAttributeAndModes(osg_texture, StateAttribute::ON);\n                \n                if(osg_texture->getImage())\n                { \n                    switch (osg_texture->getImage()->getPixelFormat())\n                    {\n                    case GL_LUMINANCE_ALPHA:\n                    case GL_RGBA:\n                        osg_state_set->setMode(GL_BLEND,StateAttribute::ON);\n                        osg_state_set->setRenderingHint(StateSet::TRANSPARENT_BIN);\n                    }\n                }\n                \n                int cullMode;\n                mat->GetCullMode(cullMode);\n                \n                \/\/ Culling mode in txp means opposite from osg i.e. Front-> show front face\n                if( cullMode != trpgMaterial::FrontAndBack)\n                {\n                    CullFace* cull_face = new CullFace;\n                    switch (cullMode)\n                    {\n                    case trpgMaterial::Front:\n                        cull_face->setMode(CullFace::BACK);\n                        break;\n                    case trpgMaterial::Back:\n                        cull_face->setMode(CullFace::FRONT);\n                        break;\n                    }\n                    osg_state_set->setAttributeAndModes(cull_face, StateAttribute::ON);\n                }\n          }\n          m_gstates.push_back(osg_state_set);\n        }\n    }\n}\n\nbool TrPageArchive::LoadModels()\n{\n   int numModel;\n   modelTable.GetNumModels(numModel);\n\n   \/\/ Iterate over the models\n   for (int i=0; i< numModel; i++)\n   {\n      trpgModel *mod = modelTable.GetModelRef(i);\n      int type;\n      mod->GetType(type);\n\n      \/\/ Only dealing with external models currently\n      if (type == trpgModel::External)\n      {\n         char name[1024];\n         mod->GetName(name,1023);\n\n         \/\/ Load the model.  It's probably not TerraPage\n         Node *osg_model = osgDB::readNodeFile(name);\n         if (!osg_model)\n         {\n            notify(WARN) << \"TrPageArchive::LoadModels() error: \"\n                              << \"failed to load model: \"\n                              << name << std::endl;\n         }\n         \/\/ Do this even if it's NULL\n         m_models.push_back(osg_model);\n      }\n\/*\n      else\n      {\n          trpgMemReadBuffer buf(GetEndian());\n          mod->Read(buf);\n          Group *osg_model = parse->ParseScene(buf, m_gstates , m_models);\n          m_models.push_back(osg_model);  \n      }\n*\/\n  }\n   return true;\n}\n\nGroup* TrPageArchive::LoadTile(int x,int y,int lod,int &parentID)\n{\n   trpgMemReadBuffer buf(GetEndian());\n\n   \/\/ Read the tile data in, but don't parse it\n   if (!ReadTile(x,y,lod,buf))\n      return NULL;\n\n   \/\/ Call the parser\n   Group *tile = parse->ParseScene(buf, m_gstates , m_models);\n   if (tile)\n   {\n      parentID = parse->GetParentID();\n      \/\/ This is where you would page in textures and models\n   }\n\n   \/\/ That's it\n   return tile;\n}\n\n\/\/----------------------------------------------------------------------------\nGroup* TrPageArchive::LoadAllTiles()\n{\n   \/\/ Size information comes out of the header\n   const trpgHeader *head = GetHeader();\n   \/\/ Create one group as the top\n   Group *topGroup = new Group;\n\n   int32 numLod;\n   head->GetNumLods(numLod);\n   \/\/  Iterate over the LODs.  Lower res LODs must be loaded\n   \/\/  first, otherwise there's nothing to hook the higher res\n   \/\/  LODs into.\n   trpg2iPoint tileSize;\n\n   \/\/ The group list is used to map parent IDs to pfGroup nodes\n   std::vector<Group *> *groupList = parse->GetGroupList();\n\n   for (int nl=0;nl<numLod;nl++)\n   {\n      \/\/ The number of tiles in X and Y changes per LOD\n      head->GetLodSize(nl,tileSize);\n      for (int x=0; x < tileSize.x; x++)\n      {\n         for (int y=0; y < tileSize.y; y++)\n         {\n            int parentID;\n            Group *tile = LoadTile(x,y,nl,parentID);\n            if (!tile)\n            {\n                notify(WARN)<< \"TrPageArchive::LoadAllTiles error: \"\n                                 << \"failed to load tile (\"\n                                 << x << \",\" << y << \",\" << nl << \")\"\n                                 << std::endl;\n            }\n            else\n            {\n               if (parentID == -1)\n               {\n                  \/\/ Get added to the top level node\n                  topGroup->addChild(tile);\n               }\n               else\n               {\n                  \/\/ Added below some other node\n                  (*groupList)[parentID]->addChild(tile);\n               }\n            }\n         }\n      }\n   }\n   return topGroup;\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 IronBee --- Trusted Proxy Module\n *\/\n\n\/\/ Include all of IronBee++\n#include <ironbeepp\/all.hpp>\n#include <ironbee\/ipset.h>\n#include <ironbee\/string.h>\n\n#include <boost\/algorithm\/string\/split.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n#include <boost\/bind.hpp>\n\n#include <vector>\n\nusing namespace std;\n\nnamespace {\n\n\/**\n * Configuration for the Trusted Proxy Module\n *\/\nclass TrustedProxyConfig\n{\npublic:\n    \/\/! Constructor.\n    TrustedProxyConfig();\n\n    \/\/! Is X-Forwarded-For handling enabled?\n    bool is_xff_enabled() const;\n\n    \/\/! Enable or disable X-Forwarded-For handling.\n    void set_xff_enabled(bool enabled);\n\n    \/\/! Clear the trusted and untrusted network lists.\n    void clear_networks();\n\n    \/\/! Add a network to the trusted list.\n    void add_trusted_network(const char* network);\n\n    \/\/! Add a network to the untrusted list.\n    void add_untrusted_network(const char* network);\n\n    \/**\n     * Check if the ip address is trusted.\n     *\n     * The default is to trust all addresses.\n     *\n     * @param[in] ipstr IP address to check.\n     *\n     * @returns True if the address is trusted.\n     *\/\n    bool is_trusted(const char* ipstr) const;\n\n    \/\/! Finalize the configuration when the context is closed.\n    void context_close(IronBee::Engine& ib);\n\nprivate:\n    \/\/! X-Forwarding-For handling enabled?\n    bool m_xff_enabled;\n\n    \/\/! List of trusted networks\n    vector<ib_ipset4_entry_t> m_trusted_net_list;\n\n    \/\/! List of untrusted networks\n    vector<ib_ipset4_entry_t> m_untrusted_net_list;\n\n    \/\/! IP set of the trusted and untrusted networks.\n    ib_ipset4_t m_trusted_networks;\n};\n\n\/**\n * Module to handle X-Forwarded-For headers from trusted Proxies.\n *\/\nclass TrustedProxyModule : public IronBee::ModuleDelegate\n{\npublic:\n    \/\/! Constructor.\n    explicit TrustedProxyModule(IronBee::Module module);\n\nprivate:\n    \/\/! X-Forward-For lookup target.\n    IronBee::ConstVarTarget m_xff_target;\n\n    \/\/! Source for recording the remote address\n    IronBee::VarSource m_remote_addr_source;\n\n    \/**\n     * Handle the TrustedProxyUseXFFHeader directive.\n     *\n     * @param[in] cp Configuration parser.\n     * @param[in] enabled Should XFF handling be enabled?\n     *\/\n    void enable_xff_directive(\n        IronBee::ConfigurationParser cp,\n        bool                         enabled);\n\n    \/**\n     * @param[in] cp Configuration parser.\n     * @param[in] ip_list List of IPs or CIDR blocks.\n     *\/\n    void trusted_ips_directive(\n        IronBee::ConfigurationParser    cp,\n        IronBee::ConstList<const char*> ip_list);\n\n    void on_context_close(IronBee::Engine ib, IronBee::Context ctx);\n\n    \/**\n     * Update the transaction effective IP based.\n     *\n     * @param[in] ib Ironbee engine.\n     * @param[in,out] tx Transaction to update.\n     *\/\n    void set_effective_ip(\n        IronBee::Engine      ib,\n        IronBee::Transaction tx);\n};\n\n} \/\/ Anonymous namespace\n\nIBPP_BOOTSTRAP_MODULE_DELEGATE(\"TrustedProxyModule\", TrustedProxyModule)\n\nnamespace {\n\nvoid make_ipset_entry(const char* cidr_or_ip, ib_ipset4_entry_t& entry)\n{\n    if (strchr(cidr_or_ip, '\/') != NULL) {\n        \/\/ Has \/ assume CIDR\n        IronBee::throw_if_error(\n            ib_ip4_str_to_net(cidr_or_ip, &(entry.network)),\n            \"Invalid CIDR block\");\n    }\n    else {\n        \/\/ IP make \/32\n        IronBee::throw_if_error(\n            ib_ip4_str_to_ip(cidr_or_ip, &(entry.network.ip)),\n            \"Invalid IP address\");\n        entry.network.size=32;\n    }\n}\n\nTrustedProxyConfig::TrustedProxyConfig()\n    : m_xff_enabled(true)\n{\n    ib_ipset4_init(&m_trusted_networks, NULL, 0, NULL, 0);\n}\n\nbool TrustedProxyConfig::is_xff_enabled() const\n{\n    return m_xff_enabled;\n}\n\nvoid TrustedProxyConfig::set_xff_enabled(bool enabled)\n{\n    m_xff_enabled = enabled;\n}\n\nvoid TrustedProxyConfig::clear_networks()\n{\n    m_trusted_net_list.clear();\n    m_untrusted_net_list.clear();\n}\n\nvoid TrustedProxyConfig::add_trusted_network(const char* cidr_or_ip)\n{\n    ib_ipset4_entry_t net_entry;\n    make_ipset_entry(cidr_or_ip, net_entry);\n    m_trusted_net_list.push_back(net_entry);\n}\n\nvoid TrustedProxyConfig::add_untrusted_network(const char* cidr_or_ip)\n{\n    ib_ipset4_entry_t net_entry;\n    make_ipset_entry(cidr_or_ip, net_entry);\n    m_untrusted_net_list.push_back(net_entry);\n}\n\nvoid TrustedProxyConfig::context_close(IronBee::Engine& ib)\n{\n    IronBee::throw_if_error(\n        ib_ipset4_init(\n            &m_trusted_networks,\n            m_untrusted_net_list.data(),\n            m_untrusted_net_list.size(),\n            m_trusted_net_list.data(),\n            m_trusted_net_list.size()),\n        \"Failed to initialize IPv4 set.\");\n}\n\nbool TrustedProxyConfig::is_trusted(const char* ipstr) const\n{\n    ib_ip4_t ip;\n\n    IronBee::throw_if_error(\n        ib_ip4_str_to_ip(ipstr, &ip),\n        \"Invalid remote IP address\");\n    ib_status_t rc =\n        ib_ipset4_query(&m_trusted_networks, ip, NULL, NULL, NULL);\n    return rc == IB_OK;\n}\n\nTrustedProxyModule::TrustedProxyModule(IronBee::Module module) :\n    IronBee::ModuleDelegate(module)\n{\n    module.set_configuration_data<TrustedProxyConfig>();\n\n    m_xff_target = IronBee::VarTarget::acquire_from_string(\n        module.engine().main_memory_pool(),\n        module.engine().var_config(),\n        \"request_headers:X-Forwarded-For\");\n\n    m_remote_addr_source = IronBee::VarSource::register_(\n        module.engine().var_config(),\n        IB_S2SL(\"remote_addr\"),\n        IB_PHASE_REQUEST_HEADER,\n        IB_PHASE_REQUEST_HEADER);\n\n    module.engine().register_configuration_directives()\n        .on_off(\n            \"TrustedProxyUseXFFHeader\",\n            boost::bind(&TrustedProxyModule::enable_xff_directive,\n                        this, _1, _3))\n        .list(\n            \"TrustedProxyIPs\",\n            boost::bind(&TrustedProxyModule::trusted_ips_directive,\n                        this, _1, _3));\n\n    module.engine().register_hooks()\n        .context_close(\n            boost::bind(&TrustedProxyModule::on_context_close,\n                        this, _1, _2))\n        .request_header_finished(\n            boost::bind(&TrustedProxyModule::set_effective_ip,\n                        this, _1, _2));\n}\n\nvoid TrustedProxyModule::enable_xff_directive(\n    IronBee::ConfigurationParser cp,\n    bool                         enabled\n)\n{\n    TrustedProxyConfig& config =\n        module().configuration_data<TrustedProxyConfig>(cp.current_context());\n    config.set_xff_enabled(enabled);\n}\n\nvoid TrustedProxyModule::trusted_ips_directive(\n    IronBee::ConfigurationParser    cp,\n    IronBee::ConstList<const char*> ip_list\n)\n{\n    TrustedProxyConfig& config =\n        module().configuration_data<TrustedProxyConfig>(cp.current_context());\n\n    const char* first_arg = ip_list.front();\n    if (*first_arg != '+' and *first_arg != '-') {\n        config.clear_networks();\n    }\n\n    BOOST_FOREACH(const char* arg, ip_list) {\n        if (*arg == '+') {\n            config.add_trusted_network(arg+1);\n        }\n        else if (*arg == '-') {\n            config.add_untrusted_network(arg+1);\n        }\n        else {\n            config.add_trusted_network(arg);\n        }\n    }\n}\n\nvoid TrustedProxyModule::on_context_close(\n    IronBee::Engine ib,\n    IronBee::Context ctx\n)\n{\n    TrustedProxyConfig& config =\n        module().configuration_data<TrustedProxyConfig>(ctx);\n\n    config.context_close(ib);\n}\n\nvoid TrustedProxyModule::set_effective_ip(\n    IronBee::Engine      ib,\n    IronBee::Transaction tx\n)\n{\n    ib_status_t rc;\n    IronBee::Context ctx = tx.context();\n    TrustedProxyConfig& config =\n        module().configuration_data<TrustedProxyConfig>(ctx);\n\n    ib_log_debug_tx(tx.ib(), \"checking: %s\",\n                   tx.connection().remote_ip_string());\n    \/\/ check actual remote ip against trusted ips\n    if (! config.is_trusted(tx.connection().remote_ip_string())) {\n        ib_log_debug_tx(tx.ib(), \"Remote address '%s' not a trusted proxy.\",\n                       tx.connection().remote_ip_string());\n        return;\n    }\n    \/\/ Remote address is trusted, get the X-Forwarded-For value\n    IronBee::ConstList<IronBee::ConstField> xfflist =\n        m_xff_target.get(tx.memory_pool(), tx.var_store());\n\n    if (xfflist.size() == 0) {\n        \/\/ No X-Forwarded-For header found. Nothing to do.\n        return;\n    }\n    \/\/ Use the final IP address in X-Forwarded-For\n    string forwarded = xfflist.back().to_s();\n    list<string> forwarded_list;\n    boost::algorithm::split(forwarded_list,\n                            forwarded,\n                            boost::algorithm::is_any_of(\",\"));\n\n    string remote_ip = boost::algorithm::trim_copy(forwarded_list.back());\n\n    \/* Verify that it looks like a valid IP address, ignore it if not *\/\n    rc = ib_ip_validate(remote_ip.c_str());\n    if (rc != IB_OK) {\n        ib_log_error_tx(tx.ib(),\n                        \"X-Forwarded-For \\\"%s\\\" is not a valid IP address\",\n                        remote_ip.c_str());\n        return;\n    }\n    char* buf = static_cast<char*>(tx.memory_pool().alloc(remote_ip.length()+1));\n    strcpy(buf, remote_ip.c_str());\n\n    \/* This will lose the pointer to the original address\n     * buffer, but it should be cleaned up with the rest\n     * of the memory pool. *\/\n    tx.ib()->remote_ipstr = buf;\n\n    ib_log_debug_tx(tx.ib(), \"Remote address changed to \\\"%s\\\"\", buf);\n    IronBee::ByteString remote_addr_bs = IronBee::ByteString::create_alias(\n        tx.memory_pool(),\n        buf,\n        remote_ip.length());\n    IronBee::Field remote_addr_field = IronBee::Field::create_byte_string(\n        tx.memory_pool(),\n        \"\", 0,\n        remote_addr_bs);\n    m_remote_addr_source.set(tx.var_store(), remote_addr_field);\n}\n\n} \/\/ Anonymous namespace\n<commit_msg>modules\/trusted_proxy.cpp: Indentation cleanup.<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 IronBee --- Trusted Proxy Module\n *\/\n\n\/\/ Include all of IronBee++\n#include <ironbeepp\/all.hpp>\n#include <ironbee\/ipset.h>\n#include <ironbee\/string.h>\n\n#include <boost\/algorithm\/string\/split.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n#include <boost\/bind.hpp>\n\n#include <vector>\n\nusing namespace std;\n\nnamespace {\n\n\/**\n * Configuration for the Trusted Proxy Module\n *\/\nclass TrustedProxyConfig\n{\npublic:\n    \/\/! Constructor.\n    TrustedProxyConfig();\n\n    \/\/! Is X-Forwarded-For handling enabled?\n    bool is_xff_enabled() const;\n\n    \/\/! Enable or disable X-Forwarded-For handling.\n    void set_xff_enabled(bool enabled);\n\n    \/\/! Clear the trusted and untrusted network lists.\n    void clear_networks();\n\n    \/\/! Add a network to the trusted list.\n    void add_trusted_network(const char* network);\n\n    \/\/! Add a network to the untrusted list.\n    void add_untrusted_network(const char* network);\n\n    \/**\n     * Check if the ip address is trusted.\n     *\n     * The default is to trust all addresses.\n     *\n     * @param[in] ipstr IP address to check.\n     *\n     * @returns True if the address is trusted.\n     *\/\n    bool is_trusted(const char* ipstr) const;\n\n    \/\/! Finalize the configuration when the context is closed.\n    void context_close(IronBee::Engine& ib);\n\nprivate:\n    \/\/! X-Forwarding-For handling enabled?\n    bool m_xff_enabled;\n\n    \/\/! List of trusted networks\n    vector<ib_ipset4_entry_t> m_trusted_net_list;\n\n    \/\/! List of untrusted networks\n    vector<ib_ipset4_entry_t> m_untrusted_net_list;\n\n    \/\/! IP set of the trusted and untrusted networks.\n    ib_ipset4_t m_trusted_networks;\n};\n\n\/**\n * Module to handle X-Forwarded-For headers from trusted Proxies.\n *\/\nclass TrustedProxyModule : public IronBee::ModuleDelegate\n{\npublic:\n    \/\/! Constructor.\n    explicit TrustedProxyModule(IronBee::Module module);\n\nprivate:\n    \/\/! X-Forward-For lookup target.\n    IronBee::ConstVarTarget m_xff_target;\n\n    \/\/! Source for recording the remote address\n    IronBee::VarSource m_remote_addr_source;\n\n    \/**\n     * Handle the TrustedProxyUseXFFHeader directive.\n     *\n     * @param[in] cp Configuration parser.\n     * @param[in] enabled Should XFF handling be enabled?\n     *\/\n    void enable_xff_directive(\n        IronBee::ConfigurationParser cp,\n        bool                         enabled);\n\n    \/**\n     * @param[in] cp Configuration parser.\n     * @param[in] ip_list List of IPs or CIDR blocks.\n     *\/\n    void trusted_ips_directive(\n        IronBee::ConfigurationParser    cp,\n        IronBee::ConstList<const char*> ip_list);\n\n    void on_context_close(IronBee::Engine ib, IronBee::Context ctx);\n\n    \/**\n     * Update the transaction effective IP based.\n     *\n     * @param[in] ib Ironbee engine.\n     * @param[in,out] tx Transaction to update.\n     *\/\n    void set_effective_ip(\n        IronBee::Engine      ib,\n        IronBee::Transaction tx);\n};\n\n} \/\/ Anonymous namespace\n\nIBPP_BOOTSTRAP_MODULE_DELEGATE(\"TrustedProxyModule\", TrustedProxyModule)\n\nnamespace {\n\nvoid make_ipset_entry(const char* cidr_or_ip, ib_ipset4_entry_t& entry)\n{\n    if (strchr(cidr_or_ip, '\/') != NULL) {\n        \/\/ Has \/ assume CIDR\n        IronBee::throw_if_error(\n            ib_ip4_str_to_net(cidr_or_ip, &(entry.network)),\n            \"Invalid CIDR block\");\n    }\n    else {\n        \/\/ IP make \/32\n        IronBee::throw_if_error(\n            ib_ip4_str_to_ip(cidr_or_ip, &(entry.network.ip)),\n            \"Invalid IP address\");\n        entry.network.size=32;\n    }\n}\n\nTrustedProxyConfig::TrustedProxyConfig()\n    : m_xff_enabled(true)\n{\n    ib_ipset4_init(&m_trusted_networks, NULL, 0, NULL, 0);\n}\n\nbool TrustedProxyConfig::is_xff_enabled() const\n{\n    return m_xff_enabled;\n}\n\nvoid TrustedProxyConfig::set_xff_enabled(bool enabled)\n{\n    m_xff_enabled = enabled;\n}\n\nvoid TrustedProxyConfig::clear_networks()\n{\n    m_trusted_net_list.clear();\n    m_untrusted_net_list.clear();\n}\n\nvoid TrustedProxyConfig::add_trusted_network(const char* cidr_or_ip)\n{\n    ib_ipset4_entry_t net_entry;\n    make_ipset_entry(cidr_or_ip, net_entry);\n    m_trusted_net_list.push_back(net_entry);\n}\n\nvoid TrustedProxyConfig::add_untrusted_network(const char* cidr_or_ip)\n{\n    ib_ipset4_entry_t net_entry;\n    make_ipset_entry(cidr_or_ip, net_entry);\n    m_untrusted_net_list.push_back(net_entry);\n}\n\nvoid TrustedProxyConfig::context_close(IronBee::Engine& ib)\n{\n    IronBee::throw_if_error(\n        ib_ipset4_init(\n            &m_trusted_networks,\n            m_untrusted_net_list.data(),\n            m_untrusted_net_list.size(),\n            m_trusted_net_list.data(),\n            m_trusted_net_list.size()),\n        \"Failed to initialize IPv4 set.\");\n}\n\nbool TrustedProxyConfig::is_trusted(const char* ipstr) const\n{\n    ib_ip4_t ip;\n\n    IronBee::throw_if_error(\n        ib_ip4_str_to_ip(ipstr, &ip),\n        \"Invalid remote IP address\");\n    ib_status_t rc =\n        ib_ipset4_query(&m_trusted_networks, ip, NULL, NULL, NULL);\n    return rc == IB_OK;\n}\n\nTrustedProxyModule::TrustedProxyModule(IronBee::Module module) :\n    IronBee::ModuleDelegate(module)\n{\n    module.set_configuration_data<TrustedProxyConfig>();\n\n    m_xff_target = IronBee::VarTarget::acquire_from_string(\n        module.engine().main_memory_pool(),\n        module.engine().var_config(),\n        \"request_headers:X-Forwarded-For\");\n\n    m_remote_addr_source = IronBee::VarSource::register_(\n        module.engine().var_config(),\n        IB_S2SL(\"remote_addr\"),\n        IB_PHASE_REQUEST_HEADER,\n        IB_PHASE_REQUEST_HEADER);\n\n    module.engine().register_configuration_directives()\n        .on_off(\n            \"TrustedProxyUseXFFHeader\",\n            boost::bind(&TrustedProxyModule::enable_xff_directive,\n                        this, _1, _3))\n        .list(\n            \"TrustedProxyIPs\",\n            boost::bind(&TrustedProxyModule::trusted_ips_directive,\n                        this, _1, _3));\n\n    module.engine().register_hooks()\n        .context_close(\n            boost::bind(&TrustedProxyModule::on_context_close,\n                        this, _1, _2))\n        .request_header_finished(\n            boost::bind(&TrustedProxyModule::set_effective_ip,\n                        this, _1, _2));\n}\n\nvoid TrustedProxyModule::enable_xff_directive(\n    IronBee::ConfigurationParser cp,\n    bool                         enabled\n)\n{\n    TrustedProxyConfig& config =\n        module().configuration_data<TrustedProxyConfig>(cp.current_context());\n    config.set_xff_enabled(enabled);\n}\n\nvoid TrustedProxyModule::trusted_ips_directive(\n    IronBee::ConfigurationParser    cp,\n    IronBee::ConstList<const char*> ip_list\n)\n{\n    TrustedProxyConfig& config =\n        module().configuration_data<TrustedProxyConfig>(cp.current_context());\n\n    const char* first_arg = ip_list.front();\n    if (*first_arg != '+' and *first_arg != '-') {\n        config.clear_networks();\n    }\n\n    BOOST_FOREACH(const char* arg, ip_list) {\n        if (*arg == '+') {\n            config.add_trusted_network(arg+1);\n        }\n        else if (*arg == '-') {\n            config.add_untrusted_network(arg+1);\n        }\n        else {\n            config.add_trusted_network(arg);\n        }\n    }\n}\n\nvoid TrustedProxyModule::on_context_close(\n    IronBee::Engine ib,\n    IronBee::Context ctx\n)\n{\n    TrustedProxyConfig& config =\n        module().configuration_data<TrustedProxyConfig>(ctx);\n\n    config.context_close(ib);\n}\n\nvoid TrustedProxyModule::set_effective_ip(\n    IronBee::Engine      ib,\n    IronBee::Transaction tx\n)\n{\n    ib_status_t rc;\n    IronBee::Context ctx = tx.context();\n    TrustedProxyConfig& config =\n        module().configuration_data<TrustedProxyConfig>(ctx);\n\n    ib_log_debug_tx(tx.ib(), \"checking: %s\",\n                    tx.connection().remote_ip_string());\n    \/\/ check actual remote ip against trusted ips\n    if (! config.is_trusted(tx.connection().remote_ip_string())) {\n        ib_log_debug_tx(tx.ib(), \"Remote address '%s' not a trusted proxy.\",\n                        tx.connection().remote_ip_string());\n        return;\n    }\n    \/\/ Remote address is trusted, get the X-Forwarded-For value\n    IronBee::ConstList<IronBee::ConstField> xfflist =\n        m_xff_target.get(tx.memory_pool(), tx.var_store());\n\n    if (xfflist.size() == 0) {\n        \/\/ No X-Forwarded-For header found. Nothing to do.\n        return;\n    }\n    \/\/ Use the final IP address in X-Forwarded-For\n    string forwarded = xfflist.back().to_s();\n    list<string> forwarded_list;\n    boost::algorithm::split(forwarded_list,\n                            forwarded,\n                            boost::algorithm::is_any_of(\",\"));\n\n    string remote_ip = boost::algorithm::trim_copy(forwarded_list.back());\n\n    \/* Verify that it looks like a valid IP address, ignore it if not *\/\n    rc = ib_ip_validate(remote_ip.c_str());\n    if (rc != IB_OK) {\n        ib_log_error_tx(tx.ib(),\n                        \"X-Forwarded-For \\\"%s\\\" is not a valid IP address\",\n                        remote_ip.c_str());\n        return;\n    }\n    char* buf = static_cast<char*>(tx.memory_pool().alloc(remote_ip.length()+1));\n    strcpy(buf, remote_ip.c_str());\n\n    \/* This will lose the pointer to the original address\n     * buffer, but it should be cleaned up with the rest\n     * of the memory pool. *\/\n    tx.ib()->remote_ipstr = buf;\n\n    ib_log_debug_tx(tx.ib(), \"Remote address changed to \\\"%s\\\"\", buf);\n    IronBee::ByteString remote_addr_bs = IronBee::ByteString::create_alias(\n        tx.memory_pool(),\n        buf,\n        remote_ip.length());\n    IronBee::Field remote_addr_field = IronBee::Field::create_byte_string(\n        tx.memory_pool(),\n        \"\", 0,\n        remote_addr_bs);\n    m_remote_addr_source.set(tx.var_store(), remote_addr_field);\n}\n\n} \/\/ Anonymous namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of libkpimexchange.\n    Copyright (c) 2002 Tobias Koenig <tokoe@kde.org>\n    Copyright (c) 2002 Jan-Pascal van Best <janpascal@vanbest.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 <qlabel.h>\n#include <qlayout.h>\n\n#include <klocale.h>\n#include <kdebug.h>\n#include <kstandarddirs.h>\n#include <kmessagebox.h>\n\n#include \"exchangeaccount.h\"\n#include \"resourceexchangeconfig.h\"\n#include \"resourceexchange.h\"\n\nusing namespace KCal;\n\nResourceExchangeConfig::ResourceExchangeConfig( QWidget* parent,  const char* name )\n    : KRES::ResourceConfigWidget( parent, name )\n{\n  resize( 245, 115 ); \n  QGridLayout *mainLayout = new QGridLayout( this, 7, 3 );\n\n  QLabel *label = new QLabel( i18n( \"Host:\" ), this );\n  mHostEdit = new KLineEdit( this );\n  mainLayout->addWidget( label, 1, 0 );\n  mainLayout->addWidget( mHostEdit, 1, 1 );\n\n  label = new QLabel( i18n( \"Account:\" ), this );\n  mAccountEdit = new KLineEdit( this );\n  mainLayout->addWidget( label, 2, 0 );\n  mainLayout->addWidget( mAccountEdit, 2, 1 );\n\n  label = new QLabel( i18n( \"Password:\" ), this );\n  mPasswordEdit = new KLineEdit( this );\n  mPasswordEdit->setEchoMode( QLineEdit::Password );\n  mainLayout->addWidget( label, 3, 0 );\n  mainLayout->addWidget( mPasswordEdit, 3, 1 );\n\n  mMailboxEqualsUser = new QCheckBox( i18n( \"Exchange Mailbox is &equal to User\" ), this );\n  mainLayout->addMultiCellWidget( mMailboxEqualsUser, 4, 4, 0, 1 );\n  connect( mMailboxEqualsUser, SIGNAL(toggled(bool)), this, SLOT(slotToggleEquals(bool)) );\n\n  mMailboxEdit = new KLineEdit( this );\n  mainLayout->addWidget( new QLabel( i18n( \"Mailbox URL:\" ), this ), 5, 0 );\n  mainLayout->addWidget( mMailboxEdit, 5, 1 );\n\n  mTryFindMailbox = new QPushButton( \"&Find\", this );\n  mainLayout->addWidget( mTryFindMailbox, 5, 2 );\n  connect( mTryFindMailbox, SIGNAL(clicked()), this, SLOT(slotFindClicked()) );\n\n  label = new QLabel( i18n( \"Cache timeout:\" ), this );\n  mCacheEdit = new KIntNumInput( this );\n  mCacheEdit->setMinValue( 0 );\n  mCacheEdit->setSuffix( i18n(\" seconds\") );\n  mainLayout->addWidget( label, 6, 0 );\n  mainLayout->addWidget( mCacheEdit, 6, 1 );\n}\n\nvoid ResourceExchangeConfig::loadSettings( KRES::Resource *resource )\n{\n  ResourceExchange* res = dynamic_cast<ResourceExchange*>( resource );\n  if (res) {\n    mHostEdit->setText( res->mAccount->host() );\n    mAccountEdit->setText( res->mAccount->account() );\n    mPasswordEdit->setText( res->mAccount->password() );\n    mMailboxEqualsUser->setChecked( res->mAccount->mailbox() == (\"webdav:\/\/\"+res->mAccount->host()+\"\/exchange\/\"+res->mAccount->account() ) );\n    mMailboxEdit->setText( res->mAccount->mailbox() );\n    mCacheEdit->setValue( res->mCachedSeconds );\n  } else\n    kdDebug(5700) << \"ERROR: ResourceExchangeConfig::loadSettings(): no ResourceExchange, cast failed\" << endl;\n}\n\nvoid ResourceExchangeConfig::saveSettings( KRES::Resource *resource )\n{\n  ResourceExchange* res = dynamic_cast<ResourceExchange*>( resource );\n  if (res) {\n    res->mAccount->setHost(mHostEdit->text());\n    res->mAccount->setAccount(mAccountEdit->text());\n    res->mAccount->setPassword(mPasswordEdit->text());\n    if ( mMailboxEqualsUser->isChecked() ) {\n      res->mAccount->setMailbox( \"webdav:\/\/\" + mHostEdit->text() + \"\/exchange\/\" + mAccountEdit->text() );\n    } else {\n      res->mAccount->setMailbox( mAccountEdit->text() );\n    }\n    res->mCachedSeconds = mCacheEdit->value();\n  } else\n    kdDebug(5700) << \"ERROR: ResourceExchangeConfig::saveSettings(): no ResourceExchange, cast failed\" << endl;\n}\n\nvoid ResourceExchangeConfig::slotToggleEquals( bool on )\n{\n  mMailboxEdit->setEnabled( ! on );\n  mTryFindMailbox->setEnabled( ! on );\n  if ( on ) {\n    mMailboxEdit->setText( \"webdav:\/\/\" + mHostEdit->text() + \"\/exchange\/\" + mAccountEdit->text() );\n  }\n}\n\nvoid ResourceExchangeConfig::slotUserChanged( const QString& text )\n{\n  if ( mMailboxEqualsUser->isChecked() ) {\n    mMailboxEdit->setText( \"webdav:\/\/\" + mHostEdit->text() + \"\/exchange\/\" + text );\n  }\n}\n\nvoid ResourceExchangeConfig::slotFindClicked()\n{\n  QString mailbox = KPIM::ExchangeAccount::tryFindMailbox( mHostEdit->text(), mAccountEdit->text(), mPasswordEdit->text() );\n  if ( mailbox.isNull() ) {\n    KMessageBox::sorry( this, \"Could not determine mailbox URL\" );\n  } else {\n    mMailboxEdit->setText( mailbox );\n  }\n}\n\n#include \"resourceexchangeconfig.moc\"\n<commit_msg>Fix buglet: retain edited mailbox url<commit_after>\/*\n    This file is part of libkpimexchange.\n    Copyright (c) 2002 Tobias Koenig <tokoe@kde.org>\n    Copyright (c) 2002 Jan-Pascal van Best <janpascal@vanbest.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 <qlabel.h>\n#include <qlayout.h>\n\n#include <klocale.h>\n#include <kdebug.h>\n#include <kstandarddirs.h>\n#include <kmessagebox.h>\n\n#include \"exchangeaccount.h\"\n#include \"resourceexchangeconfig.h\"\n#include \"resourceexchange.h\"\n\nusing namespace KCal;\n\nResourceExchangeConfig::ResourceExchangeConfig( QWidget* parent,  const char* name )\n    : KRES::ResourceConfigWidget( parent, name )\n{\n  resize( 245, 115 ); \n  QGridLayout *mainLayout = new QGridLayout( this, 7, 3 );\n\n  QLabel *label = new QLabel( i18n( \"Host:\" ), this );\n  mHostEdit = new KLineEdit( this );\n  mainLayout->addWidget( label, 1, 0 );\n  mainLayout->addWidget( mHostEdit, 1, 1 );\n\n  label = new QLabel( i18n( \"Account:\" ), this );\n  mAccountEdit = new KLineEdit( this );\n  mainLayout->addWidget( label, 2, 0 );\n  mainLayout->addWidget( mAccountEdit, 2, 1 );\n\n  label = new QLabel( i18n( \"Password:\" ), this );\n  mPasswordEdit = new KLineEdit( this );\n  mPasswordEdit->setEchoMode( QLineEdit::Password );\n  mainLayout->addWidget( label, 3, 0 );\n  mainLayout->addWidget( mPasswordEdit, 3, 1 );\n\n  mMailboxEqualsUser = new QCheckBox( i18n( \"Exchange Mailbox is &equal to User\" ), this );\n  mainLayout->addMultiCellWidget( mMailboxEqualsUser, 4, 4, 0, 1 );\n  connect( mMailboxEqualsUser, SIGNAL(toggled(bool)), this, SLOT(slotToggleEquals(bool)) );\n\n  mMailboxEdit = new KLineEdit( this );\n  mainLayout->addWidget( new QLabel( i18n( \"Mailbox URL:\" ), this ), 5, 0 );\n  mainLayout->addWidget( mMailboxEdit, 5, 1 );\n\n  mTryFindMailbox = new QPushButton( \"&Find\", this );\n  mainLayout->addWidget( mTryFindMailbox, 5, 2 );\n  connect( mTryFindMailbox, SIGNAL(clicked()), this, SLOT(slotFindClicked()) );\n\n  label = new QLabel( i18n( \"Cache timeout:\" ), this );\n  mCacheEdit = new KIntNumInput( this );\n  mCacheEdit->setMinValue( 0 );\n  mCacheEdit->setSuffix( i18n(\" seconds\") );\n  mainLayout->addWidget( label, 6, 0 );\n  mainLayout->addWidget( mCacheEdit, 6, 1 );\n}\n\nvoid ResourceExchangeConfig::loadSettings( KRES::Resource *resource )\n{\n  ResourceExchange* res = dynamic_cast<ResourceExchange*>( resource );\n  if (res) {\n    mHostEdit->setText( res->mAccount->host() );\n    mAccountEdit->setText( res->mAccount->account() );\n    mPasswordEdit->setText( res->mAccount->password() );\n    mMailboxEqualsUser->setChecked( res->mAccount->mailbox() == (\"webdav:\/\/\"+res->mAccount->host()+\"\/exchange\/\"+res->mAccount->account() ) );\n    mMailboxEdit->setText( res->mAccount->mailbox() );\n    mCacheEdit->setValue( res->mCachedSeconds );\n  } else\n    kdDebug(5700) << \"ERROR: ResourceExchangeConfig::loadSettings(): no ResourceExchange, cast failed\" << endl;\n}\n\nvoid ResourceExchangeConfig::saveSettings( KRES::Resource *resource )\n{\n  ResourceExchange* res = dynamic_cast<ResourceExchange*>( resource );\n  if (res) {\n    res->mAccount->setHost(mHostEdit->text());\n    res->mAccount->setAccount(mAccountEdit->text());\n    res->mAccount->setPassword(mPasswordEdit->text());\n    if ( mMailboxEqualsUser->isChecked() ) {\n      res->mAccount->setMailbox( \"webdav:\/\/\" + mHostEdit->text() + \"\/exchange\/\" + mAccountEdit->text() );\n    } else {\n      res->mAccount->setMailbox( mMailboxEdit->text() );\n    }\n    res->mCachedSeconds = mCacheEdit->value();\n  } else\n    kdDebug(5700) << \"ERROR: ResourceExchangeConfig::saveSettings(): no ResourceExchange, cast failed\" << endl;\n}\n\nvoid ResourceExchangeConfig::slotToggleEquals( bool on )\n{\n  mMailboxEdit->setEnabled( ! on );\n  mTryFindMailbox->setEnabled( ! on );\n  if ( on ) {\n    mMailboxEdit->setText( \"webdav:\/\/\" + mHostEdit->text() + \"\/exchange\/\" + mAccountEdit->text() );\n  }\n}\n\nvoid ResourceExchangeConfig::slotUserChanged( const QString& text )\n{\n  if ( mMailboxEqualsUser->isChecked() ) {\n    mMailboxEdit->setText( \"webdav:\/\/\" + mHostEdit->text() + \"\/exchange\/\" + text );\n  }\n}\n\nvoid ResourceExchangeConfig::slotFindClicked()\n{\n  QString mailbox = KPIM::ExchangeAccount::tryFindMailbox( mHostEdit->text(), mAccountEdit->text(), mPasswordEdit->text() );\n  if ( mailbox.isNull() ) {\n    KMessageBox::sorry( this, \"Could not determine mailbox URL\" );\n  } else {\n    mMailboxEdit->setText( mailbox );\n  }\n}\n\n#include \"resourceexchangeconfig.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: usercontrol.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: fs $ $Date: 2001-02-13 15:36: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 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_PROPCTRLR_USERCONTROL_HXX_\n#include \"usercontrol.hxx\"\n#endif\n\n#ifndef _NUMUNO_HXX\n#include <svtools\/numuno.hxx>\n#endif\n#ifndef _TOOLS_SOLMATH_HXX\n#include <tools\/solmath.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _ZFORMAT_HXX\n#include <svtools\/zformat.hxx>\n#endif\n\n\/\/............................................................................\nnamespace pcr\n{\n\/\/............................................................................\n\n    \/\/==================================================================\n    \/\/ class OFormatDescriptionControl\n    \/\/==================================================================\n    \/\/------------------------------------------------------------------\n    OFormatDescriptionControl::OFormatDescriptionControl( Window* pParent, WinBits nWinStyle)\n            :OCommonBehaviourControl(this)\n            ,FormattedField(pParent, nWinStyle)\n    {\n        SetModifyHdl(LINK( this, OCommonBehaviourControl, ModifiedHdl ));\n        SetGetFocusHdl(LINK( this, OCommonBehaviourControl, GetFocusHdl));\n        SetLoseFocusHdl(LINK( this, OCommonBehaviourControl, LoseFocusHdl));\n\n        autoSizeWindow();\n    }\n\n    \/\/------------------------------------------------------------------\n    long OFormatDescriptionControl::PreNotify( NotifyEvent& rNEvt )\n    {\n        \/\/ want to handle two keys myself : Del\/Backspace should empty the window (setting my prop to \"standard\" this way)\n        if (EVENT_KEYINPUT == rNEvt.GetType())\n        {\n            sal_uInt16 nKey = rNEvt.GetKeyEvent()->GetKeyCode().GetCode();\n\n            if ((KEY_DELETE == nKey) || (KEY_BACKSPACE == nKey))\n            {\n                SetText(String());\n                ModifiedHdl(this);\n                return sal_True;\n            }\n        }\n\n        if (OCommonBehaviourControl::handlePreNotify(rNEvt))\n            return sal_True;\n\n        \/\/ it wasn't a PropCommonControl event => let our window handle it\n        return FormattedField::PreNotify(rNEvt);\n    }\n\n    \/\/------------------------------------------------------------------\n    void OFormatDescriptionControl::SetProperty(const ::rtl::OUString& rString, sal_Bool bIsUnknown)\n    {\n        if (bIsUnknown || (rString == m_sStandardString) || !rString.getLength())\n            \/\/ unknown or standard -> no text\n            SetText(String());\n        else\n        {\n            \/\/ else set the new format key, the text will be reformatted\n            SetValue(1234.56789);\n            SetFormatKey(String(rString).ToInt32());\n        }\n    }\n\n    \/\/------------------------------------------------------------------\n    ::rtl::OUString OFormatDescriptionControl::GetProperty() const\n    {\n        if (!GetText().Len())\n            return m_sStandardString;\n        else\n            return String::CreateFromInt32(GetFormatKey());\n    }\n\n    \/\/------------------------------------------------------------------\n    void OFormatDescriptionControl::SetFormatSupplier(const SvNumberFormatsSupplierObj* pSupplier)\n    {\n        if (pSupplier)\n        {\n            TreatAsNumber(sal_True);\n\n            SvNumberFormatter* pFormatter = pSupplier->GetNumberFormatter();\n            SetFormatter(pFormatter, sal_True);\n            SetValue(1234.56789);\n        }\n        else\n        {\n            TreatAsNumber(sal_False);\n            SetFormatter(NULL, sal_True);\n            SetText(String());\n        }\n    }\n\n    \/\/==================================================================\n    \/\/ class OFormattedNumericControl\n    \/\/==================================================================\n    DBG_NAME(OFormattedNumericControl);\n    \/\/------------------------------------------------------------------\n    OFormattedNumericControl::OFormattedNumericControl( Window* pParent, WinBits nWinStyle)\n            :OCommonBehaviourControl(this)\n            ,FormattedField(pParent, nWinStyle)\n    {\n        DBG_CTOR(OFormattedNumericControl,NULL);\n\n        SetModifyHdl(LINK( this, OFormattedNumericControl, ModifiedHdl ));\n        SetGetFocusHdl(LINK( this, OFormattedNumericControl, GetFocusHdl));\n        SetLoseFocusHdl(LINK( this, OFormattedNumericControl, LoseFocusHdl));\n\n        autoSizeWindow();\n\n        TreatAsNumber(sal_True);\n\n        m_nLastDecimalDigits = GetDecimalDigits();\n    }\n\n    \/\/------------------------------------------------------------------\n    OFormattedNumericControl::~OFormattedNumericControl()\n    {\n        DBG_DTOR(OFormattedNumericControl,NULL);\n    }\n\n    \/\/------------------------------------------------------------------\n    long OFormattedNumericControl::PreNotify( NotifyEvent& rNEvt )\n    {\n        if (OCommonBehaviourControl::handlePreNotify(rNEvt))\n            return sal_True;\n\n        \/\/ it wasn't a PropCommonControl event => let our window handle it\n        return FormattedField::PreNotify(rNEvt);\n    }\n\n    \/\/------------------------------------------------------------------\n    void OFormattedNumericControl::SetProperty(const ::rtl::OUString& rString, sal_Bool bIsUnknown)\n    {\n        if (bIsUnknown || (rString == m_sStandardString) || !rString.getLength())\n            \/\/ unknown or standard -> no text\n            SetText(String());\n        else\n        {\n            SetValue(String(rString).ToDouble());\n        }\n    }\n\n    \/\/------------------------------------------------------------------\n    ::rtl::OUString OFormattedNumericControl::GetProperty() const\n    {\n        if (!GetText().Len())\n            return m_sStandardString;\n        else\n        {\n            String sReturn;\n            SolarMath::DoubleToString(\n                sReturn, const_cast<OFormattedNumericControl*>(this)->GetValue(), 'F', m_nLastDecimalDigits,\n                '.', sal_True);\n                \/\/ always use a '.' (instead of the decimal separator given by m_aUsedInternational) :\n                \/\/ when the returned string is interpreted nobody knows about this control or the used\n                \/\/ international, so by convention we always use '.' for describing floating point numbers\n                \/\/ 27.07.99 - 67901 - FS\n            return sReturn;\n        }\n    }\n\n    \/\/------------------------------------------------------------------\n    void OFormattedNumericControl::SetFormatDescription(const FormatDescription& rDesc)\n    {\n        if (rDesc.pSupplier)\n        {\n            TreatAsNumber(sal_True);\n\n            SvNumberFormatter* pFormatter = rDesc.pSupplier->GetNumberFormatter();\n            if (pFormatter != GetFormatter())\n                SetFormatter(pFormatter, sal_True);\n            SetFormatKey(rDesc.nKey);\n\n            const SvNumberformat* pEntry = GetFormatter()->GetEntry(GetFormatKey());\n            switch (pEntry->GetType() & ~NUMBERFORMAT_DEFINED)\n            {\n                case NUMBERFORMAT_NUMBER:\n                case NUMBERFORMAT_CURRENCY:\n                case NUMBERFORMAT_SCIENTIFIC:\n                case NUMBERFORMAT_FRACTION:\n                case NUMBERFORMAT_PERCENT:\n                    m_nLastDecimalDigits = GetDecimalDigits();\n                    break;\n                case NUMBERFORMAT_DATETIME:\n                case NUMBERFORMAT_DATE:\n                case NUMBERFORMAT_TIME:\n                    m_nLastDecimalDigits = 7;\n                    break;\n                default:\n                    m_nLastDecimalDigits = 0;\n                    break;\n            }\n\n        }\n        else\n        {\n            TreatAsNumber(sal_False);\n            SetFormatter(NULL, sal_True);\n            SetText(String());\n            m_nLastDecimalDigits = 0;\n        }\n    }\n\n\/\/............................................................................\n} \/\/ namespace pcr\n\/\/............................................................................\n\n\/*************************************************************************\n * history:\n *  $Log: not supported by cvs2svn $\n *  Revision 1.1  2001\/01\/12 11:34:02  fs\n *  initial checkin - outsourced the form property browser\n *\n *\n *  Revision 1.0 09.01.01 10:23:42  fs\n ************************************************************************\/\n\n<commit_msg>#i8485# SetFormatDescription: recognize invalid format keys<commit_after>\/*************************************************************************\n *\n *  $RCSfile: usercontrol.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: fs $ $Date: 2002-10-18 15:14: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 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_PROPCTRLR_USERCONTROL_HXX_\n#include \"usercontrol.hxx\"\n#endif\n\n#ifndef _NUMUNO_HXX\n#include <svtools\/numuno.hxx>\n#endif\n#ifndef _TOOLS_SOLMATH_HXX\n#include <tools\/solmath.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _ZFORMAT_HXX\n#include <svtools\/zformat.hxx>\n#endif\n\n\/\/............................................................................\nnamespace pcr\n{\n\/\/............................................................................\n\n    \/\/==================================================================\n    \/\/ class OFormatDescriptionControl\n    \/\/==================================================================\n    \/\/------------------------------------------------------------------\n    OFormatDescriptionControl::OFormatDescriptionControl( Window* pParent, WinBits nWinStyle)\n            :OCommonBehaviourControl(this)\n            ,FormattedField(pParent, nWinStyle)\n    {\n        SetModifyHdl(LINK( this, OCommonBehaviourControl, ModifiedHdl ));\n        SetGetFocusHdl(LINK( this, OCommonBehaviourControl, GetFocusHdl));\n        SetLoseFocusHdl(LINK( this, OCommonBehaviourControl, LoseFocusHdl));\n\n        autoSizeWindow();\n    }\n\n    \/\/------------------------------------------------------------------\n    long OFormatDescriptionControl::PreNotify( NotifyEvent& rNEvt )\n    {\n        \/\/ want to handle two keys myself : Del\/Backspace should empty the window (setting my prop to \"standard\" this way)\n        if (EVENT_KEYINPUT == rNEvt.GetType())\n        {\n            sal_uInt16 nKey = rNEvt.GetKeyEvent()->GetKeyCode().GetCode();\n\n            if ((KEY_DELETE == nKey) || (KEY_BACKSPACE == nKey))\n            {\n                SetText(String());\n                ModifiedHdl(this);\n                return sal_True;\n            }\n        }\n\n        if (OCommonBehaviourControl::handlePreNotify(rNEvt))\n            return sal_True;\n\n        \/\/ it wasn't a PropCommonControl event => let our window handle it\n        return FormattedField::PreNotify(rNEvt);\n    }\n\n    \/\/------------------------------------------------------------------\n    void OFormatDescriptionControl::SetProperty(const ::rtl::OUString& rString, sal_Bool bIsUnknown)\n    {\n        if (bIsUnknown || (rString == m_sStandardString) || !rString.getLength())\n            \/\/ unknown or standard -> no text\n            SetText(String());\n        else\n        {\n            \/\/ else set the new format key, the text will be reformatted\n            SetValue(1234.56789);\n            SetFormatKey(String(rString).ToInt32());\n        }\n    }\n\n    \/\/------------------------------------------------------------------\n    ::rtl::OUString OFormatDescriptionControl::GetProperty() const\n    {\n        if (!GetText().Len())\n            return m_sStandardString;\n        else\n            return String::CreateFromInt32(GetFormatKey());\n    }\n\n    \/\/------------------------------------------------------------------\n    void OFormatDescriptionControl::SetFormatSupplier(const SvNumberFormatsSupplierObj* pSupplier)\n    {\n        if (pSupplier)\n        {\n            TreatAsNumber(sal_True);\n\n            SvNumberFormatter* pFormatter = pSupplier->GetNumberFormatter();\n            SetFormatter(pFormatter, sal_True);\n            SetValue(1234.56789);\n        }\n        else\n        {\n            TreatAsNumber(sal_False);\n            SetFormatter(NULL, sal_True);\n            SetText(String());\n        }\n    }\n\n    \/\/==================================================================\n    \/\/ class OFormattedNumericControl\n    \/\/==================================================================\n    DBG_NAME(OFormattedNumericControl);\n    \/\/------------------------------------------------------------------\n    OFormattedNumericControl::OFormattedNumericControl( Window* pParent, WinBits nWinStyle)\n            :OCommonBehaviourControl(this)\n            ,FormattedField(pParent, nWinStyle)\n    {\n        DBG_CTOR(OFormattedNumericControl,NULL);\n\n        SetModifyHdl(LINK( this, OFormattedNumericControl, ModifiedHdl ));\n        SetGetFocusHdl(LINK( this, OFormattedNumericControl, GetFocusHdl));\n        SetLoseFocusHdl(LINK( this, OFormattedNumericControl, LoseFocusHdl));\n\n        autoSizeWindow();\n\n        TreatAsNumber(sal_True);\n\n        m_nLastDecimalDigits = GetDecimalDigits();\n    }\n\n    \/\/------------------------------------------------------------------\n    OFormattedNumericControl::~OFormattedNumericControl()\n    {\n        DBG_DTOR(OFormattedNumericControl,NULL);\n    }\n\n    \/\/------------------------------------------------------------------\n    long OFormattedNumericControl::PreNotify( NotifyEvent& rNEvt )\n    {\n        if (OCommonBehaviourControl::handlePreNotify(rNEvt))\n            return sal_True;\n\n        \/\/ it wasn't a PropCommonControl event => let our window handle it\n        return FormattedField::PreNotify(rNEvt);\n    }\n\n    \/\/------------------------------------------------------------------\n    void OFormattedNumericControl::SetProperty(const ::rtl::OUString& rString, sal_Bool bIsUnknown)\n    {\n        if (bIsUnknown || (rString == m_sStandardString) || !rString.getLength())\n            \/\/ unknown or standard -> no text\n            SetText(String());\n        else\n        {\n            SetValue(String(rString).ToDouble());\n        }\n    }\n\n    \/\/------------------------------------------------------------------\n    ::rtl::OUString OFormattedNumericControl::GetProperty() const\n    {\n        if (!GetText().Len())\n            return m_sStandardString;\n        else\n        {\n            String sReturn;\n            SolarMath::DoubleToString(\n                sReturn, const_cast<OFormattedNumericControl*>(this)->GetValue(), 'F', m_nLastDecimalDigits,\n                '.', sal_True);\n                \/\/ always use a '.' (instead of the decimal separator given by m_aUsedInternational) :\n                \/\/ when the returned string is interpreted nobody knows about this control or the used\n                \/\/ international, so by convention we always use '.' for describing floating point numbers\n                \/\/ 27.07.99 - 67901 - FS\n            return sReturn;\n        }\n    }\n\n    \/\/------------------------------------------------------------------\n    void OFormattedNumericControl::SetFormatDescription(const FormatDescription& rDesc)\n    {\n        sal_Bool bFallback = sal_True;\n\n        if (rDesc.pSupplier)\n        {\n            TreatAsNumber(sal_True);\n\n            SvNumberFormatter* pFormatter = rDesc.pSupplier->GetNumberFormatter();\n            if (pFormatter != GetFormatter())\n                SetFormatter(pFormatter, sal_True);\n            SetFormatKey(rDesc.nKey);\n\n            const SvNumberformat* pEntry = GetFormatter()->GetEntry(GetFormatKey());\n            DBG_ASSERT( pEntry, \"OFormattedNumericControl::SetFormatDescription: invalid format key!\" );\n            if ( pEntry )\n            {\n                switch (pEntry->GetType() & ~NUMBERFORMAT_DEFINED)\n                {\n                    case NUMBERFORMAT_NUMBER:\n                    case NUMBERFORMAT_CURRENCY:\n                    case NUMBERFORMAT_SCIENTIFIC:\n                    case NUMBERFORMAT_FRACTION:\n                    case NUMBERFORMAT_PERCENT:\n                        m_nLastDecimalDigits = GetDecimalDigits();\n                        break;\n                    case NUMBERFORMAT_DATETIME:\n                    case NUMBERFORMAT_DATE:\n                    case NUMBERFORMAT_TIME:\n                        m_nLastDecimalDigits = 7;\n                        break;\n                    default:\n                        m_nLastDecimalDigits = 0;\n                        break;\n                }\n                bFallback = sal_False;\n            }\n\n        }\n\n        if ( bFallback )\n        {\n            TreatAsNumber(sal_False);\n            SetFormatter(NULL, sal_True);\n            SetText(String());\n            m_nLastDecimalDigits = 0;\n        }\n    }\n\n\/\/............................................................................\n} \/\/ namespace pcr\n\/\/............................................................................\n\n\/*************************************************************************\n * history:\n *  $Log: not supported by cvs2svn $\n *  Revision 1.2  2001\/02\/13 15:36:13  fs\n *  #83843# SetFormatDescription: correctly calculate m_nLastDecimalDigits\n *\n *  Revision 1.1  2001\/01\/12 11:34:02  fs\n *  initial checkin - outsourced the form property browser\n *\n *\n *  Revision 1.0 09.01.01 10:23:42  fs\n ************************************************************************\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: download.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2007-07-06 14:36: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\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n\n#include <rtl\/ref.hxx>\n#include <rtl\/ustring.hxx>\n#include <osl\/conditn.hxx>\n#include <osl\/file.h>\n\nstruct DownloadInteractionHandler : public rtl::IReference\n{\n    \/\/ called if the destination file already exists, but resume is false\n    virtual bool downloadTargetExists(const rtl::OUString& rFileName) = 0;\n\n    \/\/ called when curl reports an error\n    virtual void downloadStalled(const rtl::OUString& rErrorMessage) = 0;\n\n    \/\/ progress handler\n    virtual void downloadProgressAt(sal_Int8 nPercent) = 0;\n\n    \/\/ called on first progress notification\n    virtual void downloadStarted(const rtl::OUString& rFileName) = 0;\n\n    \/\/ called when download has been finished\n    virtual void downloadFinished(const rtl::OUString& rFileName) = 0;\n};\n\n\nclass Download\n{\npublic:\n    Download(const com::sun::star::uno::Reference< com::sun::star::uno::XComponentContext >& xContext,\n             const rtl::Reference< DownloadInteractionHandler >& rHandler) : m_xContext(xContext), m_aHandler(rHandler) {};\n\n    \/\/ returns true when the content of rURL was successfully written to rLocalFile\n    bool start(const rtl::OUString& rURL, const rtl::OUString& rLocalFile, bool resume);\n\n    \/\/ stops the download after the next write operation\n    void stop();\n\n    \/\/ returns true if the stop condition is set\n    bool isStopped() const\n        { return sal_True == const_cast <Download *> (this)->m_aCondition.check(); };\n\nprotected:\n\n    \/\/ Determines the appropriate proxy settings for the given URL. Returns true if a proxy should be used\n    void getProxyForURL(const rtl::OUString& rURL, rtl::OString& rHost, sal_Int32& rPort) const;\n\nprivate:\n    osl::Condition m_aCondition;\n    const com::sun::star::uno::Reference< com::sun::star::uno::XComponentContext >& m_xContext;\n    const rtl::Reference< DownloadInteractionHandler > m_aHandler;\n};\n\n\n<commit_msg>INTEGRATION: CWS updchk07 (1.2.2); FILE MERGED 2007\/07\/18 14:23:29 obr 1.2.2.2: #i79252# store total download size to be able to reconstruct progress after restart 2007\/07\/09 10:46:55 obr 1.2.2.1: #i79134# split file name of started download from default target dir<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: download.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2007-07-31 15:56: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\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n\n#include <rtl\/ref.hxx>\n#include <rtl\/ustring.hxx>\n#include <osl\/conditn.hxx>\n#include <osl\/file.h>\n\nstruct DownloadInteractionHandler : public rtl::IReference\n{\n    \/\/ called if the destination file already exists, but resume is false\n    virtual bool downloadTargetExists(const rtl::OUString& rFileName) = 0;\n\n    \/\/ called when curl reports an error\n    virtual void downloadStalled(const rtl::OUString& rErrorMessage) = 0;\n\n    \/\/ progress handler\n    virtual void downloadProgressAt(sal_Int8 nPercent) = 0;\n\n    \/\/ called on first progress notification\n    virtual void downloadStarted(const rtl::OUString& rFileName, sal_Int64 nFileSize) = 0;\n\n    \/\/ called when download has been finished\n    virtual void downloadFinished(const rtl::OUString& rFileName) = 0;\n};\n\n\nclass Download\n{\npublic:\n    Download(const com::sun::star::uno::Reference< com::sun::star::uno::XComponentContext >& xContext,\n             const rtl::Reference< DownloadInteractionHandler >& rHandler) : m_xContext(xContext), m_aHandler(rHandler) {};\n\n    \/\/ returns true when the content of rURL was successfully written to rLocalFile\n    bool start(const rtl::OUString& rURL, const rtl::OUString& rFile, const rtl::OUString& rDestinationDir);\n\n    \/\/ stops the download after the next write operation\n    void stop();\n\n    \/\/ returns true if the stop condition is set\n    bool isStopped() const\n        { return sal_True == const_cast <Download *> (this)->m_aCondition.check(); };\n\nprotected:\n\n    \/\/ Determines the appropriate proxy settings for the given URL. Returns true if a proxy should be used\n    void getProxyForURL(const rtl::OUString& rURL, rtl::OString& rHost, sal_Int32& rPort) const;\n\nprivate:\n    osl::Condition m_aCondition;\n    const com::sun::star::uno::Reference< com::sun::star::uno::XComponentContext >& m_xContext;\n    const rtl::Reference< DownloadInteractionHandler > m_aHandler;\n};\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of the Sqloxx project and is distributed under the\n * terms of the license contained in the file LICENSE.txt distributed\n * with this package.\n * \n * Author: Matthew Harvey <matthew@matthewharvey.net>\n *\n * Copyright (c) 2012-2013, Matthew Harvey.\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\n#include \"derived_po.hpp\"\n#include \"handle.hpp\"\n#include \"identity_map.hpp\"\n#include \"sqloxx_exceptions.hpp\"\n#include \"sqloxx_tests_common.hpp\"\n#include <UnitTest++\/UnitTest++.h>\n\nnamespace sqloxx\n{\nnamespace tests\n{\n\n\/\/ Note many of the functions of IdentityMap can only be tested\n\/\/ indirectly via the database connection, as they are\n\/\/ private.\n\n\/\/ TODO Uncomment the commented-out tests and adjust them to\n\/\/ reflect that those functions are now private.\n\n\nTEST_FIXTURE(DerivedPOFixture, identity_map_after_object_removal)\n{\n\tDerivedDatabaseConnection& dbc = *pdbc;\n\tHandle<DerivedPO> dpo1(dbc);\n\tdpo1->set_x(10);\n\tdpo1->set_y(-1298);\n\tdpo1->save();\n\tHandle<DerivedPO> dpo1b(dbc, 1);  \/\/ OK\n\tdpo1->remove();\n\tbool ok = false;\n\ttry\n\t{\n\t\tHandle<DerivedPO> dpo1c(*pdbc, 1);\n\t}\n\tcatch (BadIdentifier&)\n\t{\n\t\tok = true;\n\t}\n\tCHECK(ok);\n\t\/\/ But this doesn't throw\n\tHandle<DerivedPO> dpo1d\n\t(\tHandle<DerivedPO>::create_unchecked(dbc, 1)\n\t);\n}\n\nTEST_FIXTURE(DerivedPOFixture, identity_map_connection)\n{\n\tDerivedDatabaseConnection& dbc = *pdbc;\n\tIdentityMap<DerivedPO> idm(dbc);\n\tCHECK_EQUAL(&(idm.connection()), &dbc);\n}\n\n\n}  \/\/ namespace tests\n}  \/\/ namespace sqloxx\n<commit_msg>Deleted an obolete TODO.<commit_after>\/*\n * This file is part of the Sqloxx project and is distributed under the\n * terms of the license contained in the file LICENSE.txt distributed\n * with this package.\n * \n * Author: Matthew Harvey <matthew@matthewharvey.net>\n *\n * Copyright (c) 2012-2013, Matthew Harvey.\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\n#include \"derived_po.hpp\"\n#include \"handle.hpp\"\n#include \"identity_map.hpp\"\n#include \"sqloxx_exceptions.hpp\"\n#include \"sqloxx_tests_common.hpp\"\n#include <UnitTest++\/UnitTest++.h>\n\nnamespace sqloxx\n{\nnamespace tests\n{\n\n\/\/ Note many of the functions of IdentityMap can only be tested\n\/\/ indirectly via the database connection, as they are\n\/\/ private.\n\nTEST_FIXTURE(DerivedPOFixture, identity_map_after_object_removal)\n{\n\tDerivedDatabaseConnection& dbc = *pdbc;\n\tHandle<DerivedPO> dpo1(dbc);\n\tdpo1->set_x(10);\n\tdpo1->set_y(-1298);\n\tdpo1->save();\n\tHandle<DerivedPO> dpo1b(dbc, 1);  \/\/ OK\n\tdpo1->remove();\n\tbool ok = false;\n\ttry\n\t{\n\t\tHandle<DerivedPO> dpo1c(*pdbc, 1);\n\t}\n\tcatch (BadIdentifier&)\n\t{\n\t\tok = true;\n\t}\n\tCHECK(ok);\n\t\/\/ But this doesn't throw\n\tHandle<DerivedPO> dpo1d\n\t(\tHandle<DerivedPO>::create_unchecked(dbc, 1)\n\t);\n}\n\nTEST_FIXTURE(DerivedPOFixture, identity_map_connection)\n{\n\tDerivedDatabaseConnection& dbc = *pdbc;\n\tIdentityMap<DerivedPO> idm(dbc);\n\tCHECK_EQUAL(&(idm.connection()), &dbc);\n}\n\n\n}  \/\/ namespace tests\n}  \/\/ namespace sqloxx\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  brighttimer = new QTimer(this);\n    brighttimer->setSingleShot(true);\n    brighttimer->setInterval(100); \/\/100ms delay in setting the new value\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  connect(brighttimer, SIGNAL(timeout()), this, SLOT(setCurrentBrightness()) );\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  \/\/Brightness controls cannot operate extremely quickly - combine calls as necessary\n  if(brighttimer->isActive()){ brighttimer->stop(); }\n  brighttimer->start();\n}\n\nvoid LSysMenuQuick::setCurrentBrightness(){\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 );\t\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>Adjust te brightness control labelling a bit in the sytem dashboard. Now the label will always stay in sync with the slider (no delay), it is only the backend setting routine which is on a slight (50ms) delay.<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  brighttimer = new QTimer(this);\n    brighttimer->setSingleShot(true);\n    brighttimer->setInterval(50); \/\/50ms delay in setting the new value\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  connect(brighttimer, SIGNAL(timeout()), this, SLOT(setCurrentBrightness()) );\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  \/\/Brightness controls cannot operate extremely quickly - combine calls as necessary\n  if(brighttimer->isActive()){ brighttimer->stop(); }\n  brighttimer->start();\n  \/\/*DO* update the label right away\n  int val = ui->slider_brightness->value();\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::setCurrentBrightness(){\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 );\t\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>\/*\n * Copyright 2011 Simon A. F. Lund <safl@safl.dk>\n *\n * This file is part of cphVB.\n *\n * cphVB 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 * cphVB is distributed in the hope that it 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 cphVB. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <cphvb.h>\n#include \"cphvb_ve_score.h\"\n#include <iostream>\n#include <cphvb_mcache.h>\n\nstatic cphvb_component *myself = NULL;\nstatic cphvb_userfunc_impl reduce_impl = NULL;\nstatic cphvb_intp reduce_impl_id = 0;\nstatic cphvb_userfunc_impl random_impl = NULL;\nstatic cphvb_intp random_impl_id = 0;\nstatic cphvb_userfunc_impl matmul_impl = NULL;\nstatic cphvb_intp matmul_impl_id = 0;\n\nstatic cphvb_intp cphvb_ve_score_buffersizes = 0;\nstatic computeloop* cphvb_ve_score_compute_loops = NULL;\nstatic cphvb_tstate* cphvb_ve_score_tstates = NULL;\n\nstatic cphvb_intp block_size = 1000;\n\ncphvb_error cphvb_ve_score_init(cphvb_component *self)\n{\n    myself = self;                              \/\/ Assign config container.\n\n    char *env = getenv(\"CPHVB_VE_BLOCKSIZE\");   \/\/ Override block_size from environment-variable.\n    if(env != NULL)\n    {\n        block_size = atoi(env);\n    }\n    if(block_size <= 0)                         \/\/ Verify it\n    {\n        fprintf(stderr, \"CPHVB_VE_BLOCKSIZE (%ld) should be greater than zero!\\n\", block_size);\n        return CPHVB_ERROR;\n    }\n\n    cphvb_mcache_init( 10 );\n    return CPHVB_SUCCESS;\n}\n\ninline cphvb_error block_execute( cphvb_instruction* instr, cphvb_intp start, cphvb_intp end) {\n\n    cphvb_intp i, k;\n\n    \/\/Make sure we have enough space\n    if ((end - start + 1) > cphvb_ve_score_buffersizes) \n    {\n    \tcphvb_intp mcount = (end - start + 1);\n\n    \t\/\/We only work in multiples of 1000\n    \tif (mcount % 1000 != 0)\n    \t\tmcount = (mcount + 1000) - (mcount % 1000);\n\n    \t\/\/Make sure we re-allocate on error\n    \tcphvb_ve_score_buffersizes = 0;\n    \t\n    \tif (cphvb_ve_score_compute_loops != NULL) {\n    \t\tfree(cphvb_ve_score_compute_loops);\n    \t\tfree(cphvb_ve_score_tstates);\n    \t\tcphvb_ve_score_compute_loops = NULL;\n    \t\tcphvb_ve_score_tstates = NULL;\n    \t}\n    \t\n    \tcphvb_ve_score_compute_loops = (computeloop*)malloc(sizeof(computeloop) * mcount);\n        cphvb_ve_score_tstates = (cphvb_tstate*)malloc(sizeof(cphvb_tstate)*mcount);\n    \t\n    \tif (cphvb_ve_score_compute_loops == NULL)\n    \t\treturn CPHVB_OUT_OF_MEMORY;\n    \tif (cphvb_ve_score_tstates == NULL)\n    \t\treturn CPHVB_OUT_OF_MEMORY;\n    \t\n    \tcphvb_ve_score_buffersizes = mcount;\n    }\n    \n    computeloop* compute_loops = cphvb_ve_score_compute_loops;\n    cphvb_tstate* states = cphvb_ve_score_tstates;\n    cphvb_intp  nelements, trav_end=0;\n    \n    for(i=0; i<=end-start;i++)                      \/\/ Reset traversal coordinates\n        cphvb_tstate_reset( &states[i] );\n\n    for(i=start, k=0; i <= end; i++,k++)            \/\/ Get the compute-loops\n    {\n        compute_loops[k] = cphvb_compute_get( &instr[i] );\n    }\n                                                    \/\/ Block-size split\n    nelements = cphvb_nelements( instr[start].operand[0]->ndim, instr[start].operand[0]->shape );\n    while(nelements>trav_end)\n    {\n        trav_end    += block_size;\n        if (trav_end > nelements)\n            trav_end = nelements;\n        \n        for(i=start, k=0; i <= end; i++, k++)\n        {\n            compute_loops[k]( &instr[i], &states[k], trav_end );\n        }\n    }\n\n    for(i=start; i <= end; i++)                     \/\/ Set instruction status\n    {\n        instr[i].status = CPHVB_SUCCESS;\n    }\n    \n    return CPHVB_SUCCESS;\n\n}\n\ncphvb_error cphvb_ve_score_execute( cphvb_intp instruction_count, cphvb_instruction* instruction_list )\n{\n    cphvb_intp cur_index,  j;\n    cphvb_instruction *inst, *binst;\n\n    cphvb_intp bin_start, bin_end, bin_size;\n    cphvb_intp bundle_start, bundle_end, bundle_size;\n    cphvb_error res;\n\n    for(cur_index=0; cur_index < instruction_count; cur_index++)\n    {\n        inst = &instruction_list[cur_index];\n\n        if(inst->status == CPHVB_SUCCESS)       \/\/ SKIP instruction\n        {\n            continue;\n        }\n\n        res = cphvb_mcache_malloc( inst );      \/\/ Allocate memory for operands\n        if ( res != CPHVB_SUCCESS ) {\n            return res;\n        }\n        \n        switch(inst->opcode)                    \/\/ Dispatch instruction\n        {\n            case CPHVB_NONE:                    \/\/ NOOP.\n            case CPHVB_DISCARD:\n            case CPHVB_SYNC:\n                inst->status = CPHVB_SUCCESS;\n                break;\n\n            case CPHVB_FREE:                        \/\/ Store data-pointer in malloc-cache\n                inst->status = cphvb_mcache_free( inst );\n                break;\n\n            case CPHVB_USERFUNC:                \/\/ External libraries\n\n                if(inst->userfunc->id == reduce_impl_id)\n                {\n                    inst->status = reduce_impl(inst->userfunc, NULL);\n                }\n                else if(inst->userfunc->id == random_impl_id)\n                {\n                    inst->status = random_impl(inst->userfunc, NULL);\n                }\n                else if(inst->userfunc->id == matmul_impl_id)\n                {\n                    inst->status = matmul_impl(inst->userfunc, NULL);\n                }\n                else                            \/\/ Unsupported userfunc\n                {\n                    inst->status = CPHVB_USERFUNC_NOT_SUPPORTED;\n                }\n\n                break;\n\n            default:                                            \/\/ Built-in operations\n                                                                \/\/ -={[ BINNING ]}=-\n                bin_start   = cur_index;                        \/\/ Count built-ins and their start\/end indexes and allocate memory for them.\n                bin_end     = cur_index;\n                for(j=bin_start+1; j<instruction_count; j++)    \n                {\n                    binst = &instruction_list[j];               \/\/ EXIT: Stop if instruction is NOT built-in\n                    if ((binst->opcode == CPHVB_NONE) || \\\n                        (binst->opcode == CPHVB_DISCARD) || \\\n                        (binst->opcode == CPHVB_SYNC) || \\\n                        (binst->opcode == CPHVB_USERFUNC) || \\\n                        (binst->opcode == CPHVB_FREE) ) {\n                        break;\n                    }\n\n                    bin_end++;                                  \/\/ The \"end\" index\n                    res = cphvb_mcache_malloc( binst );         \/\/ Allocate memory for operands\n                    if ( res != CPHVB_SUCCESS ) {\n                        return res;\n                    }\n\n                }\n                bin_size = bin_end - bin_start +1;              \/\/ The counting part\n\n                                                                \/\/ -={[ BUNDLING ]}=-\n                bundle_size     = (bin_size > 1) ? cphvb_inst_bundle( instruction_list, bin_start, bin_end ) : 1;\n                bundle_start    = bin_start;\n                bundle_end      = bundle_start + bundle_size-1;\n\n                block_execute( instruction_list, bundle_start, bundle_end );\n                cur_index += bundle_size-1;\n        }\n\n        if (inst->status != CPHVB_SUCCESS)    \/\/ Instruction failed\n        {\n            break;\n        }\n\n    }\n\n    if (cur_index == instruction_count) {\n        return CPHVB_SUCCESS;\n    } else {\n        return CPHVB_PARTIAL_SUCCESS;\n    }\n\n}\n\ncphvb_error cphvb_ve_score_shutdown( void )\n{\n    cphvb_mcache_clear();\n    cphvb_mcache_delete();\n\n    return CPHVB_SUCCESS;\n}\n\ncphvb_error cphvb_ve_score_reg_func(char *fun, cphvb_intp *id) {\n\n    if(strcmp(\"cphvb_reduce\", fun) == 0)\n    {\n    \tif (reduce_impl == NULL)\n    \t{\n\t\t\tcphvb_component_get_func(myself, fun, &reduce_impl);\n\t\t\tif (reduce_impl == NULL)\n\t\t\t\treturn CPHVB_USERFUNC_NOT_SUPPORTED;\n\n\t\t\treduce_impl_id = *id;\n\t\t\treturn CPHVB_SUCCESS;\t\t\t\n        }\n        else\n        {\n        \t*id = reduce_impl_id;\n        \treturn CPHVB_SUCCESS;\n        }\n    }\n    else if(strcmp(\"cphvb_random\", fun) == 0)\n    {\n    \tif (random_impl == NULL)\n    \t{\n\t\t\tcphvb_component_get_func(myself, fun, &random_impl);\n\t\t\tif (random_impl == NULL)\n\t\t\t\treturn CPHVB_USERFUNC_NOT_SUPPORTED;\n\n\t\t\trandom_impl_id = *id;\n\t\t\treturn CPHVB_SUCCESS;\t\t\t\n        }\n        else\n        {\n        \t*id = random_impl_id;\n        \treturn CPHVB_SUCCESS;\n        }\n    }\n    else if(strcmp(\"cphvb_matmul\", fun) == 0)\n    {\n    \tif (matmul_impl == NULL)\n    \t{\n\t\t\tcphvb_component_get_func(myself, fun, &matmul_impl);\n\t\t\tif (matmul_impl == NULL)\n\t\t\t\treturn CPHVB_USERFUNC_NOT_SUPPORTED;\n\n\t\t\tmatmul_impl_id = *id;\n\t\t\treturn CPHVB_SUCCESS;\t\t\t\n        }\n        else\n        {\n        \t*id = matmul_impl_id;\n        \treturn CPHVB_SUCCESS;\n        }\n    }\n    \n    return CPHVB_USERFUNC_NOT_SUPPORTED;\n}\n\ncphvb_error cphvb_reduce( cphvb_userfunc *arg, void* ve_arg)\n{\n    return cphvb_compute_reduce( arg, ve_arg );\n}\n\ncphvb_error cphvb_random( cphvb_userfunc *arg, void* ve_arg)\n{\n    return cphvb_compute_random( arg, ve_arg );\n}\n\ncphvb_error cphvb_matmul( cphvb_userfunc *arg, void* ve_arg)\n{\n    return cphvb_compute_matmul( arg, ve_arg );\n    \n}\n<commit_msg>Fixed a compile warning in score<commit_after>\/*\n * Copyright 2011 Simon A. F. Lund <safl@safl.dk>\n *\n * This file is part of cphVB.\n *\n * cphVB 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 * cphVB is distributed in the hope that it 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 cphVB. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <cphvb.h>\n#include \"cphvb_ve_score.h\"\n#include <iostream>\n#include <cphvb_mcache.h>\n\nstatic cphvb_component *myself = NULL;\nstatic cphvb_userfunc_impl reduce_impl = NULL;\nstatic cphvb_intp reduce_impl_id = 0;\nstatic cphvb_userfunc_impl random_impl = NULL;\nstatic cphvb_intp random_impl_id = 0;\nstatic cphvb_userfunc_impl matmul_impl = NULL;\nstatic cphvb_intp matmul_impl_id = 0;\n\nstatic cphvb_intp cphvb_ve_score_buffersizes = 0;\nstatic computeloop* cphvb_ve_score_compute_loops = NULL;\nstatic cphvb_tstate* cphvb_ve_score_tstates = NULL;\n\nstatic cphvb_intp block_size = 1000;\n\ncphvb_error cphvb_ve_score_init(cphvb_component *self)\n{\n    myself = self;                              \/\/ Assign config container.\n\n    char *env = getenv(\"CPHVB_VE_BLOCKSIZE\");   \/\/ Override block_size from environment-variable.\n    if(env != NULL)\n    {\n        block_size = atoi(env);\n    }\n    if(block_size <= 0)                         \/\/ Verify it\n    {\n        fprintf(stderr, \"CPHVB_VE_BLOCKSIZE (%lld) should be greater than zero!\\n\", (cphvb_int64)block_size);\n        return CPHVB_ERROR;\n    }\n\n    cphvb_mcache_init( 10 );\n    return CPHVB_SUCCESS;\n}\n\ninline cphvb_error block_execute( cphvb_instruction* instr, cphvb_intp start, cphvb_intp end) {\n\n    cphvb_intp i, k;\n\n    \/\/Make sure we have enough space\n    if ((end - start + 1) > cphvb_ve_score_buffersizes) \n    {\n    \tcphvb_intp mcount = (end - start + 1);\n\n    \t\/\/We only work in multiples of 1000\n    \tif (mcount % 1000 != 0)\n    \t\tmcount = (mcount + 1000) - (mcount % 1000);\n\n    \t\/\/Make sure we re-allocate on error\n    \tcphvb_ve_score_buffersizes = 0;\n    \t\n    \tif (cphvb_ve_score_compute_loops != NULL) {\n    \t\tfree(cphvb_ve_score_compute_loops);\n    \t\tfree(cphvb_ve_score_tstates);\n    \t\tcphvb_ve_score_compute_loops = NULL;\n    \t\tcphvb_ve_score_tstates = NULL;\n    \t}\n    \t\n    \tcphvb_ve_score_compute_loops = (computeloop*)malloc(sizeof(computeloop) * mcount);\n        cphvb_ve_score_tstates = (cphvb_tstate*)malloc(sizeof(cphvb_tstate)*mcount);\n    \t\n    \tif (cphvb_ve_score_compute_loops == NULL)\n    \t\treturn CPHVB_OUT_OF_MEMORY;\n    \tif (cphvb_ve_score_tstates == NULL)\n    \t\treturn CPHVB_OUT_OF_MEMORY;\n    \t\n    \tcphvb_ve_score_buffersizes = mcount;\n    }\n    \n    computeloop* compute_loops = cphvb_ve_score_compute_loops;\n    cphvb_tstate* states = cphvb_ve_score_tstates;\n    cphvb_intp  nelements, trav_end=0;\n    \n    for(i=0; i<=end-start;i++)                      \/\/ Reset traversal coordinates\n        cphvb_tstate_reset( &states[i] );\n\n    for(i=start, k=0; i <= end; i++,k++)            \/\/ Get the compute-loops\n    {\n        compute_loops[k] = cphvb_compute_get( &instr[i] );\n    }\n                                                    \/\/ Block-size split\n    nelements = cphvb_nelements( instr[start].operand[0]->ndim, instr[start].operand[0]->shape );\n    while(nelements>trav_end)\n    {\n        trav_end    += block_size;\n        if (trav_end > nelements)\n            trav_end = nelements;\n        \n        for(i=start, k=0; i <= end; i++, k++)\n        {\n            compute_loops[k]( &instr[i], &states[k], trav_end );\n        }\n    }\n\n    for(i=start; i <= end; i++)                     \/\/ Set instruction status\n    {\n        instr[i].status = CPHVB_SUCCESS;\n    }\n    \n    return CPHVB_SUCCESS;\n\n}\n\ncphvb_error cphvb_ve_score_execute( cphvb_intp instruction_count, cphvb_instruction* instruction_list )\n{\n    cphvb_intp cur_index,  j;\n    cphvb_instruction *inst, *binst;\n\n    cphvb_intp bin_start, bin_end, bin_size;\n    cphvb_intp bundle_start, bundle_end, bundle_size;\n    cphvb_error res;\n\n    for(cur_index=0; cur_index < instruction_count; cur_index++)\n    {\n        inst = &instruction_list[cur_index];\n\n        if(inst->status == CPHVB_SUCCESS)       \/\/ SKIP instruction\n        {\n            continue;\n        }\n\n        res = cphvb_mcache_malloc( inst );      \/\/ Allocate memory for operands\n        if ( res != CPHVB_SUCCESS ) {\n            return res;\n        }\n        \n        switch(inst->opcode)                    \/\/ Dispatch instruction\n        {\n            case CPHVB_NONE:                    \/\/ NOOP.\n            case CPHVB_DISCARD:\n            case CPHVB_SYNC:\n                inst->status = CPHVB_SUCCESS;\n                break;\n\n            case CPHVB_FREE:                        \/\/ Store data-pointer in malloc-cache\n                inst->status = cphvb_mcache_free( inst );\n                break;\n\n            case CPHVB_USERFUNC:                \/\/ External libraries\n\n                if(inst->userfunc->id == reduce_impl_id)\n                {\n                    inst->status = reduce_impl(inst->userfunc, NULL);\n                }\n                else if(inst->userfunc->id == random_impl_id)\n                {\n                    inst->status = random_impl(inst->userfunc, NULL);\n                }\n                else if(inst->userfunc->id == matmul_impl_id)\n                {\n                    inst->status = matmul_impl(inst->userfunc, NULL);\n                }\n                else                            \/\/ Unsupported userfunc\n                {\n                    inst->status = CPHVB_USERFUNC_NOT_SUPPORTED;\n                }\n\n                break;\n\n            default:                                            \/\/ Built-in operations\n                                                                \/\/ -={[ BINNING ]}=-\n                bin_start   = cur_index;                        \/\/ Count built-ins and their start\/end indexes and allocate memory for them.\n                bin_end     = cur_index;\n                for(j=bin_start+1; j<instruction_count; j++)    \n                {\n                    binst = &instruction_list[j];               \/\/ EXIT: Stop if instruction is NOT built-in\n                    if ((binst->opcode == CPHVB_NONE) || \\\n                        (binst->opcode == CPHVB_DISCARD) || \\\n                        (binst->opcode == CPHVB_SYNC) || \\\n                        (binst->opcode == CPHVB_USERFUNC) || \\\n                        (binst->opcode == CPHVB_FREE) ) {\n                        break;\n                    }\n\n                    bin_end++;                                  \/\/ The \"end\" index\n                    res = cphvb_mcache_malloc( binst );         \/\/ Allocate memory for operands\n                    if ( res != CPHVB_SUCCESS ) {\n                        return res;\n                    }\n\n                }\n                bin_size = bin_end - bin_start +1;              \/\/ The counting part\n\n                                                                \/\/ -={[ BUNDLING ]}=-\n                bundle_size     = (bin_size > 1) ? cphvb_inst_bundle( instruction_list, bin_start, bin_end ) : 1;\n                bundle_start    = bin_start;\n                bundle_end      = bundle_start + bundle_size-1;\n\n                block_execute( instruction_list, bundle_start, bundle_end );\n                cur_index += bundle_size-1;\n        }\n\n        if (inst->status != CPHVB_SUCCESS)    \/\/ Instruction failed\n        {\n            break;\n        }\n\n    }\n\n    if (cur_index == instruction_count) {\n        return CPHVB_SUCCESS;\n    } else {\n        return CPHVB_PARTIAL_SUCCESS;\n    }\n\n}\n\ncphvb_error cphvb_ve_score_shutdown( void )\n{\n    cphvb_mcache_clear();\n    cphvb_mcache_delete();\n\n    return CPHVB_SUCCESS;\n}\n\ncphvb_error cphvb_ve_score_reg_func(char *fun, cphvb_intp *id) {\n\n    if(strcmp(\"cphvb_reduce\", fun) == 0)\n    {\n    \tif (reduce_impl == NULL)\n    \t{\n\t\t\tcphvb_component_get_func(myself, fun, &reduce_impl);\n\t\t\tif (reduce_impl == NULL)\n\t\t\t\treturn CPHVB_USERFUNC_NOT_SUPPORTED;\n\n\t\t\treduce_impl_id = *id;\n\t\t\treturn CPHVB_SUCCESS;\t\t\t\n        }\n        else\n        {\n        \t*id = reduce_impl_id;\n        \treturn CPHVB_SUCCESS;\n        }\n    }\n    else if(strcmp(\"cphvb_random\", fun) == 0)\n    {\n    \tif (random_impl == NULL)\n    \t{\n\t\t\tcphvb_component_get_func(myself, fun, &random_impl);\n\t\t\tif (random_impl == NULL)\n\t\t\t\treturn CPHVB_USERFUNC_NOT_SUPPORTED;\n\n\t\t\trandom_impl_id = *id;\n\t\t\treturn CPHVB_SUCCESS;\t\t\t\n        }\n        else\n        {\n        \t*id = random_impl_id;\n        \treturn CPHVB_SUCCESS;\n        }\n    }\n    else if(strcmp(\"cphvb_matmul\", fun) == 0)\n    {\n    \tif (matmul_impl == NULL)\n    \t{\n\t\t\tcphvb_component_get_func(myself, fun, &matmul_impl);\n\t\t\tif (matmul_impl == NULL)\n\t\t\t\treturn CPHVB_USERFUNC_NOT_SUPPORTED;\n\n\t\t\tmatmul_impl_id = *id;\n\t\t\treturn CPHVB_SUCCESS;\t\t\t\n        }\n        else\n        {\n        \t*id = matmul_impl_id;\n        \treturn CPHVB_SUCCESS;\n        }\n    }\n    \n    return CPHVB_USERFUNC_NOT_SUPPORTED;\n}\n\ncphvb_error cphvb_reduce( cphvb_userfunc *arg, void* ve_arg)\n{\n    return cphvb_compute_reduce( arg, ve_arg );\n}\n\ncphvb_error cphvb_random( cphvb_userfunc *arg, void* ve_arg)\n{\n    return cphvb_compute_random( arg, ve_arg );\n}\n\ncphvb_error cphvb_matmul( cphvb_userfunc *arg, void* ve_arg)\n{\n    return cphvb_compute_matmul( arg, ve_arg );\n    \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThis file is part of cphVB and copyright (c) 2012 the cphVB team:\nhttp:\/\/cphvb.bitbucket.org\n\ncphVB 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\ncphVB 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 cphVB. \n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cassert>\n#include <cstring>\n#include <iostream>\n#include <cphvb.h>\n\n#include \"cphvb_vem_node.h\"\n\n\/\/Function pointers to the VE.\nstatic cphvb_init ve_init;\nstatic cphvb_execute ve_execute;\nstatic cphvb_shutdown ve_shutdown;\nstatic cphvb_reg_func ve_reg_func;\n\n\/\/The VE components\nstatic cphvb_component **vem_node_components;\n\n\/\/Our self\nstatic cphvb_component *vem_node_myself;\n\n\/\/Number of user-defined functions registered.\nstatic cphvb_intp vem_userfunc_count = 0;\n\n\/* Initialize the VEM\n *\n * @return Error codes (CPHVB_SUCCESS)\n *\/\ncphvb_error cphvb_vem_node_init(cphvb_component *self)\n{\n    cphvb_intp children_count;\n    cphvb_error err;\n    vem_node_myself = self;\n\n    err = cphvb_component_children(self, &children_count, &vem_node_components);\n    if (children_count != 1) \n    {\n\t\tstd::cerr << \"Unexpected number of child nodes for VEM, must be 1\" << std::endl;\n\t\treturn CPHVB_ERROR;\n    }\n    \n    if (err != CPHVB_SUCCESS)\n\t    return err;\n    \n    ve_init = vem_node_components[0]->init;\n    ve_execute = vem_node_components[0]->execute;\n    ve_shutdown = vem_node_components[0]->shutdown;\n    ve_reg_func = vem_node_components[0]->reg_func;\n\n    \/\/Let us initiate the simple VE and register what it supports.\n    if((err = ve_init(vem_node_components[0])) != 0)\n        return err;\n\n    return CPHVB_SUCCESS;\n}\n\n\n\/* Shutdown the VEM, which include a instruction flush\n *\n * @return Error codes (CPHVB_SUCCESS)\n *\/\ncphvb_error cphvb_vem_node_shutdown(void)\n{\n    cphvb_error err;\n    err = ve_shutdown();\n    cphvb_component_free(vem_node_components[0]);\/\/Only got one child.\n    ve_init     = NULL;\n    ve_execute  = NULL;\n    ve_shutdown = NULL;\n    ve_reg_func = NULL;\n    cphvb_component_free_ptr(vem_node_components);\n    vem_node_components = NULL;\n    return err;\n}\n\n\n\/* Register a new user-defined function.\n *\n * @lib Name of the shared library e.g. libmyfunc.so\n *      When NULL the default library is used.\n * @fun Name of the function e.g. myfunc\n * @id Identifier for the new function. The bridge should set the\n *     initial value to Zero. (in\/out-put)\n * @return Error codes (CPHVB_SUCCESS)\n *\/\ncphvb_error cphvb_vem_node_reg_func(char *fun, cphvb_intp *id)\n{\n\tcphvb_error e;\n\tcphvb_intp tmpid;\n    \n    if(*id == 0)\/\/Only if parent didn't set the ID.\n        tmpid = vem_userfunc_count + 1;\n\n    e = ve_reg_func(fun, &tmpid);\n\n    \/\/If the call succeeded, register the id as taken and return it\n    if (e == CPHVB_SUCCESS)\n    {\n\t    if (tmpid > vem_userfunc_count)\n\t    \tvem_userfunc_count = tmpid;\n    \t*id = tmpid;\n    }\n    \n    return e;\n}\n\n\n\/* Execute a list of instructions (blocking, for the time being).\n * It is required that the VEM supports all instructions in the list.\n *\n * @instruction A list of instructions to execute\n * @return Error codes (CPHVB_SUCCESS)\n *\/\ncphvb_error cphvb_vem_node_execute(cphvb_intp count,\n                                   cphvb_instruction inst_list[])\n{\n    if (count <= 0)\n        return CPHVB_SUCCESS;\n    \n    #ifdef CPHVB_TRACE\n        cphvb_intp i;\n        for(i=0; i<count; ++i)\n        {\n            cphvb_instruction* inst = &inst_list[i];\n            cphvb_component_trace_inst(vem_node_myself, inst);\n        }\n    #endif\n\n    return ve_execute(count, inst_list);\n}\n<commit_msg>minor cleanup of cphvb_vem_node_reg_func()<commit_after>\/*\nThis file is part of cphVB and copyright (c) 2012 the cphVB team:\nhttp:\/\/cphvb.bitbucket.org\n\ncphVB 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\ncphVB 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 cphVB. \n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cassert>\n#include <cstring>\n#include <iostream>\n#include <cphvb.h>\n\n#include \"cphvb_vem_node.h\"\n\n\/\/Function pointers to the VE.\nstatic cphvb_init ve_init;\nstatic cphvb_execute ve_execute;\nstatic cphvb_shutdown ve_shutdown;\nstatic cphvb_reg_func ve_reg_func;\n\n\/\/The VE components\nstatic cphvb_component **vem_node_components;\n\n\/\/Our self\nstatic cphvb_component *vem_node_myself;\n\n\/\/Number of user-defined functions registered.\nstatic cphvb_intp vem_userfunc_count = 0;\n\n\/* Initialize the VEM\n *\n * @return Error codes (CPHVB_SUCCESS)\n *\/\ncphvb_error cphvb_vem_node_init(cphvb_component *self)\n{\n    cphvb_intp children_count;\n    cphvb_error err;\n    vem_node_myself = self;\n\n    err = cphvb_component_children(self, &children_count, &vem_node_components);\n    if (children_count != 1) \n    {\n\t\tstd::cerr << \"Unexpected number of child nodes for VEM, must be 1\" << std::endl;\n\t\treturn CPHVB_ERROR;\n    }\n    \n    if (err != CPHVB_SUCCESS)\n\t    return err;\n    \n    ve_init = vem_node_components[0]->init;\n    ve_execute = vem_node_components[0]->execute;\n    ve_shutdown = vem_node_components[0]->shutdown;\n    ve_reg_func = vem_node_components[0]->reg_func;\n\n    \/\/Let us initiate the simple VE and register what it supports.\n    if((err = ve_init(vem_node_components[0])) != 0)\n        return err;\n\n    return CPHVB_SUCCESS;\n}\n\n\n\/* Shutdown the VEM, which include a instruction flush\n *\n * @return Error codes (CPHVB_SUCCESS)\n *\/\ncphvb_error cphvb_vem_node_shutdown(void)\n{\n    cphvb_error err;\n    err = ve_shutdown();\n    cphvb_component_free(vem_node_components[0]);\/\/Only got one child.\n    ve_init     = NULL;\n    ve_execute  = NULL;\n    ve_shutdown = NULL;\n    ve_reg_func = NULL;\n    cphvb_component_free_ptr(vem_node_components);\n    vem_node_components = NULL;\n    return err;\n}\n\n\n\/* Register a new user-defined function.\n *\n * @lib Name of the shared library e.g. libmyfunc.so\n *      When NULL the default library is used.\n * @fun Name of the function e.g. myfunc\n * @id Identifier for the new function. The bridge should set the\n *     initial value to Zero. (in\/out-put)\n * @return Error codes (CPHVB_SUCCESS)\n *\/\ncphvb_error cphvb_vem_node_reg_func(char *fun, cphvb_intp *id)\n{\n\tcphvb_error e;\n    \n    if(*id == 0)\/\/Only if parent didn't set the ID.\n        *id = ++vem_userfunc_count;\n\n    if((e = ve_reg_func(fun, id)) != CPHVB_SUCCESS)\n    {\n        *id = 0;\n        return e;\n    }\n    return e;\n}\n\n\n\/* Execute a list of instructions (blocking, for the time being).\n * It is required that the VEM supports all instructions in the list.\n *\n * @instruction A list of instructions to execute\n * @return Error codes (CPHVB_SUCCESS)\n *\/\ncphvb_error cphvb_vem_node_execute(cphvb_intp count,\n                                   cphvb_instruction inst_list[])\n{\n    if (count <= 0)\n        return CPHVB_SUCCESS;\n    \n    #ifdef CPHVB_TRACE\n        cphvb_intp i;\n        for(i=0; i<count; ++i)\n        {\n            cphvb_instruction* inst = &inst_list[i];\n            cphvb_component_trace_inst(vem_node_myself, inst);\n        }\n    #endif\n\n    return ve_execute(count, inst_list);\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-2014 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\n#include \"OgreArchive.h\"\n#include \"OgreException.h\"\n\nnamespace Ogre {\n    \/\/---------------------------------------------------------------------\n    DataStreamPtr Archive::create(const String&) const\n    {\n        OGRE_EXCEPT(Exception::ERR_NOT_IMPLEMENTED, \n                    \"This archive does not support creation of files.\", \n                    \"Archive::create\");\n    }\n    \/\/---------------------------------------------------------------------\n    void Archive::remove(const String&) const\n    {\n        OGRE_EXCEPT(Exception::ERR_NOT_IMPLEMENTED, \n                    \"This archive does not support removal of files.\", \n                    \"Archive::remove\");\n    }\n    \/\/---------------------------------------------------------------------\n}\n<commit_msg>fixed PCH issue caused by new OgreArchive.cpp file (OGRE-433)<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-2014 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\n#include \"OgreStableHeaders.h\"\n\n#include \"OgreArchive.h\"\n#include \"OgreException.h\"\n\nnamespace Ogre {\n    \/\/---------------------------------------------------------------------\n    DataStreamPtr Archive::create(const String&) const\n    {\n        OGRE_EXCEPT(Exception::ERR_NOT_IMPLEMENTED, \n                    \"This archive does not support creation of files.\", \n                    \"Archive::create\");\n    }\n    \/\/---------------------------------------------------------------------\n    void Archive::remove(const String&) const\n    {\n        OGRE_EXCEPT(Exception::ERR_NOT_IMPLEMENTED, \n                    \"This archive does not support removal of files.\", \n                    \"Archive::remove\");\n    }\n    \/\/---------------------------------------------------------------------\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n -----------------------------------------------------------------------------\n This source file is part of OGRE\n (Object-oriented Graphics Rendering Engine)\n For the latest info, see http:\/\/www.ogre3d.org\/\n \n Copyright (c) 2000-2014 Torus Knot Software Ltd\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 \"OgreStableHeaders.h\"\n\n#if OGRE_NO_ZIP_ARCHIVE == 0\n\n#include \"OgreDeflate.h\"\n#include \"OgreException.h\"\n#if OGRE_PLATFORM == OGRE_PLATFORM_APPLE_IOS || OGRE_PLATFORM == OGRE_PLATFORM_APPLE\n#include \"macUtils.h\"\n#endif\n\n#include <zlib.h>\n\nnamespace Ogre\n{\n    \/\/ memory implementations\n    void* OgreZalloc(void* opaque, unsigned int items, unsigned int size)\n    {\n        return OGRE_MALLOC(items * size, MEMCATEGORY_GENERAL);\n    }\n    void OgreZfree(void* opaque, void* address)\n    {\n        OGRE_FREE(address, MEMCATEGORY_GENERAL);\n    }\n    #define OGRE_DEFLATE_TMP_SIZE 16384\n    \/\/---------------------------------------------------------------------\n    DeflateStream::DeflateStream(const DataStreamPtr& compressedStream, const String& tmpFileName, size_t avail_in)\n    : DataStream(compressedStream->getAccessMode())\n    , mCompressedStream(compressedStream)\n    , mTempFileName(tmpFileName)\n    , mZStream(0)\n    , mCurrentPos(0)\n    , mAvailIn(avail_in)\n    , mTmp(0)\n    , mIsCompressedValid(true)\n    {\n        init();\n    }\n    \/\/---------------------------------------------------------------------\n    DeflateStream::DeflateStream(const String& name, const DataStreamPtr& compressedStream, const String& tmpFileName, size_t avail_in)\n    : DataStream(name, compressedStream->getAccessMode())\n    , mCompressedStream(compressedStream)\n    , mTempFileName(tmpFileName)\n    , mZStream(0)\n    , mCurrentPos(0)\n    , mAvailIn(avail_in)\n    , mTmp(0)\n    , mIsCompressedValid(true)\n    {\n        init();\n    }\n    \/\/---------------------------------------------------------------------\n    size_t DeflateStream::getAvailInForSinglePass()\n    {\n        size_t ret = OGRE_DEFLATE_TMP_SIZE;\n\n        \/\/ if we are doing particial-uncompressing\n        if(mAvailIn>0)\n        {\n            if(mAvailIn<ret)\n                ret = mAvailIn;\n            mAvailIn -= ret;\n        }\n\n        return ret;\n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::init()\n    {\n        mZStream = OGRE_ALLOC_T(z_stream, 1, MEMCATEGORY_GENERAL);\n        mZStream->zalloc = OgreZalloc;\n        mZStream->zfree = OgreZfree;\n        \n        if (getAccessMode() == READ)\n        {\n            mTmp = (unsigned char*)OGRE_MALLOC(OGRE_DEFLATE_TMP_SIZE, MEMCATEGORY_GENERAL);\n            size_t restorePoint = mCompressedStream->tell();\n            \/\/ read early chunk\n            mZStream->next_in = mTmp;\n            mZStream->avail_in = static_cast<uint>(mCompressedStream->read(mTmp, getAvailInForSinglePass()));\n            \n            if (inflateInit(mZStream) != Z_OK)\n            {\n                mIsCompressedValid = false;\n            }\n            else\n                mIsCompressedValid = true;\n            \n            if (mIsCompressedValid)\n            {\n                \/\/ in fact, inflateInit on some implementations doesn't try to read\n                \/\/ anything. We need to at least read something to test\n                Bytef testOut[4];\n                size_t savedIn = mZStream->avail_in;\n                mZStream->avail_out = 4;\n                mZStream->next_out = testOut;\n                if (inflate(mZStream, Z_SYNC_FLUSH) != Z_OK)\n                    mIsCompressedValid = false;\n                \/\/ restore for reading\n                mZStream->avail_in = static_cast<uint>(savedIn);\n                mZStream->next_in = mTmp;\n\n                inflateReset(mZStream);\n            }\n\n            if (!mIsCompressedValid)\n            {\n                \/\/ Not compressed data!\n                \/\/ Fail gracefully, fall back on reading the underlying stream direct\n                destroy();\n                mCompressedStream->seek(restorePoint);\n            }               \n        }\n        else \n        {\n            if(mTempFileName.empty())\n            {\n                \/\/ Write to temp file\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n                char* tmpname = _tempnam(\".\", \"ogre\");\n                if (!tmpname)\n                {\n                    \/\/ Having no file name here will cause various problems later.\n                    OGRE_EXCEPT(Exception::ERR_INTERNAL_ERROR, \"Temporary file name generation failed.\", \"DeflateStream::init\");\n                }\n                else\n                {\n                    mTempFileName = tmpname;\n                    free(tmpname);\n                }\n#elif OGRE_PLATFORM == OGRE_PLATFORM_APPLE_IOS || OGRE_PLATFORM == OGRE_PLATFORM_APPLE\n                mTempFileName = macTempFileName();\n#else\n                char tmpname[L_tmpnam];\n                if (!tmpnam(tmpname))\n                    OGRE_EXCEPT(Exception::ERR_INTERNAL_ERROR, \"Temporary file name generation failed.\", \"DeflateStream::init\");\n\n                mTempFileName = tmpname;\n#endif\n            }\n\n            std::fstream *f = OGRE_NEW_T(std::fstream, MEMCATEGORY_GENERAL)();\n            f->open(mTempFileName.c_str(), std::ios::binary | std::ios::out);\n            mTmpWriteStream = DataStreamPtr(OGRE_NEW FileStreamDataStream(f));\n            \n        }\n\n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::destroy()\n    {\n        if (getAccessMode() == READ)\n            inflateEnd(mZStream);\n\n        OGRE_FREE(mZStream, MEMCATEGORY_GENERAL);\n        mZStream = 0;\n        OGRE_FREE(mTmp, MEMCATEGORY_GENERAL);\n        mTmp = 0;\n    }\n    \/\/---------------------------------------------------------------------\n    DeflateStream::~DeflateStream()\n    {\n        close();\n        destroy();\n    }\n    \/\/---------------------------------------------------------------------\n    size_t DeflateStream::read(void* buf, size_t count)\n    {\n        if (!mIsCompressedValid)\n        {\n            return mCompressedStream->read(buf, count);\n        }\n        \n        if (getAccessMode() & WRITE)\n        {\n            return mTmpWriteStream->read(buf, count);\n        }\n        else \n        {\n\n            size_t restorePoint = mCompressedStream->tell();\n            \/\/ read from cache first\n            size_t cachereads = mReadCache.read(buf, count);\n            \n            size_t newReadUncompressed = 0;\n\n            if (cachereads < count)\n            {\n                mZStream->avail_out = static_cast<uint>(count - cachereads);\n                mZStream->next_out = (Bytef*)buf + cachereads;\n                \n                while (mZStream->avail_out)\n                {\n                    \/\/ Pull next chunk of compressed data from the underlying stream\n                    if (!mZStream->avail_in && !mCompressedStream->eof())\n                    {\n                        mZStream->avail_in = static_cast<uint>(mCompressedStream->read(mTmp, getAvailInForSinglePass()));\n                        mZStream->next_in = mTmp;\n                    }\n                    \n                    if (mZStream->avail_in)\n                    {\n                        int availpre = mZStream->avail_out;\n                        int status = inflate(mZStream, Z_SYNC_FLUSH);\n                        size_t readUncompressed = availpre - mZStream->avail_out;\n                        newReadUncompressed += readUncompressed;\n                        if (status != Z_OK)\n                        {\n                            \/\/ End of data, or error\n                            if (status != Z_STREAM_END)\n                            {\n                                mCompressedStream->seek(restorePoint);\n                                OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                                            \"Error in compressed stream\",\n                                            \"DeflateStrea::read\");\n                            }\n                            else \n                            {\n                                \/\/ back up the stream so that it can be used from the end onwards                                                   \n                                long unusedCompressed = mZStream->avail_in;\n                                mCompressedStream->skip(-unusedCompressed);\n                            }\n\n                            break;\n                        }\n                    }\n                }\n            }\n            \n            \/\/ Cache the last bytes read\n            mReadCache.cacheData((char*)buf + cachereads, newReadUncompressed);\n            \n            mCurrentPos += newReadUncompressed + cachereads;\n            \n            return newReadUncompressed + cachereads;\n        }\n    }\n    \/\/---------------------------------------------------------------------\n    size_t DeflateStream::write(const void* buf, size_t count)\n    {\n        if ((getAccessMode() & WRITE) == 0)\n            OGRE_EXCEPT(Exception::ERR_INVALIDPARAMS,\n                        \"Not a writable stream\", \"DeflateStream::write\");\n        \n        return mTmpWriteStream->write(buf, count);\n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::compressFinal()\n    {\n        \/\/ Close temp stream\n        mTmpWriteStream->close();\n        \n        \/\/ Copy & compress\n        \/\/ We do this rather than compress directly because some code seeks\n        \/\/ around while writing (e.g. to update size blocks) which is not\n        \/\/ possible when compressing on the fly\n        \n        int ret, flush;\n        char in[OGRE_DEFLATE_TMP_SIZE];\n        char out[OGRE_DEFLATE_TMP_SIZE];\n        \n        if (deflateInit(mZStream, Z_DEFAULT_COMPRESSION) != Z_OK)\n        {\n            destroy();\n            OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                        \"Error initialising deflate compressed stream!\",\n                        \"DeflateStream::init\");\n        }\n        \n        std::ifstream inFile;\n        inFile.open(mTempFileName.c_str(), std::ios::in | std::ios::binary);\n        \n        do \n        {\n            inFile.read(in, OGRE_DEFLATE_TMP_SIZE);\n            mZStream->avail_in = (uInt)inFile.gcount();\n            if (inFile.bad()) \n            {\n                deflateEnd(mZStream);\n                OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                            \"Error reading temp uncompressed stream!\",\n                            \"DeflateStream::init\");\n            }\n            flush = inFile.eof() ? Z_FINISH : Z_NO_FLUSH;\n            mZStream->next_in = (Bytef*)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            {\n                mZStream->avail_out = OGRE_DEFLATE_TMP_SIZE;\n                mZStream->next_out = (Bytef*)out;\n                ret = deflate(mZStream, flush);    \/* no bad return value *\/\n                assert(ret != Z_STREAM_ERROR);  \/* state not clobbered *\/\n                size_t compressed = OGRE_DEFLATE_TMP_SIZE - mZStream->avail_out;\n                mCompressedStream->write(out, compressed);\n            } while (mZStream->avail_out == 0);\n            assert(mZStream->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                (void)ret;\n        deflateEnd(mZStream);\n\n        inFile.close();\n        remove(mTempFileName.c_str());\n                        \n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::skip(long count)\n    {\n        if (!mIsCompressedValid)\n        {\n            mCompressedStream->skip(count);\n            return;\n        }\n        \n        if (getAccessMode() & WRITE)\n        {\n            mTmpWriteStream->skip(count);\n        }\n        else \n        {\n            if (count > 0)\n            {\n                if (!mReadCache.ff(count))\n                {\n                    OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                                \"You can only skip within the cache range in a deflate stream.\",\n                                \"DeflateStream::skip\");\n                }\n            }\n            else if (count < 0)\n            {\n                if (!mReadCache.rewind((size_t)(-count)))\n                {\n                    OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                                \"You can only skip within the cache range in a deflate stream.\",\n                                \"DeflateStream::skip\");\n                }\n            }\n        }       \n        mCurrentPos = static_cast<size_t>(static_cast<long>(mCurrentPos) + count);\n        \n        \n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::seek( size_t pos )\n    {\n        if (!mIsCompressedValid)\n        {\n            mCompressedStream->seek(pos);\n            return;\n        }\n        if (getAccessMode() & WRITE)\n        {\n            mTmpWriteStream->seek(pos);\n        }\n        else\n        {\n            if (pos == 0)\n            {\n                mCurrentPos = 0;\n                mZStream->next_in = mTmp;\n                mCompressedStream->seek(0);\n                mZStream->avail_in = static_cast<uint>(mCompressedStream->read(mTmp, getAvailInForSinglePass()));\n                inflateReset(mZStream);\n            }\n            else \n            {\n                skip(pos - tell());\n            }\n        }       \n    }\n    \/\/---------------------------------------------------------------------\n    size_t DeflateStream::tell(void) const\n    {\n        if (!mIsCompressedValid)\n        {\n            return mCompressedStream->tell();\n        }\n        else if(getAccessMode() & WRITE) \n        {\n            return mTmpWriteStream->tell();\n        }\n        else\n        {\n            return mCurrentPos;\n        }\n\n    }\n    \/\/---------------------------------------------------------------------\n    bool DeflateStream::eof(void) const\n    {\n        if (getAccessMode() & WRITE)\n            return mTmpWriteStream->eof();\n        else \n        {\n            if (!mIsCompressedValid)\n                return mCompressedStream->eof();\n            else\n                return mCompressedStream->eof() && mZStream->avail_in == 0;\n        }\n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::close(void)\n    {\n        if (getAccessMode() & WRITE)\n        {\n            compressFinal();\n        }\n        \n        \/\/ don't close underlying compressed stream in case used for something else\n    }\n    \/\/---------------------------------------------------------------------\n    \n    \n}\n\n#endif\n<commit_msg>OgreDeflate: replace unsafe tmpnam by mkstemp for POSIX systems<commit_after>\/*\n -----------------------------------------------------------------------------\n This source file is part of OGRE\n (Object-oriented Graphics Rendering Engine)\n For the latest info, see http:\/\/www.ogre3d.org\/\n \n Copyright (c) 2000-2014 Torus Knot Software Ltd\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 \"OgreStableHeaders.h\"\n\n#if OGRE_NO_ZIP_ARCHIVE == 0\n\n#include \"OgreDeflate.h\"\n#include \"OgreException.h\"\n#if OGRE_PLATFORM == OGRE_PLATFORM_APPLE_IOS || OGRE_PLATFORM == OGRE_PLATFORM_APPLE\n#include \"macUtils.h\"\n#endif\n\n#include <zlib.h>\n\nnamespace Ogre\n{\n    \/\/ memory implementations\n    void* OgreZalloc(void* opaque, unsigned int items, unsigned int size)\n    {\n        return OGRE_MALLOC(items * size, MEMCATEGORY_GENERAL);\n    }\n    void OgreZfree(void* opaque, void* address)\n    {\n        OGRE_FREE(address, MEMCATEGORY_GENERAL);\n    }\n    #define OGRE_DEFLATE_TMP_SIZE 16384\n    \/\/---------------------------------------------------------------------\n    DeflateStream::DeflateStream(const DataStreamPtr& compressedStream, const String& tmpFileName, size_t avail_in)\n    : DataStream(compressedStream->getAccessMode())\n    , mCompressedStream(compressedStream)\n    , mTempFileName(tmpFileName)\n    , mZStream(0)\n    , mCurrentPos(0)\n    , mAvailIn(avail_in)\n    , mTmp(0)\n    , mIsCompressedValid(true)\n    {\n        init();\n    }\n    \/\/---------------------------------------------------------------------\n    DeflateStream::DeflateStream(const String& name, const DataStreamPtr& compressedStream, const String& tmpFileName, size_t avail_in)\n    : DataStream(name, compressedStream->getAccessMode())\n    , mCompressedStream(compressedStream)\n    , mTempFileName(tmpFileName)\n    , mZStream(0)\n    , mCurrentPos(0)\n    , mAvailIn(avail_in)\n    , mTmp(0)\n    , mIsCompressedValid(true)\n    {\n        init();\n    }\n    \/\/---------------------------------------------------------------------\n    size_t DeflateStream::getAvailInForSinglePass()\n    {\n        size_t ret = OGRE_DEFLATE_TMP_SIZE;\n\n        \/\/ if we are doing particial-uncompressing\n        if(mAvailIn>0)\n        {\n            if(mAvailIn<ret)\n                ret = mAvailIn;\n            mAvailIn -= ret;\n        }\n\n        return ret;\n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::init()\n    {\n        mZStream = OGRE_ALLOC_T(z_stream, 1, MEMCATEGORY_GENERAL);\n        mZStream->zalloc = OgreZalloc;\n        mZStream->zfree = OgreZfree;\n        \n        if (getAccessMode() == READ)\n        {\n            mTmp = (unsigned char*)OGRE_MALLOC(OGRE_DEFLATE_TMP_SIZE, MEMCATEGORY_GENERAL);\n            size_t restorePoint = mCompressedStream->tell();\n            \/\/ read early chunk\n            mZStream->next_in = mTmp;\n            mZStream->avail_in = static_cast<uint>(mCompressedStream->read(mTmp, getAvailInForSinglePass()));\n            \n            if (inflateInit(mZStream) != Z_OK)\n            {\n                mIsCompressedValid = false;\n            }\n            else\n                mIsCompressedValid = true;\n            \n            if (mIsCompressedValid)\n            {\n                \/\/ in fact, inflateInit on some implementations doesn't try to read\n                \/\/ anything. We need to at least read something to test\n                Bytef testOut[4];\n                size_t savedIn = mZStream->avail_in;\n                mZStream->avail_out = 4;\n                mZStream->next_out = testOut;\n                if (inflate(mZStream, Z_SYNC_FLUSH) != Z_OK)\n                    mIsCompressedValid = false;\n                \/\/ restore for reading\n                mZStream->avail_in = static_cast<uint>(savedIn);\n                mZStream->next_in = mTmp;\n\n                inflateReset(mZStream);\n            }\n\n            if (!mIsCompressedValid)\n            {\n                \/\/ Not compressed data!\n                \/\/ Fail gracefully, fall back on reading the underlying stream direct\n                destroy();\n                mCompressedStream->seek(restorePoint);\n            }               \n        }\n        else \n        {\n            if(mTempFileName.empty())\n            {\n                \/\/ Write to temp file\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n                char* tmpname = _tempnam(\".\", \"ogre\");\n                if (!tmpname)\n                {\n                    \/\/ Having no file name here will cause various problems later.\n                    OGRE_EXCEPT(Exception::ERR_INTERNAL_ERROR, \"Temporary file name generation failed.\", \"DeflateStream::init\");\n                }\n                else\n                {\n                    mTempFileName = tmpname;\n                    free(tmpname);\n                }\n#elif OGRE_PLATFORM == OGRE_PLATFORM_APPLE_IOS || OGRE_PLATFORM == OGRE_PLATFORM_APPLE\n                mTempFileName = macTempFileName();\n#else\n                char tmpname[] = \"\/tmp\/ogreXXXXXX\";\n                if (mkstemp(tmpname) == -1)\n                    OGRE_EXCEPT(Exception::ERR_INTERNAL_ERROR, \"Temporary file name generation failed.\", \"DeflateStream::init\");\n\n                mTempFileName = tmpname;\n#endif\n            }\n\n            std::fstream *f = OGRE_NEW_T(std::fstream, MEMCATEGORY_GENERAL)();\n            f->open(mTempFileName.c_str(), std::ios::binary | std::ios::out);\n            mTmpWriteStream = DataStreamPtr(OGRE_NEW FileStreamDataStream(f));\n            \n        }\n\n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::destroy()\n    {\n        if (getAccessMode() == READ)\n            inflateEnd(mZStream);\n\n        OGRE_FREE(mZStream, MEMCATEGORY_GENERAL);\n        mZStream = 0;\n        OGRE_FREE(mTmp, MEMCATEGORY_GENERAL);\n        mTmp = 0;\n    }\n    \/\/---------------------------------------------------------------------\n    DeflateStream::~DeflateStream()\n    {\n        close();\n        destroy();\n    }\n    \/\/---------------------------------------------------------------------\n    size_t DeflateStream::read(void* buf, size_t count)\n    {\n        if (!mIsCompressedValid)\n        {\n            return mCompressedStream->read(buf, count);\n        }\n        \n        if (getAccessMode() & WRITE)\n        {\n            return mTmpWriteStream->read(buf, count);\n        }\n        else \n        {\n\n            size_t restorePoint = mCompressedStream->tell();\n            \/\/ read from cache first\n            size_t cachereads = mReadCache.read(buf, count);\n            \n            size_t newReadUncompressed = 0;\n\n            if (cachereads < count)\n            {\n                mZStream->avail_out = static_cast<uint>(count - cachereads);\n                mZStream->next_out = (Bytef*)buf + cachereads;\n                \n                while (mZStream->avail_out)\n                {\n                    \/\/ Pull next chunk of compressed data from the underlying stream\n                    if (!mZStream->avail_in && !mCompressedStream->eof())\n                    {\n                        mZStream->avail_in = static_cast<uint>(mCompressedStream->read(mTmp, getAvailInForSinglePass()));\n                        mZStream->next_in = mTmp;\n                    }\n                    \n                    if (mZStream->avail_in)\n                    {\n                        int availpre = mZStream->avail_out;\n                        int status = inflate(mZStream, Z_SYNC_FLUSH);\n                        size_t readUncompressed = availpre - mZStream->avail_out;\n                        newReadUncompressed += readUncompressed;\n                        if (status != Z_OK)\n                        {\n                            \/\/ End of data, or error\n                            if (status != Z_STREAM_END)\n                            {\n                                mCompressedStream->seek(restorePoint);\n                                OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                                            \"Error in compressed stream\",\n                                            \"DeflateStrea::read\");\n                            }\n                            else \n                            {\n                                \/\/ back up the stream so that it can be used from the end onwards                                                   \n                                long unusedCompressed = mZStream->avail_in;\n                                mCompressedStream->skip(-unusedCompressed);\n                            }\n\n                            break;\n                        }\n                    }\n                }\n            }\n            \n            \/\/ Cache the last bytes read\n            mReadCache.cacheData((char*)buf + cachereads, newReadUncompressed);\n            \n            mCurrentPos += newReadUncompressed + cachereads;\n            \n            return newReadUncompressed + cachereads;\n        }\n    }\n    \/\/---------------------------------------------------------------------\n    size_t DeflateStream::write(const void* buf, size_t count)\n    {\n        if ((getAccessMode() & WRITE) == 0)\n            OGRE_EXCEPT(Exception::ERR_INVALIDPARAMS,\n                        \"Not a writable stream\", \"DeflateStream::write\");\n        \n        return mTmpWriteStream->write(buf, count);\n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::compressFinal()\n    {\n        \/\/ Close temp stream\n        mTmpWriteStream->close();\n        \n        \/\/ Copy & compress\n        \/\/ We do this rather than compress directly because some code seeks\n        \/\/ around while writing (e.g. to update size blocks) which is not\n        \/\/ possible when compressing on the fly\n        \n        int ret, flush;\n        char in[OGRE_DEFLATE_TMP_SIZE];\n        char out[OGRE_DEFLATE_TMP_SIZE];\n        \n        if (deflateInit(mZStream, Z_DEFAULT_COMPRESSION) != Z_OK)\n        {\n            destroy();\n            OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                        \"Error initialising deflate compressed stream!\",\n                        \"DeflateStream::init\");\n        }\n        \n        std::ifstream inFile;\n        inFile.open(mTempFileName.c_str(), std::ios::in | std::ios::binary);\n        \n        do \n        {\n            inFile.read(in, OGRE_DEFLATE_TMP_SIZE);\n            mZStream->avail_in = (uInt)inFile.gcount();\n            if (inFile.bad()) \n            {\n                deflateEnd(mZStream);\n                OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                            \"Error reading temp uncompressed stream!\",\n                            \"DeflateStream::init\");\n            }\n            flush = inFile.eof() ? Z_FINISH : Z_NO_FLUSH;\n            mZStream->next_in = (Bytef*)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            {\n                mZStream->avail_out = OGRE_DEFLATE_TMP_SIZE;\n                mZStream->next_out = (Bytef*)out;\n                ret = deflate(mZStream, flush);    \/* no bad return value *\/\n                assert(ret != Z_STREAM_ERROR);  \/* state not clobbered *\/\n                size_t compressed = OGRE_DEFLATE_TMP_SIZE - mZStream->avail_out;\n                mCompressedStream->write(out, compressed);\n            } while (mZStream->avail_out == 0);\n            assert(mZStream->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                (void)ret;\n        deflateEnd(mZStream);\n\n        inFile.close();\n        remove(mTempFileName.c_str());\n                        \n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::skip(long count)\n    {\n        if (!mIsCompressedValid)\n        {\n            mCompressedStream->skip(count);\n            return;\n        }\n        \n        if (getAccessMode() & WRITE)\n        {\n            mTmpWriteStream->skip(count);\n        }\n        else \n        {\n            if (count > 0)\n            {\n                if (!mReadCache.ff(count))\n                {\n                    OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                                \"You can only skip within the cache range in a deflate stream.\",\n                                \"DeflateStream::skip\");\n                }\n            }\n            else if (count < 0)\n            {\n                if (!mReadCache.rewind((size_t)(-count)))\n                {\n                    OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n                                \"You can only skip within the cache range in a deflate stream.\",\n                                \"DeflateStream::skip\");\n                }\n            }\n        }       \n        mCurrentPos = static_cast<size_t>(static_cast<long>(mCurrentPos) + count);\n        \n        \n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::seek( size_t pos )\n    {\n        if (!mIsCompressedValid)\n        {\n            mCompressedStream->seek(pos);\n            return;\n        }\n        if (getAccessMode() & WRITE)\n        {\n            mTmpWriteStream->seek(pos);\n        }\n        else\n        {\n            if (pos == 0)\n            {\n                mCurrentPos = 0;\n                mZStream->next_in = mTmp;\n                mCompressedStream->seek(0);\n                mZStream->avail_in = static_cast<uint>(mCompressedStream->read(mTmp, getAvailInForSinglePass()));\n                inflateReset(mZStream);\n            }\n            else \n            {\n                skip(pos - tell());\n            }\n        }       \n    }\n    \/\/---------------------------------------------------------------------\n    size_t DeflateStream::tell(void) const\n    {\n        if (!mIsCompressedValid)\n        {\n            return mCompressedStream->tell();\n        }\n        else if(getAccessMode() & WRITE) \n        {\n            return mTmpWriteStream->tell();\n        }\n        else\n        {\n            return mCurrentPos;\n        }\n\n    }\n    \/\/---------------------------------------------------------------------\n    bool DeflateStream::eof(void) const\n    {\n        if (getAccessMode() & WRITE)\n            return mTmpWriteStream->eof();\n        else \n        {\n            if (!mIsCompressedValid)\n                return mCompressedStream->eof();\n            else\n                return mCompressedStream->eof() && mZStream->avail_in == 0;\n        }\n    }\n    \/\/---------------------------------------------------------------------\n    void DeflateStream::close(void)\n    {\n        if (getAccessMode() & WRITE)\n        {\n            compressFinal();\n        }\n        \n        \/\/ don't close underlying compressed stream in case used for something else\n    }\n    \/\/---------------------------------------------------------------------\n    \n    \n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\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#include <iostream>\n#include <fstream>\n#include <stdio.h>\n\n\n#include <string.h>\n#include \"..\/support\/cmdline.hxx\"\n#include \"cr_metho.hxx\"\n#include \"cr_html.hxx\"\n#include \"cr_index.hxx\"\n#include \"xmlelem.hxx\"\n#include \"xmltree.hxx\"\n#include \"parse.hxx\"\n#include \"..\/support\/syshelp.hxx\"\n#include \"..\/support\/heap.hxx\"\n\n\n\nint                     Do_IndexCommandLine(\n                            const CommandLine &     i_rCommandLine );\nint                     Do_SingleFileCommandLine(\n                            const CommandLine &     i_rCommandLine );\nvoid                    Create_TypeInfo(\n                            const char *            o_sOutputFile,\n                            ModuleDescription &     i_rData );\n\n\nint\n#ifdef WNT\n_cdecl\n#endif\nmain( int       argc,\n      char *    argv[] )\n{\n    \/\/ Variables\n    CommandLine             aCommandLine(argc, argv);\n    int ret = 0;\n\n    if (! aCommandLine.IsOk())\n    {\n        std::cerr <<  aCommandLine.ErrorText() << std::endl ;\n        return 1;\n    }\n\n    if ( aCommandLine.IsIndexCommand() )\n        ret = Do_IndexCommandLine(aCommandLine);\n    else\n        ret = Do_SingleFileCommandLine(aCommandLine);\n\n    return ret;\n}\n\n\nint\nDo_SingleFileCommandLine(const CommandLine & i_rCommandLine)\n{\n    ModuleDescription   aDescr;\n    X2CParser           aParser(aDescr);\n\n    \/\/ Load file and create Function-file\n    bool bLoadResult = aParser.LoadFile(i_rCommandLine.XmlSrcFile());\n    if (! bLoadResult)\n    {\n        std::cerr << \"Error: File %s could not be loaded.\" << i_rCommandLine.XmlSrcFile() << std::endl;\n        return 1;\n    }\n\n    if ( strlen(i_rCommandLine.FuncFile()) > 0 )\n    {\n        Create_AccessMethod( i_rCommandLine.FuncFile(),\n                             aParser.PureText() );\n\n        std::cout << \"File \"\n             << i_rCommandLine.FuncFile()\n             << \" with component_getDescriptionFunc() is created now.\"\n             << std::endl;\n    }\n\n    \/\/ Parse\n    aParser.Parse();\n\n    \/\/ Produce output\n    if ( strlen(i_rCommandLine.HtmlFile()) > 0 )\n    {\n        HtmlCreator aHtmlCreator( i_rCommandLine.HtmlFile(),\n                                  aDescr,\n                                  i_rCommandLine.IdlRootPath() );\n        aHtmlCreator.Run();\n    }\n\n    if (strlen(i_rCommandLine.TypeInfoFile()) > 0)\n    {\n        Create_TypeInfo( i_rCommandLine.TypeInfoFile(),\n                         aDescr );\n    }\n\n    return 0;\n};\n\nint\nDo_IndexCommandLine(const CommandLine & i_rCommandLine)\n{\n    \/\/ Parsen files:\n    List<Simstr>    aFiles;\n    Index           aIndex( i_rCommandLine.OutputDirectory(),\n                            i_rCommandLine.IdlRootPath(),\n                            i_rCommandLine.IndexedTags() );\n\n    std::cout << \"Gather xml-files ...\" << std::endl;\n    GatherFileNames( aFiles, i_rCommandLine.XmlSrcDirectory() );\n\n    std::cout << \"Create output ...\" << std::endl;\n    aIndex.GatherData(aFiles);\n    aIndex.WriteOutput( i_rCommandLine.IndexOutputFile() );\n\n    std::cout << \"... done.\" << std::endl;\n\n    return 0;\n};\n\n\n\n\/\/********************      Creating of typeinfo       ********************\/\/\n\n\nvoid                    Put2StdOut_TypeInfo(\n                            ModuleDescription &     i_rData );\nvoid                    Put2File_TypeInfo(\n                            const char *            i_sOutputFile,\n                            ModuleDescription &     i_rData );\nvoid                    StreamOut_TypeInfo(\n                            std::ostream &               o_rOut,\n                            ModuleDescription &     i_rData,\n                            const char *            i_sSeparator );\n\n\n\n\nvoid\nCreate_TypeInfo( const char *           o_sOutputFile,\n                 ModuleDescription &    i_rData )\n{\n    if ( strcmp(o_sOutputFile, \"stdout\") == 0 )\n        Put2StdOut_TypeInfo(i_rData);\n    else\n        Put2File_TypeInfo(o_sOutputFile,i_rData);\n\n#if 0\n    std::ofstream aOut(o_sOutputFile, std::ios::out\n#if defined(WNT) || defined(OS2)\n                                               | std::ios::binary\n#endif\n    );\n    if ( !aOut )\n    {\n        std::cerr << \"Error: \" << o_sOutputFile << \" could not be created.\" << std::endl;\n        return;\n    }\n\n    Heap    aTypesHeap(12);\n    Simstr  sLibPrefix = i_rData.ModuleName();\n\n    \/\/ Gather types:\n    List< const MultipleTextElement * > aTypes;\n    i_rData.Get_Types(aTypes);\n\n    for ( unsigned t = 0; t < aTypes.size(); ++t )\n    {\n        unsigned i_max = aTypes[t]->Size();\n        for ( unsigned  i = 0; i < i_max; ++i )\n        {\n            aTypesHeap.InsertValue( aTypes[t]->Data(i), \"\" );\n        }  \/\/ end for\n    }\n\n    \/\/ Write types:\n    WriteStr( aOut, sLibPrefix );\n    WriteStr( aOut, \"_XML2CMPTYPES= \");\n\n    HeapItem * pLastHeapTop = 0;\n    for ( HeapItem * pHeapTop = aTypesHeap.ReleaseTop(); pHeapTop != 0; pHeapTop = aTypesHeap.ReleaseTop() )\n    {\n        if (pLastHeapTop != 0)\n        {\n            if ( 0 == strcmp(pHeapTop->Key(), pLastHeapTop->Key()) )\n                continue;\n            delete pLastHeapTop;\n            \/\/ pLastHeapTop = 0;\n        }\n        pLastHeapTop = pHeapTop;\n\n        WriteStr( aOut, \"\\t\\\\\\n\\t\\t\" );\n\n        const char * sEnd = strchr( pHeapTop->Key(), ' ' );\n        if (sEnd != 0)\n        {\n            const char * sQuali = strrchr( pHeapTop->Key(), ' ' )+1;\n            WriteStr( aOut, sQuali );\n            WriteStr( aOut, \".\" );\n            aOut.write( pHeapTop->Key(), sEnd - pHeapTop->Key() );\n        }\n        else\n            WriteStr( aOut, pHeapTop->Key() );\n    }   \/\/ end for\n\n    if (pLastHeapTop != 0)\n    {\n        delete pLastHeapTop;\n        pLastHeapTop = 0;\n    }\n\n    aOut.close();\n#endif \/\/ 0\n}\n\nvoid\nPut2StdOut_TypeInfo( ModuleDescription &    i_rData )\n{\n    StreamOut_TypeInfo(std::cout, i_rData, \" \");\n}\n\nvoid\nPut2File_TypeInfo( const char *            i_sOutputFile,\n                   ModuleDescription &     i_rData )\n{\n    std::ofstream aOut(i_sOutputFile, std::ios::out\n#if defined(WNT) || defined(OS2)\n                                               | std::ios::binary\n#endif\n    );\n    if ( !aOut )\n    {\n        std::cerr << \"Error: \" << i_sOutputFile << \" could not be created.\" << std::endl;\n        return;\n    }\n\n    Simstr  sLibPrefix = i_rData.ModuleName();\n    WriteStr( aOut, sLibPrefix );\n    WriteStr( aOut, \"_XML2CMPTYPES= \");\n\n    StreamOut_TypeInfo(aOut, i_rData, \"\\t\\\\\\n\\t\\t\");\n\n    aOut.close();\n}\n\nvoid\nStreamOut_TypeInfo( std::ostream &               o_rOut,\n                    ModuleDescription &     i_rData,\n                    const char *            i_sSeparator )\n{\n    Heap    aTypesHeap(12);\n\n    \/\/ Gather types:\n    List< const MultipleTextElement * > aTypes;\n    i_rData.Get_Types(aTypes);\n\n    for ( unsigned t = 0; t < aTypes.size(); ++t )\n    {\n        unsigned i_max = aTypes[t]->Size();\n        for ( unsigned  i = 0; i < i_max; ++i )\n        {\n            aTypesHeap.InsertValue( aTypes[t]->Data(i), \"\" );\n        }  \/\/ end for\n    }\n\n    \/\/ Write types:\n    HeapItem * pLastHeapTop = 0;\n    for ( HeapItem * pHeapTop = aTypesHeap.ReleaseTop(); pHeapTop != 0; pHeapTop = aTypesHeap.ReleaseTop() )\n    {\n        if (pLastHeapTop != 0)\n        {\n            if ( 0 == strcmp(pHeapTop->Key(), pLastHeapTop->Key()) )\n                continue;\n            delete pLastHeapTop;\n            \/\/ pLastHeapTop = 0;\n        }\n        pLastHeapTop = pHeapTop;\n\n        WriteStr( o_rOut, i_sSeparator );\n\n        const char * sEnd = strchr( pHeapTop->Key(), ' ' );\n        if (sEnd != 0)\n        {\n            const char * sQuali = strrchr( pHeapTop->Key(), ' ' ) + 1;\n            WriteStr( o_rOut, sQuali );\n            WriteStr( o_rOut, \".\" );\n            o_rOut.write( pHeapTop->Key(), sEnd - pHeapTop->Key() );\n        }\n        else\n            WriteStr( o_rOut, pHeapTop->Key() );\n    }   \/\/ end for\n\n    if (pLastHeapTop != 0)\n    {\n        delete pLastHeapTop;\n        pLastHeapTop = 0;\n    }\n}\n\n<commit_msg>CWS-TOOLING: integrate CWS cmcfixes78<commit_after>\/*************************************************************************\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#include <iostream>\n#include <fstream>\n#include <stdio.h>\n\n\n#include <string.h>\n#include \"..\/support\/cmdline.hxx\"\n#include \"cr_metho.hxx\"\n#include \"cr_html.hxx\"\n#include \"cr_index.hxx\"\n#include \"xmlelem.hxx\"\n#include \"xmltree.hxx\"\n#include \"parse.hxx\"\n#include \"..\/support\/syshelp.hxx\"\n#include \"..\/support\/heap.hxx\"\n\n\n\nint                     Do_IndexCommandLine(\n                            const CommandLine &     i_rCommandLine );\nint                     Do_SingleFileCommandLine(\n                            const CommandLine &     i_rCommandLine );\nvoid                    Create_TypeInfo(\n                            const char *            o_sOutputFile,\n                            ModuleDescription &     i_rData );\n\n\nint\n#ifdef WNT\n_cdecl\n#endif\nmain( int       argc,\n      char *    argv[] )\n{\n    \/\/ Variables\n    CommandLine             aCommandLine(argc, argv);\n    int ret = 0;\n\n    if (! aCommandLine.IsOk())\n    {\n        std::cerr <<  aCommandLine.ErrorText() << std::endl ;\n        return 1;\n    }\n\n    if ( aCommandLine.IsIndexCommand() )\n        ret = Do_IndexCommandLine(aCommandLine);\n    else\n        ret = Do_SingleFileCommandLine(aCommandLine);\n\n    return ret;\n}\n\n\nint\nDo_SingleFileCommandLine(const CommandLine & i_rCommandLine)\n{\n    ModuleDescription   aDescr;\n    X2CParser           aParser(aDescr);\n\n    \/\/ Load file and create Function-file\n    bool bLoadResult = aParser.LoadFile(i_rCommandLine.XmlSrcFile());\n    if (! bLoadResult)\n    {\n        std::cerr << \"Error: File \" << i_rCommandLine.XmlSrcFile() << \" could not be loaded.\" << std::endl;\n        return 1;\n    }\n\n    if ( strlen(i_rCommandLine.FuncFile()) > 0 )\n    {\n        Create_AccessMethod( i_rCommandLine.FuncFile(),\n                             aParser.PureText() );\n\n        std::cout << \"File \"\n             << i_rCommandLine.FuncFile()\n             << \" with component_getDescriptionFunc() is created now.\"\n             << std::endl;\n    }\n\n    \/\/ Parse\n    aParser.Parse();\n\n    \/\/ Produce output\n    if ( strlen(i_rCommandLine.HtmlFile()) > 0 )\n    {\n        HtmlCreator aHtmlCreator( i_rCommandLine.HtmlFile(),\n                                  aDescr,\n                                  i_rCommandLine.IdlRootPath() );\n        aHtmlCreator.Run();\n    }\n\n    if (strlen(i_rCommandLine.TypeInfoFile()) > 0)\n    {\n        Create_TypeInfo( i_rCommandLine.TypeInfoFile(),\n                         aDescr );\n    }\n\n    return 0;\n};\n\nint\nDo_IndexCommandLine(const CommandLine & i_rCommandLine)\n{\n    \/\/ Parsen files:\n    List<Simstr>    aFiles;\n    Index           aIndex( i_rCommandLine.OutputDirectory(),\n                            i_rCommandLine.IdlRootPath(),\n                            i_rCommandLine.IndexedTags() );\n\n    std::cout << \"Gather xml-files ...\" << std::endl;\n    GatherFileNames( aFiles, i_rCommandLine.XmlSrcDirectory() );\n\n    std::cout << \"Create output ...\" << std::endl;\n    aIndex.GatherData(aFiles);\n    aIndex.WriteOutput( i_rCommandLine.IndexOutputFile() );\n\n    std::cout << \"... done.\" << std::endl;\n\n    return 0;\n};\n\n\n\n\/\/********************      Creating of typeinfo       ********************\/\/\n\n\nvoid                    Put2StdOut_TypeInfo(\n                            ModuleDescription &     i_rData );\nvoid                    Put2File_TypeInfo(\n                            const char *            i_sOutputFile,\n                            ModuleDescription &     i_rData );\nvoid                    StreamOut_TypeInfo(\n                            std::ostream &               o_rOut,\n                            ModuleDescription &     i_rData,\n                            const char *            i_sSeparator );\n\n\n\n\nvoid\nCreate_TypeInfo( const char *           o_sOutputFile,\n                 ModuleDescription &    i_rData )\n{\n    if ( strcmp(o_sOutputFile, \"stdout\") == 0 )\n        Put2StdOut_TypeInfo(i_rData);\n    else\n        Put2File_TypeInfo(o_sOutputFile,i_rData);\n\n#if 0\n    std::ofstream aOut(o_sOutputFile, std::ios::out\n#if defined(WNT) || defined(OS2)\n                                               | std::ios::binary\n#endif\n    );\n    if ( !aOut )\n    {\n        std::cerr << \"Error: \" << o_sOutputFile << \" could not be created.\" << std::endl;\n        return;\n    }\n\n    Heap    aTypesHeap(12);\n    Simstr  sLibPrefix = i_rData.ModuleName();\n\n    \/\/ Gather types:\n    List< const MultipleTextElement * > aTypes;\n    i_rData.Get_Types(aTypes);\n\n    for ( unsigned t = 0; t < aTypes.size(); ++t )\n    {\n        unsigned i_max = aTypes[t]->Size();\n        for ( unsigned  i = 0; i < i_max; ++i )\n        {\n            aTypesHeap.InsertValue( aTypes[t]->Data(i), \"\" );\n        }  \/\/ end for\n    }\n\n    \/\/ Write types:\n    WriteStr( aOut, sLibPrefix );\n    WriteStr( aOut, \"_XML2CMPTYPES= \");\n\n    HeapItem * pLastHeapTop = 0;\n    for ( HeapItem * pHeapTop = aTypesHeap.ReleaseTop(); pHeapTop != 0; pHeapTop = aTypesHeap.ReleaseTop() )\n    {\n        if (pLastHeapTop != 0)\n        {\n            if ( 0 == strcmp(pHeapTop->Key(), pLastHeapTop->Key()) )\n                continue;\n            delete pLastHeapTop;\n            \/\/ pLastHeapTop = 0;\n        }\n        pLastHeapTop = pHeapTop;\n\n        WriteStr( aOut, \"\\t\\\\\\n\\t\\t\" );\n\n        const char * sEnd = strchr( pHeapTop->Key(), ' ' );\n        if (sEnd != 0)\n        {\n            const char * sQuali = strrchr( pHeapTop->Key(), ' ' )+1;\n            WriteStr( aOut, sQuali );\n            WriteStr( aOut, \".\" );\n            aOut.write( pHeapTop->Key(), sEnd - pHeapTop->Key() );\n        }\n        else\n            WriteStr( aOut, pHeapTop->Key() );\n    }   \/\/ end for\n\n    if (pLastHeapTop != 0)\n    {\n        delete pLastHeapTop;\n        pLastHeapTop = 0;\n    }\n\n    aOut.close();\n#endif \/\/ 0\n}\n\nvoid\nPut2StdOut_TypeInfo( ModuleDescription &    i_rData )\n{\n    StreamOut_TypeInfo(std::cout, i_rData, \" \");\n}\n\nvoid\nPut2File_TypeInfo( const char *            i_sOutputFile,\n                   ModuleDescription &     i_rData )\n{\n    std::ofstream aOut(i_sOutputFile, std::ios::out\n#if defined(WNT) || defined(OS2)\n                                               | std::ios::binary\n#endif\n    );\n    if ( !aOut )\n    {\n        std::cerr << \"Error: \" << i_sOutputFile << \" could not be created.\" << std::endl;\n        return;\n    }\n\n    Simstr  sLibPrefix = i_rData.ModuleName();\n    WriteStr( aOut, sLibPrefix );\n    WriteStr( aOut, \"_XML2CMPTYPES= \");\n\n    StreamOut_TypeInfo(aOut, i_rData, \"\\t\\\\\\n\\t\\t\");\n\n    aOut.close();\n}\n\nvoid\nStreamOut_TypeInfo( std::ostream &               o_rOut,\n                    ModuleDescription &     i_rData,\n                    const char *            i_sSeparator )\n{\n    Heap    aTypesHeap(12);\n\n    \/\/ Gather types:\n    List< const MultipleTextElement * > aTypes;\n    i_rData.Get_Types(aTypes);\n\n    for ( unsigned t = 0; t < aTypes.size(); ++t )\n    {\n        unsigned i_max = aTypes[t]->Size();\n        for ( unsigned  i = 0; i < i_max; ++i )\n        {\n            aTypesHeap.InsertValue( aTypes[t]->Data(i), \"\" );\n        }  \/\/ end for\n    }\n\n    \/\/ Write types:\n    HeapItem * pLastHeapTop = 0;\n    for ( HeapItem * pHeapTop = aTypesHeap.ReleaseTop(); pHeapTop != 0; pHeapTop = aTypesHeap.ReleaseTop() )\n    {\n        if (pLastHeapTop != 0)\n        {\n            if ( 0 == strcmp(pHeapTop->Key(), pLastHeapTop->Key()) )\n                continue;\n            delete pLastHeapTop;\n            \/\/ pLastHeapTop = 0;\n        }\n        pLastHeapTop = pHeapTop;\n\n        WriteStr( o_rOut, i_sSeparator );\n\n        const char * sEnd = strchr( pHeapTop->Key(), ' ' );\n        if (sEnd != 0)\n        {\n            const char * sQuali = strrchr( pHeapTop->Key(), ' ' ) + 1;\n            WriteStr( o_rOut, sQuali );\n            WriteStr( o_rOut, \".\" );\n            o_rOut.write( pHeapTop->Key(), sEnd - pHeapTop->Key() );\n        }\n        else\n            WriteStr( o_rOut, pHeapTop->Key() );\n    }   \/\/ end for\n\n    if (pLastHeapTop != 0)\n    {\n        delete pLastHeapTop;\n        pLastHeapTop = 0;\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef HCKT_TREE_H\n#define HCKT_TREE_H\n\n#include <array>\n#include <vector>\n#include <bitset>\n#include \"direction.hpp\"\n\n\ntemplate <typename ValueType>\nclass hckt_tree\n{\nprotected:\n    std::array<ValueType, 64> values;\n    std::bitset<64> bitset;\n    std::vector<hckt_tree*> children;\n\n    size_t get_children_position(const size_t position) const\n    {\n        size_t c { 0 };\n\n        for(size_t i=0; i<position; ++i) {\n            if(bitset[i]) {\n                ++c;\n            }\n        }\n        \n        return c;\n    }\n\n\npublic:\n    hckt_tree() : values { { } }, bitset { 0 }, children { }\n    {\n    }\n\n    ~hckt_tree()\n    {\n        collapse();\n    }\n\n    \/*\n     * convert three part positions to memory location\n     * as input: (left = 0 | right = 1) + (top = 0 | bottom = 2)\n     *\n     * result will be:\n     * y1:x1:y2:x2:y3:x3\n     *\n     *\/\n    static size_t get_position(size_t d1, size_t d2, size_t d3)\n    {\n        return ((1 << 0) * ((d1 & 2) >> 1))\n             + ((1 << 1) * (d1 & 1))\n             + ((1 << 2) * ((d2 & 2) >> 1))\n             + ((1 << 3) * (d2 & 1))\n             + ((1 << 4) * ((d3 & 2) >> 1))\n             + ((1 << 5) * (d3 & 1));\n    }\n\n    \/*\n     * check if we have any children\n     *\/\n    bool empty() const\n    {\n        return bitset.none();\n    }\n\n    \/*\n     * destroy children\n     * note: this does not delete prior values in array\n     *\/\n    void collapse()\n    {\n        for(auto child : children) {\n            child->collapse();\n        }\n\n        children.clear();\n        bitset.reset();\n    }\n\n    \/*\n     * insert an item into position of tree\n     * position should be result of get_position\n     *\/\n    void insert(const size_t position, const ValueType value)\n    {\n        children.emplace(children.begin() + get_children_position(position), new hckt_tree<ValueType>());\n        bitset.set(position);\n        values[position] = value;\n    }\n\n    \/*\n     * removes an item from tree\n     * position should be result of get_position\n     *\/\n    void remove(const size_t position)\n    {\n        const size_t pos = get_children_position(position);\n        children[pos]->collapse();\n        children.erase(children.begin() + pos);\n        bitset.reset(position);\n    }\n\n    \/*\n     * get child node \n     * position should be result of get_position\n     *\/\n    hckt_tree<ValueType> * leaf(const size_t position) const\n    {\n        return children[get_children_position(position)];\n    }\n\n    \/*\n     * sets node to specific value\n     * position should be result of get_position\n     *\/\n    void set_value(const size_t position, const ValueType value)\n    {\n        values[position] = value;\n    }\n\n    \/*\n     * gets value from specific position\n     * note: this does not check \/ concern itself if this has been collapsed\n     * if so the data is stale\n     * position should be result of get_position\n     *\/\n    ValueType get_value(const size_t position) const\n    {\n        return values[position];\n    }\n};\n\n\n#endif\n<commit_msg>formatting<commit_after>#ifndef HCKT_TREE_H\n#define HCKT_TREE_H\n\n#include <array>\n#include <vector>\n#include <bitset>\n#include \"direction.hpp\"\n\n\ntemplate <typename ValueType>\nclass hckt_tree\n{\nprotected:\n    std::array<ValueType, 64> values;\n    std::bitset<64> bitset;\n    std::vector<hckt_tree*> children;\n\n    size_t get_children_position(const size_t position) const\n    {\n        size_t c { 0 };\n\n        for(size_t i=0; i<position; ++i) {\n            if(bitset[i]) {\n                ++c;\n            }\n        }\n        \n        return c;\n    }\n\n\npublic:\n    hckt_tree() : values { { } }, bitset { 0 }, children { }\n    {\n    }\n\n    ~hckt_tree()\n    {\n        collapse();\n    }\n\n    \/*\n     * convert three part positions to memory location\n     * as input: (left = 0 | right = 1) + (top = 0 | bottom = 2)\n     *\n     * result will be:\n     * y1:x1:y2:x2:y3:x3\n     *\n     *\/\n    static size_t get_position(size_t d1, size_t d2, size_t d3)\n    {\n        return ((1 << 0) * ((d1 & 2) >> 1))\n             + ((1 << 1) *  (d1 & 1))\n             + ((1 << 2) * ((d2 & 2) >> 1))\n             + ((1 << 3) *  (d2 & 1))\n             + ((1 << 4) * ((d3 & 2) >> 1))\n             + ((1 << 5) *  (d3 & 1));\n    }\n\n    \/*\n     * check if we have any children\n     *\/\n    bool empty() const\n    {\n        return bitset.none();\n    }\n\n    \/*\n     * destroy children\n     * note: this does not delete prior values in array\n     *\/\n    void collapse()\n    {\n        for(auto child : children) {\n            child->collapse();\n        }\n\n        children.clear();\n        bitset.reset();\n    }\n\n    \/*\n     * insert an item into position of tree\n     * position should be result of get_position\n     *\/\n    void insert(const size_t position, const ValueType value)\n    {\n        children.emplace(children.begin() + get_children_position(position), new hckt_tree<ValueType>());\n        bitset.set(position);\n        values[position] = value;\n    }\n\n    \/*\n     * removes an item from tree\n     * position should be result of get_position\n     *\/\n    void remove(const size_t position)\n    {\n        const size_t pos = get_children_position(position);\n        children[pos]->collapse();\n        children.erase(children.begin() + pos);\n        bitset.reset(position);\n    }\n\n    \/*\n     * get child node \n     * position should be result of get_position\n     *\/\n    hckt_tree<ValueType> * leaf(const size_t position) const\n    {\n        return children[get_children_position(position)];\n    }\n\n    \/*\n     * sets node to specific value\n     * position should be result of get_position\n     *\/\n    void set_value(const size_t position, const ValueType value)\n    {\n        values[position] = value;\n    }\n\n    \/*\n     * gets value from specific position\n     * note: this does not check \/ concern itself if this has been collapsed\n     * if so the data is stale\n     * position should be result of get_position\n     *\/\n    ValueType get_value(const size_t position) const\n    {\n        return values[position];\n    }\n};\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: dispatchprovider.hxx,v $\n *\n *  $Revision: 1.11 $\n *\n *  last change: $Author: kz $ $Date: 2004-01-28 14:19: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#ifndef __FRAMEWORK_DISPATCH_DISPATCHPROVIDER_HXX_\n#define __FRAMEWORK_DISPATCH_DISPATCHPROVIDER_HXX_\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_SERVICES_FRAME_HXX_\n#include <services\/frame.hxx>\n#endif\n\n#include <classes\/protocolhandlercache.hxx>\n\n#ifndef __FRAMEWORK_THREADHELP_THREADHELPBASE_HXX_\n#include <threadhelp\/threadhelpbase.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_TRANSACTIONBASE_HXX_\n#include <threadhelp\/transactionbase.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_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_STDTYPES_H_\n#include <stdtypes.h>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\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_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.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_FRAME_DISPATCHDESCRIPTOR_HPP_\n#include <com\/sun\/star\/frame\/DispatchDescriptor.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\n#ifndef _CPPUHELPER_WEAKREF_HXX_\n#include <cppuhelper\/weakref.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @descr          We know some special dispatch objects with diffrent functionality.\n                    The can be created internaly by the following DispatchProvider.\n                    Here we define some identifier to force creation of the right one.\n\n    @modified       20.08.2003 08:34, as96863\n*\/\nenum EDispatchHelper\n{\n    E_DEFAULTDISPATCHER     ,\n    E_MENUDISPATCHER        ,\n    E_HELPAGENTDISPATCHER   ,\n    E_CREATEDISPATCHER      ,\n    E_BLANKDISPATCHER       ,\n    E_SELFDISPATCHER        ,\n    E_CLOSEDISPATCHER\n};\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short          implement a helper for XDispatchProvider interface\n    @descr          The result of a queryDispatch() call depends from the owner, which use an instance of this class.\n                    (frame, desktop) All of them must provides different functionality.\n                    E.g:    - task can be created by the desktop only\n                            - a task can have a beamer as direct child\n                            - a normal frame never can create a new one by himself\n\n    @attention      Use this class as member only! Never use it as baseclass.\n                    XInterface will be ambigous and we hold a weakreference to ouer OWNER - not to ouer SUPERCLASS!\n\n    @base           ThreadHelpBase\n                        supports threadsafe mechanism\n    @base           OWeakObject\n                        provides ref count and weak mechanism\n\n    @devstatus      ready to use\n    @threadsafe     yes\n    @modified       17.05.2002 07:56, as96863\n*\/\nclass DispatchProvider  :   \/\/ interfaces\n                            public  css::lang::XTypeProvider            ,\n                            public  css::frame::XDispatchProvider       ,\n                            \/\/ baseclasses\n                            \/\/ Order is neccessary for right initialization!\n                            private ThreadHelpBase                      ,\n                            private TransactionBase                     ,\n                            public  ::cppu::OWeakObject\n{\n    \/* member *\/\n    private:\n        \/\/\/ reference to global service manager to create new services\n        css::uno::Reference< css::lang::XMultiServiceFactory > m_xFactory;\n        \/\/\/ weakreference to owner frame (Don't use a hard reference. Owner can't delete us then!)\n        css::uno::WeakReference< css::frame::XFrame > m_xFrame;\n        \/\/\/ different dispatcher to handle special dispatch calls, protocols or URLs (they will be created on demand.)\n        css::uno::Reference< css::frame::XDispatch > m_xMenuDispatcher     ;\n        css::uno::Reference< css::frame::XDispatch > m_xHelpAgentDispatcher;\n\/*      css::uno::Reference< css::frame::XDispatch > m_xBlankDispatcher    ;\n        css::uno::Reference< css::frame::XDispatch > m_xSelfDispatcher     ;\n        css::uno::Reference< css::frame::XDispatch > m_xDefaultDispatcher  ;*\/\n        \/\/\/ cache of some other dispatch provider which are registered inside configuration to handle special URL protocols\n        HandlerCache m_aProtocolHandlerCache;\n\n    \/* interface *\/\n    public:\n        DECLARE_XINTERFACE\n        DECLARE_XTYPEPROVIDER\n\n        DispatchProvider( const css::uno::Reference< css::lang::XMultiServiceFactory >& xFactory ,\n                          const css::uno::Reference< css::frame::XFrame >&              xFrame   );\n\n        virtual css::uno::Reference< css::frame::XDispatch > SAL_CALL                       queryDispatch  ( const css::util::URL&                                       aURL             ,\n                                                                                                             const ::rtl::OUString&                                      sTargetFrameName ,\n                                                                                                                   sal_Int32                                             nSearchFlags     ) throw( css::uno::RuntimeException );\n        virtual css::uno::Sequence< css::uno::Reference< css::frame::XDispatch > > SAL_CALL queryDispatches( const css::uno::Sequence< css::frame::DispatchDescriptor >& lDescriptions    ) throw( css::uno::RuntimeException );\n\n    \/* helper *\/\n    protected:\n        \/\/ Let him protected! So nobody can use us as base ...\n        virtual ~DispatchProvider();\n\n    private:\n        css::uno::Reference< css::frame::XDispatch > implts_getOrCreateDispatchHelper   (       EDispatchHelper                            eHelper                       ,\n                                                                                          const css::uno::Reference< css::frame::XFrame >& xOwner                        ,\n                                                                                          const ::rtl::OUString&                           sTarget = ::rtl::OUString()   ,\n                                                                                                sal_Int32                                  nSearchFlags = 0              );\n        sal_Bool                                     implts_isLoadableContent           ( const css::util::URL&                            aURL                          );\n        css::uno::Reference< css::frame::XDispatch > implts_queryDesktopDispatch        ( const css::uno::Reference< css::frame::XFrame >  xDesktop                      ,\n                                                                                          const css::util::URL&                            aURL                          ,\n                                                                                          const ::rtl::OUString&                           sTargetFrameName              ,\n                                                                                                sal_Int32                                  nSearchFlags                  );\n        css::uno::Reference< css::frame::XDispatch > implts_queryFrameDispatch          ( const css::uno::Reference< css::frame::XFrame >  xFrame                        ,\n                                                                                          const css::util::URL&                            aURL                          ,\n                                                                                          const ::rtl::OUString&                           sTargetFrameName              ,\n                                                                                                sal_Int32                                  nSearchFlags                  );\n        css::uno::Reference< css::frame::XDispatch > implts_searchProtocolHandler       ( const css::util::URL&                            aURL                          );\n\n}; \/\/ class DispatchProvider\n\n} \/\/ namespace framework\n\n#endif \/\/ #ifndef __FRAMEWORK_DISPATCH_DISPATCHPROVIDER_HXX_\n<commit_msg>INTEGRATION: CWS ooo19126 (1.11.348); FILE MERGED 2005\/09\/05 13:04:39 rt 1.11.348.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: dispatchprovider.hxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 00: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 __FRAMEWORK_DISPATCH_DISPATCHPROVIDER_HXX_\n#define __FRAMEWORK_DISPATCH_DISPATCHPROVIDER_HXX_\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_SERVICES_FRAME_HXX_\n#include <services\/frame.hxx>\n#endif\n\n#include <classes\/protocolhandlercache.hxx>\n\n#ifndef __FRAMEWORK_THREADHELP_THREADHELPBASE_HXX_\n#include <threadhelp\/threadhelpbase.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_TRANSACTIONBASE_HXX_\n#include <threadhelp\/transactionbase.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_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_STDTYPES_H_\n#include <stdtypes.h>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\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_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.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_FRAME_DISPATCHDESCRIPTOR_HPP_\n#include <com\/sun\/star\/frame\/DispatchDescriptor.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\n#ifndef _CPPUHELPER_WEAKREF_HXX_\n#include <cppuhelper\/weakref.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @descr          We know some special dispatch objects with diffrent functionality.\n                    The can be created internaly by the following DispatchProvider.\n                    Here we define some identifier to force creation of the right one.\n\n    @modified       20.08.2003 08:34, as96863\n*\/\nenum EDispatchHelper\n{\n    E_DEFAULTDISPATCHER     ,\n    E_MENUDISPATCHER        ,\n    E_HELPAGENTDISPATCHER   ,\n    E_CREATEDISPATCHER      ,\n    E_BLANKDISPATCHER       ,\n    E_SELFDISPATCHER        ,\n    E_CLOSEDISPATCHER\n};\n\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short          implement a helper for XDispatchProvider interface\n    @descr          The result of a queryDispatch() call depends from the owner, which use an instance of this class.\n                    (frame, desktop) All of them must provides different functionality.\n                    E.g:    - task can be created by the desktop only\n                            - a task can have a beamer as direct child\n                            - a normal frame never can create a new one by himself\n\n    @attention      Use this class as member only! Never use it as baseclass.\n                    XInterface will be ambigous and we hold a weakreference to ouer OWNER - not to ouer SUPERCLASS!\n\n    @base           ThreadHelpBase\n                        supports threadsafe mechanism\n    @base           OWeakObject\n                        provides ref count and weak mechanism\n\n    @devstatus      ready to use\n    @threadsafe     yes\n    @modified       17.05.2002 07:56, as96863\n*\/\nclass DispatchProvider  :   \/\/ interfaces\n                            public  css::lang::XTypeProvider            ,\n                            public  css::frame::XDispatchProvider       ,\n                            \/\/ baseclasses\n                            \/\/ Order is neccessary for right initialization!\n                            private ThreadHelpBase                      ,\n                            private TransactionBase                     ,\n                            public  ::cppu::OWeakObject\n{\n    \/* member *\/\n    private:\n        \/\/\/ reference to global service manager to create new services\n        css::uno::Reference< css::lang::XMultiServiceFactory > m_xFactory;\n        \/\/\/ weakreference to owner frame (Don't use a hard reference. Owner can't delete us then!)\n        css::uno::WeakReference< css::frame::XFrame > m_xFrame;\n        \/\/\/ different dispatcher to handle special dispatch calls, protocols or URLs (they will be created on demand.)\n        css::uno::Reference< css::frame::XDispatch > m_xMenuDispatcher     ;\n        css::uno::Reference< css::frame::XDispatch > m_xHelpAgentDispatcher;\n\/*      css::uno::Reference< css::frame::XDispatch > m_xBlankDispatcher    ;\n        css::uno::Reference< css::frame::XDispatch > m_xSelfDispatcher     ;\n        css::uno::Reference< css::frame::XDispatch > m_xDefaultDispatcher  ;*\/\n        \/\/\/ cache of some other dispatch provider which are registered inside configuration to handle special URL protocols\n        HandlerCache m_aProtocolHandlerCache;\n\n    \/* interface *\/\n    public:\n        DECLARE_XINTERFACE\n        DECLARE_XTYPEPROVIDER\n\n        DispatchProvider( const css::uno::Reference< css::lang::XMultiServiceFactory >& xFactory ,\n                          const css::uno::Reference< css::frame::XFrame >&              xFrame   );\n\n        virtual css::uno::Reference< css::frame::XDispatch > SAL_CALL                       queryDispatch  ( const css::util::URL&                                       aURL             ,\n                                                                                                             const ::rtl::OUString&                                      sTargetFrameName ,\n                                                                                                                   sal_Int32                                             nSearchFlags     ) throw( css::uno::RuntimeException );\n        virtual css::uno::Sequence< css::uno::Reference< css::frame::XDispatch > > SAL_CALL queryDispatches( const css::uno::Sequence< css::frame::DispatchDescriptor >& lDescriptions    ) throw( css::uno::RuntimeException );\n\n    \/* helper *\/\n    protected:\n        \/\/ Let him protected! So nobody can use us as base ...\n        virtual ~DispatchProvider();\n\n    private:\n        css::uno::Reference< css::frame::XDispatch > implts_getOrCreateDispatchHelper   (       EDispatchHelper                            eHelper                       ,\n                                                                                          const css::uno::Reference< css::frame::XFrame >& xOwner                        ,\n                                                                                          const ::rtl::OUString&                           sTarget = ::rtl::OUString()   ,\n                                                                                                sal_Int32                                  nSearchFlags = 0              );\n        sal_Bool                                     implts_isLoadableContent           ( const css::util::URL&                            aURL                          );\n        css::uno::Reference< css::frame::XDispatch > implts_queryDesktopDispatch        ( const css::uno::Reference< css::frame::XFrame >  xDesktop                      ,\n                                                                                          const css::util::URL&                            aURL                          ,\n                                                                                          const ::rtl::OUString&                           sTargetFrameName              ,\n                                                                                                sal_Int32                                  nSearchFlags                  );\n        css::uno::Reference< css::frame::XDispatch > implts_queryFrameDispatch          ( const css::uno::Reference< css::frame::XFrame >  xFrame                        ,\n                                                                                          const css::util::URL&                            aURL                          ,\n                                                                                          const ::rtl::OUString&                           sTargetFrameName              ,\n                                                                                                sal_Int32                                  nSearchFlags                  );\n        css::uno::Reference< css::frame::XDispatch > implts_searchProtocolHandler       ( const css::util::URL&                            aURL                          );\n\n}; \/\/ class DispatchProvider\n\n} \/\/ namespace framework\n\n#endif \/\/ #ifndef __FRAMEWORK_DISPATCH_DISPATCHPROVIDER_HXX_\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\/\/ PHOS Preprocessor class. It runs by Shuttle at the end of the run,\n\/\/ calculates calibration coefficients and dead\/bad channels\n\/\/ to be posted in OCDB\n\/\/\n\/\/ Author: Boris Polichtchouk, 4 October 2006\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"AliPHOSPreprocessor.h\"\n#include \"AliLog.h\"\n#include \"AliCDBMetaData.h\"\n#include \"AliPHOSEmcCalibData.h\"\n#include \"TFile.h\"\n#include \"TH1.h\"\n#include \"TMap.h\"\n#include \"TRandom.h\"\n#include \"TKey.h\"\n\nClassImp(AliPHOSPreprocessor)\n\n\/\/_______________________________________________________________________________________\nAliPHOSPreprocessor::AliPHOSPreprocessor() :\nAliPreprocessor(\"PHS\",0)\n{\n  \/\/default constructor\n}\n\n\/\/_______________________________________________________________________________________\nAliPHOSPreprocessor::AliPHOSPreprocessor(AliShuttleInterface* shuttle):\nAliPreprocessor(\"PHS\",shuttle)\n{\n  \/\/ Constructor\n}\n\n\/\/_______________________________________________________________________________________\nUInt_t AliPHOSPreprocessor::Process(TMap* \/*valueSet*\/)\n{\n  \/\/ process data retrieved by the Shuttle\n\n  \/\/ The fileName with the histograms which have been produced by\n  \/\/ AliPHOSCalibHistoProducer.\n  \/\/ It is a responsibility of the SHUTTLE framework to form the fileName\n\n  const char* fileName = GetFile(kDAQ, \"AMPLITUDES\", \"GDC\");\n  AliInfo(Form(\"Got filename: %s\",fileName));\n\n  TFile f(fileName);\n\n  if(!f.IsOpen()) {\n    Log(Form(\"File %s is not opened, something goes wrong!\",fileName));\n    return 0;\n  }\n\n  const Int_t nMod=5; \/\/ 1:5 modules\n  const Int_t nCol=56; \/\/1:56 columns in each module\n  const Int_t nRow=64; \/\/1:64 rows in each module\n\n  Double_t coeff;\n  char hnam[80];\n  TH1F* histo=0;\n\n  \/\/Get the reference histogram\n  \/\/(author: Gustavo Conesa Balbastre)\n\n  TList * keylist = f.GetListOfKeys();\n  Int_t nkeys   = f.GetNkeys();\n  Bool_t ok = kFALSE;\n  TKey  *key;\n  TString refHistoName= \"\";\n  Int_t ikey = 0;\n  Int_t counter = 0;\n  TH1F* hRef = 0;\n\n  \/\/Check if the file contains any histogram\n\n  if(nkeys< 2){\n    Log(Form(\"Not enough histograms (%d) for calibration.\",nkeys));\n    return 1;\n  }\n\n  while(!ok){\n    ikey = gRandom->Integer(nkeys);\n    key = (TKey*)keylist->At(ikey);\n    refHistoName = key->GetName();\n    hRef = (TH1F*)f.Get(refHistoName);\n    counter++;\n    \/\/ Check if the reference histogram has too little statistics\n    if(hRef->GetEntries()>2) ok=kTRUE;\n    if(!ok && counter >= nMod*nCol*nRow){\n      Log(\"No histogram with enough statistics for reference.\");\n      return 1;\n    }\n  }\n\n  Log(Form(\"reference histogram %s, %.1f entries, mean=%.3f, rms=%.3f.\",\n\t hRef->GetName(),hRef->GetEntries(),\n\t hRef->GetMean(),hRef->GetRMS()));\n\n  AliPHOSEmcCalibData calibData;\n  Double_t refMean=hRef->GetMean();\n\n  \/\/ Calculates relative calibration coefficients for all non-zero channels\n\n  for(Int_t mod=0; mod<nMod; mod++) {\n    for(Int_t col=0; col<nCol; col++) {\n      for(Int_t row=0; row<nRow; row++) {\n        sprintf(hnam,\"mod%dcol%drow%d\",mod,col,row);\n        histo = (TH1F*)f.Get(hnam);\n\t\/\/TODO: dead channels exclusion!\n        if(histo) {\n          coeff = histo->GetMean()\/refMean;\n\t  calibData.SetADCchannelEmc(mod+1,col+1,row+1,0.001\/coeff);\n\t  AliInfo(Form(\"mod %d col %d row %d  coeff %f\\n\",mod,col,row,coeff));\n\t}\n        else\n          calibData.SetADCchannelEmc(mod+1,col+1,row+1,0.001); \n      }\n    }\n  }\n\n  AliCDBMetaData metaData;\n  Int_t result = Store(\"Calib\", \"EmcData\", &calibData, &metaData);\n\n  f.Close();\n  return result;\n\n}\n<commit_msg>Hardcoded source file name removed.<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\/\/ PHOS Preprocessor class. It runs by Shuttle at the end of the run,\n\/\/ calculates calibration coefficients and dead\/bad channels\n\/\/ to be posted in OCDB\n\/\/\n\/\/ Author: Boris Polichtchouk, 4 October 2006\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"AliPHOSPreprocessor.h\"\n#include \"AliLog.h\"\n#include \"AliCDBMetaData.h\"\n#include \"AliPHOSEmcCalibData.h\"\n#include \"TFile.h\"\n#include \"TH1.h\"\n#include \"TMap.h\"\n#include \"TRandom.h\"\n#include \"TKey.h\"\n#include \"TList.h\"\n#include \"TObjString.h\"\n\nClassImp(AliPHOSPreprocessor)\n\n\/\/_______________________________________________________________________________________\nAliPHOSPreprocessor::AliPHOSPreprocessor() :\nAliPreprocessor(\"PHS\",0)\n{\n  \/\/default constructor\n}\n\n\/\/_______________________________________________________________________________________\nAliPHOSPreprocessor::AliPHOSPreprocessor(AliShuttleInterface* shuttle):\nAliPreprocessor(\"PHS\",shuttle)\n{\n  \/\/ Constructor\n}\n\n\/\/_______________________________________________________________________________________\nUInt_t AliPHOSPreprocessor::Process(TMap* \/*valueSet*\/)\n{\n  \/\/ process data retrieved by the Shuttle\n\n  \/\/ The fileName with the histograms which have been produced by\n  \/\/ AliPHOSCalibHistoProducer.\n  \/\/ It is a responsibility of the SHUTTLE framework to form the fileName\n  \n  AliPHOSEmcCalibData calibData;\n  \n  TList* list = GetFileSources(kDAQ, \"AMPLITUDES\");\n  if(!list) {\n    Log(\"Sources list not found, exit.\");\n    return 0;\n  }\n\n  TIter iter(list);\n  TObjString *source;\n\n  while ((source = dynamic_cast<TObjString *> (iter.Next()))) {\n    AliInfo(Form(\"found source %s\", source->String().Data()));\n\n    TString fileName = GetFile(kDAQ, \"AMPLITUDES\", source->GetName());\n    AliInfo(Form(\"Got filename: %s\",fileName.Data()));\n\n    TFile f(fileName);\n\n    if(!f.IsOpen()) {\n      Log(Form(\"File %s is not opened, something goes wrong!\",fileName.Data()));\n      return 0;\n    }\n\n    const Int_t nMod=5; \/\/ 1:5 modules\n    const Int_t nCol=56; \/\/1:56 columns in each module\n    const Int_t nRow=64; \/\/1:64 rows in each module\n\n    Double_t coeff;\n    char hnam[80];\n    TH1F* histo=0;\n\n    \/\/Get the reference histogram\n    \/\/(author: Gustavo Conesa Balbastre)\n\n    TList * keylist = f.GetListOfKeys();\n    Int_t nkeys   = f.GetNkeys();\n    Bool_t ok = kFALSE;\n    TKey  *key;\n    TString refHistoName= \"\";\n    Int_t ikey = 0;\n    Int_t counter = 0;\n    TH1F* hRef = 0;\n\n    \/\/Check if the file contains any histogram\n    \n    if(nkeys< 2){\n      Log(Form(\"Not enough histograms (%d) for calibration.\",nkeys));\n      return 1;\n    }\n\n    while(!ok){\n      ikey = gRandom->Integer(nkeys);\n      key = (TKey*)keylist->At(ikey);\n      refHistoName = key->GetName();\n      hRef = (TH1F*)f.Get(refHistoName);\n      counter++;\n      \/\/ Check if the reference histogram has too little statistics\n      if(hRef->GetEntries()>2) ok=kTRUE;\n      if(!ok && counter >= nMod*nCol*nRow){\n\tLog(\"No histogram with enough statistics for reference.\");\n\treturn 1;\n      }\n    }\n\n    Log(Form(\"reference histogram %s, %.1f entries, mean=%.3f, rms=%.3f.\",\n\t     hRef->GetName(),hRef->GetEntries(),\n\t     hRef->GetMean(),hRef->GetRMS()));\n\n    Double_t refMean=hRef->GetMean();\n\n    \/\/ Calculates relative calibration coefficients for all non-zero channels\n\n    for(Int_t mod=0; mod<nMod; mod++) {\n      for(Int_t col=0; col<nCol; col++) {\n\tfor(Int_t row=0; row<nRow; row++) {\n\t  sprintf(hnam,\"mod%dcol%drow%d\",mod,col,row);\n\t  histo = (TH1F*)f.Get(hnam);\n\t  \/\/TODO: dead channels exclusion!\n\t  if(histo) {\n\t    coeff = histo->GetMean()\/refMean;\n\t    calibData.SetADCchannelEmc(mod+1,col+1,row+1,0.001\/coeff);\n\t    AliInfo(Form(\"mod %d col %d row %d  coeff %f\\n\",mod,col,row,coeff));\n\t  }\n\t  else\n\t    calibData.SetADCchannelEmc(mod+1,col+1,row+1,0.001); \n\t}\n      }\n    }\n    \n    f.Close();\n  }\n  \n  AliCDBMetaData metaData;\n  Int_t result = Store(\"Calib\", \"EmcData\", &calibData, &metaData);\n\n  return result;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: mailtodispatcher.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: as $ $Date: 2002-05-03 08:01: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#ifndef __FRAMEWORK_DISPATCH_MAILTODISPATCHER_HXX_\n#define __FRAMEWORK_DISPATCH_MAILTODISPATCHER_HXX_\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.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_THREADHELP_THREADHELPBASE_HXX_\n#include <threadhelp\/threadhelpbase.hxx>\n#endif\n\n#ifndef __FRAMEWORK_GENERAL_H_\n#include <general.h>\n#endif\n\n#ifndef __FRAMEWORK_STDTYPES_H_\n#include <stdtypes.h>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\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_XNOTIFYINGDISPATCH_HPP_\n#include <com\/sun\/star\/frame\/XNotifyingDispatch.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCH_HPP_\n#include <com\/sun\/star\/frame\/XDispatch.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.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_FRAME_XSTATUSLISTENER_HPP_\n#include <com\/sun\/star\/frame\/XStatusListener.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short          protocol handler for \"mailto:\" URLs\n    @descr          It's a special dispatch object which is used registered for \"mailto:*\" URLs and\n                    will be automaticly used from the framework dispatch mechanism if such URL occured.\n\n    @base           ThreadHelpBase\n                        exports a lock member to guarantee right initialize value of it\n    @base           OWeakObject\n                        provides XWeak and ref count mechanism\n\n    @devstatus      ready to use\n\n    @modified       02.05.2002 08:12, as96863\n*\/\nclass MailToDispatcher : \/\/ interfaces\n                         public  css::lang::XTypeProvider      ,\n                         public  css::lang::XServiceInfo       ,\n                         public  css::frame::XDispatchProvider ,\n                         public  css::frame::XNotifyingDispatch, \/\/ => XDispatch\n                         \/\/ baseclasses\n                         \/\/ Order is neccessary for right initialization!\n                         private ThreadHelpBase                ,\n                         public  cppu::OWeakObject\n{\n    \/* member *\/\n    private:\n\n        \/\/\/ reference to global uno service manager which had created us\n        css::uno::Reference< css::lang::XMultiServiceFactory > m_xFactory;\n\n    \/* interface *\/\n    public:\n\n        \/\/ ctor\/dtor\n                 MailToDispatcher( const css::uno::Reference< css::lang::XMultiServiceFactory >& xFactory );\n        virtual ~MailToDispatcher(                                                                        );\n\n        \/\/ XInterface, XTypeProvider, XServiceInfo\n        DECLARE_XINTERFACE\n        DECLARE_XTYPEPROVIDER\n        DECLARE_XSERVICEINFO\n\n        \/\/ XDispatchProvider\n        virtual css::uno::Reference< css::frame::XDispatch > SAL_CALL                       queryDispatch  ( const css::util::URL&                                       aURL        ,\n                                                                                                             const ::rtl::OUString&                                      sTarget     ,\n                                                                                                                   sal_Int32                                             nFlags      ) throw( css::uno::RuntimeException );\n        virtual css::uno::Sequence< css::uno::Reference< css::frame::XDispatch > > SAL_CALL queryDispatches( const css::uno::Sequence< css::frame::DispatchDescriptor >& lDescriptor ) throw( css::uno::RuntimeException );\n\n        \/\/ XNotifyingDispatch\n        virtual void SAL_CALL dispatchWithNotification( const css::util::URL&                                             aURL      ,\n                                                        const css::uno::Sequence< css::beans::PropertyValue >&            lArguments,\n                                                        const css::uno::Reference< css::frame::XDispatchResultListener >& xListener ) throw( css::uno::RuntimeException );\n\n        \/\/ XDispatch\n        virtual void SAL_CALL dispatch            ( const css::util::URL&                                     aURL       ,\n                                                    const css::uno::Sequence< css::beans::PropertyValue >&    lArguments ) throw( css::uno::RuntimeException );\n        virtual void SAL_CALL addStatusListener   ( const css::uno::Reference< css::frame::XStatusListener >& xListener  ,\n                                                    const css::util::URL&                                     aURL       ) throw( css::uno::RuntimeException );\n        virtual void SAL_CALL removeStatusListener( const css::uno::Reference< css::frame::XStatusListener >& xListener  ,\n                                                    const css::util::URL&                                     aURL       ) throw( css::uno::RuntimeException );\n\n    \/* internal *\/\n    private:\n\n        sal_Bool implts_dispatch( const css::util::URL&                                  aURL       ,\n                                  const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException );\n\n};      \/\/  class MailToDispatcher\n\n}       \/\/  namespace framework\n\n#endif  \/\/  #ifndef __FRAMEWORK_DISPATCH_MAILTODISPATCHER_HXX_\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.562); FILE MERGED 2005\/09\/05 13:04:43 rt 1.3.562.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: mailtodispatcher.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 00:13: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#ifndef __FRAMEWORK_DISPATCH_MAILTODISPATCHER_HXX_\n#define __FRAMEWORK_DISPATCH_MAILTODISPATCHER_HXX_\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.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_THREADHELP_THREADHELPBASE_HXX_\n#include <threadhelp\/threadhelpbase.hxx>\n#endif\n\n#ifndef __FRAMEWORK_GENERAL_H_\n#include <general.h>\n#endif\n\n#ifndef __FRAMEWORK_STDTYPES_H_\n#include <stdtypes.h>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\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_XNOTIFYINGDISPATCH_HPP_\n#include <com\/sun\/star\/frame\/XNotifyingDispatch.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCH_HPP_\n#include <com\/sun\/star\/frame\/XDispatch.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.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_FRAME_XSTATUSLISTENER_HPP_\n#include <com\/sun\/star\/frame\/XStatusListener.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/**\n    @short          protocol handler for \"mailto:\" URLs\n    @descr          It's a special dispatch object which is used registered for \"mailto:*\" URLs and\n                    will be automaticly used from the framework dispatch mechanism if such URL occured.\n\n    @base           ThreadHelpBase\n                        exports a lock member to guarantee right initialize value of it\n    @base           OWeakObject\n                        provides XWeak and ref count mechanism\n\n    @devstatus      ready to use\n\n    @modified       02.05.2002 08:12, as96863\n*\/\nclass MailToDispatcher : \/\/ interfaces\n                         public  css::lang::XTypeProvider      ,\n                         public  css::lang::XServiceInfo       ,\n                         public  css::frame::XDispatchProvider ,\n                         public  css::frame::XNotifyingDispatch, \/\/ => XDispatch\n                         \/\/ baseclasses\n                         \/\/ Order is neccessary for right initialization!\n                         private ThreadHelpBase                ,\n                         public  cppu::OWeakObject\n{\n    \/* member *\/\n    private:\n\n        \/\/\/ reference to global uno service manager which had created us\n        css::uno::Reference< css::lang::XMultiServiceFactory > m_xFactory;\n\n    \/* interface *\/\n    public:\n\n        \/\/ ctor\/dtor\n                 MailToDispatcher( const css::uno::Reference< css::lang::XMultiServiceFactory >& xFactory );\n        virtual ~MailToDispatcher(                                                                        );\n\n        \/\/ XInterface, XTypeProvider, XServiceInfo\n        DECLARE_XINTERFACE\n        DECLARE_XTYPEPROVIDER\n        DECLARE_XSERVICEINFO\n\n        \/\/ XDispatchProvider\n        virtual css::uno::Reference< css::frame::XDispatch > SAL_CALL                       queryDispatch  ( const css::util::URL&                                       aURL        ,\n                                                                                                             const ::rtl::OUString&                                      sTarget     ,\n                                                                                                                   sal_Int32                                             nFlags      ) throw( css::uno::RuntimeException );\n        virtual css::uno::Sequence< css::uno::Reference< css::frame::XDispatch > > SAL_CALL queryDispatches( const css::uno::Sequence< css::frame::DispatchDescriptor >& lDescriptor ) throw( css::uno::RuntimeException );\n\n        \/\/ XNotifyingDispatch\n        virtual void SAL_CALL dispatchWithNotification( const css::util::URL&                                             aURL      ,\n                                                        const css::uno::Sequence< css::beans::PropertyValue >&            lArguments,\n                                                        const css::uno::Reference< css::frame::XDispatchResultListener >& xListener ) throw( css::uno::RuntimeException );\n\n        \/\/ XDispatch\n        virtual void SAL_CALL dispatch            ( const css::util::URL&                                     aURL       ,\n                                                    const css::uno::Sequence< css::beans::PropertyValue >&    lArguments ) throw( css::uno::RuntimeException );\n        virtual void SAL_CALL addStatusListener   ( const css::uno::Reference< css::frame::XStatusListener >& xListener  ,\n                                                    const css::util::URL&                                     aURL       ) throw( css::uno::RuntimeException );\n        virtual void SAL_CALL removeStatusListener( const css::uno::Reference< css::frame::XStatusListener >& xListener  ,\n                                                    const css::util::URL&                                     aURL       ) throw( css::uno::RuntimeException );\n\n    \/* internal *\/\n    private:\n\n        sal_Bool implts_dispatch( const css::util::URL&                                  aURL       ,\n                                  const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException );\n\n};      \/\/  class MailToDispatcher\n\n}       \/\/  namespace framework\n\n#endif  \/\/  #ifndef __FRAMEWORK_DISPATCH_MAILTODISPATCHER_HXX_\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, version 1.0 RC 1        *\n*                (c) 2006-2011 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 :: Modules                               *\n*                                                                             *\n* This component is open-source                                               *\n*                                                                             *\n* Authors: Damien Marchal                                                     *\n*          Bruno Carrez                                                       *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n\/*****************************************************************************\n* User of this library should read the documentation\n* in the TextMessaging.h file.\n******************************************************************************\/\n#include <sstream>\nusing std::ostringstream ;\n\n#include <iostream>\nusing std::endl ;\n\n#include <string>\nusing std::string ;\n\n#include <sofa\/core\/objectmodel\/Base.h>\nusing sofa::core::objectmodel::Base ;\n\n\/\/#include \"Messagehandler.h\"\n#include \"Message.h\"\n\nnamespace sofa\n{\n\nnamespace helper\n{\n\nnamespace messaging\n{\n\nMessage::Message():\n    m_sender(0),\n    m_sendername(\"none\"),\n    m_source(\"none\"),\n    m_lineno(0),\n    m_message(\"none\"),\n    m_class(\"DEV\"),\n    m_type(\"INFO\"),\n    m_id(-1)\n{\n\n}\nMessage::Message(string mclass, string type,  Base* sender, string source, int lineno){\n    m_sender = sender ;\n    m_source = source ;\n    m_lineno = lineno ;\n    m_message = \"undefined\" ;\n    m_class   = mclass;\n    m_type    = type ;\n    m_id      = -1 ;\n\n    if(sender!=nullptr){\n        ostringstream s;\n        s << \"[\" << sender->getName() << \"(\" << sender->getClassName() <<   \")]: \";\n        m_sendername = s.str();\n    }else{\n        m_sendername = \"undefined\" ;\n    }\n}\n\nMessage::Message(string mclass, string type,  const string& sendername, string source, int lineno){\n    m_sender = nullptr ;\n    m_sendername = sendername ;\n    m_source = source ;\n    m_lineno = lineno ;\n    m_message = \"undefined\" ;\n    m_class   = mclass;\n    m_type    = type ;\n    m_id      = -1 ;\n}\n\nMessage& Message::operator<=(const std::ostream& s)\n{\n    ostringstream tmp ;\n    tmp << s.rdbuf() ;\n\n    m_message = tmp.str() ;\n    return *this ;\n}\n\nconst string& Message::source() const {\n    return m_source;\n}\n\nint Message::lineno() const  {\n    return m_lineno;\n}\n\nconst string& Message::message() const  {\n    return m_message;\n}\n\nBase*  Message::sender() const  {\n    return m_sender;\n}\n\nconst std::string&  Message::sendername() const  {\n    return m_sendername;\n}\n\nconst string& Message::context() const  {\n    return m_class;\n}\n\nconst string& Message::type() const {\n    return m_type;\n}\n\nint Message::id() const  {\n    return m_id;\n}\n\nvoid Message::setId(int id){\n    m_id = id;\n}\n\nstd::ostream& operator<< (std::ostream& s, const Message& m){\n    s << \"[\" << m.sendername() << \"]: \" << endl ;\n    s << \"         Message id: \" << m.id() << endl ;\n    s << \"       Message type: \" << m.type() << endl ;\n    s << \"    Message content: \" << m.message() << endl ;\n    s << \"    source code loc: \" << m.source() << \":\" << m.lineno() << endl ;\n    return s;\n}\n\nMessage Message::empty = Message() ;\n\n} \/\/ messaging\n} \/\/ helper\n} \/\/ sofa\n<commit_msg>FIX some remaining C++11 things in the code<commit_after>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, version 1.0 RC 1        *\n*                (c) 2006-2011 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 :: Modules                               *\n*                                                                             *\n* This component is open-source                                               *\n*                                                                             *\n* Authors: Damien Marchal                                                     *\n*          Bruno Carrez                                                       *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n\/*****************************************************************************\n* User of this library should read the documentation\n* in the TextMessaging.h file.\n******************************************************************************\/\n#include <sstream>\nusing std::ostringstream ;\n\n#include <iostream>\nusing std::endl ;\n\n#include <string>\nusing std::string ;\n\n#include <sofa\/core\/objectmodel\/Base.h>\nusing sofa::core::objectmodel::Base ;\n\n\/\/#include \"Messagehandler.h\"\n#include \"Message.h\"\n\nnamespace sofa\n{\n\nnamespace helper\n{\n\nnamespace messaging\n{\n\nMessage::Message():\n    m_sender(0),\n    m_sendername(\"none\"),\n    m_source(\"none\"),\n    m_lineno(0),\n    m_message(\"none\"),\n    m_class(\"DEV\"),\n    m_type(\"INFO\"),\n    m_id(-1)\n{\n\n}\nMessage::Message(string mclass, string type,  Base* sender, string source, int lineno){\n    m_sender = sender ;\n    m_source = source ;\n    m_lineno = lineno ;\n    m_message = \"undefined\" ;\n    m_class   = mclass;\n    m_type    = type ;\n    m_id      = -1 ;\n\n    if(sender!=0){\n        ostringstream s;\n        s << \"[\" << sender->getName() << \"(\" << sender->getClassName() <<   \")]: \";\n        m_sendername = s.str();\n    }else{\n        m_sendername = \"undefined\" ;\n    }\n}\n\nMessage::Message(string mclass, string type,  const string& sendername, string source, int lineno){\n    m_sender = 0 ;\n    m_sendername = sendername ;\n    m_source = source ;\n    m_lineno = lineno ;\n    m_message = \"undefined\" ;\n    m_class   = mclass;\n    m_type    = type ;\n    m_id      = -1 ;\n}\n\nMessage& Message::operator<=(const std::ostream& s)\n{\n    ostringstream tmp ;\n    tmp << s.rdbuf() ;\n\n    m_message = tmp.str() ;\n    return *this ;\n}\n\nconst string& Message::source() const {\n    return m_source;\n}\n\nint Message::lineno() const  {\n    return m_lineno;\n}\n\nconst string& Message::message() const  {\n    return m_message;\n}\n\nBase*  Message::sender() const  {\n    return m_sender;\n}\n\nconst std::string&  Message::sendername() const  {\n    return m_sendername;\n}\n\nconst string& Message::context() const  {\n    return m_class;\n}\n\nconst string& Message::type() const {\n    return m_type;\n}\n\nint Message::id() const  {\n    return m_id;\n}\n\nvoid Message::setId(int id){\n    m_id = id;\n}\n\nstd::ostream& operator<< (std::ostream& s, const Message& m){\n    s << \"[\" << m.sendername() << \"]: \" << endl ;\n    s << \"         Message id: \" << m.id() << endl ;\n    s << \"       Message type: \" << m.type() << endl ;\n    s << \"    Message content: \" << m.message() << endl ;\n    s << \"    source code loc: \" << m.source() << \":\" << m.lineno() << endl ;\n    return s;\n}\n\nMessage Message::empty = Message() ;\n\n} \/\/ messaging\n} \/\/ helper\n} \/\/ sofa\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: statusindicator.cxx,v $\n *\n *  $Revision: 1.1 $\n *\n *  last change: $Author: as $ $Date: 2001-08-10 11:54: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\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_HELPER_STATUSINDICATOR_HXX_\n#include <helper\/statusindicator.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_RESETABLEGUARD_HXX_\n#include <threadhelp\/resetableguard.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  includes of other projects\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  non exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  non exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  declarations\n\/\/_________________________________________________________________________________________________________________\n\n\/\/*****************************************************************************************************************\n\/\/  XInterface, XTypeProvider\n\/\/*****************************************************************************************************************\nDEFINE_XINTERFACE_2     (   StatusIndicator                             ,\n                            OWeakObject                                 ,\n                            DIRECT_INTERFACE(css::lang::XTypeProvider   ),\n                            DIRECT_INTERFACE(css::task::XStatusIndicator)\n                        )\n\nDEFINE_XTYPEPROVIDER_2  (   StatusIndicator                             ,\n                            css::lang::XTypeProvider                    ,\n                            css::task::XStatusIndicator\n                        )\n\n\/*-************************************************************************************************************\/\/**\n    @short      standard ctor\n    @descr      These initialize a new instance of this class with all needed informations for work.\n\n    @seealso    -\n\n    @param      \"pFactory\", pointer to factory, which has created this instance (XStatusIndicatorFactory!)\n    @return     -\n\n    @onerror    -\n    @threadsafe yes\n*\/\/*-*************************************************************************************************************\/\nStatusIndicator::StatusIndicator( StatusIndicatorFactory* pFactory )\n        \/\/  Init baseclasses first\n        :   ThreadHelpBase      ( &Application::GetSolarMutex() )\n        ,   ::cppu::OWeakObject (                               )\n        \/\/ Init member\n        ,   m_pFactory          ( pFactory                      )\n        ,   m_xFactoryWeak      ( pFactory                      )\n{\n    \/\/ Safe impossible cases\n    \/\/ Method not defined for all incoming parameter.\n    LOG_ASSERT2( implcp_StatusIndicator( pFactory ), \"StatusIndicator::StatusIndicator()\", \"Invalid parameter detected!\" )\n}\n\n\/*-************************************************************************************************************\/\/**\n    @short      standard dtor\n    @descr      Forget all references and pointer ... let they die.\n\n    @seealso    -\n\n    @param      -\n    @return     -\n\n    @onerror    -\n    @threadsafe yes\n*\/\/*-*************************************************************************************************************\/\nStatusIndicator::~StatusIndicator()\n{\n    m_pFactory     = NULL                                                           ;\n    m_xFactoryWeak = css::uno::WeakReference< css::task::XStatusIndicatorFactory >();\n}\n\n\/*-************************************************************************************************************\/\/**\n    @interface  XStatusIndicator\n    @short      These methods implement the functionality of this interface.\n    @descr      But instances of this class are wrapper only. They try to get a right references from saved weak reference\n                to her StatusIndicatorFactory. If it was successfully - they forward her calls to this factory only.\n                These factory decide, which of the caller objects is the most active one and can show his informations.\n                Other calls are ignored.\n\n    @seealso    class StatusIndicatorFactory\n\n    @param      \"sText\" , new text to show it in dialog\n    @param      \"nRange\", new range for progress\n    @param      \"nValue\", new value to show the progress\n    @return     -\n\n    @onerror    We do nothing!\n    @threadsafe yes\n*\/\/*-*************************************************************************************************************\/\nvoid SAL_CALL StatusIndicator::start( const ::rtl::OUString& sText  ,\n                                            sal_Int32        nRange ) throw( css::uno::RuntimeException )\n{\n    \/* UNSAFE AREA --------------------------------------------------------------------------------------------- *\/\n    \/\/ Safe impossible cases\n    \/\/ Method not defined for all incoming parameter.\n    LOG_ASSERT2( implcp_start( sText, nRange ), \"StatusIndicator::start()\", \"Invalid parameter detected!\" )\n\n    \/* SAFE AREA ----------------------------------------------------------------------------------------------- *\/\n    \/\/ Ready for multithreading\n    ResetableGuard aLock( m_aLock );\n\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory( m_xFactoryWeak.get(), css::uno::UNO_QUERY );\n    if( xFactory.is() == sal_True )\n    {\n        m_pFactory->start( this, sText, nRange );\n    }\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL StatusIndicator::end() throw( css::uno::RuntimeException )\n{\n    \/* SAFE AREA ----------------------------------------------------------------------------------------------- *\/\n    \/\/ Ready for multithreading\n    ResetableGuard aLock( m_aLock );\n\n    \/\/ Attention: Our factory forget our reference after calling \"end()\". So we must protect us against\n    \/\/ dieing during this operation!\n    css::uno::Reference< css::uno::XInterface > xThis( static_cast< ::cppu::OWeakObject* >(this), css::uno::UNO_QUERY );\n\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory( m_xFactoryWeak.get(), css::uno::UNO_QUERY );\n    if( xFactory.is() == sal_True )\n    {\n        m_pFactory->end( this );\n    }\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL StatusIndicator::reset() throw( css::uno::RuntimeException )\n{\n    \/* SAFE AREA ----------------------------------------------------------------------------------------------- *\/\n    \/\/ Ready for multithreading\n    ResetableGuard aLock( m_aLock );\n\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory( m_xFactoryWeak.get(), css::uno::UNO_QUERY );\n    if( xFactory.is() == sal_True )\n    {\n        m_pFactory->reset( this );\n    }\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL StatusIndicator::setText( const ::rtl::OUString& sText ) throw( css::uno::RuntimeException )\n{\n    \/* UNSAFE AREA --------------------------------------------------------------------------------------------- *\/\n    \/\/ Safe impossible cases\n    \/\/ Method not defined for all incoming parameter.\n    LOG_ASSERT2( implcp_setText( sText ), \"StatusIndicator::setText()\", \"Invalid parameter detected!\" )\n\n    \/* SAFE AREA ----------------------------------------------------------------------------------------------- *\/\n    \/\/ Ready for multithreading\n    ResetableGuard aLock( m_aLock );\n\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory( m_xFactoryWeak.get(), css::uno::UNO_QUERY );\n    if( xFactory.is() == sal_True )\n    {\n        m_pFactory->setText( this, sText );\n    }\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL StatusIndicator::setValue( sal_Int32 nValue ) throw( css::uno::RuntimeException )\n{\n    \/* UNSAFE AREA --------------------------------------------------------------------------------------------- *\/\n    \/\/ Safe impossible cases\n    \/\/ Method not defined for all incoming parameter.\n    LOG_ASSERT2( implcp_setValue( nValue ), \"StatusIndicator::setValue()\", \"Invalid parameter detected!\" )\n\n    \/* SAFE AREA ----------------------------------------------------------------------------------------------- *\/\n    \/\/ Ready for multithreading\n    ResetableGuard aLock( m_aLock );\n\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory( m_xFactoryWeak.get(), css::uno::UNO_QUERY );\n    if( xFactory.is() == sal_True )\n    {\n        m_pFactory->setValue( this, nValue );\n    }\n}\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  debug methods\n\/\/_________________________________________________________________________________________________________________\n\n\/*-************************************************************************************************************\/\/**\n    @short      debug-method to check incoming parameter of some other mehods of this class\n    @descr      The following methods are used to check parameters for other methods\n                of this class. The return value is used directly for an ASSERT(...).\n\n    @seealso    ASSERTs in implementation!\n\n    @param      references to checking variables\n    @return     sal_False ,on invalid parameter\n    @return     sal_True  ,otherwise\n\n    @onerror    -\n*\/\/*-*************************************************************************************************************\/\n#ifdef ENABLE_ASSERTIONS\n\n\/\/*****************************************************************************************************************\nsal_Bool StatusIndicator::implcp_StatusIndicator( StatusIndicatorFactory* pFactory )\n{\n    return( pFactory == NULL );\n}\n\n\/\/*****************************************************************************************************************\nsal_Bool StatusIndicator::implcp_start( const ::rtl::OUString&  sText   ,\n                                              sal_Int32         nRange  )\n{\n    return(\n            ( &sText  == NULL ) ||\n            ( &nRange == NULL ) ||\n            ( nRange  <  1    )     \/\/ We count from 0 to range ... and range should be greater then 0 ...!\n          );\n}\n\n\/\/*****************************************************************************************************************\nsal_Bool StatusIndicator::implcp_setText( const ::rtl::OUString& sText )\n{\n    return( &sText == NULL );\n}\n\n\/\/*****************************************************************************************************************\nsal_Bool StatusIndicator::implcp_setValue( sal_Int32 nValue )\n{\n    return( nValue < 0 );\n}\n\n#endif  \/\/  #ifdef ENABLE_ASSERTIONS\n\n}       \/\/  namespace framework\n<commit_msg>INTEGRATION: CWS imprec01 (1.1.408); FILE MERGED 2004\/12\/15 06:51:20 as 1.1.408.1: #i35842# implement intelligent reschedule<commit_after>\/*************************************************************************\n *\n *  $RCSfile: statusindicator.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-02-02 13:53: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 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\/\/_______________________________________________\n\/\/ include files of own module\n\n#ifndef __FRAMEWORK_HELPER_STATUSINDICATOR_HXX_\n#include <helper\/statusindicator.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_READGUARD_HXX_\n#include <threadhelp\/readguard.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_WRITEGUARD_HXX_\n#include <threadhelp\/writeguard.hxx>\n#endif\n\n\/\/_______________________________________________\n\/\/ namespace\n\nnamespace framework{\n\n\/\/_______________________________________________\n\/\/ declarations\n\n\/\/***********************************************\n\/\/ XInterface\nDEFINE_XINTERFACE_2(StatusIndicator                              ,\n                    OWeakObject                                  ,\n                    DIRECT_INTERFACE(css::lang::XTypeProvider   ),\n                    DIRECT_INTERFACE(css::task::XStatusIndicator))\n\n\/\/***********************************************\n\/\/ XInterface\nDEFINE_XTYPEPROVIDER_2(StatusIndicator            ,\n                       css::lang::XTypeProvider   ,\n                       css::task::XStatusIndicator)\n\n\/\/***********************************************\nStatusIndicator::StatusIndicator(StatusIndicatorFactory* pFactory)\n    : ThreadHelpBase     (        )\n    , ::cppu::OWeakObject(        )\n    , m_xFactory         (pFactory)\n{\n}\n\n\/\/***********************************************\nStatusIndicator::~StatusIndicator()\n{\n}\n\n\/\/***********************************************\nvoid SAL_CALL StatusIndicator::start(const ::rtl::OUString& sText ,\n                                           sal_Int32        nRange)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ SAFE ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory(m_xFactory.get(), css::uno::UNO_QUERY);\n    aReadLock.unlock();\n    \/\/ <- SAFE\n    if (xFactory.is())\n    {\n        StatusIndicatorFactory* pFactory = (StatusIndicatorFactory*)xFactory.get();\n        pFactory->start(this, sText, nRange);\n    }\n}\n\n\/\/***********************************************\nvoid SAL_CALL StatusIndicator::end()\n    throw(css::uno::RuntimeException)\n{\n    \/\/ SAFE ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory(m_xFactory.get(), css::uno::UNO_QUERY);\n    aReadLock.unlock();\n    \/\/ <- SAFE\n    if (xFactory.is())\n    {\n        StatusIndicatorFactory* pFactory = (StatusIndicatorFactory*)xFactory.get();\n        pFactory->end(this);\n    }\n}\n\n\/\/***********************************************\nvoid SAL_CALL StatusIndicator::reset()\n    throw(css::uno::RuntimeException)\n{\n    \/\/ SAFE ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory(m_xFactory.get(), css::uno::UNO_QUERY);\n    aReadLock.unlock();\n    \/\/ <- SAFE\n    if (xFactory.is())\n    {\n        StatusIndicatorFactory* pFactory = (StatusIndicatorFactory*)xFactory.get();\n        pFactory->reset(this);\n    }\n}\n\n\/\/***********************************************\nvoid SAL_CALL StatusIndicator::setText(const ::rtl::OUString& sText)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ SAFE ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory(m_xFactory.get(), css::uno::UNO_QUERY);\n    aReadLock.unlock();\n    \/\/ <- SAFE\n    if (xFactory.is())\n    {\n        StatusIndicatorFactory* pFactory = (StatusIndicatorFactory*)xFactory.get();\n        pFactory->setText(this, sText);\n    }\n}\n\n\/\/***********************************************\nvoid SAL_CALL StatusIndicator::setValue(sal_Int32 nValue)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ SAFE ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::task::XStatusIndicatorFactory > xFactory(m_xFactory.get(), css::uno::UNO_QUERY);\n    aReadLock.unlock();\n    \/\/ <- SAFE\n    if (xFactory.is())\n    {\n        StatusIndicatorFactory* pFactory = (StatusIndicatorFactory*)xFactory.get();\n        pFactory->setValue(this, nValue);\n    }\n}\n\n} \/\/ namespace framework\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2018 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 \"entity_name.hpp\"\n\n#include \"main.hpp\"\n\n#include <cstdint>\n#include <cstring>\n#include <filesystem>\n#include <fstream>\n#include <nlohmann\/json.hpp>\n#include <phosphor-logging\/elog-errors.hpp>\n#include <phosphor-logging\/log.hpp>\n#include <regex>\n#include <sstream>\n#include <string>\n#include <system_error>\n#include <unordered_map>\n#include <vector>\n#include <xyz\/openbmc_project\/Common\/error.hpp>\n\nnamespace google\n{\nnamespace ipmi\n{\nnamespace fs = std::filesystem;\n\nnamespace\n{\n\n\/\/ TODO (jaghu) : Add a call to get getChannelMaxTransferSize.\n#ifndef MAX_IPMI_BUFFER\n#define MAX_IPMI_BUFFER 64\n#endif\n\nusing Json = nlohmann::json;\n\nusing namespace phosphor::logging;\nusing InternalFailure =\n    sdbusplus::xyz::openbmc_project::Common::Error::InternalFailure;\n\nstatic constexpr auto configFile =\n    \"\/usr\/share\/ipmi-entity-association\/entity_association_map.json\";\n\nstatic const std::map<uint8_t, std::string> entityIdToName{\n    {0x03, \"cpu\"},\n    {0x04, \"storage_device\"},\n    {0x06, \"system_management_module\"},\n    {0x08, \"memory_module\"},\n    {0x0B, \"add_in_card\"},\n    {0x17, \"system_chassis\"},\n    {0x20, \"memory_device\"}};\n\nJson parse_config()\n{\n    std::ifstream jsonFile(configFile);\n    if (!jsonFile.is_open())\n    {\n        log<level::ERR>(\"Entity association JSON file not found\");\n        elog<InternalFailure>();\n    }\n\n    auto data = Json::parse(jsonFile, nullptr, false);\n    if (data.is_discarded())\n    {\n        log<level::ERR>(\"Entity association JSON parser failure\");\n        elog<InternalFailure>();\n    }\n\n    return data;\n}\n\nstd::string read(const std::string& type, uint8_t instance, const Json& config)\n{\n    static const std::vector<Json> empty{};\n    std::vector<Json> readings = config.value(type, empty);\n    std::string name = \"\";\n    for (const auto& j : readings)\n    {\n        uint8_t instanceNum = j.value(\"instance\", 0);\n        \/\/ Not the instance we're interested in\n        if (instanceNum != instance)\n        {\n            continue;\n        }\n\n        \/\/ Found the instance we're interested in\n        name = j.value(\"name\", \"\");\n\n        break;\n    }\n    return name;\n}\n\n} \/\/ namespace\n\nstruct GetEntityNameRequest\n{\n    uint8_t subcommand;\n    uint8_t entity_id;\n    uint8_t entity_instance;\n} __attribute__((packed));\n\nstruct GetEntityNameReply\n{\n    uint8_t subcommand;\n    uint8_t entity_name_len;\n    uint8_t entity_name[0];\n} __attribute__((packed));\n\nipmi_ret_t GetEntityName(const uint8_t* reqBuf, uint8_t* replyBuf,\n                         size_t* dataLen)\n{\n    struct GetEntityNameRequest request;\n\n    if ((*dataLen) < sizeof(request))\n    {\n        std::fprintf(stderr, \"Invalid command length: %u\\n\",\n                     static_cast<uint32_t>(*dataLen));\n        return IPMI_CC_REQ_DATA_LEN_INVALID;\n    }\n\n    std::memcpy(&request, &reqBuf[0], sizeof(request));\n\n    \/\/ Check if we support this Entity ID.\n    auto it = entityIdToName.find(request.entity_id);\n    if (it == entityIdToName.end())\n    {\n        log<level::ERR>(\"Unknown Entity ID\",\n                        entry(\"ENTITY_ID=%d\", request.entity_id));\n        return IPMI_CC_INVALID_FIELD_REQUEST;\n    }\n\n    static Json config{};\n    static bool parsed = false;\n\n    std::string entityName;\n    try\n    {\n        \/\/ Parse the JSON config file.\n        if (!parsed)\n        {\n            config = parse_config();\n            parsed = true;\n        }\n\n        \/\/ Find the \"entity id:entity instance\" mapping to entity name.\n        entityName = read(it->second, request.entity_instance, config);\n        if (entityName.empty())\n            return IPMI_CC_INVALID_FIELD_REQUEST;\n    }\n    catch (InternalFailure& e)\n    {\n        return IPMI_CC_UNSPECIFIED_ERROR;\n    }\n\n    int length = sizeof(struct GetEntityNameReply) + entityName.length();\n\n    \/\/ TODO (jaghu) : Add a call to get getChannelMaxTransferSize.\n    if (length > MAX_IPMI_BUFFER)\n    {\n        std::fprintf(stderr, \"Response would overflow response buffer\\n\");\n        return IPMI_CC_INVALID;\n    }\n\n    auto reply = reinterpret_cast<struct GetEntityNameReply*>(&replyBuf[0]);\n    reply->subcommand = SysEntityName;\n    reply->entity_name_len = entityName.length();\n    std::memcpy(reply->entity_name, entityName.c_str(), entityName.length());\n\n    (*dataLen) = length;\n    return IPMI_CC_OK;\n}\n} \/\/ namespace ipmi\n} \/\/ namespace google\n<commit_msg>entity_name: cleanup headers<commit_after>\/*\n * Copyright 2018 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 \"entity_name.hpp\"\n\n#include \"main.hpp\"\n\n#include <cstdint>\n#include <cstring>\n#include <filesystem>\n#include <fstream>\n#include <map>\n#include <nlohmann\/json.hpp>\n#include <phosphor-logging\/elog-errors.hpp>\n#include <phosphor-logging\/log.hpp>\n#include <string>\n#include <vector>\n#include <xyz\/openbmc_project\/Common\/error.hpp>\n\nnamespace google\n{\nnamespace ipmi\n{\nnamespace fs = std::filesystem;\n\nnamespace\n{\n\n\/\/ TODO (jaghu) : Add a call to get getChannelMaxTransferSize.\n#ifndef MAX_IPMI_BUFFER\n#define MAX_IPMI_BUFFER 64\n#endif\n\nusing Json = nlohmann::json;\n\nusing namespace phosphor::logging;\nusing InternalFailure =\n    sdbusplus::xyz::openbmc_project::Common::Error::InternalFailure;\n\nstatic constexpr auto configFile =\n    \"\/usr\/share\/ipmi-entity-association\/entity_association_map.json\";\n\nstatic const std::map<uint8_t, std::string> entityIdToName{\n    {0x03, \"cpu\"},\n    {0x04, \"storage_device\"},\n    {0x06, \"system_management_module\"},\n    {0x08, \"memory_module\"},\n    {0x0B, \"add_in_card\"},\n    {0x17, \"system_chassis\"},\n    {0x20, \"memory_device\"}};\n\nJson parse_config()\n{\n    std::ifstream jsonFile(configFile);\n    if (!jsonFile.is_open())\n    {\n        log<level::ERR>(\"Entity association JSON file not found\");\n        elog<InternalFailure>();\n    }\n\n    auto data = Json::parse(jsonFile, nullptr, false);\n    if (data.is_discarded())\n    {\n        log<level::ERR>(\"Entity association JSON parser failure\");\n        elog<InternalFailure>();\n    }\n\n    return data;\n}\n\nstd::string read(const std::string& type, uint8_t instance, const Json& config)\n{\n    static const std::vector<Json> empty{};\n    std::vector<Json> readings = config.value(type, empty);\n    std::string name = \"\";\n    for (const auto& j : readings)\n    {\n        uint8_t instanceNum = j.value(\"instance\", 0);\n        \/\/ Not the instance we're interested in\n        if (instanceNum != instance)\n        {\n            continue;\n        }\n\n        \/\/ Found the instance we're interested in\n        name = j.value(\"name\", \"\");\n\n        break;\n    }\n    return name;\n}\n\n} \/\/ namespace\n\nstruct GetEntityNameRequest\n{\n    uint8_t subcommand;\n    uint8_t entity_id;\n    uint8_t entity_instance;\n} __attribute__((packed));\n\nstruct GetEntityNameReply\n{\n    uint8_t subcommand;\n    uint8_t entity_name_len;\n    uint8_t entity_name[0];\n} __attribute__((packed));\n\nipmi_ret_t GetEntityName(const uint8_t* reqBuf, uint8_t* replyBuf,\n                         size_t* dataLen)\n{\n    struct GetEntityNameRequest request;\n\n    if ((*dataLen) < sizeof(request))\n    {\n        std::fprintf(stderr, \"Invalid command length: %u\\n\",\n                     static_cast<uint32_t>(*dataLen));\n        return IPMI_CC_REQ_DATA_LEN_INVALID;\n    }\n\n    std::memcpy(&request, &reqBuf[0], sizeof(request));\n\n    \/\/ Check if we support this Entity ID.\n    auto it = entityIdToName.find(request.entity_id);\n    if (it == entityIdToName.end())\n    {\n        log<level::ERR>(\"Unknown Entity ID\",\n                        entry(\"ENTITY_ID=%d\", request.entity_id));\n        return IPMI_CC_INVALID_FIELD_REQUEST;\n    }\n\n    static Json config{};\n    static bool parsed = false;\n\n    std::string entityName;\n    try\n    {\n        \/\/ Parse the JSON config file.\n        if (!parsed)\n        {\n            config = parse_config();\n            parsed = true;\n        }\n\n        \/\/ Find the \"entity id:entity instance\" mapping to entity name.\n        entityName = read(it->second, request.entity_instance, config);\n        if (entityName.empty())\n            return IPMI_CC_INVALID_FIELD_REQUEST;\n    }\n    catch (InternalFailure& e)\n    {\n        return IPMI_CC_UNSPECIFIED_ERROR;\n    }\n\n    int length = sizeof(struct GetEntityNameReply) + entityName.length();\n\n    \/\/ TODO (jaghu) : Add a call to get getChannelMaxTransferSize.\n    if (length > MAX_IPMI_BUFFER)\n    {\n        std::fprintf(stderr, \"Response would overflow response buffer\\n\");\n        return IPMI_CC_INVALID;\n    }\n\n    auto reply = reinterpret_cast<struct GetEntityNameReply*>(&replyBuf[0]);\n    reply->subcommand = SysEntityName;\n    reply->entity_name_len = entityName.length();\n    std::memcpy(reply->entity_name, entityName.c_str(), entityName.length());\n\n    (*dataLen) = length;\n    return IPMI_CC_OK;\n}\n} \/\/ namespace ipmi\n} \/\/ namespace google\n<|endoftext|>"}
{"text":"<commit_before>#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/core.hpp>\n#include <opencv2\/highgui.hpp>\n#include <opencv2\/opencv.hpp>\n#include \"opencv2\/nonfree\/nonfree.hpp\"\n#include \"opencv2\/features2d\/features2d.hpp\"\n#include \"opencv2\/nonfree\/features2d.hpp\"\n#include \"opencv2\/calib3d\/calib3d.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include <opencv2\/legacy\/legacy.hpp>\n\n#include <math.h>\n#include <iostream>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <fstream>\n\n\/\/--------------------- Classes ---------------------\n\nclass Opt_flow {\n  private:\n    cv::VideoCapture video;\n    cv::String filename;\n    cv::Mat frame;\n    cv::Mat opt_flow,flow_mask;\n    cv::Mat prev_frame,next_frame;\n    cv::Mat x_vals,y_vals;\n    std::vector<float> vel_x;\n    std::vector<float> vel_y;\n    float std_error;\n    cv::Vec3b frame_intensity,next_frame_intensity;\n    float errors;\n    int counter;\n    CvSize win_size;\n    int step,interval_pixels,tam_vel;\n    int kernel_size;\n    int threshold,ratio;\n\n\n  public:\n\n    Opt_flow(cv::VideoCapture video_ , cv::String filename_) {\n      cv::namedWindow(\"Video\");\n      cv::namedWindow(\"OPT_FLOW\");\n      \/\/cv::namedWindow(\"OPT_FLOW-X\");\n      \/\/cv::namedWindow(\"OPT_FLOW-Y\");\n      video=video_;\n      filename=filename_;\n      std_error=80;\n      counter=0;\n      std_error=(std_error\/100);\n      win_size.height=3;\n      win_size.width=3;\n      kernel_size=3;\n      interval_pixels=2;\n      tam_vel=1;\n      step=5;\n      threshold=2;\n      ratio=1;\n\n      video.open(filename);\n    }\n\n    ~Opt_flow(){\n      cv::destroyWindow(\"Video\");\n      \/\/cv::destroyWindow(\"OPT_FLOW-X\");\n      \/\/cv::destroyWindow(\"OPT_FLOW-Y\");\n      cv::destroyWindow(\"OPT_FLOW\");\n    }\n\n    void play(){\n      int i=0;\n      while (char(cv::waitKey(1))!='q'&&video.isOpened()){\n        video >> frame;\n\n        if (i==0){\n          cv::cvtColor(frame,prev_frame,cv::COLOR_BGR2GRAY);\n          cv::GaussianBlur(prev_frame,prev_frame,cv::Size(kernel_size,kernel_size) ,0,0,cv::BORDER_DEFAULT);\n        }\n\n        if(i!=0&&i%step==0){\n          cv::cvtColor(frame,next_frame,cv::COLOR_BGR2GRAY);\n          cv::GaussianBlur(next_frame,next_frame,cv::Size(kernel_size,kernel_size) ,0,0,cv::BORDER_DEFAULT);\n\n          \/\/std::cout << \"PREV_FRAME:\" << prev_frame.size() << '|' << prev_frame.channels() << '\\n';\n          \/\/std::cout << \"NEXT_FRAME:\" << next_frame.size() << '|' << next_frame.channels() << '\\n';\n          \/\/getchar();\n\n          cv::calcOpticalFlowFarneback(prev_frame, next_frame, opt_flow, .5, 3, 15, 3, 5, 1.2, 0);\n          draw_flow(opt_flow,frame);\n\n          get_xvals(opt_flow);\n          get_yvals(opt_flow);\n          generate_flowmask(x_vals,y_vals);\n          cv::GaussianBlur(flow_mask,flow_mask,cv::Size(kernel_size,kernel_size) ,0,0,cv::BORDER_DEFAULT);\n          cv::threshold(flow_mask,flow_mask,threshold, threshold*ratio,cv::THRESH_BINARY);\n\n          show_frame();\n\n          prev_frame=next_frame.clone();\n        }\n\n        std::cout << \"i = \" << i << '\\n';\n        i++;\n      }\n    }\n\n    void show_frame(){\n      cv::imshow(\"Video\",frame);\n      cv::imshow(\"OPT_FLOW\",flow_mask);\n    }\n\n\n    void background_extr(){\n      int i,j,aux_error;\n\n      for(i=0;i<(frame.rows)-1;i++){\n        for(j=0;j<(frame.cols)-1;j++){\n          counter++;\n\n          frame_intensity = frame.at<uint>(i,j);\n          next_frame_intensity = next_frame.at<uint>(i,j);\n\n          if (next_frame_intensity.val[0]==0){\n            next_frame_intensity.val[0]=1;\n          }\n          errors=frame_intensity.val[0]\/next_frame_intensity.val[0];\n\n          if(errors<1-std_error||errors>1+std_error){\n            opt_flow.at<uint>(i,j)=255;\n            \/\/std::cout << \"MUDOU O PIXEL\" << '\\n';\n          }\n        }\n      }\n      \/\/std::cout << \"TROCOU FRAME\" << '\\n';\n\n    }\n\n    void blackfy(cv::Mat input){\n      for(int i=0;i<input.rows;i++){\n        for(int j=0;j<input.cols;j++){\n          input.at<uint>(i,j)=0;\n          \/\/std::cout << \"(\" << i << \",\" << j << \")\" << '\\n';\n        }\n      }\n    }\n\n    void draw_flow(cv::Mat input, cv::Mat output){\n      for (int y = 0; y < output.rows; y += interval_pixels) {\n          for (int x = 0; x < output.cols; x += interval_pixels)\n          {\n              const cv::Point2f flowatxy = input.at<cv::Point2f>(y, x) * tam_vel;\n              cv::line(output, cv::Point(x, y), cv::Point(cvRound(x + flowatxy.x), cvRound(y + flowatxy.y)), cv::Scalar(255, 0, 0));\n              cv::circle(output, cv::Point(x, y), 1, cv::Scalar(0, 0, 0), -1);\n          }\n      }\n    }\n\n    void get_xvals(cv::Mat input){\n      x_vals=cv::Mat::zeros(input.rows,input.cols, CV_32F);\n\n      for (int i=0;i<input.rows;i++){\n        for(int j=0;j<input.cols;j++){\n          \/\/std::cout << \"X_VALS:\" << x_vals.size() << '|' << x_vals.channels() << '|' << x_vals.type() << '\\n';\n\n          x_vals.at<float>(i,j)=input.at<cv::Point2f>(i,j).x;\n        }\n      }\n    }\n\n    void get_yvals(cv::Mat input){\n      y_vals=cv::Mat::zeros(input.rows,input.cols, CV_32F);\n\n      for (int i=0;i<input.rows;i++){\n        for(int j=0;j<input.cols;j++){\n          \/\/std::cout << \"Y_VALS:\" << y_vals.size() << '|' << y_vals.channels() << '|' << y_vals.type() << '\\n';\n\n          y_vals.at<float>(i,j)=input.at<cv::Point2f>(i,j).y;\n        }\n      }\n    }\n\n    void generate_flowmask(cv::Mat x_matrix,cv::Mat y_matrix) {\n\n      flow_mask=cv::Mat::zeros(x_matrix.rows,x_matrix.cols, CV_32F);\n\n      for (int i=0;i<x_matrix.rows;i++){\n        for(int j=0;j<x_matrix.cols;j++){\n          flow_mask.at<float>(i,j)=magnitude(x_matrix.at<float>(i,j), y_matrix.at<float>(i,j));\n        }\n      }\n    }\n\n    float magnitude(float a, float b){\n      float mag;\n\n      mag=sqrt((a*a)+(b*b));\n\n      return(mag);\n    }\n};\n\n\n\n\n\n\/\/--------------------- Global Variables ---------------------\n\n\/\/--------------------- Main Function ---------------------\n\nint main(int argc, char *argv[]){\n  cv::String filename;\n  cv::VideoCapture video;\n\n  if (argc<=1){\n    std::cout << \"\\n\\nThere was no input video to run.\\nPress ENTER to quit.\\n>>\";\n    getchar();\n    return(-1);\n  }\n\n  filename=argv[1];\n\n  Opt_flow opt_flow(video,filename);\n  opt_flow.play();\n\n  return(0);\n}\n<commit_msg>Find contour and mass center (beta)<commit_after>#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/core.hpp>\n#include <opencv2\/highgui.hpp>\n#include <opencv2\/opencv.hpp>\n#include \"opencv2\/nonfree\/nonfree.hpp\"\n#include \"opencv2\/features2d\/features2d.hpp\"\n#include \"opencv2\/nonfree\/features2d.hpp\"\n#include \"opencv2\/calib3d\/calib3d.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include <opencv2\/legacy\/legacy.hpp>\n\n#include <math.h>\n#include <iostream>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <fstream>\n\n\/\/--------------------- Classes ---------------------\n\nclass Opt_flow {\n  private:\n    cv::VideoCapture video;\n    cv::String filename;\n    cv::Mat frame;\n    cv::Mat opt_flow,flow_mask;\n    cv::Mat prev_frame,next_frame;\n    cv::Mat x_vals,y_vals;\n    std::vector<float> vel_x;\n    std::vector<float> vel_y;\n    float std_error;\n    cv::Vec3b frame_intensity,next_frame_intensity;\n    float errors;\n    int counter;\n    CvSize win_size;\n    int step,interval_pixels,tam_vel;\n    int kernel_size;\n    int threshold,ratio;\n    std::vector<cv::Vec4i> hierarchy;\n    std::vector<std::vector<cv::Point> > contours;\n\n\n  public:\n\n    Opt_flow(cv::VideoCapture video_ , cv::String filename_) {\n      cv::namedWindow(\"Video\");\n      cv::namedWindow(\"OPT_FLOW\");\n      \/\/cv::namedWindow(\"OPT_FLOW-X\");\n      \/\/cv::namedWindow(\"OPT_FLOW-Y\");\n      video=video_;\n      filename=filename_;\n      std_error=80;\n      counter=0;\n      std_error=(std_error\/100);\n      win_size.height=3;\n      win_size.width=3;\n      kernel_size=3;\n      interval_pixels=2;\n      tam_vel=1;\n      step=5;\n      threshold=2;\n      ratio=1;\n\n      video.open(filename);\n    }\n\n    ~Opt_flow(){\n      cv::destroyWindow(\"Video\");\n      \/\/cv::destroyWindow(\"OPT_FLOW-X\");\n      \/\/cv::destroyWindow(\"OPT_FLOW-Y\");\n      cv::destroyWindow(\"OPT_FLOW\");\n    }\n\n    void play(){\n      int i=0;\n      while (char(cv::waitKey(1))!='q'&&video.isOpened()){\n        video >> frame;\n\n        if (i==0){\n          cv::cvtColor(frame,prev_frame,cv::COLOR_BGR2GRAY);\n          cv::GaussianBlur(prev_frame,prev_frame,cv::Size(kernel_size,kernel_size) ,0,0,cv::BORDER_DEFAULT);\n        }\n\n        if(i!=0&&i%step==0){\n          cv::cvtColor(frame,next_frame,cv::COLOR_BGR2GRAY);\n          cv::GaussianBlur(next_frame,next_frame,cv::Size(kernel_size,kernel_size) ,0,0,cv::BORDER_DEFAULT);\n\n          \/\/std::cout << \"PREV_FRAME:\" << prev_frame.size() << '|' << prev_frame.channels() << '\\n';\n          \/\/std::cout << \"NEXT_FRAME:\" << next_frame.size() << '|' << next_frame.channels() << '\\n';\n          \/\/getchar();\n\n          cv::calcOpticalFlowFarneback(prev_frame, next_frame, opt_flow, .5, 3, 15, 3, 5, 1.2, 0);\n          draw_flow(opt_flow,frame);\n\n          get_xvals(opt_flow);\n          get_yvals(opt_flow);\n          generate_flowmask(x_vals,y_vals);\n          cv::GaussianBlur(flow_mask,flow_mask,cv::Size(kernel_size,kernel_size) ,0,0,cv::BORDER_DEFAULT);\n          cv::threshold(flow_mask,flow_mask,threshold, threshold*ratio,cv::THRESH_BINARY);\n          cv::findContours(flow_mask,contours, hierarchy, CV_RETR_EXTERNAL,CV_CHAIN_APPROX_NONE);\n          get_mass_centers(flow_mask);\n          show_frame();\n\n          prev_frame=next_frame.clone();\n        }\n\n        std::cout << \"i = \" << i << '\\n';\n        i++;\n      }\n    }\n\n    void show_frame(){\n      cv::imshow(\"Video\",frame);\n      cv::imshow(\"OPT_FLOW\",flow_mask);\n    }\n\n    void background_extr(){\n      int i,j,aux_error;\n\n      for(i=0;i<(frame.rows)-1;i++){\n        for(j=0;j<(frame.cols)-1;j++){\n          counter++;\n\n          frame_intensity = frame.at<uint>(i,j);\n          next_frame_intensity = next_frame.at<uint>(i,j);\n\n          if (next_frame_intensity.val[0]==0){\n            next_frame_intensity.val[0]=1;\n          }\n          errors=frame_intensity.val[0]\/next_frame_intensity.val[0];\n\n          if(errors<1-std_error||errors>1+std_error){\n            opt_flow.at<uint>(i,j)=255;\n            \/\/std::cout << \"MUDOU O PIXEL\" << '\\n';\n          }\n        }\n      }\n      \/\/std::cout << \"TROCOU FRAME\" << '\\n';\n\n    }\n\n    void blackfy(cv::Mat input){\n      for(int i=0;i<input.rows;i++){\n        for(int j=0;j<input.cols;j++){\n          input.at<uint>(i,j)=0;\n          \/\/std::cout << \"(\" << i << \",\" << j << \")\" << '\\n';\n        }\n      }\n    }\n\n    void draw_flow(cv::Mat input, cv::Mat output){\n      for (int y = 0; y < output.rows; y += interval_pixels) {\n          for (int x = 0; x < output.cols; x += interval_pixels)\n          {\n              const cv::Point2f flowatxy = input.at<cv::Point2f>(y, x) * tam_vel;\n              cv::line(output, cv::Point(x, y), cv::Point(cvRound(x + flowatxy.x), cvRound(y + flowatxy.y)), cv::Scalar(255, 0, 0));\n              cv::circle(output, cv::Point(x, y), 1, cv::Scalar(0, 0, 0), -1);\n          }\n      }\n    }\n\n    void get_xvals(cv::Mat input){\n      x_vals=cv::Mat::zeros(input.rows,input.cols, CV_32F);\n\n      for (int i=0;i<input.rows;i++){\n        for(int j=0;j<input.cols;j++){\n          \/\/std::cout << \"X_VALS:\" << x_vals.size() << '|' << x_vals.channels() << '|' << x_vals.type() << '\\n';\n\n          x_vals.at<float>(i,j)=input.at<cv::Point2f>(i,j).x;\n        }\n      }\n    }\n\n    void get_yvals(cv::Mat input){\n      y_vals=cv::Mat::zeros(input.rows,input.cols, CV_32F);\n\n      for (int i=0;i<input.rows;i++){\n        for(int j=0;j<input.cols;j++){\n          \/\/std::cout << \"Y_VALS:\" << y_vals.size() << '|' << y_vals.channels() << '|' << y_vals.type() << '\\n';\n\n          y_vals.at<float>(i,j)=input.at<cv::Point2f>(i,j).y;\n        }\n      }\n    }\n\n    void generate_flowmask(cv::Mat x_matrix,cv::Mat y_matrix) {\n\n      flow_mask=cv::Mat::zeros(x_matrix.rows,x_matrix.cols, CV_32F);\n\n      for (int i=0;i<x_matrix.rows;i++){\n        for(int j=0;j<x_matrix.cols;j++){\n          flow_mask.at<float>(i,j)=magnitude(x_matrix.at<float>(i,j), y_matrix.at<float>(i,j));\n        }\n      }\n    }\n\n    float magnitude(float a, float b){\n      float mag;\n\n      mag=sqrt((a*a)+(b*b));\n\n      return(mag);\n    }\n\n    void get_mass_centers(cv::Mat input){\n      vector<Moments> moments(contours.size());\n\n      for(int i=0;i<contours.size();i++){\n        moments[i] = moments(contours[i],false);\n      }\n\n      vector<Point2f> mass(contours.size());\n      for(int i=0;i<contours.size();i++){\n        mass[i] = Point2f(mu[i].m10\/mu[i].m00,mu[i].m01\/mu[i].m00);\n      }\n\n      draw_mass_centers(input);\n    }\n\n    void draw_mass_centers(cv::Mat input){\n      for(int i=0;i<mass.size();i++){\n        input.at<float>(mass[i].x,mass[j].y)=cv::Scalar(0,255,0);\n      }\n    }\n};\n\nclass Moments {\n  public:\n      Moments();\n      Moments(double m00, double m10, double m01, double m20, double m11,\n              double m02, double m30, double m21, double m12, double m03 );\n      Moments( const CvMoments& moments );\n      operator CvMoments() const;\n\n      \/\/ spatial moments\n      double  m00, m10, m01, m20, m11, m02, m30, m21, m12, m03;\n      \/\/ central moments\n      double  mu20, mu11, mu02, mu30, mu21, mu12, mu03;\n      \/\/ central normalized moments\n      double  nu20, nu11, nu02, nu30, nu21, nu12, nu03;\n};\n\n\/\/--------------------- Global Variables ---------------------\n\n\/\/--------------------- Main Function ---------------------\n\nint main(int argc, char *argv[]){\n  cv::String filename;\n  cv::VideoCapture video;\n\n  if (argc<=1){\n    std::cout << \"\\n\\nThere was no input video to run.\\nPress ENTER to quit.\\n>>\";\n    getchar();\n    return(-1);\n  }\n\n  filename=argv[1];\n\n  Opt_flow opt_flow(video,filename);\n  opt_flow.play();\n\n  return(0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* --Sparse Optical Flow Demo Program--\n * Updated based on code written by David Stavens (dstavens@robotics.stanford.edu)\n *\/\n\n#include \"opencv2\/opencv.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n\nusing namespace std;\nusing namespace cv;\n\n\/* This is just an inline that allocates images. I did this to reduce clutter in the\n * actual computer vision algorithmic code. Basically it allocates the requested image\n * unless that image is already non-NULL. It always leaves a non-NULL image as-is even\n * if that image's size, depth, and\/or channels are different than the request.\n *\/\ninline static void allocateOnDemand( Mat **img, Size size, int depth, int channels)\n{\n    if ( *img != NULL ) return;\n   \/\/ *img.create( size, depth, channels );\n    if ( *img == NULL )\n    {\n        fprintf(stderr, \"Error: Couldn't allocate image. Out of memory?\\n\");\n        exit(-1);\n    }\n}\n\nint main( int argc, char** argv )\n{\n    const string filename=argv[1];\n    Mat frameForProperties;\n    \n    \/\/Open the input video\n    \/\/changed CvCapture to VideoCapture\n    VideoCapture input_video(filename);\n    \n    \/\/Check to make sure video exists and is in a OpenCV compatible format\n    if(!input_video.isOpened()) {\n        cout << \"Cannot open file. Check path and format\" << endl;\n        return -1;\n    }\n    \/\/old hack to get video properties, not sure if still needed\n    \/\/changed cvQueryFrame to input_video.read\n    input_video.read(frameForProperties);\n    \n    \/* Read the video's frame size out of the AVI. *\/\n    \/\/changed CvSize to Size, changed cvGetCaptureProperty to input_video.get\n    Size frame_size;\n    frame_size.height=(int)input_video.get(CAP_PROP_FRAME_HEIGHT);\n    frame_size.width =(int)input_video.get(CAP_PROP_FRAME_WIDTH );\n    \n    \/* Determine the number of frames in the AVI. *\/\n    long number_of_frames;\n    \n    \/* Go to the end of the AVI (ie: the fraction is \"1\") *\/\n    \/\/changed cvSetCaptureProperty to input_video.set\n    input_video.set(CAP_PROP_POS_AVI_RATIO, 1. );\n    \n    \/* Now that we're at the end, read the AVI position in frames *\/\n    \/\/changed cvCaptureProperty to input_video.get\n    number_of_frames = (int) input_video.get(CAP_PROP_POS_FRAMES );\n    \n    \/* Return to the beginning *\/\n    \/\/changed cvSetCaptureProperty to input_video.set\n    input_video.set(CAP_PROP_POS_FRAMES, 0. );\n    \n    \n    \/\/Set up windows to display output\n    \/\/changed cvNamedWindow to namedWindow\n    namedWindow(\"Optical Flow\", WINDOW_AUTOSIZE);\n    long current_frame=0;\n    \n    while(true) {\n        \/\/changed IplImage to Mat\n        static Mat *frame = NULL, *frame1 = NULL, *frame1_1C = NULL, *frame2_1C =\n        NULL, *eig_image = NULL, *temp_image = NULL, *pyramid1 = NULL, *pyramid2 = NULL;\n        \n        \/* Go to the frame we want. Important if multiple frames are queried in\n         * the loop which they of course are for optical flow. Note that the very\n         * first call to this is actually not needed. (Because the correct position\n         * is set outsite the for() loop.)\n         *\/\n        \/\/changed cvSetCapture Property to input_video.set\n        input_video.set(CAP_PROP_POS_FRAMES, current_frame );\n        \n        \/* Get the next frame of the video.*\/\n        \/\/changed cvQueryFrame to input_video >> *frame\n        input_video >> *frame;\n        if (frame == NULL) {\n            \/* Why did we get a NULL frame? We shouldn't be at the end. *\/\n            cout << \"Error: Hmm. The end came sooner than we thought\" << endl;\n            return -1;\n        }\n        \/* Allocate another image if not already allocated.\n         * Image has ONE challenge of color (ie: monochrome) with 8-bit \"color\" depth.\n         * This is the image format OpenCV algorithms actually operate on (mostly).\n         *\/\n        allocateOnDemand( &frame1_1C, frame_size, CV_8U, 1 );\n    \n    }\n        return 0;\n    \n}<commit_msg>with more code from the stanford site converted to cpp<commit_after>\/* --Sparse Optical Flow Demo Program--\n * Updated based on code written by David Stavens (dstavens@robotics.stanford.edu)\n * http:\/\/robots.stanford.edu\/cs223b05\/notes\/CS%20223-B%20T1%20stavens_opencv_optical_flow.pdf\n *\/\n\n#include \"opencv2\/opencv.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n\nusing namespace std;\nusing namespace cv;\n\n\/* This is just an inline that allocates images. I did this to reduce clutter in the\n * actual computer vision algorithmic code. Basically it allocates the requested image\n * unless that image is already non-NULL. It always leaves a non-NULL image as-is even\n * if that image's size, depth, and\/or channels are different than the request.\n *\/\ninline static void allocateOnDemand( Mat **img, Size size, int depth, int channels)\n{\n    if ( *img != NULL ) return;\n    \/\/*img=create( size, depth, channels );\n    if ( *img == NULL )\n    {\n        fprintf(stderr, \"Error: Couldn't allocate image. Out of memory?\\n\");\n        exit(-1);\n    }\n}\n\nint main( int argc, char** argv )\n{\n    const string filename=argv[1];\n    Mat frameForProperties;\n    \n    \/\/Open the input video\n    \/\/changed CvCapture to VideoCapture\n    VideoCapture input_video(filename);\n    \n    \/\/Check to make sure video exists and is in a OpenCV compatible format\n    if(!input_video.isOpened()) {\n        cout << \"Cannot open file. Check path and format\" << endl;\n        return -1;\n    }\n    \/\/old hack to get video properties, not sure if still needed\n    \/\/changed cvQueryFrame to input_video.read\n    input_video.read(frameForProperties);\n    \n    \/* Read the video's frame size out of the AVI. *\/\n    \/\/changed CvSize to Size, changed cvGetCaptureProperty to input_video.get\n    Size frame_size;\n    frame_size.height=(int)input_video.get(CAP_PROP_FRAME_HEIGHT);\n    frame_size.width =(int)input_video.get(CAP_PROP_FRAME_WIDTH );\n    \n    \/* Determine the number of frames in the AVI. *\/\n    long number_of_frames;\n    \n    \/* Go to the end of the AVI (ie: the fraction is \"1\") *\/\n    \/\/changed cvSetCaptureProperty to input_video.set\n    input_video.set(CAP_PROP_POS_AVI_RATIO, 1. );\n    \n    \/* Now that we're at the end, read the AVI position in frames *\/\n    \/\/changed cvCaptureProperty to input_video.get\n    number_of_frames = (int) input_video.get(CAP_PROP_POS_FRAMES );\n    \n    \/* Return to the beginning *\/\n    \/\/changed cvSetCaptureProperty to input_video.set\n    input_video.set(CAP_PROP_POS_FRAMES, 0. );\n    \n    \n    \/\/Set up windows to display output\n    \/\/changed cvNamedWindow to namedWindow\n    namedWindow(\"Optical Flow\", WINDOW_AUTOSIZE);\n    long current_frame=0;\n    \n    while(true) {\n        \/\/changed IplImage to Mat\n        static Mat *frame = NULL, *frame1 = NULL, *frame1_1C = NULL, *frame2_1C =\n        NULL, *eig_image = NULL, *temp_image = NULL, *pyramid1 = NULL, *pyramid2 = NULL;\n        \n        \/* Go to the frame we want. Important if multiple frames are queried in\n         * the loop which they of course are for optical flow. Note that the very\n         * first call to this is actually not needed. (Because the correct position\n         * is set outsite the for() loop.)\n         *\/\n        \/\/changed cvSetCapture Property to input_video.set\n        input_video.set(CAP_PROP_POS_FRAMES, current_frame );\n        \n        \/* Get the next frame of the video.*\/\n        \/\/changed cvQueryFrame to input_video >> *frame\n        input_video >> *frame;\n        if (frame == NULL) {\n            \/* Why did we get a NULL frame? We shouldn't be at the end. *\/\n            cout << \"Error: Hmm. The end came sooner than we thought\" << endl;\n            return -1;\n        }\n        \/* Allocate another image if not already allocated.\n         * Image has ONE challenge of color (ie: monochrome) with 8-bit \"color\" depth.\n         * This is the image format OpenCV algorithms actually operate on (mostly).\n         *\/\n        \/\/probably take out allocate on demand in favor of making a Mat image with constructor\n        \/\/allocateOnDemand( &frame1_1C, frame_size, CV_8U, 1 );\n        frame1_1C->create(frame_size, CV_8U);\n        \/* Convert whatever the AVI image format is into OpenCV's preferred format.\n         * AND flip the image vertically. Flip is a shameless hack. OpenCV reads\n         * in AVIs upside-down by default. (No comment :-))\n         *\/\n        \n        \/\/change cvConvertImage to flip\n        cv::flip(*frame, *frame1_1C, 0);\n        \n        \/* We'll make a full color backup of this frame so that we can draw on it.\n         * (It's not the best idea to draw on the static memory space of cvQueryFrame().)\n         *\/\n        frame1->create(frame_size, CV_8U);\n        cv::flip(*frame, *frame1, 0);\n        \n        \/* Get the second frame of video. Sample principles as the first. *\/\n        \/\/changed cvQueryFrame to input_video >> *frame, followed frame1_1C procedure\n        input_video >> *frame;\n        if (frame == NULL)\n        {\n            fprintf(stderr, \"Error: Hmm. The end came sooner than we thought.\\n\");\n            return -1;\n        }\n        frame2_1C->create(frame_size, CV_8U );\n        cv::flip(*frame, *frame2_1C, 0);\n        \n        \/* Shi and Tomasi Feature Tracking! *\/\n        \/* Preparation: Allocate the necessary storage. *\/\n        \/\/change allocateOnDemand to ->create\n        eig_image->create(frame_size, CV_32F);\n        temp_image->create( frame_size, CV_32F);\n        \n        \/* Preparation: This array will contain the features found in frame 1. *\/\n        Point frame1_features[400];\n        \n        \/* Preparation: BEFORE the function call this variable is the array size\n         * (or the maximum number of features to find). AFTER the function call\n         * this variable is the number of features actually found.\n         *\/\n        int number_of_features;\n        \n        \/* I'm hardcoding this at 400. But you should make this a #define so that you can\n         * change the number of features you use for an accuracy\/speed tradeoff analysis.\n         *\/\n        number_of_features = 400;\n        \n        \/* Actually run the Shi and Tomasi algorithm!!\n         * \"frame1_1C\" is the input image.\n         * \"eig_image\" and \"temp_image\" are just workspace for the algorithm.\n         * The first \".01\" specifies the minimum quality of the features (based on the\n         eigenvalues).\n         * The second \".01\" specifies the minimum Euclidean distance between features.\n         * \"NULL\" means use the entire input image. You could point to a part of the\n         image.\n         * WHEN THE ALGORITHM RETURNS:\n         * \"frame1_features\" will contain the feature points.\n         * \"number_of_features\" will be set to a value <= 400 indicating the number of\n         feature points found.\n         *\/\n        goodFeaturesToTrack(frame1_1C, frame1_features, number_of_features, .01, .01);\n        \n        \/* Pyramidal Lucas Kanade Optical Flow! *\/\n        \/* This array will contain the locations of the points from frame 1 in frame 2. *\/\n        Point frame2_features[400];\n        \n        \/* The i-th element of this array will be non-zero if and only if the i-th feature\n         of\n         * frame 1 was found in frame 2.\n         *\/\n        char optical_flow_found_feature[400];\n        \n        \/* The i-th element of this array is the error in the optical flow for the i-th\n         feature\n         * of frame1 as found in frame 2. If the i-th feature was not found (see the\n         array above)\n         * I think the i-th entry in this array is undefined.\n         *\/\n        float optical_flow_feature_error[400];\n        \n        \/* This is the window size to use to avoid the aperture problem (see slide\n         \"Optical Flow: Overview\"). *\/\n        Size optical_flow_window = Size(3,3);\n        \n        \/* This termination criteria tells the algorithm to stop when it has either done\n         20 iterations or when\n         * epsilon is better than .3. You can play with these parameters for speed vs.\n         accuracy but these values\n         * work pretty well in many situations.\n         *\/\n        TermCriteria optical_flow_termination_criteria\n        = cvTermCriteria( CV_TERMCRIT_ITER | CV_TERMCRIT_EPS, 20, .3 );\n        \n    }\n        return 0;\n    \n}<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2014-2019 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\/hdf5\/hdf5utils.h>\n\nnamespace inviwo {\n\nnamespace hdf5 {\n\nPaths findpaths(const H5::Group& grp, const Path& path, const std::string& type) {\n    Paths paths;\n\n    if (isOfType(grp, type)) {\n        paths.push_back(path);\n    } else {\n        for (hsize_t i = 0; i < grp.getNumObjs(); i++) {\n            std::string childName = grp.getObjnameByIdx(i);\n            if (grp.getObjTypeByIdx(i) == H5G_GROUP) {\n                H5::Group child = grp.openGroup(childName);\n                Paths newpaths = findpaths(child, path + childName, type);\n                paths.insert(paths.end(), newpaths.begin(), newpaths.end());\n            }\n        }\n    }\n    return paths;\n}\n\nVolumeInfos getVolumeInfo(const H5::DataSet& ds, const Path& path) {\n    auto size = std::make_unique<hsize_t[]>(ds.getSpace().getSimpleExtentNdims());\n    ds.getSpace().getSimpleExtentDims(size.get());\n    int sub_densities = (int)size[0];\n\n    VolumeInfos paths;\n\n    for (int i = 0; i < sub_densities; i++) {\n        VolumeInfo info;\n        info.path_ = path;\n        info.index_ = i;\n        info.dim_.x = size[1];\n        info.dim_.y = size[2];\n        info.dim_.z = size[3];\n\n        paths.push_back(info);\n    }\n\n    return paths;\n}\n\nbool isOfType(const H5::Group& grp, const std::string& type) {\n    bool result = false;\n    try {\n        if (grp.attrExists(\"type\")) {\n            H5::Attribute attr = grp.openAttribute(\"type\");\n            H5::DataType dt = attr.getDataType();\n\n            if (dt.getClass() == H5T_STRING && dt.isVariableStr()) {\n                H5std_string val;\n                attr.read(dt, val);\n                if (val == type) {\n                    result = true;\n                }\n            }\n            dt.close();\n            attr.close();\n        }\n    } catch (const H5::AttributeIException& error) {\n    }\n    return result;\n}\n\n}  \/\/ namespace hdf5\n\n}  \/\/ namespace inviwo\n<commit_msg>HDF5: warning fix<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2014-2019 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\/hdf5\/hdf5utils.h>\n\nnamespace inviwo {\n\nnamespace hdf5 {\n\nPaths findpaths(const H5::Group& grp, const Path& path, const std::string& type) {\n    Paths paths;\n\n    if (isOfType(grp, type)) {\n        paths.push_back(path);\n    } else {\n        for (hsize_t i = 0; i < grp.getNumObjs(); i++) {\n            std::string childName = grp.getObjnameByIdx(i);\n            if (grp.getObjTypeByIdx(i) == H5G_GROUP) {\n                H5::Group child = grp.openGroup(childName);\n                Paths newpaths = findpaths(child, path + childName, type);\n                paths.insert(paths.end(), newpaths.begin(), newpaths.end());\n            }\n        }\n    }\n    return paths;\n}\n\nVolumeInfos getVolumeInfo(const H5::DataSet& ds, const Path& path) {\n    auto size = std::make_unique<hsize_t[]>(ds.getSpace().getSimpleExtentNdims());\n    ds.getSpace().getSimpleExtentDims(size.get());\n    int sub_densities = (int)size[0];\n\n    VolumeInfos paths;\n\n    for (int i = 0; i < sub_densities; i++) {\n        VolumeInfo info;\n        info.path_ = path;\n        info.index_ = i;\n        info.dim_.x = size[1];\n        info.dim_.y = size[2];\n        info.dim_.z = size[3];\n\n        paths.push_back(info);\n    }\n\n    return paths;\n}\n\nbool isOfType(const H5::Group& grp, const std::string& type) {\n    bool result = false;\n    try {\n        if (grp.attrExists(\"type\")) {\n            H5::Attribute attr = grp.openAttribute(\"type\");\n            H5::DataType dt = attr.getDataType();\n\n            if (dt.getClass() == H5T_STRING && dt.isVariableStr()) {\n                H5std_string val;\n                attr.read(dt, val);\n                if (val == type) {\n                    result = true;\n                }\n            }\n            dt.close();\n            attr.close();\n        }\n    } catch (const H5::AttributeIException&) {\n    }\n    return result;\n}\n\n}  \/\/ namespace hdf5\n\n}  \/\/ namespace inviwo\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2014 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 \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq\/tools\/neteq_performance_test.h\"\n#include \"webrtc\/test\/testsupport\/perf_test.h\"\n#include \"webrtc\/typedefs.h\"\n\n\/\/ Disabled on Android since all tests currently fail (webrtc:3770).\n#ifndef WEBRTC_ANDROID\n\n\/\/ Runs a test with 10% packet losses and 10% clock drift, to exercise\n\/\/ both loss concealment and time-stretching code.\nTEST(NetEqPerformanceTest, Run) {\n  const int kSimulationTimeMs = 10000000;\n  const int kLossPeriod = 10;  \/\/ Drop every 10th packet.\n  const double kDriftFactor = 0.1;\n  int64_t runtime = webrtc::test::NetEqPerformanceTest::Run(\n      kSimulationTimeMs, kLossPeriod, kDriftFactor);\n  ASSERT_GT(runtime, 0);\n  webrtc::test::PrintResult(\n      \"neteq_performance\", \"\", \"10_pl_10_drift\", runtime, \"ms\", true);\n}\n\n\/\/ Runs a test with neither packet losses nor clock drift, to put\n\/\/ emphasis on the \"good-weather\" code path, which is presumably much\n\/\/ more lightweight.\nTEST(NetEqPerformanceTest, RunClean) {\n  const int kSimulationTimeMs = 10000000;\n  const int kLossPeriod = 0;  \/\/ No losses.\n  const double kDriftFactor = 0.0;  \/\/ No clock drift.\n  int64_t runtime = webrtc::test::NetEqPerformanceTest::Run(\n      kSimulationTimeMs, kLossPeriod, kDriftFactor);\n  ASSERT_GT(runtime, 0);\n  webrtc::test::PrintResult(\n      \"neteq_performance\", \"\", \"0_pl_0_drift\", runtime, \"ms\", true);\n}\n\n#endif \/\/ !WEBRTC_ANDROID\n<commit_msg>Re-enable neteq_performance_unittest.cc for android.<commit_after>\/*\n *  Copyright (c) 2014 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 \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq\/tools\/neteq_performance_test.h\"\n#include \"webrtc\/test\/testsupport\/perf_test.h\"\n#include \"webrtc\/typedefs.h\"\n\n\/\/ Runs a test with 10% packet losses and 10% clock drift, to exercise\n\/\/ both loss concealment and time-stretching code.\nTEST(NetEqPerformanceTest, Run) {\n  const int kSimulationTimeMs = 10000000;\n  const int kLossPeriod = 10;  \/\/ Drop every 10th packet.\n  const double kDriftFactor = 0.1;\n  int64_t runtime = webrtc::test::NetEqPerformanceTest::Run(\n      kSimulationTimeMs, kLossPeriod, kDriftFactor);\n  ASSERT_GT(runtime, 0);\n  webrtc::test::PrintResult(\n      \"neteq_performance\", \"\", \"10_pl_10_drift\", runtime, \"ms\", true);\n}\n\n\/\/ Runs a test with neither packet losses nor clock drift, to put\n\/\/ emphasis on the \"good-weather\" code path, which is presumably much\n\/\/ more lightweight.\nTEST(NetEqPerformanceTest, RunClean) {\n  const int kSimulationTimeMs = 10000000;\n  const int kLossPeriod = 0;  \/\/ No losses.\n  const double kDriftFactor = 0.0;  \/\/ No clock drift.\n  int64_t runtime = webrtc::test::NetEqPerformanceTest::Run(\n      kSimulationTimeMs, kLossPeriod, kDriftFactor);\n  ASSERT_GT(runtime, 0);\n  webrtc::test::PrintResult(\n      \"neteq_performance\", \"\", \"0_pl_0_drift\", runtime, \"ms\", true);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"p2ppipe.h\"\n#include \"utils.h\"\n#include \"crypto\/sha2.h\"\n\n#include <thread>\n#include <chrono>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/time.h>\n#include <stdio.h>\n\n#ifdef WIN32\n\t#include <winsock2.h>\n\t#include <ws2tcpip.h>\n#else \/\/ WIN32\n\t#include <sys\/socket.h>\n\t#include <netinet\/in.h>\n\t#include <netinet\/tcp.h>\n\t#include <netdb.h>\n\t#include <fcntl.h>\n#endif \/\/ !WIN32\n\nvoid P2PPipe::send_message(const char* command, unsigned char* headerAndData, size_t datalen) {\n\tprepare_message(command, headerAndData, datalen);\n\tmaybe_do_send_bytes((char*)headerAndData, sizeof(struct bitcoin_msg_header) + datalen);\n}\n\nstatic std::string statefulMessages[] = {\"sendheaders\", \"feefilter\" \/*, \"sendcmpct\" - but gets its own processing *\/};\n\nvoid P2PPipe::send_hashed_message(const unsigned char* headerAndData, size_t totallen) {\n\tif (!strncmp(((struct bitcoin_msg_header*)headerAndData)->command, \"version\", strlen(\"version\"))) {\n\t\tstd::vector<unsigned char> message(headerAndData, headerAndData + totallen);\n\t\tbool insert = !statefulMessagesSent.count(\"version\");\n\t\tif (!insert) {\n\t\t\tconst unsigned char* oldMessage = statefulMessagesSent[\"version\"].data();\n\n\t\t\tuint32_t oldMsgLength, newMsgLength;\n\t\t\tmemcpy(&oldMsgLength, &((struct bitcoin_msg_header*)oldMessage   )->length, sizeof(oldMsgLength));\n\t\t\tmemcpy(&newMsgLength, &((struct bitcoin_msg_header*)headerAndData)->length, sizeof(newMsgLength));\n\t\t\tinsert = oldMsgLength != newMsgLength;\n\n\t\t\tif (!insert && le32toh(newMsgLength) >= sizeof(struct bitcoin_version_start)) {\n\t\t\t\tstruct bitcoin_version_start oldVersion, newVersion;\n\t\t\t\tmemcpy(&oldVersion, oldMessage    + sizeof(struct bitcoin_msg_header), sizeof(oldVersion));\n\t\t\t\tmemcpy(&newVersion, headerAndData + sizeof(struct bitcoin_msg_header), sizeof(newVersion));\n\n\t\t\t\tinsert = oldVersion.protocol_version != newVersion.protocol_version ||\n\t\t\t\t\t\toldVersion.services != newVersion.services ||\n\t\t\t\t\t\tmemcmp(oldVersion.addr_recv, newVersion.addr_recv, sizeof(oldVersion.addr_recv) - 2) ||\n\t\t\t\t\t\tmemcmp(oldVersion.addr_from, newVersion.addr_from, sizeof(oldVersion.addr_from) - 2) ||\n\t\t\t\t\t\toldVersion.user_agent_length != newVersion.user_agent_length;\n\t\t\t}\n\t\t}\n\n\t\tif (insert) {\n\t\t\tstatefulMessagesSent[\"version\"] = std::move(message);\n\t\t\tdisconnect_from_outside(\"new outbound version\");\n\t\t}\n\t\treturn;\n\t}\n\n\tif (is_connected())\n\t\tmaybe_do_send_bytes((char*)headerAndData, totallen);\n\tassert(totallen >= sizeof(struct bitcoin_msg_header));\n\n\tfor (size_t i = 0; i < sizeof(statefulMessages) \/ sizeof(std::string); i++)\n\t\tif (!strncmp(((struct bitcoin_msg_header*)headerAndData)->command, statefulMessages[i].c_str(), statefulMessages[i].length()))\n\t\t\tstatefulMessagesSent[statefulMessages[i]] = std::vector<unsigned char>(headerAndData, headerAndData + totallen);\n\tif (!strncmp(((struct bitcoin_msg_header*)headerAndData)->command, \"sendcmpct\", strlen(\"sendcmpct\")) &&\n\t\t\ttotallen >= sizeof(struct bitcoin_msg_header) + 9) {\n\t\tuint64_t cmpctVersion;\n\t\tmemcpy(&cmpctVersion, headerAndData + sizeof(struct bitcoin_msg_header) + 1, sizeof(cmpctVersion));\n\t\tcmpctVersion = le64toh(cmpctVersion);\n\t\tstatefulMessagesSent[std::string(\"sendcmpct\") + std::to_string(cmpctVersion)] = std::vector<unsigned char>(headerAndData, headerAndData + totallen);\n\t}\n}\n\nvoid P2PPipe::on_disconnect() {\n\tconnected = 0;\n\tread_msg.reset();\n\tread_pos = 0;\n}\n\nvoid P2PPipe::net_process(const std::function<void(std::string)>& disconnect) {\n\tconnected = 0;\n\n\tif (statefulMessagesSent.count(\"version\")) {\n\t\t\/\/Rehash the message because send_hashed_message has special processing for version messages\n\t\tsend_message(\"version\", statefulMessagesSent[\"version\"].data(), statefulMessagesSent[\"version\"].size() - sizeof(struct bitcoin_msg_header));\n\t} else {\n\t\tstd::vector<unsigned char> version_msg(generate_version());\n\t\tsend_message(\"version\", &version_msg[0], version_msg.size() - sizeof(struct bitcoin_msg_header));\n\t}\n\n\twhile (true) {\n\t\tstruct bitcoin_msg_header header;\n\t\tif (read_all((char*)&header, sizeof(header)) != sizeof(header))\n\t\t\treturn disconnect(\"failed to read message header\");\n\n\t\tif (header.magic != BITCOIN_MAGIC)\n\t\t\treturn disconnect(\"invalid magic bytes\");\n\n\t\theader.length = le32toh(header.length);\n\t\tif (header.length > 5000000)\n\t\t\treturn disconnect(\"got message too large\");\n\n\t\tauto msg = std::make_shared<std::vector<unsigned char> > (sizeof(header) + uint32_t(header.length));\n\t\tmemcpy(msg->data(), &header, sizeof(header));\n\n\t\tbool check_msg_hash = check_block_msghash || (strncmp(header.command, \"block\", strlen(\"block\")) &&\n\t\t\tstrncmp(header.command, \"blocktxn\", strlen(\"blocktxn\")) && strncmp(header.command, \"cmpctblock\", strlen(\"cmpctblock\")));\n\t\tif (check_msg_hash) {\n\t\t\tuint32_t hash[8];\n\t\t\tdouble_sha256_init(hash);\n\n\t\t\tuint32_t steps = header.length \/ 64;\n\t\t\tfor (uint32_t i = 0; i < steps; i++) {\n\t\t\t\tunsigned char* writepos = &((*msg)[sizeof(header) + i*64]);\n\t\t\t\tif (read_all((char*)writepos, 64) != 64)\n\t\t\t\t\treturn disconnect(\"failed to read message\");\n\t\t\t\tdouble_sha256_step(writepos, 64, hash);\n\t\t\t}\n\n\t\t\tunsigned char* writepos = &((*msg)[sizeof(header) + steps*64]);\n\t\t\tif (read_all((char*)writepos, header.length - steps*64) != ssize_t(header.length - steps*64))\n\t\t\t\treturn disconnect(\"failed to read message\");\n\t\t\tdouble_sha256_done(writepos, header.length - steps*64, header.length, hash);\n\n\t\t\tif (memcmp((char*)hash, header.checksum, sizeof(header.checksum)))\n\t\t\t\treturn disconnect(\"got invalid message checksum\");\n\t\t} else\n\t\t\tif (read_all((char*)&(*msg)[sizeof(header)], header.length) != ssize_t(header.length))\n\t\t\t\treturn disconnect(\"failed to read message\");\n\n\t\tif (!strncmp(header.command, \"version\", strlen(\"version\"))) {\n\t\t\tif (connected != 0)\n\t\t\t\treturn disconnect(\"got invalid version\");\n\t\t\tconnected = 1;\n\n\t\t\tif (header.length < sizeof(struct bitcoin_version_start))\n\t\t\t\treturn disconnect(\"got short version\");\n\n\t\t\tstruct bitcoin_version_start their_version;\n\t\t\tmemcpy(&their_version, &(*msg)[sizeof(header)], sizeof(their_version));\n\n\t\t\tstruct bitcoin_msg_header new_header;\n\t\t\tsend_message(\"verack\", (unsigned char*)&new_header, 0);\n\n\t\t\tSTAMPOUT();\n\t\t\tprintf(\"Connected to bitcoind with version %u\\n\", le32toh(their_version.protocol_version));\n\n\t\t\tprovide_msg(*msg);\n\n\t\t\tcontinue;\n\t\t} else if (!strncmp(header.command, \"verack\", strlen(\"verack\"))) {\n\t\t\tif (connected != 1)\n\t\t\t\treturn disconnect(\"got invalid verack\");\n\t\t\tSTAMPOUT();\n\t\t\tprintf(\"Finished connect handshake with bitcoind\\n\");\n\t\t\tconnected = 2;\n\n\t\t\tfor (auto& p : statefulMessagesSent)\n\t\t\t\tif (p.first != \"version\") {\n\t\t\t\t\tstd::string cmpct(\"sendcmpct\");\n\t\t\t\t\tif (!p.first.compare(0, cmpct.length(), cmpct))\n\t\t\t\t\t\tsend_message(\"sendcmpct\", p.second.data(), p.second.size() - sizeof(struct bitcoin_msg_header));\n\t\t\t\t\telse\n\t\t\t\t\t\tsend_message(p.first.c_str(), p.second.data(), p.second.size() - sizeof(struct bitcoin_msg_header));\n\t\t\t\t}\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (connected != 2)\n\t\t\treturn disconnect(\"got non-version, non-verack before version+verack\");\n\n\t\tif (!strncmp(header.command, \"ping\", strlen(\"ping\"))) {\n\t\t\tstd::vector<unsigned char> resp(sizeof(struct bitcoin_msg_header) + header.length);\n\t\t\tresp.insert(resp.begin() + sizeof(struct bitcoin_msg_header), msg->begin() + sizeof(header), msg->end());\n\t\t\tsend_message(\"pong\", &resp[0], header.length);\n\t\t} else if (!strncmp(header.command, \"pong\", strlen(\"pong\"))) {\n\t\t\tif (msg->size() != 8 + sizeof(header))\n\t\t\t\treturn disconnect(\"got pong without nonce\");\n\t\t\tuint64_t nonce;\n\t\t\tmemcpy(&nonce, &(*msg)[sizeof(read_header)], 8);\n\t\t\tpong_received(nonce);\n\t\t} else\n\t\t\tprovide_msg(*msg);\n\t}\n}\n\nvoid P2PPipe::send_ping(uint64_t nonce) {\n\tstd::vector<unsigned char> msg(sizeof(struct bitcoin_msg_header) + 8);\n\tmemcpy(&msg[sizeof(struct bitcoin_msg_header)], &nonce, 8);\n\tsend_message(\"ping\", &msg[0], 8);\n}\n\nbool P2PPipe::is_connected() const {\n\treturn connected == 2;\n}\n<commit_msg>Postpend FIBREBentPipe to version string<commit_after>#include \"p2ppipe.h\"\n#include \"utils.h\"\n#include \"crypto\/sha2.h\"\n\n#include <thread>\n#include <chrono>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/time.h>\n#include <stdio.h>\n#include <cstddef>\n\n#ifdef WIN32\n\t#include <winsock2.h>\n\t#include <ws2tcpip.h>\n#else \/\/ WIN32\n\t#include <sys\/socket.h>\n\t#include <netinet\/in.h>\n\t#include <netinet\/tcp.h>\n\t#include <netdb.h>\n\t#include <fcntl.h>\n#endif \/\/ !WIN32\n\nvoid P2PPipe::send_message(const char* command, unsigned char* headerAndData, size_t datalen) {\n\tprepare_message(command, headerAndData, datalen);\n\tmaybe_do_send_bytes((char*)headerAndData, sizeof(struct bitcoin_msg_header) + datalen);\n}\n\nstatic std::string statefulMessages[] = {\"sendheaders\", \"feefilter\" \/*, \"sendcmpct\" - but gets its own processing *\/};\n\nvoid P2PPipe::send_hashed_message(const unsigned char* headerAndData, size_t totallen) {\n\tif (!strncmp(((struct bitcoin_msg_header*)headerAndData)->command, \"version\", strlen(\"version\"))) {\n\t\tstd::vector<unsigned char> message(headerAndData, headerAndData + totallen);\n\t\tbool insert = !statefulMessagesSent.count(\"version\");\n\t\tif (!insert) {\n\t\t\tconst unsigned char* oldMessage = statefulMessagesSent[\"version\"].data();\n\n\t\t\tuint32_t oldMsgLength, newMsgLength;\n\t\t\tmemcpy(&oldMsgLength, &((struct bitcoin_msg_header*)oldMessage   )->length, sizeof(oldMsgLength));\n\t\t\tmemcpy(&newMsgLength, &((struct bitcoin_msg_header*)headerAndData)->length, sizeof(newMsgLength));\n\t\t\tinsert = oldMsgLength != newMsgLength;\n\n\t\t\tif (!insert && le32toh(newMsgLength) >= sizeof(struct bitcoin_version_start)) {\n\t\t\t\tstruct bitcoin_version_start oldVersion, newVersion;\n\t\t\t\tmemcpy(&oldVersion, oldMessage    + sizeof(struct bitcoin_msg_header), sizeof(oldVersion));\n\t\t\t\tmemcpy(&newVersion, headerAndData + sizeof(struct bitcoin_msg_header), sizeof(newVersion));\n\n\t\t\t\tinsert = oldVersion.protocol_version != newVersion.protocol_version ||\n\t\t\t\t\t\toldVersion.services != newVersion.services ||\n\t\t\t\t\t\tmemcmp(oldVersion.addr_recv, newVersion.addr_recv, sizeof(oldVersion.addr_recv) - 2) ||\n\t\t\t\t\t\tmemcmp(oldVersion.addr_from, newVersion.addr_from, sizeof(oldVersion.addr_from) - 2) ||\n\t\t\t\t\t\toldVersion.user_agent_length != newVersion.user_agent_length;\n\t\t\t}\n\t\t}\n\n\t\tif (insert) {\n\t\t\tstatefulMessagesSent[\"version\"] = std::move(message);\n\t\t\tdisconnect_from_outside(\"new outbound version\");\n\t\t}\n\t\treturn;\n\t}\n\n\tif (is_connected())\n\t\tmaybe_do_send_bytes((char*)headerAndData, totallen);\n\tassert(totallen >= sizeof(struct bitcoin_msg_header));\n\n\tfor (size_t i = 0; i < sizeof(statefulMessages) \/ sizeof(std::string); i++)\n\t\tif (!strncmp(((struct bitcoin_msg_header*)headerAndData)->command, statefulMessages[i].c_str(), statefulMessages[i].length()))\n\t\t\tstatefulMessagesSent[statefulMessages[i]] = std::vector<unsigned char>(headerAndData, headerAndData + totallen);\n\tif (!strncmp(((struct bitcoin_msg_header*)headerAndData)->command, \"sendcmpct\", strlen(\"sendcmpct\")) &&\n\t\t\ttotallen >= sizeof(struct bitcoin_msg_header) + 9) {\n\t\tuint64_t cmpctVersion;\n\t\tmemcpy(&cmpctVersion, headerAndData + sizeof(struct bitcoin_msg_header) + 1, sizeof(cmpctVersion));\n\t\tcmpctVersion = le64toh(cmpctVersion);\n\t\tstatefulMessagesSent[std::string(\"sendcmpct\") + std::to_string(cmpctVersion)] = std::vector<unsigned char>(headerAndData, headerAndData + totallen);\n\t}\n}\n\nvoid P2PPipe::on_disconnect() {\n\tconnected = 0;\n\tread_msg.reset();\n\tread_pos = 0;\n}\n\nvoid P2PPipe::net_process(const std::function<void(std::string)>& disconnect) {\n\tconnected = 0;\n\n\tif (statefulMessagesSent.count(\"version\")) {\n\t\t\/\/ Postpend Bent Pipe info to version\n\t\tstd::vector<unsigned char> message(statefulMessagesSent[\"version\"]);\n\t\tif (message.size() >= sizeof(struct bitcoin_version_start) + sizeof(struct bitcoin_msg_header)) {\n\t\t\tuint8_t ua_length = message[sizeof(struct bitcoin_msg_header) + offsetof(struct bitcoin_version_start, user_agent_length)];\n\t\t\tif (ua_length <= 100 && message.size() > sizeof(struct bitcoin_version_start) + sizeof(struct bitcoin_msg_header) + ua_length) {\n\t\t\t\tconst char* ua_postpend = \"FIBREBentPipe:42\/\";\n\t\t\t\tmessage.insert(message.begin() + sizeof(struct bitcoin_msg_header) + sizeof(struct bitcoin_version_start) + ua_length, (unsigned char*)ua_postpend, (unsigned char*) ua_postpend + 17);\n\t\t\t\tmessage[sizeof(struct bitcoin_msg_header) + offsetof(struct bitcoin_version_start, user_agent_length)] = ua_length + 17;\n\t\t\t}\n\t\t}\n\t\tsend_message(\"version\", message.data(), message.size() - sizeof(struct bitcoin_msg_header));\n\t} else {\n\t\tstd::vector<unsigned char> version_msg(generate_version());\n\t\tsend_message(\"version\", &version_msg[0], version_msg.size() - sizeof(struct bitcoin_msg_header));\n\t}\n\n\twhile (true) {\n\t\tstruct bitcoin_msg_header header;\n\t\tif (read_all((char*)&header, sizeof(header)) != sizeof(header))\n\t\t\treturn disconnect(\"failed to read message header\");\n\n\t\tif (header.magic != BITCOIN_MAGIC)\n\t\t\treturn disconnect(\"invalid magic bytes\");\n\n\t\theader.length = le32toh(header.length);\n\t\tif (header.length > 5000000)\n\t\t\treturn disconnect(\"got message too large\");\n\n\t\tauto msg = std::make_shared<std::vector<unsigned char> > (sizeof(header) + uint32_t(header.length));\n\t\tmemcpy(msg->data(), &header, sizeof(header));\n\n\t\tbool check_msg_hash = check_block_msghash || (strncmp(header.command, \"block\", strlen(\"block\")) &&\n\t\t\tstrncmp(header.command, \"blocktxn\", strlen(\"blocktxn\")) && strncmp(header.command, \"cmpctblock\", strlen(\"cmpctblock\")));\n\t\tif (check_msg_hash) {\n\t\t\tuint32_t hash[8];\n\t\t\tdouble_sha256_init(hash);\n\n\t\t\tuint32_t steps = header.length \/ 64;\n\t\t\tfor (uint32_t i = 0; i < steps; i++) {\n\t\t\t\tunsigned char* writepos = &((*msg)[sizeof(header) + i*64]);\n\t\t\t\tif (read_all((char*)writepos, 64) != 64)\n\t\t\t\t\treturn disconnect(\"failed to read message\");\n\t\t\t\tdouble_sha256_step(writepos, 64, hash);\n\t\t\t}\n\n\t\t\tunsigned char* writepos = &((*msg)[sizeof(header) + steps*64]);\n\t\t\tif (read_all((char*)writepos, header.length - steps*64) != ssize_t(header.length - steps*64))\n\t\t\t\treturn disconnect(\"failed to read message\");\n\t\t\tdouble_sha256_done(writepos, header.length - steps*64, header.length, hash);\n\n\t\t\tif (memcmp((char*)hash, header.checksum, sizeof(header.checksum)))\n\t\t\t\treturn disconnect(\"got invalid message checksum\");\n\t\t} else\n\t\t\tif (read_all((char*)&(*msg)[sizeof(header)], header.length) != ssize_t(header.length))\n\t\t\t\treturn disconnect(\"failed to read message\");\n\n\t\tif (!strncmp(header.command, \"version\", strlen(\"version\"))) {\n\t\t\tif (connected != 0)\n\t\t\t\treturn disconnect(\"got invalid version\");\n\t\t\tconnected = 1;\n\n\t\t\tif (header.length < sizeof(struct bitcoin_version_start))\n\t\t\t\treturn disconnect(\"got short version\");\n\n\t\t\tstruct bitcoin_version_start their_version;\n\t\t\tmemcpy(&their_version, &(*msg)[sizeof(header)], sizeof(their_version));\n\n\t\t\tstruct bitcoin_msg_header new_header;\n\t\t\tsend_message(\"verack\", (unsigned char*)&new_header, 0);\n\n\t\t\tSTAMPOUT();\n\t\t\tprintf(\"Connected to bitcoind with version %u\\n\", le32toh(their_version.protocol_version));\n\n\t\t\tprovide_msg(*msg);\n\n\t\t\tcontinue;\n\t\t} else if (!strncmp(header.command, \"verack\", strlen(\"verack\"))) {\n\t\t\tif (connected != 1)\n\t\t\t\treturn disconnect(\"got invalid verack\");\n\t\t\tSTAMPOUT();\n\t\t\tprintf(\"Finished connect handshake with bitcoind\\n\");\n\t\t\tconnected = 2;\n\n\t\t\tfor (auto& p : statefulMessagesSent)\n\t\t\t\tif (p.first != \"version\") {\n\t\t\t\t\tstd::string cmpct(\"sendcmpct\");\n\t\t\t\t\tif (!p.first.compare(0, cmpct.length(), cmpct))\n\t\t\t\t\t\tsend_message(\"sendcmpct\", p.second.data(), p.second.size() - sizeof(struct bitcoin_msg_header));\n\t\t\t\t\telse\n\t\t\t\t\t\tsend_message(p.first.c_str(), p.second.data(), p.second.size() - sizeof(struct bitcoin_msg_header));\n\t\t\t\t}\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (connected != 2)\n\t\t\treturn disconnect(\"got non-version, non-verack before version+verack\");\n\n\t\tif (!strncmp(header.command, \"ping\", strlen(\"ping\"))) {\n\t\t\tstd::vector<unsigned char> resp(sizeof(struct bitcoin_msg_header) + header.length);\n\t\t\tresp.insert(resp.begin() + sizeof(struct bitcoin_msg_header), msg->begin() + sizeof(header), msg->end());\n\t\t\tsend_message(\"pong\", &resp[0], header.length);\n\t\t} else if (!strncmp(header.command, \"pong\", strlen(\"pong\"))) {\n\t\t\tif (msg->size() != 8 + sizeof(header))\n\t\t\t\treturn disconnect(\"got pong without nonce\");\n\t\t\tuint64_t nonce;\n\t\t\tmemcpy(&nonce, &(*msg)[sizeof(read_header)], 8);\n\t\t\tpong_received(nonce);\n\t\t} else\n\t\t\tprovide_msg(*msg);\n\t}\n}\n\nvoid P2PPipe::send_ping(uint64_t nonce) {\n\tstd::vector<unsigned char> msg(sizeof(struct bitcoin_msg_header) + 8);\n\tmemcpy(&msg[sizeof(struct bitcoin_msg_header)], &nonce, 8);\n\tsend_message(\"ping\", &msg[0], 8);\n}\n\nbool P2PPipe::is_connected() const {\n\treturn connected == 2;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ BSD 3-Clause License\n\/\/\n\/\/ Copyright (c) 2019, University of California, San Diego.\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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"HungarianMatching.h\"\n\n#include \"utility\/Logger.h\"\n\nnamespace ppl {\n\nHungarianMatching::HungarianMatching(Section& section,\n                                     SlotVector& slots,\n                                     Logger* logger)\n    : netlist_(section.net), slots_(slots)\n{\n  num_io_pins_ = netlist_.numIOPins();\n  num_pin_groups_ = netlist_.numIOGroups();\n  begin_slot_ = section.begin_slot;\n  end_slot_ = section.end_slot;\n  num_slots_ = end_slot_ - begin_slot_;\n  non_blocked_slots_ = section.num_slots;\n  group_slots_ = 0;\n  group_size_ = -1;\n  edge_ = section.edge;\n  logger_ = logger;\n}\n\nvoid HungarianMatching::findAssignment(std::vector<Constraint>& constraints)\n{\n  createMatrix(constraints);\n  hungarian_solver_.solve(hungarian_matrix_, assignment_);\n}\n\nvoid HungarianMatching::createMatrix(std::vector<Constraint>& constraints)\n{\n  hungarian_matrix_.resize(non_blocked_slots_);\n  int slot_index = 0;\n  for (int i = begin_slot_; i < end_slot_; ++i) {\n    int pinIndex = 0;\n    Point newPos = slots_[i].pos;\n    if (slots_[i].blocked) {\n      continue;\n    }\n    hungarian_matrix_[slot_index].resize(num_io_pins_);\n    int idx = 0;\n    for (IOPin& io_pin : netlist_.getIOPins()) {\n      if (!io_pin.isInGroup()) {\n        int hpwl = netlist_.computeIONetHPWL(idx, newPos, edge_, constraints);\n        hungarian_matrix_[slot_index][pinIndex] = hpwl;\n        pinIndex++;\n      }\n      idx++;\n    }\n    slot_index++;\n  }\n}\n\ninline bool samePos(Point& a, Point& b)\n{\n  return (a.x() == b.x() && a.y() == b.y());\n}\n\nvoid HungarianMatching::getFinalAssignment(std::vector<IOPin>& assigment) const\n{\n  size_t rows = non_blocked_slots_;\n  size_t col = 0;\n  int slot_index = 0;\n  for (IOPin& io_pin : netlist_.getIOPins()) {\n    if (!io_pin.isInGroup()) {\n      slot_index = begin_slot_;\n      for (size_t row = 0; row < rows; row++) {\n        while (slots_[slot_index].blocked && slot_index < slots_.size())\n          slot_index++;\n        if (assignment_[row] != col) {\n          slot_index++;\n          continue;\n        }\n        if (hungarian_matrix_[row][col] == hungarian_fail) {\n          logger_->warn(utl::PPL,\n                        33,\n                        \"I\/O pin {} cannot be placed in the specified region. \"\n                        \"Not enough space\",\n                        io_pin.getName().c_str());\n        }\n        io_pin.setPos(slots_[slot_index].pos);\n        io_pin.setLayer(slots_[slot_index].layer);\n        assigment.push_back(io_pin);\n        slots_[slot_index].used = true;\n        break;\n      }\n      col++;\n    }\n  }\n}\n\nvoid HungarianMatching::findAssignmentForGroups(std::vector<Constraint>& constraints)\n{\n  createMatrixForGroups(constraints);\n\n  if (hungarian_matrix_.size() > 0)\n    hungarian_solver_.solve(hungarian_matrix_, assignment_);\n}\n\nvoid HungarianMatching::createMatrixForGroups(std::vector<Constraint>& constraints)\n{\n  for (std::set<int>& io_group : netlist_.getIOGroups()) {\n    group_size_ = std::max((int)io_group.size(), group_size_);\n  }\n\n  if (group_size_ > 0) {\n    for (int i = begin_slot_; i < end_slot_; i+=group_size_) {\n      bool blocked = false;\n      for (int pin_cnt = 0; pin_cnt < group_size_; pin_cnt++) {\n        if (slots_[i + pin_cnt].blocked) {\n          blocked = true;\n        }\n      }\n      if (!blocked) {\n        group_slots_++;\n      }\n    }\n\n    hungarian_matrix_.resize(group_slots_);\n    int slot_index = 0;\n    for (int i = begin_slot_; i < end_slot_; i+=group_size_) {\n      int groupIndex = 0;\n      Point newPos = slots_[i].pos;\n      \n      bool blocked = false;\n      for (int pin_cnt = 0; pin_cnt < group_size_; pin_cnt++) {\n        if (slots_[i + pin_cnt].blocked) {\n          blocked = true;\n        }\n      }\n      if (blocked) {\n        continue;\n      }\n\n      hungarian_matrix_[slot_index].resize(num_pin_groups_);\n      for (std::set<int>& io_group : netlist_.getIOGroups()) {\n        int hpwl = 0;\n        int pin_count = 0;\n        for (int io_idx : io_group) {\n          hpwl += netlist_.computeIONetHPWL(io_idx, newPos, edge_, constraints);\n          hungarian_matrix_[slot_index][groupIndex] = hpwl;\n        }\n        groupIndex++;\n      }\n      slot_index++;\n    }\n  }\n}\n\nvoid HungarianMatching::getAssignmentForGroups(std::vector<IOPin>& assigment)\n{\n  if (hungarian_matrix_.size() <= 0)\n    return;\n\n  size_t rows = group_slots_;\n  size_t col = 0;\n  int slot_index = 0;\n  for (std::set<int>& io_group : netlist_.getIOGroups()) {\n    slot_index = begin_slot_;\n    for (size_t row = 0; row < rows; row++) {\n      while (slots_[slot_index].blocked && slot_index < slots_.size())\n        slot_index++;\n      if (assignment_[row] != col) {\n        slot_index++;\n        continue;\n      }\n      int pin_cnt = 0;\n      for (int pin_idx : io_group) {\n        IOPin io_pin = netlist_.getIoPin(pin_idx);\n        io_pin.setPos(slots_[slot_index + pin_cnt].pos);\n        io_pin.setLayer(slots_[slot_index + pin_cnt].layer);\n        assigment.push_back(io_pin);\n        slots_[slot_index + pin_cnt].used = true;\n        slots_[slot_index + pin_cnt].blocked = true;\n        non_blocked_slots_--;\n        pin_cnt++;\n      }\n      break;\n    }\n    col++;\n  }\n\n  hungarian_matrix_.clear();\n  assignment_.clear();\n}\n\n}  \/\/ namespace ppl\n<commit_msg>ppl: avoid negative values in hungariam matching matrix<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ BSD 3-Clause License\n\/\/\n\/\/ Copyright (c) 2019, University of California, San Diego.\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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"HungarianMatching.h\"\n\n#include \"utility\/Logger.h\"\n\nnamespace ppl {\n\nHungarianMatching::HungarianMatching(Section& section,\n                                     SlotVector& slots,\n                                     Logger* logger)\n    : netlist_(section.net), slots_(slots)\n{\n  num_io_pins_ = netlist_.numIOPins();\n  num_pin_groups_ = netlist_.numIOGroups();\n  begin_slot_ = section.begin_slot;\n  end_slot_ = section.end_slot;\n  num_slots_ = end_slot_ - begin_slot_;\n  non_blocked_slots_ = section.num_slots;\n  group_slots_ = 0;\n  group_size_ = -1;\n  edge_ = section.edge;\n  logger_ = logger;\n}\n\nvoid HungarianMatching::findAssignment(std::vector<Constraint>& constraints)\n{\n  createMatrix(constraints);\n  hungarian_solver_.solve(hungarian_matrix_, assignment_);\n}\n\nvoid HungarianMatching::createMatrix(std::vector<Constraint>& constraints)\n{\n  hungarian_matrix_.resize(non_blocked_slots_);\n  int slot_index = 0;\n  for (int i = begin_slot_; i < end_slot_; ++i) {\n    int pinIndex = 0;\n    Point newPos = slots_[i].pos;\n    if (slots_[i].blocked) {\n      continue;\n    }\n    hungarian_matrix_[slot_index].resize(num_io_pins_);\n    int idx = 0;\n    for (IOPin& io_pin : netlist_.getIOPins()) {\n      if (!io_pin.isInGroup()) {\n        int hpwl = netlist_.computeIONetHPWL(idx, newPos, edge_, constraints);\n        hungarian_matrix_[slot_index][pinIndex] = hpwl;\n        pinIndex++;\n      }\n      idx++;\n    }\n    slot_index++;\n  }\n}\n\ninline bool samePos(Point& a, Point& b)\n{\n  return (a.x() == b.x() && a.y() == b.y());\n}\n\nvoid HungarianMatching::getFinalAssignment(std::vector<IOPin>& assigment) const\n{\n  size_t rows = non_blocked_slots_;\n  size_t col = 0;\n  int slot_index = 0;\n  for (IOPin& io_pin : netlist_.getIOPins()) {\n    if (!io_pin.isInGroup()) {\n      slot_index = begin_slot_;\n      for (size_t row = 0; row < rows; row++) {\n        while (slots_[slot_index].blocked && slot_index < slots_.size())\n          slot_index++;\n        if (assignment_[row] != col) {\n          slot_index++;\n          continue;\n        }\n        if (hungarian_matrix_[row][col] == hungarian_fail) {\n          logger_->warn(utl::PPL,\n                        33,\n                        \"I\/O pin {} cannot be placed in the specified region. \"\n                        \"Not enough space\",\n                        io_pin.getName().c_str());\n        }\n        io_pin.setPos(slots_[slot_index].pos);\n        io_pin.setLayer(slots_[slot_index].layer);\n        assigment.push_back(io_pin);\n        slots_[slot_index].used = true;\n        break;\n      }\n      col++;\n    }\n  }\n}\n\nvoid HungarianMatching::findAssignmentForGroups(std::vector<Constraint>& constraints)\n{\n  createMatrixForGroups(constraints);\n\n  if (hungarian_matrix_.size() > 0)\n    hungarian_solver_.solve(hungarian_matrix_, assignment_);\n}\n\nvoid HungarianMatching::createMatrixForGroups(std::vector<Constraint>& constraints)\n{\n  for (std::set<int>& io_group : netlist_.getIOGroups()) {\n    group_size_ = std::max((int)io_group.size(), group_size_);\n  }\n\n  if (group_size_ > 0) {\n    for (int i = begin_slot_; i < end_slot_; i+=group_size_) {\n      bool blocked = false;\n      for (int pin_cnt = 0; pin_cnt < group_size_; pin_cnt++) {\n        if (slots_[i + pin_cnt].blocked) {\n          blocked = true;\n        }\n      }\n      if (!blocked) {\n        group_slots_++;\n      }\n    }\n\n    hungarian_matrix_.resize(group_slots_);\n    int slot_index = 0;\n    for (int i = begin_slot_; i < end_slot_; i+=group_size_) {\n      int groupIndex = 0;\n      Point newPos = slots_[i].pos;\n      \n      bool blocked = false;\n      for (int pin_cnt = 0; pin_cnt < group_size_; pin_cnt++) {\n        if (slots_[i + pin_cnt].blocked) {\n          blocked = true;\n        }\n      }\n      if (blocked) {\n        continue;\n      }\n\n      hungarian_matrix_[slot_index].resize(num_pin_groups_);\n      for (std::set<int>& io_group : netlist_.getIOGroups()) {\n        int group_hpwl = 0;\n        int pin_count = 0;\n        for (int io_idx : io_group) {\n          int pin_hpwl = netlist_.computeIONetHPWL(io_idx, newPos, edge_, constraints);\n          if (pin_hpwl == hungarian_fail) {\n            group_hpwl = hungarian_fail;\n            break;\n          } else {\n            group_hpwl += netlist_.computeIONetHPWL(io_idx, newPos, edge_, constraints);\n          }\n        }\n        hungarian_matrix_[slot_index][groupIndex] = group_hpwl;\n        groupIndex++;\n      }\n      slot_index++;\n    }\n  }\n}\n\nvoid HungarianMatching::getAssignmentForGroups(std::vector<IOPin>& assigment)\n{\n  if (hungarian_matrix_.size() <= 0)\n    return;\n\n  size_t rows = group_slots_;\n  size_t col = 0;\n  int slot_index = 0;\n  for (std::set<int>& io_group : netlist_.getIOGroups()) {\n    slot_index = begin_slot_;\n    for (size_t row = 0; row < rows; row++) {\n      while (slots_[slot_index].blocked && slot_index < slots_.size())\n        slot_index++;\n      if (assignment_[row] != col) {\n        slot_index++;\n        continue;\n      }\n      int pin_cnt = 0;\n      for (int pin_idx : io_group) {\n        IOPin io_pin = netlist_.getIoPin(pin_idx);\n        io_pin.setPos(slots_[slot_index + pin_cnt].pos);\n        io_pin.setLayer(slots_[slot_index + pin_cnt].layer);\n        assigment.push_back(io_pin);\n        slots_[slot_index + pin_cnt].used = true;\n        slots_[slot_index + pin_cnt].blocked = true;\n        non_blocked_slots_--;\n        pin_cnt++;\n      }\n      break;\n    }\n    col++;\n  }\n\n  hungarian_matrix_.clear();\n  assignment_.clear();\n}\n\n}  \/\/ namespace ppl\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n#include <thread>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <functional>\n\n#include \"Tools\/general_utils.h\"\n#include \"Tools\/system_functions.h\"\n#include \"Tools\/Display\/bash_tools.h\"\n#include \"Tools\/Exception\/exception.hpp\"\n#include \"Tools\/Display\/Statistics\/Statistics.hpp\"\n#include \"Tools\/Display\/Terminal\/BFER\/Terminal_BFER.hpp\"\n\n#ifdef ENABLE_MPI\n#include \"Module\/Monitor\/BFER\/Monitor_BFER_reduction_mpi.hpp\"\n#endif\n\n#include \"Factory\/Module\/Monitor\/Monitor.hpp\"\n#include \"Factory\/Tools\/Display\/Terminal\/BFER\/Terminal_BFER.hpp\"\n\n#include \"BFER.hpp\"\n\nusing namespace aff3ct;\nusing namespace aff3ct::simulation;\n\ntemplate <typename B, typename R, typename Q>\nBFER<B,R,Q>\n::BFER(const factory::BFER::parameters& params_BFER)\n: Simulation(params_BFER),\n  params_BFER(params_BFER),\n\n  barrier(params_BFER.n_threads),\n\n  bit_rate((float)params_BFER.src->K \/ (float)params_BFER.cdc->N),\n\n  max_fra(0),\n\n  monitor    (params_BFER.n_threads, nullptr),\n  monitor_red(                       nullptr),\n  dumper     (params_BFER.n_threads, nullptr),\n  dumper_red (                       nullptr),\n  terminal   (                       nullptr)\n{\n\tif (params_BFER.n_threads < 1)\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'n_threads' has to be greater than 0 ('n_threads' = \" << params_BFER.n_threads << \").\";\n\t\tthrow tools::invalid_argument(__FILE__, __LINE__, __func__, message.str());\n\t}\n\n\tif (params_BFER.err_track_enable)\n\t{\n\t\tfor (auto tid = 0; tid < params_BFER.n_threads; tid++)\n\t\t\tdumper[tid] = new tools::Dumper();\n\n\t\tstd::vector<tools::Dumper*> dumpers;\n\t\tfor (auto tid = 0; tid < params_BFER.n_threads; tid++)\n\t\t\tdumpers.push_back(dumper[tid]);\n\n\t\tdumper_red = new tools::Dumper_reduction(dumpers);\n\t}\n\n\tmodules[\"monitor\"] = std::vector<module::Module*>(params_BFER.n_threads, nullptr);\n\tfor (auto tid = 0; tid < params_BFER.n_threads; tid++)\n\t{\n\t\tthis->monitor[tid] = this->build_monitor(tid);\n\t\tmodules[\"monitor\"][tid] = this->monitor[tid];\n\t}\n\n#ifdef ENABLE_MPI\n\t\/\/ build a monitor to compute BER\/FER (reduce the other monitors)\n\tthis->monitor_red = new module::Monitor_BFER_reduction_mpi<B>(this->monitor,\n\t                                                              std::this_thread::get_id(),\n\t                                                              params_BFER.mpi_comm_freq);\n#else\n\t\/\/ build a monitor to compute BER\/FER (reduce the other monitors)\n\tthis->monitor_red = new module::Monitor_BFER_reduction<B>(this->monitor);\n#endif\n}\n\ntemplate <typename B, typename R, typename Q>\nBFER<B,R,Q>\n::~BFER()\n{\n\trelease_objects();\n\n\tif (monitor_red != nullptr) { delete monitor_red; monitor_red = nullptr; }\n\tif (dumper_red  != nullptr) { delete dumper_red;  dumper_red  = nullptr; }\n\n\tfor (auto tid = 0; tid < params_BFER.n_threads; tid++)\n\t{\n\t\tif (monitor[tid] != nullptr) { delete monitor[tid]; monitor[tid] = nullptr; }\n\t\tif (dumper [tid] != nullptr) { delete dumper [tid]; dumper [tid] = nullptr; }\n\t}\n\n\tif (terminal != nullptr) { delete terminal; terminal = nullptr; }\n}\n\ntemplate <typename B, typename R, typename Q>\nvoid BFER<B,R,Q>\n::_build_communication_chain()\n{\n\t\/\/ build the communication chain in multi-threaded mode\n\tstd::vector<std::thread> threads(params_BFER.n_threads -1);\n\tfor (auto tid = 1; tid < params_BFER.n_threads; tid++)\n\t\tthreads[tid -1] = std::thread(BFER<B,R,Q>::start_thread_build_comm_chain, this, tid);\n\n\tBFER<B,R,Q>::start_thread_build_comm_chain(this, 0);\n\n\t\/\/ join the slave threads with the master thread\n\tfor (auto tid = 1; tid < params_BFER.n_threads; tid++)\n\t\tthreads[tid -1].join();\n}\n\ntemplate <typename B, typename R, typename Q>\nvoid BFER<B,R,Q>\n::launch()\n{\n\tthis->terminal = this->build_terminal();\n\n\tif (!this->params_BFER.err_track_revert)\n\t{\n\t\tthis->build_communication_chain();\n\n\t\tif (module::Monitor::is_over())\n\t\t{\n\t\t\tthis->release_objects();\n\t\t\treturn;\n\t\t}\n\t}\n\n\t\/\/ for each NOISE to be simulated\n\tfor (unsigned noise_idx = 0; noise_idx < params_BFER.noise_range.size(); noise_idx ++)\n\t{\n\t\tauto n = params_BFER.noise_range[noise_idx];\n\n\t\tif (params_BFER.noise_type == \"EBN0\" || params_BFER.noise_type == \"ESN0\")\n\t\t{\n\t\t\tfloat esn0, ebn0;\n\t\t\tif (params_BFER.noise_type == \"EBN0\")\n\t\t\t{\n\t\t\t\tebn0 = n;\n\t\t\t\tesn0 = tools::ebn0_to_esn0(ebn0, bit_rate, params_BFER.mdm->bps);\n\t\t\t}\n\t\t\telse \/\/ if (params_BFER.sim->noise_type == \"ESN0\")\n\t\t\t{\n\t\t\t\tesn0 = n;\n\t\t\t\tebn0 = tools::esn0_to_ebn0(esn0, bit_rate, params_BFER.mdm->bps);\n\t\t\t}\n\n\t\t\tauto sigma = tools::esn0_to_sigma(esn0, params_BFER.mdm->upf);\n\n\t\t\tthis->noise.set_sigma(sigma, ebn0, esn0);\n\t\t}\n\t\telse if (params_BFER.noise_type == \"ROP\")\n\t\t{\n\t\t\tthis->noise.set_rop(n);\n\t\t}\n\t\telse \/\/ if (params_BFER.noise_type == \"EP\")\n\t\t{\n\t\t\tthis->noise.set_ep(n);\n\t\t}\n\n\t\tthis->terminal->set_noise(this->noise);\n\n\n\t\tif (this->params_BFER.err_track_revert)\n\t\t{\n\t\t\tthis->release_objects();\n\t\t\tthis->monitor_red->clear_callbacks();\n\n\t\t\t\/\/ dirty hack to override simulation params_BFER\n\t\t\tauto &params_BFER_writable = const_cast<factory::BFER::parameters&>(params_BFER);\n\n\t\t\tstd::stringstream s_noise;\n\t\t\ts_noise << std::setprecision(2) << std::fixed << this->noise.get_noise();\n\n\t\t\tparams_BFER_writable.src     ->path = params_BFER.err_track_path + \"_\" + s_noise.str() + \".src\";\n\t\t\tparams_BFER_writable.cdc->enc->path = params_BFER.err_track_path + \"_\" + s_noise.str() + \".enc\";\n\t\t\tparams_BFER_writable.chn     ->path = params_BFER.err_track_path + \"_\" + s_noise.str() + \".chn\";\n\n\t\t\tstd::ifstream file(params_BFER.chn->path, std::ios::binary);\n\t\t\tif (file.is_open())\n\t\t\t{\n\t\t\t\tfile.read((char*)&max_fra, sizeof(max_fra));\n\t\t\t\tfile.close();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstd::stringstream message;\n\t\t\t\tmessage << \"Impossible to read the 'chn' file ('chn' = \" << params_BFER.chn->path << \").\";\n\t\t\t\tthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n\t\t\t}\n\n\t\t\tthis->build_communication_chain();\n\n\t\t\tif (module::Monitor::is_over())\n\t\t\t{\n\t\t\t\tthis->release_objects();\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tif (params_BFER.display_legend)\n#ifdef ENABLE_MPI\n\t\t\tif (((!params_BFER.ter->disabled && noise_idx == 0 && !params_BFER.debug) ||\n\t\t \t   (params_BFER.statistics && !params_BFER.debug)) && params_BFER.mpi_rank == 0)\n#else\n\t\t\tif (((!params_BFER.ter->disabled && noise_idx == 0 && !params_BFER.debug) ||\n\t\t\t    (params_BFER.statistics && !params_BFER.debug)))\n#endif\n\t\t\t\tterminal->legend(std::cout);\n\n\t\t\/\/ start the terminal to display BER\/FER results\n#ifdef ENABLE_MPI\n\t\tif (!params_BFER.ter->disabled && params_BFER.ter->frequency != std::chrono::nanoseconds(0) && !params_BFER.debug\n\t\t    && params_BFER.mpi_rank == 0)\n#else\n\t\tif (!params_BFER.ter->disabled && params_BFER.ter->frequency != std::chrono::nanoseconds(0) && !params_BFER.debug)\n#endif\n\t\t\tterminal->start_temp_report(params_BFER.ter->frequency);\n\n\t\ttry\n\t\t{\n\t\t\tthis->_launch();\n\t\t}\n\t\tcatch (std::exception const& e)\n\t\t{\n\t\t\tmodule::Monitor::stop();\n\t\t\tterminal->final_report(std::cout); \/\/ display final report to not lost last line overwritten by the error messages\n\n\t\t\tstd::cerr << tools::apply_on_each_line(e.what(), &tools::format_error) << std::endl;\n\t\t\tthis->simu_error = true;\n\t\t}\n\n#ifdef ENABLE_MPI\n\t\tif (!params_BFER.ter->disabled && terminal != nullptr && !this->simu_error && params_BFER.mpi_rank == 0)\n#else\n\t\tif (!params_BFER.ter->disabled && terminal != nullptr && !this->simu_error)\n#endif\n\t\t{\n\t\t\tif (params_BFER.debug)\n\t\t\t\tterminal->legend(std::cout);\n\n\t\t\tterminal->final_report(std::cout);\n\n\t\t\tif (params_BFER.statistics)\n\t\t\t{\n\t\t\t\tstd::vector<std::vector<const module::Module*>> mod_vec;\n\t\t\t\tfor (auto &vm : modules)\n\t\t\t\t{\n\t\t\t\t\tstd::vector<const module::Module*> sub_mod_vec;\n\t\t\t\t\tfor (auto *m : vm.second)\n\t\t\t\t\t\tsub_mod_vec.push_back(m);\n\t\t\t\t\tmod_vec.push_back(sub_mod_vec);\n\t\t\t\t}\n\n\t\t\t\tstd::cout << \"#\" << std::endl;\n\t\t\t\ttools::Stats::show(mod_vec, true, std::cout);\n\t\t\t\tstd::cout << \"#\" << std::endl;\n\t\t\t}\n\t\t}\n\n\t\tif (this->dumper_red != nullptr && !this->simu_error)\n\t\t{\n\t\t\tstd::stringstream s_noise;\n\t\t\ts_noise << std::setprecision(2) << std::fixed << this->noise.get_noise();\n\n\t\t\tthis->dumper_red->dump(params_BFER.err_track_path + \"_\" + s_noise.str());\n\t\t\tthis->dumper_red->clear();\n\t\t}\n\n\t\tif (!params_BFER.err_track_revert && !module::Monitor::is_interrupt() &&\n\t\t    this->monitor_red->get_n_fe() < this->monitor_red->get_fe_limit() &&\n\t\t    (max_fra == 0 || this->monitor_red->get_n_fe() < max_fra))\n\t\t\tmodule::Monitor::stop();\n\n\t\tthis->monitor_red->reset();\n\t\tfor (auto &m : modules)\n\t\t\tfor (auto mm : m.second)\n\t\t\t\tif (mm != nullptr)\n\t\t\t\t\tfor (auto &t : mm->tasks)\n\t\t\t\t\t\tt->reset_stats();\n\n\t\tif (module::Monitor::is_over())\n\t\t\tbreak;\n\t}\n\n\tthis->release_objects();\n}\n\ntemplate <typename B, typename R, typename Q>\nvoid BFER<B,R,Q>\n::release_objects()\n{\n}\n\ntemplate <typename B, typename R, typename Q>\nmodule::Monitor_BFER<B>* BFER<B,R,Q>\n::build_monitor(const int tid)\n{\n\treturn factory::Monitor_BFER::build<B>(*params_BFER.mnt);\n}\n\ntemplate <typename B, typename R, typename Q>\ntools::Terminal_BFER<B>* BFER<B,R,Q>\n::build_terminal()\n{\n\treturn factory::Terminal_BFER::build<B>(*params_BFER.ter, *this->monitor_red);\n}\n\ntemplate <typename B, typename R, typename Q>\nvoid BFER<B,R,Q>\n::start_thread_build_comm_chain(BFER<B,R,Q> *simu, const int tid)\n{\n\ttry\n\t{\n\t\tsimu->__build_communication_chain(tid);\n\n\t\tif (simu->params_BFER.err_track_enable)\n\t\t\tsimu->monitor[tid]->add_handler_fe(std::bind(&tools::Dumper::add, simu->dumper[tid], std::placeholders::_1, std::placeholders::_2));\n\t}\n\tcatch (std::exception const& e)\n\t{\n\t\tmodule::Monitor::stop();\n\t\tsimu->simu_error = true;\n\n\t\tsimu->mutex_exception.lock();\n\n\t\tauto save = tools::exception::no_backtrace;\n\t\ttools::exception::no_backtrace = true;\n\t\tstd::string msg = e.what(); \/\/ get only the function signature\n\t\ttools::exception::no_backtrace = save;\n\n\t\tif (std::find(simu->prev_err_messages.begin(), simu->prev_err_messages.end(), msg) == simu->prev_err_messages.end())\n\t\t{\n\t\t\tstd::cerr << tools::apply_on_each_line(e.what(), &tools::format_error) << std::endl; \/\/ with backtrace if debug mode\n\t\t\tsimu->prev_err_messages.push_back(msg); \/\/ save only the function signature\n\t\t}\n\t\tsimu->mutex_exception.unlock();\n\t}\n}\n\n\/\/ ==================================================================================== explicit template instantiation\n#include \"Tools\/types.h\"\n#ifdef MULTI_PREC\ntemplate class aff3ct::simulation::BFER<B_8,R_8,Q_8>;\ntemplate class aff3ct::simulation::BFER<B_16,R_16,Q_16>;\ntemplate class aff3ct::simulation::BFER<B_32,R_32,Q_32>;\ntemplate class aff3ct::simulation::BFER<B_64,R_64,Q_64>;\n#else\ntemplate class aff3ct::simulation::BFER<B,R,Q>;\n#endif\n\/\/ ==================================================================================== explicit template instantiation\n\n<commit_msg>Simulate EP in reverse order; Add a noise type check else throw<commit_after>#include <cmath>\n#include <thread>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <functional>\n\n#include \"Tools\/general_utils.h\"\n#include \"Tools\/system_functions.h\"\n#include \"Tools\/Display\/bash_tools.h\"\n#include \"Tools\/Exception\/exception.hpp\"\n#include \"Tools\/Display\/Statistics\/Statistics.hpp\"\n#include \"Tools\/Display\/Terminal\/BFER\/Terminal_BFER.hpp\"\n\n#ifdef ENABLE_MPI\n#include \"Module\/Monitor\/BFER\/Monitor_BFER_reduction_mpi.hpp\"\n#endif\n\n#include \"Factory\/Module\/Monitor\/Monitor.hpp\"\n#include \"Factory\/Tools\/Display\/Terminal\/BFER\/Terminal_BFER.hpp\"\n\n#include \"BFER.hpp\"\n\nusing namespace aff3ct;\nusing namespace aff3ct::simulation;\n\ntemplate <typename B, typename R, typename Q>\nBFER<B,R,Q>\n::BFER(const factory::BFER::parameters& params_BFER)\n: Simulation(params_BFER),\n  params_BFER(params_BFER),\n\n  barrier(params_BFER.n_threads),\n\n  bit_rate((float)params_BFER.src->K \/ (float)params_BFER.cdc->N),\n\n  max_fra(0),\n\n  monitor    (params_BFER.n_threads, nullptr),\n  monitor_red(                       nullptr),\n  dumper     (params_BFER.n_threads, nullptr),\n  dumper_red (                       nullptr),\n  terminal   (                       nullptr)\n{\n\tif (params_BFER.n_threads < 1)\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'n_threads' has to be greater than 0 ('n_threads' = \" << params_BFER.n_threads << \").\";\n\t\tthrow tools::invalid_argument(__FILE__, __LINE__, __func__, message.str());\n\t}\n\n\tif (params_BFER.err_track_enable)\n\t{\n\t\tfor (auto tid = 0; tid < params_BFER.n_threads; tid++)\n\t\t\tdumper[tid] = new tools::Dumper();\n\n\t\tstd::vector<tools::Dumper*> dumpers;\n\t\tfor (auto tid = 0; tid < params_BFER.n_threads; tid++)\n\t\t\tdumpers.push_back(dumper[tid]);\n\n\t\tdumper_red = new tools::Dumper_reduction(dumpers);\n\t}\n\n\tmodules[\"monitor\"] = std::vector<module::Module*>(params_BFER.n_threads, nullptr);\n\tfor (auto tid = 0; tid < params_BFER.n_threads; tid++)\n\t{\n\t\tthis->monitor[tid] = this->build_monitor(tid);\n\t\tmodules[\"monitor\"][tid] = this->monitor[tid];\n\t}\n\n#ifdef ENABLE_MPI\n\t\/\/ build a monitor to compute BER\/FER (reduce the other monitors)\n\tthis->monitor_red = new module::Monitor_BFER_reduction_mpi<B>(this->monitor,\n\t                                                              std::this_thread::get_id(),\n\t                                                              params_BFER.mpi_comm_freq);\n#else\n\t\/\/ build a monitor to compute BER\/FER (reduce the other monitors)\n\tthis->monitor_red = new module::Monitor_BFER_reduction<B>(this->monitor);\n#endif\n}\n\ntemplate <typename B, typename R, typename Q>\nBFER<B,R,Q>\n::~BFER()\n{\n\trelease_objects();\n\n\tif (monitor_red != nullptr) { delete monitor_red; monitor_red = nullptr; }\n\tif (dumper_red  != nullptr) { delete dumper_red;  dumper_red  = nullptr; }\n\n\tfor (auto tid = 0; tid < params_BFER.n_threads; tid++)\n\t{\n\t\tif (monitor[tid] != nullptr) { delete monitor[tid]; monitor[tid] = nullptr; }\n\t\tif (dumper [tid] != nullptr) { delete dumper [tid]; dumper [tid] = nullptr; }\n\t}\n\n\tif (terminal != nullptr) { delete terminal; terminal = nullptr; }\n}\n\ntemplate <typename B, typename R, typename Q>\nvoid BFER<B,R,Q>\n::_build_communication_chain()\n{\n\t\/\/ build the communication chain in multi-threaded mode\n\tstd::vector<std::thread> threads(params_BFER.n_threads -1);\n\tfor (auto tid = 1; tid < params_BFER.n_threads; tid++)\n\t\tthreads[tid -1] = std::thread(BFER<B,R,Q>::start_thread_build_comm_chain, this, tid);\n\n\tBFER<B,R,Q>::start_thread_build_comm_chain(this, 0);\n\n\t\/\/ join the slave threads with the master thread\n\tfor (auto tid = 1; tid < params_BFER.n_threads; tid++)\n\t\tthreads[tid -1].join();\n}\n\ntemplate <typename B, typename R, typename Q>\nvoid BFER<B,R,Q>\n::launch()\n{\n\tthis->terminal = this->build_terminal();\n\n\tif (!this->params_BFER.err_track_revert)\n\t{\n\t\tthis->build_communication_chain();\n\n\t\tif (module::Monitor::is_over())\n\t\t{\n\t\t\tthis->release_objects();\n\t\t\treturn;\n\t\t}\n\t}\n\n\t\/\/ for each NOISE to be simulated\n\tfor (unsigned noise_idx = 0; noise_idx < params_BFER.noise_range.size(); noise_idx ++)\n\t{\n\t\tauto n = params_BFER.noise_range[noise_idx];\n\n\t\tif (params_BFER.noise_type == \"EBN0\" || params_BFER.noise_type == \"ESN0\")\n\t\t{\n\t\t\tfloat esn0, ebn0;\n\t\t\tif (params_BFER.noise_type == \"EBN0\")\n\t\t\t{\n\t\t\t\tebn0 = n;\n\t\t\t\tesn0 = tools::ebn0_to_esn0(ebn0, bit_rate, params_BFER.mdm->bps);\n\t\t\t}\n\t\t\telse \/\/ if (params_BFER.sim->noise_type == \"ESN0\")\n\t\t\t{\n\t\t\t\tesn0 = n;\n\t\t\t\tebn0 = tools::esn0_to_ebn0(esn0, bit_rate, params_BFER.mdm->bps);\n\t\t\t}\n\n\t\t\tauto sigma = tools::esn0_to_sigma(esn0, params_BFER.mdm->upf);\n\n\t\t\tthis->noise.set_sigma(sigma, ebn0, esn0);\n\t\t}\n\t\telse if (params_BFER.noise_type == \"ROP\")\n\t\t{\n\t\t\tthis->noise.set_rop(n);\n\t\t}\n\t\telse if (params_BFER.noise_type == \"EP\")\n\t\t{\n            n = params_BFER.noise_range[params_BFER.noise_range.size() - noise_idx -1];\n\n            this->noise.set_ep(n);\n\t\t}\n\t\telse\n        {\n            std::stringstream message;\n            message << \"Unknown noise type ('noise_type' = \" << params_BFER.noise_type << \").\";\n            throw tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n        }\n\n\t\tthis->terminal->set_noise(this->noise);\n\n\n\t\tif (this->params_BFER.err_track_revert)\n\t\t{\n\t\t\tthis->release_objects();\n\t\t\tthis->monitor_red->clear_callbacks();\n\n\t\t\t\/\/ dirty hack to override simulation params_BFER\n\t\t\tauto &params_BFER_writable = const_cast<factory::BFER::parameters&>(params_BFER);\n\n\t\t\tstd::stringstream s_noise;\n\t\t\ts_noise << std::setprecision(2) << std::fixed << this->noise.get_noise();\n\n\t\t\tparams_BFER_writable.src     ->path = params_BFER.err_track_path + \"_\" + s_noise.str() + \".src\";\n\t\t\tparams_BFER_writable.cdc->enc->path = params_BFER.err_track_path + \"_\" + s_noise.str() + \".enc\";\n\t\t\tparams_BFER_writable.chn     ->path = params_BFER.err_track_path + \"_\" + s_noise.str() + \".chn\";\n\n\t\t\tstd::ifstream file(params_BFER.chn->path, std::ios::binary);\n\t\t\tif (file.is_open())\n\t\t\t{\n\t\t\t\tfile.read((char*)&max_fra, sizeof(max_fra));\n\t\t\t\tfile.close();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstd::stringstream message;\n\t\t\t\tmessage << \"Impossible to read the 'chn' file ('chn' = \" << params_BFER.chn->path << \").\";\n\t\t\t\tthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n\t\t\t}\n\n\t\t\tthis->build_communication_chain();\n\n\t\t\tif (module::Monitor::is_over())\n\t\t\t{\n\t\t\t\tthis->release_objects();\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tif (params_BFER.display_legend)\n#ifdef ENABLE_MPI\n\t\t\tif (((!params_BFER.ter->disabled && noise_idx == 0 && !params_BFER.debug) ||\n\t\t \t   (params_BFER.statistics && !params_BFER.debug)) && params_BFER.mpi_rank == 0)\n#else\n\t\t\tif (((!params_BFER.ter->disabled && noise_idx == 0 && !params_BFER.debug) ||\n\t\t\t    (params_BFER.statistics && !params_BFER.debug)))\n#endif\n\t\t\t\tterminal->legend(std::cout);\n\n\t\t\/\/ start the terminal to display BER\/FER results\n#ifdef ENABLE_MPI\n\t\tif (!params_BFER.ter->disabled && params_BFER.ter->frequency != std::chrono::nanoseconds(0) && !params_BFER.debug\n\t\t    && params_BFER.mpi_rank == 0)\n#else\n\t\tif (!params_BFER.ter->disabled && params_BFER.ter->frequency != std::chrono::nanoseconds(0) && !params_BFER.debug)\n#endif\n\t\t\tterminal->start_temp_report(params_BFER.ter->frequency);\n\n\t\ttry\n\t\t{\n\t\t\tthis->_launch();\n\t\t}\n\t\tcatch (std::exception const& e)\n\t\t{\n\t\t\tmodule::Monitor::stop();\n\t\t\tterminal->final_report(std::cout); \/\/ display final report to not lost last line overwritten by the error messages\n\n\t\t\tstd::cerr << tools::apply_on_each_line(e.what(), &tools::format_error) << std::endl;\n\t\t\tthis->simu_error = true;\n\t\t}\n\n#ifdef ENABLE_MPI\n\t\tif (!params_BFER.ter->disabled && terminal != nullptr && !this->simu_error && params_BFER.mpi_rank == 0)\n#else\n\t\tif (!params_BFER.ter->disabled && terminal != nullptr && !this->simu_error)\n#endif\n\t\t{\n\t\t\tif (params_BFER.debug)\n\t\t\t\tterminal->legend(std::cout);\n\n\t\t\tterminal->final_report(std::cout);\n\n\t\t\tif (params_BFER.statistics)\n\t\t\t{\n\t\t\t\tstd::vector<std::vector<const module::Module*>> mod_vec;\n\t\t\t\tfor (auto &vm : modules)\n\t\t\t\t{\n\t\t\t\t\tstd::vector<const module::Module*> sub_mod_vec;\n\t\t\t\t\tfor (auto *m : vm.second)\n\t\t\t\t\t\tsub_mod_vec.push_back(m);\n\t\t\t\t\tmod_vec.push_back(sub_mod_vec);\n\t\t\t\t}\n\n\t\t\t\tstd::cout << \"#\" << std::endl;\n\t\t\t\ttools::Stats::show(mod_vec, true, std::cout);\n\t\t\t\tstd::cout << \"#\" << std::endl;\n\t\t\t}\n\t\t}\n\n\t\tif (this->dumper_red != nullptr && !this->simu_error)\n\t\t{\n\t\t\tstd::stringstream s_noise;\n\t\t\ts_noise << std::setprecision(2) << std::fixed << this->noise.get_noise();\n\n\t\t\tthis->dumper_red->dump(params_BFER.err_track_path + \"_\" + s_noise.str());\n\t\t\tthis->dumper_red->clear();\n\t\t}\n\n\t\tif (!params_BFER.err_track_revert && !module::Monitor::is_interrupt() &&\n\t\t    this->monitor_red->get_n_fe() < this->monitor_red->get_fe_limit() &&\n\t\t    (max_fra == 0 || this->monitor_red->get_n_fe() < max_fra))\n\t\t\tmodule::Monitor::stop();\n\n\t\tthis->monitor_red->reset();\n\t\tfor (auto &m : modules)\n\t\t\tfor (auto mm : m.second)\n\t\t\t\tif (mm != nullptr)\n\t\t\t\t\tfor (auto &t : mm->tasks)\n\t\t\t\t\t\tt->reset_stats();\n\n\t\tif (module::Monitor::is_over())\n\t\t\tbreak;\n\t}\n\n\tthis->release_objects();\n}\n\ntemplate <typename B, typename R, typename Q>\nvoid BFER<B,R,Q>\n::release_objects()\n{\n}\n\ntemplate <typename B, typename R, typename Q>\nmodule::Monitor_BFER<B>* BFER<B,R,Q>\n::build_monitor(const int tid)\n{\n\treturn factory::Monitor_BFER::build<B>(*params_BFER.mnt);\n}\n\ntemplate <typename B, typename R, typename Q>\ntools::Terminal_BFER<B>* BFER<B,R,Q>\n::build_terminal()\n{\n\treturn factory::Terminal_BFER::build<B>(*params_BFER.ter, *this->monitor_red);\n}\n\ntemplate <typename B, typename R, typename Q>\nvoid BFER<B,R,Q>\n::start_thread_build_comm_chain(BFER<B,R,Q> *simu, const int tid)\n{\n\ttry\n\t{\n\t\tsimu->__build_communication_chain(tid);\n\n\t\tif (simu->params_BFER.err_track_enable)\n\t\t\tsimu->monitor[tid]->add_handler_fe(std::bind(&tools::Dumper::add, simu->dumper[tid], std::placeholders::_1, std::placeholders::_2));\n\t}\n\tcatch (std::exception const& e)\n\t{\n\t\tmodule::Monitor::stop();\n\t\tsimu->simu_error = true;\n\n\t\tsimu->mutex_exception.lock();\n\n\t\tauto save = tools::exception::no_backtrace;\n\t\ttools::exception::no_backtrace = true;\n\t\tstd::string msg = e.what(); \/\/ get only the function signature\n\t\ttools::exception::no_backtrace = save;\n\n\t\tif (std::find(simu->prev_err_messages.begin(), simu->prev_err_messages.end(), msg) == simu->prev_err_messages.end())\n\t\t{\n\t\t\tstd::cerr << tools::apply_on_each_line(e.what(), &tools::format_error) << std::endl; \/\/ with backtrace if debug mode\n\t\t\tsimu->prev_err_messages.push_back(msg); \/\/ save only the function signature\n\t\t}\n\t\tsimu->mutex_exception.unlock();\n\t}\n}\n\n\/\/ ==================================================================================== explicit template instantiation\n#include \"Tools\/types.h\"\n#ifdef MULTI_PREC\ntemplate class aff3ct::simulation::BFER<B_8,R_8,Q_8>;\ntemplate class aff3ct::simulation::BFER<B_16,R_16,Q_16>;\ntemplate class aff3ct::simulation::BFER<B_32,R_32,Q_32>;\ntemplate class aff3ct::simulation::BFER<B_64,R_64,Q_64>;\n#else\ntemplate class aff3ct::simulation::BFER<B,R,Q>;\n#endif\n\/\/ ==================================================================================== explicit template instantiation\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\/mapping\/2d\/tsdf_range_data_inserter_2d.h\"\n\n#include \"cartographer\/mapping\/internal\/2d\/normal_estimation_2d.h\"\n#include \"cartographer\/mapping\/internal\/2d\/ray_to_pixel_mask.h\"\n\nnamespace cartographer {\nnamespace mapping {\nnamespace {\n\n\/\/ Factor for subpixel accuracy of start and end point for ray casts.\nconstexpr int kSubpixelScale = 1000;\n\/\/ Minimum distance between range observation and origin. Otherwise, range\n\/\/ observations are discarded.\nconstexpr float kMinRangeMeters = 1e-6f;\nconstexpr float kSqrtTwoPi = std::sqrt(2.0 * M_PI);\n\nvoid GrowAsNeeded(const sensor::RangeData& range_data,\n                  const float truncation_distance, TSDF2D* const tsdf) {\n  Eigen::AlignedBox2f bounding_box(range_data.origin.head<2>());\n  for (const Eigen::Vector3f& hit : range_data.returns) {\n    const Eigen::Vector3f direction = (hit - range_data.origin).normalized();\n    const Eigen::Vector3f end_position = hit + truncation_distance * direction;\n    bounding_box.extend(end_position.head<2>());\n  }\n  \/\/ Padding around bounding box to avoid numerical issues at cell boundaries.\n  constexpr float kPadding = 1e-6f;\n  tsdf->GrowLimits(bounding_box.min() - kPadding * Eigen::Vector2f::Ones());\n  tsdf->GrowLimits(bounding_box.max() + kPadding * Eigen::Vector2f::Ones());\n}\n\nfloat GaussianKernel(const float x, const float sigma) {\n  return 1.0 \/ (kSqrtTwoPi * sigma) * std::exp(-0.5 * x * x \/ (sigma * sigma));\n}\n\nstd::pair<Eigen::Array2i, Eigen::Array2i> SuperscaleRay(\n    const Eigen::Vector2f& begin, const Eigen::Vector2f& end,\n    TSDF2D* const tsdf) {\n  const MapLimits& limits = tsdf->limits();\n  const double superscaled_resolution = limits.resolution() \/ kSubpixelScale;\n  const MapLimits superscaled_limits(\n      superscaled_resolution, limits.max(),\n      CellLimits(limits.cell_limits().num_x_cells * kSubpixelScale,\n                 limits.cell_limits().num_y_cells * kSubpixelScale));\n\n  const Eigen::Array2i superscaled_begin =\n      superscaled_limits.GetCellIndex(begin);\n  const Eigen::Array2i superscaled_end = superscaled_limits.GetCellIndex(end);\n  return std::make_pair(superscaled_begin, superscaled_end);\n}\n\nstruct RangeDataSorter {\n  RangeDataSorter(Eigen::Vector3f origin) { origin_ = origin.head<2>(); }\n  bool operator()(Eigen::Vector3f lhs, Eigen::Vector3f rhs) {\n    const Eigen::Vector2f delta_lhs = (lhs.head<2>() - origin_).normalized();\n    const Eigen::Vector2f delta_rhs = (lhs.head<2>() - origin_).normalized();\n    if ((delta_lhs[1] < 0.f) != (delta_rhs[1] < 0.f)) {\n      return delta_lhs[1] < 0.f;\n    } else if (delta_lhs[1] < 0.f) {\n      return delta_lhs[0] < delta_rhs[0];\n    } else {\n      return delta_lhs[0] > delta_rhs[0];\n    }\n  }\n\n private:\n  Eigen::Vector2f origin_;\n};\n\nfloat ComputeRangeWeightFactor(float range, int exponent) {\n  float weight = 0.f;\n  if (std::abs(range) > kMinRangeMeters) {\n    weight = 1.f \/ (std::pow(range, exponent));\n  }\n  return weight;\n}\n}  \/\/ namespace\n\nproto::TSDFRangeDataInserterOptions2D CreateTSDFRangeDataInserterOptions2D(\n    common::LuaParameterDictionary* parameter_dictionary) {\n  proto::TSDFRangeDataInserterOptions2D options;\n  options.set_truncation_distance(\n      parameter_dictionary->GetDouble(\"truncation_distance\"));\n  options.set_maximum_weight(parameter_dictionary->GetDouble(\"maximum_weight\"));\n  options.set_update_free_space(\n      parameter_dictionary->GetBool(\"update_free_space\"));\n  *options\n       .mutable_normal_estimation_options() = CreateNormalEstimationOptions2D(\n      parameter_dictionary->GetDictionary(\"normal_estimation_options\").get());\n  options.set_project_sdf_distance_to_scan_normal(\n      parameter_dictionary->GetBool(\"project_sdf_distance_to_scan_normal\"));\n  options.set_update_weight_range_exponent(\n      parameter_dictionary->GetInt(\"update_weight_range_exponent\"));\n  options.set_update_weight_angle_scan_normal_to_ray_kernel_bandwith(\n      parameter_dictionary->GetDouble(\n          \"update_weight_angle_scan_normal_to_ray_kernel_bandwith\"));\n  options.set_update_weight_distance_cell_to_hit_kernel_bandwith(\n      parameter_dictionary->GetDouble(\n          \"update_weight_distance_cell_to_hit_kernel_bandwith\"));\n  return options;\n}\n\nTSDFRangeDataInserter2D::TSDFRangeDataInserter2D(\n    const proto::TSDFRangeDataInserterOptions2D& options)\n    : options_(options) {}\n\n\/\/ Casts a ray from origin towards hit for each hit in range data.\n\/\/ If 'options.update_free_space' is 'true', all cells along the ray\n\/\/ until 'truncation_distance' behind hit are updated. Otherwise, only the cells\n\/\/ within 'truncation_distance' around hit are updated.\nvoid TSDFRangeDataInserter2D::Insert(const sensor::RangeData& range_data,\n                                     GridInterface* grid) const {\n  const float truncation_distance =\n      static_cast<float>(options_.truncation_distance());\n  TSDF2D* tsdf = static_cast<TSDF2D*>(grid);\n  GrowAsNeeded(range_data, truncation_distance, tsdf);\n\n  \/\/ Compute normals if needed.\n  bool scale_update_weight_angle_scan_normal_to_ray =\n      options_.update_weight_angle_scan_normal_to_ray_kernel_bandwith() != 0.f;\n  sensor::RangeData sorted_range_data = range_data;\n  std::vector<float> normals;\n  if (options_.project_sdf_distance_to_scan_normal() ||\n      scale_update_weight_angle_scan_normal_to_ray) {\n    std::sort(sorted_range_data.returns.begin(),\n              sorted_range_data.returns.end(),\n              RangeDataSorter(sorted_range_data.origin));\n    normals = EstimateNormals(sorted_range_data,\n                              options_.normal_estimation_options());\n  }\n\n  const Eigen::Vector2f origin = sorted_range_data.origin.head<2>();\n  for (size_t hit_index = 0; hit_index < sorted_range_data.returns.size();\n       ++hit_index) {\n    const Eigen::Vector2f hit = sorted_range_data.returns[hit_index].head<2>();\n    const float normal = normals.empty()\n                             ? std::numeric_limits<float>::quiet_NaN()\n                             : normals[hit_index];\n    InsertHit(options_, hit, origin, normal, tsdf);\n  }\n  tsdf->FinishUpdate();\n}\n\nvoid TSDFRangeDataInserter2D::InsertHit(\n    const proto::TSDFRangeDataInserterOptions2D& options,\n    const Eigen::Vector2f& hit, const Eigen::Vector2f& origin, float normal,\n    TSDF2D* tsdf) const {\n  const Eigen::Vector2f ray = hit - origin;\n  const float range = ray.norm();\n  const float truncation_distance =\n      static_cast<float>(options_.truncation_distance());\n  if (range < truncation_distance) return;\n  const float truncation_ratio = truncation_distance \/ range;\n  const Eigen::Vector2f ray_begin =\n      options_.update_free_space() ? origin\n                                   : origin + (1.0f - truncation_ratio) * ray;\n  const Eigen::Vector2f ray_end = origin + (1.0f + truncation_ratio) * ray;\n  std::pair<Eigen::Array2i, Eigen::Array2i> superscaled_ray =\n      SuperscaleRay(ray_begin, ray_end, tsdf);\n  std::vector<Eigen::Array2i> ray_mask = RayToPixelMask(\n      superscaled_ray.first, superscaled_ray.second, kSubpixelScale);\n\n  \/\/ Precompute weight factors.\n  float weight_factor_angle_ray_normal = 1.f;\n  if (options_.update_weight_angle_scan_normal_to_ray_kernel_bandwith() !=\n      0.f) {\n    const Eigen::Vector2f negative_ray = -ray;\n    float angle_ray_normal =\n        common::NormalizeAngleDifference(normal - common::atan2(negative_ray));\n    weight_factor_angle_ray_normal = GaussianKernel(\n        angle_ray_normal,\n        options_.update_weight_angle_scan_normal_to_ray_kernel_bandwith());\n  }\n  float weight_factor_range = 1.f;\n  if (options_.update_weight_range_exponent() != 0) {\n    weight_factor_range = ComputeRangeWeightFactor(\n        range, options_.update_weight_range_exponent());\n  }\n\n  \/\/ Update Cells.\n  for (const Eigen::Array2i& cell_index : ray_mask) {\n    if (tsdf->CellIsUpdated(cell_index)) continue;\n    Eigen::Vector2f cell_center = tsdf->limits().GetCellCenter(cell_index);\n    float distance_cell_to_origin = (cell_center - origin).norm();\n    float update_tsd = range - distance_cell_to_origin;\n    if (options_.project_sdf_distance_to_scan_normal()) {\n      float normal_orientation = normal;\n      update_tsd = (cell_center - hit)\n                       .dot(Eigen::Vector2f{std::cos(normal_orientation),\n                                            std::sin(normal_orientation)});\n    }\n    update_tsd =\n        common::Clamp(update_tsd, -truncation_distance, truncation_distance);\n    float update_weight = weight_factor_range * weight_factor_angle_ray_normal;\n    if (options_.update_weight_distance_cell_to_hit_kernel_bandwith() != 0.f) {\n      update_weight *= GaussianKernel(\n          update_tsd,\n          options_.update_weight_distance_cell_to_hit_kernel_bandwith());\n    }\n    UpdateCell(cell_index, update_tsd, update_weight, tsdf);\n  }\n}\n\nvoid TSDFRangeDataInserter2D::UpdateCell(const Eigen::Array2i& cell,\n                                         float update_sdf, float update_weight,\n                                         TSDF2D* tsdf) const {\n  if (update_weight == 0.f) return;\n  const std::pair<float, float> tsd_and_weight = tsdf->GetTSDAndWeight(cell);\n  float updated_weight = tsd_and_weight.second + update_weight;\n  float updated_sdf = (tsd_and_weight.first * tsd_and_weight.second +\n                       update_sdf * update_weight) \/\n                      updated_weight;\n  updated_weight =\n      std::min(updated_weight, static_cast<float>(options_.maximum_weight()));\n  tsdf->SetCell(cell, updated_sdf, updated_weight);\n}\n\n}  \/\/ namespace mapping\n}  \/\/ namespace cartographer\n<commit_msg>Make kSqrtTwoPi const. (#1259)<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\/mapping\/2d\/tsdf_range_data_inserter_2d.h\"\n\n#include \"cartographer\/mapping\/internal\/2d\/normal_estimation_2d.h\"\n#include \"cartographer\/mapping\/internal\/2d\/ray_to_pixel_mask.h\"\n\nnamespace cartographer {\nnamespace mapping {\nnamespace {\n\n\/\/ Factor for subpixel accuracy of start and end point for ray casts.\nconstexpr int kSubpixelScale = 1000;\n\/\/ Minimum distance between range observation and origin. Otherwise, range\n\/\/ observations are discarded.\nconstexpr float kMinRangeMeters = 1e-6f;\nconst float kSqrtTwoPi = std::sqrt(2.0 * M_PI);\n\nvoid GrowAsNeeded(const sensor::RangeData& range_data,\n                  const float truncation_distance, TSDF2D* const tsdf) {\n  Eigen::AlignedBox2f bounding_box(range_data.origin.head<2>());\n  for (const Eigen::Vector3f& hit : range_data.returns) {\n    const Eigen::Vector3f direction = (hit - range_data.origin).normalized();\n    const Eigen::Vector3f end_position = hit + truncation_distance * direction;\n    bounding_box.extend(end_position.head<2>());\n  }\n  \/\/ Padding around bounding box to avoid numerical issues at cell boundaries.\n  constexpr float kPadding = 1e-6f;\n  tsdf->GrowLimits(bounding_box.min() - kPadding * Eigen::Vector2f::Ones());\n  tsdf->GrowLimits(bounding_box.max() + kPadding * Eigen::Vector2f::Ones());\n}\n\nfloat GaussianKernel(const float x, const float sigma) {\n  return 1.0 \/ (kSqrtTwoPi * sigma) * std::exp(-0.5 * x * x \/ (sigma * sigma));\n}\n\nstd::pair<Eigen::Array2i, Eigen::Array2i> SuperscaleRay(\n    const Eigen::Vector2f& begin, const Eigen::Vector2f& end,\n    TSDF2D* const tsdf) {\n  const MapLimits& limits = tsdf->limits();\n  const double superscaled_resolution = limits.resolution() \/ kSubpixelScale;\n  const MapLimits superscaled_limits(\n      superscaled_resolution, limits.max(),\n      CellLimits(limits.cell_limits().num_x_cells * kSubpixelScale,\n                 limits.cell_limits().num_y_cells * kSubpixelScale));\n\n  const Eigen::Array2i superscaled_begin =\n      superscaled_limits.GetCellIndex(begin);\n  const Eigen::Array2i superscaled_end = superscaled_limits.GetCellIndex(end);\n  return std::make_pair(superscaled_begin, superscaled_end);\n}\n\nstruct RangeDataSorter {\n  RangeDataSorter(Eigen::Vector3f origin) { origin_ = origin.head<2>(); }\n  bool operator()(Eigen::Vector3f lhs, Eigen::Vector3f rhs) {\n    const Eigen::Vector2f delta_lhs = (lhs.head<2>() - origin_).normalized();\n    const Eigen::Vector2f delta_rhs = (lhs.head<2>() - origin_).normalized();\n    if ((delta_lhs[1] < 0.f) != (delta_rhs[1] < 0.f)) {\n      return delta_lhs[1] < 0.f;\n    } else if (delta_lhs[1] < 0.f) {\n      return delta_lhs[0] < delta_rhs[0];\n    } else {\n      return delta_lhs[0] > delta_rhs[0];\n    }\n  }\n\n private:\n  Eigen::Vector2f origin_;\n};\n\nfloat ComputeRangeWeightFactor(float range, int exponent) {\n  float weight = 0.f;\n  if (std::abs(range) > kMinRangeMeters) {\n    weight = 1.f \/ (std::pow(range, exponent));\n  }\n  return weight;\n}\n}  \/\/ namespace\n\nproto::TSDFRangeDataInserterOptions2D CreateTSDFRangeDataInserterOptions2D(\n    common::LuaParameterDictionary* parameter_dictionary) {\n  proto::TSDFRangeDataInserterOptions2D options;\n  options.set_truncation_distance(\n      parameter_dictionary->GetDouble(\"truncation_distance\"));\n  options.set_maximum_weight(parameter_dictionary->GetDouble(\"maximum_weight\"));\n  options.set_update_free_space(\n      parameter_dictionary->GetBool(\"update_free_space\"));\n  *options\n       .mutable_normal_estimation_options() = CreateNormalEstimationOptions2D(\n      parameter_dictionary->GetDictionary(\"normal_estimation_options\").get());\n  options.set_project_sdf_distance_to_scan_normal(\n      parameter_dictionary->GetBool(\"project_sdf_distance_to_scan_normal\"));\n  options.set_update_weight_range_exponent(\n      parameter_dictionary->GetInt(\"update_weight_range_exponent\"));\n  options.set_update_weight_angle_scan_normal_to_ray_kernel_bandwith(\n      parameter_dictionary->GetDouble(\n          \"update_weight_angle_scan_normal_to_ray_kernel_bandwith\"));\n  options.set_update_weight_distance_cell_to_hit_kernel_bandwith(\n      parameter_dictionary->GetDouble(\n          \"update_weight_distance_cell_to_hit_kernel_bandwith\"));\n  return options;\n}\n\nTSDFRangeDataInserter2D::TSDFRangeDataInserter2D(\n    const proto::TSDFRangeDataInserterOptions2D& options)\n    : options_(options) {}\n\n\/\/ Casts a ray from origin towards hit for each hit in range data.\n\/\/ If 'options.update_free_space' is 'true', all cells along the ray\n\/\/ until 'truncation_distance' behind hit are updated. Otherwise, only the cells\n\/\/ within 'truncation_distance' around hit are updated.\nvoid TSDFRangeDataInserter2D::Insert(const sensor::RangeData& range_data,\n                                     GridInterface* grid) const {\n  const float truncation_distance =\n      static_cast<float>(options_.truncation_distance());\n  TSDF2D* tsdf = static_cast<TSDF2D*>(grid);\n  GrowAsNeeded(range_data, truncation_distance, tsdf);\n\n  \/\/ Compute normals if needed.\n  bool scale_update_weight_angle_scan_normal_to_ray =\n      options_.update_weight_angle_scan_normal_to_ray_kernel_bandwith() != 0.f;\n  sensor::RangeData sorted_range_data = range_data;\n  std::vector<float> normals;\n  if (options_.project_sdf_distance_to_scan_normal() ||\n      scale_update_weight_angle_scan_normal_to_ray) {\n    std::sort(sorted_range_data.returns.begin(),\n              sorted_range_data.returns.end(),\n              RangeDataSorter(sorted_range_data.origin));\n    normals = EstimateNormals(sorted_range_data,\n                              options_.normal_estimation_options());\n  }\n\n  const Eigen::Vector2f origin = sorted_range_data.origin.head<2>();\n  for (size_t hit_index = 0; hit_index < sorted_range_data.returns.size();\n       ++hit_index) {\n    const Eigen::Vector2f hit = sorted_range_data.returns[hit_index].head<2>();\n    const float normal = normals.empty()\n                             ? std::numeric_limits<float>::quiet_NaN()\n                             : normals[hit_index];\n    InsertHit(options_, hit, origin, normal, tsdf);\n  }\n  tsdf->FinishUpdate();\n}\n\nvoid TSDFRangeDataInserter2D::InsertHit(\n    const proto::TSDFRangeDataInserterOptions2D& options,\n    const Eigen::Vector2f& hit, const Eigen::Vector2f& origin, float normal,\n    TSDF2D* tsdf) const {\n  const Eigen::Vector2f ray = hit - origin;\n  const float range = ray.norm();\n  const float truncation_distance =\n      static_cast<float>(options_.truncation_distance());\n  if (range < truncation_distance) return;\n  const float truncation_ratio = truncation_distance \/ range;\n  const Eigen::Vector2f ray_begin =\n      options_.update_free_space() ? origin\n                                   : origin + (1.0f - truncation_ratio) * ray;\n  const Eigen::Vector2f ray_end = origin + (1.0f + truncation_ratio) * ray;\n  std::pair<Eigen::Array2i, Eigen::Array2i> superscaled_ray =\n      SuperscaleRay(ray_begin, ray_end, tsdf);\n  std::vector<Eigen::Array2i> ray_mask = RayToPixelMask(\n      superscaled_ray.first, superscaled_ray.second, kSubpixelScale);\n\n  \/\/ Precompute weight factors.\n  float weight_factor_angle_ray_normal = 1.f;\n  if (options_.update_weight_angle_scan_normal_to_ray_kernel_bandwith() !=\n      0.f) {\n    const Eigen::Vector2f negative_ray = -ray;\n    float angle_ray_normal =\n        common::NormalizeAngleDifference(normal - common::atan2(negative_ray));\n    weight_factor_angle_ray_normal = GaussianKernel(\n        angle_ray_normal,\n        options_.update_weight_angle_scan_normal_to_ray_kernel_bandwith());\n  }\n  float weight_factor_range = 1.f;\n  if (options_.update_weight_range_exponent() != 0) {\n    weight_factor_range = ComputeRangeWeightFactor(\n        range, options_.update_weight_range_exponent());\n  }\n\n  \/\/ Update Cells.\n  for (const Eigen::Array2i& cell_index : ray_mask) {\n    if (tsdf->CellIsUpdated(cell_index)) continue;\n    Eigen::Vector2f cell_center = tsdf->limits().GetCellCenter(cell_index);\n    float distance_cell_to_origin = (cell_center - origin).norm();\n    float update_tsd = range - distance_cell_to_origin;\n    if (options_.project_sdf_distance_to_scan_normal()) {\n      float normal_orientation = normal;\n      update_tsd = (cell_center - hit)\n                       .dot(Eigen::Vector2f{std::cos(normal_orientation),\n                                            std::sin(normal_orientation)});\n    }\n    update_tsd =\n        common::Clamp(update_tsd, -truncation_distance, truncation_distance);\n    float update_weight = weight_factor_range * weight_factor_angle_ray_normal;\n    if (options_.update_weight_distance_cell_to_hit_kernel_bandwith() != 0.f) {\n      update_weight *= GaussianKernel(\n          update_tsd,\n          options_.update_weight_distance_cell_to_hit_kernel_bandwith());\n    }\n    UpdateCell(cell_index, update_tsd, update_weight, tsdf);\n  }\n}\n\nvoid TSDFRangeDataInserter2D::UpdateCell(const Eigen::Array2i& cell,\n                                         float update_sdf, float update_weight,\n                                         TSDF2D* tsdf) const {\n  if (update_weight == 0.f) return;\n  const std::pair<float, float> tsd_and_weight = tsdf->GetTSDAndWeight(cell);\n  float updated_weight = tsd_and_weight.second + update_weight;\n  float updated_sdf = (tsd_and_weight.first * tsd_and_weight.second +\n                       update_sdf * update_weight) \/\n                      updated_weight;\n  updated_weight =\n      std::min(updated_weight, static_cast<float>(options_.maximum_weight()));\n  tsdf->SetCell(cell, updated_sdf, updated_weight);\n}\n\n}  \/\/ namespace mapping\n}  \/\/ namespace cartographer\n<|endoftext|>"}
{"text":"<commit_before>#define LOG_MODULE PacketLogModuleDnsLayer\n\n#include \"DnsResource.h\"\n#include \"Logger.h\"\n#include <sstream>\n#include <string.h>\n#include \"EndianPortable.h\"\n\nnamespace pcpp\n{\n\nIDnsResource::IDnsResource(DnsLayer* dnsLayer, size_t offsetInLayer)\n\t: m_DnsLayer(dnsLayer), m_OffsetInLayer(offsetInLayer), m_NextResource(NULL)\n{\n\tchar decodedName[256];\n\tm_NameLength = decodeName((const char*)getRawData(), decodedName);\n\tm_DecodedName = decodedName;\n}\n\nIDnsResource::IDnsResource(uint8_t* emptyRawData)\n\t: m_DnsLayer(NULL), m_OffsetInLayer(0), m_NextResource(NULL), m_DecodedName(\"\"), m_NameLength(0), m_ExternalRawData(emptyRawData)\n{\n}\n\nuint8_t* IDnsResource::getRawData() const\n{\n\tif (m_DnsLayer == NULL)\n\t\treturn m_ExternalRawData;\n\n\treturn m_DnsLayer->m_Data + m_OffsetInLayer;\n}\n\nsize_t IDnsResource::decodeName(const char* encodedName, char* result, int iteration)\n{\n\tsize_t encodedNameLength = 0;\n\tchar* resultPtr = result;\n\tresultPtr[0] = 0;\n\n\tsize_t curOffsetInLayer = (uint8_t*)encodedName - m_DnsLayer->m_Data;\n\tif (curOffsetInLayer + 1 > m_DnsLayer->m_DataLen)\n\t\treturn encodedNameLength;\n\n\tif (iteration > 20)\n\t\treturn encodedNameLength;\n\n\tuint8_t wordLength = encodedName[0];\n\n\t\/\/ A string to parse\n\twhile (wordLength != 0)\n\t{\n\t\t\/\/ A pointer to another place in the packet\n\t\tif ((wordLength & 0xc0) == 0xc0)\n\t\t{\n\t\t\tif (curOffsetInLayer + 2 > m_DnsLayer->m_DataLen)\n\t\t\t\treturn encodedNameLength;\n\n\t\t\tuint16_t offsetInLayer = (wordLength & 0x3f)*256 + (0xFF & encodedName[1]);\n\t\t\tif (offsetInLayer < sizeof(dnshdr) || offsetInLayer >= m_DnsLayer->m_DataLen)\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"DNS parsing error: name pointer is illegal\");\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tchar tempResult[256];\n\t\t\tint i = 0;\n\t\t\tdecodeName((const char*)(m_DnsLayer->m_Data + offsetInLayer), tempResult, iteration+1);\n\t\t\twhile (tempResult[i] != 0)\n\t\t\t{\n\t\t\t\tresultPtr[0] = tempResult[i++];\n\t\t\t\tresultPtr++;\n\t\t\t}\n\n\t\t\tresultPtr[0] = 0;\n\n\t\t\t\/\/ in this case the length of the pointer is: 1B for 0xc0 + 1B for the offset itself\n\t\t\treturn encodedNameLength + sizeof(uint16_t);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ return if next word would be outside of the DNS layer or overflow the buffer behind resultPtr\n\t\t\tif (curOffsetInLayer + wordLength + 1 > m_DnsLayer->m_DataLen || encodedNameLength + wordLength > 255)\n\t\t\t{\n\t\t\t\t\/\/ add the last '\\0' to the decoded string\n\t\t\t\tif (encodedNameLength == 256)\n\t\t\t\t\tresultPtr--;\n\t\t\t\telse\n\t\t\t\t\tencodedNameLength++;\n\t\t\t\t\n\t\t\t\tresultPtr[0] = 0;\t\n\t\t\t\treturn encodedNameLength;\n\t\t\t}\n\t\t\t\t\n\n\t\t\tmemcpy(resultPtr, encodedName+1, wordLength);\n\t\t\tresultPtr += wordLength;\n\t\t\tresultPtr[0] = '.';\n\t\t\tresultPtr++;\n\t\t\tencodedName += wordLength + 1;\n\t\t\tencodedNameLength += wordLength + 1;\n\n\t\t\tcurOffsetInLayer = (uint8_t*)encodedName - m_DnsLayer->m_Data;\n\t\t\tif (curOffsetInLayer + 1 > m_DnsLayer->m_DataLen)\n\t\t\t{\n\t\t\t\t\/\/ add the last '\\0' to the decoded string\n\t\t\t\tif (encodedNameLength == 256)\n\t\t\t\t\tresultPtr--;\n\t\t\t\telse\n\t\t\t\t\tencodedNameLength++;\n\t\t\t\t\n\t\t\t\tresultPtr[0] = 0;\t\n\t\t\t\treturn encodedNameLength;\n\t\t\t}\n\n\t\t\twordLength = encodedName[0];\n\t\t}\n\t}\n\n\t\/\/ remove the last \".\"\n\tif (resultPtr > result)\n\t{\n\t\tresult[resultPtr - result - 1] = 0;\n\t}\n\n\t\/\/ add the last '\\0' to encodedNameLength\n\tresultPtr[0] = 0;\n\tencodedNameLength++;\n\n\treturn encodedNameLength;\n}\n\n\nvoid IDnsResource::encodeName(const std::string& decodedName, char* result, size_t& resultLen)\n{\n\tresultLen = 0;\n\tstd::stringstream strstream(decodedName);\n    std::string word;\n    while (getline(strstream, word, '.'))\n    {\n    \t\/\/ pointer to a different hostname in the packet\n    \tif (word[0] == '#')\n    \t{\n    \t\t\/\/ convert the number from string to int\n    \t\tstd::stringstream stream(word.substr(1));\n    \t\tint pointerInPacket = 0;\n    \t\tstream >> pointerInPacket;\n\n    \t\t\/\/ verify it's indeed a number and that is in the range of [0-255]\n    \t\tif (stream.fail() || pointerInPacket < 0 || pointerInPacket > 0xff)\n    \t\t{\n    \t\t\tLOG_ERROR(\"Error encoding the string '%s'\", decodedName.c_str());\n    \t\t\treturn;\n    \t\t}\n\n    \t\t\/\/ set the pointer to the encoded string result\n    \t\tresult[0] = (uint8_t)0xc0;\n    \t\tresult[1] = (uint8_t)pointerInPacket;\n    \t\tresult += 2;\n    \t\tresultLen += 2;\n    \t\treturn; \/\/ pointer always comes last\n    \t}\n\n    \tresult[0] = word.length();\n    \tresult++;\n    \tmemcpy(result, word.c_str(), word.length());\n    \tresult += word.length();\n    \tresultLen += word.length() + 1;\n    }\n\n    result[0] = 0;\n    resultLen++;\n}\n\n\nDnsType IDnsResource::getDnsType() const\n{\n\tuint16_t dnsType = *(uint16_t*)(getRawData() + m_NameLength);\n\treturn (DnsType)be16toh(dnsType);\n}\n\nvoid IDnsResource::setDnsType(DnsType newType)\n{\n\tuint16_t newTypeAsInt = htobe16((uint16_t)newType);\n\tmemcpy(getRawData() + m_NameLength, &newTypeAsInt, sizeof(uint16_t));\n}\n\nDnsClass IDnsResource::getDnsClass() const\n{\n\tuint16_t dnsClass = *(uint16_t*)(getRawData() + m_NameLength + sizeof(uint16_t));\n\treturn (DnsClass)be16toh(dnsClass);\n}\n\nvoid IDnsResource::setDnsClass(DnsClass newClass)\n{\n\tuint16_t newClassAsInt = htobe16((uint16_t)newClass);\n\tmemcpy(getRawData() + m_NameLength + sizeof(uint16_t), &newClassAsInt, sizeof(uint16_t));\n}\n\nbool IDnsResource::setName(const std::string& newName)\n{\n\tchar encodedName[256];\n\tsize_t encodedNameLen = 0;\n\tencodeName(newName, encodedName, encodedNameLen);\n\tif (m_DnsLayer != NULL)\n\t{\n\t\tif (encodedNameLen > m_NameLength)\n\t\t{\n\t\t\tif (!m_DnsLayer->extendLayer(m_OffsetInLayer, encodedNameLen-m_NameLength, this))\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"Couldn't set name for DNS query, unable to extend layer\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse if (encodedNameLen < m_NameLength)\n\t\t{\n\t\t\tif (!m_DnsLayer->shortenLayer(m_OffsetInLayer, m_NameLength-encodedNameLen, this))\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"Couldn't set name for DNS query, unable to shorten layer\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tsize_t size = getSize();\n\t\tchar* tempData = new char[size];\n\t\tmemcpy(tempData, m_ExternalRawData, size);\n\t\tmemcpy(m_ExternalRawData + encodedNameLen, tempData, size);\n\t\tdelete[] tempData;\n\t}\n\n\tmemcpy(getRawData(), encodedName, encodedNameLen);\n\tm_NameLength = encodedNameLen;\n\tm_DecodedName = newName;\n\n\treturn true;\n}\n\nvoid IDnsResource::setDnsLayer(DnsLayer* dnsLayer, size_t offsetInLayer)\n{\n\tmemcpy(dnsLayer->m_Data + offsetInLayer, m_ExternalRawData, getSize());\n\tm_DnsLayer = dnsLayer;\n\tm_OffsetInLayer = offsetInLayer;\n\tm_ExternalRawData = NULL;\n}\n\nuint32_t DnsResource::getTTL() const\n{\n\tuint32_t ttl = *(uint32_t*)(getRawData() + m_NameLength + 2*sizeof(uint16_t));\n\treturn be32toh(ttl);\n}\n\nvoid DnsResource::setTTL(uint32_t newTTL)\n{\n\tnewTTL = htobe32(newTTL);\n\tmemcpy(getRawData() + m_NameLength + 2*sizeof(uint16_t), &newTTL, sizeof(uint32_t));\n}\n\nsize_t DnsResource::getDataLength() const\n{\n\tuint16_t dataLength = *(uint16_t*)(getRawData() + m_NameLength + 2*sizeof(uint16_t) + sizeof(uint32_t));\n\treturn be16toh(dataLength);\n}\n\nDnsResourceDataPtr DnsResource::getData() const\n{\n\tuint8_t* resourceRawData = getRawData() + m_NameLength + 3*sizeof(uint16_t) + sizeof(uint32_t);\n\tsize_t dataLength = getDataLength();\n\n\tswitch (getDnsType())\n\t{\n\tcase DNS_TYPE_A:\n\t{\n\t\treturn DnsResourceDataPtr(new IPv4DnsResourceData(resourceRawData, dataLength));\n\t}\n\n\tcase DNS_TYPE_AAAA:\n\t{\n\t\treturn DnsResourceDataPtr(new IPv6DnsResourceData(resourceRawData, dataLength));\n\t}\n\n\tcase DNS_TYPE_NS:\n\tcase DNS_TYPE_CNAME:\n\tcase DNS_TYPE_DNAM:\n\tcase DNS_TYPE_PTR:\n\t{\n\t\treturn DnsResourceDataPtr(new StringDnsResourceData(resourceRawData, dataLength, const_cast<IDnsResource*>(static_cast<const IDnsResource*>(this))));\n\t}\n\n\tcase DNS_TYPE_MX:\n\t{\n\t\treturn DnsResourceDataPtr(new MxDnsResourceData(resourceRawData, dataLength, const_cast<IDnsResource*>(static_cast<const IDnsResource*>(this))));\n\t}\n\n\tdefault:\n\t{\n\t\treturn DnsResourceDataPtr(new GenericDnsResourceData(resourceRawData, dataLength));\n\t}\n\n\t}\n}\n\nsize_t DnsResource::getDataOffset() const\n{\n\treturn (size_t)(m_OffsetInLayer + m_NameLength + 3*sizeof(uint16_t) + sizeof(uint32_t));\n}\n\nbool DnsResource::setData(IDnsResourceData* data)\n{\n\t\/\/ convert data to byte array according to the DNS type\n\tsize_t dataLength = 0;\n\tuint8_t dataAsByteArr[256];\n\n\tif (data == NULL)\n\t{\n\t\tLOG_ERROR(\"Given data is NULL\");\n\t\treturn false;\n\t}\n\n\tswitch (getDnsType())\n\t{\n\tcase DNS_TYPE_A:\n\t{\n\t\tif (!data->isTypeOf<IPv4DnsResourceData>())\n\t\t{\n\t\t\tLOG_ERROR(\"DNS record is of type A but given data isn't of type IPv4DnsResourceData\");\n\t\t\treturn false;\n\t\t}\n\t\tbreak;\n\t}\n\n\tcase DNS_TYPE_AAAA:\n\t{\n\t\tif (!data->isTypeOf<IPv6DnsResourceData>())\n\t\t{\n\t\t\tLOG_ERROR(\"DNS record is of type AAAA but given data isn't of type IPv6DnsResourceData\");\n\t\t\treturn false;\n\t\t}\n\t\tbreak;\n\t}\n\n\tcase DNS_TYPE_NS:\n\tcase DNS_TYPE_CNAME:\n\tcase DNS_TYPE_DNAM:\n\tcase DNS_TYPE_PTR:\n\t{\n\t\tif (!data->isTypeOf<StringDnsResourceData>())\n\t\t{\n\t\t\tLOG_ERROR(\"DNS record is of type NS, CNAME, DNAM or PTR but given data isn't of type StringDnsResourceData\");\n\t\t\treturn false;\n\t\t}\n\t\tbreak;\n\t}\n\n\tcase DNS_TYPE_MX:\n\t{\n\t\tif (!data->isTypeOf<MxDnsResourceData>())\n\t\t{\n\t\t\tLOG_ERROR(\"DNS record is of type MX but given data isn't of type MxDnsResourceData\");\n\t\t\treturn false;\n\t\t}\n\t\tbreak;\n\t}\n\n\tdefault:\n\t{\n\t\t\/\/ do nothing\n\t}\n\n\t}\n\n\t\/\/ convert the IDnsResourceData to byte array\n\tif (!data->toByteArr(dataAsByteArr, dataLength, this))\n\t{\n\t\tLOG_ERROR(\"Cannot convert DNS resource data to byte array, data is probably invalid\");\n\t\treturn false;\n\t}\n\n\tsize_t dataLengthOffset = m_NameLength + (2*sizeof(uint16_t)) + sizeof(uint32_t);\n\tsize_t dataOffset = dataLengthOffset + sizeof(uint16_t);\n\n\tif (m_DnsLayer != NULL)\n\t{\n\t\tsize_t curLength = getDataLength();\n\t\tif (dataLength > curLength)\n\t\t{\n\t\t\tif (!m_DnsLayer->extendLayer(m_OffsetInLayer + dataOffset, dataLength-curLength, this))\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"Couldn't set data for DNS query, unable to extend layer\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse if (dataLength < curLength)\n\t\t{\n\t\t\tif (!m_DnsLayer->shortenLayer(m_OffsetInLayer + dataOffset, curLength-dataLength, this))\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"Couldn't set data for DNS query, unable to shorten layer\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ write data to resource\n\tmemcpy(getRawData() + dataOffset, dataAsByteArr, dataLength);\n\t\/\/update data length in resource\n\tdataLength = htobe16((uint16_t)dataLength);\n\tmemcpy(getRawData() + dataLengthOffset, &dataLength, sizeof(uint16_t));\n\n\treturn true;\n}\n\nuint16_t DnsResource::getCustomDnsClass() const\n{\n\tuint16_t value = *(uint16_t*)(getRawData() + m_NameLength + sizeof(uint16_t));\n\treturn be16toh(value);\n}\n\nvoid DnsResource::setCustomDnsClass(uint16_t customValue)\n{\n\tmemcpy(getRawData() + m_NameLength + sizeof(uint16_t), &customValue, sizeof(uint16_t));\n}\n\n}\n<commit_msg>Bugfix #424<commit_after>#define LOG_MODULE PacketLogModuleDnsLayer\n\n#include \"DnsResource.h\"\n#include \"Logger.h\"\n#include <sstream>\n#include <string.h>\n#include \"EndianPortable.h\"\n\nnamespace pcpp\n{\n\nIDnsResource::IDnsResource(DnsLayer* dnsLayer, size_t offsetInLayer)\n\t: m_DnsLayer(dnsLayer), m_OffsetInLayer(offsetInLayer), m_NextResource(NULL)\n{\n\tchar decodedName[256];\n\tm_NameLength = decodeName((const char*)getRawData(), decodedName);\n\tm_DecodedName = decodedName;\n}\n\nIDnsResource::IDnsResource(uint8_t* emptyRawData)\n\t: m_DnsLayer(NULL), m_OffsetInLayer(0), m_NextResource(NULL), m_DecodedName(\"\"), m_NameLength(0), m_ExternalRawData(emptyRawData)\n{\n}\n\nuint8_t* IDnsResource::getRawData() const\n{\n\tif (m_DnsLayer == NULL)\n\t\treturn m_ExternalRawData;\n\n\treturn m_DnsLayer->m_Data + m_OffsetInLayer;\n}\n\nsize_t IDnsResource::decodeName(const char* encodedName, char* result, int iteration)\n{\n\tsize_t encodedNameLength = 0;\n\tsize_t decodedNameLength = 0;\n\tchar* resultPtr = result;\n\tresultPtr[0] = 0;\n\n\tsize_t curOffsetInLayer = (uint8_t*)encodedName - m_DnsLayer->m_Data;\n\tif (curOffsetInLayer + 1 > m_DnsLayer->m_DataLen)\n\t\treturn encodedNameLength;\n\n\tif (iteration > 20)\n\t\treturn encodedNameLength;\n\n\tuint8_t wordLength = encodedName[0];\n\n\t\/\/ A string to parse\n\twhile (wordLength != 0)\n\t{\n\t\t\/\/ A pointer to another place in the packet\n\t\tif ((wordLength & 0xc0) == 0xc0)\n\t\t{\n\t\t\tif (curOffsetInLayer + 2 > m_DnsLayer->m_DataLen)\n\t\t\t\treturn encodedNameLength;\n\n\t\t\tuint16_t offsetInLayer = (wordLength & 0x3f)*256 + (0xFF & encodedName[1]);\n\t\t\tif (offsetInLayer < sizeof(dnshdr) || offsetInLayer >= m_DnsLayer->m_DataLen)\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"DNS parsing error: name pointer is illegal\");\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tchar tempResult[256];\n\t\t\tint i = 0;\n\t\t\tdecodeName((const char*)(m_DnsLayer->m_Data + offsetInLayer), tempResult, iteration+1);\n\t\t\twhile (tempResult[i] != 0 && decodedNameLength < 255)\n\t\t\t{\n\t\t\t\tresultPtr[0] = tempResult[i++];\n\t\t\t\tresultPtr++;\n\t\t\t\tdecodedNameLength++;\n\t\t\t}\n\n\t\t\tresultPtr[0] = 0;\n\n\t\t\t\/\/ in this case the length of the pointer is: 1 byte for 0xc0 + 1 byte for the offset itself\n\t\t\treturn encodedNameLength + sizeof(uint16_t);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ return if next word would be outside of the DNS layer or overflow the buffer behind resultPtr\n\t\t\tif (curOffsetInLayer + wordLength + 1 > m_DnsLayer->m_DataLen || encodedNameLength + wordLength > 255)\n\t\t\t{\n\t\t\t\t\/\/ add the last '\\0' to the decoded string\n\t\t\t\tif (encodedNameLength == 256)\n\t\t\t\t{\n\t\t\t\t\tresultPtr--;\n\t\t\t\t\tdecodedNameLength--;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tencodedNameLength++;\n\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\tresultPtr[0] = 0;\n\t\t\t\treturn encodedNameLength;\n\t\t\t}\n\t\t\t\t\n\n\t\t\tmemcpy(resultPtr, encodedName+1, wordLength);\n\t\t\tresultPtr += wordLength;\n\t\t\tresultPtr[0] = '.';\n\t\t\tresultPtr++;\n\t\t\tdecodedNameLength += wordLength + 1;\n\t\t\tencodedName += wordLength + 1;\n\t\t\tencodedNameLength += wordLength + 1;\n\n\t\t\tcurOffsetInLayer = (uint8_t*)encodedName - m_DnsLayer->m_Data;\n\t\t\tif (curOffsetInLayer + 1 > m_DnsLayer->m_DataLen)\n\t\t\t{\n\t\t\t\t\/\/ add the last '\\0' to the decoded string\n\t\t\t\tif (encodedNameLength == 256)\n\t\t\t\t{\n\t\t\t\t\tdecodedNameLength--;\n\t\t\t\t\tresultPtr--;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tencodedNameLength++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tresultPtr[0] = 0;\t\n\t\t\t\treturn encodedNameLength;\n\t\t\t}\n\n\t\t\twordLength = encodedName[0];\n\t\t}\n\t}\n\n\t\/\/ remove the last \".\"\n\tif (resultPtr > result)\n\t{\n\t\tresult[resultPtr - result - 1] = 0;\n\t}\n\n\t\/\/ add the last '\\0' to encodedNameLength\n\tresultPtr[0] = 0;\n\tencodedNameLength++;\n\n\treturn encodedNameLength;\n}\n\n\nvoid IDnsResource::encodeName(const std::string& decodedName, char* result, size_t& resultLen)\n{\n\tresultLen = 0;\n\tstd::stringstream strstream(decodedName);\n    std::string word;\n    while (getline(strstream, word, '.'))\n    {\n    \t\/\/ pointer to a different hostname in the packet\n    \tif (word[0] == '#')\n    \t{\n    \t\t\/\/ convert the number from string to int\n    \t\tstd::stringstream stream(word.substr(1));\n    \t\tint pointerInPacket = 0;\n    \t\tstream >> pointerInPacket;\n\n    \t\t\/\/ verify it's indeed a number and that is in the range of [0-255]\n    \t\tif (stream.fail() || pointerInPacket < 0 || pointerInPacket > 0xff)\n    \t\t{\n    \t\t\tLOG_ERROR(\"Error encoding the string '%s'\", decodedName.c_str());\n    \t\t\treturn;\n    \t\t}\n\n    \t\t\/\/ set the pointer to the encoded string result\n    \t\tresult[0] = (uint8_t)0xc0;\n    \t\tresult[1] = (uint8_t)pointerInPacket;\n    \t\tresult += 2;\n    \t\tresultLen += 2;\n    \t\treturn; \/\/ pointer always comes last\n    \t}\n\n    \tresult[0] = word.length();\n    \tresult++;\n    \tmemcpy(result, word.c_str(), word.length());\n    \tresult += word.length();\n    \tresultLen += word.length() + 1;\n    }\n\n    result[0] = 0;\n    resultLen++;\n}\n\n\nDnsType IDnsResource::getDnsType() const\n{\n\tuint16_t dnsType = *(uint16_t*)(getRawData() + m_NameLength);\n\treturn (DnsType)be16toh(dnsType);\n}\n\nvoid IDnsResource::setDnsType(DnsType newType)\n{\n\tuint16_t newTypeAsInt = htobe16((uint16_t)newType);\n\tmemcpy(getRawData() + m_NameLength, &newTypeAsInt, sizeof(uint16_t));\n}\n\nDnsClass IDnsResource::getDnsClass() const\n{\n\tuint16_t dnsClass = *(uint16_t*)(getRawData() + m_NameLength + sizeof(uint16_t));\n\treturn (DnsClass)be16toh(dnsClass);\n}\n\nvoid IDnsResource::setDnsClass(DnsClass newClass)\n{\n\tuint16_t newClassAsInt = htobe16((uint16_t)newClass);\n\tmemcpy(getRawData() + m_NameLength + sizeof(uint16_t), &newClassAsInt, sizeof(uint16_t));\n}\n\nbool IDnsResource::setName(const std::string& newName)\n{\n\tchar encodedName[256];\n\tsize_t encodedNameLen = 0;\n\tencodeName(newName, encodedName, encodedNameLen);\n\tif (m_DnsLayer != NULL)\n\t{\n\t\tif (encodedNameLen > m_NameLength)\n\t\t{\n\t\t\tif (!m_DnsLayer->extendLayer(m_OffsetInLayer, encodedNameLen-m_NameLength, this))\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"Couldn't set name for DNS query, unable to extend layer\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse if (encodedNameLen < m_NameLength)\n\t\t{\n\t\t\tif (!m_DnsLayer->shortenLayer(m_OffsetInLayer, m_NameLength-encodedNameLen, this))\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"Couldn't set name for DNS query, unable to shorten layer\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tsize_t size = getSize();\n\t\tchar* tempData = new char[size];\n\t\tmemcpy(tempData, m_ExternalRawData, size);\n\t\tmemcpy(m_ExternalRawData + encodedNameLen, tempData, size);\n\t\tdelete[] tempData;\n\t}\n\n\tmemcpy(getRawData(), encodedName, encodedNameLen);\n\tm_NameLength = encodedNameLen;\n\tm_DecodedName = newName;\n\n\treturn true;\n}\n\nvoid IDnsResource::setDnsLayer(DnsLayer* dnsLayer, size_t offsetInLayer)\n{\n\tmemcpy(dnsLayer->m_Data + offsetInLayer, m_ExternalRawData, getSize());\n\tm_DnsLayer = dnsLayer;\n\tm_OffsetInLayer = offsetInLayer;\n\tm_ExternalRawData = NULL;\n}\n\nuint32_t DnsResource::getTTL() const\n{\n\tuint32_t ttl = *(uint32_t*)(getRawData() + m_NameLength + 2*sizeof(uint16_t));\n\treturn be32toh(ttl);\n}\n\nvoid DnsResource::setTTL(uint32_t newTTL)\n{\n\tnewTTL = htobe32(newTTL);\n\tmemcpy(getRawData() + m_NameLength + 2*sizeof(uint16_t), &newTTL, sizeof(uint32_t));\n}\n\nsize_t DnsResource::getDataLength() const\n{\n\tuint16_t dataLength = *(uint16_t*)(getRawData() + m_NameLength + 2*sizeof(uint16_t) + sizeof(uint32_t));\n\treturn be16toh(dataLength);\n}\n\nDnsResourceDataPtr DnsResource::getData() const\n{\n\tuint8_t* resourceRawData = getRawData() + m_NameLength + 3*sizeof(uint16_t) + sizeof(uint32_t);\n\tsize_t dataLength = getDataLength();\n\n\tswitch (getDnsType())\n\t{\n\tcase DNS_TYPE_A:\n\t{\n\t\treturn DnsResourceDataPtr(new IPv4DnsResourceData(resourceRawData, dataLength));\n\t}\n\n\tcase DNS_TYPE_AAAA:\n\t{\n\t\treturn DnsResourceDataPtr(new IPv6DnsResourceData(resourceRawData, dataLength));\n\t}\n\n\tcase DNS_TYPE_NS:\n\tcase DNS_TYPE_CNAME:\n\tcase DNS_TYPE_DNAM:\n\tcase DNS_TYPE_PTR:\n\t{\n\t\treturn DnsResourceDataPtr(new StringDnsResourceData(resourceRawData, dataLength, const_cast<IDnsResource*>(static_cast<const IDnsResource*>(this))));\n\t}\n\n\tcase DNS_TYPE_MX:\n\t{\n\t\treturn DnsResourceDataPtr(new MxDnsResourceData(resourceRawData, dataLength, const_cast<IDnsResource*>(static_cast<const IDnsResource*>(this))));\n\t}\n\n\tdefault:\n\t{\n\t\treturn DnsResourceDataPtr(new GenericDnsResourceData(resourceRawData, dataLength));\n\t}\n\n\t}\n}\n\nsize_t DnsResource::getDataOffset() const\n{\n\treturn (size_t)(m_OffsetInLayer + m_NameLength + 3*sizeof(uint16_t) + sizeof(uint32_t));\n}\n\nbool DnsResource::setData(IDnsResourceData* data)\n{\n\t\/\/ convert data to byte array according to the DNS type\n\tsize_t dataLength = 0;\n\tuint8_t dataAsByteArr[256];\n\n\tif (data == NULL)\n\t{\n\t\tLOG_ERROR(\"Given data is NULL\");\n\t\treturn false;\n\t}\n\n\tswitch (getDnsType())\n\t{\n\tcase DNS_TYPE_A:\n\t{\n\t\tif (!data->isTypeOf<IPv4DnsResourceData>())\n\t\t{\n\t\t\tLOG_ERROR(\"DNS record is of type A but given data isn't of type IPv4DnsResourceData\");\n\t\t\treturn false;\n\t\t}\n\t\tbreak;\n\t}\n\n\tcase DNS_TYPE_AAAA:\n\t{\n\t\tif (!data->isTypeOf<IPv6DnsResourceData>())\n\t\t{\n\t\t\tLOG_ERROR(\"DNS record is of type AAAA but given data isn't of type IPv6DnsResourceData\");\n\t\t\treturn false;\n\t\t}\n\t\tbreak;\n\t}\n\n\tcase DNS_TYPE_NS:\n\tcase DNS_TYPE_CNAME:\n\tcase DNS_TYPE_DNAM:\n\tcase DNS_TYPE_PTR:\n\t{\n\t\tif (!data->isTypeOf<StringDnsResourceData>())\n\t\t{\n\t\t\tLOG_ERROR(\"DNS record is of type NS, CNAME, DNAM or PTR but given data isn't of type StringDnsResourceData\");\n\t\t\treturn false;\n\t\t}\n\t\tbreak;\n\t}\n\n\tcase DNS_TYPE_MX:\n\t{\n\t\tif (!data->isTypeOf<MxDnsResourceData>())\n\t\t{\n\t\t\tLOG_ERROR(\"DNS record is of type MX but given data isn't of type MxDnsResourceData\");\n\t\t\treturn false;\n\t\t}\n\t\tbreak;\n\t}\n\n\tdefault:\n\t{\n\t\t\/\/ do nothing\n\t}\n\n\t}\n\n\t\/\/ convert the IDnsResourceData to byte array\n\tif (!data->toByteArr(dataAsByteArr, dataLength, this))\n\t{\n\t\tLOG_ERROR(\"Cannot convert DNS resource data to byte array, data is probably invalid\");\n\t\treturn false;\n\t}\n\n\tsize_t dataLengthOffset = m_NameLength + (2*sizeof(uint16_t)) + sizeof(uint32_t);\n\tsize_t dataOffset = dataLengthOffset + sizeof(uint16_t);\n\n\tif (m_DnsLayer != NULL)\n\t{\n\t\tsize_t curLength = getDataLength();\n\t\tif (dataLength > curLength)\n\t\t{\n\t\t\tif (!m_DnsLayer->extendLayer(m_OffsetInLayer + dataOffset, dataLength-curLength, this))\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"Couldn't set data for DNS query, unable to extend layer\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse if (dataLength < curLength)\n\t\t{\n\t\t\tif (!m_DnsLayer->shortenLayer(m_OffsetInLayer + dataOffset, curLength-dataLength, this))\n\t\t\t{\n\t\t\t\tLOG_ERROR(\"Couldn't set data for DNS query, unable to shorten layer\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ write data to resource\n\tmemcpy(getRawData() + dataOffset, dataAsByteArr, dataLength);\n\t\/\/update data length in resource\n\tdataLength = htobe16((uint16_t)dataLength);\n\tmemcpy(getRawData() + dataLengthOffset, &dataLength, sizeof(uint16_t));\n\n\treturn true;\n}\n\nuint16_t DnsResource::getCustomDnsClass() const\n{\n\tuint16_t value = *(uint16_t*)(getRawData() + m_NameLength + sizeof(uint16_t));\n\treturn be16toh(value);\n}\n\nvoid DnsResource::setCustomDnsClass(uint16_t customValue)\n{\n\tmemcpy(getRawData() + m_NameLength + sizeof(uint16_t), &customValue, sizeof(uint16_t));\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\nCopyright (c) W.J. van der Laan\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of \nthis software  and associated documentation files (the \"Software\"), to deal in \nthe Software without restriction, including without limitation the rights to use, \ncopy, modify, merge, publish, distribute, sublicense, and\/or sell copies of the\nSoftware, and to permit persons to whom the Software is furnished to do so, subject \nto the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies \nor substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, \nINCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A \nPARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT \nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION \nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM,OUT OF OR IN CONNECTION WITH THE \nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n******************************************************************************\/\n\n#include \"LightMaterialGenerator.h\"\n\n#include \"OgreStringConverter.h\"\n#include \"OgreException.h\"\n#include \"OgreMaterialManager.h\"\n\n#include \"OgrePass.h\"\n#include \"OgreTechnique.h\"\n\n#include \"OgreHighLevelGpuProgram.h\"\n#include \"OgreHighLevelGpuProgramManager.h\"\n\n#include \"MLight.h\"\n\nusing namespace Ogre;\n\nclass LightMaterialGeneratorImpl : public MaterialGenerator::Impl\n{\npublic:\n\ttypedef MaterialGenerator::Perm Perm;\n\tLightMaterialGeneratorImpl(const String &baseName):\n\tmBaseName(baseName)\n\t{\n\n\t}\n\tvirtual LightMaterialGeneratorImpl::~LightMaterialGeneratorImpl()\n\t{\n\n\t}\n\tvirtual GpuProgramPtr generateVertexShader(Perm permutation)\n\t{\n\t\tString strUnifiedProgram;\n\t\tif (permutation & MLight::MI_QUAD)\n\t\t{\n\t\t\tstrUnifiedProgram = \"DeferredShading\/post\/vs\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstrUnifiedProgram = \"DeferredShading\/post\/LightMaterial_vs\";\n\t\t}\n\t\tHighLevelGpuProgramPtr ptr = HighLevelGpuProgramManager::getSingleton().getByName(strUnifiedProgram);\n\t\tassert(ptr->getLanguage()==\"unified\");\n\t\treturn ptr;\n\t}\n\tvirtual GpuProgramPtr generateFragmentShader(Perm permutation)\n\t{\n\t\tassert(false && \"Concrete Class must Implement!\");\n\t\tGpuProgramPtr ptr;\n\t\treturn ptr;\n\t}\n\tvirtual MaterialPtr generateTemplateMaterial(Perm permutation)\n\t{\n\t\tif(permutation & MLight::MI_QUAD)\n\t\t{\n\t\t\treturn MaterialManager::getSingleton().getByName(\"DeferredShading\/LightMaterialQuad\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn MaterialManager::getSingleton().getByName(\"DeferredShading\/LightMaterial\");\n\t\t}\n\t}\n\tprotected:\n\t\tString mBaseName;\n\t\t\/\/ Utility method\n\t\tString getPPDefines(Perm permutation)\n\t\t{\n\t\t\tString strPPD;\n\t\t\tif (permutation & MLight::MI_SPECULAR)\n\t\t\t{\n\t\t\t\tstrPPD += \"IS_SPECULAR=1,\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstrPPD += \"IS_SPECULAR=0,\";\n\t\t\t}\n\t\t\tif (permutation & MLight::MI_ATTENUATED)\n\t\t\t{\n\t\t\t\tstrPPD += \"IS_ATTENUATED=1\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstrPPD += \"IS_ATTENUATED=0\";\n\t\t\t}\n\t\t\treturn strPPD;\n\t\t}\n\t\tvoid setUpBaseParameters(GpuProgramParametersSharedPtr& params)\n\t\t{\n\t\t\tassert(params.isNull()==false);\n\n\t\t\tif (params->_findNamedConstantDefinition(\"worldView\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"worldView\", GpuProgramParameters::ACT_WORLDVIEW_MATRIX);\n\t\t\t}\n\t\t\tif (params->_findNamedConstantDefinition(\"invProj\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"invProj\", GpuProgramParameters::ACT_INVERSE_PROJECTION_MATRIX);\n\t\t\t}\n\t\t\tif (params->_findNamedConstantDefinition(\"lightDiffuseColor\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"lightDiffuseColor\", GpuProgramParameters::ACT_CUSTOM, 1);\n\t\t\t}\n\t\t\tif (params->_findNamedConstantDefinition(\"lightSpecularColor\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"lightSpecularColor\", GpuProgramParameters::ACT_CUSTOM, 2);\n\t\t\t}\t\t\t\n\t\t\tif(params->_findNamedConstantDefinition(\"lightFalloff\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"lightFalloff\", GpuProgramParameters::ACT_CUSTOM, 3);\n\t\t\t}\n\t\t}\n};\n\nclass LightMaterialGeneratorHLSL: public LightMaterialGeneratorImpl\n{\npublic:\n\tLightMaterialGeneratorHLSL(const String &baseName):\n\t  LightMaterialGeneratorImpl(baseName)\n\t  {\n\n\t  }\n\t  virtual LightMaterialGeneratorHLSL::~LightMaterialGeneratorHLSL()\n\t  {\n\n\t  }\n\n\tvirtual GpuProgramPtr generateFragmentShader(Perm permutation)\n\t{\n\t\t\n\t\t\/\/\/ Create shader\n\t\tif (mMasterSource.empty())\n\t\t{\n\t\t\tDataStreamPtr ptrMasterSource = ResourceGroupManager::getSingleton().openResource(\n\t\t\t\t \"DeferredShading\/post\/hlsl\/LightMaterial_ps.hlsl\"\n\t\t\t\t, ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n\t\t\tassert(ptrMasterSource.isNull()==false);\n\t\t\tmMasterSource = ptrMasterSource->getAsString();\n\t\t}\n\n\t\tassert(mMasterSource.empty()==false);\n\n\t\t\/\/ Create name\n\t\tString name=mBaseName+StringConverter::toString(permutation)+\"_ps\";\t\t\n\n\t\t\/\/ Create shader object\n\t\tHighLevelGpuProgramPtr ptrProgram = HighLevelGpuProgramManager::getSingleton().createProgram(\n\t\t\tname, ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME,\n\t\t\t\"hlsl\", GPT_FRAGMENT_PROGRAM);\n\t\tptrProgram->setSource(mMasterSource);\n\t\tptrProgram->setParameter(\"target\",\"ps_2_0\");\n\t\tptrProgram->setParameter(\"entry_point\",\"main\");\n\t\t\n\t\t\/\/ set up the preprocessor defines\n\t\t\/\/ Important to do this before any call to get parameters, i.e. before the program gets loaded\n\t\tptrProgram->setParameter(\"preprocessor_defines\", getPPDefines(permutation));\n\n\t\tsetUpBaseParameters(ptrProgram->getDefaultParameters());\n\n\t\treturn ptrProgram;\n\t}\nprotected:\n\n\tstatic String mMasterSource;\n};\n\nString LightMaterialGeneratorHLSL::mMasterSource = \"\";\n\nclass LightMaterialGeneratorGLSL: public LightMaterialGeneratorImpl\n{\npublic:\n\tLightMaterialGeneratorGLSL(const String &baseName):\n\t  LightMaterialGeneratorImpl(baseName)\n\t  {\n\n\t  }\n\t  virtual LightMaterialGeneratorGLSL::~LightMaterialGeneratorGLSL()\n\t  {\n\n\t  }\n\n\tvirtual GpuProgramPtr generateFragmentShader(Perm permutation)\n\t{\n\t\t\/\/\/ Create shader\n\t\tif (mMasterSource.empty())\n\t\t{\n\t\t\tDataStreamPtr ptrMasterSource = ResourceGroupManager::getSingleton().openResource(\n\t\t\t\t \"DeferredShading\/post\/glsl\/LightMaterial_ps.glsl\"\n\t\t\t\t, ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n\t\t\tassert(ptrMasterSource.isNull()==false);\n\t\t\tmMasterSource = ptrMasterSource->getAsString();\n\t\t}\n\n\t\tassert(mMasterSource.empty()==false);\n\n\t\t\/\/ Create name\n\t\tString name=mBaseName+StringConverter::toString(permutation)+\"_ps\";\t\t\n\n\t\t\/\/ Create shader object\n\t\tHighLevelGpuProgramPtr ptrProgram = HighLevelGpuProgramManager::getSingleton().createProgram(\n\t\t\tname, ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME,\n\t\t\t\"glsl\", GPT_FRAGMENT_PROGRAM);\n\t\tptrProgram->setSource(mMasterSource);\n\n\t\t\/\/ set up the preprocessor defines\n\t\t\/\/ Important to do this before any call to get parameters, i.e. before the program gets loaded\n\t\tptrProgram->setParameter(\"preprocessor_defines\", getPPDefines(permutation));\n\n\t\t\/\/ set up common parameters\n\t\tsetUpBaseParameters(ptrProgram->getDefaultParameters());\n\n\t\t\/\/ set up parameters specific to this implementation\t\t\n\t\tptrProgram->getDefaultParameters()->setNamedConstant(\"tex0\", 0);\n\t\tptrProgram->getDefaultParameters()->setNamedConstant(\"tex1\", 1);\n\n\t\treturn ptrProgram;\n\t}\nprotected:\n\tstatic String mMasterSource;\n};\n\nString LightMaterialGeneratorGLSL::mMasterSource = \"\";\n\nLightMaterialGenerator::LightMaterialGenerator(const String &language)\n{\n\tbitNames.push_back(\"Quad\");\t\t  \/\/ MI_QUAD\n\tbitNames.push_back(\"Attenuated\"); \/\/ MI_ATTENUATED\n\tbitNames.push_back(\"Specular\");   \/\/ MI_SPECULAR\n\n\tvsMask = 0x00000001;\n\tfsMask = 0x00000006;\n\tmatMask = 0x00000001;\n\t\n\tmaterialBaseName = \"DeferredShading\/LightMaterial\/\";\n\tif(language==\"hlsl\")\n\t\tmImpl = new LightMaterialGeneratorHLSL(\"DeferredShading\/LightMaterial\/hlsl\/\");\n\telse\n\t\tmImpl = new LightMaterialGeneratorGLSL(\"DeferredShading\/LightMaterial\/glsl\/\");\n}\nLightMaterialGenerator::~LightMaterialGenerator()\n{\n\n}<commit_msg>gcc build fix<commit_after>\/******************************************************************************\nCopyright (c) W.J. van der Laan\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of \nthis software  and associated documentation files (the \"Software\"), to deal in \nthe Software without restriction, including without limitation the rights to use, \ncopy, modify, merge, publish, distribute, sublicense, and\/or sell copies of the\nSoftware, and to permit persons to whom the Software is furnished to do so, subject \nto the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies \nor substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, \nINCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A \nPARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT \nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION \nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM,OUT OF OR IN CONNECTION WITH THE \nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n******************************************************************************\/\n\n#include \"LightMaterialGenerator.h\"\n\n#include \"OgreStringConverter.h\"\n#include \"OgreException.h\"\n#include \"OgreMaterialManager.h\"\n\n#include \"OgrePass.h\"\n#include \"OgreTechnique.h\"\n\n#include \"OgreHighLevelGpuProgram.h\"\n#include \"OgreHighLevelGpuProgramManager.h\"\n\n#include \"MLight.h\"\n\nusing namespace Ogre;\n\nclass LightMaterialGeneratorImpl : public MaterialGenerator::Impl\n{\npublic:\n\ttypedef MaterialGenerator::Perm Perm;\n\tLightMaterialGeneratorImpl(const String &baseName):\n\tmBaseName(baseName)\n\t{\n\n\t}\n\tvirtual ~LightMaterialGeneratorImpl()\n\t{\n\n\t}\n\tvirtual GpuProgramPtr generateVertexShader(Perm permutation)\n\t{\n\t\tString strUnifiedProgram;\n\t\tif (permutation & MLight::MI_QUAD)\n\t\t{\n\t\t\tstrUnifiedProgram = \"DeferredShading\/post\/vs\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstrUnifiedProgram = \"DeferredShading\/post\/LightMaterial_vs\";\n\t\t}\n\t\tGpuProgramPtr ptr = HighLevelGpuProgramManager::getSingleton().getByName(strUnifiedProgram);\n\t\tassert(ptr->getLanguage()==\"unified\");\n\t\treturn ptr;\n\t}\n\tvirtual GpuProgramPtr generateFragmentShader(Perm permutation)\n\t{\n\t\tassert(false && \"Concrete Class must Implement!\");\n\t\tGpuProgramPtr ptr;\n\t\treturn ptr;\n\t}\n\tvirtual MaterialPtr generateTemplateMaterial(Perm permutation)\n\t{\n\t\tif(permutation & MLight::MI_QUAD)\n\t\t{\n\t\t\treturn MaterialManager::getSingleton().getByName(\"DeferredShading\/LightMaterialQuad\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn MaterialManager::getSingleton().getByName(\"DeferredShading\/LightMaterial\");\n\t\t}\n\t}\n\tprotected:\n\t\tString mBaseName;\n\t\t\/\/ Utility method\n\t\tString getPPDefines(Perm permutation)\n\t\t{\n\t\t\tString strPPD;\n\t\t\tif (permutation & MLight::MI_SPECULAR)\n\t\t\t{\n\t\t\t\tstrPPD += \"IS_SPECULAR=1,\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstrPPD += \"IS_SPECULAR=0,\";\n\t\t\t}\n\t\t\tif (permutation & MLight::MI_ATTENUATED)\n\t\t\t{\n\t\t\t\tstrPPD += \"IS_ATTENUATED=1\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstrPPD += \"IS_ATTENUATED=0\";\n\t\t\t}\n\t\t\treturn strPPD;\n\t\t}\n\t\tvoid setUpBaseParameters(const GpuProgramParametersSharedPtr& params)\n\t\t{\n\t\t\tassert(params.isNull()==false);\n\n\t\t\tif (params->_findNamedConstantDefinition(\"worldView\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"worldView\", GpuProgramParameters::ACT_WORLDVIEW_MATRIX);\n\t\t\t}\n\t\t\tif (params->_findNamedConstantDefinition(\"invProj\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"invProj\", GpuProgramParameters::ACT_INVERSE_PROJECTION_MATRIX);\n\t\t\t}\n\t\t\tif (params->_findNamedConstantDefinition(\"lightDiffuseColor\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"lightDiffuseColor\", GpuProgramParameters::ACT_CUSTOM, 1);\n\t\t\t}\n\t\t\tif (params->_findNamedConstantDefinition(\"lightSpecularColor\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"lightSpecularColor\", GpuProgramParameters::ACT_CUSTOM, 2);\n\t\t\t}\t\t\t\n\t\t\tif(params->_findNamedConstantDefinition(\"lightFalloff\"))\n\t\t\t{\n\t\t\t\tparams->setNamedAutoConstant(\"lightFalloff\", GpuProgramParameters::ACT_CUSTOM, 3);\n\t\t\t}\n\t\t}\n};\n\nclass LightMaterialGeneratorHLSL: public LightMaterialGeneratorImpl\n{\npublic:\n\tLightMaterialGeneratorHLSL(const String &baseName):\n\t  LightMaterialGeneratorImpl(baseName)\n\t  {\n\n\t  }\n\t  virtual ~LightMaterialGeneratorHLSL()\n\t  {\n\n\t  }\n\n\tvirtual GpuProgramPtr generateFragmentShader(Perm permutation)\n\t{\n\t\t\n\t\t\/\/\/ Create shader\n\t\tif (mMasterSource.empty())\n\t\t{\n\t\t\tDataStreamPtr ptrMasterSource = ResourceGroupManager::getSingleton().openResource(\n\t\t\t\t \"DeferredShading\/post\/hlsl\/LightMaterial_ps.hlsl\"\n\t\t\t\t, ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n\t\t\tassert(ptrMasterSource.isNull()==false);\n\t\t\tmMasterSource = ptrMasterSource->getAsString();\n\t\t}\n\n\t\tassert(mMasterSource.empty()==false);\n\n\t\t\/\/ Create name\n\t\tString name=mBaseName+StringConverter::toString(permutation)+\"_ps\";\t\t\n\n\t\t\/\/ Create shader object\n\t\tHighLevelGpuProgramPtr ptrProgram = HighLevelGpuProgramManager::getSingleton().createProgram(\n\t\t\tname, ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME,\n\t\t\t\"hlsl\", GPT_FRAGMENT_PROGRAM);\n\t\tptrProgram->setSource(mMasterSource);\n\t\tptrProgram->setParameter(\"target\",\"ps_2_0\");\n\t\tptrProgram->setParameter(\"entry_point\",\"main\");\n\t\t\n\t\t\/\/ set up the preprocessor defines\n\t\t\/\/ Important to do this before any call to get parameters, i.e. before the program gets loaded\n\t\tptrProgram->setParameter(\"preprocessor_defines\", getPPDefines(permutation));\n\n\t\tsetUpBaseParameters(ptrProgram->getDefaultParameters());\n\n\t\treturn GpuProgramPtr(ptrProgram);\n\t}\nprotected:\n\n\tstatic String mMasterSource;\n};\n\nString LightMaterialGeneratorHLSL::mMasterSource = \"\";\n\nclass LightMaterialGeneratorGLSL: public LightMaterialGeneratorImpl\n{\npublic:\n\tLightMaterialGeneratorGLSL(const String &baseName):\n\t  LightMaterialGeneratorImpl(baseName)\n\t  {\n\n\t  }\n\t  virtual ~LightMaterialGeneratorGLSL()\n\t  {\n\n\t  }\n\n\tvirtual GpuProgramPtr generateFragmentShader(Perm permutation)\n\t{\n\t\t\/\/\/ Create shader\n\t\tif (mMasterSource.empty())\n\t\t{\n\t\t\tDataStreamPtr ptrMasterSource = ResourceGroupManager::getSingleton().openResource(\n\t\t\t\t \"DeferredShading\/post\/glsl\/LightMaterial_ps.glsl\"\n\t\t\t\t, ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n\t\t\tassert(ptrMasterSource.isNull()==false);\n\t\t\tmMasterSource = ptrMasterSource->getAsString();\n\t\t}\n\n\t\tassert(mMasterSource.empty()==false);\n\n\t\t\/\/ Create name\n\t\tString name=mBaseName+StringConverter::toString(permutation)+\"_ps\";\t\t\n\n\t\t\/\/ Create shader object\n\t\tHighLevelGpuProgramPtr ptrProgram = HighLevelGpuProgramManager::getSingleton().createProgram(\n\t\t\tname, ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME,\n\t\t\t\"glsl\", GPT_FRAGMENT_PROGRAM);\n\t\tptrProgram->setSource(mMasterSource);\n\n\t\t\/\/ set up the preprocessor defines\n\t\t\/\/ Important to do this before any call to get parameters, i.e. before the program gets loaded\n\t\tptrProgram->setParameter(\"preprocessor_defines\", getPPDefines(permutation));\n\n\t\t\/\/ set up common parameters\n\t\tsetUpBaseParameters(ptrProgram->getDefaultParameters());\n\n\t\t\/\/ set up parameters specific to this implementation\t\t\n\t\tptrProgram->getDefaultParameters()->setNamedConstant(\"tex0\", 0);\n\t\tptrProgram->getDefaultParameters()->setNamedConstant(\"tex1\", 1);\n\n\t\treturn GpuProgramPtr(ptrProgram);\n\t}\nprotected:\n\tstatic String mMasterSource;\n};\n\nString LightMaterialGeneratorGLSL::mMasterSource = \"\";\n\nLightMaterialGenerator::LightMaterialGenerator(const String &language)\n{\n\tbitNames.push_back(\"Quad\");\t\t  \/\/ MI_QUAD\n\tbitNames.push_back(\"Attenuated\"); \/\/ MI_ATTENUATED\n\tbitNames.push_back(\"Specular\");   \/\/ MI_SPECULAR\n\n\tvsMask = 0x00000001;\n\tfsMask = 0x00000006;\n\tmatMask = 0x00000001;\n\t\n\tmaterialBaseName = \"DeferredShading\/LightMaterial\/\";\n\tif(language==\"hlsl\")\n\t\tmImpl = new LightMaterialGeneratorHLSL(\"DeferredShading\/LightMaterial\/hlsl\/\");\n\telse\n\t\tmImpl = new LightMaterialGeneratorGLSL(\"DeferredShading\/LightMaterial\/glsl\/\");\n}\nLightMaterialGenerator::~LightMaterialGenerator()\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 \"base\/win\/shortcut.h\"\n\n#include <shellapi.h>\n#include <shlobj.h>\n#include <propkey.h>\n\n#include \"base\/file_util.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/win\/scoped_comptr.h\"\n#include \"base\/win\/win_util.h\"\n#include \"base\/win\/windows_version.h\"\n\nnamespace base {\nnamespace win {\n\nnamespace {\n\n\/\/ Initializes |i_shell_link| and |i_persist_file| (releasing them first if they\n\/\/ are already initialized).\n\/\/ If |shortcut| is not NULL, loads |shortcut| into |i_persist_file|.\n\/\/ If any of the above steps fail, both |i_shell_link| and |i_persist_file| will\n\/\/ be released.\nvoid InitializeShortcutInterfaces(\n    const wchar_t* shortcut,\n    ScopedComPtr<IShellLink>* i_shell_link,\n    ScopedComPtr<IPersistFile>* i_persist_file) {\n  i_shell_link->Release();\n  i_persist_file->Release();\n  if (FAILED(i_shell_link->CreateInstance(CLSID_ShellLink, NULL,\n                                          CLSCTX_INPROC_SERVER)) ||\n      FAILED(i_persist_file->QueryFrom(*i_shell_link)) ||\n      (shortcut && FAILED((*i_persist_file)->Load(shortcut, STGM_READWRITE)))) {\n    i_shell_link->Release();\n    i_persist_file->Release();\n  }\n}\n\n}  \/\/ namespace\n\nbool CreateOrUpdateShortcutLink(const FilePath& shortcut_path,\n                                const ShortcutProperties& properties,\n                                ShortcutOperation operation) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  \/\/ A target is required unless |operation| is SHORTCUT_UPDATE_EXISTING.\n  if (operation != SHORTCUT_UPDATE_EXISTING &&\n      !(properties.options & ShortcutProperties::PROPERTIES_TARGET)) {\n    NOTREACHED();\n    return false;\n  }\n\n  bool shortcut_existed = file_util::PathExists(shortcut_path);\n\n  ScopedComPtr<IShellLink> i_shell_link;\n  ScopedComPtr<IPersistFile> i_persist_file;\n  switch (operation) {\n    case SHORTCUT_CREATE_ALWAYS:\n      InitializeShortcutInterfaces(NULL, &i_shell_link, &i_persist_file);\n      break;\n    case SHORTCUT_UPDATE_EXISTING:\n      InitializeShortcutInterfaces(shortcut_path.value().c_str(), &i_shell_link,\n                                   &i_persist_file);\n      break;\n    case SHORTCUT_REPLACE_EXISTING:\n      InitializeShortcutInterfaces(shortcut_path.value().c_str(), &i_shell_link,\n                                   &i_persist_file);\n      \/\/ Confirm |shortcut_path| exists and is a shortcut by verifying\n      \/\/ |i_persist_file| was successfully initialized in the call above. If so,\n      \/\/ re-initialize the interfaces to begin writing a new shortcut (to\n      \/\/ overwrite the current one if successful).\n      if (i_persist_file.get())\n        InitializeShortcutInterfaces(NULL, &i_shell_link, &i_persist_file);\n      break;\n    default:\n      NOTREACHED();\n  }\n\n  \/\/ Return false immediately upon failure to initialize shortcut interfaces.\n  if (!i_persist_file.get())\n    return false;\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_TARGET) &&\n      FAILED(i_shell_link->SetPath(properties.target.value().c_str()))) {\n    return false;\n  }\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_WORKING_DIR) &&\n      FAILED(i_shell_link->SetWorkingDirectory(\n          properties.working_dir.value().c_str()))) {\n    return false;\n  }\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_ARGUMENTS) &&\n      FAILED(i_shell_link->SetArguments(properties.arguments.c_str()))) {\n    return false;\n  }\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_DESCRIPTION) &&\n      FAILED(i_shell_link->SetDescription(properties.description.c_str()))) {\n    return false;\n  }\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_ICON) &&\n      FAILED(i_shell_link->SetIconLocation(properties.icon.value().c_str(),\n                                           properties.icon_index))) {\n    return false;\n  }\n\n  bool has_app_id =\n      (properties.options & ShortcutProperties::PROPERTIES_APP_ID) != 0;\n  bool has_dual_mode =\n      (properties.options & ShortcutProperties::PROPERTIES_DUAL_MODE) != 0;\n  if ((has_app_id || has_dual_mode) &&\n      GetVersion() >= VERSION_WIN7) {\n    ScopedComPtr<IPropertyStore> property_store;\n    if (FAILED(property_store.QueryFrom(i_shell_link)) || !property_store.get())\n      return false;\n\n    if (has_app_id &&\n        !SetAppIdForPropertyStore(property_store, properties.app_id.c_str())) {\n      return false;\n    }\n    if (has_dual_mode &&\n        !SetBooleanValueForPropertyStore(property_store,\n                                         PKEY_AppUserModel_IsDualMode,\n                                         properties.dual_mode)) {\n      return false;\n    }\n  }\n\n  HRESULT result = i_persist_file->Save(shortcut_path.value().c_str(), TRUE);\n\n  \/\/ Release the interfaces in case the SHChangeNotify call below depends on\n  \/\/ the operations above being fully completed.\n  i_persist_file.Release();\n  i_shell_link.Release();\n\n  \/\/ If we successfully created\/updated the icon, notify the shell that we have\n  \/\/ done so.\n  const bool succeeded = SUCCEEDED(result);\n  if (succeeded) {\n    if (shortcut_existed) {\n      \/\/ TODO(gab): SHCNE_UPDATEITEM might be sufficient here; further testing\n      \/\/ required.\n      SHChangeNotify(SHCNE_ASSOCCHANGED, SHCNF_IDLIST, NULL, NULL);\n    } else {\n      SHChangeNotify(SHCNE_CREATE, SHCNF_PATH, shortcut_path.value().c_str(),\n                     NULL);\n    }\n  }\n\n  return succeeded;\n}\n\nbool ResolveShortcut(const FilePath& shortcut_path,\n                     FilePath* target_path,\n                     string16* args) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  HRESULT result;\n  ScopedComPtr<IShellLink> i_shell_link;\n\n  \/\/ Get pointer to the IShellLink interface.\n  result = i_shell_link.CreateInstance(CLSID_ShellLink, NULL,\n                                       CLSCTX_INPROC_SERVER);\n  if (FAILED(result))\n    return false;\n\n  ScopedComPtr<IPersistFile> persist;\n  \/\/ Query IShellLink for the IPersistFile interface.\n  result = persist.QueryFrom(i_shell_link);\n  if (FAILED(result))\n    return false;\n\n  \/\/ Load the shell link.\n  result = persist->Load(shortcut_path.value().c_str(), STGM_READ);\n  if (FAILED(result))\n    return false;\n\n  WCHAR temp[MAX_PATH];\n  if (target_path) {\n    \/\/ Try to find the target of a shortcut.\n    result = i_shell_link->Resolve(0, SLR_NO_UI);\n    if (FAILED(result))\n      return false;\n\n    result = i_shell_link->GetPath(temp, MAX_PATH, NULL, SLGP_UNCPRIORITY);\n    if (FAILED(result))\n      return false;\n\n    *target_path = FilePath(temp);\n  }\n\n  if (args) {\n    result = i_shell_link->GetArguments(temp, MAX_PATH);\n    if (FAILED(result))\n      return false;\n\n    *args = string16(temp);\n  }\n  return true;\n}\n\nbool TaskbarPinShortcutLink(const wchar_t* shortcut) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  \/\/ \"Pin to taskbar\" is only supported after Win7.\n  if (GetVersion() < VERSION_WIN7)\n    return false;\n\n  int result = reinterpret_cast<int>(ShellExecute(NULL, L\"taskbarpin\", shortcut,\n      NULL, NULL, 0));\n  return result > 32;\n}\n\nbool TaskbarUnpinShortcutLink(const wchar_t* shortcut) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  \/\/ \"Unpin from taskbar\" is only supported after Win7.\n  if (base::win::GetVersion() < base::win::VERSION_WIN7)\n    return false;\n\n  int result = reinterpret_cast<int>(ShellExecute(NULL, L\"taskbarunpin\",\n      shortcut, NULL, NULL, 0));\n  return result > 32;\n}\n\n}  \/\/ namespace win\n}  \/\/ namespace base\n<commit_msg>Pass SLR_NOSEARCH to IShellLink::Resolve() in ResolveShortcut().<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 \"base\/win\/shortcut.h\"\n\n#include <shellapi.h>\n#include <shlobj.h>\n#include <propkey.h>\n\n#include \"base\/file_util.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/win\/scoped_comptr.h\"\n#include \"base\/win\/win_util.h\"\n#include \"base\/win\/windows_version.h\"\n\nnamespace base {\nnamespace win {\n\nnamespace {\n\n\/\/ Initializes |i_shell_link| and |i_persist_file| (releasing them first if they\n\/\/ are already initialized).\n\/\/ If |shortcut| is not NULL, loads |shortcut| into |i_persist_file|.\n\/\/ If any of the above steps fail, both |i_shell_link| and |i_persist_file| will\n\/\/ be released.\nvoid InitializeShortcutInterfaces(\n    const wchar_t* shortcut,\n    ScopedComPtr<IShellLink>* i_shell_link,\n    ScopedComPtr<IPersistFile>* i_persist_file) {\n  i_shell_link->Release();\n  i_persist_file->Release();\n  if (FAILED(i_shell_link->CreateInstance(CLSID_ShellLink, NULL,\n                                          CLSCTX_INPROC_SERVER)) ||\n      FAILED(i_persist_file->QueryFrom(*i_shell_link)) ||\n      (shortcut && FAILED((*i_persist_file)->Load(shortcut, STGM_READWRITE)))) {\n    i_shell_link->Release();\n    i_persist_file->Release();\n  }\n}\n\n}  \/\/ namespace\n\nbool CreateOrUpdateShortcutLink(const FilePath& shortcut_path,\n                                const ShortcutProperties& properties,\n                                ShortcutOperation operation) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  \/\/ A target is required unless |operation| is SHORTCUT_UPDATE_EXISTING.\n  if (operation != SHORTCUT_UPDATE_EXISTING &&\n      !(properties.options & ShortcutProperties::PROPERTIES_TARGET)) {\n    NOTREACHED();\n    return false;\n  }\n\n  bool shortcut_existed = file_util::PathExists(shortcut_path);\n\n  ScopedComPtr<IShellLink> i_shell_link;\n  ScopedComPtr<IPersistFile> i_persist_file;\n  switch (operation) {\n    case SHORTCUT_CREATE_ALWAYS:\n      InitializeShortcutInterfaces(NULL, &i_shell_link, &i_persist_file);\n      break;\n    case SHORTCUT_UPDATE_EXISTING:\n      InitializeShortcutInterfaces(shortcut_path.value().c_str(), &i_shell_link,\n                                   &i_persist_file);\n      break;\n    case SHORTCUT_REPLACE_EXISTING:\n      InitializeShortcutInterfaces(shortcut_path.value().c_str(), &i_shell_link,\n                                   &i_persist_file);\n      \/\/ Confirm |shortcut_path| exists and is a shortcut by verifying\n      \/\/ |i_persist_file| was successfully initialized in the call above. If so,\n      \/\/ re-initialize the interfaces to begin writing a new shortcut (to\n      \/\/ overwrite the current one if successful).\n      if (i_persist_file.get())\n        InitializeShortcutInterfaces(NULL, &i_shell_link, &i_persist_file);\n      break;\n    default:\n      NOTREACHED();\n  }\n\n  \/\/ Return false immediately upon failure to initialize shortcut interfaces.\n  if (!i_persist_file.get())\n    return false;\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_TARGET) &&\n      FAILED(i_shell_link->SetPath(properties.target.value().c_str()))) {\n    return false;\n  }\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_WORKING_DIR) &&\n      FAILED(i_shell_link->SetWorkingDirectory(\n          properties.working_dir.value().c_str()))) {\n    return false;\n  }\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_ARGUMENTS) &&\n      FAILED(i_shell_link->SetArguments(properties.arguments.c_str()))) {\n    return false;\n  }\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_DESCRIPTION) &&\n      FAILED(i_shell_link->SetDescription(properties.description.c_str()))) {\n    return false;\n  }\n\n  if ((properties.options & ShortcutProperties::PROPERTIES_ICON) &&\n      FAILED(i_shell_link->SetIconLocation(properties.icon.value().c_str(),\n                                           properties.icon_index))) {\n    return false;\n  }\n\n  bool has_app_id =\n      (properties.options & ShortcutProperties::PROPERTIES_APP_ID) != 0;\n  bool has_dual_mode =\n      (properties.options & ShortcutProperties::PROPERTIES_DUAL_MODE) != 0;\n  if ((has_app_id || has_dual_mode) &&\n      GetVersion() >= VERSION_WIN7) {\n    ScopedComPtr<IPropertyStore> property_store;\n    if (FAILED(property_store.QueryFrom(i_shell_link)) || !property_store.get())\n      return false;\n\n    if (has_app_id &&\n        !SetAppIdForPropertyStore(property_store, properties.app_id.c_str())) {\n      return false;\n    }\n    if (has_dual_mode &&\n        !SetBooleanValueForPropertyStore(property_store,\n                                         PKEY_AppUserModel_IsDualMode,\n                                         properties.dual_mode)) {\n      return false;\n    }\n  }\n\n  HRESULT result = i_persist_file->Save(shortcut_path.value().c_str(), TRUE);\n\n  \/\/ Release the interfaces in case the SHChangeNotify call below depends on\n  \/\/ the operations above being fully completed.\n  i_persist_file.Release();\n  i_shell_link.Release();\n\n  \/\/ If we successfully created\/updated the icon, notify the shell that we have\n  \/\/ done so.\n  const bool succeeded = SUCCEEDED(result);\n  if (succeeded) {\n    if (shortcut_existed) {\n      \/\/ TODO(gab): SHCNE_UPDATEITEM might be sufficient here; further testing\n      \/\/ required.\n      SHChangeNotify(SHCNE_ASSOCCHANGED, SHCNF_IDLIST, NULL, NULL);\n    } else {\n      SHChangeNotify(SHCNE_CREATE, SHCNF_PATH, shortcut_path.value().c_str(),\n                     NULL);\n    }\n  }\n\n  return succeeded;\n}\n\nbool ResolveShortcut(const FilePath& shortcut_path,\n                     FilePath* target_path,\n                     string16* args) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  HRESULT result;\n  ScopedComPtr<IShellLink> i_shell_link;\n\n  \/\/ Get pointer to the IShellLink interface.\n  result = i_shell_link.CreateInstance(CLSID_ShellLink, NULL,\n                                       CLSCTX_INPROC_SERVER);\n  if (FAILED(result))\n    return false;\n\n  ScopedComPtr<IPersistFile> persist;\n  \/\/ Query IShellLink for the IPersistFile interface.\n  result = persist.QueryFrom(i_shell_link);\n  if (FAILED(result))\n    return false;\n\n  \/\/ Load the shell link.\n  result = persist->Load(shortcut_path.value().c_str(), STGM_READ);\n  if (FAILED(result))\n    return false;\n\n  WCHAR temp[MAX_PATH];\n  if (target_path) {\n    \/\/ Try to find the target of a shortcut.\n    result = i_shell_link->Resolve(0, SLR_NO_UI | SLR_NOSEARCH);\n    if (FAILED(result))\n      return false;\n\n    result = i_shell_link->GetPath(temp, MAX_PATH, NULL, SLGP_UNCPRIORITY);\n    if (FAILED(result))\n      return false;\n\n    *target_path = FilePath(temp);\n  }\n\n  if (args) {\n    result = i_shell_link->GetArguments(temp, MAX_PATH);\n    if (FAILED(result))\n      return false;\n\n    *args = string16(temp);\n  }\n  return true;\n}\n\nbool TaskbarPinShortcutLink(const wchar_t* shortcut) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  \/\/ \"Pin to taskbar\" is only supported after Win7.\n  if (GetVersion() < VERSION_WIN7)\n    return false;\n\n  int result = reinterpret_cast<int>(ShellExecute(NULL, L\"taskbarpin\", shortcut,\n      NULL, NULL, 0));\n  return result > 32;\n}\n\nbool TaskbarUnpinShortcutLink(const wchar_t* shortcut) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  \/\/ \"Unpin from taskbar\" is only supported after Win7.\n  if (base::win::GetVersion() < base::win::VERSION_WIN7)\n    return false;\n\n  int result = reinterpret_cast<int>(ShellExecute(NULL, L\"taskbarunpin\",\n      shortcut, NULL, NULL, 0));\n  return result > 32;\n}\n\n}  \/\/ namespace win\n}  \/\/ namespace base\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\nhttp:\/\/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 \"paddle\/framework\/op_desc.h\"\n#include <functional>\n#include <unordered_map>\n#include \"paddle\/framework\/block_desc.h\"\n#include \"paddle\/framework\/operator.h\"\n\nnamespace paddle {\nnamespace framework {\n\nOpDescBind::OpDescBind(const std::string &type, const VariableNameMap &inputs,\n                       const VariableNameMap &outputs,\n                       const AttributeMap &attrs) {\n  op_desc_.set_type(type);\n  inputs_ = inputs;\n  outputs_ = outputs;\n  attrs_ = attrs;\n}\n\nOpDesc *OpDescBind::Proto() {\n  Sync();\n  return &op_desc_;\n}\n\nconst std::vector<std::string> &OpDescBind::Input(\n    const std::string &name) const {\n  auto it = inputs_.find(name);\n  PADDLE_ENFORCE(it != inputs_.end(), \"Input %s cannot be found in Op %s\", name,\n                 Type());\n  return it->second;\n}\n\nstd::vector<std::string> OpDescBind::InputArgumentNames() const {\n  std::vector<std::string> retv;\n  for (auto &ipt : this->inputs_) {\n    retv.insert(retv.end(), ipt.second.begin(), ipt.second.end());\n  }\n  return retv;\n}\n\nvoid OpDescBind::SetInput(const std::string &param_name,\n                          const std::vector<std::string> &args) {\n  need_update_ = true;\n  inputs_[param_name] = args;\n}\n\nconst std::vector<std::string> &OpDescBind::Output(\n    const std::string &name) const {\n  auto it = outputs_.find(name);\n  PADDLE_ENFORCE(it != outputs_.end(), \"Output %s cannot be found in Op %s\",\n                 name, Type());\n  return it->second;\n}\n\nstd::vector<std::string> OpDescBind::OutputArgumentNames() const {\n  std::vector<std::string> retv;\n  for (auto &ipt : this->outputs_) {\n    retv.insert(retv.end(), ipt.second.begin(), ipt.second.end());\n  }\n  return retv;\n}\n\nvoid OpDescBind::SetOutput(const std::string &param_name,\n                           const std::vector<std::string> &args) {\n  need_update_ = true;\n  this->outputs_[param_name] = args;\n}\n\nAttrType OpDescBind::GetAttrType(const std::string &name) const {\n  auto it = attrs_.find(name);\n  PADDLE_ENFORCE(it != attrs_.end(), \"Attribute %s is not found\", name);\n  return static_cast<AttrType>(it->second.which() - 1);\n}\n\nstd::vector<std::string> OpDescBind::AttrNames() const {\n  std::vector<std::string> retv;\n  retv.reserve(attrs_.size());\n  for (auto &attr : attrs_) {\n    retv.push_back(attr.first);\n  }\n  return retv;\n}\n\nvoid OpDescBind::SetAttr(const std::string &name, const Attribute &v) {\n  this->attrs_[name] = v;\n  need_update_ = true;\n}\n\nvoid OpDescBind::SetAttrMap(\n    const std::unordered_map<std::string, Attribute> &attr_map) {\n  attrs_ = attr_map;\n  need_update_ = true;\n}\n\nAttribute OpDescBind::GetAttr(const std::string &name) const {\n  auto it = attrs_.find(name);\n  PADDLE_ENFORCE(it != attrs_.end(), \"Attribute %s is not found\", name);\n  return it->second;\n}\n\nint OpDescBind::GetBlockAttr(const std::string &name) const {\n  auto it = attrs_.find(name);\n  PADDLE_ENFORCE(it != attrs_.end(), \"Attribute %s is not found\", name);\n  return boost::get<BlockDesc *>(it->second)->idx();\n}\n\nconst std::unordered_map<std::string, Attribute> &OpDescBind::GetAttrMap()\n    const {\n  return attrs_;\n}\n\nvoid OpDescBind::Rename(const std::string &old_name,\n                        const std::string &new_name) {\n  for (auto &input : inputs_) {\n    std::replace(input.second.begin(), input.second.end(), old_name, new_name);\n  }\n  for (auto &output : outputs_) {\n    std::replace(output.second.begin(), output.second.end(), old_name,\n                 new_name);\n  }\n  need_update_ = true;\n}\n\nstruct SetAttrDescVisitor : public boost::static_visitor<void> {\n  explicit SetAttrDescVisitor(OpDesc::Attr *attr) : attr_(attr) {}\n  mutable OpDesc::Attr *attr_;\n  void operator()(int v) const { attr_->set_i(v); }\n  void operator()(float v) const { attr_->set_f(v); }\n  void operator()(const std::string &v) const { attr_->set_s(v); }\n  void operator()(bool b) const { attr_->set_b(b); }\n\n  void operator()(const std::vector<int> &v) const {\n    VectorToRepeated(v, attr_->mutable_ints());\n  }\n  void operator()(const std::vector<float> &v) const {\n    VectorToRepeated(v, attr_->mutable_floats());\n  }\n  void operator()(const std::vector<std::string> &v) const {\n    VectorToRepeated(v, attr_->mutable_strings());\n  }\n  void operator()(const std::vector<bool> &v) const {\n    VectorToRepeated(v, attr_->mutable_bools());\n  }\n  void operator()(BlockDesc *desc) const { attr_->set_block_idx(desc->idx()); }\n  void operator()(boost::blank) const { PADDLE_THROW(\"Unexpected branch\"); }\n};\n\nvoid OpDescBind::Sync() {\n  if (need_update_) {\n    this->op_desc_.mutable_inputs()->Clear();\n    for (auto &ipt : inputs_) {\n      auto *input = op_desc_.add_inputs();\n      input->set_parameter(ipt.first);\n      VectorToRepeated(ipt.second, input->mutable_arguments());\n    }\n\n    this->op_desc_.mutable_outputs()->Clear();\n    for (auto &opt : outputs_) {\n      auto *output = op_desc_.add_outputs();\n      output->set_parameter(opt.first);\n      VectorToRepeated(opt.second, output->mutable_arguments());\n    }\n\n    this->op_desc_.mutable_attrs()->Clear();\n    for (auto &attr : attrs_) {\n      auto *attr_desc = op_desc_.add_attrs();\n      attr_desc->set_name(attr.first);\n      attr_desc->set_type(\n          static_cast<framework::AttrType>(attr.second.which() - 1));\n      SetAttrDescVisitor visitor(attr_desc);\n      boost::apply_visitor(visitor, attr.second);\n    }\n\n    need_update_ = false;\n  }\n}\n\nusing InferShapeFuncMap =\n    std::unordered_map<std::string \/*op_type*\/,\n                       std::function<void(InferShapeContext *)>>;\n\nstatic InferShapeFuncMap &InferShapeFuncs() {\n  static InferShapeFuncMap *g_map = nullptr;\n  if (g_map == nullptr) {\n    g_map = new InferShapeFuncMap();\n    auto &info_map = OpInfoMap::Instance();\n    \/\/ all registered kernels\n    for (auto &pair : OperatorWithKernel::AllOpKernels()) {\n      auto &info = info_map.Get(pair.first);\n      auto op =\n          static_cast<OperatorWithKernel *>(info.Creator()(\"\", {}, {}, {}));\n      g_map->insert(\n          {pair.first, [op](InferShapeContext *ctx) { op->InferShape(ctx); }});\n    }\n  }\n  return *g_map;\n}\n\nvoid OpDescBind::InferShape(const BlockDescBind &block) const {\n  auto &funcs = InferShapeFuncs();\n  auto it = funcs.find(this->Type());\n  if (it == funcs.end()) {\n    PADDLE_THROW(\"Operator %s has not been registered\", this->Type());\n  }\n  CompileTimeInferShapeContext ctx(*this, block);\n  it->second(&ctx);\n}\n\n}  \/\/ namespace framework\n}  \/\/ namespace paddle\n<commit_msg>Add comment<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\nhttp:\/\/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 \"paddle\/framework\/op_desc.h\"\n#include <functional>\n#include <unordered_map>\n#include \"paddle\/framework\/block_desc.h\"\n#include \"paddle\/framework\/operator.h\"\n\nnamespace paddle {\nnamespace framework {\n\nOpDescBind::OpDescBind(const std::string &type, const VariableNameMap &inputs,\n                       const VariableNameMap &outputs,\n                       const AttributeMap &attrs) {\n  op_desc_.set_type(type);\n  inputs_ = inputs;\n  outputs_ = outputs;\n  attrs_ = attrs;\n}\n\nOpDesc *OpDescBind::Proto() {\n  Sync();\n  return &op_desc_;\n}\n\nconst std::vector<std::string> &OpDescBind::Input(\n    const std::string &name) const {\n  auto it = inputs_.find(name);\n  PADDLE_ENFORCE(it != inputs_.end(), \"Input %s cannot be found in Op %s\", name,\n                 Type());\n  return it->second;\n}\n\nstd::vector<std::string> OpDescBind::InputArgumentNames() const {\n  std::vector<std::string> retv;\n  for (auto &ipt : this->inputs_) {\n    retv.insert(retv.end(), ipt.second.begin(), ipt.second.end());\n  }\n  return retv;\n}\n\nvoid OpDescBind::SetInput(const std::string &param_name,\n                          const std::vector<std::string> &args) {\n  need_update_ = true;\n  inputs_[param_name] = args;\n}\n\nconst std::vector<std::string> &OpDescBind::Output(\n    const std::string &name) const {\n  auto it = outputs_.find(name);\n  PADDLE_ENFORCE(it != outputs_.end(), \"Output %s cannot be found in Op %s\",\n                 name, Type());\n  return it->second;\n}\n\nstd::vector<std::string> OpDescBind::OutputArgumentNames() const {\n  std::vector<std::string> retv;\n  for (auto &ipt : this->outputs_) {\n    retv.insert(retv.end(), ipt.second.begin(), ipt.second.end());\n  }\n  return retv;\n}\n\nvoid OpDescBind::SetOutput(const std::string &param_name,\n                           const std::vector<std::string> &args) {\n  need_update_ = true;\n  this->outputs_[param_name] = args;\n}\n\nAttrType OpDescBind::GetAttrType(const std::string &name) const {\n  auto it = attrs_.find(name);\n  PADDLE_ENFORCE(it != attrs_.end(), \"Attribute %s is not found\", name);\n  return static_cast<AttrType>(it->second.which() - 1);\n}\n\nstd::vector<std::string> OpDescBind::AttrNames() const {\n  std::vector<std::string> retv;\n  retv.reserve(attrs_.size());\n  for (auto &attr : attrs_) {\n    retv.push_back(attr.first);\n  }\n  return retv;\n}\n\nvoid OpDescBind::SetAttr(const std::string &name, const Attribute &v) {\n  this->attrs_[name] = v;\n  need_update_ = true;\n}\n\nvoid OpDescBind::SetAttrMap(\n    const std::unordered_map<std::string, Attribute> &attr_map) {\n  attrs_ = attr_map;\n  need_update_ = true;\n}\n\nAttribute OpDescBind::GetAttr(const std::string &name) const {\n  auto it = attrs_.find(name);\n  PADDLE_ENFORCE(it != attrs_.end(), \"Attribute %s is not found\", name);\n  return it->second;\n}\n\nint OpDescBind::GetBlockAttr(const std::string &name) const {\n  auto it = attrs_.find(name);\n  PADDLE_ENFORCE(it != attrs_.end(), \"Attribute %s is not found\", name);\n  return boost::get<BlockDesc *>(it->second)->idx();\n}\n\nconst std::unordered_map<std::string, Attribute> &OpDescBind::GetAttrMap()\n    const {\n  return attrs_;\n}\n\nvoid OpDescBind::Rename(const std::string &old_name,\n                        const std::string &new_name) {\n  for (auto &input : inputs_) {\n    std::replace(input.second.begin(), input.second.end(), old_name, new_name);\n  }\n  for (auto &output : outputs_) {\n    std::replace(output.second.begin(), output.second.end(), old_name,\n                 new_name);\n  }\n  need_update_ = true;\n}\n\nstruct SetAttrDescVisitor : public boost::static_visitor<void> {\n  explicit SetAttrDescVisitor(OpDesc::Attr *attr) : attr_(attr) {}\n  mutable OpDesc::Attr *attr_;\n  void operator()(int v) const { attr_->set_i(v); }\n  void operator()(float v) const { attr_->set_f(v); }\n  void operator()(const std::string &v) const { attr_->set_s(v); }\n  void operator()(bool b) const { attr_->set_b(b); }\n\n  void operator()(const std::vector<int> &v) const {\n    VectorToRepeated(v, attr_->mutable_ints());\n  }\n  void operator()(const std::vector<float> &v) const {\n    VectorToRepeated(v, attr_->mutable_floats());\n  }\n  void operator()(const std::vector<std::string> &v) const {\n    VectorToRepeated(v, attr_->mutable_strings());\n  }\n  void operator()(const std::vector<bool> &v) const {\n    VectorToRepeated(v, attr_->mutable_bools());\n  }\n  void operator()(BlockDesc *desc) const { attr_->set_block_idx(desc->idx()); }\n  void operator()(boost::blank) const { PADDLE_THROW(\"Unexpected branch\"); }\n};\n\nvoid OpDescBind::Sync() {\n  if (need_update_) {\n    this->op_desc_.mutable_inputs()->Clear();\n    for (auto &ipt : inputs_) {\n      auto *input = op_desc_.add_inputs();\n      input->set_parameter(ipt.first);\n      VectorToRepeated(ipt.second, input->mutable_arguments());\n    }\n\n    this->op_desc_.mutable_outputs()->Clear();\n    for (auto &opt : outputs_) {\n      auto *output = op_desc_.add_outputs();\n      output->set_parameter(opt.first);\n      VectorToRepeated(opt.second, output->mutable_arguments());\n    }\n\n    this->op_desc_.mutable_attrs()->Clear();\n    for (auto &attr : attrs_) {\n      auto *attr_desc = op_desc_.add_attrs();\n      attr_desc->set_name(attr.first);\n      attr_desc->set_type(\n          static_cast<framework::AttrType>(attr.second.which() - 1));\n      SetAttrDescVisitor visitor(attr_desc);\n      boost::apply_visitor(visitor, attr.second);\n    }\n\n    need_update_ = false;\n  }\n}\n\nusing InferShapeFuncMap =\n    std::unordered_map<std::string \/*op_type*\/,\n                       std::function<void(InferShapeContext *)>>;\n\nstatic InferShapeFuncMap &InferShapeFuncs() {\n  static InferShapeFuncMap *g_map = nullptr;\n  if (g_map == nullptr) {\n    g_map = new InferShapeFuncMap();\n    auto &info_map = OpInfoMap::Instance();\n    \/\/ all registered kernels\n    for (auto &pair : OperatorWithKernel::AllOpKernels()) {\n      auto &info = info_map.Get(pair.first);\n      \/\/ use empty type here to avoid runtime checks.\n      auto op =\n          static_cast<OperatorWithKernel *>(info.Creator()(\"\", {}, {}, {}));\n      g_map->insert(\n          {pair.first, [op](InferShapeContext *ctx) { op->InferShape(ctx); }});\n    }\n  }\n  return *g_map;\n}\n\nvoid OpDescBind::InferShape(const BlockDescBind &block) const {\n  auto &funcs = InferShapeFuncs();\n  auto it = funcs.find(this->Type());\n  if (it == funcs.end()) {\n    PADDLE_THROW(\"Operator %s has not been registered\", this->Type());\n  }\n  CompileTimeInferShapeContext ctx(*this, block);\n  it->second(&ctx);\n}\n\n}  \/\/ namespace framework\n}  \/\/ namespace paddle\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\/pose_graph\/constraint\/cost_function\/relative_pose_cost_2d.h\"\n\n#include \"cartographer\/common\/make_unique.h\"\n#include \"cartographer\/mapping\/internal\/optimization\/cost_functions\/cost_helpers.h\"\n#include \"cartographer\/pose_graph\/internal\/testing\/test_helpers.h\"\n\nnamespace cartographer {\nnamespace pose_graph {\nnamespace {\n\nconstexpr int kPoseDimension = 3;\nconstexpr int kResidualsCount = 3;\nconstexpr int kParameterBlocksCount = 2;\nconstexpr int kJacobianColDimension = kResidualsCount * kPoseDimension;\n\nusing ::testing::ElementsAre;\nusing testing::Near;\nusing testing::ParseProto;\n\nusing ResidualType = std::array<double, kResidualsCount>;\nusing JacobianType = std::array<std::array<double, kJacobianColDimension>,\n                                kParameterBlocksCount>;\n\n\/\/ This is the autodiff version of the RelativePoseCost2D.\n\/\/\n\/\/ TODO(pifon): Use the gradient_checker from Ceres.\nclass AutoDiffRelativePoseCost {\n public:\n  explicit AutoDiffRelativePoseCost(\n      const proto::RelativePose2D::Parameters& parameters)\n      : translation_weight_(parameters.translation_weight()),\n        rotation_weight_(parameters.rotation_weight()),\n        first_T_second_(transform::ToRigid2(parameters.first_t_second())) {}\n\n  template <typename T>\n  bool operator()(const T* const start_pose, const T* const end_pose,\n                  T* e) const {\n    const std::array<T, 3> error = mapping::optimization::ScaleError(\n        mapping::optimization::ComputeUnscaledError(first_T_second_, start_pose,\n                                                    end_pose),\n        translation_weight_, rotation_weight_);\n    std::copy(std::begin(error), std::end(error), e);\n    return true;\n  }\n\n private:\n  const double translation_weight_;\n  const double rotation_weight_;\n  const transform::Rigid2d first_T_second_;\n};\n\nclass RelativePoseCost2DTest : public ::testing::Test {\n public:\n  RelativePoseCost2DTest() {\n    constexpr char kParameters[] = R\"PROTO(\n      first_t_second {\n        translation: { x: 1 y: 1 }\n        rotation: -2.214297\n      }\n      translation_weight: 1\n      rotation_weight: 10\n    )PROTO\";\n\n    auto parameters =\n        ParseProto<proto::RelativePose2D::Parameters>(kParameters);\n    auto_diff_cost_ = common::make_unique<RelativePoseCost2D>(parameters);\n    analytical_cost_ = common::make_unique<\n        ceres::AutoDiffCostFunction<AutoDiffRelativePoseCost, kResidualsCount,\n                                    kPoseDimension, kPoseDimension>>(\n        new AutoDiffRelativePoseCost(parameters));\n    for (int i = 0; i < kParameterBlocksCount; ++i) {\n      jacobian_ptrs_[i] = jacobian_[i].data();\n    }\n  }\n\n  std::pair<const ResidualType&, const JacobianType&>\n  EvaluateRelativePoseCost2D(\n      const std::array<const double*, 2>& parameter_blocks) {\n    return Evaluate(parameter_blocks, analytical_cost_);\n  }\n\n  std::pair<const ResidualType&, const JacobianType&> EvaluateAutoDiffCost(\n      const std::array<const double*, 2>& parameter_blocks) {\n    return Evaluate(parameter_blocks, auto_diff_cost_);\n  }\n\n private:\n  std::pair<const ResidualType&, const JacobianType&> Evaluate(\n      const std::array<const double*, 2>& parameter_blocks,\n      const std::unique_ptr<ceres::CostFunction>& cost_function) {\n    cost_function->Evaluate(parameter_blocks.data(), residuals_.data(),\n                            jacobian_ptrs_.data());\n    return std::make_pair(std::cref(residuals_), std::cref(jacobian_));\n  }\n\n  ResidualType residuals_;\n  JacobianType jacobian_;\n  std::array<double*, kParameterBlocksCount> jacobian_ptrs_;\n  std::unique_ptr<ceres::CostFunction> auto_diff_cost_;\n  std::unique_ptr<ceres::CostFunction> analytical_cost_;\n};\n\nTEST_F(RelativePoseCost2DTest, CompareAutoDiffAndAnalytical) {\n  std::array<double, kPoseDimension> start_pose{{1., 1., 1.}};\n  std::array<double, kPoseDimension> end_pose{{10., 1., 100.}};\n  std::array<const double*, kParameterBlocksCount> parameter_blocks{\n      {start_pose.data(), end_pose.data()}};\n\n  ResidualType auto_diff_residual, analytical_residual;\n  JacobianType auto_diff_jacobian, analytical_jacobian;\n  std::tie(auto_diff_residual, auto_diff_jacobian) =\n      EvaluateAutoDiffCost(parameter_blocks);\n  std::tie(analytical_residual, analytical_jacobian) =\n      EvaluateRelativePoseCost2D(parameter_blocks);\n\n  for (int i = 0; i < kResidualsCount; ++i) {\n    EXPECT_THAT(auto_diff_residual[i], Near(analytical_residual[i]));\n  }\n  for (int i = 0; i < kParameterBlocksCount; ++i) {\n    for (int j = 0; j < kJacobianColDimension; ++j) {\n      EXPECT_THAT(auto_diff_jacobian[i][j], Near(analytical_jacobian[i][j]));\n    }\n  }\n}\n\nTEST_F(RelativePoseCost2DTest, EvaluateRelativePoseCost2D) {\n  std::array<double, kPoseDimension> start_pose{{1., 1., 1.}};\n  std::array<double, kPoseDimension> end_pose{{10., 1., 100.}};\n  std::array<const double*, kParameterBlocksCount> parameter_blocks{\n      {start_pose.data(), end_pose.data()}};\n\n  auto residuals_and_jacobian = EvaluateRelativePoseCost2D(parameter_blocks);\n  EXPECT_THAT(residuals_and_jacobian.first,\n              ElementsAre(Near(-3.86272), Near(8.57324), Near(-6.83333)));\n  EXPECT_THAT(\n      residuals_and_jacobian.second,\n      ElementsAre(\n          ElementsAre(Near(0.540302), Near(0.841471), Near(7.57324),\n                      Near(-0.841471), Near(0.540302), Near(4.86272), Near(0),\n                      Near(0), Near(10)),\n          ElementsAre(Near(-0.540302), Near(-0.841471), Near(0), Near(0.841471),\n                      Near(-0.540302), Near(0), Near(0), Near(0), Near(-10))));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace pose_graph\n}  \/\/ namespace cartographer\n<commit_msg>[GenericPoseGraph] Use GradientChecker to check gradients (Ba-Dum-Tss). (#1306)<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\/pose_graph\/constraint\/cost_function\/relative_pose_cost_2d.h\"\n\n#include \"cartographer\/common\/make_unique.h\"\n#include \"cartographer\/pose_graph\/internal\/testing\/test_helpers.h\"\n#include \"ceres\/gradient_checker.h\"\n\nnamespace cartographer {\nnamespace pose_graph {\nnamespace {\n\nconstexpr int kPoseDimension = 3;\nconstexpr int kResidualsCount = 3;\nconstexpr int kParameterBlocksCount = 2;\nconstexpr int kJacobianColDimension = kResidualsCount * kPoseDimension;\n\nusing ::testing::ElementsAre;\nusing testing::EqualsProto;\nusing testing::Near;\nusing testing::ParseProto;\n\nusing ResidualType = std::array<double, kResidualsCount>;\nusing JacobianType = std::array<std::array<double, kJacobianColDimension>,\n                                kParameterBlocksCount>;\n\nconstexpr char kParameters[] = R\"PROTO(\n  first_t_second {\n    translation: { x: 1 y: 1 }\n    rotation: -2.214297\n  }\n  translation_weight: 1\n  rotation_weight: 10\n)PROTO\";\n\nclass RelativePoseCost2DTest : public ::testing::Test {\n public:\n  RelativePoseCost2DTest()\n      : relative_pose_cost_2d_(common::make_unique<RelativePoseCost2D>(\n            ParseProto<proto::RelativePose2D::Parameters>(kParameters))) {\n    for (int i = 0; i < kParameterBlocksCount; ++i) {\n      jacobian_ptrs_[i] = jacobian_[i].data();\n    }\n  }\n\n  std::pair<const ResidualType&, const JacobianType&>\n  EvaluateRelativePoseCost2D(\n      const std::array<const double*, 2>& parameter_blocks) {\n    relative_pose_cost_2d_->Evaluate(parameter_blocks.data(), residuals_.data(),\n                                     jacobian_ptrs_.data());\n    return std::make_pair(std::cref(residuals_), std::cref(jacobian_));\n  }\n\n protected:\n  ResidualType residuals_;\n  JacobianType jacobian_;\n  std::array<double*, kParameterBlocksCount> jacobian_ptrs_;\n  std::unique_ptr<RelativePoseCost2D> relative_pose_cost_2d_;\n};\n\nTEST_F(RelativePoseCost2DTest, SerializesCorrectly) {\n  EXPECT_THAT(relative_pose_cost_2d_->ToProto(), EqualsProto(kParameters));\n}\n\nTEST_F(RelativePoseCost2DTest, CheckGradient) {\n  std::array<double, kPoseDimension> start_pose{{1., 1., 1.}};\n  std::array<double, kPoseDimension> end_pose{{10., 1., 100.}};\n  std::array<const double*, kParameterBlocksCount> parameter_blocks{\n      {start_pose.data(), end_pose.data()}};\n\n  using ::ceres::GradientChecker;\n  GradientChecker gradient_checker(relative_pose_cost_2d_.get(),\n                                   {} \/* local parameterizations *\/,\n                                   ceres::NumericDiffOptions{});\n\n  GradientChecker::ProbeResults probe_results;\n  gradient_checker.Probe(parameter_blocks.data(),\n                         1e-08 \/* relative precision *\/, &probe_results);\n  EXPECT_TRUE(probe_results.return_value);\n}\n\nTEST_F(RelativePoseCost2DTest, EvaluateRelativePoseCost2D) {\n  std::array<double, kPoseDimension> start_pose{{1., 1., 1.}};\n  std::array<double, kPoseDimension> end_pose{{10., 1., 100.}};\n  std::array<const double*, kParameterBlocksCount> parameter_blocks{\n      {start_pose.data(), end_pose.data()}};\n\n  auto residuals_and_jacobian = EvaluateRelativePoseCost2D(parameter_blocks);\n  EXPECT_THAT(residuals_and_jacobian.first,\n              ElementsAre(Near(-3.86272), Near(8.57324), Near(-6.83333)));\n  EXPECT_THAT(\n      residuals_and_jacobian.second,\n      ElementsAre(\n          ElementsAre(Near(0.540302), Near(0.841471), Near(7.57324),\n                      Near(-0.841471), Near(0.540302), Near(4.86272), Near(0),\n                      Near(0), Near(10)),\n          ElementsAre(Near(-0.540302), Near(-0.841471), Near(0), Near(0.841471),\n                      Near(-0.540302), Near(0), Near(0), Near(0), Near(-10))));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace pose_graph\n}  \/\/ namespace cartographer\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 2011      Dennis Nienhüser <earthwings@gentoo.org>\n\/\/\n\n#include \"Settings.h\"\n\nSettings::Settings() :\n    m_organizationName( \"KDE\" ), m_applicationName( \"Marble Virtual Globe\" )\n{\n    \/\/ nothing to do\n}\n\nQString Settings::organizationName() const\n{\n    return m_organizationName;\n}\n\nvoid Settings::setOrganizationName( const QString &organization )\n{\n    m_organizationName = organization;\n}\n\nQString Settings::applicationName() const\n{\n    return m_applicationName;\n}\n\nvoid Settings::setApplicationName( const QString &application )\n{\n    m_applicationName = application;\n}\n\nQVariant Settings::value( const QString &group, const QString &key, const QVariant &value ) const\n{\n    QSettings settings( m_organizationName, m_applicationName );\n    settings.beginGroup( group );\n    return settings.value( key, value );\n}\n\nvoid Settings::setValue( const QString &group, const QString &key, const QVariant &value )\n{\n    QSettings settings( m_organizationName, m_applicationName );\n    settings.beginGroup( group );\n    settings.setValue( key, value );\n    settings.endGroup();\n}\n\n#include \"Settings.moc\"\n<commit_msg>use QApplication's application + organization name instead of hardcoding it<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 2011      Dennis Nienhüser <earthwings@gentoo.org>\n\/\/\n\n#include \"Settings.h\"\n\n#include <QApplication>\n\nSettings::Settings() :\n    m_organizationName( QApplication::organizationName() ),\n    m_applicationName( QApplication::applicationName() )\n{\n    \/\/ nothing to do\n}\n\nQString Settings::organizationName() const\n{\n    return m_organizationName;\n}\n\nvoid Settings::setOrganizationName( const QString &organization )\n{\n    m_organizationName = organization;\n}\n\nQString Settings::applicationName() const\n{\n    return m_applicationName;\n}\n\nvoid Settings::setApplicationName( const QString &application )\n{\n    m_applicationName = application;\n}\n\nQVariant Settings::value( const QString &group, const QString &key, const QVariant &value ) const\n{\n    QSettings settings( m_organizationName, m_applicationName );\n    settings.beginGroup( group );\n    return settings.value( key, value );\n}\n\nvoid Settings::setValue( const QString &group, const QString &key, const QVariant &value )\n{\n    QSettings settings( m_organizationName, m_applicationName );\n    settings.beginGroup( group );\n    settings.setValue( key, value );\n    settings.endGroup();\n}\n\n#include \"Settings.moc\"\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\/pacing\/include\/paced_sender.h\"\n\n#include <assert.h>\n\n#include \"webrtc\/modules\/interface\/module_common_types.h\"\n#include \"webrtc\/system_wrappers\/interface\/critical_section_wrapper.h\"\n#include \"webrtc\/system_wrappers\/interface\/trace_event.h\"\n\nnamespace {\n\/\/ Time limit in milliseconds between packet bursts.\nconst int kMinPacketLimitMs = 5;\n\n\/\/ Upper cap on process interval, in case process has not been called in a long\n\/\/ time.\nconst int kMaxIntervalTimeMs = 30;\n\n\/\/ Max time that the first packet in the queue can sit in the queue if no\n\/\/ packets are sent, regardless of buffer state. In practice only in effect at\n\/\/ low bitrates (less than 320 kbits\/s).\nconst int kMaxQueueTimeWithoutSendingMs = 30;\n\n\/\/ Max padding bytes per second.\nconst int kMaxPaddingKbps = 800;\n\n}  \/\/ namespace\n\nnamespace webrtc {\n\nnamespace paced_sender {\nstruct Packet {\n  Packet(uint32_t ssrc, uint16_t seq_number, int64_t capture_time_ms,\n         int length_in_bytes)\n      : ssrc_(ssrc),\n        sequence_number_(seq_number),\n        capture_time_ms_(capture_time_ms),\n        bytes_(length_in_bytes) {\n  }\n  uint32_t ssrc_;\n  uint16_t sequence_number_;\n  int64_t capture_time_ms_;\n  int bytes_;\n};\n\n\/\/ STL list style class which prevents duplicates in the list.\nclass PacketList {\n public:\n  PacketList() {};\n\n  bool empty() const {\n    return packet_list_.empty();\n  }\n\n  Packet front() const {\n    return packet_list_.front();\n  }\n\n  void pop_front() {\n    Packet& packet = packet_list_.front();\n    uint16_t sequence_number = packet.sequence_number_;\n    packet_list_.pop_front();\n    sequence_number_set_.erase(sequence_number);\n  }\n\n  void push_back(const Packet& packet) {\n    if (sequence_number_set_.find(packet.sequence_number_) ==\n        sequence_number_set_.end()) {\n      \/\/ Don't insert duplicates.\n      packet_list_.push_back(packet);\n      sequence_number_set_.insert(packet.sequence_number_);\n    }\n  }\n\n private:\n  std::list<Packet> packet_list_;\n  std::set<uint16_t> sequence_number_set_;\n};\n\nclass IntervalBudget {\n public:\n  explicit IntervalBudget(int initial_target_rate_kbps)\n      : target_rate_kbps_(initial_target_rate_kbps),\n        bytes_remaining_(0) {}\n\n  void set_target_rate_kbps(int target_rate_kbps) {\n    target_rate_kbps_ = target_rate_kbps;\n  }\n\n  void IncreaseBudget(int delta_time_ms) {\n    int bytes = target_rate_kbps_ * delta_time_ms \/ 8;\n    if (bytes_remaining_ < 0) {\n      \/\/ We overused last interval, compensate this interval.\n      bytes_remaining_ = bytes_remaining_ + bytes;\n    } else {\n      \/\/ If we underused last interval we can't use it this interval.\n      bytes_remaining_ = bytes;\n    }\n  }\n\n  void UseBudget(int bytes) {\n    bytes_remaining_ = std::max(bytes_remaining_ - bytes,\n                                -100 * target_rate_kbps_ \/ 8);\n  }\n\n  int bytes_remaining() const { return bytes_remaining_; }\n\n private:\n  int target_rate_kbps_;\n  int bytes_remaining_;\n};\n}  \/\/ namespace paced_sender\n\nPacedSender::PacedSender(Callback* callback, int target_bitrate_kbps,\n                         float pace_multiplier)\n    : callback_(callback),\n      pace_multiplier_(pace_multiplier),\n      enabled_(false),\n      paused_(false),\n      critsect_(CriticalSectionWrapper::CreateCriticalSection()),\n      media_budget_(new paced_sender::IntervalBudget(\n          pace_multiplier_ * target_bitrate_kbps)),\n      padding_budget_(new paced_sender::IntervalBudget(kMaxPaddingKbps)),\n      \/\/ No padding until UpdateBitrate is called.\n      pad_up_to_bitrate_budget_(new paced_sender::IntervalBudget(0)),\n      time_last_update_(TickTime::Now()),\n      capture_time_ms_last_queued_(0),\n      capture_time_ms_last_sent_(0),\n      high_priority_packets_(new paced_sender::PacketList),\n      normal_priority_packets_(new paced_sender::PacketList),\n      low_priority_packets_(new paced_sender::PacketList) {\n  UpdateBytesPerInterval(kMinPacketLimitMs);\n}\n\nPacedSender::~PacedSender() {\n}\n\nvoid PacedSender::Pause() {\n  CriticalSectionScoped cs(critsect_.get());\n  paused_ = true;\n}\n\nvoid PacedSender::Resume() {\n  CriticalSectionScoped cs(critsect_.get());\n  paused_ = false;\n}\n\nvoid PacedSender::SetStatus(bool enable) {\n  CriticalSectionScoped cs(critsect_.get());\n  enabled_ = enable;\n}\n\nbool PacedSender::Enabled() const {\n  CriticalSectionScoped cs(critsect_.get());\n  return enabled_;\n}\n\nvoid PacedSender::UpdateBitrate(int target_bitrate_kbps,\n                                int pad_up_to_bitrate_kbps) {\n  CriticalSectionScoped cs(critsect_.get());\n  media_budget_->set_target_rate_kbps(pace_multiplier_ * target_bitrate_kbps);\n  pad_up_to_bitrate_budget_->set_target_rate_kbps(pad_up_to_bitrate_kbps);\n}\n\nbool PacedSender::SendPacket(Priority priority, uint32_t ssrc,\n    uint16_t sequence_number, int64_t capture_time_ms, int bytes) {\n  CriticalSectionScoped cs(critsect_.get());\n\n  if (!enabled_) {\n    UpdateMediaBytesSent(bytes);\n    return true;  \/\/ We can send now.\n  }\n  if (capture_time_ms < 0) {\n    capture_time_ms = TickTime::MillisecondTimestamp();\n  }\n  if (priority != kHighPriority &&\n      capture_time_ms > capture_time_ms_last_queued_) {\n    capture_time_ms_last_queued_ = capture_time_ms;\n    TRACE_EVENT_ASYNC_BEGIN1(\"webrtc_rtp\", \"PacedSend\", capture_time_ms,\n                             \"capture_time_ms\", capture_time_ms);\n  }\n  paced_sender::PacketList* packet_list = NULL;\n  switch (priority) {\n    case kHighPriority:\n      packet_list = high_priority_packets_.get();\n      break;\n    case kNormalPriority:\n      packet_list = normal_priority_packets_.get();\n      break;\n    case kLowPriority:\n      packet_list = low_priority_packets_.get();\n      break;\n  }\n  packet_list->push_back(paced_sender::Packet(ssrc, sequence_number,\n                                              capture_time_ms, bytes));\n  return false;\n}\n\nint PacedSender::QueueInMs() const {\n  CriticalSectionScoped cs(critsect_.get());\n  int64_t now_ms = TickTime::MillisecondTimestamp();\n  int64_t oldest_packet_capture_time = now_ms;\n  if (!high_priority_packets_->empty()) {\n    oldest_packet_capture_time = std::min(\n        oldest_packet_capture_time,\n        high_priority_packets_->front().capture_time_ms_);\n  }\n  if (!normal_priority_packets_->empty()) {\n    oldest_packet_capture_time = std::min(\n        oldest_packet_capture_time,\n        normal_priority_packets_->front().capture_time_ms_);\n  }\n  if (!low_priority_packets_->empty()) {\n    oldest_packet_capture_time = std::min(\n        oldest_packet_capture_time,\n        low_priority_packets_->front().capture_time_ms_);\n  }\n  return now_ms - oldest_packet_capture_time;\n}\n\nint32_t PacedSender::TimeUntilNextProcess() {\n  CriticalSectionScoped cs(critsect_.get());\n  int64_t elapsed_time_ms =\n      (TickTime::Now() - time_last_update_).Milliseconds();\n  if (elapsed_time_ms <= 0) {\n    return kMinPacketLimitMs;\n  }\n  if (elapsed_time_ms >= kMinPacketLimitMs) {\n    return 0;\n  }\n  return kMinPacketLimitMs - elapsed_time_ms;\n}\n\nint32_t PacedSender::Process() {\n  TickTime now = TickTime::Now();\n  CriticalSectionScoped cs(critsect_.get());\n  int elapsed_time_ms = (now - time_last_update_).Milliseconds();\n  time_last_update_ = now;\n  if (!paused_) {\n    if (elapsed_time_ms > 0) {\n      uint32_t delta_time_ms = std::min(kMaxIntervalTimeMs, elapsed_time_ms);\n      UpdateBytesPerInterval(delta_time_ms);\n    }\n    uint32_t ssrc;\n    uint16_t sequence_number;\n    int64_t capture_time_ms;\n    paced_sender::PacketList* packet_list;\n    while (ShouldSendNextPacket(&packet_list)) {\n      GetNextPacketFromList(packet_list, &ssrc, &sequence_number,\n                            &capture_time_ms);\n      critsect_->Leave();\n\n      const bool success = callback_->TimeToSendPacket(ssrc, sequence_number,\n                                                       capture_time_ms);\n      \/\/ If packet cannt be sent then keep it in packet list and exit early.\n      \/\/ There's no need to send more packets.\n      if (!success) {\n        return 0;\n      }\n\n      critsect_->Enter();\n      packet_list->pop_front();\n      const bool last_packet = packet_list->empty() ||\n          packet_list->front().capture_time_ms_ > capture_time_ms;\n      if (packet_list != high_priority_packets_.get()) {\n        if (capture_time_ms > capture_time_ms_last_sent_) {\n          capture_time_ms_last_sent_ = capture_time_ms;\n        } else if (capture_time_ms == capture_time_ms_last_sent_ &&\n                   last_packet) {\n          TRACE_EVENT_ASYNC_END0(\"webrtc_rtp\", \"PacedSend\", capture_time_ms);\n        }\n      }\n    }\n    if (high_priority_packets_->empty() &&\n        normal_priority_packets_->empty() &&\n        low_priority_packets_->empty() &&\n        padding_budget_->bytes_remaining() > 0 &&\n        pad_up_to_bitrate_budget_->bytes_remaining() > 0) {\n      int padding_needed = std::min(\n          padding_budget_->bytes_remaining(),\n          pad_up_to_bitrate_budget_->bytes_remaining());\n      critsect_->Leave();\n      int bytes_sent = callback_->TimeToSendPadding(padding_needed);\n      critsect_->Enter();\n      media_budget_->UseBudget(bytes_sent);\n      padding_budget_->UseBudget(bytes_sent);\n      pad_up_to_bitrate_budget_->UseBudget(bytes_sent);\n    }\n  }\n  return 0;\n}\n\n\/\/ MUST have critsect_ when calling.\nvoid PacedSender::UpdateBytesPerInterval(uint32_t delta_time_ms) {\n  media_budget_->IncreaseBudget(delta_time_ms);\n  padding_budget_->IncreaseBudget(delta_time_ms);\n  pad_up_to_bitrate_budget_->IncreaseBudget(delta_time_ms);\n}\n\n\/\/ MUST have critsect_ when calling.\nbool PacedSender::ShouldSendNextPacket(paced_sender::PacketList** packet_list) {\n  if (media_budget_->bytes_remaining() <= 0) {\n    \/\/ All bytes consumed for this interval.\n    \/\/ Check if we have not sent in a too long time.\n    if ((TickTime::Now() - time_last_send_).Milliseconds() >\n        kMaxQueueTimeWithoutSendingMs) {\n      if (!high_priority_packets_->empty()) {\n        *packet_list = high_priority_packets_.get();\n        return true;\n      }\n      if (!normal_priority_packets_->empty()) {\n        *packet_list = normal_priority_packets_.get();\n        return true;\n      }\n    }\n    return false;\n  }\n  if (!high_priority_packets_->empty()) {\n    *packet_list = high_priority_packets_.get();\n    return true;\n  }\n  if (!normal_priority_packets_->empty()) {\n    *packet_list = normal_priority_packets_.get();\n    return true;\n  }\n  if (!low_priority_packets_->empty()) {\n    *packet_list = low_priority_packets_.get();\n    return true;\n  }\n  return false;\n}\n\nvoid PacedSender::GetNextPacketFromList(paced_sender::PacketList* packets,\n    uint32_t* ssrc, uint16_t* sequence_number, int64_t* capture_time_ms) {\n  paced_sender::Packet packet = packets->front();\n  UpdateMediaBytesSent(packet.bytes_);\n  *sequence_number = packet.sequence_number_;\n  *ssrc = packet.ssrc_;\n  *capture_time_ms = packet.capture_time_ms_;\n}\n\n\/\/ MUST have critsect_ when calling.\nvoid PacedSender::UpdateMediaBytesSent(int num_bytes) {\n  time_last_send_ = TickTime::Now();\n  media_budget_->UseBudget(num_bytes);\n  pad_up_to_bitrate_budget_->UseBudget(num_bytes);\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Fix memory bot failure<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\/pacing\/include\/paced_sender.h\"\n\n#include <assert.h>\n\n#include \"webrtc\/modules\/interface\/module_common_types.h\"\n#include \"webrtc\/system_wrappers\/interface\/critical_section_wrapper.h\"\n#include \"webrtc\/system_wrappers\/interface\/trace_event.h\"\n\nnamespace {\n\/\/ Time limit in milliseconds between packet bursts.\nconst int kMinPacketLimitMs = 5;\n\n\/\/ Upper cap on process interval, in case process has not been called in a long\n\/\/ time.\nconst int kMaxIntervalTimeMs = 30;\n\n\/\/ Max time that the first packet in the queue can sit in the queue if no\n\/\/ packets are sent, regardless of buffer state. In practice only in effect at\n\/\/ low bitrates (less than 320 kbits\/s).\nconst int kMaxQueueTimeWithoutSendingMs = 30;\n\n\/\/ Max padding bytes per second.\nconst int kMaxPaddingKbps = 800;\n\n}  \/\/ namespace\n\nnamespace webrtc {\n\nnamespace paced_sender {\nstruct Packet {\n  Packet(uint32_t ssrc, uint16_t seq_number, int64_t capture_time_ms,\n         int length_in_bytes)\n      : ssrc_(ssrc),\n        sequence_number_(seq_number),\n        capture_time_ms_(capture_time_ms),\n        bytes_(length_in_bytes) {\n  }\n  uint32_t ssrc_;\n  uint16_t sequence_number_;\n  int64_t capture_time_ms_;\n  int bytes_;\n};\n\n\/\/ STL list style class which prevents duplicates in the list.\nclass PacketList {\n public:\n  PacketList() {};\n\n  bool empty() const {\n    return packet_list_.empty();\n  }\n\n  Packet front() const {\n    return packet_list_.front();\n  }\n\n  void pop_front() {\n    Packet& packet = packet_list_.front();\n    uint16_t sequence_number = packet.sequence_number_;\n    packet_list_.pop_front();\n    sequence_number_set_.erase(sequence_number);\n  }\n\n  void push_back(const Packet& packet) {\n    if (sequence_number_set_.find(packet.sequence_number_) ==\n        sequence_number_set_.end()) {\n      \/\/ Don't insert duplicates.\n      packet_list_.push_back(packet);\n      sequence_number_set_.insert(packet.sequence_number_);\n    }\n  }\n\n private:\n  std::list<Packet> packet_list_;\n  std::set<uint16_t> sequence_number_set_;\n};\n\nclass IntervalBudget {\n public:\n  explicit IntervalBudget(int initial_target_rate_kbps)\n      : target_rate_kbps_(initial_target_rate_kbps),\n        bytes_remaining_(0) {}\n\n  void set_target_rate_kbps(int target_rate_kbps) {\n    target_rate_kbps_ = target_rate_kbps;\n  }\n\n  void IncreaseBudget(int delta_time_ms) {\n    int bytes = target_rate_kbps_ * delta_time_ms \/ 8;\n    if (bytes_remaining_ < 0) {\n      \/\/ We overused last interval, compensate this interval.\n      bytes_remaining_ = bytes_remaining_ + bytes;\n    } else {\n      \/\/ If we underused last interval we can't use it this interval.\n      bytes_remaining_ = bytes;\n    }\n  }\n\n  void UseBudget(int bytes) {\n    bytes_remaining_ = std::max(bytes_remaining_ - bytes,\n                                -100 * target_rate_kbps_ \/ 8);\n  }\n\n  int bytes_remaining() const { return bytes_remaining_; }\n\n private:\n  int target_rate_kbps_;\n  int bytes_remaining_;\n};\n}  \/\/ namespace paced_sender\n\nPacedSender::PacedSender(Callback* callback, int target_bitrate_kbps,\n                         float pace_multiplier)\n    : callback_(callback),\n      pace_multiplier_(pace_multiplier),\n      enabled_(false),\n      paused_(false),\n      critsect_(CriticalSectionWrapper::CreateCriticalSection()),\n      media_budget_(new paced_sender::IntervalBudget(\n          pace_multiplier_ * target_bitrate_kbps)),\n      padding_budget_(new paced_sender::IntervalBudget(kMaxPaddingKbps)),\n      \/\/ No padding until UpdateBitrate is called.\n      pad_up_to_bitrate_budget_(new paced_sender::IntervalBudget(0)),\n      time_last_update_(TickTime::Now()),\n      capture_time_ms_last_queued_(0),\n      capture_time_ms_last_sent_(0),\n      high_priority_packets_(new paced_sender::PacketList),\n      normal_priority_packets_(new paced_sender::PacketList),\n      low_priority_packets_(new paced_sender::PacketList) {\n  UpdateBytesPerInterval(kMinPacketLimitMs);\n}\n\nPacedSender::~PacedSender() {\n}\n\nvoid PacedSender::Pause() {\n  CriticalSectionScoped cs(critsect_.get());\n  paused_ = true;\n}\n\nvoid PacedSender::Resume() {\n  CriticalSectionScoped cs(critsect_.get());\n  paused_ = false;\n}\n\nvoid PacedSender::SetStatus(bool enable) {\n  CriticalSectionScoped cs(critsect_.get());\n  enabled_ = enable;\n}\n\nbool PacedSender::Enabled() const {\n  CriticalSectionScoped cs(critsect_.get());\n  return enabled_;\n}\n\nvoid PacedSender::UpdateBitrate(int target_bitrate_kbps,\n                                int pad_up_to_bitrate_kbps) {\n  CriticalSectionScoped cs(critsect_.get());\n  media_budget_->set_target_rate_kbps(pace_multiplier_ * target_bitrate_kbps);\n  pad_up_to_bitrate_budget_->set_target_rate_kbps(pad_up_to_bitrate_kbps);\n}\n\nbool PacedSender::SendPacket(Priority priority, uint32_t ssrc,\n    uint16_t sequence_number, int64_t capture_time_ms, int bytes) {\n  CriticalSectionScoped cs(critsect_.get());\n\n  if (!enabled_) {\n    UpdateMediaBytesSent(bytes);\n    return true;  \/\/ We can send now.\n  }\n  if (capture_time_ms < 0) {\n    capture_time_ms = TickTime::MillisecondTimestamp();\n  }\n  if (priority != kHighPriority &&\n      capture_time_ms > capture_time_ms_last_queued_) {\n    capture_time_ms_last_queued_ = capture_time_ms;\n    TRACE_EVENT_ASYNC_BEGIN1(\"webrtc_rtp\", \"PacedSend\", capture_time_ms,\n                             \"capture_time_ms\", capture_time_ms);\n  }\n  paced_sender::PacketList* packet_list = NULL;\n  switch (priority) {\n    case kHighPriority:\n      packet_list = high_priority_packets_.get();\n      break;\n    case kNormalPriority:\n      packet_list = normal_priority_packets_.get();\n      break;\n    case kLowPriority:\n      packet_list = low_priority_packets_.get();\n      break;\n  }\n  packet_list->push_back(paced_sender::Packet(ssrc, sequence_number,\n                                              capture_time_ms, bytes));\n  return false;\n}\n\nint PacedSender::QueueInMs() const {\n  CriticalSectionScoped cs(critsect_.get());\n  int64_t now_ms = TickTime::MillisecondTimestamp();\n  int64_t oldest_packet_capture_time = now_ms;\n  if (!high_priority_packets_->empty()) {\n    oldest_packet_capture_time = std::min(\n        oldest_packet_capture_time,\n        high_priority_packets_->front().capture_time_ms_);\n  }\n  if (!normal_priority_packets_->empty()) {\n    oldest_packet_capture_time = std::min(\n        oldest_packet_capture_time,\n        normal_priority_packets_->front().capture_time_ms_);\n  }\n  if (!low_priority_packets_->empty()) {\n    oldest_packet_capture_time = std::min(\n        oldest_packet_capture_time,\n        low_priority_packets_->front().capture_time_ms_);\n  }\n  return now_ms - oldest_packet_capture_time;\n}\n\nint32_t PacedSender::TimeUntilNextProcess() {\n  CriticalSectionScoped cs(critsect_.get());\n  int64_t elapsed_time_ms =\n      (TickTime::Now() - time_last_update_).Milliseconds();\n  if (elapsed_time_ms <= 0) {\n    return kMinPacketLimitMs;\n  }\n  if (elapsed_time_ms >= kMinPacketLimitMs) {\n    return 0;\n  }\n  return kMinPacketLimitMs - elapsed_time_ms;\n}\n\nint32_t PacedSender::Process() {\n  TickTime now = TickTime::Now();\n  CriticalSectionScoped cs(critsect_.get());\n  int elapsed_time_ms = (now - time_last_update_).Milliseconds();\n  time_last_update_ = now;\n  if (!paused_) {\n    if (elapsed_time_ms > 0) {\n      uint32_t delta_time_ms = std::min(kMaxIntervalTimeMs, elapsed_time_ms);\n      UpdateBytesPerInterval(delta_time_ms);\n    }\n    uint32_t ssrc;\n    uint16_t sequence_number;\n    int64_t capture_time_ms;\n    paced_sender::PacketList* packet_list;\n    while (ShouldSendNextPacket(&packet_list)) {\n      GetNextPacketFromList(packet_list, &ssrc, &sequence_number,\n                            &capture_time_ms);\n      critsect_->Leave();\n\n      const bool success = callback_->TimeToSendPacket(ssrc, sequence_number,\n                                                       capture_time_ms);\n      critsect_->Enter();\n      \/\/ If packet cannt be sent then keep it in packet list and exit early.\n      \/\/ There's no need to send more packets.\n      if (!success) {\n        return 0;\n      }\n      packet_list->pop_front();\n      const bool last_packet = packet_list->empty() ||\n          packet_list->front().capture_time_ms_ > capture_time_ms;\n      if (packet_list != high_priority_packets_.get()) {\n        if (capture_time_ms > capture_time_ms_last_sent_) {\n          capture_time_ms_last_sent_ = capture_time_ms;\n        } else if (capture_time_ms == capture_time_ms_last_sent_ &&\n                   last_packet) {\n          TRACE_EVENT_ASYNC_END0(\"webrtc_rtp\", \"PacedSend\", capture_time_ms);\n        }\n      }\n    }\n    if (high_priority_packets_->empty() &&\n        normal_priority_packets_->empty() &&\n        low_priority_packets_->empty() &&\n        padding_budget_->bytes_remaining() > 0 &&\n        pad_up_to_bitrate_budget_->bytes_remaining() > 0) {\n      int padding_needed = std::min(\n          padding_budget_->bytes_remaining(),\n          pad_up_to_bitrate_budget_->bytes_remaining());\n      critsect_->Leave();\n      int bytes_sent = callback_->TimeToSendPadding(padding_needed);\n      critsect_->Enter();\n      media_budget_->UseBudget(bytes_sent);\n      padding_budget_->UseBudget(bytes_sent);\n      pad_up_to_bitrate_budget_->UseBudget(bytes_sent);\n    }\n  }\n  return 0;\n}\n\n\/\/ MUST have critsect_ when calling.\nvoid PacedSender::UpdateBytesPerInterval(uint32_t delta_time_ms) {\n  media_budget_->IncreaseBudget(delta_time_ms);\n  padding_budget_->IncreaseBudget(delta_time_ms);\n  pad_up_to_bitrate_budget_->IncreaseBudget(delta_time_ms);\n}\n\n\/\/ MUST have critsect_ when calling.\nbool PacedSender::ShouldSendNextPacket(paced_sender::PacketList** packet_list) {\n  if (media_budget_->bytes_remaining() <= 0) {\n    \/\/ All bytes consumed for this interval.\n    \/\/ Check if we have not sent in a too long time.\n    if ((TickTime::Now() - time_last_send_).Milliseconds() >\n        kMaxQueueTimeWithoutSendingMs) {\n      if (!high_priority_packets_->empty()) {\n        *packet_list = high_priority_packets_.get();\n        return true;\n      }\n      if (!normal_priority_packets_->empty()) {\n        *packet_list = normal_priority_packets_.get();\n        return true;\n      }\n    }\n    return false;\n  }\n  if (!high_priority_packets_->empty()) {\n    *packet_list = high_priority_packets_.get();\n    return true;\n  }\n  if (!normal_priority_packets_->empty()) {\n    *packet_list = normal_priority_packets_.get();\n    return true;\n  }\n  if (!low_priority_packets_->empty()) {\n    *packet_list = low_priority_packets_.get();\n    return true;\n  }\n  return false;\n}\n\nvoid PacedSender::GetNextPacketFromList(paced_sender::PacketList* packets,\n    uint32_t* ssrc, uint16_t* sequence_number, int64_t* capture_time_ms) {\n  paced_sender::Packet packet = packets->front();\n  UpdateMediaBytesSent(packet.bytes_);\n  *sequence_number = packet.sequence_number_;\n  *ssrc = packet.ssrc_;\n  *capture_time_ms = packet.capture_time_ms_;\n}\n\n\/\/ MUST have critsect_ when calling.\nvoid PacedSender::UpdateMediaBytesSent(int num_bytes) {\n  time_last_send_ = TickTime::Now();\n  media_budget_->UseBudget(num_bytes);\n  pad_up_to_bitrate_budget_->UseBudget(num_bytes);\n}\n\n}  \/\/ namespace webrtc\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\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    std::stringstream ss;\n    ss << file << \":\" << line << \": \" << 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    std::stringstream ss;\n    ss << file << \":\" << line << \": \" << 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, T4 info4) noexcept {\n    std::stringstream ss;\n    ss << file << \":\" << line << \": \" << message << \" [\" << 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, T4 info4, T5 info5, T6 info6) noexcept {\n    std::stringstream ss;\n    ss << file << \":\" << line << \": \" << message << \" [\" << info1 << \", \" << info2 << \", \" << info3 << \", \" << 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>Added REALM_VER_CHUNK to terminate()<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#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    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    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, T4 info4) noexcept {\n    std::stringstream ss;\n    ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message << \" [\" << 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, T4 info4, T5 info5, T6 info6) noexcept {\n    std::stringstream ss;\n    ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message << \" [\" << info1 << \", \" << info2 << \", \" << info3 << \", \" << info4 << \", \" << info5 << \", \" << info6 << \"]\\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>\/\/\n\/\/  paddle.cc\n\/\/  AirHockey\n\/\/\n\/\/  Created by Jonathan Sharkey on 10-04-12.\n\/\/  Copyright 2010 Sharkable. All rights reserved.\n\/\/\n\n#include \"airhockey\/entities\/paddle.h\"\n\n#include <cmath>\n\n#include \"airhockey\/entities\/puck.h\"\n#include \"gameengine\/game_engine.h\"\n#include \"gameengine\/resource_loader.h\"\n#include \"soundengine\/sound_player.h\"\n\nPaddle::Paddle(sp<GameEngine> game_engine, int player_id, PaddleSize size, bool player_controlled,\n               ComputerAI ai_level, vector<sp<Puck> > &pucks)\n    : RoundThing(game_engine),\n      player_id_(player_id),\n      player_controlled_(player_controlled),\n      ready_to_play_(true),\n      ai_level_(ai_level),\n      pucks_(pucks),\n      target_left_corner_(false),\n      target_right_corner_(false),\n      target_away_from_corner_(false) {\n  if (player_id == PLAYER_1) {\n    switch (size) {\n      case psSmall:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_1_small\"));\n        break;\n      case psMedium:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_1_medium\"));\n        break;\n      case psLarge:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_1_large\"));\n        break;\n    }\n  } else {\n    switch (size) {\n      case psSmall:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_2_small\"));\n        break;\n      case psMedium:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_2_medium\"));\n        break;\n      case psLarge:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_2_large\"));\n        break;\n    }    \n  }\n\n  radius_ = PADDLE_RADIUS[size];\n  mass_ = PADDLE_MASS;\n  friction_ = player_controlled_ ? PADDLE_FRICTION : PADDLE_AI_FRICTION;\n}\n\n\nvoid Paddle::SetInitialPositionForPlayer(int playerId) {\n  switch (player_id_) {\n    case PLAYER_1: {\n      x_ = PADDLE_1_X;\n      y_ = PADDLE_1_Y;      \n      break;\n    }\n    case PLAYER_2: {\n      x_ = PADDLE_2_X;\n      y_ = PADDLE_2_Y;      \n      break;\n    }\n  }  \n}\n\nvoid Paddle::KeepInPlayerBounds() {\n  switch (player_id_) {\n    case PLAYER_1: {\n      if (y_ + radius_ > RINK_BOTTOM_Y) {\n        y_ = RINK_BOTTOM_Y - radius_;\n        vy_ = 0;\n      } else if (y_ - radius_ < SCREEN_HEIGHT\/2+1) {\n        y_ = SCREEN_HEIGHT\/2+1 + radius_;\n        vy_ = 0;\n      }\n      break;\n    }\n    case PLAYER_2: {\n      if (y_ - radius_ < RINK_TOP_Y) {\n        y_ = RINK_TOP_Y + radius_;\n        vy_ = 0;\n      } else if (y_ + radius_ > SCREEN_HEIGHT\/2-1) {\n        y_ = SCREEN_HEIGHT\/2-1 - radius_;\n        vy_ = 0;\n      }\n      break;\n    }\n  }\n  if (x_ - radius_ < RINK_LEFT_X) {\n    x_ = RINK_LEFT_X + radius_;\n    vx_ = 0;\n  } else if (x_ + radius_ > RINK_RIGHT_X) {\n    x_ = RINK_RIGHT_X - radius_;\n    vx_ = 0;\n  }\n}\n\nvoid Paddle::RunAITick() {\n  double speed = 0;\n  switch (ai_level_) {\n    case caiBad:\n      speed = 1;\n      break;\n    case caiGood:\n      speed = 1.5;\n      break;\n    case caiExcellent:\n      speed = 2;\n      break;\n    case caiAmazing:\n      speed = 4.5;\n      break;\n  }\n  \n  \/\/ Find the puck that will reach the paddle first.\n  Puck *target = NULL;\n  double bestTime;\n  \n  for (int i = 0; i < pucks_.size(); i++) {\n    Puck *puck = pucks_[i].get();\n    if (!puck->is_active()) {\n      continue;\n    }\n    if (puck->vy() > 4) {\n      continue;\n    }\n    double timeToReach = 999999;\n    if (puck->vy() < 0) {\n      timeToReach = fabs((y_ - puck->y()) \/ puck->vy());\n    }\n    if (puck->y() - puck->radius() > SCREEN_HEIGHT\/2) {\n      continue;\n    }\n    if (target == NULL || timeToReach < bestTime ||\n        (timeToReach == bestTime && puck->y() < target->y())) {\n      target = puck;\n      bestTime = timeToReach;\n    }\n  }\n  \n  if (!target) {\n    target_left_corner_ = target_right_corner_ = target_away_from_corner_ = false;\n  }\n  \n  double targetX;\n  double targetY;\n  \n  if (!target_away_from_corner_ && target && target->y() <= RINK_TOP_Y + radius_ &&\n      fabs(target->vx()) < 5 && fabs(target->vy()) < 5) {\n    if (target->x() < SCREEN_WIDTH \/ 2) {\n      target_left_corner_ = true;\n    } else {\n      target_right_corner_ = true;\n    }\n  }\n  \n  if (target_left_corner_) {\n    targetX = RINK_LEFT_X + radius_;\n    targetY = RINK_TOP_Y + radius_;\n    if (Overlaps(target)) {\n      target_left_corner_ = false;\n      target_away_from_corner_ = true;\n    }\n  } else if (target_right_corner_) {\n    targetX = RINK_RIGHT_X - radius_;\n    targetY = RINK_TOP_Y + radius_;\n    if (Overlaps(target)) {\n      target_right_corner_ = false;\n      target_away_from_corner_ = true;\n    }\n  } else if (target_away_from_corner_) {\n    targetX = SCREEN_WIDTH \/ 2;\n    targetY = RINK_TOP_Y + radius_;\n    if (x_ >= SCREEN_WIDTH \/ 2 - 5 && x_ <= SCREEN_WIDTH \/ 2 + 5) {\n      target_away_from_corner_ = false;\n    }\n  } else if (target) {\n    if (target->y() > y_) {\n      targetX = target->x();\n      targetY = target->y() - target->radius();\n    } else {\n      targetY = target->y() - target->radius() - radius_ - 20;\n      if (target->x() < x_) {\n        targetX = target->x() + target->radius() + radius_ + 20;\n      } else {\n        targetX = target->x() - target->radius() - radius_ - 20;\n      }\n    }\n  } else if (ai_level_ >= caiExcellent) {\n    targetX = PADDLE_2_X;\n    targetY = PADDLE_2_Y;\n  } else if (ai_level_ == caiGood) {\n    targetX = PADDLE_2_X;\n    targetY = y_;\n  } else {\n    targetX = x_;\n    targetY = y_;\n  }\n  \n  \/\/ Get direction of target.\n  double dx = targetX - x_;\n  double dy = targetY - y_;\n  double adx = fabs(dx);\n  double ady = fabs(dy);\n  \n  if (adx <= speed && ady <= speed) {\n    vx_ = 0;\n    vy_ = 0;\n    x_ = targetX;\n    y_ = targetY;\n  } else {\n    if (fabs(dx) < fabs(vx_)) {\n      vx_ = dx;\n    } else if (fabs(dy) < fabs(vy_)) {\n      vy_ = dy;\n    }\n    \n    double dL = sqrt(dx*dx + dy*dy);\n    double nx = dx \/ dL;\n    double ny = dy \/ dL;\n    vx_ += speed * nx;\n    vy_ += speed * ny;\n  }\n}\n\n\n\/\/ ViewEntity\n\nvoid Paddle::Update() {\n  \/\/ Computer AI\n  if (!player_controlled_) {\n    RunAITick();\n  }\n  RoundThing::Update();\n}\n\nvoid Paddle::Render() {\n  sprite_.Draw(game_point_make(x_ - sprite_.content_size().width\/2,\n                               y_ - sprite_.content_size().height\/2),\n               0, (is_grabbed() || !player_controlled_ ? 1.0 : 0.5), 1);\n}\n\n\n\/\/ RoundThing\n\nvoid Paddle::DidBounceOff(ViewEntity *other) {\n  if (typeid(*other) == typeid(Puck)) {\n    SoundPlayer::instance()->playSound(kSoundPaddleHit);\n  }\n}\n\nbool Paddle::ContainsTouch(Touch *touch) {\n  GamePoint p = touch->location();\n  if (p.x < 0 || p.x >= SCREEN_WIDTH) {\n    return false;\n  }\n  switch (player_id_) {\n    case PLAYER_1:\n      return p.y >= SCREEN_HEIGHT\/2 && p.y < SCREEN_HEIGHT;\n      break;\n    case PLAYER_2:\n      return p.y < SCREEN_HEIGHT\/2 && p.y >= 0;\n      break;\n  }\n  return false;\n}\n\nbool Paddle::IsGrabbable() {\n  return player_controlled_;\n}\n\nbool Paddle::IsMovable() {\n  return ready_to_play_;\n}\n<commit_msg>Don't move paddle when touching the edge. This lets you hit pause button without moving the paddle.<commit_after>\/\/\n\/\/  paddle.cc\n\/\/  AirHockey\n\/\/\n\/\/  Created by Jonathan Sharkey on 10-04-12.\n\/\/  Copyright 2010 Sharkable. All rights reserved.\n\/\/\n\n#include \"airhockey\/entities\/paddle.h\"\n\n#include <cmath>\n\n#include \"airhockey\/entities\/puck.h\"\n#include \"gameengine\/game_engine.h\"\n#include \"gameengine\/resource_loader.h\"\n#include \"soundengine\/sound_player.h\"\n\nPaddle::Paddle(sp<GameEngine> game_engine, int player_id, PaddleSize size, bool player_controlled,\n               ComputerAI ai_level, vector<sp<Puck> > &pucks)\n    : RoundThing(game_engine),\n      player_id_(player_id),\n      player_controlled_(player_controlled),\n      ready_to_play_(true),\n      ai_level_(ai_level),\n      pucks_(pucks),\n      target_left_corner_(false),\n      target_right_corner_(false),\n      target_away_from_corner_(false) {\n  if (player_id == PLAYER_1) {\n    switch (size) {\n      case psSmall:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_1_small\"));\n        break;\n      case psMedium:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_1_medium\"));\n        break;\n      case psLarge:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_1_large\"));\n        break;\n    }\n  } else {\n    switch (size) {\n      case psSmall:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_2_small\"));\n        break;\n      case psMedium:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_2_medium\"));\n        break;\n      case psLarge:\n        sprite_.set_texture(ResourceLoader::Instance().TextureWithName(\"paddle_2_large\"));\n        break;\n    }    \n  }\n\n  radius_ = PADDLE_RADIUS[size];\n  mass_ = PADDLE_MASS;\n  friction_ = player_controlled_ ? PADDLE_FRICTION : PADDLE_AI_FRICTION;\n}\n\n\nvoid Paddle::SetInitialPositionForPlayer(int playerId) {\n  switch (player_id_) {\n    case PLAYER_1: {\n      x_ = PADDLE_1_X;\n      y_ = PADDLE_1_Y;      \n      break;\n    }\n    case PLAYER_2: {\n      x_ = PADDLE_2_X;\n      y_ = PADDLE_2_Y;      \n      break;\n    }\n  }  \n}\n\nvoid Paddle::KeepInPlayerBounds() {\n  switch (player_id_) {\n    case PLAYER_1: {\n      if (y_ + radius_ > RINK_BOTTOM_Y) {\n        y_ = RINK_BOTTOM_Y - radius_;\n        vy_ = 0;\n      } else if (y_ - radius_ < SCREEN_HEIGHT\/2+1) {\n        y_ = SCREEN_HEIGHT\/2+1 + radius_;\n        vy_ = 0;\n      }\n      break;\n    }\n    case PLAYER_2: {\n      if (y_ - radius_ < RINK_TOP_Y) {\n        y_ = RINK_TOP_Y + radius_;\n        vy_ = 0;\n      } else if (y_ + radius_ > SCREEN_HEIGHT\/2-1) {\n        y_ = SCREEN_HEIGHT\/2-1 - radius_;\n        vy_ = 0;\n      }\n      break;\n    }\n  }\n  if (x_ - radius_ < RINK_LEFT_X) {\n    x_ = RINK_LEFT_X + radius_;\n    vx_ = 0;\n  } else if (x_ + radius_ > RINK_RIGHT_X) {\n    x_ = RINK_RIGHT_X - radius_;\n    vx_ = 0;\n  }\n}\n\nvoid Paddle::RunAITick() {\n  double speed = 0;\n  switch (ai_level_) {\n    case caiBad:\n      speed = 1;\n      break;\n    case caiGood:\n      speed = 1.5;\n      break;\n    case caiExcellent:\n      speed = 2;\n      break;\n    case caiAmazing:\n      speed = 4.5;\n      break;\n  }\n  \n  \/\/ Find the puck that will reach the paddle first.\n  Puck *target = NULL;\n  double bestTime;\n  \n  for (int i = 0; i < pucks_.size(); i++) {\n    Puck *puck = pucks_[i].get();\n    if (!puck->is_active()) {\n      continue;\n    }\n    if (puck->vy() > 4) {\n      continue;\n    }\n    double timeToReach = 999999;\n    if (puck->vy() < 0) {\n      timeToReach = fabs((y_ - puck->y()) \/ puck->vy());\n    }\n    if (puck->y() - puck->radius() > SCREEN_HEIGHT\/2) {\n      continue;\n    }\n    if (target == NULL || timeToReach < bestTime ||\n        (timeToReach == bestTime && puck->y() < target->y())) {\n      target = puck;\n      bestTime = timeToReach;\n    }\n  }\n  \n  if (!target) {\n    target_left_corner_ = target_right_corner_ = target_away_from_corner_ = false;\n  }\n  \n  double targetX;\n  double targetY;\n  \n  if (!target_away_from_corner_ && target && target->y() <= RINK_TOP_Y + radius_ &&\n      fabs(target->vx()) < 5 && fabs(target->vy()) < 5) {\n    if (target->x() < SCREEN_WIDTH \/ 2) {\n      target_left_corner_ = true;\n    } else {\n      target_right_corner_ = true;\n    }\n  }\n  \n  if (target_left_corner_) {\n    targetX = RINK_LEFT_X + radius_;\n    targetY = RINK_TOP_Y + radius_;\n    if (Overlaps(target)) {\n      target_left_corner_ = false;\n      target_away_from_corner_ = true;\n    }\n  } else if (target_right_corner_) {\n    targetX = RINK_RIGHT_X - radius_;\n    targetY = RINK_TOP_Y + radius_;\n    if (Overlaps(target)) {\n      target_right_corner_ = false;\n      target_away_from_corner_ = true;\n    }\n  } else if (target_away_from_corner_) {\n    targetX = SCREEN_WIDTH \/ 2;\n    targetY = RINK_TOP_Y + radius_;\n    if (x_ >= SCREEN_WIDTH \/ 2 - 5 && x_ <= SCREEN_WIDTH \/ 2 + 5) {\n      target_away_from_corner_ = false;\n    }\n  } else if (target) {\n    if (target->y() > y_) {\n      targetX = target->x();\n      targetY = target->y() - target->radius();\n    } else {\n      targetY = target->y() - target->radius() - radius_ - 20;\n      if (target->x() < x_) {\n        targetX = target->x() + target->radius() + radius_ + 20;\n      } else {\n        targetX = target->x() - target->radius() - radius_ - 20;\n      }\n    }\n  } else if (ai_level_ >= caiExcellent) {\n    targetX = PADDLE_2_X;\n    targetY = PADDLE_2_Y;\n  } else if (ai_level_ == caiGood) {\n    targetX = PADDLE_2_X;\n    targetY = y_;\n  } else {\n    targetX = x_;\n    targetY = y_;\n  }\n  \n  \/\/ Get direction of target.\n  double dx = targetX - x_;\n  double dy = targetY - y_;\n  double adx = fabs(dx);\n  double ady = fabs(dy);\n  \n  if (adx <= speed && ady <= speed) {\n    vx_ = 0;\n    vy_ = 0;\n    x_ = targetX;\n    y_ = targetY;\n  } else {\n    if (fabs(dx) < fabs(vx_)) {\n      vx_ = dx;\n    } else if (fabs(dy) < fabs(vy_)) {\n      vy_ = dy;\n    }\n    \n    double dL = sqrt(dx*dx + dy*dy);\n    double nx = dx \/ dL;\n    double ny = dy \/ dL;\n    vx_ += speed * nx;\n    vy_ += speed * ny;\n  }\n}\n\n\n\/\/ ViewEntity\n\nvoid Paddle::Update() {\n  \/\/ Computer AI\n  if (!player_controlled_) {\n    RunAITick();\n  }\n  RoundThing::Update();\n}\n\nvoid Paddle::Render() {\n  sprite_.Draw(game_point_make(x_ - sprite_.content_size().width\/2,\n                               y_ - sprite_.content_size().height\/2),\n               0, (is_grabbed() || !player_controlled_ ? 1.0 : 0.5), 1);\n}\n\n\n\/\/ RoundThing\n\nvoid Paddle::DidBounceOff(ViewEntity *other) {\n  if (typeid(*other) == typeid(Puck)) {\n    SoundPlayer::instance()->playSound(kSoundPaddleHit);\n  }\n}\n\nbool Paddle::ContainsTouch(Touch *touch) {\n  GamePoint p = touch->location();\n  if (p.x < 0 || p.x >= SCREEN_WIDTH) {\n    return false;\n  }\n  switch (player_id_) {\n    case PLAYER_1:\n      return p.y >= SCREEN_HEIGHT \/ 2 && p.y < RINK_BOTTOM_Y && p.x >= RINK_LEFT_X &&\n          p.x < RINK_RIGHT_X;\n      break;\n    case PLAYER_2:\n      return p.y < SCREEN_HEIGHT \/ 2 && p.y >= RINK_TOP_Y && p.x >= RINK_LEFT_X &&\n          p.x < RINK_RIGHT_X;\n      break;\n  }\n  return false;\n}\n\nbool Paddle::IsGrabbable() {\n  return player_controlled_;\n}\n\nbool Paddle::IsMovable() {\n  return ready_to_play_;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Text.h\"\n\nnamespace hm\n{\n\tText::Text()\n\t{\n        text = \"Hume Library\";\n        setPosition(0, 0);\n\t}\n\n\tText::Text(std::string text, Font& font)\n\t{\n\t\tthis->text = text;\n        setText(text, font);\n        setPosition(0, 0);\n\t}\n\n    Text::~Text()\n    {\n        std::cout << \"Freeing sdltext surface...\" << std::endl;\n        SDL_FreeSurface(sdltext);\n    }\n\n\tSDL_Surface* Text::getSurface()\n\t{\n\t\treturn sdltext;\n\t}\n\n\tvoid Text::setText(std::string text, Font& font)\n\t{\n        std::cout << \"Font: \" << font.getFont() << std::endl;\n        std::cout << \"RM: \" << font.getRenderMode() << std::endl;\n\t\tthis->text = text;\n\n\t\t\/\/ Check for font.\n\t\tif(font.getFont() == NULL)\n\t\t{\n\t\t\tstd::cout << \"Can't set text. Font is NULL.\" << std::endl;\n\t\t\treturn;\n        }\n\n        RenderMode rm = font.getRenderMode();\n        if(rm == SOLID)\n            sdltext = TTF_RenderText_Solid(font.getFont(), text.c_str(), font.getColor());\n        if(rm == SHADED)\n            sdltext = TTF_RenderText_Shaded(font.getFont(), text.c_str(), font.getColor(), font.getbColor());\n        if(rm == BLENDED)\n            sdltext = TTF_RenderText_Blended(font.getFont(), text.c_str(), font.getColor());\n        optimize();\n\n\t\treturn;\n\t}\n\n\tstd::string Text::getText()\n\t{\n\t\treturn text;\n    }\n\n    void Text::setPosition(int x, int y)\n    {\n        position.x = x;\n        position.y = y;\n        return;\n    }\n\n\tSDL_Rect* Text::getPosition()\n    {\n\t\treturn &position;\n\t}\n\n    void Text::optimize()\n    {\n        SDL_Surface* unoptimizedText = sdltext;\n        sdltext = SDL_DisplayFormat(unoptimizedText);\n        SDL_FreeSurface(unoptimizedText);\n\n        return;\n    }\n}\n<commit_msg>Adding checking in the Text class before freeing the SDL_Surface in the destructor.<commit_after>#include \"Text.h\"\n\nnamespace hm\n{\n\tText::Text()\n\t{\n        text = \"Hume Library\";\n        setPosition(0, 0);\n\t}\n\n\tText::Text(std::string text, Font& font)\n\t{\n\t\tthis->text = text;\n        setText(text, font);\n        setPosition(0, 0);\n\t}\n\n    Text::~Text()\n    {\n        if(sdltext != NULL)\n        {\n            SDL_FreeSurface(sdltext);\n            sdltext = NULL;\n        }\n    }\n\n\tSDL_Surface* Text::getSurface()\n\t{\n\t\treturn sdltext;\n\t}\n\n\tvoid Text::setText(std::string text, Font& font)\n\t{\n        std::cout << \"Font: \" << font.getFont() << std::endl;\n        std::cout << \"RM: \" << font.getRenderMode() << std::endl;\n\t\tthis->text = text;\n\n\t\t\/\/ Check for font.\n\t\tif(font.getFont() == NULL)\n\t\t{\n\t\t\tstd::cout << \"Can't set text. Font is NULL.\" << std::endl;\n\t\t\treturn;\n        }\n\n        RenderMode rm = font.getRenderMode();\n        if(rm == SOLID)\n            sdltext = TTF_RenderText_Solid(font.getFont(), text.c_str(), font.getColor());\n        if(rm == SHADED)\n            sdltext = TTF_RenderText_Shaded(font.getFont(), text.c_str(), font.getColor(), font.getbColor());\n        if(rm == BLENDED)\n            sdltext = TTF_RenderText_Blended(font.getFont(), text.c_str(), font.getColor());\n        optimize();\n\n\t\treturn;\n\t}\n\n\tstd::string Text::getText()\n\t{\n\t\treturn text;\n    }\n\n    void Text::setPosition(int x, int y)\n    {\n        position.x = x;\n        position.y = y;\n        return;\n    }\n\n\tSDL_Rect* Text::getPosition()\n    {\n\t\treturn &position;\n\t}\n\n    void Text::optimize()\n    {\n        SDL_Surface* unoptimizedText = sdltext;\n        sdltext = SDL_DisplayFormat(unoptimizedText);\n        SDL_FreeSurface(unoptimizedText);\n\n        return;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"clonable.hpp\"\n#include \"..\/builtin\/container\/native\/tnarr.hpp\"\n#include \"validable.hpp\"\n\nnamespace wrd {\n\n\tclass ases;\n\n    \/\/\/ node provides common API to manipulate its sub nodes.\n    class node : public instance, public clonable, public validable {\n        WRD(INTERFACE(node, instance))\n\n    public:\n        node& operator[](const std::string& name) const { return sub(name); }\n\n    public:\n        wbool isSub(const type& it) const { return getType().isSub(it); }\n        wbool isSuper(const type& it) const { return getType().isSuper(it); }\n        template <typename T>\n        wbool isSub() const { return getType().isSub<T>(); }\n        template <typename T>\n        wbool isSuper() const { return getType().isSuper<T>(); }\n\n        virtual ncontainer& subs() = 0;\n        const ncontainer& subs() const WRD_UNCONST_FUNC(subs())\n\n        template <typename T>\n        node& sub(std::function<wbool(const T&)> l) const {\n            return subs().get<T>(l);\n        }\n        node& sub(const std::string& name) const;\n        node& sub(const std::string& name, const ncontainer& args);\n        node& sub(const std::string& name, const wtypes& types);\n        node& sub(const std::string& name, const ncontainer& args) const;\n        node& sub(const std::string& name, const wtypes& types) const;\n\n        template <typename T>\n        tnarr<T> subAll(std::function<wbool(const T&)> l) const {\n            return subs().getAll<T>(l);\n        }\n        narr subAll(const std::string& name) const;\n        narr subAll(const std::string& name, const ncontainer& args);\n        narr subAll(const std::string& name, const wtypes& types);\n        narr subAll(const std::string& name, const ncontainer& args) const;\n        narr subAll(const std::string& name, const wtypes& types) const;\n\n        virtual wbool canRun(const wtypes& typs) const = 0;\n        wbool canRun(const containable& args) const {\n            return canRun(createTypesFromArgs(args));\n        }\n\n        virtual str run(const containable& args) = 0;\n        str run();\n\n        \/\/\/ release all holding resources and ready to be terminated.\n        \/\/\/ @remark some class won't be able to reinitialize after rel() got called.\n        virtual void rel() {}\n\n        virtual const std::string& getName() const {\n            static std::string dummy = \"\";\n            return dummy;\n        }\n\n        template <typename T>\n        wbool is() const {\n            return is(ttype<T>::get());\n        }\n        wbool is(const type& to) const {\n\t\t\treturn getType().is(to);\n        }\n        template <typename T>\n        tstr<T> as() const {\n            return as(ttype<T>::get());\n        }\n        str as(const type& to) const {\n\t\t\treturn getType().as(*this, to);\n\t\t}\n\n        template <typename T>\n        wbool isImpli() const {\n            return isImpli(ttype<T>::get());\n        }\n        wbool isImpli(const type& to) const {\n\t\t\treturn getType().isImpli(to);\n        }\n        template <typename T>\n        tstr<T> asImpli() const {\n\t\t\treturn asImpli(ttype<T>::get());\n\t\t}\n        str asImpli(const type& to) const {\n\t\t\treturn getType().asImpli(*this, to);\n\t\t}\n\n        wbool isValid() const override {\n            return true;\n        }\n\n        \/\/\/ getType() returns what it is. opposite to it, this returns what this class will\n        \/\/\/ represents after evaluation.\n        \/\/\/\n        \/\/\/ for example, the 'expr' class has derived from this node class. and if an user call the\n        \/\/\/ funcs to get type of it, class 'wtype' of 'expr' will be returned.\n        \/\/\/ but if that user call the 'getEvalType()' then the 'expr' object evaluate its terms and\n        \/\/\/ returns type of the output. it could be integer if it was 'addExpr' and all terms are\n        \/\/\/ constructed with integers.\n        virtual const wtype& getEvalType() const {\n            return getType();\n        }\n\n        static wtypes createTypesFromArgs(const containable& args) {\n            wtypes ret;\n            for(iter e=args.begin(); e ;e++)\n                ret.push_back((wtype*) &e->getEvalType());\n            return ret;\n        }\n    };\n\n    \/\/\/ managed object.\n    \/*class NObj : public obj {\n        WRD(CLASS(NObj, obj))\n\n    public:\n        NObj(): super(\"\", new narr()) {}\n    };*\/\n\n    \/*\n    \/\/ iteration #1:\n    \/\/ 강제로 func를 상속한 c++ 클래스를 만들고 그 안에서 hello world 찍기\n    \/\/ * node의 기본적인 API의 틀만 적기\n    \/\/ * 아무런 구현이 없는 wtype클래스의 injection\n    \/\/ * func.run()의 가구현\n    \/\/ * ref 구현\n    class node : public instance, public containable {\n        WRD(CLASS(node, instance))\n\n    public:\n        wbool isInit() {\n            return _isInit;\n        }\n\n        virtual wbool init() {\n            if(isInit()) return true;\n\n            _setInit(true)\n            return true;\n        }\n\n        virtual void rel() {\n            _setInit(false);\n        }\n\n        void _setInit(wbool newVal) { _isInit = newVal; }\n        virtual SequentialContainer getSubs() = 0;\n\n        using containable::get;\n        template <typename T>\n        tarr<T> get(std::string name, wtype... args);\n        arr get(std::string name, wtype... args);\n        template <typename T>\n        tarr<T&> get(std::string name, wtype args[]);\n        arr get(std::string name, wtype args[]);\n        template <typename T>\n        tarr<T> get(std::string);\n        arr get(std::string);\n\n        \/\/\/ @param args nullable.\n        virtual ret<ref> run(arr& args);\n        ret<ref> run() { return run(nulOf<arr>()); }\n\n        node& getOrigin();\n\n    protected:\n        wbool del(node& it) override;\n        wbool add(node& it) override;\n\n    private:\n        wbool _isInit;\n    };\n\n    class ref : public node, tbindable<node> {\n        WRD(CLASS(tref, node))\n\n        node& _get() override { return *_ptr; }\n        \/\/ override get() funcs...\n        \/\/ isInit...\n\n        wbool isBind() { return _ptr.isBind(); }\n        \/\/ override tbindable...\n\n        ret<ref> run(arr& args) override;\n\n        str _ptr;\n    };\n\n    template <typename T>\n    class tref : public ref {\n    };\n\n    class func : public scope {\n        WRD(CLASS(func, scope))\n\n    public:\n        ret<ref> run(arr& args) override;\n    };\n\n\n\n\n    \/\/ iteration #2:\n    \/\/ 강제로 AST를 조직함. Console 이라는 obj 안에 있는 void print(msg str)를 실행하는 callExpr 실행\n    \/\/ 강제로 obj를 scope에 등록을 해둔 상태에서 callexpr를 실행함.\n    \/\/ * obj\n    \/\/ * str\n    \/\/ * wtype의 묵시적 형변환\n    \/\/ * 묵시적 형변환을 수행하는 func.run()\n    \/\/ * scope의 obj scope 등록 기능\n    \/\/ * obj의 scope 등록\n   class obj : public scope {\n   };\n    class str : public obj {\n    };\n    class Chain {\n    };\n    class frame : ? {\n    };\n    class stackFrame : public ?? {\n    };\n    class Expr : public node {\n    };\n    class CallExpr : public Expr {\n    };\n   class wtype : public type {\n   };\n\n    \/\/ iteration #3:\n    \/\/ BlockExpr 로 앞선 callExpr를 하도록 AST를 작성. 변수의 정의, 접근을 수행하는 expr 추가.\n    \/\/ sys 라는 module 을 강제로 만들고 그 안에 console obj를 둠. origin obj를 정의함.\n    \/\/ * module scope 기반으로 한 origin obj의 scope 구성\n    class Module : ? {\n    };\n    class Moduler : ? {\n    };\n    class BlockExpr : {\n    };\n    class AccessExpr : ? {\n    };\n    class DeclExpr : ? {\n    };\n\n    \/\/ iteration #4:\n    \/\/ bridge API를 만들어서 외부의 test c++ 클래스를 불러와 moduler에 넣을 수 있도록 함.\n    \/\/ 매우 단순한 test c++ 모듈 1개 작성\n    \/\/ * module import.\n\n    \/\/ iteration #5:\n    \/\/ Visitation과 bison을 활용해서 func 호출과 정의 할 수있게 만듬\n    \/\/ * bison, lex\n    \/\/ * Visitor, visitation\n    \/\/ * funcDefExpr\n    class Visitable {\n    };\n    class Visitation : public instance, public Visitable {\n    };\n    template <typename T, typename S = Visitation>\n    class TVisitation : public S {\n    };\n    class Visitor : public Thing, public Visitable {\n    };\n    template <typename T>\n    class TVisitor : public Visitor {\n    };\n\n    \/\/ iteration #5:\n    \/\/ 간단한 메인함수 안에 test 모듈의 print(msg str)를 호출 하게 .wrd파일의 interpreting\n    \/\/ * importExpr\n    \/\/ * moduler는 시작시 scanning\n    \/\/ * 만든걸 모두 연동\n    \/\/ * 코드를 수행하는 thread\n    class ImportExpr : public Expr {\n    };\n    class thread : public ? {\n    }; *\/\n}\n<commit_msg>wrd: style: remove codes of prototype version<commit_after>#pragma once\n\n#include \"clonable.hpp\"\n#include \"..\/builtin\/container\/native\/tnarr.hpp\"\n#include \"validable.hpp\"\n\nnamespace wrd {\n\n\tclass ases;\n\n    \/\/\/ node provides common API to manipulate its sub nodes.\n    class node : public instance, public clonable, public validable {\n        WRD(INTERFACE(node, instance))\n\n    public:\n        node& operator[](const std::string& name) const { return sub(name); }\n\n    public:\n        wbool isSub(const type& it) const { return getType().isSub(it); }\n        wbool isSuper(const type& it) const { return getType().isSuper(it); }\n        template <typename T>\n        wbool isSub() const { return getType().isSub<T>(); }\n        template <typename T>\n        wbool isSuper() const { return getType().isSuper<T>(); }\n\n        virtual ncontainer& subs() = 0;\n        const ncontainer& subs() const WRD_UNCONST_FUNC(subs())\n\n        template <typename T>\n        node& sub(std::function<wbool(const T&)> l) const {\n            return subs().get<T>(l);\n        }\n        node& sub(const std::string& name) const;\n        node& sub(const std::string& name, const ncontainer& args);\n        node& sub(const std::string& name, const wtypes& types);\n        node& sub(const std::string& name, const ncontainer& args) const;\n        node& sub(const std::string& name, const wtypes& types) const;\n\n        template <typename T>\n        tnarr<T> subAll(std::function<wbool(const T&)> l) const {\n            return subs().getAll<T>(l);\n        }\n        narr subAll(const std::string& name) const;\n        narr subAll(const std::string& name, const ncontainer& args);\n        narr subAll(const std::string& name, const wtypes& types);\n        narr subAll(const std::string& name, const ncontainer& args) const;\n        narr subAll(const std::string& name, const wtypes& types) const;\n\n        virtual wbool canRun(const wtypes& typs) const = 0;\n        wbool canRun(const containable& args) const {\n            return canRun(createTypesFromArgs(args));\n        }\n\n        virtual str run(const containable& args) = 0;\n        str run();\n\n        \/\/\/ release all holding resources and ready to be terminated.\n        \/\/\/ @remark some class won't be able to reinitialize after rel() got called.\n        virtual void rel() {}\n\n        virtual const std::string& getName() const {\n            static std::string dummy = \"\";\n            return dummy;\n        }\n\n        template <typename T>\n        wbool is() const {\n            return is(ttype<T>::get());\n        }\n        wbool is(const type& to) const {\n\t\t\treturn getType().is(to);\n        }\n        template <typename T>\n        tstr<T> as() const {\n            return as(ttype<T>::get());\n        }\n        str as(const type& to) const {\n\t\t\treturn getType().as(*this, to);\n\t\t}\n\n        template <typename T>\n        wbool isImpli() const {\n            return isImpli(ttype<T>::get());\n        }\n        wbool isImpli(const type& to) const {\n\t\t\treturn getType().isImpli(to);\n        }\n        template <typename T>\n        tstr<T> asImpli() const {\n\t\t\treturn asImpli(ttype<T>::get());\n\t\t}\n        str asImpli(const type& to) const {\n\t\t\treturn getType().asImpli(*this, to);\n\t\t}\n\n        wbool isValid() const override {\n            return true;\n        }\n\n        \/\/\/ getType() returns what it is. opposite to it, this returns what this class will\n        \/\/\/ represents after evaluation.\n        \/\/\/\n        \/\/\/ for example, the 'expr' class has derived from this node class. and if an user call the\n        \/\/\/ funcs to get type of it, class 'wtype' of 'expr' will be returned.\n        \/\/\/ but if that user call the 'getEvalType()' then the 'expr' object evaluate its terms and\n        \/\/\/ returns type of the output. it could be integer if it was 'addExpr' and all terms are\n        \/\/\/ constructed with integers.\n        virtual const wtype& getEvalType() const {\n            return getType();\n        }\n\n        static wtypes createTypesFromArgs(const containable& args) {\n            wtypes ret;\n            for(iter e=args.begin(); e ;e++)\n                ret.push_back((wtype*) &e->getEvalType());\n            return ret;\n        }\n    };\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"joedb\/concurrency\/Embedded_Connection.h\"\n#include \"joedb\/journal\/File.h\"\n#include \"joedb\/io\/main_exception_catcher.h\"\n#include \"joedb\/io\/run_interpreted_client.h\"\n\nnamespace joedb\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n static int main(int argc, char **argv)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (argc != 3)\n  {\n   std::cerr << \"usage: \" << argv[0] << \" <client.joedb> <server.joedb>\\n\";\n   return 1;\n  }\n  else\n  {\n   const char * const client_file_name = argv[1];\n   const char * const server_file_name = argv[2];\n\n   File server_file(server_file_name, Open_Mode::write_existing_or_create_new);\n   Embedded_Connection connection(server_file);\n   Interpreted_Client client(connection, server_file);\n   run_interpreted_client(connection, client_file_name);\n  }\n\n  return 0;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint main(int argc, char **argv)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n return joedb::main_exception_catcher(joedb::main, argc, argv);\n}\n<commit_msg>switch client<->server on the command line for joedb_embedded_client<commit_after>#include \"joedb\/concurrency\/Embedded_Connection.h\"\n#include \"joedb\/journal\/File.h\"\n#include \"joedb\/io\/main_exception_catcher.h\"\n#include \"joedb\/io\/run_interpreted_client.h\"\n\nnamespace joedb\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n static int main(int argc, char **argv)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (argc != 3)\n  {\n   std::cerr << \"usage: \" << argv[0] << \" <server.joedb> <client.joedb>\\n\";\n   return 1;\n  }\n  else\n  {\n   const char * const server_file_name = argv[1];\n   const char * const client_file_name = argv[2];\n\n   File server_file(server_file_name, Open_Mode::write_existing_or_create_new);\n   Embedded_Connection connection(server_file);\n   Interpreted_Client client(connection, server_file);\n   run_interpreted_client(connection, client_file_name);\n  }\n\n  return 0;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint main(int argc, char **argv)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n return joedb::main_exception_catcher(joedb::main, argc, argv);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\nAliAnalysisTaskEMCALIsoPhoton *AddTaskEMCALIsoPhoton()\n{\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(\"AddTaskEMCALIsoPhoton\", \"No analysis manager to connect to.\");\n    return NULL;\n  }  \n  \n  \/\/ Create the task and configure it.\n  \/\/===========================================================================\n  AliAnalysisTaskEMCALIsoPhoton* ana = new  AliAnalysisTaskEMCALIsoPhoton(\"\");\n  \n  ana->SelectCollisionCandidates( AliVEvent::kEMC1 | AliVEvent::kMB | AliVEvent::kEMC7 | AliVEvent::kINT7);\n  \n  Bool_t isMC = (mgr->GetMCtruthEventHandler() != NULL);\n\n  \/\/ana->SetClusThreshold(clusTh);\n  ana->SetTrainMode(kTRUE);\n  \/\/ana->SetGridMode(kTRUE);\n  \/\/ ana->SetMcMode(isMC);\n  \n  AliESDtrackCuts *cutsp = new AliESDtrackCuts;\n  cutsp->SetMinNClustersTPC(70);\n  cutsp->SetMinRatioCrossedRowsOverFindableClustersTPC(0.8);\n  cutsp->SetMaxChi2PerClusterTPC(4);\n  cutsp->SetRequireTPCRefit(kTRUE);\n  cutsp->SetAcceptKinkDaughters(kFALSE);\n  cutsp->SetMaxDCAToVertexZ(3.2);\n  cutsp->SetMaxDCAToVertexXY(2.4);\n  cutsp->SetDCAToVertex2D(kTRUE);\n  cutsp->SetPtRange(0.2);\n  cutsp->SetEtaRange(-1.0,1.0);\n  ana->SetPrimTrackCuts(cutsp);\n  ana->SetPeriod(period.Data());\n  if(period.Contains(\"11\"))\n    ana->SetGeoName(\"EMCAL_COMPLETEV1\");\n  else\n    ana->SetGeoName(\"EMCAL_FIRSTYEARV1\");\n\n  \n  mgr->AddTask(ana);\n  \n  \/\/ Create ONLY the output containers for the data produced by the task.\n  \/\/ Get and connect other common input\/output containers via the manager as below\n  \/\/==============================================================================\n  AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"histosEMCALIsoPhoton\", \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  \n  mgr->ConnectInput  (ana, 0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput (ana, 1, coutput1 );\n   \n  return ana;\n}\n<commit_msg>bugfix<commit_after>\n\nAliAnalysisTaskEMCALIsoPhoton *AddTaskEMCALIsoPhoton(\nTString period = \"LHC11d\"\n)\n{\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(\"AddTaskEMCALIsoPhoton\", \"No analysis manager to connect to.\");\n    return NULL;\n  }  \n  \n  \/\/ Create the task and configure it.\n  \/\/===========================================================================\n  AliAnalysisTaskEMCALIsoPhoton* ana = new  AliAnalysisTaskEMCALIsoPhoton(\"\");\n  \n  ana->SelectCollisionCandidates( AliVEvent::kEMC1 | AliVEvent::kMB | AliVEvent::kEMC7 | AliVEvent::kINT7);\n  \n  Bool_t isMC = (mgr->GetMCtruthEventHandler() != NULL);\n\n  \/\/ana->SetClusThreshold(clusTh);\n  \n  ana->SetTrainMode(kTRUE);\n  \/\/ana->SetGridMode(kTRUE);\n  \/\/ ana->SetMcMode(isMC);\n  \n  AliESDtrackCuts *cutsp = new AliESDtrackCuts;\n  cutsp->SetMinNClustersTPC(70);\n  cutsp->SetMinRatioCrossedRowsOverFindableClustersTPC(0.8);\n  cutsp->SetMaxChi2PerClusterTPC(4);\n  cutsp->SetRequireTPCRefit(kTRUE);\n  cutsp->SetAcceptKinkDaughters(kFALSE);\n  cutsp->SetMaxDCAToVertexZ(3.2);\n  cutsp->SetMaxDCAToVertexXY(2.4);\n  cutsp->SetDCAToVertex2D(kTRUE);\n  cutsp->SetPtRange(0.2);\n  cutsp->SetEtaRange(-1.0,1.0);\n  ana->SetPrimTrackCuts(cutsp);\n  ana->SetPeriod(period.Data());\n  if(period.Contains(\"11\"))\n    ana->SetGeoName(\"EMCAL_COMPLETEV1\");\n  else\n    ana->SetGeoName(\"EMCAL_FIRSTYEARV1\");\n\n  \n  mgr->AddTask(ana);\n  \n  \/\/ Create ONLY the output containers for the data produced by the task.\n  \/\/ Get and connect other common input\/output containers via the manager as below\n  \/\/==============================================================================\n  AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"histosEMCALIsoPhoton\", \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  \n  mgr->ConnectInput  (ana, 0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput (ana, 1, coutput1 );\n   \n  return ana;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"chainerx\/native\/native_device.h\"\n\n#include <cstdint>\n\n#include \"chainerx\/array.h\"\n#include \"chainerx\/axes.h\"\n#include \"chainerx\/device.h\"\n#include \"chainerx\/dtype.h\"\n#include \"chainerx\/kernels\/reduction.h\"\n#include \"chainerx\/kernels\/sorting.h\"\n#include \"chainerx\/macro.h\"\n#include \"chainerx\/native\/kernel_regist.h\"\n#include \"chainerx\/native\/reduce.h\"\n#include \"chainerx\/numeric.h\"\n#include \"chainerx\/numeric_limits.h\"\n#include \"chainerx\/shape.h\"\n\nnamespace chainerx {\nnamespace native {\nnamespace {\n\nclass NativeArgMaxKernel : public ArgMaxKernel {\npublic:\n    void Call(const Array& a, const Axes& axis, const Array& out) override {\n        CHAINERX_ASSERT(std::all_of(axis.begin(), axis.end(), [&a](int8_t i) { return a.shape()[i] > 0; }));\n        CHAINERX_ASSERT(internal::IsValidReductionShape(a.shape(), axis, out.shape(), false));\n        a.device().CheckDevicesCompatible(a, out);\n\n        VisitDtype(a.dtype(), [&a, &axis, &out](auto pt) {\n            using T = typename decltype(pt)::type;\n            struct Impl {\n                struct MaxAndArgMax {\n                    T max;\n                    int64_t argmax;\n                };\n\n                MaxAndArgMax Identity() { return {T{}, -1}; }\n                MaxAndArgMax MapIn(T in, int64_t index) { return {in, index}; }\n                void Reduce(MaxAndArgMax next, MaxAndArgMax& accum) {\n                    if (accum.argmax < 0 || accum.max < next.max) {\n                        accum = next;\n                    }\n                }\n                int64_t MapOut(MaxAndArgMax accum) { return accum.argmax; }\n            };\n            Reduce<T, int64_t>(a, axis, out, Impl{});\n        });\n    }\n};\n\nCHAINERX_NATIVE_REGISTER_KERNEL(ArgMaxKernel, NativeArgMaxKernel);\n\nclass NativeArgMinKernel : public ArgMinKernel {\npublic:\n    void Call(const Array& a, const Axes& axis, const Array& out) override {\n        CHAINERX_ASSERT(std::all_of(axis.begin(), axis.end(), [&a](int8_t i) { return a.shape()[i] > 0; }));\n        CHAINERX_ASSERT(internal::IsValidReductionShape(a.shape(), axis, out.shape(), false));\n        a.device().CheckDevicesCompatible(a, out);\n\n        VisitDtype(a.dtype(), [&a, &axis, &out](auto pt) {\n            using T = typename decltype(pt)::type;\n            struct Impl {\n                struct MinAndArgMin {\n                    T min;\n                    int64_t argmin;\n                };\n\n                MinAndArgMin Identity() { return {T{}, -1}; }\n                MinAndArgMin MapIn(T in, int64_t index) { return {in, index}; }\n                void Reduce(MinAndArgMin next, MinAndArgMin& accum) {\n                    if (accum.argmin < 0 || accum.min > next.min) {\n                        accum = next;\n                    }\n                }\n                int64_t MapOut(MinAndArgMin accum) { return accum.argmin; }\n            };\n            Reduce<T, int64_t>(a, axis, out, Impl{});\n        });\n    }\n};\n\nCHAINERX_NATIVE_REGISTER_KERNEL(ArgMinKernel, NativeArgMinKernel);\n\nclass NativeSumKernel : public SumKernel {\npublic:\n    void Call(const Array& a, const Axes& axis, const Array& out) override {\n        CHAINERX_ASSERT(internal::IsValidReductionShape(a.shape(), axis, out.shape(), true));\n        a.device().CheckDevicesCompatible(a, out);\n\n        auto do_sum = [&a, &axis, &out](auto in_pt, auto out_pt) {\n            using In = typename decltype(in_pt)::type;\n            using Out = typename decltype(out_pt)::type;\n            using Accum = std::conditional_t<std::is_same<Out, Float16>{}, float, Out>;\n            struct Impl {\n                Accum Identity() { return Accum{0}; }\n                Accum MapIn(In in, int64_t \/*index*\/) { return static_cast<Accum>(in); }\n                void Reduce(Accum next, Accum& accum) { accum += next; }\n                Out MapOut(Accum accum) { return static_cast<Out>(accum); }\n            };\n            Reduce<In, Out>(a, axis, out, Impl{});\n        };\n\n        VisitDtype(out.dtype(), [a_dtype = a.dtype(), &do_sum](auto out_pt) { VisitDtype(a_dtype, do_sum, out_pt); });\n    }\n};\n\nCHAINERX_NATIVE_REGISTER_KERNEL(SumKernel, NativeSumKernel);\n\nclass NativeCumsumKernel : public CumsumKernel {\npublic:\n    void Call(const Array& a, int8_t axis, const Array& out) override {\n        a.device().CheckDevicesCompatible(a, out);\n\n        VisitDtype(out.dtype(), [&a, axis, &out](auto pt) {\n            using T = typename decltype(pt)::type;\n\n            IndexableArray<const T> a_iarray{a};\n            IndexableArray<T> out_iarray{out};\n            Indexer<> out_indexer{out.shape()};\n            Indexer<> prev_indexer{a.shape()};\n\n            int64_t axis_dim = a.shape()[axis];\n\n            \/\/ left: set of input dimensions lower than the axis\n            \/\/ right: set of input dimensions higher than the axis\n            Shape left_shape{a.shape().begin(), a.shape().begin() + axis};\n            Shape right_shape{a.shape().begin() + (axis + 1), a.shape().end()};\n            Shape axis_shape{axis_dim};  \/\/ always ndim==1\n\n            Indexer<> left_indexer{left_shape};\n            Indexer<> right_indexer{right_shape};\n            Indexer<> indices_indexer{axis_shape};\n\n            auto it_left = left_indexer.It(0);\n            auto it_right = right_indexer.It(0);\n            auto it_out = out_indexer.It(0);\n            auto it_prev = prev_indexer.It(0);\n\n            \/\/ Copy\n            for (auto it = out_indexer.It(0); it; ++it) {\n                out_iarray[it] = a_iarray[it];\n            }\n\n            for (auto it = indices_indexer.It(1); it; ++it) {\n                int64_t index = it.raw_index();\n                index = index % axis_dim;\n                CHAINERX_ASSERT(0 <= index);\n                CHAINERX_ASSERT(index < axis_dim);\n\n                it_out.CopyIndex(it, it_left.ndim());\n\n                for (it_left.Restart(); it_left; ++it_left) {\n                    it_out.CopyIndex(it_left);\n\n                    for (it_right.Restart(); it_right; ++it_right) {\n                        it_out.CopyIndex(it_right, it_left.ndim() + it.ndim());\n                        it_prev.CopyIndex(it_out);\n                        it_prev.index()[axis] -= 1;\n                        native_internal::StorageToDataType<T>(out_iarray[it_out]) +=\n                                native_internal::StorageToDataType<T>(out_iarray[it_prev]);\n                        it_prev.index()[axis] += 1;\n                    }\n                }\n            }\n        });\n    }\n};\n\nCHAINERX_NATIVE_REGISTER_KERNEL(CumsumKernel, NativeCumsumKernel);\n\n}  \/\/ namespace\n}  \/\/ namespace native\n}  \/\/ namespace chainerx\n<commit_msg>Add missing header<commit_after>#include \"chainerx\/native\/native_device.h\"\n\n#include <cstdint>\n\n#include \"chainerx\/array.h\"\n#include \"chainerx\/axes.h\"\n#include \"chainerx\/device.h\"\n#include \"chainerx\/dtype.h\"\n#include \"chainerx\/kernels\/reduction.h\"\n#include \"chainerx\/kernels\/sorting.h\"\n#include \"chainerx\/macro.h\"\n#include \"chainerx\/native\/data_type.h\"\n#include \"chainerx\/native\/kernel_regist.h\"\n#include \"chainerx\/native\/reduce.h\"\n#include \"chainerx\/numeric.h\"\n#include \"chainerx\/numeric_limits.h\"\n#include \"chainerx\/shape.h\"\n\nnamespace chainerx {\nnamespace native {\nnamespace {\n\nclass NativeArgMaxKernel : public ArgMaxKernel {\npublic:\n    void Call(const Array& a, const Axes& axis, const Array& out) override {\n        CHAINERX_ASSERT(std::all_of(axis.begin(), axis.end(), [&a](int8_t i) { return a.shape()[i] > 0; }));\n        CHAINERX_ASSERT(internal::IsValidReductionShape(a.shape(), axis, out.shape(), false));\n        a.device().CheckDevicesCompatible(a, out);\n\n        VisitDtype(a.dtype(), [&a, &axis, &out](auto pt) {\n            using T = typename decltype(pt)::type;\n            struct Impl {\n                struct MaxAndArgMax {\n                    T max;\n                    int64_t argmax;\n                };\n\n                MaxAndArgMax Identity() { return {T{}, -1}; }\n                MaxAndArgMax MapIn(T in, int64_t index) { return {in, index}; }\n                void Reduce(MaxAndArgMax next, MaxAndArgMax& accum) {\n                    if (accum.argmax < 0 || accum.max < next.max) {\n                        accum = next;\n                    }\n                }\n                int64_t MapOut(MaxAndArgMax accum) { return accum.argmax; }\n            };\n            Reduce<T, int64_t>(a, axis, out, Impl{});\n        });\n    }\n};\n\nCHAINERX_NATIVE_REGISTER_KERNEL(ArgMaxKernel, NativeArgMaxKernel);\n\nclass NativeArgMinKernel : public ArgMinKernel {\npublic:\n    void Call(const Array& a, const Axes& axis, const Array& out) override {\n        CHAINERX_ASSERT(std::all_of(axis.begin(), axis.end(), [&a](int8_t i) { return a.shape()[i] > 0; }));\n        CHAINERX_ASSERT(internal::IsValidReductionShape(a.shape(), axis, out.shape(), false));\n        a.device().CheckDevicesCompatible(a, out);\n\n        VisitDtype(a.dtype(), [&a, &axis, &out](auto pt) {\n            using T = typename decltype(pt)::type;\n            struct Impl {\n                struct MinAndArgMin {\n                    T min;\n                    int64_t argmin;\n                };\n\n                MinAndArgMin Identity() { return {T{}, -1}; }\n                MinAndArgMin MapIn(T in, int64_t index) { return {in, index}; }\n                void Reduce(MinAndArgMin next, MinAndArgMin& accum) {\n                    if (accum.argmin < 0 || accum.min > next.min) {\n                        accum = next;\n                    }\n                }\n                int64_t MapOut(MinAndArgMin accum) { return accum.argmin; }\n            };\n            Reduce<T, int64_t>(a, axis, out, Impl{});\n        });\n    }\n};\n\nCHAINERX_NATIVE_REGISTER_KERNEL(ArgMinKernel, NativeArgMinKernel);\n\nclass NativeSumKernel : public SumKernel {\npublic:\n    void Call(const Array& a, const Axes& axis, const Array& out) override {\n        CHAINERX_ASSERT(internal::IsValidReductionShape(a.shape(), axis, out.shape(), true));\n        a.device().CheckDevicesCompatible(a, out);\n\n        auto do_sum = [&a, &axis, &out](auto in_pt, auto out_pt) {\n            using In = typename decltype(in_pt)::type;\n            using Out = typename decltype(out_pt)::type;\n            using Accum = std::conditional_t<std::is_same<Out, Float16>{}, float, Out>;\n            struct Impl {\n                Accum Identity() { return Accum{0}; }\n                Accum MapIn(In in, int64_t \/*index*\/) { return static_cast<Accum>(in); }\n                void Reduce(Accum next, Accum& accum) { accum += next; }\n                Out MapOut(Accum accum) { return static_cast<Out>(accum); }\n            };\n            Reduce<In, Out>(a, axis, out, Impl{});\n        };\n\n        VisitDtype(out.dtype(), [a_dtype = a.dtype(), &do_sum](auto out_pt) { VisitDtype(a_dtype, do_sum, out_pt); });\n    }\n};\n\nCHAINERX_NATIVE_REGISTER_KERNEL(SumKernel, NativeSumKernel);\n\nclass NativeCumsumKernel : public CumsumKernel {\npublic:\n    void Call(const Array& a, int8_t axis, const Array& out) override {\n        a.device().CheckDevicesCompatible(a, out);\n\n        VisitDtype(out.dtype(), [&a, axis, &out](auto pt) {\n            using T = typename decltype(pt)::type;\n\n            IndexableArray<const T> a_iarray{a};\n            IndexableArray<T> out_iarray{out};\n            Indexer<> out_indexer{out.shape()};\n            Indexer<> prev_indexer{a.shape()};\n\n            int64_t axis_dim = a.shape()[axis];\n\n            \/\/ left: set of input dimensions lower than the axis\n            \/\/ right: set of input dimensions higher than the axis\n            Shape left_shape{a.shape().begin(), a.shape().begin() + axis};\n            Shape right_shape{a.shape().begin() + (axis + 1), a.shape().end()};\n            Shape axis_shape{axis_dim};  \/\/ always ndim==1\n\n            Indexer<> left_indexer{left_shape};\n            Indexer<> right_indexer{right_shape};\n            Indexer<> indices_indexer{axis_shape};\n\n            auto it_left = left_indexer.It(0);\n            auto it_right = right_indexer.It(0);\n            auto it_out = out_indexer.It(0);\n            auto it_prev = prev_indexer.It(0);\n\n            \/\/ Copy\n            for (auto it = out_indexer.It(0); it; ++it) {\n                out_iarray[it] = a_iarray[it];\n            }\n\n            for (auto it = indices_indexer.It(1); it; ++it) {\n                int64_t index = it.raw_index();\n                index = index % axis_dim;\n                CHAINERX_ASSERT(0 <= index);\n                CHAINERX_ASSERT(index < axis_dim);\n\n                it_out.CopyIndex(it, it_left.ndim());\n\n                for (it_left.Restart(); it_left; ++it_left) {\n                    it_out.CopyIndex(it_left);\n\n                    for (it_right.Restart(); it_right; ++it_right) {\n                        it_out.CopyIndex(it_right, it_left.ndim() + it.ndim());\n                        it_prev.CopyIndex(it_out);\n                        it_prev.index()[axis] -= 1;\n                        native_internal::StorageToDataType<T>(out_iarray[it_out]) +=\n                                native_internal::StorageToDataType<T>(out_iarray[it_prev]);\n                        it_prev.index()[axis] += 1;\n                    }\n                }\n            }\n        });\n    }\n};\n\nCHAINERX_NATIVE_REGISTER_KERNEL(CumsumKernel, NativeCumsumKernel);\n\n}  \/\/ namespace\n}  \/\/ namespace native\n}  \/\/ namespace chainerx\n<|endoftext|>"}
{"text":"<commit_before>AliAnalysisTaskSELc2V0bachelor *AddTaskLc2V0bachelor(TString finname=\"Lc2V0bachelorCuts.root\",\n\t\t\t\t\t\t     Bool_t theMCon=kFALSE,\n\t\t\t\t\t\t     Bool_t onTheFly=kFALSE,\n\t\t\t\t\t\t     Bool_t writeVariableTree=kTRUE,\n\t\t\t\t\t\t     Int_t nTour=0,\n\t\t\t\t\t\t     Bool_t additionalChecks=kFALSE,\n\t\t\t\t\t\t     Bool_t trackRotation=kFALSE)\n\n{\n\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) {\n    ::Error(\"AddTaskLc2V0bachelor\", \"No analysis manager to connect to.\");\n    return NULL;\n  }  \n  \n  \/\/ cuts are stored in a TFile generated by makeTFile4CutsLc2V0bachelor.C in .\/macros\/\n  \/\/ set there the cuts!!!!!\n\n  Bool_t stdcuts=kFALSE;\n  TFile* filecuts;\n  if( finname.EqualTo(\"\") ) {\n    stdcuts=kTRUE; \n  } else {\n      filecuts=TFile::Open(finname.Data());\n      if(!filecuts ||(filecuts&& !filecuts->IsOpen())){\n\tAliFatal(\"Input file not found : check your cut object\");\n      }\n  }\n\n  cout << \" Is it std on not std cut? \" << stdcuts << endl;\n  AliRDHFCutsLctoV0* RDHFCutsLctoV0anal = new AliRDHFCutsLctoV0();\n  if (stdcuts) RDHFCutsLctoV0anal->SetStandardCutsPP2010();\n  else RDHFCutsLctoV0anal = (AliRDHFCutsLctoV0*)filecuts->Get(\"LctoV0AnalysisCuts\");\n  RDHFCutsLctoV0anal->SetName(\"LctoV0AnalysisCuts\");\n  RDHFCutsLctoV0anal->SetMinPtCandidate(-1.);\n  RDHFCutsLctoV0anal->SetMaxPtCandidate(10000.);\n\n\n  \/\/ mm let's see if everything is ok\n  if (!RDHFCutsLctoV0anal) {\n    cout << \"Specific AliRDHFCutsLctoV0 not found\\n\";\n    return;\n  }\n\n\n  \/\/CREATE THE TASK\n\n  printf(\"CREATE TASK\\n\");\n  AliAnalysisTaskSELc2V0bachelor *task = new AliAnalysisTaskSELc2V0bachelor(\"AliAnalysisTaskSELc2V0bachelor\",RDHFCutsLctoV0anal,onTheFly,writeVariableTree,additionalChecks,trackRotation);\n  task->SetAdditionalChecks(additionalChecks);\n  task->SetMC(theMCon);\n  task->SetK0SAnalysis(kTRUE);\n  task->SetDebugLevel(0);\n  mgr->AddTask(task);\n\n  \/\/ Create and connect containers for input\/output  \n  TString outputfile = AliAnalysisManager::GetCommonFileName();\n  outputfile += \":PWG3_D2H_Lc2pK0S_\";\n  outputfile += nTour;\n\n  mgr->ConnectInput(task,0,mgr->GetCommonInputContainer());\n\n  \/\/ ----- output data -----\n  AliAnalysisDataContainer *coutput1   = mgr->CreateContainer(Form(\"chist%1d\",nTour),TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data()); \/\/ general histos\n  mgr->ConnectOutput(task,1,coutput1);\n  AliAnalysisDataContainer *coutputLc2 = mgr->CreateContainer(Form(\"Lc2pK0Scounter%1d\",nTour),AliNormalizationCounter::Class(),AliAnalysisManager::kOutputContainer, outputfile.Data()); \/\/counter\n  mgr->ConnectOutput(task,2,coutputLc2);\n  AliAnalysisDataContainer *coutputLc3 = mgr->CreateContainer(Form(\"Lc2pK0SCuts%1d\",nTour),AliRDHFCutsLctoV0::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data()); \/\/ cuts\n  mgr->ConnectOutput(task,3,coutputLc3);\n  if (!writeVariableTree) {\n    AliAnalysisDataContainer *coutputLc4 = mgr->CreateContainer(Form(\"Lc2pK0SAll%1d\",nTour),TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data()); \/\/ production histos\n    mgr->ConnectOutput(task,4,coutputLc4);\n    AliAnalysisDataContainer *coutputLc5 = mgr->CreateContainer(Form(\"Lc2pK0SPIDBach%1d\",nTour),TList::Class(),AliAnalysisManager::kOutputContainer, outputfile.Data()); \/\/ analysis histos\n    mgr->ConnectOutput(task,5,coutputLc5);\n\n    if (trackRotation) {\n      AliAnalysisDataContainer *coutputLc6 = mgr->CreateContainer(Form(\"Lc2pK0SPIDBachTR%1d\",nTour),TList::Class(),AliAnalysisManager::kOutputContainer, outputfile.Data()); \/\/ analysis histos\n      mgr->ConnectOutput(task,6,coutputLc6);\n    }\n\n  } else {\n    AliAnalysisDataContainer *coutputLc4 = mgr->CreateContainer(Form(\"Lc2pK0Svariables%1d\",nTour),TTree::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data()); \/\/ variables tree\n    mgr->ConnectOutput(task,4,coutputLc4);\n  }\n\n  return task;\n\n}\n<commit_msg>Add flags for rotational background<commit_after>AliAnalysisTaskSELc2V0bachelor *AddTaskLc2V0bachelor(TString finname=\"Lc2V0bachelorCuts.root\",\n\t\t\t\t\t\t     Bool_t theMCon=kFALSE,\n\t\t\t\t\t\t     Bool_t onTheFly=kFALSE,\n\t\t\t\t\t\t     Bool_t writeVariableTree=kTRUE,\n\t\t\t\t\t\t     Int_t nTour=0,\n\t\t\t\t\t\t     Bool_t additionalChecks=kFALSE,\n\t\t\t\t\t\t     Bool_t trackRotation=kFALSE,\n\t\t\t\t\t\t     Int_t nRot=9,\n\t\t\t\t\t\t     Double_t pTmin=0.,\n\t\t\t\t\t\t     Double_t pTmax=999.,\n\t\t\t\t\t\t     Double_t minRotAngle=5.*TMath::Pi()\/6.,\n\t\t\t\t\t\t     Double_t maxRotAngle=7.*TMath::Pi()\/6.)\n{\n\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) {\n    ::Error(\"AddTaskLc2V0bachelor\", \"No analysis manager to connect to.\");\n    return NULL;\n  }  \n  \n  if (writeVariableTree && trackRotation)\n    trackRotation=kFALSE;\n\n  \/\/ cuts are stored in a TFile generated by makeTFile4CutsLc2V0bachelor.C in .\/macros\/\n  \/\/ set there the cuts!!!!!\n\n  Bool_t stdcuts=kFALSE;\n  TFile* filecuts;\n  if( finname.EqualTo(\"\") ) {\n    stdcuts=kTRUE; \n  } else {\n      filecuts=TFile::Open(finname.Data());\n      if(!filecuts ||(filecuts&& !filecuts->IsOpen())){\n\tAliFatal(\"Input file not found : check your cut object\");\n      }\n  }\n\n  cout << \" Is it std on not std cut? \" << stdcuts << endl;\n  AliRDHFCutsLctoV0* RDHFCutsLctoV0anal = new AliRDHFCutsLctoV0();\n  if (stdcuts) RDHFCutsLctoV0anal->SetStandardCutsPP2010();\n  else RDHFCutsLctoV0anal = (AliRDHFCutsLctoV0*)filecuts->Get(\"LctoV0AnalysisCuts\");\n  RDHFCutsLctoV0anal->SetName(\"LctoV0AnalysisCuts\");\n  RDHFCutsLctoV0anal->SetMinPtCandidate(-1.);\n  RDHFCutsLctoV0anal->SetMaxPtCandidate(10000.);\n\n\n  \/\/ mm let's see if everything is ok\n  if (!RDHFCutsLctoV0anal) {\n    cout << \"Specific AliRDHFCutsLctoV0 not found\\n\";\n    return;\n  }\n\n\n  \/\/CREATE THE TASK\n\n  printf(\"CREATE TASK\\n\");\n  AliAnalysisTaskSELc2V0bachelor *task = new AliAnalysisTaskSELc2V0bachelor(\"AliAnalysisTaskSELc2V0bachelor\",RDHFCutsLctoV0anal,onTheFly,writeVariableTree,additionalChecks,trackRotation);\n  task->SetAdditionalChecks(additionalChecks);\n  task->SetMC(theMCon);\n  task->SetK0SAnalysis(kTRUE);\n  task->SetDebugLevel(0);\n  task->SetNRotations(nRot);\n  task->SetPtMinToFillTheTree(pTmin);\n  task->SetPtMaxToFillTheTree(pTmax);\n  task->SetMinAngleForRot(minRotAngle);\n  task->SetMaxAngleForRot(maxRotAngle);\n  mgr->AddTask(task);\n\n  \/\/ Create and connect containers for input\/output  \n  TString outputfile = AliAnalysisManager::GetCommonFileName();\n  outputfile += \":PWG3_D2H_Lc2pK0S_\";\n  outputfile += nTour;\n\n  mgr->ConnectInput(task,0,mgr->GetCommonInputContainer());\n\n  \/\/ ----- output data -----\n  AliAnalysisDataContainer *coutput1   = mgr->CreateContainer(Form(\"chist%1d\",nTour),TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data()); \/\/ general histos\n  mgr->ConnectOutput(task,1,coutput1);\n  AliAnalysisDataContainer *coutputLc2 = mgr->CreateContainer(Form(\"Lc2pK0Scounter%1d\",nTour),AliNormalizationCounter::Class(),AliAnalysisManager::kOutputContainer, outputfile.Data()); \/\/counter\n  mgr->ConnectOutput(task,2,coutputLc2);\n  AliAnalysisDataContainer *coutputLc3 = mgr->CreateContainer(Form(\"Lc2pK0SCuts%1d\",nTour),AliRDHFCutsLctoV0::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data()); \/\/ cuts\n  mgr->ConnectOutput(task,3,coutputLc3);\n  if (!writeVariableTree) {\n    AliAnalysisDataContainer *coutputLc4 = mgr->CreateContainer(Form(\"Lc2pK0SAll%1d\",nTour),TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data()); \/\/ production histos\n    mgr->ConnectOutput(task,4,coutputLc4);\n    AliAnalysisDataContainer *coutputLc5 = mgr->CreateContainer(Form(\"Lc2pK0SPIDBach%1d\",nTour),TList::Class(),AliAnalysisManager::kOutputContainer, outputfile.Data()); \/\/ analysis histos\n    mgr->ConnectOutput(task,5,coutputLc5);\n\n    if (trackRotation) {\n      AliAnalysisDataContainer *coutputLc6 = mgr->CreateContainer(Form(\"Lc2pK0SPIDBachTR%1d\",nTour),TList::Class(),AliAnalysisManager::kOutputContainer, outputfile.Data()); \/\/ analysis histos\n      mgr->ConnectOutput(task,6,coutputLc6);\n    }\n\n  } else {\n    AliAnalysisDataContainer *coutputLc4 = mgr->CreateContainer(Form(\"Lc2pK0Svariables%1d\",nTour),TTree::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data()); \/\/ variables tree\n    mgr->ConnectOutput(task,4,coutputLc4);\n  }\n\n  return task;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <math.h>\n#include <algorithm>\n#include \"PerPixelMesh.hpp\"\n\n\nPerPixelMesh::PerPixelMesh(int width, int height) : width(width), height(height), size (width * height),\n\t\tp(width * height, Point(0,0)),\n\t\tp_original(width * height, Point(0,0)),\n\t\tidentity(width * height, PerPixelContext(0,0,0,0,0,0))\n\t\t{\n\t\tfor (int j=0;j<height;j++)\n\t\t\tfor(int i=0;i<width;i++)\n\t\t\t{\n\t\t\t\tint index = j * width + i;\n\n\t\t\t\t\t\tfloat xval=i\/(float)(width-1);\n\t\t\t\t\t\tfloat yval=-((j\/(float)(height-1))-1);\n\n\t\t\t\t\t\tp[index].x = xval;\n\t\t\t\t\t\tp[index].y = yval;\n\n\t\t\t\t\t\tp_original[index].x = xval;\n\t\t\t\t\t\tp_original[index].y = yval;\n\n\t\t\t\t\t\tidentity[index].x= xval;\n\t\t\t\t\t\tidentity[index].y= yval;\n\n\t\t\t\t\t\t\/\/identity[index].x= (xval-.5)*2;\n\t\t\t\t\t\t\/\/identity[index].y= (yval-.5)*2;\n\n\t\t\t\t\t\tidentity[index].i= i;\n\t\t\t\t\t\tidentity[index].j= j;\n\n\t\t\t\t\t\tidentity[index].rad=hypot ( ( xval-.5 ) *2, ( yval-.5 ) *2 ) * .7071067;\n\t\t\t\t\t\tidentity[index].theta=atan2 ( ( yval-.5 ) *2 ,  ( xval-.5 ) *2  );\n\t\t\t}\n\t\t}\n\nvoid PerPixelMesh::Reset()\n{\n\tstd::copy(p_original.begin(), p_original.end(), p.begin());\n}\n\nPoint::Point(float x, float y)\n\t: x(x), y(y) {}\nPerPixelContext::PerPixelContext(float x, float y, float rad, float theta, int i, int j)\n\t: x(x), y(y), rad(rad), theta(theta), i(i), j(j) {}\n<commit_msg>Parralellize mesh reset<commit_after>#include <math.h>\n#include <algorithm>\n#include \"PerPixelMesh.hpp\"\n#include \"omptl\/omptl\"\n#include \"omptl\/omptl_algorithm\"\n\nPerPixelMesh::PerPixelMesh(int width, int height) : width(width), height(height), size (width * height),\n\t\tp(width * height, Point(0,0)),\n\t\tp_original(width * height, Point(0,0)),\n\t\tidentity(width * height, PerPixelContext(0,0,0,0,0,0))\n\t\t{\n\t\tfor (int j=0;j<height;j++)\n\t\t\tfor(int i=0;i<width;i++)\n\t\t\t{\n\t\t\t\tint index = j * width + i;\n\n\t\t\t\t\t\tfloat xval=i\/(float)(width-1);\n\t\t\t\t\t\tfloat yval=-((j\/(float)(height-1))-1);\n\n\t\t\t\t\t\tp[index].x = xval;\n\t\t\t\t\t\tp[index].y = yval;\n\n\t\t\t\t\t\tp_original[index].x = xval;\n\t\t\t\t\t\tp_original[index].y = yval;\n\n\t\t\t\t\t\tidentity[index].x= xval;\n\t\t\t\t\t\tidentity[index].y= yval;\n\n\t\t\t\t\t\t\/\/identity[index].x= (xval-.5)*2;\n\t\t\t\t\t\t\/\/identity[index].y= (yval-.5)*2;\n\n\t\t\t\t\t\tidentity[index].i= i;\n\t\t\t\t\t\tidentity[index].j= j;\n\n\t\t\t\t\t\tidentity[index].rad=hypot ( ( xval-.5 ) *2, ( yval-.5 ) *2 ) * .7071067;\n\t\t\t\t\t\tidentity[index].theta=atan2 ( ( yval-.5 ) *2 ,  ( xval-.5 ) *2  );\n\t\t\t}\n\t\t}\n\nvoid PerPixelMesh::Reset()\n{\n\tomptl::copy(p_original.begin(), p_original.end(), p.begin());\n}\n\nPoint::Point(float x, float y)\n\t: x(x), y(y) {}\nPerPixelContext::PerPixelContext(float x, float y, float rad, float theta, int i, int j)\n\t: x(x), y(y), rad(rad), theta(theta), i(i), j(j) {}\n<|endoftext|>"}
{"text":"<commit_before>#include \"vagdec.h\"\n#pragma warning(disable : 4996)  \n\n#include <vector>\n#include <algorithm>\n\nclass VBStream\n{\npublic:\n\tstatic const size_t VB_BLOCK_SIZE = 512 * 16 * 2;\n\n\tVBStream( FILE* file, int sample_rate, int stereo, int size )\n\t\t: stream( file ), fileSize( size + sizeof(VAG_HEADER) )\n\t{\n\t\tmemset( &virtualHeader, 0, sizeof(virtualHeader) );\n\t\tvirtualHeader.VAG[0] = 'V';\n\t\tvirtualHeader.VAG[1] = 'A';\n\t\tvirtualHeader.VAG[2] = 'G';\n\t\tvirtualHeader.field_3 = 'p';\n\n\t\tvirtualHeader.sample_rate = _byteswap_ulong(sample_rate);\n\t\tvirtualHeader.stereo = _byteswap_ulong(stereo);\n\t\tvirtualHeader.size = _byteswap_ulong(size);\n\n\t\tblockBuffer = stereo != 0 ? (U8*)AIL_mem_alloc_lock( VB_BLOCK_SIZE ) : nullptr;\n\t}\n\n\tVBStream( const VBStream& ) = delete;\n\tVBStream& operator = ( const VBStream& rhs ) = delete;\n\n\tVBStream( VBStream&& rhs ) = default;\n\tVBStream& operator = ( VBStream&& rhs ) = default;\n\n\t~VBStream()\n\t{\n\t\tif ( blockBuffer != nullptr )\n\t\t{\n\t\t\tAIL_mem_free_lock( blockBuffer );\n\t\t\tblockBuffer = nullptr;\n\t\t}\n\t}\n\n\tbool UsesInterleave() const { return blockBuffer != nullptr; }\n\n\tFILE* GetStream() const { return stream; }\n\n\tstatic S32 GetBlock(S32 offset)\n\t{\n\t\t\/\/ VB_BLOCK_SIZE = 2^14\n\t\treturn offset >> 14;\n\t}\n\n\tU32 ReadFile( void FAR* Buffer, U32 Bytes )\n\t{\n\t\tif ( virtualCursor == 0 )\n\t\t{\n\t\t\tVAG_HEADER* header = (VAG_HEADER*)Buffer;\n\t\t\t*header = virtualHeader;\n\n\t\t\tsize_t bytesRead = sizeof(VAG_HEADER);\n\t\t\tif ( !UsesInterleave() )\n\t\t\t{\n\t\t\t\tbytesRead += fread( &header[1], 1, Bytes-sizeof(*header), stream );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tReadBlockAndInterleave();\n\n\t\t\t\tmemcpy( &header[1], blockBuffer, Bytes-sizeof(*header) );\n\t\t\t\tbytesRead += Bytes-sizeof(*header);\n\t\t\t}\n\t\t\tvirtualCursor += bytesRead;\n\t\t\treturn bytesRead;\n\t\t}\n\n\t\tif ( currentBlockCursor + Bytes >= VB_BLOCK_SIZE )\n\t\t{\n\t\t\tsize_t firstRead = VB_BLOCK_SIZE - currentBlockCursor;\n\n\t\t\tmemcpy( Buffer, blockBuffer+currentBlockCursor, firstRead );\n\t\t\tReadBlockAndInterleave();\n\t\t\tmemcpy( (U8*)Buffer+firstRead, blockBuffer, Bytes-firstRead );\n\n\t\t\tcurrentBlockCursor += Bytes-firstRead;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmemcpy( Buffer, blockBuffer+currentBlockCursor, Bytes );\n\t\t\tcurrentBlockCursor += Bytes;\n\t\t}\n\t\tvirtualCursor += Bytes;\n\t\treturn Bytes;\n\t}\n\n\tS32 SeekFile( S32 Offset, U32 Type )\n\t{\n\t\tif ( Type == AIL_FILE_SEEK_CURRENT ) Offset += virtualCursor;\n\t\telse if ( Type == AIL_FILE_SEEK_END ) Offset = fileSize - Offset;\n\n\t\tS32 OffsetNoHeader = Offset - sizeof(VAG_HEADER);\n\t\tS32 CursorNoHeader = virtualCursor - sizeof(VAG_HEADER);\n\n\t\tif ( OffsetNoHeader <= 0 )\n\t\t{\n\t\t\t\/\/ Seeks to header - do nothing since next ReadFile flushes everything anyway\n\t\t\tfseek( stream, 0, SEEK_SET );\n\t\t\tvirtualCursor = 0;\n\t\t\treturn 0;\n\t\t}\n\n\t\tif ( UsesInterleave() )\n\t\t{\n\t\t\t\/\/ Is within the same block?\n\t\t\tif ( GetBlock(OffsetNoHeader) == GetBlock(CursorNoHeader) )\n\t\t\t{\n\t\t\t\t\/\/ Do nothing, just move cursor\n\t\t\t\tcurrentBlockCursor = OffsetNoHeader - CursorNoHeader;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ Read new block\n\t\t\t\tfseek( stream, OffsetNoHeader & ~(VB_BLOCK_SIZE-1), SEEK_SET );\n\t\t\t\tReadBlockAndInterleave();\n\t\t\t\tcurrentBlockCursor = OffsetNoHeader & (VB_BLOCK_SIZE-1);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfseek( stream, OffsetNoHeader, SEEK_SET );\n\t\t}\n\t\tvirtualCursor = Offset;\n\t\treturn virtualCursor;\n\t}\n\nprivate:\n\tvoid ReadBlockAndInterleave( )\n\t{\n\t\tconst size_t VB_SAMPLE_SIZE = 0x10;\n\n\t\tU8 buf[VB_BLOCK_SIZE];\n\t\tsize_t bytesRead = fread( buf, 1, VB_BLOCK_SIZE, stream );\n\n\t\t\/\/ Interleave\n\t\tif ( bytesRead == VB_BLOCK_SIZE )\n\t\t{\n\t\t\tU8* leftChannel = buf;\n\t\t\tU8* rightChannel = buf+(VB_BLOCK_SIZE\/2);\n\t\t\tU8* output = blockBuffer;\n\n\t\t\tfor ( int i = 0; i < 512; ++i )\n\t\t\t{\n\t\t\t\tmemcpy( output, leftChannel, VB_SAMPLE_SIZE );\n\t\t\t\tmemcpy( output+VB_SAMPLE_SIZE, rightChannel, VB_SAMPLE_SIZE );\n\t\t\t\tleftChannel += VB_SAMPLE_SIZE;\n\t\t\t\trightChannel += VB_SAMPLE_SIZE;\n\t\t\t\toutput += 2*VB_SAMPLE_SIZE;\n\t\t\t}\n\t\t}\n\t\tcurrentBlockCursor = 0;\n\t}\n\nprivate:\n\tFILE* stream;\n\tVAG_HEADER virtualHeader;\n\tU8* blockBuffer;\n\tS32 currentBlockCursor = 0, virtualCursor = 0;\n\tS32 fileSize;\n};\n\nstatic std::vector<FILE*> adfStreams;\nstatic std::vector<VBStream> vbStreams;\n\nstatic void XORADFStream( void FAR* Buffer, size_t size )\n{\n\tU8* buf = (U8*)Buffer;\n\n\twhile ( size != 0 && ((U32)buf & 3) != 0 )\n\t{\n\t\t*buf ++ ^= 0x22;\n\t\t--size;\n\t}\n\n\twhile ( size >= 4 )\n\t{\n\t\t*(U32*)buf ^= 0x22222222;\n\t\tbuf += 4;\n\t\tsize -= 4;\n\t}\n\n\twhile ( size != 0 )\n\t{\n\t\t*buf ++ ^= 0x22;\n\t\t--size;\n\t}\n}\n\nstatic U32 AILCALLBACK FAR OpenFileCB(MSS_FILE const FAR* Filename, U32 FAR* FileHandle)\n{\n\tFILE* hFile = fopen( Filename, \"rb\" );\n\t*FileHandle = (U32)hFile;\n\n\tif ( hFile == nullptr ) return 0;\n\n\tsize_t length = strlen(Filename);\n\tif ( Filename[length-4] == '.' &&\n\t\t( Filename[length-3] == 'a' || Filename[length-3] == 'A' ) &&\n\t\t( Filename[length-2] == 'd' || Filename[length-2] == 'D' ) &&\n\t\t( Filename[length-1] == 'f' || Filename[length-1] == 'F' )\n\t\t)\n\t{\n\t\tMSS_FILE FAR* name = const_cast<MSS_FILE FAR*>(Filename);\n\t\tname[length-3] = 'm';\n\t\tname[length-2] = 'p';\n\t\tname[length-1] = '3';\n\n\t\tadfStreams.push_back( hFile );\n\t}\n\telse if ( Filename[length-3] == '.' &&\n\t\t( Filename[length-2] == 'v' || Filename[length-2] == 'V' ) &&\n\t\t( Filename[length-1] == 'b' || Filename[length-1] == 'B' )\n\t\t)\n\t{\n\t\tMSS_FILE FAR* name = const_cast<MSS_FILE FAR*>(Filename);\n\t\tname[length-2] = 'v';\n\t\tname[length-1] = 'a';\n\t\tname[length] = 'g';\n\t\tname[length+1] = '\\0';\n\n\t\tfseek( hFile, 0, SEEK_END );\n\t\tint size = ftell( hFile );\n\t\tfseek( hFile, 0, SEEK_SET );\n\t\tvbStreams.emplace_back( hFile, 32000, 1, size );\n\t}\n\n\treturn (U32)hFile;\n}\n\nstatic void AILCALLBACK FAR CloseFileCB(U32 FileHandle)\n{\n\tFILE* hFile = (FILE*)FileHandle;\n\t{\n\t\tauto it = std::find( adfStreams.begin(), adfStreams.end(), hFile );\n\t\tif ( it != adfStreams.end() )\n\t\t{\n\t\t\tadfStreams.erase( it );\n\t\t\tfclose( hFile );\n\t\t\treturn;\n\t\t}\n\t}\n\t{\n\t\tauto it = std::find_if( vbStreams.begin(), vbStreams.end(), [hFile](const VBStream& s) {\n\t\t\treturn s.GetStream() == hFile;\n\t\t\t} );\n\t\tif ( it != vbStreams.end() )\n\t\t{\n\t\t\tvbStreams.erase( it );\n\t\t\tfclose( hFile );\n\t\t\treturn;\n\t\t}\n\n\t}\n\tfclose( hFile );\n}\n\nstatic S32 AILCALLBACK FAR SeekFileCB(U32 FileHandle, S32 Offset, U32 Type)\n{\n\tFILE* hFile = (FILE*)FileHandle;\n\tauto it = std::find_if( vbStreams.begin(), vbStreams.end(), [hFile](const VBStream& s) {\n\t\treturn s.GetStream() == hFile;\n\t} );\n\tif ( it != vbStreams.end() )\n\t{\n\t\treturn it->SeekFile( Offset, Type );\n\t}\n\n\tfseek( hFile, Offset, Type );\n\treturn ftell( hFile );\n}\n\nstatic U32 AILCALLBACK FAR ReadFileCB(U32 FileHandle, void FAR* Buffer, U32 Bytes)\n{\n\tFILE* hFile = (FILE*)FileHandle;\n\t{\n\t\tauto it = std::find( adfStreams.begin(), adfStreams.end(), hFile );\n\t\tif ( it != adfStreams.end() )\n\t\t{\n\t\t\tsize_t bytesRead = fread( Buffer, 1, Bytes, hFile );\n\t\t\tXORADFStream( Buffer, bytesRead );\n\t\t\treturn bytesRead;\n\t\t}\n\t}\n\t{\n\t\tauto it = std::find_if( vbStreams.begin(), vbStreams.end(), [hFile](const VBStream& s) {\n\t\t\treturn s.GetStream() == hFile;\n\t\t} );\n\t\tif ( it != vbStreams.end() )\n\t\t{\n\t\t\treturn it->ReadFile( Buffer, Bytes );\n\t\t}\n\t}\n\tsize_t bytesRead = fread( Buffer, 1, Bytes, hFile );\n\treturn bytesRead;\n}\n\nvoid AttachVBCallbacks()\n{\n\tAIL_set_file_callbacks( OpenFileCB, CloseFileCB, SeekFileCB, ReadFileCB );\n}<commit_msg>per VB ini settings (optional)<commit_after>#include \"vagdec.h\"\n#pragma warning(disable : 4996)  \n\n#include <vector>\n#include <algorithm>\n\nclass VBStream\n{\npublic:\n\tstatic const size_t VB_BLOCK_SIZE = 512 * 16 * 2;\n\n\tVBStream( FILE* file, int sample_rate, int stereo, int size )\n\t\t: stream( file ), fileSize( size + sizeof(VAG_HEADER) )\n\t{\n\t\tmemset( &virtualHeader, 0, sizeof(virtualHeader) );\n\t\tvirtualHeader.VAG[0] = 'V';\n\t\tvirtualHeader.VAG[1] = 'A';\n\t\tvirtualHeader.VAG[2] = 'G';\n\t\tvirtualHeader.field_3 = 'p';\n\n\t\tvirtualHeader.sample_rate = _byteswap_ulong(sample_rate);\n\t\tvirtualHeader.stereo = _byteswap_ulong(stereo);\n\t\tvirtualHeader.size = _byteswap_ulong(size);\n\n\t\tblockBuffer = stereo != 0 ? (U8*)AIL_mem_alloc_lock( VB_BLOCK_SIZE ) : nullptr;\n\t}\n\n\tVBStream( const VBStream& ) = delete;\n\tVBStream& operator = ( const VBStream& rhs ) = delete;\n\n\tVBStream( VBStream&& rhs ) = default;\n\tVBStream& operator = ( VBStream&& rhs ) = default;\n\n\t~VBStream()\n\t{\n\t\tif ( blockBuffer != nullptr )\n\t\t{\n\t\t\tAIL_mem_free_lock( blockBuffer );\n\t\t\tblockBuffer = nullptr;\n\t\t}\n\t}\n\n\tbool UsesInterleave() const { return blockBuffer != nullptr; }\n\n\tFILE* GetStream() const { return stream; }\n\n\tstatic S32 GetBlock(S32 offset)\n\t{\n\t\t\/\/ VB_BLOCK_SIZE = 2^14\n\t\treturn offset >> 14;\n\t}\n\n\tU32 ReadFile( void FAR* Buffer, U32 Bytes )\n\t{\n\t\tif ( virtualCursor == 0 )\n\t\t{\n\t\t\tVAG_HEADER* header = (VAG_HEADER*)Buffer;\n\t\t\t*header = virtualHeader;\n\n\t\t\tsize_t bytesRead = sizeof(VAG_HEADER);\n\t\t\tif ( !UsesInterleave() )\n\t\t\t{\n\t\t\t\tbytesRead += fread( &header[1], 1, Bytes-sizeof(*header), stream );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tReadBlockAndInterleave();\n\n\t\t\t\tmemcpy( &header[1], blockBuffer, Bytes-sizeof(*header) );\n\t\t\t\tbytesRead += Bytes-sizeof(*header);\n\t\t\t}\n\t\t\tvirtualCursor += bytesRead;\n\t\t\treturn bytesRead;\n\t\t}\n\n\t\tif ( currentBlockCursor + Bytes >= VB_BLOCK_SIZE )\n\t\t{\n\t\t\tsize_t firstRead = VB_BLOCK_SIZE - currentBlockCursor;\n\n\t\t\tmemcpy( Buffer, blockBuffer+currentBlockCursor, firstRead );\n\t\t\tReadBlockAndInterleave();\n\t\t\tmemcpy( (U8*)Buffer+firstRead, blockBuffer, Bytes-firstRead );\n\n\t\t\tcurrentBlockCursor += Bytes-firstRead;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmemcpy( Buffer, blockBuffer+currentBlockCursor, Bytes );\n\t\t\tcurrentBlockCursor += Bytes;\n\t\t}\n\t\tvirtualCursor += Bytes;\n\t\treturn Bytes;\n\t}\n\n\tS32 SeekFile( S32 Offset, U32 Type )\n\t{\n\t\tif ( Type == AIL_FILE_SEEK_CURRENT ) Offset += virtualCursor;\n\t\telse if ( Type == AIL_FILE_SEEK_END ) Offset = fileSize - Offset;\n\n\t\tS32 OffsetNoHeader = Offset - sizeof(VAG_HEADER);\n\t\tS32 CursorNoHeader = virtualCursor - sizeof(VAG_HEADER);\n\n\t\tif ( OffsetNoHeader <= 0 )\n\t\t{\n\t\t\t\/\/ Seeks to header - do nothing since next ReadFile flushes everything anyway\n\t\t\tfseek( stream, 0, SEEK_SET );\n\t\t\tvirtualCursor = 0;\n\t\t\treturn 0;\n\t\t}\n\n\t\tif ( UsesInterleave() )\n\t\t{\n\t\t\t\/\/ Is within the same block?\n\t\t\tif ( GetBlock(OffsetNoHeader) == GetBlock(CursorNoHeader) )\n\t\t\t{\n\t\t\t\t\/\/ Do nothing, just move cursor\n\t\t\t\tcurrentBlockCursor = OffsetNoHeader - CursorNoHeader;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ Read new block\n\t\t\t\tfseek( stream, OffsetNoHeader & ~(VB_BLOCK_SIZE-1), SEEK_SET );\n\t\t\t\tReadBlockAndInterleave();\n\t\t\t\tcurrentBlockCursor = OffsetNoHeader & (VB_BLOCK_SIZE-1);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfseek( stream, OffsetNoHeader, SEEK_SET );\n\t\t}\n\t\tvirtualCursor = Offset;\n\t\treturn virtualCursor;\n\t}\n\nprivate:\n\tvoid ReadBlockAndInterleave( )\n\t{\n\t\tconst size_t VB_SAMPLE_SIZE = 0x10;\n\n\t\tU8 buf[VB_BLOCK_SIZE];\n\t\tsize_t bytesRead = fread( buf, 1, VB_BLOCK_SIZE, stream );\n\n\t\t\/\/ Interleave\n\t\tif ( bytesRead == VB_BLOCK_SIZE )\n\t\t{\n\t\t\tU8* leftChannel = buf;\n\t\t\tU8* rightChannel = buf+(VB_BLOCK_SIZE\/2);\n\t\t\tU8* output = blockBuffer;\n\n\t\t\tfor ( int i = 0; i < 512; ++i )\n\t\t\t{\n\t\t\t\tmemcpy( output, leftChannel, VB_SAMPLE_SIZE );\n\t\t\t\tmemcpy( output+VB_SAMPLE_SIZE, rightChannel, VB_SAMPLE_SIZE );\n\t\t\t\tleftChannel += VB_SAMPLE_SIZE;\n\t\t\t\trightChannel += VB_SAMPLE_SIZE;\n\t\t\t\toutput += 2*VB_SAMPLE_SIZE;\n\t\t\t}\n\t\t}\n\t\tcurrentBlockCursor = 0;\n\t}\n\nprivate:\n\tFILE* stream;\n\tVAG_HEADER virtualHeader;\n\tU8* blockBuffer;\n\tS32 currentBlockCursor = 0, virtualCursor = 0;\n\tS32 fileSize;\n};\n\nstatic std::vector<FILE*> adfStreams;\nstatic std::vector<VBStream> vbStreams;\n\nstatic void XORADFStream( void FAR* Buffer, size_t size )\n{\n\tU8* buf = (U8*)Buffer;\n\n\twhile ( size != 0 && ((U32)buf & 3) != 0 )\n\t{\n\t\t*buf ++ ^= 0x22;\n\t\t--size;\n\t}\n\n\twhile ( size >= 4 )\n\t{\n\t\t*(U32*)buf ^= 0x22222222;\n\t\tbuf += 4;\n\t\tsize -= 4;\n\t}\n\n\twhile ( size != 0 )\n\t{\n\t\t*buf ++ ^= 0x22;\n\t\t--size;\n\t}\n}\n\nstatic U32 AILCALLBACK FAR OpenFileCB(MSS_FILE const FAR* Filename, U32 FAR* FileHandle)\n{\n\tFILE* hFile = fopen( Filename, \"rb\" );\n\t*FileHandle = (U32)hFile;\n\n\tif ( hFile == nullptr ) return 0;\n\n\tsize_t length = strlen(Filename);\n\tif ( Filename[length-4] == '.' &&\n\t\t( Filename[length-3] == 'a' || Filename[length-3] == 'A' ) &&\n\t\t( Filename[length-2] == 'd' || Filename[length-2] == 'D' ) &&\n\t\t( Filename[length-1] == 'f' || Filename[length-1] == 'F' )\n\t\t)\n\t{\n\t\tMSS_FILE FAR* name = const_cast<MSS_FILE FAR*>(Filename);\n\t\tname[length-3] = 'm';\n\t\tname[length-2] = 'p';\n\t\tname[length-1] = '3';\n\n\t\tadfStreams.push_back( hFile );\n\t}\n\telse if ( Filename[length-3] == '.' &&\n\t\t( Filename[length-2] == 'v' || Filename[length-2] == 'V' ) &&\n\t\t( Filename[length-1] == 'b' || Filename[length-1] == 'B' )\n\t\t)\n\t{\n\t\tMSS_FILE FAR* name = const_cast<MSS_FILE FAR*>(Filename);\n\t\tname[length-2] = 'i';\n\t\tname[length-1] = 'n';\n\t\tname[length] = 'i';\n\t\tname[length+1] = '\\0';\n\n\t\tint samplerate = GetPrivateProfileInt( \"VB\", \"sample_rate\", 32000, name );\n\t\tint stereo = GetPrivateProfileInt( \"VB\", \"stereo\", 1, name ) != 0 ? 1 : 0;\n\n\t\tname[length-2] = 'v';\n\t\tname[length-1] = 'a';\n\t\tname[length] = 'g';\n\n\t\tfseek( hFile, 0, SEEK_END );\n\t\tint size = ftell( hFile );\n\t\tfseek( hFile, 0, SEEK_SET );\n\t\tvbStreams.emplace_back( hFile, samplerate, stereo, size );\n\t}\n\n\treturn (U32)hFile;\n}\n\nstatic void AILCALLBACK FAR CloseFileCB(U32 FileHandle)\n{\n\tFILE* hFile = (FILE*)FileHandle;\n\t{\n\t\tauto it = std::find( adfStreams.begin(), adfStreams.end(), hFile );\n\t\tif ( it != adfStreams.end() )\n\t\t{\n\t\t\tadfStreams.erase( it );\n\t\t\tfclose( hFile );\n\t\t\treturn;\n\t\t}\n\t}\n\t{\n\t\tauto it = std::find_if( vbStreams.begin(), vbStreams.end(), [hFile](const VBStream& s) {\n\t\t\treturn s.GetStream() == hFile;\n\t\t\t} );\n\t\tif ( it != vbStreams.end() )\n\t\t{\n\t\t\tvbStreams.erase( it );\n\t\t\tfclose( hFile );\n\t\t\treturn;\n\t\t}\n\n\t}\n\tfclose( hFile );\n}\n\nstatic S32 AILCALLBACK FAR SeekFileCB(U32 FileHandle, S32 Offset, U32 Type)\n{\n\tFILE* hFile = (FILE*)FileHandle;\n\tauto it = std::find_if( vbStreams.begin(), vbStreams.end(), [hFile](const VBStream& s) {\n\t\treturn s.GetStream() == hFile;\n\t} );\n\tif ( it != vbStreams.end() )\n\t{\n\t\treturn it->SeekFile( Offset, Type );\n\t}\n\n\tfseek( hFile, Offset, Type );\n\treturn ftell( hFile );\n}\n\nstatic U32 AILCALLBACK FAR ReadFileCB(U32 FileHandle, void FAR* Buffer, U32 Bytes)\n{\n\tFILE* hFile = (FILE*)FileHandle;\n\t{\n\t\tauto it = std::find( adfStreams.begin(), adfStreams.end(), hFile );\n\t\tif ( it != adfStreams.end() )\n\t\t{\n\t\t\tsize_t bytesRead = fread( Buffer, 1, Bytes, hFile );\n\t\t\tXORADFStream( Buffer, bytesRead );\n\t\t\treturn bytesRead;\n\t\t}\n\t}\n\t{\n\t\tauto it = std::find_if( vbStreams.begin(), vbStreams.end(), [hFile](const VBStream& s) {\n\t\t\treturn s.GetStream() == hFile;\n\t\t} );\n\t\tif ( it != vbStreams.end() )\n\t\t{\n\t\t\treturn it->ReadFile( Buffer, Bytes );\n\t\t}\n\t}\n\tsize_t bytesRead = fread( Buffer, 1, Bytes, hFile );\n\treturn bytesRead;\n}\n\nvoid AttachVBCallbacks()\n{\n\tAIL_set_file_callbacks( OpenFileCB, CloseFileCB, SeekFileCB, ReadFileCB );\n}<|endoftext|>"}
{"text":"<commit_before>\/*++\n\nModule Name:\n\n    BufferedAsync.cpp\n\nAbstract:\n\n    Double-buffered asynchronous file I\/O\n\nEnvironment:\n\n    User mode service.\n\n    This class is NOT thread safe.  It's the caller's responsibility to ensure that\n    at most one thread uses an instance at any time.\n\n--*\/\n\n#include \"stdafx.h\"\n#include \"Compat.h\"\n#include \"BigAlloc.h\"\n#include \"BufferedAsync.h\"\n\nusing std::min;\n\n\n    bool\nBufferedAsyncReader::open(\n    AsyncFile* file,\n    size_t offset,\n    size_t bytes,\n    size_t i_bufferSize,\n    bool async,\n    void* buffer0,\n    void* buffer1)\n{\n    _ASSERT((buffer0 == NULL) == (buffer1 == NULL)); \/\/ both null or both non-null\n    waitTime = 0;\n    reader[0] = file->getReader();\n    reader[1] = file->getReader();\n    bufferSize = i_bufferSize;\n    fileSize = offset + bytes;\n    ownBuffer = buffer0 == NULL;\n    buffer[0] = (char*) (buffer0 != NULL ? buffer0 : BigAlloc(bufferSize));\n    buffer[1] = (char*) (buffer1 != NULL ? buffer1 : BigAlloc(bufferSize));\n    if (reader[0] == NULL || reader[1] == NULL || buffer[0] == NULL || buffer[1] == NULL) {\n        fprintf(stderr, \"unable to setup temp file reader\\n\");\n        return false;\n    }\n    length[0] = min(bytes, bufferSize);\n    reader[0]->beginRead(buffer[0],length[0], offset, NULL);\n    if (bytes > bufferSize) {\n        length[1] = min(bytes - bufferSize, bufferSize);\n        reader[1]->beginRead(buffer[1], length[1], offset + bufferSize, NULL);\n    } else {\n        length[1] = 0;\n    }\n    reading = 0;\n    readOffset = 0;\n    nextFileOffset = offset + min(bytes, 2 * bufferSize);\n    if (! async) {\n        endOpen();\n    }\n    return true;\n}\n\n    void\nBufferedAsyncReader::endOpen()\n{\n    _int64 start = timeInNanos();\n    reader[reading]->waitForCompletion();\n    waitTime += timeInNanos() - start;\n}\n\n    bool\nBufferedAsyncReader::atEnd()\n{\n    return length[reading] == 0;\n}\n\n    bool\nBufferedAsyncReader::read(\n    void* data,\n    size_t bytes)\n{\n    if (bytes == 0) {\n        return true;\n    }\n    if (atEnd()) {\n        return false;\n    }\n    size_t first = min(bytes, length[reading] - readOffset);\n    memcpy(data, buffer[reading] + readOffset, first);\n    data = (char*) data + first;\n    readOffset += bytes;\n    if (readOffset >= length[reading]) {\n        \/\/ switch buffers\n        readOffset -= length[reading];\n        reading = 1 - reading;\n        _int64 start = timeInNanos();\n        reader[reading]->waitForCompletion();\n        waitTime += timeInNanos() - start;\n        if (readOffset > 0) {\n            \/\/ copy second part of read segment\n            \/\/ todo: allow for longer reads\n            if (readOffset > length[reading]) {\n                fprintf(stderr, \"read length too big\\n\");\n                return false;\n            }\n            memcpy(data, buffer[reading], readOffset);\n        }\n        \/\/ begin read of next block\n        if (nextFileOffset < fileSize) {\n            length[1 - reading] = min(fileSize - nextFileOffset, bufferSize);\n            reader[1 - reading]->beginRead(buffer[1 - reading], length[1 - reading], nextFileOffset, NULL);\n            nextFileOffset += length[1 - reading];\n        } else {\n            length[1 - reading] = 0;\n        }\n    }\n    return true;\n}\n\n    bool\nBufferedAsyncReader::close()\n{\n    delete reader[0];\n    delete reader[1];\n    if (ownBuffer) {\n        BigDealloc(buffer[0]);\n        BigDealloc(buffer[1]);\n    }\n    return true;\n}\n   \n    bool\nBufferedAsyncWriter::open(\n    AsyncFile* file,\n    size_t i_bufferSize,\n    volatile _int64* sharedOffset)\n{\n    waitTime = 0;\n    writer[0] = file->getWriter();\n    writer[1] = file->getWriter();\n    bufferSize = i_bufferSize;\n    buffer[0] = (char*) BigAlloc(bufferSize);\n    buffer[1] = (char*) BigAlloc(bufferSize);\n    writeOffset = 0;\n    writing = 0;\n    privateFileOffset = 0;\n    nextFileOffset = sharedOffset != NULL ? sharedOffset : &privateFileOffset;\n    return writer[0] != NULL && writer[1] != NULL && buffer[0] != NULL && buffer[1] != NULL;\n}\n\n    bool\nBufferedAsyncWriter::write(\n    void* data,\n    size_t bytes)\n{\n    void* p = forWrite(bytes);\n    if (p == NULL) {\n        \/\/ todo: allow bytes > bufferSize using synchronous writes\n        return false;\n    }\n    memcpy(p, data, bytes);\n    return true;\n}\n    \n    void*\nBufferedAsyncWriter::forWrite(\n    size_t bytes)\n{\n    bool ok = true;\n    if (writeOffset + bytes <= bufferSize) {\n        writeOffset += bytes;\n        return buffer[writing] + writeOffset - bytes;\n    } else {\n        _int64 fileOffset = InterlockedAdd64AndReturnNewValue(nextFileOffset, writeOffset) - writeOffset;\n        ok = writer[writing]->beginWrite(buffer[writing], writeOffset, fileOffset, NULL);\n        _int64 start = timeInNanos();\n        ok &= writer[1 - writing]->waitForCompletion();\n        waitTime += timeInNanos() - start;\n        writing = 1 - writing;\n        if (! ok) {\n            fprintf(stderr, \"BufferedAsyncWriter write failed\\n\");\n            return NULL;\n        }\n        if (bytes <= bufferSize) {\n            writeOffset = bytes;\n            return buffer[writing];\n        } else {\n            \/\/ too big to be async\n            fprintf(stderr, \"BufferedAsyncWriter write too large\\n\");\n            return NULL;\n        }\n    }\n}\n\n    bool\nBufferedAsyncWriter::close()\n{\n    _int64 start = timeInNanos();\n    bool ok = writer[1 - writing]->waitForCompletion();\n    waitTime += timeInNanos() - start;\n    if (writeOffset > 0) {\n        _int64 fileOffset = InterlockedAdd64AndReturnNewValue(nextFileOffset, writeOffset) - writeOffset;\n        ok &= writer[writing]->beginWrite(buffer[writing], writeOffset, fileOffset, NULL);\n        _int64 start = timeInNanos();\n        ok &= writer[writing]->waitForCompletion();\n        waitTime += timeInNanos() - start;\n    }\n    delete writer[0];\n    delete writer[1];\n    BigDealloc(buffer[0]);\n    BigDealloc(buffer[1]);\n    return ok;\n}\n    <commit_msg>Wait time measurement<commit_after>\/*++\n\nModule Name:\n\n    BufferedAsync.cpp\n\nAbstract:\n\n    Double-buffered asynchronous file I\/O\n\nEnvironment:\n\n    User mode service.\n\n    This class is NOT thread safe.  It's the caller's responsibility to ensure that\n    at most one thread uses an instance at any time.\n\n--*\/\n\n#include \"stdafx.h\"\n#include \"Compat.h\"\n#include \"BigAlloc.h\"\n#include \"BufferedAsync.h\"\n\nusing std::min;\n\n\n    bool\nBufferedAsyncReader::open(\n    AsyncFile* file,\n    size_t offset,\n    size_t bytes,\n    size_t i_bufferSize,\n    bool async,\n    void* buffer0,\n    void* buffer1)\n{\n    _ASSERT((buffer0 == NULL) == (buffer1 == NULL)); \/\/ both null or both non-null\n    waitTime = 0;\n    reader[0] = file->getReader();\n    reader[1] = file->getReader();\n    bufferSize = i_bufferSize;\n    fileSize = offset + bytes;\n    ownBuffer = buffer0 == NULL;\n    buffer[0] = (char*) (buffer0 != NULL ? buffer0 : BigAlloc(bufferSize));\n    buffer[1] = (char*) (buffer1 != NULL ? buffer1 : BigAlloc(bufferSize));\n    if (reader[0] == NULL || reader[1] == NULL || buffer[0] == NULL || buffer[1] == NULL) {\n        fprintf(stderr, \"unable to setup temp file reader\\n\");\n        return false;\n    }\n    length[0] = min(bytes, bufferSize);\n    _int64 start = timeInNanos();\n    reader[0]->beginRead(buffer[0],length[0], offset, NULL);\n    if (bytes > bufferSize) {\n        length[1] = min(bytes - bufferSize, bufferSize);\n        reader[1]->beginRead(buffer[1], length[1], offset + bufferSize, NULL);\n    } else {\n        length[1] = 0;\n    }\n    waitTime += timeInNanos() - start;\n    reading = 0;\n    readOffset = 0;\n    nextFileOffset = offset + min(bytes, 2 * bufferSize);\n    if (! async) {\n        endOpen();\n    }\n    return true;\n}\n\n    void\nBufferedAsyncReader::endOpen()\n{\n    _int64 start = timeInNanos();\n    reader[reading]->waitForCompletion();\n    waitTime += timeInNanos() - start;\n}\n\n    bool\nBufferedAsyncReader::atEnd()\n{\n    return length[reading] == 0;\n}\n\n    bool\nBufferedAsyncReader::read(\n    void* data,\n    size_t bytes)\n{\n    if (bytes == 0) {\n        return true;\n    }\n    if (atEnd()) {\n        return false;\n    }\n    size_t first = min(bytes, length[reading] - readOffset);\n    memcpy(data, buffer[reading] + readOffset, first);\n    data = (char*) data + first;\n    readOffset += bytes;\n    if (readOffset >= length[reading]) {\n        \/\/ switch buffers\n        readOffset -= length[reading];\n        reading = 1 - reading;\n        _int64 start = timeInNanos();\n        reader[reading]->waitForCompletion();\n        waitTime += timeInNanos() - start;\n        if (readOffset > 0) {\n            \/\/ copy second part of read segment\n            \/\/ todo: allow for longer reads\n            if (readOffset > length[reading]) {\n                fprintf(stderr, \"read length too big\\n\");\n                return false;\n            }\n            memcpy(data, buffer[reading], readOffset);\n        }\n        \/\/ begin read of next block\n        if (nextFileOffset < fileSize) {\n            length[1 - reading] = min(fileSize - nextFileOffset, bufferSize);\n            start = timeInNanos();\n            reader[1 - reading]->beginRead(buffer[1 - reading], length[1 - reading], nextFileOffset, NULL);\n            waitTime += timeInNanos() - start;\n            nextFileOffset += length[1 - reading];\n        } else {\n            length[1 - reading] = 0;\n        }\n    }\n    return true;\n}\n\n    bool\nBufferedAsyncReader::close()\n{\n    delete reader[0];\n    delete reader[1];\n    if (ownBuffer) {\n        BigDealloc(buffer[0]);\n        BigDealloc(buffer[1]);\n    }\n    return true;\n}\n   \n    bool\nBufferedAsyncWriter::open(\n    AsyncFile* file,\n    size_t i_bufferSize,\n    volatile _int64* sharedOffset)\n{\n    waitTime = 0;\n    writer[0] = file->getWriter();\n    writer[1] = file->getWriter();\n    bufferSize = i_bufferSize;\n    buffer[0] = (char*) BigAlloc(bufferSize);\n    buffer[1] = (char*) BigAlloc(bufferSize);\n    writeOffset = 0;\n    writing = 0;\n    privateFileOffset = 0;\n    nextFileOffset = sharedOffset != NULL ? sharedOffset : &privateFileOffset;\n    return writer[0] != NULL && writer[1] != NULL && buffer[0] != NULL && buffer[1] != NULL;\n}\n\n    bool\nBufferedAsyncWriter::write(\n    void* data,\n    size_t bytes)\n{\n    void* p = forWrite(bytes);\n    if (p == NULL) {\n        \/\/ todo: allow bytes > bufferSize using synchronous writes\n        return false;\n    }\n    memcpy(p, data, bytes);\n    return true;\n}\n    \n    void*\nBufferedAsyncWriter::forWrite(\n    size_t bytes)\n{\n    bool ok = true;\n    if (writeOffset + bytes <= bufferSize) {\n        writeOffset += bytes;\n        return buffer[writing] + writeOffset - bytes;\n    } else {\n        _int64 fileOffset = InterlockedAdd64AndReturnNewValue(nextFileOffset, writeOffset) - writeOffset;\n        _int64 start = timeInNanos();\n        ok = writer[writing]->beginWrite(buffer[writing], writeOffset, fileOffset, NULL);\n        ok &= writer[1 - writing]->waitForCompletion();\n        waitTime += timeInNanos() - start;\n        writing = 1 - writing;\n        if (! ok) {\n            fprintf(stderr, \"BufferedAsyncWriter write failed\\n\");\n            return NULL;\n        }\n        if (bytes <= bufferSize) {\n            writeOffset = bytes;\n            return buffer[writing];\n        } else {\n            \/\/ too big to be async\n            fprintf(stderr, \"BufferedAsyncWriter write too large\\n\");\n            return NULL;\n        }\n    }\n}\n\n    bool\nBufferedAsyncWriter::close()\n{\n    _int64 start = timeInNanos();\n    bool ok = writer[1 - writing]->waitForCompletion();\n    waitTime += timeInNanos() - start;\n    if (writeOffset > 0) {\n        _int64 fileOffset = InterlockedAdd64AndReturnNewValue(nextFileOffset, writeOffset) - writeOffset;\n        _int64 start = timeInNanos();\n        ok &= writer[writing]->beginWrite(buffer[writing], writeOffset, fileOffset, NULL);\n        ok &= writer[writing]->waitForCompletion();\n        waitTime += timeInNanos() - start;\n    }\n    delete writer[0];\n    delete writer[1];\n    BigDealloc(buffer[0]);\n    BigDealloc(buffer[1]);\n    return ok;\n}\n    <|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <exception>\n#include <regex>\n#include <iostream>\n\n#include \"acmacs-base\/throw.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace virus_name\n{\n    namespace _internal\n    {\n#pragma GCC diagnostic push\n#ifdef __clang__\n#pragma GCC diagnostic ignored \"-Wglobal-constructors\"\n#pragma GCC diagnostic ignored \"-Wexit-time-destructors\"\n#endif\n\n        const std::regex cdc{\"^([A-Z][A-Z][A-Z]?) \"};\n\n        constexpr const char* re_international_name = \"^(?:([AB][^\/]*)\/)?(?:([^\/]+)\/)?([^\/]+)\/0*([^\/]+)\/(19|20)?(\\\\d\\\\d)\";\n        constexpr const char* re_reassortant_passage = \"(?:(?:\\\\s+|__)(.+))?\";\n\n          \/\/ [1] - type+subtype, [2] - host, [3] - location, [4] - isolation-number (omitting leading zeros), [5] - century, [6] - year (2 last digit), [7] - reassortant and passage\n          \/\/ const std::regex international{\"^([AB][^\/]*)\/(?:([^\/]+)\/)?([^\/]+)\/0*([^\/]+)\/(19|20)?(\\\\d\\\\d)(?:(?:\\\\s+|__)(.+))?$\"};\n        const std::regex international{std::string(re_international_name) + re_reassortant_passage + \"$\"};\n        const std::regex international_name{re_international_name};\n\n#pragma GCC diagnostic pop\n\n        inline std::string make_year(const std::smatch& m)\n        {\n            std::string year;\n            if (m[5].length())\n                year = m[5].str() + m[6].str();\n            else if (m[6].str()[0] > '2')\n                year = \"19\" + m[6].str();\n            else\n                year = \"20\" + m[6].str();\n            return year;\n        }\n\n        constexpr const size_t international_name_suffix_size = 9; \/\/ len(lo\/isolation-number\/year) >= 9\n\n        inline std::string location_human(std::string name, size_t prefix_size)\n        {\n            const auto end = name.find('\/', prefix_size);\n            return name.substr(prefix_size, end - prefix_size);\n        }\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    class Unrecognized : public std::runtime_error { public: using std::runtime_error::runtime_error; };\n\n\/\/ ----------------------------------------------------------------------\n\n    std::string normalize(std::string name);\n\n\/\/ ----------------------------------------------------------------------\n\n    std::string normalize(std::string name);\n\n    using location_func_t = std::string (*)(std::string);\n\n      \/\/ returned cdc abbreviation starts with #\n    inline std::string location(std::string name)\n    {\n        using namespace _internal;\n        std::string location;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            location = m[3].str();\n        else if (std::regex_search(name, m, cdc))\n            location = \"#\" + m[1].str();\n        else\n            THROW(Unrecognized{\"No location in \" + name}, std::string{});\n        return location;\n    }\n\n      \/\/ Faster version of location() for A(H3N2)\/ and A(H1N1)\/ names without host field\n    inline std::string location_human_a(std::string name)\n    {\n        constexpr const size_t prefix_size = 8;\n        return (name.size() > (prefix_size + _internal::international_name_suffix_size) && name[prefix_size - 1] == '\/') ?  _internal::location_human(name, prefix_size) : location(name);\n    }\n\n      \/\/ Faster version of location() for B\/ names without host field\n    inline std::string location_human_b(std::string name)\n    {\n        constexpr const size_t prefix_size = 2;\n        return (name.size() > (prefix_size + _internal::international_name_suffix_size) && name[prefix_size - 1] == '\/') ?  _internal::location_human(name, prefix_size) : location(name);\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    inline std::string virus_type(std::string name)\n    {\n        using namespace _internal;\n        std::string virus_type;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            virus_type = m[1].str();\n        else\n            THROW(Unrecognized{\"No virus_type in \" + name}, std::string{});\n        return virus_type;\n\n    } \/\/ AntigenSerum::virus_type\n\n\/\/ ----------------------------------------------------------------------\n\n    inline std::string year(std::string name)\n    {\n        using namespace _internal;\n        std::string year;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            year = make_year(m);\n        else\n            THROW(Unrecognized{\"No year in \" + name}, std::string{});\n        return year;\n\n    } \/\/ AntigenSerum::year\n\n\/\/ ----------------------------------------------------------------------\n\n    inline void split(std::string name, std::string& virus_type, std::string& host, std::string& location, std::string& isolation, std::string& year, std::string& passage)\n    {\n        std::smatch m;\n        if (std::regex_match(name, m, _internal::international)) {\n            virus_type = m[1].str();\n            host = m[2].str();\n            location = m[3].str();\n            isolation = m[4].str();\n            year = _internal::make_year(m);\n            passage = m[7].str();\n        }\n        else\n            THROW_OR_VOID(Unrecognized{\"Cannot split \" + name});\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n      \/\/ Extracts virus name without passage, reassortant, extra,\n      \/\/ etc. and calculates match threshold (to use with\n      \/\/ acmacs_chart::Antigens::find_by_name_matching), match threshold is a square\n      \/\/ of virus name length.\n    inline size_t match_threshold(std::string name)\n    {\n        size_t result = 0;\n        std::smatch m;\n        if (std::regex_search(name, m, _internal::international_name)) {\n              \/\/ find end of year (m[6])\n            const auto end_of_year_offset = static_cast<size_t>(m[6].second - name.begin());\n            result = end_of_year_offset * end_of_year_offset;\n              \/\/ std::cerr << \"INFO: match_threshold: end_of_year_offset:\" << end_of_year_offset << \" name:\" << name << std::endl;\n        }\n        return result;\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>international virus name splitting fixed<commit_after>#pragma once\n\n#include <exception>\n#include <regex>\n#include <iostream>\n\n#include \"acmacs-base\/throw.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace virus_name\n{\n    namespace _internal\n    {\n#pragma GCC diagnostic push\n#ifdef __clang__\n#pragma GCC diagnostic ignored \"-Wglobal-constructors\"\n#pragma GCC diagnostic ignored \"-Wexit-time-destructors\"\n#endif\n\n        const std::regex cdc{\"^([A-Z][A-Z][A-Z]?) \"};\n\n        constexpr const char* re_international_name = \"^(?:([AB][^\/]*)\/)?(?:([^\/]+)\/)?([^\/]{2,})\/0*([^\/]+)\/(19|20)?(\\\\d\\\\d)\";\n        constexpr const char* re_reassortant_passage = \"(?:(?:\\\\s+|__)(.+))?\";\n\n          \/\/ [1] - type+subtype, [2] - host, [3] - location, [4] - isolation-number (omitting leading zeros), [5] - century, [6] - year (2 last digit), [7] - reassortant and passage\n          \/\/ const std::regex international{\"^([AB][^\/]*)\/(?:([^\/]+)\/)?([^\/]+)\/0*([^\/]+)\/(19|20)?(\\\\d\\\\d)(?:(?:\\\\s+|__)(.+))?$\"};\n        const std::regex international{std::string(re_international_name) + re_reassortant_passage + \"$\"};\n        const std::regex international_name{re_international_name};\n\n#pragma GCC diagnostic pop\n\n        inline std::string make_year(const std::smatch& m)\n        {\n            std::string year;\n            if (m[5].length())\n                year = m[5].str() + m[6].str();\n            else if (m[6].str()[0] > '2')\n                year = \"19\" + m[6].str();\n            else\n                year = \"20\" + m[6].str();\n            return year;\n        }\n\n        constexpr const size_t international_name_suffix_size = 9; \/\/ len(lo\/isolation-number\/year) >= 9\n\n        inline std::string location_human(std::string name, size_t prefix_size)\n        {\n            const auto end = name.find('\/', prefix_size);\n            return name.substr(prefix_size, end - prefix_size);\n        }\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    class Unrecognized : public std::runtime_error { public: using std::runtime_error::runtime_error; };\n\n\/\/ ----------------------------------------------------------------------\n\n    std::string normalize(std::string name);\n\n\/\/ ----------------------------------------------------------------------\n\n    std::string normalize(std::string name);\n\n    using location_func_t = std::string (*)(std::string);\n\n      \/\/ returned cdc abbreviation starts with #\n    inline std::string location(std::string name)\n    {\n        using namespace _internal;\n        std::string location;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            location = m[3].str();\n        else if (std::regex_search(name, m, cdc))\n            location = \"#\" + m[1].str();\n        else\n            THROW(Unrecognized{\"No location in \" + name}, std::string{});\n        return location;\n    }\n\n      \/\/ Faster version of location() for A(H3N2)\/ and A(H1N1)\/ names without host field\n    inline std::string location_human_a(std::string name)\n    {\n        constexpr const size_t prefix_size = 8;\n        return (name.size() > (prefix_size + _internal::international_name_suffix_size) && name[prefix_size - 1] == '\/') ?  _internal::location_human(name, prefix_size) : location(name);\n    }\n\n      \/\/ Faster version of location() for B\/ names without host field\n    inline std::string location_human_b(std::string name)\n    {\n        constexpr const size_t prefix_size = 2;\n        return (name.size() > (prefix_size + _internal::international_name_suffix_size) && name[prefix_size - 1] == '\/') ?  _internal::location_human(name, prefix_size) : location(name);\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n    inline std::string virus_type(std::string name)\n    {\n        using namespace _internal;\n        std::string virus_type;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            virus_type = m[1].str();\n        else\n            THROW(Unrecognized{\"No virus_type in \" + name}, std::string{});\n        return virus_type;\n\n    } \/\/ AntigenSerum::virus_type\n\n\/\/ ----------------------------------------------------------------------\n\n    inline std::string year(std::string name)\n    {\n        using namespace _internal;\n        std::string year;\n        std::smatch m;\n        if (std::regex_match(name, m, international))\n            year = make_year(m);\n        else\n            THROW(Unrecognized{\"No year in \" + name}, std::string{});\n        return year;\n\n    } \/\/ AntigenSerum::year\n\n\/\/ ----------------------------------------------------------------------\n\n    inline void split(std::string name, std::string& virus_type, std::string& host, std::string& location, std::string& isolation, std::string& year, std::string& passage)\n    {\n        std::smatch m;\n        if (std::regex_match(name, m, _internal::international)) {\n            virus_type = m[1].str();\n            host = m[2].str();\n            location = m[3].str();\n            isolation = m[4].str();\n            year = _internal::make_year(m);\n            passage = m[7].str();\n        }\n        else\n            THROW_OR_VOID(Unrecognized{\"Cannot split \" + name});\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n      \/\/ Extracts virus name without passage, reassortant, extra,\n      \/\/ etc. and calculates match threshold (to use with\n      \/\/ acmacs_chart::Antigens::find_by_name_matching), match threshold is a square\n      \/\/ of virus name length.\n    inline size_t match_threshold(std::string name)\n    {\n        size_t result = 0;\n        std::smatch m;\n        if (std::regex_search(name, m, _internal::international_name)) {\n              \/\/ find end of year (m[6])\n            const auto end_of_year_offset = static_cast<size_t>(m[6].second - name.begin());\n            result = end_of_year_offset * end_of_year_offset;\n              \/\/ std::cerr << \"INFO: match_threshold: end_of_year_offset:\" << end_of_year_offset << \" name:\" << name << std::endl;\n        }\n        return result;\n    }\n\n\/\/ ----------------------------------------------------------------------\n\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>#include \"cone.hpp\"\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <iostream>\n#include <string>\n#include \"color.hpp\"\n#include \"ray.hpp\"\n#include \"material.hpp\"\n#include <glm\/vec3.hpp>\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/intersect.hpp>\n#define PI 3.14159265\n\nCone::Cone(): Shape{}, center_{0.0f, 0.0f, 0.0f}, radius_{0.0f}, center2_{0.0f, 0.0f, 0.0f}{}\nCone::Cone(glm::vec3 const& center, float radius, glm::vec3 const& center2): Shape{}, center_{center}, radius_{radius}, center2_{center2}{}\nCone::Cone(std::string name, glm::vec3 const& center, float radius, glm::vec3 const& center2, std::string material) : Shape{name, material}, center_{center}, radius_{radius}, center2_{center2}{}\n\n\/\/Cone::Cone(glm::vec3 const& center, float radius, glm::vec3 const& center2, std::string name, Color const& color):Shape{name, color}, center_{center}, radius_{radius}, center2_{center2}{}\n\/\/Cone::~Cone(){std::cout << \"Cone Destructor\" << std::endl;}\n\n\/*Cone::Cone(glm::vec3 const& center, float radius, glm::vec3 const& center2, std::string name, Material const& mat): Shape{name, mat}, center_{center}, radius_{radius}, center2_{center2}{}\nCone::Cone(glm::vec3 const& center, float radius, glm::vec3 const& center2, std::string name, std::string name_mat, Color const& ka, Color const& kd, Color const& ks, float m): Shape{name, name_mat, ka, kd, ks, m}, center_{center}, radius_{radius}, center2_{center2}{}*\/\n\n\n\nglm::vec3 const& Cone::get_center() const {\n\treturn center_;\n}\n\nfloat const& Cone::get_radius() const {\n\treturn radius_;\n}\n\nglm::vec3 const& Cone::get_center2() const {\n\treturn center2_;\n\t\n}\n\nbool Cone::intersect(Ray const& ray, float& distance, glm::vec3& intersection, glm::vec3& normal)const{\n\t\/\/Gerade durch Mitte des Kegels: p_a + v_a * t, p_a = Stützvektor = center unten, v_a = Richtungsvektor = center oben-center unten\n\tglm::vec3 p_a = center_;\n\tglm::vec3 v_a = center2_ - center_;\n\t\n\tglm::vec3 p = ray.origin;\n\tglm::vec3 v = ray.direction;\n\t\n\tfloat height = glm::length(v_a);\n\tfloat beta = atan(height\/radius) * PI\/180; \/\/Winkel an der Fläche\n\tfloat alpha = PI\/2 - beta; \/\/Winkel an der Spitze = zwischen Gerade und einer Seite\n\t\n\tfloat a = cos(alpha) * cos(alpha) * (v - glm::dot(v, v_a) * v_a) * (v - glm::dot(v, v_a) * v_a) - sin(alpha) * sin(alpha) * (glm::dot(v, v_a)) * (glm::dot(v, v_a));\n\tfloat b = 2 * cos(alpha) * cos(alpha) * (v - glm::dot(v, v_a) * (glm::dot(v_a,(p-p_a))) - (glm::dot((p-p_a), v_a)) * v_a) - 2 * sin(alpha) * sin(alpha) * glm::dot(v, v_a) * glm::dot((p-p_a), v_a);\n\tfloat c = cos(alpha) * cos(alpha) * ((p-p_a) - glm::dot((p-p_a), v_a) * v_a) * ((p-p_a) - glm::dot((p-p_a), v_a) * v_a) - sin(alpha) * sin(alpha) * glm::dot((p-p_a), v_a) * glm::dot((p-p_a), v_a);\n\t\n\tfloat possibleT[3];\n\t\n\tfloat x1;\n\tfloat x2;\n\t\n\tsolveQuadratic(a, b, c, x1, x2);\n\t\n\t\/\/schauen ob die intersection zwischen Spitze und Basis ist\n\tglm::vec3 q1 = p + v*x1\n\tif (x1 > 0 && (glm::dot(v_a, (q1 - center_))) > 0 && (glm::dot(v_a, (q1 - center2_))) < 0){\n\t\tpossibleT[0] = x1;\n\t}\n\t\n\tglm::vec3 q2 = p + v*x2\n\tif (x2 > 0 && (glm::dot(v_a, (q2 - center_))) > 0 && (glm::dot(v_a, (q2 - center2_))){\n\t\tpossibleT[1] = x2;\n\t}\n\t\n\t\/\/unten\n\tv_a = glm::normalize(v_a);\n\tglm::vec3 c = glm::normalize(center_);\n\tglm::vec3 origin = glm::normalize(ray.origin);\n\tglm::vec3 direction = glm::normalize(ray.direction);\n\t\n\tfloat x3;\n\tintersectDisk(v_a, c, radius, origin, direction, x3);\n\tpossibleT[2] = x3;\n\t\n\tfloat t = possibleT[0];\n\tfor (int i = 1; i < 4; i++){\n\t\tif (t == 0 && possibleT[i] > 0){\n\t\t\tt = possibleT[i]\n\t\t}\n\t\telse if(possibleT[i] < t && possibleT[i] > 0){\n\t\t\tt = possibleT[i]\n\t\t}\n\t}\n\t\n\tif (t > 0){\n\t\tintersection = p + v*t;\n\t\t\n\t\tif(t == x1 || t == x2){\n\t\t\tglm::vec3 b = intersection - p_a;\n\t\t\tfloat r = (glm::dot(b, v_a))\/glm::length(v_a);\n\t\t\tglm::vec3 f = p_a + (r\/glm::length(v_a))*v_a;\n\t\t\tnormal = intersection - f;\n\t\t}\t\t\n\t\t\n\t\telse if(t == x3){\n\t\tnormal = v_a;\n\t\t}\t\n\n\t\treturn true;\n\t}\n\t\n\telse {\n\t\treturn false;\n\n\t}\n}\n\nstd::ostream& Cone::print(std::ostream& os) const{\n\tShape::print(os);\n\t\/\/os << \"Name: \" << get_name() << \", Color: \" << get_color().r << \" \" << get_color().g << \" \" << get_color().b << \"\\n\";\n\tos << \"Mittelpunkt Basis: \" << center_.x << \" \" << center_.y << \" \";\n\tos << center_.z << \",\" << \"Radius: \" << radius_; << \",\" << \"Spitze: \";\n\tos << center2_.x << \" \" << center2_.y << \" \" << center2_.z;\n\n\treturn os;\n}\n<commit_msg>verbesserung<commit_after>#include \"cone.hpp\"\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <iostream>\n#include <string>\n#include \"color.hpp\"\n#include \"ray.hpp\"\n#include \"material.hpp\"\n#include <glm\/vec3.hpp>\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/intersect.hpp>\n#define PI 3.14159265\n\nCone::Cone(): Shape{}, center_{0.0f, 0.0f, 0.0f}, radius_{0.0f}, center2_{0.0f, 0.0f, 0.0f}{}\nCone::Cone(glm::vec3 const& center, float radius, glm::vec3 const& center2): Shape{}, center_{center}, radius_{radius}, center2_{center2}{}\nCone::Cone(std::string name, glm::vec3 const& center, float radius, glm::vec3 const& center2, std::string material) : Shape{name, material}, center_{center}, radius_{radius}, center2_{center2}{}\n\n\/\/Cone::Cone(glm::vec3 const& center, float radius, glm::vec3 const& center2, std::string name, Color const& color):Shape{name, color}, center_{center}, radius_{radius}, center2_{center2}{}\n\/\/Cone::~Cone(){std::cout << \"Cone Destructor\" << std::endl;}\n\n\/*Cone::Cone(glm::vec3 const& center, float radius, glm::vec3 const& center2, std::string name, Material const& mat): Shape{name, mat}, center_{center}, radius_{radius}, center2_{center2}{}\nCone::Cone(glm::vec3 const& center, float radius, glm::vec3 const& center2, std::string name, std::string name_mat, Color const& ka, Color const& kd, Color const& ks, float m): Shape{name, name_mat, ka, kd, ks, m}, center_{center}, radius_{radius}, center2_{center2}{}*\/\n\n\n\nglm::vec3 const& Cone::get_center() const {\n\treturn center_;\n}\n\nfloat const& Cone::get_radius() const {\n\treturn radius_;\n}\n\nglm::vec3 const& Cone::get_center2() const {\n\treturn center2_;\n\t\n}\n\nbool Cone::intersect(Ray const& ray, float& distance, glm::vec3& intersection, glm::vec3& normal)const{\n\t\/\/Gerade durch Mitte des Kegels: p_a + v_a * t, p_a = Stützvektor = center unten, v_a = Richtungsvektor = center oben-center unten\n\tglm::vec3 p_a = center_;\n\tglm::vec3 v_a = center2_ - center_;\n\t\n\tglm::vec3 p = ray.origin;\n\tglm::vec3 v = ray.direction;\n\t\n\tfloat height = glm::length(v_a);\n\tfloat beta = atan(height\/radius); \/\/Winkel an der Fläche\n\tfloat alpha = PI\/2 - beta; \/\/Winkel an der Spitze = zwischen Gerade und einer Seite\n\t\n\tfloat a = cos(alpha) * cos(alpha) * (v - glm::dot(v, v_a) * v_a) * (v - glm::dot(v, v_a) * v_a) - sin(alpha) * sin(alpha) * (glm::dot(v, v_a)) * (glm::dot(v, v_a));\n\tfloat b = 2 * cos(alpha) * cos(alpha) * (v - glm::dot(v, v_a) * (glm::dot(v_a,(p-p_a))) - (glm::dot((p-p_a), v_a)) * v_a) - 2 * sin(alpha) * sin(alpha) * glm::dot(v, v_a) * glm::dot((p-p_a), v_a);\n\tfloat c = cos(alpha) * cos(alpha) * ((p-p_a) - glm::dot((p-p_a), v_a) * v_a) * ((p-p_a) - glm::dot((p-p_a), v_a) * v_a) - sin(alpha) * sin(alpha) * glm::dot((p-p_a), v_a) * glm::dot((p-p_a), v_a);\n\t\n\tfloat possibleT[3];\n\t\n\tfloat x1;\n\tfloat x2;\n\t\n\tsolveQuadratic(a, b, c, x1, x2);\n\t\n\t\/\/schauen ob die intersection zwischen Spitze und Basis ist\n\tglm::vec3 q1 = p + v*x1\n\tif (x1 > 0 && (glm::dot(v_a, (q1 - center_))) > 0 && (glm::dot(v_a, (q1 - center2_))) < 0){\n\t\tpossibleT[0] = x1;\n\t}\n\t\n\tglm::vec3 q2 = p + v*x2\n\tif (x2 > 0 && (glm::dot(v_a, (q2 - center_))) > 0 && (glm::dot(v_a, (q2 - center2_))){\n\t\tpossibleT[1] = x2;\n\t}\n\t\n\t\/\/unten\n\tv_a = glm::normalize(v_a);\n\tglm::vec3 c = glm::normalize(center_);\n\tglm::vec3 origin = glm::normalize(ray.origin);\n\tglm::vec3 direction = glm::normalize(ray.direction);\n\t\n\tfloat x3;\n\tintersectDisk(v_a, c, radius, origin, direction, x3);\n\tpossibleT[2] = x3;\n\t\n\tfloat t = possibleT[0];\n\tfor (int i = 1; i < 4; i++){\n\t\tif (t == 0 && possibleT[i] > 0){\n\t\t\tt = possibleT[i]\n\t\t}\n\t\telse if(possibleT[i] < t && possibleT[i] > 0){\n\t\t\tt = possibleT[i]\n\t\t}\n\t}\n\t\n\tif (t > 0){\n\t\tintersection = p + v*t;\n\t\t\n\t\tif(t == x1 || t == x2){\n\t\t\tglm::vec3 b = intersection - p_a;\n\t\t\tfloat r = (glm::dot(b, v_a))\/glm::length(v_a);\n\t\t\tglm::vec3 f = p_a + (r\/glm::length(v_a))*v_a;\n\t\t\tnormal = intersection - f;\n\t\t}\t\t\n\t\t\n\t\telse if(t == x3){\n\t\tnormal = v_a;\n\t\t}\t\n\n\t\treturn true;\n\t}\n\t\n\telse {\n\t\treturn false;\n\n\t}\n}\n\nstd::ostream& Cone::print(std::ostream& os) const{\n\tShape::print(os);\n\t\/\/os << \"Name: \" << get_name() << \", Color: \" << get_color().r << \" \" << get_color().g << \" \" << get_color().b << \"\\n\";\n\tos << \"Mittelpunkt Basis: \" << center_.x << \" \" << center_.y << \" \";\n\tos << center_.z << \",\" << \"Radius: \" << radius_; << \",\" << \"Spitze: \";\n\tos << center2_.x << \" \" << center2_.y << \" \" << center2_.z;\n\n\treturn os;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __CPREL_BDDDOMAIN_MANAGER_HH__\n#define __CPREL_BDDDOMAIN_MANAGER_HH__\n\n#include <iostream>\n#include <iomanip>\n#include <boost\/utility.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/static_assert.hpp>\n\/\/#include <cudd\/cuddInt.h>\n#include <obj\/cuddObj.hh>\n#include <limits>\n\nnamespace MPG { namespace VarImpl {\n\n    namespace Limits {\n      \/**\n       * \\brief Number of bits to represent an element inside a relation\n       * tuple.\n       * \\ingroup DomRepr\n       *\n       * The maximum number that can be part of relation's tuple is 2^bbv.\n       * - Setting this attribute to 5 will allow to represent positive integers\n       *   of 32 bits.\n       *\/\n      const int bbv = 5;\n      \/**\n       * \\brief Number of bits of the maximum arity that can be represented\n       * \\ingroup DomRepr\n       *\n       * The maximum arity that a relation can have is 2^ba.\n       * - Setting this attribute to 3 will allow to represent up to 8-ary relations\n       *\/\n      const int ba = 3;\n      \/**\n       * \\brief Number of bits used to represent each element of a tuple\n       * \\ingroup DomRepr\n       *\/\n      const int bitsPerInteger = 1 << bbv;\n      \/**\n       * \\brief Number of bits used to represent the arity\n       * \\ingroup DomRepr\n       *\/\n      const int arity = 1 << ba;\n      \/**\n       * \\brief Maximum number that can be represented by the current\n       * configuration of the manager.\n       * \\ingroup DomRepr\n       *\/\n      const unsigned int maxValue = (1L << bitsPerInteger) - 1;\n      \/**\n       * \\brief Ensures that the library is compiled on an architecture in which the\n       * bits in an integer fits in the bdd representation. This is because most of the\n       * operations on tuples or anything that has a bdd representation behind use the\n       * int type to input and output values.\n       * \\ingroup DomRepr\n       *\/\n\n      \/\/  BOOST_STATIC_ASSERT(std::numeric_limits<int>::digits <= bitsPerInteger\n      \/\/                      && \"The BDD configuration is wrong for this built\");\n    }\n\n    class BddManager;\n    typedef boost::shared_ptr<BddManager> PManager;\n    \/**\n       \\brief Class to interact with the underlying bdd library.\n       \\ingroup DomRepr\n     \n       A common design of BDD libraries is to provide a space where\n       all the bdd nodes are allocated and the operations are\n       performed. The manager will abstract this in order to decouple\n       the domain representation from a particular implementation.\n     \n       The manager is configured by two main constants that will\n       define the number of bdd variables that will be used.\n     \n       This class is also in charge of controlling te life time of the\n       bdd objects. There is one global object for all the constraint\n       system and no assumption on thread safety can be made on it.\n     *\/\n    class BddManager : private boost::noncopyable {\n    private:\n      \/\/\/ Only one single instance of this class is allowed at run time\n      static PManager _instance;\n      \/\/\/ Bdd abstraction offered by CUDD\n      Cudd factory_;\n      \/\/\/ \\name Constructors and destructor\n      \/\/@{\n      \/\/\/ Constructor that initializes the BDD manager of CUDD\n      BddManager (void)\n\t: factory_(Limits::bitsPerInteger * Limits::arity,\n\t\t   0,CUDD_UNIQUE_SLOTS,CUDD_CACHE_SLOTS,0)\n      {\n\t\/\/\/ \\todo: The existence of shiftLeft needs that the manager is initialized\n\t\/\/\/ with the number of variables. Fix that method in order to permute only existent vars\n      }\n      \/\/\/ Creates an instace of this object\n      static void create() {\n\t_instance.reset( new BddManager, &deleter );\n      }\n      \/\/\/ Destructor that releases the BDD manager of CUDD\n      ~BddManager (void) {\n\tstd::cout << \"Destroyed BDD manager: \" << references() << std::endl;\n\t\/\/std::cout << \"Manager stats\" << std::endl;\n\tstats(std::cout);\n      }\n      \/\/@}\n      \/\/\/ Method called by the managed pointer when destructed\n      static void deleter(BddManager *ptr) {\n\tdelete ptr;\n      }\n      int references(void) {\n\treturn Cudd_CheckZeroRef(factory_.getManager());\n      }\n    public:\n      \/\/\/ Returns an instance of the manager\n      static PManager instance(void) {\n\tif (_instance.get() != NULL)\n\t  return _instance;\n\tcreate();\n\treturn _instance;\n      }\n      \/\/\/ \\name Access\n      \/\/@{\n      \/\/\/ Returns the factory\n      Cudd* getFactory(void) {\n\treturn &factory_;\n      }\n      \/\/\/ Returns the bdd manager\n      DdManager* manager(void) {\n\treturn factory_.getManager();\n      }\n      \/\/\/ Returns the constant \\c true\n      BDD one(void) {\n\treturn factory_.bddOne();\n      }\n      \/\/\/ Returns the constant \\c false\n      BDD zero(void) {\n\treturn factory_.bddZero();\n      }\n      \/\/\/ Prints manager statistics to \\a os\n      void stats(std::ostream& os) const {\n\t\n\tauto usedMemory = Cudd_ReadMemoryInUse(factory_.getManager());\n\t\/\/    os << \"\\tMemory in use: \" <<  (usedMemory \/ 1024)  << \" KB\" << std::endl;\n\tauto gcTime = Cudd_ReadGarbageCollectionTime(factory_.getManager());\n\t\/\/os << \"\\tGC time: \" <<  gcTime  << \" ms.\" << std::endl;\n\tauto gcs =  Cudd_ReadGarbageCollections(factory_.getManager());\n\t\/\/os << \"\\tGC triggered \" << gcs << \" times\" << std::endl;\n\n\t{\n\t  std::cout << \"|\" << std::setfill('-') << std::setw(14) << \"-+\" \n\t\t    << std::setw(14) << \"-+\" << std::setw(14) << \"-|\" << std::endl;\t\n\t  std::cout << \"|\" << \"Memory (MB) \" <<  \"|\"  << \"GC (s.)\" << \" |\" << \"GC steps\" << \" |\" << std::endl;\n\t  std::cout << \"|\" << std::setfill('-') << std::setw(14) << \"-+\" \n\t\t    << std::setw(14) << \"-+\" << std::setw(14) << \"-|\" << std::endl;\n\t  \/*\n\t    This will print a table in the form:\n            |--------------+---------+----------------|\n            | Memmory (MB) | GC (s.) | Number of GC's |\n            |--------------+---------+----------------|\n\t  *\/\n\t  os << \"|\" <<  (usedMemory \/ 1048576.0)   << \"|\" << (gcTime \/ 1000.0) << \"|\" << gcs << \"|\" << std::endl;\n\t}\n      }\n      \/\/@}\n    };\n\n    \/**\n     * \\brief Returns the factory used for all the bdds\n     * \\ingroup DomRepr\n     *\/\n    inline \n    Cudd* factoryPtr(void) {\n      return BddManager::instance()->getFactory();\n    }\n    inline\n    Cudd& factory(void) {\n      return *factoryPtr();\n    }\n    \/**\n     * \\brief Returns the manager\n     * \\ingroup DomRepr\n     *\/\n    inline\n    DdManager* dd(void) {\n      return BddManager::instance()->manager();\n    }\n    \/**\n     * \\brief Returns logical true\n     * \\ingroup DomRepr\n     *\/\n    inline\n    BDD one(void) {\n      return BddManager::instance()->one();\n    }\n    \/**\n     * \\brief Returns logical false\n     * \\ingroup DomRepr\n     *\/\n    inline\n    BDD zero(void) {\n      return BddManager::instance()->zero();\n    }\n    \/**\n     * \\brief Oututs manager statistics to \\a os\n     * \\ingroup DomRepr\n     *\/\n    inline\n    void stats(std::ostream& os) {\n      BddManager::instance()->stats(os);\n    }\n  }}\n#endif\n<commit_msg>Fixed statistics printing<commit_after>#ifndef __CPREL_BDDDOMAIN_MANAGER_HH__\n#define __CPREL_BDDDOMAIN_MANAGER_HH__\n\n#include <iostream>\n#include <iomanip>\n#include <boost\/utility.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/static_assert.hpp>\n\/\/#include <cudd\/cuddInt.h>\n#include <obj\/cuddObj.hh>\n#include <limits>\n\nnamespace MPG { namespace VarImpl {\n\n    namespace Limits {\n      \/**\n       * \\brief Number of bits to represent an element inside a relation\n       * tuple.\n       * \\ingroup DomRepr\n       *\n       * The maximum number that can be part of relation's tuple is 2^bbv.\n       * - Setting this attribute to 5 will allow to represent positive integers\n       *   of 32 bits.\n       *\/\n      const int bbv = 5;\n      \/**\n       * \\brief Number of bits of the maximum arity that can be represented\n       * \\ingroup DomRepr\n       *\n       * The maximum arity that a relation can have is 2^ba.\n       * - Setting this attribute to 3 will allow to represent up to 8-ary relations\n       *\/\n      const int ba = 3;\n      \/**\n       * \\brief Number of bits used to represent each element of a tuple\n       * \\ingroup DomRepr\n       *\/\n      const int bitsPerInteger = 1 << bbv;\n      \/**\n       * \\brief Number of bits used to represent the arity\n       * \\ingroup DomRepr\n       *\/\n      const int arity = 1 << ba;\n      \/**\n       * \\brief Maximum number that can be represented by the current\n       * configuration of the manager.\n       * \\ingroup DomRepr\n       *\/\n      const unsigned int maxValue = (1L << bitsPerInteger) - 1;\n      \/**\n       * \\brief Ensures that the library is compiled on an architecture in which the\n       * bits in an integer fits in the bdd representation. This is because most of the\n       * operations on tuples or anything that has a bdd representation behind use the\n       * int type to input and output values.\n       * \\ingroup DomRepr\n       *\/\n\n      \/\/  BOOST_STATIC_ASSERT(std::numeric_limits<int>::digits <= bitsPerInteger\n      \/\/                      && \"The BDD configuration is wrong for this built\");\n    }\n\n    class BddManager;\n    typedef boost::shared_ptr<BddManager> PManager;\n    \/**\n       \\brief Class to interact with the underlying bdd library.\n       \\ingroup DomRepr\n     \n       A common design of BDD libraries is to provide a space where\n       all the bdd nodes are allocated and the operations are\n       performed. The manager will abstract this in order to decouple\n       the domain representation from a particular implementation.\n     \n       The manager is configured by two main constants that will\n       define the number of bdd variables that will be used.\n     \n       This class is also in charge of controlling te life time of the\n       bdd objects. There is one global object for all the constraint\n       system and no assumption on thread safety can be made on it.\n     *\/\n    class BddManager : private boost::noncopyable {\n    private:\n      \/\/\/ Only one single instance of this class is allowed at run time\n      static PManager _instance;\n      \/\/\/ Bdd abstraction offered by CUDD\n      Cudd factory_;\n      \/\/\/ \\name Constructors and destructor\n      \/\/@{\n      \/\/\/ Constructor that initializes the BDD manager of CUDD\n      BddManager (void)\n\t: factory_(Limits::bitsPerInteger * Limits::arity,\n\t\t   0,CUDD_UNIQUE_SLOTS,CUDD_CACHE_SLOTS,0)\n      {\n\t\/\/\/ \\todo: The existence of shiftLeft needs that the manager is initialized\n\t\/\/\/ with the number of variables. Fix that method in order to permute only existent vars\n      }\n      \/\/\/ Creates an instace of this object\n      static void create() {\n\t_instance.reset( new BddManager, &deleter );\n      }\n      \/\/\/ Destructor that releases the BDD manager of CUDD\n      ~BddManager (void) {\n\tstd::cout << \"Destroyed BDD manager: \" << references() << std::endl;\n\t\/\/std::cout << \"Manager stats\" << std::endl;\n\tstats(std::cout);\n      }\n      \/\/@}\n      \/\/\/ Method called by the managed pointer when destructed\n      static void deleter(BddManager *ptr) {\n\tdelete ptr;\n      }\n      int references(void) {\n\treturn Cudd_CheckZeroRef(factory_.getManager());\n      }\n    public:\n      \/\/\/ Returns an instance of the manager\n      static PManager instance(void) {\n\tif (_instance.get() != NULL)\n\t  return _instance;\n\tcreate();\n\treturn _instance;\n      }\n      \/\/\/ \\name Access\n      \/\/@{\n      \/\/\/ Returns the factory\n      Cudd* getFactory(void) {\n\treturn &factory_;\n      }\n      \/\/\/ Returns the bdd manager\n      DdManager* manager(void) {\n\treturn factory_.getManager();\n      }\n      \/\/\/ Returns the constant \\c true\n      BDD one(void) {\n\treturn factory_.bddOne();\n      }\n      \/\/\/ Returns the constant \\c false\n      BDD zero(void) {\n\treturn factory_.bddZero();\n      }\n      \/\/\/ Prints manager statistics to \\a os\n      void stats(std::ostream& os) const {\n\t\n\tauto usedMemory = Cudd_ReadMemoryInUse(factory_.getManager());\n\t\/\/    os << \"\\tMemory in use: \" <<  (usedMemory \/ 1024)  << \" KB\" << std::endl;\n\tauto gcTime = Cudd_ReadGarbageCollectionTime(factory_.getManager());\n\t\/\/os << \"\\tGC time: \" <<  gcTime  << \" ms.\" << std::endl;\n\tauto gcs =  Cudd_ReadGarbageCollections(factory_.getManager());\n\t\/\/os << \"\\tGC triggered \" << gcs << \" times\" << std::endl;\n\n\t{\n          \n\t  os  << \"|\" << std::setfill('-') << std::setw(14) << \"+\" \n              << std::setw(14) << \"-+\" << std::setw(14) << \"-|\" << std::endl;\t\n\t  os  << std::setfill(' ')\n              << setiosflags(std::ios::left)\n              << \"|\" << std::setw(13) << \"Memory (MB)\" \n              << std::setw(14) << \"|GC (s.)\"\n              << std::setw(14) << \"|GC steps\" << \"|\" \n              << std::endl;\n            \n          os << setiosflags(std::ios::right) << \"|\" << std::setfill('-') << std::setw(14) << \"-+\" \n\t\t    << std::setw(14) << \"-+\" << std::setw(14) << \"-|\" << std::endl;\n          \n          os << std::setfill(' ') <<  setiosflags(std::ios::right)  << \"|\" \n             << std::setw(13) << (usedMemory \/ 1048576.0)  << \"|\" \n             << std::setw(13) << (gcTime \/ 1000.0) << \"|\"\n             << std::setw(13) << gcs << \"|\" \n             << std::endl;\n\t  \n          os << \"|\" << std::setfill('-') << std::setw(14) << \"+\" \n             << std::setw(14) << \"-+\" << std::setw(14) << \"-|\" << std::endl;\t\n\t}\n      }\n      \/\/@}\n    };\n\n    \/**\n     * \\brief Returns the factory used for all the bdds\n     * \\ingroup DomRepr\n     *\/\n    inline \n    Cudd* factoryPtr(void) {\n      return BddManager::instance()->getFactory();\n    }\n    inline\n    Cudd& factory(void) {\n      return *factoryPtr();\n    }\n    \/**\n     * \\brief Returns the manager\n     * \\ingroup DomRepr\n     *\/\n    inline\n    DdManager* dd(void) {\n      return BddManager::instance()->manager();\n    }\n    \/**\n     * \\brief Returns logical true\n     * \\ingroup DomRepr\n     *\/\n    inline\n    BDD one(void) {\n      return BddManager::instance()->one();\n    }\n    \/**\n     * \\brief Returns logical false\n     * \\ingroup DomRepr\n     *\/\n    inline\n    BDD zero(void) {\n      return BddManager::instance()->zero();\n    }\n    \/**\n     * \\brief Oututs manager statistics to \\a os\n     * \\ingroup DomRepr\n     *\/\n    inline\n    void stats(std::ostream& os) {\n      BddManager::instance()->stats(os);\n    }\n  }}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTextActor3D.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 \"vtkTextActor3D.h\"\n\n#include \"vtkObjectFactory.h\"\n#include \"vtkCamera.h\"\n#include \"vtkImageActor.h\"\n#include \"vtkImageData.h\"\n#include \"vtkTransform.h\"\n#include \"vtkTextProperty.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkWindow.h\"\n#include \"vtkFreeTypeUtilities.h\"\n#include \"vtkMatrix4x4.h\"\n#include \"vtkMath.h\"\n\nvtkCxxRevisionMacro(vtkTextActor3D, \"1.2\");\nvtkStandardNewMacro(vtkTextActor3D);\n\nvtkCxxSetObjectMacro(vtkTextActor3D, TextProperty, vtkTextProperty);\n\n\/\/ ----------------------------------------------------------------------------\nvtkTextActor3D::vtkTextActor3D()\n{\n  this->Input        = NULL;\n  this->ImageActor   = NULL;\n  this->ImageData    = NULL;\n  this->TextProperty = NULL;\n\n  this->BuildTime.Modified();\n\n  this->SetTextProperty(vtkTextProperty::New());\n  this->TextProperty->Delete();\n}\n\n\/\/ --------------------------------------------------------------------------\nvtkTextActor3D::~vtkTextActor3D()\n{\n  this->SetTextProperty(NULL);\n  this->SetInput(NULL);\n\n  if (this->ImageActor)\n    {\n    this->ImageActor->Delete();\n    this->ImageActor = NULL;\n    }\n\n  if (this->ImageData)\n    {\n    this->ImageData->Delete();\n    this->ImageData = NULL;\n    }\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid vtkTextActor3D::ShallowCopy(vtkProp *prop)\n{\n  vtkTextActor3D *a = vtkTextActor3D::SafeDownCast(prop);\n  if (a != NULL)\n    {\n    this->SetInput(a->GetInput());\n    this->SetTextProperty(a->GetTextProperty());\n    }\n\n  this->Superclass::ShallowCopy(prop);\n}\n\n\/\/ --------------------------------------------------------------------------\n\ndouble* vtkTextActor3D::GetBounds()\n{\n  if (this->ImageActor)\n    {\n    return this->ImageActor->GetBounds();\n    }\n\n  return NULL;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid vtkTextActor3D::ReleaseGraphicsResources(vtkWindow *win)\n{\n  if (this->ImageActor)\n    {\n    this->ImageActor->ReleaseGraphicsResources(win); \n    }\n\n  this->Superclass::ReleaseGraphicsResources(win);\n}\n\n\/\/ --------------------------------------------------------------------------\nint vtkTextActor3D::RenderOverlay(vtkViewport *viewport)\n{\n  int rendered_something = 0;\n\n  if (this->UpdateImageActor() && this->ImageActor)\n    {\n    rendered_something += this->ImageActor->RenderOverlay(viewport);\n    }\n\n  return rendered_something;\n}\n\n\/\/ --------------------------------------------------------------------------\nint vtkTextActor3D::RenderTranslucentGeometry(vtkViewport *viewport)\n{\n  int rendered_something = 0;\n\n  if (this->UpdateImageActor() && this->ImageActor)\n    {\n    rendered_something += \n      this->ImageActor->RenderTranslucentGeometry(viewport);\n    }\n\n  return rendered_something;\n}\n\n\/\/ --------------------------------------------------------------------------\nint vtkTextActor3D::RenderOpaqueGeometry(vtkViewport *viewport)\n{\n  int rendered_something = 0;\n\n  if (this->UpdateImageActor() && this->ImageActor)\n    {\n    rendered_something += \n      this->ImageActor->RenderOpaqueGeometry(viewport);\n    }\n\n  return rendered_something;\n}\n\n\/\/ --------------------------------------------------------------------------\nint vtkTextActor3D::UpdateImageActor()\n{\n  \/\/ Need text prop\n\n  if (!this->TextProperty)\n    {\n    vtkErrorMacro(<<\"Need a text property to render text actor\");\n    return 0;\n    }\n\n  \/\/ No input, don't render\n\n  if (!this->Input)\n    {\n    return 0;\n    }\n\n  \/\/ Do we need to (re-)render the text ?\n  \/\/ Yes if:\n  \/\/  - instance has been modified since last build\n  \/\/  - text prop has been modified since last build\n  \/\/  - ImageData ivar has not been allocated yet\n\n  if (this->GetMTime() > this->BuildTime ||\n      this->TextProperty->GetMTime() > this->BuildTime ||\n      !this->ImageData)\n    {\n    \/\/cout << \"Need to re-render \" << this->GetMTime() << \", \" <<  this->TextProperty->GetMTime() << \", \" << this->BuildTime << endl;\n\n    this->BuildTime.Modified();\n\n    \/\/ Get the bounding box of the text to render\n\n    vtkFreeTypeUtilities *fu = vtkFreeTypeUtilities::GetInstance();\n    if (!fu)\n      {\n      vtkErrorMacro(<<\"Failed getting the FreeType utilities instance\");\n      return 0;\n      }\n\n    int text_bbox[4];\n    fu->GetBoundingBox(this->TextProperty, this->Input, text_bbox);\n    if (!fu->IsBoundingBoxValid(text_bbox))\n      {\n      return 0;\n      }\n\n    \/\/ The bounding box was the area that is going to be filled with pixels\n    \/\/ given a text origin of (0, 0). Now get the real size we need, i.e.\n    \/\/ the full extent from the origin to the bounding box.\n\n    int text_size[2];\n    text_size[0] = (text_bbox[1] - text_bbox[0] + 1) + abs(text_bbox[0]);\n    text_size[1] = (text_bbox[3] - text_bbox[2] + 1) + abs(text_bbox[2]);\n\n    \/\/ If the RGBA image data is too small, resize it to the next power of 2\n    \/\/ WARNING: at this point, since this image is going to be a texture\n    \/\/ we should limit its size or query the hardware\n\n    if (!this->ImageData)\n      {\n      this->ImageData = vtkImageData::New();\n      this->ImageData->SetScalarTypeToUnsignedChar();\n      this->ImageData->SetNumberOfScalarComponents(4);\n      this->ImageData->SetSpacing(1.0, 1.0, 1.0);\n      }\n\n    \/\/ If the current image data is too small to render the text,\n    \/\/ or more than twice as big (too hungry), then resize\n\n    int img_dims[3], new_img_dims[3];\n    this->ImageData->GetDimensions(img_dims);\n\n    if (img_dims[0] < text_size[0] || img_dims[1] < text_size[1] ||\n        text_size[0] * 2 < img_dims[0] || text_size[1] * 2 < img_dims[0])\n      {\n      new_img_dims[0] = 1 << (int)ceil(log((double)text_size[0]) \/ log(2.0));\n      new_img_dims[1] = 1 << (int)ceil(log((double)text_size[1]) \/ log(2.0));\n      new_img_dims[2] = 1;\n      if (new_img_dims[0] != img_dims[0] || \n          new_img_dims[1] != img_dims[1] ||\n          new_img_dims[2] != img_dims[2])\n        {\n        \/\/cout << \"I need: \" << text_size[0] << \"x\" << text_size[1] << \", I resize to: \" << new_img_dims[0] << \"x\" << new_img_dims[1] << endl;\n        this->ImageData->SetDimensions(new_img_dims);\n        this->ImageData->AllocateScalars();\n        this->ImageData->UpdateInformation();\n        this->ImageData->SetUpdateExtent(this->ImageData->GetWholeExtent());\n        this->ImageData->PropagateUpdateExtent();\n        if (this->ImageActor)\n          {\n          this->ImageActor->SetDisplayExtent(\n            this->ImageData->GetWholeExtent());\n          }\n        }\n      }\n\n    \/\/ Render inside the image data\n    \n    int x = (text_bbox[0] < 0 ? -text_bbox[0] : 0);\n    int y = (text_bbox[2] < 0 ? -text_bbox[2] : 0);\n\n#if 0\n    char *ptr = (char*)this->ImageData->GetScalarPointer();\n    int nb_comp = this->ImageData->GetNumberOfScalarComponents();\n    char *ptr_end = ptr + this->ImageData->GetNumberOfPoints() * nb_comp;\n    memset(ptr, 0, ptr_end - ptr);\n    ptr += nb_comp - 1;\n    while (ptr < ptr_end)\n      {\n      *ptr = 255.0;\n      ptr += nb_comp;\n      }\n#else\n    memset(this->ImageData->GetScalarPointer(), \n           0, \n           (this->ImageData->GetNumberOfPoints() *\n            this->ImageData->GetNumberOfScalarComponents()));\n#endif\n\n    if (!fu->RenderString(\n          this->TextProperty, this->Input, x, y, this->ImageData))\n      {\n      vtkErrorMacro(<<\"Failed rendering text to buffer\");\n      return 0;\n      }\n\n    \/\/ Set the image data origin so that oriented text is placed properly\n    \/\/ Also take shadow into account, we want the text to be on the baseline\n\n    if (this->TextProperty->GetShadow())\n      {\n      \/\/ this is wrong\n      \/\/x += this->TextProperty->GetShadowOffset()[0];\n      \/\/y += this->TextProperty->GetShadowOffset()[1];\n      }\n    this->ImageData->SetOrigin(-x, -y, 0);\n    }\n\n  \/\/ Associate the image data (should be up to date now) to the image actor\n\n  if (!this->ImageActor)\n    {\n    this->ImageActor = vtkImageActor::New();\n    this->ImageActor->InterpolateOn();\n    }\n\n  this->ImageActor->SetInput(this->ImageData);\n\n  \/\/ Position the actor\n  \/\/ Which one is faster ?\n\n#if 1\n  vtkMatrix4x4 *matrix = vtkMatrix4x4::New();\n  this->GetMatrix(matrix);\n  this->ImageActor->SetUserMatrix(matrix);\n  matrix->Delete();\n#else\n  this->ImageActor->SetPosition(this->GetPosition());\n  this->ImageActor->SetScale(this->GetScale());\n  this->ImageActor->SetOrientation(this->GetOrientation());\n#endif\n\n  return 1;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid vtkTextActor3D::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  os << indent << \"Input: \" << (this->Input ? this->Input : \"(none)\") << \"\\n\";\n\n  if (this->TextProperty)\n    {\n    os << indent << \"Text Property:\\n\";\n    this->TextProperty->PrintSelf(os, indent.GetNextIndent());\n    }\n  else\n    {\n    os << indent << \"Text Property: (none)\\n\";\n    }\n}\n<commit_msg>and now fix TestSetGet<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTextActor3D.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 \"vtkTextActor3D.h\"\n\n#include \"vtkObjectFactory.h\"\n#include \"vtkCamera.h\"\n#include \"vtkImageActor.h\"\n#include \"vtkImageData.h\"\n#include \"vtkTransform.h\"\n#include \"vtkTextProperty.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkWindow.h\"\n#include \"vtkFreeTypeUtilities.h\"\n#include \"vtkMatrix4x4.h\"\n#include \"vtkMath.h\"\n\nvtkCxxRevisionMacro(vtkTextActor3D, \"1.3\");\nvtkStandardNewMacro(vtkTextActor3D);\n\nvtkCxxSetObjectMacro(vtkTextActor3D, TextProperty, vtkTextProperty);\n\n\/\/ ----------------------------------------------------------------------------\nvtkTextActor3D::vtkTextActor3D()\n{\n  this->Input        = NULL;\n  this->ImageActor   = NULL;\n  this->ImageData    = NULL;\n  this->TextProperty = NULL;\n\n  this->BuildTime.Modified();\n\n  this->SetTextProperty(vtkTextProperty::New());\n  this->TextProperty->Delete();\n}\n\n\/\/ --------------------------------------------------------------------------\nvtkTextActor3D::~vtkTextActor3D()\n{\n  this->SetTextProperty(NULL);\n  this->SetInput(NULL);\n\n  if (this->ImageActor)\n    {\n    this->ImageActor->Delete();\n    this->ImageActor = NULL;\n    }\n\n  if (this->ImageData)\n    {\n    this->ImageData->Delete();\n    this->ImageData = NULL;\n    }\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid vtkTextActor3D::ShallowCopy(vtkProp *prop)\n{\n  vtkTextActor3D *a = vtkTextActor3D::SafeDownCast(prop);\n  if (a != NULL)\n    {\n    this->SetInput(a->GetInput());\n    this->SetTextProperty(a->GetTextProperty());\n    }\n\n  this->Superclass::ShallowCopy(prop);\n}\n\n\/\/ --------------------------------------------------------------------------\n\ndouble* vtkTextActor3D::GetBounds()\n{\n  if (this->ImageActor)\n    {\n    return this->ImageActor->GetBounds();\n    }\n\n  static double unknown_bounds[6];\n  vtkMath::UninitializeBounds(unknown_bounds);\n  return unknown_bounds;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid vtkTextActor3D::ReleaseGraphicsResources(vtkWindow *win)\n{\n  if (this->ImageActor)\n    {\n    this->ImageActor->ReleaseGraphicsResources(win); \n    }\n\n  this->Superclass::ReleaseGraphicsResources(win);\n}\n\n\/\/ --------------------------------------------------------------------------\nint vtkTextActor3D::RenderOverlay(vtkViewport *viewport)\n{\n  int rendered_something = 0;\n\n  if (this->UpdateImageActor() && this->ImageActor)\n    {\n    rendered_something += this->ImageActor->RenderOverlay(viewport);\n    }\n\n  return rendered_something;\n}\n\n\/\/ --------------------------------------------------------------------------\nint vtkTextActor3D::RenderTranslucentGeometry(vtkViewport *viewport)\n{\n  int rendered_something = 0;\n\n  if (this->UpdateImageActor() && this->ImageActor)\n    {\n    rendered_something += \n      this->ImageActor->RenderTranslucentGeometry(viewport);\n    }\n\n  return rendered_something;\n}\n\n\/\/ --------------------------------------------------------------------------\nint vtkTextActor3D::RenderOpaqueGeometry(vtkViewport *viewport)\n{\n  int rendered_something = 0;\n\n  if (this->UpdateImageActor() && this->ImageActor)\n    {\n    rendered_something += \n      this->ImageActor->RenderOpaqueGeometry(viewport);\n    }\n\n  return rendered_something;\n}\n\n\/\/ --------------------------------------------------------------------------\nint vtkTextActor3D::UpdateImageActor()\n{\n  \/\/ Need text prop\n\n  if (!this->TextProperty)\n    {\n    vtkErrorMacro(<<\"Need a text property to render text actor\");\n    return 0;\n    }\n\n  \/\/ No input, don't render\n\n  if (!this->Input)\n    {\n    return 0;\n    }\n\n  \/\/ Do we need to (re-)render the text ?\n  \/\/ Yes if:\n  \/\/  - instance has been modified since last build\n  \/\/  - text prop has been modified since last build\n  \/\/  - ImageData ivar has not been allocated yet\n\n  if (this->GetMTime() > this->BuildTime ||\n      this->TextProperty->GetMTime() > this->BuildTime ||\n      !this->ImageData)\n    {\n    \/\/cout << \"Need to re-render \" << this->GetMTime() << \", \" <<  this->TextProperty->GetMTime() << \", \" << this->BuildTime << endl;\n\n    this->BuildTime.Modified();\n\n    \/\/ Get the bounding box of the text to render\n\n    vtkFreeTypeUtilities *fu = vtkFreeTypeUtilities::GetInstance();\n    if (!fu)\n      {\n      vtkErrorMacro(<<\"Failed getting the FreeType utilities instance\");\n      return 0;\n      }\n\n    int text_bbox[4];\n    fu->GetBoundingBox(this->TextProperty, this->Input, text_bbox);\n    if (!fu->IsBoundingBoxValid(text_bbox))\n      {\n      return 0;\n      }\n\n    \/\/ The bounding box was the area that is going to be filled with pixels\n    \/\/ given a text origin of (0, 0). Now get the real size we need, i.e.\n    \/\/ the full extent from the origin to the bounding box.\n\n    int text_size[2];\n    text_size[0] = (text_bbox[1] - text_bbox[0] + 1) + abs(text_bbox[0]);\n    text_size[1] = (text_bbox[3] - text_bbox[2] + 1) + abs(text_bbox[2]);\n\n    \/\/ If the RGBA image data is too small, resize it to the next power of 2\n    \/\/ WARNING: at this point, since this image is going to be a texture\n    \/\/ we should limit its size or query the hardware\n\n    if (!this->ImageData)\n      {\n      this->ImageData = vtkImageData::New();\n      this->ImageData->SetScalarTypeToUnsignedChar();\n      this->ImageData->SetNumberOfScalarComponents(4);\n      this->ImageData->SetSpacing(1.0, 1.0, 1.0);\n      }\n\n    \/\/ If the current image data is too small to render the text,\n    \/\/ or more than twice as big (too hungry), then resize\n\n    int img_dims[3], new_img_dims[3];\n    this->ImageData->GetDimensions(img_dims);\n\n    if (img_dims[0] < text_size[0] || img_dims[1] < text_size[1] ||\n        text_size[0] * 2 < img_dims[0] || text_size[1] * 2 < img_dims[0])\n      {\n      new_img_dims[0] = 1 << (int)ceil(log((double)text_size[0]) \/ log(2.0));\n      new_img_dims[1] = 1 << (int)ceil(log((double)text_size[1]) \/ log(2.0));\n      new_img_dims[2] = 1;\n      if (new_img_dims[0] != img_dims[0] || \n          new_img_dims[1] != img_dims[1] ||\n          new_img_dims[2] != img_dims[2])\n        {\n        \/\/cout << \"I need: \" << text_size[0] << \"x\" << text_size[1] << \", I resize to: \" << new_img_dims[0] << \"x\" << new_img_dims[1] << endl;\n        this->ImageData->SetDimensions(new_img_dims);\n        this->ImageData->AllocateScalars();\n        this->ImageData->UpdateInformation();\n        this->ImageData->SetUpdateExtent(this->ImageData->GetWholeExtent());\n        this->ImageData->PropagateUpdateExtent();\n        if (this->ImageActor)\n          {\n          this->ImageActor->SetDisplayExtent(\n            this->ImageData->GetWholeExtent());\n          }\n        }\n      }\n\n    \/\/ Render inside the image data\n    \n    int x = (text_bbox[0] < 0 ? -text_bbox[0] : 0);\n    int y = (text_bbox[2] < 0 ? -text_bbox[2] : 0);\n\n#if 0\n    char *ptr = (char*)this->ImageData->GetScalarPointer();\n    int nb_comp = this->ImageData->GetNumberOfScalarComponents();\n    char *ptr_end = ptr + this->ImageData->GetNumberOfPoints() * nb_comp;\n    memset(ptr, 0, ptr_end - ptr);\n    ptr += nb_comp - 1;\n    while (ptr < ptr_end)\n      {\n      *ptr = 255.0;\n      ptr += nb_comp;\n      }\n#else\n    memset(this->ImageData->GetScalarPointer(), \n           0, \n           (this->ImageData->GetNumberOfPoints() *\n            this->ImageData->GetNumberOfScalarComponents()));\n#endif\n\n    if (!fu->RenderString(\n          this->TextProperty, this->Input, x, y, this->ImageData))\n      {\n      vtkErrorMacro(<<\"Failed rendering text to buffer\");\n      return 0;\n      }\n\n    \/\/ Set the image data origin so that oriented text is placed properly\n    \/\/ Also take shadow into account, we want the text to be on the baseline\n\n    if (this->TextProperty->GetShadow())\n      {\n      \/\/ this is wrong\n      \/\/x += this->TextProperty->GetShadowOffset()[0];\n      \/\/y += this->TextProperty->GetShadowOffset()[1];\n      }\n    this->ImageData->SetOrigin(-x, -y, 0);\n    }\n\n  \/\/ Associate the image data (should be up to date now) to the image actor\n\n  if (!this->ImageActor)\n    {\n    this->ImageActor = vtkImageActor::New();\n    this->ImageActor->InterpolateOn();\n    }\n\n  this->ImageActor->SetInput(this->ImageData);\n\n  \/\/ Position the actor\n  \/\/ Which one is faster ?\n\n#if 1\n  vtkMatrix4x4 *matrix = vtkMatrix4x4::New();\n  this->GetMatrix(matrix);\n  this->ImageActor->SetUserMatrix(matrix);\n  matrix->Delete();\n#else\n  this->ImageActor->SetPosition(this->GetPosition());\n  this->ImageActor->SetScale(this->GetScale());\n  this->ImageActor->SetOrientation(this->GetOrientation());\n#endif\n\n  return 1;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid vtkTextActor3D::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  os << indent << \"Input: \" << (this->Input ? this->Input : \"(none)\") << \"\\n\";\n\n  if (this->TextProperty)\n    {\n    os << indent << \"Text Property:\\n\";\n    this->TextProperty->PrintSelf(os, indent.GetNextIndent());\n    }\n  else\n    {\n    os << indent << \"Text Property: (none)\\n\";\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Accumulate.h\"\n#include \"..\/Data.h\"\n\nVariableAccumulate::VariableAccumulate(const Options& iOptions, const Data& iData) : Variable(iOptions, iData),\n      mTimeWindow(Global::MV) {\n   \/\/ Which base variable should be accumulated?\n   iOptions.getRequiredValue(\"baseVariable\", mBaseVariable);\n   \/\/! Over how many hours should the variable be accumulated?\n   \/\/! Defaults to the beginning of the forecast period\n   iOptions.getValue(\"timeWindow\", mTimeWindow);\n\n   loadOptionsFromBaseVariable();\n   iOptions.check();\n}\n\nfloat VariableAccumulate::computeCore(int iDate,\n                    int iInit,\n                    float iOffset,\n                    const Location& iLocation,\n                    const Member& iMember,\n                    Input::Type iType) const {\n\n   float startOffset = 0;\n   if(Global::isValid(mTimeWindow)) {\n      if(iType == Input::typeObservation) {\n         \/\/ Allowed to be negative\n         startOffset = iOffset - mTimeWindow;\n      }\n      if(Global::isValid(mTimeWindow) && iOffset > mTimeWindow) {\n         startOffset = iOffset - mTimeWindow;\n      }\n   }\n\n   std::string dataset = iMember.getDataset();\n   std::vector<float> offsets = mData.getInput(dataset)->getOffsets();\n   float total = 0;\n   for(int i = 0; i < offsets.size(); i++) {\n      float offset = offsets[i];\n      if(offset > startOffset && offset <= iOffset) {\n         float value = mData.getValue(iDate, iInit, offset, iLocation, iMember, mBaseVariable);\n         if(Global::isValid(value))\n            total += value;\n         else\n            return Global::MV;\n      }\n   }\n\n   return total;\n}\n\nstd::string VariableAccumulate::getBaseVariable() const {\n   \/\/ TODO:\n   std::stringstream ss;\n   if(Global::isValid(mTimeWindow))\n      ss << mBaseVariable << \"_\" << (int) mTimeWindow;\n   else\n      ss << mBaseVariable << \"_Acc\";\n   return ss.str();\n}\n<commit_msg>Bug fix in VariableAccumulate for observations<commit_after>#include \"Accumulate.h\"\n#include \"..\/Data.h\"\n\nVariableAccumulate::VariableAccumulate(const Options& iOptions, const Data& iData) : Variable(iOptions, iData),\n      mTimeWindow(Global::MV) {\n   \/\/ Which base variable should be accumulated?\n   iOptions.getRequiredValue(\"baseVariable\", mBaseVariable);\n   \/\/! Over how many hours should the variable be accumulated?\n   \/\/! Defaults to the beginning of the forecast period\n   iOptions.getValue(\"timeWindow\", mTimeWindow);\n\n   loadOptionsFromBaseVariable();\n   iOptions.check();\n}\n\nfloat VariableAccumulate::computeCore(int iDate,\n                    int iInit,\n                    float iOffset,\n                    const Location& iLocation,\n                    const Member& iMember,\n                    Input::Type iType) const {\n\n   float total = 0;\n   \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n   \/\/ Accumulating observations \/\/\n   \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n   \/\/ When accumulating observations, we are allowed to look at yesterday's values.\n   \/\/ This can happen for low offsets, where the accumulation window crosses into yesterday\n   if(iType == Input::typeObservation) {\n      float startOffset = iOffset - mTimeWindow; \/\/ Allowed to be negative\n      std::string dataset = iMember.getDataset();\n      std::vector<float> offsets = mData.getInput(dataset)->getOffsets();\n      for(int i = 0; i < offsets.size(); i++) {\n         float offset = offsets[i];\n         if(offset < 24) { \/\/ Observations should never have offsets above 24, but just in case\n            \/\/ Use a value from today\n            if(offset > startOffset && offset <= iOffset) {\n               float value = mData.getValue(iDate, iInit, offset, iLocation, iMember, mBaseVariable);\n               if(Global::isValid(value))\n                  total += value;\n               else\n                  return Global::MV;\n            }\n            \/\/ Use a value from yesterday\n            else if(offset > startOffset+24 && offset <= iOffset + 24) {\n               int date = Global::getDate(iDate, -24); \/\/ yesterday\n               float value = mData.getValue(date, iInit, offset, iLocation, iMember, mBaseVariable);\n               if(Global::isValid(value))\n                  total += value;\n               else\n                  return Global::MV;\n            }\n         }\n      }\n   }\n   \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n   \/\/ Accumulating forecasts \/\/\n   \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n   \/\/ Only accumulate values for forecasts valid at this initialization date\/time\n   else {\n      if(Global::isValid(mTimeWindow) && iOffset > mTimeWindow) {\n         \/\/ Do a regular sum between start and end offsets\n         float startOffset = iOffset - mTimeWindow;\n         std::string dataset = iMember.getDataset();\n         std::vector<float> offsets = mData.getInput(dataset)->getOffsets();\n         for(int i = 0; i < offsets.size(); i++) {\n            float offset = offsets[i];\n            if(offset > startOffset && offset <= iOffset) {\n               float value = mData.getValue(iDate, iInit, offset, iLocation, iMember, mBaseVariable);\n               if(Global::isValid(value))\n                  total += value;\n               else\n                  return Global::MV;\n            }\n         }\n      }\n      else {\n         return Global::MV;\n      }\n   }\n\n   return total;\n}\n\nstd::string VariableAccumulate::getBaseVariable() const {\n   \/\/ TODO:\n   std::stringstream ss;\n   if(Global::isValid(mTimeWindow))\n      ss << mBaseVariable << \"_\" << (int) mTimeWindow;\n   else\n      ss << mBaseVariable << \"_Acc\";\n   return ss.str();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *  @file       node.hpp\n *  @author     Alan.W\n *  @date       17  July 2014\n *  @remark     Implementation of CLRS algorithms, using C++ templates.\n ***************************************************************************\/\n#ifndef CUT_ROD_HPP\n#define CUT_ROD_HPP\n\n#include <algorithm>\n#include <iterator>\n#include <limits>\n\nnamespace ch15 {\n\ntemplate<typename Iter>\ntypename std::iterator_traits<Iter>::value_type\ncut_rod(Iter first, typename std::iterator_traits<Iter>::difference_type len);\n\n\/**\n * @brief cut_rod\n *          return the optimal solution without using dynamic programming\n * @param first\n * @param len\n *\n * @complx  O(2^n)\n * @page    363, CLRS\n *\/\ntemplate<typename Iter>\ninline typename std::iterator_traits<Iter>::value_type\ncut_rod(Iter first, typename std::iterator_traits<Iter>::difference_type len)\n{\n    using ValueType =   typename std::iterator_traits<Iter>::value_type;\n    using SizeType  =   typename std::iterator_traits<Iter>::difference_type;\n\n    \/\/! stop condition\n    if(len == 0)\n        return 0;\n\n    \/\/! initialize it as -infinity\n    ValueType ret = std::numeric_limits<ValueType>::min();\n\n    \/\/! iteration with recursion\n    for(SizeType count = 0 ; count != len ; ++count)\n        ret =   std::max(ret, *(first + count) + cut_rod(first, len - count - 1));\n\n    return ret;\n}\n\n}\n\n#endif \/\/ CUT_ROD_HPP\n<commit_msg>add an abstract class for the two algorithms  On branch ch15 \tmodified:   ch15\/cut_rod.hpp<commit_after>\/***************************************************************************\n *  @file       node.hpp\n *  @author     Alan.W\n *  @date       17  July 2014\n *  @remark     Implementation of CLRS algorithms, using C++ templates.\n ***************************************************************************\/\n#ifndef CUT_ROD_HPP\n#define CUT_ROD_HPP\n\n#include <algorithm>\n#include <iterator>\n#include <limits>\n\nnamespace ch15 {\n\ntemplate<typename Iter>\ntypename std::iterator_traits<Iter>::value_type\ncut_rod(Iter first, typename std::iterator_traits<Iter>::difference_type len);\n\ntemplate<typename Iter>\nclass RodCutter;\n\n\/**\n * @brief cut_rod\n *          return the optimal solution without using dynamic programming\n * @param first     the first iterator of p\n * @param len       n\n *\n * @complx  O(2^n)\n * @page    363, CLRS\n *\/\ntemplate<typename Iter>\ninline typename std::iterator_traits<Iter>::value_type\ncut_rod(Iter first, typename std::iterator_traits<Iter>::difference_type len)\n{\n    using ValueType =   typename std::iterator_traits<Iter>::value_type;\n    using SizeType  =   typename std::iterator_traits<Iter>::difference_type;\n\n    \/\/! stop condition\n    if(len == 0)\n        return 0;\n\n    \/\/! initialize it as -infinity\n    ValueType ret = std::numeric_limits<ValueType>::min();\n\n    \/\/! iteration with recursion\n    for(SizeType count = 0 ; count != len ; ++count)\n        ret = std::max(ret, *(first + count) + cut_rod(first,len - count - 1));\n\n    return ret;\n}\n\n\/**\n * @brief The RodCutter class\n *\n * abstract class\n *\/\ntemplate<typename Iter>\nclass RodCutter\n{\npublic:\n    using ValueType =   typename    std::iterator_traits<Iter>::value_type;\n    using SizeType  =   typename    std::iterator_traits<Iter>::difference_type;\n    using Container =               std::vector<ValueType>;\n\n    ValueType operator()(Iter first, SizeType len)\n    {\n        return dynamic_program(first, len);\n    }\n\n    ~RodCutter(){}\n\nprotected:\n    Container   vec;\n\n    virtual ValueType dynamic_program(Iter first, SizeType len) = 0;\n};\n\n\n}\/\/namespace\n#endif \/\/ CUT_ROD_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * ScriptCheck.cpp\n *\n *  Created on: Sep 2, 2014\n *      Author: ranger.shi\n *\/\n#include \"VmScriptRun.h\"\n#include \"tx.h\"\n#include \"util.h\"\n#include <boost\/foreach.hpp>\nCVmScriptRun::CVmScriptRun() {\n\tRawAccont.clear();\n\tNewAccont.clear();\n\theight = 0;\n}\nvector<shared_ptr<CAccount> > &CVmScriptRun::GetRawAccont() {\n\treturn RawAccont;\n}\nvector<shared_ptr<CAccount> > &CVmScriptRun::GetNewAccont() {\n\treturn NewAccont;\n}\n\nbool CVmScriptRun::intial(shared_ptr<CBaseTransaction> & Tx, CAccountViewCache& view, int nheight) {\n\n\tlistTx = Tx;\n\theight = nheight;\n\tvector<unsigned char> vScript;\n\n\tif (Tx.get()->nTxType != CONTRACT_TX) {\n\t\tLogPrint(\"vm\", \"%s\\r\\n\", \"err param\");\n\t\treturn false;\n\t}\n\n\tCContractTransaction* secure = static_cast<CContractTransaction*>(Tx.get());\n\tif (pScriptDBTip->GetScript(secure->scriptRegId, vScript)) {\n\t\tCDataStream stream(vScript, SER_DISK, CLIENT_VERSION);\n\t\ttry {\n\t\t\tstream >> vmScript;\n\t\t} catch (exception& e) {\n\t\t\tthrow runtime_error(\"CVmScriptRun::intial() Unserialize to vmScript error:\" + string(e.what()));\n\t\t}\n\t}\n\n\tif (vmScript.IsValid() == false)\n\t\treturn false;\n\n\tfor (auto& tx : secure->vAccountRegId) {\n\t\tauto tem = make_shared<CAccount>();\n\t\tview.GetAccount(tx, *tem.get());\n\t\tRawAccont.push_back(tem);\n\t}\n\n\tvector<unsigned char> strContract;\n\tpMcu = make_shared<CVir8051>(vmScript.Rom, strContract);\n\treturn true;\n}\n\nCVmScriptRun::~CVmScriptRun() {\n\n}\ntuple<bool, uint64_t, string> CVmScriptRun:: run(shared_ptr<CBaseTransaction>& Tx, CAccountViewCache& view, int nheight,\n\t\tuint64_t nBurnFactor) {\n\n\tCContractTransaction* tx = static_cast<CContractTransaction*>(Tx.get());\n\tint maxstep = tx->llFees\/nBurnFactor;\n\ttuple<bool, uint64_t, string> mytuple;\n\tif (!intial(Tx, view, nheight)) {\n\t\tmytuple = std::make_tuple (false, 0, string(\"VmScript inital Failed\\n\"));\n\t\treturn mytuple;\n\t}\n\tunsigned int  step = pMcu.get()->run(maxstep,this);\n\tif (0 == step) {\n\t\tmytuple = std::make_tuple (false, 0, string(\"VmScript run Failed\\n\"));\n\t\treturn mytuple;\n\t}\n\tshared_ptr<vector<unsigned char>> retData = pMcu.get()->GetRetData();\n\tCDataStream Contractstream(*retData.get(), SER_DISK, CLIENT_VERSION);\n\tvector<CVmOperate> retvmcode;\n\tContractstream >> retvmcode;\n\n\tif (!CheckOperate(retvmcode)) {\n\t\tmytuple = std::make_tuple (false, 0, string(\"VmScript CheckOperate Failed \\n\"));\n\t\treturn mytuple;\n\t}\n\tif (!OpeatorAccount(retvmcode, view)) {\n\t\tmytuple = std::make_tuple (false, 0, string(\"VmScript OpeatorSecureAccount Failed\\n\"));\n\t\treturn mytuple;\n\t}\n\tuint64_t spend = step*nBurnFactor;\n\tmytuple = std::make_tuple (true, spend, string(\"VmScript Sucess\\n\"));\n\treturn mytuple;\n}\n\nshared_ptr<CAccount> CVmScriptRun::GetNewAccount(shared_ptr<CAccount>& vOldAccount) {\n\tif (NewAccont.size() == 0)\n\t\treturn NULL;\n\tvector<shared_ptr<CAccount> >::iterator Iter;\n\tfor (Iter = NewAccont.begin(); Iter != NewAccont.end(); Iter++) {\n\t\tshared_ptr<CAccount> temp = *Iter;\n\t\tif (temp.get()->keyID == vOldAccount.get()->keyID) {\n\t\t\tNewAccont.erase(Iter);\n\t\t\treturn temp;\n\t\t}\n\t}\n\treturn NULL;\n}\nshared_ptr<CAccount> CVmScriptRun::GetAccount(shared_ptr<CAccount>& Account) {\n\tif (RawAccont.size() == 0)\n\t\treturn NULL;\n\tvector<shared_ptr<CAccount> >::iterator Iter;\n\tfor (Iter = RawAccont.begin(); Iter != RawAccont.end(); Iter++) {\n\t\tshared_ptr<CAccount> temp = *Iter;\n\t\tif (Account.get()->keyID == temp.get()->keyID) {\n\t\t\treturn temp;\n\t\t}\n\t}\n\treturn NULL;\n}\n\nbool CVmScriptRun::CheckOperate(const vector<CVmOperate> &listoperate) const {\n\t\/\/ judge contract rulue\n\tuint64_t addmoey, miusmoney;\n\tfor (auto& it : listoperate) {\n\n\t\tif (it.opeatortype == ADD_FREE || it.opeatortype == ADD_SELF_FREEZD || it.opeatortype == ADD_FREEZD) {\n\t\t\t\/\/addmoey += atoi64((char*) it.money);\n\t\t}\n\t\tif (it.opeatortype == MINUS_FREE || it.opeatortype == MINUS_SELF_FREEZD || it.opeatortype == MINUS_FREEZD) {\n\t\t\t\/\/miusmoney += atoi64((char*) it.money);\n\t\t}\n\t\tif (addmoey != miusmoney)\n\t\t\treturn false;\n\n\t}\n\treturn true;\n}\nvector_unsigned_char& CVmScriptRun::GetAccountID(CVmOperate value) {\n\tvector_unsigned_char accountid;\n\tif (value.type == ACCOUNTID) {\n\t\taccountid.assign(value.accountid, value.accountid + 6);\n\t} else if (value.type == KEYID) {\n\t\taccountid.assign(value.accountid, value.accountid + 20);\n\t} else {\n\t\treturn accountid;\n\t}\n}\nshared_ptr<vector<CVmOperate>> CVmScriptRun::GetOperate() const {\n\tauto tem = make_shared<vector<CVmOperate>>();\n\tshared_ptr<vector<unsigned char>> retData = pMcu.get()->GetRetData();\n\tCDataStream Contractstream(*retData.get(), SER_DISK, CLIENT_VERSION);\n\tvector<CVmOperate> retvmcode;\n\t;\n\tContractstream >> retvmcode;\n\treturn tem;\n}\n\nbool CVmScriptRun::OpeatorAccount(const vector<CVmOperate>& listoperate, CAccountViewCache& view) {\n\n\tNewAccont.clear();\n\tfor (auto& it : listoperate) {\n\t\tCFund fund;\n\t\tfund.value = atoi64((char*) it.money);\n\t\tfund.nHeight = it.outheight + height;\n\t\t\/\/fund.uTxHash = listTx.get()->GetHash();\n\n\t\tauto tem = make_shared<CAccount>();\n\t\tvector_unsigned_char accountid = GetAccountID(it);\n\t\tif (accountid.size() == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tview.GetAccount(accountid, *tem.get());\n\t\tshared_ptr<CAccount> vmAccount = GetAccount(tem);\n\t\tif (vmAccount.get() == NULL) {\n\t\t\tRawAccont.push_back(tem);\n\t\t}\n\t\tshared_ptr<CAccount> vnewAccount = GetNewAccount(tem);\n\t\tif (vnewAccount.get() != NULL) {\n\t\t\tvmAccount = vnewAccount;\n\t\t}\n\n\t\tif (fund.nFundType == FREEZD_FUND) {\n\t\t\tCFund vFind = vmAccount.get()->FindFund(vmAccount.get()->vFreeze, fund.scriptID);\n\t\t\tfund.nHeight = vFind.nHeight;\n\t\t}\n\n\t\tLogPrint(\"vm\", \"muls account:%s\\r\\n\", vmAccount.get()->ToString().c_str());\n\t\tLogPrint(\"vm\", \"fund:%s\\r\\n\", fund.ToString().c_str());\n\t\tif (it.opeatortype == ADD_FREE || it.opeatortype == ADD_SELF_FREEZD || it.opeatortype == ADD_FREEZD) {\n\t\t\tvmAccount.get()->AddMoney((OperType)it.opeatortype,fund);\n\t\t\t}\n\t\telse if (it.opeatortype == MINUS_FREE || it.opeatortype == MINUS_SELF_FREEZD || it.opeatortype == MINUS_FREEZD) {\n\t\t\tCContractTransaction* tx = static_cast<CContractTransaction*>(listTx.get());\n\t\t\tvmAccount.get()->MinusMoney((OperType)it.opeatortype,height,fund,tx->scriptRegId);\n\t\t\t}\n\t\telse\n\t\t{\n\t\t\tLogPrint(\"vm\", \"fund:vm operte error\\r\\n\");\n\t\t}\n\t\t\/\/ about operate account undo\n\t\tuint64_t retValue;\n\t\tbool flag = true;\/\/vmAccount.get()->OperateAccount((OperType) it.opeatortype, fund, &retValue);\n\t\tLogPrint(\"vm\", \"after muls account:%s\\r\\n\", vmAccount.get()->ToString().c_str());\n\t\tif (flag) {\n\t\t\treturn false;\n\t\t}\n\t\tNewAccont.push_back(vmAccount);\n\n\t}\n\treturn true;\n}\n\nvector_unsigned_char& CVmScriptRun::GetScriptID()\n{\n\tCContractTransaction* tx = static_cast<CContractTransaction*>(listTx.get());\n\treturn tx->scriptRegId;\n}\nint CVmScriptRun::GetComfirHeight()\n{\n\treturn height;\n}\nuint256 CVmScriptRun::GetCurTxHash()\n{\n\treturn listTx.get()->GetHash();\n}\n<commit_msg>function modify Signed-off-by: bess <776536184@qq.com><commit_after>\/*\n * ScriptCheck.cpp\n *\n *  Created on: Sep 2, 2014\n *      Author: ranger.shi\n *\/\n#include \"VmScriptRun.h\"\n#include \"tx.h\"\n#include \"util.h\"\n#include <boost\/foreach.hpp>\nCVmScriptRun::CVmScriptRun() {\n\tRawAccont.clear();\n\tNewAccont.clear();\n\theight = 0;\n}\nvector<shared_ptr<CAccount> > &CVmScriptRun::GetRawAccont() {\n\treturn RawAccont;\n}\nvector<shared_ptr<CAccount> > &CVmScriptRun::GetNewAccont() {\n\treturn NewAccont;\n}\n\nbool CVmScriptRun::intial(shared_ptr<CBaseTransaction> & Tx, CAccountViewCache& view, int nheight) {\n\n\tlistTx = Tx;\n\theight = nheight;\n\tvector<unsigned char> vScript;\n\n\tif (Tx.get()->nTxType != CONTRACT_TX) {\n\t\tLogPrint(\"vm\", \"%s\\r\\n\", \"err param\");\n\t\treturn false;\n\t}\n\n\tCContractTransaction* secure = static_cast<CContractTransaction*>(Tx.get());\n\tif (pScriptDBTip->GetScript(secure->scriptRegId, vScript)) {\n\t\tCDataStream stream(vScript, SER_DISK, CLIENT_VERSION);\n\t\ttry {\n\t\t\tstream >> vmScript;\n\t\t} catch (exception& e) {\n\t\t\tthrow runtime_error(\"CVmScriptRun::intial() Unserialize to vmScript error:\" + string(e.what()));\n\t\t}\n\t}\n\n\tif (vmScript.IsValid() == false)\n\t\treturn false;\n\n\tfor (auto& tx : secure->vAccountRegId) {\n\t\tauto tem = make_shared<CAccount>();\n\t\tview.GetAccount(tx, *tem.get());\n\t\tRawAccont.push_back(tem);\n\t}\n\n\tvector<unsigned char> strContract;\n\tpMcu = make_shared<CVir8051>(vmScript.Rom, strContract);\n\treturn true;\n}\n\nCVmScriptRun::~CVmScriptRun() {\n\n}\ntuple<bool, uint64_t, string> CVmScriptRun:: run(shared_ptr<CBaseTransaction>& Tx, CAccountViewCache& view, int nheight,\n\t\tuint64_t nBurnFactor) {\n\n\tCContractTransaction* tx = static_cast<CContractTransaction*>(Tx.get());\n\tint maxstep = tx->llFees\/nBurnFactor;\n\ttuple<bool, uint64_t, string> mytuple;\n\tif (!intial(Tx, view, nheight)) {\n\t\tmytuple = std::make_tuple (false, 0, string(\"VmScript inital Failed\\n\"));\n\t\treturn mytuple;\n\t}\n\tunsigned int  step = pMcu.get()->run(maxstep,this);\n\tif (0 == step) {\n\t\tmytuple = std::make_tuple (false, 0, string(\"VmScript run Failed\\n\"));\n\t\treturn mytuple;\n\t}\n\tshared_ptr<vector<unsigned char>> retData = pMcu.get()->GetRetData();\n\tCDataStream Contractstream(*retData.get(), SER_DISK, CLIENT_VERSION);\n\tvector<CVmOperate> retvmcode;\n\tContractstream >> retvmcode;\n\n\tif (!CheckOperate(retvmcode)) {\n\t\tmytuple = std::make_tuple (false, 0, string(\"VmScript CheckOperate Failed \\n\"));\n\t\treturn mytuple;\n\t}\n\tif (!OpeatorAccount(retvmcode, view)) {\n\t\tmytuple = std::make_tuple (false, 0, string(\"VmScript OpeatorSecureAccount Failed\\n\"));\n\t\treturn mytuple;\n\t}\n\tuint64_t spend = step*nBurnFactor;\n\tmytuple = std::make_tuple (true, spend, string(\"VmScript Sucess\\n\"));\n\treturn mytuple;\n}\n\nshared_ptr<CAccount> CVmScriptRun::GetNewAccount(shared_ptr<CAccount>& vOldAccount) {\n\tif (NewAccont.size() == 0)\n\t\treturn NULL;\n\tvector<shared_ptr<CAccount> >::iterator Iter;\n\tfor (Iter = NewAccont.begin(); Iter != NewAccont.end(); Iter++) {\n\t\tshared_ptr<CAccount> temp = *Iter;\n\t\tif (temp.get()->keyID == vOldAccount.get()->keyID) {\n\t\t\tNewAccont.erase(Iter);\n\t\t\treturn temp;\n\t\t}\n\t}\n\treturn NULL;\n}\nshared_ptr<CAccount> CVmScriptRun::GetAccount(shared_ptr<CAccount>& Account) {\n\tif (RawAccont.size() == 0)\n\t\treturn NULL;\n\tvector<shared_ptr<CAccount> >::iterator Iter;\n\tfor (Iter = RawAccont.begin(); Iter != RawAccont.end(); Iter++) {\n\t\tshared_ptr<CAccount> temp = *Iter;\n\t\tif (Account.get()->keyID == temp.get()->keyID) {\n\t\t\treturn temp;\n\t\t}\n\t}\n\treturn NULL;\n}\n\nbool CVmScriptRun::CheckOperate(const vector<CVmOperate> &listoperate) const {\n\t\/\/ judge contract rulue\n\tuint64_t addmoey, miusmoney;\n\tuint64_t temp = 0;\n\tfor (auto& it : listoperate) {\n\n\t\tif (it.opeatortype == ADD_FREE || it.opeatortype == ADD_SELF_FREEZD || it.opeatortype == ADD_FREEZD) {\n\t\t\tmemcpy(&temp,it.money,sizeof(it.money));\n\t\t\taddmoey += temp;\n\t\t}\n\t\tif (it.opeatortype == MINUS_FREE || it.opeatortype == MINUS_SELF_FREEZD || it.opeatortype == MINUS_FREEZD) {\n\t\t\tmemcpy(&temp,it.money,sizeof(it.money));\n\t\t\tmiusmoney += temp;\n\t\t}\n\t\tif (addmoey != miusmoney)\n\t\t\treturn false;\n\n\t}\n\treturn true;\n}\nvector_unsigned_char& CVmScriptRun::GetAccountID(CVmOperate value) {\n\tvector_unsigned_char accountid;\n\tif (value.type == ACCOUNTID) {\n\t\taccountid.assign(value.accountid, value.accountid + 6);\n\t} else if (value.type == KEYID) {\n\t\taccountid.assign(value.accountid, value.accountid + 20);\n\t} else {\n\t\treturn accountid;\n\t}\n}\nshared_ptr<vector<CVmOperate>> CVmScriptRun::GetOperate() const {\n\tauto tem = make_shared<vector<CVmOperate>>();\n\tshared_ptr<vector<unsigned char>> retData = pMcu.get()->GetRetData();\n\tCDataStream Contractstream(*retData.get(), SER_DISK, CLIENT_VERSION);\n\tvector<CVmOperate> retvmcode;\n\t;\n\tContractstream >> retvmcode;\n\treturn tem;\n}\n\nbool CVmScriptRun::OpeatorAccount(const vector<CVmOperate>& listoperate, CAccountViewCache& view) {\n\n\tNewAccont.clear();\n\tfor (auto& it : listoperate) {\n\t\tCContractTransaction* tx = static_cast<CContractTransaction*>(listTx.get());\n\t\tCFund fund;\n\t\tmemcpy(&fund.value,it.money,sizeof(it.money));\n\t\tfund.nHeight = it.outheight + height;\n\t\tfund.scriptID = tx->scriptRegId;\n\n\t\tauto tem = make_shared<CAccount>();\n\t\tvector_unsigned_char accountid = GetAccountID(it);\n\t\tif (accountid.size() == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tview.GetAccount(accountid, *tem.get());\n\t\tshared_ptr<CAccount> vmAccount = GetAccount(tem);\n\t\tif (vmAccount.get() == NULL) {\n\t\t\tRawAccont.push_back(tem);\n\t\t}\n\t\tshared_ptr<CAccount> vnewAccount = GetNewAccount(tem);\n\t\tif (vnewAccount.get() != NULL) {\n\t\t\tvmAccount = vnewAccount;\n\t\t}\n\n\t\tif (fund.nFundType == FREEZD_FUND) {\n\t\t\tCFund vFind = vmAccount.get()->FindFund(vmAccount.get()->vFreeze, fund.scriptID);\n\t\t\tfund.nHeight = vFind.nHeight;\n\t\t}\n\n\t\tLogPrint(\"vm\", \"muls account:%s\\r\\n\", vmAccount.get()->ToString().c_str());\n\t\tLogPrint(\"vm\", \"fund:%s\\r\\n\", fund.ToString().c_str());\n\t\tbool ret = vmAccount.get()->OperateAccount((OperType)it.opeatortype,fund,height);\n\n\t\tLogPrint(\"vm\", \"after muls account:%s\\r\\n\", vmAccount.get()->ToString().c_str());\n\t\tif (ret) {\n\t\t\treturn false;\n\t\t}\n\t\tNewAccont.push_back(vmAccount);\n\n\t}\n\treturn true;\n}\n\nvector_unsigned_char& CVmScriptRun::GetScriptID()\n{\n\tCContractTransaction* tx = static_cast<CContractTransaction*>(listTx.get());\n\treturn tx->scriptRegId;\n}\nint CVmScriptRun::GetComfirHeight()\n{\n\treturn height;\n}\nuint256 CVmScriptRun::GetCurTxHash()\n{\n\treturn listTx.get()->GetHash();\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix broken separator sizing and positioning.<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"acmacs-base\/float.hh\"\n#include \"acmacs-base\/xlnt.hh\"\n#include \"acmacs-whocc\/sheet.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs::xlsx::inline v1\n{\n    namespace xlnt\n    {\n        class Doc;\n\n        class Sheet : public acmacs::sheet::Sheet\n        {\n          public:\n            Sheet(::xlnt::worksheet&& src) : sheet_{std::move(src)} {}\n\n            std::string name() const override { return sheet_.title(); }\n            size_t number_of_rows() const override { return sheet_.highest_row(); }\n            size_t number_of_columns() const override { return sheet_.highest_column().index; }\n\n            static inline date::year_month_day make_date(const ::xlnt::datetime& dt, size_t \/*row*\/, size_t \/*col*\/)\n            {\n                \/\/ if (dt.hour || dt.minute || dt.second || dt.microsecond)\n                \/\/     AD_WARNING(\"xlnt datetime at {:c}{} contains time: {}\", col + 'A', row + 1, dt.to_string());\n                return date::year{dt.year} \/ date::month{static_cast<unsigned>(dt.month)} \/ dt.day;\n            }\n\n            acmacs::sheet::cell_t cell(size_t row, size_t col) const override \/\/ row and col are zero based\n            {\n                const ::xlnt::cell_reference ref{static_cast<::xlnt::column_t::index_t>(col + 1), static_cast<::xlnt::row_t>(row + 1)};\n                if (!sheet_.has_cell(ref))\n                    return acmacs::sheet::cell::empty{};\n\n                const auto cell = sheet_.cell(ref);\n                switch (cell.data_type()) { \/\/ ~\/AD\/build\/acmacs-build\/build\/xlnt\/include\/xlnt\/cell\/cell_type.hpp\n                    case ::xlnt::cell_type::empty:\n                        return acmacs::sheet::cell::empty{};\n                    case ::xlnt::cell_type::boolean:\n                        return cell.value<bool>();\n                    case ::xlnt::cell_type::inline_string:\n                    case ::xlnt::cell_type::shared_string:\n                    case ::xlnt::cell_type::formula_string:\n                        if (const auto val = cell.value<std::string>(); !val.empty())\n                            return val;\n                        else\n                            return acmacs::sheet::cell::empty{};\n                    case ::xlnt::cell_type::number:\n                        if (cell.is_date())\n                            return make_date(cell.value<::xlnt::datetime>(), row, col);\n                        else if (const auto vald = cell.value<double>(); !float_equal(vald, std::round(vald)))\n                            return vald;\n                        else\n                            return static_cast<long>(cell.value<long long>());\n                    case ::xlnt::cell_type::date:\n                        return make_date(cell.value<::xlnt::datetime>(), row, col);\n                    case ::xlnt::cell_type::error:\n                        return acmacs::sheet::cell::error{};\n                }\n                return acmacs::sheet::cell::empty{};\n            }\n\n            acmacs::sheet::cell_spans_t cell_spans(size_t row, size_t col) const override\n            {\n                const ::xlnt::cell_reference ref{static_cast<::xlnt::column_t::index_t>(col + 1), static_cast<::xlnt::row_t>(row + 1)};\n                if (!sheet_.has_cell(ref))\n                    return {};\n                const auto cell = sheet_.cell(ref);\n                acmacs::sheet::cell_spans_t spans;\n                \/\/ if (const auto fill = cell.fill(); fill.type() == ::xlnt::fill_type::pattern) {\n                \/\/     const auto fill_pattern = fill.pattern_fill();\n\n                \/\/     const auto get_color = [](const auto& col) -> std::string {\n                \/\/         if (col.is_set() && col.get().type() == ::xlnt::color_type::rgb) {\n                \/\/             const auto rgb = col.get().rgb();\n                \/\/             return fmt::format(\"#{:02x}{:02x}{:02x}\", rgb.red(), rgb.green(), rgb.blue());\n                \/\/         }\n                \/\/         else\n                \/\/             return {};\n                \/\/     };\n\n                \/\/     const std::string foreground = get_color(fill_pattern.foreground()), background = get_color(fill_pattern.background());\n                \/\/     if (!foreground.empty() || !background.empty())\n                \/\/         spans.push_back(acmacs::sheet::cell_span_t{0, 1, foreground, background});\n                \/\/ }\n\n                \/\/ size_t first{0};\n                \/\/ for (const auto& run : cell.value<::xlnt::rich_text>().runs()) {\n                \/\/     if (run.second.is_set()) {\n                \/\/         std::string color_value;\n                \/\/         if (run.second.get().has_color()) {\n                \/\/             if (const auto color = run.second.get().color(); color.type() == ::xlnt::color_type::rgb)\n                \/\/                 color_value = color.rgb().hex_string();\n                \/\/         }\n                \/\/         spans.push_back(acmacs::sheet::cell_span_t{first, run.first.size(), color_value});\n                \/\/     }\n                \/\/     first += run.first.size();\n                \/\/ }\n                return spans;\n            }\n\n          private:\n            ::xlnt::worksheet sheet_;\n        };\n\n        class Doc\n        {\n          public:\n            size_t number_of_sheets() const { return workbook_.sheet_count(); }\n            std::shared_ptr<Sheet> sheet(size_t sheet_no) { return std::make_shared<Sheet>(workbook_.sheet_by_index(sheet_no)); }\n\n          protected:\n            Doc(std::string_view filename) : workbook_{::xlnt::path{std::string{filename}}} {}\n\n          private:\n            ::xlnt::workbook workbook_;\n        };\n\n    } \/\/ namespace xlnt\n\n} \/\/ namespace acmacs::xlsx::inline v1\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>xlsx2html<commit_after>#pragma once\n\n#include \"acmacs-base\/float.hh\"\n#include \"acmacs-base\/xlnt.hh\"\n#include \"acmacs-whocc\/sheet.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs::xlsx::inline v1\n{\n    namespace xlnt\n    {\n        class Doc;\n\n        class Sheet : public acmacs::sheet::Sheet\n        {\n          public:\n            Sheet(::xlnt::worksheet&& src) : sheet_{std::move(src)} {}\n\n            std::string name() const override { return sheet_.title(); }\n            size_t number_of_rows() const override { return sheet_.highest_row(); }\n            size_t number_of_columns() const override { return sheet_.highest_column().index; }\n\n            static inline date::year_month_day make_date(const ::xlnt::datetime& dt, size_t \/*row*\/, size_t \/*col*\/)\n            {\n                \/\/ if (dt.hour || dt.minute || dt.second || dt.microsecond)\n                \/\/     AD_WARNING(\"xlnt datetime at {:c}{} contains time: {}\", col + 'A', row + 1, dt.to_string());\n                return date::year{dt.year} \/ date::month{static_cast<unsigned>(dt.month)} \/ dt.day;\n            }\n\n            acmacs::sheet::cell_t cell(size_t row, size_t col) const override \/\/ row and col are zero based\n            {\n                const ::xlnt::cell_reference ref{static_cast<::xlnt::column_t::index_t>(col + 1), static_cast<::xlnt::row_t>(row + 1)};\n                if (!sheet_.has_cell(ref))\n                    return acmacs::sheet::cell::empty{};\n\n                const auto cell = sheet_.cell(ref);\n                switch (cell.data_type()) { \/\/ ~\/AD\/build\/acmacs-build\/build\/xlnt\/include\/xlnt\/cell\/cell_type.hpp\n                    case ::xlnt::cell_type::empty:\n                        return acmacs::sheet::cell::empty{};\n                    case ::xlnt::cell_type::boolean:\n                        return cell.value<bool>();\n                    case ::xlnt::cell_type::inline_string:\n                    case ::xlnt::cell_type::shared_string:\n                    case ::xlnt::cell_type::formula_string:\n                        if (const auto val = cell.value<std::string>(); !val.empty())\n                            return val;\n                        else\n                            return acmacs::sheet::cell::empty{};\n                    case ::xlnt::cell_type::number:\n                        if (cell.is_date())\n                            return make_date(cell.value<::xlnt::datetime>(), row, col);\n                        else if (const auto vald = cell.value<double>(); !float_equal(vald, std::round(vald)))\n                            return vald;\n                        else\n                            return static_cast<long>(cell.value<long long>());\n                    case ::xlnt::cell_type::date:\n                        return make_date(cell.value<::xlnt::datetime>(), row, col);\n                    case ::xlnt::cell_type::error:\n                        return acmacs::sheet::cell::error{};\n                }\n                return acmacs::sheet::cell::empty{};\n            }\n\n            acmacs::sheet::cell_spans_t cell_spans(size_t row, size_t col) const override\n            {\n                const ::xlnt::cell_reference ref{static_cast<::xlnt::column_t::index_t>(col + 1), static_cast<::xlnt::row_t>(row + 1)};\n                if (!sheet_.has_cell(ref))\n                    return {};\n                acmacs::sheet::cell_spans_t spans;\n                \/\/ const auto cell = sheet_.cell(ref);\n                \/\/ if (const auto fill = cell.fill(); fill.type() == ::xlnt::fill_type::pattern) {\n                \/\/     const auto fill_pattern = fill.pattern_fill();\n\n                \/\/     const auto get_color = [](const auto& col) -> std::string {\n                \/\/         if (col.is_set() && col.get().type() == ::xlnt::color_type::rgb) {\n                \/\/             const auto rgb = col.get().rgb();\n                \/\/             return fmt::format(\"#{:02x}{:02x}{:02x}\", rgb.red(), rgb.green(), rgb.blue());\n                \/\/         }\n                \/\/         else\n                \/\/             return {};\n                \/\/     };\n\n                \/\/     const std::string foreground = get_color(fill_pattern.foreground()), background = get_color(fill_pattern.background());\n                \/\/     if (!foreground.empty() || !background.empty())\n                \/\/         spans.push_back(acmacs::sheet::cell_span_t{0, 1, foreground, background});\n                \/\/ }\n\n                \/\/ size_t first{0};\n                \/\/ for (const auto& run : cell.value<::xlnt::rich_text>().runs()) {\n                \/\/     if (run.second.is_set()) {\n                \/\/         std::string color_value;\n                \/\/         if (run.second.get().has_color()) {\n                \/\/             if (const auto color = run.second.get().color(); color.type() == ::xlnt::color_type::rgb)\n                \/\/                 color_value = color.rgb().hex_string();\n                \/\/         }\n                \/\/         spans.push_back(acmacs::sheet::cell_span_t{first, run.first.size(), color_value});\n                \/\/     }\n                \/\/     first += run.first.size();\n                \/\/ }\n                return spans;\n            }\n\n          private:\n            ::xlnt::worksheet sheet_;\n        };\n\n        class Doc\n        {\n          public:\n            size_t number_of_sheets() const { return workbook_.sheet_count(); }\n            std::shared_ptr<Sheet> sheet(size_t sheet_no) { return std::make_shared<Sheet>(workbook_.sheet_by_index(sheet_no)); }\n\n          protected:\n            Doc(std::string_view filename) : workbook_{::xlnt::path{std::string{filename}}} {}\n\n          private:\n            ::xlnt::workbook workbook_;\n        };\n\n    } \/\/ namespace xlnt\n\n} \/\/ namespace acmacs::xlsx::inline v1\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\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 \"service\/migration_task.hh\"\n\n#include \"message\/messaging_service.hh\"\n#include \"gms\/failure_detector.hh\"\n#include \"db\/schema_tables.hh\"\n#include \"frozen_mutation.hh\"\n#include \"migration_manager.hh\"\n\nnamespace service {\n\nstatic logging::logger mlogger(\"migration_task\");\n\nfuture<> migration_task::run_may_throw(distributed<service::storage_proxy>& proxy, const gms::inet_address& endpoint)\n{\n    if (!gms::get_failure_detector().local().is_alive(endpoint)) {\n        mlogger.error(\"Can't send migration request: node {} is down.\", endpoint);\n        return make_ready_future<>();\n    }\n    netw::messaging_service::msg_addr id{endpoint, 0};\n    return service::get_local_migration_manager().merge_schema_from(id).handle_exception([](std::exception_ptr e) {\n        try {\n            std::rethrow_exception(e);\n        } catch (const exceptions::configuration_exception& e) {\n            mlogger.error(\"Configuration exception merging remote schema: {}\", e.what());\n        }\n    });\n}\n\n}\n<commit_msg>migration_manager: downgrade frightening \"Can't send migration request\" ERROR<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 \"service\/migration_task.hh\"\n\n#include \"message\/messaging_service.hh\"\n#include \"gms\/failure_detector.hh\"\n#include \"db\/schema_tables.hh\"\n#include \"frozen_mutation.hh\"\n#include \"migration_manager.hh\"\n\nnamespace service {\n\nstatic logging::logger mlogger(\"migration_task\");\n\nfuture<> migration_task::run_may_throw(distributed<service::storage_proxy>& proxy, const gms::inet_address& endpoint)\n{\n    if (!gms::get_failure_detector().local().is_alive(endpoint)) {\n        mlogger.warn(\"Can't send migration request: node {} is down.\", endpoint);\n        return make_ready_future<>();\n    }\n    netw::messaging_service::msg_addr id{endpoint, 0};\n    return service::get_local_migration_manager().merge_schema_from(id).handle_exception([](std::exception_ptr e) {\n        try {\n            std::rethrow_exception(e);\n        } catch (const exceptions::configuration_exception& e) {\n            mlogger.error(\"Configuration exception merging remote schema: {}\", e.what());\n        }\n    });\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n*\t@file\tMinimumWeightTriangulation.cpp\n*\t@brief\tFunctions for minimum weight triangulation\n*\/\n\n#include \"MinimumWeightTriangulation.h\"\n\nnamespace psalm\n{\n\n\/*!\n*\tSets default attributes for the minimum-weight triangulation algorithm:\n*\tThe objective function is set to be a minimum-area function.\n*\/\n\nMinimumWeightTriangulation::MinimumWeightTriangulation()\n{\n\tobjective_function = minimum_area;\n}\n\n\/*!\n*\tApplies triangulation algorithm to the input mesh. The function\n*\trequires the input mesh to consist solely of unconnected points. If\n*\tthis is not the case, the function will abort.\n*\n*\t@param input_mesh Mesh that will be triangulated.\n*\n*\t@return true if the mesh could be triangulated, else false. Errors may\n*\toccur when the topology of the mesh is already defined.\n*\/\n\nbool MinimumWeightTriangulation::apply_to(mesh& input_mesh)\n{\n\tif(\tinput_mesh.num_faces() > 0 ||\n\t\tinput_mesh.num_edges() > 0)\n\t\treturn(false);\n\n\tsize_t n = input_mesh.num_vertices();\n\n\tindices = new size_t*[n];\t\t\/\/ store minimum indices (private member)\n\tdouble** weights = new double*[n];\t\/\/ store weights of triangulation (only required locally)\n\n\tfor(size_t i = 0; i < n; i++)\n\t{\n\t\tindices[i] = new size_t[n];\n\t\tweights[i] = new double[n];\n\n\t\t\/\/ Initialize weights array correctly\n\t\tif(i < n-1)\n\t\t\tweights[i][i+1] = 0;\n\t\tif(i < n-2)\n\t\t\tweights[i][i+2] = objective_function(\tinput_mesh.get_vertex(i),\n\t\t\t\t\t\t\t\tinput_mesh.get_vertex(i+1),\n\t\t\t\t\t\t\t\tinput_mesh.get_vertex(i+2));\n\t}\n\n\tsize_t j = 2;\n\twhile(j++ < n-1)\t\/\/ this is correct -- the loop is supposed to start\n\t\t\t\t\/\/ with j == 3\n\t{\n\t\tfor(size_t i = 0; i < n-j; i++)\n\t\t{\n\t\t\tsize_t k = i+j;\n\n\t\t\t\/\/ Find minimum\n\t\t\tdouble min_weight = std::numeric_limits<double>::max();\n\t\t\tsize_t min_index = std::numeric_limits<size_t>::max();\n\t\t\tfor(size_t m = i+1; m < k; m++)\n\t\t\t{\n\t\t\t\tdouble res =\tweights[i][m]+\n\t\t\t\t\t\tweights[m][k]+objective_function(\tinput_mesh.get_vertex(i),\n\t\t\t\t\t\t\t\t\t\t\tinput_mesh.get_vertex(m),\n\t\t\t\t\t\t\t\t\t\t\tinput_mesh.get_vertex(k));\n\n\t\t\t\tif(res < min_weight)\n\t\t\t\t{\n\t\t\t\t\tmin_weight = res;\n\t\t\t\t\tmin_index = m;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tweights[i][k] = min_weight;\n\t\t\tindices[i][k] = min_index;\n\t\t}\n\t}\n\n\t\/\/ Now weights[0][n-1] contains the weight of the minimal\n\t\/\/ triangulation. Construct triangulation using the stored indices.\n\tbool result = construct_triangulation(input_mesh, 0, n-1);\n\n\tfor(size_t i = 0; i < n; i++)\n\t{\n\t\tdelete[] weights[i];\n\t\tdelete[] indices[i];\n\t}\n\n\tdelete[] weights;\n\tdelete[] indices;\n\n\t\/*\n\t\tMark _all_ vertices as boundary vertices. Upon subdivision, the\n\t\tboundary vertices will not be changed and we need to identify\n\t\tthem when storing the subdivided mesh.\n\t*\/\n\n\tfor(size_t i = 0; i < input_mesh.num_vertices(); i++)\n\t\tinput_mesh.get_vertex(i)->set_on_boundary();\n\n\treturn(result);\n}\n\n\/*!\n*\tUsing the array of indices that achieve the minimum of the\n*\tminimum-weight triangulation, this function constructs the actual\n*\ttriangulation of the mesh.\n*\n*\tThis function calls itself recursively.\n*\n*\t@param input_mesh Mesh for which the triangles are constructed\n*\t@param i Smallest index for constructing a triangle\n*\t@param k Largest index for constructing a triangle\n*\n*\t@return true if the triangulation could be constructed, else false.\n*\/\n\nbool MinimumWeightTriangulation::construct_triangulation(mesh& input_mesh, size_t i, size_t k)\n{\n\t\/\/ abort\n\tif(i+2 == k)\n\t\tinput_mesh.add_face(\tinput_mesh.get_vertex(i),\t\/\/ TODO: Check errors for mesh::add_face()\n\t\t\t\t\tinput_mesh.get_vertex(i+1),\n\t\t\t\t\tinput_mesh.get_vertex(k));\n\n\t\/\/ use minimum index to branch off\n\telse\n\t{\n\t\tsize_t j = indices[i][k];\n\t\tif(j != i+1)\n\t\t{\n\t\t\tif(!construct_triangulation(input_mesh, i, j))\n\t\t\t\treturn(false);\n\t\t}\n\n\t\tinput_mesh.add_face(\tinput_mesh.get_vertex(i),\t\/\/ TODO: Check errors for mesh::add_face()\n\t\t\t\t\tinput_mesh.get_vertex(j),\n\t\t\t\t\tinput_mesh.get_vertex(k));\n\n\t\tif(j != k-1)\n\t\t{\n\t\t\tif(!construct_triangulation(input_mesh, j, k))\n\t\t\t\treturn(false);\n\t\t}\n\t}\n\n\treturn(true);\n}\n\n} \/\/ end of namespace \"psalm\"\n<commit_msg>Added check for `MinimumWeightTriangulation`<commit_after>\/*!\n*\t@file\tMinimumWeightTriangulation.cpp\n*\t@brief\tFunctions for minimum weight triangulation\n*\/\n\n#include \"MinimumWeightTriangulation.h\"\n\nnamespace psalm\n{\n\n\/*!\n*\tSets default attributes for the minimum-weight triangulation algorithm:\n*\tThe objective function is set to be a minimum-area function.\n*\/\n\nMinimumWeightTriangulation::MinimumWeightTriangulation()\n{\n\tobjective_function = minimum_area;\n}\n\n\/*!\n*\tApplies triangulation algorithm to the input mesh. The function\n*\trequires the input mesh to consist solely of unconnected points. If\n*\tthis is not the case, the function will abort.\n*\n*\t@param input_mesh Mesh that will be triangulated.\n*\n*\t@return true if the mesh could be triangulated, else false. Errors may\n*\toccur when the topology of the mesh is already defined.\n*\/\n\nbool MinimumWeightTriangulation::apply_to(mesh& input_mesh)\n{\n\tif(\tinput_mesh.num_faces() > 0 ||\n\t\tinput_mesh.num_edges() > 0)\n\t\treturn(false);\n\n\tsize_t n = input_mesh.num_vertices();\n\tif(n < 3)\n\t\treturn(false);\n\n\tindices = new size_t*[n];\t\t\/\/ store minimum indices (private member)\n\tdouble** weights = new double*[n];\t\/\/ store weights of triangulation (only required locally)\n\n\tfor(size_t i = 0; i < n; i++)\n\t{\n\t\tindices[i] = new size_t[n];\n\t\tweights[i] = new double[n];\n\n\t\t\/\/ Initialize weights array correctly\n\t\tif(i < n-1)\n\t\t\tweights[i][i+1] = 0;\n\t\tif(i < n-2)\n\t\t\tweights[i][i+2] = objective_function(\tinput_mesh.get_vertex(i),\n\t\t\t\t\t\t\t\tinput_mesh.get_vertex(i+1),\n\t\t\t\t\t\t\t\tinput_mesh.get_vertex(i+2));\n\t}\n\n\tsize_t j = 2;\n\twhile(j++ < n-1)\t\/\/ this is correct -- the loop is supposed to start\n\t\t\t\t\/\/ with j == 3\n\t{\n\t\tfor(size_t i = 0; i < n-j; i++)\n\t\t{\n\t\t\tsize_t k = i+j;\n\n\t\t\t\/\/ Find minimum\n\t\t\tdouble min_weight = std::numeric_limits<double>::max();\n\t\t\tsize_t min_index = std::numeric_limits<size_t>::max();\n\t\t\tfor(size_t m = i+1; m < k; m++)\n\t\t\t{\n\t\t\t\tdouble res =\tweights[i][m]+\n\t\t\t\t\t\tweights[m][k]+objective_function(\tinput_mesh.get_vertex(i),\n\t\t\t\t\t\t\t\t\t\t\tinput_mesh.get_vertex(m),\n\t\t\t\t\t\t\t\t\t\t\tinput_mesh.get_vertex(k));\n\n\t\t\t\tif(res < min_weight)\n\t\t\t\t{\n\t\t\t\t\tmin_weight = res;\n\t\t\t\t\tmin_index = m;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tweights[i][k] = min_weight;\n\t\t\tindices[i][k] = min_index;\n\t\t}\n\t}\n\n\t\/\/ Now weights[0][n-1] contains the weight of the minimal\n\t\/\/ triangulation. Construct triangulation using the stored indices.\n\tbool result = construct_triangulation(input_mesh, 0, n-1);\n\n\tfor(size_t i = 0; i < n; i++)\n\t{\n\t\tdelete[] weights[i];\n\t\tdelete[] indices[i];\n\t}\n\n\tdelete[] weights;\n\tdelete[] indices;\n\n\t\/*\n\t\tMark _all_ vertices as boundary vertices. Upon subdivision, the\n\t\tboundary vertices will not be changed and we need to identify\n\t\tthem when storing the subdivided mesh.\n\t*\/\n\n\tfor(size_t i = 0; i < input_mesh.num_vertices(); i++)\n\t\tinput_mesh.get_vertex(i)->set_on_boundary();\n\n\treturn(result);\n}\n\n\/*!\n*\tUsing the array of indices that achieve the minimum of the\n*\tminimum-weight triangulation, this function constructs the actual\n*\ttriangulation of the mesh.\n*\n*\tThis function calls itself recursively.\n*\n*\t@param input_mesh Mesh for which the triangles are constructed\n*\t@param i Smallest index for constructing a triangle\n*\t@param k Largest index for constructing a triangle\n*\n*\t@return true if the triangulation could be constructed, else false.\n*\/\n\nbool MinimumWeightTriangulation::construct_triangulation(mesh& input_mesh, size_t i, size_t k)\n{\n\t\/\/ abort\n\tif(i+2 == k)\n\t\tinput_mesh.add_face(\tinput_mesh.get_vertex(i),\t\/\/ TODO: Check errors for mesh::add_face()\n\t\t\t\t\tinput_mesh.get_vertex(i+1),\n\t\t\t\t\tinput_mesh.get_vertex(k));\n\n\t\/\/ use minimum index to branch off\n\telse\n\t{\n\t\tsize_t j = indices[i][k];\n\t\tif(j != i+1)\n\t\t{\n\t\t\tif(!construct_triangulation(input_mesh, i, j))\n\t\t\t\treturn(false);\n\t\t}\n\n\t\tinput_mesh.add_face(\tinput_mesh.get_vertex(i),\t\/\/ TODO: Check errors for mesh::add_face()\n\t\t\t\t\tinput_mesh.get_vertex(j),\n\t\t\t\t\tinput_mesh.get_vertex(k));\n\n\t\tif(j != k-1)\n\t\t{\n\t\t\tif(!construct_triangulation(input_mesh, j, k))\n\t\t\t\treturn(false);\n\t\t}\n\t}\n\n\treturn(true);\n}\n\n} \/\/ end of namespace \"psalm\"\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: recfloat.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: kz $ $Date: 2005-03-01 19:59:35 $\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\/\/ includes *******************************************************************\n\n#pragma hdrstop\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHRECORDERSUPPLIER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchRecorderSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XMODULEMANAGER_HPP_\n#include <com\/sun\/star\/frame\/XModuleManager.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.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_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n#include <svtools\/eitem.hxx>\n#include <svtools\/generictoolboxcontroller.hxx>\n#include <vcl\/msgbox.hxx>\n#include <comphelper\/processfactory.hxx>\n\n#include \"recfloat.hxx\"\n#include \"dialog.hrc\"\n#include \"sfxresid.hxx\"\n#include \"app.hxx\"\n#include \"bindings.hxx\"\n#include \"dispatch.hxx\"\n#include \"viewfrm.hxx\"\n#include \"viewsh.hxx\"\n#include \"imagemgr.hxx\"\n\nusing namespace ::com::sun::star;\n\nstatic rtl::OUString GetLabelFromCommandURL( const rtl::OUString& rCommandURL, const uno::Reference< frame::XFrame >& xFrame )\n{\n    rtl::OUString aLabel;\n    rtl::OUString aModuleIdentifier;\n    uno::Reference< container::XNameAccess > xUICommandLabels;\n    uno::Reference< lang::XMultiServiceFactory > xServiceManager;\n    uno::Reference< container::XNameAccess > xUICommandDescription;\n    uno::Reference< ::com::sun::star::frame::XModuleManager > xModuleManager;\n\n    static uno::WeakReference< lang::XMultiServiceFactory > xTmpServiceManager;\n    static uno::WeakReference< container::XNameAccess >     xTmpNameAccess;\n    static uno::WeakReference< ::com::sun::star::frame::XModuleManager > xTmpModuleMgr;\n\n    xServiceManager = xTmpServiceManager;\n    if ( !xServiceManager.is() )\n    {\n        xServiceManager = ::comphelper::getProcessServiceFactory();\n        xTmpServiceManager = xServiceManager;\n    }\n\n    xUICommandDescription = xTmpNameAccess;\n    if ( !xUICommandDescription.is() )\n    {\n        xUICommandDescription = uno::Reference< container::XNameAccess >(\n                                    xServiceManager->createInstance(\n                                        rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(\n                                            \"com.sun.star.frame.UICommandDescription\" ))),\n                                    uno::UNO_QUERY );\n        xTmpNameAccess = xUICommandDescription;\n    }\n\n    xModuleManager = xTmpModuleMgr;\n    if ( !xModuleManager.is() )\n    {\n        xModuleManager = uno::Reference< ::com::sun::star::frame::XModuleManager >(\n            xServiceManager->createInstance(\n                rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(\n                    \"com.sun.star.frame.ModuleManager\" ))),\n            uno::UNO_QUERY_THROW );\n        xTmpModuleMgr = xModuleManager;\n    }\n\n    \/\/ Retrieve label from UI command description service\n    try\n    {\n        try\n        {\n            aModuleIdentifier = xModuleManager->identify( xFrame );\n        }\n        catch( uno::Exception& )\n        {\n        }\n\n        if ( xUICommandDescription.is() )\n        {\n            uno::Any a = xUICommandDescription->getByName( aModuleIdentifier );\n            uno::Reference< container::XNameAccess > xUICommands;\n            a >>= xUICommandLabels;\n        }\n    }\n    catch ( uno::Exception& )\n    {\n    }\n\n    if ( xUICommandLabels.is() )\n    {\n        try\n        {\n            if ( rCommandURL.getLength() > 0 )\n            {\n                uno::Sequence< beans::PropertyValue > aPropSeq;\n                uno::Any a( xUICommandLabels->getByName( rCommandURL ));\n                if ( a >>= aPropSeq )\n                {\n                    for ( sal_Int32 i = 0; i < aPropSeq.getLength(); i++ )\n                    {\n                        if ( aPropSeq[i].Name.equalsAscii( \"Label\" ))\n                        {\n                            aPropSeq[i].Value >>= aLabel;\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n        catch (uno::Exception& )\n        {\n        }\n    }\n\n    return aLabel;\n}\n\nSFX_IMPL_FLOATINGWINDOW( SfxRecordingFloatWrapper_Impl, SID_RECORDING_FLOATWINDOW );\n\nSfxRecordingFloatWrapper_Impl::SfxRecordingFloatWrapper_Impl( Window* pParent ,\n                                                USHORT nId ,\n                                                SfxBindings* pBind ,\n                                                SfxChildWinInfo* pInfo )\n                    : SfxChildWindow( pParent , nId )\n                    , pBindings( pBind )\n{\n    pWindow = new SfxRecordingFloat_Impl( pBindings, this, pParent );\n    SetWantsFocus( FALSE );\n    eChildAlignment = SFX_ALIGN_NOALIGNMENT;\n    ( ( SfxFloatingWindow* ) pWindow )->Initialize( pInfo );\n}\n\nSfxRecordingFloatWrapper_Impl::~SfxRecordingFloatWrapper_Impl()\n{\n    SfxBoolItem aItem( FN_PARAM_1, TRUE );\n    com::sun::star::uno::Reference< com::sun::star::frame::XDispatchRecorder > xRecorder = pBindings->GetRecorder();\n    if ( xRecorder.is() )\n        pBindings->GetDispatcher()->Execute( SID_STOP_RECORDING, SFX_CALLMODE_SYNCHRON, &aItem, 0L );\n}\n\nsal_Bool SfxRecordingFloatWrapper_Impl::QueryClose()\n{\n    \/\/ asking for recorded macro should be replaced if index access is available!\n    BOOL bRet = TRUE;\n    com::sun::star::uno::Reference< com::sun::star::frame::XDispatchRecorder > xRecorder = pBindings->GetRecorder();\n    if ( xRecorder.is() && xRecorder->getRecordedMacro().getLength() )\n    {\n        QueryBox aBox( GetWindow(), WB_YES_NO | WB_DEF_NO , String( SfxResId( STR_MACRO_LOSS ) ) );\n        aBox.SetText( String( SfxResId(STR_CANCEL_RECORDING) ) );\n        bRet = ( aBox.Execute() == RET_YES );\n    }\n\n    return bRet;\n}\n\nSfxRecordingFloat_Impl::SfxRecordingFloat_Impl(\n    SfxBindings* pBindings ,\n    SfxChildWindow* pChildWin ,\n    Window* pParent )\n    : SfxFloatingWindow( pBindings ,\n                         pChildWin ,\n                         pParent ,\n                         SfxResId( SID_RECORDING_FLOATWINDOW ) )\n    , pWrapper( pChildWin )\n    , aTbx( this, SfxResId(SID_RECORDING_FLOATWINDOW) )\n{\n    \/\/ Retrieve label from helper function\n    uno::Reference< frame::XFrame > xFrame = GetBindings().GetActiveFrame();\n    rtl::OUString aCommandStr( RTL_CONSTASCII_USTRINGPARAM( \".uno:StopRecording\" ));\n    aTbx.SetItemText( SID_STOP_RECORDING, GetLabelFromCommandURL( aCommandStr, xFrame ));\n\n    \/\/ Determine size of toolbar\n    Size aSize = aTbx.CalcWindowSizePixel();\n    aTbx.SetPosSizePixel( Point(), aSize );\n    SetOutputSizePixel( aSize );\n\n    \/\/ create a generic toolbox controller for our internal toolbox\n    svt::GenericToolboxController* pController = new svt::GenericToolboxController(\n                                                    ::comphelper::getProcessServiceFactory(),\n                                                    xFrame,\n                                                    &aTbx,\n                                                    SID_STOP_RECORDING,\n                                                    aCommandStr );\n    xStopRecTbxCtrl = uno::Reference< frame::XToolbarController >(\n                            static_cast< cppu::OWeakObject* >( pController ),\n                        uno::UNO_QUERY );\n    uno::Reference< util::XUpdatable > xUpdate( xStopRecTbxCtrl, uno::UNO_QUERY );\n    if ( xUpdate.is() )\n        xUpdate->update();\n\n    aTbx.SetSelectHdl( LINK( this, SfxRecordingFloat_Impl, Select ) );\n\n    \/\/ start recording\n    SfxBoolItem aItem( SID_RECORDMACRO, TRUE );\n    GetBindings().GetDispatcher()->Execute( SID_RECORDMACRO, SFX_CALLMODE_SYNCHRON, &aItem, 0L );\n}\n\nSfxRecordingFloat_Impl::~SfxRecordingFloat_Impl()\n{\n    try\n    {\n        if ( xStopRecTbxCtrl.is() )\n        {\n            uno::Reference< lang::XComponent > xComp( xStopRecTbxCtrl, uno::UNO_QUERY );\n            xComp->dispose();\n        }\n    }\n    catch ( uno::Exception& )\n    {\n    }\n}\n\nBOOL SfxRecordingFloat_Impl::Close()\n{\n    BOOL bRet = SfxFloatingWindow::Close();\n    return bRet;\n}\n\nvoid SfxRecordingFloat_Impl::FillInfo( SfxChildWinInfo& rInfo ) const\n{\n    SfxFloatingWindow::FillInfo( rInfo );\n    rInfo.bVisible = sal_False;\n}\n\nvoid SfxRecordingFloat_Impl::StateChanged( StateChangedType nStateChange )\n{\n    if ( nStateChange == STATE_CHANGE_INITSHOW )\n    {\n        SfxViewFrame *pFrame = GetBindings().GetDispatcher_Impl()->GetFrame();\n        Window* pEditWin = pFrame->GetViewShell()->GetWindow();\n\n        Point aPoint = pEditWin->OutputToScreenPixel( pEditWin->GetPosPixel() );\n        aPoint = GetParent()->ScreenToOutputPixel( aPoint );\n        aPoint.X() += 20;\n        aPoint.Y() += 10;\n        SetPosPixel( aPoint );\n    }\n\n    SfxFloatingWindow::StateChanged( nStateChange );\n}\n\nIMPL_LINK( SfxRecordingFloat_Impl, Select, ToolBox*, pToolBar )\n{\n    sal_Int16   nKeyModifier( (sal_Int16)aTbx.GetModifier() );\n    if ( xStopRecTbxCtrl.is() )\n        xStopRecTbxCtrl->execute( nKeyModifier );\n\n    return 1;\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.8.192); FILE MERGED 2005\/09\/05 15:22:56 rt 1.8.192.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: recfloat.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 18:29: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\/\/ includes *******************************************************************\n\n#pragma hdrstop\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHRECORDERSUPPLIER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchRecorderSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XMODULEMANAGER_HPP_\n#include <com\/sun\/star\/frame\/XModuleManager.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.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_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n#include <svtools\/eitem.hxx>\n#include <svtools\/generictoolboxcontroller.hxx>\n#include <vcl\/msgbox.hxx>\n#include <comphelper\/processfactory.hxx>\n\n#include \"recfloat.hxx\"\n#include \"dialog.hrc\"\n#include \"sfxresid.hxx\"\n#include \"app.hxx\"\n#include \"bindings.hxx\"\n#include \"dispatch.hxx\"\n#include \"viewfrm.hxx\"\n#include \"viewsh.hxx\"\n#include \"imagemgr.hxx\"\n\nusing namespace ::com::sun::star;\n\nstatic rtl::OUString GetLabelFromCommandURL( const rtl::OUString& rCommandURL, const uno::Reference< frame::XFrame >& xFrame )\n{\n    rtl::OUString aLabel;\n    rtl::OUString aModuleIdentifier;\n    uno::Reference< container::XNameAccess > xUICommandLabels;\n    uno::Reference< lang::XMultiServiceFactory > xServiceManager;\n    uno::Reference< container::XNameAccess > xUICommandDescription;\n    uno::Reference< ::com::sun::star::frame::XModuleManager > xModuleManager;\n\n    static uno::WeakReference< lang::XMultiServiceFactory > xTmpServiceManager;\n    static uno::WeakReference< container::XNameAccess >     xTmpNameAccess;\n    static uno::WeakReference< ::com::sun::star::frame::XModuleManager > xTmpModuleMgr;\n\n    xServiceManager = xTmpServiceManager;\n    if ( !xServiceManager.is() )\n    {\n        xServiceManager = ::comphelper::getProcessServiceFactory();\n        xTmpServiceManager = xServiceManager;\n    }\n\n    xUICommandDescription = xTmpNameAccess;\n    if ( !xUICommandDescription.is() )\n    {\n        xUICommandDescription = uno::Reference< container::XNameAccess >(\n                                    xServiceManager->createInstance(\n                                        rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(\n                                            \"com.sun.star.frame.UICommandDescription\" ))),\n                                    uno::UNO_QUERY );\n        xTmpNameAccess = xUICommandDescription;\n    }\n\n    xModuleManager = xTmpModuleMgr;\n    if ( !xModuleManager.is() )\n    {\n        xModuleManager = uno::Reference< ::com::sun::star::frame::XModuleManager >(\n            xServiceManager->createInstance(\n                rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(\n                    \"com.sun.star.frame.ModuleManager\" ))),\n            uno::UNO_QUERY_THROW );\n        xTmpModuleMgr = xModuleManager;\n    }\n\n    \/\/ Retrieve label from UI command description service\n    try\n    {\n        try\n        {\n            aModuleIdentifier = xModuleManager->identify( xFrame );\n        }\n        catch( uno::Exception& )\n        {\n        }\n\n        if ( xUICommandDescription.is() )\n        {\n            uno::Any a = xUICommandDescription->getByName( aModuleIdentifier );\n            uno::Reference< container::XNameAccess > xUICommands;\n            a >>= xUICommandLabels;\n        }\n    }\n    catch ( uno::Exception& )\n    {\n    }\n\n    if ( xUICommandLabels.is() )\n    {\n        try\n        {\n            if ( rCommandURL.getLength() > 0 )\n            {\n                uno::Sequence< beans::PropertyValue > aPropSeq;\n                uno::Any a( xUICommandLabels->getByName( rCommandURL ));\n                if ( a >>= aPropSeq )\n                {\n                    for ( sal_Int32 i = 0; i < aPropSeq.getLength(); i++ )\n                    {\n                        if ( aPropSeq[i].Name.equalsAscii( \"Label\" ))\n                        {\n                            aPropSeq[i].Value >>= aLabel;\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n        catch (uno::Exception& )\n        {\n        }\n    }\n\n    return aLabel;\n}\n\nSFX_IMPL_FLOATINGWINDOW( SfxRecordingFloatWrapper_Impl, SID_RECORDING_FLOATWINDOW );\n\nSfxRecordingFloatWrapper_Impl::SfxRecordingFloatWrapper_Impl( Window* pParent ,\n                                                USHORT nId ,\n                                                SfxBindings* pBind ,\n                                                SfxChildWinInfo* pInfo )\n                    : SfxChildWindow( pParent , nId )\n                    , pBindings( pBind )\n{\n    pWindow = new SfxRecordingFloat_Impl( pBindings, this, pParent );\n    SetWantsFocus( FALSE );\n    eChildAlignment = SFX_ALIGN_NOALIGNMENT;\n    ( ( SfxFloatingWindow* ) pWindow )->Initialize( pInfo );\n}\n\nSfxRecordingFloatWrapper_Impl::~SfxRecordingFloatWrapper_Impl()\n{\n    SfxBoolItem aItem( FN_PARAM_1, TRUE );\n    com::sun::star::uno::Reference< com::sun::star::frame::XDispatchRecorder > xRecorder = pBindings->GetRecorder();\n    if ( xRecorder.is() )\n        pBindings->GetDispatcher()->Execute( SID_STOP_RECORDING, SFX_CALLMODE_SYNCHRON, &aItem, 0L );\n}\n\nsal_Bool SfxRecordingFloatWrapper_Impl::QueryClose()\n{\n    \/\/ asking for recorded macro should be replaced if index access is available!\n    BOOL bRet = TRUE;\n    com::sun::star::uno::Reference< com::sun::star::frame::XDispatchRecorder > xRecorder = pBindings->GetRecorder();\n    if ( xRecorder.is() && xRecorder->getRecordedMacro().getLength() )\n    {\n        QueryBox aBox( GetWindow(), WB_YES_NO | WB_DEF_NO , String( SfxResId( STR_MACRO_LOSS ) ) );\n        aBox.SetText( String( SfxResId(STR_CANCEL_RECORDING) ) );\n        bRet = ( aBox.Execute() == RET_YES );\n    }\n\n    return bRet;\n}\n\nSfxRecordingFloat_Impl::SfxRecordingFloat_Impl(\n    SfxBindings* pBindings ,\n    SfxChildWindow* pChildWin ,\n    Window* pParent )\n    : SfxFloatingWindow( pBindings ,\n                         pChildWin ,\n                         pParent ,\n                         SfxResId( SID_RECORDING_FLOATWINDOW ) )\n    , pWrapper( pChildWin )\n    , aTbx( this, SfxResId(SID_RECORDING_FLOATWINDOW) )\n{\n    \/\/ Retrieve label from helper function\n    uno::Reference< frame::XFrame > xFrame = GetBindings().GetActiveFrame();\n    rtl::OUString aCommandStr( RTL_CONSTASCII_USTRINGPARAM( \".uno:StopRecording\" ));\n    aTbx.SetItemText( SID_STOP_RECORDING, GetLabelFromCommandURL( aCommandStr, xFrame ));\n\n    \/\/ Determine size of toolbar\n    Size aSize = aTbx.CalcWindowSizePixel();\n    aTbx.SetPosSizePixel( Point(), aSize );\n    SetOutputSizePixel( aSize );\n\n    \/\/ create a generic toolbox controller for our internal toolbox\n    svt::GenericToolboxController* pController = new svt::GenericToolboxController(\n                                                    ::comphelper::getProcessServiceFactory(),\n                                                    xFrame,\n                                                    &aTbx,\n                                                    SID_STOP_RECORDING,\n                                                    aCommandStr );\n    xStopRecTbxCtrl = uno::Reference< frame::XToolbarController >(\n                            static_cast< cppu::OWeakObject* >( pController ),\n                        uno::UNO_QUERY );\n    uno::Reference< util::XUpdatable > xUpdate( xStopRecTbxCtrl, uno::UNO_QUERY );\n    if ( xUpdate.is() )\n        xUpdate->update();\n\n    aTbx.SetSelectHdl( LINK( this, SfxRecordingFloat_Impl, Select ) );\n\n    \/\/ start recording\n    SfxBoolItem aItem( SID_RECORDMACRO, TRUE );\n    GetBindings().GetDispatcher()->Execute( SID_RECORDMACRO, SFX_CALLMODE_SYNCHRON, &aItem, 0L );\n}\n\nSfxRecordingFloat_Impl::~SfxRecordingFloat_Impl()\n{\n    try\n    {\n        if ( xStopRecTbxCtrl.is() )\n        {\n            uno::Reference< lang::XComponent > xComp( xStopRecTbxCtrl, uno::UNO_QUERY );\n            xComp->dispose();\n        }\n    }\n    catch ( uno::Exception& )\n    {\n    }\n}\n\nBOOL SfxRecordingFloat_Impl::Close()\n{\n    BOOL bRet = SfxFloatingWindow::Close();\n    return bRet;\n}\n\nvoid SfxRecordingFloat_Impl::FillInfo( SfxChildWinInfo& rInfo ) const\n{\n    SfxFloatingWindow::FillInfo( rInfo );\n    rInfo.bVisible = sal_False;\n}\n\nvoid SfxRecordingFloat_Impl::StateChanged( StateChangedType nStateChange )\n{\n    if ( nStateChange == STATE_CHANGE_INITSHOW )\n    {\n        SfxViewFrame *pFrame = GetBindings().GetDispatcher_Impl()->GetFrame();\n        Window* pEditWin = pFrame->GetViewShell()->GetWindow();\n\n        Point aPoint = pEditWin->OutputToScreenPixel( pEditWin->GetPosPixel() );\n        aPoint = GetParent()->ScreenToOutputPixel( aPoint );\n        aPoint.X() += 20;\n        aPoint.Y() += 10;\n        SetPosPixel( aPoint );\n    }\n\n    SfxFloatingWindow::StateChanged( nStateChange );\n}\n\nIMPL_LINK( SfxRecordingFloat_Impl, Select, ToolBox*, pToolBar )\n{\n    sal_Int16   nKeyModifier( (sal_Int16)aTbx.GetModifier() );\n    if ( xStopRecTbxCtrl.is() )\n        xStopRecTbxCtrl->execute( nKeyModifier );\n\n    return 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright © 2016 by Donald King <chronos@chronos-tachyon.net>\n\/\/ Available under the MIT License. See LICENSE for details.\n\n#include \"event\/poller.h\"\n\n#include <poll.h>\n#include <sys\/epoll.h>\n#include <unistd.h>\n\n#include \"base\/logging.h\"\n#include \"base\/util.h\"\n\nstatic short poll_mask(event::Set set) noexcept {\n  short result = 0;\n  if (set.readable()) result |= POLLIN | POLLRDHUP;\n  if (set.writable()) result |= POLLOUT;\n  if (set.priority()) result |= POLLPRI;\n  return result;\n}\n\nstatic event::Set poll_unmask(short bits) noexcept {\n  event::Set set;\n  set.set_readable(bits & (POLLIN | POLLRDHUP));\n  set.set_writable(bits & POLLOUT);\n  set.set_priority(bits & POLLPRI);\n  set.set_hangup(bits & POLLHUP);\n  set.set_error(bits & POLLERR);\n  return set;\n}\n\nstatic uint32_t epoll_mask(event::Set set) noexcept {\n  uint32_t result = EPOLLET;\n  if (set.readable()) result |= EPOLLIN | EPOLLRDHUP;\n  if (set.writable()) result |= EPOLLOUT;\n  if (set.priority()) result |= EPOLLPRI;\n  return result;\n}\n\nstatic event::Set epoll_unmask(uint32_t bits) noexcept {\n  event::Set set;\n  set.set_readable(bits & (EPOLLIN | EPOLLRDHUP));\n  set.set_writable(bits & EPOLLOUT);\n  set.set_priority(bits & EPOLLPRI);\n  set.set_hangup(bits & EPOLLHUP);\n  set.set_error(bits & EPOLLERR);\n  return set;\n}\n\nnamespace event {\n\nnamespace {\n\nclass PollPoller : public Poller {\n public:\n  PollPoller() = default;\n\n  PollerType type() const noexcept override { return PollerType::poll_poller; }\n\n  base::Result add(base::FD fd, base::token_t t, Set set) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    map_[fdpair.first] = Item(std::move(fd), t, set);\n    return base::Result();\n  }\n\n  base::Result modify(base::FD fd, base::token_t t, Set set) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    map_[fdpair.first] = Item(std::move(fd), t, set);\n    return base::Result();\n  }\n\n  base::Result remove(base::FD fd) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    map_.erase(fdpair.first);\n    return base::Result();\n  }\n\n  base::Result wait(EventVec* out, int timeout_ms) const override {\n    auto lock = base::acquire_lock(mu_);\n    const std::size_t n = map_.size();\n\n    std::vector<Activation> acts;\n    acts.reserve(n);\n    for (const auto& pair : map_) {\n      const auto& item = pair.second;\n      int fdnum;\n      base::RLock rlock;\n      std::tie(fdnum, rlock) = item.filedesc->acquire_fd();\n      acts.emplace_back(std::move(rlock), fdnum, item.token, item.set);\n    }\n\n    std::vector<struct pollfd> pfds;\n    pfds.resize(n);\n    for (std::size_t i = 0; i < n; ++i) {\n      auto& act = acts[i];\n      auto& pfd = pfds[i];\n      ::bzero(&pfd, sizeof(pfd));\n      pfd.fd = act.fdnum;\n      pfd.events = poll_mask(act.set);\n      pfd.revents = 0;\n    }\n\n    int rc = ::poll(pfds.data(), pfds.size(), timeout_ms);\n    if (rc < 0) {\n      int err_no = errno;\n      if (err_no == EINTR) return base::Result();\n      return base::Result::from_errno(err_no, \"poll(2)\");\n    }\n    if (rc > 0) {\n      for (std::size_t i = 0; i < n; ++i) {\n        auto& act = acts[i];\n        auto& pfd = pfds[i];\n        if (pfd.revents != 0) {\n          Set set = poll_unmask(pfd.revents);\n          out->emplace_back(act.token, set);\n        }\n      }\n    }\n    return base::Result();\n  }\n\n private:\n  struct Item {\n    base::FD filedesc;\n    base::token_t token;\n    Set set;\n\n    Item() noexcept = default;\n    Item(base::FD fd, base::token_t t, Set s) noexcept\n        : filedesc(std::move(fd)),\n          token(t),\n          set(s) {}\n  };\n\n  struct Activation {\n    base::RLock lock;\n    int fdnum;\n    base::token_t token;\n    Set set;\n\n    Activation(base::RLock lk, int n, base::token_t t, Set s) noexcept\n        : lock(std::move(lk)),\n          fdnum(n),\n          token(t),\n          set(s) {}\n  };\n\n  mutable std::mutex mu_;\n  std::map<int, Item> map_;\n};\n\nclass EPollPoller : public Poller {\n public:\n  explicit EPollPoller(int epoll_fd) noexcept : epoll_fd_(epoll_fd) {}\n  ~EPollPoller() noexcept override { ::close(epoll_fd_); }\n\n  PollerType type() const noexcept override { return PollerType::epoll_poller; }\n\n  base::Result add(base::FD fd, base::token_t t, Set set) override {\n    epoll_event ev;\n    ::bzero(&ev, sizeof(ev));\n    ev.events = epoll_mask(set);\n    ev.data.u64 = uint64_t(t);\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, pair.first, &ev);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result modify(base::FD fd, base::token_t t, Set set) override {\n    epoll_event ev;\n    ::bzero(&ev, sizeof(ev));\n    ev.events = epoll_mask(set);\n    ev.data.u64 = uint64_t(t);\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_MOD, pair.first, &ev);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result remove(base::FD fd) override {\n    epoll_event dummy;\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_DEL, pair.first, &dummy);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result wait(EventVec* out, int timeout_ms) const override {\n    base::Result result;\n    std::array<epoll_event, 8> ev = {};\n    std::size_t num = ev.size();\n    while (num >= ev.size()) {\n      ev.fill(epoll_event());\n      int n = ::epoll_wait(epoll_fd_, ev.data(), ev.size(), timeout_ms);\n      if (n < 0) {\n        int err_no = errno;\n        if (err_no == EINTR) break;\n        result = base::Result::from_errno(err_no, \"epoll_wait(2)\");\n        break;\n      }\n      num = n;\n      if (num > ev.size()) n = ev.size();\n      for (std::size_t i = 0; i < num; ++i) {\n        Set set = epoll_unmask(ev[i].events);\n        auto t = base::token_t(ev[i].data.u64);\n        out->emplace_back(t, set);\n      }\n      timeout_ms = 0;\n    }\n    return result;\n  }\n\n private:\n  const int epoll_fd_;\n};\n\nbase::Result new_poll_poller(PollerPtr* out, const PollerOptions& opts) {\n  *out = std::make_shared<PollPoller>();\n  return base::Result();\n}\n\nbase::Result new_epoll_poller(PollerPtr* out, const PollerOptions& opts) {\n  int fd = ::epoll_create1(EPOLL_CLOEXEC);\n  if (fd == -1) {\n    int err_no = errno;\n    return base::Result::from_errno(err_no, \"epoll_create1(2)\");\n  }\n  *out = std::make_shared<EPollPoller>(fd);\n  return base::Result();\n}\n\n}  \/\/ anonymous namespace\n\nbase::Result new_poller(PollerPtr* out, const PollerOptions& opts) {\n  DCHECK_NOTNULL(out)->reset();\n  auto type = opts.type();\n  switch (type) {\n    case PollerType::poll_poller:\n      return new_poll_poller(out, opts);\n\n    case PollerType::unspecified:\n    case PollerType::epoll_poller:\n      return new_epoll_poller(out, opts);\n\n    default:\n      return base::Result::not_implemented();\n  }\n}\n\n}  \/\/ namespace event\n<commit_msg>Implement select(2) polling.<commit_after>\/\/ Copyright © 2016 by Donald King <chronos@chronos-tachyon.net>\n\/\/ Available under the MIT License. See LICENSE for details.\n\n#include \"event\/poller.h\"\n\n#include <poll.h>\n#include <sys\/epoll.h>\n#include <sys\/select.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include \"base\/logging.h\"\n#include \"base\/util.h\"\n\nstatic short poll_mask(event::Set set) noexcept {\n  short result = 0;\n  if (set.readable()) result |= POLLIN | POLLRDHUP;\n  if (set.writable()) result |= POLLOUT;\n  if (set.priority()) result |= POLLPRI;\n  return result;\n}\n\nstatic event::Set poll_unmask(short bits) noexcept {\n  event::Set set;\n  set.set_readable(bits & (POLLIN | POLLRDHUP));\n  set.set_writable(bits & POLLOUT);\n  set.set_priority(bits & POLLPRI);\n  set.set_hangup(bits & POLLHUP);\n  set.set_error(bits & POLLERR);\n  return set;\n}\n\nstatic uint32_t epoll_mask(event::Set set) noexcept {\n  uint32_t result = EPOLLET;\n  if (set.readable()) result |= EPOLLIN | EPOLLRDHUP;\n  if (set.writable()) result |= EPOLLOUT;\n  if (set.priority()) result |= EPOLLPRI;\n  return result;\n}\n\nstatic event::Set epoll_unmask(uint32_t bits) noexcept {\n  event::Set set;\n  set.set_readable(bits & (EPOLLIN | EPOLLRDHUP));\n  set.set_writable(bits & EPOLLOUT);\n  set.set_priority(bits & EPOLLPRI);\n  set.set_hangup(bits & EPOLLHUP);\n  set.set_error(bits & EPOLLERR);\n  return set;\n}\n\nnamespace event {\n\nnamespace {\n\nstruct Item {\n  base::FD filedesc;\n  base::token_t token;\n  Set set;\n\n  Item() noexcept = default;\n  Item(base::FD fd, base::token_t t, Set s) noexcept : filedesc(std::move(fd)),\n                                                       token(t),\n                                                       set(s) {}\n};\n\nstruct Activation {\n  base::RLock lock;\n  int fdnum;\n  base::token_t token;\n  Set set;\n\n  Activation(base::RLock lk, int n, base::token_t t, Set s) noexcept\n      : lock(std::move(lk)),\n        fdnum(n),\n        token(t),\n        set(s) {}\n};\n\nclass LegacyPoller : public Poller {\n protected:\n  explicit LegacyPoller(bool maintain_nfds) : nfds_(0), maint_(maintain_nfds) {}\n\n public:\n  base::Result add(base::FD fd, base::token_t t, Set set) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    auto it = map_.find(fdpair.first);\n    if (it != map_.end()) {\n      return base::Result::from_errno(EEXIST, \"net::Poller::add\");\n    }\n    map_[fdpair.first] = Item(std::move(fd), t, set);\n    if (maint_ && fdpair.first >= nfds_) nfds_ = fdpair.first + 1;\n    return base::Result();\n  }\n\n  base::Result modify(base::FD fd, base::token_t t, Set set) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    auto it = map_.find(fdpair.first);\n    if (it == map_.end()) {\n      return base::Result::from_errno(ENOENT, \"net::Poller::modify\");\n    }\n    auto& item = it->second;\n    item.token = t;\n    item.set = set;\n    return base::Result();\n  }\n\n  base::Result remove(base::FD fd) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    auto it = map_.find(fdpair.first);\n    if (it == map_.end()) {\n      return base::Result::from_errno(ENOENT, \"net::Poller::remove\");\n    }\n    map_.erase(it);\n    if (maint_ && nfds_ == fdpair.first + 1) {\n      int new_nfds = 0;\n      for (const auto& pair : map_) {\n        if (pair.first >= new_nfds) new_nfds = pair.first + 1;\n      }\n      nfds_ = new_nfds;\n    }\n    return base::Result();\n  }\n\n protected:\n  mutable std::mutex mu_;\n  std::map<int, Item> map_;\n  int nfds_;\n  bool maint_;\n};\n\nclass SelectPoller : public LegacyPoller {\n public:\n  SelectPoller() : LegacyPoller(true) {}\n\n  PollerType type() const noexcept override {\n    return PollerType::select_poller;\n  }\n\n  base::Result wait(EventVec* out, int timeout_ms) const override {\n    auto lock = base::acquire_lock(mu_);\n    const std::size_t n = map_.size();\n\n    fd_set rset, wset, eset;\n    FD_ZERO(&rset);\n    FD_ZERO(&wset);\n    FD_ZERO(&eset);\n\n    std::vector<Activation> acts;\n    acts.reserve(n);\n    for (const auto& pair : map_) {\n      const auto& item = pair.second;\n      int fdnum;\n      base::RLock rlock;\n      std::tie(fdnum, rlock) = item.filedesc->acquire_fd();\n      acts.emplace_back(std::move(rlock), fdnum, item.token, item.set);\n      if (fdnum < 0 || fdnum >= FD_SETSIZE) {\n        return base::Result::invalid_argument(\"fd \", fdnum,\n                                              \" is out of range 0..\",\n                                              FD_SETSIZE - 1, \" for select(2)\");\n      }\n      if (item.set.readable()) FD_SET(fdnum, &rset);\n      if (item.set.writable()) FD_SET(fdnum, &wset);\n      FD_SET(fdnum, &eset);\n    }\n\n    struct timeval tv;\n    struct timeval* tvptr = nullptr;\n    if (timeout_ms >= 0) {\n      ::bzero(&tv, sizeof(tv));\n      tv.tv_sec = timeout_ms \/ 1000;\n      tv.tv_usec = (timeout_ms % 1000) * 1000;\n      tvptr = &tv;\n    }\n\n    int rc = ::select(nfds_, &rset, &wset, &eset, tvptr);\n    if (rc < 0) {\n      int err_no = errno;\n      if (err_no == EINTR) return base::Result();\n      return base::Result::from_errno(err_no, \"select(2)\");\n    }\n    if (rc > 0) {\n      for (auto& act : acts) {\n        Set set;\n        set.set_readable(FD_ISSET(act.fdnum, &rset));\n        set.set_writable(FD_ISSET(act.fdnum, &wset));\n        set.set_error(FD_ISSET(act.fdnum, &eset));\n        if (set) out->emplace_back(act.token, set);\n      }\n    }\n    return base::Result();\n  }\n};\n\nclass PollPoller : public LegacyPoller {\n public:\n  PollPoller() : LegacyPoller(false) {}\n\n  PollerType type() const noexcept override { return PollerType::poll_poller; }\n\n  base::Result wait(EventVec* out, int timeout_ms) const override {\n    auto lock = base::acquire_lock(mu_);\n    const std::size_t n = map_.size();\n\n    std::vector<Activation> acts;\n    acts.reserve(n);\n    for (const auto& pair : map_) {\n      const auto& item = pair.second;\n      int fdnum;\n      base::RLock rlock;\n      std::tie(fdnum, rlock) = item.filedesc->acquire_fd();\n      acts.emplace_back(std::move(rlock), fdnum, item.token, item.set);\n    }\n\n    std::vector<struct pollfd> pfds;\n    pfds.resize(n);\n    for (std::size_t i = 0; i < n; ++i) {\n      auto& act = acts[i];\n      auto& pfd = pfds[i];\n      ::bzero(&pfd, sizeof(pfd));\n      pfd.fd = act.fdnum;\n      pfd.events = poll_mask(act.set);\n      pfd.revents = 0;\n    }\n\n    int rc = ::poll(pfds.data(), pfds.size(), timeout_ms);\n    if (rc < 0) {\n      int err_no = errno;\n      if (err_no == EINTR) return base::Result();\n      return base::Result::from_errno(err_no, \"poll(2)\");\n    }\n    if (rc > 0) {\n      for (std::size_t i = 0; i < n; ++i) {\n        auto& act = acts[i];\n        auto& pfd = pfds[i];\n        if (pfd.revents != 0) {\n          Set set = poll_unmask(pfd.revents);\n          out->emplace_back(act.token, set);\n        }\n      }\n    }\n    return base::Result();\n  }\n};\n\nclass EPollPoller : public Poller {\n public:\n  explicit EPollPoller(int epoll_fd) noexcept : epoll_fd_(epoll_fd) {}\n  ~EPollPoller() noexcept override { ::close(epoll_fd_); }\n\n  PollerType type() const noexcept override { return PollerType::epoll_poller; }\n\n  base::Result add(base::FD fd, base::token_t t, Set set) override {\n    epoll_event ev;\n    ::bzero(&ev, sizeof(ev));\n    ev.events = epoll_mask(set);\n    ev.data.u64 = uint64_t(t);\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, pair.first, &ev);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result modify(base::FD fd, base::token_t t, Set set) override {\n    epoll_event ev;\n    ::bzero(&ev, sizeof(ev));\n    ev.events = epoll_mask(set);\n    ev.data.u64 = uint64_t(t);\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_MOD, pair.first, &ev);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result remove(base::FD fd) override {\n    epoll_event dummy;\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_DEL, pair.first, &dummy);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result wait(EventVec* out, int timeout_ms) const override {\n    base::Result result;\n    std::array<epoll_event, 8> ev = {};\n    std::size_t num = ev.size();\n    while (num >= ev.size()) {\n      ev.fill(epoll_event());\n      int n = ::epoll_wait(epoll_fd_, ev.data(), ev.size(), timeout_ms);\n      if (n < 0) {\n        int err_no = errno;\n        if (err_no == EINTR) break;\n        result = base::Result::from_errno(err_no, \"epoll_wait(2)\");\n        break;\n      }\n      num = n;\n      if (num > ev.size()) n = ev.size();\n      for (std::size_t i = 0; i < num; ++i) {\n        Set set = epoll_unmask(ev[i].events);\n        auto t = base::token_t(ev[i].data.u64);\n        out->emplace_back(t, set);\n      }\n      timeout_ms = 0;\n    }\n    return result;\n  }\n\n private:\n  const int epoll_fd_;\n};\n\nbase::Result new_select_poller(PollerPtr* out, const PollerOptions& opts) {\n  *out = std::make_shared<SelectPoller>();\n  return base::Result();\n}\n\nbase::Result new_poll_poller(PollerPtr* out, const PollerOptions& opts) {\n  *out = std::make_shared<PollPoller>();\n  return base::Result();\n}\n\nbase::Result new_epoll_poller(PollerPtr* out, const PollerOptions& opts) {\n  int fd = ::epoll_create1(EPOLL_CLOEXEC);\n  if (fd == -1) {\n    int err_no = errno;\n    return base::Result::from_errno(err_no, \"epoll_create1(2)\");\n  }\n  *out = std::make_shared<EPollPoller>(fd);\n  return base::Result();\n}\n\n}  \/\/ anonymous namespace\n\nbase::Result new_poller(PollerPtr* out, const PollerOptions& opts) {\n  DCHECK_NOTNULL(out)->reset();\n  auto type = opts.type();\n  switch (type) {\n    case PollerType::select_poller:\n      return new_select_poller(out, opts);\n\n    case PollerType::poll_poller:\n      return new_poll_poller(out, opts);\n\n    case PollerType::unspecified:\n    case PollerType::epoll_poller:\n      return new_epoll_poller(out, opts);\n\n    default:\n      return base::Result::not_implemented();\n  }\n}\n\n}  \/\/ namespace event\n<|endoftext|>"}
{"text":"<commit_before>\/*\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 \"Benchmark.h\"\n#include \"SkMutex.h\"\n#include \"SkSharedMutex.h\"\n#include \"SkSpinlock.h\"\n#include \"SkString.h\"\n\ntemplate <typename Mutex>\nclass MutexBench : public Benchmark {\npublic:\n    MutexBench(SkString benchPrefix) : fBenchName(benchPrefix += \"UncontendedBenchmark\") { }\n    bool isSuitableFor(Backend backend) override {\n        return backend == kNonRendering_Backend;\n    }\n\nprotected:\n    const char* onGetName() override {\n        return fBenchName.c_str();\n    }\n\n    void onDraw(const int loops, SkCanvas*) override {\n        Mutex mu;\n        for (int i = 0; i < loops; i++) {\n            mu.acquire();\n            mu.release();\n        }\n    }\n\nprivate:\n    typedef Benchmark INHERITED;\n    SkString fBenchName;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDEF_BENCH( return new MutexBench<SkSharedMutex>(SkString(\"SkSharedMutex\")); )\nDEF_BENCH( return new MutexBench<SkMutex>(SkString(\"SkMutex\")); )\nDEF_BENCH( return new MutexBench<SkSpinlock>(SkString(\"SkSpinlock\")); )\n<commit_msg>Add shared mutex benchmark.<commit_after>\/*\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 \"Benchmark.h\"\n#include \"SkMutex.h\"\n#include \"SkSharedMutex.h\"\n#include \"SkSpinlock.h\"\n#include \"SkString.h\"\n\ntemplate <typename Mutex>\nclass MutexBench : public Benchmark {\npublic:\n    MutexBench(SkString benchPrefix) : fBenchName(benchPrefix += \"UncontendedBenchmark\") { }\n    bool isSuitableFor(Backend backend) override {\n        return backend == kNonRendering_Backend;\n    }\n\nprotected:\n    const char* onGetName() override {\n        return fBenchName.c_str();\n    }\n\n    void onDraw(const int loops, SkCanvas*) override {\n        Mutex mu;\n        for (int i = 0; i < loops; i++) {\n            mu.acquire();\n            mu.release();\n        }\n    }\n\nprivate:\n    typedef Benchmark INHERITED;\n    SkString fBenchName;\n};\n\nclass SharedBench : public Benchmark {\npublic:\n    bool isSuitableFor(Backend backend) override {\n        return backend == kNonRendering_Backend;\n    }\n\nprotected:\n    const char* onGetName() override {\n        return \"SkSharedMutexSharedUncontendedBenchmark\";\n    }\n\n    void onDraw(const int loops, SkCanvas*) override {\n        SkSharedMutex mu;\n        for (int i = 0; i < loops; i++) {\n            mu.acquireShared();\n            mu.releaseShared();\n        }\n    }\n\nprivate:\n    typedef Benchmark INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDEF_BENCH( return new MutexBench<SkSharedMutex>(SkString(\"SkSharedMutex\")); )\nDEF_BENCH( return new MutexBench<SkMutex>(SkString(\"SkMutex\")); )\nDEF_BENCH( return new MutexBench<SkSpinlock>(SkString(\"SkSpinlock\")); )\nDEF_BENCH( return new SharedBench; )\n\n<|endoftext|>"}
{"text":"<commit_before>#include <chrono>\n#include <iostream>\n#include <sstream>\n\nusing namespace std;\n\nasm(\".LC3:\\n\"\n    \"  .long 1065353216\");\nasm(\".LC4:\\n\"\n    \"  .long 3212836864\");\n\nfloat evaluateClang(float a, float b) {\n  asm(\"subss xmm0, xmm1\\n\"\n      \"movss xmm1, dword ptr [rip + .LC3]\\n\"\n      \"addss xmm1, xmm0\\n\"\n      \"mulss xmm1, xmm0\\n\"\n      \"addss xmm0, dword ptr [rip + .LC4]\\n\"\n      \"mulss xmm0, xmm1\");\n}\n\nfloat evaluateGCC(float a, float b) {\n  asm(\"subss xmm0, xmm1\\n\"\n      \"movss xmm2, dword ptr [rip + .LC3]\\n\"\n      \"movaps xmm1, xmm0\\n\"\n      \"addss xmm1, xmm2\\n\"\n      \"mulss xmm1, xmm0\\n\"\n      \"subss xmm0, xmm2\\n\"\n      \"mulss xmm0, xmm1\");\n}\n\nint main() {\n  auto start = std::chrono::steady_clock::now();\n  for (int j = 0; j < 1000; j++) {\n    for (int i = 0; i < 65536; i++) {\n      evaluateClang(4.0f, 9.0f);\n    }\n  }\n  auto now = std::chrono::steady_clock::now();\n  std::chrono::duration<double, std::nano> ns = now - start;\n  cout << ns.count() << \" ns\" << '\\n';\n\n  start = std::chrono::steady_clock::now();\n  for (int j = 0; j < 1000; j++) {\n    for (int i = 0; i < 65536; i++) {\n      evaluateGCC(4.0f, 9.0f);\n    }\n  }\n  now = std::chrono::steady_clock::now();\n  ns = now - start;\n  cout << ns.count() << \" ns\" << '\\n';\n}\n<commit_msg>Should perform more iterations on the comparison<commit_after>#include <chrono>\n#include <iostream>\n#include <sstream>\n\nusing namespace std;\n\nasm(\".LC3:\\n\"\n    \"  .long 1065353216\");\nasm(\".LC4:\\n\"\n    \"  .long 3212836864\");\n\nfloat evaluateClang(float a, float b) {\n  asm(\"subss xmm0, xmm1\\n\"\n      \"movss xmm1, dword ptr [rip + .LC3]\\n\"\n      \"addss xmm1, xmm0\\n\"\n      \"mulss xmm1, xmm0\\n\"\n      \"addss xmm0, dword ptr [rip + .LC4]\\n\"\n      \"mulss xmm0, xmm1\");\n}\n\nfloat evaluateGCC(float a, float b) {\n  asm(\"subss xmm0, xmm1\\n\"\n      \"movss xmm2, dword ptr [rip + .LC3]\\n\"\n      \"movaps xmm1, xmm0\\n\"\n      \"addss xmm1, xmm2\\n\"\n      \"mulss xmm1, xmm0\\n\"\n      \"subss xmm0, xmm2\\n\"\n      \"mulss xmm0, xmm1\");\n}\n\nint main() {\n  auto start = std::chrono::steady_clock::now();\n  for (int j = 0; j < 1000 * 1000 * 1000; j++) {\n    evaluateClang(4.0f, 9.0f);\n  }\n  auto now = std::chrono::steady_clock::now();\n  std::chrono::duration<double, std::nano> ns = now - start;\n  cout << ns.count() << \" ns\" << '\\n';\n\n  start = std::chrono::steady_clock::now();\n  for (int j = 0; j < 1000 * 1000 * 1000; j++) {\n    evaluateGCC(4.0f, 9.0f);\n  }\n  now = std::chrono::steady_clock::now();\n  ns = now - start;\n  cout << ns.count() << \" ns\" << '\\n';\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ListScrollView.cpp : 实现文件\n\/\/\n\n#include \"stdafx.h\"\n#include \"ListScrollView.h\"\n\n\/\/ ListScrollView\n\nIMPLEMENT_DYNCREATE(ListScrollView, CScrollView)\n\nListScrollView::ListScrollView() : _lineHeight(15) {\n\n}\n\nListScrollView::~ListScrollView() {\n}\n\nvoid ListScrollView::insert(const tstring& text, void* data \/*= nullptr*\/, unsigned before \/*= 0xFFFFFFFF*\/) {\n\tItem* i = new Item();\n\ti->text = text;\n\ti->data = data;\n\n\tauto pos = before != 0xFFFFFFFF ? _itemList.begin() + before : _itemList.end();\n\t_itemList.insert(pos, i);\n}\n\nvoid ListScrollView::resetScrollSize() {\n\tCRect clientRect;\n\tGetClientRect(clientRect);\n\t_totalSize.cx = 0;\n\t\/\/ 加1是为了最后一行一定可见\n\t_totalSize.cy = (_itemList.size() + 1) * _lineHeight;\n#define LOGCC_WINUI_CUSTOMIZE_PAGE_SIZE_LINE_SIZE\n#ifdef LOGCC_WINUI_CUSTOMIZE_PAGE_SIZE_LINE_SIZE\n\tCSize pageSize(clientRect.Width(), clientRect.Height() \/ _lineHeight * _lineHeight);\n\tCSize lineSize(clientRect.Width(), _lineHeight);\n\tSetScrollSizes(MM_TEXT, _totalSize, pageSize, lineSize);\n#else\n\tSetScrollSizes(MM_TEXT, _totalSize);\n#endif\n#define LOGCC_WINUI_SCROLL_TO_END_ON_UPDATE\n#ifdef LOGCC_WINUI_SCROLL_TO_END_ON_UPDATE\n\tint y = _totalSize.cy - clientRect.Height();\n\tScrollToPosition(CPoint(0, max(y, 0)));\n#endif\n}\n\nvoid ListScrollView::scrollTo(int yScrollPos) {\n\tCRect clientRect;\n\tGetClientRect(clientRect);\n\n\t\/\/ NOTICE:\t很奇怪的现象，CScrollView在OnInitUpdate之外函数SetScrollSizes，\n\t\/\/\t\t\t如果设置的高度小于ClientRect，虽然没有显示滚动条仍然可以滚动，这里特殊处理一下，禁止滚动\n\tif (clientRect.Height() >= _totalSize.cy) return;\n\n\tScrollToPosition(CPoint(0, yScrollPos));\n}\n\nvoid ListScrollView::scrollDelta(int delta) {\n\tint yScrollPos = GetScrollPosition().y;\n\tyScrollPos += delta;\n\tscrollTo(max(yScrollPos, 0));\n}\n\nvoid ListScrollView::scrollLines(int count) {\n\tscrollDelta(_lineHeight * count);\n}\n\nvoid ListScrollView::scrollPages(int count) {\n\tCRect clientRect;\n\tGetClientRect(clientRect);\n\n\tscrollLines(clientRect.Height() \/ _lineHeight * count);\n}\n\nbool ListScrollView::isItemVisible(unsigned index) const {\n\tCRect rect;\n\tGetClientRect(rect);\n\treturn static_cast<int>(index * _lineHeight) >= GetScrollPosition().y\n\t\t&& static_cast<int>((index + 1) * _lineHeight) <= GetScrollPosition().y + rect.Height();\n}\n\nvoid ListScrollView::clear() {\n\tfor_each(_itemList.begin(), _itemList.end(), [] (Item* p) { delete p; });\n\t_itemList.clear();\n}\n\nvoid ListScrollView::setSelectedIndex(unsigned i) {\n\t_selectedIndex = i;\n\tInvalidate();\n\tonSelectedChanged();\n}\n\nvoid ListScrollView::OnInitialUpdate() {\n\tCScrollView::OnInitialUpdate();\n\n\tresetScrollSize();\n}\n\nvoid ListScrollView::PostNcDestroy()\n{\n\tclear();\n\tCScrollView::PostNcDestroy();\n}\n\n\/\/ ListScrollView 绘图\n\nvoid ListScrollView::drawItem(HDC hdc, const RECT& rect, const Item* item) {\n\tint oldBkMode = ::SetBkMode(hdc, TRANSPARENT);\n\tint oldTextColor = ::GetTextColor(hdc);\n\n\t\/\/ 背景\n\tHBRUSH bkgdBrush = NULL;\n\tif (find(_itemList.begin(), _itemList.end(), item) - _itemList.begin() == (int)_selectedIndex) {\n\t\tbkgdBrush = ::CreateSolidBrush(::GetSysColor(COLOR_HIGHLIGHT));\n\t\t::SetTextColor(hdc, ::GetSysColor(COLOR_HIGHLIGHTTEXT));\n\t} else if (item->text.find(_T(\"ERROR\")) != tstring::npos) {\n\t\tbkgdBrush = ::CreateSolidBrush(0x000000FF);\n\t} else if (item->text.find(_T(\"WARN\")) != tstring::npos) {\n\t\tbkgdBrush = ::CreateSolidBrush(0x0000FFFF);\n\t} else {\n\t\tbkgdBrush = ::CreateSolidBrush(0x00FFFFFF);\n\t}\n\tHGDIOBJ oldBrush = ::SelectObject(hdc, bkgdBrush);\n\t::FillRect(hdc, &rect, bkgdBrush);\n\n\t::SelectObject(hdc, oldBrush);\n\t::DeleteObject(bkgdBrush);\n\n\tRECT textRect = rect;\n\ttextRect.top += 1;\n\ttextRect.bottom -= 1;\n\t::DrawText(hdc, item->text.c_str(), item->text.size(), &textRect,\n\t\tDT_NOCLIP | DT_SINGLELINE | DT_END_ELLIPSIS | DT_NOPREFIX | DT_EXPANDTABS);\n\n\t::SetBkMode(hdc, oldBkMode);\n\t::SetTextColor(hdc, oldTextColor);\n}\n\nvoid ListScrollView::OnDraw(CDC* pDC) {\n\tCRect clientRect;\n\tGetClientRect(clientRect);\n\n\tHDC memDC = ::CreateCompatibleDC(pDC->GetSafeHdc());\n\n\tHBITMAP memBmp = ::CreateCompatibleBitmap(pDC->GetSafeHdc(), clientRect.Width(), clientRect.Height());\n\tHGDIOBJ oldBmp = ::SelectObject(memDC, memBmp);\n\n\tHBRUSH bkgdBrush = reinterpret_cast<HBRUSH>(::GetStockObject(WHITE_BRUSH));\n\t::FillRect(memDC, clientRect, bkgdBrush);\n\n\tHFONT font = ::CreateFont(_lineHeight - 2, 0, 0, 0, FW_NORMAL, FALSE, FALSE, 0, DEFAULT_CHARSET, OUT_DEFAULT_PRECIS, CLIP_DEFAULT_PRECIS,\n\t\tDEFAULT_QUALITY, FIXED_PITCH, _T(\"新宋体\"));\n\tHGDIOBJ oldFont = ::SelectObject(memDC, font);\n\n\tCPoint scrollPosition = GetScrollPosition();\n\n\tif (!_itemList.empty()) {\n\t\t\/\/ 顶部可以显示半行\n\t\tint yLogLineStart = scrollPosition.y % _lineHeight == 0 ? 0 : (scrollPosition.y % _lineHeight) * -1;\n\t\tunsigned beginLine = scrollPosition.y \/ _lineHeight;\n\t\t\/\/ +1是为了底部能显示半行\n\t\tunsigned endLine = (scrollPosition.y + clientRect.Height()) \/ _lineHeight + 1;\n\t\tendLine = min(endLine, _itemList.size());\n\n\t\tfor (unsigned i = 0; i < endLine - beginLine; i++) {\n\t\t\tItem* item = _itemList[beginLine + i];\n\t\t\tCRect rect = clientRect;\n\t\t\trect.top = yLogLineStart + i * _lineHeight;\n\t\t\trect.bottom = rect.top + _lineHeight;\n\t\t\tdrawItem(memDC, rect, item);\n\t\t}\n\t}\n\n\t::BitBlt(pDC->GetSafeHdc(), scrollPosition.x, scrollPosition.y, clientRect.Width(), clientRect.Height(),\n\t\tmemDC, 0, 0, SRCCOPY);\n\n\t::SelectObject(memDC, oldFont);\n\t::DeleteObject(font);\n\t::SelectObject(memDC, oldBmp);\n\t::DeleteObject(memBmp);\n\t::DeleteDC(memDC);\n}\n\n\/\/ ListScrollView 消息处理程序\n\nBEGIN_MESSAGE_MAP(ListScrollView, CScrollView)\n\tON_WM_ERASEBKGND()\n\tON_WM_VSCROLL()\n\tON_WM_MOUSEWHEEL()\n\tON_WM_KEYDOWN()\n\tON_WM_LBUTTONUP()\nEND_MESSAGE_MAP()\n\nBOOL ListScrollView::OnEraseBkgnd(CDC* \/*pDC*\/) {\n#ifdef LOGCC_WINUI_USE_DEFAULT_ERASE_BACKGROUND\n\treturn CScrollView::OnEraseBkgnd(pDC);\n#else\n\treturn TRUE;\n#endif\n}\n\nvoid ListScrollView::OnVScroll(UINT nSBCode, UINT \/*nPos*\/, CScrollBar* \/*pScrollBar*\/) {\n\t\/\/ 以下代码源自：http:\/\/blog.csdn.net\/xiaji2007\/article\/details\/5744111\n\t\/\/ 并予以修改\n\t\/\/ 解决CScrollView行数过多时滚动条回滚问题\n\tSCROLLINFO si = { 0 };\n\tsi.cbSize = sizeof(SCROLLINFO);\n\tsi.fMask = SIF_ALL;\n\tGetScrollInfo(SB_VERT, &si);\n\tint lastPos = si.nPos;\n\tswitch (nSBCode) {\n\tcase SB_TOP:\t\tsi.nPos = si.nMin;\t\tbreak;\n\tcase SB_BOTTOM:\t\tsi.nPos = si.nMax;\t\tbreak;\n\tcase SB_LINEUP:\t\tsi.nPos -= _lineHeight;\tbreak;\n\tcase SB_LINEDOWN:\tsi.nPos += _lineHeight;\tbreak;\n\tcase SB_PAGEUP:\t\tsi.nPos -= si.nPage;\tbreak;\n\tcase SB_PAGEDOWN:\tsi.nPos += si.nPage;\tbreak;\n\tcase SB_THUMBTRACK:\tsi.nPos = si.nTrackPos;\tbreak;\n\tdefault:\t\t\t\t\t\t\t\t\tbreak;\n\t}\n\tsi.fMask = SIF_POS;\n\tSetScrollInfo(SB_VERT, &si);\n\tif (lastPos!=si.nPos) {\n\t\t::ScrollWindow(m_hWnd, 0, lastPos - si.nPos, NULL, NULL);\n\t}\n}\n\nBOOL ListScrollView::OnMouseWheel(UINT nFlags, short zDelta, CPoint pt) {\n\tif (zDelta < 0) {\n\t\t\/\/ 向下3行\n\t\tscrollLines(3);\n\t} else {\n\t\t\/\/ 向上3行\n\t\tscrollLines(-3);\n\t}\n\treturn CScrollView::OnMouseWheel(nFlags, zDelta, pt);\n}\n\nvoid ListScrollView::OnKeyDown(UINT nChar, UINT nRepCnt, UINT nFlags) {\n\t\/\/ 以下是切换选中的情况\n\tif (nChar == VK_UP) {\n\t\t\/\/ 选中上一行\n\t\tif (_selectedIndex > 0 && _selectedIndex != 0xFFFFFFFF) {\n\t\t\tsetSelectedIndex(_selectedIndex - 1);\n\n\t\t\tif (!isItemVisible(_selectedIndex)) {\n\t\t\t\tscrollLines(-1);\n\t\t\t}\n\t\t}\n\t} else if (nChar == VK_DOWN) {\n\t\t\/\/ 选中下一行\n\t\tif (_selectedIndex != 0xFFFFFFFF && _selectedIndex < _itemList.size() - 1) {\n\t\t\tsetSelectedIndex(_selectedIndex + 1);;\n\n\t\t\tif (!isItemVisible(_selectedIndex)) {\n\t\t\t\tscrollLines(1);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t\/\/ 以下是滚动的情况\n\t\tif (::GetKeyState(VK_CONTROL) & 0x80000000) {\n\t\t\tif (nChar == VK_HOME) {\n\t\t\t\t\/\/ 跳到第一页\n\t\t\t\tscrollTo(0);\n\t\t\t} else if (nChar == VK_END) {\n\t\t\t\t\/\/ 跳到最后一页，多出没事\n\t\t\t\tscrollTo(_itemList.size() * _lineHeight);\n\t\t\t} else if (nChar == VK_UP) {\n\t\t\t\t\/\/ 向上1行\n\t\t\t\tscrollLines(-1);\n\t\t\t} else if (nChar == VK_DOWN) {\n\t\t\t\t\/\/ 向下1行\n\t\t\t\tscrollLines(1);\n\t\t\t}\n\t\t}\n\t\tif (nChar == VK_PRIOR) {\n\t\t\t\/\/ 向上1页\n\t\t\tscrollPages(-1);\n\t\t} else if (nChar == VK_NEXT) {\n\t\t\t\/\/ 向下1页\n\t\t\tscrollPages(1);\n\t\t}\n\t}\n\tCScrollView::OnKeyDown(nChar, nRepCnt, nFlags);\n}\n\nvoid ListScrollView::OnLButtonUp(UINT nFlags, CPoint point) {\n\tint yScrollPos = GetScrollPosition().y;\n\tunsigned index = (yScrollPos + point.y) \/ _lineHeight;\n\n\tif (index < _itemList.size()) {\n\t\tsetSelectedIndex(index);\n\t}\n\n\tCScrollView::OnLButtonUp(nFlags, point);\n}\n<commit_msg>解决不足一页的文件打开后未重绘的问题<commit_after>\/\/ ListScrollView.cpp : 实现文件\n\/\/\n\n#include \"stdafx.h\"\n#include \"ListScrollView.h\"\n\n\/\/ ListScrollView\n\nIMPLEMENT_DYNCREATE(ListScrollView, CScrollView)\n\nListScrollView::ListScrollView() : _lineHeight(15) {\n\n}\n\nListScrollView::~ListScrollView() {\n}\n\nvoid ListScrollView::insert(const tstring& text, void* data \/*= nullptr*\/, unsigned before \/*= 0xFFFFFFFF*\/) {\n\tItem* i = new Item();\n\ti->text = text;\n\ti->data = data;\n\n\tauto pos = before != 0xFFFFFFFF ? _itemList.begin() + before : _itemList.end();\n\t_itemList.insert(pos, i);\n}\n\nvoid ListScrollView::resetScrollSize() {\n\tCRect clientRect;\n\tGetClientRect(clientRect);\n\t_totalSize.cx = 0;\n\t\/\/ 加1是为了最后一行一定可见\n\t_totalSize.cy = (_itemList.size() + 1) * _lineHeight;\n#define LOGCC_WINUI_CUSTOMIZE_PAGE_SIZE_LINE_SIZE\n#ifdef LOGCC_WINUI_CUSTOMIZE_PAGE_SIZE_LINE_SIZE\n\tCSize pageSize(clientRect.Width(), clientRect.Height() \/ _lineHeight * _lineHeight);\n\tCSize lineSize(clientRect.Width(), _lineHeight);\n\tSetScrollSizes(MM_TEXT, _totalSize, pageSize, lineSize);\n#else\n\tSetScrollSizes(MM_TEXT, _totalSize);\n#endif\n#define LOGCC_WINUI_SCROLL_TO_END_ON_UPDATE\n#ifdef LOGCC_WINUI_SCROLL_TO_END_ON_UPDATE\n\tint y = _totalSize.cy - clientRect.Height();\n\tScrollToPosition(CPoint(0, max(y, 0)));\n#endif\n\tInvalidate();\n}\n\nvoid ListScrollView::scrollTo(int yScrollPos) {\n\tCRect clientRect;\n\tGetClientRect(clientRect);\n\n\t\/\/ NOTICE:\t很奇怪的现象，CScrollView在OnInitUpdate之外函数SetScrollSizes，\n\t\/\/\t\t\t如果设置的高度小于ClientRect，虽然没有显示滚动条仍然可以滚动，这里特殊处理一下，禁止滚动\n\tif (clientRect.Height() >= _totalSize.cy) return;\n\n\tScrollToPosition(CPoint(0, yScrollPos));\n}\n\nvoid ListScrollView::scrollDelta(int delta) {\n\tint yScrollPos = GetScrollPosition().y;\n\tyScrollPos += delta;\n\tscrollTo(max(yScrollPos, 0));\n}\n\nvoid ListScrollView::scrollLines(int count) {\n\tscrollDelta(_lineHeight * count);\n}\n\nvoid ListScrollView::scrollPages(int count) {\n\tCRect clientRect;\n\tGetClientRect(clientRect);\n\n\tscrollLines(clientRect.Height() \/ _lineHeight * count);\n}\n\nbool ListScrollView::isItemVisible(unsigned index) const {\n\tCRect rect;\n\tGetClientRect(rect);\n\treturn static_cast<int>(index * _lineHeight) >= GetScrollPosition().y\n\t\t&& static_cast<int>((index + 1) * _lineHeight) <= GetScrollPosition().y + rect.Height();\n}\n\nvoid ListScrollView::clear() {\n\tfor_each(_itemList.begin(), _itemList.end(), [] (Item* p) { delete p; });\n\t_itemList.clear();\n}\n\nvoid ListScrollView::setSelectedIndex(unsigned i) {\n\t_selectedIndex = i;\n\tInvalidate();\n\tonSelectedChanged();\n}\n\nvoid ListScrollView::OnInitialUpdate() {\n\tCScrollView::OnInitialUpdate();\n\n\tresetScrollSize();\n}\n\nvoid ListScrollView::PostNcDestroy()\n{\n\tclear();\n\tCScrollView::PostNcDestroy();\n}\n\n\/\/ ListScrollView 绘图\n\nvoid ListScrollView::drawItem(HDC hdc, const RECT& rect, const Item* item) {\n\tint oldBkMode = ::SetBkMode(hdc, TRANSPARENT);\n\tint oldTextColor = ::GetTextColor(hdc);\n\n\t\/\/ 背景\n\tHBRUSH bkgdBrush = NULL;\n\tif (find(_itemList.begin(), _itemList.end(), item) - _itemList.begin() == (int)_selectedIndex) {\n\t\tbkgdBrush = ::CreateSolidBrush(::GetSysColor(COLOR_HIGHLIGHT));\n\t\t::SetTextColor(hdc, ::GetSysColor(COLOR_HIGHLIGHTTEXT));\n\t} else if (item->text.find(_T(\"ERROR\")) != tstring::npos) {\n\t\tbkgdBrush = ::CreateSolidBrush(0x000000FF);\n\t} else if (item->text.find(_T(\"WARN\")) != tstring::npos) {\n\t\tbkgdBrush = ::CreateSolidBrush(0x0000FFFF);\n\t} else {\n\t\tbkgdBrush = ::CreateSolidBrush(0x00FFFFFF);\n\t}\n\tHGDIOBJ oldBrush = ::SelectObject(hdc, bkgdBrush);\n\t::FillRect(hdc, &rect, bkgdBrush);\n\n\t::SelectObject(hdc, oldBrush);\n\t::DeleteObject(bkgdBrush);\n\n\tRECT textRect = rect;\n\ttextRect.top += 1;\n\ttextRect.bottom -= 1;\n\t::DrawText(hdc, item->text.c_str(), item->text.size(), &textRect,\n\t\tDT_NOCLIP | DT_SINGLELINE | DT_END_ELLIPSIS | DT_NOPREFIX | DT_EXPANDTABS);\n\n\t::SetBkMode(hdc, oldBkMode);\n\t::SetTextColor(hdc, oldTextColor);\n}\n\nvoid ListScrollView::OnDraw(CDC* pDC) {\n\tCRect clientRect;\n\tGetClientRect(clientRect);\n\n\tHDC memDC = ::CreateCompatibleDC(pDC->GetSafeHdc());\n\n\tHBITMAP memBmp = ::CreateCompatibleBitmap(pDC->GetSafeHdc(), clientRect.Width(), clientRect.Height());\n\tHGDIOBJ oldBmp = ::SelectObject(memDC, memBmp);\n\n\tHBRUSH bkgdBrush = reinterpret_cast<HBRUSH>(::GetStockObject(WHITE_BRUSH));\n\t::FillRect(memDC, clientRect, bkgdBrush);\n\n\tHFONT font = ::CreateFont(_lineHeight - 2, 0, 0, 0, FW_NORMAL, FALSE, FALSE, 0, DEFAULT_CHARSET, OUT_DEFAULT_PRECIS, CLIP_DEFAULT_PRECIS,\n\t\tDEFAULT_QUALITY, FIXED_PITCH, _T(\"新宋体\"));\n\tHGDIOBJ oldFont = ::SelectObject(memDC, font);\n\n\tCPoint scrollPosition = GetScrollPosition();\n\n\tif (!_itemList.empty()) {\n\t\t\/\/ 顶部可以显示半行\n\t\tint yLogLineStart = scrollPosition.y % _lineHeight == 0 ? 0 : (scrollPosition.y % _lineHeight) * -1;\n\t\tunsigned beginLine = scrollPosition.y \/ _lineHeight;\n\t\t\/\/ +1是为了底部能显示半行\n\t\tunsigned endLine = (scrollPosition.y + clientRect.Height()) \/ _lineHeight + 1;\n\t\tendLine = min(endLine, _itemList.size());\n\n\t\tfor (unsigned i = 0; i < endLine - beginLine; i++) {\n\t\t\tItem* item = _itemList[beginLine + i];\n\t\t\tCRect rect = clientRect;\n\t\t\trect.top = yLogLineStart + i * _lineHeight;\n\t\t\trect.bottom = rect.top + _lineHeight;\n\t\t\tdrawItem(memDC, rect, item);\n\t\t}\n\t}\n\n\t::BitBlt(pDC->GetSafeHdc(), scrollPosition.x, scrollPosition.y, clientRect.Width(), clientRect.Height(),\n\t\tmemDC, 0, 0, SRCCOPY);\n\n\t::SelectObject(memDC, oldFont);\n\t::DeleteObject(font);\n\t::SelectObject(memDC, oldBmp);\n\t::DeleteObject(memBmp);\n\t::DeleteDC(memDC);\n}\n\n\/\/ ListScrollView 消息处理程序\n\nBEGIN_MESSAGE_MAP(ListScrollView, CScrollView)\n\tON_WM_ERASEBKGND()\n\tON_WM_VSCROLL()\n\tON_WM_MOUSEWHEEL()\n\tON_WM_KEYDOWN()\n\tON_WM_LBUTTONUP()\nEND_MESSAGE_MAP()\n\nBOOL ListScrollView::OnEraseBkgnd(CDC* \/*pDC*\/) {\n#ifdef LOGCC_WINUI_USE_DEFAULT_ERASE_BACKGROUND\n\treturn CScrollView::OnEraseBkgnd(pDC);\n#else\n\treturn TRUE;\n#endif\n}\n\nvoid ListScrollView::OnVScroll(UINT nSBCode, UINT \/*nPos*\/, CScrollBar* \/*pScrollBar*\/) {\n\t\/\/ 以下代码源自：http:\/\/blog.csdn.net\/xiaji2007\/article\/details\/5744111\n\t\/\/ 并予以修改\n\t\/\/ 解决CScrollView行数过多时滚动条回滚问题\n\tSCROLLINFO si = { 0 };\n\tsi.cbSize = sizeof(SCROLLINFO);\n\tsi.fMask = SIF_ALL;\n\tGetScrollInfo(SB_VERT, &si);\n\tint lastPos = si.nPos;\n\tswitch (nSBCode) {\n\tcase SB_TOP:\t\tsi.nPos = si.nMin;\t\tbreak;\n\tcase SB_BOTTOM:\t\tsi.nPos = si.nMax;\t\tbreak;\n\tcase SB_LINEUP:\t\tsi.nPos -= _lineHeight;\tbreak;\n\tcase SB_LINEDOWN:\tsi.nPos += _lineHeight;\tbreak;\n\tcase SB_PAGEUP:\t\tsi.nPos -= si.nPage;\tbreak;\n\tcase SB_PAGEDOWN:\tsi.nPos += si.nPage;\tbreak;\n\tcase SB_THUMBTRACK:\tsi.nPos = si.nTrackPos;\tbreak;\n\tdefault:\t\t\t\t\t\t\t\t\tbreak;\n\t}\n\tsi.fMask = SIF_POS;\n\tSetScrollInfo(SB_VERT, &si);\n\tif (lastPos!=si.nPos) {\n\t\t::ScrollWindow(m_hWnd, 0, lastPos - si.nPos, NULL, NULL);\n\t}\n}\n\nBOOL ListScrollView::OnMouseWheel(UINT nFlags, short zDelta, CPoint pt) {\n\tif (zDelta < 0) {\n\t\t\/\/ 向下3行\n\t\tscrollLines(3);\n\t} else {\n\t\t\/\/ 向上3行\n\t\tscrollLines(-3);\n\t}\n\treturn CScrollView::OnMouseWheel(nFlags, zDelta, pt);\n}\n\nvoid ListScrollView::OnKeyDown(UINT nChar, UINT nRepCnt, UINT nFlags) {\n\t\/\/ 以下是切换选中的情况\n\tif (nChar == VK_UP) {\n\t\t\/\/ 选中上一行\n\t\tif (_selectedIndex > 0 && _selectedIndex != 0xFFFFFFFF) {\n\t\t\tsetSelectedIndex(_selectedIndex - 1);\n\n\t\t\tif (!isItemVisible(_selectedIndex)) {\n\t\t\t\tscrollLines(-1);\n\t\t\t}\n\t\t}\n\t} else if (nChar == VK_DOWN) {\n\t\t\/\/ 选中下一行\n\t\tif (_selectedIndex != 0xFFFFFFFF && _selectedIndex < _itemList.size() - 1) {\n\t\t\tsetSelectedIndex(_selectedIndex + 1);;\n\n\t\t\tif (!isItemVisible(_selectedIndex)) {\n\t\t\t\tscrollLines(1);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t\/\/ 以下是滚动的情况\n\t\tif (::GetKeyState(VK_CONTROL) & 0x80000000) {\n\t\t\tif (nChar == VK_HOME) {\n\t\t\t\t\/\/ 跳到第一页\n\t\t\t\tscrollTo(0);\n\t\t\t} else if (nChar == VK_END) {\n\t\t\t\t\/\/ 跳到最后一页，多出没事\n\t\t\t\tscrollTo(_itemList.size() * _lineHeight);\n\t\t\t} else if (nChar == VK_UP) {\n\t\t\t\t\/\/ 向上1行\n\t\t\t\tscrollLines(-1);\n\t\t\t} else if (nChar == VK_DOWN) {\n\t\t\t\t\/\/ 向下1行\n\t\t\t\tscrollLines(1);\n\t\t\t}\n\t\t}\n\t\tif (nChar == VK_PRIOR) {\n\t\t\t\/\/ 向上1页\n\t\t\tscrollPages(-1);\n\t\t} else if (nChar == VK_NEXT) {\n\t\t\t\/\/ 向下1页\n\t\t\tscrollPages(1);\n\t\t}\n\t}\n\tCScrollView::OnKeyDown(nChar, nRepCnt, nFlags);\n}\n\nvoid ListScrollView::OnLButtonUp(UINT nFlags, CPoint point) {\n\tint yScrollPos = GetScrollPosition().y;\n\tunsigned index = (yScrollPos + point.y) \/ _lineHeight;\n\n\tif (index < _itemList.size()) {\n\t\tsetSelectedIndex(index);\n\t}\n\n\tCScrollView::OnLButtonUp(nFlags, point);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"audiorecorder.h\"\n#include <QDebug>\n#include <QAudioDeviceInfo>\n#include <QDir>\n#include <QFileInfo>\n\nAudioRecorder::AudioRecorder(QQuickItem *parent):\n    QQuickItem(parent)\n  ,m_source(\"\")\n  ,m_codecIndex(0)\n{\n    m_supportedCodecs.clear();\n    \/\/ By default, QQuickItem does not draw anything. If you subclass\n    \/\/ QQuickItem to create a visual item, you will need to uncomment the\n    \/\/ following line and re-implement updatePaintNode()\n\n    \/\/ setFlag(ItemHasContents, true);\n\n    qDebug() << \"[AudioRecorder]created!!\";\n    this->initializeQAudioRecorder();\n}\n\nAudioRecorder::~AudioRecorder()\n{\n    if(m_audioRecorder)\n    {\n        delete m_audioRecorder;\n        m_audioRecorder = NULL;\n    }\n}\n\nvoid AudioRecorder::record(bool overWrite)\n{\n#ifdef defined Q_OS_MAC\n    m_source.remove(\"file:\/\/\");\n#endif\n    QFileInfo source(m_source);\n    QAudioEncoderSettings asettings = m_audioRecorder->audioSettings();\n    if(asettings.codec() == \"audio\/pcm\" || asettings.codec() == \"audio\/PCM\")\n    {\n        \/\/setFile seems to have bug on Windows\n        source.setFile(m_source + \".wav\");\n#if (defined Q_OS_LINUX) || (defined Q_OS_WIN)\n        \/\/added file extension\n        m_source += \".wav\";\n#endif\n    } else {\n        \/\/other formats are not tested on Mac and Windows\n        QString extension = \".\" + (asettings.codec()).remove(\"audio\/\");\n        source.setFile(m_source + extension);\n#if (defined Q_OS_LINUX) || (defined Q_OS_WIN)\n        m_source += extension;\n#endif\n    }\n    qDebug() << \"source.absoluteFilePath=\" << source.absoluteFilePath();\n    qDebug() << \"m_source=\" << m_source;\n    qDebug() << \"does file exists? -> \" << source.exists();\n    if(source.exists() && overWrite==false){\n        emit fileExists();\n        return;\n    }\n    m_audioRecorder->setOutputLocation(m_source);\n    \/\/setOutputLocation doesn't work on Qt5.2.0 for windows\n    qDebug() << \"outputLocation=\" << m_audioRecorder->outputLocation();\n    m_audioRecorder->record();\n}\n\nvoid AudioRecorder::stop()\n{\n    m_audioRecorder->stop();\n}\n\nint AudioRecorder::codec(){\n    return m_codecIndex;\n}\n\nvoid AudioRecorder::setCodec(int value){\n    if(m_codecIndex!=value){\n        m_codecIndex = value;\n        QAudioEncoderSettings audioSettings;\n        qDebug() << \"setCodec to \" << m_supportedCodecs[m_codecIndex];\n        audioSettings.setCodec(m_supportedCodecs[m_codecIndex]);\n        audioSettings.setQuality(QMultimedia::HighQuality);\n        m_audioRecorder->setEncodingSettings(audioSettings);\n        emit codecChanged();\n    }\n}\n\nvoid AudioRecorder::initializeQAudioRecorder()\n{\n    QStringList codecs;\n\n    QAudioDeviceInfo outDeviceInfo(QAudioDeviceInfo::defaultOutputDevice());\n    codecs = outDeviceInfo.supportedCodecs();\n    for (int i = 0; i < codecs.size(); ++i) {\n        qDebug() << \"out device supported codecs\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n    }\n    QAudioDeviceInfo inDeviceInfo(QAudioDeviceInfo::defaultInputDevice());\n\n    codecs = inDeviceInfo.supportedCodecs();\n    for (int i = 0; i < codecs.size(); ++i) {\n         qDebug() << \"in device supported codecs\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n    }\n\n\n    qDebug() << \"new QAudioRecorder\";\n    m_audioRecorder = new QAudioRecorder(this);\n\n    codecs = m_audioRecorder->supportedAudioCodecs();\n    for (int i = 0; i < codecs.size(); ++i){\n        m_supportedCodecs.append(codecs.at(i).toLocal8Bit().constData());\n        qDebug() << \"supported codecs\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n    }\n\n    QAudioEncoderSettings audioSettings;\n\/\/    audioSettings.setCodec(\"audio\/pcm\");\n    qDebug() << \"setCodec to \" << codecs.at(0).toLocal8Bit().constData();\n    audioSettings.setCodec(codecs.at(0).toLocal8Bit().constData());\n    audioSettings.setQuality(QMultimedia::HighQuality);\n\n    m_audioRecorder->setEncodingSettings(audioSettings);\n\n\n    qDebug() << \"current path is \" << QDir::currentPath();\n\n    QStringList inputs = m_audioRecorder->audioInputs();\n    QString selectedInput = m_audioRecorder->defaultAudioInput();\n\n\n\/\/    foreach (QString input, inputs) {\n\/\/        QString description = m_audioRecorder->audioInputDescription(input);\n\/\/        \/\/ show descriptions to user and allow selection\n\/\/        selectedInput = input;\n\/\/    }\n\n    m_audioRecorder->setAudioInput(selectedInput);\n\n\/\/    qDebug() << \"isMetaDataWritable is\" << m_audioRecorder->isMetaDataWritable();\n\/\/    m_audioRecorder->setMetaData(QMediaMetaData::Title, QVariant(QLatin1String(\"Test Title\")));\n\/\/    m_audioRecorder->setMetaData(QMediaMetaData::AlbumTitle, QVariant(QLatin1String(\"Album Title\")));\n\/\/    m_audioRecorder->setMetaData(QMediaMetaData::AlbumArtist, QVariant(QLatin1String(\"Album Artist\")));\n\/\/    codecs = m_audioRecorder->supportedAudioCodecs();\n\/\/    for (int i = 0; i < codecs.size(); ++i)\n\/\/         qDebug() << \"supported codecs\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n\/\/    codecs = m_audioRecorder->supportedAudioSampleRates();\n\/\/    for (int i = 0; i < codecs.size(); ++i)\n\/\/         qDebug() << \"supported sample rates\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n}\n\n<commit_msg>bug fixed. faild to record on Mac.<commit_after>#include \"audiorecorder.h\"\n#include <QDebug>\n#include <QAudioDeviceInfo>\n#include <QDir>\n#include <QFileInfo>\n\nAudioRecorder::AudioRecorder(QQuickItem *parent):\n    QQuickItem(parent)\n  ,m_source(\"\")\n  ,m_codecIndex(0)\n{\n    m_supportedCodecs.clear();\n    \/\/ By default, QQuickItem does not draw anything. If you subclass\n    \/\/ QQuickItem to create a visual item, you will need to uncomment the\n    \/\/ following line and re-implement updatePaintNode()\n\n    \/\/ setFlag(ItemHasContents, true);\n\n    qDebug() << \"[AudioRecorder]created!!\";\n    this->initializeQAudioRecorder();\n}\n\nAudioRecorder::~AudioRecorder()\n{\n    if(m_audioRecorder)\n    {\n        delete m_audioRecorder;\n        m_audioRecorder = NULL;\n    }\n}\n\nvoid AudioRecorder::record(bool overWrite)\n{\n#if defined Q_OS_MAC\n    m_source.remove(\"file:\/\/\");\n#endif\n    QFileInfo source(m_source);\n    QAudioEncoderSettings asettings = m_audioRecorder->audioSettings();\n    if(asettings.codec() == \"audio\/pcm\" || asettings.codec() == \"audio\/PCM\")\n    {\n        \/\/setFile seems to have bug on Windows\n        source.setFile(m_source + \".wav\");\n#if (defined Q_OS_LINUX) || (defined Q_OS_WIN)\n        \/\/added file extension\n        m_source += \".wav\";\n#endif\n    } else {\n        \/\/other formats are not tested on Mac and Windows\n        QString extension = \".\" + (asettings.codec()).remove(\"audio\/\");\n        source.setFile(m_source + extension);\n#if (defined Q_OS_LINUX) || (defined Q_OS_WIN)\n        m_source += extension;\n#endif\n    }\n    qDebug() << \"source.absoluteFilePath=\" << source.absoluteFilePath();\n    qDebug() << \"m_source=\" << m_source;\n    qDebug() << \"does file exists? -> \" << source.exists();\n    if(source.exists() && overWrite==false){\n        emit fileExists();\n        return;\n    }\n    m_audioRecorder->setOutputLocation(m_source);\n    \/\/setOutputLocation doesn't work on Qt5.2.0 for windows\n    qDebug() << \"outputLocation=\" << m_audioRecorder->outputLocation();\n    m_audioRecorder->record();\n}\n\nvoid AudioRecorder::stop()\n{\n    m_audioRecorder->stop();\n}\n\nint AudioRecorder::codec(){\n    return m_codecIndex;\n}\n\nvoid AudioRecorder::setCodec(int value){\n    if(m_codecIndex!=value){\n        m_codecIndex = value;\n        QAudioEncoderSettings audioSettings;\n        qDebug() << \"setCodec to \" << m_supportedCodecs[m_codecIndex];\n        audioSettings.setCodec(m_supportedCodecs[m_codecIndex]);\n        audioSettings.setQuality(QMultimedia::HighQuality);\n        m_audioRecorder->setEncodingSettings(audioSettings);\n        emit codecChanged();\n    }\n}\n\nvoid AudioRecorder::initializeQAudioRecorder()\n{\n    QStringList codecs;\n\n    QAudioDeviceInfo outDeviceInfo(QAudioDeviceInfo::defaultOutputDevice());\n    codecs = outDeviceInfo.supportedCodecs();\n    for (int i = 0; i < codecs.size(); ++i) {\n        qDebug() << \"out device supported codecs\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n    }\n    QAudioDeviceInfo inDeviceInfo(QAudioDeviceInfo::defaultInputDevice());\n\n    codecs = inDeviceInfo.supportedCodecs();\n    for (int i = 0; i < codecs.size(); ++i) {\n         qDebug() << \"in device supported codecs\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n    }\n\n\n    qDebug() << \"new QAudioRecorder\";\n    m_audioRecorder = new QAudioRecorder(this);\n\n    codecs = m_audioRecorder->supportedAudioCodecs();\n    for (int i = 0; i < codecs.size(); ++i){\n        m_supportedCodecs.append(codecs.at(i).toLocal8Bit().constData());\n        qDebug() << \"supported codecs\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n    }\n\n    QAudioEncoderSettings audioSettings;\n\/\/    audioSettings.setCodec(\"audio\/pcm\");\n    qDebug() << \"setCodec to \" << codecs.at(0).toLocal8Bit().constData();\n    audioSettings.setCodec(codecs.at(0).toLocal8Bit().constData());\n    audioSettings.setQuality(QMultimedia::HighQuality);\n\n    m_audioRecorder->setEncodingSettings(audioSettings);\n\n\n    qDebug() << \"current path is \" << QDir::currentPath();\n\n    QStringList inputs = m_audioRecorder->audioInputs();\n    QString selectedInput = m_audioRecorder->defaultAudioInput();\n\n\n\/\/    foreach (QString input, inputs) {\n\/\/        QString description = m_audioRecorder->audioInputDescription(input);\n\/\/        \/\/ show descriptions to user and allow selection\n\/\/        selectedInput = input;\n\/\/    }\n\n    m_audioRecorder->setAudioInput(selectedInput);\n\n\/\/    qDebug() << \"isMetaDataWritable is\" << m_audioRecorder->isMetaDataWritable();\n\/\/    m_audioRecorder->setMetaData(QMediaMetaData::Title, QVariant(QLatin1String(\"Test Title\")));\n\/\/    m_audioRecorder->setMetaData(QMediaMetaData::AlbumTitle, QVariant(QLatin1String(\"Album Title\")));\n\/\/    m_audioRecorder->setMetaData(QMediaMetaData::AlbumArtist, QVariant(QLatin1String(\"Album Artist\")));\n\/\/    codecs = m_audioRecorder->supportedAudioCodecs();\n\/\/    for (int i = 0; i < codecs.size(); ++i)\n\/\/         qDebug() << \"supported codecs\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n\/\/    codecs = m_audioRecorder->supportedAudioSampleRates();\n\/\/    for (int i = 0; i < codecs.size(); ++i)\n\/\/         qDebug() << \"supported sample rates\" << i << codecs.at(i).toLocal8Bit().constData() << endl;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ActorConfigurationParser.h\"\n#include \"json.h\"\n\n#include \"..\/Action.h\"\n#include \"..\/Actor.h\"\n#include \"..\/JITRotation.h\"\n#include \"..\/Simulation.h\"\n\n#include \"..\/models\/Monk.h\"\n\n#include <memory>\n#include <cstring>\n#include <map>\n\n#include <inttypes.h>\n\nnamespace applications {\n\nint SingleJSON(int argc, const char* argv[]) {\n\tif (argc < 3) {\n\t\tprintf(\"Usage: simulator single-json subject rotation length [seed]\\n\");\n\t\treturn 1;\n\t}\n\t\n\tActorConfigurationParser subjectParser;\n\tif (!subjectParser.parseFile(argv[0])) {\n\t\tprintf(\"Unable to read configuration.\\n\");\n\t\treturn 1;\n\t}\n\t\n\tJITRotation subjectRotation;\n\tif (!subjectRotation.initializeWithFile(argv[1])) {\n\t\tprintf(\"Unable to read rotation.\\n\");\n\t\treturn 1;\n\t}\n\n\tauto& subjectConfiguration = subjectParser.configuration();\n\tsubjectConfiguration.identifier = \"player\";\n\tsubjectConfiguration.rotation = &subjectRotation;\n\tsubjectConfiguration.keepsHistory = true;\n\n\tif (subjectConfiguration.petConfiguration) {\n\t\tauto petConfiguration = *subjectConfiguration.petConfiguration;\n\t\tpetConfiguration.identifier = \"player-pet\";\n\t\tpetConfiguration.keepsHistory = subjectConfiguration.keepsHistory;\n\t}\n\n\tmodels::Monk targetModel;\n\tActor::Configuration targetConfiguration;\n\ttargetConfiguration.identifier = \"target\";\n\ttargetConfiguration.model = &targetModel;\n\ttargetConfiguration.keepsHistory = true;\n\n\tint simulationSeconds = atoi(argv[2]);\n\n\tSimulation::Configuration configuration;\n\tconfiguration.length = std::chrono::seconds(simulationSeconds);\n\tconfiguration.subjectConfiguration = &subjectConfiguration;\n\tconfiguration.targetConfiguration = &targetConfiguration;\n\n\tuint64_t seed = 0;\n\n\tif (argc < 4) {\n\t\tstd::random_device rd;\n\t\tstd::uniform_int_distribution<uint64_t> dist;\n\t\tseed = dist(rd);\n\t} else {\n\t\tseed = strtoull(argv[3], nullptr, 0);\n\t}\n\n\tSimulation simulation(&configuration, seed);\n\tsimulation.run();\n\t\n\tActor::SimulationStats mergedStats;\n\tstd::map<std::string, Actor::EffectSimulationStats> mergedEffectStats;\n\n\tfor (auto& subject : simulation.subjects()) {\n\t\tmergedStats += subject->simulationStats();\n\t\tfor (auto& kv : subject->effectSimulationStats()) {\n\t\t\tmergedEffectStats[kv.first] += kv.second;\n\t\t}\n\t}\n\n\tprintf(\"{\");\n\n\tJSONPrint(\"seed\"); printf(\":\"); JSONPrint(std::to_string(seed)); printf(\",\");\n\tJSONPrint(\"time\"); printf(\":\"); JSONPrint(configuration.length); printf(\",\");\n\tJSONPrint(\"damage\"); printf(\":\"); JSONPrint(mergedStats.damageDealt); printf(\",\");\n\n\tprintf(\"\\\"subjects\\\":{\");\n\n\tbool firstSubject = true;\n\tfor (auto& subject : simulation.subjects()) {\n\t\tif (!firstSubject) { printf(\",\"); }\n\t\tfirstSubject = false;\n\n\t\tJSONPrint(subject->identifier());\n\t\tprintf(\":\");\n\t\t\n\t\tauto& simStats = subject->simulationStats();\n\n\t\tJSONPrintDict(\n\t\t\t\"model\", subject->model()->identifier(),\n\t\t\t\"owner\", subject->owner() ? subject->owner()->identifier().c_str() : nullptr,\n\t\t\t\"stats\", subject->configuration()->stats,\n\t\t\t\"damage\", simStats.damageDealt,\n\t\t\t\"effects\", subject->effectSimulationStats(),\n\t\t\t\"tp-samples\", simStats.tpSamples,\n\t\t\t\"mp-samples\", simStats.mpSamples,\n\t\t\t\"actions\", simStats.actions,\n\t\t\t\"auras\", simStats.auraSamples\n\t\t);\n\t}\n\n\tprintf(\"}\");\n\n\tprintf(\"}\");\n\n\tprintf(\"\\n\");\n\n\treturn 0;\n}\n\n}<commit_msg>allow floating point length<commit_after>#include \"ActorConfigurationParser.h\"\n#include \"json.h\"\n\n#include \"..\/Action.h\"\n#include \"..\/Actor.h\"\n#include \"..\/JITRotation.h\"\n#include \"..\/Simulation.h\"\n\n#include \"..\/models\/Monk.h\"\n\n#include <chrono>\n#include <memory>\n#include <cstring>\n#include <map>\n\n#include <inttypes.h>\n\nnamespace applications {\n\nint SingleJSON(int argc, const char* argv[]) {\n\tif (argc < 3) {\n\t\tprintf(\"Usage: simulator single-json subject rotation length [seed]\\n\");\n\t\treturn 1;\n\t}\n\t\n\tActorConfigurationParser subjectParser;\n\tif (!subjectParser.parseFile(argv[0])) {\n\t\tprintf(\"Unable to read configuration.\\n\");\n\t\treturn 1;\n\t}\n\t\n\tJITRotation subjectRotation;\n\tif (!subjectRotation.initializeWithFile(argv[1])) {\n\t\tprintf(\"Unable to read rotation.\\n\");\n\t\treturn 1;\n\t}\n\n\tauto& subjectConfiguration = subjectParser.configuration();\n\tsubjectConfiguration.identifier = \"player\";\n\tsubjectConfiguration.rotation = &subjectRotation;\n\tsubjectConfiguration.keepsHistory = true;\n\n\tif (subjectConfiguration.petConfiguration) {\n\t\tauto petConfiguration = *subjectConfiguration.petConfiguration;\n\t\tpetConfiguration.identifier = \"player-pet\";\n\t\tpetConfiguration.keepsHistory = subjectConfiguration.keepsHistory;\n\t}\n\n\tmodels::Monk targetModel;\n\tActor::Configuration targetConfiguration;\n\ttargetConfiguration.identifier = \"target\";\n\ttargetConfiguration.model = &targetModel;\n\ttargetConfiguration.keepsHistory = true;\n\n\tstd::chrono::duration<double> simulationSeconds(strtod(argv[2], nullptr));\n\n\tSimulation::Configuration configuration;\n\tconfiguration.length = std::chrono::duration_cast<std::chrono::microseconds>(simulationSeconds);\n\tconfiguration.subjectConfiguration = &subjectConfiguration;\n\tconfiguration.targetConfiguration = &targetConfiguration;\n\n\tuint64_t seed = 0;\n\n\tif (argc < 4) {\n\t\tstd::random_device rd;\n\t\tstd::uniform_int_distribution<uint64_t> dist;\n\t\tseed = dist(rd);\n\t} else {\n\t\tseed = strtoull(argv[3], nullptr, 0);\n\t}\n\n\tSimulation simulation(&configuration, seed);\n\tsimulation.run();\n\t\n\tActor::SimulationStats mergedStats;\n\tstd::map<std::string, Actor::EffectSimulationStats> mergedEffectStats;\n\n\tfor (auto& subject : simulation.subjects()) {\n\t\tmergedStats += subject->simulationStats();\n\t\tfor (auto& kv : subject->effectSimulationStats()) {\n\t\t\tmergedEffectStats[kv.first] += kv.second;\n\t\t}\n\t}\n\n\tprintf(\"{\");\n\n\tJSONPrint(\"seed\"); printf(\":\"); JSONPrint(std::to_string(seed)); printf(\",\");\n\tJSONPrint(\"time\"); printf(\":\"); JSONPrint(configuration.length); printf(\",\");\n\tJSONPrint(\"damage\"); printf(\":\"); JSONPrint(mergedStats.damageDealt); printf(\",\");\n\n\tprintf(\"\\\"subjects\\\":{\");\n\n\tbool firstSubject = true;\n\tfor (auto& subject : simulation.subjects()) {\n\t\tif (!firstSubject) { printf(\",\"); }\n\t\tfirstSubject = false;\n\n\t\tJSONPrint(subject->identifier());\n\t\tprintf(\":\");\n\t\t\n\t\tauto& simStats = subject->simulationStats();\n\n\t\tJSONPrintDict(\n\t\t\t\"model\", subject->model()->identifier(),\n\t\t\t\"owner\", subject->owner() ? subject->owner()->identifier().c_str() : nullptr,\n\t\t\t\"stats\", subject->configuration()->stats,\n\t\t\t\"damage\", simStats.damageDealt,\n\t\t\t\"effects\", subject->effectSimulationStats(),\n\t\t\t\"tp-samples\", simStats.tpSamples,\n\t\t\t\"mp-samples\", simStats.mpSamples,\n\t\t\t\"actions\", simStats.actions,\n\t\t\t\"auras\", simStats.auraSamples\n\t\t);\n\t}\n\n\tprintf(\"}\");\n\n\tprintf(\"}\");\n\n\tprintf(\"\\n\");\n\n\treturn 0;\n}\n\n}<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <cassert>\n#include <chrono>\n#include <cstdint>\n#include <iostream>\n#include <iterator>\n#include <string>\n#include <utility>\n#include <vector>\n#include <cpp-sort\/sorters.h>\n#include \"distributions.h\"\n\n#ifdef _WIN32\n    #include <intrin.h>\n    #define rdtsc __rdtsc\n#else\n    #ifdef __i586__\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<template<typename...> class Collection, typename T>\nusing distr_f = void (*)(std::back_insert_iterator<Collection<T>>, std::size_t);\n\ntemplate<template<typename...> class Collection, typename T>\nusing sort_f = void (*)(Collection<T>&);\n\n\/\/ Type of data to sort during the benchmark\nusing value_t = int;\n\nint main()\n{\n    using namespace std::chrono_literals;\n\n    std::pair<std::string, distr_f<std::vector, value_t>> distributions[] = {\n        { \"shuffled\",               shuffled()              },\n        { \"shuffled_16_values\",     shuffled_16_values()    },\n        { \"all_equal\",              all_equal()             },\n        { \"ascending\",              ascending()             },\n        { \"descending\",             descending()            },\n        { \"pipe_organ\",             pipe_organ()            },\n        { \"push_front\",             push_front()            },\n        { \"push_middle\",            push_middle()           },\n        { \"ascending_sawtooth\",     ascending_sawtooth()    },\n        { \"descending_sawtooth\",    descending_sawtooth()   },\n        { \"alternating\",            alternating()           },\n        { \"alternating_16_values\",  alternating_16_values() }\n    };\n\n    std::pair<std::string, sort_f<std::vector, value_t>> sorts[] = {\n        { \"heap_sort\",      cppsort::heap_sort      },\n        { \"pdq_sort\",       cppsort::pdq_sort       },\n        { \"quick_sort\",     cppsort::quick_sort     },\n        { \"spread_sort\",    cppsort::spread_sort    },\n        { \"std_sort\",       cppsort::std_sort       },\n        { \"verge_sort\",     cppsort::verge_sort     }\n    };\n\n    std::size_t sizes[] = { 1'000'000 };\n\n    for (auto& distribution: distributions) {\n        for (auto& sort: sorts) {\n            for (auto size: sizes) {\n                std::vector<std::uint64_t> cycles;\n\n                auto total_start = std::chrono::high_resolution_clock::now();\n                auto total_end = std::chrono::high_resolution_clock::now();\n                while (std::chrono::duration_cast<std::chrono::seconds>(total_end - total_start) < 5s) {\n                    std::vector<value_t> collection;\n                    distribution.second(std::back_inserter(collection), size);\n                    std::uint64_t start = rdtsc();\n                    sort.second(collection);\n                    std::uint64_t end = rdtsc();\n                    assert(std::is_sorted(std::begin(collection), std::end(collection)));\n                    cycles.push_back(double(end - start) \/ size + 0.5);\n                    total_end = std::chrono::high_resolution_clock::now();\n                }\n\n                std::sort(std::begin(cycles), std::end(cycles));\n\n                std::cerr << size << ' ' << distribution.first << ' ' << sort.first\n                          << ' ' << cycles[cycles.size() \/ 2] << '\\n';\n                std::cout << size << ' ' << distribution.first << ' ' << sort.first\n                          << ' ' << cycles[cycles.size() \/ 2] << '\\n';\n            }\n        }\n    }\n}\n<commit_msg>Make sure to always use a steady clock in benchmarks<commit_after>#include <algorithm>\n#include <cassert>\n#include <chrono>\n#include <cstddef>\n#include <cstdint>\n#include <iostream>\n#include <iterator>\n#include <string>\n#include <type_traits>\n#include <utility>\n#include <vector>\n#include <cpp-sort\/sorters.h>\n#include \"distributions.h\"\n\n#ifdef _WIN32\n    #include <intrin.h>\n    #define rdtsc __rdtsc\n#else\n    #ifdef __i586__\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<template<typename...> class Collection, typename T>\nusing distr_f = void (*)(std::back_insert_iterator<Collection<T>>, std::size_t);\n\ntemplate<template<typename...> class Collection, typename T>\nusing sort_f = void (*)(Collection<T>&);\n\n\/\/ Type of data to sort during the benchmark\nusing value_t = int;\n\nint main()\n{\n    using namespace std::chrono_literals;\n\n    \/\/ Always use a steady clock\n    using clock_type = std::conditional_t<\n        std::chrono::high_resolution_clock::is_steady,\n        std::chrono::high_resolution_clock,\n        std::chrono::steady_clock\n    >;\n\n    std::pair<std::string, distr_f<std::vector, value_t>> distributions[] = {\n        { \"shuffled\",               shuffled()              },\n        { \"shuffled_16_values\",     shuffled_16_values()    },\n        { \"all_equal\",              all_equal()             },\n        { \"ascending\",              ascending()             },\n        { \"descending\",             descending()            },\n        { \"pipe_organ\",             pipe_organ()            },\n        { \"push_front\",             push_front()            },\n        { \"push_middle\",            push_middle()           },\n        { \"ascending_sawtooth\",     ascending_sawtooth()    },\n        { \"descending_sawtooth\",    descending_sawtooth()   },\n        { \"alternating\",            alternating()           },\n        { \"alternating_16_values\",  alternating_16_values() }\n    };\n\n    std::pair<std::string, sort_f<std::vector, value_t>> sorts[] = {\n        { \"heap_sort\",      cppsort::heap_sort      },\n        { \"pdq_sort\",       cppsort::pdq_sort       },\n        { \"quick_sort\",     cppsort::quick_sort     },\n        { \"spread_sort\",    cppsort::spread_sort    },\n        { \"std_sort\",       cppsort::std_sort       },\n        { \"verge_sort\",     cppsort::verge_sort     }\n    };\n\n    std::size_t sizes[] = { 1'000'000 };\n\n    for (auto& distribution: distributions) {\n        for (auto& sort: sorts) {\n            for (auto size: sizes) {\n                std::vector<std::uint64_t> cycles;\n\n                auto total_start = clock_type::now();\n                auto total_end = clock_type::now();\n                while (std::chrono::duration_cast<std::chrono::seconds>(total_end - total_start) < 5s) {\n                    std::vector<value_t> collection;\n                    distribution.second(std::back_inserter(collection), size);\n                    std::uint64_t start = rdtsc();\n                    sort.second(collection);\n                    std::uint64_t end = rdtsc();\n                    assert(std::is_sorted(std::begin(collection), std::end(collection)));\n                    cycles.push_back(double(end - start) \/ size + 0.5);\n                    total_end = clock_type::now();\n                }\n\n                std::sort(std::begin(cycles), std::end(cycles));\n\n                std::cerr << size << ' ' << distribution.first << ' ' << sort.first\n                          << ' ' << cycles[cycles.size() \/ 2] << '\\n';\n                std::cout << size << ' ' << distribution.first << ' ' << sort.first\n                          << ' ' << cycles[cycles.size() \/ 2] << '\\n';\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright 2015 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\n\/\/ TextureGL.cpp: Implements the class methods for TextureGL.\n\n#include \"libANGLE\/renderer\/gl\/TextureGL.h\"\n\n#include \"common\/debug.h\"\n#include \"common\/utilities.h\"\n#include \"libANGLE\/State.h\"\n#include \"libANGLE\/angletypes.h\"\n#include \"libANGLE\/formatutils.h\"\n#include \"libANGLE\/renderer\/gl\/BufferGL.h\"\n#include \"libANGLE\/renderer\/gl\/FunctionsGL.h\"\n#include \"libANGLE\/renderer\/gl\/StateManagerGL.h\"\n\nnamespace rx\n{\n\nstatic void SetUnpackStateForTexImage(StateManagerGL *stateManager, const gl::PixelUnpackState &unpack)\n{\n    const gl::Buffer *unpackBuffer = unpack.pixelBuffer.get();\n    if (unpackBuffer != nullptr)\n    {\n        UNIMPLEMENTED();\n    }\n    if (unpack.skipRows != 0 || unpack.skipPixels != 0 || unpack.imageHeight != 0 || unpack.skipImages != 0)\n    {\n        UNIMPLEMENTED();\n    }\n    stateManager->setPixelUnpackState(unpack.alignment, unpack.rowLength);\n}\n\nstatic bool UseTexImage2D(GLenum textureType)\n{\n    return textureType == GL_TEXTURE_2D || textureType == GL_TEXTURE_CUBE_MAP;\n}\n\nstatic bool UseTexImage3D(GLenum textureType)\n{\n    return textureType == GL_TEXTURE_2D_ARRAY || textureType == GL_TEXTURE_3D;\n}\n\nstatic bool CompatibleTextureTarget(GLenum textureType, GLenum textureTarget)\n{\n    if (textureType != GL_TEXTURE_CUBE_MAP)\n    {\n        return textureType == textureTarget;\n    }\n    else\n    {\n        return gl::IsCubeMapTextureTarget(textureType);\n    }\n}\n\nTextureGL::TextureGL(GLenum type, const FunctionsGL *functions, StateManagerGL *stateManager)\n    : TextureImpl(),\n      mTextureType(type),\n      mFunctions(functions),\n      mStateManager(stateManager),\n      mAppliedSamplerState(),\n      mTextureID(0)\n{\n    ASSERT(mFunctions);\n    ASSERT(mStateManager);\n\n    mFunctions->genTextures(1, &mTextureID);\n}\n\nTextureGL::~TextureGL()\n{\n    if (mTextureID)\n    {\n        mFunctions->deleteTextures(1, &mTextureID);\n        mTextureID = 0;\n    }\n}\n\nvoid TextureGL::setUsage(GLenum usage)\n{\n    \/\/ GL_ANGLE_texture_usage not implemented for desktop GL\n    UNREACHABLE();\n}\n\ngl::Error TextureGL::setImage(GLenum target, size_t level, GLenum internalFormat, const gl::Extents &size, GLenum format, GLenum type,\n                              const gl::PixelUnpackState &unpack, const uint8_t *pixels)\n{\n    (void)&CompatibleTextureTarget; \/\/ Reference this function to avoid warnings.\n    ASSERT(CompatibleTextureTarget(mTextureType, target));\n\n    SetUnpackStateForTexImage(mStateManager, unpack);\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(size.depth == 1);\n        mFunctions->texImage2D(target, level, internalFormat, size.width, size.height, 0, format, type, pixels);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->texImage3D(target, level, internalFormat, size.width, size.height, size.depth, 0, format, type, pixels);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::setSubImage(GLenum target, size_t level, const gl::Box &area, GLenum format, GLenum type,\n                                 const gl::PixelUnpackState &unpack, const uint8_t *pixels)\n{\n    ASSERT(CompatibleTextureTarget(mTextureType, target));\n\n    SetUnpackStateForTexImage(mStateManager, unpack);\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(area.z == 0 && area.depth == 1);\n        mFunctions->texSubImage2D(target, level, area.x, area.y, area.width, area.height, format, type, pixels);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->texSubImage3D(target, level, area.x, area.y, area.z, area.width, area.height, area.depth,\n                                  format, type, pixels);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::setCompressedImage(GLenum target, size_t level, GLenum internalFormat, const gl::Extents &size,\n                                        const gl::PixelUnpackState &unpack, const uint8_t *pixels)\n{\n    ASSERT(CompatibleTextureTarget(mTextureType, target));\n\n    SetUnpackStateForTexImage(mStateManager, unpack);\n\n    const gl::InternalFormat &internalFormatInfo = gl::GetInternalFormatInfo(internalFormat);\n    size_t depthPitch = internalFormatInfo.computeDepthPitch(GL_UNSIGNED_BYTE, size.width, size.height,\n                                                             unpack.alignment, unpack.rowLength);\n    size_t dataSize = internalFormatInfo.computeBlockSize(GL_UNSIGNED_BYTE, size.width, size.height) * depthPitch;\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(size.depth == 1);\n        mFunctions->compressedTexImage2D(target, level, internalFormat, size.width, size.height, 0, dataSize, pixels);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->compressedTexImage3D(target, level, internalFormat, size.width, size.height, size.depth, 0,\n                                         dataSize, pixels);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::setCompressedSubImage(GLenum target, size_t level, const gl::Box &area, GLenum format,\n                                           const gl::PixelUnpackState &unpack, const uint8_t *pixels)\n{\n    ASSERT(CompatibleTextureTarget(mTextureType, target));\n\n    SetUnpackStateForTexImage(mStateManager, unpack);\n\n    const gl::InternalFormat &internalFormatInfo = gl::GetInternalFormatInfo(format);\n    size_t depthPitch = internalFormatInfo.computeDepthPitch(GL_UNSIGNED_BYTE, area.width, area.height,\n                                                             unpack.alignment, unpack.rowLength);\n    size_t dataSize = internalFormatInfo.computeBlockSize(GL_UNSIGNED_BYTE, area.width, area.height) * depthPitch;\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(area.z == 0 && area.depth == 1);\n        mFunctions->compressedTexSubImage2D(target, level, area.x, area.y, area.width, area.height, format, dataSize,\n                                            pixels);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->compressedTexSubImage3D(target, level, area.x, area.y, area.z, area.width, area.height, area.depth,\n                                            format, dataSize, pixels);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::copyImage(GLenum target, size_t level, const gl::Rectangle &sourceArea, GLenum internalFormat,\n                               const gl::Framebuffer *source)\n{\n    UNIMPLEMENTED();\n    return gl::Error(GL_INVALID_OPERATION);\n}\n\ngl::Error TextureGL::copySubImage(GLenum target, size_t level, const gl::Offset &destOffset, const gl::Rectangle &sourceArea,\n                                  const gl::Framebuffer *source)\n{\n    UNIMPLEMENTED();\n    return gl::Error(GL_INVALID_OPERATION);\n}\n\ngl::Error TextureGL::setStorage(GLenum target, size_t levels, GLenum internalFormat, const gl::Extents &size)\n{\n    \/\/ TODO: emulate texture storage with TexImage calls if on GL version <4.2 or the\n    \/\/ ARB_texture_storage extension is not available.\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(size.depth == 1);\n        mFunctions->texStorage2D(target, levels, internalFormat, size.width, size.height);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->texStorage3D(target, levels, internalFormat, size.width, size.height, size.depth);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::generateMipmaps()\n{\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    mFunctions->generateMipmap(mTextureType);\n    return gl::Error(GL_NO_ERROR);\n}\n\nvoid TextureGL::bindTexImage(egl::Surface *surface)\n{\n    UNIMPLEMENTED();\n}\n\nvoid TextureGL::releaseTexImage()\n{\n    UNIMPLEMENTED();\n}\n\ntemplate <typename T>\nstatic inline void SyncSamplerStateMember(const FunctionsGL *functions, const gl::SamplerState &newState,\n                                          gl::SamplerState &curState, GLenum textureType, GLenum name,\n                                          T(gl::SamplerState::*samplerMember))\n{\n    if (curState.*samplerMember != newState.*samplerMember)\n    {\n        curState.*samplerMember = newState.*samplerMember;\n        functions->texParameterf(textureType, name, curState.*samplerMember);\n    }\n}\n\nvoid TextureGL::syncSamplerState(const gl::SamplerState &samplerState) const\n{\n    if (mAppliedSamplerState != samplerState)\n    {\n        mStateManager->bindTexture(mTextureType, mTextureID);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MIN_FILTER, &gl::SamplerState::minFilter);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MAG_FILTER, &gl::SamplerState::magFilter);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_WRAP_S, &gl::SamplerState::wrapS);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_WRAP_T, &gl::SamplerState::wrapT);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_WRAP_R, &gl::SamplerState::wrapR);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MAX_ANISOTROPY_EXT, &gl::SamplerState::maxAnisotropy);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_BASE_LEVEL, &gl::SamplerState::baseLevel);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MAX_LEVEL, &gl::SamplerState::maxLevel);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MIN_LOD, &gl::SamplerState::minLod);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MAX_LOD, &gl::SamplerState::maxLod);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_COMPARE_MODE, &gl::SamplerState::compareMode);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_COMPARE_FUNC, &gl::SamplerState::compareFunc);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_SWIZZLE_R, &gl::SamplerState::swizzleRed);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_SWIZZLE_G, &gl::SamplerState::swizzleGreen);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_SWIZZLE_B, &gl::SamplerState::swizzleBlue);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_SWIZZLE_A, &gl::SamplerState::swizzleAlpha);\n    }\n}\n\nGLuint TextureGL::getTextureID() const\n{\n    return mTextureID;\n}\n\n}\n<commit_msg>Fix incorrect assertion.<commit_after>\/\/\n\/\/ Copyright 2015 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\n\/\/ TextureGL.cpp: Implements the class methods for TextureGL.\n\n#include \"libANGLE\/renderer\/gl\/TextureGL.h\"\n\n#include \"common\/debug.h\"\n#include \"common\/utilities.h\"\n#include \"libANGLE\/State.h\"\n#include \"libANGLE\/angletypes.h\"\n#include \"libANGLE\/formatutils.h\"\n#include \"libANGLE\/renderer\/gl\/BufferGL.h\"\n#include \"libANGLE\/renderer\/gl\/FunctionsGL.h\"\n#include \"libANGLE\/renderer\/gl\/StateManagerGL.h\"\n\nnamespace rx\n{\n\nstatic void SetUnpackStateForTexImage(StateManagerGL *stateManager, const gl::PixelUnpackState &unpack)\n{\n    const gl::Buffer *unpackBuffer = unpack.pixelBuffer.get();\n    if (unpackBuffer != nullptr)\n    {\n        UNIMPLEMENTED();\n    }\n    if (unpack.skipRows != 0 || unpack.skipPixels != 0 || unpack.imageHeight != 0 || unpack.skipImages != 0)\n    {\n        UNIMPLEMENTED();\n    }\n    stateManager->setPixelUnpackState(unpack.alignment, unpack.rowLength);\n}\n\nstatic bool UseTexImage2D(GLenum textureType)\n{\n    return textureType == GL_TEXTURE_2D || textureType == GL_TEXTURE_CUBE_MAP;\n}\n\nstatic bool UseTexImage3D(GLenum textureType)\n{\n    return textureType == GL_TEXTURE_2D_ARRAY || textureType == GL_TEXTURE_3D;\n}\n\nstatic bool CompatibleTextureTarget(GLenum textureType, GLenum textureTarget)\n{\n    if (textureType != GL_TEXTURE_CUBE_MAP)\n    {\n        return textureType == textureTarget;\n    }\n    else\n    {\n        return gl::IsCubeMapTextureTarget(textureTarget);\n    }\n}\n\nTextureGL::TextureGL(GLenum type, const FunctionsGL *functions, StateManagerGL *stateManager)\n    : TextureImpl(),\n      mTextureType(type),\n      mFunctions(functions),\n      mStateManager(stateManager),\n      mAppliedSamplerState(),\n      mTextureID(0)\n{\n    ASSERT(mFunctions);\n    ASSERT(mStateManager);\n\n    mFunctions->genTextures(1, &mTextureID);\n}\n\nTextureGL::~TextureGL()\n{\n    if (mTextureID)\n    {\n        mFunctions->deleteTextures(1, &mTextureID);\n        mTextureID = 0;\n    }\n}\n\nvoid TextureGL::setUsage(GLenum usage)\n{\n    \/\/ GL_ANGLE_texture_usage not implemented for desktop GL\n    UNREACHABLE();\n}\n\ngl::Error TextureGL::setImage(GLenum target, size_t level, GLenum internalFormat, const gl::Extents &size, GLenum format, GLenum type,\n                              const gl::PixelUnpackState &unpack, const uint8_t *pixels)\n{\n    UNUSED_ASSERTION_VARIABLE(&CompatibleTextureTarget); \/\/ Reference this function to avoid warnings.\n    ASSERT(CompatibleTextureTarget(mTextureType, target));\n\n    SetUnpackStateForTexImage(mStateManager, unpack);\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(size.depth == 1);\n        mFunctions->texImage2D(target, level, internalFormat, size.width, size.height, 0, format, type, pixels);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->texImage3D(target, level, internalFormat, size.width, size.height, size.depth, 0, format, type, pixels);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::setSubImage(GLenum target, size_t level, const gl::Box &area, GLenum format, GLenum type,\n                                 const gl::PixelUnpackState &unpack, const uint8_t *pixels)\n{\n    ASSERT(CompatibleTextureTarget(mTextureType, target));\n\n    SetUnpackStateForTexImage(mStateManager, unpack);\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(area.z == 0 && area.depth == 1);\n        mFunctions->texSubImage2D(target, level, area.x, area.y, area.width, area.height, format, type, pixels);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->texSubImage3D(target, level, area.x, area.y, area.z, area.width, area.height, area.depth,\n                                  format, type, pixels);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::setCompressedImage(GLenum target, size_t level, GLenum internalFormat, const gl::Extents &size,\n                                        const gl::PixelUnpackState &unpack, const uint8_t *pixels)\n{\n    ASSERT(CompatibleTextureTarget(mTextureType, target));\n\n    SetUnpackStateForTexImage(mStateManager, unpack);\n\n    const gl::InternalFormat &internalFormatInfo = gl::GetInternalFormatInfo(internalFormat);\n    size_t depthPitch = internalFormatInfo.computeDepthPitch(GL_UNSIGNED_BYTE, size.width, size.height,\n                                                             unpack.alignment, unpack.rowLength);\n    size_t dataSize = internalFormatInfo.computeBlockSize(GL_UNSIGNED_BYTE, size.width, size.height) * depthPitch;\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(size.depth == 1);\n        mFunctions->compressedTexImage2D(target, level, internalFormat, size.width, size.height, 0, dataSize, pixels);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->compressedTexImage3D(target, level, internalFormat, size.width, size.height, size.depth, 0,\n                                         dataSize, pixels);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::setCompressedSubImage(GLenum target, size_t level, const gl::Box &area, GLenum format,\n                                           const gl::PixelUnpackState &unpack, const uint8_t *pixels)\n{\n    ASSERT(CompatibleTextureTarget(mTextureType, target));\n\n    SetUnpackStateForTexImage(mStateManager, unpack);\n\n    const gl::InternalFormat &internalFormatInfo = gl::GetInternalFormatInfo(format);\n    size_t depthPitch = internalFormatInfo.computeDepthPitch(GL_UNSIGNED_BYTE, area.width, area.height,\n                                                             unpack.alignment, unpack.rowLength);\n    size_t dataSize = internalFormatInfo.computeBlockSize(GL_UNSIGNED_BYTE, area.width, area.height) * depthPitch;\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(area.z == 0 && area.depth == 1);\n        mFunctions->compressedTexSubImage2D(target, level, area.x, area.y, area.width, area.height, format, dataSize,\n                                            pixels);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->compressedTexSubImage3D(target, level, area.x, area.y, area.z, area.width, area.height, area.depth,\n                                            format, dataSize, pixels);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::copyImage(GLenum target, size_t level, const gl::Rectangle &sourceArea, GLenum internalFormat,\n                               const gl::Framebuffer *source)\n{\n    UNIMPLEMENTED();\n    return gl::Error(GL_INVALID_OPERATION);\n}\n\ngl::Error TextureGL::copySubImage(GLenum target, size_t level, const gl::Offset &destOffset, const gl::Rectangle &sourceArea,\n                                  const gl::Framebuffer *source)\n{\n    UNIMPLEMENTED();\n    return gl::Error(GL_INVALID_OPERATION);\n}\n\ngl::Error TextureGL::setStorage(GLenum target, size_t levels, GLenum internalFormat, const gl::Extents &size)\n{\n    \/\/ TODO: emulate texture storage with TexImage calls if on GL version <4.2 or the\n    \/\/ ARB_texture_storage extension is not available.\n\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    if (UseTexImage2D(mTextureType))\n    {\n        ASSERT(size.depth == 1);\n        mFunctions->texStorage2D(target, levels, internalFormat, size.width, size.height);\n    }\n    else if (UseTexImage3D(mTextureType))\n    {\n        mFunctions->texStorage3D(target, levels, internalFormat, size.width, size.height, size.depth);\n    }\n    else\n    {\n        UNREACHABLE();\n    }\n\n    return gl::Error(GL_NO_ERROR);\n}\n\ngl::Error TextureGL::generateMipmaps()\n{\n    mStateManager->bindTexture(mTextureType, mTextureID);\n    mFunctions->generateMipmap(mTextureType);\n    return gl::Error(GL_NO_ERROR);\n}\n\nvoid TextureGL::bindTexImage(egl::Surface *surface)\n{\n    UNIMPLEMENTED();\n}\n\nvoid TextureGL::releaseTexImage()\n{\n    UNIMPLEMENTED();\n}\n\ntemplate <typename T>\nstatic inline void SyncSamplerStateMember(const FunctionsGL *functions, const gl::SamplerState &newState,\n                                          gl::SamplerState &curState, GLenum textureType, GLenum name,\n                                          T(gl::SamplerState::*samplerMember))\n{\n    if (curState.*samplerMember != newState.*samplerMember)\n    {\n        curState.*samplerMember = newState.*samplerMember;\n        functions->texParameterf(textureType, name, curState.*samplerMember);\n    }\n}\n\nvoid TextureGL::syncSamplerState(const gl::SamplerState &samplerState) const\n{\n    if (mAppliedSamplerState != samplerState)\n    {\n        mStateManager->bindTexture(mTextureType, mTextureID);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MIN_FILTER, &gl::SamplerState::minFilter);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MAG_FILTER, &gl::SamplerState::magFilter);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_WRAP_S, &gl::SamplerState::wrapS);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_WRAP_T, &gl::SamplerState::wrapT);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_WRAP_R, &gl::SamplerState::wrapR);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MAX_ANISOTROPY_EXT, &gl::SamplerState::maxAnisotropy);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_BASE_LEVEL, &gl::SamplerState::baseLevel);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MAX_LEVEL, &gl::SamplerState::maxLevel);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MIN_LOD, &gl::SamplerState::minLod);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_MAX_LOD, &gl::SamplerState::maxLod);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_COMPARE_MODE, &gl::SamplerState::compareMode);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_COMPARE_FUNC, &gl::SamplerState::compareFunc);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_SWIZZLE_R, &gl::SamplerState::swizzleRed);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_SWIZZLE_G, &gl::SamplerState::swizzleGreen);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_SWIZZLE_B, &gl::SamplerState::swizzleBlue);\n        SyncSamplerStateMember(mFunctions, samplerState, mAppliedSamplerState, mTextureType, GL_TEXTURE_SWIZZLE_A, &gl::SamplerState::swizzleAlpha);\n    }\n}\n\nGLuint TextureGL::getTextureID() const\n{\n    return mTextureID;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\/\n\/* Copyright (c) 2013 VectorChief (at github, bitbucket, sourceforge)         *\/\n\/* Distributed under the MIT software license, see the accompanying           *\/\n\/* file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php         *\/\n\/******************************************************************************\/\n\n#include \"tracer.h\"\n\n\/******************************************************************************\/\n\/*********************************   UPDATE   *********************************\/\n\/******************************************************************************\/\n\n\/* This function is one of the backend's\n * global entry points (hence 0) used by the engine.\n * It updates surface's backend structures.\n *\/\nrt_void update0(rt_SIMD_SURFACE *s_srf)\n{\n\n}\n\n\/******************************************************************************\/\n\/*********************************   RENDER   *********************************\/\n\/******************************************************************************\/\n\n\/* This function is one of the backend's\n * global entry points (hence 0) used by the engine.\n * It renders the whole frame based on the data structures\n * prepared by the engine.\n *\/\nrt_void render0(rt_SIMD_INFOX *s_inf)\n{\n\n\/******************************************************************************\/\n\/*********************************   ENTER   **********************************\/\n\/******************************************************************************\/\n\n    ASM_ENTER(s_inf)\n\n        movxx_mi(Mebp, inf_FRM_Y, IB(0))\n\n    LBL(YY_cyc)\n\n        movxx_ld(Reax, Mebp, inf_FRM_Y)\n        mulxn_ld(Reax, Mebp, inf_FRM_ROW)\n        shlxx_ri(Reax, IB(2))\n        addxx_ld(Reax, Mebp, inf_FRAME)\n        movxx_st(Reax, Mebp, inf_FRM)\n\n        movxx_mi(Mebp, inf_FRM_X, IB(0))\n\n    LBL(XX_cyc)\n\n        movxx_ld(Reax, Mebp, inf_FRM_X)\n        movxx_rr(Redx, Reax)\n        shlxx_ri(Reax, IB(2))\n        addxx_ld(Reax, Mebp, inf_FRM)\n\n        \/* fill with blue gradient for a test *\/\n        shrxx_ri(Redx, IB(2))\n        movxx_st(Redx, Oeax, PLAIN)\n        addxx_ri(Reax, IB(4))\n        movxx_st(Redx, Oeax, PLAIN)\n        addxx_ri(Reax, IB(4))\n        movxx_st(Redx, Oeax, PLAIN)\n        addxx_ri(Reax, IB(4))\n        movxx_st(Redx, Oeax, PLAIN)\n\n    LBL(XX_end)\n\n        addxx_mi(Mebp, inf_FRM_X, IB(4))\n\n        movxx_ld(Reax, Mebp, inf_FRM_X)\n        cmpxx_rm(Reax, Mebp, inf_FRM_W)\n        jltxx_lb(XX_cyc)\n\n    LBL(YY_end)\n\n        addxx_mi(Mebp, inf_FRM_Y, IB(1))\n\n        movxx_ld(Reax, Mebp, inf_FRM_Y)\n        cmpxx_rm(Reax, Mebp, inf_FRM_H)\n        jltxx_lb(YY_cyc)\n\n    ASM_LEAVE(s_inf)\n\n\/******************************************************************************\/\n\/*********************************   LEAVE   **********************************\/\n\/******************************************************************************\/\n\n}\n\n\/******************************************************************************\/\n\/******************************************************************************\/\n\/******************************************************************************\/\n<commit_msg>add scene rendering<commit_after>\/******************************************************************************\/\n\/* Copyright (c) 2013 VectorChief (at github, bitbucket, sourceforge)         *\/\n\/* Distributed under the MIT software license, see the accompanying           *\/\n\/* file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php         *\/\n\/******************************************************************************\/\n\n#include \"tracer.h\"\n#include \"format.h\"\n#include \"system.h\"\n\n\/******************************************************************************\/\n\/*******************************   DEFINITIONS   ******************************\/\n\/******************************************************************************\/\n\n\/* Byte-offsets within SIMD-field\n * for packed scalar fields.\n *\/\n#define PTR   0x00 \/* LOCAL, PARAM, MAT_P, SRF_P *\/\n#define FLG   0x04 \/* LOCAL, MAT_P *\/\n#define TAG   0x0C \/* SRF_P *\/\n\n\/******************************************************************************\/\n\/*********************************   MACROS   *********************************\/\n\/******************************************************************************\/\n\n\/* Perform axis mapping when\n * transform is a multiple of 90 degree rotation.\n *\/\n#define INDEX_AXIS(nx)                                                      \\\n        movxx_ld(Reax, Mebx, srf_A_SGN(nx * 4))                             \\\n        movpx_ld(Xmm0, Iebx, srf_SBASE)                                     \\\n        movxx_ld(Reax, Mebx, srf_A_MAP(nx * 4))\n\n#define MOVXR_LD(RG, RM, DP)                                                \\\n        movpx_ld(W(RG), W(RM), W(DP))                                       \\\n        xorpx_rr(W(RG), Xmm0)\n\n#define MOVXR_ST(RG, RM, DP)                                                \\\n        xorpx_rr(W(RG), Xmm0)                                               \\\n        movpx_st(W(RG), W(RM), W(DP))\n\n#define MOVZR_ST(RG, RM, DP)                                                \\\n        xorpx_rr(W(RG), W(RG))                                              \\\n        movpx_st(W(RG), W(RM), W(DP))\n\n\/* Context flags.\n * Check if flag \"fl\" is set in the context's field \"pl\",\n * jump to \"lb\" otherwise.\n *\/\n#define FLAG_SIDE_OUTER     0\n#define FLAG_SIDE_INNER     1\n#define FLAG_SIDE           1\n\n#define CHECK_FLAG(lb, pl, fl)                                              \\\n        movxx_ld(Reax, Mecx, ctx_##pl(FLG))                                 \\\n        andxx_ri(Reax, IB(fl))                                              \\\n        cmpxx_ri(Reax, IB(0))                                               \\\n        jeqxx_lb(lb)\n\n\/* Update relevant fragments of the\n * color and depth SIMD-fields accumulating values\n * over multiple passes from the respective SIMD-fields\n * in the context based on the current SIMD-mask and\n * the current depth values. Also perform\n * pointer dereferencing for color fetching.\n *\/\n#define PAINT_FRAG(lb, pn)                                                  \\\n        cmpxx_mi(Mecx, ctx_TMASK(0x##pn), IB(0))                            \\\n        jeqxx_lb(lb##pn)                                                    \\\n        movxx_ld(Reax, Mecx, ctx_T_VAL(0x##pn))                             \\\n        movxx_st(Reax, Mecx, ctx_T_BUF(0x##pn))                             \\\n        movxx_ld(Reax, Mecx, ctx_C_PTR(0x##pn))                             \\\n        movxx_ld(Reax, Oeax, PLAIN)                                         \\\n        movxx_st(Reax, Mecx, ctx_C_BUF(0x##pn))                             \\\n    LBL(lb##pn)\n\n#define PAINT_SIMD(lb)                                                      \\\n        PAINT_FRAG(lb, 00)                                                  \\\n        PAINT_FRAG(lb, 04)                                                  \\\n        PAINT_FRAG(lb, 08)                                                  \\\n        PAINT_FRAG(lb, 0C)\n\n\/* Flush all fragments of\n * the fully computed color SIMD-field from the context\n * into the framebuffer.\n *\/\n#define FRAME_SIMD()                                                        \\\n        movpx_ld(Xmm0, Mecx, ctx_C_BUF(0))                                  \\\n        movpx_st(Xmm0, Oeax, PLAIN)\n\n\/* Replicate subroutine calling behaviour\n * by saving a given return address \"lb\" in the context's\n * local PTR field, then jumping to the destination address \"to\".\n * The destination code segment uses saved return address\n * to jump back after processing is finished. Parameters are\n * passed via context's local FLG field.\n *\/\n#define SUBROUTINE(lb, to)                                                  \\\n        adrxx_lb(lb)                                                        \\\n        movxx_st(Reax, Mecx, ctx_LOCAL(PTR))                                \\\n        jmpxx_lb(to)                                                        \\\n    LBL(lb)\n\n\/******************************************************************************\/\n\/*********************************   UPDATE   *********************************\/\n\/******************************************************************************\/\n\n\/* Local pointer tables\n * for quick entry point resolution.\n *\/\nstatic\nrt_pntr t_ptr[RT_TAG_SURFACE_MAX];\n\n\/* Backend's global entry point (hence 0).\n * Update surfaces's backend data.\n *\/\nrt_void update0(rt_SIMD_SURFACE *s_srf)\n{\n    rt_word tag = (rt_word)s_srf->srf_p[3];\n\n    if (tag >= RT_TAG_SURFACE_MAX)\n    {\n        return;\n    }\n\n    s_srf->srf_p[0] = t_ptr[tag];\n}\n\n\/******************************************************************************\/\n\/*********************************   RENDER   *********************************\/\n\/******************************************************************************\/\n\n\/* Backend's global entry point (hence 0).\n * Render the frame based on the data structures\n * prepared by the engine.\n *\/\nrt_void render0(rt_SIMD_INFOX *s_inf)\n{\n\n\/******************************************************************************\/\n\/**********************************   ENTER   *********************************\/\n\/******************************************************************************\/\n\n    ASM_ENTER(s_inf)\n\n        cmpxx_mi(Mebp, inf_CTX, IB(0))\n        jeqxx_lb(fetch_ptr)\n\n        movxx_ld(Recx, Mebp, inf_CTX)\n        movxx_ld(Redx, Mebp, inf_CAM)\n\n        jmpxx_lb(XX_set)\n\n    LBL(XX_ret)\n\n\/******************************************************************************\/\n\/********************************   RAY INIT   ********************************\/\n\/******************************************************************************\/\n\n        movpx_ld(Xmm0, Medx, cam_DIR_X)         \/* ray_x <- DIR_X *\/\n        movpx_st(Xmm0, Mecx, ctx_RAY_X)         \/* ray_x -> RAY_X *\/\n\n        movpx_ld(Xmm0, Medx, cam_DIR_Y)         \/* ray_y <- DIR_Y *\/\n        movpx_st(Xmm0, Mecx, ctx_RAY_Y)         \/* ray_y -> RAY_Y *\/\n\n        movpx_ld(Xmm0, Medx, cam_DIR_Z)         \/* ray_z <- DIR_Z *\/\n        movpx_st(Xmm0, Mecx, ctx_RAY_Z)         \/* ray_z -> RAY_Z *\/\n\n\/******************************************************************************\/\n\/********************************   VER SCAN   ********************************\/\n\/******************************************************************************\/\n\n        movxx_mi(Mebp, inf_FRM_Y, IB(0))\n\n    LBL(YY_cyc)\n\n        movxx_ld(Reax, Mebp, inf_FRM_Y)\n        mulxn_ld(Reax, Mebp, inf_FRM_ROW)\n        shlxx_ri(Reax, IB(2))\n        addxx_ld(Reax, Mebp, inf_FRAME)\n        movxx_st(Reax, Mebp, inf_FRM)\n\n\/******************************************************************************\/\n\/********************************   HOR SCAN   ********************************\/\n\/******************************************************************************\/\n\n        movxx_mi(Mebp, inf_FRM_X, IB(0))\n\n    LBL(XX_cyc)\n\n        movxx_ld(Redx, Mebp, inf_CAM)\n\n        movpx_ld(Xmm0, Medx, cam_T_MAX)         \/* tmp_v <- T_MAX *\/\n        movpx_st(Xmm0, Mecx, ctx_T_BUF(0))      \/* tmp_v -> T_BUF *\/\n\n        xorpx_rr(Xmm0, Xmm0)                    \/* tmp_v <- 0     *\/\n        movpx_st(Xmm0, Mecx, ctx_C_BUF(0))      \/* tmp_v -> C_BUF *\/\n\n\/******************************************************************************\/\n\/********************************   OBJ LIST   ********************************\/\n\/******************************************************************************\/\n\n        movxx_ld(Resi, Mebp, inf_LST)\n\n    LBL(OO_cyc)\n\n        cmpxx_ri(Resi, IB(0))\n        jeqxx_lb(OO_out)\n\n        movxx_ld(Rebx, Mesi, elm_SIMD)\n\n        movpx_ld(Xmm1, Mebx, srf_POS_X)\n        movpx_ld(Xmm2, Mebx, srf_POS_Y)\n        movpx_ld(Xmm3, Mebx, srf_POS_Z)\n\n        subps_ld(Xmm1, Mecx, ctx_ORG_X)\n        subps_ld(Xmm2, Mecx, ctx_ORG_Y)\n        subps_ld(Xmm3, Mecx, ctx_ORG_Z)\n\n        movpx_st(Xmm1, Mecx, ctx_DFF_X)\n        movpx_st(Xmm2, Mecx, ctx_DFF_Y)\n        movpx_st(Xmm3, Mecx, ctx_DFF_Z)\n\n        jmpxx_mm(Mebx, srf_SRF_P(PTR))\n\n    LBL(fetch_ptr)\n\n        jmpxx_lb(fetch_PL_ptr)\n\n\/******************************************************************************\/\n\/********************************   CLIPPING   ********************************\/\n\/******************************************************************************\/\n\n    LBL(CC_clp)\n\n        \/* depth testing *\/\n        movpx_ld(Xmm0, Mecx, ctx_T_BUF(0))      \/* t_buf <- T_BUF *\/\n        cgtps_rr(Xmm0, Xmm4)                    \/* t_buf >! t_rt1 *\/\n        andpx_rr(Xmm7, Xmm0)                    \/* tmask &= gmask *\/\n\n        \/* ray clipping *\/\n        movpx_ld(Xmm0, Mecx, ctx_T_MIN)         \/* t_min <- T_MIN *\/\n        cltps_rr(Xmm0, Xmm4)                    \/* t_min <! t_rt1 *\/\n        andpx_rr(Xmm7, Xmm0)                    \/* tmask &= lmask *\/\n\n        \/* \"x\" section *\/\n        movpx_ld(Xmm4, Mecx, ctx_RAY_X)         \/* ray_x <- RAY_X *\/\n        mulps_ld(Xmm4, Mecx, ctx_T_VAL(0))      \/* ray_x *= t_rt1 *\/\n        addps_ld(Xmm4, Mecx, ctx_ORG_X)         \/* hit_x += ORG_X *\/\n        movpx_st(Xmm4, Mecx, ctx_HIT_X)         \/* hit_x -> HIT_X *\/\n\n        \/* \"y\" section *\/\n        movpx_ld(Xmm5, Mecx, ctx_RAY_Y)         \/* ray_y <- RAY_Y *\/\n        mulps_ld(Xmm5, Mecx, ctx_T_VAL(0))      \/* ray_y *= t_rt1 *\/\n        addps_ld(Xmm5, Mecx, ctx_ORG_Y)         \/* hit_y += ORG_Y *\/\n        movpx_st(Xmm5, Mecx, ctx_HIT_Y)         \/* hit_y -> HIT_Y *\/\n\n        \/* \"z\" section *\/\n        movpx_ld(Xmm6, Mecx, ctx_RAY_Z)         \/* ray_z <- RAY_Z *\/\n        mulps_ld(Xmm6, Mecx, ctx_T_VAL(0))      \/* ray_z *= t_rt1 *\/\n        addps_ld(Xmm6, Mecx, ctx_ORG_Z)         \/* hit_z += ORG_Z *\/\n        movpx_st(Xmm6, Mecx, ctx_HIT_Z)         \/* hit_z -> HIT_Z *\/\n\n        jmpxx_mm(Mecx, ctx_LOCAL(PTR))\n\n\/******************************************************************************\/\n\/********************************   MATERIAL   ********************************\/\n\/******************************************************************************\/\n\n    LBL(MT_mat)\n\n        movxx_ld(Reax, Mecx, ctx_LOCAL(FLG))\n        andxx_ri(Reax, IB(FLAG_SIDE))\n        shlxx_ri(Reax, IB(3))\n        movxx_ld(Redx, Iebx, srf_MAT_P(PTR))\n\n        \/* load color *\/\n        movpx_ld(Xmm0, Medx, mat_TEX_P)         \/* tex_p <- TEX_P *\/\n\n        \/* store result *\/\n        movpx_st(Xmm0, Mecx, ctx_C_PTR(0))      \/* tex_c -> C_PTR *\/\n        PAINT_SIMD(MT_rtx)\n\n        jmpxx_mm(Mecx, ctx_LOCAL(PTR))\n\n\/******************************************************************************\/\n\/**********************************   PLANE   *********************************\/\n\/******************************************************************************\/\n\n    LBL(fetch_PL_ptr)\n\n        adrxx_lb(PL_ptr)\n        movxx_st(Reax, Mebp, inf_PTR_PL)\n        jmpxx_lb(fetch_end)\n\n    LBL(PL_ptr)\n\n        \/* \"k\" section *\/\n        INDEX_AXIS(RT_K)                        \/* eax   <-     k *\/\n        MOVXR_LD(Xmm4, Iecx, ctx_DFF_O)         \/* dff_k <- DFF_K *\/\n        MOVXR_LD(Xmm3, Iecx, ctx_RAY_O)         \/* ray_k <- RAY_K *\/\n\n        \/* create xmask *\/\n        xorpx_rr(Xmm7, Xmm7)                    \/* xmask <- 0     *\/\n        cneps_rr(Xmm7, Xmm3)                    \/* xmask != ray_k *\/\n\n        \/* \"tt\" section *\/\n        divps_rr(Xmm4, Xmm3)                    \/* dff_k \/= ray_k *\/\n        movpx_st(Xmm4, Mecx, ctx_T_VAL(0))      \/* t_rt1 -> T_VAL *\/\n\n        \/* clipping *\/\n        SUBROUTINE(PL_cp1, CC_clp)\n        CHECK_MASK(OO_end, NONE, Xmm7)\n        movpx_st(Xmm7, Mecx, ctx_WMASK)         \/* xmask -> WMASK *\/\n\n        INDEX_AXIS(RT_K)\n        MOVXR_LD(Xmm3, Iecx, ctx_RAY_O)         \/* ray_k <- RAY_K *\/\n        xorpx_rr(Xmm0, Xmm0)                    \/* tmp_v <- 0     *\/\n\n\/******************************************************************************\/\n\/*  LBL(PL_rt1)  *\/\n\n        \/* outer side *\/\n        cltps_rr(Xmm3, Xmm0)                    \/* ray_k <! tmp_v *\/\n        andpx_rr(Xmm7, Xmm3)                    \/* tmask &= lmask *\/\n        movpx_st(Xmm7, Mecx, ctx_TMASK(0))      \/* tmask -> TMASK *\/\n        CHECK_MASK(PL_rt2, NONE, Xmm7)\n\n        \/* material *\/\n        movxx_mi(Mecx, ctx_LOCAL(FLG), IB(FLAG_SIDE_OUTER))\n        SUBROUTINE(PL_mt1, MT_mat)\n\n\/******************************************************************************\/\n    LBL(PL_rt2)\n\n        \/* inner side *\/\n        movpx_ld(Xmm7, Mecx, ctx_TMASK(0))      \/* tmask <- TMASK *\/\n        xorpx_ld(Xmm7, Mecx, ctx_WMASK)         \/* tmask ^= WMASK *\/\n        CHECK_MASK(OO_end, NONE, Xmm7)\n        movpx_st(Xmm7, Mecx, ctx_TMASK(0))      \/* tmask -> TMASK *\/\n\n        \/* material *\/\n        movxx_mi(Mecx, ctx_LOCAL(FLG), IB(FLAG_SIDE_INNER))\n        SUBROUTINE(PL_mt2, MT_mat)\n\n        jmpxx_lb(OO_end)\n\n\/******************************************************************************\/\n\/*********************************   OBJECT   *********************************\/\n\/******************************************************************************\/\n\n    LBL(OO_end)\n\n        movxx_ld(Resi, Mesi, elm_NEXT)\n        jmpxx_lb(OO_cyc)\n\n    LBL(OO_out)\n\n        jmpxx_mm(Mecx, ctx_PARAM(PTR))\n\n\/******************************************************************************\/\n\/*********************************   CAMERA   *********************************\/\n\/******************************************************************************\/\n\n    LBL(XX_set)\n\n        adrxx_lb(XX_end)\n        movxx_st(Reax, Mecx, ctx_PARAM(PTR))\n        jmpxx_lb(XX_ret)\n\n    LBL(XX_end)\n\n        movxx_ld(Redx, Mebp, inf_CAM)\n\n        movxx_ld(Reax, Mebp, inf_FRM_X)\n        shlxx_ri(Reax, IB(2))\n        addxx_ld(Reax, Mebp, inf_FRM)\n        FRAME_SIMD()\n        addxx_mi(Mebp, inf_FRM_X, IB(4))\n\n        movxx_ld(Reax, Mebp, inf_FRM_X)\n        cmpxx_rm(Reax, Mebp, inf_FRM_W)\n        jeqxx_lb(YY_end)\n\n        movxx_ld(Redx, Mebp, inf_CAM)\n\n        movpx_ld(Xmm0, Mecx, ctx_RAY_X)         \/* ray_x <- RAY_X *\/\n        addps_ld(Xmm0, Medx, cam_HOR_X)         \/* ray_x += HOR_X *\/\n        movpx_st(Xmm0, Mecx, ctx_RAY_X)         \/* ray_x -> RAY_X *\/\n\n        movpx_ld(Xmm1, Mecx, ctx_RAY_Y)         \/* ray_y <- RAY_Y *\/\n        addps_ld(Xmm1, Medx, cam_HOR_Y)         \/* ray_y += HOR_Y *\/\n        movpx_st(Xmm1, Mecx, ctx_RAY_Y)         \/* ray_y -> RAY_Y *\/\n\n        movpx_ld(Xmm2, Mecx, ctx_RAY_Z)         \/* ray_z <- RAY_Z *\/\n        addps_ld(Xmm2, Medx, cam_HOR_Z)         \/* ray_z += HOR_Z *\/\n        movpx_st(Xmm2, Mecx, ctx_RAY_Z)         \/* ray_z -> RAY_Z *\/\n\n        jmpxx_lb(XX_cyc)\n\n\/******************************************************************************\/\n\/*********************************   CAMERA   *********************************\/\n\/******************************************************************************\/\n\n    LBL(YY_end)\n\n        movxx_ld(Redx, Mebp, inf_CAM)\n\n        movpx_ld(Xmm0, Medx, cam_DIR_X)         \/* ray_x <- DIR_X *\/\n        addps_ld(Xmm0, Medx, cam_VER_X)         \/* ray_x += VER_X *\/\n        movpx_st(Xmm0, Medx, cam_DIR_X)         \/* ray_x -> DIR_X *\/\n        movpx_st(Xmm0, Mecx, ctx_RAY_X)         \/* ray_x -> RAY_X *\/\n\n        movpx_ld(Xmm1, Medx, cam_DIR_Y)         \/* ray_y <- DIR_Y *\/\n        addps_ld(Xmm1, Medx, cam_VER_Y)         \/* ray_y += VER_Y *\/\n        movpx_st(Xmm1, Medx, cam_DIR_Y)         \/* ray_y -> DIR_Y *\/\n        movpx_st(Xmm1, Mecx, ctx_RAY_Y)         \/* ray_y -> RAY_Y *\/\n\n        movpx_ld(Xmm2, Medx, cam_DIR_Z)         \/* ray_z <- DIR_Z *\/\n        addps_ld(Xmm2, Medx, cam_VER_Z)         \/* ray_z += VER_Z *\/\n        movpx_st(Xmm2, Medx, cam_DIR_Z)         \/* ray_z -> DIR_Z *\/\n        movpx_st(Xmm2, Mecx, ctx_RAY_Z)         \/* ray_z -> RAY_Z *\/\n\n        movxx_ri(Reax, IB(1))\n        addxx_st(Reax, Mebp, inf_FRM_Y)\n\n        movxx_ld(Reax, Mebp, inf_FRM_Y)\n        cmpxx_rm(Reax, Mebp, inf_FRM_H)\n        jltxx_lb(YY_cyc)\n\n    LBL(fetch_end)\n\n    ASM_LEAVE(s_inf)\n\n\/******************************************************************************\/\n\/**********************************   LEAVE   *********************************\/\n\/******************************************************************************\/\n\n    if (s_inf->ctx != RT_NULL)\n    {\n        return;\n    }\n\n    t_ptr[RT_TAG_PLANE] = s_inf->ptr_pl;\n\n    \/* RT_LOGI(\"PL ptr = %p\\n\", s_inf->ptr_pl); *\/\n}\n\n\/******************************************************************************\/\n\/******************************************************************************\/\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 (info@qt.nokia.com)\n**\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** 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** Other Usage\n**\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** If you have questions regarding the use of this file, please contact\n** Nokia at info@qt.nokia.com.\n**\n**************************************************************************\/\n\n#include \"fileinprojectfinder.h\"\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QUrl>\n\nnamespace Utils {\n\n\/*!\n  \\class Utils::FileInProjectFinder\n\n  \\brief Helper class to find the 'original' file in the project directory for a given file url.\n\n  Often files are copied in the build + deploy process. findFile() searches for an existing file\n  in the project directory for a given file path:\n\n  E.g. following file paths:\n  \\list\n  \\i C:\/app-build-desktop\/qml\/app\/main.qml (shadow build directory)\n  \\i C:\/Private\/e3026d63\/qml\/app\/main.qml  (Application data folder on Symbian device)\n  \\i \/Users\/x\/app-build-desktop\/App.app\/Contents\/Resources\/qml\/App\/main.qml (folder on Mac OS X)\n  \\endlist\n\n should all be mapped to $PROJECTDIR\/qml\/app\/main.qml\n*\/\n\nFileInProjectFinder::FileInProjectFinder()\n{\n}\n\nvoid FileInProjectFinder::setProjectDirectory(const QString &absoluteProjectPath)\n{\n    QTC_ASSERT(QFileInfo(absoluteProjectPath).exists()\n               && QFileInfo(absoluteProjectPath).isAbsolute(), return);\n\n    if (absoluteProjectPath == m_projectDir)\n        return;\n\n    m_projectDir = absoluteProjectPath;\n    while (m_projectDir.endsWith(QLatin1Char('\/')))\n        m_projectDir.remove(m_projectDir.length() - 1, 1);\n\n    m_cache.clear();\n}\n\nQString FileInProjectFinder::projectDirectory() const\n{\n    return m_projectDir;\n}\n\nvoid FileInProjectFinder::setProjectFiles(const QStringList &projectFiles)\n{\n    m_projectFiles = projectFiles;\n    m_cache.clear();\n}\n\n\/**\n  Returns the best match for the given file url in the project directory.\n\n  The method first checks whether the file inside the project directory exists.\n  If not, the leading directory in the path is stripped, and the - now shorter - path is\n  checked for existence. This continues until either the file is found, or the relative path\n  does not contain any directories any more: In this case the path of the url is returned.\n\n  Second, we walk the list of project files, and search for a file name match there.\n  *\/\nQString FileInProjectFinder::findFile(const QUrl &fileUrl, bool *success) const\n{\n    QString originalPath = fileUrl.toLocalFile();\n    if (originalPath.isEmpty()) \/\/ e.g. qrc:\/\/\n        originalPath = fileUrl.path();\n\n    if (originalPath.isEmpty()) {\n        if (success)\n            success = false;\n        return originalPath;\n    }\n\n    if (!m_projectDir.isEmpty()) {\n        int prefixToIgnore = -1;\n        const QChar separator = QLatin1Char('\/');\n        if (originalPath.startsWith(m_projectDir + separator)) {\n#ifdef Q_OS_MAC\n            \/\/ starting with the project path is not sufficient if the file was\n            \/\/ copied in an insource build, e.g. into MyApp.app\/Contents\/Resources\n            static const QString appResourcePath = QString::fromLatin1(\".app\/Contents\/Resources\");\n            if (originalPath.contains(appResourcePath)) {\n                \/\/ the path is inside the project, but most probably as a resource of an insource build\n                \/\/ so ignore that path\n                prefixToIgnore = originalPath.indexOf(appResourcePath) + appResourcePath.length();\n            } else {\n#endif\n                if (success)\n                    *success = true;\n                return originalPath;\n#ifdef Q_OS_MAC\n            }\n#endif\n        }\n\n        if (m_cache.contains(originalPath)) {\n            \/\/ check if cached path is still there\n            QString candidate = m_cache.value(originalPath);\n            QFileInfo candidateInfo(candidate);\n            if (candidateInfo.exists() && candidateInfo.isFile()) {\n                if (success)\n                    *success = true;\n                return candidate;\n            }\n        }\n\n        \/\/ Strip directories one by one from the beginning of the path,\n        \/\/ and see if the new relative path exists in the build directory.\n        if (prefixToIgnore < 0) {\n            if (!QFileInfo(originalPath).isAbsolute()\n                    && !originalPath.startsWith(separator)) {\n                prefixToIgnore = 0;\n            } else {\n                prefixToIgnore = originalPath.indexOf(separator);\n            }\n        }\n        while (prefixToIgnore != -1) {\n            QString candidate = originalPath;\n            candidate.remove(0, prefixToIgnore);\n            candidate.prepend(m_projectDir);\n            QFileInfo candidateInfo(candidate);\n            if (candidateInfo.exists() && candidateInfo.isFile()) {\n                if (success)\n                    *success = true;\n\n                m_cache.insert(originalPath, candidate);\n                return candidate;\n            }\n            prefixToIgnore = originalPath.indexOf(separator, prefixToIgnore + 1);\n        }\n    }\n\n    const QString fileName = QFileInfo(originalPath).fileName();\n    foreach (const QString &f, m_projectFiles) {\n        if (QFileInfo(f).fileName() == fileName) {\n            m_cache.insert(originalPath, f);\n            if (success)\n                *success = true;\n            return f;\n        }\n    }\n\n    if (success)\n        *success = false;\n\n    return originalPath;\n}\n\n} \/\/ namespace Utils\n<commit_msg>Fix *bool assignment<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 (info@qt.nokia.com)\n**\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** 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** Other Usage\n**\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** If you have questions regarding the use of this file, please contact\n** Nokia at info@qt.nokia.com.\n**\n**************************************************************************\/\n\n#include \"fileinprojectfinder.h\"\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QUrl>\n\nnamespace Utils {\n\n\/*!\n  \\class Utils::FileInProjectFinder\n\n  \\brief Helper class to find the 'original' file in the project directory for a given file url.\n\n  Often files are copied in the build + deploy process. findFile() searches for an existing file\n  in the project directory for a given file path:\n\n  E.g. following file paths:\n  \\list\n  \\i C:\/app-build-desktop\/qml\/app\/main.qml (shadow build directory)\n  \\i C:\/Private\/e3026d63\/qml\/app\/main.qml  (Application data folder on Symbian device)\n  \\i \/Users\/x\/app-build-desktop\/App.app\/Contents\/Resources\/qml\/App\/main.qml (folder on Mac OS X)\n  \\endlist\n\n should all be mapped to $PROJECTDIR\/qml\/app\/main.qml\n*\/\n\nFileInProjectFinder::FileInProjectFinder()\n{\n}\n\nvoid FileInProjectFinder::setProjectDirectory(const QString &absoluteProjectPath)\n{\n    QTC_ASSERT(QFileInfo(absoluteProjectPath).exists()\n               && QFileInfo(absoluteProjectPath).isAbsolute(), return);\n\n    if (absoluteProjectPath == m_projectDir)\n        return;\n\n    m_projectDir = absoluteProjectPath;\n    while (m_projectDir.endsWith(QLatin1Char('\/')))\n        m_projectDir.remove(m_projectDir.length() - 1, 1);\n\n    m_cache.clear();\n}\n\nQString FileInProjectFinder::projectDirectory() const\n{\n    return m_projectDir;\n}\n\nvoid FileInProjectFinder::setProjectFiles(const QStringList &projectFiles)\n{\n    m_projectFiles = projectFiles;\n    m_cache.clear();\n}\n\n\/**\n  Returns the best match for the given file url in the project directory.\n\n  The method first checks whether the file inside the project directory exists.\n  If not, the leading directory in the path is stripped, and the - now shorter - path is\n  checked for existence. This continues until either the file is found, or the relative path\n  does not contain any directories any more: In this case the path of the url is returned.\n\n  Second, we walk the list of project files, and search for a file name match there.\n  *\/\nQString FileInProjectFinder::findFile(const QUrl &fileUrl, bool *success) const\n{\n    QString originalPath = fileUrl.toLocalFile();\n    if (originalPath.isEmpty()) \/\/ e.g. qrc:\/\/\n        originalPath = fileUrl.path();\n\n    if (originalPath.isEmpty()) {\n        if (success)\n            *success = false;\n        return originalPath;\n    }\n\n    if (!m_projectDir.isEmpty()) {\n        int prefixToIgnore = -1;\n        const QChar separator = QLatin1Char('\/');\n        if (originalPath.startsWith(m_projectDir + separator)) {\n#ifdef Q_OS_MAC\n            \/\/ starting with the project path is not sufficient if the file was\n            \/\/ copied in an insource build, e.g. into MyApp.app\/Contents\/Resources\n            static const QString appResourcePath = QString::fromLatin1(\".app\/Contents\/Resources\");\n            if (originalPath.contains(appResourcePath)) {\n                \/\/ the path is inside the project, but most probably as a resource of an insource build\n                \/\/ so ignore that path\n                prefixToIgnore = originalPath.indexOf(appResourcePath) + appResourcePath.length();\n            } else {\n#endif\n                if (success)\n                    *success = true;\n                return originalPath;\n#ifdef Q_OS_MAC\n            }\n#endif\n        }\n\n        if (m_cache.contains(originalPath)) {\n            \/\/ check if cached path is still there\n            QString candidate = m_cache.value(originalPath);\n            QFileInfo candidateInfo(candidate);\n            if (candidateInfo.exists() && candidateInfo.isFile()) {\n                if (success)\n                    *success = true;\n                return candidate;\n            }\n        }\n\n        \/\/ Strip directories one by one from the beginning of the path,\n        \/\/ and see if the new relative path exists in the build directory.\n        if (prefixToIgnore < 0) {\n            if (!QFileInfo(originalPath).isAbsolute()\n                    && !originalPath.startsWith(separator)) {\n                prefixToIgnore = 0;\n            } else {\n                prefixToIgnore = originalPath.indexOf(separator);\n            }\n        }\n        while (prefixToIgnore != -1) {\n            QString candidate = originalPath;\n            candidate.remove(0, prefixToIgnore);\n            candidate.prepend(m_projectDir);\n            QFileInfo candidateInfo(candidate);\n            if (candidateInfo.exists() && candidateInfo.isFile()) {\n                if (success)\n                    *success = true;\n\n                m_cache.insert(originalPath, candidate);\n                return candidate;\n            }\n            prefixToIgnore = originalPath.indexOf(separator, prefixToIgnore + 1);\n        }\n    }\n\n    const QString fileName = QFileInfo(originalPath).fileName();\n    foreach (const QString &f, m_projectFiles) {\n        if (QFileInfo(f).fileName() == fileName) {\n            m_cache.insert(originalPath, f);\n            if (success)\n                *success = true;\n            return f;\n        }\n    }\n\n    if (success)\n        *success = false;\n\n    return originalPath;\n}\n\n} \/\/ namespace Utils\n<|endoftext|>"}
{"text":"<commit_before> \/**\n * \\file\n * \\brief     Combination of the work of sprint 1\n * \\author    Tim IJntema, Stefan de Beer, Arco Gelderblom, Rik Honcoop, Koen de Groot\n * \\copyright Copyright (c) 2017, The R2D2 Team\n * \\license   See LICENSE\n *\/\n \n#include \"mysql.hh\"\n#include \"mfrc522.hh\"\n#include \"encryption.hh\"\n#include \"led-controller.hh\"\n#include \"matrix-keypad.hh\"\n\n#include <wiringPi.h>\n#include <wiringPiSPI.h>\n \n#include <iostream>\n\nint main(int argc, char **argv) {\n    MySql connection;\n\n    if(!connection.connectTo(\"192.168.2.50\", \"R2D2\", \"BB8\")){\n        std::cout << \"Can not connect\\n\";\n        exit(0);\n    }\n    \n    if(!connection.selectDatabase(\"R2D2\")){\n        std::cout << \"Database unknown\\n\";\n        exit(0);\n    }\n    \n    wiringPiSetup();\n    wiringPiSPISetup(0, 10000000);\/\/max speed for mfrc522 is 10Mhz\n    Mfrc522 rfid;\n    rfid.init();\n\n    \/\/Keypad pinSetup\n    const int keypadRow[] = {29, 28, 27, 26};\n    const int keypadColumn[] = {31, 11, 10, 6};\n\n    \/\/Keypad objects\n    MatrixKeypad keypad(keypadRow, keypadColumn, 4);\n    char c;\n\n    Encryptie encryption(65341);\n\n    LedController led;\n\n    while(1){\n        std::cout << \"\\n\\nWaiting for rfid tag: \\n\";\n\n        while(!rfid.isTagPresent()){}\n        \n        std::cout<<\"Hello tag\\n\";\n        \n        while((c = keypad.getKey()) == 'h'){\n            delay(100);\n        }\n        std::cout << \"A key has been pressed\\n\";\n\n        if(!connection.executeQuery(\"SELECT * FROM RFID\")){\n            std::cout << \"Can not execute query\\n\";\n            exit(0);\n        }\n        \n        std::cout << \"Database information: \"\n                  << connection.getPreviousResponseColumn(\"CARD_ID\")\n                  << '\\n';\n        \n        std::cout << \"String before encryption: R2D2 project\\n\";\n        std::cout << \"String after encryption: \"\n                  << encryption.Encrypt(\"R2D2 project\")\n                  << '\\n';\n\n        led.blinkLed(0, 5000);\n    return 0;\n}\n<commit_msg>[RFID-01]fixed typo and syntax error<commit_after> \/**\n * \\file\n * \\brief     Combination of the work of sprint 1\n * \\author    Tim IJntema, Stefan de Beer, Arco Gelderblom, Rik Honcoop, Koen de Groot\n * \\copyright Copyright (c) 2017, The R2D2 Team\n * \\license   See LICENSE\n *\/\n \n#include \"mysql.hh\"\n#include \"mfrc522.hh\"\n#include \"encryption.hh\"\n#include \"led-controller.hh\"\n#include \"matrix-keypad.hh\"\n\n#include <wiringPi.h>\n#include <wiringPiSPI.h>\n \n#include <iostream>\n\nint main(int argc, char **argv) {\n    MySql connection;\n\n    if(!connection.connectTo(\"192.168.2.50\", \"R2D2\", \"BB8\")){\n        std::cout << \"Can not connect\\n\";\n        exit(0);\n    }\n    \n    if(!connection.selectDatabase(\"R2D2\")){\n        std::cout << \"Database unknown\\n\";\n        exit(0);\n    }\n    \n    wiringPiSetup();\n    wiringPiSPISetup(0, 10000000);\/\/max speed for mfrc522 is 10Mhz\n    Mfrc522 rfid;\n    rfid.init();\n\n    \/\/Keypad pinSetup\n    const int keypadRow[] = {29, 28, 27, 26};\n    const int keypadColumn[] = {31, 11, 10, 6};\n\n    \/\/Keypad objects\n    MatrixKeypad keypad(keypadRow, keypadColumn, 4);\n    char c;\n\n    Encryption encryption(65341);\n\n    LedController led;\n\n    while(1){\n        std::cout << \"\\n\\nWaiting for rfid tag: \\n\";\n\n        while(!rfid.isTagPresent()){}\n        \n        std::cout<<\"Hello tag\\n\";\n        \n        while((c = keypad.getKey()) == 'h'){\n            delay(100);\n        }\n        std::cout << \"A key has been pressed\\n\";\n\n        if(!connection.executeQuery(\"SELECT * FROM RFID\")){\n            std::cout << \"Can not execute query\\n\";\n            exit(0);\n        }\n        \n        std::cout << \"Database information: \"\n                  << connection.getPreviousResponseColumn(\"CARD_ID\")\n                  << '\\n';\n        \n        std::cout << \"String before encryption: R2D2 project\\n\";\n        std::cout << \"String after encryption: \"\n                  << encryption.Encrypt(\"R2D2 project\")\n                  << '\\n';\n\n        led.blinkLed(0, 5000);\n\t}    \nreturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"WidgetExplorer.h\"\n\n#include <QGLWidget>\n#include <QKeyEvent>\n#include <QTime>\n#include <cmath>\n#include <GL\/glu.h>\n#include <QThread>\n#include \"Scenery.h\"\n#include \"SoftwareRenderer.h\"\n#include \"OpenGLRenderer.h\"\n#include \"WaterDefinition.h\"\n#include \"SurfaceMaterial.h\"\n#include \"tools\/euclid.h\"\n#include \"renderer.h\"\n#include \"CameraDefinition.h\"\n#include \"atmosphere\/public.h\"\n#include \"water\/public.h\"\n#include \"terrain\/public.h\"\n#include \"ExplorerChunkSky.h\"\n#include \"ExplorerChunkTerrain.h\"\n\nclass ChunkMaintenanceThread : public QThread\n{\npublic:\n\n    ChunkMaintenanceThread(WidgetExplorer* wanderer)\n    {\n        _wanderer = wanderer;\n        _running = true;\n    }\n\n    void askStop()\n    {\n        _running = false;\n    }\n\n    static inline void usleep(unsigned long us)\n    {\n        QThread::usleep(us);\n    }\n\nprotected:\n\n    void run()\n    {\n        while (_running)\n        {\n            _wanderer->performChunksMaintenance();\n            QThread::usleep(10000);\n        }\n    }\n\nprivate:\n    bool _running;\n    WidgetExplorer* _wanderer;\n};\n\nstatic QVector<ChunkMaintenanceThread*> _threads;\n\nstatic Vector3 _getCameraLocation(Renderer* renderer, Vector3)\n{\n    return ((CameraDefinition*)renderer->customData[2])->getLocation();\n}\n\nstatic AtmosphereResult _applyAerialPerspective(Renderer*, Vector3, Color base)\n{\n    AtmosphereResult result;\n    atmosphereInitResult(&result);\n    result.base = base;\n    result.final = base;\n    atmosphereUpdateResult(&result);\n    return result;\n}\n\nWidgetExplorer::WidgetExplorer(QWidget *parent, CameraDefinition* camera, SoftwareRenderer* renderer) :\nQGLWidget(parent)\n{\n    setMinimumSize(400, 300);\n    setFocusPolicy(Qt::StrongFocus);\n\n    _current_camera = new CameraDefinition;\n    _base_camera = camera;\n    camera->copy(_current_camera);\n\n    if (renderer)\n    {\n        _renderer = renderer;\n        _renderer_created = false;\n    }\n    else\n    {\n        _renderer = new SoftwareRenderer(Scenery::getCurrent());\n        _renderer_created = true;\n    }\n    _opengl_renderer = new OpenGLRenderer(NULL);\n    _renderer->prepare();\n    _renderer->render_quality = 3;\n    _renderer->customData[2] = _base_camera;\n    _renderer->getCameraLocation = _getCameraLocation;\n    _renderer->atmosphere->applyAerialPerspective = _applyAerialPerspective;\n    lightingManagerDisableSpecularity(_renderer->lighting);\n\n    _inited = false;\n    _updated = false;\n\n    _average_frame_time = 0.05;\n    _quality = 3;\n    _last_mouse_x = 0;\n    _last_mouse_y = 0;\n\n    startTimer(500);\n}\n\nWidgetExplorer::~WidgetExplorer()\n{\n    stopRendering();\n\n    for (int i = 0; i < _chunks.count(); i++)\n    {\n        delete _chunks[i];\n    }\n    delete _current_camera;\n\n    if (_renderer_created)\n    {\n        rendererDelete(_renderer);\n    }\n    delete _opengl_renderer;\n}\n\nvoid WidgetExplorer::startRendering()\n{\n    \/\/ Add terrain\n    int chunks = 20;\n    double size = 400.0;\n    double chunksize = size \/ (double) chunks;\n    double start = -size \/ 2.0;\n    double water_height = _renderer->water->getHeightInfo(_renderer).base_height;\n    for (int i = 0; i < chunks; i++)\n    {\n        for (int j = 0; j < chunks; j++)\n        {\n            ExplorerChunkTerrain* chunk = new ExplorerChunkTerrain(_renderer, start + chunksize * (double) i, start + chunksize * (double) j, chunksize, chunks, water_height);\n            _chunks.append(chunk);\n            _updateQueue.append(chunk);\n        }\n    }\n\n    \/\/ Add skybox\n    for (int orientation = 0; orientation < 5; orientation++)\n    {\n        ExplorerChunkSky* chunk = new ExplorerChunkSky(_renderer, 500.0, (SkyboxOrientation) orientation);\n        _chunks.append(chunk);\n        _updateQueue.append(chunk);\n    }\n\n    \/\/ Start rendering workers\n    int nbcore;\n    _alive = true;\n\n    nbcore = QThread::idealThreadCount();\n    if (nbcore < 1)\n    {\n        nbcore = 1;\n    }\n\n    for (int i = 0; i < nbcore; i++)\n    {\n        _threads.append(new ChunkMaintenanceThread(this));\n    }\n    for (int i = 0; i < _threads.count(); i++)\n    {\n        _threads[i]->start();\n    }\n}\n\nvoid WidgetExplorer::stopRendering()\n{\n    for (int i = 0; i < _threads.count(); i++)\n    {\n        _threads[i]->askStop();\n    }\n    _alive = false;\n    for (int i = 0; i < _threads.count(); i++)\n    {\n        _threads[i]->wait();\n    }\n}\n\nbool _cmpChunks(const BaseExplorerChunk* c1, const BaseExplorerChunk* c2)\n{\n    return c1->priority > c2->priority;\n}\n\nvoid WidgetExplorer::performChunksMaintenance()\n{\n    BaseExplorerChunk* chunk;\n\n    _lock_chunks.lock();\n    if (_updateQueue.count() > 0)\n    {\n        chunk = _updateQueue.takeFirst();\n        _lock_chunks.unlock();\n    }\n    else\n    {\n        _lock_chunks.unlock();\n        return;\n    }\n\n    if (chunk->maintain())\n    {\n        if (!_alive)\n        {\n            return;\n        }\n\n        _updated = true;\n    }\n\n    _lock_chunks.lock();\n    _updateQueue.append(chunk);\n    _lock_chunks.unlock();\n}\n\nvoid WidgetExplorer::resetCamera()\n{\n    _base_camera->copy(_current_camera);\n    updateGL();\n}\n\nvoid WidgetExplorer::validateCamera()\n{\n    _current_camera->copy(_base_camera);\n}\n\nvoid WidgetExplorer::keyPressEvent(QKeyEvent* event)\n{\n    double factor;\n\n    if (event->modifiers() & Qt::ControlModifier)\n    {\n        factor = 0.1;\n    }\n    else if (event->modifiers() & Qt::ShiftModifier)\n    {\n        factor = 10.0;\n    }\n    else\n    {\n        factor = 1.0;\n    }\n    factor *= 3.0;\n\n    if (event->key() == Qt::Key_Up)\n    {\n        _current_camera->strafeForward(0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_Down)\n    {\n        _current_camera->strafeForward(-0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_Right)\n    {\n        _current_camera->strafeRight(0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_Left)\n    {\n        _current_camera->strafeRight(-0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_PageUp)\n    {\n        _current_camera->strafeUp(0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_PageDown)\n    {\n        _current_camera->strafeUp(-0.1 * factor);\n        updateGL();\n    }\n    else\n    {\n        QGLWidget::keyPressEvent(event);\n    }\n}\n\nvoid WidgetExplorer::mousePressEvent(QMouseEvent* event)\n{\n    _last_mouse_x = event->x();\n    _last_mouse_y = event->y();\n\n    event->ignore();\n}\n\nvoid WidgetExplorer::mouseMoveEvent(QMouseEvent* event)\n{\n    double factor;\n\n    if (event->modifiers() & Qt::ControlModifier)\n    {\n        factor = 0.01;\n    }\n    else if (event->modifiers() & Qt::ShiftModifier)\n    {\n        factor = 1.0;\n    }\n    else\n    {\n        factor = 0.1;\n    }\n    factor *= 0.2;\n\n    if (event->buttons() & Qt::LeftButton)\n    {\n        _current_camera->rotateYaw((double) (event->x() - _last_mouse_x) * factor * 0.1);\n        _current_camera->rotatePitch((double) (event->y() - _last_mouse_y) * factor * 0.1);\n        updateGL();\n        event->accept();\n    }\n    else if (event->buttons() & Qt::RightButton)\n    {\n        _current_camera->strafeRight((double) (_last_mouse_x - event->x()) * factor);\n        _current_camera->strafeUp((double) (event->y() - _last_mouse_y) * factor);\n        updateGL();\n        event->accept();\n    }\n    else\n    {\n        event->ignore();\n    }\n\n    _last_mouse_x = event->x();\n    _last_mouse_y = event->y();\n}\n\nvoid WidgetExplorer::wheelEvent(QWheelEvent* event)\n{\n    double factor;\n\n    if (event->modifiers() & Qt::ControlModifier)\n    {\n        factor = 0.01;\n    }\n    else if (event->modifiers() & Qt::ShiftModifier)\n    {\n        factor = 1.0;\n    }\n    else\n    {\n        factor = 0.1;\n    }\n    factor *= 0.03;\n\n    if (event->orientation() == Qt::Vertical)\n    {\n        _current_camera->strafeForward((double) event->delta() * factor);\n        updateGL();\n    }\n    event->accept();\n}\n\nvoid WidgetExplorer::timerEvent(QTimerEvent*)\n{\n    if (!_inited)\n    {\n        _inited = true;\n        startRendering();\n    }\n\n    if (_updated)\n    {\n        _updated = false;\n        updateGL();\n    }\n\n    for (int i = 0; i < _chunks.count(); i++)\n    {\n        _chunks[i]->updatePriority(_current_camera);\n    }\n    _lock_chunks.lock();\n    qSort(_updateQueue.begin(), _updateQueue.end(), _cmpChunks);\n    _lock_chunks.unlock();\n}\n\nvoid WidgetExplorer::initializeGL()\n{\n    _opengl_renderer->initialize();\n}\n\nvoid WidgetExplorer::resizeGL(int w, int h)\n{\n    _current_camera->setRenderSize(w, h);\n    _opengl_renderer->resize(w, h);\n}\n\nvoid WidgetExplorer::paintGL()\n{\n    GLenum error_code;\n    QTime start_time;\n    double frame_time;\n    WaterDefinition* water = _renderer->water->definition;\n\n    \/\/ Don't do this at each frame, only on camera change\n    _renderer->getScenery()->setCamera(_current_camera);\n\n    start_time = QTime::currentTime();\n\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n    Vector3 camera_location = _current_camera->getLocation();\n    Vector3 camera_target = _current_camera->getTarget();\n    Vector3 camera_up = _current_camera->getUpVector();\n    gluLookAt(camera_location.x, camera_location.y, camera_location.z, camera_target.x, camera_target.y, camera_target.z, camera_up.x, camera_up.y, camera_up.z);\n\n    \/\/ Background\n    glClearColor(0.0, 0.0, 0.0, 0.0);\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n    \/\/ Render water\n    double water_height = _renderer->terrain->getWaterHeight(_renderer);\n    glDisable(GL_TEXTURE_2D);\n    glColor3f(water->material->_rgb.r, water->material->_rgb.g, water->material->_rgb.b);\n    glBegin(GL_QUADS);\n    glVertex3f(camera_location.x - 500.0, water_height, camera_location.z - 500.0);\n    glVertex3f(camera_location.x - 500.0, water_height, camera_location.z + 500.0);\n    glVertex3f(camera_location.x + 500.0, water_height, camera_location.z + 500.0);\n    glVertex3f(camera_location.x + 500.0, water_height, camera_location.z - 500.0);\n    glEnd();\n\n    \/\/ Render chunks\n    glEnable(GL_TEXTURE_2D);\n    for (int i = 0; i < _chunks.count(); i++)\n    {\n        glColor3f(1.0, 1.0, 1.0);\n        _chunks[i]->render(this);\n    }\n\n    frame_time = 0.001 * (double) start_time.msecsTo(QTime::currentTime());\n\n    _average_frame_time = _average_frame_time * 0.8 + frame_time * 0.2;\n    \/\/printf(\"%d %f\\n\", quality, average_frame_time);\n\n    if (_average_frame_time > 0.1 && _quality > 1)\n    {\n        _quality--;\n    }\n    if (_average_frame_time < 0.04 && _quality < 10)\n    {\n        _quality++;\n    }\n\n    \/\/ Messages\n    if (!_inited)\n    {\n        glColor3f(0.0, 0.0, 0.0);\n        renderText(6, height() - 10, tr(\"Please wait while loading scene...\"));\n        glColor3f(1.0, 1.0, 1.0);\n        renderText(5, height() - 9, tr(\"Please wait while loading scene...\"));\n    }\n\n    while ((error_code = glGetError()) != GL_NO_ERROR)\n    {\n        qDebug(\"[OpenGL] ERROR : %s\", (const char*)gluErrorString(error_code));\n    }\n}\n<commit_msg>Fixed camera above ground checking in opengl renderer<commit_after>#include \"WidgetExplorer.h\"\n\n#include <QGLWidget>\n#include <QKeyEvent>\n#include <QTime>\n#include <cmath>\n#include <GL\/glu.h>\n#include <QThread>\n#include \"Scenery.h\"\n#include \"SoftwareRenderer.h\"\n#include \"OpenGLRenderer.h\"\n#include \"WaterDefinition.h\"\n#include \"SurfaceMaterial.h\"\n#include \"tools\/euclid.h\"\n#include \"renderer.h\"\n#include \"CameraDefinition.h\"\n#include \"atmosphere\/public.h\"\n#include \"water\/public.h\"\n#include \"terrain\/public.h\"\n#include \"ExplorerChunkSky.h\"\n#include \"ExplorerChunkTerrain.h\"\n\nclass ChunkMaintenanceThread : public QThread\n{\npublic:\n\n    ChunkMaintenanceThread(WidgetExplorer* wanderer)\n    {\n        _wanderer = wanderer;\n        _running = true;\n    }\n\n    void askStop()\n    {\n        _running = false;\n    }\n\n    static inline void usleep(unsigned long us)\n    {\n        QThread::usleep(us);\n    }\n\nprotected:\n\n    void run()\n    {\n        while (_running)\n        {\n            _wanderer->performChunksMaintenance();\n            QThread::usleep(10000);\n        }\n    }\n\nprivate:\n    bool _running;\n    WidgetExplorer* _wanderer;\n};\n\nstatic QVector<ChunkMaintenanceThread*> _threads;\n\nstatic Vector3 _getCameraLocation(Renderer* renderer, Vector3)\n{\n    return ((CameraDefinition*)renderer->customData[2])->getLocation();\n}\n\nstatic AtmosphereResult _applyAerialPerspective(Renderer*, Vector3, Color base)\n{\n    AtmosphereResult result;\n    atmosphereInitResult(&result);\n    result.base = base;\n    result.final = base;\n    atmosphereUpdateResult(&result);\n    return result;\n}\n\nWidgetExplorer::WidgetExplorer(QWidget *parent, CameraDefinition* camera, SoftwareRenderer* renderer) :\nQGLWidget(parent)\n{\n    setMinimumSize(400, 300);\n    setFocusPolicy(Qt::StrongFocus);\n\n    _current_camera = new CameraDefinition;\n    _base_camera = camera;\n    camera->copy(_current_camera);\n\n    if (renderer)\n    {\n        _renderer = renderer;\n        _renderer_created = false;\n    }\n    else\n    {\n        _renderer = new SoftwareRenderer(Scenery::getCurrent());\n        _renderer_created = true;\n    }\n    _opengl_renderer = new OpenGLRenderer(NULL);\n    _renderer->prepare();\n    _renderer->render_quality = 3;\n    _renderer->customData[2] = _base_camera;\n    _renderer->getCameraLocation = _getCameraLocation;\n    _renderer->atmosphere->applyAerialPerspective = _applyAerialPerspective;\n    lightingManagerDisableSpecularity(_renderer->lighting);\n\n    _inited = false;\n    _updated = false;\n\n    _average_frame_time = 0.05;\n    _quality = 3;\n    _last_mouse_x = 0;\n    _last_mouse_y = 0;\n\n    startTimer(500);\n}\n\nWidgetExplorer::~WidgetExplorer()\n{\n    stopRendering();\n\n    for (int i = 0; i < _chunks.count(); i++)\n    {\n        delete _chunks[i];\n    }\n    delete _current_camera;\n\n    if (_renderer_created)\n    {\n        rendererDelete(_renderer);\n    }\n    delete _opengl_renderer;\n}\n\nvoid WidgetExplorer::startRendering()\n{\n    \/\/ Add terrain\n    int chunks = 20;\n    double size = 400.0;\n    double chunksize = size \/ (double) chunks;\n    double start = -size \/ 2.0;\n    double water_height = _renderer->water->getHeightInfo(_renderer).base_height;\n    for (int i = 0; i < chunks; i++)\n    {\n        for (int j = 0; j < chunks; j++)\n        {\n            ExplorerChunkTerrain* chunk = new ExplorerChunkTerrain(_renderer, start + chunksize * (double) i, start + chunksize * (double) j, chunksize, chunks, water_height);\n            _chunks.append(chunk);\n            _updateQueue.append(chunk);\n        }\n    }\n\n    \/\/ Add skybox\n    for (int orientation = 0; orientation < 5; orientation++)\n    {\n        ExplorerChunkSky* chunk = new ExplorerChunkSky(_renderer, 500.0, (SkyboxOrientation) orientation);\n        _chunks.append(chunk);\n        _updateQueue.append(chunk);\n    }\n\n    \/\/ Start rendering workers\n    int nbcore;\n    _alive = true;\n\n    nbcore = QThread::idealThreadCount();\n    if (nbcore < 1)\n    {\n        nbcore = 1;\n    }\n\n    for (int i = 0; i < nbcore; i++)\n    {\n        _threads.append(new ChunkMaintenanceThread(this));\n    }\n    for (int i = 0; i < _threads.count(); i++)\n    {\n        _threads[i]->start();\n    }\n}\n\nvoid WidgetExplorer::stopRendering()\n{\n    for (int i = 0; i < _threads.count(); i++)\n    {\n        _threads[i]->askStop();\n    }\n    _alive = false;\n    for (int i = 0; i < _threads.count(); i++)\n    {\n        _threads[i]->wait();\n    }\n}\n\nbool _cmpChunks(const BaseExplorerChunk* c1, const BaseExplorerChunk* c2)\n{\n    return c1->priority > c2->priority;\n}\n\nvoid WidgetExplorer::performChunksMaintenance()\n{\n    BaseExplorerChunk* chunk;\n\n    _lock_chunks.lock();\n    if (_updateQueue.count() > 0)\n    {\n        chunk = _updateQueue.takeFirst();\n        _lock_chunks.unlock();\n    }\n    else\n    {\n        _lock_chunks.unlock();\n        return;\n    }\n\n    if (chunk->maintain())\n    {\n        if (!_alive)\n        {\n            return;\n        }\n\n        _updated = true;\n    }\n\n    _lock_chunks.lock();\n    _updateQueue.append(chunk);\n    _lock_chunks.unlock();\n}\n\nvoid WidgetExplorer::resetCamera()\n{\n    _base_camera->copy(_current_camera);\n    updateGL();\n}\n\nvoid WidgetExplorer::validateCamera()\n{\n    _current_camera->copy(_base_camera);\n}\n\nvoid WidgetExplorer::keyPressEvent(QKeyEvent* event)\n{\n    double factor;\n\n    if (event->modifiers() & Qt::ControlModifier)\n    {\n        factor = 0.1;\n    }\n    else if (event->modifiers() & Qt::ShiftModifier)\n    {\n        factor = 10.0;\n    }\n    else\n    {\n        factor = 1.0;\n    }\n    factor *= 3.0;\n\n    if (event->key() == Qt::Key_Up)\n    {\n        _current_camera->strafeForward(0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_Down)\n    {\n        _current_camera->strafeForward(-0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_Right)\n    {\n        _current_camera->strafeRight(0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_Left)\n    {\n        _current_camera->strafeRight(-0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_PageUp)\n    {\n        _current_camera->strafeUp(0.1 * factor);\n        updateGL();\n    }\n    else if (event->key() == Qt::Key_PageDown)\n    {\n        _current_camera->strafeUp(-0.1 * factor);\n        updateGL();\n    }\n    else\n    {\n        QGLWidget::keyPressEvent(event);\n    }\n}\n\nvoid WidgetExplorer::mousePressEvent(QMouseEvent* event)\n{\n    _last_mouse_x = event->x();\n    _last_mouse_y = event->y();\n\n    event->ignore();\n}\n\nvoid WidgetExplorer::mouseMoveEvent(QMouseEvent* event)\n{\n    double factor;\n\n    if (event->modifiers() & Qt::ControlModifier)\n    {\n        factor = 0.01;\n    }\n    else if (event->modifiers() & Qt::ShiftModifier)\n    {\n        factor = 1.0;\n    }\n    else\n    {\n        factor = 0.1;\n    }\n    factor *= 0.2;\n\n    if (event->buttons() & Qt::LeftButton)\n    {\n        _current_camera->rotateYaw((double) (event->x() - _last_mouse_x) * factor * 0.1);\n        _current_camera->rotatePitch((double) (event->y() - _last_mouse_y) * factor * 0.1);\n        updateGL();\n        event->accept();\n    }\n    else if (event->buttons() & Qt::RightButton)\n    {\n        _current_camera->strafeRight((double) (_last_mouse_x - event->x()) * factor);\n        _current_camera->strafeUp((double) (event->y() - _last_mouse_y) * factor);\n        updateGL();\n        event->accept();\n    }\n    else\n    {\n        event->ignore();\n    }\n\n    _last_mouse_x = event->x();\n    _last_mouse_y = event->y();\n}\n\nvoid WidgetExplorer::wheelEvent(QWheelEvent* event)\n{\n    double factor;\n\n    if (event->modifiers() & Qt::ControlModifier)\n    {\n        factor = 0.01;\n    }\n    else if (event->modifiers() & Qt::ShiftModifier)\n    {\n        factor = 1.0;\n    }\n    else\n    {\n        factor = 0.1;\n    }\n    factor *= 0.03;\n\n    if (event->orientation() == Qt::Vertical)\n    {\n        _current_camera->strafeForward((double) event->delta() * factor);\n        updateGL();\n    }\n    event->accept();\n}\n\nvoid WidgetExplorer::timerEvent(QTimerEvent*)\n{\n    if (!_inited)\n    {\n        _inited = true;\n        startRendering();\n    }\n\n    if (_updated)\n    {\n        _updated = false;\n        updateGL();\n    }\n\n    for (int i = 0; i < _chunks.count(); i++)\n    {\n        _chunks[i]->updatePriority(_current_camera);\n    }\n    _lock_chunks.lock();\n    qSort(_updateQueue.begin(), _updateQueue.end(), _cmpChunks);\n    _lock_chunks.unlock();\n}\n\nvoid WidgetExplorer::initializeGL()\n{\n    _opengl_renderer->initialize();\n}\n\nvoid WidgetExplorer::resizeGL(int w, int h)\n{\n    _current_camera->setRenderSize(w, h);\n    _opengl_renderer->resize(w, h);\n}\n\nvoid WidgetExplorer::paintGL()\n{\n    GLenum error_code;\n    QTime start_time;\n    double frame_time;\n    WaterDefinition* water = _renderer->water->definition;\n\n    \/\/ Don't do this at each frame, only on camera change\n    _renderer->getScenery()->setCamera(_current_camera);\n    _renderer->getScenery()->getCamera(_current_camera);\n\n    start_time = QTime::currentTime();\n\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n    Vector3 camera_location = _current_camera->getLocation();\n    Vector3 camera_target = _current_camera->getTarget();\n    Vector3 camera_up = _current_camera->getUpVector();\n    gluLookAt(camera_location.x, camera_location.y, camera_location.z, camera_target.x, camera_target.y, camera_target.z, camera_up.x, camera_up.y, camera_up.z);\n\n    \/\/ Background\n    glClearColor(0.0, 0.0, 0.0, 0.0);\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n    \/\/ Render water\n    double water_height = _renderer->terrain->getWaterHeight(_renderer);\n    glDisable(GL_TEXTURE_2D);\n    glColor3f(water->material->_rgb.r, water->material->_rgb.g, water->material->_rgb.b);\n    glBegin(GL_QUADS);\n    glVertex3f(camera_location.x - 500.0, water_height, camera_location.z - 500.0);\n    glVertex3f(camera_location.x - 500.0, water_height, camera_location.z + 500.0);\n    glVertex3f(camera_location.x + 500.0, water_height, camera_location.z + 500.0);\n    glVertex3f(camera_location.x + 500.0, water_height, camera_location.z - 500.0);\n    glEnd();\n\n    \/\/ Render chunks\n    glEnable(GL_TEXTURE_2D);\n    for (int i = 0; i < _chunks.count(); i++)\n    {\n        glColor3f(1.0, 1.0, 1.0);\n        _chunks[i]->render(this);\n    }\n\n    frame_time = 0.001 * (double) start_time.msecsTo(QTime::currentTime());\n\n    _average_frame_time = _average_frame_time * 0.8 + frame_time * 0.2;\n    \/\/printf(\"%d %f\\n\", quality, average_frame_time);\n\n    if (_average_frame_time > 0.1 && _quality > 1)\n    {\n        _quality--;\n    }\n    if (_average_frame_time < 0.04 && _quality < 10)\n    {\n        _quality++;\n    }\n\n    \/\/ Messages\n    if (!_inited)\n    {\n        glColor3f(0.0, 0.0, 0.0);\n        renderText(6, height() - 10, tr(\"Please wait while loading scene...\"));\n        glColor3f(1.0, 1.0, 1.0);\n        renderText(5, height() - 9, tr(\"Please wait while loading scene...\"));\n    }\n\n    while ((error_code = glGetError()) != GL_NO_ERROR)\n    {\n        qDebug(\"[OpenGL] ERROR : %s\", (const char*)gluErrorString(error_code));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.osgeo.org\n *\n * Copyright (C) 2011 Sandro Santilli <strk@kbt.io>\n * Copyright (C) 2005-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\/ConvexHull.java r407 (JTS-1.12+)\n *\n **********************************************************************\/\n\n#include <geos\/algorithm\/ConvexHull.h>\n#include <geos\/algorithm\/PointLocation.h>\n#include <geos\/algorithm\/Orientation.h>\n#include <geos\/geom\/GeometryFactory.h>\n#include <geos\/geom\/Coordinate.h>\n#include <geos\/geom\/Point.h>\n#include <geos\/geom\/Polygon.h>\n#include <geos\/geom\/LineString.h>\n#include <geos\/geom\/CoordinateSequence.h>\n#include <geos\/geom\/CoordinateSequenceFactory.h>\n#include <geos\/util\/Interrupt.h>\n\n#include <typeinfo>\n#include <algorithm>\n\n#ifndef GEOS_INLINE\n# include \"geos\/algorithm\/ConvexHull.inl\"\n#endif\n\nusing namespace geos::geom;\n\nnamespace geos {\nnamespace algorithm { \/\/ geos.algorithm\n\nnamespace {\n\n\/**\n * This is the class used to sort in radial order.\n * It's defined here as it's a static one.\n *\/\nclass RadiallyLessThen {\n\nprivate:\n\n    const Coordinate* origin;\n\n    int\n    polarCompare(const Coordinate* o, const Coordinate* p,\n                 const Coordinate* q)\n    {\n        double dxp = p->x - o->x;\n        double dyp = p->y - o->y;\n        double dxq = q->x - o->x;\n        double dyq = q->y - o->y;\n\n        int orient = Orientation::index(*o, *p, *q);\n\n        if(orient == Orientation::COUNTERCLOCKWISE) {\n            return 1;\n        }\n        if(orient == Orientation::CLOCKWISE) {\n            return -1;\n        }\n\n        \/\/ points are collinear - check distance\n        double op = dxp * dxp + dyp * dyp;\n        double oq = dxq * dxq + dyq * dyq;\n        if(op < oq) {\n            return -1;\n        }\n        if(op > oq) {\n            return 1;\n        }\n        return 0;\n    }\n\npublic:\n\n    RadiallyLessThen(const Coordinate* c): origin(c) {}\n\n    bool\n    operator()(const Coordinate* p1, const Coordinate* p2)\n    {\n        return (polarCompare(origin, p1, p2) == -1);\n    }\n\n};\n\n} \/\/ unnamed namespace\n\n\/* private *\/\nstd::unique_ptr<CoordinateSequence>\nConvexHull::toCoordinateSequence(Coordinate::ConstVect& cv)\n{\n    const CoordinateSequenceFactory* csf =\n        geomFactory->getCoordinateSequenceFactory();\n\n    std::vector<Coordinate> vect(cv.size());\n\n    for(size_t i = 0; i < cv.size(); ++i) {\n        vect[i] = *(cv[i]); \/\/ Coordinate copy\n    }\n\n    return csf->create(std::move(vect)); \/\/ takes ownership of the vector\n}\n\n\/* private *\/\nvoid\nConvexHull::computeOctPts(const Coordinate::ConstVect& p_inputPts,\n                          Coordinate::ConstVect& pts)\n{\n    \/\/ Initialize all slots with first input coordinate\n    pts = Coordinate::ConstVect(8, p_inputPts[0]);\n\n    for(size_t i = 1, n = p_inputPts.size(); i < n; ++i) {\n        if(p_inputPts[i]->x < pts[0]->x) {\n            pts[0] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x - p_inputPts[i]->y < pts[1]->x - pts[1]->y) {\n            pts[1] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->y > pts[2]->y) {\n            pts[2] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x + p_inputPts[i]->y > pts[3]->x + pts[3]->y) {\n            pts[3] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x > pts[4]->x) {\n            pts[4] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x - p_inputPts[i]->y > pts[5]->x - pts[5]->y) {\n            pts[5] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->y < pts[6]->y) {\n            pts[6] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x + p_inputPts[i]->y < pts[7]->x + pts[7]->y) {\n            pts[7] = p_inputPts[i];\n        }\n    }\n\n}\n\n\n\/* private *\/\nbool\nConvexHull::computeOctRing(const Coordinate::ConstVect& p_inputPts,\n                           Coordinate::ConstVect& dest)\n{\n    computeOctPts(p_inputPts, dest);\n\n    \/\/ Remove consecutive equal Coordinates\n    \/\/ unique() returns an iterator to the end of the resulting\n    \/\/ sequence, we erase from there to the end.\n    dest.erase(std::unique(dest.begin(), dest.end()), dest.end());\n\n    \/\/ points must all lie in a line\n    if(dest.size() < 3) {\n        return false;\n    }\n\n    \/\/ close ring\n    dest.push_back(dest[0]);\n\n    return true;\n}\n\n\/* private *\/\nvoid\nConvexHull::reduce(Coordinate::ConstVect& pts)\n{\n    Coordinate::ConstVect polyPts;\n\n    if(! computeOctRing(pts, polyPts)) {\n        \/\/ unable to compute interior polygon for some reason\n        return;\n    }\n\n    \/\/ add points defining polygon\n    Coordinate::ConstSet reducedSet;\n    reducedSet.insert(polyPts.begin(), polyPts.end());\n\n    \/**\n     * Add all unique points not in the interior poly.\n     * CGAlgorithms.isPointInRing is not defined for points\n     * actually on the ring, but this doesn't matter since\n     * the points of the interior polygon are forced to be\n     * in the reduced set.\n     *\n     * @@TIP: there should be a std::algo for this\n     *\/\n    for(size_t i = 0, n = pts.size(); i < n; ++i) {\n        if(!PointLocation::isInRing(*(pts[i]), polyPts)) {\n            reducedSet.insert(pts[i]);\n        }\n    }\n\n    inputPts.assign(reducedSet.begin(), reducedSet.end());\n\n    if(inputPts.size() < 3) {\n        padArray3(inputPts);\n    }\n}\n\n\/* private *\/\nvoid\nConvexHull::padArray3(geom::Coordinate::ConstVect& pts)\n{\n    for(size_t i = pts.size(); i < 3; ++i) {\n        pts.push_back(pts[0]);\n    }\n}\n\nstd::unique_ptr<Geometry>\nConvexHull::getConvexHull()\n{\n    size_t nInputPts = inputPts.size();\n\n    if(nInputPts == 0) { \/\/ Return an empty geometry\n        return std::unique_ptr<Geometry>(geomFactory->createEmptyGeometry());\n    }\n\n    if(nInputPts == 1) { \/\/ Return a Point\n        \/\/ Copy the Coordinate from the ConstVect\n        return std::unique_ptr<Geometry>(geomFactory->createPoint(*(inputPts[0])));\n    }\n\n    if(nInputPts == 2) { \/\/ Return a LineString\n        \/\/ Copy all Coordinates from the ConstVect\n        auto cs = toCoordinateSequence(inputPts);\n        return std::unique_ptr<Geometry>(geomFactory->createLineString(cs.release()));\n    }\n\n    \/\/ use heuristic to reduce points, if large\n    if(nInputPts > 50) {\n        reduce(inputPts);\n    }\n\n    GEOS_CHECK_FOR_INTERRUPTS();\n\n    \/\/ sort points for Graham scan.\n    preSort(inputPts);\n\n    GEOS_CHECK_FOR_INTERRUPTS();\n\n    \/\/ Use Graham scan to find convex hull.\n    Coordinate::ConstVect cHS;\n    grahamScan(inputPts, cHS);\n\n    GEOS_CHECK_FOR_INTERRUPTS();\n\n    return lineOrPolygon(cHS);\n}\n\n\/* private *\/\nvoid\nConvexHull::preSort(Coordinate::ConstVect& pts)\n{\n    \/\/ find the lowest point in the set. If two or more points have\n    \/\/ the same minimum y coordinate choose the one with the minimum x.\n    \/\/ This focal point is put in array location pts[0].\n    for(size_t i = 1, n = pts.size(); i < n; ++i) {\n        const Coordinate* p0 = pts[0]; \/\/ this will change\n        const Coordinate* pi = pts[i];\n        if((pi->y < p0->y) || ((pi->y == p0->y) && (pi->x < p0->x))) {\n            const Coordinate* t = p0;\n            pts[0] = pi;\n            pts[i] = t;\n        }\n    }\n\n    \/\/ sort the points radially around the focal point.\n    std::sort(pts.begin(), pts.end(), RadiallyLessThen(pts[0]));\n}\n\n\/*private*\/\nvoid\nConvexHull::grahamScan(const Coordinate::ConstVect& c,\n                       Coordinate::ConstVect& ps)\n{\n    ps.push_back(c[0]);\n    ps.push_back(c[1]);\n    ps.push_back(c[2]);\n\n    for(size_t i = 3, n = c.size(); i < n; ++i) {\n        const Coordinate* p = ps.back();\n        ps.pop_back();\n        while(!ps.empty() &&\n                Orientation::index(\n                    *(ps.back()), *p, *(c[i])) > 0) {\n            p = ps.back();\n            ps.pop_back();\n        }\n        ps.push_back(p);\n        ps.push_back(c[i]);\n    }\n    ps.push_back(c[0]);\n}\n\n\n\/*private*\/\nbool\nConvexHull::isBetween(const Coordinate& c1, const Coordinate& c2, const Coordinate& c3)\n{\n    if(Orientation::index(c1, c2, c3) != 0) {\n        return false;\n    }\n    if(c1.x != c3.x) {\n        if(c1.x <= c2.x && c2.x <= c3.x) {\n            return true;\n        }\n        if(c3.x <= c2.x && c2.x <= c1.x) {\n            return true;\n        }\n    }\n    if(c1.y != c3.y) {\n        if(c1.y <= c2.y && c2.y <= c3.y) {\n            return true;\n        }\n        if(c3.y <= c2.y && c2.y <= c1.y) {\n            return true;\n        }\n    }\n    return false;\n}\n\n\n\/* private *\/\nstd::unique_ptr<Geometry>\nConvexHull::lineOrPolygon(const Coordinate::ConstVect& input)\n{\n    Coordinate::ConstVect cleaned;\n\n    cleanRing(input, cleaned);\n\n    if(cleaned.size() == 3) { \/\/ shouldn't this be 2 ??\n        cleaned.resize(2);\n        auto cl1 = toCoordinateSequence(cleaned);\n        return geomFactory->createLineString(std::move(cl1));\n    }\n    auto cl2 = toCoordinateSequence(cleaned);\n    std::unique_ptr<LinearRing> linearRing = geomFactory->createLinearRing(std::move(cl2));\n    return geomFactory->createPolygon(std::move(linearRing));\n}\n\n\/*private*\/\nvoid\nConvexHull::cleanRing(const Coordinate::ConstVect& original,\n                      Coordinate::ConstVect& cleaned)\n{\n    size_t npts = original.size();\n\n    const Coordinate* last = original[npts - 1];\n\n    \/\/util::Assert::equals(*(original[0]), *last);\n    assert(last);\n    assert(original[0]->equals2D(*last));\n\n    const Coordinate* prev = nullptr;\n    for(size_t i = 0; i < npts - 1; ++i) {\n        const Coordinate* curr = original[i];\n        const Coordinate* next = original[i + 1];\n\n        \/\/ skip consecutive equal coordinates\n        if(curr->equals2D(*next)) {\n            continue;\n        }\n\n        if(prev != nullptr &&  isBetween(*prev, *curr, *next)) {\n            continue;\n        }\n\n        cleaned.push_back(curr);\n        prev = curr;\n    }\n\n    cleaned.push_back(last);\n\n}\n\n\n} \/\/ namespace geos.algorithm\n} \/\/ namespace geos\n\n<commit_msg>Minor simplification in ConvexHull<commit_after>\/**********************************************************************\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.osgeo.org\n *\n * Copyright (C) 2011 Sandro Santilli <strk@kbt.io>\n * Copyright (C) 2005-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\/ConvexHull.java r407 (JTS-1.12+)\n *\n **********************************************************************\/\n\n#include <geos\/algorithm\/ConvexHull.h>\n#include <geos\/algorithm\/PointLocation.h>\n#include <geos\/algorithm\/Orientation.h>\n#include <geos\/geom\/GeometryFactory.h>\n#include <geos\/geom\/Coordinate.h>\n#include <geos\/geom\/Point.h>\n#include <geos\/geom\/Polygon.h>\n#include <geos\/geom\/LineString.h>\n#include <geos\/geom\/CoordinateSequence.h>\n#include <geos\/geom\/CoordinateSequenceFactory.h>\n#include <geos\/util\/Interrupt.h>\n\n#include <typeinfo>\n#include <algorithm>\n\n#ifndef GEOS_INLINE\n# include \"geos\/algorithm\/ConvexHull.inl\"\n#endif\n\nusing namespace geos::geom;\n\nnamespace geos {\nnamespace algorithm { \/\/ geos.algorithm\n\nnamespace {\n\n\/**\n * This is the class used to sort in radial order.\n * It's defined here as it's a static one.\n *\/\nclass RadiallyLessThen {\n\nprivate:\n\n    const Coordinate* origin;\n\n    int\n    polarCompare(const Coordinate* o, const Coordinate* p,\n                 const Coordinate* q)\n    {\n        double dxp = p->x - o->x;\n        double dyp = p->y - o->y;\n        double dxq = q->x - o->x;\n        double dyq = q->y - o->y;\n\n        int orient = Orientation::index(*o, *p, *q);\n\n        if(orient == Orientation::COUNTERCLOCKWISE) {\n            return 1;\n        }\n        if(orient == Orientation::CLOCKWISE) {\n            return -1;\n        }\n\n        \/\/ points are collinear - check distance\n        double op = dxp * dxp + dyp * dyp;\n        double oq = dxq * dxq + dyq * dyq;\n        if(op < oq) {\n            return -1;\n        }\n        if(op > oq) {\n            return 1;\n        }\n        return 0;\n    }\n\npublic:\n\n    RadiallyLessThen(const Coordinate* c): origin(c) {}\n\n    bool\n    operator()(const Coordinate* p1, const Coordinate* p2)\n    {\n        return (polarCompare(origin, p1, p2) == -1);\n    }\n\n};\n\n} \/\/ unnamed namespace\n\n\/* private *\/\nstd::unique_ptr<CoordinateSequence>\nConvexHull::toCoordinateSequence(Coordinate::ConstVect& cv)\n{\n    const CoordinateSequenceFactory* csf =\n        geomFactory->getCoordinateSequenceFactory();\n\n    std::vector<Coordinate> vect(cv.size());\n\n    for(size_t i = 0; i < cv.size(); ++i) {\n        vect[i] = *(cv[i]); \/\/ Coordinate copy\n    }\n\n    return csf->create(std::move(vect)); \/\/ takes ownership of the vector\n}\n\n\/* private *\/\nvoid\nConvexHull::computeOctPts(const Coordinate::ConstVect& p_inputPts,\n                          Coordinate::ConstVect& pts)\n{\n    \/\/ Initialize all slots with first input coordinate\n    pts = Coordinate::ConstVect(8, p_inputPts[0]);\n\n    for(size_t i = 1, n = p_inputPts.size(); i < n; ++i) {\n        if(p_inputPts[i]->x < pts[0]->x) {\n            pts[0] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x - p_inputPts[i]->y < pts[1]->x - pts[1]->y) {\n            pts[1] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->y > pts[2]->y) {\n            pts[2] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x + p_inputPts[i]->y > pts[3]->x + pts[3]->y) {\n            pts[3] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x > pts[4]->x) {\n            pts[4] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x - p_inputPts[i]->y > pts[5]->x - pts[5]->y) {\n            pts[5] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->y < pts[6]->y) {\n            pts[6] = p_inputPts[i];\n        }\n        if(p_inputPts[i]->x + p_inputPts[i]->y < pts[7]->x + pts[7]->y) {\n            pts[7] = p_inputPts[i];\n        }\n    }\n\n}\n\n\n\/* private *\/\nbool\nConvexHull::computeOctRing(const Coordinate::ConstVect& p_inputPts,\n                           Coordinate::ConstVect& dest)\n{\n    computeOctPts(p_inputPts, dest);\n\n    \/\/ Remove consecutive equal Coordinates\n    \/\/ unique() returns an iterator to the end of the resulting\n    \/\/ sequence, we erase from there to the end.\n    dest.erase(std::unique(dest.begin(), dest.end()), dest.end());\n\n    \/\/ points must all lie in a line\n    if(dest.size() < 3) {\n        return false;\n    }\n\n    \/\/ close ring\n    dest.push_back(dest[0]);\n\n    return true;\n}\n\n\/* private *\/\nvoid\nConvexHull::reduce(Coordinate::ConstVect& pts)\n{\n    Coordinate::ConstVect polyPts;\n\n    if(! computeOctRing(pts, polyPts)) {\n        \/\/ unable to compute interior polygon for some reason\n        return;\n    }\n\n    \/\/ add points defining polygon\n    Coordinate::ConstSet reducedSet;\n    reducedSet.insert(polyPts.begin(), polyPts.end());\n\n    \/**\n     * Add all unique points not in the interior poly.\n     * CGAlgorithms.isPointInRing is not defined for points\n     * actually on the ring, but this doesn't matter since\n     * the points of the interior polygon are forced to be\n     * in the reduced set.\n     *\n     * @@TIP: there should be a std::algo for this\n     *\/\n    for(size_t i = 0, n = pts.size(); i < n; ++i) {\n        if(!PointLocation::isInRing(*(pts[i]), polyPts)) {\n            reducedSet.insert(pts[i]);\n        }\n    }\n\n    inputPts.assign(reducedSet.begin(), reducedSet.end());\n\n    if(inputPts.size() < 3) {\n        padArray3(inputPts);\n    }\n}\n\n\/* private *\/\nvoid\nConvexHull::padArray3(geom::Coordinate::ConstVect& pts)\n{\n    for(size_t i = pts.size(); i < 3; ++i) {\n        pts.push_back(pts[0]);\n    }\n}\n\nstd::unique_ptr<Geometry>\nConvexHull::getConvexHull()\n{\n    size_t nInputPts = inputPts.size();\n\n    if(nInputPts == 0) { \/\/ Return an empty geometry\n        return geomFactory->createEmptyGeometry();\n    }\n\n    if(nInputPts == 1) { \/\/ Return a Point\n        \/\/ Copy the Coordinate from the ConstVect\n        return std::unique_ptr<Geometry>(geomFactory->createPoint(*(inputPts[0])));\n    }\n\n    if(nInputPts == 2) { \/\/ Return a LineString\n        \/\/ Copy all Coordinates from the ConstVect\n        auto cs = toCoordinateSequence(inputPts);\n        return geomFactory->createLineString(std::move(cs));\n    }\n\n    \/\/ use heuristic to reduce points, if large\n    if(nInputPts > 50) {\n        reduce(inputPts);\n    }\n\n    GEOS_CHECK_FOR_INTERRUPTS();\n\n    \/\/ sort points for Graham scan.\n    preSort(inputPts);\n\n    GEOS_CHECK_FOR_INTERRUPTS();\n\n    \/\/ Use Graham scan to find convex hull.\n    Coordinate::ConstVect cHS;\n    grahamScan(inputPts, cHS);\n\n    GEOS_CHECK_FOR_INTERRUPTS();\n\n    return lineOrPolygon(cHS);\n}\n\n\/* private *\/\nvoid\nConvexHull::preSort(Coordinate::ConstVect& pts)\n{\n    \/\/ find the lowest point in the set. If two or more points have\n    \/\/ the same minimum y coordinate choose the one with the minimum x.\n    \/\/ This focal point is put in array location pts[0].\n    for(size_t i = 1, n = pts.size(); i < n; ++i) {\n        const Coordinate* p0 = pts[0]; \/\/ this will change\n        const Coordinate* pi = pts[i];\n        if((pi->y < p0->y) || ((pi->y == p0->y) && (pi->x < p0->x))) {\n            const Coordinate* t = p0;\n            pts[0] = pi;\n            pts[i] = t;\n        }\n    }\n\n    \/\/ sort the points radially around the focal point.\n    std::sort(pts.begin(), pts.end(), RadiallyLessThen(pts[0]));\n}\n\n\/*private*\/\nvoid\nConvexHull::grahamScan(const Coordinate::ConstVect& c,\n                       Coordinate::ConstVect& ps)\n{\n    ps.push_back(c[0]);\n    ps.push_back(c[1]);\n    ps.push_back(c[2]);\n\n    for(size_t i = 3, n = c.size(); i < n; ++i) {\n        const Coordinate* p = ps.back();\n        ps.pop_back();\n        while(!ps.empty() &&\n                Orientation::index(\n                    *(ps.back()), *p, *(c[i])) > 0) {\n            p = ps.back();\n            ps.pop_back();\n        }\n        ps.push_back(p);\n        ps.push_back(c[i]);\n    }\n    ps.push_back(c[0]);\n}\n\n\n\/*private*\/\nbool\nConvexHull::isBetween(const Coordinate& c1, const Coordinate& c2, const Coordinate& c3)\n{\n    if(Orientation::index(c1, c2, c3) != 0) {\n        return false;\n    }\n    if(c1.x != c3.x) {\n        if(c1.x <= c2.x && c2.x <= c3.x) {\n            return true;\n        }\n        if(c3.x <= c2.x && c2.x <= c1.x) {\n            return true;\n        }\n    }\n    if(c1.y != c3.y) {\n        if(c1.y <= c2.y && c2.y <= c3.y) {\n            return true;\n        }\n        if(c3.y <= c2.y && c2.y <= c1.y) {\n            return true;\n        }\n    }\n    return false;\n}\n\n\n\/* private *\/\nstd::unique_ptr<Geometry>\nConvexHull::lineOrPolygon(const Coordinate::ConstVect& input)\n{\n    Coordinate::ConstVect cleaned;\n\n    cleanRing(input, cleaned);\n\n    if(cleaned.size() == 3) { \/\/ shouldn't this be 2 ??\n        cleaned.resize(2);\n        auto cl1 = toCoordinateSequence(cleaned);\n        return geomFactory->createLineString(std::move(cl1));\n    }\n    auto cl2 = toCoordinateSequence(cleaned);\n    std::unique_ptr<LinearRing> linearRing = geomFactory->createLinearRing(std::move(cl2));\n    return geomFactory->createPolygon(std::move(linearRing));\n}\n\n\/*private*\/\nvoid\nConvexHull::cleanRing(const Coordinate::ConstVect& original,\n                      Coordinate::ConstVect& cleaned)\n{\n    size_t npts = original.size();\n\n    const Coordinate* last = original[npts - 1];\n\n    \/\/util::Assert::equals(*(original[0]), *last);\n    assert(last);\n    assert(original[0]->equals2D(*last));\n\n    const Coordinate* prev = nullptr;\n    for(size_t i = 0; i < npts - 1; ++i) {\n        const Coordinate* curr = original[i];\n        const Coordinate* next = original[i + 1];\n\n        \/\/ skip consecutive equal coordinates\n        if(curr->equals2D(*next)) {\n            continue;\n        }\n\n        if(prev != nullptr &&  isBetween(*prev, *curr, *next)) {\n            continue;\n        }\n\n        cleaned.push_back(curr);\n        prev = curr;\n    }\n\n    cleaned.push_back(last);\n\n}\n\n\n} \/\/ namespace geos.algorithm\n} \/\/ namespace geos\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\n\/*\nCopyright (c) 2007-2009, Trustees of The Leland Stanford Junior University\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\nRedistributions of source code must retain the above copyright notice, this list\nof conditions and the following disclaimer.\nRedistributions 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.\nNeither the name of the Stanford University nor the names of its contributors \nmay be used to endorse or promote products derived from this software without \nspecific 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 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 ON \nANY 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\/\/\n\/\/  SeparableAllocator: Separable Allocator\n\/\/\n\/\/ ----------------------------------------------------------------------\n\n#include \"separable.hpp\"\n\n#include \"booksim.hpp\"\n#include \"roundrobin_arb.hpp\"\n#include \"matrix_arb.hpp\"\n\n#include <vector>\n#include <iostream>\n#include <string.h>\n#include <sstream>\n\nSeparableAllocator::SeparableAllocator( Module* parent, const string& name,\n\t\t\t\t\tint inputs, int outputs,\n\t\t\t\t\tconst string& arb_type )\n  : Allocator( parent, name, inputs, outputs )\n{\n  \n  _requests  = new list<sRequest> [inputs] ;\n  \n  _input_arb = new Arbiter*[inputs];\n  _output_arb = new Arbiter*[outputs];\n  \n  ostringstream arb_name;\n  \n  for (int i = 0; i < inputs; ++i) {\n    arb_name << \"arb_i\" << i;\n    _input_arb[i] = Arbiter::NewArbiter(this, arb_name.str(), arb_type, outputs);\n    arb_name.seekp( 0, ios::beg );\n  }\n  for (int i = 0; i < outputs; ++i) {\n    arb_name << \"arb_o\" << i;\n    _output_arb[i] = Arbiter::NewArbiter(this, arb_name.str( ), arb_type, inputs);\n    arb_name.seekp( 0, ios::beg );\n  }\n  \n  Clear() ;\n}\n\nSeparableAllocator::~SeparableAllocator() {\n\n  delete[] _requests ;\n\n  for (int i = 0; i < _inputs; ++i) {\n    delete _input_arb[i];\n  }\n  delete[] _input_arb ;\n\n  for (int i = 0; i < _outputs; ++i) {\n    delete _output_arb[i];\n  }\n  delete[] _output_arb ;\n}\n\nvoid SeparableAllocator::Clear() {\n\n  for ( int i = 0 ; i < _inputs ; i++ ) \n    _requests[i].clear() ;\n\n}\n\nint SeparableAllocator::ReadRequest( int in, int out ) const {\n  sRequest r ;\n  if ( !ReadRequest( r, in, out) ) {\n    return -1 ;\n  } \n  return r.label ;\n}\n\nbool SeparableAllocator::ReadRequest( sRequest &req, int in, int out ) const {\n\n  assert( ( in >= 0 ) && ( in < _inputs ) &&\n\t  ( out >= 0 ) && ( out < _outputs ) );\n\n  \/\/ Only those requests with non-negative priorities should be\n  \/\/ returned to supress failing speculative allocations. This is\n  \/\/ a bit of a hack, but is necessary because the router pipeline\n  \/\/ queuries the results of the allocation through the requests\n  int max_pri = -1 ;\n\n  list<sRequest>::const_iterator match = _requests[in].begin() ;\n\n  while ( match != _requests[in].end() ) {\n    if ( match->port == out && match->in_pri > max_pri ) {\n      req = *match ;\n      max_pri = req.in_pri ;\n    }\n    match++ ;\n  }\n\n  return ( max_pri > -1 ) ;\n\n}\n\nvoid SeparableAllocator::AddRequest( int in, int out, int label, int in_pri,\n\t\t\t\t     int out_pri ) {\n\n  assert( ( in >= 0 ) && ( in < _inputs ) &&\n\t  ( out >= 0 ) && ( out < _outputs ) );\n\n  sRequest req ;\n  req.port    = out ;\n  req.label   = label ;\n  req.in_pri  = in_pri ;\n  req.out_pri = out_pri ;\n  \n  _requests[in].push_front( req ) ;\n\n}\n\nvoid SeparableAllocator::RemoveRequest( int in, int out, int label ) {\n  \/\/ Method not implemented yet\n  assert( false ) ;\n\n}\n\nvoid SeparableAllocator::PrintRequests( ostream * os ) const {\n  \n  if(!os) os = &cout;\n  \n  *os << \"Requests = [ \";\n  \n  for ( int input = 0 ; input < _inputs ; input++ ) {\n    if ( _requests[input].empty() )\n      continue ;\n    \n    list<sRequest>::const_iterator it  = _requests[input].begin() ;\n    list<sRequest>::const_iterator end = _requests[input].end() ;\n\n    *os << input << \" -> [ \";\n    while ( it != end ) {\n      const sRequest& req = *it ;\n      *os << \"(lbl:\" << req.label\n\t   << \",out:\" << req.port\n\t   << \",ipr:\" << req.in_pri\n\t   << \",opr:\" << req.out_pri\n\t   << \") \";\n      it++ ;\n    }\n    *os << \"] \";\n  }\n  *os << \"].\" << endl;\n}\n<commit_msg>Ticket #92: Fix handling of negative priorities in separable allocators.<commit_after>\/\/ $Id$\n\n\/*\nCopyright (c) 2007-2009, Trustees of The Leland Stanford Junior University\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\nRedistributions of source code must retain the above copyright notice, this list\nof conditions and the following disclaimer.\nRedistributions 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.\nNeither the name of the Stanford University nor the names of its contributors \nmay be used to endorse or promote products derived from this software without \nspecific 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 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 ON \nANY 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\/\/\n\/\/  SeparableAllocator: Separable Allocator\n\/\/\n\/\/ ----------------------------------------------------------------------\n\n#include \"separable.hpp\"\n\n#include \"booksim.hpp\"\n#include \"roundrobin_arb.hpp\"\n#include \"matrix_arb.hpp\"\n\n#include <vector>\n#include <iostream>\n#include <string.h>\n#include <sstream>\n\nSeparableAllocator::SeparableAllocator( Module* parent, const string& name,\n\t\t\t\t\tint inputs, int outputs,\n\t\t\t\t\tconst string& arb_type )\n  : Allocator( parent, name, inputs, outputs )\n{\n  \n  _requests  = new list<sRequest> [inputs] ;\n  \n  _input_arb = new Arbiter*[inputs];\n  _output_arb = new Arbiter*[outputs];\n  \n  ostringstream arb_name;\n  \n  for (int i = 0; i < inputs; ++i) {\n    arb_name << \"arb_i\" << i;\n    _input_arb[i] = Arbiter::NewArbiter(this, arb_name.str(), arb_type, outputs);\n    arb_name.seekp( 0, ios::beg );\n  }\n  for (int i = 0; i < outputs; ++i) {\n    arb_name << \"arb_o\" << i;\n    _output_arb[i] = Arbiter::NewArbiter(this, arb_name.str( ), arb_type, inputs);\n    arb_name.seekp( 0, ios::beg );\n  }\n  \n  Clear() ;\n}\n\nSeparableAllocator::~SeparableAllocator() {\n\n  delete[] _requests ;\n\n  for (int i = 0; i < _inputs; ++i) {\n    delete _input_arb[i];\n  }\n  delete[] _input_arb ;\n\n  for (int i = 0; i < _outputs; ++i) {\n    delete _output_arb[i];\n  }\n  delete[] _output_arb ;\n}\n\nvoid SeparableAllocator::Clear() {\n\n  for ( int i = 0 ; i < _inputs ; i++ ) \n    _requests[i].clear() ;\n\n}\n\nint SeparableAllocator::ReadRequest( int in, int out ) const {\n  sRequest r ;\n  if ( !ReadRequest( r, in, out) ) {\n    return -1 ;\n  } \n  return r.label ;\n}\n\nbool SeparableAllocator::ReadRequest( sRequest &req, int in, int out ) const {\n\n  assert( ( in >= 0 ) && ( in < _inputs ) &&\n\t  ( out >= 0 ) && ( out < _outputs ) );\n\n  const sRequest * sreq = NULL;\n\n  list<sRequest>::const_iterator match = _requests[in].begin() ;\n  while ( match != _requests[in].end() ) {\n    if ( ( match->port == out ) && ( !sreq || ( match->in_pri > sreq->in_pri ) ) ) {\n      sreq = &(*match) ;\n    }\n    match++ ;\n  }\n\n  if(sreq) {\n    req = *sreq;\n    return true;\n  }\n  return false ;\n\n}\n\nvoid SeparableAllocator::AddRequest( int in, int out, int label, int in_pri,\n\t\t\t\t     int out_pri ) {\n\n  assert( ( in >= 0 ) && ( in < _inputs ) &&\n\t  ( out >= 0 ) && ( out < _outputs ) );\n\n  sRequest req ;\n  req.port    = out ;\n  req.label   = label ;\n  req.in_pri  = in_pri ;\n  req.out_pri = out_pri ;\n  \n  _requests[in].push_front( req ) ;\n\n}\n\nvoid SeparableAllocator::RemoveRequest( int in, int out, int label ) {\n  \/\/ Method not implemented yet\n  assert( false ) ;\n\n}\n\nvoid SeparableAllocator::PrintRequests( ostream * os ) const {\n  \n  if(!os) os = &cout;\n  \n  *os << \"Requests = [ \";\n  \n  for ( int input = 0 ; input < _inputs ; input++ ) {\n    if ( _requests[input].empty() )\n      continue ;\n    \n    list<sRequest>::const_iterator it  = _requests[input].begin() ;\n    list<sRequest>::const_iterator end = _requests[input].end() ;\n\n    *os << input << \" -> [ \";\n    while ( it != end ) {\n      const sRequest& req = *it ;\n      *os << \"(lbl:\" << req.label\n\t   << \",out:\" << req.port\n\t   << \",ipr:\" << req.in_pri\n\t   << \",opr:\" << req.out_pri\n\t   << \") \";\n      it++ ;\n    }\n    *os << \"] \";\n  }\n  *os << \"].\" << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements.  See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF 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#include \"SessionPool.h\"\n#include \"ResourceLifecycleManager.h\"\n\nusing namespace activemq::cmsutil;\nusing namespace std;\n\ncms::Connection* connection;\n\nResourceLifecycleManager* resourceLifecycleManager;\n\ndecaf::util::concurrent::Mutex mutex;\n\nstd::list<PooledSession*> available;\n\nstd::list<PooledSession*> sessions;\n\ncms::Session::AcknowledgeMode acknowledgeMode;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSessionPool::SessionPool( cms::Connection* connection,\n                          cms::Session::AcknowledgeMode ackMode,\n                          ResourceLifecycleManager* resourceLifecycleManager)\n    : connection( connection ),\n      resourceLifecycleManager( resourceLifecycleManager ),\n      mutex(),\n      available(),\n      sessions(),\n      acknowledgeMode( ackMode ) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSessionPool::~SessionPool() {\n\n    \/\/ Destroy all of the pooled session objects.\n    list<PooledSession*>::iterator iter = sessions.begin();\n    for( ; iter != sessions.end(); ++iter ) {\n        delete *iter;\n    }\n    sessions.clear();\n    available.clear();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPooledSession* SessionPool::takeSession() {\n\n    synchronized(&mutex) {\n\n        PooledSession* pooledSession = NULL;\n\n        \/\/ If there are no sessions available, create a new one and return it.\n        if( available.size() == 0 ) {\n\n            \/\/ No sessions were available - create a new one.\n            cms::Session* session = connection->createSession( acknowledgeMode );\n\n            \/\/ Give this resource to the life-cycle manager to manage. The pool\n            \/\/ will not be in charge of destroying this resource.\n            resourceLifecycleManager->addSession( session );\n\n            \/\/ Now wrap the session with a pooled session.\n            pooledSession = new PooledSession( this, session );\n\n            \/\/ Add to the sessions list.\n            sessions.push_back( pooledSession );\n\n        } else {\n\n            \/\/ There are sessions available - use the one at the head of the\n            \/\/ list, and remove it from the available list.\n            pooledSession = available.front();\n            available.pop_front();\n        }\n\n        \/\/ Return the session.\n        return pooledSession;\n    }\n\n    \/\/ Fixes compiler warnings.\n    return NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SessionPool::returnSession( PooledSession* session ) {\n\n    synchronized( &mutex ) {\n\n        \/\/ Add to the available list.\n        available.push_back( session );\n    }\n}\n<commit_msg>cleanup<commit_after>\/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements.  See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF 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#include \"SessionPool.h\"\n#include \"ResourceLifecycleManager.h\"\n\nusing namespace activemq::cmsutil;\nusing namespace std;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSessionPool::SessionPool( cms::Connection* connection,\n                          cms::Session::AcknowledgeMode ackMode,\n                          ResourceLifecycleManager* resourceLifecycleManager)\n    : connection( connection ),\n      resourceLifecycleManager( resourceLifecycleManager ),\n      mutex(),\n      available(),\n      sessions(),\n      acknowledgeMode( ackMode ) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSessionPool::~SessionPool() {\n\n    \/\/ Destroy all of the pooled session objects.\n    list<PooledSession*>::iterator iter = sessions.begin();\n    for( ; iter != sessions.end(); ++iter ) {\n        delete *iter;\n    }\n    sessions.clear();\n    available.clear();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPooledSession* SessionPool::takeSession() {\n\n    synchronized(&mutex) {\n\n        PooledSession* pooledSession = NULL;\n\n        \/\/ If there are no sessions available, create a new one and return it.\n        if( available.size() == 0 ) {\n\n            \/\/ No sessions were available - create a new one.\n            cms::Session* session = connection->createSession( acknowledgeMode );\n\n            \/\/ Give this resource to the life-cycle manager to manage. The pool\n            \/\/ will not be in charge of destroying this resource.\n            resourceLifecycleManager->addSession( session );\n\n            \/\/ Now wrap the session with a pooled session.\n            pooledSession = new PooledSession( this, session );\n\n            \/\/ Add to the sessions list.\n            sessions.push_back( pooledSession );\n\n        } else {\n\n            \/\/ There are sessions available - use the one at the head of the\n            \/\/ list, and remove it from the available list.\n            pooledSession = available.front();\n            available.pop_front();\n        }\n\n        \/\/ Return the session.\n        return pooledSession;\n    }\n\n    \/\/ Fixes compiler warnings.\n    return NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SessionPool::returnSession( PooledSession* session ) {\n\n    synchronized( &mutex ) {\n\n        \/\/ Add to the available list.\n        available.push_back( session );\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements.  See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF 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#include \"ActiveMQCPP.h\"\n\n#include <decaf\/lang\/Runtime.h>\n#include <activemq\/wireformat\/WireFormatRegistry.h>\n#include <activemq\/transport\/TransportRegistry.h>\n\n#include <activemq\/util\/IdGenerator.h>\n\n#include <activemq\/wireformat\/stomp\/StompWireFormatFactory.h>\n#include <activemq\/wireformat\/openwire\/OpenWireFormatFactory.h>\n\n#include <activemq\/transport\/mock\/MockTransportFactory.h>\n#include <activemq\/transport\/tcp\/TcpTransportFactory.h>\n#include <activemq\/transport\/tcp\/SslTransportFactory.h>\n#include <activemq\/transport\/failover\/FailoverTransportFactory.h>\n\nusing namespace activemq;\nusing namespace activemq::library;\nusing namespace activemq::util;\nusing namespace activemq::transport;\nusing namespace activemq::transport::tcp;\nusing namespace activemq::transport::mock;\nusing namespace activemq::transport::failover;\nusing namespace activemq::wireformat;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::initializeLibrary( int argc, char** argv ) {\n\n    \/\/ Initialize the Decaf Library by requesting its runtime.\n    decaf::lang::Runtime::initializeRuntime( argc, argv );\n\n    \/\/ Register all WireFormats\n    ActiveMQCPP::registerWireFormats();\n\n    \/\/ Register all Transports\n    ActiveMQCPP::registerTransports();\n\n    \/\/ Start the IdGenerator Kernel\n    IdGenerator::initialize();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::initializeLibrary() {\n    ActiveMQCPP::initializeLibrary( 0, NULL );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::shutdownLibrary() {\n\n    \/\/ Shutdown the IdGenerator Kernel\n    IdGenerator::shutdown();\n\n    \/\/ Now it should be safe to shutdown Decaf.\n    decaf::lang::Runtime::shutdownRuntime();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::registerWireFormats() {\n\n    \/\/ Each of the internally implemented WireFormat's is registered here\n    \/\/ with the WireFormat Registry\n\n    WireFormatRegistry::getInstance().registerFactory(\n        \"openwire\", new wireformat::openwire::OpenWireFormatFactory() );\n    WireFormatRegistry::getInstance().registerFactory(\n        \"stomp\", new wireformat::stomp::StompWireFormatFactory() );\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::registerTransports() {\n\n    \/\/ Each of the internally implemented WireFormat's is registered here\n    \/\/ with the WireFormat Registry\n\n    TransportRegistry::getInstance().registerFactory(\n        \"tcp\", new TcpTransportFactory() );\n    TransportRegistry::getInstance().registerFactory(\n        \"ssl\", new SslTransportFactory() );\n    TransportRegistry::getInstance().registerFactory(\n        \"mock\", new MockTransportFactory() );\n    TransportRegistry::getInstance().registerFactory(\n        \"failover\", new FailoverTransportFactory() );\n\n}\n<commit_msg>Do a manual unregister of WireFormat and Transport factories on library shutdown instead of letting the registery destructor handle it, this prevents leak checkers like valgrind from mistakenly reporting memory leaks.<commit_after>\/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements.  See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF 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#include \"ActiveMQCPP.h\"\n\n#include <decaf\/lang\/Runtime.h>\n#include <activemq\/wireformat\/WireFormatRegistry.h>\n#include <activemq\/transport\/TransportRegistry.h>\n\n#include <activemq\/util\/IdGenerator.h>\n\n#include <activemq\/wireformat\/stomp\/StompWireFormatFactory.h>\n#include <activemq\/wireformat\/openwire\/OpenWireFormatFactory.h>\n\n#include <activemq\/transport\/mock\/MockTransportFactory.h>\n#include <activemq\/transport\/tcp\/TcpTransportFactory.h>\n#include <activemq\/transport\/tcp\/SslTransportFactory.h>\n#include <activemq\/transport\/failover\/FailoverTransportFactory.h>\n\nusing namespace activemq;\nusing namespace activemq::library;\nusing namespace activemq::util;\nusing namespace activemq::transport;\nusing namespace activemq::transport::tcp;\nusing namespace activemq::transport::mock;\nusing namespace activemq::transport::failover;\nusing namespace activemq::wireformat;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::initializeLibrary( int argc, char** argv ) {\n\n    \/\/ Initialize the Decaf Library by requesting its runtime.\n    decaf::lang::Runtime::initializeRuntime( argc, argv );\n\n    \/\/ Register all WireFormats\n    ActiveMQCPP::registerWireFormats();\n\n    \/\/ Register all Transports\n    ActiveMQCPP::registerTransports();\n\n    \/\/ Start the IdGenerator Kernel\n    IdGenerator::initialize();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::initializeLibrary() {\n    ActiveMQCPP::initializeLibrary( 0, NULL );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::shutdownLibrary() {\n\n    \/\/ Shutdown the IdGenerator Kernel\n    IdGenerator::shutdown();\n\n    \/\/ Clear out all registered WireFormat Factories.\n    WireFormatRegistry::getInstance().unregisterFactory(\"openwire\");\n    WireFormatRegistry::getInstance().unregisterFactory(\"stomp\");\n\n    \/\/ Clear out all regsitered Transport factories\n    TransportRegistry::getInstance().unregisterFactory(\"tcp\");\n    TransportRegistry::getInstance().unregisterFactory(\"ssl\");\n    TransportRegistry::getInstance().unregisterFactory(\"mock\");\n    TransportRegistry::getInstance().unregisterFactory(\"failover\");\n\n    \/\/ Now it should be safe to shutdown Decaf.\n    decaf::lang::Runtime::shutdownRuntime();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::registerWireFormats() {\n\n    \/\/ Each of the internally implemented WireFormat's is registered here\n    \/\/ with the WireFormat Registry\n\n    WireFormatRegistry::getInstance().registerFactory(\n        \"openwire\", new wireformat::openwire::OpenWireFormatFactory() );\n    WireFormatRegistry::getInstance().registerFactory(\n        \"stomp\", new wireformat::stomp::StompWireFormatFactory() );\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ActiveMQCPP::registerTransports() {\n\n    \/\/ Each of the internally implemented WireFormat's is registered here\n    \/\/ with the WireFormat Registry\n\n    TransportRegistry::getInstance().registerFactory(\n        \"tcp\", new TcpTransportFactory() );\n    TransportRegistry::getInstance().registerFactory(\n        \"ssl\", new SslTransportFactory() );\n    TransportRegistry::getInstance().registerFactory(\n        \"mock\", new MockTransportFactory() );\n    TransportRegistry::getInstance().registerFactory(\n        \"failover\", new FailoverTransportFactory() );\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: dxfblkrd.hxx,v $\n *\n *  $Revision: 1.1.1.1 $\n *\n *  last change: $Author: hr $ $Date: 2000-09-18 16:30: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\n#ifndef _DXFBLKRD_HXX\n#define _DXFBLKRD_HXX\n\n#ifndef _DXFENTRD_HXX\n#include <dxfentrd.hxx>\n#endif\n\n\/\/----------------------------------------------------------------------------\n\/\/---------------- Ein Block (= Menge von Entities) --------------------------\n\/\/----------------------------------------------------------------------------\n\nclass DXFBlock : public DXFEntities {\n\npublic:\n\n    DXFBlock * pSucc;\n        \/\/ Zeiger auf naechsten Block in der Liste DXFBlocks::pFirst\n\n    \/\/ Eigenschaften des Blocks, durch Gruppencodes kommentiert:\n    char sName[DXF_MAX_STRING_LEN+1];     \/\/  2\n    char sAlsoName[DXF_MAX_STRING_LEN+1]; \/\/  3\n    long nFlags;                          \/\/ 70\n    DXFVector aBasePoint;                 \/\/ 10,20,30\n    char sXRef[DXF_MAX_STRING_LEN+1];     \/\/  1\n\n    DXFBlock();\n    ~DXFBlock();\n\n    void Read(DXFGroupReader & rDGR);\n        \/\/ Liest den Block (einschliesslich der Entities) per rGDR\n        \/\/ aus einer DXF-Datei bis zu einem ENDBLK, ENDSEC oder EOF.\n};\n\n\n\/\/----------------------------------------------------------------------------\n\/\/---------------- Eine Menge von Bloecken -----------------------------------\n\/\/----------------------------------------------------------------------------\n\nclass DXFBlocks {\n\npublic:\n\n    DXFBlock * pFirst;\n        \/\/ Liste der Bloecke, READ ONLY!\n\n    DXFBlocks();\n    ~DXFBlocks();\n\n    void Read(DXFGroupReader & rDGR);\n        \/\/ Liesst alle Bloecke per rDGR bis zu einem ENDSEC oder EOF.\n\n    DXFBlock * Search(const char * sName) const;\n        \/\/ Sucht einen Block mit dem Namen, liefert NULL bei Misserfolg.\n\n    void Clear();\n        \/\/ Loescht alle Bloecke;\n\n};\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.326); FILE MERGED 2005\/09\/05 15:13:04 rt 1.1.1.1.326.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: dxfblkrd.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 02:54:34 $\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 _DXFBLKRD_HXX\n#define _DXFBLKRD_HXX\n\n#ifndef _DXFENTRD_HXX\n#include <dxfentrd.hxx>\n#endif\n\n\/\/----------------------------------------------------------------------------\n\/\/---------------- Ein Block (= Menge von Entities) --------------------------\n\/\/----------------------------------------------------------------------------\n\nclass DXFBlock : public DXFEntities {\n\npublic:\n\n    DXFBlock * pSucc;\n        \/\/ Zeiger auf naechsten Block in der Liste DXFBlocks::pFirst\n\n    \/\/ Eigenschaften des Blocks, durch Gruppencodes kommentiert:\n    char sName[DXF_MAX_STRING_LEN+1];     \/\/  2\n    char sAlsoName[DXF_MAX_STRING_LEN+1]; \/\/  3\n    long nFlags;                          \/\/ 70\n    DXFVector aBasePoint;                 \/\/ 10,20,30\n    char sXRef[DXF_MAX_STRING_LEN+1];     \/\/  1\n\n    DXFBlock();\n    ~DXFBlock();\n\n    void Read(DXFGroupReader & rDGR);\n        \/\/ Liest den Block (einschliesslich der Entities) per rGDR\n        \/\/ aus einer DXF-Datei bis zu einem ENDBLK, ENDSEC oder EOF.\n};\n\n\n\/\/----------------------------------------------------------------------------\n\/\/---------------- Eine Menge von Bloecken -----------------------------------\n\/\/----------------------------------------------------------------------------\n\nclass DXFBlocks {\n\npublic:\n\n    DXFBlock * pFirst;\n        \/\/ Liste der Bloecke, READ ONLY!\n\n    DXFBlocks();\n    ~DXFBlocks();\n\n    void Read(DXFGroupReader & rDGR);\n        \/\/ Liesst alle Bloecke per rDGR bis zu einem ENDSEC oder EOF.\n\n    DXFBlock * Search(const char * sName) const;\n        \/\/ Sucht einen Block mit dem Namen, liefert NULL bei Misserfolg.\n\n    void Clear();\n        \/\/ Loescht alle Bloecke;\n\n};\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- LinkerScript.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\/\/ This file contains the parser\/evaluator of the linker script.\n\/\/ It does not construct an AST but consume linker script directives directly.\n\/\/ Results are written to Driver or Config object.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"LinkerScript.h\"\n#include \"Config.h\"\n#include \"Driver.h\"\n#include \"InputSection.h\"\n#include \"SymbolTable.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/StringSaver.h\"\n\nusing namespace llvm;\nusing namespace llvm::object;\nusing namespace lld;\nusing namespace lld::elf2;\n\nLinkerScript *elf2::Script;\n\ntemplate <class ELFT>\nSectionRule *LinkerScript::find(InputSectionBase<ELFT> *S) {\n  for (SectionRule &R : Sections)\n    if (R.match(S))\n      return &R;\n  return nullptr;\n}\n\ntemplate <class ELFT>\nStringRef LinkerScript::getOutputSection(InputSectionBase<ELFT> *S) {\n  SectionRule *R = find(S);\n  return R ? R->Dest : \"\";\n}\n\ntemplate <class ELFT>\nbool LinkerScript::isDiscarded(InputSectionBase<ELFT> *S) {\n  return getOutputSection(S) == \"\/DISCARD\/\";\n}\n\ntemplate <class ELFT> bool LinkerScript::shouldKeep(InputSectionBase<ELFT> *S) {\n  SectionRule *R = find(S);\n  return R && R->Keep;\n}\n\n\/\/ A compartor to sort output sections. Returns -1 or 1 if both\n\/\/ A and B are mentioned in linker scripts. Otherwise, returns 0\n\/\/ to use the default rule which is implemented in Writer.cpp.\nint LinkerScript::compareSections(StringRef A, StringRef B) {\n  auto E = SectionOrder.end();\n  auto I = std::find(SectionOrder.begin(), E, A);\n  auto J = std::find(SectionOrder.begin(), E, B);\n  if (I == E || J == E)\n    return 0;\n  return I < J ? -1 : 1;\n}\n\n\/\/ Returns true if S matches T. S can contain glob meta-characters.\n\/\/ The asterisk ('*') matches zero or more characacters, and the question\n\/\/ mark ('?') matches one character.\nstatic bool matchStr(StringRef S, StringRef T) {\n  for (;;) {\n    if (S.empty())\n      return T.empty();\n    if (S[0] == '*') {\n      S = S.substr(1);\n      if (S.empty())\n        \/\/ Fast path. If a pattern is '*', it matches anything.\n        return true;\n      for (size_t I = 0, E = T.size(); I < E; ++I)\n        if (matchStr(S, T.substr(I)))\n          return true;\n      return false;\n    }\n    if (T.empty() || (S[0] != T[0] && S[0] != '?'))\n      return false;\n    S = S.substr(1);\n    T = T.substr(1);\n  }\n}\n\ntemplate <class ELFT> bool SectionRule::match(InputSectionBase<ELFT> *S) {\n  return matchStr(SectionPattern, S->getSectionName());\n}\n\nclass elf2::ScriptParser {\npublic:\n  ScriptParser(BumpPtrAllocator *A, StringRef S, bool B)\n      : Saver(*A), Tokens(tokenize(S)), IsUnderSysroot(B) {\n    Cmd[\"ENTRY\"] = std::mem_fn(&ScriptParser::readEntry);\n    Cmd[\"EXTERN\"] = std::mem_fn(&ScriptParser::readExtern);\n    Cmd[\"GROUP\"] = std::mem_fn(&ScriptParser::readGroup);\n    Cmd[\"INCLUDE\"] = std::mem_fn(&ScriptParser::readInclude);\n    Cmd[\"INPUT\"] = std::mem_fn(&ScriptParser::readGroup);\n    Cmd[\"OUTPUT\"] = std::mem_fn(&ScriptParser::readOutput);\n    Cmd[\"OUTPUT_ARCH\"] = std::mem_fn(&ScriptParser::readOutputArch);\n    Cmd[\"OUTPUT_FORMAT\"] = std::mem_fn(&ScriptParser::readOutputFormat);\n    Cmd[\"SEARCH_DIR\"] = std::mem_fn(&ScriptParser::readSearchDir);\n    Cmd[\"SECTIONS\"] = std::mem_fn(&ScriptParser::readSections);\n    Cmd[\";\"] = [](ScriptParser &) {};\n  }\n\n  void run();\n\nprivate:\n  void setError(const Twine &Msg);\n  static std::vector<StringRef> tokenize(StringRef S);\n  static StringRef skipSpace(StringRef S);\n  bool atEOF();\n  StringRef next();\n  bool skip(StringRef Tok);\n  void expect(StringRef Expect);\n\n  void addFile(StringRef Path);\n\n  void readAsNeeded();\n  void readEntry();\n  void readExtern();\n  void readGroup();\n  void readInclude();\n  void readOutput();\n  void readOutputArch();\n  void readOutputFormat();\n  void readSearchDir();\n  void readSections();\n\n  void readOutputSectionDescription();\n  void readSectionPatterns(StringRef OutSec, bool Keep);\n\n  StringSaver Saver;\n  std::vector<StringRef> Tokens;\n  llvm::StringMap<std::function<void(ScriptParser &)>> Cmd;\n  size_t Pos = 0;\n  bool IsUnderSysroot;\n  bool Error = false;\n};\n\nvoid ScriptParser::run() {\n  while (!atEOF()) {\n    StringRef Tok = next();\n    auto It = Cmd.find(Tok);\n    if (It != Cmd.end()) {\n      std::function<void(ScriptParser &)> &Handler = It->second;\n      Handler(*this);\n    } else {\n      setError(\"unknown directive: \" + Tok);\n    }\n  }\n}\n\n\/\/ We don't want to record cascading errors. Keep only the first one.\nvoid ScriptParser::setError(const Twine &Msg) {\n  if (Error)\n    return;\n  error(Msg);\n  Error = true;\n}\n\n\/\/ Split S into linker script tokens.\nstd::vector<StringRef> ScriptParser::tokenize(StringRef S) {\n  std::vector<StringRef> Ret;\n  for (;;) {\n    S = skipSpace(S);\n    if (S.empty())\n      return Ret;\n\n    \/\/ Quoted token\n    if (S.startswith(\"\\\"\")) {\n      size_t E = S.find(\"\\\"\", 1);\n      if (E == StringRef::npos) {\n        error(\"unclosed quote\");\n        return {};\n      }\n      Ret.push_back(S.substr(1, E - 1));\n      S = S.substr(E + 1);\n      continue;\n    }\n\n    \/\/ Unquoted token\n    size_t Pos = S.find_first_not_of(\n        \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n        \"0123456789_.$\/\\\\~=+[]*?-:\");\n    \/\/ A character that cannot start a word (which is usually a\n    \/\/ punctuation) forms a single character token.\n    if (Pos == 0)\n      Pos = 1;\n    Ret.push_back(S.substr(0, Pos));\n    S = S.substr(Pos);\n  }\n}\n\n\/\/ Skip leading whitespace characters or \/**\/-style comments.\nStringRef ScriptParser::skipSpace(StringRef S) {\n  for (;;) {\n    if (S.startswith(\"\/*\")) {\n      size_t E = S.find(\"*\/\", 2);\n      if (E == StringRef::npos) {\n        error(\"unclosed comment in a linker script\");\n        return \"\";\n      }\n      S = S.substr(E + 2);\n      continue;\n    }\n    size_t Size = S.size();\n    S = S.ltrim();\n    if (S.size() == Size)\n      return S;\n  }\n}\n\n\/\/ An errneous token is handled as if it were the last token before EOF.\nbool ScriptParser::atEOF() { return Error || Tokens.size() == Pos; }\n\nStringRef ScriptParser::next() {\n  if (Error)\n    return \"\";\n  if (atEOF()) {\n    setError(\"unexpected EOF\");\n    return \"\";\n  }\n  return Tokens[Pos++];\n}\n\nbool ScriptParser::skip(StringRef Tok) {\n  if (Error)\n    return false;\n  if (atEOF()) {\n    setError(\"unexpected EOF\");\n    return false;\n  }\n  if (Tok != Tokens[Pos])\n    return false;\n  ++Pos;\n  return true;\n}\n\nvoid ScriptParser::expect(StringRef Expect) {\n  if (Error)\n    return;\n  StringRef Tok = next();\n  if (Tok != Expect)\n    setError(Expect + \" expected, but got \" + Tok);\n}\n\nvoid ScriptParser::addFile(StringRef S) {\n  if (IsUnderSysroot && S.startswith(\"\/\")) {\n    SmallString<128> Path;\n    (Config->Sysroot + S).toStringRef(Path);\n    if (sys::fs::exists(Path)) {\n      Driver->addFile(Saver.save(Path.str()));\n      return;\n    }\n  }\n\n  if (sys::path::is_absolute(S)) {\n    Driver->addFile(S);\n  } else if (S.startswith(\"=\")) {\n    if (Config->Sysroot.empty())\n      Driver->addFile(S.substr(1));\n    else\n      Driver->addFile(Saver.save(Config->Sysroot + \"\/\" + S.substr(1)));\n  } else if (S.startswith(\"-l\")) {\n    Driver->addLibrary(S.substr(2));\n  } else if (sys::fs::exists(S)) {\n    Driver->addFile(S);\n  } else {\n    std::string Path = findFromSearchPaths(S);\n    if (Path.empty())\n      setError(\"Unable to find \" + S);\n    else\n      Driver->addFile(Saver.save(Path));\n  }\n}\n\nvoid ScriptParser::readAsNeeded() {\n  expect(\"(\");\n  bool Orig = Config->AsNeeded;\n  Config->AsNeeded = true;\n  while (!Error) {\n    StringRef Tok = next();\n    if (Tok == \")\")\n      break;\n    addFile(Tok);\n  }\n  Config->AsNeeded = Orig;\n}\n\nvoid ScriptParser::readEntry() {\n  \/\/ -e <symbol> takes predecence over ENTRY(<symbol>).\n  expect(\"(\");\n  StringRef Tok = next();\n  if (Config->Entry.empty())\n    Config->Entry = Tok;\n  expect(\")\");\n}\n\nvoid ScriptParser::readExtern() {\n  expect(\"(\");\n  while (!Error) {\n    StringRef Tok = next();\n    if (Tok == \")\")\n      return;\n    Config->Undefined.push_back(Tok);\n  }\n}\n\nvoid ScriptParser::readGroup() {\n  expect(\"(\");\n  while (!Error) {\n    StringRef Tok = next();\n    if (Tok == \")\")\n      return;\n    if (Tok == \"AS_NEEDED\") {\n      readAsNeeded();\n      continue;\n    }\n    addFile(Tok);\n  }\n}\n\nvoid ScriptParser::readInclude() {\n  StringRef Tok = next();\n  auto MBOrErr = MemoryBuffer::getFile(Tok);\n  if (!MBOrErr) {\n    setError(\"cannot open \" + Tok);\n    return;\n  }\n  std::unique_ptr<MemoryBuffer> &MB = *MBOrErr;\n  StringRef S = Saver.save(MB->getMemBufferRef().getBuffer());\n  std::vector<StringRef> V = tokenize(S);\n  Tokens.insert(Tokens.begin() + Pos, V.begin(), V.end());\n}\n\nvoid ScriptParser::readOutput() {\n  \/\/ -o <file> takes predecence over OUTPUT(<file>).\n  expect(\"(\");\n  StringRef Tok = next();\n  if (Config->OutputFile.empty())\n    Config->OutputFile = Tok;\n  expect(\")\");\n}\n\nvoid ScriptParser::readOutputArch() {\n  \/\/ Error checking only for now.\n  expect(\"(\");\n  next();\n  expect(\")\");\n}\n\nvoid ScriptParser::readOutputFormat() {\n  \/\/ Error checking only for now.\n  expect(\"(\");\n  next();\n  StringRef Tok = next();\n  if (Tok == \")\")\n   return;\n  if (Tok != \",\") {\n    setError(\"unexpected token: \" + Tok);\n    return;\n  }\n  next();\n  expect(\",\");\n  next();\n  expect(\")\");\n}\n\nvoid ScriptParser::readSearchDir() {\n  expect(\"(\");\n  Config->SearchPaths.push_back(next());\n  expect(\")\");\n}\n\nvoid ScriptParser::readSections() {\n  expect(\"{\");\n  while (!Error && !skip(\"}\"))\n    readOutputSectionDescription();\n}\n\nvoid ScriptParser::readSectionPatterns(StringRef OutSec, bool Keep) {\n  expect(\"(\");\n  while (!Error && !skip(\")\"))\n    Script->Sections.emplace_back(OutSec, next(), Keep);\n}\n\nvoid ScriptParser::readOutputSectionDescription() {\n  StringRef OutSec = next();\n  Script->SectionOrder.push_back(OutSec);\n  expect(\":\");\n  expect(\"{\");\n  while (!Error && !skip(\"}\")) {\n    StringRef Tok = next();\n    if (Tok == \"*\") {\n      readSectionPatterns(OutSec, false);\n    } else if (Tok == \"KEEP\") {\n      expect(\"(\");\n      next(); \/\/ Skip *\n      readSectionPatterns(OutSec, true);\n      expect(\")\");\n    } else {\n      setError(\"Unknown command \" + Tok);\n    }\n  }\n}\n\nstatic bool isUnderSysroot(StringRef Path) {\n  if (Config->Sysroot == \"\")\n    return false;\n  for (; !Path.empty(); Path = sys::path::parent_path(Path))\n    if (sys::fs::equivalent(Config->Sysroot, Path))\n      return true;\n  return false;\n}\n\n\/\/ Entry point. The other functions or classes are private to this file.\nvoid LinkerScript::read(MemoryBufferRef MB) {\n  StringRef Path = MB.getBufferIdentifier();\n  ScriptParser(&Alloc, MB.getBuffer(), isUnderSysroot(Path)).run();\n}\n\ntemplate StringRef LinkerScript::getOutputSection(InputSectionBase<ELF32LE> *);\ntemplate StringRef LinkerScript::getOutputSection(InputSectionBase<ELF32BE> *);\ntemplate StringRef LinkerScript::getOutputSection(InputSectionBase<ELF64LE> *);\ntemplate StringRef LinkerScript::getOutputSection(InputSectionBase<ELF64BE> *);\n\ntemplate bool LinkerScript::isDiscarded(InputSectionBase<ELF32LE> *);\ntemplate bool LinkerScript::isDiscarded(InputSectionBase<ELF32BE> *);\ntemplate bool LinkerScript::isDiscarded(InputSectionBase<ELF64LE> *);\ntemplate bool LinkerScript::isDiscarded(InputSectionBase<ELF64BE> *);\n\ntemplate bool LinkerScript::shouldKeep(InputSectionBase<ELF32LE> *);\ntemplate bool LinkerScript::shouldKeep(InputSectionBase<ELF32BE> *);\ntemplate bool LinkerScript::shouldKeep(InputSectionBase<ELF64LE> *);\ntemplate bool LinkerScript::shouldKeep(InputSectionBase<ELF64BE> *);\n\ntemplate bool SectionRule::match(InputSectionBase<ELF32LE> *);\ntemplate bool SectionRule::match(InputSectionBase<ELF32BE> *);\ntemplate bool SectionRule::match(InputSectionBase<ELF64LE> *);\ntemplate bool SectionRule::match(InputSectionBase<ELF64BE> *);\n<commit_msg>[ELF] - replaced std::function with raw pointers in LinkerScript.cpp<commit_after>\/\/===- LinkerScript.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\/\/ This file contains the parser\/evaluator of the linker script.\n\/\/ It does not construct an AST but consume linker script directives directly.\n\/\/ Results are written to Driver or Config object.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"LinkerScript.h\"\n#include \"Config.h\"\n#include \"Driver.h\"\n#include \"InputSection.h\"\n#include \"SymbolTable.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/StringSaver.h\"\n\nusing namespace llvm;\nusing namespace llvm::object;\nusing namespace lld;\nusing namespace lld::elf2;\n\nLinkerScript *elf2::Script;\n\ntemplate <class ELFT>\nSectionRule *LinkerScript::find(InputSectionBase<ELFT> *S) {\n  for (SectionRule &R : Sections)\n    if (R.match(S))\n      return &R;\n  return nullptr;\n}\n\ntemplate <class ELFT>\nStringRef LinkerScript::getOutputSection(InputSectionBase<ELFT> *S) {\n  SectionRule *R = find(S);\n  return R ? R->Dest : \"\";\n}\n\ntemplate <class ELFT>\nbool LinkerScript::isDiscarded(InputSectionBase<ELFT> *S) {\n  return getOutputSection(S) == \"\/DISCARD\/\";\n}\n\ntemplate <class ELFT> bool LinkerScript::shouldKeep(InputSectionBase<ELFT> *S) {\n  SectionRule *R = find(S);\n  return R && R->Keep;\n}\n\n\/\/ A compartor to sort output sections. Returns -1 or 1 if both\n\/\/ A and B are mentioned in linker scripts. Otherwise, returns 0\n\/\/ to use the default rule which is implemented in Writer.cpp.\nint LinkerScript::compareSections(StringRef A, StringRef B) {\n  auto E = SectionOrder.end();\n  auto I = std::find(SectionOrder.begin(), E, A);\n  auto J = std::find(SectionOrder.begin(), E, B);\n  if (I == E || J == E)\n    return 0;\n  return I < J ? -1 : 1;\n}\n\n\/\/ Returns true if S matches T. S can contain glob meta-characters.\n\/\/ The asterisk ('*') matches zero or more characacters, and the question\n\/\/ mark ('?') matches one character.\nstatic bool matchStr(StringRef S, StringRef T) {\n  for (;;) {\n    if (S.empty())\n      return T.empty();\n    if (S[0] == '*') {\n      S = S.substr(1);\n      if (S.empty())\n        \/\/ Fast path. If a pattern is '*', it matches anything.\n        return true;\n      for (size_t I = 0, E = T.size(); I < E; ++I)\n        if (matchStr(S, T.substr(I)))\n          return true;\n      return false;\n    }\n    if (T.empty() || (S[0] != T[0] && S[0] != '?'))\n      return false;\n    S = S.substr(1);\n    T = T.substr(1);\n  }\n}\n\ntemplate <class ELFT> bool SectionRule::match(InputSectionBase<ELFT> *S) {\n  return matchStr(SectionPattern, S->getSectionName());\n}\n\nclass elf2::ScriptParser {\n  typedef void (ScriptParser::*Handler)();\n\npublic:\n  ScriptParser(BumpPtrAllocator *A, StringRef S, bool B)\n      : Saver(*A), Tokens(tokenize(S)), IsUnderSysroot(B) {}\n\n  void run();\n\nprivate:\n  void setError(const Twine &Msg);\n  static std::vector<StringRef> tokenize(StringRef S);\n  static StringRef skipSpace(StringRef S);\n  bool atEOF();\n  StringRef next();\n  bool skip(StringRef Tok);\n  void expect(StringRef Expect);\n\n  void addFile(StringRef Path);\n\n  void readAsNeeded();\n  void readEntry();\n  void readExtern();\n  void readGroup();\n  void readInclude();\n  void readNothing() {}\n  void readOutput();\n  void readOutputArch();\n  void readOutputFormat();\n  void readSearchDir();\n  void readSections();\n\n  void readOutputSectionDescription();\n  void readSectionPatterns(StringRef OutSec, bool Keep);\n\n  StringSaver Saver;\n  std::vector<StringRef> Tokens;\n  const static StringMap<Handler> Cmd;\n  size_t Pos = 0;\n  bool IsUnderSysroot;\n  bool Error = false;\n};\n\nconst StringMap<elf2::ScriptParser::Handler> elf2::ScriptParser::Cmd = {\n    {\"ENTRY\", &ScriptParser::readEntry},\n    {\"EXTERN\", &ScriptParser::readExtern},\n    {\"GROUP\", &ScriptParser::readGroup},\n    {\"INCLUDE\", &ScriptParser::readInclude},\n    {\"INPUT\", &ScriptParser::readGroup},\n    {\"OUTPUT\", &ScriptParser::readOutput},\n    {\"OUTPUT_ARCH\", &ScriptParser::readOutputArch},\n    {\"OUTPUT_FORMAT\", &ScriptParser::readOutputFormat},\n    {\"SEARCH_DIR\", &ScriptParser::readSearchDir},\n    {\"SECTIONS\", &ScriptParser::readSections},\n    {\";\", &ScriptParser::readNothing}};\n\nvoid ScriptParser::run() {\n  while (!atEOF()) {\n    StringRef Tok = next();\n    if (Handler Fn = Cmd.lookup(Tok))\n      (this->*Fn)();\n    else\n      setError(\"unknown directive: \" + Tok);\n  }\n}\n\n\/\/ We don't want to record cascading errors. Keep only the first one.\nvoid ScriptParser::setError(const Twine &Msg) {\n  if (Error)\n    return;\n  error(Msg);\n  Error = true;\n}\n\n\/\/ Split S into linker script tokens.\nstd::vector<StringRef> ScriptParser::tokenize(StringRef S) {\n  std::vector<StringRef> Ret;\n  for (;;) {\n    S = skipSpace(S);\n    if (S.empty())\n      return Ret;\n\n    \/\/ Quoted token\n    if (S.startswith(\"\\\"\")) {\n      size_t E = S.find(\"\\\"\", 1);\n      if (E == StringRef::npos) {\n        error(\"unclosed quote\");\n        return {};\n      }\n      Ret.push_back(S.substr(1, E - 1));\n      S = S.substr(E + 1);\n      continue;\n    }\n\n    \/\/ Unquoted token\n    size_t Pos = S.find_first_not_of(\n        \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n        \"0123456789_.$\/\\\\~=+[]*?-:\");\n    \/\/ A character that cannot start a word (which is usually a\n    \/\/ punctuation) forms a single character token.\n    if (Pos == 0)\n      Pos = 1;\n    Ret.push_back(S.substr(0, Pos));\n    S = S.substr(Pos);\n  }\n}\n\n\/\/ Skip leading whitespace characters or \/**\/-style comments.\nStringRef ScriptParser::skipSpace(StringRef S) {\n  for (;;) {\n    if (S.startswith(\"\/*\")) {\n      size_t E = S.find(\"*\/\", 2);\n      if (E == StringRef::npos) {\n        error(\"unclosed comment in a linker script\");\n        return \"\";\n      }\n      S = S.substr(E + 2);\n      continue;\n    }\n    size_t Size = S.size();\n    S = S.ltrim();\n    if (S.size() == Size)\n      return S;\n  }\n}\n\n\/\/ An errneous token is handled as if it were the last token before EOF.\nbool ScriptParser::atEOF() { return Error || Tokens.size() == Pos; }\n\nStringRef ScriptParser::next() {\n  if (Error)\n    return \"\";\n  if (atEOF()) {\n    setError(\"unexpected EOF\");\n    return \"\";\n  }\n  return Tokens[Pos++];\n}\n\nbool ScriptParser::skip(StringRef Tok) {\n  if (Error)\n    return false;\n  if (atEOF()) {\n    setError(\"unexpected EOF\");\n    return false;\n  }\n  if (Tok != Tokens[Pos])\n    return false;\n  ++Pos;\n  return true;\n}\n\nvoid ScriptParser::expect(StringRef Expect) {\n  if (Error)\n    return;\n  StringRef Tok = next();\n  if (Tok != Expect)\n    setError(Expect + \" expected, but got \" + Tok);\n}\n\nvoid ScriptParser::addFile(StringRef S) {\n  if (IsUnderSysroot && S.startswith(\"\/\")) {\n    SmallString<128> Path;\n    (Config->Sysroot + S).toStringRef(Path);\n    if (sys::fs::exists(Path)) {\n      Driver->addFile(Saver.save(Path.str()));\n      return;\n    }\n  }\n\n  if (sys::path::is_absolute(S)) {\n    Driver->addFile(S);\n  } else if (S.startswith(\"=\")) {\n    if (Config->Sysroot.empty())\n      Driver->addFile(S.substr(1));\n    else\n      Driver->addFile(Saver.save(Config->Sysroot + \"\/\" + S.substr(1)));\n  } else if (S.startswith(\"-l\")) {\n    Driver->addLibrary(S.substr(2));\n  } else if (sys::fs::exists(S)) {\n    Driver->addFile(S);\n  } else {\n    std::string Path = findFromSearchPaths(S);\n    if (Path.empty())\n      setError(\"Unable to find \" + S);\n    else\n      Driver->addFile(Saver.save(Path));\n  }\n}\n\nvoid ScriptParser::readAsNeeded() {\n  expect(\"(\");\n  bool Orig = Config->AsNeeded;\n  Config->AsNeeded = true;\n  while (!Error) {\n    StringRef Tok = next();\n    if (Tok == \")\")\n      break;\n    addFile(Tok);\n  }\n  Config->AsNeeded = Orig;\n}\n\nvoid ScriptParser::readEntry() {\n  \/\/ -e <symbol> takes predecence over ENTRY(<symbol>).\n  expect(\"(\");\n  StringRef Tok = next();\n  if (Config->Entry.empty())\n    Config->Entry = Tok;\n  expect(\")\");\n}\n\nvoid ScriptParser::readExtern() {\n  expect(\"(\");\n  while (!Error) {\n    StringRef Tok = next();\n    if (Tok == \")\")\n      return;\n    Config->Undefined.push_back(Tok);\n  }\n}\n\nvoid ScriptParser::readGroup() {\n  expect(\"(\");\n  while (!Error) {\n    StringRef Tok = next();\n    if (Tok == \")\")\n      return;\n    if (Tok == \"AS_NEEDED\") {\n      readAsNeeded();\n      continue;\n    }\n    addFile(Tok);\n  }\n}\n\nvoid ScriptParser::readInclude() {\n  StringRef Tok = next();\n  auto MBOrErr = MemoryBuffer::getFile(Tok);\n  if (!MBOrErr) {\n    setError(\"cannot open \" + Tok);\n    return;\n  }\n  std::unique_ptr<MemoryBuffer> &MB = *MBOrErr;\n  StringRef S = Saver.save(MB->getMemBufferRef().getBuffer());\n  std::vector<StringRef> V = tokenize(S);\n  Tokens.insert(Tokens.begin() + Pos, V.begin(), V.end());\n}\n\nvoid ScriptParser::readOutput() {\n  \/\/ -o <file> takes predecence over OUTPUT(<file>).\n  expect(\"(\");\n  StringRef Tok = next();\n  if (Config->OutputFile.empty())\n    Config->OutputFile = Tok;\n  expect(\")\");\n}\n\nvoid ScriptParser::readOutputArch() {\n  \/\/ Error checking only for now.\n  expect(\"(\");\n  next();\n  expect(\")\");\n}\n\nvoid ScriptParser::readOutputFormat() {\n  \/\/ Error checking only for now.\n  expect(\"(\");\n  next();\n  StringRef Tok = next();\n  if (Tok == \")\")\n   return;\n  if (Tok != \",\") {\n    setError(\"unexpected token: \" + Tok);\n    return;\n  }\n  next();\n  expect(\",\");\n  next();\n  expect(\")\");\n}\n\nvoid ScriptParser::readSearchDir() {\n  expect(\"(\");\n  Config->SearchPaths.push_back(next());\n  expect(\")\");\n}\n\nvoid ScriptParser::readSections() {\n  expect(\"{\");\n  while (!Error && !skip(\"}\"))\n    readOutputSectionDescription();\n}\n\nvoid ScriptParser::readSectionPatterns(StringRef OutSec, bool Keep) {\n  expect(\"(\");\n  while (!Error && !skip(\")\"))\n    Script->Sections.emplace_back(OutSec, next(), Keep);\n}\n\nvoid ScriptParser::readOutputSectionDescription() {\n  StringRef OutSec = next();\n  Script->SectionOrder.push_back(OutSec);\n  expect(\":\");\n  expect(\"{\");\n  while (!Error && !skip(\"}\")) {\n    StringRef Tok = next();\n    if (Tok == \"*\") {\n      readSectionPatterns(OutSec, false);\n    } else if (Tok == \"KEEP\") {\n      expect(\"(\");\n      next(); \/\/ Skip *\n      readSectionPatterns(OutSec, true);\n      expect(\")\");\n    } else {\n      setError(\"Unknown command \" + Tok);\n    }\n  }\n}\n\nstatic bool isUnderSysroot(StringRef Path) {\n  if (Config->Sysroot == \"\")\n    return false;\n  for (; !Path.empty(); Path = sys::path::parent_path(Path))\n    if (sys::fs::equivalent(Config->Sysroot, Path))\n      return true;\n  return false;\n}\n\n\/\/ Entry point. The other functions or classes are private to this file.\nvoid LinkerScript::read(MemoryBufferRef MB) {\n  StringRef Path = MB.getBufferIdentifier();\n  ScriptParser(&Alloc, MB.getBuffer(), isUnderSysroot(Path)).run();\n}\n\ntemplate StringRef LinkerScript::getOutputSection(InputSectionBase<ELF32LE> *);\ntemplate StringRef LinkerScript::getOutputSection(InputSectionBase<ELF32BE> *);\ntemplate StringRef LinkerScript::getOutputSection(InputSectionBase<ELF64LE> *);\ntemplate StringRef LinkerScript::getOutputSection(InputSectionBase<ELF64BE> *);\n\ntemplate bool LinkerScript::isDiscarded(InputSectionBase<ELF32LE> *);\ntemplate bool LinkerScript::isDiscarded(InputSectionBase<ELF32BE> *);\ntemplate bool LinkerScript::isDiscarded(InputSectionBase<ELF64LE> *);\ntemplate bool LinkerScript::isDiscarded(InputSectionBase<ELF64BE> *);\n\ntemplate bool LinkerScript::shouldKeep(InputSectionBase<ELF32LE> *);\ntemplate bool LinkerScript::shouldKeep(InputSectionBase<ELF32BE> *);\ntemplate bool LinkerScript::shouldKeep(InputSectionBase<ELF64LE> *);\ntemplate bool LinkerScript::shouldKeep(InputSectionBase<ELF64BE> *);\n\ntemplate bool SectionRule::match(InputSectionBase<ELF32LE> *);\ntemplate bool SectionRule::match(InputSectionBase<ELF32BE> *);\ntemplate bool SectionRule::match(InputSectionBase<ELF64LE> *);\ntemplate bool SectionRule::match(InputSectionBase<ELF64BE> *);\n<|endoftext|>"}
{"text":"<commit_before>#include \"geometry\/RipsExpander.hh\"\n#include \"geometry\/RipsExpanderTopDown.hh\"\n\n#include \"tests\/Base.hh\"\n\n#include \"filtrations\/Data.hh\"\n\n#include \"topology\/Simplex.hh\"\n#include \"topology\/SimplicialComplex.hh\"\n\n#include <algorithm>\n#include <iterator>\n#include <set>\n#include <vector>\n\n#include <cmath>\n\nusing namespace aleph::geometry;\nusing namespace aleph::topology;\nusing namespace aleph;\n\n\/** Checks whether co-faces are preceded by their faces in a filtration *\/\ntemplate <class InputIterator> bool isConsistentFiltration( InputIterator begin, InputIterator end )\n{\n  using Simplex = typename std::iterator_traits<InputIterator>::value_type;\n\n  \/\/ Contains all simplices that have already been 'seen' during the\n  \/\/ traversal. If an unseen face is encountered, we have identified\n  \/\/ an error.\n  std::set<Simplex> seen;\n\n  for( auto it = begin; it != end; ++it )\n  {\n    seen.insert( *it );\n\n    for( auto itFace = it->begin_boundary(); itFace != it->end_boundary(); ++itFace )\n      if( seen.find( *itFace ) == seen.end() )\n        return false;\n  }\n\n  return true;\n}\n\ntemplate <class Data, class Vertex> void triangle()\n{\n  ALEPH_TEST_BEGIN( \"Triangle\" );\n\n  using Simplex           = Simplex<Data, Vertex>;\n  using SimplicialComplex = SimplicialComplex<Simplex>;\n\n  std::vector<Simplex> simplices\n    = { {0}, {1}, {2}, {0,1}, {0,2}, {1,2} };\n\n  SimplicialComplex K( simplices.begin(), simplices.end() );\n  RipsExpander<SimplicialComplex> ripsExpander;\n\n  auto vr1 = ripsExpander( K, 2 );\n  auto vr2 = ripsExpander( K, 3 );\n\n  ALEPH_ASSERT_THROW( vr1.empty() == false );\n  ALEPH_ASSERT_THROW( vr2.empty() == false );\n  ALEPH_ASSERT_THROW( vr1.size()  == vr2.size() );\n  ALEPH_ASSERT_THROW( vr1.size()  == 7 );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class Data, class Vertex> void quad()\n{\n  ALEPH_TEST_BEGIN( \"Quad\" );\n\n  using Simplex           = Simplex<Data, Vertex>;\n  using SimplicialComplex = SimplicialComplex<Simplex>;\n\n  std::vector<Simplex> simplices\n    = { {0},\n        {1},\n        {2},\n        {3},\n        Simplex( {0,1}, Data(1) ),\n        Simplex( {0,2}, Data( std::sqrt(2.0) ) ),\n        Simplex( {1,2}, Data(1) ),\n        Simplex( {2,3}, Data(1) ),\n        Simplex( {0,3}, Data(1) ),\n        Simplex( {1,3}, Data( std::sqrt(2.0) ) ) };\n\n  SimplicialComplex K( simplices.begin(), simplices.end() );\n  RipsExpander<SimplicialComplex> ripsExpander;\n\n  auto vr1 = ripsExpander( K, 1 );\n  auto vr2 = ripsExpander( K, 2 );\n  auto vr3 = ripsExpander( K, 3 );\n\n  vr1 = ripsExpander.assignMaximumWeight( vr1 );\n  vr2 = ripsExpander.assignMaximumWeight( vr2 );\n  vr3 = ripsExpander.assignMaximumWeight( vr3 );\n\n  vr1.sort( filtrations::Data<Simplex>() );\n  vr2.sort( filtrations::Data<Simplex>() );\n  vr3.sort( filtrations::Data<Simplex>() );\n\n  ALEPH_ASSERT_THROW( vr1.empty() == false );\n  ALEPH_ASSERT_THROW( vr2.empty() == false );\n  ALEPH_ASSERT_THROW( vr3.empty() == false );\n\n  ALEPH_ASSERT_THROW( vr1.size() == simplices.size()     );\n  ALEPH_ASSERT_THROW( vr2.size() == vr1.size()       + 4 ); \/\/ +4 triangles\n  ALEPH_ASSERT_THROW( vr3.size() == vr2.size()       + 1 ); \/\/ +1 tetrahedron\n\n  ALEPH_ASSERT_THROW( isConsistentFiltration( vr1.begin(), vr1.end() ) );\n  ALEPH_ASSERT_THROW( isConsistentFiltration( vr2.begin(), vr2.end() ) );\n  ALEPH_ASSERT_THROW( isConsistentFiltration( vr3.begin(), vr3.end() ) );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class Data, class Vertex> void expanderComparison()\n{\n  ALEPH_TEST_BEGIN( \"Rips expander comparison\" );\n\n  using Simplex           = Simplex<Data, Vertex>;\n  using SimplicialComplex = SimplicialComplex<Simplex>;\n\n  std::vector<Simplex> simplices\n    = { {0},\n        {1},\n        {2},\n        {3},\n        Simplex( {0,1}, Data(1) ),\n        Simplex( {0,2}, Data( std::sqrt(2.0) ) ),\n        Simplex( {1,2}, Data(1) ),\n        Simplex( {2,3}, Data(1) ),\n        Simplex( {0,3}, Data(1) ),\n        Simplex( {1,3}, Data( std::sqrt(2.0) ) ) };\n\n  SimplicialComplex K( simplices.begin(), simplices.end() );\n\n  RipsExpander<SimplicialComplex> re;\n  RipsExpanderTopDown<SimplicialComplex> retd;\n\n  auto K1 = re( K, 3 );\n  auto K2 = retd( K, 3 );\n\n  ALEPH_ASSERT_EQUAL( K1.size(), K2.size() );\n\n  K1 = re.assignMaximumWeight( K1 );\n  K2 = retd.assignMaximumWeight( K2, K );\n\n  K1.sort( aleph::filtrations::Data<Simplex>() );\n  K2.sort( aleph::filtrations::Data<Simplex>() );\n\n  ALEPH_ASSERT_THROW( K1 == K2 );\n\n  auto K3 = retd( K, 3, 2 );\n  K3 = retd.assignMaximumWeight( K3, K );\n\n  K3.sort( aleph::filtrations::Data<Simplex>() );\n\n  ALEPH_ASSERT_THROW( K3.size() < K2.size() );\n\n  {\n    auto numSimplices = std::count_if( K2.begin(), K2.end(), [] ( const Simplex& s ) { return s.dimension() >= 2 && s.dimension() <= 3; } );\n\n    ALEPH_ASSERT_EQUAL( decltype(K3.size())( numSimplices ), K3.size() );\n  }\n\n  auto K4 = retd( K, 3, 2 );\n  K4 = retd.assignMaximumWeight( K4, K4 );\n  K4.sort( aleph::filtrations::Data<Simplex>() );\n\n  ALEPH_ASSERT_EQUAL( K3.size(), K4.size() );\n\n  {\n    auto it1 = K3.begin();\n    auto it2 = K4.begin();\n\n    for( ; it1 != K3.end() && it2 != K4.end(); ++it1, ++it2 )\n    {\n      ALEPH_ASSERT_THROW( *it1 == *it2 );\n      ALEPH_ASSERT_EQUAL( it1->data(), it2->data() );\n    }\n  }\n\n  ALEPH_TEST_END();\n}\n\nint main()\n{\n  triangle<double, unsigned>();\n  triangle<double, short   >();\n  triangle<float,  unsigned>();\n  triangle<float,  short   >();\n\n  quad<double, unsigned>();\n  quad<double, short   >();\n  quad<float,  unsigned>();\n  quad<float,  short   >();\n\n  expanderComparison<double, unsigned>();\n  expanderComparison<double, short   >();\n  expanderComparison<float,  unsigned>();\n  expanderComparison<float,  short   >();\n}\n<commit_msg>Fixed Rips expander test<commit_after>#include \"geometry\/RipsExpander.hh\"\n#include \"geometry\/RipsExpanderTopDown.hh\"\n\n#include \"tests\/Base.hh\"\n\n#include \"filtrations\/Data.hh\"\n\n#include \"topology\/Simplex.hh\"\n#include \"topology\/SimplicialComplex.hh\"\n\n#include <algorithm>\n#include <iterator>\n#include <set>\n#include <vector>\n\n#include <cmath>\n\nusing namespace aleph::geometry;\nusing namespace aleph::topology;\nusing namespace aleph;\n\n\/** Checks whether co-faces are preceded by their faces in a filtration *\/\ntemplate <class InputIterator> bool isConsistentFiltration( InputIterator begin, InputIterator end )\n{\n  using Simplex = typename std::iterator_traits<InputIterator>::value_type;\n\n  \/\/ Contains all simplices that have already been 'seen' during the\n  \/\/ traversal. If an unseen face is encountered, we have identified\n  \/\/ an error.\n  std::set<Simplex> seen;\n\n  for( auto it = begin; it != end; ++it )\n  {\n    seen.insert( *it );\n\n    for( auto itFace = it->begin_boundary(); itFace != it->end_boundary(); ++itFace )\n      if( seen.find( *itFace ) == seen.end() )\n        return false;\n  }\n\n  return true;\n}\n\ntemplate <class Data, class Vertex> void triangle()\n{\n  ALEPH_TEST_BEGIN( \"Triangle\" );\n\n  using Simplex           = Simplex<Data, Vertex>;\n  using SimplicialComplex = SimplicialComplex<Simplex>;\n\n  std::vector<Simplex> simplices\n    = { {0}, {1}, {2}, {0,1}, {0,2}, {1,2} };\n\n  SimplicialComplex K( simplices.begin(), simplices.end() );\n  RipsExpander<SimplicialComplex> ripsExpander;\n\n  auto vr1 = ripsExpander( K, 2 );\n  auto vr2 = ripsExpander( K, 3 );\n\n  ALEPH_ASSERT_THROW( vr1.empty() == false );\n  ALEPH_ASSERT_THROW( vr2.empty() == false );\n  ALEPH_ASSERT_THROW( vr1.size()  == vr2.size() );\n  ALEPH_ASSERT_THROW( vr1.size()  == 7 );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class Data, class Vertex> void quad()\n{\n  ALEPH_TEST_BEGIN( \"Quad\" );\n\n  using Simplex           = Simplex<Data, Vertex>;\n  using SimplicialComplex = SimplicialComplex<Simplex>;\n\n  std::vector<Simplex> simplices\n    = { {0},\n        {1},\n        {2},\n        {3},\n        Simplex( {0,1}, Data(1) ),\n        Simplex( {0,2}, Data( std::sqrt(2.0) ) ),\n        Simplex( {1,2}, Data(1) ),\n        Simplex( {2,3}, Data(1) ),\n        Simplex( {0,3}, Data(1) ),\n        Simplex( {1,3}, Data( std::sqrt(2.0) ) ) };\n\n  SimplicialComplex K( simplices.begin(), simplices.end() );\n  RipsExpander<SimplicialComplex> ripsExpander;\n\n  auto vr1 = ripsExpander( K, 1 );\n  auto vr2 = ripsExpander( K, 2 );\n  auto vr3 = ripsExpander( K, 3 );\n\n  vr1 = ripsExpander.assignMaximumWeight( vr1 );\n  vr2 = ripsExpander.assignMaximumWeight( vr2 );\n  vr3 = ripsExpander.assignMaximumWeight( vr3 );\n\n  vr1.sort( filtrations::Data<Simplex>() );\n  vr2.sort( filtrations::Data<Simplex>() );\n  vr3.sort( filtrations::Data<Simplex>() );\n\n  ALEPH_ASSERT_THROW( vr1.empty() == false );\n  ALEPH_ASSERT_THROW( vr2.empty() == false );\n  ALEPH_ASSERT_THROW( vr3.empty() == false );\n\n  ALEPH_ASSERT_THROW( vr1.size() == simplices.size()     );\n  ALEPH_ASSERT_THROW( vr2.size() == vr1.size()       + 4 ); \/\/ +4 triangles\n  ALEPH_ASSERT_THROW( vr3.size() == vr2.size()       + 1 ); \/\/ +1 tetrahedron\n\n  ALEPH_ASSERT_THROW( isConsistentFiltration( vr1.begin(), vr1.end() ) );\n  ALEPH_ASSERT_THROW( isConsistentFiltration( vr2.begin(), vr2.end() ) );\n  ALEPH_ASSERT_THROW( isConsistentFiltration( vr3.begin(), vr3.end() ) );\n\n  ALEPH_TEST_END();\n}\n\ntemplate <class Data, class Vertex> void expanderComparison()\n{\n  ALEPH_TEST_BEGIN( \"Rips expander comparison\" );\n\n  using Simplex           = Simplex<Data, Vertex>;\n  using SimplicialComplex = SimplicialComplex<Simplex>;\n\n  std::vector<Simplex> simplices\n    = { {0},\n        {1},\n        {2},\n        {3},\n        Simplex( {0,1}, Data(1) ),\n        Simplex( {0,2}, Data( std::sqrt(2.0) ) ),\n        Simplex( {1,2}, Data(1) ),\n        Simplex( {2,3}, Data(1) ),\n        Simplex( {0,3}, Data(1) ),\n        Simplex( {1,3}, Data( std::sqrt(2.0) ) ) };\n\n  SimplicialComplex K( simplices.begin(), simplices.end() );\n\n  RipsExpander<SimplicialComplex> re;\n  RipsExpanderTopDown<SimplicialComplex> retd;\n\n  auto K1 = re( K, 3 );\n  auto K2 = retd( K, 3 );\n\n  ALEPH_ASSERT_EQUAL( K1.size(), K2.size() );\n\n  K1 = re.assignMaximumWeight( K1 );\n  K2 = retd.assignMaximumWeight( K2, K );\n\n  K1.sort( aleph::filtrations::Data<Simplex>() );\n  K2.sort( aleph::filtrations::Data<Simplex>() );\n\n  ALEPH_ASSERT_THROW( K1 == K2 );\n\n  auto K3 = retd( K, 3, 2 );\n  K3 = retd.assignMaximumWeight( K3, K );\n\n  K3.sort( aleph::filtrations::Data<Simplex>() );\n\n  ALEPH_ASSERT_THROW( K3.size() < K2.size() );\n\n  {\n    auto numSimplices = std::count_if( K2.begin(), K2.end(), [] ( const Simplex& s ) { return s.dimension() >= 2 && s.dimension() <= 3; } );\n\n    ALEPH_ASSERT_EQUAL( decltype(K3.size())( numSimplices ), K3.size() );\n  }\n\n  auto K4 = retd( K, 3, 2 );\n  K4 = retd.assignMaximumWeight( K4, K );\n  K4.sort( aleph::filtrations::Data<Simplex>() );\n\n  ALEPH_ASSERT_EQUAL( K3.size(), K4.size() );\n\n  {\n    auto it1 = K3.begin();\n    auto it2 = K4.begin();\n\n    for( ; it1 != K3.end() && it2 != K4.end(); ++it1, ++it2 )\n    {\n      ALEPH_ASSERT_THROW( *it1 == *it2 );\n      ALEPH_ASSERT_EQUAL( it1->data(), it2->data() );\n    }\n  }\n\n  ALEPH_TEST_END();\n}\n\nint main()\n{\n  triangle<double, unsigned>();\n  triangle<double, short   >();\n  triangle<float,  unsigned>();\n  triangle<float,  short   >();\n\n  quad<double, unsigned>();\n  quad<double, short   >();\n  quad<float,  unsigned>();\n  quad<float,  short   >();\n\n  expanderComparison<double, unsigned>();\n  expanderComparison<double, short   >();\n  expanderComparison<float,  unsigned>();\n  expanderComparison<float,  short   >();\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 EMCAL Manager class \n\/\/ An object of this class does not produce digits\n\/\/ It is the one to use if you do want to produce outputs in TREEH \n\/\/                  \n\/\/*-- Author: Sahal Yacoob (LBL \/UCT)\n\/\/*--       : Jennifer Klay (LBL)\n\n\/\/ This Class not stores information on all particles prior to EMCAL entry - in order to facilitate analysis.\n\/\/ This is done by setting fIShunt =2, and flagging all parents of particles entering the EMCAL.\n\n\/\/ 15\/02\/2002 .... Yves Schutz\n\/\/  1. fSamplingFraction and fLayerToPreshowerRatio have been removed\n\/\/  2. Timing signal is collected and added to hit\n\n\/\/ --- ROOT system ---\n#include \"TPGON.h\"\n#include \"TTUBS.h\"\n#include \"TNode.h\"\n#include \"TRandom.h\"\n#include \"TTree.h\"\n#include \"TGeometry.h\"\n#include \"TParticle.h\"\n\n\/\/ --- Standard library ---\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <Rstrstream.h>\n#include <Riostream.h>\n#include <math.h>\n\n\/\/ --- AliRoot header files ---\n\n#include \"AliEMCALv1.h\"\n#include \"AliEMCALHit.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliConst.h\"\n#include \"AliRun.h\"\n\nClassImp(AliEMCALv1)\n\n\n\/\/______________________________________________________________________\nAliEMCALv1::AliEMCALv1():AliEMCALv0(){\n  \/\/ ctor\n\n}\n\n\/\/______________________________________________________________________\nAliEMCALv1::AliEMCALv1(const char *name, const char *title):\n    AliEMCALv0(name,title){\n    \/\/ Standard Creator.\n\n    fHits= new TClonesArray(\"AliEMCALHit\",1000);\n    gAlice->AddHitList(fHits);\n\n    fNhits = 0;\n    fIshunt     =  2; \/\/ All hits are associated with particles entering the calorimeter\n}\n\n\/\/______________________________________________________________________\nAliEMCALv1::~AliEMCALv1(){\n    \/\/ dtor\n\n    if ( fHits) {\n\tfHits->Delete();\n\tdelete fHits;\n\tfHits = 0;\n    }\n}\n\/\/______________________________________________________________________\nvoid AliEMCALv1::AddHit(Int_t shunt, Int_t primary, Int_t tracknumber, Int_t iparent, Float_t ienergy, \n\t\t\tInt_t id, Float_t * hits,Float_t * p){\n    \/\/ Add a hit to the hit list.\n    \/\/ An EMCAL hit is the sum of all hits in a tower section (PRE, ECAL, HCAL) \n    \/\/   originating from the same entering particle \n    Int_t hitCounter;\n    \n    AliEMCALHit *newHit;\n    AliEMCALHit *curHit;\n    Bool_t deja = kFALSE;\n\n    newHit = new AliEMCALHit(shunt, primary, tracknumber, iparent, ienergy, id, hits, p);\n    for ( hitCounter = fNhits-1; hitCounter >= 0 && !deja; hitCounter-- ) {\n\tcurHit = (AliEMCALHit*) (*fHits)[hitCounter];\n\t\/\/ We add hits with the same tracknumber, while GEANT treats\n\t\/\/ primaries succesively\n\tif(curHit->GetPrimary() != primary) \n\t  break;\n\tif( *curHit == *newHit ) {\n\t    *curHit = *curHit + *newHit;\n\t    deja = kTRUE;\n\t} \/\/ end if\n    } \/\/ end for hitCounter\n\n    if ( !deja ) {\n\tnew((*fHits)[fNhits]) AliEMCALHit(*newHit);\n\tfNhits++;\n    } \/\/ end if\n\n    delete newHit;\n}\n\/\/______________________________________________________________________\nvoid AliEMCALv1::StepManager(void){\n  \/\/ Accumulates hits as long as the track stays in a single\n  \/\/ crystal or PPSD gas Cell\n\n  Int_t          id[2];           \/\/ (layer, phi, Eta) indices\n  \/\/ position wrt MRS and energy deposited\n  Float_t        xyzte[5]={0.,0.,0.,0.,0.};\/\/ position wrt MRS, time and energy deposited\n  Float_t        pmom[4]={0.,0.,0.,0.};\n  TLorentzVector pos; \/\/ Lorentz vector of the track current position.\n  TLorentzVector mom; \/\/ Lorentz vector of the track current momentum.\n  Int_t tracknumber =  gAlice->CurrentTrack();\n  Int_t primary = 0;\n  static Int_t iparent = 0;\n  static Float_t ienergy = 0;\n  Int_t copy = 0;\n  \n  AliEMCALGeometry * geom = GetGeometry() ; \n\n  if(gMC->IsTrackEntering() && (strcmp(gMC->CurrentVolName(),\"XALU\") == 0)){ \/\/ This Particle in enterring the Calorimeter\n    gMC->TrackPosition(pos) ;\n    xyzte[0] = pos[0] ;\n    xyzte[1] = pos[1] ;\n    xyzte[2] = pos[2] ;\n    if ( (xyzte[0]*xyzte[0] + xyzte[1]*xyzte[1])  \n\t <  (geom->GetEnvelop(0)+geom->GetGap2Active()+1.5 )*(geom->GetEnvelop(0)+geom->GetGap2Active()+1.5 ) ) {\n      iparent = tracknumber;\n      gMC->TrackMomentum(mom);\n      ienergy = mom[3]; \n      TParticle * part = 0 ;\n      Int_t parent = iparent ;\n      while ( parent != -1 ) { \/\/ <------------- flags this particle to be kept and\n\t\/\/all the ancestors of this particle\n\tpart = gAlice->Particle(parent) ;\n\tpart->SetBit(kKeepBit);\n\tparent = part->GetFirstMother() ;\n      }\n    }\n  }\n  if(gMC->CurrentVolID(copy) == gMC->VolId(\"XPHI\") ) { \/\/ We are in a Scintillator Layer \n    \n    Float_t depositedEnergy ; \n    \n    if( (depositedEnergy = gMC->Edep()) > 0.){\/\/ Track is inside a scintillator and deposits some energy\n     \n      gMC->TrackPosition(pos);\n      xyzte[0] = pos[0];\n      xyzte[1] = pos[1];\n      xyzte[2] = pos[2];\n      xyzte[3] = gMC->TrackTime() ;       \n      \n      gMC->TrackMomentum(mom);\n      pmom[0] = mom[0];\n      pmom[1] = mom[1];\n      pmom[2] = mom[2];\n      pmom[3] = mom[3];\n      \n      gMC->CurrentVolOffID(1, id[0]); \/\/ get the POLY copy number;\n      gMC->CurrentVolID(id[1]); \/\/ get the phi number inside the layer\n      \n      Int_t tower = (id[0]-1) % geom->GetNZ() + 1 + (id[1] - 1) * 96 ;  \n      Int_t layer = static_cast<Int_t>((id[0]-1)\/(geom->GetNZ())) + 1 ; \n      Int_t absid = tower ; \n      if (layer <= geom->GetNPRLayers() )\n\tabsid += geom->GetNZ() * geom->GetNPhi() ;\n      else if (layer > geom->GetNECLayers() )\n\tabsid += 2 * geom->GetNZ() * geom->GetNPhi() ;\n      else {\n\tInt_t nlayers = geom->GetNPRLayers()+ geom->GetNECLayers()+ geom->GetNHCLayers() ;\n\tif (layer > nlayers) \n\t  Fatal(\"StepManager\", \"Wrong calculation of layer number: layer = %d > %d\\n\", layer, nlayers) ;\n      }\n\t\n      Float_t lightYield =  depositedEnergy ;\n\t\t\t\t\t     ;\n      xyzte[4] = lightYield  ;\n   \n      primary = gAlice->GetPrimary(tracknumber);\n\n      if (gDebug == 2) \n\tInfo(\"StepManager\", \"id0 = %d, id1 = %d, absid = %d tower = %d layer = %d energy = %f\\n\", id[0], id[1], absid, tower, layer, xyzte[4]) ;\n\n      AddHit(fIshunt, primary,tracknumber, iparent, ienergy, absid, xyzte, pmom);\n    } \/\/ there is deposited energy\n  }\n}\n<commit_msg>correct in the StepManager the calculation of the tower id<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 EMCAL Manager class \n\/\/ An object of this class does not produce digits\n\/\/ It is the one to use if you do want to produce outputs in TREEH \n\/\/                  \n\/\/*-- Author: Sahal Yacoob (LBL \/UCT)\n\/\/*--       : Jennifer Klay (LBL)\n\n\/\/ This Class not stores information on all particles prior to EMCAL entry - in order to facilitate analysis.\n\/\/ This is done by setting fIShunt =2, and flagging all parents of particles entering the EMCAL.\n\n\/\/ 15\/02\/2002 .... Yves Schutz\n\/\/  1. fSamplingFraction and fLayerToPreshowerRatio have been removed\n\/\/  2. Timing signal is collected and added to hit\n\n\/\/ --- ROOT system ---\n#include \"TPGON.h\"\n#include \"TTUBS.h\"\n#include \"TNode.h\"\n#include \"TRandom.h\"\n#include \"TTree.h\"\n#include \"TGeometry.h\"\n#include \"TParticle.h\"\n\n\/\/ --- Standard library ---\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <Rstrstream.h>\n#include <Riostream.h>\n#include <math.h>\n\n\/\/ --- AliRoot header files ---\n\n#include \"AliEMCALv1.h\"\n#include \"AliEMCALHit.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliConst.h\"\n#include \"AliRun.h\"\n\nClassImp(AliEMCALv1)\n\n\n\/\/______________________________________________________________________\nAliEMCALv1::AliEMCALv1():AliEMCALv0(){\n  \/\/ ctor\n\n}\n\n\/\/______________________________________________________________________\nAliEMCALv1::AliEMCALv1(const char *name, const char *title):\n    AliEMCALv0(name,title){\n    \/\/ Standard Creator.\n\n    fHits= new TClonesArray(\"AliEMCALHit\",1000);\n    gAlice->AddHitList(fHits);\n\n    fNhits = 0;\n    fIshunt     =  2; \/\/ All hits are associated with particles entering the calorimeter\n}\n\n\/\/______________________________________________________________________\nAliEMCALv1::~AliEMCALv1(){\n    \/\/ dtor\n\n    if ( fHits) {\n\tfHits->Delete();\n\tdelete fHits;\n\tfHits = 0;\n    }\n}\n\/\/______________________________________________________________________\nvoid AliEMCALv1::AddHit(Int_t shunt, Int_t primary, Int_t tracknumber, Int_t iparent, Float_t ienergy, \n\t\t\tInt_t id, Float_t * hits,Float_t * p){\n    \/\/ Add a hit to the hit list.\n    \/\/ An EMCAL hit is the sum of all hits in a tower section (PRE, ECAL, HCAL) \n    \/\/   originating from the same entering particle \n    Int_t hitCounter;\n    \n    AliEMCALHit *newHit;\n    AliEMCALHit *curHit;\n    Bool_t deja = kFALSE;\n\n    newHit = new AliEMCALHit(shunt, primary, tracknumber, iparent, ienergy, id, hits, p);\n    for ( hitCounter = fNhits-1; hitCounter >= 0 && !deja; hitCounter-- ) {\n\tcurHit = (AliEMCALHit*) (*fHits)[hitCounter];\n\t\/\/ We add hits with the same tracknumber, while GEANT treats\n\t\/\/ primaries succesively\n\tif(curHit->GetPrimary() != primary) \n\t  break;\n\tif( *curHit == *newHit ) {\n\t    *curHit = *curHit + *newHit;\n\t    deja = kTRUE;\n\t} \/\/ end if\n    } \/\/ end for hitCounter\n\n    if ( !deja ) {\n\tnew((*fHits)[fNhits]) AliEMCALHit(*newHit);\n\tfNhits++;\n    } \/\/ end if\n\n    delete newHit;\n}\n\/\/______________________________________________________________________\nvoid AliEMCALv1::StepManager(void){\n  \/\/ Accumulates hits as long as the track stays in a single\n  \/\/ crystal or PPSD gas Cell\n\n  Int_t          id[2];           \/\/ (layer, phi, Eta) indices\n  \/\/ position wrt MRS and energy deposited\n  Float_t        xyzte[5]={0.,0.,0.,0.,0.};\/\/ position wrt MRS, time and energy deposited\n  Float_t        pmom[4]={0.,0.,0.,0.};\n  TLorentzVector pos; \/\/ Lorentz vector of the track current position.\n  TLorentzVector mom; \/\/ Lorentz vector of the track current momentum.\n  Int_t tracknumber =  gAlice->CurrentTrack();\n  Int_t primary = 0;\n  static Int_t iparent = 0;\n  static Float_t ienergy = 0;\n  Int_t copy = 0;\n  \n  AliEMCALGeometry * geom = GetGeometry() ; \n\n  if(gMC->IsTrackEntering() && (strcmp(gMC->CurrentVolName(),\"XALU\") == 0)){ \/\/ This Particle in enterring the Calorimeter\n    gMC->TrackPosition(pos) ;\n    xyzte[0] = pos[0] ;\n    xyzte[1] = pos[1] ;\n    xyzte[2] = pos[2] ;\n    if ( (xyzte[0]*xyzte[0] + xyzte[1]*xyzte[1])  \n\t <  (geom->GetEnvelop(0)+geom->GetGap2Active()+1.5 )*(geom->GetEnvelop(0)+geom->GetGap2Active()+1.5 ) ) {\n      iparent = tracknumber;\n      gMC->TrackMomentum(mom);\n      ienergy = mom[3]; \n      TParticle * part = 0 ;\n      Int_t parent = iparent ;\n      while ( parent != -1 ) { \/\/ <------------- flags this particle to be kept and\n\t\/\/all the ancestors of this particle\n\tpart = gAlice->Particle(parent) ;\n\tpart->SetBit(kKeepBit);\n\tparent = part->GetFirstMother() ;\n      }\n    }\n  }\n  if(gMC->CurrentVolID(copy) == gMC->VolId(\"XPHI\") ) { \/\/ We are in a Scintillator Layer \n    \n    Float_t depositedEnergy ; \n    \n    if( (depositedEnergy = gMC->Edep()) > 0.){\/\/ Track is inside a scintillator and deposits some energy\n     \n      gMC->TrackPosition(pos);\n      xyzte[0] = pos[0];\n      xyzte[1] = pos[1];\n      xyzte[2] = pos[2];\n      xyzte[3] = gMC->TrackTime() ;       \n      \n      gMC->TrackMomentum(mom);\n      pmom[0] = mom[0];\n      pmom[1] = mom[1];\n      pmom[2] = mom[2];\n      pmom[3] = mom[3];\n      \n      gMC->CurrentVolOffID(1, id[0]); \/\/ get the POLY copy number;\n      gMC->CurrentVolID(id[1]); \/\/ get the phi number inside the layer\n      \n      Int_t tower = (id[0]-1) % geom->GetNZ() + 1 + (id[1] - 1) * geom->GetNZ() ;  \n      Int_t layer = static_cast<Int_t>((id[0]-1)\/(geom->GetNZ())) + 1 ; \n      Int_t absid = tower ; \n      if (layer <= geom->GetNPRLayers() )\n\tabsid += geom->GetNZ() * geom->GetNPhi() ;\n      else if (layer > geom->GetNECLayers() )\n\tabsid += 2 * geom->GetNZ() * geom->GetNPhi() ;\n      else {\n\tInt_t nlayers = geom->GetNPRLayers()+ geom->GetNECLayers()+ geom->GetNHCLayers() ;\n\tif (layer > nlayers) \n\t  Fatal(\"StepManager\", \"Wrong calculation of layer number: layer = %d > %d\\n\", layer, nlayers) ;\n      }\n\t\n      Float_t lightYield =  depositedEnergy ;\n\t\t\t\t\t     ;\n      xyzte[4] = lightYield  ;\n   \n      primary = gAlice->GetPrimary(tracknumber);\n\n      if (gDebug == 2) \n\tInfo(\"StepManager\", \"id0 = %d, id1 = %d, absid = %d tower = %d layer = %d energy = %f\\n\", id[0], id[1], absid, tower, layer, xyzte[4]) ;\n\n      AddHit(fIshunt, primary,tracknumber, iparent, ienergy, absid, xyzte, pmom);\n    } \/\/ there is deposited energy\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"pinboost_debug.h\"\n\n#include <sys\/types.h>\n#include <unistd.h>\n#include <iostream>\n#include <cstdlib>\n\nbool pinboost_do_debug = false;\nstatic std::string pinboost_name = \"PINBOOST\";\n\nstatic EXCEPT_HANDLING_RESULT pinboost_exceptionhandler(THREADID threadid, EXCEPTION_INFO *pExceptInfo, PHYSICAL_CONTEXT *pPhysCtxt, VOID *v)\n{\n   static bool in_handler = false;\n\n   std::cerr << \"[\"<<pinboost_name<<\"] Internal exception:\" << PIN_ExceptionToString(pExceptInfo) << std::endl;\n\n   if (!in_handler)\n   {\n      \/\/ Avoid recursion when the code below generates a new exception\n      in_handler = true;\n\n      pinboost_debugme(threadid);\n   }\n\n   return EHR_CONTINUE_SEARCH;\n}\n\n\nvoid pinboost_register(const char* name)\n{\n   PIN_AddInternalExceptionHandler(pinboost_exceptionhandler, NULL);\n   if (name)\n      pinboost_name = name;\n   pinboost_do_debug = true;\n}\n\nvoid pinboost_debugme(THREADID threadid)\n{\n   if (getenv(\"SNIPER_ROOT\") == NULL)\n   {\n      std::cerr << \"[\" << pinboost_name << \"] SNIPER_ROOT not set, cannot launch debugger.\" << std::endl;\n      return;\n   }\n\n   \/\/ If we are the faulting thread, pass in our tid so the debug script can mark us\n   pid_t tid = PIN_ThreadId() == threadid ? PIN_GetTid() : 0;\n\n   char cmd[1024];\n   sprintf(cmd, \"%s\/tools\/pinboost_debugme.py %d %d\", getenv(\"SNIPER_ROOT\"), getpid(), tid);\n\n   int rc = system(cmd);\n   if (rc)\n   {\n      std::cerr << \"[\" << pinboost_name << \"] Failed to start debugging session.\" << std::endl;\n      return;\n   }\n\n   \/\/ Give the debugger some time to attach, after that, fall through\n   sleep(5);\n}\n\nvoid pinboost_assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function)\n{\n   std::cerr << \"[\" << pinboost_name << \"] \" << __file << \":\" << __line << \": \" <<__function\n             << \": Assertion `\" << __assertion << \"' failed.\" << std::endl;\n   if (pinboost_do_debug)\n      pinboost_debugme(PIN_ThreadId());\n   exit(0);\n}\n<commit_msg>[sift_recorder] Improve exception handling - Ignore exceptions occuring after timing model says we're done - Ignore double exceptions (either from signal handler or from another thread)<commit_after>#include \"pinboost_debug.h\"\n\n#include <sys\/types.h>\n#include <unistd.h>\n#include <iostream>\n#include <cstdlib>\n\nbool assert_ignore();\n\nbool pinboost_do_debug = false;\nstatic std::string pinboost_name = \"PINBOOST\";\n\nstatic EXCEPT_HANDLING_RESULT pinboost_exceptionhandler(THREADID threadid, EXCEPTION_INFO *pExceptInfo, PHYSICAL_CONTEXT *pPhysCtxt, VOID *v)\n{\n   static bool in_handler = false;\n\n   if (assert_ignore())\n   {\n      \/\/ Timing model says it's done, ignore assert and pretend to have exited cleanly\n      exit(0);\n   }\n\n   std::cerr << \"[\"<<pinboost_name<<\"] Internal exception:\" << PIN_ExceptionToString(pExceptInfo) << std::endl;\n\n   if (!in_handler)\n   {\n      \/\/ Avoid recursion when the code below generates a new exception\n      in_handler = true;\n\n      pinboost_debugme(threadid);\n   }\n   else\n   {\n      \/\/ Error occurred while handling another error (either in the exception handler, or in another thread)\n      \/\/ Debug session should already be started, let's ignore this error and halt so the user can inspect the state.\n      pause();\n   }\n\n   return EHR_CONTINUE_SEARCH;\n}\n\n\nvoid pinboost_register(const char* name)\n{\n   PIN_AddInternalExceptionHandler(pinboost_exceptionhandler, NULL);\n   if (name)\n      pinboost_name = name;\n   pinboost_do_debug = true;\n}\n\nvoid pinboost_debugme(THREADID threadid)\n{\n   if (getenv(\"SNIPER_ROOT\") == NULL)\n   {\n      std::cerr << \"[\" << pinboost_name << \"] SNIPER_ROOT not set, cannot launch debugger.\" << std::endl;\n      return;\n   }\n\n   \/\/ If we are the faulting thread, pass in our tid so the debug script can mark us\n   pid_t tid = PIN_ThreadId() == threadid ? PIN_GetTid() : 0;\n\n   char cmd[1024];\n   sprintf(cmd, \"%s\/tools\/pinboost_debugme.py %d %d\", getenv(\"SNIPER_ROOT\"), getpid(), tid);\n\n   int rc = system(cmd);\n   if (rc)\n   {\n      std::cerr << \"[\" << pinboost_name << \"] Failed to start debugging session.\" << std::endl;\n      return;\n   }\n\n   \/\/ Give the debugger some time to attach, after that, fall through\n   sleep(5);\n}\n\nvoid pinboost_assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function)\n{\n   std::cerr << \"[\" << pinboost_name << \"] \" << __file << \":\" << __line << \": \" <<__function\n             << \": Assertion `\" << __assertion << \"' failed.\" << std::endl;\n   if (pinboost_do_debug)\n      pinboost_debugme(PIN_ThreadId());\n   exit(0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ sample.hxx -- Sound sample encapsulation class\n\/\/ \n\/\/ Written by Curtis Olson, started April 2004.\n\/\/\n\/\/ Copyright (C) 2004  Curtis L. Olson - http:\/\/www.flightgear.org\/~curt\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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.\n\/\/\n\/\/ $Id$\n\n\/**\n * \\file sample.hxx\n * Provides a sound sample encapsulation\n *\/\n\n#ifndef _SG_SAMPLE_HXX\n#define _SG_SAMPLE_HXX 1\n\n#ifndef __cplusplus\n# error This library requires C++\n#endif\n\n#include <string>\n\n#include <simgear\/compiler.h>\n#include <simgear\/debug\/logstream.hxx>\n#include <simgear\/structure\/SGReferenced.hxx>\n#include <simgear\/structure\/SGSharedPtr.hxx>\n#include <simgear\/math\/SGMath.hxx>\n\n\/\/ #include <plib\/sg.h>\n\n\/**\n * manages everything we need to know for an individual sound sample\n *\/\n\nclass SGSoundSample : public SGReferenced {\n\nprivate:\n\n    \/\/ Position of the source sound.\n    SGVec3d _absolute_pos;\t\/\/ absolute position\n    SGVec3f _relative_pos;\t\/\/ position relative to the base position\n    SGVec3d _direction;\t\t\/\/ orientation offset\n    SGVec3d _velocity;\t\t\/\/ Velocity of the source sound.\n\n    \/\/ The position and orientation of the sound\n    SGGeod _base_pos;\n    SGQuatd _orientation;\t\/\/ base orientation\n\n    std::string _sample_name;\n    unsigned char *_data;\n\n    \/\/ configuration values\n    int _format;\n    int _size;\n    int _freq;\n\n    \/\/ Buffers hold sound data.\n    bool _valid_buffer;\n    unsigned int _buffer;\n\n    \/\/ Sources are points emitting sound.\n    bool _valid_source;\n    unsigned int _source;\n\n    \/\/ The orientation of the sound (direction and cut-off angles)\n    float _inner_angle;\n    float _outer_angle;\n    float _outer_gain;\n\n    float _pitch;\n    float _volume;\n    float _master_volume;\n    float _reference_dist;\n    float _max_dist;\n    bool _loop;\n\n    bool _playing;\n    bool _changed;\n    bool _static_changed;\n    bool _is_file;\n\n    SGVec3f _orivec;\n    void update_absolute_position();\n\npublic:\n\n     \/**\n      * Empty constructor, can be used to read data to the systems\n      * memory and not to the driver.\n      *\/\n    SGSoundSample();\n\n    \/**\n     * Constructor\n     * @param path Path name to sound\n     * @param file File name of sound\n       should usually be true unless you want to manipulate the data\n       later.)\n     *\/\n    SGSoundSample( const char *path, const char *file );\n\n    \/**\n     * Constructor.\n     * @param _data Pointer to a memory buffer containing the sample data\n       the application is responsible for freeing the buffer data.\n     * @param len Byte length of array\n     * @param _freq Frequency of the provided data (bytes per second)\n       should usually be true unless you want to manipulate the data\n       later.)\n     *\/\n    SGSoundSample( unsigned char *data, int len, int freq, int format = AL_FORMAT_MONO8 );\n\n    ~SGSoundSample ();\n\n    \/**\n     * detect wheter the sample holds the information of a sound file\n     *\/\n    inline bool is_file() const { return _is_file; }\n\n    \/**\n     * Test whether this sample has a changed configuration since the last\n     * call. (Calling this function resets the value).\n     *\/\n    inline bool has_changed() {\n        bool b = _changed; _changed = false; return b;\n    }\n\n    inline bool has_static_data_changed() {\n        bool b = _static_changed; _static_changed = false; return b;\n    }\n\n\n    \/**\n     * Start playing this sample.\n     *\n     * @param _loop Define whether the sound should be played in a loop.\n     *\/\n    inline void play( bool loop ) {\n        _playing = true; _loop = loop; _changed = true;\n    }\n\n    \/**\n     * Return if the sample is looping or not.\n     *\/\n    inline bool get_looping() { return _loop; }\n\n    \/**\n     * Stop playing this sample.\n     *\n     * @param sched A pointer to the appropriate scheduler.\n     *\/\n    inline void stop() {\n        _playing = false; _changed = true;\n    }\n\n    \/**\n     * Play this sample once.\n     * @see #play\n     *\/\n    inline void play_once() { play(false); }\n\n    \/** \n     * Play this sample looped.\n     * @see #play\n     *\/\n    inline void play_looped() { play(true); }\n\n    \/**\n     * Test if a sample is currently playing.\n     * @return true if is is playing, false otherwise.\n     *\/\n    inline bool is_playing() { return _playing; }\n\n    \/**\n     * set the data associated with this sample\n     *\/\n    inline void set_data( unsigned char* data ) {\n        _data = data;\n    }\n\n    \/**\n     * @return the data associated with this sample\n     *\/\n    inline void* get_data() const { return _data; }\n\n    \/**\n     * free the data associated with this sample\n     *\/\n    inline void free_data() {\n        if (_data != NULL) { delete[] _data; _data = NULL; }\n    }\n\n    \/**\n     * set the source id of this source\n     *\/\n    inline void set_source(unsigned int s) {\n        _source = s; _valid_source = true; _changed = true;\n    }\n\n    \/**\n     * get the source id of this source\n     *\/\n    inline unsigned int get_source() { return _source; }\n\n    \/**\n     * detect wheter the source id of the sample is valid\n     *\/\n    inline bool is_valid_source() const { return _valid_source; }\n\n    \/**\n     * set the source id of the sample to invalid.\n     *\/\n    inline void no_valid_source() {\n        _valid_source = false;\n    }\n\n    \/**\n     * set the buffer id of this source\n     *\/\n    inline void set_buffer(unsigned int b) {\n        _buffer = b; _valid_buffer = true; _changed = true;\n    } \n\n    \/**\n     * get the buffer id of this source\n     *\/\n    inline unsigned int get_buffer() { return _buffer; }\n\n    \/**\n     * detect wheter the source id of the sample is valid\n     *\/\n    inline bool is_valid_buffer() const { return _valid_buffer; }\n\n    \/**\n     * set the source id of the sample to invalid.\n     *\/\n    inline void no_valid_buffer() {\n        _valid_buffer = false;\n    }\n\n    \/**\n     * Get the current pitch setting of this sample.\n     *\/\n    inline float get_pitch() { return _pitch; }\n\n    \/**\n     * Set the pitch of this sample.\n     *\/\n    inline void set_pitch( float p ) {\n        _pitch = p; _changed = true;\n    }\n\n    \/**\n     * Get the current volume setting of this sample.\n     *\/\n    inline float get_volume() { return _volume * _master_volume; }\n\n    \/**\n     * Set the master (sampel group) volume of this sample.\n     *\/\n    inline void set_master_volume( float v ) {\n        _master_volume = v; _changed = true;\n    }\n\n    \/**\n     * Set the volume of this sample.\n     *\/\n    inline void set_volume( float v ) {\n        _volume = v; _changed = true;\n    }\n\n    \/**\n     * Set the format of the sounds sample\n     *\/\n    inline void set_format( int format ) {\n        _format = format;\n    }\n\n    \/**\n     * Returns the format of the sounds sample\n     *\/\n    inline int get_format() { return _format; }\n\n\n    \/**\n     * Set the frequency of the sounds sample\n     *\/\n    inline void set_frequency( int freq ) {\n        _freq = freq; _changed = true;\n    }\n\n    \/**\n     * Returns the frequency of the sounds sample\n     *\/\n    inline int get_frequency() { return _freq; }\n\n    \/**\n     * Returns the size of the sounds sample\n     *\/\n    inline void set_size( int size ) {\n        _size = size;\n    }\n\n    \/**\n     * Returns the size of the sounds sample\n     *\/\n    inline int get_size() const { return _size; }\n\n    \/**\n     * Set position of the sound source (uses same coordinate system as opengl)\n     *\/\n    void set_relative_position( SGVec3f pos );\n\n    \/**\n     * Get position of the sound source (uses same coordinate system as opengl)\n     *\/\n    inline float *get_position() const { return toVec3f(_absolute_pos).data(); }\n\n    \/**\n     * Set the position of the sound source\n     *\/\n    void set_position( SGGeod pos );\n\n    \/**\n     * Set the orientation of the sound source\n     *\/\n    void set_orientation( SGQuatd ori );\n\n    \/**\n     * Set the relative direction of the sound source, both for direction\n     * and audio cut-off angles.\n     *\/\n    void set_direction( SGVec3d dir );\n\n    \/**\n     * Define the audio cone parameters for directional audio\n     *\/\n    inline void set_audio_cone( float inner, float outer, float gain ) {\n        _inner_angle = inner;\n        _outer_angle = outer;\n        _outer_gain = gain;\n        _static_changed = true;\n    }\n\n    \/**\n     * Get the orientation of the sound source, the inner or outer angle\n     * or outer gain.\n     *\/\n    float *get_orientation() { return _orivec.data(); }\n    float get_innerangle() { return _inner_angle; }\n    float get_outerangle() { return _outer_angle; }\n    float get_outergain() { return _outer_gain; }\n\n    \/**\n     * Set velocity of the sound source (uses same coordinate system as opengl)\n     *\/\n    inline void set_velocity( SGVec3d& vel ) {\n        _velocity = vel;\n        _changed = true;\n    }\n\n    \/**\n     * Get velocity of the sound source (uses same coordinate system as opengl)\n     *\/\n    inline float *get_velocity() { return toVec3f(_velocity).data(); }\n\n\n    \/**\n     * Set reference distance of sound (the distance where the gain\n     * will be half.)\n     *\/\n    inline void set_reference_dist( float dist ) {\n        _reference_dist = dist; _static_changed = true;\n    }\n\n    \/**\n     * Get reference distance of sound (the distance where the gain\n     * will be half.)\n     *\/\n    inline float get_reference_dist() { return _reference_dist; }\n\n\n    \/**\n     * Set maximum distance of sound (the distance where the sound is\n     * no longer audible.\n     *\/\n    void set_max_dist( float dist ) {\n        _max_dist = dist; _static_changed = true;\n    }\n\n    \/**\n     * Get maximum istance of sound (the distance where the sound is\n     * no longer audible.\n     *\/\n    inline float get_max_dist() { return _max_dist; }\n\n    \/**\n     * Get the name of this sample\n     *\/\n    inline std::string get_sample_name() { return _sample_name; }\n};\n\n\n#endif \/\/ _SG_SAMPLE_HXX\n\n\n<commit_msg>_data is not an array of pointer<commit_after>\/\/ sample.hxx -- Sound sample encapsulation class\n\/\/ \n\/\/ Written by Curtis Olson, started April 2004.\n\/\/\n\/\/ Copyright (C) 2004  Curtis L. Olson - http:\/\/www.flightgear.org\/~curt\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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.\n\/\/\n\/\/ $Id$\n\n\/**\n * \\file sample.hxx\n * Provides a sound sample encapsulation\n *\/\n\n#ifndef _SG_SAMPLE_HXX\n#define _SG_SAMPLE_HXX 1\n\n#ifndef __cplusplus\n# error This library requires C++\n#endif\n\n#include <string>\n\n#include <simgear\/compiler.h>\n#include <simgear\/debug\/logstream.hxx>\n#include <simgear\/structure\/SGReferenced.hxx>\n#include <simgear\/structure\/SGSharedPtr.hxx>\n#include <simgear\/math\/SGMath.hxx>\n\n\/\/ #include <plib\/sg.h>\n\n\/**\n * manages everything we need to know for an individual sound sample\n *\/\n\nclass SGSoundSample : public SGReferenced {\n\nprivate:\n\n    \/\/ Position of the source sound.\n    SGVec3d _absolute_pos;\t\/\/ absolute position\n    SGVec3d _relative_pos;\t\/\/ position relative to the base position\n    SGVec3d _direction;\t\t\/\/ orientation offset\n    SGVec3d _velocity;\t\t\/\/ Velocity of the source sound.\n\n    \/\/ The position and orientation of the sound\n    SGGeod _base_pos;\n    SGQuatd _orientation;\t\/\/ base orientation\n\n    std::string _sample_name;\n    unsigned char *_data;\n\n    \/\/ configuration values\n    int _format;\n    int _size;\n    int _freq;\n\n    \/\/ Buffers hold sound data.\n    bool _valid_buffer;\n    unsigned int _buffer;\n\n    \/\/ Sources are points emitting sound.\n    bool _valid_source;\n    unsigned int _source;\n\n    \/\/ The orientation of the sound (direction and cut-off angles)\n    float _inner_angle;\n    float _outer_angle;\n    float _outer_gain;\n\n    float _pitch;\n    float _volume;\n    float _master_volume;\n    float _reference_dist;\n    float _max_dist;\n    bool _loop;\n\n    bool _playing;\n    bool _changed;\n    bool _static_changed;\n    bool _is_file;\n\n    SGVec3f _orivec;\n    void update_absolute_position();\n\npublic:\n\n     \/**\n      * Empty constructor, can be used to read data to the systems\n      * memory and not to the driver.\n      *\/\n    SGSoundSample();\n\n    \/**\n     * Constructor\n     * @param path Path name to sound\n     * @param file File name of sound\n       should usually be true unless you want to manipulate the data\n       later.)\n     *\/\n    SGSoundSample( const char *path, const char *file );\n\n    \/**\n     * Constructor.\n     * @param _data Pointer to a memory buffer containing the sample data\n       the application is responsible for freeing the buffer data.\n     * @param len Byte length of array\n     * @param _freq Frequency of the provided data (bytes per second)\n       should usually be true unless you want to manipulate the data\n       later.)\n     *\/\n    SGSoundSample( unsigned char *data, int len, int freq, int format = AL_FORMAT_MONO8 );\n\n    ~SGSoundSample ();\n\n    \/**\n     * detect wheter the sample holds the information of a sound file\n     *\/\n    inline bool is_file() const { return _is_file; }\n\n    \/**\n     * Test whether this sample has a changed configuration since the last\n     * call. (Calling this function resets the value).\n     *\/\n    inline bool has_changed() {\n        bool b = _changed; _changed = false; return b;\n    }\n\n    inline bool has_static_data_changed() {\n        bool b = _static_changed; _static_changed = false; return b;\n    }\n\n\n    \/**\n     * Start playing this sample.\n     *\n     * @param _loop Define whether the sound should be played in a loop.\n     *\/\n    inline void play( bool loop ) {\n        _playing = true; _loop = loop; _changed = true;\n    }\n\n    \/**\n     * Return if the sample is looping or not.\n     *\/\n    inline bool get_looping() { return _loop; }\n\n    \/**\n     * Stop playing this sample.\n     *\n     * @param sched A pointer to the appropriate scheduler.\n     *\/\n    inline void stop() {\n        _playing = false; _changed = true;\n    }\n\n    \/**\n     * Play this sample once.\n     * @see #play\n     *\/\n    inline void play_once() { play(false); }\n\n    \/** \n     * Play this sample looped.\n     * @see #play\n     *\/\n    inline void play_looped() { play(true); }\n\n    \/**\n     * Test if a sample is currently playing.\n     * @return true if is is playing, false otherwise.\n     *\/\n    inline bool is_playing() { return _playing; }\n\n    \/**\n     * set the data associated with this sample\n     *\/\n    inline void set_data( unsigned char* data ) {\n        _data = data;\n    }\n\n    \/**\n     * @return the data associated with this sample\n     *\/\n    inline void* get_data() const { return _data; }\n\n    \/**\n     * free the data associated with this sample\n     *\/\n    inline void free_data() {\n        if (_data != NULL) { delete _data; _data = NULL; }\n    }\n\n    \/**\n     * set the source id of this source\n     *\/\n    inline void set_source(unsigned int s) {\n        _source = s; _valid_source = true; _changed = true;\n    }\n\n    \/**\n     * get the source id of this source\n     *\/\n    inline unsigned int get_source() { return _source; }\n\n    \/**\n     * detect wheter the source id of the sample is valid\n     *\/\n    inline bool is_valid_source() const { return _valid_source; }\n\n    \/**\n     * set the source id of the sample to invalid.\n     *\/\n    inline void no_valid_source() {\n        _valid_source = false;\n    }\n\n    \/**\n     * set the buffer id of this source\n     *\/\n    inline void set_buffer(unsigned int b) {\n        _buffer = b; _valid_buffer = true; _changed = true;\n    } \n\n    \/**\n     * get the buffer id of this source\n     *\/\n    inline unsigned int get_buffer() { return _buffer; }\n\n    \/**\n     * detect wheter the source id of the sample is valid\n     *\/\n    inline bool is_valid_buffer() const { return _valid_buffer; }\n\n    \/**\n     * set the source id of the sample to invalid.\n     *\/\n    inline void no_valid_buffer() {\n        _valid_buffer = false;\n    }\n\n    \/**\n     * Get the current pitch setting of this sample.\n     *\/\n    inline float get_pitch() { return _pitch; }\n\n    \/**\n     * Set the pitch of this sample.\n     *\/\n    inline void set_pitch( float p ) {\n        _pitch = p; _changed = true;\n    }\n\n    \/**\n     * Get the current volume setting of this sample.\n     *\/\n    inline float get_volume() { return _volume * _master_volume; }\n\n    \/**\n     * Set the master (sampel group) volume of this sample.\n     *\/\n    inline void set_master_volume( float v ) {\n        _master_volume = v; _changed = true;\n    }\n\n    \/**\n     * Set the volume of this sample.\n     *\/\n    inline void set_volume( float v ) {\n        _volume = v; _changed = true;\n    }\n\n    \/**\n     * Set the format of the sounds sample\n     *\/\n    inline void set_format( int format ) {\n        _format = format;\n    }\n\n    \/**\n     * Returns the format of the sounds sample\n     *\/\n    inline int get_format() { return _format; }\n\n\n    \/**\n     * Set the frequency of the sounds sample\n     *\/\n    inline void set_frequency( int freq ) {\n        _freq = freq; _changed = true;\n    }\n\n    \/**\n     * Returns the frequency of the sounds sample\n     *\/\n    inline int get_frequency() { return _freq; }\n\n    \/**\n     * Returns the size of the sounds sample\n     *\/\n    inline void set_size( int size ) {\n        _size = size;\n    }\n\n    \/**\n     * Returns the size of the sounds sample\n     *\/\n    inline int get_size() const { return _size; }\n\n    \/**\n     * Set position of the sound source (uses same coordinate system as opengl)\n     *\/\n    void set_relative_position( SGVec3f pos );\n\n    \/**\n     * Get position of the sound source (uses same coordinate system as opengl)\n     *\/\n    inline float *get_position() const { return toVec3f(_absolute_pos).data(); }\n\n    \/**\n     * Set the position of the sound source\n     *\/\n    void set_position( SGGeod pos );\n\n    \/**\n     * Set the orientation of the sound source\n     *\/\n    void set_orientation( SGQuatd ori );\n\n    \/**\n     * Set the relative direction of the sound source, both for direction\n     * and audio cut-off angles.\n     *\/\n    void set_direction( SGVec3d dir );\n\n    \/**\n     * Define the audio cone parameters for directional audio\n     *\/\n    inline void set_audio_cone( float inner, float outer, float gain ) {\n        _inner_angle = inner;\n        _outer_angle = outer;\n        _outer_gain = gain;\n        _static_changed = true;\n    }\n\n    \/**\n     * Get the orientation of the sound source, the inner or outer angle\n     * or outer gain.\n     *\/\n    float *get_orientation() { return _orivec.data(); }\n    float get_innerangle() { return _inner_angle; }\n    float get_outerangle() { return _outer_angle; }\n    float get_outergain() { return _outer_gain; }\n\n    \/**\n     * Set velocity of the sound source (uses same coordinate system as opengl)\n     *\/\n    inline void set_velocity( SGVec3d& vel ) {\n        _velocity = vel;\n        _changed = true;\n    }\n\n    \/**\n     * Get velocity of the sound source (uses same coordinate system as opengl)\n     *\/\n    inline float *get_velocity() { return toVec3f(_velocity).data(); }\n\n\n    \/**\n     * Set reference distance of sound (the distance where the gain\n     * will be half.)\n     *\/\n    inline void set_reference_dist( float dist ) {\n        _reference_dist = dist; _static_changed = true;\n    }\n\n    \/**\n     * Get reference distance of sound (the distance where the gain\n     * will be half.)\n     *\/\n    inline float get_reference_dist() { return _reference_dist; }\n\n\n    \/**\n     * Set maximum distance of sound (the distance where the sound is\n     * no longer audible.\n     *\/\n    void set_max_dist( float dist ) {\n        _max_dist = dist; _static_changed = true;\n    }\n\n    \/**\n     * Get maximum istance of sound (the distance where the sound is\n     * no longer audible.\n     *\/\n    inline float get_max_dist() { return _max_dist; }\n\n    \/**\n     * Get the name of this sample\n     *\/\n    inline std::string get_sample_name() { return _sample_name; }\n};\n\n\n#endif \/\/ _SG_SAMPLE_HXX\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file    SqlUtil.cc\n *  \\brief   Implementations of SQL-related utility functions.\n *  \\author  Dr. Johannes Ruscheinski\n *  \\author  Artur Kedzierski\n *  \\author  Dr. Gordon W. Paynter\n *\/\n\n\/*\n *  \\copyright 2002-2009 Project iVia.\n *  \\copyright 2002-2009 The Regents of The University of California.\n *  \\copyright 2016,2017,2019 Universitätsbibliothek Tübingen.\n *\n *  This file is part of the libiViaCore package.\n *\n *  The libiViaCore package is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public License as\n *  published by the Free Software Foundation; either version 2 of the License,\n *  or (at your option) any later version.\n *\n *  libiViaCore is distributed in the hope that it 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 libiViaCore; if not, write to the Free Software Foundation, Inc.,\n *  59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n *\/\n\n#include \"SqlUtil.h\"\n#include <algorithm>\n#include <stdexcept>\n#include <cstdio>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"StringUtil.h\"\n#include \"TimeUtil.h\"\n#include \"util.h\"\n\n\nnamespace SqlUtil {\n\n\nconst std::string DATETIME_RANGE_MIN(\"1000-01-01 00:00:00\");\nconst std::string DATETIME_RANGE_MAX(\"9999-12-31 23:59:59\");\n\n\n\/\/ reference count of open transactions\nstd::map<DbConnection *, TransactionGuard::Status> TransactionGuard::connection_status_;\n\n\nTransactionGuard::TransactionGuard(DbConnection * const db_connection, const IsolationLevel level)\n    : db_connection_(db_connection)\n{\n    std::string begin(\"START TRANSACTION\");\n\n    if (connection_status_.find(db_connection) == connection_status_.end()) {\n        if (level == READ_COMMITTED)\n            begin += \" WITH CONSISTENT SNAPSHOT\";\n        db_connection_->queryOrDie(begin);\n        Status status(level);\n        connection_status_[db_connection] = status;\n    } else {\n        connection_status_[db_connection].reference_count_++;\n        if (connection_status_[db_connection].level_ != level)\n            logger->warning(\"in TransactionGuard::TransactionGuard: Inconsistent isolation level requested!\");\n    }\n}\n\n\nvoid TransactionGuard::rollback() {\n    connection_status_[db_connection_].rolled_back_ = true;\n}\n\n\nTransactionGuard::~TransactionGuard() {\n    if (connection_status_[db_connection_].reference_count_ == 1) {\n        if (connection_status_[db_connection_].rolled_back_)\n            db_connection_->queryOrDie(\"ROLLBACK\");\n        else\n            db_connection_->queryOrDie(\"COMMIT\");\n    } else\n        --connection_status_[db_connection_].reference_count_;\n}\n\n\nstd::string TruncateToVarCharMaxIndexLength(const std::string &s) {\n    auto truncated(s);\n    if (truncated.length() > VARCHAR_UTF8_MAX_INDEX_LENGTH)\n        truncated.erase(VARCHAR_UTF8_MAX_INDEX_LENGTH);\n\n    return truncated;\n}\n\n\n\/\/ EscapeBlob -- Escape characters in a binary string so it can be used as a MySQL BLOB.\n\/\/\nstd::string &EscapeBlob(std::string * const s) {\n    std::string encoded_string;\n    encoded_string.reserve(s->size() * 2);\n\n    for (const char ch : *s) {\n        if (unlikely(ch == '\\'' or ch == '\"' or ch == '\\\\'))\n            encoded_string += '\\\\';\n        encoded_string += ch;\n    }\n\n    std::swap(*s, encoded_string);\n    return *s;\n}\n\n\nstd::string Unescape(std::string * const s) {\n    std::string decoded_string;\n    decoded_string.reserve(s->size());\n    for (auto ch(s->cbegin()); ch != s->cend(); ++ch) {\n        if (likely(*ch != '\\\\'))\n            decoded_string += *ch;\n        else {\n            ++ch;\n            if (unlikely(ch == s->cend()))\n                throw std::runtime_error(\"SqlUtil::Unescape: unexpected end of encoded string!\");\n\n            switch (*ch) {\n            case '\\'':\n                decoded_string += '\\'';\n                break;\n            case '\"':\n                decoded_string += '\"';\n                break;\n            case 'b':\n                decoded_string += '\\b';\n                break;\n            case 'n':\n                decoded_string += '\\n';\n                break;\n            case 'r':\n                decoded_string += '\\r';\n                break;\n            case 't':\n                decoded_string += '\\t';\n                break;\n            case '\\\\':\n                decoded_string += '\\\\';\n                break;\n            default:\n                throw std::runtime_error(\"SqlUtil::Unescape: improperly encoded string! (ch == \"\n                                         + StringUtil::CStyleEscape(*ch) + \")\");\n            }\n        }\n    }\n\n    return (*s = decoded_string);\n}\n\n\ntm DatetimeToTm(const std::string &datetime) {\n    if (not IsValidDatetime(datetime))\n        throw std::runtime_error(\"in SqlUtil::DateToTm: invalid \\\"datetime\\\" argument \\\"\" + datetime + \"\\\"!\");\n\n    \/\/ current time format is YYYY-MM-DD hh:mm:ss\n    tm time_struct;\n    time_struct.tm_year  = std::atol(datetime.substr(0, 4).c_str()) - 1900;\n    time_struct.tm_mon   = std::atol(datetime.substr(5, 2).c_str()) - 1;\n    time_struct.tm_mday  = std::atol(datetime.substr(8, 2).c_str());\n    time_struct.tm_hour  = std::atol(datetime.substr(11, 2).c_str());\n    time_struct.tm_min   = std::atol(datetime.substr(14, 2).c_str());\n    time_struct.tm_sec   = std::atol(datetime.substr(17, 2).c_str());\n    time_struct.tm_isdst = -1; \/\/ Don't *ever* change this!!\n\n    return time_struct;\n}\n\n\ntime_t DatetimeToTimeT(const std::string &datetime) {\n    tm time_struct(DatetimeToTm(datetime));\n    errno = 0;\n    const time_t ret_val(::mktime(&time_struct));\n    if (unlikely(errno != 0))\n        return TimeUtil::BAD_TIME_T;\n    return ret_val;\n}\n\n\nstd::string TmToDatetime(const struct tm &time_struct) {\n    char sql_datetime[30 + 1];\n    std::sprintf(sql_datetime, \"%04u-%02u-%02u %02u:%02u:%02u\", time_struct.tm_year + 1900,\n                 time_struct.tm_mon + 1, time_struct.tm_mday, time_struct.tm_hour,\n                 time_struct.tm_min, time_struct.tm_sec);\n\n    return sql_datetime;\n}\n\n\nstd::string TimeTToDatetime(const time_t time) {\n    return TmToDatetime(*::gmtime(&time));\n}\n\n\nbool IsValidDatetime(const std::string &datetime) {\n    if (datetime.length() == 10) {\n        \/\/ Presumably \"YYYY-MM-DD\".\n\n        unsigned year, month, day;\n        if (std::sscanf(datetime.c_str(), \"%4u-%2u-%2u\", &year, &month, &day) != 3)\n            return false;\n\n        return (year >= 1000 and year <= 9999) and (month >= 1 and month <= 12) and\n            (day >= 1 and day <= 365);\n    } else if (datetime.length() == 19) {\n        \/\/ Presumably \"YYYY-MM-DD hh:mm:ss\".\n\n        unsigned year, month, day, hour, minute, second;\n        if (std::sscanf(datetime.c_str(), \"%4u-%2u-%2u %2u:%2u:%2u\", &year, &month, &day, &hour,\n                        &minute, &second) != 6)\n            return false;\n\n        return (year >= 1000 and year <= 9999) and (month >= 1 and month <= 12) and\n            (day >= 1 and day <= 365) and hour <= 23 and minute <= 59 and second <= 61;\n    } else\n        return false;\n}\n\n\nstd::string GetDatetime(const long offset) {\n    time_t now(std::time(NULL) + offset);\n    char buf[20 + 1];\n    std::strftime(buf, sizeof(buf), \"%F %T\", std::localtime(&now));\n\n    return buf;\n}\n\n\nstd::set<std::string> GetColumnNames(DbConnection * const connection, const std::string &table_name) {\n    const std::string SHOW_COUMNS_STMT(\"SHOW COLUMNS FROM `\" + table_name + \"`;\");\n    if (not connection->query(SHOW_COUMNS_STMT))\n        throw std::runtime_error(\"in SqlUtil::GetColumnNames: Show columns failed: \" + SHOW_COUMNS_STMT\n                                 + \" (\" + connection->getLastErrorMessage() + \")\");\n    DbResultSet result_set(connection->getLastResultSet());\n    std::set<std::string> column_names;\n    while (const DbRow row = result_set.getNextRow())\n        column_names.insert(row[\"Field\"]);\n\n    return column_names;\n}\n\n\nunsigned GetTableSize(DbConnection * const connection, const std::string &table_name) {\n    connection->queryOrDie(\"SELECT COUNT(*) FROM \" + table_name);\n    DbResultSet result_set(connection->getLastResultSet());\n    const DbRow first_row(result_set.getNextRow());\n\n    return StringUtil::ToUnsigned(first_row[0]);\n}\n\n\nThreadSafetyGuard::ThreadSafetyGuard(const ThreadType invoker_thread)\n    : invoker_thread_(invoker_thread)\n{\n    switch (invoker_thread_) {\n    case ThreadType::MAIN_THREAD:\n        if (::mysql_library_init(0, nullptr, nullptr))\n            LOG_ERROR(\"mysql_library_init failed\");\n        break;\n    case ThreadType::WORKER_THREAD:\n        if (::mysql_thread_init())\n            LOG_ERROR(\"mysql_thread_init failed in worker thread \" + std::to_string(::pthread_self()));\n        break;\n    default:\n        LOG_ERROR(\"unknown invoker thread \" + std::to_string(invoker_thread_));\n    }\n}\n\n\nThreadSafetyGuard::~ThreadSafetyGuard() {\n    switch (invoker_thread_) {\n    case ThreadType::MAIN_THREAD:\n        ::mysql_library_end();\n        break;\n    case ThreadType::WORKER_THREAD:\n        ::mysql_thread_end();\n        break;\n    default:\n        LOG_ERROR(\"unknown invoker thread \" + std::to_string(invoker_thread_));\n    }\n}\n\n\n} \/\/ namespace SqlUtil\n<commit_msg>SqlUtil.cc: Fixed wrong function name in error message<commit_after>\/** \\file    SqlUtil.cc\n *  \\brief   Implementations of SQL-related utility functions.\n *  \\author  Dr. Johannes Ruscheinski\n *  \\author  Artur Kedzierski\n *  \\author  Dr. Gordon W. Paynter\n *\/\n\n\/*\n *  \\copyright 2002-2009 Project iVia.\n *  \\copyright 2002-2009 The Regents of The University of California.\n *  \\copyright 2016,2017,2019 Universitätsbibliothek Tübingen.\n *\n *  This file is part of the libiViaCore package.\n *\n *  The libiViaCore package is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public License as\n *  published by the Free Software Foundation; either version 2 of the License,\n *  or (at your option) any later version.\n *\n *  libiViaCore is distributed in the hope that it 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 libiViaCore; if not, write to the Free Software Foundation, Inc.,\n *  59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n *\/\n\n#include \"SqlUtil.h\"\n#include <algorithm>\n#include <stdexcept>\n#include <cstdio>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"StringUtil.h\"\n#include \"TimeUtil.h\"\n#include \"util.h\"\n\n\nnamespace SqlUtil {\n\n\nconst std::string DATETIME_RANGE_MIN(\"1000-01-01 00:00:00\");\nconst std::string DATETIME_RANGE_MAX(\"9999-12-31 23:59:59\");\n\n\n\/\/ reference count of open transactions\nstd::map<DbConnection *, TransactionGuard::Status> TransactionGuard::connection_status_;\n\n\nTransactionGuard::TransactionGuard(DbConnection * const db_connection, const IsolationLevel level)\n    : db_connection_(db_connection)\n{\n    std::string begin(\"START TRANSACTION\");\n\n    if (connection_status_.find(db_connection) == connection_status_.end()) {\n        if (level == READ_COMMITTED)\n            begin += \" WITH CONSISTENT SNAPSHOT\";\n        db_connection_->queryOrDie(begin);\n        Status status(level);\n        connection_status_[db_connection] = status;\n    } else {\n        connection_status_[db_connection].reference_count_++;\n        if (connection_status_[db_connection].level_ != level)\n            logger->warning(\"in TransactionGuard::TransactionGuard: Inconsistent isolation level requested!\");\n    }\n}\n\n\nvoid TransactionGuard::rollback() {\n    connection_status_[db_connection_].rolled_back_ = true;\n}\n\n\nTransactionGuard::~TransactionGuard() {\n    if (connection_status_[db_connection_].reference_count_ == 1) {\n        if (connection_status_[db_connection_].rolled_back_)\n            db_connection_->queryOrDie(\"ROLLBACK\");\n        else\n            db_connection_->queryOrDie(\"COMMIT\");\n    } else\n        --connection_status_[db_connection_].reference_count_;\n}\n\n\nstd::string TruncateToVarCharMaxIndexLength(const std::string &s) {\n    auto truncated(s);\n    if (truncated.length() > VARCHAR_UTF8_MAX_INDEX_LENGTH)\n        truncated.erase(VARCHAR_UTF8_MAX_INDEX_LENGTH);\n\n    return truncated;\n}\n\n\n\/\/ EscapeBlob -- Escape characters in a binary string so it can be used as a MySQL BLOB.\n\/\/\nstd::string &EscapeBlob(std::string * const s) {\n    std::string encoded_string;\n    encoded_string.reserve(s->size() * 2);\n\n    for (const char ch : *s) {\n        if (unlikely(ch == '\\'' or ch == '\"' or ch == '\\\\'))\n            encoded_string += '\\\\';\n        encoded_string += ch;\n    }\n\n    std::swap(*s, encoded_string);\n    return *s;\n}\n\n\nstd::string Unescape(std::string * const s) {\n    std::string decoded_string;\n    decoded_string.reserve(s->size());\n    for (auto ch(s->cbegin()); ch != s->cend(); ++ch) {\n        if (likely(*ch != '\\\\'))\n            decoded_string += *ch;\n        else {\n            ++ch;\n            if (unlikely(ch == s->cend()))\n                throw std::runtime_error(\"SqlUtil::Unescape: unexpected end of encoded string!\");\n\n            switch (*ch) {\n            case '\\'':\n                decoded_string += '\\'';\n                break;\n            case '\"':\n                decoded_string += '\"';\n                break;\n            case 'b':\n                decoded_string += '\\b';\n                break;\n            case 'n':\n                decoded_string += '\\n';\n                break;\n            case 'r':\n                decoded_string += '\\r';\n                break;\n            case 't':\n                decoded_string += '\\t';\n                break;\n            case '\\\\':\n                decoded_string += '\\\\';\n                break;\n            default:\n                throw std::runtime_error(\"SqlUtil::Unescape: improperly encoded string! (ch == \"\n                                         + StringUtil::CStyleEscape(*ch) + \")\");\n            }\n        }\n    }\n\n    return (*s = decoded_string);\n}\n\n\ntm DatetimeToTm(const std::string &datetime) {\n    if (not IsValidDatetime(datetime))\n        throw std::runtime_error(\"in SqlUtil::DatetimeToTm: invalid \\\"datetime\\\" argument \\\"\" + datetime + \"\\\"!\");\n\n    \/\/ current time format is YYYY-MM-DD hh:mm:ss\n    tm time_struct;\n    time_struct.tm_year  = std::atol(datetime.substr(0, 4).c_str()) - 1900;\n    time_struct.tm_mon   = std::atol(datetime.substr(5, 2).c_str()) - 1;\n    time_struct.tm_mday  = std::atol(datetime.substr(8, 2).c_str());\n    time_struct.tm_hour  = std::atol(datetime.substr(11, 2).c_str());\n    time_struct.tm_min   = std::atol(datetime.substr(14, 2).c_str());\n    time_struct.tm_sec   = std::atol(datetime.substr(17, 2).c_str());\n    time_struct.tm_isdst = -1; \/\/ Don't *ever* change this!!\n\n    return time_struct;\n}\n\n\ntime_t DatetimeToTimeT(const std::string &datetime) {\n    tm time_struct(DatetimeToTm(datetime));\n    errno = 0;\n    const time_t ret_val(::mktime(&time_struct));\n    if (unlikely(errno != 0))\n        return TimeUtil::BAD_TIME_T;\n    return ret_val;\n}\n\n\nstd::string TmToDatetime(const struct tm &time_struct) {\n    char sql_datetime[30 + 1];\n    std::sprintf(sql_datetime, \"%04u-%02u-%02u %02u:%02u:%02u\", time_struct.tm_year + 1900,\n                 time_struct.tm_mon + 1, time_struct.tm_mday, time_struct.tm_hour,\n                 time_struct.tm_min, time_struct.tm_sec);\n\n    return sql_datetime;\n}\n\n\nstd::string TimeTToDatetime(const time_t time) {\n    return TmToDatetime(*::gmtime(&time));\n}\n\n\nbool IsValidDatetime(const std::string &datetime) {\n    if (datetime.length() == 10) {\n        \/\/ Presumably \"YYYY-MM-DD\".\n\n        unsigned year, month, day;\n        if (std::sscanf(datetime.c_str(), \"%4u-%2u-%2u\", &year, &month, &day) != 3)\n            return false;\n\n        return (year >= 1000 and year <= 9999) and (month >= 1 and month <= 12) and\n            (day >= 1 and day <= 365);\n    } else if (datetime.length() == 19) {\n        \/\/ Presumably \"YYYY-MM-DD hh:mm:ss\".\n\n        unsigned year, month, day, hour, minute, second;\n        if (std::sscanf(datetime.c_str(), \"%4u-%2u-%2u %2u:%2u:%2u\", &year, &month, &day, &hour,\n                        &minute, &second) != 6)\n            return false;\n\n        return (year >= 1000 and year <= 9999) and (month >= 1 and month <= 12) and\n            (day >= 1 and day <= 365) and hour <= 23 and minute <= 59 and second <= 61;\n    } else\n        return false;\n}\n\n\nstd::string GetDatetime(const long offset) {\n    time_t now(std::time(NULL) + offset);\n    char buf[20 + 1];\n    std::strftime(buf, sizeof(buf), \"%F %T\", std::localtime(&now));\n\n    return buf;\n}\n\n\nstd::set<std::string> GetColumnNames(DbConnection * const connection, const std::string &table_name) {\n    const std::string SHOW_COUMNS_STMT(\"SHOW COLUMNS FROM `\" + table_name + \"`;\");\n    if (not connection->query(SHOW_COUMNS_STMT))\n        throw std::runtime_error(\"in SqlUtil::GetColumnNames: Show columns failed: \" + SHOW_COUMNS_STMT\n                                 + \" (\" + connection->getLastErrorMessage() + \")\");\n    DbResultSet result_set(connection->getLastResultSet());\n    std::set<std::string> column_names;\n    while (const DbRow row = result_set.getNextRow())\n        column_names.insert(row[\"Field\"]);\n\n    return column_names;\n}\n\n\nunsigned GetTableSize(DbConnection * const connection, const std::string &table_name) {\n    connection->queryOrDie(\"SELECT COUNT(*) FROM \" + table_name);\n    DbResultSet result_set(connection->getLastResultSet());\n    const DbRow first_row(result_set.getNextRow());\n\n    return StringUtil::ToUnsigned(first_row[0]);\n}\n\n\nThreadSafetyGuard::ThreadSafetyGuard(const ThreadType invoker_thread)\n    : invoker_thread_(invoker_thread)\n{\n    switch (invoker_thread_) {\n    case ThreadType::MAIN_THREAD:\n        if (::mysql_library_init(0, nullptr, nullptr))\n            LOG_ERROR(\"mysql_library_init failed\");\n        break;\n    case ThreadType::WORKER_THREAD:\n        if (::mysql_thread_init())\n            LOG_ERROR(\"mysql_thread_init failed in worker thread \" + std::to_string(::pthread_self()));\n        break;\n    default:\n        LOG_ERROR(\"unknown invoker thread \" + std::to_string(invoker_thread_));\n    }\n}\n\n\nThreadSafetyGuard::~ThreadSafetyGuard() {\n    switch (invoker_thread_) {\n    case ThreadType::MAIN_THREAD:\n        ::mysql_library_end();\n        break;\n    case ThreadType::WORKER_THREAD:\n        ::mysql_thread_end();\n        break;\n    default:\n        LOG_ERROR(\"unknown invoker thread \" + std::to_string(invoker_thread_));\n    }\n}\n\n\n} \/\/ namespace SqlUtil\n<|endoftext|>"}
{"text":"<commit_before>#include <Halide.h>\nusing namespace Halide;\n\n#include <iostream>\n\nnamespace Halide\n{\n\textern void testArray(Func f);\n}\n\nusing namespace std;\nint main(int argc, char **argv) {\n\n    int width = 32;\n\n    Func f(\"f\"), g(\"g\"), h(\"h\"); Var x(\"x\"), y(\"y\");\n\n    Uniform<int> offset(\"offset\");\n    offset = 666;\n\n    Image<int> in(width+4);\n    for (int i=0; i < in.width(); i++) in(i) = rand() \/ 2;\n    \n    h(x) = in(clamp(x, 0, in.width()));\n    g(x) = h(x-1 + offset - *(int*)offset.data()) + h(x+1 + offset - *(int*)offset.data());\n    f(x, y) = (g(x-1) + g(x+1)) + y;\n\n    \/\/ Rehydrate ff by serializing then deserializing the pipeline out through f\n    Func ff = rehydrate(f.serialize(), f.name());\n\n    \/\/ reassign the uniform\/image inputs\n    ff.uniforms()[0].set(*(int*)offset.data());\n    ff.uniformImages()[0] = in;\n\n    vector<Func> funcs = f.funcs();\n    set_union(funcs, f.transitiveFuncs());\n    for (int i = 0; i < funcs.size(); i++) {\n        funcs[i].root();\n    }\n    funcs = ff.funcs();\n    set_union(funcs, ff.transitiveFuncs());\n    for (int i = 0; i < funcs.size(); i++) {\n        funcs[i].root();\n    }\n\n    if (use_gpu()) {\n        f.cudaTile(x, y, 16, 16);\n        ff.cudaTile(x, y, 16, 16);\n    } else {\n        Var xi(\"xi\"), yi(\"yi\");\n        f.tile(x, y, xi, yi, 16, 16);\n        ff.tile(x, y, xi, yi, 16, 16);\n    }\n    \n    Image<int> out = ff.realize(width, width);\n    Image<int> ref = f.realize(width, width);\n\n    for (int y = 0; y < width; y++) {\n        for (int x = 0; x < width; x++) {\n            if (out(x, y) != ref(x, y)) {\n                printf(\"out(%d, %d) = %d instead of %d\\n\", x, y, out(x, y), ref(x, y));\n                return -1;\n            }\n        }\n    }\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n<commit_msg>Removed rehydrate test. Serialization will come later.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2016, the Cap authors.\n *\n * This file is subject to the Modified BSD License and may not be distributed\n * without copyright and license information. Please refer to the file LICENSE\n * for the text and further information on this license.\n *\/\n\n#define BOOST_TEST_MODULE Timer\n\n#include \"main.cc\"\n\n#include <cap\/timer.h>\n#include <boost\/test\/unit_test.hpp>\n#include <chrono>\n#include <fstream>\n#include <thread>\n\nnamespace cap\n{\nBOOST_AUTO_TEST_CASE(test_timer)\n{\n  unsigned int const tolerance = 10;\n  Timer timer(boost::mpi::communicator(), \"test\");\n\n  timer.start();\n  std::this_thread::sleep_for(std::chrono::milliseconds(200));\n  timer.stop();\n  boost::chrono::process_cpu_clock::duration duration =\n      timer.get_elapsed_time();\n  boost::chrono::milliseconds ms =\n      boost::chrono::duration_cast<boost::chrono::milliseconds>(duration);\n  BOOST_TEST(std::abs(ms.count() - 200) < tolerance);\n\n  timer.start();\n  std::this_thread::sleep_for(std::chrono::milliseconds(200));\n  timer.stop();\n  duration = timer.get_elapsed_time();\n  ms = boost::chrono::duration_cast<boost::chrono::milliseconds>(duration);\n  BOOST_TEST(std::abs(ms.count() - 400) < 2 * tolerance);\n\n  timer.reset();\n  timer.start();\n  std::this_thread::sleep_for(std::chrono::milliseconds(200));\n  timer.stop();\n  duration = timer.get_elapsed_time();\n  ms = boost::chrono::duration_cast<boost::chrono::milliseconds>(duration);\n  BOOST_TEST(std::abs(ms.count() - 200) < tolerance);\n}\n}\n<commit_msg>Relax tolerance in test_timer.<commit_after>\/* Copyright (c) 2016, the Cap authors.\n *\n * This file is subject to the Modified BSD License and may not be distributed\n * without copyright and license information. Please refer to the file LICENSE\n * for the text and further information on this license.\n *\/\n\n#define BOOST_TEST_MODULE Timer\n\n#include \"main.cc\"\n\n#include <cap\/timer.h>\n#include <boost\/test\/unit_test.hpp>\n#include <chrono>\n#include <fstream>\n#include <thread>\n\nnamespace cap\n{\nBOOST_AUTO_TEST_CASE(test_timer)\n{\n  unsigned int const tolerance = 15;\n  Timer timer(boost::mpi::communicator(), \"test\");\n\n  timer.start();\n  std::this_thread::sleep_for(std::chrono::milliseconds(200));\n  timer.stop();\n  boost::chrono::process_cpu_clock::duration duration =\n      timer.get_elapsed_time();\n  boost::chrono::milliseconds ms =\n      boost::chrono::duration_cast<boost::chrono::milliseconds>(duration);\n  BOOST_TEST(std::abs(ms.count() - 200) < tolerance);\n\n  timer.start();\n  std::this_thread::sleep_for(std::chrono::milliseconds(200));\n  timer.stop();\n  duration = timer.get_elapsed_time();\n  ms = boost::chrono::duration_cast<boost::chrono::milliseconds>(duration);\n  BOOST_TEST(std::abs(ms.count() - 400) < 2 * tolerance);\n\n  timer.reset();\n  timer.start();\n  std::this_thread::sleep_for(std::chrono::milliseconds(200));\n  timer.stop();\n  duration = timer.get_elapsed_time();\n  ms = boost::chrono::duration_cast<boost::chrono::milliseconds>(duration);\n  BOOST_TEST(std::abs(ms.count() - 200) < tolerance);\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Backtracking.\n\/\/\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Backtracking\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Call_stack\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Recursion_(computer_science)\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Stack_(abstract_data_type)\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Queue_(abstract_data_type)\n\/\/\n\/\/ \"Backtracking\" is a technique used to find a solution (e.g. a password) when\n\/\/ validity constraints are known (e.g. the password can contain at most three\n\/\/ decimal digits).\n\/\/\n\/\/ The constraints will be used to reject sets of invalid candidates, thereby\n\/\/ speeding up the search process; the algorithm will skip generating candidates\n\/\/ which are known to not satisfy the constraints.\n\/\/\n\/\/ In contrast, a brute search algorithm will generate all possible candidates.\n\/\/ (A backtracking algorithm which never rejects any candidates becomes a brute\n\/\/ force algorithm.)\n\/\/\n\/\/ Backtracking algorithms are often implemented using recursion. This is done\n\/\/ because it simplifies the code in languages such as C, whereby the programmer\n\/\/ uses a (call) stack \"for free\" to hold the algorithm's state, i.e. the old\n\/\/ candidates to which the algorithm needs to \"backtrack\" in order to generate\n\/\/ their children candidates.\n\/\/\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ The basic C-style pseudocode for recursive backtracking is:\n\/\/\n\/\/  \/\/\/\n\/\/  \/\/\/ @brief Performs recursive backtracking.\n\/\/  \/\/\/ @param [in] c               Current candidate to be checked.\n\/\/  \/\/\/\n\/\/  void backtrack(candidate c)\n\/\/  {\n\/\/      \/\/\n\/\/      \/\/ c isn't a solution, and its children cannot\n\/\/      \/\/ become solutions either, so go no further\n\/\/      \/\/\n\/\/      if (reject(c))\n\/\/          return;\n\/\/\n\/\/      \/\/\n\/\/      \/\/ c is a solution!\n\/\/      \/\/\n\/\/      if (accept(c))\n\/\/          \/* use, save, print, etc. *\/ ;\n\/\/\n\/\/      \/\/\n\/\/      \/\/ does c have a child? i.e. \"001\" -> \"001a\"\n\/\/      \/\/ if not, c_child gets LINEAGE_IS_OVER\n\/\/      \/\/\n\/\/      \/\/ (in practice \"LINEAGE_IS_OVER\" can be any special value,\n\/\/      \/\/ such as NULL, that is interpreted as the lack of a child)\n\/\/      \/\/\n\/\/      candidate c_child = first_child(c);\n\/\/\n\/\/      while (c_child != LINEAGE_IS_OVER)\n\/\/      {\n\/\/          \/\/\n\/\/          \/\/ verify the child candidate, and its children, and so on...\n\/\/          \/\/\n\/\/          backtrack(c_child);\n\/\/\n\/\/          \/\/\n\/\/          \/\/ does c_child have a sibling? i.e. \"001a\" -> \"001b\"\n\/\/          \/\/ if not, c_child gets LINEAGE_IS_OVER\n\/\/          \/\/\n\/\/          c_child = next_child(c_child);\n\/\/      }\n\/\/  }\n\/\/\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ The basic C-style pseudocode for non-recursive backtracking is:\n\/\/\n\/\/  \/\/\/\n\/\/  \/\/\/ @brief Performs non-recursive backtracking.\n\/\/  \/\/\/ @param [in] start           Beginning candidate, to start with.\n\/\/  \/\/\/\n\/\/  void backtrack(candidate start)\n\/\/  {\n\/\/      \/\/\n\/\/      \/\/ because recursion isn't used anymore, we do not get a Call Stack\n\/\/      \/\/ in which to hold our current state \"for free\" so we must \"manually\"\n\/\/      \/\/ use a Stack container, that implements the following operations:\n\/\/      \/\/\n\/\/      \/\/  void        stack::push(candidate)  \/\/ adds a new \"c\" to the top\n\/\/      \/\/  void        stack::pop()            \/\/ removes the current top\n\/\/      \/\/  candidate   stack::top()            \/\/ returns the current top\n\/\/      \/\/  bool        stack::empty()          \/\/ returns if the stack is empty\n\/\/      \/\/\n\/\/      \/\/ note that the container isn't strictly required to be a Stack;\n\/\/      \/\/ for instance it could be a Queue but then the algorithm will need\n\/\/      \/\/ to be fine-tuned accordingly to the way a Queue works\n\/\/      \/\/\n\/\/      stack<candidate> stk;\n\/\/\n\/\/      stk.push(start);\n\/\/\n\/\/      while (!stk.empty())\n\/\/      {\n\/\/          if (reject(stk.top()))\n\/\/          {\n\/\/              stk.pop();\n\/\/              continue;\n\/\/          }\n\/\/\n\/\/          if (accept(stk.top()))\n\/\/              \/* use, save, print, etc. *\/ ;\n\/\/\n\/\/          candidate child = first_child(stk.top());\n\/\/\n\/\/          stk.pop();\n\/\/\n\/\/          if (child != LINEAGE_IS_OVER)\n\/\/          {\n\/\/              stk.push(child);\n\/\/\n\/\/              candidate sibling = next_child(stk.top());\n\/\/\n\/\/              while (sibling != LINEAGE_IS_OVER)\n\/\/              {\n\/\/                  stk.push(sibling);\n\/\/                  sibling = next_child(stk.top());\n\/\/              }\n\/\/          }\n\/\/      }\n\/\/  }\n\/\/\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ The following program will use backtracking to find all passwords with the\n\/\/ following example constraints:\n\/\/\n\/\/  (1) only lowercase latin letters (a-z) and decimal digits (0-9) are allowed\n\/\/  (2) there must be at least two digits in a password\n\/\/  (3) there must be at least one letter 'b' in a password\n\/\/  (4) the minimum length of a password is 3\n\/\/  (5) the maximum length of a password is 5\n\/\/\n\/\/ The program implements:\n\/\/\n\/\/  (a) traditional recursive backtrack:        backtrack_rec()\n\/\/  (b) stack-based non-recursive backtrack:    backtrack_stk()\n\/\/\n\n#include <algorithm>\n#include <cassert>\n#include <cstdlib>\n#include <iostream>\n#include <locale>\n#include <new>\n#include <stack>\n#include <stdexcept>\n#include <string>\n\nnamespace\n{\n\n\/\/\/\n\/\/\/ @brief Returns whether a candidate and its children should be rejected.\n\/\/\/ @details Rejection occurs if the candidate:\n\/\/\/  (1) contains characters which aren't either lowercase latin letter (a-z)\n\/\/\/      or decimal digit (0-9), such as 'A' or '?', OR\n\/\/\/  (2) is at least of length 5 yet it doesn't contain at least two digits, OR\n\/\/\/  (3) is at least of length 5 yet it doesn't contain at least one letter 'b'\n\/\/\/ @note The function `first_child()` shall not generate candidate strings\n\/\/\/  of length greater than 5.\n\/\/\/ @param [in] c                   Candidate to be verified.\n\/\/\/ @returns Whether or not rejection has occurred.\n\/\/\/ @retval true                    The candidate was rejected.\n\/\/\/ @retval false                   The candidate was not rejected.\n\/\/\/\nbool reject(const std::string &c)\ntry\n{\n    for (char ch: c)\n    {\n        if (!std::islower(ch, std::locale()) &&\n            !std::isdigit(ch, std::locale()))\n        {\n            return true;\n        }\n    }\n\n    if (c.length() >= 5)\n    {\n        if (std::count(c.begin(), c.end(), 'b') < 1 ||\n            std::count_if(c.begin(), c.end(),\n                [](const char &ch) -> bool\n                {\n                    return std::isdigit(ch, std::locale());\n                }) < 2)\n        {\n            return true;\n        }\n    }\n\n    return false;\n}\ncatch (const std::bad_alloc &e)\n{\n    std::cerr << \"`std::bad_alloc` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (const std::runtime_error &e)\n{\n    std::cerr << \"`std::runtime_error` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief Returns if a candidate is accepted as a solution.\n\/\/\/ @details Acceptance occurs if the candidate:\n\/\/\/  (0) wasn't rejected previously (this is a precondition), AND\n\/\/\/  (1) has minimum length 3, AND\n\/\/\/  (2) has maximum length 5, AND\n\/\/\/  (3) contains at least two digits, AND\n\/\/\/  (4) contains at least one letter 'b'\n\/\/\/ @pre `reject(c) == false`\n\/\/\/ @param [in] c                   Candidate to be verified.\n\/\/\/ @returns Whether or not acception has occurred.\n\/\/\/ @retval true                    The candidate was accepted.\n\/\/\/ @retval false                   The candidate was not accepted.\n\/\/\/\nbool accept(const std::string &c)\ntry\n{\n    assert(reject(c) == false);\n\n    if (c.length() >= 3 &&\n        c.length() <= 5 &&\n        std::count(c.begin(), c.end(), 'b') >= 1 &&\n        std::count_if(c.begin(), c.end(),\n            [](const char &ch) -> bool\n            {\n                return std::isdigit(ch, std::locale());\n            }) >= 2)\n    {\n        return true;\n    }\n\n    return false;\n}\ncatch (const std::bad_alloc &e)\n{\n    std::cerr << \"`std::bad_alloc` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (const std::runtime_error &e)\n{\n    std::cerr << \"`std::runtime_error` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief The set of valid characters to be used in a new candidate.\n\/\/\/ @details This global serves to \"specialize\" the candidate child and sibling\n\/\/\/  generation functions `first_child()` and `next_child()`.\n\/\/\/\nconst std::string valid_chars(\"abcdefghijklmnopqrstuvwxyz0123456789\");\n\n\/\/\/\n\/\/\/ @brief Retrieves the first child of the candidate.\n\/\/\/ @details The child is returned as a pointer but must be dereferenced and\n\/\/\/  stored as a string as soon as it's retrieved, if not null.\n\/\/\/ @todo Use `std::optional` from C++17 in the future?\n\/\/\/ @pre `valid_chars.empty() == false`\n\/\/\/ @param [in] c                   Candidate for which to get the child.\n\/\/\/ @returns Pointer to the child.\n\/\/\/ @retval nullptr                 If there are no children.\n\/\/\/\nconst std::string * first_child(const std::string &c)\ntry\n{\n    assert(valid_chars.empty() == false);\n\n    static std::string child;\n\n    if (c.length() == 5)\n        return nullptr;\n\n    child = c + valid_chars.front();\n    return &child;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief Retrieves the next sibling of the candidate.\n\/\/\/ @details The sibling is returned as a pointer but must be dereferenced and\n\/\/\/  stored as a string as soon as it's retrieved, if not null.\n\/\/\/ @todo Use `std::optional` from C++17 in the future?\n\/\/\/ @pre `valid_chars.empty() == false`\n\/\/\/ @pre `c.empty() == false`\n\/\/\/ @param [in] c                   Candidate for which to get the sibling.\n\/\/\/ @returns Pointer to the sibling.\n\/\/\/ @retval nullptr                 If there are no siblings.\n\/\/\/\nconst std::string * next_child(const std::string &c)\ntry\n{\n    assert(valid_chars.empty() == false);\n    assert(c.empty() == false);\n\n    static std::string sibling;\n\n    if (c.back() == valid_chars.back())\n        return nullptr;\n\n    sibling = c;\n    sibling.back() = valid_chars.at(valid_chars.find(c.back()) + 1);\n    return &sibling;\n}\ncatch (const std::out_of_range &e)\n{\n    std::cerr << \"`std::out_of_range` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief Performs recursive backtracking.\n\/\/\/ @param [in] c                   Current candidate to be checked.\n\/\/\/\nvoid backtrack_rec(const std::string &c)\ntry\n{\n    if (reject(c))\n        return;\n\n    if (accept(c))\n        std::cout << c << '\\n';\n\n    const std::string *p_child(first_child(c));\n\n    while (p_child != nullptr)\n    {\n        const std::string c_child(*p_child);\n\n        backtrack_rec(c_child);\n        p_child = next_child(c_child);\n    }\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief Performs non-recursive backtracking, using a Stack.\n\/\/\/ @param [in] start               Beginning candidate, to start with.\n\/\/\/\nvoid backtrack_stk(const std::string &start)\ntry\n{\n    std::stack<std::string> stk;\n\n    stk.push(start);\n\n    while (!stk.empty())\n    {\n        if (reject(stk.top()))\n        {\n            stk.pop();\n            continue;\n        }\n\n        if (accept(stk.top()))\n            std::cout << stk.top() << '\\n';\n\n        const std::string *p_child(first_child(stk.top()));\n\n        stk.pop();\n\n        if (p_child != nullptr)\n        {\n            stk.push(*p_child);\n\n            const std::string *p_sibling(next_child(stk.top()));\n\n            while (p_sibling != nullptr)\n            {\n                stk.push(*p_sibling);\n                p_sibling = next_child(stk.top());\n            }\n        }\n    }\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n} \/\/ unnamed namespace\n\n\/\/\/\n\/\/\/ @brief Enters the program.\n\/\/\/ @returns Whether or not the operation was successful.\n\/\/\/ @retval EXIT_SUCCESS            Operation success.\n\/\/\/ @retval EXIT_FAILURE            Operation failure.\n\/\/\/\nint main()\ntry\n{\n\/\/  backtrack_rec(\"\");\n    backtrack_stk(\"\");\n    return EXIT_SUCCESS;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    return EXIT_FAILURE;\n}\n<commit_msg>Update backtrack.cpp<commit_after>\/\/\n\/\/ Backtracking.\n\/\/\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Backtracking\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Call_stack\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Recursion_(computer_science)\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Stack_(abstract_data_type)\n\/\/  https:\/\/en.wikipedia.org\/wiki\/Queue_(abstract_data_type)\n\/\/\n\/\/ \"Backtracking\" is a technique used to find a solution (e.g. a password) when\n\/\/ validity constraints are known (e.g. the password can contain at most three\n\/\/ decimal digits).\n\/\/\n\/\/ The constraints will be used to reject sets of invalid candidates, thereby\n\/\/ speeding up the search process; the algorithm will skip generating candidates\n\/\/ which are known to not satisfy the constraints.\n\/\/\n\/\/ In contrast, a brute search algorithm will generate all possible candidates.\n\/\/ (A backtracking algorithm which never rejects any candidates becomes a brute\n\/\/ force algorithm.)\n\/\/\n\/\/ Backtracking algorithms are often implemented using recursion. This is done\n\/\/ because it simplifies the code in languages such as C, whereby the programmer\n\/\/ uses a (call) stack \"for free\" to hold the algorithm's state, i.e. the old\n\/\/ candidates to which the algorithm needs to \"backtrack\" in order to generate\n\/\/ their children candidates.\n\/\/\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ The basic C-style pseudocode for recursive backtracking is:\n\/\/\n\/\/  \/\/\/\n\/\/  \/\/\/ @brief Performs recursive backtracking.\n\/\/  \/\/\/ @param [in] c               Current candidate to be checked.\n\/\/  \/\/\/\n\/\/  void backtrack(candidate c)\n\/\/  {\n\/\/      \/\/\n\/\/      \/\/ c isn't a solution, and its children cannot\n\/\/      \/\/ become solutions either, so go no further\n\/\/      \/\/\n\/\/      if (reject(c))\n\/\/          return;\n\/\/\n\/\/      \/\/\n\/\/      \/\/ c is a solution!\n\/\/      \/\/\n\/\/      if (accept(c))\n\/\/          \/* use, save, print, etc. *\/ ;\n\/\/\n\/\/      \/\/\n\/\/      \/\/ does c have a child? i.e. \"001\" -> \"001a\"\n\/\/      \/\/ if not, c_child gets LINEAGE_IS_OVER\n\/\/      \/\/\n\/\/      \/\/ (in practice \"LINEAGE_IS_OVER\" can be any special value,\n\/\/      \/\/ such as NULL, that is interpreted as the lack of a child)\n\/\/      \/\/\n\/\/      candidate c_child = first_child(c);\n\/\/\n\/\/      while (c_child != LINEAGE_IS_OVER)\n\/\/      {\n\/\/          \/\/\n\/\/          \/\/ verify the child candidate, and its children, and so on...\n\/\/          \/\/\n\/\/          backtrack(c_child);\n\/\/\n\/\/          \/\/\n\/\/          \/\/ does c_child have a sibling? i.e. \"001a\" -> \"001b\"\n\/\/          \/\/ if not, c_child gets LINEAGE_IS_OVER\n\/\/          \/\/\n\/\/          c_child = next_child(c_child);\n\/\/      }\n\/\/  }\n\/\/\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ The basic C-style pseudocode for non-recursive backtracking is:\n\/\/\n\/\/  \/\/\/\n\/\/  \/\/\/ @brief Performs non-recursive backtracking.\n\/\/  \/\/\/ @param [in] start           Beginning candidate, to start with.\n\/\/  \/\/\/\n\/\/  void backtrack(candidate start)\n\/\/  {\n\/\/      \/\/\n\/\/      \/\/ because recursion isn't used anymore, we do not get a Call Stack\n\/\/      \/\/ in which to hold our current state \"for free\" so we must \"manually\"\n\/\/      \/\/ use a Stack container, that implements the following operations:\n\/\/      \/\/\n\/\/      \/\/  void        stack::push(candidate)  \/\/ adds a new \"c\" to the top\n\/\/      \/\/  void        stack::pop()            \/\/ removes the current top\n\/\/      \/\/  candidate   stack::top()            \/\/ returns the current top\n\/\/      \/\/  bool        stack::empty()          \/\/ returns if the stack is empty\n\/\/      \/\/\n\/\/      \/\/ note that the container isn't strictly required to be a Stack;\n\/\/      \/\/ for instance it could be a Queue but then the algorithm will need\n\/\/      \/\/ to be fine-tuned accordingly to the way a Queue works\n\/\/      \/\/\n\/\/      stack<candidate> stk;\n\/\/\n\/\/      stk.push(start);\n\/\/\n\/\/      while (!stk.empty())\n\/\/      {\n\/\/          if (reject(stk.top()))\n\/\/          {\n\/\/              stk.pop();\n\/\/              continue;\n\/\/          }\n\/\/\n\/\/          if (accept(stk.top()))\n\/\/              \/* use, save, print, etc. *\/ ;\n\/\/\n\/\/          candidate child = first_child(stk.top());\n\/\/\n\/\/          stk.pop();\n\/\/\n\/\/          if (child != LINEAGE_IS_OVER)\n\/\/          {\n\/\/              stk.push(child);\n\/\/\n\/\/              candidate sibling = next_child(stk.top());\n\/\/\n\/\/              while (sibling != LINEAGE_IS_OVER)\n\/\/              {\n\/\/                  stk.push(sibling);\n\/\/                  sibling = next_child(stk.top());\n\/\/              }\n\/\/          }\n\/\/      }\n\/\/  }\n\/\/\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ The following program will use backtracking to find all passwords with the\n\/\/ following example constraints:\n\/\/\n\/\/  (1) only lowercase latin letters (a-z) and decimal digits (0-9) are allowed\n\/\/  (2) there must be at least two digits in a password\n\/\/  (3) there must be at least one letter 'b' in a password\n\/\/  (4) the minimum length of a password is 3\n\/\/  (5) the maximum length of a password is 5\n\/\/\n\/\/ The program implements:\n\/\/\n\/\/  (a) traditional recursive backtrack:        backtrack_rec()\n\/\/  (b) stack-based non-recursive backtrack:    backtrack_stk()\n\/\/\n\n#include <algorithm>\n#include <cassert>\n#include <cstdlib>\n#include <iostream>\n#include <locale>\n#include <new>\n#include <stack>\n#include <stdexcept>\n#include <string>\n\nnamespace\n{\n\n\/\/\/\n\/\/\/ @brief Returns whether a candidate and its children should be rejected.\n\/\/\/ @details Rejection occurs if the candidate:\n\/\/\/  (1) contains characters which aren't either lowercase latin letter (a-z)\n\/\/\/      or decimal digit (0-9), such as 'A' or '?', OR\n\/\/\/  (2) is at least of length 5 yet it doesn't contain at least two digits, OR\n\/\/\/  (3) is at least of length 5 yet it doesn't contain at least one letter 'b'\n\/\/\/ @note The function `first_child()` shall not generate candidate strings\n\/\/\/  of length greater than 5.\n\/\/\/ @param [in] c                   Candidate to be verified.\n\/\/\/ @returns Whether or not rejection has occurred.\n\/\/\/ @retval true                    The candidate was rejected.\n\/\/\/ @retval false                   The candidate was not rejected.\n\/\/\/\nbool reject(const std::string &c)\ntry\n{\n    for (char ch: c)\n    {\n        if (!std::islower(ch, std::locale()) &&\n            !std::isdigit(ch, std::locale()))\n        {\n            return true;\n        }\n    }\n\n    if (c.length() >= 5)\n    {\n        if (std::count(c.begin(), c.end(), 'b') < 1 ||\n            std::count_if(c.begin(), c.end(),\n                [](const char &ch) -> bool\n                {\n                    return std::isdigit(ch, std::locale());\n                }) < 2)\n        {\n            return true;\n        }\n    }\n\n    return false;\n}\ncatch (const std::bad_alloc &e)\n{\n    std::cerr << \"`std::bad_alloc` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (const std::runtime_error &e)\n{\n    std::cerr << \"`std::runtime_error` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief Returns if a candidate is accepted as a solution.\n\/\/\/ @details Acceptance occurs if the candidate:\n\/\/\/  (0) wasn't rejected previously (this is a precondition), AND\n\/\/\/  (1) has minimum length 3, AND\n\/\/\/  (2) has maximum length 5, AND\n\/\/\/  (3) contains at least two digits, AND\n\/\/\/  (4) contains at least one letter 'b'\n\/\/\/ @pre `reject(c) == false`\n\/\/\/ @param [in] c                   Candidate to be verified.\n\/\/\/ @returns Whether or not acception has occurred.\n\/\/\/ @retval true                    The candidate was accepted.\n\/\/\/ @retval false                   The candidate was not accepted.\n\/\/\/\nbool accept(const std::string &c)\ntry\n{\n    assert(reject(c) == false);\n\n    if (c.length() >= 3 &&\n        c.length() <= 5 &&\n        std::count(c.begin(), c.end(), 'b') >= 1 &&\n        std::count_if(c.begin(), c.end(),\n            [](const char &ch) -> bool\n            {\n                return std::isdigit(ch, std::locale());\n            }) >= 2)\n    {\n        return true;\n    }\n\n    return false;\n}\ncatch (const std::bad_alloc &e)\n{\n    std::cerr << \"`std::bad_alloc` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (const std::runtime_error &e)\n{\n    std::cerr << \"`std::runtime_error` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief The set of valid characters to be used in a new candidate.\n\/\/\/ @details This global serves to \"specialize\" the candidate child and sibling\n\/\/\/  generation functions `first_child()` and `next_child()`.\n\/\/\/\nconst std::string valid_chars(\"abcdefghijklmnopqrstuvwxyz0123456789\");\n\n\/\/\/\n\/\/\/ @brief Retrieves the first child of the candidate.\n\/\/\/ @details The child is returned as a pointer but must be dereferenced and\n\/\/\/  stored as a string as soon as it's retrieved, if not null.\n\/\/\/ @todo Use `std::optional` from C++17 in the future?\n\/\/\/ @pre `valid_chars.empty() == false`\n\/\/\/ @param [in] c                   Candidate for which to get the child.\n\/\/\/ @returns Pointer to the child.\n\/\/\/ @retval nullptr                 If there are no children.\n\/\/\/\nconst std::string * first_child(const std::string &c)\ntry\n{\n    assert(valid_chars.empty() == false);\n\n    static std::string child;\n\n    if (c.length() >= 5)\n        return nullptr;\n\n    child = c + valid_chars.front();\n    return &child;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief Retrieves the next sibling of the candidate.\n\/\/\/ @details The sibling is returned as a pointer but must be dereferenced and\n\/\/\/  stored as a string as soon as it's retrieved, if not null.\n\/\/\/ @todo Use `std::optional` from C++17 in the future?\n\/\/\/ @pre `valid_chars.empty() == false`\n\/\/\/ @pre `c.empty() == false`\n\/\/\/ @param [in] c                   Candidate for which to get the sibling.\n\/\/\/ @returns Pointer to the sibling.\n\/\/\/ @retval nullptr                 If there are no siblings.\n\/\/\/\nconst std::string * next_child(const std::string &c)\ntry\n{\n    assert(valid_chars.empty() == false);\n    assert(c.empty() == false);\n\n    static std::string sibling;\n\n    if (c.back() == valid_chars.back())\n        return nullptr;\n\n    sibling = c;\n    sibling.back() = valid_chars.at(valid_chars.find(c.back()) + 1);\n    return &sibling;\n}\ncatch (const std::out_of_range &e)\n{\n    std::cerr << \"`std::out_of_range` exception in `\" << __func__ << \"`: \";\n    std::cerr << e.what() << std::endl;\n    throw;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief Performs recursive backtracking.\n\/\/\/ @param [in] c                   Current candidate to be checked.\n\/\/\/\nvoid backtrack_rec(const std::string &c)\ntry\n{\n    if (reject(c))\n        return;\n\n    if (accept(c))\n        std::cout << c << '\\n';\n\n    const std::string *p_child(first_child(c));\n\n    while (p_child != nullptr)\n    {\n        const std::string c_child(*p_child);\n\n        backtrack_rec(c_child);\n        p_child = next_child(c_child);\n    }\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n\/\/\/\n\/\/\/ @brief Performs non-recursive backtracking, using a Stack.\n\/\/\/ @param [in] start               Beginning candidate, to start with.\n\/\/\/\nvoid backtrack_stk(const std::string &start)\ntry\n{\n    std::stack<std::string> stk;\n\n    stk.push(start);\n\n    while (!stk.empty())\n    {\n        if (reject(stk.top()))\n        {\n            stk.pop();\n            continue;\n        }\n\n        if (accept(stk.top()))\n            std::cout << stk.top() << '\\n';\n\n        const std::string *p_child(first_child(stk.top()));\n\n        stk.pop();\n\n        if (p_child != nullptr)\n        {\n            stk.push(*p_child);\n\n            const std::string *p_sibling(next_child(stk.top()));\n\n            while (p_sibling != nullptr)\n            {\n                stk.push(*p_sibling);\n                p_sibling = next_child(stk.top());\n            }\n        }\n    }\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    throw;\n}\n\n} \/\/ unnamed namespace\n\n\/\/\/\n\/\/\/ @brief Enters the program.\n\/\/\/ @returns Whether or not the operation was successful.\n\/\/\/ @retval EXIT_SUCCESS            Operation success.\n\/\/\/ @retval EXIT_FAILURE            Operation failure.\n\/\/\/\nint main()\ntry\n{\n\/\/  backtrack_rec(\"\");\n    backtrack_stk(\"\");\n    return EXIT_SUCCESS;\n}\ncatch (...)\n{\n    std::cerr << \"unknown exception in `\" << __func__ << '`' << std::endl;\n    return EXIT_FAILURE;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- mode: c++; indent-tabs-mode: nil; tab-width: 2 -*-\n\/\/ $Id: ExportInterface.cpp 3045 2010-04-05 13:07:29Z hieuhoang1972 $\n\n\/***********************************************************************\nMoses - factored phrase-based language decoder\nCopyright (C) 2009 University of Edinburgh\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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n***********************************************************************\/\n\n\/**\n * Moses interface for main function, for single-threaded and multi-threaded.\n **\/\n#include <exception>\n#include <fstream>\n#include <sstream>\n#include <vector>\n\n#include \"util\/random.hh\"\n#include \"util\/usage.hh\"\n\n#ifdef WIN32\n\/\/ Include Visual Leak Detector\n\/\/#include <vld.h>\n#endif\n\n\n#include \"Hypothesis.h\"\n#include \"Manager.h\"\n#include \"StaticData.h\"\n#include \"TypeDef.h\"\n#include \"Util.h\"\n#include \"Timer.h\"\n#include \"TranslationModel\/PhraseDictionary.h\"\n#include \"FF\/StatefulFeatureFunction.h\"\n#include \"FF\/StatelessFeatureFunction.h\"\n#include \"TranslationTask.h\"\n#include \"ExportInterface.h\"\n\n#ifdef HAVE_PROTOBUF\n#include \"hypergraph.pb.h\"\n#endif\n\n#ifdef PT_UG\n#include <boost\/foreach.hpp>\n#include \"TranslationModel\/UG\/mmsapt.h\"\n#include \"TranslationModel\/UG\/generic\/program_options\/ug_splice_arglist.h\"\n#endif\n\n#include \"ExportInterface.h\"\n#include \"moses\/server\/Server.h\"\nusing namespace std;\nusing namespace Moses;\n\nnamespace Moses\n{\nextern size_t g_numHypos;\n\nvoid OutputFeatureWeightsForHypergraph(std::ostream &outputSearchGraphStream)\n{\n  outputSearchGraphStream.setf(std::ios::fixed);\n  outputSearchGraphStream.precision(6);\n  StaticData::Instance().GetAllWeights().Save(outputSearchGraphStream);\n}\n} \/\/namespace Moses\n\nSimpleTranslationInterface::SimpleTranslationInterface(const string &mosesIni): m_staticData(StaticData::Instance())\n{\n  if (!m_params.LoadParam(mosesIni)) {\n    cerr << \"Error; Cannot load parameters at \" << mosesIni<<endl;\n    exit(1);\n  }\n  if (!StaticData::LoadDataStatic(&m_params, mosesIni.c_str())) {\n    cerr << \"Error; Cannot load static data in file \" << mosesIni<<endl;\n    exit(1);\n  }\n\n  util::rand_init();\n\n}\n\nSimpleTranslationInterface::~SimpleTranslationInterface()\n{}\n\n\/\/the simplified version of string input\/output translation\nstring SimpleTranslationInterface::translate(const string &inputString)\n{\n  boost::shared_ptr<Moses::IOWrapper> ioWrapper(new IOWrapper);\n  \/\/ main loop over set of input sentences\n  size_t sentEnd = inputString.rfind('\\n'); \/\/find the last \\n, the input stream has to be appended with \\n to be translated\n  const string &newString = sentEnd != string::npos ? inputString : inputString + '\\n';\n\n  istringstream inputStream(newString);  \/\/create the stream for the interface\n  ioWrapper->SetInputStreamFromString(inputStream);\n  ostringstream outputStream;\n  ioWrapper->SetOutputStream2SingleBestOutputCollector(&outputStream);\n\n  boost::shared_ptr<InputType> source = ioWrapper->ReadInput();\n  if (!source) return \"Error: Source==null!!!\";\n  IFVERBOSE(1) {\n    ResetUserTime();\n  }\n\n  \/\/ set up task of translating one sentence\n  boost::shared_ptr<TranslationTask> task\n  = TranslationTask::create(source, ioWrapper);\n  task->Run();\n\n  string output = outputStream.str();\n  \/\/now trim the end whitespace\n  const string whitespace = \" \\t\\f\\v\\n\\r\";\n  size_t end = output.find_last_not_of(whitespace);\n  return output.erase(end + 1);\n}\n\nMoses::StaticData& SimpleTranslationInterface::getStaticData()\n{\n  return StaticData::InstanceNonConst();\n}\nvoid SimpleTranslationInterface::DestroyFeatureFunctionStatic()\n{\n  FeatureFunction::Destroy();\n}\n\n\nParameter params;\n\n\/\/! run moses in server mode\nint\nrun_as_server()\n{\n#ifdef HAVE_XMLRPC_C\n  MosesServer::Server server(params);\n  return server.run(); \/\/ actually: don't return. see Server::run()\n#else\n  UTIL_THROW2(\"Moses was compiled without xmlrpc-c. \"\n              << \"No server functionality available.\");\n#endif\n}\n\nint\nbatch_run()\n{\n  \/\/ shorthand for accessing information in StaticData\n  const StaticData& staticData = StaticData::Instance();\n\n  \/\/initialise random numbers\n  util::rand_init();\n\n  IFVERBOSE(1) PrintUserTime(\"Created input-output object\");\n\n  \/\/ set up read\/writing class:\n  boost::shared_ptr<IOWrapper> ioWrapper(new IOWrapper);\n  UTIL_THROW_IF2(ioWrapper == NULL, \"Error; Failed to create IO object\"\n                 << \" [\" << HERE << \"]\");\n\n  \/\/ check on weights\n  const ScoreComponentCollection& weights = staticData.GetAllWeights();\n  IFVERBOSE(2) {\n    TRACE_ERR(\"The global weight vector looks like this: \");\n    TRACE_ERR(weights);\n    TRACE_ERR(\"\\n\");\n  }\n\n#ifdef WITH_THREADS\n  ThreadPool pool(staticData.ThreadCount());\n#endif\n\n  \/\/ using context for adaptation:\n  \/\/ e.g., context words \/ strings from config file \/ cmd line\n  std::string context_string;\n  params.SetParameter(context_string,\"context-string\",string(\"\"));\n\n  \/\/ ... or weights for documents\/domains from config file \/ cmd. line\n  std::string context_weights;\n  params.SetParameter(context_weights,\"context-weights\",string(\"\"));\n\n  \/\/ ... or the surrounding context (--context-window ...)\n  size_t size_t_max = std::numeric_limits<size_t>::max();\n  bool use_context_window = ioWrapper->GetLookAhead() || ioWrapper->GetLookBack();\n  bool use_context = use_context_window || context_string.size();\n  bool use_sliding_context_window = (use_context_window\n                                     && ioWrapper->GetLookAhead() != size_t_max);\n\n  boost::shared_ptr<std::vector<std::string> >  context_window;\n  boost::shared_ptr<std::vector<std::string> >* cw;\n  cw = use_context_window ? &context_window : NULL;\n  if (!cw && context_string.size())\n    context_window.reset(new std::vector<std::string>(1,context_string));\n\n  \/\/ global scope of caches, biases, etc., if any\n  boost::shared_ptr<ContextScope> gscope;\n  if (!use_sliding_context_window)\n    gscope.reset(new ContextScope);\n\n  \/\/ main loop over set of input sentences\n  boost::shared_ptr<InputType> source;\n  while ((source = ioWrapper->ReadInput(cw)) != NULL) {\n    IFVERBOSE(1) ResetUserTime();\n\n    \/\/ set up task of translating one sentence\n    boost::shared_ptr<ContextScope>  lscope;\n    if (gscope) lscope = gscope;\n    else lscope.reset(new ContextScope);\n\n    boost::shared_ptr<TranslationTask> task;\n    task = TranslationTask::create(source, ioWrapper, lscope);\n\n    if (cw) {\n      if (context_string.size())\n        context_window->push_back(context_string);\n      if(!use_sliding_context_window)\n        cw = NULL;\n    }\n\n    if (context_window)\n      task->SetContextWindow(context_window);\n\n    if (context_weights != \"\" && !task->GetScope()->GetContextWeights())\n      task->GetScope()->SetContextWeights(context_weights);\n\n    \/\/ Allow for (sentence-)context-specific processing prior to\n    \/\/ decoding. This can be used, for example, for context-sensitive\n    \/\/ phrase lookup.\n    FeatureFunction::SetupAll(*task);\n\n    \/\/ execute task\n#ifdef WITH_THREADS\n#ifdef PT_UG\n    \/\/ simulated post-editing requires threads (within the dynamic phrase tables)\n    \/\/ but runs all sentences serially, to allow updating of the bitext.\n    bool spe = params.isParamSpecified(\"spe-src\");\n    if (spe) {\n      \/\/ simulated post-editing: always run single-threaded!\n      task->Run();\n      string src,trg,aln;\n      UTIL_THROW_IF2(!getline(*ioWrapper->spe_src,src), \"[\" << HERE << \"] \"\n                     << \"missing update data for simulated post-editing.\");\n      UTIL_THROW_IF2(!getline(*ioWrapper->spe_trg,trg), \"[\" << HERE << \"] \"\n                     << \"missing update data for simulated post-editing.\");\n      UTIL_THROW_IF2(!getline(*ioWrapper->spe_aln,aln), \"[\" << HERE << \"] \"\n                     << \"missing update data for simulated post-editing.\");\n      BOOST_FOREACH (PhraseDictionary* pd, PhraseDictionary::GetColl()) {\n        Mmsapt* sapt = dynamic_cast<Mmsapt*>(pd);\n        if (sapt) sapt->add(src,trg,aln);\n        VERBOSE(1,\"[\" << HERE << \" added src] \" << src << endl);\n        VERBOSE(1,\"[\" << HERE << \" added trg] \" << trg << endl);\n        VERBOSE(1,\"[\" << HERE << \" added aln] \" << aln << endl);\n      }\n    } else pool.Submit(task);\n#else\n    pool.Submit(task);\n\n#endif\n#else\n    task->Run();\n#endif\n  }\n\n  \/\/ we are done, finishing up\n#ifdef WITH_THREADS\n  pool.Stop(true); \/\/flush remaining jobs\n#endif\n\n  FeatureFunction::Destroy();\n\n  IFVERBOSE(1) util::PrintUsage(std::cerr);\n\n  cerr << \"g_numHypos=\" << Moses::g_numHypos << endl;\n\n#ifndef EXIT_RETURN\n  \/\/This avoids that destructors are called (it can take a long time)\n  exit(EXIT_SUCCESS);\n#else\n  return EXIT_SUCCESS;\n#endif\n}\n\n\/** Called by main function of the command line version of the decoder **\/\nint decoder_main(int argc, char** argv)\n{\n#ifdef NDEBUG\n  try\n#endif\n  {\n#ifdef HAVE_PROTOBUF\n    GOOGLE_PROTOBUF_VERIFY_VERSION;\n#endif\n\n    \/\/ echo command line, if verbose\n    IFVERBOSE(1) {\n      TRACE_ERR(\"command: \");\n      for(int i=0; i<argc; ++i) TRACE_ERR(argv[i]<<\" \");\n      TRACE_ERR(endl);\n    }\n\n    \/\/ set number of significant decimals in output\n    FixPrecision(cout);\n    FixPrecision(cerr);\n\n    \/\/ load all the settings into the Parameter class\n    \/\/ (stores them as strings, or array of strings)\n    if (!params.LoadParam(argc,argv))\n      exit(1);\n\n    \/\/ initialize all \"global\" variables, which are stored in StaticData\n    \/\/ note: this also loads models such as the language model, etc.\n    if (!StaticData::LoadDataStatic(&params, argv[0]))\n      exit(1);\n\n    \/\/ setting \"-show-weights\" -> just dump out weights and exit\n    if (params.isParamSpecified(\"show-weights\")) {\n      ShowWeights();\n      exit(0);\n    }\n\n    if (params.GetParam(\"server\"))\n      return run_as_server();\n    else\n      return batch_run();\n\n  }\n#ifdef NDEBUG\n  catch (const std::exception &e) {\n    std::cerr << \"Exception: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n#endif\n}\n\n<commit_msg>print out num of hypos created before segfaulting<commit_after>\/\/ -*- mode: c++; indent-tabs-mode: nil; tab-width: 2 -*-\n\/\/ $Id: ExportInterface.cpp 3045 2010-04-05 13:07:29Z hieuhoang1972 $\n\n\/***********************************************************************\nMoses - factored phrase-based language decoder\nCopyright (C) 2009 University of Edinburgh\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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n***********************************************************************\/\n\n\/**\n * Moses interface for main function, for single-threaded and multi-threaded.\n **\/\n#include <exception>\n#include <fstream>\n#include <sstream>\n#include <vector>\n\n#include \"util\/random.hh\"\n#include \"util\/usage.hh\"\n\n#ifdef WIN32\n\/\/ Include Visual Leak Detector\n\/\/#include <vld.h>\n#endif\n\n\n#include \"Hypothesis.h\"\n#include \"Manager.h\"\n#include \"StaticData.h\"\n#include \"TypeDef.h\"\n#include \"Util.h\"\n#include \"Timer.h\"\n#include \"TranslationModel\/PhraseDictionary.h\"\n#include \"FF\/StatefulFeatureFunction.h\"\n#include \"FF\/StatelessFeatureFunction.h\"\n#include \"TranslationTask.h\"\n#include \"ExportInterface.h\"\n\n#ifdef HAVE_PROTOBUF\n#include \"hypergraph.pb.h\"\n#endif\n\n#ifdef PT_UG\n#include <boost\/foreach.hpp>\n#include \"TranslationModel\/UG\/mmsapt.h\"\n#include \"TranslationModel\/UG\/generic\/program_options\/ug_splice_arglist.h\"\n#endif\n\n#include \"ExportInterface.h\"\n#include \"moses\/server\/Server.h\"\nusing namespace std;\nusing namespace Moses;\n\nnamespace Moses\n{\nextern size_t g_numHypos;\n\nvoid OutputFeatureWeightsForHypergraph(std::ostream &outputSearchGraphStream)\n{\n  outputSearchGraphStream.setf(std::ios::fixed);\n  outputSearchGraphStream.precision(6);\n  StaticData::Instance().GetAllWeights().Save(outputSearchGraphStream);\n}\n} \/\/namespace Moses\n\nSimpleTranslationInterface::SimpleTranslationInterface(const string &mosesIni): m_staticData(StaticData::Instance())\n{\n  if (!m_params.LoadParam(mosesIni)) {\n    cerr << \"Error; Cannot load parameters at \" << mosesIni<<endl;\n    exit(1);\n  }\n  if (!StaticData::LoadDataStatic(&m_params, mosesIni.c_str())) {\n    cerr << \"Error; Cannot load static data in file \" << mosesIni<<endl;\n    exit(1);\n  }\n\n  util::rand_init();\n\n}\n\nSimpleTranslationInterface::~SimpleTranslationInterface()\n{}\n\n\/\/the simplified version of string input\/output translation\nstring SimpleTranslationInterface::translate(const string &inputString)\n{\n  boost::shared_ptr<Moses::IOWrapper> ioWrapper(new IOWrapper);\n  \/\/ main loop over set of input sentences\n  size_t sentEnd = inputString.rfind('\\n'); \/\/find the last \\n, the input stream has to be appended with \\n to be translated\n  const string &newString = sentEnd != string::npos ? inputString : inputString + '\\n';\n\n  istringstream inputStream(newString);  \/\/create the stream for the interface\n  ioWrapper->SetInputStreamFromString(inputStream);\n  ostringstream outputStream;\n  ioWrapper->SetOutputStream2SingleBestOutputCollector(&outputStream);\n\n  boost::shared_ptr<InputType> source = ioWrapper->ReadInput();\n  if (!source) return \"Error: Source==null!!!\";\n  IFVERBOSE(1) {\n    ResetUserTime();\n  }\n\n  \/\/ set up task of translating one sentence\n  boost::shared_ptr<TranslationTask> task\n  = TranslationTask::create(source, ioWrapper);\n  task->Run();\n\n  string output = outputStream.str();\n  \/\/now trim the end whitespace\n  const string whitespace = \" \\t\\f\\v\\n\\r\";\n  size_t end = output.find_last_not_of(whitespace);\n  return output.erase(end + 1);\n}\n\nMoses::StaticData& SimpleTranslationInterface::getStaticData()\n{\n  return StaticData::InstanceNonConst();\n}\nvoid SimpleTranslationInterface::DestroyFeatureFunctionStatic()\n{\n  FeatureFunction::Destroy();\n}\n\n\nParameter params;\n\n\/\/! run moses in server mode\nint\nrun_as_server()\n{\n#ifdef HAVE_XMLRPC_C\n  MosesServer::Server server(params);\n  return server.run(); \/\/ actually: don't return. see Server::run()\n#else\n  UTIL_THROW2(\"Moses was compiled without xmlrpc-c. \"\n              << \"No server functionality available.\");\n#endif\n}\n\nint\nbatch_run()\n{\n  \/\/ shorthand for accessing information in StaticData\n  const StaticData& staticData = StaticData::Instance();\n\n  \/\/initialise random numbers\n  util::rand_init();\n\n  IFVERBOSE(1) PrintUserTime(\"Created input-output object\");\n\n  \/\/ set up read\/writing class:\n  boost::shared_ptr<IOWrapper> ioWrapper(new IOWrapper);\n  UTIL_THROW_IF2(ioWrapper == NULL, \"Error; Failed to create IO object\"\n                 << \" [\" << HERE << \"]\");\n\n  \/\/ check on weights\n  const ScoreComponentCollection& weights = staticData.GetAllWeights();\n  IFVERBOSE(2) {\n    TRACE_ERR(\"The global weight vector looks like this: \");\n    TRACE_ERR(weights);\n    TRACE_ERR(\"\\n\");\n  }\n\n#ifdef WITH_THREADS\n  ThreadPool pool(staticData.ThreadCount());\n#endif\n\n  \/\/ using context for adaptation:\n  \/\/ e.g., context words \/ strings from config file \/ cmd line\n  std::string context_string;\n  params.SetParameter(context_string,\"context-string\",string(\"\"));\n\n  \/\/ ... or weights for documents\/domains from config file \/ cmd. line\n  std::string context_weights;\n  params.SetParameter(context_weights,\"context-weights\",string(\"\"));\n\n  \/\/ ... or the surrounding context (--context-window ...)\n  size_t size_t_max = std::numeric_limits<size_t>::max();\n  bool use_context_window = ioWrapper->GetLookAhead() || ioWrapper->GetLookBack();\n  bool use_context = use_context_window || context_string.size();\n  bool use_sliding_context_window = (use_context_window\n                                     && ioWrapper->GetLookAhead() != size_t_max);\n\n  boost::shared_ptr<std::vector<std::string> >  context_window;\n  boost::shared_ptr<std::vector<std::string> >* cw;\n  cw = use_context_window ? &context_window : NULL;\n  if (!cw && context_string.size())\n    context_window.reset(new std::vector<std::string>(1,context_string));\n\n  \/\/ global scope of caches, biases, etc., if any\n  boost::shared_ptr<ContextScope> gscope;\n  if (!use_sliding_context_window)\n    gscope.reset(new ContextScope);\n\n  \/\/ main loop over set of input sentences\n  boost::shared_ptr<InputType> source;\n  while ((source = ioWrapper->ReadInput(cw)) != NULL) {\n    IFVERBOSE(1) ResetUserTime();\n\n    \/\/ set up task of translating one sentence\n    boost::shared_ptr<ContextScope>  lscope;\n    if (gscope) lscope = gscope;\n    else lscope.reset(new ContextScope);\n\n    boost::shared_ptr<TranslationTask> task;\n    task = TranslationTask::create(source, ioWrapper, lscope);\n\n    if (cw) {\n      if (context_string.size())\n        context_window->push_back(context_string);\n      if(!use_sliding_context_window)\n        cw = NULL;\n    }\n\n    if (context_window)\n      task->SetContextWindow(context_window);\n\n    if (context_weights != \"\" && !task->GetScope()->GetContextWeights())\n      task->GetScope()->SetContextWeights(context_weights);\n\n    \/\/ Allow for (sentence-)context-specific processing prior to\n    \/\/ decoding. This can be used, for example, for context-sensitive\n    \/\/ phrase lookup.\n    FeatureFunction::SetupAll(*task);\n\n    \/\/ execute task\n#ifdef WITH_THREADS\n#ifdef PT_UG\n    \/\/ simulated post-editing requires threads (within the dynamic phrase tables)\n    \/\/ but runs all sentences serially, to allow updating of the bitext.\n    bool spe = params.isParamSpecified(\"spe-src\");\n    if (spe) {\n      \/\/ simulated post-editing: always run single-threaded!\n      task->Run();\n      string src,trg,aln;\n      UTIL_THROW_IF2(!getline(*ioWrapper->spe_src,src), \"[\" << HERE << \"] \"\n                     << \"missing update data for simulated post-editing.\");\n      UTIL_THROW_IF2(!getline(*ioWrapper->spe_trg,trg), \"[\" << HERE << \"] \"\n                     << \"missing update data for simulated post-editing.\");\n      UTIL_THROW_IF2(!getline(*ioWrapper->spe_aln,aln), \"[\" << HERE << \"] \"\n                     << \"missing update data for simulated post-editing.\");\n      BOOST_FOREACH (PhraseDictionary* pd, PhraseDictionary::GetColl()) {\n        Mmsapt* sapt = dynamic_cast<Mmsapt*>(pd);\n        if (sapt) sapt->add(src,trg,aln);\n        VERBOSE(1,\"[\" << HERE << \" added src] \" << src << endl);\n        VERBOSE(1,\"[\" << HERE << \" added trg] \" << trg << endl);\n        VERBOSE(1,\"[\" << HERE << \" added aln] \" << aln << endl);\n      }\n    } else pool.Submit(task);\n#else\n    pool.Submit(task);\n\n#endif\n#else\n    task->Run();\n#endif\n  }\n\n  \/\/ we are done, finishing up\n#ifdef WITH_THREADS\n  pool.Stop(true); \/\/flush remaining jobs\n#endif\n\n  cerr << \"g_numHypos=\" << Moses::g_numHypos << endl;\n\n  FeatureFunction::Destroy();\n\n  IFVERBOSE(1) util::PrintUsage(std::cerr);\n\n#ifndef EXIT_RETURN\n  \/\/This avoids that destructors are called (it can take a long time)\n  exit(EXIT_SUCCESS);\n#else\n  return EXIT_SUCCESS;\n#endif\n}\n\n\/** Called by main function of the command line version of the decoder **\/\nint decoder_main(int argc, char** argv)\n{\n#ifdef NDEBUG\n  try\n#endif\n  {\n#ifdef HAVE_PROTOBUF\n    GOOGLE_PROTOBUF_VERIFY_VERSION;\n#endif\n\n    \/\/ echo command line, if verbose\n    IFVERBOSE(1) {\n      TRACE_ERR(\"command: \");\n      for(int i=0; i<argc; ++i) TRACE_ERR(argv[i]<<\" \");\n      TRACE_ERR(endl);\n    }\n\n    \/\/ set number of significant decimals in output\n    FixPrecision(cout);\n    FixPrecision(cerr);\n\n    \/\/ load all the settings into the Parameter class\n    \/\/ (stores them as strings, or array of strings)\n    if (!params.LoadParam(argc,argv))\n      exit(1);\n\n    \/\/ initialize all \"global\" variables, which are stored in StaticData\n    \/\/ note: this also loads models such as the language model, etc.\n    if (!StaticData::LoadDataStatic(&params, argv[0]))\n      exit(1);\n\n    \/\/ setting \"-show-weights\" -> just dump out weights and exit\n    if (params.isParamSpecified(\"show-weights\")) {\n      ShowWeights();\n      exit(0);\n    }\n\n    if (params.GetParam(\"server\"))\n      return run_as_server();\n    else\n      return batch_run();\n\n  }\n#ifdef NDEBUG\n  catch (const std::exception &e) {\n    std::cerr << \"Exception: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n#endif\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MESSAGE_QUEUE_HPP\n#define MESSAGE_QUEUE_HPP\n\n#include \"cppa\/message.hpp\"\n#include \"cppa\/ref_counted.hpp\"\n\nnamespace cppa {\n\n\/\/ forward declaration\nclass invoke_rules;\n\nclass message_queue : public ref_counted\n{\n\n protected:\n\n    bool m_trap_exit;\n    message m_last_dequeued;\n\n public:\n\n    message_queue();\n\n    virtual void enqueue(const message&) = 0;\n    virtual const message& dequeue() = 0;\n    virtual void dequeue(invoke_rules&) = 0;\n    virtual bool try_dequeue(message&) = 0;\n    virtual bool try_dequeue(invoke_rules&) = 0;\n\n    inline bool trap_exit() const;\n    inline void trap_exit(bool value);\n    inline const message& last_dequeued();\n\n};\n\ninline bool message_queue::trap_exit() const\n{\n    return m_trap_exit;\n}\n\ninline void message_queue::trap_exit(bool value)\n{\n    m_trap_exit = value;\n}\n\ninline const message& message_queue::last_dequeued()\n{\n    return m_last_dequeued;\n}\n\n} \/\/ namespace cppa\n\n#endif \/\/ MESSAGE_QUEUE_HPP\n<commit_msg>const correctness<commit_after>#ifndef MESSAGE_QUEUE_HPP\n#define MESSAGE_QUEUE_HPP\n\n#include \"cppa\/message.hpp\"\n#include \"cppa\/ref_counted.hpp\"\n\nnamespace cppa {\n\n\/\/ forward declaration\nclass invoke_rules;\n\nclass message_queue : public ref_counted\n{\n\n protected:\n\n    bool m_trap_exit;\n    message m_last_dequeued;\n\n public:\n\n    message_queue();\n\n    virtual void enqueue(const message&) = 0;\n    virtual const message& dequeue() = 0;\n    virtual void dequeue(invoke_rules&) = 0;\n    virtual bool try_dequeue(message&) = 0;\n    virtual bool try_dequeue(invoke_rules&) = 0;\n\n    inline bool trap_exit() const;\n    inline void trap_exit(bool value);\n    inline const message& last_dequeued() const;\n\n};\n\ninline bool message_queue::trap_exit() const\n{\n    return m_trap_exit;\n}\n\ninline void message_queue::trap_exit(bool value)\n{\n    m_trap_exit = value;\n}\n\ninline const message& message_queue::last_dequeued() const\n{\n    return m_last_dequeued;\n}\n\n} \/\/ namespace cppa\n\n#endif \/\/ MESSAGE_QUEUE_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: test_sec.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: jl $ $Date: 2001-03-19 10:10: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#include <stdio.h>\n\n\n#include <uno\/current_context.hxx>\n\n#include <cppuhelper\/implbase1.hxx>\n\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XSingleServiceFactory.hpp>\n#include <com\/sun\/star\/loader\/XImplementationLoader.hpp>\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n\nusing namespace rtl;\nusing namespace cppu;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::security;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::loader;\nusing namespace com::sun::star::registry;\nusing namespace com::sun::star::container;\n\n\nstatic inline void out( const sal_Char * p )\n{\n    ::fprintf( stderr, p );\n}\nstatic inline void out( const OUString & r )\n{\n    OString aStr( OUStringToOString( r, RTL_TEXTENCODING_ASCII_US ) );\n    out( aStr.getStr() );\n}\n\n\nstatic Reference< XInterface > load(\n    const Reference< XMultiServiceFactory > & xMgr,\n    const char * service,\n    const char * implName, const char * activator, const char * loc ) throw ()\n{\n    Reference< XInterface > xRet(\n        xMgr->createInstance( OUString::createFromAscii( service ) ) );\n    if (xRet.is())\n        return xRet;\n\n    try\n    {\n        Reference< XImplementationLoader > xLoader(\n            xMgr->createInstance( OUString::createFromAscii( activator ) ), UNO_QUERY );\n        if (xLoader.is())\n        {\n            Reference< XSingleServiceFactory > xFac( xLoader->activate(\n                OUString::createFromAscii( implName ), OUString(),\n                OUString::createFromAscii( loc ),\n                Reference< XRegistryKey >() ), UNO_QUERY );\n            if (xFac.is())\n                return xFac->createInstance();\n        }\n        else\n        {\n            out( \"### cannot activate loader \\\"\" );\n            out( activator );\n            out( \"\\\"!\\n\" );\n        }\n    }\n    catch (Exception &)\n    {\n        out( \"### cannot activate service \\\"\" );\n        out( service );\n        out( \"\\\"!\\n\" );\n    }\n    return Reference< XInterface >();\n}\n\nstatic void setEnv( const Reference< XMultiServiceFactory > & xMgr ) throw ()\n{\n    OSL_ASSERT( xMgr.is() );\n    Reference< XNameContainer > xContext( getCurrentContext(), UNO_QUERY );\n    OSL_ASSERT( xContext.is() );\n\n    try\n    {\n        xContext->insertByName(\n            OUString( RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.lang.ServiceManager\") ),\n            makeAny( xMgr ) );\n        xContext->insertByName(\n            OUString( RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.security.AccessController\") ),\n            makeAny( load( xMgr,\n                           \"com.sun.star.security.AccessController\",\n                           \"com.sun.star.comp.security.AccessController\",\n                           \"com.sun.star.loader.Java2\",\n                           \"com.sun.star.comp.security.AccessController\" ) ) );\n        xContext->insertByName(\n            OUString( RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.security.auth.login.LoginContext\") ),\n            makeAny( load( xMgr,\n                           \"com.sun.star.security.auth.login.LoginContext\",\n                           \"com.sun.star.comp.security.auth.login.LoginContext\",\n                           \"com.sun.star.loader.Java2\",\n                           \"com.sun.star.comp.security.auth.login.LoginContext\" ) ) );\n    }\n    catch (Exception & rExc)\n    {\n        out( \"### exception occured: \" );\n        out( rExc.Message );\n        out( \"\\n\" );\n    }\n}\n\n\/\/##################################################################################################\n\/\/##################################################################################################\n\/\/##################################################################################################\n\nstruct PrivAction : WeakImplHelper1< XPrivilegedAction >\n{\n    virtual Any SAL_CALL run()\n        throw (Exception)\n    {\n        throw IllegalArgumentException(\n            OUString::createFromAscii(\"testtest\"), (OWeakObject *)this, (sal_Int16)5 );\n    }\n};\n\nstruct Thread1 : public OThread\n{\n    Reference< XMultiServiceFactory > _xMgr;\n\n    Thread1( const Reference< XMultiServiceFactory > & xMgr )\n        : _xMgr( xMgr )\n        {}\n\n    void f()\n    {\n        Reference< XNameAccess > xAccess( getCurrentContext(), UNO_QUERY );\n        OSL_ASSERT( xAccess->getByName( OUString::createFromAscii(\"a\") ) == (sal_Int16)5 );\n        Reference< XNameContainer > xCont( getCurrentContext(), UNO_QUERY );\n        xCont->insertByName( OUString::createFromAscii(\"b\"), makeAny( (sal_Int32)6 ) );\n    }\n    virtual void SAL_CALL run()\n    {\n        try\n        {\n            setEnv( _xMgr );\n            Reference< XNameContainer > xCont( getCurrentContext(), UNO_QUERY );\n            xCont->insertByName( OUString::createFromAscii(\"a\"), makeAny( (sal_Int32)5 ) );\n            f();\n            Reference< XNameAccess > xAccess( getCurrentContext(), UNO_QUERY );\n            OSL_ASSERT( xAccess->getByName( OUString::createFromAscii(\"b\") ) == (sal_Int16)6 );\n\n\/\/              checkPermission(\n\/\/                  Permission( OUString::createFromAscii(\"java.io.FilePermission\"),\n\/\/                              OUString::createFromAscii(\"f:\\\\userprofiles.dat\"),\n\/\/                              OUString::createFromAscii(\"read\") ) );\n\n\/\/              try\n\/\/              {\n\/\/                  Reference< XCurrentContext > xContext( getCurrentContext() );\n\/\/                  Reference< XAccessController > xACC( xContext->getAccessController() );\n\/\/                  xACC->doPrivileged( new PrivAction(), Reference< XAccessControlContext >() );\n\/\/              }\n\/\/              catch (IllegalArgumentException & r)\n\/\/              {\n\/\/                  OSL_ASSERT( r.ArgumentPosition == 5 &&\n\/\/                              r.Message.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\"testtest\") ));\n\/\/              }\n        }\n        catch (RuntimeException & rExc)\n        {\n            out( rExc.Message );\n        }\n    }\n};\n\n\nvoid test_security( const Reference< XMultiServiceFactory > & xMgr ) throw ()\n{\n    setEnv( xMgr );\n    OSL_ASSERT( getCurrentContext()->getServiceManager().is() );\n\n    Thread1 thread1( xMgr );\n    thread1.create();\n    thread1.join();\n    out( \"> exiting...\\n\" );\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.190); FILE MERGED 2005\/09\/05 13:54:38 rt 1.2.190.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: test_sec.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 08:59: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#include <stdio.h>\n\n\n#include <uno\/current_context.hxx>\n\n#include <cppuhelper\/implbase1.hxx>\n\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XSingleServiceFactory.hpp>\n#include <com\/sun\/star\/loader\/XImplementationLoader.hpp>\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n\nusing namespace rtl;\nusing namespace cppu;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::security;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::loader;\nusing namespace com::sun::star::registry;\nusing namespace com::sun::star::container;\n\n\nstatic inline void out( const sal_Char * p )\n{\n    ::fprintf( stderr, p );\n}\nstatic inline void out( const OUString & r )\n{\n    OString aStr( OUStringToOString( r, RTL_TEXTENCODING_ASCII_US ) );\n    out( aStr.getStr() );\n}\n\n\nstatic Reference< XInterface > load(\n    const Reference< XMultiServiceFactory > & xMgr,\n    const char * service,\n    const char * implName, const char * activator, const char * loc ) throw ()\n{\n    Reference< XInterface > xRet(\n        xMgr->createInstance( OUString::createFromAscii( service ) ) );\n    if (xRet.is())\n        return xRet;\n\n    try\n    {\n        Reference< XImplementationLoader > xLoader(\n            xMgr->createInstance( OUString::createFromAscii( activator ) ), UNO_QUERY );\n        if (xLoader.is())\n        {\n            Reference< XSingleServiceFactory > xFac( xLoader->activate(\n                OUString::createFromAscii( implName ), OUString(),\n                OUString::createFromAscii( loc ),\n                Reference< XRegistryKey >() ), UNO_QUERY );\n            if (xFac.is())\n                return xFac->createInstance();\n        }\n        else\n        {\n            out( \"### cannot activate loader \\\"\" );\n            out( activator );\n            out( \"\\\"!\\n\" );\n        }\n    }\n    catch (Exception &)\n    {\n        out( \"### cannot activate service \\\"\" );\n        out( service );\n        out( \"\\\"!\\n\" );\n    }\n    return Reference< XInterface >();\n}\n\nstatic void setEnv( const Reference< XMultiServiceFactory > & xMgr ) throw ()\n{\n    OSL_ASSERT( xMgr.is() );\n    Reference< XNameContainer > xContext( getCurrentContext(), UNO_QUERY );\n    OSL_ASSERT( xContext.is() );\n\n    try\n    {\n        xContext->insertByName(\n            OUString( RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.lang.ServiceManager\") ),\n            makeAny( xMgr ) );\n        xContext->insertByName(\n            OUString( RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.security.AccessController\") ),\n            makeAny( load( xMgr,\n                           \"com.sun.star.security.AccessController\",\n                           \"com.sun.star.comp.security.AccessController\",\n                           \"com.sun.star.loader.Java2\",\n                           \"com.sun.star.comp.security.AccessController\" ) ) );\n        xContext->insertByName(\n            OUString( RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.security.auth.login.LoginContext\") ),\n            makeAny( load( xMgr,\n                           \"com.sun.star.security.auth.login.LoginContext\",\n                           \"com.sun.star.comp.security.auth.login.LoginContext\",\n                           \"com.sun.star.loader.Java2\",\n                           \"com.sun.star.comp.security.auth.login.LoginContext\" ) ) );\n    }\n    catch (Exception & rExc)\n    {\n        out( \"### exception occured: \" );\n        out( rExc.Message );\n        out( \"\\n\" );\n    }\n}\n\n\/\/##################################################################################################\n\/\/##################################################################################################\n\/\/##################################################################################################\n\nstruct PrivAction : WeakImplHelper1< XPrivilegedAction >\n{\n    virtual Any SAL_CALL run()\n        throw (Exception)\n    {\n        throw IllegalArgumentException(\n            OUString::createFromAscii(\"testtest\"), (OWeakObject *)this, (sal_Int16)5 );\n    }\n};\n\nstruct Thread1 : public OThread\n{\n    Reference< XMultiServiceFactory > _xMgr;\n\n    Thread1( const Reference< XMultiServiceFactory > & xMgr )\n        : _xMgr( xMgr )\n        {}\n\n    void f()\n    {\n        Reference< XNameAccess > xAccess( getCurrentContext(), UNO_QUERY );\n        OSL_ASSERT( xAccess->getByName( OUString::createFromAscii(\"a\") ) == (sal_Int16)5 );\n        Reference< XNameContainer > xCont( getCurrentContext(), UNO_QUERY );\n        xCont->insertByName( OUString::createFromAscii(\"b\"), makeAny( (sal_Int32)6 ) );\n    }\n    virtual void SAL_CALL run()\n    {\n        try\n        {\n            setEnv( _xMgr );\n            Reference< XNameContainer > xCont( getCurrentContext(), UNO_QUERY );\n            xCont->insertByName( OUString::createFromAscii(\"a\"), makeAny( (sal_Int32)5 ) );\n            f();\n            Reference< XNameAccess > xAccess( getCurrentContext(), UNO_QUERY );\n            OSL_ASSERT( xAccess->getByName( OUString::createFromAscii(\"b\") ) == (sal_Int16)6 );\n\n\/\/              checkPermission(\n\/\/                  Permission( OUString::createFromAscii(\"java.io.FilePermission\"),\n\/\/                              OUString::createFromAscii(\"f:\\\\userprofiles.dat\"),\n\/\/                              OUString::createFromAscii(\"read\") ) );\n\n\/\/              try\n\/\/              {\n\/\/                  Reference< XCurrentContext > xContext( getCurrentContext() );\n\/\/                  Reference< XAccessController > xACC( xContext->getAccessController() );\n\/\/                  xACC->doPrivileged( new PrivAction(), Reference< XAccessControlContext >() );\n\/\/              }\n\/\/              catch (IllegalArgumentException & r)\n\/\/              {\n\/\/                  OSL_ASSERT( r.ArgumentPosition == 5 &&\n\/\/                              r.Message.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\"testtest\") ));\n\/\/              }\n        }\n        catch (RuntimeException & rExc)\n        {\n            out( rExc.Message );\n        }\n    }\n};\n\n\nvoid test_security( const Reference< XMultiServiceFactory > & xMgr ) throw ()\n{\n    setEnv( xMgr );\n    OSL_ASSERT( getCurrentContext()->getServiceManager().is() );\n\n    Thread1 thread1( xMgr );\n    thread1.create();\n    thread1.join();\n    out( \"> exiting...\\n\" );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"datastream_ROS.h\"\n#include <QTextStream>\n#include <QFile>\n#include <QMessageBox>\n#include <QDebug>\n#include <thread>\n#include <mutex>\n#include <chrono>\n#include <thread>\n#include <QProgressDialog>\n#include <QtGlobal>\n#include <QApplication>\n#include <QProcess>\n#include <QCheckBox>\n#include <QSettings>\n#include <QFileDialog>\n#include <ros\/callback_queue.h>\n#include <rosbag\/bag.h>\n#include <topic_tools\/shape_shifter.h>\n#include <ros\/transport_hints.h>\n\n#include \"..\/dialog_select_ros_topics.h\"\n#include \"..\/rule_editing.h\"\n#include \"..\/qnodedialog.h\"\n#include \"..\/shape_shifter_factory.hpp\"\n\nDataStreamROS::DataStreamROS():\n    DataStreamer(),\n    _node(nullptr),\n    _destination_data(nullptr),\n    _action_saveIntoRosbag(nullptr),\n    _prev_clock_time(0)\n{\n    _running = false;\n    _periodic_timer = new QTimer();\n    connect( _periodic_timer, &QTimer::timeout,\n             this, &DataStreamROS::timerCallback);\n\n    loadDefaultSettings();\n}\n\nvoid DataStreamROS::topicCallback(const topic_tools::ShapeShifter::ConstPtr& msg,\n                                  const std::string &topic_name)\n{\n    if( !_running ){\n        return;\n    }\n\n    using namespace RosIntrospection;\n    const auto&  md5sum     =  msg->getMD5Sum();\n    const auto&  datatype   =  msg->getDataType();\n    const auto&  definition =  msg->getMessageDefinition() ;\n\n    \/\/ register the message type\n    _ros_parser.registerSchema( topic_name, md5sum,\n                                RosIntrospection::ROSType(datatype),\n                                definition);\n\n    RosIntrospectionFactory::registerMessage(topic_name, md5sum, datatype, definition );\n\n    \/\/------------------------------------\n\n    \/\/ it is more efficient to recycle this elements\n    static std::vector<uint8_t> buffer;\n    \n    buffer.resize( msg->size() );\n    \n    ros::serialization::OStream stream(buffer.data(), buffer.size());\n    msg->write(stream);\n\n    double msg_time = ros::Time::now().toSec();\n    if( msg_time == 0)\n    {\n      \/\/ corner case: use_sim_time == true but topic \/clock is not published\n      msg_time = ros::WallTime::now().toSec();\n    }\n\n    if( msg_time < _prev_clock_time )\n    {\n        \/\/ clear\n        for (auto& it: dataMap().numeric ) {\n            it.second.clear();\n        }\n        for (auto& it: dataMap().user_defined ){\n            it.second.clear();\n        }\n        emit clearBuffers();\n    }\n    _prev_clock_time = msg_time;\n\n    MessageRef buffer_view( buffer );\n    _ros_parser.pushMessageRef( topic_name, buffer_view, msg_time );\n\n    std::lock_guard<std::mutex> lock( mutex() );\n    const std::string prefixed_topic_name = _prefix + topic_name;\n\n    \/\/ adding raw serialized msg for future uses.\n    \/\/ do this before msg_time normalization\n    {\n        auto plot_pair = dataMap().user_defined.find( prefixed_topic_name );\n        if( plot_pair == dataMap().user_defined.end() )\n        {\n            plot_pair = dataMap().addUserDefined( prefixed_topic_name );\n        }\n        PlotDataAny& user_defined_data = plot_pair->second;\n        user_defined_data.pushBack( PlotDataAny::Point(msg_time, nonstd::any(std::move(buffer)) ));\n    }\n\n    _ros_parser.extractData(dataMap(), _prefix);\n\n    \/\/------------------------------\n    {\n        int& index = _msg_index[topic_name];\n        index++;\n        const std::string key = prefixed_topic_name + (\"\/_MSG_INDEX_\") ;\n        auto index_it = dataMap().numeric.find(key);\n        if( index_it == dataMap().numeric.end())\n        {\n            index_it = dataMap().addNumeric( key );\n        }\n        index_it->second.pushBack( PlotData::Point(msg_time, index) );\n    }\n}\n\nvoid DataStreamROS::extractInitialSamples()\n{\n    using namespace std::chrono;\n    milliseconds wait_time_ms(1000);\n\n    QProgressDialog progress_dialog;\n    progress_dialog.setLabelText( \"Collecting ROS topic samples to understand data layout. \");\n    progress_dialog.setRange(0, wait_time_ms.count());\n    progress_dialog.setAutoClose(true);\n    progress_dialog.setAutoReset(true);\n\n    progress_dialog.show();\n\n    auto start_time = system_clock::now();\n\n    while ( system_clock::now() - start_time < (wait_time_ms) )\n    {\n        ros::getGlobalCallbackQueue()->callAvailable(ros::WallDuration(0.1));\n        int i = duration_cast<milliseconds>(system_clock::now() - start_time).count() ;\n        progress_dialog.setValue( i );\n        QApplication::processEvents();\n        if( progress_dialog.wasCanceled() )\n        {\n            break;\n        }\n    }\n\n    if( progress_dialog.wasCanceled() == false )\n    {\n        progress_dialog.cancel();\n    }\n}\n\nvoid DataStreamROS::timerCallback()\n{\n    if( _running && ros::master::check() == false\n            && !_roscore_disconnection_already_notified)\n    {\n        auto ret = QMessageBox::warning(nullptr,\n                                        tr(\"Disconnected!\"),\n                                        tr(\"The roscore master cannot be detected.\\n\\n\"\n                                           \"Do you want to try reconnecting to it? \\n\\n\"\n                                           \"NOTE: if you select CONTINUE, you might need\"\n                                           \" to stop and restart this plugin.\"),\n                                        tr(\"Stop Plugin\"),\n                                        tr(\"Try reconnect\"),\n                                        tr(\"Continue\"),\n                                        0);\n        _roscore_disconnection_already_notified = ( ret == 2 );\n        if( ret == 1 )\n        {\n            this->shutdown();\n            _node =  RosManager::getNode();\n\n            if( !_node ){\n                emit connectionClosed();\n                return;\n            }\n            subscribe();\n\n            _running = true;\n            _spinner = std::make_shared<ros::AsyncSpinner>(1);\n            _spinner->start();\n            _periodic_timer->start();\n        }\n        else if( ret == 0)\n        {\n            this->shutdown();\n            emit connectionClosed();\n        }\n    }\n}\n\nvoid DataStreamROS::saveIntoRosbag(const PlotDataMapRef& data)\n{\n\n    if( data.user_defined.empty()){\n        QMessageBox::warning(nullptr, tr(\"Warning\"), tr(\"Your buffer is empty. Nothing to save.\\n\") );\n        return;\n    }\n\n    QFileDialog saveDialog;\n    saveDialog.setAcceptMode(QFileDialog::AcceptSave);\n    saveDialog.setDefaultSuffix(\"bag\");\n    saveDialog.exec();\n\n    if(saveDialog.result() != QDialog::Accepted || saveDialog.selectedFiles().empty())\n    {\n        return;\n    }\n\n    QString fileName = saveDialog.selectedFiles().first();\n\n    if( fileName.size() > 0)\n    {\n        rosbag::Bag rosbag(fileName.toStdString(), rosbag::bagmode::Write );\n\n        for (const auto& it: data.user_defined )\n        {\n            const std::string& topicname = it.first;\n            const auto& plotdata = it.second;\n\n            auto registered_msg_type = RosIntrospectionFactory::get().getShapeShifter(topicname);\n            if(!registered_msg_type) continue;\n\n            RosIntrospection::ShapeShifter msg;\n            msg.morph(registered_msg_type->getMD5Sum(),\n                      registered_msg_type->getDataType(),\n                      registered_msg_type->getMessageDefinition());\n\n            for (int i=0; i< plotdata.size(); i++)\n            {\n                const auto& point = plotdata.at(i);\n                const PlotDataAny::TimeType msg_time  = point.x;\n                const nonstd::any& type_erased_buffer = point.y;\n\n                if(type_erased_buffer.type() != typeid( std::vector<uint8_t> ))\n                {\n                    \/\/ can't cast to expected type\n                    continue;\n                }\n\n                std::vector<uint8_t> raw_buffer =  nonstd::any_cast<std::vector<uint8_t>>( type_erased_buffer );\n                ros::serialization::IStream stream( raw_buffer.data(), raw_buffer.size() );\n                msg.read( stream );\n\n                rosbag.write( topicname, ros::Time(msg_time), msg);\n            }\n        }\n        rosbag.close();\n\n        QProcess process;\n        QStringList args;\n        args << \"reindex\" << fileName;\n        process.start(\"rosbag\" , args);\n    }\n}\n\n\nvoid DataStreamROS::subscribe()\n{\n    _subscribers.clear();\n    {\n        boost::function<void(const rosgraph_msgs::Clock::ConstPtr&) > callback;\n        callback = [this](const rosgraph_msgs::Clock::ConstPtr& msg) -> void\n        {\n            this->clockCallback(msg) ;\n        };\n    }\n\n    for (int i=0; i< _config.selected_topics.size(); i++ )\n    {\n        const std::string topic_name = _config.selected_topics[i].toStdString();\n        boost::function<void(const topic_tools::ShapeShifter::ConstPtr&) > callback;\n        callback = [this, topic_name](const topic_tools::ShapeShifter::ConstPtr& msg) -> void\n        {\n            this->topicCallback(msg, topic_name) ;\n        };\n\n        ros::SubscribeOptions ops;\n        ops.initByFullCallbackType(topic_name, 1, callback);\n        ops.transport_hints = ros::TransportHints().tcpNoDelay();\n\n        _subscribers.insert( {topic_name, _node->subscribe(ops) }  );\n    }\n}\n\nbool DataStreamROS::start(QStringList* selected_datasources)\n{\n    _ros_parser.clear();\n    if( !_node )\n    {\n        _node =  RosManager::getNode();\n    }\n\n    if( !_node ){\n        return false;\n    }\n\n    {\n        std::lock_guard<std::mutex> lock( mutex() );\n        dataMap().numeric.clear();\n        dataMap().user_defined.clear();\n    }\n\n    using namespace RosIntrospection;\n\n    std::vector<std::pair<QString,QString>> all_topics;\n    ros::master::V_TopicInfo topic_infos;\n    ros::master::getTopics(topic_infos);\n    for (ros::master::TopicInfo topic_info: topic_infos)\n    {\n        all_topics.push_back(\n                    std::make_pair(QString(topic_info.name.c_str()),\n                                   QString(topic_info.datatype.c_str()) ) );\n    }\n\n    QTimer timer;\n    timer.setSingleShot(false);\n    timer.setInterval( 1000);\n    timer.start();\n\n    DialogSelectRosTopics dialog( all_topics, _config );\n\n    connect( &timer, &QTimer::timeout, [&]()\n    {\n        all_topics.clear();\n        topic_infos.clear();\n        ros::master::getTopics(topic_infos);\n        for (ros::master::TopicInfo topic_info: topic_infos)\n        {\n            all_topics.push_back(\n                        std::make_pair(QString(topic_info.name.c_str()),\n                                       QString(topic_info.datatype.c_str()) ) );\n        }\n        dialog.updateTopicList(all_topics);\n    });\n\n    int res = dialog.exec();\n\n    _config = dialog.getResult();\n\n    timer.stop();\n\n    if( res != QDialog::Accepted || _config.selected_topics.empty() )\n    {\n        return false;\n    }\n\n    saveDefaultSettings();\n\n    _ros_parser.setUseHeaderStamp( _config.use_header_stamp );\n\n    if( _config.use_renaming_rules )\n    {\n        _ros_parser.addRules( RuleEditing::getRenamingRules() );\n    }\n\n    _ros_parser.setMaxArrayPolicy( _config.max_array_size, _config.discard_large_arrays );\n\n    \/\/-------------------------\n    subscribe();\n    _running = true;\n\n    extractInitialSamples();\n\n    _spinner = std::make_shared<ros::AsyncSpinner>(1);\n    _spinner->start();\n\n    _periodic_timer->setInterval(500);\n    _roscore_disconnection_already_notified = false;\n    _periodic_timer->start();\n\n    return true;\n}\n\nbool DataStreamROS::isRunning() const { return _running; }\n\nvoid DataStreamROS::shutdown()\n{\n    _periodic_timer->stop();\n    if(_spinner)\n    {\n        _spinner->stop();\n    }\n    for(auto& it: _subscribers)\n    {\n        it.second.shutdown();\n    }\n    _subscribers.clear();\n    _running = false;\n    _node.reset();\n    _spinner.reset();\n}\n\nDataStreamROS::~DataStreamROS()\n{\n    shutdown();\n}\n\nbool DataStreamROS::xmlSaveState(QDomDocument &doc, QDomElement &plugin_elem) const\n{\n    QDomElement stamp_elem = doc.createElement(\"use_header_stamp\");\n    stamp_elem.setAttribute(\"value\", _config.use_header_stamp ? \"true\" : \"false\");\n    plugin_elem.appendChild( stamp_elem );\n\n    QDomElement rename_elem = doc.createElement(\"use_renaming_rules\");\n    rename_elem.setAttribute(\"value\", _config.use_renaming_rules ? \"true\" : \"false\");\n    plugin_elem.appendChild( rename_elem );\n\n    QDomElement discard_elem = doc.createElement(\"discard_large_arrays\");\n    discard_elem.setAttribute(\"value\", _config.discard_large_arrays ? \"true\" : \"false\");\n    plugin_elem.appendChild( discard_elem );\n\n    QDomElement max_elem = doc.createElement(\"max_array_size\");\n    max_elem.setAttribute(\"value\", QString::number(_config.max_array_size));\n    plugin_elem.appendChild( max_elem );\n\n    return true;\n}\n\nbool DataStreamROS::xmlLoadState(const QDomElement &parent_element)\n{\n    QDomElement stamp_elem = parent_element.firstChildElement( \"use_header_stamp\" );\n    _config.use_header_stamp = ( stamp_elem.attribute(\"value\") == \"true\");\n\n    QDomElement rename_elem = parent_element.firstChildElement( \"use_renaming_rules\" );\n    _config.use_renaming_rules = ( rename_elem.attribute(\"value\") == \"true\");\n\n    QDomElement discard_elem = parent_element.firstChildElement( \"discard_large_arrays\" );\n    _config.discard_large_arrays = ( discard_elem.attribute(\"value\") == \"true\");\n\n    QDomElement max_elem = parent_element.firstChildElement( \"max_array_size\" );\n    _config.max_array_size = max_elem.attribute(\"value\").toInt();\n\n    return true;\n}\n\nvoid DataStreamROS::addActionsToParentMenu(QMenu *menu)\n{\n    _action_saveIntoRosbag = new QAction(QString(\"Save cached value in a rosbag\"), menu);\n    menu->addAction( _action_saveIntoRosbag );\n\n    connect( _action_saveIntoRosbag, &QAction::triggered, this, [this]()\n    {\n        DataStreamROS::saveIntoRosbag( *_destination_data );\n    });\n}\n\nvoid DataStreamROS::saveDefaultSettings()\n{\n    QSettings settings;\n\n    settings.setValue(\"DataStreamROS\/default_topics\", _config.selected_topics);\n    settings.setValue(\"DataStreamROS\/use_renaming\", _config.use_renaming_rules);\n    settings.setValue(\"DataStreamROS\/use_header_stamp\", _config.use_header_stamp);\n    settings.setValue(\"DataStreamROS\/max_array_size\", (int)_config.max_array_size);\n    settings.setValue(\"DataStreamROS\/discard_large_arrays\", _config.discard_large_arrays);\n}\n\n\nvoid DataStreamROS::loadDefaultSettings()\n{\n    QSettings settings;\n    _config.selected_topics      = settings.value(\"DataStreamROS\/default_topics\", false ).toStringList();\n    _config.use_header_stamp     = settings.value(\"DataStreamROS\/use_header_stamp\", false ).toBool();\n    _config.use_renaming_rules   = settings.value(\"DataStreamROS\/use_renaming\", true ).toBool();\n    _config.max_array_size       = settings.value(\"DataStreamROS\/max_array_size\", 100 ).toInt();\n    _config.discard_large_arrays = settings.value(\"DataStreamROS\/discard_large_arrays\", true ).toBool();\n}\n\n\n<commit_msg>fix timestamp problem in streaming<commit_after>#include \"datastream_ROS.h\"\n#include <QTextStream>\n#include <QFile>\n#include <QMessageBox>\n#include <QDebug>\n#include <thread>\n#include <mutex>\n#include <chrono>\n#include <thread>\n#include <QProgressDialog>\n#include <QtGlobal>\n#include <QApplication>\n#include <QProcess>\n#include <QCheckBox>\n#include <QSettings>\n#include <QFileDialog>\n#include <ros\/callback_queue.h>\n#include <rosbag\/bag.h>\n#include <topic_tools\/shape_shifter.h>\n#include <ros\/transport_hints.h>\n\n#include \"..\/dialog_select_ros_topics.h\"\n#include \"..\/rule_editing.h\"\n#include \"..\/qnodedialog.h\"\n#include \"..\/shape_shifter_factory.hpp\"\n\nDataStreamROS::DataStreamROS():\n    DataStreamer(),\n    _node(nullptr),\n    _destination_data(nullptr),\n    _action_saveIntoRosbag(nullptr),\n    _prev_clock_time(0)\n{\n    _running = false;\n    _periodic_timer = new QTimer();\n    connect( _periodic_timer, &QTimer::timeout,\n             this, &DataStreamROS::timerCallback);\n\n    loadDefaultSettings();\n}\n\nvoid DataStreamROS::topicCallback(const topic_tools::ShapeShifter::ConstPtr& msg,\n                                  const std::string &topic_name)\n{\n    if( !_running ){\n        return;\n    }\n\n    using namespace RosIntrospection;\n    const auto&  md5sum     =  msg->getMD5Sum();\n    const auto&  datatype   =  msg->getDataType();\n    const auto&  definition =  msg->getMessageDefinition() ;\n\n    \/\/ register the message type\n    _ros_parser.registerSchema( topic_name, md5sum,\n                                RosIntrospection::ROSType(datatype),\n                                definition);\n\n    RosIntrospectionFactory::registerMessage(topic_name, md5sum, datatype, definition );\n\n    \/\/------------------------------------\n\n    \/\/ it is more efficient to recycle this elements\n    static std::vector<uint8_t> buffer;\n    \n    buffer.resize( msg->size() );\n    \n    ros::serialization::OStream stream(buffer.data(), buffer.size());\n    msg->write(stream);\n\n    _ros_parser.setUseHeaderStamp( _config.use_header_stamp );\n\n    double msg_time = ros::Time::now().toSec();\n    if( msg_time == 0)\n    {\n      \/\/ corner case: use_sim_time == true but topic \/clock is not published\n      msg_time = ros::WallTime::now().toSec();\n      _ros_parser.setUseHeaderStamp( false );\n    }\n\n    if( msg_time < _prev_clock_time )\n    {\n        \/\/ clear\n        for (auto& it: dataMap().numeric ) {\n            it.second.clear();\n        }\n        for (auto& it: dataMap().user_defined ){\n            it.second.clear();\n        }\n        emit clearBuffers();\n    }\n    _prev_clock_time = msg_time;\n\n    MessageRef buffer_view( buffer );\n    _ros_parser.pushMessageRef( topic_name, buffer_view, msg_time );\n\n    std::lock_guard<std::mutex> lock( mutex() );\n    const std::string prefixed_topic_name = _prefix + topic_name;\n\n    \/\/ adding raw serialized msg for future uses.\n    \/\/ do this before msg_time normalization\n    {\n        auto plot_pair = dataMap().user_defined.find( prefixed_topic_name );\n        if( plot_pair == dataMap().user_defined.end() )\n        {\n            plot_pair = dataMap().addUserDefined( prefixed_topic_name );\n        }\n        PlotDataAny& user_defined_data = plot_pair->second;\n        user_defined_data.pushBack( PlotDataAny::Point(msg_time, nonstd::any(std::move(buffer)) ));\n    }\n\n    _ros_parser.extractData(dataMap(), _prefix);\n\n    \/\/------------------------------\n    {\n        int& index = _msg_index[topic_name];\n        index++;\n        const std::string key = prefixed_topic_name + (\"\/_MSG_INDEX_\") ;\n        auto index_it = dataMap().numeric.find(key);\n        if( index_it == dataMap().numeric.end())\n        {\n            index_it = dataMap().addNumeric( key );\n        }\n        index_it->second.pushBack( PlotData::Point(msg_time, index) );\n    }\n}\n\nvoid DataStreamROS::extractInitialSamples()\n{\n    using namespace std::chrono;\n    milliseconds wait_time_ms(1000);\n\n    QProgressDialog progress_dialog;\n    progress_dialog.setLabelText( \"Collecting ROS topic samples to understand data layout. \");\n    progress_dialog.setRange(0, wait_time_ms.count());\n    progress_dialog.setAutoClose(true);\n    progress_dialog.setAutoReset(true);\n\n    progress_dialog.show();\n\n    auto start_time = system_clock::now();\n\n    while ( system_clock::now() - start_time < (wait_time_ms) )\n    {\n        ros::getGlobalCallbackQueue()->callAvailable(ros::WallDuration(0.1));\n        int i = duration_cast<milliseconds>(system_clock::now() - start_time).count() ;\n        progress_dialog.setValue( i );\n        QApplication::processEvents();\n        if( progress_dialog.wasCanceled() )\n        {\n            break;\n        }\n    }\n\n    if( progress_dialog.wasCanceled() == false )\n    {\n        progress_dialog.cancel();\n    }\n}\n\nvoid DataStreamROS::timerCallback()\n{\n    if( _running && ros::master::check() == false\n            && !_roscore_disconnection_already_notified)\n    {\n        auto ret = QMessageBox::warning(nullptr,\n                                        tr(\"Disconnected!\"),\n                                        tr(\"The roscore master cannot be detected.\\n\\n\"\n                                           \"Do you want to try reconnecting to it? \\n\\n\"\n                                           \"NOTE: if you select CONTINUE, you might need\"\n                                           \" to stop and restart this plugin.\"),\n                                        tr(\"Stop Plugin\"),\n                                        tr(\"Try reconnect\"),\n                                        tr(\"Continue\"),\n                                        0);\n        _roscore_disconnection_already_notified = ( ret == 2 );\n        if( ret == 1 )\n        {\n            this->shutdown();\n            _node =  RosManager::getNode();\n\n            if( !_node ){\n                emit connectionClosed();\n                return;\n            }\n            subscribe();\n\n            _running = true;\n            _spinner = std::make_shared<ros::AsyncSpinner>(1);\n            _spinner->start();\n            _periodic_timer->start();\n        }\n        else if( ret == 0)\n        {\n            this->shutdown();\n            emit connectionClosed();\n        }\n    }\n}\n\nvoid DataStreamROS::saveIntoRosbag(const PlotDataMapRef& data)\n{\n\n    if( data.user_defined.empty()){\n        QMessageBox::warning(nullptr, tr(\"Warning\"), tr(\"Your buffer is empty. Nothing to save.\\n\") );\n        return;\n    }\n\n    QFileDialog saveDialog;\n    saveDialog.setAcceptMode(QFileDialog::AcceptSave);\n    saveDialog.setDefaultSuffix(\"bag\");\n    saveDialog.exec();\n\n    if(saveDialog.result() != QDialog::Accepted || saveDialog.selectedFiles().empty())\n    {\n        return;\n    }\n\n    QString fileName = saveDialog.selectedFiles().first();\n\n    if( fileName.size() > 0)\n    {\n        rosbag::Bag rosbag(fileName.toStdString(), rosbag::bagmode::Write );\n\n        for (const auto& it: data.user_defined )\n        {\n            const std::string& topicname = it.first;\n            const auto& plotdata = it.second;\n\n            auto registered_msg_type = RosIntrospectionFactory::get().getShapeShifter(topicname);\n            if(!registered_msg_type) continue;\n\n            RosIntrospection::ShapeShifter msg;\n            msg.morph(registered_msg_type->getMD5Sum(),\n                      registered_msg_type->getDataType(),\n                      registered_msg_type->getMessageDefinition());\n\n            for (int i=0; i< plotdata.size(); i++)\n            {\n                const auto& point = plotdata.at(i);\n                const PlotDataAny::TimeType msg_time  = point.x;\n                const nonstd::any& type_erased_buffer = point.y;\n\n                if(type_erased_buffer.type() != typeid( std::vector<uint8_t> ))\n                {\n                    \/\/ can't cast to expected type\n                    continue;\n                }\n\n                std::vector<uint8_t> raw_buffer =  nonstd::any_cast<std::vector<uint8_t>>( type_erased_buffer );\n                ros::serialization::IStream stream( raw_buffer.data(), raw_buffer.size() );\n                msg.read( stream );\n\n                rosbag.write( topicname, ros::Time(msg_time), msg);\n            }\n        }\n        rosbag.close();\n\n        QProcess process;\n        QStringList args;\n        args << \"reindex\" << fileName;\n        process.start(\"rosbag\" , args);\n    }\n}\n\n\nvoid DataStreamROS::subscribe()\n{\n    _subscribers.clear();\n    {\n        boost::function<void(const rosgraph_msgs::Clock::ConstPtr&) > callback;\n        callback = [this](const rosgraph_msgs::Clock::ConstPtr& msg) -> void\n        {\n            this->clockCallback(msg) ;\n        };\n    }\n\n    for (int i=0; i< _config.selected_topics.size(); i++ )\n    {\n        const std::string topic_name = _config.selected_topics[i].toStdString();\n        boost::function<void(const topic_tools::ShapeShifter::ConstPtr&) > callback;\n        callback = [this, topic_name](const topic_tools::ShapeShifter::ConstPtr& msg) -> void\n        {\n            this->topicCallback(msg, topic_name) ;\n        };\n\n        ros::SubscribeOptions ops;\n        ops.initByFullCallbackType(topic_name, 1, callback);\n        ops.transport_hints = ros::TransportHints().tcpNoDelay();\n\n        _subscribers.insert( {topic_name, _node->subscribe(ops) }  );\n    }\n}\n\nbool DataStreamROS::start(QStringList* selected_datasources)\n{\n    _ros_parser.clear();\n    if( !_node )\n    {\n        _node =  RosManager::getNode();\n    }\n\n    if( !_node ){\n        return false;\n    }\n\n    {\n        std::lock_guard<std::mutex> lock( mutex() );\n        dataMap().numeric.clear();\n        dataMap().user_defined.clear();\n    }\n\n    using namespace RosIntrospection;\n\n    std::vector<std::pair<QString,QString>> all_topics;\n    ros::master::V_TopicInfo topic_infos;\n    ros::master::getTopics(topic_infos);\n    for (ros::master::TopicInfo topic_info: topic_infos)\n    {\n        all_topics.push_back(\n                    std::make_pair(QString(topic_info.name.c_str()),\n                                   QString(topic_info.datatype.c_str()) ) );\n    }\n\n    QTimer timer;\n    timer.setSingleShot(false);\n    timer.setInterval( 1000);\n    timer.start();\n\n    DialogSelectRosTopics dialog( all_topics, _config );\n\n    connect( &timer, &QTimer::timeout, [&]()\n    {\n        all_topics.clear();\n        topic_infos.clear();\n        ros::master::getTopics(topic_infos);\n        for (ros::master::TopicInfo topic_info: topic_infos)\n        {\n            all_topics.push_back(\n                        std::make_pair(QString(topic_info.name.c_str()),\n                                       QString(topic_info.datatype.c_str()) ) );\n        }\n        dialog.updateTopicList(all_topics);\n    });\n\n    int res = dialog.exec();\n\n    _config = dialog.getResult();\n\n    timer.stop();\n\n    if( res != QDialog::Accepted || _config.selected_topics.empty() )\n    {\n        return false;\n    }\n\n    saveDefaultSettings();\n\n    if( _config.use_renaming_rules )\n    {\n        _ros_parser.addRules( RuleEditing::getRenamingRules() );\n    }\n\n    _ros_parser.setMaxArrayPolicy( _config.max_array_size, _config.discard_large_arrays );\n\n    \/\/-------------------------\n    subscribe();\n    _running = true;\n\n    extractInitialSamples();\n\n    _spinner = std::make_shared<ros::AsyncSpinner>(1);\n    _spinner->start();\n\n    _periodic_timer->setInterval(500);\n    _roscore_disconnection_already_notified = false;\n    _periodic_timer->start();\n\n    return true;\n}\n\nbool DataStreamROS::isRunning() const { return _running; }\n\nvoid DataStreamROS::shutdown()\n{\n    _periodic_timer->stop();\n    if(_spinner)\n    {\n        _spinner->stop();\n    }\n    for(auto& it: _subscribers)\n    {\n        it.second.shutdown();\n    }\n    _subscribers.clear();\n    _running = false;\n    _node.reset();\n    _spinner.reset();\n}\n\nDataStreamROS::~DataStreamROS()\n{\n    shutdown();\n}\n\nbool DataStreamROS::xmlSaveState(QDomDocument &doc, QDomElement &plugin_elem) const\n{\n    QDomElement stamp_elem = doc.createElement(\"use_header_stamp\");\n    stamp_elem.setAttribute(\"value\", _config.use_header_stamp ? \"true\" : \"false\");\n    plugin_elem.appendChild( stamp_elem );\n\n    QDomElement rename_elem = doc.createElement(\"use_renaming_rules\");\n    rename_elem.setAttribute(\"value\", _config.use_renaming_rules ? \"true\" : \"false\");\n    plugin_elem.appendChild( rename_elem );\n\n    QDomElement discard_elem = doc.createElement(\"discard_large_arrays\");\n    discard_elem.setAttribute(\"value\", _config.discard_large_arrays ? \"true\" : \"false\");\n    plugin_elem.appendChild( discard_elem );\n\n    QDomElement max_elem = doc.createElement(\"max_array_size\");\n    max_elem.setAttribute(\"value\", QString::number(_config.max_array_size));\n    plugin_elem.appendChild( max_elem );\n\n    return true;\n}\n\nbool DataStreamROS::xmlLoadState(const QDomElement &parent_element)\n{\n    QDomElement stamp_elem = parent_element.firstChildElement( \"use_header_stamp\" );\n    _config.use_header_stamp = ( stamp_elem.attribute(\"value\") == \"true\");\n\n    QDomElement rename_elem = parent_element.firstChildElement( \"use_renaming_rules\" );\n    _config.use_renaming_rules = ( rename_elem.attribute(\"value\") == \"true\");\n\n    QDomElement discard_elem = parent_element.firstChildElement( \"discard_large_arrays\" );\n    _config.discard_large_arrays = ( discard_elem.attribute(\"value\") == \"true\");\n\n    QDomElement max_elem = parent_element.firstChildElement( \"max_array_size\" );\n    _config.max_array_size = max_elem.attribute(\"value\").toInt();\n\n    return true;\n}\n\nvoid DataStreamROS::addActionsToParentMenu(QMenu *menu)\n{\n    _action_saveIntoRosbag = new QAction(QString(\"Save cached value in a rosbag\"), menu);\n    menu->addAction( _action_saveIntoRosbag );\n\n    connect( _action_saveIntoRosbag, &QAction::triggered, this, [this]()\n    {\n        DataStreamROS::saveIntoRosbag( *_destination_data );\n    });\n}\n\nvoid DataStreamROS::saveDefaultSettings()\n{\n    QSettings settings;\n\n    settings.setValue(\"DataStreamROS\/default_topics\", _config.selected_topics);\n    settings.setValue(\"DataStreamROS\/use_renaming\", _config.use_renaming_rules);\n    settings.setValue(\"DataStreamROS\/use_header_stamp\", _config.use_header_stamp);\n    settings.setValue(\"DataStreamROS\/max_array_size\", (int)_config.max_array_size);\n    settings.setValue(\"DataStreamROS\/discard_large_arrays\", _config.discard_large_arrays);\n}\n\n\nvoid DataStreamROS::loadDefaultSettings()\n{\n    QSettings settings;\n    _config.selected_topics      = settings.value(\"DataStreamROS\/default_topics\", false ).toStringList();\n    _config.use_header_stamp     = settings.value(\"DataStreamROS\/use_header_stamp\", false ).toBool();\n    _config.use_renaming_rules   = settings.value(\"DataStreamROS\/use_renaming\", true ).toBool();\n    _config.max_array_size       = settings.value(\"DataStreamROS\/max_array_size\", 100 ).toInt();\n    _config.discard_large_arrays = settings.value(\"DataStreamROS\/discard_large_arrays\", true ).toBool();\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"mesh\/GPURenderTaskCollection.h\"\n\nnamespace megamol {\nnamespace mesh {\n\nvoid GPURenderTaskCollection::copyGPURenderTask(\n    std::string const& identifier, RenderTaskMetaData render_task_meta_data) {\n    \/\/TODO!!!\n}\n\nvoid GPURenderTaskCollection::deleteRenderTask(std::string const& identifier) {\n\n    glGetError(); \/\/TODO fuck this\n    \n    auto query = m_render_task_meta_data.find(identifier);\n\n    if (query != m_render_task_meta_data.end()) {\n\n        auto rt_meta = query->second;\n\n        auto rts = rt_meta.render_tasks;\n\n        rts->draw_cnt -= 1;\n\n\n        if (rts->draw_cnt == 0) {\n            for (size_t i = 0; i < m_gpu_render_tasks.size(); ++i) {\n                if (m_gpu_render_tasks[i] == rts) {\n                    m_gpu_render_tasks.erase(m_gpu_render_tasks.begin() + i);\n                    break;\n                }\n            }\n        } else {\n\n            \/\/ create new draw command and per draw data buffers with (size - 1)\n            size_t old_dcs_byte_size = rts->draw_commands->getByteSize();\n            size_t old_pdd_byte_size = rts->per_draw_data->getByteSize();\n            size_t new_dcs_byte_size = old_dcs_byte_size - sizeof(glowl::DrawElementsCommand);\n            size_t new_pdd_byte_size = old_pdd_byte_size - rt_meta.per_draw_data_byteSize;\n\n            auto new_dcs_buffer = std::make_shared<glowl::BufferObject>(\n                GL_DRAW_INDIRECT_BUFFER, nullptr, new_dcs_byte_size, GL_DYNAMIC_DRAW);\n            auto new_pdd_buffer = std::make_shared<glowl::BufferObject>(\n                GL_SHADER_STORAGE_BUFFER, nullptr, new_pdd_byte_size, GL_DYNAMIC_DRAW);\n\n            \/\/ copy data from beg to delete\n            glowl::BufferObject::copy(\n                rts->draw_commands.get(), new_dcs_buffer.get(), 0, 0, rt_meta.draw_command_byteOffset);\n            glowl::BufferObject::copy(\n                rts->per_draw_data.get(), new_pdd_buffer.get(), 0, 0, rt_meta.per_draw_data_byteOffset);\n\n            \/\/ copy data from delete to end\n            glowl::BufferObject::copy(rts->draw_commands.get(), new_dcs_buffer.get(),\n                rt_meta.draw_command_byteOffset + sizeof(glowl::DrawElementsCommand), rt_meta.draw_command_byteOffset,\n                new_dcs_byte_size - rt_meta.draw_command_byteOffset);\n            glowl::BufferObject::copy(rts->per_draw_data.get(), new_pdd_buffer.get(),\n                rt_meta.per_draw_data_byteOffset + rt_meta.per_draw_data_byteSize, rt_meta.per_draw_data_byteOffset,\n                new_pdd_byte_size - rt_meta.per_draw_data_byteOffset);\n\n            rts->draw_commands = new_dcs_buffer;\n            rts->per_draw_data = new_pdd_buffer;\n        \n        }\n\n        m_render_task_meta_data.erase(query);\n    }\n}\n\nvoid GPURenderTaskCollection::deletePerFrameDataBuffer(uint32_t buffer_binding_point) {\n    for (int i = 0; i < m_per_frame_data_buffers.size(); ++i) {\n        if (m_per_frame_data_buffers[i].second == buffer_binding_point) {\n            m_per_frame_data_buffers.erase(m_per_frame_data_buffers.begin()+i);\n        }\n    }\n}\n\nvoid GPURenderTaskCollection::clear() {\n    m_gpu_render_tasks.clear();\n    m_per_frame_data_buffers.clear();\n}\n\nsize_t GPURenderTaskCollection::getTotalDrawCount() {\n    size_t retval = 0;\n    for (auto& rt : m_gpu_render_tasks) {\n        retval += rt->draw_cnt;\n    }\n    return retval;\n};\n\nstd::vector<std::shared_ptr<GPURenderTaskCollection::GPURenderTask>> const& GPURenderTaskCollection::getRenderTasks() {\n    return m_gpu_render_tasks;\n}\n\nGPURenderTaskCollection::RenderTaskMetaData const& GPURenderTaskCollection::getRenderTaskMetaData(\n    std::string const& identifier) {\n    RenderTaskMetaData retval;\n\n    auto query = m_render_task_meta_data.find(identifier);\n\n    if (query != m_render_task_meta_data.end()) {\n        retval = query->second;\n    } else {\n        megamol::core::utility::log::Log::DefaultLog.WriteError(\"getRenderTaskMetaData error: identifier not found.\");\n    }\n\n    return retval;\n}\n\nstd::vector<std::pair<std::shared_ptr<glowl::BufferObject>, uint32_t>> const&\nGPURenderTaskCollection::getPerFrameBuffers() {\n    return m_per_frame_data_buffers;\n}\n\nvoid GPURenderTaskCollection::copyGPURenderTask(std::vector<GPURenderTask>& tgt_gpu_render_tasks,\n    std::unordered_multimap<std::string, RenderTaskMetaData>& tgt_render_tas_meta_data, std::string const& identifier,\n    RenderTaskMetaData const& src_render_task) {\n\n}\n\n} \/\/ namespace mesh\n} \/\/ namespace megamol<commit_msg>Hotfix for render task collection. Won't wait for next master update...<commit_after>#include \"mesh\/GPURenderTaskCollection.h\"\n\nnamespace megamol {\nnamespace mesh {\n\n    void GPURenderTaskCollection::copyGPURenderTask(\n        std::string const& identifier, RenderTaskMetaData render_task_meta_data) {\n        \/\/ TODO!!!\n    }\n\n    void GPURenderTaskCollection::deleteRenderTask(std::string const& identifier) {\n\n        glGetError(); \/\/ TODO fuck this\n\n        auto query = m_render_task_meta_data.find(identifier);\n\n        if (query != m_render_task_meta_data.end()) {\n\n            auto rt_meta = query->second;\n\n            auto rts = rt_meta.render_tasks;\n\n            rts->draw_cnt -= 1;\n\n\n            if (rts->draw_cnt == 0) {\n                for (size_t i = 0; i < m_gpu_render_tasks.size(); ++i) {\n                    if (m_gpu_render_tasks[i] == rts) {\n                        m_gpu_render_tasks.erase(m_gpu_render_tasks.begin() + i);\n                        break;\n                    }\n                }\n            } else {\n\n                \/\/ create new draw command and per draw data buffers with (size - 1)\n                size_t old_dcs_byte_size = rts->draw_commands->getByteSize();\n                size_t old_pdd_byte_size = rts->per_draw_data->getByteSize();\n                size_t new_dcs_byte_size = old_dcs_byte_size - sizeof(glowl::DrawElementsCommand);\n                size_t new_pdd_byte_size = old_pdd_byte_size - rt_meta.per_draw_data_byteSize;\n                try {\n                    auto new_dcs_buffer = std::make_shared<glowl::BufferObject>(\n                        GL_DRAW_INDIRECT_BUFFER, nullptr, new_dcs_byte_size, GL_DYNAMIC_DRAW);\n                    auto new_pdd_buffer = std::make_shared<glowl::BufferObject>(\n                        GL_SHADER_STORAGE_BUFFER, nullptr, new_pdd_byte_size, GL_DYNAMIC_DRAW);\n\n                    \/\/ copy data from beg to delete\n                    glowl::BufferObject::copy(\n                        rts->draw_commands.get(), new_dcs_buffer.get(), 0, 0, rt_meta.draw_command_byteOffset);\n                    glowl::BufferObject::copy(\n                        rts->per_draw_data.get(), new_pdd_buffer.get(), 0, 0, rt_meta.per_draw_data_byteOffset);\n\n                    \/\/ copy data from delete to end\n                    glowl::BufferObject::copy(rts->draw_commands.get(), new_dcs_buffer.get(),\n                        rt_meta.draw_command_byteOffset + sizeof(glowl::DrawElementsCommand),\n                        rt_meta.draw_command_byteOffset, new_dcs_byte_size - rt_meta.draw_command_byteOffset);\n                    glowl::BufferObject::copy(rts->per_draw_data.get(), new_pdd_buffer.get(),\n                        rt_meta.per_draw_data_byteOffset + rt_meta.per_draw_data_byteSize,\n                        rt_meta.per_draw_data_byteOffset, new_pdd_byte_size - rt_meta.per_draw_data_byteOffset);\n\n                    rts->draw_commands = new_dcs_buffer;\n                    rts->per_draw_data = new_pdd_buffer;\n\n                    \/\/ TODO!!!! iterate all meta data entries: do nothing if byte offset < delete; decrement if byte\n                    \/\/ offset > delete\n                    for (auto& rtm : m_render_task_meta_data) {\n                        if (rtm.second.draw_command_byteOffset > rt_meta.draw_command_byteOffset) {\n                            rtm.second.draw_command_byteOffset -= sizeof(glowl::DrawElementsCommand);\n                        }\n                        if (rtm.second.per_draw_data_byteOffset > rt_meta.per_draw_data_byteOffset) {\n                            rtm.second.per_draw_data_byteOffset -= rt_meta.per_draw_data_byteSize;\n                        }\n                    }\n\n\n                } catch (glowl::BufferObjectException const& e) {\n                    megamol::core::utility::log::Log::DefaultLog.WriteMsg(megamol::core::utility::log::Log::LEVEL_ERROR,\n                        \"Error during GPU render task deletion: %s\\n\", e.what());\n                }\n            }\n\n            m_render_task_meta_data.erase(query);\n        }\n    }\n\n    void GPURenderTaskCollection::deletePerFrameDataBuffer(uint32_t buffer_binding_point) {\n        for (int i = 0; i < m_per_frame_data_buffers.size(); ++i) {\n            if (m_per_frame_data_buffers[i].second == buffer_binding_point) {\n                m_per_frame_data_buffers.erase(m_per_frame_data_buffers.begin() + i);\n            }\n        }\n    }\n\n    void GPURenderTaskCollection::clear() {\n        m_gpu_render_tasks.clear();\n        m_per_frame_data_buffers.clear();\n    }\n\n    size_t GPURenderTaskCollection::getTotalDrawCount() {\n        size_t retval = 0;\n        for (auto& rt : m_gpu_render_tasks) {\n            retval += rt->draw_cnt;\n        }\n        return retval;\n    };\n\n    std::vector<std::shared_ptr<GPURenderTaskCollection::GPURenderTask>> const&\n    GPURenderTaskCollection::getRenderTasks() {\n        return m_gpu_render_tasks;\n    }\n\n    GPURenderTaskCollection::RenderTaskMetaData const& GPURenderTaskCollection::getRenderTaskMetaData(\n        std::string const& identifier) {\n        RenderTaskMetaData retval;\n\n        auto query = m_render_task_meta_data.find(identifier);\n\n        if (query != m_render_task_meta_data.end()) {\n            retval = query->second;\n        } else {\n            megamol::core::utility::log::Log::DefaultLog.WriteError(\n                \"getRenderTaskMetaData error: identifier not found.\");\n        }\n\n        return retval;\n    }\n\n    std::vector<std::pair<std::shared_ptr<glowl::BufferObject>, uint32_t>> const&\n    GPURenderTaskCollection::getPerFrameBuffers() {\n        return m_per_frame_data_buffers;\n    }\n\n    void GPURenderTaskCollection::copyGPURenderTask(std::vector<GPURenderTask>& tgt_gpu_render_tasks,\n        std::unordered_multimap<std::string, RenderTaskMetaData>& tgt_render_tas_meta_data,\n        std::string const& identifier, RenderTaskMetaData const& src_render_task) {}\n\n} \/\/ namespace mesh\n} \/\/ namespace megamol\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- Compiler.cpp --------------------------------------------*- C++-*-===\/\/\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#include \"Compiler.h\"\n#include \"Logger.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"clang\/Lex\/PreprocessorOptions.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/FormatVariadic.h\"\n\nnamespace clang {\nnamespace clangd {\n\nvoid IgnoreDiagnostics::log(DiagnosticsEngine::Level DiagLevel,\n                            const clang::Diagnostic &Info) {\n  \/\/ FIXME: format lazily, in case vlog is off.\n  llvm::SmallString<64> Message;\n  Info.FormatDiagnostic(Message);\n\n  llvm::SmallString<64> Location;\n  if (Info.hasSourceManager() && Info.getLocation().isValid()) {\n    auto &SourceMgr = Info.getSourceManager();\n    auto Loc = SourceMgr.getFileLoc(Info.getLocation());\n    llvm::raw_svector_ostream OS(Location);\n    Loc.print(OS, SourceMgr);\n    OS << \":\";\n  }\n\n  clangd::vlog(\"Ignored diagnostic. {0}{1}\", Location, Message);\n}\n\nvoid IgnoreDiagnostics::HandleDiagnostic(DiagnosticsEngine::Level DiagLevel,\n                                         const clang::Diagnostic &Info) {\n  IgnoreDiagnostics::log(DiagLevel, Info);\n}\n\nstd::unique_ptr<CompilerInvocation>\nbuildCompilerInvocation(const ParseInputs &Inputs) {\n  std::vector<const char *> ArgStrs;\n  for (const auto &S : Inputs.CompileCommand.CommandLine)\n    ArgStrs.push_back(S.c_str());\n\n  if (Inputs.FS->setCurrentWorkingDirectory(Inputs.CompileCommand.Directory)) {\n    log(\"Couldn't set working directory when creating compiler invocation.\");\n    \/\/ We proceed anyway, our lit-tests rely on results for non-existing working\n    \/\/ dirs.\n  }\n\n  \/\/ FIXME(ibiryukov): store diagnostics from CommandLine when we start\n  \/\/ reporting them.\n  IgnoreDiagnostics IgnoreDiagnostics;\n  llvm::IntrusiveRefCntPtr<DiagnosticsEngine> CommandLineDiagsEngine =\n      CompilerInstance::createDiagnostics(new DiagnosticOptions,\n                                          &IgnoreDiagnostics, false);\n  std::unique_ptr<CompilerInvocation> CI = createInvocationFromCommandLine(\n      ArgStrs, CommandLineDiagsEngine, Inputs.FS);\n  if (!CI)\n    return nullptr;\n  \/\/ createInvocationFromCommandLine sets DisableFree.\n  CI->getFrontendOpts().DisableFree = false;\n  CI->getLangOpts()->CommentOpts.ParseAllComments = true;\n  return CI;\n}\n\nstd::unique_ptr<CompilerInstance>\nprepareCompilerInstance(std::unique_ptr<clang::CompilerInvocation> CI,\n                        const PrecompiledPreamble *Preamble,\n                        std::unique_ptr<llvm::MemoryBuffer> Buffer,\n                        std::shared_ptr<PCHContainerOperations> PCHs,\n                        llvm::IntrusiveRefCntPtr<llvm::vfs::FileSystem> VFS,\n                        DiagnosticConsumer &DiagsClient) {\n  assert(VFS && \"VFS is null\");\n  assert(!CI->getPreprocessorOpts().RetainRemappedFileBuffers &&\n         \"Setting RetainRemappedFileBuffers to true will cause a memory leak \"\n         \"of ContentsBuffer\");\n\n  \/\/ NOTE: we use Buffer.get() when adding remapped files, so we have to make\n  \/\/ sure it will be released if no error is emitted.\n  if (Preamble) {\n    Preamble->OverridePreamble(*CI, VFS, Buffer.get());\n  } else {\n    CI->getPreprocessorOpts().addRemappedFile(\n        CI->getFrontendOpts().Inputs[0].getFile(), Buffer.get());\n  }\n\n  auto Clang = llvm::make_unique<CompilerInstance>(PCHs);\n  Clang->setInvocation(std::move(CI));\n  Clang->createDiagnostics(&DiagsClient, false);\n\n  if (auto VFSWithRemapping = createVFSFromCompilerInvocation(\n          Clang->getInvocation(), Clang->getDiagnostics(), VFS))\n    VFS = VFSWithRemapping;\n  Clang->setVirtualFileSystem(VFS);\n\n  Clang->setTarget(TargetInfo::CreateTargetInfo(\n      Clang->getDiagnostics(), Clang->getInvocation().TargetOpts));\n  if (!Clang->hasTarget())\n    return nullptr;\n\n  \/\/ RemappedFileBuffers will handle the lifetime of the Buffer pointer,\n  \/\/ release it.\n  Buffer.release();\n  return Clang;\n}\n\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<commit_msg>Frontend: Remove CompilerInstance::VirtualFileSystem, NFC<commit_after>\/\/===--- Compiler.cpp --------------------------------------------*- C++-*-===\/\/\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#include \"Compiler.h\"\n#include \"Logger.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"clang\/Lex\/PreprocessorOptions.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/FormatVariadic.h\"\n\nnamespace clang {\nnamespace clangd {\n\nvoid IgnoreDiagnostics::log(DiagnosticsEngine::Level DiagLevel,\n                            const clang::Diagnostic &Info) {\n  \/\/ FIXME: format lazily, in case vlog is off.\n  llvm::SmallString<64> Message;\n  Info.FormatDiagnostic(Message);\n\n  llvm::SmallString<64> Location;\n  if (Info.hasSourceManager() && Info.getLocation().isValid()) {\n    auto &SourceMgr = Info.getSourceManager();\n    auto Loc = SourceMgr.getFileLoc(Info.getLocation());\n    llvm::raw_svector_ostream OS(Location);\n    Loc.print(OS, SourceMgr);\n    OS << \":\";\n  }\n\n  clangd::vlog(\"Ignored diagnostic. {0}{1}\", Location, Message);\n}\n\nvoid IgnoreDiagnostics::HandleDiagnostic(DiagnosticsEngine::Level DiagLevel,\n                                         const clang::Diagnostic &Info) {\n  IgnoreDiagnostics::log(DiagLevel, Info);\n}\n\nstd::unique_ptr<CompilerInvocation>\nbuildCompilerInvocation(const ParseInputs &Inputs) {\n  std::vector<const char *> ArgStrs;\n  for (const auto &S : Inputs.CompileCommand.CommandLine)\n    ArgStrs.push_back(S.c_str());\n\n  if (Inputs.FS->setCurrentWorkingDirectory(Inputs.CompileCommand.Directory)) {\n    log(\"Couldn't set working directory when creating compiler invocation.\");\n    \/\/ We proceed anyway, our lit-tests rely on results for non-existing working\n    \/\/ dirs.\n  }\n\n  \/\/ FIXME(ibiryukov): store diagnostics from CommandLine when we start\n  \/\/ reporting them.\n  IgnoreDiagnostics IgnoreDiagnostics;\n  llvm::IntrusiveRefCntPtr<DiagnosticsEngine> CommandLineDiagsEngine =\n      CompilerInstance::createDiagnostics(new DiagnosticOptions,\n                                          &IgnoreDiagnostics, false);\n  std::unique_ptr<CompilerInvocation> CI = createInvocationFromCommandLine(\n      ArgStrs, CommandLineDiagsEngine, Inputs.FS);\n  if (!CI)\n    return nullptr;\n  \/\/ createInvocationFromCommandLine sets DisableFree.\n  CI->getFrontendOpts().DisableFree = false;\n  CI->getLangOpts()->CommentOpts.ParseAllComments = true;\n  return CI;\n}\n\nstd::unique_ptr<CompilerInstance>\nprepareCompilerInstance(std::unique_ptr<clang::CompilerInvocation> CI,\n                        const PrecompiledPreamble *Preamble,\n                        std::unique_ptr<llvm::MemoryBuffer> Buffer,\n                        std::shared_ptr<PCHContainerOperations> PCHs,\n                        llvm::IntrusiveRefCntPtr<llvm::vfs::FileSystem> VFS,\n                        DiagnosticConsumer &DiagsClient) {\n  assert(VFS && \"VFS is null\");\n  assert(!CI->getPreprocessorOpts().RetainRemappedFileBuffers &&\n         \"Setting RetainRemappedFileBuffers to true will cause a memory leak \"\n         \"of ContentsBuffer\");\n\n  \/\/ NOTE: we use Buffer.get() when adding remapped files, so we have to make\n  \/\/ sure it will be released if no error is emitted.\n  if (Preamble) {\n    Preamble->OverridePreamble(*CI, VFS, Buffer.get());\n  } else {\n    CI->getPreprocessorOpts().addRemappedFile(\n        CI->getFrontendOpts().Inputs[0].getFile(), Buffer.get());\n  }\n\n  auto Clang = llvm::make_unique<CompilerInstance>(PCHs);\n  Clang->setInvocation(std::move(CI));\n  Clang->createDiagnostics(&DiagsClient, false);\n\n  if (auto VFSWithRemapping = createVFSFromCompilerInvocation(\n          Clang->getInvocation(), Clang->getDiagnostics(), VFS))\n    VFS = VFSWithRemapping;\n  Clang->createFileManager(VFS);\n\n  Clang->setTarget(TargetInfo::CreateTargetInfo(\n      Clang->getDiagnostics(), Clang->getInvocation().TargetOpts));\n  if (!Clang->hasTarget())\n    return nullptr;\n\n  \/\/ RemappedFileBuffers will handle the lifetime of the Buffer pointer,\n  \/\/ release it.\n  Buffer.release();\n  return Clang;\n}\n\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *  Copyright (C) 2008-2011 Massachusetts Institute of Technology            *\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       *\n *  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                *\n *  KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE               *\n *  WARRANTIES OF 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 *  This source code is part of the PetaBricks project:                      *\n *    http:\/\/projects.csail.mit.edu\/petabricks\/                              *\n *                                                                           *\n *****************************************************************************\/\n#include \"workerthread.h\"\n\n#include \"dynamicscheduler.h\"\n#include \"common\/jasm.h\"\n\n#include <pthread.h>\n#include <signal.h>\n#include <unistd.h>\n\n#ifdef HAVE_CONFIG_H\n#  include \"config.h\"\n#endif\n  \n#ifdef DEBUG\n#  define DEBUGONLY(args...) args\n#else\n#  define DEBUGONLY(args...) (void)0\n#endif\n\n\n\/\/singleton main thread\nstatic petabricks::WorkerThread theMainWorkerThread(petabricks::DynamicScheduler::cpuScheduler());\n\n#ifdef HAVE_THREADLOCAL\n\/\/this is the simple\/fast version\n__thread petabricks::WorkerThread* mySelfPtr = NULL;\npetabricks::WorkerThread* petabricks::WorkerThread::self(){\n  return mySelfPtr;\n}\nvoid setSelf(petabricks::WorkerThread* v){\n  mySelfPtr = v;\n}\n#else\n\/\/this is a backwards compatible version for archs that dont support __thread\nnamespace { \/\/file local\n  static pthread_key_t  worker_key;\n  static pthread_once_t worker_key_once = PTHREAD_ONCE_INIT;\n  static void worker_destroy(int* buf){ delete buf; }\n  static void worker_key_alloc(){  pthread_key_create(&worker_key, (void (*)(void*)) worker_destroy); }\n  static void worker_alloc(){\n    pthread_once(&worker_key_once, worker_key_alloc);\n    pthread_setspecific(worker_key, new petabricks::WorkerThread*);\n  }\n}\npetabricks::WorkerThread* petabricks::WorkerThread::self(){\n  petabricks::WorkerThread** t = (petabricks::WorkerThread**)pthread_getspecific(worker_key);\n  return t!=NULL ? *t : NULL;\n}\nvoid setSelf(petabricks::WorkerThread* v){\n  petabricks::WorkerThread** t = (petabricks::WorkerThread**)pthread_getspecific(worker_key);\n  if(t==NULL){\n    worker_alloc();\n    t = (petabricks::WorkerThread**)pthread_getspecific(worker_key);\n    JASSERT(t!=NULL);\n  }\n  *t = v;\n}\n#endif\n\npetabricks::WorkerThread::WorkerThread(DynamicScheduler& ds)\n  : _pool(ds.pool())\n{\n  static jalib::AtomicT lastId = -1;\n  _id = (int)jalib::atomicIncrementReturn(&lastId);\n  _randomNumState.z = _id * _id * 2;\n  _randomNumState.w = _id + 1;\n  setSelf(this);\n  _pool.insert(this);\n#ifdef WORKERTHREAD_ONDECK\n  _ondeck = NULL;\n#endif\n  DEBUGONLY(_isWorking=false);\n}\npetabricks::WorkerThread::~WorkerThread(){\n  _pool.remove(this);\n}\n\nint petabricks::WorkerThread::threadRandInt() const {\n  _randomNumState.z = 36969 * (_randomNumState.z & 65535) + (_randomNumState.z >> 16);\n  _randomNumState.w = 18000 * (_randomNumState.w & 65535) + (_randomNumState.w >> 16);\n  int retVal = (_randomNumState.z << 16) + _randomNumState.w;\n  if (retVal < 0) {\n    retVal = -retVal;\n  }\n  return retVal;\n}\n  \nvoid petabricks::WorkerThread::popAndRunOneTask(int stealLimit)\n{\n  DynamicTask *task;\n\n  \/\/try from the local deque\n  task = popLocal();\n  \n  \/\/try stealing a bunch of times\n  while(task == NULL && stealLimit-->0){\n    WorkerThread* victim = _pool.getRandom(this);\n    task = victim->steal();\n  }\n\n  \/\/if we got something, run it\n  if (task != NULL) {\n    DEBUGONLY(_isWorking=true);\n    task->runWrapper();\n    DEBUGONLY(_isWorking=false);\n  } else {\n    sched_yield();\n  }\n}\n\nvoid petabricks::WorkerThread::mainLoop(){\n  for(;;){\n    try {\n      for(;;) popAndRunOneTask(STEAL_ATTEMPTS_MAINLOOP);\n    }catch(DynamicScheduler::AbortException e){}\n  }\n}\n\npetabricks::WorkerThreadPool::WorkerThreadPool(){\n  memset(_pool, 0, sizeof _pool);\n}\n\nvoid petabricks::WorkerThreadPool::insert(WorkerThread* thread){\n  int i = _count; \/\/ the slot we wish to insert into\n  for(;;++i){\n    JASSERT(i<MAX_NUM_WORKERS)(i)(MAX_NUM_WORKERS).Text(\"Too many workers!\");\n    if(jalib::compareAndSwap<WorkerThread*>(_pool+i, NULL, thread))\n      break;\n    \/\/ the slot wasn't null when we tried to put it in... someone else took our slot\n    \/\/ try again on the next slot\n  }\n  \/\/ensure _count>i\n  while(! jalib::compareAndSwap(&_count, _count, std::max(_count, i+1)) ) ;\n}\n\nvoid petabricks::WorkerThreadPool::remove(WorkerThread* thread){\n  for(int i=0; i<_count; ++i){\n    if(_pool[i] == thread)\n      _pool[i] = NULL;\/\/dont need a CAS here\n  }\n  \/\/ reduce _count if possible\n  for(int t; _pool[t=_count-1] == NULL; ){\n    jalib::compareAndSwap(&_count, t+1, t);\/\/tryDecrement\n  }\n}\n\npetabricks::WorkerThread* petabricks::WorkerThreadPool::getRandom(const WorkerThread* caller){\n  WorkerThread* rv;\n  do {\n    rv=_pool[caller->threadRandInt()%_count];\n    if(_count==1)\n      return NULL;\n    jalib::staticMemFence();\/\/don't optimize _count\n  } while(rv==caller || rv == NULL);\n  return rv;\n}\n\npetabricks::WorkerThread* petabricks::WorkerThreadPool::getFixed(int i\/*=0*\/){\n  WorkerThread* rv;\n  do {\n    rv=_pool[i++%_count];\n  } while(rv == NULL);\n  return rv;\n}\n\npetabricks::AbortTask::AbortTask(int totalThreads, bool shouldExit) {\n  _numLive = totalThreads;\n  _numAborting = totalThreads;\n  _shutdown = shouldExit;\n  _state = S_READY;\n}\npetabricks::DynamicTaskPtr petabricks::AbortTask::run(){\n  DynamicTaskPtr abortTask = this; \/\/ ensure this task isn't deleted\n  WorkerThread* self = WorkerThread::self();\n  JASSERT(self!=NULL);\n  WorkerThreadPool& pool = self->pool();\n  DynamicTask* t=NULL;\n  \n  jalib::atomicDecrement(&_numLive);\n\n  \/\/cancel all our pending tasks\n  while((t=self->popLocal())!=NULL){\n    t->cancel();\n  }\n\n  \/\/until all threads are aborted, steal and cancel tasks\n  while(_numLive>0){\n    jalib::staticMemFence();\n    \/\/make sure there is something to be stolen from us, 5 and 15 are arbitrary\n    if(self->workCount()<5)\n      for(int i=0; i<15; ++i)\n        self->pushLocal(this);\n    \/\/pick a victim to steal work from\n    WorkerThread* victim = pool.getRandom(self);\n    if(victim!=NULL){\n      \/\/try to steal all of the victim's work\n      for(int c=victim->workCount(); c>0; --c){\n        t = victim->steal();\n        if(t!=NULL && t!=this) t->cancel();\n        else break;\n      }\n    }\n  }\n  \n  \/\/drain off all our abort tasks\n  while((t=self->popLocal())!=NULL){\n    JASSERT(t==this);\n  }\n\n  \/\/wait until all threads reach this point\n  jalib::atomicDecrement(&_numAborting);\n  while(_numAborting>0) {\n    jalib::staticMemFence();\n    sched_yield();\n  }\n \/\/_lock.lock();\n \/\/if(--_numAborting==0)\n \/\/  _lock.broadcast();\n \/\/else\n \/\/  _lock.wait();\n \/\/_lock.unlock();\n  \n  \/\/either exit or throw\n  if(_shutdown && self!=&theMainWorkerThread){\n    \/\/pthread_exit(0);\n    throw DynamicScheduler::CleanExitException();\n  }else{\n    throw DynamicScheduler::AbortException();\n  }\n}\n\nvoid petabricks::WorkerThreadPool::debugPrint() const {\n  std::cerr << \"thread status: \" << std::endl;\n  \n  for(int i=0; i<_count; ++i){\n    const WorkerThread* t = _pool[i];\n    if(t == 0){\n      std::cerr << \"  * empty slot \" << std::endl;\n    }else{\n      std::cerr << \"  * thread \" << t->id() << \" workCount:\" << t->workCount();\n      DEBUGONLY(std::cerr << \" isWorking:\" << t->isWorking());\n      if(t==WorkerThread::self())\n        std::cerr << \" (current)\";\n      std::cerr << std::endl;\n    }\n  }\n}\n\nvoid petabricks::WorkerThreadPool::debugPrint(jalib::JAssert& o) const {\n  if(!o.IsFatal())\n    return;\n  o.Prefix();\n  o << \"WorkerThread status:\";\n  o.EndLine();\n  \n  for(int i=0; i<_count; ++i){\n    const WorkerThread* t = _pool[i];\n    o.Prefix();\n    if(t == 0){\n      o << \"  - empty slot\";\n    }else{\n      o << \"  - thread \" << t->id() << \" workCount:\" << t->workCount();\n      DEBUGONLY(o << \" isWorking:\" << t->isWorking());\n      if(t==WorkerThread::self())\n        o << \" (current)\";\n    }\n    o.EndLine();\n  }\n  o.Prefix();\n  o.EndLine();\n}\n\n\nextern \"C\" int threadstatus() {\n  petabricks::WorkerThread::self()->pool().debugPrint();\n  return petabricks::DynamicScheduler::cpuScheduler().numThreads();\n}\n\nnamespace{\n  void onJassert(jalib::JAssert& o) {\n    petabricks::WorkerThread::self()->pool().debugPrint(o);\n  }\n}\nint _ignored = jalib::JAssert::onBegin(&onJassert);\n\n\n<commit_msg>check NULL if _pool.getRandom return NULL<commit_after>\/*****************************************************************************\n *  Copyright (C) 2008-2011 Massachusetts Institute of Technology            *\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       *\n *  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                *\n *  KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE               *\n *  WARRANTIES OF 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 *  This source code is part of the PetaBricks project:                      *\n *    http:\/\/projects.csail.mit.edu\/petabricks\/                              *\n *                                                                           *\n *****************************************************************************\/\n#include \"workerthread.h\"\n\n#include \"dynamicscheduler.h\"\n#include \"common\/jasm.h\"\n\n#include <pthread.h>\n#include <signal.h>\n#include <unistd.h>\n\n#ifdef HAVE_CONFIG_H\n#  include \"config.h\"\n#endif\n  \n#ifdef DEBUG\n#  define DEBUGONLY(args...) args\n#else\n#  define DEBUGONLY(args...) (void)0\n#endif\n\n\n\/\/singleton main thread\nstatic petabricks::WorkerThread theMainWorkerThread(petabricks::DynamicScheduler::cpuScheduler());\n\n#ifdef HAVE_THREADLOCAL\n\/\/this is the simple\/fast version\n__thread petabricks::WorkerThread* mySelfPtr = NULL;\npetabricks::WorkerThread* petabricks::WorkerThread::self(){\n  return mySelfPtr;\n}\nvoid setSelf(petabricks::WorkerThread* v){\n  mySelfPtr = v;\n}\n#else\n\/\/this is a backwards compatible version for archs that dont support __thread\nnamespace { \/\/file local\n  static pthread_key_t  worker_key;\n  static pthread_once_t worker_key_once = PTHREAD_ONCE_INIT;\n  static void worker_destroy(int* buf){ delete buf; }\n  static void worker_key_alloc(){  pthread_key_create(&worker_key, (void (*)(void*)) worker_destroy); }\n  static void worker_alloc(){\n    pthread_once(&worker_key_once, worker_key_alloc);\n    pthread_setspecific(worker_key, new petabricks::WorkerThread*);\n  }\n}\npetabricks::WorkerThread* petabricks::WorkerThread::self(){\n  petabricks::WorkerThread** t = (petabricks::WorkerThread**)pthread_getspecific(worker_key);\n  return t!=NULL ? *t : NULL;\n}\nvoid setSelf(petabricks::WorkerThread* v){\n  petabricks::WorkerThread** t = (petabricks::WorkerThread**)pthread_getspecific(worker_key);\n  if(t==NULL){\n    worker_alloc();\n    t = (petabricks::WorkerThread**)pthread_getspecific(worker_key);\n    JASSERT(t!=NULL);\n  }\n  *t = v;\n}\n#endif\n\npetabricks::WorkerThread::WorkerThread(DynamicScheduler& ds)\n  : _pool(ds.pool())\n{\n  static jalib::AtomicT lastId = -1;\n  _id = (int)jalib::atomicIncrementReturn(&lastId);\n  _randomNumState.z = _id * _id * 2;\n  _randomNumState.w = _id + 1;\n  setSelf(this);\n  _pool.insert(this);\n#ifdef WORKERTHREAD_ONDECK\n  _ondeck = NULL;\n#endif\n  DEBUGONLY(_isWorking=false);\n}\npetabricks::WorkerThread::~WorkerThread(){\n  _pool.remove(this);\n}\n\nint petabricks::WorkerThread::threadRandInt() const {\n  _randomNumState.z = 36969 * (_randomNumState.z & 65535) + (_randomNumState.z >> 16);\n  _randomNumState.w = 18000 * (_randomNumState.w & 65535) + (_randomNumState.w >> 16);\n  int retVal = (_randomNumState.z << 16) + _randomNumState.w;\n  if (retVal < 0) {\n    retVal = -retVal;\n  }\n  return retVal;\n}\n  \nvoid petabricks::WorkerThread::popAndRunOneTask(int stealLimit)\n{\n  DynamicTask *task;\n\n  \/\/try from the local deque\n  task = popLocal();\n  \n  \/\/try stealing a bunch of times\n  while(task == NULL && stealLimit-->0){\n    WorkerThread* victim = _pool.getRandom(this);\n    if(victim !=NULL)\n      task = victim->steal();\n  }\n\n  \/\/if we got something, run it\n  if (task != NULL) {\n    DEBUGONLY(_isWorking=true);\n    task->runWrapper();\n    DEBUGONLY(_isWorking=false);\n  } else {\n    sched_yield();\n  }\n}\n\nvoid petabricks::WorkerThread::mainLoop(){\n  for(;;){\n    try {\n      for(;;) popAndRunOneTask(STEAL_ATTEMPTS_MAINLOOP);\n    }catch(DynamicScheduler::AbortException e){}\n  }\n}\n\npetabricks::WorkerThreadPool::WorkerThreadPool(){\n  memset(_pool, 0, sizeof _pool);\n}\n\nvoid petabricks::WorkerThreadPool::insert(WorkerThread* thread){\n  int i = _count; \/\/ the slot we wish to insert into\n  for(;;++i){\n    JASSERT(i<MAX_NUM_WORKERS)(i)(MAX_NUM_WORKERS).Text(\"Too many workers!\");\n    if(jalib::compareAndSwap<WorkerThread*>(_pool+i, NULL, thread))\n      break;\n    \/\/ the slot wasn't null when we tried to put it in... someone else took our slot\n    \/\/ try again on the next slot\n  }\n  \/\/ensure _count>i\n  while(! jalib::compareAndSwap(&_count, _count, std::max(_count, i+1)) ) ;\n}\n\nvoid petabricks::WorkerThreadPool::remove(WorkerThread* thread){\n  for(int i=0; i<_count; ++i){\n    if(_pool[i] == thread)\n      _pool[i] = NULL;\/\/dont need a CAS here\n  }\n  \/\/ reduce _count if possible\n  for(int t; _pool[t=_count-1] == NULL; ){\n    jalib::compareAndSwap(&_count, t+1, t);\/\/tryDecrement\n  }\n}\n\npetabricks::WorkerThread* petabricks::WorkerThreadPool::getRandom(const WorkerThread* caller){\n  WorkerThread* rv;\n  do {\n    rv=_pool[caller->threadRandInt()%_count];\n    if(_count==1)\n      return NULL;\n    jalib::staticMemFence();\/\/don't optimize _count\n  } while(rv==caller || rv == NULL);\n  return rv;\n}\n\npetabricks::WorkerThread* petabricks::WorkerThreadPool::getFixed(int i\/*=0*\/){\n  WorkerThread* rv;\n  do {\n    rv=_pool[i++%_count];\n  } while(rv == NULL);\n  return rv;\n}\n\npetabricks::AbortTask::AbortTask(int totalThreads, bool shouldExit) {\n  _numLive = totalThreads;\n  _numAborting = totalThreads;\n  _shutdown = shouldExit;\n  _state = S_READY;\n}\npetabricks::DynamicTaskPtr petabricks::AbortTask::run(){\n  DynamicTaskPtr abortTask = this; \/\/ ensure this task isn't deleted\n  WorkerThread* self = WorkerThread::self();\n  JASSERT(self!=NULL);\n  WorkerThreadPool& pool = self->pool();\n  DynamicTask* t=NULL;\n  \n  jalib::atomicDecrement(&_numLive);\n\n  \/\/cancel all our pending tasks\n  while((t=self->popLocal())!=NULL){\n    t->cancel();\n  }\n\n  \/\/until all threads are aborted, steal and cancel tasks\n  while(_numLive>0){\n    jalib::staticMemFence();\n    \/\/make sure there is something to be stolen from us, 5 and 15 are arbitrary\n    if(self->workCount()<5)\n      for(int i=0; i<15; ++i)\n        self->pushLocal(this);\n    \/\/pick a victim to steal work from\n    WorkerThread* victim = pool.getRandom(self);\n    if(victim!=NULL){\n      \/\/try to steal all of the victim's work\n      for(int c=victim->workCount(); c>0; --c){\n        t = victim->steal();\n        if(t!=NULL && t!=this) t->cancel();\n        else break;\n      }\n    }\n  }\n  \n  \/\/drain off all our abort tasks\n  while((t=self->popLocal())!=NULL){\n    JASSERT(t==this);\n  }\n\n  \/\/wait until all threads reach this point\n  jalib::atomicDecrement(&_numAborting);\n  while(_numAborting>0) {\n    jalib::staticMemFence();\n    sched_yield();\n  }\n \/\/_lock.lock();\n \/\/if(--_numAborting==0)\n \/\/  _lock.broadcast();\n \/\/else\n \/\/  _lock.wait();\n \/\/_lock.unlock();\n  \n  \/\/either exit or throw\n  if(_shutdown && self!=&theMainWorkerThread){\n    \/\/pthread_exit(0);\n    throw DynamicScheduler::CleanExitException();\n  }else{\n    throw DynamicScheduler::AbortException();\n  }\n}\n\nvoid petabricks::WorkerThreadPool::debugPrint() const {\n  std::cerr << \"thread status: \" << std::endl;\n  \n  for(int i=0; i<_count; ++i){\n    const WorkerThread* t = _pool[i];\n    if(t == 0){\n      std::cerr << \"  * empty slot \" << std::endl;\n    }else{\n      std::cerr << \"  * thread \" << t->id() << \" workCount:\" << t->workCount();\n      DEBUGONLY(std::cerr << \" isWorking:\" << t->isWorking());\n      if(t==WorkerThread::self())\n        std::cerr << \" (current)\";\n      std::cerr << std::endl;\n    }\n  }\n}\n\nvoid petabricks::WorkerThreadPool::debugPrint(jalib::JAssert& o) const {\n  if(!o.IsFatal())\n    return;\n  o.Prefix();\n  o << \"WorkerThread status:\";\n  o.EndLine();\n  \n  for(int i=0; i<_count; ++i){\n    const WorkerThread* t = _pool[i];\n    o.Prefix();\n    if(t == 0){\n      o << \"  - empty slot\";\n    }else{\n      o << \"  - thread \" << t->id() << \" workCount:\" << t->workCount();\n      DEBUGONLY(o << \" isWorking:\" << t->isWorking());\n      if(t==WorkerThread::self())\n        o << \" (current)\";\n    }\n    o.EndLine();\n  }\n  o.Prefix();\n  o.EndLine();\n}\n\n\nextern \"C\" int threadstatus() {\n  petabricks::WorkerThread::self()->pool().debugPrint();\n  return petabricks::DynamicScheduler::cpuScheduler().numThreads();\n}\n\nnamespace{\n  void onJassert(jalib::JAssert& o) {\n    petabricks::WorkerThread::self()->pool().debugPrint(o);\n  }\n}\nint _ignored = jalib::JAssert::onBegin(&onJassert);\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"hornet\/vm.hh\"\n\n#include \"hornet\/java.hh\"\n\n#include <string>\n\nnamespace hornet {\n\nklass::klass(const std::string& name_, loader *loader, std::shared_ptr<constant_pool> const_pool)\n    : object(nullptr)\n    , name(name_)\n    , nr_fields(0)\n    , _const_pool(const_pool)\n    , _loader(loader)\n{\n}\n\nklass::~klass()\n{\n}\n\nvoid klass::link()\n{\n    if (!bootstrap_done) {\n        return;\n    }\n    object = gc_new_object(java_lang_Class.get());\n    \/\/ FIXME: Add a link between this klass structure and java\/lang\/Class. In\n    \/\/ GNU Classpath, it's in the vmdata field.\n}\n\nvoid klass::add(std::shared_ptr<klass> iface)\n{\n    interfaces.push_back(iface);\n}\n\nvoid klass::add(std::shared_ptr<field> field)\n{\n    if (field->is_static()) {\n        auto offset = static_values.size();\n        static_values.reserve(offset + 1);\n        static_values[offset] = 0;\n        field->offset = offset;\n    } else {\n        auto offset = nr_fields;\n        field->offset = offset;\n        nr_fields++;\n    }\n    _fields.push_back(field);\n}\n\nvoid klass::add(std::shared_ptr<method> method)\n{\n    _methods.push_back(method);\n}\n\nstd::shared_ptr<klass> klass::load_class(std::string name)\n{\n    return _loader->load_class(name);\n}\n\nstd::shared_ptr<field> klass::lookup_field(std::string name, std::string descriptor)\n{\n    klass* klass = this;\n    while (klass) {\n        for (auto field : klass->_fields) {\n            if (field->matches(name, descriptor))\n                return field;\n        }\n        klass = klass->super;\n    }\n    return nullptr;\n}\n\nstd::shared_ptr<method> klass::lookup_method(std::string name, std::string descriptor)\n{\n    klass* klass = this;\n    while (klass) {\n        for (auto method : klass->_methods) {\n            if (method->matches(name, descriptor))\n                return method;\n        }\n        klass = klass->super;\n    }\n    return nullptr;\n}\n\nstd::shared_ptr<klass> klass::resolve_class(uint16_t idx)\n{\n    auto& klassref = _const_pool->get_class(idx);\n    auto& klass_name = _const_pool->get_utf8(klassref.name_index);\n    return _loader->load_class(klass_name.bytes);\n}\n\nstd::shared_ptr<field> klass::resolve_field(uint16_t idx)\n{\n    auto& fieldref = _const_pool->get_fieldref(idx);\n    auto target_klass = resolve_class(fieldref.class_index);\n    if (!target_klass) {\n        return nullptr;\n    }\n    auto& field_name_and_type = _const_pool->get_name_and_type(fieldref.name_and_type_index);\n    auto& field_name = _const_pool->get_utf8(field_name_and_type.name_index);\n    auto& field_type = _const_pool->get_utf8(field_name_and_type.descriptor_index);\n    return target_klass->lookup_field(field_name.bytes, field_type.bytes);\n}\n\nstd::shared_ptr<method> klass::resolve_method(uint16_t idx)\n{\n    auto& methodref = _const_pool->get_methodref(idx);\n    auto target_klass = resolve_class(methodref.class_index);\n    if (!target_klass) {\n        return nullptr;\n    }\n    auto& method_name_and_type = _const_pool->get_name_and_type(methodref.name_and_type_index);\n    auto& method_name = _const_pool->get_utf8(method_name_and_type.name_index);\n    auto& method_type = _const_pool->get_utf8(method_name_and_type.descriptor_index);\n    return target_klass->lookup_method(method_name.bytes, method_type.bytes);\n}\n\nstd::shared_ptr<method> klass::resolve_interface_method(uint16_t idx)\n{\n    auto& methodref = _const_pool->get_interface_methodref(idx);\n    auto target_klass = resolve_class(methodref.class_index);\n    if (!target_klass) {\n        return nullptr;\n    }\n    auto& method_name_and_type = _const_pool->get_name_and_type(methodref.name_and_type_index);\n    auto& method_name = _const_pool->get_utf8(method_name_and_type.name_index);\n    auto& method_type = _const_pool->get_utf8(method_name_and_type.descriptor_index);\n    return target_klass->lookup_method(method_name.bytes, method_type.bytes);\n}\n\nvoid klass::init()\n{\n    switch (state) {\n    case klass_state::loaded: {\n        state = klass_state::initialized;\n        auto clinit = lookup_method(\"<clinit>\", \"()V\");\n        if (clinit) {\n            auto thread = hornet::thread::current();\n            auto new_frame = thread->make_frame(0);\n            hornet::_backend->execute(clinit.get(), *new_frame);\n            thread->free_frame(new_frame);\n        }\n        break;\n    }\n    case klass_state::initialized:\n        break;\n    }\n}\n\nbool klass::verify()\n{\n    for (auto method : _methods) {\n        if (!verify_method(method))\n            return false;\n    }\n    return true;\n}\n\n}\n<commit_msg>vm\/klass: Initialize super to nullptr<commit_after>#include \"hornet\/vm.hh\"\n\n#include \"hornet\/java.hh\"\n\n#include <string>\n\nnamespace hornet {\n\nklass::klass(const std::string& name_, loader *loader, std::shared_ptr<constant_pool> const_pool)\n    : object(nullptr)\n    , name(name_)\n    , super(nullptr)\n    , nr_fields(0)\n    , _const_pool(const_pool)\n    , _loader(loader)\n{\n}\n\nklass::~klass()\n{\n}\n\nvoid klass::link()\n{\n    if (!bootstrap_done) {\n        return;\n    }\n    object = gc_new_object(java_lang_Class.get());\n    \/\/ FIXME: Add a link between this klass structure and java\/lang\/Class. In\n    \/\/ GNU Classpath, it's in the vmdata field.\n}\n\nvoid klass::add(std::shared_ptr<klass> iface)\n{\n    interfaces.push_back(iface);\n}\n\nvoid klass::add(std::shared_ptr<field> field)\n{\n    if (field->is_static()) {\n        auto offset = static_values.size();\n        static_values.reserve(offset + 1);\n        static_values[offset] = 0;\n        field->offset = offset;\n    } else {\n        auto offset = nr_fields;\n        field->offset = offset;\n        nr_fields++;\n    }\n    _fields.push_back(field);\n}\n\nvoid klass::add(std::shared_ptr<method> method)\n{\n    _methods.push_back(method);\n}\n\nstd::shared_ptr<klass> klass::load_class(std::string name)\n{\n    return _loader->load_class(name);\n}\n\nstd::shared_ptr<field> klass::lookup_field(std::string name, std::string descriptor)\n{\n    klass* klass = this;\n    while (klass) {\n        for (auto field : klass->_fields) {\n            if (field->matches(name, descriptor))\n                return field;\n        }\n        klass = klass->super;\n    }\n    return nullptr;\n}\n\nstd::shared_ptr<method> klass::lookup_method(std::string name, std::string descriptor)\n{\n    klass* klass = this;\n    while (klass) {\n        for (auto method : klass->_methods) {\n            if (method->matches(name, descriptor))\n                return method;\n        }\n        klass = klass->super;\n    }\n    return nullptr;\n}\n\nstd::shared_ptr<klass> klass::resolve_class(uint16_t idx)\n{\n    auto& klassref = _const_pool->get_class(idx);\n    auto& klass_name = _const_pool->get_utf8(klassref.name_index);\n    return _loader->load_class(klass_name.bytes);\n}\n\nstd::shared_ptr<field> klass::resolve_field(uint16_t idx)\n{\n    auto& fieldref = _const_pool->get_fieldref(idx);\n    auto target_klass = resolve_class(fieldref.class_index);\n    if (!target_klass) {\n        return nullptr;\n    }\n    auto& field_name_and_type = _const_pool->get_name_and_type(fieldref.name_and_type_index);\n    auto& field_name = _const_pool->get_utf8(field_name_and_type.name_index);\n    auto& field_type = _const_pool->get_utf8(field_name_and_type.descriptor_index);\n    return target_klass->lookup_field(field_name.bytes, field_type.bytes);\n}\n\nstd::shared_ptr<method> klass::resolve_method(uint16_t idx)\n{\n    auto& methodref = _const_pool->get_methodref(idx);\n    auto target_klass = resolve_class(methodref.class_index);\n    if (!target_klass) {\n        return nullptr;\n    }\n    auto& method_name_and_type = _const_pool->get_name_and_type(methodref.name_and_type_index);\n    auto& method_name = _const_pool->get_utf8(method_name_and_type.name_index);\n    auto& method_type = _const_pool->get_utf8(method_name_and_type.descriptor_index);\n    return target_klass->lookup_method(method_name.bytes, method_type.bytes);\n}\n\nstd::shared_ptr<method> klass::resolve_interface_method(uint16_t idx)\n{\n    auto& methodref = _const_pool->get_interface_methodref(idx);\n    auto target_klass = resolve_class(methodref.class_index);\n    if (!target_klass) {\n        return nullptr;\n    }\n    auto& method_name_and_type = _const_pool->get_name_and_type(methodref.name_and_type_index);\n    auto& method_name = _const_pool->get_utf8(method_name_and_type.name_index);\n    auto& method_type = _const_pool->get_utf8(method_name_and_type.descriptor_index);\n    return target_klass->lookup_method(method_name.bytes, method_type.bytes);\n}\n\nvoid klass::init()\n{\n    switch (state) {\n    case klass_state::loaded: {\n        state = klass_state::initialized;\n        auto clinit = lookup_method(\"<clinit>\", \"()V\");\n        if (clinit) {\n            auto thread = hornet::thread::current();\n            auto new_frame = thread->make_frame(0);\n            hornet::_backend->execute(clinit.get(), *new_frame);\n            thread->free_frame(new_frame);\n        }\n        break;\n    }\n    case klass_state::initialized:\n        break;\n    }\n}\n\nbool klass::verify()\n{\n    for (auto method : _methods) {\n        if (!verify_method(method))\n            return false;\n    }\n    return true;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QCoreApplication>\n\nint main(int argc, char *argv[])\n{\n    QCoreApplication a(argc, argv);\n\n    return a.exec();\n}\n<commit_msg>agregando codigo<commit_after>#include \"stdafx.h\"\n#include \"cv.h\"\n#include \"cvaux.h\"\n#include \"highgui.h\"\n#include <stdio.h>\n\nint main()\n{\n    char name0[] = \"\/home\/mrc\/ProyectosQt\/Guda\/Ejercicio1\/Ejercicio1\/img\/1.jpg\";\n    char name1[] = \"\/home\/mrc\/ProyectosQt\/Guda\/Ejercicio1\/Ejercicio1\/img\/resized.jpg\";\n    char name2[] = \"\/home\/mrc\/ProyectosQt\/Guda\/Ejercicio1\/Ejercicio1\/img\/corte.jpg\";\";\n    float dx = 2;\n    float dy = 2;\n    int deltax = 50;\n    int deltay = 50;\n    int i = 0, j = 0, R = 0, G = 0, B = 0;\n\n    CvScalar s;\n    CvRect faceCoords;\n    IplImage* imagen = NULL;\n    IplImage* faceImagen = NULL;\n    imagen = cvLoadImage(name0, 1);\n    cvNamedWindow(\"Fuente\", 1);\n    cvShowImage(\"Fuente\", imagen);\n}\n<|endoftext|>"}
{"text":"<commit_before>## This file is a template.  The comment below is emitted\n## into the rendered file; feel free to edit this file.\n\/\/ WARNING: Generated header. Do not edit!\n<%\nimport re\nfrom collections import defaultdict\nfrom sdbusplus.namedelement import NamedElement\nobjects = settingsDict.keys()\nsdbusplus_includes = []\nprops = defaultdict(list)\nvalidators = defaultdict(tuple)\n\ndef get_setting_sdbusplus_type(setting_intf):\n    setting = \"sdbusplus::\" + setting_intf.replace('.', '::')\n    i = setting.rfind('::')\n    setting = setting[:i] + '::server::' + setting[i+2:]\n    return setting\n\ndef get_setting_type(path):\n    path = path[1:]\n    path = path.replace('\/', '::')\n    return path\n%>\\\n#pragma once\n\n% for object in objects:\n    % for item in settingsDict[object]:\n<%\n    include = item['Interface']\n    include = include.replace('.', '\/')\n    include = include + \"\/server.hpp\"\n    sdbusplus_includes.append(include)\n%>\\\n    % endfor\n% endfor\n#include <cereal\/archives\/json.hpp>\n#include <cereal\/types\/vector.hpp>\n#include <fstream>\n#include <utility>\n#include <experimental\/filesystem>\n#include <regex>\n#include <phosphor-logging\/elog.hpp>\n#include <phosphor-logging\/elog-errors.hpp>\n#include <phosphor-logging\/log.hpp>\n#include \"config.h\"\n#include <xyz\/openbmc_project\/Common\/error.hpp>\nusing namespace phosphor::logging;\n\n% for i in set(sdbusplus_includes):\n#include \"${i}\"\n% endfor\n\nnamespace phosphor\n{\nnamespace settings\n{\n\nnamespace fs = std::experimental::filesystem;\n\nnamespace persistent\n{\n\n\/\/ A setting d-bus object \/foo\/bar\/baz is persisted in the filesystem with the\n\/\/ same path. This eases re-construction of settings objects when we restore\n\/\/ from the filesystem. This can be a problem though when you have two objects\n\/\/ such as - \/foo\/bar and \/foo\/bar\/baz. This is because 'bar' will be treated as\n\/\/ a file in the first case, and a subdir in the second. To solve this, suffix\n\/\/ files with a trailing __. The __ is a safe character sequence to use, because\n\/\/ we won't have d-bus object paths ending with this.\n\/\/ With this the objects would be persisted as - \/foo\/bar__ and \/foo\/bar\/baz__.\nconstexpr auto fileSuffix = \"__\";\n\n}\n\n% for object in objects:\n<%\n   ns = object.split('\/')\n   ns.pop(0)\n%>\\\n% for n in ns:\nnamespace ${n}\n{\n% endfor\n<%\n    interfaces = []\n    aliases = []\n    for item in settingsDict[object]:\n        interfaces.append(item['Interface'])\n        for name, meta in item['Properties'].items():\n            if 'Validation' in meta:\n                dict = meta['Validation']\n                if dict['Type'] == \"range\":\n                    validators[name] = (dict['Type'], dict['Validator'], dict['Unit'])\n                else:\n                    validators[name] = (dict['Type'], dict['Validator'])\n%>\n% for index, intf in enumerate(interfaces):\nusing Iface${index} = ${get_setting_sdbusplus_type(intf)};\n<% aliases.append(\"Iface\" + str(index)) %>\\\n% endfor\n<%\n    parent = \"sdbusplus::server::object::object\" + \"<\" + \", \".join(aliases) + \">\"\n%>\\\nusing Parent = ${parent};\n\nclass Impl : public Parent\n{\n    public:\n        Impl(sdbusplus::bus::bus& bus, const char* path):\n            Parent(bus, path, true),\n            path(path)\n        {\n        }\n        virtual ~Impl() = default;\n\n% for index, item in enumerate(settingsDict[object]):\n    % for propName, metaDict in item['Properties'].items():\n<% t = NamedElement(name=propName).camelCase %>\\\n<% fname = \"validate\" + propName %>\\\n        decltype(std::declval<Iface${index}>().${t}()) ${t}(decltype(std::declval<Iface${index}>().${t}()) value) override\n        {\n            auto result = Iface${index}::${t}();\n            if (value != result)\n            {\n            % if propName in validators:\n                if (!${fname}(value))\n                {\n                    namespace error =\n                        sdbusplus::xyz::openbmc_project::Common::Error;\n                    namespace metadata =\n                        phosphor::logging::xyz::openbmc_project::Common;\n                    phosphor::logging::report<error::InvalidArgument>(\n                        metadata::InvalidArgument::ARGUMENT_NAME(\"${t}\"),\n                    % if validators[propName][0] != \"regex\":\n                        metadata::InvalidArgument::ARGUMENT_VALUE(std::to_string(value).c_str()));\n                    % else:\n                        metadata::InvalidArgument::ARGUMENT_VALUE(value.c_str()));\n                    % endif\n                    return result;\n                }\n             % endif\n                fs::path p(SETTINGS_PERSIST_PATH);\n                p \/= path;\n                p += persistent::fileSuffix;\n                fs::create_directories(p.parent_path());\n                std::ofstream os(p.c_str(), std::ios::binary);\n                cereal::JSONOutputArchive oarchive(os);\n                result = Iface${index}::${t}(value);\n                oarchive(*this);\n            }\n            return result;\n        }\n        using Iface${index}::${t};\n\n    % endfor\n% endfor\n    private:\n        fs::path path;\n% for index, item in enumerate(settingsDict[object]):\n  % for propName, metaDict in item['Properties'].items():\n<% t = NamedElement(name=propName).camelCase %>\\\n<% fname = \"validate\" + propName %>\\\n    % if propName in validators:\n\n        bool ${fname}(decltype(std::declval<Iface${index}>().${t}()) value)\n        {\n            bool matched = false;\n        % if (validators[propName][0] == 'regex'):\n            std::regex regexToCheck(\"${validators[propName][1]}\");\n            matched = std::regex_search(value, regexToCheck);\n            if (!matched)\n            {\n                std::string err = \"Input parameter for ${propName} is invalid \"\n                    \"Input: \" + value + \" not in the format of this regex: \"\n                    \"${validators[propName][1]}\";\n                using namespace phosphor::logging;\n                log<level::ERR>(err.c_str());\n            }\n        % elif (validators[propName][0] == 'range'):\n<% lowhigh = re.split('\\.\\.', validators[propName][1]) %>\\\n            if ((value <= ${lowhigh[1]}) && (value >= ${lowhigh[0]}))\n            {\n                matched = true;\n            }\n            else\n            {\n                std::string err = \"Input parameter for ${propName} is invalid \"\n                    \"Input: \" + std::to_string(value) + \"in uint: \"\n                    \"${validators[propName][2]} is not in range:${validators[propName][1]}\";\n                using namespace phosphor::logging;\n                log<level::ERR>(err.c_str());\n            }\n        % else:\n            <% assert(\"Unknown validation type: propName\") %>\\\n        % endif\n            return matched;\n        }\n    % endif\n  % endfor\n% endfor\n};\n\ntemplate<class Archive>\nvoid save(Archive& a,\n          const Impl& setting,\n          const std::uint32_t version)\n{\n<%\nprops = []\nfor index, item in enumerate(settingsDict[object]):\n    intfProps = [\"setting.\" + NamedElement(name=propName).camelCase + \"()\" for \\\n                    propName, metaDict in item['Properties'].items()]\n    props.extend(intfProps)\nprops = ', '.join(props)\n%>\\\n    a(${props});\n}\n\ntemplate<class Archive>\nvoid load(Archive& a,\n          Impl& setting,\n          const std::uint32_t version)\n{\n<% props = [] %>\\\n% for index, item in enumerate(settingsDict[object]):\n  % for  prop, metaDict in item['Properties'].items():\n<%\n    t = \"setting.\" + NamedElement(name=prop).camelCase + \"()\"\n    props.append(prop)\n%>\\\n    decltype(${t}) ${prop}{};\n  % endfor\n% endfor\n<% props = ', '.join(props) %>\n    a(${props});\n<% props = [] %>\n% for index, item in enumerate(settingsDict[object]):\n  % for  prop, metaDict in item['Properties'].items():\n<%\n    t = \"setting.\" + NamedElement(name=prop).camelCase + \"(\" + prop + \")\"\n%>\\\n    ${t};\n  % endfor\n% endfor\n}\n\n% for n in reversed(ns):\n} \/\/ namespace ${n}\n% endfor\n\n% endfor\n\n\/** @class Manager\n *\n *  @brief Compose settings objects and put them on the bus.\n *\/\nclass Manager\n{\n    public:\n        Manager() = delete;\n        Manager(const Manager&) = delete;\n        Manager& operator=(const Manager&) = delete;\n        Manager(Manager&&) = delete;\n        Manager& operator=(Manager&&) = delete;\n        virtual ~Manager() = default;\n\n        \/** @brief Constructor to put settings objects on to the bus.\n         *  @param[in] bus - Bus to attach to.\n         *\/\n        Manager(sdbusplus::bus::bus& bus)\n        {\n            fs::path path{};\n            settings =\n                std::make_tuple(\n% for index, path in enumerate(objects):\n<% type = get_setting_type(path) + \"::Impl\" %>\\\n                    std::make_unique<${type}>(\n                        bus,\n  % if index < len(settingsDict) - 1:\n                        \"${path}\"),\n  % else:\n                        \"${path}\"));\n  % endif\n% endfor\n\n% for index, path in enumerate(objects):\n            path = fs::path(SETTINGS_PERSIST_PATH) \/ \"${path}\";\n            path += persistent::fileSuffix;\n            auto initSetting${index} = [&]()\n            {\n  % for item in settingsDict[path]:\n    % for propName, metaDict in item['Properties'].items():\n<% p = NamedElement(name=propName).camelCase %>\\\n<% defaultValue = metaDict['Default'] %>\\\n% if isinstance(defaultValue, str) and  not \\\n    defaultValue.startswith('\"') and '::' in defaultValue:\n<% ns = get_setting_sdbusplus_type(item['Interface'])\ni = ns.rfind('::')\ndefaultValue = \"{}::{}\".format(ns[:i], defaultValue)\n%>\\\n% endif\n                std::get<${index}>(settings)->\n                  ${get_setting_sdbusplus_type(item['Interface'])}::${p}(${defaultValue});\n  % endfor\n% endfor\n            };\n\n            try\n            {\n                if (fs::exists(path))\n                {\n                    std::ifstream is(path.c_str(), std::ios::in);\n                    cereal::JSONInputArchive iarchive(is);\n                    iarchive(*std::get<${index}>(settings));\n                }\n                else\n                {\n                    initSetting${index}();\n                }\n            }\n            catch (const cereal::Exception& e)\n            {\n                log<level::ERR>(e.what());\n                fs::remove(path);\n                initSetting${index}();\n            }\n            std::get<${index}>(settings)->emit_object_added();\n\n% endfor\n        }\n\n    private:\n        \/* @brief Composition of settings objects. *\/\n        std::tuple<\n% for index, path in enumerate(objects):\n<% type = get_setting_type(path) + \"::Impl\" %>\\\n  % if index < len(settingsDict) - 1:\n            std::unique_ptr<${type}>,\n  % else:\n            std::unique_ptr<${type}>> settings;\n  % endif\n% endfor\n};\n\n} \/\/ namespace settings\n} \/\/ namespace phosphor\n\n\/\/ Now register the class version with Cereal\n% for object in objects:\n<%\n   classname = \"phosphor::settings\"\n   ns = object.split('\/')\n   ns.pop(0)\n%>\\\n% for n in ns:\n<%\n    classname += \"::\" + n\n%>\\\n% endfor\nCEREAL_CLASS_VERSION(${classname + \"::Impl\"}, CLASS_VERSION);\n% endfor\n<commit_msg>mako: Support interfaces without property<commit_after>## This file is a template.  The comment below is emitted\n## into the rendered file; feel free to edit this file.\n\/\/ WARNING: Generated header. Do not edit!\n<%\nimport re\nfrom collections import defaultdict\nfrom sdbusplus.namedelement import NamedElement\nobjects = settingsDict.keys()\nsdbusplus_includes = []\nprops = defaultdict(list)\nvalidators = defaultdict(tuple)\n\ndef get_setting_sdbusplus_type(setting_intf):\n    setting = \"sdbusplus::\" + setting_intf.replace('.', '::')\n    i = setting.rfind('::')\n    setting = setting[:i] + '::server::' + setting[i+2:]\n    return setting\n\ndef get_setting_type(path):\n    path = path[1:]\n    path = path.replace('\/', '::')\n    return path\n%>\\\n#pragma once\n\n% for object in objects:\n    % for item in settingsDict[object]:\n<%\n    include = item['Interface']\n    include = include.replace('.', '\/')\n    include = include + \"\/server.hpp\"\n    sdbusplus_includes.append(include)\n%>\\\n    % endfor\n% endfor\n#include <cereal\/archives\/json.hpp>\n#include <cereal\/types\/vector.hpp>\n#include <fstream>\n#include <utility>\n#include <experimental\/filesystem>\n#include <regex>\n#include <phosphor-logging\/elog.hpp>\n#include <phosphor-logging\/elog-errors.hpp>\n#include <phosphor-logging\/log.hpp>\n#include \"config.h\"\n#include <xyz\/openbmc_project\/Common\/error.hpp>\nusing namespace phosphor::logging;\n\n% for i in set(sdbusplus_includes):\n#include \"${i}\"\n% endfor\n\nnamespace phosphor\n{\nnamespace settings\n{\n\nnamespace fs = std::experimental::filesystem;\n\nnamespace persistent\n{\n\n\/\/ A setting d-bus object \/foo\/bar\/baz is persisted in the filesystem with the\n\/\/ same path. This eases re-construction of settings objects when we restore\n\/\/ from the filesystem. This can be a problem though when you have two objects\n\/\/ such as - \/foo\/bar and \/foo\/bar\/baz. This is because 'bar' will be treated as\n\/\/ a file in the first case, and a subdir in the second. To solve this, suffix\n\/\/ files with a trailing __. The __ is a safe character sequence to use, because\n\/\/ we won't have d-bus object paths ending with this.\n\/\/ With this the objects would be persisted as - \/foo\/bar__ and \/foo\/bar\/baz__.\nconstexpr auto fileSuffix = \"__\";\n\n}\n\n% for object in objects:\n<%\n   ns = object.split('\/')\n   ns.pop(0)\n%>\\\n% for n in ns:\nnamespace ${n}\n{\n% endfor\n<%\n    interfaces = []\n    aliases = []\n    for item in settingsDict[object]:\n        interfaces.append(item['Interface'])\n        for name, meta in item['Properties'].items():\n            if 'Validation' in meta:\n                dict = meta['Validation']\n                if dict['Type'] == \"range\":\n                    validators[name] = (dict['Type'], dict['Validator'], dict['Unit'])\n                else:\n                    validators[name] = (dict['Type'], dict['Validator'])\n%>\n% for index, intf in enumerate(interfaces):\nusing Iface${index} = ${get_setting_sdbusplus_type(intf)};\n<% aliases.append(\"Iface\" + str(index)) %>\\\n% endfor\n<%\n    parent = \"sdbusplus::server::object::object\" + \"<\" + \", \".join(aliases) + \">\"\n%>\\\nusing Parent = ${parent};\n\nclass Impl : public Parent\n{\n    public:\n        Impl(sdbusplus::bus::bus& bus, const char* path):\n            Parent(bus, path, true),\n            path(path)\n        {\n        }\n        virtual ~Impl() = default;\n\n% for index, item in enumerate(settingsDict[object]):\n    % for propName, metaDict in item['Properties'].items():\n<% t = NamedElement(name=propName).camelCase %>\\\n<% fname = \"validate\" + propName %>\\\n        decltype(std::declval<Iface${index}>().${t}()) ${t}(decltype(std::declval<Iface${index}>().${t}()) value) override\n        {\n            auto result = Iface${index}::${t}();\n            if (value != result)\n            {\n            % if propName in validators:\n                if (!${fname}(value))\n                {\n                    namespace error =\n                        sdbusplus::xyz::openbmc_project::Common::Error;\n                    namespace metadata =\n                        phosphor::logging::xyz::openbmc_project::Common;\n                    phosphor::logging::report<error::InvalidArgument>(\n                        metadata::InvalidArgument::ARGUMENT_NAME(\"${t}\"),\n                    % if validators[propName][0] != \"regex\":\n                        metadata::InvalidArgument::ARGUMENT_VALUE(std::to_string(value).c_str()));\n                    % else:\n                        metadata::InvalidArgument::ARGUMENT_VALUE(value.c_str()));\n                    % endif\n                    return result;\n                }\n             % endif\n                fs::path p(SETTINGS_PERSIST_PATH);\n                p \/= path;\n                p += persistent::fileSuffix;\n                fs::create_directories(p.parent_path());\n                std::ofstream os(p.c_str(), std::ios::binary);\n                cereal::JSONOutputArchive oarchive(os);\n                result = Iface${index}::${t}(value);\n                oarchive(*this);\n            }\n            return result;\n        }\n        using Iface${index}::${t};\n\n    % endfor\n% endfor\n    private:\n        fs::path path;\n% for index, item in enumerate(settingsDict[object]):\n  % for propName, metaDict in item['Properties'].items():\n<% t = NamedElement(name=propName).camelCase %>\\\n<% fname = \"validate\" + propName %>\\\n    % if propName in validators:\n\n        bool ${fname}(decltype(std::declval<Iface${index}>().${t}()) value)\n        {\n            bool matched = false;\n        % if (validators[propName][0] == 'regex'):\n            std::regex regexToCheck(\"${validators[propName][1]}\");\n            matched = std::regex_search(value, regexToCheck);\n            if (!matched)\n            {\n                std::string err = \"Input parameter for ${propName} is invalid \"\n                    \"Input: \" + value + \" not in the format of this regex: \"\n                    \"${validators[propName][1]}\";\n                using namespace phosphor::logging;\n                log<level::ERR>(err.c_str());\n            }\n        % elif (validators[propName][0] == 'range'):\n<% lowhigh = re.split('\\.\\.', validators[propName][1]) %>\\\n            if ((value <= ${lowhigh[1]}) && (value >= ${lowhigh[0]}))\n            {\n                matched = true;\n            }\n            else\n            {\n                std::string err = \"Input parameter for ${propName} is invalid \"\n                    \"Input: \" + std::to_string(value) + \"in uint: \"\n                    \"${validators[propName][2]} is not in range:${validators[propName][1]}\";\n                using namespace phosphor::logging;\n                log<level::ERR>(err.c_str());\n            }\n        % else:\n            <% assert(\"Unknown validation type: propName\") %>\\\n        % endif\n            return matched;\n        }\n    % endif\n  % endfor\n% endfor\n};\n\ntemplate<class Archive>\nvoid save(Archive& a,\n          const Impl& setting,\n          const std::uint32_t version)\n{\n<%\nprops = []\nfor index, item in enumerate(settingsDict[object]):\n    intfProps = [\"setting.\" + NamedElement(name=propName).camelCase + \"()\" for \\\n                    propName, metaDict in item['Properties'].items()]\n    props.extend(intfProps)\nprops = ', '.join(props)\n%>\\\n% if props:\n    a(${props});\n% endif\n}\n\ntemplate<class Archive>\nvoid load(Archive& a,\n          Impl& setting,\n          const std::uint32_t version)\n{\n<% props = [] %>\\\n% for index, item in enumerate(settingsDict[object]):\n  % for  prop, metaDict in item['Properties'].items():\n<%\n    t = \"setting.\" + NamedElement(name=prop).camelCase + \"()\"\n    props.append(prop)\n%>\\\n    decltype(${t}) ${prop}{};\n  % endfor\n% endfor\n<% props = ', '.join(props) %>\n% if props:\n    a(${props});\n% endif\n\n<% props = [] %>\n% for index, item in enumerate(settingsDict[object]):\n  % for  prop, metaDict in item['Properties'].items():\n<%\n    t = \"setting.\" + NamedElement(name=prop).camelCase + \"(\" + prop + \")\"\n%>\\\n    ${t};\n  % endfor\n% endfor\n}\n\n% for n in reversed(ns):\n} \/\/ namespace ${n}\n% endfor\n\n% endfor\n\n\/** @class Manager\n *\n *  @brief Compose settings objects and put them on the bus.\n *\/\nclass Manager\n{\n    public:\n        Manager() = delete;\n        Manager(const Manager&) = delete;\n        Manager& operator=(const Manager&) = delete;\n        Manager(Manager&&) = delete;\n        Manager& operator=(Manager&&) = delete;\n        virtual ~Manager() = default;\n\n        \/** @brief Constructor to put settings objects on to the bus.\n         *  @param[in] bus - Bus to attach to.\n         *\/\n        Manager(sdbusplus::bus::bus& bus)\n        {\n            fs::path path{};\n            settings =\n                std::make_tuple(\n% for index, path in enumerate(objects):\n<% type = get_setting_type(path) + \"::Impl\" %>\\\n                    std::make_unique<${type}>(\n                        bus,\n  % if index < len(settingsDict) - 1:\n                        \"${path}\"),\n  % else:\n                        \"${path}\"));\n  % endif\n% endfor\n\n% for index, path in enumerate(objects):\n            path = fs::path(SETTINGS_PERSIST_PATH) \/ \"${path}\";\n            path += persistent::fileSuffix;\n            auto initSetting${index} = [&]()\n            {\n  % for item in settingsDict[path]:\n    % for propName, metaDict in item['Properties'].items():\n<% p = NamedElement(name=propName).camelCase %>\\\n<% defaultValue = metaDict['Default'] %>\\\n% if isinstance(defaultValue, str) and  not \\\n    defaultValue.startswith('\"') and '::' in defaultValue:\n<% ns = get_setting_sdbusplus_type(item['Interface'])\ni = ns.rfind('::')\ndefaultValue = \"{}::{}\".format(ns[:i], defaultValue)\n%>\\\n% endif\n                std::get<${index}>(settings)->\n                  ${get_setting_sdbusplus_type(item['Interface'])}::${p}(${defaultValue});\n  % endfor\n% endfor\n            };\n\n            try\n            {\n                if (fs::exists(path))\n                {\n                    std::ifstream is(path.c_str(), std::ios::in);\n                    cereal::JSONInputArchive iarchive(is);\n                    iarchive(*std::get<${index}>(settings));\n                }\n                else\n                {\n                    initSetting${index}();\n                }\n            }\n            catch (const cereal::Exception& e)\n            {\n                log<level::ERR>(e.what());\n                fs::remove(path);\n                initSetting${index}();\n            }\n            std::get<${index}>(settings)->emit_object_added();\n\n% endfor\n        }\n\n    private:\n        \/* @brief Composition of settings objects. *\/\n        std::tuple<\n% for index, path in enumerate(objects):\n<% type = get_setting_type(path) + \"::Impl\" %>\\\n  % if index < len(settingsDict) - 1:\n            std::unique_ptr<${type}>,\n  % else:\n            std::unique_ptr<${type}>> settings;\n  % endif\n% endfor\n};\n\n} \/\/ namespace settings\n} \/\/ namespace phosphor\n\n\/\/ Now register the class version with Cereal\n% for object in objects:\n<%\n   classname = \"phosphor::settings\"\n   ns = object.split('\/')\n   ns.pop(0)\n%>\\\n% for n in ns:\n<%\n    classname += \"::\" + n\n%>\\\n% endfor\nCEREAL_CLASS_VERSION(${classname + \"::Impl\"}, CLASS_VERSION);\n% endfor\n<|endoftext|>"}
{"text":"<commit_before>#include \"SysConfig.h\"\n#if(HAS_MPL3115A2)\n\n#include <CI2C.h>\n#include \"CMPL3115A2.h\"\n#include \"CTimer.h\"\n#include \"NDataManager.h\"\n\nnamespace\n{\n    CTimer mpl3115a2_report_timer;\n    CTimer mpl3115a2_sample_timer;\n\n\n    bool initalized = false;\n}\n\n\n\nCMPL3115A2::CMPL3115A2( CI2C *i2cInterfaceIn )\n    : m_mpl( i2cInterfaceIn )\n{\n\n}\n\nvoid CMPL3115A2::Initialize()\n{\n    Serial.println( \"MPL3115A2.Status:INIT;\" );\n\n    \/\/init process\n    mpl3115a2_sample_timer.Reset();\n    mpl3115a2_report_timer.Reset();\n\n\n    auto ret = m_mpl.Initialize();\n    if( ret != mpl3115a2::ERetCode::SUCCESS )\n    {\n        Serial.println( \"MPL3115A2.Status:INIT_FAILED\" );\n    }\n\n    Serial.println( \"MPL3115A2.Status:POST_INIT; \");\n}\n\nvoid CMPL3115A2::InitializeSensor()\n{\n    \/\/Attempt to init the sensor\n    auto ret = m_mpl.Initialize();\n    if( ret != mpl3115a2::ERetCode::SUCCESS )\n    {\n        Serial.println( \"MPL3115A2_INIT_STATUS:FAILED;\" );\n    }\n    else\n    {\n        Serial.println( \"MPL3115A2_INIT_STATUS:SUCCESS;\" );\n\n        \/\/Set the mode\n        m_mpl.SetMode( mpl3115a2::EMode::BAROMETER );\n\n        \/\/Set the over sample rate_div\n        m_mpl.SetOversampleRatio( mpl3115a2::EOversampleRatio::ORS_128 );\n\n        \/\/Enable event flags\n        m_mpl.EnableEventFlags();\n\n\n    }\n}\n\nvoid CMPL3115A2::Update( CCommand &commandIn )\n{\n    \/\/1 Hz\n    if( mpl3115a2_sample_timer.HasElapsed( 1000 ) )\n    {\n        if( !m_mpl.IsInitialized() )\n        {\n            \/\/Attempt to init every 5 seconds\n            if( mpl3115a2_report_timer.HasElapsed( 5000 ) )\n            {\n                Serial.println( \"MPL3115A2.Status:TRYING;\" );\n                InitializeSensor();\n            }\n            return;\n        }\n        else\n        {\n            Serial.println( \"MPL3115A2.Status:RUNNING;\" );\n            float pressure;\n            auto ret = m_mpl.ReadPressure(pressure);\n\n            if( ret != mpl3115a2::ERetCode::SUCCESS )\n            {\n                Serial.println( \"MPL3115A2.Status:FAILED_READ;\" );\n            }\n\n            Serial.print( \"MPL3115A2.Value.Pressure: \" );\n            Serial.print( pressure );\n            Serial.println( \";\" );\n        }\n    }\n    \n}\n\n#endif<commit_msg>More expressive error code<commit_after>#include \"SysConfig.h\"\n#if(HAS_MPL3115A2)\n\n#include <CI2C.h>\n#include \"CMPL3115A2.h\"\n#include \"CTimer.h\"\n#include \"NDataManager.h\"\n\nnamespace\n{\n    CTimer mpl3115a2_report_timer;\n    CTimer mpl3115a2_sample_timer;\n\n\n    bool initalized = false;\n}\n\n\n\nCMPL3115A2::CMPL3115A2( CI2C *i2cInterfaceIn )\n    : m_mpl( i2cInterfaceIn )\n{\n\n}\n\nvoid CMPL3115A2::Initialize()\n{\n    Serial.println( \"MPL3115A2.Status:INIT;\" );\n\n    \/\/init process\n    mpl3115a2_sample_timer.Reset();\n    mpl3115a2_report_timer.Reset();\n\n\n    auto ret = m_mpl.Initialize();\n    if( ret != mpl3115a2::ERetCode::SUCCESS )\n    {\n        Serial.println( \"MPL3115A2.Status:INIT_FAILED\" );\n    }\n\n    Serial.println( \"MPL3115A2.Status:POST_INIT; \");\n}\n\nvoid CMPL3115A2::InitializeSensor()\n{\n    \/\/Attempt to init the sensor\n    auto ret = m_mpl.Initialize();\n    if( ret != mpl3115a2::ERetCode::SUCCESS )\n    {\n        Serial.println( \"MPL3115A2_INIT_STATUS:FAILED;\" );\n    }\n    else\n    {\n        Serial.println( \"MPL3115A2_INIT_STATUS:SUCCESS;\" );\n\n        \/\/Set the mode\n        m_mpl.SetMode( mpl3115a2::EMode::BAROMETER );\n\n        \/\/Set the over sample rate_div\n        m_mpl.SetOversampleRatio( mpl3115a2::EOversampleRatio::ORS_128 );\n\n        \/\/Enable event flags\n        m_mpl.EnableEventFlags();\n\n\n    }\n}\n\nvoid CMPL3115A2::Update( CCommand &commandIn )\n{\n    \/\/1 Hz\n    if( mpl3115a2_sample_timer.HasElapsed( 1000 ) )\n    {\n        if( !m_mpl.IsInitialized() )\n        {\n            \/\/Attempt to init every 5 seconds\n            if( mpl3115a2_report_timer.HasElapsed( 5000 ) )\n            {\n                Serial.println( \"MPL3115A2.Status:TRYING;\" );\n                InitializeSensor();\n            }\n            return;\n        }\n        else\n        {\n            Serial.println( \"MPL3115A2.Status:RUNNING;\" );\n            float pressure;\n            auto ret = m_mpl.ReadPressure(pressure);\n\n            if( ret != mpl3115a2::ERetCode::SUCCESS )\n            {\n                Serial.println( \"MPL3115A2.Status:FAILED_READ;\" );\n                Serial.print( \"REASON: \");\n                Serial.print( ret );\n                Serial.println( \";\" );\n            }\n\n            Serial.print( \"MPL3115A2.Value.Pressure: \" );\n            Serial.print( pressure );\n            Serial.println( \";\" );\n        }\n    }\n    \n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*\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#ifndef __IO_DEVICE_HH__\n#define __IO_DEVICE_HH__\n\n#include \"mem\/functional_mem\/functional_memory.hh\"\n\nclass BaseInterface;\nclass Bus;\nclass HierParams;\ntemplate <class Bus> class DMAInterface;\n\nclass PioDevice : public FunctionalMemory\n{\n  protected:\n    BaseInterface *pioInterface;\n    Tick pioLatency;\n\n  public:\n    PioDevice(const std::string &name);\n    virtual ~PioDevice();\n};\n\nclass DmaDevice : public PioDevice\n{\n  protected:\n    DMAInterface<Bus> *dmaInterface;\n\n  public:\n    DmaDevice(const std::string &name);\n    virtual ~DmaDevice();\n};\n\n#endif \/\/ __IO_DEVICE_HH__\n<commit_msg>Change Bus template parameter to BusType (to avoid confusion with Bus class). Change Mem template parameter to MemType while we're at it.<commit_after>\/*\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#ifndef __IO_DEVICE_HH__\n#define __IO_DEVICE_HH__\n\n#include \"mem\/functional_mem\/functional_memory.hh\"\n\nclass BaseInterface;\nclass Bus;\nclass HierParams;\ntemplate <class BusType> class DMAInterface;\n\nclass PioDevice : public FunctionalMemory\n{\n  protected:\n    BaseInterface *pioInterface;\n    Tick pioLatency;\n\n  public:\n    PioDevice(const std::string &name);\n    virtual ~PioDevice();\n};\n\nclass DmaDevice : public PioDevice\n{\n  protected:\n    DMAInterface<Bus> *dmaInterface;\n\n  public:\n    DmaDevice(const std::string &name);\n    virtual ~DmaDevice();\n};\n\n#endif \/\/ __IO_DEVICE_HH__\n<|endoftext|>"}
{"text":"<commit_before>#include \"Runtime\/World\/CAiFuncMap.hpp\"\n\n#include \"Runtime\/CStateManager.hpp\"\n#include \"Runtime\/World\/CAi.hpp\"\n\nnamespace urde {\nCAiFuncMap::CAiFuncMap() {\n  \/* Ai States *\/\n  x0_stateFuncs.emplace(\"Patrol\", &CAi::Patrol);\n  x0_stateFuncs.emplace(\"FollowPattern\", &CAi::FollowPattern);\n  x0_stateFuncs.emplace(\"Dead\", &CAi::Dead);\n  x0_stateFuncs.emplace(\"PathFind\", &CAi::PathFind);\n  x0_stateFuncs.emplace(\"Start\", &CAi::Start);\n  x0_stateFuncs.emplace(\"SelectTarget\", &CAi::SelectTarget);\n  x0_stateFuncs.emplace(\"TargetPatrol\", &CAi::TargetPatrol);\n  x0_stateFuncs.emplace(\"TargetPlayer\", &CAi::TargetPlayer);\n  x0_stateFuncs.emplace(\"TargetCover\", &CAi::TargetCover);\n  x0_stateFuncs.emplace(\"Halt\", &CAi::Halt);\n  x0_stateFuncs.emplace(\"Walk\", &CAi::Walk);\n  x0_stateFuncs.emplace(\"Run\", &CAi::Run);\n  x0_stateFuncs.emplace(\"Generate\", &CAi::Generate);\n  x0_stateFuncs.emplace(\"Deactivate\", &CAi::Deactivate);\n  x0_stateFuncs.emplace(\"Attack\", &CAi::Attack);\n  x0_stateFuncs.emplace(\"LoopedAttack\", &CAi::LoopedAttack);\n  x0_stateFuncs.emplace(\"JumpBack\", &CAi::JumpBack);\n  x0_stateFuncs.emplace(\"DoubleSnap\", &CAi::DoubleSnap);\n  x0_stateFuncs.emplace(\"Shuffle\", &CAi::Shuffle);\n  x0_stateFuncs.emplace(\"TurnAround\", &CAi::TurnAround);\n  x0_stateFuncs.emplace(\"Skid\", &CAi::Skid);\n  x0_stateFuncs.emplace(\"Active\", &CAi::Active);\n  x0_stateFuncs.emplace(\"InActive\", &CAi::InActive);\n  x0_stateFuncs.emplace(\"CoverAttack\", &CAi::CoverAttack);\n  x0_stateFuncs.emplace(\"Crouch\", &CAi::Crouch);\n  x0_stateFuncs.emplace(\"FadeIn\", &CAi::FadeIn);\n  x0_stateFuncs.emplace(\"FadeOut\", &CAi::FadeOut);\n  x0_stateFuncs.emplace(\"GetUp\", &CAi::GetUp);\n  x0_stateFuncs.emplace(\"Taunt\", &CAi::Taunt);\n  x0_stateFuncs.emplace(\"Suck\", &CAi::Suck);\n  x0_stateFuncs.emplace(\"Flee\", &CAi::Flee);\n  x0_stateFuncs.emplace(\"Lurk\", &CAi::Lurk);\n  x0_stateFuncs.emplace(\"ProjectileAttack\", &CAi::ProjectileAttack);\n  x0_stateFuncs.emplace(\"Flinch\", &CAi::Flinch);\n  x0_stateFuncs.emplace(\"Hurled\", &CAi::Hurled);\n  x0_stateFuncs.emplace(\"TelegraphAttack\", &CAi::TelegraphAttack);\n  x0_stateFuncs.emplace(\"Jump\", &CAi::Jump);\n  x0_stateFuncs.emplace(\"Explode\", &CAi::Explode);\n  x0_stateFuncs.emplace(\"Dodge\", &CAi::Dodge);\n  x0_stateFuncs.emplace(\"Retreat\", &CAi::Retreat);\n  x0_stateFuncs.emplace(\"Cover\", &CAi::Cover);\n  x0_stateFuncs.emplace(\"Approach\", &CAi::Approach);\n  x0_stateFuncs.emplace(\"WallHang\", &CAi::WallHang);\n  x0_stateFuncs.emplace(\"WallDetach\", &CAi::WallDetach);\n  x0_stateFuncs.emplace(\"Enraged\", &CAi::Enraged);\n  x0_stateFuncs.emplace(\"SpecialAttack\", &CAi::SpecialAttack);\n  x0_stateFuncs.emplace(\"Growth\", &CAi::Growth);\n  x0_stateFuncs.emplace(\"Faint\", &CAi::Faint);\n  x0_stateFuncs.emplace(\"Land\", &CAi::Land);\n  x0_stateFuncs.emplace(\"Bounce\", &CAi::Bounce);\n  x0_stateFuncs.emplace(\"PathFindEx\", &CAi::PathFindEx);\n  x0_stateFuncs.emplace(\"Dizzy\", &CAi::Dizzy);\n  x0_stateFuncs.emplace(\"CallForBackup\", &CAi::CallForBackup);\n  x0_stateFuncs.emplace(\"BulbAttack\", &CAi::BulbAttack);\n  x0_stateFuncs.emplace(\"PodAttack\", &CAi::PodAttack);\n\n  \/* Ai Triggers *\/\n  x10_triggerFuncs.emplace(\"InAttackPosition\", &CAi::InAttackPosition);\n  x10_triggerFuncs.emplace(\"Leash\", &CAi::Leash);\n  x10_triggerFuncs.emplace(\"OffLine\", &CAi::OffLine);\n  x10_triggerFuncs.emplace(\"Attacked\", &CAi::Attacked);\n  x10_triggerFuncs.emplace(\"PathShagged\", &CAi::PathShagged);\n  x10_triggerFuncs.emplace(\"PathOver\", &CAi::PathOver);\n  x10_triggerFuncs.emplace(\"PathFound\", &CAi::PathFound);\n  x10_triggerFuncs.emplace(\"TooClose\", &CAi::TooClose);\n  x10_triggerFuncs.emplace(\"InRange\", &CAi::InRange);\n  x10_triggerFuncs.emplace(\"InMaxRange\", &CAi::InMaxRange);\n  x10_triggerFuncs.emplace(\"InDetectionRange\", &CAi::InDetectionRange);\n  x10_triggerFuncs.emplace(\"SpotPlayer\", &CAi::SpotPlayer);\n  x10_triggerFuncs.emplace(\"PlayerSpot\", &CAi::PlayerSpot);\n  x10_triggerFuncs.emplace(\"PatternOver\", &CAi::PatternOver);\n  x10_triggerFuncs.emplace(\"PatternShagged\", &CAi::PatternShagged);\n  x10_triggerFuncs.emplace(\"HasAttackPattern\", &CAi::HasAttackPattern);\n  x10_triggerFuncs.emplace(\"HasPatrolPath\", &CAi::HasPatrolPath);\n  x10_triggerFuncs.emplace(\"HasRetreatPattern\", &CAi::HasRetreatPattern);\n  x10_triggerFuncs.emplace(\"Delay\", &CAi::Delay);\n  x10_triggerFuncs.emplace(\"RandomDelay\", &CAi::RandomDelay);\n  x10_triggerFuncs.emplace(\"FixedDelay\", &CAi::FixedDelay);\n  x10_triggerFuncs.emplace(\"Default\", &CAi::Default);\n  x10_triggerFuncs.emplace(\"AnimOver\", &CAi::AnimOver);\n  x10_triggerFuncs.emplace(\"ShouldAttack\", &CAi::ShouldAttack);\n  x10_triggerFuncs.emplace(\"ShouldDoubleSnap\", &CAi::ShouldDoubleSnap);\n  x10_triggerFuncs.emplace(\"InPosition\", &CAi::InPosition);\n  x10_triggerFuncs.emplace(\"ShouldTurn\", &CAi::ShouldTurn);\n  x10_triggerFuncs.emplace(\"HitSomething\", &CAi::HitSomething);\n  x10_triggerFuncs.emplace(\"ShouldJumpBack\", &CAi::ShouldJumpBack);\n  x10_triggerFuncs.emplace(\"Stuck\", &CAi::Stuck);\n  x10_triggerFuncs.emplace(\"NoPathNodes\", &CAi::NoPathNodes);\n  x10_triggerFuncs.emplace(\"Landed\", &CAi::Landed);\n  x10_triggerFuncs.emplace(\"HearShot\", &CAi::HearShot);\n  x10_triggerFuncs.emplace(\"HearPlayer\", &CAi::HearPlayer);\n  x10_triggerFuncs.emplace(\"CoverCheck\", &CAi::CoverCheck);\n  x10_triggerFuncs.emplace(\"CoverFind\", &CAi::CoverFind);\n  x10_triggerFuncs.emplace(\"CoverBlown\", &CAi::CoverBlown);\n  x10_triggerFuncs.emplace(\"CoverNearlyBlown\", &CAi::CoverNearlyBlown);\n  x10_triggerFuncs.emplace(\"CoveringFire\", &CAi::CoveringFire);\n  x10_triggerFuncs.emplace(\"GotUp\", &CAi::GotUp);\n  x10_triggerFuncs.emplace(\"LineOfSight\", &CAi::LineOfSight);\n  x10_triggerFuncs.emplace(\"AggressionCheck\", &CAi::AggressionCheck);\n  x10_triggerFuncs.emplace(\"AttackOver\", &CAi::AttackOver);\n  x10_triggerFuncs.emplace(\"ShouldTaunt\", &CAi::ShouldTaunt);\n  x10_triggerFuncs.emplace(\"Inside\", &CAi::Inside);\n  x10_triggerFuncs.emplace(\"ShouldFire\", &CAi::ShouldFire);\n  x10_triggerFuncs.emplace(\"ShouldFlinch\", &CAi::ShouldFlinch);\n  x10_triggerFuncs.emplace(\"PatrolPathOver\", &CAi::PatrolPathOver);\n  x10_triggerFuncs.emplace(\"ShouldDodge\", &CAi::ShouldDodge);\n  x10_triggerFuncs.emplace(\"ShouldRetreat\", &CAi::ShouldRetreat);\n  x10_triggerFuncs.emplace(\"ShouldCrouch\", &CAi::ShouldCrouch);\n  x10_triggerFuncs.emplace(\"ShouldMove\", &CAi::ShouldMove);\n  x10_triggerFuncs.emplace(\"ShotAt\", &CAi::ShotAt);\n  x10_triggerFuncs.emplace(\"HasTargetingPoint\", &CAi::HasTargetingPoint);\n  x10_triggerFuncs.emplace(\"ShouldWallHang\", &CAi::ShouldWallHang);\n  x10_triggerFuncs.emplace(\"SetAIStage\", &CAi::SetAIStage);\n  x10_triggerFuncs.emplace(\"AIStage\", &CAi::AIStage);\n  x10_triggerFuncs.emplace(\"StartAttack\", &CAi::StartAttack);\n  x10_triggerFuncs.emplace(\"BreakAttack\", &CAi::BreakAttack);\n  x10_triggerFuncs.emplace(\"ShouldStrafe\", &CAi::ShouldStrafe);\n  x10_triggerFuncs.emplace(\"ShouldSpecialAttack\", &CAi::ShouldSpecialAttack);\n  x10_triggerFuncs.emplace(\"LostInterest\", &CAi::LostInterest);\n  x10_triggerFuncs.emplace(\"CodeTrigger\", &CAi::CodeTrigger);\n  x10_triggerFuncs.emplace(\"BounceFind\", &CAi::BounceFind);\n  x10_triggerFuncs.emplace(\"Random\", &CAi::Random);\n  x10_triggerFuncs.emplace(\"FixedRandom\", &CAi::FixedRandom);\n  x10_triggerFuncs.emplace(\"IsDizzy\", &CAi::IsDizzy);\n  x10_triggerFuncs.emplace(\"ShouldCallForBackup\", &CAi::ShouldCallForBackup);\n\n  CAi::CreateFuncLookup(this);\n}\n\nCAiStateFunc CAiFuncMap::GetStateFunc(const char* func) const {\n  const auto iter = x0_stateFuncs.find(func);\n\n  if (iter == x0_stateFuncs.cend()) {\n    return nullptr;\n  }\n\n  return iter->second;\n}\n\nCAiTriggerFunc CAiFuncMap::GetTriggerFunc(const char* func) const {\n  const auto iter = x10_triggerFuncs.find(func);\n\n  if (iter == x10_triggerFuncs.cend()) {\n    return nullptr;\n  }\n\n  return iter->second;\n}\n} \/\/ namespace urde\n<commit_msg>CAiFuncMap: Reserve containers before adding entries<commit_after>#include \"Runtime\/World\/CAiFuncMap.hpp\"\n\n#include \"Runtime\/CStateManager.hpp\"\n#include \"Runtime\/World\/CAi.hpp\"\n\nnamespace urde {\nCAiFuncMap::CAiFuncMap() {\n  \/* Ai States *\/\n  x0_stateFuncs.reserve(55);\n  x0_stateFuncs.emplace(\"Patrol\", &CAi::Patrol);\n  x0_stateFuncs.emplace(\"FollowPattern\", &CAi::FollowPattern);\n  x0_stateFuncs.emplace(\"Dead\", &CAi::Dead);\n  x0_stateFuncs.emplace(\"PathFind\", &CAi::PathFind);\n  x0_stateFuncs.emplace(\"Start\", &CAi::Start);\n  x0_stateFuncs.emplace(\"SelectTarget\", &CAi::SelectTarget);\n  x0_stateFuncs.emplace(\"TargetPatrol\", &CAi::TargetPatrol);\n  x0_stateFuncs.emplace(\"TargetPlayer\", &CAi::TargetPlayer);\n  x0_stateFuncs.emplace(\"TargetCover\", &CAi::TargetCover);\n  x0_stateFuncs.emplace(\"Halt\", &CAi::Halt);\n  x0_stateFuncs.emplace(\"Walk\", &CAi::Walk);\n  x0_stateFuncs.emplace(\"Run\", &CAi::Run);\n  x0_stateFuncs.emplace(\"Generate\", &CAi::Generate);\n  x0_stateFuncs.emplace(\"Deactivate\", &CAi::Deactivate);\n  x0_stateFuncs.emplace(\"Attack\", &CAi::Attack);\n  x0_stateFuncs.emplace(\"LoopedAttack\", &CAi::LoopedAttack);\n  x0_stateFuncs.emplace(\"JumpBack\", &CAi::JumpBack);\n  x0_stateFuncs.emplace(\"DoubleSnap\", &CAi::DoubleSnap);\n  x0_stateFuncs.emplace(\"Shuffle\", &CAi::Shuffle);\n  x0_stateFuncs.emplace(\"TurnAround\", &CAi::TurnAround);\n  x0_stateFuncs.emplace(\"Skid\", &CAi::Skid);\n  x0_stateFuncs.emplace(\"Active\", &CAi::Active);\n  x0_stateFuncs.emplace(\"InActive\", &CAi::InActive);\n  x0_stateFuncs.emplace(\"CoverAttack\", &CAi::CoverAttack);\n  x0_stateFuncs.emplace(\"Crouch\", &CAi::Crouch);\n  x0_stateFuncs.emplace(\"FadeIn\", &CAi::FadeIn);\n  x0_stateFuncs.emplace(\"FadeOut\", &CAi::FadeOut);\n  x0_stateFuncs.emplace(\"GetUp\", &CAi::GetUp);\n  x0_stateFuncs.emplace(\"Taunt\", &CAi::Taunt);\n  x0_stateFuncs.emplace(\"Suck\", &CAi::Suck);\n  x0_stateFuncs.emplace(\"Flee\", &CAi::Flee);\n  x0_stateFuncs.emplace(\"Lurk\", &CAi::Lurk);\n  x0_stateFuncs.emplace(\"ProjectileAttack\", &CAi::ProjectileAttack);\n  x0_stateFuncs.emplace(\"Flinch\", &CAi::Flinch);\n  x0_stateFuncs.emplace(\"Hurled\", &CAi::Hurled);\n  x0_stateFuncs.emplace(\"TelegraphAttack\", &CAi::TelegraphAttack);\n  x0_stateFuncs.emplace(\"Jump\", &CAi::Jump);\n  x0_stateFuncs.emplace(\"Explode\", &CAi::Explode);\n  x0_stateFuncs.emplace(\"Dodge\", &CAi::Dodge);\n  x0_stateFuncs.emplace(\"Retreat\", &CAi::Retreat);\n  x0_stateFuncs.emplace(\"Cover\", &CAi::Cover);\n  x0_stateFuncs.emplace(\"Approach\", &CAi::Approach);\n  x0_stateFuncs.emplace(\"WallHang\", &CAi::WallHang);\n  x0_stateFuncs.emplace(\"WallDetach\", &CAi::WallDetach);\n  x0_stateFuncs.emplace(\"Enraged\", &CAi::Enraged);\n  x0_stateFuncs.emplace(\"SpecialAttack\", &CAi::SpecialAttack);\n  x0_stateFuncs.emplace(\"Growth\", &CAi::Growth);\n  x0_stateFuncs.emplace(\"Faint\", &CAi::Faint);\n  x0_stateFuncs.emplace(\"Land\", &CAi::Land);\n  x0_stateFuncs.emplace(\"Bounce\", &CAi::Bounce);\n  x0_stateFuncs.emplace(\"PathFindEx\", &CAi::PathFindEx);\n  x0_stateFuncs.emplace(\"Dizzy\", &CAi::Dizzy);\n  x0_stateFuncs.emplace(\"CallForBackup\", &CAi::CallForBackup);\n  x0_stateFuncs.emplace(\"BulbAttack\", &CAi::BulbAttack);\n  x0_stateFuncs.emplace(\"PodAttack\", &CAi::PodAttack);\n\n  \/* Ai Triggers *\/\n  x10_triggerFuncs.reserve(68);\n  x10_triggerFuncs.emplace(\"InAttackPosition\", &CAi::InAttackPosition);\n  x10_triggerFuncs.emplace(\"Leash\", &CAi::Leash);\n  x10_triggerFuncs.emplace(\"OffLine\", &CAi::OffLine);\n  x10_triggerFuncs.emplace(\"Attacked\", &CAi::Attacked);\n  x10_triggerFuncs.emplace(\"PathShagged\", &CAi::PathShagged);\n  x10_triggerFuncs.emplace(\"PathOver\", &CAi::PathOver);\n  x10_triggerFuncs.emplace(\"PathFound\", &CAi::PathFound);\n  x10_triggerFuncs.emplace(\"TooClose\", &CAi::TooClose);\n  x10_triggerFuncs.emplace(\"InRange\", &CAi::InRange);\n  x10_triggerFuncs.emplace(\"InMaxRange\", &CAi::InMaxRange);\n  x10_triggerFuncs.emplace(\"InDetectionRange\", &CAi::InDetectionRange);\n  x10_triggerFuncs.emplace(\"SpotPlayer\", &CAi::SpotPlayer);\n  x10_triggerFuncs.emplace(\"PlayerSpot\", &CAi::PlayerSpot);\n  x10_triggerFuncs.emplace(\"PatternOver\", &CAi::PatternOver);\n  x10_triggerFuncs.emplace(\"PatternShagged\", &CAi::PatternShagged);\n  x10_triggerFuncs.emplace(\"HasAttackPattern\", &CAi::HasAttackPattern);\n  x10_triggerFuncs.emplace(\"HasPatrolPath\", &CAi::HasPatrolPath);\n  x10_triggerFuncs.emplace(\"HasRetreatPattern\", &CAi::HasRetreatPattern);\n  x10_triggerFuncs.emplace(\"Delay\", &CAi::Delay);\n  x10_triggerFuncs.emplace(\"RandomDelay\", &CAi::RandomDelay);\n  x10_triggerFuncs.emplace(\"FixedDelay\", &CAi::FixedDelay);\n  x10_triggerFuncs.emplace(\"Default\", &CAi::Default);\n  x10_triggerFuncs.emplace(\"AnimOver\", &CAi::AnimOver);\n  x10_triggerFuncs.emplace(\"ShouldAttack\", &CAi::ShouldAttack);\n  x10_triggerFuncs.emplace(\"ShouldDoubleSnap\", &CAi::ShouldDoubleSnap);\n  x10_triggerFuncs.emplace(\"InPosition\", &CAi::InPosition);\n  x10_triggerFuncs.emplace(\"ShouldTurn\", &CAi::ShouldTurn);\n  x10_triggerFuncs.emplace(\"HitSomething\", &CAi::HitSomething);\n  x10_triggerFuncs.emplace(\"ShouldJumpBack\", &CAi::ShouldJumpBack);\n  x10_triggerFuncs.emplace(\"Stuck\", &CAi::Stuck);\n  x10_triggerFuncs.emplace(\"NoPathNodes\", &CAi::NoPathNodes);\n  x10_triggerFuncs.emplace(\"Landed\", &CAi::Landed);\n  x10_triggerFuncs.emplace(\"HearShot\", &CAi::HearShot);\n  x10_triggerFuncs.emplace(\"HearPlayer\", &CAi::HearPlayer);\n  x10_triggerFuncs.emplace(\"CoverCheck\", &CAi::CoverCheck);\n  x10_triggerFuncs.emplace(\"CoverFind\", &CAi::CoverFind);\n  x10_triggerFuncs.emplace(\"CoverBlown\", &CAi::CoverBlown);\n  x10_triggerFuncs.emplace(\"CoverNearlyBlown\", &CAi::CoverNearlyBlown);\n  x10_triggerFuncs.emplace(\"CoveringFire\", &CAi::CoveringFire);\n  x10_triggerFuncs.emplace(\"GotUp\", &CAi::GotUp);\n  x10_triggerFuncs.emplace(\"LineOfSight\", &CAi::LineOfSight);\n  x10_triggerFuncs.emplace(\"AggressionCheck\", &CAi::AggressionCheck);\n  x10_triggerFuncs.emplace(\"AttackOver\", &CAi::AttackOver);\n  x10_triggerFuncs.emplace(\"ShouldTaunt\", &CAi::ShouldTaunt);\n  x10_triggerFuncs.emplace(\"Inside\", &CAi::Inside);\n  x10_triggerFuncs.emplace(\"ShouldFire\", &CAi::ShouldFire);\n  x10_triggerFuncs.emplace(\"ShouldFlinch\", &CAi::ShouldFlinch);\n  x10_triggerFuncs.emplace(\"PatrolPathOver\", &CAi::PatrolPathOver);\n  x10_triggerFuncs.emplace(\"ShouldDodge\", &CAi::ShouldDodge);\n  x10_triggerFuncs.emplace(\"ShouldRetreat\", &CAi::ShouldRetreat);\n  x10_triggerFuncs.emplace(\"ShouldCrouch\", &CAi::ShouldCrouch);\n  x10_triggerFuncs.emplace(\"ShouldMove\", &CAi::ShouldMove);\n  x10_triggerFuncs.emplace(\"ShotAt\", &CAi::ShotAt);\n  x10_triggerFuncs.emplace(\"HasTargetingPoint\", &CAi::HasTargetingPoint);\n  x10_triggerFuncs.emplace(\"ShouldWallHang\", &CAi::ShouldWallHang);\n  x10_triggerFuncs.emplace(\"SetAIStage\", &CAi::SetAIStage);\n  x10_triggerFuncs.emplace(\"AIStage\", &CAi::AIStage);\n  x10_triggerFuncs.emplace(\"StartAttack\", &CAi::StartAttack);\n  x10_triggerFuncs.emplace(\"BreakAttack\", &CAi::BreakAttack);\n  x10_triggerFuncs.emplace(\"ShouldStrafe\", &CAi::ShouldStrafe);\n  x10_triggerFuncs.emplace(\"ShouldSpecialAttack\", &CAi::ShouldSpecialAttack);\n  x10_triggerFuncs.emplace(\"LostInterest\", &CAi::LostInterest);\n  x10_triggerFuncs.emplace(\"CodeTrigger\", &CAi::CodeTrigger);\n  x10_triggerFuncs.emplace(\"BounceFind\", &CAi::BounceFind);\n  x10_triggerFuncs.emplace(\"Random\", &CAi::Random);\n  x10_triggerFuncs.emplace(\"FixedRandom\", &CAi::FixedRandom);\n  x10_triggerFuncs.emplace(\"IsDizzy\", &CAi::IsDizzy);\n  x10_triggerFuncs.emplace(\"ShouldCallForBackup\", &CAi::ShouldCallForBackup);\n\n  CAi::CreateFuncLookup(this);\n}\n\nCAiStateFunc CAiFuncMap::GetStateFunc(const char* func) const {\n  const auto iter = x0_stateFuncs.find(func);\n\n  if (iter == x0_stateFuncs.cend()) {\n    return nullptr;\n  }\n\n  return iter->second;\n}\n\nCAiTriggerFunc CAiFuncMap::GetTriggerFunc(const char* func) const {\n  const auto iter = x10_triggerFuncs.find(func);\n\n  if (iter == x10_triggerFuncs.cend()) {\n    return nullptr;\n  }\n\n  return iter->second;\n}\n} \/\/ namespace urde\n<|endoftext|>"}
{"text":"<commit_before>\/*++\n\nModule Name:\n\n    CommandProcessor.cpp\n\nAbstract:\n\n    Code for running the top-level commands of SNAP\n\nAuthors:\n\n    Bill Bolosky, November, 2014\n\nEnvironment:\n\nUser mode service.\n\nRevision History:\n\n    Pulled from the main program and expanded to handle daemon mode\n\n--*\/\n\n#include \"stdafx.h\"\n#include \"options.h\"\n#include \"FASTA.h\"\n#include \"GenomeIndex.h\"\n#include \"SingleAligner.h\"\n#include \"PairedAligner.h\"\n#include \"exit.h\"\n#include \"SeedSequencer.h\"\n#include \"AlignerOptions.h\"\n#include \"CommandProcessor.h\"\n#include \"Error.h\"\n#include \"Compat.h\"\n\nconst char *SNAP_VERSION = \"1.0dev.103\";\n\nstatic void usage()\n{\n\tWriteErrorMessage(\n\t\t\"Usage: snap-aligner <command> [<options>]\\n\"\n\t\t\"Commands:\\n\"\n\t\t\"   index    build a genome index\\n\"\n\t\t\"   single   align single-end reads\\n\"\n\t\t\"   paired   align paired-end reads\\n\"\n\t\t\"   daemon   run in daemon mode--accept commands remotely\\n\"\n\t\t\"Type a command without arguments to see its help.\\n\");\n}\n\nvoid ProcessNonDaemonCommands(int argc, const char **argv) {\n\tif (strcmp(argv[1], \"index\") == 0) {\n\t\tif (CommandPipe == NULL) {\n\t\t\tGenomeIndex::runIndexer(argc - 2, argv + 2);\n\t\t} else {\n\t\t\t\/\/\n\t\t\t\/\/ The error cases in index build don't really free memory properly, so we just don't allow it in daemon mode.\n\t\t\t\/\/\n\t\t\tWriteErrorMessage(\"The index command is not available in daemon mode.  Please run 'snap-aligner index' directly.\\n\");\n\t\t}\n\t} else if (strcmp(argv[1], \"single\") == 0 || strcmp(argv[1], \"paired\") == 0) {\n\t\tfor (int i = 1; i < argc; \/* i is increased below *\/) {\n\t\t\tunsigned nArgsConsumed;\n\t\t\tif (strcmp(argv[i], \"single\") == 0) {\n\t\t\t\tSingleAlignerContext single;\n\t\t\t\tsingle.runAlignment(argc - i, argv + i, SNAP_VERSION, &nArgsConsumed);\n\t\t\t} else if (strcmp(argv[i], \"paired\") == 0) {\n\t\t\t\tPairedAlignerContext paired;\n\t\t\t\tpaired.runAlignment(argc - i, argv + i, SNAP_VERSION, &nArgsConsumed);\n\t\t\t} else {\n\t\t\t\tfprintf(stderr, \"Invalid command: %s\\n\\n\", argv[i]);\n\t\t\t\tusage();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t_ASSERT(nArgsConsumed > 0);\n\t\t\ti += nArgsConsumed;\n\t\t}\n\t} else {\n\t\tWriteErrorMessage(\"Invalid command: %s\\n\\n\", argv[1]);\n\t\tusage();\n\t}\n}\n\nstatic void daemonUsage()\n{\n\tfprintf(stderr, \"Usage: snap-aligner daemon [Named pipe name]\\n\");\n\tsoft_exit_no_print(1);    \/\/ Don't use soft_exit, it's confusing people to get an \"error\" message after the usage\n}\n\nvoid RunDaemonMode(int argc, const char **argv)\n{\n\tif (argc < 2 || argc > 3) {\n\t\tdaemonUsage();\n\t}\n\n\tprintf(\"SNAP in daemon mode, waiting for commands to execute\\n\");\n\n\tconst char *pipeName = argc == 3 ? argv[2] : DEFAULT_NAMED_PIPE_NAME;\n\tCommandPipe = OpenNamedPipe(pipeName, true);\n\n\tif (NULL == CommandPipe) {\n\t\tWriteErrorMessage(\"Unable to open named pipe for command IO.\\n\");\n\t\tsoft_exit(1);\n\t}\n\n\tconst size_t commandBufferSize = 10000;\t\/\/ Yes, this is fixed size, no it's not a buffer overflow.  The named pipe reader just quits if it's too long.\n\tchar commandBuffer[commandBufferSize];\n\n\t\/\/\n\t\/\/ Format of commands is argc (in ascii) followed by argc arguments, each in one line.\n\t\/\/\n\tfor (;;) {\n\t\tif (!ReadFromNamedPipe(CommandPipe, commandBuffer, commandBufferSize)) {\n\t\t\tCloseNamedPipe(CommandPipe);\n\t\t\tCommandPipe = NULL;\n\t\t\tWriteStatusMessage(\"Named pipe closed.  Exiting\\n\");\n\t\t\tsoft_exit_no_print(0);\n\t\t}\n\n\t\tint argc = atoi(commandBuffer);\n\t\tif (0 == argc) {\n\t\t\tWriteErrorMessage(\"Expected argument count on named pipe, got '%s'; ignoring.\\n\", commandBuffer);\n\t\t} else {\n\t\t\tchar **argv = new char*[argc];\n\t\t\tfor (int i = 0; i < argc; i++) {\n\t\t\t\targv[i] = new char[commandBufferSize];\n\t\t\t\tif (!ReadFromNamedPipe(CommandPipe, argv[i], commandBufferSize)) {\n\t\t\t\t\tCloseNamedPipe(CommandPipe);\n\t\t\t\t\tCommandPipe = NULL;\n\t\t\t\t\tWriteStatusMessage(\"Error reading argument #%d from named pipe.\\n\", i);\n\t\t\t\t\tsoft_exit(1);\n\t\t\t\t}\n\t\t\t} \/\/ for each arg\n\n\t\t\tif (argc > 1 && strcmp(argv[1], \"exit\") == 0) {\n\t\t\t\tWriteStatusMessage(\"SNAP server exiting by request\\n\");\n\t\t\t\tWriteToNamedPipe(CommandPipe, CommandExecutedString);\n\t\t\t\tsoft_exit_no_print(1);\n\t\t\t}\n\n\t\t\tprintf(\"Executing command: \");\n\t\t\tfor (int i = 1; i < argc; i++) {\n\t\t\t\tprintf(\"%s \", argv[i]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\n\t\t\tProcessNonDaemonCommands(argc, (const char **) argv);\n\n\t\t\tprintf(\"\\n\");\n\n\t\t\tfor (int i = 0; i < argc; i++) {\n\t\t\t\tdelete[] argv[i];\n\t\t\t\targv[i] = NULL;\n\t\t\t}\n\t\t\tdelete[] argv;\n\t\t\targv = NULL;\n\t\t}\n\t\tWriteToNamedPipe(CommandPipe, CommandExecutedString);\n\t}\n}\n\nvoid ProcessTopLevelCommands(int argc, const char **argv)\n{\n\tfprintf(stderr, \"Welcome to SNAP version %s.\\n\\n\", SNAP_VERSION);       \/\/ Can't use WriteStatusMessage, because we haven't parsed args yet to determine if -hdp is specified.  Just stick with stderr.\n\n\tInitializeSeedSequencers();\n\n\tif (argc < 2) {\n\t\tusage();\n\t\tsoft_exit_no_print(1);\n\t}\n\n\tif (strcmp(argv[1], \"daemon\") == 0) {\n\t\tRunDaemonMode(argc, argv);\n\t} else {\n\t\tProcessNonDaemonCommands(argc, argv);\n\t}\n}\n\nNamedPipe *CommandPipe = NULL;\nconst char *CommandExecutedString = \"***SNAP Command completed execution***\";\n<commit_msg>1.0dev.104: update version number for release<commit_after>\/*++\n\nModule Name:\n\n    CommandProcessor.cpp\n\nAbstract:\n\n    Code for running the top-level commands of SNAP\n\nAuthors:\n\n    Bill Bolosky, November, 2014\n\nEnvironment:\n\nUser mode service.\n\nRevision History:\n\n    Pulled from the main program and expanded to handle daemon mode\n\n--*\/\n\n#include \"stdafx.h\"\n#include \"options.h\"\n#include \"FASTA.h\"\n#include \"GenomeIndex.h\"\n#include \"SingleAligner.h\"\n#include \"PairedAligner.h\"\n#include \"exit.h\"\n#include \"SeedSequencer.h\"\n#include \"AlignerOptions.h\"\n#include \"CommandProcessor.h\"\n#include \"Error.h\"\n#include \"Compat.h\"\n\nconst char *SNAP_VERSION = \"1.0dev.104\";\n\nstatic void usage()\n{\n\tWriteErrorMessage(\n\t\t\"Usage: snap-aligner <command> [<options>]\\n\"\n\t\t\"Commands:\\n\"\n\t\t\"   index    build a genome index\\n\"\n\t\t\"   single   align single-end reads\\n\"\n\t\t\"   paired   align paired-end reads\\n\"\n\t\t\"   daemon   run in daemon mode--accept commands remotely\\n\"\n\t\t\"Type a command without arguments to see its help.\\n\");\n}\n\nvoid ProcessNonDaemonCommands(int argc, const char **argv) {\n\tif (strcmp(argv[1], \"index\") == 0) {\n\t\tif (CommandPipe == NULL) {\n\t\t\tGenomeIndex::runIndexer(argc - 2, argv + 2);\n\t\t} else {\n\t\t\t\/\/\n\t\t\t\/\/ The error cases in index build don't really free memory properly, so we just don't allow it in daemon mode.\n\t\t\t\/\/\n\t\t\tWriteErrorMessage(\"The index command is not available in daemon mode.  Please run 'snap-aligner index' directly.\\n\");\n\t\t}\n\t} else if (strcmp(argv[1], \"single\") == 0 || strcmp(argv[1], \"paired\") == 0) {\n\t\tfor (int i = 1; i < argc; \/* i is increased below *\/) {\n\t\t\tunsigned nArgsConsumed;\n\t\t\tif (strcmp(argv[i], \"single\") == 0) {\n\t\t\t\tSingleAlignerContext single;\n\t\t\t\tsingle.runAlignment(argc - i, argv + i, SNAP_VERSION, &nArgsConsumed);\n\t\t\t} else if (strcmp(argv[i], \"paired\") == 0) {\n\t\t\t\tPairedAlignerContext paired;\n\t\t\t\tpaired.runAlignment(argc - i, argv + i, SNAP_VERSION, &nArgsConsumed);\n\t\t\t} else {\n\t\t\t\tfprintf(stderr, \"Invalid command: %s\\n\\n\", argv[i]);\n\t\t\t\tusage();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t_ASSERT(nArgsConsumed > 0);\n\t\t\ti += nArgsConsumed;\n\t\t}\n\t} else {\n\t\tWriteErrorMessage(\"Invalid command: %s\\n\\n\", argv[1]);\n\t\tusage();\n\t}\n}\n\nstatic void daemonUsage()\n{\n\tfprintf(stderr, \"Usage: snap-aligner daemon [Named pipe name]\\n\");\n\tsoft_exit_no_print(1);    \/\/ Don't use soft_exit, it's confusing people to get an \"error\" message after the usage\n}\n\nvoid RunDaemonMode(int argc, const char **argv)\n{\n\tif (argc < 2 || argc > 3) {\n\t\tdaemonUsage();\n\t}\n\n\tprintf(\"SNAP in daemon mode, waiting for commands to execute\\n\");\n\n\tconst char *pipeName = argc == 3 ? argv[2] : DEFAULT_NAMED_PIPE_NAME;\n\tCommandPipe = OpenNamedPipe(pipeName, true);\n\n\tif (NULL == CommandPipe) {\n\t\tWriteErrorMessage(\"Unable to open named pipe for command IO.\\n\");\n\t\tsoft_exit(1);\n\t}\n\n\tconst size_t commandBufferSize = 10000;\t\/\/ Yes, this is fixed size, no it's not a buffer overflow.  The named pipe reader just quits if it's too long.\n\tchar commandBuffer[commandBufferSize];\n\n\t\/\/\n\t\/\/ Format of commands is argc (in ascii) followed by argc arguments, each in one line.\n\t\/\/\n\tfor (;;) {\n\t\tif (!ReadFromNamedPipe(CommandPipe, commandBuffer, commandBufferSize)) {\n\t\t\tCloseNamedPipe(CommandPipe);\n\t\t\tCommandPipe = NULL;\n\t\t\tWriteStatusMessage(\"Named pipe closed.  Exiting\\n\");\n\t\t\tsoft_exit_no_print(0);\n\t\t}\n\n\t\tint argc = atoi(commandBuffer);\n\t\tif (0 == argc) {\n\t\t\tWriteErrorMessage(\"Expected argument count on named pipe, got '%s'; ignoring.\\n\", commandBuffer);\n\t\t} else {\n\t\t\tchar **argv = new char*[argc];\n\t\t\tfor (int i = 0; i < argc; i++) {\n\t\t\t\targv[i] = new char[commandBufferSize];\n\t\t\t\tif (!ReadFromNamedPipe(CommandPipe, argv[i], commandBufferSize)) {\n\t\t\t\t\tCloseNamedPipe(CommandPipe);\n\t\t\t\t\tCommandPipe = NULL;\n\t\t\t\t\tWriteStatusMessage(\"Error reading argument #%d from named pipe.\\n\", i);\n\t\t\t\t\tsoft_exit(1);\n\t\t\t\t}\n\t\t\t} \/\/ for each arg\n\n\t\t\tif (argc > 1 && strcmp(argv[1], \"exit\") == 0) {\n\t\t\t\tWriteStatusMessage(\"SNAP server exiting by request\\n\");\n\t\t\t\tWriteToNamedPipe(CommandPipe, CommandExecutedString);\n\t\t\t\tsoft_exit_no_print(1);\n\t\t\t}\n\n\t\t\tprintf(\"Executing command: \");\n\t\t\tfor (int i = 1; i < argc; i++) {\n\t\t\t\tprintf(\"%s \", argv[i]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\n\t\t\tProcessNonDaemonCommands(argc, (const char **) argv);\n\n\t\t\tprintf(\"\\n\");\n\n\t\t\tfor (int i = 0; i < argc; i++) {\n\t\t\t\tdelete[] argv[i];\n\t\t\t\targv[i] = NULL;\n\t\t\t}\n\t\t\tdelete[] argv;\n\t\t\targv = NULL;\n\t\t}\n\t\tWriteToNamedPipe(CommandPipe, CommandExecutedString);\n\t}\n}\n\nvoid ProcessTopLevelCommands(int argc, const char **argv)\n{\n\tfprintf(stderr, \"Welcome to SNAP version %s.\\n\\n\", SNAP_VERSION);       \/\/ Can't use WriteStatusMessage, because we haven't parsed args yet to determine if -hdp is specified.  Just stick with stderr.\n\n\tInitializeSeedSequencers();\n\n\tif (argc < 2) {\n\t\tusage();\n\t\tsoft_exit_no_print(1);\n\t}\n\n\tif (strcmp(argv[1], \"daemon\") == 0) {\n\t\tRunDaemonMode(argc, argv);\n\t} else {\n\t\tProcessNonDaemonCommands(argc, argv);\n\t}\n}\n\nNamedPipe *CommandPipe = NULL;\nconst char *CommandExecutedString = \"***SNAP Command completed execution***\";\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2007-2010 Paul Hodge. All rights reserved.\n\n#include \"circa.h\"\n\nnamespace circa {\nnamespace filter_function {\n\n    void evaluate(EvalContext* cxt, Term* caller)\n    {\n        Branch& inputs = as_branch(caller->input(0));\n        Branch& bools = as_branch(caller->input(1));\n        Branch& output = as_branch(caller);\n\n        if (inputs.length() != bools.length()) {\n            error_occurred(cxt, caller, \"Lists have different lengths\");\n            return;\n        }\n\n        int write = 0;\n\n        for (int i=0; i < inputs.length(); i++) {\n            if (bools[i]->asBool()) {\n                if (output.length() <= i) {\n                    create_value(output, inputs[i]->type);\n                }\n\n                assign_value(inputs[i], output[write]);\n                write++;\n            }\n        }\n\n        \/\/ Remove extra elements\n        for (int i=write; i < output.length(); i++)\n            output.set(i, NULL);\n\n        output.removeNulls();\n    }\n\n    void setup(Branch& kernel)\n    {\n        import_function(kernel, evaluate, \"filter(List,List) -> List\");\n    }\n}\n} \/\/ namespace circa\n<commit_msg>filter() now uses list-generic functions<commit_after>\/\/ Copyright (c) 2007-2010 Paul Hodge. All rights reserved.\n\n#include \"circa.h\"\n\nnamespace circa {\nnamespace filter_function {\n\n    void evaluate(EvalContext* cxt, Term* caller)\n    {\n        TaggedValue* inputs = caller->input(0);\n        TaggedValue* bools = caller->input(1);\n        Branch& output = as_branch(caller);\n\n        int numInputs = inputs->numElements();\n        int numBools = bools->numElements();\n\n        if (numInputs != numBools)\n            return error_occurred(cxt, caller, \"Lists have different lengths\");\n\n        int write = 0;\n\n        for (int i=0; i < numInputs; i++) {\n            if (as_bool((*bools)[i])) {\n                if (output.length() <= i)\n                    output.appendNew();\n\n                copy((*inputs)[i], output[write]);\n                write++;\n            }\n        }\n\n        \/\/ Remove extra elements\n        for (int i=write; i < output.length(); i++)\n            output.set(i, NULL);\n\n        output.removeNulls();\n    }\n\n    void setup(Branch& kernel)\n    {\n        import_function(kernel, evaluate, \"filter(List,List) -> List\");\n    }\n}\n} \/\/ namespace circa\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* Copyright (c) 2014-2016 Dallin Wellington\n*\n*\/\n\n\n#include <Platform\/Platform.h>\n\n#ifdef MONSOON_OS_WINDOWS\n\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n\n#include <sstream>\n\n#include <App\/Application.h>\n#include <Math\/Vector.h>\n#include <D3D11Renderer.h>\n\n#include \"HgtReader.h\"\n#include \"GCS.h\"\n\n#include <fstream>\n\nusing namespace Monsoon;\nusing namespace Monsoon::Math;\n\nconst U32 numChunks = 4; \/\/ The number of chunks to render as a square. (Must be greater than 2).\nconst int chunkXOffset = 8;\nconst int chunkYOffset = 12;\n\nconst float peakViewX = -1897.81921;\nconst float peakViewZ = -3074.84082;\n\nconst float WorldScale = 1.0f;\n\nfloat FirstPersonCameraSpeed = 1000.0f;\n\n\/**\n * Viewing Modes\n *\/\nenum VIEW_MODE\n{\n\tDEFAULT,\n\tPEAK,\n\tTRAIL,\n\tFIRST_PERSON\n};\n\nVIEW_MODE cameraMode = VIEW_MODE::FIRST_PERSON;\nconst GcsLocation startLocation = GcsLocation(GcsCoord(39, 0, 0), GcsCoord(107, 0, 0));\n\nclass TerrainApplication : public Application\n{\npublic:\n\tTerrainApplication()\n\t\t: Application((Renderer::Renderer*)(new Renderer::D3D11Renderer(Renderer::RendererSettings(), &mEventManager, &mTransformSystem))) \n\t\t, mFileReader()\n\t\t, mFirstPersonPosition(0.0f, 0.0f, 0.0f)\n\t\t, mFirstPersonDirection(0.0f, 0.0f, 0.0f)\n\t\t, cameraTheta(0.0f)\n\t\t, cameraPhi(0.0f)\n\t\t, mFirstPersonCursorOn(false) {\n\n\t\tstd::stringstream filename;\n\t\tfilename << \"I:\/terrain\/\" << \"N\" << startLocation.latitude.degrees << \"W\" << startLocation.longitude.degrees << \"-2.hgt\";\n\t\tmFileReader.Load(filename.str().c_str());\n\t\tchunkSize = ceil(sqrt((mFileReader.GetResolution() * mFileReader.GetResolution()) \/ 256));\n\t}\n\n\t~TerrainApplication() {\n\n\t}\n\nprotected:\n\tfloat cameraTheta; \/\/ Yaw\n\tfloat cameraPhi; \/\/ Pitch\n\tfloat cameraZoom;\n\tVector3 mFirstPersonPosition;\n\tVector3 mFirstPersonDirection;\n\tHGTReader mFileReader;\n\tfloat cursorX;\n\tfloat cursorY;\n\tfloat cursorDiffX;\n\tfloat cursorDiffY;\n\tbool mFirstPersonCursorOn;\n\tU32 chunkSize = 0; \/\/ The number of points on a single side of a chunk. The number of total points is chunkSize ^ 2. Set dynamically after loading the HGT file.\n\n\tRenderer::VertexBufferHandle* chunkVertexBuffers;\n\tRenderer::MeshComponent* chunkMeshes;\n\tScene::TransformComponent* chunkPositions;\n\tRenderer::TextureHandle* chunkTextures;\n\tstd::stringstream*\ttextureFiles;\n\tRenderer::MeshComponent skydomeMesh;\n\n\tvoid OnInitialize() {\n\t\tchunkVertexBuffers = new Renderer::VertexBufferHandle[numChunks * numChunks]();\n\t\tchunkMeshes = new Renderer::MeshComponent[numChunks * numChunks]();\n\t\tchunkPositions = new Scene::TransformComponent[numChunks * numChunks]();\n\t\tchunkTextures = new Renderer::TextureHandle[numChunks * numChunks]();\n\t\ttextureFiles = new std::stringstream[numChunks * numChunks]();\n\n\t\tVector2 cartesian = GcsToCartesian(GcsCoord(35, 0, 0), GcsCoord(112, 0, 0));\n\t\tmFirstPersonPosition = Vector3(cartesian.mX * 90.0f * WorldScale, 4394.12f, cartesian.mY * 90.0f * WorldScale);\n\n\t\t\/\/\n\t\t\/\/ Generate Skydome\n\t\t\/\/\n\t\tmRenderer->CreateGradientSkydome(Math::Vector3(0.0f, 0.0f, 0.0f), Math::Vector3(0.0f, 0.0f, 0.0f));\n\n\n\t\t\/\/\n\t\t\/\/ Generate Texture Map\n\t\t\/\/\n\t\tint textureMap[16][16];\n\t\tint x = 0;\n\t\tint y = 0;\n\t\tint index = 0;\n\t\tfor (int i = 0; i < (256\/4); i++)\n\t\t{\n\t\t\ttextureMap[x][y] = index + 1;\n\t\t\ttextureMap[1+x][y] = index;\n\t\t\ttextureMap[x][1+y] = index + 3;\n\t\t\ttextureMap[1+x][1+y] = index + 2;\n\t\t\tx += 2;\n\n\t\t\tif (x >= 16) {\n\t\t\t\tx = 0;\n\t\t\t\ty += 2;\n\t\t\t}\n\n\t\t\tindex += 4;\n\t\t}\n\n\t\tfor (int x = 0; x < numChunks; x++)\n\t\t{\n\t\t\tfor (int y = 0; y < numChunks; y++)\n\t\t\t{\n\t\t\t\tint index = y + (x * numChunks);\n\n\t\t\t\ttextureFiles[index] << \"I:\/terrain\/\" << \"N\" << startLocation.latitude.degrees << \"W\" << startLocation.longitude.degrees << \"\/\" << textureMap[x + chunkXOffset][y + chunkYOffset] << \".tif\" << '\\0';\n\n\t\t\t\tchunkVertexBuffers[index] = generateTerrain(x + chunkXOffset, y + chunkYOffset);\n\t\t\t\tchunkTextures[index] = mRenderer->LoadTexture(textureFiles[index].str());\n\n\t\t\t\tchunkMeshes[index].TextureId = chunkTextures[index];\n\t\t\t\tchunkMeshes[index].VertexBuffer = chunkVertexBuffers[index];\n\n\t\t\t\tchunkPositions[index].position += Vector3((y * 90.0f * WorldScale * (chunkSize - 1)), 0.0f, (x * 90.0f * WorldScale * (chunkSize - 1)));\n\t\t\t\tVector2 cartesian = GcsToCartesian(startLocation.latitude, startLocation.longitude);\n\t\t\t\tchunkPositions[index].position += Vector3(cartesian.mX, 0.0f, cartesian.mY);\n\n\t\t\t\tmRenderer->AttachMeshComponent(index, chunkMeshes[index]);\n\t\t\t\tmTransformSystem.AttachComponent(index, chunkPositions[index]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tcameraTheta = 0.0f;\n\t\tcameraZoom = 1.0f;\n\n\t\tRenderer::Camera& camera = mRenderer->GetCamera();\n\t\tcamera.y = mFileReader.mMaxHeight + 3000.0f;\n\t\tcamera.lookAtY = mFileReader.mMinHeight + 1700.0f;\n\n\t\tPollMousePosition();\n\t}\n\n\tvoid PollMousePosition() {\n\t\tfloat x = 0;\n\t\tfloat y = 0;\n\t\t\n\t\tPOINT cursorPosition;\n\t\tGetCursorPos(&cursorPosition);\n\n\t\tx = cursorPosition.x;\n\t\ty = cursorPosition.y;\n\n\t\tcursorDiffX = x - cursorX;\n\t\tcursorDiffY = y - cursorY;\n\n\t\tcursorX = x;\n\t\tcursorY = y;\n\t}\n\n\tvoid OnUpdate() {\n\t\tRenderer::Camera& camera = mRenderer->GetCamera();\n\n\t\tswitch (cameraMode)\n\t\t{\n\t\tcase VIEW_MODE::DEFAULT:\n\t\t\tcamera.lookAtX = 0;\n\t\t\tcamera.lookAtZ = 0;\n\t\t\tcamera.x = cos(cameraTheta) * ((float)chunkSize * (float)numChunks \/ 2.0f * WorldScale) * cameraZoom;\n\t\t\tcamera.z = sin(cameraTheta) * ((float)chunkSize * (float)numChunks \/ 2.0f * WorldScale) * cameraZoom;\n\t\t\tbreak;\n\t\tcase VIEW_MODE::PEAK:\n\t\t\tcamera.x = peakViewX;\n\t\t\tcamera.z = peakViewZ;\n\t\t\tcamera.lookAtX = camera.x + (cos(cameraTheta) * 500.0f);\n\t\t\tcamera.lookAtZ = camera.z + (sin(cameraTheta) * 500.0f);\n\t\t\tcamera.lookAtY = 4394.12f; \/\/mFileReader.mHeightMap[(int)camera.x][(int)camera.z] + 5.0f;\n\t\t\tcamera.y = 4394.12f; \/\/mFileReader.mHeightMap[(int)camera.x][(int)camera.z] + 5.0f;\n\t\t\tbreak;\n\t\tcase VIEW_MODE::FIRST_PERSON:\n\t\t\tmFirstPersonDirection = Vector3(cos(cameraTheta), sin(cameraPhi), sin(cameraTheta));\n\t\t\tcamera.x = mFirstPersonPosition.mX;\n\t\t\tcamera.z = mFirstPersonPosition.mZ;\n\t\t\tcamera.y = mFirstPersonPosition.mY;\n\t\t\tcamera.lookAtX = camera.x + (mFirstPersonDirection.mX);\n\t\t\tcamera.lookAtZ = camera.z + (mFirstPersonDirection.mZ);\n\t\t\tcamera.lookAtY = camera.y + (mFirstPersonDirection.mY);\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tcamera.farClip = 1000000.0f;\n\n\t\tU16 leftKeyState = GetAsyncKeyState(VK_LEFT);\n\t\tU16 rightKeyState = GetAsyncKeyState(VK_RIGHT);\n\t\tU16 upKeyState = GetAsyncKeyState(VK_UP);\n\t\tU16 downKeyState = GetAsyncKeyState(VK_DOWN);\n\t\tU16 spaceKeyState = GetAsyncKeyState(VK_SPACE);\n\t\tU16 leftShiftKeyState = GetAsyncKeyState(0xA0);\n\n\t\tU16 rightMouseState = GetAsyncKeyState(VK_RBUTTON);\n\t\tU16 leftMouseState = GetAsyncKeyState(VK_LBUTTON);\n\n\t\tU16 wKeyState = GetAsyncKeyState(0x57);\n\t\tU16 aKeyState = GetAsyncKeyState(0x41);\n\t\tU16 sKeyState = GetAsyncKeyState(0x53);\n\t\tU16 dKeyState = GetAsyncKeyState(0x44);\n\t\tU16 qKeyState = GetAsyncKeyState(0x51);\n\t\tU16 eKeyState = GetAsyncKeyState(0x45);\n\n\t\t\/\/ \n\t\t\/\/ Default View Controls\n\t\t\/\/ \n\t\tif (leftKeyState)\n\t\t\tcameraTheta += mGameClock.getDeltaTime()\/4.0f;\n\t\tif (rightKeyState)\n\t\t\tcameraTheta -= mGameClock.getDeltaTime() \/ 4.0f;\n\t\tif (upKeyState)\n\t\t\tcameraZoom -= mGameClock.getDeltaTime() \/ 4.0f;\n\t\tif (downKeyState)\n\t\t\tcameraZoom += mGameClock.getDeltaTime() \/ 4.0f;\n\n\n\t\t\/\/\n\t\t\/\/ First Person View Controls\n\t\t\/\/\n\t\tif (wKeyState)\n\t\t{\n\t\t\tmFirstPersonPosition += mFirstPersonDirection * mGameClock.getDeltaTime() * FirstPersonCameraSpeed;\n\t\t}\n\t\tif (aKeyState)\n\t\t{\n\t\t\tmFirstPersonPosition += Vector3(cos((3 * PI) \/ 2 + cameraTheta), 0.0f, sin((3 * PI) \/ 2 + cameraTheta)) * -1.0f * mGameClock.getDeltaTime() * FirstPersonCameraSpeed;\n\t\t}\n\t\tif (sKeyState)\n\t\t{\n\t\t\tmFirstPersonPosition += mFirstPersonDirection * (-1.0f) * mGameClock.getDeltaTime() * FirstPersonCameraSpeed;\n\t\t}\n\t\tif (dKeyState)\n\t\t{\n\t\t\tmFirstPersonPosition += Vector3(cos((3 * PI) \/ 2 + cameraTheta), 0.0f, sin((3 * PI) \/ 2 + cameraTheta)) * mGameClock.getDeltaTime() * FirstPersonCameraSpeed;\n\t\t}\n\t\tif (spaceKeyState)\n\t\t\tmQuit = true;\n\n\t\tif (leftMouseState)\n\t\t\tFirstPersonCameraSpeed += mGameClock.getDeltaTime() * 100.0f;\n\t\tif (rightMouseState)\n\t\t\tFirstPersonCameraSpeed -= mGameClock.getDeltaTime() * 100.0f;\n\n\t\tif (cameraZoom <= 0.0f)\n\t\t\tcameraZoom = 0.001f;\n\n\t\tif (!mFirstPersonCursorOn)\n\t\t{\n\t\t\tShowCursor(false);\n\t\t\tPollMousePosition();\n\n\t\t\tcameraTheta -= cursorDiffX * mGameClock.getDeltaTime() \/ 10.0f;\n\t\t\tcameraPhi -= cursorDiffY * mGameClock.getDeltaTime() \/ 10.0f;\n\n\t\t\tif (cameraPhi > PI \/ 2)\n\t\t\t\tcameraPhi = PI \/ 2;\n\t\t\tif (cameraPhi < -PI\/2)\n\t\t\t\tcameraPhi = -PI \/ 2;\n\n\t\t\tSetCursorPos(1280.0f \/ 2.0f, 800.0f \/ 2.0f);\n\t\t\tcursorX = 1280.0f \/ 2.0f;\n\t\t\tcursorY = 800.0f \/ 2.0f;\n\t\t}\n\t}\n\n\tvoid OnShutdown() {\n\t\tfor (int x = 0; x < numChunks \/ 2.0f; x++)\n\t\t{\n\t\t\tfor (int y = 0; y < numChunks \/ 2.0f; y++)\n\t\t\t{\n\t\t\t\tint index = (x * chunkSize) + y;\n\n\t\t\t\tmTransformSystem.DetachComponent(index);\n\t\t\t\tmRenderer->DetachMeshComponent(index);\n\t\t\t\tmRenderer->ReleaseTexture(index);\n\t\t\t}\n\t\t}\n\n\t\tmRenderer->DetachMeshComponent(1000);\n\t\tmTransformSystem.DetachComponent(1000);\n\n\t\tdelete textureFiles;\n\t\tdelete chunkTextures;\n\t\tdelete chunkPositions;\n\t\tdelete chunkMeshes;\n\t\tdelete chunkVertexBuffers;\n\t}\n\n\tRenderer::VertexBufferHandle generateTerrain(U32 chunkX, U32 chunkY) {\n\t\tRenderer::VertexType* vertices = new Renderer::VertexType[chunkSize * chunkSize];\n\t\tunsigned int* indicies = new unsigned int[6 * ((chunkSize - 1) * (chunkSize - 1))];\n\n\t\tint yOffset = chunkX * (chunkSize - 1);\n\t\tint xOffset = chunkY * (chunkSize - 1);\n\n\t\t\/\/ Generate Vertices\n\t\tfor (int x = 0; x < chunkSize; x++)\n\t\t{\n\t\t\tfor (int y = 0; y < chunkSize; y++)\n\t\t\t{\n\t\t\t\tfloat height = mFileReader.mHeightMap[x + xOffset][y + yOffset];\n\t\t\t\tfloat color = (mFileReader.mHeightMap[x + xOffset][y + yOffset] - mFileReader.mMinHeight) \/ (mFileReader.mMaxHeight - mFileReader.mMinHeight);\n\t\t\t\tvertices[(x * chunkSize) + y].SetPosition(x * 90.0f * WorldScale, mFileReader.mHeightMap[x + xOffset][y + yOffset] * 4.0f, y * 90.0f * WorldScale); \/\/ This is where i'll convert to simulation world coords for scaling.\n\t\t\t\tvertices[(x * chunkSize) + y].SetColor(color, color, color, 1.0f);\n\t\t\t\tvertices[(x * chunkSize) + y].SetUV((float)(y) \/ (float)chunkSize, (float)(x) \/ (float)chunkSize);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Generate Indicies\n\t\tint i = 0;\n\t\tfor (int z = 0; z < (chunkSize - 1); z++)\n\t\t{\n\t\t\tfor (int d = 0; d < (chunkSize - 1); d++)\n\t\t\t{\n\t\t\t\tint index = (z * chunkSize) + d;\n\t\t\t\tindicies[i] = index + chunkSize;\n\t\t\t\tindicies[i + 1] = index;\n\t\t\t\tindicies[i + 2] = index + 1;\n\t\t\t\tindicies[i + 3] = index + chunkSize;\n\t\t\t\tindicies[i + 4] = index + 1;\n\t\t\t\tindicies[i + 5] = index + chunkSize + 1;\n\n\t\t\t\ti += 6;\n\t\t\t}\n\t\t}\n\n\t\treturn mRenderer->CreateVertexBuffer(vertices, chunkSize * chunkSize, indicies, 6 * ((chunkSize - 1) * (chunkSize - 1)));\n\t}\n\n};\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR pScmdline, int iCmdshow) {\n\tTerrainApplication application;\n\tapplication.Run();\n\treturn 0;\n}\n\n#endif<commit_msg>Improved estimation of true scale.<commit_after>\/**\n* Copyright (c) 2014-2016 Dallin Wellington\n*\n*\/\n\n\n#include <Platform\/Platform.h>\n\n#ifdef MONSOON_OS_WINDOWS\n\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n\n#include <sstream>\n\n#include <App\/Application.h>\n#include <Math\/Vector.h>\n#include <D3D11Renderer.h>\n\n#include \"HgtReader.h\"\n#include \"GCS.h\"\n\n#include <fstream>\n\nusing namespace Monsoon;\nusing namespace Monsoon::Math;\n\nconst U32 numChunks = 4; \/\/ The number of chunks to render as a square. (Must be greater than 2).\nconst int chunkXOffset = 8;\nconst int chunkYOffset = 12;\n\nconst float peakViewX = -1897.81921;\nconst float peakViewZ = -3074.84082;\n\n\nconst float SurfaceLengthMi = 2 * PI *  3959.0f;\nconst float WorldScale = SurfaceLengthMi \/ (360.0f);\n\nfloat FirstPersonCameraSpeed = 4.0f;\n\n\/**\n * Viewing Modes\n *\/\nenum VIEW_MODE\n{\n\tDEFAULT,\n\tPEAK,\n\tTRAIL,\n\tFIRST_PERSON\n};\n\nVIEW_MODE cameraMode = VIEW_MODE::FIRST_PERSON;\nconst GcsLocation startLocation = GcsLocation(GcsCoord(39, 0, 0), GcsCoord(107, 0, 0));\n\nclass TerrainApplication : public Application\n{\npublic:\n\tTerrainApplication()\n\t\t: Application((Renderer::Renderer*)(new Renderer::D3D11Renderer(Renderer::RendererSettings(), &mEventManager, &mTransformSystem))) \n\t\t, mFileReader()\n\t\t, mFirstPersonPosition(0.0f, 0.0f, 0.0f)\n\t\t, mFirstPersonDirection(0.0f, 0.0f, 0.0f)\n\t\t, cameraTheta(0.0f)\n\t\t, cameraPhi(0.0f)\n\t\t, mFirstPersonCursorOn(false) {\n\n\t\tstd::stringstream filename;\n\t\tfilename << \"I:\/terrain\/\" << \"N\" << abs(startLocation.latitude.degrees) << \"W\" << abs(startLocation.longitude.degrees) << \"-2.hgt\";\n\t\tmFileReader.Load(filename.str().c_str());\n\t\tchunkSize = ceil(sqrt((mFileReader.GetResolution() * mFileReader.GetResolution()) \/ 256));\n\t}\n\n\t~TerrainApplication() {\n\n\t}\n\nprotected:\n\tfloat cameraTheta; \/\/ Yaw\n\tfloat cameraPhi; \/\/ Pitch\n\tfloat cameraZoom;\n\tVector3 mFirstPersonPosition;\n\tVector3 mFirstPersonDirection;\n\tHGTReader mFileReader;\n\tfloat cursorX;\n\tfloat cursorY;\n\tfloat cursorDiffX;\n\tfloat cursorDiffY;\n\tbool mFirstPersonCursorOn;\n\tU32 chunkSize = 0; \/\/ The number of points on a single side of a chunk. The number of total points is chunkSize ^ 2. Set dynamically after loading the HGT file.\n\n\tRenderer::VertexBufferHandle* chunkVertexBuffers;\n\tRenderer::MeshComponent* chunkMeshes;\n\tScene::TransformComponent* chunkPositions;\n\tRenderer::TextureHandle* chunkTextures;\n\tstd::stringstream*\ttextureFiles;\n\tRenderer::MeshComponent skydomeMesh;\n\n\tvoid OnInitialize() {\n\t\tchunkVertexBuffers = new Renderer::VertexBufferHandle[numChunks * numChunks]();\n\t\tchunkMeshes = new Renderer::MeshComponent[numChunks * numChunks]();\n\t\tchunkPositions = new Scene::TransformComponent[numChunks * numChunks]();\n\t\tchunkTextures = new Renderer::TextureHandle[numChunks * numChunks]();\n\t\ttextureFiles = new std::stringstream[numChunks * numChunks]();\n\n\t\tVector2 cartesian = GcsToCartesian(startLocation.latitude, startLocation.longitude);\n\t\tmFirstPersonPosition = Vector3(cartesian.mX, 4394.12f\/80.0f, cartesian.mY);\n\n\t\t\/\/\n\t\t\/\/ Generate Skydome\n\t\t\/\/\n\t\tmRenderer->CreateGradientSkydome(Math::Vector3(0.0f, 0.0f, 0.0f), Math::Vector3(0.0f, 0.0f, 0.0f));\n\n\n\t\t\/\/\n\t\t\/\/ Generate Texture Map\n\t\t\/\/\n\t\tint textureMap[16][16];\n\t\tint x = 0;\n\t\tint y = 0;\n\t\tint index = 0;\n\t\tfor (int i = 0; i < (256\/4); i++)\n\t\t{\n\t\t\ttextureMap[x][y] = index + 1;\n\t\t\ttextureMap[1+x][y] = index;\n\t\t\ttextureMap[x][1+y] = index + 3;\n\t\t\ttextureMap[1+x][1+y] = index + 2;\n\t\t\tx += 2;\n\n\t\t\tif (x >= 16) {\n\t\t\t\tx = 0;\n\t\t\t\ty += 2;\n\t\t\t}\n\n\t\t\tindex += 4;\n\t\t}\n\n\t\tfor (int x = 0; x < numChunks; x++)\n\t\t{\n\t\t\tfor (int y = 0; y < numChunks; y++)\n\t\t\t{\n\t\t\t\tint index = y + (x * numChunks);\n\n\t\t\t\ttextureFiles[index] << \"I:\/terrain\/\" << \"N\" << startLocation.latitude.degrees << \"W\" << startLocation.longitude.degrees << \"\/\" << textureMap[x + chunkXOffset][y + chunkYOffset] << \".tif\" << '\\0';\n\n\t\t\t\tchunkVertexBuffers[index] = generateTerrain(x + chunkXOffset, y + chunkYOffset);\n\t\t\t\tchunkTextures[index] = mRenderer->LoadTexture(textureFiles[index].str());\n\n\t\t\t\tchunkMeshes[index].TextureId = chunkTextures[index];\n\t\t\t\tchunkMeshes[index].VertexBuffer = chunkVertexBuffers[index];\n\n\t\t\t\tchunkPositions[index].position += Vector3((((float)y\/(float)chunkSize) * WorldScale * (chunkSize - 1)), 0.0f, (((float)x\/(float)chunkSize) * WorldScale * (chunkSize - 1)));\n\t\t\t\tVector2 cartesian = GcsToCartesian(startLocation.latitude, startLocation.longitude);\n\t\t\t\tchunkPositions[index].position += Vector3(cartesian.mX, 0.0f, cartesian.mY);\n\n\t\t\t\tmRenderer->AttachMeshComponent(index, chunkMeshes[index]);\n\t\t\t\tmTransformSystem.AttachComponent(index, chunkPositions[index]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tcameraTheta = 0.0f;\n\t\tcameraZoom = 1.0f;\n\n\t\tRenderer::Camera& camera = mRenderer->GetCamera();\n\t\tcamera.y = mFileReader.mMaxHeight + 3000.0f;\n\n\t\tPollMousePosition();\n\t}\n\n\tvoid PollMousePosition() {\n\t\tfloat x = 0;\n\t\tfloat y = 0;\n\t\t\n\t\tPOINT cursorPosition;\n\t\tGetCursorPos(&cursorPosition);\n\n\t\tx = cursorPosition.x;\n\t\ty = cursorPosition.y;\n\n\t\tcursorDiffX = x - cursorX;\n\t\tcursorDiffY = y - cursorY;\n\n\t\tcursorX = x;\n\t\tcursorY = y;\n\t}\n\n\tvoid OnUpdate() {\n\t\tRenderer::Camera& camera = mRenderer->GetCamera();\n\n\t\tswitch (cameraMode)\n\t\t{\n\t\tcase VIEW_MODE::DEFAULT:\n\t\t\tcamera.lookAtX = 0;\n\t\t\tcamera.lookAtZ = 0;\n\t\t\tcamera.x = cos(cameraTheta) * ((float)chunkSize * (float)numChunks \/ 2.0f * WorldScale) * cameraZoom;\n\t\t\tcamera.z = sin(cameraTheta) * ((float)chunkSize * (float)numChunks \/ 2.0f * WorldScale) * cameraZoom;\n\t\t\tbreak;\n\t\tcase VIEW_MODE::PEAK:\n\t\t\tcamera.x = peakViewX;\n\t\t\tcamera.z = peakViewZ;\n\t\t\tcamera.lookAtX = camera.x + (cos(cameraTheta) * 500.0f);\n\t\t\tcamera.lookAtZ = camera.z + (sin(cameraTheta) * 500.0f);\n\t\t\tcamera.lookAtY = 4394.12f; \/\/mFileReader.mHeightMap[(int)camera.x][(int)camera.z] + 5.0f;\n\t\t\tcamera.y = 4394.12f; \/\/mFileReader.mHeightMap[(int)camera.x][(int)camera.z] + 5.0f;\n\t\t\tbreak;\n\t\tcase VIEW_MODE::FIRST_PERSON:\n\t\t\tmFirstPersonDirection = Vector3(cos(cameraTheta), sin(cameraPhi), sin(cameraTheta));\n\t\t\tcamera.x = mFirstPersonPosition.mX;\n\t\t\tcamera.z = mFirstPersonPosition.mZ;\n\t\t\tcamera.y = mFirstPersonPosition.mY;\n\t\t\tcamera.lookAtX = camera.x + (mFirstPersonDirection.mX);\n\t\t\tcamera.lookAtZ = camera.z + (mFirstPersonDirection.mZ);\n\t\t\tcamera.lookAtY = camera.y + (mFirstPersonDirection.mY);\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tcamera.farClip = 1000000.0f;\n\n\t\tU16 leftKeyState = GetAsyncKeyState(VK_LEFT);\n\t\tU16 rightKeyState = GetAsyncKeyState(VK_RIGHT);\n\t\tU16 upKeyState = GetAsyncKeyState(VK_UP);\n\t\tU16 downKeyState = GetAsyncKeyState(VK_DOWN);\n\t\tU16 spaceKeyState = GetAsyncKeyState(VK_SPACE);\n\t\tU16 leftShiftKeyState = GetAsyncKeyState(0xA0);\n\n\t\tU16 rightMouseState = GetAsyncKeyState(VK_RBUTTON);\n\t\tU16 leftMouseState = GetAsyncKeyState(VK_LBUTTON);\n\n\t\tU16 wKeyState = GetAsyncKeyState(0x57);\n\t\tU16 aKeyState = GetAsyncKeyState(0x41);\n\t\tU16 sKeyState = GetAsyncKeyState(0x53);\n\t\tU16 dKeyState = GetAsyncKeyState(0x44);\n\t\tU16 qKeyState = GetAsyncKeyState(0x51);\n\t\tU16 eKeyState = GetAsyncKeyState(0x45);\n\n\t\t\/\/ \n\t\t\/\/ Default View Controls\n\t\t\/\/ \n\t\tif (leftKeyState)\n\t\t\tcameraTheta += mGameClock.getDeltaTime()\/4.0f;\n\t\tif (rightKeyState)\n\t\t\tcameraTheta -= mGameClock.getDeltaTime() \/ 4.0f;\n\t\tif (upKeyState)\n\t\t\tcameraZoom -= mGameClock.getDeltaTime() \/ 4.0f;\n\t\tif (downKeyState)\n\t\t\tcameraZoom += mGameClock.getDeltaTime() \/ 4.0f;\n\n\n\t\t\/\/\n\t\t\/\/ First Person View Controls\n\t\t\/\/\n\t\tif (wKeyState)\n\t\t{\n\t\t\tmFirstPersonPosition += mFirstPersonDirection * mGameClock.getDeltaTime() * FirstPersonCameraSpeed;\n\t\t}\n\t\tif (aKeyState)\n\t\t{\n\t\t\tmFirstPersonPosition += Vector3(cos((3 * PI) \/ 2 + cameraTheta), 0.0f, sin((3 * PI) \/ 2 + cameraTheta)) * -1.0f * mGameClock.getDeltaTime() * FirstPersonCameraSpeed;\n\t\t}\n\t\tif (sKeyState)\n\t\t{\n\t\t\tmFirstPersonPosition += mFirstPersonDirection * (-1.0f) * mGameClock.getDeltaTime() * FirstPersonCameraSpeed;\n\t\t}\n\t\tif (dKeyState)\n\t\t{\n\t\t\tmFirstPersonPosition += Vector3(cos((3 * PI) \/ 2 + cameraTheta), 0.0f, sin((3 * PI) \/ 2 + cameraTheta)) * mGameClock.getDeltaTime() * FirstPersonCameraSpeed;\n\t\t}\n\t\tif (spaceKeyState)\n\t\t\tmQuit = true;\n\n\t\tif (leftMouseState)\n\t\t\tFirstPersonCameraSpeed += mGameClock.getDeltaTime() * 100.0f;\n\t\tif (rightMouseState)\n\t\t\tFirstPersonCameraSpeed -= mGameClock.getDeltaTime() * 100.0f;\n\n\t\tif (cameraZoom <= 0.0f)\n\t\t\tcameraZoom = 0.001f;\n\n\t\tif (!mFirstPersonCursorOn)\n\t\t{\n\t\t\tShowCursor(false);\n\t\t\tPollMousePosition();\n\n\t\t\tcameraTheta -= cursorDiffX * mGameClock.getDeltaTime() \/ 10.0f;\n\t\t\tcameraPhi -= cursorDiffY * mGameClock.getDeltaTime() \/ 10.0f;\n\n\t\t\tif (cameraPhi > PI \/ 2)\n\t\t\t\tcameraPhi = PI \/ 2;\n\t\t\tif (cameraPhi < -PI\/2)\n\t\t\t\tcameraPhi = -PI \/ 2;\n\n\t\t\tSetCursorPos(1280.0f \/ 2.0f, 800.0f \/ 2.0f);\n\t\t\tcursorX = 1280.0f \/ 2.0f;\n\t\t\tcursorY = 800.0f \/ 2.0f;\n\t\t}\n\t}\n\n\tvoid OnShutdown() {\n\t\tfor (int x = 0; x < numChunks \/ 2.0f; x++)\n\t\t{\n\t\t\tfor (int y = 0; y < numChunks \/ 2.0f; y++)\n\t\t\t{\n\t\t\t\tint index = (x * chunkSize) + y;\n\n\t\t\t\tmTransformSystem.DetachComponent(index);\n\t\t\t\tmRenderer->DetachMeshComponent(index);\n\t\t\t\tmRenderer->ReleaseTexture(index);\n\t\t\t}\n\t\t}\n\n\t\tmRenderer->DetachMeshComponent(1000);\n\t\tmTransformSystem.DetachComponent(1000);\n\n\t\tdelete textureFiles;\n\t\tdelete chunkTextures;\n\t\tdelete chunkPositions;\n\t\tdelete chunkMeshes;\n\t\tdelete chunkVertexBuffers;\n\t}\n\n\tRenderer::VertexBufferHandle generateTerrain(U32 chunkX, U32 chunkY) {\n\t\tRenderer::VertexType* vertices = new Renderer::VertexType[chunkSize * chunkSize];\n\t\tunsigned int* indicies = new unsigned int[6 * ((chunkSize - 1) * (chunkSize - 1))];\n\n\t\tint yOffset = chunkX * (chunkSize - 1);\n\t\tint xOffset = chunkY * (chunkSize - 1);\n\n\t\t\/\/ Generate Vertices\n\t\tfor (int x = 0; x < chunkSize; x++)\n\t\t{\n\t\t\tfor (int y = 0; y < chunkSize; y++)\n\t\t\t{\n\t\t\t\tfloat height = mFileReader.mHeightMap[x + xOffset][y + yOffset];\n\t\t\t\tfloat color = (mFileReader.mHeightMap[x + xOffset][y + yOffset] - mFileReader.mMinHeight) \/ (mFileReader.mMaxHeight - mFileReader.mMinHeight);\n\t\t\t\tvertices[(x * chunkSize) + y].SetPosition(((float)x\/(float)chunkSize) * WorldScale, mFileReader.mHeightMap[x + xOffset][y + yOffset]\/80.0f, ((float)y\/(float)chunkSize) * WorldScale); \/\/ This is where i'll convert to simulation world coords for scaling.\n\t\t\t\tvertices[(x * chunkSize) + y].SetColor(color, color, color, 1.0f);\n\t\t\t\tvertices[(x * chunkSize) + y].SetUV((float)(y) \/ (float)chunkSize, (float)(x) \/ (float)chunkSize);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Generate Indicies\n\t\tint i = 0;\n\t\tfor (int z = 0; z < (chunkSize - 1); z++)\n\t\t{\n\t\t\tfor (int d = 0; d < (chunkSize - 1); d++)\n\t\t\t{\n\t\t\t\tint index = (z * chunkSize) + d;\n\t\t\t\tindicies[i] = index + chunkSize;\n\t\t\t\tindicies[i + 1] = index;\n\t\t\t\tindicies[i + 2] = index + 1;\n\t\t\t\tindicies[i + 3] = index + chunkSize;\n\t\t\t\tindicies[i + 4] = index + 1;\n\t\t\t\tindicies[i + 5] = index + chunkSize + 1;\n\n\t\t\t\ti += 6;\n\t\t\t}\n\t\t}\n\n\t\treturn mRenderer->CreateVertexBuffer(vertices, chunkSize * chunkSize, indicies, 6 * ((chunkSize - 1) * (chunkSize - 1)));\n\t}\n\n};\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR pScmdline, int iCmdshow) {\n\tTerrainApplication application;\n\tapplication.Run();\n\treturn 0;\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>#include <QSettings>\n#include <QDebug>\n#include <QCoreApplication>\n#include <QFile>\n#include <QSound>\n\n#include \"QGC.h\"\n#include \"QGCAudioWorker.h\"\n#include \"GAudioOutput.h\"\n\n#if defined Q_OS_MAC && defined QGC_SPEECH_ENABLED\n#include <ApplicationServices\/ApplicationServices.h>\n#endif\n\n\/\/ Speech synthesis is only supported with MSVC compiler\n#if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n\/\/ Documentation: http:\/\/msdn.microsoft.com\/en-us\/library\/ee125082%28v=VS.85%29.aspx\n#include <sapi.h>\n#endif\n\n#if defined Q_OS_LINUX && defined QGC_SPEECH_ENABLED\n\/\/ Using eSpeak for speech synthesis: following https:\/\/github.com\/mondhs\/espeak-sample\/blob\/master\/sampleSpeak.cpp\n#include <espeak\/speak_lib.h>\n#endif\n\n#define QGC_GAUDIOOUTPUT_KEY QString(\"QGC_AUDIOOUTPUT_\")\n\nQGCAudioWorker::QGCAudioWorker(QObject *parent) :\n    QObject(parent),\n    voiceIndex(0),\n    emergency(false),\n    muted(false),\n    #if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n    pVoice(NULL),\n    #endif\n    sound(NULL)\n{\n    \/\/ Load settings\n    QSettings settings;\n    muted = settings.value(QGC_GAUDIOOUTPUT_KEY + \"muted\", muted).toBool();\n}\n\nvoid QGCAudioWorker::init()\n{\n    sound = new QSound(\"\");\n\n#if defined Q_OS_LINUX && defined QGC_SPEECH_ENABLED\n    espeak_Initialize(AUDIO_OUTPUT_SYNCHRONOUS, 500, NULL, 0); \/\/ initialize for playback with 500ms buffer and no options (see speak_lib.h)\n    espeak_VOICE *espeak_voice = espeak_GetCurrentVoice();\n    espeak_voice->languages = \"en-uk\"; \/\/ Default to British English\n    espeak_voice->identifier = NULL; \/\/ no specific voice file specified\n    espeak_voice->name = \"klatt\"; \/\/ espeak voice name\n    espeak_voice->gender = 2; \/\/ Female\n    espeak_voice->age = 0; \/\/ age not specified\n    espeak_SetVoiceByProperties(espeak_voice);\n#endif\n\n#if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n\n    if (FAILED(::CoInitialize(NULL)))\n    {\n        qDebug() << \"ERROR: Creating COM object for audio output failed!\";\n    }\n    else\n    {\n\n        HRESULT hr = CoCreateInstance(CLSID_SpVoice, NULL, CLSCTX_ALL, IID_ISpVoice, (void **)&pVoice);\n\n        if (FAILED(hr))\n        {\n            qDebug() << \"ERROR: Initializing voice for audio output failed!\";\n        }\n    }\n\n#endif\n\n    \/\/ Prepare regular emergency signal, will be fired off on calling startEmergency()\n    emergencyTimer = new QTimer();\n    connect(emergencyTimer, SIGNAL(timeout()), this, SLOT(beep()));\n}\n\nQGCAudioWorker::~QGCAudioWorker()\n{\n#if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n    pVoice->Release();\n    pVoice = NULL;\n    ::CoUninitialize();\n#endif\n}\n\nvoid QGCAudioWorker::say(QString text, int severity)\n{\n    if (!muted)\n    {\n        \/\/ Prepend high priority text with alert beep\n        if (severity < GAudioOutput::AUDIO_SEVERITY_CRITICAL) {\n            beep();\n        }\n\n        \/\/ Wait for the last sound to finish\n        while (!sound->isFinished()) {\n            QGC::SLEEP::msleep(100);\n        }\n\n#if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n        pVoice->Speak(text.toStdWString().c_str(), SPF_DEFAULT, NULL);\n\n#elif defined Q_OS_LINUX && defined QGC_SPEECH_ENABLED\n        \/\/ Set size of string for espeak: +1 for the null-character\n        unsigned int espeak_size = strlen(text.toStdString().c_str()) + 1;\n        espeak_Synth(text.toStdString().c_str(), espeak_size, 0, POS_CHARACTER, 0, espeakCHARS_AUTO, NULL, NULL);\n\n#elif defined Q_OS_MAC && defined QGC_SPEECH_ENABLED\n        \/\/ Slashes necessary to have the right start to the sentence\n        \/\/ copying data prevents SpeakString from reading additional chars\n        text = \"\\\\\" + text;\n        std::wstring str = text.toStdWString();\n        unsigned char str2[1024] = {};\n        memcpy(str2, text.toLatin1().data(), str.length());\n        SpeakString(str2);\n\n        \/\/ Block the thread while busy\n        \/\/ because we run in our own thread, this doesn't\n        \/\/ halt the main application\n        while (SpeechBusy()) {\n            QGC::SLEEP::msleep(100);\n        }\n\n#else\n        \/\/ Make sure there isn't an unused variable warning when speech output is disabled\n        Q_UNUSED(text);\n#endif\n    }\n}\n\nvoid QGCAudioWorker::mute(bool mute)\n{\n    if (mute != muted)\n    {\n        this->muted = mute;\n        QSettings settings;\n        settings.setValue(QGC_GAUDIOOUTPUT_KEY + \"muted\", this->muted);\n\/\/        emit mutedChanged(muted);\n    }\n}\n\nvoid QGCAudioWorker::beep()\n{\n\n    if (!muted)\n    {\n        \/\/ Use QFile to transform path for all OS\n        QFile f(QCoreApplication::applicationDirPath() + QString(\"\/files\/audio\/alert.wav\"));\n        sound->play(f.fileName());\n    }\n}\n\nbool QGCAudioWorker::isMuted()\n{\n    return this->muted;\n}\n<commit_msg>Revert \"Make eSpeak on Linux synchronous\"<commit_after>#include <QSettings>\n#include <QDebug>\n#include <QCoreApplication>\n#include <QFile>\n#include <QSound>\n\n#include \"QGC.h\"\n#include \"QGCAudioWorker.h\"\n#include \"GAudioOutput.h\"\n\n#if defined Q_OS_MAC && defined QGC_SPEECH_ENABLED\n#include <ApplicationServices\/ApplicationServices.h>\n#endif\n\n\/\/ Speech synthesis is only supported with MSVC compiler\n#if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n\/\/ Documentation: http:\/\/msdn.microsoft.com\/en-us\/library\/ee125082%28v=VS.85%29.aspx\n#include <sapi.h>\n#endif\n\n#if defined Q_OS_LINUX && defined QGC_SPEECH_ENABLED\n\/\/ Using eSpeak for speech synthesis: following https:\/\/github.com\/mondhs\/espeak-sample\/blob\/master\/sampleSpeak.cpp\n#include <espeak\/speak_lib.h>\n#endif\n\n#define QGC_GAUDIOOUTPUT_KEY QString(\"QGC_AUDIOOUTPUT_\")\n\nQGCAudioWorker::QGCAudioWorker(QObject *parent) :\n    QObject(parent),\n    voiceIndex(0),\n    emergency(false),\n    muted(false),\n    #if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n    pVoice(NULL),\n    #endif\n    sound(NULL)\n{\n    \/\/ Load settings\n    QSettings settings;\n    muted = settings.value(QGC_GAUDIOOUTPUT_KEY + \"muted\", muted).toBool();\n}\n\nvoid QGCAudioWorker::init()\n{\n    sound = new QSound(\"\");\n\n#if defined Q_OS_LINUX && defined QGC_SPEECH_ENABLED\n    espeak_Initialize(AUDIO_OUTPUT_PLAYBACK, 500, NULL, 0); \/\/ initialize for playback with 500ms buffer and no options (see speak_lib.h)\n    espeak_VOICE *espeak_voice = espeak_GetCurrentVoice();\n    espeak_voice->languages = \"en-uk\"; \/\/ Default to British English\n    espeak_voice->identifier = NULL; \/\/ no specific voice file specified\n    espeak_voice->name = \"klatt\"; \/\/ espeak voice name\n    espeak_voice->gender = 2; \/\/ Female\n    espeak_voice->age = 0; \/\/ age not specified\n    espeak_SetVoiceByProperties(espeak_voice);\n#endif\n\n#if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n\n    if (FAILED(::CoInitialize(NULL)))\n    {\n        qDebug() << \"ERROR: Creating COM object for audio output failed!\";\n    }\n    else\n    {\n\n        HRESULT hr = CoCreateInstance(CLSID_SpVoice, NULL, CLSCTX_ALL, IID_ISpVoice, (void **)&pVoice);\n\n        if (FAILED(hr))\n        {\n            qDebug() << \"ERROR: Initializing voice for audio output failed!\";\n        }\n    }\n\n#endif\n\n    \/\/ Prepare regular emergency signal, will be fired off on calling startEmergency()\n    emergencyTimer = new QTimer();\n    connect(emergencyTimer, SIGNAL(timeout()), this, SLOT(beep()));\n}\n\nQGCAudioWorker::~QGCAudioWorker()\n{\n#if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n    pVoice->Release();\n    pVoice = NULL;\n    ::CoUninitialize();\n#endif\n}\n\nvoid QGCAudioWorker::say(QString text, int severity)\n{\n    if (!muted)\n    {\n        \/\/ Prepend high priority text with alert beep\n        if (severity < GAudioOutput::AUDIO_SEVERITY_CRITICAL) {\n            beep();\n        }\n\n        \/\/ Wait for the last sound to finish\n        while (!sound->isFinished()) {\n            QGC::SLEEP::msleep(100);\n        }\n\n#if defined _MSC_VER && defined QGC_SPEECH_ENABLED\n        pVoice->Speak(text.toStdWString().c_str(), SPF_DEFAULT, NULL);\n\n#elif defined Q_OS_LINUX && defined QGC_SPEECH_ENABLED\n        \/\/ Set size of string for espeak: +1 for the null-character\n        unsigned int espeak_size = strlen(text.toStdString().c_str()) + 1;\n        espeak_Synth(text.toStdString().c_str(), espeak_size, 0, POS_CHARACTER, 0, espeakCHARS_AUTO, NULL, NULL);\n\n#elif defined Q_OS_MAC && defined QGC_SPEECH_ENABLED\n        \/\/ Slashes necessary to have the right start to the sentence\n        \/\/ copying data prevents SpeakString from reading additional chars\n        text = \"\\\\\" + text;\n        std::wstring str = text.toStdWString();\n        unsigned char str2[1024] = {};\n        memcpy(str2, text.toLatin1().data(), str.length());\n        SpeakString(str2);\n\n        \/\/ Block the thread while busy\n        \/\/ because we run in our own thread, this doesn't\n        \/\/ halt the main application\n        while (SpeechBusy()) {\n            QGC::SLEEP::msleep(100);\n        }\n\n#else\n        \/\/ Make sure there isn't an unused variable warning when speech output is disabled\n        Q_UNUSED(text);\n#endif\n    }\n}\n\nvoid QGCAudioWorker::mute(bool mute)\n{\n    if (mute != muted)\n    {\n        this->muted = mute;\n        QSettings settings;\n        settings.setValue(QGC_GAUDIOOUTPUT_KEY + \"muted\", this->muted);\n\/\/        emit mutedChanged(muted);\n    }\n}\n\nvoid QGCAudioWorker::beep()\n{\n\n    if (!muted)\n    {\n        \/\/ Use QFile to transform path for all OS\n        QFile f(QCoreApplication::applicationDirPath() + QString(\"\/files\/audio\/alert.wav\"));\n        sound->play(f.fileName());\n    }\n}\n\nbool QGCAudioWorker::isMuted()\n{\n    return this->muted;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Remove unnecessary forward declaration<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n *  Author(s):\n *  - Laurent LEC <llec@aldebaran-robotics.com>\n *\n *  Copyright (c) 2012 Aldebaran Robotics. All rights reserved.\n *\/\n\n#include <gtest\/gtest.h>\n\n#include <QCoreApplication>\n\n#include <qimessaging\/qt\/QiTransportSocket>\n#include <qimessaging\/qt\/QiTransportServer>\n\nstatic QCoreApplication* app = 0;\n\nTEST(TransportServer, Listen)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString serverUrl = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(serverUrl);\n\n  ASSERT_TRUE(server.isListening());\n}\n\nTEST(TransportServer, ListeningUrl)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString serverUrl = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(serverUrl);\n\n  ASSERT_EQ(server.listeningUrl(), serverUrl);\n}\n\nTEST(TransportServer, ListenOnBadProtocol)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString serveurUrl = QString(\"chiche:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(serveurUrl);\n\n  ASSERT_FALSE(server.isListening());\n}\n\nTEST(TransportServer, ListenOnBadHost)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString serverUrl = QString(\"tcp:\/\/this.host.should.not.exist:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(serverUrl);\n\n  ASSERT_FALSE(server.isListening());\n}\n\nTEST(TransportServer, CloseAfterListen)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(service);\n  server.close();\n\n  ASSERT_FALSE(server.isListening());\n}\n\nTEST(TransportServer, HasPendingConnection)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(service);\n\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  QiTransportSocket socket;\n  socket.connectToHost(service);\n\n  app->exec();\n\n  ASSERT_TRUE(server.hasPendingConnections());\n}\n\nTEST(TransportServer, NextPendingConnection)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(service);\n\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  QiTransportSocket socket;\n  socket.connectToHost(service);\n\n  app->exec();\n\n  QiTransportSocket* incomingSocket = server.nextPendingConnection();\n\n  ASSERT_TRUE(incomingSocket != 0);\n\n  if (incomingSocket)\n  {\n    incomingSocket->close();\n    delete incomingSocket;\n  }\n\n  ASSERT_FALSE(server.hasPendingConnections());\n}\n\nTEST(TransportServer, MultipleConnections)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  server.listen(service);\n\n  for (int nbRetry = 100; nbRetry > 0; --nbRetry)\n  {\n    QiTransportSocket socket;\n    socket.connectToHost(service);\n\n    app->exec();\n\n    QiTransportSocket* incomingSocket = server.nextPendingConnection();\n\n    ASSERT_TRUE(incomingSocket != 0);\n\n    incomingSocket->close();\n    delete incomingSocket;\n\n    ASSERT_FALSE(server.hasPendingConnections());\n  }\n\n  server.close();\n}\n\nTEST(TransportServer, MultipleListens)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  for (int nbRetry = 100; nbRetry > 0; --nbRetry)\n  {\n    server.listen(service);\n\n    QiTransportSocket socket;\n    socket.connectToHost(service);\n\n    app->exec();\n\n    QiTransportSocket* incomingSocket = server.nextPendingConnection();\n\n    ASSERT_TRUE(incomingSocket != 0);\n\n    if (incomingSocket)\n    {\n      incomingSocket->close();\n      delete incomingSocket;\n    }\n\n    ASSERT_FALSE(server.hasPendingConnections());\n\n    server.close();\n  }\n}\n\nint main(int argc, char *argv[])\n{\n  ::testing::InitGoogleTest(&argc, argv);\n  app = new QCoreApplication (argc, argv);\n  return RUN_ALL_TESTS();\n}\n<commit_msg>Test listening on port 0<commit_after>\/*\n *  Author(s):\n *  - Laurent LEC <llec@aldebaran-robotics.com>\n *\n *  Copyright (c) 2012 Aldebaran Robotics. All rights reserved.\n *\/\n\n#include <gtest\/gtest.h>\n\n#include <QCoreApplication>\n\n#include <qimessaging\/qt\/QiTransportSocket>\n#include <qimessaging\/qt\/QiTransportServer>\n\nstatic QCoreApplication* app = 0;\n\nTEST(TransportServer, Listen)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString serverUrl = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(serverUrl);\n\n  ASSERT_TRUE(server.isListening());\n}\n\nTEST(TransportServer, ListeningUrl)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString serverUrl = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(serverUrl);\n\n  ASSERT_EQ(server.listeningUrl(), serverUrl);\n}\n\nTEST(TransportServer, ListenOnBadProtocol)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString serveurUrl = QString(\"chiche:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(serveurUrl);\n\n  ASSERT_FALSE(server.isListening());\n}\n\nTEST(TransportServer, ListenOnBadHost)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString serverUrl = QString(\"tcp:\/\/this.host.should.not.exist:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(serverUrl);\n\n  ASSERT_FALSE(server.isListening());\n}\n\nTEST(TransportServer, CloseAfterListen)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(service);\n  server.close();\n\n  ASSERT_FALSE(server.isListening());\n}\n\nTEST(TransportServer, HasPendingConnection)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(service);\n\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  QiTransportSocket socket;\n  socket.connectToHost(service);\n\n  app->exec();\n\n  ASSERT_TRUE(server.hasPendingConnections());\n}\n\nTEST(TransportServer, ListenPort0)\n{\n  QString service = QString(\"tcp:\/\/0.0.0.0:0\");\n\n  QiTransportServer server;\n  server.listen(service);\n\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  QiTransportSocket socket;\n  socket.connectToHost(server.listeningUrl());\n\n  app->exec();\n\n  ASSERT_TRUE(server.hasPendingConnections());\n}\n\nTEST(TransportServer, NextPendingConnection)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  server.listen(service);\n\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  QiTransportSocket socket;\n  socket.connectToHost(service);\n\n  app->exec();\n\n  QiTransportSocket* incomingSocket = server.nextPendingConnection();\n\n  ASSERT_TRUE(incomingSocket != 0);\n\n  if (incomingSocket)\n  {\n    incomingSocket->close();\n    delete incomingSocket;\n  }\n\n  ASSERT_FALSE(server.hasPendingConnections());\n}\n\nTEST(TransportServer, MultipleConnections)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  server.listen(service);\n\n  for (int nbRetry = 100; nbRetry > 0; --nbRetry)\n  {\n    QiTransportSocket socket;\n    socket.connectToHost(service);\n\n    app->exec();\n\n    QiTransportSocket* incomingSocket = server.nextPendingConnection();\n\n    ASSERT_TRUE(incomingSocket != 0);\n\n    incomingSocket->close();\n    delete incomingSocket;\n\n    ASSERT_FALSE(server.hasPendingConnections());\n  }\n\n  server.close();\n}\n\nTEST(TransportServer, MultipleListens)\n{\n  unsigned short port = qi::os::findAvailablePort(0);\n  QString service = QString(\"tcp:\/\/0.0.0.0:%1\").arg(port);\n\n  QiTransportServer server;\n  QObject::connect(&server, SIGNAL(newConnection()), app, SLOT(quit()));\n\n  for (int nbRetry = 100; nbRetry > 0; --nbRetry)\n  {\n    server.listen(service);\n\n    QiTransportSocket socket;\n    socket.connectToHost(service);\n\n    app->exec();\n\n    QiTransportSocket* incomingSocket = server.nextPendingConnection();\n\n    ASSERT_TRUE(incomingSocket != 0);\n\n    if (incomingSocket)\n    {\n      incomingSocket->close();\n      delete incomingSocket;\n    }\n\n    ASSERT_FALSE(server.hasPendingConnections());\n\n    server.close();\n  }\n}\n\nint main(int argc, char *argv[])\n{\n  ::testing::InitGoogleTest(&argc, argv);\n  app = new QCoreApplication (argc, argv);\n  return RUN_ALL_TESTS();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015 Cryptonomex, Inc., and contributors.\n *\n * The MIT License\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#pragma once\n\n#define GRAPHENE_SYMBOL \"PIC\"\n#define GRAPHENE_ADDRESS_PREFIX \"PIC\"\n\n#define GRAPHENE_MIN_ACCOUNT_NAME_LENGTH 1\n#define GRAPHENE_MAX_ACCOUNT_NAME_LENGTH 63\n\n#define GRAPHENE_MIN_ASSET_SYMBOL_LENGTH 3\n#define GRAPHENE_MAX_ASSET_SYMBOL_LENGTH 16\n\n#define GRAPHENE_MAX_SHARE_SUPPLY int64_t(1000000000000ll)\n#define GRAPHENE_MAX_PAY_RATE 10000 \/* 100% *\/\n#define GRAPHENE_MAX_SIG_CHECK_DEPTH 2\n\/**\n * Don't allow the committee_members to publish a limit that would\n * make the network unable to operate.\n *\/\n#define GRAPHENE_MIN_TRANSACTION_SIZE_LIMIT 1024\n#define GRAPHENE_MAX_BLOCK_INTERVAL  30 \/* seconds *\/\n#define GRAPHENE_MIN_BLOCK_INTERVAL   1 \/* seconds *\/\n\n#define GRAPHENE_DEFAULT_BLOCK_INTERVAL  3 \/* seconds *\/\n#define GRAPHENE_DEFAULT_MAX_TRANSACTION_SIZE 2048\n#define GRAPHENE_DEFAULT_MAX_BLOCK_SIZE  (GRAPHENE_DEFAULT_MAX_TRANSACTION_SIZE*GRAPHENE_DEFAULT_BLOCK_INTERVAL*200000)\n#define GRAPHENE_DEFAULT_MAX_TIME_UNTIL_EXPIRATION (60*60*24) \/\/ seconds,  aka: 1 day\n#define GRAPHENE_DEFAULT_MAINTENANCE_INTERVAL  (60*60*24) \/\/ seconds, aka: 1 day\n#define GRAPHENE_DEFAULT_MAINTENANCE_SKIP_SLOTS 3  \/\/ number of slots to skip for maintenance interval\n\n#define GRAPHENE_MIN_UNDO_HISTORY 10\n#define GRAPHENE_MAX_UNDO_HISTORY 10000\n\n#define GRAPHENE_MIN_BLOCK_SIZE_LIMIT (GRAPHENE_MIN_TRANSACTION_SIZE_LIMIT*5) \/\/ 5 transactions per block\n#define GRAPHENE_MIN_TRANSACTION_EXPIRATION_LIMIT (GRAPHENE_MAX_BLOCK_INTERVAL * 5) \/\/ 5 transactions per block\n#define GRAPHENE_BLOCKCHAIN_PRECISION                           uint64_t( 100000 )\n\n#define GRAPHENE_BLOCKCHAIN_PRECISION_DIGITS                    5\n#define GRAPHENE_DEFAULT_TRANSFER_FEE                           (1*GRAPHENE_BLOCKCHAIN_PRECISION)\n#define GRAPHENE_MAX_INSTANCE_ID                                (uint64_t(-1)>>16)\n\/** percentage fields are fixed point with a denominator of 10,000 *\/\n#define GRAPHENE_100_PERCENT                                    10000\n#define GRAPHENE_1_PERCENT                                      (GRAPHENE_100_PERCENT\/100)\n\/** NOTE: making this a power of 2 (say 2^15) would greatly accelerate fee calcs *\/\n#define GRAPHENE_MAX_MARKET_FEE_PERCENT                         GRAPHENE_100_PERCENT\n#define GRAPHENE_DEFAULT_FORCE_SETTLEMENT_DELAY                 (60*60*24) \/\/\/< 1 day\n#define GRAPHENE_DEFAULT_FORCE_SETTLEMENT_OFFSET                0 \/\/\/< 1%\n#define GRAPHENE_DEFAULT_FORCE_SETTLEMENT_MAX_VOLUME            (20* GRAPHENE_1_PERCENT) \/\/\/< 20%\n#define GRAPHENE_DEFAULT_PRICE_FEED_LIFETIME                    (60*60*24) \/\/\/< 1 day\n#define GRAPHENE_MAX_FEED_PRODUCERS                             200\n#define GRAPHENE_DEFAULT_MAX_AUTHORITY_MEMBERSHIP               10\n#define GRAPHENE_DEFAULT_MAX_ASSET_WHITELIST_AUTHORITIES        10\n#define GRAPHENE_DEFAULT_MAX_ASSET_FEED_PUBLISHERS              10\n\n\/**\n *  These ratios are fixed point numbers with a denominator of GRAPHENE_COLLATERAL_RATIO_DENOM, the\n *  minimum maitenance collateral is therefore 1.001x and the default\n *  maintenance ratio is 1.75x\n *\/\n\/\/\/@{\n#define GRAPHENE_COLLATERAL_RATIO_DENOM                 1000\n#define GRAPHENE_MIN_COLLATERAL_RATIO                   1001  \/\/\/< lower than this could result in divide by 0\n#define GRAPHENE_MAX_COLLATERAL_RATIO                   32000 \/\/\/< higher than this is unnecessary and may exceed int16 storage\n#define GRAPHENE_DEFAULT_MAINTENANCE_COLLATERAL_RATIO   1750 \/\/\/< Call when collateral only pays off 175% the debt\n#define GRAPHENE_DEFAULT_MAX_SHORT_SQUEEZE_RATIO        1500 \/\/\/< Stop calling when collateral only pays off 150% of the debt\n\/\/\/@}\n#define GRAPHENE_DEFAULT_MARGIN_PERIOD_SEC              (30*60*60*24)\n\n#define GRAPHENE_DEFAULT_MIN_WITNESS_COUNT                    (11)\n#define GRAPHENE_DEFAULT_MIN_COMMITTEE_MEMBER_COUNT           (11)\n#define GRAPHENE_DEFAULT_MAX_WITNESSES                        (101) \/\/ SHOULD BE ODD\n#define GRAPHENE_DEFAULT_MAX_COMMITTEE                        (101) \/\/ SHOULD BE ODD\n#define GRAPHENE_DEFAULT_MAX_PROPOSAL_LIFETIME_SEC            (60*60*24*7*4) \/\/ Four weeks\n#define GRAPHENE_DEFAULT_COMMITTEE_PROPOSAL_REVIEW_PERIOD_SEC (60*60*24) \/\/ One Day\n#define GRAPHENE_DEFAULT_NETWORK_PERCENT_OF_FEE               (20*GRAPHENE_1_PERCENT)\n#define GRAPHENE_DEFAULT_LIFETIME_REFERRER_PERCENT_OF_FEE     (30*GRAPHENE_1_PERCENT)\n#define GRAPHENE_DEFAULT_MAX_BULK_DISCOUNT_PERCENT            (50*GRAPHENE_1_PERCENT)\n#define GRAPHENE_DEFAULT_BULK_DISCOUNT_THRESHOLD_MIN          ( GRAPHENE_BLOCKCHAIN_PRECISION*int64_t(1000) )\n#define GRAPHENE_DEFAULT_BULK_DISCOUNT_THRESHOLD_MAX          ( GRAPHENE_DEFAULT_BULK_DISCOUNT_THRESHOLD_MIN*int64_t(100) )\n#define GRAPHENE_DEFAULT_CASHBACK_VESTING_PERIOD_SEC          (60*60*24*365) \/\/\/< 1 year\n#define GRAPHENE_DEFAULT_CASHBACK_VESTING_THRESHOLD           (GRAPHENE_BLOCKCHAIN_PRECISION*int64_t(100))\n#define GRAPHENE_DEFAULT_BURN_PERCENT_OF_FEE                  (20*GRAPHENE_1_PERCENT)\n#define GRAPHENE_WITNESS_PAY_PERCENT_PRECISION                (1000000000)\n#define GRAPHENE_DEFAULT_MAX_ASSERT_OPCODE                    1\n#define GRAPHENE_DEFAULT_FEE_LIQUIDATION_THRESHOLD            GRAPHENE_BLOCKCHAIN_PRECISION * 100;\n#define GRAPHENE_DEFAULT_ACCOUNTS_PER_FEE_SCALE               1000\n#define GRAPHENE_DEFAULT_ACCOUNT_FEE_SCALE_BITSHIFTS          4\n#define GRAPHENE_DEFAULT_MAX_BUYBACK_MARKETS                  4\n\n#define GRAPHENE_MAX_WORKER_NAME_LENGTH                       63\n\n#define GRAPHENE_MAX_URL_LENGTH                               127\n\n\/\/ counter initialization values used to derive near and far future seeds for shuffling witnesses\n\/\/ we use the fractional bits of sqrt(2) in hex\n#define GRAPHENE_NEAR_SCHEDULE_CTR_IV                    ( (uint64_t( 0x6a09 ) << 0x30)    \\\n                                                         | (uint64_t( 0xe667 ) << 0x20)    \\\n                                                         | (uint64_t( 0xf3bc ) << 0x10)    \\\n                                                         | (uint64_t( 0xc908 )        ) )\n\n\/\/ and the fractional bits of sqrt(3) in hex\n#define GRAPHENE_FAR_SCHEDULE_CTR_IV                     ( (uint64_t( 0xbb67 ) << 0x30)    \\\n                                                         | (uint64_t( 0xae85 ) << 0x20)    \\\n                                                         | (uint64_t( 0x84ca ) << 0x10)    \\\n                                                         | (uint64_t( 0xa73b )        ) )\n\n\/**\n * every second, the fraction of burned core asset which cycles is\n * GRAPHENE_CORE_ASSET_CYCLE_RATE \/ (1 << GRAPHENE_CORE_ASSET_CYCLE_RATE_BITS)\n *\/\n#define GRAPHENE_CORE_ASSET_CYCLE_RATE                        17\n#define GRAPHENE_CORE_ASSET_CYCLE_RATE_BITS                   32\n\n#define GRAPHENE_DEFAULT_WITNESS_PAY_PER_BLOCK            (GRAPHENE_BLOCKCHAIN_PRECISION * int64_t( 10) )\n#define GRAPHENE_DEFAULT_WITNESS_PAY_VESTING_SECONDS      (60*60*24)\n#define GRAPHENE_DEFAULT_WORKER_BUDGET_PER_DAY            (GRAPHENE_BLOCKCHAIN_PRECISION * int64_t(500) * 1000 )\n\n#define GRAPHENE_DEFAULT_MINIMUM_FEEDS                       7\n\n#define GRAPHENE_MAX_INTEREST_APR                            uint16_t( 10000 )\n\n#define GRAPHENE_RECENTLY_MISSED_COUNT_INCREMENT             4\n#define GRAPHENE_RECENTLY_MISSED_COUNT_DECREMENT             3\n\n#define GRAPHENE_CURRENT_DB_VERSION                          \"PIC1.0\"\n\n#define GRAPHENE_IRREVERSIBLE_THRESHOLD                      (70 * GRAPHENE_1_PERCENT)\n\n\/**\n *  Reserved Account IDs with special meaning\n *\/\n\/\/\/@{\n\/\/\/ Represents the current committee members, two-week review period\n#define GRAPHENE_COMMITTEE_ACCOUNT (graphene::chain::account_id_type(0))\n\/\/\/ Represents the current witnesses\n#define GRAPHENE_WITNESS_ACCOUNT (graphene::chain::account_id_type(1))\n\/\/\/ Represents the current committee members\n#define GRAPHENE_RELAXED_COMMITTEE_ACCOUNT (graphene::chain::account_id_type(2))\n\/\/\/ Represents the canonical account with NO authority (nobody can access funds in null account)\n#define GRAPHENE_NULL_ACCOUNT (graphene::chain::account_id_type(3))\n\/\/\/ Represents the canonical account with WILDCARD authority (anybody can access funds in temp account)\n#define GRAPHENE_TEMP_ACCOUNT (graphene::chain::account_id_type(4))\n\/\/\/ Represents the canonical account for specifying you will vote directly (as opposed to a proxy)\n#define GRAPHENE_PROXY_TO_SELF_ACCOUNT (graphene::chain::account_id_type(5))\n\/\/\/ Represents the account who receives all construction capital\n#define GRAPHENE_CONSTRUCTION_CAPITAL_ACCOUNT (graphene::chain::account_id_type(6))\n\/\/\/ Represents the account who receives market found generated by construction capital\n#define GRAPHENE_MARKET_FOUND_ACCOUNT (graphene::chain::account_id_type(7))\n\/\/\/ Represents the account who issue the deflation\n#define GRAPHENE_DEFLATION_ISSUE_ACCOUNT (graphene::chain::account_id_type(30306))\n\/\/\/ Represents the very first account who will not be deflated as a marker\n#define GRAPHENE_DEFLATION_ACCOUNT_START_MARKER (graphene::chain::account_id_type(8))\n\/\/\/ Sentinel value used in the scheduler.\n#define GRAPHENE_NULL_WITNESS (graphene::chain::witness_id_type(0))\n\/\/\/@}\n\n#define GRAPHENE_FBA_STEALTH_DESIGNATED_ASSET (asset_id_type(743))\n\n\/**\n * Incentive and Construction Capital defines\n *\/\n#define GRAPHENE_DEFAULT_MAX_INCENTIVE_OPERATIONS_PER_BLOCK         256\n#define GRAPHENE_DEFAULT_MAX_DEFLATION_OPERATIONS_PER_BLOCK         1024 \/\/ 128\n#define GRAPHENE_DEFAULT_MIN_CONSTRUCTION_CAPITAL_AMOUNT            30000000\n#define GRAPHENE_DEFAULT_MIN_CONSTRUCTION_CAPITAL_PERIOD            604800\n#define GRAPHENE_DEFAULT_MAX_CONSTRUCTION_CAPITAL_PERIOD            31536000    \/\/1 year\n#define GRAPHENE_DEFAULT_MIN_CONSTRUCTION_CAPITAL_PERIOD_LEN        50\n#define GRAPHENE_DEFAULT_MAX_CONSTRUCTION_CAPITAL_PERIOD_LEN        600\n#define GRAPHENE_DEFAULT_MAX_CONSTRUCTION_CAPITAL_VOTE              5\n#define GRAPHENE_DEFAULT_MAX_INCENTIVE_ACCELERATE_RATE              100\n#define GRAPHENE_SECONDS_PER_YEAR                                   31536000\n#define GRAPHENE_ISSUANCE_RATE_SCALE                                100000000\n#define GRAPHENE_DEFAULT_ISSUANCE_RATE                              104285714\n#define GRAPHENE_DEFAULT_INSTANT_PAYBACL_RATE                       15000000\n#define GRAPHENE_EXCHANGE_RATE_SCALE                                10000000\n\n#define GRAPHENE_MINIMUM_DEFLATION_INTERVAL 300 \/\/(3600*24 - 600)\n#define GRAPHENE_DEFLATION_RATE_SCALE (100000000)\n<commit_msg>deflation config<commit_after>\/*\n * Copyright (c) 2015 Cryptonomex, Inc., and contributors.\n *\n * The MIT License\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#pragma once\n\n#define GRAPHENE_SYMBOL \"PIC\"\n#define GRAPHENE_ADDRESS_PREFIX \"PIC\"\n\n#define GRAPHENE_MIN_ACCOUNT_NAME_LENGTH 1\n#define GRAPHENE_MAX_ACCOUNT_NAME_LENGTH 63\n\n#define GRAPHENE_MIN_ASSET_SYMBOL_LENGTH 3\n#define GRAPHENE_MAX_ASSET_SYMBOL_LENGTH 16\n\n#define GRAPHENE_MAX_SHARE_SUPPLY int64_t(1000000000000ll)\n#define GRAPHENE_MAX_PAY_RATE 10000 \/* 100% *\/\n#define GRAPHENE_MAX_SIG_CHECK_DEPTH 2\n\/**\n * Don't allow the committee_members to publish a limit that would\n * make the network unable to operate.\n *\/\n#define GRAPHENE_MIN_TRANSACTION_SIZE_LIMIT 1024\n#define GRAPHENE_MAX_BLOCK_INTERVAL  30 \/* seconds *\/\n#define GRAPHENE_MIN_BLOCK_INTERVAL   1 \/* seconds *\/\n\n#define GRAPHENE_DEFAULT_BLOCK_INTERVAL  3 \/* seconds *\/\n#define GRAPHENE_DEFAULT_MAX_TRANSACTION_SIZE 2048\n#define GRAPHENE_DEFAULT_MAX_BLOCK_SIZE  (GRAPHENE_DEFAULT_MAX_TRANSACTION_SIZE*GRAPHENE_DEFAULT_BLOCK_INTERVAL*200000)\n#define GRAPHENE_DEFAULT_MAX_TIME_UNTIL_EXPIRATION (60*60*24) \/\/ seconds,  aka: 1 day\n#define GRAPHENE_DEFAULT_MAINTENANCE_INTERVAL  (60*60*24) \/\/ seconds, aka: 1 day\n#define GRAPHENE_DEFAULT_MAINTENANCE_SKIP_SLOTS 3  \/\/ number of slots to skip for maintenance interval\n\n#define GRAPHENE_MIN_UNDO_HISTORY 10\n#define GRAPHENE_MAX_UNDO_HISTORY 10000\n\n#define GRAPHENE_MIN_BLOCK_SIZE_LIMIT (GRAPHENE_MIN_TRANSACTION_SIZE_LIMIT*5) \/\/ 5 transactions per block\n#define GRAPHENE_MIN_TRANSACTION_EXPIRATION_LIMIT (GRAPHENE_MAX_BLOCK_INTERVAL * 5) \/\/ 5 transactions per block\n#define GRAPHENE_BLOCKCHAIN_PRECISION                           uint64_t( 100000 )\n\n#define GRAPHENE_BLOCKCHAIN_PRECISION_DIGITS                    5\n#define GRAPHENE_DEFAULT_TRANSFER_FEE                           (1*GRAPHENE_BLOCKCHAIN_PRECISION)\n#define GRAPHENE_MAX_INSTANCE_ID                                (uint64_t(-1)>>16)\n\/** percentage fields are fixed point with a denominator of 10,000 *\/\n#define GRAPHENE_100_PERCENT                                    10000\n#define GRAPHENE_1_PERCENT                                      (GRAPHENE_100_PERCENT\/100)\n\/** NOTE: making this a power of 2 (say 2^15) would greatly accelerate fee calcs *\/\n#define GRAPHENE_MAX_MARKET_FEE_PERCENT                         GRAPHENE_100_PERCENT\n#define GRAPHENE_DEFAULT_FORCE_SETTLEMENT_DELAY                 (60*60*24) \/\/\/< 1 day\n#define GRAPHENE_DEFAULT_FORCE_SETTLEMENT_OFFSET                0 \/\/\/< 1%\n#define GRAPHENE_DEFAULT_FORCE_SETTLEMENT_MAX_VOLUME            (20* GRAPHENE_1_PERCENT) \/\/\/< 20%\n#define GRAPHENE_DEFAULT_PRICE_FEED_LIFETIME                    (60*60*24) \/\/\/< 1 day\n#define GRAPHENE_MAX_FEED_PRODUCERS                             200\n#define GRAPHENE_DEFAULT_MAX_AUTHORITY_MEMBERSHIP               10\n#define GRAPHENE_DEFAULT_MAX_ASSET_WHITELIST_AUTHORITIES        10\n#define GRAPHENE_DEFAULT_MAX_ASSET_FEED_PUBLISHERS              10\n\n\/**\n *  These ratios are fixed point numbers with a denominator of GRAPHENE_COLLATERAL_RATIO_DENOM, the\n *  minimum maitenance collateral is therefore 1.001x and the default\n *  maintenance ratio is 1.75x\n *\/\n\/\/\/@{\n#define GRAPHENE_COLLATERAL_RATIO_DENOM                 1000\n#define GRAPHENE_MIN_COLLATERAL_RATIO                   1001  \/\/\/< lower than this could result in divide by 0\n#define GRAPHENE_MAX_COLLATERAL_RATIO                   32000 \/\/\/< higher than this is unnecessary and may exceed int16 storage\n#define GRAPHENE_DEFAULT_MAINTENANCE_COLLATERAL_RATIO   1750 \/\/\/< Call when collateral only pays off 175% the debt\n#define GRAPHENE_DEFAULT_MAX_SHORT_SQUEEZE_RATIO        1500 \/\/\/< Stop calling when collateral only pays off 150% of the debt\n\/\/\/@}\n#define GRAPHENE_DEFAULT_MARGIN_PERIOD_SEC              (30*60*60*24)\n\n#define GRAPHENE_DEFAULT_MIN_WITNESS_COUNT                    (11)\n#define GRAPHENE_DEFAULT_MIN_COMMITTEE_MEMBER_COUNT           (11)\n#define GRAPHENE_DEFAULT_MAX_WITNESSES                        (101) \/\/ SHOULD BE ODD\n#define GRAPHENE_DEFAULT_MAX_COMMITTEE                        (101) \/\/ SHOULD BE ODD\n#define GRAPHENE_DEFAULT_MAX_PROPOSAL_LIFETIME_SEC            (60*60*24*7*4) \/\/ Four weeks\n#define GRAPHENE_DEFAULT_COMMITTEE_PROPOSAL_REVIEW_PERIOD_SEC (60*60*24) \/\/ One Day\n#define GRAPHENE_DEFAULT_NETWORK_PERCENT_OF_FEE               (20*GRAPHENE_1_PERCENT)\n#define GRAPHENE_DEFAULT_LIFETIME_REFERRER_PERCENT_OF_FEE     (30*GRAPHENE_1_PERCENT)\n#define GRAPHENE_DEFAULT_MAX_BULK_DISCOUNT_PERCENT            (50*GRAPHENE_1_PERCENT)\n#define GRAPHENE_DEFAULT_BULK_DISCOUNT_THRESHOLD_MIN          ( GRAPHENE_BLOCKCHAIN_PRECISION*int64_t(1000) )\n#define GRAPHENE_DEFAULT_BULK_DISCOUNT_THRESHOLD_MAX          ( GRAPHENE_DEFAULT_BULK_DISCOUNT_THRESHOLD_MIN*int64_t(100) )\n#define GRAPHENE_DEFAULT_CASHBACK_VESTING_PERIOD_SEC          (60*60*24*365) \/\/\/< 1 year\n#define GRAPHENE_DEFAULT_CASHBACK_VESTING_THRESHOLD           (GRAPHENE_BLOCKCHAIN_PRECISION*int64_t(100))\n#define GRAPHENE_DEFAULT_BURN_PERCENT_OF_FEE                  (20*GRAPHENE_1_PERCENT)\n#define GRAPHENE_WITNESS_PAY_PERCENT_PRECISION                (1000000000)\n#define GRAPHENE_DEFAULT_MAX_ASSERT_OPCODE                    1\n#define GRAPHENE_DEFAULT_FEE_LIQUIDATION_THRESHOLD            GRAPHENE_BLOCKCHAIN_PRECISION * 100;\n#define GRAPHENE_DEFAULT_ACCOUNTS_PER_FEE_SCALE               1000\n#define GRAPHENE_DEFAULT_ACCOUNT_FEE_SCALE_BITSHIFTS          4\n#define GRAPHENE_DEFAULT_MAX_BUYBACK_MARKETS                  4\n\n#define GRAPHENE_MAX_WORKER_NAME_LENGTH                       63\n\n#define GRAPHENE_MAX_URL_LENGTH                               127\n\n\/\/ counter initialization values used to derive near and far future seeds for shuffling witnesses\n\/\/ we use the fractional bits of sqrt(2) in hex\n#define GRAPHENE_NEAR_SCHEDULE_CTR_IV                    ( (uint64_t( 0x6a09 ) << 0x30)    \\\n                                                         | (uint64_t( 0xe667 ) << 0x20)    \\\n                                                         | (uint64_t( 0xf3bc ) << 0x10)    \\\n                                                         | (uint64_t( 0xc908 )        ) )\n\n\/\/ and the fractional bits of sqrt(3) in hex\n#define GRAPHENE_FAR_SCHEDULE_CTR_IV                     ( (uint64_t( 0xbb67 ) << 0x30)    \\\n                                                         | (uint64_t( 0xae85 ) << 0x20)    \\\n                                                         | (uint64_t( 0x84ca ) << 0x10)    \\\n                                                         | (uint64_t( 0xa73b )        ) )\n\n\/**\n * every second, the fraction of burned core asset which cycles is\n * GRAPHENE_CORE_ASSET_CYCLE_RATE \/ (1 << GRAPHENE_CORE_ASSET_CYCLE_RATE_BITS)\n *\/\n#define GRAPHENE_CORE_ASSET_CYCLE_RATE                        17\n#define GRAPHENE_CORE_ASSET_CYCLE_RATE_BITS                   32\n\n#define GRAPHENE_DEFAULT_WITNESS_PAY_PER_BLOCK            (GRAPHENE_BLOCKCHAIN_PRECISION * int64_t( 10) )\n#define GRAPHENE_DEFAULT_WITNESS_PAY_VESTING_SECONDS      (60*60*24)\n#define GRAPHENE_DEFAULT_WORKER_BUDGET_PER_DAY            (GRAPHENE_BLOCKCHAIN_PRECISION * int64_t(500) * 1000 )\n\n#define GRAPHENE_DEFAULT_MINIMUM_FEEDS                       7\n\n#define GRAPHENE_MAX_INTEREST_APR                            uint16_t( 10000 )\n\n#define GRAPHENE_RECENTLY_MISSED_COUNT_INCREMENT             4\n#define GRAPHENE_RECENTLY_MISSED_COUNT_DECREMENT             3\n\n#define GRAPHENE_CURRENT_DB_VERSION                          \"PIC1.0\"\n\n#define GRAPHENE_IRREVERSIBLE_THRESHOLD                      (70 * GRAPHENE_1_PERCENT)\n\n\/**\n *  Reserved Account IDs with special meaning\n *\/\n\/\/\/@{\n\/\/\/ Represents the current committee members, two-week review period\n#define GRAPHENE_COMMITTEE_ACCOUNT (graphene::chain::account_id_type(0))\n\/\/\/ Represents the current witnesses\n#define GRAPHENE_WITNESS_ACCOUNT (graphene::chain::account_id_type(1))\n\/\/\/ Represents the current committee members\n#define GRAPHENE_RELAXED_COMMITTEE_ACCOUNT (graphene::chain::account_id_type(2))\n\/\/\/ Represents the canonical account with NO authority (nobody can access funds in null account)\n#define GRAPHENE_NULL_ACCOUNT (graphene::chain::account_id_type(3))\n\/\/\/ Represents the canonical account with WILDCARD authority (anybody can access funds in temp account)\n#define GRAPHENE_TEMP_ACCOUNT (graphene::chain::account_id_type(4))\n\/\/\/ Represents the canonical account for specifying you will vote directly (as opposed to a proxy)\n#define GRAPHENE_PROXY_TO_SELF_ACCOUNT (graphene::chain::account_id_type(5))\n\/\/\/ Represents the account who receives all construction capital\n#define GRAPHENE_CONSTRUCTION_CAPITAL_ACCOUNT (graphene::chain::account_id_type(6))\n\/\/\/ Represents the account who receives market found generated by construction capital\n#define GRAPHENE_MARKET_FOUND_ACCOUNT (graphene::chain::account_id_type(7))\n\/\/\/ Represents the account who issue the deflation\n#define GRAPHENE_DEFLATION_ISSUE_ACCOUNT (graphene::chain::account_id_type(55120))\n\/\/\/ Represents the very first account who will not be deflated as a marker\n#define GRAPHENE_DEFLATION_ACCOUNT_START_MARKER (graphene::chain::account_id_type(8))\n\/\/\/ Sentinel value used in the scheduler.\n#define GRAPHENE_NULL_WITNESS (graphene::chain::witness_id_type(0))\n\/\/\/@}\n\n#define GRAPHENE_FBA_STEALTH_DESIGNATED_ASSET (asset_id_type(743))\n\n\/**\n * Incentive and Construction Capital defines\n *\/\n#define GRAPHENE_DEFAULT_MAX_INCENTIVE_OPERATIONS_PER_BLOCK         256\n#define GRAPHENE_DEFAULT_MAX_DEFLATION_OPERATIONS_PER_BLOCK         256\n#define GRAPHENE_DEFAULT_MIN_CONSTRUCTION_CAPITAL_AMOUNT            30000000\n#define GRAPHENE_DEFAULT_MIN_CONSTRUCTION_CAPITAL_PERIOD            604800\n#define GRAPHENE_DEFAULT_MAX_CONSTRUCTION_CAPITAL_PERIOD            31536000    \/\/1 year\n#define GRAPHENE_DEFAULT_MIN_CONSTRUCTION_CAPITAL_PERIOD_LEN        50\n#define GRAPHENE_DEFAULT_MAX_CONSTRUCTION_CAPITAL_PERIOD_LEN        600\n#define GRAPHENE_DEFAULT_MAX_CONSTRUCTION_CAPITAL_VOTE              5\n#define GRAPHENE_DEFAULT_MAX_INCENTIVE_ACCELERATE_RATE              100\n#define GRAPHENE_SECONDS_PER_YEAR                                   31536000\n#define GRAPHENE_ISSUANCE_RATE_SCALE                                100000000\n#define GRAPHENE_DEFAULT_ISSUANCE_RATE                              104285714\n#define GRAPHENE_DEFAULT_INSTANT_PAYBACL_RATE                       15000000\n#define GRAPHENE_EXCHANGE_RATE_SCALE                                10000000\n\n#define GRAPHENE_MINIMUM_DEFLATION_INTERVAL 600 \/\/(3600*24 - 600)\n#define GRAPHENE_DEFLATION_RATE_SCALE (100000000)\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  ex9_43.cpp\n\/\/  Exercise 9.43\n\/\/\n\/\/  Created by pezy on 6\/18\/15.\n\/\/  Updated by sanerror on 10\/16\/16.\n\/\/  Copyright (c) 2014 pezy. All rights reserved.\n\/\/\n\/\/  @Brief  Write a function that takes three strings, s, oldVal, and newVal.\n\/\/          Using iterators, and the insert and erase functions replace\n\/\/          all instances of oldVal that appear in s by newVal.\n\/\/          Test your function by using it to replace common abbreviations,\n\/\/          such as \"tho\" by \"though\" and \"thru\" by \"through\".\n\n#include <string>\nusing std::string;\n\n#include <iostream>\n\nvoid Replace(string& s, const string& oldVal, const string& newVal)\n{\n\tfor (auto beg = s.begin(); beg != s.end(); ) {\n\t\tif (std::distance(beg, s.end()) <\n\t\t\tstd::distance(oldVal.begin(), oldVal.end()))\n\t\t\tbreak;\n\t\tif (*beg == oldVal.front() && string{ beg, beg + oldVal.size() } == oldVal) {\n\t\t\tbeg = s.erase(beg, beg + oldVal.size());\n\t\t\tbeg = s.insert(beg, newVal.cbegin(), newVal.cend()) + newVal.size();\n\t\t}\n\t\telse {\n\t\t\t++beg;\n\t\t}\n\t}\n}\nint main()\n{\n    {\n        string str{\"To drive straight thru is a foolish, tho courageous act.\"};\n        Replace(str, \"thru\", \"through\");\n        Replace(str, \"tho\", \"though\");\n        std::cout << str << std::endl;\n    }\n    {\n        string str{\n            \"To drive straight thruthru is a foolish, thotho courageous act.\"};\n        Replace(str, \"thru\", \"through\");\n        Replace(str, \"tho\", \"though\");\n        std::cout << str << std::endl;\n    }\n    {\n        string str{\"To drive straight thru is a foolish, tho courageous act.\"};\n        Replace(str, \"thru\", \"thruthru\");\n        Replace(str, \"tho\", \"though\");\n        std::cout << str << std::endl;\n    }\n    {\n        string str{\"my world is a big world\"};\n        Replace(str, \"world\",\n                \"worldddddddddddddddddddddddddddddddddddddddddddddddd\");\n        std::cout << str << std::endl;\n    }\n    return 0;\n}\n<commit_msg>improving #84 format.<commit_after>\/\/\n\/\/  ex9_43.cpp\n\/\/  Exercise 9.43\n\/\/\n\/\/  Created by pezy on 6\/18\/15.\n\/\/  Updated by sanerror on 10\/16\/16.\n\/\/  Copyright (c) 2014 pezy. All rights reserved.\n\/\/\n\/\/  @Brief  Write a function that takes three strings, s, oldVal, and newVal.\n\/\/          Using iterators, and the insert and erase functions replace\n\/\/          all instances of oldVal that appear in s by newVal.\n\/\/          Test your function by using it to replace common abbreviations,\n\/\/          such as \"tho\" by \"though\" and \"thru\" by \"through\".\n\n#include <string>\nusing std::string;\n\n#include <iostream>\n\nvoid Replace(string& s, const string& oldVal, const string& newVal)\n{\n    for (auto beg = s.begin(); std::distance(beg, s.end()) >=\n                               std::distance(oldVal.begin(), oldVal.end());) {\n        if (string{beg, beg + oldVal.size()} == oldVal) {\n            beg = s.erase(beg, beg + oldVal.size());\n            beg = s.insert(beg, newVal.cbegin(), newVal.cend());\n            std::advance(beg, newVal.size());\n        }\n        else\n            ++beg;\n    }\n}\n\nint main()\n{\n    {\n        string str{\"To drive straight thru is a foolish, tho courageous act.\"};\n        Replace(str, \"thru\", \"through\");\n        Replace(str, \"tho\", \"though\");\n        std::cout << str << std::endl;\n    }\n    {\n        string str{\n            \"To drive straight thruthru is a foolish, thotho courageous act.\"};\n        Replace(str, \"thru\", \"through\");\n        Replace(str, \"tho\", \"though\");\n        std::cout << str << std::endl;\n    }\n    {\n        string str{\"To drive straight thru is a foolish, tho courageous act.\"};\n        Replace(str, \"thru\", \"thruthru\");\n        Replace(str, \"tho\", \"though\");\n        std::cout << str << std::endl;\n    }\n    {\n        string str{\"my world is a big world\"};\n        Replace(str, \"world\",\n                \"worldddddddddddddddddddddddddddddddddddddddddddddddd\");\n        std::cout << str << std::endl;\n    }\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n    @brief Implementation of Kalman-specific code in beacon-based pose\n   estimator, to reduce incremental build times.\n\n    @date 2015\n\n    @author\n    Sensics, Inc.\n    <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2015 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#include <iostream>\n#include <osvr\/Util\/EigenCoreGeometry.h>\n#if 0\ntemplate <typename T>\ninline void dumpKalmanDebugOuput(const char name[], const char expr[],\n                                 T const &value) {\n    std::cout << \"\\n(Kalman Debug Output) \" << name << \" [\" << expr << \"]:\\n\"\n              << value << std::endl;\n}\n#endif\n\n\/\/ Internal Includes\n#include \"BeaconBasedPoseEstimator.h\"\n#include \"ImagePointMeasurement.h\"\n#include \"cvToEigen.h\"\n\n\/\/ Library\/third-party includes\n#include <osvr\/Kalman\/FlexibleKalmanFilter.h>\n#include <osvr\/Kalman\/AugmentedProcessModel.h>\n#include <osvr\/Kalman\/AugmentedState.h>\n#include <osvr\/Kalman\/ConstantProcess.h>\n\n#include <osvr\/Util\/EigenInterop.h>\n\n#include <opencv2\/core\/eigen.hpp>\n\n\/\/ Standard includes\n\/\/ - none\n\nnamespace osvr {\nnamespace vbtracker {\n    static const auto LOW_BEACON_CUTOFF = 5;\n\n    static const auto DIM_BEACON_CUTOFF_TO_SKIP_BRIGHTS = 4;\n\n    static const auto MAX_Z_COMPONENT = -0.3;\n\n    bool BeaconBasedPoseEstimator::m_kalmanAutocalibEstimator(LedGroup &leds,\n                                                              double dt) {\n        auto const beaconsSize = m_beacons.size();\n        \/\/ Default measurement variance (for now, factor) per axis.\n        double varianceFactor = 1;\n\n        auto maxBoxRatio = m_params.boundingBoxFilterRatio;\n        auto minBoxRatio = 1.f \/ m_params.boundingBoxFilterRatio;\n\n        \/\/ Default to using all the measurements we can\n        auto skipBright = false;\n        {\n            auto totalLeds = leds.size();\n            auto identified = std::size_t{0};\n            auto inBoundsID = std::size_t{0};\n            auto inBoundsBright = std::size_t{0};\n            auto inBoundsRound = std::size_t{0};\n            for (auto const &led : leds) {\n                if (!led.identified()) {\n                    continue;\n                }\n                identified++;\n                auto id = led.getID();\n                if (id >= beaconsSize) {\n                    continue;\n                }\n                inBoundsID++;\n                if (led.isBright()) {\n                    inBoundsBright++;\n                }\n\n                if (led.getMeasurement().knowBoundingBox) {\n                    auto boundingBoxRatio =\n                        led.getMeasurement().boundingBox.height \/\n                        led.getMeasurement().boundingBox.width;\n                    if (boundingBoxRatio > minBoxRatio &&\n                        boundingBoxRatio < maxBoxRatio) {\n                        inBoundsRound++;\n                    }\n                }\n            }\n\n            \/\/ Now we decide if we want to cut the variance artificially to\n            \/\/ reduce latency in low-beacon situations\n            if (inBoundsID < LOW_BEACON_CUTOFF) {\n                varianceFactor = 0.5;\n            }\n            if (inBoundsID - inBoundsBright >\n                DIM_BEACON_CUTOFF_TO_SKIP_BRIGHTS) {\n                skipBright = true;\n            } else {\n#if 0\n                if (m_params.debug) {\n                    std::cout << \"Can't afford to skip brights this frame\"\n                              << std::endl;\n                }\n#endif\n            }\n        }\n\n        CameraModel cam;\n        cam.focalLength = m_camParams.focalLength();\n        cam.principalPoint = cvToVector(m_camParams.principalPoint());\n        ImagePointMeasurement meas{cam};\n\n        kalman::ConstantProcess<kalman::PureVectorState<>> beaconProcess;\n        Eigen::Vector2d pt;\n\n        const auto maxSquaredResidual =\n            m_params.maxResidual * m_params.maxResidual;\n\n        kalman::predict(m_state, m_model, dt);\n\n        \/\/\/ @todo should we be recalculating this for each beacon after each\n        \/\/\/ correction step? The order we filter them in is rather arbitrary...\n        Eigen::Matrix3d rotate =\n            Eigen::Matrix3d(m_state.getCombinedQuaternion());\n        auto numBad = std::size_t{0};\n        auto numGood = std::size_t{0};\n        for (auto &led : leds) {\n            if (!led.identified()) {\n                continue;\n            }\n            auto id = led.getID();\n            if (id >= beaconsSize) {\n                continue;\n            }\n            auto &debug = m_beaconDebugData[id];\n            debug.seen = true;\n            debug.measurement = led.getLocation();\n            if (skipBright && led.isBright()) {\n                continue;\n            }\n\n            \/\/ Angle of emission checking\n            \/\/ If we transform the body-local emission vector, an LED pointed\n            \/\/ right at the camera will be -Z. Anything with a 0 or positive z\n            \/\/ component is clearly out, and realistically, anything with a z\n            \/\/ component over -0.5 is probably fairly oblique. We don't want to\n            \/\/ use such beacons since they can easily introduce substantial\n            \/\/ error.\n            double zComponent =\n                (rotate * cvToVector(m_beaconEmissionDirection[id])).z();\n            \/\/\/ @todo if z component is positive, we shouldn't even be able to\n            \/\/\/ see this since it's pointed away from us.\n            if (zComponent > MAX_Z_COMPONENT) {\n                numBad++;\n                continue;\n            }\n\n            if (led.getMeasurement().knowBoundingBox) {\n                \/\/\/ @todo For right now, if we don't have a bounding box, we're\n                \/\/\/ assuming it's square enough (and only testing for\n                \/\/\/ non-squareness on those who actually do have bounding\n                \/\/\/ boxes). This is very much a temporary situation.\n                auto boundingBoxRatio =\n                    led.getMeasurement().boundingBox.height \/\n                    led.getMeasurement().boundingBox.width;\n                if (boundingBoxRatio < minBoxRatio ||\n                    boundingBoxRatio > maxBoxRatio) {\n                    \/\/\/ skip non-circular blobs.\n                    numBad++;\n                    continue;\n                }\n            }\n            auto localVarianceFactor = varianceFactor;\n            auto newIdentificationVariancePenalty =\n                std::pow(2.0, led.novelty());\n\n            \/\/\/ Stick a little bit of process model uncertainty in the beacon,\n            \/\/\/ if it's meant to have some\n            if (m_beaconFixed[id]) {\n                beaconProcess.setNoiseAutocorrelation(0);\n            } else {\n                beaconProcess.setNoiseAutocorrelation(\n                    m_params.beaconProcessNoise);\n                kalman::predict(*(m_beacons[id]), beaconProcess, dt);\n            }\n\n            meas.setMeasurement(\n                Eigen::Vector2d(led.getLocation().x, led.getLocation().y));\n            led.markAsUsed();\n            auto state = kalman::makeAugmentedState(m_state, *(m_beacons[id]));\n            meas.updateFromState(state);\n            Eigen::Vector2d residual = meas.getResidual(state);\n            if (residual.squaredNorm() > maxSquaredResidual) {\n                \/\/ probably bad\n                numBad++;\n                localVarianceFactor *= m_params.highResidualVariancePenalty;\n            } else {\n                numGood++;\n            }\n            debug.residual.x = residual.x();\n            debug.residual.y = residual.y();\n            auto effectiveVariance =\n                localVarianceFactor * m_params.measurementVarianceScaleFactor *\n                newIdentificationVariancePenalty *\n                m_beaconMeasurementVariance[id] \/ led.getMeasurement().area;\n            debug.variance = effectiveVariance;\n            meas.setVariance(effectiveVariance);\n\n            \/\/\/ Now, do the correction.\n            auto model =\n                kalman::makeAugmentedProcessModel(m_model, beaconProcess);\n            kalman::correct(state, model, meas);\n            m_gotMeasurement = true;\n        }\n\n        bool incrementProbation = false;\n        if (0 == m_framesInProbation) {\n            \/\/ Let's try to keep a 3:2 ratio of good to bad when not \"in\n            \/\/ probation\"\n            incrementProbation = (numBad * 3 > numGood * 2);\n\n        } else {\n            \/\/ Already in trouble, add a bit of hysteresis and raising the bar\n            \/\/ so we don't hop out easily.\n            incrementProbation = numBad * 2 > numGood;\n            if (!incrementProbation) {\n                \/\/ OK, we're good again\n                m_framesInProbation = 0;\n            }\n        }\n        if (incrementProbation) {\n            m_framesInProbation++;\n        }\n        \/\/\/ Output to the OpenCV state types so we can see the reprojection\n        \/\/\/ debug view.\n        m_rvec = eiQuatToRotVec(m_state.getQuaternion());\n        cv::eigen2cv(m_state.position().eval(), m_tvec);\n        return true;\n    }\n\n    OSVR_PoseState\n    BeaconBasedPoseEstimator::GetPredictedState(double dt) const {\n        auto state = m_state;\n        auto model = m_model;\n        kalman::predict(state, model, dt);\n        state.postCorrect();\n        OSVR_PoseState ret;\n        util::eigen_interop::map(ret).rotation() = state.getQuaternion();\n        util::eigen_interop::map(ret).translation() =\n            m_convertInternalPositionRepToExternal(state.position());\n        return ret;\n    }\n\n} \/\/ namespace vbtracker\n} \/\/ namespace osvr\n<commit_msg>Add a little variance penalty if an LED is bright, to smooth out the sides (when we can't just skip bright ones)<commit_after>\/** @file\n    @brief Implementation of Kalman-specific code in beacon-based pose\n   estimator, to reduce incremental build times.\n\n    @date 2015\n\n    @author\n    Sensics, Inc.\n    <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2015 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#include <iostream>\n#include <osvr\/Util\/EigenCoreGeometry.h>\n#if 0\ntemplate <typename T>\ninline void dumpKalmanDebugOuput(const char name[], const char expr[],\n                                 T const &value) {\n    std::cout << \"\\n(Kalman Debug Output) \" << name << \" [\" << expr << \"]:\\n\"\n              << value << std::endl;\n}\n#endif\n\n\/\/ Internal Includes\n#include \"BeaconBasedPoseEstimator.h\"\n#include \"ImagePointMeasurement.h\"\n#include \"cvToEigen.h\"\n\n\/\/ Library\/third-party includes\n#include <osvr\/Kalman\/FlexibleKalmanFilter.h>\n#include <osvr\/Kalman\/AugmentedProcessModel.h>\n#include <osvr\/Kalman\/AugmentedState.h>\n#include <osvr\/Kalman\/ConstantProcess.h>\n\n#include <osvr\/Util\/EigenInterop.h>\n\n#include <opencv2\/core\/eigen.hpp>\n\n\/\/ Standard includes\n\/\/ - none\n\nnamespace osvr {\nnamespace vbtracker {\n    static const auto LOW_BEACON_CUTOFF = 5;\n\n    static const auto DIM_BEACON_CUTOFF_TO_SKIP_BRIGHTS = 4;\n\n    static const auto MAX_Z_COMPONENT = -0.3;\n\n    bool BeaconBasedPoseEstimator::m_kalmanAutocalibEstimator(LedGroup &leds,\n                                                              double dt) {\n        auto const beaconsSize = m_beacons.size();\n        \/\/ Default measurement variance (for now, factor) per axis.\n        double varianceFactor = 1;\n\n        auto maxBoxRatio = m_params.boundingBoxFilterRatio;\n        auto minBoxRatio = 1.f \/ m_params.boundingBoxFilterRatio;\n\n        \/\/ Default to using all the measurements we can\n        auto skipBright = false;\n        {\n            auto totalLeds = leds.size();\n            auto identified = std::size_t{0};\n            auto inBoundsID = std::size_t{0};\n            auto inBoundsBright = std::size_t{0};\n            auto inBoundsRound = std::size_t{0};\n            for (auto const &led : leds) {\n                if (!led.identified()) {\n                    continue;\n                }\n                identified++;\n                auto id = led.getID();\n                if (id >= beaconsSize) {\n                    continue;\n                }\n                inBoundsID++;\n                if (led.isBright()) {\n                    inBoundsBright++;\n                }\n\n                if (led.getMeasurement().knowBoundingBox) {\n                    auto boundingBoxRatio =\n                        led.getMeasurement().boundingBox.height \/\n                        led.getMeasurement().boundingBox.width;\n                    if (boundingBoxRatio > minBoxRatio &&\n                        boundingBoxRatio < maxBoxRatio) {\n                        inBoundsRound++;\n                    }\n                }\n            }\n\n            \/\/ Now we decide if we want to cut the variance artificially to\n            \/\/ reduce latency in low-beacon situations\n            if (inBoundsID < LOW_BEACON_CUTOFF) {\n                varianceFactor = 0.5;\n            }\n            if (inBoundsID - inBoundsBright >\n                DIM_BEACON_CUTOFF_TO_SKIP_BRIGHTS) {\n                skipBright = true;\n            } else {\n#if 0\n                if (m_params.debug) {\n                    std::cout << \"Can't afford to skip brights this frame\"\n                              << std::endl;\n                }\n#endif\n            }\n        }\n\n        CameraModel cam;\n        cam.focalLength = m_camParams.focalLength();\n        cam.principalPoint = cvToVector(m_camParams.principalPoint());\n        ImagePointMeasurement meas{cam};\n\n        kalman::ConstantProcess<kalman::PureVectorState<>> beaconProcess;\n        Eigen::Vector2d pt;\n\n        const auto maxSquaredResidual =\n            m_params.maxResidual * m_params.maxResidual;\n\n        kalman::predict(m_state, m_model, dt);\n\n        \/\/\/ @todo should we be recalculating this for each beacon after each\n        \/\/\/ correction step? The order we filter them in is rather arbitrary...\n        Eigen::Matrix3d rotate =\n            Eigen::Matrix3d(m_state.getCombinedQuaternion());\n        auto numBad = std::size_t{0};\n        auto numGood = std::size_t{0};\n        for (auto &led : leds) {\n            if (!led.identified()) {\n                continue;\n            }\n            auto id = led.getID();\n            if (id >= beaconsSize) {\n                continue;\n            }\n            auto &debug = m_beaconDebugData[id];\n            debug.seen = true;\n            debug.measurement = led.getLocation();\n            if (skipBright && led.isBright()) {\n                continue;\n            }\n\n            \/\/ Angle of emission checking\n            \/\/ If we transform the body-local emission vector, an LED pointed\n            \/\/ right at the camera will be -Z. Anything with a 0 or positive z\n            \/\/ component is clearly out, and realistically, anything with a z\n            \/\/ component over -0.5 is probably fairly oblique. We don't want to\n            \/\/ use such beacons since they can easily introduce substantial\n            \/\/ error.\n            double zComponent =\n                (rotate * cvToVector(m_beaconEmissionDirection[id])).z();\n            \/\/\/ @todo if z component is positive, we shouldn't even be able to\n            \/\/\/ see this since it's pointed away from us.\n            if (zComponent > MAX_Z_COMPONENT) {\n                numBad++;\n                continue;\n            }\n\n            if (led.getMeasurement().knowBoundingBox) {\n                \/\/\/ @todo For right now, if we don't have a bounding box, we're\n                \/\/\/ assuming it's square enough (and only testing for\n                \/\/\/ non-squareness on those who actually do have bounding\n                \/\/\/ boxes). This is very much a temporary situation.\n                auto boundingBoxRatio =\n                    led.getMeasurement().boundingBox.height \/\n                    led.getMeasurement().boundingBox.width;\n                if (boundingBoxRatio < minBoxRatio ||\n                    boundingBoxRatio > maxBoxRatio) {\n                    \/\/\/ skip non-circular blobs.\n                    numBad++;\n                    continue;\n                }\n            }\n            auto localVarianceFactor = varianceFactor;\n            auto newIdentificationVariancePenalty =\n                std::pow(2.0, led.novelty());\n\n            \/\/\/ Stick a little bit of process model uncertainty in the beacon,\n            \/\/\/ if it's meant to have some\n            if (m_beaconFixed[id]) {\n                beaconProcess.setNoiseAutocorrelation(0);\n            } else {\n                beaconProcess.setNoiseAutocorrelation(\n                    m_params.beaconProcessNoise);\n                kalman::predict(*(m_beacons[id]), beaconProcess, dt);\n            }\n\n            meas.setMeasurement(\n                Eigen::Vector2d(led.getLocation().x, led.getLocation().y));\n            led.markAsUsed();\n            auto state = kalman::makeAugmentedState(m_state, *(m_beacons[id]));\n            meas.updateFromState(state);\n            Eigen::Vector2d residual = meas.getResidual(state);\n            if (residual.squaredNorm() > maxSquaredResidual) {\n                \/\/ probably bad\n                numBad++;\n                localVarianceFactor *= m_params.highResidualVariancePenalty;\n            } else {\n                numGood++;\n            }\n            debug.residual.x = residual.x();\n            debug.residual.y = residual.y();\n            auto effectiveVariance =\n                localVarianceFactor * m_params.measurementVarianceScaleFactor *\n                newIdentificationVariancePenalty * (led.isBright() ? 2 : 1) *\n                m_beaconMeasurementVariance[id] \/ led.getMeasurement().area;\n            debug.variance = effectiveVariance;\n            meas.setVariance(effectiveVariance);\n\n            \/\/\/ Now, do the correction.\n            auto model =\n                kalman::makeAugmentedProcessModel(m_model, beaconProcess);\n            kalman::correct(state, model, meas);\n            m_gotMeasurement = true;\n        }\n\n        bool incrementProbation = false;\n        if (0 == m_framesInProbation) {\n            \/\/ Let's try to keep a 3:2 ratio of good to bad when not \"in\n            \/\/ probation\"\n            incrementProbation = (numBad * 3 > numGood * 2);\n\n        } else {\n            \/\/ Already in trouble, add a bit of hysteresis and raising the bar\n            \/\/ so we don't hop out easily.\n            incrementProbation = numBad * 2 > numGood;\n            if (!incrementProbation) {\n                \/\/ OK, we're good again\n                m_framesInProbation = 0;\n            }\n        }\n        if (incrementProbation) {\n            m_framesInProbation++;\n        }\n        \/\/\/ Output to the OpenCV state types so we can see the reprojection\n        \/\/\/ debug view.\n        m_rvec = eiQuatToRotVec(m_state.getQuaternion());\n        cv::eigen2cv(m_state.position().eval(), m_tvec);\n        return true;\n    }\n\n    OSVR_PoseState\n    BeaconBasedPoseEstimator::GetPredictedState(double dt) const {\n        auto state = m_state;\n        auto model = m_model;\n        kalman::predict(state, model, dt);\n        state.postCorrect();\n        OSVR_PoseState ret;\n        util::eigen_interop::map(ret).rotation() = state.getQuaternion();\n        util::eigen_interop::map(ret).translation() =\n            m_convertInternalPositionRepToExternal(state.position());\n        return ret;\n    }\n\n} \/\/ namespace vbtracker\n} \/\/ namespace osvr\n<|endoftext|>"}
{"text":"<commit_before>#include \"GSH_OpenGL.h\"\r\n#include <assert.h>\r\n#include <sstream>\r\n\r\nstatic const char* s_andFunction =\r\n\"float and(int a, int b)\\r\\n\"\r\n\"{\\r\\n\"\r\n\"\tint r = 0;\\r\\n\"\r\n\"\tint ha, hb;\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\tint m = int(min(float(a), float(b)));\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\tfor(int k = 1; k <= m; k *= 2)\\r\\n\"\r\n\"\t{\\r\\n\"\r\n\"\t\tha = a \/ 2;\\r\\n\"\r\n\"\t\thb = b \/ 2;\\r\\n\"\r\n\"\t\tif(((a - ha * 2) != 0) && ((b - hb * 2) != 0))\\r\\n\"\r\n\"\t\t{\\r\\n\"\r\n\"\t\t\tr += k;\\r\\n\"\r\n\"\t\t}\\r\\n\"\r\n\"\t\ta = ha;\\r\\n\"\r\n\"\t\tb = hb;\\r\\n\"\r\n\"\t}\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\treturn float(r);\\r\\n\"\r\n\"}\\r\\n\";\r\n\r\nstatic const char* s_orFunction = \r\n\"float or(int a, int b)\\r\\n\"\r\n\"{\\r\\n\"\r\n\"\tint r = 0;\\r\\n\"\r\n\"\tint ha, hb;\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\tint m = int(max(float(a), float(b)));\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\tfor(int k = 1; k <= m; k *= 2)\\r\\n\"\r\n\"\t{\\r\\n\"\r\n\"\t\tha = a \/ 2;\\r\\n\"\r\n\"\t\thb = b \/ 2;\\r\\n\"\r\n\"\t\tif(((a - ha * 2) != 0) || ((b - hb * 2) != 0))\\r\\n\"\r\n\"\t\t{\\r\\n\"\r\n\"\t\t\tr += k;\\r\\n\"\r\n\"\t\t}\\r\\n\"\r\n\"\t\ta = ha;\\r\\n\"\r\n\"\t\tb = hb;\\r\\n\"\r\n\"\t}\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\treturn float(r);\\r\\n\"\r\n\"}\\r\\n\";\r\n\r\nFramework::OpenGl::ProgramPtr CGSH_OpenGL::GenerateShader(const SHADERCAPS& caps)\r\n{\r\n\tauto vertexShader = GenerateVertexShader(caps);\r\n\tauto fragmentShader = GenerateFragmentShader(caps);\r\n\r\n\tauto result = std::make_shared<Framework::OpenGl::CProgram>();\r\n\r\n\tresult->AttachShader(vertexShader);\r\n\tresult->AttachShader(fragmentShader);\r\n\r\n\tbool linkResult = result->Link();\r\n\tassert(linkResult);\r\n\r\n\tassert(glGetError() == GL_NO_ERROR);\r\n\r\n\treturn result;\r\n}\r\n\r\nFramework::OpenGl::CShader CGSH_OpenGL::GenerateVertexShader(const SHADERCAPS& caps)\r\n{\r\n\tstd::stringstream shaderBuilder;\r\n\tshaderBuilder << \"void main()\"\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"{\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\tgl_TexCoord[0] = gl_TextureMatrix[0] * gl_MultiTexCoord0;\"\t<< std::endl;\r\n\tshaderBuilder << \"\tgl_FrontColor = gl_Color;\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\tgl_Position = ftransform();\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\tgl_FogFragCoord = gl_FogCoord;\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\r\n\tauto shaderSource = shaderBuilder.str();\r\n\r\n\tFramework::OpenGl::CShader result(GL_VERTEX_SHADER);\r\n\tresult.SetSource(shaderSource.c_str(), shaderSource.size());\r\n\tbool compilationResult = result.Compile();\r\n\tassert(compilationResult);\r\n\r\n\tassert(glGetError() == GL_NO_ERROR);\r\n\r\n\treturn result;\r\n}\r\n\r\nFramework::OpenGl::CShader CGSH_OpenGL::GenerateFragmentShader(const SHADERCAPS& caps)\r\n{\r\n\tstd::stringstream shaderBuilder;\r\n\r\n\t\/\/Unused uniforms will get optimized away\r\n\tshaderBuilder << \"uniform sampler2D g_texture;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform sampler2D g_palette;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform vec2 g_textureSize;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform vec2 g_texelSize;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform vec2 g_clampMin;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform vec2 g_clampMax;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\r\n\tif(caps.texClampS == TEXTURE_CLAMP_MODE_REGION_REPEAT || caps.texClampT == TEXTURE_CLAMP_MODE_REGION_REPEAT)\r\n\t{\r\n\t\tshaderBuilder << s_andFunction << std::endl;\r\n\t\tshaderBuilder << s_orFunction << std::endl;\r\n\t}\r\n\r\n\tshaderBuilder << \"void main()\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"{\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\tvec4 texCoord = gl_TexCoord[0];\"\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\ttexCoord.st \/= texCoord.q;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\r\n\tif((caps.texClampS != TEXTURE_CLAMP_MODE_STD) || (caps.texClampT != TEXTURE_CLAMP_MODE_STD))\r\n\t{\r\n\t\tshaderBuilder << \"\ttexCoord.st *= g_textureSize.st;\"\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\tshaderBuilder << GenerateTexCoordClampingSection(static_cast<TEXTURE_CLAMP_MODE>(caps.texClampS), \"s\");\r\n\t\tshaderBuilder << GenerateTexCoordClampingSection(static_cast<TEXTURE_CLAMP_MODE>(caps.texClampT), \"t\");\r\n\t\tshaderBuilder << \"\ttexCoord.st \/= g_textureSize.st;\"\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t}\r\n\r\n\tshaderBuilder << \"\tvec4 textureColor = vec4(1, 1, 1, 1);\"\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tif(caps.isIndexedTextureSource())\r\n\t{\r\n\t\tif(!caps.texBilinearFilter)\r\n\t\t{\r\n\t\t\tshaderBuilder << \"\tfloat colorIndex = texture2D(g_texture, texCoord.st).a * 255.0;\"\t\t\t\t<< std::endl;\r\n\t\t\tif(caps.texSourceMode == TEXTURE_SOURCE_MODE_IDX4)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\ttextureColor = texture2D(g_palette, vec2(colorIndex \/ 16.0, 1));\"\t\t\t<< std::endl;\r\n\t\t\t}\r\n\t\t\telse if(caps.texSourceMode == TEXTURE_SOURCE_MODE_IDX8)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\ttextureColor = texture2D(g_palette, vec2(colorIndex \/ 256.0, 1));\"\t\t\t<< std::endl;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tshaderBuilder << \"\tfloat tlIdx = texture2D(g_texture, texCoord.st                                     ).a * 255.0;\"\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tfloat trIdx = texture2D(g_texture, texCoord.st + vec2(g_texelSize.x, 0)            ).a * 255.0;\"\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tfloat blIdx = texture2D(g_texture, texCoord.st + vec2(0, g_texelSize.y)            ).a * 255.0;\"\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tfloat brIdx = texture2D(g_texture, texCoord.st + vec2(g_texelSize.x, g_texelSize.y)).a * 255.0;\"\t<< std::endl;\r\n\r\n\t\t\tif(caps.texSourceMode == TEXTURE_SOURCE_MODE_IDX4)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\tvec4 tl = texture2D(g_palette, vec2(tlIdx \/ 16.0, 1));\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 tr = texture2D(g_palette, vec2(trIdx \/ 16.0, 1));\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 bl = texture2D(g_palette, vec2(blIdx \/ 16.0, 1));\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 br = texture2D(g_palette, vec2(brIdx \/ 16.0, 1));\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t}\r\n\t\t\telse if(caps.texSourceMode == TEXTURE_SOURCE_MODE_IDX8)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\tvec4 tl = texture2D(g_palette, vec2(tlIdx \/ 256.0, 1));\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 tr = texture2D(g_palette, vec2(trIdx \/ 256.0, 1));\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 bl = texture2D(g_palette, vec2(blIdx \/ 256.0, 1));\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 br = texture2D(g_palette, vec2(brIdx \/ 256.0, 1));\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t}\r\n\r\n\t\t\tshaderBuilder << \"\tvec2 f = fract(texCoord.xy * g_textureSize);\"\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tvec4 tA = mix(tl, tr, f.x);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tvec4 tB = mix(bl, br, f.x);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\ttextureColor = mix(tA, tB, f.y);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t}\r\n\t}\r\n\telse if(caps.texSourceMode == TEXTURE_SOURCE_MODE_STD)\r\n\t{\r\n\t\tshaderBuilder << \"\ttextureColor = texture2D(g_texture, texCoord.st);\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t}\r\n\r\n\tif(!caps.texHasAlpha)\r\n\t{\r\n\t\tshaderBuilder << \"\ttextureColor.a = 1.0;\" << std::endl;\r\n\t}\r\n\r\n\tswitch(caps.texFunction)\r\n\t{\r\n\tdefault:\r\n\t\tassert(0);\r\n\tcase TEX0_FUNCTION_MODULATE:\r\n\t\tshaderBuilder << \"\ttextureColor *= gl_Color;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\tbreak;\r\n\tcase TEX0_FUNCTION_DECAL:\r\n\t\tbreak;\r\n\t}\r\n\r\n\tif(caps.hasFog)\r\n\t{\r\n\t\tshaderBuilder << \"\tgl_FragColor = vec4(mix(textureColor.rgb, gl_Fog.color.rgb, gl_FogFragCoord), textureColor.a);\" << std::endl;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tshaderBuilder << \"\tgl_FragColor = textureColor;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t}\r\n\r\n\tshaderBuilder << \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\r\n\tauto shaderSource = shaderBuilder.str();\r\n\r\n\tFramework::OpenGl::CShader result(GL_FRAGMENT_SHADER);\r\n\tresult.SetSource(shaderSource.c_str(), shaderSource.size());\r\n\tbool compilationResult = result.Compile();\r\n\tassert(compilationResult);\r\n\r\n\tassert(glGetError() == GL_NO_ERROR);\r\n\r\n\treturn result;\r\n}\r\n\r\nstd::string CGSH_OpenGL::GenerateTexCoordClampingSection(TEXTURE_CLAMP_MODE clampMode, const char* coordinate)\r\n{\r\n\tstd::stringstream shaderBuilder;\r\n\r\n\tswitch(clampMode)\r\n\t{\r\n\tcase TEXTURE_CLAMP_MODE_REGION_CLAMP:\r\n\t\tshaderBuilder << \"\ttexCoord.\" << coordinate << \" = min(g_clampMax.\" << coordinate << \", \" <<\r\n\t\t\t\"max(g_clampMin.\" << coordinate << \", texCoord.\" << coordinate << \"));\" << std::endl;\r\n\t\tbreak;\r\n\tcase TEXTURE_CLAMP_MODE_REGION_REPEAT:\r\n\t\tshaderBuilder << \"\ttexCoord.\" << coordinate << \" = or(int(and(int(texCoord.\" << coordinate << \"), \" << \r\n\t\t\t\"int(g_clampMin.\" << coordinate << \"))), int(g_clampMax.\" << coordinate << \"));\";\r\n\t\tbreak;\r\n\tcase TEXTURE_CLAMP_MODE_REGION_REPEAT_SIMPLE:\r\n\t\tshaderBuilder << \"\ttexCoord.\" << coordinate << \" = mod(texCoord.\" << coordinate << \", \" << \r\n\t\t\t\"g_clampMin.\" << coordinate << \") + g_clampMax.\" << coordinate << \";\" << std::endl;\r\n\t\tbreak;\r\n\t}\r\n\r\n\tstd::string shaderSource = shaderBuilder.str();\r\n\treturn shaderSource;\r\n}\r\n<commit_msg>Added proper support for HIGHLIGHT and HIGHLIGHT2 texture functions.<commit_after>#include \"GSH_OpenGL.h\"\r\n#include <assert.h>\r\n#include <sstream>\r\n\r\nstatic const char* s_andFunction =\r\n\"float and(int a, int b)\\r\\n\"\r\n\"{\\r\\n\"\r\n\"\tint r = 0;\\r\\n\"\r\n\"\tint ha, hb;\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\tint m = int(min(float(a), float(b)));\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\tfor(int k = 1; k <= m; k *= 2)\\r\\n\"\r\n\"\t{\\r\\n\"\r\n\"\t\tha = a \/ 2;\\r\\n\"\r\n\"\t\thb = b \/ 2;\\r\\n\"\r\n\"\t\tif(((a - ha * 2) != 0) && ((b - hb * 2) != 0))\\r\\n\"\r\n\"\t\t{\\r\\n\"\r\n\"\t\t\tr += k;\\r\\n\"\r\n\"\t\t}\\r\\n\"\r\n\"\t\ta = ha;\\r\\n\"\r\n\"\t\tb = hb;\\r\\n\"\r\n\"\t}\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\treturn float(r);\\r\\n\"\r\n\"}\\r\\n\";\r\n\r\nstatic const char* s_orFunction = \r\n\"float or(int a, int b)\\r\\n\"\r\n\"{\\r\\n\"\r\n\"\tint r = 0;\\r\\n\"\r\n\"\tint ha, hb;\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\tint m = int(max(float(a), float(b)));\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\tfor(int k = 1; k <= m; k *= 2)\\r\\n\"\r\n\"\t{\\r\\n\"\r\n\"\t\tha = a \/ 2;\\r\\n\"\r\n\"\t\thb = b \/ 2;\\r\\n\"\r\n\"\t\tif(((a - ha * 2) != 0) || ((b - hb * 2) != 0))\\r\\n\"\r\n\"\t\t{\\r\\n\"\r\n\"\t\t\tr += k;\\r\\n\"\r\n\"\t\t}\\r\\n\"\r\n\"\t\ta = ha;\\r\\n\"\r\n\"\t\tb = hb;\\r\\n\"\r\n\"\t}\\r\\n\"\r\n\"\t\\r\\n\"\r\n\"\treturn float(r);\\r\\n\"\r\n\"}\\r\\n\";\r\n\r\nFramework::OpenGl::ProgramPtr CGSH_OpenGL::GenerateShader(const SHADERCAPS& caps)\r\n{\r\n\tauto vertexShader = GenerateVertexShader(caps);\r\n\tauto fragmentShader = GenerateFragmentShader(caps);\r\n\r\n\tauto result = std::make_shared<Framework::OpenGl::CProgram>();\r\n\r\n\tresult->AttachShader(vertexShader);\r\n\tresult->AttachShader(fragmentShader);\r\n\r\n\tbool linkResult = result->Link();\r\n\tassert(linkResult);\r\n\r\n\tassert(glGetError() == GL_NO_ERROR);\r\n\r\n\treturn result;\r\n}\r\n\r\nFramework::OpenGl::CShader CGSH_OpenGL::GenerateVertexShader(const SHADERCAPS& caps)\r\n{\r\n\tstd::stringstream shaderBuilder;\r\n\tshaderBuilder << \"void main()\"\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"{\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\tgl_TexCoord[0] = gl_TextureMatrix[0] * gl_MultiTexCoord0;\"\t<< std::endl;\r\n\tshaderBuilder << \"\tgl_FrontColor = gl_Color;\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\tgl_Position = ftransform();\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\tgl_FogFragCoord = gl_FogCoord;\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\r\n\tauto shaderSource = shaderBuilder.str();\r\n\r\n\tFramework::OpenGl::CShader result(GL_VERTEX_SHADER);\r\n\tresult.SetSource(shaderSource.c_str(), shaderSource.size());\r\n\tbool compilationResult = result.Compile();\r\n\tassert(compilationResult);\r\n\r\n\tassert(glGetError() == GL_NO_ERROR);\r\n\r\n\treturn result;\r\n}\r\n\r\nFramework::OpenGl::CShader CGSH_OpenGL::GenerateFragmentShader(const SHADERCAPS& caps)\r\n{\r\n\tstd::stringstream shaderBuilder;\r\n\r\n\t\/\/Unused uniforms will get optimized away\r\n\tshaderBuilder << \"uniform sampler2D g_texture;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform sampler2D g_palette;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform vec2 g_textureSize;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform vec2 g_texelSize;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform vec2 g_clampMin;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"uniform vec2 g_clampMax;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\r\n\tif(caps.texClampS == TEXTURE_CLAMP_MODE_REGION_REPEAT || caps.texClampT == TEXTURE_CLAMP_MODE_REGION_REPEAT)\r\n\t{\r\n\t\tshaderBuilder << s_andFunction << std::endl;\r\n\t\tshaderBuilder << s_orFunction << std::endl;\r\n\t}\r\n\r\n\tshaderBuilder << \"void main()\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"{\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\tvec4 texCoord = gl_TexCoord[0];\"\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tshaderBuilder << \"\ttexCoord.st \/= texCoord.q;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\r\n\tif((caps.texClampS != TEXTURE_CLAMP_MODE_STD) || (caps.texClampT != TEXTURE_CLAMP_MODE_STD))\r\n\t{\r\n\t\tshaderBuilder << \"\ttexCoord.st *= g_textureSize.st;\"\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\tshaderBuilder << GenerateTexCoordClampingSection(static_cast<TEXTURE_CLAMP_MODE>(caps.texClampS), \"s\");\r\n\t\tshaderBuilder << GenerateTexCoordClampingSection(static_cast<TEXTURE_CLAMP_MODE>(caps.texClampT), \"t\");\r\n\t\tshaderBuilder << \"\ttexCoord.st \/= g_textureSize.st;\"\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t}\r\n\r\n\tshaderBuilder << \"\tvec4 textureColor = vec4(1, 1, 1, 1);\"\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\tif(caps.isIndexedTextureSource())\r\n\t{\r\n\t\tif(!caps.texBilinearFilter)\r\n\t\t{\r\n\t\t\tshaderBuilder << \"\tfloat colorIndex = texture2D(g_texture, texCoord.st).a * 255.0;\"\t\t\t\t<< std::endl;\r\n\t\t\tif(caps.texSourceMode == TEXTURE_SOURCE_MODE_IDX4)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\ttextureColor = texture2D(g_palette, vec2(colorIndex \/ 16.0, 1));\"\t\t\t<< std::endl;\r\n\t\t\t}\r\n\t\t\telse if(caps.texSourceMode == TEXTURE_SOURCE_MODE_IDX8)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\ttextureColor = texture2D(g_palette, vec2(colorIndex \/ 256.0, 1));\"\t\t\t<< std::endl;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tshaderBuilder << \"\tfloat tlIdx = texture2D(g_texture, texCoord.st                                     ).a * 255.0;\"\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tfloat trIdx = texture2D(g_texture, texCoord.st + vec2(g_texelSize.x, 0)            ).a * 255.0;\"\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tfloat blIdx = texture2D(g_texture, texCoord.st + vec2(0, g_texelSize.y)            ).a * 255.0;\"\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tfloat brIdx = texture2D(g_texture, texCoord.st + vec2(g_texelSize.x, g_texelSize.y)).a * 255.0;\"\t<< std::endl;\r\n\r\n\t\t\tif(caps.texSourceMode == TEXTURE_SOURCE_MODE_IDX4)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\tvec4 tl = texture2D(g_palette, vec2(tlIdx \/ 16.0, 1));\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 tr = texture2D(g_palette, vec2(trIdx \/ 16.0, 1));\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 bl = texture2D(g_palette, vec2(blIdx \/ 16.0, 1));\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 br = texture2D(g_palette, vec2(brIdx \/ 16.0, 1));\"\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t}\r\n\t\t\telse if(caps.texSourceMode == TEXTURE_SOURCE_MODE_IDX8)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\tvec4 tl = texture2D(g_palette, vec2(tlIdx \/ 256.0, 1));\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 tr = texture2D(g_palette, vec2(trIdx \/ 256.0, 1));\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 bl = texture2D(g_palette, vec2(blIdx \/ 256.0, 1));\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t\tshaderBuilder << \"\tvec4 br = texture2D(g_palette, vec2(brIdx \/ 256.0, 1));\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\t}\r\n\r\n\t\t\tshaderBuilder << \"\tvec2 f = fract(texCoord.xy * g_textureSize);\"\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tvec4 tA = mix(tl, tr, f.x);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\tvec4 tB = mix(bl, br, f.x);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t\tshaderBuilder << \"\ttextureColor = mix(tA, tB, f.y);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t\t}\r\n\t}\r\n\telse if(caps.texSourceMode == TEXTURE_SOURCE_MODE_STD)\r\n\t{\r\n\t\tshaderBuilder << \"\ttextureColor = texture2D(g_texture, texCoord.st);\"\t\t\t\t\t\t\t\t<< std::endl;\r\n\t}\r\n\r\n\tif(caps.texSourceMode != TEXTURE_SOURCE_MODE_NONE)\r\n\t{\r\n\t\tif(!caps.texHasAlpha)\r\n\t\t{\r\n\t\t\tshaderBuilder << \"\ttextureColor.a = 1.0;\" << std::endl;\r\n\t\t}\r\n\r\n\t\tswitch(caps.texFunction)\r\n\t\t{\r\n\t\tcase TEX0_FUNCTION_MODULATE:\r\n\t\t\tshaderBuilder << \"\ttextureColor *= gl_Color;\" << std::endl;\r\n\t\t\tbreak;\r\n\t\tcase TEX0_FUNCTION_DECAL:\r\n\t\t\tbreak;\r\n\t\tcase TEX0_FUNCTION_HIGHLIGHT:\r\n\t\t\tshaderBuilder << \"\ttextureColor.rgb = (textureColor.rgb * gl_Color.rgb) + gl_Color.aaa;\" << std::endl;\r\n\t\t\tif(!caps.texHasAlpha)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\ttextureColor.a = gl_Color.a;\" << std::endl;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\ttextureColor.a += gl_Color.a;\" << std::endl;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase TEX0_FUNCTION_HIGHLIGHT2:\r\n\t\t\tshaderBuilder << \"\ttextureColor.rgb = (textureColor.rgb * gl_Color.rgb) + gl_Color.aaa;\" << std::endl;\r\n\t\t\tif(!caps.texHasAlpha)\r\n\t\t\t{\r\n\t\t\t\tshaderBuilder << \"\ttextureColor.a = gl_Color.a;\" << std::endl;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tassert(0);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\telse\r\n\t{\r\n\t\tshaderBuilder << \"\ttextureColor = gl_Color;\" << std::endl;\r\n\t}\r\n\r\n\tif(caps.hasFog)\r\n\t{\r\n\t\tshaderBuilder << \"\tgl_FragColor = vec4(mix(textureColor.rgb, gl_Fog.color.rgb, gl_FogFragCoord), textureColor.a);\" << std::endl;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tshaderBuilder << \"\tgl_FragColor = textureColor;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\t}\r\n\r\n\tshaderBuilder << \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<< std::endl;\r\n\r\n\tauto shaderSource = shaderBuilder.str();\r\n\r\n\tFramework::OpenGl::CShader result(GL_FRAGMENT_SHADER);\r\n\tresult.SetSource(shaderSource.c_str(), shaderSource.size());\r\n\tbool compilationResult = result.Compile();\r\n\tassert(compilationResult);\r\n\r\n\tassert(glGetError() == GL_NO_ERROR);\r\n\r\n\treturn result;\r\n}\r\n\r\nstd::string CGSH_OpenGL::GenerateTexCoordClampingSection(TEXTURE_CLAMP_MODE clampMode, const char* coordinate)\r\n{\r\n\tstd::stringstream shaderBuilder;\r\n\r\n\tswitch(clampMode)\r\n\t{\r\n\tcase TEXTURE_CLAMP_MODE_REGION_CLAMP:\r\n\t\tshaderBuilder << \"\ttexCoord.\" << coordinate << \" = min(g_clampMax.\" << coordinate << \", \" <<\r\n\t\t\t\"max(g_clampMin.\" << coordinate << \", texCoord.\" << coordinate << \"));\" << std::endl;\r\n\t\tbreak;\r\n\tcase TEXTURE_CLAMP_MODE_REGION_REPEAT:\r\n\t\tshaderBuilder << \"\ttexCoord.\" << coordinate << \" = or(int(and(int(texCoord.\" << coordinate << \"), \" << \r\n\t\t\t\"int(g_clampMin.\" << coordinate << \"))), int(g_clampMax.\" << coordinate << \"));\";\r\n\t\tbreak;\r\n\tcase TEXTURE_CLAMP_MODE_REGION_REPEAT_SIMPLE:\r\n\t\tshaderBuilder << \"\ttexCoord.\" << coordinate << \" = mod(texCoord.\" << coordinate << \", \" << \r\n\t\t\t\"g_clampMin.\" << coordinate << \") + g_clampMax.\" << coordinate << \";\" << std::endl;\r\n\t\tbreak;\r\n\t}\r\n\r\n\tstd::string shaderSource = shaderBuilder.str();\r\n\treturn shaderSource;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015 PLUMgrid, 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 <map>\n#include <string>\n#include <algorithm>\n#include <fcntl.h>\n#include <ftw.h>\n#include <map>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/utsname.h>\n#include <unistd.h>\n#include <utility>\n#include <vector>\n#include <linux\/bpf.h>\n\n#include <clang\/Basic\/FileManager.h>\n#include <clang\/Basic\/TargetInfo.h>\n#include <clang\/CodeGen\/BackendUtil.h>\n#include <clang\/CodeGen\/CodeGenAction.h>\n#include <clang\/Driver\/Compilation.h>\n#include <clang\/Driver\/Driver.h>\n#include <clang\/Driver\/Job.h>\n#include <clang\/Driver\/Tool.h>\n#include <clang\/Frontend\/CompilerInstance.h>\n#include <clang\/Frontend\/CompilerInvocation.h>\n#include <clang\/Frontend\/FrontendActions.h>\n#include <clang\/Frontend\/FrontendDiagnostic.h>\n#include <clang\/Frontend\/TextDiagnosticPrinter.h>\n#include <clang\/FrontendTool\/Utils.h>\n#include <clang\/Lex\/PreprocessorOptions.h>\n\n#include <llvm\/IR\/Module.h>\n\n#include \"common.h\"\n#include \"bcc_exception.h\"\n#include \"exported_files.h\"\n#include \"kbuild_helper.h\"\n#include \"b_frontend_action.h\"\n#include \"tp_frontend_action.h\"\n#include \"loader.h\"\n\nusing std::map;\nusing std::string;\nusing std::unique_ptr;\nusing std::vector;\n\nnamespace ebpf {\n\nmap<string, unique_ptr<llvm::MemoryBuffer>> ClangLoader::remapped_files_;\n\nClangLoader::ClangLoader(llvm::LLVMContext *ctx, unsigned flags)\n    : ctx_(ctx), flags_(flags)\n{\n  if (remapped_files_.empty()) {\n    for (auto f : ExportedFiles::headers())\n      remapped_files_[f.first] = llvm::MemoryBuffer::getMemBuffer(f.second);\n  }\n}\n\nClangLoader::~ClangLoader() {}\n\nnamespace\n{\n\nbool is_dir(const string& path)\n{\n  struct stat buf;\n\n  if (::stat (path.c_str (), &buf) < 0)\n    return false;\n\n  return S_ISDIR(buf.st_mode);\n}\n\nstd::pair<bool, string> get_kernel_path_info(const string kdir)\n{\n  if (is_dir(kdir + \"\/build\") && is_dir(kdir + \"\/source\"))\n    return std::make_pair (true, \"source\");\n\n  const char* suffix_from_env = ::getenv(\"BCC_KERNEL_MODULES_SUFFIX\");\n  if (suffix_from_env)\n    return std::make_pair(false, string(suffix_from_env));\n\n  return std::make_pair(false, \"build\");\n}\n\n}\n\nint ClangLoader::parse(unique_ptr<llvm::Module> *mod, unique_ptr<vector<TableDesc>> *tables,\n                       const string &file, bool in_memory, const char *cflags[], int ncflags) {\n  using namespace clang;\n\n  string main_path = \"\/virtual\/main.c\";\n  unique_ptr<llvm::MemoryBuffer> main_buf;\n  struct utsname un;\n  uname(&un);\n  string kdir = string(KERNEL_MODULES_DIR) + \"\/\" + un.release;\n  auto kernel_path_info = get_kernel_path_info (kdir);\n\n  \/\/ clang needs to run inside the kernel dir\n  DirStack dstack(kdir + \"\/\" + kernel_path_info.second);\n  if (!dstack.ok())\n    return -1;\n\n  string abs_file;\n  if (in_memory) {\n    abs_file = main_path;\n    main_buf = llvm::MemoryBuffer::getMemBuffer(file);\n  } else {\n    if (file.substr(0, 1) == \"\/\")\n      abs_file = file;\n    else\n      abs_file = string(dstack.cwd()) + \"\/\" + file;\n  }\n\n  \/\/ -fno-color-diagnostics: this is a workaround for a bug in llvm terminalHasColors() as of\n  \/\/ 22 Jul 2016. Also see bcc #615.\n  vector<const char *> flags_cstr({\"-O0\", \"-emit-llvm\", \"-I\", dstack.cwd(),\n                                   \"-Wno-deprecated-declarations\",\n                                   \"-Wno-gnu-variable-sized-type-not-at-end\",\n                                   \"-fno-color-diagnostics\",\n                                   \"-fno-unwind-tables\",\n                                   \"-fno-asynchronous-unwind-tables\",\n                                   \"-x\", \"c\", \"-c\", abs_file.c_str()});\n\n  KBuildHelper kbuild_helper(kdir, kernel_path_info.first);\n  vector<string> kflags;\n  if (kbuild_helper.get_flags(un.machine, &kflags))\n    return -1;\n  kflags.push_back(\"-include\");\n  kflags.push_back(\"\/virtual\/include\/bcc\/bpf.h\");\n  kflags.push_back(\"-include\");\n  kflags.push_back(\"\/virtual\/include\/bcc\/helpers.h\");\n  kflags.push_back(\"-isystem\");\n  kflags.push_back(\"\/virtual\/include\");\n  for (auto it = kflags.begin(); it != kflags.end(); ++it)\n    flags_cstr.push_back(it->c_str());\n  if (cflags) {\n    for (auto i = 0; i < ncflags; ++i)\n      flags_cstr.push_back(cflags[i]);\n  }\n\n  \/\/ set up the error reporting class\n  IntrusiveRefCntPtr<DiagnosticOptions> diag_opts(new DiagnosticOptions());\n  auto diag_client = new TextDiagnosticPrinter(llvm::errs(), &*diag_opts);\n\n  IntrusiveRefCntPtr<DiagnosticIDs> DiagID(new DiagnosticIDs());\n  DiagnosticsEngine diags(DiagID, &*diag_opts, diag_client);\n\n  \/\/ set up the command line argument wrapper\n#if defined(__powerpc64__)\n#if defined(_CALL_ELF) && _CALL_ELF == 2\n  driver::Driver drv(\"\", \"powerpc64le-unknown-linux-gnu\", diags);\n#else\n  driver::Driver drv(\"\", \"powerpc64-unknown-linux-gnu\", diags);\n#endif\n#elif defined(__aarch64__)\n  driver::Driver drv(\"\", \"aarch64-unknown-linux-gnu\", diags);\n#else\n  driver::Driver drv(\"\", \"x86_64-unknown-linux-gnu\", diags);\n#endif\n  drv.setTitle(\"bcc-clang-driver\");\n  drv.setCheckInputsExist(false);\n\n  unique_ptr<driver::Compilation> compilation(drv.BuildCompilation(flags_cstr));\n  if (!compilation)\n    return -1;\n\n  \/\/ expect exactly 1 job, otherwise error\n  const driver::JobList &jobs = compilation->getJobs();\n  if (jobs.size() != 1 || !isa<driver::Command>(*jobs.begin())) {\n    SmallString<256> msg;\n    llvm::raw_svector_ostream os(msg);\n    jobs.Print(os, \"; \", true);\n    diags.Report(diag::err_fe_expected_compiler_job) << os.str();\n    return -1;\n  }\n\n  const driver::Command &cmd = cast<driver::Command>(*jobs.begin());\n  if (llvm::StringRef(cmd.getCreator().getName()) != \"clang\") {\n    diags.Report(diag::err_fe_expected_clang_command);\n    return -1;\n  }\n\n  \/\/ Initialize a compiler invocation object from the clang (-cc1) arguments.\n  const driver::ArgStringList &ccargs = cmd.getArguments();\n\n  if (flags_ & DEBUG_PREPROCESSOR) {\n    llvm::errs() << \"clang\";\n    for (auto arg : ccargs)\n      llvm::errs() << \" \" << arg;\n    llvm::errs() << \"\\n\";\n  }\n\n  \/\/ pre-compilation pass for generating tracepoint structures\n  CompilerInstance compiler0;\n  CompilerInvocation &invocation0 = compiler0.getInvocation();\n  if (!CompilerInvocation::CreateFromArgs(invocation0, const_cast<const char **>(ccargs.data()),\n                                          const_cast<const char **>(ccargs.data()) + ccargs.size(), diags))\n    return -1;\n\n  invocation0.getPreprocessorOpts().RetainRemappedFileBuffers = true;\n  for (const auto &f : remapped_files_)\n    invocation0.getPreprocessorOpts().addRemappedFile(f.first, &*f.second);\n\n  if (in_memory) {\n    invocation0.getPreprocessorOpts().addRemappedFile(main_path, &*main_buf);\n    invocation0.getFrontendOpts().Inputs.clear();\n    invocation0.getFrontendOpts().Inputs.push_back(FrontendInputFile(main_path, IK_C));\n  }\n  invocation0.getFrontendOpts().DisableFree = false;\n\n  compiler0.createDiagnostics(new IgnoringDiagConsumer());\n\n  \/\/ capture the rewritten c file\n  string out_str;\n  llvm::raw_string_ostream os(out_str);\n  TracepointFrontendAction tpact(os);\n  compiler0.ExecuteAction(tpact); \/\/ ignore errors, they will be reported later\n  unique_ptr<llvm::MemoryBuffer> out_buf = llvm::MemoryBuffer::getMemBuffer(out_str);\n\n  \/\/ first pass\n  CompilerInstance compiler1;\n  CompilerInvocation &invocation1 = compiler1.getInvocation();\n  if (!CompilerInvocation::CreateFromArgs(invocation1, const_cast<const char **>(ccargs.data()),\n                                          const_cast<const char **>(ccargs.data()) + ccargs.size(), diags))\n    return -1;\n\n  \/\/ This option instructs clang whether or not to free the file buffers that we\n  \/\/ give to it. Since the embedded header files should be copied fewer times\n  \/\/ and reused if possible, set this flag to true.\n  invocation1.getPreprocessorOpts().RetainRemappedFileBuffers = true;\n  for (const auto &f : remapped_files_)\n    invocation1.getPreprocessorOpts().addRemappedFile(f.first, &*f.second);\n  invocation1.getPreprocessorOpts().addRemappedFile(main_path, &*out_buf);\n  invocation1.getFrontendOpts().Inputs.clear();\n  invocation1.getFrontendOpts().Inputs.push_back(FrontendInputFile(main_path, IK_C));\n  invocation1.getFrontendOpts().DisableFree = false;\n\n  compiler1.createDiagnostics();\n\n  \/\/ capture the rewritten c file\n  string out_str1;\n  llvm::raw_string_ostream os1(out_str1);\n  BFrontendAction bact(os1, flags_);\n  if (!compiler1.ExecuteAction(bact))\n    return -1;\n  unique_ptr<llvm::MemoryBuffer> out_buf1 = llvm::MemoryBuffer::getMemBuffer(out_str1);\n  \/\/ this contains the open FDs\n  *tables = bact.take_tables();\n\n  \/\/ second pass, clear input and take rewrite buffer\n  CompilerInstance compiler2;\n  CompilerInvocation &invocation2 = compiler2.getInvocation();\n  if (!CompilerInvocation::CreateFromArgs(invocation2, const_cast<const char **>(ccargs.data()),\n                                          const_cast<const char **>(ccargs.data()) + ccargs.size(), diags))\n    return -1;\n  invocation2.getPreprocessorOpts().RetainRemappedFileBuffers = true;\n  for (const auto &f : remapped_files_)\n    invocation2.getPreprocessorOpts().addRemappedFile(f.first, &*f.second);\n  invocation2.getPreprocessorOpts().addRemappedFile(main_path, &*out_buf1);\n  invocation2.getFrontendOpts().Inputs.clear();\n  invocation2.getFrontendOpts().Inputs.push_back(FrontendInputFile(main_path, IK_C));\n  invocation2.getFrontendOpts().DisableFree = false;\n  \/\/ suppress warnings in the 2nd pass, but bail out on errors (our fault)\n  invocation2.getDiagnosticOpts().IgnoreWarnings = true;\n  compiler2.createDiagnostics();\n\n  EmitLLVMOnlyAction ir_act(&*ctx_);\n  if (!compiler2.ExecuteAction(ir_act))\n    return -1;\n  *mod = ir_act.takeModule();\n\n  return 0;\n}\n\n\n}  \/\/ namespace ebpf\n<commit_msg>Style fixes for loader.cc<commit_after>\/*\n * Copyright (c) 2015 PLUMgrid, 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 <map>\n#include <string>\n#include <algorithm>\n#include <fcntl.h>\n#include <ftw.h>\n#include <map>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/utsname.h>\n#include <unistd.h>\n#include <utility>\n#include <vector>\n#include <linux\/bpf.h>\n\n#include <clang\/Basic\/FileManager.h>\n#include <clang\/Basic\/TargetInfo.h>\n#include <clang\/CodeGen\/BackendUtil.h>\n#include <clang\/CodeGen\/CodeGenAction.h>\n#include <clang\/Driver\/Compilation.h>\n#include <clang\/Driver\/Driver.h>\n#include <clang\/Driver\/Job.h>\n#include <clang\/Driver\/Tool.h>\n#include <clang\/Frontend\/CompilerInstance.h>\n#include <clang\/Frontend\/CompilerInvocation.h>\n#include <clang\/Frontend\/FrontendActions.h>\n#include <clang\/Frontend\/FrontendDiagnostic.h>\n#include <clang\/Frontend\/TextDiagnosticPrinter.h>\n#include <clang\/FrontendTool\/Utils.h>\n#include <clang\/Lex\/PreprocessorOptions.h>\n\n#include <llvm\/IR\/Module.h>\n\n#include \"common.h\"\n#include \"bcc_exception.h\"\n#include \"exported_files.h\"\n#include \"kbuild_helper.h\"\n#include \"b_frontend_action.h\"\n#include \"tp_frontend_action.h\"\n#include \"loader.h\"\n\nusing std::map;\nusing std::string;\nusing std::unique_ptr;\nusing std::vector;\n\nnamespace ebpf {\n\nmap<string, unique_ptr<llvm::MemoryBuffer>> ClangLoader::remapped_files_;\n\nClangLoader::ClangLoader(llvm::LLVMContext *ctx, unsigned flags)\n    : ctx_(ctx), flags_(flags)\n{\n  if (remapped_files_.empty()) {\n    for (auto f : ExportedFiles::headers())\n      remapped_files_[f.first] = llvm::MemoryBuffer::getMemBuffer(f.second);\n  }\n}\n\nClangLoader::~ClangLoader() {}\n\nnamespace\n{\n\nbool is_dir(const string& path)\n{\n  struct stat buf;\n\n  if (::stat (path.c_str (), &buf) < 0)\n    return false;\n\n  return S_ISDIR(buf.st_mode);\n}\n\nstd::pair<bool, string> get_kernel_path_info(const string kdir)\n{\n  if (is_dir(kdir + \"\/build\") && is_dir(kdir + \"\/source\"))\n    return std::make_pair (true, \"source\");\n\n  const char* suffix_from_env = ::getenv(\"BCC_KERNEL_MODULES_SUFFIX\");\n  if (suffix_from_env)\n    return std::make_pair(false, string(suffix_from_env));\n\n  return std::make_pair(false, \"build\");\n}\n\n}\n\nint ClangLoader::parse(unique_ptr<llvm::Module> *mod, unique_ptr<vector<TableDesc>> *tables,\n                       const string &file, bool in_memory, const char *cflags[], int ncflags) {\n  using namespace clang;\n\n  string main_path = \"\/virtual\/main.c\";\n  unique_ptr<llvm::MemoryBuffer> main_buf;\n  struct utsname un;\n  uname(&un);\n  string kdir = string(KERNEL_MODULES_DIR) + \"\/\" + un.release;\n  auto kernel_path_info = get_kernel_path_info (kdir);\n\n  \/\/ clang needs to run inside the kernel dir\n  DirStack dstack(kdir + \"\/\" + kernel_path_info.second);\n  if (!dstack.ok())\n    return -1;\n\n  string abs_file;\n  if (in_memory) {\n    abs_file = main_path;\n    main_buf = llvm::MemoryBuffer::getMemBuffer(file);\n  } else {\n    if (file.substr(0, 1) == \"\/\")\n      abs_file = file;\n    else\n      abs_file = string(dstack.cwd()) + \"\/\" + file;\n  }\n\n  \/\/ -fno-color-diagnostics: this is a workaround for a bug in llvm terminalHasColors() as of\n  \/\/ 22 Jul 2016. Also see bcc #615.\n  vector<const char *> flags_cstr({\"-O0\", \"-emit-llvm\", \"-I\", dstack.cwd(),\n                                   \"-Wno-deprecated-declarations\",\n                                   \"-Wno-gnu-variable-sized-type-not-at-end\",\n                                   \"-fno-color-diagnostics\",\n                                   \"-fno-unwind-tables\",\n                                   \"-fno-asynchronous-unwind-tables\",\n                                   \"-x\", \"c\", \"-c\", abs_file.c_str()});\n\n  KBuildHelper kbuild_helper(kdir, kernel_path_info.first);\n  vector<string> kflags;\n  if (kbuild_helper.get_flags(un.machine, &kflags))\n    return -1;\n  kflags.push_back(\"-include\");\n  kflags.push_back(\"\/virtual\/include\/bcc\/bpf.h\");\n  kflags.push_back(\"-include\");\n  kflags.push_back(\"\/virtual\/include\/bcc\/helpers.h\");\n  kflags.push_back(\"-isystem\");\n  kflags.push_back(\"\/virtual\/include\");\n  for (auto it = kflags.begin(); it != kflags.end(); ++it)\n    flags_cstr.push_back(it->c_str());\n  if (cflags) {\n    for (auto i = 0; i < ncflags; ++i)\n      flags_cstr.push_back(cflags[i]);\n  }\n\n  \/\/ set up the error reporting class\n  IntrusiveRefCntPtr<DiagnosticOptions> diag_opts(new DiagnosticOptions());\n  auto diag_client = new TextDiagnosticPrinter(llvm::errs(), &*diag_opts);\n\n  IntrusiveRefCntPtr<DiagnosticIDs> DiagID(new DiagnosticIDs());\n  DiagnosticsEngine diags(DiagID, &*diag_opts, diag_client);\n\n  \/\/ set up the command line argument wrapper\n#if defined(__powerpc64__)\n#if defined(_CALL_ELF) && _CALL_ELF == 2\n  driver::Driver drv(\"\", \"powerpc64le-unknown-linux-gnu\", diags);\n#else\n  driver::Driver drv(\"\", \"powerpc64-unknown-linux-gnu\", diags);\n#endif\n#elif defined(__aarch64__)\n  driver::Driver drv(\"\", \"aarch64-unknown-linux-gnu\", diags);\n#else\n  driver::Driver drv(\"\", \"x86_64-unknown-linux-gnu\", diags);\n#endif\n  drv.setTitle(\"bcc-clang-driver\");\n  drv.setCheckInputsExist(false);\n\n  unique_ptr<driver::Compilation> compilation(drv.BuildCompilation(flags_cstr));\n  if (!compilation)\n    return -1;\n\n  \/\/ expect exactly 1 job, otherwise error\n  const driver::JobList &jobs = compilation->getJobs();\n  if (jobs.size() != 1 || !isa<driver::Command>(*jobs.begin())) {\n    SmallString<256> msg;\n    llvm::raw_svector_ostream os(msg);\n    jobs.Print(os, \"; \", true);\n    diags.Report(diag::err_fe_expected_compiler_job) << os.str();\n    return -1;\n  }\n\n  const driver::Command &cmd = cast<driver::Command>(*jobs.begin());\n  if (llvm::StringRef(cmd.getCreator().getName()) != \"clang\") {\n    diags.Report(diag::err_fe_expected_clang_command);\n    return -1;\n  }\n\n  \/\/ Initialize a compiler invocation object from the clang (-cc1) arguments.\n  const driver::ArgStringList &ccargs = cmd.getArguments();\n\n  if (flags_ & DEBUG_PREPROCESSOR) {\n    llvm::errs() << \"clang\";\n    for (auto arg : ccargs)\n      llvm::errs() << \" \" << arg;\n    llvm::errs() << \"\\n\";\n  }\n\n  \/\/ pre-compilation pass for generating tracepoint structures\n  CompilerInstance compiler0;\n  CompilerInvocation &invocation0 = compiler0.getInvocation();\n  if (!CompilerInvocation::CreateFromArgs(\n          invocation0, const_cast<const char **>(ccargs.data()),\n          const_cast<const char **>(ccargs.data()) + ccargs.size(), diags))\n    return -1;\n\n  invocation0.getPreprocessorOpts().RetainRemappedFileBuffers = true;\n  for (const auto &f : remapped_files_)\n    invocation0.getPreprocessorOpts().addRemappedFile(f.first, &*f.second);\n\n  if (in_memory) {\n    invocation0.getPreprocessorOpts().addRemappedFile(main_path, &*main_buf);\n    invocation0.getFrontendOpts().Inputs.clear();\n    invocation0.getFrontendOpts().Inputs.push_back(\n        FrontendInputFile(main_path, IK_C));\n  }\n  invocation0.getFrontendOpts().DisableFree = false;\n\n  compiler0.createDiagnostics(new IgnoringDiagConsumer());\n\n  \/\/ capture the rewritten c file\n  string out_str;\n  llvm::raw_string_ostream os(out_str);\n  TracepointFrontendAction tpact(os);\n  compiler0.ExecuteAction(tpact); \/\/ ignore errors, they will be reported later\n  unique_ptr<llvm::MemoryBuffer> out_buf = llvm::MemoryBuffer::getMemBuffer(out_str);\n\n  \/\/ first pass\n  CompilerInstance compiler1;\n  CompilerInvocation &invocation1 = compiler1.getInvocation();\n  if (!CompilerInvocation::CreateFromArgs(\n          invocation1, const_cast<const char **>(ccargs.data()),\n          const_cast<const char **>(ccargs.data()) + ccargs.size(), diags))\n    return -1;\n\n  \/\/ This option instructs clang whether or not to free the file buffers that we\n  \/\/ give to it. Since the embedded header files should be copied fewer times\n  \/\/ and reused if possible, set this flag to true.\n  invocation1.getPreprocessorOpts().RetainRemappedFileBuffers = true;\n  for (const auto &f : remapped_files_)\n    invocation1.getPreprocessorOpts().addRemappedFile(f.first, &*f.second);\n  invocation1.getPreprocessorOpts().addRemappedFile(main_path, &*out_buf);\n  invocation1.getFrontendOpts().Inputs.clear();\n  invocation1.getFrontendOpts().Inputs.push_back(\n      FrontendInputFile(main_path, IK_C));\n  invocation1.getFrontendOpts().DisableFree = false;\n\n  compiler1.createDiagnostics();\n\n  \/\/ capture the rewritten c file\n  string out_str1;\n  llvm::raw_string_ostream os1(out_str1);\n  BFrontendAction bact(os1, flags_);\n  if (!compiler1.ExecuteAction(bact))\n    return -1;\n  unique_ptr<llvm::MemoryBuffer> out_buf1 = llvm::MemoryBuffer::getMemBuffer(out_str1);\n  \/\/ this contains the open FDs\n  *tables = bact.take_tables();\n\n  \/\/ second pass, clear input and take rewrite buffer\n  CompilerInstance compiler2;\n  CompilerInvocation &invocation2 = compiler2.getInvocation();\n  if (!CompilerInvocation::CreateFromArgs(\n          invocation2, const_cast<const char **>(ccargs.data()),\n          const_cast<const char **>(ccargs.data()) + ccargs.size(), diags))\n    return -1;\n  invocation2.getPreprocessorOpts().RetainRemappedFileBuffers = true;\n  for (const auto &f : remapped_files_)\n    invocation2.getPreprocessorOpts().addRemappedFile(f.first, &*f.second);\n  invocation2.getPreprocessorOpts().addRemappedFile(main_path, &*out_buf1);\n  invocation2.getFrontendOpts().Inputs.clear();\n  invocation2.getFrontendOpts().Inputs.push_back(\n      FrontendInputFile(main_path, IK_C));\n  invocation2.getFrontendOpts().DisableFree = false;\n  \/\/ suppress warnings in the 2nd pass, but bail out on errors (our fault)\n  invocation2.getDiagnosticOpts().IgnoreWarnings = true;\n  compiler2.createDiagnostics();\n\n  EmitLLVMOnlyAction ir_act(&*ctx_);\n  if (!compiler2.ExecuteAction(ir_act))\n    return -1;\n  *mod = ir_act.takeModule();\n\n  return 0;\n}\n\n\n}  \/\/ namespace ebpf\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * MAST: Multidisciplinary-design Adaptation and Sensitivity Toolkit\n * Copyright (C) 2013-2015  Manav Bhatia\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\/\/ MAST includes\n#include \"solver\/transient_solver_base.h\"\n#include \"base\/transient_assembly.h\"\n\n\/\/ libMesh includes\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/dof_map.h\"\n\n\n\nMAST::TransientSolverBase::TransientSolverBase():\ndt(0.),\n_first_step(false),\n_assembly(NULL),\n_system(NULL) {\n\n}\n\n\n\n\nMAST::TransientSolverBase::~TransientSolverBase() {\n    this->clear_assembly();\n}\n\n\n\nvoid\nMAST::TransientSolverBase::set_assembly(MAST::TransientAssembly& assembly) {\n    \n    \/\/ make sure that the previous assembly association has been cleared\n    this->clear_assembly();\n    \n    _assembly = &assembly;\n    _system   = dynamic_cast<libMesh::NonlinearImplicitSystem*>(&assembly.system());\n    \n    \/\/ number of time steps to store\n    unsigned int n_iters = _n_iters_to_store();\n    \n    \/\/ resize the vectors if needed\n    _solution.resize(n_iters);\n    _velocity.resize(n_iters);\n    if (this->ode_order()>1)\n        _acceleration.resize(n_iters);\n        \n    for (unsigned int i=0; i<n_iters; i++) {\n        _solution[i] = _system->solution->zero_clone().release();\n        _velocity[i] = _system->solution->zero_clone().release();\n        if (this->ode_order()>1)\n            _acceleration[i] = _system->solution->zero_clone().release();\n    }\n    \n    \/\/ now localize the vectors\n    \/\/ add the vectors\n    std::string nm;\n    for (unsigned int i=0; i<n_iters; i++) {\n        std::ostringstream iter;\n        iter << i;\n        \n        \/\/ add the solution\n        nm = \"transient_solution_\";\n        nm += iter.str();\n        if (!_system->have_vector(nm))\n            _system->add_vector(nm);\n        \n        \/\/ add the velocity\n        nm = \"transient_velocity_\";\n        nm += iter.str();\n        if (!_system->have_vector(nm))\n            _system->add_vector(nm);\n        \n        if (this->ode_order() > 1) {\n            \/\/ add the acceleration\n            nm = \"transient_acceleration_\";\n            nm += iter.str();\n            if (!_system->have_vector(nm))\n                _system->add_vector(nm);\n            \n        }\n    }\n    \n    _first_step = true;\n}\n\n\n\nvoid\nMAST::TransientSolverBase::clear_assembly() {\n    \n    \/\/ if no system has been set so far, nothing needs to be done\n    if (!_system)\n        return;\n    \n    \/\/ clear the transient solutions stored in system for solution\n    \/\/ number of time steps to store\n    unsigned int n_iters = _n_iters_to_store();\n    \n    \/\/ now localize the vectors\n    \/\/ add the vectors\n    std::string nm;\n    for (unsigned int i=0; i<n_iters; i++) {\n        std::ostringstream iter;\n        iter << i;\n        \n        \/\/ add the solution\n        nm = \"transient_solution_\";\n        nm += iter.str();\n        if (_system->have_vector(nm))\n            _system->remove_vector(nm);\n        \n        \/\/ add the velocity\n        nm = \"transient_velocity_\";\n        nm += iter.str();\n        if (_system->have_vector(nm))\n            _system->remove_vector(nm);\n        \n        if (this->ode_order() > 1) {\n            \/\/ add the acceleration\n            nm = \"transient_acceleration_\";\n            nm += iter.str();\n            if (_system->have_vector(nm))\n                _system->remove_vector(nm);\n            \n        }\n    }\n    \n    if (_solution.size()) {\n        \n        for (unsigned int i=0; i<n_iters; i++) {\n            delete _solution[i]; _solution[i] = NULL;\n            delete _velocity[i]; _velocity[i] = NULL;\n            if (this->ode_order()>1) {\n                delete _acceleration[i]; _acceleration[i] = NULL;\n            }\n        }\n        \n        _solution.resize(0);\n        _velocity.resize(0);\n        if (this->ode_order()>1)\n            _acceleration.resize(0);\n    }\n\n    \n    _assembly   = NULL;\n    _system     = NULL;\n    _first_step = true;\n}\n\n\n\n\nconst libMesh::NumericVector<Real>&\nMAST::TransientSolverBase::solution(unsigned int prev_iter) const {\n    \n    \/\/ make sura that prev_iter is within acceptable bounds\n    libmesh_assert_less(prev_iter, _n_iters_to_store());\n    \n    \/\/ make sure that the vectors have been initialized\n    libmesh_assert_equal_to(_solution.size(), _n_iters_to_store());\n    libmesh_assert(_solution[prev_iter]);\n    \n    return *(_solution[prev_iter]);\n}\n\n\n\nconst libMesh::NumericVector<Real>&\nMAST::TransientSolverBase::velocity(unsigned int prev_iter) const {\n    \n    \/\/ make sura that prev_iter is within acceptable bounds\n    libmesh_assert_less(prev_iter, _n_iters_to_store());\n    \n    \/\/ make sure that the vectors have been initialized\n    libmesh_assert_equal_to(_velocity.size(), _n_iters_to_store());\n    libmesh_assert(_velocity[prev_iter]);\n    \n    return *(_velocity[prev_iter]);\n}\n\n\n\nconst libMesh::NumericVector<Real>&\nMAST::TransientSolverBase::acceleration(unsigned int prev_iter) const {\n    \n    \/\/ make sura that prev_iter is within acceptable bounds\n    libmesh_assert_less(prev_iter, _n_iters_to_store());\n    \n    \/\/ make sure that the vectors have been initialized\n    libmesh_assert_equal_to(_acceleration.size(), _n_iters_to_store());\n    libmesh_assert(_acceleration[prev_iter]);\n    \n    return *(_acceleration[prev_iter]);\n}\n\n\n\nvoid\nMAST::TransientSolverBase::\n_localize_solutions(const libMesh::NumericVector<Real>& current_sol) {\n    \n    \/\/ make sure that the system has been specified\n    libmesh_assert(_system);\n    \n    \/\/ number of time steps to store\n    unsigned int n_iters = _n_iters_to_store();\n\n    \/\/ send list\n    const std::vector<libMesh::dof_id_type>& send_list =\n    _system->get_dof_map().get_send_list();\n    \n    \/\/ now localize the vectors\n    std::string nm;\n    const libMesh::NumericVector<Real> *vec;\n    for (unsigned int i=0; i<n_iters; i++) {\n        \n        std::ostringstream iter;\n        iter << i;\n\n        nm = \"transient_solution_\" + iter.str();\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ localize the solution\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        if (i == 0) {\n            \/\/ update both the localized and system stored solution\n            _system->get_vector(nm) = current_sol;\n            _system->get_vector(nm).close();\n            vec = &current_sol;\n        }\n        else {\n            \/\/ update the localized with the system stored solution\n            vec = &(_system->get_vector(nm));\n        }\n        _solution[i]->init(_system->n_dofs(),\n                           _system->n_local_dofs(),\n                           send_list,\n                           false,\n                           libMesh::GHOSTED);\n        vec->localize(*_solution[i], send_list);\n        _solution[i]->close();\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ localize the velocity\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        nm = \"transient_velocity_\" + iter.str();\n        \/\/\n        if (i == 0) {\n            \/\/ update the velocity using the current estimate\n            _update_velocity(_system->get_vector(nm));\n        }\n\n        \/\/ now update localized vectors using the stored velocity\n        vec = &(_system->get_vector(nm));\n        _velocity[i]->init(_system->n_dofs(),\n                           _system->n_local_dofs(),\n                           send_list,\n                           false,\n                           libMesh::GHOSTED);\n        vec->localize(*_velocity[i], send_list);\n        _velocity[i]->close();\n        \n        if (this->ode_order()) {\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            \/\/ localize the acceleration\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            nm = \"transient_acceleration_\" + iter.str();\n            \/\/\n            if (i == 0) {\n                \/\/ update the acceleration using the current estimate\n                _update_acceleration(_system->get_vector(nm));\n            }\n            \n            \/\/ now update localized vectors using the stored acceleration\n            vec = &(_system->get_vector(nm));\n            _acceleration[i]->init(_system->n_dofs(),\n                                   _system->n_local_dofs(),\n                                   send_list,\n                                   false,\n                                   libMesh::GHOSTED);\n            vec->localize(*_acceleration[i], send_list);\n            _acceleration[i]->close();\n        }\n        \n    }\n}\n\n\n\nvoid\nMAST::TransientSolverBase::set_initial_condition(Real val) {\n    \n    libmesh_assert(_system);\n    libmesh_assert(_first_step);\n    \n    std::string nm;\n    for (unsigned int i=0; i<_n_iters_to_store(); i++) {\n        std::ostringstream oss;\n        oss << i;\n        nm = \"transient_solution_\" + oss.str();\n        libMesh::NumericVector<Real> & sol =  _system->get_vector(nm);\n        sol = val;\n        sol.close();\n    }\n    _system->solution->operator=(val);\n    _system->solution->close();\n}\n\n\nvoid\nMAST::TransientSolverBase::advance_time_step() {\n\n\n    \/\/ first ask the solver to update the acceleration vector\n    _update_velocity(_system->get_vector(\"transient_velocity_0\"));\n    if (this->ode_order() > 1)\n        _update_acceleration(_system->get_vector(\"transient_acceleration_0\"));\n\n    \/\/ next, move all the solutions and velocities into older\n    \/\/ time step locations\n    std::string nm1, nm2;\n    for (unsigned int i=_n_iters_to_store()-1; i>0; i--) {\n        std::ostringstream oss1, oss2;\n        oss1 << i;\n        oss2 << i-1;\n        \n        \/\/ get references to the solution\n        nm1 = \"transient_solution_\" + oss1.str();\n        nm2 = \"transient_solution_\" + oss2.str();\n\n        libMesh::NumericVector<Real>\n        & old_sol     = _system->get_vector(nm1),\n        & sol         = _system->get_vector(nm2);\n\n        old_sol = sol;\n        old_sol.close();\n        \n        \/\/ get references to the velocity\n        nm1 = \"transient_velocity_\" + oss1.str();\n        nm2 = \"transient_velocity_\" + oss2.str();\n        \n        libMesh::NumericVector<Real>\n        & old_vel     = _system->get_vector(nm1),\n        & vel         = _system->get_vector(nm2);\n\n        old_vel = vel;\n        old_vel.close();\n        \n        if (this->ode_order() > 1) {\n            \/\/ get references to the acceleration\n            nm1 = \"transient_acceleration_\" + oss1.str();\n            nm2 = \"transient_acceleration_\" + oss2.str();\n            \n            libMesh::NumericVector<Real>\n            & old_accel     = _system->get_vector(nm1),\n            & accel         = _system->get_vector(nm2);\n            \n            old_accel = accel;\n            old_accel.close();\n        }\n        \n\n    }\n\n    \/\/ and localize solution so that if the user calls the solution and\n    \/\/ velocity routines,\n    \n    \/\/ finally, update the system time\n    _system->time += dt;\n    _first_step    = false;\n}\n\n\n\n\n<commit_msg>-- bug-fix for transient solver where the first order solver was asking for transient acceleration.<commit_after>\/*\n * MAST: Multidisciplinary-design Adaptation and Sensitivity Toolkit\n * Copyright (C) 2013-2015  Manav Bhatia\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\/\/ MAST includes\n#include \"solver\/transient_solver_base.h\"\n#include \"base\/transient_assembly.h\"\n\n\/\/ libMesh includes\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/dof_map.h\"\n\n\n\nMAST::TransientSolverBase::TransientSolverBase():\ndt(0.),\n_first_step(false),\n_assembly(NULL),\n_system(NULL) {\n\n}\n\n\n\n\nMAST::TransientSolverBase::~TransientSolverBase() {\n    this->clear_assembly();\n}\n\n\n\nvoid\nMAST::TransientSolverBase::set_assembly(MAST::TransientAssembly& assembly) {\n    \n    \/\/ make sure that the previous assembly association has been cleared\n    this->clear_assembly();\n    \n    _assembly = &assembly;\n    _system   = dynamic_cast<libMesh::NonlinearImplicitSystem*>(&assembly.system());\n    \n    \/\/ number of time steps to store\n    unsigned int n_iters = _n_iters_to_store();\n    \n    \/\/ resize the vectors if needed\n    _solution.resize(n_iters);\n    _velocity.resize(n_iters);\n    if (this->ode_order()>1)\n        _acceleration.resize(n_iters);\n        \n    for (unsigned int i=0; i<n_iters; i++) {\n        _solution[i] = _system->solution->zero_clone().release();\n        _velocity[i] = _system->solution->zero_clone().release();\n        if (this->ode_order()>1)\n            _acceleration[i] = _system->solution->zero_clone().release();\n    }\n    \n    \/\/ now localize the vectors\n    \/\/ add the vectors\n    std::string nm;\n    for (unsigned int i=0; i<n_iters; i++) {\n        std::ostringstream iter;\n        iter << i;\n        \n        \/\/ add the solution\n        nm = \"transient_solution_\";\n        nm += iter.str();\n        if (!_system->have_vector(nm))\n            _system->add_vector(nm);\n        \n        \/\/ add the velocity\n        nm = \"transient_velocity_\";\n        nm += iter.str();\n        if (!_system->have_vector(nm))\n            _system->add_vector(nm);\n        \n        if (this->ode_order() > 1) {\n            \/\/ add the acceleration\n            nm = \"transient_acceleration_\";\n            nm += iter.str();\n            if (!_system->have_vector(nm))\n                _system->add_vector(nm);\n            \n        }\n    }\n    \n    _first_step = true;\n}\n\n\n\nvoid\nMAST::TransientSolverBase::clear_assembly() {\n    \n    \/\/ if no system has been set so far, nothing needs to be done\n    if (!_system)\n        return;\n    \n    \/\/ clear the transient solutions stored in system for solution\n    \/\/ number of time steps to store\n    unsigned int n_iters = _n_iters_to_store();\n    \n    \/\/ now localize the vectors\n    \/\/ add the vectors\n    std::string nm;\n    for (unsigned int i=0; i<n_iters; i++) {\n        std::ostringstream iter;\n        iter << i;\n        \n        \/\/ add the solution\n        nm = \"transient_solution_\";\n        nm += iter.str();\n        if (_system->have_vector(nm))\n            _system->remove_vector(nm);\n        \n        \/\/ add the velocity\n        nm = \"transient_velocity_\";\n        nm += iter.str();\n        if (_system->have_vector(nm))\n            _system->remove_vector(nm);\n        \n        if (this->ode_order() > 1) {\n            \/\/ add the acceleration\n            nm = \"transient_acceleration_\";\n            nm += iter.str();\n            if (_system->have_vector(nm))\n                _system->remove_vector(nm);\n            \n        }\n    }\n    \n    if (_solution.size()) {\n        \n        for (unsigned int i=0; i<n_iters; i++) {\n            delete _solution[i]; _solution[i] = NULL;\n            delete _velocity[i]; _velocity[i] = NULL;\n            if (this->ode_order()>1) {\n                delete _acceleration[i]; _acceleration[i] = NULL;\n            }\n        }\n        \n        _solution.resize(0);\n        _velocity.resize(0);\n        if (this->ode_order()>1)\n            _acceleration.resize(0);\n    }\n\n    \n    _assembly   = NULL;\n    _system     = NULL;\n    _first_step = true;\n}\n\n\n\n\nconst libMesh::NumericVector<Real>&\nMAST::TransientSolverBase::solution(unsigned int prev_iter) const {\n    \n    \/\/ make sura that prev_iter is within acceptable bounds\n    libmesh_assert_less(prev_iter, _n_iters_to_store());\n    \n    \/\/ make sure that the vectors have been initialized\n    libmesh_assert_equal_to(_solution.size(), _n_iters_to_store());\n    libmesh_assert(_solution[prev_iter]);\n    \n    return *(_solution[prev_iter]);\n}\n\n\n\nconst libMesh::NumericVector<Real>&\nMAST::TransientSolverBase::velocity(unsigned int prev_iter) const {\n    \n    \/\/ make sura that prev_iter is within acceptable bounds\n    libmesh_assert_less(prev_iter, _n_iters_to_store());\n    \n    \/\/ make sure that the vectors have been initialized\n    libmesh_assert_equal_to(_velocity.size(), _n_iters_to_store());\n    libmesh_assert(_velocity[prev_iter]);\n    \n    return *(_velocity[prev_iter]);\n}\n\n\n\nconst libMesh::NumericVector<Real>&\nMAST::TransientSolverBase::acceleration(unsigned int prev_iter) const {\n    \n    \/\/ make sura that prev_iter is within acceptable bounds\n    libmesh_assert_less(prev_iter, _n_iters_to_store());\n    \n    \/\/ make sure that the vectors have been initialized\n    libmesh_assert_equal_to(_acceleration.size(), _n_iters_to_store());\n    libmesh_assert(_acceleration[prev_iter]);\n    \n    return *(_acceleration[prev_iter]);\n}\n\n\n\nvoid\nMAST::TransientSolverBase::\n_localize_solutions(const libMesh::NumericVector<Real>& current_sol) {\n    \n    \/\/ make sure that the system has been specified\n    libmesh_assert(_system);\n    \n    \/\/ number of time steps to store\n    unsigned int n_iters = _n_iters_to_store();\n\n    \/\/ send list\n    const std::vector<libMesh::dof_id_type>& send_list =\n    _system->get_dof_map().get_send_list();\n    \n    \/\/ now localize the vectors\n    std::string nm;\n    const libMesh::NumericVector<Real> *vec;\n    for (unsigned int i=0; i<n_iters; i++) {\n        \n        std::ostringstream iter;\n        iter << i;\n\n        nm = \"transient_solution_\" + iter.str();\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ localize the solution\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        if (i == 0) {\n            \/\/ update both the localized and system stored solution\n            _system->get_vector(nm) = current_sol;\n            _system->get_vector(nm).close();\n            vec = &current_sol;\n        }\n        else {\n            \/\/ update the localized with the system stored solution\n            vec = &(_system->get_vector(nm));\n        }\n        _solution[i]->init(_system->n_dofs(),\n                           _system->n_local_dofs(),\n                           send_list,\n                           false,\n                           libMesh::GHOSTED);\n        vec->localize(*_solution[i], send_list);\n        _solution[i]->close();\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ localize the velocity\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        nm = \"transient_velocity_\" + iter.str();\n        \/\/\n        if (i == 0) {\n            \/\/ update the velocity using the current estimate\n            _update_velocity(_system->get_vector(nm));\n        }\n\n        \/\/ now update localized vectors using the stored velocity\n        vec = &(_system->get_vector(nm));\n        _velocity[i]->init(_system->n_dofs(),\n                           _system->n_local_dofs(),\n                           send_list,\n                           false,\n                           libMesh::GHOSTED);\n        vec->localize(*_velocity[i], send_list);\n        _velocity[i]->close();\n        \n        if (this->ode_order()>1) {\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            \/\/ localize the acceleration\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            nm = \"transient_acceleration_\" + iter.str();\n            \/\/\n            if (i == 0) {\n                \/\/ update the acceleration using the current estimate\n                _update_acceleration(_system->get_vector(nm));\n            }\n            \n            \/\/ now update localized vectors using the stored acceleration\n            vec = &(_system->get_vector(nm));\n            _acceleration[i]->init(_system->n_dofs(),\n                                   _system->n_local_dofs(),\n                                   send_list,\n                                   false,\n                                   libMesh::GHOSTED);\n            vec->localize(*_acceleration[i], send_list);\n            _acceleration[i]->close();\n        }\n        \n    }\n}\n\n\n\nvoid\nMAST::TransientSolverBase::set_initial_condition(Real val) {\n    \n    libmesh_assert(_system);\n    libmesh_assert(_first_step);\n    \n    std::string nm;\n    for (unsigned int i=0; i<_n_iters_to_store(); i++) {\n        std::ostringstream oss;\n        oss << i;\n        nm = \"transient_solution_\" + oss.str();\n        libMesh::NumericVector<Real> & sol =  _system->get_vector(nm);\n        sol = val;\n        sol.close();\n    }\n    _system->solution->operator=(val);\n    _system->solution->close();\n}\n\n\nvoid\nMAST::TransientSolverBase::advance_time_step() {\n\n\n    \/\/ first ask the solver to update the acceleration vector\n    _update_velocity(_system->get_vector(\"transient_velocity_0\"));\n    if (this->ode_order() > 1)\n        _update_acceleration(_system->get_vector(\"transient_acceleration_0\"));\n\n    \/\/ next, move all the solutions and velocities into older\n    \/\/ time step locations\n    std::string nm1, nm2;\n    for (unsigned int i=_n_iters_to_store()-1; i>0; i--) {\n        std::ostringstream oss1, oss2;\n        oss1 << i;\n        oss2 << i-1;\n        \n        \/\/ get references to the solution\n        nm1 = \"transient_solution_\" + oss1.str();\n        nm2 = \"transient_solution_\" + oss2.str();\n\n        libMesh::NumericVector<Real>\n        & old_sol     = _system->get_vector(nm1),\n        & sol         = _system->get_vector(nm2);\n\n        old_sol = sol;\n        old_sol.close();\n        \n        \/\/ get references to the velocity\n        nm1 = \"transient_velocity_\" + oss1.str();\n        nm2 = \"transient_velocity_\" + oss2.str();\n        \n        libMesh::NumericVector<Real>\n        & old_vel     = _system->get_vector(nm1),\n        & vel         = _system->get_vector(nm2);\n\n        old_vel = vel;\n        old_vel.close();\n        \n        if (this->ode_order() > 1) {\n            \/\/ get references to the acceleration\n            nm1 = \"transient_acceleration_\" + oss1.str();\n            nm2 = \"transient_acceleration_\" + oss2.str();\n            \n            libMesh::NumericVector<Real>\n            & old_accel     = _system->get_vector(nm1),\n            & accel         = _system->get_vector(nm2);\n            \n            old_accel = accel;\n            old_accel.close();\n        }\n        \n\n    }\n\n    \/\/ and localize solution so that if the user calls the solution and\n    \/\/ velocity routines,\n    \n    \/\/ finally, update the system time\n    _system->time += dt;\n    _first_step    = false;\n}\n\n\n\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 \t\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\/\n\n#include \"swsharingservice.h\"\n#include \"collections_adaptor.h\"\n#include <libsocialweb-qt\/swclientdbustypes.h>\n\n#include <QFile>\n#include <libsocialweb-qt\/swclientservice.h>\n#include <libsocialweb-qt\/swclientserviceconfig.h>\n\nSwSharingService::SwSharingService(SwClientService *swService,\n                                   MeeGoUXSharingServiceInfo serviceInfo,\n                                   QObject *parent) :\n    MeeGoUXSharingService(serviceInfo, parent),\n    mService(swService),\n    mShareID(0)\n{\n    qDebug() << QString(\"Starting up SwSharingService with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    connect(mService,\n            SIGNAL(PhotoUploadProgress(SwClientService*,int,int,QString)),\n            this,\n            SLOT(onShareUploadProgress(SwClientService*,int,int,QString)));\n    connect(mService,\n            SIGNAL(VideoUploadProgress(SwClientService*,int,int,QString)),\n            this,\n            SLOT(onShareUploadProgress(SwClientService*,int,int,QString)));\n\n\n    registerDataTypes();    \/\/lsw-qt DBUS data types\n\n    \/\/QDBusConnection::sessionBus().registerObject(GetDBusObjPath().append(\"\/Collections\"), this);\n    mCollections = new CollectionsAdaptor(this);\n\n    connect(mService,\n            SIGNAL(collCreated(SwClientService*,QString,bool)),\n            this,\n            SLOT(onCollCreated(SwClientService*,QString,bool)));\n    connect(mService,\n            SIGNAL(collDetailsRetrieved(SwClientService*,SwCollectionDetails,bool)),\n            this,\n            SLOT(onCollDetailsRetrieved(SwClientService*,SwCollectionDetails,bool)));\n    connect(mService,\n            SIGNAL(collListRetrieved(SwClientService*,ArrayOfSwCollectionDetails,bool)),\n            this,\n            SLOT(onCollListRetrieved(SwClientService*,ArrayOfSwCollectionDetails,bool)));\n\n\/*    connect(mService,\n            SIGNAL(AudioUploadProgress(SwClientService*,int,int,QString)),\n            this,\n            SLOT(onAudioUploadProgress(SwClientService*,int,int,QString)));*\/\n}\n\nSwSharingService::~SwSharingService()\n{\n}\n\n\/\/Begin MeeGoUXSharingService methods\n\nbool SwSharingService::CanShareType(const QString &sharetype)\n{\n    return (mServiceInfo.serviceTypes.contains(sharetype));\n}\n\nbool SwSharingService::CancelShare(int opid)\n{\n    Q_UNUSED(opid);\n    qDebug() << QString(\"Cannot cancel LSW sharing uploads!\");\n    return false;\n}\n\nuint SwSharingService::GetCredsState()\n{\n    qDebug() << QString(\"SwSharingService::GetCredsState with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->credsState();\n}\n\nQString SwSharingService::GetDisplayName()\n{\n    qDebug() << QString(\"SwSharingService::GetDisplayName with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->getDisplayName();\n}\n\nQString SwSharingService::GetIconPath()\n{\n    qDebug() << QString(\"SwSharingService::GetIconPath with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->getServiceConfig()->getIconPath();\n}\n\nbool SwSharingService::GetServiceAvailable()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceAvailable with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->isConfigured();\n}\n\nQString SwSharingService::GetServiceDesc()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceDesc with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->getServiceConfig()->getDescription();\n}\n\nQString SwSharingService::GetServiceName()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceName with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mServiceInfo.serviceName;\n}\n\nQString SwSharingService::GetServiceStateText()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceStateText with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    \/\/TODO: make meaningful text based on service\/creds state\n    return QString(\"Blah\");\n}\n\nQString SwSharingService::GetServiceType()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceType with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return tr(\"Web\");\n}\n\nQString SwSharingService::GetSettingsURI(const QString &platform,\n                                       const QString &product)\n{\n    QString retVal = \"\";\n\n    if (platform == \"MeeGo\") {\n        if (product == \"UX\") {\n            retVal = QString(\"meego-qml-launcher --opengl --app meego-ux-settings --fullscreen --cmd showPage --cdata \\\"Web\\ Accounts\\\" \");\n        } else {\n            qDebug() << QString(\"Invalid product in SwSharingService::GetSettingsURI: %1\").arg(product);\n        }\n    } else {\n        qDebug() << QString(\"Invalid platform in SwSharingService::GetSettingsURI: %1\").arg(platform);\n    }\n    return retVal;\n}\n\nQString SwSharingService::GetUIName(const QString &widgettype,\n                                  const QString &platform,\n                                  const QString &product,\n                                  const QString &sharetype,\n                                  uint sharecount)\n{\n    qDebug() << QString(\"SwSharingService::GetUIName with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n\n    \/\/No LSW support for audio yet...\n    if (sharetype == MEEGO_SHARE_TYPE_AUDIO)\n        return QString();\n\n    QString type;\n    QString mult;\n    if (widgettype == \"QML\") {\n        if (sharetype == MEEGO_SHARE_TYPE_IMAGE) {\n            type = \"image\";\n        } else if (sharetype == MEEGO_SHARE_TYPE_VIDEO) {\n            type = \"video\";\n        } else if (sharetype == MEEGO_SHARE_TYPE_AUDIO) {\n            type = \"audio\";\n        } else {\n            type = QString(sharetype).replace(QString(\"\/\"), QString(\"_\"));   \/\/Custom type support\n        }\n\n        mult = (sharecount > 1 ? \"multi\" : \"single\");\n        QString filename = QString(\"%1\/%2\/%3_%4_%5_%6_%7\").arg(QML_TARGET_BASE_PATH, \"socialweb\", mServiceInfo.serviceName, platform, product, type, mult);\n        \/\/If we don't have a file for this prodct\/platform\n        if (!QFile::exists(filename + \".qml\")) {\n            \/\/Try just this product\n            filename = QString(\"%1\/%2\/%3_%4_%5_%6\").arg(QML_TARGET_BASE_PATH, \"socialweb\", mServiceInfo.serviceName, platform, type, mult);\n            if (!QFile::exists(filename + \".qml\")) {\n                \/\/Otherwise, just return the standard one\n                filename = QString(\"%1\/%2\/%3_%4_%5\").arg(QML_TARGET_BASE_PATH, \"socialweb\", mServiceInfo.serviceName, type, mult);\n            }\n        }\n        return filename;\n\n    } else {\n        \/\/Handle other UI types here...\n        return QString();\n    }\n}\n\nint SwSharingService::Share(const QString &sharetype, ArrayOfShareItemStruct items, QString &errmessage)\n{\n    if (!CanShareType(sharetype)) {\n        errmessage = QString(\"Invalid share type %1!\").arg(sharetype);\n\treturn -1;\n    }\n    int i = -1;\n    if (items.count() < 1) {\n        errmessage = \"No items to share!\";\n        return -1;\n    }\n\n    foreach(ShareItemStruct sis, items) {\n        qDebug() << QString(\"Received file %1!\").arg(sis.shareURI);\n        qDebug() << sis.params;\n        \/\/LSW can't deal with \"file:\/\/\" URIs, so we trim it to a local file instead\n        if (sis.shareURI.startsWith(\"file:\/\/\", Qt::CaseInsensitive))\n            sis.shareURI = sis.shareURI.remove(0, 7);\n\n        if (sharetype == MEEGO_SHARE_TYPE_IMAGE) {\n            i = mService->uploadPhoto(sis.shareURI, sis.params);\n        } else if (sharetype == MEEGO_SHARE_TYPE_VIDEO) {\n            i = mService->uploadVideo(sis.shareURI, sis.params);\n        } else if (sharetype == MEEGO_SHARE_TYPE_AUDIO) {\n            \/\/No audio share type in LSW yet...\n        }\n        \/\/TODO: Figure out how to handle partial success, partial failure...\n        \/\/Maybe make Share return a QList< struct {sis.shareURI, shareID, message} > ?\n        if (i != -1) {\n            mShareOpsMap[mShareID].append(i);\n            mShareOpProgressMap[mShareID].append(QPair<int, int>(i, 0));\n        }\n    }\n\n    return mShareID++;\n}\n\n\n\/\/Private slots:\n\nvoid SwSharingService::onShareUploadProgress(SwClientService *service, int opid, int progress, QString message)\n{\n    int i, j = -1;\n    int totalProgress = 0, count = 0;\n\n    for (i = 0; i < mShareOpsMap.count(); ++i) {\n        if (mShareOpsMap[i].contains(opid)) {\n            j = i;\n            break;\n        }\n    }\n    if (j == -1) {\n        qDebug() << QString(\"Couldn't find the aggregate opid for %1 sharing opid %2 in ShareUploadProgress!\").arg(service->getServiceName(), opid);\n        return;\n    }\n    QList<QPair<int, int> >::iterator it;\n\n    for (it = mShareOpProgressMap[j].begin(); it != mShareOpProgressMap[j].end(); ++it) {\n\n        if ((*it).first == opid)\n            (*it).second = progress;\n        if ((*it).second != -1) {\n            count++;\n            totalProgress += (*it).second;\n        }\n    }\n\n    emit this->ShareProgress(service->getServiceName(), j, (count == 0 ? 0 : (int)(totalProgress\/count)), message);\n}\n\n\/\/End MeeGoUXSharingService methods\n\n\/\/Begin CollectionsAdaptor methods\n\nbool SwSharingService::Create(const QString &collection_name,\n                                 uint supported_types,\n                                 const QString &collection_parent,\n                                 SwParams extra_parameters)\n{\n    return mService->createColl(collection_name,\n                                (SwClientService::CollectionMediaTypes)supported_types,\n                                collection_parent,\n                                extra_parameters);\n}\n\nbool SwSharingService::GetList()\n{\n    return mService->getCollList();\n}\n\nbool SwSharingService::GetDetails(const QString &collection_id)\n{\n    return mService->getCollDetails(collection_id);\n}\n\nbool SwSharingService::GetSupportsCollections()\n{\n    return mService->hasCollections();\n}\n\n\/\/Private slots:\n\nvoid SwSharingService::onCollCreated(SwClientService *service,\n                                     const QString &collID,\n                                     bool error)\n{\n    Q_UNUSED(service);\n    emit this->CollectionCreated(collID, error);\n}\n\nvoid SwSharingService::onCollDetailsRetrieved(SwClientService *service,\n                                              const SwCollectionDetails &collDetails,\n                                              bool error)\n{\n    Q_UNUSED(service);\n    emit this->DetailsRetrieved(collDetails, error);\n}\n\nvoid SwSharingService::onCollListRetrieved(SwClientService *service,\n                                           const ArrayOfSwCollectionDetails &collList,\n                                           bool error)\n{\n    Q_UNUSED(service);\n    qDebug() << QString(\"SwSharingService::onCollListRetrieved, got %1 albums\").arg(collList.count());\n    emit this->ListRetrieved(collList, error);\n}\n\n\/\/End CollectionsAdaptor methods\n\n\n\n\n\n<commit_msg>Add debug output on failed item sharing<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 \t\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\/\n\n#include \"swsharingservice.h\"\n#include \"collections_adaptor.h\"\n#include <libsocialweb-qt\/swclientdbustypes.h>\n\n#include <QFile>\n#include <libsocialweb-qt\/swclientservice.h>\n#include <libsocialweb-qt\/swclientserviceconfig.h>\n\nSwSharingService::SwSharingService(SwClientService *swService,\n                                   MeeGoUXSharingServiceInfo serviceInfo,\n                                   QObject *parent) :\n    MeeGoUXSharingService(serviceInfo, parent),\n    mService(swService),\n    mShareID(0)\n{\n    qDebug() << QString(\"Starting up SwSharingService with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    connect(mService,\n            SIGNAL(PhotoUploadProgress(SwClientService*,int,int,QString)),\n            this,\n            SLOT(onShareUploadProgress(SwClientService*,int,int,QString)));\n    connect(mService,\n            SIGNAL(VideoUploadProgress(SwClientService*,int,int,QString)),\n            this,\n            SLOT(onShareUploadProgress(SwClientService*,int,int,QString)));\n\n\n    registerDataTypes();    \/\/lsw-qt DBUS data types\n\n    \/\/QDBusConnection::sessionBus().registerObject(GetDBusObjPath().append(\"\/Collections\"), this);\n    mCollections = new CollectionsAdaptor(this);\n\n    connect(mService,\n            SIGNAL(collCreated(SwClientService*,QString,bool)),\n            this,\n            SLOT(onCollCreated(SwClientService*,QString,bool)));\n    connect(mService,\n            SIGNAL(collDetailsRetrieved(SwClientService*,SwCollectionDetails,bool)),\n            this,\n            SLOT(onCollDetailsRetrieved(SwClientService*,SwCollectionDetails,bool)));\n    connect(mService,\n            SIGNAL(collListRetrieved(SwClientService*,ArrayOfSwCollectionDetails,bool)),\n            this,\n            SLOT(onCollListRetrieved(SwClientService*,ArrayOfSwCollectionDetails,bool)));\n\n\/*    connect(mService,\n            SIGNAL(AudioUploadProgress(SwClientService*,int,int,QString)),\n            this,\n            SLOT(onAudioUploadProgress(SwClientService*,int,int,QString)));*\/\n}\n\nSwSharingService::~SwSharingService()\n{\n}\n\n\/\/Begin MeeGoUXSharingService methods\n\nbool SwSharingService::CanShareType(const QString &sharetype)\n{\n    return (mServiceInfo.serviceTypes.contains(sharetype));\n}\n\nbool SwSharingService::CancelShare(int opid)\n{\n    Q_UNUSED(opid);\n    qDebug() << QString(\"Cannot cancel LSW sharing uploads!\");\n    return false;\n}\n\nuint SwSharingService::GetCredsState()\n{\n    qDebug() << QString(\"SwSharingService::GetCredsState with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->credsState();\n}\n\nQString SwSharingService::GetDisplayName()\n{\n    qDebug() << QString(\"SwSharingService::GetDisplayName with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->getDisplayName();\n}\n\nQString SwSharingService::GetIconPath()\n{\n    qDebug() << QString(\"SwSharingService::GetIconPath with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->getServiceConfig()->getIconPath();\n}\n\nbool SwSharingService::GetServiceAvailable()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceAvailable with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->isConfigured();\n}\n\nQString SwSharingService::GetServiceDesc()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceDesc with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mService->getServiceConfig()->getDescription();\n}\n\nQString SwSharingService::GetServiceName()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceName with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return mServiceInfo.serviceName;\n}\n\nQString SwSharingService::GetServiceStateText()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceStateText with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    \/\/TODO: make meaningful text based on service\/creds state\n    return QString(\"Blah\");\n}\n\nQString SwSharingService::GetServiceType()\n{\n    qDebug() << QString(\"SwSharingService::GetServiceType with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n    return tr(\"Web\");\n}\n\nQString SwSharingService::GetSettingsURI(const QString &platform,\n                                       const QString &product)\n{\n    QString retVal = \"\";\n\n    if (platform == \"MeeGo\") {\n        if (product == \"UX\") {\n            retVal = QString(\"meego-qml-launcher --opengl --app meego-ux-settings --fullscreen --cmd showPage --cdata \\\"Web\\ Accounts\\\" \");\n        } else {\n            qDebug() << QString(\"Invalid product in SwSharingService::GetSettingsURI: %1\").arg(product);\n        }\n    } else {\n        qDebug() << QString(\"Invalid platform in SwSharingService::GetSettingsURI: %1\").arg(platform);\n    }\n    return retVal;\n}\n\nQString SwSharingService::GetUIName(const QString &widgettype,\n                                  const QString &platform,\n                                  const QString &product,\n                                  const QString &sharetype,\n                                  uint sharecount)\n{\n    qDebug() << QString(\"SwSharingService::GetUIName with mServiceInfo.serviceName of %1!\").arg(mServiceInfo.serviceName);\n\n    \/\/No LSW support for audio yet...\n    if (sharetype == MEEGO_SHARE_TYPE_AUDIO)\n        return QString();\n\n    QString type;\n    QString mult;\n    if (widgettype == \"QML\") {\n        if (sharetype == MEEGO_SHARE_TYPE_IMAGE) {\n            type = \"image\";\n        } else if (sharetype == MEEGO_SHARE_TYPE_VIDEO) {\n            type = \"video\";\n        } else if (sharetype == MEEGO_SHARE_TYPE_AUDIO) {\n            type = \"audio\";\n        } else {\n            type = QString(sharetype).replace(QString(\"\/\"), QString(\"_\"));   \/\/Custom type support\n        }\n\n        mult = (sharecount > 1 ? \"multi\" : \"single\");\n        QString filename = QString(\"%1\/%2\/%3_%4_%5_%6_%7\").arg(QML_TARGET_BASE_PATH, \"socialweb\", mServiceInfo.serviceName, platform, product, type, mult);\n        \/\/If we don't have a file for this prodct\/platform\n        if (!QFile::exists(filename + \".qml\")) {\n            \/\/Try just this product\n            filename = QString(\"%1\/%2\/%3_%4_%5_%6\").arg(QML_TARGET_BASE_PATH, \"socialweb\", mServiceInfo.serviceName, platform, type, mult);\n            if (!QFile::exists(filename + \".qml\")) {\n                \/\/Otherwise, just return the standard one\n                filename = QString(\"%1\/%2\/%3_%4_%5\").arg(QML_TARGET_BASE_PATH, \"socialweb\", mServiceInfo.serviceName, type, mult);\n            }\n        }\n        return filename;\n\n    } else {\n        \/\/Handle other UI types here...\n        return QString();\n    }\n}\n\nint SwSharingService::Share(const QString &sharetype, ArrayOfShareItemStruct items, QString &errmessage)\n{\n    if (!CanShareType(sharetype)) {\n        errmessage = QString(\"Invalid share type %1!\").arg(sharetype);\n\treturn -1;\n    }\n    int i = -1;\n    if (items.count() < 1) {\n        errmessage = \"No items to share!\";\n        return -1;\n    }\n\n    foreach(ShareItemStruct sis, items) {\n        qDebug() << QString(\"Received file %1!\").arg(sis.shareURI);\n        qDebug() << sis.params;\n        \/\/LSW can't deal with \"file:\/\/\" URIs, so we trim it to a local file instead\n        if (sis.shareURI.startsWith(\"file:\/\/\", Qt::CaseInsensitive))\n            sis.shareURI = sis.shareURI.remove(0, 7);\n\n        if (sharetype == MEEGO_SHARE_TYPE_IMAGE) {\n            i = mService->uploadPhoto(sis.shareURI, sis.params);\n        } else if (sharetype == MEEGO_SHARE_TYPE_VIDEO) {\n            i = mService->uploadVideo(sis.shareURI, sis.params);\n        } else if (sharetype == MEEGO_SHARE_TYPE_AUDIO) {\n            \/\/No audio share type in LSW yet...\n        }\n        \/\/TODO: Figure out how to handle partial success, partial failure...\n        \/\/Maybe make Share return a QList< struct {sis.shareURI, shareID, message} > ?\n        if (i != -1) {\n            mShareOpsMap[mShareID].append(i);\n            mShareOpProgressMap[mShareID].append(QPair<int, int>(i, 0));\n        } else {\n            qDebug() << QString (\"Got %1 back from upload attempt\").arg(i);\n            return i;\n        }\n    }\n\n    return mShareID++;\n}\n\n\n\/\/Private slots:\n\nvoid SwSharingService::onShareUploadProgress(SwClientService *service, int opid, int progress, QString message)\n{\n    int i, j = -1;\n    int totalProgress = 0, count = 0;\n\n    for (i = 0; i < mShareOpsMap.count(); ++i) {\n        if (mShareOpsMap[i].contains(opid)) {\n            j = i;\n            break;\n        }\n    }\n    if (j == -1) {\n        qDebug() << QString(\"Couldn't find the aggregate opid for %1 sharing opid %2 in ShareUploadProgress!\").arg(service->getServiceName(), opid);\n        return;\n    }\n    QList<QPair<int, int> >::iterator it;\n\n    for (it = mShareOpProgressMap[j].begin(); it != mShareOpProgressMap[j].end(); ++it) {\n\n        if ((*it).first == opid)\n            (*it).second = progress;\n        if ((*it).second != -1) {\n            count++;\n            totalProgress += (*it).second;\n        }\n    }\n\n    emit this->ShareProgress(service->getServiceName(), j, (count == 0 ? 0 : (int)(totalProgress\/count)), message);\n}\n\n\/\/End MeeGoUXSharingService methods\n\n\/\/Begin CollectionsAdaptor methods\n\nbool SwSharingService::Create(const QString &collection_name,\n                                 uint supported_types,\n                                 const QString &collection_parent,\n                                 SwParams extra_parameters)\n{\n    return mService->createColl(collection_name,\n                                (SwClientService::CollectionMediaTypes)supported_types,\n                                collection_parent,\n                                extra_parameters);\n}\n\nbool SwSharingService::GetList()\n{\n    return mService->getCollList();\n}\n\nbool SwSharingService::GetDetails(const QString &collection_id)\n{\n    return mService->getCollDetails(collection_id);\n}\n\nbool SwSharingService::GetSupportsCollections()\n{\n    return mService->hasCollections();\n}\n\n\/\/Private slots:\n\nvoid SwSharingService::onCollCreated(SwClientService *service,\n                                     const QString &collID,\n                                     bool error)\n{\n    Q_UNUSED(service);\n    emit this->CollectionCreated(collID, error);\n}\n\nvoid SwSharingService::onCollDetailsRetrieved(SwClientService *service,\n                                              const SwCollectionDetails &collDetails,\n                                              bool error)\n{\n    Q_UNUSED(service);\n    emit this->DetailsRetrieved(collDetails, error);\n}\n\nvoid SwSharingService::onCollListRetrieved(SwClientService *service,\n                                           const ArrayOfSwCollectionDetails &collList,\n                                           bool error)\n{\n    Q_UNUSED(service);\n    qDebug() << QString(\"SwSharingService::onCollListRetrieved, got %1 albums\").arg(collList.count());\n    emit this->ListRetrieved(collList, error);\n}\n\n\/\/End CollectionsAdaptor methods\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <unordered_set>\n#include <vector>\n#include <cstdint>\n\n#include \"benchmark\/benchmark.h\"\n#include \"GenerateInput.hpp\"\n\nconstexpr std::size_t MAX_STRING_LEN = 8 << 14;\n\n\/\/ Benchmark when there is no match.\nstatic void BM_StringFindNoMatch(benchmark::State &state) {\n  std::string s1(state.range(0), '-');\n  std::string s2(8, '*');\n  while (state.KeepRunning())\n    benchmark::DoNotOptimize(s1.find(s2));\n}\nBENCHMARK(BM_StringFindNoMatch)->Range(10, MAX_STRING_LEN);\n\n\/\/ Benchmark when the string matches first time.\nstatic void BM_StringFindAllMatch(benchmark::State &state) {\n  std::string s1(MAX_STRING_LEN, '-');\n  std::string s2(state.range(0), '-');\n  while (state.KeepRunning())\n    benchmark::DoNotOptimize(s1.find(s2));\n}\nBENCHMARK(BM_StringFindAllMatch)->Range(1, MAX_STRING_LEN);\n\n\/\/ Benchmark when the string matches somewhere in the end.\nstatic void BM_StringFindMatch1(benchmark::State &state) {\n  std::string s1(MAX_STRING_LEN \/ 2, '*');\n  s1 += std::string(state.range(0), '-');\n  std::string s2(state.range(0), '-');\n  while (state.KeepRunning())\n    benchmark::DoNotOptimize(s1.find(s2));\n}\nBENCHMARK(BM_StringFindMatch1)->Range(1, MAX_STRING_LEN \/ 4);\n\n\/\/ Benchmark when the string matches somewhere from middle to the end.\nstatic void BM_StringFindMatch2(benchmark::State &state) {\n  std::string s1(MAX_STRING_LEN \/ 2, '*');\n  s1 += std::string(state.range(0), '-');\n  s1 += std::string(state.range(0), '*');\n  std::string s2(state.range(0), '-');\n  while (state.KeepRunning())\n    benchmark::DoNotOptimize(s1.find(s2));\n}\nBENCHMARK(BM_StringFindMatch2)->Range(1, MAX_STRING_LEN \/ 4);\n\nBENCHMARK_MAIN();\n<commit_msg>Add new string benchmarks<commit_after>#include <unordered_set>\n#include <vector>\n#include <cstdint>\n\n#include \"benchmark\/benchmark.h\"\n#include \"GenerateInput.hpp\"\n\nconstexpr std::size_t MAX_STRING_LEN = 8 << 14;\n\n\/\/ Benchmark when there is no match.\nstatic void BM_StringFindNoMatch(benchmark::State &state) {\n  std::string s1(state.range(0), '-');\n  std::string s2(8, '*');\n  while (state.KeepRunning())\n    benchmark::DoNotOptimize(s1.find(s2));\n}\nBENCHMARK(BM_StringFindNoMatch)->Range(10, MAX_STRING_LEN);\n\n\/\/ Benchmark when the string matches first time.\nstatic void BM_StringFindAllMatch(benchmark::State &state) {\n  std::string s1(MAX_STRING_LEN, '-');\n  std::string s2(state.range(0), '-');\n  while (state.KeepRunning())\n    benchmark::DoNotOptimize(s1.find(s2));\n}\nBENCHMARK(BM_StringFindAllMatch)->Range(1, MAX_STRING_LEN);\n\n\/\/ Benchmark when the string matches somewhere in the end.\nstatic void BM_StringFindMatch1(benchmark::State &state) {\n  std::string s1(MAX_STRING_LEN \/ 2, '*');\n  s1 += std::string(state.range(0), '-');\n  std::string s2(state.range(0), '-');\n  while (state.KeepRunning())\n    benchmark::DoNotOptimize(s1.find(s2));\n}\nBENCHMARK(BM_StringFindMatch1)->Range(1, MAX_STRING_LEN \/ 4);\n\n\/\/ Benchmark when the string matches somewhere from middle to the end.\nstatic void BM_StringFindMatch2(benchmark::State &state) {\n  std::string s1(MAX_STRING_LEN \/ 2, '*');\n  s1 += std::string(state.range(0), '-');\n  s1 += std::string(state.range(0), '*');\n  std::string s2(state.range(0), '-');\n  while (state.KeepRunning())\n    benchmark::DoNotOptimize(s1.find(s2));\n}\nBENCHMARK(BM_StringFindMatch2)->Range(1, MAX_STRING_LEN \/ 4);\n\nstatic void BM_StringCtorDefault(benchmark::State &state) {\n  while (state.KeepRunning()) {\n    for (unsigned I=0; I < 1000; ++I) {\n      std::string Default;\n      benchmark::DoNotOptimize(Default.c_str());\n    }\n  }\n}\nBENCHMARK(BM_StringCtorDefault);\n\nstatic void BM_StringCtorCStr(benchmark::State &state) {\n  std::string Input = getRandomString(state.range(0));\n  const char *Str = Input.c_str();\n  benchmark::DoNotOptimize(Str);\n  while (state.KeepRunning()) {\n    std::string Tmp(Str);\n    benchmark::DoNotOptimize(Tmp.c_str());\n  }\n}\nBENCHMARK(BM_StringCtorCStr)->Arg(1)->Arg(8)->Range(16, MAX_STRING_LEN \/ 4);\n\nBENCHMARK_MAIN();\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <El.hpp>\n#include <cmath>\n#include <iostream>\n\ninline void set_stream_precision(std::ofstream &ofs)\n{\n  ofs.precision(\n    std::ceil(El::gmp::Precision() * std::log(2.0) \/ std::log(10.0)));\n}\n<commit_msg>Use log10 and add offset in set_stream_precision<commit_after>#pragma once\n\n#include <El.hpp>\n#include <cmath>\n#include <iostream>\n\ninline void set_stream_precision(std::ostream &os)\n{\n  os.precision(std::ceil(El::gmp::Precision() * std::log10(2.0)) + 1);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>added template code<commit_after>\/*\n *  Lab 1 - Basic multiprogramming\n *\n *\tBy: Andrew Radlbeck & John Wood\n *\/\n#include <iostream>\nusing namespace std;\n\nint main(int argc, char * argv[])\n{\n\n\treturn 0;\n} <|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  dfa_single_regex.cpp\n\/\/  Parse\n\/\/\n\/\/  Created by Andrew Hunter on 28\/04\/2011.\n\/\/  Copyright 2011 __MyCompanyName__. All rights reserved.\n\/\/\n\n#include <string>\n#include <sstream>\n\n#include \"dfa_single_regex.h\"\n\n#include \"Dfa\/lexer.h\"\n\nusing namespace std;\nusing namespace dfa;\n\nvoid test_dfa_single_regex::test(std::string name, std::string regex, std::string accepting, std::string rejecting) {\n    \/\/ Create a lexer that accepts the regular expression\n    lexer myLexer;\n    myLexer.add_symbol(regex, 1);\n    \n    \/\/ Compile it\n    myLexer.compile(true);\n    \n    \/\/ Try the accepting phrase\n    stringstream acceptIn(accepting);\n    lexeme_stream* stream = myLexer.create_stream_from(acceptIn);\n    \n    \/\/ Get the first lexeme\n    lexeme* first;\n    (*stream) >> first;\n    delete stream;\n    \n    \/\/ Try the rejecting phrase\n    stringstream rejectIn(rejecting);\n    stream = myLexer.create_stream_from(rejectIn);\n    \n    lexeme* fail;\n    (*stream) >> fail;\n    \n    delete stream;\n\n    \/\/ first lexeme should be an accepting lexeme, second should be a rejection\n    if (first != NULL && fail != NULL && first->matched() == 1 && first->content<char>() == accepting && fail->matched() == -1 && fail->content().size() == 1) {\n        report(name, true);\n    } else {\n        \/\/ Break things down if we get a failure\n        report(name + \"-accept\", first != NULL && first->matched() == 1);\n        report(name + \"-content\", first != NULL && first->content<char>() == accepting);\n            \n        report(name + \"-reject\", fail != NULL && fail->matched() == -1);\n        report(name + \"-rejectone\", fail != NULL && fail->content().size() == 1);\n    }\n\n    delete first;\n    delete fail;\n}\n\nvoid test_dfa_single_regex::run_tests() {\n    test(\"basic\", \"a\", \"a\", \"b\");\n    test(\"sayaaaa\", \"a*\", \"aaaaa\", \"b\");\n    test(\"ababab\", \"(ab)+\", \"ababab\", \"aaaaaa\");\n    \n    test(\"a-or-b1\", \"a|b\", \"a\", \"c\");\n    test(\"a-or-b2\", \"a|b\", \"b\", \"c\");\n    test(\"a-or-b3\", \"a+|b+\", \"aaaaa\", \"c\");\n    test(\"a-or-b4\", \"a+|b+\", \"bbbbb\", \"c\");\n    test(\"a-or-b5\", \"a*|b*\", \"aaaaa\", \"c\");\n    test(\"a-or-b6\", \"a*|b*\", \"bbbbb\", \"c\");\n    test(\"a-or-b7\", \"(a*)|(b*)\", \"bbbbb\", \"c\");\n    test(\"a-or-b8\", \"(a+)|(b+)\", \"bbbbb\", \"c\");\n    \n    test(\"ab-or-cd1\", \"ab|cd\", \"ab\", \"a\");\n    test(\"ab-or-cd2\", \"ab|cd\", \"cd\", \"a\");\n    test(\"ab-or-cd3\", \"(ab)+|(cd)+\", \"ababab\", \"a\");\n    test(\"ab-or-cd4\", \"(ab)+|(cd)+\", \"cdcdcd\", \"c\");\n    test(\"ab-or-cd5\", \"(ab)+|((cd)+)\", \"cdcdcd\", \"c\");\n\n    test(\"ab-or-cd-or-ef1\", \"ab|cd|ef\", \"ab\", \"af\");\n    test(\"ab-or-cd-or-ef2\", \"ab|cd|ef\", \"cd\", \"c\");\n    test(\"ab-or-cd-or-ef3\", \"ab|cd|ef\", \"ef\", \"d\");\n\n    test(\"a-or-b-c1\", \"(a|b?)c\", \"ac\", \"a\");\n    test(\"a-or-b-c2\", \"(a|b?)c\", \"bc\", \"b\");\n    test(\"a-or-b-c3\", \"(a|b?)c\", \"c\", \"b\");\n}\n<commit_msg>Modified test to do both the 'full' and the 'compact' regular expressions<commit_after>\/\/\n\/\/  dfa_single_regex.cpp\n\/\/  Parse\n\/\/\n\/\/  Created by Andrew Hunter on 28\/04\/2011.\n\/\/  Copyright 2011 __MyCompanyName__. All rights reserved.\n\/\/\n\n#include <string>\n#include <sstream>\n\n#include \"dfa_single_regex.h\"\n\n#include \"Dfa\/lexer.h\"\n\nusing namespace std;\nusing namespace dfa;\n\nvoid test_dfa_single_regex::test(std::string name, std::string regex, std::string accepting, std::string rejecting) {\n    \/\/ Create a lexer that accepts the regular expression\n    lexer myLexer;\n    myLexer.add_symbol(regex, 1);\n    \n    lexer myCompactLexer;\n    myCompactLexer.add_symbol(regex, 1);\n    \n    \/\/ Compile it\n    myLexer.compile(false);\n    myCompactLexer.compile(true);\n    \n    \/\/ Try the accepting phrase\n    stringstream acceptIn(accepting);\n    lexeme_stream* stream = myLexer.create_stream_from(acceptIn);\n    \n    \/\/ Get the first lexeme\n    lexeme* first;\n    (*stream) >> first;\n    delete stream;\n    \n    \/\/ Try again with the compact lexer\n    stringstream acceptCompactIn(accepting);\n    stream = myCompactLexer.create_stream_from(acceptCompactIn);\n    \n    lexeme* firstCompact;\n    (*stream) >> firstCompact;\n    delete stream;\n    \n    \/\/ Try the rejecting phrase\n    stringstream rejectIn(rejecting);\n    stream = myLexer.create_stream_from(rejectIn);\n    \n    lexeme* fail;\n    (*stream) >> fail;\n    \n    delete stream;\n\n    \/\/ first lexeme should be an accepting lexeme, second should be a rejection\n    if (first != NULL && fail != NULL && first->matched() == 1 && first->content<char>() == accepting\n        && firstCompact != NULL && firstCompact->matched() == 1 && firstCompact->content<char>() == accepting\n        && fail != NULL && fail->matched() == -1 && fail->content().size() == 1) {\n        report(name, true);\n    } else {\n        \/\/ Break things down if we get a failure\n        report(name + \"-accept\", first != NULL && first->matched() == 1);\n        report(name + \"-content\", first != NULL && first->content<char>() == accepting);\n\n        report(name + \"-compact-accept\", firstCompact != NULL && firstCompact->matched() == 1);\n        report(name + \"-compact-content\", firstCompact != NULL && firstCompact->content<char>() == accepting);\n\n        report(name + \"-reject\", fail != NULL && fail->matched() == -1);\n        report(name + \"-rejectone\", fail != NULL && fail->content().size() == 1);\n    }\n\n    delete first;\n    delete firstCompact;\n    delete fail;\n}\n\nvoid test_dfa_single_regex::run_tests() {\n    test(\"basic\", \"a\", \"a\", \"b\");\n    test(\"sayaaaa\", \"a*\", \"aaaaa\", \"b\");\n    test(\"ababab\", \"(ab)+\", \"ababab\", \"aaaaaa\");\n    \n    test(\"a-or-b1\", \"a|b\", \"a\", \"c\");\n    test(\"a-or-b2\", \"a|b\", \"b\", \"c\");\n    test(\"a-or-b3\", \"a+|b+\", \"aaaaa\", \"c\");\n    test(\"a-or-b4\", \"a+|b+\", \"bbbbb\", \"c\");\n    test(\"a-or-b5\", \"a*|b*\", \"aaaaa\", \"c\");\n    test(\"a-or-b6\", \"a*|b*\", \"bbbbb\", \"c\");\n    test(\"a-or-b7\", \"(a*)|(b*)\", \"bbbbb\", \"c\");\n    test(\"a-or-b8\", \"(a+)|(b+)\", \"bbbbb\", \"c\");\n    \n    test(\"ab-or-cd1\", \"ab|cd\", \"ab\", \"a\");\n    test(\"ab-or-cd2\", \"ab|cd\", \"cd\", \"a\");\n    test(\"ab-or-cd3\", \"(ab)+|(cd)+\", \"ababab\", \"a\");\n    test(\"ab-or-cd4\", \"(ab)+|(cd)+\", \"cdcdcd\", \"c\");\n    test(\"ab-or-cd5\", \"(ab)+|((cd)+)\", \"cdcdcd\", \"c\");\n\n    test(\"ab-or-cd-or-ef1\", \"ab|cd|ef\", \"ab\", \"af\");\n    test(\"ab-or-cd-or-ef2\", \"ab|cd|ef\", \"cd\", \"c\");\n    test(\"ab-or-cd-or-ef3\", \"ab|cd|ef\", \"ef\", \"d\");\n\n    test(\"a-or-b-c1\", \"(a|b?)c\", \"ac\", \"a\");\n    test(\"a-or-b-c2\", \"(a|b?)c\", \"bc\", \"b\");\n    test(\"a-or-b-c3\", \"(a|b?)c\", \"c\", \"b\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/      \"obj_egg.cc\" - Procedures for eggs.  Derived from obj_food.cc\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <cmath>\n\n#include \"stdsneezy.h\"\n#include \"obj_food.h\"\n#include \"obj_egg.h\"\n\nTEgg::TEgg() :\n  TFood(),\n  touched(0),\n  incubationTimer(0),\n  mobVNum(0)\n{\n}\n\nTEgg::TEgg(const TEgg &a) :\n  TFood(a),\n  touched(a.touched),\n  incubationTimer(a.incubationTimer),\n  mobVNum(a.mobVNum)\n{\n}\n\nTEgg & TEgg::operator=(const TEgg &a)\n{\n  if (this == &a) return *this;\n  TFood::operator=(a);\n  touched = a.touched;\n  incubationTimer = a.incubationTimer;\n  mobVNum = a.mobVNum;\n  return *this;\n}\n\nTEgg::~TEgg()\n{\n}\n\nvoid eggPoisoned(TEgg *egg, TBeing *ch, int dur)\n{\n  affectedData af;\n\n  if (egg->isFoodFlag(FOOD_POISON) && \n      !ch->isAffected(AFF_POISON)) {\n    if (ch->isImmune(IMMUNE_POISON, (dur * 10 + 20))) {\n      act(\"That tasted rather strange, but you don't think it had any ill-effect!!\", FALSE, ch, 0, 0, TO_CHAR);\n    } else {\n      act(\"That tasted rather strange !!\", FALSE, ch, 0, 0, TO_CHAR);\n      act(\"$n coughs and utters some strange sounds.\", FALSE, ch, 0, 0, TO_ROOM);\n      af.type = SPELL_POISON;\n      af.duration = dur * UPDATES_PER_MUDHOUR;\n      af.modifier = 0;\n      af.location = APPLY_NONE;\n      af.bitvector = AFF_POISON;\n      ch->affectJoin(NULL, &af, AVG_DUR_NO, AVG_EFF_NO);\n    }\n  }\n}\n\nvoid eggSpoiled(TEgg *egg, TBeing *ch, int dur)\n{\n  affectedData af;\n\n  if (egg->isFoodFlag(FOOD_SPOILED)) {\n    if (ch->isImmune(IMMUNE_POISON, (dur * 10 + 5))) {\n      ch->sendTo(\"BLAH!  That was a very rotten egg.  Hopefully you won't have any ill-effect.\\n\\r\");\n    } else {\n      af.type = AFFECT_DISEASE;\n      af.level = 0;\n     \/\/ Added \/4 because of player complaints of food poisoning - Russ 04\/28\/96\n      af.duration = dur * UPDATES_PER_MUDHOUR;\n      af.modifier = DISEASE_FOODPOISON;\n      af.location = APPLY_NONE;\n      af.bitvector = 0;\n      ch->affectTo(&af);\n      disease_start(ch, &af);\n    }\n  }\n}\n\nvoid TEgg::eatMe(TBeing *ch)\n{\n  if ((ch->getCond(FULL) > 20) && !ch->isImmortal()) {\n    ch->sendTo(\"You try to stuff another egg food into your mouth, but alas, you are full!\\n\\r\");\n    return;\n  }\n  if (isFoodFlag(FOOD_SPOILED) && ch->isPerceptive()) {\n    act(\"You gag at the smell of $p and discard it instead.\", TRUE, ch, this, 0, TO_CHAR);\n    act(\"$n gags at the smell of $p and throws it out.\", TRUE, ch, this, 0, TO_ROOM);\n\n    ch->playsound(SOUND_FOODPOISON, SOUND_TYPE_NOISE);\n\n    delete this;\n    return;\n  }\n\n  act(\"$n eats $p.\", TRUE, ch, this, 0, TO_ROOM);\n  act(\"You eat the $o.\", FALSE, ch, this, 0, TO_CHAR);\n\n  if(ch->isVampire()){\n    ch->sendTo(\"You eat the mortal food, but it has no affect on you.\\n\\r\");\n  } else {\n    if (ch->getCond(FULL) > -1)\n      ch->gainCondition(FULL, TFood::getFoodFill());\n  }    \n\n  if (ch->getCond(FULL) > 20)\n    act(\"You are full.\", FALSE, ch, 0, 0, TO_CHAR);\n\n  if (!ch->isImmortal()) {\n    eggPoisoned(this, ch, getFoodFill());\n    eggSpoiled(this, ch, getFoodFill());\n  }\n  delete this;\n}\n\nvoid TEgg::tasteMe(TBeing *ch)\n{\n  if (ch->hasDisease(DISEASE_FOODPOISON)) {\n    ch->sendTo(\"Uggh, your stomach feels just horrible and the thought of eggs nauseates you.\\n\\r\");\n    ch->sendTo(\"You decide to skip this meal until you feel better.\\n\\r\");\n    return;\n  }\n  act(\"$n tastes the $o.\", FALSE, ch, this, 0, TO_ROOM);\n  act(\"You taste the $o.\", FALSE, ch, this, 0, TO_CHAR);\n\n  if(ch->isVampire()){\n    ch->sendTo(\"You eat the mortal food, but it has no affect on you.\\n\\r\");\n  } else {\n    ch->gainCondition(FULL, 1);\n  }\n\n  if (ch->getCond(FULL) > 20)\n    act(\"You are full.\", FALSE, ch, 0, 0, TO_CHAR);\n\n  if (!ch->isImmortal()) {\n    eggPoisoned(this, ch, 1);\n  }\n  if (isFoodFlag(FOOD_SPOILED)) {\n    ch->sendTo(\"Blah, that egg is spoiled!\\n\\r\");\n    ch->sendTo(\"No point in keeping it around now...\\n\\r\");\n    delete this;\n    return;\n  }\n\n  \/\/ we filled them \"1 unit\"\n  \/\/ let's actually remove \"1+ unit\" so that we insure that taste isn't\n  \/\/ better at filling than outright eating\n  setFoodFill(getFoodFill() - 2);\n\n  if (getFoodFill() <= 0) {    \/* Nothing left *\/\n    act(\"There is nothing left now.\", FALSE, ch, 0, 0, TO_CHAR);\n    delete this;\n    return;\n  }\n  return;\n}\n\nbool TEgg::getEggTouched() const\n{\n  return touched;\n}\n\nvoid TEgg::setEggTouched(bool r)\n{\n  touched = r;\n}\n\nint TEgg::getEggTimer() const\n{\n  return incubationTimer;\n}\n\nvoid TEgg::setEggTimer(int r)\n{\n  incubationTimer = r;\n}\n\nint TEgg::getEggMobVNum() const\n{\n  return mobVNum;\n}\n\nvoid TEgg::setEggMobVNum(int r)\n{\n  mobVNum = r;\n}\n\nvoid TEgg::lowCheck()\n{\n  TFood::lowCheck();\n}\n\nsstring TEgg::statObjInfo() const\n{\n  char buf[256];\n\n  sprintf(buf, \"Makes full : %d\\n\\rPoisoned : %d\\n\\rIncubation timer : %d\\n\\rMob vnum : %d\\n\\rTouched : %d\",\n    getFoodFill(), getFoodFlags(), getEggTimer(), getEggMobVNum(),\n    getEggTouched());\n\n  sstring a(buf);\n  return a;\n}\n\nvoid TEgg::assignFourValues(int x1, int x2, int x3, int x4)\n{\n  TFood::assignFourValues(x1, x2, x3, x4);\n\n  setEggTouched(GET_BITS(x1, 31, 1));\n  setEggTimer(x2);\n  setEggMobVNum(x3);\n}\n\nvoid TEgg::getFourValues(int *x1, int *x2, int *x3, int *x4) const\n{\n  TFood::getFourValues(x1, x2, x3, x4);\n\n  int r = *x1;\n  SET_BITS(r, 31, 1, getEggTouched());\n  *x1 = r;\n\n  *x2 = getEggTimer();\n  *x3 = getEggMobVNum();\n}\n\nsstring TEgg::displayFourValues()\n{\n  char tString[256];\n  int x1, x2, x3, x4;\n\n  getFourValues(&x1, &x2, &x3, &x4);\n  sprintf(tString, \"Current values : %d %d %d %d\\n\\r\", x1, x2, x3, x4);\n\n  sprintf(tString + strlen(tString),\n          \"Current values : Touched[%d] Food Fill[%d]\\n\\r\\\nIncubation Timer[%d] Mob VNum[%d] Food Flags[%d]\",\n          getEggTouched(), getFoodFill(), getEggTimer(), getEggMobVNum(),\n          getFoodFlags());\n\n  return tString;\n}\n\nvoid TEgg::changeObjValue1(TBeing *ch)\n{\n  ch->specials.edit = CHANGE_EGG_VALUE1;\n  change_egg_value1(ch, this, \"\", ENTER_CHECK);\n  return;\n}\n\nint TEgg::chiMe(TBeing *tLunatic)\n{\n  int tMana  = ::number(10, 30),\n      bKnown = tLunatic->getSkillLevel(SKILL_CHI);\n\n  if (tLunatic->getMana() < tMana) {\n    tLunatic->sendTo(\"You lack the chi to do this.\\n\\r\");\n    return RET_STOP_PARSING;\n  } else\n    tLunatic->reconcileMana(TYPE_UNDEFINED, 0, tMana);\n\n  if (!bSuccess(tLunatic, bKnown, SKILL_CHI) || isFoodFlag(FOOD_SPOILED)) {\n    act(\"You fail to affect $p in any way.\",\n        FALSE, tLunatic, this, NULL, TO_CHAR);\n    return true;\n  }\n\n  act(\"You focus your chi, causing $p to get warmer!\",\n      FALSE, tLunatic, this, NULL, TO_CHAR);\n  act(\"$n stares at $p, causing it to get warmer!\",\n      TRUE, tLunatic, this, NULL, TO_ROOM);\n  act(\"$p begins to wiggle a bit.\",\n      TRUE, tLunatic, this, NULL, TO_CHAR);\n  act(\"$p begins to wiggle a bit.\",\n      TRUE, tLunatic, this, NULL, TO_ROOM);\n\n  obj_flags.decay_time += ::number(1, 3);\n  incubationTimer = 1;\n\n  return true;\n}\n\nint TEgg::getMe(TBeing *ch, TThing *sub)\n{\n  \/\/ do baseclass stuff\n  int rc = TObj::getMe(ch, sub);\n  if (rc)\n    return rc;\n\n  touched=TRUE;\n\n  return TRUE;\n}\n\nvoid TEgg::hatch(TRoom *rp)\n{\n  TMonster *mob;\n  TBeing *ch;\n  affectedData aff;\n\n  if (!(mob = read_mobile(mobVNum, VIRTUAL))) {\n    vlogf(LOG_BUG, \"Problem loading monster in TEgg::hatch\");\n    return;\n  }\n\n  *rp += *mob;\n  mob->oldRoom = inRoom();\n  act(\"Suddenly, $p begins to move violently from within!\",\n    TRUE, mob, this, NULL, TO_ROOM);\n  act(\"With a final push, $n emerges from $p!\",\n    TRUE, mob, this, NULL, TO_ROOM);\n\n  if(!mob->isAffected(AFF_AGGRESSOR) && parent && \n     (ch=dynamic_cast<TBeing *>(parent)) && ch->isPc() &&\n     mob->GetMaxLevel() < ch->GetMaxLevel() && \n     !ch->tooManyFollowers(mob, FOL_PET)){\n    \/\/ this code was cut and pasted from the pet buying code, sorry :(\n    mob->doAction(ch->name, CMD_STARE);\n\n    SET_BIT(mob->specials.affectedBy, AFF_CHARM);\n    ch->addFollower(mob);\n    mob->balanceMakeNPCLikePC();\n    \n    aff.type = AFFECT_PET;\n    aff.level = 0;\n    aff.duration  = PERMANENT_DURATION;\n    aff.location = APPLY_NONE;\n    aff.modifier = 0;   \/\/ to be used for elemental skill level\n    aff.bitvector = 0;\n\n    char * tmp = mud_str_dup(ch->name);\n    aff.be = (TThing *) tmp;\n\n    mob->affectTo(&aff, -1);\n  } \n}\n\nint TEgg::eggIncubate()\n{\n  return --incubationTimer;\n}\n<commit_msg>fixed typo<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/      \"obj_egg.cc\" - Procedures for eggs.  Derived from obj_food.cc\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <cmath>\n\n#include \"stdsneezy.h\"\n#include \"obj_food.h\"\n#include \"obj_egg.h\"\n\nTEgg::TEgg() :\n  TFood(),\n  touched(0),\n  incubationTimer(0),\n  mobVNum(0)\n{\n}\n\nTEgg::TEgg(const TEgg &a) :\n  TFood(a),\n  touched(a.touched),\n  incubationTimer(a.incubationTimer),\n  mobVNum(a.mobVNum)\n{\n}\n\nTEgg & TEgg::operator=(const TEgg &a)\n{\n  if (this == &a) return *this;\n  TFood::operator=(a);\n  touched = a.touched;\n  incubationTimer = a.incubationTimer;\n  mobVNum = a.mobVNum;\n  return *this;\n}\n\nTEgg::~TEgg()\n{\n}\n\nvoid eggPoisoned(TEgg *egg, TBeing *ch, int dur)\n{\n  affectedData af;\n\n  if (egg->isFoodFlag(FOOD_POISON) && \n      !ch->isAffected(AFF_POISON)) {\n    if (ch->isImmune(IMMUNE_POISON, (dur * 10 + 20))) {\n      act(\"That tasted rather strange, but you don't think it had any ill-effect!!\", FALSE, ch, 0, 0, TO_CHAR);\n    } else {\n      act(\"That tasted rather strange !!\", FALSE, ch, 0, 0, TO_CHAR);\n      act(\"$n coughs and utters some strange sounds.\", FALSE, ch, 0, 0, TO_ROOM);\n      af.type = SPELL_POISON;\n      af.duration = dur * UPDATES_PER_MUDHOUR;\n      af.modifier = 0;\n      af.location = APPLY_NONE;\n      af.bitvector = AFF_POISON;\n      ch->affectJoin(NULL, &af, AVG_DUR_NO, AVG_EFF_NO);\n    }\n  }\n}\n\nvoid eggSpoiled(TEgg *egg, TBeing *ch, int dur)\n{\n  affectedData af;\n\n  if (egg->isFoodFlag(FOOD_SPOILED)) {\n    if (ch->isImmune(IMMUNE_POISON, (dur * 10 + 5))) {\n      ch->sendTo(\"BLAH!  That was a very rotten egg.  Hopefully you won't have any ill-effect.\\n\\r\");\n    } else {\n      af.type = AFFECT_DISEASE;\n      af.level = 0;\n     \/\/ Added \/4 because of player complaints of food poisoning - Russ 04\/28\/96\n      af.duration = dur * UPDATES_PER_MUDHOUR;\n      af.modifier = DISEASE_FOODPOISON;\n      af.location = APPLY_NONE;\n      af.bitvector = 0;\n      ch->affectTo(&af);\n      disease_start(ch, &af);\n    }\n  }\n}\n\nvoid TEgg::eatMe(TBeing *ch)\n{\n  if ((ch->getCond(FULL) > 20) && !ch->isImmortal()) {\n    ch->sendTo(\"You try to stuff another egg food into your mouth, but alas, you are full!\\n\\r\");\n    return;\n  }\n  if (isFoodFlag(FOOD_SPOILED) && ch->isPerceptive()) {\n    act(\"You gag at the smell of $p and discard it instead.\", TRUE, ch, this, 0, TO_CHAR);\n    act(\"$n gags at the smell of $p and throws it out.\", TRUE, ch, this, 0, TO_ROOM);\n\n    ch->playsound(SOUND_FOODPOISON, SOUND_TYPE_NOISE);\n\n    delete this;\n    return;\n  }\n\n  act(\"$n eats $p.\", TRUE, ch, this, 0, TO_ROOM);\n  act(\"You eat the $o.\", FALSE, ch, this, 0, TO_CHAR);\n\n  if(ch->isVampire()){\n    ch->sendTo(\"You eat the mortal food, but it has no affect on you.\\n\\r\");\n  } else {\n    if (ch->getCond(FULL) > -1)\n      ch->gainCondition(FULL, TFood::getFoodFill());\n  }    \n\n  if (ch->getCond(FULL) > 20)\n    act(\"You are full.\", FALSE, ch, 0, 0, TO_CHAR);\n\n  if (!ch->isImmortal()) {\n    eggPoisoned(this, ch, getFoodFill());\n    eggSpoiled(this, ch, getFoodFill());\n  }\n  delete this;\n}\n\nvoid TEgg::tasteMe(TBeing *ch)\n{\n  if (ch->hasDisease(DISEASE_FOODPOISON)) {\n    ch->sendTo(\"Uggh, your stomach feels just horrible and the thought of eggs nauseates you.\\n\\r\");\n    ch->sendTo(\"You decide to skip this meal until you feel better.\\n\\r\");\n    return;\n  }\n  act(\"$n tastes the $o.\", FALSE, ch, this, 0, TO_ROOM);\n  act(\"You taste the $o.\", FALSE, ch, this, 0, TO_CHAR);\n\n  if(ch->isVampire()){\n    ch->sendTo(\"You eat the mortal food, but it has no affect on you.\\n\\r\");\n  } else {\n    ch->gainCondition(FULL, 1);\n  }\n\n  if (ch->getCond(FULL) > 20)\n    act(\"You are full.\", FALSE, ch, 0, 0, TO_CHAR);\n\n  if (!ch->isImmortal()) {\n    eggPoisoned(this, ch, 1);\n  }\n  if (isFoodFlag(FOOD_SPOILED)) {\n    ch->sendTo(\"Blah, that egg is spoiled!\\n\\r\");\n    ch->sendTo(\"No point in keeping it around now...\\n\\r\");\n    delete this;\n    return;\n  }\n\n  \/\/ we filled them \"1 unit\"\n  \/\/ let's actually remove \"1+ unit\" so that we insure that taste isn't\n  \/\/ better at filling than outright eating\n  setFoodFill(getFoodFill() - 2);\n\n  if (getFoodFill() <= 0) {    \/* Nothing left *\/\n    act(\"There is nothing left now.\", FALSE, ch, 0, 0, TO_CHAR);\n    delete this;\n    return;\n  }\n  return;\n}\n\nbool TEgg::getEggTouched() const\n{\n  return touched;\n}\n\nvoid TEgg::setEggTouched(bool r)\n{\n  touched = r;\n}\n\nint TEgg::getEggTimer() const\n{\n  return incubationTimer;\n}\n\nvoid TEgg::setEggTimer(int r)\n{\n  incubationTimer = r;\n}\n\nint TEgg::getEggMobVNum() const\n{\n  return mobVNum;\n}\n\nvoid TEgg::setEggMobVNum(int r)\n{\n  mobVNum = r;\n}\n\nvoid TEgg::lowCheck()\n{\n  TFood::lowCheck();\n}\n\nsstring TEgg::statObjInfo() const\n{\n  char buf[256];\n\n  sprintf(buf, \"Makes full : %d\\n\\rPoisoned : %d\\n\\rIncubation timer : %d\\n\\rMob vnum : %d\\n\\rTouched : %d\",\n    getFoodFill(), getFoodFlags(), getEggTimer(), getEggMobVNum(),\n    getEggTouched());\n\n  sstring a(buf);\n  return a;\n}\n\nvoid TEgg::assignFourValues(int x1, int x2, int x3, int x4)\n{\n  TFood::assignFourValues(x1, x2, x3, x4);\n\n  setEggTouched(GET_BITS(x1, 31, 1));\n  setEggTimer(x2);\n  setEggMobVNum(x3);\n}\n\nvoid TEgg::getFourValues(int *x1, int *x2, int *x3, int *x4) const\n{\n  TFood::getFourValues(x1, x2, x3, x4);\n\n  int r = *x1;\n  SET_BITS(r, 31, 1, getEggTouched());\n  *x1 = r;\n\n  *x2 = getEggTimer();\n  *x3 = getEggMobVNum();\n}\n\nsstring TEgg::displayFourValues()\n{\n  char tString[256];\n  int x1, x2, x3, x4;\n\n  getFourValues(&x1, &x2, &x3, &x4);\n  sprintf(tString, \"Current values : %d %d %d %d\\n\\r\", x1, x2, x3, x4);\n\n  sprintf(tString + strlen(tString),\n          \"Current values : Touched[%d] Food Fill[%d]\\n\\r\\\nIncubation Timer[%d] Mob VNum[%d] Food Flags[%d]\",\n          getEggTouched(), getFoodFill(), getEggTimer(), getEggMobVNum(),\n          getFoodFlags());\n\n  return tString;\n}\n\nvoid TEgg::changeObjValue1(TBeing *ch)\n{\n  ch->specials.edit = CHANGE_EGG_VALUE1;\n  change_egg_value1(ch, this, \"\", ENTER_CHECK);\n  return;\n}\n\nint TEgg::chiMe(TBeing *tLunatic)\n{\n  int tMana  = ::number(10, 30),\n      bKnown = tLunatic->getSkillLevel(SKILL_CHI);\n\n  if (tLunatic->getMana() < tMana) {\n    tLunatic->sendTo(\"You lack the chi to do this.\\n\\r\");\n    return RET_STOP_PARSING;\n  } else\n    tLunatic->reconcileMana(TYPE_UNDEFINED, 0, tMana);\n\n  if (!bSuccess(tLunatic, bKnown, SKILL_CHI) || isFoodFlag(FOOD_SPOILED)) {\n    act(\"You fail to affect $p in any way.\",\n        FALSE, tLunatic, this, NULL, TO_CHAR);\n    return true;\n  }\n\n  act(\"You focus your chi, causing $p to get warmer!\",\n      FALSE, tLunatic, this, NULL, TO_CHAR);\n  act(\"$n stares at $p, causing it to get warmer!\",\n      TRUE, tLunatic, this, NULL, TO_ROOM);\n  act(\"$p begins to wiggle a bit.\",\n      TRUE, tLunatic, this, NULL, TO_CHAR);\n  act(\"$p begins to wiggle a bit.\",\n      TRUE, tLunatic, this, NULL, TO_ROOM);\n\n  obj_flags.decay_time += ::number(1, 3);\n  incubationTimer = 1;\n\n  return true;\n}\n\nint TEgg::getMe(TBeing *ch, TThing *sub)\n{\n  \/\/ do baseclass stuff\n  int rc = TObj::getMe(ch, sub);\n  if (rc)\n    return rc;\n\n  touched=TRUE;\n\n  return TRUE;\n}\n\nvoid TEgg::hatch(TRoom *rp)\n{\n  TMonster *mob;\n  TBeing *ch;\n  affectedData aff;\n\n  if (!(mob = read_mobile(mobVNum, VIRTUAL))) {\n    vlogf(LOG_BUG, \"Problem loading monster in TEgg::hatch\");\n    return;\n  }\n\n  *rp += *mob;\n  mob->oldRoom = inRoom();\n  act(\"Suddenly, $p begins to move violently from within!\",\n    TRUE, mob, this, NULL, TO_ROOM);\n  act(\"With a final push, $n emerges from $p!\",\n    TRUE, mob, this, NULL, TO_ROOM);\n\n  if(!mob->isAffected(AFF_AGGRESSIVE) && parent && \n     (ch=dynamic_cast<TBeing *>(parent)) && ch->isPc() &&\n     mob->GetMaxLevel() < ch->GetMaxLevel() && \n     !ch->tooManyFollowers(mob, FOL_PET)){\n    \/\/ this code was cut and pasted from the pet buying code, sorry :(\n    mob->doAction(ch->name, CMD_STARE);\n\n    SET_BIT(mob->specials.affectedBy, AFF_CHARM);\n    ch->addFollower(mob);\n    mob->balanceMakeNPCLikePC();\n    \n    aff.type = AFFECT_PET;\n    aff.level = 0;\n    aff.duration  = PERMANENT_DURATION;\n    aff.location = APPLY_NONE;\n    aff.modifier = 0;   \/\/ to be used for elemental skill level\n    aff.bitvector = 0;\n\n    char * tmp = mud_str_dup(ch->name);\n    aff.be = (TThing *) tmp;\n\n    mob->affectTo(&aff, -1);\n  } \n}\n\nint TEgg::eggIncubate()\n{\n  return --incubationTimer;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012-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 <bench\/bench.h>\n#include <wallet\/wallet.h>\n#include <wallet\/coinselection.h>\n\n#include <set>\n\nstatic void addCoin(const CAmount& nValue, const CWallet& wallet, std::vector<OutputGroup>& groups)\n{\n    int nInput = 0;\n\n    static int nextLockTime = 0;\n    CMutableTransaction tx;\n    tx.nLockTime = nextLockTime++; \/\/ so all transactions get different hashes\n    tx.vout.resize(nInput + 1);\n    tx.vout[nInput].nValue = nValue;\n    CWalletTx* wtx = new CWalletTx(&wallet, MakeTransactionRef(std::move(tx)));\n\n    int nAge = 6 * 24;\n    COutput output(wtx, nInput, nAge, true \/* spendable *\/, true \/* solvable *\/, true \/* safe *\/);\n    groups.emplace_back(output.GetInputCoin(), 0, false, 0, 0);\n}\n\n\/\/ Simple benchmark for wallet coin selection. Note that it maybe be necessary\n\/\/ to build up more complicated scenarios in order to get meaningful\n\/\/ measurements of performance. From laanwj, \"Wallet coin selection is probably\n\/\/ the hardest, as you need a wider selection of scenarios, just testing the\n\/\/ same one over and over isn't too useful. Generating random isn't useful\n\/\/ either for measurements.\"\n\/\/ (https:\/\/github.com\/bitcoin\/bitcoin\/issues\/7883#issuecomment-224807484)\nstatic void CoinSelection(benchmark::State& state)\n{\n    const CWallet wallet(\"dummy\", WalletDatabase::CreateDummy());\n    LOCK(wallet.cs_wallet);\n\n    \/\/ Add coins.\n    std::vector<OutputGroup> groups;\n    for (int i = 0; i < 1000; ++i) {\n        addCoin(1000 * COIN, wallet, groups);\n    }\n    addCoin(3 * COIN, wallet, groups);\n\n    const CoinEligibilityFilter filter_standard(1, 6, 0);\n    const CoinSelectionParams coin_selection_params(true, 34, 148, CFeeRate(0), 0);\n    while (state.KeepRunning()) {\n        std::set<CInputCoin> setCoinsRet;\n        CAmount nValueRet;\n        bool bnb_used;\n        bool success = wallet.SelectCoinsMinConf(1003 * COIN, filter_standard, groups, setCoinsRet, nValueRet, coin_selection_params, bnb_used);\n        assert(success);\n        assert(nValueRet == 1003 * COIN);\n        assert(setCoinsRet.size() == 2);\n    }\n}\n\ntypedef std::set<CInputCoin> CoinSet;\nstatic const CWallet testWallet(\"dummy\", WalletDatabase::CreateDummy());\nstd::vector<std::unique_ptr<CWalletTx>> wtxn;\n\n\/\/ Copied from src\/wallet\/test\/coinselector_tests.cpp\nstatic void add_coin(const CAmount& nValue, int nInput, std::vector<OutputGroup>& set)\n{\n    CMutableTransaction tx;\n    tx.vout.resize(nInput + 1);\n    tx.vout[nInput].nValue = nValue;\n    std::unique_ptr<CWalletTx> wtx(new CWalletTx(&testWallet, MakeTransactionRef(std::move(tx))));\n    set.emplace_back(COutput(wtx.get(), nInput, 0, true, true, true).GetInputCoin(), 0, true, 0, 0);\n    wtxn.emplace_back(std::move(wtx));\n}\n\/\/ Copied from src\/wallet\/test\/coinselector_tests.cpp\nstatic CAmount make_hard_case(int utxos, std::vector<OutputGroup>& utxo_pool)\n{\n    utxo_pool.clear();\n    CAmount target = 0;\n    for (int i = 0; i < utxos; ++i) {\n        target += (CAmount)1 << (utxos+i);\n        add_coin((CAmount)1 << (utxos+i), 2*i, utxo_pool);\n        add_coin(((CAmount)1 << (utxos+i)) + ((CAmount)1 << (utxos-1-i)), 2*i + 1, utxo_pool);\n    }\n    return target;\n}\n\nstatic void BnBExhaustion(benchmark::State& state)\n{\n    \/\/ Setup\n    std::vector<OutputGroup> utxo_pool;\n    CoinSet selection;\n    CAmount value_ret = 0;\n    CAmount not_input_fees = 0;\n\n    while (state.KeepRunning()) {\n        \/\/ Benchmark\n        CAmount target = make_hard_case(17, utxo_pool);\n        SelectCoinsBnB(utxo_pool, target, 0, selection, value_ret, not_input_fees); \/\/ Should exhaust\n\n        \/\/ Cleanup\n        utxo_pool.clear();\n        selection.clear();\n    }\n}\n\nBENCHMARK(CoinSelection, 650);\nBENCHMARK(BnBExhaustion, 650);\n<commit_msg>bench: Make CoinSelection output groups pass eligibility filter<commit_after>\/\/ Copyright (c) 2012-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 <bench\/bench.h>\n#include <wallet\/wallet.h>\n#include <wallet\/coinselection.h>\n\n#include <set>\n\nstatic void addCoin(const CAmount& nValue, const CWallet& wallet, std::vector<OutputGroup>& groups)\n{\n    int nInput = 0;\n\n    static int nextLockTime = 0;\n    CMutableTransaction tx;\n    tx.nLockTime = nextLockTime++; \/\/ so all transactions get different hashes\n    tx.vout.resize(nInput + 1);\n    tx.vout[nInput].nValue = nValue;\n    CWalletTx* wtx = new CWalletTx(&wallet, MakeTransactionRef(std::move(tx)));\n\n    int nAge = 6 * 24;\n    COutput output(wtx, nInput, nAge, true \/* spendable *\/, true \/* solvable *\/, true \/* safe *\/);\n    groups.emplace_back(output.GetInputCoin(), 6, false, 0, 0);\n}\n\n\/\/ Simple benchmark for wallet coin selection. Note that it maybe be necessary\n\/\/ to build up more complicated scenarios in order to get meaningful\n\/\/ measurements of performance. From laanwj, \"Wallet coin selection is probably\n\/\/ the hardest, as you need a wider selection of scenarios, just testing the\n\/\/ same one over and over isn't too useful. Generating random isn't useful\n\/\/ either for measurements.\"\n\/\/ (https:\/\/github.com\/bitcoin\/bitcoin\/issues\/7883#issuecomment-224807484)\nstatic void CoinSelection(benchmark::State& state)\n{\n    const CWallet wallet(\"dummy\", WalletDatabase::CreateDummy());\n    LOCK(wallet.cs_wallet);\n\n    \/\/ Add coins.\n    std::vector<OutputGroup> groups;\n    for (int i = 0; i < 1000; ++i) {\n        addCoin(1000 * COIN, wallet, groups);\n    }\n    addCoin(3 * COIN, wallet, groups);\n\n    const CoinEligibilityFilter filter_standard(1, 6, 0);\n    const CoinSelectionParams coin_selection_params(true, 34, 148, CFeeRate(0), 0);\n    while (state.KeepRunning()) {\n        std::set<CInputCoin> setCoinsRet;\n        CAmount nValueRet;\n        bool bnb_used;\n        bool success = wallet.SelectCoinsMinConf(1003 * COIN, filter_standard, groups, setCoinsRet, nValueRet, coin_selection_params, bnb_used);\n        assert(success);\n        assert(nValueRet == 1003 * COIN);\n        assert(setCoinsRet.size() == 2);\n    }\n}\n\ntypedef std::set<CInputCoin> CoinSet;\nstatic const CWallet testWallet(\"dummy\", WalletDatabase::CreateDummy());\nstd::vector<std::unique_ptr<CWalletTx>> wtxn;\n\n\/\/ Copied from src\/wallet\/test\/coinselector_tests.cpp\nstatic void add_coin(const CAmount& nValue, int nInput, std::vector<OutputGroup>& set)\n{\n    CMutableTransaction tx;\n    tx.vout.resize(nInput + 1);\n    tx.vout[nInput].nValue = nValue;\n    std::unique_ptr<CWalletTx> wtx(new CWalletTx(&testWallet, MakeTransactionRef(std::move(tx))));\n    set.emplace_back(COutput(wtx.get(), nInput, 0, true, true, true).GetInputCoin(), 0, true, 0, 0);\n    wtxn.emplace_back(std::move(wtx));\n}\n\/\/ Copied from src\/wallet\/test\/coinselector_tests.cpp\nstatic CAmount make_hard_case(int utxos, std::vector<OutputGroup>& utxo_pool)\n{\n    utxo_pool.clear();\n    CAmount target = 0;\n    for (int i = 0; i < utxos; ++i) {\n        target += (CAmount)1 << (utxos+i);\n        add_coin((CAmount)1 << (utxos+i), 2*i, utxo_pool);\n        add_coin(((CAmount)1 << (utxos+i)) + ((CAmount)1 << (utxos-1-i)), 2*i + 1, utxo_pool);\n    }\n    return target;\n}\n\nstatic void BnBExhaustion(benchmark::State& state)\n{\n    \/\/ Setup\n    std::vector<OutputGroup> utxo_pool;\n    CoinSet selection;\n    CAmount value_ret = 0;\n    CAmount not_input_fees = 0;\n\n    while (state.KeepRunning()) {\n        \/\/ Benchmark\n        CAmount target = make_hard_case(17, utxo_pool);\n        SelectCoinsBnB(utxo_pool, target, 0, selection, value_ret, not_input_fees); \/\/ Should exhaust\n\n        \/\/ Cleanup\n        utxo_pool.clear();\n        selection.clear();\n    }\n}\n\nBENCHMARK(CoinSelection, 650);\nBENCHMARK(BnBExhaustion, 650);\n<|endoftext|>"}
{"text":"<commit_before>\/* Gobby - GTK-based collaborative text editor\n * Copyright (C) 2008, 2009 Armin Burgmeier <armin@arbur.net>\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU 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 * 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 Free\n * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n *\/\n\n#ifndef _GOBBY_WINDOW_HPP_\n#define _GOBBY_WINDOW_HPP_\n\n#include \"features.hpp\"\n\n#include \"commands\/autosave-commands.hpp\"\n#include \"commands\/browser-commands.hpp\"\n#include \"commands\/browser-context-commands.hpp\"\n#include \"commands\/folder-commands.hpp\"\n#include \"commands\/file-commands.hpp\"\n#include \"commands\/edit-commands.hpp\"\n#include \"commands\/view-commands.hpp\"\n#include \"commands\/help-commands.hpp\"\n#include \"operations\/operations.hpp\"\n\n#include \"dialogs\/initial-dialog.hpp\"\n\n#include \"core\/iconmanager.hpp\"\n#include \"core\/header.hpp\"\n#include \"core\/folder.hpp\"\n#include \"core\/browser.hpp\"\n#include \"core\/statusbar.hpp\"\n#include \"core\/preferences.hpp\"\n#include \"core\/filechooser.hpp\"\n#include \"core\/titlebar.hpp\"\n\n#include \"util\/config.hpp\"\n\n#include <gtkmm\/window.h>\n#include <gtkmm\/paned.h>\n#include <gtkmm\/messagedialog.h>\n\n#ifdef WITH_UNIQUE\n# include <unique\/unique.h>\n#endif\n\n#include <memory>\n\nnamespace Gobby\n{\n\nclass Window : public Gtk::Window\n{\npublic:\n\tWindow(unsigned int argc, const char* const argv[],\n\t       const IconManager& icon_mgr, Config& config\n#ifdef WITH_UNIQUE\n\t       , UniqueApp* app\n#endif\n\t       );\n\t~Window();\n\n\tconst Folder& get_folder() const { return m_folder; }\n\tFolder& get_folder() { return m_folder; }\n\nprotected:\n#ifdef WITH_UNIQUE\n\tstatic UniqueResponse\n\ton_message_received_static(UniqueApp* app,\n\t                           UniqueCommand command,\n\t                           UniqueMessageData* message,\n\t                           guint time,\n\t                           gpointer user_data)\n\t{\n\t\treturn static_cast<Window*>(user_data)->on_message_received(\n\t\t\tcommand, message, time);\n\t}\n#endif\n\n\t\/\/ Gtk::Window overrides\n\tvirtual bool on_delete_event(GdkEventAny* event);\n\tvirtual bool on_key_press_event(GdkEventKey* event);\n\n\tvirtual void on_realize();\n\tvirtual void on_show();\n\n\tvoid on_initial_dialog_hide();\n\n#ifdef WITH_UNIQUE\n\tUniqueResponse on_message_received(UniqueCommand command,\n\t                                   UniqueMessageData* message,\n\t                                   guint time);\n#endif\n\n\t\/\/ Command line arguments\n\t\/\/ TODO: We only require these in on_show to initially open files\n\t\/\/ passed on the command line. We can't do it in the constructor\n\t\/\/ already, because otherwise the main window is shown after the\n\t\/\/ document location dialog, and therefore ends up having focus,\n\t\/\/ which it shouldn't. Maybe we'll find a better solution which does\n\t\/\/ not require these member variables.\n\tconst unsigned int m_argc;\n\tconst char* const* m_argv;\n\n\t\/\/ Config\n\tConfig& m_config;\n\tGtkSourceLanguageManager* m_lang_manager;\n\tPreferences m_preferences;\n\tconst IconManager& m_icon_mgr;\n\n#ifdef WITH_UNIQUE\n\tUniqueApp* m_app;\n#endif\n\n\t\/\/ GUI\n\tGtk::VBox m_mainbox;\n\tGtk::HPaned m_paned;\n\n\tHeader m_header;\n\tBrowser m_browser;\n\tFolder m_folder;\n\tStatusBar m_statusbar;\n\n\t\/\/ Functionality\n\tDocumentInfoStorage m_info_storage;\n\tFileChooser m_file_chooser;\n\tOperations m_operations;\n\n\tAutosaveCommands m_commands_autosave;\n\tBrowserCommands m_commands_browser;\n\tBrowserContextCommands m_commands_browser_context;\n\tFolderCommands m_commands_folder;\n\tFileCommands m_commands_file;\n\tEditCommands m_commands_edit;\n\tViewCommands m_commands_view;\n\tHelpCommands m_commands_help;\n\n\tTitleBar m_title_bar;\n\n\t\/\/ Dialogs\n\tstd::auto_ptr<InitialDialog> m_initial_dlg;\n};\n\n}\n\n#endif \/\/ _GOBBY_WINDOW_HPP_\n<commit_msg>Gobby::Window: Added connect_to_host function forwarding to m_browser<commit_after>\/* Gobby - GTK-based collaborative text editor\n * Copyright (C) 2008, 2009 Armin Burgmeier <armin@arbur.net>\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU 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 * 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 Free\n * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n *\/\n\n#ifndef _GOBBY_WINDOW_HPP_\n#define _GOBBY_WINDOW_HPP_\n\n#include \"features.hpp\"\n\n#include \"commands\/autosave-commands.hpp\"\n#include \"commands\/browser-commands.hpp\"\n#include \"commands\/browser-context-commands.hpp\"\n#include \"commands\/folder-commands.hpp\"\n#include \"commands\/file-commands.hpp\"\n#include \"commands\/edit-commands.hpp\"\n#include \"commands\/view-commands.hpp\"\n#include \"commands\/help-commands.hpp\"\n#include \"operations\/operations.hpp\"\n\n#include \"dialogs\/initial-dialog.hpp\"\n\n#include \"core\/iconmanager.hpp\"\n#include \"core\/header.hpp\"\n#include \"core\/folder.hpp\"\n#include \"core\/browser.hpp\"\n#include \"core\/statusbar.hpp\"\n#include \"core\/preferences.hpp\"\n#include \"core\/filechooser.hpp\"\n#include \"core\/titlebar.hpp\"\n\n#include \"util\/config.hpp\"\n\n#include <gtkmm\/window.h>\n#include <gtkmm\/paned.h>\n#include <gtkmm\/messagedialog.h>\n\n#ifdef WITH_UNIQUE\n# include <unique\/unique.h>\n#endif\n\n#include <memory>\n\nnamespace Gobby\n{\n\nclass Window : public Gtk::Window\n{\npublic:\n\tWindow(unsigned int argc, const char* const argv[],\n\t       const IconManager& icon_mgr, Config& config\n#ifdef WITH_UNIQUE\n\t       , UniqueApp* app\n#endif\n\t       );\n\t~Window();\n\n\tconst Folder& get_folder() const { return m_folder; }\n\tFolder& get_folder() { return m_folder; }\n\n\tvoid connect_to_host(const Glib::ustring& hostname)\n\t{\n\t\tm_browser.connect_to_host(hostname);\n\t}\n\nprotected:\n#ifdef WITH_UNIQUE\n\tstatic UniqueResponse\n\ton_message_received_static(UniqueApp* app,\n\t                           UniqueCommand command,\n\t                           UniqueMessageData* message,\n\t                           guint time,\n\t                           gpointer user_data)\n\t{\n\t\treturn static_cast<Window*>(user_data)->on_message_received(\n\t\t\tcommand, message, time);\n\t}\n#endif\n\n\t\/\/ Gtk::Window overrides\n\tvirtual bool on_delete_event(GdkEventAny* event);\n\tvirtual bool on_key_press_event(GdkEventKey* event);\n\n\tvirtual void on_realize();\n\tvirtual void on_show();\n\n\tvoid on_initial_dialog_hide();\n\n#ifdef WITH_UNIQUE\n\tUniqueResponse on_message_received(UniqueCommand command,\n\t                                   UniqueMessageData* message,\n\t                                   guint time);\n#endif\n\n\t\/\/ Command line arguments\n\t\/\/ TODO: We only require these in on_show to initially open files\n\t\/\/ passed on the command line. We can't do it in the constructor\n\t\/\/ already, because otherwise the main window is shown after the\n\t\/\/ document location dialog, and therefore ends up having focus,\n\t\/\/ which it shouldn't. Maybe we'll find a better solution which does\n\t\/\/ not require these member variables.\n\tconst unsigned int m_argc;\n\tconst char* const* m_argv;\n\n\t\/\/ Config\n\tConfig& m_config;\n\tGtkSourceLanguageManager* m_lang_manager;\n\tPreferences m_preferences;\n\tconst IconManager& m_icon_mgr;\n\n#ifdef WITH_UNIQUE\n\tUniqueApp* m_app;\n#endif\n\n\t\/\/ GUI\n\tGtk::VBox m_mainbox;\n\tGtk::HPaned m_paned;\n\n\tHeader m_header;\n\tBrowser m_browser;\n\tFolder m_folder;\n\tStatusBar m_statusbar;\n\n\t\/\/ Functionality\n\tDocumentInfoStorage m_info_storage;\n\tFileChooser m_file_chooser;\n\tOperations m_operations;\n\n\tAutosaveCommands m_commands_autosave;\n\tBrowserCommands m_commands_browser;\n\tBrowserContextCommands m_commands_browser_context;\n\tFolderCommands m_commands_folder;\n\tFileCommands m_commands_file;\n\tEditCommands m_commands_edit;\n\tViewCommands m_commands_view;\n\tHelpCommands m_commands_help;\n\n\tTitleBar m_title_bar;\n\n\t\/\/ Dialogs\n\tstd::auto_ptr<InitialDialog> m_initial_dlg;\n};\n\n}\n\n#endif \/\/ _GOBBY_WINDOW_HPP_\n<|endoftext|>"}
{"text":"<commit_before>class ExitCounter{\n    public:\n        static int get();\n        static int dec();\n    private:\n        \/\/ If fastforwarding is turned of the count\n        \/\/ needs to be manually changed to 0 here.\n        ExitCounter(){ count=0; };\n        static ExitCounter * instance;\n        int count;\n\n};\n<commit_msg>Assume fast forwarding is used by default.<commit_after>class ExitCounter{\n    public:\n        static int get();\n        static int dec();\n    private:\n        \/\/ If fastforwarding is turned of the count\n        \/\/ needs to be manually changed to 0 here.\n        ExitCounter(){ count=1; };\n        static ExitCounter * instance;\n        int count;\n\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,\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#include \"query_optimizer\/rules\/PushDownLowCostDisjunctivePredicate.hpp\"\n\n#include <cstddef>\n#include <vector>\n\n#include \"query_optimizer\/cost_model\/StarSchemaSimpleCostModel.hpp\"\n#include \"query_optimizer\/expressions\/AttributeReference.hpp\"\n#include \"query_optimizer\/expressions\/ExpressionUtil.hpp\"\n#include \"query_optimizer\/expressions\/LogicalAnd.hpp\"\n#include \"query_optimizer\/expressions\/LogicalOr.hpp\"\n#include \"query_optimizer\/expressions\/PatternMatcher.hpp\"\n#include \"query_optimizer\/expressions\/Predicate.hpp\"\n#include \"query_optimizer\/physical\/Aggregate.hpp\"\n#include \"query_optimizer\/physical\/HashJoin.hpp\"\n#include \"query_optimizer\/physical\/NestedLoopsJoin.hpp\"\n#include \"query_optimizer\/physical\/PatternMatcher.hpp\"\n#include \"query_optimizer\/physical\/Physical.hpp\"\n#include \"query_optimizer\/physical\/PhysicalType.hpp\"\n#include \"query_optimizer\/physical\/Selection.hpp\"\n#include \"query_optimizer\/physical\/TableReference.hpp\"\n#include \"query_optimizer\/physical\/TopLevelPlan.hpp\"\n\n#include \"gflags\/gflags.h\"\n\n#include \"glog\/logging.h\"\n\nnamespace quickstep {\nnamespace optimizer {\n\nDEFINE_uint64(push_down_disjunctive_predicate_cardinality_threshold, 100u,\n              \"The cardinality threshold for a stored relation for the \"\n              \"PushDownLowCostDisjunctivePredicate optimization rule to push \"\n              \"down a disjunctive predicate to pre-filter that relation.\");\n\nnamespace E = ::quickstep::optimizer::expressions;\nnamespace P = ::quickstep::optimizer::physical;\n\nP::PhysicalPtr PushDownLowCostDisjunctivePredicate::apply(const P::PhysicalPtr &input) {\n  DCHECK(input->getPhysicalType() == P::PhysicalType::kTopLevelPlan);\n\n  const P::TopLevelPlanPtr top_level_plan =\n     std::static_pointer_cast<const P::TopLevelPlan>(input);\n  cost_model_.reset(\n      new cost::StarSchemaSimpleCostModel(\n          top_level_plan->shared_subplans()));\n\n  collectApplicablePredicates(input);\n\n  if (!applicable_predicates_.empty()) {\n    \/\/ Apply the selected predicates to stored relations.\n    return attachPredicates(input);\n  } else {\n    return input;\n  }\n}\n\nvoid PushDownLowCostDisjunctivePredicate::collectApplicablePredicates(\n    const physical::PhysicalPtr &input) {\n  P::TableReferencePtr table_reference;\n  if (P::SomeTableReference::MatchesWithConditionalCast(input, &table_reference)) {\n    \/\/ Consider only stored relations with small cardinality as targets.\n    if (cost_model_->estimateCardinality(input) <=\n            FLAGS_push_down_disjunctive_predicate_cardinality_threshold) {\n      applicable_nodes_.emplace_back(input, &table_reference->attribute_list());\n    }\n    return;\n  }\n\n  for (const auto &child : input->children()) {\n    collectApplicablePredicates(child);\n  }\n\n  E::PredicatePtr filter_predicate = nullptr;\n  switch (input->getPhysicalType()) {\n    case P::PhysicalType::kAggregate: {\n      filter_predicate =\n          std::static_pointer_cast<const P::Aggregate>(input)->filter_predicate();\n      break;\n    }\n    case P::PhysicalType::kHashJoin: {\n      const P::HashJoinPtr hash_join =\n          std::static_pointer_cast<const P::HashJoin>(input);\n      if (hash_join->join_type() == P::HashJoin::JoinType::kInnerJoin) {\n        filter_predicate = hash_join->residual_predicate();\n      }\n      break;\n    }\n    case P::PhysicalType::kNestedLoopsJoin: {\n      filter_predicate =\n          std::static_pointer_cast<const P::NestedLoopsJoin>(input)->join_predicate();\n      break;\n    }\n    case P::PhysicalType::kSelection: {\n      filter_predicate =\n          std::static_pointer_cast<const P::Selection>(input)->filter_predicate();\n      break;\n    }\n    default:\n      break;\n  }\n\n  E::LogicalOrPtr disjunctive_predicate;\n  if (filter_predicate == nullptr ||\n      !E::SomeLogicalOr::MatchesWithConditionalCast(filter_predicate, &disjunctive_predicate)) {\n    return;\n  }\n\n  \/\/ Consider only disjunctive normal form, i.e. disjunction of conjunctions.\n  \/\/ Divide the disjunctive components into groups.\n  std::vector<std::vector<E::PredicatePtr>> candidate_predicates;\n  std::vector<std::vector<std::vector<E::AttributeReferencePtr>>> candidate_attributes;\n  for (const auto &conjunctive_predicate : disjunctive_predicate->operands()) {\n    candidate_predicates.emplace_back();\n    candidate_attributes.emplace_back();\n    E::LogicalAndPtr logical_and;\n    if (E::SomeLogicalAnd::MatchesWithConditionalCast(conjunctive_predicate, &logical_and)) {\n      for (const auto &predicate : logical_and->operands()) {\n        candidate_predicates.back().emplace_back(predicate);\n        candidate_attributes.back().emplace_back(\n            predicate->getReferencedAttributes());\n      }\n    } else {\n      candidate_predicates.back().emplace_back(conjunctive_predicate);\n      candidate_attributes.back().emplace_back(\n          conjunctive_predicate->getReferencedAttributes());\n    }\n  }\n\n  \/\/ Check whether the conditions are met for pushing down part of the predicates\n  \/\/ to each small-cardinality stored relation.\n  for (const auto &node_pair : applicable_nodes_) {\n    const std::vector<E::AttributeReferencePtr> &target_attributes = *node_pair.second;\n    std::vector<E::PredicatePtr> selected_disj_preds;\n    for (std::size_t i = 0; i < candidate_predicates.size(); ++i) {\n      const auto &cand_preds = candidate_predicates[i];\n      const auto &cand_attrs = candidate_attributes[i];\n\n      std::vector<E::PredicatePtr> selected_conj_preds;\n      for (std::size_t j = 0; j < cand_preds.size(); ++j) {\n        if (E::SubsetOfExpressions(cand_attrs[j], target_attributes)) {\n          selected_conj_preds.emplace_back(cand_preds[j]);\n        }\n      }\n      if (selected_conj_preds.empty()) {\n        \/\/ Not every disjunctive component contains a predicate that can be applied\n        \/\/ to the table reference node -- condition failed, exit.\n        selected_disj_preds.clear();\n        break;\n      } else {\n        selected_disj_preds.emplace_back(\n            CreateConjunctive(selected_conj_preds));\n      }\n    }\n    if (!selected_disj_preds.empty()) {\n      applicable_predicates_[node_pair.first].add(\n          CreateDisjunctive(selected_disj_preds));\n    }\n  }\n}\n\nP::PhysicalPtr PushDownLowCostDisjunctivePredicate::attachPredicates(\n    const P::PhysicalPtr &input) const {\n  std::vector<P::PhysicalPtr> new_children;\n  for (const P::PhysicalPtr &child : input->children()) {\n    const P::PhysicalPtr new_child = attachPredicates(child);\n    new_children.push_back(new_child);\n  }\n\n  const P::PhysicalPtr output =\n      new_children == input->children() ? input\n                                        : input->copyWithNewChildren(new_children);\n\n  const auto &node_it = applicable_predicates_.find(input);\n  if (node_it != applicable_predicates_.end()) {\n    const E::PredicatePtr filter_predicate =\n        CreateConjunctive(node_it->second.predicates);\n    return P::Selection::Create(output,\n                                E::ToNamedExpressions(output->getOutputAttributes()),\n                                filter_predicate);\n  }\n\n  return output;\n}\n\nE::PredicatePtr PushDownLowCostDisjunctivePredicate::CreateConjunctive(\n    const std::vector<E::PredicatePtr> predicates) {\n  DCHECK_GE(predicates.size(), 1u);\n  if (predicates.size() == 1) {\n    return predicates.front();\n  } else {\n    return E::LogicalAnd::Create(predicates);\n  }\n}\n\nE::PredicatePtr PushDownLowCostDisjunctivePredicate::CreateDisjunctive(\n    const std::vector<E::PredicatePtr> predicates) {\n  DCHECK_GE(predicates.size(), 1u);\n  if (predicates.size() == 1) {\n    return predicates.front();\n  } else {\n    return E::LogicalOr::Create(predicates);\n  }\n}\n\n}  \/\/ namespace optimizer\n}  \/\/ namespace quickstep\n<commit_msg>Improve disjunctive predicate pushdown to optimize more scenarios.<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,\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#include \"query_optimizer\/rules\/PushDownLowCostDisjunctivePredicate.hpp\"\n\n#include <cstddef>\n#include <vector>\n\n#include \"query_optimizer\/cost_model\/StarSchemaSimpleCostModel.hpp\"\n#include \"query_optimizer\/expressions\/AttributeReference.hpp\"\n#include \"query_optimizer\/expressions\/ExpressionUtil.hpp\"\n#include \"query_optimizer\/expressions\/LogicalAnd.hpp\"\n#include \"query_optimizer\/expressions\/LogicalOr.hpp\"\n#include \"query_optimizer\/expressions\/PatternMatcher.hpp\"\n#include \"query_optimizer\/expressions\/Predicate.hpp\"\n#include \"query_optimizer\/physical\/Aggregate.hpp\"\n#include \"query_optimizer\/physical\/HashJoin.hpp\"\n#include \"query_optimizer\/physical\/NestedLoopsJoin.hpp\"\n#include \"query_optimizer\/physical\/PatternMatcher.hpp\"\n#include \"query_optimizer\/physical\/Physical.hpp\"\n#include \"query_optimizer\/physical\/PhysicalType.hpp\"\n#include \"query_optimizer\/physical\/Selection.hpp\"\n#include \"query_optimizer\/physical\/TableReference.hpp\"\n#include \"query_optimizer\/physical\/TopLevelPlan.hpp\"\n\n#include \"gflags\/gflags.h\"\n\n#include \"glog\/logging.h\"\n\nnamespace quickstep {\nnamespace optimizer {\n\nDEFINE_uint64(push_down_disjunctive_predicate_cardinality_threshold, 100u,\n              \"The cardinality threshold for a stored relation for the \"\n              \"PushDownLowCostDisjunctivePredicate optimization rule to push \"\n              \"down a disjunctive predicate to pre-filter that relation.\");\n\nDEFINE_double(push_down_disjunctive_predicate_selectivity_threshold, 0.2,\n              \"The estimated selectivity threshold below which the \"\n              \"PushDownLowCostDisjunctivePredicate optimization rule will push \"\n              \"down a disjunctive predicate to pre-filter a stored relation.\");\n\nnamespace E = ::quickstep::optimizer::expressions;\nnamespace P = ::quickstep::optimizer::physical;\n\nP::PhysicalPtr PushDownLowCostDisjunctivePredicate::apply(const P::PhysicalPtr &input) {\n  DCHECK(input->getPhysicalType() == P::PhysicalType::kTopLevelPlan);\n\n  const P::TopLevelPlanPtr top_level_plan =\n     std::static_pointer_cast<const P::TopLevelPlan>(input);\n  cost_model_.reset(\n      new cost::StarSchemaSimpleCostModel(\n          top_level_plan->shared_subplans()));\n\n  collectApplicablePredicates(input);\n\n  if (!applicable_predicates_.empty()) {\n    \/\/ Apply the selected predicates to stored relations.\n    return attachPredicates(input);\n  } else {\n    return input;\n  }\n}\n\nvoid PushDownLowCostDisjunctivePredicate::collectApplicablePredicates(\n    const physical::PhysicalPtr &input) {\n  P::TableReferencePtr table_reference;\n  if (P::SomeTableReference::MatchesWithConditionalCast(input, &table_reference)) {\n    applicable_nodes_.emplace_back(input, &table_reference->attribute_list());\n    return;\n  }\n\n  for (const auto &child : input->children()) {\n    collectApplicablePredicates(child);\n  }\n\n  E::PredicatePtr filter_predicate = nullptr;\n  switch (input->getPhysicalType()) {\n    case P::PhysicalType::kAggregate: {\n      filter_predicate =\n          std::static_pointer_cast<const P::Aggregate>(input)->filter_predicate();\n      break;\n    }\n    case P::PhysicalType::kHashJoin: {\n      const P::HashJoinPtr hash_join =\n          std::static_pointer_cast<const P::HashJoin>(input);\n      if (hash_join->join_type() == P::HashJoin::JoinType::kInnerJoin) {\n        filter_predicate = hash_join->residual_predicate();\n      }\n      break;\n    }\n    case P::PhysicalType::kNestedLoopsJoin: {\n      filter_predicate =\n          std::static_pointer_cast<const P::NestedLoopsJoin>(input)->join_predicate();\n      break;\n    }\n    case P::PhysicalType::kSelection: {\n      filter_predicate =\n          std::static_pointer_cast<const P::Selection>(input)->filter_predicate();\n      break;\n    }\n    default:\n      break;\n  }\n\n  E::LogicalOrPtr disjunctive_predicate;\n  if (filter_predicate == nullptr ||\n      !E::SomeLogicalOr::MatchesWithConditionalCast(filter_predicate, &disjunctive_predicate)) {\n    return;\n  }\n\n  \/\/ Consider only disjunctive normal form, i.e. disjunction of conjunctions.\n  \/\/ Divide the disjunctive components into groups.\n  std::vector<std::vector<E::PredicatePtr>> candidate_predicates;\n  std::vector<std::vector<std::vector<E::AttributeReferencePtr>>> candidate_attributes;\n  for (const auto &conjunctive_predicate : disjunctive_predicate->operands()) {\n    candidate_predicates.emplace_back();\n    candidate_attributes.emplace_back();\n    E::LogicalAndPtr logical_and;\n    if (E::SomeLogicalAnd::MatchesWithConditionalCast(conjunctive_predicate, &logical_and)) {\n      for (const auto &predicate : logical_and->operands()) {\n        candidate_predicates.back().emplace_back(predicate);\n        candidate_attributes.back().emplace_back(\n            predicate->getReferencedAttributes());\n      }\n    } else {\n      candidate_predicates.back().emplace_back(conjunctive_predicate);\n      candidate_attributes.back().emplace_back(\n          conjunctive_predicate->getReferencedAttributes());\n    }\n  }\n\n  \/\/ Check whether the conditions are met for pushing down part of the predicates\n  \/\/ to each small-cardinality stored relation.\n  for (const auto &node_pair : applicable_nodes_) {\n    const std::vector<E::AttributeReferencePtr> &target_attributes = *node_pair.second;\n    std::vector<E::PredicatePtr> selected_disj_preds;\n    for (std::size_t i = 0; i < candidate_predicates.size(); ++i) {\n      const auto &cand_preds = candidate_predicates[i];\n      const auto &cand_attrs = candidate_attributes[i];\n\n      std::vector<E::PredicatePtr> selected_conj_preds;\n      for (std::size_t j = 0; j < cand_preds.size(); ++j) {\n        if (E::SubsetOfExpressions(cand_attrs[j], target_attributes)) {\n          selected_conj_preds.emplace_back(cand_preds[j]);\n        }\n      }\n      if (selected_conj_preds.empty()) {\n        \/\/ Not every disjunctive component contains a predicate that can be applied\n        \/\/ to the table reference node -- condition failed, exit.\n        selected_disj_preds.clear();\n        break;\n      } else {\n        selected_disj_preds.emplace_back(\n            CreateConjunctive(selected_conj_preds));\n      }\n    }\n    if (!selected_disj_preds.empty()) {\n      applicable_predicates_[node_pair.first].add(\n          CreateDisjunctive(selected_disj_preds));\n    }\n  }\n}\n\nP::PhysicalPtr PushDownLowCostDisjunctivePredicate::attachPredicates(\n    const P::PhysicalPtr &input) const {\n  std::vector<P::PhysicalPtr> new_children;\n  for (const P::PhysicalPtr &child : input->children()) {\n    const P::PhysicalPtr new_child = attachPredicates(child);\n    new_children.push_back(new_child);\n  }\n\n  const P::PhysicalPtr output =\n      new_children == input->children() ? input\n                                        : input->copyWithNewChildren(new_children);\n\n  const auto &node_it = applicable_predicates_.find(input);\n  if (node_it != applicable_predicates_.end()) {\n    const P::PhysicalPtr selection =\n        P::Selection::Create(output,\n                             E::ToNamedExpressions(output->getOutputAttributes()),\n                             CreateConjunctive(node_it->second.predicates));\n\n    \/\/ Applicable case 1: The stored relation has small cardinality.\n    const bool is_small_cardinality_relation =\n        cost_model_->estimateCardinality(input) <=\n            FLAGS_push_down_disjunctive_predicate_cardinality_threshold;\n\n    \/\/ Applicable case 2: The filter predicate has low selectivity.\n    const bool is_selective_predicate =\n        cost_model_->estimateSelectivityForFilterPredicate(selection) <=\n            FLAGS_push_down_disjunctive_predicate_selectivity_threshold;\n\n    if (is_small_cardinality_relation || is_selective_predicate) {\n      return selection;\n    }\n  }\n\n  return output;\n}\n\nE::PredicatePtr PushDownLowCostDisjunctivePredicate::CreateConjunctive(\n    const std::vector<E::PredicatePtr> predicates) {\n  DCHECK_GE(predicates.size(), 1u);\n  if (predicates.size() == 1) {\n    return predicates.front();\n  } else {\n    return E::LogicalAnd::Create(predicates);\n  }\n}\n\nE::PredicatePtr PushDownLowCostDisjunctivePredicate::CreateDisjunctive(\n    const std::vector<E::PredicatePtr> predicates) {\n  DCHECK_GE(predicates.size(), 1u);\n  if (predicates.size() == 1) {\n    return predicates.front();\n  } else {\n    return E::LogicalOr::Create(predicates);\n  }\n}\n\n}  \/\/ namespace optimizer\n}  \/\/ namespace quickstep\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2011, Georgia Tech Research Corporation\n * All rights reserved.\n *\n * Author(s): Karen Liu <karenliu@cc.gatech.edu>\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 code incorporates portions of Open Dynamics Engine\n *     (Copyright (c) 2001-2004, Russell L. Smith. All rights\n *     reserved.) and portions of FCL (Copyright (c) 2011, Willow\n *     Garage, Inc. All rights reserved.), which were released under\n *     the same BSD license as below\n *\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 <cstdio>\n\n#include \"SimWindow.h\"\n#include \"simulation\/World.h\"\n#include \"dynamics\/Skeleton.h\"\n#include \"constraint\/ConstraintDynamics.h\"\n#include \"collision\/CollisionDetector.h\"\n#include \"yui\/GLFuncs.h\"\n\nnamespace dart {\nnamespace simulation {\n\nSimWindow::SimWindow()\n    : Win3D()\n{\n    mBackground[0] = 1.0;\n    mBackground[1] = 1.0;\n    mBackground[2] = 1.0;\n    mBackground[3] = 1.0;\n\n    mPlay = false;\n    mSimulating = false;\n    mPlayFrame = 0;\n    mShowMarkers = true;\n    mPersp = 45.f;\n    mTrans[1] = 300.f;\n}\n\nSimWindow::~SimWindow()\n{\n}\n\nvoid SimWindow::drawSkels()\n{\n    for (int i = 0; i < mWorld->getNumSkeletons(); i++)\n        mWorld->getSkeleton(i)->draw(mRI);\n}\n\nvoid SimWindow::displayTimer(int _val)\n{\n    int numIter = mDisplayTimeout \/ (mWorld->getTimeStep() * 1000);\n    if (mPlay) {\n        mPlayFrame += 16;\n        if (mPlayFrame >= mBakedStates.size())\n            mPlayFrame = 0;\n    }else if (mSimulating) {\n        for (int i = 0; i < numIter; i++) {\n            timeStepping();\n            bake();\n        }\n    }\n    glutPostRedisplay();\n    glutTimerFunc(mDisplayTimeout, refreshTimer, _val);\n}\n\nvoid SimWindow::draw()\n{\n    glDisable(GL_LIGHTING);\n    glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\n    if (!mSimulating) {\n        if (mPlayFrame < mBakedStates.size()) {\n            int nSkels = mWorld->getNumSkeletons();\n            for (unsigned int i = 0; i < nSkels; i++) {\n                int start = mWorld->getIndex(i);\n                \/\/int size = mWorld->getDofs(i).size();\n                int size = mWorld->getSkeleton(i)->getDOF();\n                mWorld->getSkeleton(i)->setPose(mBakedStates[mPlayFrame].segment(start, size), false, false);\n            }\n            if (mShowMarkers) {\n                int sumDofs = mWorld->getIndex(nSkels);\n                int nContact = (mBakedStates[mPlayFrame].size() - sumDofs) \/ 6;\n                for (int i = 0; i < nContact; i++) {\n                    Eigen::Vector3d v = mBakedStates[mPlayFrame].segment(sumDofs + i * 6, 3);\n                    Eigen::Vector3d f = mBakedStates[mPlayFrame].segment(sumDofs + i * 6 + 3, 3) \/ 10.0;\n                    glBegin(GL_LINES);\n                    glVertex3f(v[0], v[1], v[2]);\n                    glVertex3f(v[0] + f[0], v[1] + f[1], v[2] + f[2]);\n                    glEnd();\n                    mRI->setPenColor(Eigen::Vector3d(0.2, 0.2, 0.8));\n                    mRI->pushMatrix();\n                    glTranslated(v[0], v[1], v[2]);\n                    mRI->drawEllipsoid(Eigen::Vector3d(0.02, 0.02, 0.02));\n                    mRI->popMatrix();\n                }\n            }\n        }\n    }else{\n        if (mShowMarkers) {\n            for (int k = 0; k < mWorld->getCollisionHandle()->getCollisionChecker()->getNumContacts(); k++) {\n                Eigen::Vector3d v = mWorld->getCollisionHandle()->getCollisionChecker()->getContact(k).point;\n                Eigen::Vector3d f = mWorld->getCollisionHandle()->getCollisionChecker()->getContact(k).force \/ 10.0;\n                glBegin(GL_LINES);\n                glVertex3f(v[0], v[1], v[2]);\n                glVertex3f(v[0] + f[0], v[1] + f[1], v[2] + f[2]);\n                glEnd();\n                mRI->setPenColor(Eigen::Vector3d(0.2, 0.2, 0.8));\n                mRI->pushMatrix();\n                glTranslated(v[0], v[1], v[2]);\n                mRI->drawEllipsoid(Eigen::Vector3d(0.02, 0.02, 0.02));\n                mRI->popMatrix();\n            }\n        }\n    }\n    drawSkels();\n\n    \/\/ display the frame count in 2D text\n    char buff[64];\n    if (!mSimulating)\n        sprintf(buff, \"%d\", mPlayFrame);\n    else\n        sprintf(buff, \"%d\", mWorld->getSimFrames());\n    std::string frame(buff);\n    glColor3f(0.0, 0.0, 0.0);\n    yui::drawStringOnScreen(0.02f, 0.02f, frame);\n    glEnable(GL_LIGHTING);\n}\n\nvoid SimWindow::keyboard(unsigned char key, int x, int y)\n{\n    switch(key){\n        case ' ': \/\/ use space key to play or stop the motion\n            mSimulating = !mSimulating;\n            if(mSimulating) {\n                mPlay = false;\n                glutTimerFunc( mDisplayTimeout, refreshTimer, 0);\n            }\n            break;\n        case 'p': \/\/ playBack\n            mPlay = !mPlay;\n            if (mPlay) {\n                mSimulating = false;\n                glutTimerFunc( mDisplayTimeout, refreshTimer, 0);\n            }\n            break;\n        case '[': \/\/ step backward\n            if (!mSimulating) {\n                mPlayFrame--;\n                if(mPlayFrame < 0)\n                    mPlayFrame = 0;\n                glutPostRedisplay();\n            }\n            break;\n        case ']': \/\/ step forwardward\n            if (!mSimulating) {\n                mPlayFrame++;\n                if(mPlayFrame >= mBakedStates.size())\n                    mPlayFrame = 0;\n                glutPostRedisplay();\n            }\n            break;\n        case 'v': \/\/ show or hide markers\n            mShowMarkers = !mShowMarkers;\n            break;\n        default:\n            Win3D::keyboard(key,x,y);\n    }\n    glutPostRedisplay();\n}\n\nvoid SimWindow::bake()\n{\n    int nContact = mWorld->getCollisionHandle()->getCollisionChecker()->getNumContacts();\n    Eigen::VectorXd state(mWorld->getIndex(mWorld->getNumSkeletons()) + 6 * nContact);\n    for (unsigned int i = 0; i < mWorld->getNumSkeletons(); i++)\n        state.segment(mWorld->getIndex(i), mWorld->getSkeleton(i)->getDOF()) = mWorld->getSkeleton(i)->getPose();\n    for (int i = 0; i < nContact; i++) {\n        int begin = mWorld->getIndex(mWorld->getNumSkeletons()) + i * 6;\n        state.segment(begin, 3) = mWorld->getCollisionHandle()->getCollisionChecker()->getContact(i).point;\n        state.segment(begin + 3, 3) = mWorld->getCollisionHandle()->getCollisionChecker()->getContact(i).force;\n    }\n    mBakedStates.push_back(state);\n}\n\n} \/\/ namespace simulation\n} \/\/ namespace dart\n<commit_msg>fixed the bug in SimWindow.cpp<commit_after>\/* Copyright (c) 2011, Georgia Tech Research Corporation\n * All rights reserved.\n *\n * Author(s): Karen Liu <karenliu@cc.gatech.edu>\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 code incorporates portions of Open Dynamics Engine\n *     (Copyright (c) 2001-2004, Russell L. Smith. All rights\n *     reserved.) and portions of FCL (Copyright (c) 2011, Willow\n *     Garage, Inc. All rights reserved.), which were released under\n *     the same BSD license as below\n *\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 <cstdio>\n\n#include \"SimWindow.h\"\n#include \"simulation\/World.h\"\n#include \"dynamics\/Skeleton.h\"\n#include \"constraint\/ConstraintDynamics.h\"\n#include \"collision\/CollisionDetector.h\"\n#include \"yui\/GLFuncs.h\"\n\nnamespace dart {\nnamespace simulation {\n\nSimWindow::SimWindow()\n    : Win3D()\n{\n    mBackground[0] = 1.0;\n    mBackground[1] = 1.0;\n    mBackground[2] = 1.0;\n    mBackground[3] = 1.0;\n\n    mPlay = false;\n    mSimulating = false;\n    mPlayFrame = 0;\n    mShowMarkers = true;\n    mPersp = 45.f;\n    mTrans[1] = 300.f;\n}\n\nSimWindow::~SimWindow()\n{\n}\n\nvoid SimWindow::drawSkels()\n{\n    for (int i = 0; i < mWorld->getNumSkeletons(); i++)\n        mWorld->getSkeleton(i)->draw(mRI);\n}\n\nvoid SimWindow::displayTimer(int _val)\n{\n    int numIter = mDisplayTimeout \/ (mWorld->getTimeStep() * 1000);\n    if (mPlay) {\n        mPlayFrame += 16;\n        if (mPlayFrame >= mBakedStates.size())\n            mPlayFrame = 0;\n    }else if (mSimulating) {\n        for (int i = 0; i < numIter; i++) {\n            timeStepping();\n            bake();\n        }\n    }\n    glutPostRedisplay();\n    glutTimerFunc(mDisplayTimeout, refreshTimer, _val);\n}\n\nvoid SimWindow::draw()\n{\n    glDisable(GL_LIGHTING);\n    glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\n    if (!mSimulating) {\n        if (mPlayFrame < mBakedStates.size()) {\n            int nSkels = mWorld->getNumSkeletons();\n            for (unsigned int i = 0; i < nSkels; i++) {\n                int start = mWorld->getIndex(i);\n                \/\/int size = mWorld->getDofs(i).size();\n                int size = mWorld->getSkeleton(i)->getDOF();\n                mWorld->getSkeleton(i)->setPose(mBakedStates[mPlayFrame].segment(start, size), true, false);\n            }\n            if (mShowMarkers) {\n                int sumDofs = mWorld->getIndex(nSkels);\n                int nContact = (mBakedStates[mPlayFrame].size() - sumDofs) \/ 6;\n                for (int i = 0; i < nContact; i++) {\n                    Eigen::Vector3d v = mBakedStates[mPlayFrame].segment(sumDofs + i * 6, 3);\n                    Eigen::Vector3d f = mBakedStates[mPlayFrame].segment(sumDofs + i * 6 + 3, 3) \/ 10.0;\n                    glBegin(GL_LINES);\n                    glVertex3f(v[0], v[1], v[2]);\n                    glVertex3f(v[0] + f[0], v[1] + f[1], v[2] + f[2]);\n                    glEnd();\n                    mRI->setPenColor(Eigen::Vector3d(0.2, 0.2, 0.8));\n                    mRI->pushMatrix();\n                    glTranslated(v[0], v[1], v[2]);\n                    mRI->drawEllipsoid(Eigen::Vector3d(0.02, 0.02, 0.02));\n                    mRI->popMatrix();\n                }\n            }\n        }\n    }else{\n        if (mShowMarkers) {\n            for (int k = 0; k < mWorld->getCollisionHandle()->getCollisionChecker()->getNumContacts(); k++) {\n                Eigen::Vector3d v = mWorld->getCollisionHandle()->getCollisionChecker()->getContact(k).point;\n                Eigen::Vector3d f = mWorld->getCollisionHandle()->getCollisionChecker()->getContact(k).force \/ 10.0;\n                glBegin(GL_LINES);\n                glVertex3f(v[0], v[1], v[2]);\n                glVertex3f(v[0] + f[0], v[1] + f[1], v[2] + f[2]);\n                glEnd();\n                mRI->setPenColor(Eigen::Vector3d(0.2, 0.2, 0.8));\n                mRI->pushMatrix();\n                glTranslated(v[0], v[1], v[2]);\n                mRI->drawEllipsoid(Eigen::Vector3d(0.02, 0.02, 0.02));\n                mRI->popMatrix();\n            }\n        }\n    }\n    drawSkels();\n\n    \/\/ display the frame count in 2D text\n    char buff[64];\n    if (!mSimulating)\n        sprintf(buff, \"%d\", mPlayFrame);\n    else\n        sprintf(buff, \"%d\", mWorld->getSimFrames());\n    std::string frame(buff);\n    glColor3f(0.0, 0.0, 0.0);\n    yui::drawStringOnScreen(0.02f, 0.02f, frame);\n    glEnable(GL_LIGHTING);\n}\n\nvoid SimWindow::keyboard(unsigned char key, int x, int y)\n{\n    switch(key){\n        case ' ': \/\/ use space key to play or stop the motion\n            mSimulating = !mSimulating;\n            if(mSimulating) {\n                mPlay = false;\n                glutTimerFunc( mDisplayTimeout, refreshTimer, 0);\n            }\n            break;\n        case 'p': \/\/ playBack\n            mPlay = !mPlay;\n            if (mPlay) {\n                mSimulating = false;\n                glutTimerFunc( mDisplayTimeout, refreshTimer, 0);\n            }\n            break;\n        case '[': \/\/ step backward\n            if (!mSimulating) {\n                mPlayFrame--;\n                if(mPlayFrame < 0)\n                    mPlayFrame = 0;\n                glutPostRedisplay();\n            }\n            break;\n        case ']': \/\/ step forwardward\n            if (!mSimulating) {\n                mPlayFrame++;\n                if(mPlayFrame >= mBakedStates.size())\n                    mPlayFrame = 0;\n                glutPostRedisplay();\n            }\n            break;\n        case 'v': \/\/ show or hide markers\n            mShowMarkers = !mShowMarkers;\n            break;\n        default:\n            Win3D::keyboard(key,x,y);\n    }\n    glutPostRedisplay();\n}\n\nvoid SimWindow::bake()\n{\n    int nContact = mWorld->getCollisionHandle()->getCollisionChecker()->getNumContacts();\n    Eigen::VectorXd state(mWorld->getIndex(mWorld->getNumSkeletons()) + 6 * nContact);\n    for (unsigned int i = 0; i < mWorld->getNumSkeletons(); i++)\n        state.segment(mWorld->getIndex(i), mWorld->getSkeleton(i)->getDOF()) = mWorld->getSkeleton(i)->getPose();\n    for (int i = 0; i < nContact; i++) {\n        int begin = mWorld->getIndex(mWorld->getNumSkeletons()) + i * 6;\n        state.segment(begin, 3) = mWorld->getCollisionHandle()->getCollisionChecker()->getContact(i).point;\n        state.segment(begin + 3, 3) = mWorld->getCollisionHandle()->getCollisionChecker()->getContact(i).force;\n    }\n    mBakedStates.push_back(state);\n}\n\n} \/\/ namespace simulation\n} \/\/ namespace dart\n<|endoftext|>"}
{"text":"<commit_before>\/\/=============================================================================================================\n\/**\n* @file     mnertclient.cpp\n* @author   Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n*           Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version  1.0\n* @date     February, 2013\n*\n* @section  LICENSE\n*\n* Copyright (C) 2013, Christoph Dinh and Matti Hamalainen. 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 the Massachusetts General Hospital 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 MASSACHUSETTS GENERAL HOSPITAL 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    Contains the implementation of the MneRtClient class.\n*\n*\/\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"mnertclient.h\"\n#include \"mnertclientproducer.h\"\n\n#include \"FormFiles\/mnertclientsetupwidget.h\"\n\n#include <utils\/ioutils.h>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtCore\/QtPlugin>\n#include <QtCore\/QTextStream>\n#include <QtCore\/QFile>\n\n#include <QList>\n#include <QDebug>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace MneRtClientPlugin;\nusing namespace UTILSLIB;\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ DEFINE MEMBER METHODS\n\/\/=============================================================================================================\n\nMneRtClient::MneRtClient()\n: m_sMneRtClientClientAlias(\"mne-x\")\n, m_pRtCmdClient(NULL)\n, m_pMneRtClientProducer(new MneRtClientProducer(this))\n, m_sMneRtClientIP(\"127.0.0.1\")\/\/(\"172.21.16.88\")\/\/(\"127.0.0.1\")\n, m_bCmdClientIsConnected(false)\n, m_iBufferSize(-1)\n, m_pRawMatrixBuffer_In(0)\n\/*m_pRTMSA_MneRtClient(0)*\/\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nMneRtClient::~MneRtClient()\n{\n    if(this->isRunning())\n        stop();\n    if(m_pMneRtClientProducer->isRunning())\n        m_pMneRtClientProducer->stop();\n}\n\n\n\/\/*************************************************************************************************************\n\nQSharedPointer<IPlugin> MneRtClient::clone() const\n{\n    QSharedPointer<MneRtClient> pMneRtClientClone(new MneRtClient());\n    return pMneRtClientClone;\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::init()\n{\n    \/\/ Start MneRtClientProducer\n    m_pMneRtClientProducer->start();\n\n\n\/\/    \/\/Convinience CMD connection timer --> ToDo get rid of that -> it interrupts acquistion when not connected\n\/\/    connect(&m_cmdConnectionTimer, &QTimer::timeout, this, &MneRtClient::connectCmdClient);\n\n    \/\/init channels when fiff info is available\n    connect(this, &MneRtClient::fiffInfoAvailable, this, &MneRtClient::initConnector);\n\n\/\/    \/\/Start convinience timer\n\/\/    m_cmdConnectionTimer.start(5000);\n\n    \/\/Try to connect the cmd client on start up using localhost connection\n    this->connectCmdClient();\n}\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ Create measurement instances and config them\n\/\/=============================================================================================================\n\nvoid MneRtClient::initConnector()\n{\n\n\n    qDebug() << \"MneRtClient::init()\";\n\n\/\/    if(m_pFiffInfo)\n\/\/    {\n\/\/\/\/        m_pFiffInfo->sfreq \/= 100;\n\/\/        m_pRTMSA_MneRtClient = addProviderRealTimeMultiSampleArray_New(MSR_ID::MEGMNERTCLIENT_OUTPUT);\n\/\/        m_pRTMSA_MneRtClient->initFromFiffInfo(m_pFiffInfo);\n\/\/        m_pRTMSA_MneRtClient->setMultiArraySize(10);\n\/\/    }\n\n\n    if(m_pFiffInfo)\n    {\n        m_pRTMSA_MneRtClient = PluginOutputData<NewRealTimeMultiSampleArray>::create(this, \"RtClient\", \"MNE Rt Client\");\n\n        m_pRTMSA_MneRtClient->data()->initFromFiffInfo(m_pFiffInfo);\n        m_pRTMSA_MneRtClient->data()->setMultiArraySize(10);\n\n        m_pRTMSA_MneRtClient->data()->setVisibility(true);\n\n        m_outputConnectors.append(m_pRTMSA_MneRtClient);\n    }\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::changeConnector(qint32 p_iNewConnectorId)\n{\n    if(p_iNewConnectorId != m_iActiveConnectorId)\n    {\n        \/\/ read meas info\n        (*m_pRtCmdClient)[\"selcon\"].pValues()[0].setValue(p_iNewConnectorId);\n        (*m_pRtCmdClient)[\"selcon\"].send();\n\n        m_iActiveConnectorId = p_iNewConnectorId;\n\n        \/\/ clear all and request everything new\n        clear();\n\n        \/\/\n        \/\/ request available commands\n        \/\/\n        m_pRtCmdClient->requestCommands();\n\n        \/\/\n        \/\/ Read Info\n        \/\/\n        if(!m_pFiffInfo)\n            requestInfo();\n\n        \/\/\n        \/\/ Read Buffer Size\n        \/\/\n        m_iBufferSize = m_pRtCmdClient->requestBufsize();\n\n        emit cmdConnectionChanged(m_bCmdClientIsConnected);\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::clear()\n{\n    m_pFiffInfo.reset();\n    m_iBufferSize = -1;\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::connectCmdClient()\n{\n    if(m_pRtCmdClient.isNull())\n        m_pRtCmdClient = QSharedPointer<RtCmdClient>(new RtCmdClient);\n    else if(m_bCmdClientIsConnected)\n        this->disconnectCmdClient();\n\n    m_pRtCmdClient->connectToHost(m_sMneRtClientIP);\n    m_pRtCmdClient->waitForConnected(1000);\n\n    if(m_pRtCmdClient->state() == QTcpSocket::ConnectedState)\n    {\n        rtServerMutex.lock();\n\n        \/\/Stop convinience timer\n\/\/        m_cmdConnectionTimer.stop();\n\n        if(!m_bCmdClientIsConnected)\n        {\n            \/\/\n            \/\/ request available commands\n            \/\/\n            m_pRtCmdClient->requestCommands();\n\n            \/\/\n            \/\/ set cmd client is connected\n            \/\/\n            m_bCmdClientIsConnected = true;\n\n            \/\/\n            \/\/ Read Info\n            \/\/\n            if(!m_pFiffInfo)\n                requestInfo();\n\n            \/\/\n            \/\/ Read Connectors\n            \/\/\n            if(m_qMapConnectors.size() == 0)\n                m_iActiveConnectorId = m_pRtCmdClient->requestConnectors(m_qMapConnectors);\n\n            \/\/\n            \/\/ Read Buffer Size\n            \/\/\n            m_iBufferSize = m_pRtCmdClient->requestBufsize();\n\n            emit cmdConnectionChanged(m_bCmdClientIsConnected);\n        }\n        rtServerMutex.unlock();\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::disconnectCmdClient()\n{\n    if(m_bCmdClientIsConnected)\n    {\n        m_pRtCmdClient->disconnectFromHost();\n        m_pRtCmdClient->waitForDisconnected();\n        rtServerMutex.lock();\n        m_bCmdClientIsConnected = false;\n        rtServerMutex.unlock();\n        emit cmdConnectionChanged(m_bCmdClientIsConnected);\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::requestInfo()\n{\n    if(m_pMneRtClientProducer->m_iDataClientId > -1 && m_bCmdClientIsConnected)\n    {\n        \/\/ read meas info\n        (*m_pRtCmdClient)[\"measinfo\"].pValues()[0].setValue(m_pMneRtClientProducer->m_iDataClientId);\n        (*m_pRtCmdClient)[\"measinfo\"].send();\n\n        m_pMneRtClientProducer->producerMutex.lock();\n        m_pMneRtClientProducer->m_bFlagInfoRequest = true;\n        m_pMneRtClientProducer->producerMutex.unlock();\n    }\n    else\n        qWarning() << \"MneRtClientProducer is not connected!\";\n}\n\n\n\/\/*************************************************************************************************************\n\nbool MneRtClient::start()\n{\n    if(m_bCmdClientIsConnected && m_pFiffInfo)\n    {\n        \/\/ Initialize real time measurements\n        init();\n\n        \/\/Set buffer size\n        (*m_pRtCmdClient)[\"bufsize\"].pValues()[0].setValue(m_iBufferSize);\n        (*m_pRtCmdClient)[\"bufsize\"].send();\n\n        \/\/ Buffer\n        m_pRawMatrixBuffer_In = QSharedPointer<RawMatrixBuffer>(new RawMatrixBuffer(8,m_pFiffInfo->nchan,m_iBufferSize));\n\n        \/\/ Start threads\n        QThread::start();\n\n        \/\/ Start Measurement at rt_Server\n        \/\/ start measurement\n        (*m_pRtCmdClient)[\"start\"].pValues()[0].setValue(m_pMneRtClientProducer->m_iDataClientId);\n        (*m_pRtCmdClient)[\"start\"].send();\n\n        m_pMneRtClientProducer->producerMutex.lock();\n        m_pMneRtClientProducer->m_bFlagMeasuring = true;\n        m_pMneRtClientProducer->producerMutex.unlock();\n        m_pMneRtClientProducer->start();\n\n        return true;\n    }\n    else\n        return false;\n}\n\n\n\/\/*************************************************************************************************************\n\nbool MneRtClient::stop()\n{\n    if(m_bCmdClientIsConnected) \/\/ToDo replace this with is running\n    {\n        \/\/ Stop Measurement at rt_Server\n        (*m_pRtCmdClient)[\"stop-all\"].send();\n\n        m_pMneRtClientProducer->producerMutex.lock();\n        m_pMneRtClientProducer->m_bFlagMeasuring = false;\n        m_pMneRtClientProducer->producerMutex.unlock();\n    }\n\n    \/\/ Stop threads\n    QThread::terminate();\n    QThread::wait();\n\n    \/\/Clear Buffers\n\n    return true;\n}\n\n\n\/\/*************************************************************************************************************\n\nIPlugin::PluginType MneRtClient::getType() const\n{\n    return _ISensor;\n}\n\n\n\/\/*************************************************************************************************************\n\nQString MneRtClient::getName() const\n{\n    return \"RT Client\";\n}\n\n\n\/\/*************************************************************************************************************\n\nQWidget* MneRtClient::setupWidget()\n{\n    MneRtClientSetupWidget* widget = new MneRtClientSetupWidget(this);\/\/widget is later distroyed by CentralWidget - so it has to be created everytime new\n\n    \/\/init dialog\n\n    return widget;\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::run()\n{\n\n    MatrixXf matValue;\n    while(true)\n    {\n        \/\/pop matrix\n        matValue = m_pRawMatrixBuffer_In->pop();\n\/\/        std::cout << \"matValue \" << matValue.block(0,0,1,10) << std::endl;\n\n        \/\/emit values\n        for(qint32 i = 0; i < matValue.cols(); ++i)\n            m_pRTMSA_MneRtClient->data()->setValue(matValue.col(i).cast<double>());\n\/\/        for(qint32 i = 0; i < matValue.cols(); i += 100)\n\/\/            m_pRTMSA_MneRtClient->setValue(matValue.col(i).cast<double>());\n    }\n}\n<commit_msg>mne rt client fix<commit_after>\/\/=============================================================================================================\n\/**\n* @file     mnertclient.cpp\n* @author   Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n*           Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version  1.0\n* @date     February, 2013\n*\n* @section  LICENSE\n*\n* Copyright (C) 2013, Christoph Dinh and Matti Hamalainen. 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 the Massachusetts General Hospital 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 MASSACHUSETTS GENERAL HOSPITAL 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    Contains the implementation of the MneRtClient class.\n*\n*\/\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"mnertclient.h\"\n#include \"mnertclientproducer.h\"\n\n#include \"FormFiles\/mnertclientsetupwidget.h\"\n\n#include <utils\/ioutils.h>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtCore\/QtPlugin>\n#include <QtCore\/QTextStream>\n#include <QtCore\/QFile>\n\n#include <QList>\n#include <QDebug>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace MneRtClientPlugin;\nusing namespace UTILSLIB;\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ DEFINE MEMBER METHODS\n\/\/=============================================================================================================\n\nMneRtClient::MneRtClient()\n: m_sMneRtClientClientAlias(\"mne-x\")\n, m_pRtCmdClient(NULL)\n, m_pMneRtClientProducer(new MneRtClientProducer(this))\n, m_sMneRtClientIP(\"127.0.0.1\")\/\/(\"172.21.16.88\")\/\/(\"127.0.0.1\")\n, m_bCmdClientIsConnected(false)\n, m_iBufferSize(-1)\n, m_pRawMatrixBuffer_In(0)\n\/*m_pRTMSA_MneRtClient(0)*\/\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nMneRtClient::~MneRtClient()\n{\n    if(this->isRunning())\n        stop();\n    if(m_pMneRtClientProducer->isRunning())\n        m_pMneRtClientProducer->stop();\n}\n\n\n\/\/*************************************************************************************************************\n\nQSharedPointer<IPlugin> MneRtClient::clone() const\n{\n    QSharedPointer<MneRtClient> pMneRtClientClone(new MneRtClient());\n    return pMneRtClientClone;\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::init()\n{\n    \/\/ Start MneRtClientProducer\n    m_pMneRtClientProducer->start();\n\n\n\/\/    \/\/Convinience CMD connection timer --> ToDo get rid of that -> it interrupts acquistion when not connected\n\/\/    connect(&m_cmdConnectionTimer, &QTimer::timeout, this, &MneRtClient::connectCmdClient);\n\n    \/\/init channels when fiff info is available\n    connect(this, &MneRtClient::fiffInfoAvailable, this, &MneRtClient::initConnector);\n\n\/\/    \/\/Start convinience timer\n\/\/    m_cmdConnectionTimer.start(5000);\n\n    \/\/Try to connect the cmd client on start up using localhost connection\n    this->connectCmdClient();\n}\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ Create measurement instances and config them\n\/\/=============================================================================================================\n\nvoid MneRtClient::initConnector()\n{\n\n\n    qDebug() << \"MneRtClient::init()\";\n\n\/\/    if(m_pFiffInfo)\n\/\/    {\n\/\/\/\/        m_pFiffInfo->sfreq \/= 100;\n\/\/        m_pRTMSA_MneRtClient = addProviderRealTimeMultiSampleArray_New(MSR_ID::MEGMNERTCLIENT_OUTPUT);\n\/\/        m_pRTMSA_MneRtClient->initFromFiffInfo(m_pFiffInfo);\n\/\/        m_pRTMSA_MneRtClient->setMultiArraySize(10);\n\/\/    }\n\n\n    if(m_pFiffInfo)\n    {\n        m_pRTMSA_MneRtClient = PluginOutputData<NewRealTimeMultiSampleArray>::create(this, \"RtClient\", \"MNE Rt Client\");\n\n        m_pRTMSA_MneRtClient->data()->initFromFiffInfo(m_pFiffInfo);\n        m_pRTMSA_MneRtClient->data()->setMultiArraySize(10);\n\n        m_pRTMSA_MneRtClient->data()->setVisibility(true);\n\n        m_outputConnectors.append(m_pRTMSA_MneRtClient);\n    }\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::changeConnector(qint32 p_iNewConnectorId)\n{\n    if(p_iNewConnectorId != m_iActiveConnectorId)\n    {\n        \/\/ read meas info\n        (*m_pRtCmdClient)[\"selcon\"].pValues()[0].setValue(p_iNewConnectorId);\n        (*m_pRtCmdClient)[\"selcon\"].send();\n\n        m_iActiveConnectorId = p_iNewConnectorId;\n\n        \/\/ clear all and request everything new\n        clear();\n\n        \/\/\n        \/\/ request available commands\n        \/\/\n        m_pRtCmdClient->requestCommands();\n\n        \/\/\n        \/\/ Read Info\n        \/\/\n        if(!m_pFiffInfo)\n            requestInfo();\n\n        \/\/\n        \/\/ Read Buffer Size\n        \/\/\n        m_iBufferSize = m_pRtCmdClient->requestBufsize();\n\n        emit cmdConnectionChanged(m_bCmdClientIsConnected);\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::clear()\n{\n    m_pFiffInfo.reset();\n    m_iBufferSize = -1;\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::connectCmdClient()\n{\n    if(m_pRtCmdClient.isNull())\n        m_pRtCmdClient = QSharedPointer<RtCmdClient>(new RtCmdClient);\n    else if(m_bCmdClientIsConnected)\n        this->disconnectCmdClient();\n\n    m_pRtCmdClient->connectToHost(m_sMneRtClientIP);\n    m_pRtCmdClient->waitForConnected(1000);\n\n    if(m_pRtCmdClient->state() == QTcpSocket::ConnectedState)\n    {\n        rtServerMutex.lock();\n\n        \/\/Stop convinience timer\n\/\/        m_cmdConnectionTimer.stop();\n\n        if(!m_bCmdClientIsConnected)\n        {\n            \/\/\n            \/\/ request available commands\n            \/\/\n            m_pRtCmdClient->requestCommands();\n\n            \/\/\n            \/\/ set cmd client is connected\n            \/\/\n            m_bCmdClientIsConnected = true;\n\n            \/\/\n            \/\/ Read Info\n            \/\/\n            if(!m_pFiffInfo)\n                requestInfo();\n\n            \/\/\n            \/\/ Read Connectors\n            \/\/\n            if(m_qMapConnectors.size() == 0)\n                m_iActiveConnectorId = m_pRtCmdClient->requestConnectors(m_qMapConnectors);\n\n            \/\/\n            \/\/ Read Buffer Size\n            \/\/\n            m_iBufferSize = m_pRtCmdClient->requestBufsize();\n\n            emit cmdConnectionChanged(m_bCmdClientIsConnected);\n        }\n        rtServerMutex.unlock();\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::disconnectCmdClient()\n{\n    if(m_bCmdClientIsConnected)\n    {\n        m_pRtCmdClient->disconnectFromHost();\n        m_pRtCmdClient->waitForDisconnected();\n        rtServerMutex.lock();\n        m_bCmdClientIsConnected = false;\n        rtServerMutex.unlock();\n        emit cmdConnectionChanged(m_bCmdClientIsConnected);\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::requestInfo()\n{\n    if(m_pMneRtClientProducer->m_iDataClientId > -1 && m_bCmdClientIsConnected)\n    {\n        \/\/ read meas info\n        (*m_pRtCmdClient)[\"measinfo\"].pValues()[0].setValue(m_pMneRtClientProducer->m_iDataClientId);\n        (*m_pRtCmdClient)[\"measinfo\"].send();\n\n        m_pMneRtClientProducer->producerMutex.lock();\n        m_pMneRtClientProducer->m_bFlagInfoRequest = true;\n        m_pMneRtClientProducer->producerMutex.unlock();\n    }\n    else\n        qWarning() << \"MneRtClientProducer is not connected!\";\n}\n\n\n\/\/*************************************************************************************************************\n\nbool MneRtClient::start()\n{\n    if(m_bCmdClientIsConnected && m_pFiffInfo)\n    {\n        \/\/ Initialize real time measurements\n        init();\n\n        \/\/Set buffer size\n        (*m_pRtCmdClient)[\"bufsize\"].pValues()[0].setValue(m_iBufferSize);\n        (*m_pRtCmdClient)[\"bufsize\"].send();\n\n        \/\/ Buffer\n        m_pRawMatrixBuffer_In = QSharedPointer<RawMatrixBuffer>(new RawMatrixBuffer(8,m_pFiffInfo->nchan,m_iBufferSize));\n\n        \/\/ Start threads\n        QThread::start();\n\n        \/\/ Start Measurement at rt_Server\n        \/\/ start measurement\n        (*m_pRtCmdClient)[\"start\"].pValues()[0].setValue(m_pMneRtClientProducer->m_iDataClientId);\n        (*m_pRtCmdClient)[\"start\"].send();\n\n        m_pMneRtClientProducer->producerMutex.lock();\n        m_pMneRtClientProducer->m_bFlagMeasuring = true;\n        m_pMneRtClientProducer->producerMutex.unlock();\n        m_pMneRtClientProducer->start();\n\n        return true;\n    }\n    else\n        return false;\n}\n\n\n\/\/*************************************************************************************************************\n\nbool MneRtClient::stop()\n{\n    if(m_bCmdClientIsConnected) \/\/ToDo replace this with is running\n    {\n        \/\/ Stop Measurement at rt_Server\n        (*m_pRtCmdClient)[\"stop-all\"].send();\n\n        m_pMneRtClientProducer->producerMutex.lock();\n        m_pMneRtClientProducer->m_bFlagMeasuring = false;\n        m_pMneRtClientProducer->producerMutex.unlock();\n    }\n\n    \/\/ Stop threads\n    QThread::terminate();\n    QThread::wait();\n\n    \/\/Clear Buffers\n    m_pRawMatrixBuffer_In->clear();\n\n    return true;\n}\n\n\n\/\/*************************************************************************************************************\n\nIPlugin::PluginType MneRtClient::getType() const\n{\n    return _ISensor;\n}\n\n\n\/\/*************************************************************************************************************\n\nQString MneRtClient::getName() const\n{\n    return \"RT Client\";\n}\n\n\n\/\/*************************************************************************************************************\n\nQWidget* MneRtClient::setupWidget()\n{\n    MneRtClientSetupWidget* widget = new MneRtClientSetupWidget(this);\/\/widget is later distroyed by CentralWidget - so it has to be created everytime new\n\n    \/\/init dialog\n\n    return widget;\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid MneRtClient::run()\n{\n\n    MatrixXf matValue;\n    while(true)\n    {\n        \/\/pop matrix\n        matValue = m_pRawMatrixBuffer_In->pop();\n\/\/        std::cout << \"matValue \" << matValue.block(0,0,1,10) << std::endl;\n\n        \/\/emit values\n        for(qint32 i = 0; i < matValue.cols(); ++i)\n            m_pRTMSA_MneRtClient->data()->setValue(matValue.col(i).cast<double>());\n\/\/        for(qint32 i = 0; i < matValue.cols(); i += 100)\n\/\/            m_pRTMSA_MneRtClient->setValue(matValue.col(i).cast<double>());\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (c) 2018 ARM Limited. All rights reserved.\n* SPDX-License-Identifier: Apache-2.0\n* Licensed under the Apache License, Version 2.0 (the License); you may\n* not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an AS IS BASIS, WITHOUT\n* WARRANTIES OR CONDITIONS OF 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* The test is based on the assumption that trng will generate random data, random so\n* there will not be any similar patterns in it, that kind of data will be impossible to\n* compress, if compression will occur the test will result in failure.\n*\n* The test is composed out of three parts:\n* the first, generate a trng buffer and try to compress it, at the end of first part\n* we will reset the device.\n* In second part we will generate a trng buffer with a different buffer size and try to\n* compress it.\n* In the third part we will again generate a trng buffer to see that the same trng output\n* is not generated as the stored trng buffer from part one (before reseting), the new trng data will\n* be concatenated to the trng data from the first part and then try to compress it\n* together, if there are similar patterns the compression will succeed.\n*\n* We need to store and load the first part data before and after reset, the mechanism\n* we chose is NVstore, mainly because its simplicity and the fact it is not platform\n* dependent, in case a specific board does not support NVstore we will use the\n* mbed greentea platform for sending and receving the data from the device to the\n* host running the test and back, the problem with this mechanism is that it doesn't handle\n* well certain characters, especially non ASCII ones, so we used the base64 algorithm\n* to ensure all characters will be transmitted correctly.\n*\/\n\n#include \"greentea-client\/test_env.h\"\n#include \"unity\/unity.h\"\n#include \"utest\/utest.h\"\n#include \"hal\/trng_api.h\"\n#include \"base64b.h\"\n#include \"nvstore.h\"\n#include \"pithy.h\"\n#include <stdio.h>\n\n#if !DEVICE_TRNG\n#error [NOT_SUPPORTED] TRNG API not supported for this target\n#endif\n\n#define MSG_VALUE_DUMMY                 \"0\"\n#define MSG_VALUE_LEN                   64\n#define MSG_KEY_LEN                     32\n\n#define BUFFER_LEN                      (MSG_VALUE_LEN\/2)\n\n#define MSG_TRNG_READY                  \"ready\"\n#define MSG_TRNG_BUFFER                 \"buffer\"\n#define MSG_TRNG_EXIT                   \"exit\"\n\n#define MSG_TRNG_TEST_STEP1             \"check_step1\"\n#define MSG_TRNG_TEST_STEP2             \"check_step2\"\n#define MSG_TRNG_TEST_SUITE_ENDED       \"Test_suite_ended\"\n\n#define RESULT_SUCCESS                  0\n\n#define NVKEY                           1                  \/\/NVstore key for storing and loading data\n\n\/*there are some issues with nvstore and greentea reset, so for now nvstore is disabled,\n *When solved delete current define and replace all NVSTORE_RESET with NVSTORE_ENABLED*\/\n#define NVSTORE_RESET                   (NVSTORE_ENABLED & 0)\n\nusing namespace utest::v1;\n\nstatic int fill_buffer_trng(uint8_t *buffer, trng_t *trng_obj, size_t trng_len)\n{\n    size_t temp_size = 0, output_length = 0;\n    int trng_res = 0;\n    uint8_t *temp_in_buf = buffer;\n\n    trng_init(trng_obj);\n    memset(buffer, 0, BUFFER_LEN);\n\n    while (true) {\n        trng_res = trng_get_bytes(trng_obj, temp_in_buf, trng_len - temp_size, &output_length);\n        TEST_ASSERT_EQUAL_INT_MESSAGE(0, trng_res, \"trng_get_bytes error!\");\n        temp_size += output_length;\n        temp_in_buf += output_length;\n        trng_len -= output_length;\n        if (temp_size >= trng_len) {\n            break;\n        }\n    }\n\n    temp_in_buf = NULL;\n    trng_free(trng_obj);\n    return 0;\n}\n\nstatic void compress_and_compare(char *key, char *value)\n{\n    trng_t trng_obj;\n    uint8_t *out_comp_buf, *buffer;\n    uint8_t *input_buf, *temp_buf;\n    size_t comp_sz = 0;\n    unsigned int result = 0;\n\n#define OUT_COMP_BUF_SIZE ((BUFFER_LEN * 5) + 32)\n#define TEMP_BUF_SIZE (BUFFER_LEN * 2)\n\n    out_comp_buf = new uint8_t[OUT_COMP_BUF_SIZE];\n    buffer = new uint8_t[BUFFER_LEN];\n    input_buf = new uint8_t[BUFFER_LEN * 4];\n    temp_buf = new uint8_t[BUFFER_LEN * 2];\n\n#if NVSTORE_RESET\n    NVStore& nvstore = NVStore::get_instance();\n#endif\n\n    \/*At the begining of step 2 load trng buffer from step 1*\/\n    if (strcmp(key, MSG_TRNG_TEST_STEP2) == 0) {\n#if NVSTORE_RESET\n        uint16_t actual = 0;\n        result = nvstore.get(NVKEY, BUFFER_LEN, buffer, actual);\n        TEST_ASSERT_EQUAL(RESULT_SUCCESS, result);\n#else\n        \/*Using base64 to decode data sent from host*\/\n        \n        uint32_t lengthWritten = 0;\n        uint32_t charsProcessed = 0;\n        result = trng_DecodeNBase64((const char *)value,\n                                    MSG_VALUE_LEN, \n                                    buffer,\n                                    BUFFER_LEN,\n                                    &lengthWritten,\n                                    &charsProcessed);\n        TEST_ASSERT_EQUAL(0, result);\n#endif\n        memcpy(input_buf, buffer, BUFFER_LEN);\n    }\n\n    if (strcmp(key, MSG_TRNG_TEST_STEP1) == 0) {\n        \/*Fill buffer with trng values*\/\n        result = fill_buffer_trng(buffer, &trng_obj, BUFFER_LEN);\n        TEST_ASSERT_EQUAL(0, result);\n        memcpy(input_buf, buffer, BUFFER_LEN);\n    }\n    \/*pithy_Compress will try to compress the random data, if it succeeded it means the data is not really random*\/\n    else if (strcmp(key, MSG_TRNG_TEST_STEP2) == 0) {\n\n        comp_sz = pithy_Compress((char *)buffer,\n                                 BUFFER_LEN,\n                                 (char *)out_comp_buf,\n                                 OUT_COMP_BUF_SIZE,\n                                 9);\n        TEST_ASSERT_MESSAGE(comp_sz > BUFFER_LEN,\n                        \"TRNG_TEST_STEP1: trng_get_bytes was able to compress thus not random\");\n\n        \/*pithy_Compress will try to compress the random data with a different buffer sizem*\/\n        result = fill_buffer_trng(temp_buf, &trng_obj, TEMP_BUF_SIZE);\n        TEST_ASSERT_EQUAL(0, result);\n\n        comp_sz = pithy_Compress((char *)temp_buf,\n                                 TEMP_BUF_SIZE,\n                                 (char *)out_comp_buf,\n                                 OUT_COMP_BUF_SIZE,\n                                 9);\n        TEST_ASSERT_MESSAGE(comp_sz > TEMP_BUF_SIZE,\n                        \"TRNG_TEST_STEP2: trng_get_bytes was able to compress thus not random\");\n\n        memcpy(input_buf + BUFFER_LEN, temp_buf, TEMP_BUF_SIZE);\n        \/*pithy_Compress will try to compress the random data from before reset concatenated with new random data*\/\n        comp_sz = pithy_Compress((char *)input_buf,\n                                 TEMP_BUF_SIZE + BUFFER_LEN,\n                                 (char *)out_comp_buf,\n                                 OUT_COMP_BUF_SIZE,\n                                 9);\n        TEST_ASSERT_MESSAGE(comp_sz > TEMP_BUF_SIZE + BUFFER_LEN,\n                        \"TRNG_TEST_STEP3: concatenated buffer after reset was able to compress thus not random\");\n        greentea_send_kv(MSG_TRNG_TEST_SUITE_ENDED, MSG_VALUE_DUMMY);\n    }\n\n    \/*At the end of step 1 store trng buffer and reset the device*\/\n    if (strcmp(key, MSG_TRNG_TEST_STEP1) == 0) {\n        int result = 0;\n#if NVSTORE_RESET\n        result = nvstore.set(NVKEY, BUFFER_LEN, buffer);\n        TEST_ASSERT_EQUAL(RESULT_SUCCESS, result);\n#else\n        \/*Using base64 to encode data sending from host*\/\n        result = trng_EncodeBase64(buffer, \n                                   BUFFER_LEN, \n                                   (char *)out_comp_buf, \n                                   OUT_COMP_BUF_SIZE);\n        TEST_ASSERT_EQUAL(RESULT_SUCCESS, result);\n\n        greentea_send_kv(MSG_TRNG_BUFFER, (const char *)out_comp_buf);\n#endif\n    }\n\n    delete[] out_comp_buf;\n    delete[] buffer;\n    delete[] input_buf;\n    delete[] temp_buf;\n}\n\n\/*This method call first and second steps, it directs by the key received from the host*\/\nvoid trng_test()\n{\n    greentea_send_kv(MSG_TRNG_READY, MSG_VALUE_DUMMY);\n\n    char key[MSG_KEY_LEN + 1] = { };\n    char *value = new char[MSG_VALUE_LEN + 1];\n    do {\n        memset(key, 0, MSG_KEY_LEN + 1);\n        memset(value, 0, MSG_VALUE_LEN + 1);\n\n        greentea_parse_kv(key, value, MSG_KEY_LEN, MSG_VALUE_LEN);\n\n        if (strcmp(key, MSG_TRNG_TEST_STEP1) == 0) {\n            \/*create trng data buffer and try to compress it, store it for later checks*\/\n            compress_and_compare(key, value);\n        }\n\n        if (strcmp(key, MSG_TRNG_TEST_STEP2) == 0) {\n            \/*create another trng data buffer and concatenate it to the stored trng data buffer\n            try to compress them both*\/\n            compress_and_compare(key, value);\n        }\n    } while (strcmp(key, MSG_TRNG_EXIT) != 0);\n\n    delete[] value;\n}\n\nCase cases[] = {\n    Case(\"TRNG: trng_test\", trng_test),\n};\n\nutest::v1::status_t greentea_test_setup(const size_t number_of_cases)\n{\n    GREENTEA_SETUP(100, \"trng_reset\");\n    return greentea_test_setup_handler(number_of_cases);\n}\n\nSpecification specification(greentea_test_setup, cases, greentea_test_teardown_handler);\n\nint main()\n{\n    bool ret = !Harness::run(specification);\n\n    return ret;\n}\n<commit_msg>Remove NVstore unused mechanism<commit_after>\/*\n* Copyright (c) 2018 ARM Limited. All rights reserved.\n* SPDX-License-Identifier: Apache-2.0\n* Licensed under the Apache License, Version 2.0 (the License); you may\n* not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an AS IS BASIS, WITHOUT\n* WARRANTIES OR CONDITIONS OF 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* The test is based on the assumption that trng will generate random data, random so\n* there will not be any similar patterns in it, that kind of data will be impossible to\n* compress, if compression will occur the test will result in failure.\n*\n* The test is composed out of three parts:\n* the first, generate a trng buffer and try to compress it, at the end of first part\n* we will reset the device.\n* In second part we will generate a trng buffer with a different buffer size and try to\n* compress it.\n* In the third part we will again generate a trng buffer to see that the same trng output\n* is not generated as the stored trng buffer from part one (before reseting), the new trng data will\n* be concatenated to the trng data from the first part and then try to compress it\n* together, if there are similar patterns the compression will succeed.\n*\n* We need to store and load the first part data before and after reset, the mechanism\n* we will use is the mbed greentea platform for sending and receving the data from the device\n* to the host running the test and back, the problem with this mechanism is that it doesn't\n* handle well certain characters, especially non ASCII ones, so we use the base64 algorithm\n* to ensure all characters will be transmitted correctly.\n*\/\n\n#include \"greentea-client\/test_env.h\"\n#include \"unity\/unity.h\"\n#include \"utest\/utest.h\"\n#include \"hal\/trng_api.h\"\n#include \"base64b.h\"\n#include \"pithy.h\"\n#include <stdio.h>\n\n#if !DEVICE_TRNG\n#error [NOT_SUPPORTED] TRNG API not supported for this target\n#endif\n\n#define MSG_VALUE_DUMMY                 \"0\"\n#define MSG_VALUE_LEN                   64\n#define MSG_KEY_LEN                     32\n\n#define BUFFER_LEN                      (MSG_VALUE_LEN\/2)\n\n#define MSG_TRNG_READY                  \"ready\"\n#define MSG_TRNG_BUFFER                 \"buffer\"\n#define MSG_TRNG_EXIT                   \"exit\"\n\n#define MSG_TRNG_TEST_STEP1             \"check_step1\"\n#define MSG_TRNG_TEST_STEP2             \"check_step2\"\n#define MSG_TRNG_TEST_SUITE_ENDED       \"Test_suite_ended\"\n\n#define RESULT_SUCCESS                  0\n\nusing namespace utest::v1;\n\nstatic int fill_buffer_trng(uint8_t *buffer, trng_t *trng_obj, size_t trng_len)\n{\n    size_t temp_size = 0, output_length = 0;\n    int trng_res = 0;\n    uint8_t *temp_in_buf = buffer;\n\n    trng_init(trng_obj);\n    memset(buffer, 0, BUFFER_LEN);\n\n    while (true) {\n        trng_res = trng_get_bytes(trng_obj, temp_in_buf, trng_len - temp_size, &output_length);\n        TEST_ASSERT_EQUAL_INT_MESSAGE(0, trng_res, \"trng_get_bytes error!\");\n        temp_size += output_length;\n        temp_in_buf += output_length;\n        trng_len -= output_length;\n        if (temp_size >= trng_len) {\n            break;\n        }\n    }\n\n    temp_in_buf = NULL;\n    trng_free(trng_obj);\n    return 0;\n}\n\nstatic void compress_and_compare(char *key, char *value)\n{\n    trng_t trng_obj;\n    uint8_t *out_comp_buf, *buffer;\n    uint8_t *input_buf, *temp_buf;\n    size_t comp_sz = 0;\n    unsigned int result = 0;\n\n#define OUT_COMP_BUF_SIZE ((BUFFER_LEN * 5) + 32)\n#define TEMP_BUF_SIZE (BUFFER_LEN * 2)\n\n    out_comp_buf = new uint8_t[OUT_COMP_BUF_SIZE];\n    buffer = new uint8_t[BUFFER_LEN];\n    input_buf = new uint8_t[BUFFER_LEN * 4];\n    temp_buf = new uint8_t[BUFFER_LEN * 2];\n\n    \/*At the begining of step 2 load trng buffer from step 1*\/\n    if (strcmp(key, MSG_TRNG_TEST_STEP2) == 0) {\n        \/*Using base64 to decode data sent from host*\/\n        uint32_t lengthWritten = 0;\n        uint32_t charsProcessed = 0;\n        result = trng_DecodeNBase64((const char *)value,\n                                    MSG_VALUE_LEN, \n                                    buffer,\n                                    BUFFER_LEN,\n                                    &lengthWritten,\n                                    &charsProcessed);\n        TEST_ASSERT_EQUAL(0, result);\n        memcpy(input_buf, buffer, BUFFER_LEN);\n    }\n\n    if (strcmp(key, MSG_TRNG_TEST_STEP1) == 0) {\n        \/*Fill buffer with trng values*\/\n        result = fill_buffer_trng(buffer, &trng_obj, BUFFER_LEN);\n        TEST_ASSERT_EQUAL(0, result);\n        memcpy(input_buf, buffer, BUFFER_LEN);\n    }\n    \/*pithy_Compress will try to compress the random data, if it succeeded it means the data is not really random*\/\n    else if (strcmp(key, MSG_TRNG_TEST_STEP2) == 0) {\n\n        comp_sz = pithy_Compress((char *)buffer,\n                                 BUFFER_LEN,\n                                 (char *)out_comp_buf,\n                                 OUT_COMP_BUF_SIZE,\n                                 9);\n        TEST_ASSERT_MESSAGE(comp_sz > BUFFER_LEN,\n                        \"TRNG_TEST_STEP1: trng_get_bytes was able to compress thus not random\");\n\n        \/*pithy_Compress will try to compress the random data with a different buffer sizem*\/\n        result = fill_buffer_trng(temp_buf, &trng_obj, TEMP_BUF_SIZE);\n        TEST_ASSERT_EQUAL(0, result);\n\n        comp_sz = pithy_Compress((char *)temp_buf,\n                                 TEMP_BUF_SIZE,\n                                 (char *)out_comp_buf,\n                                 OUT_COMP_BUF_SIZE,\n                                 9);\n        TEST_ASSERT_MESSAGE(comp_sz > TEMP_BUF_SIZE,\n                        \"TRNG_TEST_STEP2: trng_get_bytes was able to compress thus not random\");\n\n        memcpy(input_buf + BUFFER_LEN, temp_buf, TEMP_BUF_SIZE);\n        \/*pithy_Compress will try to compress the random data from before reset concatenated with new random data*\/\n        comp_sz = pithy_Compress((char *)input_buf,\n                                 TEMP_BUF_SIZE + BUFFER_LEN,\n                                 (char *)out_comp_buf,\n                                 OUT_COMP_BUF_SIZE,\n                                 9);\n        TEST_ASSERT_MESSAGE(comp_sz > TEMP_BUF_SIZE + BUFFER_LEN,\n                        \"TRNG_TEST_STEP3: concatenated buffer after reset was able to compress thus not random\");\n        greentea_send_kv(MSG_TRNG_TEST_SUITE_ENDED, MSG_VALUE_DUMMY);\n    }\n\n    \/*At the end of step 1 store trng buffer and reset the device*\/\n    if (strcmp(key, MSG_TRNG_TEST_STEP1) == 0) {\n        int result = 0;\n        \/*Using base64 to encode data sending from host*\/\n        result = trng_EncodeBase64(buffer, \n                                   BUFFER_LEN, \n                                   (char *)out_comp_buf, \n                                   OUT_COMP_BUF_SIZE);\n        TEST_ASSERT_EQUAL(RESULT_SUCCESS, result);\n\n        greentea_send_kv(MSG_TRNG_BUFFER, (const char *)out_comp_buf);\n    }\n\n    delete[] out_comp_buf;\n    delete[] buffer;\n    delete[] input_buf;\n    delete[] temp_buf;\n}\n\n\/*This method call first and second steps, it directs by the key received from the host*\/\nvoid trng_test()\n{\n    greentea_send_kv(MSG_TRNG_READY, MSG_VALUE_DUMMY);\n\n    char key[MSG_KEY_LEN + 1] = { };\n    char *value = new char[MSG_VALUE_LEN + 1];\n    do {\n        memset(key, 0, MSG_KEY_LEN + 1);\n        memset(value, 0, MSG_VALUE_LEN + 1);\n\n        greentea_parse_kv(key, value, MSG_KEY_LEN, MSG_VALUE_LEN);\n\n        if (strcmp(key, MSG_TRNG_TEST_STEP1) == 0) {\n            \/*create trng data buffer and try to compress it, store it for later checks*\/\n            compress_and_compare(key, value);\n        }\n\n        if (strcmp(key, MSG_TRNG_TEST_STEP2) == 0) {\n            \/*create another trng data buffer and concatenate it to the stored trng data buffer\n            try to compress them both*\/\n            compress_and_compare(key, value);\n        }\n    } while (strcmp(key, MSG_TRNG_EXIT) != 0);\n\n    delete[] value;\n}\n\nCase cases[] = {\n    Case(\"TRNG: trng_test\", trng_test),\n};\n\nutest::v1::status_t greentea_test_setup(const size_t number_of_cases)\n{\n    GREENTEA_SETUP(100, \"trng_reset\");\n    return greentea_test_setup_handler(number_of_cases);\n}\n\nSpecification specification(greentea_test_setup, cases, greentea_test_teardown_handler);\n\nint main()\n{\n    bool ret = !Harness::run(specification);\n\n    return ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ConnectionApi_p.hpp\"\n\n#include \"AccountStorage.hpp\"\n#include \"ClientBackend.hpp\"\n#include \"ClientConnection.hpp\"\n#include \"ClientRpcLayer.hpp\"\n#include \"ClientSettings.hpp\"\n#include \"CTelegramTransport.hpp\"\n#include \"CClientTcpTransport.hpp\"\n#include \"DataStorage.hpp\"\n\n#include \"Operations\/ClientAuthOperation_p.hpp\"\n#include \"Operations\/ClientPingOperation.hpp\"\n#include \"Operations\/ConnectionOperation.hpp\"\n\n#include <QLoggingCategory>\n\nQ_LOGGING_CATEGORY(c_connectionApiLoggingCategory, \"telegram.client.api.connection\", QtWarningMsg)\n\nnamespace Telegram {\n\nnamespace Client {\n\nConnectionApiPrivate::ConnectionApiPrivate(ConnectionApi *parent) :\n    ClientApiPrivate(parent)\n{\n}\n\nConnectionApiPrivate *ConnectionApiPrivate::get(ConnectionApi *parent)\n{\n    return reinterpret_cast<ConnectionApiPrivate*>(parent->d);\n}\n\nbool ConnectionApiPrivate::isSignedIn() const\n{\n    switch (m_status) {\n    case ConnectionApi::StatusConnected:\n    case ConnectionApi::StatusReady:\n        return true;\n    case ConnectionApi::StatusDisconnected:\n    case ConnectionApi::StatusConnecting:\n    case ConnectionApi::StatusWaitForAuthentication:\n        return false;\n    }\n    Q_UNREACHABLE();\n}\n\nConnection *ConnectionApiPrivate::getDefaultConnection()\n{\n    if (mainConnection()) {\n        return mainConnection();\n    }\n\n    if (m_initialConnectOperation) {\n        return m_initialConnectOperation->connection();\n    }\n    return nullptr;\n}\n\nConnection *ConnectionApiPrivate::mainConnection()\n{\n    return m_mainConnection;\n}\n\nvoid ConnectionApiPrivate::setMainConnection(Connection *connection)\n{\n    m_mainConnection = connection;\n    connect(m_mainConnection, &BaseConnection::statusChanged, this, &ConnectionApiPrivate::onMainConnectionStatusChanged);\n    onMainConnectionStatusChanged(connection->status(), Connection::StatusReason::Local);\n}\n\nPendingOperation *ConnectionApiPrivate::connectToServer(const QVector<DcOption> &dcOptions)\n{\n    if (m_initialConnectOperation) {\n        if (dcOptions.contains(m_initialConnectOperation->connection()->dcOption())) {\n            switch (m_initialConnectOperation->connection()->status()) {\n            case BaseConnection::Status::Connecting:\n            case BaseConnection::Status::Connected:\n            case BaseConnection::Status::HasDhKey:\n            case BaseConnection::Status::Signed:\n                return m_initialConnectOperation;\n            default:\n                m_initialConnectOperation->connection()->transport()->disconnectFromHost();\n                break;\n            }\n        }\n        m_initialConnectOperation->deleteLater();\n        m_initialConnectOperation = nullptr;\n    }\n\n    if (mainConnection()) {\n        if (mainConnection()->status() != Connection::Status::Disconnected) {\n            return PendingOperation::failOperation<PendingOperation>\n                    (QStringLiteral(\"Connection is already in progress\"), this);\n        } else {\n            \/\/ TODO!\n        }\n    }\n\n    if (!backend()->accountStorage()) {\n        return PendingOperation::failOperation<PendingOperation>\n                (QStringLiteral(\"Account storage is missing\"), this);\n    }\n    if (!backend()->dataStorage()) {\n        return PendingOperation::failOperation<PendingOperation>\n                (QStringLiteral(\"Data storage is missing\"), this);\n    }\n\n    Connection *connection = createConnection(dcOptions.first());\n    connect(connection, &BaseConnection::statusChanged,\n            this, &ConnectionApiPrivate::onInitialConnectionStatusChanged);\n\n    m_initialConnectOperation = connection->connectToDc();\n    connect(m_initialConnectOperation, &PendingOperation::finished, this, &ConnectionApiPrivate::onInitialConnectOperationFinished);\n    return m_initialConnectOperation;\n}\n\nAuthOperation *ConnectionApiPrivate::startAuthentication()\n{\n    QVariantHash errorDetails = getBackendSetupErrorDetails();\n    if (!errorDetails.isEmpty()) {\n        return PendingOperation::failOperation<AuthOperation>(errorDetails, this);\n    }\n\n    if (isSignedIn()) {\n        return PendingOperation::failOperation<AuthOperation>\n                (QStringLiteral(\"Already signed in\"), this);\n    }\n    if (m_authOperation && !m_authOperation->isFinished()) {\n        return PendingOperation::failOperation<AuthOperation>\n                (QStringLiteral(\"Auth operation is already in progress\"), this);\n    }\n\n    m_authOperation = new AuthOperation(this);\n    AuthOperationPrivate *priv = AuthOperationPrivate::get(m_authOperation);\n    priv->setBackend(backend());\n    priv->setRunMethod(&AuthOperation::requestAuthCode);\n    connect(m_authOperation, &AuthOperation::finished, this, &ConnectionApiPrivate::onAuthFinished);\n    connect(m_authOperation, &AuthOperation::authCodeRequired, this, &ConnectionApiPrivate::onAuthCodeRequired);\n    PendingOperation *connectionOperation = connectToServer(backend()->settings()->serverConfiguration());\n    m_authOperation->runAfter(connectionOperation);\n    return m_authOperation;\n}\n\nAuthOperation *ConnectionApiPrivate::checkIn()\n{\n    QVariantHash errorDetails = getBackendSetupErrorDetails();\n    if (!errorDetails.isEmpty()) {\n        qCWarning(c_connectionApiLoggingCategory) << \"Unable to initiate connection:\" << errorDetails;\n        return nullptr;\n    }\n\n    if (m_authOperation && !m_authOperation->isFinished()) {\n        return PendingOperation::failOperation<AuthOperation>\n                (QStringLiteral(\"Auth operation is already in progress\"), this);\n    }\n    AccountStorage *accountStorage = backend()->accountStorage();\n    if (!accountStorage || !accountStorage->hasMinimalDataSet()) {\n        return PendingOperation::failOperation<AuthOperation>\n                (QStringLiteral(\"No minimal account data set\"), this);\n    }\n    m_authOperation = new AuthOperation(this);\n    AuthOperationPrivate *priv = AuthOperationPrivate::get(m_authOperation);\n    priv->setBackend(backend());\n    priv->setRunMethod(&AuthOperation::checkAuthorization);\n    connect(m_authOperation, &AuthOperation::finished, this, &ConnectionApiPrivate::onAuthFinished);\n    PendingOperation *connectionOperation = connectToServer({accountStorage->dcInfo()});\n    m_authOperation->runAfter(connectionOperation);\n    m_initialConnectOperation->connection()->setAuthKey(accountStorage->authKey());\n    m_initialConnectOperation->connection()->rpcLayer()->setSessionData(\n                accountStorage->sessionId(),\n                accountStorage->contentRelatedMessagesNumber());\n    return m_authOperation;\n}\n\nQVariantHash ConnectionApiPrivate::getBackendSetupErrorDetails() const\n{\n    if (!backend()->accountStorage()) {\n        return {{PendingOperation::c_text(), QStringLiteral(\"Account storage is missing\")}};\n    }\n    if (!backend()->dataStorage()) {\n        return {{PendingOperation::c_text(), QStringLiteral(\"Data storage is missing\")}};\n    }\n    Settings *settings = backend()->settings();\n    if (!settings) {\n        return {{PendingOperation::c_text(), QStringLiteral(\"Settings object is missing\")}};\n    }\n    if (!settings->isValid()) {\n        return {{PendingOperation::c_text(), QStringLiteral(\"Invalid settings\")}};\n    }\n    return {};\n}\n\nConnection *ConnectionApiPrivate::createConnection(const DcOption &dcOption)\n{\n    Connection *connection = new Connection(this);\n    connection->setDcOption(dcOption);\n    connection->rpcLayer()->setAppInformation(backend()->m_appInformation);\n    connection->rpcLayer()->installUpdatesHandler(backend()->updatesApi());\n    connection->setDeltaTime(backend()->accountStorage()->deltaTime());\n\n    Settings *settings = backend()->m_settings;\n    connection->setServerRsaKey(settings->serverRsaKey());\n    TcpTransport *transport = new TcpTransport(connection);\n    transport->setProxy(settings->proxy());\n\n    switch (settings->preferedSessionType()) {\n    case Settings::SessionType::None:\n        qCWarning(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Session type is not set. Use fallback.\";\n        transport->setPreferedSessionType(TcpTransport::Obfuscated);\n        break;\n    case Settings::SessionType::Abridged:\n        transport->setPreferedSessionType(TcpTransport::Abridged);\n        break;\n    case Settings::SessionType::Obfuscated:\n        transport->setPreferedSessionType(TcpTransport::Obfuscated);\n        break;\n    }\n    connection->setTransport(transport);\n    return connection;\n}\n\nConnection *ConnectionApiPrivate::ensureConnection(const ConnectionSpec &connectionSpec)\n{\n    qCDebug(c_connectionApiLoggingCategory) << Q_FUNC_INFO << connectionSpec.dcId << connectionSpec.flags;\n    ConnectionSpec spec = connectionSpec;\n    spec.flags |= ConnectionSpec::RequestFlag::Ipv4Only; \/\/ Enable only ipv4 for now\n    if (!m_connections.contains(connectionSpec)) {\n        const DcOption opt = backend()->dataStorage()->serverConfiguration().getOption(spec);\n        if (!opt.isValid()) {\n            qCWarning(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Unable to find suitable DC\";\n            return nullptr;\n        }\n        m_connections.insert(connectionSpec, createConnection(opt));\n    }\n    return m_connections.value(connectionSpec);\n}\n\nvoid ConnectionApiPrivate::onInitialConnectOperationFinished(PendingOperation *operation)\n{\n    disconnect(m_initialConnectOperation->connection(), &BaseConnection::statusChanged,\n               this, &ConnectionApiPrivate::onInitialConnectionStatusChanged);\n\n    if (operation->isSucceeded()) {\n        backend()->getDcConfig();\n        return;\n    }\n    m_initialConnectOperation = nullptr;\n    operation->deleteLater();\n    setStatus(ConnectionApi::StatusDisconnected);\n}\n\nvoid ConnectionApiPrivate::onInitialConnectionStatusChanged(BaseConnection::Status status,\n                                                             BaseConnection::StatusReason reason)\n{\n    qCDebug(c_connectionApiLoggingCategory) << Q_FUNC_INFO << status << reason;\n    switch (status) {\n    case BaseConnection::Status::Disconnected:\n    case BaseConnection::Status::Disconnecting:\n        setStatus(ConnectionApi::StatusDisconnected);\n        break;\n    case BaseConnection::Status::Connecting:\n        setStatus(ConnectionApi::StatusConnecting);\n        break;\n    case BaseConnection::Status::Connected:\n        \/\/ Nothing to do; wait for DH\n        break;\n    case BaseConnection::Status::HasDhKey:\n        break;\n    case BaseConnection::Status::Signed:\n    case BaseConnection::Status::Failed:\n        break;\n    }\n}\n\nvoid ConnectionApiPrivate::onAuthFinished(PendingOperation *operation)\n{\n    if (operation != m_authOperation) {\n        qCCritical(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Unexpected auth operation\";\n        return;\n    }\n    if (!operation->isSucceeded()) {\n        setStatus(ConnectionApi::StatusWaitForAuthentication);\n        qCDebug(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"TODO?\";\n        return;\n    }\n    AuthOperationPrivate *priv = AuthOperationPrivate::get(m_authOperation);\n    Connection *conn = priv->m_authenticatedConnection;\n    if (conn->status() != Connection::Status::Signed) {\n        qCCritical(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Unexpected connection status\" << conn->status();\n        return;\n    }\n    setMainConnection(conn);\n}\n\nvoid ConnectionApiPrivate::onAuthCodeRequired()\n{\n    setStatus(ConnectionApi::StatusWaitForAuthentication, ConnectionApi::StatusReasonRemote);\n}\n\nvoid ConnectionApiPrivate::onMainConnectionStatusChanged(BaseConnection::Status status, BaseConnection::StatusReason reason)\n{\n    if (!m_mainConnection) {\n        return;\n    }\n\n    const bool keepAliveIsWanted = (status == Connection::Status::Signed) || (status == Connection::Status::HasDhKey);\n    if (keepAliveIsWanted) {\n        if (!m_pingOperation) {\n            m_pingOperation = new PingOperation(this);\n            m_pingOperation->setSettings(backend()->m_settings);\n            m_pingOperation->setRpcLayer(m_mainConnection->rpcLayer());\n            connect(m_pingOperation, &PingOperation::pingFailed, this, &ConnectionApiPrivate::onPingFailed);\n        }\n        m_pingOperation->ensureActive();\n    } else {\n        if (m_pingOperation) {\n            m_pingOperation->ensureInactive();\n        }\n    }\n\n    switch (status) {\n    case Connection::Status::Signed:\n    {\n        backend()->syncAccountToStorage();\n        setStatus(ConnectionApi::StatusConnected);\n        PendingOperation *syncOperation = backend()->sync();\n        connect(syncOperation, &PendingOperation::finished, this, &ConnectionApiPrivate::onSyncFinished);\n        syncOperation->startLater();\n    }\n        break;\n    default:\n        break;\n    }\n}\n\nvoid ConnectionApiPrivate::onSyncFinished(PendingOperation *operation)\n{\n    if (operation->isSucceeded()) {\n        setStatus(ConnectionApi::StatusReady, ConnectionApi::StatusReasonLocal);\n    } else {\n        qCCritical(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Unexpected sync operation status\" << operation->errorDetails();\n    }\n}\n\nvoid ConnectionApiPrivate::onPingFailed()\n{\n    qCWarning(c_connectionApiLoggingCategory) << Q_FUNC_INFO;\n}\n\nvoid ConnectionApiPrivate::setStatus(ConnectionApi::Status status, ConnectionApi::StatusReason reason)\n{\n    Q_Q(ConnectionApi);\n    if (m_status == status) {\n        return;\n    }\n    m_status = status;\n    emit q->statusChanged(status, reason);\n}\n\nConnectionApi::ConnectionApi(QObject *parent) :\n    ClientApi(parent)\n{\n    d = new ConnectionApiPrivate(this);\n}\n\nbool ConnectionApi::isSignedIn() const\n{\n    Q_D(const ConnectionApi);\n    return d->isSignedIn();\n}\n\nConnectionApi::Status ConnectionApi::status() const\n{\n    Q_D(const ConnectionApi);\n    return d->status();\n}\n\nTelegram::Client::AuthOperation *ConnectionApi::startAuthentication()\n{\n    Q_D(ConnectionApi);\n    return d->startAuthentication();\n}\n\nAuthOperation *ConnectionApi::checkIn()\n{\n    Q_D(ConnectionApi);\n    return d->checkIn();\n}\n\n} \/\/ Client namespace\n\n} \/\/ Telegram namespace\n<commit_msg>ConnectionApi: Fix checkIn (return failed op instead of nullptr)<commit_after>#include \"ConnectionApi_p.hpp\"\n\n#include \"AccountStorage.hpp\"\n#include \"ClientBackend.hpp\"\n#include \"ClientConnection.hpp\"\n#include \"ClientRpcLayer.hpp\"\n#include \"ClientSettings.hpp\"\n#include \"CTelegramTransport.hpp\"\n#include \"CClientTcpTransport.hpp\"\n#include \"DataStorage.hpp\"\n\n#include \"Operations\/ClientAuthOperation_p.hpp\"\n#include \"Operations\/ClientPingOperation.hpp\"\n#include \"Operations\/ConnectionOperation.hpp\"\n\n#include <QLoggingCategory>\n\nQ_LOGGING_CATEGORY(c_connectionApiLoggingCategory, \"telegram.client.api.connection\", QtWarningMsg)\n\nnamespace Telegram {\n\nnamespace Client {\n\nConnectionApiPrivate::ConnectionApiPrivate(ConnectionApi *parent) :\n    ClientApiPrivate(parent)\n{\n}\n\nConnectionApiPrivate *ConnectionApiPrivate::get(ConnectionApi *parent)\n{\n    return reinterpret_cast<ConnectionApiPrivate*>(parent->d);\n}\n\nbool ConnectionApiPrivate::isSignedIn() const\n{\n    switch (m_status) {\n    case ConnectionApi::StatusConnected:\n    case ConnectionApi::StatusReady:\n        return true;\n    case ConnectionApi::StatusDisconnected:\n    case ConnectionApi::StatusConnecting:\n    case ConnectionApi::StatusWaitForAuthentication:\n        return false;\n    }\n    Q_UNREACHABLE();\n}\n\nConnection *ConnectionApiPrivate::getDefaultConnection()\n{\n    if (mainConnection()) {\n        return mainConnection();\n    }\n\n    if (m_initialConnectOperation) {\n        return m_initialConnectOperation->connection();\n    }\n    return nullptr;\n}\n\nConnection *ConnectionApiPrivate::mainConnection()\n{\n    return m_mainConnection;\n}\n\nvoid ConnectionApiPrivate::setMainConnection(Connection *connection)\n{\n    m_mainConnection = connection;\n    connect(m_mainConnection, &BaseConnection::statusChanged, this, &ConnectionApiPrivate::onMainConnectionStatusChanged);\n    onMainConnectionStatusChanged(connection->status(), Connection::StatusReason::Local);\n}\n\nPendingOperation *ConnectionApiPrivate::connectToServer(const QVector<DcOption> &dcOptions)\n{\n    if (m_initialConnectOperation) {\n        if (dcOptions.contains(m_initialConnectOperation->connection()->dcOption())) {\n            switch (m_initialConnectOperation->connection()->status()) {\n            case BaseConnection::Status::Connecting:\n            case BaseConnection::Status::Connected:\n            case BaseConnection::Status::HasDhKey:\n            case BaseConnection::Status::Signed:\n                return m_initialConnectOperation;\n            default:\n                m_initialConnectOperation->connection()->transport()->disconnectFromHost();\n                break;\n            }\n        }\n        m_initialConnectOperation->deleteLater();\n        m_initialConnectOperation = nullptr;\n    }\n\n    if (mainConnection()) {\n        if (mainConnection()->status() != Connection::Status::Disconnected) {\n            return PendingOperation::failOperation<PendingOperation>\n                    (QStringLiteral(\"Connection is already in progress\"), this);\n        } else {\n            \/\/ TODO!\n        }\n    }\n\n    if (!backend()->accountStorage()) {\n        return PendingOperation::failOperation<PendingOperation>\n                (QStringLiteral(\"Account storage is missing\"), this);\n    }\n    if (!backend()->dataStorage()) {\n        return PendingOperation::failOperation<PendingOperation>\n                (QStringLiteral(\"Data storage is missing\"), this);\n    }\n\n    Connection *connection = createConnection(dcOptions.first());\n    connect(connection, &BaseConnection::statusChanged,\n            this, &ConnectionApiPrivate::onInitialConnectionStatusChanged);\n\n    m_initialConnectOperation = connection->connectToDc();\n    connect(m_initialConnectOperation, &PendingOperation::finished, this, &ConnectionApiPrivate::onInitialConnectOperationFinished);\n    return m_initialConnectOperation;\n}\n\nAuthOperation *ConnectionApiPrivate::startAuthentication()\n{\n    QVariantHash errorDetails = getBackendSetupErrorDetails();\n    if (!errorDetails.isEmpty()) {\n        return PendingOperation::failOperation<AuthOperation>(errorDetails, this);\n    }\n\n    if (isSignedIn()) {\n        return PendingOperation::failOperation<AuthOperation>\n                (QStringLiteral(\"Already signed in\"), this);\n    }\n    if (m_authOperation && !m_authOperation->isFinished()) {\n        return PendingOperation::failOperation<AuthOperation>\n                (QStringLiteral(\"Auth operation is already in progress\"), this);\n    }\n\n    m_authOperation = new AuthOperation(this);\n    AuthOperationPrivate *priv = AuthOperationPrivate::get(m_authOperation);\n    priv->setBackend(backend());\n    priv->setRunMethod(&AuthOperation::requestAuthCode);\n    connect(m_authOperation, &AuthOperation::finished, this, &ConnectionApiPrivate::onAuthFinished);\n    connect(m_authOperation, &AuthOperation::authCodeRequired, this, &ConnectionApiPrivate::onAuthCodeRequired);\n    PendingOperation *connectionOperation = connectToServer(backend()->settings()->serverConfiguration());\n    m_authOperation->runAfter(connectionOperation);\n    return m_authOperation;\n}\n\nAuthOperation *ConnectionApiPrivate::checkIn()\n{\n    QVariantHash errorDetails = getBackendSetupErrorDetails();\n    if (!errorDetails.isEmpty()) {\n        return PendingOperation::failOperation<AuthOperation>(errorDetails, this);\n    }\n\n    if (m_authOperation && !m_authOperation->isFinished()) {\n        return PendingOperation::failOperation<AuthOperation>\n                (QStringLiteral(\"Auth operation is already in progress\"), this);\n    }\n    AccountStorage *accountStorage = backend()->accountStorage();\n    if (!accountStorage || !accountStorage->hasMinimalDataSet()) {\n        return PendingOperation::failOperation<AuthOperation>\n                (QStringLiteral(\"No minimal account data set\"), this);\n    }\n    m_authOperation = new AuthOperation(this);\n    AuthOperationPrivate *priv = AuthOperationPrivate::get(m_authOperation);\n    priv->setBackend(backend());\n    priv->setRunMethod(&AuthOperation::checkAuthorization);\n    connect(m_authOperation, &AuthOperation::finished, this, &ConnectionApiPrivate::onAuthFinished);\n    PendingOperation *connectionOperation = connectToServer({accountStorage->dcInfo()});\n    m_authOperation->runAfter(connectionOperation);\n    m_initialConnectOperation->connection()->setAuthKey(accountStorage->authKey());\n    m_initialConnectOperation->connection()->rpcLayer()->setSessionData(\n                accountStorage->sessionId(),\n                accountStorage->contentRelatedMessagesNumber());\n    return m_authOperation;\n}\n\nQVariantHash ConnectionApiPrivate::getBackendSetupErrorDetails() const\n{\n    if (!backend()->accountStorage()) {\n        return {{PendingOperation::c_text(), QStringLiteral(\"Account storage is missing\")}};\n    }\n    if (!backend()->dataStorage()) {\n        return {{PendingOperation::c_text(), QStringLiteral(\"Data storage is missing\")}};\n    }\n    Settings *settings = backend()->settings();\n    if (!settings) {\n        return {{PendingOperation::c_text(), QStringLiteral(\"Settings object is missing\")}};\n    }\n    if (!settings->isValid()) {\n        return {{PendingOperation::c_text(), QStringLiteral(\"Invalid settings\")}};\n    }\n    return {};\n}\n\nConnection *ConnectionApiPrivate::createConnection(const DcOption &dcOption)\n{\n    Connection *connection = new Connection(this);\n    connection->setDcOption(dcOption);\n    connection->rpcLayer()->setAppInformation(backend()->m_appInformation);\n    connection->rpcLayer()->installUpdatesHandler(backend()->updatesApi());\n    connection->setDeltaTime(backend()->accountStorage()->deltaTime());\n\n    Settings *settings = backend()->m_settings;\n    connection->setServerRsaKey(settings->serverRsaKey());\n    TcpTransport *transport = new TcpTransport(connection);\n    transport->setProxy(settings->proxy());\n\n    switch (settings->preferedSessionType()) {\n    case Settings::SessionType::None:\n        qCWarning(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Session type is not set. Use fallback.\";\n        transport->setPreferedSessionType(TcpTransport::Obfuscated);\n        break;\n    case Settings::SessionType::Abridged:\n        transport->setPreferedSessionType(TcpTransport::Abridged);\n        break;\n    case Settings::SessionType::Obfuscated:\n        transport->setPreferedSessionType(TcpTransport::Obfuscated);\n        break;\n    }\n    connection->setTransport(transport);\n    return connection;\n}\n\nConnection *ConnectionApiPrivate::ensureConnection(const ConnectionSpec &connectionSpec)\n{\n    qCDebug(c_connectionApiLoggingCategory) << Q_FUNC_INFO << connectionSpec.dcId << connectionSpec.flags;\n    ConnectionSpec spec = connectionSpec;\n    spec.flags |= ConnectionSpec::RequestFlag::Ipv4Only; \/\/ Enable only ipv4 for now\n    if (!m_connections.contains(connectionSpec)) {\n        const DcOption opt = backend()->dataStorage()->serverConfiguration().getOption(spec);\n        if (!opt.isValid()) {\n            qCWarning(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Unable to find suitable DC\";\n            return nullptr;\n        }\n        m_connections.insert(connectionSpec, createConnection(opt));\n    }\n    return m_connections.value(connectionSpec);\n}\n\nvoid ConnectionApiPrivate::onInitialConnectOperationFinished(PendingOperation *operation)\n{\n    disconnect(m_initialConnectOperation->connection(), &BaseConnection::statusChanged,\n               this, &ConnectionApiPrivate::onInitialConnectionStatusChanged);\n\n    if (operation->isSucceeded()) {\n        backend()->getDcConfig();\n        return;\n    }\n    m_initialConnectOperation = nullptr;\n    operation->deleteLater();\n    setStatus(ConnectionApi::StatusDisconnected);\n}\n\nvoid ConnectionApiPrivate::onInitialConnectionStatusChanged(BaseConnection::Status status,\n                                                             BaseConnection::StatusReason reason)\n{\n    qCDebug(c_connectionApiLoggingCategory) << Q_FUNC_INFO << status << reason;\n    switch (status) {\n    case BaseConnection::Status::Disconnected:\n    case BaseConnection::Status::Disconnecting:\n        setStatus(ConnectionApi::StatusDisconnected);\n        break;\n    case BaseConnection::Status::Connecting:\n        setStatus(ConnectionApi::StatusConnecting);\n        break;\n    case BaseConnection::Status::Connected:\n        \/\/ Nothing to do; wait for DH\n        break;\n    case BaseConnection::Status::HasDhKey:\n        break;\n    case BaseConnection::Status::Signed:\n    case BaseConnection::Status::Failed:\n        break;\n    }\n}\n\nvoid ConnectionApiPrivate::onAuthFinished(PendingOperation *operation)\n{\n    if (operation != m_authOperation) {\n        qCCritical(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Unexpected auth operation\";\n        return;\n    }\n    if (!operation->isSucceeded()) {\n        setStatus(ConnectionApi::StatusWaitForAuthentication);\n        qCDebug(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"TODO?\";\n        return;\n    }\n    AuthOperationPrivate *priv = AuthOperationPrivate::get(m_authOperation);\n    Connection *conn = priv->m_authenticatedConnection;\n    if (conn->status() != Connection::Status::Signed) {\n        qCCritical(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Unexpected connection status\" << conn->status();\n        return;\n    }\n    setMainConnection(conn);\n}\n\nvoid ConnectionApiPrivate::onAuthCodeRequired()\n{\n    setStatus(ConnectionApi::StatusWaitForAuthentication, ConnectionApi::StatusReasonRemote);\n}\n\nvoid ConnectionApiPrivate::onMainConnectionStatusChanged(BaseConnection::Status status, BaseConnection::StatusReason reason)\n{\n    if (!m_mainConnection) {\n        return;\n    }\n\n    const bool keepAliveIsWanted = (status == Connection::Status::Signed) || (status == Connection::Status::HasDhKey);\n    if (keepAliveIsWanted) {\n        if (!m_pingOperation) {\n            m_pingOperation = new PingOperation(this);\n            m_pingOperation->setSettings(backend()->m_settings);\n            m_pingOperation->setRpcLayer(m_mainConnection->rpcLayer());\n            connect(m_pingOperation, &PingOperation::pingFailed, this, &ConnectionApiPrivate::onPingFailed);\n        }\n        m_pingOperation->ensureActive();\n    } else {\n        if (m_pingOperation) {\n            m_pingOperation->ensureInactive();\n        }\n    }\n\n    switch (status) {\n    case Connection::Status::Signed:\n    {\n        backend()->syncAccountToStorage();\n        setStatus(ConnectionApi::StatusConnected);\n        PendingOperation *syncOperation = backend()->sync();\n        connect(syncOperation, &PendingOperation::finished, this, &ConnectionApiPrivate::onSyncFinished);\n        syncOperation->startLater();\n    }\n        break;\n    default:\n        break;\n    }\n}\n\nvoid ConnectionApiPrivate::onSyncFinished(PendingOperation *operation)\n{\n    if (operation->isSucceeded()) {\n        setStatus(ConnectionApi::StatusReady, ConnectionApi::StatusReasonLocal);\n    } else {\n        qCCritical(c_connectionApiLoggingCategory) << Q_FUNC_INFO << \"Unexpected sync operation status\" << operation->errorDetails();\n    }\n}\n\nvoid ConnectionApiPrivate::onPingFailed()\n{\n    qCWarning(c_connectionApiLoggingCategory) << Q_FUNC_INFO;\n}\n\nvoid ConnectionApiPrivate::setStatus(ConnectionApi::Status status, ConnectionApi::StatusReason reason)\n{\n    Q_Q(ConnectionApi);\n    if (m_status == status) {\n        return;\n    }\n    m_status = status;\n    emit q->statusChanged(status, reason);\n}\n\nConnectionApi::ConnectionApi(QObject *parent) :\n    ClientApi(parent)\n{\n    d = new ConnectionApiPrivate(this);\n}\n\nbool ConnectionApi::isSignedIn() const\n{\n    Q_D(const ConnectionApi);\n    return d->isSignedIn();\n}\n\nConnectionApi::Status ConnectionApi::status() const\n{\n    Q_D(const ConnectionApi);\n    return d->status();\n}\n\nTelegram::Client::AuthOperation *ConnectionApi::startAuthentication()\n{\n    Q_D(ConnectionApi);\n    return d->startAuthentication();\n}\n\nAuthOperation *ConnectionApi::checkIn()\n{\n    Q_D(ConnectionApi);\n    return d->checkIn();\n}\n\n} \/\/ Client namespace\n\n} \/\/ Telegram namespace\n<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n#include <climits>\n#include <fstream>\n#include <iostream>\n#include <strstream>\n\n#include <process.h>\n\n#include <util\/PlatformUtils.hpp>\n#include <util\/Mutexes.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 <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\n\/\/This is here for the threads.\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#include <winbase.h>\n\n\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::cout;\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\/\/ This is here for memory leak testing.\n#if defined(_DEBUG)\n#include <crtdbg.h>\n#endif\n\n\/\/ Used to hold compiled stylesheet\nStylesheetRoot* glbStylesheetRoot;\n\nextern \"C\" void theThreadRoutine(void* param);\n\n\nclass SynchronizedCounter\n{\npublic:\n\n\tSynchronizedCounter();\n\n\t~SynchronizedCounter();\n\n\tvoid\n\tincrement();\n\n\tvoid\n\tdecrement();\n\n\tunsigned long\n\tgetCounter() const;\n\nprivate:\n\n\tmutable XMLMutex\tm_mutex;\n\n\tunsigned long\t\tm_counter;\n};\n\n\n\nSynchronizedCounter::SynchronizedCounter() :\n\tm_mutex(),\n\tm_counter(0)\n{\n}\n\n\n\nSynchronizedCounter::~SynchronizedCounter()\n{\n}\n\n\n\nvoid\nSynchronizedCounter::increment()\n{\n\tXMLMutexLock\ttheLock(&m_mutex);\n\n\tif (m_counter < ULONG_MAX)\n\t{\n\t\t++m_counter;\n\t}\n}\n\n\n\nvoid\nSynchronizedCounter::decrement()\n{\n\tXMLMutexLock\ttheLock(&m_mutex);\n\n\tif (m_counter > 0)\n\t{\n\t\t--m_counter;\n\t}\n}\n\n\n\nunsigned long\nSynchronizedCounter::getCounter() const\n{\n\treturn m_counter;\n}\n\n\n\nstruct\nThreadInfo\n{\n\tThreadInfo(\n\t\t\tunsigned int\t\t\ttheThreadNumber,\n\t\t\tSynchronizedCounter*\ttheCounter) :\n\t\tm_threadNumber(theThreadNumber),\n\t\tm_counter(theCounter)\n\t{\n\t}\n\n\tunsigned int\t\t\tm_threadNumber;\n\n\tSynchronizedCounter*\tm_counter;\n};\n\n\n\nvoid\ntheThreadRoutine(void*\t\tparam)\n{\n\/\/ This routine uses compiled stylesheet (glbStylesheetRoot), which is set using the \n\/\/ theProcessor.setStylesheetRoot method. The transform is done using the theProcessor's\n\/\/ process() method.\n\n\tconst ThreadInfo*\ttheInfo = reinterpret_cast<const ThreadInfo*>(param);\n\n\tassert(theInfo != 0);\n\n\ttheInfo->m_counter->increment();\n\n\ttry\n\t{\n\t\t\/\/ Create the support objects that are necessary for running the processor...\n\t\tXalanSourceTreeDOMSupport\t\ttheDOMSupport;\n\t\tXalanSourceTreeParserLiaison\ttheParserLiaison(theDOMSupport);\n\n\t\ttheDOMSupport.setParserLiaison(&theParserLiaison);\n\t\t\/\/ The default is that documents are not thread-safe.  Set this to\n\t\t\/\/ true so they are.\n\t\t\/\/theParserLiaison.setThreadSafe(true);\n\n\t\tXSLTProcessorEnvSupportDefault\ttheXSLTProcessorEnvSupport;\n\t\tXObjectFactoryDefault\t\t\ttheXObjectFactory;\n\t\tXPathFactoryDefault\t\t\t\ttheXPathFactory;\n\n\t\t\/\/ Create a processor...and output start message.\n\t\tXSLTEngineImpl\ttheProcessor(\n\t\t\t\t\t\ttheParserLiaison,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheDOMSupport,\n\t\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\t\ttheXPathFactory);\n\n\t\t\/\/ Connect the processor to the support object...\n\t\ttheXSLTProcessorEnvSupport.setProcessor(&theProcessor);\n\n\t\t\/\/ The execution context uses the same factory support objects as\n\t\t\/\/ the processor, since those objects have the same lifetime as\n\t\t\/\/ other objects created as a result of the execution.\n\t\tStylesheetExecutionContextDefault\tssExecutionContext(\n\t\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\t\ttheDOMSupport,\n\t\t\t\t\t\t\ttheXObjectFactory);\n\n\t\t\/\/ Our input files.  The assumption is that the executable will be run\n\t\t\/\/ from same directory as the input files.\n\n\t\t\/\/ Generate the input and output file names.\n\t\tconst XalanDOMString\ttheXMLfile(\"birds.xml\");\n\n\t\tconst XalanDOMString\ttheOutputFile(\n\t\t\t\tXalanDOMString(\"birds\") +\n\t\t\t\tUnsignedLongToDOMString(theInfo->m_threadNumber) +\n\t\t\t\tXalanDOMString(\".out\"));\n\n\t\t\/\/Generate the XML input and output objects.\n\t\tXSLTInputSource\t\ttheInputSource(c_wstr(theXMLfile));\n\t\tXSLTResultTarget\ttheResultTarget(theOutputFile);\n\n\t\t\/\/ Set the stylesheet to be the compiled stylesheet. Then do the transform. \n\t\t\/\/ Report both the start of the transform and end of the thread.\n\t\ttheProcessor.setStylesheetRoot(glbStylesheetRoot);\n\t\ttheProcessor.process(theInputSource,theResultTarget,ssExecutionContext);\n\t}\n\tcatch(...)\n\t{\n\t}\n\n\t\/\/ Decrement the counter because we're done...\n\ttheInfo->m_counter->decrement();\n}\n\n\n\nvoid\ndoThreads(long\ttheThreadCount)\n{\n\tcout << endl << \"Starting \" << theThreadCount << \" threads.\" << endl;\n\n\ttypedef std::vector<ThreadInfo>\t\tThreadInfoVectorType;\n\n\tThreadInfoVectorType\ttheThreadInfo;\n\n\ttheThreadInfo.reserve(theThreadCount);\n\n\ttry\n\t{\n\t\tcout << endl << \"Clock before starting threads: \" << clock() << endl;\n\n\t\tSynchronizedCounter\t\ttheCounter;\n\n\t\tfor (long i = 0; i < theThreadCount; i++)\n\t\t{\n\t\t\ttheThreadInfo.push_back(ThreadInfoVectorType::value_type(i, &theCounter));\n\n\t\t\tconst unsigned long\t\ttheThreadID =\n\t\t\t\t\t_beginthread(theThreadRoutine, 4096, reinterpret_cast<LPVOID>(&theThreadInfo.back()));\n\n\t\t\tif (theThreadID == unsigned(-1))\n\t\t\t{\n\t\t\t\tcerr << endl << \"Unable to create thread number \" << i + 1 << \".\" << endl;\n\t\t\t}\n\t\t}\n\n\t\tclock_t\t\ttheClock = 0;\n\n\t\tif (theThreadInfo.size() == 0)\n\t\t{\n\t\t\tcerr << endl << \"No threads were created!\" << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tunsigned int\ttheCheckCount = 0;\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tSleep(2000);\n\n\t\t\t\t\/\/ Check a couple of times, just in case, since\n\t\t\t\t\/\/ getCounter() is not synchronized...\n\t\t\t\tif (theCounter.getCounter() == 0)\n\t\t\t\t{\n\t\t\t\t\tif (theCheckCount == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\ttheClock = clock();\n\t\t\t\t\t}\n\n\t\t\t\t\t++theCheckCount;\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(theCheckCount < 2);\n\t\t}\n\n\t\tcout << endl << \"Clock after threads: \" << theClock << endl;\n\t}\n\tcatch(...)\n\t{\n\t\tcerr << \"Exception caught!!!\"\n\t\t\t << endl\n\t\t\t<< endl;\n\t}\n}\n\n\nint\nmain(\n\t\t\tint\t\t\t\targc,\n\t\t\tconst char*\t\targv[])\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 (argc > 2)\n\t{\n\t\tcerr << \"Usage: ThreadTest\"\n\t\t\t << endl\n\t\t\t << endl;\n\t}\n\telse\n\t{\n\t\tint\tthreadCount = 60;\n\n\t\tif (argc == 2)\n\t\t{\n\t\t\tthreadCount = atoi(argv[1]);\n\t\t}\n\n\t\ttry\n\t\t{\n\t\t  \/\/ Call the static initializers...\n\t\t  XMLPlatformUtils::Initialize();\n          { \n\t\t\tXSLTInit\ttheInit;\n\n\t\t\t\/\/ Create the necessary stuff of compile the stylesheet.\n\t\t\tXercesDOMSupport\t\t\t\tssDOMSupport;\n\t\t\tXercesParserLiaison\t\t\t\tssParserLiaison(ssDOMSupport);\n\t\t\tXSLTProcessorEnvSupportDefault\tssXSLTProcessorEnvSupport;\n\t\t\tXObjectFactoryDefault\t\t\tssXObjectFactory;\n\t\t\tXPathFactoryDefault\t\t\t\tssXPathFactory;\n\n\t\t\t\/\/ Create a processor to compile the stylesheet...\n\t\t\tXSLTEngineImpl\tssProcessor(\n\t\t\t\t\tssParserLiaison,\n\t\t\t\t\tssXSLTProcessorEnvSupport,\n\t\t\t\t\tssDOMSupport,\n\t\t\t\t\tssXObjectFactory,\n\t\t\t\t\tssXPathFactory);\n\n\t\t\t\/\/ Create separate factory support objects so the stylesheet's\n\t\t\t\/\/ factory-created XObject and XPath instances are independent \n\t\t\t\/\/ from processor's.\n\t\t\tXPathFactoryDefault\t\tssStylesheetXPathFactory;\n\n\t\t\t\/\/ Create a stylesheet construction context, using the\n\t\t\t\/\/ stylesheet's factory support objects.\n\t\t\tStylesheetConstructionContextDefault\tssConstructionContext(\n\t\t\t\t\t\t\t\t\t\t\t\t\tssProcessor,\n\t\t\t\t\t\t\t\t\t\t\t\t\tssXSLTProcessorEnvSupport,\n\t\t\t\t\t\t\t\t\t\t\t\t\tssStylesheetXPathFactory);\n\n\t\t\tconst XalanDOMString  theXSLFileName(\"birds.xsl\");\n\t\t\tconst XalanDOMString  theXMLFileName(\"birds.xml\");\n\n\t\t\t\/\/ Our stylesheet input source...\n\t\t\tXSLTInputSource\t\tssStylesheetSourceXSL(c_wstr(theXSLFileName));\n\t\t\tXSLTInputSource\t\tssStylesheetSourceXML(c_wstr(theXMLFileName));\n\n\t\t\t\/\/ Ask the processor to create a StylesheetRoot for the specified\n\t\t\t\/\/ input XSL.  This is the compiled stylesheet.  We don't have to\n\t\t\t\/\/ delete it, since it is owned by the StylesheetConstructionContext\n\t\t\t\/\/ instance.\n\n\t\t\tglbStylesheetRoot = ssProcessor.processStylesheet(ssStylesheetSourceXSL,\n\t\t\t\t\t\t\t\t\t\t\t\t\t   ssConstructionContext);\n\t\t\tassert(glbStylesheetRoot != 0);\n\t\t\t\n\n\t\t\tdoThreads(threadCount);\n\t\t  }\n\n\t\tXMLPlatformUtils::Terminate();\n\n\t\t}\n\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\n\t} \n\n\treturn 0;\n}\n<commit_msg>Added support for pthreads.<commit_after>#include <cassert>\n#include <iostream>\n\n\n\n#include <util\/PlatformUtils.hpp>\n#include <util\/Mutexes.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/XalanFileOutputStream.hpp>\n#include <PlatformSupport\/XalanOutputStreamPrintWriter.hpp>\n\n\n\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n#include <XalanSourceTree\/XalanSourceTreeParserLiaison.hpp>\n\n\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n\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\n\n#if defined(WIN32)\n\/\/This is here for the threads.\n#include <process.h>\n\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#elif defined(XALAN_POSIX2_AVAILABLE)\n#include <pthread.h>\n#include <unistd.h>\n#else\n#error Unsupported platform!\n#endif\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\t\n\/\/ This is here for memory leak testing.\n#if defined(_DEBUG)\n#include <crtdbg.h>\n#endif\n\n\/\/ Used to hold compiled stylesheet\nStylesheetRoot* glbStylesheetRoot;\n\n\nclass SynchronizedCounter\n{\npublic:\n\n\tSynchronizedCounter();\n\n\t~SynchronizedCounter();\n\n\tvoid\n\tincrement();\n\n\tvoid\n\tdecrement();\n\n\tunsigned long\n\tgetCounter() const;\n\nprivate:\n\n\tmutable XMLMutex\tm_mutex;\n\n\tunsigned long\t\tm_counter;\n};\n\n\n\nSynchronizedCounter::SynchronizedCounter() :\n\tm_mutex(),\n\tm_counter(0)\n{\n}\n\n\n\nSynchronizedCounter::~SynchronizedCounter()\n{\n}\n\n\n\nvoid\nSynchronizedCounter::increment()\n{\n\tXMLMutexLock\ttheLock(&m_mutex);\n\n\tif (m_counter < ULONG_MAX)\n\t{\n\t\t++m_counter;\n\t}\n}\n\n\n\nvoid\nSynchronizedCounter::decrement()\n{\n\tXMLMutexLock\ttheLock(&m_mutex);\n\n\tif (m_counter > 0)\n\t{\n\t\t--m_counter;\n\t}\n}\n\n\n\nunsigned long\nSynchronizedCounter::getCounter() const\n{\n\treturn m_counter;\n}\n\n\n\nstruct\nThreadInfo\n{\n\tThreadInfo(\n\t\t\tunsigned int\t\t\ttheThreadNumber,\n\t\t\tSynchronizedCounter*\ttheCounter) :\n\t\tm_threadNumber(theThreadNumber),\n\t\tm_counter(theCounter)\n\t{\n\t}\n\n\tunsigned int\t\t\tm_threadNumber;\n\n\tSynchronizedCounter*\tm_counter;\n};\n\n\n\n#if defined(WIN32)\n\nextern \"C\" void theThreadRoutine(void* param);\n\nvoid\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\nextern \"C\" void* theThreadRoutine(void* param);\n\nvoid*\n#else\n#error Unsupported platform!\n#endif\ntheThreadRoutine(void*\t\tparam)\n{\n\/\/ This routine uses compiled stylesheet (glbStylesheetRoot), which is set using the \n\/\/ theProcessor.setStylesheetRoot method. The transform is done using the theProcessor's\n\/\/ process() method.\n\n\tconst ThreadInfo*\ttheInfo = reinterpret_cast<const ThreadInfo*>(param);\n\n\tassert(theInfo != 0);\n\n\ttheInfo->m_counter->increment();\n\n\ttry\n\t{\n\t\t\/\/ Create the support objects that are necessary for running the processor...\n\t\tXalanSourceTreeDOMSupport\t\ttheDOMSupport;\n\t\tXalanSourceTreeParserLiaison\ttheParserLiaison(theDOMSupport);\n\n\t\ttheDOMSupport.setParserLiaison(&theParserLiaison);\n\t\t\/\/ The default is that documents are not thread-safe.  Set this to\n\t\t\/\/ true so they are.\n\t\t\/\/theParserLiaison.setThreadSafe(true);\n\n\t\tXSLTProcessorEnvSupportDefault\ttheXSLTProcessorEnvSupport;\n\t\tXObjectFactoryDefault\t\t\ttheXObjectFactory;\n\t\tXPathFactoryDefault\t\t\t\ttheXPathFactory;\n\n\t\t\/\/ Create a processor...and output start message.\n\t\tXSLTEngineImpl\ttheProcessor(\n\t\t\t\t\t\ttheParserLiaison,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheDOMSupport,\n\t\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\t\ttheXPathFactory);\n\n\t\t\/\/ Connect the processor to the support object...\n\t\ttheXSLTProcessorEnvSupport.setProcessor(&theProcessor);\n\n\t\t\/\/ The execution context uses the same factory support objects as\n\t\t\/\/ the processor, since those objects have the same lifetime as\n\t\t\/\/ other objects created as a result of the execution.\n\t\tStylesheetExecutionContextDefault\tssExecutionContext(\n\t\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\t\ttheDOMSupport,\n\t\t\t\t\t\t\ttheXObjectFactory);\n\n\t\t\/\/ Our input files.  The assumption is that the executable will be run\n\t\t\/\/ from same directory as the input files.\n\n\t\t\/\/ Generate the input and output file names.\n\t\tconst XalanDOMString\ttheXMLfile(\"birds.xml\");\n\n\t\tconst XalanDOMString\ttheOutputFile(\n\t\t\t\tXalanDOMString(\"birds\") +\n\t\t\t\tUnsignedLongToDOMString(theInfo->m_threadNumber) +\n\t\t\t\tXalanDOMString(\".out\"));\n\n\t\t\/\/Generate the XML input and output objects.\n\t\tXSLTInputSource\t\ttheInputSource(c_wstr(theXMLfile));\n\t\tXSLTResultTarget\ttheResultTarget(theOutputFile);\n\n\t\t\/\/ Set the stylesheet to be the compiled stylesheet. Then do the transform. \n\t\t\/\/ Report both the start of the transform and end of the thread.\n\t\ttheProcessor.setStylesheetRoot(glbStylesheetRoot);\n\t\ttheProcessor.process(theInputSource,theResultTarget,ssExecutionContext);\n\t}\n\tcatch(...)\n\t{\n\t}\n\n\t\/\/ Decrement the counter because we're done...\n\ttheInfo->m_counter->decrement();\n\n#if defined(XALAN_POSIX2_AVAILABLE)\n\treturn 0;\n#endif\n}\n\n\n\ninline void\ndoSleep(unsigned int\ttheMilliseconds)\n{\n#if defined(WIN32)\n\tSleep(theMilliseconds);\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\tusleep(theMilliseconds * 10);\n#else\n#error Unsupported platform!\n#endif\n}\n\n\n\nvoid\ndoThreads(long\ttheThreadCount)\n{\n\tcout << endl << \"Starting \" << theThreadCount << \" threads.\" << endl;\n\n\ttypedef std::vector<ThreadInfo>\t\tThreadInfoVectorType;\n\n\tThreadInfoVectorType\ttheThreadInfo;\n\n\ttheThreadInfo.reserve(theThreadCount);\n\n\ttry\n\t{\n\t\tcout << endl << \"Clock before starting threads: \" << clock() << endl;\n\n\t\tSynchronizedCounter\t\ttheCounter;\n\n\t\tfor (long i = 0; i < theThreadCount; i++)\n\t\t{\n\t\t\ttheThreadInfo.push_back(ThreadInfoVectorType::value_type(i, &theCounter));\n\n#if defined(WIN32)\n\n\t\t\tconst unsigned long\t\ttheThreadID =\n\t\t\t\t\t_beginthread(theThreadRoutine, 4096, reinterpret_cast<LPVOID>(&theThreadInfo.back()));\n\n\t\t\tif (theThreadID == unsigned(-1))\n\t\t\t{\n\t\t\t\tcerr << endl << \"Unable to create thread number \" << i + 1 << \".\" << endl;\n\t\t\t}\n\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\n\t\t\tpthread_t\ttheThread;\n\n\t\t\tconst int\ttheResult = pthread_create(&theThread, 0, theThreadRoutine, (void*)&theThreadInfo.back());\n\n\t\t\tif (theResult != 0)\n\t\t\t{\n\t\t\t\tcerr << endl << \"Unable to create thread number \" << i + 1 << \".\" << endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpthread_detach(theThread);\n\t\t\t}\n#else\n#error Unsupported platform!\n#endif\n\t\t}\n\n\t\tclock_t\t\ttheClock = 0;\n\n\t\tif (theThreadInfo.size() == 0)\n\t\t{\n\t\t\tcerr << endl << \"No threads were created!\" << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tunsigned int\ttheCheckCount = 0;\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tdoSleep(2000);\n\n\t\t\t\t\/\/ Check a couple of times, just in case, since\n\t\t\t\t\/\/ getCounter() is not synchronized...\n\t\t\t\tif (theCounter.getCounter() == 0)\n\t\t\t\t{\n\t\t\t\t\tif (theCheckCount == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\ttheClock = clock();\n\t\t\t\t\t}\n\n\t\t\t\t\t++theCheckCount;\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(theCheckCount < 2);\n\t\t}\n\n\t\tcout << endl << \"Clock after threads: \" << theClock << endl;\n\t}\n\tcatch(...)\n\t{\n\t\tcerr << \"Exception caught!!!\"\n\t\t\t << endl\n\t\t\t<< endl;\n\t}\n}\n\n\nint\nmain(\n\t\t\tint\t\t\t\targc,\n\t\t\tconst char*\t\targv[])\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 (argc > 2)\n\t{\n\t\tcerr << \"Usage: ThreadTest\"\n\t\t\t << endl\n\t\t\t << endl;\n\t}\n\telse\n\t{\n\t\tint\tthreadCount = 60;\n\n\t\tif (argc == 2)\n\t\t{\n\t\t\tthreadCount = atoi(argv[1]);\n\t\t}\n\n\t\ttry\n\t\t{\n\t\t  \/\/ Call the static initializers...\n\t\t  XMLPlatformUtils::Initialize();\n          { \n\t\t\tXSLTInit\ttheInit;\n\n\t\t\t\/\/ Create the necessary stuff of compile the stylesheet.\n\t\t\tXercesDOMSupport\t\t\t\tssDOMSupport;\n\t\t\tXercesParserLiaison\t\t\t\tssParserLiaison(ssDOMSupport);\n\t\t\tXSLTProcessorEnvSupportDefault\tssXSLTProcessorEnvSupport;\n\t\t\tXObjectFactoryDefault\t\t\tssXObjectFactory;\n\t\t\tXPathFactoryDefault\t\t\t\tssXPathFactory;\n\n\t\t\t\/\/ Create a processor to compile the stylesheet...\n\t\t\tXSLTEngineImpl\tssProcessor(\n\t\t\t\t\tssParserLiaison,\n\t\t\t\t\tssXSLTProcessorEnvSupport,\n\t\t\t\t\tssDOMSupport,\n\t\t\t\t\tssXObjectFactory,\n\t\t\t\t\tssXPathFactory);\n\n\t\t\t\/\/ Create separate factory support objects so the stylesheet's\n\t\t\t\/\/ factory-created XObject and XPath instances are independent \n\t\t\t\/\/ from processor's.\n\t\t\tXPathFactoryDefault\t\tssStylesheetXPathFactory;\n\n\t\t\t\/\/ Create a stylesheet construction context, using the\n\t\t\t\/\/ stylesheet's factory support objects.\n\t\t\tStylesheetConstructionContextDefault\tssConstructionContext(\n\t\t\t\t\t\t\t\t\t\t\t\t\tssProcessor,\n\t\t\t\t\t\t\t\t\t\t\t\t\tssXSLTProcessorEnvSupport,\n\t\t\t\t\t\t\t\t\t\t\t\t\tssStylesheetXPathFactory);\n\n\t\t\tconst XalanDOMString  theXSLFileName(\"birds.xsl\");\n\t\t\tconst XalanDOMString  theXMLFileName(\"birds.xml\");\n\n\t\t\t\/\/ Our stylesheet input source...\n\t\t\tXSLTInputSource\t\tssStylesheetSourceXSL(c_wstr(theXSLFileName));\n\t\t\tXSLTInputSource\t\tssStylesheetSourceXML(c_wstr(theXMLFileName));\n\n\t\t\t\/\/ Ask the processor to create a StylesheetRoot for the specified\n\t\t\t\/\/ input XSL.  This is the compiled stylesheet.  We don't have to\n\t\t\t\/\/ delete it, since it is owned by the StylesheetConstructionContext\n\t\t\t\/\/ instance.\n\n\t\t\tglbStylesheetRoot = ssProcessor.processStylesheet(ssStylesheetSourceXSL,\n\t\t\t\t\t\t\t\t\t\t\t\t\t   ssConstructionContext);\n\t\t\tassert(glbStylesheetRoot != 0);\n\t\t\t\n\n\t\t\tdoThreads(threadCount);\n\t\t  }\n\n\t\tXMLPlatformUtils::Terminate();\n\n\t\t}\n\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\n\t} \n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"bookmarkview.h\"\n#include \"Library\/customdialog.h\"\n#include <iostream>\n\n\/**\n * @brief BookmarkView::BookmarkView\n * Constructor.\n * @param parent Parent item of the BookmarkView.\n *\/\nBookmarkView::BookmarkView(QListWidget* parent) {\n    view = parent;\n    view->addItem(\"Bookmarks:\");\n}\n\n\/**\n * @brief BookmarkView::get_num_bookmarks\n * @return Returns the number of bookmarks.\n *\/\nint BookmarkView::get_num_bookmarks() {\n    return view->count();\n}\n\n\/**\n * @brief BookmarkView::add_bookmark\n * Adds a bookmark containing an image (thumbnail)\n * and a text description of the bookmark.\n * @param file_path Path to the image of the bookmark.\n *\/\nvoid BookmarkView::add_bookmark(std::string file_path) {\n    QImage img = QImage(QString::fromStdString(file_path), \"TIFF\");\n    img = img.scaledToHeight(BOOKMARK_HEIGHT);\n\n    QListWidgetItem *item = new QListWidgetItem(get_input_text(), view);\n    item->setData(Qt::DecorationRole, QPixmap::fromImage(img));\n\n    view->addItem(item);\n}\n\n\/**\n * @brief BookmarkView::get_input_text\n * @return Returns a description for the bookmark,\n *         obtained from the user.\n *\/\nQString BookmarkView::get_input_text() {\n    std::string contrast_text = \"\";\n\n    \/\/ Create the dialog\n    CustomDialog dialog(\"Bookmark description\", NULL);\n    dialog.addLabel(\"Write a description of the bookmark:\");\n    dialog.addTextEdit(&contrast_text, false, false, TEXT_EDIT_HEIGHT,\n                          \"Write a description of the bookmark. This will be used when creating a report.\");\n\n    \/\/ Show the dialog (execution will stop here until the dialog is finished)\n    dialog.exec();\n\n    if (dialog.wasCancelled()) {\n        return \"\";\n    }\n\n    return QString::fromStdString(contrast_text);\n}\n<commit_msg>Renamed variable.<commit_after>#include \"bookmarkview.h\"\n#include \"Library\/customdialog.h\"\n#include <iostream>\n\n\/**\n * @brief BookmarkView::BookmarkView\n * Constructor.\n * @param parent Parent item of the BookmarkView.\n *\/\nBookmarkView::BookmarkView(QListWidget* parent) {\n    view = parent;\n    view->addItem(\"Bookmarks:\");\n}\n\n\/**\n * @brief BookmarkView::get_num_bookmarks\n * @return Returns the number of bookmarks.\n *\/\nint BookmarkView::get_num_bookmarks() {\n    return view->count();\n}\n\n\/**\n * @brief BookmarkView::add_bookmark\n * Adds a bookmark containing an image (thumbnail)\n * and a text description of the bookmark.\n * @param file_path Path to the image of the bookmark.\n *\/\nvoid BookmarkView::add_bookmark(std::string file_path) {\n    QImage img = QImage(QString::fromStdString(file_path), \"TIFF\");\n    img = img.scaledToHeight(BOOKMARK_HEIGHT);\n\n    QListWidgetItem *item = new QListWidgetItem(get_input_text(), view);\n    item->setData(Qt::DecorationRole, QPixmap::fromImage(img));\n\n    view->addItem(item);\n}\n\n\/**\n * @brief BookmarkView::get_input_text\n * @return Returns a description for the bookmark,\n *         obtained from the user.\n *\/\nQString BookmarkView::get_input_text() {\n    std::string bookmark_text = \"\";\n\n    \/\/ Create the dialog\n    CustomDialog dialog(\"Bookmark description\", NULL);\n    dialog.addLabel(\"Write a description of the bookmark:\");\n    dialog.addTextEdit(&bookmark_text, false, false, TEXT_EDIT_HEIGHT,\n                          \"Write a description of the bookmark. This will be used when creating a report.\");\n\n    \/\/ Show the dialog (execution will stop here until the dialog is finished)\n    dialog.exec();\n\n    if (dialog.wasCancelled()) {\n        return \"\";\n    }\n\n    return QString::fromStdString(bookmark_text);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/#include <TCanvas.h>\n\/\/#include <TLegend.h>\n\/\/#include <TRandom3.h>\n\/\/#include \"TH1.h\"\n\/\/#include \"TF1.h\"\n\/\/#include \"TMath.h\"\n#include <string>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass eeevent\n{\n\tint num1;\n\t\n\tint num_trig;\n\tint num_acq;\n\t\n\tint secs;\n\tint nsecs;\n\t\n\tint clk1;\n\tint clk2;\n\t\n\tvector<int[2]> event1;\n\tvector<int[2]> event2;\n\tvector<int[2]> event3;\n\t\n\tdouble hv1;\n\tdouble hv2;\n\tdouble hv3;\n\t\n\teeevent(int num1, int num_trig, int num_acq, int secs, int nsecs, int clk1, int clk2, int hv1, int hv2, int hv3):\n\t\tnum1(num1), num_trig(num_trig), num_acq(num_acq), secs(secs), nsecs(nsecs),\n\t\tclk1(clk1), clk2(clk2), hv1(hv1), hv2(hv2), hv3(hv3) {}\n};\n\nint parse(string path)\n{\n\tcout << \"Path given: \" << path << endl;\n\t\n\tifstream file;\n\tfile.open(path);\n\tconst int linesize=65536;\n\tchar* line = (char*)malloc(linesize*sizeof(char));  \/\/ get buffer for every line\n\t\n\tvector<eeevent> evector;\n\t\n\twhile (!file.eof()) {\n\t\tfile.getline(line, linesize);       \/\/ fill line\n\t\t\n\t\tchar* piece = strtok (line,\" \\t\");  \/\/ get initial number\n\t\tif (piece==NULL) continue;          \/\/ the file is finished at this point, but better run the eof() check\n\t\tint num1 = atoi(piece);             \/\/ inital number\n\t\tif (num1 == 0) continue;            \/\/ line needs to start with a number, not characters (like the name line)\n\t\t\n\t\tpiece = strtok (NULL, \" \\t\");       \/\/ get descriptor\n\t\tstring descriptor = piece;\n\t\tif (descriptor==\"STATUS\") {\n\t\t\t\n\t\t}\n\t\telse if (descriptor==\"EVENT\") {\n\t\t\t\n\t\t}\n\t\telse continue;\n\t\t\n\t\twhile (piece != NULL) {\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get more pieces\n\t\t\t\/\/cout << piece << endl;\n\t\t}\n\t}\n\n\t\n\treturn 0;\n}\n\nint main(int, char** argv)\n{\n\tparse(argv[1]);\n\treturn 0;\n}\n<commit_msg>Completed HV parsing part<commit_after>\/\/#include <TCanvas.h>\n\/\/#include <TLegend.h>\n\/\/#include <TRandom3.h>\n\/\/#include \"TH1.h\"\n\/\/#include \"TF1.h\"\n\/\/#include \"TMath.h\"\n#include <string>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass eeevent\n{\n\tint num1;\n\t\n\tint num_trig;\n\tint num_acq;\n\t\n\tint secs;\n\tint nsecs;\n\t\n\tint clk1;\n\tint clk2;\n\t\n\tvector<int[2]> event1;\n\tvector<int[2]> event2;\n\tvector<int[2]> event3;\n\t\n\tdouble hv1;\n\tdouble hv2;\n\tdouble hv3;\n\t\n\teeevent(int num1, int num_trig, int num_acq, int secs, int nsecs, int clk1, int clk2, int hv1, int hv2, int hv3):\n\t\tnum1(num1), num_trig(num_trig), num_acq(num_acq), secs(secs), nsecs(nsecs),\n\t\tclk1(clk1), clk2(clk2), hv1(hv1), hv2(hv2), hv3(hv3) {}\n};\n\nint parse(string path)\n{\n\tcout << \"Path given: \" << path << endl;\n\t\n\tifstream file;\n\tfile.open(path);\n\tconst int linesize=65536;\n\tchar* line = (char*)malloc(linesize*sizeof(char));  \/\/ get buffer for every line\n\t\n\tvector<eeevent> evector;               \/\/ vector of events\n\tdouble hv1, hv2, hv3;                  \/\/ variables for high voltage values\n\t\n\t\n\twhile (!file.eof()) {\n\t\tfile.getline(line, linesize);       \/\/ fill line\n\t\t\n\t\tchar* piece = strtok (line,\" \\t\");  \/\/ get initial number\n\t\tif (piece==NULL) continue;          \/\/ the file is finished at this point, but better run the eof() check\n\t\tint num1 = atoi(piece);             \/\/ inital number\n\t\tif (num1 == 0) continue;            \/\/ line needs to start with a number, not characters (like the name line)\n\t\t\n\t\tpiece = strtok (NULL, \" \\t\");       \/\/ get descriptor\n\t\tstring descriptor = piece;\n\t\t\n\t\tif (descriptor==\"STATUS\") {\n\t\t\tchar* next=piece+7;              \/\/ hack to get after \"STATUS\"\n\t\t\tsscanf(next, \"HV %lf %*f %lf %*f %lf %*f\", &hv1, &hv2, &hv3); \n\t\t\tcout << \"hv: \" << hv1 << \" - \" << hv2 << \" - \" << hv3 << endl;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (descriptor==\"EVENT\") {\n\t\t\t\/\/cout << \"e\" << endl;\n\t\t}\n\t\telse continue;\n\t\t\n\t\twhile (piece != NULL) {\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get more pieces\n\t\t\t\/\/cout << piece << endl;\n\t\t}\n\t}\n\n\t\n\treturn 0;\n}\n\nint main(int, char** argv)\n{\n\tparse(argv[1]);\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2017 QReal Research Group\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License. *\/\n#include \"structuralControlFlowGenerator.h\"\n\nusing namespace qReal;\nusing namespace generatorBase;\nusing namespace semantics;\n\n\nStructuralControlFlowGenerator::StructuralControlFlowGenerator(const qrRepo::RepoApi &repo\n\t\t, ErrorReporterInterface &errorReporter\n\t\t, GeneratorCustomizer &customizer\n\t\t, PrimaryControlFlowValidator &validator\n\t\t, const Id &diagramId\n\t\t, QObject *parent\n\t\t, bool isThisDiagramMain)\n\t: ControlFlowGeneratorBase(repo, errorReporter, customizer, validator, diagramId, parent, isThisDiagramMain)\n\t, mNumberOfVerteces(0)\n{\n}\n\nControlFlowGeneratorBase *StructuralControlFlowGenerator::cloneFor(const Id &diagramId, bool cloneForNewDiagram)\n{\n\t\/\/ to do\n\treturn nullptr;\n}\n\nvoid StructuralControlFlowGenerator::beforeSearch()\n{\n\t\/\/ to do\n}\n\nvoid StructuralControlFlowGenerator::visitFinal(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitFork(const Id &id, QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitJoin(const Id &id, QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitRegular(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitConditional(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitLoop(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitSwitch(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitUnknown(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::afterSearch()\n{\n\t\/\/ to do\n}\n\nvoid StructuralControlFlowGenerator::performGeneration()\n{\n\tControlFlowGeneratorBase::performGeneration();\n\t\/\/ to check whether diagram was right\n\n\tfindDominators();\n\n\tperformAnalysis();\n}\n\nvoid StructuralControlFlowGenerator::buildGraph(const Id &id, const QList<LinkInfo> &links)\n{\n\tint numberOfCurrentVertex = -1;\n\tif (mInitialVerteces.contains(id)) {\n\t\tnumberOfCurrentVertex = mInitialVerteces[id];\n\t} else {\n\t\tnumberOfCurrentVertex = mNumberOfVerteces;\n\t\tmNumberOfVerteces++;\n\t\tmInitialVerteces[id] = numberOfCurrentVertex;\n\t\tmVerteces.push_back(numberOfCurrentVertex);\n\t}\n\n\tfor (const LinkInfo link : links) {\n\t\tint targetNumber = -1;\n\t\tif (mInitialVerteces.contains(link.target)) {\n\t\t\ttargetNumber = mInitialVerteces[link.target];\n\t\t} else {\n\t\t\ttargetNumber = mNumberOfVerteces;\n\t\t\tmNumberOfVerteces++;\n\t\t\tmInitialVerteces[link.target] = targetNumber;\n\t\t\tmVerteces.push_back(targetNumber);\n\t\t}\n\t\tmFollowers[numberOfCurrentVertex].push_back(targetNumber);\n\t\tmPredecessors[targetNumber].push_back(numberOfCurrentVertex);\n\t}\n}\n\n\/\/ to do\n\/\/ to save invariant that mGraph only has valid nodes and edges,\n\/\/ so it would be possible not to pass setOfNodes\nvoid StructuralControlFlowGenerator::performAnalysis()\n{\n\tfor (VertexIterator it = mInitialVerteces.values().begin(); it != mInitialVerteces.values().end(); ++it) {\n\t\tmUsed[*it] = false;\n\t\tmPostOrder[*it] = -1;\n\t}\n\tint time = 0;\n\tconst VertexLabel root = 0;\n\tdfs(root, time);\n\n\tint currentTime = 0;\n\tint maxTime = time;\n\n\t\/\/ it is supposed that mFollowers.size() == mPredecessors.size() == actual number of\n\t\/\/ verteces in current flowgraph\n\n\twhile (mFollowers.keys().size() > 1 && currentTime < maxTime) {\n\t\tint currentNode = -1;\n\n\t\t\/\/ dummy cycle for finding node number that\n\t\t\/\/ has postOrder equal to currentTime\n\n\t\tfor (VertexIterator it = mPostOrder.keys().begin(); it != mPostOrder.keys().end(); ++it) {\n\t\t\tVertexLabel number = *(it);\n\t\t\tif (mPostOrder[number] == currentTime) {\n\t\t\t\tcurrentNode = number;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid StructuralControlFlowGenerator::findDominators()\n{\n\n\tfor (int i = 1; i < mVerteces.size(); i++) {\n\t\tmDominators[i] = mVerteces.toSet();\n\t}\n\n\tconst VertexLabel root = 0;\n\tmDominators[root] = { root };\n\n\n\tbool somethingChanged = true;\n\twhile (somethingChanged) {\n\t\tsomethingChanged = false;\n\n\t\t\/\/ excluding root\n\t\tfor (VertexIterator it = mVerteces.begin(); it != mVerteces.end(); it++) {\n\t\t\tVertexLabel vertex = *it;\n\t\t\tif (vertex) {\n\t\t\t\tQSet<VertexLabel> newDominators = mVerteces.toSet();\n\t\t\t\tfor (int t = 0; t < mPredecessors[vertex].size(); t++) {\n\t\t\t\t\tVertexLabel predecessor = mPredecessors[vertex].at(t);\n\t\t\t\t\tnewDominators.intersect(mDominators[predecessor]);\n\t\t\t\t}\n\t\t\t\t\/\/ adding the current number, because reflexivity of dominance relation\n\t\t\t\tnewDominators.insert(vertex);\n\t\t\t\tif (newDominators != mDominators[vertex]) {\n\t\t\t\t\tsomethingChanged = true;\n\t\t\t\t\tmDominators[vertex] = newDominators;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid StructuralControlFlowGenerator::dfs(VertexLabel u, int &postOrderLabel)\n{\n\tmUsed[u] = true;\n\tfor (int t = 0; t < mFollowers[u].size(); t++) {\n\t\tint v = mFollowers[u].at(t);\n\t\tif (!mUsed[v]) {\n\t\t\tdfs(v, postOrderLabel);\n\t\t}\n\t}\n\tmPostOrder[u] = postOrderLabel;\n\tpostOrderLabel++;\n}\n\nStructuralControlFlowGenerator::RegionType StructuralControlFlowGenerator::acyclicRegionType(int &nodeNumber, QSet<int> &nodesThatComposeRegion)\n{\n\tnodesThatComposeRegion.clear();\n\n\tint currentNodeNumber = nodeNumber;\n\tbool hasOnlyOneIncomingEdge = true;\n\tbool hasOnlyOneOutcomingEdge = mFollowers[currentNodeNumber].size() == 1;\n\n\twhile (hasOnlyOneIncomingEdge && hasOnlyOneOutcomingEdge) {\n\t\tnodesThatComposeRegion.insert(currentNodeNumber);\n\t\tcurrentNodeNumber = mFollowers[currentNodeNumber].at(0);\n\t\thasOnlyOneIncomingEdge = mPredecessors[currentNodeNumber].size() == 1;\n\t\thasOnlyOneOutcomingEdge = mFollowers[currentNodeNumber].size() == 1;\n\t}\n\n\tif (hasOnlyOneIncomingEdge) {\n\t\tnodesThatComposeRegion.insert(currentNodeNumber);\n\t}\n\n\tcurrentNodeNumber = nodeNumber;\n\thasOnlyOneIncomingEdge = mPredecessors[currentNodeNumber].size() == 1;\n\thasOnlyOneOutcomingEdge = true;\n\n\twhile (hasOnlyOneIncomingEdge && hasOnlyOneOutcomingEdge) {\n\t\tnodesThatComposeRegion.insert(currentNodeNumber);\n\t\tcurrentNodeNumber = mPredecessors[currentNodeNumber].at(0);\n\t\thasOnlyOneIncomingEdge = mPredecessors[currentNodeNumber].size() == 1;\n\t\thasOnlyOneOutcomingEdge = mFollowers[currentNodeNumber].size() == 1;\n\t}\n\n\tif (hasOnlyOneOutcomingEdge) {\n\t\tnodesThatComposeRegion.insert(currentNodeNumber);\n\t}\n\n\tnodeNumber = currentNodeNumber;\n\n\tif (nodesThatComposeRegion.size() == 2) {\n\t\treturn Block;\n\t}\n\n\t\/\/ checking for IfThenElse\n\tif (mFollowers[nodeNumber].size() == 2) {\n\t\tint m = mFollowers[nodeNumber].at(0);\n\t\tint n = mFollowers[nodeNumber].at(1);\n\n\t\tif (mFollowers[m].size() == 1 && mFollowers[n].size() == 1\n\t\t\t\t&& mFollowers[m].at(0) == mFollowers[n].at(0)\n\t\t\t\t&& mPredecessors[m].size() == 1 && mPredecessors[n].size() == 1) {\n\t\t\tnodesThatComposeRegion.clear();\n\t\t\tnodesThatComposeRegion.insert(nodeNumber);\n\t\t\tnodesThatComposeRegion.insert(m);\n\t\t\tnodesThatComposeRegion.insert(n);\n\t\t\treturn IfThenElse;\n\t\t}\n\n\t}\n\n}\n\n\nStructuralControlFlowGenerator::Node::Node(StructuralControlFlowGenerator::RegionType type, int number)\n\t: mRegionType(type)\n\t, mNumber(number)\n\t, mParent(nullptr)\n{\n}\n\nvoid StructuralControlFlowGenerator::Node::appendChild(StructuralControlFlowGenerator::Node *child)\n{\n\tmChildren.append(child);\n}\n\nvoid StructuralControlFlowGenerator::Node::appendChildren(const QVector<StructuralControlFlowGenerator::Node *> &children)\n{\n\tfor (StructuralControlFlowGenerator::Node *child : children) {\n\t\tmChildren.append(child);\n\t}\n}\n\nStructuralControlFlowGenerator::Node *StructuralControlFlowGenerator::Node::structOf() const\n{\n\treturn mParent;\n}\n\nvoid StructuralControlFlowGenerator::Node::setParent(StructuralControlFlowGenerator::Node *parent)\n{\n\tmParent = parent;\n}\n\nStructuralControlFlowGenerator::RegionType StructuralControlFlowGenerator::Node::structType() const\n{\n\treturn mRegionType;\n}\n\nQVector<StructuralControlFlowGenerator::Node *> StructuralControlFlowGenerator::Node::structNodes() const\n{\n\treturn mChildren;\n}\n\n<commit_msg>Handling IfThen pattern<commit_after>\/* Copyright 2017 QReal Research Group\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License. *\/\n#include \"structuralControlFlowGenerator.h\"\n\nusing namespace qReal;\nusing namespace generatorBase;\nusing namespace semantics;\n\n\nStructuralControlFlowGenerator::StructuralControlFlowGenerator(const qrRepo::RepoApi &repo\n\t\t, ErrorReporterInterface &errorReporter\n\t\t, GeneratorCustomizer &customizer\n\t\t, PrimaryControlFlowValidator &validator\n\t\t, const Id &diagramId\n\t\t, QObject *parent\n\t\t, bool isThisDiagramMain)\n\t: ControlFlowGeneratorBase(repo, errorReporter, customizer, validator, diagramId, parent, isThisDiagramMain)\n\t, mNumberOfVerteces(0)\n{\n}\n\nControlFlowGeneratorBase *StructuralControlFlowGenerator::cloneFor(const Id &diagramId, bool cloneForNewDiagram)\n{\n\t\/\/ to do\n\treturn nullptr;\n}\n\nvoid StructuralControlFlowGenerator::beforeSearch()\n{\n\t\/\/ to do\n}\n\nvoid StructuralControlFlowGenerator::visitFinal(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitFork(const Id &id, QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitJoin(const Id &id, QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitRegular(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitConditional(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitLoop(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitSwitch(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::visitUnknown(const Id &id, const QList<LinkInfo> &links)\n{\n\tbuildGraph(id, links);\n}\n\nvoid StructuralControlFlowGenerator::afterSearch()\n{\n\t\/\/ to do\n}\n\nvoid StructuralControlFlowGenerator::performGeneration()\n{\n\tControlFlowGeneratorBase::performGeneration();\n\t\/\/ to check whether diagram was right\n\n\tfindDominators();\n\n\tperformAnalysis();\n}\n\nvoid StructuralControlFlowGenerator::buildGraph(const Id &id, const QList<LinkInfo> &links)\n{\n\tint numberOfCurrentVertex = -1;\n\tif (mInitialVerteces.contains(id)) {\n\t\tnumberOfCurrentVertex = mInitialVerteces[id];\n\t} else {\n\t\tnumberOfCurrentVertex = mNumberOfVerteces;\n\t\tmNumberOfVerteces++;\n\t\tmInitialVerteces[id] = numberOfCurrentVertex;\n\t\tmVerteces.push_back(numberOfCurrentVertex);\n\t}\n\n\tfor (const LinkInfo link : links) {\n\t\tint targetNumber = -1;\n\t\tif (mInitialVerteces.contains(link.target)) {\n\t\t\ttargetNumber = mInitialVerteces[link.target];\n\t\t} else {\n\t\t\ttargetNumber = mNumberOfVerteces;\n\t\t\tmNumberOfVerteces++;\n\t\t\tmInitialVerteces[link.target] = targetNumber;\n\t\t\tmVerteces.push_back(targetNumber);\n\t\t}\n\t\tmFollowers[numberOfCurrentVertex].push_back(targetNumber);\n\t\tmPredecessors[targetNumber].push_back(numberOfCurrentVertex);\n\t}\n}\n\n\/\/ to do\n\/\/ to save invariant that mGraph only has valid nodes and edges,\n\/\/ so it would be possible not to pass setOfNodes\nvoid StructuralControlFlowGenerator::performAnalysis()\n{\n\tfor (VertexIterator it = mInitialVerteces.values().begin(); it != mInitialVerteces.values().end(); ++it) {\n\t\tmUsed[*it] = false;\n\t\tmPostOrder[*it] = -1;\n\t}\n\tint time = 0;\n\tconst VertexLabel root = 0;\n\tdfs(root, time);\n\n\tint currentTime = 0;\n\tint maxTime = time;\n\n\t\/\/ it is supposed that mFollowers.size() == mPredecessors.size() == actual number of\n\t\/\/ verteces in current flowgraph\n\n\twhile (mFollowers.keys().size() > 1 && currentTime < maxTime) {\n\t\tint currentNode = -1;\n\n\t\t\/\/ dummy cycle for finding node number that\n\t\t\/\/ has postOrder equal to currentTime\n\n\t\tfor (VertexIterator it = mPostOrder.keys().begin(); it != mPostOrder.keys().end(); ++it) {\n\t\t\tVertexLabel number = *(it);\n\t\t\tif (mPostOrder[number] == currentTime) {\n\t\t\t\tcurrentNode = number;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid StructuralControlFlowGenerator::findDominators()\n{\n\n\tfor (int i = 1; i < mVerteces.size(); i++) {\n\t\tmDominators[i] = mVerteces.toSet();\n\t}\n\n\tconst VertexLabel root = 0;\n\tmDominators[root] = { root };\n\n\n\tbool somethingChanged = true;\n\twhile (somethingChanged) {\n\t\tsomethingChanged = false;\n\n\t\t\/\/ excluding root\n\t\tfor (VertexIterator it = mVerteces.begin(); it != mVerteces.end(); it++) {\n\t\t\tVertexLabel vertex = *it;\n\t\t\tif (vertex) {\n\t\t\t\tQSet<VertexLabel> newDominators = mVerteces.toSet();\n\t\t\t\tfor (int t = 0; t < mPredecessors[vertex].size(); t++) {\n\t\t\t\t\tVertexLabel predecessor = mPredecessors[vertex].at(t);\n\t\t\t\t\tnewDominators.intersect(mDominators[predecessor]);\n\t\t\t\t}\n\t\t\t\t\/\/ adding the current number, because reflexivity of dominance relation\n\t\t\t\tnewDominators.insert(vertex);\n\t\t\t\tif (newDominators != mDominators[vertex]) {\n\t\t\t\t\tsomethingChanged = true;\n\t\t\t\t\tmDominators[vertex] = newDominators;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid StructuralControlFlowGenerator::dfs(VertexLabel u, int &postOrderLabel)\n{\n\tmUsed[u] = true;\n\tfor (int t = 0; t < mFollowers[u].size(); t++) {\n\t\tint v = mFollowers[u].at(t);\n\t\tif (!mUsed[v]) {\n\t\t\tdfs(v, postOrderLabel);\n\t\t}\n\t}\n\tmPostOrder[u] = postOrderLabel;\n\tpostOrderLabel++;\n}\n\nStructuralControlFlowGenerator::RegionType StructuralControlFlowGenerator::acyclicRegionType(int &nodeNumber, QSet<int> &nodesThatComposeRegion)\n{\n\tnodesThatComposeRegion.clear();\n\n\tint currentNodeNumber = nodeNumber;\n\tbool hasOnlyOneIncomingEdge = true;\n\tbool hasOnlyOneOutcomingEdge = mFollowers[currentNodeNumber].size() == 1;\n\n\twhile (hasOnlyOneIncomingEdge && hasOnlyOneOutcomingEdge) {\n\t\tnodesThatComposeRegion.insert(currentNodeNumber);\n\t\tcurrentNodeNumber = mFollowers[currentNodeNumber].at(0);\n\t\thasOnlyOneIncomingEdge = mPredecessors[currentNodeNumber].size() == 1;\n\t\thasOnlyOneOutcomingEdge = mFollowers[currentNodeNumber].size() == 1;\n\t}\n\n\tif (hasOnlyOneIncomingEdge) {\n\t\tnodesThatComposeRegion.insert(currentNodeNumber);\n\t}\n\n\tcurrentNodeNumber = nodeNumber;\n\thasOnlyOneIncomingEdge = mPredecessors[currentNodeNumber].size() == 1;\n\thasOnlyOneOutcomingEdge = true;\n\n\twhile (hasOnlyOneIncomingEdge && hasOnlyOneOutcomingEdge) {\n\t\tnodesThatComposeRegion.insert(currentNodeNumber);\n\t\tcurrentNodeNumber = mPredecessors[currentNodeNumber].at(0);\n\t\thasOnlyOneIncomingEdge = mPredecessors[currentNodeNumber].size() == 1;\n\t\thasOnlyOneOutcomingEdge = mFollowers[currentNodeNumber].size() == 1;\n\t}\n\n\tif (hasOnlyOneOutcomingEdge) {\n\t\tnodesThatComposeRegion.insert(currentNodeNumber);\n\t}\n\n\tnodeNumber = currentNodeNumber;\n\n\tif (nodesThatComposeRegion.size() == 2) {\n\t\treturn Block;\n\t}\n\n\tnodesThatComposeRegion.clear();\n\n\t\/\/ checking for IfThenElse\n\tif (mFollowers[nodeNumber].size() == 2) {\n\t\tint m = mFollowers[nodeNumber].at(0);\n\t\tint n = mFollowers[nodeNumber].at(1);\n\n\t\tif (mFollowers[m].size() == 1 && mFollowers[n].size() == 1\n\t\t\t\t&& mFollowers[m].at(0) == mFollowers[n].at(0)\n\t\t\t\t&& mPredecessors[m].size() == 1 && mPredecessors[n].size() == 1) {\n\n\t\t\tnodesThatComposeRegion.insert(nodeNumber);\n\t\t\tnodesThatComposeRegion.insert(m);\n\t\t\tnodesThatComposeRegion.insert(n);\n\t\t\treturn IfThenElse;\n\t\t}\n\n\t}\n\n\t\/\/ checking IfThen\n\tif (mFollowers[nodeNumber].size() == 2) {\n\t\tint m = mFollowers[nodeNumber].at(0);\n\t\tint n = mFollowers[nodeNumber].at(1);\n\n\t\tint thenNodeNumber = -1;\n\t\tif (mFollowers[m].size() == 1 && mFollowers[m].at(0) == n && mPredecessors[m].size() == 1) {\n\t\t\tthenNodeNumber = m;\n\t\t} else if (mFollowers[n].size() == 1 && mFollowers[n].at(0) == m && mPredecessors[n].size() == 1) {\n\t\t\tthenNodeNumber = n;\n\t\t}\n\n\t\tif (thenNodeNumber != -1) {\n\t\t\tnodesThatComposeRegion.insert(nodeNumber);\n\t\t\tnodesThatComposeRegion.insert(m);\n\t\t\tnodesThatComposeRegion.insert(n);\n\t\t\treturn IfThen;\n\t\t}\n\t}\n\n}\n\n\nStructuralControlFlowGenerator::Node::Node(StructuralControlFlowGenerator::RegionType type, int number)\n\t: mRegionType(type)\n\t, mNumber(number)\n\t, mParent(nullptr)\n{\n}\n\nvoid StructuralControlFlowGenerator::Node::appendChild(StructuralControlFlowGenerator::Node *child)\n{\n\tmChildren.append(child);\n}\n\nvoid StructuralControlFlowGenerator::Node::appendChildren(const QVector<StructuralControlFlowGenerator::Node *> &children)\n{\n\tfor (StructuralControlFlowGenerator::Node *child : children) {\n\t\tmChildren.append(child);\n\t}\n}\n\nStructuralControlFlowGenerator::Node *StructuralControlFlowGenerator::Node::structOf() const\n{\n\treturn mParent;\n}\n\nvoid StructuralControlFlowGenerator::Node::setParent(StructuralControlFlowGenerator::Node *parent)\n{\n\tmParent = parent;\n}\n\nStructuralControlFlowGenerator::RegionType StructuralControlFlowGenerator::Node::structType() const\n{\n\treturn mRegionType;\n}\n\nQVector<StructuralControlFlowGenerator::Node *> StructuralControlFlowGenerator::Node::structNodes() const\n{\n\treturn mChildren;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <QtGui\/QGuiApplication>\n#include <QtQml\/QQmlEngine>\n#include <QtQml\/QQmlComponent>\n#include <QtQuick\/QQuickWindow>\n#include <QtCore\/QUrl>\n#include <QUrlQuery>\n#include <QDateTime>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n#include <QDebug>\n#include <QJsonObject>\n#include <QJsonDocument>\n#include <QJsonArray>\n#include <QMutex>\n#include <QNetworkAccessManager>\n#include <QTimer>\n\n#include \"chat\/ChatApplication.hpp\"\n#include \"chat\/net\/NetworkRequest.hpp\"\n\nusing chat::ChatApplication;\nusing chat::net::NetworkRequest;\n\nChatApplication::ChatApplication(QObject *parent): QObject(parent) {\n    QQmlEngine *engine = new QQmlEngine;\n    QQmlComponent *component = new QQmlComponent(engine);\n    component->loadUrl(QUrl(\"qrc:\/assets\/ChatWindow.qml\"));\n\n    QObject *root;\n    if (component->isReady())\n        root = component->create();\n    else {\n        qWarning() << component->errorString();\n        return;\n    }\n\n    QObject *button = root->findChild<QObject*>(\"sendButton\");\n    if (button) {\n        connect(button, SIGNAL(clicked()), this, SLOT(onClicked()));\n    }\n    _chatText = root->findChild<QObject*>(\"chatText\");\n    _input = root->findChild<QObject*>(\"input\");\n\n    QTimer *timer = new QTimer(this);\n    connect(timer, SIGNAL(timeout()), this, SLOT(onTimeOut()));\n    timer->start(1000);\n}\n\nvoid ChatApplication::onTimeOut() {\n    QUrl url(\"http:\/\/localhost:8080\/chatServer\/getMessages\");\n    QUrlQuery query;\n    query.addQueryItem(\"after\", \"1\");\n    url.setQuery(query);\n\n    NetworkRequest *request = new NetworkRequest(url);\n    request->get();\n\n    connect(request, SIGNAL(finished(QNetworkReply*)), this, SLOT(onMessages(QNetworkReply*)));\n    connect(request, SIGNAL(finished(QNetworkReply*)), request, SLOT(deleteLater()));\n}\n\nvoid ChatApplication::onMessages(QNetworkReply *reply) {\n\n    QByteArray contents = reply->readAll();\n    QJsonDocument jsonDoc = QJsonDocument::fromJson(contents);\n    QVariantList messages = jsonDoc.object()[\"msg\"].toObject()[\"messages\"].toArray().toVariantList();\n\n    QString string;\n    foreach (QVariant i, messages) {\n        QVariantMap map = i.toMap();\n        string += map[\"sender\"].toString() + \": \" + map[\"message\"].toString() + \"\\n\";\n    }\n\n    _chatText->setProperty(\"text\", string);\n\n    qDebug() << messages;\n}\n\nvoid ChatApplication::onClicked() {\n\n    QUrl url(\"http:\/\/localhost:8080\/chatServer\/postMessage\");\n    QUrlQuery query;\n    query.addQueryItem(\"sender\", \"konrad@EKCHAT.com\");\n    query.addQueryItem(\"timeSent\", QString::number(QDateTime::currentDateTime().toTime_t()));\n    query.addQueryItem(\"conversation\", \"1\");\n    url.setQuery(query);\n\n    NetworkRequest *request = new NetworkRequest(url);\n    request->post(_input->property(\"text\").toByteArray());\n\n    connect(request, SIGNAL(finished(QNetworkReply*)), this, SLOT(onPostFinished(QNetworkReply*)));\n    connect(request, SIGNAL(finished(QNetworkReply*)), request, SLOT(deleteLater()));\n}\n\nvoid ChatApplication::onPostFinished(QNetworkReply *reply) {\n    qDebug() << reply->readAll();\n    qDebug() << reply->errorString();\n}\n<commit_msg>hooked ENTER key to send<commit_after>#include <QtGui\/QGuiApplication>\n#include <QtQml\/QQmlEngine>\n#include <QtQml\/QQmlComponent>\n#include <QtQuick\/QQuickWindow>\n#include <QtCore\/QUrl>\n#include <QUrlQuery>\n#include <QDateTime>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n#include <QDebug>\n#include <QJsonObject>\n#include <QJsonDocument>\n#include <QJsonArray>\n#include <QMutex>\n#include <QNetworkAccessManager>\n#include <QTimer>\n\n#include \"chat\/ChatApplication.hpp\"\n#include \"chat\/net\/NetworkRequest.hpp\"\n\nusing chat::ChatApplication;\nusing chat::net::NetworkRequest;\n\nChatApplication::ChatApplication(QObject *parent): QObject(parent) {\n    QQmlEngine *engine = new QQmlEngine;\n    QQmlComponent *component = new QQmlComponent(engine);\n    component->loadUrl(QUrl(\"qrc:\/assets\/ChatWindow.qml\"));\n\n    QObject *root;\n    if (component->isReady())\n        root = component->create();\n    else {\n        qWarning() << component->errorString();\n        return;\n    }\n\n    QObject *button = root->findChild<QObject*>(\"sendButton\");\n    if (button) {\n        connect(button, SIGNAL(clicked()), this, SLOT(onClicked()));\n    }\n    _chatText = root->findChild<QObject*>(\"chatText\");\n    _input = root->findChild<QObject*>(\"input\");\n\n    connect(_input, SIGNAL(accepted()), this, SLOT(onClicked()));\n\n    QTimer *timer = new QTimer(this);\n    connect(timer, SIGNAL(timeout()), this, SLOT(onTimeOut()));\n    timer->start(1000);\n}\n\nvoid ChatApplication::onTimeOut() {\n    QUrl url(\"http:\/\/localhost:8080\/chatServer\/getMessages\");\n    QUrlQuery query;\n    query.addQueryItem(\"after\", \"1\");\n    url.setQuery(query);\n\n    NetworkRequest *request = new NetworkRequest(url);\n    request->get();\n\n    connect(request, SIGNAL(finished(QNetworkReply*)), this, SLOT(onMessages(QNetworkReply*)));\n    connect(request, SIGNAL(finished(QNetworkReply*)), request, SLOT(deleteLater()));\n}\n\nvoid ChatApplication::onMessages(QNetworkReply *reply) {\n\n    QByteArray contents = reply->readAll();\n    QJsonDocument jsonDoc = QJsonDocument::fromJson(contents);\n    QVariantList messages = jsonDoc.object()[\"msg\"].toObject()[\"messages\"].toArray().toVariantList();\n\n    QString string;\n    foreach (QVariant i, messages) {\n        QVariantMap map = i.toMap();\n        string += map[\"sender\"].toString() + \": \" + map[\"message\"].toString() + \"\\n\";\n    }\n\n    _chatText->setProperty(\"text\", string);\n\n    qDebug() << messages;\n}\n\nvoid ChatApplication::onClicked() {\n\n    QUrl url(\"http:\/\/localhost:8080\/chatServer\/postMessage\");\n    QUrlQuery query;\n    query.addQueryItem(\"sender\", \"konrad@EKCHAT.com\");\n    query.addQueryItem(\"timeSent\", QString::number(QDateTime::currentDateTime().toTime_t()));\n    query.addQueryItem(\"conversation\", \"1\");\n    url.setQuery(query);\n\n    NetworkRequest *request = new NetworkRequest(url);\n    request->post(_input->property(\"text\").toByteArray());\n\n    _input->setProperty(\"text\", \"\");\n\n    connect(request, SIGNAL(finished(QNetworkReply*)), this, SLOT(onPostFinished(QNetworkReply*)));\n    connect(request, SIGNAL(finished(QNetworkReply*)), request, SLOT(deleteLater()));\n}\n\nvoid ChatApplication::onPostFinished(QNetworkReply *reply) {\n    qDebug() << reply->readAll();\n    qDebug() << reply->errorString();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/  (C) Copyright Gennadiy Rozental 2001-2012.\n\/\/  (C) Copyright Beman Dawes 2001.\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 : defines abstract monitor interfaces and implements execution exception\n\/\/  The original Boost Test Library included an implementation detail function\n\/\/  named catch_exceptions() which caught otherwise uncaught C++ exceptions.\n\/\/  It was derived from an existing test framework by Beman Dawes.  The\n\/\/  intent was to expand later to catch other detectable but platform dependent\n\/\/  error events like Unix signals or Windows structured C exceptions.\n\/\/\n\/\/  Requests from early adopters of the Boost Test Library included\n\/\/  configurable levels of error message detail, elimination of templates,\n\/\/  separation of error reporting, and making the catch_exceptions() facilities\n\/\/  available as a public interface.  Support for unit testing also stretched\n\/\/  the function based design.  Implementation within the header became less\n\/\/  attractive due to the need to include many huge system dependent headers,\n\/\/  although still preferable in certain cases.\n\/\/\n\/\/  All those issues have been addressed by introducing the class-based\n\/\/  design presented here.\n\/\/ ***************************************************************************\n\n#ifndef BOOST_TEST_EXECUTION_MONITOR_HPP_071894GER\n#define BOOST_TEST_EXECUTION_MONITOR_HPP_071894GER\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/global_typedef.hpp>\n#include <boost\/test\/detail\/fwd_decl.hpp>\n#include <boost\/test\/utils\/class_properties.hpp>\n\n\/\/ Boost\n#include <boost\/shared_ptr.hpp>\n#include <boost\/scoped_array.hpp>\n#include <boost\/type.hpp>\n#include <boost\/cstdlib.hpp>\n#include <boost\/function\/function0.hpp>\n\n#include <boost\/test\/detail\/suppress_warnings.hpp>\n\n#ifdef BOOST_SEH_BASED_SIGNAL_HANDLING\n\n\/\/ for the FP constants and control routines\n#include <float.h>\n\n#ifndef EM_INVALID\n#define EM_INVALID _EM_INVALID\n#endif\n\n#ifndef EM_DENORMAL\n#define EM_DENORMAL _EM_DENORMAL\n#endif\n\n#ifndef EM_ZERODIVIDE\n#define EM_ZERODIVIDE _EM_ZERODIVIDE\n#endif\n\n#ifndef EM_OVERFLOW\n#define EM_OVERFLOW _EM_OVERFLOW\n#endif\n\n#ifndef EM_UNDERFLOW\n#define EM_UNDERFLOW _EM_UNDERFLOW\n#endif\n\n#ifndef MCW_EM\n#define MCW_EM _MCW_EM\n#endif\n\n#else \/\/ based on ISO C standard\n\n#if !defined(BOOST_NO_FENV_H) \n  #include <boost\/detail\/fenv.hpp>\n#endif\n\n#endif\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************        detail::translator_holder_base        ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nnamespace detail {\n\nclass translator_holder_base;\ntypedef boost::shared_ptr<translator_holder_base> translator_holder_base_ptr;\n\nclass BOOST_TEST_DECL translator_holder_base {\nprotected:\n    typedef boost::unit_test::const_string const_string;\npublic:\n    \/\/ Constructor\n    translator_holder_base( translator_holder_base_ptr next, const_string tag )\n    : m_next( next )\n    , m_tag( std::string() + tag )\n    {\n    }\n\n    \/\/ Destructor\n    virtual     ~translator_holder_base() {}\n\n    \/\/ translator holder interface\n    \/\/ invokes the function F inside the try\/catch guarding against specific exception\n    virtual int operator()( boost::function<int ()> const& F ) = 0;\n\n    \/\/ erases specific translator holder from the chain\n    translator_holder_base_ptr erase( translator_holder_base_ptr this_, const_string tag ) \n    {\n        if( m_next )\n            m_next = m_next->erase( m_next, tag );\n\n        return m_tag == tag ? m_next : this_;\n    }\n#ifndef BOOST_NO_RTTI\n    virtual translator_holder_base_ptr erase( translator_holder_base_ptr this_, std::type_info const& ) = 0;\n    template<typename ExceptionType>\n    translator_holder_base_ptr erase( translator_holder_base_ptr this_, boost::type<ExceptionType>* = 0 )\n    {\n        if( m_next )\n            m_next = m_next->erase<ExceptionType>( m_next );\n\n        return erase( this_, typeid(ExceptionType) );\n    }\n#endif\n\nprotected:\n    \/\/ Data members\n    translator_holder_base_ptr  m_next;\n    std::string                 m_tag;\n};\n\n} \/\/ namespace detail\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************              execution_exception             ************** \/\/\n\/\/ ************************************************************************** \/\/\n    \n\/\/  design rationale: fear of being out (or nearly out) of memory.\n    \nclass BOOST_TEST_DECL execution_exception {\n    typedef boost::unit_test::const_string const_string;\npublic:\n    enum error_code {\n        \/\/  These values are sometimes used as program return codes.\n        \/\/  The particular values have been chosen to avoid conflicts with\n        \/\/  commonly used program return codes: values < 100 are often user\n        \/\/  assigned, values > 255 are sometimes used to report system errors.\n        \/\/  Gaps in values allow for orderly expansion.\n        \n        no_error               = 0,   \/\/ for completeness only; never returned\n        user_error             = 200, \/\/ user reported non-fatal error\n        cpp_exception_error    = 205, \/\/ see note (1) below\n        system_error           = 210, \/\/ see note (2) below\n        timeout_error          = 215, \/\/ only detectable on certain platforms\n        user_fatal_error       = 220, \/\/ user reported fatal error\n        system_fatal_error     = 225  \/\/ see note (2) below\n        \n        \/\/  Note 1: Only uncaught C++ exceptions are treated as errors.\n        \/\/  If the application catches a C++ exception, it will never reach\n        \/\/  the execution_monitor.\n        \n        \/\/  Note 2: These errors include Unix signals and Windows structured\n        \/\/  exceptions.  They are often initiated by hardware traps.\n        \/\/\n        \/\/  The implementation decides what is a fatal_system_exception and what is\n        \/\/  just a system_exception.  Fatal errors are so likely to have corrupted\n        \/\/  machine state (like a stack overflow or addressing exception) that it\n        \/\/  is unreasonable to continue execution.\n    };\n    \n    struct BOOST_TEST_DECL location {\n        explicit    location( char const* file_name = 0, size_t line_num = 0, char const* func = 0 );\n\n        const_string    m_file_name;\n        size_t          m_line_num;\n        const_string    m_function;\n    };\n\n    \/\/ Constructor\n    execution_exception( error_code ec_, const_string what_msg_, location const& location_ ); \/\/ max length 256 inc '\\0'\n\n    \/\/ Access methods\n    error_code      code() const    { return m_error_code; }\n    const_string    what() const    { return m_what; }\n    location const& where() const   { return m_location; }\n\nprivate:\n    \/\/ Data members\n    error_code      m_error_code;\n    const_string    m_what;\n    location        m_location;\n}; \/\/ execution_exception\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************               execution_monitor              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass BOOST_TEST_DECL execution_monitor {\n    typedef boost::unit_test::const_string const_string;\npublic:\n    \/\/ Constructor\n    execution_monitor();\n\n    \/\/ Public properties\n    \n    \/\/  The p_catch_system_errors parameter specifies whether the monitor should \n    \/\/  try to catch system errors\/exceptions that would cause program to crash \n    \/\/  in regular case\n    unit_test::readwrite_property<bool> p_catch_system_errors; \n\n    \/\/  The p_auto_start_dbg parameter specifies whether the monitor should \n    \/\/  try to attach debugger in case of caught system error\n    unit_test::readwrite_property<bool> p_auto_start_dbg;\n\n    \/\/  The p_timeout parameter specifies the seconds that elapse before\n    \/\/  a timer_error occurs.  May be ignored on some platforms.\n    unit_test::readwrite_property<int>  p_timeout;\n\n    \/\/  The p_use_alt_stack parameter specifies whether the monitor should\n    \/\/  use alternative stack for the signal catching\n    unit_test::readwrite_property<bool> p_use_alt_stack;\n\n    \/\/  The p_detect_fp_exceptions parameter specifies whether the monitor should\n    \/\/  try to detect hardware floating point exceptions (!= 0), and which specific exception to catch\n    unit_test::readwrite_property<unsigned> p_detect_fp_exceptions;\n\n    int         execute( boost::function<int ()> const& F ); \n    \/\/  Returns:  Value returned by function call F().\n    \/\/\n    \/\/  Effects:  Calls executes supplied function F inside a try\/catch block which also may\n    \/\/  include other unspecified platform dependent error detection code.\n    \/\/\n    \/\/  Throws: execution_exception on an uncaught C++ exception,\n    \/\/  a hardware or software signal, trap, or other exception.\n    \/\/\n    \/\/  Note: execute() doesn't consider it an error for F to return a non-zero value.\n\n    void         vexecute( boost::function<void ()> const& F ); \n    \/\/  Effects:  Same as above, but returns nothing\n    \n    \/\/ register custom (user supplied) exception translator\n    template<typename ExceptionType, typename ExceptionTranslator>\n    void        register_exception_translator( ExceptionTranslator const& tr, const_string tag = const_string(), boost::type<ExceptionType>* = 0 );\n\n    \/\/ erase custom exception translator\n    void        erase_exception_translator( const_string tag )\n    {\n        m_custom_translators = m_custom_translators->erase( m_custom_translators, tag );\n    }\n    template<typename ExceptionType>\n    void        erase_exception_translator( boost::type<ExceptionType>* = 0 )\n    {\n        m_custom_translators = m_custom_translators->template erase<ExceptionType>( m_custom_translators );\n    }\n\nprivate:\n    \/\/ implementation helpers\n    int         catch_signals( boost::function<int ()> const& F );\n\n    \/\/ Data members\n    detail::translator_holder_base_ptr  m_custom_translators;\n    boost::scoped_array<char>           m_alt_stack;\n}; \/\/ execution_monitor\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************          detail::translator_holder           ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nnamespace detail {\n\ntemplate<typename ExceptionType, typename ExceptionTranslator>\nclass translator_holder : public translator_holder_base\n{\npublic:\n    explicit    translator_holder( ExceptionTranslator const& tr, translator_holder_base_ptr& next, const_string tag = const_string() )\n    : translator_holder_base( next, tag ), m_translator( tr ) {}\n\n    \/\/ translator holder interface\n    virtual int operator()( boost::function<int ()> const& F )\n    {\n        try {\n            return m_next ? (*m_next)( F ) : F();\n        } catch( ExceptionType const& e ) {\n            m_translator( e );\n            return boost::exit_exception_failure;\n        }\n    }\n#ifndef BOOST_NO_RTTI\n    virtual translator_holder_base_ptr erase( translator_holder_base_ptr this_, std::type_info const& ti ) \n    {\n        return ti == typeid(ExceptionType) ? m_next : this_;\n    }\n#endif\n\nprivate:\n    \/\/ Data members\n    ExceptionTranslator m_translator;\n};\n\n} \/\/ namespace detail\n\ntemplate<typename ExceptionType, typename ExceptionTranslator>\nvoid\nexecution_monitor::register_exception_translator( ExceptionTranslator const& tr, const_string tag, boost::type<ExceptionType>* )\n{\n    m_custom_translators.reset( \n        new detail::translator_holder<ExceptionType,ExceptionTranslator>( tr, m_custom_translators, tag ) );\n}\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************               execution_aborted              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nstruct execution_aborted {};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************                  system_error                ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass system_error {\npublic:\n    \/\/ Constructor\n    explicit    system_error( char const* exp );\n\n    unit_test::readonly_property<long>          p_errno; \n    unit_test::readonly_property<char const*>   p_failed_exp; \n};\n\n#define BOOST_TEST_SYS_ASSERT( exp ) if( (exp) ) ; else throw ::boost::system_error( BOOST_STRINGIZE( exp ) )\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************Floating point exception management interface ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nnamespace fpe {\n\nenum masks {\n    BOOST_FPE_OFF       = 0,\n\n#ifdef BOOST_SEH_BASED_SIGNAL_HANDLING\n    BOOST_FPE_DIVBYZERO = EM_ZERODIVIDE,\n    BOOST_FPE_INEXACT   = EM_INEXACT,\n    BOOST_FPE_INVALID   = EM_INVALID,\n    BOOST_FPE_OVERFLOW  = EM_OVERFLOW,\n    BOOST_FPE_UNDERFLOW = EM_UNDERFLOW|EM_DENORMAL,\n\n    BOOST_FPE_ALL       = MCW_EM,\n#elif defined(BOOST_NO_FENV_H) || defined(BOOST_CLANG) \n    BOOST_FPE_ALL       = 1,\n#else\n    BOOST_FPE_DIVBYZERO = FE_DIVBYZERO,\n    BOOST_FPE_INEXACT   = FE_INEXACT,\n    BOOST_FPE_INVALID   = FE_INVALID,\n    BOOST_FPE_OVERFLOW  = FE_OVERFLOW,\n    BOOST_FPE_UNDERFLOW = FE_UNDERFLOW,\n\n    BOOST_FPE_ALL       = FE_ALL_EXCEPT,\n#endif\n    BOOST_FPE_INV       = BOOST_FPE_ALL+1\n};\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/ return the previous set of enabled exceptions when successful, and BOOST_FPE_INV otherwise\nunsigned BOOST_TEST_DECL enable( unsigned mask );\nunsigned BOOST_TEST_DECL disable( unsigned mask );\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace fpe\n}  \/\/ namespace boost\n\n\n#include <boost\/test\/detail\/enable_warnings.hpp>\n\n#endif\n\n<commit_msg>More correct fix for Boost.Test and RTTI-off<commit_after>\/\/  (C) Copyright Gennadiy Rozental 2001-2012.\n\/\/  (C) Copyright Beman Dawes 2001.\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 : defines abstract monitor interfaces and implements execution exception\n\/\/  The original Boost Test Library included an implementation detail function\n\/\/  named catch_exceptions() which caught otherwise uncaught C++ exceptions.\n\/\/  It was derived from an existing test framework by Beman Dawes.  The\n\/\/  intent was to expand later to catch other detectable but platform dependent\n\/\/  error events like Unix signals or Windows structured C exceptions.\n\/\/\n\/\/  Requests from early adopters of the Boost Test Library included\n\/\/  configurable levels of error message detail, elimination of templates,\n\/\/  separation of error reporting, and making the catch_exceptions() facilities\n\/\/  available as a public interface.  Support for unit testing also stretched\n\/\/  the function based design.  Implementation within the header became less\n\/\/  attractive due to the need to include many huge system dependent headers,\n\/\/  although still preferable in certain cases.\n\/\/\n\/\/  All those issues have been addressed by introducing the class-based\n\/\/  design presented here.\n\/\/ ***************************************************************************\n\n#ifndef BOOST_TEST_EXECUTION_MONITOR_HPP_071894GER\n#define BOOST_TEST_EXECUTION_MONITOR_HPP_071894GER\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/global_typedef.hpp>\n#include <boost\/test\/detail\/fwd_decl.hpp>\n#include <boost\/test\/utils\/class_properties.hpp>\n\n\/\/ Boost\n#include <boost\/shared_ptr.hpp>\n#include <boost\/scoped_array.hpp>\n#include <boost\/type.hpp>\n#include <boost\/cstdlib.hpp>\n#include <boost\/function\/function0.hpp>\n\n#include <boost\/test\/detail\/suppress_warnings.hpp>\n\n#ifdef BOOST_SEH_BASED_SIGNAL_HANDLING\n\n\/\/ for the FP constants and control routines\n#include <float.h>\n\n#ifndef EM_INVALID\n#define EM_INVALID _EM_INVALID\n#endif\n\n#ifndef EM_DENORMAL\n#define EM_DENORMAL _EM_DENORMAL\n#endif\n\n#ifndef EM_ZERODIVIDE\n#define EM_ZERODIVIDE _EM_ZERODIVIDE\n#endif\n\n#ifndef EM_OVERFLOW\n#define EM_OVERFLOW _EM_OVERFLOW\n#endif\n\n#ifndef EM_UNDERFLOW\n#define EM_UNDERFLOW _EM_UNDERFLOW\n#endif\n\n#ifndef MCW_EM\n#define MCW_EM _MCW_EM\n#endif\n\n#else \/\/ based on ISO C standard\n\n#if !defined(BOOST_NO_FENV_H) \n  #include <boost\/detail\/fenv.hpp>\n#endif\n\n#endif\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************        detail::translator_holder_base        ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nnamespace detail {\n\nclass translator_holder_base;\ntypedef boost::shared_ptr<translator_holder_base> translator_holder_base_ptr;\n\nclass BOOST_TEST_DECL translator_holder_base {\nprotected:\n    typedef boost::unit_test::const_string const_string;\npublic:\n    \/\/ Constructor\n    translator_holder_base( translator_holder_base_ptr next, const_string tag )\n    : m_next( next )\n    , m_tag( std::string() + tag )\n    {\n    }\n\n    \/\/ Destructor\n    virtual     ~translator_holder_base() {}\n\n    \/\/ translator holder interface\n    \/\/ invokes the function F inside the try\/catch guarding against specific exception\n    virtual int operator()( boost::function<int ()> const& F ) = 0;\n\n    \/\/ erases specific translator holder from the chain\n    translator_holder_base_ptr erase( translator_holder_base_ptr this_, const_string tag ) \n    {\n        if( m_next )\n            m_next = m_next->erase( m_next, tag );\n\n        return m_tag == tag ? m_next : this_;\n    }\n#ifndef BOOST_NO_RTTI\n    virtual translator_holder_base_ptr erase( translator_holder_base_ptr this_, std::type_info const& ) = 0;\n    template<typename ExceptionType>\n    translator_holder_base_ptr erase( translator_holder_base_ptr this_, boost::type<ExceptionType>* = 0 )\n    {\n        if( m_next )\n            m_next = m_next->erase<ExceptionType>( m_next );\n\n        return erase( this_, typeid(ExceptionType) );\n    }\n#endif\n\nprotected:\n    \/\/ Data members\n    translator_holder_base_ptr  m_next;\n    std::string                 m_tag;\n};\n\n} \/\/ namespace detail\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************              execution_exception             ************** \/\/\n\/\/ ************************************************************************** \/\/\n    \n\/\/  design rationale: fear of being out (or nearly out) of memory.\n    \nclass BOOST_TEST_DECL execution_exception {\n    typedef boost::unit_test::const_string const_string;\npublic:\n    enum error_code {\n        \/\/  These values are sometimes used as program return codes.\n        \/\/  The particular values have been chosen to avoid conflicts with\n        \/\/  commonly used program return codes: values < 100 are often user\n        \/\/  assigned, values > 255 are sometimes used to report system errors.\n        \/\/  Gaps in values allow for orderly expansion.\n        \n        no_error               = 0,   \/\/ for completeness only; never returned\n        user_error             = 200, \/\/ user reported non-fatal error\n        cpp_exception_error    = 205, \/\/ see note (1) below\n        system_error           = 210, \/\/ see note (2) below\n        timeout_error          = 215, \/\/ only detectable on certain platforms\n        user_fatal_error       = 220, \/\/ user reported fatal error\n        system_fatal_error     = 225  \/\/ see note (2) below\n        \n        \/\/  Note 1: Only uncaught C++ exceptions are treated as errors.\n        \/\/  If the application catches a C++ exception, it will never reach\n        \/\/  the execution_monitor.\n        \n        \/\/  Note 2: These errors include Unix signals and Windows structured\n        \/\/  exceptions.  They are often initiated by hardware traps.\n        \/\/\n        \/\/  The implementation decides what is a fatal_system_exception and what is\n        \/\/  just a system_exception.  Fatal errors are so likely to have corrupted\n        \/\/  machine state (like a stack overflow or addressing exception) that it\n        \/\/  is unreasonable to continue execution.\n    };\n    \n    struct BOOST_TEST_DECL location {\n        explicit    location( char const* file_name = 0, size_t line_num = 0, char const* func = 0 );\n\n        const_string    m_file_name;\n        size_t          m_line_num;\n        const_string    m_function;\n    };\n\n    \/\/ Constructor\n    execution_exception( error_code ec_, const_string what_msg_, location const& location_ ); \/\/ max length 256 inc '\\0'\n\n    \/\/ Access methods\n    error_code      code() const    { return m_error_code; }\n    const_string    what() const    { return m_what; }\n    location const& where() const   { return m_location; }\n\nprivate:\n    \/\/ Data members\n    error_code      m_error_code;\n    const_string    m_what;\n    location        m_location;\n}; \/\/ execution_exception\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************               execution_monitor              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass BOOST_TEST_DECL execution_monitor {\n    typedef boost::unit_test::const_string const_string;\npublic:\n    \/\/ Constructor\n    execution_monitor();\n\n    \/\/ Public properties\n    \n    \/\/  The p_catch_system_errors parameter specifies whether the monitor should \n    \/\/  try to catch system errors\/exceptions that would cause program to crash \n    \/\/  in regular case\n    unit_test::readwrite_property<bool> p_catch_system_errors; \n\n    \/\/  The p_auto_start_dbg parameter specifies whether the monitor should \n    \/\/  try to attach debugger in case of caught system error\n    unit_test::readwrite_property<bool> p_auto_start_dbg;\n\n    \/\/  The p_timeout parameter specifies the seconds that elapse before\n    \/\/  a timer_error occurs.  May be ignored on some platforms.\n    unit_test::readwrite_property<int>  p_timeout;\n\n    \/\/  The p_use_alt_stack parameter specifies whether the monitor should\n    \/\/  use alternative stack for the signal catching\n    unit_test::readwrite_property<bool> p_use_alt_stack;\n\n    \/\/  The p_detect_fp_exceptions parameter specifies whether the monitor should\n    \/\/  try to detect hardware floating point exceptions (!= 0), and which specific exception to catch\n    unit_test::readwrite_property<unsigned> p_detect_fp_exceptions;\n\n    int         execute( boost::function<int ()> const& F ); \n    \/\/  Returns:  Value returned by function call F().\n    \/\/\n    \/\/  Effects:  Calls executes supplied function F inside a try\/catch block which also may\n    \/\/  include other unspecified platform dependent error detection code.\n    \/\/\n    \/\/  Throws: execution_exception on an uncaught C++ exception,\n    \/\/  a hardware or software signal, trap, or other exception.\n    \/\/\n    \/\/  Note: execute() doesn't consider it an error for F to return a non-zero value.\n\n    void         vexecute( boost::function<void ()> const& F ); \n    \/\/  Effects:  Same as above, but returns nothing\n    \n    \/\/ register custom (user supplied) exception translator\n    template<typename ExceptionType, typename ExceptionTranslator>\n    void        register_exception_translator( ExceptionTranslator const& tr, const_string tag = const_string(), boost::type<ExceptionType>* = 0 );\n\n    \/\/ erase custom exception translator\n    void        erase_exception_translator( const_string tag )\n    {\n        m_custom_translators = m_custom_translators->erase( m_custom_translators, tag );\n    }\n#ifndef BOOST_NO_RTTI\n    template<typename ExceptionType>\n    void        erase_exception_translator( boost::type<ExceptionType>* = 0 )\n    {\n        m_custom_translators = m_custom_translators->erase<ExceptionType>( m_custom_translators );\n    }\n#endif\n\nprivate:\n    \/\/ implementation helpers\n    int         catch_signals( boost::function<int ()> const& F );\n\n    \/\/ Data members\n    detail::translator_holder_base_ptr  m_custom_translators;\n    boost::scoped_array<char>           m_alt_stack;\n}; \/\/ execution_monitor\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************          detail::translator_holder           ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nnamespace detail {\n\ntemplate<typename ExceptionType, typename ExceptionTranslator>\nclass translator_holder : public translator_holder_base\n{\npublic:\n    explicit    translator_holder( ExceptionTranslator const& tr, translator_holder_base_ptr& next, const_string tag = const_string() )\n    : translator_holder_base( next, tag ), m_translator( tr ) {}\n\n    \/\/ translator holder interface\n    virtual int operator()( boost::function<int ()> const& F )\n    {\n        try {\n            return m_next ? (*m_next)( F ) : F();\n        } catch( ExceptionType const& e ) {\n            m_translator( e );\n            return boost::exit_exception_failure;\n        }\n    }\n#ifndef BOOST_NO_RTTI\n    virtual translator_holder_base_ptr erase( translator_holder_base_ptr this_, std::type_info const& ti ) \n    {\n        return ti == typeid(ExceptionType) ? m_next : this_;\n    }\n#endif\n\nprivate:\n    \/\/ Data members\n    ExceptionTranslator m_translator;\n};\n\n} \/\/ namespace detail\n\ntemplate<typename ExceptionType, typename ExceptionTranslator>\nvoid\nexecution_monitor::register_exception_translator( ExceptionTranslator const& tr, const_string tag, boost::type<ExceptionType>* )\n{\n    m_custom_translators.reset( \n        new detail::translator_holder<ExceptionType,ExceptionTranslator>( tr, m_custom_translators, tag ) );\n}\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************               execution_aborted              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nstruct execution_aborted {};\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************                  system_error                ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass system_error {\npublic:\n    \/\/ Constructor\n    explicit    system_error( char const* exp );\n\n    unit_test::readonly_property<long>          p_errno; \n    unit_test::readonly_property<char const*>   p_failed_exp; \n};\n\n#define BOOST_TEST_SYS_ASSERT( exp ) if( (exp) ) ; else throw ::boost::system_error( BOOST_STRINGIZE( exp ) )\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************Floating point exception management interface ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nnamespace fpe {\n\nenum masks {\n    BOOST_FPE_OFF       = 0,\n\n#ifdef BOOST_SEH_BASED_SIGNAL_HANDLING\n    BOOST_FPE_DIVBYZERO = EM_ZERODIVIDE,\n    BOOST_FPE_INEXACT   = EM_INEXACT,\n    BOOST_FPE_INVALID   = EM_INVALID,\n    BOOST_FPE_OVERFLOW  = EM_OVERFLOW,\n    BOOST_FPE_UNDERFLOW = EM_UNDERFLOW|EM_DENORMAL,\n\n    BOOST_FPE_ALL       = MCW_EM,\n#elif defined(BOOST_NO_FENV_H) || defined(BOOST_CLANG) \n    BOOST_FPE_ALL       = 1,\n#else\n    BOOST_FPE_DIVBYZERO = FE_DIVBYZERO,\n    BOOST_FPE_INEXACT   = FE_INEXACT,\n    BOOST_FPE_INVALID   = FE_INVALID,\n    BOOST_FPE_OVERFLOW  = FE_OVERFLOW,\n    BOOST_FPE_UNDERFLOW = FE_UNDERFLOW,\n\n    BOOST_FPE_ALL       = FE_ALL_EXCEPT,\n#endif\n    BOOST_FPE_INV       = BOOST_FPE_ALL+1\n};\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/ return the previous set of enabled exceptions when successful, and BOOST_FPE_INV otherwise\nunsigned BOOST_TEST_DECL enable( unsigned mask );\nunsigned BOOST_TEST_DECL disable( unsigned mask );\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace fpe\n}  \/\/ namespace boost\n\n\n#include <boost\/test\/detail\/enable_warnings.hpp>\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cilantro\/data_containers.hpp>\n\nnamespace cilantro {\n    struct IndexAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = 0};\n\n        inline IndexAccumulator() {}\n\n        inline IndexAccumulator(size_t i) : indices(1,i) {}\n\n        inline IndexAccumulator& mergeWith(const IndexAccumulator &other) {\n            indices.insert(indices.end(), other.indices.begin(), other.indices.end());\n            return *this;\n        }\n\n        std::vector<size_t> indices;\n    };\n\n    class IndexAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef IndexAccumulator Accumulator;\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(i);\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.indices.emplace_back(i);\n            return accum;\n        }\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    struct PointSumAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = (EigenDim != Eigen::Dynamic) && (sizeof(Vector<ScalarT,EigenDim>) % 16 == 0)};\n\n        inline PointSumAccumulator(size_t dim = 0) : pointSum(Vector<ScalarT,EigenDim>::Zero(dim,1)), pointCount(0) {}\n\n        inline PointSumAccumulator(const Eigen::Ref<const Vector<ScalarT,EigenDim>> &point)\n                : pointSum(point), pointCount(1)\n        {}\n\n        inline PointSumAccumulator& mergeWith(const PointSumAccumulator &other) {\n            pointSum += other.pointSum;\n            pointCount += other.pointCount;\n            return *this;\n        }\n\n        Vector<ScalarT,EigenDim> pointSum;\n        size_t pointCount;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    class PointSumAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef PointSumAccumulator<ScalarT,EigenDim> Accumulator;\n\n        inline PointSumAccumulatorProxy(const ConstVectorSetMatrixMap<ScalarT,EigenDim> &points)\n                : points_(points)\n        {}\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(points_.col(i));\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.pointSum += points_.col(i);\n            accum.pointCount++;\n            return accum;\n        }\n\n    private:\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> points_;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    struct PointNormalSumAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = (EigenDim != Eigen::Dynamic) && (sizeof(Vector<ScalarT,EigenDim>) % 16 == 0)};\n\n        inline PointNormalSumAccumulator(size_t dim = 0)\n                : pointSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  normalSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  pointCount(0)\n        {}\n\n        inline PointNormalSumAccumulator(const Eigen::Ref<const Vector<ScalarT,EigenDim>> &point,\n                                         const Eigen::Ref<const Vector<ScalarT,EigenDim>> &normal)\n                : pointSum(point), normalSum(normal), pointCount(1)\n        {}\n\n        inline PointNormalSumAccumulator& mergeWith(const PointNormalSumAccumulator &other) {\n            pointSum += other.pointSum;\n            normalSum += other.normalSum;\n            pointCount += other.pointCount;\n            return *this;\n        }\n\n        Vector<ScalarT,EigenDim> pointSum;\n        Vector<ScalarT,EigenDim> normalSum;\n        size_t pointCount;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    class PointNormalSumAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef PointNormalSumAccumulator<ScalarT,EigenDim> Accumulator;\n\n        inline PointNormalSumAccumulatorProxy(const ConstVectorSetMatrixMap<ScalarT,EigenDim> &points,\n                                              const ConstVectorSetMatrixMap<ScalarT,EigenDim> &normals)\n                : points_(points), normals_(normals)\n        {}\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(points_.col(i), normals_.col(i));\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.pointSum += points_.col(i);\n            if (accum.normalSum.dot(normals_.col(i)) < (ScalarT)0.0) {\n                accum.normalSum -= normals_.col(i);\n            } else {\n                accum.normalSum += normals_.col(i);\n            }\n            accum.pointCount++;\n            return accum;\n        }\n\n    private:\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> points_;\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> normals_;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    struct PointColorSumAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = (EigenDim != Eigen::Dynamic) && (sizeof(Vector<ScalarT,EigenDim>) % 16 == 0)};\n\n        inline PointColorSumAccumulator(size_t dim = 0)\n                : pointSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  colorSum(Vector<float,3>::Zero()),\n                  pointCount(0)\n        {}\n\n        inline PointColorSumAccumulator(const Eigen::Ref<const Vector<ScalarT,EigenDim>> &point,\n                                        const Eigen::Ref<const Vector<float,3>> &color)\n                : pointSum(point), colorSum(color), pointCount(1)\n        {}\n\n        inline PointColorSumAccumulator& mergeWith(const PointColorSumAccumulator &other) {\n            pointSum += other.pointSum;\n            colorSum += other.colorSum;\n            pointCount += other.pointCount;\n            return *this;\n        }\n\n        Vector<ScalarT,EigenDim> pointSum;\n        Vector<float,3> colorSum;\n        size_t pointCount;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    class PointColorSumAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef PointColorSumAccumulator<ScalarT,EigenDim> Accumulator;\n\n        inline PointColorSumAccumulatorProxy(const ConstVectorSetMatrixMap<ScalarT,EigenDim> &points,\n                                             const ConstVectorSetMatrixMap<float,3> &colors)\n                : points_(points), colors_(colors)\n        {}\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(points_.col(i), colors_.col(i));\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.pointSum += points_.col(i);\n            accum.colorSum += colors_.col(i);\n            accum.pointCount++;\n            return accum;\n        }\n\n    private:\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> points_;\n        ConstVectorSetMatrixMap<float,3> colors_;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    struct PointNormalColorSumAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = (EigenDim != Eigen::Dynamic) && (sizeof(Vector<ScalarT,EigenDim>) % 16 == 0)};\n\n        inline PointNormalColorSumAccumulator(size_t dim = 0)\n                : pointSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  normalSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  colorSum(Vector<float,3>::Zero()),\n                  pointCount(0)\n        {}\n\n        inline PointNormalColorSumAccumulator(const Eigen::Ref<const Vector<ScalarT,EigenDim>> &point,\n                                              const Eigen::Ref<const Vector<ScalarT,EigenDim>> &normal,\n                                              const Eigen::Ref<const Vector<float,3>> &color)\n                : pointSum(point), normalSum(normal), colorSum(color), pointCount(1)\n        {}\n\n        inline PointNormalColorSumAccumulator& mergeWith(const PointNormalColorSumAccumulator &other) {\n            pointSum += other.pointSum;\n            normalSum += other.normalSum;\n            colorSum += other.colorSum;\n            pointCount += other.pointCount;\n            return *this;\n        }\n\n        Vector<ScalarT,EigenDim> pointSum;\n        Vector<ScalarT,EigenDim> normalSum;\n        Vector<float,3> colorSum;\n        size_t pointCount;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    class PointNormalColorSumAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef PointNormalColorSumAccumulator<ScalarT,EigenDim> Accumulator;\n\n        inline PointNormalColorSumAccumulatorProxy(const ConstVectorSetMatrixMap<ScalarT,EigenDim> &points,\n                                                   const ConstVectorSetMatrixMap<ScalarT,EigenDim> &normals,\n                                                   const ConstVectorSetMatrixMap<float,3> &colors)\n                : points_(points), normals_(normals), colors_(colors)\n        {}\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(points_.col(i), normals_.col(i), colors_.col(i));\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.pointSum += points_.col(i);\n            if (accum.normalSum.dot(normals_.col(i)) < (ScalarT)0.0) {\n                accum.normalSum -= normals_.col(i);\n            } else {\n                accum.normalSum += normals_.col(i);\n            }\n            accum.colorSum += colors_.col(i);\n            accum.pointCount++;\n            return accum;\n        }\n\n    private:\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> points_;\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> normals_;\n        ConstVectorSetMatrixMap<float,3> colors_;\n    };\n}\n<commit_msg>Fixed discrepancy in enforcing normal consistency in parallel grid accumulator<commit_after>#pragma once\n\n#include <cilantro\/data_containers.hpp>\n\nnamespace cilantro {\n    struct IndexAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = 0};\n\n        inline IndexAccumulator() {}\n\n        inline IndexAccumulator(size_t i) : indices(1,i) {}\n\n        inline IndexAccumulator& mergeWith(const IndexAccumulator &other) {\n            indices.insert(indices.end(), other.indices.begin(), other.indices.end());\n            return *this;\n        }\n\n        std::vector<size_t> indices;\n    };\n\n    class IndexAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef IndexAccumulator Accumulator;\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(i);\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.indices.emplace_back(i);\n            return accum;\n        }\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    struct PointSumAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = (EigenDim != Eigen::Dynamic) && (sizeof(Vector<ScalarT,EigenDim>) % 16 == 0)};\n\n        inline PointSumAccumulator(size_t dim = 0) : pointSum(Vector<ScalarT,EigenDim>::Zero(dim,1)), pointCount(0) {}\n\n        inline PointSumAccumulator(const Eigen::Ref<const Vector<ScalarT,EigenDim>> &point)\n                : pointSum(point), pointCount(1)\n        {}\n\n        inline PointSumAccumulator& mergeWith(const PointSumAccumulator &other) {\n            pointSum += other.pointSum;\n            pointCount += other.pointCount;\n            return *this;\n        }\n\n        Vector<ScalarT,EigenDim> pointSum;\n        size_t pointCount;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    class PointSumAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef PointSumAccumulator<ScalarT,EigenDim> Accumulator;\n\n        inline PointSumAccumulatorProxy(const ConstVectorSetMatrixMap<ScalarT,EigenDim> &points)\n                : points_(points)\n        {}\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(points_.col(i));\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.pointSum += points_.col(i);\n            accum.pointCount++;\n            return accum;\n        }\n\n    private:\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> points_;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    struct PointNormalSumAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = (EigenDim != Eigen::Dynamic) && (sizeof(Vector<ScalarT,EigenDim>) % 16 == 0)};\n\n        inline PointNormalSumAccumulator(size_t dim = 0)\n                : pointSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  normalSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  pointCount(0)\n        {}\n\n        inline PointNormalSumAccumulator(const Eigen::Ref<const Vector<ScalarT,EigenDim>> &point,\n                                         const Eigen::Ref<const Vector<ScalarT,EigenDim>> &normal)\n                : pointSum(point), normalSum(normal), pointCount(1)\n        {}\n\n        inline PointNormalSumAccumulator& mergeWith(const PointNormalSumAccumulator &other) {\n            pointSum += other.pointSum;\n            if (normalSum.dot(other.normalSum) < (ScalarT)0.0) {\n                normalSum -= other.normalSum;\n            } else {\n                normalSum += other.normalSum;\n            }\n            pointCount += other.pointCount;\n            return *this;\n        }\n\n        Vector<ScalarT,EigenDim> pointSum;\n        Vector<ScalarT,EigenDim> normalSum;\n        size_t pointCount;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    class PointNormalSumAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef PointNormalSumAccumulator<ScalarT,EigenDim> Accumulator;\n\n        inline PointNormalSumAccumulatorProxy(const ConstVectorSetMatrixMap<ScalarT,EigenDim> &points,\n                                              const ConstVectorSetMatrixMap<ScalarT,EigenDim> &normals)\n                : points_(points), normals_(normals)\n        {}\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(points_.col(i), normals_.col(i));\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.pointSum += points_.col(i);\n            if (accum.normalSum.dot(normals_.col(i)) < (ScalarT)0.0) {\n                accum.normalSum -= normals_.col(i);\n            } else {\n                accum.normalSum += normals_.col(i);\n            }\n            accum.pointCount++;\n            return accum;\n        }\n\n    private:\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> points_;\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> normals_;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    struct PointColorSumAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = (EigenDim != Eigen::Dynamic) && (sizeof(Vector<ScalarT,EigenDim>) % 16 == 0)};\n\n        inline PointColorSumAccumulator(size_t dim = 0)\n                : pointSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  colorSum(Vector<float,3>::Zero()),\n                  pointCount(0)\n        {}\n\n        inline PointColorSumAccumulator(const Eigen::Ref<const Vector<ScalarT,EigenDim>> &point,\n                                        const Eigen::Ref<const Vector<float,3>> &color)\n                : pointSum(point), colorSum(color), pointCount(1)\n        {}\n\n        inline PointColorSumAccumulator& mergeWith(const PointColorSumAccumulator &other) {\n            pointSum += other.pointSum;\n            colorSum += other.colorSum;\n            pointCount += other.pointCount;\n            return *this;\n        }\n\n        Vector<ScalarT,EigenDim> pointSum;\n        Vector<float,3> colorSum;\n        size_t pointCount;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    class PointColorSumAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef PointColorSumAccumulator<ScalarT,EigenDim> Accumulator;\n\n        inline PointColorSumAccumulatorProxy(const ConstVectorSetMatrixMap<ScalarT,EigenDim> &points,\n                                             const ConstVectorSetMatrixMap<float,3> &colors)\n                : points_(points), colors_(colors)\n        {}\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(points_.col(i), colors_.col(i));\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.pointSum += points_.col(i);\n            accum.colorSum += colors_.col(i);\n            accum.pointCount++;\n            return accum;\n        }\n\n    private:\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> points_;\n        ConstVectorSetMatrixMap<float,3> colors_;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    struct PointNormalColorSumAccumulator {\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        enum {EigenAlign = (EigenDim != Eigen::Dynamic) && (sizeof(Vector<ScalarT,EigenDim>) % 16 == 0)};\n\n        inline PointNormalColorSumAccumulator(size_t dim = 0)\n                : pointSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  normalSum(Vector<ScalarT,EigenDim>::Zero(dim,1)),\n                  colorSum(Vector<float,3>::Zero()),\n                  pointCount(0)\n        {}\n\n        inline PointNormalColorSumAccumulator(const Eigen::Ref<const Vector<ScalarT,EigenDim>> &point,\n                                              const Eigen::Ref<const Vector<ScalarT,EigenDim>> &normal,\n                                              const Eigen::Ref<const Vector<float,3>> &color)\n                : pointSum(point), normalSum(normal), colorSum(color), pointCount(1)\n        {}\n\n        inline PointNormalColorSumAccumulator& mergeWith(const PointNormalColorSumAccumulator &other) {\n            pointSum += other.pointSum;\n            if (normalSum.dot(other.normalSum) < (ScalarT)0.0) {\n                normalSum -= other.normalSum;\n            } else {\n                normalSum += other.normalSum;\n            }\n            colorSum += other.colorSum;\n            pointCount += other.pointCount;\n            return *this;\n        }\n\n        Vector<ScalarT,EigenDim> pointSum;\n        Vector<ScalarT,EigenDim> normalSum;\n        Vector<float,3> colorSum;\n        size_t pointCount;\n    };\n\n    template <typename ScalarT, ptrdiff_t EigenDim>\n    class PointNormalColorSumAccumulatorProxy {\n    public:\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        typedef PointNormalColorSumAccumulator<ScalarT,EigenDim> Accumulator;\n\n        inline PointNormalColorSumAccumulatorProxy(const ConstVectorSetMatrixMap<ScalarT,EigenDim> &points,\n                                                   const ConstVectorSetMatrixMap<ScalarT,EigenDim> &normals,\n                                                   const ConstVectorSetMatrixMap<float,3> &colors)\n                : points_(points), normals_(normals), colors_(colors)\n        {}\n\n        inline Accumulator buildAccumulator(size_t i) const {\n            return Accumulator(points_.col(i), normals_.col(i), colors_.col(i));\n        }\n\n        inline Accumulator& addToAccumulator(Accumulator& accum, size_t i) const {\n            accum.pointSum += points_.col(i);\n            if (accum.normalSum.dot(normals_.col(i)) < (ScalarT)0.0) {\n                accum.normalSum -= normals_.col(i);\n            } else {\n                accum.normalSum += normals_.col(i);\n            }\n            accum.colorSum += colors_.col(i);\n            accum.pointCount++;\n            return accum;\n        }\n\n    private:\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> points_;\n        ConstVectorSetMatrixMap<ScalarT,EigenDim> normals_;\n        ConstVectorSetMatrixMap<float,3> colors_;\n    };\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file\n * \\brief StaticRawFifoQueue 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-10-21\n *\/\n\n#ifndef INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n#define INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n\n#include \"RawFifoQueue.hpp\"\n\n#include \"distortos\/memory\/dummyDeleter.hpp\"\n\nnamespace distortos\n{\n\n\/**\n * \\brief StaticRawFifoQueue class is a wrapper for RawFifoQueue that also provides automatic storage for queue's\n * contents.\n *\n * \\note Objects of this class can be safely casted to (const) reference to RawFifoQueue.\n *\n * \\param T is the type of data in queue\n * \\param QueueSize is the maximum number of elements in queue\n *\/\n\ntemplate<typename T, size_t QueueSize>\nclass StaticRawFifoQueue\n{\npublic:\n\n\t\/**\n\t * \\brief StaticRawFifoQueue's constructor\n\t *\/\n\n\texplicit StaticRawFifoQueue() :\n\t\t\trawFifoQueue_{{storage_.data(), memory::dummyDeleter}, sizeof(*storage_.data()), storage_.size()}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief conversion to RawFifoQueue&\n\t *\n\t * \\return reference to internal RawFifoQueue object\n\t *\/\n\n\toperator RawFifoQueue&()\n\t{\n\t\treturn rawFifoQueue_;\n\t}\n\n\t\/**\n\t * \\brief conversion to const RawFifoQueue&\n\t *\n\t * \\return const reference to internal RawFifoQueue object\n\t *\/\n\n\toperator const RawFifoQueue&() const\n\t{\n\t\treturn rawFifoQueue_;\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::pop(void*, size_t)\n\t *\/\n\n\tint pop(void* const buffer, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.pop(buffer, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::pop(T&)\n\t *\/\n\n\ttemplate<typename U>\n\tint pop(U& buffer)\n\t{\n\t\treturn rawFifoQueue_.pop(buffer);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::push(const void*, size_t)\n\t *\/\n\n\tint push(const void* const data, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.push(data, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::push(const T&)\n\t *\/\n\n\ttemplate<typename U>\n\tint push(const U& data)\n\t{\n\t\treturn rawFifoQueue_.push(data);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPop(void*, size_t)\n\t *\/\n\n\tint tryPop(void* const buffer, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPop(buffer, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPop(T&)\n\t *\/\n\n\ttemplate<typename U>\n\tint tryPop(U& buffer)\n\t{\n\t\treturn rawFifoQueue_.tryPop(buffer);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPopFor(std::chrono::duration<Rep, Period>, void*, size_t)\n\t *\/\n\n\ttemplate<typename Rep, typename Period>\n\tint tryPopFor(const std::chrono::duration<Rep, Period> duration, void* const buffer, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPopFor(duration, buffer, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPopFor(std::chrono::duration<Rep, Period>, T&)\n\t *\/\n\n\ttemplate<typename Rep, typename Period, typename U>\n\tint tryPopFor(const std::chrono::duration<Rep, Period> duration, U& buffer)\n\t{\n\t\treturn rawFifoQueue_.tryPopFor(duration, buffer);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPopUntil(std::chrono::time_point<TickClock, Duration>, void*, size_t)\n\t *\/\n\n\ttemplate<typename Duration>\n\tint tryPopUntil(const std::chrono::time_point<TickClock, Duration> timePoint, void* const buffer, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPopUntil(timePoint, buffer, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPopUntil(std::chrono::time_point<TickClock, Duration>, T&)\n\t *\/\n\n\ttemplate<typename Duration, typename U>\n\tint tryPopUntil(const std::chrono::time_point<TickClock, Duration> timePoint, U& buffer)\n\t{\n\t\treturn rawFifoQueue_.tryPopUntil(timePoint, buffer);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPush(const void*, size_t)\n\t *\/\n\n\tint tryPush(const void* const data, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPush(data, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPush(const T&)\n\t *\/\n\n\ttemplate<typename U>\n\tint tryPush(const U& data)\n\t{\n\t\treturn rawFifoQueue_.tryPush(data);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPushFor(std::chrono::duration<Rep, Period>, const void*, size_t)\n\t *\/\n\n\ttemplate<typename Rep, typename Period>\n\tint tryPushFor(const std::chrono::duration<Rep, Period> duration, const void* const data, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPushFor(duration, data, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPushFor(std::chrono::duration<Rep, Period>, const T&)\n\t *\/\n\n\ttemplate<typename Rep, typename Period, typename U>\n\tint tryPushFor(const std::chrono::duration<Rep, Period> duration, const U& data)\n\t{\n\t\treturn rawFifoQueue_.tryPushFor(duration, data);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPushUntil(std::chrono::time_point<TickClock, Duration>, const void*, size_t)\n\t *\/\n\n\ttemplate<typename Duration>\n\tint tryPushUntil(const std::chrono::time_point<TickClock, Duration> timePoint, const void* const data,\n\t\t\tconst size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPushUntil(timePoint, data, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPushUntil(std::chrono::time_point<TickClock, Duration>, const T&)\n\t *\/\n\n\ttemplate<typename Duration, typename U>\n\tint tryPushUntil(const std::chrono::time_point<TickClock, Duration> timePoint, const U& data)\n\t{\n\t\treturn rawFifoQueue_.tryPushUntil(timePoint, data);\n\t}\n\nprivate:\n\n\t\/\/\/ storage for queue's contents\n\tstd::array<typename std::aligned_storage<sizeof(T), alignof(T)>::type, QueueSize> storage_;\n\n\t\/\/\/ internal RawFifoQueue object\n\tRawFifoQueue rawFifoQueue_;\n};\n\n\/**\n * \\brief StaticRawFifoQueueFromSize type alias is a variant of StaticRawFifoQueue which uses size of element (instead\n * of type) as template argument.\n *\n * \\param ElementSize is the size of single queue element, bytes\n * \\param QueueSize is the maximum number of elements in queue\n *\/\n\ntemplate<size_t ElementSize, size_t QueueSize>\nusing StaticRawFifoQueueFromSize =\n\t\tStaticRawFifoQueue<typename std::aligned_storage<ElementSize, ElementSize>::type, QueueSize>;\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n<commit_msg>StaticRawFifoQueue: inherit from FifoQueue<commit_after>\/**\n * \\file\n * \\brief StaticRawFifoQueue 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-10-21\n *\/\n\n#ifndef INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n#define INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n\n#include \"RawFifoQueue.hpp\"\n\n#include \"distortos\/memory\/dummyDeleter.hpp\"\n\nnamespace distortos\n{\n\n\/**\n * \\brief StaticRawFifoQueue class is a variant of RawFifoQueue that has automatic storage for queue's contents.\n *\n * \\param T is the type of data in queue\n * \\param QueueSize is the maximum number of elements in queue\n *\/\n\ntemplate<typename T, size_t QueueSize>\nclass StaticRawFifoQueue : public RawFifoQueue\n{\npublic:\n\n\t\/**\n\t * \\brief StaticRawFifoQueue's constructor\n\t *\/\n\n\texplicit StaticRawFifoQueue() :\n\t\t\tRawFifoQueue{{storage_.data(), memory::dummyDeleter}, sizeof(*storage_.data()), storage_.size()}\n\t{\n\n\t}\n\nprivate:\n\n\t\/\/\/ storage for queue's contents\n\tstd::array<typename std::aligned_storage<sizeof(T), alignof(T)>::type, QueueSize> storage_;\n};\n\n\/**\n * \\brief StaticRawFifoQueueFromSize type alias is a variant of StaticRawFifoQueue which uses size of element (instead\n * of type) as template argument.\n *\n * \\param ElementSize is the size of single queue element, bytes\n * \\param QueueSize is the maximum number of elements in queue\n *\/\n\ntemplate<size_t ElementSize, size_t QueueSize>\nusing StaticRawFifoQueueFromSize =\n\t\tStaticRawFifoQueue<typename std::aligned_storage<ElementSize, ElementSize>::type, QueueSize>;\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <math.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <stdint.h>\n#include <sys\/mman.h>\n#ifndef _GNU_SOURCE\n#define _GNU_SOURCE\n#endif\n#include <sched.h>\n\n#include <algorithm>\n#include <assert.h>\n\n\/\/=============== Macro abstractions =================\n\n#define SM2(x,y) ((x)+(y))\n#define SM4(x,y,z,w) SM2(SM2(x,y),SM2(z,w))\n#define SM8(a,b,c,d,e,f,g,h) SM2(SM4(a,b,c,d),SM4(e,f,g,h))\n\n#if L1_PENALTY\n#define OUTSIDE_THRESH_UPDATE updateL1\n#else\n#define OUTSIDE_THRESH_UPDATE solveDepressedCubic2\n#endif\n\n#define HOUSEHOLDER_ITER (10)\n#if 4==V_LN\n#define FV_SET1(x) {(x),(x),(x),(x)}\n#else\n#define FV_SET1(x) {(x),(x),(x),(x),(x),(x),(x),(x)}\n#endif\n#define FV_ZERO() FV_SET1(0.0f)\n\n#define V_SZ (4*V_LN)\ntypedef float FV __attribute__((vector_size(V_SZ)));\ntypedef int BV __attribute__((vector_size(V_SZ)));\n\n#if V_LN==8 \/*kludgy way of detecting avx with its fma instruction*\/\n#define fma(a,b,c) (a)*(b)+(c)\n#else\n#define fma(a,b,c) (a)*(b)+(c)\n#endif\n\n#define FORCE_READ(p,o) (*((volatile FV*)(p+o)))\n#define FORCE_WRITE(p,i,x) (*(volatile FV*)(p+i))=x\n\n\/\/================ Data structures =====================\n\nstruct ControlData {\n    float initLambda,lamdaStep,lambdaLIm;\n};\n\nstruct Memory {\n    float *sharedParams;\n    FV** original;\n    FV* publishedPredictions[NO_CPUS];\n    FV* parameterEstimates[NO_CPUS];\n    FV*** perThread1;\n    FV*** perThread2;\n    FV*** perThread3;\n    int32_t* syncFutexes;\n    int ourIdx;\n};\n\n\/\/================== inter-CPU data reading\/writing ===============\n\n\/*\n *Add in to results the contributions from the otherUnits and multiply resulting value by multipliers.\n *otherUnits are read using FORCE_READ to get latest values wrtten by other CPUs.\n *results has already been initialized with a partal contribution.\n *Note that while some \"partial update skew\" is inevitable, we want to do this as fast as possible\n *to minimise the amount.\n *Doing 5 accumulations at once is the most possible before hitting register spills.\n *\/\nvoid accSumOtherContributions(FV* results,FV* ourValues,FV** otherUnits,FV* multipliers,int noOtherUnits,int noBlks)\n{\n    assert(noOtherUnits==NO_CPUS);\n    FV bigAcc0=FV_ZERO(),bigAcc1=FV_ZERO(),bigAcc2=FV_ZERO(),bigAcc3=FV_ZERO(),bigAcc4=FV_ZERO();\n    int i=0;\n    do{\n        FV acc=ourValues[i];\n        int unit=0;\n        do{\n            acc=acc+FORCE_READ(otherUnits[unit],i);\n        }while (++unit<NO_CPUS-1);\n        bigAcc0=fma(acc,multipliers[0],bigAcc0);\n        bigAcc1=fma(acc,multipliers[1],bigAcc1);\n        bigAcc2=fma(acc,multipliers[2],bigAcc2);\n        bigAcc3=fma(acc,multipliers[3],bigAcc3);\n        bigAcc4=fma(acc,multipliers[4],bigAcc4);\n        multipliers+=6;\n\n    }while(++i<noBlks);\n    results[0]=bigAcc0;\n    results[1]=bigAcc1;\n    results[2]=bigAcc2;\n    results[3]=bigAcc3;\n    results[4]=bigAcc4;\n}\n\n\/*\n *Write pre-prepared values into the published array for this unit.\n *Use FORCE_WRITE to ensure results are written immediately, and use\n *a loop to minimise time values from different passes exist in the cache.\n *\/\nvoid writeContributionForThisUnit(FV* publish,FV *values,int noBlks)\n{\n    int i=0;\n    do{\n        FORCE_WRITE(publish,i,values[i]);\n    }while(++i<noBlks);\n}\n\n\/\/=========== Preparing \"this CPU\" problem components ============\n\n\/*\n *\n *\/\nvoid updateContributions(FV* values,int noBlks)\n{\n\n}\n\n\/*\n *\n *\/\nvoid prepareMultipliers(FV* multipliers,int noBlks)\n{\n\n}\n\n\/\/==================== update functions ======================\n\n\/*solve a vector of depressed cubics starting from a previous soln of x*\/\n\/\/inline\nvoid solveDepressedCubic(FV *result, FV p,FV q,FV x,float lambda,int householderIter)\n{\n    do{\n        FV t1=3*x;\n        FV t2=t1*x+p;\n        FV t3=(x*x+p)*x+q;\n        FV num=t3*t2;\n        FV denom=t2*t2-t1*t3;\n        x=x-num\/denom;\n\/*        if(fabs((num\/denom)\/x)<=1e-6) break;*\/\n    }while(--householderIter>0);\n    *result=x;\n}\n\n\/\/inline\nvoid solveDepressedCubic2(FV *result,FV p,FV q,FV x,float ambda,int householderIter)\n{\n    int l=0;\n    do{\n        FV t1=3*x;\n        FV fderiv=t1*x+p;\n        FV fderivSq=fderiv*fderiv;\n        FV f=(x*x+p)*x+q;\n        FV hlfffdderiv=f*t1;\n        FV num=f*(fderivSq-hlfffdderiv);\n        FV fSq=f*f;\n        FV denom=fderiv*(fderivSq-2*hlfffdderiv)+fSq;\n        x=x-num\/denom;\n    }while(++l<householderIter);\n    *result=x;\n}\n\n\/\/inline\nvoid updateL1(FV *result,FV p,FV q,FV x,float lambda,int householderIter)\n{\n    BV gtLambda=x>=lambda;\n    *result=gtLambda ? (x-lambda) : (x+lambda);\n}\n\n\n\nvoid formAndSolveUpdate(FV* result,FV *others,FV *corrections,FV *here,FV *params,float lambda,int noBlks,int householderIter)\n{\n    float thresh=lambda;\n    do{\n        FV t0=*result-*corrections;\/\/we've kept some corrections here\n        FV t1=*here\/t0;\n        FV t2=*params\/t0;\n\/\/        BV toKeep=(t2>=thresh) | (t2<=-thresh);\/\/record which should be moved to zero\n        \/\/get the update which is correct outside the threshold region\n        OUTSIDE_THRESH_UPDATE(result,t1,t2,*params,thresh,householderIter);\n        FV zeroes=FV_ZERO();\n\/\/        *result=toKeep ? (*result) : zeroes;\n    }while(--noBlks>0);\n}\n\n\/\/================= setting up data structures ===================\n\nvoid* allocSharedArray(int no32BitWords)\n{\n    void *p=mmap(0,4*no32BitWords,PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS,0,0);\n    return p;\n}\n\ntemplate<class T>\nT** add2DSuperstructure(void* raw,int noRows,int noCols)\n{\n    T* p=reinterpret_cast<T*>(raw);\n    T** super=new T*[noRows];\n    for(int i=0;i<noRows;++i){\n        super[i]=&(p[i*noCols]);\n    }\n    return super;\n}\n\ntemplate<class T>\nT*** add3DSuperstructure(void* raw,int noRows,int noCols)\n{\n    T* p=reinterpret_cast<T*>(raw);\n    T** super=new T*[noRows];\n    for(int i=0;i<noRows;++i){\n        super[i]=&(p[i*noCols]);\n    }\n    return &super;\n}\n\nvoid setupSharedMemoryAreas(Memory *mem)\n{\n    int r,c;\n    mem->sharedParams=reinterpret_cast<float*>(allocSharedArray(1));\n    mem->original=add2DSuperstructure<FV>(allocSharedArray(0),r,c);\n    for(int i=0;i<NO_CPUS;++i){\n        mem->publishedPredictions[i]=reinterpret_cast<FV*>(allocSharedArray(0));\n        mem->parameterEstimates[i]=reinterpret_cast<FV*>(allocSharedArray(0));\n    }\n    mem->perThread1=0;\n    mem->perThread2=0;\n    mem->perThread3=0;\n    mem->syncFutexes=reinterpret_cast<int*>(allocSharedArray(0));\n    mem->syncFutexes[0]=NO_CPUS;\n    mem->ourIdx=-1;\n}\n\nvoid figureLinearRegressionProblemDivision() {\n\n}\n\n\/\/============== running processes on CPUs ================\n\nvoid exportSolution(ControlData *control,Memory *mem)\n{\n    for(int i=0;i<0;++i){\n        fprintf(stdout,\"%u %g\\n\",i,(double)0.0f);\n    }\n    fflush(stdout);\n\n}\n\nvoid runAThread(Memory *mem)\n{\n\n}\n\nvoid\nfireUpForks(ControlData *control,Memory *mem)\n{\n    pid_t pids[NO_CPUS];\n    pid_t parentPID=getpid();\n    for(int i=0;i<NO_CPUS;++i){\n        pid_t thisPID;\n        if((thisPID=getpid())!=0){\/\/we're the child\n            \/\/it's easier if our publication array is final pointer in array\n            FV* t=mem->publishedPredictions[i];\n            mem->publishedPredictions[i]=mem->publishedPredictions[NO_CPUS-1];\n            mem->publishedPredictions[NO_CPUS-1]=t;\n            mem->ourIdx=NO_CPUS-1;\n            cpu_set_t *cpu_mask=CPU_ALLOC(NO_CPUS);\n            CPU_ZERO(cpu_mask);\n            CPU_SET(i,cpu_mask);\n            int err=sched_setaffinity(0,sizeof(cpu_set_t),cpu_mask);\n            CPU_FREE(cpu_mask);\n            runAThread(mem);\n            _exit(0);\n        }\n    }\n    exportSolution(control,mem);\n}\n\n\nint main(int argc,char* argv[])\n{\n    ControlData ctrl;\n    Memory mem;\n    fireUpForks(&ctrl,&mem);\n\n    return 0;\n}\n<commit_msg>More code added<commit_after>#include <stdio.h>\n#include <math.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <stdint.h>\n#include <sys\/mman.h>\n#ifndef _GNU_SOURCE\n#define _GNU_SOURCE\n#endif\n#include <sched.h>\n\n#include <algorithm>\n#include <assert.h>\n\n\/\/=============== Macro abstractions =================\n\n#define SM2(x,y) ((x)+(y))\n#define SM4(x,y,z,w) SM2(SM2(x,y),SM2(z,w))\n#define SM8(a,b,c,d,e,f,g,h) SM2(SM4(a,b,c,d),SM4(e,f,g,h))\n\n#if L1_PENALTY\n#define OUTSIDE_THRESH_UPDATE updateL1\n#else\n#define OUTSIDE_THRESH_UPDATE solveDepressedCubic2\n#endif\n\n#define HOUSEHOLDER_ITER (10)\n#if 4==V_LN\n#define FV_SET1(x) {(x),(x),(x),(x)}\n#else\n#define FV_SET1(x) {(x),(x),(x),(x),(x),(x),(x),(x)}\n#endif\n#define FV_ZERO() FV_SET1(0.0f)\n\n#define V_SZ (4*V_LN)\ntypedef float FV __attribute__((vector_size(V_SZ)));\ntypedef int BV __attribute__((vector_size(V_SZ)));\n\n#if V_LN==8 \/*kludgy way of detecting avx with its fma instruction*\/\n#define fma(a,b,c) (a)*(b)+(c)\n#else\n#define fma(a,b,c) (a)*(b)+(c)\n#endif\n\n#define FORCE_READ(p,o) (*((volatile FV*)(p+o)))\n#define FORCE_WRITE(p,i,x) (*(volatile FV*)(p+i))=x\n\n\/\/================ Data structures =====================\n\nstruct ControlData {\n    float initLambda,lamdaStep,lambdaLIm;\n};\n\nstruct Memory {\n    float *sharedParams;\n    FV** original;\n    FV* publishedPredictions[NO_CPUS];\n    FV* parameterEstimates[NO_CPUS];\n    FV*** perThread1;\n    FV*** perThread2;\n    FV*** perThread3;\n    int32_t* syncFutexes;\n    int ourIdx;\n    int noParams,noNonZero;\n    int* nonzeroParams;\/\/local to the core working on this\n};\n\n\/\/================== inter-CPU data reading\/writing ===============\n\n\/*\n *Add in to results the contributions from the otherUnits and multiply resulting value by multipliers.\n *otherUnits are read using FORCE_READ to get latest values wrtten by other CPUs.\n *results has already been initialized with a partal contribution.\n *Note that while some \"partial update skew\" is inevitable, we want to do this as fast as possible\n *to minimise the amount.\n *Doing 5 accumulations at once is the most possible before hitting register spills.\n *\/\nvoid accSumOtherContributions(FV* results,FV* ourValues,FV** otherUnits,FV* multipliers,int noOtherUnits,int noBlks)\n{\n    assert(noOtherUnits==NO_CPUS);\n    FV bigAcc0=FV_ZERO(),bigAcc1=FV_ZERO(),bigAcc2=FV_ZERO(),bigAcc3=FV_ZERO(),bigAcc4=FV_ZERO();\n    int i=0;\n    do{\n        FV acc=ourValues[i];\n        int unit=0;\n        do{\n            acc=acc+FORCE_READ(otherUnits[unit],i);\n        }while (++unit<NO_CPUS-1);\n        bigAcc0=fma(acc,multipliers[0],bigAcc0);\n        bigAcc1=fma(acc,multipliers[1],bigAcc1);\n        bigAcc2=fma(acc,multipliers[2],bigAcc2);\n        bigAcc3=fma(acc,multipliers[3],bigAcc3);\n        bigAcc4=fma(acc,multipliers[4],bigAcc4);\n        multipliers+=6;\n\n    }while(++i<noBlks);\n    results[0]=bigAcc0;\n    results[1]=bigAcc1;\n    results[2]=bigAcc2;\n    results[3]=bigAcc3;\n    results[4]=bigAcc4;\n}\n\n\/*\n *Write pre-prepared values into the published array for this unit.\n *Use FORCE_WRITE to ensure results are written immediately, and use\n *a loop to minimise time values from different passes exist in the cache.\n *\/\nvoid writeContributionForThisUnit(FV* publish,FV *values,int noBlks)\n{\n    int i=0;\n    do{\n        FORCE_WRITE(publish,i,values[i]);\n    }while(++i<noBlks);\n}\n\n\/\/=========== Preparing \"this CPU\" problem components ============\n\n\/*\n *\n *\/\nvoid updateContributions(FV* values,int noBlks)\n{\n\n}\n\n\/*\n *\n *\/\nvoid prepareMultipliers(FV* multipliers,int noBlks)\n{\n\n}\n\n\/\/==================== update functions ======================\n\n\/*solve a vector of depressed cubics starting from a previous soln of x*\/\n\/\/inline\nvoid solveDepressedCubic(FV *result, FV p,FV q,FV x,float lambda,int householderIter)\n{\n    do{\n        FV t1=3*x;\n        FV t2=t1*x+p;\n        FV t3=(x*x+p)*x+q;\n        FV num=t3*t2;\n        FV denom=t2*t2-t1*t3;\n        x=x-num\/denom;\n\/*        if(fabs((num\/denom)\/x)<=1e-6) break;*\/\n    }while(--householderIter>0);\n    *result=x;\n}\n\n\/\/inline\nvoid solveDepressedCubic2(FV *result,FV p,FV q,FV x,float ambda,int householderIter)\n{\n    int l=0;\n    do{\n        FV t1=3*x;\n        FV fderiv=t1*x+p;\n        FV fderivSq=fderiv*fderiv;\n        FV f=(x*x+p)*x+q;\n        FV hlfffdderiv=f*t1;\n        FV num=f*(fderivSq-hlfffdderiv);\n        FV fSq=f*f;\n        FV denom=fderiv*(fderivSq-2*hlfffdderiv)+fSq;\n        x=x-num\/denom;\n    }while(++l<householderIter);\n    *result=x;\n}\n\n\/\/inline\nvoid updateL1(FV *result,FV p,FV q,FV x,float lambda,int householderIter)\n{\n    BV gtLambda=x>=lambda;\n    *result=gtLambda ? (x-lambda) : (x+lambda);\n}\n\n\n\nvoid formAndSolveUpdate(FV* result,FV *others,FV *corrections,FV *here,FV *params,float lambda,int noBlks,int householderIter)\n{\n    float thresh=lambda;\n    do{\n        FV t0=*result-*corrections;\/\/we've kept some corrections here\n        FV t1=*here\/t0;\n        FV t2=*params\/t0;\n        BV toKeep=(t2>=thresh) | (t2<=-thresh);\/\/record which should be moved to zero\n        \/\/get the update which is correct outside the threshold region\n        OUTSIDE_THRESH_UPDATE(result,t1,t2,*params,thresh,householderIter);\n        FV zeroes=FV_ZERO();\n        *result=toKeep ? (*result) : zeroes;\n    }while(--noBlks>0);\n}\n\nvoid f()\n{\n    FV* result;\n    formAndSolveUpdate(result,FV *others,FV *corrections,FV *here,FV *params,float lambda,int noBlks,int householderIter);\n    \/\/put the results back into the correct place\n    float *arr=reinterpret_cast<float*>(result);\n    int i;\n    for(i=0;i<noBlks*FV_LN;++i){\n        if(arr[i]==0.0f){\n            \/\/remove from non-zero bitmap\n        }\n    }\n}\n\n\/\/================= setting up data structures ===================\n\nvoid* allocSharedArray(int no32BitWords)\n{\n    void *p=mmap(0,4*no32BitWords,PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS,0,0);\n    return p;\n}\n\ntemplate<class T>\nT** add2DSuperstructure(void* raw,int noRows,int noCols)\n{\n    T* p=reinterpret_cast<T*>(raw);\n    T** super=new T*[noRows];\n    for(int i=0;i<noRows;++i){\n        super[i]=&(p[i*noCols]);\n    }\n    return super;\n}\n\ntemplate<class T>\nT*** add3DSuperstructure(void* raw,int noRows,int noCols)\n{\n    T* p=reinterpret_cast<T*>(raw);\n    T** super=new T*[noRows];\n    for(int i=0;i<noRows;++i){\n        super[i]=&(p[i*noCols]);\n    }\n    return &super;\n}\n\nvoid setupSharedMemoryAreas(Memory *mem)\n{\n    int r,c;\n    mem->sharedParams=reinterpret_cast<float*>(allocSharedArray(1));\n    mem->original=add2DSuperstructure<FV>(allocSharedArray(0),r,c);\n    for(int i=0;i<NO_CPUS;++i){\n        mem->publishedPredictions[i]=reinterpret_cast<FV*>(allocSharedArray(0));\n        mem->parameterEstimates[i]=reinterpret_cast<FV*>(allocSharedArray(0));\n    }\n    mem->perThread1=0;\n    mem->perThread2=0;\n    mem->perThread3=0;\n    mem->syncFutexes=reinterpret_cast<int*>(allocSharedArray(0));\n    mem->syncFutexes[0]=NO_CPUS;\n    mem->ourIdx=-1;\n}\n\nvoid figureLinearRegressionProblemDivision() {\n\n}\n\n\/\/============== running processes on CPUs ================\n\nvoid exportSolution(ControlData *control,Memory *mem)\n{\n    for(int i=0;i<0;++i){\n        fprintf(stdout,\"%u %g\\n\",i,(double)0.0f);\n    }\n    fflush(stdout);\n\n}\n\nvoid runAThread(Memory *mem)\n{\n\n}\n\nvoid\nfireUpForks(ControlData *control,Memory *mem)\n{\n    pid_t pids[NO_CPUS];\n    pid_t parentPID=getpid();\n    for(int i=0;i<NO_CPUS;++i){\n        pid_t thisPID;\n        if((thisPID=getpid())!=0){\/\/we're the child\n            \/\/it's easier if our publication array is final pointer in array\n            FV* t=mem->publishedPredictions[i];\n            mem->publishedPredictions[i]=mem->publishedPredictions[NO_CPUS-1];\n            mem->publishedPredictions[NO_CPUS-1]=t;\n            mem->ourIdx=NO_CPUS-1;\n            cpu_set_t *cpu_mask=CPU_ALLOC(NO_CPUS);\n            CPU_ZERO(cpu_mask);\n            CPU_SET(i,cpu_mask);\n            int err=sched_setaffinity(0,sizeof(cpu_set_t),cpu_mask);\n            CPU_FREE(cpu_mask);\n            runAThread(mem);\n            _exit(0);\n        }\n    }\n    exportSolution(control,mem);\n}\n\n\nint main(int argc,char* argv[])\n{\n    ControlData ctrl;\n    Memory mem;\n    fireUpForks(&ctrl,&mem);\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Tests to drive abstract sharing analysis\n\n#include \"types.h\"\n#include \"user.h\"\n#include \"fcntl.h\"\n#include \"mtrace.h\"\n\nstatic int cpu;\n\nvoid\nnext()\n{\n  if (setaffinity(cpu) < 0) {\n    cpu = 0;\n    if (setaffinity(cpu) < 0)\n      die(\"sys_setaffinity(%d) failed\", cpu);\n  }\n  cpu++;\n}\n\nvoid\nvmsharing(void)\n{\n  for (int i = 0; i < 8; i++) {\n    next();\n\n    volatile char *p = (char*)(0x40000UL + i * 4096);\n    mtenable(\"xv6-mapsharing\");\n    if (map((void *) p, 4096) < 0)\n      die(\"map failed\");\n    mtdisable(\"xv6-mapsharing\");\n\n    mtenable(\"xv6-mapsharing\");\n    if (unmap((void *) p, 4096) < 0)\n      die(\"unmap failed\");\n    mtdisable(\"xv6-mapsharing\");\n  }\n}\n\nvoid\nfssharing(void)\n{\n  \/\/ Note that we keep these files open; otherwise all of these\n  \/\/ operations will share the abstract FD object and we won't get any\n  \/\/ results.\n\n  next();\n  mtenable(\"xv6-fssharing\");\n  open(\"a\", O_CREATE|O_RDWR);\n  mtdisable(\"xv6-fssharing\");\n\n  next();\n  mtenable(\"xv6-fssharing\");\n  open(\"b\", O_CREATE|O_RDWR);\n  mtdisable(\"xv6-fssharing\");\n\n  next();\n  mtenable(\"xv6-fssharing\");\n  open(\"a\", O_RDWR);\n  mtdisable(\"xv6-fssharing\");\n\n  next();\n  mtenable(\"xv6-fssharing\");\n  open(\"b\", O_RDWR);\n  mtdisable(\"xv6-fssharing\");\n}\n\nint\nmain(int ac, char **av)\n{\n  if (ac == 2 && strcmp(av[1], \"vm\") == 0)\n    vmsharing();\n  else if (ac == 2 && strcmp(av[1], \"fs\") == 0)\n    fssharing();\n  else\n    fprintf(1, \"usage: %s vm|fs\\n\", av[0]);\n}\n<commit_msg>avoid kernel stack sharing by spawning distinct threads per core<commit_after>\/\/ Tests to drive abstract sharing analysis\n\n#include \"types.h\"\n#include \"user.h\"\n#include \"fcntl.h\"\n#include \"mtrace.h\"\n#include \"pthread.h\"\n\nstatic int cpu;\nstatic pthread_barrier_t bar;\nenum { ncore = 8 };\n\nvoid\nnext()\n{\n  if (setaffinity(cpu) < 0) {\n    cpu = 0;\n    if (setaffinity(cpu) < 0)\n      die(\"sys_setaffinity(%d) failed\", cpu);\n  }\n  cpu++;\n}\n\nvoid*\nvmsharing(void* arg)\n{\n  u64 i = (u64) arg;\n\n  volatile char *p = (char*)(0x40000UL + i * 4096);\n  mtenable(\"xv6-mapsharing\");\n  if (map((void *) p, 4096) < 0)\n    die(\"map failed\");\n  mtdisable(\"xv6-mapsharing\");\n\n  mtenable(\"xv6-mapsharing\");\n  if (unmap((void *) p, 4096) < 0)\n    die(\"unmap failed\");\n  mtdisable(\"xv6-mapsharing\");\n\n  return 0;\n}\n\nvoid*\nfssharing(void* arg)\n{\n  u64 i = (u64) arg;\n\n  \/\/ Note that we keep these files open; otherwise all of these\n  \/\/ operations will share the abstract FD object and we won't get any\n  \/\/ results.\n\n  char filename[32];\n  snprintf(filename, sizeof(filename), \"f%d\", i);\n\n  mtenable(\"xv6-fssharing\");\n  open(filename, O_CREATE|O_RDWR);\n  mtdisable(\"xv6-fssharing\");\n\n  pthread_barrier_wait(&bar);\n\n  for (u64 j = 0; j < ncore; j++) {\n    snprintf(filename, sizeof(filename), \"f%d\", j);\n    mtenable(\"xv6-fssharing\");\n    open(filename, O_RDWR);\n    mtdisable(\"xv6-fssharing\");\n  }\n  return 0;\n}\n\nint\nmain(int ac, char **av)\n{\n  void* (*op)(void*) = 0;\n  if (ac == 2 && strcmp(av[1], \"vm\") == 0)\n    op = vmsharing;\n  else if (ac == 2 && strcmp(av[1], \"fs\") == 0)\n    op = fssharing;\n  else\n    fprintf(1, \"usage: %s vm|fs\\n\", av[0]);\n\n  if (op) {\n    pthread_barrier_init(&bar, 0, ncore);\n    for (u64 i = 0; i < ncore; i++) {\n      next();\n      pthread_t tid;\n      pthread_create(&tid, 0, op, (void*) i);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>small fix<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ -*- mode:C++; tab-width:3; c-basic-offset:4; indent-tabs-mode:nil -*-\n\n\/\/Copyright: Universidad Carlos III de Madrid (C) 2016\n\/\/Authors: jgvictores, raulfdzbis, smorante\n\n#include \"CgdaIronFitnessFunction.hpp\"\n\n#define NTPOINTS 17\n#define NFEATURES 3\n#define NSQUARES 16\n\nnamespace teo\n{\n\n\/************************************************************************\/\n\nvoid CgdaIronFitnessFunction::registerParameters(StateP state) {\n\tstate->getRegistry()->registerEntry(\"function\", (voidP) (new uint(1)), ECF::UINT);\n}\n\n\/************************************************************************\/\n\nbool CgdaIronFitnessFunction::initialize(StateP state) {\n\n    voidP sptr = state->getRegistry()->getEntry(\"function\"); \/\/ get parameter value\n\n\treturn true;\n}\n\n\/************************************************************************\/\n\nFitnessP CgdaIronFitnessFunction::evaluate(IndividualP individual) {\n    \/\/ Evaluation creates a new fitness object using a smart pointer\n\t\/\/ in our case, we try to minimize the function value, so we use FitnessMin fitness (for minimization problems)\n\tFitnessP fitness (new FitnessMin);\n\n\t\/\/ we define FloatingPoint as the only genotype (in the configuration file)\n\tFloatingPoint::FloatingPoint* gen = (FloatingPoint::FloatingPoint*) individual->getGenotype().get();\n\n\t\/\/ we implement the fitness function 'as is', without any translation\n\t\/\/ the number of variables is read from the genotype itself (size of 'realValue' vactor)\n\n    double value =0;\n    value= getCustomFitness(gen->realValue);\n    fitness->setValue(value);\n    return fitness;\n}\n\n\/************************************************************************\/\n\ndouble CgdaIronFitnessFunction::getCustomFitness(vector <double> genPoints){\n\n    \/\/***********************Define the generalized feature trajectory**********************************************\/\/\n\n    std::vector<std::vector<double>> target;\n\n    \/\/This is sqFeatures\n\n    \/\/target.push_back(feature1T1,feature2T2,feature3T3...);\n\n    \/\/*****************************************OBSERVATION STEP*****************************************************\/\/\n\n    std::vector<double> observation;\n\n    \/\/READ FROM PsqFeatures\n\n    \/\/Obtain TEO state\n    \/\/P:yarp::os::Bottle cmd3,res3;\n    \/\/P:cmd3.addString(\"reset\");\n    \/\/P:pRpcClient->write(cmd3,res3);\n\n    \/\/P:double percentage;\n    \/\/P:double Npaint=0;\n\n    \/\/P:for(int i=0;i<psqFeatures->size();i++)\n    \/\/P:{\n    \/\/P:    Npaint += psqFeatures->operator [](i);\n    \/\/P: }\n\n    \/\/Percentage of the wall painted before evolution\n    \/\/P:printf(\"EL NPAINT ES::::::: %f \\n\",Npaint);\n    \/\/P:percentage=(Npaint\/NSQUARES)*100;\n    \/\/P:printf(\"EL PERCENTAGE ES::::::: %f \\n\",percentage);\n\n    \/\/***************************************LOCALIZATION STEP******************************************************\/\/\n\n    \/\/Serch the timeStep where we are (LOCALIZATION STEP)\n    int timeStep;\n    double diff=1000000;\n    for(int i=0;i<NTPOINTS;i++){ \/\/We give priority to the elements at the last positions\n        double aux_dist=0;\n        for(int j=0;j<NFEATURES;j++){\n            double aux_elem;\n            aux_elem=observation[j]-target[i][j];\n            aux_elem=aux_elem*aux_elem;\n            aux_dist=aux_dist+aux_elem;\n        }\n        \/\/printf(\"Percentage: %d \\n\",percentage);\n        \/\/printf(\"Target: %d \\n\", Const_target[i]);\n        \/\/P:diff_aux=percentage-Const_target[i];\n\n\n        \/\/P:diff_aux=diff_aux*diff_aux;\n        \/\/P: diff_aux=sqrt(diff_aux);\n\n        aux_dist=sqrt(aux_dist);\n\n        if(aux_dist<diff){\n            timeStep=i;\n            diff=aux_dist;\n            \/\/printf(\"i -> %d\", i);\n            \/\/printf(\"Time Step %d \\n\",timeStep);\n\n        }\n    }\n\n    \/\/********************************SIMULATED EXECUTION STEP******************************************************\/\/\n\n    \/\/Set new positions of the robot using dEncRaw\n    std::vector<double> dEncRaw(6);  \/\/ NUM_MOTORS\n    dEncRaw[0] = genPoints[0];  \/\/ simple\n    dEncRaw[1] = -genPoints[1];  \/\/ simple\n    dEncRaw[3] = genPoints[2];  \/\/ simple\n\n    dEncRaw[4] = 45; \/\/TODO:This must be changed for IRON\n\n    \/\/Actually move the robot\n    mentalPositionControl->positionMove(dEncRaw.data());\n\n\n    \/\/********************************SECOND OBSERVATION STEP*******************************************************\/\/\n\n    observation.clear();\n\n    \/\/FORCE\n\n    yarp::os::Bottle* b = pForcePort->read(false);\n    if(!b)\n    {\n        printf(\"No force yet\\n\");\n    }\n    printf(\"El parámetro del sensor de fuerza es %s\\n\", b->toString().c_str());\n    for(size_t i=0; i<b->size(); i++)\n    {\n        observation.push_back( b->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n    \/\/POSITION\n\n    yarp::os::Bottle cmd,res;\n    cmd.addString(\"world\");\n    cmd.addString(\"whereis\");\n    cmd.addString(\"tcp\");\n    cmd.addString(\"rightArm\");\n    pRpcClientWorld->write(cmd,res);\n    \/*printf(\"El parámetro de posicion es %s\\n\", res.toString().c_str());\n    for(size_t i=0; i<res.size(); i++)\n    {\n        observation.push_back( res.get(i).asDouble() );\n        \/\/std(observation[i]);\n    }*\/\n    yarp::os::Bottle* pos = res.get(0).asList();\n    printf(\"El parámetro de posicion es %s\\n\", pos->toString().c_str());\n    for(size_t i=0; i<pos->size(); i++)\n    {\n        observation.push_back( pos->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n    \/\/P:Npaint=0;\n    \/\/P:yarp::os::Time::delay(DEFAULT_DELAY_S);\n    \/\/P:yarp::os::Bottle cmd2,res2;\n    \/\/P:cmd2.addString(\"get\");\n    \/\/P:pRpcClient->write(cmd2,res2);\n    \/\/P:for(int i=0;i<res2.size();i++)\n    \/\/P:{\n    \/\/P:    if ( res2.get(i).asInt() || psqFeatures->operator [](i) )  \/\/ logic OR;\n    \/\/P:        Npaint ++;\n    \/\/P:}\n\n\n\n    \/\/********************************FITNESS CALCULATION STEP******************************************************\/\/\n\n    \/\/Fitness of the actual point= percentage of the wall painted\n\n    \/\/P:percentage=(Npaint\/NSQUARES)*100;\n\n    \/\/The fit is the L2 norm between the current features, and the t+1 feature environment.\n    double fit;\n    printf(\"EL TIME STEP ES EL SIGUIENTE:: %d \\n\",timeStep);\n    \/\/P:printf(\"El percentage es:: %f\", percentage);\n    \/\/P:printf(\"El Consta target es:: %f \\n\", Const_target[timeStep+1]);\n    \/\/fit=sqrt(pow((percentage-Const_target[timeStep+1]),2)); \/\/The fit is the euclidean distance between current feature and t+1. Since 1 dimension euclidean distance equals difference.\n\n    for(int i=0;i<NFEATURES;i++){\n        double aux_fit,aux_elem;\n        aux_elem=observation[i]-target[timeStep][i];\n        aux_fit=aux_elem*aux_elem;\n        fit=fit+aux_fit;\n    }\n\n    fit=sqrt(fit);\n\n    \/\/featureTrajectories->compare(attempVectforSimpleDiscrepancy,fit);\n\n    cout << std::endl << \" fit: \" << fit << \" \";\n\n    \/\/GOING BACK TO INIT POSITION\n    std::vector<double> dEncRaw2(6,0);  \/\/ NUM_MOTORS\n    \/\/Actually move the robot\n    mentalPositionControl->positionMove(dEncRaw2.data());\n\n    return fit;\n}\n\n\/************************************************************************\/\n\nvoid CgdaIronFitnessFunction::individualExecution(vector<double> results){\n\n    \/\/GOAL: Execute the obtained values to obtain the executed trajectory\n\n    \/\/********************************EXECUTION STEP****************************************************************\/\/\n\n    std::vector<double> dEncRaw(6);  \/\/ NUM_MOTORS\n\n    dEncRaw[0] = results[0];  \/\/ simple\n    dEncRaw[1] = -results[1];  \/\/ simple\n    dEncRaw[3] = results[2];  \/\/ simple\n\n    dEncRaw[4] = 45;\n\n    mentalPositionControl->positionMove(dEncRaw.data());\n\n    \/\/********************************FINAL OBSERVATION STEP********************************************************\/\/\n\n    \/\/Obtain the actual state of the feature environment.\n\n    std::vector<double> observation;\n\n    \/\/FORCE\n\n    yarp::os::Bottle* b = pForcePort->read(false);\n    if(!b)\n    {\n        printf(\"No force yet\\n\");\n    }\n    printf(\"El parámetro del sensor de fuerza es %s\\n\", b->toString().c_str());\n    for(size_t i=0; i<b->size(); i++)\n    {\n        observation.push_back( b->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n    \/\/POSITION\n\n    yarp::os::Bottle* b = pForcePort->read(false);\n    if(!b)\n    {\n        printf(\"No force yet\\n\");\n    }\n    printf(\"El parámetro del sensor de fuerza es %s\\n\", b->toString().c_str());\n    for(size_t i=0; i<b->size(); i++)\n    {\n        observation.push_back( b->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n    \/\/POSITION\n\n    yarp::os::Bottle cmd,res;\n    cmd.addString(\"world\");\n    cmd.addString(\"whereis\");\n    cmd.addString(\"tcp\");\n    cmd.addString(\"rightArm\");\n    pRpcClientWorld->write(cmd,res);\n    \/*printf(\"El parámetro de posicion es %s\\n\", res.toString().c_str());\n    for(size_t i=0; i<res.size(); i++)\n    {\n        observation.push_back( res.get(i).asDouble() );\n        \/\/std(observation[i]);\n    }*\/\n    yarp::os::Bottle* pos = res.get(0).asList();\n    printf(\"El parámetro de posicion es %s\\n\", pos->toString().c_str());\n    for(size_t i=0; i<pos->size(); i++)\n    {\n        observation.push_back( pos->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n\n    \/\/P:yarp::os::Time::delay(DEFAULT_DELAY_S);\n    \/\/yarp::os::Bottle cmd,res;\n    \/\/P:cmd.addString(\"get\");\n    \/\/P:pRpcClient->write(cmd,res);\n    \/\/P:printf(\"got: %s\\n\",res.toString().c_str());\n    \/\/P:for(int i=0;i<res.size();i++)\n    \/\/P:{\n        \/\/std::cout << \"past: \";\n        \/\/std::cout << psqFeatures->operator [](i);\n        \/\/std::cout << \" present: \";\n        \/\/P:psqFeatures->operator [](i) |= res.get(i).asInt();  \/\/ logic OR\n        \/\/std::cout << psqFeatures->operator [](i);\n        \/\/std::cout << std::endl;\n    \/\/P:}\n\n    \/\/********************************MEMORY UPDATE STEP*******************************************************************\/\/\n\n    std::ofstream myfile1;\n    myfile1.open(\"memoryOET.txt\", std::ios_base::out );\n    if (myfile1.is_open()){\n        for(int i=0;i<observation.size();i++)\n        {\n            myfile1<<observation[i];\n            \/\/myfile1<<\"1 \";\n            \/\/myfile1<< psqFeatures->operator[](i) << \" \";\n            \/\/P myfile1<< psqFeatures->operator [](i);\n            \/\/Pmyfile1<< \" \";\n            \/\/std::cout<<psqFeatures->operator[](i) << \" \";\n            \/\/Pstd::cout<< psqFeatures->operator [](i);\n            \/\/Pstd::cout<< \" \";\n        }\n        std::cout<<std::endl;\n        \/\/myfile1<<bestInd[0]->fitness->getValue()<<std::endl; \/\/Fitness\n    }\n    myfile1.close();\n\n    \/\/********************************RESET STEP*******************************************************************\/\/\n    \/\/-- Move the mental robot to 0 so env can be reset\n    std::vector<double> dEncRaw2(6,0);  \/\/ NUM_MOTORS\n    mentalPositionControl->positionMove(dEncRaw2.data());\n    \/\/-- Reset the wall\n    \/\/P:yarp::os::Bottle cmd3,res3;\n    \/\/P:cmd3.addString(\"reset\");\n    \/\/P:pRpcClient->write(cmd3,res3);\n\n}\n\n\/************************************************************************\/\n\n} \/\/ namespace teo\n<commit_msg>ready to start working<commit_after>\/\/ -*- mode:C++; tab-width:3; c-basic-offset:4; indent-tabs-mode:nil -*-\n\n\/\/Copyright: Universidad Carlos III de Madrid (C) 2016\n\/\/Authors: jgvictores, raulfdzbis, smorante\n\n#include \"CgdaIronFitnessFunction.hpp\"\n\n#define NTPOINTS 17\n#define NFEATURES 6\n#define NSQUARES 16\n\nnamespace teo\n{\n\n\/************************************************************************\/\n\nvoid CgdaIronFitnessFunction::registerParameters(StateP state) {\n\tstate->getRegistry()->registerEntry(\"function\", (voidP) (new uint(1)), ECF::UINT);\n}\n\n\/************************************************************************\/\n\nbool CgdaIronFitnessFunction::initialize(StateP state) {\n\n    voidP sptr = state->getRegistry()->getEntry(\"function\"); \/\/ get parameter value\n\n\treturn true;\n}\n\n\/************************************************************************\/\n\nFitnessP CgdaIronFitnessFunction::evaluate(IndividualP individual) {\n    \/\/ Evaluation creates a new fitness object using a smart pointer\n\t\/\/ in our case, we try to minimize the function value, so we use FitnessMin fitness (for minimization problems)\n\tFitnessP fitness (new FitnessMin);\n\n\t\/\/ we define FloatingPoint as the only genotype (in the configuration file)\n\tFloatingPoint::FloatingPoint* gen = (FloatingPoint::FloatingPoint*) individual->getGenotype().get();\n\n\t\/\/ we implement the fitness function 'as is', without any translation\n\t\/\/ the number of variables is read from the genotype itself (size of 'realValue' vactor)\n\n    double value =0;\n    value= getCustomFitness(gen->realValue);\n    fitness->setValue(value);\n    return fitness;\n}\n\n\/************************************************************************\/\n\ndouble CgdaIronFitnessFunction::getCustomFitness(vector <double> genPoints){\n\n    \/\/***********************Define the generalized feature trajectory**********************************************\/\/\n\n    std::vector<std::vector<double>> target;\n    \/\/double target[NFEATURES][NTPOINTS];\n\n\n\n\/\/    int a[3][4] = {\n\/\/       {0, 1, 2, 3} ,   \/*  initializers for row indexed by 0 *\/\n\/\/       {4, 5, 6, 7} ,   \/*  initializers for row indexed by 1 *\/\n\/\/       {8, 9, 10, 11}   \/*  initializers for row indexed by 2 *\/\n\/\/    };\n\n    \/\/This is sqFeatures\n\n    \/\/target.push_back(feature1T1,feature2T2,feature3T3...);\n\n    \/\/*****************************************OBSERVATION STEP*****************************************************\/\/\n\n    std::vector<double> observation;\n\n    \/\/READ FROM PsqFeatures\n    for(int i=0;i<psqFeatures->size();i++)\n    {\n        observation.push_back(psqFeatures->operator [](i));\n    }\n\n    \/\/Obtain TEO state\n    \/\/P:yarp::os::Bottle cmd3,res3;\n    \/\/P:cmd3.addString(\"reset\");\n    \/\/P:pRpcClient->write(cmd3,res3);\n\n    \/\/P:double percentage;\n    \/\/P:double Npaint=0;\n\n    \/\/P:for(int i=0;i<psqFeatures->size();i++)\n    \/\/P:{\n    \/\/P:    Npaint += psqFeatures->operator [](i);\n    \/\/P: }\n\n    \/\/Percentage of the wall painted before evolution\n    \/\/P:printf(\"EL NPAINT ES::::::: %f \\n\",Npaint);\n    \/\/P:percentage=(Npaint\/NSQUARES)*100;\n    \/\/P:printf(\"EL PERCENTAGE ES::::::: %f \\n\",percentage);\n\n    \/\/***************************************LOCALIZATION STEP******************************************************\/\/\n\n    \/\/Serch the timeStep where we are (LOCALIZATION STEP)\n    int timeStep;\n    double diff=1000000;\n    for(int i=0;i<NFEATURES;i++){\n        double aux_dist=0;\n        double aux_elem;\n        for(int j=0;j<NTPOINTS;j++){ \/\/We give priority to the elements at the last positions\n            aux_elem=observation[i]-target[i][j];\n            aux_elem=aux_elem*aux_elem;\n            aux_dist=aux_dist+aux_elem;\n        }\n        \/\/printf(\"Percentage: %d \\n\",percentage);\n        \/\/printf(\"Target: %d \\n\", Const_target[i]);\n        \/\/P:diff_aux=percentage-Const_target[i];\n\n\n        \/\/P:diff_aux=diff_aux*diff_aux;\n        \/\/P: diff_aux=sqrt(diff_aux);\n\n        aux_dist=sqrt(aux_dist);\n\n        if(aux_dist<diff){\n            timeStep=i;\n            diff=aux_dist;\n            \/\/printf(\"i -> %d\", i);\n            \/\/printf(\"Time Step %d \\n\",timeStep);\n\n        }\n    }\n\n    \/\/********************************SIMULATED EXECUTION STEP******************************************************\/\/\n\n    \/\/Set new positions of the robot using dEncRaw\n    std::vector<double> dEncRaw(6);  \/\/ NUM_MOTORS\n    dEncRaw[0] = genPoints[0];  \/\/ simple\n    dEncRaw[1] = -genPoints[1];  \/\/ simple\n    dEncRaw[3] = genPoints[2];  \/\/ simple\n\n    dEncRaw[4] = 45; \/\/TODO:This must be changed for IRON\n\n    \/\/Actually move the robot\n    mentalPositionControl->positionMove(dEncRaw.data());\n\n\n    \/\/********************************SECOND OBSERVATION STEP*******************************************************\/\/\n\n    observation.clear();\n\n    \/\/FORCE\n\n    yarp::os::Bottle* b = pForcePort->read(false);\n    if(!b)\n    {\n        printf(\"No force yet\\n\");\n    }\n    printf(\"El parámetro del sensor de fuerza es %s\\n\", b->toString().c_str());\n    for(size_t i=0; i<b->size(); i++)\n    {\n        observation.push_back( b->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n    \/\/POSITION\n\n    yarp::os::Bottle cmd,res;\n    cmd.addString(\"world\");\n    cmd.addString(\"whereis\");\n    cmd.addString(\"tcp\");\n    cmd.addString(\"rightArm\");\n    pRpcClientWorld->write(cmd,res);\n    \/*printf(\"El parámetro de posicion es %s\\n\", res.toString().c_str());\n    for(size_t i=0; i<res.size(); i++)\n    {\n        observation.push_back( res.get(i).asDouble() );\n        \/\/std(observation[i]);\n    }*\/\n    yarp::os::Bottle* pos = res.get(0).asList();\n    printf(\"El parámetro de posicion es %s\\n\", pos->toString().c_str());\n    for(size_t i=0; i<pos->size(); i++)\n    {\n        observation.push_back( pos->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n    \/\/P:Npaint=0;\n    \/\/P:yarp::os::Time::delay(DEFAULT_DELAY_S);\n    \/\/P:yarp::os::Bottle cmd2,res2;\n    \/\/P:cmd2.addString(\"get\");\n    \/\/P:pRpcClient->write(cmd2,res2);\n    \/\/P:for(int i=0;i<res2.size();i++)\n    \/\/P:{\n    \/\/P:    if ( res2.get(i).asInt() || psqFeatures->operator [](i) )  \/\/ logic OR;\n    \/\/P:        Npaint ++;\n    \/\/P:}\n\n\n\n    \/\/********************************FITNESS CALCULATION STEP******************************************************\/\/\n\n    \/\/Fitness of the actual point= percentage of the wall painted\n\n    \/\/P:percentage=(Npaint\/NSQUARES)*100;\n\n    \/\/The fit is the L2 norm between the current features, and the t+1 feature environment.\n    double fit;\n    printf(\"EL TIME STEP ES EL SIGUIENTE:: %d \\n\",timeStep);\n    \/\/P:printf(\"El percentage es:: %f\", percentage);\n    \/\/P:printf(\"El Consta target es:: %f \\n\", Const_target[timeStep+1]);\n    \/\/fit=sqrt(pow((percentage-Const_target[timeStep+1]),2)); \/\/The fit is the euclidean distance between current feature and t+1. Since 1 dimension euclidean distance equals difference.\n\n    for(int i=0;i<NFEATURES;i++){\n        double aux_fit,aux_elem;\n        aux_elem=observation[i]-target[timeStep][i];\n        aux_fit=aux_elem*aux_elem;\n        fit=fit+aux_fit;\n    }\n\n    fit=sqrt(fit);\n\n    \/\/featureTrajectories->compare(attempVectforSimpleDiscrepancy,fit);\n\n    cout << std::endl << \" fit: \" << fit << \" \";\n\n    \/\/GOING BACK TO INIT POSITION\n    std::vector<double> dEncRaw2(6,0);  \/\/ NUM_MOTORS\n    \/\/Actually move the robot\n    mentalPositionControl->positionMove(dEncRaw2.data());\n\n    return fit;\n}\n\n\/************************************************************************\/\n\nvoid CgdaIronFitnessFunction::individualExecution(vector<double> results){\n\n    \/\/GOAL: Execute the obtained values to obtain the executed trajectory\n\n    \/\/********************************EXECUTION STEP****************************************************************\/\/\n\n    std::vector<double> dEncRaw(6);  \/\/ NUM_MOTORS\n\n    dEncRaw[0] = results[0];  \/\/ simple\n    dEncRaw[1] = -results[1];  \/\/ simple\n    dEncRaw[3] = results[2];  \/\/ simple\n\n    dEncRaw[4] = 45;\n\n    mentalPositionControl->positionMove(dEncRaw.data());\n\n    \/\/********************************FINAL OBSERVATION STEP********************************************************\/\/\n\n    \/\/Obtain the actual state of the feature environment.\n\n    std::vector<double> observation;\n\n    \/\/FORCE\n\n    yarp::os::Bottle* b = pForcePort->read(false);\n    if(!b)\n    {\n        printf(\"No force yet\\n\");\n    }\n    printf(\"El parámetro del sensor de fuerza es %s\\n\", b->toString().c_str());\n    for(size_t i=0; i<b->size(); i++)\n    {\n        observation.push_back( b->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n    \/\/POSITION\n\n    yarp::os::Bottle cmd,res;\n    cmd.addString(\"world\");\n    cmd.addString(\"whereis\");\n    cmd.addString(\"tcp\");\n    cmd.addString(\"rightArm\");\n    pRpcClientWorld->write(cmd,res);\n    \/*printf(\"El parámetro de posicion es %s\\n\", res.toString().c_str());\n    for(size_t i=0; i<res.size(); i++)\n    {\n        observation.push_back( res.get(i).asDouble() );\n        \/\/std(observation[i]);\n    }*\/\n    yarp::os::Bottle* pos = res.get(0).asList();\n    printf(\"El parámetro de posicion es %s\\n\", pos->toString().c_str());\n    for(size_t i=0; i<pos->size(); i++)\n    {\n        observation.push_back( pos->get(i).asDouble() );\n        \/\/std(observation[i]);\n    }\n\n\n    \/\/P:yarp::os::Time::delay(DEFAULT_DELAY_S);\n    \/\/yarp::os::Bottle cmd,res;\n    \/\/P:cmd.addString(\"get\");\n    \/\/P:pRpcClient->write(cmd,res);\n    \/\/P:printf(\"got: %s\\n\",res.toString().c_str());\n    \/\/P:for(int i=0;i<res.size();i++)\n    \/\/P:{\n        \/\/std::cout << \"past: \";\n        \/\/std::cout << psqFeatures->operator [](i);\n        \/\/std::cout << \" present: \";\n        \/\/P:psqFeatures->operator [](i) |= res.get(i).asInt();  \/\/ logic OR\n        \/\/std::cout << psqFeatures->operator [](i);\n        \/\/std::cout << std::endl;\n    \/\/P:}\n\n    \/\/********************************MEMORY UPDATE STEP*******************************************************************\/\/\n\n    std::ofstream myfile1;\n    myfile1.open(\"memoryOET.txt\", std::ios_base::out );\n    if (myfile1.is_open()){\n        for(int i=0;i<observation.size();i++)\n        {\n            myfile1<<observation[i];\n            \/\/myfile1<<\"1 \";\n            \/\/myfile1<< psqFeatures->operator[](i) << \" \";\n            \/\/P myfile1<< psqFeatures->operator [](i);\n            \/\/Pmyfile1<< \" \";\n            \/\/std::cout<<psqFeatures->operator[](i) << \" \";\n            \/\/Pstd::cout<< psqFeatures->operator [](i);\n            \/\/Pstd::cout<< \" \";\n        }\n        std::cout<<std::endl;\n        \/\/myfile1<<bestInd[0]->fitness->getValue()<<std::endl; \/\/Fitness\n    }\n    myfile1.close();\n\n    \/\/********************************RESET STEP*******************************************************************\/\/\n    \/\/-- Move the mental robot to 0 so env can be reset\n    std::vector<double> dEncRaw2(6,0);  \/\/ NUM_MOTORS\n    mentalPositionControl->positionMove(dEncRaw2.data());\n    \/\/-- Reset the wall\n    \/\/P:yarp::os::Bottle cmd3,res3;\n    \/\/P:cmd3.addString(\"reset\");\n    \/\/P:pRpcClient->write(cmd3,res3);\n\n}\n\n\/************************************************************************\/\n\n} \/\/ namespace teo\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2015 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 GDAL_DATASOURCE_MMAP_HPP\n#define GDAL_DATASOURCE_MMAP_HPP\n\n#include <mapnik\/util\/fs.hpp>\n#include <mapnik\/make_unique.hpp>\n#include <mapnik\/debug.hpp>\n\n#include <boost\/interprocess\/file_mapping.hpp>\n#include <boost\/interprocess\/mapped_region.hpp>\n#include <boost\/filesystem.hpp>\n\n#include <gdal_priv.h>\n\nstruct mmapped_vsifile\n{\n    mmapped_vsifile(std::string const& filepath)\n        : mapping(filepath.c_str(), boost::interprocess::read_only),\n          region(mapping, boost::interprocess::read_only)\n    {\n        boost::filesystem::path vsimem(\"\/vsimem\");\n        vsimem \/= filepath;\n\n        virt_file = VSIFileFromMemBuffer(\n            vsimem.string().c_str(),\n            static_cast<GByte*>(region.get_address()),\n            region.get_size(),\n            false);\n\n        if (virt_file == NULL)\n        {\n            throw std::runtime_error(\"Call to VSIFileFromMemBuffer \"\n                \"failed with '\" + vsimem.string() + \"'\");\n        }\n\n        name = vsimem.string();\n    }\n\n    ~mmapped_vsifile()\n    {\n        VSIFCloseL(virt_file);\n    }\n\n    boost::interprocess::file_mapping mapping;\n    boost::interprocess::mapped_region region;\n    VSILFILE * virt_file;\n    std::string name;\n};\n\nstruct mmapped_tiff_dataset\n{\n    mmapped_tiff_dataset(std::string const& filepath)\n        : tiff_file_mapping(filepath),\n          overviews_file_mapping()\n    {\n        std::string ovr_file_name = filepath + \".ovr\";\n        if (mapnik::util::exists(ovr_file_name))\n        {\n            try\n            {\n                overviews_file_mapping = std::make_unique<mmapped_vsifile>(\n                    ovr_file_name);\n            }\n            catch (std::exception const& e)\n            {\n                MAPNIK_LOG_ERROR(mmapped_tiff_dataset) <<\n                    \"gdal_datasource: Cannot mmap() \"\n                    \" overviews file '\" << ovr_file_name <<\n                    \"': \" << e.what();\n            }\n        }\n    }\n\n    mmapped_vsifile tiff_file_mapping;\n    std::unique_ptr<mmapped_vsifile> overviews_file_mapping;\n};\n\n#endif \/\/ GDAL_DATASOURCE_MMAP_HPP\n<commit_msg>gdal: Virtual memory file needs to be registered under unique name<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2015 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 GDAL_DATASOURCE_MMAP_HPP\n#define GDAL_DATASOURCE_MMAP_HPP\n\n#include <mapnik\/util\/fs.hpp>\n#include <mapnik\/make_unique.hpp>\n#include <mapnik\/debug.hpp>\n\n#include <boost\/interprocess\/file_mapping.hpp>\n#include <boost\/interprocess\/mapped_region.hpp>\n#include <boost\/filesystem.hpp>\n\n#include <gdal_priv.h>\n\n#include <sstream>\n\nstruct mmapped_vsifile\n{\n    mmapped_vsifile(std::string const& filepath,\n                    std::string const& unique_path)\n        : mapping(filepath.c_str(), boost::interprocess::read_only),\n          region(mapping, boost::interprocess::read_only)\n    {\n        boost::filesystem::path vsimem_path(\"\/vsimem\");\n        vsimem_path \/= unique_path.empty() ? unique_id() : unique_path;\n        vsimem_path \/= filepath;\n\n        virt_file = VSIFileFromMemBuffer(\n            vsimem_path.string().c_str(),\n            static_cast<GByte*>(region.get_address()),\n            region.get_size(),\n            false);\n\n        if (virt_file == NULL)\n        {\n            throw std::runtime_error(\"Call to VSIFileFromMemBuffer \"\n                \"failed with '\" + vsimem_path.string() + \"'\");\n        }\n\n        name = vsimem_path.string();\n    }\n\n    std::string unique_id() const\n    {\n        std::stringstream ss;\n        ss << region.get_address();\n        return ss.str();\n    }\n\n    ~mmapped_vsifile()\n    {\n        VSIFCloseL(virt_file);\n        VSIUnlink(name.c_str());\n    }\n\n    boost::interprocess::file_mapping mapping;\n    boost::interprocess::mapped_region region;\n    VSILFILE * virt_file;\n    std::string name;\n};\n\nstruct mmapped_tiff_dataset\n{\n    mmapped_tiff_dataset(std::string const& filepath)\n        : tiff_file_mapping(filepath, std::string()),\n          overviews_file_mapping()\n    {\n        std::string ovr_file_name = filepath + \".ovr\";\n        if (mapnik::util::exists(ovr_file_name))\n        {\n            try\n            {\n                overviews_file_mapping = std::make_unique<mmapped_vsifile>(\n                    ovr_file_name, tiff_file_mapping.unique_id());\n            }\n            catch (std::exception const& e)\n            {\n                MAPNIK_LOG_ERROR(mmapped_tiff_dataset) <<\n                    \"gdal_datasource: Cannot mmap() \"\n                    \" overviews file '\" << ovr_file_name <<\n                    \"': \" << e.what();\n            }\n        }\n    }\n\n    mmapped_vsifile tiff_file_mapping;\n    std::unique_ptr<mmapped_vsifile> overviews_file_mapping;\n};\n\n#endif \/\/ GDAL_DATASOURCE_MMAP_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2010-2013 Joshua Boyce.\r\n\/\/ See the file COPYING for copying permission.\r\n\r\n#pragma once\r\n\r\n#include <iosfwd>\r\n#include <memory>\r\n#include <string>\r\n\r\n#include <windows.h>\r\n\r\n#include \"hadesmem\/config.hpp\"\r\n\r\nnamespace hadesmem\r\n{\r\n\r\nclass Process;\r\n\r\nclass PeFile;\r\n\r\nclass Export\r\n{\r\npublic:\r\n  explicit Export(Process const& process, PeFile const& pe_file, \r\n    WORD ordinal);\r\n  \r\n  Export(Export const& other);\r\n  \r\n  Export& operator=(Export const& other);\r\n\r\n  Export(Export&& other) HADESMEM_NOEXCEPT;\r\n  \r\n  Export& operator=(Export&& other) HADESMEM_NOEXCEPT;\r\n  \r\n  ~Export();\r\n\r\n  DWORD GetRva() const;\r\n\r\n  PVOID GetVa() const;\r\n\r\n  std::string GetName() const;\r\n\r\n  WORD GetOrdinal() const;\r\n\r\n  bool ByName() const;\r\n\r\n  bool ByOrdinal() const;\r\n\r\n  bool IsForwarded() const;\r\n\r\n  std::string GetForwarder() const;\r\n\r\n  std::string GetForwarderModule() const;\r\n\r\n  std::string GetForwarderFunction() const;\r\n\r\n  bool IsForwardedByOrdinal() const;\r\n\r\n  WORD GetForwarderOrdinal() const;\r\n\r\nprivate:\r\n  struct Impl;\r\n  std::unique_ptr<Impl> impl_;\r\n};\r\n\r\nbool operator==(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator!=(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator<(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator<=(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator>(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator>=(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nstd::ostream& operator<<(std::ostream& lhs, Export const& rhs);\r\n\r\nstd::wostream& operator<<(std::wostream& lhs, Export const& rhs);\r\n\r\n}\r\n<commit_msg>* Note to self.<commit_after>\/\/ Copyright (C) 2010-2013 Joshua Boyce.\r\n\/\/ See the file COPYING for copying permission.\r\n\r\n#pragma once\r\n\r\n#include <iosfwd>\r\n#include <memory>\r\n#include <string>\r\n\r\n#include <windows.h>\r\n\r\n#include \"hadesmem\/config.hpp\"\r\n\r\nnamespace hadesmem\r\n{\r\n\r\nclass Process;\r\n\r\nclass PeFile;\r\n\r\n\/\/ TODO: Constructor to create Export by name (optimize using binary search).\r\n\r\nclass Export\r\n{\r\npublic:\r\n  explicit Export(Process const& process, PeFile const& pe_file, \r\n    WORD ordinal);\r\n  \r\n  Export(Export const& other);\r\n  \r\n  Export& operator=(Export const& other);\r\n\r\n  Export(Export&& other) HADESMEM_NOEXCEPT;\r\n  \r\n  Export& operator=(Export&& other) HADESMEM_NOEXCEPT;\r\n  \r\n  ~Export();\r\n\r\n  DWORD GetRva() const;\r\n\r\n  PVOID GetVa() const;\r\n\r\n  std::string GetName() const;\r\n\r\n  WORD GetOrdinal() const;\r\n\r\n  bool ByName() const;\r\n\r\n  bool ByOrdinal() const;\r\n\r\n  bool IsForwarded() const;\r\n\r\n  std::string GetForwarder() const;\r\n\r\n  std::string GetForwarderModule() const;\r\n\r\n  std::string GetForwarderFunction() const;\r\n\r\n  bool IsForwardedByOrdinal() const;\r\n\r\n  WORD GetForwarderOrdinal() const;\r\n\r\nprivate:\r\n  struct Impl;\r\n  std::unique_ptr<Impl> impl_;\r\n};\r\n\r\nbool operator==(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator!=(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator<(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator<=(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator>(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nbool operator>=(Export const& lhs, Export const& rhs) HADESMEM_NOEXCEPT;\r\n\r\nstd::ostream& operator<<(std::ostream& lhs, Export const& rhs);\r\n\r\nstd::wostream& operator<<(std::wostream& lhs, Export const& rhs);\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\nnamespace MATH_NAMESPACE\n{\n\n\/\/--------------------------------------------------------------------------------------------------\n\/\/ plane3 members\n\/\/\n\ntemplate <size_t Dim, typename T, typename P>\nMATH_FUNC\ninline basic_plane<Dim, T, P>::basic_plane(vector<Dim, T> const& n, T o)\n    : normal(n)\n    , offset(o)\n{\n}\n\ntemplate <size_t Dim, typename T, typename P>\nMATH_FUNC\ninline basic_plane<Dim, T, P>::basic_plane(vector<Dim, T> const& n, vector<Dim, T> const& p)\n    : normal(n)\n    , offset(dot(n, p))\n{\n}\n\n} \/\/ MATH_NAMESPACE\n<commit_msg>Comparison operators for basic_plane<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\nnamespace MATH_NAMESPACE\n{\n\n\/\/--------------------------------------------------------------------------------------------------\n\/\/ plane3 members\n\/\/\n\ntemplate <size_t Dim, typename T, typename P>\nMATH_FUNC\ninline basic_plane<Dim, T, P>::basic_plane(vector<Dim, T> const& n, T o)\n    : normal(n)\n    , offset(o)\n{\n}\n\ntemplate <size_t Dim, typename T, typename P>\nMATH_FUNC\ninline basic_plane<Dim, T, P>::basic_plane(vector<Dim, T> const& n, vector<Dim, T> const& p)\n    : normal(n)\n    , offset(dot(n, p))\n{\n}\n\n\n\/\/--------------------------------------------------------------------------------------------------\n\/\/ Comparisons\n\/\/\n\ntemplate <size_t Dim, typename T, typename P>\nMATH_FUNC\ninline bool operator==(basic_plane<Dim, T, P> const& a, basic_plane<Dim, T, P> const& b)\n{\n    return a.normal == b.normal && a.offset == b.offset;\n}\n\ntemplate <size_t Dim, typename T, typename P>\nMATH_FUNC\ninline bool operator!=(basic_plane<Dim, T, P> const& a, basic_plane<Dim, T, P> const& b)\n{\n    return a.normal != b.normal || a.offset != b.offset;\n}\n\n} \/\/ MATH_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/*\nnetwork.cpp\n\nmisc network functions\n*\/\n\/*\nCopyright  2009 Far Group\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:\n1. Redistributions of source code must retain the above copyright\n   notice, this list of conditions and the following disclaimer.\n2. 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.\n3. The name of the authors may not be used to endorse or promote products\n   derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR\nIMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\nOF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\nIN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,\nINCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT\nNOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY 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\n#include \"headers.hpp\"\n#pragma hdrstop\n\n#include \"network.hpp\"\n#include \"language.hpp\"\n#include \"message.hpp\"\n#include \"stddlg.hpp\"\n#include \"drivemix.hpp\"\n#include \"flink.hpp\"\n#include \"cddrv.hpp\"\n#include \"pathmix.hpp\"\n\nvoid GetStoredUserName(wchar_t cDrive, string &strUserName)\n{\n\t\/\/     WNetGetUser\n\tstrUserName.clear();\n\tconst wchar_t KeyName[]={L'N',L'e',L't',L'w',L'o',L'r',L'k',L'\\\\',cDrive,L'\\0'};\n\tHKEY hKey;\n\n\tif (RegOpenKeyEx(HKEY_CURRENT_USER,KeyName,0,KEY_QUERY_VALUE,&hKey)==ERROR_SUCCESS && hKey)\n\t{\n\t\tRegQueryStringValue(hKey, L\"UserName\", strUserName);\n\t\tRegCloseKey(hKey);\n\t}\n}\n\nvoid AddSavedNetworkDisks(DWORD& Mask, DWORD& NetworkMask)\n{\n\tHANDLE hEnum;\n\n\tif (!WNetOpenEnum(RESOURCE_REMEMBERED, RESOURCETYPE_DISK, 0, 0, &hEnum))\n\t{\n\t\tDWORD bufsz = 16*1024;\n\t\tNETRESOURCE *netResource = (NETRESOURCE *)xf_malloc(bufsz);\n\n\t\tif (netResource)\n\t\t{\n\t\t\twhile (1)\n\t\t\t{\n\t\t\t\tDWORD size=1;\n\t\t\t\tbufsz = 16*1024;\n\t\t\t\tmemset(netResource,0,bufsz);\n\t\t\t\tDWORD res = WNetEnumResource(hEnum, &size, netResource, &bufsz);\n\n\t\t\t\tif (res == NO_ERROR && size > 0 && netResource->lpLocalName )\n\t\t\t\t{\n\t\t\t\t\twchar_t letter = Lower(netResource->lpLocalName[0]);\n\n\t\t\t\t\tif (letter >= L'a' && letter <= L'z' && !wcscmp(netResource->lpLocalName+1, L\":\"))\n\t\t\t\t\t{\n\t\t\t\t\t\tint CurrBit = 1 << (letter - L'a');\n\n\t\t\t\t\t\tif (!(Mask&CurrBit))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tMask |= CurrBit;\n\t\t\t\t\t\t\tNetworkMask |=  CurrBit;\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\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\txf_free(netResource);\n\t\t}\n\n\t\tWNetCloseEnum(hEnum);\n\t}\n}\n\nvoid ConnectToNetworkDrive(const string& NewDir)\n{\n\tstring strRemoteName;\n\tDriveLocalToRemoteName(DRIVE_REMOTE_NOT_CONNECTED,NewDir[0],strRemoteName);\n\tstring strUserName, strPassword;\n\tGetStoredUserName(NewDir[0], strUserName);\n\tNETRESOURCE netResource;\n\tnetResource.dwType = RESOURCETYPE_DISK;\n\tnetResource.lpLocalName = (wchar_t *)NewDir.data();\n\tnetResource.lpRemoteName = (wchar_t *)strRemoteName.data();\n\tnetResource.lpProvider = 0;\n\tDWORD res = WNetAddConnection2(&netResource, nullptr, EmptyToNull(strUserName.data()), 0);\n\n\tif (res == ERROR_SESSION_CREDENTIAL_CONFLICT)\n\t\tres = WNetAddConnection2(&netResource, nullptr, nullptr, 0);\n\n\tif (res)\n\t{\n\t\twhile (1)\n\t\t{\n\t\t\tif (!GetNameAndPassword(strRemoteName, strUserName, strPassword, nullptr, GNP_USELAST))\n\t\t\t\tbreak;\n\n\t\t\tres = WNetAddConnection2(&netResource, strPassword.data(), EmptyToNull(strUserName.data()), 0);\n\n\t\t\tif (!res)\n\t\t\t\tbreak;\n\n\t\t\tif (res != ERROR_ACCESS_DENIED && res != ERROR_INVALID_PASSWORD && res != ERROR_LOGON_FAILURE)\n\t\t\t{\n\t\t\t\tMessage(MSG_WARNING, 1, MSG(MError), GetErrorString().data(), MSG(MOk));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nstring &CurPath2ComputerName(const string& CurDir, string &strComputerName)\n{\n\tstring strNetDir;\n\tstrComputerName.clear();\n\n\tif (!CurDir.compare(0, 2, L\"\\\\\\\\\"))\n\t{\n\t\tstrNetDir = CurDir;\n\t}\n\telse\n\t{\n\t\tstring LocalName(CurDir.data(), 2);\n\t\tapiWNetGetConnection(LocalName, strNetDir);\n\t}\n\n\tif (!strNetDir.compare(0, 2, L\"\\\\\\\\\"))\n\t{\n\t\tstrComputerName = strNetDir.data()+2;\n\t\tsize_t pos;\n\n\t\tif (!FindSlash(pos,strComputerName))\n\t\t\tstrComputerName.clear();\n\t\telse\n\t\t\tstrComputerName.resize(pos);\n\t}\n\n\treturn strComputerName;\n}\n\nbool DriveLocalToRemoteName(int DriveType, wchar_t Letter, string &strDest)\n{\n\tbool NetPathShown=false, IsOK=false;\n\twchar_t LocalName[8]=L\" :\\0\\0\\0\";\n\tstring strRemoteName;\n\n\t*LocalName=Letter;\n\tstrDest.clear();\n\n\tif (DriveType == DRIVE_UNKNOWN)\n\t{\n\t\tLocalName[2]=L'\\\\';\n\t\tDriveType = FAR_GetDriveType(LocalName);\n\t\tLocalName[2]=0;\n\t}\n\n\tif (IsDriveTypeRemote(DriveType))\n\t{\n\t\tDWORD res = apiWNetGetConnection(LocalName,strRemoteName);\n\n\t\tif (res == NO_ERROR || res == ERROR_CONNECTION_UNAVAIL)\n\t\t{\n\t\t\tNetPathShown=true;\n\t\t\tIsOK=true;\n\t\t}\n\t}\n\n\tif (!NetPathShown && GetSubstName(DriveType, LocalName, strRemoteName))\n\t\tIsOK=true;\n\n\tif (IsOK)\n\t\tstrDest = strRemoteName;\n\n\treturn IsOK;\n}\n<commit_msg>one more lasterror<commit_after>\/*\nnetwork.cpp\n\nmisc network functions\n*\/\n\/*\nCopyright  2009 Far Group\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:\n1. Redistributions of source code must retain the above copyright\n   notice, this list of conditions and the following disclaimer.\n2. 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.\n3. The name of the authors may not be used to endorse or promote products\n   derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR\nIMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\nOF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\nIN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,\nINCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT\nNOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY 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\n#include \"headers.hpp\"\n#pragma hdrstop\n\n#include \"network.hpp\"\n#include \"language.hpp\"\n#include \"message.hpp\"\n#include \"stddlg.hpp\"\n#include \"drivemix.hpp\"\n#include \"flink.hpp\"\n#include \"cddrv.hpp\"\n#include \"pathmix.hpp\"\n\nvoid GetStoredUserName(wchar_t cDrive, string &strUserName)\n{\n\t\/\/     WNetGetUser\n\tstrUserName.clear();\n\tconst wchar_t KeyName[]={L'N',L'e',L't',L'w',L'o',L'r',L'k',L'\\\\',cDrive,L'\\0'};\n\tHKEY hKey;\n\n\tif (RegOpenKeyEx(HKEY_CURRENT_USER,KeyName,0,KEY_QUERY_VALUE,&hKey)==ERROR_SUCCESS && hKey)\n\t{\n\t\tRegQueryStringValue(hKey, L\"UserName\", strUserName);\n\t\tRegCloseKey(hKey);\n\t}\n}\n\nvoid AddSavedNetworkDisks(DWORD& Mask, DWORD& NetworkMask)\n{\n\tHANDLE hEnum;\n\n\tif (!WNetOpenEnum(RESOURCE_REMEMBERED, RESOURCETYPE_DISK, 0, 0, &hEnum))\n\t{\n\t\tDWORD bufsz = 16*1024;\n\t\tNETRESOURCE *netResource = (NETRESOURCE *)xf_malloc(bufsz);\n\n\t\tif (netResource)\n\t\t{\n\t\t\twhile (1)\n\t\t\t{\n\t\t\t\tDWORD size=1;\n\t\t\t\tbufsz = 16*1024;\n\t\t\t\tmemset(netResource,0,bufsz);\n\t\t\t\tDWORD res = WNetEnumResource(hEnum, &size, netResource, &bufsz);\n\n\t\t\t\tif (res == NO_ERROR && size > 0 && netResource->lpLocalName )\n\t\t\t\t{\n\t\t\t\t\twchar_t letter = Lower(netResource->lpLocalName[0]);\n\n\t\t\t\t\tif (letter >= L'a' && letter <= L'z' && !wcscmp(netResource->lpLocalName+1, L\":\"))\n\t\t\t\t\t{\n\t\t\t\t\t\tint CurrBit = 1 << (letter - L'a');\n\n\t\t\t\t\t\tif (!(Mask&CurrBit))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tMask |= CurrBit;\n\t\t\t\t\t\t\tNetworkMask |=  CurrBit;\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\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\txf_free(netResource);\n\t\t}\n\n\t\tWNetCloseEnum(hEnum);\n\t}\n}\n\nvoid ConnectToNetworkDrive(const string& NewDir)\n{\n\tstring strRemoteName;\n\tDriveLocalToRemoteName(DRIVE_REMOTE_NOT_CONNECTED,NewDir[0],strRemoteName);\n\tstring strUserName, strPassword;\n\tGetStoredUserName(NewDir[0], strUserName);\n\tNETRESOURCE netResource;\n\tnetResource.dwType = RESOURCETYPE_DISK;\n\tnetResource.lpLocalName = (wchar_t *)NewDir.data();\n\tnetResource.lpRemoteName = (wchar_t *)strRemoteName.data();\n\tnetResource.lpProvider = 0;\n\tDWORD res = WNetAddConnection2(&netResource, nullptr, EmptyToNull(strUserName.data()), 0);\n\n\tif (res == ERROR_SESSION_CREDENTIAL_CONFLICT)\n\t\tres = WNetAddConnection2(&netResource, nullptr, nullptr, 0);\n\n\tif (res)\n\t{\n\t\twhile (1)\n\t\t{\n\t\t\tif (!GetNameAndPassword(strRemoteName, strUserName, strPassword, nullptr, GNP_USELAST))\n\t\t\t\tbreak;\n\n\t\t\tres = WNetAddConnection2(&netResource, strPassword.data(), EmptyToNull(strUserName.data()), 0);\n\n\t\t\tif (!res)\n\t\t\t\tbreak;\n\n\t\t\tGlobal->CatchError();\n\n\t\t\tif (res != ERROR_ACCESS_DENIED && res != ERROR_INVALID_PASSWORD && res != ERROR_LOGON_FAILURE)\n\t\t\t{\n\t\t\t\tMessage(MSG_WARNING, 1, MSG(MError), GetErrorString().data(), MSG(MOk));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nstring &CurPath2ComputerName(const string& CurDir, string &strComputerName)\n{\n\tstring strNetDir;\n\tstrComputerName.clear();\n\n\tif (!CurDir.compare(0, 2, L\"\\\\\\\\\"))\n\t{\n\t\tstrNetDir = CurDir;\n\t}\n\telse\n\t{\n\t\tstring LocalName(CurDir.data(), 2);\n\t\tapiWNetGetConnection(LocalName, strNetDir);\n\t}\n\n\tif (!strNetDir.compare(0, 2, L\"\\\\\\\\\"))\n\t{\n\t\tstrComputerName = strNetDir.data()+2;\n\t\tsize_t pos;\n\n\t\tif (!FindSlash(pos,strComputerName))\n\t\t\tstrComputerName.clear();\n\t\telse\n\t\t\tstrComputerName.resize(pos);\n\t}\n\n\treturn strComputerName;\n}\n\nbool DriveLocalToRemoteName(int DriveType, wchar_t Letter, string &strDest)\n{\n\tbool NetPathShown=false, IsOK=false;\n\twchar_t LocalName[8]=L\" :\\0\\0\\0\";\n\tstring strRemoteName;\n\n\t*LocalName=Letter;\n\tstrDest.clear();\n\n\tif (DriveType == DRIVE_UNKNOWN)\n\t{\n\t\tLocalName[2]=L'\\\\';\n\t\tDriveType = FAR_GetDriveType(LocalName);\n\t\tLocalName[2]=0;\n\t}\n\n\tif (IsDriveTypeRemote(DriveType))\n\t{\n\t\tDWORD res = apiWNetGetConnection(LocalName,strRemoteName);\n\n\t\tif (res == NO_ERROR || res == ERROR_CONNECTION_UNAVAIL)\n\t\t{\n\t\t\tNetPathShown=true;\n\t\t\tIsOK=true;\n\t\t}\n\t}\n\n\tif (!NetPathShown && GetSubstName(DriveType, LocalName, strRemoteName))\n\t\tIsOK=true;\n\n\tif (IsOK)\n\t\tstrDest = strRemoteName;\n\n\treturn IsOK;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/============================================================================\n\/\/ vSMC\/include\/vsmc\/rng\/normal_distribution.hpp\n\/\/----------------------------------------------------------------------------\n\/\/                         vSMC: Scalable Monte Carlo\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2013-2015, 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 VSMC_RNG_NORMAL_DISTRIBUTION_HPP\n#define VSMC_RNG_NORMAL_DISTRIBUTION_HPP\n\n#include <vsmc\/rng\/internal\/common.hpp>\n#include <vsmc\/rng\/u01_distribution.hpp>\n#include <vsmc\/rng\/uniform_real_distribution.hpp>\n\n#define VSMC_RUNTIME_ASSERT_RNG_NORMAL_DISTRIBUTION_PARAM_CHECK(stddev)       \\\n    VSMC_RUNTIME_ASSERT((stddev > 0), \"**NormalDistribution** CONSTRUCTED \"   \\\n                                      \"WITH INVALID STANDARD DEVIATION \"      \\\n                                      \"PARAMETER VALUE\")\n\nnamespace vsmc\n{\n\nnamespace internal\n{\n\ntemplate <typename RealType, typename RNGType>\ninline void normal_distribution_impl(RNGType &rng, std::size_t n, RealType *r,\n    RealType mean, RealType stddev, RealType *s)\n{\n    u01_distribution(rng, n, r);\n    const std::size_t nu = n \/ 2;\n    RealType *const u1 = r;\n    RealType *const u2 = r + nu;\n    math::vLn(nu, u1, s);\n    math::vMul(nu, static_cast<RealType>(-2), s, s);\n    math::vSqrt(nu, s, s);\n    math::vMul(nu, math::pi_2<RealType>(), u2, u2);\n    math::vSinCos(nu, u2, u1, u2);\n    math::vMul(nu, stddev, s, s);\n    math::vFMA(nu, mean, s, u1, u1);\n    math::vFMA(nu, mean, s, u2, u2);\n}\n\n} \/\/ namespace vsmc::internal\n\n\/\/\/ \\brief Generating normal random variates\n\/\/\/ \\ingroup Distribution\ntemplate <typename RealType, typename RNGType>\ninline void normal_distribution(RNGType &rng, std::size_t n, RealType *r,\n    RealType mean = 0, RealType stddev = 1)\n{\n    const std::size_t k = 1000;\n    const std::size_t m = n \/ k;\n    const std::size_t l = n % k;\n    RealType s[k \/ 2];\n    for (std::size_t i = 0; i != m; ++i)\n        internal::normal_distribution_impl(rng, k, r + i * k, mean, stddev, s);\n    internal::normal_distribution_impl(rng, l, r + m * k, mean, stddev, s);\n    if (n % 2 != 0) {\n        U01DistributionType<RNGType, RealType> runif;\n        RealType v1 = runif(rng);\n        RealType v2 = runif(rng);\n        r[n - 1] = mean +\n            stddev * std::sqrt(-2 * std::log(v1)) *\n                std::cos(math::pi_2<RealType>() * v2);\n    }\n}\n\n\/\/\/ \\brief Normal distribution\n\/\/\/ \\ingroup Distribution\ntemplate <typename RealType>\nclass NormalDistribution\n{\n    public:\n    using result_type = RealType;\n    using distribution_type = NormalDistribution<RealType>;\n\n    class param_type\n    {\n        public:\n        using result_type = RealType;\n        using distribution_type = NormalDistribution<RealType>;\n\n        explicit param_type(result_type mean = 0, result_type stddev = 1)\n            : mean_(mean), stddev_(stddev), v_(0), saved_(false)\n        {\n            invariant();\n        }\n\n        result_type mean() const { return mean_; }\n        result_type stddev() const { return stddev_; }\n\n        friend bool operator==(\n            const param_type &param1, const param_type &param2)\n        {\n            if (!internal::is_equal(param1.mean_, param2.mean_))\n                return false;\n            if (!internal::is_equal(param1.stddev_, param2.stddev_))\n                return false;\n            if (!internal::is_equal(param1.v_, param2.v_))\n                return false;\n            if (param1.saved_ && !param2.saved)\n                return false;\n            if (!param1.saved_ && param2.saved)\n                return false;\n            return true;\n        }\n\n        friend bool operator!=(\n            const param_type &param1, const param_type &param2)\n        {\n            return !(param1 == param2);\n        }\n\n        template <typename CharT, typename Traits>\n        friend std::basic_ostream<CharT, Traits> &operator<<(\n            std::basic_ostream<CharT, Traits> &os, const param_type &param)\n        {\n            if (!os.good())\n                return os;\n\n            os << param.mean_ << ' ';\n            os << param.stddev_ << ' ';\n            os << param.v_ << ' ';\n            os << param.saved_;\n\n            return os;\n        }\n\n        template <typename CharT, typename Traits>\n        friend std::basic_istream<CharT, Traits> &operator>>(\n            std::basic_istream<CharT, Traits> &is, param_type &param)\n        {\n            if (!is.good())\n                return is;\n\n            result_type mean = 0;\n            result_type stddev = 0;\n            result_type v = 0;\n            bool saved = false;\n            is >> std::ws >> mean;\n            is >> std::ws >> stddev;\n            is >> std::ws >> v;\n            is >> std::ws >> saved;\n\n            if (is.good()) {\n                if (stddev > 0) {\n                    param = param_type(mean, stddev);\n                    param.v_ = v;\n                    param.saved_ = saved;\n                } else {\n                    is.setstate(std::ios_base::failbit);\n                }\n            }\n\n            return is;\n        }\n\n        private:\n        result_type mean_;\n        result_type stddev_;\n        result_type v_;\n        bool saved_;\n\n        friend distribution_type;\n\n        void invariant()\n        {\n            VSMC_RUNTIME_ASSERT_RNG_NORMAL_DISTRIBUTION_PARAM_CHECK(stddev_);\n            saved_ = false;\n        }\n\n        void reset() { saved_ = false; }\n    }; \/\/ class param_type\n\n    explicit NormalDistribution(result_type mean = 0, result_type stddev = 1)\n        : param_(mean, stddev)\n    {\n    }\n\n    explicit NormalDistribution(const param_type &param) : param_(param) {}\n\n    result_type mean() const { return param_.mean_; }\n    result_type stddev() const { return param_.stddev_; }\n\n    result_type min VSMC_MNE() const\n    {\n        return -std::numeric_limits<result_type>::infinity();\n    }\n\n    result_type max VSMC_MNE() const\n    {\n        return std::numeric_limits<result_type>::infinity();\n    }\n\n    template <typename RNGType>\n    result_type operator()(RNGType &rng)\n    {\n        if (param_.saved_) {\n            param_.saved_ = false;\n            return param_.v_;\n        }\n\n        result_type u = 0;\n        result_type v = 0;\n        generate_uv(rng, u, v, std::integral_constant<bool,\n                                   internal::RNGBits<RNGType>::value >= 64>());\n        result_type s = param_.stddev_ * std::sqrt(-2 * std::log(u));\n        v = std::sin(math::pi_2<result_type>() * v);\n        u = std::sqrt(1 - v * v);\n        param_.v_ = param_.mean_ * v * s;\n        param_.saved_ = true;\n\n        return param_.mean_ + u * s;\n    }\n\n    VSMC_DEFINE_RNG_DISTRIBUTION_OPERATORS\n\n    private:\n    param_type param_;\n\n    template <typename RNGType>\n    void generate_uv(\n        RNGType &rng, result_type &u, result_type &v, std::false_type)\n    {\n        U01DistributionType<RNGType, RealType> runif;\n        u = 1 - runif(rng);\n        v = 1 - runif(rng);\n    }\n\n    template <typename RNGType>\n    void generate_uv(\n        RNGType &rng, result_type &u, result_type &v, std::true_type)\n    {\n        std::uint64_t r = static_cast<std::uint64_t>(rng());\n        u = U01<std::uint32_t, RealType, Open, Closed>::eval(r);\n        v = U01<std::uint32_t, RealType, Open, Closed>::eval(r >> 32);\n    }\n}; \/\/ class NormalDistribution\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_RNG_NORMAL_DISTRIBUTION_HPP\n<commit_msg>make sure that the reuslts are finite<commit_after>\/\/============================================================================\n\/\/ vSMC\/include\/vsmc\/rng\/normal_distribution.hpp\n\/\/----------------------------------------------------------------------------\n\/\/                         vSMC: Scalable Monte Carlo\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2013-2015, 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 VSMC_RNG_NORMAL_DISTRIBUTION_HPP\n#define VSMC_RNG_NORMAL_DISTRIBUTION_HPP\n\n#include <vsmc\/rng\/internal\/common.hpp>\n#include <vsmc\/rng\/u01_distribution.hpp>\n#include <vsmc\/rng\/uniform_real_distribution.hpp>\n\n#define VSMC_RUNTIME_ASSERT_RNG_NORMAL_DISTRIBUTION_PARAM_CHECK(stddev)       \\\n    VSMC_RUNTIME_ASSERT((stddev > 0), \"**NormalDistribution** CONSTRUCTED \"   \\\n                                      \"WITH INVALID STANDARD DEVIATION \"      \\\n                                      \"PARAMETER VALUE\")\n\nnamespace vsmc\n{\n\nnamespace internal\n{\n\ntemplate <typename RealType, typename RNGType>\ninline void normal_distribution_impl(RNGType &rng, std::size_t n, RealType *r,\n    RealType mean, RealType stddev, RealType *s)\n{\n    const std::size_t nu = n \/ 2;\n    RealType *const u1 = r;\n    RealType *const u2 = r + nu;\n    u01_distribution(rng, n, r);\n    math::vSub(n, static_cast<RealType>(1), r, r);\n    math::vLn(nu, u1, s);\n    math::vMul(nu, static_cast<RealType>(-2), s, s);\n    math::vSqrt(nu, s, s);\n    math::vMul(nu, math::pi_2<RealType>(), u2, u2);\n    math::vSinCos(nu, u2, u1, u2);\n    math::vMul(nu, stddev, s, s);\n    math::vFMA(nu, mean, s, u1, u1);\n    math::vFMA(nu, mean, s, u2, u2);\n}\n\n} \/\/ namespace vsmc::internal\n\n\/\/\/ \\brief Generating normal random variates\n\/\/\/ \\ingroup Distribution\ntemplate <typename RealType, typename RNGType>\ninline void normal_distribution(RNGType &rng, std::size_t n, RealType *r,\n    RealType mean = 0, RealType stddev = 1)\n{\n    const std::size_t k = 1000;\n    const std::size_t m = n \/ k;\n    const std::size_t l = n % k;\n    RealType s[k \/ 2];\n    for (std::size_t i = 0; i != m; ++i)\n        internal::normal_distribution_impl(rng, k, r + i * k, mean, stddev, s);\n    internal::normal_distribution_impl(rng, l, r + m * k, mean, stddev, s);\n    if (n % 2 != 0) {\n        U01DistributionType<RNGType, RealType> runif;\n        RealType v1 = runif(rng);\n        RealType v2 = runif(rng);\n        r[n - 1] = mean +\n            stddev * std::sqrt(-2 * std::log(v1)) *\n                std::cos(math::pi_2<RealType>() * v2);\n    }\n}\n\n\/\/\/ \\brief Normal distribution\n\/\/\/ \\ingroup Distribution\ntemplate <typename RealType>\nclass NormalDistribution\n{\n    public:\n    using result_type = RealType;\n    using distribution_type = NormalDistribution<RealType>;\n\n    class param_type\n    {\n        public:\n        using result_type = RealType;\n        using distribution_type = NormalDistribution<RealType>;\n\n        explicit param_type(result_type mean = 0, result_type stddev = 1)\n            : mean_(mean), stddev_(stddev), v_(0), saved_(false)\n        {\n            invariant();\n        }\n\n        result_type mean() const { return mean_; }\n        result_type stddev() const { return stddev_; }\n\n        friend bool operator==(\n            const param_type &param1, const param_type &param2)\n        {\n            if (!internal::is_equal(param1.mean_, param2.mean_))\n                return false;\n            if (!internal::is_equal(param1.stddev_, param2.stddev_))\n                return false;\n            if (!internal::is_equal(param1.v_, param2.v_))\n                return false;\n            if (param1.saved_ && !param2.saved)\n                return false;\n            if (!param1.saved_ && param2.saved)\n                return false;\n            return true;\n        }\n\n        friend bool operator!=(\n            const param_type &param1, const param_type &param2)\n        {\n            return !(param1 == param2);\n        }\n\n        template <typename CharT, typename Traits>\n        friend std::basic_ostream<CharT, Traits> &operator<<(\n            std::basic_ostream<CharT, Traits> &os, const param_type &param)\n        {\n            if (!os.good())\n                return os;\n\n            os << param.mean_ << ' ';\n            os << param.stddev_ << ' ';\n            os << param.v_ << ' ';\n            os << param.saved_;\n\n            return os;\n        }\n\n        template <typename CharT, typename Traits>\n        friend std::basic_istream<CharT, Traits> &operator>>(\n            std::basic_istream<CharT, Traits> &is, param_type &param)\n        {\n            if (!is.good())\n                return is;\n\n            result_type mean = 0;\n            result_type stddev = 0;\n            result_type v = 0;\n            bool saved = false;\n            is >> std::ws >> mean;\n            is >> std::ws >> stddev;\n            is >> std::ws >> v;\n            is >> std::ws >> saved;\n\n            if (is.good()) {\n                if (stddev > 0) {\n                    param = param_type(mean, stddev);\n                    param.v_ = v;\n                    param.saved_ = saved;\n                } else {\n                    is.setstate(std::ios_base::failbit);\n                }\n            }\n\n            return is;\n        }\n\n        private:\n        result_type mean_;\n        result_type stddev_;\n        result_type v_;\n        bool saved_;\n\n        friend distribution_type;\n\n        void invariant()\n        {\n            VSMC_RUNTIME_ASSERT_RNG_NORMAL_DISTRIBUTION_PARAM_CHECK(stddev_);\n            saved_ = false;\n        }\n\n        void reset() { saved_ = false; }\n    }; \/\/ class param_type\n\n    explicit NormalDistribution(result_type mean = 0, result_type stddev = 1)\n        : param_(mean, stddev)\n    {\n    }\n\n    explicit NormalDistribution(const param_type &param) : param_(param) {}\n\n    result_type mean() const { return param_.mean_; }\n    result_type stddev() const { return param_.stddev_; }\n\n    result_type min VSMC_MNE() const\n    {\n        return -std::numeric_limits<result_type>::infinity();\n    }\n\n    result_type max VSMC_MNE() const\n    {\n        return std::numeric_limits<result_type>::infinity();\n    }\n\n    template <typename RNGType>\n    result_type operator()(RNGType &rng)\n    {\n        if (param_.saved_) {\n            param_.saved_ = false;\n            return param_.v_;\n        }\n\n        result_type u = 0;\n        result_type v = 0;\n        generate_uv(rng, u, v, std::integral_constant<bool,\n                                   internal::RNGBits<RNGType>::value >= 64>());\n        result_type s = param_.stddev_ * std::sqrt(-2 * std::log(u));\n        v = std::sin(math::pi_2<result_type>() * v);\n        u = std::sqrt(1 - v * v);\n        param_.v_ = param_.mean_ * v * s;\n        param_.saved_ = true;\n\n        return param_.mean_ + u * s;\n    }\n\n    VSMC_DEFINE_RNG_DISTRIBUTION_OPERATORS\n\n    private:\n    param_type param_;\n\n    template <typename RNGType>\n    void generate_uv(\n        RNGType &rng, result_type &u, result_type &v, std::false_type)\n    {\n        U01DistributionType<RNGType, RealType> runif;\n        u = 1 - runif(rng);\n        v = 1 - runif(rng);\n    }\n\n    template <typename RNGType>\n    void generate_uv(\n        RNGType &rng, result_type &u, result_type &v, std::true_type)\n    {\n        std::uint64_t r = static_cast<std::uint64_t>(rng());\n        u = U01<std::uint32_t, RealType, Open, Closed>::eval(r);\n        v = U01<std::uint32_t, RealType, Open, Closed>::eval(r >> 32);\n    }\n}; \/\/ class NormalDistribution\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_RNG_NORMAL_DISTRIBUTION_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: b2dpolypolygoncutter.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: thb $ $Date: 2004-02-16 17:03: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#ifndef _BGFX_POLYGON_B2DPOLYPOLYGONCUTTER_HXX\n#define _BGFX_POLYGON_B2DPOLYPOLYGONCUTTER_HXX\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n\n#ifndef _BGFX_POINT_B2DPOINT_HXX\n#include <basegfx\/point\/b2dpoint.hxx>\n#endif\n\n#ifndef _BGFX_VECTOR_B2DVECTOR_HXX\n#include <basegfx\/vector\/b2dvector.hxx>\n#endif\n\n#ifndef _BGFX_RANGE_B2DRANGE_HXX\n#include <basegfx\/range\/b2drange.hxx>\n#endif\n\n#ifndef _BGFX_POLYGON_B2DPOLYPOLYGON_HXX\n#include <basegfx\/polygon\/b2dpolypolygon.hxx>\n#endif\n\n#include <vector>\n#include <algorithm>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ B2DPolygonNode class\n\/\/\n\/\/ This class is a pure tooling class used to hold a polygon in double linked\n\/\/ list form for faster manipulation. It is used from the polygon clipper.\n\nnamespace basegfx\n{\n    class B2DPolygonNode\n    {\n        ::basegfx::B2DPoint             maPosition;\n        B2DPolygonNode*                         mpPrevious;\n        B2DPolygonNode*                         mpNext;\n\n        B2DPolygonNode*                         mpListPrevious;\n        B2DPolygonNode*                         mpListNext;\n\n    public:\n        B2DPolygonNode(const ::basegfx::B2DPoint& rPosition, B2DPolygonNode* pPrevious);\n        ~B2DPolygonNode();\n\n        B2DPolygonNode* getPrevious() const { return mpPrevious; }\n        B2DPolygonNode* getNext() const { return mpNext; }\n        const ::basegfx::B2DPoint& getPosition() const { return maPosition; }\n\n        void calcMinMaxX(double& fMaxAX, double& fMinAX) const;\n        void calcMinMaxY(double& fMaxAY, double& fMinAY) const;\n\n        void swapPreviousNext() { B2DPolygonNode* pZwi = mpPrevious; mpPrevious = mpNext; mpNext = pZwi; }\n        void swapNextPointers(B2DPolygonNode* pCand);\n\n        void addToList(B2DPolygonNode*& rpList);\n        void remFromList(B2DPolygonNode*& rpList);\n\n        bool getOrientation() const;\n        void swapOrientation();\n        ::basegfx::B2DRange getRange() const;\n\n        \/\/ isInside tests for B2dPoint and other B2DPolygonNode Polygon. On border is not inside as long as\n        \/\/ not true is given in bWithBorder flag.\n        bool isInside(const ::basegfx::B2DPoint& rPnt, bool bWithBorder = false) const;\n        bool isPolygonInside(B2DPolygonNode* pPoly, bool bWithBorder = false) const;\n    };\n\n    \/\/ a type definition to have a vector of pointers to B2DPolygonNodes\n    typedef ::std::vector< B2DPolygonNode* > B2DPolygonNodeVector;\n\n} \/\/ end of namespace basegfx\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ B2DSimpleCut class\n\nnamespace basegfx\n{\n    class B2DSimpleCut\n    {\n        B2DPolygonNode*                         mpLeft;\n        B2DPolygonNode*                         mpRight;\n\n        \/\/ bitfield\n        unsigned                                mbCorrectOrientation : 1;\n        unsigned                                mbOrientation : 1;\n\n    public:\n        B2DSimpleCut(B2DPolygonNode* pL, B2DPolygonNode* pR, bool bCoOr = false, bool bOr = true)\n        :   mpLeft(pL),\n            mpRight(pR),\n            mbCorrectOrientation(bCoOr),\n            mbOrientation(bOr)\n        {\n        }\n\n        void solve();\n        B2DPolygonNode* getLeft() const { return mpLeft; }\n        B2DPolygonNode* getRight() const { return mpRight; }\n\n        bool isSameCut(B2DPolygonNode* pA, B2DPolygonNode* pB) const\n        {\n            return ((pA == mpLeft && pB == mpRight) || (pB == mpLeft && pA == mpRight));\n        }\n    };\n\n    \/\/ a type definition to have a vector of pointers to B2DSimpleCuts\n    typedef ::std::vector< B2DSimpleCut* > B2DSimpleCutVector;\n\n} \/\/ end of namespace basegfx\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ B2DClipExtraPolygonInfo class\n\nnamespace basegfx\n{\n    class B2DClipExtraPolygonInfo\n    {\n        ::basegfx::B2DRange             maRange;\n        sal_Int32                               mnDepth;\n\n        \/\/ bitfield\n        unsigned                                mbOrientation : 1;\n\n    public:\n        B2DClipExtraPolygonInfo() {}\n\n        void init(B2DPolygonNode* pNew);\n        const ::basegfx::B2DRange& getRange() const { return maRange; }\n        bool getOrientation() const { return mbOrientation; }\n\n        sal_Int32 getDepth() const { return mnDepth; }\n        void changeDepth(bool bOrientation);\n    };\n} \/\/ end of namespace basegfx\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ class B2DPolyPolygonCutter\n\nnamespace basegfx\n{\n    class B2DPolyPolygonCutter\n    {\n        \/\/ list of polys\n        B2DPolygonNodeVector                    maPolygonList;\n        B2DPolyPolygon                          maNotClosedPolygons;\n\n        \/\/ help routines\n        bool isSamePos(const ::basegfx::B2DPoint& rPntA, const ::basegfx::B2DPoint& rPntB)\n        {\n            return rPntA.equal(rPntB);\n        }\n\n        B2DSimpleCut* getExistingCut(B2DSimpleCutVector& rTmpCuts, B2DPolygonNode* pA, B2DPolygonNode* pB);\n        B2DPolygonNode* extractNextPolygon(B2DPolygonNode*& rpList);\n        bool isCrossover(B2DPolygonNode* pA, B2DPolygonNode* pB);\n        bool isCrossover(B2DSimpleCut* pEnter, B2DSimpleCut* pLeave);\n\n        bool isNextSamePos(B2DPolygonNode* pA, B2DPolygonNode* pB)\n        {\n            return isSamePos(pA->getNext()->getPosition(), pB->getNext()->getPosition());\n        }\n\n        bool isPrevSamePos(B2DPolygonNode* pA, B2DPolygonNode* pB)\n        {\n            return isSamePos(pA->getPrevious()->getPosition(), pB->getPrevious()->getPosition());\n        }\n\n        void addAllNodes(B2DPolygonNode* pPolygon, B2DPolygonNode*& rpList);\n        B2DPolygonNode* createNewPolygon(const B2DPolygon& rPolygon);\n        void deletePolygon(B2DPolygonNode* pCand);\n        void polysToList(B2DPolygonNode*& rpList);\n        void listToPolys(B2DPolygonNode*& rpList);\n\n        bool doRangesIntersect(const ::basegfx::B2DRange& rRange1, const ::basegfx::B2DRange& rRange2) const\n        {\n            return rRange1.overlaps(rRange2);\n        }\n\n        bool doRangesInclude(const ::basegfx::B2DRange& rRange1, const ::basegfx::B2DRange& rRange2) const\n        {\n            return rRange1.isInside(rRange2);\n        }\n\n        void solveAllCuts(B2DSimpleCutVector& rCuts);\n\n    public:\n        B2DPolyPolygonCutter() {}\n        ~B2DPolyPolygonCutter();\n\n        \/\/ put\/get poly\n        void addPolyPolygon(const B2DPolyPolygon& rPolyPolygon, bool bForceOrientation = false);\n        void getPolyPolygon(B2DPolyPolygon& rPolyPolygon);\n\n        \/\/ transformations\n        void removeSelfIntersections();\n        void removeDoubleIntersections();\n\n        \/\/ remove included\n        void removeIncludedPolygons(bool bUseOr = true);\n    };\n} \/\/ end of namespace basegfx\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#endif \/* _BGFX_POLYGON_B2DPOLYPOLYGONCUTTER_HXX *\/\n<commit_msg>INTEGRATION: CWS aw019 (1.5.36); FILE MERGED 2004\/10\/18 10:39:47 aw 1.5.36.1: #i34831#<commit_after>\/*************************************************************************\n *\n *  $RCSfile: b2dpolypolygoncutter.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: pjunck $ $Date: 2004-11-03 08:34: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#ifndef _BGFX_POLYGON_B2DPOLYPOLYGONCUTTER_HXX\n#define _BGFX_POLYGON_B2DPOLYPOLYGONCUTTER_HXX\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n\n#ifndef _BGFX_POINT_B2DPOINT_HXX\n#include <basegfx\/point\/b2dpoint.hxx>\n#endif\n\n#ifndef _BGFX_RANGE_B2DRANGE_HXX\n#include <basegfx\/range\/b2drange.hxx>\n#endif\n\n#ifndef _BGFX_POLYGON_B2DPOLYPOLYGON_HXX\n#include <basegfx\/polygon\/b2dpolypolygon.hxx>\n#endif\n\n#include <vector>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ class B2DPolyPolygonCutter\n\nnamespace basegfx\n{\n    \/\/ predeclarations\n    class B2DPolygonNode;\n    class B2DSimpleCut;\n\n    \/\/ a type definition to have a vector of pointers to B2DPolygonNodes\n    typedef ::std::vector< B2DPolygonNode* > B2DPolygonNodeVector;\n\n    \/\/ a type definition to have a vector of pointers to B2DSimpleCuts\n    typedef ::std::vector< B2DSimpleCut* > B2DSimpleCutVector;\n\n    class B2DPolyPolygonCutter\n    {\n        \/\/ list of polys\n        B2DPolygonNodeVector                    maPolygonList;\n\n        \/\/ help routines\n        B2DSimpleCut* getExistingCut(B2DSimpleCutVector& rTmpCuts, B2DPolygonNode* pA, B2DPolygonNode* pB);\n        B2DPolygonNode* extractNextPolygon(B2DPolygonNode*& rpList);\n        bool isCrossover(B2DPolygonNode* pA, B2DPolygonNode* pB);\n        bool isCrossover(B2DSimpleCut* pEnter, B2DSimpleCut* pLeave);\n        bool isNextSamePos(B2DPolygonNode* pA, B2DPolygonNode* pB);\n        bool isPrevSamePos(B2DPolygonNode* pA, B2DPolygonNode* pB);\n        void addAllNodes(B2DPolygonNode* pPolygon, B2DPolygonNode*& rpList);\n        B2DPolygonNode* createNewPolygon(const ::basegfx::B2DPolygon& rPolygon);\n        void deletePolygon(B2DPolygonNode* pCand);\n        void polysToList(B2DPolygonNode*& rpList);\n        void listToPolys(B2DPolygonNode*& rpList);\n        void solveAllCuts(B2DSimpleCutVector& rCuts);\n\n    public:\n        B2DPolyPolygonCutter() {}\n        ~B2DPolyPolygonCutter();\n\n        \/\/ put\/get poly\n        void addPolygon(const ::basegfx::B2DPolygon& rPolygon);\n        void addPolyPolygon(const ::basegfx::B2DPolyPolygon& rPolyPolygon);\n        ::basegfx::B2DPolyPolygon getPolyPolygon();\n\n        \/\/ transformations\n        void removeSelfIntersections();\n        void removeDoubleIntersections();\n    };\n} \/\/ end of namespace basegfx\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#endif \/* _BGFX_POLYGON_B2DPOLYPOLYGONCUTTER_HXX *\/\n<|endoftext|>"}
{"text":"<commit_before>\r\n\r\n\/**\r\n * Copyright (c) 2017 blueback\r\n * Released under the MIT License\r\n * https:\/\/github.com\/bluebackblue\/brownie\/blob\/master\/LICENSE\r\n * http:\/\/bbbproject.sakura.ne.jp\/wordpress\/mitlicense\r\n * @brief ＨＴＴＰ。\r\n*\/\r\n\r\n\r\n\/** include\r\n*\/\r\n#include <bsys_pch.h>\r\n\r\n\r\n\/** include\r\n*\/\r\n#include \"..\/types\/types.h\"\r\n\r\n\r\n\/** include\r\n*\/\r\n#include \".\/http.h\"\r\n#include \".\/http_recv.h\"\r\n#include \".\/http_send.h\"\r\n#include \".\/http_bodystring.h\"\r\n#include \".\/http_binaryitem.h\"\r\n\r\n\r\n\/** NBsys::NHttp\r\n*\/\r\n#if(BSYS_HTTP_ENABLE)\r\nnamespace NBsys{namespace NHttp\r\n{\r\n\t\/** constructor\r\n\t*\/\r\n\tHttp::Http()\r\n\t\t:\r\n\t\thost(\"\"),\r\n\t\tport(80),\r\n\t\tmode(Http_Mode::Get),\r\n\t\turl(\"\"),\r\n\t\tboundary_string(NHttp::MakeBoundaryString()),\r\n\t\tstep(Step::None),\r\n\t\tsocket(),\r\n\t\tiserror(false),\r\n\t\tsend_buffer(),\r\n\t\trecv_buffer(),\r\n\t\tsend(),\r\n\t\trecv(),\r\n\t\tbinary_list()\r\n\t{\r\n\t}\r\n\r\n\r\n\t\/** destructor\r\n\t*\/\r\n\tHttp::~Http()\r\n\t{\r\n\t}\r\n\r\n\r\n\t\/** SetHost\r\n\t*\/\r\n\tvoid Http::SetHost(const STLString& a_host)\r\n\t{\r\n\t\tthis->host = a_host;\r\n\t}\r\n\r\n\r\n\t\/** SetPort\r\n\t*\/\r\n\tvoid Http::SetPort(s32 a_port)\r\n\t{\r\n\t\tthis->port = a_port;\r\n\t}\r\n\r\n\r\n\t\/** SetMode\r\n\t*\/\r\n\tvoid Http::SetMode(Http_Mode::Id a_mode)\r\n\t{\r\n\t\tthis->mode = a_mode;\r\n\t}\r\n\r\n\r\n\t\/** SetUrl\r\n\t*\/\r\n\tvoid Http::SetUrl(const STLString& a_url)\r\n\t{\r\n\t\tthis->url = a_url;\r\n\t}\r\n\r\n\r\n\t\/** SetBoundaryString\r\n\t*\/\r\n\tvoid Http::SetBoundaryString(const STLString& a_boundary_string)\r\n\t{\r\n\t\tthis->boundary_string = a_boundary_string;\r\n\t}\r\n\r\n\r\n\t\/** コンテンツ追加。\r\n\t*\/\r\n\tvoid Http::AddPostContent(const STLString& a_name,const STLString& a_filename,sharedptr< u8 >& a_data,s32 a_size)\r\n\t{\r\n\t\t\/\/ヘッダー。\r\n\t\tSTLString t_body_header = NHttp::MakeBodyString_BinaryHeader(this->boundary_string,a_name,a_filename);\r\n\t\t\r\n\t\t\/\/フッター。\r\n\t\tSTLString t_body_footer = NHttp::MakeBodyString_BinarFooter();\r\n\r\n\t\t\/\/バッファ。\r\n\t\ts32 t_buffer_size = a_size + t_body_header.length() + t_body_footer.length();\r\n\t\tsharedptr<Http_BinaryItem> t_binary_item(new Http_BinaryItem());\r\n\t\tt_binary_item->data.reset(new u8[t_buffer_size + 1],default_delete<u8>());\r\n\t\tt_binary_item->data.get()[t_buffer_size] = 0x00;\r\n\t\tu8* t_buffer_data = t_binary_item->data.get();\r\n\t\tt_binary_item->size = t_buffer_size;\r\n\r\n\t\t\/\/コピー。\r\n\t\t{\r\n\t\t\ts32 t_offset = 0;\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_body_header.c_str(),static_cast<s32>(t_body_header.length()));\r\n\t\t\tt_offset += static_cast<s32>(t_body_header.length());\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),a_data.get(),a_size);\r\n\t\t\tt_offset += static_cast<s32>(a_size);\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_body_footer.c_str(),static_cast<s32>(t_body_footer.length()));\r\n\t\t\tt_offset += static_cast<s32>(t_body_footer.length());\r\n\r\n\t\t\tASSERT(t_offset == t_buffer_size);\r\n\t\t}\r\n\r\n\t\tthis->binary_list.insert(STLMap<STLString,sharedptr<Http_BinaryItem>>::value_type(a_name,t_binary_item));\r\n\t}\r\n\r\n\r\n\t\/** コンテンツ追加。\r\n\t*\/\r\n\tvoid Http::AddPostContent(const STLString& a_name,const STLString& a_value)\r\n\t{\r\n\t\t\/\/ヘッダー。\r\n\t\tSTLString t_body_header = NHttp::MakeBodyString_TextHeader(this->boundary_string,a_name);\r\n\t\t\r\n\t\t\/\/フッター。\r\n\t\tSTLString t_body_footer = NHttp::MakeBodyString_TextFooter();\r\n\r\n\t\t\/\/バッファ。\r\n\t\ts32 t_buffer_size = a_value.length() + t_body_header.length() + t_body_footer.length();\r\n\t\tsharedptr<Http_BinaryItem> t_binary_item(new Http_BinaryItem());\r\n\t\tt_binary_item->data.reset(new u8[t_buffer_size + 1],default_delete<u8>());\r\n\t\tt_binary_item->data.get()[t_buffer_size] = 0x00;\r\n\t\tu8* t_buffer_data = t_binary_item->data.get();\r\n\t\tt_binary_item->size = t_buffer_size;\r\n\r\n\t\t\/\/コピー。\r\n\t\t{\r\n\t\t\ts32 t_offset = 0;\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_body_header.c_str(),static_cast<s32>(t_body_header.length()));\r\n\t\t\tt_offset += static_cast<s32>(t_body_header.length());\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),a_value.c_str(),a_value.length());\r\n\t\t\tt_offset += static_cast<s32>(a_value.length());\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_body_footer.c_str(),static_cast<s32>(t_body_footer.length()));\r\n\t\t\tt_offset += static_cast<s32>(t_body_footer.length());\r\n\r\n\t\t\tASSERT(t_offset == t_buffer_size);\r\n\t\t}\r\n\r\n\t\tthis->binary_list.insert(STLMap<STLString,sharedptr<Http_BinaryItem>>::value_type(a_name,t_binary_item));\r\n\t}\r\n\r\n\r\n\t\/** IsRecvHeader\r\n\t*\/\r\n\tbool Http::IsRecvHeader()\r\n\t{\r\n\t\tif(this->recv){\r\n\t\t\treturn this->recv->IsRecvHeader();\r\n\t\t}\r\n\r\n\t\treturn false;\r\n\t}\r\n\r\n\r\n\t\/** IsRecvHeader\r\n\t*\/\r\n\ts32 Http::GetStatusCode()\r\n\t{\r\n\t\tif(this->recv){\r\n\t\t\treturn this->recv->GetStatusCode();\r\n\t\t}\r\n\r\n\t\treturn -1;\r\n\t}\r\n\r\n\r\n\t\/** GetContentLength\r\n\t*\/\r\n\ts32 Http::GetContentLength()\r\n\t{\r\n\t\tif(this->recv){\r\n\t\t\treturn this->recv->GetContentLength();\r\n\t\t}\r\n\r\n\t\treturn -1;\r\n\t}\r\n\r\n\r\n\t\/** 開始。\r\n\t*\/\r\n\tvoid Http::ConnectStart(sharedptr<RingBufferBase<u8>>& a_recv_buffer)\r\n\t{\r\n\t\tthis->recv_buffer = a_recv_buffer;\r\n\t\tthis->step = Step::Start;\r\n\t\tthis->iserror = false;\r\n\r\n\t\t\/\/ソケット作成。\r\n\t\tthis->socket.reset(new SocketHandle());\r\n\r\n\t\t\/\/受信設定。\r\n\t\tthis->recv.reset(new Http_Recv(this->socket,this->recv_buffer));\r\n\t\r\n\t\t\/\/送信設定。\r\n\t\tthis->send.reset(new Http_Send());\r\n\t}\r\n\r\n\r\n\t\/** 終了。\r\n\t*\/\r\n\tvoid Http::ConnectEnd()\r\n\t{\r\n\t\tthis->step = Step::None;\r\n\t\tthis->socket.reset();\r\n\t\tthis->iserror = false;\r\n\t\tthis->send_buffer.reset();\r\n\t\tthis->recv_buffer.reset();\r\n\t\tthis->send.reset();\r\n\t\tthis->recv.reset();\r\n\t}\r\n\r\n\r\n\t\/** 更新。\r\n\t*\/\r\n\tbool Http::ConnectUpdate()\r\n\t{\r\n\t\tif(this->iserror == true){\r\n\t\t\t\/\/中断。\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tbool t_loop = true;\r\n\t\twhile(t_loop){\r\n\t\t\tt_loop = false;\r\n\r\n\t\t\tif(this->send){\r\n\t\t\t\tif(this->send->Update() == true){\r\n\t\t\t\t\t\/\/ループリクエスト。\r\n\t\t\t\t\tt_loop = true;\r\n\t\t\t\t}\r\n\t\t\t\tthis->iserror = this->send->IsError();\r\n\t\t\t}\r\n\t\t\tif(this->recv){\r\n\t\t\t\tif(this->recv->Update() == true){\r\n\t\t\t\t\t\/\/ループリクエスト。\r\n\t\t\t\t\tt_loop = true;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tswitch(this->step){\r\n\t\t\tcase Step::Start:\r\n\t\t\t\t{\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\ts32 t_binary_size = 0;\r\n\r\n\t\t\t\t\t\t\/\/バイナリ総サイズ。\r\n\t\t\t\t\t\tif(this->mode == Http_Mode::Post){\r\n\t\t\t\t\t\t\tfor(STLMap<STLString,sharedptr<Http_BinaryItem>>::iterator t_it = this->binary_list.begin();t_it!=this->binary_list.end();t_it++){\r\n\t\t\t\t\t\t\t\tif(t_it->second != nullptr){\r\n\t\t\t\t\t\t\t\t\tt_binary_size += t_it->second->size;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\/\/バイナリ終端文字列。\r\n\t\t\t\t\t\tSTLString t_binary_footer = \"\";\r\n\t\t\t\t\t\tif(this->mode == Http_Mode::Post){\r\n\t\t\t\t\t\t\tNHttp::MakeBodyString_PostBinarFooter(this->boundary_string);\r\n\t\t\t\t\t\t\tt_binary_size += static_cast<s32>(t_binary_footer.length());\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\/\/ボディ作成。\t\t\t\t\r\n\t\t\t\t\t\tSTLString t_send_body = NHttp::MakeBodyString_Header(this->boundary_string,this->mode,this->url,this->host,t_binary_size);\r\n\r\n\t\t\t\t\t\t\/\/バッファ。\r\n\t\t\t\t\t\ts32 t_buffer_size = t_send_body.length() + t_binary_size;\r\n\t\t\t\t\t\tthis->send_buffer.reset(new u8[t_buffer_size + 1],default_delete<u8>());\r\n\t\t\t\t\t\tthis->send_buffer.get()[t_buffer_size] = 0x00;\r\n\t\t\t\t\t\tu8* t_buffer_data = this->send_buffer.get();\r\n\r\n\t\t\t\t\t\t\/\/送信バッファの作成。\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\ts32 t_offset = 0;\r\n\r\n\t\t\t\t\t\t\t\/\/ボディー。\r\n\t\t\t\t\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_send_body.c_str(),static_cast<s32>(t_send_body.length()));\r\n\t\t\t\t\t\t\tt_offset += static_cast<s32>(t_send_body.length());\r\n\r\n\t\t\t\t\t\t\tif(this->mode == Http_Mode::Post){\r\n\r\n\t\t\t\t\t\t\t\t\/\/バイナリ。\r\n\t\t\t\t\t\t\t\tfor(STLMap<STLString,sharedptr<Http_BinaryItem>>::iterator t_it = this->binary_list.begin();t_it!=this->binary_list.end();t_it++){\r\n\t\t\t\t\t\t\t\t\tif(t_it->second != nullptr){\r\n\t\t\t\t\t\t\t\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_it->second->data.get(),t_it->second->size);\r\n\t\t\t\t\t\t\t\t\t\tt_offset += t_it->second->size;\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\/\/バイナリ終端。\r\n\t\t\t\t\t\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_binary_footer.c_str(),static_cast<s32>(t_binary_footer.length()));\r\n\t\t\t\t\t\t\t\tt_offset += static_cast<s32>(t_binary_footer.length());\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tASSERT(t_offset == t_buffer_size);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\/\/送信バッファ設定。\r\n\t\t\t\t\t\tthis->send->Send(this->socket,this->send_buffer,t_buffer_size);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tthis->step = Step::Connect;\r\n\r\n\t\t\t\t\tt_loop = true;\r\n\t\t\t\t}break;\r\n\t\t\tcase Step::Connect:\r\n\t\t\t\t{\r\n\t\t\t\t\t\/\/接続。\r\n\r\n\t\t\t\t\tif(this->socket->OpenTcp()){\r\n\t\t\t\t\t\tif(this->socket->ConnectTcp(this->host.c_str(),this->port) == true){\r\n\t\t\t\t\t\t\tthis->step = Step::SendWait_StartData;\r\n\t\t\t\t\t\t\tt_loop = true;\r\n\t\t\t\t\t\t}else{\r\n\t\t\t\t\t\t\t\/\/エラー。\r\n\t\t\t\t\t\t\tthis->iserror = true;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}else{\r\n\t\t\t\t\t\t\/\/エラー。\r\n\t\t\t\t\t\tthis->iserror = true;\r\n\t\t\t\t\t}\r\n\t\t\t\t}break;\r\n\t\t\tcase Step::SendWait_StartData:\r\n\t\t\t\t{\r\n\t\t\t\t\tif(this->send->IsBusy() == false){\r\n\t\t\t\t\t\t\/\/受信開始。\r\n\t\t\t\t\t\tthis->recv->StartRecv();\r\n\t\t\t\t\t\tthis->step = Step::RecvHeader;\r\n\t\t\t\t\t}\r\n\t\t\t\t}break;\r\n\t\t\tcase Step::RecvHeader:\r\n\t\t\t\t{\r\n\t\t\t\t\t\/\/ヘッダー受信完了チェック。\r\n\t\t\t\t\tif(this->recv->IsRecvHeader()){\r\n\t\t\t\t\t\tthis->step = Step::Recv;\r\n\t\t\t\t\t}\r\n\t\t\t\t}break;\r\n\t\t\tcase Step::Recv:\r\n\t\t\t\t{\r\n\t\t\t\t\tbool t_close = false;\r\n\t\t\t\t\tif(this->recv->IsCopyContent()){\r\n\t\t\t\t\t\t\/\/コンテンツの外部バッファへのコピー完了。\r\n\t\t\t\t\t\tt_close = true;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif(this->socket){\r\n\t\t\t\t\t\tif(this->socket->IsOpen() == false){\r\n\t\t\t\t\t\t\tt_close =  true;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}else{\r\n\t\t\t\t\t\tt_close = true;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif(t_close == true){\r\n\t\t\t\t\t\tif(this->socket){\r\n\t\t\t\t\t\t\tif(this->socket->IsOpen()){\r\n\t\t\t\t\t\t\t\tthis->socket->Close();\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\/\/正常終了 or 中断終了。\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}break;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/継続。\r\n\t\treturn true;\r\n\t}\r\n\r\n\r\n}}\r\n#endif\r\n\r\n<commit_msg>bug fix<commit_after>\r\n\r\n\/**\r\n * Copyright (c) 2017 blueback\r\n * Released under the MIT License\r\n * https:\/\/github.com\/bluebackblue\/brownie\/blob\/master\/LICENSE\r\n * http:\/\/bbbproject.sakura.ne.jp\/wordpress\/mitlicense\r\n * @brief ＨＴＴＰ。\r\n*\/\r\n\r\n\r\n\/** include\r\n*\/\r\n#include <bsys_pch.h>\r\n\r\n\r\n\/** include\r\n*\/\r\n#include \"..\/types\/types.h\"\r\n\r\n\r\n\/** include\r\n*\/\r\n#include \".\/http.h\"\r\n#include \".\/http_recv.h\"\r\n#include \".\/http_send.h\"\r\n#include \".\/http_bodystring.h\"\r\n#include \".\/http_binaryitem.h\"\r\n\r\n\r\n\/** NBsys::NHttp\r\n*\/\r\n#if(BSYS_HTTP_ENABLE)\r\nnamespace NBsys{namespace NHttp\r\n{\r\n\t\/** constructor\r\n\t*\/\r\n\tHttp::Http()\r\n\t\t:\r\n\t\thost(\"\"),\r\n\t\tport(80),\r\n\t\tmode(Http_Mode::Get),\r\n\t\turl(\"\"),\r\n\t\tboundary_string(NHttp::MakeBoundaryString()),\r\n\t\tstep(Step::None),\r\n\t\tsocket(),\r\n\t\tiserror(false),\r\n\t\tsend_buffer(),\r\n\t\trecv_buffer(),\r\n\t\tsend(),\r\n\t\trecv(),\r\n\t\tbinary_list()\r\n\t{\r\n\t}\r\n\r\n\r\n\t\/** destructor\r\n\t*\/\r\n\tHttp::~Http()\r\n\t{\r\n\t}\r\n\r\n\r\n\t\/** SetHost\r\n\t*\/\r\n\tvoid Http::SetHost(const STLString& a_host)\r\n\t{\r\n\t\tthis->host = a_host;\r\n\t}\r\n\r\n\r\n\t\/** SetPort\r\n\t*\/\r\n\tvoid Http::SetPort(s32 a_port)\r\n\t{\r\n\t\tthis->port = a_port;\r\n\t}\r\n\r\n\r\n\t\/** SetMode\r\n\t*\/\r\n\tvoid Http::SetMode(Http_Mode::Id a_mode)\r\n\t{\r\n\t\tthis->mode = a_mode;\r\n\t}\r\n\r\n\r\n\t\/** SetUrl\r\n\t*\/\r\n\tvoid Http::SetUrl(const STLString& a_url)\r\n\t{\r\n\t\tthis->url = a_url;\r\n\t}\r\n\r\n\r\n\t\/** SetBoundaryString\r\n\t*\/\r\n\tvoid Http::SetBoundaryString(const STLString& a_boundary_string)\r\n\t{\r\n\t\tthis->boundary_string = a_boundary_string;\r\n\t}\r\n\r\n\r\n\t\/** コンテンツ追加。\r\n\t*\/\r\n\tvoid Http::AddPostContent(const STLString& a_name,const STLString& a_filename,sharedptr< u8 >& a_data,s32 a_size)\r\n\t{\r\n\t\t\/\/ヘッダー。\r\n\t\tSTLString t_body_header = NHttp::MakeBodyString_BinaryHeader(this->boundary_string,a_name,a_filename);\r\n\t\t\r\n\t\t\/\/フッター。\r\n\t\tSTLString t_body_footer = NHttp::MakeBodyString_BinarFooter();\r\n\r\n\t\t\/\/バッファ。\r\n\t\ts32 t_buffer_size = static_cast<s32>(a_size + t_body_header.length() + t_body_footer.length());\r\n\t\tsharedptr<Http_BinaryItem> t_binary_item(new Http_BinaryItem());\r\n\t\tt_binary_item->data.reset(new u8[t_buffer_size + 1],default_delete<u8>());\r\n\t\tt_binary_item->data.get()[t_buffer_size] = 0x00;\r\n\t\tu8* t_buffer_data = t_binary_item->data.get();\r\n\t\tt_binary_item->size = t_buffer_size;\r\n\r\n\t\t\/\/コピー。\r\n\t\t{\r\n\t\t\ts32 t_offset = 0;\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_body_header.c_str(),static_cast<s32>(t_body_header.length()));\r\n\t\t\tt_offset += static_cast<s32>(t_body_header.length());\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),a_data.get(),a_size);\r\n\t\t\tt_offset += static_cast<s32>(a_size);\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_body_footer.c_str(),static_cast<s32>(t_body_footer.length()));\r\n\t\t\tt_offset += static_cast<s32>(t_body_footer.length());\r\n\r\n\t\t\tASSERT(t_offset == t_buffer_size);\r\n\t\t}\r\n\r\n\t\tthis->binary_list.insert(STLMap<STLString,sharedptr<Http_BinaryItem>>::value_type(a_name,t_binary_item));\r\n\t}\r\n\r\n\r\n\t\/** コンテンツ追加。\r\n\t*\/\r\n\tvoid Http::AddPostContent(const STLString& a_name,const STLString& a_value)\r\n\t{\r\n\t\t\/\/ヘッダー。\r\n\t\tSTLString t_body_header = NHttp::MakeBodyString_TextHeader(this->boundary_string,a_name);\r\n\t\t\r\n\t\t\/\/フッター。\r\n\t\tSTLString t_body_footer = NHttp::MakeBodyString_TextFooter();\r\n\r\n\t\t\/\/バッファ。\r\n\t\ts32 t_buffer_size = static_cast<s32>(a_value.length() + t_body_header.length() + t_body_footer.length());\r\n\t\tsharedptr<Http_BinaryItem> t_binary_item(new Http_BinaryItem());\r\n\t\tt_binary_item->data.reset(new u8[t_buffer_size + 1],default_delete<u8>());\r\n\t\tt_binary_item->data.get()[t_buffer_size] = 0x00;\r\n\t\tu8* t_buffer_data = t_binary_item->data.get();\r\n\t\tt_binary_item->size = t_buffer_size;\r\n\r\n\t\t\/\/コピー。\r\n\t\t{\r\n\t\t\ts32 t_offset = 0;\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_body_header.c_str(),static_cast<s32>(t_body_header.length()));\r\n\t\t\tt_offset += static_cast<s32>(t_body_header.length());\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),a_value.c_str(),static_cast<s32>(a_value.length()));\r\n\t\t\tt_offset += static_cast<s32>(a_value.length());\r\n\r\n\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_body_footer.c_str(),static_cast<s32>(t_body_footer.length()));\r\n\t\t\tt_offset += static_cast<s32>(t_body_footer.length());\r\n\r\n\t\t\tASSERT(t_offset == t_buffer_size);\r\n\t\t}\r\n\r\n\t\tthis->binary_list.insert(STLMap<STLString,sharedptr<Http_BinaryItem>>::value_type(a_name,t_binary_item));\r\n\t}\r\n\r\n\r\n\t\/** IsRecvHeader\r\n\t*\/\r\n\tbool Http::IsRecvHeader()\r\n\t{\r\n\t\tif(this->recv){\r\n\t\t\treturn this->recv->IsRecvHeader();\r\n\t\t}\r\n\r\n\t\treturn false;\r\n\t}\r\n\r\n\r\n\t\/** IsRecvHeader\r\n\t*\/\r\n\ts32 Http::GetStatusCode()\r\n\t{\r\n\t\tif(this->recv){\r\n\t\t\treturn this->recv->GetStatusCode();\r\n\t\t}\r\n\r\n\t\treturn -1;\r\n\t}\r\n\r\n\r\n\t\/** GetContentLength\r\n\t*\/\r\n\ts32 Http::GetContentLength()\r\n\t{\r\n\t\tif(this->recv){\r\n\t\t\treturn this->recv->GetContentLength();\r\n\t\t}\r\n\r\n\t\treturn -1;\r\n\t}\r\n\r\n\r\n\t\/** 開始。\r\n\t*\/\r\n\tvoid Http::ConnectStart(sharedptr<RingBufferBase<u8>>& a_recv_buffer)\r\n\t{\r\n\t\tthis->recv_buffer = a_recv_buffer;\r\n\t\tthis->step = Step::Start;\r\n\t\tthis->iserror = false;\r\n\r\n\t\t\/\/ソケット作成。\r\n\t\tthis->socket.reset(new SocketHandle());\r\n\r\n\t\t\/\/受信設定。\r\n\t\tthis->recv.reset(new Http_Recv(this->socket,this->recv_buffer));\r\n\t\r\n\t\t\/\/送信設定。\r\n\t\tthis->send.reset(new Http_Send());\r\n\t}\r\n\r\n\r\n\t\/** 終了。\r\n\t*\/\r\n\tvoid Http::ConnectEnd()\r\n\t{\r\n\t\tthis->step = Step::None;\r\n\t\tthis->socket.reset();\r\n\t\tthis->iserror = false;\r\n\t\tthis->send_buffer.reset();\r\n\t\tthis->recv_buffer.reset();\r\n\t\tthis->send.reset();\r\n\t\tthis->recv.reset();\r\n\t}\r\n\r\n\r\n\t\/** 更新。\r\n\t*\/\r\n\tbool Http::ConnectUpdate()\r\n\t{\r\n\t\tif(this->iserror == true){\r\n\t\t\t\/\/中断。\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tbool t_loop = true;\r\n\t\twhile(t_loop){\r\n\t\t\tt_loop = false;\r\n\r\n\t\t\tif(this->send){\r\n\t\t\t\tif(this->send->Update() == true){\r\n\t\t\t\t\t\/\/ループリクエスト。\r\n\t\t\t\t\tt_loop = true;\r\n\t\t\t\t}\r\n\t\t\t\tthis->iserror = this->send->IsError();\r\n\t\t\t}\r\n\t\t\tif(this->recv){\r\n\t\t\t\tif(this->recv->Update() == true){\r\n\t\t\t\t\t\/\/ループリクエスト。\r\n\t\t\t\t\tt_loop = true;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tswitch(this->step){\r\n\t\t\tcase Step::Start:\r\n\t\t\t\t{\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\ts32 t_binary_size = 0;\r\n\r\n\t\t\t\t\t\t\/\/バイナリ総サイズ。\r\n\t\t\t\t\t\tif(this->mode == Http_Mode::Post){\r\n\t\t\t\t\t\t\tfor(STLMap<STLString,sharedptr<Http_BinaryItem>>::iterator t_it = this->binary_list.begin();t_it!=this->binary_list.end();t_it++){\r\n\t\t\t\t\t\t\t\tif(t_it->second != nullptr){\r\n\t\t\t\t\t\t\t\t\tt_binary_size += t_it->second->size;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\/\/バイナリ終端文字列。\r\n\t\t\t\t\t\tSTLString t_binary_footer = \"\";\r\n\t\t\t\t\t\tif(this->mode == Http_Mode::Post){\r\n\t\t\t\t\t\t\tNHttp::MakeBodyString_PostBinarFooter(this->boundary_string);\r\n\t\t\t\t\t\t\tt_binary_size += static_cast<s32>(t_binary_footer.length());\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\/\/ボディ作成。\t\t\t\t\r\n\t\t\t\t\t\tSTLString t_send_body = NHttp::MakeBodyString_Header(this->boundary_string,this->mode,this->url,this->host,t_binary_size);\r\n\r\n\t\t\t\t\t\t\/\/バッファ。\r\n\t\t\t\t\t\ts32 t_buffer_size = static_cast<s32>(t_send_body.length() + t_binary_size);\r\n\t\t\t\t\t\tthis->send_buffer.reset(new u8[t_buffer_size + 1],default_delete<u8>());\r\n\t\t\t\t\t\tthis->send_buffer.get()[t_buffer_size] = 0x00;\r\n\t\t\t\t\t\tu8* t_buffer_data = this->send_buffer.get();\r\n\r\n\t\t\t\t\t\t\/\/送信バッファの作成。\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\ts32 t_offset = 0;\r\n\r\n\t\t\t\t\t\t\t\/\/ボディー。\r\n\t\t\t\t\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_send_body.c_str(),static_cast<s32>(t_send_body.length()));\r\n\t\t\t\t\t\t\tt_offset += static_cast<s32>(t_send_body.length());\r\n\r\n\t\t\t\t\t\t\tif(this->mode == Http_Mode::Post){\r\n\r\n\t\t\t\t\t\t\t\t\/\/バイナリ。\r\n\t\t\t\t\t\t\t\tfor(STLMap<STLString,sharedptr<Http_BinaryItem>>::iterator t_it = this->binary_list.begin();t_it!=this->binary_list.end();t_it++){\r\n\t\t\t\t\t\t\t\t\tif(t_it->second != nullptr){\r\n\t\t\t\t\t\t\t\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_it->second->data.get(),t_it->second->size);\r\n\t\t\t\t\t\t\t\t\t\tt_offset += t_it->second->size;\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\/\/バイナリ終端。\r\n\t\t\t\t\t\t\t\tMemory::Copy(&t_buffer_data[t_offset],(t_buffer_size - t_offset),t_binary_footer.c_str(),static_cast<s32>(t_binary_footer.length()));\r\n\t\t\t\t\t\t\t\tt_offset += static_cast<s32>(t_binary_footer.length());\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tASSERT(t_offset == t_buffer_size);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\/\/送信バッファ設定。\r\n\t\t\t\t\t\tthis->send->Send(this->socket,this->send_buffer,t_buffer_size);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tthis->step = Step::Connect;\r\n\r\n\t\t\t\t\tt_loop = true;\r\n\t\t\t\t}break;\r\n\t\t\tcase Step::Connect:\r\n\t\t\t\t{\r\n\t\t\t\t\t\/\/接続。\r\n\r\n\t\t\t\t\tif(this->socket->OpenTcp()){\r\n\t\t\t\t\t\tif(this->socket->ConnectTcp(this->host.c_str(),this->port) == true){\r\n\t\t\t\t\t\t\tthis->step = Step::SendWait_StartData;\r\n\t\t\t\t\t\t\tt_loop = true;\r\n\t\t\t\t\t\t}else{\r\n\t\t\t\t\t\t\t\/\/エラー。\r\n\t\t\t\t\t\t\tthis->iserror = true;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}else{\r\n\t\t\t\t\t\t\/\/エラー。\r\n\t\t\t\t\t\tthis->iserror = true;\r\n\t\t\t\t\t}\r\n\t\t\t\t}break;\r\n\t\t\tcase Step::SendWait_StartData:\r\n\t\t\t\t{\r\n\t\t\t\t\tif(this->send->IsBusy() == false){\r\n\t\t\t\t\t\t\/\/受信開始。\r\n\t\t\t\t\t\tthis->recv->StartRecv();\r\n\t\t\t\t\t\tthis->step = Step::RecvHeader;\r\n\t\t\t\t\t}\r\n\t\t\t\t}break;\r\n\t\t\tcase Step::RecvHeader:\r\n\t\t\t\t{\r\n\t\t\t\t\t\/\/ヘッダー受信完了チェック。\r\n\t\t\t\t\tif(this->recv->IsRecvHeader()){\r\n\t\t\t\t\t\tthis->step = Step::Recv;\r\n\t\t\t\t\t}\r\n\t\t\t\t}break;\r\n\t\t\tcase Step::Recv:\r\n\t\t\t\t{\r\n\t\t\t\t\tbool t_close = false;\r\n\t\t\t\t\tif(this->recv->IsCopyContent()){\r\n\t\t\t\t\t\t\/\/コンテンツの外部バッファへのコピー完了。\r\n\t\t\t\t\t\tt_close = true;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif(this->socket){\r\n\t\t\t\t\t\tif(this->socket->IsOpen() == false){\r\n\t\t\t\t\t\t\tt_close =  true;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}else{\r\n\t\t\t\t\t\tt_close = true;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif(t_close == true){\r\n\t\t\t\t\t\tif(this->socket){\r\n\t\t\t\t\t\t\tif(this->socket->IsOpen()){\r\n\t\t\t\t\t\t\t\tthis->socket->Close();\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\/\/正常終了 or 中断終了。\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}break;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/継続。\r\n\t\treturn true;\r\n\t}\r\n\r\n\r\n}}\r\n#endif\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/roostats:$Id:  cranmer $\n\/\/ Author: Kyle Cranmer, Akira Shibata\n\/*************************************************************************\n * Copyright (C) 1995-2008, 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\/*\nBEGIN_HTML\n<p>\nThis is a package that creates a RooFit probability density function from ROOT histograms \nof expected distributions and histograms that represent the +\/- 1 sigma variations \nfrom systematic effects. The resulting probability density function can then be used\nwith any of the statistical tools provided within RooStats, such as the profile \nlikelihood ratio, Feldman-Cousins, etc.  In this version, the model is directly\nfed to a likelihodo ratio test, but it needs to be further factorized.<\/p>\n\n<p>\nThe user needs to provide histograms (in picobarns per bin) and configure the job\nwith XML.  The configuration XML is defined in the file config\/Config.dtd, but essentially\nit is organized as follows (see config\/Combination.xml and config\/ee.xml for examples)<\/p>\n\n<ul>\n<li> - a top level 'Combination' that is composed of:<\/li>\n<ul>\n <li>- several 'Channels' (eg. ee, emu, mumu), which are composed of:<\/li>\n <ul>\n  <li>- several 'Samples' (eg. signal, bkg1, bkg2, ...), each of which has:<\/li>\n  <ul>\n   <li> - a name<\/li>\n   <li> - if the sample is normalized by theory (eg N = L*sigma) or not (eg. data driven)<\/li>\n   <li> - a nominal expectation histogram<\/li>\n   <li> - a named 'Normalization Factor' (which can be fixed or allowed to float in a fit)<\/li>\n   <li> - several 'Overall Systematics' in normalization with:<\/li>\n   <ul>\n    <li> - a name<\/li>\n    <li> - +\/- 1 sigma variations (eg. 1.05 and 0.95 for a 5% uncertainty)<\/li>\n   <\/ul>\n   <li>- several 'Histogram Systematics' in shape with:<\/li>\n   <ul>\n    <li>- a name (which can be shared with the OverallSyst if correlated)<\/li>\n    <li>- +\/- 1 sigma variational histograms<\/li>\n   <\/ul>\n  <\/ul>\n <\/ul>\n <li>- several 'Measurements' (corresponding to a full fit of the model) each of which specifies<\/li>\n <ul>\n  <li>- a name for this fit to be used in tables and files<\/li>\n  <ul>\n   <li>      - what is the luminosity associated to the measurement in picobarns<\/li>\n   <li>      - which bins of the histogram should be used<\/li>\n   <li>      - what is the relative uncertainty on the luminosity <\/li>\n   <li>      - what is (are) the parameter(s) of interest that will be measured<\/li>\n   <li>      - which parameters should be fixed\/floating (eg. nuisance parameters)<\/li>\n  <\/ul>\n <\/ul>\n<\/ul>\nEND_HTML\n*\/\n\/\/\n\n\n\/\/ from std\n#include <string>\n#include <vector>\n#include <map>\n#include <iostream>\n#include <sstream>\n\n\/\/ from root\n#include \"TFile.h\"\n#include \"TH1F.h\"\n#include \"TDOMParser.h\"\n#include \"TXMLAttr.h\"\n#include \"TString.h\"\n\n\/\/ from roofit\n#include \"RooStats\/ModelConfig.h\"\n\n\/\/ from this package\n#include \"Helper.h\"\n#include \"ConfigParser.h\"\n#include \"RooStats\/HistFactory\/EstimateSummary.h\"\n#include \"RooStats\/HistFactory\/HistoToWorkspaceFactory.h\"\n\n\nusing namespace RooFit;\nusing namespace RooStats;\nusing namespace HistFactory;\n\nvoid topDriver(string input);\nvoid fastDriver(string input); \/\/ in MakeModelAndMeasurementsFast\n\n\/\/_____________________________batch only_____________________\n#ifndef __CINT__\n\nint main(int argc, char** argv) {\n\n  if(! (argc>1)) {\n    cerr << \"need input file\" << endl;\n    exit(1);\n  }\n\n  if(argc==2){\n    string input(argv[1]);\n    try {\n      fastDriver(input);\n    }\n    catch (std::string str) {\n      cerr << \"caught exception: \" << str << endl ;\n    }\n  }\n\n  if(argc==3){\n    string flag(argv[1]);\n    string input(argv[2]);\n    if(flag==\"-standard_form\")\n      try {\n\tfastDriver(input);\n      }\n      catch (std::string str) {\n\tcerr << \"caught exception: \" << str << endl ;\n      }\n    else if(flag==\"-number_counting_form\")\n      topDriver(input);\n    else\n      cerr <<\"unrecognized flag.  Options are -standard_form or -number_counting_form\"<<endl;\n\n  }\n  return 0;\n}\n\n#endif\n\nvoid topDriver(string input ){\n\n  \/\/ TO DO:\n  \/\/ would like to fully factorize the XML parsing.  \n  \/\/ No clear need to have some here and some in ConfigParser\n\n  \/*** read in the input xml ***\/\n  TDOMParser xmlparser;\n  Int_t parseError = xmlparser.ParseFile( input.c_str() );\n  if( parseError ) { \n    std::cerr << \"Loading of xml document \\\"\" << input\n          << \"\\\" failed\" << std::endl;\n  } \n\n  cout << \"reading input : \" << input << endl;\n  TXMLDocument* xmldoc = xmlparser.GetXMLDocument();\n  TXMLNode* rootNode = xmldoc->GetRootNode();\n\n  if( rootNode->GetNodeName() == TString( \"Combination\" ) ){\n    string outputFileName, outputFileNamePrefix;\n    vector<string> xml_input;\n\n    TListIter attribIt = rootNode->GetAttributes();\n    TXMLAttr* curAttr = 0;\n    while( ( curAttr = dynamic_cast< TXMLAttr* >( attribIt() ) ) != 0 ) {\n      if( curAttr->GetName() == TString( \"OutputFilePrefix\" ) ) {\n        outputFileNamePrefix=string(curAttr->GetValue());\n        cout << \"output file is : \" << outputFileName << endl;\n      }\n    } \n    TXMLNode* node = rootNode->GetChildren();\n    while( node != 0 ) {\n      if( node->GetNodeName() == TString( \"Input\" ) ) {\n        xml_input.push_back(node->GetText());\n      }\n      node = node->GetNextNode();\n    }\n    node = rootNode->GetChildren();\n    while( node != 0 ) {\n      if( node->GetNodeName() == TString( \"Measurement\" ) ) {\n\n        Double_t nominalLumi=0, lumiRelError=0, lumiError=0;\n        Int_t lowBin=0, highBin=0;\n        string rowTitle, POI, mode;\n        vector<string> systToFix;\n        map<string,double> gammaSyst;\n        map<string,double> uniformSyst;\n        map<string,double> logNormSyst;\n\tbool exportOnly = false;\n\n\t\/\/        TListIter attribIt = node->GetAttributes();\n\t\/\/        TXMLAttr* curAttr = 0;\n        attribIt = node->GetAttributes();\n        curAttr = 0;\n        while( ( curAttr = dynamic_cast< TXMLAttr* >( attribIt() ) ) != 0 ) {\n          if( curAttr->GetName() == TString( \"Lumi\" ) ) {\n            nominalLumi=atof(curAttr->GetValue());\n          }\n          if( curAttr->GetName() == TString( \"LumiRelErr\" ) ) {\n            lumiRelError=atof(curAttr->GetValue());\n          }\n          if( curAttr->GetName() == TString( \"BinLow\" ) ) {\n            lowBin=atoi(curAttr->GetValue());\n          }\n          if( curAttr->GetName() == TString( \"BinHigh\" ) ) {\n            highBin=atoi(curAttr->GetValue());\n          }\n          if( curAttr->GetName() == TString( \"Name\" ) ) {\n            rowTitle=curAttr->GetValue();\n            outputFileName=outputFileNamePrefix+\"_\"+rowTitle+\".root\";\n          }\n          if( curAttr->GetName() == TString( \"Mode\" ) ) {\n            mode=curAttr->GetValue();\n          }\n          if( curAttr->GetName() == TString( \"ExportOnly\" ) ) {\n            if(curAttr->GetValue() == TString( \"True\" ) )\n\t      exportOnly = true;\n\t    else\n\t      exportOnly = false;\n          }\n        }\n        lumiError=nominalLumi*lumiRelError;\n\n        TXMLNode* mnode = node->GetChildren();\n        while( mnode != 0 ) {\n          if( mnode->GetNodeName() == TString( \"POI\" ) ) {\n            POI=mnode->GetText();\n          }\n          if( mnode->GetNodeName() == TString( \"ParamSetting\" ) ) {\n\t    \/\/            TListIter attribIt = mnode->GetAttributes();\n            \/\/TXMLAttr* curAttr = 0;\n\t    attribIt = mnode->GetAttributes();\n\t    curAttr = 0;\n            while( ( curAttr = dynamic_cast< TXMLAttr* >( attribIt() ) ) != 0 ) {\n              if( curAttr->GetName() == TString( \"Const\" ) ) {\n                if(curAttr->GetValue()==TString(\"True\")){\n                  AddSubStrings(systToFix, mnode->GetText());\n                }\n              }\n            }\n          }\n          if( mnode->GetNodeName() == TString( \"ConstraintTerm\" ) ) {\n            vector<string> syst; string type = \"\"; double rel = 0;\n            AddSubStrings(syst,mnode->GetText());\n\t    \/\/            TListIter attribIt = mnode->GetAttributes();\n\t    \/\/            TXMLAttr* curAttr = 0;\n\t    attribIt = mnode->GetAttributes();\n            curAttr = 0;\n            while( ( curAttr = dynamic_cast< TXMLAttr* >( attribIt() ) ) != 0 ) {\n              if( curAttr->GetName() == TString( \"Type\" ) ) {\n                type = curAttr->GetValue();\n              }\n              if( curAttr->GetName() == TString( \"RelativeUncertainty\" ) ) {\n                rel = atof(curAttr->GetValue());\n              }\n            }\n            if (type==\"Gamma\" && rel!=0) {\n              for (vector<string>::const_iterator it=syst.begin(); it!=syst.end(); it++) gammaSyst[(*it).c_str()] = rel;\n            }\n            if (type==\"Uniform\" && rel!=0) {\n              for (vector<string>::const_iterator it=syst.begin(); it!=syst.end(); it++) uniformSyst[(*it).c_str()] = rel;\n            }\n            if (type==\"LogNormal\" && rel!=0) {\n              for (vector<string>::const_iterator it=syst.begin(); it!=syst.end(); it++) logNormSyst[(*it).c_str()] = rel;\n            }\n          }\n          mnode = mnode->GetNextNode();\n        }\n\n        \/* Do measurement *\/\n        cout << \"using lumi = \" << nominalLumi << \" and lumiError = \" << lumiError\n             << \" including bins between \" << lowBin << \" and \" << highBin << endl;\n        cout << \"fixing the following parameters:\"  << endl;\n        for(vector<string>::iterator itr=systToFix.begin(); itr!=systToFix.end(); ++itr){\n          cout << \"   \" << *itr << endl;\n        }\n\n        \/***\n            Construction of Model. Only requirement is that they return vector<vector<EstimateSummary> >\n\t    This is where we use the factory.\n        ***\/\n\n        vector<vector<EstimateSummary> > summaries;\n        if(xml_input.empty()){\n          cerr << \"no input channels found\" << endl;\n          exit(1);\n        }\n\n\n        vector<RooWorkspace*> chs;\n        vector<string> ch_names;\n        TFile* outFile = new TFile(outputFileName.c_str(), \"recreate\");\n        HistoToWorkspaceFactory factory(outputFileNamePrefix, rowTitle, systToFix, nominalLumi, lumiError, lowBin, highBin , outFile);\n\n\n        \/\/ for results tables\n        fprintf(factory.pFile, \" %s &\", rowTitle.c_str() );\n\n        \/\/ read the xml for each channel and combine\n        for(vector<string>::iterator itr=xml_input.begin(); itr!=xml_input.end(); ++itr){\n          vector<EstimateSummary> oneChannel;\n          \/\/ read xml\n          ReadXmlConfig(*itr, oneChannel, nominalLumi);\n          \/\/ not really needed anymore\n          summaries.push_back(oneChannel);\n          \/\/ use factory to create the workspace\n          string ch_name=oneChannel[0].channel;\n          ch_names.push_back(ch_name);\n          RooWorkspace * ws = factory.MakeSingleChannelModel(oneChannel, systToFix);\n          chs.push_back(ws);\n          \/\/ set poi in ModelConfig\n          ModelConfig * proto_config = (ModelConfig *) ws->obj(\"ModelConfig\");\n          cout << \"Setting Parameter of Interest as :\" << POI << endl;\n          RooRealVar* poi = (RooRealVar*) ws->var(POI.c_str());\n          RooArgSet * params= new RooArgSet;\n          params->add(*poi);\n          proto_config->SetParameters(*params);\n\n\n          \/\/ Gamma\/Uniform Constraints:\n          \/\/ turn some Gaussian constraints into Gamma\/Uniform\/LogNorm constraints, rename model newSimPdf\n\t  if(gammaSyst.size()>0 || uniformSyst.size()>0 || logNormSyst.size()>0) {\n\t    factory.EditSyst(ws,(\"model_\"+oneChannel[0].channel).c_str(),gammaSyst,uniformSyst,logNormSyst);\n\t    proto_config->SetPdf(*ws->pdf(\"newSimPdf\"));\n          }\n\n\t  \/\/ fill out ModelConfig and export\n          RooAbsData* expData = ws->data(\"expData\");\n\t  proto_config->GuessObsAndNuisance(*expData);\n\t  ws->writeToFile((outputFileNamePrefix+\"_\"+ch_name+\"_\"+rowTitle+\"_model.root\").c_str());\n\n\t  \/\/ do fit unless exportOnly requested\n\t  if(!exportOnly)\n\t    factory.FitModel(ws, ch_name, \"newSimPdf\", \"expData\", false);\n          fprintf(factory.pFile, \" & \" );\n        }\n\n        \/***\n\t    Make the combined model:\n            If you want output histograms in root format, create and pass it to the combine routine.\n            \"combine\" : will do the individual cross-section measurements plus combination\n\n        ***\/\n\n\n          \n        if(mode.find(\"comb\")!=string::npos){ \n          RooWorkspace* ws=factory.MakeCombinedModel(ch_names,chs);\n          \/\/ Gamma\/Uniform Constraints:\n          \/\/ turn some Gaussian constraints into Gamma\/Uniform\/logNormal constraints, rename model newSimPdf\n\t  if(gammaSyst.size()>0 || uniformSyst.size()>0 || logNormSyst.size()>0) \n\t    factory.EditSyst(ws,\"simPdf\",gammaSyst,uniformSyst,logNormSyst);\n          \/\/\n          \/\/ set parameter of interest according to the configuration\n          \/\/\n          ModelConfig * combined_config = (ModelConfig *) ws->obj(\"ModelConfig\");\n          cout << \"Setting Parameter of Interest as :\" << POI << endl;\n          RooRealVar* poi = (RooRealVar*) ws->var((POI).c_str());\n          \/\/RooRealVar* poi = (RooRealVar*) ws->var((POI+\"_comb\").c_str());\n          RooArgSet * params= new RooArgSet;\n          cout << poi << endl;\n          params->add(*poi);\n          combined_config->SetParameters(*params);\n          ws->Print();\n\n          \/\/ Set new PDF if there are gamma\/uniform constraint terms\n          if(gammaSyst.size()>0 || uniformSyst.size()>0 || logNormSyst.size()>0) \n\t    combined_config->SetPdf(*ws->pdf(\"newSimPdf\"));\n\n          RooAbsData* simData = ws->data(\"simData\");\n\t  combined_config->GuessObsAndNuisance(*simData);\n\t  \/\/\t  ws->writeToFile((\"results\/model_combined_edited.root\").c_str());\n\t  ws->writeToFile((outputFileNamePrefix+\"_combined_\"+rowTitle+\"_model.root\").c_str());\n\n\t  \/\/ TO DO:\n          \/\/ Totally factorize the statistical test in \"fit Model\" to a different area\n\t  if(!exportOnly)\n\t    factory.FitModel(ws, \"combined\", \"simPdf\", \"simData\", false);\n        }\n\n\n        fprintf(factory.pFile, \" \\\\\\\\ \\n\");\n\n        outFile->Close();\n        delete outFile;\n\n      }\n      node = node->GetNextNode(); \/\/ next measurement\n    }\n  }\n}\n\n\n\n<commit_msg>fix for Coverity (23382) uncaught exception<commit_after>\/\/ @(#)root\/roostats:$Id:  cranmer $\n\/\/ Author: Kyle Cranmer, Akira Shibata\n\/*************************************************************************\n * Copyright (C) 1995-2008, 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\/*\nBEGIN_HTML\n<p>\nThis is a package that creates a RooFit probability density function from ROOT histograms \nof expected distributions and histograms that represent the +\/- 1 sigma variations \nfrom systematic effects. The resulting probability density function can then be used\nwith any of the statistical tools provided within RooStats, such as the profile \nlikelihood ratio, Feldman-Cousins, etc.  In this version, the model is directly\nfed to a likelihodo ratio test, but it needs to be further factorized.<\/p>\n\n<p>\nThe user needs to provide histograms (in picobarns per bin) and configure the job\nwith XML.  The configuration XML is defined in the file config\/Config.dtd, but essentially\nit is organized as follows (see config\/Combination.xml and config\/ee.xml for examples)<\/p>\n\n<ul>\n<li> - a top level 'Combination' that is composed of:<\/li>\n<ul>\n <li>- several 'Channels' (eg. ee, emu, mumu), which are composed of:<\/li>\n <ul>\n  <li>- several 'Samples' (eg. signal, bkg1, bkg2, ...), each of which has:<\/li>\n  <ul>\n   <li> - a name<\/li>\n   <li> - if the sample is normalized by theory (eg N = L*sigma) or not (eg. data driven)<\/li>\n   <li> - a nominal expectation histogram<\/li>\n   <li> - a named 'Normalization Factor' (which can be fixed or allowed to float in a fit)<\/li>\n   <li> - several 'Overall Systematics' in normalization with:<\/li>\n   <ul>\n    <li> - a name<\/li>\n    <li> - +\/- 1 sigma variations (eg. 1.05 and 0.95 for a 5% uncertainty)<\/li>\n   <\/ul>\n   <li>- several 'Histogram Systematics' in shape with:<\/li>\n   <ul>\n    <li>- a name (which can be shared with the OverallSyst if correlated)<\/li>\n    <li>- +\/- 1 sigma variational histograms<\/li>\n   <\/ul>\n  <\/ul>\n <\/ul>\n <li>- several 'Measurements' (corresponding to a full fit of the model) each of which specifies<\/li>\n <ul>\n  <li>- a name for this fit to be used in tables and files<\/li>\n  <ul>\n   <li>      - what is the luminosity associated to the measurement in picobarns<\/li>\n   <li>      - which bins of the histogram should be used<\/li>\n   <li>      - what is the relative uncertainty on the luminosity <\/li>\n   <li>      - what is (are) the parameter(s) of interest that will be measured<\/li>\n   <li>      - which parameters should be fixed\/floating (eg. nuisance parameters)<\/li>\n  <\/ul>\n <\/ul>\n<\/ul>\nEND_HTML\n*\/\n\/\/\n\n\n\/\/ from std\n#include <string>\n#include <vector>\n#include <map>\n#include <iostream>\n#include <sstream>\n\n\/\/ from root\n#include \"TFile.h\"\n#include \"TH1F.h\"\n#include \"TDOMParser.h\"\n#include \"TXMLAttr.h\"\n#include \"TString.h\"\n\n\/\/ from roofit\n#include \"RooStats\/ModelConfig.h\"\n\n\/\/ from this package\n#include \"Helper.h\"\n#include \"ConfigParser.h\"\n#include \"RooStats\/HistFactory\/EstimateSummary.h\"\n#include \"RooStats\/HistFactory\/HistoToWorkspaceFactory.h\"\n\n\nusing namespace RooFit;\nusing namespace RooStats;\nusing namespace HistFactory;\n\nvoid topDriver(string input);\nvoid fastDriver(string input); \/\/ in MakeModelAndMeasurementsFast\n\n\/\/_____________________________batch only_____________________\n#ifndef __CINT__\n\nint main(int argc, char** argv) {\n\n  if(! (argc>1)) {\n    cerr << \"need input file\" << endl;\n    exit(1);\n  }\n\n  if(argc==2){\n    string input(argv[1]);\n    try {\n      fastDriver(input);\n    }\n    catch (std::string str) {\n      cerr << \"caught exception: \" << str << endl ;\n    }\n  }\n\n  if(argc==3){\n    string flag(argv[1]);\n    string input(argv[2]);\n    if(flag==\"-standard_form\")\n      try {\n\tfastDriver(input);\n      }\n      catch (std::string str) {\n\tcerr << \"caught exception: \" << str << endl ;\n      }\n    else if(flag==\"-number_counting_form\")\n      try {\n         topDriver(input);\n      }\n      catch (std::string str) {\n\tcerr << \"caught exception: \" << str << endl ;\n      }\n    else\n      cerr <<\"unrecognized flag.  Options are -standard_form or -number_counting_form\"<<endl;\n\n  }\n  return 0;\n}\n\n#endif\n\nvoid topDriver(string input ){\n\n  \/\/ TO DO:\n  \/\/ would like to fully factorize the XML parsing.  \n  \/\/ No clear need to have some here and some in ConfigParser\n\n  \/*** read in the input xml ***\/\n  TDOMParser xmlparser;\n  Int_t parseError = xmlparser.ParseFile( input.c_str() );\n  if( parseError ) { \n    std::cerr << \"Loading of xml document \\\"\" << input\n          << \"\\\" failed\" << std::endl;\n  } \n\n  cout << \"reading input : \" << input << endl;\n  TXMLDocument* xmldoc = xmlparser.GetXMLDocument();\n  TXMLNode* rootNode = xmldoc->GetRootNode();\n\n  if( rootNode->GetNodeName() == TString( \"Combination\" ) ){\n    string outputFileName, outputFileNamePrefix;\n    vector<string> xml_input;\n\n    TListIter attribIt = rootNode->GetAttributes();\n    TXMLAttr* curAttr = 0;\n    while( ( curAttr = dynamic_cast< TXMLAttr* >( attribIt() ) ) != 0 ) {\n      if( curAttr->GetName() == TString( \"OutputFilePrefix\" ) ) {\n        outputFileNamePrefix=string(curAttr->GetValue());\n        cout << \"output file is : \" << outputFileName << endl;\n      }\n    } \n    TXMLNode* node = rootNode->GetChildren();\n    while( node != 0 ) {\n      if( node->GetNodeName() == TString( \"Input\" ) ) {\n        xml_input.push_back(node->GetText());\n      }\n      node = node->GetNextNode();\n    }\n    node = rootNode->GetChildren();\n    while( node != 0 ) {\n      if( node->GetNodeName() == TString( \"Measurement\" ) ) {\n\n        Double_t nominalLumi=0, lumiRelError=0, lumiError=0;\n        Int_t lowBin=0, highBin=0;\n        string rowTitle, POI, mode;\n        vector<string> systToFix;\n        map<string,double> gammaSyst;\n        map<string,double> uniformSyst;\n        map<string,double> logNormSyst;\n\tbool exportOnly = false;\n\n\t\/\/        TListIter attribIt = node->GetAttributes();\n\t\/\/        TXMLAttr* curAttr = 0;\n        attribIt = node->GetAttributes();\n        curAttr = 0;\n        while( ( curAttr = dynamic_cast< TXMLAttr* >( attribIt() ) ) != 0 ) {\n          if( curAttr->GetName() == TString( \"Lumi\" ) ) {\n            nominalLumi=atof(curAttr->GetValue());\n          }\n          if( curAttr->GetName() == TString( \"LumiRelErr\" ) ) {\n            lumiRelError=atof(curAttr->GetValue());\n          }\n          if( curAttr->GetName() == TString( \"BinLow\" ) ) {\n            lowBin=atoi(curAttr->GetValue());\n          }\n          if( curAttr->GetName() == TString( \"BinHigh\" ) ) {\n            highBin=atoi(curAttr->GetValue());\n          }\n          if( curAttr->GetName() == TString( \"Name\" ) ) {\n            rowTitle=curAttr->GetValue();\n            outputFileName=outputFileNamePrefix+\"_\"+rowTitle+\".root\";\n          }\n          if( curAttr->GetName() == TString( \"Mode\" ) ) {\n            mode=curAttr->GetValue();\n          }\n          if( curAttr->GetName() == TString( \"ExportOnly\" ) ) {\n            if(curAttr->GetValue() == TString( \"True\" ) )\n\t      exportOnly = true;\n\t    else\n\t      exportOnly = false;\n          }\n        }\n        lumiError=nominalLumi*lumiRelError;\n\n        TXMLNode* mnode = node->GetChildren();\n        while( mnode != 0 ) {\n          if( mnode->GetNodeName() == TString( \"POI\" ) ) {\n            POI=mnode->GetText();\n          }\n          if( mnode->GetNodeName() == TString( \"ParamSetting\" ) ) {\n\t    \/\/            TListIter attribIt = mnode->GetAttributes();\n            \/\/TXMLAttr* curAttr = 0;\n\t    attribIt = mnode->GetAttributes();\n\t    curAttr = 0;\n            while( ( curAttr = dynamic_cast< TXMLAttr* >( attribIt() ) ) != 0 ) {\n              if( curAttr->GetName() == TString( \"Const\" ) ) {\n                if(curAttr->GetValue()==TString(\"True\")){\n                  AddSubStrings(systToFix, mnode->GetText());\n                }\n              }\n            }\n          }\n          if( mnode->GetNodeName() == TString( \"ConstraintTerm\" ) ) {\n            vector<string> syst; string type = \"\"; double rel = 0;\n            AddSubStrings(syst,mnode->GetText());\n\t    \/\/            TListIter attribIt = mnode->GetAttributes();\n\t    \/\/            TXMLAttr* curAttr = 0;\n\t    attribIt = mnode->GetAttributes();\n            curAttr = 0;\n            while( ( curAttr = dynamic_cast< TXMLAttr* >( attribIt() ) ) != 0 ) {\n              if( curAttr->GetName() == TString( \"Type\" ) ) {\n                type = curAttr->GetValue();\n              }\n              if( curAttr->GetName() == TString( \"RelativeUncertainty\" ) ) {\n                rel = atof(curAttr->GetValue());\n              }\n            }\n            if (type==\"Gamma\" && rel!=0) {\n              for (vector<string>::const_iterator it=syst.begin(); it!=syst.end(); it++) gammaSyst[(*it).c_str()] = rel;\n            }\n            if (type==\"Uniform\" && rel!=0) {\n              for (vector<string>::const_iterator it=syst.begin(); it!=syst.end(); it++) uniformSyst[(*it).c_str()] = rel;\n            }\n            if (type==\"LogNormal\" && rel!=0) {\n              for (vector<string>::const_iterator it=syst.begin(); it!=syst.end(); it++) logNormSyst[(*it).c_str()] = rel;\n            }\n          }\n          mnode = mnode->GetNextNode();\n        }\n\n        \/* Do measurement *\/\n        cout << \"using lumi = \" << nominalLumi << \" and lumiError = \" << lumiError\n             << \" including bins between \" << lowBin << \" and \" << highBin << endl;\n        cout << \"fixing the following parameters:\"  << endl;\n        for(vector<string>::iterator itr=systToFix.begin(); itr!=systToFix.end(); ++itr){\n          cout << \"   \" << *itr << endl;\n        }\n\n        \/***\n            Construction of Model. Only requirement is that they return vector<vector<EstimateSummary> >\n\t    This is where we use the factory.\n        ***\/\n\n        vector<vector<EstimateSummary> > summaries;\n        if(xml_input.empty()){\n          cerr << \"no input channels found\" << endl;\n          exit(1);\n        }\n\n\n        vector<RooWorkspace*> chs;\n        vector<string> ch_names;\n        TFile* outFile = new TFile(outputFileName.c_str(), \"recreate\");\n        HistoToWorkspaceFactory factory(outputFileNamePrefix, rowTitle, systToFix, nominalLumi, lumiError, lowBin, highBin , outFile);\n\n\n        \/\/ for results tables\n        fprintf(factory.pFile, \" %s &\", rowTitle.c_str() );\n\n        \/\/ read the xml for each channel and combine\n        for(vector<string>::iterator itr=xml_input.begin(); itr!=xml_input.end(); ++itr){\n          vector<EstimateSummary> oneChannel;\n          \/\/ read xml\n          ReadXmlConfig(*itr, oneChannel, nominalLumi);\n          \/\/ not really needed anymore\n          summaries.push_back(oneChannel);\n          \/\/ use factory to create the workspace\n          string ch_name=oneChannel[0].channel;\n          ch_names.push_back(ch_name);\n          RooWorkspace * ws = factory.MakeSingleChannelModel(oneChannel, systToFix);\n          chs.push_back(ws);\n          \/\/ set poi in ModelConfig\n          ModelConfig * proto_config = (ModelConfig *) ws->obj(\"ModelConfig\");\n          cout << \"Setting Parameter of Interest as :\" << POI << endl;\n          RooRealVar* poi = (RooRealVar*) ws->var(POI.c_str());\n          RooArgSet * params= new RooArgSet;\n          params->add(*poi);\n          proto_config->SetParameters(*params);\n\n\n          \/\/ Gamma\/Uniform Constraints:\n          \/\/ turn some Gaussian constraints into Gamma\/Uniform\/LogNorm constraints, rename model newSimPdf\n\t  if(gammaSyst.size()>0 || uniformSyst.size()>0 || logNormSyst.size()>0) {\n\t    factory.EditSyst(ws,(\"model_\"+oneChannel[0].channel).c_str(),gammaSyst,uniformSyst,logNormSyst);\n\t    proto_config->SetPdf(*ws->pdf(\"newSimPdf\"));\n          }\n\n\t  \/\/ fill out ModelConfig and export\n          RooAbsData* expData = ws->data(\"expData\");\n\t  proto_config->GuessObsAndNuisance(*expData);\n\t  ws->writeToFile((outputFileNamePrefix+\"_\"+ch_name+\"_\"+rowTitle+\"_model.root\").c_str());\n\n\t  \/\/ do fit unless exportOnly requested\n\t  if(!exportOnly)\n\t    factory.FitModel(ws, ch_name, \"newSimPdf\", \"expData\", false);\n          fprintf(factory.pFile, \" & \" );\n        }\n\n        \/***\n\t    Make the combined model:\n            If you want output histograms in root format, create and pass it to the combine routine.\n            \"combine\" : will do the individual cross-section measurements plus combination\n\n        ***\/\n\n\n          \n        if(mode.find(\"comb\")!=string::npos){ \n          RooWorkspace* ws=factory.MakeCombinedModel(ch_names,chs);\n          \/\/ Gamma\/Uniform Constraints:\n          \/\/ turn some Gaussian constraints into Gamma\/Uniform\/logNormal constraints, rename model newSimPdf\n\t  if(gammaSyst.size()>0 || uniformSyst.size()>0 || logNormSyst.size()>0) \n\t    factory.EditSyst(ws,\"simPdf\",gammaSyst,uniformSyst,logNormSyst);\n          \/\/\n          \/\/ set parameter of interest according to the configuration\n          \/\/\n          ModelConfig * combined_config = (ModelConfig *) ws->obj(\"ModelConfig\");\n          cout << \"Setting Parameter of Interest as :\" << POI << endl;\n          RooRealVar* poi = (RooRealVar*) ws->var((POI).c_str());\n          \/\/RooRealVar* poi = (RooRealVar*) ws->var((POI+\"_comb\").c_str());\n          RooArgSet * params= new RooArgSet;\n          cout << poi << endl;\n          params->add(*poi);\n          combined_config->SetParameters(*params);\n          ws->Print();\n\n          \/\/ Set new PDF if there are gamma\/uniform constraint terms\n          if(gammaSyst.size()>0 || uniformSyst.size()>0 || logNormSyst.size()>0) \n\t    combined_config->SetPdf(*ws->pdf(\"newSimPdf\"));\n\n          RooAbsData* simData = ws->data(\"simData\");\n\t  combined_config->GuessObsAndNuisance(*simData);\n\t  \/\/\t  ws->writeToFile((\"results\/model_combined_edited.root\").c_str());\n\t  ws->writeToFile((outputFileNamePrefix+\"_combined_\"+rowTitle+\"_model.root\").c_str());\n\n\t  \/\/ TO DO:\n          \/\/ Totally factorize the statistical test in \"fit Model\" to a different area\n\t  if(!exportOnly)\n\t    factory.FitModel(ws, \"combined\", \"simPdf\", \"simData\", false);\n        }\n\n\n        fprintf(factory.pFile, \" \\\\\\\\ \\n\");\n\n        outFile->Close();\n        delete outFile;\n\n      }\n      node = node->GetNextNode(); \/\/ next measurement\n    }\n  }\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File VortexWaveInteractionSolver.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: Vortex Wave Interaction solver\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <Auxiliary\/Driver.h>\n#include <LibUtilities\/BasicUtils\/SessionReader.h>\n\nusing namespace Nektar;\n\n#include<VortexWaveInteraction\/VortexWaveInteraction.h>\n\n#if defined(_MSC_VER) && BOOST_VERSION > 104700\n#include <windows.h>\n#undef MoveFile\n#endif\n\nvoid DoFixedForcingIteration(VortexWaveInteraction &vwi);\nvoid Mvdir(string dir, NekDouble dir_ending);\n\nint main(int argc, char *argv[])\n{\n    try\n    { \n        VortexWaveInteraction vwi(argc,argv);\n\n        for(int i = 0; i < vwi.GetMaxWaveForceMagIter(); ++i)\n        {\n            DoFixedForcingIteration(vwi);\n            \n            NekDouble WaveForce = vwi.GetWaveForceMag();\n            \n            vwi.AppendEvlToFile(\"ConvergedSolns\",WaveForce);            \n\n            vwi.SetWaveForceMag(WaveForce + vwi.GetWaveForceMagStep());\n            vwi.SetAlpha(vwi.GetAlpha() + vwi.GetDAlphaDWaveForceMag()*vwi.GetWaveForceMagStep());\n            \n            \/\/ Save data directories. \n            if(vwi.GetVWIIterationType() == eFixedAlphaWaveForcing)\n            {\n                Mvdir(\"Save\",WaveForce);\n            }\n            else\n            {\n                Mvdir(\"Save_Outer\",WaveForce);\n                \/\/ Execute Another loop so that not same initial conditions as last iteration\n                vwi.ExecuteLoop();\n            }\n        }\n    }\n    \n    catch (const std::runtime_error&)\n    {\n        return 1;\n    }\n    \n    catch (const std::string& eStr)\n    {\n        cout << \"Error: \" << eStr << endl;\n    }\n}\n\nvoid Mvdir(string dir, NekDouble dir_ending)\n{\n    \/\/ save OuterIter.his if exists\n    string saveOuterIter = \"mv -f OuterIter.his \"+ dir;\n    if(system(saveOuterIter.c_str()))\n    {\n        ASSERTL0(false,saveOuterIter.c_str());\n    }\n\n    \/\/ Mv directory\n    string newdir  = dir + boost::lexical_cast<std::string>(dir_ending);\n    string syscall = \"mv -f \" + dir + \" \" + newdir;\n\n    if(system(syscall.c_str()))\n    {\n        ASSERTL0(false,syscall.c_str());\n    }\n\n    \/\/ make new directory\n    syscall = \"mkdir \" + dir;\n    system(syscall.c_str());\n}\n\nvoid DoFixedForcingIteration(VortexWaveInteraction &vwi)\n{\n\n    \/\/ Reset eigenvalue checker in case used in previous iterations \n    vwi.CheckEigIsStationary(true);\n\n    switch(vwi.GetVWIIterationType())\n    {\n    case eFixedAlpha:\n        {\n            int i;\n            int nouter_iter = vwi.GetNOuterIterations();\n            bool exit_iteration = false;\n            \n            while(exit_iteration == false)\n            {\n                \/\/ Reset eigenvalue checker in case used in previous iterations \n                vwi.CheckEigIsStationary(true);\n\n                for(i = vwi.GetIterStart(); i < vwi.GetIterEnd(); ++i)\n                {\n                    vwi.ExecuteLoop();\n                    vwi.SaveLoopDetails(\"Save\", i);\n                    vwi.AppendEvlToFile(\"conv.his\",i);            \n                        \n                    if(vwi.CheckEigIsStationary())\n                    {\n                        vwi.SaveLoopDetails(\"Save_Outer\", nouter_iter);\n                        break;\n                    }\n                }\n                \n                \/\/ check to see if growth was converged. \n                if(i == vwi.GetIterEnd())\n                {\n                    cout << \"Failed to converge growth rate in\" << \n                        \" inner iteration after \" << vwi.GetIterEnd() \n                         << \" loops\" << endl;\n                    exit(1);\n                }\n                \n                vwi.AppendEvlToFile(\"OuterIter.his\",nouter_iter++);            \n                exit_iteration = vwi.CheckIfAtNeutralPoint();\n                if(exit_iteration == false)\n                {\n                    vwi.UpdateWaveForceMag(nouter_iter);\n                }\n                \n                if(nouter_iter >= vwi.GetMaxOuterIterations())\n                {\n                    cerr << \"Failed to converge after \"<< vwi.GetMaxOuterIterations() << \" outer iterations\" << endl;\n                    exit_iteration = true;\n                }\n            }\n\n        }\n    case eFixedWaveForcing:\n    case eFixedWaveForcingPhase:\n        {\n            int i;\n            int nouter_iter = vwi.GetNOuterIterations();\n            bool exit_iteration = false;\n            NekDouble alpha_init = vwi.GetAlpha();\n\t    NekDouble saveEigRelTol = vwi.GetEigRelTol();\n\t    int saveMinIters = vwi.GetMinInnerIterations();\n\t    int init_search = 1;\n\t    \n\t    \/\/ initial set m_eigelTol to 1e-1 and inner iterations to 1 for \n\t    \/\/ quick search \n\t    vwi.SetEigRelTol(1e-1);\n\t    vwi.SetMinInnerIterations(2);\n\n            while(exit_iteration == false)\n            {\n                \/\/ Reset eigenvalue checker in case used in previous iterations \n                vwi.CheckEigIsStationary(true);\n\n                for(i = vwi.GetIterStart(); i < vwi.GetIterEnd(); ++i)\n                {\n                    vwi.ExecuteLoop();\n                    vwi.SaveLoopDetails(\"Save\", i);\n                    vwi.AppendEvlToFile(\"conv.his\",i);                    \n\t\t    if(vwi.CheckEigIsStationary())\n\t\t      {\n                        vwi.SaveLoopDetails(\"Save_Outer\", nouter_iter);\n                        break;\n\t\t      }\n                }\n                \n                \/\/ check to see if growth was converged. \n                if(i == vwi.GetIterEnd() )\n                {\n                    cout << \"Failed to converge growth rate in\" << \n                        \" inner iteration after \" << vwi.GetIterEnd() \n                         << \" loops\" << endl;\n                    exit(1);\n                }\n                \n                vwi.AppendEvlToFile(\"OuterIter.his\",nouter_iter++);            \n                \n\t\texit_iteration = vwi.CheckIfAtNeutralPoint();\n\n\t\t\/\/ Redo iteration if at first coarse search \n\t\tif((exit_iteration == true) && (init_search == 1))\n\t\t{\n\t\t  init_search = 0;\n\t\t  vwi.SetEigRelTol(saveEigRelTol);\n\t\t  vwi.SetMinInnerIterations(saveMinIters);\n\t\t  nouter_iter = 1;\n\t\t  exit_iteration = false;\n\t\t}\n\t\telse\n                {\n                    vwi.UpdateAlpha(nouter_iter);\n                }\n             \n                if(nouter_iter >= vwi.GetMaxOuterIterations())\n                {\n                    cerr << \"Failed to converge after \"<< vwi.GetMaxOuterIterations() << \" outer iterations\" << endl;\n\t\t    exit_iteration = true;\n                }\n            }\n            \n            vwi.UpdateDAlphaDWaveForceMag(alpha_init);\n\n        }\n        break;\n    case eFixedAlphaWaveForcing:\n        \n        for(int i = vwi.GetIterStart(); i < vwi.GetIterEnd(); ++i)\n        {\n            vwi.ExecuteLoop();\n            vwi.SaveLoopDetails(\"Save\",i);\n            vwi.AppendEvlToFile(\"conv.his\",i);            \n        }\n        break;\n    case eFixedWaveForcingWithSubIterationOnAlpha:\n        {\n            int i;\n            int nouter_iter = vwi.GetNOuterIterations();\n            bool exit_iteration = false;\n            \n            while(exit_iteration == false)\n            {\n                bool exit_alphaIter = false;\n                \n                vwi.ExecuteLoop(false);\n\n                \/\/ Sub iterate Alpha\n                for(i = 0; i < vwi.GetIterEnd(); ++i)\n                {\n                    vwi.SaveLoopDetails(\"Save\", i);\n                    \n                    vwi.AppendEvlToFile(\"AlphaIter.his\",i);            \n                    \n                    exit_alphaIter = vwi.CheckIfAtNeutralPoint();\n                    if(exit_alphaIter == false)\n                    {\n                        vwi.UpdateAlpha(i+1);\n                        vwi.ExecuteWave();\n                    }\n                    else\n                    {\n                        vwi.CalcNonLinearWaveForce();\n                        break;\n                    }\n                }\n                \n                \/\/ check to see if growth was converged. \n                if(i == vwi.GetIterEnd())\n                {\n                    cout << \"Failed to converge growth rate in\" << \n                        \" inner iteration after \" << vwi.GetIterEnd() \n                         << \" loops\" << endl;\n                    exit(1);\n                }\n                \n                vwi.MoveFile(\"AlphaIter.his\",\"Save_Outer\", nouter_iter);\n                vwi.SaveLoopDetails(\"Save_Outer\", nouter_iter);\n                vwi.AppendEvlToFile(\"OuterIter.his\",nouter_iter++);            \n                \n                \/\/ assume that if only previous inner loop has\n                \/\/ only done one iteration then we are at neutral\n                \/\/ point\n                if (i == 0  && vwi.IfIterInterface()==false)\n                {\n                    exit_iteration = true;\n                }\n                \n                \n                if(nouter_iter >= vwi.GetMaxOuterIterations())\n                {\n                    cerr << \"Failed to converge after \"<< vwi.GetMaxOuterIterations() << \" outer iterations\" << endl;\n                    exit_iteration = true;\n                }\n            }\n        }\n        break;\n    default:\n        ASSERTL0(false,\"Unknown iteration type\");\n    }\n    \n}\n\n\n<commit_msg>Hopefullly fix io issue dumping Alpha in ConvergedSolns<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File VortexWaveInteractionSolver.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: Vortex Wave Interaction solver\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <Auxiliary\/Driver.h>\n#include <LibUtilities\/BasicUtils\/SessionReader.h>\n\nusing namespace Nektar;\n\n#include<VortexWaveInteraction\/VortexWaveInteraction.h>\n\n#if defined(_MSC_VER) && BOOST_VERSION > 104700\n#include <windows.h>\n#undef MoveFile\n#endif\n\nvoid DoFixedForcingIteration(VortexWaveInteraction &vwi);\nvoid Mvdir(string dir, NekDouble dir_ending);\n\nint main(int argc, char *argv[])\n{\n    try\n    { \n        VortexWaveInteraction vwi(argc,argv);\n\n        for(int i = 0; i < vwi.GetMaxWaveForceMagIter(); ++i)\n        {\n            DoFixedForcingIteration(vwi);\n            \n            NekDouble WaveForce = vwi.GetWaveForceMag();\n            \n            vwi.AppendEvlToFile(\"ConvergedSolns\",WaveForce);            \n\n            vwi.SetWaveForceMag(WaveForce + vwi.GetWaveForceMagStep());\n            vwi.SetAlpha(vwi.GetAlpha() + vwi.GetDAlphaDWaveForceMag()*vwi.GetWaveForceMagStep());\n            \n            \/\/ Save data directories. \n            if(vwi.GetVWIIterationType() == eFixedAlphaWaveForcing)\n            {\n                Mvdir(\"Save\",WaveForce);\n            }\n            else\n            {\n                Mvdir(\"Save_Outer\",WaveForce);\n                \/\/ Execute Another loop so that not same initial conditions as last iteration\n                vwi.ExecuteLoop();\n            }\n        }\n    }\n    \n    catch (const std::runtime_error&)\n    {\n        return 1;\n    }\n    \n    catch (const std::string& eStr)\n    {\n        cout << \"Error: \" << eStr << endl;\n    }\n}\n\nvoid Mvdir(string dir, NekDouble dir_ending)\n{\n    \/\/ save OuterIter.his if exists\n    string saveOuterIter = \"mv -f OuterIter.his \"+ dir;\n    if(system(saveOuterIter.c_str()))\n    {\n        ASSERTL0(false,saveOuterIter.c_str());\n    }\n    \n    \/\/ Mv directory\n    string newdir  = dir + boost::lexical_cast<std::string>(dir_ending);\n    string syscall = \"mv -f \" + dir + \" \" + newdir;\n\n    if(system(syscall.c_str()))\n    {\n        ASSERTL0(false,syscall.c_str());\n    }\n    \n    \/\/ make new directory\n    syscall = \"mkdir \" + dir;\n    system(syscall.c_str());\n}\n\nvoid DoFixedForcingIteration(VortexWaveInteraction &vwi)\n{\n\n    \/\/ Reset eigenvalue checker in case used in previous iterations \n    vwi.CheckEigIsStationary(true);\n\n    switch(vwi.GetVWIIterationType())\n    {\n    case eFixedAlpha:\n        {\n            int i;\n            int nouter_iter = vwi.GetNOuterIterations();\n            bool exit_iteration = false;\n            \n            while(exit_iteration == false)\n            {\n                \/\/ Reset eigenvalue checker in case used in previous iterations \n                vwi.CheckEigIsStationary(true);\n\n                for(i = vwi.GetIterStart(); i < vwi.GetIterEnd(); ++i)\n                {\n                    vwi.ExecuteLoop();\n                    vwi.SaveLoopDetails(\"Save\", i);\n                    vwi.AppendEvlToFile(\"conv.his\",i);            \n                        \n                    if(vwi.CheckEigIsStationary())\n                    {\n                        vwi.SaveLoopDetails(\"Save_Outer\", nouter_iter);\n                        break;\n                    }\n                }\n                \n                \/\/ check to see if growth was converged. \n                if(i == vwi.GetIterEnd())\n                {\n                    cout << \"Failed to converge growth rate in\" << \n                        \" inner iteration after \" << vwi.GetIterEnd() \n                         << \" loops\" << endl;\n                    exit(1);\n                }\n                \n                vwi.AppendEvlToFile(\"OuterIter.his\",nouter_iter++);            \n                exit_iteration = vwi.CheckIfAtNeutralPoint();\n                if(exit_iteration == false)\n                {\n                    vwi.UpdateWaveForceMag(nouter_iter);\n                }\n                \n                if(nouter_iter >= vwi.GetMaxOuterIterations())\n                {\n                    cerr << \"Failed to converge after \"<< vwi.GetMaxOuterIterations() << \" outer iterations\" << endl;\n                    exit_iteration = true;\n                }\n            }\n\n        }\n    case eFixedWaveForcing:\n    case eFixedWaveForcingPhase:\n        {\n            int i;\n            int nouter_iter = vwi.GetNOuterIterations();\n            bool exit_iteration = false;\n            NekDouble alpha_init = vwi.GetAlpha();\n\t    NekDouble saveEigRelTol = vwi.GetEigRelTol();\n\t    int saveMinIters = vwi.GetMinInnerIterations();\n\t    int init_search = 1;\n\t    \n\t    \/\/ initial set m_eigelTol to 1e-1 and inner iterations to 1 for \n\t    \/\/ quick search \n\t    vwi.SetEigRelTol(1e-1);\n\t    vwi.SetMinInnerIterations(2);\n\n            while(exit_iteration == false)\n            {\n                \/\/ Reset eigenvalue checker in case used in previous iterations \n                vwi.CheckEigIsStationary(true);\n\n                for(i = vwi.GetIterStart(); i < vwi.GetIterEnd(); ++i)\n                {\n                    vwi.ExecuteLoop();\n                    vwi.SaveLoopDetails(\"Save\", i);\n                    vwi.AppendEvlToFile(\"conv.his\",i);                    \n\t\t    if(vwi.CheckEigIsStationary())\n\t\t      {\n                        vwi.SaveLoopDetails(\"Save_Outer\", nouter_iter);\n                        break;\n\t\t      }\n                }\n                \n                \/\/ check to see if growth was converged. \n                if(i == vwi.GetIterEnd() )\n                {\n                    cout << \"Failed to converge growth rate in\" << \n                        \" inner iteration after \" << vwi.GetIterEnd() \n                         << \" loops\" << endl;\n                    exit(1);\n                }\n                \n                vwi.AppendEvlToFile(\"OuterIter.his\",nouter_iter++);            \n                \n\t\texit_iteration = vwi.CheckIfAtNeutralPoint();\n\n                if(exit_iteration == false)\n                {\n                    vwi.UpdateAlpha(nouter_iter);\n                }\n\n\t\t\/\/ Redo iteration if at first coarse search \n\t\tif((exit_iteration == true) && (init_search == 1))\n\t\t{\n\t\t  init_search = 0;\n\t\t  vwi.SetEigRelTol(saveEigRelTol);\n\t\t  vwi.SetMinInnerIterations(saveMinIters);\n\t\t  nouter_iter = 1;\n\t\t  exit_iteration = false;\n\t\t}\n                \n                if(nouter_iter >= vwi.GetMaxOuterIterations())\n                {\n                    cerr << \"Failed to converge after \"<< vwi.GetMaxOuterIterations() << \" outer iterations\" << endl;\n\t\t    exit_iteration = true;\n                }\n            }\n            \n            vwi.UpdateDAlphaDWaveForceMag(alpha_init);\n\n        }\n        break;\n    case eFixedAlphaWaveForcing:\n        \n        for(int i = vwi.GetIterStart(); i < vwi.GetIterEnd(); ++i)\n        {\n            vwi.ExecuteLoop();\n            vwi.SaveLoopDetails(\"Save\",i);\n            vwi.AppendEvlToFile(\"conv.his\",i);            \n        }\n        break;\n    case eFixedWaveForcingWithSubIterationOnAlpha:\n        {\n            int i;\n            int nouter_iter = vwi.GetNOuterIterations();\n            bool exit_iteration = false;\n            \n            while(exit_iteration == false)\n            {\n                bool exit_alphaIter = false;\n                \n                vwi.ExecuteLoop(false);\n\n                \/\/ Sub iterate Alpha\n                for(i = 0; i < vwi.GetIterEnd(); ++i)\n                {\n                    vwi.SaveLoopDetails(\"Save\", i);\n                    \n                    vwi.AppendEvlToFile(\"AlphaIter.his\",i);            \n                    \n                    exit_alphaIter = vwi.CheckIfAtNeutralPoint();\n                    if(exit_alphaIter == false)\n                    {\n                        vwi.UpdateAlpha(i+1);\n                        vwi.ExecuteWave();\n                    }\n                    else\n                    {\n                        vwi.CalcNonLinearWaveForce();\n                        break;\n                    }\n                }\n                \n                \/\/ check to see if growth was converged. \n                if(i == vwi.GetIterEnd())\n                {\n                    cout << \"Failed to converge growth rate in\" << \n                        \" inner iteration after \" << vwi.GetIterEnd() \n                         << \" loops\" << endl;\n                    exit(1);\n                }\n                \n                vwi.MoveFile(\"AlphaIter.his\",\"Save_Outer\", nouter_iter);\n                vwi.SaveLoopDetails(\"Save_Outer\", nouter_iter);\n                vwi.AppendEvlToFile(\"OuterIter.his\",nouter_iter++);            \n                \n                \/\/ assume that if only previous inner loop has\n                \/\/ only done one iteration then we are at neutral\n                \/\/ point\n                if (i == 0  && vwi.IfIterInterface()==false)\n                {\n                    exit_iteration = true;\n                }\n                \n                \n                if(nouter_iter >= vwi.GetMaxOuterIterations())\n                {\n                    cerr << \"Failed to converge after \"<< vwi.GetMaxOuterIterations() << \" outer iterations\" << endl;\n                    exit_iteration = true;\n                }\n            }\n        }\n        break;\n    default:\n        ASSERTL0(false,\"Unknown iteration type\");\n    }\n    \n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\r\n#include <rdomacros.h>\r\n#include <rdotypes.h>\r\n#include <rdodebug.h>\r\n\r\ntemplate<class T>\r\nclass ContainerVector\r\n{\r\npublic:\r\n\ttypedef T                                  Item;\r\n\ttypedef std::vector<Item>                  Container;\r\n\ttypedef typename Container::iterator       Iterator;\r\n\ttypedef typename Container::const_iterator CIterator;\r\n\r\n\tIterator  begin()       { return m_list.begin(); }\r\n\tIterator  end  ()       { return m_list.end  (); }\r\n\tCIterator begin() const { return m_list.begin(); }\r\n\tCIterator end  () const { return m_list.end  (); }\r\n\trbool     empty() const { return m_list.empty(); }\r\n\r\n\tREF(ContainerVector) operator() (CREF(Item) item)\r\n\t{\r\n\t\tm_list.push_back(item);\r\n\t\treturn *this;\r\n\t}\r\n\r\nprivate:\r\n\tContainer m_list;\r\n};\r\n\r\ntemplate <class Container>\r\nclass OrderFIFO\r\n{\r\npublic:\r\n\tstatic typename Container::CIterator getFirst(CREF(Container) container)\r\n\t{\r\n\t\treturn container.begin();\r\n\t}\r\n};\r\n\r\ntemplate <class Container>\r\nclass OrderLIFO\r\n{\r\npublic:\r\n\tstatic typename Container::CIterator getFirst(CREF(Container) container)\r\n\t{\r\n\t\tif (container.empty())\r\n\t\t\treturn container.end();\r\n\r\n\t\tContainer::CIterator last = container.end();\r\n\t\t--last;\r\n\t\treturn last;\r\n\t}\r\n};\r\n\r\ntemplate <class Container>\r\nclass OrderFIFOCashed\r\n{\r\npublic:\r\n\tOrderFIFOCashed()\r\n\t\t: m_inited(false)\r\n\t{}\r\n\ttypename Container::CIterator getFirst(CREF(Container) container)\r\n\t{\r\n\t\tm_lastItemIt = container.begin();\r\n\t\tm_inited     = true;\r\n\t\treturn m_lastItemIt;\r\n\t}\r\n\r\nprivate:\r\n\trbool                         m_inited;\r\n\ttypename Container::CIterator m_lastItemIt;\r\n};\r\n\r\ntemplate <class Container, class Order>\r\nclass Queue\r\n{\r\npublic:\r\n\ttypename Container::CIterator getFirst(CREF(Container) container) const\r\n\t{\r\n\t\treturn Order::getFirst(container);\r\n\t}\r\n\ttypename Container::CIterator getFirst(CREF(Container) container, REF(Order) order) const\r\n\t{\r\n\t\treturn order.getFirst(container);\r\n\t}\r\n};\r\n\r\nvoid main()\r\n{\r\n\ttypedef ruint                  Item;\r\n\ttypedef ContainerVector<Item>  Container;\r\n\tContainer ontainer;\r\n\tontainer(1)(2)(4)(3);\r\n\r\n\t{\r\n\t\tQueue<Container, OrderFIFO<Container> > queue;\r\n\t\tContainer::CIterator it = queue.getFirst(ontainer);\r\n\t\tint i = 1;\r\n\t}\r\n\t{\r\n\t\tQueue<Container, OrderLIFO<Container> > queue;\r\n\t\tContainer::CIterator it = queue.getFirst(ontainer);\r\n\t\tint i = 1;\r\n\t}\r\n\t{\r\n\t\tOrderFIFOCashed<Container> order;\r\n\t\tQueue<Container, OrderFIFOCashed<Container> > queue;\r\n\t\tContainer::CIterator it = queue.getFirst(ontainer, order);\r\n\t\tint i = 1;\r\n\t}\r\n}\r\n<commit_msg>* добавлен класс логики, запараметризован дисциплиной<commit_after>#include <vector>\r\n#include <algorithm>\r\n#include <rdomacros.h>\r\n#include <rdotypes.h>\r\n#include <rdodebug.h>\r\n\r\nclass MyOperation\r\n{\r\npublic:\r\n\tMyOperation(ruint dummy)\r\n\t\t: m_dummy(dummy)\r\n\t{}\r\n\trbool operator< (CREF(MyOperation) opr) const\r\n\t{\r\n\t\treturn m_dummy < opr.m_dummy;\r\n\t}\r\n\r\nprivate:\r\n\truint m_dummy;\r\n};\r\n\r\ntemplate <class T, class C = std::vector<T> >\r\nclass Container\r\n{\r\npublic:\r\n\ttypedef T                             Item;\r\n\ttypedef C                             List;\r\n\ttypedef typename List::iterator       Iterator;\r\n\ttypedef typename List::const_iterator CIterator;\r\n\r\n\tIterator  begin()       { return m_list.begin(); }\r\n\tIterator  end  ()       { return m_list.end  (); }\r\n\tCIterator begin() const { return m_list.begin(); }\r\n\tCIterator end  () const { return m_list.end  (); }\r\n\trbool     empty() const { return m_list.empty(); }\r\n\r\n\tREF(Container) operator() (CREF(Item) item)\r\n\t{\r\n\t\tm_list.push_back(item);\r\n\t\treturn *this;\r\n\t}\r\n\r\nprivate:\r\n\tList m_list;\r\n};\r\n\r\nclass OrderFIFO\r\n{\r\npublic:\r\n\ttemplate <class Container>\r\n\tstatic void sort(REF(Container) container)\r\n\t{}\r\n};\r\n\r\nclass OrderLIFO\r\n{\r\npublic:\r\n\ttemplate <class Container>\r\n\tstatic void sort(REF(Container) container)\r\n\t{\r\n\t\tstd::reverse(container.begin(), container.end());\r\n\t}\r\n};\r\n\r\nclass OrderPrior\r\n{\r\npublic:\r\n\ttemplate <class Container>\r\n\tstatic void sort(REF(Container) container)\r\n\t{\r\n\t\tstd::sort(container.begin(), container.end());\r\n\t}\r\n};\r\n\r\ntemplate <class Order>\r\nclass Logic\r\n{\r\npublic:\r\n\tLogic()\r\n\t{\r\n\t\tm_ontainer(1)(2)(4)(3);\r\n\t}\r\n\trbool checkOperation()\r\n\t{\r\n\t\tOrder::sort(m_ontainer);\r\n\t\treturn true;\r\n\t}\r\n\r\nprivate:\r\n\ttypedef MyOperation              Item;\r\n\ttypedef Container<Item>          Container;\r\n\r\n\tContainer  m_ontainer;\r\n};\r\n\r\nvoid main()\r\n{\r\n\t{\r\n\t\tLogic<OrderFIFO> logic;\r\n\t\tlogic.checkOperation();\r\n\t\tint i = 1;\r\n\t}\r\n\t{\r\n\t\tLogic<OrderLIFO> logic;\r\n\t\tlogic.checkOperation();\r\n\t\tint i = 1;\r\n\t}\r\n\t{\r\n\t\tLogic<OrderPrior> logic;\r\n\t\tlogic.checkOperation();\r\n\t\tint i = 1;\r\n\t}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <string>\n\n#include \"acmacs-base\/sfinae.hh\"\n#include \"acmacs-base\/size.hh\"\n#include \"acmacs-base\/color.hh\"\n#include \"acmacs-base\/field.hh\"\n#include \"acmacs-base\/string.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs\n{\n\n    class FontSlant\n    {\n     public:\n        enum Value { Normal, Italic };\n\n        FontSlant(Value aFontSlant = Normal) : mFontSlant{aFontSlant} {}\n        FontSlant(const FontSlant&) = default;\n        FontSlant(std::string aFontSlant) { from(aFontSlant); }\n        FontSlant(std::string_view aFontSlant) { from(aFontSlant); }\n        FontSlant(const char* aFontSlant) { from(aFontSlant); }\n        FontSlant& operator=(const FontSlant&) = default;\n        FontSlant& operator=(std::string aFontSlant) { from(aFontSlant); return *this; }\n        FontSlant& operator=(std::string_view aFontSlant) { from(aFontSlant); return *this; }\n\n        operator std::string() const\n            {\n                switch (mFontSlant) {\n                  case Normal:\n                      return \"normal\";\n                  case Italic:\n                      return \"italic\";\n                }\n                return \"normal\";\n            }\n\n        operator Value() const { return mFontSlant; }\n\n     private:\n        Value mFontSlant;\n\n        template <typename S, typename = std::enable_if_t<acmacs::sfinae::is_string_v<S>>> void from(S aFontSlant)\n            {\n                if (aFontSlant == \"normal\")\n                    mFontSlant = Normal;\n                else if (aFontSlant == \"italic\")\n                    mFontSlant = Italic;\n                else\n                    std::runtime_error(::string::concat(\"Unrecognized slant: \", aFontSlant));\n            }\n\n    }; \/\/ class FontSlant\n\n    inline std::string to_string(const FontSlant& slant) { return slant; }\n\n\/\/ ----------------------------------------------------------------------\n\n    class FontWeight\n    {\n     public:\n        enum Value { Normal, Bold };\n\n        FontWeight(Value aFontWeight = Normal) : mFontWeight{aFontWeight} {}\n        FontWeight(const FontWeight&) = default;\n        FontWeight(std::string aFontWeight) { from(aFontWeight); }\n        FontWeight(std::string_view aFontWeight) { from(aFontWeight); }\n        FontWeight(const char* aFontWeight) { from(aFontWeight); }\n        FontWeight& operator=(const FontWeight&) = default;\n        FontWeight& operator=(std::string aFontWeight) { from(aFontWeight); return *this; }\n        FontWeight& operator=(std::string_view aFontWeight) { from(aFontWeight); return *this; }\n\n        operator std::string() const\n            {\n                switch (mFontWeight) {\n                  case Normal:\n                      return \"normal\";\n                  case Bold:\n                      return \"bold\";\n                }\n                return \"normal\";\n            }\n\n        operator Value() const { return mFontWeight; }\n\n     private:\n        Value mFontWeight;\n\n        template <typename S, typename = std::enable_if_t<acmacs::sfinae::is_string_v<S>>> void from(S aFontWeight)\n            {\n                if (aFontWeight == \"normal\")\n                    mFontWeight = Normal;\n                else if (aFontWeight == \"bold\")\n                    mFontWeight = Bold;\n                else\n                    std::runtime_error(::string::concat(\"Unrecognized weight: \", aFontWeight));\n            }\n\n    }; \/\/ class FontWeight\n\n    inline std::string to_string(const FontWeight& weight) { return weight; }\n\n\/\/ ----------------------------------------------------------------------\n\n    class TextStyle\n    {\n     public:\n        template <typename T> using field = acmacs::detail::field_optional_with_default<T>;\n\n        TextStyle() = default;\n        template <typename S, typename = sfinae::string_only_t<S>> TextStyle(S font_name) : font_family{acmacs::to_string(font_name)} {}\n\n        [[nodiscard]] bool operator==(const TextStyle& ts) const\n            {\n                return slant == ts.slant && weight == ts.weight && font_family == ts.font_family;\n            }\n\n        field<FontSlant> slant;\n        field<FontWeight> weight;\n        field<std::string> font_family;\n\n    }; \/\/ class TextStyle\n\n    inline std::string to_string(const TextStyle& style)\n    {\n        return ::string::concat(\"{slant:\", to_string(*style.slant), \" weight:\", to_string(*style.weight), \" familiy:\", *style.font_family, '}');\n    }\n\n    inline std::ostream& operator<<(std::ostream& out, const TextStyle& ts) { return out << to_string(ts); }\n\n\/\/ ----------------------------------------------------------------------\n\n    class LabelStyle\n    {\n     public:\n        template <typename T> using field = acmacs::detail::field_optional_with_default<T>;\n\n        [[nodiscard]] bool operator==(const LabelStyle& ls) const\n            {\n                return shown == ls.shown && offset == ls.offset && size == ls.size && color == ls.color\n                        && rotation == ls.rotation && interline == ls.interline && style == ls.style;\n            }\n        [[nodiscard]] bool operator!=(const LabelStyle& rhs) const { return !operator==(rhs); }\n\n        field<bool> shown{true};\n        field<Offset> offset{sOffsetDefault};\n        field<Pixels> size{Pixels{10.0}};\n        field<Color> color{BLACK};\n        field<Rotation> rotation{NoRotation};\n        field<double> interline{0.2};\n        TextStyle style;\n\n     private:\n        static const Offset sOffsetDefault;\n\n    }; \/\/ class LabelStyle\n\n    inline std::string to_string(const LabelStyle& style)\n    {\n        return ::string::concat(\" shown:\", *style.shown, \" p:\", to_string(*style.offset), \" s:\", to_string(*style.size), \" c:\", to_string(*style.color), \" r:\", to_string(*style.rotation), \" i:\", to_string(*style.interline, 2), ' ', to_string(style.style));\n    }\n\n} \/\/ namespace acmacs\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>bug fix in string comparing<commit_after>#pragma once\n\n#include <string>\n\n#include \"acmacs-base\/sfinae.hh\"\n#include \"acmacs-base\/size.hh\"\n#include \"acmacs-base\/color.hh\"\n#include \"acmacs-base\/field.hh\"\n#include \"acmacs-base\/string.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs\n{\n\n    class FontSlant\n    {\n     public:\n        enum Value { Normal, Italic };\n\n        FontSlant(Value aFontSlant = Normal) : mFontSlant{aFontSlant} {}\n        FontSlant(const FontSlant&) = default;\n        FontSlant(std::string aFontSlant) { from(aFontSlant); }\n        FontSlant(std::string_view aFontSlant) { from(aFontSlant); }\n        FontSlant(const char* aFontSlant) { from(aFontSlant); }\n        FontSlant& operator=(const FontSlant&) = default;\n        FontSlant& operator=(std::string aFontSlant) { from(aFontSlant); return *this; }\n        FontSlant& operator=(std::string_view aFontSlant) { from(aFontSlant); return *this; }\n\n        operator std::string() const\n            {\n                switch (mFontSlant) {\n                  case Normal:\n                      return \"normal\";\n                  case Italic:\n                      return \"italic\";\n                }\n                return \"normal\";\n            }\n\n        operator Value() const { return mFontSlant; }\n\n     private:\n        Value mFontSlant;\n\n        template <typename S, typename = std::enable_if_t<acmacs::sfinae::is_string_v<S>>> void from(S aFontSlant)\n        {\n            const auto eq = [](auto&& lh, auto&& rh) {\n                if constexpr (std::is_same_v<std::decay_t<decltype(lh)>, const char*>)\n                    return std::string_view(lh) == rh;\n                else\n                    return lh == rh;\n            };\n\n            if (eq(aFontSlant, \"normal\"))\n                mFontSlant = Normal;\n            else if (eq(aFontSlant, \"italic\"))\n                mFontSlant = Italic;\n            else\n                std::runtime_error(::string::concat(\"Unrecognized slant: \", aFontSlant));\n        }\n\n    }; \/\/ class FontSlant\n\n    inline std::string to_string(const FontSlant& slant) { return slant; }\n\n\/\/ ----------------------------------------------------------------------\n\n    class FontWeight\n    {\n     public:\n        enum Value { Normal, Bold };\n\n        FontWeight(Value aFontWeight = Normal) : mFontWeight{aFontWeight} {}\n        FontWeight(const FontWeight&) = default;\n        FontWeight(std::string aFontWeight) { from(aFontWeight); }\n        FontWeight(std::string_view aFontWeight) { from(aFontWeight); }\n        FontWeight(const char* aFontWeight) { from(aFontWeight); }\n        FontWeight& operator=(const FontWeight&) = default;\n        FontWeight& operator=(std::string aFontWeight) { from(aFontWeight); return *this; }\n        FontWeight& operator=(std::string_view aFontWeight) { from(aFontWeight); return *this; }\n\n        operator std::string() const\n            {\n                switch (mFontWeight) {\n                  case Normal:\n                      return \"normal\";\n                  case Bold:\n                      return \"bold\";\n                }\n                return \"normal\";\n            }\n\n        operator Value() const { return mFontWeight; }\n\n     private:\n        Value mFontWeight;\n\n        template <typename S, typename = std::enable_if_t<acmacs::sfinae::is_string_v<S>>> void from(S aFontWeight)\n        {\n            const auto eq = [](auto&& lh, auto&& rh) {\n                if constexpr (std::is_same_v<std::decay_t<decltype(lh)>, const char*>)\n                    return std::string_view(lh) == rh;\n                else\n                    return lh == rh;\n            };\n\n            if (eq(aFontWeight, \"normal\"))\n                mFontWeight = Normal;\n            else if (eq(aFontWeight, \"bold\"))\n                mFontWeight = Bold;\n            else\n                std::runtime_error(::string::concat(\"Unrecognized weight: \", aFontWeight));\n        }\n\n    }; \/\/ class FontWeight\n\n    inline std::string to_string(const FontWeight& weight) { return weight; }\n\n\/\/ ----------------------------------------------------------------------\n\n    class TextStyle\n    {\n     public:\n        template <typename T> using field = acmacs::detail::field_optional_with_default<T>;\n\n        TextStyle() = default;\n        template <typename S, typename = sfinae::string_only_t<S>> TextStyle(S font_name) : font_family{acmacs::to_string(font_name)} {}\n\n        [[nodiscard]] bool operator==(const TextStyle& ts) const\n            {\n                return slant == ts.slant && weight == ts.weight && font_family == ts.font_family;\n            }\n\n        field<FontSlant> slant;\n        field<FontWeight> weight;\n        field<std::string> font_family;\n\n    }; \/\/ class TextStyle\n\n    inline std::string to_string(const TextStyle& style)\n    {\n        return ::string::concat(\"{slant:\", to_string(*style.slant), \" weight:\", to_string(*style.weight), \" familiy:\", *style.font_family, '}');\n    }\n\n    inline std::ostream& operator<<(std::ostream& out, const TextStyle& ts) { return out << to_string(ts); }\n\n\/\/ ----------------------------------------------------------------------\n\n    class LabelStyle\n    {\n     public:\n        template <typename T> using field = acmacs::detail::field_optional_with_default<T>;\n\n        [[nodiscard]] bool operator==(const LabelStyle& ls) const\n            {\n                return shown == ls.shown && offset == ls.offset && size == ls.size && color == ls.color\n                        && rotation == ls.rotation && interline == ls.interline && style == ls.style;\n            }\n        [[nodiscard]] bool operator!=(const LabelStyle& rhs) const { return !operator==(rhs); }\n\n        field<bool> shown{true};\n        field<Offset> offset{sOffsetDefault};\n        field<Pixels> size{Pixels{10.0}};\n        field<Color> color{BLACK};\n        field<Rotation> rotation{NoRotation};\n        field<double> interline{0.2};\n        TextStyle style;\n\n     private:\n        static const Offset sOffsetDefault;\n\n    }; \/\/ class LabelStyle\n\n    inline std::string to_string(const LabelStyle& style)\n    {\n        return ::string::concat(\" shown:\", *style.shown, \" p:\", to_string(*style.offset), \" s:\", to_string(*style.size), \" c:\", to_string(*style.color), \" r:\", to_string(*style.rotation), \" i:\", to_string(*style.interline, 2), ' ', to_string(style.style));\n    }\n\n} \/\/ namespace acmacs\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fixed ReadColour (must be independent from screen gfx format)<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n\nDebugRenderer debugRenderer;\n\nstatic void InitVertex(MeshVertex& v, BONE_ID boneId, DWORD color)\n{\n\tv.blendIndices.x = v.blendIndices.y = v.blendIndices.z = v.blendIndices.w = boneId;\n\tv.color = color;\n\tv.blendWeights.x = v.blendWeights.y = v.blendWeights.z = 0;\n\tv.normal.x = 1;\n\tv.normal.y = 0;\n\tv.normal.z = 0;\n\tv.uv.x = v.uv.y = 0;\n\tv.xyz.x = v.xyz.y = v.xyz.z = 0;\n}\n\nstatic inline float len(XMVECTOR v) {\n\treturn XMVectorGetX(XMVector3Length(v));\n}\n\nvoid CreateCone(Block& b, XMVECTOR v1, XMVECTOR v2, BONE_ID boneId, DWORD color)\n{\n\tfloat radius = 0.15f;\n\tXMVECTOR boneDir = XMVectorSubtract(v2, v1);\n\tXMVECTOR vRot0 = XMVector3Cross(boneDir, XMVectorSet(0, 0, radius, 0));\n\tif (len(vRot0) < 0.001f) {\n\t\tvRot0 = XMVector3Cross(boneDir, XMVectorSet(0, radius, 0, 0));\n\t}\n\tXMVECTOR vRot90 = XMVector3Cross(vRot0, XMVector3Normalize(boneDir));\n\tXMVECTOR vRotLast = XMVectorAdd(v1, vRot0);\n\tstatic const int div = 10;\n\tfor (int j = 0; j < div; j++) {\n\t\tMeshVertex vert[3];\n\t\tfor (auto& it : vert) {\n\t\t\tInitVertex(it, boneId, color);\n\t\t}\n\t\tfloat rad = XM_2PI \/ div * (j + 1);\n\t\tXMVECTOR vRot = XMVectorAdd(v1, XMVectorScale(vRot0, cosf(rad)) + XMVectorScale(vRot90, sinf(rad)));\n\t\tXMStoreFloat3(&vert[0].xyz, vRotLast);\n\t\tXMStoreFloat3(&vert[1].xyz, v2);\n\t\tXMStoreFloat3(&vert[2].xyz, vRot);\n\t\tXMVECTOR normal = XMVector3Cross(XMVectorSubtract(vRotLast, v2), XMVectorSubtract(v2, vRot));\n\t\tfor (auto& it : vert) {\n\t\t\tXMStoreFloat3(&it.normal, normal);\n\t\t\tb.vertices.push_back(it);\n\t\t\tb.indices.push_back(b.indices.size());\n\t\t}\n\t\tvRotLast = vRot;\n\t}\n}\n\nvoid DebugRenderer::CreatePivotMesh()\n{\n\tfor (BONE_ID i = 0; (unsigned)i < BONE_MAX; i++)\t{\n\t\tXMVECTOR v = XMVectorZero();\n\t\tfloat len = 50.0f;\n\t\tCreateCone(pivots, v, v + XMVectorSet(len, 0, 0, 0), i, 0xff0000ff);\n\t\tCreateCone(pivots, v, v + XMVectorSet(0, len, 0, 0), i, 0xff00ff00);\n\t\tCreateCone(pivots, v, v + XMVectorSet(0, 0, len, 0), i, 0xffff0000);\n\t}\n\n\tint sizeVertices = pivots.vertices.size() * sizeof(pivots.vertices[0]);\n\tint sizeIndices = pivots.indices.size() * sizeof(pivots.indices[0]);\n\tif (sizeVertices && sizeIndices) {\n\t\tpivotsRenderer.Init(sizeVertices, sizeIndices, &pivots.vertices[0], &pivots.indices[0]);\n\t}\n\n\tMaterial mat;\n\tmat.faceColor.x = 0.6f;\n\tmat.faceColor.y = 0.6f;\n\tmat.faceColor.z = 0.6f;\n\tmat.faceColor.w = 1.0f;\n\tmat.power = 1.0f;\n\tmat.specular.x = 1.0f;\n\tmat.specular.y = 1.0f;\n\tmat.specular.z = 1.0f;\n\tmat.specular.w = 1.0f;\n\tmat.emissive.x = 0.4f;\n\tmat.emissive.y = 0.4f;\n\tmat.emissive.z = 0.4f;\n\tmat.emissive.w = 1.0f;\n\tmat.tmid = texMan.Create(\"white.bmp\", true);\n\n\tMaterialMap map;\n\tmap.materialId = matMan.Create(mat);\n\tmap.faceStartIndex = 0;\n\tmap.faces = pivots.indices.size() \/ 3;\n\tpivots.materialMaps.push_back(map);\n}\n\nDebugRenderer::DebugRenderer()\n{\n}\n\nDebugRenderer::~DebugRenderer()\n{\n\tDestroy();\n}\n\nvoid DebugRenderer::Init()\n{\n\tCreatePivotMesh();\n}\n\nvoid DebugRenderer::DrawPivots(const XMMATRIX mat[BONE_MAX], int num)\n{\n\tint facesBackup = pivots.materialMaps.begin()->faces;\n\tpivots.materialMaps.begin()->faces = facesBackup * num \/ BONE_MAX;\n\n\tpivotsRenderer.Draw(mat, num, pivots);\n\n\tpivots.materialMaps.begin()->faces = facesBackup;\n}\n\nvoid DebugRenderer::Destroy()\n{\n\tpivotsRenderer.Destroy();\n}<commit_msg>pivots on origin<commit_after>#include \"stdafx.h\"\n\nDebugRenderer debugRenderer;\n\nstatic void InitVertex(MeshVertex& v, BONE_ID boneId, DWORD color)\n{\n\tv.blendIndices.x = v.blendIndices.y = v.blendIndices.z = v.blendIndices.w = boneId;\n\tv.color = color;\n\tv.blendWeights.x = v.blendWeights.y = v.blendWeights.z = 0;\n\tv.normal.x = 1;\n\tv.normal.y = 0;\n\tv.normal.z = 0;\n\tv.uv.x = v.uv.y = 0;\n\tv.xyz.x = v.xyz.y = v.xyz.z = 0;\n}\n\nstatic inline float len(XMVECTOR v) {\n\treturn XMVectorGetX(XMVector3Length(v));\n}\n\nvoid CreateCone(Block& b, XMVECTOR v1, XMVECTOR v2, BONE_ID boneId, DWORD color)\n{\n\tfloat radius = 0.15f;\n\tXMVECTOR boneDir = XMVectorSubtract(v2, v1);\n\tXMVECTOR vRot0 = XMVector3Cross(boneDir, XMVectorSet(0, 0, radius, 0));\n\tif (len(vRot0) < 0.001f) {\n\t\tvRot0 = XMVector3Cross(boneDir, XMVectorSet(0, radius, 0, 0));\n\t}\n\tXMVECTOR vRot90 = XMVector3Cross(vRot0, XMVector3Normalize(boneDir));\n\tXMVECTOR vRotLast = XMVectorAdd(v1, vRot0);\n\tstatic const int div = 10;\n\tfor (int j = 0; j < div; j++) {\n\t\tMeshVertex vert[3];\n\t\tfor (auto& it : vert) {\n\t\t\tInitVertex(it, boneId, color);\n\t\t}\n\t\tfloat rad = XM_2PI \/ div * (j + 1);\n\t\tXMVECTOR vRot = XMVectorAdd(v1, XMVectorScale(vRot0, cosf(rad)) + XMVectorScale(vRot90, sinf(rad)));\n\t\tXMStoreFloat3(&vert[0].xyz, vRotLast);\n\t\tXMStoreFloat3(&vert[1].xyz, v2);\n\t\tXMStoreFloat3(&vert[2].xyz, vRot);\n\t\tXMVECTOR normal = XMVector3Cross(XMVectorSubtract(vRotLast, v2), XMVectorSubtract(v2, vRot));\n\t\tfor (auto& it : vert) {\n\t\t\tXMStoreFloat3(&it.normal, normal);\n\t\t\tb.vertices.push_back(it);\n\t\t\tb.indices.push_back(b.indices.size());\n\t\t}\n\t\tvRotLast = vRot;\n\t}\n}\n\nvoid DebugRenderer::CreatePivotMesh()\n{\n\tfor (BONE_ID i = 0; (unsigned)i < BONE_MAX; i++)\t{\n\t\tXMVECTOR v = XMVectorZero();\n\t\tfloat len = 50.0f;\n\t\tCreateCone(pivots, v, v + XMVectorSet(len, 0, 0, 0), i, 0xff0000ff);\n\t\tCreateCone(pivots, v, v + XMVectorSet(0, len, 0, 0), i, 0xff00ff00);\n\t\tCreateCone(pivots, v, v + XMVectorSet(0, 0, len, 0), i, 0xffff0000);\n\t}\n\n\tint sizeVertices = pivots.vertices.size() * sizeof(pivots.vertices[0]);\n\tint sizeIndices = pivots.indices.size() * sizeof(pivots.indices[0]);\n\tif (sizeVertices && sizeIndices) {\n\t\tpivotsRenderer.Init(sizeVertices, sizeIndices, &pivots.vertices[0], &pivots.indices[0]);\n\t}\n\n\tMaterial mat;\n\tmat.faceColor.x = 0.6f;\n\tmat.faceColor.y = 0.6f;\n\tmat.faceColor.z = 0.6f;\n\tmat.faceColor.w = 1.0f;\n\tmat.power = 1.0f;\n\tmat.specular.x = 1.0f;\n\tmat.specular.y = 1.0f;\n\tmat.specular.z = 1.0f;\n\tmat.specular.w = 1.0f;\n\tmat.emissive.x = 0.4f;\n\tmat.emissive.y = 0.4f;\n\tmat.emissive.z = 0.4f;\n\tmat.emissive.w = 1.0f;\n\tmat.tmid = texMan.Create(\"white.bmp\", true);\n\n\tMaterialMap map;\n\tmap.materialId = matMan.Create(mat);\n\tmap.faceStartIndex = 0;\n\tmap.faces = pivots.indices.size() \/ 3;\n\tpivots.materialMaps.push_back(map);\n}\n\nDebugRenderer::DebugRenderer()\n{\n}\n\nDebugRenderer::~DebugRenderer()\n{\n\tDestroy();\n}\n\nvoid DebugRenderer::Init()\n{\n\tCreatePivotMesh();\n}\n\nvoid DebugRenderer::DrawPivots(const XMMATRIX mat[BONE_MAX], int num)\n{\n\tXMMATRIX mat2[BONE_MAX];\n\tfor (int i = 0; i < BONE_MAX; i++) {\n\t\tmat2[i] = i < num ? mat[i] : XMMatrixIdentity();\n\t}\n\n\tpivotsRenderer.Draw(mat2, BONE_MAX, pivots);\n}\n\nvoid DebugRenderer::Destroy()\n{\n\tpivotsRenderer.Destroy();\n}<|endoftext|>"}
{"text":"<commit_before>#include <stdlib.h>\n#include <unistd.h>\n#include <string>\n#include <cmath>\n#include <wiringSerial.h>\n\n#include \"Hardware.h\"\n\n#define LENGTH_ONE 11.5\n#define LENGTH_TWO 16.0\n\n#define I_MIN_ANG -65\n#define I_MAX_ANG 65\n#define I_MIN_VAL 0\n#define I_MAX_VAL 1023\n\n#define J_MIN_ANG 35\n#define J_MAX_ANG 180\n#define J_MIN_VAL 230\n#define J_MAX_VAL 850\n\n#define K_MIN_ANG 0\n#define K_MAX_ANG 270\n#define K_MIN_VAL 950\n#define K_MAX_VAL 20\n\n#define SPHERE_CENTER_Z -5\n#define SPHERE_RADIUS 7\n\nHardware::Hardware() {\n    fd = serialOpen(\"\/dev\/ttyAMA0\", 57600);\n}\n\nvoid Hardware::good() {\n\tsystem(\"sudo python ~\/Hardware\/ThingThree\/Code\/Dotstar\/strandtest.py 0xFF0000 1 &\");\n}\n\nvoid Hardware::bad() {\n        system(\"sudo python ~\/Hardware\/ThingThree\/Code\/Dotstar\/strandtest.py 0x00FF00  1 &\");\n}\n\nvoid Hardware::neutral() {\n\tsystem(\"sudo python ~\/Hardware\/ThingThree\/Code\/Dotstar\/strandtest.py 0x0000FF 1 &\");\n}\n\nvoid Hardware::poise() {\n\tmoveJoint(1, 512);\n\tmoveJoint(2, 860);\n\tmoveJoint(3, 960);\n}\n\nvoid Hardware::clap(int claps) {\n\tfor (int i=0; i<1+claps*2; i++) {\n\t\tgripper(i%2);\n\t\tusleep(500000);\n\t}\n}\n\nint Hardware::getServoError(int id) {\n\treturn readDxl(id,'e');\n}\n\nvoid Hardware::getSonars(int *sonarOne, int *sonarTwo) {\n\twriteCommand('R','v',128);\n\n\tstd::string val;\n\twhile (serialDataAvail(fd) > 0) val += serialGetchar(fd);\n\n\tstd::string one = str.substr(0, val.find(\"\\n\"));\n\tstd::string two = str.substr(val.find(\"\\n\"));\n\n\t*sonarOne = atoi(one.c_str());\n\t*sonarTwo = atoi(two.c_str());\n}\n\nint Hardware::readDxl(int id, char cmd) {\n\twriteCommand('R',cmd,id);\n\n\tstd::string val;\n\twhile (serialDataAvail(fd) > 0) val += serialGetchar(fd);\n\n\treturn atoi(val.c_str());\n}\n\nvoid Hardware::writeInt(int inInt) {\n\tserialPutchar(fd,inInt%256);\n\tserialPutchar(fd,inInt>>8);\n}\n\nvoid Hardware::writeCommand(char readWrite, char command, int id) {\n\tstd::string s;\n\ts += readWrite;\n\ts += command;\n\ts += static_cast<char>(id);\n\tserialPuts(fd,s.c_str());\n}\n\nvoid Hardware::setTorque(int id, int torque) {\n\twriteCommand('W','t',id);\n\twriteInt(torque);\n}\n\nvoid Hardware::setSpeed(int id, int speed) {\n\twriteCommand('W','s',id);\n\twriteInt(speed);\n}\n\n\nvoid Hardware::gripper(bool open) {\n\tif (open) {\n\t\twriteCommand('W','o',128);\n\t\twriteInt(500);\n\t} else {\n\t\twriteCommand('W','c',128);\n\t\twriteInt(500);\n\t}\n}\n\nbool Hardware::setJoints(double i, double j, double k) {\n\tdouble y, z;\n\tforwardKinematicsXY(j, k, &y, &z);\n\n\tdouble x = -y*sin(i*0.0174532925);\n\ty *= cos(i*0.0174532925);\n\n\tdouble radius = sqrt(x*x + y*y + pow(z-SPHERE_CENTER_Z,2));\n\tif (radius < SPHERE_RADIUS) return false;\n\n\tint iVal, jVal, kVal;\n\tscaleServos(i, j, k, &iVal, &jVal, &kVal);\n\tmoveJoint(1,iVal);\n\tmoveJoint(2,jVal);\n\tmoveJoint(3,kVal);\n\n\treturn true;\n}\n\nbool Hardware::setEffectorPosition(double theta, double x, double y) {\n\tdouble theta1, theta2;\n\tinverseKinematicsXY(x, y, &theta1, &theta2);\n\n\treturn setJoints(theta,theta1,theta2);\n}\n\nvoid Hardware::moveJoint(int id, int position) {\n\twriteCommand('W','p',id);\n\twriteInt(position);\n}\n\ndouble Hardware::map(double x, double in_min, double in_max, double out_min, double out_max) {\n  return (x - in_min) * (out_max - out_min) \/ (in_max - in_min) + out_min;\n}\n\nvoid Hardware::scaleServos(double iAng, double jAng, double kAng, int *iVal, int *jVal, int *kVal) {\n\t*iVal = round(map(iAng,I_MIN_ANG,I_MAX_ANG,I_MIN_VAL,I_MAX_VAL));\n\t*jVal = round(map(jAng,J_MIN_ANG,J_MAX_ANG,J_MIN_VAL,J_MAX_VAL));\n\t*kVal = round(map(kAng,K_MIN_ANG,K_MAX_ANG,K_MIN_VAL,K_MAX_VAL));\n}\n\nvoid Hardware::forwardKinematicsXY(double theta1, double theta2, double *x, double *y) {\n\tdouble theta3 = theta2 - (180 - theta1);\n\t*x = LENGTH_ONE*cos(theta1*0.0174533) + LENGTH_TWO*cos(theta3*0.0174533);\n\t*y = LENGTH_ONE*sin(theta1*0.0174533) + LENGTH_TWO*sin(theta3*0.0174533);\n}\n\nvoid Hardware::inverseKinematicsXY(double x, double y, double *theta1, double *theta2) {\n\tdouble hypo = sqrt(pow(x,2) + pow(y,2));\n\tdouble q1 = atan2(y,x);\n\tdouble q2 = acos((pow(LENGTH_ONE,2) - pow(LENGTH_TWO,2) + pow(hypo,2))\n\t\t\t\t\t\/(2.0*LENGTH_ONE*hypo));\n\n\t*theta1 = q1 + q2;\n\t*theta2 = acos((pow(LENGTH_ONE,2) + pow(LENGTH_TWO,2) - pow(hypo,2))\n\t\t\t\t  \/(2.0*LENGTH_ONE*LENGTH_TWO));\n\n\t*theta1 *= 180.0\/3.14159265;\n\t*theta2 *= 180.0\/3.14159265;\n}\n\nHardware::~Hardware() {\n\tserialClose(fd);\n}\n<commit_msg>fix typo<commit_after>#include <stdlib.h>\n#include <unistd.h>\n#include <string>\n#include <cmath>\n#include <wiringSerial.h>\n\n#include \"Hardware.h\"\n\n#define LENGTH_ONE 11.5\n#define LENGTH_TWO 16.0\n\n#define I_MIN_ANG -65\n#define I_MAX_ANG 65\n#define I_MIN_VAL 0\n#define I_MAX_VAL 1023\n\n#define J_MIN_ANG 35\n#define J_MAX_ANG 180\n#define J_MIN_VAL 230\n#define J_MAX_VAL 850\n\n#define K_MIN_ANG 0\n#define K_MAX_ANG 270\n#define K_MIN_VAL 950\n#define K_MAX_VAL 20\n\n#define SPHERE_CENTER_Z -5\n#define SPHERE_RADIUS 7\n\nHardware::Hardware() {\n    fd = serialOpen(\"\/dev\/ttyAMA0\", 57600);\n}\n\nvoid Hardware::good() {\n\tsystem(\"sudo python ~\/Hardware\/ThingThree\/Code\/Dotstar\/strandtest.py 0xFF0000 1 &\");\n}\n\nvoid Hardware::bad() {\n        system(\"sudo python ~\/Hardware\/ThingThree\/Code\/Dotstar\/strandtest.py 0x00FF00  1 &\");\n}\n\nvoid Hardware::neutral() {\n\tsystem(\"sudo python ~\/Hardware\/ThingThree\/Code\/Dotstar\/strandtest.py 0x0000FF 1 &\");\n}\n\nvoid Hardware::poise() {\n\tmoveJoint(1, 512);\n\tmoveJoint(2, 860);\n\tmoveJoint(3, 960);\n}\n\nvoid Hardware::clap(int claps) {\n\tfor (int i=0; i<1+claps*2; i++) {\n\t\tgripper(i%2);\n\t\tusleep(500000);\n\t}\n}\n\nint Hardware::getServoError(int id) {\n\treturn readDxl(id,'e');\n}\n\nvoid Hardware::getSonars(int *sonarOne, int *sonarTwo) {\n\twriteCommand('R','v',128);\n\n\tstd::string val;\n\twhile (serialDataAvail(fd) > 0) val += serialGetchar(fd);\n\n\tstd::string one = val.substr(0, val.find(\"\\n\"));\n\tstd::string two = val.substr(val.find(\"\\n\"));\n\n\t*sonarOne = atoi(one.c_str());\n\t*sonarTwo = atoi(two.c_str());\n}\n\nint Hardware::readDxl(int id, char cmd) {\n\twriteCommand('R',cmd,id);\n\n\tstd::string val;\n\twhile (serialDataAvail(fd) > 0) val += serialGetchar(fd);\n\n\treturn atoi(val.c_str());\n}\n\nvoid Hardware::writeInt(int inInt) {\n\tserialPutchar(fd,inInt%256);\n\tserialPutchar(fd,inInt>>8);\n}\n\nvoid Hardware::writeCommand(char readWrite, char command, int id) {\n\tstd::string s;\n\ts += readWrite;\n\ts += command;\n\ts += static_cast<char>(id);\n\tserialPuts(fd,s.c_str());\n}\n\nvoid Hardware::setTorque(int id, int torque) {\n\twriteCommand('W','t',id);\n\twriteInt(torque);\n}\n\nvoid Hardware::setSpeed(int id, int speed) {\n\twriteCommand('W','s',id);\n\twriteInt(speed);\n}\n\n\nvoid Hardware::gripper(bool open) {\n\tif (open) {\n\t\twriteCommand('W','o',128);\n\t\twriteInt(500);\n\t} else {\n\t\twriteCommand('W','c',128);\n\t\twriteInt(500);\n\t}\n}\n\nbool Hardware::setJoints(double i, double j, double k) {\n\tdouble y, z;\n\tforwardKinematicsXY(j, k, &y, &z);\n\n\tdouble x = -y*sin(i*0.0174532925);\n\ty *= cos(i*0.0174532925);\n\n\tdouble radius = sqrt(x*x + y*y + pow(z-SPHERE_CENTER_Z,2));\n\tif (radius < SPHERE_RADIUS) return false;\n\n\tint iVal, jVal, kVal;\n\tscaleServos(i, j, k, &iVal, &jVal, &kVal);\n\tmoveJoint(1,iVal);\n\tmoveJoint(2,jVal);\n\tmoveJoint(3,kVal);\n\n\treturn true;\n}\n\nbool Hardware::setEffectorPosition(double theta, double x, double y) {\n\tdouble theta1, theta2;\n\tinverseKinematicsXY(x, y, &theta1, &theta2);\n\n\treturn setJoints(theta,theta1,theta2);\n}\n\nvoid Hardware::moveJoint(int id, int position) {\n\twriteCommand('W','p',id);\n\twriteInt(position);\n}\n\ndouble Hardware::map(double x, double in_min, double in_max, double out_min, double out_max) {\n  return (x - in_min) * (out_max - out_min) \/ (in_max - in_min) + out_min;\n}\n\nvoid Hardware::scaleServos(double iAng, double jAng, double kAng, int *iVal, int *jVal, int *kVal) {\n\t*iVal = round(map(iAng,I_MIN_ANG,I_MAX_ANG,I_MIN_VAL,I_MAX_VAL));\n\t*jVal = round(map(jAng,J_MIN_ANG,J_MAX_ANG,J_MIN_VAL,J_MAX_VAL));\n\t*kVal = round(map(kAng,K_MIN_ANG,K_MAX_ANG,K_MIN_VAL,K_MAX_VAL));\n}\n\nvoid Hardware::forwardKinematicsXY(double theta1, double theta2, double *x, double *y) {\n\tdouble theta3 = theta2 - (180 - theta1);\n\t*x = LENGTH_ONE*cos(theta1*0.0174533) + LENGTH_TWO*cos(theta3*0.0174533);\n\t*y = LENGTH_ONE*sin(theta1*0.0174533) + LENGTH_TWO*sin(theta3*0.0174533);\n}\n\nvoid Hardware::inverseKinematicsXY(double x, double y, double *theta1, double *theta2) {\n\tdouble hypo = sqrt(pow(x,2) + pow(y,2));\n\tdouble q1 = atan2(y,x);\n\tdouble q2 = acos((pow(LENGTH_ONE,2) - pow(LENGTH_TWO,2) + pow(hypo,2))\n\t\t\t\t\t\/(2.0*LENGTH_ONE*hypo));\n\n\t*theta1 = q1 + q2;\n\t*theta2 = acos((pow(LENGTH_ONE,2) + pow(LENGTH_TWO,2) - pow(hypo,2))\n\t\t\t\t  \/(2.0*LENGTH_ONE*LENGTH_TWO));\n\n\t*theta1 *= 180.0\/3.14159265;\n\t*theta2 *= 180.0\/3.14159265;\n}\n\nHardware::~Hardware() {\n\tserialClose(fd);\n}\n<|endoftext|>"}
{"text":"<commit_before>\r\n#include <cassert>\r\n#include <type_traits>\r\n\r\n#include <QMap>\r\n#include <QDebug>\r\n#include <QImage>\r\n#include <QFile>\r\n#include <QDataStream>\r\n#include <QFileInfo>\r\n#include <QStringList>\r\n\r\n#include <QCoreApplication>\r\n\r\n#include <version.h>\r\n\r\n\r\nenum Format\r\n{\r\n    GL_RED\r\n,   GL_RG\r\n,   GL_RGB\r\n,   GL_BGR\r\n,   GL_RGBA\r\n,   GL_BGRA\r\n,   GL_STENCIL_INDEX\r\n,   GL_DEPTH_COMPONENT\r\n,   GL_DEPTH_STENCIL\r\n};\r\n\r\nenum Type\r\n{\r\n    GL_UNSIGNED_BYTE\r\n,   GL_BYTE\r\n,   GL_UNSIGNED_SHORT\r\n,   GL_SHORT\r\n,   GL_UNSIGNED_INT\r\n,   GL_INT\r\n,   GL_FLOAT\r\n};\r\n\r\n\r\nQMap<QString, Format> g_formats;\r\nQMap<QString, Type> g_types;\r\nQVector<QString> g_options;\r\nQStringList g_manuals;\r\nQStringList g_versions;\r\n\r\nvoid initialize()\r\n{\r\n    g_formats[\"GL_RED\"] = GL_RED;\r\n    g_formats[\"GL_RG\"] = GL_RG;\r\n    g_formats[\"GL_RGB\"] = GL_RGB;\r\n    g_formats[\"GL_BGR\"] = GL_BGR;\r\n    g_formats[\"GL_RGBA\"] = GL_RGBA;\r\n    g_formats[\"GL_BGRA\"] = GL_BGRA;\r\n    \/\/g_formats[\"GL_STENCIL_INDEX\"] = GL_STENCIL_INDEX;\r\n    \/\/g_formats[\"GL_DEPTH_COMPONENT\"] = GL_DEPTH_COMPONENT;\r\n    \/\/g_formats[\"GL_DEPTH_STENCIL\"] = GL_DEPTH_STENCIL;\r\n\r\n    g_types[\"GL_UNSIGNED_BYTE\"] = GL_UNSIGNED_BYTE;\r\n    g_types[\"GL_BYTE\"] = GL_BYTE;\r\n    g_types[\"GL_UNSIGNED_SHORT\"] = GL_UNSIGNED_SHORT;\r\n    g_types[\"GL_SHORT\"] = GL_SHORT;\r\n    g_types[\"GL_UNSIGNED_INT\"] = GL_UNSIGNED_INT;\r\n    g_types[\"GL_INT\"] = GL_INT;\r\n    g_types[\"GL_FLOAT\"] = GL_FLOAT;\r\n\r\n    g_options << \"--mirror-horizontal\"  << \"-mh\" ;\r\n    g_options << \"--mirror-vertical\"    << \"-mv\" ;\r\n    g_options << \"--as-bgr\"             << \"-bgr\";\r\n\r\n    g_manuals  << \"--help\" << \"-h\" << \"\/?\";\r\n    g_versions << \"--version\" << \"-v\";\r\n}\r\n\r\nstatic const int option_mh  = 0;\r\nstatic const int option_mv  = 2;\r\nstatic const int option_bgr = 4;\r\n\r\nvoid man()\r\n{\r\n    qDebug() << \"\";\r\n    qDebug() << GLRAW_PROJECT_NAME << GLRAW_VERSION << \"by\" << GLRAW_AUTHOR_ORGANIZATION;\r\n    qDebug() << \"Converts an input image to an OpenGL compatible format.\";\r\n    qDebug() << \"\";\r\n    qDebug() << \"usage: glraw <Target-Format> <Target-Type> [<Options>] <Input-FilePath>\";\r\n    qDebug() << \"\";\r\n    qDebug() << \"<Target-Formats>:\";\r\n    qDebug().nospace() << \"  \" << qPrintable(QStringList(g_formats.keys()).join(\"\\n  \"));\r\n    qDebug() << \"\";\r\n    qDebug() << \"<Target-Types>:\";\r\n    qDebug().nospace() << \"  \" << qPrintable(QStringList(g_types.keys()).join(\"\\n  \"));\r\n    qDebug() << \"\";\r\n    qDebug() << \"<Options>:\";\r\n    qDebug().nospace() << \"  \" << qPrintable(g_options[option_mh])  << \" (\" << qPrintable(g_options[option_mh + 1])  << \")\";\r\n    qDebug().nospace() << \"  \" << qPrintable(g_options[option_mv])  << \" (\" << qPrintable(g_options[option_mv + 1])  << \")\";\r\n    qDebug().nospace() << \"  \" << qPrintable(g_options[option_bgr]) << \" (\" << qPrintable(g_options[option_bgr + 1]) << \")\";\r\n    qDebug() << \"\";\r\n}\r\n\r\nvoid version()\r\n{\r\n    qDebug() << GLRAW_PROJECT_NAME << GLRAW_VERSION;\r\n    qDebug() << \"\";\r\n}\r\n\r\ntemplate<typename T>\r\nvoid write(\r\n    QDataStream & output\r\n,   const QImage & image\r\n,   const Format format)\r\n{\r\n    const bool r = (GL_RED == format || GL_RG == format || GL_RGB == format || GL_RGBA == format || GL_BGR == format || GL_BGRA == format);\r\n    const bool g = (GL_RG == format || GL_RGB == format || GL_RGBA == format || GL_BGR == format || GL_BGRA == format);\r\n    const bool b = (GL_RGB == format || GL_RGBA == format || GL_BGR == format || GL_BGRA == format);\r\n    const bool a = (GL_RGBA == format || GL_BGRA == format);\r\n\r\n    const bool grayscale = (GL_DEPTH_COMPONENT == format || GL_DEPTH_STENCIL == format || GL_STENCIL_INDEX == format);\r\n\r\n    const int w = image.width();\r\n    const int h = image.height();\r\n    const int s = w * h;\r\n\r\n    const float scale = std::is_same<T, float>::value ? 1.f \/ 255.f : 1.f;\r\n\r\n    assert(image.byteCount() == s * 4);\r\n    for(int i = 0; i < s * 4; i += 4)\r\n    {\r\n        if (r)\r\n            output << static_cast<T>(scale * image.constBits()[i + 0]);\r\n        if (g)\r\n            output << static_cast<T>(scale * image.constBits()[i + 1]);\r\n        if (b)\r\n            output << static_cast<T>(scale * image.constBits()[i + 2]);\r\n        if (a)\r\n            output << static_cast<T>(scale * image.constBits()[i + 3]);\r\n    }\r\n}\r\n\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n    QCoreApplication a(argc, argv);\r\n\r\n    initialize();\r\n\r\n    if (a.arguments().size() == 1 || g_manuals.contains(a.arguments()[1]))\r\n    {\r\n        man();\r\n        return 0;\r\n    }\r\n\r\n    if (g_versions.contains(a.arguments()[1]))\r\n    {\r\n        version();\r\n        return 0;\r\n    }\r\n\r\n    const QString farg = a.arguments()[1];\r\n    if(!g_formats.contains(farg))\r\n    {\r\n        qWarning() << \"Unknown Target-Format\" << qPrintable(farg) << \".\";\r\n        return 0;\r\n    }\r\n    const Format format = g_formats[farg];\r\n\r\n\r\n    const QString targ = a.arguments()[2];\r\n    if(!g_types.contains(targ))\r\n    {\r\n        qWarning() << \"Unknown Target-Type\" << qPrintable(targ) << \".\";\r\n        return 0;\r\n    }\r\n    const Type type = g_types[targ];\r\n\r\n    const QStringList args(a.arguments());\r\n\r\n    const bool mh  = args.contains(g_options[option_mh])  || args.contains(g_options[option_mh + 1]);\r\n    const bool mv  = args.contains(g_options[option_mv])  || args.contains(g_options[option_mv + 1]);\r\n    const bool bgr = args.contains(g_options[option_bgr]) || args.contains(g_options[option_bgr + 1]);\r\n\r\n    \/\/ catch unknown args\r\n\r\n    QStringList unknowns;\r\n    for (int i = 1; i < args.size() - 1; ++i)\r\n    {\r\n        if (!g_options.contains(args[i]) && !g_formats.contains(args[i]) && !g_types.contains(args[i]))\r\n            unknowns << args[i];\r\n    }\r\n    if (!unknowns.isEmpty())\r\n        qWarning() << \"The following unknown arguments will be ignored:\" << unknowns.join(\", \");\r\n\r\n    const QString iarg = a.arguments().last();\r\n\r\n    if(!QFile::exists(iarg))\r\n    {\r\n        qDebug() << \"Input file does not exist.\";\r\n        return 0;\r\n    }\r\n\r\n\r\n    QImage image(iarg);\r\n    if(image.isNull())\r\n    {\r\n        qDebug() << \"Loading file from input file failed.\";\r\n        return 0;\r\n    }\r\n\r\n    \/\/ file name\r\n\r\n    QMap<Format, QString> formatSuffixes;\r\n    formatSuffixes[GL_RED]  = \"r\";\r\n    formatSuffixes[GL_RG]   = \"rg\";\r\n    formatSuffixes[GL_RGB]  = \"rgb\";\r\n    formatSuffixes[GL_BGR]  = \"bgr\";\r\n    formatSuffixes[GL_RGBA] = \"rgba\";\r\n    formatSuffixes[GL_BGRA] = \"bgra\";\r\n\r\n    QMap<Type, QString> typeSuffixes;\r\n    typeSuffixes[GL_UNSIGNED_BYTE]  = \"ub\";\r\n    typeSuffixes[GL_BYTE]           = \"b\";\r\n    typeSuffixes[GL_UNSIGNED_SHORT] = \"us\";\r\n    typeSuffixes[GL_SHORT]          = \"s\";\r\n    typeSuffixes[GL_UNSIGNED_INT]   = \"ui\";\r\n    typeSuffixes[GL_INT]            = \"i\";\r\n    typeSuffixes[GL_FLOAT]          = \"f\";\r\n\r\n    const QString suffixes = QString(\".%1.%2.%3.%4.raw\")\r\n            .arg(image.width())\r\n            .arg(image.height())\r\n            .arg(formatSuffixes[format])\r\n            .arg(typeSuffixes[type]);\r\n\r\n    QFileInfo fi(iarg);\r\n\r\n    const QString target = fi.absolutePath() + \"\/\" + fi.baseName() + suffixes;\r\n\r\n    \/\/ prepare ?\r\n\r\n    if (GL_BGR != format && GL_BGRA != format)\r\n        image = image.rgbSwapped();\r\n\r\n    image = image.mirrored(mh, !mv);\r\n\r\n\r\n    \/\/ write\r\n\r\n    QFile file(target);\r\n    if(!file.open(QIODevice::WriteOnly))\r\n    {\r\n        qDebug() << \"Opening file\" << target << \"failed.\";\r\n        return 0;\r\n    }\r\n\r\n    QDataStream output(&file);\r\n\r\n    switch(type)\r\n    {\r\n    case GL_UNSIGNED_BYTE:\r\n        write<unsigned char>(output, image, format);\r\n        break;\r\n    case GL_BYTE:\r\n        write<char>(output, image, format);\r\n        break;\r\n    case GL_UNSIGNED_SHORT:\r\n        write<unsigned short>(output, image, format);\r\n        break;\r\n    case GL_SHORT:\r\n        write<short>(output, image, format);\r\n        break;\r\n    case GL_UNSIGNED_INT:\r\n        write<unsigned int>(output, image, format);\r\n        break;\r\n    case GL_INT:\r\n        write<int>(output, image, format);\r\n        break;\r\n    case GL_FLOAT:\r\n        write<float>(output, image, format);\r\n        break;\r\n    default:\r\n        qWarning() << \"Should not happen :P.\";\r\n        break;\r\n    }\r\n\r\n    file.close();\r\n\r\n    qDebug() << qPrintable(target) << \"created.\";\r\n    return 1;\r\n}\r\n\r\n<commit_msg>add quiet option close #1<commit_after>\r\n#include <cassert>\r\n#include <type_traits>\r\n\r\n#include <QMap>\r\n#include <QDebug>\r\n#include <QImage>\r\n#include <QFile>\r\n#include <QDataStream>\r\n#include <QFileInfo>\r\n#include <QStringList>\r\n\r\n#include <QCoreApplication>\r\n\r\n#include <version.h>\r\n\r\n\r\nenum Format\r\n{\r\n    GL_RED\r\n,   GL_RG\r\n,   GL_RGB\r\n,   GL_BGR\r\n,   GL_RGBA\r\n,   GL_BGRA\r\n,   GL_STENCIL_INDEX\r\n,   GL_DEPTH_COMPONENT\r\n,   GL_DEPTH_STENCIL\r\n};\r\n\r\nenum Type\r\n{\r\n    GL_UNSIGNED_BYTE\r\n,   GL_BYTE\r\n,   GL_UNSIGNED_SHORT\r\n,   GL_SHORT\r\n,   GL_UNSIGNED_INT\r\n,   GL_INT\r\n,   GL_FLOAT\r\n};\r\n\r\n\r\nQMap<QString, Format> g_formats;\r\nQMap<QString, Type> g_types;\r\nQVector<QString> g_options;\r\nQStringList g_manuals;\r\nQStringList g_versions;\r\n\r\nvoid initialize()\r\n{\r\n    g_formats[\"GL_RED\"] = GL_RED;\r\n    g_formats[\"GL_RG\"] = GL_RG;\r\n    g_formats[\"GL_RGB\"] = GL_RGB;\r\n    g_formats[\"GL_BGR\"] = GL_BGR;\r\n    g_formats[\"GL_RGBA\"] = GL_RGBA;\r\n    g_formats[\"GL_BGRA\"] = GL_BGRA;\r\n    \/\/g_formats[\"GL_STENCIL_INDEX\"] = GL_STENCIL_INDEX;\r\n    \/\/g_formats[\"GL_DEPTH_COMPONENT\"] = GL_DEPTH_COMPONENT;\r\n    \/\/g_formats[\"GL_DEPTH_STENCIL\"] = GL_DEPTH_STENCIL;\r\n\r\n    g_types[\"GL_UNSIGNED_BYTE\"] = GL_UNSIGNED_BYTE;\r\n    g_types[\"GL_BYTE\"] = GL_BYTE;\r\n    g_types[\"GL_UNSIGNED_SHORT\"] = GL_UNSIGNED_SHORT;\r\n    g_types[\"GL_SHORT\"] = GL_SHORT;\r\n    g_types[\"GL_UNSIGNED_INT\"] = GL_UNSIGNED_INT;\r\n    g_types[\"GL_INT\"] = GL_INT;\r\n    g_types[\"GL_FLOAT\"] = GL_FLOAT;\r\n\r\n    g_options << \"--mirror-horizontal\"  << \"-mh\" ;\r\n    g_options << \"--mirror-vertical\"    << \"-mv\" ;\r\n    g_options << \"--as-bgr\"             << \"-bgr\";\r\n    g_options << \"--quiet\"              << \"-q\";\r\n\r\n    g_manuals  << \"--help\" << \"-h\" << \"\/?\";\r\n    g_versions << \"--version\" << \"-v\";\r\n}\r\n\r\nstatic const int option_mh  = 0;\r\nstatic const int option_mv  = 2;\r\nstatic const int option_bgr = 4;\r\nstatic const int option_q   = 6;\r\n\r\nvoid man()\r\n{\r\n    qDebug() << \"\";\r\n    qDebug() << GLRAW_PROJECT_NAME << GLRAW_VERSION << \"by\" << GLRAW_AUTHOR_ORGANIZATION;\r\n    qDebug() << \"Converts an input image to an OpenGL compatible format.\";\r\n    qDebug() << \"\";\r\n    qDebug() << \"usage: glraw <Target-Format> <Target-Type> [<Options>] <Input-FilePath>\";\r\n    qDebug() << \"\";\r\n    qDebug() << \"<Target-Formats>:\";\r\n    qDebug().nospace() << \"  \" << qPrintable(QStringList(g_formats.keys()).join(\"\\n  \"));\r\n    qDebug() << \"\";\r\n    qDebug() << \"<Target-Types>:\";\r\n    qDebug().nospace() << \"  \" << qPrintable(QStringList(g_types.keys()).join(\"\\n  \"));\r\n    qDebug() << \"\";\r\n    qDebug() << \"<Options>:\";\r\n    qDebug().nospace() << \"  \" << qPrintable(g_options[option_mh])  << \" (\" << qPrintable(g_options[option_mh + 1])  << \")\";\r\n    qDebug().nospace() << \"  \" << qPrintable(g_options[option_mv])  << \" (\" << qPrintable(g_options[option_mv + 1])  << \")\";\r\n    qDebug().nospace() << \"  \" << qPrintable(g_options[option_bgr]) << \" (\" << qPrintable(g_options[option_bgr + 1]) << \")\";\r\n    qDebug().nospace() << \"  \" << qPrintable(g_options[option_q])   << \" (\" << qPrintable(g_options[option_q + 1])   << \")\";\r\n    qDebug() << \"\";\r\n}\r\n\r\nvoid version()\r\n{\r\n    qDebug() << GLRAW_PROJECT_NAME << GLRAW_VERSION;\r\n    qDebug() << \"\";\r\n}\r\n\r\nvoid quietMessageHandler(QtMsgType, const QMessageLogContext &, const QString &)\r\n{\r\n}\r\n\r\ntemplate<typename T>\r\nvoid write(\r\n    QDataStream & output\r\n,   const QImage & image\r\n,   const Format format)\r\n{\r\n    const bool r = (GL_RED == format || GL_RG == format || GL_RGB == format || GL_RGBA == format || GL_BGR == format || GL_BGRA == format);\r\n    const bool g = (GL_RG == format || GL_RGB == format || GL_RGBA == format || GL_BGR == format || GL_BGRA == format);\r\n    const bool b = (GL_RGB == format || GL_RGBA == format || GL_BGR == format || GL_BGRA == format);\r\n    const bool a = (GL_RGBA == format || GL_BGRA == format);\r\n\r\n    const bool grayscale = (GL_DEPTH_COMPONENT == format || GL_DEPTH_STENCIL == format || GL_STENCIL_INDEX == format);\r\n\r\n    const int w = image.width();\r\n    const int h = image.height();\r\n    const int s = w * h;\r\n\r\n    const float scale = std::is_same<T, float>::value ? 1.f \/ 255.f : 1.f;\r\n\r\n    assert(image.byteCount() == s * 4);\r\n    for(int i = 0; i < s * 4; i += 4)\r\n    {\r\n        if (r)\r\n            output << static_cast<T>(scale * image.constBits()[i + 0]);\r\n        if (g)\r\n            output << static_cast<T>(scale * image.constBits()[i + 1]);\r\n        if (b)\r\n            output << static_cast<T>(scale * image.constBits()[i + 2]);\r\n        if (a)\r\n            output << static_cast<T>(scale * image.constBits()[i + 3]);\r\n    }\r\n}\r\n\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n    QCoreApplication a(argc, argv);\r\n\r\n    initialize();\r\n\r\n    if (a.arguments().size() == 1 || g_manuals.contains(a.arguments()[1]))\r\n    {\r\n        man();\r\n        return 0;\r\n    }\r\n\r\n    if (g_versions.contains(a.arguments()[1]))\r\n    {\r\n        version();\r\n        return 0;\r\n    }\r\n\r\n    if (a.arguments().contains(g_options[option_q]) || a.arguments().contains(g_options[option_q + 1]))\r\n        qInstallMessageHandler(quietMessageHandler);\r\n\r\n    const QString farg = a.arguments()[1];\r\n    if(!g_formats.contains(farg))\r\n    {\r\n        qWarning() << \"Unknown Target-Format\" << qPrintable(farg) << \".\";\r\n        return 0;\r\n    }\r\n    const Format format = g_formats[farg];\r\n\r\n\r\n    const QString targ = a.arguments()[2];\r\n    if(!g_types.contains(targ))\r\n    {\r\n        qWarning() << \"Unknown Target-Type\" << qPrintable(targ) << \".\";\r\n        return 0;\r\n    }\r\n    const Type type = g_types[targ];\r\n\r\n    const QStringList args(a.arguments());\r\n\r\n    const bool mh  = args.contains(g_options[option_mh])  || args.contains(g_options[option_mh + 1]);\r\n    const bool mv  = args.contains(g_options[option_mv])  || args.contains(g_options[option_mv + 1]);\r\n    const bool bgr = args.contains(g_options[option_bgr]) || args.contains(g_options[option_bgr + 1]);\r\n\r\n    \/\/ catch unknown args\r\n\r\n    QStringList unknowns;\r\n    for (int i = 1; i < args.size() - 1; ++i)\r\n    {\r\n        if (!g_options.contains(args[i]) && !g_formats.contains(args[i]) && !g_types.contains(args[i]))\r\n            unknowns << args[i];\r\n    }\r\n    if (!unknowns.isEmpty())\r\n        qWarning() << \"The following unknown arguments will be ignored:\" << unknowns.join(\", \");\r\n\r\n    const QString iarg = a.arguments().last();\r\n\r\n    if(!QFile::exists(iarg))\r\n    {\r\n        qDebug() << \"Input file does not exist.\";\r\n        return 0;\r\n    }\r\n\r\n\r\n    QImage image(iarg);\r\n    if(image.isNull())\r\n    {\r\n        qDebug() << \"Loading file from input file failed.\";\r\n        return 0;\r\n    }\r\n\r\n    \/\/ file name\r\n\r\n    QMap<Format, QString> formatSuffixes;\r\n    formatSuffixes[GL_RED]  = \"r\";\r\n    formatSuffixes[GL_RG]   = \"rg\";\r\n    formatSuffixes[GL_RGB]  = \"rgb\";\r\n    formatSuffixes[GL_BGR]  = \"bgr\";\r\n    formatSuffixes[GL_RGBA] = \"rgba\";\r\n    formatSuffixes[GL_BGRA] = \"bgra\";\r\n\r\n    QMap<Type, QString> typeSuffixes;\r\n    typeSuffixes[GL_UNSIGNED_BYTE]  = \"ub\";\r\n    typeSuffixes[GL_BYTE]           = \"b\";\r\n    typeSuffixes[GL_UNSIGNED_SHORT] = \"us\";\r\n    typeSuffixes[GL_SHORT]          = \"s\";\r\n    typeSuffixes[GL_UNSIGNED_INT]   = \"ui\";\r\n    typeSuffixes[GL_INT]            = \"i\";\r\n    typeSuffixes[GL_FLOAT]          = \"f\";\r\n\r\n    const QString suffixes = QString(\".%1.%2.%3.%4.raw\")\r\n            .arg(image.width())\r\n            .arg(image.height())\r\n            .arg(formatSuffixes[format])\r\n            .arg(typeSuffixes[type]);\r\n\r\n    QFileInfo fi(iarg);\r\n\r\n    const QString target = fi.absolutePath() + \"\/\" + fi.baseName() + suffixes;\r\n\r\n    \/\/ prepare ?\r\n\r\n    if (GL_BGR != format && GL_BGRA != format)\r\n        image = image.rgbSwapped();\r\n\r\n    image = image.mirrored(mh, !mv);\r\n\r\n\r\n    \/\/ write\r\n\r\n    QFile file(target);\r\n    if(!file.open(QIODevice::WriteOnly))\r\n    {\r\n        qDebug() << \"Opening file\" << target << \"failed.\";\r\n        return 0;\r\n    }\r\n\r\n    QDataStream output(&file);\r\n\r\n    switch(type)\r\n    {\r\n    case GL_UNSIGNED_BYTE:\r\n        write<unsigned char>(output, image, format);\r\n        break;\r\n    case GL_BYTE:\r\n        write<char>(output, image, format);\r\n        break;\r\n    case GL_UNSIGNED_SHORT:\r\n        write<unsigned short>(output, image, format);\r\n        break;\r\n    case GL_SHORT:\r\n        write<short>(output, image, format);\r\n        break;\r\n    case GL_UNSIGNED_INT:\r\n        write<unsigned int>(output, image, format);\r\n        break;\r\n    case GL_INT:\r\n        write<int>(output, image, format);\r\n        break;\r\n    case GL_FLOAT:\r\n        write<float>(output, image, format);\r\n        break;\r\n    default:\r\n        qWarning() << \"Should not happen :P.\";\r\n        break;\r\n    }\r\n\r\n    file.close();\r\n\r\n    qDebug() << qPrintable(target) << \"created.\";\r\n    return 1;\r\n}\r\n\r\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\/\/ Base class for the chassis vehicle subsystem.\n\/\/\n\/\/ =============================================================================\n\n#include \"chrono\/assets\/ChSphereShape.h\"\n\n#include \"chrono_vehicle\/ChChassis.h\"\n\nnamespace chrono {\nnamespace vehicle {\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nChChassis::ChChassis(const std::string& name, bool fixed) : ChPart(name), m_fixed(fixed) {}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nChVector<> ChChassis::GetPointAcceleration(const ChVector<>& locpos) const {\n    ChVector<> acc_abs = m_body->GetFrame_REF_to_abs().PointAccelerationLocalToParent(locpos);\n    return m_body->GetFrame_REF_to_abs().TransformDirectionParentToLocal(acc_abs);\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ Return the global driver position\n\/\/ -----------------------------------------------------------------------------\nChVector<> ChChassis::GetDriverPos() const {\n    return m_body->GetCoord().TransformPointLocalToParent(GetLocalDriverCoordsys().pos);\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nvoid ChChassis::Initialize(ChSystem* system, const ChCoordsys<>& chassisPos, double chassisFwdVel) {\n    m_body = std::shared_ptr<ChBodyAuxRef>(system->NewBodyAuxRef());\n    m_body->SetIdentifier(0);\n    m_body->SetName(\"chassis\");\n    m_body->SetMass(GetMass());\n    m_body->SetFrame_COG_to_REF(ChFrame<>(GetLocalPosCOM(), ChQuaternion<>(1, 0, 0, 0)));\n    m_body->SetInertia(GetInertia());\n    m_body->SetBodyFixed(m_fixed);\n\n    m_body->SetFrame_REF_to_abs(ChFrame<>(chassisPos));\n    m_body->SetPos_dt(chassisFwdVel * chassisPos.TransformDirectionLocalToParent(ChVector<>(1, 0, 0)));\n\n    system->Add(m_body);\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nvoid ChChassis::AddVisualizationAssets(VisualizationType vis) {\n    if (vis == VisualizationType::NONE)\n        return;\n\n    auto sphere = std::make_shared<ChSphereShape>();\n    sphere->GetSphereGeometry().rad = 0.1;\n    sphere->Pos = GetLocalPosCOM();\n    m_body->AddAsset(sphere);\n}\n\nvoid ChChassis::RemoveVisualizationAssets() {\n    m_body->GetAssets().clear();\n}\n\n}  \/\/ end namespace vehicle\n}  \/\/ end namespace chrono\n<commit_msg>Fix bug in expressing the vehicle driver location in global frame<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\/\/ Base class for the chassis vehicle subsystem.\n\/\/\n\/\/ =============================================================================\n\n#include \"chrono\/assets\/ChSphereShape.h\"\n\n#include \"chrono_vehicle\/ChChassis.h\"\n\nnamespace chrono {\nnamespace vehicle {\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nChChassis::ChChassis(const std::string& name, bool fixed) : ChPart(name), m_fixed(fixed) {}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nChVector<> ChChassis::GetPointAcceleration(const ChVector<>& locpos) const {\n    ChVector<> acc_abs = m_body->GetFrame_REF_to_abs().PointAccelerationLocalToParent(locpos);\n    return m_body->GetFrame_REF_to_abs().TransformDirectionParentToLocal(acc_abs);\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ Return the global driver position\n\/\/ -----------------------------------------------------------------------------\nChVector<> ChChassis::GetDriverPos() const {\n    return m_body->GetFrame_REF_to_abs().TransformPointLocalToParent(GetLocalDriverCoordsys().pos);\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nvoid ChChassis::Initialize(ChSystem* system, const ChCoordsys<>& chassisPos, double chassisFwdVel) {\n    m_body = std::shared_ptr<ChBodyAuxRef>(system->NewBodyAuxRef());\n    m_body->SetIdentifier(0);\n    m_body->SetName(\"chassis\");\n    m_body->SetMass(GetMass());\n    m_body->SetFrame_COG_to_REF(ChFrame<>(GetLocalPosCOM(), ChQuaternion<>(1, 0, 0, 0)));\n    m_body->SetInertia(GetInertia());\n    m_body->SetBodyFixed(m_fixed);\n\n    m_body->SetFrame_REF_to_abs(ChFrame<>(chassisPos));\n    m_body->SetPos_dt(chassisFwdVel * chassisPos.TransformDirectionLocalToParent(ChVector<>(1, 0, 0)));\n\n    system->Add(m_body);\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nvoid ChChassis::AddVisualizationAssets(VisualizationType vis) {\n    if (vis == VisualizationType::NONE)\n        return;\n\n    auto sphere = std::make_shared<ChSphereShape>();\n    sphere->GetSphereGeometry().rad = 0.1;\n    sphere->Pos = GetLocalPosCOM();\n    m_body->AddAsset(sphere);\n}\n\nvoid ChChassis::RemoveVisualizationAssets() {\n    m_body->GetAssets().clear();\n}\n\n}  \/\/ end namespace vehicle\n}  \/\/ end namespace chrono\n<|endoftext|>"}
{"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2005 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#include \"bzfsAPI.h\"\n#include \"PyBZFlag.h\"\n\nnamespace Python\n{\n\nvoid\nTickHandler::process (bz_EventData *eventData)\n{\n\tPyObject *listeners = parent->GetListeners (bz_eTickEvent);\n\n\tif (listeners == NULL || !PyList_Check (listeners)) {\n\t\t\/\/ FIXME - throw error\n\t\tfprintf (stderr, \"tick listeners is not a list!\\n\");\n\t\treturn;\n\t}\n\tint size = PyList_Size (listeners);\n\tfprintf (stderr, \"there are %d tick listeners\\n\", size);\n\tfor (int i = 0; i < size; i++) {\n\t\tPyObject *handler = PyList_GetItem (listeners, i);\n\t\tif (!PyCallable_Check (handler)) {\n\t\t\t\/\/ FIXME - throw error\n\t\t\tfprintf (stderr, \"tick listener is not callable\\n\");\n\t\t\treturn;\n\t\t}\n\t\tPyEval_CallObject (handler, NULL);\n\t}\n}\n\nstatic PyObject *SendTextMessage (PyObject *self, PyObject *args, PyObject *keywords);\nstatic PyObject *FireWorldWeapon (PyObject *self, PyObject *args);\nstatic PyObject *GetCurrentTime  (PyObject *self, PyObject *args);\n\nstatic struct PyMethodDef methods[] =\n{\n\t\/\/ FIXME - docstrings\n\t{\"SendTextMessage\", (PyCFunction) SendTextMessage, METH_VARARGS | METH_KEYWORDS, NULL},\n\t{\"FireWorldWeapon\", (PyCFunction) FireWorldWeapon, METH_VARARGS,                 NULL},\n\t{\"GetCurrentTime\",  (PyCFunction) GetCurrentTime,  METH_NOARGS,                  NULL},\n\t{NULL,              (PyCFunction) NULL,            0,                            NULL},\n};\n\nBZFlag *BZFlag::instance = NULL;\nint BZFlag::References = 0;\n\nBZFlag *\nBZFlag::GetInstance ()\n{\n\tif (instance == NULL)\n\t\tinstance = new BZFlag ();\n\tReferences++;\n\treturn instance;\n}\n\nvoid\nBZFlag::DeRef ()\n{\n\tReferences--;\n}\n\nvoid\nCreateHandlerList (PyObject *dict, int event)\n{\n\tPyDict_SetItem (dict, PyInt_FromLong (event), PyList_New (0));\n}\n\nBZFlag::BZFlag ()\n{\n\tmodule = Py_InitModule3 (\"BZFlag\", methods, NULL);\n\tPy_INCREF (Py_None);\n\tPy_INCREF (Py_False);\n\tPy_INCREF (Py_True);\n\n\t\/\/ Create and add submodules\n\tevent_sub = new Event ();\n\tteam_sub  = new Team ();\n\n\tPyModule_AddObject (module, \"Event\", event_sub->GetSubModule ());\n\tPyModule_AddObject (module, \"Team\",   team_sub->GetSubModule ());\n\n\t\/\/ Register event handlers\n\ttick_handler.parent = this;\n\tbz_registerGeneralEvent (bz_eTickEvent, &tick_handler);\n\n\t\/\/ Create the dictionary for all the event handlers. Key is the int\n\t\/\/ event ID, value is a list of callables for our callbacks. Marshalling\n\t\/\/ is handled by the individual event handler classes\n\tevent_listeners = PyDict_New ();\n\tCreateHandlerList (event_listeners, bz_eTickEvent);\n\n\tPyModule_AddObject (module, \"Events\", event_listeners);\n}\n\nPyObject *\nBZFlag::GetListeners (int event)\n{\n\tPyObject *o = PyInt_FromLong (event);\n\tPyObject *ret = PyDict_GetItem (event_listeners, o);\n\tPy_DECREF (o);\n\n\treturn ret;\n}\n\nstatic PyObject *\nSendTextMessage (PyObject *self, PyObject *args, PyObject *keywords)\n{\n\tint to, from;\n\tchar *message;\n\n\tstatic char *kwlist[] = {\"to\", \"from\", \"message\", NULL};\n\n\tif (!PyArg_ParseTupleAndKeywords (args, keywords, \"iis\", kwlist, &to, &from, &message)) {\n\t\tfprintf (stderr, \"couldn't parse args\\n\");\n\t\t\/\/ FIXME - throw error\n\t\treturn NULL;\n\t}\n\n\tprintf (\"SendTextMessage (%d, %d, %s)\\n\", to, from, message);\n\tbool result = bz_sendTextMessage (to, from, message);\n\treturn Py_None;\n}\n\nstatic PyObject *\nFireWorldWeapon (PyObject *self, PyObject *args)\n{\n\tprintf (\"FireWorldWeapon ()\\n\");\n\treturn Py_None;\n}\n\nstatic PyObject *\nGetCurrentTime (PyObject *self, PyObject *args)\n{\n\tprintf (\"GetCurrentTime ()\\n\");\n\treturn Py_None;\n}\n\n};\n<commit_msg>get rid of debug output<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2005 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#include \"bzfsAPI.h\"\n#include \"PyBZFlag.h\"\n\nnamespace Python\n{\n\nvoid\nTickHandler::process (bz_EventData *eventData)\n{\n\tPyObject *listeners = parent->GetListeners (bz_eTickEvent);\n\n\tif (listeners == NULL || !PyList_Check (listeners)) {\n\t\t\/\/ FIXME - throw error\n\t\tfprintf (stderr, \"tick listeners is not a list!\\n\");\n\t\treturn;\n\t}\n\tint size = PyList_Size (listeners);\n\tfor (int i = 0; i < size; i++) {\n\t\tPyObject *handler = PyList_GetItem (listeners, i);\n\t\tif (!PyCallable_Check (handler)) {\n\t\t\t\/\/ FIXME - throw error\n\t\t\tfprintf (stderr, \"tick listener is not callable\\n\");\n\t\t\treturn;\n\t\t}\n\t\tPyEval_CallObject (handler, NULL);\n\t}\n}\n\nstatic PyObject *SendTextMessage (PyObject *self, PyObject *args, PyObject *keywords);\nstatic PyObject *FireWorldWeapon (PyObject *self, PyObject *args);\nstatic PyObject *GetCurrentTime  (PyObject *self, PyObject *args);\n\nstatic struct PyMethodDef methods[] =\n{\n\t\/\/ FIXME - docstrings\n\t{\"SendTextMessage\", (PyCFunction) SendTextMessage, METH_VARARGS | METH_KEYWORDS, NULL},\n\t{\"FireWorldWeapon\", (PyCFunction) FireWorldWeapon, METH_VARARGS,                 NULL},\n\t{\"GetCurrentTime\",  (PyCFunction) GetCurrentTime,  METH_NOARGS,                  NULL},\n\t{NULL,              (PyCFunction) NULL,            0,                            NULL},\n};\n\nBZFlag *BZFlag::instance = NULL;\nint BZFlag::References = 0;\n\nBZFlag *\nBZFlag::GetInstance ()\n{\n\tif (instance == NULL)\n\t\tinstance = new BZFlag ();\n\tReferences++;\n\treturn instance;\n}\n\nvoid\nBZFlag::DeRef ()\n{\n\tReferences--;\n}\n\nvoid\nCreateHandlerList (PyObject *dict, int event)\n{\n\tPyDict_SetItem (dict, PyInt_FromLong (event), PyList_New (0));\n}\n\nBZFlag::BZFlag ()\n{\n\tmodule = Py_InitModule3 (\"BZFlag\", methods, NULL);\n\tPy_INCREF (Py_None);\n\tPy_INCREF (Py_False);\n\tPy_INCREF (Py_True);\n\n\t\/\/ Create and add submodules\n\tevent_sub = new Event ();\n\tteam_sub  = new Team ();\n\n\tPyModule_AddObject (module, \"Event\", event_sub->GetSubModule ());\n\tPyModule_AddObject (module, \"Team\",   team_sub->GetSubModule ());\n\n\t\/\/ Register event handlers\n\ttick_handler.parent = this;\n\tbz_registerGeneralEvent (bz_eTickEvent, &tick_handler);\n\n\t\/\/ Create the dictionary for all the event handlers. Key is the int\n\t\/\/ event ID, value is a list of callables for our callbacks. Marshalling\n\t\/\/ is handled by the individual event handler classes\n\tevent_listeners = PyDict_New ();\n\tCreateHandlerList (event_listeners, bz_eTickEvent);\n\n\tPyModule_AddObject (module, \"Events\", event_listeners);\n}\n\nPyObject *\nBZFlag::GetListeners (int event)\n{\n\tPyObject *o = PyInt_FromLong (event);\n\tPyObject *ret = PyDict_GetItem (event_listeners, o);\n\tPy_DECREF (o);\n\n\treturn ret;\n}\n\nstatic PyObject *\nSendTextMessage (PyObject *self, PyObject *args, PyObject *keywords)\n{\n\tint to, from;\n\tchar *message;\n\n\tstatic char *kwlist[] = {\"to\", \"from\", \"message\", NULL};\n\n\tif (!PyArg_ParseTupleAndKeywords (args, keywords, \"iis\", kwlist, &to, &from, &message)) {\n\t\tfprintf (stderr, \"couldn't parse args\\n\");\n\t\t\/\/ FIXME - throw error\n\t\treturn NULL;\n\t}\n\n\tprintf (\"SendTextMessage (%d, %d, %s)\\n\", to, from, message);\n\tbool result = bz_sendTextMessage (to, from, message);\n\treturn Py_None;\n}\n\nstatic PyObject *\nFireWorldWeapon (PyObject *self, PyObject *args)\n{\n\tprintf (\"FireWorldWeapon ()\\n\");\n\treturn Py_None;\n}\n\nstatic PyObject *\nGetCurrentTime (PyObject *self, PyObject *args)\n{\n\tprintf (\"GetCurrentTime ()\\n\");\n\treturn Py_None;\n}\n\n};\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\\\n**\n**  tStorm.cpp: Functions for class tStorm.\n**\n**  A tStorm object generates random storms assuming an exponential\n**  distribution of rainfall intensity, storm duration, and time to the\n**  next storm. It is essentially an implementation of the model of\n**  P. Eagleson, 1978b, Water Resources Research. Its services include\n**  reading the necessary parameters from a tInputFile, generating a new      \n**  storm, and reporting its various values.\n**\n**  $Id: tStorm.cpp,v 1.17 2000-03-14 16:54:42 gtucker Exp $\n\\**************************************************************************\/\n\n\n#include <math.h>\n#include \"..\/Mathutil\/mathutil.h\"\n#include \"tStorm.h\"\n\n\n\n\/**************************************************************************\\\n**\n**  tStorm::tStorm:  Constructor for storms. The default constructor\n**                   assigns a value of unity to storm depth, duration,\n**                   and interstorm duration. (Note:\n**                   this constructor does not allow option for sinusoidal\n**                   variation in means).\n**\n\\**************************************************************************\/\ntStorm::tStorm( int optvar )\n{\n   optVariable = optvar;\n   optSinVar = 0;\n   pMean = 1.0;\n   stdurMean = 1.0;\n   istdurMean = 1.0;\n   p = 1.0;\n   stdur = 1.0;\n   istdur = 1.0;\n   endtm = 999999999999999;\n   \/\/srand( 0 );\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm::tStorm:  The constructor that's really used assigns values for\n**                   mean storm depth, duration, and interstorm duration,\n**                   initializes current depth, etc, to the mean values,\n**                   and initializes the random number generator. (Note:\n**                   this constructor does not allow option for sinusoidal\n**                   variation in means).\n**\n\\**************************************************************************\/\ntStorm::tStorm( double mp, double ms, double mis, unsigned sd, int optvar, double et )\n{\n   optVariable = optvar;\n   optSinVar = 0;\n   pMean = mp;\n   stdurMean = ms;\n   istdurMean = mis;\n   p = pMean;\n   stdur = stdurMean;\n   istdur = istdurMean;\n   seed = sd;\n   endtm = et;\n   \/\/srand( seed );\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm::tStorm\n**\n**  Alternative constructor that reads parameters directly from a tInputFile\n**  object. Reads option for variable storms (normally this is \"yes\"---that's\n**  the point of these objects---but a user may wish to switch off variation\n**  as a test), mean values for rainfall intensity, duration, and interstorm\n**  period, and a random seed to initialize the random number generator.\n**    Also reads an option for long-term sinusoidal variations in the mean\n**  values, and if the option is selected, reads the relevant parameters.\n**  Variables p0, stdur0, and istdur0 are the mean values of the means;\n**  pdev, stdurdev, and istdurdev are the range of variation (e.g., if pMean\n**  were to fluctuate between 5 and 10, p0 would be 7.5 and pdev 2.5).\n**\n**  Modifications:\n**   - 3\/00 initialization now includes creation of \".storm\" file for storm\n**     history (GT)\n**\n\\**************************************************************************\/\ntStorm::tStorm( tInputFile &infile )\n{\n   \/\/ Read + set parameters for storm intensity, duration, and spacing\n   optVariable = infile.ReadItem( optVariable, \"OPTVAR\" );\n   pMean = infile.ReadItem( pMean, \"PMEAN\" );\n   stdurMean = infile.ReadItem( stdurMean, \"STDUR\" );\n   istdurMean = infile.ReadItem( istdurMean, \"ISTDUR\" );\n   p = pMean;\n   stdur = stdurMean;\n   istdur = istdurMean;\n\n\n   endtm = infile.ReadItem( endtm, \"RUNTIME\" );\n   double help;\n\n   help = infile.ReadItem( help, \"OPTREADINPUT\" );\n   if(help>0){\n      help = infile.ReadItem( help, \"INPUTTIME\" );\n      endtm += help;\n   }\n\n\n   \/\/ Handle option for sinuidoil variation in means\n   optSinVar = infile.ReadItem( optSinVar, \"OPTSINVAR\" );\n   if( optSinVar )\n   {\n      p0 = pMean;\n      stdur0 = stdurMean;\n      istdur0 = istdurMean;\n      twoPiLam = (2.0*PI)\/(infile.ReadItem( twoPiLam, \"PERIOD\" ));\n      pdev = infile.ReadItem( pdev, \"MAXPMEAN\" ) - pMean;\n      if( pdev<0 ) cerr << \"Warning: MAXPMEAN < PMEAN !\";\n      else if( pdev > pMean ) cerr << \"Warning: MINPMEAN < 0 !\";\n      stdurdev = infile.ReadItem( stdurdev, \"MAXSTDURMN\" ) - stdurMean;\n      if( stdurdev<0 ) cerr << \"Warning: MAXSTDURMN < STDURMN !\";\n      else if( stdurdev > stdurMean ) cerr << \"Warning: MINSTDURMN < 0 !\";\n      istdurdev = infile.ReadItem( istdurdev, \"MAXISTDURMN\" ) - istdurMean;\n      if( istdurdev<0 ) cerr << \"Warning: MAXISTDURMN < ISTDURMN !\";\n      else if( istdurdev > istdurMean ) cerr << \"Warning: MINISTDURMN < 0 !\";\n   }\n\n   \/\/ If variable storms used, create a file for writing them\n   if( optVariable )\n   {\n      char fname[87];\n      infile.ReadItem( fname, \"OUTFILENAME\" );\n      strcat( fname, \".storm\" );\n      stormfile.open( fname );\n      if( !stormfile.good() )\n          cerr << \"Warning: unable to create storm data file '\" \n               << fname << \"'\\n\";\n   }\n\n   \/\/ Read and initialize seed for random number generation\n   seed = infile.ReadItem( seed, \"SEED\" );\n   \/\/srand( seed );\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm::GenerateStorm\n**\n**  Generates a new storm by drawing new values of p, stdur, and istdur from\n**  an exponential distribution and updating the random seed.\n**    If the minp parameter is greater than zero, the function will keep\n**  picking storms until it finds one with p>minp. The total elapsed time,\n**  including the rejected storms and their associated interstorm periods,\n**  is stored istdur.\n**\n**  Inputs:      minp -- minimum value of rainfall rate p (default 0)\n**               mind -- minimum storm depth to produce runoff (default 0)\n**               tm -- current time in simulation\n**  Members updated:  p, stdur, istdur take on new random values (if optVar)\n**                    pMean, stdurMean, istdurMean adjusted (if optSinVar)\n**  Assumptions:  pMean > 0\n**\n**  Modifications:\n**   - changed AND to OR in while loop, GT 5\/99\n**   - added to while loop an additional check to see if time has run out,\n**     NG 2\/00\n**   - added output of time, storm intensity, & duration to \".storm\" file\n**     GT 3\/00\n**\n\\**************************************************************************\/\nvoid tStorm::GenerateStorm( double tm, double minp, double mind )\n{\n   \/\/ If option for sinusoidal variation is on, adjust the means\n   \/\/ Also set values for current storm to the means, in case option for\n   \/\/ random storms is off.\n   if( optSinVar )\n   {\n      double sinfn = sin( tm*twoPiLam );\n      pMean = p0 + pdev*sinfn;\n      \/\/cout << \"pMean = \" << pMean << endl;\n      stdurMean = stdur0 + stdurdev*sinfn;\n      istdurMean = istdur0 + istdurdev*sinfn;\n      p = pMean;\n      stdur = stdurMean;\n      istdur = istdurMean;\n   }\n   \n   \/\/ If option for random storms is on, pick a storm at random.\n   \/\/ Keep picking and accumulating time until the storm depth or intensity\n   \/\/ is greater than the minimum value needed to produce runoff.\n\n   if( optVariable )\n   {\n      stdur = 0;\n      istdur = 0;\n      do\n      {\n         p = pMean*ExpDev( &seed );\n         istdur += istdurMean*ExpDev( &seed ) + stdur;\n         stdur = stdurMean*ExpDev( &seed );\n         \/\/cout << \"P \" << p << \"  ST \" << stdur << \"  IST \" << istdur\n         \/\/     << \"  DP \" << p*stdur << \" minp \" << minp << \" mind \" <<mind <<\n         \/\/            endl;\n         \/\/srand( seed );\n      } while( (p<=minp || (p*stdur)<=mind) && (tm+istdur+stdur<endtm) );\n      stormfile << tm << \" \" << p << \" \" << stdur << endl;\n   }\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm::ExpDev:  Finds a random number with an exponential distribution\n**                   (adapted from Numerical Recipes).\n**\n\\**************************************************************************\/\ndouble tStorm::ExpDev( long *idum )\n{\n    double dum;\n\n    do\n        dum = ran3( idum );\n    while( dum==0.0 );\n    return -log(dum);\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm \"get\" routines: return various variables\n**\n\\**************************************************************************\/\n\ndouble tStorm::getStormDuration() { return stdur; }\ndouble tStorm::interstormDur() { return istdur; }\ndouble tStorm::getRainrate() { return p; }\ndouble tStorm::getMeanStormDur() const {return stdurMean;}\ndouble tStorm::getMeanInterstormDur() const {return istdurMean;}\ndouble tStorm::getMeanPrecip() const {return pMean;}\n\n\/**************************************************************************\\\n**\n**  GammaDev\n**\n**  Returns a random variable drawn from a Gamma distribution with parameter m.\n**\n**  (Note: not actually called; provided for future use).\n**\n\\**************************************************************************\/\ndouble tStorm::GammaDev(double m, long * idum)\n{\n  double x, y,z, c,t,b,u,w,v;\n  \n  if (m<1)\n    {\n      c = 1\/m;\n      t = 0.07 + 0.75*sqrt(1-m);\n      b = 1 + exp(-t)*m\/t;\n      int accept = 0;\n      while (accept == 0)\n        {\n          u = ran3(idum);\n          w = ran3(idum);\n          v = b *u;\n          if (v<=1)\n            {\n              x  = t * pow(v, c);\n              accept = ((w<=((2-x)\/(2+x))) || (w<=exp(-x)));\n            }\n          else\n            {\n              x = -log(c*t*(b-v));\n              y = x\/t;\n              accept = (((w*(m + y - m*y)) <= 1) || (w<= ( pow(y, (m-1)))));\n            }\n        }\n    }\n  else\n    {\n      b = m-1;\n      c = 3*m - 0.75;\n      int accept = 0;\n      while (accept == 0)\n        {\n          u = ran3(idum); v = ran3(idum);\n          w = u* ( 1-u);\n          y = sqrt(c\/w) * (u - 0.5);\n          x = b + y;\n          if ( x>= 0)\n            {\n              z = 64*( pow(w,3))*v*v;\n              accept = (z <= ( 1 - 2*y*y\/x)) || ( log(z) <= (2*(b*log(x\/b) - y)));\n            }\n        }\n    }\n  return x;\n}\n\n<commit_msg>make g++ happy: add <string.h> and make sure it doesn't think big values like 10^9 are integers<commit_after>\/**************************************************************************\\\n**\n**  tStorm.cpp: Functions for class tStorm.\n**\n**  A tStorm object generates random storms assuming an exponential\n**  distribution of rainfall intensity, storm duration, and time to the\n**  next storm. It is essentially an implementation of the model of\n**  P. Eagleson, 1978b, Water Resources Research. Its services include\n**  reading the necessary parameters from a tInputFile, generating a new      \n**  storm, and reporting its various values.\n**\n**  $Id: tStorm.cpp,v 1.18 2000-05-10 19:46:11 gtucker Exp $\n\\**************************************************************************\/\n\n\n#include <math.h>\n#include <string.h>\n#include \"..\/Mathutil\/mathutil.h\"\n#include \"tStorm.h\"\n\n\n\n\/**************************************************************************\\\n**\n**  tStorm::tStorm:  Constructor for storms. The default constructor\n**                   assigns a value of unity to storm depth, duration,\n**                   and interstorm duration. (Note:\n**                   this constructor does not allow option for sinusoidal\n**                   variation in means).\n**\n\\**************************************************************************\/\ntStorm::tStorm( int optvar )\n{\n   optVariable = optvar;\n   optSinVar = 0;\n   pMean = 1.0;\n   stdurMean = 1.0;\n   istdurMean = 1.0;\n   p = 1.0;\n   stdur = 1.0;\n   istdur = 1.0;\n   endtm = 1.0e9;\n   \/\/srand( 0 );\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm::tStorm:  The constructor that's really used assigns values for\n**                   mean storm depth, duration, and interstorm duration,\n**                   initializes current depth, etc, to the mean values,\n**                   and initializes the random number generator. (Note:\n**                   this constructor does not allow option for sinusoidal\n**                   variation in means).\n**\n\\**************************************************************************\/\ntStorm::tStorm( double mp, double ms, double mis, unsigned sd, int optvar, double et )\n{\n   optVariable = optvar;\n   optSinVar = 0;\n   pMean = mp;\n   stdurMean = ms;\n   istdurMean = mis;\n   p = pMean;\n   stdur = stdurMean;\n   istdur = istdurMean;\n   seed = sd;\n   endtm = et;\n   \/\/srand( seed );\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm::tStorm\n**\n**  Alternative constructor that reads parameters directly from a tInputFile\n**  object. Reads option for variable storms (normally this is \"yes\"---that's\n**  the point of these objects---but a user may wish to switch off variation\n**  as a test), mean values for rainfall intensity, duration, and interstorm\n**  period, and a random seed to initialize the random number generator.\n**    Also reads an option for long-term sinusoidal variations in the mean\n**  values, and if the option is selected, reads the relevant parameters.\n**  Variables p0, stdur0, and istdur0 are the mean values of the means;\n**  pdev, stdurdev, and istdurdev are the range of variation (e.g., if pMean\n**  were to fluctuate between 5 and 10, p0 would be 7.5 and pdev 2.5).\n**\n**  Modifications:\n**   - 3\/00 initialization now includes creation of \".storm\" file for storm\n**     history (GT)\n**\n\\**************************************************************************\/\ntStorm::tStorm( tInputFile &infile )\n{\n   \/\/ Read + set parameters for storm intensity, duration, and spacing\n   optVariable = infile.ReadItem( optVariable, \"OPTVAR\" );\n   pMean = infile.ReadItem( pMean, \"PMEAN\" );\n   stdurMean = infile.ReadItem( stdurMean, \"STDUR\" );\n   istdurMean = infile.ReadItem( istdurMean, \"ISTDUR\" );\n   p = pMean;\n   stdur = stdurMean;\n   istdur = istdurMean;\n\n\n   endtm = infile.ReadItem( endtm, \"RUNTIME\" );\n   double help;\n\n   help = infile.ReadItem( help, \"OPTREADINPUT\" );\n   if(help>0){\n      help = infile.ReadItem( help, \"INPUTTIME\" );\n      endtm += help;\n   }\n\n\n   \/\/ Handle option for sinuidoil variation in means\n   optSinVar = infile.ReadItem( optSinVar, \"OPTSINVAR\" );\n   if( optSinVar )\n   {\n      p0 = pMean;\n      stdur0 = stdurMean;\n      istdur0 = istdurMean;\n      twoPiLam = (2.0*PI)\/(infile.ReadItem( twoPiLam, \"PERIOD\" ));\n      pdev = infile.ReadItem( pdev, \"MAXPMEAN\" ) - pMean;\n      if( pdev<0 ) cerr << \"Warning: MAXPMEAN < PMEAN !\";\n      else if( pdev > pMean ) cerr << \"Warning: MINPMEAN < 0 !\";\n      stdurdev = infile.ReadItem( stdurdev, \"MAXSTDURMN\" ) - stdurMean;\n      if( stdurdev<0 ) cerr << \"Warning: MAXSTDURMN < STDURMN !\";\n      else if( stdurdev > stdurMean ) cerr << \"Warning: MINSTDURMN < 0 !\";\n      istdurdev = infile.ReadItem( istdurdev, \"MAXISTDURMN\" ) - istdurMean;\n      if( istdurdev<0 ) cerr << \"Warning: MAXISTDURMN < ISTDURMN !\";\n      else if( istdurdev > istdurMean ) cerr << \"Warning: MINISTDURMN < 0 !\";\n   }\n\n   \/\/ If variable storms used, create a file for writing them\n   if( optVariable )\n   {\n      char fname[87];\n      infile.ReadItem( fname, \"OUTFILENAME\" );\n      strcat( fname, \".storm\" );\n      stormfile.open( fname );\n      if( !stormfile.good() )\n          cerr << \"Warning: unable to create storm data file '\" \n               << fname << \"'\\n\";\n   }\n\n   \/\/ Read and initialize seed for random number generation\n   seed = infile.ReadItem( seed, \"SEED\" );\n   \/\/srand( seed );\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm::GenerateStorm\n**\n**  Generates a new storm by drawing new values of p, stdur, and istdur from\n**  an exponential distribution and updating the random seed.\n**    If the minp parameter is greater than zero, the function will keep\n**  picking storms until it finds one with p>minp. The total elapsed time,\n**  including the rejected storms and their associated interstorm periods,\n**  is stored istdur.\n**\n**  Inputs:      minp -- minimum value of rainfall rate p (default 0)\n**               mind -- minimum storm depth to produce runoff (default 0)\n**               tm -- current time in simulation\n**  Members updated:  p, stdur, istdur take on new random values (if optVar)\n**                    pMean, stdurMean, istdurMean adjusted (if optSinVar)\n**  Assumptions:  pMean > 0\n**\n**  Modifications:\n**   - changed AND to OR in while loop, GT 5\/99\n**   - added to while loop an additional check to see if time has run out,\n**     NG 2\/00\n**   - added output of time, storm intensity, & duration to \".storm\" file\n**     GT 3\/00\n**\n\\**************************************************************************\/\nvoid tStorm::GenerateStorm( double tm, double minp, double mind )\n{\n   \/\/ If option for sinusoidal variation is on, adjust the means\n   \/\/ Also set values for current storm to the means, in case option for\n   \/\/ random storms is off.\n   if( optSinVar )\n   {\n      double sinfn = sin( tm*twoPiLam );\n      pMean = p0 + pdev*sinfn;\n      \/\/cout << \"pMean = \" << pMean << endl;\n      stdurMean = stdur0 + stdurdev*sinfn;\n      istdurMean = istdur0 + istdurdev*sinfn;\n      p = pMean;\n      stdur = stdurMean;\n      istdur = istdurMean;\n   }\n   \n   \/\/ If option for random storms is on, pick a storm at random.\n   \/\/ Keep picking and accumulating time until the storm depth or intensity\n   \/\/ is greater than the minimum value needed to produce runoff.\n\n   if( optVariable )\n   {\n      stdur = 0;\n      istdur = 0;\n      do\n      {\n         p = pMean*ExpDev( &seed );\n         istdur += istdurMean*ExpDev( &seed ) + stdur;\n         stdur = stdurMean*ExpDev( &seed );\n         \/\/cout << \"P \" << p << \"  ST \" << stdur << \"  IST \" << istdur\n         \/\/     << \"  DP \" << p*stdur << \" minp \" << minp << \" mind \" <<mind <<\n         \/\/            endl;\n         \/\/srand( seed );\n      } while( (p<=minp || (p*stdur)<=mind) && (tm+istdur+stdur<endtm) );\n      stormfile << tm << \" \" << p << \" \" << stdur << endl;\n   }\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm::ExpDev:  Finds a random number with an exponential distribution\n**                   (adapted from Numerical Recipes).\n**\n\\**************************************************************************\/\ndouble tStorm::ExpDev( long *idum )\n{\n    double dum;\n\n    do\n        dum = ran3( idum );\n    while( dum==0.0 );\n    return -log(dum);\n}\n\n\n\/**************************************************************************\\\n**\n**  tStorm \"get\" routines: return various variables\n**\n\\**************************************************************************\/\n\ndouble tStorm::getStormDuration() { return stdur; }\ndouble tStorm::interstormDur() { return istdur; }\ndouble tStorm::getRainrate() { return p; }\ndouble tStorm::getMeanStormDur() const {return stdurMean;}\ndouble tStorm::getMeanInterstormDur() const {return istdurMean;}\ndouble tStorm::getMeanPrecip() const {return pMean;}\n\n\/**************************************************************************\\\n**\n**  GammaDev\n**\n**  Returns a random variable drawn from a Gamma distribution with parameter m.\n**\n**  (Note: not actually called; provided for future use).\n**\n\\**************************************************************************\/\ndouble tStorm::GammaDev(double m, long * idum)\n{\n  double x, y,z, c,t,b,u,w,v;\n  \n  if (m<1)\n    {\n      c = 1\/m;\n      t = 0.07 + 0.75*sqrt(1-m);\n      b = 1 + exp(-t)*m\/t;\n      int accept = 0;\n      while (accept == 0)\n        {\n          u = ran3(idum);\n          w = ran3(idum);\n          v = b *u;\n          if (v<=1)\n            {\n              x  = t * pow(v, c);\n              accept = ((w<=((2-x)\/(2+x))) || (w<=exp(-x)));\n            }\n          else\n            {\n              x = -log(c*t*(b-v));\n              y = x\/t;\n              accept = (((w*(m + y - m*y)) <= 1) || (w<= ( pow(y, (m-1)))));\n            }\n        }\n    }\n  else\n    {\n      b = m-1;\n      c = 3*m - 0.75;\n      int accept = 0;\n      while (accept == 0)\n        {\n          u = ran3(idum); v = ran3(idum);\n          w = u* ( 1-u);\n          y = sqrt(c\/w) * (u - 0.5);\n          x = b + y;\n          if ( x>= 0)\n            {\n              z = 64*( pow(w,3))*v*v;\n              accept = (z <= ( 1 - 2*y*y\/x)) || ( log(z) <= (2*(b*log(x\/b) - y)));\n            }\n        }\n    }\n  return x;\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\/renderer_host\/blob_dispatcher_host.h\"\n\n#include \"chrome\/browser\/child_process_security_policy.h\"\n#include \"chrome\/browser\/chrome_blob_storage_context.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ipc\/ipc_message.h\"\n#include \"webkit\/blob\/blob_data.h\"\n#include \"webkit\/blob\/blob_storage_controller.h\"\n\nBlobDispatcherHost::BlobDispatcherHost(\n    int process_id,\n    ChromeBlobStorageContext* blob_storage_context)\n    : process_id_(process_id),\n      blob_storage_context_(blob_storage_context) {\n}\n\nBlobDispatcherHost::~BlobDispatcherHost() {\n}\n\nvoid BlobDispatcherHost::Shutdown() {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n\n  \/\/ Unregister all the blob URLs that are previously registered in this\n  \/\/ process.\n  for (base::hash_set<std::string>::const_iterator iter = blob_urls_.begin();\n       iter != blob_urls_.end(); ++iter) {\n    blob_storage_context_->controller()->UnregisterBlobUrl(GURL(*iter));\n  }\n}\n\nbool BlobDispatcherHost::OnMessageReceived(const IPC::Message& message,\n                                           bool* msg_is_ok) {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n\n  *msg_is_ok = true;\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP_EX(BlobDispatcherHost, message, *msg_is_ok)\n    IPC_MESSAGE_HANDLER(ViewHostMsg_RegisterBlobUrl, OnRegisterBlobUrl)\n    IPC_MESSAGE_HANDLER(ViewHostMsg_RegisterBlobUrlFrom, OnRegisterBlobUrlFrom)\n    IPC_MESSAGE_HANDLER(ViewHostMsg_UnregisterBlobUrl, OnUnregisterBlobUrl)\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\n\/\/ Check if the child process has been granted permission to register the files.\nbool BlobDispatcherHost::CheckPermission(\n    webkit_blob::BlobData* blob_data) const {\n  ChildProcessSecurityPolicy* policy =\n      ChildProcessSecurityPolicy::GetInstance();\n  for (std::vector<webkit_blob::BlobData::Item>::const_iterator iter =\n           blob_data->items().begin();\n       iter != blob_data->items().end(); ++iter) {\n    if (iter->type() == webkit_blob::BlobData::TYPE_FILE) {\n      if (!policy->CanReadFile(process_id_, iter->file_path()))\n        return false;\n    }\n  }\n  return true;\n}\n\nvoid BlobDispatcherHost::OnRegisterBlobUrl(\n    const GURL& url, const scoped_refptr<webkit_blob::BlobData>& blob_data) {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n  if (!CheckPermission(blob_data.get()))\n    return;\n  blob_storage_context_->controller()->RegisterBlobUrl(url, blob_data);\n  blob_urls_.insert(url.spec());\n}\n\nvoid BlobDispatcherHost::OnRegisterBlobUrlFrom(\n    const GURL& url, const GURL& src_url) {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n  blob_storage_context_->controller()->RegisterBlobUrlFrom(url, src_url);\n  blob_urls_.insert(src_url.spec());\n}\n\nvoid BlobDispatcherHost::OnUnregisterBlobUrl(const GURL& url) {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n  blob_storage_context_->controller()->UnregisterBlobUrl(url);\n  blob_urls_.erase(url.spec());\n}\n<commit_msg>Fix a leak. We weren't keeping track of 'public' blob urls properly.<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\/renderer_host\/blob_dispatcher_host.h\"\n\n#include \"chrome\/browser\/child_process_security_policy.h\"\n#include \"chrome\/browser\/chrome_blob_storage_context.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ipc\/ipc_message.h\"\n#include \"webkit\/blob\/blob_data.h\"\n#include \"webkit\/blob\/blob_storage_controller.h\"\n\nBlobDispatcherHost::BlobDispatcherHost(\n    int process_id,\n    ChromeBlobStorageContext* blob_storage_context)\n    : process_id_(process_id),\n      blob_storage_context_(blob_storage_context) {\n}\n\nBlobDispatcherHost::~BlobDispatcherHost() {\n}\n\nvoid BlobDispatcherHost::Shutdown() {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n\n  \/\/ Unregister all the blob URLs that are previously registered in this\n  \/\/ process.\n  for (base::hash_set<std::string>::const_iterator iter = blob_urls_.begin();\n       iter != blob_urls_.end(); ++iter) {\n    blob_storage_context_->controller()->UnregisterBlobUrl(GURL(*iter));\n  }\n}\n\nbool BlobDispatcherHost::OnMessageReceived(const IPC::Message& message,\n                                           bool* msg_is_ok) {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n\n  *msg_is_ok = true;\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP_EX(BlobDispatcherHost, message, *msg_is_ok)\n    IPC_MESSAGE_HANDLER(ViewHostMsg_RegisterBlobUrl, OnRegisterBlobUrl)\n    IPC_MESSAGE_HANDLER(ViewHostMsg_RegisterBlobUrlFrom, OnRegisterBlobUrlFrom)\n    IPC_MESSAGE_HANDLER(ViewHostMsg_UnregisterBlobUrl, OnUnregisterBlobUrl)\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\n\/\/ Check if the child process has been granted permission to register the files.\nbool BlobDispatcherHost::CheckPermission(\n    webkit_blob::BlobData* blob_data) const {\n  ChildProcessSecurityPolicy* policy =\n      ChildProcessSecurityPolicy::GetInstance();\n  for (std::vector<webkit_blob::BlobData::Item>::const_iterator iter =\n           blob_data->items().begin();\n       iter != blob_data->items().end(); ++iter) {\n    if (iter->type() == webkit_blob::BlobData::TYPE_FILE) {\n      if (!policy->CanReadFile(process_id_, iter->file_path()))\n        return false;\n    }\n  }\n  return true;\n}\n\nvoid BlobDispatcherHost::OnRegisterBlobUrl(\n    const GURL& url, const scoped_refptr<webkit_blob::BlobData>& blob_data) {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n  if (!CheckPermission(blob_data.get()))\n    return;\n  blob_storage_context_->controller()->RegisterBlobUrl(url, blob_data);\n  blob_urls_.insert(url.spec());\n}\n\nvoid BlobDispatcherHost::OnRegisterBlobUrlFrom(\n    const GURL& url, const GURL& src_url) {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n  blob_storage_context_->controller()->RegisterBlobUrlFrom(url, src_url);\n  blob_urls_.insert(url.spec());\n}\n\nvoid BlobDispatcherHost::OnUnregisterBlobUrl(const GURL& url) {\n  DCHECK(ChromeThread::CurrentlyOn(ChromeThread::IO));\n  blob_storage_context_->controller()->UnregisterBlobUrl(url);\n  blob_urls_.erase(url.spec());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * opencog\/cython\/PythonModule.h\n *\n * Copyright (C) 2013 by OpenCog Foundation\n * 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 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 \"PyIncludeWrapper.h\"\n\n#include <boost\/filesystem\/operations.hpp>\n\n#include <opencog\/util\/Config.h>\n#include <opencog\/util\/misc.h>\n#include <opencog\/util\/foreach.h>\n#include <opencog\/atomspace\/AtomSpace.h>\n\n#include \"PyMindAgent.h\"\n#include \"PyRequest.h\"\n#include \"PythonEval.h\"\n#include \"PythonModule.h\"\n\n#include \"agent_finder_types.h\"\n#include \"agent_finder_api.h\"\n\nusing std::vector;\nusing std::string;\n\nusing namespace opencog;\n\n\/\/#define DPRINTF printf\n#define DPRINTF(...)\n\nDECLARE_MODULE(PythonModule);\n\nstatic const char* DEFAULT_PYTHON_MODULE_PATHS[] =\n{\n    PROJECT_BINARY_DIR\"\/opencog\/cython\", \/\/ bindings\n    PROJECT_SOURCE_DIR\"\/opencog\/python\", \/\/ opencog modules written in python\n    PROJECT_SOURCE_DIR\"\/tests\/cython\",   \/\/ for testing\n    DATADIR\"\/python\",                    \/\/ install directory\n    #ifndef WIN32\n    \"\/usr\/local\/share\/opencog\/python\",\n    \"\/usr\/share\/opencog\/python\",\n    #endif \/\/ !WIN32\n    NULL\n};\n\n\/\/ Factories\n\nAgent* PythonAgentFactory::create() const\n{\n    logger().info() << \"Creating python agent \" << _pySrcModuleName << \".\" << _pyClassName;\n    PyMindAgent* pma = new PyMindAgent(_pySrcModuleName, _pyClassName);\n    return pma;\n}\n\nRequest* PythonRequestFactory::create() const\n{\n    logger().info() << \"Creating python request \" << _pySrcModuleName << \".\" << _pyClassName;\n    PyRequest* pma = new PyRequest(_pySrcModuleName, _pyClassName, _cci);\n    return pma;\n}\n\n\/\/ ------\n\nPythonModule::PythonModule() : Module()\n{\n}\n\nstatic bool already_loaded = false;\n\nPythonModule::~PythonModule()\n{\n    logger().info(\"[PythonModule] destructor\");\n    unregisterAgentsAndRequests();\n    do_load_py_unregister();\n\n    \/\/ PyFinalize crashes unless we carefully restore stuff...\n    PyEval_AcquireLock();\n    PyThreadState_Swap(_mainstate);\n    PyErr_Clear();\n    Py_Finalize();\n    already_loaded = false;\n}\n\nbool PythonModule::unregisterAgentsAndRequests()\n{\n    \/\/ Requires GIL\n    foreach (std::string s, _agentNames) {\n        DPRINTF(\"Deleting all instances of %s\\n\", s.c_str());\n        cogserver().unregisterAgent(s);\n    }\n    foreach (std::string s, _requestNames) {\n        DPRINTF(\"Unregistering requests of id %s\\n\", s.c_str());\n        cogserver().unregisterRequest(s);\n    }\n\n    return true;\n}\n\nvoid PythonModule::init()\n{\n    \/\/ Avoid hard crash if already loaded.\n    if (already_loaded) return;\n    already_loaded = true;\n\n    logger().info(\"[PythonModule] Initialising Python CogServer module.\");\n\n    \/\/ Start up Python (this init method skips registering signal handlers)\n    if (!Py_IsInitialized())\n        Py_InitializeEx(0);\n    if (!PyEval_ThreadsInitialized()) {\n        PyEval_InitThreads();\n        \/\/ Without this, pyFinalize() crashes\n        _mainstate = PyThreadState_Get();\n        \/\/ Without this, pyshell hangs and does nothing.\n        PyEval_ReleaseLock();\n    }\n\n    \/\/ Add our module directories to the Python interprator's path\n    const char** config_paths = DEFAULT_PYTHON_MODULE_PATHS;\n\n    PyObject* sysPath = PySys_GetObject((char*)\"path\");\n\n    \/\/ Default paths for python modules\n    for (int i = 0; config_paths[i] != NULL; ++i) {\n        boost::filesystem::path modulePath(config_paths[i]);\n        if (boost::filesystem::exists(modulePath))\n            PyList_Append(sysPath, PyString_FromString(modulePath.string().c_str()));\n    }\n\n    \/\/ Add custom paths for python modules from the config file if available\n    if (config().has(\"PYTHON_EXTENSION_DIRS\")) {\n        std::vector<std::string> pythonpaths;\n        \/\/ For debugging current path\n        tokenize(config()[\"PYTHON_EXTENSION_DIRS\"], std::back_inserter(pythonpaths), \", \");\n        for (std::vector<std::string>::const_iterator it = pythonpaths.begin();\n             it != pythonpaths.end(); ++it) {\n            boost::filesystem::path modulePath(*it);\n            if (boost::filesystem::exists(modulePath)) {\n                PyList_Append(sysPath, PyString_FromString(modulePath.string().c_str()));\n            } else {\n                logger().warn(\"PythonEval::%s Could not find custom python extension directory: %s \",\n                               __FUNCTION__,\n                               (*it).c_str()\n                               );\n            }\n        }\n    }\n\n    if (import_agent_finder() == -1) {\n        PyErr_Print();\n        logger().error() << \"[PythonModule] Failed to load helper python module\";\n        return;\n    }\n    logger().debug(\"Python sys.path is: \" + get_path_as_string());\n\n    if (config().has(\"PYTHON_PRELOAD\")) preloadModules();\n    do_load_py_register();\n\n}\n\nbool PythonModule::preloadModules()\n{\n    \/\/ requires GIL\n    std::vector<std::string> pythonmodules;\n    tokenize(config()[\"PYTHON_PRELOAD\"], std::back_inserter(pythonmodules), \", \");\n    for (std::vector<std::string>::const_iterator it = pythonmodules.begin();\n         it != pythonmodules.end(); ++it) {\n        std::list<std::string> args;\n        args.push_back(*it);\n        logger().info(\"[PythonModule] Preloading python module \" + *it);\n        std::string result = do_load_py(NULL,args);\n        logger().info(\"[PythonModule] \" + result);\n    }\n    return true;\n}\n\n\/\/\/ do_load_py -- load python code, given a file name. (Implements the loadpy command)\n\/\/\/\n\/\/\/ It is expected that the file contains a python module. The module\n\/\/\/ should implement either a mind-agent, or it should contain a 'request'\n\/\/\/ (shell command, written in python). Mind agents must inherit from\n\/\/\/ the python class opencog.cogserver.MindAgent, while requests\/commnds\n\/\/\/ must inherit from opencog.cogserver.Request\n\/\/\nstd::string PythonModule::do_load_py(Request *dummy, std::list<std::string> args)\n{\n    if (args.size() == 0) return \"Please specify Python module to load.\";\n    std::string moduleName = args.front();\n\n    std::ostringstream oss;\n    if (moduleName.substr(moduleName.size()-3,3) == \".py\") {\n        oss << \"Warning: Python module name should be \"\n            << \"passed without .py extension\" << std::endl;\n        moduleName.replace(moduleName.size()-3,3,\"\");\n    }\n\n    requests_and_agents_t thingsInModule = load_req_agent_module(moduleName);\n    if (thingsInModule.err_string.size() > 0) {\n        return thingsInModule.err_string;\n    }\n\n    \/\/ If there are agents, load them.\n    if (thingsInModule.agents.size() > 0) {\n        bool first = true;\n        oss << \"Python MindAgents found: \";\n        foreach(std::string s, thingsInModule.agents) {\n            if (!first) {\n                oss << \", \";\n                first = false;\n            }\n\n            \/\/ Register agent with cogserver using dotted name:\n            \/\/ module.AgentName\n            std::string dottedName = moduleName + \".\" + s;\n\n            \/\/ register the agent with a custom factory that knows how to\n            \/\/ instantiate new Python MindAgents\n            cogserver().registerAgent(dottedName, new PythonAgentFactory(moduleName,s));\n\n            \/\/ save a list of Python agents that we've added to the CogServer\n            _agentNames.push_back(dottedName);\n            oss << s;\n        }\n        oss << \".\" << std::endl;\n    } else {\n        oss << \"No subclasses of opencog.cogserver.MindAgent found.\\n\";\n    }\n\n    \/\/ Now load the commands\/requests, if any.\n    if (thingsInModule.requests.size() > 0) {\n        bool first = true;\n        oss << \"Python Requests found: \";\n        for (size_t i=0; i< thingsInModule.requests.size(); i++) {\n            std::string s = thingsInModule.requests[i];\n            std::string short_desc = thingsInModule.req_summary[i];\n            std::string long_desc = thingsInModule.req_description[i];\n            bool is_shell = thingsInModule.req_is_shell[i];\n\n            \/\/ CogServer commands in Python\n            \/\/ Register request with cogserver using dotted name: module.RequestName\n            std::string dottedName = moduleName + \".\" + s;\n            \/\/ register the agent with a custom factory that knows how to\n            cogserver().registerRequest(dottedName, \n                new PythonRequestFactory(moduleName, s, short_desc, long_desc, is_shell));\n            \/\/ save a list of Python agents that we've added to the CogServer\n            _requestNames.push_back(dottedName);\n\n            if (!first) { oss << \", \"; first = false; }\n            oss << s;\n        }\n        oss << \".\";\n    } else {\n        oss << \"No subclasses of opencog.cogserver.Request found.\\n\";\n    }\n\n    \/\/ Return info on what requests and mindagents were found\n    \/\/ This gets printed out to the user at the shell prompt.\n    return oss.str();\n}\n\n<commit_msg>Temporarily calling the instance member of PythonEval in PytonModule to address the issues with python sys object<commit_after>\/*\n * opencog\/cython\/PythonModule.h\n *\n * Copyright (C) 2013 by OpenCog Foundation\n * 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 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 \"PyIncludeWrapper.h\"\n\n#include <boost\/filesystem\/operations.hpp>\n\n#include <opencog\/util\/Config.h>\n#include <opencog\/util\/misc.h>\n#include <opencog\/util\/foreach.h>\n#include <opencog\/atomspace\/AtomSpace.h>\n\n#include \"PyMindAgent.h\"\n#include \"PyRequest.h\"\n#include \"PythonEval.h\"\n#include \"PythonModule.h\"\n\n#include \"agent_finder_types.h\"\n#include \"agent_finder_api.h\"\n\nusing std::vector;\nusing std::string;\n\nusing namespace opencog;\n\n\/\/#define DPRINTF printf\n#define DPRINTF(...)\n\nDECLARE_MODULE(PythonModule);\n\nstatic const char* DEFAULT_PYTHON_MODULE_PATHS[] =\n{\n    PROJECT_BINARY_DIR\"\/opencog\/cython\", \/\/ bindings\n    PROJECT_SOURCE_DIR\"\/opencog\/python\", \/\/ opencog modules written in python\n    PROJECT_SOURCE_DIR\"\/tests\/cython\",   \/\/ for testing\n    DATADIR\"\/python\",                    \/\/ install directory\n    #ifndef WIN32\n    \"\/usr\/local\/share\/opencog\/python\",\n    \"\/usr\/share\/opencog\/python\",\n    #endif \/\/ !WIN32\n    NULL\n};\n\n\/\/ Factories\n\nAgent* PythonAgentFactory::create() const\n{\n    logger().info() << \"Creating python agent \" << _pySrcModuleName << \".\" << _pyClassName;\n    PyMindAgent* pma = new PyMindAgent(_pySrcModuleName, _pyClassName);\n    return pma;\n}\n\nRequest* PythonRequestFactory::create() const\n{\n    logger().info() << \"Creating python request \" << _pySrcModuleName << \".\" << _pyClassName;\n    PyRequest* pma = new PyRequest(_pySrcModuleName, _pyClassName, _cci);\n    return pma;\n}\n\n\/\/ ------\n\nPythonModule::PythonModule() : Module()\n{\n}\n\nstatic bool already_loaded = false;\n\nPythonModule::~PythonModule()\n{\n    logger().info(\"[PythonModule] destructor\");\n    unregisterAgentsAndRequests();\n    do_load_py_unregister();\n\n    \/\/ PyFinalize crashes unless we carefully restore stuff...\n    PyEval_AcquireLock();\n    PyThreadState_Swap(_mainstate);\n    PyErr_Clear();\n    Py_Finalize();\n    already_loaded = false;\n}\n\nbool PythonModule::unregisterAgentsAndRequests()\n{\n    \/\/ Requires GIL\n    foreach (std::string s, _agentNames) {\n        DPRINTF(\"Deleting all instances of %s\\n\", s.c_str());\n        cogserver().unregisterAgent(s);\n    }\n    foreach (std::string s, _requestNames) {\n        DPRINTF(\"Unregistering requests of id %s\\n\", s.c_str());\n        cogserver().unregisterRequest(s);\n    }\n\n    return true;\n}\n\nvoid PythonModule::init()\n{\n    \/\/ Avoid hard crash if already loaded.\n    if (already_loaded) return;\n    already_loaded = true;\n\n    logger().info(\"[PythonModule] Initialising Python CogServer module.\");\n\n    \/\/ Start up Python (this init method skips registering signal handlers)\n    if (!Py_IsInitialized())\n        Py_InitializeEx(0);\n    if (!PyEval_ThreadsInitialized()) {\n        PyEval_InitThreads();\n        \/\/ Without this, pyFinalize() crashes\n        _mainstate = PyThreadState_Get();\n        \/\/ Without this, pyshell hangs and does nothing.\n        PyEval_ReleaseLock();\n    }\n\n    \/\/ Add our module directories to the Python interprator's path\n    const char** config_paths = DEFAULT_PYTHON_MODULE_PATHS;\n\n    PyObject* sysPath = PySys_GetObject((char*)\"path\");\n\n    \/\/ Default paths for python modules\n    for (int i = 0; config_paths[i] != NULL; ++i) {\n        boost::filesystem::path modulePath(config_paths[i]);\n        if (boost::filesystem::exists(modulePath))\n            PyList_Append(sysPath, PyString_FromString(modulePath.string().c_str()));\n    }\n\n    \/\/ Add custom paths for python modules from the config file if available\n    if (config().has(\"PYTHON_EXTENSION_DIRS\")) {\n        std::vector<std::string> pythonpaths;\n        \/\/ For debugging current path\n        tokenize(config()[\"PYTHON_EXTENSION_DIRS\"], std::back_inserter(pythonpaths), \", \");\n        for (std::vector<std::string>::const_iterator it = pythonpaths.begin();\n             it != pythonpaths.end(); ++it) {\n            boost::filesystem::path modulePath(*it);\n            if (boost::filesystem::exists(modulePath)) {\n                PyList_Append(sysPath, PyString_FromString(modulePath.string().c_str()));\n            } else {\n                logger().warn(\"PythonEval::%s Could not find custom python extension directory: %s \",\n                               __FUNCTION__,\n                               (*it).c_str()\n                               );\n            }\n        }\n    }\n\n    PythonEval::instance();\n\n    if (import_agent_finder() == -1) {\n        PyErr_Print();\n        logger().error() << \"[PythonModule] Failed to load helper python module\";\n        return;\n    }\n    logger().debug(\"Python sys.path is: \" + get_path_as_string());\n\n    if (config().has(\"PYTHON_PRELOAD\")) preloadModules();\n    do_load_py_register();\n\n}\n\nbool PythonModule::preloadModules()\n{\n    \/\/ requires GIL\n    std::vector<std::string> pythonmodules;\n    tokenize(config()[\"PYTHON_PRELOAD\"], std::back_inserter(pythonmodules), \", \");\n    for (std::vector<std::string>::const_iterator it = pythonmodules.begin();\n         it != pythonmodules.end(); ++it) {\n        std::list<std::string> args;\n        args.push_back(*it);\n        logger().info(\"[PythonModule] Preloading python module \" + *it);\n        std::string result = do_load_py(NULL,args);\n        logger().info(\"[PythonModule] \" + result);\n    }\n    return true;\n}\n\n\/\/\/ do_load_py -- load python code, given a file name. (Implements the loadpy command)\n\/\/\/\n\/\/\/ It is expected that the file contains a python module. The module\n\/\/\/ should implement either a mind-agent, or it should contain a 'request'\n\/\/\/ (shell command, written in python). Mind agents must inherit from\n\/\/\/ the python class opencog.cogserver.MindAgent, while requests\/commnds\n\/\/\/ must inherit from opencog.cogserver.Request\n\/\/\nstd::string PythonModule::do_load_py(Request *dummy, std::list<std::string> args)\n{\n    if (args.size() == 0) return \"Please specify Python module to load.\";\n    std::string moduleName = args.front();\n\n    std::ostringstream oss;\n    if (moduleName.substr(moduleName.size()-3,3) == \".py\") {\n        oss << \"Warning: Python module name should be \"\n            << \"passed without .py extension\" << std::endl;\n        moduleName.replace(moduleName.size()-3,3,\"\");\n    }\n\n    requests_and_agents_t thingsInModule = load_req_agent_module(moduleName);\n    if (thingsInModule.err_string.size() > 0) {\n        return thingsInModule.err_string;\n    }\n\n    \/\/ If there are agents, load them.\n    if (thingsInModule.agents.size() > 0) {\n        bool first = true;\n        oss << \"Python MindAgents found: \";\n        foreach(std::string s, thingsInModule.agents) {\n            if (!first) {\n                oss << \", \";\n                first = false;\n            }\n\n            \/\/ Register agent with cogserver using dotted name:\n            \/\/ module.AgentName\n            std::string dottedName = moduleName + \".\" + s;\n\n            \/\/ register the agent with a custom factory that knows how to\n            \/\/ instantiate new Python MindAgents\n            cogserver().registerAgent(dottedName, new PythonAgentFactory(moduleName,s));\n\n            \/\/ save a list of Python agents that we've added to the CogServer\n            _agentNames.push_back(dottedName);\n            oss << s;\n        }\n        oss << \".\" << std::endl;\n    } else {\n        oss << \"No subclasses of opencog.cogserver.MindAgent found.\\n\";\n    }\n\n    \/\/ Now load the commands\/requests, if any.\n    if (thingsInModule.requests.size() > 0) {\n        bool first = true;\n        oss << \"Python Requests found: \";\n        for (size_t i=0; i< thingsInModule.requests.size(); i++) {\n            std::string s = thingsInModule.requests[i];\n            std::string short_desc = thingsInModule.req_summary[i];\n            std::string long_desc = thingsInModule.req_description[i];\n            bool is_shell = thingsInModule.req_is_shell[i];\n\n            \/\/ CogServer commands in Python\n            \/\/ Register request with cogserver using dotted name: module.RequestName\n            std::string dottedName = moduleName + \".\" + s;\n            \/\/ register the agent with a custom factory that knows how to\n            cogserver().registerRequest(dottedName, \n                new PythonRequestFactory(moduleName, s, short_desc, long_desc, is_shell));\n            \/\/ save a list of Python agents that we've added to the CogServer\n            _requestNames.push_back(dottedName);\n\n            if (!first) { oss << \", \"; first = false; }\n            oss << s;\n        }\n        oss << \".\";\n    } else {\n        oss << \"No subclasses of opencog.cogserver.Request found.\\n\";\n    }\n\n    \/\/ Return info on what requests and mindagents were found\n    \/\/ This gets printed out to the user at the shell prompt.\n    return oss.str();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * SchemeSmobNew.c\n *\n * Scheme small objects (SMOBS) --creating new atoms -- for opencog.\n *\n * Copyright (c) 2008 Linas Vepstas <linas@linas.org>\n *\/\n\n#ifdef HAVE_GUILE\n\n#include <vector>\n\n#include <libguile.h>\n\n#include <opencog\/atomspace\/Atom.h>\n#include <opencog\/atomspace\/AtomSpace.h>\n#include <opencog\/atomspace\/ClassServer.h>\n#include <opencog\/atomspace\/Link.h>\n#include <opencog\/atomspace\/Node.h>\n#include <opencog\/atomspace\/TLB.h>\n#include <opencog\/guile\/SchemeSmob.h>\n#include <opencog\/server\/CogServer.h>\n\nusing namespace opencog;\n\n\/* ============================================================== *\/\n\/**\n * return atom->toString() for the corresponding atom.\n *\/\nstd::string SchemeSmob::to_string(SCM node)\n{\n\tif (SCM_SMOB_PREDICATE(SchemeSmob::cog_handle_tag, node))\n\t\treturn handle_to_string(node);\n\n\tif (SCM_SMOB_PREDICATE(SchemeSmob::cog_misc_tag, node))\n\t\treturn misc_to_string(node);\n\n\treturn \"\";\n}\n\nstd::string SchemeSmob::handle_to_string(Handle h, int indent)\n{\n\tif (Handle::UNDEFINED == h) return \"#<Undefined atom handle>\";\n\n\tAtom *atom = TLB::getAtom(h);\n\tif (NULL == atom) return \"#<Invalid handle>\";\n\tNode *node = dynamic_cast<Node *>(atom);\n\tLink *link = dynamic_cast<Link *>(atom);\n\n#ifdef CRYPTIC_STYLE\n\t\/\/ output the olde-style opencog notation\n\tstd::string ret = \"#<\";\n\tret += atom->toString();\n\tret += \">\\n\";\n#endif\n\n\t\/\/ Print a scheme expression, so that the output can be saved\n\t\/\/ to file, and then restored, as needed.\n\tstd::string ret = \"\";\n\tfor (int i=0; i< indent; i++) ret += \"   \";\n\tret += \"(\";\n\tret += classserver().getTypeName(atom->getType());\n\tif (node)\n\t{\n\t\tret += \" \\\"\";\n\t\tret += node->getName();\n\t\tret += \"\\\"\";\n\n\t\t\/\/ Print the truth value only after the node name\n\t\tconst TruthValue &tv = atom->getTruthValue();\n\t\tif (tv != TruthValue::DEFAULT_TV())\n\t\t{\n\t\t\tret += \" \";\n\t\t\tret += tv_to_string (&tv);\n\t\t}\n\t\tret += \")\";\n\t\treturn ret;\n\t}\n\telse if (link)\n\t{\n\t\t\/\/ If there's a truth value, print it before the other atoms\n\t\tconst TruthValue &tv = atom->getTruthValue();\n\t\tif (tv != TruthValue::DEFAULT_TV())\n\t\t{\n\t\t\tret += \" \";\n\t\t\tret += tv_to_string (&tv);\n\t\t}\n\n\t\t\/\/ print the outgoing link set.\n\t\tstd::vector<Handle> oset = link->getOutgoingSet();\n\t\tunsigned int arity = oset.size();\n\t\tfor (unsigned int i=0; i<arity; i++)\n\t\t{\n\t\t\tret += \" \";\n\t\t\tret += handle_to_string(oset[i], (0==i)?0:indent+1);\n\t\t\tif (i != arity-1) ret += \"\\n\";\n\t\t}\n\t\tret += \")\";\n\t\treturn ret;\n\t}\n\n\treturn ret;\n}\n\nstd::string SchemeSmob::handle_to_string(SCM node)\n{\n\tSCM shandle = SCM_SMOB_OBJECT(node);\n\tHandle h(scm_to_ulong(shandle));\n\n\treturn handle_to_string(h, 0) + \"\\n\";\n}\n\n\/* ============================================================== *\/\n\/**\n * Wrapper -- given a handle, return the corresponding scheme object.\n * Note that smobs hold the integer value of the handle, and not the\n * C++ handle object itself.\n *\/\nSCM SchemeSmob::handle_to_scm (Handle h)\n{\n\tSCM shandle = scm_from_ulong(h.value());\n\tSCM_RETURN_NEWSMOB (cog_handle_tag, shandle);\n}\n\nHandle SchemeSmob::scm_to_handle (SCM sh)\n{\n\tunsigned long uuid = (unsigned long) SCM_SMOB_OBJECT(sh);\n\treturn Handle(uuid);\n}\n\n\/* ============================================================== *\/\n\/**\n * Create a new scheme object, holding the atom handle\n *\/\nSCM SchemeSmob::ss_atom (SCM shandle)\n{\n\tif (scm_is_false(scm_integer_p(shandle)))\n\t\tscm_wrong_type_arg_msg(\"cog-atom\", 1, shandle, \"integer opencog handle\");\n\tSCM_RETURN_NEWSMOB (cog_handle_tag, shandle);\n}\n\n\/* ============================================================== *\/\n\/**\n * Return handle of atom (the handle is the UUID integer)\n *\/\nSCM SchemeSmob::ss_handle (SCM satom)\n{\n\tif (!SCM_SMOB_PREDICATE(SchemeSmob::cog_handle_tag, satom))\n\t\tscm_wrong_type_arg_msg(\"cog-handle\", 1, satom, \"opencog atom\");\n\n\t\/\/ Guhh. Handles are no longer unsigned ints, but are classes. :-(\n\t\/\/ return SCM_SMOB_OBJECT(satom);\n\tunsigned long uuid = (unsigned long) SCM_SMOB_OBJECT(satom);\n\treturn scm_from_ulong(uuid);\n}\n\n\/* ============================================================== *\/\n\nSCM SchemeSmob::ss_atom_p (SCM s)\n{\n\tif (SCM_SMOB_PREDICATE(SchemeSmob::cog_handle_tag, s))\n\t\treturn SCM_BOOL_T;\n\treturn SCM_BOOL_F;\n}\n\n\/* ============================================================== *\/\n\/**\n * Check that the arguments represent a value node, else throw errors.\n * Return the node type.\n *\/\nType SchemeSmob::validate_atom (SCM stype, const char *subrname)\n{\n\tif (scm_is_true(scm_symbol_p(stype)))\n\t\tstype = scm_symbol_to_string(stype);\n\n\tif (scm_is_false(scm_string_p(stype)))\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog atom type\");\n\n\tchar * ct = scm_to_locale_string(stype);\n\tType t = classserver().getType(ct);\n\tfree(ct);\n\n\t\/\/ Make sure that the type is good\n\tif (NOTYPE == t)\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog atom type\");\n\n\treturn t;\n}\n\nType SchemeSmob::validate_node (SCM stype, const char *subrname)\n{\n\tType t = validate_atom(stype, subrname);\n\n\tif (false == classserver().isA(t, NODE))\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog node type\");\n\n\treturn t;\n}\n\nstd::string SchemeSmob::decode_string (SCM sname, const char *subrname, const char * msg)\n{\n\tif (scm_is_false(scm_string_p(sname)))\n\t\tscm_wrong_type_arg_msg(subrname, 2, sname, msg);\n\n\tchar * cname = scm_to_locale_string(sname);\n\tstd::string name = cname;\n\tfree(cname);\n\treturn name;\n}\n\n\/**\n * Create a new node, of named type stype, and string name sname\n *\/\nSCM SchemeSmob::ss_new_node (SCM stype, SCM sname, SCM kv_pairs)\n{\n\tType t = validate_node(stype, \"cog-new-node\");\n\tstd::string name = decode_string (sname, \"cog-new-node\", \"string name for the node\");\n\n\t\/\/ Now, create the actual node... in the actual atom space.\n\tconst TruthValue *tv = get_tv_from_list(kv_pairs);\n\tif (!tv) tv = &TruthValue::DEFAULT_TV();\n\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tHandle h = as->addNode(t, name, *tv);\n\n\treturn handle_to_scm (h);\n}\n\n\/**\n * Return the indicated node, of named type stype, and string name sname\n * if it exists; else return nil if it does not exist.\n * If the node exists, *and* a truth value was specified, then change\n * the truth value.\n *\/\nSCM SchemeSmob::ss_node (SCM stype, SCM sname, SCM kv_pairs)\n{\n\tType t = validate_node(stype, \"cog-node\");\n\tstd::string name = decode_string (sname, \"cog-node\", \"string name for the node\");\n\n\t\/\/ Now, look for the actual node... in the actual atom space.\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tHandle h = as->getHandle(t, name);\n\tif (!TLB::isValidHandle(h)) return SCM_EOL; \/\/ NIL\n\n\t\/\/ If there was a truth value, change it.\n\tconst TruthValue *tv = get_tv_from_list(kv_pairs);\n\tif (tv)\n\t{\n\t\tAtom *atom = TLB::getAtom(h);\n\t\tatom->setTruthValue(*tv);\n\t}\n\treturn handle_to_scm (h);\n}\n\n\/* ============================================================== *\/\n\/**\n * Verify that the arguments are appropriate for a link\n *\/\nstatic Type verify_link (SCM stype, const char * subrname)\n{\n\tif (scm_is_true(scm_symbol_p(stype)))\n\t\tstype = scm_symbol_to_string(stype);\n\n\tchar * ct = scm_to_locale_string(stype);\n\tType t = classserver().getType(ct);\n\tfree(ct);\n\n\t\/\/ Make sure that the type is good\n\tif (NOTYPE == t)\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog atom type\");\n\n\tif (false == classserver().isA(t, LINK))\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog link type\");\n\n\treturn t;\n}\n\n\/**\n * Convert argument into a list of handles.\n *\/\nstd::vector<Handle>\nSchemeSmob::decode_handle_list (SCM satom_list, const char * subrname)\n{\n\t\/\/ Verify that second arg is an actual list. Allow null list.\n\t\/\/ (I think that there are legti null lists, right?)\n\tif (!scm_is_pair(satom_list) && !scm_is_null(satom_list))\n\t\tscm_wrong_type_arg_msg(subrname, 2, satom_list, \"a list of atoms\");\n\n\tconst TruthValue *tv = NULL;\n\tstd::vector<Handle> outgoing_set;\n\tSCM sl = satom_list;\n\tint pos = 2;\n\twhile (scm_is_pair(sl))\n\t{\n\t\tSCM satom = SCM_CAR(sl);\n\n\t\t\/\/ Verify that the contents of the list are actual atoms.\n\t\tif (SCM_SMOB_PREDICATE(SchemeSmob::cog_handle_tag, satom))\n\t\t{\n\t\t\t\/\/ Get the handle  ... should we check for valid handles here?\n\t\t\tSCM shandle = SCM_SMOB_OBJECT(satom);\n\t\t\tHandle h(scm_to_ulong(shandle));\n\t\t\toutgoing_set.push_back(h);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Its legit to have enmbedded truth values, just skip them.\n\t\t\ttv = get_tv_from_list(sl);\n\t\t\tif (tv == NULL)\n\t\t\t{\n\t\t\t\t\/\/ If its not an atom, and its not a truth value, its bad\n\t\t\t\tscm_wrong_type_arg_msg(\"cog-new-link\", pos, satom, \"opencog atom\");\n\t\t\t}\n\t\t}\n\t\tsl = SCM_CDR(sl);\n\t\tpos++;\n\t}\n\n\treturn outgoing_set;\n}\n\n\/**\n * Create a new link, of named type stype, holding the indicated atom list\n *\/\nSCM SchemeSmob::ss_new_link (SCM stype, SCM satom_list)\n{\n\tType t = verify_link (stype, \"cog-new-link\");\n\n\tstd::vector<Handle> outgoing_set;\n\toutgoing_set = decode_handle_list (satom_list, \"cog-new-link\");\n\n\t\/\/ Fish out a truth value, if its there.\n\tconst TruthValue *tv = get_tv_from_list(satom_list);\n\tif (!tv) tv = &TruthValue::DEFAULT_TV();\n\n\t\/\/ Now, create the actual link... in the actual atom space.\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tHandle h = as->addLink(t, outgoing_set, *tv);\n\treturn handle_to_scm (h);\n}\n\n\/**\n * Return the indicated link, of named type stype, holding the\n * indicated atom list, if it exists; else return nil if\n * it does not exist.\n *\/\nSCM SchemeSmob::ss_link (SCM stype, SCM satom_list)\n{\n\tType t = verify_link (stype, \"cog-link\");\n\n\tstd::vector<Handle> outgoing_set;\n\toutgoing_set = decode_handle_list (satom_list, \"cog-link\");\n\n\t\/\/ Now, look to find the actual link... in the actual atom space.\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tHandle h = as->getHandle(t, outgoing_set);\n\tif (!TLB::isValidHandle(h)) return SCM_EOL; \/\/ NIL\n\n\t\/\/ If there was a truth value, change it.\n\tconst TruthValue *tv = get_tv_from_list(satom_list);\n\tif (tv)\n\t{\n\t\tAtom *atom = TLB::getAtom(h);\n\t\tatom->setTruthValue(*tv);\n\t}\n\treturn handle_to_scm (h);\n}\n\n\/* ============================================================== *\/\n\/**\n * delete the atom, but only if it has no incoming links.\n *\/\nSCM SchemeSmob::ss_delete (SCM satom)\n{\n\tHandle h = verify_handle(satom, \"cog-delete\");\n\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tbool rc = as->removeAtom(h, false);\n\n\tif (rc) return SCM_BOOL_T;\n\treturn SCM_BOOL_F;\n}\n\n\/* ============================================================== *\/\n\/**\n * delete the atom, and everything pointing to it.\n *\/\nSCM SchemeSmob::ss_delete_recursive (SCM satom)\n{\n\tHandle h = verify_handle(satom, \"cog-delete-recursive\");\n\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tbool rc = as->removeAtom(h, true);\n\n\tif (rc) return SCM_BOOL_T;\n\treturn SCM_BOOL_F;\n}\n\n#endif\n\/* ===================== END OF FILE ============================ *\/\n<commit_msg>bug-fix in how scheme handle uuids are converted to opencog handles.<commit_after>\/*\n * SchemeSmobNew.c\n *\n * Scheme small objects (SMOBS) --creating new atoms -- for opencog.\n *\n * Copyright (c) 2008 Linas Vepstas <linas@linas.org>\n *\/\n\n#ifdef HAVE_GUILE\n\n#include <vector>\n\n#include <libguile.h>\n\n#include <opencog\/atomspace\/Atom.h>\n#include <opencog\/atomspace\/AtomSpace.h>\n#include <opencog\/atomspace\/ClassServer.h>\n#include <opencog\/atomspace\/Link.h>\n#include <opencog\/atomspace\/Node.h>\n#include <opencog\/atomspace\/TLB.h>\n#include <opencog\/guile\/SchemeSmob.h>\n#include <opencog\/server\/CogServer.h>\n\nusing namespace opencog;\n\n\/* ============================================================== *\/\n\/**\n * return atom->toString() for the corresponding atom.\n *\/\nstd::string SchemeSmob::to_string(SCM node)\n{\n\tif (SCM_SMOB_PREDICATE(SchemeSmob::cog_handle_tag, node))\n\t\treturn handle_to_string(node);\n\n\tif (SCM_SMOB_PREDICATE(SchemeSmob::cog_misc_tag, node))\n\t\treturn misc_to_string(node);\n\n\treturn \"\";\n}\n\nstd::string SchemeSmob::handle_to_string(Handle h, int indent)\n{\n\tif (Handle::UNDEFINED == h) return \"#<Undefined atom handle>\";\n\n\tAtom *atom = TLB::getAtom(h);\n\tif (NULL == atom) return \"#<Invalid handle>\";\n\tNode *node = dynamic_cast<Node *>(atom);\n\tLink *link = dynamic_cast<Link *>(atom);\n\n#ifdef CRYPTIC_STYLE\n\t\/\/ output the olde-style opencog notation\n\tstd::string ret = \"#<\";\n\tret += atom->toString();\n\tret += \">\\n\";\n#endif\n\n\t\/\/ Print a scheme expression, so that the output can be saved\n\t\/\/ to file, and then restored, as needed.\n\tstd::string ret = \"\";\n\tfor (int i=0; i< indent; i++) ret += \"   \";\n\tret += \"(\";\n\tret += classserver().getTypeName(atom->getType());\n\tif (node)\n\t{\n\t\tret += \" \\\"\";\n\t\tret += node->getName();\n\t\tret += \"\\\"\";\n\n\t\t\/\/ Print the truth value only after the node name\n\t\tconst TruthValue &tv = atom->getTruthValue();\n\t\tif (tv != TruthValue::DEFAULT_TV())\n\t\t{\n\t\t\tret += \" \";\n\t\t\tret += tv_to_string (&tv);\n\t\t}\n\t\tret += \")\";\n\t\treturn ret;\n\t}\n\telse if (link)\n\t{\n\t\t\/\/ If there's a truth value, print it before the other atoms\n\t\tconst TruthValue &tv = atom->getTruthValue();\n\t\tif (tv != TruthValue::DEFAULT_TV())\n\t\t{\n\t\t\tret += \" \";\n\t\t\tret += tv_to_string (&tv);\n\t\t}\n\n\t\t\/\/ print the outgoing link set.\n\t\tstd::vector<Handle> oset = link->getOutgoingSet();\n\t\tunsigned int arity = oset.size();\n\t\tfor (unsigned int i=0; i<arity; i++)\n\t\t{\n\t\t\tret += \" \";\n\t\t\tret += handle_to_string(oset[i], (0==i)?0:indent+1);\n\t\t\tif (i != arity-1) ret += \"\\n\";\n\t\t}\n\t\tret += \")\";\n\t\treturn ret;\n\t}\n\n\treturn ret;\n}\n\nstd::string SchemeSmob::handle_to_string(SCM node)\n{\n\tHandle h = scm_to_handle(node);\n\treturn handle_to_string(h, 0) + \"\\n\";\n}\n\n\/* ============================================================== *\/\n\/**\n * Wrapper -- given a handle, return the corresponding scheme object.\n * Note that smobs hold the integer value of the handle, and not the\n * C++ handle object itself.\n *\/\nSCM SchemeSmob::handle_to_scm (Handle h)\n{\n\tSCM shandle = scm_from_ulong(h.value());\n\tSCM_RETURN_NEWSMOB (cog_handle_tag, shandle);\n}\n\nHandle SchemeSmob::scm_to_handle (SCM sh)\n{\n\tSCM suuid = SCM_SMOB_OBJECT(sh);\n\tunsigned long uuid = scm_to_ulong(suuid);\n\treturn Handle(uuid);\n}\n\n\/* ============================================================== *\/\n\/**\n * Create a new scheme object, holding the atom handle\n *\/\nSCM SchemeSmob::ss_atom (SCM shandle)\n{\n\tif (scm_is_false(scm_integer_p(shandle)))\n\t\tscm_wrong_type_arg_msg(\"cog-atom\", 1, shandle, \"integer opencog handle\");\n\tSCM_RETURN_NEWSMOB (cog_handle_tag, shandle);\n}\n\n\/* ============================================================== *\/\n\/**\n * Return handle of atom (the handle is the UUID integer)\n *\/\nSCM SchemeSmob::ss_handle (SCM satom)\n{\n\tif (!SCM_SMOB_PREDICATE(SchemeSmob::cog_handle_tag, satom))\n\t\tscm_wrong_type_arg_msg(\"cog-handle\", 1, satom, \"opencog atom\");\n\n\t\/\/ Guhh. Handles are no longer unsigned ints, but are classes. :-(\n\t\/\/ return SCM_SMOB_OBJECT(satom);\n\tunsigned long uuid = (unsigned long) SCM_SMOB_OBJECT(satom);\n\treturn scm_from_ulong(uuid);\n}\n\n\/* ============================================================== *\/\n\nSCM SchemeSmob::ss_atom_p (SCM s)\n{\n\tif (SCM_SMOB_PREDICATE(SchemeSmob::cog_handle_tag, s))\n\t\treturn SCM_BOOL_T;\n\treturn SCM_BOOL_F;\n}\n\n\/* ============================================================== *\/\n\/**\n * Check that the arguments represent a value node, else throw errors.\n * Return the node type.\n *\/\nType SchemeSmob::validate_atom (SCM stype, const char *subrname)\n{\n\tif (scm_is_true(scm_symbol_p(stype)))\n\t\tstype = scm_symbol_to_string(stype);\n\n\tif (scm_is_false(scm_string_p(stype)))\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog atom type\");\n\n\tchar * ct = scm_to_locale_string(stype);\n\tType t = classserver().getType(ct);\n\tfree(ct);\n\n\t\/\/ Make sure that the type is good\n\tif (NOTYPE == t)\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog atom type\");\n\n\treturn t;\n}\n\nType SchemeSmob::validate_node (SCM stype, const char *subrname)\n{\n\tType t = validate_atom(stype, subrname);\n\n\tif (false == classserver().isA(t, NODE))\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog node type\");\n\n\treturn t;\n}\n\nstd::string SchemeSmob::decode_string (SCM sname, const char *subrname, const char * msg)\n{\n\tif (scm_is_false(scm_string_p(sname)))\n\t\tscm_wrong_type_arg_msg(subrname, 2, sname, msg);\n\n\tchar * cname = scm_to_locale_string(sname);\n\tstd::string name = cname;\n\tfree(cname);\n\treturn name;\n}\n\n\/**\n * Create a new node, of named type stype, and string name sname\n *\/\nSCM SchemeSmob::ss_new_node (SCM stype, SCM sname, SCM kv_pairs)\n{\n\tType t = validate_node(stype, \"cog-new-node\");\n\tstd::string name = decode_string (sname, \"cog-new-node\", \"string name for the node\");\n\n\t\/\/ Now, create the actual node... in the actual atom space.\n\tconst TruthValue *tv = get_tv_from_list(kv_pairs);\n\tif (!tv) tv = &TruthValue::DEFAULT_TV();\n\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tHandle h = as->addNode(t, name, *tv);\n\n\treturn handle_to_scm (h);\n}\n\n\/**\n * Return the indicated node, of named type stype, and string name sname\n * if it exists; else return nil if it does not exist.\n * If the node exists, *and* a truth value was specified, then change\n * the truth value.\n *\/\nSCM SchemeSmob::ss_node (SCM stype, SCM sname, SCM kv_pairs)\n{\n\tType t = validate_node(stype, \"cog-node\");\n\tstd::string name = decode_string (sname, \"cog-node\", \"string name for the node\");\n\n\t\/\/ Now, look for the actual node... in the actual atom space.\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tHandle h = as->getHandle(t, name);\n\tif (!TLB::isValidHandle(h)) return SCM_EOL; \/\/ NIL\n\n\t\/\/ If there was a truth value, change it.\n\tconst TruthValue *tv = get_tv_from_list(kv_pairs);\n\tif (tv)\n\t{\n\t\tAtom *atom = TLB::getAtom(h);\n\t\tatom->setTruthValue(*tv);\n\t}\n\treturn handle_to_scm (h);\n}\n\n\/* ============================================================== *\/\n\/**\n * Verify that the arguments are appropriate for a link\n *\/\nstatic Type verify_link (SCM stype, const char * subrname)\n{\n\tif (scm_is_true(scm_symbol_p(stype)))\n\t\tstype = scm_symbol_to_string(stype);\n\n\tchar * ct = scm_to_locale_string(stype);\n\tType t = classserver().getType(ct);\n\tfree(ct);\n\n\t\/\/ Make sure that the type is good\n\tif (NOTYPE == t)\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog atom type\");\n\n\tif (false == classserver().isA(t, LINK))\n\t\tscm_wrong_type_arg_msg(subrname, 1, stype, \"name of opencog link type\");\n\n\treturn t;\n}\n\n\/**\n * Convert argument into a list of handles.\n *\/\nstd::vector<Handle>\nSchemeSmob::decode_handle_list (SCM satom_list, const char * subrname)\n{\n\t\/\/ Verify that second arg is an actual list. Allow null list.\n\t\/\/ (I think that there are legti null lists, right?)\n\tif (!scm_is_pair(satom_list) && !scm_is_null(satom_list))\n\t\tscm_wrong_type_arg_msg(subrname, 2, satom_list, \"a list of atoms\");\n\n\tconst TruthValue *tv = NULL;\n\tstd::vector<Handle> outgoing_set;\n\tSCM sl = satom_list;\n\tint pos = 2;\n\twhile (scm_is_pair(sl))\n\t{\n\t\tSCM satom = SCM_CAR(sl);\n\n\t\t\/\/ Verify that the contents of the list are actual atoms.\n\t\tif (SCM_SMOB_PREDICATE(SchemeSmob::cog_handle_tag, satom))\n\t\t{\n\t\t\t\/\/ Get the handle  ... should we check for valid handles here?\n\t\t\tSCM shandle = SCM_SMOB_OBJECT(satom);\n\t\t\tHandle h(scm_to_ulong(shandle));\n\t\t\toutgoing_set.push_back(h);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Its legit to have enmbedded truth values, just skip them.\n\t\t\ttv = get_tv_from_list(sl);\n\t\t\tif (tv == NULL)\n\t\t\t{\n\t\t\t\t\/\/ If its not an atom, and its not a truth value, its bad\n\t\t\t\tscm_wrong_type_arg_msg(\"cog-new-link\", pos, satom, \"opencog atom\");\n\t\t\t}\n\t\t}\n\t\tsl = SCM_CDR(sl);\n\t\tpos++;\n\t}\n\n\treturn outgoing_set;\n}\n\n\/**\n * Create a new link, of named type stype, holding the indicated atom list\n *\/\nSCM SchemeSmob::ss_new_link (SCM stype, SCM satom_list)\n{\n\tType t = verify_link (stype, \"cog-new-link\");\n\n\tstd::vector<Handle> outgoing_set;\n\toutgoing_set = decode_handle_list (satom_list, \"cog-new-link\");\n\n\t\/\/ Fish out a truth value, if its there.\n\tconst TruthValue *tv = get_tv_from_list(satom_list);\n\tif (!tv) tv = &TruthValue::DEFAULT_TV();\n\n\t\/\/ Now, create the actual link... in the actual atom space.\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tHandle h = as->addLink(t, outgoing_set, *tv);\n\treturn handle_to_scm (h);\n}\n\n\/**\n * Return the indicated link, of named type stype, holding the\n * indicated atom list, if it exists; else return nil if\n * it does not exist.\n *\/\nSCM SchemeSmob::ss_link (SCM stype, SCM satom_list)\n{\n\tType t = verify_link (stype, \"cog-link\");\n\n\tstd::vector<Handle> outgoing_set;\n\toutgoing_set = decode_handle_list (satom_list, \"cog-link\");\n\n\t\/\/ Now, look to find the actual link... in the actual atom space.\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tHandle h = as->getHandle(t, outgoing_set);\n\tif (!TLB::isValidHandle(h)) return SCM_EOL; \/\/ NIL\n\n\t\/\/ If there was a truth value, change it.\n\tconst TruthValue *tv = get_tv_from_list(satom_list);\n\tif (tv)\n\t{\n\t\tAtom *atom = TLB::getAtom(h);\n\t\tatom->setTruthValue(*tv);\n\t}\n\treturn handle_to_scm (h);\n}\n\n\/* ============================================================== *\/\n\/**\n * delete the atom, but only if it has no incoming links.\n *\/\nSCM SchemeSmob::ss_delete (SCM satom)\n{\n\tHandle h = verify_handle(satom, \"cog-delete\");\n\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tbool rc = as->removeAtom(h, false);\n\n\tif (rc) return SCM_BOOL_T;\n\treturn SCM_BOOL_F;\n}\n\n\/* ============================================================== *\/\n\/**\n * delete the atom, and everything pointing to it.\n *\/\nSCM SchemeSmob::ss_delete_recursive (SCM satom)\n{\n\tHandle h = verify_handle(satom, \"cog-delete-recursive\");\n\n\tAtomSpace *as = CogServer::getAtomSpace();\n\tbool rc = as->removeAtom(h, true);\n\n\tif (rc) return SCM_BOOL_T;\n\treturn SCM_BOOL_F;\n}\n\n#endif\n\/* ===================== END OF FILE ============================ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"DriverAccess.h\"\n#include \"Public.h\"\n\n\/\/------------------------------------------------------------------------------------------------\n\nUsbDkDriverAccess::UsbDkDriverAccess()\n{\n    m_hDriver = CreateFile(USBDK_USERMODE_NAME,\n                           GENERIC_READ | GENERIC_WRITE,\n                           0,\n                           NULL,\n                           CREATE_ALWAYS,\n                           FILE_ATTRIBUTE_NORMAL,\n                           NULL);\n\n    if (m_hDriver == INVALID_HANDLE_VALUE)\n    {\n        throw UsbDkDriverAccessException(TEXT(\"Failed to open device symlink\"));\n    }\n}\n\/\/------------------------------------------------------------------------------------------------\n\nUsbDkDriverAccess::~UsbDkDriverAccess()\n{\n    CloseHandle(m_hDriver);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::GetDevicesList(PUSB_DK_DEVICE_ID &DevicesArray, ULONG &NumberDevice)\n{\n    DevicesArray = nullptr;\n    for (;;)\n    {\n        DWORD   bytesReturned;\n\n        \/\/ get number of devices\n        if (!DeviceIoControl(m_hDriver,\n            IOCTL_USBDK_COUNT_DEVICES,\n            nullptr,\n            0,\n            &NumberDevice,\n            sizeof(NumberDevice),\n            &bytesReturned,\n            nullptr))\n        {\n            throw UsbDkDriverAccessException(TEXT(\"Counting devices failed\"));\n        }\n\n        \/\/ get list of devices\n        delete DevicesArray;\n        DevicesArray = new USB_DK_DEVICE_ID[NumberDevice];\n\n        if (!DeviceIoControl(m_hDriver,\n            IOCTL_USBDK_ENUM_DEVICES,\n            nullptr,\n            0,\n            DevicesArray,\n            NumberDevice * sizeof(USB_DK_DEVICE_ID),\n            &bytesReturned,\n            nullptr))\n        {\n            DWORD err = GetLastError();\n            if (err == ERROR_INSUFFICIENT_BUFFER || err == ERROR_MORE_DATA)\n            {\n                continue;\n            }\n            else\n            {\n                UsbDkDriverAccessException(TEXT(\"Enumiration devices failed in DeviceIoControl.\"), err);\n            }\n        }\n        NumberDevice = bytesReturned \/ sizeof(USB_DK_DEVICE_ID);\n        break;\n    }\n}\n\/\/------------------------------------------------------------------------------------------------\nvoid UsbDkDriverAccess::ReleaseDeviceList(PUSB_DK_DEVICE_ID DevicesArray)\n{\n    delete[] DevicesArray;\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::ResetDevice(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_RESET_DEVICE, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::AddRedirect(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_ADD_REDIRECT, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::RemoveRedirect(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_REMOVE_REDIRECT, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::SendIoctlWithDeviceId(DWORD ControlCode,\n                                              USB_DK_DEVICE_ID &Id)\n{\n    DWORD   bytesReturned;\n    if (!DeviceIoControl(m_hDriver, ControlCode, &Id, sizeof(Id),\n                         nullptr, 0, &bytesReturned, nullptr))\n    {\n        throw UsbDkDriverAccessException(TEXT(\"Ioctl failed\"));\n    }\n}\n<commit_msg>UsbDkHelper: Trivial: improve printout<commit_after>#include \"stdafx.h\"\n#include \"DriverAccess.h\"\n#include \"Public.h\"\n\n\/\/------------------------------------------------------------------------------------------------\n\nUsbDkDriverAccess::UsbDkDriverAccess()\n{\n    m_hDriver = CreateFile(USBDK_USERMODE_NAME,\n                           GENERIC_READ | GENERIC_WRITE,\n                           0,\n                           NULL,\n                           CREATE_ALWAYS,\n                           FILE_ATTRIBUTE_NORMAL,\n                           NULL);\n\n    if (m_hDriver == INVALID_HANDLE_VALUE)\n    {\n        throw UsbDkDriverAccessException(TEXT(\"Failed to open device symlink\"));\n    }\n}\n\/\/------------------------------------------------------------------------------------------------\n\nUsbDkDriverAccess::~UsbDkDriverAccess()\n{\n    CloseHandle(m_hDriver);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::GetDevicesList(PUSB_DK_DEVICE_ID &DevicesArray, ULONG &NumberDevice)\n{\n    DevicesArray = nullptr;\n    for (;;)\n    {\n        DWORD   bytesReturned;\n\n        \/\/ get number of devices\n        if (!DeviceIoControl(m_hDriver,\n            IOCTL_USBDK_COUNT_DEVICES,\n            nullptr,\n            0,\n            &NumberDevice,\n            sizeof(NumberDevice),\n            &bytesReturned,\n            nullptr))\n        {\n            throw UsbDkDriverAccessException(TEXT(\"Counting devices failed\"));\n        }\n\n        \/\/ get list of devices\n        delete DevicesArray;\n        DevicesArray = new USB_DK_DEVICE_ID[NumberDevice];\n\n        if (!DeviceIoControl(m_hDriver,\n            IOCTL_USBDK_ENUM_DEVICES,\n            nullptr,\n            0,\n            DevicesArray,\n            NumberDevice * sizeof(USB_DK_DEVICE_ID),\n            &bytesReturned,\n            nullptr))\n        {\n            DWORD err = GetLastError();\n            if (err == ERROR_INSUFFICIENT_BUFFER || err == ERROR_MORE_DATA)\n            {\n                continue;\n            }\n            else\n            {\n                UsbDkDriverAccessException(TEXT(\"Enumeration failed in IOCTL_USBDK_ENUM_DEVICES.\"), err);\n            }\n        }\n        NumberDevice = bytesReturned \/ sizeof(USB_DK_DEVICE_ID);\n        break;\n    }\n}\n\/\/------------------------------------------------------------------------------------------------\nvoid UsbDkDriverAccess::ReleaseDeviceList(PUSB_DK_DEVICE_ID DevicesArray)\n{\n    delete[] DevicesArray;\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::ResetDevice(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_RESET_DEVICE, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::AddRedirect(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_ADD_REDIRECT, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::RemoveRedirect(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_REMOVE_REDIRECT, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::SendIoctlWithDeviceId(DWORD ControlCode,\n                                              USB_DK_DEVICE_ID &Id)\n{\n    DWORD   bytesReturned;\n    if (!DeviceIoControl(m_hDriver, ControlCode, &Id, sizeof(Id),\n                         nullptr, 0, &bytesReturned, nullptr))\n    {\n        throw UsbDkDriverAccessException(TEXT(\"Ioctl failed\"));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"parlex\/detail\/job.hpp\"\n\n\/\/ ReSharper disable once CppUnusedIncludeDirective\n#include \"perf_timer.hpp\"\n#include \"tarjan.hpp\"\n\n#include \"parlex\/detail\/acceptor.hpp\"\n#include \"parlex\/detail\/configuration.hpp\"\n#include \"parlex\/detail\/grammar.hpp\"\n#include \"parlex\/detail\/match_class.hpp\"\n#include \"parlex\/detail\/parser.hpp\"\n#include \"parlex\/detail\/producer_table.hpp\"\n#include \"parlex\/detail\/subjob.hpp\"\n#include \"parlex\/detail\/terminal.hpp\"\n#include \"parlex\/detail\/token.hpp\"\n\n\/\/#include \"logging.hpp\"\n\nnamespace parlex {\nnamespace detail {\n\njob::job(parser & owner, std::u32string const & document, grammar const & g, uint16_t const rootRecognizerIndex, progress_handler_t const & progressHandler) :\n\tdocument(document),\n\tg(g),\n\tprogress(0),\n\towner(&owner),\n\tprogress_handler(progressHandler),\n\tprogress_counter(0) {\n\t\/\/DBG(\"starting job using recognizer '\", main, \"'\");\n\n\t\/\/similar to get_product, but different for constructor\n\t\/\/because parser::mutex is already locked\n\tmatch_class const matchClass(0, rootRecognizerIndex);\n\tauto & storage = producers[matchClass];\n\tauto const & root = g.get_recognizer(rootRecognizerIndex);\n\tif (root.is_terminal()) {\n\t\tauto const t = static_cast<terminal const *>(&root);  \/\/ NOLINT\n\t\tstorage = new token(*this, matchClass, *t);\n\t} else {\n\t\tauto const machine = static_cast<acceptor const *>(&root);  \/\/ NOLINT\n\t\tauto result = new subjob(*machine);\n\t\tstorage = result;\n\t\t\/\/seed the parser with the root state\n\t\tresult->begin_work_queue_reference();\n\t\tconfiguration const c = result->construct_start_state_configuration(0);\n\t\tuint8_t startState = machine->get_start_state();\n\t\towner.work.emplace_back(matchClass, c);\n\t\tresult->finish_creation(*this, matchClass);\n\t\t++owner.active_count;\n\t\t\/\/ start when parser::mutex is unlocked\n\t\towner.work_cv.notify_one();\n\t}\n}\n\nvoid job::connect(match_class const & requestedMatchClass, subjob & subscriber, match_class const & subscriberId, uint8_t const nextState, leaf const * l, transition_record const * history) {\n\tget_producer(requestedMatchClass).add_subscription(nextState, l, history, subscriber, subscriberId, requestedMatchClass, *this);\n}\n\nproducer & job::get_producer(match_class const & matchClass) {\n\tstd::unique_lock<std::mutex> lock(producers_mutex);\n\tauto & storage = producers[matchClass];\n\tif (storage == nullptr) {\n\t\tauto const & r = g.get_recognizer(matchClass.recognizer_index);\n\t\tif (r.is_terminal()) {\n\t\t\tauto const & t = *static_cast<terminal const *>(&r);  \/\/ NOLINT\n\t\t\tstorage = new token(*this, matchClass, t);\n\t\t} else {\n\t\t\tauto const machine = static_cast<acceptor const *>(&r);  \/\/ NOLINT\n\t\t\tauto newSubjobPtr = new subjob(*machine);\n\t\t\tstorage = newSubjobPtr;\n\t\t\tlock.unlock();\n\t\t\tnewSubjobPtr->start(*this, matchClass);\n\t\t}\n\t}\n\treturn *storage;\n}\n\nvoid job::update_progress(uint32_t const completed)\n{\n\tif (progress_handler) {\n\t\tuint32_t oldProgress = progress.load();\n\t\twhile (!progress_counter.compare_exchange_weak(oldProgress, completed) && oldProgress < completed) {}\n\t\tif (oldProgress < completed) {\n\t\t\tprogress_handler(completed, uint32_t(document.length()));\n\t\t}\n\t}\n}\n\nvoid job::fast_breakout() {\n\tfor (auto & pair : producers) {\n\t\tauto const & matchClass = pair.first;\n\t\tauto & producer = *pair.second;\n\t\tif (g.is_recognizer_left_recursive(matchClass.recognizer_index)) {\n\t\t\tproducer.terminate(*this, matchClass);\n\t\t}\n\t}\n}\n\nbool job::full_breakout() {\n\tstd::vector<match_class> vertices;\n\tstd::map<match_class, size_t> lookup;\n\tfor (auto const & pair : producers) {\n\t\tauto const & matchClass = pair.first;\n\t\tauto const & producer = *pair.second;\n\t\tif (producer.completed) {\n\t\t\tcontinue;\n\t\t}\n\t\tlookup[matchClass] = vertices.size();\n\t\tvertices.push_back(matchClass);\n\t}\n\n\tstd::function<std::vector<size_t> (size_t)> const edgeFunctor = [&](size_t vertexIndex){\n\t\tauto const & matchClass = vertices[vertexIndex];\n\t\tauto const & producer = producers.find(matchClass)->second;\n\t\tstd::vector<size_t> results;\n\t\tfor (auto const & subscription : producer->consumers) {\n\t\t\tif (get_producer(subscription.subscriber_id).completed) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tresults.push_back(lookup.find(subscription.subscriber_id)->second);\n\t\t}\n\t\treturn results;\n\t};\n\n\tauto stronglyConnectedComponents = tarjan(vertices.size(), edgeFunctor, true);\n\n\tauto anyHalted = false;\n\t\/\/halt subjobs that are subscribed to themselves (in)directly\n\tfor (auto const & stronglyConnectedComponent : stronglyConnectedComponents) {\n\t\tfor (auto vertexIndex: stronglyConnectedComponent) {\n\t\t\tauto const & matchClass = vertices[vertexIndex];\n\t\t\tget_producer(matchClass).terminate(*this, matchClass);\n\t\t\tanyHalted = true;\n\t\t}\n\t}\n\n\treturn !anyHalted;\n}\n\nbool job::handle_deadlocks() {\n\t\/\/perf_timer perf(__func__);\n\n\tfast_breakout();\n\n\t\/\/ Did fast_breakout free up any nodes to do some work?\n\tif (!owner->work.empty()) {\n\t\treturn false;\n\t}\n\n\treturn full_breakout();\n}\n\n\/\/Construct an ASS, and if a solution was found, prunes unreachable nodes\nabstract_syntax_semilattice job::construct_result(match const & m) {\n\t\/\/perf_timer timer(__FUNCTION__);\n\tauto result = abstract_syntax_semilattice(m);\n\tfor (auto const & pair : producers) {\n\t\tauto const & matchClass = pair.first;\n\t\tauto const & p = *pair.second;\n\t\tfor (auto const & pair2 : p.match_length_to_derivations) {\n\t\t\tauto const matchLength = pair2.first;\n\t\t\tmatch const n(matchClass, matchLength);\n\t\t\tauto const & derivations = pair2.second;\n\t\t\tresult.derivations_of_matches[n] = derivations;\n\t\t}\n\t}\n\n\tfor (auto entry : producers) {\n\t\tdelete entry.second;\n\t}\n\tproducers.clear();\n\n\tif (result.is_rooted()) {\n\t\tresult.prune_detached();\n\t\tparser::apply_precedence_and_associativity(g, result);\n\t\tresult.prune_detached();\n\t}\n\treturn result;\n}\n\n\nabstract_syntax_semilattice job::construct_result_and_postprocess(uint16_t const overrideRootRecognizerIndex, std::vector<post_processor> const & posts, std::u32string const & document) {\n\t\/\/perf_timer perf(__func__);\n\tauto result = construct_result(match(0, overrideRootRecognizerIndex, uint32_t(document.size())));\n\tif (!posts.empty()) {\n\t\tfor (auto const & post : posts) {\n\t\t\tpost(result);\n\t\t}\n\t\tif (result.is_rooted()) {\n\t\t\tresult.prune_detached();\n\t\t}\n\t}\n\treturn result;\n}\n\n}\n}\n<commit_msg>Make parlex::job handle deadlocks differently.<commit_after>#include \"parlex\/detail\/job.hpp\"\n\n\/\/ ReSharper disable once CppUnusedIncludeDirective\n#include \"perf_timer.hpp\"\n#include \"tarjan.hpp\"\n\n#include \"parlex\/detail\/acceptor.hpp\"\n#include \"parlex\/detail\/configuration.hpp\"\n#include \"parlex\/detail\/grammar.hpp\"\n#include \"parlex\/detail\/match_class.hpp\"\n#include \"parlex\/detail\/parser.hpp\"\n#include \"parlex\/detail\/producer_table.hpp\"\n#include \"parlex\/detail\/subjob.hpp\"\n#include \"parlex\/detail\/terminal.hpp\"\n#include \"parlex\/detail\/token.hpp\"\n\n\/\/#include \"logging.hpp\"\n\nnamespace parlex {\nnamespace detail {\n\njob::job(parser & owner, std::u32string const & document, grammar const & g, uint16_t const rootRecognizerIndex, progress_handler_t const & progressHandler) :\n\tdocument(document),\n\tg(g),\n\tprogress(0),\n\towner(&owner),\n\tprogress_handler(progressHandler),\n\tprogress_counter(0) {\n\t\/\/DBG(\"starting job using recognizer '\", main, \"'\");\n\n\t\/\/similar to get_product, but different for constructor\n\t\/\/because parser::mutex is already locked\n\tmatch_class const matchClass(0, rootRecognizerIndex);\n\tauto & storage = producers[matchClass];\n\tauto const & root = g.get_recognizer(rootRecognizerIndex);\n\tif (root.is_terminal()) {\n\t\tauto const t = static_cast<terminal const *>(&root);  \/\/ NOLINT\n\t\tstorage = new token(*this, matchClass, *t);\n\t} else {\n\t\tauto const machine = static_cast<acceptor const *>(&root);  \/\/ NOLINT\n\t\tauto result = new subjob(*machine);\n\t\tstorage = result;\n\t\t\/\/seed the parser with the root state\n\t\tresult->begin_work_queue_reference();\n\t\tconfiguration const c = result->construct_start_state_configuration(0);\n\t\tuint8_t startState = machine->get_start_state();\n\t\towner.work.emplace_back(matchClass, c);\n\t\tresult->finish_creation(*this, matchClass);\n\t\t++owner.active_count;\n\t\t\/\/ start when parser::mutex is unlocked\n\t\towner.work_cv.notify_one();\n\t}\n}\n\nvoid job::connect(match_class const & requestedMatchClass, subjob & subscriber, match_class const & subscriberId, uint8_t const nextState, leaf const * l, transition_record const * history) {\n\tget_producer(requestedMatchClass).add_subscription(nextState, l, history, subscriber, subscriberId, requestedMatchClass, *this);\n}\n\nproducer & job::get_producer(match_class const & matchClass) {\n\tstd::unique_lock<std::mutex> lock(producers_mutex);\n\tauto & storage = producers[matchClass];\n\tif (storage == nullptr) {\n\t\tauto const & r = g.get_recognizer(matchClass.recognizer_index);\n\t\tif (r.is_terminal()) {\n\t\t\tauto const & t = *static_cast<terminal const *>(&r);  \/\/ NOLINT\n\t\t\tstorage = new token(*this, matchClass, t);\n\t\t} else {\n\t\t\tauto const machine = static_cast<acceptor const *>(&r);  \/\/ NOLINT\n\t\t\tauto newSubjobPtr = new subjob(*machine);\n\t\t\tstorage = newSubjobPtr;\n\t\t\tlock.unlock();\n\t\t\tnewSubjobPtr->start(*this, matchClass);\n\t\t}\n\t}\n\treturn *storage;\n}\n\nvoid job::update_progress(uint32_t const completed)\n{\n\tif (progress_handler) {\n\t\tuint32_t oldProgress = progress.load();\n\t\twhile (!progress_counter.compare_exchange_weak(oldProgress, completed) && oldProgress < completed) {}\n\t\tif (oldProgress < completed) {\n\t\t\tprogress_handler(completed, uint32_t(document.length()));\n\t\t}\n\t}\n}\n\n\/\/void job::fast_breakout() {\n\/\/\tfor (auto & pair : producers) {\n\/\/\t\tauto const & matchClass = pair.first;\n\/\/\t\tauto & producer = *pair.second;\n\/\/\t\tif (g.is_recognizer_left_recursive(matchClass.recognizer_index)) {\n\/\/\t\t\tproducer.terminate(*this, matchClass);\n\/\/\t\t}\n\/\/\t}\n\/\/}\n\nbool job::full_breakout() {\n\tstd::vector<match_class> vertices;\n\tstd::map<match_class, size_t> lookup;\n\tfor (auto const & pair : producers) {\n\t\tauto const & matchClass = pair.first;\n\t\tauto const & producer = *pair.second;\n\t\tif (producer.completed) {\n\t\t\tcontinue;\n\t\t}\n\t\tlookup[matchClass] = vertices.size();\n\t\tvertices.push_back(matchClass);\n\t}\n\n\tstd::function<std::vector<size_t> (size_t)> const edgeFunctor = [&](size_t vertexIndex){\n\t\tauto const & matchClass = vertices[vertexIndex];\n\t\tauto const & producer = producers.find(matchClass)->second;\n\t\tstd::vector<size_t> results;\n\t\tfor (auto const & subscription : producer->consumers) {\n\t\t\tif (get_producer(subscription.subscriber_id).completed) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tresults.push_back(lookup.find(subscription.subscriber_id)->second);\n\t\t}\n\t\treturn results;\n\t};\n\n\tauto stronglyConnectedComponents = tarjan(vertices.size(), edgeFunctor, true);\n\n\tauto anyHalted = false;\n\t\/\/halt the subjobs furthest down the hierarchy that are subscribed to themselves (in)directly\n\tfor (auto i = stronglyConnectedComponents.rbegin(); i != stronglyConnectedComponents.rend(); ++i) {\n\t\tstd::vector<std::vector<size_t>>::value_type const & stronglyConnectedComponent = *i;\n\t\tfor (auto vertexIndex: stronglyConnectedComponent) {\n\t\t\tauto const & matchClass = vertices[vertexIndex];\n\t\t\tget_producer(matchClass).terminate(*this, matchClass);\n\t\t\tanyHalted = true;\n\t\t}\n\t\tif (!owner->work.empty()) {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn !anyHalted;\n}\n\nbool job::handle_deadlocks() {\n\t\/\/perf_timer perf(__func__);\n\n\t\/\/fast_breakout();\n\n\t\/\/ Did fast_breakout free up any nodes to do some work?\n\tif (!owner->work.empty()) {\n\t\treturn false;\n\t}\n\n\treturn full_breakout();\n}\n\n\/\/Construct an ASS, and if a solution was found, prunes unreachable nodes\nabstract_syntax_semilattice job::construct_result(match const & m) {\n\t\/\/perf_timer timer(__FUNCTION__);\n\tauto result = abstract_syntax_semilattice(m);\n\tfor (auto const & pair : producers) {\n\t\tauto const & matchClass = pair.first;\n\t\tauto const & p = *pair.second;\n\t\tfor (auto const & pair2 : p.match_length_to_derivations) {\n\t\t\tauto const matchLength = pair2.first;\n\t\t\tmatch const n(matchClass, matchLength);\n\t\t\tauto const & derivations = pair2.second;\n\t\t\tresult.derivations_of_matches[n] = derivations;\n\t\t}\n\t}\n\n\tfor (auto entry : producers) {\n\t\tdelete entry.second;\n\t}\n\tproducers.clear();\n\n\tif (result.is_rooted()) {\n\t\tresult.prune_detached();\n\t\tparser::apply_precedence_and_associativity(g, result);\n\t\tresult.prune_detached();\n\t}\n\treturn result;\n}\n\n\nabstract_syntax_semilattice job::construct_result_and_postprocess(uint16_t const overrideRootRecognizerIndex, std::vector<post_processor> const & posts, std::u32string const & document) {\n\t\/\/perf_timer perf(__func__);\n\tauto result = construct_result(match(0, overrideRootRecognizerIndex, uint32_t(document.size())));\n\tif (!posts.empty()) {\n\t\tfor (auto const & post : posts) {\n\t\t\tpost(result);\n\t\t}\n\t\tif (result.is_rooted()) {\n\t\t\tresult.prune_detached();\n\t\t}\n\t}\n\treturn result;\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/! @Yue Wang\n\/\/!\n\/\/! ex12.13 What happens if we excute the following code?\n\/\/!\n\/\/  generate a runtime error : double free\n\/\/!\n\n#include <iostream>\n#include <memory>\n\nint main()\n{\n    {\n        auto sp = std::make_shared<int>();\n        auto p = sp.get();\n        delete p;\n    }\n\n    return 0;\n}\n<commit_msg>Update ex12_13.cpp<commit_after>\/\/!\n\/\/! ex12.13 What happens if we execute the following code?\n\/\/!\n\/\/! generate a runtime error : double free\n\/\/!\n\n#include <iostream>\n#include <memory>\n\nint main()\n{\n    {\n        auto sp = make_shared<int>();\n        auto p = sp.get();\n        delete p;\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 \"net\/base\/host_resolver.h\"\n\n#if defined(OS_WIN)\n#include <ws2tcpip.h>\n#include <wspiapi.h>  \/\/ Needed for Win2k compat.\n#elif defined(OS_POSIX)\n#include <netdb.h>\n#include <sys\/socket.h>\n#endif\n#if defined(OS_LINUX)\n#include <resolv.h>\n#endif\n\n#include \"base\/message_loop.h\"\n#include \"base\/string_util.h\"\n#include \"base\/worker_pool.h\"\n#include \"net\/base\/address_list.h\"\n#include \"net\/base\/net_errors.h\"\n\n#if defined(OS_WIN)\n#include \"net\/base\/winsock_init.h\"\n#endif\n\nnamespace net {\n\n\/\/-----------------------------------------------------------------------------\n\nstatic HostMapper* host_mapper;\n\nstd::string HostMapper::MapUsingPrevious(const std::string& host) {\n  return previous_mapper_.get() ? previous_mapper_->Map(host) : host;\n}\n\nHostMapper* SetHostMapper(HostMapper* value) {\n  std::swap(host_mapper, value);\n  return value;\n}\n\nstatic int HostResolverProc(\n    const std::string& host, const std::string& port, struct addrinfo** out) {\n  struct addrinfo hints = {0};\n  hints.ai_family = AF_UNSPEC;\n\n#if defined(OS_WIN)\n  \/\/ DO NOT USE AI_ADDRCONFIG ON WINDOWS.\n  \/\/\n  \/\/ The following comment in <winsock2.h> is the best documentation I found\n  \/\/ on AI_ADDRCONFIG for Windows:\n  \/\/   Flags used in \"hints\" argument to getaddrinfo()\n  \/\/       - AI_ADDRCONFIG is supported starting with Vista\n  \/\/       - default is AI_ADDRCONFIG ON whether the flag is set or not\n  \/\/         because the performance penalty in not having ADDRCONFIG in\n  \/\/         the multi-protocol stack environment is severe;\n  \/\/         this defaulting may be disabled by specifying the AI_ALL flag,\n  \/\/         in that case AI_ADDRCONFIG must be EXPLICITLY specified to\n  \/\/         enable ADDRCONFIG behavior\n  \/\/\n  \/\/ Not only is AI_ADDRCONFIG unnecessary, but it can be harmful.  If the\n  \/\/ computer is not connected to a network, AI_ADDRCONFIG causes getaddrinfo\n  \/\/ to fail with WSANO_DATA (11004) for \"localhost\", probably because of the\n  \/\/ following note on AI_ADDRCONFIG in the MSDN getaddrinfo page:\n  \/\/   The IPv4 or IPv6 loopback address is not considered a valid global\n  \/\/   address.\n  \/\/ See http:\/\/crbug.com\/5234.\n  hints.ai_flags = 0;\n#else\n  hints.ai_flags = AI_ADDRCONFIG;\n#endif\n\n  \/\/ Restrict result set to only this socket type to avoid duplicates.\n  hints.ai_socktype = SOCK_STREAM;\n\n  int err = getaddrinfo(host.c_str(), port.c_str(), &hints, out);\n#if defined(OS_LINUX)\n  \/\/ If we fail, re-initialise the resolver just in case there have been any\n  \/\/ changes to \/etc\/resolv.conf and retry. See http:\/\/crbug.com\/11380 for info.\n  if (err && !res_init())\n    err = getaddrinfo(host.c_str(), port.c_str(), &hints, out);\n#endif\n\n  return err ? ERR_NAME_NOT_RESOLVED : OK;\n}\n\nstatic int ResolveAddrInfo(HostMapper* mapper, const std::string& host,\n                           const std::string& port, struct addrinfo** out) {\n  if (mapper) {\n    std::string mapped_host = mapper->Map(host);\n\n    if (mapped_host.empty())\n      return ERR_NAME_NOT_RESOLVED;\n\n    return HostResolverProc(mapped_host, port, out);\n  } else {\n    return HostResolverProc(host, port, out);\n  }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nclass HostResolver::Request :\n    public base::RefCountedThreadSafe<HostResolver::Request> {\n public:\n  Request(HostResolver* resolver,\n          const std::string& host,\n          const std::string& port,\n          AddressList* addresses,\n          CompletionCallback* callback)\n      : host_(host),\n        port_(port),\n        resolver_(resolver),\n        addresses_(addresses),\n        callback_(callback),\n        origin_loop_(MessageLoop::current()),\n        host_mapper_(host_mapper),\n        error_(OK),\n        results_(NULL) {\n  }\n\n  ~Request() {\n    if (results_)\n      freeaddrinfo(results_);\n  }\n\n  void DoLookup() {\n    \/\/ Running on the worker thread\n    error_ = ResolveAddrInfo(host_mapper_, host_, port_, &results_);\n\n    Task* reply = NewRunnableMethod(this, &Request::DoCallback);\n\n    \/\/ The origin loop could go away while we are trying to post to it, so we\n    \/\/ need to call its PostTask method inside a lock.  See ~HostResolver.\n    {\n      AutoLock locked(origin_loop_lock_);\n      if (origin_loop_) {\n        origin_loop_->PostTask(FROM_HERE, reply);\n        reply = NULL;\n      }\n    }\n\n    \/\/ Does nothing if it got posted.\n    delete reply;\n  }\n\n  void DoCallback() {\n    \/\/ Running on the origin thread.\n    DCHECK(error_ || results_);\n\n    \/\/ We may have been cancelled!\n    if (!resolver_)\n      return;\n\n    if (!error_) {\n      addresses_->Adopt(results_);\n      results_ = NULL;\n    }\n\n    \/\/ Drop the resolver's reference to us.  Do this before running the\n    \/\/ callback since the callback might result in the resolver being\n    \/\/ destroyed.\n    resolver_->request_ = NULL;\n\n    callback_->Run(error_);\n  }\n\n  void Cancel() {\n    resolver_ = NULL;\n\n    AutoLock locked(origin_loop_lock_);\n    origin_loop_ = NULL;\n  }\n\n private:\n  \/\/ Set on the origin thread, read on the worker thread.\n  std::string host_;\n  std::string port_;\n\n  \/\/ Only used on the origin thread (where Resolve was called).\n  HostResolver* resolver_;\n  AddressList* addresses_;\n  CompletionCallback* callback_;\n\n  \/\/ Used to post ourselves onto the origin thread.\n  Lock origin_loop_lock_;\n  MessageLoop* origin_loop_;\n\n  \/\/ Hold an owning reference to the host mapper that we are going to use.\n  \/\/ This may not be the current host mapper by the time we call\n  \/\/ ResolveAddrInfo, but that's OK... we'll use it anyways, and the owning\n  \/\/ reference ensures that it remains valid until we are done.\n  scoped_refptr<HostMapper> host_mapper_;\n\n  \/\/ Assigned on the worker thread, read on the origin thread.\n  int error_;\n  struct addrinfo* results_;\n};\n\n\/\/-----------------------------------------------------------------------------\n\nHostResolver::HostResolver() {\n#if defined(OS_WIN)\n  EnsureWinsockInit();\n#endif\n}\n\nHostResolver::~HostResolver() {\n  if (request_)\n    request_->Cancel();\n}\n\nint HostResolver::Resolve(const std::string& hostname, int port,\n                          AddressList* addresses,\n                          CompletionCallback* callback) {\n  DCHECK(!request_) << \"resolver already in use\";\n\n  const std::string& port_str = IntToString(port);\n\n  \/\/ Do a synchronous resolution.\n  if (!callback) {\n    struct addrinfo* results;\n    int rv = ResolveAddrInfo(host_mapper, hostname, port_str, &results);\n    if (rv == OK)\n      addresses->Adopt(results);\n    return rv;\n  }\n\n  request_ = new Request(this, hostname, port_str, addresses, callback);\n\n  \/\/ Dispatch to worker thread...\n  if (!WorkerPool::PostTask(FROM_HERE,\n          NewRunnableMethod(request_.get(), &Request::DoLookup), true)) {\n    NOTREACHED();\n    request_ = NULL;\n    return ERR_FAILED;\n  }\n\n  return ERR_IO_PENDING;\n}\n\n}  \/\/ namespace net\n<commit_msg>Use res_ninit for thread safety and a timer for reloading resolv.conf on Linux.<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 \"net\/base\/host_resolver.h\"\n\n#if defined(OS_WIN)\n#include <ws2tcpip.h>\n#include <wspiapi.h>  \/\/ Needed for Win2k compat.\n#elif defined(OS_POSIX)\n#include <netdb.h>\n#include <sys\/socket.h>\n#endif\n#if defined(OS_LINUX)\n#include <resolv.h>\n#endif\n\n#include \"base\/message_loop.h\"\n#include \"base\/string_util.h\"\n#include \"base\/worker_pool.h\"\n#include \"net\/base\/address_list.h\"\n#include \"net\/base\/net_errors.h\"\n\n#if defined(OS_LINUX)\n#include \"base\/singleton.h\"\n#include \"base\/thread_local_storage.h\"\n#include \"base\/time.h\"\n#endif\n\n#if defined(OS_WIN)\n#include \"net\/base\/winsock_init.h\"\n#endif\n\nnamespace net {\n\n\/\/-----------------------------------------------------------------------------\n\nstatic HostMapper* host_mapper;\n\nstd::string HostMapper::MapUsingPrevious(const std::string& host) {\n  return previous_mapper_.get() ? previous_mapper_->Map(host) : host;\n}\n\nHostMapper* SetHostMapper(HostMapper* value) {\n  std::swap(host_mapper, value);\n  return value;\n}\n\n#if defined(OS_LINUX)\n\/\/ On Linux changes to \/etc\/resolv.conf can go unnoticed thus resulting in\n\/\/ DNS queries failing either because nameservers are unknown on startup\n\/\/ or because nameserver info has changed as a result of e.g. connecting to\n\/\/ a new network. Some distributions patch glibc to stat \/etc\/resolv.conf\n\/\/ to try to automatically detect such changes but these patches are not\n\/\/ universal and even patched systems such as Jaunty appear to need calls\n\/\/ to res_ninit to reload the nameserver information in different threads.\n\/\/\n\/\/ We adopt the Mozilla solution here which is to call res_ninit when\n\/\/ lookups fail and to rate limit the reloading to once per second per\n\/\/ thread.\n\n\/\/ Keep a timer per calling thread to rate limit the calling of res_ninit.\nclass DnsReloadTimer {\n public:\n  DnsReloadTimer() {\n    tls_index_.Initialize(SlotReturnFunction);\n  }\n\n  ~DnsReloadTimer() { }\n\n  \/\/ Check if the timer for the calling thread has expired. When no\n  \/\/ timer exists for the calling thread, create one.\n  bool Expired() {\n    const base::TimeDelta kRetryTime = base::TimeDelta::FromSeconds(1);\n    base::TimeTicks now = base::TimeTicks::Now();\n    base::TimeTicks* timer_ptr =\n      static_cast<base::TimeTicks*>(tls_index_.Get());\n\n    if (!timer_ptr) {\n      timer_ptr = new base::TimeTicks();\n      *timer_ptr = base::TimeTicks::Now();\n      tls_index_.Set(timer_ptr);\n      \/\/ Return true to reload dns info on the first call for each thread.\n      return true;\n    } else if (now - *timer_ptr > kRetryTime) {\n      *timer_ptr = now;\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  \/\/ Free the allocated timer.\n  static void SlotReturnFunction(void* data) {\n    base::TimeTicks* tls_data = static_cast<base::TimeTicks*>(data);\n    delete tls_data;\n  }\n\n private:\n  \/\/ We use thread local storage to identify which base::TimeTicks to\n  \/\/ interact with.\n  static ThreadLocalStorage::Slot tls_index_ ;\n\n  DISALLOW_COPY_AND_ASSIGN(DnsReloadTimer);\n};\n\n\/\/ A TLS slot to the TimeTicks for the current thread.\n\/\/ static\nThreadLocalStorage::Slot DnsReloadTimer::tls_index_(base::LINKER_INITIALIZED);\n\n#endif  \/\/ defined(OS_LINUX)\n\nstatic int HostResolverProc(\n    const std::string& host, const std::string& port, struct addrinfo** out) {\n  struct addrinfo hints = {0};\n  hints.ai_family = AF_UNSPEC;\n\n#if defined(OS_WIN)\n  \/\/ DO NOT USE AI_ADDRCONFIG ON WINDOWS.\n  \/\/\n  \/\/ The following comment in <winsock2.h> is the best documentation I found\n  \/\/ on AI_ADDRCONFIG for Windows:\n  \/\/   Flags used in \"hints\" argument to getaddrinfo()\n  \/\/       - AI_ADDRCONFIG is supported starting with Vista\n  \/\/       - default is AI_ADDRCONFIG ON whether the flag is set or not\n  \/\/         because the performance penalty in not having ADDRCONFIG in\n  \/\/         the multi-protocol stack environment is severe;\n  \/\/         this defaulting may be disabled by specifying the AI_ALL flag,\n  \/\/         in that case AI_ADDRCONFIG must be EXPLICITLY specified to\n  \/\/         enable ADDRCONFIG behavior\n  \/\/\n  \/\/ Not only is AI_ADDRCONFIG unnecessary, but it can be harmful.  If the\n  \/\/ computer is not connected to a network, AI_ADDRCONFIG causes getaddrinfo\n  \/\/ to fail with WSANO_DATA (11004) for \"localhost\", probably because of the\n  \/\/ following note on AI_ADDRCONFIG in the MSDN getaddrinfo page:\n  \/\/   The IPv4 or IPv6 loopback address is not considered a valid global\n  \/\/   address.\n  \/\/ See http:\/\/crbug.com\/5234.\n  hints.ai_flags = 0;\n#else\n  hints.ai_flags = AI_ADDRCONFIG;\n#endif\n\n  \/\/ Restrict result set to only this socket type to avoid duplicates.\n  hints.ai_socktype = SOCK_STREAM;\n\n  int err = getaddrinfo(host.c_str(), port.c_str(), &hints, out);\n#if defined(OS_LINUX)\n  net::DnsReloadTimer* dns_timer = Singleton<net::DnsReloadTimer>::get();\n  \/\/ If we fail, re-initialise the resolver just in case there have been any\n  \/\/ changes to \/etc\/resolv.conf and retry. See http:\/\/crbug.com\/11380 for info.\n  if (err && dns_timer->Expired() && !res_ninit(&_res))\n    err = getaddrinfo(host.c_str(), port.c_str(), &hints, out);\n#endif\n\n  return err ? ERR_NAME_NOT_RESOLVED : OK;\n}\n\nstatic int ResolveAddrInfo(HostMapper* mapper, const std::string& host,\n                           const std::string& port, struct addrinfo** out) {\n  if (mapper) {\n    std::string mapped_host = mapper->Map(host);\n\n    if (mapped_host.empty())\n      return ERR_NAME_NOT_RESOLVED;\n\n    return HostResolverProc(mapped_host, port, out);\n  } else {\n    return HostResolverProc(host, port, out);\n  }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nclass HostResolver::Request :\n    public base::RefCountedThreadSafe<HostResolver::Request> {\n public:\n  Request(HostResolver* resolver,\n          const std::string& host,\n          const std::string& port,\n          AddressList* addresses,\n          CompletionCallback* callback)\n      : host_(host),\n        port_(port),\n        resolver_(resolver),\n        addresses_(addresses),\n        callback_(callback),\n        origin_loop_(MessageLoop::current()),\n        host_mapper_(host_mapper),\n        error_(OK),\n        results_(NULL) {\n  }\n\n  ~Request() {\n    if (results_)\n      freeaddrinfo(results_);\n  }\n\n  void DoLookup() {\n    \/\/ Running on the worker thread\n    error_ = ResolveAddrInfo(host_mapper_, host_, port_, &results_);\n\n    Task* reply = NewRunnableMethod(this, &Request::DoCallback);\n\n    \/\/ The origin loop could go away while we are trying to post to it, so we\n    \/\/ need to call its PostTask method inside a lock.  See ~HostResolver.\n    {\n      AutoLock locked(origin_loop_lock_);\n      if (origin_loop_) {\n        origin_loop_->PostTask(FROM_HERE, reply);\n        reply = NULL;\n      }\n    }\n\n    \/\/ Does nothing if it got posted.\n    delete reply;\n  }\n\n  void DoCallback() {\n    \/\/ Running on the origin thread.\n    DCHECK(error_ || results_);\n\n    \/\/ We may have been cancelled!\n    if (!resolver_)\n      return;\n\n    if (!error_) {\n      addresses_->Adopt(results_);\n      results_ = NULL;\n    }\n\n    \/\/ Drop the resolver's reference to us.  Do this before running the\n    \/\/ callback since the callback might result in the resolver being\n    \/\/ destroyed.\n    resolver_->request_ = NULL;\n\n    callback_->Run(error_);\n  }\n\n  void Cancel() {\n    resolver_ = NULL;\n\n    AutoLock locked(origin_loop_lock_);\n    origin_loop_ = NULL;\n  }\n\n private:\n  \/\/ Set on the origin thread, read on the worker thread.\n  std::string host_;\n  std::string port_;\n\n  \/\/ Only used on the origin thread (where Resolve was called).\n  HostResolver* resolver_;\n  AddressList* addresses_;\n  CompletionCallback* callback_;\n\n  \/\/ Used to post ourselves onto the origin thread.\n  Lock origin_loop_lock_;\n  MessageLoop* origin_loop_;\n\n  \/\/ Hold an owning reference to the host mapper that we are going to use.\n  \/\/ This may not be the current host mapper by the time we call\n  \/\/ ResolveAddrInfo, but that's OK... we'll use it anyways, and the owning\n  \/\/ reference ensures that it remains valid until we are done.\n  scoped_refptr<HostMapper> host_mapper_;\n\n  \/\/ Assigned on the worker thread, read on the origin thread.\n  int error_;\n  struct addrinfo* results_;\n};\n\n\/\/-----------------------------------------------------------------------------\n\nHostResolver::HostResolver() {\n#if defined(OS_WIN)\n  EnsureWinsockInit();\n#endif\n}\n\nHostResolver::~HostResolver() {\n  if (request_)\n    request_->Cancel();\n}\n\nint HostResolver::Resolve(const std::string& hostname, int port,\n                          AddressList* addresses,\n                          CompletionCallback* callback) {\n  DCHECK(!request_) << \"resolver already in use\";\n\n  const std::string& port_str = IntToString(port);\n\n  \/\/ Do a synchronous resolution.\n  if (!callback) {\n    struct addrinfo* results;\n    int rv = ResolveAddrInfo(host_mapper, hostname, port_str, &results);\n    if (rv == OK)\n      addresses->Adopt(results);\n    return rv;\n  }\n\n  request_ = new Request(this, hostname, port_str, addresses, callback);\n\n  \/\/ Dispatch to worker thread...\n  if (!WorkerPool::PostTask(FROM_HERE,\n          NewRunnableMethod(request_.get(), &Request::DoLookup), true)) {\n    NOTREACHED();\n    request_ = NULL;\n    return ERR_FAILED;\n  }\n\n  return ERR_IO_PENDING;\n}\n\n}  \/\/ namespace net\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * CogServerSCM.cc\n *\n * Copyright (C) 2015 OpenCog Foundation\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\n * 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\n * 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\/\/ The header file bits.\n\n#ifndef _OPENCOG_COGSERVER_SCM_H\n#define _OPENCOG_COGSERVER_SCM_H\n\n#include <thread>\n\n#include <opencog\/atomspace\/AtomSpace.h>\n#include <opencog\/server\/CogServer.h>\n\nnamespace opencog\n{\n\nclass CogServerSCM\n{\nprivate:\n    static void* init_in_guile(void*);\n    static void init_in_module(void*);\n    void init(void);\n\n    void start_server(const std::string&);\n    void stop_server(void);\n\n    CogServer* srvr = NULL;\n    std::thread * main_loop = NULL;\n\npublic:\n    CogServerSCM();\n};\n\n\nextern \"C\" {\nvoid opencog_cogserver_init(void);\n};\n\n}\n#endif \/\/ _OPENCOG_COGSERVER_SCM_H\n\n\/\/ --------------------------------------------------------------\n\n#include <opencog\/util\/Config.h>\n#include <opencog\/guile\/SchemePrimitive.h>\n\n\/**\n * Implement a dynamically-loadable cogserver guile module.\n * This is mostly to allow a networked, agent-based system to run.\n *\n * This is a bare-bones implementation. Things like the server\n * port number, and maybe even the server atomspace, should be\n * configurable from guile, instead of the conf file.\n *\n * If\/when python agents are supplanted by something newer, then\n * maybe this goes away.\n *\/\n\nusing namespace opencog;\n\nCogServerSCM::CogServerSCM()\n{\n    static bool is_init = false;\n    if (is_init) return;\n    is_init = true;\n    scm_with_guile(init_in_guile, this);\n}\n\nvoid* CogServerSCM::init_in_guile(void* self)\n{\n    scm_c_define_module(\"opencog cogserver\", init_in_module, self);\n    scm_c_use_module(\"opencog cogserver\");\n    return NULL;\n}\n\nvoid CogServerSCM::init_in_module(void* data)\n{\n    CogServerSCM* self = (CogServerSCM*) data;\n    self->init();\n}\n\n\/**\n * The main init function for the CogServerSCM object.\n *\/\nvoid CogServerSCM::init()\n{\n    define_scheme_primitive(\"c-start-cogserver\", &CogServerSCM::start_server, this, \"cogserver\");\n}\n\nextern \"C\" {\nvoid opencog_cogserver_init(void)\n{\n    static CogServerSCM cogserver;\n}\n};\n\n\/\/ --------------------------------------------------------------\n\nvoid CogServerSCM::start_server(const std::string& cfg)\n{\n    \/\/ singleton instance\n    if (srvr) return;\n\n    \/\/ The default config file is installed from\n    \/\/ $SRCDIR\/lib\/cogserver.conf and is copied to\n    \/\/ \/usr\/local\/etc\/cogservedr.conf\n    \/\/ by default. Use it if we can; it has sane file paths in it.\n    if (0 < cfg.size())\n        config().load(cfg.c_str(), true);\n    else\n        config().load(\"cogserver.conf\", true);\n\n    srvr = &cogserver();\n\n    \/\/ Open database *before* loading modules, since the modules\n    \/\/ might create atoms, and we can't have that happen until\n    \/\/ storage is open, as otherwise, there will be handle conflicts.\n    srvr->openDatabase();\n\n    \/\/ Load modules specified in config\n    srvr->loadModules();\n    srvr->loadSCMModules();\n\n    \/\/ Enable the network server and run the server's main loop\n    srvr->enableNetworkServer();\n    main_loop = new std::thread(&CogServer::serverLoop, srvr);\n}\n\nvoid CogServerSCM::stop_server(void)\n{\n}\n<commit_msg>Add a server shutdown.<commit_after>\/*\n * CogServerSCM.cc\n *\n * Copyright (C) 2015 OpenCog Foundation\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\n * 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\n * 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\/\/ The header file bits.\n\n#ifndef _OPENCOG_COGSERVER_SCM_H\n#define _OPENCOG_COGSERVER_SCM_H\n\n#include <thread>\n\n#include <opencog\/atomspace\/AtomSpace.h>\n#include <opencog\/server\/CogServer.h>\n\nnamespace opencog\n{\n\nclass CogServerSCM\n{\nprivate:\n    static void* init_in_guile(void*);\n    static void init_in_module(void*);\n    void init(void);\n\n    void start_server(const std::string&);\n    void stop_server(void);\n\n    CogServer* srvr = NULL;\n    std::thread * main_loop = NULL;\n\npublic:\n    CogServerSCM();\n};\n\n\nextern \"C\" {\nvoid opencog_cogserver_init(void);\n};\n\n}\n#endif \/\/ _OPENCOG_COGSERVER_SCM_H\n\n\/\/ --------------------------------------------------------------\n\n#include <opencog\/util\/Config.h>\n#include <opencog\/guile\/SchemePrimitive.h>\n\n\/**\n * Implement a dynamically-loadable cogserver guile module.\n * This is mostly to allow a networked, agent-based system to run.\n *\n * This is a bare-bones implementation. Things like the server\n * port number, and maybe even the server atomspace, should be\n * configurable from guile, instead of the conf file.\n *\n * If\/when python agents are supplanted by something newer, then\n * maybe this goes away.\n *\/\n\nusing namespace opencog;\n\nCogServerSCM::CogServerSCM()\n{\n    static bool is_init = false;\n    if (is_init) return;\n    is_init = true;\n    scm_with_guile(init_in_guile, this);\n}\n\nvoid* CogServerSCM::init_in_guile(void* self)\n{\n    scm_c_define_module(\"opencog cogserver\", init_in_module, self);\n    scm_c_use_module(\"opencog cogserver\");\n    return NULL;\n}\n\nvoid CogServerSCM::init_in_module(void* data)\n{\n    CogServerSCM* self = (CogServerSCM*) data;\n    self->init();\n}\n\n\/**\n * The main init function for the CogServerSCM object.\n *\/\nvoid CogServerSCM::init()\n{\n    define_scheme_primitive(\"c-start-cogserver\", &CogServerSCM::start_server, this, \"cogserver\");\n    define_scheme_primitive(\"stop-cogserver\", &CogServerSCM::stop_server, this, \"cogserver\");\n}\n\nextern \"C\" {\nvoid opencog_cogserver_init(void)\n{\n    static CogServerSCM cogserver;\n}\n};\n\n\/\/ --------------------------------------------------------------\n\nvoid CogServerSCM::start_server(const std::string& cfg)\n{\n    \/\/ singleton instance\n    if (srvr) return;\n\n    \/\/ The default config file is installed from\n    \/\/ $SRCDIR\/lib\/cogserver.conf and is copied to\n    \/\/ \/usr\/local\/etc\/cogservedr.conf\n    \/\/ by default. Use it if we can; it has sane file paths in it.\n    if (0 < cfg.size())\n        config().load(cfg.c_str(), true);\n    else\n        config().load(\"cogserver.conf\", true);\n\n    srvr = &cogserver();\n\n    \/\/ Open database *before* loading modules, since the modules\n    \/\/ might create atoms, and we can't have that happen until\n    \/\/ storage is open, as otherwise, there will be handle conflicts.\n    srvr->openDatabase();\n\n    \/\/ Load modules specified in config\n    srvr->loadModules();\n    srvr->loadSCMModules();\n\n    \/\/ Enable the network server and run the server's main loop\n    srvr->enableNetworkServer();\n    main_loop = new std::thread(&CogServer::serverLoop, srvr);\n}\n\nvoid CogServerSCM::stop_server(void)\n{\n    \/\/ delete singleton instance\n    if (NULL == srvr) return;\n\n    \/\/ This is probably not thread-safe...\n    srvr->stop();\n    main_loop->join();\n\n    \/\/ I suspect this does not close the listen socket correctly.\n    \/\/ XXX this all needs to be fixed.\n    srvr->disableNetworkServer();\n    delete main_loop;\n    delete srvr;\n    srvr = NULL;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"JobManager.h\"\n\n#include <vector>\n#include <mutex>\n\n#include <thread>\n#include <algorithm>\n#include <cassert>\n\n#include \"Job.h\"\n\n#if _WIN32 || _WIN64\n#include <immintrin.h>\n#define YIELD_COMMAND _mm_pause();\n#else\nstatic_assert(0 && \"YIELD COMMAND Not Specified For Platform\")\n#endif\n\n\n\n\/\/ based on the job system detailed at molecular musings: https:\/\/blog.molecular-matters.com\/2015\/08\/24\/job-system-2-0-lock-free-work-stealing-part-1-basics\/\n\nconstexpr unsigned int NUMBER_OF_JOBS{ 4096 };\nconstexpr unsigned int NUMBER_OF_JOBS_MASK{ 4096 - 1 };\nconstexpr unsigned int MAX_NUMBER_OF_QUEUES{ 8 };\n\nbool g_runJobs { true };\nstd::condition_variable g_hasJobsConditionVariable{};\n\nstruct VeritasEngine::JobManager::WorkQueue\n{\n\tvoid Push(Job* job)\n\t{\n\t\tauto b = m_bottom.load(std::memory_order_acquire);\n\t\tm_jobs[b & NUMBER_OF_JOBS_MASK] = job;\n\t\tm_bottom.store(b + 1, std::memory_order_release);\n\t}\n\n\tJob* Pop()\n\t{\n\t\tauto b = m_bottom.load(std::memory_order_acquire) - 1;\n\t\tm_bottom.exchange(b, std::memory_order_release);\n\n\t\tauto t = m_top.load();\n\t\tif(t <= b)\n\t\t{\n\t\t\tauto job = m_jobs[b & NUMBER_OF_JOBS_MASK];\n\n\t\t\tif(t != b)\n\t\t\t{\n\t\t\t\treturn job;\n\t\t\t}\n\n\t\t\tif(!m_top.compare_exchange_strong(t, t+1))\n\t\t\t{\n\t\t\t\tjob = nullptr;\n\t\t\t}\n\n\t\t\tm_bottom = t + 1;\n\t\t\treturn job;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_bottom = t;\n\t\t\treturn nullptr;\n\t\t}\n\t}\n\n\tJob* Steal()\n\t{\n\t\tauto t = m_top.load(std::memory_order_acquire);\n\t\tauto b = m_bottom.load(std::memory_order_acquire);\n\t\tif(t < b)\n\t\t{\n\t\t\tconst auto job = m_jobs[t & NUMBER_OF_JOBS_MASK];\n\n\t\t\tif(!m_top.compare_exchange_strong(t, t+1))\n\t\t\t{\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\treturn job;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn nullptr;\n\t\t}\n\t}\n\nprivate:\n\tJob* m_jobs[NUMBER_OF_JOBS];\n\tstd::atomic_long m_bottom{ 0 };\n\tstd::atomic_long m_top{ 0 };\n\t\n};\n\nstruct VeritasEngine::JobManager::Impl\n{\n\tImpl()\n\t: m_queueCount{ std::min(std::thread::hardware_concurrency(), MAX_NUMBER_OF_QUEUES) }\n\t{\n\t\tstatic_assert(std::atomic_int32_t::is_always_lock_free == true && \"Platform is not lock free\");\n\t}\n\n\tvoid Init()\n\t{\n\t\tm_queueIndex = 0;\n\n\t\tm_workerThreads.reserve(m_queueCount - 1);\n\n\t\tfor (unsigned i = 1; i < m_queueCount; i++)\n\t\t{\n\t\t\tm_workerThreads.emplace_back(ThreadMain, this, i);\n\t\t}\n\t}\n\n\t~Impl()\n\t{\n\t\tg_runJobs = false;\n\t\tg_hasJobsConditionVariable.notify_all();\n\n\t\tfor(auto& t : m_workerThreads)\n\t\t{\n\t\t\tif (t.joinable())\n\t\t\t{\n\t\t\t\tt.join();\n\t\t\t}\n\t\t}\n\n\t\tm_workerThreads.clear();\n\t}\n\n\tvoid Push(Job* job)\n\t{\n\t\tGetQueue().Push(job);\n\t\t++m_activeJobCount;\n\t\tg_hasJobsConditionVariable.notify_all();\n\t}\n\n\tJob* AllocateJob()\n\t{\n\t\tconst auto index = m_allocatedJobs++;\n\t\treturn &m_jobs[index & NUMBER_OF_JOBS_MASK];\n\t}\n\n\tWorkQueue& GetQueue()\n\t{\n\t\treturn m_queues[m_queueIndex];\n\t}\n\n\tvoid ExecuteJob(Job* job)\n\t{\n\t\t(job->Callback)(job, job->Data);\n\t\tFinishJob(job);\n\t}\n\n\tJob* GetJob()\n\t{\n\t\tauto& queue = GetQueue();\n\n\t\tconst auto job = queue.Pop();\n\t\tif (job == nullptr)\n\t\t{\n\t\t\tauto& otherQueue = m_queues[0];\n\n\t\t\tif (&queue == &otherQueue)\n\t\t\t{\n\t\t\t\tYield();\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\tJob* stolenJob = otherQueue.Steal();\n\n\t\t\tif (stolenJob)\n\t\t\t{\n\t\t\t\treturn stolenJob;\n\t\t\t}\n\n\t\t\tauto& randomQueue = m_queues[rand() % m_queueCount];\n\n\t\t\tif (&queue == &randomQueue)\n\t\t\t{\n\t\t\t\tYield();\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\tstolenJob = randomQueue.Steal();\n\n\t\t\tif (stolenJob == nullptr)\n\t\t\t{\n\t\t\t\tYield();\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\treturn stolenJob;\n\t\t}\n\t\treturn job;\n\t}\n\nprivate:\n\tvoid FinishJob(Job* job)\n\t{\n\t\tconst auto jobCount = --job->UnfinishedJobs;\n\n\t\tif (jobCount == 0 && (job->Parent))\n\t\t{\n\t\t\tFinishJob(job->Parent);\n\t\t}\n\n\t\t--m_activeJobCount;\n\t}\n\n\tstatic void Yield()\n\t{\n\t\tYIELD_COMMAND\n\t}\n\n\tstatic void ThreadMain(Impl* impl, const unsigned int queueIndex)\n\t{\n\t\tm_queueIndex = queueIndex;\n\n\t\tstd::unique_lock<std::mutex> lock{ m_threadMainMutex };\n\t\t\t\t\n\t\twhile (g_runJobs)\n\t\t{\n\t\t\tg_hasJobsConditionVariable.wait(lock, [&] { return impl->m_activeJobCount > 0 || !g_runJobs; });\n\n\t\t\t\/\/ double check if we need to run jobs since we may be trying to shut down the engine\n\t\t\tif (g_runJobs)\n\t\t\t{\n\t\t\t\tconst auto job = impl->GetJob();\n\t\t\t\tif (job != nullptr)\n\t\t\t\t{\n\t\t\t\t\timpl->ExecuteJob(job);\n\t\t\t\t}\n\t\t\t}\n\t\t}\t\t\n\t}\n\n\tstatic thread_local unsigned int m_queueIndex;\n\tstatic thread_local unsigned int m_allocatedJobs;\n\tstatic thread_local std::mutex m_threadMainMutex;\n\tstatic thread_local Job m_jobs[NUMBER_OF_JOBS];\n\n\tunsigned int m_queueCount;\n\tstd::atomic_int32_t m_activeJobCount{ 0 };\n\tWorkQueue m_queues[MAX_NUMBER_OF_QUEUES];\n\tstd::vector<std::thread> m_workerThreads{};\n};\n\nthread_local unsigned int VeritasEngine::JobManager::Impl::m_queueIndex;\nthread_local unsigned int VeritasEngine::JobManager::Impl::m_allocatedJobs { 0 };\nthread_local std::mutex VeritasEngine::JobManager::Impl::m_threadMainMutex{};\nthread_local VeritasEngine::Job VeritasEngine::JobManager::Impl::m_jobs[NUMBER_OF_JOBS];\n\nVeritasEngine::JobManager::JobManager()\n\t: m_impl{std::make_unique<Impl>() }\n{\n\n}\n\nVeritasEngine::JobManager::JobManager(JobManager&& other) noexcept\n\t: m_impl{ std::move(other.m_impl) }\n{\n\n}\n\nvoid VeritasEngine::JobManager::Init()\n{\n\tm_impl->Init();\n}\n\nVeritasEngine::Job* VeritasEngine::JobManager::CreateJob(JobFunction&& function)\n{\n\treturn CreateJob(std::move(function), nullptr, 0);\n}\n\nVeritasEngine::Job* VeritasEngine::JobManager::CreateJob(JobFunction&& function, void* data, const size_t sizeOfData)\n{\n\tassert(sizeOfData < sizeof(Job::Data));\n\n\tauto job = m_impl->AllocateJob();\n\tjob->Callback = std::move(function);\n\tjob->Parent = nullptr;\n\tjob->UnfinishedJobs = 1;\n\n\tif (data)\n\t{\n\t\tstd::memcpy(job->Data, data, sizeOfData);\n\t}\n\n\treturn job;\n}\n\nVeritasEngine::Job* VeritasEngine::JobManager::CreateJobAsChild(Job* parent, JobFunction&& jobFunction)\n{\n\treturn CreateJobAsChild(parent, std::move(jobFunction), nullptr, 0);\n}\n\nVeritasEngine::Job* VeritasEngine::JobManager::CreateJobAsChild(Job* parent, JobFunction&& jobFunction, void* data, const size_t sizeOfData)\n{\n\t++parent->UnfinishedJobs;\n\n\tauto job = m_impl->AllocateJob();\n\tjob->Callback = std::move(jobFunction);\n\tjob->Parent = parent;\n\tjob->UnfinishedJobs = 1;\n\n\tif (data)\n\t{\n\t\tstd::memcpy(job->Data, data, sizeOfData);\n\t}\n\n\treturn job;\n}\n\nvoid VeritasEngine::JobManager::Run(Job* job)\n{\n\tm_impl->Push(job);\n}\n\nvoid VeritasEngine::JobManager::Wait(Job* job)\n{\n\twhile(job->UnfinishedJobs > 0)\n\t{\n\t\tconst auto nextJob = m_impl->GetJob();\n\n\t\tif(nextJob != nullptr)\n\t\t{\n\t\t\tm_impl->ExecuteJob(nextJob);\n\t\t}\n\t}\n}\n\nVeritasEngine::JobManager& VeritasEngine::JobManager::operator=(JobManager&& other) noexcept\n{\n\tif(this != &other)\n\t{\n\t\tthis->m_impl = std::move(other.m_impl);\n\t}\n\n\treturn *this;\n}\n<commit_msg>changing to use relaxed with atomic_fences<commit_after>#include \"JobManager.h\"\n\n#include <vector>\n#include <mutex>\n\n#include <thread>\n#include <algorithm>\n#include <cassert>\n\n#include \"Job.h\"\n\n#if _WIN32 || _WIN64\n#include <immintrin.h>\n#define YIELD_COMMAND _mm_pause();\n#else\nstatic_assert(0 && \"YIELD COMMAND Not Specified For Platform\")\n#endif\n\n\n\n\/\/ based on the job system detailed at molecular musings: https:\/\/blog.molecular-matters.com\/2015\/08\/24\/job-system-2-0-lock-free-work-stealing-part-1-basics\/\n\nconstexpr unsigned int NUMBER_OF_JOBS{ 4096 };\nconstexpr unsigned int NUMBER_OF_JOBS_MASK{ 4096 - 1 };\nconstexpr unsigned int MAX_NUMBER_OF_QUEUES{ 8 };\n\nbool g_runJobs { true };\nstd::condition_variable g_hasJobsConditionVariable{};\n\nstruct VeritasEngine::JobManager::WorkQueue\n{\n\tvoid Push(Job* job)\n\t{\n\t\tauto b = m_bottom.load(std::memory_order_relaxed);\n\t\tm_jobs[b & NUMBER_OF_JOBS_MASK] = job;\n\n\t\tstd::atomic_thread_fence(std::memory_order_acquire);\n\n\t\tm_bottom.store(b + 1, std::memory_order_relaxed);\n\t}\n\n\tJob* Pop()\n\t{\n\t\tauto b = m_bottom.load(std::memory_order_relaxed) - 1;\n\t\tm_bottom.exchange(b, std::memory_order_relaxed);\n\n\t\tauto t = m_top.load(std::memory_order_relaxed);\n\t\tif(t <= b)\n\t\t{\n\t\t\tauto job = m_jobs[b & NUMBER_OF_JOBS_MASK];\n\n\t\t\tif(t != b)\n\t\t\t{\n\t\t\t\treturn job;\n\t\t\t}\n\n\t\t\tif(!m_top.compare_exchange_strong(t, t+1, std::memory_order_release))\n\t\t\t{\n\t\t\t\tjob = nullptr;\n\t\t\t}\n\n\t\t\tm_bottom = t + 1;\n\t\t\treturn job;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_bottom = t;\n\t\t\treturn nullptr;\n\t\t}\n\t}\n\n\tJob* Steal()\n\t{\n\t\tauto t = m_top.load(std::memory_order_relaxed);\n\n\t\tstd::atomic_thread_fence(std::memory_order_acquire);\n\n\t\tauto b = m_bottom.load(std::memory_order_relaxed);\n\t\tif(t < b)\n\t\t{\n\t\t\tconst auto job = m_jobs[t & NUMBER_OF_JOBS_MASK];\n\n\t\t\tif(!m_top.compare_exchange_strong(t, t+1, std::memory_order_release))\n\t\t\t{\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\treturn job;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn nullptr;\n\t\t}\n\t}\n\nprivate:\n\tJob* m_jobs[NUMBER_OF_JOBS];\n\tstd::atomic_long m_bottom{ 0 };\n\tstd::atomic_long m_top{ 0 };\n\t\n};\n\nstruct VeritasEngine::JobManager::Impl\n{\n\tImpl()\n\t: m_queueCount{ std::min(std::thread::hardware_concurrency(), MAX_NUMBER_OF_QUEUES) }\n\t{\n\t\tstatic_assert(std::atomic_int32_t::is_always_lock_free == true && \"Platform is not lock free\");\n\t}\n\n\tvoid Init()\n\t{\n\t\tm_queueIndex = 0;\n\n\t\tm_workerThreads.reserve(m_queueCount - 1);\n\n\t\tfor (unsigned i = 1; i < m_queueCount; i++)\n\t\t{\n\t\t\tm_workerThreads.emplace_back(ThreadMain, this, i);\n\t\t}\n\t}\n\n\t~Impl()\n\t{\n\t\tg_runJobs = false;\n\t\tg_hasJobsConditionVariable.notify_all();\n\n\t\tfor(auto& t : m_workerThreads)\n\t\t{\n\t\t\tif (t.joinable())\n\t\t\t{\n\t\t\t\tt.join();\n\t\t\t}\n\t\t}\n\n\t\tm_workerThreads.clear();\n\t}\n\n\tvoid Push(Job* job)\n\t{\n\t\tGetQueue().Push(job);\n\t\t++m_activeJobCount;\n\t\tg_hasJobsConditionVariable.notify_all();\n\t}\n\n\tJob* AllocateJob()\n\t{\n\t\tconst auto index = m_allocatedJobs++;\n\t\treturn &m_jobs[index & NUMBER_OF_JOBS_MASK];\n\t}\n\n\tWorkQueue& GetQueue()\n\t{\n\t\treturn m_queues[m_queueIndex];\n\t}\n\n\tvoid ExecuteJob(Job* job)\n\t{\n\t\t(job->Callback)(job, job->Data);\n\t\tFinishJob(job);\n\t}\n\n\tJob* GetJob()\n\t{\n\t\tauto& queue = GetQueue();\n\n\t\tconst auto job = queue.Pop();\n\t\tif (job == nullptr)\n\t\t{\n\t\t\tauto& otherQueue = m_queues[0];\n\n\t\t\tif (&queue == &otherQueue)\n\t\t\t{\n\t\t\t\tYield();\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\tJob* stolenJob = otherQueue.Steal();\n\n\t\t\tif (stolenJob)\n\t\t\t{\n\t\t\t\treturn stolenJob;\n\t\t\t}\n\n\t\t\tauto& randomQueue = m_queues[rand() % m_queueCount];\n\n\t\t\tif (&queue == &randomQueue)\n\t\t\t{\n\t\t\t\tYield();\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\tstolenJob = randomQueue.Steal();\n\n\t\t\tif (stolenJob == nullptr)\n\t\t\t{\n\t\t\t\tYield();\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\treturn stolenJob;\n\t\t}\n\t\treturn job;\n\t}\n\nprivate:\n\tvoid FinishJob(Job* job)\n\t{\n\t\tconst auto jobCount = --job->UnfinishedJobs;\n\n\t\tif (jobCount == 0 && (job->Parent))\n\t\t{\n\t\t\tFinishJob(job->Parent);\n\t\t}\n\n\t\t--m_activeJobCount;\n\t}\n\n\tstatic void Yield()\n\t{\n\t\tYIELD_COMMAND\n\t}\n\n\tstatic void ThreadMain(Impl* impl, const unsigned int queueIndex)\n\t{\n\t\tm_queueIndex = queueIndex;\n\n\t\tstd::unique_lock<std::mutex> lock{ m_threadMainMutex };\n\t\t\t\t\n\t\twhile (g_runJobs)\n\t\t{\n\t\t\tg_hasJobsConditionVariable.wait(lock, [&] { return impl->m_activeJobCount > 0 || !g_runJobs; });\n\n\t\t\t\/\/ double check if we need to run jobs since we may be trying to shut down the engine\n\t\t\tif (g_runJobs)\n\t\t\t{\n\t\t\t\tconst auto job = impl->GetJob();\n\t\t\t\tif (job != nullptr)\n\t\t\t\t{\n\t\t\t\t\timpl->ExecuteJob(job);\n\t\t\t\t}\n\t\t\t}\n\t\t}\t\t\n\t}\n\n\tstatic thread_local unsigned int m_queueIndex;\n\tstatic thread_local unsigned int m_allocatedJobs;\n\tstatic thread_local std::mutex m_threadMainMutex;\n\tstatic thread_local Job m_jobs[NUMBER_OF_JOBS];\n\n\tunsigned int m_queueCount;\n\tstd::atomic_int32_t m_activeJobCount{ 0 };\n\tWorkQueue m_queues[MAX_NUMBER_OF_QUEUES];\n\tstd::vector<std::thread> m_workerThreads{};\n};\n\nthread_local unsigned int VeritasEngine::JobManager::Impl::m_queueIndex;\nthread_local unsigned int VeritasEngine::JobManager::Impl::m_allocatedJobs { 0 };\nthread_local std::mutex VeritasEngine::JobManager::Impl::m_threadMainMutex{};\nthread_local VeritasEngine::Job VeritasEngine::JobManager::Impl::m_jobs[NUMBER_OF_JOBS];\n\nVeritasEngine::JobManager::JobManager()\n\t: m_impl{std::make_unique<Impl>() }\n{\n\n}\n\nVeritasEngine::JobManager::JobManager(JobManager&& other) noexcept\n\t: m_impl{ std::move(other.m_impl) }\n{\n\n}\n\nvoid VeritasEngine::JobManager::Init()\n{\n\tm_impl->Init();\n}\n\nVeritasEngine::Job* VeritasEngine::JobManager::CreateJob(JobFunction&& function)\n{\n\treturn CreateJob(std::move(function), nullptr, 0);\n}\n\nVeritasEngine::Job* VeritasEngine::JobManager::CreateJob(JobFunction&& function, void* data, const size_t sizeOfData)\n{\n\tassert(sizeOfData < sizeof(Job::Data));\n\n\tauto job = m_impl->AllocateJob();\n\tjob->Callback = std::move(function);\n\tjob->Parent = nullptr;\n\tjob->UnfinishedJobs = 1;\n\n\tif (data)\n\t{\n\t\tstd::memcpy(job->Data, data, sizeOfData);\n\t}\n\n\treturn job;\n}\n\nVeritasEngine::Job* VeritasEngine::JobManager::CreateJobAsChild(Job* parent, JobFunction&& jobFunction)\n{\n\treturn CreateJobAsChild(parent, std::move(jobFunction), nullptr, 0);\n}\n\nVeritasEngine::Job* VeritasEngine::JobManager::CreateJobAsChild(Job* parent, JobFunction&& jobFunction, void* data, const size_t sizeOfData)\n{\n\t++parent->UnfinishedJobs;\n\n\tauto job = m_impl->AllocateJob();\n\tjob->Callback = std::move(jobFunction);\n\tjob->Parent = parent;\n\tjob->UnfinishedJobs = 1;\n\n\tif (data)\n\t{\n\t\tstd::memcpy(job->Data, data, sizeOfData);\n\t}\n\n\treturn job;\n}\n\nvoid VeritasEngine::JobManager::Run(Job* job)\n{\n\tm_impl->Push(job);\n}\n\nvoid VeritasEngine::JobManager::Wait(Job* job)\n{\n\twhile(job->UnfinishedJobs > 0)\n\t{\n\t\tconst auto nextJob = m_impl->GetJob();\n\n\t\tif(nextJob != nullptr)\n\t\t{\n\t\t\tm_impl->ExecuteJob(nextJob);\n\t\t}\n\t}\n}\n\nVeritasEngine::JobManager& VeritasEngine::JobManager::operator=(JobManager&& other) noexcept\n{\n\tif(this != &other)\n\t{\n\t\tthis->m_impl = std::move(other.m_impl);\n\t}\n\n\treturn *this;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"pidomus_lambdas.h\"\n#include \"pidomus.h\"\n#include \"pidomus_macros.h\"\n\ntemplate <int dim, int spacedim, typename LAC>\nLambdas<dim,spacedim,LAC>::Lambdas ()\n{}\n\n\ntemplate <int dim, int spacedim, typename LAC>\nLambdas<dim,spacedim,LAC>::\nLambdas (piDoMUS<dim,spacedim,LAC> &simulator_object)\n  :\n  simulator (&simulator_object)\n{}\n\n\ntemplate <int dim, int spacedim, typename LAC>\nLambdas<dim,spacedim,LAC>::~Lambdas ()\n{}\n\n\ntemplate <int dim, int spacedim, typename LAC>\nvoid\nLambdas<dim,spacedim,LAC>::\ninitialize_simulator (piDoMUS<dim,spacedim,LAC> &simulator_object)\n{\n  simulator = &simulator_object;\n}\n\n\ntemplate <int dim, int spacedim, typename LAC>\nvoid\nLambdas<dim,spacedim,LAC>::\nset_functions_to_default()\n{\n  create_new_vector = [this]() ->shared_ptr<typename LAC::VectorType>\n  {\n    return this->simulator->create_new_vector();\n  };\n\n  residual = [this](const double t,\n                    const typename LAC::VectorType &y,\n                    const typename LAC::VectorType &y_dot,\n                    typename LAC::VectorType &residual) ->int\n  {\n    return this->simulator->residual(t,y,y_dot,residual);\n  };\n\n  setup_jacobian = [this](const double t,\n                          const typename LAC::VectorType &y,\n                          const typename LAC::VectorType &y_dot,\n                          const double alpha) ->int\n  {\n    return this->simulator->setup_jacobian(t,y,y_dot,alpha);\n  };\n\n  solve_jacobian_system = [this](const typename LAC::VectorType &rhs,\n                                 typename LAC::VectorType &dst) ->int\n  {\n    return this->simulator->solve_jacobian_system(rhs,dst);\n  };\n\n  output_step = [this](const double t,\n                       const typename LAC::VectorType &y,\n                       const typename LAC::VectorType &y_dot,\n                       const unsigned int step_number)\n  {\n    this->simulator->output_step(t,y,y_dot,step_number);\n  };\n\n  solver_should_restart = [this](const double t,\n                                 typename LAC::VectorType &y,\n                                 typename LAC::VectorType &y_dot) ->bool\n  {\n    return this->simulator->solver_should_restart(t,y,y_dot);\n  };\n\n  differential_components = [this]() ->typename LAC::VectorType &\n  {\n    return this->simulator->differential_components();\n  };\n\n  get_local_tolerances = [this]() ->typename LAC::VectorType &\n  {\n    AssertThrow(false, ExcPureFunctionCalled(\"Please implement get_local_tolerances function.\"));\n    static auto lt = this->create_new_vector();\n    return *lt;\n  };\n\n  get_lumped_mass_matrix = [&]() ->typename LAC::VectorType &\n  {\n    static shared_ptr<typename LAC::VectorType> lm;\n    lm = this->create_new_vector();\n    this->simulator->get_lumped_mass_matrix(*lm);\n    return *lm;\n  };\n\n  jacobian_vmult = [this](const typename LAC::VectorType &src,\n                          typename LAC::VectorType &dst) ->int\n  {\n    return this->simulator->jacobian_vmult(src,dst);\n  };\n\n  vector_norm = [this](const typename LAC::VectorType &vector) ->double\n  {\n    return this->simulator->vector_norm(vector);\n  };\n\n}\n\n#define INSTANTIATE(dim,spacedim,LAC) \\\n  template class Lambdas<dim,spacedim,LAC>;\n\nPIDOMUS_INSTANTIATE(INSTANTIATE)\n<commit_msg>fix adaptive refinement<commit_after>#include \"pidomus_lambdas.h\"\n#include \"pidomus.h\"\n#include \"pidomus_macros.h\"\n\ntemplate <int dim, int spacedim, typename LAC>\nLambdas<dim,spacedim,LAC>::Lambdas ()\n{}\n\n\ntemplate <int dim, int spacedim, typename LAC>\nLambdas<dim,spacedim,LAC>::\nLambdas (piDoMUS<dim,spacedim,LAC> &simulator_object)\n  :\n  simulator (&simulator_object)\n{}\n\n\ntemplate <int dim, int spacedim, typename LAC>\nLambdas<dim,spacedim,LAC>::~Lambdas ()\n{}\n\n\ntemplate <int dim, int spacedim, typename LAC>\nvoid\nLambdas<dim,spacedim,LAC>::\ninitialize_simulator (piDoMUS<dim,spacedim,LAC> &simulator_object)\n{\n  simulator = &simulator_object;\n}\n\n\ntemplate <int dim, int spacedim, typename LAC>\nvoid\nLambdas<dim,spacedim,LAC>::\nset_functions_to_default()\n{\n  create_new_vector = [this]() ->shared_ptr<typename LAC::VectorType>\n  {\n    return this->simulator->create_new_vector();\n  };\n\n  residual = [this](const double t,\n                    const typename LAC::VectorType &y,\n                    const typename LAC::VectorType &y_dot,\n                    typename LAC::VectorType &residual) ->int\n  {\n    int ret = this->simulator->residual(t,y,y_dot,residual);\n    this->simulator->set_constrained_dofs_to_zero(residual);\n    return ret;\n  };\n\n  setup_jacobian = [this](const double t,\n                          const typename LAC::VectorType &y,\n                          const typename LAC::VectorType &y_dot,\n                          const double alpha) ->int\n  {\n    return this->simulator->setup_jacobian(t,y,y_dot,alpha);\n  };\n\n  solve_jacobian_system = [this](const typename LAC::VectorType &rhs,\n                                 typename LAC::VectorType &dst) ->int\n  {\n    return this->simulator->solve_jacobian_system(rhs,dst);\n  };\n\n  output_step = [this](const double t,\n                       const typename LAC::VectorType &y,\n                       const typename LAC::VectorType &y_dot,\n                       const unsigned int step_number)\n  {\n    this->simulator->output_step(t,y,y_dot,step_number);\n  };\n\n  solver_should_restart = [this](const double t,\n                                 typename LAC::VectorType &y,\n                                 typename LAC::VectorType &y_dot) ->bool\n  {\n    return this->simulator->solver_should_restart(t,y,y_dot);\n  };\n\n  differential_components = [this]() ->typename LAC::VectorType &\n  {\n    return this->simulator->differential_components();\n  };\n\n  get_local_tolerances = [this]() ->typename LAC::VectorType &\n  {\n    AssertThrow(false, ExcPureFunctionCalled(\"Please implement get_local_tolerances function.\"));\n    static auto lt = this->create_new_vector();\n    return *lt;\n  };\n\n  get_lumped_mass_matrix = [&]() ->typename LAC::VectorType &\n  {\n    static shared_ptr<typename LAC::VectorType> lm;\n    lm = this->create_new_vector();\n    this->simulator->get_lumped_mass_matrix(*lm);\n    return *lm;\n  };\n\n  jacobian_vmult = [this](const typename LAC::VectorType &src,\n                          typename LAC::VectorType &dst) ->int\n  {\n    return this->simulator->jacobian_vmult(src,dst);\n  };\n\n  vector_norm = [this](const typename LAC::VectorType &vector) ->double\n  {\n    return this->simulator->vector_norm(vector);\n  };\n\n}\n\n#define INSTANTIATE(dim,spacedim,LAC) \\\n  template class Lambdas<dim,spacedim,LAC>;\n\nPIDOMUS_INSTANTIATE(INSTANTIATE)\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n\n#include \"LatLongElevation.h\"\n#include <curl\/curl.h>\n#include <cassert>\n#include <sstream>\n\n\nusing std::ostringstream;\n\nstatic const string MIKEDEM_BASE_URL(\"http:\/\/maverick.coas.oregonstate.edu:11300\/terrainextraction.ashx?\");\n\n\ntypedef struct {\n\tchar* _data;\n\tsize_t _size;\n} CurlData;\n\nsize_t write_data(void *ptr, size_t size, size_t count, void *stream) {\n\tCurlData* curlData = (CurlData*)stream;\n\tchar* buffer = new char[size*count];\n\tmemcpy(buffer, ptr, size*count);\n\tsize_t newSize = curlData->_size + size*count;\n\tchar* newData = new char[newSize];\n\tif (curlData->_size != 0) {\n\t\tmemcpy(newData, curlData->_data, curlData->_size);\n\t} \n\tmemcpy(newData + curlData->_size, buffer, size*count);\n\tdelete[] curlData->_data;\n\tcurlData->_data = newData;\n\tcurlData->_size = newSize;\n\treturn size*count;\n}\n\nMikeDEM::MikeDEM(float lngMin, float lngMax, float latMin, float latMax,\n\tint numLngs, int numLats) : NUM_LNGS(numLngs), NUM_LATS(numLats),\n\tLNG_MIN(lngMin), LNG_MAX(lngMax), LAT_MIN(latMin), LAT_MAX(latMax) \n{\n\n\tshared_ptr<CURL> curl(curl_easy_init(), [](CURL* c) {\n\t\tcurl_easy_cleanup(c);\n\t});\n\n\tif (!curl) {\n\t\tthrow CurlInitException(\"curl_easy_init failed\");\n\t}\n\n\tCurlData curlData = {NULL, 0};\n\n\tauto queryString = createQueryString(MIKEDEM_BASE_URL);\n\tcurl_easy_setopt(curl.get(), CURLOPT_URL, queryString.c_str());\n\tcurl_easy_setopt(curl.get(), CURLOPT_FOLLOWLOCATION, 1L);\n\tcurl_easy_setopt(curl.get(), CURLOPT_WRITEDATA, &curlData);\n\tcurl_easy_setopt(curl.get(), CURLOPT_WRITEFUNCTION, write_data);\n\tcurl_easy_setopt(curl.get(), CURLOPT_VERBOSE, 1);\n\n\n\tCURLcode res = curl_easy_perform(curl.get());\n\t\n\t\n\tif (res != CURLE_OK) {\n\t\tthrow CurlConnectionException(curl_easy_strerror(res));\n\t}\n\n\tinitHeightWithXTR(curlData._data);\n}\n\nfloat MikeDEM::elevAt( float longtitude, float latitude ) {\n\tdouble latRange = LAT_MAX-LAT_MIN;\n\tdouble lngRange = LNG_MAX-LNG_MIN;\n\tint latI = (int)( ((latitude-LAT_MIN)\/latRange)*((float)NUM_LATS-1.0)  );\n\tint lngI = (int)( ((longtitude-LNG_MIN)\/lngRange)*((float)NUM_LNGS-1.0)  );\n\treturn elevAtIndex(lngI, latI);\n}\n\nfloat MikeDEM::elevAtIndex(int lngI, int latI) {\n\tif (latI > NUM_LATS || lngI > NUM_LNGS || lngI < 0 || latI < 0 ) {\n\t\tthrow out_of_range(\"invalid lat\/long\");\n\t}\n\treturn elevationData->at(NUM_LNGS*latI + lngI);\n}\n\nstring MikeDEM::createQueryString( const string& baseURL ) {\n\tostringstream ss;\n\tss << MIKEDEM_BASE_URL << \"lat1=\" << LAT_MIN << \"&lat2=\" << LAT_MAX <<\n\t\t\"&lng1=\" << LNG_MIN << \"&lng2=\" << LNG_MAX << \"&numlngs=\" << NUM_LNGS <<\n\t\t\"&numlats=\" << NUM_LATS;\n\treturn string(ss.str());\n}\n\nvoid MikeDEM::initHeightWithXTR(char* data) {\n\tconst char FORM_FEED =  0x0c;\n\n\tsize_t iterator = 0;\n\twhile (data[iterator++] != FORM_FEED) {\n\n\t}\n\n\/\/ \tfloat minLng, maxLng, minLat, maxLat;\n\/\/ \tint numLngs, numLats;\n\/\/ \n\/\/ \tmemcpy(&minLng, data + iterator, sizeof(float));\n\/\/ \titerator = iterator + sizeof(float);\n\/\/ \tmemcpy(&maxLng, data + iterator, sizeof(float));\n\/\/ \titerator = iterator + sizeof(float);\n\/\/ \tmemcpy(&numLngs, data + iterator, sizeof(int));\n\/\/ \titerator = iterator + sizeof(int);\n\/\/ \tmemcpy(&minLat, data + iterator, sizeof(float));\n\/\/ \titerator = iterator + sizeof(float);\n\/\/ \tmemcpy(&maxLat, data + iterator, sizeof(float));\n\/\/ \titerator = iterator + sizeof(float);\n\/\/ \tmemcpy(&numLats, data + iterator, sizeof(int));\n\/\/ \titerator = iterator + sizeof(int);\n\/\/ \n\/\/ \tassert(numLngs == NUM_LNGS);\n\/\/ \tassert(numLats == NUM_LATS);\n\n\tvector<float>* hVec = new vector<float>(NUM_LNGS * NUM_LATS, 0.0);\n\n\tfor (int y = 0; y<NUM_LATS; y++) {\n\t\tmemcpy( &((*hVec)[y*NUM_LNGS]), data + iterator, sizeof(float)*NUM_LNGS);\n\t\titerator = iterator + sizeof(float)*NUM_LNGS;\n\t}\n\n\televationData.reset(hVec);\n}\n<commit_msg>improve performance with new realloc strategy<commit_after>#include \"stdafx.h\"\n\n#include \"LatLongElevation.h\"\n#include <curl\/curl.h>\n#include <cassert>\n#include <sstream>\n\n\nusing std::ostringstream;\n\nstatic const string MIKEDEM_BASE_URL(\"http:\/\/maverick.coas.oregonstate.edu:11300\/terrainextraction.ashx?\");\n\n\ntypedef struct {\n\tchar* _data;\n\tsize_t _size;\n\tsize_t _capacity;\n} CurlData;\n\nsize_t write_data(void *ptr, size_t size, size_t count, void *stream) {\n\tCurlData* curlData = (CurlData*)stream;\n\n\tsize_t newSize = curlData->_size + size*count;\n\tif (newSize > curlData->_capacity) {\n\t\tsize_t toBeAllocated = curlData->_capacity*2;;\n\t\twhile (toBeAllocated < newSize) {\n\t\t\ttoBeAllocated = toBeAllocated*2;\n\t\t}\n\t\tchar* newData = new char[toBeAllocated];\n\n\t\tmemcpy(newData, curlData->_data, curlData->_size);\n\n\t\tdelete[] curlData->_data;\n\t\tcurlData->_data = newData;\n\t\tcurlData->_capacity = toBeAllocated;\n\t}\n\t\n\tmemcpy(curlData->_data + curlData->_size, ptr, size*count);\n\tcurlData->_size = newSize;\n\treturn size*count;\n}\n\nMikeDEM::MikeDEM(float lngMin, float lngMax, float latMin, float latMax,\n\tint numLngs, int numLats) : NUM_LNGS(numLngs), NUM_LATS(numLats),\n\tLNG_MIN(lngMin), LNG_MAX(lngMax), LAT_MIN(latMin), LAT_MAX(latMax) \n{\n\n\tshared_ptr<CURL> curl(curl_easy_init(), [](CURL* c) {\n\t\tcurl_easy_cleanup(c);\n\t});\n\n\tif (!curl) {\n\t\tthrow CurlInitException(\"curl_easy_init failed\");\n\t}\n\n\tCurlData curlData = {NULL, 0};\n\n\tauto queryString = createQueryString(MIKEDEM_BASE_URL);\n\tcurl_easy_setopt(curl.get(), CURLOPT_URL, queryString.c_str());\n\tcurl_easy_setopt(curl.get(), CURLOPT_FOLLOWLOCATION, 1L);\n\tcurl_easy_setopt(curl.get(), CURLOPT_WRITEDATA, &curlData);\n\tcurl_easy_setopt(curl.get(), CURLOPT_WRITEFUNCTION, write_data);\n\tcurl_easy_setopt(curl.get(), CURLOPT_VERBOSE, 1);\n\n\n\tCURLcode res = curl_easy_perform(curl.get());\n\t\n\t\n\tif (res != CURLE_OK) {\n\t\tthrow CurlConnectionException(curl_easy_strerror(res));\n\t}\n\n\tinitHeightWithXTR(curlData._data);\n}\n\nfloat MikeDEM::elevAt( float longtitude, float latitude ) {\n\tdouble latRange = LAT_MAX-LAT_MIN;\n\tdouble lngRange = LNG_MAX-LNG_MIN;\n\tint latI = (int)( ((latitude-LAT_MIN)\/latRange)*((float)NUM_LATS-1.0)  );\n\tint lngI = (int)( ((longtitude-LNG_MIN)\/lngRange)*((float)NUM_LNGS-1.0)  );\n\treturn elevAtIndex(lngI, latI);\n}\n\nfloat MikeDEM::elevAtIndex(int lngI, int latI) {\n\tif (latI > NUM_LATS || lngI > NUM_LNGS || lngI < 0 || latI < 0 ) {\n\t\tthrow out_of_range(\"invalid lat\/long\");\n\t}\n\treturn elevationData->at(NUM_LNGS*latI + lngI);\n}\n\nstring MikeDEM::createQueryString( const string& baseURL ) {\n\tostringstream ss;\n\tss << MIKEDEM_BASE_URL << \"lat1=\" << LAT_MIN << \"&lat2=\" << LAT_MAX <<\n\t\t\"&lng1=\" << LNG_MIN << \"&lng2=\" << LNG_MAX << \"&numlngs=\" << NUM_LNGS <<\n\t\t\"&numlats=\" << NUM_LATS;\n\treturn string(ss.str());\n}\n\nvoid MikeDEM::initHeightWithXTR(char* data) {\n\tconst char FORM_FEED =  0x0c;\n\n\tsize_t iterator = 0;\n\twhile (data[iterator++] != FORM_FEED) {\n\n\t}\n\n\/\/ \tfloat minLng, maxLng, minLat, maxLat;\n\/\/ \tint numLngs, numLats;\n\/\/ \n\/\/ \tmemcpy(&minLng, data + iterator, sizeof(float));\n\/\/ \titerator = iterator + sizeof(float);\n\/\/ \tmemcpy(&maxLng, data + iterator, sizeof(float));\n\/\/ \titerator = iterator + sizeof(float);\n\/\/ \tmemcpy(&numLngs, data + iterator, sizeof(int));\n\/\/ \titerator = iterator + sizeof(int);\n\/\/ \tmemcpy(&minLat, data + iterator, sizeof(float));\n\/\/ \titerator = iterator + sizeof(float);\n\/\/ \tmemcpy(&maxLat, data + iterator, sizeof(float));\n\/\/ \titerator = iterator + sizeof(float);\n\/\/ \tmemcpy(&numLats, data + iterator, sizeof(int));\n\/\/ \titerator = iterator + sizeof(int);\n\/\/ \n\/\/ \tassert(numLngs == NUM_LNGS);\n\/\/ \tassert(numLats == NUM_LATS);\n\n\tvector<float>* hVec = new vector<float>(NUM_LNGS * NUM_LATS, 0.0);\n\n\tfor (int y = 0; y<NUM_LATS; y++) {\n\t\tmemcpy( &((*hVec)[y*NUM_LNGS]), data + iterator, sizeof(float)*NUM_LNGS);\n\t\titerator = iterator + sizeof(float)*NUM_LNGS;\n\t}\n\n\televationData.reset(hVec);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: qualiname.cxx,v $\n *\n *  $Revision: 1.1 $\n *\n *  last change: $Author: np $ $Date: 2002-11-01 17:14: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#include <precomp.h>\n#include <ary\/qualiname.hxx>\n\n\n\/\/ NOT FULLY DECLARED SERVICES\n\n\nnamespace ary\n{\n\n\nQualifiedName::QualifiedName( uintt i_nSize )\n    :   aNamespace(),\n        sLocalName(),\n        bIsAbsolute(false),\n        bIsFunction()\n{\n    if (i_nSize > 0)\n        aNamespace.reserve(i_nSize);\n}\n\nQualifiedName::QualifiedName( const char *        i_sText,\n                              const char *        i_sSeparator )\n    :   aNamespace(),\n        sLocalName(),\n        bIsAbsolute(false),\n        bIsFunction()\n{\n    AssignText(i_sText,i_sSeparator);\n}\n\nQualifiedName::~QualifiedName()\n{\n}\n\nvoid\nQualifiedName::AssignText(  const char *        i_sText,\n                            const char *        i_sSeparator )\n{\n    csv_assert(NOT csv::no_str(i_sText) AND NOT csv::no_str(i_sSeparator));\n    bIsAbsolute = false;\n    bIsFunction = false;\n    csv::erase_container( aNamespace );\n\n    uintt nSepLen = strlen(i_sSeparator);\n    const char * sNext = i_sText;\n\n    const char * ps = strstr( i_sText, i_sSeparator );\n    if (ps == i_sText)\n    {\n        bIsAbsolute = true;\n        sNext = ps + nSepLen;\n    }\n\n    for ( ps = strstr(sNext, i_sSeparator);\n          ps != 0;\n          ps = strstr(sNext, i_sSeparator) )\n    {\n        String sPart(sNext, ps - sNext);\n        aNamespace.push_back(sPart);\n        sNext = ps + nSepLen;\n    }\n\n    uintt sNameLen = strlen(sNext);\n    if ( sNameLen > 2 )\n    {\n        ps = sNext + sNameLen - 2;\n        if (*ps == '(' AND *(ps+1) == ')')\n        {\n            sNameLen -= 2;\n            bIsFunction = true;\n        }\n    }\n    sLocalName = String(sNext,sNameLen);\n}\n\n\n}   \/\/ namespace ary\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.132); FILE MERGED 2005\/09\/05 13:10:30 rt 1.1.132.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: qualiname.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 17:14: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#include <precomp.h>\n#include <ary\/qualiname.hxx>\n\n\n\/\/ NOT FULLY DECLARED SERVICES\n\n\nnamespace ary\n{\n\n\nQualifiedName::QualifiedName( uintt i_nSize )\n    :   aNamespace(),\n        sLocalName(),\n        bIsAbsolute(false),\n        bIsFunction()\n{\n    if (i_nSize > 0)\n        aNamespace.reserve(i_nSize);\n}\n\nQualifiedName::QualifiedName( const char *        i_sText,\n                              const char *        i_sSeparator )\n    :   aNamespace(),\n        sLocalName(),\n        bIsAbsolute(false),\n        bIsFunction()\n{\n    AssignText(i_sText,i_sSeparator);\n}\n\nQualifiedName::~QualifiedName()\n{\n}\n\nvoid\nQualifiedName::AssignText(  const char *        i_sText,\n                            const char *        i_sSeparator )\n{\n    csv_assert(NOT csv::no_str(i_sText) AND NOT csv::no_str(i_sSeparator));\n    bIsAbsolute = false;\n    bIsFunction = false;\n    csv::erase_container( aNamespace );\n\n    uintt nSepLen = strlen(i_sSeparator);\n    const char * sNext = i_sText;\n\n    const char * ps = strstr( i_sText, i_sSeparator );\n    if (ps == i_sText)\n    {\n        bIsAbsolute = true;\n        sNext = ps + nSepLen;\n    }\n\n    for ( ps = strstr(sNext, i_sSeparator);\n          ps != 0;\n          ps = strstr(sNext, i_sSeparator) )\n    {\n        String sPart(sNext, ps - sNext);\n        aNamespace.push_back(sPart);\n        sNext = ps + nSepLen;\n    }\n\n    uintt sNameLen = strlen(sNext);\n    if ( sNameLen > 2 )\n    {\n        ps = sNext + sNameLen - 2;\n        if (*ps == '(' AND *(ps+1) == ')')\n        {\n            sNameLen -= 2;\n            bIsFunction = true;\n        }\n    }\n    sLocalName = String(sNext,sNameLen);\n}\n\n\n}   \/\/ namespace ary\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 _COMM_BAS_HXX\n#define _COMM_BAS_HXX\n\n#include <basic\/sbxfac.hxx>\n#include <basic\/sbxvar.hxx>\n#include <basic\/sbxobj.hxx>\n\nclass CommunicationManagerClientViaSocket;\nclass CommunicationLink;\n\nclass CommunicationWrapper : public SbxObject   \/\/ Einer f�r Manager und Links\n{\n    \/\/ Definition eines Tabelleneintrags. Dies wird hier gemacht,\n    \/\/ da dadurch die Methoden und Properties als private deklariert\n    \/\/ werden koennen.\n#if defined ( ICC ) || defined ( C50 ) || defined ( C52 )\npublic:\n#endif\n    typedef void( CommunicationWrapper::*pMeth )\n        ( SbxVariable* pThis, SbxArray* pArgs, sal_Bool bWrite );\n#if defined ( ICC )\nprivate:\n#endif\n\n    struct Methods {\n        const char* pName;      \/\/ Name des Eintrags\n        SbxDataType eType;      \/\/ Datentyp\n        pMeth pFunc;            \/\/ Function Pointer\n        short nArgs;            \/\/ Argumente und Flags\n    };\n    static Methods aManagerMethods[];   \/\/ Methodentabelle\n    static Methods aLinkMethods[];      \/\/ Methodentabelle\n    Methods *m_pMethods;    \/\/ Aktuelle Methodentabelle\n\n    \/\/ Methoden\n    \/\/      Manager\n    void MStartCommunication( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MStopAllCommunication( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MIsCommunicationRunning( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MGetMyName( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MIsLinkValid( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MSetCommunicationEventHandler( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n\n    \/\/      Link\n    void LStopCommunication( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void LGetMyName( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void LGetHostName( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void LSend( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void LGetString( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n\n    \/\/ Interne Member und Methoden\n    CommunicationManagerClientViaSocket *m_pManager;\n    CommunicationLink *m_pLink;\n    sal_Bool m_bIsManager;  \/\/ Ist es kein Manager, so ist es ein Link\n\n    \/\/ Kram f�r Manager\n    DECL_LINK( Open, CommunicationLink* );\n    DECL_LINK( Close, CommunicationLink* );\n    DECL_LINK( Data, CommunicationLink* );\n    void Events( String aType, CommunicationLink* pLink );\n    sal_Bool m_bCatchOpen;\n    CommunicationLink *m_pNewLink;\n    String m_aEventHandlerName;\n\n    using SbxVariable::GetInfo;\n    \/\/ Infoblock auffuellen\n    SbxInfo* GetInfo( short nIdx );\n\n    \/\/ Broadcaster Notification\n    virtual void SFX_NOTIFY( SfxBroadcaster& rBC, const TypeId& rBCType,\n                             const SfxHint& rHint, const TypeId& rHintType );\npublic:\n    CommunicationWrapper( const String& );\n    CommunicationWrapper( CommunicationLink *pThisLink );\n    ~CommunicationWrapper();\n    \/\/ Suchen eines Elements\n    virtual SbxVariable* Find( const String&, SbxClassType );\n\n    CommunicationLink* GetCommunicationLink() { return m_pLink; }\n};\n\n\n\/\/ Die dazugehoerige Factory:\n\nclass CommunicationFactory : public SbxFactory\n{\npublic:\n    virtual SbxObject* CreateObject( const String& );\n};\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Remove the C52 define.<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 _COMM_BAS_HXX\n#define _COMM_BAS_HXX\n\n#include <basic\/sbxfac.hxx>\n#include <basic\/sbxvar.hxx>\n#include <basic\/sbxobj.hxx>\n\nclass CommunicationManagerClientViaSocket;\nclass CommunicationLink;\n\nclass CommunicationWrapper : public SbxObject   \/\/ Einer f�r Manager und Links\n{\n    \/\/ Definition eines Tabelleneintrags. Dies wird hier gemacht,\n    \/\/ da dadurch die Methoden und Properties als private deklariert\n    \/\/ werden koennen.\n#if defined ( ICC ) || defined ( C50 )\npublic:\n#endif\n    typedef void( CommunicationWrapper::*pMeth )\n        ( SbxVariable* pThis, SbxArray* pArgs, sal_Bool bWrite );\n#if defined ( ICC )\nprivate:\n#endif\n\n    struct Methods {\n        const char* pName;      \/\/ Name des Eintrags\n        SbxDataType eType;      \/\/ Datentyp\n        pMeth pFunc;            \/\/ Function Pointer\n        short nArgs;            \/\/ Argumente und Flags\n    };\n    static Methods aManagerMethods[];   \/\/ Methodentabelle\n    static Methods aLinkMethods[];      \/\/ Methodentabelle\n    Methods *m_pMethods;    \/\/ Aktuelle Methodentabelle\n\n    \/\/ Methoden\n    \/\/      Manager\n    void MStartCommunication( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MStopAllCommunication( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MIsCommunicationRunning( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MGetMyName( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MIsLinkValid( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void MSetCommunicationEventHandler( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n\n    \/\/      Link\n    void LStopCommunication( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void LGetMyName( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void LGetHostName( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void LSend( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n    void LGetString( SbxVariable* pVar, SbxArray* pPar, sal_Bool bWrite );\n\n    \/\/ Interne Member und Methoden\n    CommunicationManagerClientViaSocket *m_pManager;\n    CommunicationLink *m_pLink;\n    sal_Bool m_bIsManager;  \/\/ Ist es kein Manager, so ist es ein Link\n\n    \/\/ Kram f�r Manager\n    DECL_LINK( Open, CommunicationLink* );\n    DECL_LINK( Close, CommunicationLink* );\n    DECL_LINK( Data, CommunicationLink* );\n    void Events( String aType, CommunicationLink* pLink );\n    sal_Bool m_bCatchOpen;\n    CommunicationLink *m_pNewLink;\n    String m_aEventHandlerName;\n\n    using SbxVariable::GetInfo;\n    \/\/ Infoblock auffuellen\n    SbxInfo* GetInfo( short nIdx );\n\n    \/\/ Broadcaster Notification\n    virtual void SFX_NOTIFY( SfxBroadcaster& rBC, const TypeId& rBCType,\n                             const SfxHint& rHint, const TypeId& rHintType );\npublic:\n    CommunicationWrapper( const String& );\n    CommunicationWrapper( CommunicationLink *pThisLink );\n    ~CommunicationWrapper();\n    \/\/ Suchen eines Elements\n    virtual SbxVariable* Find( const String&, SbxClassType );\n\n    CommunicationLink* GetCommunicationLink() { return m_pLink; }\n};\n\n\n\/\/ Die dazugehoerige Factory:\n\nclass CommunicationFactory : public SbxFactory\n{\npublic:\n    virtual SbxObject* CreateObject( const String& );\n};\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\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)\n\nThis file is the implementation of the Model class.\n*\/\n\n#include \"src\/data\/model_parameters.h\"\n\n#include <string.h>\n#include <pmmintrin.h>  \/\/ for SSE\n\n#include \"src\/base\/file_util.h\"\n#include \"src\/base\/math.h\"\n\nnamespace xLearn {\n\n\/\/------------------------------------------------------------------------------\n\/\/ The Model class\n\/\/------------------------------------------------------------------------------\n\n\/\/ Basic contributor.\nvoid Model::Initialize(const std::string& score_func,\n                  const std::string& loss_func,\n                  index_t num_feature,\n                  index_t num_field,\n                  index_t num_K,\n                  real_t scale) {\n  CHECK(!score_func.empty());\n  CHECK(!loss_func.empty());\n  CHECK_GT(num_feature, 0);\n  CHECK_GE(num_field, 0);\n  CHECK_GE(num_K, 0);\n  CHECK_GT(scale, 0);\n  score_func_ = score_func;\n  loss_func_ = loss_func;\n  num_feat_ = num_feature;\n  num_field_ = num_field;\n  num_K_ = num_K;\n  scale_ = scale;\n  \/\/ Calculate the number of model parameters\n  param_num_w_ = num_feature * 2;\n  if (score_func == \"linear\") {\n    param_num_v_ = 0;\n  } else if (score_func == \"fm\") {\n    param_num_v_ = num_feature *\n                   get_aligned_k() * 2;\n  } else if (score_func == \"ffm\") {\n    param_num_v_ = num_feature *\n                   get_aligned_k() *\n                   num_field * 2;\n  } else {\n    LOG(FATAL) << \"Unknow score function: \" << score_func;\n  }\n  this->initial(true);\n}\n\n\/\/ To get the best performance for SSE, we need to\n\/\/ allocate memory for the model parameters in aligned way.\n\/\/ For SSE, the align number should be 16 byte.\nvoid Model::initial(bool set_val) {\n  try {\n    \/\/ Conventional malloc for linear term and bias\n    param_w_ = (real_t*)malloc(param_num_w_*sizeof(real_t));\n    param_b_ = (real_t*)malloc(2*sizeof(real_t));\n    if (score_func_.compare(\"fm\") == 0 ||\n        score_func_.compare(\"ffm\") == 0) {\n      \/\/ Aligned malloc for latent factor\n#ifdef _WIN32\n      param_v_ = _aligned_malloc(\n          param_num_v_ * sizeof(real_t),\n          kAlignByte);\n#else\n      posix_memalign(\n          (void**)&param_v_,\n          kAlignByte,\n          param_num_v_ * sizeof(real_t));\n#endif\n    } else {\n      param_v_ = nullptr;\n    }\n  } catch (std::bad_alloc&) {\n    LOG(FATAL) << \"Cannot allocate enough memory for current  \\\n                   model parameters. Parameter size: \"\n               << GetNumParameter();\n  }\n  \/\/ set value for model\n  if (set_val) {\n    set_value();\n  }\n}\n\n\/\/ Set value for model\nvoid Model::set_value() {\n  \/\/ Use distribution to transform the random unsigned\n  \/\/ int generated by gen into a float in [(0.0, 1.0) * coef]\n  std::default_random_engine generator;\n  std::uniform_real_distribution<real_t> dis(0.0, 1.0);\n  \/*********************************************************\n   *  Initialize linear and bias term                      *\n   *********************************************************\/\n  for (index_t i = 0; i < param_num_w_; i += 2) {\n    param_w_[i] = 0;      \/* model *\/\n    param_w_[i+1] = 1.0;  \/* gradient cache *\/\n  }\n  param_b_[0] = 0;    \/* model *\/\n  param_b_[1] = 1.0;  \/* gradient cache *\/\n  \/*********************************************************\n   *  Initialize latent factor for fm                      *\n   *********************************************************\/\n  if (score_func_.compare(\"fm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t coef = 1.0f \/ sqrt(num_K_) * scale_;\n    real_t* w = param_v_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for(index_t d = 0; d < num_K_; d++, w++)\n        *w = coef * dis(generator);\n      for(index_t d = num_K_; d < k_aligned; d++, w++)\n        *w = 0;\n      for(index_t d = k_aligned; d < 2*k_aligned; d++, w++)\n        *w = 1.0;\n    }\n  }\n  \/*********************************************************\n   *  Initialize latent factor for ffm                     *\n   *********************************************************\/\n  else if (score_func_.compare(\"ffm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t* w = param_v_;\n    real_t coef = 1.0f \/ sqrt(num_K_) * scale_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for (index_t f = 0; f < num_field_; ++f) {\n        for (index_t d = 0; d < k_aligned; ) {\n          for (index_t s = 0; s < kAlign; s++, w++, d++) {\n            w[0] = (d < num_K_) ? coef * dis(generator) : 0.0;\n            w[kAlign] = 1.0;\n          }\n          w += kAlign;\n        }\n      }\n    }\n  }\n}\n\n\/\/ Free the allocated memory\nvoid Model::free_model() {\n  free(param_w_);\n  free(param_v_);\n  free(param_b_);\n}\n\n\/\/ Initialize model from a checkpoint file\nModel::Model(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  if (this->Deserialize(filename) == false) {\n    printf(\"Cannot Load model from the file: %s\\n\",\n           filename.c_str());\n    exit(0);\n  }\n}\n\n\/\/ Serialize current model to a disk file\nvoid Model::Serialize(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  FILE* file = OpenFileOrDie(filename.c_str(), \"w\");\n  \/\/ Write score function\n  WriteStringToFile(file, score_func_);\n  \/\/ Write loss function\n  WriteStringToFile(file, loss_func_);\n  \/\/ Write feature num\n  WriteDataToDisk(file, (char*)&num_feat_, sizeof(num_feat_));\n  \/\/ Write field num\n  WriteDataToDisk(file, (char*)&num_field_, sizeof(num_field_));\n  \/\/ Write K\n  WriteDataToDisk(file, (char*)&num_K_, sizeof(num_K_));\n  \/\/ Write w\n  this->serialize_w_v_b(file);\n  Close(file);\n}\n\n\/\/ Deserialize model from a checkpoint file\nbool Model::Deserialize(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  FILE* file = OpenFileOrDie(filename.c_str(), \"r\");\n  if (file == NULL) { return false; }\n  \/\/ Read score function\n  ReadStringFromFile(file, score_func_);\n  \/\/ Read loss function\n  ReadStringFromFile(file, loss_func_);\n  \/\/ Read feature num\n  ReadDataFromDisk(file, (char*)&num_feat_, sizeof(num_feat_));\n  \/\/ Read field num\n  ReadDataFromDisk(file, (char*)&num_field_, sizeof(num_field_));\n  \/\/ Read K\n  ReadDataFromDisk(file, (char*)&num_K_, sizeof(num_K_));\n  \/\/ Read w\n  this->deserialize_w_v_b(file);\n  Close(file);\n  return true;\n}\n\n\/\/ Take a record of the best model during training\nvoid Model::SetBestModel() {\n  if (param_best_w_ == nullptr) {\n    param_best_w_ = (real_t*)malloc(\n      param_num_w_*sizeof(real_t));\n  }\n  if (param_best_v_ == nullptr &&\n      score_func_.compare(\"linear\") != 0) {\n#ifdef _WIN32\n    param_best_v_ = _aligned_malloc(\n      param_num_v_ * sizeof(real_t),\n      kAlignByte);\n#else\n    posix_memalign(\n      (void**)&param_best_v_,\n      kAlignByte,\n      param_num_v_ * sizeof(real_t));\n#endif\n  }\n  if (param_best_b_ == nullptr) {\n    param_best_b_ = (real_t*)malloc(\n      2 * sizeof(real_t));\n  }\n  \/\/ Copy current model parameters\n  memcpy(param_best_w_, param_w_, param_num_w_*sizeof(real_t));\n  memcpy(param_best_v_, param_v_, param_num_v_*sizeof(real_t));\n  memcpy(param_best_b_, param_b_, 2*sizeof(real_t));\n}\n\n\/\/ Shrink back for getting the best model\nvoid Model::Shrink() {\n  \/\/ Copy best model parameters\n  if (param_best_w_ != nullptr) {\n    memcpy(param_w_, param_best_w_, param_num_w_*sizeof(real_t));\n  }\n  if (param_best_v_ != nullptr) {\n    memcpy(param_v_, param_best_v_, param_num_v_*sizeof(real_t));\n  }\n  if (param_best_b_ != nullptr) {\n    memcpy(param_b_, param_best_b_, 2*sizeof(real_t));\n  }\n}\n\n\/\/ Serialize w,v,b to disk file\nvoid Model::serialize_w_v_b(FILE* file) {\n  \/\/ Write size of w\n  WriteDataToDisk(file, (char*)&param_num_w_, sizeof(param_num_w_));\n  \/\/ Write size of v\n  if (score_func_.compare(\"linear\") != 0) {\n    WriteDataToDisk(file, (char*)&param_num_v_, sizeof(param_num_v_));\n  }\n  \/\/ Write w\n  WriteDataToDisk(file, (char*)param_w_, sizeof(real_t)*param_num_w_);\n  \/\/ Write b\n  WriteDataToDisk(file, (char*)param_b_, sizeof(real_t)*2);\n  \/\/ Write v\n  if (score_func_.compare(\"linear\") != 0) {\n    WriteDataToDisk(file, (char*)param_v_, sizeof(real_t)*param_num_v_);\n  }\n}\n\n\/\/ Deserialize w,v,b from disk file\nvoid Model::deserialize_w_v_b(FILE* file) {\n  \/\/ Read size of w\n  ReadDataFromDisk(file, (char*)&param_num_w_, sizeof(param_num_w_));\n  \/\/ Read size of v\n  if (score_func_.compare(\"linear\") != 0) {\n    ReadDataFromDisk(file, (char*)&param_num_v_, sizeof(param_num_v_));\n  }\n  \/\/ Allocate memory. Don't set value here\n  this->initial(false);\n  \/\/ Read w\n  ReadDataFromDisk(file, (char*)param_w_, sizeof(real_t)*param_num_w_);\n  \/\/ Read b\n  ReadDataFromDisk(file, (char*)param_b_, sizeof(real_t)*2);\n  \/\/ Read v\n  if (score_func_.compare(\"linear\") != 0) {\n    ReadDataFromDisk(file, (char*)param_v_, sizeof(real_t)*param_num_v_);\n  }\n}\n\n}  \/\/ namespace xLearn\n<commit_msg>remove logger<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)\n\nThis file is the implementation of the Model class.\n*\/\n\n#include \"src\/data\/model_parameters.h\"\n\n#include <string.h>\n#include <pmmintrin.h>  \/\/ for SSE\n\n#include \"src\/base\/file_util.h\"\n#include \"src\/base\/math.h\"\n\nnamespace xLearn {\n\n\/\/------------------------------------------------------------------------------\n\/\/ The Model class\n\/\/------------------------------------------------------------------------------\n\n\/\/ Basic contributor.\nvoid Model::Initialize(const std::string& score_func,\n                  const std::string& loss_func,\n                  index_t num_feature,\n                  index_t num_field,\n                  index_t num_K,\n                  real_t scale) {\n  CHECK(!score_func.empty());\n  CHECK(!loss_func.empty());\n  CHECK_GT(num_feature, 0);\n  CHECK_GE(num_field, 0);\n  CHECK_GE(num_K, 0);\n  CHECK_GT(scale, 0);\n  score_func_ = score_func;\n  loss_func_ = loss_func;\n  num_feat_ = num_feature;\n  num_field_ = num_field;\n  num_K_ = num_K;\n  scale_ = scale;\n  \/\/ Calculate the number of model parameters\n  param_num_w_ = num_feature * 2;\n  if (score_func == \"linear\") {\n    param_num_v_ = 0;\n  } else if (score_func == \"fm\") {\n    param_num_v_ = num_feature *\n                   get_aligned_k() * 2;\n  } else if (score_func == \"ffm\") {\n    param_num_v_ = num_feature *\n                   get_aligned_k() *\n                   num_field * 2;\n  } else {\n    LOG(FATAL) << \"Unknow score function: \" << score_func;\n  }\n  this->initial(true);\n}\n\n\/\/ To get the best performance for SSE, we need to\n\/\/ allocate memory for the model parameters in aligned way.\n\/\/ For SSE, the align number should be 16 byte.\nvoid Model::initial(bool set_val) {\n  try {\n    \/\/ Conventional malloc for linear term and bias\n    param_w_ = (real_t*)malloc(param_num_w_*sizeof(real_t));\n    param_b_ = (real_t*)malloc(2*sizeof(real_t));\n    if (score_func_.compare(\"fm\") == 0 ||\n        score_func_.compare(\"ffm\") == 0) {\n      \/\/ Aligned malloc for latent factor\n#ifdef _WIN32\n      param_v_ = _aligned_malloc(\n          param_num_v_ * sizeof(real_t),\n          kAlignByte);\n#else\n      posix_memalign(\n          (void**)&param_v_,\n          kAlignByte,\n          param_num_v_ * sizeof(real_t));\n#endif\n    } else {\n      param_v_ = nullptr;\n    }\n  } catch (std::bad_alloc&) {\n    \/\/LOG(FATAL) << \"Cannot allocate enough memory for current  \\\n    \/\/               model parameters. Parameter size: \"\n    \/\/           << GetNumParameter();\n  }\n  \/\/ set value for model\n  if (set_val) {\n    set_value();\n  }\n}\n\n\/\/ Set value for model\nvoid Model::set_value() {\n  \/\/ Use distribution to transform the random unsigned\n  \/\/ int generated by gen into a float in [(0.0, 1.0) * coef]\n  std::default_random_engine generator;\n  std::uniform_real_distribution<real_t> dis(0.0, 1.0);\n  \/*********************************************************\n   *  Initialize linear and bias term                      *\n   *********************************************************\/\n  for (index_t i = 0; i < param_num_w_; i += 2) {\n    param_w_[i] = 0;      \/* model *\/\n    param_w_[i+1] = 1.0;  \/* gradient cache *\/\n  }\n  param_b_[0] = 0;    \/* model *\/\n  param_b_[1] = 1.0;  \/* gradient cache *\/\n  \/*********************************************************\n   *  Initialize latent factor for fm                      *\n   *********************************************************\/\n  if (score_func_.compare(\"fm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t coef = 1.0f \/ sqrt(num_K_) * scale_;\n    real_t* w = param_v_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for(index_t d = 0; d < num_K_; d++, w++)\n        *w = coef * dis(generator);\n      for(index_t d = num_K_; d < k_aligned; d++, w++)\n        *w = 0;\n      for(index_t d = k_aligned; d < 2*k_aligned; d++, w++)\n        *w = 1.0;\n    }\n  }\n  \/*********************************************************\n   *  Initialize latent factor for ffm                     *\n   *********************************************************\/\n  else if (score_func_.compare(\"ffm\") == 0) {\n    index_t k_aligned = get_aligned_k();\n    real_t* w = param_v_;\n    real_t coef = 1.0f \/ sqrt(num_K_) * scale_;\n    for (index_t j = 0; j < num_feat_; ++j) {\n      for (index_t f = 0; f < num_field_; ++f) {\n        for (index_t d = 0; d < k_aligned; ) {\n          for (index_t s = 0; s < kAlign; s++, w++, d++) {\n            w[0] = (d < num_K_) ? coef * dis(generator) : 0.0;\n            w[kAlign] = 1.0;\n          }\n          w += kAlign;\n        }\n      }\n    }\n  }\n}\n\n\/\/ Free the allocated memory\nvoid Model::free_model() {\n  free(param_w_);\n  free(param_v_);\n  free(param_b_);\n}\n\n\/\/ Initialize model from a checkpoint file\nModel::Model(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  if (this->Deserialize(filename) == false) {\n    printf(\"Cannot Load model from the file: %s\\n\",\n           filename.c_str());\n    exit(0);\n  }\n}\n\n\/\/ Serialize current model to a disk file\nvoid Model::Serialize(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  FILE* file = OpenFileOrDie(filename.c_str(), \"w\");\n  \/\/ Write score function\n  WriteStringToFile(file, score_func_);\n  \/\/ Write loss function\n  WriteStringToFile(file, loss_func_);\n  \/\/ Write feature num\n  WriteDataToDisk(file, (char*)&num_feat_, sizeof(num_feat_));\n  \/\/ Write field num\n  WriteDataToDisk(file, (char*)&num_field_, sizeof(num_field_));\n  \/\/ Write K\n  WriteDataToDisk(file, (char*)&num_K_, sizeof(num_K_));\n  \/\/ Write w\n  this->serialize_w_v_b(file);\n  Close(file);\n}\n\n\/\/ Deserialize model from a checkpoint file\nbool Model::Deserialize(const std::string& filename) {\n  CHECK_NE(filename.empty(), true);\n  FILE* file = OpenFileOrDie(filename.c_str(), \"r\");\n  if (file == NULL) { return false; }\n  \/\/ Read score function\n  ReadStringFromFile(file, score_func_);\n  \/\/ Read loss function\n  ReadStringFromFile(file, loss_func_);\n  \/\/ Read feature num\n  ReadDataFromDisk(file, (char*)&num_feat_, sizeof(num_feat_));\n  \/\/ Read field num\n  ReadDataFromDisk(file, (char*)&num_field_, sizeof(num_field_));\n  \/\/ Read K\n  ReadDataFromDisk(file, (char*)&num_K_, sizeof(num_K_));\n  \/\/ Read w\n  this->deserialize_w_v_b(file);\n  Close(file);\n  return true;\n}\n\n\/\/ Take a record of the best model during training\nvoid Model::SetBestModel() {\n  if (param_best_w_ == nullptr) {\n    param_best_w_ = (real_t*)malloc(\n      param_num_w_*sizeof(real_t));\n  }\n  if (param_best_v_ == nullptr &&\n      score_func_.compare(\"linear\") != 0) {\n#ifdef _WIN32\n    param_best_v_ = _aligned_malloc(\n      param_num_v_ * sizeof(real_t),\n      kAlignByte);\n#else\n    posix_memalign(\n      (void**)&param_best_v_,\n      kAlignByte,\n      param_num_v_ * sizeof(real_t));\n#endif\n  }\n  if (param_best_b_ == nullptr) {\n    param_best_b_ = (real_t*)malloc(\n      2 * sizeof(real_t));\n  }\n  \/\/ Copy current model parameters\n  memcpy(param_best_w_, param_w_, param_num_w_*sizeof(real_t));\n  memcpy(param_best_v_, param_v_, param_num_v_*sizeof(real_t));\n  memcpy(param_best_b_, param_b_, 2*sizeof(real_t));\n}\n\n\/\/ Shrink back for getting the best model\nvoid Model::Shrink() {\n  \/\/ Copy best model parameters\n  if (param_best_w_ != nullptr) {\n    memcpy(param_w_, param_best_w_, param_num_w_*sizeof(real_t));\n  }\n  if (param_best_v_ != nullptr) {\n    memcpy(param_v_, param_best_v_, param_num_v_*sizeof(real_t));\n  }\n  if (param_best_b_ != nullptr) {\n    memcpy(param_b_, param_best_b_, 2*sizeof(real_t));\n  }\n}\n\n\/\/ Serialize w,v,b to disk file\nvoid Model::serialize_w_v_b(FILE* file) {\n  \/\/ Write size of w\n  WriteDataToDisk(file, (char*)&param_num_w_, sizeof(param_num_w_));\n  \/\/ Write size of v\n  if (score_func_.compare(\"linear\") != 0) {\n    WriteDataToDisk(file, (char*)&param_num_v_, sizeof(param_num_v_));\n  }\n  \/\/ Write w\n  WriteDataToDisk(file, (char*)param_w_, sizeof(real_t)*param_num_w_);\n  \/\/ Write b\n  WriteDataToDisk(file, (char*)param_b_, sizeof(real_t)*2);\n  \/\/ Write v\n  if (score_func_.compare(\"linear\") != 0) {\n    WriteDataToDisk(file, (char*)param_v_, sizeof(real_t)*param_num_v_);\n  }\n}\n\n\/\/ Deserialize w,v,b from disk file\nvoid Model::deserialize_w_v_b(FILE* file) {\n  \/\/ Read size of w\n  ReadDataFromDisk(file, (char*)&param_num_w_, sizeof(param_num_w_));\n  \/\/ Read size of v\n  if (score_func_.compare(\"linear\") != 0) {\n    ReadDataFromDisk(file, (char*)&param_num_v_, sizeof(param_num_v_));\n  }\n  \/\/ Allocate memory. Don't set value here\n  this->initial(false);\n  \/\/ Read w\n  ReadDataFromDisk(file, (char*)param_w_, sizeof(real_t)*param_num_w_);\n  \/\/ Read b\n  ReadDataFromDisk(file, (char*)param_b_, sizeof(real_t)*2);\n  \/\/ Read v\n  if (score_func_.compare(\"linear\") != 0) {\n    ReadDataFromDisk(file, (char*)param_v_, sizeof(real_t)*param_num_v_);\n  }\n}\n\n}  \/\/ namespace xLearn\n<|endoftext|>"}
{"text":"<commit_before>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n * CONDOR Copyright Notice\n *\n * See LICENSE.TXT for additional notices and disclaimers.\n *\n * Copyright (c)1990-1998 CONDOR Team, Computer Sciences Department, \n * University of Wisconsin-Madison, Madison, WI.  All Rights Reserved.  \n * No use of the CONDOR Software Program Source Code is authorized \n * without the express consent of the CONDOR Team.  For more information \n * contact: CONDOR Team, Attention: Professor Miron Livny, \n * 7367 Computer Sciences, 1210 W. Dayton St., Madison, WI 53706-1685, \n * (608) 262-0856 or miron@cs.wisc.edu.\n *\n * U.S. Government Rights Restrictions: Use, duplication, or disclosure \n * by the U.S. Government is subject to restrictions as set forth in \n * subparagraph (c)(1)(ii) of The Rights in Technical Data and Computer \n * Software clause at DFARS 252.227-7013 or subparagraphs (c)(1) and \n * (2) of Commercial Computer Software-Restricted Rights at 48 CFR \n * 52.227-19, as applicable, CONDOR Team, Attention: Professor Miron \n * Livny, 7367 Computer Sciences, 1210 W. Dayton St., Madison, \n * WI 53706-1685, (608) 262-0856 or miron@cs.wisc.edu.\n****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n#include \"condor_common.h\"\n#include \"condor_classad.h\"\n#include \"compress.h\"\n\nClassAdBin::ClassAdBin( )\n{\n    count = 0;\n    ad = new ClassAd( );\n}\n\nClassAdBin::~ClassAdBin( )\n{\n    delete ad;\n}\n\nbool\nMakeSignature( const ClassAd *ad, const References &refs, string &sig )\n{\n    References::iterator    itr;\n    ExprTree                *expr;\n    Value                   val;\n    ClassAdUnParser         unp;\n\n    sig = \"\";\n    for( itr=refs.begin( ); itr!= refs.end( ); itr++ ) {\n        if( ( expr = ad->Lookup( *itr ) ) && expr->GetKind( )==LITERAL_NODE ) {\n            unp.Unparse( sig, expr );\n        } else {\n            return( false );\n        }\n        sig += \":\";\n    }\n\n    return( true );\n}\n\n\nbool\nCompress( ClassAdCollectionServer *server, LocalCollectionQuery *query,\n    const References &refs, CompressedAds &comp, list<ClassAd*> &rest )\n{\n    string                      key, sig;\n    References::const_iterator  ritr;\n    ClassAd                     *ad;\n    CompressedAds::iterator     citr;\n    ClassAdBin                  *bin;\n\n    query->ToFirst( );\n    query->Current( key );\n    while( !query->IsAfterLast( ) ) {\n            \/\/ get ad\n        if( !( ad = server->GetClassAd( key ) ) ) {\n            return( false );\n        }\n\n            \/\/ get signature of current ad\n        if( !MakeSignature( ad, refs, sig ) ) {\n                \/\/ can't make signature --- can't compress\n            rest.push_back( ad->Copy( ) );\n        }\n\n            \/\/ get bin\n        if( ( citr = comp.find( sig ) ) == comp.end( ) ) {\n                \/\/ no bin ... make one\n            bin = new ClassAdBin;\n            bin->count = 1;\n\n                \/\/ make a projected classad \n            for( ritr=refs.begin( ); ritr!=refs.end( ); ritr++ ) {\n                bin->ad->Insert( *ritr, ad->Lookup( *ritr )->Copy( ) );\n            }\n\n\t\t\t\t\/\/ insert bin into container\n\t\t\tcomp[sig] = bin;\n        } else {\n                \/\/ increment membership in bin\n            bin = citr->second;\n            bin->count++;\n        }\n\n            \/\/ process next ad\n        query->Next( key );\n    }\n\n    return( true );\n}\n<commit_msg>Added required scope resolution --- enums now live inside classes<commit_after>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n * CONDOR Copyright Notice\n *\n * See LICENSE.TXT for additional notices and disclaimers.\n *\n * Copyright (c)1990-1998 CONDOR Team, Computer Sciences Department, \n * University of Wisconsin-Madison, Madison, WI.  All Rights Reserved.  \n * No use of the CONDOR Software Program Source Code is authorized \n * without the express consent of the CONDOR Team.  For more information \n * contact: CONDOR Team, Attention: Professor Miron Livny, \n * 7367 Computer Sciences, 1210 W. Dayton St., Madison, WI 53706-1685, \n * (608) 262-0856 or miron@cs.wisc.edu.\n *\n * U.S. Government Rights Restrictions: Use, duplication, or disclosure \n * by the U.S. Government is subject to restrictions as set forth in \n * subparagraph (c)(1)(ii) of The Rights in Technical Data and Computer \n * Software clause at DFARS 252.227-7013 or subparagraphs (c)(1) and \n * (2) of Commercial Computer Software-Restricted Rights at 48 CFR \n * 52.227-19, as applicable, CONDOR Team, Attention: Professor Miron \n * Livny, 7367 Computer Sciences, 1210 W. Dayton St., Madison, \n * WI 53706-1685, (608) 262-0856 or miron@cs.wisc.edu.\n****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n#include \"condor_common.h\"\n#include \"condor_classad.h\"\n#include \"compress.h\"\n\nClassAdBin::ClassAdBin( )\n{\n    count = 0;\n    ad = new ClassAd( );\n}\n\nClassAdBin::~ClassAdBin( )\n{\n    delete ad;\n}\n\nbool\nMakeSignature( const ClassAd *ad, const References &refs, string &sig )\n{\n    References::iterator    itr;\n    ExprTree                *expr;\n    Value                   val;\n    ClassAdUnParser         unp;\n\n    sig = \"\";\n    for( itr=refs.begin( ); itr!= refs.end( ); itr++ ) {\n        if((expr=ad->Lookup(*itr))&&expr->GetKind()==ExprTree::LITERAL_NODE){\n            unp.Unparse( sig, expr );\n        } else {\n            return( false );\n        }\n        sig += \":\";\n    }\n\n    return( true );\n}\n\n\nbool\nCompress( ClassAdCollectionServer *server, LocalCollectionQuery *query,\n    const References &refs, CompressedAds &comp, list<ClassAd*> &rest )\n{\n    string                      key, sig;\n    References::const_iterator  ritr;\n    ClassAd                     *ad;\n    CompressedAds::iterator     citr;\n    ClassAdBin                  *bin;\n\n    query->ToFirst( );\n    query->Current( key );\n    while( !query->IsAfterLast( ) ) {\n            \/\/ get ad\n        if( !( ad = server->GetClassAd( key ) ) ) {\n            return( false );\n        }\n\n            \/\/ get signature of current ad\n        if( !MakeSignature( ad, refs, sig ) ) {\n                \/\/ can't make signature --- can't compress\n            rest.push_back( ad->Copy( ) );\n        }\n\n            \/\/ get bin\n        if( ( citr = comp.find( sig ) ) == comp.end( ) ) {\n                \/\/ no bin ... make one\n            bin = new ClassAdBin;\n            bin->count = 1;\n\n                \/\/ make a projected classad \n            for( ritr=refs.begin( ); ritr!=refs.end( ); ritr++ ) {\n                bin->ad->Insert( *ritr, ad->Lookup( *ritr )->Copy( ) );\n            }\n\n\t\t\t\t\/\/ insert bin into container\n\t\t\tcomp[sig] = bin;\n        } else {\n                \/\/ increment membership in bin\n            bin = citr->second;\n            bin->count++;\n        }\n\n            \/\/ process next ad\n        query->Next( key );\n    }\n\n    return( true );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream.h>\n#include \"exprTree.h\"\n\n\nint main( void )\n{\n\tSource\t\tsrc;\n\tSink\t\tsnk;\n\tValue\t\tval;\n\tExprTree\t*tree, *ftree;\n\t\n\tsrc.setSource( stdin );\n\tsnk.setSink ( stdout );\n\n\tif( !src.parseExpression( tree, true ) ) {\n\t\tcerr << \"Parse error\" << endl;\n\t\texit( 1 );\n\t} \n\n\tcout << endl << \"---\" << endl;\n\ttree->toSink( snk );\n\tsnk.flushSink();\n\tcout << endl << \"---\" << endl;\n\n\tif( !tree->flatten( val, ftree ) ) {\n\t\tcerr << \"Failed to flatten\" << endl;\n\t}\n\n\tif( ftree ) {\n\t\tftree->toSink( snk );\n\t} else {\n\t\tval.toSink( snk );\n\t}\n\n\tsnk.flushSink();\n\tcout << endl << endl;\n\t\t\n\tval.clear();\n\tdelete tree;\n\tdelete ftree;\n\n\treturn 0;\n}\n\t\n<commit_msg>Superceded by cxi, the Classad eXpresssion Interpreter<commit_after><|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 \"base\/threading\/platform_thread.h\"\n\n#include <errno.h>\n#include <sched.h>\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/safe_strerror_posix.h\"\n#include \"base\/threading\/thread_id_name_manager.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/tracked_objects.h\"\n\n#if !defined(OS_NACL)\n#include <sys\/prctl.h>\n#include <sys\/resource.h>\n#include <sys\/syscall.h>\n#include <sys\/time.h>\n#include <unistd.h>\n#endif\n\nnamespace base {\n\nnamespace {\n\nint ThreadNiceValue(ThreadPriority priority) {\n  switch (priority) {\n    case kThreadPriority_RealtimeAudio:\n      return -10;\n    case kThreadPriority_Background:\n      return 10;\n    case kThreadPriority_Normal:\n      return 0;\n    case kThreadPriority_Display:\n      return -6;\n    default:\n      NOTREACHED() << \"Unknown priority.\";\n      return 0;\n  }\n}\n\n}  \/\/ namespace\n\n\/\/ static\nvoid PlatformThread::SetName(const char* name) {\n  ThreadIdNameManager::GetInstance()->SetName(CurrentId(), name);\n  tracked_objects::ThreadData::InitializeThreadContext(name);\n\n#if !defined(OS_NACL)\n  \/\/ On linux we can get the thread names to show up in the debugger by setting\n  \/\/ the process name for the LWP.  We don't want to do this for the main\n  \/\/ thread because that would rename the process, causing tools like killall\n  \/\/ to stop working.\n  if (PlatformThread::CurrentId() == getpid())\n    return;\n\n  \/\/ http:\/\/0pointer.de\/blog\/projects\/name-your-threads.html\n  \/\/ Set the name for the LWP (which gets truncated to 15 characters).\n  \/\/ Note that glibc also has a 'pthread_setname_np' api, but it may not be\n  \/\/ available everywhere and it's only benefit over using prctl directly is\n  \/\/ that it can set the name of threads other than the current thread.\n  int err = prctl(PR_SET_NAME, name);\n  \/\/ We expect EPERM failures in sandboxed processes, just ignore those.\n  if (err < 0 && errno != EPERM)\n    DPLOG(ERROR) << \"prctl(PR_SET_NAME)\";\n#endif  \/\/  !defined(OS_NACL)\n}\n\n\/\/ static\nvoid PlatformThread::SetThreadPriority(PlatformThreadHandle handle,\n                                       ThreadPriority priority) {\n#if !defined(OS_NACL)\n  if (priority == kThreadPriority_RealtimeAudio) {\n    const struct sched_param kRealTimePrio = {8};\n    if (pthread_setschedparam(pthread_self(), SCHED_RR, &kRealTimePrio) == 0) {\n      \/\/ Got real time priority, no need to set nice level.\n      return;\n    }\n  }\n\n  \/\/ setpriority(2) should change the whole thread group's (i.e. process)\n  \/\/ priority. however, on linux it will only change the target thread's\n  \/\/ priority. see the bugs section in\n  \/\/ http:\/\/man7.org\/linux\/man-pages\/man2\/getpriority.2.html.\n  \/\/ we prefer using 0 rather than the current thread id since they are\n  \/\/ equivalent but it makes sandboxing easier (https:\/\/crbug.com\/399473).\n  DCHECK_NE(handle.id_, kInvalidThreadId);\n  const int kNiceSetting = ThreadNiceValue(priority);\n  const PlatformThreadId current_id = PlatformThread::CurrentId();\n  if (setpriority(PRIO_PROCESS,\n                  handle.id_ == current_id ? 0 : handle.id_,\n                  kNiceSetting)) {\n    DVPLOG(1) << \"Failed to set nice value of thread (\" << handle.id_ << \") to \"\n              << kNiceSetting;\n  }\n#endif  \/\/  !defined(OS_NACL)\n}\n\nvoid InitThreading() {}\n\nvoid InitOnThread() {}\n\nvoid TerminateOnThread() {}\n\nsize_t GetDefaultThreadStackSize(const pthread_attr_t& attributes) {\n#if !defined(THREAD_SANITIZER) && !defined(MEMORY_SANITIZER)\n  return 0;\n#else\n  \/\/ ThreadSanitizer bloats the stack heavily. Evidence has been that the\n  \/\/ default stack size isn't enough for some browser tests.\n  \/\/ MemorySanitizer needs this as a temporary fix for http:\/\/crbug.com\/353687\n  return 2 * (1 << 23);  \/\/ 2 times 8192K (the default stack size on Linux).\n#endif\n}\n\n}  \/\/ namespace base\n<commit_msg>Revert r257779: \"MemorySanitizer: adjust stack size to work around an MSan bug.\"<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 \"base\/threading\/platform_thread.h\"\n\n#include <errno.h>\n#include <sched.h>\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/safe_strerror_posix.h\"\n#include \"base\/threading\/thread_id_name_manager.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/tracked_objects.h\"\n\n#if !defined(OS_NACL)\n#include <sys\/prctl.h>\n#include <sys\/resource.h>\n#include <sys\/syscall.h>\n#include <sys\/time.h>\n#include <unistd.h>\n#endif\n\nnamespace base {\n\nnamespace {\n\nint ThreadNiceValue(ThreadPriority priority) {\n  switch (priority) {\n    case kThreadPriority_RealtimeAudio:\n      return -10;\n    case kThreadPriority_Background:\n      return 10;\n    case kThreadPriority_Normal:\n      return 0;\n    case kThreadPriority_Display:\n      return -6;\n    default:\n      NOTREACHED() << \"Unknown priority.\";\n      return 0;\n  }\n}\n\n}  \/\/ namespace\n\n\/\/ static\nvoid PlatformThread::SetName(const char* name) {\n  ThreadIdNameManager::GetInstance()->SetName(CurrentId(), name);\n  tracked_objects::ThreadData::InitializeThreadContext(name);\n\n#if !defined(OS_NACL)\n  \/\/ On linux we can get the thread names to show up in the debugger by setting\n  \/\/ the process name for the LWP.  We don't want to do this for the main\n  \/\/ thread because that would rename the process, causing tools like killall\n  \/\/ to stop working.\n  if (PlatformThread::CurrentId() == getpid())\n    return;\n\n  \/\/ http:\/\/0pointer.de\/blog\/projects\/name-your-threads.html\n  \/\/ Set the name for the LWP (which gets truncated to 15 characters).\n  \/\/ Note that glibc also has a 'pthread_setname_np' api, but it may not be\n  \/\/ available everywhere and it's only benefit over using prctl directly is\n  \/\/ that it can set the name of threads other than the current thread.\n  int err = prctl(PR_SET_NAME, name);\n  \/\/ We expect EPERM failures in sandboxed processes, just ignore those.\n  if (err < 0 && errno != EPERM)\n    DPLOG(ERROR) << \"prctl(PR_SET_NAME)\";\n#endif  \/\/  !defined(OS_NACL)\n}\n\n\/\/ static\nvoid PlatformThread::SetThreadPriority(PlatformThreadHandle handle,\n                                       ThreadPriority priority) {\n#if !defined(OS_NACL)\n  if (priority == kThreadPriority_RealtimeAudio) {\n    const struct sched_param kRealTimePrio = {8};\n    if (pthread_setschedparam(pthread_self(), SCHED_RR, &kRealTimePrio) == 0) {\n      \/\/ Got real time priority, no need to set nice level.\n      return;\n    }\n  }\n\n  \/\/ setpriority(2) should change the whole thread group's (i.e. process)\n  \/\/ priority. however, on linux it will only change the target thread's\n  \/\/ priority. see the bugs section in\n  \/\/ http:\/\/man7.org\/linux\/man-pages\/man2\/getpriority.2.html.\n  \/\/ we prefer using 0 rather than the current thread id since they are\n  \/\/ equivalent but it makes sandboxing easier (https:\/\/crbug.com\/399473).\n  DCHECK_NE(handle.id_, kInvalidThreadId);\n  const int kNiceSetting = ThreadNiceValue(priority);\n  const PlatformThreadId current_id = PlatformThread::CurrentId();\n  if (setpriority(PRIO_PROCESS,\n                  handle.id_ == current_id ? 0 : handle.id_,\n                  kNiceSetting)) {\n    DVPLOG(1) << \"Failed to set nice value of thread (\" << handle.id_ << \") to \"\n              << kNiceSetting;\n  }\n#endif  \/\/  !defined(OS_NACL)\n}\n\nvoid InitThreading() {}\n\nvoid InitOnThread() {}\n\nvoid TerminateOnThread() {}\n\nsize_t GetDefaultThreadStackSize(const pthread_attr_t& attributes) {\n#if !defined(THREAD_SANITIZER)\n  return 0;\n#else\n  \/\/ ThreadSanitizer bloats the stack heavily. Evidence has been that the\n  \/\/ default stack size isn't enough for some browser tests.\n  return 2 * (1 << 23);  \/\/ 2 times 8192K (the default stack size on Linux).\n#endif\n}\n\n}  \/\/ namespace base\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  parser_tables.cpp\n\/\/  Parse\n\/\/\n\/\/  Created by Andrew Hunter on 07\/05\/2011.\n\/\/  Copyright 2011 __MyCompanyName__. All rights reserved.\n\/\/\n\n#include <algorithm>\n\n#include \"parser_tables.h\"\n\nusing namespace std;\nusing namespace contextfree;\nusing namespace lr;\n\n\/\/\/ \\brief Ranks actions in the order they should appear in the final table\nstatic inline int action_score(int action) {\n    switch (action) {\n        case lr_action::act_weakreduce:\n            \/\/ Weak reduce actions come first as they should always be performed if their symbol will produce a shift\n            return 0;\n            \n        case lr_action::act_shift:\n            \/\/ Shift actions are preferred if there's a conflict\n            return 1;\n            \n        case lr_action::act_reduce:\n            \/\/ Reduce actions have the lowest priority\n            return 2;\n            \n        case lr_action::act_goto:\n            \/\/ Gotos never actually produce a clash\n            return 3;\n            \n        default:\n            return 4;\n    }\n}\n\nstatic inline bool compare_actions(const parser_tables::action& a, const parser_tables::action& b) {\n    \/\/ First, compare on symbol IDs\n    if (a.m_SymbolId < b.m_SymbolId) return true;\n    \n    \/\/ Next, compare on action types\n    if (action_score(a.m_Type) < action_score(b.m_Type)) return true;\n    \n    \/\/ Actions are equal\n    return false;\n}\n\n\/\/\/ \\brief Creates a parser from the result of the specified builder class\nparser_tables::parser_tables(const lalr_builder& builder) {\n    \/\/ Allocate the tables\n    m_NumStates             = builder.count_states();\n    m_NonterminalActions    = new action*[m_NumStates];\n    m_TerminalActions       = new action*[m_NumStates];\n    m_Counts                = new action_count[m_NumStates];\n    \n    contextfree::end_of_input eoi;\n    m_EndOfInput            = builder.gram().identifier_for_item(eoi);\n    \n    const grammar& gram = builder.gram();\n    \n    map<int, int> ruleIds;                          \/\/ Maps their rule IDs to our rule IDs\n    \n    \/\/ Build up the tables for each state\n    for (int stateId = 0; stateId < m_NumStates; stateId++) {\n        \/\/ Get the actions for this state\n        const lr_action_set& actions = builder.actions_for_state(stateId);\n        \n        \/\/ Count the number of terminal and nonterminal actions\n        int termCount       = 0;\n        int nontermCount    = 0;\n        \n        for (lr_action_set::const_iterator nextAction = actions.begin(); nextAction != actions.end(); nextAction++) {\n            if ((*nextAction)->item()->type() == item::terminal) {\n                termCount++;\n            } else {\n                nontermCount++;\n            }\n        }\n        \n        \/\/ Allocate action tables of the appropriate size\n        action* termActions     = new action[termCount];\n        action* nontermActions  = new action[nontermCount];\n        \n        int     termPos         = 0;                    \/\/ Current item in the terminal table\n        int     nontermPos      = 0;                    \/\/ Current item in the nonterminal table\n        \n        \/\/ Fill up the actions (not in order)\n        for (lr_action_set::const_iterator nextAction = actions.begin(); nextAction != actions.end(); nextAction++) {\n            \/\/ Get the next state\n            int nextState   = (*nextAction)->next_state();\n            int type        = (*nextAction)->type();\n            \n            \/\/ If the next action is a reduce action, then the next state should actually be the rule to reduce\n            if (type == lr_action::act_reduce || type == lr_action::act_weakreduce) {\n                \/\/ Look up the ID we assigned this rule\n                int                     ruleId  = (*nextAction)->rule()->identifier(gram);\n                map<int, int>::iterator found   = ruleIds.find(ruleId);\n                \n                if (found == ruleIds.end()) {\n                    nextState       = (int)ruleIds.size();\n                    ruleIds[ruleId] = nextState;\n                } else {\n                    nextState       = found->second;\n                }\n            }\n            \n            if ((*nextAction)->item()->type() == item::terminal) {\n                \/\/ Add a new terminal action\n                termActions[termPos].m_Type             = type;\n                termActions[termPos].m_NextState        = nextState;\n                termActions[termPos].m_SymbolId         = (*nextAction)->item()->symbol();\n                \n                termPos++;\n            } else {\n                \/\/ Add a new nonterminal action\n                nontermActions[nontermPos].m_Type       = type;\n                nontermActions[nontermPos].m_NextState  = nextState;\n                nontermActions[nontermPos].m_SymbolId   = gram.identifier_for_item((*nextAction)->item());\n            }\n        }\n        \n        \/\/ Sort the actions for this state\n        std::sort(termActions, termActions + termCount, compare_actions);\n        std::sort(nontermActions, nontermActions + nontermCount, compare_actions);\n        \n        \/\/ Store the actions in the table\n        m_TerminalActions[stateId]      = termActions;\n        m_NonterminalActions[stateId]   = nontermActions;\n        m_Counts[stateId].m_NumTerms    = termCount;\n        m_Counts[stateId].m_NumNonterms = nontermCount;\n    }\n    \n    \/\/ Fill in the rule table\n    m_NumRules  = (int)ruleIds.size();\n    m_Rules     = new reduce_rule[ruleIds.size()];\n    \n    for (map<int, int>::iterator ruleId = ruleIds.begin(); ruleId != ruleIds.end(); ruleId++) {\n        m_Rules[ruleId->second].m_Identifier    = ruleId->first;\n        m_Rules[ruleId->second].m_Length        = (int)gram.rule_with_identifier(ruleId->first)->items().size();\n    }\n}\n\n\/\/\/ \\brief Copy constructor\nparser_tables::parser_tables(const parser_tables& copyFrom) \n: m_NumStates(copyFrom.m_NumStates)\n, m_NumRules(copyFrom.m_NumRules)\n, m_EndOfInput(copyFrom.m_EndOfInput) {\n    \/\/ Allocate the action tables\n    m_TerminalActions       = new action*[m_NumStates];\n    m_NonterminalActions    = new action*[m_NumStates];\n    m_Counts                = new action_count[m_NumStates];\n    \n    \/\/ Copy the states\n    for (int stateId=0; stateId<m_NumStates; stateId++) {\n        \/\/ Copy the counts\n        m_Counts[stateId] = copyFrom.m_Counts[stateId];\n        \n        \/\/ Allocate the array for this state\n        m_TerminalActions[stateId]      = new action[m_Counts[stateId].m_NumTerms];\n        m_NonterminalActions[stateId]   = new action[m_Counts[stateId].m_NumNonterms];\n        \n        \/\/ Copy the terminals and nonterminals\n        for (int x=0; x<m_Counts[stateId].m_NumTerms; x++) {\n            m_TerminalActions[stateId][x] = copyFrom.m_TerminalActions[stateId][x];\n        }\n        for (int x=0; x<m_Counts[stateId].m_NumNonterms; x++) {\n            m_NonterminalActions[stateId][x] = copyFrom.m_NonterminalActions[stateId][x];\n        }\n    }\n    \n    \/\/ Allocate the rule table\n    m_Rules = new reduce_rule[m_NumRules];\n    for (int ruleId=0; ruleId<m_NumRules; ruleId++) {\n        m_Rules[ruleId] = copyFrom.m_Rules[ruleId];\n    }\n}\n\n\/\/\/ \\brief Assignment\nparser_tables& parser_tables::operator=(const parser_tables& copyFrom) {\n    if (&copyFrom == this) return *this;\n    \n    \/\/ TODO\n    \n    return *this;\n}\n\n\/\/\/ \\brief Destructor\nparser_tables::~parser_tables() {\n    \/\/ Destroy each entry in the parser table\n    for (int x=0; x<m_NumStates; x++) {\n        delete[] m_NonterminalActions[x];\n        delete[] m_TerminalActions[x];\n    }\n    \n    \/\/ Destroy the tables themselves\n    delete[] m_NonterminalActions;\n    delete[] m_TerminalActions;\n    delete[] m_Rules;\n    delete[] m_Counts;\n}\n<commit_msg>Was writing out the rule ID instead of the nonterminal identifier to the rules Wasn't moving the position on in the nonterminal array<commit_after>\/\/\n\/\/  parser_tables.cpp\n\/\/  Parse\n\/\/\n\/\/  Created by Andrew Hunter on 07\/05\/2011.\n\/\/  Copyright 2011 __MyCompanyName__. All rights reserved.\n\/\/\n\n#include <algorithm>\n\n#include \"parser_tables.h\"\n\nusing namespace std;\nusing namespace contextfree;\nusing namespace lr;\n\n\/\/\/ \\brief Ranks actions in the order they should appear in the final table\nstatic inline int action_score(int action) {\n    switch (action) {\n        case lr_action::act_weakreduce:\n            \/\/ Weak reduce actions come first as they should always be performed if their symbol will produce a shift\n            return 0;\n            \n        case lr_action::act_shift:\n            \/\/ Shift actions are preferred if there's a conflict\n            return 1;\n            \n        case lr_action::act_reduce:\n            \/\/ Reduce actions have the lowest priority\n            return 2;\n            \n        case lr_action::act_goto:\n            \/\/ Gotos never actually produce a clash\n            return 3;\n            \n        default:\n            return 4;\n    }\n}\n\nstatic inline bool compare_actions(const parser_tables::action& a, const parser_tables::action& b) {\n    \/\/ First, compare on symbol IDs\n    if (a.m_SymbolId < b.m_SymbolId) return true;\n    \n    \/\/ Next, compare on action types\n    if (action_score(a.m_Type) < action_score(b.m_Type)) return true;\n    \n    \/\/ Actions are equal\n    return false;\n}\n\n\/\/\/ \\brief Creates a parser from the result of the specified builder class\nparser_tables::parser_tables(const lalr_builder& builder) {\n    \/\/ Allocate the tables\n    m_NumStates             = builder.count_states();\n    m_NonterminalActions    = new action*[m_NumStates];\n    m_TerminalActions       = new action*[m_NumStates];\n    m_Counts                = new action_count[m_NumStates];\n    \n    contextfree::end_of_input eoi;\n    m_EndOfInput            = builder.gram().identifier_for_item(eoi);\n    \n    const grammar& gram = builder.gram();\n    \n    map<int, int> ruleIds;                          \/\/ Maps their rule IDs to our rule IDs\n    \n    \/\/ Build up the tables for each state\n    for (int stateId = 0; stateId < m_NumStates; stateId++) {\n        \/\/ Get the actions for this state\n        const lr_action_set& actions = builder.actions_for_state(stateId);\n        \n        \/\/ Count the number of terminal and nonterminal actions\n        int termCount       = 0;\n        int nontermCount    = 0;\n        \n        for (lr_action_set::const_iterator nextAction = actions.begin(); nextAction != actions.end(); nextAction++) {\n            if ((*nextAction)->item()->type() == item::terminal) {\n                termCount++;\n            } else {\n                nontermCount++;\n            }\n        }\n        \n        \/\/ Allocate action tables of the appropriate size\n        action* termActions     = new action[termCount];\n        action* nontermActions  = new action[nontermCount];\n        \n        int     termPos         = 0;                    \/\/ Current item in the terminal table\n        int     nontermPos      = 0;                    \/\/ Current item in the nonterminal table\n        \n        \/\/ Fill up the actions (not in order)\n        for (lr_action_set::const_iterator nextAction = actions.begin(); nextAction != actions.end(); nextAction++) {\n            \/\/ Get the next state\n            int nextState   = (*nextAction)->next_state();\n            int type        = (*nextAction)->type();\n            \n            \/\/ If the next action is a reduce action, then the next state should actually be the rule to reduce\n            if (type == lr_action::act_reduce || type == lr_action::act_weakreduce) {\n                \/\/ Look up the ID we assigned this rule\n                int                     ruleId  = (*nextAction)->rule()->identifier(gram);\n                map<int, int>::iterator found   = ruleIds.find(ruleId);\n                \n                if (found == ruleIds.end()) {\n                    nextState       = (int)ruleIds.size();\n                    ruleIds[ruleId] = nextState;\n                } else {\n                    nextState       = found->second;\n                }\n            }\n            \n            if ((*nextAction)->item()->type() == item::terminal) {\n                \/\/ Add a new terminal action\n                termActions[termPos].m_Type             = type;\n                termActions[termPos].m_NextState        = nextState;\n                termActions[termPos].m_SymbolId         = (*nextAction)->item()->symbol();\n                \n                termPos++;\n            } else {\n                \/\/ Add a new nonterminal action\n                nontermActions[nontermPos].m_Type       = type;\n                nontermActions[nontermPos].m_NextState  = nextState;\n                nontermActions[nontermPos].m_SymbolId   = gram.identifier_for_item((*nextAction)->item());\n                \n                nontermPos++;\n            }\n        }\n        \n        \/\/ Sort the actions for this state\n        std::sort(termActions, termActions + termCount, compare_actions);\n        std::sort(nontermActions, nontermActions + nontermCount, compare_actions);\n        \n        \/\/ Store the actions in the table\n        m_TerminalActions[stateId]      = termActions;\n        m_NonterminalActions[stateId]   = nontermActions;\n        m_Counts[stateId].m_NumTerms    = termCount;\n        m_Counts[stateId].m_NumNonterms = nontermCount;\n    }\n    \n    \/\/ Fill in the rule table\n    m_NumRules  = (int)ruleIds.size();\n    m_Rules     = new reduce_rule[ruleIds.size()];\n    \n    for (map<int, int>::iterator ruleId = ruleIds.begin(); ruleId != ruleIds.end(); ruleId++) {\n        const rule_container& rule = gram.rule_with_identifier(ruleId->first);\n        \n        m_Rules[ruleId->second].m_Identifier    = gram.identifier_for_item(rule->nonterminal());\n        m_Rules[ruleId->second].m_Length        = (int)rule->items().size();\n    }\n}\n\n\/\/\/ \\brief Copy constructor\nparser_tables::parser_tables(const parser_tables& copyFrom) \n: m_NumStates(copyFrom.m_NumStates)\n, m_NumRules(copyFrom.m_NumRules)\n, m_EndOfInput(copyFrom.m_EndOfInput) {\n    \/\/ Allocate the action tables\n    m_TerminalActions       = new action*[m_NumStates];\n    m_NonterminalActions    = new action*[m_NumStates];\n    m_Counts                = new action_count[m_NumStates];\n    \n    \/\/ Copy the states\n    for (int stateId=0; stateId<m_NumStates; stateId++) {\n        \/\/ Copy the counts\n        m_Counts[stateId] = copyFrom.m_Counts[stateId];\n        \n        \/\/ Allocate the array for this state\n        m_TerminalActions[stateId]      = new action[m_Counts[stateId].m_NumTerms];\n        m_NonterminalActions[stateId]   = new action[m_Counts[stateId].m_NumNonterms];\n        \n        \/\/ Copy the terminals and nonterminals\n        for (int x=0; x<m_Counts[stateId].m_NumTerms; x++) {\n            m_TerminalActions[stateId][x] = copyFrom.m_TerminalActions[stateId][x];\n        }\n        for (int x=0; x<m_Counts[stateId].m_NumNonterms; x++) {\n            m_NonterminalActions[stateId][x] = copyFrom.m_NonterminalActions[stateId][x];\n        }\n    }\n    \n    \/\/ Allocate the rule table\n    m_Rules = new reduce_rule[m_NumRules];\n    for (int ruleId=0; ruleId<m_NumRules; ruleId++) {\n        m_Rules[ruleId] = copyFrom.m_Rules[ruleId];\n    }\n}\n\n\/\/\/ \\brief Assignment\nparser_tables& parser_tables::operator=(const parser_tables& copyFrom) {\n    if (&copyFrom == this) return *this;\n    \n    \/\/ TODO\n    \n    return *this;\n}\n\n\/\/\/ \\brief Destructor\nparser_tables::~parser_tables() {\n    \/\/ Destroy each entry in the parser table\n    for (int x=0; x<m_NumStates; x++) {\n        delete[] m_NonterminalActions[x];\n        delete[] m_TerminalActions[x];\n    }\n    \n    \/\/ Destroy the tables themselves\n    delete[] m_NonterminalActions;\n    delete[] m_TerminalActions;\n    delete[] m_Rules;\n    delete[] m_Counts;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/--------------------------------------------------------------------------------\n\/\/ compile test code for g++\n\/\/--------------------------------------------------------------------------------\n\n\/\/ [command sample]\n\/\/ $ cd simplesp\n\/\/ $ g++ compiletest.cpp -I .\/ -std=c++11\n\/\/ $ .\/a.exe\n\n#include \"simplesp.h\"\nusing namespace sp;\n\nint main(){\n\tprintf(\"compile test\\n\");\n\t\n    return 0;\n}\n<commit_msg>refactoring<commit_after>\/\/--------------------------------------------------------------------------------\n\/\/ compile test code for g++\n\/\/--------------------------------------------------------------------------------\n\n\/\/ [command sample]\n\/\/ $ cd simplesp\n\/\/ $ g++ compiletest.cpp -I .\/ -std=c++11\n\/\/ $ .\/a.exe\n\n#include \"simplesp.h\"\nusing namespace sp;\n\nint main() {\n    printf(\"compile test\\n\");\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <X11\/Xlib.h>\n#include <X11\/keysym.h>\n#include <irrlicht\/Keycodes.h>\n#include <stdio.h>\n#include <unistd.h>\n\n#define RETURN 13\n#define BS 8\n#define SPACE 32\n\nXKeyEvent createKeyEvent(Display *display,\n                         Window &win,\n                         Window &winRoot,\n                         bool press,\n                         int keycode,\n                         int modifiers)\n{\n  \/\/ Largely lifted from\n  \/\/ http:\/\/www.doctort.org\/adam\/nerd-notes\/x11-fake-keypress-event.html\n  XKeyEvent event;\n  event.display = display;\n  event.window = win;\n  event.root = winRoot;\n  event.subwindow = None;\n  event.time = CurrentTime;\n  event.x = 1;\n  event.y = 1;\n  event.x_root = 1;\n  event.y_root = 1;\n  event.same_screen = True;\n  event.keycode = XKeysymToKeycode(display, keycode);\n  event.state = modifiers;\n\n  if(press)\n    event.type = KeyPress;\n  else\n    event.type = KeyRelease;\n\n  return event;\n}\n\nclass X11Display {\n  public:\n    Display *display;\n    Window winRoot;\n    X11Display(const char* dispName);\n    ~X11Display();\n    int sendKeyEvent(int keycode, bool keyDown, int mod);\n};\n\n\/\/ TODO: fail out if display doesn't initialize\nX11Display::X11Display(const char* dispName) :\n  display(XOpenDisplay(dispName)),\n  winRoot(XDefaultRootWindow(display)) {}\n\nX11Display::~X11Display() { XCloseDisplay(display); }\n\nint X11Display::sendKeyEvent(int keycode, bool keyDown, int mod = 0)\n{\n  if(-1==keycode)\n    return 0;\n  printf(\"sendKeyEvent keycode: %d\\n\", keycode);\n  Window winFocus;\n  int revert;\n\n  XGetInputFocus(display, &winFocus, &revert);\n  XKeyEvent event = createKeyEvent(display, winFocus, winRoot, keyDown, keycode, mod);\n  XSendEvent(event.display, event.window, True, KeyPressMask, (XEvent*)&event);\n  return 0;\n}\n\nbool IsModKey(int keycode) {\n  switch(keycode){\n    \/\/shift, control and menu (both left and right) are consecutive\n    case irr::KEY_LSHIFT ... irr::KEY_RMENU :\n      return true;\n    default :\n      return false;\n  }\n}\n\nint mapKeyCode(int irrcode){\n  switch(irrcode){\n    \/\/FIXME: only to get rid of arrow spam\n    case 37 ... 40:\n      return -1;\n    case irr::KEY_BACK :\n      return XK_BackSpace;\n    case irr::KEY_TAB :\n      return XK_Tab;\n    \/\/FIXME: Should escape be a modifier too?\n    case irr::KEY_ESCAPE :\n      return XK_Escape;\n    case irr::KEY_RETURN :\n      return XK_Return;\n    case irr::KEY_MINUS :\n      return XK_minus;\n    case irr::KEY_OEM_1 :\n      return XK_semicolon;\n    case irr::KEY_OEM_2 :\n      return XK_slash;\n    case irr::KEY_OEM_7 :\n      return XK_apostrophe;\n    case irr::KEY_PERIOD :\n      return XK_period;\n    case irr::KEY_OEM_5 :\n      return XK_backslash;\n    case irr::KEY_LSHIFT :\n      return XK_Shift_L;\n    case irr::KEY_RSHIFT :\n      return XK_Shift_R;\n    case irr::KEY_LCONTROL :\n      return XK_Control_L;\n    case irr::KEY_RCONTROL :\n      return XK_Control_R;\n    default:\n      return irrcode;\n  }\n}\n\n<commit_msg>Added comma<commit_after>#include <X11\/Xlib.h>\n#include <X11\/keysym.h>\n#include <irrlicht\/Keycodes.h>\n#include <stdio.h>\n#include <unistd.h>\n\n#define RETURN 13\n#define BS 8\n#define SPACE 32\n\nXKeyEvent createKeyEvent(Display *display,\n                         Window &win,\n                         Window &winRoot,\n                         bool press,\n                         int keycode,\n                         int modifiers)\n{\n  \/\/ Largely lifted from\n  \/\/ http:\/\/www.doctort.org\/adam\/nerd-notes\/x11-fake-keypress-event.html\n  XKeyEvent event;\n  event.display = display;\n  event.window = win;\n  event.root = winRoot;\n  event.subwindow = None;\n  event.time = CurrentTime;\n  event.x = 1;\n  event.y = 1;\n  event.x_root = 1;\n  event.y_root = 1;\n  event.same_screen = True;\n  event.keycode = XKeysymToKeycode(display, keycode);\n  event.state = modifiers;\n\n  if(press)\n    event.type = KeyPress;\n  else\n    event.type = KeyRelease;\n\n  return event;\n}\n\nclass X11Display {\n  public:\n    Display *display;\n    Window winRoot;\n    X11Display(const char* dispName);\n    ~X11Display();\n    int sendKeyEvent(int keycode, bool keyDown, int mod);\n};\n\n\/\/ TODO: fail out if display doesn't initialize\nX11Display::X11Display(const char* dispName) :\n  display(XOpenDisplay(dispName)),\n  winRoot(XDefaultRootWindow(display)) {}\n\nX11Display::~X11Display() { XCloseDisplay(display); }\n\nint X11Display::sendKeyEvent(int keycode, bool keyDown, int mod = 0)\n{\n  if(-1==keycode)\n    return 0;\n  printf(\"sendKeyEvent keycode: %d\\n\", keycode);\n  Window winFocus;\n  int revert;\n\n  XGetInputFocus(display, &winFocus, &revert);\n  XKeyEvent event = createKeyEvent(display, winFocus, winRoot, keyDown, keycode, mod);\n  XSendEvent(event.display, event.window, True, KeyPressMask, (XEvent*)&event);\n  return 0;\n}\n\nbool IsModKey(int keycode) {\n  switch(keycode){\n    \/\/shift, control and menu (both left and right) are consecutive\n    case irr::KEY_LSHIFT ... irr::KEY_RMENU :\n      return true;\n    default :\n      return false;\n  }\n}\n\nint mapKeyCode(int irrcode){\n  switch(irrcode){\n    \/\/FIXME: only to get rid of arrow spam\n    case 37 ... 40:\n      return -1;\n    case irr::KEY_BACK :\n      return XK_BackSpace;\n    case irr::KEY_TAB :\n      return XK_Tab;\n    \/\/FIXME: Should escape be a modifier too?\n    case irr::KEY_ESCAPE :\n      return XK_Escape;\n    case irr::KEY_RETURN :\n      return XK_Return;\n    case irr::KEY_MINUS :\n      return XK_minus;\n    case irr::KEY_OEM_1 :\n      return XK_semicolon;\n    case irr::KEY_OEM_2 :\n      return XK_slash;\n    case irr::KEY_OEM_7 :\n      return XK_apostrophe;\n    case irr::KEY_PERIOD :\n      return XK_period;\n    case irr::KEY_COMMA :\n      return XK_comma;\n    case irr::KEY_OEM_5 :\n      return XK_backslash;\n    case irr::KEY_LSHIFT :\n      return XK_Shift_L;\n    case irr::KEY_RSHIFT :\n      return XK_Shift_R;\n    case irr::KEY_LCONTROL :\n      return XK_Control_L;\n    case irr::KEY_RCONTROL :\n      return XK_Control_R;\n    default:\n      return irrcode;\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"entity_groups.h\"\n#include \"core\/blob.h\"\n#include \"core\/string.h\"\n#include \"universe\/universe.h\"\n\n\nnamespace Lumix\n{\nEntityGroups::EntityGroups(IAllocator& allocator)\n\t: m_groups(allocator)\n\t, m_group_infos(allocator)\n\t, m_entity_to_group_map(allocator)\n\t, m_allocator(allocator)\n\t, m_universe(nullptr)\n{\n\tm_groups.emplace(allocator);\n\tauto& info = m_group_infos.emplace();\n\tcopyString(info.name, \"default\");\n}\n\n\nint EntityGroups::getGroup(const char* name) const\n{\n\tfor (int i = 0, c = m_group_infos.size(); i < c; ++i)\n\t{\n\t\tif (compareString(m_group_infos[i].name, name) == 0) return i;\n\t}\n\treturn -1;\n}\n\n\nvoid EntityGroups::freezeGroup(int idx, bool freeze)\n{\n\tm_group_infos[idx].frozen = freeze;\n}\n\n\nbool EntityGroups::isGroupFrozen(int idx) const\n{\n\treturn m_group_infos[idx].frozen;\n}\n\n\nvoid EntityGroups::allEntitiesToDefault()\n{\n\tASSERT(m_groups.size() == 1);\n\tASSERT(m_groups[0].empty());\n\tASSERT(m_universe);\n\n\tfor (int i = 0, c = m_universe->getEntityCount(); i < c; ++i)\n\t{\n\t\tEntity entity = m_universe->getEntityFromDenseIdx(i);\n\t\tm_groups[0].push(entity);\n\t\tm_entity_to_group_map[entity] = 0;\n\t}\n}\n\n\nvoid EntityGroups::deleteGroup(int idx)\n{\n\tif (m_groups.size() == 1) return;\n\tint default_idx = idx == 0 ? 1 : 0;\n\tfor (auto e : m_groups[idx])\n\t{\n\t\tm_groups[default_idx].push(e);\n\t}\n\tm_groups.eraseFast(idx);\n\tm_group_infos.eraseFast(idx);\n}\n\n\nvoid EntityGroups::createGroup(const char* name)\n{\n\tif (name[0] == 0) return;\n\tfor (auto& i : m_group_infos)\n\t{\n\t\tif (compareString(i.name, name) == 0) return;\n\t}\n\n\tm_groups.emplace(m_allocator);\n\tauto& group_info = m_group_infos.emplace();\n\tcopyString(group_info.name, name);\n\tgroup_info.frozen = false;\n}\n\n\nvoid EntityGroups::setUniverse(Universe* universe)\n{\n\tif (m_universe)\n\t{\n\t\tm_universe->entityCreated().unbind<EntityGroups, &EntityGroups::onEntityCreated>(this);\n\t\tm_universe->entityDestroyed().unbind<EntityGroups, &EntityGroups::onEntityDestroyed>(this);\n\t}\n\n\tm_universe = universe;\n\tm_group_infos.clear();\n\tm_groups.clear();\n\tm_groups.emplace(m_allocator);\n\tauto& info = m_group_infos.emplace();\n\tcopyString(info.name, \"default\");\n\n\tif (m_universe)\n\t{\n\t\tm_universe->entityCreated().bind<EntityGroups, &EntityGroups::onEntityCreated>(this);\n\t\tm_universe->entityDestroyed().bind<EntityGroups, &EntityGroups::onEntityDestroyed>(this);\n\t}\n}\n\n\nint EntityGroups::getGroupEntitiesCount(int idx) const\n{\n\treturn m_groups[idx].size();\n}\n\n\nvoid EntityGroups::onEntityCreated(Entity entity)\n{\n\tm_groups[0].push(entity);\n\tASSERT(entity == m_entity_to_group_map.size());\n\tm_entity_to_group_map.push(0);\n}\n\n\nvoid EntityGroups::onEntityDestroyed(Entity entity)\n{\n\tremoveFromGroup(entity);\n\tm_entity_to_group_map[entity] = -1;\n}\n\n\nvoid EntityGroups::setGroup(Entity entity, int group)\n{\n\tremoveFromGroup(entity);\n\tm_groups[group].push(entity);\n\tm_entity_to_group_map[entity] = group;\n}\n\n\nvoid EntityGroups::removeFromGroup(Entity entity)\n{\n\tm_groups[m_entity_to_group_map[entity]].eraseItemFast(entity);\n\tm_entity_to_group_map[entity] = -1;\n}\n\n\nvoid EntityGroups::serialize(OutputBlob& blob)\n{\n\tASSERT(sizeof(m_group_infos[0]) == 20);\n\n\tblob.write(m_group_infos.size());\n\tblob.write(&m_group_infos[0], m_group_infos.size() * sizeof(m_group_infos[0]));\n\n\tfor(auto& i : m_groups)\n\t{\n\t\tblob.write(i.size());\n\t\tif(!i.empty()) blob.write(&i[0], i.size() * sizeof(i[0]));\n\t}\n}\n\n\nvoid EntityGroups::deserialize(InputBlob& blob)\n{\n\tint count;\n\tblob.read(count);\n\tm_group_infos.resize(count);\n\tfor (int i = 0; i < count; ++i)\n\t{\n\t\tblob.read(m_group_infos[i].name, sizeof(m_group_infos[i].name));\n\t\tm_group_infos[i].frozen = false;\n\t}\n\n\tm_groups.clear();\n\tint entity_count = 0;\n\tfor(int i = 0; i < count; ++i)\n\t{\n\t\tint group_size;\n\t\tauto& group = m_groups.emplace(m_allocator);\n\t\tblob.read(group_size);\n\t\tentity_count += group_size;\n\t\tgroup.resize(group_size);\n\t\tif(group_size > 0) blob.read(&group[0], group_size * sizeof(group[0]));\n\t}\n\tm_entity_to_group_map.resize(entity_count);\n\tfor (int i = 0; i < m_groups.size(); ++i)\n\t{\n\t\tfor (auto e : m_groups[i])\n\t\t{\n\t\t\tm_entity_to_group_map[e] = i;\n\t\t}\n\t}\n}\n\n\nconst Entity* EntityGroups::getGroupEntities(int idx) const\n{\n\treturn &m_groups[idx][0];\n}\n\n\nint EntityGroups::getGroupCount() const\n{\n\treturn m_groups.size();\n}\n\n\nconst char* EntityGroups::getGroupName(int idx) const\n{\n\treturn m_group_infos[idx].name;\n}\n\n\nvoid EntityGroups::setGroupName(int idx, const char* name)\n{\n\tcopyString(m_group_infos[idx].name, name);\n}\n} \/\/ namespace Lumix\n<commit_msg>fixed crash when there are spaces in the ids of entities<commit_after>#include \"entity_groups.h\"\n#include \"core\/blob.h\"\n#include \"core\/string.h\"\n#include \"universe\/universe.h\"\n\n\nnamespace Lumix\n{\nEntityGroups::EntityGroups(IAllocator& allocator)\n\t: m_groups(allocator)\n\t, m_group_infos(allocator)\n\t, m_entity_to_group_map(allocator)\n\t, m_allocator(allocator)\n\t, m_universe(nullptr)\n{\n\tm_groups.emplace(allocator);\n\tauto& info = m_group_infos.emplace();\n\tcopyString(info.name, \"default\");\n}\n\n\nint EntityGroups::getGroup(const char* name) const\n{\n\tfor (int i = 0, c = m_group_infos.size(); i < c; ++i)\n\t{\n\t\tif (compareString(m_group_infos[i].name, name) == 0) return i;\n\t}\n\treturn -1;\n}\n\n\nvoid EntityGroups::freezeGroup(int idx, bool freeze)\n{\n\tm_group_infos[idx].frozen = freeze;\n}\n\n\nbool EntityGroups::isGroupFrozen(int idx) const\n{\n\treturn m_group_infos[idx].frozen;\n}\n\n\nvoid EntityGroups::allEntitiesToDefault()\n{\n\tASSERT(m_groups.size() == 1);\n\tASSERT(m_groups[0].empty());\n\tASSERT(m_universe);\n\n\tfor (int i = 0, c = m_universe->getEntityCount(); i < c; ++i)\n\t{\n\t\tEntity entity = m_universe->getEntityFromDenseIdx(i);\n\t\tm_groups[0].push(entity);\n\t\tm_entity_to_group_map[entity] = 0;\n\t}\n}\n\n\nvoid EntityGroups::deleteGroup(int idx)\n{\n\tif (m_groups.size() == 1) return;\n\tint default_idx = idx == 0 ? 1 : 0;\n\tfor (auto e : m_groups[idx])\n\t{\n\t\tm_groups[default_idx].push(e);\n\t}\n\tm_groups.eraseFast(idx);\n\tm_group_infos.eraseFast(idx);\n}\n\n\nvoid EntityGroups::createGroup(const char* name)\n{\n\tif (name[0] == 0) return;\n\tfor (auto& i : m_group_infos)\n\t{\n\t\tif (compareString(i.name, name) == 0) return;\n\t}\n\n\tm_groups.emplace(m_allocator);\n\tauto& group_info = m_group_infos.emplace();\n\tcopyString(group_info.name, name);\n\tgroup_info.frozen = false;\n}\n\n\nvoid EntityGroups::setUniverse(Universe* universe)\n{\n\tif (m_universe)\n\t{\n\t\tm_universe->entityCreated().unbind<EntityGroups, &EntityGroups::onEntityCreated>(this);\n\t\tm_universe->entityDestroyed().unbind<EntityGroups, &EntityGroups::onEntityDestroyed>(this);\n\t}\n\n\tm_universe = universe;\n\tm_group_infos.clear();\n\tm_groups.clear();\n\tm_groups.emplace(m_allocator);\n\tauto& info = m_group_infos.emplace();\n\tcopyString(info.name, \"default\");\n\n\tif (m_universe)\n\t{\n\t\tm_universe->entityCreated().bind<EntityGroups, &EntityGroups::onEntityCreated>(this);\n\t\tm_universe->entityDestroyed().bind<EntityGroups, &EntityGroups::onEntityDestroyed>(this);\n\t}\n}\n\n\nint EntityGroups::getGroupEntitiesCount(int idx) const\n{\n\treturn m_groups[idx].size();\n}\n\n\nvoid EntityGroups::onEntityCreated(Entity entity)\n{\n\tm_groups[0].push(entity);\n\tif (entity >= m_entity_to_group_map.size()) m_entity_to_group_map.resize(entity + 1);\n\tm_entity_to_group_map[entity] = 0;\n}\n\n\nvoid EntityGroups::onEntityDestroyed(Entity entity)\n{\n\tremoveFromGroup(entity);\n\tm_entity_to_group_map[entity] = -1;\n}\n\n\nvoid EntityGroups::setGroup(Entity entity, int group)\n{\n\tremoveFromGroup(entity);\n\tm_groups[group].push(entity);\n\tm_entity_to_group_map[entity] = group;\n}\n\n\nvoid EntityGroups::removeFromGroup(Entity entity)\n{\n\tm_groups[m_entity_to_group_map[entity]].eraseItemFast(entity);\n\tm_entity_to_group_map[entity] = -1;\n}\n\n\nvoid EntityGroups::serialize(OutputBlob& blob)\n{\n\tASSERT(sizeof(m_group_infos[0]) == 20);\n\n\tblob.write(m_group_infos.size());\n\tblob.write(&m_group_infos[0], m_group_infos.size() * sizeof(m_group_infos[0]));\n\n\tfor(auto& i : m_groups)\n\t{\n\t\tblob.write(i.size());\n\t\tif(!i.empty()) blob.write(&i[0], i.size() * sizeof(i[0]));\n\t}\n}\n\n\nvoid EntityGroups::deserialize(InputBlob& blob)\n{\n\tint count;\n\tblob.read(count);\n\tm_group_infos.resize(count);\n\tfor (int i = 0; i < count; ++i)\n\t{\n\t\tblob.read(m_group_infos[i].name, sizeof(m_group_infos[i].name));\n\t\tm_group_infos[i].frozen = false;\n\t}\n\n\tm_groups.clear();\n\tint entity_count = 0;\n\tfor(int i = 0; i < count; ++i)\n\t{\n\t\tint group_size;\n\t\tauto& group = m_groups.emplace(m_allocator);\n\t\tblob.read(group_size);\n\t\tentity_count += group_size;\n\t\tgroup.resize(group_size);\n\t\tif(group_size > 0) blob.read(&group[0], group_size * sizeof(group[0]));\n\t}\n\tm_entity_to_group_map.resize(entity_count);\n\tfor (int i = 0; i < m_groups.size(); ++i)\n\t{\n\t\tfor (auto e : m_groups[i])\n\t\t{\n\t\t\tif (e >= m_entity_to_group_map.size()) m_entity_to_group_map.resize(e + 1);\n\t\t\tm_entity_to_group_map[e] = i;\n\t\t}\n\t}\n}\n\n\nconst Entity* EntityGroups::getGroupEntities(int idx) const\n{\n\treturn &m_groups[idx][0];\n}\n\n\nint EntityGroups::getGroupCount() const\n{\n\treturn m_groups.size();\n}\n\n\nconst char* EntityGroups::getGroupName(int idx) const\n{\n\treturn m_group_infos[idx].name;\n}\n\n\nvoid EntityGroups::setGroupName(int idx, const char* name)\n{\n\tcopyString(m_group_infos[idx].name, name);\n}\n} \/\/ namespace Lumix\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2003-2010 Sony Pictures Imageworks Inc., et al.\nAll Rights Reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\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 Sony Pictures Imageworks 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.\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\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(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 <cstdio>\n#include <iostream>\n#include <iterator>\n\n#include <OpenColorIO\/OpenColorIO.h>\n\n#include \"FileTransform.h\"\n#include \"Lut1DOp.h\"\n#include \"Lut3DOp.h\"\n#include \"ParseUtils.h\"\n#include \"pystring\/pystring.h\"\n\nOCIO_NAMESPACE_ENTER\n{\n    namespace\n    {\n        class LocalCachedFile : public CachedFile\n        {\n        public:\n            LocalCachedFile () : \n                has1D(false)\n            {\n                lut1D = OCIO_SHARED_PTR<Lut1D>(new Lut1D());\n                lut3D = OCIO_SHARED_PTR<Lut3D>(new Lut3D());\n            };\n            ~LocalCachedFile() {};\n            \n            bool has1D;\n            OCIO_SHARED_PTR<Lut1D> lut1D;\n            OCIO_SHARED_PTR<Lut3D> lut3D;\n        };\n        \n        typedef OCIO_SHARED_PTR<LocalCachedFile> LocalCachedFileRcPtr;\n        \n        \n        \n        class LocalFileFormat : public FileFormat\n        {\n        public:\n            \n            ~LocalFileFormat() {};\n            \n            virtual std::string GetExtension () const;\n            \n            virtual CachedFileRcPtr Load (std::istream & istream) const;\n            \n            virtual void BuildFileOps(OpRcPtrVec & ops,\n                         CachedFileRcPtr untypedCachedFile,\n                         const FileTransform& fileTransform,\n                         TransformDirection dir) const;\n        };\n        \n        \n        \/\/ read the next non empty line\n        \/\/ return whether it has succeeded or not.\n        \n        static bool\n        nextline (std::istream &istream, std::string &line)\n        {\n            while ( istream.good() )\n            {\n                std::getline(istream, line);\n                line = pystring::rstrip( line );\n                if(!line.empty())\n                {\n                    return true;\n                }\n            }\n            \n            return false;\n        }\n        \n        std::string\n        LocalFileFormat::GetExtension() const { return \"cub\"; }\n        \n        CachedFileRcPtr\n        LocalFileFormat::Load(std::istream & istream) const\n        {\n            \/\/ this shouldn't happen\n            if(!istream)\n            {\n                throw Exception (\"File stream empty when trying to read cub lut\");\n            }\n            \n            \/\/ Validate the file type\n            std::string line;\n            if(!nextline(istream, line) || \n               !pystring::startswith(pystring::lower(line), \"# truelight cube\"))\n            {\n                throw Exception(\"Lut doesn't seem to be a truelight cube lut.\");\n            }\n            \n            \/\/ Parse the file\n            std::vector<float> raw1d;\n            std::vector<float> raw3d;\n            int size3d[] = { 0, 0, 0 };\n            int size1d = 0;\n            {\n                std::vector<std::string> parts;\n                std::vector<float> tmpfloats;\n                \n                bool in1d = false;\n                bool in3d = false;\n                \n                while(nextline(istream, line))\n                {\n                    \/\/ Strip, lowercase, and split the line\n                    pystring::split(pystring::lower(pystring::strip(line)), parts);\n                    \n                    if(parts.empty()) continue;\n                    \n                    if(pystring::startswith(parts[0],\"#\"))\n                    {\n                        if(parts.size() < 2) continue;\n                        \n                        if(parts[1] == \"width\")\n                        {\n                            if(parts.size() != 5 || \n                               !StringToInt( &size3d[0], parts[2].c_str()) ||\n                               !StringToInt( &size3d[1], parts[3].c_str()) ||\n                               !StringToInt( &size3d[2], parts[4].c_str()))\n                            {\n                                throw Exception(\"Malformed width tag in truelight cube lut.\");\n                            }\n                            \n                            raw3d.reserve(3*size3d[0]*size3d[1]*size3d[2]);\n                        }\n                        else if(parts[1] == \"lutlength\")\n                        {\n                            if(parts.size() != 3 || \n                               !StringToInt( &size1d, parts[2].c_str()))\n                            {\n                                throw Exception(\"Malformed lutlength tag in truelight cube lut.\");\n                            }\n                            raw1d.reserve(3*size1d);\n                        }\n                        else if(parts[1] == \"inputlut\")\n                        {\n                            in1d = true;\n                            in3d = false;\n                        }\n                        else if(parts[1] == \"cube\")\n                        {\n                            in3d = true;\n                            in1d = false;\n                        }\n                    }\n                    \n                    if(StringVecToFloatVec(tmpfloats, parts) && (tmpfloats.size() == 3))\n                    {\n                        if(in1d)\n                        {\n                            raw1d.push_back(tmpfloats[0]);\n                            raw1d.push_back(tmpfloats[1]);\n                            raw1d.push_back(tmpfloats[2]);\n                        }\n                        else if(in3d)\n                        {\n                            raw3d.push_back(tmpfloats[0]);\n                            raw3d.push_back(tmpfloats[1]);\n                            raw3d.push_back(tmpfloats[2]);\n                        }\n                        else\n                        {\n                            throw Exception(\"Parse error in truelight cube lut. Numbers outside of lut block.\");\n                        }\n                    }\n                }\n            }\n            \n            \/\/ Interpret the parsed data, validate lut sizes\n            \n            if(size1d != static_cast<int>(raw1d.size()\/3))\n            {\n                std::ostringstream os;\n                os << \"Parse error in truelight cube lut. \";\n                os << \"Incorrect number of lut1d entries. \";\n                os << \"Found \" << raw1d.size()\/3 << \", expected \" << size1d << \".\";\n                throw Exception(os.str().c_str());\n            }\n            \n            if(size3d[0]*size3d[1]*size3d[2] != static_cast<int>(raw3d.size()\/3))\n            {\n                std::ostringstream os;\n                os << \"Parse error in truelight cube lut. \";\n                os << \"Incorrect number of lut3d entries. \";\n                os << \"Found \" << raw3d.size()\/3 << \", expected \" << size3d[0]*size3d[1]*size3d[2] << \".\";\n                throw Exception(os.str().c_str());\n            }\n            \n            if(size3d[0]*size3d[1]*size3d[2] == 0)\n            {\n                std::ostringstream os;\n                os << \"Parse error in truelight cube lut. \";\n                os << \"No 3D Lut entries found.\";\n                throw Exception(os.str().c_str());\n            }\n            \n            \n            LocalCachedFileRcPtr cachedFile = LocalCachedFileRcPtr(new LocalCachedFile());\n            \n            \/\/ Reformat 1D data\n            if(size1d>0)\n            {\n                cachedFile->has1D = true;\n                \n                for(int channel=0; channel<3; ++channel)\n                {\n                    float descale = 1.0f \/ static_cast<float>(size3d[channel]);\n                    cachedFile->lut1D->luts[channel].resize(size1d);\n                    for(int i=0; i<size1d; ++i)\n                    {\n                        cachedFile->lut1D->luts[channel][i] = raw1d[3*i+channel] * descale;\n                    }\n                }\n                \n                \/\/ 1e-5 rel error is a good threshold when float numbers near 0\n                \/\/ are written out with 6 decimal places of precision.  This is\n                \/\/ a bit aggressive, I.e., changes in the 6th decimal place will\n                \/\/ be considered roundoff error, but changes in the 5th decimal\n                \/\/ will be considered lut 'intent'.\n                \/\/ 1.0\n                \/\/ 1.000005 equal to 1.0\n                \/\/ 1.000007 equal to 1.0\n                \/\/ 1.000010 not equal\n                \/\/ 0.0\n                \/\/ 0.000001 not equal\n                \n                cachedFile->lut1D->finalize(1e-5f);\n            }\n            \n            \/\/ Reformat 3D data\n            cachedFile->lut3D->size[0] = size3d[0];\n            cachedFile->lut3D->size[1] = size3d[1];\n            cachedFile->lut3D->size[2] = size3d[2];\n            cachedFile->lut3D->lut = raw3d;\n            cachedFile->lut3D->generateCacheID();\n            \n            return cachedFile;\n        }\n        \n        void\n        LocalFileFormat::BuildFileOps(OpRcPtrVec & ops,\n                                      CachedFileRcPtr untypedCachedFile,\n                                      const FileTransform& fileTransform,\n                                      TransformDirection dir) const\n        {\n            LocalCachedFileRcPtr cachedFile = DynamicPtrCast<LocalCachedFile>(untypedCachedFile);\n            \n            \/\/ This should never happen.\n            if(!cachedFile)\n            {\n                std::ostringstream os;\n                os << \"Cannot build CSP Op. Invalid cache type.\";\n                throw Exception(os.str().c_str());\n            }\n            \n            TransformDirection newDir = CombineTransformDirections(dir,\n                fileTransform.getDirection());\n            if(newDir == TRANSFORM_DIR_UNKNOWN)\n            {\n                std::ostringstream os;\n                os << \"Cannot build file format transform,\";\n                os << \" unspecified transform direction.\";\n                throw Exception(os.str().c_str());\n            }\n            \n            \/\/ TODO: INTERP_LINEAR should not be hard-coded.\n            \/\/ Instead query 'highest' interpolation?\n            \/\/ (right now, it's linear). If cubic is added, consider\n            \/\/ using it\n            \n            if(newDir == TRANSFORM_DIR_FORWARD)\n            {\n                if(cachedFile->has1D)\n                {\n                    CreateLut1DOp(ops, cachedFile->lut1D,\n                                  INTERP_LINEAR, newDir);\n                }\n                \n                CreateLut3DOp(ops, cachedFile->lut3D,\n                              fileTransform.getInterpolation(), newDir);\n            }\n            else if(newDir == TRANSFORM_DIR_INVERSE)\n            {\n                CreateLut3DOp(ops, cachedFile->lut3D,\n                              fileTransform.getInterpolation(), newDir);\n                \n                if(cachedFile->has1D)\n                {\n                    CreateLut1DOp(ops, cachedFile->lut1D,\n                                  INTERP_LINEAR, newDir);\n                }\n            }\n        }\n    }\n    \n    struct AutoRegister\n    {\n        AutoRegister() { RegisterFileFormat(new LocalFileFormat); }\n    };\n    static AutoRegister registerIt;\n}\nOCIO_NAMESPACE_EXIT\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifdef OCIO_UNIT_TEST\n\nnamespace OCIO = OCIO_NAMESPACE;\n#include \"UnitTest.h\"\n\nBOOST_AUTO_TEST_SUITE( FileFormatTruelight_Unit_Tests )\n\nBOOST_AUTO_TEST_CASE ( test_simple3D )\n{\n    \/\/ This lowers the red channel by 0.5, other channels are unaffected.\n    const char * luttext = \"# Truelight Cube v2.0\\n\"\n       \"# iDims 3\\n\"\n       \"# oDims 3\\n\"\n       \"# width 3 3 3\\n\"\n       \"# lutLength 4\\n\"\n       \"# InputLUT\\n\"\n       \"0.000000 0.000000 0.000000\\n\"\n       \"1.000000 1.000000 1.000000\\n\"\n       \"2.000000 2.000000 2.000000\\n\"\n       \"3.000000 3.000000 3.000000\\n\"\n       \"\\n\"\n       \"# Cube\\n\"\n       \"0.000000 0.000000 0.000000\\n\"\n       \"0.250000 0.000000 0.000000\\n\"\n       \"0.500000 0.000000 0.000000\\n\"\n       \"0.000000 0.500000 0.000000\\n\"\n       \"0.250000 0.500000 0.000000\\n\"\n       \"0.500000 0.500000 0.000000\\n\"\n       \"0.000000 1.000000 0.000000\\n\"\n       \"0.250000 1.000000 0.000000\\n\"\n       \"0.500000 1.000000 0.000000\\n\"\n       \"0.000000 0.000000 0.500000\\n\"\n       \"0.250000 0.000000 0.500000\\n\"\n       \"0.500000 0.000000 0.500000\\n\"\n       \"0.000000 0.500000 0.500000\\n\"\n       \"0.250000 0.500000 0.500000\\n\"\n       \"0.500000 0.500000 0.500000\\n\"\n       \"0.000000 1.000000 0.500000\\n\"\n       \"0.250000 1.000000 0.500000\\n\"\n       \"0.500000 1.000000 0.500000\\n\"\n       \"0.000000 0.000000 1.000000\\n\"\n       \"0.250000 0.000000 1.000000\\n\"\n       \"0.500000 0.000000 1.000000\\n\"\n       \"0.000000 0.500000 1.000000\\n\"\n       \"0.250000 0.500000 1.000000\\n\"\n       \"0.500000 0.500000 1.000000\\n\"\n       \"0.000000 1.000000 1.000000\\n\"\n       \"0.250000 1.000000 1.000000\\n\"\n       \"0.500000 1.000000 1.000000\\n\";\n    \n    std::istringstream simple3D;\n    simple3D.str(luttext);\n    \n    \/\/ Load file\n    OCIO::LocalFileFormat tester;\n    OCIO::CachedFileRcPtr cachedFile = tester.Load(simple3D);\n    OCIO::LocalCachedFileRcPtr csplut = OCIO::DynamicPtrCast<OCIO::LocalCachedFile>(cachedFile);\n    \n    \/\/ TODO: Test the results of truelight loading.\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n#endif \/\/ OCIO_UNIT_TEST\n<commit_msg>updated Truelight fileformat error text<commit_after>\/*\nCopyright (c) 2003-2010 Sony Pictures Imageworks Inc., et al.\nAll Rights Reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\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 Sony Pictures Imageworks 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.\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\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(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 <cstdio>\n#include <iostream>\n#include <iterator>\n\n#include <OpenColorIO\/OpenColorIO.h>\n\n#include \"FileTransform.h\"\n#include \"Lut1DOp.h\"\n#include \"Lut3DOp.h\"\n#include \"ParseUtils.h\"\n#include \"pystring\/pystring.h\"\n\nOCIO_NAMESPACE_ENTER\n{\n    namespace\n    {\n        class LocalCachedFile : public CachedFile\n        {\n        public:\n            LocalCachedFile () : \n                has1D(false)\n            {\n                lut1D = OCIO_SHARED_PTR<Lut1D>(new Lut1D());\n                lut3D = OCIO_SHARED_PTR<Lut3D>(new Lut3D());\n            };\n            ~LocalCachedFile() {};\n            \n            bool has1D;\n            OCIO_SHARED_PTR<Lut1D> lut1D;\n            OCIO_SHARED_PTR<Lut3D> lut3D;\n        };\n        \n        typedef OCIO_SHARED_PTR<LocalCachedFile> LocalCachedFileRcPtr;\n        \n        \n        \n        class LocalFileFormat : public FileFormat\n        {\n        public:\n            \n            ~LocalFileFormat() {};\n            \n            virtual std::string GetExtension () const;\n            \n            virtual CachedFileRcPtr Load (std::istream & istream) const;\n            \n            virtual void BuildFileOps(OpRcPtrVec & ops,\n                         CachedFileRcPtr untypedCachedFile,\n                         const FileTransform& fileTransform,\n                         TransformDirection dir) const;\n        };\n        \n        \n        \/\/ read the next non empty line\n        \/\/ return whether it has succeeded or not.\n        \n        static bool\n        nextline (std::istream &istream, std::string &line)\n        {\n            while ( istream.good() )\n            {\n                std::getline(istream, line);\n                line = pystring::rstrip( line );\n                if(!line.empty())\n                {\n                    return true;\n                }\n            }\n            \n            return false;\n        }\n        \n        std::string\n        LocalFileFormat::GetExtension() const { return \"cub\"; }\n        \n        CachedFileRcPtr\n        LocalFileFormat::Load(std::istream & istream) const\n        {\n            \/\/ this shouldn't happen\n            if(!istream)\n            {\n                throw Exception (\"File stream empty when trying to read Truelight .cub lut\");\n            }\n            \n            \/\/ Validate the file type\n            std::string line;\n            if(!nextline(istream, line) || \n               !pystring::startswith(pystring::lower(line), \"# truelight cube\"))\n            {\n                throw Exception(\"Lut doesn't seem to be a Truelight .cub lut.\");\n            }\n            \n            \/\/ Parse the file\n            std::vector<float> raw1d;\n            std::vector<float> raw3d;\n            int size3d[] = { 0, 0, 0 };\n            int size1d = 0;\n            {\n                std::vector<std::string> parts;\n                std::vector<float> tmpfloats;\n                \n                bool in1d = false;\n                bool in3d = false;\n                \n                while(nextline(istream, line))\n                {\n                    \/\/ Strip, lowercase, and split the line\n                    pystring::split(pystring::lower(pystring::strip(line)), parts);\n                    \n                    if(parts.empty()) continue;\n                    \n                    if(pystring::startswith(parts[0],\"#\"))\n                    {\n                        if(parts.size() < 2) continue;\n                        \n                        if(parts[1] == \"width\")\n                        {\n                            if(parts.size() != 5 || \n                               !StringToInt( &size3d[0], parts[2].c_str()) ||\n                               !StringToInt( &size3d[1], parts[3].c_str()) ||\n                               !StringToInt( &size3d[2], parts[4].c_str()))\n                            {\n                                throw Exception(\"Malformed width tag in Truelight .cub lut.\");\n                            }\n                            \n                            raw3d.reserve(3*size3d[0]*size3d[1]*size3d[2]);\n                        }\n                        else if(parts[1] == \"lutlength\")\n                        {\n                            if(parts.size() != 3 || \n                               !StringToInt( &size1d, parts[2].c_str()))\n                            {\n                                throw Exception(\"Malformed lutlength tag in Truelight .cub lut.\");\n                            }\n                            raw1d.reserve(3*size1d);\n                        }\n                        else if(parts[1] == \"inputlut\")\n                        {\n                            in1d = true;\n                            in3d = false;\n                        }\n                        else if(parts[1] == \"cube\")\n                        {\n                            in3d = true;\n                            in1d = false;\n                        }\n                    }\n                    \n                    if(StringVecToFloatVec(tmpfloats, parts) && (tmpfloats.size() == 3))\n                    {\n                        if(in1d)\n                        {\n                            raw1d.push_back(tmpfloats[0]);\n                            raw1d.push_back(tmpfloats[1]);\n                            raw1d.push_back(tmpfloats[2]);\n                        }\n                        else if(in3d)\n                        {\n                            raw3d.push_back(tmpfloats[0]);\n                            raw3d.push_back(tmpfloats[1]);\n                            raw3d.push_back(tmpfloats[2]);\n                        }\n                        else\n                        {\n                            throw Exception(\"Parse error in Truelight .cub lut. Numbers outside of lut block.\");\n                        }\n                    }\n                }\n            }\n            \n            \/\/ Interpret the parsed data, validate lut sizes\n            \n            if(size1d != static_cast<int>(raw1d.size()\/3))\n            {\n                std::ostringstream os;\n                os << \"Parse error in Truelight .cub lut. \";\n                os << \"Incorrect number of lut1d entries. \";\n                os << \"Found \" << raw1d.size()\/3 << \", expected \" << size1d << \".\";\n                throw Exception(os.str().c_str());\n            }\n            \n            if(size3d[0]*size3d[1]*size3d[2] != static_cast<int>(raw3d.size()\/3))\n            {\n                std::ostringstream os;\n                os << \"Parse error in Truelight .cub lut. \";\n                os << \"Incorrect number of lut3d entries. \";\n                os << \"Found \" << raw3d.size()\/3 << \", expected \" << size3d[0]*size3d[1]*size3d[2] << \".\";\n                throw Exception(os.str().c_str());\n            }\n            \n            if(size3d[0]*size3d[1]*size3d[2] == 0)\n            {\n                std::ostringstream os;\n                os << \"Parse error in Truelight .cub lut. \";\n                os << \"No 3D Lut entries found.\";\n                throw Exception(os.str().c_str());\n            }\n            \n            \n            LocalCachedFileRcPtr cachedFile = LocalCachedFileRcPtr(new LocalCachedFile());\n            \n            \/\/ Reformat 1D data\n            if(size1d>0)\n            {\n                cachedFile->has1D = true;\n                \n                for(int channel=0; channel<3; ++channel)\n                {\n                    float descale = 1.0f \/ static_cast<float>(size3d[channel]);\n                    cachedFile->lut1D->luts[channel].resize(size1d);\n                    for(int i=0; i<size1d; ++i)\n                    {\n                        cachedFile->lut1D->luts[channel][i] = raw1d[3*i+channel] * descale;\n                    }\n                }\n                \n                \/\/ 1e-5 rel error is a good threshold when float numbers near 0\n                \/\/ are written out with 6 decimal places of precision.  This is\n                \/\/ a bit aggressive, I.e., changes in the 6th decimal place will\n                \/\/ be considered roundoff error, but changes in the 5th decimal\n                \/\/ will be considered lut 'intent'.\n                \/\/ 1.0\n                \/\/ 1.000005 equal to 1.0\n                \/\/ 1.000007 equal to 1.0\n                \/\/ 1.000010 not equal\n                \/\/ 0.0\n                \/\/ 0.000001 not equal\n                \n                cachedFile->lut1D->finalize(1e-5f);\n            }\n            \n            \/\/ Reformat 3D data\n            cachedFile->lut3D->size[0] = size3d[0];\n            cachedFile->lut3D->size[1] = size3d[1];\n            cachedFile->lut3D->size[2] = size3d[2];\n            cachedFile->lut3D->lut = raw3d;\n            cachedFile->lut3D->generateCacheID();\n            \n            return cachedFile;\n        }\n        \n        void\n        LocalFileFormat::BuildFileOps(OpRcPtrVec & ops,\n                                      CachedFileRcPtr untypedCachedFile,\n                                      const FileTransform& fileTransform,\n                                      TransformDirection dir) const\n        {\n            LocalCachedFileRcPtr cachedFile = DynamicPtrCast<LocalCachedFile>(untypedCachedFile);\n            \n            \/\/ This should never happen.\n            if(!cachedFile)\n            {\n                std::ostringstream os;\n                os << \"Cannot build Truelight .cub Op. Invalid cache type.\";\n                throw Exception(os.str().c_str());\n            }\n            \n            TransformDirection newDir = CombineTransformDirections(dir,\n                fileTransform.getDirection());\n            if(newDir == TRANSFORM_DIR_UNKNOWN)\n            {\n                std::ostringstream os;\n                os << \"Cannot build file format transform,\";\n                os << \" unspecified transform direction.\";\n                throw Exception(os.str().c_str());\n            }\n            \n            \/\/ TODO: INTERP_LINEAR should not be hard-coded.\n            \/\/ Instead query 'highest' interpolation?\n            \/\/ (right now, it's linear). If cubic is added, consider\n            \/\/ using it\n            \n            if(newDir == TRANSFORM_DIR_FORWARD)\n            {\n                if(cachedFile->has1D)\n                {\n                    CreateLut1DOp(ops, cachedFile->lut1D,\n                                  INTERP_LINEAR, newDir);\n                }\n                \n                CreateLut3DOp(ops, cachedFile->lut3D,\n                              fileTransform.getInterpolation(), newDir);\n            }\n            else if(newDir == TRANSFORM_DIR_INVERSE)\n            {\n                CreateLut3DOp(ops, cachedFile->lut3D,\n                              fileTransform.getInterpolation(), newDir);\n                \n                if(cachedFile->has1D)\n                {\n                    CreateLut1DOp(ops, cachedFile->lut1D,\n                                  INTERP_LINEAR, newDir);\n                }\n            }\n        }\n    }\n    \n    struct AutoRegister\n    {\n        AutoRegister() { RegisterFileFormat(new LocalFileFormat); }\n    };\n    static AutoRegister registerIt;\n}\nOCIO_NAMESPACE_EXIT\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifdef OCIO_UNIT_TEST\n\nnamespace OCIO = OCIO_NAMESPACE;\n#include \"UnitTest.h\"\n\nBOOST_AUTO_TEST_SUITE( FileFormatTruelight_Unit_Tests )\n\nBOOST_AUTO_TEST_CASE ( test_simple3D )\n{\n    \/\/ This lowers the red channel by 0.5, other channels are unaffected.\n    const char * luttext = \"# Truelight Cube v2.0\\n\"\n       \"# iDims 3\\n\"\n       \"# oDims 3\\n\"\n       \"# width 3 3 3\\n\"\n       \"# lutLength 4\\n\"\n       \"# InputLUT\\n\"\n       \"0.000000 0.000000 0.000000\\n\"\n       \"1.000000 1.000000 1.000000\\n\"\n       \"2.000000 2.000000 2.000000\\n\"\n       \"3.000000 3.000000 3.000000\\n\"\n       \"\\n\"\n       \"# Cube\\n\"\n       \"0.000000 0.000000 0.000000\\n\"\n       \"0.250000 0.000000 0.000000\\n\"\n       \"0.500000 0.000000 0.000000\\n\"\n       \"0.000000 0.500000 0.000000\\n\"\n       \"0.250000 0.500000 0.000000\\n\"\n       \"0.500000 0.500000 0.000000\\n\"\n       \"0.000000 1.000000 0.000000\\n\"\n       \"0.250000 1.000000 0.000000\\n\"\n       \"0.500000 1.000000 0.000000\\n\"\n       \"0.000000 0.000000 0.500000\\n\"\n       \"0.250000 0.000000 0.500000\\n\"\n       \"0.500000 0.000000 0.500000\\n\"\n       \"0.000000 0.500000 0.500000\\n\"\n       \"0.250000 0.500000 0.500000\\n\"\n       \"0.500000 0.500000 0.500000\\n\"\n       \"0.000000 1.000000 0.500000\\n\"\n       \"0.250000 1.000000 0.500000\\n\"\n       \"0.500000 1.000000 0.500000\\n\"\n       \"0.000000 0.000000 1.000000\\n\"\n       \"0.250000 0.000000 1.000000\\n\"\n       \"0.500000 0.000000 1.000000\\n\"\n       \"0.000000 0.500000 1.000000\\n\"\n       \"0.250000 0.500000 1.000000\\n\"\n       \"0.500000 0.500000 1.000000\\n\"\n       \"0.000000 1.000000 1.000000\\n\"\n       \"0.250000 1.000000 1.000000\\n\"\n       \"0.500000 1.000000 1.000000\\n\";\n    \n    std::istringstream simple3D;\n    simple3D.str(luttext);\n    \n    \/\/ Load file\n    OCIO::LocalFileFormat tester;\n    OCIO::CachedFileRcPtr cachedFile = tester.Load(simple3D);\n    OCIO::LocalCachedFileRcPtr csplut = OCIO::DynamicPtrCast<OCIO::LocalCachedFile>(cachedFile);\n    \n    \/\/ TODO: Test the results of truelight loading.\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n#endif \/\/ OCIO_UNIT_TEST\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\/dimm\/rcd_load.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 rcd_load.C\n\/\/\/ @brief Run and manage the RCD_LOAD engine\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 <mss.H>\n#include <lib\/dimm\/rcd_load.H>\n#include <lib\/dimm\/rcd_load_ddr4.H>\n\nusing fapi2::TARGET_TYPE_MCBIST;\nusing fapi2::TARGET_TYPE_MCA;\nusing fapi2::TARGET_TYPE_MCS;\nusing fapi2::TARGET_TYPE_DIMM;\n\nusing fapi2::FAPI2_RC_SUCCESS;\n\nnamespace mss\n{\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - TARGET_TYPE_MCBIST specialization\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_MCBIST>\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode rcd_load<TARGET_TYPE_MCBIST>( const fapi2::Target<TARGET_TYPE_MCBIST>& i_target )\n{\n    \/\/ A vector of CCS instructions. We'll ask the targets to fill it, and then we'll execute it\n    ccs::program<TARGET_TYPE_MCBIST> l_program;\n\n    \/\/ Clear the initial delays. This will force the CCS engine to recompute the delay based on the\n    \/\/ instructions in the CCS instruction vector\n    l_program.iv_poll.iv_initial_delay = 0;\n    l_program.iv_poll.iv_initial_sim_delay = 0;\n\n    for (auto c : i_target.getChildren<TARGET_TYPE_MCS>())\n    {\n        for (auto p : c.getChildren<TARGET_TYPE_MCA>())\n        {\n            for (auto d : p.getChildren<TARGET_TYPE_DIMM>())\n            {\n                FAPI_DBG(\"rcd load for %s\", mss::c_str(d));\n                FAPI_TRY( perform_rcd_load(d, l_program.iv_instructions) );\n            }\n\n            \/\/ We have to configure the CCS engine to let it know which port these instructions are\n            \/\/ going out (or whether it's broadcast ...) so lets execute the instructions we presently\n            \/\/ have so that we kind of do this by port\n            FAPI_TRY( ccs::execute(i_target, l_program, p) );\n        }\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - unknown DIMM case\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] a vector of CCS instructions we should add to (unused)\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode perform_rcd_load<DEFAULT_KIND>( const fapi2::Target<TARGET_TYPE_DIMM>& i_target,\n        std::vector< ccs::instruction_t<TARGET_TYPE_MCBIST> >& i_inst)\n{\n    uint8_t l_type = 0;\n    uint8_t l_gen = 0;\n\n    FAPI_TRY( mss::eff_dimm_type(i_target, l_type) );\n    FAPI_TRY( mss::eff_dram_gen(i_target, l_gen) );\n\n    \/\/ If we're here, we have a problem. The DIMM kind (type and\/or generation) wasn't know\n    \/\/ to our dispatcher. We have a DIMM plugged in we don't know how to deal with.\n    FAPI_ASSERT(false,\n                fapi2::MSS_UNKNOWN_DIMM()\n                .set_DIMM_TYPE(l_type)\n                .set_DRAM_GEN(l_gen)\n                .set_DIMM_IN_ERROR(i_target),\n                \"Unable to perform rcd load on %s: unknown type (%d) or generation (%d)\",\n                mss::c_str(i_target), l_type, l_gen);\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - RDIMM DDR4\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode perform_rcd_load<KIND_RDIMM_DDR4>( const fapi2::Target<TARGET_TYPE_DIMM>& i_target,\n        std::vector< ccs::instruction_t<TARGET_TYPE_MCBIST> >& i_inst)\n{\n    FAPI_DBG(\"perform rcd_load for %s [expecting rdimm (ddr4)]\", mss::c_str(i_target));\n    FAPI_TRY( rcd_load_ddr4(i_target, i_inst) );\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - LRDIMM DDR4\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode perform_rcd_load<KIND_LRDIMM_DDR4>( const fapi2::Target<TARGET_TYPE_DIMM>& i_target,\n        std::vector< ccs::instruction_t<TARGET_TYPE_MCBIST> >& i_inst)\n{\n    FAPI_DBG(\"perform rcd_load for %s [expecting lrdimm (ddr4)]\", mss::c_str(i_target));\n    FAPI_TRY( rcd_load_ddr4(i_target, i_inst) );\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - start the dispatcher\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode perform_rcd_load<FORCE_DISPATCH>( const fapi2::Target<TARGET_TYPE_DIMM>& i_target,\n        std::vector< ccs::instruction_t<TARGET_TYPE_MCBIST> >& i_inst)\n{\n    uint8_t l_type = 0;\n    uint8_t l_gen = 0;\n\n    FAPI_TRY( mss::eff_dimm_type(i_target, l_type) );\n    FAPI_TRY( mss::eff_dram_gen(i_target, l_gen) );\n\n    return perform_rcd_load_dispatch<FORCE_DISPATCH>(dimm_kind( l_type, l_gen ), i_target, i_inst);\n\nfapi_try_exit:\n    FAPI_ERR(\"couldn't get dimm type, dram gen: %s\", mss::c_str(i_target));\n    return fapi2::current_err;\n}\n\n} \/\/ namespace\n<commit_msg>L3 draminit and mss_lib<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/dimm\/rcd_load.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 rcd_load.C\n\/\/\/ @brief Run and manage the RCD_LOAD engine\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\n#include <mss.H>\n#include <lib\/dimm\/rcd_load.H>\n#include <lib\/dimm\/rcd_load_ddr4.H>\n#include <generic\/memory\/lib\/utils\/find.H>\n\nusing fapi2::TARGET_TYPE_MCBIST;\nusing fapi2::TARGET_TYPE_MCA;\nusing fapi2::TARGET_TYPE_MCS;\nusing fapi2::TARGET_TYPE_DIMM;\n\nusing fapi2::FAPI2_RC_SUCCESS;\n\nnamespace mss\n{\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - TARGET_TYPE_MCBIST specialization\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_MCBIST>\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode rcd_load<TARGET_TYPE_MCBIST>( const fapi2::Target<TARGET_TYPE_MCBIST>& i_target )\n{\n    \/\/ A vector of CCS instructions. We'll ask the targets to fill it, and then we'll execute it\n    ccs::program<TARGET_TYPE_MCBIST> l_program;\n\n    \/\/ Clear the initial delays. This will force the CCS engine to recompute the delay based on the\n    \/\/ instructions in the CCS instruction vector\n    l_program.iv_poll.iv_initial_delay = 0;\n    l_program.iv_poll.iv_initial_sim_delay = 0;\n\n    for (const auto& p : find_targets<TARGET_TYPE_MCA>(i_target))\n    {\n        for (const auto& d : find_targets<TARGET_TYPE_DIMM>(p))\n        {\n            FAPI_DBG(\"rcd load for %s\", mss::c_str(d));\n            FAPI_TRY( perform_rcd_load(d, l_program.iv_instructions) );\n        }\n\n        \/\/ We have to configure the CCS engine to let it know which port these instructions are\n        \/\/ going out (or whether it's broadcast ...) so lets execute the instructions we presently\n        \/\/ have so that we kind of do this by port\n        FAPI_TRY( ccs::execute(i_target, l_program, p) );\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - unknown DIMM case\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] a vector of CCS instructions we should add to (unused)\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode perform_rcd_load<DEFAULT_KIND>( const fapi2::Target<TARGET_TYPE_DIMM>& i_target,\n        std::vector< ccs::instruction_t<TARGET_TYPE_MCBIST> >& i_inst)\n{\n    uint8_t l_type = 0;\n    uint8_t l_gen = 0;\n\n    FAPI_TRY( mss::eff_dimm_type(i_target, l_type) );\n    FAPI_TRY( mss::eff_dram_gen(i_target, l_gen) );\n\n    \/\/ If we're here, we have a problem. The DIMM kind (type and\/or generation) wasn't known\n    \/\/ to our dispatcher. We have a DIMM plugged in we don't know how to deal with.\n    FAPI_ASSERT(false,\n                fapi2::MSS_UNKNOWN_DIMM()\n                .set_DIMM_TYPE(l_type)\n                .set_DRAM_GEN(l_gen)\n                .set_DIMM_IN_ERROR(i_target),\n                \"Unable to perform rcd load on %s: unknown type (%d) or generation (%d)\",\n                mss::c_str(i_target), l_type, l_gen);\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - RDIMM DDR4\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode perform_rcd_load<KIND_RDIMM_DDR4>( const fapi2::Target<TARGET_TYPE_DIMM>& i_target,\n        std::vector< ccs::instruction_t<TARGET_TYPE_MCBIST> >& i_inst)\n{\n    FAPI_DBG(\"perform rcd_load for %s [expecting rdimm (ddr4)]\", mss::c_str(i_target));\n    FAPI_TRY( rcd_load_ddr4(i_target, i_inst) );\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - LRDIMM DDR4\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode perform_rcd_load<KIND_LRDIMM_DDR4>( const fapi2::Target<TARGET_TYPE_DIMM>& i_target,\n        std::vector< ccs::instruction_t<TARGET_TYPE_MCBIST> >& i_inst)\n{\n    FAPI_DBG(\"perform rcd_load for %s [expecting lrdimm (ddr4)]\", mss::c_str(i_target));\n    FAPI_TRY( rcd_load_ddr4(i_target, i_inst) );\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\n\/\/\/\n\/\/\/ @brief Perform the rcd_load operations - start the dispatcher\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode perform_rcd_load<FORCE_DISPATCH>( const fapi2::Target<TARGET_TYPE_DIMM>& i_target,\n        std::vector< ccs::instruction_t<TARGET_TYPE_MCBIST> >& i_inst)\n{\n    uint8_t l_type = 0;\n    uint8_t l_gen = 0;\n\n    FAPI_TRY( mss::eff_dimm_type(i_target, l_type) );\n    FAPI_TRY( mss::eff_dram_gen(i_target, l_gen) );\n\n    return perform_rcd_load_dispatch<FORCE_DISPATCH>(dimm_kind( l_type, l_gen ), i_target, i_inst);\n\nfapi_try_exit:\n    FAPI_ERR(\"couldn't get dimm type, dram gen: %s\", mss::c_str(i_target));\n    return fapi2::current_err;\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\/nest\/p9_mss_eff_grouping.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_mss_eff_grouping.H\n\/\/\/\n\/\/\/ @brief Perform Memory Controller grouping on each processor chip\n\/\/\/\n\/\/\/ The purpose of this procedure is to effectively group the memory on each\n\/\/\/ processor chip based on available memory behind its memory grouping ports.\n\/\/\/ Some placement policy\/scheme and other info that are stored in the\n\/\/\/ attributes are used as part of the grouping process.\n\/\/\/\n\/\/\/ ----------------------------------------------------------------------------\n\/\/\/ *HWP HWP Owner   : Joe McGill <jmcgill@us.ibm.com>\n\/\/\/ *HWP FW Owner    : Thi Tran <thi@us.ibm.com>\n\/\/\/ *HWP Team        : Nest\n\/\/\/ *HWP Level       : 1\n\/\/\/ *HWP Consumed by : HB\n\/\/\/ ----------------------------------------------------------------------------\n\n#ifndef _P9_MSS_EFF_GROUPING_H_\n#define _P9_MSS_EFF_GROUPING_H_\n\n\/\/------------------------------------------------------------------------------\n\/\/ Includes\n\/\/------------------------------------------------------------------------------\n#include <fapi2.H>\n\n\/\/\/----------------------------------------------------------------------------\n\/\/\/ Constant definitions\n\/\/\/----------------------------------------------------------------------------\n\n\/\/ Constants used for EffGroupingData struct\nconst uint8_t DATA_GROUPS   = 16;   \/\/ 8 regular groups, 8 mirrored groups\nconst uint8_t MIRR_OFFSET   = 8;    \/\/ Start of mirrored offset in DATA_GROUPS\nconst uint8_t DATA_ELEMENTS = 18;   \/\/ 18 items of data for each group\n\n\/\/ Indexes used for EffGroupingData::iv_data DATA ELEMENTS\nconst uint8_t PORT_SIZE = 0;         \/\/ Memory size of each port in group (GB)\nconst uint8_t PORTS_IN_GROUP = 1;    \/\/ Number of ports in group\nconst uint8_t GROUP_SIZE = 2;        \/\/ Memory size of entire group (GB)\nconst uint8_t BASE_ADDR = 3;         \/\/ Base Address\n#define MEMBER_IDX(X) ((X) + 4)      \/\/ List of MC ports in group\n#define ALT_VALID(X) ((X) + 12)      \/\/ Alt Memory valid (2 alt memory regions)\n#define ALT_SIZE(X) ((X) + 14)       \/\/ Alt Memory Size\n#define ALT_BASE_ADDR(X) ((X) + 16)  \/\/ Alt Base Address\n\n\/\/ Number of memory regions\nconst uint8_t NUM_NON_MIRROR_REGIONS = 8;\nconst uint8_t NUM_MIRROR_REGIONS = 4;\nconst uint8_t NUM_OF_HTM_REGIONS = 2; \/\/ 2 HTM memory regions\nconst uint8_t NUM_OF_ALT_MEM_REGIONS = 2; \/\/ 2 memory holes\n\n\/\/ ------------------------------------------------------\n\/\/ MC ports\n\/\/ Define the MC ports to be grouped.\n\/\/ For Nimbus, MC port is an MCA (8 MCAs)\n\/\/ For Cumulus, MC port is a DMI (8 DMIs)\n\/\/ -------------------------------------------------------\nconst uint8_t NUM_MC_PORTS_PER_PROC = 8;\nconst uint8_t NUM_DIMMS_PER_DRAM_PORT = 2; \/\/ 2 DIMMs per DRAM port\n\n\/\/\/ Function pointer typedef definition for HWP call support\ntypedef fapi2::ReturnCode (*p9_mss_eff_grouping_FP_t)(\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>&);\n\n\/\/------------------------------------------------------------------------------\n\/\/ Function prototypes\n\/\/------------------------------------------------------------------------------\n\/\/\/\n\/\/\/ @brief p9_mss_eff_grouping procedure\n\/\/\/\n\/\/\/ This HWP is to group the MCs of the input target processor chip based\n\/\/\/ on the amount of memory behind its ports and some policy attribute settings.\n\/\/\/\n\/\/\/ @param[in]    i_target   Reference to TARGET_TYPE_PROC_CHIP target\n\/\/\/\n\/\/\/ @return FAPI2_RC_SUCCESS if success, else error code.\n\/\/\/\nextern \"C\"\n{\n\n    fapi2::ReturnCode p9_mss_eff_grouping(\n        const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target);\n\n} \/\/ extern \"C\"\n\n#endif  \/\/ _P9_MSS_EFF_GROUPING_H_\n<commit_msg>Fix HB build failure and incorrect HWP level lable<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/nest\/p9_mss_eff_grouping.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_mss_eff_grouping.H\n\/\/\/\n\/\/\/ @brief Perform Memory Controller grouping on each processor chip\n\/\/\/\n\/\/\/ The purpose of this procedure is to effectively group the memory on each\n\/\/\/ processor chip based on available memory behind its memory grouping ports.\n\/\/\/ Some placement policy\/scheme and other info that are stored in the\n\/\/\/ attributes are used as part of the grouping process.\n\/\/\/\n\/\/\/ ----------------------------------------------------------------------------\n\/\/\/ *HWP HWP Owner   : Joe McGill <jmcgill@us.ibm.com>\n\/\/\/ *HWP FW Owner    : Thi Tran <thi@us.ibm.com>\n\/\/\/ *HWP Team        : Nest\n\/\/\/ *HWP Level       : 2\n\/\/\/ *HWP Consumed by : HB\n\/\/\/ ----------------------------------------------------------------------------\n\n#ifndef _P9_MSS_EFF_GROUPING_H_\n#define _P9_MSS_EFF_GROUPING_H_\n\n\/\/------------------------------------------------------------------------------\n\/\/ Includes\n\/\/------------------------------------------------------------------------------\n#include <fapi2.H>\n\n\/\/\/----------------------------------------------------------------------------\n\/\/\/ Constant definitions\n\/\/\/----------------------------------------------------------------------------\n\n\/\/ Constants used for EffGroupingData struct\nconst uint8_t DATA_GROUPS   = 16;   \/\/ 8 regular groups, 8 mirrored groups\nconst uint8_t MIRR_OFFSET   = 8;    \/\/ Start of mirrored offset in DATA_GROUPS\nconst uint8_t DATA_ELEMENTS = 18;   \/\/ 18 items of data for each group\n\n\/\/ Indexes used for EffGroupingData::iv_data DATA ELEMENTS\nconst uint8_t PORT_SIZE = 0;         \/\/ Memory size of each port in group (GB)\nconst uint8_t PORTS_IN_GROUP = 1;    \/\/ Number of ports in group\nconst uint8_t GROUP_SIZE = 2;        \/\/ Memory size of entire group (GB)\nconst uint8_t BASE_ADDR = 3;         \/\/ Base Address\n#define MEMBER_IDX(X) ((X) + 4)      \/\/ List of MC ports in group\n#define ALT_VALID(X) ((X) + 12)      \/\/ Alt Memory valid (2 alt memory regions)\n#define ALT_SIZE(X) ((X) + 14)       \/\/ Alt Memory Size\n#define ALT_BASE_ADDR(X) ((X) + 16)  \/\/ Alt Base Address\n\n\/\/ Number of memory regions\nconst uint8_t NUM_NON_MIRROR_REGIONS = 8;\nconst uint8_t NUM_MIRROR_REGIONS = 4;\nconst uint8_t NUM_OF_HTM_REGIONS = 2; \/\/ 2 HTM memory regions\nconst uint8_t NUM_OF_ALT_MEM_REGIONS = 2; \/\/ 2 memory holes\n\n\/\/ ------------------------------------------------------\n\/\/ MC ports\n\/\/ Define the MC ports to be grouped.\n\/\/ For Nimbus, MC port is an MCA (8 MCAs)\n\/\/ For Cumulus, MC port is a DMI (8 DMIs)\n\/\/ -------------------------------------------------------\nconst uint8_t NUM_MC_PORTS_PER_PROC = 8;\nconst uint8_t NUM_DIMMS_PER_DRAM_PORT = 2; \/\/ 2 DIMMs per DRAM port\n\n\/\/\/ Function pointer typedef definition for HWP call support\ntypedef fapi2::ReturnCode (*p9_mss_eff_grouping_FP_t)(\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>&);\n\n\/\/------------------------------------------------------------------------------\n\/\/ Function prototypes\n\/\/------------------------------------------------------------------------------\n\/\/\/\n\/\/\/ @brief p9_mss_eff_grouping procedure\n\/\/\/\n\/\/\/ This HWP is to group the MCs of the input target processor chip based\n\/\/\/ on the amount of memory behind its ports and some policy attribute settings.\n\/\/\/\n\/\/\/ @param[in]    i_target   Reference to TARGET_TYPE_PROC_CHIP target\n\/\/\/\n\/\/\/ @return FAPI2_RC_SUCCESS if success, else error code.\n\/\/\/\nextern \"C\"\n{\n\n    fapi2::ReturnCode p9_mss_eff_grouping(\n        const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target);\n\n} \/\/ extern \"C\"\n\n#endif  \/\/ _P9_MSS_EFF_GROUPING_H_\n<|endoftext|>"}
{"text":"<commit_before>#include \"MifareClassic.h\"\n#include \"Ndef.h\"\n#include <Adafruit_NFCShield_I2C.h>\n\n#define ULTRALIGHT_PAGE_SIZE 4\n#define ULTRALIGHT_READ_SIZE 4\n\n\/\/ MIFARE ULTRALIGHT C - NFC FORUM TYPE 2\n\n\/\/ TODO verify these assumptions!\nint getUltralightBufferSize(int messageLength)\n{ \n\n  \/\/ TLV header is 3 bytes. TLV terminator is 1 byte.\n  int bufferSize = messageLength + 4;\n\n  \/\/ TODO ULTRALIGHT_PAGE_SIZE or ULTRALIGHT_READ_SIZE\n  \/\/ bufferSize needs to be a multiple of ULTRALIGHT_PAGE_SIZE\n  if (bufferSize % ULTRALIGHT_READ_SIZE != 0)\n  {\n      bufferSize = ((messageLength \/ ULTRALIGHT_READ_SIZE) + 1) * ULTRALIGHT_READ_SIZE;    \n  }\n\n  return bufferSize;\n}\n\nNdefMessage readMifareUltralight(Adafruit_NFCShield_I2C& nfc)\n{\n    int currentPage = 5; \/\/ data starts on page 5\n    int messageLength = 0;\n    byte pageData[ULTRALIGHT_READ_SIZE]; \/\/ TODO RTFM, I think we get many pages, can I read less often?\n \n    int success = nfc.mifareultralight_ReadPage (currentPage, pageData);\n    if (success)\n    {\n      messageLength = pageData[2];      \n    }\n    else\n    {\n      Serial.print(\"Error. Failed read page \");Serial.println(currentPage); \n    }\n\n    \/\/ this should be nested in the message length loop\n    int index = 0;\n    int bufferSize = getUltralightBufferSize(messageLength);\n    uint8_t buffer[bufferSize];\n\n    Serial.print(\"Message Length \");Serial.println(messageLength);\n    Serial.print(\"Buffer Size \");Serial.println(bufferSize);\n\n    \/\/ TODO special case \n    \/\/ Message Length == 0 should return an TNF_EMPTY data is 0x44 0x03 0x00 0xFE\n\n    \/\/ for (page = 6; page < 63; page++) {      \n    while (index < messageLength)\n    {\n\n      \/\/ read the data\n      success = nfc.mifareultralight_ReadPage(currentPage, &buffer[index]);\n      if (success) \n      {\n        Serial.print(\"Read page \");Serial.println(currentPage);\n      } \n      else \n      {\n        Serial.print(\"Read failed\");Serial.println(currentPage);\n        \/\/ TODO error handling\n      }\n\n      index += ULTRALIGHT_PAGE_SIZE; \/\/ TODO ULTRALIGHT_READ_SIZE                  \n      currentPage++;  \/\/ TODO jump multiple pages!!!\n\n      \/\/ TODO don't read past block 63\n\n    }\n\n    nfc.PrintHex(&buffer[3], messageLength); \/\/ TODO MIFARE_DATA_START_INDEX 3\n\n    NdefMessage ndefMessage = NdefMessage(&buffer[3], messageLength);\n    return ndefMessage;\n}\n\n<commit_msg>print page contents<commit_after>#include \"MifareClassic.h\"\n#include \"Ndef.h\"\n#include <Adafruit_NFCShield_I2C.h>\n\n#define ULTRALIGHT_PAGE_SIZE 4\n#define ULTRALIGHT_READ_SIZE 4\n\n\/\/ MIFARE ULTRALIGHT C - NFC FORUM TYPE 2\n\n\/\/ TODO verify these assumptions!\nint getUltralightBufferSize(int messageLength)\n{ \n\n  \/\/ TLV header is 3 bytes. TLV terminator is 1 byte.\n  int bufferSize = messageLength + 4;\n\n  \/\/ TODO ULTRALIGHT_PAGE_SIZE or ULTRALIGHT_READ_SIZE\n  \/\/ bufferSize needs to be a multiple of ULTRALIGHT_PAGE_SIZE\n  if (bufferSize % ULTRALIGHT_READ_SIZE != 0)\n  {\n      bufferSize = ((messageLength \/ ULTRALIGHT_READ_SIZE) + 1) * ULTRALIGHT_READ_SIZE;    \n  }\n\n  return bufferSize;\n}\n\nNdefMessage readMifareUltralight(Adafruit_NFCShield_I2C& nfc)\n{\n    int currentPage = 5; \/\/ data starts on page 5\n    int messageLength = 0;\n    byte pageData[ULTRALIGHT_READ_SIZE]; \/\/ TODO RTFM, I think we get many pages, can I read less often?\n \n    int success = nfc.mifareultralight_ReadPage (currentPage, pageData);\n    if (success)\n    {\n      messageLength = pageData[2];      \n    }\n    else\n    {\n      Serial.print(\"Error. Failed read page \");Serial.println(currentPage); \n    }\n\n    \/\/ this should be nested in the message length loop\n    int index = 0;\n    int bufferSize = getUltralightBufferSize(messageLength);\n    uint8_t buffer[bufferSize];\n\n    Serial.print(\"Message Length \");Serial.println(messageLength);\n    Serial.print(\"Buffer Size \");Serial.println(bufferSize);\n\n    \/\/ TODO special case \n    \/\/ Message Length == 0 should return an TNF_EMPTY data is 0x44 0x03 0x00 0xFE\n\n    \/\/ for (page = 6; page < 63; page++) {      \n    while (index < messageLength)\n    {\n\n      \/\/ read the data\n      success = nfc.mifareultralight_ReadPage(currentPage, &buffer[index]);\n      if (success) \n      {\n        Serial.print(\"Page \");Serial.print(currentPage);Serial.print(\" \");\n        nfc.PrintHexChar(&buffer[index], ULTRALIGHT_PAGE_SIZE);\n      } \n      else \n      {\n        Serial.print(\"Read failed\");Serial.println(currentPage);\n        \/\/ TODO error handling\n      }\n\n      index += ULTRALIGHT_PAGE_SIZE; \/\/ TODO ULTRALIGHT_READ_SIZE                  \n      currentPage++;  \/\/ TODO jump multiple pages!!!\n\n      \/\/ TODO don't read past block 63\n\n    }\n\n    nfc.PrintHex(&buffer[3], messageLength); \/\/ TODO MIFARE_DATA_START_INDEX 3\n\n    NdefMessage ndefMessage = NdefMessage(&buffer[3], messageLength);\n    return ndefMessage;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 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#include \"log.h\"\n\n#include \"core\/cc\/target.h\"\n\n#if TARGET_OS != GAPID_OS_ANDROID\n\n#include <errno.h>\n#include <stdarg.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <chrono>\n#include <ctime> \/\/ Required for MSVC.\n\nnamespace core {\n\nLogger Logger::mInstance = Logger();\n\nvoid Logger::init(unsigned level, const char* system, const char* path) {\n    mInstance.mLevel = level;\n    mInstance.mSystem = system;\n    if (path != nullptr) {\n        if (FILE* f = fopen(path, \"w\")) {\n            GAPID_INFO(\"Logging to %s\", path);\n            mInstance.mFiles.push_back(f);\n        } else {\n            GAPID_WARNING(\"Can't open file for logging (%s): %s\", path, strerror(errno));\n        }\n    }\n}\n\nLogger::Logger() : mLevel(LOG_LEVEL_INFO), mSystem(\"\") {\n    mFiles.push_back(stdout);\n}\n\nLogger::~Logger() {\n    for (FILE* file : mFiles) {\n        fclose(file);\n    }\n}\n\nvoid Logger::logf(unsigned level, const char* file, unsigned line, const char* format, ...) const {\n    va_list args;\n    va_start(args, format);\n    vlogf(level, file, line, format, args);\n    va_end(args);\n}\n\nvoid Logger::vlogf(unsigned level, const char* src_file, unsigned src_line, const char* format, va_list args) const {\n    \/\/ Get the current time with milliseconds precision\n    auto t = std::chrono::system_clock::now();\n    std::time_t now = std::chrono::system_clock::to_time_t(t);\n    std::tm* loc = std::localtime(&now);\n    auto ms = std::chrono::duration_cast<std::chrono::milliseconds>(t.time_since_epoch());\n\n    for (FILE* file : mFiles) {\n        \/\/ Print out the common part of the log messages\n        fprintf(file, \"%02d:%02d:%02d.%03d %c %s: [%s:%u] \", loc->tm_hour, loc->tm_min, loc->tm_sec,\n                static_cast<int>(ms.count() % 1000), \"FEWIDV\"[level], mSystem, src_file, src_line);\n\n        \/\/ Print out the actual log message\n        vfprintf(file, format, args);\n\n        \/\/ Always finish with a newline\n        fprintf(file, \"\\n\");\n\n        \/\/ Flush the log to ensure that every message is written out even if the application crashes\n        fflush(file);\n    }\n\n    if (level == LOG_LEVEL_FATAL) {\n        exit(EXIT_FAILURE);\n    }\n}\n\n}  \/\/ namespace core\n\n#endif  \/\/ TARGET_OS != GAPID_OS_ANDROID\n<commit_msg>core\/cc\/log: Fix crash due to repeated use of va_list.<commit_after>\/*\n * Copyright (C) 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#include \"log.h\"\n\n#include \"core\/cc\/target.h\"\n\n#if TARGET_OS != GAPID_OS_ANDROID\n\n#include <errno.h>\n#include <stdarg.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <chrono>\n#include <ctime> \/\/ Required for MSVC.\n\nnamespace core {\n\nLogger Logger::mInstance = Logger();\n\nvoid Logger::init(unsigned level, const char* system, const char* path) {\n    mInstance.mLevel = level;\n    mInstance.mSystem = system;\n    if (path != nullptr) {\n        if (FILE* f = fopen(path, \"w\")) {\n            GAPID_INFO(\"Logging to %s\", path);\n            mInstance.mFiles.push_back(f);\n        } else {\n            GAPID_WARNING(\"Can't open file for logging (%s): %s\", path, strerror(errno));\n        }\n    }\n}\n\nLogger::Logger() : mLevel(LOG_LEVEL_INFO), mSystem(\"\") {\n    mFiles.push_back(stdout);\n}\n\nLogger::~Logger() {\n    for (FILE* file : mFiles) {\n        fclose(file);\n    }\n}\n\nvoid Logger::logf(unsigned level, const char* file, unsigned line, const char* format, ...) const {\n    va_list args;\n    va_start(args, format);\n    vlogf(level, file, line, format, args);\n    va_end(args);\n}\n\nvoid Logger::vlogf(unsigned level, const char* src_file, unsigned src_line, const char* format, va_list args) const {\n    \/\/ Get the current time with milliseconds precision\n    auto t = std::chrono::system_clock::now();\n    std::time_t now = std::chrono::system_clock::to_time_t(t);\n    std::tm* loc = std::localtime(&now);\n    auto ms = std::chrono::duration_cast<std::chrono::milliseconds>(t.time_since_epoch());\n\n    for (FILE* file : mFiles) {\n        va_list args_copy;\n        va_copy(args_copy, args);\n\n        \/\/ Print out the common part of the log messages\n        fprintf(file, \"%02d:%02d:%02d.%03d %c %s: [%s:%u] \", loc->tm_hour, loc->tm_min, loc->tm_sec,\n                static_cast<int>(ms.count() % 1000), \"FEWIDV\"[level], mSystem, src_file, src_line);\n\n        \/\/ Print out the actual log message\n        vfprintf(file, format, args_copy);\n\n        \/\/ Always finish with a newline\n        fprintf(file, \"\\n\");\n\n        \/\/ Flush the log to ensure that every message is written out even if the application crashes\n        fflush(file);\n    }\n\n    if (level == LOG_LEVEL_FATAL) {\n        exit(EXIT_FAILURE);\n    }\n}\n\n}  \/\/ namespace core\n\n#endif  \/\/ TARGET_OS != GAPID_OS_ANDROID\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Clever programming language\n * Copyright (c) Clever Team\n *\n * This file is distributed under the MIT license. See LICENSE for details.\n *\/\n\n#include <iostream>\n#include \"core\/ast.h\"\n#include \"core\/codegen.h\"\n#include \"core\/scope.h\"\n#include \"core\/compiler.h\"\n\nnamespace clever { namespace ast {\n\nvoid Codegen::init()\n{\n\tm_scope = new Scope;\n\tm_scope_pool[m_scope_id++] = m_scope;\n}\n\nvoid Codegen::visit(IntLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(DoubleLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(StringLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(Ident* node)\n{\n\tSymbol* sym = m_scope->getAny(node->getName());\n\n\tif (!sym) {\n\t\tm_compiler->errorf(node->getLocation(),\n\t\t\t\"Variable `%S' not found!\", node->getName());\n\t}\n\tstd::cout << \"id: \" << sym->value_id << std::endl;\n\n\tnode->setValueId(sym->value_id);\n\tnode->setScopeId(sym->scope->getId());\n}\n\nvoid Codegen::visit(Import* node)\n{\n\tif (node->getModule()) {\n\t\tm_compiler->getPkgManager().importModule(m_scope,\n\t\t\tnode->getPackage()->getName(), node->getModule()->getName());\n\t} else {\n\t\tm_compiler->getPkgManager().importPackage(m_scope,\n\t\t\tnode->getPackage()->getName());\n\t}\n}\n\nvoid Codegen::visit(Block* node)\n{\n\tm_scope = m_scope->newLexicalScope();\n\tm_scope->setId(m_scope_id);\n\tm_scope_pool[m_scope_id++] = m_scope;\n\n\tstd::vector<Node*> nodes = node->getNodes();\n\tstd::vector<Node*>::const_iterator it = nodes.begin(), end = nodes.end();\n\twhile (it != end) {\n\t\t(*it)->accept(*this);\n\t\t++it;\n\t}\n\n\tm_scope = m_scope->getParent();\n}\n\nvoid Codegen::visit(VariableDecl* node)\n{\n\tif (node->hasAssignment()) {\n\t\tm_scope->pushValue(node->getIdent()->getName(), new Value());\n\t\tnode->getAssignment()->accept(*this);\n\t} else {\n\t\tsize_t var_id = m_scope->pushValue(node->getIdent()->getName(), new Value());\n\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN,\n\t\t\t\tOperand(FETCH_VAL, var_id, m_scope->getId()),\n\t\t\t\tOperand(FETCH_VAL, m_scope->pushConst(new Value()), m_scope->getId())));\n\t}\n}\n\nvoid Codegen::visit(Assignment* node)\n{\n\t\/\/ TODO: allow assignment of any possible left hand side.\n\n\tIdent* ident = static_cast<Ident*>(node->getLhs());\n\tSymbol* sym = m_scope->getLocal(ident->getName());\n\tNode* rhs = node->getRhs();\n\n\tif (!sym) {\n\t\tm_compiler->errorf(node->getLocation(),\n\t\t\t\"Variable `%S' not found!\", ident->getName());\n\t}\n\n\trhs->accept(*this);\n\n\tif (rhs->isLiteral()) {\n\t\tm_ir.push_back(IR(OP_ASSIGN,\n\t\t\tOperand(FETCH_VAL, sym->value_id, sym->scope->getId()),\n\t\t\tOperand(FETCH_CONST, static_cast<Literal*>(rhs)->getConstId())));\n\t}\n\n\t\/\/ TODO: if node->isConditional() is true, emit branching code to avoid assignment when ident has been initialized.\n}\n\nvoid Codegen::visit(FunctionCall* node)\n{\n\tIdent* ident = static_cast<Ident*>(node->getCallee());\n\tSymbol* sym = m_scope->getAny(ident->getName());\n\n\tif (!sym) {\n\t\tm_compiler->errorf(node->getLocation(),\n\t\t\t\"Function `%S' not found!\", ident->getName());\n\t}\n\n\tif (node->hasArgs()) {\n\t\tNodeList& args = node->getArgs()->getNodes();\n\t\tNodeList::const_iterator it = args.begin(), end = args.end();\n\n\t\twhile (it != end) {\n\t\t\tOperand operand;\n\n\t\t\t(*it)->accept(*this);\n\n\t\t\tif ((*it)->isLiteral()) {\n\t\t\t\toperand.op_type = FETCH_CONST;\n\t\t\t\toperand.value_id = static_cast<Literal*>(*it)->getConstId();\n\t\t\t} else {\n\t\t\t\tstd::cout << \"foo\" << std::endl;\n\n\t\t\t\toperand.op_type = FETCH_VAL;\n\t\t\t\toperand.value_id = (*it)->getValueId();\n\t\t\t\toperand.scope_id = (*it)->getScopeId();\n\t\t\t}\n\t\t\tm_ir.push_back(IR(OP_SEND_VAL, operand));\n\t\t\t++it;\n\t\t}\n\t}\n\n\tm_ir.push_back(IR(OP_FCALL,\n\t\tOperand(FETCH_VAL, sym->value_id, sym->scope->getId())));\n}\n\nvoid Codegen::visit(FunctionDecl* node)\n{\n\tconst CString* name = node->getIdent()->getName();\n\tSymbol* sym = m_scope->getLocal(name);\n\tsize_t start_func;\n\n\tif (sym) {\n\t\tm_compiler->errorf(node->getLocation(),\n\t\t\t\"Function `%S' already defined in the scope!\", name);\n\t}\n\n\tFunction* func = static_cast<Function*>(CLEVER_FUNC_TYPE->allocData());\n\n\tfunc->setName(*name);\n\tfunc->setUserDefined();\n\tfunc->setAddr(m_ir.size());\n\n\tValue* fval = new Value();\n\tfval->setType(CLEVER_FUNC_TYPE);\n\tfval->setObj(func);\n\n\tm_scope->pushValue(name, fval);\n\n\tstart_func = m_ir.size();\n\n\t\/\/ XXX: what's the point of a jump here?\n\tm_ir.push_back(IR(OP_JMP, Operand(JMP_ADDR, 0)));\n\n\t\/\/ TODO: find a cleaner way to enter and leave scopes\n\tm_scope = m_scope->newLexicalScope();\n\tm_scope->setId(m_scope_id);\n\tm_scope_pool[m_scope_id++] = m_scope;\n\n\tif (node->hasArgs()) {\n\t\tfor (size_t i = 0; i < node->numArgs(); ++i) {\n\t\t\tVariableDecl* decl = static_cast<VariableDecl*>(node->getArg(i));\n\n\t\t\tif (decl->hasAssignment()) {\n\t\t\t\tdecl->getAssignment()->setConditional(true);\n\t\t\t}\n\t\t}\n\n\t\tnode->getArgs()->accept(*this);\n\t}\n\n\tnode->getBlock()->accept(*this);\n\n\tm_scope = m_scope->getParent();\n\n\tm_ir.push_back(IR(OP_LEAVE));\n\n\tm_ir[start_func].op1.value_id = m_ir.size();\n}\n\nvoid Codegen::visit(Return* node)\n{\n\t\/\/ TODO: return value\n\tm_ir.push_back(IR(OP_RET));\n}\n\nvoid Codegen::visit(While* node)\n{\n\tsize_t start_while = m_ir.size();\n\n\tnode->getCondition()->accept(*this);\n\n\tm_ir.push_back(IR(OP_JMPZ));\n\n\tnode->getBlock()->accept(*this);\n\n\tm_ir.push_back(IR(OP_JMP, Operand(JMP_ADDR, start_while)));\n\n\tm_ir[start_while].op2.value_id = m_ir.size();\n}\n\n\n}} \/\/ clever::ast\n<commit_msg>- Removed debug prints<commit_after>\/**\n * Clever programming language\n * Copyright (c) Clever Team\n *\n * This file is distributed under the MIT license. See LICENSE for details.\n *\/\n\n#include <iostream>\n#include \"core\/ast.h\"\n#include \"core\/codegen.h\"\n#include \"core\/scope.h\"\n#include \"core\/compiler.h\"\n\nnamespace clever { namespace ast {\n\nvoid Codegen::init()\n{\n\tm_scope = new Scope;\n\tm_scope_pool[m_scope_id++] = m_scope;\n}\n\nvoid Codegen::visit(IntLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(DoubleLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(StringLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(Ident* node)\n{\n\tSymbol* sym = m_scope->getAny(node->getName());\n\n\tif (!sym) {\n\t\tm_compiler->errorf(node->getLocation(),\n\t\t\t\"Variable `%S' not found!\", node->getName());\n\t}\n\n\tnode->setValueId(sym->value_id);\n\tnode->setScopeId(sym->scope->getId());\n}\n\nvoid Codegen::visit(Import* node)\n{\n\tif (node->getModule()) {\n\t\tm_compiler->getPkgManager().importModule(m_scope,\n\t\t\tnode->getPackage()->getName(), node->getModule()->getName());\n\t} else {\n\t\tm_compiler->getPkgManager().importPackage(m_scope,\n\t\t\tnode->getPackage()->getName());\n\t}\n}\n\nvoid Codegen::visit(Block* node)\n{\n\tm_scope = m_scope->newLexicalScope();\n\tm_scope->setId(m_scope_id);\n\tm_scope_pool[m_scope_id++] = m_scope;\n\n\tstd::vector<Node*> nodes = node->getNodes();\n\tstd::vector<Node*>::const_iterator it = nodes.begin(), end = nodes.end();\n\twhile (it != end) {\n\t\t(*it)->accept(*this);\n\t\t++it;\n\t}\n\n\tm_scope = m_scope->getParent();\n}\n\nvoid Codegen::visit(VariableDecl* node)\n{\n\tif (node->hasAssignment()) {\n\t\tm_scope->pushValue(node->getIdent()->getName(), new Value());\n\t\tnode->getAssignment()->accept(*this);\n\t} else {\n\t\tsize_t var_id = m_scope->pushValue(node->getIdent()->getName(), new Value());\n\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN,\n\t\t\t\tOperand(FETCH_VAL, var_id, m_scope->getId()),\n\t\t\t\tOperand(FETCH_VAL, m_scope->pushConst(new Value()), m_scope->getId())));\n\t}\n}\n\nvoid Codegen::visit(Assignment* node)\n{\n\t\/\/ TODO: allow assignment of any possible left hand side.\n\n\tIdent* ident = static_cast<Ident*>(node->getLhs());\n\tSymbol* sym = m_scope->getLocal(ident->getName());\n\tNode* rhs = node->getRhs();\n\n\tif (!sym) {\n\t\tm_compiler->errorf(node->getLocation(),\n\t\t\t\"Variable `%S' not found!\", ident->getName());\n\t}\n\n\trhs->accept(*this);\n\n\tif (rhs->isLiteral()) {\n\t\tm_ir.push_back(IR(OP_ASSIGN,\n\t\t\tOperand(FETCH_VAL, sym->value_id, sym->scope->getId()),\n\t\t\tOperand(FETCH_CONST, static_cast<Literal*>(rhs)->getConstId())));\n\t}\n\n\t\/\/ TODO: if node->isConditional() is true, emit branching code to avoid assignment when ident has been initialized.\n}\n\nvoid Codegen::visit(FunctionCall* node)\n{\n\tIdent* ident = static_cast<Ident*>(node->getCallee());\n\tSymbol* sym = m_scope->getAny(ident->getName());\n\n\tif (!sym) {\n\t\tm_compiler->errorf(node->getLocation(),\n\t\t\t\"Function `%S' not found!\", ident->getName());\n\t}\n\n\tif (node->hasArgs()) {\n\t\tNodeList& args = node->getArgs()->getNodes();\n\t\tNodeList::const_iterator it = args.begin(), end = args.end();\n\n\t\twhile (it != end) {\n\t\t\tOperand operand;\n\n\t\t\t(*it)->accept(*this);\n\n\t\t\tif ((*it)->isLiteral()) {\n\t\t\t\toperand.op_type = FETCH_CONST;\n\t\t\t\toperand.value_id = static_cast<Literal*>(*it)->getConstId();\n\t\t\t} else {\n\t\t\t\toperand.op_type = FETCH_VAL;\n\t\t\t\toperand.value_id = (*it)->getValueId();\n\t\t\t\toperand.scope_id = (*it)->getScopeId();\n\t\t\t}\n\t\t\tm_ir.push_back(IR(OP_SEND_VAL, operand));\n\t\t\t++it;\n\t\t}\n\t}\n\n\tm_ir.push_back(IR(OP_FCALL,\n\t\tOperand(FETCH_VAL, sym->value_id, sym->scope->getId())));\n}\n\nvoid Codegen::visit(FunctionDecl* node)\n{\n\tconst CString* name = node->getIdent()->getName();\n\tSymbol* sym = m_scope->getLocal(name);\n\tsize_t start_func;\n\n\tif (sym) {\n\t\tm_compiler->errorf(node->getLocation(),\n\t\t\t\"Function `%S' already defined in the scope!\", name);\n\t}\n\n\tFunction* func = static_cast<Function*>(CLEVER_FUNC_TYPE->allocData());\n\n\tfunc->setName(*name);\n\tfunc->setUserDefined();\n\tfunc->setAddr(m_ir.size());\n\n\tValue* fval = new Value();\n\tfval->setType(CLEVER_FUNC_TYPE);\n\tfval->setObj(func);\n\n\tm_scope->pushValue(name, fval);\n\n\tstart_func = m_ir.size();\n\n\t\/\/ XXX: what's the point of a jump here?\n\tm_ir.push_back(IR(OP_JMP, Operand(JMP_ADDR, 0)));\n\n\t\/\/ TODO: find a cleaner way to enter and leave scopes\n\tm_scope = m_scope->newLexicalScope();\n\tm_scope->setId(m_scope_id);\n\tm_scope_pool[m_scope_id++] = m_scope;\n\n\tif (node->hasArgs()) {\n\t\tfor (size_t i = 0; i < node->numArgs(); ++i) {\n\t\t\tVariableDecl* decl = static_cast<VariableDecl*>(node->getArg(i));\n\n\t\t\tif (decl->hasAssignment()) {\n\t\t\t\tdecl->getAssignment()->setConditional(true);\n\t\t\t}\n\t\t}\n\n\t\tnode->getArgs()->accept(*this);\n\t}\n\n\tnode->getBlock()->accept(*this);\n\n\tm_scope = m_scope->getParent();\n\n\tm_ir.push_back(IR(OP_LEAVE));\n\n\tm_ir[start_func].op1.value_id = m_ir.size();\n}\n\nvoid Codegen::visit(Return* node)\n{\n\t\/\/ TODO: return value\n\tm_ir.push_back(IR(OP_RET));\n}\n\nvoid Codegen::visit(While* node)\n{\n\tsize_t start_while = m_ir.size();\n\n\tnode->getCondition()->accept(*this);\n\n\tm_ir.push_back(IR(OP_JMPZ));\n\n\tnode->getBlock()->accept(*this);\n\n\tm_ir.push_back(IR(OP_JMP, Operand(JMP_ADDR, start_while)));\n\n\tm_ir[start_while].op2.value_id = m_ir.size();\n}\n\n\n}} \/\/ clever::ast\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2016 Shanghai Jiao Tong University.\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,\n *  software distributed under the License is distributed on an \"AS\n *  IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either\n *  express or implied.  See the License for the specific language\n *  governing permissions and limitations under the License.\n *\n * For more about this software visit:\n *\n *      http:\/\/ipads.se.sjtu.edu.cn\/projects\/wukong\n *\n *\/\n\n#pragma once\n\n#include <map>\n#include <string>\n#include <fstream>\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sstream>\n#include <boost\/algorithm\/string\/predicate.hpp>\n\n#include \"rdma.hpp\"\n#include \"assertion.hpp\"\n\n\nusing namespace std;\n\nint global_num_servers = 1;    \/\/ the number of servers\nint global_num_threads = 2;    \/\/ the number of threads per server (incl. proxy and engine)\n\nint global_num_proxies = 1;    \/\/ the number of proxies\nint global_num_engines = 1;    \/\/ the number of engines\n\nstring global_input_folder;\n\nint global_data_port_base = 5500;\nint global_ctrl_port_base = 9576;\n\nint global_memstore_size_gb = 20;\nint global_rdma_buf_size_mb = 64;\nint global_rdma_rbf_size_mb = 16;\n\nbool global_use_rdma = true;\nbool global_generate_statistics = true;\nbool global_enable_caching = true;\nbool global_enable_workstealing = false;\n\nint global_mt_threshold = 16;\nint global_rdma_threshold = 300;\n\nbool global_silent = true;  \/\/ don't take back results by default\n\nbool global_enable_planner = true;  \/\/ for planner\n\nbool global_enable_vattr = false;  \/\/ for attr\n\n\/\/ GPU related\nint global_gpu_num_agents = 1;\nint global_gpu_rdma_buf_size_mb = 64;\n\nstatic bool set_immutable_config(string cfg_name, string value)\n{\n    if (cfg_name == \"global_num_proxies\") {\n        global_num_proxies = atoi(value.c_str());\n        ASSERT(global_num_proxies > 0);\n    } else if (cfg_name == \"global_num_engines\") {\n        global_num_engines = atoi(value.c_str());\n        ASSERT(global_num_engines > 0);\n    } else if (cfg_name == \"global_input_folder\") {\n        global_input_folder = value;\n\n        \/\/ make sure to check that the global_input_folder is non-empty.\n        if (global_input_folder.length() == 0) {\n            logstream(LOG_ERROR) << \"the directory path of RDF data can not be empty!\"\n                                 << \"You should set \\\"global_input_folder\\\" in config file.\" << LOG_endl;\n            exit(-1);\n        }\n\n        \/\/ force a \"\/\" at the end of global_input_folder.\n        if (global_input_folder[global_input_folder.length() - 1] != '\/')\n            global_input_folder = global_input_folder + \"\/\";\n    } else if (cfg_name == \"global_data_port_base\") {\n        global_data_port_base = atoi(value.c_str());\n        ASSERT(global_data_port_base > 0);\n    } else if (cfg_name == \"global_ctrl_port_base\") {\n        global_ctrl_port_base = atoi(value.c_str());\n        ASSERT(global_ctrl_port_base > 0);\n    } else if (cfg_name == \"global_memstore_size_gb\") {\n        global_memstore_size_gb = atoi(value.c_str());\n        ASSERT(global_memstore_size_gb > 0);\n    } else if (cfg_name == \"global_rdma_buf_size_mb\") {\n        global_rdma_buf_size_mb = atoi(value.c_str());\n        ASSERT(global_rdma_buf_size_mb > 0);\n    } else if (cfg_name == \"global_rdma_rbf_size_mb\") {\n        global_rdma_rbf_size_mb = atoi(value.c_str());\n        ASSERT(global_rdma_rbf_size_mb > 0);\n    } else if (cfg_name == \"global_generate_statistics\") {\n        global_generate_statistics = atoi(value.c_str());\n    } else if (cfg_name == \"global_gpu_num_agents\") {\n\t\tglobal_gpu_num_agents = atoi(value.c_str());\n\t} else if (cfg_name == \"global_gpu_rdma_buf_size_mb\") {\n\t\tglobal_gpu_rdma_buf_size_mb = atoi(value.c_str());\n\t}\n    else {\n        return false;\n    }\n\n    return true;\n}\n\nstatic bool set_mutable_config(string cfg_name, string value)\n{\n    if (cfg_name == \"global_use_rdma\") {\n        if (atoi(value.c_str())) {\n            if (!RDMA::get_rdma().has_rdma()) {\n                logstream(LOG_ERROR) << \"can't enable RDMA due to building Wukong w\/o RDMA support!\\n\"\n                                     << \"HINT: please disable global_use_rdma in config file.\" << LOG_endl;\n                global_use_rdma = false; \/\/ disable RDMA if no RDMA device\n                return true;\n            }\n\n            global_use_rdma = true;\n        } else {\n            global_use_rdma = false;\n        }\n    } else if (cfg_name == \"global_rdma_threshold\") {\n        global_rdma_threshold = atoi(value.c_str());\n    } else if (cfg_name == \"global_mt_threshold\") {\n        global_mt_threshold = atoi(value.c_str());\n        ASSERT(global_mt_threshold > 0);\n    } else if (cfg_name == \"global_enable_caching\") {\n        global_enable_caching = atoi(value.c_str());\n    } else if (cfg_name == \"global_enable_workstealing\") {\n        global_enable_workstealing = atoi(value.c_str());\n    } else if (cfg_name == \"global_silent\") {\n        global_silent = atoi(value.c_str());\n    } else if (cfg_name == \"global_enable_planner\") {\n        global_enable_planner = atoi(value.c_str());\n    } else if (cfg_name == \"global_enable_vattr\") {\n        global_enable_vattr = atoi(value.c_str());\n    } else {\n        return false;\n    }\n\n    return true;\n}\n\nstatic void str2items(string str, map<string, string> &items)\n{\n    istringstream iss(str);\n    string row, val;\n    while (iss >> row >> val)\n        items[row] = val;\n}\n\nstatic void file2items(string fname, map<string, string> &items)\n{\n    ifstream file(fname.c_str());\n    if (!file) {\n        logstream(LOG_ERROR) << fname << \" does not exist.\" << LOG_endl;\n        exit(0);\n    }\n\n    string line, row, val;\n    while (std::getline(file, line)) {\n        if (boost::starts_with(line, \"#\") || line.empty())\n            continue; \/\/ skip comments and blank lines\n\n        istringstream iss(line);\n        iss >> row >> val;\n        items[row] = val;\n    }\n}\n\n\/**\n * reload config\n *\/\nvoid reload_config(string str)\n{\n    \/\/ TODO: it should ensure that there is no outstanding queries.\n\n    \/\/ load config file\n    map<string, string> items;\n    str2items(str, items);\n\n    for (auto const &entry : items)\n        set_mutable_config(entry.first, entry.second);\n\n    \/\/ limited the number of engines\n    global_mt_threshold = max(1, min(global_mt_threshold, global_num_engines));\n\n    return;\n}\n\n\/**\n * load config\n *\/\nvoid load_config(string fname, int num_servers)\n{\n    global_num_servers = num_servers;\n    ASSERT(num_servers > 0);\n\n    \/\/ load config file\n    map<string, string> items;\n    file2items(fname, items);\n\n    for (auto const &entry : items) {\n        if (!(set_immutable_config(entry.first, entry.second)\n                || set_mutable_config(entry.first, entry.second))) {\n            logstream(LOG_WARNING) << \"unsupported configuration item! (\"\n                                   << entry.first << \")\" << LOG_endl;\n        }\n    }\n\n    \/\/ set the total number of threads\n    global_num_threads = global_num_engines + global_num_proxies;\n\n    \/\/ limited the number of engines\n    global_mt_threshold = max(1, min(global_mt_threshold, global_num_engines));\n\n    return;\n}\n\n\/**\n * print current config\n *\/\nvoid print_config(void)\n{\n    logstream(LOG_INFO) << \"------ global configurations ------\" << LOG_endl;\n\n    \/\/ setting by config file\n    logstream(LOG_INFO) << \"the number of proxies: \"        << global_num_proxies           << LOG_endl;\n    logstream(LOG_INFO) << \"the number of engines: \"        << global_num_engines           << LOG_endl;\n    logstream(LOG_INFO) << \"global_input_folder: \"      << global_input_folder          << LOG_endl;\n    logstream(LOG_INFO) << \"global_data_port_base: \"        << global_data_port_base        << LOG_endl;\n    logstream(LOG_INFO) << \"global_ctrl_port_base: \"        << global_ctrl_port_base        << LOG_endl;\n    logstream(LOG_INFO) << \"global_memstore_size_gb: \"  << global_memstore_size_gb      << LOG_endl;\n    logstream(LOG_INFO) << \"global_rdma_buf_size_mb: \"  << global_rdma_buf_size_mb      << LOG_endl;\n    logstream(LOG_INFO) << \"global_rdma_rbf_size_mb: \"  << global_rdma_rbf_size_mb      << LOG_endl;\n    logstream(LOG_INFO) << \"global_use_rdma: \"          << global_use_rdma              << LOG_endl;\n    logstream(LOG_INFO) << \"global_enable_caching: \"        << global_enable_caching        << LOG_endl;\n    logstream(LOG_INFO) << \"global_enable_workstealing: \"   << global_enable_workstealing   << LOG_endl;\n    logstream(LOG_INFO) << \"global_rdma_threshold: \"        << global_rdma_threshold        << LOG_endl;\n    logstream(LOG_INFO) << \"global_mt_threshold: \"      << global_mt_threshold          << LOG_endl;\n    logstream(LOG_INFO) << \"global_silent: \"                << global_silent                << LOG_endl;\n    logstream(LOG_INFO) << \"global_enable_planner: \"        << global_enable_planner        << LOG_endl;\n    logstream(LOG_INFO) << \"global_generate_statistics: \"   << global_generate_statistics   << LOG_endl;\n    logstream(LOG_INFO) << \"global_enable_vattr: \"      << global_enable_vattr          << LOG_endl;\n#ifdef USE_GPU\n    logstream(LOG_INFO) << \"GPU related configurations:\" << LOG_endl;\n    logstream(LOG_INFO) << \"global_gpu_num_agents: \"        << global_gpu_num_agents        << LOG_endl;\n    logstream(LOG_INFO) << \"global_gpu_rdma_buf_size_mb: \"  << global_gpu_rdma_buf_size_mb  << LOG_endl;\n#endif\n\n    logstream(LOG_INFO) << \"--\" << LOG_endl;\n\n    \/\/ compute from other settings\n    logstream(LOG_INFO) << \"the number of servers: \"        << global_num_servers           << LOG_endl;\n    logstream(LOG_INFO) << \"the number of threads: \"        << global_num_threads           << LOG_endl;\n\n}\n<commit_msg>surround gpu-related configurations with macro<commit_after>\/*\n * Copyright (c) 2016 Shanghai Jiao Tong University.\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,\n *  software distributed under the License is distributed on an \"AS\n *  IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either\n *  express or implied.  See the License for the specific language\n *  governing permissions and limitations under the License.\n *\n * For more about this software visit:\n *\n *      http:\/\/ipads.se.sjtu.edu.cn\/projects\/wukong\n *\n *\/\n\n#pragma once\n\n#include <map>\n#include <string>\n#include <fstream>\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sstream>\n#include <boost\/algorithm\/string\/predicate.hpp>\n\n#include \"rdma.hpp\"\n#include \"assertion.hpp\"\n\n\nusing namespace std;\n\nint global_num_servers = 1;    \/\/ the number of servers\nint global_num_threads = 2;    \/\/ the number of threads per server (incl. proxy and engine)\n\nint global_num_proxies = 1;    \/\/ the number of proxies\nint global_num_engines = 1;    \/\/ the number of engines\n\nstring global_input_folder;\n\nint global_data_port_base = 5500;\nint global_ctrl_port_base = 9576;\n\nint global_memstore_size_gb = 20;\nint global_rdma_buf_size_mb = 64;\nint global_rdma_rbf_size_mb = 16;\n\nbool global_use_rdma = true;\nbool global_generate_statistics = true;\nbool global_enable_caching = true;\nbool global_enable_workstealing = false;\n\nint global_mt_threshold = 16;\nint global_rdma_threshold = 300;\n\nbool global_silent = true;  \/\/ don't take back results by default\n\nbool global_enable_planner = true;  \/\/ for planner\n\nbool global_enable_vattr = false;  \/\/ for attr\n\n#ifdef USE_GPU\n\/\/ GPU-related configurations\nint global_gpu_num_agents = 1;\nint global_gpu_rdma_buf_size_mb = 64;\n#endif\n\nstatic bool set_immutable_config(string cfg_name, string value)\n{\n    if (cfg_name == \"global_num_proxies\") {\n        global_num_proxies = atoi(value.c_str());\n        ASSERT(global_num_proxies > 0);\n    } else if (cfg_name == \"global_num_engines\") {\n        global_num_engines = atoi(value.c_str());\n        ASSERT(global_num_engines > 0);\n    } else if (cfg_name == \"global_input_folder\") {\n        global_input_folder = value;\n\n        \/\/ make sure to check that the global_input_folder is non-empty.\n        if (global_input_folder.length() == 0) {\n            logstream(LOG_ERROR) << \"the directory path of RDF data can not be empty!\"\n                                 << \"You should set \\\"global_input_folder\\\" in config file.\" << LOG_endl;\n            exit(-1);\n        }\n\n        \/\/ force a \"\/\" at the end of global_input_folder.\n        if (global_input_folder[global_input_folder.length() - 1] != '\/')\n            global_input_folder = global_input_folder + \"\/\";\n    } else if (cfg_name == \"global_data_port_base\") {\n        global_data_port_base = atoi(value.c_str());\n        ASSERT(global_data_port_base > 0);\n    } else if (cfg_name == \"global_ctrl_port_base\") {\n        global_ctrl_port_base = atoi(value.c_str());\n        ASSERT(global_ctrl_port_base > 0);\n    } else if (cfg_name == \"global_memstore_size_gb\") {\n        global_memstore_size_gb = atoi(value.c_str());\n        ASSERT(global_memstore_size_gb > 0);\n    } else if (cfg_name == \"global_rdma_buf_size_mb\") {\n        global_rdma_buf_size_mb = atoi(value.c_str());\n        ASSERT(global_rdma_buf_size_mb > 0);\n    } else if (cfg_name == \"global_rdma_rbf_size_mb\") {\n        global_rdma_rbf_size_mb = atoi(value.c_str());\n        ASSERT(global_rdma_rbf_size_mb > 0);\n    } else if (cfg_name == \"global_generate_statistics\") {\n        global_generate_statistics = atoi(value.c_str());\n    }\n#ifdef USE_GPU\n    else if (cfg_name == \"global_gpu_num_agents\") {\n\t\tglobal_gpu_num_agents = atoi(value.c_str());\n\t} else if (cfg_name == \"global_gpu_rdma_buf_size_mb\") {\n\t\tglobal_gpu_rdma_buf_size_mb = atoi(value.c_str());\n\t}\n#endif\n    else {\n        return false;\n    }\n\n    return true;\n}\n\nstatic bool set_mutable_config(string cfg_name, string value)\n{\n    if (cfg_name == \"global_use_rdma\") {\n        if (atoi(value.c_str())) {\n            if (!RDMA::get_rdma().has_rdma()) {\n                logstream(LOG_ERROR) << \"can't enable RDMA due to building Wukong w\/o RDMA support!\\n\"\n                                     << \"HINT: please disable global_use_rdma in config file.\" << LOG_endl;\n                global_use_rdma = false; \/\/ disable RDMA if no RDMA device\n                return true;\n            }\n\n            global_use_rdma = true;\n        } else {\n            global_use_rdma = false;\n        }\n    } else if (cfg_name == \"global_rdma_threshold\") {\n        global_rdma_threshold = atoi(value.c_str());\n    } else if (cfg_name == \"global_mt_threshold\") {\n        global_mt_threshold = atoi(value.c_str());\n        ASSERT(global_mt_threshold > 0);\n    } else if (cfg_name == \"global_enable_caching\") {\n        global_enable_caching = atoi(value.c_str());\n    } else if (cfg_name == \"global_enable_workstealing\") {\n        global_enable_workstealing = atoi(value.c_str());\n    } else if (cfg_name == \"global_silent\") {\n        global_silent = atoi(value.c_str());\n    } else if (cfg_name == \"global_enable_planner\") {\n        global_enable_planner = atoi(value.c_str());\n    } else if (cfg_name == \"global_enable_vattr\") {\n        global_enable_vattr = atoi(value.c_str());\n    } else {\n        return false;\n    }\n\n    return true;\n}\n\nstatic void str2items(string str, map<string, string> &items)\n{\n    istringstream iss(str);\n    string row, val;\n    while (iss >> row >> val)\n        items[row] = val;\n}\n\nstatic void file2items(string fname, map<string, string> &items)\n{\n    ifstream file(fname.c_str());\n    if (!file) {\n        logstream(LOG_ERROR) << fname << \" does not exist.\" << LOG_endl;\n        exit(0);\n    }\n\n    string line, row, val;\n    while (std::getline(file, line)) {\n        if (boost::starts_with(line, \"#\") || line.empty())\n            continue; \/\/ skip comments and blank lines\n\n        istringstream iss(line);\n        iss >> row >> val;\n        items[row] = val;\n    }\n}\n\n\/**\n * reload config\n *\/\nvoid reload_config(string str)\n{\n    \/\/ TODO: it should ensure that there is no outstanding queries.\n\n    \/\/ load config file\n    map<string, string> items;\n    str2items(str, items);\n\n    for (auto const &entry : items)\n        set_mutable_config(entry.first, entry.second);\n\n    \/\/ limited the number of engines\n    global_mt_threshold = max(1, min(global_mt_threshold, global_num_engines));\n\n    return;\n}\n\n\/**\n * load config\n *\/\nvoid load_config(string fname, int num_servers)\n{\n    global_num_servers = num_servers;\n    ASSERT(num_servers > 0);\n\n    \/\/ load config file\n    map<string, string> items;\n    file2items(fname, items);\n\n    for (auto const &entry : items) {\n        if (!(set_immutable_config(entry.first, entry.second)\n                || set_mutable_config(entry.first, entry.second))) {\n            logstream(LOG_WARNING) << \"unsupported configuration item! (\"\n                                   << entry.first << \")\" << LOG_endl;\n        }\n    }\n\n    \/\/ set the total number of threads\n    global_num_threads = global_num_engines + global_num_proxies;\n\n    \/\/ limited the number of engines\n    global_mt_threshold = max(1, min(global_mt_threshold, global_num_engines));\n\n    return;\n}\n\n\/**\n * print current config\n *\/\nvoid print_config(void)\n{\n    logstream(LOG_INFO) << \"------ global configurations ------\" << LOG_endl;\n\n    \/\/ setting by config file\n    logstream(LOG_INFO) << \"the number of proxies: \"        << global_num_proxies           << LOG_endl;\n    logstream(LOG_INFO) << \"the number of engines: \"        << global_num_engines           << LOG_endl;\n    logstream(LOG_INFO) << \"global_input_folder: \"      << global_input_folder          << LOG_endl;\n    logstream(LOG_INFO) << \"global_data_port_base: \"        << global_data_port_base        << LOG_endl;\n    logstream(LOG_INFO) << \"global_ctrl_port_base: \"        << global_ctrl_port_base        << LOG_endl;\n    logstream(LOG_INFO) << \"global_memstore_size_gb: \"  << global_memstore_size_gb      << LOG_endl;\n    logstream(LOG_INFO) << \"global_rdma_buf_size_mb: \"  << global_rdma_buf_size_mb      << LOG_endl;\n    logstream(LOG_INFO) << \"global_rdma_rbf_size_mb: \"  << global_rdma_rbf_size_mb      << LOG_endl;\n    logstream(LOG_INFO) << \"global_use_rdma: \"          << global_use_rdma              << LOG_endl;\n    logstream(LOG_INFO) << \"global_enable_caching: \"        << global_enable_caching        << LOG_endl;\n    logstream(LOG_INFO) << \"global_enable_workstealing: \"   << global_enable_workstealing   << LOG_endl;\n    logstream(LOG_INFO) << \"global_rdma_threshold: \"        << global_rdma_threshold        << LOG_endl;\n    logstream(LOG_INFO) << \"global_mt_threshold: \"      << global_mt_threshold          << LOG_endl;\n    logstream(LOG_INFO) << \"global_silent: \"                << global_silent                << LOG_endl;\n    logstream(LOG_INFO) << \"global_enable_planner: \"        << global_enable_planner        << LOG_endl;\n    logstream(LOG_INFO) << \"global_generate_statistics: \"   << global_generate_statistics   << LOG_endl;\n    logstream(LOG_INFO) << \"global_enable_vattr: \"      << global_enable_vattr          << LOG_endl;\n\n#ifdef USE_GPU\n    logstream(LOG_INFO) << \"GPU related configurations:\" << LOG_endl;\n    logstream(LOG_INFO) << \"global_gpu_num_agents: \"        << global_gpu_num_agents        << LOG_endl;\n    logstream(LOG_INFO) << \"global_gpu_rdma_buf_size_mb: \"  << global_gpu_rdma_buf_size_mb  << LOG_endl;\n#endif\n\n    logstream(LOG_INFO) << \"--\" << LOG_endl;\n\n    \/\/ compute from other settings\n    logstream(LOG_INFO) << \"the number of servers: \"        << global_num_servers           << LOG_endl;\n    logstream(LOG_INFO) << \"the number of threads: \"        << global_num_threads           << LOG_endl;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ENTT_SIGNAL_DELEGATE_HPP\n#define ENTT_SIGNAL_DELEGATE_HPP\n\n\n#include <tuple>\n#include <cstddef>\n#include <utility>\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 function_pointer(Ret(*)(Args...)) -> Ret(*)(Args...);\n\n\ntemplate<typename Ret, typename Type, typename... Args, typename Other>\nauto function_pointer(Ret(*)(Type, Args...), Other &&) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Ret, typename... Args, typename... Other>\nauto function_pointer(Ret(Class:: *)(Args...), Other &&...) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Ret, typename... Args, typename... Other>\nauto function_pointer(Ret(Class:: *)(Args...) const, Other &&...) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Type, typename... Other>\nauto function_pointer(Type Class:: *, Other &&...) -> Type(*)();\n\n\ntemplate<typename... Type>\nusing function_pointer_t = decltype(internal::function_pointer(std::declval<Type>()...));\n\n\ntemplate<typename... Class, typename Ret, typename... Args>\n[[nodiscard]] constexpr auto index_sequence_for(Ret(*)(Args...)) {\n    return std::index_sequence_for<Class..., Args...>{};\n}\n\n\n}\n\n\n\/**\n * Internal details not to be documented.\n * @endcond\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>\ninline constexpr 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 a general purpose invoker without memory overhead\n * for free functions possibly with payloads and bound or unbound members.\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    template<auto Candidate, std::size_t... Index>\n    [[nodiscard]] auto wrap(std::index_sequence<Index...>) ENTT_NOEXCEPT {\n        return [](const void *, Args... args) -> Ret {\n            [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);\n            return Ret(std::invoke(Candidate, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(arguments))...));\n        };\n    }\n\n    template<auto Candidate, typename Type, std::size_t... Index>\n    [[nodiscard]] auto wrap(Type &, std::index_sequence<Index...>) ENTT_NOEXCEPT {\n        return [](const void *payload, Args... args) -> Ret {\n            [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);\n            Type *curr = static_cast<Type *>(const_cast<std::conditional_t<std::is_const_v<Type>, const void *, void *>>(payload));\n            return Ret(std::invoke(Candidate, *curr, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(arguments))...));\n        };\n    }\n\n    template<auto Candidate, typename Type, std::size_t... Index>\n    [[nodiscard]] auto wrap(Type *, std::index_sequence<Index...>) ENTT_NOEXCEPT {\n        return [](const void *payload, Args... args) -> Ret {\n            [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);\n            Type *curr = static_cast<Type *>(const_cast<std::conditional_t<std::is_const_v<Type>, const void *, void *>>(payload));\n            return Ret(std::invoke(Candidate, curr, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(arguments))...));\n        };\n    }\n\npublic:\n    \/*! @brief Function type of the contained target. *\/\n    using function_type = Ret(const void *, Args...);\n    \/*! @brief Function type of the delegate. *\/\n    using type = Ret(Args...);\n    \/*! @brief Return type of the delegate. *\/\n    using result_type = Ret;\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 or an unbound\n     * member.\n     * @tparam Candidate Function or member to connect to the delegate.\n     *\/\n    template<auto Candidate>\n    delegate(connect_arg_t<Candidate>) ENTT_NOEXCEPT {\n        connect<Candidate>();\n    }\n\n    \/**\n     * @brief Constructs a delegate and connects a free function with payload or\n     * a bound member.\n     * @tparam Candidate Function or member 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        connect<Candidate>(std::forward<Type>(value_or_instance));\n    }\n\n    \/**\n     * @brief Constructs a delegate and connects an user defined function with\n     * optional payload.\n     * @param function Function to connect to the delegate.\n     * @param payload User defined arbitrary data.\n     *\/\n    delegate(function_type *function, const void *payload = nullptr) ENTT_NOEXCEPT {\n        connect(function, payload);\n    }\n\n    \/**\n     * @brief Connects a free function or an unbound member to a delegate.\n     * @tparam Candidate Function or member to connect to the delegate.\n     *\/\n    template<auto Candidate>\n    void connect() ENTT_NOEXCEPT {\n        data = nullptr;\n\n        if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Args...>) {\n            fn = [](const void *, Args... args) -> Ret {\n                return Ret(std::invoke(Candidate, std::forward<Args>(args)...));\n            };\n        } else if constexpr(std::is_member_pointer_v<decltype(Candidate)>) {\n            fn = wrap<Candidate>(internal::index_sequence_for<std::tuple_element_t<0, std::tuple<Args...>>>(internal::function_pointer_t<decltype(Candidate)>{}));\n        } else {\n            fn = wrap<Candidate>(internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate)>{}));\n        }\n    }\n\n    \/**\n     * @brief Connects a free function with payload or a bound member to a\n     * 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 Function or member to connect to the delegate.\n     * @tparam Type Type of class or type of payload.\n     * @param value_or_instance A valid reference that fits the purpose.\n     *\/\n    template<auto Candidate, typename Type>\n    void connect(Type &value_or_instance) ENTT_NOEXCEPT {\n        data = &value_or_instance;\n\n        if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Type &, Args...>) {\n            fn = [](const void *payload, Args... args) -> Ret {\n                Type *curr = static_cast<Type *>(const_cast<std::conditional_t<std::is_const_v<Type>, const void *, void *>>(payload));\n                return Ret(std::invoke(Candidate, *curr, std::forward<Args>(args)...));\n            };\n        } else {\n            fn = wrap<Candidate>(value_or_instance, internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate), Type>{}));\n        }\n    }\n\n    \/**\n     * @brief Connects a free function with payload or a bound member to a\n     * delegate.\n     *\n     * @sa connect(Type &)\n     *\n     * @tparam Candidate Function or member to connect to the delegate.\n     * @tparam Type Type of class or type of payload.\n     * @param value_or_instance A valid pointer that fits the purpose.\n     *\/\n    template<auto Candidate, typename Type>\n    void connect(Type *value_or_instance) ENTT_NOEXCEPT {\n        data = value_or_instance;\n\n        if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Type *, Args...>) {\n            fn = [](const void *payload, Args... args) -> Ret {\n                Type *curr = static_cast<Type *>(const_cast<std::conditional_t<std::is_const_v<Type>, const void *, void *>>(payload));\n                return Ret(std::invoke(Candidate, curr, std::forward<Args>(args)...));\n            };\n        } else {\n            fn = wrap<Candidate>(value_or_instance, internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate), Type>{}));\n        }\n    }\n\n    \/**\n     * @brief Connects an user defined function with optional payload to a\n     * delegate.\n     *\n     * The delegate isn't responsible for the connected object or the payload.\n     * Users must always guarantee that the lifetime of an instance overcomes\n     * the one of the delegate.<br\/>\n     * The payload is returned as the first argument to the target function in\n     * all cases.\n     *\n     * @param function Function to connect to the delegate.\n     * @param payload User defined arbitrary data.\n     *\/\n    void connect(function_type *function, const void *payload = nullptr) ENTT_NOEXCEPT {\n        fn = function;\n        data = payload;\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    [[nodiscard]] 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.\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<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    [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {\n        \/\/ no need to test also data\n        return !(fn == nullptr);\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    [[nodiscard]] bool operator==(const delegate<Ret(Args...)> &other) const ENTT_NOEXCEPT {\n        return fn == other.fn && data == other.data;\n    }\n\nprivate:\n    function_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>\n[[nodiscard]] bool 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 * @tparam Candidate Function or member to connect to the delegate.\n *\/\ntemplate<auto Candidate>\ndelegate(connect_arg_t<Candidate>) ENTT_NOEXCEPT\n-> delegate<std::remove_pointer_t<internal::function_pointer_t<decltype(Candidate)>>>;\n\n\n\/**\n * @brief Deduction guide.\n * @tparam Candidate Function or member 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 &&) ENTT_NOEXCEPT\n-> delegate<std::remove_pointer_t<internal::function_pointer_t<decltype(Candidate), Type>>>;\n\n\n\/**\n * @brief Deduction guide.\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>\ndelegate(Ret(*)(const void *, Args...), const void * = nullptr) ENTT_NOEXCEPT\n-> delegate<Ret(Args...)>;\n\n\n}\n\n\n#endif\n<commit_msg>delegate: use constness_as_t internally<commit_after>#ifndef ENTT_SIGNAL_DELEGATE_HPP\n#define ENTT_SIGNAL_DELEGATE_HPP\n\n\n#include <tuple>\n#include <cstddef>\n#include <utility>\n#include <functional>\n#include <type_traits>\n#include \"..\/core\/type_traits.hpp\"\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 function_pointer(Ret(*)(Args...)) -> Ret(*)(Args...);\n\n\ntemplate<typename Ret, typename Type, typename... Args, typename Other>\nauto function_pointer(Ret(*)(Type, Args...), Other &&) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Ret, typename... Args, typename... Other>\nauto function_pointer(Ret(Class:: *)(Args...), Other &&...) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Ret, typename... Args, typename... Other>\nauto function_pointer(Ret(Class:: *)(Args...) const, Other &&...) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Type, typename... Other>\nauto function_pointer(Type Class:: *, Other &&...) -> Type(*)();\n\n\ntemplate<typename... Type>\nusing function_pointer_t = decltype(internal::function_pointer(std::declval<Type>()...));\n\n\ntemplate<typename... Class, typename Ret, typename... Args>\n[[nodiscard]] constexpr auto index_sequence_for(Ret(*)(Args...)) {\n    return std::index_sequence_for<Class..., Args...>{};\n}\n\n\n}\n\n\n\/**\n * Internal details not to be documented.\n * @endcond\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>\ninline constexpr 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 a general purpose invoker without memory overhead\n * for free functions possibly with payloads and bound or unbound members.\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    template<auto Candidate, std::size_t... Index>\n    [[nodiscard]] auto wrap(std::index_sequence<Index...>) ENTT_NOEXCEPT {\n        return [](const void *, Args... args) -> Ret {\n            [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);\n            return Ret(std::invoke(Candidate, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(arguments))...));\n        };\n    }\n\n    template<auto Candidate, typename Type, std::size_t... Index>\n    [[nodiscard]] auto wrap(Type &, std::index_sequence<Index...>) ENTT_NOEXCEPT {\n        return [](const void *payload, Args... args) -> Ret {\n            [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);\n            Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));\n            return Ret(std::invoke(Candidate, *curr, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(arguments))...));\n        };\n    }\n\n    template<auto Candidate, typename Type, std::size_t... Index>\n    [[nodiscard]] auto wrap(Type *, std::index_sequence<Index...>) ENTT_NOEXCEPT {\n        return [](const void *payload, Args... args) -> Ret {\n            [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);\n            Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));\n            return Ret(std::invoke(Candidate, curr, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(arguments))...));\n        };\n    }\n\npublic:\n    \/*! @brief Function type of the contained target. *\/\n    using function_type = Ret(const void *, Args...);\n    \/*! @brief Function type of the delegate. *\/\n    using type = Ret(Args...);\n    \/*! @brief Return type of the delegate. *\/\n    using result_type = Ret;\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 or an unbound\n     * member.\n     * @tparam Candidate Function or member to connect to the delegate.\n     *\/\n    template<auto Candidate>\n    delegate(connect_arg_t<Candidate>) ENTT_NOEXCEPT {\n        connect<Candidate>();\n    }\n\n    \/**\n     * @brief Constructs a delegate and connects a free function with payload or\n     * a bound member.\n     * @tparam Candidate Function or member 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        connect<Candidate>(std::forward<Type>(value_or_instance));\n    }\n\n    \/**\n     * @brief Constructs a delegate and connects an user defined function with\n     * optional payload.\n     * @param function Function to connect to the delegate.\n     * @param payload User defined arbitrary data.\n     *\/\n    delegate(function_type *function, const void *payload = nullptr) ENTT_NOEXCEPT {\n        connect(function, payload);\n    }\n\n    \/**\n     * @brief Connects a free function or an unbound member to a delegate.\n     * @tparam Candidate Function or member to connect to the delegate.\n     *\/\n    template<auto Candidate>\n    void connect() ENTT_NOEXCEPT {\n        data = nullptr;\n\n        if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Args...>) {\n            fn = [](const void *, Args... args) -> Ret {\n                return Ret(std::invoke(Candidate, std::forward<Args>(args)...));\n            };\n        } else if constexpr(std::is_member_pointer_v<decltype(Candidate)>) {\n            fn = wrap<Candidate>(internal::index_sequence_for<std::tuple_element_t<0, std::tuple<Args...>>>(internal::function_pointer_t<decltype(Candidate)>{}));\n        } else {\n            fn = wrap<Candidate>(internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate)>{}));\n        }\n    }\n\n    \/**\n     * @brief Connects a free function with payload or a bound member to a\n     * 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 Function or member to connect to the delegate.\n     * @tparam Type Type of class or type of payload.\n     * @param value_or_instance A valid reference that fits the purpose.\n     *\/\n    template<auto Candidate, typename Type>\n    void connect(Type &value_or_instance) ENTT_NOEXCEPT {\n        data = &value_or_instance;\n\n        if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Type &, Args...>) {\n            fn = [](const void *payload, Args... args) -> Ret {\n                Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));\n                return Ret(std::invoke(Candidate, *curr, std::forward<Args>(args)...));\n            };\n        } else {\n            fn = wrap<Candidate>(value_or_instance, internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate), Type>{}));\n        }\n    }\n\n    \/**\n     * @brief Connects a free function with payload or a bound member to a\n     * delegate.\n     *\n     * @sa connect(Type &)\n     *\n     * @tparam Candidate Function or member to connect to the delegate.\n     * @tparam Type Type of class or type of payload.\n     * @param value_or_instance A valid pointer that fits the purpose.\n     *\/\n    template<auto Candidate, typename Type>\n    void connect(Type *value_or_instance) ENTT_NOEXCEPT {\n        data = value_or_instance;\n\n        if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Type *, Args...>) {\n            fn = [](const void *payload, Args... args) -> Ret {\n                Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));\n                return Ret(std::invoke(Candidate, curr, std::forward<Args>(args)...));\n            };\n        } else {\n            fn = wrap<Candidate>(value_or_instance, internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate), Type>{}));\n        }\n    }\n\n    \/**\n     * @brief Connects an user defined function with optional payload to a\n     * delegate.\n     *\n     * The delegate isn't responsible for the connected object or the payload.\n     * Users must always guarantee that the lifetime of an instance overcomes\n     * the one of the delegate.<br\/>\n     * The payload is returned as the first argument to the target function in\n     * all cases.\n     *\n     * @param function Function to connect to the delegate.\n     * @param payload User defined arbitrary data.\n     *\/\n    void connect(function_type *function, const void *payload = nullptr) ENTT_NOEXCEPT {\n        fn = function;\n        data = payload;\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    [[nodiscard]] 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.\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<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    [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {\n        \/\/ no need to test also data\n        return !(fn == nullptr);\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    [[nodiscard]] bool operator==(const delegate<Ret(Args...)> &other) const ENTT_NOEXCEPT {\n        return fn == other.fn && data == other.data;\n    }\n\nprivate:\n    function_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>\n[[nodiscard]] bool 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 * @tparam Candidate Function or member to connect to the delegate.\n *\/\ntemplate<auto Candidate>\ndelegate(connect_arg_t<Candidate>) ENTT_NOEXCEPT\n-> delegate<std::remove_pointer_t<internal::function_pointer_t<decltype(Candidate)>>>;\n\n\n\/**\n * @brief Deduction guide.\n * @tparam Candidate Function or member 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 &&) ENTT_NOEXCEPT\n-> delegate<std::remove_pointer_t<internal::function_pointer_t<decltype(Candidate), Type>>>;\n\n\n\/**\n * @brief Deduction guide.\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>\ndelegate(Ret(*)(const void *, Args...), const void * = nullptr) ENTT_NOEXCEPT\n-> delegate<Ret(Args...)>;\n\n\n}\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Deleting the item from a form autofill popup with just one item would leave an empty autofill popup (not very visible but capturing focus).<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <QMessageBox>\n#include \"newannotationdialog.h\"\n#include \"ui_newannotationdialog.h\"\n#include \"classesdialog.h\"\n\n#include <AnnotatorLib\/Commands\/NewAnnotation.h>\n#include \"plugins\/pluginloader.h\"\n#include \"controller\/commandcontroller.h\"\n\n\nNewAnnotationDialog::NewAnnotationDialog(AnnotatorLib::Session *session,\n                                 unsigned long frame_nmb,\n                                 AnnotatorLib::Object* selected_obj,\n                                 QWidget *parent)\n    : QDialog(parent), session(session), frame_nmb(frame_nmb), selected_obj(selected_obj), ui(new Ui::NewAnnotationDialog) {\n\n  ui->setupUi(this);\n  if (selected_obj == nullptr || session->getFrame(frame_nmb)->getObject(selected_obj) != nullptr ) {\n    ui->radioButtonSelObj->setEnabled(false);\n    ui->radioButtonSelObj->setChecked(false);\n    ui->radioButtonNewObj->setChecked(true);\n    ui->radioButtonNewObj->setEnabled(false);\n  }\n  if (ui->radioButtonNewObj->isChecked()) {\n      this->on_radioButtonNewObj_clicked();\n  } else if (ui->radioButtonSelObj->isChecked()) {\n      this->on_radioButtonSelObj_clicked();\n  }\n  ui->frameSpinBox->setValue(frame_nmb);\n  reloadClasses();\n}\n\nNewAnnotationDialog::~NewAnnotationDialog() { delete ui; }\n\nvoid NewAnnotationDialog::setDimensions(float x, float y, float w, float h) {\n  this->x = x;\n  this->y = y;\n  this->w = w;\n  this->h = h;\n  ui->positionValue->setText(QString::number(w) + \" x \" +\n                             QString::number(h) + \" @ \" +\n                             QString::number(x) + \" | \" +\n                             QString::number(y));\n}\n\nvoid NewAnnotationDialog::createObject() {\n\n  AnnotatorLib::Class * selClass = this->session->getClass(ui->objectClassComboBox->currentText().toStdString());\n  if(selClass == nullptr){\n      (void) QMessageBox::information(this, tr(\"Error\"),\n                                                          tr(\"No such class registered.\"), QMessageBox::Ok);\n      return;\n  }\n\n  AnnotatorLib::Frame *frame = session->getFrame(this->frame_nmb);\n  unsigned long id = (unsigned long)ui->objectIdLineEdit->text().toULong();\n\n  AnnotatorLib::Commands::NewAnnotation *nA;\n  if (this->ui->radioButtonNewObj->isChecked()) {\n    nA = new AnnotatorLib::Commands::NewAnnotation(\n            id, selClass, frame, x, y, w, h, this->session, false);\n  } else {\n    nA = new AnnotatorLib::Commands::NewAnnotation(\n              session->getObject(id), frame, x, y, w, h, this->session, false);\n  }\n  CommandController::instance()->execute(nA);\n\n  Annotator::Plugin *plugin =\n      Annotator::PluginLoader::getInstance().getCurrent();\n  plugin->setObject(nA->getAnnotation()->getObject());\n  plugin->setLastAnnotation(nA->getAnnotation());\n}\n\nvoid NewAnnotationDialog::reloadClasses()\n{\n    ui->objectClassComboBox->clear();\n    for(AnnotatorLib::Class * c: session->getClasses()){\n        ui->objectClassComboBox->addItem(QString::fromStdString(c->getName()));\n    }\n}\n\nvoid NewAnnotationDialog::done(int r) {\n\n  if(QDialog::Accepted == r) {\n    if(!checkValues()) {\n      return;\n    }\n    createObject();\n  }\n  QDialog::done(r);\n}\n\nbool NewAnnotationDialog::checkValues() {\n\n  if (ui->objectIdLineEdit->text().isEmpty()) {\n    (void) QMessageBox::information(this, tr(\"No ID\"),\n        tr(\"Please supply an ID.\"), QMessageBox::Ok);\n    return false;\n  } \n  if (ui->objectClassComboBox->currentText().isEmpty()) {\n    (void) QMessageBox::information(this, tr(\"No Name\"),\n        tr(\"Please supply a class for the object.\"), QMessageBox::Ok);\n    return false;\n  }\n  return true;\n}\n\nvoid NewAnnotationDialog::on_editClassesButton_clicked()\n{\n    ClassesDialog dialog(session, this);\n    dialog.exec();\n    reloadClasses();\n}\n\n\nvoid NewAnnotationDialog::on_radioButtonSelObj_clicked()\n{\n    ui->objectIdLineEdit->setText(QString::number(this->selected_obj->getId()));\n    ui->editClassesButton->hide();\n    ui->objectClassComboBox->setEnabled(false);\n}\n\n\nvoid NewAnnotationDialog::on_radioButtonNewObj_clicked()\n{\n    ui->objectIdLineEdit->setText(QString::number(AnnotatorLib::Object::genId()));\n    ui->editClassesButton->show();\n    ui->objectClassComboBox->setEnabled(true);\n}\n\n<commit_msg>rename<commit_after>#include <QMessageBox>\n#include \"newannotationdialog.h\"\n#include \"ui_newannotationdialog.h\"\n#include \"classesdialog.h\"\n\n#include <AnnotatorLib\/Commands\/NewAnnotation.h>\n#include \"plugins\/pluginloader.h\"\n#include \"controller\/commandcontroller.h\"\n\n\nNewAnnotationDialog::NewAnnotationDialog(AnnotatorLib::Session *session,\n                                 unsigned long frame_nmb,\n                                 AnnotatorLib::Object* selected_obj,\n                                 QWidget *parent)\n    : QDialog(parent), session(session), frame_nmb(frame_nmb), selected_obj(selected_obj), ui(new Ui::NewAnnotationDialog) {\n\n  ui->setupUi(this);\n  if (selected_obj == nullptr || session->getFrame(frame_nmb)->getObject(selected_obj) != nullptr ) {\n    ui->radioButtonSelObj->setEnabled(false);\n    ui->radioButtonSelObj->setChecked(false);\n    ui->radioButtonNewObj->setChecked(true);\n    ui->radioButtonNewObj->setEnabled(false);\n  }\n  if (ui->radioButtonNewObj->isChecked()) {\n      this->on_radioButtonNewObj_clicked();\n  } else if (ui->radioButtonSelObj->isChecked()) {\n      this->on_radioButtonSelObj_clicked();\n  }\n  ui->frameSpinBox->setValue(frame_nmb);\n  reloadClasses();\n}\n\nNewAnnotationDialog::~NewAnnotationDialog() { delete ui; }\n\nvoid NewAnnotationDialog::setDimensions(float x, float y, float w, float h) {\n  this->x = x;\n  this->y = y;\n  this->w = w;\n  this->h = h;\n  ui->positionValue->setText(QString::number(w) + \" x \" +\n                             QString::number(h) + \" @ \" +\n                             QString::number(x) + \" | \" +\n                             QString::number(y));\n}\n\nvoid NewAnnotationDialog::createAnnotation() {\n\n  AnnotatorLib::Class * selClass = this->session->getClass(ui->objectClassComboBox->currentText().toStdString());\n  if(selClass == nullptr){\n      (void) QMessageBox::information(this, tr(\"Error\"),\n                                                          tr(\"No such class registered.\"), QMessageBox::Ok);\n      return;\n  }\n\n  AnnotatorLib::Frame *frame = session->getFrame(this->frame_nmb);\n  unsigned long id = (unsigned long)ui->objectIdLineEdit->text().toULong();\n\n  AnnotatorLib::Commands::NewAnnotation *nA;\n  if (this->ui->radioButtonNewObj->isChecked()) {\n    nA = new AnnotatorLib::Commands::NewAnnotation(\n            id, selClass, frame, x, y, w, h, this->session, false);\n  } else {\n    nA = new AnnotatorLib::Commands::NewAnnotation(\n              session->getObject(id), frame, x, y, w, h, this->session, false);\n  }\n  CommandController::instance()->execute(nA);\n\n  Annotator::Plugin *plugin =\n      Annotator::PluginLoader::getInstance().getCurrent();\n  plugin->setObject(nA->getAnnotation()->getObject());\n  plugin->setLastAnnotation(nA->getAnnotation());\n}\n\nvoid NewAnnotationDialog::reloadClasses()\n{\n    ui->objectClassComboBox->clear();\n    for(AnnotatorLib::Class * c: session->getClasses()){\n        ui->objectClassComboBox->addItem(QString::fromStdString(c->getName()));\n    }\n}\n\nvoid NewAnnotationDialog::done(int r) {\n\n  if(QDialog::Accepted == r) {\n    if(!checkValues()) {\n      return;\n    }\n    createAnnotation();\n  }\n  QDialog::done(r);\n}\n\nbool NewAnnotationDialog::checkValues() {\n\n  if (ui->objectIdLineEdit->text().isEmpty()) {\n    (void) QMessageBox::information(this, tr(\"No ID\"),\n        tr(\"Please supply an ID.\"), QMessageBox::Ok);\n    return false;\n  } \n  if (ui->objectClassComboBox->currentText().isEmpty()) {\n    (void) QMessageBox::information(this, tr(\"No Name\"),\n        tr(\"Please supply a class for the object.\"), QMessageBox::Ok);\n    return false;\n  }\n  return true;\n}\n\nvoid NewAnnotationDialog::on_editClassesButton_clicked()\n{\n    ClassesDialog dialog(session, this);\n    dialog.exec();\n    reloadClasses();\n}\n\n\nvoid NewAnnotationDialog::on_radioButtonSelObj_clicked()\n{\n    ui->objectIdLineEdit->setText(QString::number(this->selected_obj->getId()));\n    ui->editClassesButton->hide();\n    ui->objectClassComboBox->setEnabled(false);\n}\n\n\nvoid NewAnnotationDialog::on_radioButtonNewObj_clicked()\n{\n    ui->objectIdLineEdit->setText(QString::number(AnnotatorLib::Object::genId()));\n    ui->editClassesButton->show();\n    ui->objectClassComboBox->setEnabled(true);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef RAPIDXML_PRINT_HPP_INCLUDED\n#define RAPIDXML_PRINT_HPP_INCLUDED\n\n\/\/ Copyright (C) 2006, 2009 Marcin Kalicinski\n\/\/ Version 1.13\n\/\/ Revision $DateTime: 2009\/05\/13 01:46:17 $\n\/\/! \\file rapidxml_print.hpp This file contains rapidxml printer implementation\n\n#include \"rapidxml.hpp\"\n\n\/\/ Only include streams if not disabled\n#ifndef RAPIDXML_NO_STREAMS\n    #include <ostream>\n    #include <iterator>\n#endif\n\nnamespace rapidxml\n{\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Printing flags\n\n    const int print_no_indenting = 0x1;   \/\/!< Printer flag instructing the printer to suppress indenting of XML. See print() function.\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Internal\n\n    \/\/! \\cond internal\n    namespace internal\n    {\n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ Internal character operations\n    \n        \/\/ Copy characters from given range to given output iterator\n        template<class OutIt, class Ch>\n        inline OutIt copy_chars(const Ch *begin, const Ch *end, OutIt out)\n        {\n            while (begin != end)\n                *out++ = *begin++;\n            return out;\n        }\n        \n        \/\/ Copy characters from given range to given output iterator and expand\n        \/\/ characters into references (&lt; &gt; &apos; &quot; &amp;)\n        template<class OutIt, class Ch>\n        inline OutIt copy_and_expand_chars(const Ch *begin, const Ch *end, Ch noexpand, OutIt out)\n        {\n            while (begin != end)\n            {\n                if (*begin == noexpand)\n                {\n                    *out++ = *begin;    \/\/ No expansion, copy character\n                }\n                else\n                {\n                    switch (*begin)\n                    {\n                    case Ch('<'):\n                        *out++ = Ch('&'); *out++ = Ch('l'); *out++ = Ch('t'); *out++ = Ch(';');\n                        break;\n                    case Ch('>'): \n                        *out++ = Ch('&'); *out++ = Ch('g'); *out++ = Ch('t'); *out++ = Ch(';');\n                        break;\n                    case Ch('\\''): \n                        *out++ = Ch('&'); *out++ = Ch('a'); *out++ = Ch('p'); *out++ = Ch('o'); *out++ = Ch('s'); *out++ = Ch(';');\n                        break;\n                    case Ch('\"'): \n                        *out++ = Ch('&'); *out++ = Ch('q'); *out++ = Ch('u'); *out++ = Ch('o'); *out++ = Ch('t'); *out++ = Ch(';');\n                        break;\n                    case Ch('&'): \n                        *out++ = Ch('&'); *out++ = Ch('a'); *out++ = Ch('m'); *out++ = Ch('p'); *out++ = Ch(';'); \n                        break;\n                    default:\n                        *out++ = *begin;    \/\/ No expansion, copy character\n                    }\n                }\n                ++begin;    \/\/ Step to next character\n            }\n            return out;\n        }\n\n        \/\/ Fill given output iterator with repetitions of the same character\n        template<class OutIt, class Ch>\n        inline OutIt fill_chars(OutIt out, int n, Ch ch)\n        {\n            for (int i = 0; i < n; ++i)\n                *out++ = ch;\n            return out;\n        }\n\n        \/\/ Find character\n        template<class Ch, Ch ch>\n        inline bool find_char(const Ch *begin, const Ch *end)\n        {\n            while (begin != end)\n                if (*begin++ == ch)\n                    return true;\n            return false;\n        }\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ Internal printing operations\n    \n        \/\/ Print node\n        template<class OutIt, class Ch>\n        inline OutIt print_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            \/\/ Print proper node type\n            switch (node->type())\n            {\n\n            \/\/ Document\n            case node_document:\n                out = print_children(out, node, flags, indent);\n                break;\n\n            \/\/ Element\n            case node_element:\n                out = print_element_node(out, node, flags, indent);\n                break;\n            \n            \/\/ Data\n            case node_data:\n                out = print_data_node(out, node, flags, indent);\n                break;\n            \n            \/\/ CDATA\n            case node_cdata:\n                out = print_cdata_node(out, node, flags, indent);\n                break;\n\n            \/\/ Declaration\n            case node_declaration:\n                out = print_declaration_node(out, node, flags, indent);\n                break;\n\n            \/\/ Comment\n            case node_comment:\n                out = print_comment_node(out, node, flags, indent);\n                break;\n            \n            \/\/ Doctype\n            case node_doctype:\n                out = print_doctype_node(out, node, flags, indent);\n                break;\n\n            \/\/ Pi\n            case node_pi:\n                out = print_pi_node(out, node, flags, indent);\n                break;\n\n                \/\/ Unknown\n            default:\n                assert(0);\n                break;\n            }\n            \n            \/\/ If indenting not disabled, add line break after node\n            if (!(flags & print_no_indenting))\n                *out = Ch('\\n'), ++out;\n\n            \/\/ Return modified iterator\n            return out;\n        }\n        \n        \/\/ Print children of the node                               \n        template<class OutIt, class Ch>\n        inline OutIt print_children(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            for (xml_node<Ch> *child = node->first_node(); child; child = child->next_sibling())\n                out = print_node(out, child, flags, indent);\n            return out;\n        }\n\n        \/\/ Print attributes of the node\n        template<class OutIt, class Ch>\n        inline OutIt print_attributes(OutIt out, const xml_node<Ch> *node, int flags)\n        {\n            for (xml_attribute<Ch> *attribute = node->first_attribute(); attribute; attribute = attribute->next_attribute())\n            {\n                if (attribute->name() && attribute->value())\n                {\n                    \/\/ Print attribute name\n                    *out = Ch(' '), ++out;\n                    out = copy_chars(attribute->name(), attribute->name() + attribute->name_size(), out);\n                    *out = Ch('='), ++out;\n                    \/\/ Print attribute value using appropriate quote type\n                    if (find_char<Ch, Ch('\"')>(attribute->value(), attribute->value() + attribute->value_size()))\n                    {\n                        *out = Ch('\\''), ++out;\n                        out = copy_and_expand_chars(attribute->value(), attribute->value() + attribute->value_size(), Ch('\"'), out);\n                        *out = Ch('\\''), ++out;\n                    }\n                    else\n                    {\n                        *out = Ch('\"'), ++out;\n                        out = copy_and_expand_chars(attribute->value(), attribute->value() + attribute->value_size(), Ch('\\''), out);\n                        *out = Ch('\"'), ++out;\n                    }\n                }\n            }\n            return out;\n        }\n\n        \/\/ Print data node\n        template<class OutIt, class Ch>\n        inline OutIt print_data_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_data);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            out = copy_and_expand_chars(node->value(), node->value() + node->value_size(), Ch(0), out);\n            return out;\n        }\n\n        \/\/ Print data node\n        template<class OutIt, class Ch>\n        inline OutIt print_cdata_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_cdata);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'); ++out;\n            *out = Ch('!'); ++out;\n            *out = Ch('['); ++out;\n            *out = Ch('C'); ++out;\n            *out = Ch('D'); ++out;\n            *out = Ch('A'); ++out;\n            *out = Ch('T'); ++out;\n            *out = Ch('A'); ++out;\n            *out = Ch('['); ++out;\n            out = copy_chars(node->value(), node->value() + node->value_size(), out);\n            *out = Ch(']'); ++out;\n            *out = Ch(']'); ++out;\n            *out = Ch('>'); ++out;\n            return out;\n        }\n\n        \/\/ Print element node\n        template<class OutIt, class Ch>\n        inline OutIt print_element_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_element);\n\n            \/\/ Print element name and attributes, if any\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            out = copy_chars(node->name(), node->name() + node->name_size(), out);\n            out = print_attributes(out, node, flags);\n            \n            \/\/ If node is childless\n            if (node->value_size() == 0 && !node->first_node())\n            {\n                \/\/ Print childless node tag ending\n                *out = Ch('\/'), ++out;\n                *out = Ch('>'), ++out;\n            }\n            else\n            {\n                \/\/ Print normal node tag ending\n                *out = Ch('>'), ++out;\n\n                \/\/ Test if node contains a single data node only (and no other nodes)\n                xml_node<Ch> *child = node->first_node();\n                if (!child)\n                {\n                    \/\/ If node has no children, only print its value without indenting\n                    out = copy_and_expand_chars(node->value(), node->value() + node->value_size(), Ch(0), out);\n                }\n                else if (child->next_sibling() == 0 && child->type() == node_data)\n                {\n                    \/\/ If node has a sole data child, only print its value without indenting\n                    out = copy_and_expand_chars(child->value(), child->value() + child->value_size(), Ch(0), out);\n                }\n                else\n                {\n                    \/\/ Print all children with full indenting\n                    if (!(flags & print_no_indenting))\n                        *out = Ch('\\n'), ++out;\n                    out = print_children(out, node, flags, indent + 1);\n                    if (!(flags & print_no_indenting))\n                        out = fill_chars(out, indent, Ch('\\t'));\n                }\n\n                \/\/ Print node end\n                *out = Ch('<'), ++out;\n                *out = Ch('\/'), ++out;\n                out = copy_chars(node->name(), node->name() + node->name_size(), out);\n                *out = Ch('>'), ++out;\n            }\n            return out;\n        }\n\n        \/\/ Print declaration node\n        template<class OutIt, class Ch>\n        inline OutIt print_declaration_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            \/\/ Print declaration start\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            *out = Ch('?'), ++out;\n            *out = Ch('x'), ++out;\n            *out = Ch('m'), ++out;\n            *out = Ch('l'), ++out;\n\n            \/\/ Print attributes\n            out = print_attributes(out, node, flags);\n            \n            \/\/ Print declaration end\n            *out = Ch('?'), ++out;\n            *out = Ch('>'), ++out;\n            \n            return out;\n        }\n\n        \/\/ Print comment node\n        template<class OutIt, class Ch>\n        inline OutIt print_comment_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_comment);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            *out = Ch('!'), ++out;\n            *out = Ch('-'), ++out;\n            *out = Ch('-'), ++out;\n            out = copy_chars(node->value(), node->value() + node->value_size(), out);\n            *out = Ch('-'), ++out;\n            *out = Ch('-'), ++out;\n            *out = Ch('>'), ++out;\n            return out;\n        }\n\n        \/\/ Print doctype node\n        template<class OutIt, class Ch>\n        inline OutIt print_doctype_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_doctype);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            *out = Ch('!'), ++out;\n            *out = Ch('D'), ++out;\n            *out = Ch('O'), ++out;\n            *out = Ch('C'), ++out;\n            *out = Ch('T'), ++out;\n            *out = Ch('Y'), ++out;\n            *out = Ch('P'), ++out;\n            *out = Ch('E'), ++out;\n            *out = Ch(' '), ++out;\n            out = copy_chars(node->value(), node->value() + node->value_size(), out);\n            *out = Ch('>'), ++out;\n            return out;\n        }\n\n        \/\/ Print pi node\n        template<class OutIt, class Ch>\n        inline OutIt print_pi_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_pi);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            *out = Ch('?'), ++out;\n            out = copy_chars(node->name(), node->name() + node->name_size(), out);\n            *out = Ch(' '), ++out;\n            out = copy_chars(node->value(), node->value() + node->value_size(), out);\n            *out = Ch('?'), ++out;\n            *out = Ch('>'), ++out;\n            return out;\n        }\n\n    }\n    \/\/! \\endcond\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Printing\n\n    \/\/! Prints XML to given output iterator.\n    \/\/! \\param out Output iterator to print to.\n    \/\/! \\param node Node to be printed. Pass xml_document to print entire document.\n    \/\/! \\param flags Flags controlling how XML is printed.\n    \/\/! \\return Output iterator pointing to position immediately after last character of printed text.\n    template<class OutIt, class Ch> \n    inline OutIt print(OutIt out, const xml_node<Ch> &node, int flags = 0)\n    {\n        return internal::print_node(out, &node, flags, 0);\n    }\n\n#ifndef RAPIDXML_NO_STREAMS\n\n    \/\/! Prints XML to given output stream.\n    \/\/! \\param out Output stream to print to.\n    \/\/! \\param node Node to be printed. Pass xml_document to print entire document.\n    \/\/! \\param flags Flags controlling how XML is printed.\n    \/\/! \\return Output stream.\n    template<class Ch> \n    inline basic_ostream<Ch> &print(basic_ostream<Ch> &out, const xml_node<Ch> &node, int flags = 0)\n    {\n        print(ostream_iterator<Ch>(out), node, flags);\n        return out;\n    }\n\n    \/\/! Prints formatted XML to given output stream. Uses default printing flags. Use print() function to customize printing process.\n    \/\/! \\param out Output stream to print to.\n    \/\/! \\param node Node to be printed.\n    \/\/! \\return Output stream.\n    template<class Ch> \n    inline basic_ostream<Ch> &operator <<(basic_ostream<Ch> &out, const xml_node<Ch> &node)\n    {\n        return print(out, node);\n    }\n\n#endif\n\n}\n\n#endif\n<commit_msg>Fix for rapidXML print operations.<commit_after>#ifndef RAPIDXML_PRINT_HPP_INCLUDED\n#define RAPIDXML_PRINT_HPP_INCLUDED\n\n\/\/ Copyright (C) 2006, 2009 Marcin Kalicinski\n\/\/ Version 1.13\n\/\/ Revision $DateTime: 2009\/05\/13 01:46:17 $\n\/\/! \\file rapidxml_print.hpp This file contains rapidxml printer implementation\n\n#include \"rapidxml.hpp\"\n\n\/\/ Only include streams if not disabled\n#ifndef RAPIDXML_NO_STREAMS\n    #include <ostream>\n    #include <iterator>\n#endif\n\nnamespace rapidxml\n{\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Printing flags\n\n    const int print_no_indenting = 0x1;   \/\/!< Printer flag instructing the printer to suppress indenting of XML. See print() function.\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Internal\n\n    \/\/! \\cond internal\n    namespace internal\n    {\n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ Internal character operations\n    \n        \/\/ Copy characters from given range to given output iterator\n        template<class OutIt, class Ch>\n        inline OutIt copy_chars(const Ch *begin, const Ch *end, OutIt out)\n        {\n            while (begin != end)\n                *out++ = *begin++;\n            return out;\n        }\n        \n        \/\/ Copy characters from given range to given output iterator and expand\n        \/\/ characters into references (&lt; &gt; &apos; &quot; &amp;)\n        template<class OutIt, class Ch>\n        inline OutIt copy_and_expand_chars(const Ch *begin, const Ch *end, Ch noexpand, OutIt out)\n        {\n            while (begin != end)\n            {\n                if (*begin == noexpand)\n                {\n                    *out++ = *begin;    \/\/ No expansion, copy character\n                }\n                else\n                {\n                    switch (*begin)\n                    {\n                    case Ch('<'):\n                        *out++ = Ch('&'); *out++ = Ch('l'); *out++ = Ch('t'); *out++ = Ch(';');\n                        break;\n                    case Ch('>'): \n                        *out++ = Ch('&'); *out++ = Ch('g'); *out++ = Ch('t'); *out++ = Ch(';');\n                        break;\n                    case Ch('\\''): \n                        *out++ = Ch('&'); *out++ = Ch('a'); *out++ = Ch('p'); *out++ = Ch('o'); *out++ = Ch('s'); *out++ = Ch(';');\n                        break;\n                    case Ch('\"'): \n                        *out++ = Ch('&'); *out++ = Ch('q'); *out++ = Ch('u'); *out++ = Ch('o'); *out++ = Ch('t'); *out++ = Ch(';');\n                        break;\n                    case Ch('&'): \n                        *out++ = Ch('&'); *out++ = Ch('a'); *out++ = Ch('m'); *out++ = Ch('p'); *out++ = Ch(';'); \n                        break;\n                    default:\n                        *out++ = *begin;    \/\/ No expansion, copy character\n                    }\n                }\n                ++begin;    \/\/ Step to next character\n            }\n            return out;\n        }\n\n        \/\/ Fill given output iterator with repetitions of the same character\n        template<class OutIt, class Ch>\n        inline OutIt fill_chars(OutIt out, int n, Ch ch)\n        {\n            for (int i = 0; i < n; ++i)\n                *out++ = ch;\n            return out;\n        }\n\n        \/\/ Find character\n        template<class Ch, Ch ch>\n        inline bool find_char(const Ch *begin, const Ch *end)\n        {\n            while (begin != end)\n                if (*begin++ == ch)\n                    return true;\n            return false;\n        }\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ Internal printing operations\n\n\t\t\t\/\/ ADDED BY CRAIG JEFFREY\n\t\t\t\/\/ January 20th 2016\n\t\t\t\/\/ Fixes name lookup changes noted here https:\/\/gcc.gnu.org\/gcc-4.7\/porting_to.html\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_children(OutIt out, const xml_node<Ch> *node, int flags, int indent);\n\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_attributes(OutIt out, const xml_node<Ch> *node, int flags);\n\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_data_node(OutIt out, const xml_node<Ch> *node, int flags, int indent);\n\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_cdata_node(OutIt out, const xml_node<Ch> *node, int flags, int indent);\n\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_element_node(OutIt out, const xml_node<Ch> *node, int flags, int indent);\n\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_declaration_node(OutIt out, const xml_node<Ch> *node, int flags, int indent);\n\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_comment_node(OutIt out, const xml_node<Ch> *node, int flags, int indent);\n\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_doctype_node(OutIt out, const xml_node<Ch> *node, int flags, int indent);\n\n\t\t\ttemplate<class OutIt, class Ch>\n\t\t\tinline OutIt print_pi_node(OutIt out, const xml_node<Ch> *node, int flags, int indent);\n\t\t\t\/\/ END OF ADDITION\n\n        \/\/ Print node\n        template<class OutIt, class Ch>\n        inline OutIt print_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            \/\/ Print proper node type\n            switch (node->type())\n            {\n\n            \/\/ Document\n            case node_document:\n                out = print_children(out, node, flags, indent);\n                break;\n\n            \/\/ Element\n            case node_element:\n                out = print_element_node(out, node, flags, indent);\n                break;\n            \n            \/\/ Data\n            case node_data:\n                out = print_data_node(out, node, flags, indent);\n                break;\n            \n            \/\/ CDATA\n            case node_cdata:\n                out = print_cdata_node(out, node, flags, indent);\n                break;\n\n            \/\/ Declaration\n            case node_declaration:\n                out = print_declaration_node(out, node, flags, indent);\n                break;\n\n            \/\/ Comment\n            case node_comment:\n                out = print_comment_node(out, node, flags, indent);\n                break;\n            \n            \/\/ Doctype\n            case node_doctype:\n                out = print_doctype_node(out, node, flags, indent);\n                break;\n\n            \/\/ Pi\n            case node_pi:\n                out = print_pi_node(out, node, flags, indent);\n                break;\n\n                \/\/ Unknown\n            default:\n                assert(0);\n                break;\n            }\n            \n            \/\/ If indenting not disabled, add line break after node\n            if (!(flags & print_no_indenting))\n                *out = Ch('\\n'), ++out;\n\n            \/\/ Return modified iterator\n            return out;\n        }\n        \n        \/\/ Print children of the node                               \n        template<class OutIt, class Ch>\n        inline OutIt print_children(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            for (xml_node<Ch> *child = node->first_node(); child; child = child->next_sibling())\n                out = print_node(out, child, flags, indent);\n            return out;\n        }\n\n        \/\/ Print attributes of the node\n        template<class OutIt, class Ch>\n        inline OutIt print_attributes(OutIt out, const xml_node<Ch> *node, int flags)\n        {\n            for (xml_attribute<Ch> *attribute = node->first_attribute(); attribute; attribute = attribute->next_attribute())\n            {\n                if (attribute->name() && attribute->value())\n                {\n                    \/\/ Print attribute name\n                    *out = Ch(' '), ++out;\n                    out = copy_chars(attribute->name(), attribute->name() + attribute->name_size(), out);\n                    *out = Ch('='), ++out;\n                    \/\/ Print attribute value using appropriate quote type\n                    if (find_char<Ch, Ch('\"')>(attribute->value(), attribute->value() + attribute->value_size()))\n                    {\n                        *out = Ch('\\''), ++out;\n                        out = copy_and_expand_chars(attribute->value(), attribute->value() + attribute->value_size(), Ch('\"'), out);\n                        *out = Ch('\\''), ++out;\n                    }\n                    else\n                    {\n                        *out = Ch('\"'), ++out;\n                        out = copy_and_expand_chars(attribute->value(), attribute->value() + attribute->value_size(), Ch('\\''), out);\n                        *out = Ch('\"'), ++out;\n                    }\n                }\n            }\n            return out;\n        }\n\n        \/\/ Print data node\n        template<class OutIt, class Ch>\n        inline OutIt print_data_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_data);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            out = copy_and_expand_chars(node->value(), node->value() + node->value_size(), Ch(0), out);\n            return out;\n        }\n\n        \/\/ Print data node\n        template<class OutIt, class Ch>\n        inline OutIt print_cdata_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_cdata);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'); ++out;\n            *out = Ch('!'); ++out;\n            *out = Ch('['); ++out;\n            *out = Ch('C'); ++out;\n            *out = Ch('D'); ++out;\n            *out = Ch('A'); ++out;\n            *out = Ch('T'); ++out;\n            *out = Ch('A'); ++out;\n            *out = Ch('['); ++out;\n            out = copy_chars(node->value(), node->value() + node->value_size(), out);\n            *out = Ch(']'); ++out;\n            *out = Ch(']'); ++out;\n            *out = Ch('>'); ++out;\n            return out;\n        }\n\n        \/\/ Print element node\n        template<class OutIt, class Ch>\n        inline OutIt print_element_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_element);\n\n            \/\/ Print element name and attributes, if any\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            out = copy_chars(node->name(), node->name() + node->name_size(), out);\n            out = print_attributes(out, node, flags);\n            \n            \/\/ If node is childless\n            if (node->value_size() == 0 && !node->first_node())\n            {\n                \/\/ Print childless node tag ending\n                *out = Ch('\/'), ++out;\n                *out = Ch('>'), ++out;\n            }\n            else\n            {\n                \/\/ Print normal node tag ending\n                *out = Ch('>'), ++out;\n\n                \/\/ Test if node contains a single data node only (and no other nodes)\n                xml_node<Ch> *child = node->first_node();\n                if (!child)\n                {\n                    \/\/ If node has no children, only print its value without indenting\n                    out = copy_and_expand_chars(node->value(), node->value() + node->value_size(), Ch(0), out);\n                }\n                else if (child->next_sibling() == 0 && child->type() == node_data)\n                {\n                    \/\/ If node has a sole data child, only print its value without indenting\n                    out = copy_and_expand_chars(child->value(), child->value() + child->value_size(), Ch(0), out);\n                }\n                else\n                {\n                    \/\/ Print all children with full indenting\n                    if (!(flags & print_no_indenting))\n                        *out = Ch('\\n'), ++out;\n                    out = print_children(out, node, flags, indent + 1);\n                    if (!(flags & print_no_indenting))\n                        out = fill_chars(out, indent, Ch('\\t'));\n                }\n\n                \/\/ Print node end\n                *out = Ch('<'), ++out;\n                *out = Ch('\/'), ++out;\n                out = copy_chars(node->name(), node->name() + node->name_size(), out);\n                *out = Ch('>'), ++out;\n            }\n            return out;\n        }\n\n        \/\/ Print declaration node\n        template<class OutIt, class Ch>\n        inline OutIt print_declaration_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            \/\/ Print declaration start\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            *out = Ch('?'), ++out;\n            *out = Ch('x'), ++out;\n            *out = Ch('m'), ++out;\n            *out = Ch('l'), ++out;\n\n            \/\/ Print attributes\n            out = print_attributes(out, node, flags);\n            \n            \/\/ Print declaration end\n            *out = Ch('?'), ++out;\n            *out = Ch('>'), ++out;\n            \n            return out;\n        }\n\n        \/\/ Print comment node\n        template<class OutIt, class Ch>\n        inline OutIt print_comment_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_comment);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            *out = Ch('!'), ++out;\n            *out = Ch('-'), ++out;\n            *out = Ch('-'), ++out;\n            out = copy_chars(node->value(), node->value() + node->value_size(), out);\n            *out = Ch('-'), ++out;\n            *out = Ch('-'), ++out;\n            *out = Ch('>'), ++out;\n            return out;\n        }\n\n        \/\/ Print doctype node\n        template<class OutIt, class Ch>\n        inline OutIt print_doctype_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_doctype);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            *out = Ch('!'), ++out;\n            *out = Ch('D'), ++out;\n            *out = Ch('O'), ++out;\n            *out = Ch('C'), ++out;\n            *out = Ch('T'), ++out;\n            *out = Ch('Y'), ++out;\n            *out = Ch('P'), ++out;\n            *out = Ch('E'), ++out;\n            *out = Ch(' '), ++out;\n            out = copy_chars(node->value(), node->value() + node->value_size(), out);\n            *out = Ch('>'), ++out;\n            return out;\n        }\n\n        \/\/ Print pi node\n        template<class OutIt, class Ch>\n        inline OutIt print_pi_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)\n        {\n            assert(node->type() == node_pi);\n            if (!(flags & print_no_indenting))\n                out = fill_chars(out, indent, Ch('\\t'));\n            *out = Ch('<'), ++out;\n            *out = Ch('?'), ++out;\n            out = copy_chars(node->name(), node->name() + node->name_size(), out);\n            *out = Ch(' '), ++out;\n            out = copy_chars(node->value(), node->value() + node->value_size(), out);\n            *out = Ch('?'), ++out;\n            *out = Ch('>'), ++out;\n            return out;\n        }\n\n    }\n    \/\/! \\endcond\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Printing\n\n    \/\/! Prints XML to given output iterator.\n    \/\/! \\param out Output iterator to print to.\n    \/\/! \\param node Node to be printed. Pass xml_document to print entire document.\n    \/\/! \\param flags Flags controlling how XML is printed.\n    \/\/! \\return Output iterator pointing to position immediately after last character of printed text.\n    template<class OutIt, class Ch> \n    inline OutIt print(OutIt out, const xml_node<Ch> &node, int flags = 0)\n    {\n        return internal::print_node(out, &node, flags, 0);\n    }\n\n#ifndef RAPIDXML_NO_STREAMS\n\n    \/\/! Prints XML to given output stream.\n    \/\/! \\param out Output stream to print to.\n    \/\/! \\param node Node to be printed. Pass xml_document to print entire document.\n    \/\/! \\param flags Flags controlling how XML is printed.\n    \/\/! \\return Output stream.\n    template<class Ch> \n    inline basic_ostream<Ch> &print(basic_ostream<Ch> &out, const xml_node<Ch> &node, int flags = 0)\n    {\n        print(ostream_iterator<Ch>(out), node, flags);\n        return out;\n    }\n\n    \/\/! Prints formatted XML to given output stream. Uses default printing flags. Use print() function to customize printing process.\n    \/\/! \\param out Output stream to print to.\n    \/\/! \\param node Node to be printed.\n    \/\/! \\return Output stream.\n    template<class Ch> \n    inline basic_ostream<Ch> &operator <<(basic_ostream<Ch> &out, const xml_node<Ch> &node)\n    {\n        return print(out, node);\n    }\n\n#endif\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"application.h\"\nSYSTEM_MODE(MANUAL);\n\n#include \"OledDisplay.h\"\n#include \"RHT03.h\"\n#include \"TMP3x.h\"\n#include \"common.h\"\n#include \"rgbled.h\"\n\n\/\/ function prototypes\nvoid drawPattern();\nvoid drawText();\nvoid drawTemp();\nvoid getTemp();\n\nint btnUp = D6;\nint btnDn = D5;\nint btnHome = D3;\n\nbool btnUpLatch = false;\nbool btnDnLatch = false;\nbool btnHomeLatch = false;\n\ndouble avgTemp = 0.0;\n\nuint drawMode = 0;\nuint textMode = 0;\n\nOledDisplay display = OledDisplay(D1, D2, D0);;\nRHT03 rht = RHT03(D4, D7);\nTMP3x tmp36 = TMP3x(A0, 10, 1000);\n\nvoid setup() {\n\n  pinMode(btnUp, INPUT_PULLUP);\n  pinMode(btnDn, INPUT_PULLUP);\n  pinMode(btnHome, INPUT_PULLUP);\n\n  \/\/ Spark.variable(\"reading\", &reading, DOUBLE);\n  \/\/ Spark.variable(\"volts\", &volts, DOUBLE);\n  \/\/ Spark.variable(\"temp\", &avgTemp, DOUBLE);\n\n  RGB.control(true);\n  RGB.color(0, 0, 0);\n\n  display.begin();\n}\n\nvoid loop() {\n  tmp36.poll();\n  if (rht.poll()) {\n    drawTemp();\n  }\n\n  \/\/ curTime = millis();\n  \/\/ \/\/ get temp once per second\n  \/\/ if (lastTime + 3000 < curTime) {\n  \/\/   lastTime = curTime;\n  \/\/   display.clear(CLEAR_OLED);\n  \/\/   drawTemp();\n  \/\/ }\n\n  if (digitalRead(btnHome) == LOW) {\n    if (btnHomeLatch) { \/\/ only draw once per press\n      drawPattern();\n      btnHomeLatch = false;\n    }\n  } else {\n    btnHomeLatch = true;\n  }\n\n  if (digitalRead(btnUp) == LOW) {\n    RGB.color(0,0,255);\n    if (btnUpLatch) { \/\/ only draw once per press\n      drawTemp();\n      btnUpLatch = false;\n    }\n  } else {\n    btnUpLatch = true;\n  }\n\n  if (digitalRead(btnDn) == LOW) {\n    RGB.color(255,0,0);\n    if (btnDnLatch) { \/\/ only draw once per press\n      drawText();\n      btnDnLatch = false;\n    }\n  } else {\n    btnDnLatch = true;\n  }\n}\n\nvoid initStat() {\n}\n\nvoid drawTemp() {\n  \/\/display.clear(CLEAR_OLED);\n  display.setFont(0);\n  char tempStr[8];\n\n  double ftemp = tmp36.getTempF();\n  ftemp = (ftemp \/ 10);\n  sprintf(tempStr, \"%.1ff a\", ftemp);\n  display.writeText(1, 1, tempStr);\n\n  ftemp = rht.getTempF();\n  ftemp = ftemp \/ 10;\n  sprintf(tempStr, \"%.1ff d\", ftemp);\n  display.writeText(1, 2, tempStr);\n\n  ftemp = rht.getRH();\n  ftemp = ftemp \/ 10;\n  sprintf(tempStr, \"%.1f%%rh\", ftemp);\n  display.writeText(1, 3, tempStr);\n\n  sprintf(tempStr, \"%d.%d  \", rht.getIntCount(), rht.getIgnCount());\n  display.writeText(1, 4, tempStr);\n}\n\nvoid drawPattern() {\n  display.resetPage();\n\n  switch (drawMode) {\n    case 0: \/\/ blank page\n      RGB.color(255,0,0);\n      display.clear(CLEAR_BUFF);\n      break;\n    case 1: \/\/ horizontal lines\n      RGB.color(0,255,0);\n      display.fill(0xaa);\n      break;\n    case 2: \/\/ vertical lines\n      RGB.color(0,0,255);\n      for (int i=0; i<6; i++) {\n        for (int j=0; j<32; j++) {\n          int c = j*2;\n          display.setByte(i, c, 0xff);\n          display.setByte(i, c+1, 0x00);\n        }\n      }\n      break;\n    case 3: {\/\/ count\n      RGB.color(255,255,0);\n      byte val = 0x00;\n      for (int i=0; i<6; i++) {\n        for (int j=0; j<64; j++) {\n          display.setByte(i, j, val++);\n          if (val > 0xff) val = 0x00;\n        }\n      }\n      break;\n    }\n    case 4: \/\/ diagnal lines\n      RGB.color(255,0,255);\n      for (int i=0; i<6; i++) {\n        for (int j=0; j<8; j++) {\n          int c = j*8;\n          display.setByte(i, c,   0x01);\n          display.setByte(i, c+1, 0x02);\n          display.setByte(i, c+2, 0x04);\n          display.setByte(i, c+3, 0x08);\n          display.setByte(i, c+4, 0x10);\n          display.setByte(i, c+5, 0x20);\n          display.setByte(i, c+6, 0x40);\n          display.setByte(i, c+7, 0x80);\n        }\n      }\n      break;\n    case 5: \/\/ progression\n      RGB.color(0,255,255);\n      for (int i=0; i<6; i++) {\n        for (int j=0; j<8; j++) {\n          int c = j*8;\n          display.setByte(i, c,   0x01);\n          display.setByte(i, c+1, 0x03);\n          display.setByte(i, c+2, 0x07);\n          display.setByte(i, c+3, 0x0f);\n          display.setByte(i, c+4, 0x1f);\n          display.setByte(i, c+5, 0x3f);\n          display.setByte(i, c+6, 0x7f);\n          display.setByte(i, c+7, 0xff);\n        }\n      }\n      break;\n  }\n  display.display();\n\n  drawMode += 1;\n  if (drawMode > 5) {\n      drawMode = 0;\n  }\n}\n\nvoid drawText() {\n  display.clear(CLEAR_OLED);\n  display.setFont(textMode);\n  switch (textMode) {\n    case 0: \/\/ small\n    case 1: \/\/ med\n      RGB.color(textMode==0?255:0, textMode==0?0:255, 0);\n      display.writeText(0, 0, \"12345\");\n      display.writeText(1, 1, \"67890\");\n      display.writeText(2, 2, \"Hello\");\n      if (textMode == 0) display.writeText(3, 3, \"World\");\n      break;\n    case 2: \/\/ large\n      RGB.color(0,0,255);\n      display.writeText(0, 0, \"12345\");\n      break;\n  }\n\n  textMode += 1;\n  if (textMode > 1) {\n    textMode = 0;\n  }\n}\n<commit_msg>Updated for new fonts<commit_after>\n#include \"application.h\"\nSYSTEM_MODE(MANUAL);\n\n#include \"rgbled.h\"\n\n#include \"RHT03.h\"\n#include \"TMP3x.h\"\n#include \"OledDisplay.h\"\n#include \"font_lcd6x8.h\"\n#include \"font_lcd11x16.h\"\n#include \"font_12x16_bold.h\"\n#include \"common.h\"\n\n\/\/ function prototypes\nvoid drawPattern();\nvoid drawText();\nvoid drawTemp();\nvoid getTemp();\n\nint btnUp = D6;\nint btnDn = D5;\nint btnHome = D3;\n\nbool btnUpLatch = false;\nbool btnDnLatch = false;\nbool btnHomeLatch = false;\n\ndouble avgTemp = 0.0;\n\nuint drawMode = 0;\nuint textMode = 0;\n\nOledDisplay display = OledDisplay(D1, D2, D0);;\nRHT03 rht = RHT03(D4, D7);\nTMP3x tmp36 = TMP3x(A0, 10, 1000);\n\nconst font_t* font_lcdSm = parseFont(FONT_LCD6X8);\nconst font_t* font_lcdLg = parseFont(FONT_LCD11X16);\nconst font_t* font_bold  = parseFont(FONT_12X16_BOLD);\n\nvoid setup() {\n\n  pinMode(btnUp, INPUT_PULLUP);\n  pinMode(btnDn, INPUT_PULLUP);\n  pinMode(btnHome, INPUT_PULLUP);\n\n  \/\/ Spark.variable(\"reading\", &reading, DOUBLE);\n  \/\/ Spark.variable(\"volts\", &volts, DOUBLE);\n  \/\/ Spark.variable(\"temp\", &avgTemp, DOUBLE);\n\n  RGB.control(true);\n  RGB.color(0, 0, 0);\n\n  display.begin();\n}\n\nvoid loop() {\n  tmp36.poll();\n  if (rht.poll()) {\n    drawTemp();\n  }\n\n  \/\/ curTime = millis();\n  \/\/ \/\/ get temp once per second\n  \/\/ if (lastTime + 3000 < curTime) {\n  \/\/   lastTime = curTime;\n  \/\/   display.clear(CLEAR_OLED);\n  \/\/   drawTemp();\n  \/\/ }\n\n  if (digitalRead(btnHome) == LOW) {\n    if (btnHomeLatch) { \/\/ only draw once per press\n      drawPattern();\n      btnHomeLatch = false;\n    }\n  } else {\n    btnHomeLatch = true;\n  }\n\n  if (digitalRead(btnUp) == LOW) {\n    RGB.color(0,0,255);\n    if (btnUpLatch) { \/\/ only draw once per press\n      drawTemp();\n      btnUpLatch = false;\n    }\n  } else {\n    btnUpLatch = true;\n  }\n\n  if (digitalRead(btnDn) == LOW) {\n    RGB.color(255,0,0);\n    if (btnDnLatch) { \/\/ only draw once per press\n      drawText();\n      btnDnLatch = false;\n    }\n  } else {\n    btnDnLatch = true;\n  }\n}\n\nvoid initStat() {\n}\n\nvoid drawTemp() {\n  display.clear(CLEAR_OLED);\n  display.setFont(font_lcdLg);\n  char tempStr[8];\n\n  double ftemp = tmp36.getTempF();\n  ftemp = (ftemp \/ 10);\n\n  sprintf(tempStr, \"%.1f\\x7f\", ftemp);\n  display.writeText(0, 0, tempStr);\n\n  ftemp = rht.getTempF();\n  ftemp = ftemp \/ 10;\n  sprintf(tempStr, \"%.1f\\x7f\", ftemp);\n  display.writeText(0, 1, tempStr);\n\n  ftemp = rht.getRH();\n  ftemp = ftemp \/ 10;\n  sprintf(tempStr, \"%.1f%%\", ftemp);\n  display.writeText(0, 2, tempStr);\n\n  \/\/ sprintf(tempStr, \"%d.%d  \", rht.getIntCount(), rht.getIgnCount());\n  \/\/ display.writeText(1, 4, tempStr);\n  display.display();\n}\n\nvoid drawPattern() {\n  display.resetPage();\n\n  switch (drawMode) {\n    case 0: \/\/ blank page\n      RGB.color(255,0,0);\n      display.clear(CLEAR_BUFF);\n      break;\n    case 1: \/\/ horizontal lines\n      RGB.color(0,255,0);\n      display.fill(0xaa);\n      break;\n    case 2: \/\/ vertical lines\n      RGB.color(0,0,255);\n      for (int i=0; i<6; i++) {\n        for (int j=0; j<32; j++) {\n          int c = j*2;\n          display.setByte(i, c, 0xff);\n          display.setByte(i, c+1, 0x00);\n        }\n      }\n      break;\n    case 3: {\/\/ count\n      RGB.color(255,255,0);\n      byte val = 0x00;\n      for (int i=0; i<6; i++) {\n        for (int j=0; j<64; j++) {\n          display.setByte(i, j, val++);\n          if (val > 0xff) val = 0x00;\n        }\n      }\n      break;\n    }\n    case 4: \/\/ diagnal lines\n      RGB.color(255,0,255);\n      for (int i=0; i<6; i++) {\n        for (int j=0; j<8; j++) {\n          int c = j*8;\n          display.setByte(i, c,   0x01);\n          display.setByte(i, c+1, 0x02);\n          display.setByte(i, c+2, 0x04);\n          display.setByte(i, c+3, 0x08);\n          display.setByte(i, c+4, 0x10);\n          display.setByte(i, c+5, 0x20);\n          display.setByte(i, c+6, 0x40);\n          display.setByte(i, c+7, 0x80);\n        }\n      }\n      break;\n    case 5: \/\/ progression\n      RGB.color(0,255,255);\n      for (int i=0; i<6; i++) {\n        for (int j=0; j<8; j++) {\n          int c = j*8;\n          display.setByte(i, c,   0x01);\n          display.setByte(i, c+1, 0x03);\n          display.setByte(i, c+2, 0x07);\n          display.setByte(i, c+3, 0x0f);\n          display.setByte(i, c+4, 0x1f);\n          display.setByte(i, c+5, 0x3f);\n          display.setByte(i, c+6, 0x7f);\n          display.setByte(i, c+7, 0xff);\n        }\n      }\n      break;\n  }\n  display.display();\n\n  drawMode += 1;\n  if (drawMode > 5) {\n      drawMode = 0;\n  }\n}\n\nvoid drawText() {\n  display.clear(CLEAR_OLED);\n  \/\/ display.setFont(textMode);\n  switch (textMode) {\n    case 0: \/\/ small\n    case 1: \/\/ med\n    case 2: \/\/ bold\n      \/\/ RGB.color(textMode==0?255:0, textMode==0?0:255, 0);\n      display.writeText(0, 0, \"12345\");\n      display.writeText(0, 1, \"Hello\");\n      display.writeText(0, 2, \"World\");\n      break;\n    case 3: \/\/ large\n    case 4:\n    case 5:\n      \/\/ RGB.color(0,0,255);\n      display.writeText(0, 0, \"12345\");\n      if (textMode < 5) {\n        display.writeText(0, 1, \"67890\");\n      }\n      break;\n  }\n\n  textMode += 1;\n  if (textMode > 5) {\n    textMode = 0;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2017 Advanced Micro Devices, Inc.\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#ifndef GUARD_MIOPEN_GEMM_DRIVER_HPP\n#define GUARD_MIOPEN_GEMM_DRIVER_HPP\n\n#include \"InputFlags.hpp\"\n#include \"driver.hpp\"\n#include <algorithm>\n#include <cstdlib>\n#include <float.h>\n#include <memory>\n#include <miopen\/miopen.h>\n#include <numeric>\n#include <vector>\n\ntemplate <typename T>\nclass GemmDriver : public Driver\n{\n    public:\n    GemmDriver() : Driver() {}\n\n    int AddCmdLineArgs();\n    int ParseCmdLineArgs(int argc, char* argv[]);\n    InputFlags& GetInputFlags() { return inflags; }\n\n    int GetandSetData();\n    std::vector<int> GetInputTensorLengthsFromCmdLine();\n\n    int AllocateBuffersAndCopy();\n\n    int RunForwardGPU();\n\n    int RunBackwardGPU();\n\n    int VerifyBackward();\n    int VerifyForward();\n    ~GemmDriver() {}\n\n    private:\n    InputFlags inflags;\n\n    std::unique_ptr<GPUMem> a_dev;\n    std::unique_ptr<GPUMem> b_dev;\n    std::unique_ptr<GPUMem> c_dev;\n\n    std::vector<T> a;\n    std::vector<T> b;\n    std::vector<T> c;\n    std::vector<T> chost;\n\n    int M, N, K; \/\/ Netlib BLAS dims, user inputs\n    bool transA, transB;\n    T alpha, beta;\n\n    int lda, ldb;\n};\n\ntemplate <typename T>\nint GemmDriver<T>::AddCmdLineArgs()\n{\n    inflags.AddInputFlag(\"forw\", 'F', \"1\", \"Run only Forward Gemm (Default=1)\", \"int\");\n    inflags.AddInputFlag(\"batchsize\", 'b', \"1\", \"batch size for Gemm (Default=1)\", \"int\");\n    inflags.AddInputFlag(\"a_h\", 'm', \"256\", \"Height of A matrix (Default=256)\", \"int\");\n    inflags.AddInputFlag(\"a_w\", 'k', \"256\", \"Width of A matrix (Default=256)\", \"int\");\n    inflags.AddInputFlag(\"b_w\", 'n', \"256\", \"Width of B matrix (Default=256)\", \"int\");\n    inflags.AddInputFlag(\"alpha\", 'A', \"1.0\", \"Gemm alpha (Default=1.0)\", \"double\");\n    inflags.AddInputFlag(\"beta\", 'B', \"0.0\", \"Gemm beta (Default=0.0)\", \"double\");\n    inflags.AddInputFlag(\"transA\", 'u', \"0\", \"Transpose A matrix (Default=0)\", \"int\");\n    inflags.AddInputFlag(\"transB\", 'v', \"0\", \"Transpose B matrix (Default=0)\", \"int\");\n    inflags.AddInputFlag(\"iter\", 'i', \"10\", \"Number of Iterations (Default=10)\", \"int\");\n    inflags.AddInputFlag(\"verify\", 'V', \"0\", \"Verify Each Layer (Default=1)\", \"int\");\n    inflags.AddInputFlag(\"time\", 't', \"0\", \"Time Each Layer (Default=0)\", \"int\");\n\n    return 0;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::ParseCmdLineArgs(int argc, char* argv[])\n{\n    inflags.Parse(argc, argv);\n\n    if(inflags.GetValueInt(\"time\") == 1)\n    {\n        miopenEnableProfiling(GetHandle(), true);\n    }\n    return 0;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::GetandSetData()\n{\n\n    M = inflags.GetValueInt(\"a_h\");\n    K = inflags.GetValueInt(\"a_w\");\n    N = inflags.GetValueInt(\"b_w\");\n\n    transA = inflags.GetValueInt(\"transA\");\n    transB = inflags.GetValueInt(\"transB\");\n\n    alpha = inflags.GetValueDouble(\"alpha\");\n    beta  = inflags.GetValueDouble(\"beta\");\n\n    lda = transA == 0 ? K : M;\n    ldb = transB == 0 ? N : K;\n\n    return (0);\n}\n\ntemplate <typename T>\nint GemmDriver<T>::AllocateBuffersAndCopy()\n{\n\n    size_t a_sz = M * K;\n    size_t b_sz = K * N;\n    size_t c_sz = M * N;\n#if MIOPEN_BACKEND_OPENCL\n    cl_context ctx;\n\n    clGetCommandQueueInfo(q, CL_QUEUE_CONTEXT, sizeof(cl_context), &ctx, NULL);\n#elif MIOPEN_BACKEND_HIP\n    uint32_t ctx = 0;\n#endif\n    a_dev = std::unique_ptr<GPUMem>(new GPUMem(ctx, a_sz, sizeof(T)));\n    b_dev = std::unique_ptr<GPUMem>(new GPUMem(ctx, b_sz, sizeof(T)));\n    c_dev = std::unique_ptr<GPUMem>(new GPUMem(ctx, c_sz, sizeof(T)));\n\n    a     = std::vector<T>(a_sz);\n    b     = std::vector<T>(b_sz);\n    c     = std::vector<T>(c_sz, 0.);\n    chost = std::vector<T>(c_sz, 0.);\n\n    for(int i = 0; i < a_sz; i++)\n    {\n        a[i] = static_cast<T>(static_cast<double>(rand()) * (1.0 \/ RAND_MAX));\n    }\n\n    for(int i = 0; i < b_sz; i++)\n    {\n        b[i] = static_cast<double>((rand()) * (1.0 \/ RAND_MAX) - 0.5) * 0.001;\n    }\n#if MIOPEN_BACKEND_OPENCL\n    cl_int status;\n#elif MIOPEN_BACKEND_HIP\n    int status;\n#endif\n    status = a_dev->ToGPU(q, a.data());\n    status |= b_dev->ToGPU(q, b.data());\n    status |= c_dev->ToGPU(q, c.data());\n\n    if(status != CL_SUCCESS)\n        printf(\"Error copying data to GPU\\n\");\n\n    return miopenStatusSuccess;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::RunForwardGPU()\n{\n\n#if MIOPEN_USE_MIOPENGEMM\n    miopenGemm(GetHandle(),\n               false, \/\/ isDataColMajor\n               transA,\n               transB,\n               M,\n               N,\n               K,\n               &alpha,\n               a_dev->GetMem(),\n               lda,\n               b_dev->GetMem(),\n               ldb,\n               &beta,\n               c_dev->GetMem(),\n               N);\n\n    if(inflags.GetValueInt(\"time\") == 1)\n    {\n        float time = 0.0;\n        miopenGetKernelTime(GetHandle(), &time);\n        printf(\"GPU Kernel Time Gemm Elapsed: %f ms\\n\", time);\n    }\n\n    c_dev->FromGPU(GetStream(), c.data());\n#else\n    std::cerr << \"GEMM is not supported\\n\";\n#endif\n    return miopenStatusSuccess;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::RunBackwardGPU()\n{\n    return (0);\n}\n\ntemplate <typename T>\nint GemmDriver<T>::VerifyForward()\n{\n    return 0;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::VerifyBackward()\n{\n    return 0;\n}\n\n#endif \/\/ GUARD_MIOPEN_GEMM_DRIVER_HPP\n<commit_msg>including gemm api explicitly<commit_after>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2017 Advanced Micro Devices, Inc.\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#ifndef GUARD_MIOPEN_GEMM_DRIVER_HPP\n#define GUARD_MIOPEN_GEMM_DRIVER_HPP\n\n#include \"InputFlags.hpp\"\n#include \"driver.hpp\"\n#include <algorithm>\n#include <cstdlib>\n#include <float.h>\n#include <memory>\n#include <miopen\/miopen.h>\n#include <numeric>\n#include <vector>\n\nmiopenStatus_t miopenGemm(miopenHandle_t handle,\n                          bool isDataColMajor,\n                          bool transA,\n                          bool transB,\n                          int M,\n                          int N,\n                          int K,\n                          const void* alpha,\n                          const void* A,\n                          int lda,\n                          const void* B,\n                          int ldb,\n                          const void* beta,\n                          void* C,\n                          int ldc,\n                          int find);\n\ntemplate <typename T>\nclass GemmDriver : public Driver\n{\n    public:\n    GemmDriver() : Driver() {}\n\n    int AddCmdLineArgs();\n    int ParseCmdLineArgs(int argc, char* argv[]);\n    InputFlags& GetInputFlags() { return inflags; }\n\n    int GetandSetData();\n    std::vector<int> GetInputTensorLengthsFromCmdLine();\n\n    int AllocateBuffersAndCopy();\n\n    int RunForwardGPU();\n\n    int RunBackwardGPU();\n\n    int VerifyBackward();\n    int VerifyForward();\n    ~GemmDriver() {}\n\n    private:\n    InputFlags inflags;\n\n    std::unique_ptr<GPUMem> a_dev;\n    std::unique_ptr<GPUMem> b_dev;\n    std::unique_ptr<GPUMem> c_dev;\n\n    std::vector<T> a;\n    std::vector<T> b;\n    std::vector<T> c;\n    std::vector<T> chost;\n\n    int M, N, K; \/\/ Netlib BLAS dims, user inputs\n    bool transA, transB;\n    T alpha, beta;\n\n    int lda, ldb;\n};\n\ntemplate <typename T>\nint GemmDriver<T>::AddCmdLineArgs()\n{\n    inflags.AddInputFlag(\"forw\", 'F', \"1\", \"Run only Forward Gemm (Default=1)\", \"int\");\n    inflags.AddInputFlag(\"batchsize\", 'b', \"1\", \"batch size for Gemm (Default=1)\", \"int\");\n    inflags.AddInputFlag(\"a_h\", 'm', \"256\", \"Height of A matrix (Default=256)\", \"int\");\n    inflags.AddInputFlag(\"a_w\", 'k', \"256\", \"Width of A matrix (Default=256)\", \"int\");\n    inflags.AddInputFlag(\"b_w\", 'n', \"256\", \"Width of B matrix (Default=256)\", \"int\");\n    inflags.AddInputFlag(\"alpha\", 'A', \"1.0\", \"Gemm alpha (Default=1.0)\", \"double\");\n    inflags.AddInputFlag(\"beta\", 'B', \"0.0\", \"Gemm beta (Default=0.0)\", \"double\");\n    inflags.AddInputFlag(\"transA\", 'u', \"0\", \"Transpose A matrix (Default=0)\", \"int\");\n    inflags.AddInputFlag(\"transB\", 'v', \"0\", \"Transpose B matrix (Default=0)\", \"int\");\n    inflags.AddInputFlag(\"iter\", 'i', \"10\", \"Number of Iterations (Default=10)\", \"int\");\n    inflags.AddInputFlag(\"verify\", 'V', \"0\", \"Verify Each Layer (Default=1)\", \"int\");\n    inflags.AddInputFlag(\"time\", 't', \"0\", \"Time Each Layer (Default=0)\", \"int\");\n\n    return 0;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::ParseCmdLineArgs(int argc, char* argv[])\n{\n    inflags.Parse(argc, argv);\n\n    if(inflags.GetValueInt(\"time\") == 1)\n    {\n        miopenEnableProfiling(GetHandle(), true);\n    }\n    return 0;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::GetandSetData()\n{\n\n    M = inflags.GetValueInt(\"a_h\");\n    K = inflags.GetValueInt(\"a_w\");\n    N = inflags.GetValueInt(\"b_w\");\n\n    transA = inflags.GetValueInt(\"transA\");\n    transB = inflags.GetValueInt(\"transB\");\n\n    alpha = inflags.GetValueDouble(\"alpha\");\n    beta  = inflags.GetValueDouble(\"beta\");\n\n    lda = transA == 0 ? K : M;\n    ldb = transB == 0 ? N : K;\n\n    return (0);\n}\n\ntemplate <typename T>\nint GemmDriver<T>::AllocateBuffersAndCopy()\n{\n\n    size_t a_sz = M * K;\n    size_t b_sz = K * N;\n    size_t c_sz = M * N;\n#if MIOPEN_BACKEND_OPENCL\n    cl_context ctx;\n\n    clGetCommandQueueInfo(q, CL_QUEUE_CONTEXT, sizeof(cl_context), &ctx, NULL);\n#elif MIOPEN_BACKEND_HIP\n    uint32_t ctx = 0;\n#endif\n    a_dev = std::unique_ptr<GPUMem>(new GPUMem(ctx, a_sz, sizeof(T)));\n    b_dev = std::unique_ptr<GPUMem>(new GPUMem(ctx, b_sz, sizeof(T)));\n    c_dev = std::unique_ptr<GPUMem>(new GPUMem(ctx, c_sz, sizeof(T)));\n\n    a     = std::vector<T>(a_sz);\n    b     = std::vector<T>(b_sz);\n    c     = std::vector<T>(c_sz, 0.);\n    chost = std::vector<T>(c_sz, 0.);\n\n    for(int i = 0; i < a_sz; i++)\n    {\n        a[i] = static_cast<T>(static_cast<double>(rand()) * (1.0 \/ RAND_MAX));\n    }\n\n    for(int i = 0; i < b_sz; i++)\n    {\n        b[i] = static_cast<double>((rand()) * (1.0 \/ RAND_MAX) - 0.5) * 0.001;\n    }\n#if MIOPEN_BACKEND_OPENCL\n    cl_int status;\n#elif MIOPEN_BACKEND_HIP\n    int status;\n#endif\n    status = a_dev->ToGPU(q, a.data());\n    status |= b_dev->ToGPU(q, b.data());\n    status |= c_dev->ToGPU(q, c.data());\n\n    if(status != CL_SUCCESS)\n        printf(\"Error copying data to GPU\\n\");\n\n    return miopenStatusSuccess;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::RunForwardGPU()\n{\n\n#if MIOPEN_USE_MIOPENGEMM\n    miopenGemm(GetHandle(),\n               false, \/\/ isDataColMajor\n               transA,\n               transB,\n               M,\n               N,\n               K,\n               &alpha,\n               a_dev->GetMem(),\n               lda,\n               b_dev->GetMem(),\n               ldb,\n               &beta,\n               c_dev->GetMem(),\n               N,\n               0); \/\/ find is off (0)\n\n    if(inflags.GetValueInt(\"time\") == 1)\n    {\n        float time = 0.0;\n        miopenGetKernelTime(GetHandle(), &time);\n        printf(\"GPU Kernel Time Gemm Elapsed: %f ms\\n\", time);\n    }\n\n    c_dev->FromGPU(GetStream(), c.data());\n#else\n    std::cerr << \"GEMM is not supported\\n\";\n#endif\n    return miopenStatusSuccess;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::RunBackwardGPU()\n{\n    return (0);\n}\n\ntemplate <typename T>\nint GemmDriver<T>::VerifyForward()\n{\n    return 0;\n}\n\ntemplate <typename T>\nint GemmDriver<T>::VerifyBackward()\n{\n    return 0;\n}\n\n#endif \/\/ GUARD_MIOPEN_GEMM_DRIVER_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  This file is part of KOrganizer.\n\n  Copyright (c) 2008 Bruno Virlet <bruno.virlet@gmail.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; 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  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 \"monthview.h\"\n#include \"monthscene.h\"\n#include \"monthitem.h\"\n#include \"monthgraphicsitems.h\"\n#include \"koglobals.h\"\n#include \"koprefs.h\"\n#include \"koeventpopupmenu.h\"\n#include \"kohelper.h\"\n\n#include <kcal\/incidence.h>\n#include <kcal\/calendar.h>\n\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QToolButton>\n#include <QWheelEvent>\n#include <QKeyEvent>\n#include <QDate>\n#include <QTimer>\n\nusing namespace KOrg;\n\nMonthView::MonthView( Calendar *calendar, QWidget *parent )\n  : KOEventView( calendar, parent )\n{\n  QHBoxLayout *topLayout = new QHBoxLayout( this );\n\n  mView = new MonthGraphicsView( this );\n\n  mScene = new MonthScene( this, calendar );\n  mView->setScene( mScene );\n  topLayout->addWidget( mView );\n\n  QVBoxLayout *rightLayout = new QVBoxLayout( );\n  rightLayout->setSpacing( 0 );\n  rightLayout->setMargin( 0 );\n\n  \/\/ push buttons to the bottom\n  rightLayout->addStretch( 1 );\n\n  QToolButton *minusMonth = new QToolButton( this );\n  minusMonth->setIcon( KIcon( \"arrow-up-double\" ) );\n  minusMonth->setToolTip( i18n( \"Go back one month\" ) );\n  minusMonth->setAutoRaise( true );\n  connect( minusMonth, SIGNAL(clicked()),\n           this, SLOT(moveBackMonth()) );\n\n  QToolButton *minusWeek = new QToolButton( this );\n  minusWeek->setIcon( KIcon( \"arrow-up\" ) );\n  minusWeek->setToolTip( i18n( \"Go back one week\" ) );\n  minusWeek->setAutoRaise( true );\n  connect( minusWeek, SIGNAL(clicked()),\n           this, SLOT(moveBackWeek()) );\n\n  QToolButton *plusWeek = new QToolButton( this );\n  plusWeek->setIcon( KIcon( \"arrow-down\" ) );\n  plusWeek->setToolTip( i18n( \"Go forward one week\" ) );\n  plusWeek->setAutoRaise( true );\n  connect( plusWeek, SIGNAL(clicked()),\n           this, SLOT(moveFwdWeek()) );\n\n  QToolButton *plusMonth = new QToolButton( this );\n  plusMonth->setIcon( KIcon( \"arrow-down-double\" ) );\n  plusMonth->setToolTip( i18n( \"Go forward one month\" ) );\n  plusMonth->setAutoRaise( true );\n  connect( plusMonth, SIGNAL(clicked()),\n           this, SLOT(moveFwdMonth()) );\n\n  rightLayout->addWidget( minusMonth );\n  rightLayout->addWidget( minusWeek );\n  rightLayout->addWidget( plusWeek );\n  rightLayout->addWidget( plusMonth );\n\n  topLayout->addLayout( rightLayout );\n\n  mViewPopup = eventPopup();\n\n  connect( mScene, SIGNAL(showIncidencePopupSignal(Incidence *,const QDate &)),\n           mViewPopup, SLOT(showIncidencePopup(Incidence *,const QDate &)) );\n\n  connect( mScene, SIGNAL(showNewEventPopupSignal()),\n           SLOT(showNewEventPopup()) );\n\n  connect( mScene, SIGNAL(incidenceSelected(Incidence *)),\n           this, SIGNAL(incidenceSelected(Incidence *)) );\n}\n\nMonthView::~MonthView()\n{\n}\n\nint MonthView::currentDateCount()\n{\n  return mStartDate.daysTo( mEndDate );\n}\n\nint MonthView::maxDatesHint()\n{\n  return 6 * 7;\n}\n\nDateList MonthView::selectedDates()\n{\n  DateList list;\n\n  if ( mScene->selectedCell() ) {\n    list << mScene->selectedCell()->date();\n  }\n\n  return list;\n}\n\nbool MonthView::eventDurationHint( QDateTime &startDt, QDateTime &endDt, bool &allDay )\n{\n  if ( mScene->selectedCell() ) {\n    startDt.setDate( mScene->selectedCell()->date() );\n    endDt.setDate( mScene->selectedCell()->date() );\n    allDay = true;\n    return true;\n  }\n\n  return false;\n}\n\nvoid MonthView::showIncidences( const Incidence::List & )\n{\n}\n\nvoid MonthView::changeIncidenceDisplay( Incidence *incidence, int action )\n{\n  Q_UNUSED( incidence );\n  Q_UNUSED( action );\n\n  \/\/TODO: add some more intelligence here...\n\n  \/\/ don't call reloadIncidences() directly. It would delete all\n  \/\/ MonthItems, but this changeIncidenceDisplay()-method was probably\n  \/\/ called by one of the MonthItem objects. So only shedule a reload\n  \/\/ as event\n  QTimer::singleShot( 0, this, SLOT(reloadIncidences()) );\n}\n\nvoid MonthView::addIncidence( Incidence *incidence )\n{\n  Q_UNUSED( incidence );\n\n  \/\/TODO: add some more intelligence here...\n  reloadIncidences();\n}\n\nvoid MonthView::updateView()\n{\n  mView->update();\n}\n\nvoid MonthView::wheelEvent( QWheelEvent *event )\n{\n  \/\/ invert direction to get scroll-like behaviour\n  if ( event->delta() > 0 ) {\n    moveStartDate( -1, 0 );\n  } else if ( event->delta() < 0 ) {\n    moveStartDate( 1, 0 );\n  }\n\n  \/\/ call accept in every case, we do not want anybody else to react\n  event->accept();\n}\n\nvoid MonthView::keyPressEvent( QKeyEvent *event )\n{\n  if ( event->key() == Qt::Key_PageUp ) {\n    moveStartDate( 0, -1 );\n    event->accept();\n  } else if ( event->key() == Qt::Key_PageDown ) {\n    moveStartDate( 0, 1 );\n    event->accept();\n  } else {\n    event->ignore();\n  }\n}\n\nvoid MonthView::moveBackMonth()\n{\n  moveStartDate( 0, -1 );\n}\n\nvoid MonthView::moveBackWeek()\n{\n  moveStartDate( -1, 0 );\n}\n\nvoid MonthView::moveFwdWeek()\n{\n  moveStartDate( 1, 0 );\n}\n\nvoid MonthView::moveFwdMonth()\n{\n  moveStartDate( 0, 1 );\n}\n\nvoid MonthView::moveStartDate( int weeks, int months )\n{\n  QDate startDate;\n  if ( weeks != 0 ) {\n    startDate = mStartDate.addDays( weeks * 7 );\n  }\n  if ( months != 0 ) {\n    startDate = mStartDate.addMonths( months );\n  }\n\n  setStartDate( startDate );\n}\n\nvoid MonthView::showDates( const QDate &start, const QDate &end )\n{\n  Q_UNUSED( end );\n\n  setStartDate( start );\n}\n\nvoid MonthView::setStartDate( const QDate &start )\n{\n  int weekdayCol = ( start.dayOfWeek() + 7 - KGlobal::locale()->weekStartDay() ) % 7;\n  mStartDate = start.addDays( -weekdayCol );\n\n  mEndDate = mStartDate.addDays( 6 * 7 - 1 );\n\n  \/\/ take \"middle\" day's month as current month\n  mCurrentMonth = mStartDate.addDays( ( 6 * 7 ) \/ 2 ).month();\n\n  reloadIncidences();\n}\n\nvoid MonthView::reloadIncidences()\n{\n  \/\/ keep selection if it exists\n  Incidence *incidenceSelected = 0;\n  if ( mScene->selectedItem() ) {\n    IncidenceMonthItem *tmp = dynamic_cast<IncidenceMonthItem *>( mScene->selectedItem() );\n    if ( tmp ) {\n      incidenceSelected = tmp->incidence();\n    }\n  }\n\n  mScene->resetAll();\n\n  \/\/ build monthcells hash\n  int i = 0;\n  for ( QDate d = mStartDate; d <= mEndDate; d = d.addDays( 1 ) ) {\n    mScene->mMonthCellMap[ d ] = new MonthCell( i, d, mScene );\n    i ++;\n  }\n\n  \/\/ build global event list\n  KDateTime::Spec timeSpec = KOPrefs::instance()->timeSpec();\n  Incidence::List incidences = calendar()->incidences();\n\n  foreach ( Incidence *incidence, incidences ) {\n    \/\/ An event could start before the currently displayed date, so we\n    \/\/ have to check at least those dates before the start date, which would\n    \/\/ cause the event to span into the displayed date range.\n    int offset = 0;\n    Event *event;\n    if ( ( event = dynamic_cast<Event *>( incidence ) ) ) {\n      offset = event->dtStart().daysTo( event->dtEnd() );\n    }\n    for ( QDate d = mStartDate.addDays( -offset ); d <= mEndDate; d = d.addDays( 1 ) ) {\n      if ( incidence->recursOn( d, timeSpec ) ) {\n        MonthItem *manager = new IncidenceMonthItem( mScene, incidence, d );\n        mScene->mManagerList << manager;\n        if ( incidenceSelected == incidence ) {\n          \/\/ If there was an item selected before, reselect it.\n          mScene->selectItem( manager );\n        }\n      }\n    }\n  }\n\n  \/\/ add holidays\n  for ( QDate d = mStartDate; d <= mEndDate; d = d.addDays( 1 ) ) {\n    QStringList holidays( KOGlobals::self()->holiday( d ) );\n    if ( !holidays.isEmpty() ) {\n      MonthItem *holidayItem =\n        new HolidayMonthItem(\n          mScene, d,\n          holidays.join( i18nc( \"delimiter for joining holiday names\", \",\" ) ) );\n      mScene->mManagerList << holidayItem;\n    }\n  }\n\n  \/\/ sort it\n  qSort( mScene->mManagerList.begin(),\n         mScene->mManagerList.end(),\n         MonthItem::greaterThan );\n\n  \/\/ build each month's cell event list\n  foreach ( MonthItem *manager, mScene->mManagerList ) {\n    for ( QDate d = manager->startDate(); d <= manager->endDate(); d = d.addDays( 1 ) ) {\n      MonthCell *cell = mScene->mMonthCellMap.value( d );\n      if ( cell ) {\n        cell->mMonthItemList << manager;\n      }\n    }\n  }\n\n  foreach ( MonthItem *manager, mScene->mManagerList ) {\n    manager->updateMonthGraphicsItems();\n    manager->updatePosition();\n  }\n\n  foreach ( MonthItem *manager, mScene->mManagerList ) {\n    manager->updateGeometry();\n  }\n\n  mScene->setInitialized( true );\n  mView->update();\n  mScene->update();\n}\n\nQDate MonthView::averageDate() const\n{\n  return startDate().addDays( startDate().daysTo( endDate() ) \/ 2 );\n}\n<commit_msg>backport SVN commit 883935 by winterz:<commit_after>\/*\n  This file is part of KOrganizer.\n\n  Copyright (c) 2008 Bruno Virlet <bruno.virlet@gmail.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; 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  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 \"monthview.h\"\n#include \"monthscene.h\"\n#include \"monthitem.h\"\n#include \"monthgraphicsitems.h\"\n#include \"koglobals.h\"\n#include \"koprefs.h\"\n#include \"koeventpopupmenu.h\"\n#include \"kohelper.h\"\n\n#include <kcal\/incidence.h>\n#include <kcal\/calendar.h>\n\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QToolButton>\n#include <QWheelEvent>\n#include <QKeyEvent>\n#include <QDate>\n#include <QTimer>\n\nusing namespace KOrg;\n\nMonthView::MonthView( Calendar *calendar, QWidget *parent )\n  : KOEventView( calendar, parent )\n{\n  QHBoxLayout *topLayout = new QHBoxLayout( this );\n\n  mView = new MonthGraphicsView( this );\n\n  mScene = new MonthScene( this, calendar );\n  mView->setScene( mScene );\n  topLayout->addWidget( mView );\n\n  QVBoxLayout *rightLayout = new QVBoxLayout( );\n  rightLayout->setSpacing( 0 );\n  rightLayout->setMargin( 0 );\n\n  \/\/ push buttons to the bottom\n  rightLayout->addStretch( 1 );\n\n  QToolButton *minusMonth = new QToolButton( this );\n  minusMonth->setIcon( KIcon( \"arrow-up-double\" ) );\n  minusMonth->setToolTip( i18n( \"Go back one month\" ) );\n  minusMonth->setAutoRaise( true );\n  connect( minusMonth, SIGNAL(clicked()),\n           this, SLOT(moveBackMonth()) );\n\n  QToolButton *minusWeek = new QToolButton( this );\n  minusWeek->setIcon( KIcon( \"arrow-up\" ) );\n  minusWeek->setToolTip( i18n( \"Go back one week\" ) );\n  minusWeek->setAutoRaise( true );\n  connect( minusWeek, SIGNAL(clicked()),\n           this, SLOT(moveBackWeek()) );\n\n  QToolButton *plusWeek = new QToolButton( this );\n  plusWeek->setIcon( KIcon( \"arrow-down\" ) );\n  plusWeek->setToolTip( i18n( \"Go forward one week\" ) );\n  plusWeek->setAutoRaise( true );\n  connect( plusWeek, SIGNAL(clicked()),\n           this, SLOT(moveFwdWeek()) );\n\n  QToolButton *plusMonth = new QToolButton( this );\n  plusMonth->setIcon( KIcon( \"arrow-down-double\" ) );\n  plusMonth->setToolTip( i18n( \"Go forward one month\" ) );\n  plusMonth->setAutoRaise( true );\n  connect( plusMonth, SIGNAL(clicked()),\n           this, SLOT(moveFwdMonth()) );\n\n  rightLayout->addWidget( minusMonth );\n  rightLayout->addWidget( minusWeek );\n  rightLayout->addWidget( plusWeek );\n  rightLayout->addWidget( plusMonth );\n\n  topLayout->addLayout( rightLayout );\n\n  mViewPopup = eventPopup();\n\n  connect( mScene, SIGNAL(showIncidencePopupSignal(Incidence *,const QDate &)),\n           mViewPopup, SLOT(showIncidencePopup(Incidence *,const QDate &)) );\n\n  connect( mScene, SIGNAL(showNewEventPopupSignal()),\n           SLOT(showNewEventPopup()) );\n\n  connect( mScene, SIGNAL(incidenceSelected(Incidence *)),\n           this, SIGNAL(incidenceSelected(Incidence *)) );\n}\n\nMonthView::~MonthView()\n{\n}\n\nint MonthView::currentDateCount()\n{\n  return mStartDate.daysTo( mEndDate );\n}\n\nint MonthView::maxDatesHint()\n{\n  return 6 * 7;\n}\n\nDateList MonthView::selectedDates()\n{\n  DateList list;\n\n  if ( mScene->selectedCell() ) {\n    list << mScene->selectedCell()->date();\n  }\n\n  return list;\n}\n\nbool MonthView::eventDurationHint( QDateTime &startDt, QDateTime &endDt, bool &allDay )\n{\n  if ( mScene->selectedCell() ) {\n    startDt.setDate( mScene->selectedCell()->date() );\n    endDt.setDate( mScene->selectedCell()->date() );\n    allDay = true;\n    return true;\n  }\n\n  return false;\n}\n\nvoid MonthView::showIncidences( const Incidence::List & )\n{\n}\n\nvoid MonthView::changeIncidenceDisplay( Incidence *incidence, int action )\n{\n  Q_UNUSED( incidence );\n  Q_UNUSED( action );\n\n  \/\/TODO: add some more intelligence here...\n\n  \/\/ don't call reloadIncidences() directly. It would delete all\n  \/\/ MonthItems, but this changeIncidenceDisplay()-method was probably\n  \/\/ called by one of the MonthItem objects. So only shedule a reload\n  \/\/ as event\n  QTimer::singleShot( 0, this, SLOT(reloadIncidences()) );\n}\n\nvoid MonthView::addIncidence( Incidence *incidence )\n{\n  Q_UNUSED( incidence );\n\n  \/\/TODO: add some more intelligence here...\n  reloadIncidences();\n}\n\nvoid MonthView::updateView()\n{\n  mView->update();\n}\n\nvoid MonthView::wheelEvent( QWheelEvent *event )\n{\n  \/\/ invert direction to get scroll-like behaviour\n  if ( event->delta() > 0 ) {\n    moveStartDate( -1, 0 );\n  } else if ( event->delta() < 0 ) {\n    moveStartDate( 1, 0 );\n  }\n\n  \/\/ call accept in every case, we do not want anybody else to react\n  event->accept();\n}\n\nvoid MonthView::keyPressEvent( QKeyEvent *event )\n{\n  if ( event->key() == Qt::Key_PageUp ) {\n    moveStartDate( 0, -1 );\n    event->accept();\n  } else if ( event->key() == Qt::Key_PageDown ) {\n    moveStartDate( 0, 1 );\n    event->accept();\n  } else {\n    event->ignore();\n  }\n}\n\nvoid MonthView::moveBackMonth()\n{\n  moveStartDate( 0, -1 );\n}\n\nvoid MonthView::moveBackWeek()\n{\n  moveStartDate( -1, 0 );\n}\n\nvoid MonthView::moveFwdWeek()\n{\n  moveStartDate( 1, 0 );\n}\n\nvoid MonthView::moveFwdMonth()\n{\n  moveStartDate( 0, 1 );\n}\n\nvoid MonthView::moveStartDate( int weeks, int months )\n{\n  QDate startDate;\n  if ( weeks != 0 ) {\n    startDate = mStartDate.addDays( weeks * 7 );\n  }\n  if ( months != 0 ) {\n    startDate = mStartDate.addMonths( months );\n  }\n\n  setStartDate( startDate );\n}\n\nvoid MonthView::showDates( const QDate &start, const QDate &end )\n{\n  Q_UNUSED( end );\n\n  setStartDate( start );\n}\n\nvoid MonthView::setStartDate( const QDate &start )\n{\n  int weekdayCol = ( start.dayOfWeek() + 7 - KGlobal::locale()->weekStartDay() ) % 7;\n  mStartDate = start.addDays( -weekdayCol );\n\n  mEndDate = mStartDate.addDays( 6 * 7 - 1 );\n\n  \/\/ take \"middle\" day's month as current month\n  mCurrentMonth = mStartDate.addDays( ( 6 * 7 ) \/ 2 ).month();\n\n  reloadIncidences();\n}\n\nvoid MonthView::reloadIncidences()\n{\n  \/\/ keep selection if it exists\n  Incidence *incidenceSelected = 0;\n  if ( mScene->selectedItem() ) {\n    IncidenceMonthItem *tmp = dynamic_cast<IncidenceMonthItem *>( mScene->selectedItem() );\n    if ( tmp ) {\n      incidenceSelected = tmp->incidence();\n    }\n  }\n\n  mScene->resetAll();\n\n  \/\/ build monthcells hash\n  int i = 0;\n  for ( QDate d = mStartDate; d <= mEndDate; d = d.addDays( 1 ) ) {\n    mScene->mMonthCellMap[ d ] = new MonthCell( i, d, mScene );\n    i ++;\n  }\n\n  \/\/ build global event list\n  KDateTime::Spec timeSpec = KOPrefs::instance()->timeSpec();\n  Incidence::List incidences = calendar()->incidences();\n\n  foreach ( Incidence *incidence, incidences ) {\n    if ( incidence->type() == \"Todo\" && !KOPrefs::instance()->showAllDayTodo() ) {\n      continue;\n    }\n\n    \/\/ An event could start before the currently displayed date, so we\n    \/\/ have to check at least those dates before the start date, which would\n    \/\/ cause the event to span into the displayed date range.\n    int offset = 0;\n    Event *event;\n    if ( ( event = dynamic_cast<Event *>( incidence ) ) ) {\n      offset = event->dtStart().daysTo( event->dtEnd() );\n    }\n    for ( QDate d = mStartDate.addDays( -offset ); d <= mEndDate; d = d.addDays( 1 ) ) {\n      if ( incidence->recursOn( d, timeSpec ) ) {\n        MonthItem *manager = new IncidenceMonthItem( mScene, incidence, d );\n        mScene->mManagerList << manager;\n        if ( incidenceSelected == incidence ) {\n          \/\/ If there was an item selected before, reselect it.\n          mScene->selectItem( manager );\n        }\n      }\n    }\n  }\n\n  \/\/ add holidays\n  for ( QDate d = mStartDate; d <= mEndDate; d = d.addDays( 1 ) ) {\n    QStringList holidays( KOGlobals::self()->holiday( d ) );\n    if ( !holidays.isEmpty() ) {\n      MonthItem *holidayItem =\n        new HolidayMonthItem(\n          mScene, d,\n          holidays.join( i18nc( \"delimiter for joining holiday names\", \",\" ) ) );\n      mScene->mManagerList << holidayItem;\n    }\n  }\n\n  \/\/ sort it\n  qSort( mScene->mManagerList.begin(),\n         mScene->mManagerList.end(),\n         MonthItem::greaterThan );\n\n  \/\/ build each month's cell event list\n  foreach ( MonthItem *manager, mScene->mManagerList ) {\n    for ( QDate d = manager->startDate(); d <= manager->endDate(); d = d.addDays( 1 ) ) {\n      MonthCell *cell = mScene->mMonthCellMap.value( d );\n      if ( cell ) {\n        cell->mMonthItemList << manager;\n      }\n    }\n  }\n\n  foreach ( MonthItem *manager, mScene->mManagerList ) {\n    manager->updateMonthGraphicsItems();\n    manager->updatePosition();\n  }\n\n  foreach ( MonthItem *manager, mScene->mManagerList ) {\n    manager->updateGeometry();\n  }\n\n  mScene->setInitialized( true );\n  mView->update();\n  mScene->update();\n}\n\nQDate MonthView::averageDate() const\n{\n  return startDate().addDays( startDate().daysTo( endDate() ) \/ 2 );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"utils\/rename-existing\/rename-existing-table-model.h\"\n#include <QColor>\n#include <QPixmap>\n#include <QVariant>\n\n\nRenameExistingTableModel::RenameExistingTableModel(const QList<RenameExistingFile> &files, QString folder, QObject *parent)\n\t: QAbstractTableModel(parent), m_files(files), m_folder(folder)\n{}\n\nint RenameExistingTableModel::rowCount(const QModelIndex &parent) const\n{\n\tQ_UNUSED(parent);\n\treturn m_files.count();\n}\n\nint RenameExistingTableModel::columnCount(const QModelIndex &parent) const\n{\n\tQ_UNUSED(parent);\n\treturn 3;\n}\n\nQVariant RenameExistingTableModel::headerData(int section, Qt::Orientation orientation, int role) const\n{\n\tif (role == Qt::DisplayRole && orientation == Qt::Horizontal) {\n\t\tswitch (section)\n\t\t{\n\t\t\tcase 0: return QString(\"Thumbnail\");\n\t\t\tcase 1: return QString(\"Original\");\n\t\t\tcase 2: return QString(\"Destination\");\n\t\t}\n\t}\n\treturn {};\n}\n\nQVariant RenameExistingTableModel::data(const QModelIndex &index, int role) const\n{\n\tconst RenameExistingFile &image = m_files[index.row()];\n\n\t\/\/ Preview in the first column\n\tif (index.column() == 0 && role == Qt::DecorationRole) {\n\t\treturn QPixmap(image.path).scaledToHeight(50, Qt::SmoothTransformation);\n\t}\n\n\t\/\/ Original path in the second column\n\tif (index.column() == 1 && role == Qt::DisplayRole) {\n\t\treturn image.path.right(image.path.length() - m_folder.length() - 1);\n\t}\n\n\t\/\/ New path in the third column\n\tif (index.column() == 3) {\n\t\t\/\/ \"no change\" in red if there isn't\n\t\tif (image.path == image.newPath) {\n\t\t\tif (role == Qt::ForegroundRole) {\n\t\t\t\treturn QVariant::fromValue(QColor(Qt::red));\n\t\t\t}\n\t\t\tif (role == Qt::DisplayRole) {\n\t\t\t\treturn QString(\"No change\");\n\t\t\t}\n\t\t}\n\n\t\tif (Qt::DisplayRole) {\n\t\t\treturn image.newPath.right(image.newPath.length() - m_folder.length() - 1);\n\t\t}\n\t}\n\n\treturn {};\n}\n<commit_msg>Fix new path not showing in 'rename existing' tool (fix #2068)<commit_after>#include \"utils\/rename-existing\/rename-existing-table-model.h\"\n#include <QColor>\n#include <QPixmap>\n#include <QVariant>\n\n\nRenameExistingTableModel::RenameExistingTableModel(const QList<RenameExistingFile> &files, QString folder, QObject *parent)\n\t: QAbstractTableModel(parent), m_files(files), m_folder(folder)\n{}\n\nint RenameExistingTableModel::rowCount(const QModelIndex &parent) const\n{\n\tQ_UNUSED(parent);\n\treturn m_files.count();\n}\n\nint RenameExistingTableModel::columnCount(const QModelIndex &parent) const\n{\n\tQ_UNUSED(parent);\n\treturn 3;\n}\n\nQVariant RenameExistingTableModel::headerData(int section, Qt::Orientation orientation, int role) const\n{\n\tif (role == Qt::DisplayRole && orientation == Qt::Horizontal) {\n\t\tswitch (section)\n\t\t{\n\t\t\tcase 0: return QString(\"Thumbnail\");\n\t\t\tcase 1: return QString(\"Original\");\n\t\t\tcase 2: return QString(\"Destination\");\n\t\t}\n\t}\n\treturn {};\n}\n\nQVariant RenameExistingTableModel::data(const QModelIndex &index, int role) const\n{\n\tconst RenameExistingFile &image = m_files[index.row()];\n\n\t\/\/ Preview in the first column\n\tif (index.column() == 0 && role == Qt::DecorationRole) {\n\t\treturn QPixmap(image.path).scaledToHeight(50, Qt::SmoothTransformation);\n\t}\n\n\t\/\/ Original path in the second column\n\tif (index.column() == 1 && role == Qt::DisplayRole) {\n\t\treturn image.path.right(image.path.length() - m_folder.length() - 1);\n\t}\n\n\t\/\/ New path in the third column\n\tif (index.column() == 2) {\n\t\t\/\/ \"no change\" in red if there isn't\n\t\tif (image.path == image.newPath) {\n\t\t\tif (role == Qt::ForegroundRole) {\n\t\t\t\treturn QVariant::fromValue(QColor(Qt::red));\n\t\t\t}\n\t\t\tif (role == Qt::DisplayRole) {\n\t\t\t\treturn QString(\"No change\");\n\t\t\t}\n\t\t}\n\n\t\tif (role == Qt::DisplayRole) {\n\t\t\treturn image.newPath.right(image.newPath.length() - m_folder.length() - 1);\n\t\t}\n\t}\n\n\treturn {};\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\/initfiles\/p9_fbc_ioo_dl_scom.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#include \"p9_fbc_ioo_dl_scom.H\"\n#include <stdint.h>\n#include <stddef.h>\n#include <fapi2.H>\n\nusing namespace fapi2;\n\nconstexpr uint64_t literal_0x0B = 0x0B;\nconstexpr uint64_t literal_0x0 = 0x0;\nconstexpr uint64_t literal_0xF = 0xF;\nconstexpr uint64_t literal_0b0000000 = 0b0000000;\n\nfapi2::ReturnCode p9_fbc_ioo_dl_scom(const fapi2::Target<fapi2::TARGET_TYPE_OBUS>& TGT0,\n                                     const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& TGT1)\n{\n    {\n        fapi2::ATTR_EC_Type   l_chip_ec;\n        fapi2::ATTR_NAME_Type l_chip_id;\n        FAPI_TRY(FAPI_ATTR_GET_PRIVILEGED(fapi2::ATTR_NAME, TGT1, l_chip_id));\n        FAPI_TRY(FAPI_ATTR_GET_PRIVILEGED(fapi2::ATTR_EC, TGT1, l_chip_ec));\n        fapi2::ATTR_OPTICS_CONFIG_MODE_Type l_TGT0_ATTR_OPTICS_CONFIG_MODE;\n        FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_OPTICS_CONFIG_MODE, TGT0, l_TGT0_ATTR_OPTICS_CONFIG_MODE));\n        uint64_t l_def_OBUS_NV_ENABLED = (l_TGT0_ATTR_OPTICS_CONFIG_MODE == fapi2::ENUM_ATTR_OPTICS_CONFIG_MODE_NV);\n        uint64_t l_def_OBUS_FBC_ENABLED = (l_TGT0_ATTR_OPTICS_CONFIG_MODE == fapi2::ENUM_ATTR_OPTICS_CONFIG_MODE_SMP);\n        fapi2::buffer<uint64_t> l_scom_buffer;\n        {\n            FAPI_TRY(fapi2::getScom( TGT0, 0x901080aull, l_scom_buffer ));\n\n            constexpr auto l_PB_IOO_LL0_CONFIG_LINK_PAIR_ON = 0x1;\n            l_scom_buffer.insert<0, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK_PAIR_ON );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x10)) )\n            {\n                l_scom_buffer.insert<12, 4, 60, uint64_t>(literal_0x0B );\n            }\n            else if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21))\n                     || ((l_chip_id == 0x5) && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                l_scom_buffer.insert<11, 5, 59, uint64_t>(literal_0x0B );\n            }\n\n            l_scom_buffer.insert<28, 4, 60, uint64_t>(literal_0x0 );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                l_scom_buffer.insert<32, 4, 60, uint64_t>(literal_0x0 );\n            }\n\n            constexpr auto l_PB_IOO_LL0_CONFIG_CRC_LANE_ID_ON = 0x1;\n            l_scom_buffer.insert<2, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_CRC_LANE_ID_ON );\n            constexpr auto l_PB_IOO_LL0_CONFIG_SL_UE_CRC_ERR_ON = 0x1;\n            l_scom_buffer.insert<4, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_SL_UE_CRC_ERR_ON );\n            FAPI_TRY(fapi2::putScom(TGT0, 0x901080aull, l_scom_buffer));\n        }\n        {\n            FAPI_TRY(fapi2::getScom( TGT0, 0x901080cull, l_scom_buffer ));\n\n            if (l_def_OBUS_NV_ENABLED)\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV0_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<61, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV0_NPU_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV1_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<62, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV1_NPU_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV2_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<63, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV2_NPU_ENABLED_ON );\n            }\n\n            if (l_def_OBUS_FBC_ENABLED)\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK0_OLL_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<58, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK0_OLL_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK1_OLL_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<59, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK1_OLL_ENABLED_ON );\n            }\n\n            l_scom_buffer.insert<4, 4, 60, uint64_t>(literal_0xF );\n            FAPI_TRY(fapi2::putScom(TGT0, 0x901080cull, l_scom_buffer));\n        }\n        {\n            FAPI_TRY(fapi2::getScom( TGT0, 0x901080full, l_scom_buffer ));\n\n            if (l_def_OBUS_NV_ENABLED)\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV0_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<61, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV0_NPU_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV1_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<62, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV1_NPU_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV2_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<63, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV2_NPU_ENABLED_ON );\n            }\n\n            if (l_def_OBUS_FBC_ENABLED)\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK0_OLL_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<58, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK0_OLL_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK1_OLL_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<59, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK1_OLL_ENABLED_ON );\n            }\n\n            l_scom_buffer.insert<4, 4, 60, uint64_t>(literal_0x0 );\n            l_scom_buffer.insert<9, 7, 57, uint64_t>(literal_0b0000000 );\n            constexpr auto l_PB_IOO_LL0_CONFIG_ELEVEN_LANE_MODE_ON = 0x1;\n            l_scom_buffer.insert<37, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_ELEVEN_LANE_MODE_ON );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_FAST_ASYNC_CROSS_ON = 0x1;\n                l_scom_buffer.insert<59, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_FAST_ASYNC_CROSS_ON );\n            }\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK_FAIL_CRC_ERROR_ON = 0x1;\n                l_scom_buffer.insert<3, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK_FAIL_CRC_ERROR_ON );\n            }\n\n            l_scom_buffer.insert<20, 4, 60, uint64_t>(literal_0x0 );\n            l_scom_buffer.insert<25, 7, 57, uint64_t>(literal_0b0000000 );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK_FAIL_NO_SPARE_ON = 0x1;\n                l_scom_buffer.insert<2, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK_FAIL_NO_SPARE_ON );\n            }\n\n            constexpr auto l_PB_IOO_LL0_CONFIG_REPLAY_BUFFER_SIZE_REPLAY_255 = 0x2;\n            l_scom_buffer.insert<56, 2, 62, uint64_t>(l_PB_IOO_LL0_CONFIG_REPLAY_BUFFER_SIZE_REPLAY_255 );\n            constexpr auto l_PB_IOO_LL0_LINK1_ELEVEN_LANE_SHIFT_ON = 0x1;\n            l_scom_buffer.insert<39, 1, 63, uint64_t>(l_PB_IOO_LL0_LINK1_ELEVEN_LANE_SHIFT_ON );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                constexpr auto l_PB_IOO_LL0_LINK1_RX_LANE_SWAP_ON = 0x1;\n                l_scom_buffer.insert<42, 1, 63, uint64_t>(l_PB_IOO_LL0_LINK1_RX_LANE_SWAP_ON );\n            }\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                constexpr auto l_PB_IOO_LL0_LINK1_TX_LANE_SWAP_ON = 0x1;\n                l_scom_buffer.insert<43, 1, 63, uint64_t>(l_PB_IOO_LL0_LINK1_TX_LANE_SWAP_ON );\n            }\n\n            FAPI_TRY(fapi2::putScom(TGT0, 0x901080full, l_scom_buffer));\n        }\n\n    };\nfapi_try_exit:\n    return fapi2::current_err;\n}\n<commit_msg>Adding p9c_11 support.<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/initfiles\/p9_fbc_ioo_dl_scom.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#include \"p9_fbc_ioo_dl_scom.H\"\n#include <stdint.h>\n#include <stddef.h>\n#include <fapi2.H>\n\nusing namespace fapi2;\n\nconstexpr uint64_t literal_0x0B = 0x0B;\nconstexpr uint64_t literal_0x0 = 0x0;\nconstexpr uint64_t literal_0xF = 0xF;\nconstexpr uint64_t literal_0b0000000 = 0b0000000;\n\nfapi2::ReturnCode p9_fbc_ioo_dl_scom(const fapi2::Target<fapi2::TARGET_TYPE_OBUS>& TGT0,\n                                     const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& TGT1)\n{\n    {\n        fapi2::ATTR_EC_Type   l_chip_ec;\n        fapi2::ATTR_NAME_Type l_chip_id;\n        FAPI_TRY(FAPI_ATTR_GET_PRIVILEGED(fapi2::ATTR_NAME, TGT1, l_chip_id));\n        FAPI_TRY(FAPI_ATTR_GET_PRIVILEGED(fapi2::ATTR_EC, TGT1, l_chip_ec));\n        fapi2::ATTR_OPTICS_CONFIG_MODE_Type l_TGT0_ATTR_OPTICS_CONFIG_MODE;\n        FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_OPTICS_CONFIG_MODE, TGT0, l_TGT0_ATTR_OPTICS_CONFIG_MODE));\n        uint64_t l_def_OBUS_NV_ENABLED = (l_TGT0_ATTR_OPTICS_CONFIG_MODE == fapi2::ENUM_ATTR_OPTICS_CONFIG_MODE_NV);\n        uint64_t l_def_OBUS_FBC_ENABLED = (l_TGT0_ATTR_OPTICS_CONFIG_MODE == fapi2::ENUM_ATTR_OPTICS_CONFIG_MODE_SMP);\n        fapi2::buffer<uint64_t> l_scom_buffer;\n        {\n            FAPI_TRY(fapi2::getScom( TGT0, 0x901080aull, l_scom_buffer ));\n\n            constexpr auto l_PB_IOO_LL0_CONFIG_LINK_PAIR_ON = 0x1;\n            l_scom_buffer.insert<0, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK_PAIR_ON );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x10)) )\n            {\n                l_scom_buffer.insert<12, 4, 60, uint64_t>(literal_0x0B );\n            }\n            else if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21))\n                     || ((l_chip_id == 0x5) && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) || ((l_chip_id == 0x6)\n                             && (l_chip_ec == 0x11)) )\n            {\n                l_scom_buffer.insert<11, 5, 59, uint64_t>(literal_0x0B );\n            }\n\n            l_scom_buffer.insert<28, 4, 60, uint64_t>(literal_0x0 );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x11)) )\n            {\n                l_scom_buffer.insert<32, 4, 60, uint64_t>(literal_0x0 );\n            }\n\n            constexpr auto l_PB_IOO_LL0_CONFIG_CRC_LANE_ID_ON = 0x1;\n            l_scom_buffer.insert<2, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_CRC_LANE_ID_ON );\n            constexpr auto l_PB_IOO_LL0_CONFIG_SL_UE_CRC_ERR_ON = 0x1;\n            l_scom_buffer.insert<4, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_SL_UE_CRC_ERR_ON );\n            FAPI_TRY(fapi2::putScom(TGT0, 0x901080aull, l_scom_buffer));\n        }\n        {\n            FAPI_TRY(fapi2::getScom( TGT0, 0x901080cull, l_scom_buffer ));\n\n            if (l_def_OBUS_NV_ENABLED)\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV0_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<61, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV0_NPU_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV1_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<62, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV1_NPU_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV2_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<63, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV2_NPU_ENABLED_ON );\n            }\n\n            if (l_def_OBUS_FBC_ENABLED)\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK0_OLL_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<58, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK0_OLL_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK1_OLL_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<59, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK1_OLL_ENABLED_ON );\n            }\n\n            l_scom_buffer.insert<4, 4, 60, uint64_t>(literal_0xF );\n            FAPI_TRY(fapi2::putScom(TGT0, 0x901080cull, l_scom_buffer));\n        }\n        {\n            FAPI_TRY(fapi2::getScom( TGT0, 0x901080full, l_scom_buffer ));\n\n            if (l_def_OBUS_NV_ENABLED)\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV0_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<61, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV0_NPU_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV1_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<62, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV1_NPU_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_NV2_NPU_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<63, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_NV2_NPU_ENABLED_ON );\n            }\n\n            if (l_def_OBUS_FBC_ENABLED)\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK0_OLL_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<58, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK0_OLL_ENABLED_ON );\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK1_OLL_ENABLED_ON = 0x1;\n                l_scom_buffer.insert<59, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK1_OLL_ENABLED_ON );\n            }\n\n            l_scom_buffer.insert<4, 4, 60, uint64_t>(literal_0x0 );\n            l_scom_buffer.insert<9, 7, 57, uint64_t>(literal_0b0000000 );\n            constexpr auto l_PB_IOO_LL0_CONFIG_ELEVEN_LANE_MODE_ON = 0x1;\n            l_scom_buffer.insert<37, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_ELEVEN_LANE_MODE_ON );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x11)) )\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_FAST_ASYNC_CROSS_ON = 0x1;\n                l_scom_buffer.insert<59, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_FAST_ASYNC_CROSS_ON );\n            }\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x11)) )\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK_FAIL_CRC_ERROR_ON = 0x1;\n                l_scom_buffer.insert<3, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK_FAIL_CRC_ERROR_ON );\n            }\n\n            l_scom_buffer.insert<20, 4, 60, uint64_t>(literal_0x0 );\n            l_scom_buffer.insert<25, 7, 57, uint64_t>(literal_0b0000000 );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x11)) )\n            {\n                constexpr auto l_PB_IOO_LL0_CONFIG_LINK_FAIL_NO_SPARE_ON = 0x1;\n                l_scom_buffer.insert<2, 1, 63, uint64_t>(l_PB_IOO_LL0_CONFIG_LINK_FAIL_NO_SPARE_ON );\n            }\n\n            constexpr auto l_PB_IOO_LL0_CONFIG_REPLAY_BUFFER_SIZE_REPLAY_255 = 0x2;\n            l_scom_buffer.insert<56, 2, 62, uint64_t>(l_PB_IOO_LL0_CONFIG_REPLAY_BUFFER_SIZE_REPLAY_255 );\n            constexpr auto l_PB_IOO_LL0_LINK1_ELEVEN_LANE_SHIFT_ON = 0x1;\n            l_scom_buffer.insert<39, 1, 63, uint64_t>(l_PB_IOO_LL0_LINK1_ELEVEN_LANE_SHIFT_ON );\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                constexpr auto l_PB_IOO_LL0_LINK1_RX_LANE_SWAP_ON = 0x1;\n                l_scom_buffer.insert<42, 1, 63, uint64_t>(l_PB_IOO_LL0_LINK1_RX_LANE_SWAP_ON );\n            }\n\n            if (((l_chip_id == 0x5) && (l_chip_ec == 0x20)) || ((l_chip_id == 0x5) && (l_chip_ec == 0x21)) || ((l_chip_id == 0x5)\n                    && (l_chip_ec == 0x22)) || ((l_chip_id == 0x6) && (l_chip_ec == 0x10)) )\n            {\n                constexpr auto l_PB_IOO_LL0_LINK1_TX_LANE_SWAP_ON = 0x1;\n                l_scom_buffer.insert<43, 1, 63, uint64_t>(l_PB_IOO_LL0_LINK1_TX_LANE_SWAP_ON );\n            }\n\n            FAPI_TRY(fapi2::putScom(TGT0, 0x901080full, l_scom_buffer));\n        }\n\n    };\nfapi_try_exit:\n    return fapi2::current_err;\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\/eff_config\/timing.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#include <fapi2.H>\n#include <mss.H>\n#include <lib\/utils\/find.H>\n#include <lib\/eff_config\/timing.H>\n\nnamespace mss\n{\n\n\/\/ Proposed DDR4 Full spec update(79-4A)\n\/\/ Item No. 1716.78C\n\/\/ pg.46\n\/\/ Table 24 - tREFI and tRFC parameters\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TREFI_BASE =\n{\n    \/\/ { density in GBs, tREFI(base) in nanoseconds }\n    {2, 7800},\n    {4, 7800},\n    {8, 7800},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 Full spec update(79-4A)\n\/\/ Item No. 1716.78C\n\/\/ pg.46\n\/\/ Table 24 - tREFI and tRFC parameters\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC1_MIN =\n{\n    \/\/ { density in GBs, tRFC1(min) in nanoseconds }\n    {2, 160},\n    {4, 260},\n    {8, 350},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 Full spec update(79-4A)\n\/\/ Item No. 1716.78C\n\/\/ pg.46\n\/\/ Table 24 - tREFI and tRFC parameters\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC2_MIN =\n{\n    \/\/ { density in GBs, tRFC2(min) in nanoseconds }\n    {2, 110},\n    {4, 160},\n    {8, 260},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 Full spec update(79-4A)\n\/\/ Item No. 1716.78C\n\/\/ pg.46\n\/\/ Table 24 - tREFI and tRFC parameters\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC4_MIN =\n{\n    \/\/ { density in GBs, tRFC4(min) in nanoseconds }\n    {2, 90},\n    {4, 110},\n    {8, 160},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 3DS Addendum\n\/\/ Item No. 1727.58A\n\/\/ pg. 69 - 71\n\/\/ Table 42 - Refresh parameters by logical rank density\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC_DLR1 =\n{\n    \/\/ { density in GBs, tRFC4(min) in nanoseconds }\n    {4, 90},\n    {8, 120},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 3DS Addendum\n\/\/ Item No. 1727.58A\n\/\/ pg. 69 - 71\n\/\/ Table 42 - Refresh parameters by logical rank density\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC_DLR2 =\n{\n    \/\/ { density in GBs, tRFC4(min) in nanoseconds }\n    {4, 55},\n    {8, 90}\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 3DS Addendum\n\/\/ Item No. 1727.58A\n\/\/ pg. 69 - 71\n\/\/ Table 42 - Refresh parameters by logical rank density\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC_DLR4 =\n{\n    \/\/ { density in GBs, tRFC4(min) in nanoseconds }\n    {4, 40},\n    {8, 55}\n    \/\/ 16Gb - TBD\n};\n\n\/\/\/ @brief Calculates refresh interval time 1 (tREFI 1)\n\/\/\/ @param[in] i_target FAPI2 target\n\/\/\/ @param[out] o_value timing val in ps\n\/\/\/ @return fapi2::ReturnCode\n\/\/\/\nfapi2::ReturnCode calc_trefi1(const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n                              uint64_t& o_value)\n{\n    uint8_t  l_quotient = 0;\n    uint8_t l_remainder = 0;\n    uint64_t l_output = 0;\n    uint8_t l_temp_ref_range = 0;\n    uint8_t l_dram_density = 0;\n    bool l_found_value = true;\n\n    FAPI_TRY( mss::eff_dram_density(i_target, l_dram_density) );\n    FAPI_TRY( mss::mrw_temp_ref_range(l_temp_ref_range) );\n\n    switch(l_temp_ref_range)\n    {\n        case fapi2::ENUM_ATTR_MRW_TEMP_REF_RANGE_NORMAL:\n            l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_ref_range,\n                                                  \"Could not find sdram density given\"\n                                                  \"normal temp_ref_range.\") );\n            break;\n\n        case fapi2::ENUM_ATTR_MRW_TEMP_REF_RANGE_EXTEND:\n            l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_ref_range,\n                                                  \"Could not find sdram density given\"\n                                                  \"extended temp_ref_range.\") );\n            l_quotient = l_output \/ 2;\n            l_remainder = l_output % 2;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        default:\n            \/\/ l_temp_ref_range will be a platform attribute set by the MRW,\n            \/\/ which they \"shouldn't\" mess up as long as use \"attribute\" enums.\n            \/\/ if openpower messes this up we can at least catch it\n            FAPI_ASSERT(false,\n                        fapi2::MSS_INVALID_TEMP_REF_RANGE().\n                        set_TEMP_REF_RANGE(l_temp_ref_range),\n                        \"%s Incorrect Temperature Ref. Range received: %d \",\n                        mss::c_str(i_target),\n                        l_temp_ref_range);\n\n            break;\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/ @brief Calculates refresh interval time 2 (tREFI 2)\n\/\/\/ @param[in] i_target FAPI2 target\n\/\/\/ @param[out] o_value timing val in ps\n\/\/\/ @return fapi2::ReturnCode\n\/\/\/\nfapi2::ReturnCode calc_trefi2(const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n                              uint64_t& o_value)\n{\n    uint8_t l_quotient = 0;\n    uint8_t l_remainder = 0;\n    uint64_t l_output = 0;\n    uint8_t l_temp_ref_range = 0;\n    uint8_t l_dram_density = 0;\n    bool l_found_value = true;\n\n    FAPI_TRY( mss::mrw_temp_ref_range(l_temp_ref_range) );\n    FAPI_TRY( mss::eff_dram_density(i_target, l_dram_density) );\n\n    switch(l_temp_ref_range)\n    {\n        case fapi2::ENUM_ATTR_MRW_TEMP_REF_RANGE_NORMAL:\n            l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_ref_range,\n                                                  \"Could not find sdram density given\"\n                                                  \"normal temp_ref_range.\") );\n\n            l_remainder = l_output % 2;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        case fapi2::ENUM_ATTR_MRW_TEMP_REF_RANGE_EXTEND:\n            l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_ref_range,\n                                                  \"Could not find sdram density given\"\n                                                  \"extended temp_ref_range.\") );\n            l_quotient = l_output \/ 4;\n            l_remainder = l_output % 4;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        default:\n            \/\/ l_temp_ref_range will be a platform attribute set by the MRW,\n            \/\/ which they \"shouldn't\" mess up as long as use \"attribute\" enums.\n            \/\/ if openpower messes this up we can at least catch it\n            FAPI_ASSERT(false,\n                        fapi2::MSS_INVALID_TEMP_REF_RANGE().\n                        set_TEMP_REF_RANGE(l_temp_ref_range),\n                        \"%s Incorrect Temperature Ref. Range received: %d \",\n                        mss::c_str(i_target),\n                        l_temp_ref_range);\n\n            break;\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/ @brief Calculates refresh interval time 4 (tREFI 4)\n\/\/\/ @param[in] i_target FAPI2 target\n\/\/\/ @param[out] o_value timing val in ps\n\/\/\/ @return fapi2::ReturnCode\n\/\/\/\nfapi2::ReturnCode calc_trefi4( const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n                               uint64_t& o_value)\n{\n    uint8_t l_quotient = 0;\n    uint8_t l_remainder = 0;\n    uint64_t l_output = 0;\n    uint8_t l_temp_ref_range = 0;\n    uint8_t l_dram_density = 0;\n    bool l_found_value = true;\n\n    FAPI_TRY( mss::mrw_temp_ref_range(l_temp_ref_range) );\n    FAPI_TRY( mss::eff_dram_density(i_target, l_dram_density) );\n\n    switch(l_temp_ref_range)\n    {\n        case fapi2::ENUM_ATTR_MRW_TEMP_REF_RANGE_NORMAL:\n            l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_ref_range,\n                                                  \"Could not find sdram density given\"\n                                                  \"normal temp_ref_range.\") );\n            l_quotient = l_output \/ 4;\n            l_remainder = l_output % 4;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        case fapi2::ENUM_ATTR_MRW_TEMP_REF_RANGE_EXTEND:\n            l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_ref_range,\n                                                  \"Could not find sdram density given\"\n                                                  \"extended temp_ref_range.\") );\n            l_quotient = l_output \/ 8;\n            l_remainder = l_output % 8;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        default:\n            \/\/ l_temp_ref_range will be a platform attribute set by the MRW,\n            \/\/ which they \"shouldn't\" mess up as long as use \"attribute\" enums.\n            \/\/ if openpower messes this up we can at least catch it\n            FAPI_ASSERT(false,\n                        fapi2::MSS_INVALID_TEMP_REF_RANGE().\n                        set_TEMP_REF_RANGE(l_temp_ref_range),\n                        \"%s Incorrect Temperature Ref. Range received: %d \",\n                        mss::c_str(i_target),\n                        l_temp_ref_range);\n\n            break;\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n}\/\/ mss\n<commit_msg>Add eff_config functionality needed for RIT, fix cas_latency bug & attr files<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/eff_config\/timing.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#include <fapi2.H>\n#include <mss.H>\n#include <lib\/utils\/find.H>\n#include <lib\/eff_config\/timing.H>\n\nnamespace mss\n{\n\n\/\/ Proposed DDR4 Full spec update(79-4A)\n\/\/ Item No. 1716.78C\n\/\/ pg.46\n\/\/ Table 24 - tREFI and tRFC parameters\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TREFI_BASE =\n{\n    \/\/ { density in GBs, tREFI(base) in picoseconds }\n    {2, 7800000},\n    {4, 7800000},\n    {8, 7800000},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 Full spec update(79-4A)\n\/\/ Item No. 1716.78C\n\/\/ pg.46\n\/\/ Table 24 - tREFI and tRFC parameters\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC1_MIN =\n{\n    \/\/ { density in GBs, tRFC1(min) in picoseconds }\n    {2, 160000},\n    {4, 260000},\n    {8, 350000},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 Full spec update(79-4A)\n\/\/ Item No. 1716.78C\n\/\/ pg.46\n\/\/ Table 24 - tREFI and tRFC parameters\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC2_MIN =\n{\n    \/\/ { density in GBs, tRFC2(min) in picoseconds }\n    {2, 110000},\n    {4, 160000},\n    {8, 260000},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 Full spec update(79-4A)\n\/\/ Item No. 1716.78C\n\/\/ pg.46\n\/\/ Table 24 - tREFI and tRFC parameters\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC4_MIN =\n{\n    \/\/ { density in GBs, tRFC4(min) in picoseconds }\n    {2, 90000},\n    {4, 110000},\n    {8, 160000},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 3DS Addendum\n\/\/ Item No. 1727.58A\n\/\/ pg. 69 - 71\n\/\/ Table 42 - Refresh parameters by logical rank density\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC_DLR1 =\n{\n    \/\/ { density in GBs, tRFC4(min) in picoseconds }\n    {4, 90000},\n    {8, 120000},\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 3DS Addendum\n\/\/ Item No. 1727.58A\n\/\/ pg. 69 - 71\n\/\/ Table 42 - Refresh parameters by logical rank density\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC_DLR2 =\n{\n    \/\/ { density in GBs, tRFC4(min) in picoseconds }\n    {4, 55000},\n    {8, 90000}\n    \/\/ 16Gb - TBD\n};\n\n\/\/ Proposed DDR4 3DS Addendum\n\/\/ Item No. 1727.58A\n\/\/ pg. 69 - 71\n\/\/ Table 42 - Refresh parameters by logical rank density\nstatic const std::vector<std::pair<uint8_t, uint64_t> > TRFC_DLR4 =\n{\n    \/\/ { density in GBs, tRFC4(min) in picoseconds }\n    {4, 40000},\n    {8, 55000}\n    \/\/ 16Gb - TBD\n};\n\n\/\/\/ @brief Calculates refresh interval time 1 (tREFI 1)\n\/\/\/ @param[in] i_target FAPI2 target\n\/\/\/ @param[out] o_value timing val in ps\n\/\/\/ @return fapi2::ReturnCode\n\/\/\/\nfapi2::ReturnCode calc_trefi1(const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n                              uint64_t& o_value)\n{\n    uint8_t  l_quotient = 0;\n    uint8_t l_remainder = 0;\n    uint64_t l_output = 0;\n    uint8_t l_temp_refresh_range = 0;\n    uint8_t l_dram_density = 0;\n    bool l_found_value = true;\n\n    FAPI_TRY( mss::eff_dram_density(i_target, l_dram_density) );\n    FAPI_TRY( mss::mrw_temp_refresh_range(l_temp_refresh_range) );\n\n    l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n\n    switch(l_temp_refresh_range)\n    {\n        case fapi2::ENUM_ATTR_MRW_TEMP_REFRESH_RANGE_NORMAL:\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_refresh_range,\n                                                  \"Could not find sdram density given \"\n                                                  \"normal temp_refresh_range.\") );\n            break;\n\n        case fapi2::ENUM_ATTR_MRW_TEMP_REFRESH_RANGE_EXTEND:\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_refresh_range,\n                                                  \"Could not find sdram density given \"\n                                                  \"extended temp_refresh_range.\") );\n            l_quotient = l_output \/ 2;\n            l_remainder = l_output % 2;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        default:\n            \/\/ Temperature Refresh Range will be a platform attribute set by the MRW,\n            \/\/ which they \"shouldn't\" mess up as long as use \"attribute\" enums.\n            \/\/ if openpower messes this up we can at least catch it\n            FAPI_ASSERT(false,\n                        fapi2::MSS_INVALID_TEMP_REF_RANGE().\n                        set_TEMP_REF_RANGE(l_temp_refresh_range),\n                        \"%s Incorrect Temperature Ref. Range received: %d \",\n                        mss::c_str(i_target),\n                        l_temp_refresh_range);\n\n            break;\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/ @brief Calculates refresh interval time 2 (tREFI 2)\n\/\/\/ @param[in] i_target FAPI2 target\n\/\/\/ @param[out] o_value timing val in ps\n\/\/\/ @return fapi2::ReturnCode\n\/\/\/\nfapi2::ReturnCode calc_trefi2(const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n                              uint64_t& o_value)\n{\n    uint8_t l_quotient = 0;\n    uint8_t l_remainder = 0;\n    uint64_t l_output = 0;\n    uint8_t l_temp_refresh_range = 0;\n    uint8_t l_dram_density = 0;\n    bool l_found_value = true;\n\n    FAPI_TRY( mss::mrw_temp_refresh_range(l_temp_refresh_range) );\n    FAPI_TRY( mss::eff_dram_density(i_target, l_dram_density) );\n\n    l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n\n    switch(l_temp_refresh_range)\n    {\n        case fapi2::ENUM_ATTR_MRW_TEMP_REFRESH_RANGE_NORMAL:\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_refresh_range,\n                                                  \"Could not find sdram density given \"\n                                                  \"normal temp_refresh_range.\") );\n\n            l_remainder = l_output % 2;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        case fapi2::ENUM_ATTR_MRW_TEMP_REFRESH_RANGE_EXTEND:\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_refresh_range,\n                                                  \"Could not find sdram density given \"\n                                                  \"extended temp_refresh_range.\") );\n            l_quotient = l_output \/ 4;\n            l_remainder = l_output % 4;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        default:\n            \/\/ Temperature Refresh Range will be a platform attribute set by the MRW,\n            \/\/ which they \"shouldn't\" mess up as long as use \"attribute\" enums.\n            \/\/ if openpower messes this up we can at least catch it\n            FAPI_ASSERT(false,\n                        fapi2::MSS_INVALID_TEMP_REF_RANGE().\n                        set_TEMP_REF_RANGE(l_temp_refresh_range),\n                        \"%s Incorrect Temperature Ref. Range received: %d \",\n                        mss::c_str(i_target),\n                        l_temp_refresh_range);\n\n            break;\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\/\/\/ @brief Calculates refresh interval time 4 (tREFI 4)\n\/\/\/ @param[in] i_target FAPI2 target\n\/\/\/ @param[out] o_value timing val in ps\n\/\/\/ @return fapi2::ReturnCode\n\/\/\/\nfapi2::ReturnCode calc_trefi4( const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n                               uint64_t& o_value)\n{\n    uint8_t l_quotient = 0;\n    uint8_t l_remainder = 0;\n    uint64_t l_output = 0;\n    uint8_t l_temp_refresh_range = 0;\n    uint8_t l_dram_density = 0;\n    bool l_found_value = true;\n\n    FAPI_TRY( mss::mrw_temp_refresh_range(l_temp_refresh_range) );\n    FAPI_TRY( mss::eff_dram_density(i_target, l_dram_density) );\n\n    l_found_value = mss::find_value_from_key(TREFI_BASE, l_dram_density, l_output);\n\n    switch(l_temp_refresh_range)\n    {\n        case fapi2::ENUM_ATTR_MRW_TEMP_REFRESH_RANGE_NORMAL:\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_refresh_range,\n                                                  \"Could not find sdram density given \"\n                                                  \"normal temp_refresh_range.\") );\n            l_quotient = l_output \/ 4;\n            l_remainder = l_output % 4;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        case fapi2::ENUM_ATTR_MRW_TEMP_REFRESH_RANGE_EXTEND:\n            FAPI_TRY( check::fail_for_invalid_map(i_target,\n                                                  l_found_value,\n                                                  l_dram_density,\n                                                  l_temp_refresh_range,\n                                                  \"Could not find sdram density given \"\n                                                  \"extended temp_refresh_range.\") );\n            l_quotient = l_output \/ 8;\n            l_remainder = l_output % 8;\n            o_value = l_quotient + (l_remainder == 0 ? 0 : 1);\n            break;\n\n        default:\n            \/\/ Temperature Refresh Range will be a platform attribute set by the MRW,\n            \/\/ which they \"shouldn't\" mess up as long as use \"attribute\" enums.\n            \/\/ if openpower messes this up we can at least catch it\n            FAPI_ASSERT(false,\n                        fapi2::MSS_INVALID_TEMP_REF_RANGE().\n                        set_TEMP_REF_RANGE(l_temp_refresh_range),\n                        \"%s Incorrect Temperature Ref. Range received: %d \",\n                        mss::c_str(i_target),\n                        l_temp_refresh_range);\n\n            break;\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n}\/\/ mss\n<|endoftext|>"}
{"text":"<commit_before>#include \"GMCommand.h\"\r\n#include \"map\"\r\n\r\ntypedef void (*PTRFUN)(GameGrail*, PlayerEntity*, vector<string>&); \r\nmap<string, PTRFUN> cmd_mapping;\r\n\r\n\/*\r\nenergy: ýɫ2ʯˮ\r\n*\/\r\nvoid setEnergy(GameGrail* engine, PlayerEntity* player, vector<string>& ss)\r\n{\r\n\tplayer->setGem(atoi(ss[1].c_str()));\r\n\tplayer->setCrystal(stoi(ss[2].c_str()));\r\n\r\n\tGameInfo game_info;\r\n\tCoder::energyNotice(player->getID(), player->getGem(), player->getCrystal(), game_info);\r\n\tengine->sendMessage(-1, MSG_GAME, game_info);\r\n}\r\n\r\n\/*\r\ncard: ƣΪӵid\r\n*\/\r\nvoid addCard(GameGrail* engine, PlayerEntity* player, vector<string>& ss)\r\n{\r\n\tint howmany;\r\n\tvector<int> cards;\r\n\tfor (int i = 1; i < ss.size(); ++i)\r\n\t\tcards.push_back(atoi(ss[i].c_str()));\r\n\thowmany = ss.size() - 1;\r\n\tplayer->addHandCards(howmany, cards);\r\n\r\n\tGameInfo game_info;\r\n\tCoder::handNotice(player->getID(), player->getHandCards(), game_info);\r\n\tengine->sendMessage(-1, MSG_GAME, game_info);\r\n}\r\n\r\n\/*\r\ncross: \r\n*\/\r\nvoid setCross(GameGrail* engine, PlayerEntity* player, vector<string>& ss)\r\n{\r\n\tint howmany = atoi(ss[1].c_str());\r\n\tplayer->addCrossNum(howmany-player->getCrossNum(), -2);   \/\/ 1000\r\n\r\n\tGameInfo game_info;\r\n\tCoder::crossNotice(player->getID(), player->getCrossNum(), game_info);\r\n\tengine->sendMessage(-1, MSG_GAME, game_info);\r\n}\r\n\r\n\/*\r\n¼gmָgmָcmd_mappingУkeyΪgmָʽַvalueǴָ\r\n*\/\r\nvoid initialize_gm_command()\r\n{\r\n\tcmd_mapping[\"!`energy\"] = setEnergy;  \/\/ \r\n\tcmd_mapping[\"!`card\"] = addCard;      \/\/ \r\n\tcmd_mapping[\"!`cross\"] = setCross;    \/\/ \r\n}\r\n\r\n\/*\r\nַָи\r\n*\/\r\nvoid split(const string& src, const string& separator, vector<string>& dest)\r\n{\r\n    string str = src;\r\n    string substring;\r\n    string::size_type start = 0, index;\r\n\r\n    do\r\n    {\r\n        index = str.find_first_of(separator,start);\r\n        if (index != string::npos)\r\n        {    \r\n            substring = str.substr(start,index-start);\r\n            dest.push_back(substring);\r\n            start = str.find_first_not_of(separator,index);\r\n            if (start == string::npos) return;\r\n        }\r\n    }while(index != string::npos);\r\n    \r\n    \/\/the last token\r\n    substring = str.substr(start);\r\n    dest.push_back(substring);\r\n}\r\n\r\nvoid gm_cmd(GameGrail* engine, PlayerEntity* player, string cmd)\r\n{\r\n\tvector<string> ss;\r\n\tsplit(cmd, \" \", ss);\r\n\t\/\/ ָöӦgmûжӦֱָ\r\n\tif (cmd_mapping.find(ss[0]) == cmd_mapping.end())\r\n\t{\r\n\t\treturn;\r\n\t}\r\n\tPTRFUN func = cmd_mapping[ss[0]];\r\n\tfunc(engine, player, ss);\r\n}\r\n<commit_msg>添加盖牌gm指令（!`covercard num）<commit_after>#include \"GMCommand.h\"\r\n#include \"map\"\r\n\r\ntypedef void (*PTRFUN)(GameGrail*, PlayerEntity*, vector<string>&); \r\nmap<string, PTRFUN> cmd_mapping;\r\n\r\n\/*\r\nenergy: ýɫ2ʯˮ\r\n*\/\r\nvoid setEnergy(GameGrail* engine, PlayerEntity* player, vector<string>& ss)\r\n{\r\n\tplayer->setGem(atoi(ss[1].c_str()));\r\n\tplayer->setCrystal(stoi(ss[2].c_str()));\r\n\r\n\tGameInfo game_info;\r\n\tCoder::energyNotice(player->getID(), player->getGem(), player->getCrystal(), game_info);\r\n\tengine->sendMessage(-1, MSG_GAME, game_info);\r\n}\r\n\r\n\/*\r\ncard: ƣΪӵid\r\n*\/\r\nvoid addCard(GameGrail* engine, PlayerEntity* player, vector<string>& ss)\r\n{\r\n\tint howmany;\r\n\tvector<int> cards;\r\n\tfor (int i = 1; i < ss.size(); ++i)\r\n\t\tcards.push_back(atoi(ss[i].c_str()));\r\n\thowmany = ss.size() - 1;\r\n\tplayer->addHandCards(howmany, cards);\r\n\r\n\tGameInfo game_info;\r\n\tCoder::handNotice(player->getID(), player->getHandCards(), game_info);\r\n\tengine->sendMessage(-1, MSG_GAME, game_info);\r\n}\r\n\r\n\/*\r\ncard: ӸƣΪӵid\r\n*\/\r\nvoid addCoverCard(GameGrail* engine, PlayerEntity* player, vector<string>& ss)\r\n{\r\n\tint howmany;\r\n\tvector<int> cards;\r\n\tfor (int i = 1; i < ss.size(); ++i)\r\n\t\tcards.push_back(atoi(ss[i].c_str()));\r\n\thowmany = ss.size() - 1;\r\n\tplayer->addCoverCards(howmany, cards);  \/\/\r\n\r\n\tGameInfo game_info;\r\n\tCoder::coverNotice(player->getID(), player->getCoverCards(), game_info);\r\n\tengine->sendMessage(-1, MSG_GAME, game_info);\r\n}\r\n\r\n\/*\r\ncross: \r\n*\/\r\nvoid setCross(GameGrail* engine, PlayerEntity* player, vector<string>& ss)\r\n{\r\n\tint howmany = atoi(ss[1].c_str());\r\n\tplayer->addCrossNum(howmany-player->getCrossNum(), -2);   \/\/ 1000\r\n\r\n\tGameInfo game_info;\r\n\tCoder::crossNotice(player->getID(), player->getCrossNum(), game_info);\r\n\tengine->sendMessage(-1, MSG_GAME, game_info);\r\n}\r\n\r\n\/*\r\n¼gmָgmָcmd_mappingУkeyΪgmָʽַvalueǴָ\r\n*\/\r\nvoid initialize_gm_command()\r\n{\r\n\tcmd_mapping[\"!`energy\"] = setEnergy;            \/\/ \r\n\tcmd_mapping[\"!`card\"] = addCard;                \/\/ \r\n\tcmd_mapping[\"!`cross\"] = setCross;              \/\/ \r\n\tcmd_mapping[\"!`covercard\"] = addCoverCard;      \/\/ Ӹ\r\n}\r\n\r\n\/*\r\nַָи\r\n*\/\r\nvoid split(const string& src, const string& separator, vector<string>& dest)\r\n{\r\n    string str = src;\r\n    string substring;\r\n    string::size_type start = 0, index;\r\n\r\n    do\r\n    {\r\n        index = str.find_first_of(separator,start);\r\n        if (index != string::npos)\r\n        {    \r\n            substring = str.substr(start,index-start);\r\n            dest.push_back(substring);\r\n            start = str.find_first_not_of(separator,index);\r\n            if (start == string::npos) return;\r\n        }\r\n    }while(index != string::npos);\r\n    \r\n    \/\/the last token\r\n    substring = str.substr(start);\r\n    dest.push_back(substring);\r\n}\r\n\r\nvoid gm_cmd(GameGrail* engine, PlayerEntity* player, string cmd)\r\n{\r\n\tvector<string> ss;\r\n\tsplit(cmd, \" \", ss);\r\n\t\/\/ ָöӦgmûжӦֱָ\r\n\tif (cmd_mapping.find(ss[0]) == cmd_mapping.end())\r\n\t{\r\n\t\treturn;\r\n\t}\r\n\tPTRFUN func = cmd_mapping[ss[0]];\r\n\tfunc(engine, player, ss);\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"Neohuman.h\"\n#include <iostream>\n\n#include \"BWEM\/bwem.h\"\n\nusing namespace BWAPI;\nusing namespace Filter;\n\nusing namespace BWEM;\nusing namespace BWEM::BWAPI_ext;\nusing namespace BWEM::utils;\n\n#define MIN(a, b) (((a) < (b) ? (a) : (b)))\n#define MAX(a, b) (((a) < (b) ? (b) : (a)))\n\n#define SATRUATION_RADIUS 350\n#define WORKERAGGRORADIUS 200\n\n#define SHOWTHINGS\n\nnamespace { auto & BWEMMap = Map::Instance(); }\n\nbool Neohuman::doBuild(Unit u, UnitType building, TilePosition at) {\n\t_buildingQueue.push_back(Triple<int, UnitType, TilePosition>{u->getID(), building, at});\n}\n\nstd::pair <int, int> Neohuman::getQueuedResources() {\n\tstd::pair <int, int> resources;\n\tfor (auto &o : _buildingQueue)\n\t\tresources.first  += o.second.mineralPrice(),\n\t\tresources.second += o.second.gasPrice();\n\treturn resources;\n}\n\nstd::pair <int, int> Neohuman::getSpendableResources() {\n\tstd::pair <int, int> result = { Broodwar->self()->minerals(), Broodwar->self()->gas() };\n\tauto queued = this->getQueuedResources();\n\tresult.first -= queued.first, result.second -= queued.second;\n\treturn result;\n}\n\nvoid Neohuman::onStart() {\n\tBroodwar << \"The map is totally not \" << Broodwar->mapName() << \"!\" << std::endl;\n\n\t\/\/Broodwar->enableFlag(Flag::UserInput);\n\n\t\/\/ Uncomment the following line and the bot will know about everything through the fog of war (cheat).\n\t\/\/Broodwar->enableFlag(Flag::CompleteMapInformation);\n\n\t\/\/ Set the command optimization level so that common commands can be grouped\n\t\/\/ and reduce the bot's APM (Actions Per Minute).\n\tBroodwar->setCommandOptimizationLevel(2);\n\n\t\/\/ Check if this is a replay\n\tif (!Broodwar->isReplay()) {\n\t\tif (Broodwar->enemy())\n\t\t\tBroodwar << \"The matchup is me (\" << Broodwar->self()->getRace() << \") vs \" << Broodwar->enemy()->getRace() << std::endl;\n\t\tfor (auto u: Broodwar->self()->getUnits()) {\n\t\t\t\/\/this->onUnitComplete(u);\n\t\t}\n\t}\n\n\tBWEMMap.Initialize();\n\tBWEMMap.EnableAutomaticPathAnalysis();\n\n}\n\nvoid Neohuman::onEnd(bool didWin) {\n\t\/\/ Called when the game ends\n\tif (didWin) {\n\n\t} else {\n\n\t}\n}\n\nint Neohuman::randint(int min, int max) {\n\tstd::uniform_int_distribution<int> dist(min, max);\n\treturn dist(_rand);\n}\n\ntemplate <typename T>\nT Neohuman::randele(std::vector <T> &v) {\n\treturn v[randint(0, v.size())];\n}\n\nvoid Neohuman::onFrame() {\n\t\/\/ Called once every game frame\n\tint constructingLine = 0;\n\tint availableMinerals = Broodwar->self()->minerals();\n\n#ifdef SHOWTHINGS\n\n\t\/\/ Display the game frame rate as text in the upper left area of the screen\n\tBroodwar->drawTextScreen(200, 0,  \"FPS: %d\", Broodwar->getFPS());\n\tBroodwar->drawTextScreen(200, 12, \"Average FPS: %f\", Broodwar->getAverageFPS());\n\tBroodwar->drawTextScreen(200, 24, \"I want %d more supply (%d queued, %d in production)\", _wantedExtraSupply, _queuedSupply, _supplyBeingMade);\n\tBroodwar->drawTextScreen(200, 36, \"I have %d barracks!\", _nBarracks);\n\n#endif\n\n\ttry {\n\t\t\/\/BWEM::utils::gridMapExample(BWEMMap);\n\t\t\/\/BWEM::utils::drawMap(BWEMMap);\n\t} catch (const std::exception & e) {\n\t\tBroodwar << \"EXCEPTION: \" << e.what() << std::endl;\n\t}\n\n\t\/\/ Return if the game is a replay or is paused\n\tif (Broodwar->isReplay() || Broodwar->isPaused() || !Broodwar->self())\n\t\treturn;\n\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\tif (u->exists() && u->isBeingConstructed()) {\n\t\t\tBroodwar->drawTextScreen(0, constructingLine, \"%s\", u->getType().c_str());\n\t\t\tconstructingLine += 12;\n\t\t}\n\t}\n\n#ifdef SHOWTHINGS\n\n\t\/\/ Show worker info\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\tif (u->getType().isResourceDepot()) {\n\t\t\tBroodwar->drawCircleMap(u->getPosition(), SATRUATION_RADIUS, Colors::Blue);\n\t\t\tauto workers = u->getUnitsInRadius(SATRUATION_RADIUS, (IsGatheringMinerals));\n\t\t\tauto refineries = u->getUnitsInRadius(SATRUATION_RADIUS, (IsRefinery));\n\t\t\tauto gasGeysers = u->getUnitsInRadius(SATRUATION_RADIUS);\n\t\t\tauto mineralFields = u->getUnitsInRadius(SATRUATION_RADIUS, (IsMineralField));\n\t\t\tBroodwar->drawTextMap(u->getPosition() + Position(0, 30), \"%cWorkers: %d\/%d\", Text::White, workers.size(), 2*mineralFields.size());\n\t\t}\n\t}\n\n#endif\n\n\t\/\/ Prevent spamming by only running our onFrame once every number of latency frames.\n\t\/\/ Latency frames are the number of frames before commands are processed.\n\tif (Broodwar->getFrameCount() % Broodwar->getLatencyFrames() != 0)\n\t\treturn;\n\t\n\t_supplyBeingMade = 0;\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\tif (u->isConstructing() && u->getType().getRace().getSupplyProvider() == u->getType())\n\t\t\t_supplyBeingMade += 8;\n\t}\n\n\tavailableMinerals -= 100*_queuedSupply\/8;\n\n\tif (Broodwar->elapsedTime() - _timeLastQueuedSupply > 5) {\n\t\t_queuedSupply = 0;\n\t\t_timeLastQueuedSupply = Broodwar->elapsedTime();\n\t}\n\n\t_nSupplyOverhead = 2 + MAX((Broodwar->self()->supplyUsed() - 10) \/ 8, 0);\n\t_wantedExtraSupply = (Broodwar->self()->supplyUsed() - (Broodwar->self()->supplyTotal() + _supplyBeingMade + _queuedSupply)) \/ 2 + _nSupplyOverhead;\n\n\t_nBarracks = 0;\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\t\/\/ If a cc is under construction\n\t\tif (u->isConstructing() && u->getType() == u->getType().getRace().getCenter() && _isExpanding)\n\t\t\tavailableMinerals += 400;\n\t\t\/\/ If a barracks is under construction\n\t\tif (u->isConstructing() && u->getType() == UnitTypes::Terran_Barracks && _isBuildingBarracks)\n\t\t\tavailableMinerals += 150;\n\n\t\tif (u->getType() == UnitTypes::Terran_Barracks) {\n\t\t\t++_nBarracks;\n\t\t}\n\t}\n\n\tif (_isExpanding) {\n\t\tavailableMinerals -= 400;\n\t}\n\n\tif (_isBuildingBarracks) {\n\t\tavailableMinerals -= 150;\n\t}\n\n\t\/\/ Check if supply should be increased\n\tif (_wantedExtraSupply > 0 && availableMinerals >= 100 && Broodwar->self()->supplyTotal() < 400) {\n\t\t\/\/ Find unit to build our supply!\n\t\tfor (auto &unit : Broodwar->self()->getUnits()) {\n\t\t\tif (unit->exists() && unit->isGatheringMinerals() && unit->isMoving() && !unit->isCarryingMinerals()) {\n\t\t\t\t\/\/ We have found our candidate!\n\t\t\t\tauto supplyType = unit->getType().getRace().getSupplyProvider();\n\t\t\t\tauto buildPos = Broodwar->getBuildLocation(supplyType, unit->getTilePosition());\n\n\t\t\t\tif (unit->build(supplyType, buildPos)) {\n\t\t\t\t\t_queuedSupply += 8;\n\t\t\t\t\t_timeLastQueuedSupply = Broodwar->elapsedTime();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (availableMinerals >= 150 && !_isBuildingBarracks && _nBarracks < 20) {\n\t\t\/\/ Build barracks!\n\t\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\t\tif (u->exists() && u->isGatheringMinerals() && u->isMoving() && !u->isCarryingMinerals()) {\n\t\t\t\tauto buildingType = UnitTypes::Terran_Barracks;\n\t\t\t\tauto buildingPos = Broodwar->getBuildLocation(buildingType, u->getTilePosition());\n\n\t\t\t\tif (u->build(buildingType, buildingPos)) {\n\t\t\t\t\t_isBuildingBarracks = true;\n\t\t\t\t\tavailableMinerals -= 150;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/*if (!_isExpanding && availableMinerals >= 400){\n\t\t\/\/ Expand!\n\t\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\t\tif (u->exists() && u->isGatheringMinerals() && u->isMoving() && !u->isCarryingMinerals()) {\n\t\t\t\t\/\/ Builder found!\n\t\t\t\tauto buildingType = u->getType().getRace().getCenter();\n\t\t\t\tauto buildPos = Broodwar->getBuildLocation(buildingType, u->getTilePosition());\n\n\t\t\t\tif (u->build(buildingType, buildPos)) {\n\t\t\t\t\t_isExpanding = true;\n\t\t\t\t\tavailableMinerals -= 400;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}*\/\n\n\t\/\/ Iterate through all the units that we own\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\t\/\/ Ignore the unit if it no longer exists\n\t\t\/\/ Make sure to include this block when handling any Unit pointer!\n\t\tif (!u->exists())\n\t\t\tcontinue;\n\n\t\t\/\/ Ignore the unit if it has one of the following status ailments\n\t\tif (u->isLockedDown() || u->isMaelstrommed() || u->isStasised())\n\t\t\tcontinue;\n\n\t\t\/\/ Ignore the unit if it is in one of the following states\n\t\tif (u->isLoaded() || !u->isPowered() || u->isStuck())\n\t\t\tcontinue;\n\n\t\t\/\/ Ignore the unit if it is incomplete or busy constructing\n\t\tif (!u->isCompleted() || u->isConstructing())\n\t\t\tcontinue;\n\n\t\t\/\/ If the unit is a worker unit\n\t\tif (u->getType().isWorker()) {\n\t\t\tauto enemyUnit = u->getClosestUnit(IsEnemy && IsAttacking, WORKERAGGRORADIUS);\n\t\t\tif (enemyUnit)\n\t\t\t\tu->attack(enemyUnit);\n\n\t\t\t\/\/ if our worker is idle\n\t\t\tif (u->isIdle()) {\n\t\t\t\t\/\/ Order workers carrying a resource to return them to the center,\n\t\t\t\t\/\/ otherwise find a mineral patch to harvest.\n\t\t\t\tif (u->isCarryingGas() || u->isCarryingMinerals())\n\t\t\t\t\tu->returnCargo();\n\n\t\t\t\telse if (!u->getPowerUp()) {\n\t\t\t\t\t\/\/ Probably need to set up some better logic for this\n\t\t\t\t\tauto preferredMiningLocation = u->getClosestUnit(IsMineralField);\n\t\t\t\t\tu->gather(preferredMiningLocation);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (u->getType().isResourceDepot()) {\n\t\t\tauto nearbyGeysers = u->getUnitsInRadius(SATRUATION_RADIUS, (GetType == UnitTypes::Resource_Vespene_Geyser));\n\t\t\tif (u->isIdle()) {\n\t\t\t\tauto workers = u->getUnitsInRadius(SATRUATION_RADIUS, (IsGatheringMinerals));\n\t\t\t\tif (nWorkers >= 70)\n\t\t\t\t\tcontinue;\n\t\t\t\tauto mineralFields = u->getUnitsInRadius(SATRUATION_RADIUS, (IsMineralField));\n\t\t\t\tif (workers.size() < mineralFields.size() * 2 && availableMinerals >= 50) {\n\t\t\t\t\tif (u->train(u->getType().getRace().getWorker())) {\n\t\t\t\t\t\tPosition pos = u->getPosition();\n\t\t\t\t\t\tError lastErr = Broodwar->getLastError();\n\t\t\t\t\t\tBroodwar->registerEvent([pos, lastErr](Game*){ Broodwar->drawTextMap(pos + Position(0, -10), \"%c%s\", Text::Red, lastErr.c_str()); },   \/\/ action\n\t\t\t\t\t\t\tnullptr,    \/\/ condition\n\t\t\t\t\t\t\tBroodwar->getLatencyFrames());  \/\/ frames to run\n\t\t\t\t\t} else {\n\t\t\t\t\t\tavailableMinerals -= 50;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (u->getType() == UnitTypes::Terran_Barracks) {\n\t\t\tif (u->isIdle() && availableMinerals >= 50)\n\t\t\t\tif (!u->train(UnitTypes::Terran_Marine))\n\t\t\t\t\tavailableMinerals -= 50;\n\t\t} else if (u->getType() == UnitTypes::Terran_Marine && Broodwar->getFrameCount() % 20 == 0) {\n\t\t\tauto enemyUnit = u->getClosestUnit(IsEnemy && IsAttacking);\n\t\t\tif (enemyUnit) {\n\t\t\t\tu->attack(enemyUnit->getPosition());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tenemyUnit = u->getClosestUnit(IsEnemy);\n\t\t\tif (enemyUnit) {\n\t\t\t\tu->attack(enemyUnit->getPosition());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tauto closestMarine = u->getClosestUnit(GetType == UnitTypes::Terran_Marine);\n\t\t\tif (closestMarine) {\n\t\t\t\tauto walk = u->getPosition() - closestMarine->getPosition();\n\t\t\t\tu->move(u->getPosition() + walk);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Neohuman::onSendText(std::string text) {\n\tBroodwar->sendText(\"%s\", text.c_str());\n}\n\nvoid Neohuman::onReceiveText(Player player, std::string text) {\n\tBroodwar << player->getName() << \" said \\\"\" << text << \"\\\"\" << std::endl;\n}\n\nvoid Neohuman::onPlayerLeft(Player player) {\n\tBroodwar->sendText(\"Goodbye %s!\", player->getName().c_str());\n}\n\nvoid Neohuman::onNukeDetect(Position target) {\n\tif (target) {\n\t\tBroodwar << \"Nuclear Launch Detected at \" << target << std::endl;\n\t} else {\n\t\tBroodwar->sendText(\"Where's the nuke?\");\n\t}\n\t\/\/ You can also retrieve all the nuclear missile targets using Broodwar->getNukeDots()!\n}\n\nvoid Neohuman::onUnitDiscover(Unit unit) {\n}\n\nvoid Neohuman::onUnitEvade(Unit unit) {\n}\n\nvoid Neohuman::onUnitShow(Unit unit) {\n}\n\nvoid Neohuman::onUnitHide(Unit unit) {\n}\n\nvoid Neohuman::onUnitCreate(Unit unit) {\n}\n\nvoid Neohuman::onUnitDestroy(Unit unit) {\n}\n\nvoid Neohuman::onUnitMorph(Unit unit) {\n\tthis->onUnitComplete(unit);\n}\n\nvoid Neohuman::onUnitRenegade(Unit unit){\n}\n\nvoid Neohuman::onSaveGame(std::string gameName){\n}\n\nvoid Neohuman::onUnitComplete(Unit unit){\n\tif (unit->getType() == unit->getType().getRace().getCenter())\n\t\t_isExpanding = false;\n\tif (unit->getType() == UnitTypes::Terran_Barracks)\n\t\t_isBuildingBarracks = false;\n}\n<commit_msg>Minor cleanup<commit_after>#include \"Neohuman.h\"\n#include <iostream>\n\n#include \"BWEM\/bwem.h\"\n\nusing namespace BWAPI;\nusing namespace Filter;\n\nusing namespace BWEM;\nusing namespace BWEM::BWAPI_ext;\nusing namespace BWEM::utils;\n\n#define MIN(a, b) (((a) < (b) ? (a) : (b)))\n#define MAX(a, b) (((a) < (b) ? (b) : (a)))\n\n#define SATRUATION_RADIUS 350\n#define WORKERAGGRORADIUS 200\n\n#define SHOWTHINGS\n\nnamespace { auto & BWEMMap = Map::Instance(); }\n\nbool Neohuman::doBuild(Unit u, UnitType building, TilePosition at) {\n\t_buildingQueue.push_back(Triple<int, UnitType, TilePosition>{u->getID(), building, at});\n}\n\nstd::pair <int, int> Neohuman::getQueuedResources() {\n\tstd::pair <int, int> resources;\n\tfor (auto &o : _buildingQueue)\n\t\tresources.first  += o.second.mineralPrice(),\n\t\tresources.second += o.second.gasPrice();\n\treturn resources;\n}\n\nstd::pair <int, int> Neohuman::getSpendableResources() {\n\tstd::pair <int, int> result = { Broodwar->self()->minerals(), Broodwar->self()->gas() };\n\tauto queued = this->getQueuedResources();\n\tresult.first -= queued.first, result.second -= queued.second;\n\treturn result;\n}\n\nvoid Neohuman::onStart() {\n\tBroodwar << \"The map is totally not \" << Broodwar->mapName() << \"!\" << std::endl;\n\n\t\/\/Broodwar->enableFlag(Flag::UserInput);\n\n\t\/\/ Uncomment the following line and the bot will know about everything through the fog of war (cheat).\n\t\/\/Broodwar->enableFlag(Flag::CompleteMapInformation);\n\n\t\/\/ Set the command optimization level so that common commands can be grouped\n\t\/\/ and reduce the bot's APM (Actions Per Minute).\n\tBroodwar->setCommandOptimizationLevel(2);\n\n\t\/\/ Check if this is a replay\n\tif (!Broodwar->isReplay()) {\n\t\tif (Broodwar->enemy())\n\t\t\tBroodwar << \"The matchup is me (\" << Broodwar->self()->getRace() << \") vs \" << Broodwar->enemy()->getRace() << std::endl;\n\t}\n\n\tBWEMMap.Initialize();\n\tBWEMMap.EnableAutomaticPathAnalysis();\n\n}\n\nvoid Neohuman::onEnd(bool didWin) {\n\t\/\/ Called when the game ends\n\tif (didWin) {\n\n\t} else {\n\n\t}\n}\n\nint Neohuman::randint(int min, int max) {\n\tstd::uniform_int_distribution<int> dist(min, max);\n\treturn dist(_rand);\n}\n\ntemplate <typename T>\nT Neohuman::randele(std::vector <T> &v) {\n\treturn v[randint(0, v.size())];\n}\n\nvoid Neohuman::onFrame() {\n\t\/\/ Called once every game frame\n\tint constructingLine = 0;\n\tint availableMinerals = Broodwar->self()->minerals();\n\n#ifdef SHOWTHINGS\n\n\t\/\/ Display the game frame rate as text in the upper left area of the screen\n\tBroodwar->drawTextScreen(200, 0,  \"FPS: %d\", Broodwar->getFPS());\n\tBroodwar->drawTextScreen(200, 12, \"Average FPS: %f\", Broodwar->getAverageFPS());\n\tBroodwar->drawTextScreen(200, 24, \"I want %d more supply (%d queued, %d in production)\", _wantedExtraSupply, _queuedSupply, _supplyBeingMade);\n\tBroodwar->drawTextScreen(200, 36, \"I have %d barracks!\", _nBarracks);\n\n#endif\n\n\ttry {\n\t\t\/\/BWEM::utils::gridMapExample(BWEMMap);\n\t\t\/\/BWEM::utils::drawMap(BWEMMap);\n\t} catch (const std::exception & e) {\n\t\tBroodwar << \"EXCEPTION: \" << e.what() << std::endl;\n\t}\n\n\t\/\/ Return if the game is a replay or is paused\n\tif (Broodwar->isReplay() || Broodwar->isPaused() || !Broodwar->self())\n\t\treturn;\n\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\tif (u->exists() && u->isBeingConstructed()) {\n\t\t\tBroodwar->drawTextScreen(0, constructingLine, \"%s\", u->getType().c_str());\n\t\t\tconstructingLine += 12;\n\t\t}\n\t}\n\n#ifdef SHOWTHINGS\n\n\t\/\/ Show worker info\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\tif (u->getType().isResourceDepot()) {\n\t\t\tBroodwar->drawCircleMap(u->getPosition(), SATRUATION_RADIUS, Colors::Blue);\n\t\t\tauto workers = u->getUnitsInRadius(SATRUATION_RADIUS, (IsGatheringMinerals));\n\t\t\tauto refineries = u->getUnitsInRadius(SATRUATION_RADIUS, (IsRefinery));\n\t\t\tauto gasGeysers = u->getUnitsInRadius(SATRUATION_RADIUS);\n\t\t\tauto mineralFields = u->getUnitsInRadius(SATRUATION_RADIUS, (IsMineralField));\n\t\t\tBroodwar->drawTextMap(u->getPosition() + Position(0, 30), \"%cWorkers: %d\/%d\", Text::White, workers.size(), 2*mineralFields.size());\n\t\t}\n\t}\n\n#endif\n\n\t\/\/ Prevent spamming by only running our onFrame once every number of latency frames.\n\t\/\/ Latency frames are the number of frames before commands are processed.\n\tif (Broodwar->getFrameCount() % Broodwar->getLatencyFrames() != 0)\n\t\treturn;\n\t\n\t_supplyBeingMade = 0;\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\tif (u->isConstructing() && u->getType().getRace().getSupplyProvider() == u->getType())\n\t\t\t_supplyBeingMade += 8;\n\t}\n\n\tavailableMinerals -= 100*_queuedSupply\/8;\n\n\tif (Broodwar->elapsedTime() - _timeLastQueuedSupply > 5) {\n\t\t_queuedSupply = 0;\n\t\t_timeLastQueuedSupply = Broodwar->elapsedTime();\n\t}\n\n\t_nSupplyOverhead = 2 + MAX((Broodwar->self()->supplyUsed() - 10) \/ 8, 0);\n\t_wantedExtraSupply = (Broodwar->self()->supplyUsed() - (Broodwar->self()->supplyTotal() + _supplyBeingMade + _queuedSupply)) \/ 2 + _nSupplyOverhead;\n\n\t_nBarracks = 0;\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\t\/\/ If a cc is under construction\n\t\tif (u->isConstructing() && u->getType() == u->getType().getRace().getCenter() && _isExpanding)\n\t\t\tavailableMinerals += 400;\n\t\t\/\/ If a barracks is under construction\n\t\tif (u->isConstructing() && u->getType() == UnitTypes::Terran_Barracks && _isBuildingBarracks)\n\t\t\tavailableMinerals += 150;\n\n\t\tif (u->getType() == UnitTypes::Terran_Barracks) {\n\t\t\t++_nBarracks;\n\t\t}\n\t}\n\n\tif (_isExpanding) {\n\t\tavailableMinerals -= 400;\n\t}\n\n\tif (_isBuildingBarracks) {\n\t\tavailableMinerals -= 150;\n\t}\n\n\t\/\/ Check if supply should be increased\n\tif (_wantedExtraSupply > 0 && availableMinerals >= 100 && Broodwar->self()->supplyTotal() < 400) {\n\t\t\/\/ Find unit to build our supply!\n\t\tfor (auto &unit : Broodwar->self()->getUnits()) {\n\t\t\tif (unit->exists() && unit->isGatheringMinerals() && unit->isMoving() && !unit->isCarryingMinerals()) {\n\t\t\t\t\/\/ We have found our candidate!\n\t\t\t\tauto supplyType = unit->getType().getRace().getSupplyProvider();\n\t\t\t\tauto buildPos = Broodwar->getBuildLocation(supplyType, unit->getTilePosition());\n\n\t\t\t\tif (unit->build(supplyType, buildPos)) {\n\t\t\t\t\t_queuedSupply += 8;\n\t\t\t\t\t_timeLastQueuedSupply = Broodwar->elapsedTime();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (availableMinerals >= 150 && !_isBuildingBarracks && _nBarracks < 20) {\n\t\t\/\/ Build barracks!\n\t\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\t\tif (u->exists() && u->isGatheringMinerals() && u->isMoving() && !u->isCarryingMinerals()) {\n\t\t\t\tauto buildingType = UnitTypes::Terran_Barracks;\n\t\t\t\tauto buildingPos = Broodwar->getBuildLocation(buildingType, u->getTilePosition());\n\n\t\t\t\tif (u->build(buildingType, buildingPos)) {\n\t\t\t\t\t_isBuildingBarracks = true;\n\t\t\t\t\tavailableMinerals -= 150;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/*if (!_isExpanding && availableMinerals >= 400){\n\t\t\/\/ Expand!\n\t\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\t\tif (u->exists() && u->isGatheringMinerals() && u->isMoving() && !u->isCarryingMinerals()) {\n\t\t\t\t\/\/ Builder found!\n\t\t\t\tauto buildingType = u->getType().getRace().getCenter();\n\t\t\t\tauto buildPos = Broodwar->getBuildLocation(buildingType, u->getTilePosition());\n\n\t\t\t\tif (u->build(buildingType, buildPos)) {\n\t\t\t\t\t_isExpanding = true;\n\t\t\t\t\tavailableMinerals -= 400;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}*\/\n\n\t\/\/ Iterate through all the units that we own\n\tfor (auto &u : Broodwar->self()->getUnits()) {\n\t\t\/\/ Ignore the unit if it no longer exists\n\t\t\/\/ Make sure to include this block when handling any Unit pointer!\n\t\tif (!u->exists())\n\t\t\tcontinue;\n\n\t\t\/\/ Ignore the unit if it has one of the following status ailments\n\t\tif (u->isLockedDown() || u->isMaelstrommed() || u->isStasised())\n\t\t\tcontinue;\n\n\t\t\/\/ Ignore the unit if it is in one of the following states\n\t\tif (u->isLoaded() || !u->isPowered() || u->isStuck())\n\t\t\tcontinue;\n\n\t\t\/\/ Ignore the unit if it is incomplete or busy constructing\n\t\tif (!u->isCompleted() || u->isConstructing())\n\t\t\tcontinue;\n\n\t\t\/\/ If the unit is a worker unit\n\t\tif (u->getType().isWorker()) {\n\t\t\tauto enemyUnit = u->getClosestUnit(IsEnemy && IsAttacking, WORKERAGGRORADIUS);\n\t\t\tif (enemyUnit)\n\t\t\t\tu->attack(enemyUnit);\n\n\t\t\t\/\/ if our worker is idle\n\t\t\tif (u->isIdle()) {\n\t\t\t\t\/\/ Order workers carrying a resource to return them to the center,\n\t\t\t\t\/\/ otherwise find a mineral patch to harvest.\n\t\t\t\tif (u->isCarryingGas() || u->isCarryingMinerals())\n\t\t\t\t\tu->returnCargo();\n\n\t\t\t\telse if (!u->getPowerUp()) {\n\t\t\t\t\t\/\/ Probably need to set up some better logic for this\n\t\t\t\t\tauto preferredMiningLocation = u->getClosestUnit(IsMineralField);\n\t\t\t\t\tu->gather(preferredMiningLocation);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (u->getType().isResourceDepot()) {\n\t\t\tauto nearbyGeysers = u->getUnitsInRadius(SATRUATION_RADIUS, (GetType == UnitTypes::Resource_Vespene_Geyser));\n\t\t\tif (u->isIdle()) {\n\t\t\t\tauto workers = u->getUnitsInRadius(SATRUATION_RADIUS, (IsGatheringMinerals));\n\t\t\t\tif (nWorkers >= 70)\n\t\t\t\t\tcontinue;\n\t\t\t\tauto mineralFields = u->getUnitsInRadius(SATRUATION_RADIUS, (IsMineralField));\n\t\t\t\tif (workers.size() < mineralFields.size() * 2 && availableMinerals >= 50) {\n\t\t\t\t\tif (u->train(u->getType().getRace().getWorker())) {\n\t\t\t\t\t\tPosition pos = u->getPosition();\n\t\t\t\t\t\tError lastErr = Broodwar->getLastError();\n\t\t\t\t\t\tBroodwar->registerEvent([pos, lastErr](Game*){ Broodwar->drawTextMap(pos + Position(0, -10), \"%c%s\", Text::Red, lastErr.c_str()); },   \/\/ action\n\t\t\t\t\t\t\tnullptr,    \/\/ condition\n\t\t\t\t\t\t\tBroodwar->getLatencyFrames());  \/\/ frames to run\n\t\t\t\t\t} else {\n\t\t\t\t\t\tavailableMinerals -= 50;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (u->getType() == UnitTypes::Terran_Barracks) {\n\t\t\tif (u->isIdle() && availableMinerals >= 50)\n\t\t\t\tif (!u->train(UnitTypes::Terran_Marine))\n\t\t\t\t\tavailableMinerals -= 50;\n\t\t} else if (u->getType() == UnitTypes::Terran_Marine && Broodwar->getFrameCount() % 20 == 0) {\n\t\t\tauto enemyUnit = u->getClosestUnit(IsEnemy && IsAttacking);\n\t\t\tif (enemyUnit) {\n\t\t\t\tu->attack(enemyUnit->getPosition());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tenemyUnit = u->getClosestUnit(IsEnemy);\n\t\t\tif (enemyUnit) {\n\t\t\t\tu->attack(enemyUnit->getPosition());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tauto closestMarine = u->getClosestUnit(GetType == UnitTypes::Terran_Marine);\n\t\t\tif (closestMarine) {\n\t\t\t\tauto walk = u->getPosition() - closestMarine->getPosition();\n\t\t\t\tu->move(u->getPosition() + walk);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Neohuman::onSendText(std::string text) {\n\tBroodwar->sendText(\"%s\", text.c_str());\n}\n\nvoid Neohuman::onReceiveText(Player player, std::string text) {\n\tBroodwar << player->getName() << \" said \\\"\" << text << \"\\\"\" << std::endl;\n}\n\nvoid Neohuman::onPlayerLeft(Player player) {\n\tBroodwar->sendText(\"Goodbye %s!\", player->getName().c_str());\n}\n\nvoid Neohuman::onNukeDetect(Position target) {\n\tif (target) {\n\t\tBroodwar << \"Nuclear Launch Detected at \" << target << std::endl;\n\t} else {\n\t\tBroodwar->sendText(\"Where's the nuke?\");\n\t}\n\t\/\/ You can also retrieve all the nuclear missile targets using Broodwar->getNukeDots()!\n}\n\nvoid Neohuman::onUnitDiscover(Unit unit) {\n}\n\nvoid Neohuman::onUnitEvade(Unit unit) {\n}\n\nvoid Neohuman::onUnitShow(Unit unit) {\n}\n\nvoid Neohuman::onUnitHide(Unit unit) {\n}\n\nvoid Neohuman::onUnitCreate(Unit unit) {\n}\n\nvoid Neohuman::onUnitDestroy(Unit unit) {\n}\n\nvoid Neohuman::onUnitMorph(Unit unit) {\n\tthis->onUnitComplete(unit);\n}\n\nvoid Neohuman::onUnitRenegade(Unit unit){\n}\n\nvoid Neohuman::onSaveGame(std::string gameName){\n}\n\nvoid Neohuman::onUnitComplete(Unit unit){\n\tif (unit->getType() == unit->getType().getRace().getCenter())\n\t\t_isExpanding = false;\n\tif (unit->getType() == UnitTypes::Terran_Barracks)\n\t\t_isBuildingBarracks = false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <GL\\glew.h>\n#include <GL\\freeglut.h>\n#include <iostream>\n\nvoid DrawCircle(float cx, float cy, float r, int num_segments) \n{ \n\tglBegin(GL_LINE_LOOP); \n\t\tfor(int i = 0; i < num_segments; i++) \n\t\t{ \n\t\t\tfloat theta = 2.0f * 3.1415926f * float(i) \/ float(num_segments);\n\n\t\t\tfloat x = r * cosf(theta);\n\t\t\tfloat y = r * sinf(theta);\n\n\t\t\tglVertex2f(x + cx, y + cy);\n\t\t} \n\tglEnd(); \n}\n\nvoid render()\n{\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\n\tDrawCircle(0.0f, 0.0f, 0.5f, 25);\n\n\tglutSwapBuffers( ); \n}\n\nint main (int argc, char** argv) {\n\t\/\/Init GLUT & create windows\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DOUBLE | GLUT_RGBA | GLUT_DEPTH);\n\tglutInitWindowSize(600,600);\n\tglutInitWindowPosition (500, 100);\n\tglutCreateWindow(\"Ola Circular\");\n\n\tglutDisplayFunc(render);\n\t\/\/glutReshapeFunc(changeViewport);\n\n\tglutMainLoop();\n\treturn 0;\n}<commit_msg>Visualizacion de la ola. Amplitud y Frecuencia<commit_after>#include <GL\\glew.h>\n#include <GL\\freeglut.h>\n#include <iostream>\n\nusing namespace std;\n\n#define DEF_floorGridScale\t1.0\n#define DEF_floorGridXSteps\t10.0\n#define DEF_floorGridZSteps\t10.0\n\nint angle = 90,\n\tXpos = 10,\n\tYpos = 10,\n\tk = 1;\ndouble Zpos = 3.0,\n\t\tt = 0.0;\n\nfloat amplitud = 1.0,\n\tfrecuencia = 1.0;\n\nGLfloat ctlpoints[21][21][3];\n\nGLUnurbsObj *theNurb;\n\nvoid ejesCoordenada() {\n\t\n\tglLineWidth(2.5);\n\tglBegin(GL_LINES);\n\t\tglColor3f(1.0,0.0,0.0);\n\t\tglVertex2f(0,10);\n\t\tglVertex2f(0,-10);\n\t\tglColor3f(0.0,0.0,1.0);\n\t\tglVertex2f(10,0);\n\t\tglVertex2f(-10,0);\n\tglEnd();\n\n\tglLineWidth(1.5);\n\tint i;\n\tglColor3f(0.0,1.0,0.0);\n\tglBegin(GL_LINES);\n\t\tfor(i = -10; i <=10; i++){\n\t\t\tif (i!=0) {\t\t\n\t\t\t\tif ((i%2)==0){\t\n\t\t\t\t\tglVertex2f(i,0.4);\n\t\t\t\t\tglVertex2f(i,-0.4);\n\n\t\t\t\t\tglVertex2f(0.4,i);\n\t\t\t\t\tglVertex2f(-0.4,i);\n\t\t\t\t}else{\n\t\t\t\t\tglVertex2f(i,0.2);\n\t\t\t\t\tglVertex2f(i,-0.2);\n\n\t\t\t\t\tglVertex2f(0.2,i);\n\t\t\t\t\tglVertex2f(-0.2,i);\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\tglEnd();\n\n\tglLineWidth(1.0);\n}\n\nvoid changeViewport(int w, int h) {\n\t\n\tfloat aspectratio;\n\n\tif (h==0)\n\t\th=1;\n\n\t\n   glViewport (0, 0, (GLsizei) w, (GLsizei) h); \n   glMatrixMode (GL_PROJECTION);\n   glLoadIdentity ();\n   gluPerspective(30, (GLfloat) w\/(GLfloat) h, 1.0, 200.0);\n   glMatrixMode (GL_MODELVIEW);\n\n}\n\nfloat direction(int x, int y, int cx, int cy) {\n\tfloat l = sqrt(((x - cx)*(x - cx)) + ((y - cy)*(y - cy)));\n\treturn l;\n}\n\nvoid init_surface() {\n\tint u, v;\n\n    for (u = 0; u < 21; u++) {\n\t\tfor (v = 0; v < 21; v++) {\n\t\t\tctlpoints[u][v][0] = ((GLfloat)u - 10.0f);\n\t\t\tctlpoints[u][v][1] = ((GLfloat)v - 10.0f);\n\t\t\tctlpoints[u][v][2] = amplitud*(pow(sin(direction(u,v,Xpos,Ypos)*frecuencia - t), k));\n\t\t}\n    }\n}\n\nvoid init(){\n\n\t\/\/GLfloat mat_diffuse[] = { 0.7, 0.7, 0.7, 1.0 };\n    \/\/GLfloat mat_specular[] = { 1.0, 1.0, 1.0, 1.0 };\n    \/\/GLfloat mat_shininess[] = { 100.0 };\n\n    \/\/glClearColor (0.0, 0.0, 0.0, 1.0);\n    \/\/glMaterialfv(GL_FRONT, GL_DIFFUSE, mat_diffuse);\n    \/\/glMaterialfv(GL_FRONT, GL_SPECULAR, mat_specular);\n    \/\/glMaterialfv(GL_FRONT, GL_SHININESS, mat_shininess);\n\n\tglEnable(GL_LIGHTING);\n\tglEnable(GL_LIGHT0);\n\t\/\/glDepthFunc(GL_LESS);\n\tglEnable(GL_DEPTH_TEST);\n\tglEnable(GL_AUTO_NORMAL);\n\tglEnable(GL_NORMALIZE);\n\n\tinit_surface();\n\n\ttheNurb = gluNewNurbsRenderer();\n\tgluNurbsProperty(theNurb, GLU_SAMPLING_TOLERANCE, 15.0); \/\/25.0\n\tgluNurbsProperty(theNurb, GLU_DISPLAY_MODE, GLU_FILL);\n}\n\nvoid Keyboard(unsigned char key, int x, int y)\n{\n  switch (key)\n  {\n\tcase 27:             \n\t\texit (0);\n\t\tbreak;\n\tcase 'a':\n\t\tamplitud += 0.1;\n\t\tbreak;\n\tcase 'q':\n\t\tamplitud -= 0.1;\n\t\tbreak;\n\tcase 's':\n\t\tfrecuencia += 0.1;\n\t\tbreak;\n\tcase 'w':\n\t\tfrecuencia -= 0.1;\n\t\tbreak;\n\tcase 'd':\n\t\tk += 1;\n\t\tbreak;\n\tcase 'e':\n\t\tif (k > 1)\n\t\t\tk -= 1;\n\t\tbreak;\n  }\n}\n\nvoid specialKey (int key, int x, int y) {\n\tswitch (key)\n\t{\n\t\tcase GLUT_KEY_UP:\n\t\t\tXpos += 1;\n\t\t\tbreak;\n\t\tcase GLUT_KEY_DOWN:\n\t\t\tXpos -= 1;\n\t\t\tbreak;\n\t\tcase GLUT_KEY_LEFT:\n\t\t\tYpos -= 1;\n\t\t\tbreak;\n\t\tcase GLUT_KEY_RIGHT:\n\t\t\tYpos += 1;\n\t\t\tbreak;\n\t}\t\n}\n\nGLfloat * knotVector(int k) {\n\tstatic GLfloat r[25];\n\n\tfor (int i = 0; i < k; ++i) {\n\t\tr[i] = 0.0f;\n\t}\n\n\tfor (int i = k; i < (25-k); ++i) {\n\t\tr[i] = float(i-3)\/18.0;\n\t}\n\n\tfor (int i = (25-k); i < 25; ++i) {\n\t\tr[i] = 1.0f;\n\t}\n\n\treturn r;\n}\n\nvoid curva() {\n\t\n\tGLfloat *knots;\n\n\tknots = knotVector(4);\n\n\tgluBeginSurface(theNurb);\n\n\t\tgluNurbsSurface(theNurb, \n\t\t\t\t\t\t25,\tknots,\n\t\t\t\t\t\t25, knots,\n\t\t\t\t\t\t21 * 3,\n\t\t\t\t\t\t3,\n\t\t\t\t\t\t&ctlpoints[0][0][0],\n\t\t\t\t\t\t4, 4,\n\t\t\t\t\t\tGL_MAP2_VERTEX_3);\n\t\/*\n\n\t\tNo cambien los numeros de la funcion,\n\t\tsolo deben de poner los nombres de las variables correspondiente.\n\t\t\n\t*\/\n\n\n\t\tgluEndSurface(theNurb);\n\t\n\t\n\t\/* Muestra los puntos de control *\/\n\t\n\t\/*\tint i,j;\n\t\tglPointSize(5.0);\n\t\tglDisable(GL_LIGHTING);\n\t\tglColor3f(1.0, 1.0, 0.0);\n\t\tglBegin(GL_POINTS);\n\t\tfor (i = 0; i <21; i++) {\n\t\t\tfor (j = 0; j < 21; j++) {\n\t            glVertex3f(ctlpoints[i][j][0], \tctlpoints[i][j][1], ctlpoints[i][j][2]);\n\t\t\t}\n\t\t}\n\t\tglEnd();*\/\n\t\tglEnable(GL_LIGHTING);\n}\n\nvoid render(){\n\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\tglClearColor(0.0, 0.0, 0.0, 0.0);\n\n\tGLfloat zExtent, xExtent, xLocal, zLocal;\n    int loopX, loopZ;\n\n\tglLoadIdentity ();                       \n\tgluLookAt (25.0, 12.0, 4.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0);\n\t\n\n\t\/\/ Luz y material\n\n\tGLfloat mat_diffuse[] = { 0.6, 0.6, 0.9, 1.0 };\n\tGLfloat mat_specular[] = { 0.8, 0.8, 1.0, 1.0 };\n\tGLfloat mat_shininess[] = { 60.0 };\n\t\n\tglMaterialfv(GL_FRONT, GL_DIFFUSE, mat_diffuse);\n\tglMaterialfv(GL_FRONT, GL_SPECULAR, mat_specular);\n\tglMaterialfv(GL_FRONT, GL_SHININESS, mat_shininess);\n\t\n\n    GLfloat light_ambient[] = { 0.0, 0.0, 0.2, 1.0 };\n\tGLfloat light_diffuse[] = { 0.8, 0.8, 0.8, 1.0 };\n\tGLfloat light_specular[] = { 0.6, 0.6, 0.6, 1.0 };\n\tGLfloat light_position[] = { -10.0, 5.0, 0.0, 1.0 };\n\n\tglLightfv(GL_LIGHT0, GL_AMBIENT, light_ambient);\n\tglLightfv(GL_LIGHT0, GL_DIFFUSE, light_diffuse);\n\tglLightfv(GL_LIGHT0, GL_SPECULAR, light_specular);\n\tglLightfv(GL_LIGHT0, GL_POSITION, light_position);   \n\n\t\/\/ Render Grid \n\n\t\/\/glDisable(GL_LIGHTING);\n\t\/\/glLineWidth(1.0);\n\t\/\/glPushMatrix();\n\t\/\/\tglRotatef(angle,1.0,0.0,0.0);\n\t\/\/\tglColor3f( 0.0, 0.7, 0.7 );\n\t\/\/\tglBegin( GL_LINES );\n\t\/\/\t\tzExtent = DEF_floorGridScale * DEF_floorGridZSteps;\n\t\/\/\t\tfor(loopX = -DEF_floorGridXSteps; loopX <= DEF_floorGridXSteps; loopX++ )\n\t\/\/\t\t{\n\t\/\/\t\t\txLocal = DEF_floorGridScale * loopX;\n\t\/\/\t\t\tglVertex3f( xLocal, -zExtent, 0.0 );\n\t\/\/\t\t\tglVertex3f( xLocal, zExtent,  0.0 );\n\t\/\/\t\t}\n\t\/\/\t\txExtent = DEF_floorGridScale * DEF_floorGridXSteps;\n\t\/\/\t    for(loopZ = -DEF_floorGridZSteps; loopZ <= DEF_floorGridZSteps; loopZ++ )\n\t\/\/\t\t{\n\t\/\/\t\t\tzLocal = DEF_floorGridScale * loopZ;\n\t\/\/\t\t\tglVertex3f( -xExtent, zLocal, 0.0 );\n\t\/\/\t\t\tglVertex3f(  xExtent, zLocal, 0.0 );\n\t\/\/\t\t}\n\t\/\/\tglEnd();\n\t\/\/\tejesCoordenada();\n \/\/   glPopMatrix();\n\n\t\/\/glEnable(GL_LIGHTING);\n\n\t\/\/ Fin Grid\n\t\n\n\n\t\/\/Suaviza las lineas\n\tglEnable(GL_BLEND); glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n\tglEnable( GL_LINE_SMOOTH );\t\n\n\t\n\tglPushMatrix();\n\t\tglRotatef(angle,-1.0,0.0,0.0);\n\t\t\/\/glTranslated(0.0,0.0,Zpos);\n\t\tcurva();\n\t\n\tglPopMatrix();\n\n\tglDisable(GL_BLEND);\n\tglDisable(GL_LINE_SMOOTH);\n\n\tglutSwapBuffers();\n}\n\nvoid animacion(int value) {\n\t\n\tinit_surface();\n\tt += 0.1;\n\tglutTimerFunc(10,animacion,1);\n    glutPostRedisplay();\n\t\n}\n\nint main (int argc, char** argv) {\n\n\tglutInit(&argc, argv);\n\n\tglutInitDisplayMode(GLUT_DOUBLE | GLUT_RGBA | GLUT_DEPTH);\n\n\tglutInitWindowSize(960,540);\n\n\tglutCreateWindow(\"Test Opengl\");\n\n\tinit ();\n\n\tglutReshapeFunc(changeViewport);\n\tglutDisplayFunc(render);\n\tglutKeyboardFunc(Keyboard);\n\tglutSpecialFunc(specialKey);\n\t\t\n\tGLenum err = glewInit();\n\tif (GLEW_OK != err) {\n\t\tfprintf(stderr, \"GLEW error\");\n\t\treturn 1;\n\t}\n\t\n\tglutTimerFunc(10,animacion,1);\n\tglutMainLoop();\n\treturn 0;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************\nCopyright (c) 2016-2019 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\n#include <y\/core\/FixedArray.h>\n#include <y\/core\/Vector.h>\n\n#include <y\/mem\/allocators.h>\n#include <y\/core\/Range.h>\n#include <y\/math\/Vec.h>\n#include <y\/utils\/log.h>\n#include <y\/utils\/perf.h>\n#include <y\/utils\/name.h>\n\n#include <typeindex>\n#include <thread>\n\nusing namespace y;\n\n\n\n\nstruct ComponentRuntimeInfo {\n\tusize component_size = 0;\n\tvoid (*create)(void* dst, usize count) = nullptr;\n\tvoid (*destroy)(void* ptr, usize count) = nullptr;\n\tvoid (*move)(void* dst, void* src, usize count) = nullptr;\n\n\ttemplate<typename T>\n\tstatic ComponentRuntimeInfo from_type() {\n\t\treturn {\n\t\t\tsizeof(T),\n\t\t\t[](void* dst, usize count) {\n\t\t\t\tT* it = static_cast<T*>(dst);\n\t\t\t\tconst T* end = it + count;\n\t\t\t\tfor(; it != end; ++it) {\n\t\t\t\t\t::new(it) T();\n\t\t\t\t}\n\t\t\t},\n\t\t\t[](void* ptr, usize count) {\n\t\t\t\tT* it = static_cast<T*>(ptr);\n\t\t\t\tconst T* end = it + count;\n\t\t\t\tfor(; it != end; ++it) {\n\t\t\t\t\tit->~T();\n\t\t\t\t}\n\t\t\t},\n\t\t\t[](void* dst, void* src, usize count) {\n\t\t\t\tconst T* beg = static_cast<T*>(src);\n\t\t\t\tconst T* end = beg + count;\n\t\t\t\tstd::move(beg, end, static_cast<T*>(dst));\n\t\t\t},\n\t\t};\n\t}\n};\n\n\nclass Archetype;\n\nstatic constexpr usize entities_per_chunk = 1024;\n\n\n\ntemplate<typename... Args>\nstruct ComponentIterator {\n\tpublic:\n\t\tstatic constexpr usize component_count = sizeof...(Args);\n\n\t\tusing difference_type = usize;\n\t\tusing iterator_category = std::random_access_iterator_tag;\n\n\t\tusing reference = std::tuple<Args&...>;\n\n\t\treference operator*() const {\n\t\t\treturn make_refence_tuple<0>();\n\t\t}\n\n\n\n\t\tbool operator==(const ComponentIterator& other) const {\n\t\t\treturn _index == other._index && _chunks == other._chunks;\n\t\t}\n\n\t\tbool operator!=(const ComponentIterator& other) const {\n\t\t\treturn !operator==(other);\n\t\t}\n\n\t\tComponentIterator& operator++() {\n\t\t\t++_index;\n\t\t\treturn *this;\n\t\t}\n\n\t\tComponentIterator& operator--() {\n\t\t\t--_index;\n\t\t\treturn *this;\n\t\t}\n\n\t\tComponentIterator operator++(int) {\n\t\t\tconst auto it = *this;\n\t\t\t++*this;\n\t\t\treturn it;\n\t\t}\n\n\t\tComponentIterator operator--(int) {\n\t\t\tconst auto it = *this;\n\t\t\t--*this;\n\t\t\treturn it;\n\t\t}\n\n\n\t\tdifference_type operator-(const ComponentIterator& other) const {\n\t\t\treturn _index - other._index;\n\t\t}\n\n\t\tComponentIterator& operator+=(usize n) {\n\t\t\t_index += n;\n\t\t\treturn *this;\n\t\t}\n\n\t\tComponentIterator& operator-=(usize n) {\n\t\t\t_index -= n;\n\t\t\treturn *this;\n\t\t}\n\n\n\t\tComponentIterator operator+(usize n) const {\n\t\t\tauto it = *this;\n\t\t\tit += n;\n\t\t\treturn it;\n\t\t}\n\n\t\tComponentIterator operator-(usize n) const {\n\t\t\tauto it = *this;\n\t\t\tit -= n;\n\t\t\treturn it;\n\t\t}\n\n\n\tprivate:\n\t\tfriend class Archetype;\n\n\t\ttemplate<usize I = 0>\n\t\tauto make_refence_tuple() const {\n\t\t\tconst usize chunk_index = _index \/ entities_per_chunk;\n\t\t\tconst usize item_index = _index % entities_per_chunk;\n\t\t\tusing type = std::remove_reference_t<std::tuple_element_t<I, reference>>;\n\n\t\t\tvoid* offset_chunk = static_cast<u8*>(_chunks[chunk_index]) + _offsets[I];\n\t\t\ttype* chunk = static_cast<type*>(offset_chunk);\n\t\t\tif constexpr(I + 1 == component_count) {\n\t\t\t\treturn std::tie(chunk[item_index]);\n\t\t\t} else {\n\t\t\t\treturn std::tuple_cat(std::tie(chunk[item_index]),\n\t\t\t\t\t\t\t\t\t  make_refence_tuple<I + 1>());\n\t\t\t}\n\t\t}\n\n\t\tusize _index = 0;\n\t\tvoid** _chunks = nullptr;\n\t\tstd::array<usize, component_count> _offsets;\n};\n\n\nclass Archetype : NonCopyable {\n\n\tpublic:\n\t\ttemplate<typename... Args>\n\t\tstatic Archetype create() {\n\t\t\tArchetype arc(sizeof...(Args));\n\t\t\tarc.set_types<0, Args...>();\n\t\t\tarc.add_chunk();\n\t\t\treturn arc;\n\t\t}\n\n\t\tArchetype(Archetype&&) = default;\n\t\tArchetype& operator=(Archetype&&) = default;\n\n\t\t~Archetype() {\n\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\t_component_infos[i].destroy(_chunk_data.last(), _last_chunk_size);\n\t\t\t}\n\t\t\tfor(usize c = 0; c + 1 < _chunk_data.size(); ++c) {\n\t\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\t\t_component_infos[i].destroy(_chunk_data[c], entities_per_chunk);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(void* c : _chunk_data) {\n\t\t\t\t_allocator.deallocate(c, _chunk_byte_size);\n\t\t\t}\n\t\t}\n\n\n\n\n\n\t\tusize size() const {\n\t\t\treturn (_chunk_data.size() - 1) * entities_per_chunk + _last_chunk_size;\n\t\t}\n\n\t\ttemplate<typename... Args>\n\t\tauto view() {\n\t\t\tComponentIterator<Args...> begin;\n\t\t\tbuild_iterator<0>(begin);\n\t\t\tconst auto end = begin + size();\n\t\t\treturn core::Range(begin, end);\n\t\t}\n\n\n\n\n\t\tvoid add_entity() {\n\t\t\tif(_last_chunk_size == entities_per_chunk) {\n\t\t\t\tadd_chunk();\n\t\t\t}\n\t\t\tu8* chunk_data = static_cast<u8*>(_chunk_data.last());\n\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\tconst usize offset = _component_offsets[i];\n\t\t\t\t_component_infos[i].create(chunk_data + offset, 1);\n\t\t\t}\n\t\t\t++_last_chunk_size;\n\t\t}\n\n\tprivate:\n\t\tArchetype(usize component_count) :\n\t\t\t\t_component_count(component_count),\n\t\t\t\t_component_offsets(std::make_unique<usize[]>(component_count)),\n\t\t\t\t_component_infos(std::make_unique<ComponentRuntimeInfo[]>(component_count)),\n\t\t\t\t_allocator(memory::global_allocator()) {\n\t\t}\n\n\t\ttemplate<usize I, typename... Args>\n\t\tvoid set_types() {\n\t\t\tif constexpr(I < sizeof...(Args)) {\n\t\t\t\tusing component_type = std::tuple_element_t<I, std::tuple<Args...>>;\n\t\t\t\t_component_offsets[I] = _chunk_byte_size;\n\t\t\t\t_component_infos[I] = ComponentRuntimeInfo::from_type<component_type>();\n\t\t\t\t_component_types.emplace_back(typeid(remove_cvref_t<component_type>));\n\n\t\t\t\t_chunk_byte_size = memory::align_up_to(_chunk_byte_size, sizeof(component_type));\n\t\t\t\t_chunk_byte_size += sizeof(component_type) * entities_per_chunk;\n\n\t\t\t\tset_types<I + 1, Args...>();\n\t\t\t}\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tusize type_index() const {\n\t\t\tconst std::type_index type = typeid(T);\n\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\tif(_component_types[i] == type) {\n\t\t\t\t\treturn i;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn y_fatal(\"Unknown component type.\");\n\t\t}\n\n\n\t\ttemplate<usize I, typename... Args>\n\t\tvoid build_iterator(ComponentIterator<Args...>& it) {\n\t\t\tif constexpr(I < sizeof...(Args)) {\n\t\t\t\tusing reference = typename ComponentIterator<Args...>::reference;\n\t\t\t\tusing type = remove_cvref_t<std::tuple_element_t<I, reference>>;\n\t\t\t\tit._offsets[I] = _component_offsets[type_index<type>()];\n\t\t\t\tbuild_iterator<I + 1>(it);\n\t\t\t} else {\n\t\t\t\tit._chunks = _chunk_data.begin();\n\t\t\t}\n\t\t}\n\n\n\t\tvoid add_chunk() {\n\t\t\ty_debug_assert(_last_chunk_size == entities_per_chunk || _chunk_data.is_empty());\n\t\t\t_last_chunk_size = 0;\n\t\t\t_chunk_data.emplace_back(_allocator.allocate(_chunk_byte_size));\n\t\t}\n\n\t\tusize _component_count = 0;\n\t\tstd::unique_ptr<usize[]> _component_offsets;\n\t\tstd::unique_ptr<ComponentRuntimeInfo[]> _component_infos;\n\n\t\tcore::Vector<void*> _chunk_data;\n\t\tusize _last_chunk_size = 0;\n\n\t\tcore::Vector<std::type_index> _component_types;\n\n\t\tmemory::PolymorphicAllocatorContainer _allocator;\n\t\tusize _chunk_byte_size = 0;\n};\n\n\n\n\nint main() {\n\tArchetype arc = Archetype::create<int, float>();\n\n\ty_debug_assert(arc.size() == 0);\n\n\tarc.add_entity();\n\tarc.add_entity();\n\n\ty_debug_assert(arc.size() == 2);\n\n\tint base = 0;\n\tfor(auto [i] : arc.view<int>()) {\n\t\ti = ++base;\n\t}\n\n\tfor(auto [i] : arc.view<const int>()) {\n\t\tlog_msg(fmt(\"% %\", ct_type_name<decltype(i)>(), i));\n\t}\n\treturn 0;\n}\n\n\n\n<commit_msg>ECS stuff<commit_after>\/*******************************\nCopyright (c) 2016-2019 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\n#include <y\/core\/FixedArray.h>\n#include <y\/core\/Vector.h>\n\n#include <y\/mem\/allocators.h>\n#include <y\/core\/Range.h>\n#include <y\/math\/Vec.h>\n#include <y\/utils\/log.h>\n#include <y\/utils\/perf.h>\n#include <y\/utils\/name.h>\n#include <y\/utils\/sort.h>\n\n#include <atomic>\n#include <thread>\n\nnamespace y {\nnamespace detail {\nstatic std::atomic<u32> global_type_index = 0;\n}\n\ntemplate<typename T>\nstatic u32 type_index() {\n\tstatic u32 index = detail::global_type_index++;\n\treturn index;\n}\n\n\n\n\nclass Archetype;\nclass EntityWorld;\nclass EntityBuilder;\n\nstatic constexpr usize entities_per_chunk = 1024;\n\n\nclass EntityID {\n\tpublic:\n\t\tEntityID(u32 index = invalid_index, u32 version = 0) : _index(index), _version(version) {\n\t\t}\n\n\t\tu32 index() const {\n\t\t\treturn _index;\n\t\t}\n\n\t\tu32 version() const {\n\t\t\treturn _version;\n\t\t}\n\n\t\tbool is_valid() const {\n\t\t\treturn _index != invalid_index;\n\t\t}\n\n\t\tu64 as_u64() const {\n\t\t\treturn (u64(_index) << 32) | _version;\n\t\t}\n\n\tprivate:\n\t\tstatic constexpr u32 invalid_index = u32(-1);\n\n\t\tu32 _index = invalid_index;\n\t\tu32 _version = 0;\n};\n\n\n\n\nstruct EntityData {\n\tEntityID id;\n\tArchetype* archetype = nullptr;\n\tusize archetype_index = 0;\n};\n\n\n\n\ntemplate<typename... Args>\nstruct ComponentIterator {\n\tpublic:\n\t\tstatic constexpr usize component_count = sizeof...(Args);\n\n\t\tusing difference_type = usize;\n\t\tusing iterator_category = std::random_access_iterator_tag;\n\n\t\tusing reference = std::tuple<Args&...>;\n\n\t\treference operator*() const {\n\t\t\treturn make_refence_tuple<0>();\n\t\t}\n\n\n\n\t\tbool operator==(const ComponentIterator& other) const {\n\t\t\treturn _index == other._index && _chunks == other._chunks;\n\t\t}\n\n\t\tbool operator!=(const ComponentIterator& other) const {\n\t\t\treturn !operator==(other);\n\t\t}\n\n\t\tComponentIterator& operator++() {\n\t\t\t++_index;\n\t\t\treturn *this;\n\t\t}\n\n\t\tComponentIterator& operator--() {\n\t\t\t--_index;\n\t\t\treturn *this;\n\t\t}\n\n\t\tComponentIterator operator++(int) {\n\t\t\tconst auto it = *this;\n\t\t\t++*this;\n\t\t\treturn it;\n\t\t}\n\n\t\tComponentIterator operator--(int) {\n\t\t\tconst auto it = *this;\n\t\t\t--*this;\n\t\t\treturn it;\n\t\t}\n\n\n\t\tdifference_type operator-(const ComponentIterator& other) const {\n\t\t\treturn _index - other._index;\n\t\t}\n\n\t\tComponentIterator& operator+=(usize n) {\n\t\t\t_index += n;\n\t\t\treturn *this;\n\t\t}\n\n\t\tComponentIterator& operator-=(usize n) {\n\t\t\t_index -= n;\n\t\t\treturn *this;\n\t\t}\n\n\n\t\tComponentIterator operator+(usize n) const {\n\t\t\tauto it = *this;\n\t\t\tit += n;\n\t\t\treturn it;\n\t\t}\n\n\t\tComponentIterator operator-(usize n) const {\n\t\t\tauto it = *this;\n\t\t\tit -= n;\n\t\t\treturn it;\n\t\t}\n\n\n\tprivate:\n\t\tfriend class Archetype;\n\n\t\ttemplate<usize I = 0>\n\t\tauto make_refence_tuple() const {\n\t\t\tconst usize chunk_index = _index \/ entities_per_chunk;\n\t\t\tconst usize item_index = _index % entities_per_chunk;\n\t\t\tusing type = std::remove_reference_t<std::tuple_element_t<I, reference>>;\n\n\t\t\tvoid* offset_chunk = static_cast<u8*>(_chunks[chunk_index]) + _offsets[I];\n\t\t\ttype* chunk = static_cast<type*>(offset_chunk);\n\t\t\tif constexpr(I + 1 == component_count) {\n\t\t\t\treturn std::tie(chunk[item_index]);\n\t\t\t} else {\n\t\t\t\treturn std::tuple_cat(std::tie(chunk[item_index]),\n\t\t\t\t\t\t\t\t\t  make_refence_tuple<I + 1>());\n\t\t\t}\n\t\t}\n\n\t\tusize _index = 0;\n\t\tvoid** _chunks = nullptr;\n\t\tstd::array<usize, component_count> _offsets;\n};\n\n\n\n\nstruct ComponentRuntimeInfo {\n\tusize chunk_offset = 0;\n\tusize component_size = 0;\n\n\tvoid (*create)(void* dst, usize count) = nullptr;\n\tvoid (*destroy)(void* ptr, usize count) = nullptr;\n\tvoid (*move)(void* dst, void* src, usize count) = nullptr;\n\n\tu32 type_id = u32(-1);\n\n#ifdef Y_DEBUG\n\tstd::string_view type_name = \"unknown\";\n#endif\n\n\n\tvoid create_offset(void* chunk, usize index, usize count) const {\n\t\tcreate(static_cast<u8*>(chunk) + chunk_offset + index * component_size, count);\n\t\tlog_msg(fmt(\"chunk = % + %[%]\", chunk, chunk_offset, index));\n\t}\n\n\tvoid destroy_offset(void* chunk, usize index, usize count) const {\n\t\tdestroy(static_cast<u8*>(chunk) + chunk_offset + index * component_size, count);\n\t\tlog_msg(fmt(\"chunk = % + %[%]\", chunk, chunk_offset, index));\n\t}\n\n\tvoid move_offset(void* dst, void* chunk, usize index, usize count) const {\n\t\tmove(dst, static_cast<u8*>(chunk) + chunk_offset + index * component_size, count);\n\t\tlog_msg(fmt(\"chunk = % + %[%]\", chunk, chunk_offset, index));\n\t}\n\n\ttemplate<typename T>\n\tstatic ComponentRuntimeInfo from_type(usize offset = 0) {\n\t\treturn {\n\t\t\toffset,\n\t\t\tsizeof(T),\n\t\t\t[](void* dst, usize count) {\n\t\t\t\tlog_msg(fmt(\"creating % %\", count, ct_type_name<T>()));\n\t\t\t\tT* it = static_cast<T*>(dst);\n\t\t\t\tconst T* end = it + count;\n\t\t\t\tfor(; it != end; ++it) {\n\t\t\t\t\t::new(it) T();\n\t\t\t\t}\n\t\t\t},\n\t\t\t[](void* ptr, usize count) {\n\t\t\t\tlog_msg(fmt(\"destroying % %\", count, ct_type_name<T>()));\n\t\t\t\tT* it = static_cast<T*>(ptr);\n\t\t\t\tconst T* end = it + count;\n\t\t\t\tfor(; it != end; ++it) {\n\t\t\t\t\tit->~T();\n\t\t\t\t}\n\t\t\t},\n\t\t\t[](void* dst, void* src, usize count) {\n\t\t\t\tlog_msg(fmt(\"moving % %\", count, ct_type_name<T>()));\n\t\t\t\tT* it = static_cast<T*>(src);\n\t\t\t\tconst T* end = it + count;\n\t\t\t\tT* out = static_cast<T*>(dst);\n\t\t\t\twhile(it != end) {\n\t\t\t\t\t*out++ = std::move(*it++);\n\t\t\t\t}\n\t\t\t},\n\t\t\ttype_index<T>(),\n\n#ifdef Y_DEBUG\n\t\t\tct_type_name<T>()\n#endif\n\t\t};\n\t}\n};\n\nclass Archetype : NonCopyable {\n\n\tpublic:\n\t\ttemplate<typename... Args>\n\t\tstatic Archetype create() {\n\t\t\tArchetype arc(sizeof...(Args));\n\t\t\tarc.set_types<0, Args...>();\n\t\t\tarc.add_chunk();\n\t\t\treturn arc;\n\t\t}\n\n\t\tArchetype(Archetype&&) = default;\n\t\tArchetype& operator=(Archetype&&) = default;\n\n\t\t~Archetype() {\n\t\t\tif(_component_infos) {\n\t\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\t\t_component_infos[i].destroy_offset(_chunk_data.last(), 0, _last_chunk_size);\n\t\t\t\t}\n\t\t\t\tfor(usize c = 0; c + 1 < _chunk_data.size(); ++c) {\n\t\t\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\t\t\t_component_infos[i].destroy_offset(_chunk_data[c], 0, entities_per_chunk);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor(void* c : _chunk_data) {\n\t\t\t\t\t_allocator.deallocate(c, _chunk_byte_size);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\n\t\ttemplate<typename... Args>\n\t\tauto view() {\n\t\t\tComponentIterator<Args...> begin;\n\t\t\tbuild_iterator<0>(begin);\n\t\t\tconst auto end = begin + size();\n\t\t\treturn core::Range(begin, end);\n\t\t}\n\n\t\tusize size() const {\n\t\t\treturn (_chunk_data.size() - 1) * entities_per_chunk + _last_chunk_size;\n\t\t}\n\n\t\tcore::Span<ComponentRuntimeInfo> component_infos() const {\n\t\t\treturn core::Span<ComponentRuntimeInfo>(_component_infos.get(), _component_count);\n\t\t}\n\n\t\tvoid add_entity() {\n\t\t\tadd_entities(1);\n\t\t}\n\n\t\tvoid add_entities(usize count) {\n\t\t\tif(_last_chunk_size == entities_per_chunk) {\n\t\t\t\tadd_chunk();\n\t\t\t}\n\n\t\t\tconst usize left_in_chunk = entities_per_chunk - _last_chunk_size;\n\t\t\tconst usize first = std::min(left_in_chunk, count);\n\n\t\t\tvoid* chunk_data = _chunk_data.last();\n\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\t_component_infos[i].create_offset(chunk_data, _last_chunk_size, first);\n\t\t\t}\n\t\t\t_last_chunk_size += first;\n\n\t\t\tif(first != count) {\n\t\t\t\tadd_entities(count - first);\n\t\t\t}\n\t\t}\n\n\tprivate:\n\t\tfriend class EntityWorld;\n\n\t\tArchetype(usize component_count) :\n\t\t\t\t_component_count(component_count),\n\t\t\t\t_component_infos(std::make_unique<ComponentRuntimeInfo[]>(component_count)),\n\t\t\t\t_allocator(memory::global_allocator()) {\n\t\t}\n\n\t\ttemplate<usize I, typename... Args>\n\t\tvoid set_types() {\n\t\t\tif constexpr(I < sizeof...(Args)) {\n\t\t\t\tusing component_type = std::tuple_element_t<I, std::tuple<Args...>>;\n\t\t\t\t_component_infos[I] = ComponentRuntimeInfo::from_type<component_type>();\n\t\t\t\tset_types<I + 1, Args...>();\n\t\t\t} else {\n\t\t\t\tlog_msg(fmt(\"arch => %\", ct_type_name<std::tuple<Args...>>()));\n\t\t\t\tconst auto cmp = [](const ComponentRuntimeInfo& a, const ComponentRuntimeInfo& b) { return a.type_id < b.type_id; };\n\t\t\t\tsort(_component_infos.get(), _component_infos.get() + _component_count, cmp);\n\n\t\t\t\ty_debug_assert(_chunk_byte_size == 0);\n\t\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\t\t_component_infos[i].chunk_offset = _chunk_byte_size;\n\n\t\t\t\t\tconst usize size = _component_infos[i].component_size;\n\t\t\t\t\t_chunk_byte_size = memory::align_up_to(_chunk_byte_size, size);\n\t\t\t\t\t_chunk_byte_size += size * entities_per_chunk;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\ttemplate<typename T>\n\t\tconst ComponentRuntimeInfo* info() const {\n\t\t\tconst u32 index = type_index<T>();\n\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\tif(_component_infos[i].type_id == index) {\n\t\t\t\t\treturn &_component_infos[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn y_fatal(\"Unknown component type.\");\n\t\t}\n\n\t\ttemplate<usize I, typename... Args>\n\t\tvoid build_iterator(ComponentIterator<Args...>& it) {\n\t\t\tif constexpr(I < sizeof...(Args)) {\n\t\t\t\tusing reference = typename ComponentIterator<Args...>::reference;\n\t\t\t\tusing type = remove_cvref_t<std::tuple_element_t<I, reference>>;\n\t\t\t\tit._offsets[I] = info<type>()->chunk_offset;\n\t\t\t\tbuild_iterator<I + 1>(it);\n\t\t\t} else {\n\t\t\t\tit._chunks = _chunk_data.begin();\n\t\t\t}\n\t\t}\n\n\t\tvoid transfer_to(Archetype* arc, core::MutableSpan<EntityData> entities) {\n\t\t\t\/\/y_fatal(\"unimplemented\");\n\t\t\tconst usize start = arc->size();\n\t\t\tarc->add_entities(entities.size());\n\n\t\t\tusize other_index = 0;\n\t\t\tfor(usize i = 0; i != _component_count; ++i) {\n\t\t\t\tComponentRuntimeInfo* other_info = nullptr;\n\t\t\t\tfor(; other_index != arc->_component_count; ++other_index) {\n\t\t\t\t\tif(arc->_component_infos[other_index].type_id == _component_infos[i].type_id) {\n\t\t\t\t\t\tother_info = &arc->_component_infos[other_index];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(other_info) {\n\t\t\t\t\tfor(usize e = 0; e != entities.size(); ++e) {\n\t\t\t\t\t\tEntityData& data = entities[e];\n\t\t\t\t\t\tconst usize src_chunk_index = data.archetype_index \/ entities_per_chunk;\n\t\t\t\t\t\tconst usize src_item_index = data.archetype_index % entities_per_chunk;\n\n\t\t\t\t\t\tconst usize dst_index = start + e;\n\t\t\t\t\t\tconst usize dst_chunk_index = dst_index \/ entities_per_chunk;\n\t\t\t\t\t\tconst usize dst_item_index = dst_index % entities_per_chunk;\n\t\t\t\t\t\tconst usize offset = other_info->chunk_offset + dst_item_index * other_info->component_size;\n\t\t\t\t\t\tvoid* dst = static_cast<u8*>(arc->_chunk_data[dst_chunk_index]) + offset;\n\n\t\t\t\t\t\t_component_infos[i].move_offset(dst, _chunk_data[src_chunk_index], src_item_index, 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(usize e = 0; e != entities.size(); ++e) {\n\t\t\t\tEntityData& data = entities[e];\n\t\t\t\tdata.archetype = arc;\n\t\t\t\tdata.archetype_index = start + e;\n\t\t\t}\n\n\t\t}\n\n\t\tbool matches_type_indexes(core::Span<u32> type_indexes) const {\n\t\t\ty_debug_assert(std::is_sorted(type_indexes.begin(), type_indexes.end()));\n\t\t\tif(type_indexes.size() != _component_count) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tfor(usize i = 0; i != type_indexes.size(); ++i) {\n\t\t\t\tif(type_indexes[i] != _component_infos[i].type_id) {\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\t\tvoid add_chunk() {\n\t\t\ty_debug_assert(_last_chunk_size == entities_per_chunk || _chunk_data.is_empty());\n\t\t\t_last_chunk_size = 0;\n\t\t\t_chunk_data.emplace_back(_allocator.allocate(_chunk_byte_size));\n\t\t}\n\n\t\tusize _component_count = 0;\n\t\tstd::unique_ptr<ComponentRuntimeInfo[]> _component_infos;\n\n\t\tcore::Vector<void*> _chunk_data;\n\t\tusize _last_chunk_size = 0;\n\n\t\tmemory::PolymorphicAllocatorContainer _allocator;\n\t\tusize _chunk_byte_size = 0;\n};\n\n\n\n\n\nstruct EntityBuilder : NonCopyable {\n\tpublic:\n\t\tEntityBuilder(EntityID id, EntityWorld& world) : _id(id), _world(world) {\n\t\t}\n\n\tprivate:\n\t\tEntityID _id;\n\t\tEntityWorld& _world;\n};\n\nclass EntityWorld : NonCopyable {\n\tpublic:\n\t\tEntityID create_entity() {\n\t\t\t_entities.emplace_back();\n\t\t\tEntityData& ent = _entities.last();\n\t\t\treturn ent.id = EntityID(_entities.size() - 1);\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tvoid add_component(EntityID id) {\n\t\t\tif(!exists(id)) {\n\t\t\t\ty_fatal(\"Entity doesn't exists.\");\n\t\t\t}\n\n\t\t\tEntityData& data = _entities[id.index()];\n\t\t\tArchetype* old_arc = data.archetype;\n\t\t\tArchetype* new_arc = nullptr;\n\n\t\t\tcore::Vector<u32> types;\n\t\t\t{\n\t\t\t\t{\n\t\t\t\t\tif(old_arc) {\n\t\t\t\t\t\tfor(const ComponentRuntimeInfo& info : old_arc->component_infos()) {\n\t\t\t\t\t\t\ttypes << info.type_id;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\ttypes << type_index<T>();\n\t\t\t\t\tsort(types.begin(), types.end());\n\t\t\t\t}\n\n\t\t\t\tfor(Archetype& arc : _archetypes) {\n\t\t\t\t\tif(arc.matches_type_indexes(types)) {\n\t\t\t\t\t\tnew_arc = &arc;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\t\n\n\t\t\t\tif(!new_arc) {\n\t\t\t\t\tnew_arc = &_archetypes.emplace_back(Archetype::create<T>()); \/\/ THIS IS FUCKED\n\t\t\t\t}\n\t\t\t}\n\n\t\t\ty_debug_assert(new_arc->_component_count == types.size());\n\t\t\tif(old_arc) {\n\t\t\t\told_arc->transfer_to(new_arc, data);\n\t\t\t} else {\n\t\t\t\tnew_arc->add_entity();\n\t\t\t\tdata.archetype = new_arc;\n\t\t\t}\n\t\t}\n\n\t\tbool exists(EntityID id) const {\n\t\t\tif(id.index() >= _entities.size()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn _entities[id.index()].id.version() == id.version();\n\t\t}\n\n\tprivate:\n\t\tcore::Vector<EntityData> _entities;\n\t\tcore::Vector<Archetype> _archetypes;\n};\n}\n\n\nusing namespace y;\n\n\nstruct Tester : NonCopyable {\n\tTester() : x(0xFDFEFDFE12345678) {\n\t}\n\n\tTester(Tester&& other) : x(other.x) {\n\t\ty_debug_assert(x == 0x0F0F0F0F0F0F0F0F || x == 0xFDFEFDFE12345678);\n\t\tother.x = 0x0F0F0F0F0F0F0F0F;\n\t\tlog_msg(\"moved\");\n\t}\n\n\tTester& operator=(Tester&&) {\n\t\ty_fatal(\"!\");\n\t\treturn *this;\n\t}\n\n\t~Tester() {\n\t\ty_debug_assert(x == 0x0F0F0F0F0F0F0F0F || x == 0xFDFEFDFE12345678);\n\t\tlog_msg(\"destroyed\");\n\t}\n\n\tu64 x = 0;\n};\n\nint main() {\n\tEntityWorld world;\n\n\tEntityID id = world.create_entity();\n\tworld.add_component<Tester>(id);\n\tworld.add_component<int>(id);\n\tworld.add_component<float>(id);\n\n\t\/*for(auto [i] : arc.view<const int>()) {\n\t\tlog_msg(fmt(\"% %\", ct_type_name<decltype(i)>(), i));\n\t}*\/\n\n\tlog_msg(\"Ok\");\n\treturn 0;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/* \n *  Software License Agreement (BSD License)\n *\n *  Copyright (c) 2016-2020, Natalnet Laboratory for Perceptual Robotics\n *  All rights reserved.\n *  Redistribution and use in source and binary forms, with or without modification, are permitted provided\n *  that the following conditions are met:\n *\n *  1. Redistributions of source code must retain the above copyright notice, this list of conditions and\n *     the following disclaimer.\n *\n *  2. 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 * \n *  3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or\n *     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\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\n *  USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *  Author:\n *\n *  Bruno Silva\n *\/\n\n#include <cstdio>\n#include <string>\n\n#include <event_logger.h>\n#include <feature_tracker.h>\n\nusing namespace std;\n\n\/* #####################################################\n * #####                                           #####\n * #####               Private Impl.               #####\n * #####                                           #####\n * #####################################################\n *\/\n\nfloat FeatureTracker::get_avg_track_length()\n{\n\tconst size_t N = tracklets_.size();\n\n\tsize_t sum = 0;\n\tfor(size_t i = 0; i < N; i++)\n\t{\n\t\tsum += (size_t) tracklets_[i].pts2D_.size();\n\t}\n\n\treturn float(sum)\/N;\n}\n\nvoid FeatureTracker::print_track_info()\n{\n\tconst size_t N = tracklets_.size();\n\n\tfor(size_t i = 0; i < N; i++)\n\t{\n\t\tconst size_t M = tracklets_[i].pts2D_.size();\n\n\t\tprintf(\"track[%lu]: (size: %lu)\\n\\t\", i, M);\n\t\tfor(size_t j = 0; j < M; j++)\n\t\t{\n\t\t\tprintf(\"[%lu](%f,%f)->\", tracklets_[i].start_ + j, tracklets_[i].pts2D_[j].x, tracklets_[i].pts2D_[j].y);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n}\n\nfloat FeatureTracker::get_time_per_frame()\n{\n\tfloat total_time = 0.0;\n\tfor(size_t i = 0; i < op_time_.size(); i++)\n\t{\n\t\ttotal_time += op_time_[i];\n\t}\n\n\treturn total_time;\n}\n\nbool FeatureTracker::write_tracking_info()\n{\n\tif(tracking_info_.is_open())\n\t{\n\t\tif(frame_idx_ == 0)\n\t\t{\n\t\t\t\/\/Add comment to the first line of file\n\t\t\ttracking_info_ << \"#keypoints_at_motion added_pts inliers\\n\";\n\t\t\ttracking_info_ << 0 << \" \" << curr_pts_.size() << \" \" << 0 << \"\\n\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttracking_info_ << (curr_pts_.size() - added_pts_.size()) << \" \" << added_pts_.size() << \" \" << num_inliers_ << \"\\n\";\n\t\t}\n\t}\n\n\treturn tracking_info_.good();\n}\n\nbool FeatureTracker::write_timing_info()\n{\n\tif(timing_info_.is_open())\n\t{\n\t\tif(frame_idx_ == 0)\n\t\t{\n\t\t\t\/\/Add comment to the first line of file\n\t\t\ttiming_info_ << \"#tracking_time ransac_time detection_time\\n\";\n\t\t}\n\n\t\ttiming_info_ << op_time_[0] << \" \" << op_time_[1] << \" \" << op_time_[2] << \"\\n\";\n\t}\n\n\treturn timing_info_.good();\n}\n\nbool FeatureTracker::write_heatmap_info()\n{\n\tif(heatmap_info_.is_open())\n\t{\n\t\tif(frame_idx_ == 0)\n\t\t{\n\t\t\t\/\/Add comment to the first line of file\n\t\t\theatmap_info_ << \"#(kp0_x, kp0_y), (kp1_x, kp1_y),..., (kpMi_x, kpMi_y)\\n\";\n\t\t}\n\n\t\tfor(size_t i = 0; i < curr_pts_.size(); i++)\n\t\t{\n\t\t\theatmap_info_ << \"(\" << (int) curr_pts_[i].x << \",\" << (int) curr_pts_[i].y << \") \";\n\t\t}\n\t\theatmap_info_ << \"\\n\";\n\t}\n\n\treturn heatmap_info_.good();\n}\n\n\/* #####################################################\n * #####                                           #####\n * #####               Public Impl.                #####\n * #####                                           #####\n * #####################################################\n *\/\n\nFeatureTracker::FeatureTracker():\n\tinitialized_(false),\n\tframe_idx_(0),\n\tnum_inliers_(0),\n\tmin_pts_(600),\n\tmax_pts_(5000)\n{\n\n}\n\nFeatureTracker::FeatureTracker(const int& min_pts, const int& max_pts, const bool& log_stats):\n\tinitialized_(false),\n\tframe_idx_(0),\n\tnum_inliers_(0),\n\tmin_pts_(min_pts),\n\tmax_pts_(max_pts)\n{\n\tif(log_stats)\n\t{\n\t\tinitialize_logger(\"timing_stats.txt\", \"tracking_stats.txt\", \"heatmap_stats.txt\");\n\t}\n}\n\nvoid FeatureTracker::initialize_logger(const string& timing_file_name, const string& tracking_file_name,\n\t\t                               const string& heatmap_file_name)\n{\n\ttiming_info_.open(timing_file_name.c_str());\n\tif(!timing_info_.is_open())\n\t{\n\t\tMLOG_ERROR(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: \\\n\t\t\t                                there is a problem with the supplied \\\n\t\t\t                                file for the timing information.\\n\");\n\t\texit(-1);\n\t}\n\n\ttracking_info_.open(tracking_file_name.c_str());\n\tif(!tracking_info_.is_open())\n\t{\n\t\tMLOG_ERROR(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: \\\n\t\t\t                                there is a problem with the supplied \\\n\t\t\t                                file for the tracking information.\\n\");\n\t\texit(-1);\n\t}\n\n\theatmap_info_.open(heatmap_file_name.c_str());\n\tif(!heatmap_info_.is_open())\n\t{\n\t\tMLOG_ERROR(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: \\\n\t\t\t                                there is a problem with the supplied \\\n\t\t\t                                file for the heatmap information.\\n\");\n\t\texit(-1);\n\t}\n\n\tMLOG_INFO(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: saving \\\n\t\t                               tracking information to %s\\n\",\n\t\t                               tracking_file_name.c_str());\n\tMLOG_INFO(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: saving \\\n\t\t                               timing information to %s\\n\",\n\t\t                               timing_file_name.c_str());\n\tMLOG_INFO(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: saving \\\n\t\t                               heatmap information to %s\\n\",\n\t\t                               heatmap_file_name.c_str());\n}<commit_msg>Reordered initialization list to clear warning messages.<commit_after>\/* \n *  Software License Agreement (BSD License)\n *\n *  Copyright (c) 2016-2020, Natalnet Laboratory for Perceptual Robotics\n *  All rights reserved.\n *  Redistribution and use in source and binary forms, with or without modification, are permitted provided\n *  that the following conditions are met:\n *\n *  1. Redistributions of source code must retain the above copyright notice, this list of conditions and\n *     the following disclaimer.\n *\n *  2. 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 * \n *  3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or\n *     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\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\n *  USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *  Author:\n *\n *  Bruno Silva\n *\/\n\n#include <cstdio>\n#include <string>\n\n#include <event_logger.h>\n#include <feature_tracker.h>\n\nusing namespace std;\n\n\/* #####################################################\n * #####                                           #####\n * #####               Private Impl.               #####\n * #####                                           #####\n * #####################################################\n *\/\n\nfloat FeatureTracker::get_avg_track_length()\n{\n\tconst size_t N = tracklets_.size();\n\n\tsize_t sum = 0;\n\tfor(size_t i = 0; i < N; i++)\n\t{\n\t\tsum += (size_t) tracklets_[i].pts2D_.size();\n\t}\n\n\treturn float(sum)\/N;\n}\n\nvoid FeatureTracker::print_track_info()\n{\n\tconst size_t N = tracklets_.size();\n\n\tfor(size_t i = 0; i < N; i++)\n\t{\n\t\tconst size_t M = tracklets_[i].pts2D_.size();\n\n\t\tprintf(\"track[%lu]: (size: %lu)\\n\\t\", i, M);\n\t\tfor(size_t j = 0; j < M; j++)\n\t\t{\n\t\t\tprintf(\"[%lu](%f,%f)->\", tracklets_[i].start_ + j, tracklets_[i].pts2D_[j].x, tracklets_[i].pts2D_[j].y);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n}\n\nfloat FeatureTracker::get_time_per_frame()\n{\n\tfloat total_time = 0.0;\n\tfor(size_t i = 0; i < op_time_.size(); i++)\n\t{\n\t\ttotal_time += op_time_[i];\n\t}\n\n\treturn total_time;\n}\n\nbool FeatureTracker::write_tracking_info()\n{\n\tif(tracking_info_.is_open())\n\t{\n\t\tif(frame_idx_ == 0)\n\t\t{\n\t\t\t\/\/Add comment to the first line of file\n\t\t\ttracking_info_ << \"#keypoints_at_motion added_pts inliers\\n\";\n\t\t\ttracking_info_ << 0 << \" \" << curr_pts_.size() << \" \" << 0 << \"\\n\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttracking_info_ << (curr_pts_.size() - added_pts_.size()) << \" \" << added_pts_.size() << \" \" << num_inliers_ << \"\\n\";\n\t\t}\n\t}\n\n\treturn tracking_info_.good();\n}\n\nbool FeatureTracker::write_timing_info()\n{\n\tif(timing_info_.is_open())\n\t{\n\t\tif(frame_idx_ == 0)\n\t\t{\n\t\t\t\/\/Add comment to the first line of file\n\t\t\ttiming_info_ << \"#tracking_time ransac_time detection_time\\n\";\n\t\t}\n\n\t\ttiming_info_ << op_time_[0] << \" \" << op_time_[1] << \" \" << op_time_[2] << \"\\n\";\n\t}\n\n\treturn timing_info_.good();\n}\n\nbool FeatureTracker::write_heatmap_info()\n{\n\tif(heatmap_info_.is_open())\n\t{\n\t\tif(frame_idx_ == 0)\n\t\t{\n\t\t\t\/\/Add comment to the first line of file\n\t\t\theatmap_info_ << \"#(kp0_x, kp0_y), (kp1_x, kp1_y),..., (kpMi_x, kpMi_y)\\n\";\n\t\t}\n\n\t\tfor(size_t i = 0; i < curr_pts_.size(); i++)\n\t\t{\n\t\t\theatmap_info_ << \"(\" << (int) curr_pts_[i].x << \",\" << (int) curr_pts_[i].y << \") \";\n\t\t}\n\t\theatmap_info_ << \"\\n\";\n\t}\n\n\treturn heatmap_info_.good();\n}\n\n\/* #####################################################\n * #####                                           #####\n * #####               Public Impl.                #####\n * #####                                           #####\n * #####################################################\n *\/\n\nFeatureTracker::FeatureTracker():\n\tinitialized_(false),\n\tframe_idx_(0),\n\tmin_pts_(600),\n\tmax_pts_(5000),\n\tnum_inliers_(0)\n{\n\n}\n\nFeatureTracker::FeatureTracker(const int& min_pts, const int& max_pts, const bool& log_stats):\n\tinitialized_(false),\n\tframe_idx_(0),\n\tmin_pts_(min_pts),\n\tmax_pts_(max_pts),\n\tnum_inliers_(0)\n{\n\tif(log_stats)\n\t{\n\t\tinitialize_logger(\"timing_stats.txt\", \"tracking_stats.txt\", \"heatmap_stats.txt\");\n\t}\n}\n\nvoid FeatureTracker::initialize_logger(const string& timing_file_name, const string& tracking_file_name,\n\t\t                               const string& heatmap_file_name)\n{\n\ttiming_info_.open(timing_file_name.c_str());\n\tif(!timing_info_.is_open())\n\t{\n\t\tMLOG_ERROR(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: \\\n\t\t\t                                there is a problem with the supplied \\\n\t\t\t                                file for the timing information.\\n\");\n\t\texit(-1);\n\t}\n\n\ttracking_info_.open(tracking_file_name.c_str());\n\tif(!tracking_info_.is_open())\n\t{\n\t\tMLOG_ERROR(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: \\\n\t\t\t                                there is a problem with the supplied \\\n\t\t\t                                file for the tracking information.\\n\");\n\t\texit(-1);\n\t}\n\n\theatmap_info_.open(heatmap_file_name.c_str());\n\tif(!heatmap_info_.is_open())\n\t{\n\t\tMLOG_ERROR(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: \\\n\t\t\t                                there is a problem with the supplied \\\n\t\t\t                                file for the heatmap information.\\n\");\n\t\texit(-1);\n\t}\n\n\tMLOG_INFO(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: saving \\\n\t\t                               tracking information to %s\\n\",\n\t\t                               tracking_file_name.c_str());\n\tMLOG_INFO(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: saving \\\n\t\t                               timing information to %s\\n\",\n\t\t                               timing_file_name.c_str());\n\tMLOG_INFO(EventLogger::M_TRACKING, \"@FeatureTracker::initialize_logger: saving \\\n\t\t                               heatmap information to %s\\n\",\n\t\t                               heatmap_file_name.c_str());\n}<|endoftext|>"}
{"text":"<commit_before><commit_msg>gui: change scale bar view<commit_after><|endoftext|>"}
{"text":"<commit_before>\n#include \"RVD.h\"\n\nnamespace P_RVD\n{\n\tRestrictedVoronoiDiagram::RestrictedVoronoiDiagram(Mesh* _M, Points* _P)\n\t{\n\t\tp_Mesh = _M;\n\t\tp_Points = _P;\n\n\t\tseeds_n = 5;\n\t}\n\n\tVector3d RestrictedVoronoiDiagram::computeCenter(const Vector3i index_triangle)\n\t{\n\t\tVector3d p1 = p_Mesh->meshVertices.getPoint(index_triangle.x);\n\t\tVector3d p2 = p_Mesh->meshVertices.getPoint(index_triangle.y);\n\t\tVector3d p3 = p_Mesh->meshVertices.getPoint(index_triangle.z);\n\n\t\treturn Math::computeCenter(p1, p2, p3);\n\t}\n\n\tVector3d RestrictedVoronoiDiagram::computeCenter(const t_index t1, const t_index t2, const t_index t3)\n\t{\n\t\treturn computeCenter(Vector3i((int)t1, (int)t2, (int)t3));\n\t}\n\n\tstd::vector<int> RestrictedVoronoiDiagram::findNearestPoints(const Vector3d _center, int _n)\n\t{\n\t\tstd::map<double, t_index> dis_index_map;\n\t\tstd::vector<int> nearest_N_index;\n\t\tstd::vector<double> temp_dis;\n\t\tdouble t;\n\t\tfor (int i = 0; i < p_Points->points_nb; ++i)\n\t\t{\n\t\t\tt = Math::computeDistance(p_Points->m_points[i], _center);\n\n\t\t\twhile (dis_index_map.count(t) != 0)\n\t\t\t\tt += 0.00000000001;\n\t\t\tdis_index_map.insert(std::pair<double, t_index>(t, i));\n\n\t\t\ttemp_dis.push_back(t);\n\t\t}\n\t\t\n\t\tstd::sort(temp_dis.begin(), temp_dis.end());\n\n\t\tfor (int i = 0; i < _n; ++i)\n\t\t{\n\t\t\tnearest_N_index.push_back(dis_index_map[temp_dis[i]]);\n\t\t}\n\t\treturn nearest_N_index;\n\t}\n\n\tbool RestrictedVoronoiDiagram::compute_RVD()\n\t{\n\t\tface_begin = 0;\n\t\tface_end = p_Mesh->meshFacets.getFacetsNumber();\n\n\t\tPolygon F;\n\t\t\/*\n\t\t\tcompute the RVD of each facet and each seed\n\t\t*\/\n\t\tfor (t_index t = face_begin; t < face_end; ++t)\n\t\t{\n\t\t\tFacet temp_facet = p_Mesh->meshFacets.getFacet(t);\n\t\t\tcurrent_center = computeCenter(temp_facet.m_v1, temp_facet.m_v2, temp_facet.m_v3);\n\n\t\t\tcurrent_near_points = findNearestPoints(current_center, seeds_n);\n\n\t\t\tfor (t_index i = 0; i < seeds_n; ++i)\n\t\t\t{\n\t\t\t\tcurrent_seed = current_near_points[i];\n\n\t\t\t\tF.initialize_from_mesh_facet(p_Mesh, t);\n\t\t\t\t\n\t\t\t\t\/*\n\t\t\t\t\tcompute the intersection between a cell and a facet\n\t\t\t\t*\/\n\t\t\t\tintersect_cell_facet(current_seed, F);\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tPolygon* RestrictedVoronoiDiagram::intersect_cell_facet(t_index seed, Polygon& F)\n\t{\n\t\tVector3d temp_seed_position = p_Points->getPoint(seed);\n\t\tseed_neighbors = findNearestPoints(temp_seed_position, seeds_n);\n\n\t\tPolygon* ping = &F;\n\t\tPolygon* pong = &polygon_buffer;\n\n\t\tfor (int i = 0; i < seeds_n; ++i)\n\t\t{\n\t\t\tint j = seed_neighbors[i];\n\n\t\t\tclip_by_plane(*ping, *pong, seed, (t_index)j);\n\t\t\t\/\/swap ping and pong\n\t\t\tswap_polygons(ping, pong);\n\t\t}\n\t\treturn &F;\n\t}\n\n\tvoid RestrictedVoronoiDiagram::swap_polygons(Polygon*& ping, Polygon*& pong)\n\t{\n\t\tif (ping != &empty_polygon && ping != &polygon_buffer) {\n\t\t\t\/\/ First clipping operation, ping points to F\n\t\t\t\/\/ (current facet copied)\n\t\t\tping = &polygon_buffer;\n\t\t\tpong = &empty_polygon;\n\t\t}\n\t\telse {\n\t\t\tP_RVD::geo_swap(ping, pong);\n\t\t}\n\t}\n\n\tvoid RestrictedVoronoiDiagram::clip_by_plane(Polygon& ping, Polygon& pong, t_index i, t_index j)\n\t{\n\t\t\/\/ pong is the result of ping\n\t\tping.clip_by_plane(pong, *p_Points, i, j);\n\t}\n}<commit_msg>add intersect_cell_facet<commit_after>\n#include \"RVD.h\"\n\nnamespace P_RVD\n{\n\tRestrictedVoronoiDiagram::RestrictedVoronoiDiagram(Mesh* _M, Points* _P)\n\t{\n\t\tp_Mesh = _M;\n\t\tp_Points = _P;\n\n\t\tseeds_n = 5;\n\t}\n\n\tVector3d RestrictedVoronoiDiagram::computeCenter(const Vector3i index_triangle)\n\t{\n\t\tVector3d p1 = p_Mesh->meshVertices.getPoint(index_triangle.x);\n\t\tVector3d p2 = p_Mesh->meshVertices.getPoint(index_triangle.y);\n\t\tVector3d p3 = p_Mesh->meshVertices.getPoint(index_triangle.z);\n\n\t\treturn Math::computeCenter(p1, p2, p3);\n\t}\n\n\tVector3d RestrictedVoronoiDiagram::computeCenter(const t_index t1, const t_index t2, const t_index t3)\n\t{\n\t\treturn computeCenter(Vector3i((int)t1, (int)t2, (int)t3));\n\t}\n\n\tstd::vector<int> RestrictedVoronoiDiagram::findNearestPoints(const Vector3d _center, int _n)\n\t{\n\t\tstd::map<double, t_index> dis_index_map;\n\t\tstd::vector<int> nearest_N_index;\n\t\tstd::vector<double> temp_dis;\n\t\tdouble t;\n\t\tfor (int i = 0; i < p_Points->points_nb; ++i)\n\t\t{\n\t\t\tt = Math::computeDistance(p_Points->m_points[i], _center);\n\n\t\t\twhile (dis_index_map.count(t) != 0)\n\t\t\t\tt += 0.00000000001;\n\t\t\tdis_index_map.insert(std::pair<double, t_index>(t, i));\n\n\t\t\ttemp_dis.push_back(t);\n\t\t}\n\t\t\n\t\tstd::sort(temp_dis.begin(), temp_dis.end());\n\n\t\tfor (int i = 0; i < _n; ++i)\n\t\t{\n\t\t\tnearest_N_index.push_back(dis_index_map[temp_dis[i]]);\n\t\t}\n\t\treturn nearest_N_index;\n\t}\n\n\tbool RestrictedVoronoiDiagram::compute_RVD()\n\t{\n\t\tface_begin = 0;\n\t\tface_end = p_Mesh->meshFacets.getFacetsNumber();\n\n\t\tPolygon F;\n\t\t\/*\n\t\t\tcompute the RVD of each facet and each seed\n\t\t*\/\n\t\tfor (t_index t = face_begin; t < face_end; ++t)\n\t\t{\n\t\t\tFacet temp_facet = p_Mesh->meshFacets.getFacet(t);\n\t\t\tcurrent_center = computeCenter(temp_facet.m_v1, temp_facet.m_v2, temp_facet.m_v3);\n\n\t\t\tcurrent_near_points = findNearestPoints(current_center, seeds_n);\n\n\t\t\tfor (t_index i = 0; i < seeds_n; ++i)\n\t\t\t{\n\t\t\t\tcurrent_seed = current_near_points[i];\n\n\t\t\t\tF.initialize_from_mesh_facet(p_Mesh, t);\n\t\t\t\t\n\t\t\t\t\/*\n\t\t\t\t\tcompute the intersection between a cell and a facet\n\t\t\t\t*\/\n\t\t\t\tcurrent_polygon = intersect_cell_facet(current_seed, F);\n\n\t\t\t\t\/\/muniplate the current polygon \n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tPolygon* RestrictedVoronoiDiagram::intersect_cell_facet(t_index seed, Polygon& F)\n\t{\n\t\tVector3d temp_seed_position = p_Points->getPoint(seed);\n\t\tseed_neighbors = findNearestPoints(temp_seed_position, seeds_n);\n\n\t\tPolygon* ping = &F;\n\t\tPolygon* pong = &polygon_buffer;\n\n\t\tfor (int i = 0; i < seeds_n; ++i)\n\t\t{\n\t\t\tint j = seed_neighbors[i];\n\n\t\t\tclip_by_plane(*ping, *pong, seed, (t_index)j);\n\t\t\t\/\/swap ping and pong\n\t\t\tswap_polygons(ping, pong);\n\t\t}\n\t\t\/\/swap the ping polygon and pong polygon\n\t\t\/\/the result must be stored in the ping polygons\n\t\treturn ping;\n\t}\n\n\tvoid RestrictedVoronoiDiagram::swap_polygons(Polygon*& ping, Polygon*& pong)\n\t{\n\t\tif (ping != &empty_polygon && ping != &polygon_buffer) {\n\t\t\t\/\/ First clipping operation, ping points to F\n\t\t\t\/\/ (current facet copied)\n\t\t\tping = &polygon_buffer;\n\t\t\tpong = &empty_polygon;\n\t\t}\n\t\telse {\n\t\t\tP_RVD::geo_swap(ping, pong);\n\t\t}\n\t}\n\n\tvoid RestrictedVoronoiDiagram::clip_by_plane(Polygon& ping, Polygon& pong, t_index i, t_index j)\n\t{\n\t\t\/\/ pong is the result of ping\n\t\tping.clip_by_plane(pong, *p_Points, i, j);\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2013, Numenta, Inc.  Unless you have purchased from\n * Numenta, Inc. a separate commercial 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\/**\n * Aligned memory allocation, needed when working with SSE.\n *\/\n\n#ifndef NTA_ALIGNED_ALLOC_HPP\n#define NTA_ALIGNED_ALLOC_HPP\n\n#ifdef NUPIC2\n#error \"AlignedAlloc.hpp is not used and should not be part of NuPIC 2\"\n#endif\n\n#ifdef NTA_PLATFORM_win32\n#include <malloc.h> \/\/ for _aligned_malloc and _aligned_free\n#endif\n\n#include <stdlib.h>\n\n\/\/--------------------------------------------------------------------------------\n\/**\n * Provides aligned memory allocation and deallocation in a cross-platform fashion.\n * Working with aligned memory is more efficient when working with SSE instructions\n * because there are specialized, fast instructions to load aligned memory into the \n * XMM registers.\n *\n * On darwin86, malloc is guaranteed to return an aligned pointer:\n * \"The malloc(), calloc(), valloc(), realloc(), and reallocf() functions allo-\n *  cate memory.  The allocated memory is aligned such that it can be used for\n *  any data type, including AltiVec- and SSE-related types.  The free() func-\n *  tion frees allocations that were created via the preceding allocation func-\n *  tions.\"\n *\n * However on Windows, special functions need to be used to achieve alignment.\n *\n * Note that there needs to be exactly as many calls to AlignedFree as there\n * are calls to AlignedMalloc.\n *\/\nnamespace nta {\n  \n  \/\/--------------------------------------------------------------------------------\n  \/**\n   * Aligned memory allocation. Call AlignedFree to deallocate.\n   * \n   * Parameters:\n   * ==========\n   * - size: size of the requested memory allocation, in bytes\n   *\/\n  inline void* AlignedMalloc(size_t size)\n  {\n#ifdef NTA_PLATFORM_win32\n    \/\/ 16 is the alignment value we need for SSE\n    return _aligned_malloc(size, 16);\n#else\n    return malloc(size);\n#endif\n  }\n\n  \/\/--------------------------------------------------------------------------------\n  \/**\n   * Aligned memory deallocation. Call AlignedMalloc to allocate.\n   *\n   * Parameters:\n   * ==========\n   * - ptr: pointer to the memory to deallocate\n   *\/\n  inline void AlignedFree(void* ptr)\n  {\n#ifdef NTA_PLATFORM_win32\n    _aligned_free(ptr);\n#else\n    free(ptr);\n#endif\n  }\n  \n}; \/\/ end namespace nta\n\n\/\/--------------------------------------------------------------------------------\n#endif \/\/NTA_ALIGNED_ALLOC_HPP\n<commit_msg>AlignedAlloc.hpp is not intended for NUPIC2<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ $Header$\n\n\/\/__________________________________________________________________________\n\/\/ ITSDigitsInfo\n\/\/\n\/\/\n\n#include <Reve\/TTreeTools.h>\n\n#include \"ITSDigitsInfo.h\"\n\/\/#include <AliITSresponseSDD.h>\n#include <AliITSCalibrationSDD.h>\n#include <AliITSdigit.h>\n#include <AliITSdigitSPD.h>\n\nusing namespace Reve;\nusing namespace Alieve;\nusing namespace std;\n\nClassImp(ITSDigitsInfo)\n\n\/**************************************************************************\/\n\nITSDigitsInfo::ITSDigitsInfo() :\n  TObject(),\n  ReferenceCount(),\n  fSPDmap(), fSDDmap(), fSSDmap(),\n  fTree (0),\n  fGeom (0),\n  fSegSPD(0), fSegSDD(0), fSegSSD(0)\n{}\n\n\/**************************************************************************\/\n\nITSDigitsInfo:: ~ITSDigitsInfo() \n{\n  map<Int_t, TClonesArray*>::iterator j;\n  for(j = fSPDmap.begin(); j != fSPDmap.end(); ++j)\n    delete j->second;\n  for(j = fSDDmap.begin(); j != fSDDmap.end(); ++j)\n    delete j->second;\n  for(j = fSSDmap.begin(); j != fSSDmap.end(); ++j)\n    delete j->second;\n\n  delete fSegSPD; delete fSegSDD; delete fSegSSD; \n  delete fGeom;\n  delete fTree;\n}\n\n\/**************************************************************************\/\n\nvoid ITSDigitsInfo::SetTree(TTree* tree)\n{\n  static const Exc_t eH(\"ITSDigitsInfo::SetTree \");\n\n  if(fGeom == 0) {\n    fGeom = new AliITSgeom();\n    fGeom->ReadNewFile(\"$REVESYS\/alice-data\/ITSgeometry.det\");\n    if(fGeom == 0)\n      throw(eH + \"can not load ITS geometry \\n\");\n  }\n\n  fTree = tree;\n\n  SetITSSegmentation();\n  \n  \/\/ create tables for scaling\n  \/\/ lowest scale factor refers to unscaled ITS module\n  fSPDScaleX[0] = 1;\n  fSPDScaleZ[0] = 1;\n  fSDDScaleX[0] = 1;\n  fSDDScaleZ[0] = 1;\n  fSSDScale [0] = 1;\n  \/\/ spd lows resolution is in the level of 8x2 readout chips\n  Int_t nx = 8; \/\/ fSegSPD->Npx()\/8; \/\/ 32\n  Int_t nz = 6; \/\/ fSegSPD->Npz()\/2; \/\/ 128\n\n  fSPDScaleX[1] = Int_t(nx); \n  fSPDScaleZ[1] = Int_t(nz); \n  fSPDScaleX[2] = Int_t(nx*2); \n  fSPDScaleZ[2] = Int_t(nz*2); \n  fSPDScaleX[3] = Int_t(nx*3); \n  fSPDScaleZ[3] = Int_t(nz*3); \n  fSPDScaleX[4] = Int_t(nx*4); \n  fSPDScaleZ[4] = Int_t(nz*4); \n\n\n  fSDDScaleX[1] = 2;\n  fSDDScaleZ[1] = 2;\n  fSDDScaleX[2] = 8;\n  fSDDScaleZ[2] = 8;\n  fSDDScaleX[3] = 16;\n  fSDDScaleZ[3] = 16;\n  fSDDScaleX[4] = 25;\n  fSDDScaleZ[4] = 25;\n\n  fSSDScale[1] = 3;\n  fSSDScale[2] = 9;\n  fSSDScale[3] = 20;\n  fSSDScale[4] = 30;\n\n  \n  \/\/ lowest scale factor refers unscaled ITS module\n  fSPDScaleX[0] = 1;\n  fSPDScaleZ[0] = 1;\n  fSDDScaleX[0] = 1;\n  fSDDScaleZ[0] = 1;\n  fSSDScale [0] = 1;\n}\n\n\/**************************************************************************\/\n\nvoid ITSDigitsInfo::SetITSSegmentation()\n{\n  \/\/ SPD\n  fSegSPD = new AliITSsegmentationSPD(fGeom);\n  \/\/SPD geometry  \n  Int_t m;\n  Float_t fNzSPD=160;\n  Float_t fZ1pitchSPD=0.0425; Float_t fZ2pitchSPD=0.0625;\n  Float_t fHlSPD=3.48;\n\n  fSPDZCoord[0]=fZ1pitchSPD -fHlSPD;\n  for (m=1; m<fNzSPD; m++) {\n    Double_t dz=fZ1pitchSPD;\n    if (m==31 || m==32 || m==63  || m==64  || m==95 || m==96 || \n        m==127 || m==128) dz=fZ2pitchSPD; \n    fSPDZCoord[m]=fSPDZCoord[m-1]+dz;\n  }\n  \n  for (m=0; m<fNzSPD; m++) {\n    Double_t dz=1.*fZ1pitchSPD;\n    if (m==31 || m==32 || m==63  || m==64  || m==95 || m==96 || \n\tm==127 || m==128) dz=1.*fZ2pitchSPD; \n    fSPDZCoord[m]-=dz;\n  }\n  \n  \/\/ end of SPD geometry\n  \n  \/\/ SDD\n  \/\/ response replaced by Calibration (March 2006).\n  AliITSresponseSDD*   resp1 = new AliITSresponseSDD();\n  AliITSCalibrationSDD* cal1 = new AliITSCalibrationSDD;\n  cal1->SetResponse(resp1);\n  fSegSDD = new AliITSsegmentationSDD(fGeom, cal1);\n\n  \/\/ SSD\n  fSegSSD = new AliITSsegmentationSSD(fGeom);\n}\n\nvoid ITSDigitsInfo::GetSPDLocalZ(Int_t j, Float_t& z)\n{\n  z = fSPDZCoord[j];\n}\n\n\/**************************************************************************\/\n\nTClonesArray* ITSDigitsInfo::GetDigits(Int_t mod, Int_t subdet)\n{\n  switch(subdet) {\n  case 0: {\n    TClonesArray* digitsSPD = 0;\n    map<Int_t, TClonesArray*>::iterator i = fSPDmap.find(mod);\n    if(i == fSPDmap.end()) {\n      fTree->SetBranchAddress(\"ITSDigitsSPD\",&digitsSPD);\n      fTree->GetEntry(mod);\n      fSPDmap[mod] = digitsSPD;\n      return digitsSPD;\n    } else {\n      return i->second;\n    }\n    break;\n  }\n  case 1: {\n    TClonesArray* digitsSDD = 0;\n    map<Int_t, TClonesArray*>::iterator i = fSDDmap.find(mod);\n    if(i == fSDDmap.end()) {\n      fTree->SetBranchAddress(\"ITSDigitsSDD\",&digitsSDD);\n      fTree->GetEntry(mod);\n      fSDDmap[mod] = digitsSDD;\n      return digitsSDD;\n    } else {\n      return i->second;\n    }\n    break;\n  }\n  case 2: {\n    TClonesArray* digitsSSD = 0;\n    map<Int_t, TClonesArray*>::iterator i = fSSDmap.find(mod);\n    if(i == fSSDmap.end()) {\n      fTree->SetBranchAddress(\"ITSDigitsSSD\",&digitsSSD);\n      fTree->GetEntry(mod);\n      fSSDmap[mod] = digitsSSD;\n      return digitsSSD;\n    } else {\n      return i->second;\n    }\n    break;\n  }\n  default:\n    return 0;\n  } \/\/end switch\n  return 0;\n}\n\n\n\/**************************************************************************\/\n\nvoid ITSDigitsInfo::Print(Option_t* ) const\n{\n  printf(\"*********************************************************\\n\");\n  printf(\"SPD module dimension (%f,%f) \\n\",fSegSPD->Dx()*0.0001, fSegSPD->Dz()*0.0001);\n  printf(\"SPD first,last module:: %d,%d \\n\", fGeom->GetStartSPD(),fGeom->GetLastSPD() );\n  printf(\"SPD num cells per module (x::%d,z::%d)\\n\",fSegSPD->Npx(), fSegSPD->Npz());\n  Int_t iz=0,ix = 0;\n  printf(\"SPD dimesion of (%d,%d) in pixel(%f,%f) \\n\", ix,iz, fSegSPD->Dpx(ix), fSegSPD->Dpz(iz));\n  iz = 32;\n  printf(\"SPD dimesion of pixel (%d,%d) are (%f,%f) \\n\", ix,iz, fSegSPD->Dpx(ix)*0.001, fSegSPD->Dpz(iz)*0.001);\n \n  printf(\"*********************************************************\\n\");\n  printf(\"SDD module dimension (%f,%f) \\n\",fSegSDD->Dx()*0.0001, fSegSDD->Dz()*0.0001);\n  printf(\"SDD first,last module:: %d,%d \\n\", fGeom->GetStartSDD(),fGeom->GetLastSDD() );\n  printf(\"SDD num cells per module (x::%d,z::%d)\\n\",fSegSDD->Npx(), fSegSDD->Npz());\n  printf(\"SDD dimesion of pixel are (%f,%f) \\n\", fSegSDD->Dpx(1)*0.001,fSegSDD->Dpz(1)*0.001);\n  printf(\"*********************************************************\\n\");\n  printf(\"SSD module dimension (%f,%f) \\n\",fSegSSD->Dx()*0.0001, fSegSSD->Dz()*0.0001);\n  printf(\"SSD first,last module:: %d,%d \\n\", fGeom->GetStartSSD(),fGeom->GetLastSSD() );\n  printf(\"SSD strips in module %d \\n\",fSegSSD->Npx());\n  printf(\"SSD strip sizes are (%f,%f) \\n\", fSegSSD->Dpx(1),fSegSSD->Dpz(1));\n  fSegSSD->SetLayer(5); Float_t ap,an;  fSegSSD->Angles(ap,an);\n  printf(\"SSD layer 5 stereoP %f stereoN %f angle \\n\",ap,an); \n  fSegSSD->SetLayer(6);  fSegSSD->Angles(ap,an);\n  printf(\"SSD layer 6 stereoP %f stereoN %f angle \\n\",ap,an); \n}\n\n\n\/*\n  printf(\"num cells %d,%d scaled %d,%d \\n\",fSegSPD->Npz(),fSegSPD->Npx(),Nz,Nx);\n  printf(\"%d digits in ITSModule %d\\n\",ne, module);\n  Float_t zn = i*(3.48*2)\/Nz - 3.48 ;\n  Float_t xo =  -fSegSPD->Dx()*0.00005 + fSegSPD->Dpx(0)*od->GetCoord2()*0.0001;\n  Float_t xn =  -fSegSPD->Dx()*0.00005 + j*0.0001*fSegSPD->Dx()\/Nx;\n  Float_t dpx = 0.0001*fSegSPD->Dx()\/Nx;\n  Float_t dpz = 3.48*2\/Nz;\n  printf(\"Z::original (%3f) scaled (%3f, %3f) \\n\", zo, zn-dpz\/2, zn+dpz\/2);\n  printf(\"X::original (%3f) scaled (%3f, %3f) \\n\", xo, xn-dpx\/2, xn+dpx\/2);\n  printf(\"%d,%d maped to %d,%d \\n\", od->GetCoord1(), od->GetCoord2(), i,j );\n*\/        \n<commit_msg>Read digits via TBranch::GetEntry() instead of TTree::GetEntry() as SPD\/SDD\/SSD entries are interleaved.<commit_after>\/\/ $Header$\n\n\/\/__________________________________________________________________________\n\/\/ ITSDigitsInfo\n\/\/\n\/\/\n\n#include <Reve\/TTreeTools.h>\n\n#include \"ITSDigitsInfo.h\"\n\/\/#include <AliITSresponseSDD.h>\n#include <AliITSCalibrationSDD.h>\n#include <AliITSdigit.h>\n#include <AliITSdigitSPD.h>\n\nusing namespace Reve;\nusing namespace Alieve;\nusing namespace std;\n\nClassImp(ITSDigitsInfo)\n\n\/**************************************************************************\/\n\nITSDigitsInfo::ITSDigitsInfo() :\n  TObject(),\n  ReferenceCount(),\n  fSPDmap(), fSDDmap(), fSSDmap(),\n  fTree (0),\n  fGeom (0),\n  fSegSPD(0), fSegSDD(0), fSegSSD(0)\n{}\n\n\/**************************************************************************\/\n\nITSDigitsInfo:: ~ITSDigitsInfo() \n{\n  map<Int_t, TClonesArray*>::iterator j;\n  for(j = fSPDmap.begin(); j != fSPDmap.end(); ++j)\n    delete j->second;\n  for(j = fSDDmap.begin(); j != fSDDmap.end(); ++j)\n    delete j->second;\n  for(j = fSSDmap.begin(); j != fSSDmap.end(); ++j)\n    delete j->second;\n\n  delete fSegSPD; delete fSegSDD; delete fSegSSD; \n  delete fGeom;\n  delete fTree;\n}\n\n\/**************************************************************************\/\n\nvoid ITSDigitsInfo::SetTree(TTree* tree)\n{\n  static const Exc_t eH(\"ITSDigitsInfo::SetTree \");\n\n  if(fGeom == 0) {\n    fGeom = new AliITSgeom();\n    fGeom->ReadNewFile(\"$REVESYS\/alice-data\/ITSgeometry.det\");\n    if(fGeom == 0)\n      throw(eH + \"can not load ITS geometry \\n\");\n  }\n\n  fTree = tree;\n\n  SetITSSegmentation();\n  \n  \/\/ create tables for scaling\n  \/\/ lowest scale factor refers to unscaled ITS module\n  fSPDScaleX[0] = 1;\n  fSPDScaleZ[0] = 1;\n  fSDDScaleX[0] = 1;\n  fSDDScaleZ[0] = 1;\n  fSSDScale [0] = 1;\n  \/\/ spd lows resolution is in the level of 8x2 readout chips\n  Int_t nx = 8; \/\/ fSegSPD->Npx()\/8; \/\/ 32\n  Int_t nz = 6; \/\/ fSegSPD->Npz()\/2; \/\/ 128\n\n  fSPDScaleX[1] = Int_t(nx); \n  fSPDScaleZ[1] = Int_t(nz); \n  fSPDScaleX[2] = Int_t(nx*2); \n  fSPDScaleZ[2] = Int_t(nz*2); \n  fSPDScaleX[3] = Int_t(nx*3); \n  fSPDScaleZ[3] = Int_t(nz*3); \n  fSPDScaleX[4] = Int_t(nx*4); \n  fSPDScaleZ[4] = Int_t(nz*4); \n\n\n  fSDDScaleX[1] = 2;\n  fSDDScaleZ[1] = 2;\n  fSDDScaleX[2] = 8;\n  fSDDScaleZ[2] = 8;\n  fSDDScaleX[3] = 16;\n  fSDDScaleZ[3] = 16;\n  fSDDScaleX[4] = 25;\n  fSDDScaleZ[4] = 25;\n\n  fSSDScale[1] = 3;\n  fSSDScale[2] = 9;\n  fSSDScale[3] = 20;\n  fSSDScale[4] = 30;\n\n  \n  \/\/ lowest scale factor refers unscaled ITS module\n  fSPDScaleX[0] = 1;\n  fSPDScaleZ[0] = 1;\n  fSDDScaleX[0] = 1;\n  fSDDScaleZ[0] = 1;\n  fSSDScale [0] = 1;\n}\n\n\/**************************************************************************\/\n\nvoid ITSDigitsInfo::SetITSSegmentation()\n{\n  \/\/ SPD\n  fSegSPD = new AliITSsegmentationSPD(fGeom);\n  \/\/SPD geometry  \n  Int_t m;\n  Float_t fNzSPD=160;\n  Float_t fZ1pitchSPD=0.0425; Float_t fZ2pitchSPD=0.0625;\n  Float_t fHlSPD=3.48;\n\n  fSPDZCoord[0]=fZ1pitchSPD -fHlSPD;\n  for (m=1; m<fNzSPD; m++) {\n    Double_t dz=fZ1pitchSPD;\n    if (m==31 || m==32 || m==63  || m==64  || m==95 || m==96 || \n        m==127 || m==128) dz=fZ2pitchSPD; \n    fSPDZCoord[m]=fSPDZCoord[m-1]+dz;\n  }\n  \n  for (m=0; m<fNzSPD; m++) {\n    Double_t dz=1.*fZ1pitchSPD;\n    if (m==31 || m==32 || m==63  || m==64  || m==95 || m==96 || \n\tm==127 || m==128) dz=1.*fZ2pitchSPD; \n    fSPDZCoord[m]-=dz;\n  }\n  \n  \/\/ end of SPD geometry\n  \n  \/\/ SDD\n  \/\/ response replaced by Calibration (March 2006).\n  AliITSresponseSDD*   resp1 = new AliITSresponseSDD();\n  AliITSCalibrationSDD* cal1 = new AliITSCalibrationSDD;\n  cal1->SetResponse(resp1);\n  fSegSDD = new AliITSsegmentationSDD(fGeom, cal1);\n\n  \/\/ SSD\n  fSegSSD = new AliITSsegmentationSSD(fGeom);\n}\n\nvoid ITSDigitsInfo::GetSPDLocalZ(Int_t j, Float_t& z)\n{\n  z = fSPDZCoord[j];\n}\n\n\/**************************************************************************\/\n\nTClonesArray* ITSDigitsInfo::GetDigits(Int_t mod, Int_t subdet)\n{\n  switch(subdet) {\n    case 0: {\n      TClonesArray* digitsSPD = 0;\n      map<Int_t, TClonesArray*>::iterator i = fSPDmap.find(mod);\n      if(i == fSPDmap.end()) {\n        TBranch* br =  fTree->GetBranch(\"ITSDigitsSPD\");\n        br->SetAddress(&digitsSPD);\n\tbr->GetEntry(mod);\n\tfSPDmap[mod] = digitsSPD;\n\treturn digitsSPD;\n      } else {\n\treturn i->second;\n      }\n      break;\n    }\n    case 1: {\n      TClonesArray* digitsSDD = 0;\n      map<Int_t, TClonesArray*>::iterator i = fSDDmap.find(mod);\n      if(i == fSDDmap.end()) {\n\tTBranch* br =  fTree->GetBranch(\"ITSDigitsSDD\");\n        br->SetAddress(&digitsSDD);\n\tbr->GetEntry(mod);\n\tfSDDmap[mod] = digitsSDD;\n\treturn digitsSDD;\n      } else {\n\treturn i->second;\n      }\n      break;\n    }\n    case 2: {\n      TClonesArray* digitsSSD = 0;\n      map<Int_t, TClonesArray*>::iterator i = fSSDmap.find(mod);\n      if(i == fSSDmap.end()) {\n\tTBranch* br =  fTree->GetBranch(\"ITSDigitsSSD\");\n        br->SetAddress(&digitsSSD);\n\tbr->GetEntry(mod);\n\n\tfSSDmap[mod] = digitsSSD;\n\treturn digitsSSD;\n      } else {\n\treturn i->second;\n      }\n      break;\n    }\n    default:\n      return 0;\n  } \/\/end switch\n  return 0;\n}\n\n\n\/**************************************************************************\/\n\nvoid ITSDigitsInfo::Print(Option_t* ) const\n{\n  printf(\"*********************************************************\\n\");\n  printf(\"SPD module dimension (%f,%f) \\n\",fSegSPD->Dx()*0.0001, fSegSPD->Dz()*0.0001);\n  printf(\"SPD first,last module:: %d,%d \\n\", fGeom->GetStartSPD(),fGeom->GetLastSPD() );\n  printf(\"SPD num cells per module (x::%d,z::%d)\\n\",fSegSPD->Npx(), fSegSPD->Npz());\n  Int_t iz=0,ix = 0;\n  printf(\"SPD dimesion of (%d,%d) in pixel(%f,%f) \\n\", ix,iz, fSegSPD->Dpx(ix), fSegSPD->Dpz(iz));\n  iz = 32;\n  printf(\"SPD dimesion of pixel (%d,%d) are (%f,%f) \\n\", ix,iz, fSegSPD->Dpx(ix)*0.001, fSegSPD->Dpz(iz)*0.001);\n \n  printf(\"*********************************************************\\n\");\n  printf(\"SDD module dimension (%f,%f) \\n\",fSegSDD->Dx()*0.0001, fSegSDD->Dz()*0.0001);\n  printf(\"SDD first,last module:: %d,%d \\n\", fGeom->GetStartSDD(),fGeom->GetLastSDD() );\n  printf(\"SDD num cells per module (x::%d,z::%d)\\n\",fSegSDD->Npx(), fSegSDD->Npz());\n  printf(\"SDD dimesion of pixel are (%f,%f) \\n\", fSegSDD->Dpx(1)*0.001,fSegSDD->Dpz(1)*0.001);\n  printf(\"*********************************************************\\n\");\n  printf(\"SSD module dimension (%f,%f) \\n\",fSegSSD->Dx()*0.0001, fSegSSD->Dz()*0.0001);\n  printf(\"SSD first,last module:: %d,%d \\n\", fGeom->GetStartSSD(),fGeom->GetLastSSD() );\n  printf(\"SSD strips in module %d \\n\",fSegSSD->Npx());\n  printf(\"SSD strip sizes are (%f,%f) \\n\", fSegSSD->Dpx(1),fSegSSD->Dpz(1));\n  fSegSSD->SetLayer(5); Float_t ap,an;  fSegSSD->Angles(ap,an);\n  printf(\"SSD layer 5 stereoP %f stereoN %f angle \\n\",ap,an); \n  fSegSSD->SetLayer(6);  fSegSSD->Angles(ap,an);\n  printf(\"SSD layer 6 stereoP %f stereoN %f angle \\n\",ap,an); \n}\n\n\n\/*\n  printf(\"num cells %d,%d scaled %d,%d \\n\",fSegSPD->Npz(),fSegSPD->Npx(),Nz,Nx);\n  printf(\"%d digits in ITSModule %d\\n\",ne, module);\n  Float_t zn = i*(3.48*2)\/Nz - 3.48 ;\n  Float_t xo =  -fSegSPD->Dx()*0.00005 + fSegSPD->Dpx(0)*od->GetCoord2()*0.0001;\n  Float_t xn =  -fSegSPD->Dx()*0.00005 + j*0.0001*fSegSPD->Dx()\/Nx;\n  Float_t dpx = 0.0001*fSegSPD->Dx()\/Nx;\n  Float_t dpz = 3.48*2\/Nz;\n  printf(\"Z::original (%3f) scaled (%3f, %3f) \\n\", zo, zn-dpz\/2, zn+dpz\/2);\n  printf(\"X::original (%3f) scaled (%3f, %3f) \\n\", xo, xn-dpx\/2, xn+dpx\/2);\n  printf(\"%d,%d maped to %d,%d \\n\", od->GetCoord1(), od->GetCoord2(), i,j );\n*\/        \n<|endoftext|>"}
{"text":"<commit_before>\/\/Copyright (c) 2020 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"RedistributeBeadingStrategy.h\"\n\n#include <algorithm>\n#include <numeric>\n\nnamespace cura\n{\n    BeadingStrategy::Beading RedistributeBeadingStrategy::compute(coord_t thickness, coord_t bead_count) const\n    {\n        Beading ret = parent->compute(thickness, bead_count);\n\n        \/\/ Early out when the only walls are outer, the parent can have been trusted to handle it. TODO: False! Now we need to lock postition\n        if (bead_count < 3)\n        {\n            if (bead_count == 2 && optimal_width_outer < (thickness \/ 2))\n            {\n                const coord_t back_pos = bead_count - 1;\n\n                \/\/ Compensate for the outer wall lock factor:\n                ret.bead_widths[0] = static_cast<coord_t>(outer_wall_lock_factor * optimal_width_outer + outer_wall_lock_inverse * ret.bead_widths[0]);\n                ret.bead_widths[back_pos] = static_cast<coord_t>(outer_wall_lock_factor * optimal_width_outer + outer_wall_lock_inverse * ret.bead_widths[back_pos]);\n                ret.toolpath_locations[0] = ret.bead_widths[0] \/ 2;\n                ret.toolpath_locations[back_pos] = thickness - ret.bead_widths[back_pos] \/ 2;\n\n                \/\/ Check if a third wall needs to be created, if so, do it, otherwise put the rest-width in leftovers:\n                coord_t left_over = std::max(static_cast<coord_t>(0), thickness - (ret.bead_widths.front() + ret.bead_widths.back()));\n                if (left_over >= this->getTransitionThickness(0))\n                {\n                    ret.bead_widths.insert(std::next(ret.bead_widths.begin()), left_over);\n                    ret.toolpath_locations.insert(std::next(ret.toolpath_locations.begin()), thickness \/ 2);\n                    ret.left_over = 0;\n                }\n                else\n                {\n                    ret.left_over = left_over;\n                }\n            }\n            return ret;\n        }\n\n        \/\/ Determine outer bead ratio\n        const coord_t outer_width = ret.bead_widths.front() + ret.bead_widths.back();\n        const coord_t outer_width_optimal = optimal_width_outer * 2;\n        const coord_t outer_width_deviation = static_cast<coord_t>(static_cast<double>(outer_width_optimal - outer_width) * outer_wall_lock_factor + 0.5);\n        const coord_t outer_width_required = outer_width + outer_width_deviation;\n        const Ratio outer_bead_ratio = static_cast<double>(outer_width_required) \/ static_cast<double>(outer_width);\n\n        \/\/ Update outer beads\n        ret.bead_widths.front() = static_cast<coord_t>(static_cast<double>(ret.bead_widths.front()) * outer_bead_ratio + 0.5);\n        ret.bead_widths.back() = static_cast<coord_t>(static_cast<double>(ret.bead_widths.back()) * outer_bead_ratio + 0.5);\n\n        \/\/ Determine inner bead ratio\n        auto inner_bead_width_begin = std::next(ret.bead_widths.begin());\n        auto inner_bead_width_end = std::prev(ret.bead_widths.end());\n        const coord_t total_inner_bead_width =\n            std::accumulate(inner_bead_width_begin, inner_bead_width_end, static_cast<coord_t>(0));\n        const coord_t total_required_inner_bead_width =\n            thickness - ret.bead_widths.front() - ret.bead_widths.back();\n        const Ratio inner_bead_ratio =\n            static_cast<double>(total_required_inner_bead_width) \/ static_cast<double>(total_inner_bead_width);\n\n        for (auto bead_width_it = inner_bead_width_begin; bead_width_it < inner_bead_width_end; bead_width_it++)\n        {\n            *bead_width_it = static_cast<coord_t>(static_cast<double>(*bead_width_it) * inner_bead_ratio + 0.5);\n        }\n\n        \/\/ Filter out bead_widths that violate the transition width and recalculate if needed\n        ret.bead_widths.erase(std::remove_if(ret.bead_widths.begin(), ret.bead_widths.end(),\n                                             [&](const coord_t width)\n                                             {\n                                                 return width <= parent->getTransitionThickness(0);\n                                             }), ret.bead_widths.end());\n        if (ret.bead_widths.size() < ret.toolpath_locations.size())\n        {\n            const coord_t left_over = thickness - std::accumulate(ret.bead_widths.cbegin(), ret.bead_widths.cend(), static_cast<coord_t>(0));\n            logWarning(\"Removed a bead -> leftover %d, no_beads -> %d, you should update!\\n\", left_over, ret.bead_widths.size());\n        }\n        bead_count = ret.bead_widths.size();\n        ret.toolpath_locations.resize(bead_count);\n\n        \/\/ Update the first half of the toolpath-locations with the updated bead-widths (starting from 0, up to half):\n        coord_t last_coord = 0;\n        coord_t last_width = 0;\n        for (coord_t i_location = 0; i_location < bead_count \/ 2; ++i_location)\n        {\n            ret.toolpath_locations[i_location] = last_coord + (last_width + ret.bead_widths[i_location]) \/ 2;\n            last_coord = ret.toolpath_locations[i_location];\n            last_width = ret.bead_widths[i_location];\n        }\n\n        \/\/ Handle the position of any middle wall (note that the width will already have been set correctly):\n        if (bead_count % 2 == 1)\n        {\n            ret.toolpath_locations[bead_count \/ 2] = thickness \/ 2;\n        }\n\n        \/\/ Update the last half of the toolpath-locations with the updated bead-widths (starting from thickness, down to half):\n        last_coord = thickness;\n        last_width = 0;\n        for (coord_t i_location = bead_count - 1; i_location >= bead_count - (bead_count \/ 2); --i_location)\n        {\n            ret.toolpath_locations[i_location] = last_coord - (last_width + ret.bead_widths[i_location]) \/ 2;\n            last_coord = ret.toolpath_locations[i_location];\n            last_width = ret.bead_widths[i_location];\n        }\n\n        ret.left_over = thickness - std::accumulate(ret.bead_widths.cbegin(), ret.bead_widths.cend(), static_cast<coord_t>(0));\n        return ret;\n    }\n\n    } \/\/ namespace cura\n<commit_msg>Make sure that all beads still adhere to minimum width<commit_after>\/\/Copyright (c) 2020 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"RedistributeBeadingStrategy.h\"\n\n#include <algorithm>\n#include <numeric>\n#include <cassert>\n\nnamespace cura\n{\n    BeadingStrategy::Beading RedistributeBeadingStrategy::compute(coord_t thickness, coord_t bead_count) const\n    {\n        Beading ret = parent->compute(thickness, bead_count);\n\n        \/\/ Early out when the only walls are outer, the parent can have been trusted to handle it. TODO: False! Now we need to lock postition\n        if (bead_count < 3)\n        {\n            if (bead_count == 2 && optimal_width_outer < (thickness \/ 2))\n            {\n                const coord_t back_pos = bead_count - 1;\n\n                \/\/ Compensate for the outer wall lock factor:\n                ret.bead_widths[0] = static_cast<coord_t>(outer_wall_lock_factor * optimal_width_outer + outer_wall_lock_inverse * ret.bead_widths[0]);\n                ret.bead_widths[back_pos] = static_cast<coord_t>(outer_wall_lock_factor * optimal_width_outer + outer_wall_lock_inverse * ret.bead_widths[back_pos]);\n                ret.toolpath_locations[0] = ret.bead_widths[0] \/ 2;\n                ret.toolpath_locations[back_pos] = thickness - ret.bead_widths[back_pos] \/ 2;\n\n                \/\/ Check if a third wall needs to be created, if so, do it, otherwise put the rest-width in leftovers:\n                coord_t left_over = std::max(static_cast<coord_t>(0), thickness - (ret.bead_widths.front() + ret.bead_widths.back()));\n                if (left_over >= this->getTransitionThickness(0))\n                {\n                    ret.bead_widths.insert(std::next(ret.bead_widths.begin()), left_over);\n                    ret.toolpath_locations.insert(std::next(ret.toolpath_locations.begin()), thickness \/ 2);\n                    ret.left_over = 0;\n                }\n                else\n                {\n                    ret.left_over = left_over;\n                }\n            }\n            return ret;\n        }\n\n        \/\/ Determine outer bead ratio\n        const coord_t outer_width = ret.bead_widths.front() + ret.bead_widths.back();\n        const coord_t outer_width_optimal = optimal_width_outer * 2;\n        const coord_t outer_width_deviation = static_cast<coord_t>(static_cast<double>(outer_width_optimal - outer_width) * outer_wall_lock_factor + 0.5);\n        const coord_t outer_width_required = outer_width + outer_width_deviation;\n        const Ratio outer_bead_ratio = static_cast<double>(outer_width_required) \/ static_cast<double>(outer_width);\n\n        \/\/ Update outer beads\n        ret.bead_widths.front() = static_cast<coord_t>(static_cast<double>(ret.bead_widths.front()) * outer_bead_ratio + 0.5);\n        ret.bead_widths.back() = static_cast<coord_t>(static_cast<double>(ret.bead_widths.back()) * outer_bead_ratio + 0.5);\n\n        \/\/ Determine inner bead ratio\n        auto inner_bead_width_begin = std::next(ret.bead_widths.begin());\n        auto inner_bead_width_end = std::prev(ret.bead_widths.end());\n        const coord_t total_inner_bead_width =\n            std::accumulate(inner_bead_width_begin, inner_bead_width_end, static_cast<coord_t>(0));\n        const coord_t total_required_inner_bead_width =\n            thickness - ret.bead_widths.front() - ret.bead_widths.back();\n        const Ratio inner_bead_ratio =\n            static_cast<double>(total_required_inner_bead_width) \/ static_cast<double>(total_inner_bead_width);\n\n        for (auto bead_width_it = inner_bead_width_begin; bead_width_it < inner_bead_width_end; bead_width_it++)\n        {\n            *bead_width_it = static_cast<coord_t>(static_cast<double>(*bead_width_it) * inner_bead_ratio + 0.5);\n        }\n\n        \/\/ Filter out bead_widths that violate the transition width and recalculate if needed\n        const coord_t minimum_width = parent->getTransitionThickness(0);\n        ret.bead_widths.erase(std::remove_if(ret.bead_widths.begin(), ret.bead_widths.end(),\n                                             [&minimum_width](const coord_t width)\n                                             {\n                                                 return width <= minimum_width;\n                                             }), ret.bead_widths.end());\n        if (ret.bead_widths.size() < ret.toolpath_locations.size())\n        {\n            \/\/ NOTE: For now work under assumption that only 1 bead has to be added\n            const coord_t left_over = thickness - std::accumulate(ret.bead_widths.cbegin(), ret.bead_widths.cend(), static_cast<coord_t>(0));\n            \/\/ remove width from other beads, to give way for newly inserted bead\n            const coord_t removal_width = (minimum_width - left_over) \/ ret.bead_widths.size();\n            for (auto& bead_width : ret.bead_widths)\n            {\n                bead_width -= removal_width;\n            }\n\n            \/\/ Insert new bead with minimum width\n            ret.bead_widths.insert(std::next(ret.bead_widths.begin()), minimum_width);\n            ret.toolpath_locations.insert(std::next(ret.toolpath_locations.begin()), thickness \/ 2);\n\n            logWarning(\"Removed a bead -> leftover %d, no_beads -> %d, you should update!\\n\", left_over, ret.bead_widths.size());\n        }\n        bead_count = static_cast<coord_t>(ret.bead_widths.size());\n        ret.toolpath_locations.resize(bead_count);\n\n        \/\/ Update the first half of the toolpath-locations with the updated bead-widths (starting from 0, up to half):\n        coord_t last_coord = 0;\n        coord_t last_width = 0;\n        for (coord_t i_location = 0; i_location < bead_count \/ 2; ++i_location)\n        {\n            ret.toolpath_locations[i_location] = last_coord + (last_width + ret.bead_widths[i_location]) \/ 2;\n            last_coord = ret.toolpath_locations[i_location];\n            last_width = ret.bead_widths[i_location];\n        }\n\n        \/\/ Handle the position of any middle wall (note that the width will already have been set correctly):\n        if (bead_count % 2 == 1)\n        {\n            ret.toolpath_locations[bead_count \/ 2] = thickness \/ 2;\n        }\n\n        \/\/ Update the last half of the toolpath-locations with the updated bead-widths (starting from thickness, down to half):\n        last_coord = thickness;\n        last_width = 0;\n        for (coord_t i_location = bead_count - 1; i_location >= bead_count - (bead_count \/ 2); --i_location)\n        {\n            ret.toolpath_locations[i_location] = last_coord - (last_width + ret.bead_widths[i_location]) \/ 2;\n            last_coord = ret.toolpath_locations[i_location];\n            last_width = ret.bead_widths[i_location];\n        }\n\n        ret.left_over = thickness - std::accumulate(ret.bead_widths.cbegin(), ret.bead_widths.cend(), static_cast<coord_t>(0));\n        assert(std::all_of(ret.bead_widths.begin(), ret.bead_widths.end(),\n                           [&minimum_width](const coord_t width)\n                           {\n                             return width >= minimum_width;\n                           }) && \"All beads should be atleast the minimum bead width\");\n        return ret;\n    }\n\n    } \/\/ namespace cura\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          tool.cpp\n* Purpose:       Implementation of wxExTool class\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 1998-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\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\/stdpaths.h>\n#include <wx\/textfile.h>\n#include <wx\/extension\/tool.h>\n#include <wx\/extension\/frame.h>\n#include <wx\/extension\/log.h>\n#include <wx\/extension\/statistics.h>\n#include <wx\/extension\/vcs.h>\n\nwxExTool* wxExTool::m_Self = NULL;\n\nwxExTool::wxExTool(int type)\n  : m_Id(type)\n{\n}\n\nwxExTool* wxExTool::Get(bool createOnDemand)\n{\n  if (m_Self == NULL && createOnDemand)\n  {\n    m_Self = new wxExTool(0);\n\n    m_Self->AddInfo(ID_TOOL_REVISION_RECENT, _(\"Recent revision from\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_REVISION, _(\"Reported %ld revisions in\"), _(\"Report &Revision\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_COUNT, _(\"Counted\"), _(\"Report &Count\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_FIND, _(\"Found %ld matches in\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_REPLACE, _(\"Replaced %ld matches in\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_KEYWORD, _(\"Reported %ld keywords in\"), _(\"Report &Keyword\"));\n  }\n\n  return m_Self;\n}\n\nconst wxString wxExTool::Info() const\n{\n  const auto it = m_Self->m_ToolInfo.find(m_Id);\n\n  if (it != m_Self->m_ToolInfo.end())\n  {\n    return it->second.GetInfo();\n  }\n\n  wxFAIL;\n\n  return wxEmptyString;\n}\n\nvoid wxExTool::Log(\n  wxExStatistics<long>* stat, \n  const wxString& caption, \n  bool log_to_file) const\n{\n  wxString logtext(Info());\n\n  if (logtext.Contains(\"%ld\"))\n  {\n    logtext = logtext.Format(logtext, stat->Get(_(\"Actions Completed\")));\n  }\n\n  logtext\n    << \" \" << stat->Get(_(\"Files\")) << \" \" << _(\"file(s)\")\n    << (!caption.empty() ? \": \" + caption: \"\");\n\n#if wxUSE_STATUSBAR\n  wxExFrame::StatusText(logtext);\n#endif\n\n  if (log_to_file && stat->Get(_(\"Files\")) != 0)\n  {\n    wxExLog::Get()->Log(logtext);\n\n    if (IsCount())\n    {\n      wxString logtext;\n\n      logtext\n        << caption\n        << stat->Get()\n        << wxTextFile::GetEOL();\n\n      wxExLog log(GetLogfileName());\n      log.Log(logtext);\n    }\n  }\n}\n\nconst wxFileName wxExTool::GetLogfileName() const\n{\n  wxFileName filename(\n#ifdef wxExUSE_PORTABLE\n    wxPathOnly(wxStandardPaths::Get().GetExecutablePath())\n#else\n    wxStandardPaths::Get().GetUserDataDir()\n#endif\n    + wxFileName::GetPathSeparator() + _(\"statistics.log\"));\n\n  return filename;\n}\n\nwxExTool* wxExTool::Set(wxExTool* tool)\n{\n  wxExTool* old = m_Self;\n  m_Self = tool;\n  return old;\n}\n<commit_msg>reordered<commit_after>\/******************************************************************************\\\n* File:          tool.cpp\n* Purpose:       Implementation of wxExTool class\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 1998-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\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\/stdpaths.h>\n#include <wx\/textfile.h>\n#include <wx\/extension\/tool.h>\n#include <wx\/extension\/frame.h>\n#include <wx\/extension\/log.h>\n#include <wx\/extension\/statistics.h>\n#include <wx\/extension\/vcs.h>\n\nwxExTool* wxExTool::m_Self = NULL;\n\nwxExTool::wxExTool(int type)\n  : m_Id(type)\n{\n}\n\nwxExTool* wxExTool::Get(bool createOnDemand)\n{\n  if (m_Self == NULL && createOnDemand)\n  {\n    m_Self = new wxExTool(0);\n\n    m_Self->AddInfo(ID_TOOL_REVISION_RECENT, _(\"Recent revision from\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_REVISION, _(\"Reported %ld revisions in\"), _(\"Report &Revision\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_COUNT, _(\"Counted\"), _(\"Report &Count\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_FIND, _(\"Found %ld matches in\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_REPLACE, _(\"Replaced %ld matches in\"));\n    m_Self->AddInfo(ID_TOOL_REPORT_KEYWORD, _(\"Reported %ld keywords in\"), _(\"Report &Keyword\"));\n  }\n\n  return m_Self;\n}\n\nconst wxFileName wxExTool::GetLogfileName() const\n{\n  wxFileName filename(\n#ifdef wxExUSE_PORTABLE\n    wxPathOnly(wxStandardPaths::Get().GetExecutablePath())\n#else\n    wxStandardPaths::Get().GetUserDataDir()\n#endif\n    + wxFileName::GetPathSeparator() + _(\"statistics.log\"));\n\n  return filename;\n}\n\nconst wxString wxExTool::Info() const\n{\n  const auto it = m_Self->m_ToolInfo.find(m_Id);\n\n  if (it != m_Self->m_ToolInfo.end())\n  {\n    return it->second.GetInfo();\n  }\n\n  wxFAIL;\n\n  return wxEmptyString;\n}\n\nvoid wxExTool::Log(\n  wxExStatistics<long>* stat, \n  const wxString& caption, \n  bool log_to_file) const\n{\n  wxString logtext(Info());\n\n  if (logtext.Contains(\"%ld\"))\n  {\n    logtext = logtext.Format(logtext, stat->Get(_(\"Actions Completed\")));\n  }\n\n  logtext\n    << \" \" << stat->Get(_(\"Files\")) << \" \" << _(\"file(s)\")\n    << (!caption.empty() ? \": \" + caption: \"\");\n\n#if wxUSE_STATUSBAR\n  wxExFrame::StatusText(logtext);\n#endif\n\n  if (log_to_file && stat->Get(_(\"Files\")) != 0)\n  {\n    wxExLog::Get()->Log(logtext);\n\n    if (IsCount())\n    {\n      wxString logtext;\n\n      logtext\n        << caption\n        << stat->Get()\n        << wxTextFile::GetEOL();\n\n      wxExLog log(GetLogfileName());\n      log.Log(logtext);\n    }\n  }\n}\n\nwxExTool* wxExTool::Set(wxExTool* tool)\n{\n  wxExTool* old = m_Self;\n  m_Self = tool;\n  return old;\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.chromium file.\n\n#include \"native_mate\/wrappable.h\"\n\n#include \"base\/logging.h\"\n#include \"native_mate\/object_template_builder.h\"\n\nnamespace mate {\n\nWrappable::Wrappable() {\n}\n\nWrappable::~Wrappable() {\n  MATE_PERSISTENT_RESET(wrapper_);\n}\n\nvoid Wrappable::Wrap(v8::Isolate* isolate, v8::Handle<v8::Object> wrapper) {\n  MATE_SET_INTERNAL_FIELD_POINTER(wrapper, 0, this);\n  MATE_PERSISTENT_ASSIGN(v8::Object, isolate, wrapper_, wrapper);\n  MATE_PERSISTENT_SET_WEAK(wrapper_, this, WeakCallback);\n}\n\n\/\/ static\nvoid Wrappable::BuildPrototype(v8::Isolate* isolate,\n                               v8::Handle<v8::ObjectTemplate> prototype) {\n}\n\nObjectTemplateBuilder Wrappable::GetObjectTemplateBuilder(\n    v8::Isolate* isolate) {\n  return ObjectTemplateBuilder(isolate);\n}\n\n\/\/ static\nMATE_WEAK_CALLBACK(Wrappable::WeakCallback, v8::Object, Wrappable) {\n  MATE_WEAK_CALLBACK_INIT(Wrappable);\n  MATE_PERSISTENT_RESET(self->wrapper_);\n  delete self;\n}\n\nv8::Handle<v8::Object> Wrappable::GetWrapper(v8::Isolate* isolate) {\n  if (!wrapper_.IsEmpty()) {\n    return MATE_PERSISTENT_TO_LOCAL(v8::Object, isolate, wrapper_);\n  }\n\n  v8::Local<v8::ObjectTemplate> templ =\n      GetObjectTemplateBuilder(isolate).Build();\n  CHECK(!templ.IsEmpty());\n  CHECK_EQ(1, templ->InternalFieldCount());\n  v8::Handle<v8::Object> wrapper = templ->NewInstance();\n  Wrap(isolate, wrapper);\n  return wrapper;\n}\n\nnamespace internal {\n\nvoid* FromV8Impl(v8::Isolate* isolate, v8::Handle<v8::Value> val) {\n  if (!val->IsObject())\n    return NULL;\n  v8::Handle<v8::Object> obj = v8::Handle<v8::Object>::Cast(val);\n  return MATE_GET_INTERNAL_FIELD_POINTER(obj, 0);\n}\n\n}  \/\/ namespace internal\n\n}  \/\/ namespace mate\n<commit_msg>Do not wrap an object when it's already wrapped.<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.chromium file.\n\n#include \"native_mate\/wrappable.h\"\n\n#include \"base\/logging.h\"\n#include \"native_mate\/object_template_builder.h\"\n\nnamespace mate {\n\nWrappable::Wrappable() {\n}\n\nWrappable::~Wrappable() {\n  MATE_PERSISTENT_RESET(wrapper_);\n}\n\nvoid Wrappable::Wrap(v8::Isolate* isolate, v8::Handle<v8::Object> wrapper) {\n  if (!wrapper_.IsEmpty())\n    return;\n\n  MATE_SET_INTERNAL_FIELD_POINTER(wrapper, 0, this);\n  MATE_PERSISTENT_ASSIGN(v8::Object, isolate, wrapper_, wrapper);\n  MATE_PERSISTENT_SET_WEAK(wrapper_, this, WeakCallback);\n}\n\n\/\/ static\nvoid Wrappable::BuildPrototype(v8::Isolate* isolate,\n                               v8::Handle<v8::ObjectTemplate> prototype) {\n}\n\nObjectTemplateBuilder Wrappable::GetObjectTemplateBuilder(\n    v8::Isolate* isolate) {\n  return ObjectTemplateBuilder(isolate);\n}\n\n\/\/ static\nMATE_WEAK_CALLBACK(Wrappable::WeakCallback, v8::Object, Wrappable) {\n  MATE_WEAK_CALLBACK_INIT(Wrappable);\n  MATE_PERSISTENT_RESET(self->wrapper_);\n  delete self;\n}\n\nv8::Handle<v8::Object> Wrappable::GetWrapper(v8::Isolate* isolate) {\n  if (!wrapper_.IsEmpty())\n    return MATE_PERSISTENT_TO_LOCAL(v8::Object, isolate, wrapper_);\n\n  v8::Local<v8::ObjectTemplate> templ =\n      GetObjectTemplateBuilder(isolate).Build();\n  CHECK(!templ.IsEmpty());\n  CHECK_EQ(1, templ->InternalFieldCount());\n  v8::Handle<v8::Object> wrapper = templ->NewInstance();\n  Wrap(isolate, wrapper);\n  return wrapper;\n}\n\nnamespace internal {\n\nvoid* FromV8Impl(v8::Isolate* isolate, v8::Handle<v8::Value> val) {\n  if (!val->IsObject())\n    return NULL;\n  v8::Handle<v8::Object> obj = v8::Handle<v8::Object>::Cast(val);\n  return MATE_GET_INTERNAL_FIELD_POINTER(obj, 0);\n}\n\n}  \/\/ namespace internal\n\n}  \/\/ namespace mate\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#ifndef __BENG_HTTP_SERVER_INTERNAL_H\n#define __BENG_HTTP_SERVER_INTERNAL_H\n\n#include \"Error.hxx\"\n#include \"http_server.hxx\"\n#include \"http_body.hxx\"\n#include \"filtered_socket.hxx\"\n#include \"net\/SocketAddress.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"event\/DeferEvent.hxx\"\n#include \"istream\/Pointer.hxx\"\n#include \"http\/Method.h\"\n#include \"util\/Cancellable.hxx\"\n#include \"util\/Exception.hxx\"\n\nstruct HttpServerConnection final : IstreamHandler {\n    enum class BucketResult {\n        MORE,\n        BLOCKING,\n        DEPLETED,\n        DESTROYED,\n    };\n\n    struct RequestBodyReader : HttpBodyReader {\n        HttpServerConnection &connection;\n\n        RequestBodyReader(struct pool &_pool,\n                          HttpServerConnection &_connection)\n            :HttpBodyReader(_pool),\n             connection(_connection) {}\n\n        \/* virtual methods from class Istream *\/\n\n        off_t _GetAvailable(bool partial) override;\n        void _Read() override;\n        void _Close() override;\n    };\n\n    struct pool *pool;\n\n    \/* I\/O *\/\n    FilteredSocket socket;\n\n    \/**\n     * Track the total time for idle periods plus receiving all\n     * headers from the client.  Unlike the #filtered_socket read\n     * timeout, it is not refreshed after receiving some header data.\n     *\/\n    TimerEvent idle_timeout;\n\n    DeferEvent defer_read;\n\n    enum http_server_score score = HTTP_SERVER_NEW;\n\n    \/* handler *\/\n    HttpServerConnectionHandler *handler;\n\n    \/* info *\/\n\n    SocketAddress local_address, remote_address;\n\n    const char *local_host_and_port;\n    const char *remote_host_and_port, *remote_host;\n\n    \/* request *\/\n    struct Request {\n        enum {\n            \/** there is no request (yet); waiting for the request\n                line *\/\n            START,\n\n            \/** parsing request headers; waiting for empty line *\/\n            HEADERS,\n\n            \/** reading the request body *\/\n            BODY,\n\n            \/** the request has been consumed, and we are going to send the response *\/\n            END\n        } read_state = START;\n\n        \/**\n         * This flag is true if we are currently calling the HTTP\n         * request handler.  During this period,\n         * http_server_request_stream_read() does nothing, to prevent\n         * recursion.\n         *\/\n        bool in_handler;\n\n        \/** has the client sent a HTTP\/1.0 request? *\/\n        bool http_1_0;\n\n        \/** did the client send an \"Expect: 100-continue\" header? *\/\n        bool expect_100_continue;\n\n        \/** send a \"417 Expectation Failed\" response? *\/\n        bool expect_failed;\n\n        HttpServerRequest *request = nullptr;\n\n        CancellablePointer cancel_ptr;\n\n        uint64_t bytes_received = 0;\n    } request;\n\n    \/** the request body reader; this variable is only valid if\n        read_state==READ_BODY *\/\n    RequestBodyReader *request_body_reader;\n\n    \/** the response; this struct is only valid if\n        read_state==READ_BODY||read_state==READ_END *\/\n    struct Response {\n        bool want_write;\n\n        \/**\n         * Are we currently waiting for all output buffers to be\n         * drained, before we can close the socket?\n         *\n         * @see BufferedSocketHandler::drained\n         * @see http_server_socket_drained()\n         *\/\n        bool pending_drained = false;\n\n        http_status_t status;\n        char status_buffer[64];\n        char content_length_buffer[32];\n        IstreamPointer istream;\n        off_t length;\n\n        uint64_t bytes_sent = 0;\n\n        Response()\n            :istream(nullptr) {}\n    } response;\n\n    bool date_header;\n\n    \/* connection settings *\/\n    bool keep_alive;\n\n    HttpServerConnection(struct pool &_pool,\n                         EventLoop &_loop,\n                         SocketDescriptor fd, FdType fd_type,\n                         const SocketFilter *filter,\n                         void *filter_ctx,\n                         SocketAddress _local_address,\n                         SocketAddress _remote_address,\n                         bool _date_header,\n                         HttpServerConnectionHandler &_handler);\n\n    ~HttpServerConnection() {\n        defer_read.Cancel();\n    }\n\n    void Delete() {\n        this->~HttpServerConnection();\n        pool_unref(pool);\n    }\n\n    EventLoop &GetEventLoop() {\n        return defer_read.GetEventLoop();\n    }\n\n    gcc_pure\n    bool IsValid() const {\n        return socket.IsValid() && socket.IsConnected();\n    }\n\n    void IdleTimeoutCallback();\n\n    void Log();\n\n    void OnDeferredRead();\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool ParseRequestLine(const char *line, size_t length);\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool HeadersFinished();\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool HandleLine(const char *line, size_t length);\n\n    BufferedResult FeedHeaders(const void *_data, size_t length);\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool SubmitRequest();\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    BufferedResult Feed(const void *data, size_t size);\n\n    \/**\n     * Send data from the input buffer to the request body istream\n     * handler.\n     *\/\n    BufferedResult FeedRequestBody(const void *data, size_t size);\n\n    \/**\n     * Attempt a \"direct\" transfer of the request body.  Caller must\n     * hold an additional pool reference.\n     *\/\n    DirectResult TryRequestBodyDirect(int fd, FdType fd_type);\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool MaybeSend100Continue();\n\n    void SetResponseIstream(Istream &r);\n\n    \/**\n     * To be called after the response istream has seen end-of-file,\n     * and has been destroyed.\n     *\n     * @return false if the connection has been closed\n     *\/\n    bool ResponseIstreamFinished();\n\n    void SubmitResponse(http_status_t status,\n                        HttpHeaders &&headers,\n                        Istream *body);\n\n    void ScheduleWrite() {\n        response.want_write = true;\n        socket.ScheduleWrite();\n    }\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool TryWrite();\n    BucketResult TryWriteBuckets2();\n    BucketResult TryWriteBuckets();\n\n    void CloseRequest();\n\n    void CloseSocket();\n    void DestroySocket();\n\n    \/**\n     * The last response on this connection is finished, and it should\n     * be closed.\n     *\/\n    void Done();\n\n    \/**\n     * The peer has closed the socket.\n     *\/\n    void Cancel();\n\n    \/**\n     * A fatal error has occurred, and the connection should be closed\n     * immediately, without sending any further information to the\n     * client.  This invokes\n     * HttpServerConnectionHandler::HttpConnectionError(), but not\n     * HttpServerConnectionHandler::HttpConnectionClosed().\n     *\/\n    void Error(std::exception_ptr e);\n\n    void Error(const char *msg);\n\n    void SocketErrorErrno(const char *msg);\n\n    template<typename T>\n    void SocketError(T &&t) {\n        try {\n            ThrowException(std::forward<T>(t));\n        } catch (...) {\n            Error(std::make_exception_ptr(HttpServerSocketError()));\n        }\n    }\n\n    void SocketError(const char *msg) {\n        SocketError(std::runtime_error(msg));\n    }\n\n    void ProtocolError(const char *msg) {\n        Error(std::make_exception_ptr(HttpServerProtocolError(msg)));\n    }\n\n    \/* virtual methods from class IstreamHandler *\/\n    size_t OnData(const void *data, size_t length) override;\n    ssize_t OnDirect(FdType type, int fd, size_t max_length) override;\n    void OnEof() override;\n    void OnError(std::exception_ptr ep) override;\n};\n\n\/**\n * The timeout of an idle connection (READ_START).\n *\/\nextern const struct timeval http_server_idle_timeout;\n\n\/**\n * The total timeout of a client sending request headers.\n *\/\nextern const struct timeval http_server_header_timeout;\n\n\/**\n * The timeout for reading more request data (READ_BODY).\n *\/\nextern const struct timeval http_server_read_timeout;\n\n\/**\n * The timeout for writing more response data (READ_BODY, READ_END).\n *\/\nextern const struct timeval http_server_write_timeout;\n\nHttpServerRequest *\nhttp_server_request_new(HttpServerConnection *connection,\n                        http_method_t method,\n                        StringView uri);\n\n#endif\n<commit_msg>http_server: make several attributes const<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#ifndef __BENG_HTTP_SERVER_INTERNAL_H\n#define __BENG_HTTP_SERVER_INTERNAL_H\n\n#include \"Error.hxx\"\n#include \"http_server.hxx\"\n#include \"http_body.hxx\"\n#include \"filtered_socket.hxx\"\n#include \"net\/SocketAddress.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"event\/DeferEvent.hxx\"\n#include \"istream\/Pointer.hxx\"\n#include \"http\/Method.h\"\n#include \"util\/Cancellable.hxx\"\n#include \"util\/Exception.hxx\"\n\nstruct HttpServerConnection final : IstreamHandler {\n    enum class BucketResult {\n        MORE,\n        BLOCKING,\n        DEPLETED,\n        DESTROYED,\n    };\n\n    struct RequestBodyReader : HttpBodyReader {\n        HttpServerConnection &connection;\n\n        RequestBodyReader(struct pool &_pool,\n                          HttpServerConnection &_connection)\n            :HttpBodyReader(_pool),\n             connection(_connection) {}\n\n        \/* virtual methods from class Istream *\/\n\n        off_t _GetAvailable(bool partial) override;\n        void _Read() override;\n        void _Close() override;\n    };\n\n    struct pool *const pool;\n\n    \/* I\/O *\/\n    FilteredSocket socket;\n\n    \/**\n     * Track the total time for idle periods plus receiving all\n     * headers from the client.  Unlike the #filtered_socket read\n     * timeout, it is not refreshed after receiving some header data.\n     *\/\n    TimerEvent idle_timeout;\n\n    DeferEvent defer_read;\n\n    enum http_server_score score = HTTP_SERVER_NEW;\n\n    \/* handler *\/\n    HttpServerConnectionHandler *handler;\n\n    \/* info *\/\n\n    const SocketAddress local_address, remote_address;\n\n    const char *const local_host_and_port;\n    const char *const remote_host_and_port, *const remote_host;\n\n    \/* request *\/\n    struct Request {\n        enum {\n            \/** there is no request (yet); waiting for the request\n                line *\/\n            START,\n\n            \/** parsing request headers; waiting for empty line *\/\n            HEADERS,\n\n            \/** reading the request body *\/\n            BODY,\n\n            \/** the request has been consumed, and we are going to send the response *\/\n            END\n        } read_state = START;\n\n        \/**\n         * This flag is true if we are currently calling the HTTP\n         * request handler.  During this period,\n         * http_server_request_stream_read() does nothing, to prevent\n         * recursion.\n         *\/\n        bool in_handler;\n\n        \/** has the client sent a HTTP\/1.0 request? *\/\n        bool http_1_0;\n\n        \/** did the client send an \"Expect: 100-continue\" header? *\/\n        bool expect_100_continue;\n\n        \/** send a \"417 Expectation Failed\" response? *\/\n        bool expect_failed;\n\n        HttpServerRequest *request = nullptr;\n\n        CancellablePointer cancel_ptr;\n\n        uint64_t bytes_received = 0;\n    } request;\n\n    \/** the request body reader; this variable is only valid if\n        read_state==READ_BODY *\/\n    RequestBodyReader *request_body_reader;\n\n    \/** the response; this struct is only valid if\n        read_state==READ_BODY||read_state==READ_END *\/\n    struct Response {\n        bool want_write;\n\n        \/**\n         * Are we currently waiting for all output buffers to be\n         * drained, before we can close the socket?\n         *\n         * @see BufferedSocketHandler::drained\n         * @see http_server_socket_drained()\n         *\/\n        bool pending_drained = false;\n\n        http_status_t status;\n        char status_buffer[64];\n        char content_length_buffer[32];\n        IstreamPointer istream;\n        off_t length;\n\n        uint64_t bytes_sent = 0;\n\n        Response()\n            :istream(nullptr) {}\n    } response;\n\n    bool date_header;\n\n    \/* connection settings *\/\n    bool keep_alive;\n\n    HttpServerConnection(struct pool &_pool,\n                         EventLoop &_loop,\n                         SocketDescriptor fd, FdType fd_type,\n                         const SocketFilter *filter,\n                         void *filter_ctx,\n                         SocketAddress _local_address,\n                         SocketAddress _remote_address,\n                         bool _date_header,\n                         HttpServerConnectionHandler &_handler);\n\n    ~HttpServerConnection() {\n        defer_read.Cancel();\n    }\n\n    void Delete() {\n        this->~HttpServerConnection();\n        pool_unref(pool);\n    }\n\n    EventLoop &GetEventLoop() {\n        return defer_read.GetEventLoop();\n    }\n\n    gcc_pure\n    bool IsValid() const {\n        return socket.IsValid() && socket.IsConnected();\n    }\n\n    void IdleTimeoutCallback();\n\n    void Log();\n\n    void OnDeferredRead();\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool ParseRequestLine(const char *line, size_t length);\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool HeadersFinished();\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool HandleLine(const char *line, size_t length);\n\n    BufferedResult FeedHeaders(const void *_data, size_t length);\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool SubmitRequest();\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    BufferedResult Feed(const void *data, size_t size);\n\n    \/**\n     * Send data from the input buffer to the request body istream\n     * handler.\n     *\/\n    BufferedResult FeedRequestBody(const void *data, size_t size);\n\n    \/**\n     * Attempt a \"direct\" transfer of the request body.  Caller must\n     * hold an additional pool reference.\n     *\/\n    DirectResult TryRequestBodyDirect(int fd, FdType fd_type);\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool MaybeSend100Continue();\n\n    void SetResponseIstream(Istream &r);\n\n    \/**\n     * To be called after the response istream has seen end-of-file,\n     * and has been destroyed.\n     *\n     * @return false if the connection has been closed\n     *\/\n    bool ResponseIstreamFinished();\n\n    void SubmitResponse(http_status_t status,\n                        HttpHeaders &&headers,\n                        Istream *body);\n\n    void ScheduleWrite() {\n        response.want_write = true;\n        socket.ScheduleWrite();\n    }\n\n    \/**\n     * @return false if the connection has been closed\n     *\/\n    bool TryWrite();\n    BucketResult TryWriteBuckets2();\n    BucketResult TryWriteBuckets();\n\n    void CloseRequest();\n\n    void CloseSocket();\n    void DestroySocket();\n\n    \/**\n     * The last response on this connection is finished, and it should\n     * be closed.\n     *\/\n    void Done();\n\n    \/**\n     * The peer has closed the socket.\n     *\/\n    void Cancel();\n\n    \/**\n     * A fatal error has occurred, and the connection should be closed\n     * immediately, without sending any further information to the\n     * client.  This invokes\n     * HttpServerConnectionHandler::HttpConnectionError(), but not\n     * HttpServerConnectionHandler::HttpConnectionClosed().\n     *\/\n    void Error(std::exception_ptr e);\n\n    void Error(const char *msg);\n\n    void SocketErrorErrno(const char *msg);\n\n    template<typename T>\n    void SocketError(T &&t) {\n        try {\n            ThrowException(std::forward<T>(t));\n        } catch (...) {\n            Error(std::make_exception_ptr(HttpServerSocketError()));\n        }\n    }\n\n    void SocketError(const char *msg) {\n        SocketError(std::runtime_error(msg));\n    }\n\n    void ProtocolError(const char *msg) {\n        Error(std::make_exception_ptr(HttpServerProtocolError(msg)));\n    }\n\n    \/* virtual methods from class IstreamHandler *\/\n    size_t OnData(const void *data, size_t length) override;\n    ssize_t OnDirect(FdType type, int fd, size_t max_length) override;\n    void OnEof() override;\n    void OnError(std::exception_ptr ep) override;\n};\n\n\/**\n * The timeout of an idle connection (READ_START).\n *\/\nextern const struct timeval http_server_idle_timeout;\n\n\/**\n * The total timeout of a client sending request headers.\n *\/\nextern const struct timeval http_server_header_timeout;\n\n\/**\n * The timeout for reading more request data (READ_BODY).\n *\/\nextern const struct timeval http_server_read_timeout;\n\n\/**\n * The timeout for writing more response data (READ_BODY, READ_END).\n *\/\nextern const struct timeval http_server_write_timeout;\n\nHttpServerRequest *\nhttp_server_request_new(HttpServerConnection *connection,\n                        http_method_t method,\n                        StringView uri);\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\n#include <sstream>\n#include <algorithm>\n\n#include \"http_v1_request_head.hpp\"\n\nnamespace manifold\n{\n  namespace http\n  {\n    \/\/----------------------------------------------------------------\/\/\n    static const std::string empty_string;\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    v1_request_head::v1_request_head(const request_head& generic_head)\n    {\n      this->headers_ = generic_head.raw_headers();\n      this->authority(generic_head.authority());\n      this->method(generic_head.method());\n      this->path(generic_head.path());\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    v1_request_head::v1_request_head(const std::string& path, const std::string& method, std::list<std::pair<std::string,std::string>>&& headers)\n    {\n      this->headers_ = std::move(headers);\n      this->path(path);\n      this->method(method);\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    v1_request_head::v1_request_head(const std::string& path, http::method method, std::list<std::pair<std::string,std::string>>&& headers)\n    {\n      this->headers_ = std::move(headers);\n      this->path(path);\n      this->method(method);\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    v1_request_head::~v1_request_head()\n    {\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    const std::string& v1_request_head::method() const\n    {\n      return this->method_;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::method(const std::string& value)\n    {\n      this->method_ = value;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::method(http::method value)\n    {\n      this->method(method_enum_to_string(value));\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    const std::string& v1_request_head::path() const\n    {\n\n      return this->path_;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::path(const std::string& value)\n    {\n      this->path_ = value;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    const std::string& v1_request_head::scheme() const\n    {\n      return empty_string;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::scheme(const std::string& value)\n    {\n\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    const std::string& v1_request_head::authority() const\n    {\n      return this->header(\"host\");\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::authority(const std::string& value)\n    {\n      this->header(\"host\", value);\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    bool v1_request_head::start_line(std::string&& value)\n    {\n      bool ret = false;\n\n      std::size_t first_space = value.find(' ');\n      std::size_t last_space = value.rfind(' ');\n      if (first_space != std::string::npos && last_space != std::string::npos)\n      {\n        this->method_ = value.substr(0, first_space);\n        ++first_space;\n        this->path_ = value.substr(first_space, last_space - first_space);\n        ret = true;\n      }\n\n      return ret;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    std::string v1_request_head::start_line() const\n    {\n      std::string ret(this->method_ + \" \" + this->path_ + \" http\/1.1\");\n      return ret;\n    }\n    \/\/----------------------------------------------------------------\/\/\n  }\n}<commit_msg>Fixed lower case http version in request line.<commit_after>\n#include <sstream>\n#include <algorithm>\n\n#include \"http_v1_request_head.hpp\"\n\nnamespace manifold\n{\n  namespace http\n  {\n    \/\/----------------------------------------------------------------\/\/\n    static const std::string empty_string;\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    v1_request_head::v1_request_head(const request_head& generic_head)\n    {\n      this->headers_ = generic_head.raw_headers();\n      this->authority(generic_head.authority());\n      this->method(generic_head.method());\n      this->path(generic_head.path());\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    v1_request_head::v1_request_head(const std::string& path, const std::string& method, std::list<std::pair<std::string,std::string>>&& headers)\n    {\n      this->headers_ = std::move(headers);\n      this->path(path);\n      this->method(method);\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    v1_request_head::v1_request_head(const std::string& path, http::method method, std::list<std::pair<std::string,std::string>>&& headers)\n    {\n      this->headers_ = std::move(headers);\n      this->path(path);\n      this->method(method);\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    v1_request_head::~v1_request_head()\n    {\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    const std::string& v1_request_head::method() const\n    {\n      return this->method_;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::method(const std::string& value)\n    {\n      this->method_ = value;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::method(http::method value)\n    {\n      this->method(method_enum_to_string(value));\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    const std::string& v1_request_head::path() const\n    {\n\n      return this->path_;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::path(const std::string& value)\n    {\n      this->path_ = value;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    const std::string& v1_request_head::scheme() const\n    {\n      return empty_string;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::scheme(const std::string& value)\n    {\n\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    const std::string& v1_request_head::authority() const\n    {\n      return this->header(\"host\");\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    void v1_request_head::authority(const std::string& value)\n    {\n      this->header(\"host\", value);\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    bool v1_request_head::start_line(std::string&& value)\n    {\n      bool ret = false;\n\n      std::size_t first_space = value.find(' ');\n      std::size_t last_space = value.rfind(' ');\n      if (first_space != std::string::npos && last_space != std::string::npos)\n      {\n        this->method_ = value.substr(0, first_space);\n        ++first_space;\n        this->path_ = value.substr(first_space, last_space - first_space);\n        ret = true;\n      }\n\n      return ret;\n    }\n    \/\/----------------------------------------------------------------\/\/\n\n    \/\/----------------------------------------------------------------\/\/\n    std::string v1_request_head::start_line() const\n    {\n      std::string ret(this->method_ + \" \" + this->path_ + \" HTTP\/1.1\");\n      return ret;\n    }\n    \/\/----------------------------------------------------------------\/\/\n  }\n}<|endoftext|>"}
{"text":"<commit_before>#include \"uniforms.h\"\n\n#include <Tempest\/UniformBuffer>\n\nusing namespace Tempest;\n\nUniforms::Uniforms(Device &dev, AbstractGraphicsApi::Desc *desc)\n  :dev(&dev),desc(desc) {\n  }\n\nUniforms::Uniforms(Uniforms && u)\n  :dev(u.dev), desc(std::move(u.desc)) {\n  }\n\nUniforms::~Uniforms() {\n  if(dev)\n    dev->destroy(*this);\n  }\n\nUniforms& Uniforms::operator=(Uniforms &&u) {\n  dev =u.dev;\n  desc=std::move(u.desc);\n  return *this;\n  }\n\nvoid Uniforms::set(size_t layoutBind, const UniformBuffer &vbuf) {\n  set(layoutBind,vbuf,0,vbuf.size());\n  }\n\nvoid Uniforms::set(size_t layoutBind, const Texture2d &tex) {\n  if(tex.impl.handler)\n    desc.handler->set(layoutBind,tex.impl.handler);\n  }\n\nvoid Uniforms::set(size_t layoutBind, const Detail::ResourcePtr<Texture2d> &tex) {\n  if(tex.impl.handler)\n    desc.handler->set(layoutBind,tex.impl.handler);\n  }\n\nvoid Uniforms::set(size_t layoutBind, const UniformBuffer &vbuf, size_t offset, size_t size) {\n  if(vbuf.impl.impl.handler)\n    desc.handler->set(layoutBind,vbuf.impl.impl.handler,offset,size); else\n    throw std::logic_error(\"invalid uniform buffer\");\n  }\n<commit_msg>throw for bad textures in ubo<commit_after>#include \"uniforms.h\"\n\n#include <Tempest\/UniformBuffer>\n\nusing namespace Tempest;\n\nUniforms::Uniforms(Device &dev, AbstractGraphicsApi::Desc *desc)\n  :dev(&dev),desc(desc) {\n  }\n\nUniforms::Uniforms(Uniforms && u)\n  :dev(u.dev), desc(std::move(u.desc)) {\n  }\n\nUniforms::~Uniforms() {\n  if(dev)\n    dev->destroy(*this);\n  }\n\nUniforms& Uniforms::operator=(Uniforms &&u) {\n  dev =u.dev;\n  desc=std::move(u.desc);\n  return *this;\n  }\n\nvoid Uniforms::set(size_t layoutBind, const UniformBuffer &vbuf) {\n  set(layoutBind,vbuf,0,vbuf.size());\n  }\n\nvoid Uniforms::set(size_t layoutBind, const Texture2d &tex) {\n  if(tex.impl.handler)\n    desc.handler->set(layoutBind,tex.impl.handler); else\n    throw std::logic_error(\"invalid texture\");\n  }\n\nvoid Uniforms::set(size_t layoutBind, const Detail::ResourcePtr<Texture2d> &tex) {\n  if(tex.impl.handler)\n    desc.handler->set(layoutBind,tex.impl.handler);\n  }\n\nvoid Uniforms::set(size_t layoutBind, const UniformBuffer &vbuf, size_t offset, size_t size) {\n  if(vbuf.impl.impl.handler)\n    desc.handler->set(layoutBind,vbuf.impl.impl.handler,offset,size); else\n    throw std::logic_error(\"invalid uniform buffer\");\n  }\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\r\n\r\nconst static InputElement elements[] =\r\n{\r\n\tAF_INPUT_ELEMENT(0, \"POSITION\", AFF_R32G32B32_FLOAT, 0),\r\n\tAF_INPUT_ELEMENT(1, \"COLOR\", AFF_R32G32B32_FLOAT, 12),\r\n};\r\n\r\nstruct Vertex\r\n{\r\n\tVec3 pos;\r\n\tVec3 color;\r\n};\r\n\r\nclass Picking\r\n{\r\n\tAFRenderStates polygonRenderStates;\r\n\tAFRenderStates lineRenderStates;\r\npublic:\r\n\tPicking();\r\n\tvoid Update2D(Vertex v[3]);\r\n\tvoid Update3D(Vertex poly[3], Vertex lines[6]);\r\n\tvoid Draw2D();\r\n\tvoid Draw3D();\r\n};\r\n\r\n#define CLASSNAME \"Picking\"\r\n#define GET_PICKING \\\r\n\tPicking* p = (Picking*)luaL_checkudata(L, 1, CLASSNAME);\t\\\r\n\tif (!p) {\t\\\r\n\t\treturn 0;\t\\\r\n\t}\r\n\r\nclass PickingBinder {\r\npublic:\r\n\tPickingBinder() {\r\n\t\tGetLuaBindFuncContainer().push_back([](lua_State* L) {\r\n\t\t\tstatic luaL_Reg methods[] =\r\n\t\t\t{\r\n\t\t\t\t{ \"Draw2D\", [](lua_State* L) { GET_PICKING p->Draw2D(); return 0; } },\r\n\t\t\t\t{ \"Draw3D\", [](lua_State* L) { GET_PICKING p->Draw3D(); return 0; } },\r\n\t\t\t\t{ \"__gc\", [](lua_State* L) { GET_PICKING p->~Picking(); return 0; } },\r\n\t\t\t\t{ nullptr, nullptr },\r\n\t\t\t};\r\n\t\t\taflBindClass(L, CLASSNAME, methods, [](lua_State* L) { void* u = lua_newuserdata(L, sizeof(Picking)); new (u) Picking(); return 1; });\r\n\t\t});\r\n\t}\r\n} static binder;\r\n\r\nPicking::Picking()\r\n{\r\n\tpolygonRenderStates.Create(\"solid\", arrayparam(elements), AFRS_DEPTH_ENABLE);\r\n\tlineRenderStates.Create(\"solid\", arrayparam(elements), AFRS_DEPTH_ENABLE | AFRS_PRIMITIVE_LINELIST);\r\n}\r\n\r\nvoid ScreenPosToRay(const Vec2& scrPos, Vec3& nearPos, Vec3& farPos)\r\n{\r\n\tMat v, p;\r\n\tmatrixMan.Get(MatrixMan::VIEW, v);\r\n\tmatrixMan.Get(MatrixMan::PROJ, p);\r\n\tMat vp = makeViewportMatrix(systemMisc.GetScreenSize());\r\n\tMat mInv = inv(v * p * vp);\r\n\tVec4 nearPos4 = transform(Vec4(scrPos.x, scrPos.y, NDC_SPACE_NEAR, 1), mInv);\r\n\tVec4 farPos4 = transform(Vec4(scrPos.x, scrPos.y, NDC_SPACE_FAR, 1), mInv);\r\n\tnearPos = Vec3(nearPos4.x, nearPos4.y, nearPos4.z) \/ nearPos4.w;\r\n\tfarPos = Vec3(farPos4.x, farPos4.y, farPos4.z) \/ farPos4.w;\r\n}\r\n\r\nbool RayVsTriangle(const Vec3& ray1, const Vec3& ray2, const Vec3 triangle[])\r\n{\r\n\tVec3 rayDir = ray2 - ray1;\r\n\tfloat inner[3];\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tconst Vec3& a = triangle[i];\r\n\t\tconst Vec3& b = triangle[(i + 1) % 3];\r\n\t\tinner[i] = dot(cross(ray1 - a, a - b), rayDir);\r\n\t}\r\n\treturn (inner[0] < 0 && inner[1] < 0 && inner[2] < 0) || (inner[0] > 0 && inner[1] > 0 && inner[2] > 0);\r\n}\r\n\r\nbool RayVsTriangleMollerTrumbore(const Vec3& ray1, const Vec3& ray2, const Vec3 triangle[], Vec3& hitPos)\r\n{\r\n\tVec3 ray1relative = ray1 - triangle[0];\r\n\tVec3 axes[] = { triangle[1] - triangle[0], triangle[2] - triangle[0], ray1 - ray2 };\r\n\tVec3 crosses[] = { cross(axes[1], axes[2]), cross(axes[2], axes[0]), cross(axes[0], axes[1]) };\r\n\tVec3 uvt = Vec3(dot(ray1relative, crosses[0]), dot(ray1relative, crosses[1]), dot(ray1relative, crosses[2])) \/ std::max(dot(axes[0], crosses[0]), 0.000001f);\r\n\thitPos = lerp(ray1, ray2, uvt.z);\r\n\treturn uvt.x >= 0 && uvt.y >= 0 && (uvt.x + uvt.y) <= 1.f;\r\n}\r\n\r\nvoid Picking::Update2D(Vertex v[3])\r\n{\r\n\tfloat radian = (float)(std::fmod(GetTime(), 3) * M_PI * 2 \/ 3);\r\n\tfloat radius = 0.5f;\r\n\tfloat aspect = (float)systemMisc.GetScreenSize().x \/ systemMisc.GetScreenSize().y;\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tstatic Vec3 center(-0.7f, 0.7f, 0.f);\r\n\t\tradian += (float)M_PI * 2 \/ 3;\r\n\t\tv[i].pos = Vec3(std::sin(radian) \/ aspect, std::cos(radian), 0) * radius + center;\r\n\t}\r\n\r\n\tbool hit = true;\r\n\r\n\tVec2 scrPos = systemMisc.GetScreenSize();\r\n\tVec2 curPos = systemMisc.GetMousePos();\r\n\r\n\tVec2 curPosIn2D = curPos \/ scrPos * Vec2(2, -2) + Vec2(-1, 1);\r\n\r\n\tMat proj2d;\r\n#ifdef AF_VULKAN\r\n\tproj2d._22 = -1;\r\n#endif\r\n\tMat projVp = proj2d * makeViewportMatrix(scrPos);\r\n\tVec3 transformed = transform(Vec3(curPos.x, curPos.y, 1), inv(projVp));\r\n\tassert(std::abs(transformed.x - curPosIn2D.x) < 0.001f);\r\n\tassert(std::abs(transformed.y - curPosIn2D.y) < 0.001f);\r\n\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tVec3 dir = v[(i + 1) % 3].pos - v[i].pos;\r\n\t\tVec3 cursorDir = Vec3(curPosIn2D.x, curPosIn2D.y, 0) - v[i].pos;\r\n\t\tif (cross(dir, cursorDir).z > 0) {\r\n\t\t\thit = false;\r\n\t\t}\r\n\t}\r\n\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tv[i].color = hit ? Vec3(i == 0, i == 1, i == 2) : Vec3(0.5, 0.5, 0.5);\r\n\t}\r\n}\r\n\r\nvoid Picking::Update3D(Vertex poly[3], Vertex lines[6])\r\n{\r\n\tfloat radian = (float)(std::fmod(GetTime(), 10) * M_PI * 2 \/ 10);\r\n\tfloat radius = 50.f;\r\n\tVec3 triangle[3];\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tradian += (float)M_PI * 2 \/ 3;\r\n\t\ttriangle[i] = poly[i].pos = Vec3(std::sin(radian) * radius, std::cos(radian) * radius, 50.f);\r\n\t\tpoly[i].color = Vec3(0.5, 0.5, 0.5);\r\n\t}\r\n\r\n\tVec3 n, f;\r\n\tScreenPosToRay(systemMisc.GetMousePos(), n, f);\r\n\tVec3 hitPos;\r\n\tbool hit = RayVsTriangleMollerTrumbore(n, f, triangle, hitPos);\r\n\tfor (int i = 0; i < 3; i++)\r\n\t{\r\n\t\tpoly[i].color = hit ? Vec3(i == 0, i == 1, i == 2) : Vec3(0.5, 0.5, 0.5);\r\n\t}\r\n\r\n\tfor (int i = 0; i < 3; i++)\r\n\t{\r\n\t\tVec3 axis = Vec3(i == 0, i == 1, i == 2);\r\n\t\tlines[i * 2].color = lines[i * 2 + 1].color = axis;\r\n\t\tlines[i * 2].pos = hitPos + axis * 10;\r\n\t\tlines[i * 2 + 1].pos = hitPos + axis * -10;\r\n\t}\r\n}\r\n\r\nvoid Picking::Draw3D()\r\n{\r\n\tVertex poly[3], lines[6];\r\n\tUpdate3D(poly, lines);\r\n\tMat mView, mProj;\r\n\tmatrixMan.Get(MatrixMan::VIEW, mView);\r\n\tmatrixMan.Get(MatrixMan::PROJ, mProj);\r\n\tMat mVP = mView * mProj;\r\n\r\n\tAFCommandList& cmd = afGetCommandList();\r\n\tcmd.SetRenderStates(polygonRenderStates);\r\n\tcmd.SetVertexBuffer(sizeof(poly), poly, sizeof(Vertex));\r\n\tcmd.SetBuffer(sizeof(Mat), &mVP, 0);\r\n\tcmd.Draw(3);\r\n\r\n\tcmd.SetRenderStates(lineRenderStates);\r\n\tcmd.SetVertexBuffer(sizeof(lines), lines, sizeof(Vertex));\r\n\tcmd.SetBuffer(sizeof(Mat), &mVP, 0);\r\n\tcmd.Draw(6);\r\n}\r\n\r\nvoid Picking::Draw2D()\r\n{\r\n\tAFCommandList& cmd = afGetCommandList();\r\n\tcmd.SetRenderStates(polygonRenderStates);\r\n\tVertex v[3];\r\n\tUpdate2D(v);\r\n\tcmd.SetVertexBuffer(sizeof(v), v, sizeof(Vertex));\r\n\tMat proj2d;\r\n#ifdef AF_VULKAN\r\n\tproj2d._22 = -1;\r\n#endif\r\n\r\n\tcmd.SetBuffer(sizeof(Mat), &proj2d, 0);\r\n\tcmd.Draw(3);\r\n}\r\n<commit_msg>[OpenGL] Fix compile error.<commit_after>#include \"stdafx.h\"\r\n\r\nconst static InputElement elements[] =\r\n{\r\n\tAF_INPUT_ELEMENT(0, \"POSITION\", AFF_R32G32B32_FLOAT, 0),\r\n\tAF_INPUT_ELEMENT(1, \"COLOR\", AFF_R32G32B32_FLOAT, 12),\r\n};\r\n\r\nstruct Vertex\r\n{\r\n\tVec3 pos;\r\n\tVec3 color;\r\n};\r\n\r\nclass Picking\r\n{\r\n\tAFRenderStates polygonRenderStates;\r\n\tAFRenderStates lineRenderStates;\r\npublic:\r\n\tPicking();\r\n\tvoid Update2D(Vertex v[3]);\r\n\tvoid Update3D(Vertex poly[3], Vertex lines[6]);\r\n\tvoid Draw2D();\r\n\tvoid Draw3D();\r\n};\r\n\r\n#define CLASSNAME \"Picking\"\r\n#define GET_PICKING \\\r\n\tPicking* p = (Picking*)luaL_checkudata(L, 1, CLASSNAME);\t\\\r\n\tif (!p) {\t\\\r\n\t\treturn 0;\t\\\r\n\t}\r\n\r\nclass PickingBinder {\r\npublic:\r\n\tPickingBinder() {\r\n\t\tGetLuaBindFuncContainer().push_back([](lua_State* L) {\r\n\t\t\tstatic luaL_Reg methods[] =\r\n\t\t\t{\r\n\t\t\t\t{ \"Draw2D\", [](lua_State* L) { GET_PICKING p->Draw2D(); return 0; } },\r\n\t\t\t\t{ \"Draw3D\", [](lua_State* L) { GET_PICKING p->Draw3D(); return 0; } },\r\n\t\t\t\t{ \"__gc\", [](lua_State* L) { GET_PICKING p->~Picking(); return 0; } },\r\n\t\t\t\t{ nullptr, nullptr },\r\n\t\t\t};\r\n\t\t\taflBindClass(L, CLASSNAME, methods, [](lua_State* L) { void* u = lua_newuserdata(L, sizeof(Picking)); new (u) Picking(); return 1; });\r\n\t\t});\r\n\t}\r\n} static binder;\r\n\r\nPicking::Picking()\r\n{\r\n\tpolygonRenderStates.Create(\"solid\", arrayparam(elements), AFRS_DEPTH_ENABLE);\r\n\tlineRenderStates.Create(\"solid\", arrayparam(elements), AFRS_DEPTH_ENABLE | AFRS_PRIMITIVE_LINELIST);\r\n}\r\n\r\nvoid ScreenPosToRay(const Vec2& scrPos, Vec3& nearPos, Vec3& farPos)\r\n{\r\n\tMat v, p;\r\n\tmatrixMan.Get(MatrixMan::VIEW, v);\r\n\tmatrixMan.Get(MatrixMan::PROJ, p);\r\n\tMat vp = makeViewportMatrix(systemMisc.GetScreenSize());\r\n\tMat mInv = inv(v * p * vp);\r\n\tVec4 nearPos4 = transform(Vec4(scrPos.x, scrPos.y, NDC_SPACE_NEAR, 1), mInv);\r\n\tVec4 farPos4 = transform(Vec4(scrPos.x, scrPos.y, NDC_SPACE_FAR, 1), mInv);\r\n\tnearPos = Vec3(nearPos4.x, nearPos4.y, nearPos4.z) \/ nearPos4.w;\r\n\tfarPos = Vec3(farPos4.x, farPos4.y, farPos4.z) \/ farPos4.w;\r\n}\r\n\r\nbool RayVsTriangle(const Vec3& ray1, const Vec3& ray2, const Vec3 triangle[])\r\n{\r\n\tVec3 rayDir = ray2 - ray1;\r\n\tfloat inner[3];\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tconst Vec3& a = triangle[i];\r\n\t\tconst Vec3& b = triangle[(i + 1) % 3];\r\n\t\tinner[i] = dot(cross(ray1 - a, a - b), rayDir);\r\n\t}\r\n\treturn (inner[0] < 0 && inner[1] < 0 && inner[2] < 0) || (inner[0] > 0 && inner[1] > 0 && inner[2] > 0);\r\n}\r\n\r\nbool RayVsTriangleMollerTrumbore(const Vec3& ray1, const Vec3& ray2, const Vec3 triangle[], Vec3& hitPos)\r\n{\r\n\tVec3 ray1relative = ray1 - triangle[0];\r\n\tVec3 axes[] = { triangle[1] - triangle[0], triangle[2] - triangle[0], ray1 - ray2 };\r\n\tVec3 crosses[] = { cross(axes[1], axes[2]), cross(axes[2], axes[0]), cross(axes[0], axes[1]) };\r\n\tVec3 uvt = Vec3(dot(ray1relative, crosses[0]), dot(ray1relative, crosses[1]), dot(ray1relative, crosses[2])) \/ std::max(dot(axes[0], crosses[0]), 0.000001f);\r\n\thitPos = lerp(ray1, ray2, uvt.z);\r\n\treturn uvt.x >= 0 && uvt.y >= 0 && (uvt.x + uvt.y) <= 1.f;\r\n}\r\n\r\nvoid Picking::Update2D(Vertex v[3])\r\n{\r\n\tfloat radian = (float)(std::fmod(GetTime(), 3) * M_PI * 2 \/ 3);\r\n\tfloat radius = 0.5f;\r\n\tfloat aspect = (float)systemMisc.GetScreenSize().x \/ systemMisc.GetScreenSize().y;\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tstatic Vec3 center(-0.7f, 0.7f, 0.f);\r\n\t\tradian += (float)M_PI * 2 \/ 3;\r\n\t\tv[i].pos = Vec3(std::sin(radian) \/ aspect, std::cos(radian), 0) * radius + center;\r\n\t}\r\n\r\n\tbool hit = true;\r\n\r\n\tVec2 scrPos = systemMisc.GetScreenSize();\r\n\tVec2 curPos = systemMisc.GetMousePos();\r\n\r\n\tVec2 curPosIn2D = curPos \/ scrPos * Vec2(2, -2) + Vec2(-1, 1);\r\n\r\n\tMat proj2d;\r\n#ifdef AF_VULKAN\r\n\tproj2d._22 = -1;\r\n#endif\r\n\tMat projVp = proj2d * makeViewportMatrix(scrPos);\r\n\tVec3 transformed = transform(Vec3(curPos.x, curPos.y, 1), inv(projVp));\r\n\tassert(std::abs(transformed.x - curPosIn2D.x) < 0.001f);\r\n\tassert(std::abs(transformed.y - curPosIn2D.y) < 0.001f);\r\n\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tVec3 dir = v[(i + 1) % 3].pos - v[i].pos;\r\n\t\tVec3 cursorDir = Vec3(curPosIn2D.x, curPosIn2D.y, 0) - v[i].pos;\r\n\t\tif (cross(dir, cursorDir).z > 0) {\r\n\t\t\thit = false;\r\n\t\t}\r\n\t}\r\n\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tv[i].color = hit ? Vec3(i == 0, i == 1, i == 2) : Vec3(0.5, 0.5, 0.5);\r\n\t}\r\n}\r\n\r\nvoid Picking::Update3D(Vertex poly[3], Vertex lines[6])\r\n{\r\n\tfloat radian = (float)(std::fmod(GetTime(), 10) * M_PI * 2 \/ 10);\r\n\tfloat radius = 50.f;\r\n\tVec3 triangle[3];\r\n\tfor (int i = 0; i < 3; i++) {\r\n\t\tradian += (float)M_PI * 2 \/ 3;\r\n\t\ttriangle[i] = poly[i].pos = Vec3(std::sin(radian) * radius, std::cos(radian) * radius, 50.f);\r\n\t\tpoly[i].color = Vec3(0.5, 0.5, 0.5);\r\n\t}\r\n\r\n\tVec3 n, f;\r\n\tScreenPosToRay(systemMisc.GetMousePos(), n, f);\r\n\tVec3 hitPos;\r\n\tbool hit = RayVsTriangleMollerTrumbore(n, f, triangle, hitPos);\r\n\tfor (int i = 0; i < 3; i++)\r\n\t{\r\n\t\tpoly[i].color = hit ? Vec3(i == 0, i == 1, i == 2) : Vec3(0.5, 0.5, 0.5);\r\n\t}\r\n\r\n\tfor (int i = 0; i < 3; i++)\r\n\t{\r\n\t\tVec3 axis = Vec3(i == 0, i == 1, i == 2);\r\n\t\tlines[i * 2].color = lines[i * 2 + 1].color = axis;\r\n\t\tlines[i * 2].pos = hitPos + axis * 10;\r\n\t\tlines[i * 2 + 1].pos = hitPos + axis * -10;\r\n\t}\r\n}\r\n\r\nstatic void DrawDynamicVertexBuffer(AFCommandList& cmd, int nVertices, Vertex vertices[])\r\n{\r\n#ifdef AF_GLES\r\n\tVBOID vbo = afCreateVertexBuffer(sizeof(Vertex) * nVertices, vertices);\r\n\tcmd.SetVertexBuffer(vbo, sizeof(Vertex));\r\n\tcmd.Draw(nVertices);\r\n\tafSafeDeleteBuffer(vbo);\r\n#else\r\n\tcmd.SetVertexBuffer(sizeof(Vertex) * nVertices, vertices, sizeof(Vertex));\r\n\tcmd.Draw(nVertices);\r\n#endif\r\n}\r\n\r\nvoid Picking::Draw3D()\r\n{\r\n\tVertex poly[3], lines[6];\r\n\tUpdate3D(poly, lines);\r\n\tMat mView, mProj;\r\n\tmatrixMan.Get(MatrixMan::VIEW, mView);\r\n\tmatrixMan.Get(MatrixMan::PROJ, mProj);\r\n\tMat mVP = mView * mProj;\r\n\r\n\tAFCommandList& cmd = afGetCommandList();\r\n\tcmd.SetRenderStates(polygonRenderStates);\r\n\tcmd.SetBuffer(sizeof(Mat), &mVP, 0);\r\n\tDrawDynamicVertexBuffer(cmd, arrayparam(poly));\r\n\r\n\tcmd.SetRenderStates(lineRenderStates);\r\n\tcmd.SetBuffer(sizeof(Mat), &mVP, 0);\r\n\tDrawDynamicVertexBuffer(cmd, arrayparam(lines));\r\n}\r\n\r\nvoid Picking::Draw2D()\r\n{\r\n\tAFCommandList& cmd = afGetCommandList();\r\n\tcmd.SetRenderStates(polygonRenderStates);\r\n\tVertex v[3];\r\n\tUpdate2D(v);\r\n\tMat proj2d;\r\n#ifdef AF_VULKAN\r\n\tproj2d._22 = -1;\r\n#endif\r\n\tcmd.SetBuffer(sizeof(Mat), &proj2d, 0);\r\n\tDrawDynamicVertexBuffer(cmd, arrayparam(v));\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * Printipi\n * (c) 2014 Colin Wallace\n *\/\n\n\/*TODO:\n * *Write SN754410 drivers\n * *Test output on one single motor\n * *Figure out extrusion in State::queueMovement.\n * *in State::queueMovement, curX, curY, curZ, etc should be recalculated from the actual axis positions to prevent drift\n *    dest*Primitive must be maintained in order to handle relative movements.\n * *Add Kossel Axis drivers\n * *Run valgrind to hunt for uninitialized variables\n * *Enable new stepper driver\n * *Wire all three steppers\n *  Solder thermistor\n *  Add thermister support\n *  Add endstop support\n *  Add max\/min bounds for each axis\n *  Add acceleration\n *  Make scheduler more resistant to skipping (make it so it can only run at up to, say, 2x speed to catch up. This minimizes missed steps)\n *  Investigate single-threading for entire process.\n *  Look into coordinate rounding for State::queueMovement\n *  Consider names: piprint (taken), printchef (exists), Rasprintian (play on raspbian), Rasprint, Rasprinti, Printipi\n*\/\n\n#include <string>\n#include <fcntl.h> \/\/needed for (file) open()\n\/\/#include <stdlib.h> \/\/needed for exit()\n#include <sys\/mman.h> \/\/for mlockall\n#include <cstdlib> \/\/for atexit\n#include \"logging.h\"\n\n#include \"gparse\/serial.h\"\n#include \"state.h\"\n#include \"drivers\/driver.h\"\n#include \"drivers\/kossel\/kossel.h\"\n#include \"argparse.h\"\n\nvoid printUsage(char* cmd) {\n\t\/\/#ifndef NO_USAGE_INFO\n\tLOGE(\"usage: %s ttyFile\\n\", cmd);\n    \/\/std::cerr << \"usage: \" << cmd << \" ttyFile\" << std::endl;\n    \/\/#endif\n    \/\/exit(1);\n}\n\n\/*void onExit() {\n\tLOG(\"Exiting\\n\");\n}*\/\n\nint main(int argc, char** argv) {\n\t\/*if (DO_LOG) {\n\t\tstd::atexit(onExit);\n\t}*\/\n\tif (argparse::cmdOptionExists(argv, argv+argc, \"--quiet\")) {\n    \tlogging::disable();\n    }\n    if (argparse::cmdOptionExists(argv, argv+argc, \"--verbose\")) {\n    \tlogging::enableVerbose();\n    }\n    if (argc < 2 || argparse::cmdOptionExists(argv, argv+argc, \"-h\") || argparse::cmdOptionExists(argv, argv+argc, \"--help\")) {\n        printUsage(argv[0]);\n        return 1;\n    }\n    \n    \/\/prevent page-swaps to increase performace:\n    int retval = mlockall(MCL_FUTURE|MCL_CURRENT);\n    if (retval) {\n    \tLOGW(\"Warning: mlockall (prevent memory swaps) in main.cpp::main() returned non-zero: %i\\n\", retval);\n    }\n    \n    char* serialFileName = argv[1];\n    LOG(\"Serial file: %s\\n\", serialFileName);\n    int fd = open(serialFileName, O_RDWR);\n    \n    drv::Kossel driver;\n\tState<drv::Kossel> gState(driver);\n    \n    gparse::comLoop(fd, gState);\n    return 0;\n}\n<commit_msg>Updated to-do<commit_after>\/* \n * Printipi\n * (c) 2014 Colin Wallace\n *\/\n\n\/*TODO:\n * *Write SN754410 drivers\n * *Test output on one single motor\n * *Figure out extrusion in State::queueMovement.\n * *in State::queueMovement, curX, curY, curZ, etc should be recalculated from the actual axis positions to prevent drift\n *    dest*Primitive must be maintained in order to handle relative movements.\n * *Add Kossel Axis drivers\n * *Run valgrind to hunt for uninitialized variables\n * *Enable new stepper driver\n * *Wire all three steppers\n *  Solder thermistor\n *  Add thermister support\n *  Add endstop support\n *  Add max\/min bounds for each axis\n *  Add acceleration\n *  Add IO deactivation upon exit\n *  Add ability to put steppers to rest upon idle\n *  Make scheduler more resistant to skipping (make it so it can only run at up to, say, 2x speed to catch up. This minimizes missed steps)\n *  Investigate single-threading for entire process.\n *  Look into coordinate rounding for State::queueMovement\n *  Consider names: piprint (taken), printchef (exists), Rasprintian (play on raspbian), Rasprint, Rasprinti, Printipi\n*\/\n\n#include <string>\n#include <fcntl.h> \/\/needed for (file) open()\n\/\/#include <stdlib.h> \/\/needed for exit()\n#include <sys\/mman.h> \/\/for mlockall\n\/\/#include <cstdlib> \/\/for atexit\n#include \"logging.h\"\n\n#include \"gparse\/serial.h\"\n#include \"state.h\"\n#include \"drivers\/driver.h\"\n#include \"drivers\/kossel\/kossel.h\"\n#include \"argparse.h\"\n\nvoid printUsage(char* cmd) {\n\t\/\/#ifndef NO_USAGE_INFO\n\tLOGE(\"usage: %s ttyFile\\n\", cmd);\n    \/\/std::cerr << \"usage: \" << cmd << \" ttyFile\" << std::endl;\n    \/\/#endif\n    \/\/exit(1);\n}\n\n\/*void onExit() {\n\tLOG(\"Exiting\\n\");\n}*\/\n\nint main(int argc, char** argv) {\n\t\/*if (DO_LOG) {\n\t\tstd::atexit(onExit);\n\t}*\/\n\tif (argparse::cmdOptionExists(argv, argv+argc, \"--quiet\")) {\n    \tlogging::disable();\n    }\n    if (argparse::cmdOptionExists(argv, argv+argc, \"--verbose\")) {\n    \tlogging::enableVerbose();\n    }\n    if (argc < 2 || argparse::cmdOptionExists(argv, argv+argc, \"-h\") || argparse::cmdOptionExists(argv, argv+argc, \"--help\")) {\n        printUsage(argv[0]);\n        return 1;\n    }\n    \n    \/\/prevent page-swaps to increase performace:\n    int retval = mlockall(MCL_FUTURE|MCL_CURRENT);\n    if (retval) {\n    \tLOGW(\"Warning: mlockall (prevent memory swaps) in main.cpp::main() returned non-zero: %i\\n\", retval);\n    }\n    \n    char* serialFileName = argv[1];\n    LOG(\"Serial file: %s\\n\", serialFileName);\n    int fd = open(serialFileName, O_RDWR);\n    \n    drv::Kossel driver;\n\tState<drv::Kossel> gState(driver);\n    \n    gparse::comLoop(fd, gState);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/Copyright (c) 2021 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"LightningTree.h\"\n\n#include \"..\/utils\/linearAlg2D.h\"\n\nusing namespace cura;\n\ncoord_t LightningTreeNode::getWeightedDistance(const Point& unsupported_loc, const coord_t& supporting_radius) const\n{\n    size_t valence = (!is_root) + children.size();\n    coord_t boost = (0 < valence && valence < 4) ? 4 * supporting_radius : 0;\n    return vSize(getLocation() - unsupported_loc) - boost;\n}\n\nbool LightningTreeNode::hasOffspring(const std::shared_ptr<LightningTreeNode>& to_be_checked) const\n{\n    if (to_be_checked == shared_from_this()) return true;\n    for (auto child_ptr : children)\n    {\n        if (child_ptr->hasOffspring(to_be_checked)) return true;\n    }\n    return false;\n}\n\nconst Point& LightningTreeNode::getLocation() const\n{\n    return p;\n}\n\nvoid LightningTreeNode::setLocation(const Point& loc)\n{\n    p = loc;\n}\n\nstd::shared_ptr<LightningTreeNode> LightningTreeNode::addChild(const Point& child_loc)\n{\n    assert(p != child_loc);\n    children.push_back(LightningTreeNode::create(child_loc));\n    return children.back();\n}\n\nstd::shared_ptr<LightningTreeNode> LightningTreeNode::addChild(std::shared_ptr<LightningTreeNode>& new_child)\n{\n    assert(new_child != shared_from_this());\n    \/\/     assert(p != new_child->p);\n    if (p == new_child->p)\n        std::cerr << \"wtf\\n\";\n    children.push_back(new_child);\n    new_child->is_root = false;\n    return new_child;\n}\n\nstd::shared_ptr<LightningTreeNode> LightningTreeNode::findClosestNode(const Point& x, const coord_t& supporting_radius)\n{\n    coord_t closest_distance = getWeightedDistance(x, supporting_radius);\n    std::shared_ptr<LightningTreeNode> closest_node = shared_from_this();\n    findClosestNodeHelper(x, supporting_radius, closest_distance, closest_node);\n    return closest_node;\n}\n\nvoid LightningTreeNode::propagateToNextLayer\n(\n    std::vector<std::shared_ptr<LightningTreeNode>>& next_trees,\n    const Polygons& next_outlines,\n    const coord_t& prune_distance,\n    const coord_t& smooth_magnitude\n) const\n{\n    auto tree_below = deepCopy();\n\n    \/\/ TODO: What is the correct order of the following operations?\n    \/\/       (NOTE: in case realign turns out _not_ to be last, would need to rewrite a few things, see the 'rerooted_parts' parameter of that function).\n    tree_below->prune(prune_distance);\n    tree_below->straighten(smooth_magnitude);\n    if (tree_below->realign(next_outlines, next_trees))\n    {\n        next_trees.push_back(tree_below);\n    }\n}\n\n\/\/ NOTE: Depth-first, as currently implemented.\n\/\/       Skips the root (because that has no root itself), but all initial nodes will have the root point anyway.\nvoid LightningTreeNode::visitBranches(const branch_visitor_func_t& visitor) const\n{\n    for (const auto& node : children)\n    {\n        visitor(p, node->p);\n        node->visitBranches(visitor);\n    }\n}\n\n\/\/ NOTE: Depth-first, as currently implemented.\nvoid LightningTreeNode::visitNodes(const node_visitor_func_t& visitor)\n{\n    visitor(shared_from_this());\n    for (const auto& node : children)\n    {\n        node->visitNodes(visitor);\n    }\n}\n\n\/\/ Node:\nLightningTreeNode::LightningTreeNode(const Point& p) : is_root(false), p(p) {}\n\n\/\/ Root (and Trunk):\nLightningTreeNode::LightningTreeNode(const Point& a, const Point& b) : LightningTreeNode(a)\n{\n    children.push_back(LightningTreeNode::create(b));\n    is_root = true;\n}\n\nvoid LightningTreeNode::findClosestNodeHelper(const Point& x, const coord_t supporting_radius, coord_t& closest_distance, std::shared_ptr<LightningTreeNode>& closest_node)\n{\n    for (const auto& node : children)\n    {\n        node->findClosestNodeHelper(x, supporting_radius, closest_distance, closest_node);\n        const coord_t distance = node->getWeightedDistance(x, supporting_radius);\n        if (distance < closest_distance)\n        {\n            closest_node = node;\n            closest_distance = distance;\n        }\n    }\n}\n\nstd::shared_ptr<LightningTreeNode> LightningTreeNode::deepCopy() const\n{\n    std::shared_ptr<LightningTreeNode> local_root = LightningTreeNode::create(p);\n    local_root->is_root = is_root;\n    local_root->children.reserve(children.size());\n    for (const auto& node : children)\n    {\n        local_root->children.push_back(node->deepCopy());\n    }\n    return local_root;\n}\n\nbool LightningTreeNode::realign(const Polygons& outlines, std::vector<std::shared_ptr<LightningTreeNode>>& rerooted_parts, const bool& connected_to_parent)\n{\n    \/\/ TODO: Hole(s) in the _middle_ of a line-segement, not unlikely since reconnect.\n    \/\/ TODO: Reconnect if not on outline -> plan is: yes, but not here anymore!\n\n    if (outlines.empty())\n    {\n        return false;\n    }\n\n    if (outlines.inside(p, true))\n    {\n        \/\/ Only keep children that have an unbroken connection to here, realign will put the rest in rerooted parts due to recursion:\n        const std::function<bool(const std::shared_ptr<LightningTreeNode>& child)> remove_unconnected_func\n        (\n            [&outlines, &rerooted_parts](const std::shared_ptr<LightningTreeNode>& child)\n            {\n                constexpr bool argument_with_connected = true;\n                return !child->realign(outlines, rerooted_parts, argument_with_connected);\n            }\n        );\n        children.erase(std::remove_if(children.begin(), children.end(), remove_unconnected_func), children.end());\n        return true;\n    }\n\n    \/\/ 'Lift' any decendants out of this tree:\n    for (auto& child : children)\n    {\n        constexpr bool argument_with_disconnect = false;\n        if (child->realign(outlines, rerooted_parts, argument_with_disconnect))\n        {\n            rerooted_parts.push_back(child);\n        }\n    }\n    children.clear();\n\n    if (connected_to_parent)\n    {\n        \/\/ This will now be a (new_ leaf:\n        p = PolygonUtils::findClosest(p, outlines).p();\n        return true;\n    }\n\n    return false;\n}\n\nvoid LightningTreeNode::straighten(const coord_t& magnitude)\n{\n    straighten(magnitude, p, 0);\n}\n\nLightningTreeNode::RectilinearJunction LightningTreeNode::straighten(const coord_t& magnitude, Point junction_above, coord_t accumulated_dist)\n{\n    if (children.size() == 1)\n    {\n        auto child_p = children.front();\n        coord_t child_dist = vSize(p - child_p->p);\n        RectilinearJunction junction_below = child_p->straighten(magnitude, junction_above, accumulated_dist + child_dist);\n        coord_t total_dist_to_junction_below = junction_below.total_recti_dist;\n        Point a = junction_above;\n        Point b = junction_below.junction_loc;\n        if (a != b) \/\/ should always be true!\n        {\n            Point ab = b - a;\n            Point destination = a + ab * accumulated_dist \/ total_dist_to_junction_below;\n            if (shorterThen(destination - p, magnitude))\n            {\n                p = destination;\n            }\n            else\n            {\n                p = p + normal(destination - p, magnitude);\n            }\n        }\n        return junction_below;\n    }\n    else\n    {\n        for (auto child_p : children)\n        {\n            coord_t child_dist = vSize(p - child_p->p);\n            child_p->straighten(magnitude, p, child_dist);\n        }\n        return RectilinearJunction{ accumulated_dist, p };\n    }\n}\n\n\/\/ Prune the tree from the extremeties (leaf-nodes) until the pruning distance is reached.\ncoord_t LightningTreeNode::prune(const coord_t& pruning_distance)\n{\n    if (pruning_distance <= 0)\n    {\n        return 0;\n    }\n\n    coord_t max_distance_pruned = 0;\n    for (auto child_it = children.begin(); child_it != children.end(); )\n    {\n        auto& child = *child_it;\n        coord_t dist_pruned_child = child->prune(pruning_distance);\n        if (dist_pruned_child >= pruning_distance)\n        { \/\/ pruning is finished for child; dont modify further\n            max_distance_pruned = std::max(max_distance_pruned, dist_pruned_child);\n            ++child_it;\n        }\n        else\n        {\n            Point a = getLocation();\n            Point b = child->getLocation();\n            Point ba = a - b;\n            coord_t ab_len = vSize(ba);\n            if (dist_pruned_child + ab_len <= pruning_distance)\n            { \/\/ we're still in the process of pruning\n                assert(child->children.empty() && \"when pruning away a node all it's children must already have been pruned away\");\n                max_distance_pruned = std::max(max_distance_pruned, dist_pruned_child + ab_len);\n                child_it = children.erase(child_it);\n            }\n            else\n            { \/\/ pruning stops in between this node and the child\n                Point n = b + normal(ba, pruning_distance - dist_pruned_child);\n                assert(std::abs(vSize(n - b) + dist_pruned_child - pruning_distance) < 10 && \"total pruned distance must be equal to the pruning_distance\");\n                max_distance_pruned = std::max(max_distance_pruned, pruning_distance);\n                child->setLocation(n);\n                ++child_it;\n            }\n        }\n    }\n\n    return max_distance_pruned;\n}\n<commit_msg>junction smoothing<commit_after>\/\/Copyright (c) 2021 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"LightningTree.h\"\n\n#include \"..\/utils\/linearAlg2D.h\"\n\nusing namespace cura;\n\ncoord_t LightningTreeNode::getWeightedDistance(const Point& unsupported_loc, const coord_t& supporting_radius) const\n{\n    size_t valence = (!is_root) + children.size();\n    coord_t boost = (0 < valence && valence < 4) ? 4 * supporting_radius : 0;\n    return vSize(getLocation() - unsupported_loc) - boost;\n}\n\nbool LightningTreeNode::hasOffspring(const std::shared_ptr<LightningTreeNode>& to_be_checked) const\n{\n    if (to_be_checked == shared_from_this()) return true;\n    for (auto child_ptr : children)\n    {\n        if (child_ptr->hasOffspring(to_be_checked)) return true;\n    }\n    return false;\n}\n\nconst Point& LightningTreeNode::getLocation() const\n{\n    return p;\n}\n\nvoid LightningTreeNode::setLocation(const Point& loc)\n{\n    p = loc;\n}\n\nstd::shared_ptr<LightningTreeNode> LightningTreeNode::addChild(const Point& child_loc)\n{\n    assert(p != child_loc);\n    children.push_back(LightningTreeNode::create(child_loc));\n    return children.back();\n}\n\nstd::shared_ptr<LightningTreeNode> LightningTreeNode::addChild(std::shared_ptr<LightningTreeNode>& new_child)\n{\n    assert(new_child != shared_from_this());\n    \/\/     assert(p != new_child->p);\n    if (p == new_child->p)\n        std::cerr << \"wtf\\n\";\n    children.push_back(new_child);\n    new_child->is_root = false;\n    return new_child;\n}\n\nstd::shared_ptr<LightningTreeNode> LightningTreeNode::findClosestNode(const Point& x, const coord_t& supporting_radius)\n{\n    coord_t closest_distance = getWeightedDistance(x, supporting_radius);\n    std::shared_ptr<LightningTreeNode> closest_node = shared_from_this();\n    findClosestNodeHelper(x, supporting_radius, closest_distance, closest_node);\n    return closest_node;\n}\n\nvoid LightningTreeNode::propagateToNextLayer\n(\n    std::vector<std::shared_ptr<LightningTreeNode>>& next_trees,\n    const Polygons& next_outlines,\n    const coord_t& prune_distance,\n    const coord_t& smooth_magnitude\n) const\n{\n    auto tree_below = deepCopy();\n\n    \/\/ TODO: What is the correct order of the following operations?\n    \/\/       (NOTE: in case realign turns out _not_ to be last, would need to rewrite a few things, see the 'rerooted_parts' parameter of that function).\n    tree_below->prune(prune_distance);\n    tree_below->straighten(smooth_magnitude);\n    if (tree_below->realign(next_outlines, next_trees))\n    {\n        next_trees.push_back(tree_below);\n    }\n}\n\n\/\/ NOTE: Depth-first, as currently implemented.\n\/\/       Skips the root (because that has no root itself), but all initial nodes will have the root point anyway.\nvoid LightningTreeNode::visitBranches(const branch_visitor_func_t& visitor) const\n{\n    for (const auto& node : children)\n    {\n        visitor(p, node->p);\n        node->visitBranches(visitor);\n    }\n}\n\n\/\/ NOTE: Depth-first, as currently implemented.\nvoid LightningTreeNode::visitNodes(const node_visitor_func_t& visitor)\n{\n    visitor(shared_from_this());\n    for (const auto& node : children)\n    {\n        node->visitNodes(visitor);\n    }\n}\n\n\/\/ Node:\nLightningTreeNode::LightningTreeNode(const Point& p) : is_root(false), p(p) {}\n\n\/\/ Root (and Trunk):\nLightningTreeNode::LightningTreeNode(const Point& a, const Point& b) : LightningTreeNode(a)\n{\n    children.push_back(LightningTreeNode::create(b));\n    is_root = true;\n}\n\nvoid LightningTreeNode::findClosestNodeHelper(const Point& x, const coord_t supporting_radius, coord_t& closest_distance, std::shared_ptr<LightningTreeNode>& closest_node)\n{\n    for (const auto& node : children)\n    {\n        node->findClosestNodeHelper(x, supporting_radius, closest_distance, closest_node);\n        const coord_t distance = node->getWeightedDistance(x, supporting_radius);\n        if (distance < closest_distance)\n        {\n            closest_node = node;\n            closest_distance = distance;\n        }\n    }\n}\n\nstd::shared_ptr<LightningTreeNode> LightningTreeNode::deepCopy() const\n{\n    std::shared_ptr<LightningTreeNode> local_root = LightningTreeNode::create(p);\n    local_root->is_root = is_root;\n    local_root->children.reserve(children.size());\n    for (const auto& node : children)\n    {\n        local_root->children.push_back(node->deepCopy());\n    }\n    return local_root;\n}\n\nbool LightningTreeNode::realign(const Polygons& outlines, std::vector<std::shared_ptr<LightningTreeNode>>& rerooted_parts, const bool& connected_to_parent)\n{\n    \/\/ TODO: Hole(s) in the _middle_ of a line-segement, not unlikely since reconnect.\n    \/\/ TODO: Reconnect if not on outline -> plan is: yes, but not here anymore!\n\n    if (outlines.empty())\n    {\n        return false;\n    }\n\n    if (outlines.inside(p, true))\n    {\n        \/\/ Only keep children that have an unbroken connection to here, realign will put the rest in rerooted parts due to recursion:\n        const std::function<bool(const std::shared_ptr<LightningTreeNode>& child)> remove_unconnected_func\n        (\n            [&outlines, &rerooted_parts](const std::shared_ptr<LightningTreeNode>& child)\n            {\n                constexpr bool argument_with_connected = true;\n                return !child->realign(outlines, rerooted_parts, argument_with_connected);\n            }\n        );\n        children.erase(std::remove_if(children.begin(), children.end(), remove_unconnected_func), children.end());\n        return true;\n    }\n\n    \/\/ 'Lift' any decendants out of this tree:\n    for (auto& child : children)\n    {\n        constexpr bool argument_with_disconnect = false;\n        if (child->realign(outlines, rerooted_parts, argument_with_disconnect))\n        {\n            rerooted_parts.push_back(child);\n        }\n    }\n    children.clear();\n\n    if (connected_to_parent)\n    {\n        \/\/ This will now be a (new_ leaf:\n        p = PolygonUtils::findClosest(p, outlines).p();\n        return true;\n    }\n\n    return false;\n}\n\nvoid LightningTreeNode::straighten(const coord_t& magnitude)\n{\n    straighten(magnitude, p, 0);\n}\n\nLightningTreeNode::RectilinearJunction LightningTreeNode::straighten(const coord_t& magnitude, Point junction_above, coord_t accumulated_dist)\n{\n    const coord_t junction_magnitude = magnitude * 3 \/ 4;\n    if (children.size() == 1)\n    {\n        auto child_p = children.front();\n        coord_t child_dist = vSize(p - child_p->p);\n        RectilinearJunction junction_below = child_p->straighten(magnitude, junction_above, accumulated_dist + child_dist);\n        coord_t total_dist_to_junction_below = junction_below.total_recti_dist;\n        Point a = junction_above;\n        Point b = junction_below.junction_loc;\n        if (a != b) \/\/ should always be true!\n        {\n            Point ab = b - a;\n            Point destination = a + ab * accumulated_dist \/ total_dist_to_junction_below;\n            if (shorterThen(destination - p, magnitude))\n            {\n                p = destination;\n            }\n            else\n            {\n                p = p + normal(destination - p, magnitude);\n            }\n        }\n        return junction_below;\n    }\n    else\n    {\n        Point junction_moving_dir = normal(junction_above - p, accumulated_dist);\n        for (auto child_p : children)\n        {\n            coord_t child_dist = vSize(p - child_p->p);\n            RectilinearJunction below = child_p->straighten(magnitude, p, child_dist);\n\n            junction_moving_dir += normal(below.junction_loc - p, below.total_recti_dist);\n        }\n        if (junction_moving_dir != Point(0, 0) && ! children.empty())\n        {\n            coord_t junction_moving_dir_len = vSize(junction_moving_dir);\n            if (junction_moving_dir_len > junction_magnitude)\n            {\n                junction_moving_dir = junction_moving_dir * junction_magnitude \/ junction_moving_dir_len;\n            }\n            p += junction_moving_dir;\n        }\n        return RectilinearJunction{ accumulated_dist, p };\n    }\n}\n\n\/\/ Prune the tree from the extremeties (leaf-nodes) until the pruning distance is reached.\ncoord_t LightningTreeNode::prune(const coord_t& pruning_distance)\n{\n    if (pruning_distance <= 0)\n    {\n        return 0;\n    }\n\n    coord_t max_distance_pruned = 0;\n    for (auto child_it = children.begin(); child_it != children.end(); )\n    {\n        auto& child = *child_it;\n        coord_t dist_pruned_child = child->prune(pruning_distance);\n        if (dist_pruned_child >= pruning_distance)\n        { \/\/ pruning is finished for child; dont modify further\n            max_distance_pruned = std::max(max_distance_pruned, dist_pruned_child);\n            ++child_it;\n        }\n        else\n        {\n            Point a = getLocation();\n            Point b = child->getLocation();\n            Point ba = a - b;\n            coord_t ab_len = vSize(ba);\n            if (dist_pruned_child + ab_len <= pruning_distance)\n            { \/\/ we're still in the process of pruning\n                assert(child->children.empty() && \"when pruning away a node all it's children must already have been pruned away\");\n                max_distance_pruned = std::max(max_distance_pruned, dist_pruned_child + ab_len);\n                child_it = children.erase(child_it);\n            }\n            else\n            { \/\/ pruning stops in between this node and the child\n                Point n = b + normal(ba, pruning_distance - dist_pruned_child);\n                assert(std::abs(vSize(n - b) + dist_pruned_child - pruning_distance) < 10 && \"total pruned distance must be equal to the pruning_distance\");\n                max_distance_pruned = std::max(max_distance_pruned, pruning_distance);\n                child->setLocation(n);\n                ++child_it;\n            }\n        }\n    }\n\n    return max_distance_pruned;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2016.\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/  http:\/\/www.opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#ifndef TYPE_TRAITS_H\n#define TYPE_TRAITS_H\n\n#include <types.hpp>\n#include <enable_if.hpp>\n\nnamespace std {\n\ntemplate <typename T>\nstruct iterator_traits {\n    using value_type      = typename T::value_type;\n    using reference       = typename T::reference;\n    using pointer         = typename T::pointer;\n    using difference_type = typename T::difference_type;\n};\n\ntemplate <typename T>\nstruct iterator_traits <T*> {\n    using value_type      = T;\n    using reference       = T&;\n    using pointer         = T*;\n    using difference_type = size_t;\n};\n\ntemplate<class T>\nstruct remove_reference {\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_reference<T&>{\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_reference<T&&> {\n    typedef T type;\n};\n\n\/* remove_extent *\/\n\ntemplate<class T>\nstruct remove_extent {\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_extent<T[]> {\n    typedef T type;\n};\n\ntemplate<class T, size_t N>\nstruct remove_extent<T[N]> {\n    typedef T type;\n};\n\n\/* remove_const *\/\n\ntemplate<class T>\nstruct remove_const {\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_const<const T> {\n    typedef T type;\n};\n\n\/* remove_volatile *\/\n\ntemplate<class T>\nstruct remove_volatile {\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_volatile<volatile T> {\n    typedef T type;\n};\n\n\/* remove_cv *\/\n\ntemplate<class T>\nstruct remove_cv {\n    typedef typename std::remove_volatile<typename std::remove_const<T>::type>::type type;\n};\n\n\/* conditional *\/\n\ntemplate<bool B, class T, class F>\nstruct conditional {\n    typedef T type;\n};\n\ntemplate<class T, class F>\nstruct conditional<false, T, F> {\n    typedef F type;\n};\n\ntemplate<bool B, class T, class F>\nusing conditional_t = typename std::conditional<B, T, F>::type;\n\n\/* is_trivially_destructible *\/\n\ntemplate<typename T>\nstruct is_trivially_destructible {\n    static constexpr const bool value = __has_trivial_destructor(T);\n};\n\n\/* is_trivially_destructible *\/\n\ntemplate<typename T>\nstruct has_trivial_assign {\n    static constexpr const bool value = __has_trivial_assign(T);\n};\n\n\/* is_reference *\/\n\ntemplate <typename T>\nstruct is_reference {\n    static constexpr const bool value = false;\n};\n\ntemplate <typename T>\nstruct is_reference<T&>{\n    static constexpr const bool value = true;\n};\n\ntemplate <typename T>\nstruct is_reference<T&&>{\n    static constexpr const bool value = true;\n};\n\n\/* is_array *\/\n\ntemplate<class T>\nstruct is_array {\n    static constexpr const bool value = false;\n};\n\ntemplate<class T>\nstruct is_array<T[]>{\n    static constexpr const bool value = true;\n};\n\ntemplate<class T, size_t N>\nstruct is_array<T[N]>{\n    static constexpr const bool value = true;\n};\n\n\/* is_function *\/\n\ntemplate<typename T>\nstruct is_function {\n    static constexpr const bool value = false;\n};\n\ntemplate<class Ret, class... Args>\nstruct is_function<Ret(Args...)> {\n    static constexpr const bool value = true;\n};\n\ntemplate<class Ret, class... Args>\nstruct is_function<Ret(Args......)> {\n    static constexpr const bool value = true;\n};\n\n\/* add_rvalue_reference *\/\n\ntemplate<typename T, typename Enable = void>\nstruct add_rvalue_reference;\n\ntemplate<typename T>\nstruct add_rvalue_reference<T, typename std::enable_if_t<std::is_reference<T>::value>> {\n    typedef T type;\n};\n\ntemplate<typename T>\nstruct add_rvalue_reference<T, typename std::disable_if_t<!std::is_reference<T>::value>> {\n    typedef T&& type;\n};\n\n\/* add_pointer *\/\n\ntemplate<typename T>\nstruct add_pointer {\n    typedef typename std::remove_reference<T>::type* type;\n};\n\n\/* decay *\/\n\ntemplate<typename T>\nstruct decay {\n    typedef typename std::remove_reference<T>::type U;\n    typedef typename std::conditional<\n        std::is_array<U>::value,\n        typename std::remove_extent<U>::type*,\n        typename std::conditional<\n            std::is_function<U>::value,\n            typename std::add_pointer<U>::type,\n            typename std::remove_cv<U>::type\n        >::type\n    >::type type;\n};\n\n\/* is_same *\/\n\ntemplate<typename T1, typename T2>\nstruct is_same {\n    static constexpr const bool value = false;\n};\n\ntemplate<typename T1>\nstruct is_same <T1, T1> {\n    static constexpr const bool value = true;\n};\n\n} \/\/end of namespace std\n\n#endif\n<commit_msg>Fix is_trivially_destructible for void<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2016.\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/  http:\/\/www.opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#ifndef TYPE_TRAITS_H\n#define TYPE_TRAITS_H\n\n#include <types.hpp>\n#include <enable_if.hpp>\n\nnamespace std {\n\ntemplate <typename T>\nstruct iterator_traits {\n    using value_type      = typename T::value_type;\n    using reference       = typename T::reference;\n    using pointer         = typename T::pointer;\n    using difference_type = typename T::difference_type;\n};\n\ntemplate <typename T>\nstruct iterator_traits <T*> {\n    using value_type      = T;\n    using reference       = T&;\n    using pointer         = T*;\n    using difference_type = size_t;\n};\n\ntemplate<class T>\nstruct remove_reference {\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_reference<T&>{\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_reference<T&&> {\n    typedef T type;\n};\n\n\/* remove_extent *\/\n\ntemplate<class T>\nstruct remove_extent {\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_extent<T[]> {\n    typedef T type;\n};\n\ntemplate<class T, size_t N>\nstruct remove_extent<T[N]> {\n    typedef T type;\n};\n\n\/* remove_const *\/\n\ntemplate<class T>\nstruct remove_const {\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_const<const T> {\n    typedef T type;\n};\n\n\/* remove_volatile *\/\n\ntemplate<class T>\nstruct remove_volatile {\n    typedef T type;\n};\n\ntemplate<class T>\nstruct remove_volatile<volatile T> {\n    typedef T type;\n};\n\n\/* remove_cv *\/\n\ntemplate<class T>\nstruct remove_cv {\n    typedef typename std::remove_volatile<typename std::remove_const<T>::type>::type type;\n};\n\n\/* conditional *\/\n\ntemplate<bool B, class T, class F>\nstruct conditional {\n    typedef T type;\n};\n\ntemplate<class T, class F>\nstruct conditional<false, T, F> {\n    typedef F type;\n};\n\ntemplate<bool B, class T, class F>\nusing conditional_t = typename std::conditional<B, T, F>::type;\n\n\/* is_trivially_destructible *\/\n\ntemplate<typename T>\nstruct is_trivially_destructible {\n    static constexpr const bool value = __has_trivial_destructor(T);\n};\n\ntemplate<>\nstruct is_trivially_destructible<void> {\n    static constexpr const bool value = true;\n};\n\n\/* is_trivially_destructible *\/\n\ntemplate<typename T>\nstruct has_trivial_assign {\n    static constexpr const bool value = __has_trivial_assign(T);\n};\n\n\/* is_reference *\/\n\ntemplate <typename T>\nstruct is_reference {\n    static constexpr const bool value = false;\n};\n\ntemplate <typename T>\nstruct is_reference<T&>{\n    static constexpr const bool value = true;\n};\n\ntemplate <typename T>\nstruct is_reference<T&&>{\n    static constexpr const bool value = true;\n};\n\n\/* is_array *\/\n\ntemplate<class T>\nstruct is_array {\n    static constexpr const bool value = false;\n};\n\ntemplate<class T>\nstruct is_array<T[]>{\n    static constexpr const bool value = true;\n};\n\ntemplate<class T, size_t N>\nstruct is_array<T[N]>{\n    static constexpr const bool value = true;\n};\n\n\/* is_function *\/\n\ntemplate<typename T>\nstruct is_function {\n    static constexpr const bool value = false;\n};\n\ntemplate<class Ret, class... Args>\nstruct is_function<Ret(Args...)> {\n    static constexpr const bool value = true;\n};\n\ntemplate<class Ret, class... Args>\nstruct is_function<Ret(Args......)> {\n    static constexpr const bool value = true;\n};\n\n\/* add_rvalue_reference *\/\n\ntemplate<typename T, typename Enable = void>\nstruct add_rvalue_reference;\n\ntemplate<typename T>\nstruct add_rvalue_reference<T, typename std::enable_if_t<std::is_reference<T>::value>> {\n    typedef T type;\n};\n\ntemplate<typename T>\nstruct add_rvalue_reference<T, typename std::disable_if_t<!std::is_reference<T>::value>> {\n    typedef T&& type;\n};\n\n\/* add_pointer *\/\n\ntemplate<typename T>\nstruct add_pointer {\n    typedef typename std::remove_reference<T>::type* type;\n};\n\n\/* decay *\/\n\ntemplate<typename T>\nstruct decay {\n    typedef typename std::remove_reference<T>::type U;\n    typedef typename std::conditional<\n        std::is_array<U>::value,\n        typename std::remove_extent<U>::type*,\n        typename std::conditional<\n            std::is_function<U>::value,\n            typename std::add_pointer<U>::type,\n            typename std::remove_cv<U>::type\n        >::type\n    >::type type;\n};\n\n\/* is_same *\/\n\ntemplate<typename T1, typename T2>\nstruct is_same {\n    static constexpr const bool value = false;\n};\n\ntemplate<typename T1>\nstruct is_same <T1, T1> {\n    static constexpr const bool value = true;\n};\n\n} \/\/end of namespace std\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <QMainWindow>\n#include <QFileDialog>\n#include <QString>\n#include <QBoxLayout>\n#include <QLabel>\n#include <QMessageBox>\n\n#include \"mainwindow.h\"\n#include \"parser\/htmlreader.h\"\n#include \"painter\/paintarea.h\"\n\nMainWindow::MainWindow()\n{\n\n    reader = new HTMLReader;\n    webpage = new Document;\n\n    \/\/Draw main window for WebWhirr.\n    setMinimumHeight(400);\n    setMinimumWidth(600);\n\n    positionSet = false;\n\n    QLabel *addressBarLabel = new QLabel(tr(\"Current Document:\"));\n    addressBar = new QLineEdit;\n    addressBar->setReadOnly(true);\n\n    QHBoxLayout *addressBarLayout = new QHBoxLayout;\n    addressBarLayout->addWidget(addressBarLabel);\n    addressBarLayout->addWidget(addressBar);\n\n    paintArea = new PaintArea;\n    scrollArea = new QScrollArea(this);\n    documentDisplay = new QLabel(scrollArea);\n\n    documentDisplay->setAlignment(Qt::AlignTop | Qt::AlignLeft);\n\n    scrollArea->setWidget(documentDisplay);\n    scrollArea->setWidgetResizable(true);\n\n    QVBoxLayout *layout = new QVBoxLayout;\n    layout->addLayout(addressBarLayout);\n    layout->addWidget(scrollArea);\n\n    centralLayout = new QWidget;\n    centralLayout->setLayout(layout);\n\n    setCentralWidget(centralLayout);\n\n    createActions();\n    createMenus();\n\n    setWindowTitle(\"WebWhirr 0.1 Beta\");\n\n}\n\nvoid MainWindow::createActions()\n{\n    openAct = new QAction(tr(\"&Open\"), this);\n    openAct->setShortcut(QKeySequence::Open);\n\n    connect(openAct, SIGNAL(triggered()), this, SLOT(setFilepath()));\n}\n\nvoid MainWindow::createMenus()\n{\n    fileMenu = menuBar()->addMenu(tr(\"&File\"));\n    fileMenu->addAction(openAct);\n}\n\nbool MainWindow::setFilepath(std::string filepath)\n{\n    if (!checkFilepath(filepath))\n    {\n        return false;\n    }\n    else\n    {\n        \/\/Construct a Document (contains node tree) from parsing document\n        \/\/passed from command line.\n        webpage = reader->prepareDocument(filepath);\n        addressBar->setText(QString::fromStdString(filepath));\n\n        paintArea->setDocument(webpage);\n    }\n\n    return true;\n}\n\nbool MainWindow::setFilepath()\n{\n    \/\/QString::toStdString() doesn't convert the filepath properly\n    std::string filepath = QFileDialog::getOpenFileName(this,\n                                                        tr(\"Open HTML Document\")).toUtf8().constData();\n    if (filepath.empty())\n    {\n        return false;\n    }\n\n    if (!checkFilepath(filepath))\n    {\n        QMessageBox invalidTypeErrorBox;\n        invalidTypeErrorBox.setText(\"Error: Document type is invalid or not supported.\");\n        invalidTypeErrorBox.exec();\n        return false;\n    }\n\n    else\n    {\n        \/\/Delete any old nodes to avoid memory leaks.\n        if (webpage->getFirstNode() != NULL)\n        {\n            webpage->clearTree();\n        }\n\n        addressBar->setText(QString::fromStdString(filepath));\n\n\n        \/\/Construct a Document (contains node tree) from parsing document\n        \/\/selected in \"Open HTML Document\" dialog.\n        webpage = reader->prepareDocument(filepath);\n\n        paintArea->setDocument(webpage);\n\n        return repaintDocument();\n    }\n}\n\nbool MainWindow::repaintDocument()\n{\n    \/\/Paint the current document in paintArea by creating a QPixmap\n    \/\/and assigning this to the QLabel documentDisplay. Dimensions\n    \/\/are also set to avoid annoying issues with the scrollbars.\n    QPixmap paintedDocument = paintArea->grab();\n    documentDisplay->setMinimumWidth(paintedDocument.width());\n    documentDisplay->setMaximumWidth(paintedDocument.width());\n    documentDisplay->setMaximumHeight(paintArea->height());\n    documentDisplay->setPixmap(paintedDocument);\n    scrollArea->setMinimumWidth(documentDisplay->width() + 20);\n    this->setMinimumWidth(scrollArea->width() + 20);\n    return true;\n}\n\nbool MainWindow::checkFilepath(std::string filepath)\n{\n    \/\/This is a fix for the crash on opening a non-HTML document.\n    \/\/It will have to do until I write a check into the encoding,\n    \/\/because for some reason a similar check in the document text\n    \/\/itself always returns true.\n    if (filepath.find(\".html\") != std::string::npos ||\n            filepath.find(\".htm\") != std::string::npos)\n    {\n        return true;\n    }\n\n    return false;\n}\n\nDocument* MainWindow::getWebpage()\n{\n    return webpage;\n}\n<commit_msg>Fix issue 23: Must open document twice to be able to scroll through.<commit_after>#include <QMainWindow>\n#include <QFileDialog>\n#include <QString>\n#include <QBoxLayout>\n#include <QLabel>\n#include <QMessageBox>\n\n#include \"mainwindow.h\"\n#include \"parser\/htmlreader.h\"\n#include \"painter\/paintarea.h\"\n\nMainWindow::MainWindow()\n{\n\n    reader = new HTMLReader;\n    webpage = new Document;\n\n    \/\/Draw main window for WebWhirr.\n    setMinimumHeight(480);\n    setMinimumWidth(640);\n\n    positionSet = false;\n\n    QLabel *addressBarLabel = new QLabel(tr(\"Current Document:\"));\n    addressBar = new QLineEdit;\n    addressBar->setReadOnly(true);\n\n    QHBoxLayout *addressBarLayout = new QHBoxLayout;\n    addressBarLayout->addWidget(addressBarLabel);\n    addressBarLayout->addWidget(addressBar);\n\n    paintArea = new PaintArea;\n    scrollArea = new QScrollArea(this);\n    documentDisplay = new QLabel(scrollArea);\n\n    documentDisplay->setAlignment(Qt::AlignTop | Qt::AlignLeft);\n\n    scrollArea->setWidget(documentDisplay);\n    scrollArea->setWidgetResizable(true);\n\n    QVBoxLayout *layout = new QVBoxLayout;\n    layout->addLayout(addressBarLayout);\n    layout->addWidget(scrollArea);\n\n    centralLayout = new QWidget;\n    centralLayout->setLayout(layout);\n\n    setCentralWidget(centralLayout);\n\n    createActions();\n    createMenus();\n\n    setWindowTitle(\"WebWhirr 0.1 Beta\");\n\n}\n\nvoid MainWindow::createActions()\n{\n    openAct = new QAction(tr(\"&Open\"), this);\n    openAct->setShortcut(QKeySequence::Open);\n\n    connect(openAct, SIGNAL(triggered()), this, SLOT(setFilepath()));\n}\n\nvoid MainWindow::createMenus()\n{\n    fileMenu = menuBar()->addMenu(tr(\"&File\"));\n    fileMenu->addAction(openAct);\n}\n\nbool MainWindow::setFilepath(std::string filepath)\n{\n    if (!checkFilepath(filepath))\n    {\n        return false;\n    }\n    else\n    {\n        \/\/Construct a Document (contains node tree) from parsing document\n        \/\/passed from command line.\n        webpage = reader->prepareDocument(filepath);\n        addressBar->setText(QString::fromStdString(filepath));\n\n        paintArea->setDocument(webpage);\n    }\n\n    return true;\n}\n\nbool MainWindow::setFilepath()\n{\n    \/\/QString::toStdString() doesn't convert the filepath properly\n    std::string filepath = QFileDialog::getOpenFileName(this,\n                                                        tr(\"Open HTML Document\")).toUtf8().constData();\n    if (filepath.empty())\n    {\n        return false;\n    }\n\n    if (!checkFilepath(filepath))\n    {\n        QMessageBox invalidTypeErrorBox;\n        invalidTypeErrorBox.setText(\"Error: Document type is invalid or not supported.\");\n        invalidTypeErrorBox.exec();\n        return false;\n    }\n\n    else\n    {\n        \/\/Delete any old nodes to avoid memory leaks.\n        if (webpage->getFirstNode() != NULL)\n        {\n            webpage->clearTree();\n        }\n\n        addressBar->setText(QString::fromStdString(filepath));\n\n\n        \/\/Construct a Document (contains node tree) from parsing document\n        \/\/selected in \"Open HTML Document\" dialog.\n        webpage = reader->prepareDocument(filepath);\n\n        paintArea->setDocument(webpage);\n\n        return repaintDocument();\n    }\n}\n\n\/\/This entire function is a mess. I will return and work\n\/\/on it more after the 0.1.0 release.\nbool MainWindow::repaintDocument()\n{\n    \/\/Paint the current document in paintArea by creating a QPixmap\n    \/\/and assigning this to the QLabel documentDisplay. Dimensions\n    \/\/are also set to avoid annoying issues with the scrollbars.\n    QPixmap paintedDocument;\n    paintArea->update();\n\n    \/\/grab() has to be called twice. Otherwise, the pixmap is the wrong\n    \/\/size when the document is first displayed and the document has to\n    \/\/be opened twice in order to scroll through it properly.\n    paintedDocument = paintArea->grab();\n    paintedDocument.scaled(paintArea->size(), Qt::IgnoreAspectRatio);\n    paintedDocument = paintArea->grab();\n\n    documentDisplay->setMinimumWidth(paintedDocument.width());\n    documentDisplay->setMaximumWidth(paintedDocument.width());\n    documentDisplay->setMaximumHeight(paintArea->height());\n\n    documentDisplay->setPixmap(paintedDocument);\n    scrollArea->setMinimumWidth(documentDisplay->width() + 20);\n    this->setMinimumWidth(scrollArea->width() + 20);\n\n    return true;\n}\n\nbool MainWindow::checkFilepath(std::string filepath)\n{\n    \/\/This is a fix for the crash on opening a non-HTML document.\n    \/\/It will have to do until I write a check into the encoding,\n    \/\/because for some reason a similar check in the document text\n    \/\/itself always returns true.\n    if (filepath.find(\".html\") != std::string::npos ||\n            filepath.find(\".htm\") != std::string::npos)\n    {\n        return true;\n    }\n\n    return false;\n}\n\nDocument* MainWindow::getWebpage()\n{\n    return webpage;\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\/table.h\"\n\n#include <ctype.h>\n#include <string.h>\n\n#include \"perfetto\/base\/logging.h\"\n\nnamespace perfetto {\nnamespace trace_processor {\n\nnamespace {\n\nstruct TableDescriptor {\n  Table::Factory factory;\n  const TraceStorage* storage = nullptr;\n  std::string name;\n  sqlite3_module module = {};\n};\n\nTable* ToTable(sqlite3_vtab* vtab) {\n  return static_cast<Table*>(vtab);\n}\n\nTable::RawCursor* ToCursor(sqlite3_vtab_cursor* cursor) {\n  return static_cast<Table::RawCursor*>(cursor);\n}\n\nstd::string TypeToString(Table::ColumnType type) {\n  switch (type) {\n    case Table::ColumnType::kString:\n      return \"STRING\";\n    case Table::ColumnType::kUint:\n      return \"UNSIGNED INT\";\n    case Table::ColumnType::kUlong:\n      return \"UNSIGNED BIG INT\";\n    case Table::ColumnType::kInt:\n      return \"INT\";\n  }\n  PERFETTO_CHECK(false);\n}\n\n}  \/\/ namespace\n\n\/\/ static\nbool Table::debug = false;\n\nTable::Table() = default;\nTable::~Table() = default;\n\nvoid Table::RegisterInternal(sqlite3* db,\n                             const TraceStorage* storage,\n                             const std::string& table_name,\n                             bool read_write,\n                             Factory factory) {\n  std::unique_ptr<TableDescriptor> desc(new TableDescriptor());\n  desc->storage = storage;\n  desc->factory = factory;\n  desc->name = table_name;\n  sqlite3_module* module = &desc->module;\n  memset(module, 0, sizeof(*module));\n\n  auto create_fn = [](sqlite3* xdb, void* arg, int argc,\n                      const char* const* argv, sqlite3_vtab** tab, char**) {\n    const TableDescriptor* xdesc = static_cast<const TableDescriptor*>(arg);\n    auto table = xdesc->factory(xdb, xdesc->storage);\n\n    auto schema = table->CreateSchema(argc, argv);\n    auto create_stmt = schema.ToCreateTableStmt();\n\n    int res = sqlite3_declare_vtab(xdb, create_stmt.c_str());\n    if (res != SQLITE_OK)\n      return res;\n\n    \/\/ Freed in xDisconnect().\n    table->schema_ = schema;\n    table->name_ = xdesc->name;\n    *tab = table.release();\n\n    return SQLITE_OK;\n  };\n  module->xCreate = create_fn;\n  module->xConnect = create_fn;\n\n  auto destroy_fn = [](sqlite3_vtab* t) {\n    delete ToTable(t);\n    return SQLITE_OK;\n  };\n  module->xDisconnect = destroy_fn;\n  module->xDestroy = destroy_fn;\n\n  module->xOpen = [](sqlite3_vtab* t, sqlite3_vtab_cursor** c) {\n    return ToTable(t)->OpenInternal(c);\n  };\n\n  module->xClose = [](sqlite3_vtab_cursor* c) {\n    delete ToCursor(c);\n    return SQLITE_OK;\n  };\n\n  module->xBestIndex = [](sqlite3_vtab* t, sqlite3_index_info* i) {\n    return ToTable(t)->BestIndexInternal(i);\n  };\n\n  module->xFilter = [](sqlite3_vtab_cursor* c, int i, const char* s, int a,\n                       sqlite3_value** v) {\n    return ToCursor(c)->Filter(i, s, a, v);\n  };\n  module->xNext = [](sqlite3_vtab_cursor* c) {\n    return ToCursor(c)->cursor()->Next();\n  };\n  module->xEof = [](sqlite3_vtab_cursor* c) {\n    return ToCursor(c)->cursor()->Eof();\n  };\n  module->xColumn = [](sqlite3_vtab_cursor* c, sqlite3_context* a, int b) {\n    return ToCursor(c)->cursor()->Column(a, b);\n  };\n\n  module->xRowid = [](sqlite3_vtab_cursor* c, sqlite3_int64* r) {\n    return ToCursor(c)->cursor()->RowId(r);\n  };\n\n  module->xFindFunction =\n      [](sqlite3_vtab* t, int, const char* name,\n         void (**fn)(sqlite3_context*, int, sqlite3_value**),\n         void** args) { return ToTable(t)->FindFunction(name, fn, args); };\n\n  if (read_write) {\n    module->xUpdate = [](sqlite3_vtab* t, int a, sqlite3_value** v,\n                         sqlite3_int64* r) {\n      return ToTable(t)->Update(a, v, r);\n    };\n  }\n\n  int res = sqlite3_create_module_v2(\n      db, table_name.c_str(), module, desc.release(),\n      [](void* arg) { delete static_cast<TableDescriptor*>(arg); });\n  PERFETTO_CHECK(res == SQLITE_OK);\n}\n\nint Table::OpenInternal(sqlite3_vtab_cursor** ppCursor) {\n  \/\/ Freed in xClose().\n  *ppCursor = static_cast<sqlite3_vtab_cursor*>(new RawCursor(this));\n  return SQLITE_OK;\n}\n\nint Table::BestIndexInternal(sqlite3_index_info* idx) {\n  QueryConstraints query_constraints;\n\n  for (int i = 0; i < idx->nOrderBy; i++) {\n    int column = idx->aOrderBy[i].iColumn;\n    bool desc = idx->aOrderBy[i].desc;\n    query_constraints.AddOrderBy(column, desc);\n  }\n\n  for (int i = 0; i < idx->nConstraint; i++) {\n    const auto& cs = idx->aConstraint[i];\n    if (!cs.usable)\n      continue;\n    query_constraints.AddConstraint(cs.iColumn, cs.op);\n\n    \/\/ argvIndex is 1-based so use the current size of the vector.\n    int argv_index = static_cast<int>(query_constraints.constraints().size());\n    idx->aConstraintUsage[i].argvIndex = argv_index;\n  }\n\n  BestIndexInfo info;\n  info.omit.resize(query_constraints.constraints().size());\n\n  int ret = BestIndex(query_constraints, &info);\n\n  if (Table::debug) {\n    PERFETTO_LOG(\n        \"[%s::BestIndex] constraints=%s orderByConsumed=%d estimatedCost=%d\",\n        name_.c_str(), query_constraints.ToNewSqlite3String().get(),\n        info.order_by_consumed, info.estimated_cost);\n  }\n\n  if (ret != SQLITE_OK)\n    return ret;\n\n  idx->orderByConsumed = info.order_by_consumed;\n  idx->estimatedCost = info.estimated_cost;\n\n  size_t j = 0;\n  for (int i = 0; i < idx->nConstraint; i++) {\n    const auto& cs = idx->aConstraint[i];\n    if (cs.usable)\n      idx->aConstraintUsage[i].omit = info.omit[j++];\n  }\n\n  if (!info.order_by_consumed)\n    query_constraints.ClearOrderBy();\n\n  idx->idxStr = query_constraints.ToNewSqlite3String().release();\n  idx->needToFreeIdxStr = true;\n  idx->idxNum = ++best_index_num_;\n\n  return SQLITE_OK;\n}\n\nint Table::FindFunction(const char*, FindFunctionFn, void**) {\n  return 0;\n}\n\nint Table::Update(int, sqlite3_value**, sqlite3_int64*) {\n  return SQLITE_READONLY;\n}\n\nTable::RawCursor::RawCursor(Table* table) : table_(table) {}\n\nint Table::RawCursor::Filter(int idxNum,\n                             const char* idxStr,\n                             int argc,\n                             sqlite3_value** argv) {\n  auto* table = ToTable(this->pVtab);\n  bool cache_hit = true;\n  if (idxNum != table->qc_hash_) {\n    table->qc_cache_ = QueryConstraints::FromString(idxStr);\n    table->qc_hash_ = idxNum;\n    cache_hit = false;\n  }\n  if (Table::debug) {\n    PERFETTO_LOG(\"[%s::Filter] constraints=%s argc=%d cache_hit=%d\",\n                 table->name_.c_str(), idxStr, argc, cache_hit);\n  }\n  PERFETTO_DCHECK(table->qc_cache_.constraints().size() ==\n                  static_cast<size_t>(argc));\n  cursor_ = table_->CreateCursor(table->qc_cache_, argv);\n  return !cursor_ ? SQLITE_ERROR : SQLITE_OK;\n}\n\nTable::Cursor::~Cursor() = default;\n\nint Table::Cursor::RowId(sqlite3_int64*) {\n  return SQLITE_ERROR;\n}\n\nTable::Column::Column(size_t index,\n                      std::string name,\n                      ColumnType type,\n                      bool hidden)\n    : index_(index), name_(name), type_(type), hidden_(hidden) {}\n\nTable::Schema::Schema(std::vector<Column> columns,\n                      std::vector<size_t> primary_keys)\n    : columns_(std::move(columns)), primary_keys_(std::move(primary_keys)) {\n  for (size_t i = 0; i < columns_.size(); i++) {\n    PERFETTO_CHECK(columns_[i].index() == i);\n  }\n  for (auto key : primary_keys_) {\n    PERFETTO_CHECK(key < columns_.size());\n  }\n}\n\nTable::Schema::Schema() = default;\nTable::Schema::Schema(const Schema&) = default;\nTable::Schema& Table::Schema::operator=(const Schema&) = default;\n\nstd::string Table::Schema::ToCreateTableStmt() {\n  std::string stmt = \"CREATE TABLE x(\";\n  for (const auto& col : columns_) {\n    stmt += \" \" + col.name() + \" \" + TypeToString(col.type()) + \",\";\n  }\n  stmt += \" PRIMARY KEY(\";\n  for (size_t i = 0; i < primary_keys_.size(); i++) {\n    if (i != 0)\n      stmt += \", \";\n    stmt += columns_[primary_keys_[i]].name();\n  }\n  stmt += \")) WITHOUT ROWID;\";\n  return stmt;\n}\n\n}  \/\/ namespace trace_processor\n}  \/\/ namespace perfetto\n<commit_msg>trace_processor: fix missing noexcept breaking build in Google3 am: 42319e90a8<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\/table.h\"\n\n#include <ctype.h>\n#include <string.h>\n\n#include \"perfetto\/base\/logging.h\"\n\nnamespace perfetto {\nnamespace trace_processor {\n\nnamespace {\n\nstruct TableDescriptor {\n  Table::Factory factory;\n  const TraceStorage* storage = nullptr;\n  std::string name;\n  sqlite3_module module = {};\n};\n\nTable* ToTable(sqlite3_vtab* vtab) {\n  return static_cast<Table*>(vtab);\n}\n\nTable::RawCursor* ToCursor(sqlite3_vtab_cursor* cursor) {\n  return static_cast<Table::RawCursor*>(cursor);\n}\n\nstd::string TypeToString(Table::ColumnType type) {\n  switch (type) {\n    case Table::ColumnType::kString:\n      return \"STRING\";\n    case Table::ColumnType::kUint:\n      return \"UNSIGNED INT\";\n    case Table::ColumnType::kUlong:\n      return \"UNSIGNED BIG INT\";\n    case Table::ColumnType::kInt:\n      return \"INT\";\n  }\n  PERFETTO_CHECK(false);\n}\n\n}  \/\/ namespace\n\n\/\/ static\nbool Table::debug = false;\n\nTable::Table() = default;\nTable::~Table() = default;\n\nvoid Table::RegisterInternal(sqlite3* db,\n                             const TraceStorage* storage,\n                             const std::string& table_name,\n                             bool read_write,\n                             Factory factory) {\n  std::unique_ptr<TableDescriptor> desc(new TableDescriptor());\n  desc->storage = storage;\n  desc->factory = factory;\n  desc->name = table_name;\n  sqlite3_module* module = &desc->module;\n  memset(module, 0, sizeof(*module));\n\n  auto create_fn = [](sqlite3* xdb, void* arg, int argc,\n                      const char* const* argv, sqlite3_vtab** tab, char**) {\n    const TableDescriptor* xdesc = static_cast<const TableDescriptor*>(arg);\n    auto table = xdesc->factory(xdb, xdesc->storage);\n\n    auto schema = table->CreateSchema(argc, argv);\n    auto create_stmt = schema.ToCreateTableStmt();\n\n    int res = sqlite3_declare_vtab(xdb, create_stmt.c_str());\n    if (res != SQLITE_OK)\n      return res;\n\n    \/\/ Freed in xDisconnect().\n    table->schema_ = schema;\n    table->name_ = xdesc->name;\n    *tab = table.release();\n\n    return SQLITE_OK;\n  };\n  module->xCreate = create_fn;\n  module->xConnect = create_fn;\n\n  auto destroy_fn = [](sqlite3_vtab* t) {\n    delete ToTable(t);\n    return SQLITE_OK;\n  };\n  module->xDisconnect = destroy_fn;\n  module->xDestroy = destroy_fn;\n\n  module->xOpen = [](sqlite3_vtab* t, sqlite3_vtab_cursor** c) {\n    return ToTable(t)->OpenInternal(c);\n  };\n\n  module->xClose = [](sqlite3_vtab_cursor* c) {\n    delete ToCursor(c);\n    return SQLITE_OK;\n  };\n\n  module->xBestIndex = [](sqlite3_vtab* t, sqlite3_index_info* i) {\n    return ToTable(t)->BestIndexInternal(i);\n  };\n\n  module->xFilter = [](sqlite3_vtab_cursor* c, int i, const char* s, int a,\n                       sqlite3_value** v) {\n    return ToCursor(c)->Filter(i, s, a, v);\n  };\n  module->xNext = [](sqlite3_vtab_cursor* c) {\n    return ToCursor(c)->cursor()->Next();\n  };\n  module->xEof = [](sqlite3_vtab_cursor* c) {\n    return ToCursor(c)->cursor()->Eof();\n  };\n  module->xColumn = [](sqlite3_vtab_cursor* c, sqlite3_context* a, int b) {\n    return ToCursor(c)->cursor()->Column(a, b);\n  };\n\n  module->xRowid = [](sqlite3_vtab_cursor* c, sqlite3_int64* r) {\n    return ToCursor(c)->cursor()->RowId(r);\n  };\n\n  module->xFindFunction =\n      [](sqlite3_vtab* t, int, const char* name,\n         void (**fn)(sqlite3_context*, int, sqlite3_value**),\n         void** args) { return ToTable(t)->FindFunction(name, fn, args); };\n\n  if (read_write) {\n    module->xUpdate = [](sqlite3_vtab* t, int a, sqlite3_value** v,\n                         sqlite3_int64* r) {\n      return ToTable(t)->Update(a, v, r);\n    };\n  }\n\n  int res = sqlite3_create_module_v2(\n      db, table_name.c_str(), module, desc.release(),\n      [](void* arg) { delete static_cast<TableDescriptor*>(arg); });\n  PERFETTO_CHECK(res == SQLITE_OK);\n}\n\nint Table::OpenInternal(sqlite3_vtab_cursor** ppCursor) {\n  \/\/ Freed in xClose().\n  *ppCursor = static_cast<sqlite3_vtab_cursor*>(new RawCursor(this));\n  return SQLITE_OK;\n}\n\nint Table::BestIndexInternal(sqlite3_index_info* idx) {\n  QueryConstraints query_constraints;\n\n  for (int i = 0; i < idx->nOrderBy; i++) {\n    int column = idx->aOrderBy[i].iColumn;\n    bool desc = idx->aOrderBy[i].desc;\n    query_constraints.AddOrderBy(column, desc);\n  }\n\n  for (int i = 0; i < idx->nConstraint; i++) {\n    const auto& cs = idx->aConstraint[i];\n    if (!cs.usable)\n      continue;\n    query_constraints.AddConstraint(cs.iColumn, cs.op);\n\n    \/\/ argvIndex is 1-based so use the current size of the vector.\n    int argv_index = static_cast<int>(query_constraints.constraints().size());\n    idx->aConstraintUsage[i].argvIndex = argv_index;\n  }\n\n  BestIndexInfo info;\n  info.omit.resize(query_constraints.constraints().size());\n\n  int ret = BestIndex(query_constraints, &info);\n\n  if (Table::debug) {\n    PERFETTO_LOG(\n        \"[%s::BestIndex] constraints=%s orderByConsumed=%d estimatedCost=%d\",\n        name_.c_str(), query_constraints.ToNewSqlite3String().get(),\n        info.order_by_consumed, info.estimated_cost);\n  }\n\n  if (ret != SQLITE_OK)\n    return ret;\n\n  idx->orderByConsumed = info.order_by_consumed;\n  idx->estimatedCost = info.estimated_cost;\n\n  size_t j = 0;\n  for (int i = 0; i < idx->nConstraint; i++) {\n    const auto& cs = idx->aConstraint[i];\n    if (cs.usable)\n      idx->aConstraintUsage[i].omit = info.omit[j++];\n  }\n\n  if (!info.order_by_consumed)\n    query_constraints.ClearOrderBy();\n\n  idx->idxStr = query_constraints.ToNewSqlite3String().release();\n  idx->needToFreeIdxStr = true;\n  idx->idxNum = ++best_index_num_;\n\n  return SQLITE_OK;\n}\n\nint Table::FindFunction(const char*, FindFunctionFn, void**) {\n  return 0;\n}\n\nint Table::Update(int, sqlite3_value**, sqlite3_int64*) {\n  return SQLITE_READONLY;\n}\n\nTable::RawCursor::RawCursor(Table* table) : table_(table) {}\n\nint Table::RawCursor::Filter(int idxNum,\n                             const char* idxStr,\n                             int argc,\n                             sqlite3_value** argv) {\n  auto* table = ToTable(this->pVtab);\n  bool cache_hit = true;\n  if (idxNum != table->qc_hash_) {\n    table->qc_cache_ = QueryConstraints::FromString(idxStr);\n    table->qc_hash_ = idxNum;\n    cache_hit = false;\n  }\n  if (Table::debug) {\n    PERFETTO_LOG(\"[%s::Filter] constraints=%s argc=%d cache_hit=%d\",\n                 table->name_.c_str(), idxStr, argc, cache_hit);\n  }\n  PERFETTO_DCHECK(table->qc_cache_.constraints().size() ==\n                  static_cast<size_t>(argc));\n  cursor_ = table_->CreateCursor(table->qc_cache_, argv);\n  return !cursor_ ? SQLITE_ERROR : SQLITE_OK;\n}\n\nTable::Cursor::~Cursor() = default;\n\nint Table::Cursor::RowId(sqlite3_int64*) {\n  return SQLITE_ERROR;\n}\n\nTable::Column::Column(size_t index,\n                      std::string name,\n                      ColumnType type,\n                      bool hidden)\n    : index_(index), name_(name), type_(type), hidden_(hidden) {}\n\nTable::Schema::Schema(std::vector<Column> columns,\n                      std::vector<size_t> primary_keys)\n    : columns_(std::move(columns)), primary_keys_(std::move(primary_keys)) {\n  for (size_t i = 0; i < columns_.size(); i++) {\n    PERFETTO_CHECK(columns_[i].index() == i);\n  }\n  for (auto key : primary_keys_) {\n    PERFETTO_CHECK(key < columns_.size());\n  }\n}\n\nTable::Schema::Schema() = default;\nTable::Schema::Schema(const Schema&) noexcept = default;\nTable::Schema& Table::Schema::operator=(const Schema&) = default;\n\nstd::string Table::Schema::ToCreateTableStmt() {\n  std::string stmt = \"CREATE TABLE x(\";\n  for (const auto& col : columns_) {\n    stmt += \" \" + col.name() + \" \" + TypeToString(col.type()) + \",\";\n  }\n  stmt += \" PRIMARY KEY(\";\n  for (size_t i = 0; i < primary_keys_.size(); i++) {\n    if (i != 0)\n      stmt += \", \";\n    stmt += columns_[primary_keys_[i]].name();\n  }\n  stmt += \")) WITHOUT ROWID;\";\n  return stmt;\n}\n\n}  \/\/ namespace trace_processor\n}  \/\/ namespace perfetto\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 \"s60devicespreferencepane.h\"\n#include \"ui_s60devicespreferencepane.h\"\n#include \"s60devices.h\"\n\n#include <qt4projectmanager\/qt4projectmanagerconstants.h>\n\n#include <utils\/qtcassert.h>\n#include <coreplugin\/coreconstants.h>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QtDebug>\n#include <QtCore\/QSharedPointer>\n\n#include <QtGui\/QFileDialog>\n#include <QtGui\/QMessageBox>\n#include <QtGui\/QIcon>\n#include <QtGui\/QApplication>\n#include <QtGui\/QStyle>\n#include <QtGui\/QStandardItemModel>\n#include <QtGui\/QStandardItem>\n\nenum { deviceRole = Qt::UserRole + 1 };\n\nenum Columns { DefaultColumn, EpocColumn, QtColumn, ColumnCount };\n\ntypedef QSharedPointer<Qt4ProjectManager::Internal::S60Devices::Device> DevicePtr;\nQ_DECLARE_METATYPE(DevicePtr)\n\ntypedef QList<QStandardItem *> StandardItemList;\n\nnamespace Qt4ProjectManager {\nnamespace Internal {\n\nstatic inline DevicePtr deviceFromItem(const QStandardItem *item)\n{\n    return qvariant_cast<DevicePtr>(item->data(deviceRole));\n}\n\n\/\/ Device model storing a shared pointer to the device as user data.\n\/\/ Provides a checkable 'default' column which works exclusively.\nclass S60DevicesModel : public QStandardItemModel {\n    Q_OBJECT\npublic:\n    typedef QList<S60Devices::Device> DeviceList;\n\n    explicit S60DevicesModel(bool defaultColumnCheckable, QObject *parent = 0);\n\n    void setDevices(const DeviceList &list);\n    DeviceList devices() const;\n    void appendDevice(const S60Devices::Device &device);\n\nprivate slots:\n    void slotItemChanged(QStandardItem *item);\n\nprivate:\n    const bool m_defaultColumnCheckable;\n};\n\nS60DevicesModel::S60DevicesModel(bool defaultColumnCheckable, QObject *parent) :\n        QStandardItemModel(0, ColumnCount, parent),\n        m_defaultColumnCheckable(defaultColumnCheckable)\n{\n    QStringList headers;\n    headers << S60DevicesBaseWidget::tr(\"Default\")\n            << S60DevicesBaseWidget::tr(\"SDK Location\")\n            << S60DevicesBaseWidget::tr(\"Qt Location\");\n    setHorizontalHeaderLabels(headers);\n\n    if (m_defaultColumnCheckable)\n        connect(this, SIGNAL(itemChanged(QStandardItem*)),\n                this, SLOT(slotItemChanged(QStandardItem*)));\n}\n\nvoid S60DevicesModel::appendDevice(const S60Devices::Device &device)\n{\n    \/\/ Create SDK\/Qt column items with shared pointer to entry as data.\n    const QVariant deviceData = qVariantFromValue(DevicePtr(new S60Devices::Device(device)));\n\n    const Qt::ItemFlags flags = Qt::ItemIsEnabled|Qt::ItemIsSelectable;\n\n    QStandardItem *defaultItem = new QStandardItem;\n    defaultItem->setCheckable(true);\n    defaultItem->setCheckState(device.isDefault ? Qt::Checked : Qt::Unchecked);\n    \/\/ Item is only checkable if it is not the default.\n    Qt::ItemFlags checkFlags = flags;\n    if (!device.isDefault && m_defaultColumnCheckable)\n        checkFlags |= Qt::ItemIsUserCheckable;\n    defaultItem->setFlags(checkFlags);\n\n    defaultItem->setData(deviceData);\n\n    QStandardItem *epocItem = new QStandardItem(QDir::toNativeSeparators(device.epocRoot));\n    epocItem->setFlags(flags);\n    epocItem->setData(deviceData);\n\n    const QString qtDesc = device.qt.isEmpty() ?\n                           S60DevicesModel::tr(\"No Qt installed\") :\n                           QDir::toNativeSeparators(device.qt);\n    QStandardItem *qtItem = new QStandardItem(qtDesc);\n    qtItem->setFlags(flags);\n    qtItem->setData(deviceData);\n\n    const QString tooltip = device.toHtml();\n    epocItem->setToolTip(tooltip);\n    qtItem->setToolTip(tooltip);\n\n    StandardItemList row;\n    row << defaultItem << epocItem << qtItem;\n    appendRow(row);\n}\n\nvoid S60DevicesModel::setDevices(const DeviceList &list)\n{\n    removeRows(0, rowCount());\n    foreach(const S60Devices::Device &device, list)\n        appendDevice(device);\n}\n\nS60DevicesModel::DeviceList S60DevicesModel::devices() const\n{\n    S60DevicesModel::DeviceList rc;\n    const int count = rowCount();\n    for (int r = 0; r < count; r++)\n        rc.push_back(S60Devices::Device(*deviceFromItem(item(r, 0))));\n    return rc;\n}\n\nvoid S60DevicesModel::slotItemChanged(QStandardItem *changedItem)\n{\n    \/\/ Sync all \"default\" checkmarks. Emulate an exclusive group\n    \/\/ by enabling only the unchecked items (preventing the user from unchecking)\n    \/\/ and uncheck all other items. Protect against recursion.\n    if (changedItem->column() != DefaultColumn || changedItem->checkState() != Qt::Checked)\n        return;\n    const int row = changedItem->row();\n    const int count = rowCount();\n    for (int r = 0; r < count; r++) {\n        QStandardItem *rowItem = item(r, DefaultColumn);\n        if (r == row) { \/\/ Prevent uncheck.\n            rowItem->setFlags(rowItem->flags() & ~Qt::ItemIsUserCheckable);\n            deviceFromItem(rowItem)->isDefault = true;\n        } else {\n            \/\/ Uncheck others.\n            rowItem->setCheckState(Qt::Unchecked);\n            rowItem->setFlags(rowItem->flags() | Qt::ItemIsUserCheckable);\n            deviceFromItem(rowItem)->isDefault = false;\n        }\n    }\n}\n\n\/\/ --------------- S60DevicesBaseWidget\nS60DevicesBaseWidget::S60DevicesBaseWidget(unsigned flags, QWidget *parent) :\n    QWidget(parent),\n    m_ui(new Ui::S60DevicesPreferencePane),\n    m_model(new S60DevicesModel(flags & DeviceDefaultCheckable))\n{\n    m_ui->setupUi(this);\n    m_ui->addButton->setIcon(QIcon(QLatin1String(Core::Constants::ICON_PLUS)));\n    connect(m_ui->addButton, SIGNAL(clicked()), this, SLOT(addDevice()));\n    m_ui->removeButton->setIcon(QIcon(QLatin1String(Core::Constants::ICON_MINUS)));\n    connect(m_ui->removeButton, SIGNAL(clicked()), this, SLOT(removeDevice()));\n    m_ui->refreshButton->setIcon(qApp->style()->standardIcon(QStyle::SP_BrowserReload));\n    connect(m_ui->refreshButton, SIGNAL(clicked()), this, SLOT(refresh()));\n    m_ui->changeQtButton->setIcon(QIcon(QLatin1String(\":\/welcome\/images\/qt_logo.png\")));\n    connect(m_ui->changeQtButton, SIGNAL(clicked()), this, SLOT(changeQtVersion()));\n\n    m_ui->list->setModel(m_model);\n    connect(m_ui->list->selectionModel(), SIGNAL(currentChanged(QModelIndex,QModelIndex)),\n            this, SLOT(currentChanged(QModelIndex,QModelIndex)));\n\n    m_ui->addButton->setVisible(flags & ShowAddButton);\n    m_ui->removeButton->setVisible(flags & ShowAddButton);\n    m_ui->removeButton->setEnabled(false);\n    m_ui->changeQtButton->setVisible(flags & ShowChangeQtButton);\n    m_ui->removeButton->setEnabled(false);\n    m_ui->refreshButton->setVisible(flags & ShowRefreshButton);\n}\n\nS60DevicesBaseWidget::~S60DevicesBaseWidget()\n{\n    delete m_ui;\n}\n\nQStandardItem *S60DevicesBaseWidget::currentItem() const\n{\n    \/\/ Return the column-0 item.\n    QModelIndex current = m_ui->list->currentIndex();\n    if (current.isValid()) {\n        if (current.row() != 0)\n            current = current.sibling(current.row(), 0);\n        return m_model->itemFromIndex(current);\n    }\n    return 0;\n}\n\nS60DevicesBaseWidget::DeviceList S60DevicesBaseWidget::devices() const\n{\n    return m_model->devices();\n}\n\nvoid S60DevicesBaseWidget::setDevices(const DeviceList &s60devices,\n                                      const QString &errorString)\n{\n    m_model->setDevices(s60devices);\n\n    for (int c = 0; c < ColumnCount; c++)\n        m_ui->list->resizeColumnToContents(c);\n\n    if (errorString.isEmpty()) {\n        clearErrorLabel();\n    } else {\n        setErrorLabel(errorString);\n    }\n}\n\nvoid S60DevicesBaseWidget::changeQtVersion()\n{\n    if (const QStandardItem *item = currentItem()) {\n        const QString qtDir = promptDirectory(tr(\"Choose Qt folder\"));\n        if (!qtDir.isEmpty()) {\n            const DevicePtr device = deviceFromItem(item);\n            device->qt = qtDir;\n        }\n    }\n}\n\nvoid S60DevicesBaseWidget::removeDevice()\n{\n    if (const QStandardItem *item = currentItem())\n        m_model->removeRows(item->row(), 1);\n}\n\nvoid S60DevicesBaseWidget::currentChanged(const QModelIndex &current,\n                                          const QModelIndex & \/* previous *\/)\n{\n    const bool hasItem = current.isValid();\n    m_ui->changeQtButton->setEnabled(hasItem);\n    m_ui->removeButton->setEnabled(hasItem);\n}\n\nvoid S60DevicesBaseWidget::setErrorLabel(const QString& t)\n{\n    m_ui->errorLabel->setText(t);\n    m_ui->errorLabel->setVisible(true);\n}\n\nvoid S60DevicesBaseWidget::clearErrorLabel()\n{\n    m_ui->errorLabel->setVisible(false);\n}\n\nQString S60DevicesBaseWidget::promptDirectory(const QString &title)\n{\n    return QFileDialog::getExistingDirectory(this, title);\n}\n\nvoid S60DevicesBaseWidget::appendDevice(const S60Devices::Device &d)\n{\n    m_model->appendDevice(d);\n}\n\nint S60DevicesBaseWidget::deviceCount() const\n{\n    return m_model->rowCount();\n}\n\n\/\/ ============ AutoDetectS60DevicesWidget\n\nAutoDetectS60DevicesWidget::AutoDetectS60DevicesWidget(QWidget *parent,\n                                                       AutoDetectS60Devices *devices,\n                                                       bool changeQtVersionEnabled) :\n    S60DevicesBaseWidget(ShowRefreshButton | (changeQtVersionEnabled ? unsigned(ShowChangeQtButton) : 0u),\n                         parent),\n    m_devices(devices)\n{\n    refresh();\n}\n\nvoid AutoDetectS60DevicesWidget::refresh()\n{\n    m_devices->detectDevices();\n    setDevices(m_devices->devices(), m_devices->errorString());\n}\n\n\/\/ ============ GnuPocS60DevicesWidget\nGnuPocS60DevicesWidget::GnuPocS60DevicesWidget(QWidget *parent) :\n    S60DevicesBaseWidget(ShowAddButton|ShowRemoveButton|ShowChangeQtButton|DeviceDefaultCheckable,\n                         parent)\n{\n}\n\nvoid GnuPocS60DevicesWidget::addDevice()\n{\n    \/\/ 1) Prompt for GnuPoc\n    const QString epocRoot = promptDirectory(tr(\"Step 1 of 2: Choose GnuPoc folder\"));\n    if (epocRoot.isEmpty())\n        return;\n    \/\/ 2) Prompt for Qt. Catch equal inputs just in case someone clicks very rapidly.\n    QString qtDir;\n    while (true) {\n        qtDir = promptDirectory(tr(\"Step 2 of 2: Choose Qt folder\"));\n        if (qtDir.isEmpty())\n            return;\n        if (qtDir == epocRoot) {\n            QMessageBox::warning(this, tr(\"Adding GnuPoc\"),\n                                 tr(\"GnuPoc and Qt folders must not be identical.\"));\n        } else {\n            break;\n        }\n    }\n    \/\/ Add a device, make default if first.\n    S60Devices::Device device = GnuPocS60Devices::createDevice(epocRoot, qtDir);\n    if (deviceCount() == 0)\n        device.isDefault = true;\n    appendDevice(device);\n}\n\n\/\/ ================= S60DevicesPreferencePane\nS60DevicesPreferencePane::S60DevicesPreferencePane(S60Devices *devices, QObject *parent)\n        : Core::IOptionsPage(parent),\n        m_widget(0),\n        m_devices(devices)\n{\n}\n\nS60DevicesPreferencePane::~S60DevicesPreferencePane()\n{\n}\n\nQString S60DevicesPreferencePane::id() const\n{\n    return QLatin1String(\"Z.S60 SDKs\");\n}\n\nQString S60DevicesPreferencePane::displayName() const\n{\n    return tr(\"S60 SDKs\");\n}\n\nQString S60DevicesPreferencePane::category() const\n{\n    return QLatin1String(Constants::QT_SETTINGS_CATEGORY);\n}\n\nQString S60DevicesPreferencePane::displayCategory() const\n{\n    return QCoreApplication::translate(\"Qt4ProjectManager\", Constants::QT_SETTINGS_CATEGORY);\n}\n\nQIcon S60DevicesPreferencePane::categoryIcon() const\n{\n    return QIcon(Constants::QT_SETTINGS_CATEGORY_ICON);\n}\n\nS60DevicesBaseWidget *S60DevicesPreferencePane::createWidget(QWidget *parent) const\n{\n    \/\/ Symbian ABLD\/Raptor: Qt installed into SDK, cannot change\n    if (AutoDetectS60QtDevices *aqd = qobject_cast<AutoDetectS60QtDevices *>(m_devices))\n        return new AutoDetectS60DevicesWidget(parent, aqd, false);\n    \/\/ Not used yet: Manual association of Qt with auto-detected SDK\n    if (AutoDetectS60Devices *ad = qobject_cast<AutoDetectS60Devices *>(m_devices))\n        return new AutoDetectS60DevicesWidget(parent, ad, true);\n    if (GnuPocS60Devices *gd = qobject_cast<GnuPocS60Devices*>(m_devices)) {\n        GnuPocS60DevicesWidget *gw = new GnuPocS60DevicesWidget(parent);\n        gw->setDevices(gd->devices());\n        return gw;\n    }\n    return 0; \/\/ Huh?\n}\n\nQWidget *S60DevicesPreferencePane::createPage(QWidget *parent)\n{\n    if (m_widget)\n        delete m_widget;\n    m_widget = createWidget(parent);\n    QTC_ASSERT(m_widget, return 0)\n    return m_widget;\n}\n\nvoid S60DevicesPreferencePane::apply()\n{\n    QTC_ASSERT(m_widget, return)\n\n    m_devices->setDevices(m_widget->devices());\n}\n\nvoid S60DevicesPreferencePane::finish()\n{\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Qt4ProjectManager\n\n#include \"s60devicespreferencepane.moc\"\n<commit_msg>Show \"default device\" checkmark instead of comboboxes on Windows<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 \"s60devicespreferencepane.h\"\n#include \"ui_s60devicespreferencepane.h\"\n#include \"s60devices.h\"\n\n#include <qt4projectmanager\/qt4projectmanagerconstants.h>\n\n#include <utils\/qtcassert.h>\n#include <coreplugin\/coreconstants.h>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QtDebug>\n#include <QtCore\/QSharedPointer>\n\n#include <QtGui\/QFileDialog>\n#include <QtGui\/QMessageBox>\n#include <QtGui\/QIcon>\n#include <QtGui\/QApplication>\n#include <QtGui\/QStyle>\n#include <QtGui\/QStandardItemModel>\n#include <QtGui\/QStandardItem>\n\nenum { deviceRole = Qt::UserRole + 1 };\n\nenum Columns { DefaultColumn, EpocColumn, QtColumn, ColumnCount };\n\ntypedef QSharedPointer<Qt4ProjectManager::Internal::S60Devices::Device> DevicePtr;\nQ_DECLARE_METATYPE(DevicePtr)\n\ntypedef QList<QStandardItem *> StandardItemList;\n\nnamespace Qt4ProjectManager {\nnamespace Internal {\n\nstatic inline DevicePtr deviceFromItem(const QStandardItem *item)\n{\n    return qvariant_cast<DevicePtr>(item->data(deviceRole));\n}\n\n\/\/ Device model storing a shared pointer to the device as user data.\n\/\/ Provides a checkable 'default' column which works exclusively.\nclass S60DevicesModel : public QStandardItemModel {\n    Q_OBJECT\npublic:\n    typedef QList<S60Devices::Device> DeviceList;\n\n    explicit S60DevicesModel(bool defaultColumnCheckable, QObject *parent = 0);\n\n    void setDevices(const DeviceList &list);\n    DeviceList devices() const;\n    void appendDevice(const S60Devices::Device &device);\n\nprivate slots:\n    void slotItemChanged(QStandardItem *item);\n\nprivate:\n    const bool m_defaultColumnCheckable;\n};\n\nS60DevicesModel::S60DevicesModel(bool defaultColumnCheckable, QObject *parent) :\n        QStandardItemModel(0, ColumnCount, parent),\n        m_defaultColumnCheckable(defaultColumnCheckable)\n{\n    QStringList headers;\n    headers << S60DevicesBaseWidget::tr(\"Default\")\n            << S60DevicesBaseWidget::tr(\"SDK Location\")\n            << S60DevicesBaseWidget::tr(\"Qt Location\");\n    setHorizontalHeaderLabels(headers);\n\n    if (m_defaultColumnCheckable)\n        connect(this, SIGNAL(itemChanged(QStandardItem*)),\n                this, SLOT(slotItemChanged(QStandardItem*)));\n}\n\nvoid S60DevicesModel::appendDevice(const S60Devices::Device &device)\n{\n    \/\/ Create SDK\/Qt column items with shared pointer to entry as data.\n    const QVariant deviceData = qVariantFromValue(DevicePtr(new S60Devices::Device(device)));\n\n    const Qt::ItemFlags flags = Qt::ItemIsEnabled|Qt::ItemIsSelectable;\n\n    QStandardItem *defaultItem = new QStandardItem;\n    if (m_defaultColumnCheckable) {\n        defaultItem->setCheckable(true);\n        defaultItem->setCheckState(device.isDefault ? Qt::Checked : Qt::Unchecked);\n        \/\/ Item is only checkable if it is not the default.\n        Qt::ItemFlags checkFlags = flags;\n        if (!device.isDefault)\n            checkFlags |= Qt::ItemIsUserCheckable;\n        defaultItem->setFlags(checkFlags);\n    } else {\n        defaultItem->setIcon(device.isDefault ? QIcon(QLatin1String(\":\/extensionsystem\/images\/ok.png\")) : QIcon());\n    }\n\n    defaultItem->setData(deviceData);\n\n    QStandardItem *epocItem = new QStandardItem(QDir::toNativeSeparators(device.epocRoot));\n    epocItem->setFlags(flags);\n    epocItem->setData(deviceData);\n\n    const QString qtDesc = device.qt.isEmpty() ?\n                           S60DevicesModel::tr(\"No Qt installed\") :\n                           QDir::toNativeSeparators(device.qt);\n    QStandardItem *qtItem = new QStandardItem(qtDesc);\n    qtItem->setFlags(flags);\n    qtItem->setData(deviceData);\n\n    const QString tooltip = device.toHtml();\n    epocItem->setToolTip(tooltip);\n    qtItem->setToolTip(tooltip);\n\n    StandardItemList row;\n    row << defaultItem << epocItem << qtItem;\n    appendRow(row);\n}\n\nvoid S60DevicesModel::setDevices(const DeviceList &list)\n{\n    removeRows(0, rowCount());\n    foreach(const S60Devices::Device &device, list)\n        appendDevice(device);\n}\n\nS60DevicesModel::DeviceList S60DevicesModel::devices() const\n{\n    S60DevicesModel::DeviceList rc;\n    const int count = rowCount();\n    for (int r = 0; r < count; r++)\n        rc.push_back(S60Devices::Device(*deviceFromItem(item(r, 0))));\n    return rc;\n}\n\nvoid S60DevicesModel::slotItemChanged(QStandardItem *changedItem)\n{\n    \/\/ Sync all \"default\" checkmarks. Emulate an exclusive group\n    \/\/ by enabling only the unchecked items (preventing the user from unchecking)\n    \/\/ and uncheck all other items. Protect against recursion.\n    if (changedItem->column() != DefaultColumn || changedItem->checkState() != Qt::Checked)\n        return;\n    const int row = changedItem->row();\n    const int count = rowCount();\n    for (int r = 0; r < count; r++) {\n        QStandardItem *rowItem = item(r, DefaultColumn);\n        if (r == row) { \/\/ Prevent uncheck.\n            rowItem->setFlags(rowItem->flags() & ~Qt::ItemIsUserCheckable);\n            deviceFromItem(rowItem)->isDefault = true;\n        } else {\n            \/\/ Uncheck others.\n            rowItem->setCheckState(Qt::Unchecked);\n            rowItem->setFlags(rowItem->flags() | Qt::ItemIsUserCheckable);\n            deviceFromItem(rowItem)->isDefault = false;\n        }\n    }\n}\n\n\/\/ --------------- S60DevicesBaseWidget\nS60DevicesBaseWidget::S60DevicesBaseWidget(unsigned flags, QWidget *parent) :\n    QWidget(parent),\n    m_ui(new Ui::S60DevicesPreferencePane),\n    m_model(new S60DevicesModel(flags & DeviceDefaultCheckable))\n{\n    m_ui->setupUi(this);\n    m_ui->addButton->setIcon(QIcon(QLatin1String(Core::Constants::ICON_PLUS)));\n    connect(m_ui->addButton, SIGNAL(clicked()), this, SLOT(addDevice()));\n    m_ui->removeButton->setIcon(QIcon(QLatin1String(Core::Constants::ICON_MINUS)));\n    connect(m_ui->removeButton, SIGNAL(clicked()), this, SLOT(removeDevice()));\n    m_ui->refreshButton->setIcon(qApp->style()->standardIcon(QStyle::SP_BrowserReload));\n    connect(m_ui->refreshButton, SIGNAL(clicked()), this, SLOT(refresh()));\n    m_ui->changeQtButton->setIcon(QIcon(QLatin1String(\":\/welcome\/images\/qt_logo.png\")));\n    connect(m_ui->changeQtButton, SIGNAL(clicked()), this, SLOT(changeQtVersion()));\n\n    m_ui->list->setModel(m_model);\n    connect(m_ui->list->selectionModel(), SIGNAL(currentChanged(QModelIndex,QModelIndex)),\n            this, SLOT(currentChanged(QModelIndex,QModelIndex)));\n\n    m_ui->addButton->setVisible(flags & ShowAddButton);\n    m_ui->removeButton->setVisible(flags & ShowAddButton);\n    m_ui->removeButton->setEnabled(false);\n    m_ui->changeQtButton->setVisible(flags & ShowChangeQtButton);\n    m_ui->removeButton->setEnabled(false);\n    m_ui->refreshButton->setVisible(flags & ShowRefreshButton);\n}\n\nS60DevicesBaseWidget::~S60DevicesBaseWidget()\n{\n    delete m_ui;\n}\n\nQStandardItem *S60DevicesBaseWidget::currentItem() const\n{\n    \/\/ Return the column-0 item.\n    QModelIndex current = m_ui->list->currentIndex();\n    if (current.isValid()) {\n        if (current.row() != 0)\n            current = current.sibling(current.row(), 0);\n        return m_model->itemFromIndex(current);\n    }\n    return 0;\n}\n\nS60DevicesBaseWidget::DeviceList S60DevicesBaseWidget::devices() const\n{\n    return m_model->devices();\n}\n\nvoid S60DevicesBaseWidget::setDevices(const DeviceList &s60devices,\n                                      const QString &errorString)\n{\n    m_model->setDevices(s60devices);\n\n    for (int c = 0; c < ColumnCount; c++)\n        m_ui->list->resizeColumnToContents(c);\n\n    if (errorString.isEmpty()) {\n        clearErrorLabel();\n    } else {\n        setErrorLabel(errorString);\n    }\n}\n\nvoid S60DevicesBaseWidget::changeQtVersion()\n{\n    if (const QStandardItem *item = currentItem()) {\n        const QString qtDir = promptDirectory(tr(\"Choose Qt folder\"));\n        if (!qtDir.isEmpty()) {\n            const DevicePtr device = deviceFromItem(item);\n            device->qt = qtDir;\n        }\n    }\n}\n\nvoid S60DevicesBaseWidget::removeDevice()\n{\n    if (const QStandardItem *item = currentItem())\n        m_model->removeRows(item->row(), 1);\n}\n\nvoid S60DevicesBaseWidget::currentChanged(const QModelIndex &current,\n                                          const QModelIndex & \/* previous *\/)\n{\n    const bool hasItem = current.isValid();\n    m_ui->changeQtButton->setEnabled(hasItem);\n    m_ui->removeButton->setEnabled(hasItem);\n}\n\nvoid S60DevicesBaseWidget::setErrorLabel(const QString& t)\n{\n    m_ui->errorLabel->setText(t);\n    m_ui->errorLabel->setVisible(true);\n}\n\nvoid S60DevicesBaseWidget::clearErrorLabel()\n{\n    m_ui->errorLabel->setVisible(false);\n}\n\nQString S60DevicesBaseWidget::promptDirectory(const QString &title)\n{\n    return QFileDialog::getExistingDirectory(this, title);\n}\n\nvoid S60DevicesBaseWidget::appendDevice(const S60Devices::Device &d)\n{\n    m_model->appendDevice(d);\n}\n\nint S60DevicesBaseWidget::deviceCount() const\n{\n    return m_model->rowCount();\n}\n\n\/\/ ============ AutoDetectS60DevicesWidget\n\nAutoDetectS60DevicesWidget::AutoDetectS60DevicesWidget(QWidget *parent,\n                                                       AutoDetectS60Devices *devices,\n                                                       bool changeQtVersionEnabled) :\n    S60DevicesBaseWidget(ShowRefreshButton | (changeQtVersionEnabled ? unsigned(ShowChangeQtButton) : 0u),\n                         parent),\n    m_devices(devices)\n{\n    refresh();\n}\n\nvoid AutoDetectS60DevicesWidget::refresh()\n{\n    m_devices->detectDevices();\n    setDevices(m_devices->devices(), m_devices->errorString());\n}\n\n\/\/ ============ GnuPocS60DevicesWidget\nGnuPocS60DevicesWidget::GnuPocS60DevicesWidget(QWidget *parent) :\n    S60DevicesBaseWidget(ShowAddButton|ShowRemoveButton|ShowChangeQtButton|DeviceDefaultCheckable,\n                         parent)\n{\n}\n\nvoid GnuPocS60DevicesWidget::addDevice()\n{\n    \/\/ 1) Prompt for GnuPoc\n    const QString epocRoot = promptDirectory(tr(\"Step 1 of 2: Choose GnuPoc folder\"));\n    if (epocRoot.isEmpty())\n        return;\n    \/\/ 2) Prompt for Qt. Catch equal inputs just in case someone clicks very rapidly.\n    QString qtDir;\n    while (true) {\n        qtDir = promptDirectory(tr(\"Step 2 of 2: Choose Qt folder\"));\n        if (qtDir.isEmpty())\n            return;\n        if (qtDir == epocRoot) {\n            QMessageBox::warning(this, tr(\"Adding GnuPoc\"),\n                                 tr(\"GnuPoc and Qt folders must not be identical.\"));\n        } else {\n            break;\n        }\n    }\n    \/\/ Add a device, make default if first.\n    S60Devices::Device device = GnuPocS60Devices::createDevice(epocRoot, qtDir);\n    if (deviceCount() == 0)\n        device.isDefault = true;\n    appendDevice(device);\n}\n\n\/\/ ================= S60DevicesPreferencePane\nS60DevicesPreferencePane::S60DevicesPreferencePane(S60Devices *devices, QObject *parent)\n        : Core::IOptionsPage(parent),\n        m_widget(0),\n        m_devices(devices)\n{\n}\n\nS60DevicesPreferencePane::~S60DevicesPreferencePane()\n{\n}\n\nQString S60DevicesPreferencePane::id() const\n{\n    return QLatin1String(\"Z.S60 SDKs\");\n}\n\nQString S60DevicesPreferencePane::displayName() const\n{\n    return tr(\"S60 SDKs\");\n}\n\nQString S60DevicesPreferencePane::category() const\n{\n    return QLatin1String(Constants::QT_SETTINGS_CATEGORY);\n}\n\nQString S60DevicesPreferencePane::displayCategory() const\n{\n    return QCoreApplication::translate(\"Qt4ProjectManager\", Constants::QT_SETTINGS_CATEGORY);\n}\n\nQIcon S60DevicesPreferencePane::categoryIcon() const\n{\n    return QIcon(Constants::QT_SETTINGS_CATEGORY_ICON);\n}\n\nS60DevicesBaseWidget *S60DevicesPreferencePane::createWidget(QWidget *parent) const\n{\n    \/\/ Symbian ABLD\/Raptor: Qt installed into SDK, cannot change\n    if (AutoDetectS60QtDevices *aqd = qobject_cast<AutoDetectS60QtDevices *>(m_devices))\n        return new AutoDetectS60DevicesWidget(parent, aqd, false);\n    \/\/ Not used yet: Manual association of Qt with auto-detected SDK\n    if (AutoDetectS60Devices *ad = qobject_cast<AutoDetectS60Devices *>(m_devices))\n        return new AutoDetectS60DevicesWidget(parent, ad, true);\n    if (GnuPocS60Devices *gd = qobject_cast<GnuPocS60Devices*>(m_devices)) {\n        GnuPocS60DevicesWidget *gw = new GnuPocS60DevicesWidget(parent);\n        gw->setDevices(gd->devices());\n        return gw;\n    }\n    return 0; \/\/ Huh?\n}\n\nQWidget *S60DevicesPreferencePane::createPage(QWidget *parent)\n{\n    if (m_widget)\n        delete m_widget;\n    m_widget = createWidget(parent);\n    QTC_ASSERT(m_widget, return 0)\n    return m_widget;\n}\n\nvoid S60DevicesPreferencePane::apply()\n{\n    QTC_ASSERT(m_widget, return)\n\n    m_devices->setDevices(m_widget->devices());\n}\n\nvoid S60DevicesPreferencePane::finish()\n{\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Qt4ProjectManager\n\n#include \"s60devicespreferencepane.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of the Pangolin Project.\n * http:\/\/github.com\/stevenlovegrove\/Pangolin\n *\n * Copyright (c) 2014 Steven Lovegrove\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 <pangolin\/video\/drivers\/thread.h>\n\n#ifdef DEBUGTHREAD\n  #include <pangolin\/utils\/timer.h>\n  #define TSTART() pangolin::basetime start,last,now; start = pangolin::TimeNow(); last = start;\n  #define TGRABANDPRINT(...)  now = pangolin::TimeNow(); fprintf(stderr,\"THREAD: \"); fprintf(stderr, __VA_ARGS__); fprintf(stderr, \" %fms.\\n\",1000*pangolin::TimeDiff_s(last, now)); last = now;\n  #define DBGPRINT(...) fprintf(stderr,\"THREAD: \"); fprintf(stderr, __VA_ARGS__); fprintf(stderr,\"\\n\");\n#else\n  #define TSTART()\n  #define TGRABANDPRINT(...)\n  #define DBGPRINT(...)\n#endif\n\nnamespace pangolin\n{\n\nThreadVideo::ThreadVideo(VideoInterface* src, unsigned int num_buffers): quit_grab_thread(true), num_buffers(num_buffers)\n{\n    if(!src) {\n        throw VideoException(\"ThreadVideo: VideoInterface in must not be null\");\n    }\n    videoin.push_back(src);\n    \/\/ queue init allocates buffers.\n    queue.init(num_buffers, videoin[0]->SizeBytes());\n    Start();\n}\n\nThreadVideo::~ThreadVideo()\n{\n    Stop();\n    delete videoin[0];\n    \/\/ queue destructor will take care of deallocating buffers.\n}\n\n\/\/! Implement VideoInput::Start()\nvoid ThreadVideo::Start()\n{\n    videoin[0]->Start();\n    quit_grab_thread = false;\n    grab_thread = boostd::thread(boostd::ref(*this));\n}\n\n\/\/! Implement VideoInput::Stop()\nvoid ThreadVideo::Stop()\n{\n    quit_grab_thread = true;\n    if(grab_thread.joinable()) {\n        grab_thread.join();\n    }\n    videoin[0]->Stop();\n}\n\n\/\/! Implement VideoInput::SizeBytes()\nsize_t ThreadVideo::SizeBytes() const\n{\n    return videoin[0]->SizeBytes();\n}\n\n\/\/! Implement VideoInput::Streams()\nconst std::vector<StreamInfo>& ThreadVideo::Streams() const\n{\n    return videoin[0]->Streams();\n}\n\nconst json::value& ThreadVideo::DeviceProperties() const\n{\n    VideoPropertiesInterface* in_prop = dynamic_cast<VideoPropertiesInterface*>(videoin[0]);\n    if(!in_prop)\n        throw std::runtime_error(\"ThreadVideo: video in interface does not implement VideoPropertiesInterface.\");\n    else\n        return in_prop->FrameProperties();\n}\n\nconst json::value& ThreadVideo::FrameProperties() const\n{\n    VideoPropertiesInterface* in_prop = dynamic_cast<VideoPropertiesInterface*>(videoin[0]);\n    if(!in_prop)\n        throw std::runtime_error(\"ThreadVideo: video in interface does not implement VideoPropertiesInterface.\");\n    else\n        return in_prop->FrameProperties();\n}\n\nunsigned int ThreadVideo::AvailableFrames() const\n{\n    return queue.AvailableFrames();\n}\n\nbool ThreadVideo::DropNFrames(uint32_t n)\n{\n    return queue.DropNFrames(n);\n}\n\n\/\/! Implement VideoInput::GrabNext()\nbool ThreadVideo::GrabNext( unsigned char* image, bool wait )\n{\n\n    if(queue.AvailableFrames() > 0) {\n        \/\/ At least one valid frame in queue, return it.\n        DBGPRINT(\"GrabNext at least one frame available.\");\n        unsigned char* i = queue.getNext();\n        std::memcpy(image, i, queue.BufferSizeBytes());\n        queue.returnUsedBuffer(i);\n        return true;\n    } else {\n        if(wait) {\n            \/\/ Must return a frame so block on notification from grab thread.\n            std::unique_lock<std::mutex> lk(cvMtx);\n            DBGPRINT(\"GrabNext no available frames wait for notification.\");\n            if(cv.wait_for(lk, boostd::chrono::seconds(5)) == boostd::cv_status::timeout)\n                throw std::runtime_error(\"ThreadVideo: GrabNext blocking read for frames reached timeout.\");\n            DBGPRINT(\"GrabNext got notification.\");\n            unsigned char* i = queue.getNext();\n            std::memcpy(image, i, queue.BufferSizeBytes());\n            queue.returnUsedBuffer(i);\n            return true;\n        } else {\n            DBGPRINT(\"GrabNext no available frames no wait.\");\n            \/\/ No frames available, no wait, simply return false.\n            return false;\n        }\n    }\n}\n\n\/\/! Implement VideoInput::GrabNewest()\nbool ThreadVideo::GrabNewest( unsigned char* image, bool wait )\n{\n    if(queue.AvailableFrames() > 0) {\n        \/\/ At least one valid frame in queue, call grabNewest to drop old frame and return the newest.\n        DBGPRINT(\"GrabNewest at least one frame available.\");\n        unsigned char* i = queue.getNewest();\n        std::memcpy(image, i, queue.BufferSizeBytes());\n        queue.returnUsedBuffer(i);\n        return true;\n    } else {\n        if(wait) {\n            \/\/ Must return a frame so block on notification from grab thread.\n            DBGPRINT(\"GrabNewest no available frames wait for notification.\");\n            std::unique_lock<std::mutex> lk(cvMtx);\n            if(cv.wait_for(lk, boostd::chrono::seconds(5)) == boostd::cv_status::timeout)\n                throw std::runtime_error(\"ThreadVideo: GrabNewest blocking read for frames reached timeout.\");\n            DBGPRINT(\"GrabNewest got notification.\");\n            unsigned char* i = queue.getNext();\n            std::memcpy(image, i, queue.BufferSizeBytes());\n            queue.returnUsedBuffer(i);\n            return true;\n        } else {\n            DBGPRINT(\"GrabNewest no available frames no wait.\");\n            \/\/ No frames available, no wait, simply return false.\n            return false;\n        }\n    }\n}\n\nvoid ThreadVideo::operator()()\n{\n    DBGPRINT(\"Grab thread Started.\")\n    \/\/ Spinning thread attempting to read from videoin[0] as fast as possible\n    \/\/ relying on the videoin[0] blocking grab.\n    while(!quit_grab_thread) {\n        \/\/ Get a buffer from the queue;\n        unsigned char* i = queue.getFreeBuffer();\n        \/\/ Blocking grab (i.e. GrabNext with wait = true).\n        if(videoin[0]->GrabNext(i, true)){\n            queue.addValidBuffer(i);\n            DBGPRINT(\"Grab thread got frame. valid:%d free:%d\",queue.AvailableFrames(),queue.EmptyBuffers())\n            \/\/ Let listening threads know we got a frame in case they are waiting.\n            cv.notify_all();\n        }\n        boostd::this_thread::yield();\n    }\n    DBGPRINT(\"Grab thread Stopped.\")\n\n    return;\n}\n\n}\n\n#undef TSTART\n#undef TGRABANDPRINT\n#undef DBGPRINT\n<commit_msg>Fix pointers leak.<commit_after>\/* This file is part of the Pangolin Project.\n * http:\/\/github.com\/stevenlovegrove\/Pangolin\n *\n * Copyright (c) 2014 Steven Lovegrove\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 <pangolin\/video\/drivers\/thread.h>\n\n#ifdef DEBUGTHREAD\n  #include <pangolin\/utils\/timer.h>\n  #define TSTART() pangolin::basetime start,last,now; start = pangolin::TimeNow(); last = start;\n  #define TGRABANDPRINT(...)  now = pangolin::TimeNow(); fprintf(stderr,\"THREAD: \"); fprintf(stderr, __VA_ARGS__); fprintf(stderr, \" %fms.\\n\",1000*pangolin::TimeDiff_s(last, now)); last = now;\n  #define DBGPRINT(...) fprintf(stderr,\"THREAD: \"); fprintf(stderr, __VA_ARGS__); fprintf(stderr,\"\\n\");\n#else\n  #define TSTART()\n  #define TGRABANDPRINT(...)\n  #define DBGPRINT(...)\n#endif\n\nnamespace pangolin\n{\n\nThreadVideo::ThreadVideo(VideoInterface* src, unsigned int num_buffers): quit_grab_thread(true), num_buffers(num_buffers)\n{\n    if(!src) {\n        throw VideoException(\"ThreadVideo: VideoInterface in must not be null\");\n    }\n    videoin.push_back(src);\n    \/\/ queue init allocates buffers.\n    queue.init(num_buffers, videoin[0]->SizeBytes());\n    Start();\n}\n\nThreadVideo::~ThreadVideo()\n{\n    Stop();\n    delete videoin[0];\n    \/\/ queue destructor will take care of deallocating buffers.\n}\n\n\/\/! Implement VideoInput::Start()\nvoid ThreadVideo::Start()\n{\n    videoin[0]->Start();\n    quit_grab_thread = false;\n    grab_thread = boostd::thread(boostd::ref(*this));\n}\n\n\/\/! Implement VideoInput::Stop()\nvoid ThreadVideo::Stop()\n{\n    quit_grab_thread = true;\n    if(grab_thread.joinable()) {\n        grab_thread.join();\n    }\n    videoin[0]->Stop();\n}\n\n\/\/! Implement VideoInput::SizeBytes()\nsize_t ThreadVideo::SizeBytes() const\n{\n    return videoin[0]->SizeBytes();\n}\n\n\/\/! Implement VideoInput::Streams()\nconst std::vector<StreamInfo>& ThreadVideo::Streams() const\n{\n    return videoin[0]->Streams();\n}\n\nconst json::value& ThreadVideo::DeviceProperties() const\n{\n    VideoPropertiesInterface* in_prop = dynamic_cast<VideoPropertiesInterface*>(videoin[0]);\n    if(!in_prop)\n        throw std::runtime_error(\"ThreadVideo: video in interface does not implement VideoPropertiesInterface.\");\n    else\n        return in_prop->FrameProperties();\n}\n\nconst json::value& ThreadVideo::FrameProperties() const\n{\n    VideoPropertiesInterface* in_prop = dynamic_cast<VideoPropertiesInterface*>(videoin[0]);\n    if(!in_prop)\n        throw std::runtime_error(\"ThreadVideo: video in interface does not implement VideoPropertiesInterface.\");\n    else\n        return in_prop->FrameProperties();\n}\n\nunsigned int ThreadVideo::AvailableFrames() const\n{\n    return queue.AvailableFrames();\n}\n\nbool ThreadVideo::DropNFrames(uint32_t n)\n{\n    return queue.DropNFrames(n);\n}\n\n\/\/! Implement VideoInput::GrabNext()\nbool ThreadVideo::GrabNext( unsigned char* image, bool wait )\n{\n\n    if(queue.AvailableFrames() > 0) {\n        \/\/ At least one valid frame in queue, return it.\n        DBGPRINT(\"GrabNext at least one frame available.\");\n        unsigned char* i = queue.getNext();\n        std::memcpy(image, i, queue.BufferSizeBytes());\n        queue.returnUsedBuffer(i);\n        return true;\n    } else {\n        if(wait) {\n            \/\/ Must return a frame so block on notification from grab thread.\n            std::unique_lock<std::mutex> lk(cvMtx);\n            DBGPRINT(\"GrabNext no available frames wait for notification.\");\n            if(cv.wait_for(lk, boostd::chrono::seconds(5)) == boostd::cv_status::timeout)\n                throw std::runtime_error(\"ThreadVideo: GrabNext blocking read for frames reached timeout.\");\n            DBGPRINT(\"GrabNext got notification.\");\n            unsigned char* i = queue.getNext();\n            std::memcpy(image, i, queue.BufferSizeBytes());\n            queue.returnUsedBuffer(i);\n            return true;\n        } else {\n            DBGPRINT(\"GrabNext no available frames no wait.\");\n            \/\/ No frames available, no wait, simply return false.\n            return false;\n        }\n    }\n}\n\n\/\/! Implement VideoInput::GrabNewest()\nbool ThreadVideo::GrabNewest( unsigned char* image, bool wait )\n{\n    if(queue.AvailableFrames() > 0) {\n        \/\/ At least one valid frame in queue, call grabNewest to drop old frame and return the newest.\n        DBGPRINT(\"GrabNewest at least one frame available.\");\n        unsigned char* i = queue.getNewest();\n        std::memcpy(image, i, queue.BufferSizeBytes());\n        queue.returnUsedBuffer(i);\n        return true;\n    } else {\n        if(wait) {\n            \/\/ Must return a frame so block on notification from grab thread.\n            DBGPRINT(\"GrabNewest no available frames wait for notification.\");\n            std::unique_lock<std::mutex> lk(cvMtx);\n            if(cv.wait_for(lk, boostd::chrono::seconds(5)) == boostd::cv_status::timeout)\n                throw std::runtime_error(\"ThreadVideo: GrabNewest blocking read for frames reached timeout.\");\n            DBGPRINT(\"GrabNewest got notification.\");\n            unsigned char* i = queue.getNext();\n            std::memcpy(image, i, queue.BufferSizeBytes());\n            queue.returnUsedBuffer(i);\n            return true;\n        } else {\n            DBGPRINT(\"GrabNewest no available frames no wait.\");\n            \/\/ No frames available, no wait, simply return false.\n            return false;\n        }\n    }\n}\n\nvoid ThreadVideo::operator()()\n{\n    DBGPRINT(\"Grab thread Started.\")\n    \/\/ Spinning thread attempting to read from videoin[0] as fast as possible\n    \/\/ relying on the videoin[0] blocking grab.\n    while(!quit_grab_thread) {\n        \/\/ Get a buffer from the queue;\n        unsigned char* i = queue.getFreeBuffer();\n        \/\/ Blocking grab (i.e. GrabNext with wait = true).\n        if(videoin[0]->GrabNext(i, true)){\n            queue.addValidBuffer(i);\n            DBGPRINT(\"Grab thread got frame. valid:%d free:%d\",queue.AvailableFrames(),queue.EmptyBuffers())\n            \/\/ Let listening threads know we got a frame in case they are waiting.\n            cv.notify_all();\n        } else {\n            \/\/ Grabbing frames failed, requeue the buffer.\n            queue.returnUsedBuffer(i);\n        }\n        boostd::this_thread::yield();\n    }\n    DBGPRINT(\"Grab thread Stopped.\")\n\n    return;\n}\n\n}\n\n#undef TSTART\n#undef TGRABANDPRINT\n#undef DBGPRINT\n<|endoftext|>"}
{"text":"<commit_before>#include <graphics\/pipeline\/commandbuffer.h>\r\n#include <core\/video\/context.h>\r\n\r\nnamespace fd {\r\nnamespace graphics {\r\nnamespace pipeline {\r\n\r\nusing namespace core::video;\r\nusing namespace utils;\r\n\r\nCommandBuffer::CommandBuffer(VkCommandPool pool, CommandBufferType type) : type(type) {\r\n\tVkCommandBufferAllocateInfo info;\r\n\r\n\tinfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_ALLOCATE_INFO;\r\n\tinfo.pNext = nullptr;\r\n\tinfo.level = (VkCommandBufferLevel)type;\r\n\tinfo.commandPool = pool;\r\n\tinfo.commandBufferCount = 1;\r\n\r\n\tVK(vkAllocateCommandBuffers(Context::GetDevice(), &info, &commandBuffer));\r\n\t\r\n}\r\n\r\nCommandBuffer::~CommandBuffer() {\r\n\r\n}\r\n\r\nvoid CommandBuffer::Begin(CommandBufferUsage usage) {\r\n\tVkCommandBufferBeginInfo info;\r\n\r\n\tinfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_BEGIN_INFO;\r\n\tinfo.pNext = nullptr;\r\n\tinfo.pInheritanceInfo = nullptr;\r\n\tinfo.flags = (VkCommandBufferUsageFlags)usage;\r\n\r\n\tVK(vkBeginCommandBuffer(commandBuffer, &info));\r\n}\r\n\r\nvoid CommandBuffer::End() {\r\n\tVK(vkEndCommandBuffer(commandBuffer));\r\n}\r\n\r\nVkClearColorValue clearColor = { 0.0f, 0.0f, 0.0f, 0.0f };\r\n\r\nvoid CommandBuffer::BeginRenderPass(const RenderPass* const renderPass, uint_t framebufferIndex) {\r\n\tVkRenderPassBeginInfo info;\r\n\r\n\tinfo.sType = VK_STRUCTURE_TYPE_RENDER_PASS_BEGIN_INFO;\r\n\tinfo.pNext = nullptr;\r\n\tinfo.renderArea.offset.x = 0;\r\n\tinfo.renderArea.offset.y = 0;\r\n\tinfo.renderArea.extent.width = renderPass->GetWidth();\r\n\tinfo.renderArea.extent.height = renderPass->GetHeight();\r\n\tinfo.renderPass = renderPass->GetRenderPass();\r\n\tinfo.framebuffer = renderPass->GetFramebuffer(framebufferIndex);\r\n\tinfo.clearValueCount = 1;\r\n\tinfo.pClearValues = (VkClearValue*)&clearColor;\r\n\t\r\n\tvkCmdBeginRenderPass(commandBuffer, &info, VK_SUBPASS_CONTENTS_INLINE);\r\n}\r\n\r\nvoid CommandBuffer::EndRenderPass() {\r\n\tvkCmdEndRenderPass(commandBuffer);\r\n}\r\n\r\nvoid CommandBuffer::BindPipeline(const Pipeline* const pipeline) {\r\n\tvkCmdBindPipeline(commandBuffer, VK_PIPELINE_BIND_POINT_GRAPHICS, pipeline->GetPipeline());\r\n}\r\n\r\nvoid CommandBuffer::BindPipelineLayout(const PipelineLayout* const pipelineLayout) {\r\n\tconst List<VkDescriptorSet>& sets = pipelineLayout->GetDescriptorSets();\r\n\r\n\tvkCmdBindDescriptorSets(commandBuffer, VK_PIPELINE_BIND_POINT_GRAPHICS, pipelineLayout->GetPipelineLayout(), 0, (uint32)sets.GetSize(), sets.GetData(), 0, 0);\r\n}\r\n\r\n\r\n}\r\n}\r\n}<commit_msg>Initialize clear colors in commandbuffer<commit_after>#include <graphics\/pipeline\/commandbuffer.h>\r\n#include <core\/video\/context.h>\r\n\r\nnamespace fd {\r\nnamespace graphics {\r\nnamespace pipeline {\r\n\r\nusing namespace core::video;\r\nusing namespace utils;\r\n\r\nCommandBuffer::CommandBuffer(VkCommandPool pool, CommandBufferType type) : type(type) {\r\n\tVkCommandBufferAllocateInfo info;\r\n\r\n\tinfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_ALLOCATE_INFO;\r\n\tinfo.pNext = nullptr;\r\n\tinfo.level = (VkCommandBufferLevel)type;\r\n\tinfo.commandPool = pool;\r\n\tinfo.commandBufferCount = 1;\r\n\r\n\tVK(vkAllocateCommandBuffers(Context::GetDevice(), &info, &commandBuffer));\r\n\t\r\n}\r\n\r\nCommandBuffer::~CommandBuffer() {\r\n\r\n}\r\n\r\nvoid CommandBuffer::Begin(CommandBufferUsage usage) {\r\n\tVkCommandBufferBeginInfo info;\r\n\r\n\tinfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_BEGIN_INFO;\r\n\tinfo.pNext = nullptr;\r\n\tinfo.pInheritanceInfo = nullptr;\r\n\tinfo.flags = (VkCommandBufferUsageFlags)usage;\r\n\r\n\tVK(vkBeginCommandBuffer(commandBuffer, &info));\r\n}\r\n\r\nvoid CommandBuffer::End() {\r\n\tVK(vkEndCommandBuffer(commandBuffer));\r\n}\r\n\r\nvoid CommandBuffer::BeginRenderPass(const RenderPass* const renderPass, uint_t framebufferIndex) {\r\n\tVkRenderPassBeginInfo info;\r\n\r\n\tinfo.sType = VK_STRUCTURE_TYPE_RENDER_PASS_BEGIN_INFO;\r\n\tinfo.pNext = nullptr;\r\n\tinfo.renderArea.offset.x = 0;\r\n\tinfo.renderArea.offset.y = 0;\r\n\tinfo.renderArea.extent.width = renderPass->GetWidth();\r\n\tinfo.renderArea.extent.height = renderPass->GetHeight();\r\n\tinfo.renderPass = renderPass->GetRenderPass();\r\n\tinfo.framebuffer = renderPass->GetFramebuffer(framebufferIndex);\r\n\t\r\n\trenderPass->InitializeRenderPass(&info);\r\n\t\r\n\tvkCmdBeginRenderPass(commandBuffer, &info, VK_SUBPASS_CONTENTS_INLINE);\r\n}\r\n\r\nvoid CommandBuffer::EndRenderPass() {\r\n\tvkCmdEndRenderPass(commandBuffer);\r\n}\r\n\r\nvoid CommandBuffer::BindPipeline(const Pipeline* const pipeline) {\r\n\tvkCmdBindPipeline(commandBuffer, VK_PIPELINE_BIND_POINT_GRAPHICS, pipeline->GetPipeline());\r\n}\r\n\r\nvoid CommandBuffer::BindPipelineLayout(const PipelineLayout* const pipelineLayout) {\r\n\tconst List<VkDescriptorSet>& sets = pipelineLayout->GetDescriptorSets();\r\n\r\n\tvkCmdBindDescriptorSets(commandBuffer, VK_PIPELINE_BIND_POINT_GRAPHICS, pipelineLayout->GetPipelineLayout(), 0, (uint32)sets.GetSize(), sets.GetData(), 0, 0);\r\n}\r\n\r\n\r\n}\r\n}\r\n}<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2018 Google Inc. 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\/\/ libevent based server implementation\n\n#include \"tensorflow_serving\/util\/net_http\/server\/internal\/evhttp_server.h\"\n\n#include <netinet\/in.h>\n#include <signal.h>\n#include <sys\/socket.h>\n\n#include <cstdint>\n#include <memory>\n#include <utility>\n\n#include \"absl\/base\/call_once.h\"\n#include \"absl\/memory\/memory.h\"\n#include \"libevent\/include\/event2\/event.h\"\n#include \"libevent\/include\/event2\/http.h\"\n#include \"libevent\/include\/event2\/thread.h\"\n#include \"libevent\/include\/event2\/util.h\"\n#include \"tensorflow_serving\/util\/net_http\/internal\/net_logging.h\"\n\nnamespace tensorflow {\nnamespace serving {\nnamespace net_http {\n\nnamespace {\n\nabsl::once_flag libevent_init_once;\n\nvoid InitLibEvent() {\n  if (evthread_use_pthreads() != 0) {\n    NET_LOG(FATAL, \"Server requires pthread support.\");\n  }\n  \/\/ Ignore SIGPIPE and allow errors to propagate through error codes.\n  signal(SIGPIPE, SIG_IGN);\n  \/\/ TODO(wenboz): windows support needed?\n}\n\nvoid GlobalInitialize() { absl::call_once(libevent_init_once, &InitLibEvent); }\n\n}  \/\/ namespace\n\nEvHTTPServer::EvHTTPServer(std::unique_ptr<ServerOptions> options)\n    : server_options_(std::move(options)), accepting_requests_() {}\n\n\/\/ May crash the server if called before WaitForTermination() returns\nEvHTTPServer::~EvHTTPServer() {\n  if (!is_terminating()) {\n    NET_LOG(ERROR, \"Serer has not been terminated. Force termination now.\");\n    Terminate();\n  }\n\n  if (ev_http_ != nullptr) {\n    \/\/ this frees the socket handlers too\n    evhttp_free(ev_http_);\n  }\n\n  if (ev_base_ != nullptr) {\n    event_base_free(ev_base_);\n  }\n}\n\n\/\/ Checks options.\n\/\/ TODO(wenboz): support multiple ports\nbool EvHTTPServer::Initialize() {\n  if (server_options_->executor() == nullptr) {\n    NET_LOG(FATAL, \"Default EventExecutor is not configured.\");\n    return false;\n  }\n\n  if (server_options_->ports().empty()) {\n    NET_LOG(FATAL, \"Server port is not specified.\");\n    return false;\n  }\n\n  GlobalInitialize();\n\n  \/\/ This ev_base_ created per-server v.s. global\n  ev_base_ = event_base_new();\n  if (ev_base_ == nullptr) {\n    NET_LOG(FATAL, \"Failed to create an event_base.\");\n    return false;\n  }\n\n  timeval tv_zero = {0, 0};\n  immediate_ = event_base_init_common_timeout(ev_base_, &tv_zero);\n\n  ev_http_ = evhttp_new(ev_base_);\n  if (ev_http_ == nullptr) {\n    NET_LOG(FATAL, \"Failed to create evhttp.\");\n    return false;\n  }\n\n  evhttp_set_gencb(ev_http_, &DispatchEvRequestFn, this);\n\n  return true;\n}\n\n\/\/ static function pointer\nvoid EvHTTPServer::DispatchEvRequestFn(evhttp_request* req, void* server) {\n  EvHTTPServer* http_server = static_cast<EvHTTPServer*>(server);\n  http_server->DispatchEvRequest(req);\n}\n\nvoid EvHTTPServer::DispatchEvRequest(evhttp_request* req) {\n  auto parsed_request = absl::make_unique<ParsedEvRequest>(req);\n\n  if (!parsed_request->decode()) {\n    evhttp_send_error(req, HTTP_BADREQUEST, nullptr);\n    return;\n  }\n\n  std::string path(parsed_request->path);\n\n  bool dispatched = false;\n  std::unique_ptr<EvHTTPRequest> ev_request(\n      new EvHTTPRequest(std::move(parsed_request), this));\n\n  if (!ev_request->Initialize()) {\n    evhttp_send_error(req, HTTP_SERVUNAVAIL, nullptr);\n    return;\n  }\n\n  {\n    absl::MutexLock l(&request_mu_);\n\n    auto handler_map_it = uri_handlers_.find(path);\n    if (handler_map_it != uri_handlers_.end()) {\n      ev_request->SetHandlerOptions(handler_map_it->second.options);\n      IncOps();\n      dispatched = true;\n      ScheduleHandlerReference(handler_map_it->second.handler,\n                               ev_request.release());\n    }\n\n    if (!dispatched) {\n      for (const auto& dispatcher : dispatchers_) {\n        auto handler = dispatcher.dispatcher(ev_request.get());\n        if (handler == nullptr) {\n          continue;\n        }\n        ev_request->SetHandlerOptions(dispatcher.options);\n        IncOps();\n        dispatched = true;\n        ScheduleHandler(std::move(handler), ev_request.release());\n        break;\n      }\n    }\n  }\n\n  if (!dispatched) {\n    evhttp_send_error(req, HTTP_NOTFOUND, nullptr);\n    return;\n  }\n}\n\nvoid EvHTTPServer::ScheduleHandlerReference(const RequestHandler& handler,\n                                            EvHTTPRequest* ev_request) {\n  server_options_->executor()->Schedule(\n      [&handler, ev_request]() { handler(ev_request); });\n}\n\n\/\/ Exactly one copy of the handler argument\n\/\/ with the lambda passed by value to Schedule()\nvoid EvHTTPServer::ScheduleHandler(RequestHandler&& handler,\n                                   EvHTTPRequest* ev_request) {\n  server_options_->executor()->Schedule(\n      [handler, ev_request]() { handler(ev_request); });\n}\n\nnamespace {\n\nvoid ResolveEphemeralPort(evhttp_bound_socket* listener, int* port) {\n  sockaddr_storage ss = {};\n  ev_socklen_t socklen = sizeof(ss);\n\n  evutil_socket_t fd = evhttp_bound_socket_get_fd(listener);\n  if (getsockname(fd, reinterpret_cast<sockaddr*>(&ss), &socklen)) {\n    NET_LOG(ERROR, \"getsockname() failed\");\n    return;\n  }\n\n  if (ss.ss_family == AF_INET) {\n    *port = ntohs((reinterpret_cast<sockaddr_in*>(&ss))->sin_port);\n  } else if (ss.ss_family == AF_INET6) {\n    *port = ntohs((reinterpret_cast<sockaddr_in6*>(&ss))->sin6_port);\n  } else {\n    NET_LOG(ERROR, \"Unknown address family %d\", ss.ss_family);\n  }\n}\n\n}  \/\/ namespace\n\nbool EvHTTPServer::StartAcceptingRequests() {\n  if (ev_http_ == nullptr) {\n    NET_LOG(FATAL, \"Server has not been successfully initialized\");\n    return false;\n  }\n\n  const int port = server_options_->ports().front();\n\n  \/\/ \"::\"  =>  in6addr_any\n  ev_uint16_t ev_port = static_cast<ev_uint16_t>(port);\n  ev_listener_ = evhttp_bind_socket_with_handle(ev_http_, \"::\", ev_port);\n  if (ev_listener_ == nullptr) {\n    \/\/ in case ipv6 is not supported, fallback to inaddr_any\n    ev_listener_ = evhttp_bind_socket_with_handle(ev_http_, nullptr, ev_port);\n    if (ev_listener_ == nullptr) {\n      NET_LOG(FATAL, \"Couldn't bind to port %d\", port);\n      return false;\n    }\n  }\n\n  \/\/ Listener counts as an active operation\n  IncOps();\n\n  port_ = port;\n  if (port_ == 0) {\n    ResolveEphemeralPort(ev_listener_, &port_);\n  }\n\n  IncOps();\n  server_options_->executor()->Schedule([this]() {\n    NET_LOG(INFO, \"Entering the event loop ...\");\n    int result = event_base_dispatch(ev_base_);\n    NET_LOG(INFO, \"event_base_dispatch() exits with value %d\", result);\n\n    DecOps();\n  });\n\n  accepting_requests_.Notify();\n\n  return true;\n}\n\nint EvHTTPServer::listen_port() const { return port_; }\n\nbool EvHTTPServer::is_accepting_requests() const {\n  return accepting_requests_.HasBeenNotified();\n}\n\nvoid EvHTTPServer::Terminate() {\n  if (!is_accepting_requests()) {\n    NET_LOG(ERROR, \"Server is not running ...\");\n    return;\n  }\n\n  if (is_terminating()) {\n    NET_LOG(ERROR, \"Server is already being terminated ...\");\n    return;\n  }\n\n  terminating_.Notify();\n\n  \/\/ call exit-loop from the event loop\n  this->EventLoopSchedule([this]() {\n    \/\/ Stop the listener first, which will delete ev_listener_\n    \/\/ This may cause the loop to exit, so need be scheduled from within\n    evhttp_del_accept_socket(ev_http_, ev_listener_);\n    DecOps();\n  });\n\n  \/\/ Current shut-down behavior:\n  \/\/ - we don't proactively delete\/close any HTTP connections as part of\n  \/\/   Terminate(). This is not an issue as we don't support read-streaming yet.\n  \/\/ - we don't wait for all dispatched requests to run to completion\n  \/\/   before we stop the event loop.\n  \/\/ - and otherwise, this is meant to be a clean shutdown\n}\n\nbool EvHTTPServer::is_terminating() const {\n  return terminating_.HasBeenNotified();\n}\n\nvoid EvHTTPServer::IncOps() {\n  absl::MutexLock l(&ops_mu_);\n  num_pending_ops_++;\n}\n\nvoid EvHTTPServer::DecOps() {\n  absl::MutexLock l(&ops_mu_);\n  num_pending_ops_--;\n}\n\nvoid EvHTTPServer::WaitForTermination() {\n  {\n    absl::MutexLock l(&ops_mu_);\n    ops_mu_.Await(absl::Condition(\n        +[](int64_t* count) { return *count <= 1; }, &num_pending_ops_));\n  }\n\n  int result = event_base_loopexit(ev_base_, nullptr);\n  NET_LOG(INFO, \"event_base_loopexit() exits with value %d\", result);\n\n  {\n    absl::MutexLock l(&ops_mu_);\n    ops_mu_.Await(absl::Condition(\n        +[](int64_t* count) { return *count == 0; }, &num_pending_ops_));\n  }\n}\n\nbool EvHTTPServer::WaitForTerminationWithTimeout(absl::Duration timeout) {\n  bool wait_result = true;\n\n  {\n    absl::MutexLock l(&ops_mu_);\n    wait_result = ops_mu_.AwaitWithTimeout(\n        absl::Condition(\n            +[](int64_t* count) { return *count <= 1; }, &num_pending_ops_),\n        timeout);\n  }\n\n  if (wait_result) {\n    int result = event_base_loopexit(ev_base_, nullptr);\n    NET_LOG(INFO, \"event_base_loopexit() exits with value %d\", result);\n\n    \/\/ This should pass immediately\n    {\n      absl::MutexLock l(&ops_mu_);\n      wait_result = ops_mu_.AwaitWithTimeout(\n          absl::Condition(\n              +[](int64_t* count) { return *count == 0; }, &num_pending_ops_),\n          timeout);\n    }\n  }\n\n  return wait_result;\n}\n\nEvHTTPServer::UriHandlerInfo::UriHandlerInfo(\n    absl::string_view uri_in, RequestHandler handler_in,\n    const RequestHandlerOptions& options_in)\n    : uri(uri_in.data(), uri_in.size()),\n      handler(std::move(handler_in)),\n      options(options_in) {}\n\nEvHTTPServer::DispatcherInfo::DispatcherInfo(\n    RequestDispatcher dispatcher_in, const RequestHandlerOptions& options_in)\n    : dispatcher(std::move(dispatcher_in)), options(options_in) {}\n\nvoid EvHTTPServer::RegisterRequestHandler(\n    absl::string_view uri, RequestHandler handler,\n    const RequestHandlerOptions& options) {\n  absl::MutexLock l(&request_mu_);\n  auto result = uri_handlers_.emplace(\n      std::piecewise_construct, std::forward_as_tuple(uri),\n      std::forward_as_tuple(uri, handler, options));\n\n  if (!result.second) {\n    NET_LOG(INFO,\n            \"Overwrite the existing handler registered under \"\n            \"the URI path %.*s\",\n            static_cast<int>(uri.size()), uri.data());\n\n    uri_handlers_.erase(result.first);\n    if (!uri_handlers_\n             .emplace(std::piecewise_construct, std::forward_as_tuple(uri),\n                      std::forward_as_tuple(uri, handler, options))\n             .second) {\n      NET_LOG(ERROR, \"Failed to register an handler under the URI path %.*s\",\n              static_cast<int>(uri.size()), uri.data());\n    }\n  }\n}\n\nvoid EvHTTPServer::RegisterRequestDispatcher(\n    RequestDispatcher dispatcher, const RequestHandlerOptions& options) {\n  absl::MutexLock l(&request_mu_);\n  dispatchers_.emplace_back(dispatcher, options);\n}\n\nnamespace {\n\nvoid EvImmediateCallback(evutil_socket_t socket, int16_t flags, void* arg) {\n  auto fn = static_cast<std::function<void()>*>(arg);\n  (*fn)();\n  delete fn;\n}\n\n}  \/\/ namespace\n\nbool EvHTTPServer::EventLoopSchedule(std::function<void()> fn) {\n  auto scheduled_fn = new std::function<void()>(std::move(fn));\n  int result = event_base_once(ev_base_, -1, EV_TIMEOUT, EvImmediateCallback,\n                               static_cast<void*>(scheduled_fn), immediate_);\n  return result == 0;\n}\n\n}  \/\/ namespace net_http\n}  \/\/ namespace serving\n}  \/\/ namespace tensorflow\n<commit_msg>Internal change.<commit_after>\/* Copyright 2018 Google Inc. 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\/\/ libevent based server implementation\n\n#include \"tensorflow_serving\/util\/net_http\/server\/internal\/evhttp_server.h\"\n\n#include <netinet\/in.h>\n#include <signal.h>\n#include <sys\/socket.h>\n\n#include <cstdint>\n#include <memory>\n#include <utility>\n\n#include \"absl\/base\/call_once.h\"\n#include \"absl\/memory\/memory.h\"\n#include \"libevent\/include\/event2\/event.h\"\n#include \"libevent\/include\/event2\/http.h\"\n#include \"libevent\/include\/event2\/thread.h\"\n#include \"libevent\/include\/event2\/util.h\"\n#include \"tensorflow_serving\/util\/net_http\/internal\/net_logging.h\"\n\nnamespace tensorflow {\nnamespace serving {\nnamespace net_http {\n\nnamespace {\n\nabsl::once_flag libevent_init_once;\n\nvoid InitLibEvent() {\n  if (evthread_use_pthreads() != 0) {\n    NET_LOG(FATAL, \"Server requires pthread support.\");\n  }\n  \/\/ Ignore SIGPIPE and allow errors to propagate through error codes.\n  signal(SIGPIPE, SIG_IGN);\n  \/\/ TODO(wenboz): windows support needed?\n}\n\nvoid GlobalInitialize() { absl::call_once(libevent_init_once, &InitLibEvent); }\n\n}  \/\/ namespace\n\nEvHTTPServer::EvHTTPServer(std::unique_ptr<ServerOptions> options)\n    : server_options_(std::move(options)), accepting_requests_() {}\n\n\/\/ May crash the server if called before WaitForTermination() returns\nEvHTTPServer::~EvHTTPServer() {\n  if (!is_terminating()) {\n    NET_LOG(ERROR, \"Serer has not been terminated. Force termination now.\");\n    Terminate();\n  }\n\n  if (ev_http_ != nullptr) {\n    \/\/ this frees the socket handlers too\n    evhttp_free(ev_http_);\n  }\n\n  if (ev_base_ != nullptr) {\n    event_base_free(ev_base_);\n  }\n}\n\n\/\/ Checks options.\n\/\/ TODO(wenboz): support multiple ports\nbool EvHTTPServer::Initialize() {\n  if (server_options_->executor() == nullptr) {\n    NET_LOG(FATAL, \"Default EventExecutor is not configured.\");\n    return false;\n  }\n\n  if (server_options_->ports().empty()) {\n    NET_LOG(FATAL, \"Server port is not specified.\");\n    return false;\n  }\n\n  GlobalInitialize();\n\n  \/\/ This ev_base_ created per-server v.s. global\n  ev_base_ = event_base_new();\n  if (ev_base_ == nullptr) {\n    NET_LOG(FATAL, \"Failed to create an event_base.\");\n    return false;\n  }\n\n  timeval tv_zero = {0, 0};\n  immediate_ = event_base_init_common_timeout(ev_base_, &tv_zero);\n\n  ev_http_ = evhttp_new(ev_base_);\n  if (ev_http_ == nullptr) {\n    NET_LOG(FATAL, \"Failed to create evhttp.\");\n    return false;\n  }\n\n  evhttp_set_gencb(ev_http_, &DispatchEvRequestFn, this);\n\n  return true;\n}\n\n\/\/ static function pointer\nvoid EvHTTPServer::DispatchEvRequestFn(evhttp_request* req, void* server) {\n  EvHTTPServer* http_server = static_cast<EvHTTPServer*>(server);\n  http_server->DispatchEvRequest(req);\n}\n\nvoid EvHTTPServer::DispatchEvRequest(evhttp_request* req) {\n  auto parsed_request = absl::make_unique<ParsedEvRequest>(req);\n\n  if (!parsed_request->decode()) {\n    evhttp_send_error(req, HTTP_BADREQUEST, nullptr);\n    return;\n  }\n\n  std::string path(parsed_request->path);\n\n  bool dispatched = false;\n  std::unique_ptr<EvHTTPRequest> ev_request(\n      new EvHTTPRequest(std::move(parsed_request), this));\n\n  if (!ev_request->Initialize()) {\n    evhttp_send_error(req, HTTP_SERVUNAVAIL, nullptr);\n    return;\n  }\n\n  {\n    absl::MutexLock l(&request_mu_);\n\n    auto handler_map_it = uri_handlers_.find(path);\n    if (handler_map_it != uri_handlers_.end()) {\n      ev_request->SetHandlerOptions(handler_map_it->second.options);\n      IncOps();\n      dispatched = true;\n      ScheduleHandlerReference(handler_map_it->second.handler,\n                               ev_request.release());\n    }\n\n    if (!dispatched) {\n      for (const auto& dispatcher : dispatchers_) {\n        auto handler = dispatcher.dispatcher(ev_request.get());\n        if (handler == nullptr) {\n          continue;\n        }\n        ev_request->SetHandlerOptions(dispatcher.options);\n        IncOps();\n        dispatched = true;\n        ScheduleHandler(std::move(handler), ev_request.release());\n        break;\n      }\n    }\n  }\n\n  if (!dispatched) {\n    evhttp_send_error(req, HTTP_NOTFOUND, nullptr);\n    return;\n  }\n}\n\nvoid EvHTTPServer::ScheduleHandlerReference(const RequestHandler& handler,\n                                            EvHTTPRequest* ev_request) {\n  server_options_->executor()->Schedule(\n      [&handler, ev_request]() { handler(ev_request); });\n}\n\n\/\/ Exactly one copy of the handler argument\n\/\/ with the lambda passed by value to Schedule()\nvoid EvHTTPServer::ScheduleHandler(RequestHandler&& handler,\n                                   EvHTTPRequest* ev_request) {\n  server_options_->executor()->Schedule(\n      [handler, ev_request]() { handler(ev_request); });\n}\n\nnamespace {\n\nvoid ResolveEphemeralPort(evhttp_bound_socket* listener, int* port) {\n  sockaddr_storage ss = {};\n  ev_socklen_t socklen = sizeof(ss);\n\n  evutil_socket_t fd = evhttp_bound_socket_get_fd(listener);\n  if (getsockname(fd, reinterpret_cast<sockaddr*>(&ss), &socklen)) {\n    NET_LOG(ERROR, \"getsockname() failed\");\n    return;\n  }\n\n  if (ss.ss_family == AF_INET) {\n    *port = ntohs((reinterpret_cast<sockaddr_in*>(&ss))->sin_port);\n  } else if (ss.ss_family == AF_INET6) {\n    *port = ntohs((reinterpret_cast<sockaddr_in6*>(&ss))->sin6_port);\n  } else {\n    NET_LOG(ERROR, \"Unknown address family %d\", ss.ss_family);\n  }\n}\n\n}  \/\/ namespace\n\nbool EvHTTPServer::StartAcceptingRequests() {\n  if (ev_http_ == nullptr) {\n    NET_LOG(FATAL, \"Server has not been successfully initialized\");\n    return false;\n  }\n\n  const int port = server_options_->ports().front();\n\n  \/\/ \"::\"  =>  in6addr_any\n  ev_uint16_t ev_port = static_cast<ev_uint16_t>(port);\n  ev_listener_ = evhttp_bind_socket_with_handle(ev_http_, \"::\", ev_port);\n  if (ev_listener_ == nullptr) {\n    \/\/ in case ipv6 is not supported, fallback to inaddr_any\n    ev_listener_ = evhttp_bind_socket_with_handle(ev_http_, nullptr, ev_port);\n    if (ev_listener_ == nullptr) {\n      NET_LOG(ERROR, \"Couldn't bind to port %d\", port);\n      return false;\n    }\n  }\n\n  \/\/ Listener counts as an active operation\n  IncOps();\n\n  port_ = port;\n  if (port_ == 0) {\n    ResolveEphemeralPort(ev_listener_, &port_);\n  }\n\n  IncOps();\n  server_options_->executor()->Schedule([this]() {\n    NET_LOG(INFO, \"Entering the event loop ...\");\n    int result = event_base_dispatch(ev_base_);\n    NET_LOG(INFO, \"event_base_dispatch() exits with value %d\", result);\n\n    DecOps();\n  });\n\n  accepting_requests_.Notify();\n\n  return true;\n}\n\nint EvHTTPServer::listen_port() const { return port_; }\n\nbool EvHTTPServer::is_accepting_requests() const {\n  return accepting_requests_.HasBeenNotified();\n}\n\nvoid EvHTTPServer::Terminate() {\n  if (!is_accepting_requests()) {\n    NET_LOG(ERROR, \"Server is not running ...\");\n    return;\n  }\n\n  if (is_terminating()) {\n    NET_LOG(ERROR, \"Server is already being terminated ...\");\n    return;\n  }\n\n  terminating_.Notify();\n\n  \/\/ call exit-loop from the event loop\n  this->EventLoopSchedule([this]() {\n    \/\/ Stop the listener first, which will delete ev_listener_\n    \/\/ This may cause the loop to exit, so need be scheduled from within\n    evhttp_del_accept_socket(ev_http_, ev_listener_);\n    DecOps();\n  });\n\n  \/\/ Current shut-down behavior:\n  \/\/ - we don't proactively delete\/close any HTTP connections as part of\n  \/\/   Terminate(). This is not an issue as we don't support read-streaming yet.\n  \/\/ - we don't wait for all dispatched requests to run to completion\n  \/\/   before we stop the event loop.\n  \/\/ - and otherwise, this is meant to be a clean shutdown\n}\n\nbool EvHTTPServer::is_terminating() const {\n  return terminating_.HasBeenNotified();\n}\n\nvoid EvHTTPServer::IncOps() {\n  absl::MutexLock l(&ops_mu_);\n  num_pending_ops_++;\n}\n\nvoid EvHTTPServer::DecOps() {\n  absl::MutexLock l(&ops_mu_);\n  num_pending_ops_--;\n}\n\nvoid EvHTTPServer::WaitForTermination() {\n  {\n    absl::MutexLock l(&ops_mu_);\n    ops_mu_.Await(absl::Condition(\n        +[](int64_t* count) { return *count <= 1; }, &num_pending_ops_));\n  }\n\n  int result = event_base_loopexit(ev_base_, nullptr);\n  NET_LOG(INFO, \"event_base_loopexit() exits with value %d\", result);\n\n  {\n    absl::MutexLock l(&ops_mu_);\n    ops_mu_.Await(absl::Condition(\n        +[](int64_t* count) { return *count == 0; }, &num_pending_ops_));\n  }\n}\n\nbool EvHTTPServer::WaitForTerminationWithTimeout(absl::Duration timeout) {\n  bool wait_result = true;\n\n  {\n    absl::MutexLock l(&ops_mu_);\n    wait_result = ops_mu_.AwaitWithTimeout(\n        absl::Condition(\n            +[](int64_t* count) { return *count <= 1; }, &num_pending_ops_),\n        timeout);\n  }\n\n  if (wait_result) {\n    int result = event_base_loopexit(ev_base_, nullptr);\n    NET_LOG(INFO, \"event_base_loopexit() exits with value %d\", result);\n\n    \/\/ This should pass immediately\n    {\n      absl::MutexLock l(&ops_mu_);\n      wait_result = ops_mu_.AwaitWithTimeout(\n          absl::Condition(\n              +[](int64_t* count) { return *count == 0; }, &num_pending_ops_),\n          timeout);\n    }\n  }\n\n  return wait_result;\n}\n\nEvHTTPServer::UriHandlerInfo::UriHandlerInfo(\n    absl::string_view uri_in, RequestHandler handler_in,\n    const RequestHandlerOptions& options_in)\n    : uri(uri_in.data(), uri_in.size()),\n      handler(std::move(handler_in)),\n      options(options_in) {}\n\nEvHTTPServer::DispatcherInfo::DispatcherInfo(\n    RequestDispatcher dispatcher_in, const RequestHandlerOptions& options_in)\n    : dispatcher(std::move(dispatcher_in)), options(options_in) {}\n\nvoid EvHTTPServer::RegisterRequestHandler(\n    absl::string_view uri, RequestHandler handler,\n    const RequestHandlerOptions& options) {\n  absl::MutexLock l(&request_mu_);\n  auto result = uri_handlers_.emplace(\n      std::piecewise_construct, std::forward_as_tuple(uri),\n      std::forward_as_tuple(uri, handler, options));\n\n  if (!result.second) {\n    NET_LOG(INFO,\n            \"Overwrite the existing handler registered under \"\n            \"the URI path %.*s\",\n            static_cast<int>(uri.size()), uri.data());\n\n    uri_handlers_.erase(result.first);\n    if (!uri_handlers_\n             .emplace(std::piecewise_construct, std::forward_as_tuple(uri),\n                      std::forward_as_tuple(uri, handler, options))\n             .second) {\n      NET_LOG(ERROR, \"Failed to register an handler under the URI path %.*s\",\n              static_cast<int>(uri.size()), uri.data());\n    }\n  }\n}\n\nvoid EvHTTPServer::RegisterRequestDispatcher(\n    RequestDispatcher dispatcher, const RequestHandlerOptions& options) {\n  absl::MutexLock l(&request_mu_);\n  dispatchers_.emplace_back(dispatcher, options);\n}\n\nnamespace {\n\nvoid EvImmediateCallback(evutil_socket_t socket, int16_t flags, void* arg) {\n  auto fn = static_cast<std::function<void()>*>(arg);\n  (*fn)();\n  delete fn;\n}\n\n}  \/\/ namespace\n\nbool EvHTTPServer::EventLoopSchedule(std::function<void()> fn) {\n  auto scheduled_fn = new std::function<void()>(std::move(fn));\n  int result = event_base_once(ev_base_, -1, EV_TIMEOUT, EvImmediateCallback,\n                               static_cast<void*>(scheduled_fn), immediate_);\n  return result == 0;\n}\n\n}  \/\/ namespace net_http\n}  \/\/ namespace serving\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\r\n *   Copyright (c) 2011 Jrgen Riegel (juergen.riegel@web.de)               *\r\n *   Copyright (c) 2015 Eivind Kvedalen (eivind@kvedalen.name)             *\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 <QFile>\r\n# include <QFileInfo>\r\n# include <QImage>\r\n# include <QString>\r\n# include <QMenu>\r\n#endif\r\n\r\n#include \"ViewProviderSpreadsheet.h\"\r\n#include \"SpreadsheetView.h\"\r\n\r\n#include <Mod\/Spreadsheet\/App\/Sheet.h>\r\n#include <App\/Document.h>\r\n#include <Gui\/BitmapFactory.h>\r\n#include <Gui\/Application.h>\r\n#include <Gui\/MainWindow.h>\r\n#include <Gui\/Command.h>\r\n#include <Base\/FileInfo.h>\r\n#include <Base\/Stream.h>\r\n#include <Base\/Console.h>\r\n#include <sstream>\r\n\r\nusing namespace Base;\r\nusing namespace Gui;\r\nusing namespace SpreadsheetGui;\r\nusing namespace Spreadsheet;\r\n\r\n\r\nPROPERTY_SOURCE(SpreadsheetGui::ViewProviderSheet, Gui::ViewProviderDocumentObject)\r\n\r\nViewProviderSheet::ViewProviderSheet()\r\n    : Gui::ViewProviderDocumentObject()\r\n{\r\n}\r\n\r\nViewProviderSheet::~ViewProviderSheet()\r\n{\r\n    if (!view.isNull()) {\r\n        Gui::getMainWindow()->removeWindow(view);\r\n\/\/        delete view;\r\n    }\r\n}\r\n\r\nvoid ViewProviderSheet::setDisplayMode(const char* ModeName)\r\n{\r\n    ViewProviderDocumentObject::setDisplayMode(ModeName);\r\n}\r\n\r\nstd::vector<std::string> ViewProviderSheet::getDisplayModes(void) const\r\n{\r\n    std::vector<std::string> StrList;\r\n    StrList.push_back(\"Spreadsheet\");\r\n    return StrList;\r\n}\r\n\r\nQIcon ViewProviderSheet::getIcon() const\r\n{\r\n    static const char * const Points_Feature_xpm[] = {\r\n        \"16 16 3 1\",\r\n        \"       c None\",\r\n        \".      c #000000\",\r\n        \"+      c #FFFFFF\",\r\n        \"                \",\r\n        \"                \",\r\n        \"................\",\r\n        \".++++.++++.++++.\",\r\n        \".++++.++++.++++.\",\r\n        \"................\",\r\n        \".++++.++++.++++.\",\r\n        \".++++.++++.++++.\",\r\n        \"................\",\r\n        \".++++.++++.++++.\",\r\n        \".++++.++++.++++.\",\r\n        \"................\",\r\n        \".++++.++++.++++.\",\r\n        \".++++.++++.++++.\",\r\n        \"................\",\r\n        \"                \"};\r\n    QPixmap px(Points_Feature_xpm);\r\n    return px;\r\n}\r\n\r\nbool ViewProviderSheet::setEdit(int ModNum)\r\n{\r\n    if (ModNum == ViewProvider::Default) {\r\n        if (!this->view) {\r\n            showSpreadsheetView();\r\n            view->viewAll();\r\n        }\r\n        Gui::getMainWindow()->setActiveWindow(this->view);\r\n        return true;\r\n    }\r\n    return false;\r\n}\r\n\r\nbool ViewProviderSheet::doubleClicked()\r\n{\r\n    if (!this->view) {\r\n        showSpreadsheetView();\r\n        view->viewAll();\r\n    }\r\n    Gui::getMainWindow()->setActiveWindow(this->view);\r\n    return true;\r\n}\r\n\r\nvoid ViewProviderSheet::setupContextMenu(QMenu * menu, QObject *receiver, const char *member)\r\n{\r\n    QAction* act;\r\n    act = menu->addAction(QObject::tr(\"Show spreadsheet\"), receiver, member);\r\n    act->setData(QVariant((int)ViewProvider::Default));\r\n}\r\n\r\nSheet *ViewProviderSheet::getSpreadsheetObject() const\r\n{\r\n    return freecad_dynamic_cast<Sheet>(pcObject);\r\n}\r\n\r\nbool ViewProviderSheet::onDelete(const std::vector<std::string> &)\r\n{\r\n    \/\/ If view is closed, delete the object\r\n    if (view.isNull())\r\n        return true;\r\n\r\n    \/\/ View is not closed, delete cell contents instead if it is active\r\n    if (Gui::Application::Instance->activeDocument()) {\r\n        Gui::MDIView* activeWindow = Gui::getMainWindow()->activeWindow();\r\n        SpreadsheetGui::SheetView * sheetView = freecad_dynamic_cast<SpreadsheetGui::SheetView>(activeWindow);\r\n\r\n        if (sheetView) {\r\n            Sheet * sheet = sheetView->getSheet();\r\n            QModelIndexList selection = sheetView->selectedIndexes();\r\n\r\n            if (selection.size() > 0) {\r\n                Gui::Command::openCommand(\"Clear cell(s)\");\r\n                for (QModelIndexList::const_iterator it = selection.begin(); it != selection.end(); ++it) {\r\n                    std::string address = CellAddress((*it).row(), (*it).column()).toString();\r\n                    Gui::Command::doCommand(Gui::Command::Doc,\"App.ActiveDocument.%s.clear('%s')\", sheet->getNameInDocument(),\r\n                                            address.c_str());\r\n                }\r\n                Gui::Command::commitCommand();\r\n                Gui::Command::doCommand(Gui::Command::Doc, \"App.ActiveDocument.recompute()\");\r\n            }\r\n        }\r\n    }\r\n\r\n    return false;\r\n}\r\n\r\nSheetView *ViewProviderSheet::showSpreadsheetView()\r\n{\r\n    if (!view){\r\n        Gui::Document* doc = Gui::Application::Instance->getDocument\r\n            (this->pcObject->getDocument());\r\n        view = new SheetView(doc, this->pcObject, Gui::getMainWindow());\r\n        view->setWindowIcon(Gui::BitmapFactory().pixmap(\":icons\/Spreadsheet.svg\"));\r\n        view->setWindowTitle(QString::fromUtf8(pcObject->Label.getValue()) + QString::fromAscii(\"[*]\"));\r\n        Gui::getMainWindow()->addWindow(view);\r\n        startEditing();\r\n    }\r\n\r\n    return view;\r\n}\r\n\r\nvoid ViewProviderSheet::updateData(const App::Property* prop)\r\n{\r\n    if (view)\r\n        view->updateCell(prop);\r\n}\r\n<commit_msg>+ do not set edit mode for spreadsheet<commit_after>\/***************************************************************************\r\n *   Copyright (c) 2011 Jrgen Riegel (juergen.riegel@web.de)               *\r\n *   Copyright (c) 2015 Eivind Kvedalen (eivind@kvedalen.name)             *\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 <QFile>\r\n# include <QFileInfo>\r\n# include <QImage>\r\n# include <QString>\r\n# include <QMenu>\r\n#endif\r\n\r\n#include \"ViewProviderSpreadsheet.h\"\r\n#include \"SpreadsheetView.h\"\r\n\r\n#include <Mod\/Spreadsheet\/App\/Sheet.h>\r\n#include <App\/Document.h>\r\n#include <Gui\/BitmapFactory.h>\r\n#include <Gui\/Application.h>\r\n#include <Gui\/MainWindow.h>\r\n#include <Gui\/Command.h>\r\n#include <Base\/FileInfo.h>\r\n#include <Base\/Stream.h>\r\n#include <Base\/Console.h>\r\n#include <sstream>\r\n\r\nusing namespace Base;\r\nusing namespace Gui;\r\nusing namespace SpreadsheetGui;\r\nusing namespace Spreadsheet;\r\n\r\n\r\nPROPERTY_SOURCE(SpreadsheetGui::ViewProviderSheet, Gui::ViewProviderDocumentObject)\r\n\r\nViewProviderSheet::ViewProviderSheet()\r\n    : Gui::ViewProviderDocumentObject()\r\n{\r\n}\r\n\r\nViewProviderSheet::~ViewProviderSheet()\r\n{\r\n    if (!view.isNull()) {\r\n        Gui::getMainWindow()->removeWindow(view);\r\n\/\/        delete view;\r\n    }\r\n}\r\n\r\nvoid ViewProviderSheet::setDisplayMode(const char* ModeName)\r\n{\r\n    ViewProviderDocumentObject::setDisplayMode(ModeName);\r\n}\r\n\r\nstd::vector<std::string> ViewProviderSheet::getDisplayModes(void) const\r\n{\r\n    std::vector<std::string> StrList;\r\n    StrList.push_back(\"Spreadsheet\");\r\n    return StrList;\r\n}\r\n\r\nQIcon ViewProviderSheet::getIcon() const\r\n{\r\n    static const char * const Points_Feature_xpm[] = {\r\n        \"16 16 3 1\",\r\n        \"       c None\",\r\n        \".      c #000000\",\r\n        \"+      c #FFFFFF\",\r\n        \"                \",\r\n        \"                \",\r\n        \"................\",\r\n        \".++++.++++.++++.\",\r\n        \".++++.++++.++++.\",\r\n        \"................\",\r\n        \".++++.++++.++++.\",\r\n        \".++++.++++.++++.\",\r\n        \"................\",\r\n        \".++++.++++.++++.\",\r\n        \".++++.++++.++++.\",\r\n        \"................\",\r\n        \".++++.++++.++++.\",\r\n        \".++++.++++.++++.\",\r\n        \"................\",\r\n        \"                \"};\r\n    QPixmap px(Points_Feature_xpm);\r\n    return px;\r\n}\r\n\r\nbool ViewProviderSheet::setEdit(int ModNum)\r\n{\r\n    if (ModNum == ViewProvider::Default) {\r\n        if (!this->view) {\r\n            showSpreadsheetView();\r\n            view->viewAll();\r\n        }\r\n        Gui::getMainWindow()->setActiveWindow(this->view);\r\n    }\r\n    return false;\r\n}\r\n\r\nbool ViewProviderSheet::doubleClicked()\r\n{\r\n    if (!this->view) {\r\n        showSpreadsheetView();\r\n        view->viewAll();\r\n    }\r\n    Gui::getMainWindow()->setActiveWindow(this->view);\r\n    return true;\r\n}\r\n\r\nvoid ViewProviderSheet::setupContextMenu(QMenu * menu, QObject *receiver, const char *member)\r\n{\r\n    QAction* act;\r\n    act = menu->addAction(QObject::tr(\"Show spreadsheet\"), receiver, member);\r\n    act->setData(QVariant((int)ViewProvider::Default));\r\n}\r\n\r\nSheet *ViewProviderSheet::getSpreadsheetObject() const\r\n{\r\n    return freecad_dynamic_cast<Sheet>(pcObject);\r\n}\r\n\r\nbool ViewProviderSheet::onDelete(const std::vector<std::string> &)\r\n{\r\n    \/\/ If view is closed, delete the object\r\n    if (view.isNull())\r\n        return true;\r\n\r\n    \/\/ View is not closed, delete cell contents instead if it is active\r\n    if (Gui::Application::Instance->activeDocument()) {\r\n        Gui::MDIView* activeWindow = Gui::getMainWindow()->activeWindow();\r\n        SpreadsheetGui::SheetView * sheetView = freecad_dynamic_cast<SpreadsheetGui::SheetView>(activeWindow);\r\n\r\n        if (sheetView) {\r\n            Sheet * sheet = sheetView->getSheet();\r\n            QModelIndexList selection = sheetView->selectedIndexes();\r\n\r\n            if (selection.size() > 0) {\r\n                Gui::Command::openCommand(\"Clear cell(s)\");\r\n                for (QModelIndexList::const_iterator it = selection.begin(); it != selection.end(); ++it) {\r\n                    std::string address = CellAddress((*it).row(), (*it).column()).toString();\r\n                    Gui::Command::doCommand(Gui::Command::Doc,\"App.ActiveDocument.%s.clear('%s')\", sheet->getNameInDocument(),\r\n                                            address.c_str());\r\n                }\r\n                Gui::Command::commitCommand();\r\n                Gui::Command::doCommand(Gui::Command::Doc, \"App.ActiveDocument.recompute()\");\r\n            }\r\n        }\r\n    }\r\n\r\n    return false;\r\n}\r\n\r\nSheetView *ViewProviderSheet::showSpreadsheetView()\r\n{\r\n    if (!view){\r\n        Gui::Document* doc = Gui::Application::Instance->getDocument\r\n            (this->pcObject->getDocument());\r\n        view = new SheetView(doc, this->pcObject, Gui::getMainWindow());\r\n        view->setWindowIcon(Gui::BitmapFactory().pixmap(\":icons\/Spreadsheet.svg\"));\r\n        view->setWindowTitle(QString::fromUtf8(pcObject->Label.getValue()) + QString::fromAscii(\"[*]\"));\r\n        Gui::getMainWindow()->addWindow(view);\r\n        startEditing();\r\n    }\r\n\r\n    return view;\r\n}\r\n\r\nvoid ViewProviderSheet::updateData(const App::Property* prop)\r\n{\r\n    if (view)\r\n        view->updateCell(prop);\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"vlc_video_source.h\"\n#include <cstdio>\n#include <cstdlib>\n#include <chrono>\n#include <thread>\n\nnamespace gg\n{\n\nVideoSourceVLC::VideoSourceVLC(const std::string path)\n    : _vlc_inst(nullptr)\n    , _vlc_mp(nullptr)\n    , _video_buffer(nullptr)\n    , _data_length(0)\n    , _cols(0)\n    , _rows(0)\n    , _sub(nullptr)\n    , _path(path)\n{\n    this->init_vlc();\n    this->run_vlc();\n}\n\n\nVideoSourceVLC::~VideoSourceVLC()\n{\n    stop_vlc();\n    release_vlc();\n}\n\n\nbool VideoSourceVLC::get_frame_dimensions(int & width, int & height)\n{\n    \/\/\/\\todo mutex\n\n    if(this->_cols == 0 || this->_rows == 0)\n        return false;\n\n    width = this->_cols;\n    height = this->_rows;\n    return true;\n}\n\n\nbool VideoSourceVLC::get_frame(VideoFrame_BGRA & frame)\n{\n    throw VideoSourceError(\"VLC video source supports only I420 colour space\");\n\n    \/\/ TODO\n\n    \/\/\/\\todo mutex\n\n    if (_cols == 0 || _rows == 0 || _video_buffer == nullptr)\n        return false;\n\n    \/\/ allocate and fill the image\n    if (_cols * _rows * 4 == this->_data_length)\n        frame = VideoFrame_BGRA(this->_video_buffer, this->_cols, this->_rows);\n    else\n        throw VideoSourceError(\"VLC video source does not support padded images\");\n\n    return true;\n}\n\n\nbool VideoSourceVLC::get_frame(VideoFrame_I420 & frame)\n{\n    if (_data_length > 0)\n    {\n        \/\/ TODO manage data?\n        frame = VideoFrame_I420(_video_buffer, _data_length, _cols, _rows, false);\n        return true;\n    }\n    else\n        return false;\n\n    \/\/ TODO #86\n}\n\n\ndouble VideoSourceVLC::get_frame_rate()\n{\n    \/\/return libvlc_media_player_get_rate( m_mp );\n    return libvlc_media_player_get_fps(_vlc_mp);\n    \/\/throw std::runtime_error(\"get_frame_rate to be implemented\");\n    \/\/return 0.0;\n}\n\n\nvoid VideoSourceVLC::set_sub_frame(int x, int y, int width, int height)\n{\n    \/\/ TODO mutex?\n\n    if (x >= _full.x and x + width <= _full.x + _full.width and\n        y >= _full.y and y + height <= _full.y + _full.height)\n    {\n        stop_vlc();\n        release_vlc();\n        if (_sub == nullptr) _sub = new FrameBox;\n        _sub->x = x;\n        _sub->y = y;\n        _sub->width = width;\n        _sub->height = height;\n        init_vlc();\n        run_vlc();\n    }\n}\n\n\nvoid VideoSourceVLC::get_full_frame()\n{\n    \/\/ TODO mutex?\n    stop_vlc();\n    release_vlc();\n    if (_sub)\n    {\n        delete _sub;\n        _sub = nullptr;\n    }\n    init_vlc();\n    run_vlc();\n}\n\n\nvoid VideoSourceVLC::init_vlc()\n{\n    \/\/ VLC pointers\n    libvlc_media_t * vlc_media = nullptr;\n\n    \/\/ VLC options\n    char smem_options[512];\n\n    sprintf(smem_options, \"#\");\n    if (_sub != nullptr)\n    {\n        unsigned int croptop = _sub->y,\n                     cropbottom = _full.height - (_sub->y + _sub->height),\n                     cropleft = _sub->x,\n                     cropright = _full.width - (_sub->x + _sub->width);\n        sprintf(smem_options,\n                \"%stranscode{vcodec=I420,vfilter=croppadd{\",\n                smem_options);\n        sprintf(smem_options,\n                \"%scroptop=%u,cropbottom=%u,cropleft=%u,cropright=%u}}:\",\n                smem_options,\n                croptop, cropbottom, cropleft, cropright);\n    }\n    sprintf(smem_options,\n            \"%ssmem{video-data=%lld,video-prerender-callback=%lld,video-postrender-callback=%lld}\",\n            smem_options,\n            (long long int)(intptr_t)(void*) this,\n            (long long int)(intptr_t)(void*) &VideoSourceVLC::prepareRender,\n            (long long int)(intptr_t)(void*) &VideoSourceVLC::handleStream );\n\n    const char * const vlc_args[] = {\n        \"-I\", \"dummy\", \/\/ Don't use any interface\n        \"--ignore-config\", \/\/ Don't use VLC's config\n        \"--extraintf=logger\", \/\/ Log anything\n        \/\/ TODO - what about the options below?\n        \/\/\"--verbose=2\", \/\/ Be much more verbose then normal for debugging purpose\n        \/\/\"--clock-jitter=0\",\n        \/\/\"--file-caching=150\",\n        \"--no-audio\",\n        \"--sout\", smem_options \/\/ Stream to memory\n    };\n\n    \/\/ We launch VLC\n    _vlc_inst = libvlc_new(sizeof(vlc_args) \/ sizeof(vlc_args[0]), vlc_args);\n    if (_vlc_inst == nullptr)\n        throw VideoSourceError(\"Could not create VLC engine\");\n\n    \/\/ If path contains a colon (:), it will be treated as a\n    \/\/ URL. Else, it will be considered as a local path.\n    if (_path.find(\":\") == std::string::npos)\n        vlc_media = libvlc_media_new_path(_vlc_inst, _path.c_str());\n    else\n        vlc_media = libvlc_media_new_location(_vlc_inst, _path.c_str());\n    if (vlc_media == nullptr)\n        throw VideoSourceError(std::string(\"Could not open \").append(_path));\n\n    libvlc_media_add_option(vlc_media, \":noaudio\");\n    libvlc_media_add_option(vlc_media, \":no-video-title-show\");\n\n    \/\/ Create a media player playing environement\n    _vlc_mp = libvlc_media_player_new_from_media(vlc_media);\n    if (_vlc_mp == nullptr)\n        throw VideoSourceError(\"Could create VLC media player\");\n\n    \/\/ No need to keep the media now\n    libvlc_media_release( vlc_media );\n}\n\n\nvoid VideoSourceVLC::run_vlc()\n{\n    \/\/ play the media_player\n    if (libvlc_media_player_play(_vlc_mp) != 0)\n        throw VideoSourceError(\"Could not start VLC media player\");\n\n    \/\/ empirically determined value that allows for initialisation\n    \/\/ to succeed before any API functions are called on this object\n    std::this_thread::sleep_for(std::chrono::milliseconds(350));\n    unsigned int width, height;\n    if (libvlc_video_get_size(_vlc_mp, 0, &width, &height) != 0)\n        throw VideoSourceError(\"Could not get video dimensions\");\n\n    _full.x = 0;\n    _full.y = 0;\n    _full.width = width;\n    _full.height = height;\n}\n\n\nvoid VideoSourceVLC::stop_vlc()\n{\n    if (libvlc_media_player_is_playing(_vlc_mp) == 1)\n        \/\/ stop playing\n        libvlc_media_player_stop(_vlc_mp);\n}\n\n\nvoid VideoSourceVLC::release_vlc()\n{\n    \/\/ free media player\n    if (_vlc_mp)\n        libvlc_media_player_release(_vlc_mp);\n\n    \/\/ free engine\n    if (_vlc_inst)\n        libvlc_release(_vlc_inst);\n\n    \/\/ free buffer\n    if (_video_buffer != nullptr)\n        delete[] _video_buffer;\n}\n\n\nvoid VideoSourceVLC::prepareRender(VideoSourceVLC * p_video_data,\n                                   uint8_t ** pp_pixel_buffer,\n                                   size_t size)\n{\n    \/\/\/\\todo create mutex guard\n\n    unsigned int width, height;\n    if (libvlc_video_get_size(p_video_data->_vlc_mp, 0, &width, &height) != 0)\n        return;\n    p_video_data->_cols = width;\n    p_video_data->_rows = height;\n\n    if (size > p_video_data->_data_length)\n        p_video_data->_video_buffer = reinterpret_cast<uint8_t *>(\n                    realloc(p_video_data->_video_buffer, size * sizeof(uint8_t))\n                    );\n    p_video_data->_data_length = size;\n\n    *pp_pixel_buffer = p_video_data->_video_buffer;\n}\n\n\nvoid VideoSourceVLC::handleStream(VideoSourceVLC * p_video_data,\n                                  uint8_t * p_pixel_buffer,\n                                  size_t cols,\n                                  size_t rows,\n                                  size_t colour_depth,\n                                  size_t size)\n{\n    \/\/ TODO: explain how data should be handled (see #86)\n    \/\/ TODO: Unlock the mutex\n}\n\n\nstd::string VideoSourceVLC::encode_psz_geometry(int x, int y, int width, int height)\n{\n    std::string psz_geometry;\n    psz_geometry.append(std::to_string(width)).append(\"x\")\n                .append(std::to_string(height))\n                .append(\"+\").append(std::to_string(x))\n                .append(\"+\").append(std::to_string(y));\n    return psz_geometry;\n}\n\n}\n<commit_msg>Issue #83: fixed error message when VLC media player cannot be created<commit_after>#include \"vlc_video_source.h\"\n#include <cstdio>\n#include <cstdlib>\n#include <chrono>\n#include <thread>\n\nnamespace gg\n{\n\nVideoSourceVLC::VideoSourceVLC(const std::string path)\n    : _vlc_inst(nullptr)\n    , _vlc_mp(nullptr)\n    , _video_buffer(nullptr)\n    , _data_length(0)\n    , _cols(0)\n    , _rows(0)\n    , _sub(nullptr)\n    , _path(path)\n{\n    this->init_vlc();\n    this->run_vlc();\n}\n\n\nVideoSourceVLC::~VideoSourceVLC()\n{\n    stop_vlc();\n    release_vlc();\n}\n\n\nbool VideoSourceVLC::get_frame_dimensions(int & width, int & height)\n{\n    \/\/\/\\todo mutex\n\n    if(this->_cols == 0 || this->_rows == 0)\n        return false;\n\n    width = this->_cols;\n    height = this->_rows;\n    return true;\n}\n\n\nbool VideoSourceVLC::get_frame(VideoFrame_BGRA & frame)\n{\n    throw VideoSourceError(\"VLC video source supports only I420 colour space\");\n\n    \/\/ TODO\n\n    \/\/\/\\todo mutex\n\n    if (_cols == 0 || _rows == 0 || _video_buffer == nullptr)\n        return false;\n\n    \/\/ allocate and fill the image\n    if (_cols * _rows * 4 == this->_data_length)\n        frame = VideoFrame_BGRA(this->_video_buffer, this->_cols, this->_rows);\n    else\n        throw VideoSourceError(\"VLC video source does not support padded images\");\n\n    return true;\n}\n\n\nbool VideoSourceVLC::get_frame(VideoFrame_I420 & frame)\n{\n    if (_data_length > 0)\n    {\n        \/\/ TODO manage data?\n        frame = VideoFrame_I420(_video_buffer, _data_length, _cols, _rows, false);\n        return true;\n    }\n    else\n        return false;\n\n    \/\/ TODO #86\n}\n\n\ndouble VideoSourceVLC::get_frame_rate()\n{\n    \/\/return libvlc_media_player_get_rate( m_mp );\n    return libvlc_media_player_get_fps(_vlc_mp);\n    \/\/throw std::runtime_error(\"get_frame_rate to be implemented\");\n    \/\/return 0.0;\n}\n\n\nvoid VideoSourceVLC::set_sub_frame(int x, int y, int width, int height)\n{\n    \/\/ TODO mutex?\n\n    if (x >= _full.x and x + width <= _full.x + _full.width and\n        y >= _full.y and y + height <= _full.y + _full.height)\n    {\n        stop_vlc();\n        release_vlc();\n        if (_sub == nullptr) _sub = new FrameBox;\n        _sub->x = x;\n        _sub->y = y;\n        _sub->width = width;\n        _sub->height = height;\n        init_vlc();\n        run_vlc();\n    }\n}\n\n\nvoid VideoSourceVLC::get_full_frame()\n{\n    \/\/ TODO mutex?\n    stop_vlc();\n    release_vlc();\n    if (_sub)\n    {\n        delete _sub;\n        _sub = nullptr;\n    }\n    init_vlc();\n    run_vlc();\n}\n\n\nvoid VideoSourceVLC::init_vlc()\n{\n    \/\/ VLC pointers\n    libvlc_media_t * vlc_media = nullptr;\n\n    \/\/ VLC options\n    char smem_options[512];\n\n    sprintf(smem_options, \"#\");\n    if (_sub != nullptr)\n    {\n        unsigned int croptop = _sub->y,\n                     cropbottom = _full.height - (_sub->y + _sub->height),\n                     cropleft = _sub->x,\n                     cropright = _full.width - (_sub->x + _sub->width);\n        sprintf(smem_options,\n                \"%stranscode{vcodec=I420,vfilter=croppadd{\",\n                smem_options);\n        sprintf(smem_options,\n                \"%scroptop=%u,cropbottom=%u,cropleft=%u,cropright=%u}}:\",\n                smem_options,\n                croptop, cropbottom, cropleft, cropright);\n    }\n    sprintf(smem_options,\n            \"%ssmem{video-data=%lld,video-prerender-callback=%lld,video-postrender-callback=%lld}\",\n            smem_options,\n            (long long int)(intptr_t)(void*) this,\n            (long long int)(intptr_t)(void*) &VideoSourceVLC::prepareRender,\n            (long long int)(intptr_t)(void*) &VideoSourceVLC::handleStream );\n\n    const char * const vlc_args[] = {\n        \"-I\", \"dummy\", \/\/ Don't use any interface\n        \"--ignore-config\", \/\/ Don't use VLC's config\n        \"--extraintf=logger\", \/\/ Log anything\n        \/\/ TODO - what about the options below?\n        \/\/\"--verbose=2\", \/\/ Be much more verbose then normal for debugging purpose\n        \/\/\"--clock-jitter=0\",\n        \/\/\"--file-caching=150\",\n        \"--no-audio\",\n        \"--sout\", smem_options \/\/ Stream to memory\n    };\n\n    \/\/ We launch VLC\n    _vlc_inst = libvlc_new(sizeof(vlc_args) \/ sizeof(vlc_args[0]), vlc_args);\n    if (_vlc_inst == nullptr)\n        throw VideoSourceError(\"Could not create VLC engine\");\n\n    \/\/ If path contains a colon (:), it will be treated as a\n    \/\/ URL. Else, it will be considered as a local path.\n    if (_path.find(\":\") == std::string::npos)\n        vlc_media = libvlc_media_new_path(_vlc_inst, _path.c_str());\n    else\n        vlc_media = libvlc_media_new_location(_vlc_inst, _path.c_str());\n    if (vlc_media == nullptr)\n        throw VideoSourceError(std::string(\"Could not open \").append(_path));\n\n    libvlc_media_add_option(vlc_media, \":noaudio\");\n    libvlc_media_add_option(vlc_media, \":no-video-title-show\");\n\n    \/\/ Create a media player playing environement\n    _vlc_mp = libvlc_media_player_new_from_media(vlc_media);\n    if (_vlc_mp == nullptr)\n        throw VideoSourceError(\"Could not create VLC media player\");\n\n    \/\/ No need to keep the media now\n    libvlc_media_release( vlc_media );\n}\n\n\nvoid VideoSourceVLC::run_vlc()\n{\n    \/\/ play the media_player\n    if (libvlc_media_player_play(_vlc_mp) != 0)\n        throw VideoSourceError(\"Could not start VLC media player\");\n\n    \/\/ empirically determined value that allows for initialisation\n    \/\/ to succeed before any API functions are called on this object\n    std::this_thread::sleep_for(std::chrono::milliseconds(350));\n    unsigned int width, height;\n    if (libvlc_video_get_size(_vlc_mp, 0, &width, &height) != 0)\n        throw VideoSourceError(\"Could not get video dimensions\");\n\n    _full.x = 0;\n    _full.y = 0;\n    _full.width = width;\n    _full.height = height;\n}\n\n\nvoid VideoSourceVLC::stop_vlc()\n{\n    if (libvlc_media_player_is_playing(_vlc_mp) == 1)\n        \/\/ stop playing\n        libvlc_media_player_stop(_vlc_mp);\n}\n\n\nvoid VideoSourceVLC::release_vlc()\n{\n    \/\/ free media player\n    if (_vlc_mp)\n        libvlc_media_player_release(_vlc_mp);\n\n    \/\/ free engine\n    if (_vlc_inst)\n        libvlc_release(_vlc_inst);\n\n    \/\/ free buffer\n    if (_video_buffer != nullptr)\n        delete[] _video_buffer;\n}\n\n\nvoid VideoSourceVLC::prepareRender(VideoSourceVLC * p_video_data,\n                                   uint8_t ** pp_pixel_buffer,\n                                   size_t size)\n{\n    \/\/\/\\todo create mutex guard\n\n    unsigned int width, height;\n    if (libvlc_video_get_size(p_video_data->_vlc_mp, 0, &width, &height) != 0)\n        return;\n    p_video_data->_cols = width;\n    p_video_data->_rows = height;\n\n    if (size > p_video_data->_data_length)\n        p_video_data->_video_buffer = reinterpret_cast<uint8_t *>(\n                    realloc(p_video_data->_video_buffer, size * sizeof(uint8_t))\n                    );\n    p_video_data->_data_length = size;\n\n    *pp_pixel_buffer = p_video_data->_video_buffer;\n}\n\n\nvoid VideoSourceVLC::handleStream(VideoSourceVLC * p_video_data,\n                                  uint8_t * p_pixel_buffer,\n                                  size_t cols,\n                                  size_t rows,\n                                  size_t colour_depth,\n                                  size_t size)\n{\n    \/\/ TODO: explain how data should be handled (see #86)\n    \/\/ TODO: Unlock the mutex\n}\n\n\nstd::string VideoSourceVLC::encode_psz_geometry(int x, int y, int width, int height)\n{\n    std::string psz_geometry;\n    psz_geometry.append(std::to_string(width)).append(\"x\")\n                .append(std::to_string(height))\n                .append(\"+\").append(std::to_string(x))\n                .append(\"+\").append(std::to_string(y));\n    return psz_geometry;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -------------------------------------------------------------------------- *\/\n\/* Copyright 2002-2015, OpenNebula Project (OpenNebula.org), C12G Labs        *\/\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 \"VirtualMachineHook.h\"\n#include \"VirtualMachine.h\"\n#include \"Nebula.h\"\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n\nvoid VirtualMachineStateHook::do_hook(void *arg)\n{\n\n    VirtualMachine * vm;\n    int              rc;\n\n    vm = static_cast<VirtualMachine *>(arg);\n\n    if ( vm == 0 )\n    {\n        return;\n    }\n\n    if ( vm->has_changed_state() && \n         vm->get_lcm_state() == lcm && \n         vm->get_state() == this->vm )\n    {\n        string  parsed_args = args;\n\n        parse_hook_arguments(vm, vm->get_prev_state(), vm->get_prev_lcm_state(),\n            parsed_args);\n\n        Nebula& ne        = Nebula::instance();\n        HookManager * hm  = ne.get_hm();\n\n        const HookManagerDriver * hmd = hm->get();\n\n        if ( hmd != 0 )\n        {\n            if ( ! remote )\n            {\n                hmd->execute(vm->get_oid(), name, cmd, parsed_args);\n            }\n            else if ( vm->hasHistory() )\n            {\n                hmd->execute(vm->get_oid(),\n                     name,\n                     vm->get_hostname(),\n                     cmd,\n                     parsed_args);\n            }\n        }\n    }\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n\nvoid VirtualMachineStateHook::parse_hook_arguments(PoolObjectSQL * obj,\n            VirtualMachine::VmState prev_dm, VirtualMachine::LcmState prev_lcm,\n            string& parsed)\n{\n    Hook::parse_hook_arguments(obj, parsed);\n\n    size_t  found;\n\n    found = parsed.find(\"$PREV_STATE\");\n\n    if ( found !=string::npos )\n    {\n        string str;\n\n        parsed.replace(found, 11, VirtualMachine::vm_state_to_str(str, prev_dm));\n    }\n\n    found = parsed.find(\"$PREV_LCM_STATE\");\n\n    if ( found != string::npos )\n    {\n        string str;\n\n        parsed.replace(found, 15, VirtualMachine::lcm_state_to_str(str, prev_lcm));\n    }\n}\n<commit_msg>Bug #3620: Remove unused var<commit_after>\/* -------------------------------------------------------------------------- *\/\n\/* Copyright 2002-2015, OpenNebula Project (OpenNebula.org), C12G Labs        *\/\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 \"VirtualMachineHook.h\"\n#include \"VirtualMachine.h\"\n#include \"Nebula.h\"\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n\nvoid VirtualMachineStateHook::do_hook(void *arg)\n{\n\n    VirtualMachine * vm;\n\n    vm = static_cast<VirtualMachine *>(arg);\n\n    if ( vm == 0 )\n    {\n        return;\n    }\n\n    if ( vm->has_changed_state() && \n         vm->get_lcm_state() == lcm && \n         vm->get_state() == this->vm )\n    {\n        string  parsed_args = args;\n\n        parse_hook_arguments(vm, vm->get_prev_state(), vm->get_prev_lcm_state(),\n            parsed_args);\n\n        Nebula& ne        = Nebula::instance();\n        HookManager * hm  = ne.get_hm();\n\n        const HookManagerDriver * hmd = hm->get();\n\n        if ( hmd != 0 )\n        {\n            if ( ! remote )\n            {\n                hmd->execute(vm->get_oid(), name, cmd, parsed_args);\n            }\n            else if ( vm->hasHistory() )\n            {\n                hmd->execute(vm->get_oid(),\n                     name,\n                     vm->get_hostname(),\n                     cmd,\n                     parsed_args);\n            }\n        }\n    }\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n\nvoid VirtualMachineStateHook::parse_hook_arguments(PoolObjectSQL * obj,\n            VirtualMachine::VmState prev_dm, VirtualMachine::LcmState prev_lcm,\n            string& parsed)\n{\n    Hook::parse_hook_arguments(obj, parsed);\n\n    size_t  found;\n\n    found = parsed.find(\"$PREV_STATE\");\n\n    if ( found !=string::npos )\n    {\n        string str;\n\n        parsed.replace(found, 11, VirtualMachine::vm_state_to_str(str, prev_dm));\n    }\n\n    found = parsed.find(\"$PREV_LCM_STATE\");\n\n    if ( found != string::npos )\n    {\n        string str;\n\n        parsed.replace(found, 15, VirtualMachine::lcm_state_to_str(str, prev_lcm));\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\/\/ includes  -------------------------------------------------------------------\n#include <swift2d\/graphics\/PostProcessor.hpp>\n\n#include <swift2d\/settings\/SettingsWrapper.hpp>\n#include <swift2d\/materials\/ShaderIncludes.hpp>\n#include <swift2d\/geometries\/Quad.hpp>\n#include <swift2d\/application\/Paths.hpp>\n#include <swift2d\/databases\/TextureDatabase.hpp>\n\nnamespace swift {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPostProcessor::PostProcessor(RenderContext const& ctx)\n  : post_fx_shader_()\n  , g_buffer_diffuse_(post_fx_shader_.get_uniform<int>(\"g_buffer_diffuse\"))\n  , g_buffer_normal_(post_fx_shader_.get_uniform<int>(\"g_buffer_normal\"))\n  , screen_size_(post_fx_shader_.get_uniform<math::vec2i>(\"screen_size\"))\n  , l_buffer_(post_fx_shader_.get_uniform<int>(\"l_buffer\"))\n  , glow_buffer_(post_fx_shader_.get_uniform<int>(\"glow_buffer\"))\n  , heat_buffer_(post_fx_shader_.get_uniform<int>(\"heat_buffer\"))\n  , dirt_tex_(post_fx_shader_.get_uniform<int>(\"dirt_tex\"))\n  , dirt_opacity_(post_fx_shader_.get_uniform<float>(\"dirt_opacity\"))\n  , use_heat_(post_fx_shader_.get_uniform<int>(\"use_heat\"))\n  , gamma_(post_fx_shader_.get_uniform<float>(\"gamma\"))\n  , vignette_color_(post_fx_shader_.get_uniform<math::vec4>(\"vignette_color\"))\n  , vignette_softness_(post_fx_shader_.get_uniform<float>(\"vignette_softness\"))\n  , vignette_coverage_(post_fx_shader_.get_uniform<float>(\"vignette_coverage\"))\n  , use_color_grading_(post_fx_shader_.get_uniform<int>(\"use_color_grading\"))\n  , color_grading_tex_(post_fx_shader_.get_uniform<int>(\"color_grading_tex\"))\n  , color_grading_intensity_(post_fx_shader_.get_uniform<float>(\"color_grading_intensity\"))\n  , lens_flare_effect_(ctx)\n  , heat_effect_(ctx)\n  , dirt_(Paths::get().resource(\"images\", \"dirt.jpg\"))\n {\n\n  std::string v_source(R\"(\n    \/\/ vertex shader -----------------------------------------------------------\n    @include \"fullscreen_quad_vertex_shader\"\n  )\");\n\n  std::stringstream f_source;\n  f_source << R\"(\n    \/\/ fragment shader ---------------------------------------------------------\n    @include \"version\"\n\n    in vec2 texcoords;\n    uniform ivec2 screen_size;\n    @include \"gbuffer_input\"\n\n    layout (location = 0) out vec3 fragColor;\n\n    \/\/ vignetting --------------------------------------------------------------\n    uniform vec4  vignette_color;\n    uniform float vignette_coverage;\n    uniform float vignette_softness;\n\n    vec3 apply_vignette(vec3 color_in) {\n      \/\/ inigo quilez's great vigneting effect!\n      float a = -vignette_coverage\/vignette_softness;\n      float b = 1.0\/vignette_softness;\n      vec2 q = texcoords;\n      float fac = clamp(a + b*pow( 16.0*q.x*q.y*(1.0-q.x)*(1.0-q.y), 0.1 ), 0, 1) * vignette_color.a + (1-vignette_color.a);\n\n      return mix(vignette_color.rgb, color_in, fac);\n    }\n\n    \/\/ color grading -----------------------------------------------------------\n    uniform sampler3D color_grading_tex;\n    uniform bool      use_color_grading;\n    uniform float     color_grading_intensity;\n\n    vec3 apply_color_grading(vec3 color_in) {\n      if (use_color_grading) {\n        return mix(color_in, texture(color_grading_tex, color_in).xyz, color_grading_intensity);\n      }\n      return color_in;\n    }\n\n    \/\/ gamma correction --------------------------------------------------------\n    uniform float gamma;\n\n    vec3 apply_gamma(vec3 color_in) {\n      return pow(color_in, 1.0\/vec3(gamma));\n    }\n  )\";\n\n  \/\/ if (ctx.light_sub_sampling) {\n  \/\/   f_source << R\"(\n  \/\/     \/\/ lbuffer sampling ------------------------------------------------------\n  \/\/     uniform sampler2D l_buffer;\n\n  \/\/     vec3 get_lighting(vec2 texcoords) {\n\n  \/\/       int level = 3;\n\n  \/\/       vec2 coords = gl_FragCoord.xy;\n  \/\/       vec2 light_coord_00 = (coords + vec2(-level, -level))\/screen_size;\n  \/\/       vec2 light_coord_01 = (coords + vec2(-level,  level))\/screen_size;\n  \/\/       vec2 light_coord_10 = (coords + vec2( level, -level))\/screen_size;\n  \/\/       vec2 light_coord_11 = (coords + vec2( level,  level))\/screen_size;\n\n  \/\/       vec3 normal    = get_normal(texcoords);\n  \/\/       vec3 normal_00 = get_normal(light_coord_00);\n  \/\/       vec3 normal_01 = get_normal(light_coord_01);\n  \/\/       vec3 normal_10 = get_normal(light_coord_10);\n  \/\/       vec3 normal_11 = get_normal(light_coord_11);\n\n  \/\/       float fac_00 = max(0, dot(normal, normal_00));\n  \/\/       float fac_01 = max(0, dot(normal, normal_01));\n  \/\/       float fac_10 = max(0, dot(normal, normal_10));\n  \/\/       float fac_11 = max(0, dot(normal, normal_11));\n\n  \/\/       vec2 lookup = light_coord_00 * fac_00 + light_coord_01 * fac_01 +\n  \/\/                     light_coord_10 * fac_10 + light_coord_11 * fac_11;\n\n  \/\/       lookup = lookup \/ (fac_00 + fac_01 + fac_10 + fac_11);\n\n  \/\/       vec4 light = texture2D(l_buffer, lookup*0.001 + texcoords);\n  \/\/       return light.rgb * texture2D(g_buffer_diffuse, texcoords).rgb + light.a * light.rgb;\n  \/\/     }\n  \/\/   )\";\n  \/\/ } else {\n    f_source << R\"(\n      \/\/ lbuffer sampling ------------------------------------------------------\n      uniform sampler2D l_buffer;\n\n      vec3 get_lighting(vec2 texcoords) {\n        vec4 light = texture2D(l_buffer, texcoords);\n        return light.rgb * texture2D(g_buffer_diffuse, texcoords).rgb + light.a * light.rgb;\n      }\n    )\";\n  \/\/ }\n\n  if (!ctx.dynamic_lighting) {\n    f_source << R\"(\n      vec3 get_color(vec2 texcoords) {\n        return get_diffuse(texcoords);\n      }\n    )\";\n  } else if (!ctx.lens_flares) {\n    f_source << R\"(\n      vec3 get_color(vec2 texcoords) {\n        return get_lighting(texcoords);\n      }\n    )\";\n  } else {\n    f_source << R\"(\n\n      uniform sampler2D glow_buffer;\n      uniform sampler2D heat_buffer;\n      uniform sampler2D dirt_tex;\n      uniform float     dirt_opacity;\n      uniform bool      use_heat;\n\n      vec3 get_color(vec2 texcoords) {\n\n        vec3 glow = texture2D(glow_buffer, texcoords).rgb;\n        vec3 dirt = texture2D(dirt_tex, texcoords).rgb;\n\n        vec2 shifted_texcoords = texcoords;\n        if (use_heat) {\n          vec2 offset = (texture2D(heat_buffer, texcoords).rg - 0.5) * 0.2;\n          shifted_texcoords   += offset;\n        }\n\n        vec3 output = get_lighting(shifted_texcoords);\n        output = output + glow * dirt * dirt_opacity;\n        return output;\n      }\n    )\";\n  }\n\n  f_source << R\"(\n    void main(void){\n      vec3 output = get_color(texcoords);\n      output = apply_color_grading(output);\n      output = apply_vignette(output);\n      output = apply_gamma(output);\n\n      fragColor = output;\n    }\n  )\";\n\n  post_fx_shader_.set_sources(v_source, f_source.str());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PostProcessor::process(ConstSerializedScenePtr const& scene, RenderContext const& ctx,\n                            GBuffer* g_buffer, LBuffer* l_buffer) {\n\n  auto use_postfx_shader = [&]() {\n    post_fx_shader_.use(ctx);\n    vignette_softness_.Set(scene->vignette_softness);\n    vignette_coverage_.Set(scene->vignette_coverage);\n    vignette_color_.Set(scene->vignette_color);\n\n    TexturePtr color_map;\n\n    if (scene->color_map_name != \"\") {\n      color_map = TextureDatabase::get().lookup(scene->color_map_name);\n    }\n\n    color_grading_tex_.Set(1);\n\n    if (color_map) {\n      color_map->bind(ctx, 1);\n      use_color_grading_.Set(1);\n      color_grading_intensity_.Set(scene->color_grading_intensity);\n    } else {\n      use_color_grading_.Set(0);\n      color_grading_intensity_.Set(0.f);\n    }\n  };\n\n  if (!ctx.dynamic_lighting) {\n\n    ctx.gl.Disable(oglplus::Capability::Blend);\n\n    SWIFT_PUSH_GL_RANGE(\"Composite\");\n\n    ctx.gl.Viewport(ctx.window_size.x(), ctx.window_size.y());\n    oglplus::DefaultFramebuffer().Bind(oglplus::Framebuffer::Target::Draw);\n\n    g_buffer->bind_diffuse(0);\n\n    use_postfx_shader();\n\n    g_buffer_diffuse_.Set(0);\n    gamma_.Set(SettingsWrapper::get().Settings->Gamma());\n    Quad::get().draw(ctx);\n\n    SWIFT_POP_GL_RANGE();\n\n    ctx.gl.Enable(oglplus::Capability::Blend);\n\n  } else {\n\n    if (ctx.heat_effect) {\n      SWIFT_PUSH_GL_RANGE(\"Heat\");\n      heat_effect_.process(scene, ctx);\n      SWIFT_POP_GL_RANGE();\n    }\n\n    ctx.gl.Disable(oglplus::Capability::Blend);\n\n    g_buffer->bind_diffuse(0);\n    g_buffer->bind_light(1);\n    g_buffer->bind_normal(2);\n    l_buffer->bind(3);\n\n    if (ctx.lens_flares) {\n      SWIFT_PUSH_GL_RANGE(\"Streaks\");\n      lens_flare_effect_.process(ctx);\n      SWIFT_POP_GL_RANGE();\n    }\n\n    SWIFT_PUSH_GL_RANGE(\"Composite\");\n    ctx.gl.Viewport(ctx.window_size.x(), ctx.window_size.y());\n    oglplus::DefaultFramebuffer().Bind(oglplus::Framebuffer::Target::Draw);\n\n    use_postfx_shader();\n\n    g_buffer_diffuse_.Set(0);\n\n    if (ctx.light_sub_sampling) {\n      \/\/ g_buffer_normal_.Set(2);\n      \/\/ screen_size_.Set(ctx.window_size);\n    }\n    l_buffer_.Set(3);\n    gamma_.Set(SettingsWrapper::get().Settings->Gamma());\n\n    if (ctx.lens_flares) {\n      int start(4);\n      lens_flare_effect_.bind_buffer(start, ctx);\n      glow_buffer_.Set(start);\n      ++start;\n\n      if (ctx.heat_effect) {\n        heat_buffer_.Set(start);\n        start = heat_effect_.bind_buffers(start, ctx);\n        use_heat_.Set(1);\n      } else {\n        use_heat_.Set(0);\n      }\n\n      dirt_.bind(ctx, start);\n      dirt_tex_.Set(start);\n      dirt_opacity_.Set(scene->dirt_opacity);\n    }\n\n    Quad::get().draw(ctx);\n\n    SWIFT_POP_GL_RANGE();\n\n    ctx.gl.Enable(oglplus::Capability::Blend);\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n<commit_msg>fixed wrong nvtools range<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                            \/\/\n\/\/ This file is part of Swift2D.                                              \/\/\n\/\/                                                                            \/\/\n\/\/ Copyright: (c) 2011-2014 Simon Schneegans & Felix Lauer                    \/\/\n\/\/                                                                            \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ includes  -------------------------------------------------------------------\n#include <swift2d\/graphics\/PostProcessor.hpp>\n\n#include <swift2d\/settings\/SettingsWrapper.hpp>\n#include <swift2d\/materials\/ShaderIncludes.hpp>\n#include <swift2d\/geometries\/Quad.hpp>\n#include <swift2d\/application\/Paths.hpp>\n#include <swift2d\/databases\/TextureDatabase.hpp>\n\nnamespace swift {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPostProcessor::PostProcessor(RenderContext const& ctx)\n  : post_fx_shader_()\n  , g_buffer_diffuse_(post_fx_shader_.get_uniform<int>(\"g_buffer_diffuse\"))\n  , g_buffer_normal_(post_fx_shader_.get_uniform<int>(\"g_buffer_normal\"))\n  , screen_size_(post_fx_shader_.get_uniform<math::vec2i>(\"screen_size\"))\n  , l_buffer_(post_fx_shader_.get_uniform<int>(\"l_buffer\"))\n  , glow_buffer_(post_fx_shader_.get_uniform<int>(\"glow_buffer\"))\n  , heat_buffer_(post_fx_shader_.get_uniform<int>(\"heat_buffer\"))\n  , dirt_tex_(post_fx_shader_.get_uniform<int>(\"dirt_tex\"))\n  , dirt_opacity_(post_fx_shader_.get_uniform<float>(\"dirt_opacity\"))\n  , use_heat_(post_fx_shader_.get_uniform<int>(\"use_heat\"))\n  , gamma_(post_fx_shader_.get_uniform<float>(\"gamma\"))\n  , vignette_color_(post_fx_shader_.get_uniform<math::vec4>(\"vignette_color\"))\n  , vignette_softness_(post_fx_shader_.get_uniform<float>(\"vignette_softness\"))\n  , vignette_coverage_(post_fx_shader_.get_uniform<float>(\"vignette_coverage\"))\n  , use_color_grading_(post_fx_shader_.get_uniform<int>(\"use_color_grading\"))\n  , color_grading_tex_(post_fx_shader_.get_uniform<int>(\"color_grading_tex\"))\n  , color_grading_intensity_(post_fx_shader_.get_uniform<float>(\"color_grading_intensity\"))\n  , lens_flare_effect_(ctx)\n  , heat_effect_(ctx)\n  , dirt_(Paths::get().resource(\"images\", \"dirt.jpg\"))\n {\n\n  std::string v_source(R\"(\n    \/\/ vertex shader -----------------------------------------------------------\n    @include \"fullscreen_quad_vertex_shader\"\n  )\");\n\n  std::stringstream f_source;\n  f_source << R\"(\n    \/\/ fragment shader ---------------------------------------------------------\n    @include \"version\"\n\n    in vec2 texcoords;\n    uniform ivec2 screen_size;\n    @include \"gbuffer_input\"\n\n    layout (location = 0) out vec3 fragColor;\n\n    \/\/ vignetting --------------------------------------------------------------\n    uniform vec4  vignette_color;\n    uniform float vignette_coverage;\n    uniform float vignette_softness;\n\n    vec3 apply_vignette(vec3 color_in) {\n      \/\/ inigo quilez's great vigneting effect!\n      float a = -vignette_coverage\/vignette_softness;\n      float b = 1.0\/vignette_softness;\n      vec2 q = texcoords;\n      float fac = clamp(a + b*pow( 16.0*q.x*q.y*(1.0-q.x)*(1.0-q.y), 0.1 ), 0, 1) * vignette_color.a + (1-vignette_color.a);\n\n      return mix(vignette_color.rgb, color_in, fac);\n    }\n\n    \/\/ color grading -----------------------------------------------------------\n    uniform sampler3D color_grading_tex;\n    uniform bool      use_color_grading;\n    uniform float     color_grading_intensity;\n\n    vec3 apply_color_grading(vec3 color_in) {\n      if (use_color_grading) {\n        return mix(color_in, texture(color_grading_tex, color_in).xyz, color_grading_intensity);\n      }\n      return color_in;\n    }\n\n    \/\/ gamma correction --------------------------------------------------------\n    uniform float gamma;\n\n    vec3 apply_gamma(vec3 color_in) {\n      return pow(color_in, 1.0\/vec3(gamma));\n    }\n  )\";\n\n  \/\/ if (ctx.light_sub_sampling) {\n  \/\/   f_source << R\"(\n  \/\/     \/\/ lbuffer sampling ------------------------------------------------------\n  \/\/     uniform sampler2D l_buffer;\n\n  \/\/     vec3 get_lighting(vec2 texcoords) {\n\n  \/\/       int level = 3;\n\n  \/\/       vec2 coords = gl_FragCoord.xy;\n  \/\/       vec2 light_coord_00 = (coords + vec2(-level, -level))\/screen_size;\n  \/\/       vec2 light_coord_01 = (coords + vec2(-level,  level))\/screen_size;\n  \/\/       vec2 light_coord_10 = (coords + vec2( level, -level))\/screen_size;\n  \/\/       vec2 light_coord_11 = (coords + vec2( level,  level))\/screen_size;\n\n  \/\/       vec3 normal    = get_normal(texcoords);\n  \/\/       vec3 normal_00 = get_normal(light_coord_00);\n  \/\/       vec3 normal_01 = get_normal(light_coord_01);\n  \/\/       vec3 normal_10 = get_normal(light_coord_10);\n  \/\/       vec3 normal_11 = get_normal(light_coord_11);\n\n  \/\/       float fac_00 = max(0, dot(normal, normal_00));\n  \/\/       float fac_01 = max(0, dot(normal, normal_01));\n  \/\/       float fac_10 = max(0, dot(normal, normal_10));\n  \/\/       float fac_11 = max(0, dot(normal, normal_11));\n\n  \/\/       vec2 lookup = light_coord_00 * fac_00 + light_coord_01 * fac_01 +\n  \/\/                     light_coord_10 * fac_10 + light_coord_11 * fac_11;\n\n  \/\/       lookup = lookup \/ (fac_00 + fac_01 + fac_10 + fac_11);\n\n  \/\/       vec4 light = texture2D(l_buffer, lookup*0.001 + texcoords);\n  \/\/       return light.rgb * texture2D(g_buffer_diffuse, texcoords).rgb + light.a * light.rgb;\n  \/\/     }\n  \/\/   )\";\n  \/\/ } else {\n    f_source << R\"(\n      \/\/ lbuffer sampling ------------------------------------------------------\n      uniform sampler2D l_buffer;\n\n      vec3 get_lighting(vec2 texcoords) {\n        vec4 light = texture2D(l_buffer, texcoords);\n        return light.rgb * texture2D(g_buffer_diffuse, texcoords).rgb + light.a * light.rgb;\n      }\n    )\";\n  \/\/ }\n\n  if (!ctx.dynamic_lighting) {\n    f_source << R\"(\n      vec3 get_color(vec2 texcoords) {\n        return get_diffuse(texcoords);\n      }\n    )\";\n  } else if (!ctx.lens_flares) {\n    f_source << R\"(\n      vec3 get_color(vec2 texcoords) {\n        return get_lighting(texcoords);\n      }\n    )\";\n  } else {\n    f_source << R\"(\n\n      uniform sampler2D glow_buffer;\n      uniform sampler2D heat_buffer;\n      uniform sampler2D dirt_tex;\n      uniform float     dirt_opacity;\n      uniform bool      use_heat;\n\n      vec3 get_color(vec2 texcoords) {\n        vec3 glow = texture2D(glow_buffer, texcoords).rgb;\n        vec3 dirt = texture2D(dirt_tex, texcoords).rgb;\n\n        vec2 shifted_texcoords = texcoords;\n        if (use_heat) {\n          vec2 offset = (texture2D(heat_buffer, texcoords).rg - 0.5) * 0.2;\n          shifted_texcoords   += offset;\n        }\n\n        vec3 output = get_lighting(shifted_texcoords);\n        return output + glow * dirt * dirt_opacity;\n      }\n    )\";\n  }\n\n  f_source << R\"(\n    void main(void){\n      vec3 output = get_color(texcoords);\n      output = apply_color_grading(output);\n      output = apply_vignette(output);\n      output = apply_gamma(output);\n\n      fragColor = output;\n    }\n  )\";\n\n  post_fx_shader_.set_sources(v_source, f_source.str());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PostProcessor::process(ConstSerializedScenePtr const& scene, RenderContext const& ctx,\n                            GBuffer* g_buffer, LBuffer* l_buffer) {\n\n  auto use_postfx_shader = [&]() {\n    post_fx_shader_.use(ctx);\n    vignette_softness_.Set(scene->vignette_softness);\n    vignette_coverage_.Set(scene->vignette_coverage);\n    vignette_color_.Set(scene->vignette_color);\n\n    TexturePtr color_map;\n\n    if (scene->color_map_name != \"\") {\n      color_map = TextureDatabase::get().lookup(scene->color_map_name);\n    }\n\n    color_grading_tex_.Set(1);\n\n    if (color_map) {\n      color_map->bind(ctx, 1);\n      use_color_grading_.Set(1);\n      color_grading_intensity_.Set(scene->color_grading_intensity);\n    } else {\n      use_color_grading_.Set(0);\n      color_grading_intensity_.Set(0.f);\n    }\n  };\n\n  if (!ctx.dynamic_lighting) {\n\n    ctx.gl.Disable(oglplus::Capability::Blend);\n\n    SWIFT_PUSH_GL_RANGE(\"Composite\");\n\n    ctx.gl.Viewport(ctx.window_size.x(), ctx.window_size.y());\n    oglplus::DefaultFramebuffer().Bind(oglplus::Framebuffer::Target::Draw);\n\n    g_buffer->bind_diffuse(0);\n\n    use_postfx_shader();\n\n    g_buffer_diffuse_.Set(0);\n    gamma_.Set(SettingsWrapper::get().Settings->Gamma());\n    Quad::get().draw(ctx);\n\n    SWIFT_POP_GL_RANGE();\n\n    ctx.gl.Enable(oglplus::Capability::Blend);\n\n  } else {\n\n    if (ctx.heat_effect) {\n      SWIFT_PUSH_GL_RANGE(\"Heat\");\n      heat_effect_.process(scene, ctx);\n      SWIFT_POP_GL_RANGE();\n    }\n\n    ctx.gl.Disable(oglplus::Capability::Blend);\n\n    g_buffer->bind_diffuse(0);\n    g_buffer->bind_light(1);\n    g_buffer->bind_normal(2);\n    l_buffer->bind(3);\n\n    if (ctx.lens_flares) {\n      SWIFT_PUSH_GL_RANGE(\"Lens Flares\");\n      lens_flare_effect_.process(ctx);\n      SWIFT_POP_GL_RANGE();\n    }\n\n    SWIFT_PUSH_GL_RANGE(\"Composite\");\n    ctx.gl.Viewport(ctx.window_size.x(), ctx.window_size.y());\n    oglplus::DefaultFramebuffer().Bind(oglplus::Framebuffer::Target::Draw);\n\n    use_postfx_shader();\n\n    g_buffer_diffuse_.Set(0);\n\n    if (ctx.light_sub_sampling) {\n      \/\/ g_buffer_normal_.Set(2);\n      \/\/ screen_size_.Set(ctx.window_size);\n    }\n    l_buffer_.Set(3);\n    gamma_.Set(SettingsWrapper::get().Settings->Gamma());\n\n    if (ctx.lens_flares) {\n      int start(4);\n      lens_flare_effect_.bind_buffer(start, ctx);\n      glow_buffer_.Set(start);\n      ++start;\n\n      if (ctx.heat_effect) {\n        heat_buffer_.Set(start);\n        start = heat_effect_.bind_buffers(start, ctx);\n        use_heat_.Set(1);\n      } else {\n        use_heat_.Set(0);\n      }\n\n      dirt_.bind(ctx, start);\n      dirt_tex_.Set(start);\n      dirt_opacity_.Set(scene->dirt_opacity);\n    }\n\n    Quad::get().draw(ctx);\n\n    SWIFT_POP_GL_RANGE();\n\n    ctx.gl.Enable(oglplus::Capability::Blend);\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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 2010      Thibaut Gridel <tgridel@free.fr>\n\/\/\n\n\n\/\/ Own\n#include \"GeoDataTreeModel.h\"\n\n\/\/ Qt\n#include <QtCore\/QModelIndex>\n#include <QtCore\/QFile>\n#include <QtGui\/QPixmap>\n\n\/\/ Marble\n#include \"GeoDataDocument.h\"\n#include \"GeoDataContainer.h\"\n#include \"GeoDataExtendedData.h\"\n#include \"GeoDataPlacemark.h\"\n#include \"GeoDataParser.h\"\n#include \"GeoDataStyle.h\"\n#include \"GeoDataTypes.h\"\n#include \"FileManager.h\"\n#include \"MarbleDebug.h\"\n#include \"MarblePlacemarkModel.h\"\n\nusing namespace Marble;\n\nclass GeoDataTreeModel::Private {\n public:\n    Private() : m_rootDocument( new GeoDataDocument ) {}\n    ~Private() { delete m_rootDocument; }\n\n    GeoDataDocument* m_rootDocument;\n    FileManager     *m_fileManager;\n};\n\nGeoDataTreeModel::GeoDataTreeModel( QObject *parent )\n    : QAbstractItemModel( parent ),\n    d( new Private )\n{\n}\n\nGeoDataTreeModel::~GeoDataTreeModel()\n{\n    delete d;\n}\n\nbool GeoDataTreeModel::hasChildren( const QModelIndex &parent ) const\n{\n    GeoDataObject *parentItem;\n    if ( parent.column() > 0 ) {\n        return false;\n    }\n\n    if ( !parent.isValid() ) {\n        parentItem = d->m_rootDocument;\n    } else {\n        parentItem = static_cast<GeoDataObject*>( parent.internalPointer() );\n    }\n\n    if ( !parentItem ) {\n        return false;\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n        GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( parentItem );\n        return dynamic_cast<GeoDataMultiGeometry*>( placemark->geometry() );\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataFolderType\n         || parentItem->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n        GeoDataContainer *container = static_cast<GeoDataContainer*>( parentItem );\n        return container->size();\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataMultiGeometryType ) {\n        GeoDataMultiGeometry *geometry = static_cast<GeoDataMultiGeometry*>( parentItem );\n        return geometry->size();\n    }\n\n    return false;\n}\n\nint GeoDataTreeModel::rowCount( const QModelIndex &parent ) const\n{\n\/\/    mDebug() << \"rowCount\";\n    GeoDataObject *parentItem;\n    if ( parent.column() > 0 ) {\n\/\/        mDebug() << \"rowCount bad column\";\n        return 0;\n    }\n\n    if ( !parent.isValid() ) {\n\/\/        mDebug() << \"rowCount root parent\";\n        parentItem = d->m_rootDocument;\n    } else {\n        parentItem = static_cast<GeoDataObject*>( parent.internalPointer() );\n    }\n\n    if ( !parentItem ) {\n\/\/        mDebug() << \"rowCount bad parent\";\n        return 0;\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataFolderType\n         || parentItem->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n        GeoDataContainer *container = static_cast<GeoDataContainer*>( parentItem );\n\/\/        mDebug() << \"rowCount \" << type << \"(\" << parentItem << \") =\" << container->size();\n        return container->size();\n\/\/    } else {\n\/\/        mDebug() << \"rowCount bad container \" << container;\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n        GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( parentItem );\n        if ( dynamic_cast<GeoDataMultiGeometry*>( placemark->geometry() ) ) {\n\/\/            mDebug() << \"rowCount \" << type << \"(\" << parentItem << \") = 1\";\n            return 1;\n        }\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataMultiGeometryType ) {\n        GeoDataMultiGeometry *geometry = static_cast<GeoDataMultiGeometry*>( parentItem );\n\/\/        mDebug() << \"rowCount \" << parent << \" \" << type << \" \" << geometry->size();\n        return geometry->size();\n\/\/    } else {\n\/\/        mDebug() << \"rowCount bad geometry \" << geometry;\n    }\n\n\/\/    mDebug() << \"rowcount end\";\n    return 0;\/\/parentItem->childCount();\n}\n\nQVariant GeoDataTreeModel::headerData(int section, Qt::Orientation orientation,\n                            int role) const\n{\n    if ( role == Qt::DisplayRole && orientation == Qt::Horizontal )\n    {\n        switch ( section ) {\n        case 0:\n            return QString(\"Name\");\n            break;\n        case 1:\n             return QString(\"Type\");\n             break;\n        case 2:\n            return QString(\"Popularity\");\n            break;\n        case 3:\n            return QString(\"PopIndex\");\n            break;\n        }\n    }\n    return QVariant();\n}\n\nQVariant GeoDataTreeModel::data( const QModelIndex &index, int role ) const\n{\n\/\/    mDebug() << \"data\";\n    if ( !index.isValid() )\n        return QVariant();\n\n    GeoDataObject *object = static_cast<GeoDataObject*>( index.internalPointer() );\n    if ( role == Qt::DisplayRole ) {\n\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( object );\n                if ( index.column() == 0 ){\n                    return QVariant( placemark->name() );\n                }\n                else if ( index.column() == 1 ){\n                    return QVariant( placemark->nodeType() );\n                }\n                else if ( index.column() == 2 ){\n                    return QVariant( placemark->popularity() );\n                }\n                else if ( index.column() == 3 ){\n                    return QVariant( placemark->popularityIndex() );\n                }\n        }\n        if ( object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            if ( index.column() == 0 ){\n                return QVariant( feature->name() );\n            }\n            else if ( index.column() == 1 ){\n                return QVariant( feature->nodeType() );\n            }\n        }\n\n        GeoDataGeometry *geometry = dynamic_cast<GeoDataGeometry*>( object );\n        if ( geometry && index.column() == 1 ){\n            return QVariant( geometry->nodeType() );\n        }\n\n        GeoDataObject *item = dynamic_cast<GeoDataObject*>( object );\n        if ( item && index.column() == 1 ){\n            return QVariant( item->nodeType() );\n        }\n\n    }\n    else if ( role == Qt::CheckStateRole\n              && index.column() == 0 ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *feature = static_cast<GeoDataPlacemark*>( object );\n            const char* type = feature->geometry()->nodeType();\n            if ( type == GeoDataTypes::GeoDataLineStringType\n                 || type == GeoDataTypes::GeoDataPolygonType\n                 || type == GeoDataTypes::GeoDataLinearRingType\n                 || type == GeoDataTypes::GeoDataMultiGeometryType\n                 ) {\n                if ( feature->isVisible() ) {\n                    return QVariant( Qt::Checked );\n                }\n                else {\n                    return QVariant( Qt::Unchecked );\n                }\n            }\n        }\n    }\n    else if ( role == Qt::DecorationRole\n              && index.column() == 0 ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n             || object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            return QVariant(feature->style()->iconStyle().icon());\n        }\n    } else if ( role == Qt::ToolTipRole\n              && index.column() == 0 ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n             || object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            return QVariant( feature->description() );\n        }\n    } else if ( role == MarblePlacemarkModel::ObjectPointerRole ) {\n        return qVariantFromValue( object );\n    } else if ( role == MarblePlacemarkModel::PopularityIndexRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( object );\n            return QVariant( placemark->popularityIndex() );\n        }\n    } else if ( role == MarblePlacemarkModel::PopularityRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( object );\n            return QVariant( placemark->popularity() );\n        }\n    } else if ( role == MarblePlacemarkModel::CoordinateRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( object );\n            return qVariantFromValue( placemark->coordinate() );\n        }\n    }\n\n    return QVariant();\n}\n\nQModelIndex GeoDataTreeModel::index( int row, int column, const QModelIndex &parent )             const\n{\n\/\/    mDebug() << \"index\";\n    if ( !hasIndex( row, column, parent ) ) {\n\/\/        mDebug() << \"index bad index\";\n        return QModelIndex();\n    }\n    \n    GeoDataObject *parentItem;\n    \n    if ( !parent.isValid() )\n        parentItem = d->m_rootDocument;\n    else\n        parentItem = static_cast<GeoDataObject*>( parent.internalPointer() );\n\n    if ( !parentItem ) {\n\/\/        mDebug() << \"index bad parent\";\n        return QModelIndex();\n    }\n\n    GeoDataObject *childItem = 0;\n\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataFolderType\n         || parentItem->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n        GeoDataContainer *container = static_cast<GeoDataContainer*>( parentItem );\n        childItem = container->child( row );\n        return createIndex( row, column, childItem );\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n        GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( parentItem );\n        childItem = placemark->geometry();\n        if ( dynamic_cast<GeoDataMultiGeometry*>( childItem ) ) {\n            return createIndex( row, column, childItem );\n        }\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataMultiGeometryType ) {\n        GeoDataMultiGeometry *geometry = static_cast<GeoDataMultiGeometry*>( parentItem );\n        childItem = geometry->child( row );\n        return createIndex( row, column, childItem );\n    }\n\n    return QModelIndex();\n}\n\nQModelIndex GeoDataTreeModel::parent( const QModelIndex &index ) const\n{\n\/\/    mDebug() << \"parent\";\n    if ( !index.isValid() ) {\n\/\/        mDebug() << \"parent bad index\";\n        return QModelIndex();\n    }\n\n\n    GeoDataObject *childObject = static_cast<GeoDataObject*>( index.internalPointer() );\n    if ( childObject ) {\n\n        \/\/\/ parentObject can be a container, placemark or multigeometry\n        GeoDataObject *parentObject = childObject->parent();\n        if ( parentObject == d->m_rootDocument )\n        {\n            return QModelIndex();\n        }\n\n        GeoDataObject *greatParentObject = parentObject->parent();\n\n        \/\/ greatParent can be a container\n        if ( greatParentObject->nodeType() == GeoDataTypes::GeoDataFolderType\n             || greatParentObject->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataContainer *greatparentContainer = static_cast<GeoDataContainer*>( greatParentObject );\n            GeoDataFeature *parentFeature = static_cast<GeoDataFeature*>( parentObject );\n\/\/            mDebug() << \"parent \" << childObject->nodeType() << \"(\" << childObject << \") = \"\n\/\/                    << parentObject->nodeType() << \"[\" << greatparentContainer->childPosition( parentFeature ) << \"](\" << parentObject << \")\";\n            return createIndex( greatparentContainer->childPosition( parentFeature ), 0, parentObject );\n        }\n\n        \/\/ greatParent can be a placemark\n        if ( greatParentObject->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n\/\/            GeoDataPlacemark *greatparentPlacemark = static_cast<GeoDataPlacemark*>( greatParentObject );\n\/\/                mDebug() << \"parent \" << childObject->nodeType() << \"(\" << childObject << \") = \"\n\/\/                        << parentObject->nodeType() << \"[0](\" << parentObject << \")\";\n            return createIndex( 0, 0, parentObject );\n        }\n\n        \/\/ greatParent can be a multigeometry\n        if ( greatParentObject->nodeType() == GeoDataTypes::GeoDataMultiGeometryType ) {\n            GeoDataMultiGeometry *greatparentMultiGeo = static_cast<GeoDataMultiGeometry*>( greatParentObject );\n            GeoDataGeometry *parentGeometry = static_cast<GeoDataGeometry*>( parentObject );\n\/\/                mDebug() << \"parent \" << childObject->nodeType() << \"(\" << childObject << \") = \"\n\/\/                        << parentObject->nodeType() << \"[\" << greatParentItem->childPosition( parentGeometry ) << \"](\" << parentObject << \")\";\n            return createIndex( greatparentMultiGeo->childPosition( parentGeometry ), 0, parentObject );\n        }\n\n    }\n\n\/\/    mDebug() << \"parent unknown index\";\n    return QModelIndex();\n}\n\nint GeoDataTreeModel::columnCount( const QModelIndex & ) const\n{\n    return 4;\n}\n\nbool GeoDataTreeModel::setData ( const QModelIndex & index, const QVariant & value, int role )\n{\n    if ( !index.isValid() )\n        return false;\n\n    GeoDataObject *object = static_cast<GeoDataObject*>( index.internalPointer() );\n    if ( role == Qt::CheckStateRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n             || object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            feature->setVisible( value.toBool() );\n            mDebug() << \"setData \" << feature->name() << \" \" << value.toBool();\n            emit dataChanged( index, index );\n            return true;\n        }\n    }\n\n    return false;\n}\n\nQt::ItemFlags GeoDataTreeModel::flags ( const QModelIndex & index ) const\n{\n    if ( !index.isValid() )\n        return Qt::NoItemFlags;\n\n    GeoDataObject *object = static_cast<GeoDataObject*>( index.internalPointer() );\n    if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n         || object->nodeType() == GeoDataTypes::GeoDataFolderType\n         || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n        return Qt::ItemIsEnabled | Qt::ItemIsSelectable | Qt::ItemIsUserCheckable;\n    }\n    return Qt::ItemIsEnabled | Qt::ItemIsSelectable;\n}\n\n\nvoid GeoDataTreeModel::setFileManager( FileManager *fileManager )\n{\n    disconnect( this, SLOT(addDocument(int)) );\n    disconnect( this, SLOT(removeDocument(int)) );\n    d->m_fileManager = fileManager;\n    connect( d->m_fileManager, SIGNAL( fileAdded(int)),\n             this,          SLOT(addDocument(int)) );\n    connect( d->m_fileManager, SIGNAL( fileRemoved(int)),\n             this,          SLOT(removeDocument(int)) );\n}\n\nvoid GeoDataTreeModel::addDocument( int index )\n{\n    GeoDataDocument *document = d->m_fileManager->at(index);\n    if (document)\n    {\n        beginResetModel();\n        d->m_rootDocument->append( document ) ;\n        endResetModel();\n    }\n}\n\nvoid GeoDataTreeModel::removeDocument( int index )\n{\n    beginResetModel();\n    d->m_rootDocument->remove( index );\n    endResetModel();\n}\n\nvoid GeoDataTreeModel::update()\n{\n\/\/    mDebug() << \"updating GeoDataTreeModel\";\n    reset();\n}\n\n#include \"GeoDataTreeModel.moc\"\n<commit_msg>Make feature name editable.<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 2010      Thibaut Gridel <tgridel@free.fr>\n\/\/\n\n\n\/\/ Own\n#include \"GeoDataTreeModel.h\"\n\n\/\/ Qt\n#include <QtCore\/QModelIndex>\n#include <QtCore\/QFile>\n#include <QtGui\/QPixmap>\n\n\/\/ Marble\n#include \"GeoDataDocument.h\"\n#include \"GeoDataContainer.h\"\n#include \"GeoDataExtendedData.h\"\n#include \"GeoDataPlacemark.h\"\n#include \"GeoDataParser.h\"\n#include \"GeoDataStyle.h\"\n#include \"GeoDataTypes.h\"\n#include \"FileManager.h\"\n#include \"MarbleDebug.h\"\n#include \"MarblePlacemarkModel.h\"\n\nusing namespace Marble;\n\nclass GeoDataTreeModel::Private {\n public:\n    Private() : m_rootDocument( new GeoDataDocument ) {}\n    ~Private() { delete m_rootDocument; }\n\n    GeoDataDocument* m_rootDocument;\n    FileManager     *m_fileManager;\n};\n\nGeoDataTreeModel::GeoDataTreeModel( QObject *parent )\n    : QAbstractItemModel( parent ),\n    d( new Private )\n{\n}\n\nGeoDataTreeModel::~GeoDataTreeModel()\n{\n    delete d;\n}\n\nbool GeoDataTreeModel::hasChildren( const QModelIndex &parent ) const\n{\n    GeoDataObject *parentItem;\n    if ( parent.column() > 0 ) {\n        return false;\n    }\n\n    if ( !parent.isValid() ) {\n        parentItem = d->m_rootDocument;\n    } else {\n        parentItem = static_cast<GeoDataObject*>( parent.internalPointer() );\n    }\n\n    if ( !parentItem ) {\n        return false;\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n        GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( parentItem );\n        return dynamic_cast<GeoDataMultiGeometry*>( placemark->geometry() );\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataFolderType\n         || parentItem->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n        GeoDataContainer *container = static_cast<GeoDataContainer*>( parentItem );\n        return container->size();\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataMultiGeometryType ) {\n        GeoDataMultiGeometry *geometry = static_cast<GeoDataMultiGeometry*>( parentItem );\n        return geometry->size();\n    }\n\n    return false;\n}\n\nint GeoDataTreeModel::rowCount( const QModelIndex &parent ) const\n{\n\/\/    mDebug() << \"rowCount\";\n    GeoDataObject *parentItem;\n    if ( parent.column() > 0 ) {\n\/\/        mDebug() << \"rowCount bad column\";\n        return 0;\n    }\n\n    if ( !parent.isValid() ) {\n\/\/        mDebug() << \"rowCount root parent\";\n        parentItem = d->m_rootDocument;\n    } else {\n        parentItem = static_cast<GeoDataObject*>( parent.internalPointer() );\n    }\n\n    if ( !parentItem ) {\n\/\/        mDebug() << \"rowCount bad parent\";\n        return 0;\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataFolderType\n         || parentItem->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n        GeoDataContainer *container = static_cast<GeoDataContainer*>( parentItem );\n\/\/        mDebug() << \"rowCount \" << type << \"(\" << parentItem << \") =\" << container->size();\n        return container->size();\n\/\/    } else {\n\/\/        mDebug() << \"rowCount bad container \" << container;\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n        GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( parentItem );\n        if ( dynamic_cast<GeoDataMultiGeometry*>( placemark->geometry() ) ) {\n\/\/            mDebug() << \"rowCount \" << type << \"(\" << parentItem << \") = 1\";\n            return 1;\n        }\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataMultiGeometryType ) {\n        GeoDataMultiGeometry *geometry = static_cast<GeoDataMultiGeometry*>( parentItem );\n\/\/        mDebug() << \"rowCount \" << parent << \" \" << type << \" \" << geometry->size();\n        return geometry->size();\n\/\/    } else {\n\/\/        mDebug() << \"rowCount bad geometry \" << geometry;\n    }\n\n\/\/    mDebug() << \"rowcount end\";\n    return 0;\/\/parentItem->childCount();\n}\n\nQVariant GeoDataTreeModel::headerData(int section, Qt::Orientation orientation,\n                            int role) const\n{\n    if ( role == Qt::DisplayRole && orientation == Qt::Horizontal )\n    {\n        switch ( section ) {\n        case 0:\n            return QString(\"Name\");\n            break;\n        case 1:\n             return QString(\"Type\");\n             break;\n        case 2:\n            return QString(\"Popularity\");\n            break;\n        case 3:\n            return QString(\"PopIndex\");\n            break;\n        }\n    }\n    return QVariant();\n}\n\nQVariant GeoDataTreeModel::data( const QModelIndex &index, int role ) const\n{\n\/\/    mDebug() << \"data\";\n    if ( !index.isValid() )\n        return QVariant();\n\n    GeoDataObject *object = static_cast<GeoDataObject*>( index.internalPointer() );\n    if ( role == Qt::DisplayRole ) {\n\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( object );\n                if ( index.column() == 0 ){\n                    return QVariant( placemark->name() );\n                }\n                else if ( index.column() == 1 ){\n                    return QVariant( placemark->nodeType() );\n                }\n                else if ( index.column() == 2 ){\n                    return QVariant( placemark->popularity() );\n                }\n                else if ( index.column() == 3 ){\n                    return QVariant( placemark->popularityIndex() );\n                }\n        }\n        if ( object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            if ( index.column() == 0 ){\n                return QVariant( feature->name() );\n            }\n            else if ( index.column() == 1 ){\n                return QVariant( feature->nodeType() );\n            }\n        }\n\n        GeoDataGeometry *geometry = dynamic_cast<GeoDataGeometry*>( object );\n        if ( geometry && index.column() == 1 ){\n            return QVariant( geometry->nodeType() );\n        }\n\n        GeoDataObject *item = dynamic_cast<GeoDataObject*>( object );\n        if ( item && index.column() == 1 ){\n            return QVariant( item->nodeType() );\n        }\n\n    }\n    else if ( role == Qt::CheckStateRole\n              && index.column() == 0 ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *feature = static_cast<GeoDataPlacemark*>( object );\n            const char* type = feature->geometry()->nodeType();\n            if ( type == GeoDataTypes::GeoDataLineStringType\n                 || type == GeoDataTypes::GeoDataPolygonType\n                 || type == GeoDataTypes::GeoDataLinearRingType\n                 || type == GeoDataTypes::GeoDataMultiGeometryType\n                 ) {\n                if ( feature->isVisible() ) {\n                    return QVariant( Qt::Checked );\n                }\n                else {\n                    return QVariant( Qt::Unchecked );\n                }\n            }\n        }\n    }\n    else if ( role == Qt::DecorationRole\n              && index.column() == 0 ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n             || object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            return QVariant(feature->style()->iconStyle().icon());\n        }\n    } else if ( role == Qt::ToolTipRole\n              && index.column() == 0 ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n             || object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            return QVariant( feature->description() );\n        }\n    } else if ( role == MarblePlacemarkModel::ObjectPointerRole ) {\n        return qVariantFromValue( object );\n    } else if ( role == MarblePlacemarkModel::PopularityIndexRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( object );\n            return QVariant( placemark->popularityIndex() );\n        }\n    } else if ( role == MarblePlacemarkModel::PopularityRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( object );\n            return QVariant( placemark->popularity() );\n        }\n    } else if ( role == MarblePlacemarkModel::CoordinateRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n            GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( object );\n            return qVariantFromValue( placemark->coordinate() );\n        }\n    }\n\n    return QVariant();\n}\n\nQModelIndex GeoDataTreeModel::index( int row, int column, const QModelIndex &parent )             const\n{\n\/\/    mDebug() << \"index\";\n    if ( !hasIndex( row, column, parent ) ) {\n\/\/        mDebug() << \"index bad index\";\n        return QModelIndex();\n    }\n    \n    GeoDataObject *parentItem;\n    \n    if ( !parent.isValid() )\n        parentItem = d->m_rootDocument;\n    else\n        parentItem = static_cast<GeoDataObject*>( parent.internalPointer() );\n\n    if ( !parentItem ) {\n\/\/        mDebug() << \"index bad parent\";\n        return QModelIndex();\n    }\n\n    GeoDataObject *childItem = 0;\n\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataFolderType\n         || parentItem->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n        GeoDataContainer *container = static_cast<GeoDataContainer*>( parentItem );\n        childItem = container->child( row );\n        return createIndex( row, column, childItem );\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n        GeoDataPlacemark *placemark = static_cast<GeoDataPlacemark*>( parentItem );\n        childItem = placemark->geometry();\n        if ( dynamic_cast<GeoDataMultiGeometry*>( childItem ) ) {\n            return createIndex( row, column, childItem );\n        }\n    }\n\n    if ( parentItem->nodeType() == GeoDataTypes::GeoDataMultiGeometryType ) {\n        GeoDataMultiGeometry *geometry = static_cast<GeoDataMultiGeometry*>( parentItem );\n        childItem = geometry->child( row );\n        return createIndex( row, column, childItem );\n    }\n\n    return QModelIndex();\n}\n\nQModelIndex GeoDataTreeModel::parent( const QModelIndex &index ) const\n{\n\/\/    mDebug() << \"parent\";\n    if ( !index.isValid() ) {\n\/\/        mDebug() << \"parent bad index\";\n        return QModelIndex();\n    }\n\n\n    GeoDataObject *childObject = static_cast<GeoDataObject*>( index.internalPointer() );\n    if ( childObject ) {\n\n        \/\/\/ parentObject can be a container, placemark or multigeometry\n        GeoDataObject *parentObject = childObject->parent();\n        if ( parentObject == d->m_rootDocument )\n        {\n            return QModelIndex();\n        }\n\n        GeoDataObject *greatParentObject = parentObject->parent();\n\n        \/\/ greatParent can be a container\n        if ( greatParentObject->nodeType() == GeoDataTypes::GeoDataFolderType\n             || greatParentObject->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataContainer *greatparentContainer = static_cast<GeoDataContainer*>( greatParentObject );\n            GeoDataFeature *parentFeature = static_cast<GeoDataFeature*>( parentObject );\n\/\/            mDebug() << \"parent \" << childObject->nodeType() << \"(\" << childObject << \") = \"\n\/\/                    << parentObject->nodeType() << \"[\" << greatparentContainer->childPosition( parentFeature ) << \"](\" << parentObject << \")\";\n            return createIndex( greatparentContainer->childPosition( parentFeature ), 0, parentObject );\n        }\n\n        \/\/ greatParent can be a placemark\n        if ( greatParentObject->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n\/\/            GeoDataPlacemark *greatparentPlacemark = static_cast<GeoDataPlacemark*>( greatParentObject );\n\/\/                mDebug() << \"parent \" << childObject->nodeType() << \"(\" << childObject << \") = \"\n\/\/                        << parentObject->nodeType() << \"[0](\" << parentObject << \")\";\n            return createIndex( 0, 0, parentObject );\n        }\n\n        \/\/ greatParent can be a multigeometry\n        if ( greatParentObject->nodeType() == GeoDataTypes::GeoDataMultiGeometryType ) {\n            GeoDataMultiGeometry *greatparentMultiGeo = static_cast<GeoDataMultiGeometry*>( greatParentObject );\n            GeoDataGeometry *parentGeometry = static_cast<GeoDataGeometry*>( parentObject );\n\/\/                mDebug() << \"parent \" << childObject->nodeType() << \"(\" << childObject << \") = \"\n\/\/                        << parentObject->nodeType() << \"[\" << greatParentItem->childPosition( parentGeometry ) << \"](\" << parentObject << \")\";\n            return createIndex( greatparentMultiGeo->childPosition( parentGeometry ), 0, parentObject );\n        }\n\n    }\n\n\/\/    mDebug() << \"parent unknown index\";\n    return QModelIndex();\n}\n\nint GeoDataTreeModel::columnCount( const QModelIndex & ) const\n{\n    return 4;\n}\n\nbool GeoDataTreeModel::setData ( const QModelIndex & index, const QVariant & value, int role )\n{\n    if ( !index.isValid() )\n        return false;\n\n    GeoDataObject *object = static_cast<GeoDataObject*>( index.internalPointer() );\n    if ( role == Qt::CheckStateRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n             || object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            feature->setVisible( value.toBool() );\n            mDebug() << \"setData \" << feature->name() << \" \" << value.toBool();\n            emit dataChanged( index, index );\n            return true;\n        }\n    } else if ( role == Qt::EditRole ) {\n        if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n             || object->nodeType() == GeoDataTypes::GeoDataFolderType\n             || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n            GeoDataFeature *feature = static_cast<GeoDataFeature*>( object );\n            feature->setName( value.toString() );\n            mDebug() << \"setData \" << feature->name() << \" \" << value.toString();\n            emit dataChanged( index, index );\n            return true;\n        }\n    }\n\n    return false;\n}\n\nQt::ItemFlags GeoDataTreeModel::flags ( const QModelIndex & index ) const\n{\n    if ( !index.isValid() )\n        return Qt::NoItemFlags;\n\n    GeoDataObject *object = static_cast<GeoDataObject*>( index.internalPointer() );\n    if ( object->nodeType() == GeoDataTypes::GeoDataPlacemarkType\n         || object->nodeType() == GeoDataTypes::GeoDataFolderType\n         || object->nodeType() == GeoDataTypes::GeoDataDocumentType ) {\n        return Qt::ItemIsEnabled | Qt::ItemIsSelectable | Qt::ItemIsUserCheckable | Qt::ItemIsEditable;\n    }\n    return Qt::ItemIsEnabled | Qt::ItemIsSelectable;\n}\n\n\nvoid GeoDataTreeModel::setFileManager( FileManager *fileManager )\n{\n    disconnect( this, SLOT(addDocument(int)) );\n    disconnect( this, SLOT(removeDocument(int)) );\n    d->m_fileManager = fileManager;\n    connect( d->m_fileManager, SIGNAL( fileAdded(int)),\n             this,          SLOT(addDocument(int)) );\n    connect( d->m_fileManager, SIGNAL( fileRemoved(int)),\n             this,          SLOT(removeDocument(int)) );\n}\n\nvoid GeoDataTreeModel::addDocument( int index )\n{\n    GeoDataDocument *document = d->m_fileManager->at(index);\n    if (document)\n    {\n        beginResetModel();\n        d->m_rootDocument->append( document ) ;\n        endResetModel();\n    }\n}\n\nvoid GeoDataTreeModel::removeDocument( int index )\n{\n    beginResetModel();\n    d->m_rootDocument->remove( index );\n    endResetModel();\n}\n\nvoid GeoDataTreeModel::update()\n{\n\/\/    mDebug() << \"updating GeoDataTreeModel\";\n    reset();\n}\n\n#include \"GeoDataTreeModel.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/* libwpd\n * Copyright (C) 2003 William Lachance (wrlach@gmail.com)\n * Copyright (C) 2003-2004 Marc Maurer (uwog@uwog.net)\n * Copyright (C) 2006 Fridrich Strba (fridrich.strba@bluewin.ch)\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 Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA\n *\n * For further information visit http:\/\/libwpd.sourceforge.net\n *\/\n\n\/* \"This product is not manufactured, approved, or supported by \n * Corel Corporation or Corel Corporation Limited.\"\n *\/\n\n#include \"WP1FileStructure.h\"\n\n\/\/ size of the function groups 0xC0 to 0xFE\n\/\/ -1 means the size is variable\nint WP1_FUNCTION_GROUP_SIZE[63] = \n{\n\t10,\t\/\/0xC0\n\t4,\n\t4,\t\n\t7,\t\n\t7,\t\n\t6,\t\n\t4,\t\n\t6,\t\n\t8,\t\n\t-1,\t\n\t3,\t\n\t6,\t\n\t6,\t\n\t3,\t\n\t6,\n\t3,\t\n\t6,\t\/\/ 0xD0\n\t-1,\t\n\t-1,\t\n\t4,\t\n\t4,\t\n\t4,\t\n\t6,\t\n\t-1,\t\n\t4,\t\n\t4,\t\n\t4,\t\n\t4,\t\n\t-1,\t\n\t24,\t\n\t6,\t\n\t-1,\t\n\t4,\t\/\/ 0xE0\n\t3,\t\n\t-1,\t\n\t150,\t\n\t6,\t\n\t23,\t\n\t11,\t\t\n\t3,\t\n\t3,\t\n\t-1,\t\n\t-1,\t\n\t32,\t\n\t5,\t\n\t-1,\t\n\t44,\t\n\t18,\t\n\t6,\t\/\/ 0xF0\n\t106,\t\n\t-1,\t\n\t196,\t\n\t4,\t\n\t-1,\t\n\t5,\t\n\t4,\n\t4,\n\t8,\t\/\/ 0xF9\n\t-1,\t\/\/ 0xFA\n\t4,\t\/\/ 0xFB\n\t-1,\t\/\/ 0xFC\n\t-1,\t\/\/ 0xFD\n\t-1\t\/\/ 0xFE\n};\n<commit_msg>0xCA looks like having size 4<commit_after>\/* libwpd\n * Copyright (C) 2003 William Lachance (wrlach@gmail.com)\n * Copyright (C) 2003-2004 Marc Maurer (uwog@uwog.net)\n * Copyright (C) 2006 Fridrich Strba (fridrich.strba@bluewin.ch)\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 Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA\n *\n * For further information visit http:\/\/libwpd.sourceforge.net\n *\/\n\n\/* \"This product is not manufactured, approved, or supported by \n * Corel Corporation or Corel Corporation Limited.\"\n *\/\n\n#include \"WP1FileStructure.h\"\n\n\/\/ size of the function groups 0xC0 to 0xFE\n\/\/ -1 means the size is variable\nint WP1_FUNCTION_GROUP_SIZE[63] = \n{\n\t10,\t\/\/0xC0\n\t4,\n\t4,\t\n\t7,\t\n\t7,\t\n\t6,\t\n\t4,\t\n\t6,\t\n\t8,\t\n\t-1,\t\n\t4,\t\n\t6,\t\n\t6,\t\n\t3,\t\n\t6,\n\t3,\t\n\t6,\t\/\/ 0xD0\n\t-1,\t\n\t-1,\t\n\t4,\t\n\t4,\t\n\t4,\t\n\t6,\t\n\t-1,\t\n\t4,\t\n\t4,\t\n\t4,\t\n\t4,\t\n\t-1,\t\n\t24,\t\n\t6,\t\n\t-1,\t\n\t4,\t\/\/ 0xE0\n\t3,\t\n\t-1,\t\n\t150,\t\n\t6,\t\n\t23,\t\n\t11,\t\t\n\t3,\t\n\t3,\t\n\t-1,\t\n\t-1,\t\n\t32,\t\n\t5,\t\n\t-1,\t\n\t44,\t\n\t18,\t\n\t6,\t\/\/ 0xF0\n\t106,\t\n\t-1,\t\n\t196,\t\n\t4,\t\n\t-1,\t\n\t5,\t\n\t4,\n\t4,\n\t8,\t\/\/ 0xF9\n\t-1,\t\/\/ 0xFA\n\t4,\t\/\/ 0xFB\n\t-1,\t\/\/ 0xFC\n\t-1,\t\/\/ 0xFD\n\t-1\t\/\/ 0xFE\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"recent_file_cache.h\"\n\n#include <cerrno>\n#include <chrono>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <memory>\n#include <queue>\n#include <sstream>\n#include <string>\n#include <sys\/stat.h>\n#include <unordered_map>\n#include <utility>\n\n#include \"..\/..\/helper\/common.h\"\n#include \"..\/..\/log.h\"\n\nusing std::chrono::minutes;\nusing std::chrono::steady_clock;\nusing std::chrono::time_point;\nusing std::endl;\nusing std::move;\nusing std::ostream;\nusing std::ostringstream;\nusing std::queue;\nusing std::shared_ptr;\nusing std::static_pointer_cast;\nusing std::string;\n\n\/\/ If the cache contains more than this many entries, any entries older than CACHE_AGEOFF will be purged.\nstatic const size_t CACHE_WATERMARK = 4096;\n\n\/\/ Entries older than this duration will be purged once the cache grows beyond CACHE_WATERMARK entries.\nstatic const minutes CACHE_AGEOFF = minutes(5);\n\nshared_ptr<StatResult> StatResult::at(string &&path, bool file_hint, bool directory_hint)\n{\n  struct stat path_stat\n  {};\n\n  if (lstat(path.c_str(), &path_stat) != 0) {\n    errno_t stat_errno = errno;\n\n    \/\/ Ignore lstat() errors on entries that:\n    \/\/ (a) we aren't allowed to see\n    \/\/ (b) are at paths with too many symlinks or looping symlinks\n    \/\/ (c) have names that are too long\n    \/\/ (d) have a path component that is (no longer) a directory\n    \/\/ Log any other errno that we see.\n    if (stat_errno != ENOENT && stat_errno != EACCES && stat_errno != ELOOP && stat_errno != ENAMETOOLONG\n      && stat_errno != ENOTDIR) {\n      LOGGER << \"lstat(\" << path << \") failed: \" << strerror(stat_errno) << \".\" << endl;\n    }\n\n    EntryKind guessed_kind = KIND_UNKNOWN;\n    if (file_hint && !directory_hint) guessed_kind = KIND_FILE;\n    if (!file_hint && directory_hint) guessed_kind = KIND_DIRECTORY;\n\n    return shared_ptr<StatResult>(new AbsentEntry(move(path), guessed_kind));\n  }\n\n  \/\/ Derive the entry kind from the lstat() results.\n  EntryKind entry_kind = KIND_UNKNOWN;\n  if ((path_stat.st_mode & S_IFREG) != 0) {\n    entry_kind = KIND_FILE;\n  }\n  if ((path_stat.st_mode & S_IFDIR) != 0) {\n    entry_kind = KIND_DIRECTORY;\n  }\n\n  return shared_ptr<StatResult>(new PresentEntry(move(path), entry_kind, path_stat.st_ino, path_stat.st_size));\n}\n\nbool StatResult::has_changed_from(const StatResult &other) const\n{\n  return entry_kind != other.entry_kind || path != other.path;\n}\n\nbool StatResult::could_be_rename_of(const StatResult &other) const\n{\n  return !kinds_are_different(entry_kind, other.entry_kind);\n}\n\nconst string &StatResult::get_path() const\n{\n  return path;\n}\n\nEntryKind StatResult::get_entry_kind() const\n{\n  return entry_kind;\n}\n\nostream &operator<<(ostream &out, const StatResult &result)\n{\n  out << result.to_string(true);\n  return out;\n}\n\nPresentEntry::PresentEntry(std::string &&path, EntryKind entry_kind, ino_t inode, off_t size) :\n  StatResult(move(path), entry_kind),\n  inode{inode},\n  size{size},\n  last_seen{steady_clock::now()}\n{\n  \/\/\n}\n\nbool PresentEntry::is_present() const\n{\n  return true;\n}\n\nbool PresentEntry::has_changed_from(const StatResult &other) const\n{\n  if (StatResult::has_changed_from(other)) return true;\n  if (other.is_absent()) return true;\n\n  const auto &casted = static_cast<const PresentEntry &>(other);  \/\/ NOLINT\n  return inode != casted.get_inode() || get_path() != casted.get_path();\n}\n\nbool PresentEntry::could_be_rename_of(const StatResult &other) const\n{\n  if (!StatResult::could_be_rename_of(other)) return false;\n  if (other.is_absent()) return false;\n\n  const auto &casted = static_cast<const PresentEntry &>(other);  \/\/ NOLINT\n  return inode == casted.get_inode();\n}\n\nino_t PresentEntry::get_inode() const\n{\n  return inode;\n}\n\noff_t PresentEntry::get_size() const\n{\n  return size;\n}\n\nconst time_point<steady_clock> &PresentEntry::get_last_seen() const\n{\n  return last_seen;\n}\n\nstring PresentEntry::to_string(bool verbose) const\n{\n  ostringstream result;\n\n  result << \"[present \" << get_entry_kind();\n  if (verbose) result << \" (\" << get_path() << \")\";\n  result << \" inode=\" << inode << \" size=\" << size << \"]\";\n\n  return result.str();\n}\n\nbool AbsentEntry::is_present() const\n{\n  return false;\n}\n\nbool AbsentEntry::has_changed_from(const StatResult &other) const\n{\n  if (StatResult::has_changed_from(other)) return true;\n  if (other.is_present()) return true;\n\n  return false;\n}\n\nbool AbsentEntry::could_be_rename_of(const StatResult &other) const\n{\n  if (!StatResult::could_be_rename_of(other)) return false;\n  if (other.is_present()) return false;\n\n  return true;\n}\n\nstring AbsentEntry::to_string(bool verbose) const\n{\n  ostringstream result;\n\n  result << \"[absent \" << get_entry_kind();\n  if (verbose) result << \" (\" << get_path() << \")\";\n  result << \"]\";\n\n  return result.str();\n}\n\nshared_ptr<StatResult> RecentFileCache::current_at_path(const string &path, bool file_hint, bool directory_hint)\n{\n  auto maybe_pending = pending.find(path);\n  if (maybe_pending != pending.end()) {\n    return maybe_pending->second;\n  }\n\n  shared_ptr<StatResult> stat_result = StatResult::at(string(path), file_hint, directory_hint);\n  if (stat_result->is_present()) {\n    pending.emplace(path, static_pointer_cast<PresentEntry>(stat_result));\n  }\n  return stat_result;\n}\n\nshared_ptr<StatResult> RecentFileCache::former_at_path(const string &path, bool file_hint, bool directory_hint)\n{\n  auto maybe = by_path.find(path);\n  if (maybe == by_path.end()) {\n    EntryKind kind = KIND_UNKNOWN;\n    if (file_hint && !directory_hint) kind = KIND_FILE;\n    if (!file_hint && directory_hint) kind = KIND_DIRECTORY;\n\n    return shared_ptr<StatResult>(new AbsentEntry(string(path), kind));\n  }\n\n  return maybe->second;\n}\n\nvoid RecentFileCache::evict(const string &path)\n{\n  auto maybe = by_path.find(path);\n  if (maybe != by_path.end()) {\n    shared_ptr<PresentEntry> existing = maybe->second;\n\n    auto range = by_timestamp.equal_range(existing->get_last_seen());\n    auto to_erase = by_timestamp.end();\n    for (auto it = range.first; it != range.second; ++it) {\n      if (it->second == existing) {\n        to_erase = it;\n      }\n    }\n    if (to_erase != by_timestamp.end()) {\n      by_timestamp.erase(to_erase);\n    }\n\n    by_path.erase(maybe);\n  }\n}\n\nvoid RecentFileCache::evict(const shared_ptr<PresentEntry> entry)\n{\n  auto maybe = by_path.find(entry->get_path());\n  if (maybe != by_path.end() && maybe->second == entry) {\n    evict(entry->get_path());\n  }\n}\n\nvoid RecentFileCache::apply()\n{\n  for (auto &pair : pending) {\n    shared_ptr<PresentEntry> &present = pair.second;\n\n    \/\/ Clear an existing entry at the same path if one exists\n    evict(present->get_path());\n\n    \/\/ Add the new PresentEntry\n    by_path.emplace(present->get_path(), present);\n    by_timestamp.emplace(present->get_last_seen(), present);\n  }\n  pending.clear();\n}\n\nvoid RecentFileCache::prune()\n{\n  if (by_path.size() <= CACHE_WATERMARK) {\n    return;\n  }\n\n  LOGGER << \"Cache currently contains \" << plural(by_path.size(), \"entry\", \"entries\") << \". Pruning triggered.\" << endl;\n\n  time_point<steady_clock> oldest = steady_clock::now() - CACHE_AGEOFF;\n\n  auto to_keep = by_timestamp.upper_bound(oldest);\n  size_t prune_count = 0;\n  for (auto it = by_timestamp.begin(); it != to_keep && it != by_timestamp.end(); ++it) {\n    shared_ptr<PresentEntry> entry = it->second;\n    by_path.erase(entry->get_path());\n\n    prune_count++;\n  }\n\n  if (to_keep != by_timestamp.begin()) {\n    by_timestamp.erase(by_timestamp.begin(), to_keep);\n  }\n\n  LOGGER << \"Pruned \" << plural(prune_count, \"entry\", \"entries\") << \". \" << plural(by_path.size(), \"entry\", \"entries\")\n         << \" remain.\" << endl;\n}\n\nvoid RecentFileCache::prepopulate(const string &root, size_t max)\n{\n  size_t count = 0;\n  size_t entries = 0;\n  queue<string> next_roots;\n  next_roots.push(root);\n\n  while (count < max && !next_roots.empty()) {\n    string current_root(next_roots.front());\n    next_roots.pop();\n\n    DIR *dir = opendir(current_root.c_str());\n    if (dir == nullptr) {\n      errno_t opendir_errno = errno;\n      LOGGER << \"Unable to open directory \" << root << \": \" << strerror(opendir_errno) << \".\" << endl;\n      LOGGER << \"Incompletely pre-populated cache with \" << entries << \" entries.\" << endl;\n      return;\n    }\n\n    errno = 0;\n    dirent *entry = readdir(dir);\n    while (entry != nullptr) {\n      string entry_name(entry->d_name, entry->d_namlen);\n\n      if (entry_name != \".\" && entry_name != \"..\") {\n        string entry_path(path_join(current_root, entry_name));\n\n        bool file_hint = (entry->d_type & DT_REG) == DT_REG;\n        bool dir_hint = (entry->d_type & DT_DIR) == DT_DIR;\n\n        shared_ptr<StatResult> r = current_at_path(entry_path, file_hint, dir_hint);\n        if (r->is_present()) {\n          entries++;\n          if (r->get_entry_kind() == KIND_DIRECTORY) next_roots.push(entry_path);\n        }\n\n        count++;\n        if (count >= max) {\n          LOGGER << \"Incompletely pre-populated cache with \" << entries << \" entries.\" << endl;\n          return;\n        }\n      }\n\n      errno = 0;\n      entry = readdir(dir);\n    }\n    errno_t readdir_errno = errno;\n    if (readdir_errno != 0) {\n      LOGGER << \"Unable to read directory entry within \" << root << \": \" << strerror(readdir_errno) << \".\" << endl;\n    }\n\n    if (closedir(dir) != 0) {\n      errno_t closedir_errno = errno;\n      LOGGER << \"Unable to close directory \" << root << \": \" << strerror(closedir_errno) << \".\" << endl;\n    }\n  }\n  apply();\n\n  LOGGER << \"Pre-populated cache with \" << entries << \" entries.\" << endl;\n}\n<commit_msg>Consider inode and entry kind in could_be_rename_of()<commit_after>#include \"recent_file_cache.h\"\n\n#include <cerrno>\n#include <chrono>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <memory>\n#include <queue>\n#include <sstream>\n#include <string>\n#include <sys\/stat.h>\n#include <unordered_map>\n#include <utility>\n\n#include \"..\/..\/helper\/common.h\"\n#include \"..\/..\/log.h\"\n\nusing std::chrono::minutes;\nusing std::chrono::steady_clock;\nusing std::chrono::time_point;\nusing std::endl;\nusing std::move;\nusing std::ostream;\nusing std::ostringstream;\nusing std::queue;\nusing std::shared_ptr;\nusing std::static_pointer_cast;\nusing std::string;\n\n\/\/ If the cache contains more than this many entries, any entries older than CACHE_AGEOFF will be purged.\nstatic const size_t CACHE_WATERMARK = 4096;\n\n\/\/ Entries older than this duration will be purged once the cache grows beyond CACHE_WATERMARK entries.\nstatic const minutes CACHE_AGEOFF = minutes(5);\n\nshared_ptr<StatResult> StatResult::at(string &&path, bool file_hint, bool directory_hint)\n{\n  struct stat path_stat\n  {};\n\n  if (lstat(path.c_str(), &path_stat) != 0) {\n    errno_t stat_errno = errno;\n\n    \/\/ Ignore lstat() errors on entries that:\n    \/\/ (a) we aren't allowed to see\n    \/\/ (b) are at paths with too many symlinks or looping symlinks\n    \/\/ (c) have names that are too long\n    \/\/ (d) have a path component that is (no longer) a directory\n    \/\/ Log any other errno that we see.\n    if (stat_errno != ENOENT && stat_errno != EACCES && stat_errno != ELOOP && stat_errno != ENAMETOOLONG\n      && stat_errno != ENOTDIR) {\n      LOGGER << \"lstat(\" << path << \") failed: \" << strerror(stat_errno) << \".\" << endl;\n    }\n\n    EntryKind guessed_kind = KIND_UNKNOWN;\n    if (file_hint && !directory_hint) guessed_kind = KIND_FILE;\n    if (!file_hint && directory_hint) guessed_kind = KIND_DIRECTORY;\n\n    return shared_ptr<StatResult>(new AbsentEntry(move(path), guessed_kind));\n  }\n\n  \/\/ Derive the entry kind from the lstat() results.\n  EntryKind entry_kind = KIND_UNKNOWN;\n  if ((path_stat.st_mode & S_IFREG) != 0) {\n    entry_kind = KIND_FILE;\n  }\n  if ((path_stat.st_mode & S_IFDIR) != 0) {\n    entry_kind = KIND_DIRECTORY;\n  }\n\n  return shared_ptr<StatResult>(new PresentEntry(move(path), entry_kind, path_stat.st_ino, path_stat.st_size));\n}\n\nbool StatResult::has_changed_from(const StatResult &other) const\n{\n  return entry_kind != other.entry_kind || path != other.path;\n}\n\nbool StatResult::could_be_rename_of(const StatResult &other) const\n{\n  return !kinds_are_different(entry_kind, other.entry_kind);\n}\n\nconst string &StatResult::get_path() const\n{\n  return path;\n}\n\nEntryKind StatResult::get_entry_kind() const\n{\n  return entry_kind;\n}\n\nostream &operator<<(ostream &out, const StatResult &result)\n{\n  out << result.to_string(true);\n  return out;\n}\n\nPresentEntry::PresentEntry(std::string &&path, EntryKind entry_kind, ino_t inode, off_t size) :\n  StatResult(move(path), entry_kind),\n  inode{inode},\n  size{size},\n  last_seen{steady_clock::now()}\n{\n  \/\/\n}\n\nbool PresentEntry::is_present() const\n{\n  return true;\n}\n\nbool PresentEntry::has_changed_from(const StatResult &other) const\n{\n  if (StatResult::has_changed_from(other)) return true;\n  if (other.is_absent()) return true;\n\n  const auto &casted = static_cast<const PresentEntry &>(other);  \/\/ NOLINT\n  return inode != casted.get_inode() || get_path() != casted.get_path();\n}\n\nbool PresentEntry::could_be_rename_of(const StatResult &other) const\n{\n  if (!StatResult::could_be_rename_of(other)) return false;\n  if (other.is_absent()) return false;\n\n  const auto &casted = static_cast<const PresentEntry &>(other);  \/\/ NOLINT\n  return inode == casted.get_inode() && !kinds_are_different(get_entry_kind(), casted.get_entry_kind());\n}\n\nino_t PresentEntry::get_inode() const\n{\n  return inode;\n}\n\noff_t PresentEntry::get_size() const\n{\n  return size;\n}\n\nconst time_point<steady_clock> &PresentEntry::get_last_seen() const\n{\n  return last_seen;\n}\n\nstring PresentEntry::to_string(bool verbose) const\n{\n  ostringstream result;\n\n  result << \"[present \" << get_entry_kind();\n  if (verbose) result << \" (\" << get_path() << \")\";\n  result << \" inode=\" << inode << \" size=\" << size << \"]\";\n\n  return result.str();\n}\n\nbool AbsentEntry::is_present() const\n{\n  return false;\n}\n\nbool AbsentEntry::has_changed_from(const StatResult &other) const\n{\n  if (StatResult::has_changed_from(other)) return true;\n  if (other.is_present()) return true;\n\n  return false;\n}\n\nbool AbsentEntry::could_be_rename_of(const StatResult &other) const\n{\n  if (!StatResult::could_be_rename_of(other)) return false;\n  if (other.is_present()) return false;\n\n  return true;\n}\n\nstring AbsentEntry::to_string(bool verbose) const\n{\n  ostringstream result;\n\n  result << \"[absent \" << get_entry_kind();\n  if (verbose) result << \" (\" << get_path() << \")\";\n  result << \"]\";\n\n  return result.str();\n}\n\nshared_ptr<StatResult> RecentFileCache::current_at_path(const string &path, bool file_hint, bool directory_hint)\n{\n  auto maybe_pending = pending.find(path);\n  if (maybe_pending != pending.end()) {\n    return maybe_pending->second;\n  }\n\n  shared_ptr<StatResult> stat_result = StatResult::at(string(path), file_hint, directory_hint);\n  if (stat_result->is_present()) {\n    pending.emplace(path, static_pointer_cast<PresentEntry>(stat_result));\n  }\n  return stat_result;\n}\n\nshared_ptr<StatResult> RecentFileCache::former_at_path(const string &path, bool file_hint, bool directory_hint)\n{\n  auto maybe = by_path.find(path);\n  if (maybe == by_path.end()) {\n    EntryKind kind = KIND_UNKNOWN;\n    if (file_hint && !directory_hint) kind = KIND_FILE;\n    if (!file_hint && directory_hint) kind = KIND_DIRECTORY;\n\n    return shared_ptr<StatResult>(new AbsentEntry(string(path), kind));\n  }\n\n  return maybe->second;\n}\n\nvoid RecentFileCache::evict(const string &path)\n{\n  auto maybe = by_path.find(path);\n  if (maybe != by_path.end()) {\n    shared_ptr<PresentEntry> existing = maybe->second;\n\n    auto range = by_timestamp.equal_range(existing->get_last_seen());\n    auto to_erase = by_timestamp.end();\n    for (auto it = range.first; it != range.second; ++it) {\n      if (it->second == existing) {\n        to_erase = it;\n      }\n    }\n    if (to_erase != by_timestamp.end()) {\n      by_timestamp.erase(to_erase);\n    }\n\n    by_path.erase(maybe);\n  }\n}\n\nvoid RecentFileCache::evict(const shared_ptr<PresentEntry> entry)\n{\n  auto maybe = by_path.find(entry->get_path());\n  if (maybe != by_path.end() && maybe->second == entry) {\n    evict(entry->get_path());\n  }\n}\n\nvoid RecentFileCache::apply()\n{\n  for (auto &pair : pending) {\n    shared_ptr<PresentEntry> &present = pair.second;\n\n    \/\/ Clear an existing entry at the same path if one exists\n    evict(present->get_path());\n\n    \/\/ Add the new PresentEntry\n    by_path.emplace(present->get_path(), present);\n    by_timestamp.emplace(present->get_last_seen(), present);\n  }\n  pending.clear();\n}\n\nvoid RecentFileCache::prune()\n{\n  if (by_path.size() <= CACHE_WATERMARK) {\n    return;\n  }\n\n  LOGGER << \"Cache currently contains \" << plural(by_path.size(), \"entry\", \"entries\") << \". Pruning triggered.\" << endl;\n\n  time_point<steady_clock> oldest = steady_clock::now() - CACHE_AGEOFF;\n\n  auto to_keep = by_timestamp.upper_bound(oldest);\n  size_t prune_count = 0;\n  for (auto it = by_timestamp.begin(); it != to_keep && it != by_timestamp.end(); ++it) {\n    shared_ptr<PresentEntry> entry = it->second;\n    by_path.erase(entry->get_path());\n\n    prune_count++;\n  }\n\n  if (to_keep != by_timestamp.begin()) {\n    by_timestamp.erase(by_timestamp.begin(), to_keep);\n  }\n\n  LOGGER << \"Pruned \" << plural(prune_count, \"entry\", \"entries\") << \". \" << plural(by_path.size(), \"entry\", \"entries\")\n         << \" remain.\" << endl;\n}\n\nvoid RecentFileCache::prepopulate(const string &root, size_t max)\n{\n  size_t count = 0;\n  size_t entries = 0;\n  queue<string> next_roots;\n  next_roots.push(root);\n\n  while (count < max && !next_roots.empty()) {\n    string current_root(next_roots.front());\n    next_roots.pop();\n\n    DIR *dir = opendir(current_root.c_str());\n    if (dir == nullptr) {\n      errno_t opendir_errno = errno;\n      LOGGER << \"Unable to open directory \" << root << \": \" << strerror(opendir_errno) << \".\" << endl;\n      LOGGER << \"Incompletely pre-populated cache with \" << entries << \" entries.\" << endl;\n      return;\n    }\n\n    errno = 0;\n    dirent *entry = readdir(dir);\n    while (entry != nullptr) {\n      string entry_name(entry->d_name, entry->d_namlen);\n\n      if (entry_name != \".\" && entry_name != \"..\") {\n        string entry_path(path_join(current_root, entry_name));\n\n        bool file_hint = (entry->d_type & DT_REG) == DT_REG;\n        bool dir_hint = (entry->d_type & DT_DIR) == DT_DIR;\n\n        shared_ptr<StatResult> r = current_at_path(entry_path, file_hint, dir_hint);\n        if (r->is_present()) {\n          entries++;\n          if (r->get_entry_kind() == KIND_DIRECTORY) next_roots.push(entry_path);\n        }\n\n        count++;\n        if (count >= max) {\n          LOGGER << \"Incompletely pre-populated cache with \" << entries << \" entries.\" << endl;\n          return;\n        }\n      }\n\n      errno = 0;\n      entry = readdir(dir);\n    }\n    errno_t readdir_errno = errno;\n    if (readdir_errno != 0) {\n      LOGGER << \"Unable to read directory entry within \" << root << \": \" << strerror(readdir_errno) << \".\" << endl;\n    }\n\n    if (closedir(dir) != 0) {\n      errno_t closedir_errno = errno;\n      LOGGER << \"Unable to close directory \" << root << \": \" << strerror(closedir_errno) << \".\" << endl;\n    }\n  }\n  apply();\n\n  LOGGER << \"Pre-populated cache with \" << entries << \" entries.\" << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012-2015 Daniele Bartolini and individual contributors.\n * License: https:\/\/github.com\/taylor001\/crown\/blob\/master\/LICENSE\n *\/\n\n#include \"gui.h\"\n#include \"lua_environment.h\"\n#include \"lua_stack.h\"\n#include \"vector3.h\"\n#include \"quaternion.h\"\n#include \"color4.h\"\n#include \"device.h\"\n#include \"resource_manager.h\"\n#include \"font_resource.h\"\n\nnamespace crown\n{\n\nstatic int gui_resolution(lua_State* L)\n{\n\tLuaStack stack(L);\n\tconst Vector2 resolution = stack.get_gui(1)->resolution();\n\tstack.push_int32((uint32_t)resolution.x);\n\tstack.push_int32((uint32_t)resolution.y);\n\treturn 2;\n}\n\nstatic int gui_move(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->move(stack.get_vector2(2));\n\treturn 0;\n}\n\nstatic int gui_screen_to_gui(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.push_vector2(stack.get_gui(1)->screen_to_gui(stack.get_vector2(2)));\n\treturn 1;\n}\n\nstatic int gui_draw_rectangle(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->draw_rectangle(stack.get_vector3(2), stack.get_vector2(3),\n\t\tstack.get_color4(4));\n\treturn 0;\n}\n\nstatic int gui_draw_image(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->draw_image(stack.get_string(2), stack.get_vector3(3),\n\t\tstack.get_vector2(4), stack.get_color4(5));\n\treturn 0;\n}\n\nstatic int gui_draw_image_uv(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->draw_image_uv(stack.get_string(2), stack.get_vector3(3),\n\t\tstack.get_vector2(4), stack.get_vector2(5), stack.get_vector2(6), stack.get_color4(7));\n\treturn 0;\n}\n\nstatic int gui_draw_text(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->draw_text(stack.get_string(2), stack.get_string(3), stack.get_int(4),\n\t\tstack.get_vector3(5), stack.get_color4(6));\n\treturn 0;\n}\n\nvoid load_gui(LuaEnvironment& env)\n{\n\tenv.load_module_function(\"Gui\", \"resolution\",     gui_resolution);\n\tenv.load_module_function(\"Gui\", \"move\",           gui_move);\n\tenv.load_module_function(\"Gui\", \"screen_to_gui\",  gui_screen_to_gui);\n\tenv.load_module_function(\"Gui\", \"draw_rectangle\", gui_draw_rectangle);\n\tenv.load_module_function(\"Gui\", \"draw_image\",     gui_draw_image);\n\tenv.load_module_function(\"Gui\", \"draw_image_uv\",  gui_draw_image_uv);\n\tenv.load_module_function(\"Gui\", \"draw_text\",      gui_draw_text);\n}\n\n} \/\/ namespace crown\n<commit_msg>Cleanup<commit_after>\/*\n * Copyright (c) 2012-2015 Daniele Bartolini and individual contributors.\n * License: https:\/\/github.com\/taylor001\/crown\/blob\/master\/LICENSE\n *\/\n\n#include \"gui.h\"\n#include \"lua_environment.h\"\n#include \"lua_stack.h\"\n#include \"vector3.h\"\n#include \"quaternion.h\"\n#include \"color4.h\"\n#include \"resource_manager.h\"\n#include \"font_resource.h\"\n\nnamespace crown\n{\n\nstatic int gui_resolution(lua_State* L)\n{\n\tLuaStack stack(L);\n\tconst Vector2 resolution = stack.get_gui(1)->resolution();\n\tstack.push_int32((uint32_t)resolution.x);\n\tstack.push_int32((uint32_t)resolution.y);\n\treturn 2;\n}\n\nstatic int gui_move(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->move(stack.get_vector2(2));\n\treturn 0;\n}\n\nstatic int gui_screen_to_gui(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.push_vector2(stack.get_gui(1)->screen_to_gui(stack.get_vector2(2)));\n\treturn 1;\n}\n\nstatic int gui_draw_rectangle(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->draw_rectangle(stack.get_vector3(2), stack.get_vector2(3),\n\t\tstack.get_color4(4));\n\treturn 0;\n}\n\nstatic int gui_draw_image(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->draw_image(stack.get_string(2), stack.get_vector3(3),\n\t\tstack.get_vector2(4), stack.get_color4(5));\n\treturn 0;\n}\n\nstatic int gui_draw_image_uv(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->draw_image_uv(stack.get_string(2), stack.get_vector3(3),\n\t\tstack.get_vector2(4), stack.get_vector2(5), stack.get_vector2(6), stack.get_color4(7));\n\treturn 0;\n}\n\nstatic int gui_draw_text(lua_State* L)\n{\n\tLuaStack stack(L);\n\tstack.get_gui(1)->draw_text(stack.get_string(2), stack.get_string(3), stack.get_int(4),\n\t\tstack.get_vector3(5), stack.get_color4(6));\n\treturn 0;\n}\n\nvoid load_gui(LuaEnvironment& env)\n{\n\tenv.load_module_function(\"Gui\", \"resolution\",     gui_resolution);\n\tenv.load_module_function(\"Gui\", \"move\",           gui_move);\n\tenv.load_module_function(\"Gui\", \"screen_to_gui\",  gui_screen_to_gui);\n\tenv.load_module_function(\"Gui\", \"draw_rectangle\", gui_draw_rectangle);\n\tenv.load_module_function(\"Gui\", \"draw_image\",     gui_draw_image);\n\tenv.load_module_function(\"Gui\", \"draw_image_uv\",  gui_draw_image_uv);\n\tenv.load_module_function(\"Gui\", \"draw_text\",      gui_draw_text);\n}\n\n} \/\/ namespace crown\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n@file\n\n@copyright Edouard Alligand and Joel Falcou 2015-2017\n(See accompanying file LICENSE.md or copy at http:\/\/boost.org\/LICENSE_1_0.txt)\n*\/\n#ifndef BOOST_BRIGAND_ALGORITHMS_DETAIL_NON_NULL_HPP\n#define BOOST_BRIGAND_ALGORITHMS_DETAIL_NON_NULL_HPP\n\n#include <brigand\/types\/bool.hpp>\n#include <brigand\/types\/args.hpp>\n\nnamespace brigand\n{\nnamespace detail\n{\n    \/\/ Default find-like predicate\n\n    template <typename Args>\n  struct non_null_impl : bool_<Args::value != 0>{};\n    using non_null = non_null_impl<_1>;\n}\n}\n#endif\n<commit_msg>Delete non_null.hpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2003 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 __INTMATH_HH__\n#define __INTMATH_HH__\n\n#include <assert.h>\n\n#include \"sim\/host.hh\"\n\n\/\/ Returns the prime number one less than n.\nint PrevPrime(int n);\n\n\/\/ Determine if a number is prime\ntemplate <class T>\ninline bool\nIsPrime(T n)\n{\n    T i;\n\n    if (n == 2 || n == 3)\n        return true;\n\n    \/\/ Don't try every odd number to prove if it is a prime.\n    \/\/ Toggle between every 2nd and 4th number.\n    \/\/ (This is because every 6th odd number is divisible by 3.)\n    for (i = 5; i*i <= n; i += 6) {\n        if (((n % i) == 0 ) || ((n % (i + 2)) == 0) ) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\ntemplate <class T>\ninline T\nLeastSigBit(T n)\n{\n    return n & ~(n - 1);\n}\n\ntemplate <class T>\ninline bool\nIsPowerOf2(T n)\n{\n    return n != 0 && LeastSigBit(n) == n;\n}\n\ninline int\nFloorLog2(uint32_t x)\n{\n    assert(x > 0);\n\n    int y = 0;\n\n    if (x & 0xffff0000) { y += 16; x >>= 16; }\n    if (x & 0x0000ff00) { y +=  8; x >>=  8; }\n    if (x & 0x000000f0) { y +=  4; x >>=  4; }\n    if (x & 0x0000000c) { y +=  2; x >>=  2; }\n    if (x & 0x00000002) { y +=  1; }\n\n    return y;\n}\n\ninline int\nFloorLog2(uint64_t x)\n{\n    assert(x > 0);\n\n    int y = 0;\n\n    if (x & ULL(0xffffffff00000000)) { y += 32; x >>= 32; }\n    if (x & ULL(0x00000000ffff0000)) { y += 16; x >>= 16; }\n    if (x & ULL(0x000000000000ff00)) { y +=  8; x >>=  8; }\n    if (x & ULL(0x00000000000000f0)) { y +=  4; x >>=  4; }\n    if (x & ULL(0x000000000000000c)) { y +=  2; x >>=  2; }\n    if (x & ULL(0x0000000000000002)) { y +=  1; }\n\n    return y;\n}\n\ninline int\nFloorLog2(int32_t x)\n{\n    assert(x > 0);\n    return FloorLog2(x);\n}\n\ninline int\nFloorLog2(int64_t x)\n{\n    assert(x > 0);\n    return FloorLog2(x);\n}\n\ntemplate <class T>\ninline int\nCeilLog2(T n)\n{\n    if (n == 1)\n        return 0;\n\n    return FloorLog2(n - (T)1) + 1;\n}\n\ntemplate <class T>\ninline T\nFloorPow2(T n)\n{\n    return (T)1 << FloorLog2(n);\n}\n\ntemplate <class T>\ninline T\nCeilPow2(T n)\n{\n    return (T)1 << CeilLog2(n);\n}\n\ntemplate <class T>\ninline T\nDivCeil(T a, T b)\n{\n    return (a + b - 1) \/ b;\n}\n\ntemplate <class T>\ninline T\nRoundUp(T val, T align)\n{\n    T mask = align - 1;\n    return (val + mask) & ~mask;\n}\n\ntemplate <class T>\ninline T\nRoundDown(T val, T align)\n{\n    T mask = align - 1;\n    return val & ~mask;\n}\n\ninline bool\nIsHex(char c)\n{\n    return c >= '0' && c <= '9' ||\n        c >= 'A' && c <= 'F' ||\n        c >= 'a' && c <= 'f';\n}\n\ninline bool\nIsOct(char c)\n{\n    return c >= '0' && c <= '7';\n}\n\ninline bool\nIsDec(char c)\n{\n    return c >= '0' && c <= '9';\n}\n\ninline int\nHex2Int(char c)\n{\n  if (c >= '0' && c <= '9')\n    return (c - '0');\n\n  if (c >= 'A' && c <= 'F')\n    return (c - 'A') + 10;\n\n  if (c >= 'a' && c <= 'f')\n    return (c - 'a') + 10;\n\n  return 0;\n}\n\n#endif \/\/ __INTMATH_HH__\n<commit_msg>Need to cast to avoid infinite recursion.<commit_after>\/*\n * Copyright (c) 2003 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 __INTMATH_HH__\n#define __INTMATH_HH__\n\n#include <assert.h>\n\n#include \"sim\/host.hh\"\n\n\/\/ Returns the prime number one less than n.\nint PrevPrime(int n);\n\n\/\/ Determine if a number is prime\ntemplate <class T>\ninline bool\nIsPrime(T n)\n{\n    T i;\n\n    if (n == 2 || n == 3)\n        return true;\n\n    \/\/ Don't try every odd number to prove if it is a prime.\n    \/\/ Toggle between every 2nd and 4th number.\n    \/\/ (This is because every 6th odd number is divisible by 3.)\n    for (i = 5; i*i <= n; i += 6) {\n        if (((n % i) == 0 ) || ((n % (i + 2)) == 0) ) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\ntemplate <class T>\ninline T\nLeastSigBit(T n)\n{\n    return n & ~(n - 1);\n}\n\ntemplate <class T>\ninline bool\nIsPowerOf2(T n)\n{\n    return n != 0 && LeastSigBit(n) == n;\n}\n\ninline int\nFloorLog2(uint32_t x)\n{\n    assert(x > 0);\n\n    int y = 0;\n\n    if (x & 0xffff0000) { y += 16; x >>= 16; }\n    if (x & 0x0000ff00) { y +=  8; x >>=  8; }\n    if (x & 0x000000f0) { y +=  4; x >>=  4; }\n    if (x & 0x0000000c) { y +=  2; x >>=  2; }\n    if (x & 0x00000002) { y +=  1; }\n\n    return y;\n}\n\ninline int\nFloorLog2(uint64_t x)\n{\n    assert(x > 0);\n\n    int y = 0;\n\n    if (x & ULL(0xffffffff00000000)) { y += 32; x >>= 32; }\n    if (x & ULL(0x00000000ffff0000)) { y += 16; x >>= 16; }\n    if (x & ULL(0x000000000000ff00)) { y +=  8; x >>=  8; }\n    if (x & ULL(0x00000000000000f0)) { y +=  4; x >>=  4; }\n    if (x & ULL(0x000000000000000c)) { y +=  2; x >>=  2; }\n    if (x & ULL(0x0000000000000002)) { y +=  1; }\n\n    return y;\n}\n\ninline int\nFloorLog2(int32_t x)\n{\n    assert(x > 0);\n    return FloorLog2((uint32_t)x);\n}\n\ninline int\nFloorLog2(int64_t x)\n{\n    assert(x > 0);\n    return FloorLog2((uint64_t)x);\n}\n\ntemplate <class T>\ninline int\nCeilLog2(T n)\n{\n    if (n == 1)\n        return 0;\n\n    return FloorLog2(n - (T)1) + 1;\n}\n\ntemplate <class T>\ninline T\nFloorPow2(T n)\n{\n    return (T)1 << FloorLog2(n);\n}\n\ntemplate <class T>\ninline T\nCeilPow2(T n)\n{\n    return (T)1 << CeilLog2(n);\n}\n\ntemplate <class T>\ninline T\nDivCeil(T a, T b)\n{\n    return (a + b - 1) \/ b;\n}\n\ntemplate <class T>\ninline T\nRoundUp(T val, T align)\n{\n    T mask = align - 1;\n    return (val + mask) & ~mask;\n}\n\ntemplate <class T>\ninline T\nRoundDown(T val, T align)\n{\n    T mask = align - 1;\n    return val & ~mask;\n}\n\ninline bool\nIsHex(char c)\n{\n    return c >= '0' && c <= '9' ||\n        c >= 'A' && c <= 'F' ||\n        c >= 'a' && c <= 'f';\n}\n\ninline bool\nIsOct(char c)\n{\n    return c >= '0' && c <= '7';\n}\n\ninline bool\nIsDec(char c)\n{\n    return c >= '0' && c <= '9';\n}\n\ninline int\nHex2Int(char c)\n{\n  if (c >= '0' && c <= '9')\n    return (c - '0');\n\n  if (c >= 'A' && c <= 'F')\n    return (c - 'A') + 10;\n\n  if (c >= 'a' && c <= 'f')\n    return (c - 'a') + 10;\n\n  return 0;\n}\n\n#endif \/\/ __INTMATH_HH__\n<|endoftext|>"}
{"text":"<commit_before>#include \"LikelihoodProfiler.h\"\n\n\/\/ from STL\n#include <set>\n\n\/\/ from ROOT\n#include \"TCanvas.h\"\n#include \"TGraph.h\"\n#include \"TH2D.h\" \n#include \"TAxis.h\"\n#include \"TStyle.h\"\n\n\/\/ from RooFit\n#include \"RooFitResult.h\"\n\n\/\/ from DooCore\n#include <doocore\/io\/MsgStream.h>\n#include <doocore\/io\/Progress.h>\n#include <doocore\/lutils\/lutils.h>\n\n\/\/ from DooFit\n#include \"doofit\/fitter\/AbsFitter.h\"\n#include \"doofit\/toy\/ToyStudyStd\/ToyStudyStd.h\"\n\ndoofit::plotting::profiles::LikelihoodProfiler::LikelihoodProfiler()\n: num_samples_(30)\n{}\n\nstd::vector<double> doofit::plotting::profiles::LikelihoodProfiler::SetSamplePoint(unsigned int step) {\n  using namespace doocore::io;\n\n  std::vector<double> sample_vals;\n  int i(scan_vars_.size() - 1);\n\n  \/\/sdebug << \"step = \" << step << endmsg;\n\n  for (auto var : scan_vars_) {\n    int step_this = step\/std::pow(num_samples_,i);\n    step -= step_this*std::pow(num_samples_,i);\n    --i;\n\n    double val(start_vals_[var->GetName()] + 3*var->getError()*(-1.0 + 2.0\/static_cast<double>(num_samples_)*step_this));\n    var->setVal(val);\n    var->setConstant(true);\n\n    sample_vals.push_back(val);\n    \/\/sdebug << \"  \" << var->GetName() << \" = \" << step_this << \" @ \" << var->getVal() << endmsg;\n  }\n\n  return sample_vals;\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::Scan() {\n  using namespace doocore::io;\n\n  \/\/RooRealVar* parameter_scan = scan_vars_.front();\n\n  \/\/num_samples_                   = 12;\n  unsigned int num_dimensions    = scan_vars_.size();\n  unsigned int num_total_samples = std::pow(num_samples_,num_dimensions);\n  unsigned int step              = 0;\n\n  \/\/ double value_start = parameter_scan->getVal();\n  \/\/ double value_scan  = value_start - 5.0*parameter_scan->getError();\n\n  for (auto var : scan_vars_) {\n    start_vals_[var->GetName()] = var->getVal();\n  }\n\n  Progress p(\"Sampling likelihood\", num_total_samples);\n  while (step < num_total_samples) {\n    \/\/parameter_scan->setVal(value_scan);\n    \/\/parameter_scan->setConstant(true);\n\n    \/\/sinfo << \"PROFILE: \" << value_scan << endmsg;\n\n    std::vector<double> sample_vals(SetSamplePoint(step));\n\n    fitter_->set_shutup(true);\n    fitter_->Fit();  \n\n    fit_results_.push_back(fitter_->fit_result());\n\n    \/\/sinfo << fitter_->NegativeLogLikelihood() << endmsg;\n    \/\/value_scan += 1*parameter_scan->getError();\n    ++step;\n    ++p;\n  }  \n  p.Finish();\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::ReadFitResults(doofit::toy::ToyStudyStd& toy_study) {\n  using namespace doofit::toy;\n\n  FitResultContainer fit_result_container(toy_study.GetFitResult());\n  const RooFitResult* fit_result(std::get<0>(fit_result_container));\n\n  while (fit_result != nullptr) {\n    fit_results_.push_back(fit_result);\n\n    fit_result_container = toy_study.GetFitResult();\n    fit_result = std::get<0>(fit_result_container);\n  }\n}\n\nbool doofit::plotting::profiles::LikelihoodProfiler::FitResultOkay(const RooFitResult& fit_result) const {\n  using namespace doocore::io;\n  if (fit_result.covQual() < 2) {\n    return false;\n  } else if (fit_result.statusCodeHistory(0) < 0) {\n    return false;\n  } else {\n    return true;\n  }\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::PlotHandler(const std::string& plot_path) {\n  using namespace doocore::io;\n\n  std::map<std::string, std::vector<double>> val_scan;\n  std::vector<double> val_nll;\n\n  if (val_scan.size() == 1) {\n    doocore::lutils::setStyle();\n  } else if (val_scan.size() == 2) {\n    doocore::lutils::setStyle(\"2d\");\n    gStyle->SetNumberContours(999);\n    gStyle->SetPadRightMargin(0.16);\n    gStyle->SetTitleOffset(0.75, \"z\");\n  }\n\n  for (auto var : scan_vars_) {\n    RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(fit_results_.front()->constPars().find(var->GetName()));\n    scan_vars_titles_.push_back(var_fixed->GetTitle());\n  }\n\n  double min_nll(0.0);\n  for (auto result : fit_results_) {\n    if (FitResultOkay(*result)) {\n      for (auto var : scan_vars_) {\n        RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(result->constPars().find(var->GetName()));\n\n        if (var_fixed == nullptr) {\n          serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot find fixed parameter \" \n               << var->GetName() << \" in fit result!\" << endmsg;\n          throw;\n        }\n\n        val_scan[var->GetName()].push_back(var_fixed->getVal());\n      }\n\n      if (min_nll == 0.0 || min_nll > result->minNll()) {\n        min_nll = result->minNll();\n      }\n      val_nll.push_back(result->minNll());\n    }\n  }\n\n  for (auto &nll : val_nll) {\n    if (nll != 0.0) {\n      nll -= min_nll;\n    }\n  }\n\n  TCanvas c(\"c\", \"c\", 800, 600);\n\n  if (val_scan.size() == 1) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n\n    TGraph graph(val_nll.size(), &val_x[0], &val_nll[0]);\n    graph.Draw(\"AP\");\n    graph.GetXaxis()->SetTitle(scan_vars_titles_.at(0).c_str());\n    graph.GetYaxis()->SetTitle(\"#DeltaLL\");\n    \/\/c.SaveAs(\"profile.pdf\");\n    doocore::lutils::printPlot(&c, \"profile\", plot_path);\n  } else if (val_scan.size() == 2) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n    const std::vector<double>& val_y = val_scan.rbegin()->second;\n\n    auto minmax_x = std::minmax_element(val_x.begin(), val_x.end());\n    auto minmax_y = std::minmax_element(val_y.begin(), val_y.end());\n\n    std::set<double> distinct_x, distinct_y;\n    for (auto x : val_x) {\n      distinct_x.insert(x);\n    }\n    for (auto y : val_y) {\n      distinct_y.insert(y);\n    }\n\n    double min_nll(0.0), max_nll(0.0);\n    for (auto nll : val_nll) {\n      if (nll != 0 && (min_nll == 0.0 || nll < min_nll)) {\n        min_nll = nll;\n      }\n      if (nll != 0 && (max_nll == 0.0 || nll > max_nll)) {\n        max_nll = nll;\n      }\n    }\n\n    double min_x = *minmax_x.first  - (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double max_x = *minmax_x.second + (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double min_y = *minmax_y.first  - (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n    double max_y = *minmax_y.second + (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n\n    TH2D histogram(\"histogram\", \"histogram\", distinct_x.size(), min_x, max_x, distinct_y.size(), min_y, max_y);\n\n    \/\/ sdebug << \"histogram x: \" << *minmax_x.first << \" - \" <<  *minmax_x.second << endmsg;\n    \/\/ sdebug << \"histogram y: \" << *minmax_y.first << \" - \" <<  *minmax_y.second << endmsg;\n\n    for (int i=0; i<val_nll.size(); ++i) {\n      \/\/ sdebug << val_x.at(i) << \", \" << val_y.at(i) << \" - \" << val_nll.at(i) << endmsg;\n      \/\/ sdebug << \"Bin: \" << histogram.FindBin(val_x.at(i), val_y.at(i)) << endmsg;\n      \n      int nbin_x, nbin_y, nbin_z;\n      histogram.GetBinXYZ(histogram.FindBin(val_x.at(i), val_y.at(i)), nbin_x, nbin_y, nbin_z);\n\n      \/\/ sdebug << \"Bin center x: \" << histogram.GetXaxis()->GetBinCenter(nbin_x) << endmsg;\n      \/\/ sdebug << \"Bin center y: \" << histogram.GetYaxis()->GetBinCenter(nbin_y) << endmsg;\n\n      histogram.SetBinContent(histogram.FindBin(val_x.at(i), val_y.at(i)), val_nll.at(i));\n    }\n\n    histogram.Draw(\"COLZ\");\n    histogram.GetZaxis()->SetRangeUser(min_nll, max_nll);\n    histogram.SetXTitle(scan_vars_titles_.at(0).c_str());\n    histogram.SetYTitle(scan_vars_titles_.at(1).c_str());\n    histogram.SetZTitle(\"#DeltaLL\");\n\n    \/\/c.SaveAs(\"profile.pdf\");\n    doocore::lutils::printPlot(&c, \"profile\", plot_path);\n  } else {\n    serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot (yet) plot 3D likelihood.\" << endmsg;\n    throw;\n  }\n\n  \n}\n\n\n<commit_msg>LikelihoodProfiler: plotting cosmetics<commit_after>#include \"LikelihoodProfiler.h\"\n\n\/\/ from STL\n#include <set>\n\n\/\/ from ROOT\n#include \"TCanvas.h\"\n#include \"TGraph.h\"\n#include \"TH2D.h\" \n#include \"TAxis.h\"\n#include \"TStyle.h\"\n\n\/\/ from RooFit\n#include \"RooFitResult.h\"\n\n\/\/ from DooCore\n#include <doocore\/io\/MsgStream.h>\n#include <doocore\/io\/Progress.h>\n#include <doocore\/lutils\/lutils.h>\n\n\/\/ from DooFit\n#include \"doofit\/fitter\/AbsFitter.h\"\n#include \"doofit\/toy\/ToyStudyStd\/ToyStudyStd.h\"\n\ndoofit::plotting::profiles::LikelihoodProfiler::LikelihoodProfiler()\n: num_samples_(30)\n{}\n\nstd::vector<double> doofit::plotting::profiles::LikelihoodProfiler::SetSamplePoint(unsigned int step) {\n  using namespace doocore::io;\n\n  std::vector<double> sample_vals;\n  int i(scan_vars_.size() - 1);\n\n  \/\/sdebug << \"step = \" << step << endmsg;\n\n  for (auto var : scan_vars_) {\n    int step_this = step\/std::pow(num_samples_,i);\n    step -= step_this*std::pow(num_samples_,i);\n    --i;\n\n    double val(start_vals_[var->GetName()] + 3*var->getError()*(-1.0 + 2.0\/static_cast<double>(num_samples_)*step_this));\n    var->setVal(val);\n    var->setConstant(true);\n\n    sample_vals.push_back(val);\n    \/\/sdebug << \"  \" << var->GetName() << \" = \" << step_this << \" @ \" << var->getVal() << endmsg;\n  }\n\n  return sample_vals;\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::Scan() {\n  using namespace doocore::io;\n\n  \/\/RooRealVar* parameter_scan = scan_vars_.front();\n\n  \/\/num_samples_                   = 12;\n  unsigned int num_dimensions    = scan_vars_.size();\n  unsigned int num_total_samples = std::pow(num_samples_,num_dimensions);\n  unsigned int step              = 0;\n\n  \/\/ double value_start = parameter_scan->getVal();\n  \/\/ double value_scan  = value_start - 5.0*parameter_scan->getError();\n\n  for (auto var : scan_vars_) {\n    start_vals_[var->GetName()] = var->getVal();\n  }\n\n  Progress p(\"Sampling likelihood\", num_total_samples);\n  while (step < num_total_samples) {\n    \/\/parameter_scan->setVal(value_scan);\n    \/\/parameter_scan->setConstant(true);\n\n    \/\/sinfo << \"PROFILE: \" << value_scan << endmsg;\n\n    std::vector<double> sample_vals(SetSamplePoint(step));\n\n    fitter_->set_shutup(true);\n    fitter_->Fit();  \n\n    fit_results_.push_back(fitter_->fit_result());\n\n    \/\/sinfo << fitter_->NegativeLogLikelihood() << endmsg;\n    \/\/value_scan += 1*parameter_scan->getError();\n    ++step;\n    ++p;\n  }  \n  p.Finish();\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::ReadFitResults(doofit::toy::ToyStudyStd& toy_study) {\n  using namespace doofit::toy;\n\n  FitResultContainer fit_result_container(toy_study.GetFitResult());\n  const RooFitResult* fit_result(std::get<0>(fit_result_container));\n\n  while (fit_result != nullptr) {\n    fit_results_.push_back(fit_result);\n\n    fit_result_container = toy_study.GetFitResult();\n    fit_result = std::get<0>(fit_result_container);\n  }\n}\n\nbool doofit::plotting::profiles::LikelihoodProfiler::FitResultOkay(const RooFitResult& fit_result) const {\n  using namespace doocore::io;\n  if (fit_result.covQual() < 2) {\n    return false;\n  } else if (fit_result.statusCodeHistory(0) < 0) {\n    return false;\n  } else {\n    return true;\n  }\n}\n\nvoid doofit::plotting::profiles::LikelihoodProfiler::PlotHandler(const std::string& plot_path) {\n  using namespace doocore::io;\n\n  std::map<std::string, std::vector<double>> val_scan;\n  std::vector<double> val_nll;\n\n  if (val_scan.size() == 1) {\n    doocore::lutils::setStyle();\n  } else if (val_scan.size() == 2) {\n    doocore::lutils::setStyle(\"2d\");\n    gStyle->SetNumberContours(999);\n    gStyle->SetPadRightMargin(0.16);\n    gStyle->SetTitleOffset(0.75, \"z\");\n  }\n\n  for (auto var : scan_vars_) {\n    RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(fit_results_.front()->constPars().find(var->GetName()));\n    scan_vars_titles_.push_back(var_fixed->GetTitle());\n  }\n\n  double min_nll(0.0);\n  for (auto result : fit_results_) {\n    if (FitResultOkay(*result)) {\n      for (auto var : scan_vars_) {\n        RooRealVar* var_fixed = dynamic_cast<RooRealVar*>(result->constPars().find(var->GetName()));\n\n        if (var_fixed == nullptr) {\n          serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot find fixed parameter \" \n               << var->GetName() << \" in fit result!\" << endmsg;\n          throw;\n        }\n\n        val_scan[var->GetName()].push_back(var_fixed->getVal());\n      }\n\n      if (min_nll == 0.0 || min_nll > result->minNll()) {\n        min_nll = result->minNll();\n      }\n      val_nll.push_back(result->minNll());\n    }\n  }\n\n  for (auto &nll : val_nll) {\n    if (nll != 0.0) {\n      nll -= min_nll;\n    }\n  }\n\n  TCanvas c(\"c\", \"c\", 800, 600);\n\n  if (val_scan.size() == 1) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n\n    TGraph graph(val_nll.size(), &val_x[0], &val_nll[0]);\n    graph.Draw(\"AP\");\n    graph.GetXaxis()->SetTitle(scan_vars_titles_.at(0).c_str());\n    graph.GetYaxis()->SetTitle(\"#DeltaLL\");\n    graph.SetMarkerStyle(1);\n    graph.SetMarkerSize(10);\n\n    \/\/c.SaveAs(\"profile.pdf\");\n    doocore::lutils::printPlot(&c, \"profile\", plot_path);\n  } else if (val_scan.size() == 2) {\n    const std::vector<double>& val_x = val_scan.begin()->second;\n    const std::vector<double>& val_y = val_scan.rbegin()->second;\n\n    auto minmax_x = std::minmax_element(val_x.begin(), val_x.end());\n    auto minmax_y = std::minmax_element(val_y.begin(), val_y.end());\n\n    std::set<double> distinct_x, distinct_y;\n    for (auto x : val_x) {\n      distinct_x.insert(x);\n    }\n    for (auto y : val_y) {\n      distinct_y.insert(y);\n    }\n\n    double min_nll(0.0), max_nll(0.0);\n    for (auto nll : val_nll) {\n      if (nll != 0 && (min_nll == 0.0 || nll < min_nll)) {\n        min_nll = nll;\n      }\n      if (nll != 0 && (max_nll == 0.0 || nll > max_nll)) {\n        max_nll = nll;\n      }\n    }\n\n    double min_x = *minmax_x.first  - (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double max_x = *minmax_x.second + (*minmax_x.second-*minmax_x.first)\/(distinct_x.size()-1)*0.5;\n    double min_y = *minmax_y.first  - (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n    double max_y = *minmax_y.second + (*minmax_y.second-*minmax_y.first)\/(distinct_y.size()-1)*0.5;\n\n    TH2D histogram(\"histogram\", \"histogram\", distinct_x.size(), min_x, max_x, distinct_y.size(), min_y, max_y);\n\n    \/\/ sdebug << \"histogram x: \" << *minmax_x.first << \" - \" <<  *minmax_x.second << endmsg;\n    \/\/ sdebug << \"histogram y: \" << *minmax_y.first << \" - \" <<  *minmax_y.second << endmsg;\n\n    for (int i=0; i<val_nll.size(); ++i) {\n      \/\/ sdebug << val_x.at(i) << \", \" << val_y.at(i) << \" - \" << val_nll.at(i) << endmsg;\n      \/\/ sdebug << \"Bin: \" << histogram.FindBin(val_x.at(i), val_y.at(i)) << endmsg;\n      \n      int nbin_x, nbin_y, nbin_z;\n      histogram.GetBinXYZ(histogram.FindBin(val_x.at(i), val_y.at(i)), nbin_x, nbin_y, nbin_z);\n\n      \/\/ sdebug << \"Bin center x: \" << histogram.GetXaxis()->GetBinCenter(nbin_x) << endmsg;\n      \/\/ sdebug << \"Bin center y: \" << histogram.GetYaxis()->GetBinCenter(nbin_y) << endmsg;\n\n      histogram.SetBinContent(histogram.FindBin(val_x.at(i), val_y.at(i)), val_nll.at(i));\n    }\n\n    histogram.Draw(\"COLZ\");\n    histogram.GetZaxis()->SetRangeUser(min_nll, max_nll);\n    histogram.SetXTitle(scan_vars_titles_.at(0).c_str());\n    histogram.SetYTitle(scan_vars_titles_.at(1).c_str());\n    histogram.SetZTitle(\"#DeltaLL\");\n\n    \/\/c.SaveAs(\"profile.pdf\");\n    doocore::lutils::printPlot(&c, \"profile\", plot_path);\n  } else {\n    serr << \"Error in LikelihoodProfiler::PlotHandler(): Cannot (yet) plot 3D likelihood.\" << endmsg;\n    throw;\n  }\n\n  \n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file  pi_lmo_parallel1.cpp\n\/\/\/ @brief Parallel implementation of the Lagarias-Miller-Odlyzko\n\/\/\/        prime counting algorithm using OpenMP. This implementation\n\/\/\/        is based on pi_lmo4(x).\n\/\/\/\n\/\/\/ Copyright (C) 2014 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 <primecount-internal.hpp>\n#include <primesieve.hpp>\n#include <aligned_vector.hpp>\n#include <pmath.hpp>\n#include <PhiTiny.hpp>\n#include <tos_counters.hpp>\n#include <utils.hpp>\n\n#include <stdint.h>\n#include <algorithm>\n#include <vector>\n\n#ifdef _OPENMP\n  #include <omp.h>\n#endif\n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\n\/\/\/ For each prime calculate its first multiple >= low.\ntemplate <typename T1, typename T2>\nvoid init_next_multiples(T1& next, T2& primes, int64_t size, int64_t low)\n{\n  next.reserve(size);\n  next.push_back(0);\n\n  for (int64_t b = 1; b < size; b++)\n  {\n    int64_t prime = primes[b];\n    int64_t next_multiple = ((low + prime - 1) \/ prime) * prime;\n    next.push_back(next_multiple);\n  }\n}\n\ntemplate <typename T1, typename T2>\nvoid cross_off(int64_t prime, int64_t low, int64_t high, int64_t& next_multiple, T1& sieve, T2& counters)\n{\n  int64_t segment_size = sieve.size();\n  int64_t k = next_multiple + prime * (~next_multiple & 1);\n\n  for (; k < high; k += prime * 2)\n  {\n    if (sieve[k - low])\n    {\n      sieve[k - low] = 0;\n      cnt_update(counters, k - low, segment_size);\n    }\n  }\n  next_multiple = k;\n}\n\n\/\/\/ Compute the S2 contribution for the interval\n\/\/\/ [low_thread, low_thread + segments * segment_size[.\n\/\/\/ The missing special leaf contributions for the interval\n\/\/\/ [1, low_thread[ are later reconstructed and added in\n\/\/\/ the calling (parent) S2 function.\n\/\/\/\nint64_t S2_thread(int64_t x,\n                  int64_t y,\n                  int64_t c,\n                  int64_t pi_y,\n                  int64_t segment_size,\n                  int64_t segments_per_thread,\n                  int64_t thread_num,\n                  int64_t limit,\n                  vector<int32_t>& pi,\n                  vector<int32_t>& primes,\n                  vector<int32_t>& lpf,\n                  vector<int32_t>& mu,\n                  vector<int64_t>& mu_sum,\n                  vector<int64_t>& phi)\n{\n  int64_t low = 1 + segment_size * segments_per_thread * thread_num;\n  limit = min(low + segment_size * segments_per_thread, limit);\n  int64_t size = pi[min(isqrt(x \/ low), y)] + 1;\n  int64_t S2_thread = 0;\n\n  if (c >= size - 1)\n    return 0;\n\n  vector<char> sieve(segment_size);\n  vector<int32_t> counters(segment_size);\n  vector<int64_t> next;\n  init_next_multiples(next, primes, size, low);\n  phi.resize(size, 0);\n  mu_sum.resize(size, 0);\n\n  \/\/ Process the segments assigned to the current thread\n  for (; low < limit; low += segment_size)\n  {\n    fill(sieve.begin(), sieve.end(), 1);\n\n    \/\/ Current segment = interval [low, high[\n    int64_t high = min(low + segment_size, limit);\n    int64_t b = 1;\n\n    \/\/ phi(y, b) nodes with b <= c do not contribute to S2, so we\n    \/\/ simply sieve out the multiples of the first c primes\n    for (; b <= c; b++)\n    {\n      int64_t k = next[b];\n      for (int64_t prime = primes[b]; k < high; k += prime)\n        sieve[k - low] = 0;\n      next[b] = k;\n    }\n\n    \/\/ Initialize special tree data structure from sieve\n    cnt_finit(sieve, counters, segment_size);\n\n    \/\/ For c + 1 <= b < pi_sqrty\n    \/\/ Find all special leaves: n = primes[b] * m\n    \/\/ which satisfy:  mu[m] != 0 && primes[b] < lpf[m], low <= (x \/ n) < high\n    for (; b < min(pi_y, size); b++)\n    {\n      int64_t prime = primes[b];\n      int64_t min_m = max(x \/ (prime * high), y \/ prime);\n      int64_t max_m = min(x \/ (prime * low), y);\n\n      if (prime >= max_m)\n        break;\n\n      for (int64_t m = max_m; m > min_m; m--)\n      {\n        if (mu[m] != 0 && prime < lpf[m])\n        {\n          int64_t n = prime * m;\n          int64_t count = cnt_query(counters, (x \/ n) - low);\n          int64_t phi_xn = phi[b] + count;\n          S2_thread -= mu[m] * phi_xn;\n          mu_sum[b] -= mu[m];\n        }\n      }\n\n      phi[b] += cnt_query(counters, (high - 1) - low);\n      cross_off(prime, low, high, next[b], sieve, counters);\n    }\n  }\n\n  return S2_thread;\n}\n\n\/\/\/ Calculate the contribution of the special leaves.\n\/\/\/ This is a parallel implementation without load balancing.\n\/\/\/ @pre y > 0 && c > 1\n\/\/\/\nint64_t S2(int64_t x,\n           int64_t y,\n           int64_t pi_y,\n           int64_t c,\n           vector<int32_t>& primes,\n           vector<int32_t>& lpf,\n           vector<int32_t>& mu,\n           int threads)\n{\n  int64_t limit = x \/ y + 1;\n  threads = validate_threads(threads, limit);\n\n  int64_t S2_total = 0;\n  int64_t segment_size = next_power_of_2(isqrt(limit));\n  int64_t segments = (limit + segment_size - 1) \/ segment_size;\n  threads = in_between(1, threads, segments);\n  int64_t segments_per_thread = (segments + threads - 1) \/ threads;\n\n  vector<int32_t> pi = make_pi(y);\n  aligned_vector<vector<int64_t> > phi(threads);\n  aligned_vector<vector<int64_t> > mu_sum(threads);\n\n  #pragma omp parallel for num_threads(threads) reduction(+: S2_total)\n  for (int i = 0; i < threads; i++)\n    S2_total += S2_thread(x, y, c, pi_y, segment_size, segments_per_thread,\n        i, limit, pi, primes, lpf, mu, mu_sum[i], phi[i]);\n\n  \/\/ Once all threads have finished reconstruct and add the\n  \/\/ missing contribution of all special leaves. This must\n  \/\/ be done in order as each thread (i) requires the sum of\n  \/\/ the phi values from the previous threads.\n  \/\/\n  for (int i = 1; i < threads; i++)\n  {\n    for (size_t j = 0; j < phi[i].size(); j++)\n    {\n      S2_total += phi[i - 1][j] * mu_sum[i][j];\n      phi[i][j] += phi[i - 1][j];\n    }\n  }\n\n  return S2_total;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\n\/\/\/ Calculate the number of primes below x using the\n\/\/\/ Lagarias-Miller-Odlyzko algorithm.\n\/\/\/ Run time: O(x^(2\/3)) operations, O(x^(1\/3) * log log x) space.\n\/\/\/\nint64_t pi_lmo_parallel1(int64_t x, int threads)\n{\n  if (x < 2)\n    return 0;\n\n  \/\/ alpha is a tuning factor\n  double alpha = in_between(1, log(log((double) x)) * 0.6, iroot<6>(x));\n  int64_t x13 = iroot<3>(x);\n  int64_t y = (int64_t) (x13 * alpha);\n\n  vector<int32_t> mu = make_moebius(y);\n  vector<int32_t> lpf = make_least_prime_factor(y);\n  vector<int32_t> primes;\n  primes.push_back(0);\n  primesieve::generate_primes(y, &primes);\n\n  int64_t pi_y = primes.size() - 1;\n  int64_t c = min<int64_t>(PhiTiny::MAX_A, pi_y);\n  int64_t s1 = S1(x, y, c, primes, lpf , mu);\n  int64_t s2 = S2(x, y, pi_y, c, primes, lpf , mu, threads);\n  int64_t p2 = P2(x, y, threads);\n  int64_t phi = s1 + s2;\n  int64_t sum = phi + pi_y - 1 - p2;\n\n  return sum;\n}\n\n} \/\/ namespace primecount\n<commit_msg>Refactoring<commit_after>\/\/\/\n\/\/\/ @file  pi_lmo_parallel1.cpp\n\/\/\/ @brief Parallel implementation of the Lagarias-Miller-Odlyzko\n\/\/\/        prime counting algorithm using OpenMP. This implementation\n\/\/\/        is based on pi_lmo4(x).\n\/\/\/\n\/\/\/ Copyright (C) 2014 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 <primecount-internal.hpp>\n#include <primesieve.hpp>\n#include <aligned_vector.hpp>\n#include <pmath.hpp>\n#include <PhiTiny.hpp>\n#include <tos_counters.hpp>\n#include <utils.hpp>\n\n#include <stdint.h>\n#include <algorithm>\n#include <vector>\n\n#ifdef _OPENMP\n  #include <omp.h>\n#endif\n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\n\/\/\/ For each prime calculate its first multiple >= low.\ntemplate <typename T1, typename T2>\nvoid init_next_multiples(T1& next, T2& primes, int64_t size, int64_t low)\n{\n  next.reserve(size);\n  next.push_back(0);\n\n  for (int64_t b = 1; b < size; b++)\n  {\n    int64_t prime = primes[b];\n    int64_t next_multiple = ((low + prime - 1) \/ prime) * prime;\n    next.push_back(next_multiple);\n  }\n}\n\ntemplate <typename T1, typename T2>\nvoid cross_off(int64_t prime, int64_t low, int64_t high, int64_t& next_multiple, T1& sieve, T2& counters)\n{\n  int64_t segment_size = sieve.size();\n  int64_t k = next_multiple + prime * (~next_multiple & 1);\n\n  for (; k < high; k += prime * 2)\n  {\n    if (sieve[k - low])\n    {\n      sieve[k - low] = 0;\n      cnt_update(counters, k - low, segment_size);\n    }\n  }\n  next_multiple = k;\n}\n\n\/\/\/ Compute the S2 contribution for the interval\n\/\/\/ [low_thread, low_thread + segments * segment_size[.\n\/\/\/ The missing special leaf contributions for the interval\n\/\/\/ [1, low_thread[ are later reconstructed and added in\n\/\/\/ the calling (parent) S2 function.\n\/\/\/\nint64_t S2_thread(int64_t x,\n                  int64_t y,\n                  int64_t c,\n                  int64_t segment_size,\n                  int64_t segments_per_thread,\n                  int64_t thread_num,\n                  int64_t limit,\n                  vector<int32_t>& pi,\n                  vector<int32_t>& primes,\n                  vector<int32_t>& lpf,\n                  vector<int32_t>& mu,\n                  vector<int64_t>& mu_sum,\n                  vector<int64_t>& phi)\n{\n  int64_t low = 1 + segment_size * segments_per_thread * thread_num;\n  limit = min(low + segment_size * segments_per_thread, limit);\n  int64_t size = pi[min(isqrt(x \/ low), y)] + 1;\n  int64_t pi_y = pi[y];\n\n  if (c >= size - 1)\n    return 0;\n\n  int64_t S2_thread = 0;\n  vector<char> sieve(segment_size);\n  vector<int32_t> counters(segment_size);\n  vector<int64_t> next;\n  init_next_multiples(next, primes, size, low);\n  phi.resize(size, 0);\n  mu_sum.resize(size, 0);\n\n  \/\/ Process the segments assigned to the current thread\n  for (; low < limit; low += segment_size)\n  {\n    fill(sieve.begin(), sieve.end(), 1);\n\n    \/\/ Current segment = interval [low, high[\n    int64_t high = min(low + segment_size, limit);\n    int64_t b = 1;\n\n    \/\/ phi(y, b) nodes with b <= c do not contribute to S2, so we\n    \/\/ simply sieve out the multiples of the first c primes\n    for (; b <= c; b++)\n    {\n      int64_t k = next[b];\n      for (int64_t prime = primes[b]; k < high; k += prime)\n        sieve[k - low] = 0;\n      next[b] = k;\n    }\n\n    \/\/ Initialize special tree data structure from sieve\n    cnt_finit(sieve, counters, segment_size);\n\n    \/\/ For c + 1 <= b < pi_sqrty\n    \/\/ Find all special leaves: n = primes[b] * m\n    \/\/ which satisfy:  mu[m] != 0 && primes[b] < lpf[m], low <= (x \/ n) < high\n    for (; b < min(pi_y, size); b++)\n    {\n      int64_t prime = primes[b];\n      int64_t min_m = max(x \/ (prime * high), y \/ prime);\n      int64_t max_m = min(x \/ (prime * low), y);\n\n      if (prime >= max_m)\n        break;\n\n      for (int64_t m = max_m; m > min_m; m--)\n      {\n        if (mu[m] != 0 && prime < lpf[m])\n        {\n          int64_t n = prime * m;\n          int64_t count = cnt_query(counters, (x \/ n) - low);\n          int64_t phi_xn = phi[b] + count;\n          S2_thread -= mu[m] * phi_xn;\n          mu_sum[b] -= mu[m];\n        }\n      }\n\n      phi[b] += cnt_query(counters, (high - 1) - low);\n      cross_off(prime, low, high, next[b], sieve, counters);\n    }\n  }\n\n  return S2_thread;\n}\n\n\/\/\/ Calculate the contribution of the special leaves.\n\/\/\/ This is a parallel implementation without load balancing.\n\/\/\/ @pre y > 0 && c > 1\n\/\/\/\nint64_t S2(int64_t x,\n           int64_t y,\n           int64_t c,\n           vector<int32_t>& primes,\n           vector<int32_t>& lpf,\n           vector<int32_t>& mu,\n           int threads)\n{\n  int64_t limit = x \/ y + 1;\n  threads = validate_threads(threads, limit);\n\n  int64_t S2_total = 0;\n  int64_t segment_size = next_power_of_2(isqrt(limit));\n  int64_t segments = (limit + segment_size - 1) \/ segment_size;\n  threads = in_between(1, threads, segments);\n  int64_t segments_per_thread = (segments + threads - 1) \/ threads;\n\n  vector<int32_t> pi = make_pi(y);\n  aligned_vector<vector<int64_t> > phi(threads);\n  aligned_vector<vector<int64_t> > mu_sum(threads);\n\n  #pragma omp parallel for num_threads(threads) reduction(+: S2_total)\n  for (int i = 0; i < threads; i++)\n    S2_total += S2_thread(x, y, c, segment_size, segments_per_thread,\n        i, limit, pi, primes, lpf, mu, mu_sum[i], phi[i]);\n\n  \/\/ Once all threads have finished reconstruct and add the\n  \/\/ missing contribution of all special leaves. This must\n  \/\/ be done in order as each thread (i) requires the sum of\n  \/\/ the phi values from the previous threads.\n  \/\/\n  for (int i = 1; i < threads; i++)\n  {\n    for (size_t j = 0; j < phi[i].size(); j++)\n    {\n      S2_total += phi[i - 1][j] * mu_sum[i][j];\n      phi[i][j] += phi[i - 1][j];\n    }\n  }\n\n  return S2_total;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\n\/\/\/ Calculate the number of primes below x using the\n\/\/\/ Lagarias-Miller-Odlyzko algorithm.\n\/\/\/ Run time: O(x^(2\/3)) operations, O(x^(1\/3) * log log x) space.\n\/\/\/\nint64_t pi_lmo_parallel1(int64_t x, int threads)\n{\n  if (x < 2)\n    return 0;\n\n  \/\/ alpha is a tuning factor\n  double alpha = in_between(1, log(log((double) x)) * 0.6, iroot<6>(x));\n  int64_t x13 = iroot<3>(x);\n  int64_t y = (int64_t) (x13 * alpha);\n\n  vector<int32_t> mu = make_moebius(y);\n  vector<int32_t> lpf = make_least_prime_factor(y);\n  vector<int32_t> primes;\n  primes.push_back(0);\n  primesieve::generate_primes(y, &primes);\n\n  int64_t pi_y = primes.size() - 1;\n  int64_t c = min<int64_t>(PhiTiny::MAX_A, pi_y);\n  int64_t s1 = S1(x, y, c, primes, lpf , mu);\n  int64_t s2 = S2(x, y, c, primes, lpf , mu, threads);\n  int64_t p2 = P2(x, y, threads);\n  int64_t phi = s1 + s2;\n  int64_t sum = phi + pi_y - 1 - p2;\n\n  return sum;\n}\n\n} \/\/ namespace primecount\n<|endoftext|>"}
{"text":"<commit_before>\n\/****************************************************************************\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 \"qgeoaddress.h\"\n#include \"qgeoaddress_p.h\"\n\n#ifdef QGEOADDRESS_DEBUG\n#include <QDebug>\n#endif\n\nQTM_BEGIN_NAMESPACE\n\nQGeoAddressPrivate::QGeoAddressPrivate()\n        : QSharedData()\n{\n}\n\nQGeoAddressPrivate::QGeoAddressPrivate(const QGeoAddressPrivate &other)\n        : QSharedData(other),\n        sCountry(other.sCountry),\n        sCountryCode(other.sCountryCode),\n        sState(other.sState),\n        sCounty(other.sCounty),\n        sCity(other.sCity),\n        sDistrict(other.sDistrict),\n        sStreet(other.sStreet),\n        sPostCode(other.sPostCode)\n{\n}\n\nQGeoAddressPrivate::~QGeoAddressPrivate()\n{\n}\n\n\/*!\n    \\class QGeoAddress\n    \\brief The QGeoAddress class represents an address\n\n    \\inmodule QtLocation\n\n    \\ingroup location\n\n    This class represents an address of a location.\n*\/\n\n\/*!\n    Default constructor.\n*\/\nQGeoAddress::QGeoAddress()\n        : d(new QGeoAddressPrivate)\n{\n}\n\n\/*!\n    Constructs a copy of \\a other.\n*\/\nQGeoAddress::QGeoAddress(const QGeoAddress &other)\n        : d(other.d)\n{\n}\n\n\/*!\n    Destroys this address.\n*\/\nQGeoAddress::~QGeoAddress()\n{\n}\n\n\/*!\n    Assigns the given \\a address to this address and\n    returns a reference to this address.\n*\/\nQGeoAddress &QGeoAddress::operator=(const QGeoAddress & address)\n{\n    d = address.d;\n    return *this;\n}\n\n\/*!\n    Returns true if this address is equal to \\a other,\n    otherwise returns false.\n*\/\nbool QGeoAddress::operator==(const QGeoAddress &other) const\n{\n#ifdef QGEOADDRESS_DEBUG\n    qDebug() << \"country\" << (d->sCountry == other.country());\n    qDebug() << \"countryCode\" << (d->sCountryCode == other.countryCode());\n    qDebug() << \"state:\" <<  (d->sState == other.state());\n    qDebug() << \"county:\" << (d->sCounty == other.county());\n    qDebug() << \"city:\" << (d->sCity == other.city());\n    qDebug() << \"district:\" << (d->sDistrict == other.district());\n    qDebug() << \"street:\" << (d->sStreet == other.street());\n    qDebug() << \"postcode:\" << (d->sPostCode == other.postcode());\n#endif\n\n    return d->sCountry == other.country() &&\n           d->sCountryCode == other.countryCode() &&\n           d->sState == other.state() &&\n           d->sCounty == other.county() &&\n           d->sCity == other.city() &&\n           d->sDistrict == other.district() &&\n           d->sStreet == other.street() &&\n           d->sPostCode == other.postcode();\n}\n\n\/*!\n    \\fn bool QGeoAddress::operator!=(const QGeoAddress &other) const\n\n    Returns true if this address is not equal to \\a other,\n    otherwise returns false.\n*\/\n\n\/*!\n    Returns the country name according to ISO 3166-1 alpha-3\n*\/\nQString QGeoAddress::country() const\n{\n    return d->sCountry;\n}\n\n\/*!\n    Sets the \\a country name according to ISO 3166-1 alpha-3\n*\/\nvoid QGeoAddress::setCountry(const QString &country)\n{\n    d->sCountry = country;\n}\n\n\/*!\n    Returns the country code according to ISO 3166-1 alpha-3\n*\/\nQString QGeoAddress::countryCode() const\n{\n    return d->sCountryCode;\n}\n\n\/*!\n    Sets the \\a countryCode according to ISO 3166-1 alpha-3\n*\/\nvoid QGeoAddress::setCountryCode(const QString &countryCode)\n{\n    d->sCountryCode = countryCode;\n}\n\n\/*!\n    Returns the state.\n*\/\nQString QGeoAddress::state() const\n{\n    return d->sState;\n}\n\n\/*!\n    Sets the \\a state.\n*\/\nvoid QGeoAddress::setState(const QString &state)\n{\n    d->sState = state;\n}\n\n\/*!\n    Returns the county.\n*\/\nQString QGeoAddress::county() const\n{\n    return d->sCounty;\n}\n\n\/*!\n    Sets the \\a county.\n*\/\nvoid QGeoAddress::setCounty(const QString &county)\n{\n    d->sCounty = county;\n}\n\n\/*!\n    Returns the city.\n*\/\nQString QGeoAddress::city() const\n{\n    return d->sCity;\n}\n\n\/*!\n    Sets the \\a city.\n*\/\nvoid QGeoAddress::setCity(const QString &city)\n{\n    d->sCity = city;\n}\n\n\/*!\n    Returns the district.\n*\/\nQString QGeoAddress::district() const\n{\n    return d->sDistrict;\n}\n\n\/*!\n    Sets the \\a district.\n*\/\nvoid QGeoAddress::setDistrict(const QString &district)\n{\n    d->sDistrict = district;\n}\n\n\/*!\n    Returns the street-level component of the address.\n\n    This typically includes a street number and street name\n    but may also contain things like a unit number, a building\n    name, or anything else that might be used to\n    distinguish one address from another.\n*\/\nQString QGeoAddress::street() const\n{\n    return d->sStreet;\n}\n\n\/*!\n    Sets the street-level component of the address to \\a street.\n\n    This typically includes a street number and street name\n    but may also contain things like a unit number, a building\n    name, or anything else that might be used to\n    distinguish one address from another.\n*\/\nvoid QGeoAddress::setStreet(const QString &street)\n{\n    d->sStreet = street;\n}\n\n\/*!\n    Returns the post code.\n*\/\nQString QGeoAddress::postcode() const\n{\n    return d->sPostCode;\n}\n\n\/*!\n    Sets the \\a postcode.\n*\/\nvoid QGeoAddress::setPostcode(const QString &postcode)\n{\n    d->sPostCode = postcode;\n}\n\n\/*!\n    Returns whether this address is empty. An address is considered empty\n    if \\i all of its fields are empty.\n*\/\nbool QGeoAddress::isEmpty() const\n{\n    return d->sCountry.isEmpty() &&\n           d->sCountryCode.isEmpty() &&\n           d->sState.isEmpty() &&\n           d->sCounty.isEmpty() &&\n           d->sCity.isEmpty() &&\n           d->sDistrict.isEmpty() &&\n           d->sStreet.isEmpty() &&\n           d->sPostCode.isEmpty();\n}\n\/*!\n    Clears the all the address' data fields.\n*\/\nvoid QGeoAddress::clear()\n{\n    d->sCountry.clear();\n    d->sCountryCode.clear();\n    d->sState.clear();\n    d->sCounty.clear();\n    d->sCity.clear();\n    d->sDistrict.clear();\n    d->sStreet.clear();\n    d->sPostCode.clear();\n}\n\nQTM_END_NAMESPACE\n\n<commit_msg>Fix documentation<commit_after>\n\/****************************************************************************\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 \"qgeoaddress.h\"\n#include \"qgeoaddress_p.h\"\n\n#ifdef QGEOADDRESS_DEBUG\n#include <QDebug>\n#endif\n\nQTM_BEGIN_NAMESPACE\n\nQGeoAddressPrivate::QGeoAddressPrivate()\n        : QSharedData()\n{\n}\n\nQGeoAddressPrivate::QGeoAddressPrivate(const QGeoAddressPrivate &other)\n        : QSharedData(other),\n        sCountry(other.sCountry),\n        sCountryCode(other.sCountryCode),\n        sState(other.sState),\n        sCounty(other.sCounty),\n        sCity(other.sCity),\n        sDistrict(other.sDistrict),\n        sStreet(other.sStreet),\n        sPostCode(other.sPostCode)\n{\n}\n\nQGeoAddressPrivate::~QGeoAddressPrivate()\n{\n}\n\n\/*!\n    \\class QGeoAddress\n    \\brief The QGeoAddress class represents an address\n\n    \\inmodule QtLocation\n\n    \\ingroup location\n\n    This class represents an address of a location.\n*\/\n\n\/*!\n    Default constructor.\n*\/\nQGeoAddress::QGeoAddress()\n        : d(new QGeoAddressPrivate)\n{\n}\n\n\/*!\n    Constructs a copy of \\a other.\n*\/\nQGeoAddress::QGeoAddress(const QGeoAddress &other)\n        : d(other.d)\n{\n}\n\n\/*!\n    Destroys this address.\n*\/\nQGeoAddress::~QGeoAddress()\n{\n}\n\n\/*!\n    Assigns the given \\a address to this address and\n    returns a reference to this address.\n*\/\nQGeoAddress &QGeoAddress::operator=(const QGeoAddress & address)\n{\n    d = address.d;\n    return *this;\n}\n\n\/*!\n    Returns true if this address is equal to \\a other,\n    otherwise returns false.\n*\/\nbool QGeoAddress::operator==(const QGeoAddress &other) const\n{\n#ifdef QGEOADDRESS_DEBUG\n    qDebug() << \"country\" << (d->sCountry == other.country());\n    qDebug() << \"countryCode\" << (d->sCountryCode == other.countryCode());\n    qDebug() << \"state:\" <<  (d->sState == other.state());\n    qDebug() << \"county:\" << (d->sCounty == other.county());\n    qDebug() << \"city:\" << (d->sCity == other.city());\n    qDebug() << \"district:\" << (d->sDistrict == other.district());\n    qDebug() << \"street:\" << (d->sStreet == other.street());\n    qDebug() << \"postcode:\" << (d->sPostCode == other.postcode());\n#endif\n\n    return d->sCountry == other.country() &&\n           d->sCountryCode == other.countryCode() &&\n           d->sState == other.state() &&\n           d->sCounty == other.county() &&\n           d->sCity == other.city() &&\n           d->sDistrict == other.district() &&\n           d->sStreet == other.street() &&\n           d->sPostCode == other.postcode();\n}\n\n\/*!\n    \\fn bool QGeoAddress::operator!=(const QGeoAddress &other) const\n\n    Returns true if this address is not equal to \\a other,\n    otherwise returns false.\n*\/\n\n\/*!\n    Returns the country name.\n*\/\nQString QGeoAddress::country() const\n{\n    return d->sCountry;\n}\n\n\/*!\n    Sets the \\a country name.\n*\/\nvoid QGeoAddress::setCountry(const QString &country)\n{\n    d->sCountry = country;\n}\n\n\/*!\n    Returns the country code according to ISO 3166-1 alpha-3\n*\/\nQString QGeoAddress::countryCode() const\n{\n    return d->sCountryCode;\n}\n\n\/*!\n    Sets the \\a countryCode according to ISO 3166-1 alpha-3\n*\/\nvoid QGeoAddress::setCountryCode(const QString &countryCode)\n{\n    d->sCountryCode = countryCode;\n}\n\n\/*!\n    Returns the state.\n*\/\nQString QGeoAddress::state() const\n{\n    return d->sState;\n}\n\n\/*!\n    Sets the \\a state.\n*\/\nvoid QGeoAddress::setState(const QString &state)\n{\n    d->sState = state;\n}\n\n\/*!\n    Returns the county.\n*\/\nQString QGeoAddress::county() const\n{\n    return d->sCounty;\n}\n\n\/*!\n    Sets the \\a county.\n*\/\nvoid QGeoAddress::setCounty(const QString &county)\n{\n    d->sCounty = county;\n}\n\n\/*!\n    Returns the city.\n*\/\nQString QGeoAddress::city() const\n{\n    return d->sCity;\n}\n\n\/*!\n    Sets the \\a city.\n*\/\nvoid QGeoAddress::setCity(const QString &city)\n{\n    d->sCity = city;\n}\n\n\/*!\n    Returns the district.\n*\/\nQString QGeoAddress::district() const\n{\n    return d->sDistrict;\n}\n\n\/*!\n    Sets the \\a district.\n*\/\nvoid QGeoAddress::setDistrict(const QString &district)\n{\n    d->sDistrict = district;\n}\n\n\/*!\n    Returns the street-level component of the address.\n\n    This typically includes a street number and street name\n    but may also contain things like a unit number, a building\n    name, or anything else that might be used to\n    distinguish one address from another.\n*\/\nQString QGeoAddress::street() const\n{\n    return d->sStreet;\n}\n\n\/*!\n    Sets the street-level component of the address to \\a street.\n\n    This typically includes a street number and street name\n    but may also contain things like a unit number, a building\n    name, or anything else that might be used to\n    distinguish one address from another.\n*\/\nvoid QGeoAddress::setStreet(const QString &street)\n{\n    d->sStreet = street;\n}\n\n\/*!\n    Returns the post code.\n*\/\nQString QGeoAddress::postcode() const\n{\n    return d->sPostCode;\n}\n\n\/*!\n    Sets the \\a postcode.\n*\/\nvoid QGeoAddress::setPostcode(const QString &postcode)\n{\n    d->sPostCode = postcode;\n}\n\n\/*!\n    Returns whether this address is empty. An address is considered empty\n    if \\i all of its fields are empty.\n*\/\nbool QGeoAddress::isEmpty() const\n{\n    return d->sCountry.isEmpty() &&\n           d->sCountryCode.isEmpty() &&\n           d->sState.isEmpty() &&\n           d->sCounty.isEmpty() &&\n           d->sCity.isEmpty() &&\n           d->sDistrict.isEmpty() &&\n           d->sStreet.isEmpty() &&\n           d->sPostCode.isEmpty();\n}\n\/*!\n    Clears the all the address' data fields.\n*\/\nvoid QGeoAddress::clear()\n{\n    d->sCountry.clear();\n    d->sCountryCode.clear();\n    d->sState.clear();\n    d->sCounty.clear();\n    d->sCity.clear();\n    d->sDistrict.clear();\n    d->sStreet.clear();\n    d->sPostCode.clear();\n}\n\nQTM_END_NAMESPACE\n\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); \/\/ TODO: Esto debería ser parser->build()\n\n\taddSpriteSheet(\"agua\", \"resources\/\/agua.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT,  1, 0, 0);\n\taddSpriteSheet(\"pasto\", \"resources\/\/pasto_largo.png\", 0, 5, TILE_HEIGHT_DEFAULT+5, TILE_WIDTH_DEFAULT, 1, 0, 0);\n\taddSpriteSheet(\"piedra\", \"resources\/\/piedra.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT, 1, 0, 0);\n\taddSpriteSheet(\"chancho\", \"resources\/\/chanchos.png\", -14, 32, 44, 48, 15, 0, 1);\n\taddSpriteSheet(\"mago\", \"resources\/\/mago.png\", 0, 0, 60, 60, 4, 0, 0);\n}\n\nvoid GameWindow::update(){\n\tmodel->update();\n\treturn;\n}\n\nvoid GameWindow::addSpriteSheet(std::string name, std::string pPath, int pixelRefX, int pixelRefY, int altoSprite, int anchoSprite, int cantSprites, int fps, int delay) {\n\tspritesSheets[name] = new SpriteSheet(pPath, pixelRefX, pixelRefY, altoSprite, anchoSprite, cantSprites, fps, delay, *this);\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<commit_msg>Centro el mago<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); \/\/ TODO: Esto debería ser parser->build()\n\n\taddSpriteSheet(\"agua\", \"resources\/\/agua.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT,  1, 0, 0);\n\taddSpriteSheet(\"pasto\", \"resources\/\/pasto_largo.png\", 0, 5, TILE_HEIGHT_DEFAULT+5, TILE_WIDTH_DEFAULT, 1, 0, 0);\n\taddSpriteSheet(\"piedra\", \"resources\/\/piedra.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT, 1, 0, 0);\n\taddSpriteSheet(\"chancho\", \"resources\/\/chanchos.png\", -14, 32, 44, 48, 15, 0, 1);\n\taddSpriteSheet(\"mago\", \"resources\/\/mago.png\", 0, 48, 60, 60, 4, 0, 0);\n}\n\nvoid GameWindow::update(){\n\tmodel->update();\n\treturn;\n}\n\nvoid GameWindow::addSpriteSheet(std::string name, std::string pPath, int pixelRefX, int pixelRefY, int altoSprite, int anchoSprite, int cantSprites, int fps, int delay) {\n\tspritesSheets[name] = new SpriteSheet(pPath, pixelRefX, pixelRefY, altoSprite, anchoSprite, cantSprites, fps, delay, *this);\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>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/pm\/p9_pm_utils.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\/\/\/ @file p9_pm_utils.C\n\/\/\/ @brief Utility functions for PM FAPIs\n\/\/\/\n\n\/\/ *HWP HWP Owner       : Amit Kumar <akumar3@us.ibm.com>\n\/\/ *HWP Backup HWP Owner: Greg Still <stillgs@us.ibm.com>\n\/\/ *HWP FW Owner        : Bilicon Patil <bilpatil@in.ibm.com>\n\/\/ *HWP Team            : PM\n\/\/ *HWP Level           : 1\n\/\/ *HWP Consumed by     : HS\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Includes\n\/\/ ----------------------------------------------------------------------\n#include <p9_pm.H>\n#include <p9_pm_utils.H>\n#include <p9_const_common.H>\n\n\/\/\/ Byte-reverse a 16-bit integer if on a little-endian machine\n\nuint16_t\nrevle16(const uint16_t i_x)\n{\n    uint16_t rx;\n\n#ifndef _BIG_ENDIAN\n    uint8_t* pix = (uint8_t*)(&i_x);\n    uint8_t* prx = (uint8_t*)(&rx);\n\n    prx[0] = pix[1];\n    prx[1] = pix[0];\n#else\n    rx = i_x;\n#endif\n\n    return rx;\n}\n\n\/\/\/ Byte-reverse a 32-bit integer if on a little-endian machine\n\nuint32_t\nrevle32(const uint32_t i_x)\n{\n    uint32_t rx;\n\n#ifndef _BIG_ENDIAN\n    uint8_t* pix = (uint8_t*)(&i_x);\n    uint8_t* prx = (uint8_t*)(&rx);\n\n    prx[0] = pix[3];\n    prx[1] = pix[2];\n    prx[2] = pix[1];\n    prx[3] = pix[0];\n#else\n    rx = i_x;\n#endif\n\n    return rx;\n}\n\n\n\/\/\/ Byte-reverse a 64-bit integer if on a little-endian machine\n\nuint64_t\nrevle64(const uint64_t i_x)\n{\n    uint64_t rx;\n\n#ifndef _BIG_ENDIAN\n    uint8_t* pix = (uint8_t*)(&i_x);\n    uint8_t* prx = (uint8_t*)(&rx);\n\n    prx[0] = pix[7];\n    prx[1] = pix[6];\n    prx[2] = pix[5];\n    prx[3] = pix[4];\n    prx[4] = pix[3];\n    prx[5] = pix[2];\n    prx[6] = pix[1];\n    prx[7] = pix[0];\n#else\n    rx = i_x;\n#endif\n\n    return rx;\n}\n\nfapi2::ReturnCode p9_pm_glob_fir_trace(\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target,\n    const char* i_msg)\n{\n    FAPI_INF(\"p9_pm_glob_fir_trace Enter\");\n\n#if 0 \/\/ The CONST_UINT64_T definition in P9 const_common.H takes 4 arguments -\n    \/\/ CONST_UINT64_T(name, expr, unit, meth). Need to figure out the values\n    \/\/ for \"unit\" and \"meth\" for the below declarations.\n    CONST_UINT64_T( GLOB_XSTOP_FIR_0x01040000, ULL(0x01040000) );\n    CONST_UINT64_T( GLOB_RECOV_FIR_0x01040001, ULL(0x01040001) );\n    CONST_UINT64_T( TP_LFIR_0x0104000A, ULL(0x0104000A) );\n#endif\n\n    \/\/  Note: i_msg is put on on each record to allow for trace \"greps\"\n    \/\/  so as to see the \"big picture\" across when\n\n    uint8_t l_traceEnFlag = false;\n    const fapi2::Target<fapi2::TARGET_TYPE_SYSTEM> FAPI_SYSTEM;\n    fapi2::buffer<uint64_t> l_data64;\n\n#if 0 \/\/ Uncomment when attribute ATTR_PM_GLOBAL_FIR_TRACE_EN is ready\n    FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_PM_GLOBAL_FIR_TRACE_EN,\n                           FAPI_SYSTEM,\n                           l_traceEnFlag),\n             \"FAPI_ATTR_GET for attribute ATTR_PM_GLOBAL_FIR_TRACE_EN\");\n#endif\n\n    \/\/ Continue if trace is enabled.\n    if (false == l_traceEnFlag)\n    {\n        goto fapi_try_exit;\n    }\n\n    \/\/  ******************************************************************\n    \/\/  Check for xstops and recoverables and put in the trace\n    \/\/  ******************************************************************\n    {\n#if 0 \/\/ Uncomment when the scom address is defined\n        FAPI_TRY(fapi2::getScom(i_target,\n                                READ_GLOBAL_XSTOP_FIR_0x570F001B,\n                                l_data64));\n#endif\n\n        if(l_data64)\n        {\n            FAPI_INF(\"Xstop is **ACTIVE** %s\", i_msg);\n        }\n    }\n\n    {\n#if 0 \/\/ Uncomment when the scom address is defined\n        FAPI_TRY(fapi2::getScom(i_target,\n                                READ_GLOBAL_RECOV_FIR_0x570F001C,\n                                l_data64));\n#endif\n\n        if(l_data64)\n        {\n            FAPI_INF(\"Recoverable attention is **ACTIVE** %s\", i_msg);\n        }\n    }\n\n    {\n#if 0 \/\/ Uncomment when the scom address is defined\n        FAPI_TRY(fapi2::getScom(i_target,\n                                GLOB_XSTOP_FIR_0x01040000,\n                                l_data64));\n#endif\n\n        if(l_data64)\n        {\n            FAPI_INF(\"Glob Xstop FIR is **ACTIVE** %s\", i_msg);\n        }\n    }\n\n    {\n#if 0 \/\/ Uncomment when the scom address is defined\n        FAPI_TRY(fapi2::getScom(i_target,\n                                GLOB_RECOV_FIR_0x01040001,\n                                l_data64));\n#endif\n\n        if(l_data64)\n        {\n            FAPI_INF(\"Glob Recov FIR is **ACTIVE** %s\", i_msg);\n        }\n    }\n\n    {\n#if 0 \/\/ Uncomment when the scom address is defined\n        FAPI_TRY(fapi2::getScom(i_target,\n                                TP_LFIR_0x0104000A,\n                                l_data64));\n#endif\n\n        if(l_data64)\n        {\n            FAPI_INF(\"TP LFIR is **ACTIVE** %s\", i_msg);\n        }\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\nfapi2::ReturnCode special_wakeup_all(\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target,\n    const bool i_enable)\n{\n    FAPI_INF(\"special_wakeup_all Enter\");\n\n    fapi2::ReturnCode l_rc;\n    auto l_exChiplets = i_target.getChildren<fapi2::TARGET_TYPE_EX>\n                        (fapi2::TARGET_STATE_FUNCTIONAL);\n\n    \/\/ For each EX target\n    for (auto l_ex_chplt : l_exChiplets)\n    {\n        FAPI_DBG(\"Running special wakeup on ex chiplet 0x%08X \", l_ex_chplt);\n\n        FAPI_TRY( fapi2::specialWakeup( l_ex_chplt, i_enable ) );\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n<commit_msg>PM: p9_pm_init, p9_pm_utils clean-up<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_utils.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\/\/\/ @file p9_pm_utils.C\n\/\/\/ @brief Utility functions for PM FAPIs\n\/\/\/\n\n\/\/ *HWP HWP Owner       : Amit Kumar <akumar3@us.ibm.com>\n\/\/ *HWP Backup HWP Owner: Greg Still <stillgs@us.ibm.com>\n\/\/ *HWP FW Owner        : Bilicon Patil <bilpatil@in.ibm.com>\n\/\/ *HWP Team            : PM\n\/\/ *HWP Level           : 1\n\/\/ *HWP Consumed by     : HS\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Includes\n\/\/ ----------------------------------------------------------------------\n#include <p9_pm.H>\n#include <p9_pm_utils.H>\n#include <p9_const_common.H>\n#include <p9_perv_scom_addresses.H>\n\n\/\/\/ Byte-reverse a 16-bit integer if on a little-endian machine\n\nuint16_t\nrevle16(const uint16_t i_x)\n{\n    uint16_t rx;\n\n#ifndef _BIG_ENDIAN\n    uint8_t* pix = (uint8_t*)(&i_x);\n    uint8_t* prx = (uint8_t*)(&rx);\n\n    prx[0] = pix[1];\n    prx[1] = pix[0];\n#else\n    rx = i_x;\n#endif\n\n    return rx;\n}\n\n\/\/\/ Byte-reverse a 32-bit integer if on a little-endian machine\n\nuint32_t\nrevle32(const uint32_t i_x)\n{\n    uint32_t rx;\n\n#ifndef _BIG_ENDIAN\n    uint8_t* pix = (uint8_t*)(&i_x);\n    uint8_t* prx = (uint8_t*)(&rx);\n\n    prx[0] = pix[3];\n    prx[1] = pix[2];\n    prx[2] = pix[1];\n    prx[3] = pix[0];\n#else\n    rx = i_x;\n#endif\n\n    return rx;\n}\n\n\n\/\/\/ Byte-reverse a 64-bit integer if on a little-endian machine\n\nuint64_t\nrevle64(const uint64_t i_x)\n{\n    uint64_t rx;\n\n#ifndef _BIG_ENDIAN\n    uint8_t* pix = (uint8_t*)(&i_x);\n    uint8_t* prx = (uint8_t*)(&rx);\n\n    prx[0] = pix[7];\n    prx[1] = pix[6];\n    prx[2] = pix[5];\n    prx[3] = pix[4];\n    prx[4] = pix[3];\n    prx[5] = pix[2];\n    prx[6] = pix[1];\n    prx[7] = pix[0];\n#else\n    rx = i_x;\n#endif\n\n    return rx;\n}\n\nfapi2::ReturnCode p9_pm_glob_fir_trace(\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target,\n    const char* i_msg)\n{\n    FAPI_DBG(\">> p9_pm_glob_fir_trace\");\n\n    \/\/ Multicast read addresses\n    const uint64_t READ_GLOB_XSTOP_FIR_MC =  RULL(0x570F001C);\n    const uint64_t READ_GLOB_RECOV_FIR_MC =  RULL(0x570F001B);\n\n    \/\/  Note: i_msg is put on on each record to allow for trace \"greps\"\n    \/\/  so as to see the \"big picture\" across when\n    uint8_t l_traceEnFlag = false;\n    const fapi2::Target<fapi2::TARGET_TYPE_SYSTEM> FAPI_SYSTEM;\n    fapi2::buffer<uint64_t> l_data64;\n\n\n    FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_PM_GLOBAL_FIR_TRACE_EN,\n                           FAPI_SYSTEM,\n                           l_traceEnFlag),\n             \"FAPI_ATTR_GET for attribute ATTR_PM_GLOBAL_FIR_TRACE_EN\");\n\n    \/\/ Continue if trace is enabled.\n    if (!l_traceEnFlag)\n    {\n        goto fapi_try_exit;\n    }\n\n    \/\/  ******************************************************************\n    \/\/  Check for xstops and recoverables and put in the trace\n    \/\/  ******************************************************************\n    {\n        FAPI_TRY(fapi2::getScom(i_target,\n                                READ_GLOB_XSTOP_FIR_MC,\n                                l_data64));\n\n        if(l_data64)\n        {\n            FAPI_INF(\"Xstop is **ACTIVE** %s\", i_msg);\n        }\n    }\n\n    {\n        FAPI_TRY(fapi2::getScom(i_target,\n                                READ_GLOB_RECOV_FIR_MC,\n                                l_data64));\n\n        if(l_data64)\n        {\n            FAPI_INF(\"Recoverable attention is **ACTIVE** %s\", i_msg);\n        }\n    }\n\n    {\n        FAPI_TRY(fapi2::getScom(i_target,\n                                PERV_TP_XFIR,\n                                l_data64));\n\n        if(l_data64)\n        {\n            FAPI_INF(\"Glob Xstop FIR is **ACTIVE** %s\", i_msg);\n        }\n    }\n\n    {\n        FAPI_TRY(fapi2::getScom(i_target,\n                                PERV_TP_RFIR,\n                                l_data64));\n\n        if(l_data64)\n        {\n            FAPI_INF(\"Glob Recov FIR is **ACTIVE** %s\", i_msg);\n        }\n    }\n\n    {\n        FAPI_TRY(fapi2::getScom(i_target,\n                                PERV_TP_LOCAL_FIR,\n                                l_data64));\n\n        if(l_data64)\n        {\n            FAPI_INF(\"TP LFIR is **ACTIVE** %s\", i_msg);\n        }\n    }\n\nfapi_try_exit:\n    FAPI_DBG(\"<< p9_pm_glob_fir_trace\");\n    return fapi2::current_err;\n}\n\nfapi2::ReturnCode special_wakeup_all(\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target,\n    const bool i_enable)\n{\n    FAPI_DBG(\">> special_wakeup_all\");\n\n    fapi2::ReturnCode l_rc;\n    auto l_exChiplets = i_target.getChildren<fapi2::TARGET_TYPE_EX>\n                        (fapi2::TARGET_STATE_FUNCTIONAL);\n\n    \/\/ For each EX target\n    for (auto l_ex_chplt : l_exChiplets)\n    {\n        fapi2::ATTR_CHIP_UNIT_POS_Type l_ex_num;\n        FAPI_TRY(FAPI_ATTR_GET( fapi2::ATTR_CHIP_UNIT_POS,\n                                l_ex_chplt,\n                                l_ex_num));\n        FAPI_DBG(\"Running special wakeup on ex chiplet 0x%08X \", l_ex_num);\n\n        FAPI_TRY( fapi2::specialWakeup( l_ex_chplt, i_enable ) );\n    }\n\nfapi_try_exit:\n    FAPI_DBG(\"<< special_wakeup_all\");\n    return fapi2::current_err;\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 \"depth-to-rgb-calibration.h\"\n#include <librealsense2\/rs.hpp>\n#include \"core\/streaming.h\"\n#include \"calibrated-sensor.h\"\n#include \"context.h\"\n#include \"api.h\"  \/\/ VALIDATE_INTERFACE_NO_THROW\n#include \"algo\/depth-to-rgb-calibration\/debug.h\"\n#include \"l500\/l500-device.h\"\n#include \"l500\/l500-color.h\"\n#include \"algo\/depth-to-rgb-calibration\/utils.h\"\n\nusing namespace librealsense;\nnamespace impl = librealsense::algo::depth_to_rgb_calibration;\nnamespace thermal = librealsense::algo::thermal_loop;\n\n#define CHECK_IF_NEEDS_TO_STOP() if (_should_continue) _should_continue()\n\ndepth_to_rgb_calibration::depth_to_rgb_calibration(\n    impl::optimizer::settings const & settings,\n    rs2::frame depth,\n    rs2::frame ir,\n    rs2::frame yuy,\n    rs2::frame prev_yuy,\n    std::vector< impl::yuy_t > const & last_yuy_data,\n    impl::algo_calibration_info const & cal_info,\n    impl::algo_calibration_registers const & cal_regs,\n    rs2_intrinsics yuy_intrinsics,\n    thermal::thermal_calibration_table_interface const & thermal_table,\n    std::function<void()> should_continue\n)\n    : _algo( settings )\n    , _raw_intr( yuy_intrinsics )\n    , _thermal_intr( _raw_intr )\n    , _extr(to_raw_extrinsics( depth.get_profile().get_extrinsics_to( yuy.get_profile() )))\n    , _from( depth.get_profile().get()->profile )\n    , _to( yuy.get_profile().get()->profile )\n    , _should_continue( should_continue )\n    , _thermal_table( thermal_table )\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    if( last_yuy_data.size() == yuy.get_data_size() \/ sizeof( impl::yuy_t ) )\n        _last_successful_frame_data = last_yuy_data;  \/\/ copy -- will be moved to algo\n    else if( ! last_yuy_data.empty() )\n        AC_LOG( DEBUG, \"Not using last successfully-calibrated scene: it's of a different resolution\" );\n\n    auto scale = thermal_table.get_thermal_scale( settings.hum_temp );\n    AC_LOG( DEBUG, \"    scaling K_rgb by \" << scale );\n    _thermal_intr.fx = float( _thermal_intr.fx * scale );\n    _thermal_intr.fy = float( _thermal_intr.fy * scale );\n\n    impl::calib calibration( _thermal_intr, _extr );\n\n    CHECK_IF_NEEDS_TO_STOP();\n\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        std::move( _last_successful_frame_data ),\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\n    CHECK_IF_NEEDS_TO_STOP();\n\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    CHECK_IF_NEEDS_TO_STOP();\n\n    auto si = ((frame_interface *) depth.get() )->get_sensor();\n    auto cs = VALIDATE_INTERFACE_NO_THROW( si, librealsense::calibrated_sensor );\n    if( !cs )\n    {\n        \/\/ We can only calibrate depth sensors that supply this interface!\n        throw librealsense::not_implemented_exception( \"the depth frame supplied is not from a calibrated_sensor\" );\n    }\n    _dsm_params = cs->get_dsm_params();\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\n    CHECK_IF_NEEDS_TO_STOP();\n\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(), _dsm_params, cal_info, cal_regs,\n        depth.as< rs2::depth_frame >().get_units() * 1000.f   \/\/ same scaling as for extrinsics!\n    );\n\n    debug_calibration( \"old\" );\n}\n\n\nvoid depth_to_rgb_calibration::write_data_to( std::string const & dir )\n{\n    _algo.write_data_to( dir );\n\n    impl::write_to_file( &_raw_intr, sizeof( _raw_intr ), dir, \"raw_rgb.intrinsics\" );\n\n    impl::write_vector_to_file( _thermal_table.build_raw_data(), dir, \"rgb_thermal_table\" );\n}\n\n\nrs2_calibration_status depth_to_rgb_calibration::optimize(\n    std::function<void( rs2_calibration_status )> call_back\n)\n{\n#define DISABLE_RS2_CALIBRATION_CHECKS \"RS2_AC_DISABLE_RETRIES\"\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            call_back( RS2_CALIBRATION_SCENE_INVALID );\n            if( !getenv( DISABLE_RS2_CALIBRATION_CHECKS ) )\n            {\n                \/\/ Default behavior is to stop AC and trigger a retry\n                return RS2_CALIBRATION_RETRY;\n            }\n            if( getenv( \"RS2_AC_INVALID_SCENE_FAIL\" ) )\n            {\n                \/\/ Here we don't want a retry, but we also do not want the calibration\n                \/\/ to possibly be successful -- fail it\n                AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is on but so is RS2_AC_INVALID_SCENE_FAIL: fail!\" );\n                return RS2_CALIBRATION_FAILED;\n            }\n            AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is on; continuing\" );\n        }\n\n        CHECK_IF_NEEDS_TO_STOP();\n\n\n        AC_LOG( DEBUG, \"Optimizing\" );\n\n        _algo.optimize(\n            [&]( impl::data_collect const & data ) { CHECK_IF_NEEDS_TO_STOP(); }\n        );\n\n        AC_LOG( DEBUG, \"Checking result validity\" );\n        if( !_algo.is_valid_results() )\n        {\n            \/\/ Error would have printed inside\n            call_back( RS2_CALIBRATION_BAD_RESULT );\n            if( !getenv( DISABLE_RS2_CALIBRATION_CHECKS ) )\n            {\n                \/\/ Default behavior is to stop and trigger a retry\n                AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is off; will retry if possible\" );\n                return RS2_CALIBRATION_RETRY;\n            }\n            if( !getenv( \"RS2_AC_FORCE_BAD_RESULT\" ) )\n            {\n                \/\/ This is mostly for validation use, where we don't want the retries and instead want\n                \/\/ to fail on bad results (we don't want to write bad results to the camera!)\n                AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is on; no retries\" );\n                return RS2_CALIBRATION_FAILED;\n            }\n            \/\/ Allow forcing of results... be careful! This may damage the camera in AC2!\n            AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is on but so is RS2_AC_FORCE_BAD_RESULT: results will be used!\" );\n        }\n\n        \/\/ AC_LOG( INFO, \"Calibration finished; original cost= \" << original_cost << \"  optimized\n        \/\/ cost= \" << params_curr.cost );\n\n        AC_LOG( DEBUG, \"Optimization successful!\" );\n        _thermal_intr = _algo.get_calibration().get_intrinsics();\n        _thermal_intr.model = RS2_DISTORTION_INVERSE_BROWN_CONRADY;  \/\/ restore LRS model\n\n        \/\/ Override everything in the raw intrinsics except the focal length (fx and fy)\n        \/\/ TODO: AC is not \"supposed\" to change focal length, but we shouldn't assume this! The\n        \/\/ proper way to do the following is not by restoring the original, but rather by DEscaling\n        \/\/ the results from AC.\n        auto original_fx = _raw_intr.fx, original_fy = _raw_intr.fy;\n        _raw_intr = _thermal_intr; \n        _raw_intr.fx = original_fx;\n        _raw_intr.fy = original_fy;\n\n        _extr = from_raw_extrinsics( _algo.get_calibration().get_extrinsics() );\n        _dsm_params = _algo.get_dsm_params();\n        _last_successful_frame_data = _algo.get_yuy_data().orig_frame;  \/\/ copy -- will be moved to ac_trigger\n        debug_calibration( \"new\" );\n        return RS2_CALIBRATION_SUCCESSFUL;\n    }\n    catch( std::exception const & e )\n    {\n        AC_LOG( ERROR, \"Calibration threw error: \" << 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( INFO, AC_F_PREC << \"    \" << prefix << \"   th\" << _thermal_intr );\n    AC_LOG( INFO, AC_F_PREC << \"    \" << prefix << \"  raw\" << _raw_intr );\n    AC_LOG( INFO, AC_F_PREC << \"    \" << prefix << \" extr\" << _extr );\n    AC_LOG( INFO, AC_F_PREC << \"    \" << prefix << \"  dsm\" << _dsm_params );\n}\n\n<commit_msg>minor fix in kth debug messages<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 \"calibrated-sensor.h\"\n#include \"context.h\"\n#include \"api.h\"  \/\/ VALIDATE_INTERFACE_NO_THROW\n#include \"algo\/depth-to-rgb-calibration\/debug.h\"\n#include \"l500\/l500-device.h\"\n#include \"l500\/l500-color.h\"\n#include \"algo\/depth-to-rgb-calibration\/utils.h\"\n\nusing namespace librealsense;\nnamespace impl = librealsense::algo::depth_to_rgb_calibration;\nnamespace thermal = librealsense::algo::thermal_loop;\n\n#define CHECK_IF_NEEDS_TO_STOP() if (_should_continue) _should_continue()\n\ndepth_to_rgb_calibration::depth_to_rgb_calibration(\n    impl::optimizer::settings const & settings,\n    rs2::frame depth,\n    rs2::frame ir,\n    rs2::frame yuy,\n    rs2::frame prev_yuy,\n    std::vector< impl::yuy_t > const & last_yuy_data,\n    impl::algo_calibration_info const & cal_info,\n    impl::algo_calibration_registers const & cal_regs,\n    rs2_intrinsics yuy_intrinsics,\n    thermal::thermal_calibration_table_interface const & thermal_table,\n    std::function<void()> should_continue\n)\n    : _algo( settings )\n    , _raw_intr( yuy_intrinsics )\n    , _thermal_intr( _raw_intr )\n    , _extr(to_raw_extrinsics( depth.get_profile().get_extrinsics_to( yuy.get_profile() )))\n    , _from( depth.get_profile().get()->profile )\n    , _to( yuy.get_profile().get()->profile )\n    , _should_continue( should_continue )\n    , _thermal_table( thermal_table )\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    if( last_yuy_data.size() == yuy.get_data_size() \/ sizeof( impl::yuy_t ) )\n        _last_successful_frame_data = last_yuy_data;  \/\/ copy -- will be moved to algo\n    else if( ! last_yuy_data.empty() )\n        AC_LOG( DEBUG, \"Not using last successfully-calibrated scene: it's of a different resolution\" );\n\n    auto scale = thermal_table.get_thermal_scale( settings.hum_temp );\n    AC_LOG( DEBUG, \"    scaling K_rgb by \" << scale );\n    _thermal_intr.fx = float( _thermal_intr.fx * scale );\n    _thermal_intr.fy = float( _thermal_intr.fy * scale );\n\n    impl::calib calibration( _thermal_intr, _extr );\n\n    CHECK_IF_NEEDS_TO_STOP();\n\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        std::move( _last_successful_frame_data ),\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\n    CHECK_IF_NEEDS_TO_STOP();\n\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    CHECK_IF_NEEDS_TO_STOP();\n\n    auto si = ((frame_interface *) depth.get() )->get_sensor();\n    auto cs = VALIDATE_INTERFACE_NO_THROW( si, librealsense::calibrated_sensor );\n    if( !cs )\n    {\n        \/\/ We can only calibrate depth sensors that supply this interface!\n        throw librealsense::not_implemented_exception( \"the depth frame supplied is not from a calibrated_sensor\" );\n    }\n    _dsm_params = cs->get_dsm_params();\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\n    CHECK_IF_NEEDS_TO_STOP();\n\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(), _dsm_params, cal_info, cal_regs,\n        depth.as< rs2::depth_frame >().get_units() * 1000.f   \/\/ same scaling as for extrinsics!\n    );\n\n    debug_calibration( \"old\" );\n}\n\n\nvoid depth_to_rgb_calibration::write_data_to( std::string const & dir )\n{\n    _algo.write_data_to( dir );\n\n    impl::write_to_file( &_raw_intr, sizeof( _raw_intr ), dir, \"raw_rgb.intrinsics\" );\n\n    impl::write_vector_to_file( _thermal_table.build_raw_data(), dir, \"rgb_thermal_table\" );\n}\n\n\nrs2_calibration_status depth_to_rgb_calibration::optimize(\n    std::function<void( rs2_calibration_status )> call_back\n)\n{\n#define DISABLE_RS2_CALIBRATION_CHECKS \"RS2_AC_DISABLE_RETRIES\"\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            call_back( RS2_CALIBRATION_SCENE_INVALID );\n            if( !getenv( DISABLE_RS2_CALIBRATION_CHECKS ) )\n            {\n                \/\/ Default behavior is to stop AC and trigger a retry\n                return RS2_CALIBRATION_RETRY;\n            }\n            if( getenv( \"RS2_AC_INVALID_SCENE_FAIL\" ) )\n            {\n                \/\/ Here we don't want a retry, but we also do not want the calibration\n                \/\/ to possibly be successful -- fail it\n                AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is on but so is RS2_AC_INVALID_SCENE_FAIL: fail!\" );\n                return RS2_CALIBRATION_FAILED;\n            }\n            AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is on; continuing\" );\n        }\n\n        CHECK_IF_NEEDS_TO_STOP();\n\n\n        AC_LOG( DEBUG, \"Optimizing\" );\n\n        _algo.optimize(\n            [&]( impl::data_collect const & data ) { CHECK_IF_NEEDS_TO_STOP(); }\n        );\n\n        AC_LOG( DEBUG, \"Checking result validity\" );\n        if( !_algo.is_valid_results() )\n        {\n            \/\/ Error would have printed inside\n            call_back( RS2_CALIBRATION_BAD_RESULT );\n            if( !getenv( DISABLE_RS2_CALIBRATION_CHECKS ) )\n            {\n                \/\/ Default behavior is to stop and trigger a retry\n                AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is off; will retry if possible\" );\n                return RS2_CALIBRATION_RETRY;\n            }\n            if( !getenv( \"RS2_AC_FORCE_BAD_RESULT\" ) )\n            {\n                \/\/ This is mostly for validation use, where we don't want the retries and instead want\n                \/\/ to fail on bad results (we don't want to write bad results to the camera!)\n                AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is on; no retries\" );\n                return RS2_CALIBRATION_FAILED;\n            }\n            \/\/ Allow forcing of results... be careful! This may damage the camera in AC2!\n            AC_LOG( DEBUG, DISABLE_RS2_CALIBRATION_CHECKS << \" is on but so is RS2_AC_FORCE_BAD_RESULT: results will be used!\" );\n        }\n\n        \/\/ AC_LOG( INFO, \"Calibration finished; original cost= \" << original_cost << \"  optimized\n        \/\/ cost= \" << params_curr.cost );\n\n        AC_LOG( DEBUG, \"Optimization successful!\" );\n        _thermal_intr = _algo.get_calibration().get_intrinsics();\n        _thermal_intr.model = RS2_DISTORTION_INVERSE_BROWN_CONRADY;  \/\/ restore LRS model\n\n        \/\/ Override everything in the raw intrinsics except the focal length (fx and fy)\n        \/\/ TODO: AC is not \"supposed\" to change focal length, but we shouldn't assume this! The\n        \/\/ proper way to do the following is not by restoring the original, but rather by DEscaling\n        \/\/ the results from AC.\n        auto original_fx = _raw_intr.fx, original_fy = _raw_intr.fy;\n        _raw_intr = _thermal_intr; \n        _raw_intr.fx = original_fx;\n        _raw_intr.fy = original_fy;\n\n        _extr = from_raw_extrinsics( _algo.get_calibration().get_extrinsics() );\n        _dsm_params = _algo.get_dsm_params();\n        _last_successful_frame_data = _algo.get_yuy_data().orig_frame;  \/\/ copy -- will be moved to ac_trigger\n        debug_calibration( \"new\" );\n        return RS2_CALIBRATION_SUCCESSFUL;\n    }\n    catch( std::exception const & e )\n    {\n        AC_LOG( ERROR, \"Calibration threw error: \" << 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, AC_F_PREC << \"    \" << prefix << \"   th\" << _thermal_intr );\n    AC_LOG( DEBUG, AC_F_PREC << \"    \" << prefix << \"  raw\" << _raw_intr );\n    AC_LOG( DEBUG, AC_F_PREC << \"    \" << prefix << \" extr\" << _extr );\n    AC_LOG( DEBUG, AC_F_PREC << \"    \" << prefix << \"  dsm\" << _dsm_params );\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#include \"stdsneezy.h\"\n#include \"obj_pool.h\"\n#include \"liquids.h\"\n\n\nvoid TPool::overFlow()\n{\n  int index=getDrinkIndex(), total=0, amt=0;\n  TRoom *rp=NULL;\n  TPool *pool;\n  bool valid;\n\n  \/\/ should make a structure for this but I'm in a hurry\n  vector<TRoom *>rooms;\n  vector<dirTypeT>roomdirs;\n  vector<int>roomamts;\n\n  if(!roomp)\n    return;\n\n  if(index>=9){\n    \/\/ check every exit\n    for(dirTypeT dir=MIN_DIR;dir<MAX_DIR;dir++){\n      \/\/ liquid doesn't flow up\n      if(dir==DIR_UP)\n\tcontinue;\n      \n      \/\/ eligible exit\n      if(exitDir(dir) && real_roomp(exitDir(dir)->to_room) &&\n\t !(exitDir(dir)->condition & EX_CLOSED) &&\n\t (rp = real_roomp(roomp->exitDir(dir)->to_room))){\n\t\/\/ check each item\n\tvalid=true;\n\tamt=0;\n\tfor(TThing *t=rp->getStuff();t;t=t->nextThing){\n\t  \/\/ check pools that are the same type and less than half my size\n\t  if((pool=dynamic_cast<TPool *>(t)) && \n\t     pool->getDrinkType()==getDrinkType()){\n\t    if(pool->getDrinkUnits() >= (getDrinkUnits()\/2)){\n\t      valid=false;\n\t    } else {\n\t      total+=pool->getDrinkUnits();\n\t      amt=pool->getDrinkUnits();\n\t    }\n\t  }\n\t}\n\tif(valid){\n\t  rooms.push_back(rp);\n\t  roomdirs.push_back(dir);\n\t  roomamts.push_back(amt);\n\t}\n      }\n    }\n\n    \/\/ no rooms to flow into, we're the smallest pool\n    if(!rooms.size())\n      return;\n\n    total+=(int)((float)getDrinkUnits() * 0.60);\n    setDrinkUnits((int)((float)getDrinkUnits() * 0.40));\n\n    total\/=rooms.size();\n\n    sendrpf(COLOR_BASIC, roomp, \n\t    \"Some %s flows outward into surrounding rooms.\\n\\r\",\n\t    liquidInfo[getDrinkType()]->name);\n\n    for(unsigned int i=0;i<rooms.size();++i){\n      rooms[i]->dropPool(total-roomamts[i], getDrinkType());\n      sendrpf(COLOR_BASIC, rooms[i], \n\t      \"Some %s flows in from the %s.\\n\\r\",\n\t      liquidInfo[getDrinkType()]->name,\n\t      dirs[rev_dir[roomdirs[i]]]);\n    }\n\n    roomp->saveItems(\"\");\n    rp->saveItems(\"\");\n  }\n}\n\n\nvoid TPool::doMerge()\n{\n  TPool *pool;\n  TThing *t, *t2;\n\n  if(!roomp)\n    return;\n\n  for(t=roomp->getStuff();t;t=t2){\n    t2=t->nextThing;\n    \n    if((pool=dynamic_cast<TPool *>(t)) && pool != this && \n       pool->getDrinkType()==getDrinkType()){\n      \/\/ merge!\n      addToDrinkUnits(pool->getDrinkUnits());\n      --(*pool);\n      delete pool;\n    }\n  }\n}\n\nvoid TPool::setDrinkUnits(int n)\n{\n  setMaxDrinkUnits(n);\n  TBaseCup::setDrinkUnits(n);\n  setVolume((int)(getVolume() + (getDrinkUnits() * SIP_VOLUME)));\n  weightChangeObject(0);\n  updateDesc();\n  obj_flags.decay_time=getDrinkUnits();\n}\n\nvoid TPool::addToDrinkUnits(int n)\n{\n  addToMaxDrinkUnits(n);\n  TBaseCup::addToDrinkUnits(n);\n  setVolume((int)(getVolume() + (getDrinkUnits() * SIP_VOLUME)));\n  weightChangeObject(0);\n  updateDesc();\n  obj_flags.decay_time=getDrinkUnits();\n}\n\nvoid TPool::setDrinkType(liqTypeT n)\n{\n  TBaseCup::setDrinkType(n);\n  updateDesc();\n}\n\n\/\/ the best way to do this would be to explicitly set the proper weight in the\n\/\/ accessors, rather than using weightChangeObject.  It is prone to float\n\/\/ rounding errors and some functions don't even bother to use it (ie, pour,\n\/\/ which I fixed).  But instead of recoding everything, I'll just put this here\n\/\/ so that pools don't generate errors in weightChangeObject.\nvoid TPool::weightChangeObject(float fWeight)\n{\n  setWeight(obj_index[getItemIndex()].weight);\n  TBaseCup::weightChangeObject(getDrinkUnits() * SIP_WEIGHT);\n}\n\nint TPool::getDrinkIndex() const\n{\n  int drinkunits=getDrinkUnits();\n\n  if(drinkunits<=0){\n    return 0;\n  } else if(drinkunits<=5){\n    return 1;\n  } else if(drinkunits<=10){\n    return 2;\n  } else if(drinkunits<=25){\n    return 3;\n  } else if(drinkunits<=50){ \n    return 4;\n  } else if(drinkunits<=100){\n    return 5;\n  } else if(drinkunits<=250){\n    return 6;\n  } else if(drinkunits<=1000){\n    return 7;\n  } else if(drinkunits<=10000){\n    return 8;\n  } else if(drinkunits<=25000){\n    return 9;\n  } else {\n    return 10;\n  }\n}\n  \nvoid TPool::updateDesc()\n{\n  int drinkindex=getDrinkIndex();\n  char buf[256];\n  const char *liqname=liquidInfo[getDrinkType()]->name;\n  sstring buf2;\n  \n  const char *poolname [] =\n  {\n    \"a few drops of %s\", \n    \"a tiny puddle of %s\", \n    \"a small puddle of %s\", \n    \"a puddle of %s\", \n    \"a fair sized puddle of %s\", \n    \"a big pool of %s\", \n    \"a large pool of %s\", \n    \"a huge pool of %s\",\n    \"a massive pool of %s\",\n    \"a tremendously huge pool of %s\",\n    \"a veritable ocean of %s\"\n  };\n  \n  const char *pooldesc [] =\n  {\n    \"A few drops of %s sprinkle the $g here and are fading fast.\",\n    \"A tiny puddle of %s has gathered on the $g here.\",\n    \"A small puddle of %s is on the $g here.\",\n    \"A puddle of %s is here on the $g.\",\n    \"A fair sized puddle of %s is here on the $g.\",\n    \"A big pool of %s is on the $g here.\",\n    \"A large pool of %s is here on the $g.\",\n    \"A huge pool of %s is on the $g here.\",\n    \"A massive pool of %s is on the $g here.\",\n    \"A tremendously huge pool of %s dominates the area.\",\n    \"A veritable ocean of %s covers the area.\"\n  };\n\n  if (isObjStat(ITEM_STRUNG)) {\n    delete [] shortDescr;\n    delete [] descr;\n    delete [] name;\n\n    extraDescription *exd;\n    while ((exd = ex_description)) {\n      ex_description = exd->next;\n      delete exd;\n    }\n    ex_description = NULL;\n    delete [] action_description;\n    action_description = NULL;\n  } else {\n    addObjStat(ITEM_STRUNG);\n    ex_description = NULL;\n    action_description = NULL;\n  }\n\n  if(isDrinkConFlag(DRINK_FROZEN)){\n    buf2 = fmt(\"chunk frozen %s %s\") %\n      stripColorCodes(liquidInfo[getDrinkType()]->name) %\n      stripColorCodes(liquidInfo[getDrinkType()]->color);\n    name = mud_str_dup(buf2);\n\n    sprintf(buf, \"a <C>frozen<1> chunk of %s\", liqname);\n    shortDescr = mud_str_dup(buf);\n    \n    sprintf(buf, \"A chunk of <C>frozen<1> %s is here.\", liqname);\n    setDescr(mud_str_dup(buf));\n    \n    SET_BIT(obj_flags.wear_flags, ITEM_TAKE);\n  } else {\n    buf2 = fmt(\"pool puddle %s %s\") %\n      stripColorCodes(liquidInfo[getDrinkType()]->name) %\n      stripColorCodes(liquidInfo[getDrinkType()]->color);\n    name = mud_str_dup(buf2);\n\n    sprintf(buf, poolname[drinkindex], liqname);\n    shortDescr = mud_str_dup(buf);\n    \n    sprintf(buf, pooldesc[drinkindex], liqname);\n    setDescr(mud_str_dup(buf));\n\n    REMOVE_BIT(obj_flags.wear_flags, ITEM_TAKE);\n  }\n}\n\nbool TPool::isPluralItem() const\n{\n  \/\/ a few drops of blood\n  if (getDrinkIndex() == 0)\n    return TRUE;\n\n  \/\/ otherwise, make recursive\n  return TBaseCup::isPluralItem();\n}\n\nint TRoom::dropPool(int amt, liqTypeT liq)\n{\n  TPool *pool=NULL;\n  TThing *t;\n  TObj *obj;\n\n  if(amt==0)\n    return FALSE;\n\n  \/* look for preexisting pool *\/\n  for(t=getStuff();t;t=t->nextThing){\n    TPool *tp = dynamic_cast<TPool *>(t);\n    if (tp && (tp->getDrinkType() == liq)){\n      pool=tp;\n      break;\n    }\n  }\n\n  if(!pool){\n    \/\/ create new pool\n#if 1\n\/\/ builder port uses stripped down database which was causing problems\n\/\/ hence this setup instead.\n    int robj = real_object(GENERIC_POOL);\n    if (robj < 0 || robj >= (signed int) obj_index.size()) {\n      vlogf(LOG_BUG, fmt(\"dropPool(): No object (%d) in database!\") %  GENERIC_POOL);\n      return false;\n    }\n\n    obj = read_object(robj, REAL);\n#else\n    obj = read_object(GENERIC_POOL, VIRTUAL);\n#endif\n    pool = dynamic_cast<TPool *>(obj);\n    if (!pool)\n      return false;\n    pool->initPool(amt, liq);\n\n    *this += *pool;\n  } else {\n    pool->fillMeAmount(amt, liq);\n  }\n\n  return TRUE;\n\n}\n\nint TBeing::dropPool(int amt, liqTypeT liq)\n{\n  TPool *pool=NULL;\n  TThing *t;\n  TObj *obj;\n\n  if(amt==0)\n    return FALSE;\n\n  \/* look for preexisting pool *\/\n  for(t=roomp->getStuff();t;t=t->nextThing){\n    TPool *tp = dynamic_cast<TPool *>(t);\n    if (tp && (tp->getDrinkType() == liq)){\n      pool=tp;\n      break;\n    }\n  }\n\n  if(!pool){\n    \/\/ create new pool\n#if 1\n\/\/ builder port uses stripped down database which was causing problems\n\/\/ hence this setup instead.\n    int robj = real_object(GENERIC_POOL);\n    if (robj < 0 || robj >= (signed int) obj_index.size()) {\n      vlogf(LOG_BUG, fmt(\"dropPool(): No object (%d) in database!\") %  GENERIC_POOL);\n      return false;\n    }\n\n    obj = read_object(robj, REAL);\n#else\n    obj = read_object(GENERIC_POOL, VIRTUAL);\n#endif\n    pool = dynamic_cast<TPool *>(obj);\n    if (!pool)\n      return false;\n    pool->initPool(amt, liq);\n\n    *roomp += *pool;\n  } else {\n    pool->fillMeAmount(amt, liq);\n  }\n\n  return TRUE;\n}\n\nvoid TPool::decayMe()\n{\n  int drinkunits=getDrinkUnits();\n\n  \/\/ check for non-decaying pools\n  if (isDrinkConFlag(DRINK_PERM))\n    return;\n\n  if(drinkunits<=0)\n    setDrinkUnits(0);\n  else if(drinkunits<25)\n    addToDrinkUnits(-1);\n  else \/\/ large pools evaporate faster\n    addToDrinkUnits(-(drinkunits\/25)); \n}\n\n\nvoid TPool::initPool(int amt, liqTypeT liq)\n{\n  swapToStrung();\n  REMOVE_BIT(obj_flags.wear_flags, ITEM_TAKE);\n  setDrinkType(liq);\n  canBeSeen = 1;\n  setMaterial(MAT_WATER);\n  \n  fillMeAmount(amt, liq);\n}\n\n\nTPool::TPool() :\n  TBaseCup()\n{\n}\n\nTPool::TPool(const TPool &a) :\n  TBaseCup(a)\n{\n}\n\nTPool & TPool::operator=(const TPool &a)\n{\n  if (this == &a) return *this;\n  TBaseCup::operator=(a);\n  return *this;\n}\n\nTPool::~TPool()\n{\n}\n\nvoid TPool::fillMeAmount(int amt, liqTypeT liq)\n{\n  setDrinkType(liq);\n  addToDrinkUnits(amt);\n\n  weightChangeObject(amt * SIP_WEIGHT);\n}\n\n<commit_msg>lowered pool size for overflow<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#include \"stdsneezy.h\"\n#include \"obj_pool.h\"\n#include \"liquids.h\"\n\n\nvoid TPool::overFlow()\n{\n  int index=getDrinkIndex(), total=0, amt=0;\n  TRoom *rp=NULL;\n  TPool *pool;\n  bool valid;\n\n  \/\/ should make a structure for this but I'm in a hurry\n  vector<TRoom *>rooms;\n  vector<dirTypeT>roomdirs;\n  vector<int>roomamts;\n\n  if(!roomp)\n    return;\n\n  if(index>=8){\n    \/\/ check every exit\n    for(dirTypeT dir=MIN_DIR;dir<MAX_DIR;dir++){\n      \/\/ liquid doesn't flow up\n      if(dir==DIR_UP)\n\tcontinue;\n      \n      \/\/ eligible exit\n      if(exitDir(dir) && real_roomp(exitDir(dir)->to_room) &&\n\t !(exitDir(dir)->condition & EX_CLOSED) &&\n\t (rp = real_roomp(roomp->exitDir(dir)->to_room))){\n\t\/\/ check each item\n\tvalid=true;\n\tamt=0;\n\tfor(TThing *t=rp->getStuff();t;t=t->nextThing){\n\t  \/\/ check pools that are the same type and less than half my size\n\t  if((pool=dynamic_cast<TPool *>(t)) && \n\t     pool->getDrinkType()==getDrinkType()){\n\t    if(pool->getDrinkUnits() >= (getDrinkUnits()\/2)){\n\t      valid=false;\n\t    } else {\n\t      total+=pool->getDrinkUnits();\n\t      amt=pool->getDrinkUnits();\n\t    }\n\t  }\n\t}\n\tif(valid){\n\t  rooms.push_back(rp);\n\t  roomdirs.push_back(dir);\n\t  roomamts.push_back(amt);\n\t}\n      }\n    }\n\n    \/\/ no rooms to flow into, we're the smallest pool\n    if(!rooms.size())\n      return;\n\n    total+=(int)((float)getDrinkUnits() * 0.60);\n    setDrinkUnits((int)((float)getDrinkUnits() * 0.40));\n\n    total\/=rooms.size();\n\n    sendrpf(COLOR_BASIC, roomp, \n\t    \"Some %s flows outward into surrounding rooms.\\n\\r\",\n\t    liquidInfo[getDrinkType()]->name);\n\n    for(unsigned int i=0;i<rooms.size();++i){\n      rooms[i]->dropPool(total-roomamts[i], getDrinkType());\n      sendrpf(COLOR_BASIC, rooms[i], \n\t      \"Some %s flows in from the %s.\\n\\r\",\n\t      liquidInfo[getDrinkType()]->name,\n\t      dirs[rev_dir[roomdirs[i]]]);\n    }\n\n    roomp->saveItems(\"\");\n    rp->saveItems(\"\");\n  }\n}\n\n\nvoid TPool::doMerge()\n{\n  TPool *pool;\n  TThing *t, *t2;\n\n  if(!roomp)\n    return;\n\n  for(t=roomp->getStuff();t;t=t2){\n    t2=t->nextThing;\n    \n    if((pool=dynamic_cast<TPool *>(t)) && pool != this && \n       pool->getDrinkType()==getDrinkType()){\n      \/\/ merge!\n      addToDrinkUnits(pool->getDrinkUnits());\n      --(*pool);\n      delete pool;\n    }\n  }\n}\n\nvoid TPool::setDrinkUnits(int n)\n{\n  setMaxDrinkUnits(n);\n  TBaseCup::setDrinkUnits(n);\n  setVolume((int)(getVolume() + (getDrinkUnits() * SIP_VOLUME)));\n  weightChangeObject(0);\n  updateDesc();\n  obj_flags.decay_time=getDrinkUnits();\n}\n\nvoid TPool::addToDrinkUnits(int n)\n{\n  addToMaxDrinkUnits(n);\n  TBaseCup::addToDrinkUnits(n);\n  setVolume((int)(getVolume() + (getDrinkUnits() * SIP_VOLUME)));\n  weightChangeObject(0);\n  updateDesc();\n  obj_flags.decay_time=getDrinkUnits();\n}\n\nvoid TPool::setDrinkType(liqTypeT n)\n{\n  TBaseCup::setDrinkType(n);\n  updateDesc();\n}\n\n\/\/ the best way to do this would be to explicitly set the proper weight in the\n\/\/ accessors, rather than using weightChangeObject.  It is prone to float\n\/\/ rounding errors and some functions don't even bother to use it (ie, pour,\n\/\/ which I fixed).  But instead of recoding everything, I'll just put this here\n\/\/ so that pools don't generate errors in weightChangeObject.\nvoid TPool::weightChangeObject(float fWeight)\n{\n  setWeight(obj_index[getItemIndex()].weight);\n  TBaseCup::weightChangeObject(getDrinkUnits() * SIP_WEIGHT);\n}\n\nint TPool::getDrinkIndex() const\n{\n  int drinkunits=getDrinkUnits();\n\n  if(drinkunits<=0){\n    return 0;\n  } else if(drinkunits<=5){\n    return 1;\n  } else if(drinkunits<=10){\n    return 2;\n  } else if(drinkunits<=25){\n    return 3;\n  } else if(drinkunits<=50){ \n    return 4;\n  } else if(drinkunits<=100){\n    return 5;\n  } else if(drinkunits<=250){\n    return 6;\n  } else if(drinkunits<=1000){\n    return 7;\n  } else if(drinkunits<=10000){\n    return 8;\n  } else if(drinkunits<=25000){\n    return 9;\n  } else {\n    return 10;\n  }\n}\n  \nvoid TPool::updateDesc()\n{\n  int drinkindex=getDrinkIndex();\n  char buf[256];\n  const char *liqname=liquidInfo[getDrinkType()]->name;\n  sstring buf2;\n  \n  const char *poolname [] =\n  {\n    \"a few drops of %s\", \n    \"a tiny puddle of %s\", \n    \"a small puddle of %s\", \n    \"a puddle of %s\", \n    \"a fair sized puddle of %s\", \n    \"a big pool of %s\", \n    \"a large pool of %s\", \n    \"a huge pool of %s\",\n    \"a massive pool of %s\",\n    \"a tremendously huge pool of %s\",\n    \"a veritable ocean of %s\"\n  };\n  \n  const char *pooldesc [] =\n  {\n    \"A few drops of %s sprinkle the $g here and are fading fast.\",\n    \"A tiny puddle of %s has gathered on the $g here.\",\n    \"A small puddle of %s is on the $g here.\",\n    \"A puddle of %s is here on the $g.\",\n    \"A fair sized puddle of %s is here on the $g.\",\n    \"A big pool of %s is on the $g here.\",\n    \"A large pool of %s is here on the $g.\",\n    \"A huge pool of %s is on the $g here.\",\n    \"A massive pool of %s is on the $g here.\",\n    \"A tremendously huge pool of %s dominates the area.\",\n    \"A veritable ocean of %s covers the area.\"\n  };\n\n  if (isObjStat(ITEM_STRUNG)) {\n    delete [] shortDescr;\n    delete [] descr;\n    delete [] name;\n\n    extraDescription *exd;\n    while ((exd = ex_description)) {\n      ex_description = exd->next;\n      delete exd;\n    }\n    ex_description = NULL;\n    delete [] action_description;\n    action_description = NULL;\n  } else {\n    addObjStat(ITEM_STRUNG);\n    ex_description = NULL;\n    action_description = NULL;\n  }\n\n  if(isDrinkConFlag(DRINK_FROZEN)){\n    buf2 = fmt(\"chunk frozen %s %s\") %\n      stripColorCodes(liquidInfo[getDrinkType()]->name) %\n      stripColorCodes(liquidInfo[getDrinkType()]->color);\n    name = mud_str_dup(buf2);\n\n    sprintf(buf, \"a <C>frozen<1> chunk of %s\", liqname);\n    shortDescr = mud_str_dup(buf);\n    \n    sprintf(buf, \"A chunk of <C>frozen<1> %s is here.\", liqname);\n    setDescr(mud_str_dup(buf));\n    \n    SET_BIT(obj_flags.wear_flags, ITEM_TAKE);\n  } else {\n    buf2 = fmt(\"pool puddle %s %s\") %\n      stripColorCodes(liquidInfo[getDrinkType()]->name) %\n      stripColorCodes(liquidInfo[getDrinkType()]->color);\n    name = mud_str_dup(buf2);\n\n    sprintf(buf, poolname[drinkindex], liqname);\n    shortDescr = mud_str_dup(buf);\n    \n    sprintf(buf, pooldesc[drinkindex], liqname);\n    setDescr(mud_str_dup(buf));\n\n    REMOVE_BIT(obj_flags.wear_flags, ITEM_TAKE);\n  }\n}\n\nbool TPool::isPluralItem() const\n{\n  \/\/ a few drops of blood\n  if (getDrinkIndex() == 0)\n    return TRUE;\n\n  \/\/ otherwise, make recursive\n  return TBaseCup::isPluralItem();\n}\n\nint TRoom::dropPool(int amt, liqTypeT liq)\n{\n  TPool *pool=NULL;\n  TThing *t;\n  TObj *obj;\n\n  if(amt==0)\n    return FALSE;\n\n  \/* look for preexisting pool *\/\n  for(t=getStuff();t;t=t->nextThing){\n    TPool *tp = dynamic_cast<TPool *>(t);\n    if (tp && (tp->getDrinkType() == liq)){\n      pool=tp;\n      break;\n    }\n  }\n\n  if(!pool){\n    \/\/ create new pool\n#if 1\n\/\/ builder port uses stripped down database which was causing problems\n\/\/ hence this setup instead.\n    int robj = real_object(GENERIC_POOL);\n    if (robj < 0 || robj >= (signed int) obj_index.size()) {\n      vlogf(LOG_BUG, fmt(\"dropPool(): No object (%d) in database!\") %  GENERIC_POOL);\n      return false;\n    }\n\n    obj = read_object(robj, REAL);\n#else\n    obj = read_object(GENERIC_POOL, VIRTUAL);\n#endif\n    pool = dynamic_cast<TPool *>(obj);\n    if (!pool)\n      return false;\n    pool->initPool(amt, liq);\n\n    *this += *pool;\n  } else {\n    pool->fillMeAmount(amt, liq);\n  }\n\n  return TRUE;\n\n}\n\nint TBeing::dropPool(int amt, liqTypeT liq)\n{\n  TPool *pool=NULL;\n  TThing *t;\n  TObj *obj;\n\n  if(amt==0)\n    return FALSE;\n\n  \/* look for preexisting pool *\/\n  for(t=roomp->getStuff();t;t=t->nextThing){\n    TPool *tp = dynamic_cast<TPool *>(t);\n    if (tp && (tp->getDrinkType() == liq)){\n      pool=tp;\n      break;\n    }\n  }\n\n  if(!pool){\n    \/\/ create new pool\n#if 1\n\/\/ builder port uses stripped down database which was causing problems\n\/\/ hence this setup instead.\n    int robj = real_object(GENERIC_POOL);\n    if (robj < 0 || robj >= (signed int) obj_index.size()) {\n      vlogf(LOG_BUG, fmt(\"dropPool(): No object (%d) in database!\") %  GENERIC_POOL);\n      return false;\n    }\n\n    obj = read_object(robj, REAL);\n#else\n    obj = read_object(GENERIC_POOL, VIRTUAL);\n#endif\n    pool = dynamic_cast<TPool *>(obj);\n    if (!pool)\n      return false;\n    pool->initPool(amt, liq);\n\n    *roomp += *pool;\n  } else {\n    pool->fillMeAmount(amt, liq);\n  }\n\n  return TRUE;\n}\n\nvoid TPool::decayMe()\n{\n  int drinkunits=getDrinkUnits();\n\n  \/\/ check for non-decaying pools\n  if (isDrinkConFlag(DRINK_PERM))\n    return;\n\n  if(drinkunits<=0)\n    setDrinkUnits(0);\n  else if(drinkunits<25)\n    addToDrinkUnits(-1);\n  else \/\/ large pools evaporate faster\n    addToDrinkUnits(-(drinkunits\/25)); \n}\n\n\nvoid TPool::initPool(int amt, liqTypeT liq)\n{\n  swapToStrung();\n  REMOVE_BIT(obj_flags.wear_flags, ITEM_TAKE);\n  setDrinkType(liq);\n  canBeSeen = 1;\n  setMaterial(MAT_WATER);\n  \n  fillMeAmount(amt, liq);\n}\n\n\nTPool::TPool() :\n  TBaseCup()\n{\n}\n\nTPool::TPool(const TPool &a) :\n  TBaseCup(a)\n{\n}\n\nTPool & TPool::operator=(const TPool &a)\n{\n  if (this == &a) return *this;\n  TBaseCup::operator=(a);\n  return *this;\n}\n\nTPool::~TPool()\n{\n}\n\nvoid TPool::fillMeAmount(int amt, liqTypeT liq)\n{\n  setDrinkType(liq);\n  addToDrinkUnits(amt);\n\n  weightChangeObject(amt * SIP_WEIGHT);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of accounts-ui\n *\n * Copyright (C) 2010 Nokia Corporation.\n *\n * Contact: Alberto Mardegan <alberto.mardegan@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n *\/\n\n#include \"provider-plugin-proxy.h\"\n#include \"provider-plugin-proxy-priv.h\"\n\n#include <QProcess>\n#include <QDebug>\n#include <QLocalServer>\n#include <QLocalSocket>\n\nusing namespace Accounts;\nusing namespace AccountsUI;\n\n\nProviderPluginProxyPrivate::~ProviderPluginProxyPrivate()\n{\n    qDebug() << Q_FUNC_INFO;\n    if (process) {\n        stopProcess();\n        delete process;\n    }\n}\n\nvoid ProviderPluginProxyPrivate::startProcess(Provider *provider,\n                                              AccountId accountId,\n                                              const QString &serviceType)\n{\n    Q_Q(ProviderPluginProxy);\n\n    PWATCHER_RESTART(pwatcher);\n    const char pluginNamePattern[] = \"%1plugin\";\n\n    \/*\n     * TODO: specify dir path by some variable\n     * *\/\n    QDir pluginDir(QString::fromLatin1(\"\/usr\/libexec\/AccountsUI\"));\n    QDomElement root(provider->domDocument().documentElement());\n    QString pluginTypeName(root.\n                           firstChildElement(QString::fromLatin1(\"plugin\")).\n                           text());\n\n    QString pluginFileName(QString::fromLatin1(pluginNamePattern)\n                           .arg(pluginTypeName));\n    QFileInfo pluginFileInfo(pluginDir, pluginFileName);\n\n    QString providerId(root.attribute(QLatin1String(\"id\")));\n\n    \/\/fallback use id as a plugin name\n    if (!pluginFileInfo.exists()) {\n        pluginFileName = QString::fromLatin1(pluginNamePattern).arg(providerId);\n        pluginFileInfo.setFile(pluginDir, pluginFileName);\n\n        if (!pluginFileInfo.exists()) {\n            pluginFileName = QString::fromLatin1(pluginNamePattern).\n                                      arg(QLatin1String(\"generic\"));\n            pluginFileInfo.setFile(pluginDir, pluginFileName);\n        }\n    }\n\n    if (!pluginFileInfo.exists()) {\n        emit q->failed();\n        return;\n    }\n\n    QString processArguments;\n    Qt::HANDLE windowId = MApplication::instance()->activeWindow()->winId();\n\n    if (accountId != 0) {\n        processArguments = QString::fromLatin1(\"%1 --edit %2 --windowId %3\")\n            .arg(pluginFileInfo.canonicalFilePath())\n            .arg(accountId)\n            .arg(windowId);\n\n        newAccountCreation = false;\n    } else {\n        processArguments = QString::fromLatin1(\"%1 --create %2 --windowId %3\")\n            .arg(pluginFileInfo.canonicalFilePath())\n            .arg(providerId)\n            .arg(windowId);\n\n        newAccountCreation = true;\n    }\n\n    if (!serviceType.isEmpty())\n        processArguments.append(QString::fromLatin1(\" --serviceType %1\")\n                                .arg(serviceType));\n\n#ifndef QT_NO_DEBUG_OUTPUT\n    processArguments.append(QString::fromLatin1(\" -output-level debug\"));\n#endif\n\n    if (!process &&\n        !(process = new QProcess())) {\n        emit q->failed();\n        return;\n    }\n\n    pluginName = pluginFileName;\n    serverName = providerId;\n\n    qDebug() << __TIME__ <<__FILE__ << __func__ << processArguments;\n\n    connect(process, SIGNAL(readyReadStandardError()),\n            this, SLOT(onReadStandardError()));\n    connect(process, SIGNAL(error(QProcess::ProcessError)),\n            this, SLOT(onError(QProcess::ProcessError)));\n    connect(process, SIGNAL(finished(int, QProcess::ExitStatus)),\n            this, SLOT(onFinished(int, QProcess::ExitStatus)));\n    connect(process, SIGNAL(started()), this, SLOT(setCommunicationChannel()));\n\n    process->start(processArguments);\n    PWATCHER_TRACE(pwatcher);\n}\n\nvoid ProviderPluginProxyPrivate::setCommunicationChannel()\n{\n    QLocalServer *server  = new QLocalServer();\n    QLocalServer::removeServer(serverName);\n    if (!server->listen(serverName))\n        qDebug()<<\"Server not up\";\n    else\n        connect(server, SIGNAL(newConnection()), this, SLOT(readDataSent()));\n}\n\nvoid ProviderPluginProxyPrivate::readDataSent()\n{\n    QLocalServer *server = qobject_cast<QLocalServer*>(sender());\n    QLocalSocket *socket = server->nextPendingConnection();\n    if(!socket->waitForConnected())\n        return;\n    if(!socket->waitForReadyRead())\n        return;\n    QByteArray ba = socket->readAll();\n    QString data(ba);\n    accountInfo = data;\n    socket->close();\n}\n\n\nbool ProviderPluginProxyPrivate::stopProcess()\n{\n    if (process == 0)\n        return false;\n    process->disconnect();\n    process->close();\n    return process->waitForFinished();\n}\n\nvoid ProviderPluginProxyPrivate::onReadStandardError()\n{\n    qDebug() << QString::fromLatin1(process->readAllStandardError());\n}\n\nvoid ProviderPluginProxyPrivate::onError(QProcess::ProcessError err)\n{\n    Q_Q(ProviderPluginProxy);\n\n    PWATCHER_TRACE(pwatcher);\n    if (err == QProcess::FailedToStart) {\n        pluginName.clear();\n\n        emit q->failed();\n        if (process) {\n            process->deleteLater();\n            process = NULL;\n        }\n    }\n\n    qDebug() << \"Error: \" << err;\n}\n\nvoid ProviderPluginProxyPrivate::onFinished(int exitCode,\n                                            QProcess::ExitStatus exitStatus)\n{\n    Q_Q(ProviderPluginProxy);\n    Q_UNUSED(exitCode);\n    PWATCHER_TRACE(pwatcher) << exitCode;\n\n    if (exitStatus == QProcess::CrashExit) {\n        emit q->failed();\n        process->deleteLater();\n        process = NULL;\n        return;\n    }\n\n    if (newAccountCreation) {\n        QString value;\n        if (!accountInfo.isEmpty())\n            value = accountInfo;\n        else {\n            char buffer[16];\n            process->readLine(buffer, sizeof(buffer));\n            value = QString::fromAscii(buffer);\n        }\n        if (!value.isEmpty()) {\n            QStringList resultList = value.split(\" \");\n            result = resultList.at(0).toInt();\n            if (resultList.count() > 1)\n                returnToApp = resultList.at(1).toInt();\n            \/* TODO: do we need the returnToApp value?\n             * - if not, remove it completely (and from ProviderPluginProcess\n             * - if yes, consider exposing it as an additional method\n             *\/\n            Q_UNUSED(returnToApp);\n        }\n\n        qDebug() << \"Plugin output: \" << result;\n\n        emit q->created(result);\n    } else\n        emit q->edited();\n\n    pluginName.clear();\n\n    if (process) {\n        process->deleteLater();\n        process = NULL;\n    }\n}\n\nProviderPluginProxy::ProviderPluginProxy(QObject *parent):\n    QObject(parent),\n    d_ptr(new ProviderPluginProxyPrivate())\n{\n    Q_D(ProviderPluginProxy);\n\n    d->q_ptr = this;\n}\n\nProviderPluginProxy::~ProviderPluginProxy()\n{\n    Q_D(ProviderPluginProxy);\n    delete d;\n}\n\nvoid ProviderPluginProxy::createAccount(Provider *provider,\n                                        const QString &serviceType)\n{\n    Q_D(ProviderPluginProxy);\n    PWATCHER_TRACE(pwatcher);\n\n    if (!provider) {\n        qCritical() << \" NULL pointer to provider\";\n        emit failed();\n        return;\n    }\n\n    d->startProcess(provider, 0, serviceType);\n}\n\nvoid ProviderPluginProxy::editAccount(Account *account,\n                                      const QString &serviceType)\n{\n    Q_D(ProviderPluginProxy);\n    PWATCHER_TRACE(pwatcher);\n\n    if (!account) {\n        qCritical() << \" NULL pointer to account\";\n        emit failed();\n        return;\n    }\n\n    Manager *manager = account->manager();\n    Provider *provider = manager->provider(account->providerName());\n    d->startProcess(provider, account->id(), serviceType);\n}\n\nvoid ProviderPluginProxy::stopProcess()\n{\n    Q_D(ProviderPluginProxy);\n    d->stopProcess();\n}\n\nbool ProviderPluginProxy::isPluginRunning()\n{\n    Q_D(ProviderPluginProxy);\n    return d->process != NULL;\n}\n\nQString ProviderPluginProxy::pluginName()\n{\n    if (!isPluginRunning())\n        return QString();\n\n    Q_D(ProviderPluginProxy);\n    return d->pluginName;\n}\n\n<commit_msg>Fixes 210679-Accounts-ui crashes while going back from Login view to Provider list view<commit_after>\/*\n * This file is part of accounts-ui\n *\n * Copyright (C) 2010 Nokia Corporation.\n *\n * Contact: Alberto Mardegan <alberto.mardegan@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 License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library 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 * 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\n * 02110-1301 USA\n *\/\n\n#include \"provider-plugin-proxy.h\"\n#include \"provider-plugin-proxy-priv.h\"\n\n#include <QProcess>\n#include <QDebug>\n#include <QLocalServer>\n#include <QLocalSocket>\n\nusing namespace Accounts;\nusing namespace AccountsUI;\n\n\nProviderPluginProxyPrivate::~ProviderPluginProxyPrivate()\n{\n    qDebug() << Q_FUNC_INFO;\n    if (process) {\n        stopProcess();\n        delete process;\n    }\n}\n\nvoid ProviderPluginProxyPrivate::startProcess(Provider *provider,\n                                              AccountId accountId,\n                                              const QString &serviceType)\n{\n    Q_Q(ProviderPluginProxy);\n\n    PWATCHER_RESTART(pwatcher);\n    const char pluginNamePattern[] = \"%1plugin\";\n\n    \/*\n     * TODO: specify dir path by some variable\n     * *\/\n    QDir pluginDir(QString::fromLatin1(\"\/usr\/libexec\/AccountsUI\"));\n    QDomElement root(provider->domDocument().documentElement());\n    QString pluginTypeName(root.\n                           firstChildElement(QString::fromLatin1(\"plugin\")).\n                           text());\n\n    QString pluginFileName(QString::fromLatin1(pluginNamePattern)\n                           .arg(pluginTypeName));\n    QFileInfo pluginFileInfo(pluginDir, pluginFileName);\n\n    QString providerId(root.attribute(QLatin1String(\"id\")));\n\n    \/\/fallback use id as a plugin name\n    if (!pluginFileInfo.exists()) {\n        pluginFileName = QString::fromLatin1(pluginNamePattern).arg(providerId);\n        pluginFileInfo.setFile(pluginDir, pluginFileName);\n\n        if (!pluginFileInfo.exists()) {\n            pluginFileName = QString::fromLatin1(pluginNamePattern).\n                                      arg(QLatin1String(\"generic\"));\n            pluginFileInfo.setFile(pluginDir, pluginFileName);\n        }\n    }\n\n    if (!pluginFileInfo.exists()) {\n        emit q->failed();\n        return;\n    }\n\n    QString processArguments;\n    Qt::HANDLE windowId = MApplication::instance()->activeWindow()->winId();\n\n    if (accountId != 0) {\n        processArguments = QString::fromLatin1(\"%1 --edit %2 --windowId %3\")\n            .arg(pluginFileInfo.canonicalFilePath())\n            .arg(accountId)\n            .arg(windowId);\n\n        newAccountCreation = false;\n    } else {\n        processArguments = QString::fromLatin1(\"%1 --create %2 --windowId %3\")\n            .arg(pluginFileInfo.canonicalFilePath())\n            .arg(providerId)\n            .arg(windowId);\n\n        newAccountCreation = true;\n    }\n\n    if (!serviceType.isEmpty())\n        processArguments.append(QString::fromLatin1(\" --serviceType %1\")\n                                .arg(serviceType));\n\n#ifndef QT_NO_DEBUG_OUTPUT\n    processArguments.append(QString::fromLatin1(\" -output-level debug\"));\n#endif\n\n    if (!process &&\n        !(process = new QProcess())) {\n        emit q->failed();\n        return;\n    }\n\n    pluginName = pluginFileName;\n    serverName = providerId;\n\n    qDebug() << __TIME__ <<__FILE__ << __func__ << processArguments;\n\n    connect(process, SIGNAL(readyReadStandardError()),\n            this, SLOT(onReadStandardError()));\n    connect(process, SIGNAL(error(QProcess::ProcessError)),\n            this, SLOT(onError(QProcess::ProcessError)));\n    connect(process, SIGNAL(finished(int, QProcess::ExitStatus)),\n            this, SLOT(onFinished(int, QProcess::ExitStatus)));\n    connect(process, SIGNAL(started()), this, SLOT(setCommunicationChannel()));\n\n    process->start(processArguments);\n    PWATCHER_TRACE(pwatcher);\n}\n\nvoid ProviderPluginProxyPrivate::setCommunicationChannel()\n{\n    QLocalServer *server  = new QLocalServer();\n    QLocalServer::removeServer(serverName);\n    if (!server->listen(serverName))\n        qDebug()<<\"Server not up\";\n    else\n        connect(server, SIGNAL(newConnection()), this, SLOT(readDataSent()));\n}\n\nvoid ProviderPluginProxyPrivate::readDataSent()\n{\n    QLocalServer *server = qobject_cast<QLocalServer*>(sender());\n    QLocalSocket *socket = server->nextPendingConnection();\n    if(!socket->waitForConnected())\n        return;\n    if(!socket->waitForReadyRead())\n        return;\n    QByteArray ba = socket->readAll();\n    QString data(ba);\n    accountInfo = data;\n    socket->close();\n}\n\n\nbool ProviderPluginProxyPrivate::stopProcess()\n{\n    if (process == 0)\n        return false;\n    process->disconnect();\n    process->close();\n    return process->waitForFinished();\n}\n\nvoid ProviderPluginProxyPrivate::onReadStandardError()\n{\n    qDebug() << QString::fromLatin1(process->readAllStandardError());\n}\n\nvoid ProviderPluginProxyPrivate::onError(QProcess::ProcessError err)\n{\n    Q_Q(ProviderPluginProxy);\n\n    PWATCHER_TRACE(pwatcher);\n    if (err == QProcess::FailedToStart) {\n        pluginName.clear();\n\n        emit q->failed();\n        if (process) {\n            process->deleteLater();\n            process = NULL;\n        }\n    }\n\n    qDebug() << \"Error: \" << err;\n}\n\nvoid ProviderPluginProxyPrivate::onFinished(int exitCode,\n                                            QProcess::ExitStatus exitStatus)\n{\n    Q_Q(ProviderPluginProxy);\n    Q_UNUSED(exitCode);\n    PWATCHER_TRACE(pwatcher) << exitCode;\n    int returnToApp = 0;\n    int result = 0;\n\n    if (exitStatus == QProcess::CrashExit) {\n        emit q->failed();\n        process->deleteLater();\n        process = NULL;\n        return;\n    }\n\n    if (newAccountCreation) {\n        QString value;\n        if (!accountInfo.isEmpty())\n            value = accountInfo;\n        else {\n            char buffer[16];\n            process->readLine(buffer, sizeof(buffer));\n            value = QString::fromAscii(buffer);\n        }\n        if (!value.isEmpty()) {\n            QStringList resultList = value.split(\" \");\n            result = resultList.at(0).toInt();\n            if (resultList.count() > 1)\n                returnToApp = resultList.at(1).toInt();\n            \/* TODO: do we need the returnToApp value?\n             * - if not, remove it completely (and from ProviderPluginProcess\n             * - if yes, consider exposing it as an additional method\n             *\/\n            Q_UNUSED(returnToApp);\n        }\n\n        qDebug() << \"Plugin output: \" << result;\n\n        emit q->created(result);\n    } else\n        emit q->edited();\n\n    pluginName.clear();\n\n    if (process) {\n        process->deleteLater();\n        process = NULL;\n    }\n}\n\nProviderPluginProxy::ProviderPluginProxy(QObject *parent):\n    QObject(parent),\n    d_ptr(new ProviderPluginProxyPrivate())\n{\n    Q_D(ProviderPluginProxy);\n\n    d->q_ptr = this;\n}\n\nProviderPluginProxy::~ProviderPluginProxy()\n{\n    Q_D(ProviderPluginProxy);\n    delete d;\n}\n\nvoid ProviderPluginProxy::createAccount(Provider *provider,\n                                        const QString &serviceType)\n{\n    Q_D(ProviderPluginProxy);\n    PWATCHER_TRACE(pwatcher);\n\n    if (!provider) {\n        qCritical() << \" NULL pointer to provider\";\n        emit failed();\n        return;\n    }\n\n    d->startProcess(provider, 0, serviceType);\n}\n\nvoid ProviderPluginProxy::editAccount(Account *account,\n                                      const QString &serviceType)\n{\n    Q_D(ProviderPluginProxy);\n    PWATCHER_TRACE(pwatcher);\n\n    if (!account) {\n        qCritical() << \" NULL pointer to account\";\n        emit failed();\n        return;\n    }\n\n    Manager *manager = account->manager();\n    Provider *provider = manager->provider(account->providerName());\n    d->startProcess(provider, account->id(), serviceType);\n}\n\nvoid ProviderPluginProxy::stopProcess()\n{\n    Q_D(ProviderPluginProxy);\n    d->stopProcess();\n}\n\nbool ProviderPluginProxy::isPluginRunning()\n{\n    Q_D(ProviderPluginProxy);\n    return d->process != NULL;\n}\n\nQString ProviderPluginProxy::pluginName()\n{\n    if (!isPluginRunning())\n        return QString();\n\n    Q_D(ProviderPluginProxy);\n    return d->pluginName;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************\nCOSC 501\nElliott Plack\n14 NOV 2013                            Due date: 30 NOV 2013\n\nProblem:\n\tWrite a program that plays the game of HANGMAN(guessing a\n\tmystery word).  Read a word to be guessed from a file into\n\tsuccessive elements of the array WORD. The player must\n\tguess the letters belonging to WORD. A single guessing\n\tsession should be terminated when either all letters have\n\tbeen guessed correctly (player wins) or a specified number\n\tof incorrect guesses have been made (computer wins). A run\n\tmust consist of at least two sessions: one player wins and\n\tone computer wins. The player decides whether or not to\n\tstart a new session. \n\n***************************************************************\/\n\n#include <iomanip>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <time.h> \/\/ for random\nusing namespace std;\n\nifstream inFile;     \/\/ define ifstream to inFile command\nofstream outFile;    \/\/ define outfile2\n\nvoid readString();\nvoid initialize(unsigned long); \/\/ function to initalize everything\nvoid guess(); \n\n\/\/ global variables\n\/\/char guess; \/\/ guess from user\nstring word; \/\/ word to be read from file (the solution)\nstring solution; \/\/ solution (guessed by user)\nunsigned long wordLength; \/\/ length of word\n\n\/\/ functions\n\nint main() \/\/ reads in the file and sets the functions in motion\n{\n\treadString();\n\tinitialize(wordLength); \/\/ sends length of word to initialize function\n\tguess();\n\n\treturn 0;\n}\n\nvoid readString()\n{\n\tint random20 = 0; \/\/ random number\n\tstring dictionary[20]; \/\/ 20 words to load from file\n\n\tinFile.open(\"Words4Hangman.txt\"); \/\/ open input file\n\n\twhile (inFile.good())\n\t{\n\t\tfor (int i = 0; i < 20; i++)\n\t\t{\n\t\t\tinFile >> dictionary[i]; \/\/ load file and fill dict\n\t\t}\n\t}\n\n\tinFile.close(); \/\/ close the file\n\n\tsrand((int)time(NULL)); \/\/ initialize random seed\n\trandom20 = (rand() % 20); \/\/ set random to 20 +-\n\n\tword = dictionary[rand() % 20]; \/\/ set word = to a random letter in the dictionary\n\tcout << word << endl; \/\/ cheater! (testing)\n\twordLength = word.size(); \/\/ size (length) of the string\n}\n\nvoid initialize(unsigned long wordLength)\n{\n\tsolution.assign(wordLength, '*');\n\n\tcout << \"Solution: \" << solution << endl; \/\/ test\n}\n\nvoid guess()\n{\n\tstring guessWord;\n\tcout << \"Guess a word\\n\";\n\tcin >> guessWord;\n\t\n\tif (guessWord.compare(word) == 0)\n\t{\n\t\tcout << \"success\";\n\t}\n\telse\n\t{\n\t\tcout << \"fail\";\n\t}\n}<commit_msg>progress<commit_after>\/**************************************************************\nCOSC 501\nElliott Plack\n14 NOV 2013                            Due date: 30 NOV 2013\n\nProblem:\n\tWrite a program that plays the game of HANGMAN(guessing a\n\tmystery word).  Read a word to be guessed from a file into\n\tsuccessive elements of the array WORD. The player must\n\tguess the letters belonging to WORD. A single guessing\n\tsession should be terminated when either all letters have\n\tbeen guessed correctly (player wins) or a specified number\n\tof incorrect guesses have been made (computer wins). A run\n\tmust consist of at least two sessions: one player wins and\n\tone computer wins. The player decides whether or not to\n\tstart a new session. \n\n***************************************************************\/\n\n#include <iomanip>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <time.h> \/\/ for random\nusing namespace std;\n\nifstream inFile;     \/\/ define ifstream to inFile command\nofstream outFile;    \/\/ define outfile2\n\nvoid readString();\nvoid initialize(unsigned long); \/\/ function to initalize everything\nvoid guess(); \n\n\/\/ global variables\n\/\/char guess; \/\/ guess from user\nstring word; \/\/ word to be read from file (the solution)\nstring solution; \/\/ solution (guessed by user)\nunsigned long wordLength; \/\/ length of word\n\n\/\/ functions\n\nint main() \/\/ reads in the file and sets the functions in motion\n{\n\treadString();\n\tinitialize(wordLength); \/\/ sends length of word to initialize function\n\tcout << \"Let's play hangman!\\n\";\n\tguess();\n\n\treturn 0;\n}\n\nvoid readString()\n{\n\tint random20 = 0; \/\/ random number\n\tstring dictionary[20]; \/\/ 20 words to load from file\n\n\tinFile.open(\"Words4Hangman.txt\"); \/\/ open input file\n\n\twhile (inFile.good())\n\t{\n\t\tfor (int i = 0; i < 20; i++)\n\t\t{\n\t\t\tinFile >> dictionary[i]; \/\/ load file and fill dict\n\t\t}\n\t}\n\n\tinFile.close(); \/\/ close the file\n\n\tsrand((int)time(NULL)); \/\/ initialize random seed\n\trandom20 = (rand() % 20); \/\/ set random to 20 +-\n\n\tword = dictionary[rand() % 20]; \/\/ set word = to a random letter in the dictionary\n\tcout << word << endl; \/\/ cheater! (testing)\n\twordLength = word.size(); \/\/ size (length) of the string\n}\n\nvoid initialize(unsigned long wordLength)\n{\n\tsolution.assign(wordLength, '*');\n\n\tcout << \"Solution: \" << solution << endl; \/\/ test\n}\n\nvoid guess()\n{\n\tchar guessLetter = ' '; \/\/ letter to guess\n\tcout << solution << endl; \/\/ output solution\n\tcout << \"Guess a letter\\n\";\n\tcin >> guessLetter;\n\n\tfor (unsigned long i = 0; i < wordLength; i++)\n\t{\n\t\tif (guessLetter == word[i])\n\t\t{\n\t\t\tcout << \"char \" << i << \" is \" << guessLetter << endl;\n\t\t}\n\t\tcout << guessLetter << \"is not in the word\";\n\t}\n\t\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ PbniHash.cpp : PBNI class\r\n#define _CRT_SECURE_NO_DEPRECATE\r\n\r\n#include \"PbniHash.h\"\r\n\r\n#ifdef _DEBUG\r\n#define\tVERSION_STR\t_T(\" (Debug version - \") _T(__DATE__) _T(\" \") _T(__TIME__) _T(\")\")\r\n#else\r\n#define\tVERSION_STR\t_T(\" (Release version - \") _T(__DATE__) _T(\" \") _T(__TIME__) _T(\")\")\r\n#endif\r\n\r\n\/\/ default constructor\r\nPbniHash::PbniHash()\r\n{\r\n}\r\n\r\nPbniHash::PbniHash( IPB_Session * pSession )\r\n:m_pSession( pSession )\r\n{\r\n\tstruct hi_init_set hi_set;\r\n\r\n\tm_lastError = HI_ERR_SUCCESS;\r\n\thi_set_zero(&hi_set);\r\n\thi_set_bucket_size(&hi_set, TABLE_SIZE);\r\n\thi_set_hash_alg(&hi_set, HI_HASH_DEFAULT);\r\n\thi_set_coll_eng(&hi_set, COLL_ENG_LIST);\r\n\t\/\/hi_set_key_cmp_func(&hi_set, hi_cmp_int32);\r\n\thi_set_key_cmp_func(&hi_set, hi_cmp_str);\r\n\r\n\thi_create(&m_hi_handle, &hi_set);\t\/\/todo: check error\r\n}\r\n\r\n\/\/ destructor\r\nPbniHash::~PbniHash()\r\n{\r\n\tDoPurge();\r\n\thi_fini(m_hi_handle);\r\n}\r\n\r\n\/\/ method called by PowerBuilder to invoke PBNI class methods\r\nPBXRESULT PbniHash::Invoke\r\n(\r\n\tIPB_Session * session,\r\n\tpbobject obj,\r\n\tpbmethodID mid,\r\n\tPBCallInfo * ci\r\n)\r\n{\r\n   PBXRESULT pbxr = PBX_OK;\r\n\r\n\tswitch ( mid )\r\n\t{\r\n\t\tcase mid_Hello:\r\n\t\t\tpbxr = this->Hello( ci );\r\n         break;\r\n\t\t\r\n\t\tcase mid_Add:\r\n\t\t\tpbxr = this->Add(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_Get:\r\n\t\t\tpbxr = this->Get(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_Remove:\r\n\t\t\tpbxr = this->Remove(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_Count:\r\n\t\t\tpbxr = this->Count(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_GetKeys:\r\n\t\t\tpbxr = this ->GetKeys(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_GetLastError:\r\n\t\t\tpbxr = this ->GetLastErr(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_GetLastErrMsg:\r\n\t\t\tpbxr = this ->GetLastErrMsg(ci);\r\n\t\t\tbreak;\r\n\t\t\/*case mid_UseStrCompare:\r\n\t\t\tpbxr = this ->GetKeys(ci);\/\/!!!!\r\n\t\t\tbreak;*\/\r\n\t\tcase mid_Purge:\r\n\t\t\tpbxr = this->Purge(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_Set:\r\n\t\t\tpbxr = this->Set(ci);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tpbxr = PBX_E_INVOKE_METHOD_AMBIGUOUS;\r\n\t}\r\n\r\n\treturn pbxr;\r\n}\r\n\r\n\r\nvoid PbniHash::Destroy() \r\n{\r\n   delete this;\r\n}\r\n\r\n\/\/ Method callable from PowerBuilder\r\nPBXRESULT PbniHash::Hello( PBCallInfo * ci )\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\r\n\t\/\/ return value\r\n\tci->returnValue->SetString( _T(\"Hello from PbniHash\") VERSION_STR );\r\n\r\n\treturn pbxr;\r\n}\r\n\r\n\r\nPBXRESULT PbniHash::Add( PBCallInfo * ci )\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tint hi_res;\r\n\tint keyLen;\r\n\r\n\t\/\/ check arguments\r\n\tif ( ci->pArgs->GetAt(0)->IsNull() || ci->pArgs->GetAt(1)->IsNull() )\r\n\t{\r\n\t\t\/\/ if any of the passed arguments is null, return the null value\r\n\t\tci->returnValue->SetToNull();\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpbstring key = ci->pArgs->GetAt(0)->GetString();\r\n\t\tLPCTSTR tszKey = m_pSession->GetString(key);\r\n\r\n\t\t\/\/ce qui suit est identique a faire un AcquireValue sur la key...\r\n\t\t\/\/wchar_t *localKey = (wchar_t *)malloc((wcslen(tszKey) + 1) * sizeof(wchar_t));\r\n\t\t\/\/wcscpy(localKey, tszKey);\r\n\t\tkeyLen = wcstombs(NULL, (LPWSTR)tszKey, 0) + 2;\r\n\t\tchar *localKey = (char*)malloc(keyLen);\r\n\t\twcstombs(localKey, (LPWSTR)tszKey, keyLen);\r\n\r\n\t\tIPB_Value *data = m_pSession->AcquireValue(ci->pArgs->GetAt(1));\r\n\r\n\t\tPPBDATAREC dataRecord = (PPBDATAREC)malloc(sizeof(PBDATAREC));\r\n\t\tdataRecord->key = localKey;\r\n\t\tdataRecord->data = data;\r\n\t\t\r\n\t\thi_res = hi_insert(m_hi_handle, (void*)dataRecord->key, strlen(localKey), dataRecord \/*tszData*\/);\r\n\t\tif (HI_SUCCESS == hi_res)\r\n\t\t\tci->returnValue->SetBool(true);\r\n\t\telse\r\n\t\t\tci->returnValue->SetBool(false);\r\n\t\t\/\/TODO: need to tell if HI_ERR_DUPKEY\r\n\t\tm_lastError = hi_res;\r\n\t}\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::Get(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tint iRet;\r\n\tPPBDATAREC data_ptr;\r\n\r\n\tif ( ci->pArgs->GetAt(0)->IsNull())\r\n\t{\r\n\t\t\/\/ if any of the passed arguments is null, return the null value\r\n\t\tci->returnValue->SetToNull();\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpbstring key = ci->pArgs->GetAt(0)->GetString();\r\n\t\tLPCTSTR tszKey = m_pSession->GetString(key);\r\n\t\tint keyLen = wcstombs(NULL, (LPWSTR)tszKey, 0) + 2;\r\n\t\tchar *localKey = (char*)malloc(keyLen);\r\n\t\twcstombs(localKey, (LPWSTR)tszKey, keyLen);\r\n\r\n\t\t\/\/search the key\r\n\t\tiRet = hi_get(m_hi_handle, (void*)localKey, strlen(localKey), (void**)&data_ptr);\r\n\t\tif (HI_SUCCESS == iRet)\r\n\t\t\tm_pSession->SetValue(ci->returnValue, (IPB_Value*)data_ptr->data);\r\n\t\telse\r\n\t\t\tci->returnValue->SetToNull();\r\n\t\tfree(localKey);\r\n\t\tm_lastError = iRet;\r\n\t}\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::Set(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tint iRet;\r\n\tPPBDATAREC data_ptr;\r\n\r\n\tif ( ci->pArgs->GetAt(0)->IsNull() || ci->pArgs->GetAt(1)->IsNull() )\r\n\t{\r\n\t\t\/\/ if any of the passed arguments is null, return the null value\r\n\t\tci->returnValue->SetToNull();\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpbstring key = ci->pArgs->GetAt(0)->GetString();\r\n\t\tLPCTSTR tszKey = m_pSession->GetString(key);\r\n\t\tint keyLen = wcstombs(NULL, (LPWSTR)tszKey, 0) + 2;\r\n\t\tchar *localKey = (char*)malloc(keyLen);\r\n\t\twcstombs(localKey, (LPWSTR)tszKey, keyLen);\r\n\r\n\t\t\/\/search the key\r\n\t\tiRet = hi_get(m_hi_handle, (void*)localKey, strlen(localKey), (void**)&data_ptr);\r\n\t\tif (HI_SUCCESS == iRet)\r\n\t\t{\r\n\t\t\t\/\/exists, so we can free the existing data and replace by our new one\r\n\t\t\tm_pSession->ReleaseValue((IPB_Value*)data_ptr->data);\r\n\t\t\tIPB_Value *data = m_pSession->AcquireValue(ci->pArgs->GetAt(1));\r\n\t\t\tdata_ptr->data = data;\r\n\t\t\tci->returnValue->SetBool(true);\r\n\t\t\tfree(localKey);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tIPB_Value *data = m_pSession->AcquireValue(ci->pArgs->GetAt(1));\r\n\t\t\tPPBDATAREC dataRecord = (PPBDATAREC)malloc(sizeof(PBDATAREC));\r\n\t\t\tdataRecord->key = localKey;\r\n\t\t\tdataRecord->data = data;\r\n\t\t\tiRet = hi_insert(m_hi_handle, (void*)dataRecord->key, strlen(localKey), dataRecord \/*tszData*\/);\r\n\t\t\tif (HI_SUCCESS == iRet)\r\n\t\t\t\tci->returnValue->SetBool(true);\r\n\t\t\telse\r\n\t\t\t\tci->returnValue->SetBool(false);\r\n\t\t}\r\n\t\tm_lastError = iRet;\r\n\t}\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::Remove(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tint iRet;\r\n\tPPBDATAREC data_ptr;\r\n\r\n\tif ( ci->pArgs->GetAt(0)->IsNull())\r\n\t{\r\n\t\t\/\/ if any of the passed arguments is null, return the null value\r\n\t\tci->returnValue->SetToNull();\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpbstring key = ci->pArgs->GetAt(0)->GetString();\r\n\t\tLPCTSTR tszKey = m_pSession->GetString(key);\r\n\t\tint keyLen = wcstombs(NULL, (LPWSTR)tszKey, 0) + 2;\r\n\t\tchar *localKey = (char*)malloc(keyLen);\r\n\t\twcstombs(localKey, (LPWSTR)tszKey, keyLen);\r\n\t\t\r\n\t\t\/\/search the key\r\n\t\tiRet = hi_remove(m_hi_handle, (void*)localKey, strlen(localKey),(void**)&data_ptr);\r\n\t\tif (HI_SUCCESS == iRet)\r\n\t\t{\r\n\t\t\tfree(data_ptr->key);\r\n\t\t\tm_pSession->ReleaseValue((IPB_Value*)data_ptr->data);\r\n\t\t\tfree(data_ptr);\r\n\t\t\tci->returnValue->SetBool(true);\r\n\t\t}\r\n\t\telse\r\n\t\t\tci->returnValue->SetBool(false);\r\n\t\tfree(localKey);\r\n\t\tm_lastError = iRet;\r\n\t}\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::Count(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tpbulong ulRet = m_hi_handle->no_objects;\r\n\tci->returnValue->SetUlong(ulRet);\r\n\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::GetLastErr(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\t\/\/pblong lRet = m_lastError;\r\n\tci->returnValue->SetLong(m_lastError);\r\n\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::GetLastErrMsg(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tconst char *msg;\r\n\r\n\tmsg = hi_strerror(m_lastError);\r\n\tint msgLen = mbstowcs(NULL, msg, strlen(msg)+1);\r\n\tLPWSTR wmsg = (LPWSTR)malloc((msgLen+1) * sizeof(wchar_t));\r\n\tmbstowcs(wmsg, msg, strlen(msg)+1);\r\n\tci->returnValue->SetString(wmsg);\r\n\tfree(wmsg);\r\n\treturn pbxr;\r\n}\r\n\r\n\r\nPBXRESULT PbniHash::GetKeys(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT pbxr = PBX_OK;\r\n\r\n\tif(ci->pArgs->GetAt(0)->IsNull() || !ci->pArgs->GetAt(0)->IsArray() || !ci->pArgs->GetAt(0)->IsByRef())\r\n\t{\r\n\t\t\/\/there must be one reference to an array\r\n\t\tci->returnValue->SetBool(false);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpblong dim[1] = {1};\t\t\t\t\t\t\/\/on peut avoir des tableaux avec plusieurs dimensions\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ici on utilise un tableau  1 dimension, et on commence  1\r\n\t\tpbarray keys;\r\n\t\tvoid *key, *data;\r\n\t\tunsigned long keylen;\r\n\r\n\t\thi_iterator_t *iter;\r\n\r\n\r\n\t\tif(HI_SUCCESS == hi_iterator_create(m_hi_handle, &iter))\r\n\t\t{\r\n\t\t\tkeys = m_pSession->NewUnboundedSimpleArray(pbvalue_string);\r\n\t\t\twhile(HI_SUCCESS == hi_iterator_getnext(iter, &data, &key, &keylen))\r\n\t\t\t{\r\n\t\t\t\tint keyLen = mbstowcs(NULL, (const char*)key, 0);\r\n\t\t\t\tLPWSTR wstr = (LPWSTR)malloc((keyLen+1) * sizeof(wchar_t));\r\n\t\t\t\tmbstowcs(wstr, (const char*)key, keyLen + 1);\r\n#ifdef _DEBUG\r\n\t\t\t\tOutputDebugString(wstr);\r\n#endif\r\n\t\t\t\tm_pSession->SetStringArrayItem(keys, dim, wstr);\r\n\t\t\t\tdim[0]++;\t\t\/\/prochain index\r\n\t\t\t\tfree(wstr);\r\n\t\t\t}\r\n\t\t\thi_iterator_fini(iter);\r\n\t\t\tci->pArgs->GetAt(0)->SetArray(keys);\r\n\t\t\tci->returnValue->SetBool(true);\r\n\t\t}\r\n\t}\r\n\r\n\treturn pbxr;\r\n}\r\n\r\n\r\nPBXRESULT PbniHash::Purge(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT pbxr = PBX_OK;\r\n\r\n\tDoPurge();\r\n\treturn pbxr;\r\n}\r\n \r\nvoid PbniHash::DoPurge()\r\n{\r\n\tvoid *key, *data;\r\n\tunsigned long keylen;\r\n\tint iRet;\r\n\tPPBDATAREC data_ptr;\r\n\thi_iterator_t *iter;\r\n\r\n\r\n\tif(HI_SUCCESS == hi_iterator_create(m_hi_handle, &iter))\r\n\t{\r\n\t\twhile(HI_SUCCESS == hi_iterator_getnext(iter, &data, &key, &keylen))\r\n\t\t{\r\n#ifdef _DEBUG\r\n\t\t\tOutputDebugStringA((char*)key);\r\n#endif\r\n\t\t\tiRet = hi_remove(m_hi_handle, key, keylen,(void**)&data_ptr);\r\n\t\t\tif (HI_SUCCESS == iRet)\r\n\t\t\t{\r\n\t\t\t\tfree(data_ptr->key);\r\n\t\t\t\tm_pSession->ReleaseValue((IPB_Value*)(data_ptr->data));\r\n\t\t\t\tfree(data_ptr);\r\n\t\t\t}\r\n\t\t}\r\n\t\thi_iterator_fini(iter);\r\n\t}\r\n}\r\n<commit_msg>Always create and return a new array for GetKeys, even if the hash has no data<commit_after>\/\/ PbniHash.cpp : PBNI class\r\n#define _CRT_SECURE_NO_DEPRECATE\r\n\r\n#include \"PbniHash.h\"\r\n\r\n#ifdef _DEBUG\r\n#define\tVERSION_STR\t_T(\" (Debug version - \") _T(__DATE__) _T(\" \") _T(__TIME__) _T(\")\")\r\n#else\r\n#define\tVERSION_STR\t_T(\" (Release version - \") _T(__DATE__) _T(\" \") _T(__TIME__) _T(\")\")\r\n#endif\r\n\r\n\/\/ default constructor\r\nPbniHash::PbniHash()\r\n{\r\n}\r\n\r\nPbniHash::PbniHash( IPB_Session * pSession )\r\n:m_pSession( pSession )\r\n{\r\n\tstruct hi_init_set hi_set;\r\n\r\n\tm_lastError = HI_ERR_SUCCESS;\r\n\thi_set_zero(&hi_set);\r\n\thi_set_bucket_size(&hi_set, TABLE_SIZE);\r\n\thi_set_hash_alg(&hi_set, HI_HASH_DEFAULT);\r\n\thi_set_coll_eng(&hi_set, COLL_ENG_LIST);\r\n\t\/\/hi_set_key_cmp_func(&hi_set, hi_cmp_int32);\r\n\thi_set_key_cmp_func(&hi_set, hi_cmp_str);\r\n\r\n\thi_create(&m_hi_handle, &hi_set);\t\/\/todo: check error\r\n}\r\n\r\n\/\/ destructor\r\nPbniHash::~PbniHash()\r\n{\r\n\tDoPurge();\r\n\thi_fini(m_hi_handle);\r\n}\r\n\r\n\/\/ method called by PowerBuilder to invoke PBNI class methods\r\nPBXRESULT PbniHash::Invoke\r\n(\r\n\tIPB_Session * session,\r\n\tpbobject obj,\r\n\tpbmethodID mid,\r\n\tPBCallInfo * ci\r\n)\r\n{\r\n   PBXRESULT pbxr = PBX_OK;\r\n\r\n\tswitch ( mid )\r\n\t{\r\n\t\tcase mid_Hello:\r\n\t\t\tpbxr = this->Hello( ci );\r\n         break;\r\n\t\t\r\n\t\tcase mid_Add:\r\n\t\t\tpbxr = this->Add(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_Get:\r\n\t\t\tpbxr = this->Get(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_Remove:\r\n\t\t\tpbxr = this->Remove(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_Count:\r\n\t\t\tpbxr = this->Count(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_GetKeys:\r\n\t\t\tpbxr = this ->GetKeys(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_GetLastError:\r\n\t\t\tpbxr = this ->GetLastErr(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_GetLastErrMsg:\r\n\t\t\tpbxr = this ->GetLastErrMsg(ci);\r\n\t\t\tbreak;\r\n\t\t\/*case mid_UseStrCompare:\r\n\t\t\tpbxr = this ->GetKeys(ci);\/\/!!!!\r\n\t\t\tbreak;*\/\r\n\t\tcase mid_Purge:\r\n\t\t\tpbxr = this->Purge(ci);\r\n\t\t\tbreak;\r\n\t\tcase mid_Set:\r\n\t\t\tpbxr = this->Set(ci);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tpbxr = PBX_E_INVOKE_METHOD_AMBIGUOUS;\r\n\t}\r\n\r\n\treturn pbxr;\r\n}\r\n\r\n\r\nvoid PbniHash::Destroy() \r\n{\r\n   delete this;\r\n}\r\n\r\n\/\/ Method callable from PowerBuilder\r\nPBXRESULT PbniHash::Hello( PBCallInfo * ci )\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\r\n\t\/\/ return value\r\n\tci->returnValue->SetString( _T(\"Hello from PbniHash\") VERSION_STR );\r\n\r\n\treturn pbxr;\r\n}\r\n\r\n\r\nPBXRESULT PbniHash::Add( PBCallInfo * ci )\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tint hi_res;\r\n\tint keyLen;\r\n\r\n\t\/\/ check arguments\r\n\tif ( ci->pArgs->GetAt(0)->IsNull() || ci->pArgs->GetAt(1)->IsNull() )\r\n\t{\r\n\t\t\/\/ if any of the passed arguments is null, return the null value\r\n\t\tci->returnValue->SetToNull();\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpbstring key = ci->pArgs->GetAt(0)->GetString();\r\n\t\tLPCTSTR tszKey = m_pSession->GetString(key);\r\n\r\n\t\t\/\/ce qui suit est identique a faire un AcquireValue sur la key...\r\n\t\t\/\/wchar_t *localKey = (wchar_t *)malloc((wcslen(tszKey) + 1) * sizeof(wchar_t));\r\n\t\t\/\/wcscpy(localKey, tszKey);\r\n\t\tkeyLen = wcstombs(NULL, (LPWSTR)tszKey, 0) + 2;\r\n\t\tchar *localKey = (char*)malloc(keyLen);\r\n\t\twcstombs(localKey, (LPWSTR)tszKey, keyLen);\r\n\r\n\t\tIPB_Value *data = m_pSession->AcquireValue(ci->pArgs->GetAt(1));\r\n\r\n\t\tPPBDATAREC dataRecord = (PPBDATAREC)malloc(sizeof(PBDATAREC));\r\n\t\tdataRecord->key = localKey;\r\n\t\tdataRecord->data = data;\r\n\t\t\r\n\t\thi_res = hi_insert(m_hi_handle, (void*)dataRecord->key, strlen(localKey), dataRecord \/*tszData*\/);\r\n\t\tif (HI_SUCCESS == hi_res)\r\n\t\t\tci->returnValue->SetBool(true);\r\n\t\telse\r\n\t\t\tci->returnValue->SetBool(false);\r\n\t\t\/\/TODO: need to tell if HI_ERR_DUPKEY\r\n\t\tm_lastError = hi_res;\r\n\t}\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::Get(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tint iRet;\r\n\tPPBDATAREC data_ptr;\r\n\r\n\tif ( ci->pArgs->GetAt(0)->IsNull())\r\n\t{\r\n\t\t\/\/ if any of the passed arguments is null, return the null value\r\n\t\tci->returnValue->SetToNull();\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpbstring key = ci->pArgs->GetAt(0)->GetString();\r\n\t\tLPCTSTR tszKey = m_pSession->GetString(key);\r\n\t\tint keyLen = wcstombs(NULL, (LPWSTR)tszKey, 0) + 2;\r\n\t\tchar *localKey = (char*)malloc(keyLen);\r\n\t\twcstombs(localKey, (LPWSTR)tszKey, keyLen);\r\n\r\n\t\t\/\/search the key\r\n\t\tiRet = hi_get(m_hi_handle, (void*)localKey, strlen(localKey), (void**)&data_ptr);\r\n\t\tif (HI_SUCCESS == iRet)\r\n\t\t\tm_pSession->SetValue(ci->returnValue, (IPB_Value*)data_ptr->data);\r\n\t\telse\r\n\t\t\tci->returnValue->SetToNull();\r\n\t\tfree(localKey);\r\n\t\tm_lastError = iRet;\r\n\t}\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::Set(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tint iRet;\r\n\tPPBDATAREC data_ptr;\r\n\r\n\tif ( ci->pArgs->GetAt(0)->IsNull() || ci->pArgs->GetAt(1)->IsNull() )\r\n\t{\r\n\t\t\/\/ if any of the passed arguments is null, return the null value\r\n\t\tci->returnValue->SetToNull();\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpbstring key = ci->pArgs->GetAt(0)->GetString();\r\n\t\tLPCTSTR tszKey = m_pSession->GetString(key);\r\n\t\tint keyLen = wcstombs(NULL, (LPWSTR)tszKey, 0) + 2;\r\n\t\tchar *localKey = (char*)malloc(keyLen);\r\n\t\twcstombs(localKey, (LPWSTR)tszKey, keyLen);\r\n\r\n\t\t\/\/search the key\r\n\t\tiRet = hi_get(m_hi_handle, (void*)localKey, strlen(localKey), (void**)&data_ptr);\r\n\t\tif (HI_SUCCESS == iRet)\r\n\t\t{\r\n\t\t\t\/\/exists, so we can free the existing data and replace by our new one\r\n\t\t\tm_pSession->ReleaseValue((IPB_Value*)data_ptr->data);\r\n\t\t\tIPB_Value *data = m_pSession->AcquireValue(ci->pArgs->GetAt(1));\r\n\t\t\tdata_ptr->data = data;\r\n\t\t\tci->returnValue->SetBool(true);\r\n\t\t\tfree(localKey);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tIPB_Value *data = m_pSession->AcquireValue(ci->pArgs->GetAt(1));\r\n\t\t\tPPBDATAREC dataRecord = (PPBDATAREC)malloc(sizeof(PBDATAREC));\r\n\t\t\tdataRecord->key = localKey;\r\n\t\t\tdataRecord->data = data;\r\n\t\t\tiRet = hi_insert(m_hi_handle, (void*)dataRecord->key, strlen(localKey), dataRecord \/*tszData*\/);\r\n\t\t\tif (HI_SUCCESS == iRet)\r\n\t\t\t\tci->returnValue->SetBool(true);\r\n\t\t\telse\r\n\t\t\t\tci->returnValue->SetBool(false);\r\n\t\t}\r\n\t\tm_lastError = iRet;\r\n\t}\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::Remove(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tint iRet;\r\n\tPPBDATAREC data_ptr;\r\n\r\n\tif ( ci->pArgs->GetAt(0)->IsNull())\r\n\t{\r\n\t\t\/\/ if any of the passed arguments is null, return the null value\r\n\t\tci->returnValue->SetToNull();\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpbstring key = ci->pArgs->GetAt(0)->GetString();\r\n\t\tLPCTSTR tszKey = m_pSession->GetString(key);\r\n\t\tint keyLen = wcstombs(NULL, (LPWSTR)tszKey, 0) + 2;\r\n\t\tchar *localKey = (char*)malloc(keyLen);\r\n\t\twcstombs(localKey, (LPWSTR)tszKey, keyLen);\r\n\t\t\r\n\t\t\/\/search the key\r\n\t\tiRet = hi_remove(m_hi_handle, (void*)localKey, strlen(localKey),(void**)&data_ptr);\r\n\t\tif (HI_SUCCESS == iRet)\r\n\t\t{\r\n\t\t\tfree(data_ptr->key);\r\n\t\t\tm_pSession->ReleaseValue((IPB_Value*)data_ptr->data);\r\n\t\t\tfree(data_ptr);\r\n\t\t\tci->returnValue->SetBool(true);\r\n\t\t}\r\n\t\telse\r\n\t\t\tci->returnValue->SetBool(false);\r\n\t\tfree(localKey);\r\n\t\tm_lastError = iRet;\r\n\t}\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::Count(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tpbulong ulRet = m_hi_handle->no_objects;\r\n\tci->returnValue->SetUlong(ulRet);\r\n\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::GetLastErr(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\t\/\/pblong lRet = m_lastError;\r\n\tci->returnValue->SetLong(m_lastError);\r\n\r\n\treturn pbxr;\r\n}\r\n\r\nPBXRESULT PbniHash::GetLastErrMsg(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT\tpbxr = PBX_OK;\r\n\tconst char *msg;\r\n\r\n\tmsg = hi_strerror(m_lastError);\r\n\tint msgLen = mbstowcs(NULL, msg, strlen(msg)+1);\r\n\tLPWSTR wmsg = (LPWSTR)malloc((msgLen+1) * sizeof(wchar_t));\r\n\tmbstowcs(wmsg, msg, strlen(msg)+1);\r\n\tci->returnValue->SetString(wmsg);\r\n\tfree(wmsg);\r\n\treturn pbxr;\r\n}\r\n\r\n\r\nPBXRESULT PbniHash::GetKeys(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT pbxr = PBX_OK;\r\n\r\n\tif(ci->pArgs->GetAt(0)->IsNull() || !ci->pArgs->GetAt(0)->IsArray() || !ci->pArgs->GetAt(0)->IsByRef())\r\n\t{\r\n\t\t\/\/there must be one reference to an array\r\n\t\tci->returnValue->SetBool(false);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tpblong dim[1] = {1};\t\t\t\t\t\t\/\/on peut avoir des tableaux avec plusieurs dimensions\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ici on utilise un tableau  1 dimension, et on commence  1\r\n\t\tpbarray keys;\r\n\t\tvoid *key, *data;\r\n\t\tunsigned long keylen;\r\n\r\n\t\thi_iterator_t *iter;\r\n\r\n\t\t\/\/ we always return a new array, it may be empty\r\n\t\tkeys = m_pSession->NewUnboundedSimpleArray(pbvalue_string);\r\n\t\t\r\n\t\tif(HI_SUCCESS == hi_iterator_create(m_hi_handle, &iter)) \/\/we can also get HI_ERR_NODATA if empty hash\r\n\t\t{\r\n\t\t\t\r\n\t\t\twhile(HI_SUCCESS == hi_iterator_getnext(iter, &data, &key, &keylen))\r\n\t\t\t{\r\n\t\t\t\tint keyLen = mbstowcs(NULL, (const char*)key, 0);\r\n\t\t\t\tLPWSTR wstr = (LPWSTR)malloc((keyLen+1) * sizeof(wchar_t));\r\n\t\t\t\tmbstowcs(wstr, (const char*)key, keyLen + 1);\r\n#ifdef _DEBUG\r\n\t\t\t\tOutputDebugString(wstr);\r\n#endif\r\n\t\t\t\tm_pSession->SetStringArrayItem(keys, dim, wstr);\r\n\t\t\t\tdim[0]++;\t\t\/\/prochain index\r\n\t\t\t\tfree(wstr);\r\n\t\t\t}\r\n\t\t\thi_iterator_fini(iter);\r\n\t\t}\r\n\t\tci->pArgs->GetAt(0)->SetArray(keys);\r\n\t\tci->returnValue->SetBool(true);\r\n\t}\r\n\r\n\treturn pbxr;\r\n}\r\n\r\n\r\nPBXRESULT PbniHash::Purge(PBCallInfo *ci)\r\n{\r\n\tPBXRESULT pbxr = PBX_OK;\r\n\r\n\tDoPurge();\r\n\treturn pbxr;\r\n}\r\n \r\nvoid PbniHash::DoPurge()\r\n{\r\n\tvoid *key, *data;\r\n\tunsigned long keylen;\r\n\tint iRet;\r\n\tPPBDATAREC data_ptr;\r\n\thi_iterator_t *iter;\r\n\r\n\r\n\tif(HI_SUCCESS == hi_iterator_create(m_hi_handle, &iter))\r\n\t{\r\n\t\twhile(HI_SUCCESS == hi_iterator_getnext(iter, &data, &key, &keylen))\r\n\t\t{\r\n#ifdef _DEBUG\r\n\t\t\tOutputDebugStringA((char*)key);\r\n#endif\r\n\t\t\tiRet = hi_remove(m_hi_handle, key, keylen,(void**)&data_ptr);\r\n\t\t\tif (HI_SUCCESS == iRet)\r\n\t\t\t{\r\n\t\t\t\tfree(data_ptr->key);\r\n\t\t\t\tm_pSession->ReleaseValue((IPB_Value*)(data_ptr->data));\r\n\t\t\t\tfree(data_ptr);\r\n\t\t\t}\r\n\t\t}\r\n\t\thi_iterator_fini(iter);\r\n\t}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ucbprops.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 05:17: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 _UCBPROPS_HXX\n#define _UCBPROPS_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_LANG_XTYPEPROVIDER_HPP_\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSETINFO_HPP_\n#include <com\/sun\/star\/beans\/XPropertySetInfo.hpp>\n#endif\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n#ifndef _UCBHELPER_MACROS_HXX\n#include <ucbhelper\/macros.hxx>\n#endif\n\n\/\/=========================================================================\n\n#define PROPERTIES_MANAGER_SERVICE_NAME \"com.sun.star.ucb.PropertiesManager\"\n\n\/\/============================================================================\n\/\/\n\/\/ class UcbPropertiesManager.\n\/\/\n\/\/============================================================================\n\nclass UcbPropertiesManager :\n                public cppu::OWeakObject,\n                public com::sun::star::lang::XTypeProvider,\n                public com::sun::star::lang::XServiceInfo,\n                public com::sun::star::beans::XPropertySetInfo\n{\n    com::sun::star::uno::Sequence< com::sun::star::beans::Property >*\n                                m_pProps;\n    osl::Mutex                  m_aMutex;\n\nprivate:\n    sal_Bool queryProperty( const rtl::OUString& rName,\n                            com::sun::star::beans::Property& rProp );\n\npublic:\n    UcbPropertiesManager( const com::sun::star::uno::Reference<\n                            com::sun::star::lang::XMultiServiceFactory >&\n                                rxSMgr );\n    virtual ~UcbPropertiesManager();\n\n    \/\/ XInterface\n    XINTERFACE_DECL()\n\n    \/\/ XTypeProvider\n    XTYPEPROVIDER_DECL()\n\n    \/\/ XServiceInfo\n    XSERVICEINFO_DECL()\n\n    \/\/ XPropertySetInfo\n    virtual com::sun::star::uno::Sequence<\n                com::sun::star::beans::Property > SAL_CALL\n    getProperties()\n        throw( com::sun::star::uno::RuntimeException );\n    virtual com::sun::star::beans::Property SAL_CALL\n    getPropertyByName( const rtl::OUString& aName )\n        throw( com::sun::star::beans::UnknownPropertyException,\n               com::sun::star::uno::RuntimeException );\n    virtual sal_Bool SAL_CALL\n    hasPropertyByName( const rtl::OUString& Name )\n        throw( com::sun::star::uno::RuntimeException );\n};\n\n#endif \/* !_UCBPROPS_HXX *\/\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.138); FILE MERGED 2008\/04\/01 16:02:12 thb 1.3.138.3: #i85898# Stripping all external header guards 2008\/04\/01 12:58:00 thb 1.3.138.2: #i85898# Stripping all external header guards 2008\/03\/31 15:30:14 rt 1.3.138.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: ucbprops.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 _UCBPROPS_HXX\n#define _UCBPROPS_HXX\n\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#include <com\/sun\/star\/beans\/XPropertySetInfo.hpp>\n#include <cppuhelper\/weak.hxx>\n#include <osl\/mutex.hxx>\n#include <ucbhelper\/macros.hxx>\n\n\/\/=========================================================================\n\n#define PROPERTIES_MANAGER_SERVICE_NAME \"com.sun.star.ucb.PropertiesManager\"\n\n\/\/============================================================================\n\/\/\n\/\/ class UcbPropertiesManager.\n\/\/\n\/\/============================================================================\n\nclass UcbPropertiesManager :\n                public cppu::OWeakObject,\n                public com::sun::star::lang::XTypeProvider,\n                public com::sun::star::lang::XServiceInfo,\n                public com::sun::star::beans::XPropertySetInfo\n{\n    com::sun::star::uno::Sequence< com::sun::star::beans::Property >*\n                                m_pProps;\n    osl::Mutex                  m_aMutex;\n\nprivate:\n    sal_Bool queryProperty( const rtl::OUString& rName,\n                            com::sun::star::beans::Property& rProp );\n\npublic:\n    UcbPropertiesManager( const com::sun::star::uno::Reference<\n                            com::sun::star::lang::XMultiServiceFactory >&\n                                rxSMgr );\n    virtual ~UcbPropertiesManager();\n\n    \/\/ XInterface\n    XINTERFACE_DECL()\n\n    \/\/ XTypeProvider\n    XTYPEPROVIDER_DECL()\n\n    \/\/ XServiceInfo\n    XSERVICEINFO_DECL()\n\n    \/\/ XPropertySetInfo\n    virtual com::sun::star::uno::Sequence<\n                com::sun::star::beans::Property > SAL_CALL\n    getProperties()\n        throw( com::sun::star::uno::RuntimeException );\n    virtual com::sun::star::beans::Property SAL_CALL\n    getPropertyByName( const rtl::OUString& aName )\n        throw( com::sun::star::beans::UnknownPropertyException,\n               com::sun::star::uno::RuntimeException );\n    virtual sal_Bool SAL_CALL\n    hasPropertyByName( const rtl::OUString& Name )\n        throw( com::sun::star::uno::RuntimeException );\n};\n\n#endif \/* !_UCBPROPS_HXX *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2010-2014 Stanford University\n * Copyright (c) 2015 Diego Ongaro\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 <cassert>\n#include <errno.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <string.h>\n#include <sys\/epoll.h>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include \"Core\/Debug.h\"\n#include \"Core\/Endian.h\"\n#include \"Event\/Loop.h\"\n#include \"RPC\/MessageSocket.h\"\n\nnamespace LogCabin {\nnamespace RPC {\n\nnamespace {\n\n\/\/\/ Wrapper for dup().\nint\ndupOrPanic(int oldfd)\n{\n    int newfd = dup(oldfd);\n    if (newfd < 0)\n        PANIC(\"Failed to dup(%d): %s\", oldfd, strerror(errno));\n    return newfd;\n}\n\n} \/\/ anonymous namespace\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::SendSocket \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::SendSocket::SendSocket(int fd,\n                                      MessageSocket& messageSocket)\n    : Event::File(fd)\n    , messageSocket(messageSocket)\n{\n    int flag = 1;\n    int r = setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &flag, sizeof(flag));\n    if (r < 0) {\n        \/\/ This should be a warning, but some unit tests pass weird types of\n        \/\/ file descriptors in here. It's not very important, anyhow.\n        NOTICE(\"Could not set TCP_NODELAY flag on sending socket %d: %s\",\n               fd, strerror(errno));\n    }\n}\n\nMessageSocket::SendSocket::~SendSocket()\n{\n}\n\nvoid\nMessageSocket::SendSocket::handleFileEvent(uint32_t events)\n{\n    messageSocket.writable();\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::ReceiveSocket \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::ReceiveSocket::ReceiveSocket(int fd,\n                                            MessageSocket& messageSocket)\n    : Event::File(fd)\n    , messageSocket(messageSocket)\n{\n    \/\/ I don't know that TCP_NODELAY has any effect if we're only reading from\n    \/\/ this file descriptor, but I guess it can't hurt.\n    int flag = 1;\n    int r = setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &flag, sizeof(flag));\n    if (r < 0) {\n        \/\/ This should be a warning, but some unit tests pass weird types of\n        \/\/ file descriptors in here. It's not very important, anyhow.\n        NOTICE(\"Could not set TCP_NODELAY flag on receiving socket %d: %s\",\n                fd, strerror(errno));\n    }\n}\n\nMessageSocket::ReceiveSocket::~ReceiveSocket()\n{\n}\n\nvoid\nMessageSocket::ReceiveSocket::handleFileEvent(uint32_t events)\n{\n    messageSocket.readable();\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::Header \/\/\/\/\/\/\/\/\/\/\n\nvoid\nMessageSocket::Header::fromBigEndian()\n{\n    fixed = be16toh(fixed);\n    version = be16toh(version);\n    payloadLength = be32toh(payloadLength);\n    messageId = be64toh(messageId);\n}\n\nvoid\nMessageSocket::Header::toBigEndian()\n{\n    fixed = htobe16(fixed);\n    version = htobe16(version);\n    payloadLength = htobe32(payloadLength);\n    messageId = htobe64(messageId);\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::Inbound \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::Inbound::Inbound()\n    : bytesRead(0)\n    , header()\n    , message()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::Outbound \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::Outbound::Outbound()\n    : bytesSent(0)\n    , header()\n    , message()\n{\n}\n\nMessageSocket::Outbound::Outbound(Outbound&& other)\n    : bytesSent(other.bytesSent)\n    , header(other.header)\n    , message(std::move(other.message))\n{\n}\n\nMessageSocket::Outbound::Outbound(MessageId messageId,\n                                  Core::Buffer message)\n    : bytesSent(0)\n    , header()\n    , message(std::move(message))\n{\n    header.fixed = 0xdaf4;\n    header.version = 1;\n    header.payloadLength = uint32_t(this->message.getLength());\n    header.messageId = messageId;\n    header.toBigEndian();\n}\n\nMessageSocket::Outbound&\nMessageSocket::Outbound::operator=(Outbound&& other)\n{\n    bytesSent = other.bytesSent;\n    header = other.header;\n    message = std::move(other.message);\n    return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::MessageSocket(Handler& handler,\n                             Event::Loop& eventLoop, int fd,\n                             uint32_t maxMessageLength)\n    : maxMessageLength(maxMessageLength)\n    , handler(handler)\n    , eventLoop(eventLoop)\n    , inbound()\n    , outboundQueueMutex()\n    , outboundQueue()\n    , receiveSocket(dupOrPanic(fd), *this)\n    , sendSocket(fd, *this)\n    , receiveSocketMonitor(eventLoop, receiveSocket, EPOLLIN)\n    , sendSocketMonitor(eventLoop, sendSocket, 0)\n{\n}\n\nMessageSocket::~MessageSocket()\n{\n}\n\nvoid\nMessageSocket::close()\n{\n    receiveSocketMonitor.disableForever();\n    sendSocketMonitor.disableForever();\n\n    \/\/ Take an Event::Loop::Lock in case the handler assumes it's being\n    \/\/ executed on the event loop thread.\n    Event::Loop::Lock lock(eventLoop);\n    handler.handleDisconnect();\n}\n\nvoid\nMessageSocket::sendMessage(MessageId messageId, Core::Buffer contents)\n{\n    \/\/ Check the message length.\n    if (contents.getLength() > maxMessageLength) {\n        PANIC(\"Message of length %lu bytes is too long to send \"\n              \"(limit is %u bytes)\",\n              contents.getLength(), maxMessageLength);\n    }\n\n    bool kick;\n    { \/\/ Place the message on the outbound queue.\n        std::lock_guard<Core::Mutex> lock(outboundQueueMutex);\n        kick = outboundQueue.empty();\n        outboundQueue.emplace_back(messageId, std::move(contents));\n    }\n    \/\/ Make sure the SendSocket is set up to call writable().\n    if (kick)\n        sendSocketMonitor.setEvents(EPOLLOUT|EPOLLONESHOT);\n}\n\nvoid\nMessageSocket::disconnect()\n{\n    receiveSocketMonitor.disableForever();\n    sendSocketMonitor.disableForever();\n    \/\/ TODO(ongaro): to make it safe for epoll_wait to return multiple events,\n    \/\/ need to somehow queue the handleDisconnect for later.\n    handler.handleDisconnect();\n}\n\nvoid\nMessageSocket::readable()\n{\n    \/\/ Try to read data from the kernel until there is no more left.\n    while (true) {\n        if (inbound.bytesRead < sizeof(Header)) {\n            \/\/ Receiving header\n            ssize_t bytesRead = read(\n                reinterpret_cast<char*>(&inbound.header) + inbound.bytesRead,\n                sizeof(Header) - inbound.bytesRead);\n            if (bytesRead == -1) {\n                disconnect();\n                return;\n            }\n            inbound.bytesRead += size_t(bytesRead);\n            if (inbound.bytesRead < sizeof(Header))\n                return;\n            \/\/ Transition to receiving data\n            inbound.header.fromBigEndian();\n            if (inbound.header.fixed != 0xdaf4) {\n                WARNING(\"Disconnecting since message doesn't start with magic \"\n                        \"0xdaf4 (first two bytes are 0x%02x)\",\n                        inbound.header.fixed);\n                disconnect();\n            }\n            if (inbound.header.version != 1) {\n                WARNING(\"Disconnecting since message uses version %u, but \"\n                        \"this code only understands version 1\",\n                        inbound.header.version);\n                disconnect();\n            }\n            if (inbound.header.payloadLength > maxMessageLength) {\n                WARNING(\"Disconnecting since message is too long to receive \"\n                        \"(message is %u bytes, limit is %u bytes)\",\n                        inbound.header.payloadLength, maxMessageLength);\n                disconnect();\n                return;\n            }\n            inbound.message.setData(new char[inbound.header.payloadLength],\n                                    inbound.header.payloadLength,\n                                    Core::Buffer::deleteArrayFn<char>);\n        }\n        \/\/ Don't use 'else' here; we want to check this branch for two reasons:\n        \/\/ First, if there is a header with a length of 0, the socket won't be\n        \/\/ readable, but we still need to process the message. Second, most of\n        \/\/ the time the header will arrive with at least some data. It makes\n        \/\/ sense to go ahead and try a non-blocking read, rather than going\n        \/\/ back to the event loop.\n        if (inbound.bytesRead >= sizeof(Header)) {\n            \/\/ Receiving data\n            size_t payloadBytesRead = inbound.bytesRead - sizeof(Header);\n            ssize_t bytesRead = read(\n                (static_cast<char*>(inbound.message.getData()) +\n                 payloadBytesRead),\n                inbound.header.payloadLength - payloadBytesRead);\n            if (bytesRead == -1) {\n                disconnect();\n                return;\n            }\n            inbound.bytesRead += size_t(bytesRead);\n            if (inbound.bytesRead < (sizeof(Header) +\n                                     inbound.header.payloadLength)) {\n                return;\n            }\n            handler.handleReceivedMessage(inbound.header.messageId,\n                                          std::move(inbound.message));\n            \/\/ Transition to receiving header\n            inbound.bytesRead = 0;\n        }\n    }\n}\n\nssize_t\nMessageSocket::read(void* buf, size_t maxBytes)\n{\n    ssize_t actual = recv(receiveSocket.fd, buf, maxBytes, MSG_DONTWAIT);\n    if (actual > 0)\n        return actual;\n    if (actual == 0 || \/\/ peer performed orderly shutdown.\n        errno == ECONNRESET || errno == ETIMEDOUT || errno == EHOSTUNREACH) {\n        return -1;\n    }\n    if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR)\n        return 0;\n    PANIC(\"Error while reading from socket: %s\", strerror(errno));\n}\n\nvoid\nMessageSocket::writable()\n{\n    \/\/ Each iteration of this loop tries to write one message\n    \/\/ from outboundQueue.\n    while (true) {\n\n        \/\/ Get the next outbound message.\n        Outbound outbound;\n        int flags = MSG_DONTWAIT | MSG_NOSIGNAL;\n        {\n            std::lock_guard<Core::Mutex> lock(outboundQueueMutex);\n            if (outboundQueue.empty())\n                return;\n            outbound = std::move(outboundQueue.front());\n            outboundQueue.pop_front();\n            if (!outboundQueue.empty())\n                flags |= MSG_MORE;\n        }\n\n        \/\/ Use an iovec to send everything in one kernel call: one iov for the\n        \/\/ header, another for the payload.\n        enum { IOV_LEN = 2 };\n        struct iovec iov[IOV_LEN];\n        iov[0].iov_base = &outbound.header;\n        iov[0].iov_len = sizeof(Header);\n        iov[1].iov_base = outbound.message.getData();\n        iov[1].iov_len = outbound.message.getLength();\n\n        { \/\/ Skip the parts of the iovec that have already been sent.\n            size_t bytesSent = outbound.bytesSent;\n            for (uint32_t i = 0; i < IOV_LEN; ++i) {\n                iov[i].iov_base = (static_cast<char*>(iov[i].iov_base) +\n                                   bytesSent);\n                if (bytesSent < iov[i].iov_len) {\n                    iov[i].iov_len -= bytesSent;\n                    break;\n                } else {\n                    bytesSent -= iov[i].iov_len;\n                    iov[i].iov_len = 0;\n                }\n            }\n        }\n\n        struct msghdr msg;\n        memset(&msg, 0, sizeof(msg));\n        msg.msg_iov = iov;\n        msg.msg_iovlen = IOV_LEN;\n\n        \/\/ Do the actual send\n        ssize_t bytesSent = sendmsg(sendSocket.fd, &msg, flags);\n        if (bytesSent < 0) {\n            if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR) {\n                \/\/ Wasn't able to send, try again later.\n                bytesSent = 0;\n            } else if (errno == ECONNRESET || errno == EPIPE) {\n                \/\/ Connection closed; disconnect this end.\n                \/\/ This must be the last line to touch this object, in case\n                \/\/ handleDisconnect() deletes this object.\n                disconnect();\n                return;\n            } else {\n                \/\/ Unexpected error.\n                PANIC(\"Error while writing to socket %d: %s\",\n                      sendSocket.fd, strerror(errno));\n            }\n        }\n\n        \/\/ Sent successfully.\n        outbound.bytesSent += size_t(bytesSent);\n        if (outbound.bytesSent != (sizeof(Header) +\n                                   outbound.message.getLength())) {\n            sendSocketMonitor.setEvents(EPOLLOUT|EPOLLONESHOT);\n            std::lock_guard<Core::Mutex> lockGuard(outboundQueueMutex);\n            outboundQueue.emplace_front(std::move(outbound));\n            return;\n        }\n    }\n}\n\n} \/\/ namespace LogCabin::RPC\n} \/\/ namespace LogCabin\n<commit_msg>MessageSocket: Add missing returns after disconnect()<commit_after>\/* Copyright (c) 2010-2014 Stanford University\n * Copyright (c) 2015 Diego Ongaro\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 <cassert>\n#include <errno.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <string.h>\n#include <sys\/epoll.h>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include \"Core\/Debug.h\"\n#include \"Core\/Endian.h\"\n#include \"Event\/Loop.h\"\n#include \"RPC\/MessageSocket.h\"\n\nnamespace LogCabin {\nnamespace RPC {\n\nnamespace {\n\n\/\/\/ Wrapper for dup().\nint\ndupOrPanic(int oldfd)\n{\n    int newfd = dup(oldfd);\n    if (newfd < 0)\n        PANIC(\"Failed to dup(%d): %s\", oldfd, strerror(errno));\n    return newfd;\n}\n\n} \/\/ anonymous namespace\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::SendSocket \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::SendSocket::SendSocket(int fd,\n                                      MessageSocket& messageSocket)\n    : Event::File(fd)\n    , messageSocket(messageSocket)\n{\n    int flag = 1;\n    int r = setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &flag, sizeof(flag));\n    if (r < 0) {\n        \/\/ This should be a warning, but some unit tests pass weird types of\n        \/\/ file descriptors in here. It's not very important, anyhow.\n        NOTICE(\"Could not set TCP_NODELAY flag on sending socket %d: %s\",\n               fd, strerror(errno));\n    }\n}\n\nMessageSocket::SendSocket::~SendSocket()\n{\n}\n\nvoid\nMessageSocket::SendSocket::handleFileEvent(uint32_t events)\n{\n    messageSocket.writable();\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::ReceiveSocket \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::ReceiveSocket::ReceiveSocket(int fd,\n                                            MessageSocket& messageSocket)\n    : Event::File(fd)\n    , messageSocket(messageSocket)\n{\n    \/\/ I don't know that TCP_NODELAY has any effect if we're only reading from\n    \/\/ this file descriptor, but I guess it can't hurt.\n    int flag = 1;\n    int r = setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &flag, sizeof(flag));\n    if (r < 0) {\n        \/\/ This should be a warning, but some unit tests pass weird types of\n        \/\/ file descriptors in here. It's not very important, anyhow.\n        NOTICE(\"Could not set TCP_NODELAY flag on receiving socket %d: %s\",\n                fd, strerror(errno));\n    }\n}\n\nMessageSocket::ReceiveSocket::~ReceiveSocket()\n{\n}\n\nvoid\nMessageSocket::ReceiveSocket::handleFileEvent(uint32_t events)\n{\n    messageSocket.readable();\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::Header \/\/\/\/\/\/\/\/\/\/\n\nvoid\nMessageSocket::Header::fromBigEndian()\n{\n    fixed = be16toh(fixed);\n    version = be16toh(version);\n    payloadLength = be32toh(payloadLength);\n    messageId = be64toh(messageId);\n}\n\nvoid\nMessageSocket::Header::toBigEndian()\n{\n    fixed = htobe16(fixed);\n    version = htobe16(version);\n    payloadLength = htobe32(payloadLength);\n    messageId = htobe64(messageId);\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::Inbound \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::Inbound::Inbound()\n    : bytesRead(0)\n    , header()\n    , message()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket::Outbound \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::Outbound::Outbound()\n    : bytesSent(0)\n    , header()\n    , message()\n{\n}\n\nMessageSocket::Outbound::Outbound(Outbound&& other)\n    : bytesSent(other.bytesSent)\n    , header(other.header)\n    , message(std::move(other.message))\n{\n}\n\nMessageSocket::Outbound::Outbound(MessageId messageId,\n                                  Core::Buffer message)\n    : bytesSent(0)\n    , header()\n    , message(std::move(message))\n{\n    header.fixed = 0xdaf4;\n    header.version = 1;\n    header.payloadLength = uint32_t(this->message.getLength());\n    header.messageId = messageId;\n    header.toBigEndian();\n}\n\nMessageSocket::Outbound&\nMessageSocket::Outbound::operator=(Outbound&& other)\n{\n    bytesSent = other.bytesSent;\n    header = other.header;\n    message = std::move(other.message);\n    return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/ MessageSocket \/\/\/\/\/\/\/\/\/\/\n\nMessageSocket::MessageSocket(Handler& handler,\n                             Event::Loop& eventLoop, int fd,\n                             uint32_t maxMessageLength)\n    : maxMessageLength(maxMessageLength)\n    , handler(handler)\n    , eventLoop(eventLoop)\n    , inbound()\n    , outboundQueueMutex()\n    , outboundQueue()\n    , receiveSocket(dupOrPanic(fd), *this)\n    , sendSocket(fd, *this)\n    , receiveSocketMonitor(eventLoop, receiveSocket, EPOLLIN)\n    , sendSocketMonitor(eventLoop, sendSocket, 0)\n{\n}\n\nMessageSocket::~MessageSocket()\n{\n}\n\nvoid\nMessageSocket::close()\n{\n    receiveSocketMonitor.disableForever();\n    sendSocketMonitor.disableForever();\n\n    \/\/ Take an Event::Loop::Lock in case the handler assumes it's being\n    \/\/ executed on the event loop thread.\n    Event::Loop::Lock lock(eventLoop);\n    handler.handleDisconnect();\n}\n\nvoid\nMessageSocket::sendMessage(MessageId messageId, Core::Buffer contents)\n{\n    \/\/ Check the message length.\n    if (contents.getLength() > maxMessageLength) {\n        PANIC(\"Message of length %lu bytes is too long to send \"\n              \"(limit is %u bytes)\",\n              contents.getLength(), maxMessageLength);\n    }\n\n    bool kick;\n    { \/\/ Place the message on the outbound queue.\n        std::lock_guard<Core::Mutex> lock(outboundQueueMutex);\n        kick = outboundQueue.empty();\n        outboundQueue.emplace_back(messageId, std::move(contents));\n    }\n    \/\/ Make sure the SendSocket is set up to call writable().\n    if (kick)\n        sendSocketMonitor.setEvents(EPOLLOUT|EPOLLONESHOT);\n}\n\nvoid\nMessageSocket::disconnect()\n{\n    receiveSocketMonitor.disableForever();\n    sendSocketMonitor.disableForever();\n    \/\/ TODO(ongaro): to make it safe for epoll_wait to return multiple events,\n    \/\/ need to somehow queue the handleDisconnect for later.\n    handler.handleDisconnect();\n}\n\nvoid\nMessageSocket::readable()\n{\n    \/\/ Try to read data from the kernel until there is no more left.\n    while (true) {\n        if (inbound.bytesRead < sizeof(Header)) {\n            \/\/ Receiving header\n            ssize_t bytesRead = read(\n                reinterpret_cast<char*>(&inbound.header) + inbound.bytesRead,\n                sizeof(Header) - inbound.bytesRead);\n            if (bytesRead == -1) {\n                disconnect();\n                return;\n            }\n            inbound.bytesRead += size_t(bytesRead);\n            if (inbound.bytesRead < sizeof(Header))\n                return;\n            \/\/ Transition to receiving data\n            inbound.header.fromBigEndian();\n            if (inbound.header.fixed != 0xdaf4) {\n                WARNING(\"Disconnecting since message doesn't start with magic \"\n                        \"0xdaf4 (first two bytes are 0x%02x)\",\n                        inbound.header.fixed);\n                disconnect();\n                return;\n            }\n            if (inbound.header.version != 1) {\n                WARNING(\"Disconnecting since message uses version %u, but \"\n                        \"this code only understands version 1\",\n                        inbound.header.version);\n                disconnect();\n                return;\n            }\n            if (inbound.header.payloadLength > maxMessageLength) {\n                WARNING(\"Disconnecting since message is too long to receive \"\n                        \"(message is %u bytes, limit is %u bytes)\",\n                        inbound.header.payloadLength, maxMessageLength);\n                disconnect();\n                return;\n            }\n            inbound.message.setData(new char[inbound.header.payloadLength],\n                                    inbound.header.payloadLength,\n                                    Core::Buffer::deleteArrayFn<char>);\n        }\n        \/\/ Don't use 'else' here; we want to check this branch for two reasons:\n        \/\/ First, if there is a header with a length of 0, the socket won't be\n        \/\/ readable, but we still need to process the message. Second, most of\n        \/\/ the time the header will arrive with at least some data. It makes\n        \/\/ sense to go ahead and try a non-blocking read, rather than going\n        \/\/ back to the event loop.\n        if (inbound.bytesRead >= sizeof(Header)) {\n            \/\/ Receiving data\n            size_t payloadBytesRead = inbound.bytesRead - sizeof(Header);\n            ssize_t bytesRead = read(\n                (static_cast<char*>(inbound.message.getData()) +\n                 payloadBytesRead),\n                inbound.header.payloadLength - payloadBytesRead);\n            if (bytesRead == -1) {\n                disconnect();\n                return;\n            }\n            inbound.bytesRead += size_t(bytesRead);\n            if (inbound.bytesRead < (sizeof(Header) +\n                                     inbound.header.payloadLength)) {\n                return;\n            }\n            handler.handleReceivedMessage(inbound.header.messageId,\n                                          std::move(inbound.message));\n            \/\/ Transition to receiving header\n            inbound.bytesRead = 0;\n        }\n    }\n}\n\nssize_t\nMessageSocket::read(void* buf, size_t maxBytes)\n{\n    ssize_t actual = recv(receiveSocket.fd, buf, maxBytes, MSG_DONTWAIT);\n    if (actual > 0)\n        return actual;\n    if (actual == 0 || \/\/ peer performed orderly shutdown.\n        errno == ECONNRESET || errno == ETIMEDOUT || errno == EHOSTUNREACH) {\n        return -1;\n    }\n    if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR)\n        return 0;\n    PANIC(\"Error while reading from socket: %s\", strerror(errno));\n}\n\nvoid\nMessageSocket::writable()\n{\n    \/\/ Each iteration of this loop tries to write one message\n    \/\/ from outboundQueue.\n    while (true) {\n\n        \/\/ Get the next outbound message.\n        Outbound outbound;\n        int flags = MSG_DONTWAIT | MSG_NOSIGNAL;\n        {\n            std::lock_guard<Core::Mutex> lock(outboundQueueMutex);\n            if (outboundQueue.empty())\n                return;\n            outbound = std::move(outboundQueue.front());\n            outboundQueue.pop_front();\n            if (!outboundQueue.empty())\n                flags |= MSG_MORE;\n        }\n\n        \/\/ Use an iovec to send everything in one kernel call: one iov for the\n        \/\/ header, another for the payload.\n        enum { IOV_LEN = 2 };\n        struct iovec iov[IOV_LEN];\n        iov[0].iov_base = &outbound.header;\n        iov[0].iov_len = sizeof(Header);\n        iov[1].iov_base = outbound.message.getData();\n        iov[1].iov_len = outbound.message.getLength();\n\n        { \/\/ Skip the parts of the iovec that have already been sent.\n            size_t bytesSent = outbound.bytesSent;\n            for (uint32_t i = 0; i < IOV_LEN; ++i) {\n                iov[i].iov_base = (static_cast<char*>(iov[i].iov_base) +\n                                   bytesSent);\n                if (bytesSent < iov[i].iov_len) {\n                    iov[i].iov_len -= bytesSent;\n                    break;\n                } else {\n                    bytesSent -= iov[i].iov_len;\n                    iov[i].iov_len = 0;\n                }\n            }\n        }\n\n        struct msghdr msg;\n        memset(&msg, 0, sizeof(msg));\n        msg.msg_iov = iov;\n        msg.msg_iovlen = IOV_LEN;\n\n        \/\/ Do the actual send\n        ssize_t bytesSent = sendmsg(sendSocket.fd, &msg, flags);\n        if (bytesSent < 0) {\n            if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR) {\n                \/\/ Wasn't able to send, try again later.\n                bytesSent = 0;\n            } else if (errno == ECONNRESET || errno == EPIPE) {\n                \/\/ Connection closed; disconnect this end.\n                \/\/ This must be the last line to touch this object, in case\n                \/\/ handleDisconnect() deletes this object.\n                disconnect();\n                return;\n            } else {\n                \/\/ Unexpected error.\n                PANIC(\"Error while writing to socket %d: %s\",\n                      sendSocket.fd, strerror(errno));\n            }\n        }\n\n        \/\/ Sent successfully.\n        outbound.bytesSent += size_t(bytesSent);\n        if (outbound.bytesSent != (sizeof(Header) +\n                                   outbound.message.getLength())) {\n            sendSocketMonitor.setEvents(EPOLLOUT|EPOLLONESHOT);\n            std::lock_guard<Core::Mutex> lockGuard(outboundQueueMutex);\n            outboundQueue.emplace_front(std::move(outbound));\n            return;\n        }\n    }\n}\n\n} \/\/ namespace LogCabin::RPC\n} \/\/ namespace LogCabin\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Clever programming language\n * Copyright (c) Clever Team\n *\n * This file is distributed under the MIT license. See LICENSE for details.\n *\/\n\n#include <iostream>\n#include \"core\/ast.h\"\n#include \"core\/codegen.h\"\n#include \"core\/scope.h\"\n#include \"core\/compiler.h\"\n\nnamespace clever { namespace ast {\n\nstatic inline void _prepare_operand(Operand& op, Node* node)\n{\n\tif (node->isLiteral()) {\n\t\top = Operand(FETCH_CONST, static_cast<Literal*>(node)->getConstId());\n\t} else if (node->getScope()) {\n\t\top = Operand(FETCH_VAR, node->getValueId(),\tnode->getScope()->getId());\n\t} else {\n\t\top = Operand(FETCH_TMP, node->getValueId());\n\t}\n}\n\nvoid Codegen::visit(IntLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(DoubleLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(StringLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(Ident* node)\n{\n\tSymbol* sym = m_scope->getAny(node->getName());\n\n\tif (!sym) {\n\t\tCompiler::errorf(node->getLocation(),\n\t\t\t\"Variable `%S' not found!\", node->getName());\n\t}\n\n\tnode->setValueId(sym->value_id);\n\tnode->setScope(sym->scope);\n}\n\nvoid Codegen::visit(Block* node)\n{\n\tm_scope = node->getScope();\n\n\tVisitor::visit(static_cast<NodeArray*>(node));\n\n\tm_scope = m_scope->getParent();\n}\n\nvoid Codegen::visit(VariableDecl* node)\n{\n\tnode->getAssignment()->accept(*this);\n}\n\nvoid Codegen::visit(Assignment* node)\n{\n\t\/\/ TODO: allow assignment of any possible left hand side.\n\tSymbol* sym = static_cast<Ident*>(node->getLhs())->getSymbol();\n\tNode* rhs = node->getRhs();\n\n\tclever_assert_not_null(sym);\n\n\tif (node->isConditional()) {\n\t\tm_ir.push_back(IR(OP_JMPNZ,\n\t\t\tOperand(FETCH_VAR, sym->value_id, sym->scope->getId()),\n\t\t\tOperand(JMP_ADDR, m_ir.size() + 2)));\n\t}\n\n\tif (rhs) {\n\t\trhs->accept(*this);\n\t}\n\tm_ir.push_back(IR(OP_ASSIGN,\n\t\t\tOperand(FETCH_VAR, sym->value_id, sym->scope->getId())));\n\n\tif (!rhs) {\n\t\tm_ir.back().op2 = Operand(FETCH_TMP, m_compiler->getTempValue());\n\t} else {\n\t\tif (rhs->isLiteral()) {\n\t\t\tm_ir.back().op2 = Operand(FETCH_CONST,\n\t\t\t\tstatic_cast<Literal*>(rhs)->getConstId());\n\t\t} else if (rhs->getScope()) {\n\t\t\tm_ir.back().op2 = Operand(FETCH_VAR, rhs->getValueId(),\n\t\t\t\trhs->getScope()->getId());\n\t\t} else {\n\t\t\tm_ir.back().op2 = Operand(FETCH_TMP, rhs->getValueId());\n\t\t}\n\t}\n}\n\nvoid Codegen::visit(FunctionCall* node)\n{\n\t\/\/ TODO: allow call for any possible callee\n\tSymbol* sym = static_cast<Ident*>(node->getCallee())->getSymbol();\n\n\tclever_assert_not_null(sym);\n\n\tif (node->hasArgs()) {\n\t\tNodeList& args = node->getArgs()->getNodes();\n\t\tNodeList::const_iterator it = args.begin(), end = args.end();\n\n\t\twhile (it != end) {\n\t\t\tOperand operand;\n\n\t\t\t(*it)->accept(*this);\n\n\t\t\tif ((*it)->isLiteral()) {\n\t\t\t\toperand.op_type = FETCH_CONST;\n\t\t\t\toperand.value_id = static_cast<Literal*>(*it)->getConstId();\n\t\t\t} else {\n\t\t\t\toperand.op_type = (*it)->isEvaluable() ? FETCH_TMP : FETCH_VAR;\n\t\t\t\toperand.value_id = (*it)->getValueId();\n\t\t\t\tif ((*it)->getScope()) {\n\t\t\t\t\toperand.scope_id = (*it)->getScope()->getId();\n\t\t\t\t}\n\t\t\t}\n\t\t\tm_ir.push_back(IR(OP_SEND_VAL, operand));\n\t\t\t++it;\n\t\t}\n\t}\n\n\tm_ir.push_back(IR(OP_FCALL,\n\t\tOperand(FETCH_VAR, sym->value_id, sym->scope->getId())));\n\n\tsize_t tmp_id = m_compiler->getTempValue();\n\n\tm_ir.back().result = Operand(FETCH_TMP, tmp_id);\n\n\tnode->setValueId(tmp_id);\n}\n\nvoid Codegen::visit(FunctionDecl* node)\n{\n\tsize_t start_func = m_ir.size();\n\n\tm_ir.push_back(IR(OP_JMP, Operand(JMP_ADDR, 0)));\n\n\tSymbol* sym = node->getIdent()->getSymbol();\n\tValue* funcval = sym->scope->getValue(sym->value_id);\n\tFunction* func = static_cast<Function*>(funcval->getObj());\n\tfunc->setAddr(m_ir.size());\n\n\tm_scope = node->getScope();\n\n\tif (node->hasArgs()) {\n\t\tnode->getArgs()->accept(*this);\n\t}\n\n\tnode->getBlock()->accept(*this);\n\n\tm_scope = m_scope->getParent();\n\n\tm_ir.push_back(IR(OP_LEAVE));\n\n\tm_ir[start_func].op1.value_id = m_ir.size();\n\n\tif (node->isAnonymous()) {\n\t\tnode->setValueId(sym->value_id);\n\t\tnode->setScope(sym->scope);\n\t}\n}\n\nvoid Codegen::visit(Return* node)\n{\n\tif (node->hasValue()) {\n\t\tNode* value = node->getValue();\n\n\t\tvalue->accept(*this);\n\n\t\tm_ir.push_back(IR(OP_RET));\n\n\t\tif (value->isLiteral()) {\n\t\t\tm_ir.back().op1 = Operand(FETCH_CONST,\n\t\t\t\tstatic_cast<Literal*>(value)->getConstId());\n\t\t} else if (value->getScope()) {\n\t\t\tm_ir.back().op1 = Operand(FETCH_VAR,\n\t\t\t\tvalue->getValueId(), value->getScope()->getId());\n\t\t} else {\n\t\t\tm_ir.back().op1 = Operand(FETCH_TMP, value->getValueId());\n\t\t}\n\t} else {\n\t\tm_ir.push_back(IR(OP_RET));\n\t}\n}\n\nvoid Codegen::visit(While* node)\n{\n\tsize_t start_while = m_ir.size();\n\tNode* cond = node->getCondition();\n\n\tcond->accept(*this);\n\n\tif (cond->isLiteral()) {\n\t\tm_ir.push_back(IR(OP_JMPZ,\n\t\t\tOperand(FETCH_CONST, static_cast<Literal*>(cond)->getConstId())));\n\t} else if (cond->getScope()) {\n\t\tm_ir.push_back(IR(OP_JMPZ,\n\t\t\tOperand(FETCH_VAR, cond->getValueId(), cond->getScope()->getId())));\n\t} else {\n\t\tm_ir.push_back(IR(OP_JMPZ,\tOperand(FETCH_TMP, cond->getValueId())));\n\t}\n\n\tnode->getBlock()->accept(*this);\n\n\tm_ir.push_back(IR(OP_JMP, Operand(JMP_ADDR, start_while)));\n\n\tm_ir[start_while].op2.value_id = m_ir.size();\n}\n\nvoid Codegen::visit(IncDec* node)\n{\n\tOpcode op;\n\n\tnode->getVar()->accept(*this);\n\n\tswitch (node->getOperator()) {\n\t\tcase IncDec::PRE_INC: op = OP_PRE_INC; break;\n\t\tcase IncDec::PRE_DEC: op = OP_PRE_DEC; break;\n\t\tcase IncDec::POS_INC: op = OP_POS_INC; break;\n\t\tcase IncDec::POS_DEC: op = OP_POS_DEC; break;\n\t}\n\n\tm_ir.push_back(IR(op,\n\t\tOperand(FETCH_VAR, node->getVar()->getValueId(),\n\t\t\tnode->getVar()->getScope()->getId())));\n\n\tsize_t tmp_id = m_compiler->getTempValue();\n\n\tm_ir.back().result = Operand(FETCH_TMP, tmp_id);\n\n\tnode->setValueId(tmp_id);\n}\n\nvoid Codegen::visit(Arithmetic* node)\n{\n\tNode* lhs = node->getLhs();\n\tNode* rhs = node->getRhs();\n\tOpcode op;\n\n\tswitch (node->getOperator()) {\n\t\tcase Arithmetic::MOP_ADD: op = OP_ADD; break;\n\t\tcase Arithmetic::MOP_SUB: op = OP_SUB; break;\n\t\tcase Arithmetic::MOP_MUL: op = OP_MUL; break;\n\t\tcase Arithmetic::MOP_DIV: op = OP_DIV; break;\n\t\tcase Arithmetic::MOP_MOD: op = OP_MOD; break;\n\t}\n\n\tlhs->accept(*this);\n\trhs->accept(*this);\n\n\tm_ir.push_back(IR(op));\n\n\t_prepare_operand(m_ir.back().op1, lhs);\n\t_prepare_operand(m_ir.back().op2, rhs);\n\n\tsize_t tmp_id = m_compiler->getTempValue();\n\n\tm_ir.back().result = Operand(FETCH_TMP, tmp_id);\n\n\tnode->setValueId(tmp_id);\n}\n\nvoid Codegen::visit(Logic* node)\n{\n\tNode* lhs = node->getLhs();\n\tNode* rhs = node->getRhs();\n\tOpcode op;\n\n\tswitch (node->getOperator()) {\n\t\tcase Logic::LOP_EQUALS: op = OP_EQUAL; break;\n\t\tcase Logic::LOP_AND:    op = OP_AND;   break;\n\t\tcase Logic::LOP_OR:     op = OP_OR;    break;\n\t}\n\n\tlhs->accept(*this);\n\trhs->accept(*this);\n\n\tm_ir.push_back(IR(op));\n\n\t_prepare_operand(m_ir.back().op1, lhs);\n\t_prepare_operand(m_ir.back().op2, rhs);\n\n\tsize_t tmp_id = m_compiler->getTempValue();\n\n\tm_ir.back().result = Operand(FETCH_TMP, tmp_id);\n\n\tnode->setValueId(tmp_id);\n}\n\nvoid Codegen::visit(If* node)\n{\n\tsize_t last_jmpz = 0;\n\tstd::vector<std::pair<Node*, Node*> >& branches = node->getConditionals();\n\tstd::vector<std::pair<Node*, Node*> >::const_iterator it(branches.begin()),\n\t\tend(branches.end());\n\n\tm_jmps.push(AddrVector());\n\n\twhile (it != end) {\n\t\tNode* cond  = (*it).first;\n\t\tNode* block = (*it).second;\n\n\t\tcond->accept(*this);\n\n\t\tlast_jmpz = m_ir.size();\n\t\tm_ir.push_back(IR(OP_JMPZ));\n\n\t\tif (cond->isLiteral()) {\n\t\t\tm_ir.back().op1 = Operand(FETCH_CONST, static_cast<Literal*>(cond)->getConstId());\n\t\t} else if (cond->getScope()) {\n\t\t\tm_ir.back().op1 = Operand(FETCH_VAR, cond->getValueId(), cond->getScope()->getId());\n\t\t} else {\n\t\t\tm_ir.back().op1 = Operand(FETCH_TMP, cond->getValueId());\n\t\t}\n\n\t\tblock->accept(*this);\n\n\t\tm_jmps.top().push_back(m_ir.size());\n\t\tm_ir.push_back(IR(OP_JMP)); \/\/ JMP to outside if-elseif-else\n\n\t\tm_ir[last_jmpz].op2 = Operand(JMP_ADDR, m_ir.size());\n\n\t\t++it;\n\t}\n\n\tif (node->getElseNode()) {\n\t\tnode->getElseNode()->accept(*this);\n\t}\n\n\tAddrVector& vec = m_jmps.top();\n\tfor (size_t i = 0, j = vec.size(); i < j; ++i) {\n\t\tm_ir[vec[i]].op1 = Operand(JMP_ADDR, m_ir.size());\n\t}\n\n\tm_jmps.pop();\n}\n\n}} \/\/ clever::ast\n<commit_msg>- Reuse code!<commit_after>\/**\n * Clever programming language\n * Copyright (c) Clever Team\n *\n * This file is distributed under the MIT license. See LICENSE for details.\n *\/\n\n#include <iostream>\n#include \"core\/ast.h\"\n#include \"core\/codegen.h\"\n#include \"core\/scope.h\"\n#include \"core\/compiler.h\"\n\nnamespace clever { namespace ast {\n\nstatic inline void _prepare_operand(Operand& op, Node* node)\n{\n\tif (node->isLiteral()) {\n\t\top = Operand(FETCH_CONST, static_cast<Literal*>(node)->getConstId());\n\t} else if (node->getScope()) {\n\t\top = Operand(FETCH_VAR, node->getValueId(),\tnode->getScope()->getId());\n\t} else {\n\t\top = Operand(FETCH_TMP, node->getValueId());\n\t}\n}\n\nvoid Codegen::visit(IntLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(DoubleLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(StringLit* node)\n{\n\tnode->setConstId(m_compiler->addConstant(new Value(node->getValue())));\n}\n\nvoid Codegen::visit(Ident* node)\n{\n\tSymbol* sym = m_scope->getAny(node->getName());\n\n\tif (!sym) {\n\t\tCompiler::errorf(node->getLocation(),\n\t\t\t\"Variable `%S' not found!\", node->getName());\n\t}\n\n\tnode->setValueId(sym->value_id);\n\tnode->setScope(sym->scope);\n}\n\nvoid Codegen::visit(Block* node)\n{\n\tm_scope = node->getScope();\n\n\tVisitor::visit(static_cast<NodeArray*>(node));\n\n\tm_scope = m_scope->getParent();\n}\n\nvoid Codegen::visit(VariableDecl* node)\n{\n\tnode->getAssignment()->accept(*this);\n}\n\nvoid Codegen::visit(Assignment* node)\n{\n\t\/\/ TODO: allow assignment of any possible left hand side.\n\tSymbol* sym = static_cast<Ident*>(node->getLhs())->getSymbol();\n\tNode* rhs = node->getRhs();\n\n\tclever_assert_not_null(sym);\n\n\tif (node->isConditional()) {\n\t\tm_ir.push_back(IR(OP_JMPNZ,\n\t\t\tOperand(FETCH_VAR, sym->value_id, sym->scope->getId()),\n\t\t\tOperand(JMP_ADDR, m_ir.size() + 2)));\n\t}\n\n\tif (rhs) {\n\t\trhs->accept(*this);\n\t}\n\tm_ir.push_back(IR(OP_ASSIGN,\n\t\t\tOperand(FETCH_VAR, sym->value_id, sym->scope->getId())));\n\n\tif (!rhs) {\n\t\tm_ir.back().op2 = Operand(FETCH_TMP, m_compiler->getTempValue());\n\t} else {\n\t\t_prepare_operand(m_ir.back().op2, rhs);\n\t}\n}\n\nvoid Codegen::visit(FunctionCall* node)\n{\n\t\/\/ TODO: allow call for any possible callee\n\tSymbol* sym = static_cast<Ident*>(node->getCallee())->getSymbol();\n\n\tclever_assert_not_null(sym);\n\n\tif (node->hasArgs()) {\n\t\tNodeList& args = node->getArgs()->getNodes();\n\t\tNodeList::const_iterator it = args.begin(), end = args.end();\n\n\t\twhile (it != end) {\n\t\t\t(*it)->accept(*this);\n\n\t\t\tm_ir.push_back(IR(OP_SEND_VAL));\n\n\t\t\t_prepare_operand(m_ir.back().op1, *it);\n\t\t\t++it;\n\t\t}\n\t}\n\n\tm_ir.push_back(IR(OP_FCALL,\n\t\tOperand(FETCH_VAR, sym->value_id, sym->scope->getId())));\n\n\tsize_t tmp_id = m_compiler->getTempValue();\n\n\tm_ir.back().result = Operand(FETCH_TMP, tmp_id);\n\n\tnode->setValueId(tmp_id);\n}\n\nvoid Codegen::visit(FunctionDecl* node)\n{\n\tsize_t start_func = m_ir.size();\n\n\tm_ir.push_back(IR(OP_JMP, Operand(JMP_ADDR, 0)));\n\n\tSymbol* sym = node->getIdent()->getSymbol();\n\tValue* funcval = sym->scope->getValue(sym->value_id);\n\tFunction* func = static_cast<Function*>(funcval->getObj());\n\tfunc->setAddr(m_ir.size());\n\n\tm_scope = node->getScope();\n\n\tif (node->hasArgs()) {\n\t\tnode->getArgs()->accept(*this);\n\t}\n\n\tnode->getBlock()->accept(*this);\n\n\tm_scope = m_scope->getParent();\n\n\tm_ir.push_back(IR(OP_LEAVE));\n\n\tm_ir[start_func].op1.value_id = m_ir.size();\n\n\tif (node->isAnonymous()) {\n\t\tnode->setValueId(sym->value_id);\n\t\tnode->setScope(sym->scope);\n\t}\n}\n\nvoid Codegen::visit(Return* node)\n{\n\tif (node->hasValue()) {\n\t\tNode* value = node->getValue();\n\n\t\tvalue->accept(*this);\n\n\t\tm_ir.push_back(IR(OP_RET));\n\n\t\t_prepare_operand(m_ir.back().op1, value);\n\t} else {\n\t\tm_ir.push_back(IR(OP_RET));\n\t}\n}\n\nvoid Codegen::visit(While* node)\n{\n\tsize_t start_while = m_ir.size();\n\tNode* cond = node->getCondition();\n\n\tcond->accept(*this);\n\n\tm_ir.push_back(IR(OP_JMPZ));\n\n\t_prepare_operand(m_ir.back().op1, cond);\n\n\tnode->getBlock()->accept(*this);\n\n\tm_ir.push_back(IR(OP_JMP, Operand(JMP_ADDR, start_while)));\n\n\tm_ir[start_while].op2.value_id = m_ir.size();\n}\n\nvoid Codegen::visit(IncDec* node)\n{\n\tOpcode op;\n\n\tnode->getVar()->accept(*this);\n\n\tswitch (node->getOperator()) {\n\t\tcase IncDec::PRE_INC: op = OP_PRE_INC; break;\n\t\tcase IncDec::PRE_DEC: op = OP_PRE_DEC; break;\n\t\tcase IncDec::POS_INC: op = OP_POS_INC; break;\n\t\tcase IncDec::POS_DEC: op = OP_POS_DEC; break;\n\t}\n\n\tm_ir.push_back(IR(op,\n\t\tOperand(FETCH_VAR, node->getVar()->getValueId(),\n\t\t\tnode->getVar()->getScope()->getId())));\n\n\tsize_t tmp_id = m_compiler->getTempValue();\n\n\tm_ir.back().result = Operand(FETCH_TMP, tmp_id);\n\n\tnode->setValueId(tmp_id);\n}\n\nvoid Codegen::visit(Arithmetic* node)\n{\n\tNode* lhs = node->getLhs();\n\tNode* rhs = node->getRhs();\n\tOpcode op;\n\n\tswitch (node->getOperator()) {\n\t\tcase Arithmetic::MOP_ADD: op = OP_ADD; break;\n\t\tcase Arithmetic::MOP_SUB: op = OP_SUB; break;\n\t\tcase Arithmetic::MOP_MUL: op = OP_MUL; break;\n\t\tcase Arithmetic::MOP_DIV: op = OP_DIV; break;\n\t\tcase Arithmetic::MOP_MOD: op = OP_MOD; break;\n\t}\n\n\tlhs->accept(*this);\n\trhs->accept(*this);\n\n\tm_ir.push_back(IR(op));\n\n\t_prepare_operand(m_ir.back().op1, lhs);\n\t_prepare_operand(m_ir.back().op2, rhs);\n\n\tsize_t tmp_id = m_compiler->getTempValue();\n\n\tm_ir.back().result = Operand(FETCH_TMP, tmp_id);\n\n\tnode->setValueId(tmp_id);\n}\n\nvoid Codegen::visit(Logic* node)\n{\n\tNode* lhs = node->getLhs();\n\tNode* rhs = node->getRhs();\n\tOpcode op;\n\n\tswitch (node->getOperator()) {\n\t\tcase Logic::LOP_EQUALS: op = OP_EQUAL; break;\n\t\tcase Logic::LOP_AND:    op = OP_AND;   break;\n\t\tcase Logic::LOP_OR:     op = OP_OR;    break;\n\t}\n\n\tlhs->accept(*this);\n\trhs->accept(*this);\n\n\tm_ir.push_back(IR(op));\n\n\t_prepare_operand(m_ir.back().op1, lhs);\n\t_prepare_operand(m_ir.back().op2, rhs);\n\n\tsize_t tmp_id = m_compiler->getTempValue();\n\n\tm_ir.back().result = Operand(FETCH_TMP, tmp_id);\n\n\tnode->setValueId(tmp_id);\n}\n\nvoid Codegen::visit(If* node)\n{\n\tsize_t last_jmpz = 0;\n\tstd::vector<std::pair<Node*, Node*> >& branches = node->getConditionals();\n\tstd::vector<std::pair<Node*, Node*> >::const_iterator it(branches.begin()),\n\t\tend(branches.end());\n\n\tm_jmps.push(AddrVector());\n\n\twhile (it != end) {\n\t\tNode* cond  = (*it).first;\n\t\tNode* block = (*it).second;\n\n\t\tcond->accept(*this);\n\n\t\tlast_jmpz = m_ir.size();\n\t\tm_ir.push_back(IR(OP_JMPZ));\n\n\t\t_prepare_operand(m_ir.back().op1, cond);\n\n\t\tblock->accept(*this);\n\n\t\tm_jmps.top().push_back(m_ir.size());\n\t\tm_ir.push_back(IR(OP_JMP)); \/\/ JMP to outside if-elseif-else\n\n\t\tm_ir[last_jmpz].op2 = Operand(JMP_ADDR, m_ir.size());\n\n\t\t++it;\n\t}\n\n\tif (node->getElseNode()) {\n\t\tnode->getElseNode()->accept(*this);\n\t}\n\n\tAddrVector& vec = m_jmps.top();\n\tfor (size_t i = 0, j = vec.size(); i < j; ++i) {\n\t\tm_ir[vec[i]].op1 = Operand(JMP_ADDR, m_ir.size());\n\t}\n\n\tm_jmps.pop();\n}\n\n}} \/\/ clever::ast\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KDE-PIM.\n\n    Copyright (c) 2007 Tobias Koenig <tokoe@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\n#include \"vcfendanalyzer.h\"\n\n#include <kabc\/vcardconverter.h>\n\n#include <strigi\/fieldtypes.h>\n#include <strigi\/analysisresult.h>\n#include <strigi\/streamendanalyzer.h>\n\nVcfEndAnalyzer::VcfEndAnalyzer( const VcfEndAnalyzerFactory *factory )\n  : m_factory( factory )\n{\n}\n\nbool VcfEndAnalyzer::checkHeader( const char* header, int32_t headersize ) const\n{\n  const char* magic = \"BEGIN:VCARD\";\n  int32_t magicLength = strlen( magic );\n\n  return headersize >= magicLength && !strncmp( magic, header, magicLength );\n}\n\n\/**\n * It's easier to use KABC::VCardConverter to extract the single fields from the vCard\n * than doing it manually.\n *\/\nchar VcfEndAnalyzer::analyze( Strigi::AnalysisResult& idx, Strigi::InputStream* in )\n{\n  const char* data;\n  if ( in->read( data, 1, in->size() ) < 0 )\n    return Strigi::Error;\n\n  const QByteArray text( data, in->size() );\n\n  KABC::VCardConverter converter;\n  KABC::Addressee addr = converter.parseVCard( text );\n\n  if ( addr.isEmpty() )\n    return Strigi::Error;\n\n  idx.addValue( m_factory->field( Name ), addr.assembledName().toUtf8().data() );\n  idx.addValue( m_factory->field( Email ), addr.preferredEmail().toUtf8().data() );\n  idx.addValue( m_factory->field( Telephone ), addr.phoneNumbers().first().number().toUtf8().data() );\n\n  return Strigi::Ok;\n}\n\nconst Strigi::RegisteredField* VcfEndAnalyzerFactory::field( VcfEndAnalyzer::Field field ) const\n{\n  switch ( field ) {\n    default:\n    case VcfEndAnalyzer::Name:\n      return nameField;\n      break;\n    case VcfEndAnalyzer::Email:\n      return emailField;\n      break;\n    case VcfEndAnalyzer::Telephone:\n      return telephoneField;\n      break;\n  }\n}\n\nvoid VcfEndAnalyzerFactory::registerFields( Strigi::FieldRegister& reg )\n{\n  nameField = reg.registerField( \"vcf.name\", Strigi::FieldRegister::stringType, 1, 0 );\n  emailField = reg.registerField( \"vcf.email\", Strigi::FieldRegister::stringType, 1, 0 );\n  telephoneField = reg.registerField( \"vcf.telephone\", Strigi::FieldRegister::stringType, 1, 0 );\n}\n\n<commit_msg>fix bug that causes crash when telephone list is empty.<commit_after>\/*\n    This file is part of KDE-PIM.\n\n    Copyright (c) 2007 Tobias Koenig <tokoe@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\n#include \"vcfendanalyzer.h\"\n\n#include <kabc\/vcardconverter.h>\n\n#include <strigi\/fieldtypes.h>\n#include <strigi\/analysisresult.h>\n#include <strigi\/streamendanalyzer.h>\n\nVcfEndAnalyzer::VcfEndAnalyzer( const VcfEndAnalyzerFactory *factory )\n  : m_factory( factory )\n{\n}\n\nbool VcfEndAnalyzer::checkHeader( const char* header, int32_t headersize ) const\n{\n  const char* magic = \"BEGIN:VCARD\";\n  int32_t magicLength = strlen( magic );\n\n  return headersize >= magicLength && !strncmp( magic, header, magicLength );\n}\n\n\/**\n * It's easier to use KABC::VCardConverter to extract the single fields from the vCard\n * than doing it manually.\n *\/\nchar VcfEndAnalyzer::analyze( Strigi::AnalysisResult& idx, Strigi::InputStream* in )\n{\n  const char* data;\n  if ( in->read( data, 1, in->size() ) < 0 )\n    return Strigi::Error;\n\n  const QByteArray text( data, in->size() );\n\n  KABC::VCardConverter converter;\n  KABC::Addressee addr = converter.parseVCard( text );\n\n  if ( addr.isEmpty() )\n    return Strigi::Error;\n\n  idx.addValue( m_factory->field( Name ), addr.assembledName().toUtf8().data() );\n  idx.addValue( m_factory->field( Email ), addr.preferredEmail().toUtf8().data() );\n  if (addr.phoneNumbers().size()) {\n    idx.addValue( m_factory->field( Telephone ),\n      addr.phoneNumbers().first().number().toUtf8().data() );\n  }\n\n  return Strigi::Ok;\n}\n\nconst Strigi::RegisteredField* VcfEndAnalyzerFactory::field( VcfEndAnalyzer::Field field ) const\n{\n  switch ( field ) {\n    default:\n    case VcfEndAnalyzer::Name:\n      return nameField;\n      break;\n    case VcfEndAnalyzer::Email:\n      return emailField;\n      break;\n    case VcfEndAnalyzer::Telephone:\n      return telephoneField;\n      break;\n  }\n}\n\nvoid VcfEndAnalyzerFactory::registerFields( Strigi::FieldRegister& reg )\n{\n  nameField = reg.registerField( \"vcf.name\", Strigi::FieldRegister::stringType, 1, 0 );\n  emailField = reg.registerField( \"vcf.email\", Strigi::FieldRegister::stringType, 1, 0 );\n  telephoneField = reg.registerField( \"vcf.telephone\", Strigi::FieldRegister::stringType, 1, 0 );\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ver_competencia.h\"\n#include \"ui_ver_competencia.h\"\n#include \"qpixmap.h\"\n\nver_competencia::ver_competencia(GUI *guiP, Competencia *compP, QWidget *parent) :\n    QDialog(parent), gui(guiP),  ui(new Ui::ver_competencia), comp(compP)\n{\n    ui->setupUi(this);\n    QPixmap pix(\":\/images\/Heros64.png\");\n    ui->label_logo->setPixmap(pix);\n\n    this->setWindowTitle(\"Ver competencias deportivas\");\n\n    ui->tableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers);\n\n    QString nombre = \"Competencia \" + compP->getNombre();\n    ui->label->setText(nombre);\n    ui->label_7->setText(compP->getModalidad()->getTipoMod()->getNombre());\n    ui->label_8->setText(compP->getDeporte()->getNombre());\n\n    ui->label_9->setText(compP->getEstado()->getNombre());\n    ui->tableWidget->resizeColumnsToContents();\n\n    \/\/Si la competencia no está en estado creada, se permite ver el fixture y se tilda el checkbox\n    if (compP->getEstado()->getNombre().toLower() != \"creada\"){\n        ui->checkBox->setCheckable(true);\n        ui->checkBox->setChecked(true);\n        ui->checkBox->setDisabled(true);\n        ui->pushButton_4->setEnabled(true);\n    }\n    else {\n        ui->pushButton_4->setDisabled(true);\n        ui->checkBox->setCheckable(false);\n    }\n\n    if(compP->getEstado()->getNombre().toLower() == \"en disputa\" || compP->getEstado()->getNombre().toLower() == \"finalizada\" ){\n        ui->pushButton_5->setDisabled(true);\n    }\n    \/\/ si la competencia no esta planificada o en disputa no se muestra la tabla\n    if (!(compP->getEstado()->getNombre().toLower() == \"planificada\" || compP->getEstado()->getNombre().toLower() == \"en disputa\")){\n        ui->tableWidget->hide();\n        ui->label_6->hide();\n    }\n    else{\n        QVector<Partido*> proxEnc = comp->getProximosEncuentros() ;\n        if(proxEnc.size() == 0){\n\n        }\n        else{\n\n            for (int i = 0; i < proxEnc.size(); ++i) {\n                ui->tableWidget->insertRow(i);\n                ui->tableWidget->setItem(i,0,new QTableWidgetItem(proxEnc[i]->getEquipoA()->getNombre()));\n                ui->tableWidget->setItem(i,1,new QTableWidgetItem(proxEnc[i]->getEquipoB()->getNombre()));\n                ui->tableWidget->setItem(i,2,new QTableWidgetItem(QString::number(proxEnc[i]->getFecha())));\n\n            }\n        }\n        ui->tableWidget->resizeColumnsToContents();\n    }\n}\n\nvoid ver_competencia::actualizar()\n{\n    Competencia* compP = comp;\n    QString nombre = \"Competencia \" + compP->getNombre();\n    ui->label->setText(nombre);\n    ui->label_7->setText(compP->getModalidad()->getTipoMod()->getNombre());\n    ui->label_8->setText(compP->getDeporte()->getNombre());\n\n    ui->label_9->setText(compP->getEstado()->getNombre());\n    ui->tableWidget->resizeColumnsToContents();\n\n    \/\/Si la competencia no está en estado creada, se permite ver el fixture y se tilda el checkbox\n    if (compP->getEstado()->getNombre().toLower() != \"creada\"){\n        ui->checkBox->setCheckable(true);\n        ui->checkBox->setChecked(true);\n        ui->checkBox->setDisabled(true);\n        ui->pushButton_4->setEnabled(true);\n    }\n    else {\n        ui->pushButton_4->setDisabled(true);\n        ui->checkBox->setCheckable(false);\n    }\n\n    if(compP->getEstado()->getNombre().toLower() == \"en disputa\" || compP->getEstado()->getNombre().toLower() == \"finalizada\" ){\n        ui->pushButton_5->setDisabled(true);\n    }\n    \/\/ si la competencia no esta planificada o en disputa no se muestra la tabla\n    if (!(compP->getEstado()->getNombre().toLower() == \"planificada\" || compP->getEstado()->getNombre().toLower() == \"en disputa\")){\n        ui->tableWidget->hide();\n        ui->label_6->hide();\n    }\n    else{\n        QVector<Partido*> proxEnc = comp->getProximosEncuentros() ;\n        if(proxEnc.size() == 0){\n\n        }\n        else{\n\n            for (int i = 0; i < proxEnc.size(); ++i) {\n                ui->tableWidget->insertRow(i);\n                ui->tableWidget->setItem(i,0,new QTableWidgetItem(proxEnc[i]->getEquipoA()->getNombre()));\n                ui->tableWidget->setItem(i,1,new QTableWidgetItem(proxEnc[i]->getEquipoB()->getNombre()));\n                ui->tableWidget->setItem(i,2,new QTableWidgetItem(QString::number(proxEnc[i]->getFecha())));\n\n            }\n        }\n        ui->tableWidget->resizeColumnsToContents();\n    }\n}\n\nver_competencia::~ver_competencia()\n{\n    delete ui;\n}\n\nvoid ver_competencia::on_pushButton_7_clicked() \/\/Salir\n{\n    this->close();\n}\n\nvoid ver_competencia::on_pushButton_5_clicked() \/\/Generar fixture\n{\n    QString error;\n    if (gui->handleVerCompetencia(this,QString(\"generarFixture\"), error,comp)){\n        \/\/Se coloca el tilde en el checkbox\n        ui->checkBox->setCheckable(true);\n        ui->checkBox->setChecked(true);\n        ui->checkBox->setDisabled(true);\n\n        \/\/También se muestran los próximos encuentros\n        ui->tableWidget->show();\n        ui->label_6->show();\n        QVector<Partido*> proxEnc = comp->getProximosEncuentros();\n        ui->tableWidget->setRowCount(0);\n        qDebug()<<\"proxEnc size = \"<<proxEnc.size();\n        for (int i = 0; i < proxEnc.size(); ++i) {\n            ui->tableWidget->insertRow(i);\n            ui->tableWidget->setItem(i,0,new QTableWidgetItem(proxEnc[i]->getEquipoA()->getNombre()));\n            ui->tableWidget->setItem(i,1,new QTableWidgetItem(proxEnc[i]->getEquipoB()->getNombre()));\n            ui->tableWidget->setItem(i,2,new QTableWidgetItem(QString::number(proxEnc[i]->getFecha())));\n\n        }\n        ui->tableWidget->resizeColumnsToContents();\n\n        \/\/Se cambia el estado de la competencia\n        ui->label_9->setText(comp->getEstado()->getNombre());\n        if(comp->getEstado()->getNombre().toLower() == \"en disputa\"){\n\n            ui->pushButton_5->setDisabled(true);\n        }\n    }\n    else{\n        QMessageBox* msg = new QMessageBox(this);\n        msg->setText(error);\n        QPixmap icono(\":\/images\/Heros-amarillo-64.png\");\n        msg->setIconPixmap(icono);\n        msg->setModal(true);\n        msg->exec();\n    }\n\n}\n\nvoid ver_competencia::on_pushButton_6_clicked() \/\/Mostrar tabla posiciones\n{\n    \/\/ si la competencia está en disputa o finalizada y es de liga se muestra la tabla, si no, no\n    if((comp->getEstado()->getNombre().toLower() == \"en disputa\" ||\n        comp->getEstado()->getNombre().toLower() == \"finalizada\" ) &&\n        comp->getModalidad()->getTipoMod()->getNombre().toLower() == \"liga\")\n    {\n        QString error;\n        gui->handleVerCompetencia(this,QString(\"mostrarTablasPosiciones\"),error,comp);\n\n    }\n    else if(comp->getModalidad()->getTipoMod()->getNombre().toLower() != \"liga\"){\n        QMessageBox* msg = new QMessageBox(this);\n        QString error = \"No es posible mostrar la tabla de posiciones, la competencia no es de la modalidad de liga\";\n        msg->setText(error);\n        QPixmap icono(\":\/images\/Heros-rojo-64.png\");\n        msg->setIconPixmap(icono);\n        msg->setModal(true);\n        msg->exec();\n    }\n    else{\n        QMessageBox* msg = new QMessageBox(this);\n        QString error = \"No es posible mostrar la tabla de posiciones, la competencia no está en disputa o finalizada\";\n        msg->setText(error);\n        QPixmap icono(\":\/images\/Heros-rojo-64.png\");\n        msg->setIconPixmap(icono);\n        msg->setModal(true);\n        msg->exec();\n    }\n}\n\nvoid ver_competencia::on_pushButton_4_clicked() \/\/Mostrar fixture\n{\n    QString error;\n    gui->handleVerCompetencia(this,QString(\"mostrarFixture\"),error,comp);\n}\n\nvoid ver_competencia::on_pushButton_clicked() \/\/Listar participantes\n{\n    QString error;\n    gui->handleVerCompetencia(this,QString(\"listarParticipantes\"),error,comp);\n}\n\nvoid ver_competencia::on_checkBox_stateChanged(int arg1)\n{\n    if(arg1 == 0){\n        ui->pushButton_4->setDisabled(true);\n    }\n    else if(arg1 == 2){\n        ui->pushButton_4->setEnabled(true);\n    }\n}\n<commit_msg>se borra la competencia al salir de Ver Competencia<commit_after>#include \"ver_competencia.h\"\n#include \"ui_ver_competencia.h\"\n#include \"qpixmap.h\"\n\nver_competencia::ver_competencia(GUI *guiP, Competencia *compP, QWidget *parent) :\n    QDialog(parent), gui(guiP),  ui(new Ui::ver_competencia), comp(compP)\n{\n    ui->setupUi(this);\n    QPixmap pix(\":\/images\/Heros64.png\");\n    ui->label_logo->setPixmap(pix);\n\n    this->setWindowTitle(\"Ver competencias deportivas\");\n\n    ui->tableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers);\n\n    QString nombre = \"Competencia \" + compP->getNombre();\n    ui->label->setText(nombre);\n    ui->label_7->setText(compP->getModalidad()->getTipoMod()->getNombre());\n    ui->label_8->setText(compP->getDeporte()->getNombre());\n\n    ui->label_9->setText(compP->getEstado()->getNombre());\n    ui->tableWidget->resizeColumnsToContents();\n\n    \/\/Si la competencia no está en estado creada, se permite ver el fixture y se tilda el checkbox\n    if (compP->getEstado()->getNombre().toLower() != \"creada\"){\n        ui->checkBox->setCheckable(true);\n        ui->checkBox->setChecked(true);\n        ui->checkBox->setDisabled(true);\n        ui->pushButton_4->setEnabled(true);\n    }\n    else {\n        ui->pushButton_4->setDisabled(true);\n        ui->checkBox->setCheckable(false);\n    }\n\n    if(compP->getEstado()->getNombre().toLower() == \"en disputa\" || compP->getEstado()->getNombre().toLower() == \"finalizada\" ){\n        ui->pushButton_5->setDisabled(true);\n    }\n    \/\/ si la competencia no esta planificada o en disputa no se muestra la tabla\n    if (!(compP->getEstado()->getNombre().toLower() == \"planificada\" || compP->getEstado()->getNombre().toLower() == \"en disputa\")){\n        ui->tableWidget->hide();\n        ui->label_6->hide();\n    }\n    else{\n        QVector<Partido*> proxEnc = comp->getProximosEncuentros() ;\n        if(proxEnc.size() == 0){\n\n        }\n        else{\n\n            for (int i = 0; i < proxEnc.size(); ++i) {\n                ui->tableWidget->insertRow(i);\n                ui->tableWidget->setItem(i,0,new QTableWidgetItem(proxEnc[i]->getEquipoA()->getNombre()));\n                ui->tableWidget->setItem(i,1,new QTableWidgetItem(proxEnc[i]->getEquipoB()->getNombre()));\n                ui->tableWidget->setItem(i,2,new QTableWidgetItem(QString::number(proxEnc[i]->getFecha())));\n\n            }\n        }\n        ui->tableWidget->resizeColumnsToContents();\n    }\n}\n\nvoid ver_competencia::actualizar()\n{\n    Competencia* compP = comp;\n    QString nombre = \"Competencia \" + compP->getNombre();\n    ui->label->setText(nombre);\n    ui->label_7->setText(compP->getModalidad()->getTipoMod()->getNombre());\n    ui->label_8->setText(compP->getDeporte()->getNombre());\n\n    ui->label_9->setText(compP->getEstado()->getNombre());\n    ui->tableWidget->resizeColumnsToContents();\n\n    \/\/Si la competencia no está en estado creada, se permite ver el fixture y se tilda el checkbox\n    if (compP->getEstado()->getNombre().toLower() != \"creada\"){\n        ui->checkBox->setCheckable(true);\n        ui->checkBox->setChecked(true);\n        ui->checkBox->setDisabled(true);\n        ui->pushButton_4->setEnabled(true);\n    }\n    else {\n        ui->pushButton_4->setDisabled(true);\n        ui->checkBox->setCheckable(false);\n    }\n\n    if(compP->getEstado()->getNombre().toLower() == \"en disputa\" || compP->getEstado()->getNombre().toLower() == \"finalizada\" ){\n        ui->pushButton_5->setDisabled(true);\n    }\n    \/\/ si la competencia no esta planificada o en disputa no se muestra la tabla\n    if (!(compP->getEstado()->getNombre().toLower() == \"planificada\" || compP->getEstado()->getNombre().toLower() == \"en disputa\")){\n        ui->tableWidget->hide();\n        ui->label_6->hide();\n    }\n    else{\n        QVector<Partido*> proxEnc = comp->getProximosEncuentros() ;\n        if(proxEnc.size() == 0){\n\n        }\n        else{\n\n            for (int i = 0; i < proxEnc.size(); ++i) {\n                ui->tableWidget->insertRow(i);\n                ui->tableWidget->setItem(i,0,new QTableWidgetItem(proxEnc[i]->getEquipoA()->getNombre()));\n                ui->tableWidget->setItem(i,1,new QTableWidgetItem(proxEnc[i]->getEquipoB()->getNombre()));\n                ui->tableWidget->setItem(i,2,new QTableWidgetItem(QString::number(proxEnc[i]->getFecha())));\n\n            }\n        }\n        ui->tableWidget->resizeColumnsToContents();\n    }\n}\n\nver_competencia::~ver_competencia()\n{\n    delete ui;\n}\n\nvoid ver_competencia::on_pushButton_7_clicked() \/\/Salir\n{\n    delete comp;\n    this->close();\n}\n\nvoid ver_competencia::on_pushButton_5_clicked() \/\/Generar fixture\n{\n    QString error;\n    if (gui->handleVerCompetencia(this,QString(\"generarFixture\"), error,comp)){\n        \/\/Se coloca el tilde en el checkbox\n        ui->checkBox->setCheckable(true);\n        ui->checkBox->setChecked(true);\n        ui->checkBox->setDisabled(true);\n\n        \/\/También se muestran los próximos encuentros\n        ui->tableWidget->show();\n        ui->label_6->show();\n        QVector<Partido*> proxEnc = comp->getProximosEncuentros();\n        ui->tableWidget->setRowCount(0);\n        qDebug()<<\"proxEnc size = \"<<proxEnc.size();\n        for (int i = 0; i < proxEnc.size(); ++i) {\n            ui->tableWidget->insertRow(i);\n            ui->tableWidget->setItem(i,0,new QTableWidgetItem(proxEnc[i]->getEquipoA()->getNombre()));\n            ui->tableWidget->setItem(i,1,new QTableWidgetItem(proxEnc[i]->getEquipoB()->getNombre()));\n            ui->tableWidget->setItem(i,2,new QTableWidgetItem(QString::number(proxEnc[i]->getFecha())));\n\n        }\n        ui->tableWidget->resizeColumnsToContents();\n\n        \/\/Se cambia el estado de la competencia\n        ui->label_9->setText(comp->getEstado()->getNombre());\n        if(comp->getEstado()->getNombre().toLower() == \"en disputa\"){\n\n            ui->pushButton_5->setDisabled(true);\n        }\n    }\n    else{\n        QMessageBox* msg = new QMessageBox(this);\n        msg->setText(error);\n        QPixmap icono(\":\/images\/Heros-amarillo-64.png\");\n        msg->setIconPixmap(icono);\n        msg->setModal(true);\n        msg->exec();\n    }\n\n}\n\nvoid ver_competencia::on_pushButton_6_clicked() \/\/Mostrar tabla posiciones\n{\n    \/\/ si la competencia está en disputa o finalizada y es de liga se muestra la tabla, si no, no\n    if((comp->getEstado()->getNombre().toLower() == \"en disputa\" ||\n        comp->getEstado()->getNombre().toLower() == \"finalizada\" ) &&\n        comp->getModalidad()->getTipoMod()->getNombre().toLower() == \"liga\")\n    {\n        QString error;\n        gui->handleVerCompetencia(this,QString(\"mostrarTablasPosiciones\"),error,comp);\n\n    }\n    else if(comp->getModalidad()->getTipoMod()->getNombre().toLower() != \"liga\"){\n        QMessageBox* msg = new QMessageBox(this);\n        QString error = \"No es posible mostrar la tabla de posiciones, la competencia no es de la modalidad de liga\";\n        msg->setText(error);\n        QPixmap icono(\":\/images\/Heros-rojo-64.png\");\n        msg->setIconPixmap(icono);\n        msg->setModal(true);\n        msg->exec();\n    }\n    else{\n        QMessageBox* msg = new QMessageBox(this);\n        QString error = \"No es posible mostrar la tabla de posiciones, la competencia no está en disputa o finalizada\";\n        msg->setText(error);\n        QPixmap icono(\":\/images\/Heros-rojo-64.png\");\n        msg->setIconPixmap(icono);\n        msg->setModal(true);\n        msg->exec();\n    }\n}\n\nvoid ver_competencia::on_pushButton_4_clicked() \/\/Mostrar fixture\n{\n    QString error;\n    gui->handleVerCompetencia(this,QString(\"mostrarFixture\"),error,comp);\n}\n\nvoid ver_competencia::on_pushButton_clicked() \/\/Listar participantes\n{\n    QString error;\n    gui->handleVerCompetencia(this,QString(\"listarParticipantes\"),error,comp);\n}\n\nvoid ver_competencia::on_checkBox_stateChanged(int arg1)\n{\n    if(arg1 == 0){\n        ui->pushButton_4->setDisabled(true);\n    }\n    else if(arg1 == 2){\n        ui->pushButton_4->setEnabled(true);\n    }\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#include <memory>\n#include <string>\n#include <unordered_map>\n#include <vector>\n\n#include \"tensorflow\/contrib\/lite\/toco\/graph_transformations\/graph_transformations.h\"\n#include \"tensorflow\/contrib\/lite\/toco\/model.h\"\n#include \"tensorflow\/contrib\/lite\/toco\/tooling_util.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n\nnamespace toco {\n\nbool ResolveTensorFlowMerge::Run(Model* model, std::size_t op_index) {\n  const auto merge_it = model->operators.begin() + op_index;\n  const auto* merge_op = merge_it->get();\n  if (merge_op->type != OperatorType::kTensorFlowMerge) {\n    return false;\n  }\n\n  \/\/ We need to yield until this Merge node has only 1 input, which will mean\n  \/\/ that that is the selected input. Other graph transformations on other nodes\n  \/\/ such as ResolveTensorFlowSwitch, will take care of trimming the\n  \/\/ non-selected inputs, so that at some point there will be only 1 input left.\n  if (merge_op->inputs.size() > 1) {\n    AddMessageF(\"Waiting for %s to be resolved\", LogName(*merge_op));\n    return false;\n  }\n\n  \/\/ Now that the merge node has 1 input exactly, it is the same as an Identity\n  \/\/ node and can be resolved trivially.\n  CHECK_EQ(merge_op->inputs.size(), 1);\n\n  \/\/ Update the edges of the graph ahead of removing the node.\n  for (const auto& other_op : model->operators) {\n    for (auto& input : other_op->inputs) {\n      if (input == merge_op->outputs[0]) {\n        input = merge_op->inputs[0];\n      }\n    }\n  }\n\n  \/\/ Remove the node and its output array.\n  AddMessageF(\"Removing already-resolved %s\", LogName(*merge_op));\n  model->EraseArray(merge_op->outputs[0]);\n  model->operators.erase(merge_it);\n  return true;\n}\n\n}  \/\/ namespace toco\n<commit_msg>fix typo<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#include <memory>\n#include <string>\n#include <unordered_map>\n#include <vector>\n\n#include \"tensorflow\/contrib\/lite\/toco\/graph_transformations\/graph_transformations.h\"\n#include \"tensorflow\/contrib\/lite\/toco\/model.h\"\n#include \"tensorflow\/contrib\/lite\/toco\/tooling_util.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n\nnamespace toco {\n\nbool ResolveTensorFlowMerge::Run(Model* model, std::size_t op_index) {\n  const auto merge_it = model->operators.begin() + op_index;\n  const auto* merge_op = merge_it->get();\n  if (merge_op->type != OperatorType::kTensorFlowMerge) {\n    return false;\n  }\n\n  \/\/ We need to yield until this Merge node has only 1 input, which will mean\n  \/\/ that is the selected input. Other graph transformations on other nodes\n  \/\/ such as ResolveTensorFlowSwitch, will take care of trimming the\n  \/\/ non-selected inputs, so that at some point there will be only 1 input left.\n  if (merge_op->inputs.size() > 1) {\n    AddMessageF(\"Waiting for %s to be resolved\", LogName(*merge_op));\n    return false;\n  }\n\n  \/\/ Now that the merge node has 1 input exactly, it is the same as an Identity\n  \/\/ node and can be resolved trivially.\n  CHECK_EQ(merge_op->inputs.size(), 1);\n\n  \/\/ Update the edges of the graph ahead of removing the node.\n  for (const auto& other_op : model->operators) {\n    for (auto& input : other_op->inputs) {\n      if (input == merge_op->outputs[0]) {\n        input = merge_op->inputs[0];\n      }\n    }\n  }\n\n  \/\/ Remove the node and its output array.\n  AddMessageF(\"Removing already-resolved %s\", LogName(*merge_op));\n  model->EraseArray(merge_op->outputs[0]);\n  model->operators.erase(merge_it);\n  return true;\n}\n\n}  \/\/ namespace toco\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2010 VoltDB Inc.\n *\n * VoltDB 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 * VoltDB is distributed in the hope that it 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 VoltDB.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#ifndef FATALEXCEPTION_HPP_\n#define FATALEXCEPTION_HPP_\n\n#include <cstdio>\n#include <string>\n#include <string.h>\n#include <execinfo.h>\n#include <cxxabi.h>\n#include <vector>\n#include \"boost\/scoped_array.hpp\"\n\n#define throwFatalException(...) { char reallysuperbig_nonce_message[8192]; snprintf(reallysuperbig_nonce_message, 8192, __VA_ARGS__); throw voltdb::FatalException( reallysuperbig_nonce_message, __FILE__, __LINE__); }\nnamespace voltdb {\nclass FatalException {\npublic:\n    \/**\n     * Stack trace code from http:\/\/tombarta.wordpress.com\/2008\/08\/01\/c-stack-traces-with-gcc\/\n     *\n     *\/\n    FatalException(std::string message, const char *filename, unsigned long lineno) :\n        m_reason(message), m_filename(filename), m_lineno(lineno) {\n        void *traces[128];\n        for (int i=0; i < 128; i++) traces[i] = NULL; \/\/ silence valgrind\n        const int numTraces = backtrace( traces, 128);\n        char** traceSymbols = backtrace_symbols( traces, numTraces);\n        for (int ii = 0; ii < numTraces; ii++) {\n            std::size_t sz = 200;\n            char *function = static_cast<char*>(malloc(sz));\n            char *begin = NULL, *end = NULL;\n            \/\/Find parens surrounding mangled name\n            for (char *j = traceSymbols[ii]; *j; ++j) {\n                if (*j == '(') {\n                    begin = j;\n                }\n                else if (*j == '+') {\n                    end = j;\n                }\n            }\n\n            if (begin && end) {\n                *begin++ = '\\0';\n                *end = '\\0';\n\n                int status;\n                char *ret = abi::__cxa_demangle(begin, function, &sz, &status);\n                if (ret) {\n                    \/\/return value may be a realloc of input\n                    function = ret;\n                } else {\n                    \/\/ demangle failed, treat it like a C function with no args\n                    strncpy(function, begin, sz);\n                    strncat(function, \"()\", sz);\n                    function[sz-1] = '\\0';\n                }\n                m_traces.push_back(std::string(function));\n            } else {\n                \/\/didn't find the mangled name in the trace\n                m_traces.push_back(std::string(traceSymbols[ii]));\n            }\n            free(function);\n        }\n        free(traceSymbols);\n    }\n    const std::string m_reason;\n    const char *m_filename;\n    const unsigned long m_lineno;\n    std::vector<std::string> m_traces;\n};\n}\n#endif \/* FATALEXCEPTION_HPP_ *\/\n<commit_msg>Print FatalException bactraces to file.<commit_after>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2010 VoltDB Inc.\n *\n * VoltDB 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 * VoltDB is distributed in the hope that it 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 VoltDB.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#ifndef FATALEXCEPTION_HPP_\n#define FATALEXCEPTION_HPP_\n\n#include <cstdio>\n#include <string>\n#include <string.h>\n#include <execinfo.h>\n#include <cxxabi.h>\n#include <vector>\n#include \"boost\/scoped_array.hpp\"\n\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <stdio.h>\n\n#define throwFatalException(...) { char reallysuperbig_nonce_message[8192]; snprintf(reallysuperbig_nonce_message, 8192, __VA_ARGS__); throw voltdb::FatalException( reallysuperbig_nonce_message, __FILE__, __LINE__); }\nnamespace voltdb {\nclass FatalException {\npublic:\n    \/**\n     * Stack trace code from http:\/\/tombarta.wordpress.com\/2008\/08\/01\/c-stack-traces-with-gcc\/\n     *\n     *\/\n    FatalException(std::string message, const char *filename, unsigned long lineno) :\n        m_reason(message), m_filename(filename), m_lineno(lineno) {\n\n      FILE *bt = fopen(\"\/tmp\/voltdb_backtrace.txt\", \"a+\");\n\n      void *traces[128];\n      for (int i=0; i < 128; i++) traces[i] = NULL; \/\/ silence valgrind\n      const int numTraces = backtrace( traces, 128);\n      char** traceSymbols = backtrace_symbols( traces, numTraces);\n\n      \/\/ write header for backtrace file\n      fprintf(bt, \"VoltDB Backtrace (%d)\\n\", numTraces);\n\n      for (int ii = 0; ii < numTraces; ii++) {\n    std::size_t sz = 200;\n    char *function = static_cast<char*>(malloc(sz));\n    char *begin = NULL, *end = NULL;\n\n    \/\/ write original symbol to file.\n    fprintf(bt, \"raw[%d]: %s\\n\", ii, traceSymbols[ii]);\n\n    \/\/Find parens surrounding mangled name\n    for (char *j = traceSymbols[ii]; *j; ++j) {\n      if (*j == '(') {\n        begin = j;\n      }\n      else if (*j == '+') {\n        end = j;\n      }\n    }\n\n    if (begin && end) {\n      *begin++ = '\\0';\n      *end = '\\0';\n\n      int status;\n      char *ret = abi::__cxa_demangle(begin, function, &sz, &status);\n      if (ret) {\n        \/\/return value may be a realloc of input\n        function = ret;\n      } else {\n        \/\/ demangle failed, treat it like a C function with no args\n        strncpy(function, begin, sz);\n        strncat(function, \"()\", sz);\n        function[sz-1] = '\\0';\n      }\n      m_traces.push_back(std::string(function));\n    } else {\n      \/\/didn't find the mangled name in the trace\n      m_traces.push_back(std::string(traceSymbols[ii]));\n    }\n    free(function);\n      }\n\n      for (int ii=0; ii < m_traces.size(); ii++) {\n    const char* str = m_traces[ii].c_str();\n    fprintf(bt, \"demangled[%d]: %s\\n\", ii, str);\n      }\n\n      fclose(bt);\n      free(traceSymbols);\n    }\n  const std::string m_reason;\n  const char *m_filename;\n  const unsigned long m_lineno;\n  std::vector<std::string> m_traces;\n};\n}\n#endif \/* FATALEXCEPTION_HPP_ *\/\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    uint64_t _remain;\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, uint64_t offset, uint64_t len, file_input_stream_options options)\n            : _file(std::move(f)), _options(options), _pos(offset), _remain(len) {\n        \/\/ prevent wraparounds\n        _remain = std::min(std::numeric_limits<uint64_t>::max() - _pos, _remain);\n    }\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        _read_buffers.reserve(ra); \/\/ prevent push_back() failure\n        while (_read_buffers.size() < ra) {\n            if (!_remain) {\n                if (_read_buffers.size() >= min_ra) {\n                    return;\n                }\n                _read_buffers.push_back(make_ready_future<temporary_buffer<char>>());\n                continue;\n            }\n            ++_reads_in_progress;\n            \/\/ if _pos is not dma-aligned, we'll get a short read.  Account for that.\n            \/\/ Also avoid reading beyond _remain.\n            uint64_t align = _file.disk_read_dma_alignment();\n            auto start = align_down(_pos, align);\n            auto end = align_up(std::min(start + _options.buffer_size, _pos + _remain), align);\n            auto len = end - start;\n            _read_buffers.push_back(futurize<future<temporary_buffer<char>>>::apply([&] {\n                    return _file.dma_read_bulk<char>(start, len, _options.io_priority_class);\n            }).then_wrapped(\n                    [this, start, end, pos = _pos, remain = _remain] (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                if ((pos == start && end <= pos + remain) || ret.failed()) {\n                    \/\/ no games needed\n                    return ret;\n                } else {\n                    \/\/ first or last buffer, need trimming\n                    auto tmp = ret.get0();\n                    auto real_end = start + tmp.size();\n                    if (real_end <= pos) {\n                        return make_ready_future<temporary_buffer<char>>();\n                    }\n                    if (real_end > pos + remain) {\n                        tmp.trim(pos + remain - start);\n                    }\n                    if (start < pos) {\n                        tmp.trim_front(pos - start);\n                    }\n                    return make_ready_future<temporary_buffer<char>>(std::move(tmp));\n                }\n            }));\n            auto old_pos = _pos;\n            _pos = end;\n            _remain = std::max(_pos, old_pos + _remain) - _pos;\n        };\n    }\n};\n\nclass file_data_source : public data_source {\npublic:\n    file_data_source(file f, uint64_t offset, uint64_t len, file_input_stream_options options)\n        : data_source(std::make_unique<file_data_source_impl>(\n                std::move(f), offset, len, options)) {}\n};\n\n\ninput_stream<char> make_file_input_stream(\n        file f, uint64_t offset, uint64_t len, file_input_stream_options options) {\n    return input_stream<char>(file_data_source(std::move(f), offset, len, std::move(options)));\n}\n\ninput_stream<char> make_file_input_stream(\n        file f, uint64_t offset, file_input_stream_options options) {\n    return make_file_input_stream(std::move(f), offset, std::numeric_limits<uint64_t>::max(), std::move(options));\n}\n\ninput_stream<char> make_file_input_stream(\n        file f, file_input_stream_options options) {\n    return make_file_input_stream(std::move(f), 0, std::move(options));\n}\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        _write_behind_sem.ensure_space_for_waiters(1); \/\/ So that wait() doesn't throw\n    }\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 semaphore 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    }\npublic:\n    future<> do_put(uint64_t pos, temporary_buffer<char> buf) noexcept {\n      try {\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_write_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_write_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_write_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        return _file.dma_write(pos, p, buf_size, _options.io_priority_class).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      } catch (...) {\n          return make_exception_future<>(std::current_exception());\n      }\n    }\n    future<> wait() noexcept {\n        \/\/ restore to pristine state; for flush() + close() sequence\n        \/\/ (we allow either flush, or close, or both)\n        return _write_behind_sem.wait(_options.write_behind).then([this] {\n            return std::exchange(_background_writes_done, make_ready_future<>());\n        }).finally([this] {\n            _write_behind_sem.signal(_options.write_behind);\n        });\n    }\npublic:\n    virtual future<> flush() override {\n        return wait().then([this] {\n            return _file.flush();\n        });\n    }\n    virtual future<> close() noexcept {\n        return wait().finally([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>make fstream skippable<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    struct issued_read {\n        uint64_t _pos;\n        uint64_t _size;\n        future<temporary_buffer<char>> _ready;\n\n        issued_read(uint64_t pos, uint64_t size, future<temporary_buffer<char>> f)\n            : _pos(pos), _size(size), _ready(std::move(f)) { }\n    };\n\n    file _file;\n    file_input_stream_options _options;\n    uint64_t _pos;\n    uint64_t _remain;\n    circular_buffer<issued_read> _read_buffers;\n    unsigned _reads_in_progress = 0;\n    future<> _dropped_reads = make_ready_future<>();\n    std::experimental::optional<promise<>> _done;\npublic:\n    file_data_source_impl(file f, uint64_t offset, uint64_t len, file_input_stream_options options)\n            : _file(std::move(f)), _options(options), _pos(offset), _remain(len) {\n        \/\/ prevent wraparounds\n        _remain = std::min(std::numeric_limits<uint64_t>::max() - _pos, _remain);\n    }\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 std::move(ret._ready);\n    }\n    virtual future<temporary_buffer<char>> skip(uint64_t n) override {\n        while (n) {\n            if (_read_buffers.empty()) {\n                assert(n <= _remain);\n                _pos += n;\n                _remain -= n;\n                break;\n            }\n            auto& front = _read_buffers.front();\n            if (n < front._size) {\n                front._size -= n;\n                front._pos += n;\n                front._ready = front._ready.then([n] (temporary_buffer<char> buf) {\n                    buf.trim_front(n);\n                    return buf;\n                });\n                break;\n            } else {\n                auto f = front._ready.then_wrapped([] (auto f) { f.ignore_ready_future(); });\n                _dropped_reads = _dropped_reads.then([f = std::move(f)] () mutable { return std::move(f); });\n                n -= front._size;\n                _read_buffers.pop_front();\n            }\n        }\n        return make_ready_future<temporary_buffer<char>>();\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._ready.ignore_ready_future();\n            }\n            return std::move(_dropped_reads);\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        _read_buffers.reserve(ra); \/\/ prevent push_back() failure\n        while (_read_buffers.size() < ra) {\n            if (!_remain) {\n                if (_read_buffers.size() >= min_ra) {\n                    return;\n                }\n                _read_buffers.emplace_back(_pos, 0, make_ready_future<temporary_buffer<char>>());\n                continue;\n            }\n            ++_reads_in_progress;\n            \/\/ if _pos is not dma-aligned, we'll get a short read.  Account for that.\n            \/\/ Also avoid reading beyond _remain.\n            uint64_t align = _file.disk_read_dma_alignment();\n            auto start = align_down(_pos, align);\n            auto end = align_up(std::min(start + _options.buffer_size, _pos + _remain), align);\n            auto len = end - start;\n            auto actual_size = std::min(end - _pos, _remain);\n            _read_buffers.emplace_back(_pos, actual_size, futurize<future<temporary_buffer<char>>>::apply([&] {\n                    return _file.dma_read_bulk<char>(start, len, _options.io_priority_class);\n            }).then_wrapped(\n                    [this, start, end, pos = _pos, remain = _remain] (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                if ((pos == start && end <= pos + remain) || ret.failed()) {\n                    \/\/ no games needed\n                    return ret;\n                } else {\n                    \/\/ first or last buffer, need trimming\n                    auto tmp = ret.get0();\n                    auto real_end = start + tmp.size();\n                    if (real_end <= pos) {\n                        return make_ready_future<temporary_buffer<char>>();\n                    }\n                    if (real_end > pos + remain) {\n                        tmp.trim(pos + remain - start);\n                    }\n                    if (start < pos) {\n                        tmp.trim_front(pos - start);\n                    }\n                    return make_ready_future<temporary_buffer<char>>(std::move(tmp));\n                }\n            }));\n            auto old_pos = _pos;\n            _pos = end;\n            _remain = std::max(_pos, old_pos + _remain) - _pos;\n        };\n    }\n};\n\nclass file_data_source : public data_source {\npublic:\n    file_data_source(file f, uint64_t offset, uint64_t len, file_input_stream_options options)\n        : data_source(std::make_unique<file_data_source_impl>(\n                std::move(f), offset, len, options)) {}\n};\n\n\ninput_stream<char> make_file_input_stream(\n        file f, uint64_t offset, uint64_t len, file_input_stream_options options) {\n    return input_stream<char>(file_data_source(std::move(f), offset, len, std::move(options)));\n}\n\ninput_stream<char> make_file_input_stream(\n        file f, uint64_t offset, file_input_stream_options options) {\n    return make_file_input_stream(std::move(f), offset, std::numeric_limits<uint64_t>::max(), std::move(options));\n}\n\ninput_stream<char> make_file_input_stream(\n        file f, file_input_stream_options options) {\n    return make_file_input_stream(std::move(f), 0, std::move(options));\n}\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        _write_behind_sem.ensure_space_for_waiters(1); \/\/ So that wait() doesn't throw\n    }\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 semaphore 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    }\npublic:\n    future<> do_put(uint64_t pos, temporary_buffer<char> buf) noexcept {\n      try {\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_write_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_write_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_write_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        return _file.dma_write(pos, p, buf_size, _options.io_priority_class).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      } catch (...) {\n          return make_exception_future<>(std::current_exception());\n      }\n    }\n    future<> wait() noexcept {\n        \/\/ restore to pristine state; for flush() + close() sequence\n        \/\/ (we allow either flush, or close, or both)\n        return _write_behind_sem.wait(_options.write_behind).then([this] {\n            return std::exchange(_background_writes_done, make_ready_future<>());\n        }).finally([this] {\n            _write_behind_sem.signal(_options.write_behind);\n        });\n    }\npublic:\n    virtual future<> flush() override {\n        return wait().then([this] {\n            return _file.flush();\n        });\n    }\n    virtual future<> close() noexcept {\n        return wait().finally([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>#include \"entitysystem.h\"\n#include \"systems\/movementsystem.h\"\n#include \"systems\/updatesystem.h\"\n#include \"systems\/chatsystem.h\"\n#include \"systems\/inventorysystem.h\"\n#include \"systems\/partysystem.h\"\n#include \"systems\/mapsystem.h\"\n#include \"systems\/luasystem.h\"\n#include \"connection.h\"\n#include \"cmapclient.h\"\n\n#include <vector>\n#include <set>\n\nusing namespace RoseCommon;\nEntitySystem::EntitySystem() : systemManager_(*this) {\n    systemManager_.add<Systems::MovementSystem>();\n    systemManager_.add<Systems::UpdateSystem>();\n    systemManager_.add<Systems::ChatSystem>();\n    systemManager_.add<Systems::InventorySystem>();\n    systemManager_.add<Systems::PartySystem>();\n    systemManager_.add<Systems::MapSystem>();\n    systemManager_.add<Systems::LuaSystem>();\n}\n\nEntityManager &EntitySystem::getEntityManager() {\n    return entityManager_;\n}\n\nEntity EntitySystem::buildItemEntity(Entity creator, RoseCommon::Item&& item) {\n    Entity e = create();\n    e.assign<Item>(std::move(item));\n    auto pos = creator.component<Position>();\n    e.assign<Position>(pos->x_, pos->y_, pos->map_, 0);\n    e.assign<Owner>(creator.component<BasicInfo>()->id_);\n    return e;\n}\n\nvoid EntitySystem::registerEntity(Entity entity) {\n    if (!entity)\n        return;\n    auto basic = entity.component<BasicInfo>();\n    if (!basic || basic->name_ == \"\" || !basic->id_)\n        return;\n    nameToEntity_[basic->name_] = entity;\n    idToEntity_[basic->id_] = entity;\n}\n\nEntity EntitySystem::getEntity(const std::string &name) {\n    return nameToEntity_[name];\n}\n\nEntity EntitySystem::getEntity(uint32_t charId) {\n    return idToEntity_[charId];\n}\n\nvoid EntitySystem::update(double dt) {\n    std::lock_guard<std::mutex> lock(access_);\n    while (toDispatch_.size()) {\n        auto tmp = std::move(toDispatch_.front());\n        systemManager_.dispatch(tmp.first, *tmp.second);\n        toDispatch_.pop();\n    }\n    systemManager_.update(dt);\n    for (auto it : toDestroy_) {\n        if (it) {\n            saveCharacter(it.component<CharacterInfo>()->charId_, it);\n          auto basic = it.component<BasicInfo>();\n          nameToEntity_.erase(basic->name_);\n          idToEntity_.erase(basic->id_);\n          it.destroy();\n        }\n    }\n    toDestroy_.clear();\n}\n\nvoid EntitySystem::destroy(Entity entity) {\n    if (!entity)\n        return;\n    std::lock_guard<std::mutex> lock(access_);\n    toDestroy_.push_back(entity);\n}\n\nEntity EntitySystem::create() {\n    return entityManager_.create();\n}\n\nbool EntitySystem::isNearby(Entity a, Entity b) {\n    return true; \/\/ FIXME : actually implement the sight calculation instead of the distance\n    if (!a || !b)\n        return false;\n    auto posa = a.component<Position>();\n    auto posb = b.component<Position>();\n    if (!posa || !posb)\n        return false; \/\/ FIXME : is it a bug if there is no position?\n    if (posa->map_ != posb->map_)\n        return false;\n    double dist = (posa->x_ - posb->x_) * (posa->x_ - posb->x_) + (posa->y_ - posb->y_) * (posa->y_ - posb->y_);\n    if (dist > NEARBY_DIST)\n        return false;\n    return true;\n}\n\nbool EntitySystem::dispatch(Entity entity, std::unique_ptr<RoseCommon::CRosePacket> packet) {\n    if (!entity)\n        return false;\n    if (systemManager_.wouldDispatch(*packet)) {\n        std::lock_guard<std::mutex> lock(access_);\n        toDispatch_.emplace(std::make_pair(entity, std::move(packet)));\n        return true;\n    }\n    return false;\n}\n\nEntity EntitySystem::loadCharacter(uint32_t charId, bool platinium, uint32_t id) {\n    auto conn = Core::connectionPool.getConnection(Core::osirose);\n    Core::CharacterTable characters;\n    Core::InventoryTable inventoryTable;\n    Core::SkillTable skillsTable;\n\n    auto charRes = conn(sqlpp::select(sqlpp::count(characters.id), sqlpp::all_of(characters))\n                .from(characters)\n                .where(characters.id == charId));\n\n    std::lock_guard<std::mutex> lock(access_);\n    auto entity = create();\n    if (static_cast<long>(charRes.front().count) != 1L) {\n        entity.destroy();\n        return Entity();\n    }\n    const auto &charRow = charRes.front();\n\n    entity.assign<Position>(charRow);\n    entity.assign<BasicInfo>(charRow, id);\n    entity.assign<Stats>(charRow);\n    entity.assign<AdvancedInfo>(charRow);\n    entity.assign<CharacterGraphics>(charRow);\n    entity.assign<CharacterInfo>(charRow, platinium, charId);\n\n    \/\/ TODO : write the pat initialization code\n    auto skills = entity.assign<Skills>();\n    auto skillRes = conn(sqlpp::select(skillsTable.id, skillsTable.level)\n            .from(skillsTable)\n            .where(skillsTable.charId == charId));\n    skills->loadFromResult(skillRes);\n\n    \/\/ TODO : write the hotbar table and loading code\n    entity.assign<Hotbar>();\n    entity.assign<StatusEffects>();\n    entity.assign<RidingItems>();\n    entity.assign<BulletItems>();\n\n    \/\/ TODO : write the inventory code\n    \/\/auto luaSystem = systemManager_.get<Systems::LuaSystem>();\n    auto inventory = entity.assign<Inventory>();\n\n    auto invRes = conn(sqlpp::select(sqlpp::all_of(inventoryTable))\n                .from(inventoryTable)\n                .where(inventoryTable.charId == charId));\n    inventory->loadFromResult(invRes, get<Systems::InventorySystem>());\n\n    Systems::UpdateSystem::calculateSpeed(entity);\n\n    entity.assign<Quests>();\n\n    Core::WishTable wish;\n    auto wishRes = conn(sqlpp::select(sqlpp::all_of(wish))\n                        .from(wish)\n                        .where(wish.charId == charId));\n    auto wishlist = entity.assign<Wishlist>();\n    wishlist->loadFromResult(wishRes, get<Systems::InventorySystem>());\n\n    \/\/auto lua = entity.assign<EntityAPI>();\n\n    \/\/luaSystem->loadScript(entity, \"function onInit()\\ndisplay('test')\\nend\");\n    \/\/lua->onInit();\n\n    registerEntity(entity);\n    return entity;\n}\n\nvoid EntitySystem::saveCharacter(uint32_t charId, Entity entity) {\n    if (!entity)\n        return;\n    auto conn = Core::connectionPool.getConnection(Core::osirose);\n    Core::CharacterTable characters;\n\n    using sqlpp::parameter;\n\n    auto update = sqlpp::dynamic_update(conn.get(), characters).dynamic_set().where(characters.id == charId);\n    entity.component<Position>()->commitToUpdate<decltype(characters)>(update);\n    entity.component<BasicInfo>()->commitToUpdate<decltype(characters)>(update);\n    entity.component<Stats>()->commitToUpdate<decltype(characters)>(update);\n    entity.component<AdvancedInfo>()->commitToUpdate<decltype(characters)>(update);\n    \/\/entity.component<CharacterGraphics>()->commitToUpdate(update);\n    entity.component<CharacterInfo>()->commitToUpdate<decltype(characters)>(update);\n    \/\/entity.component<Hotbar>()->commitToUpdate(update);\n    \/\/entity.component<StatusEffects>()->commitToUpdate(update);\n    \/\/entity.component<RidingItems>()->commitToUpdate(update);\n    \/\/entity.component<BulletItems>()->commitToUpdate(update);\n\n    conn->run(update);\n\n    \/\/entity.component<Skills>()->commitToUpdate(updateSkills);\n\n    Core::InventoryTable inv;\n    auto invRes = conn(sqlpp::select(sqlpp::all_of(inv))\n                       .from(inv)\n                       .where(inv.charId == charId));\n\n    const auto& items = entity.component<Inventory>()->items_;\n\n    std::vector<size_t> toDelete;\n    std::vector<size_t> toUpdate;\n    std::set<size_t> modified;\n    std::vector<size_t> toInsert;\n\n    for (const auto& row : invRes) {\n      if (row.slot >= Inventory::maxItems)\n        toDelete.emplace_back(row.slot); \/\/FIXME: that should never happen\n      else if (!items[row.slot])\n        toDelete.emplace_back(row.slot);\n      else if (items[row.slot] != Item(row, get<Systems::InventorySystem>()))\n        toUpdate.emplace_back(row.slot);\n      modified.insert(row.slot);\n    }\n    size_t i = 0;\n    for (const auto& item : items) {\n      if (item && modified.find(i) == modified.end())\n        toInsert.emplace_back(i);\n      ++i;\n    }\n\n    for (auto it : toDelete)\n      conn(sqlpp::remove_from(inv).where(inv.charId == charId and inv.slot == it));\n    for (auto it : toUpdate) {\n      auto update = sqlpp::dynamic_update(conn.get(), inv).dynamic_set().where(inv.charId == charId and inv.slot == it);\n      items[it].commitToUpdate<decltype(inv)>(update);\n      conn->run(update);\n    }\n    for (auto it : toInsert) {\n      auto insert = sqlpp::dynamic_insert_into(conn.get(), inv).dynamic_set();\n      items[it].commitToInsert<decltype(inv)>(insert);\n      insert.insert_list.add(inv.slot = it);\n      insert.insert_list.add(inv.charId = charId);\n      conn->run(insert);\n    }\n}\n<commit_msg>Update entitysystem.cpp<commit_after>#include \"entitysystem.h\"\n#include \"systems\/movementsystem.h\"\n#include \"systems\/updatesystem.h\"\n#include \"systems\/chatsystem.h\"\n#include \"systems\/inventorysystem.h\"\n#include \"systems\/partysystem.h\"\n#include \"systems\/mapsystem.h\"\n#include \"systems\/luasystem.h\"\n#include \"connection.h\"\n#include \"cmapclient.h\"\n\n#include <vector>\n#include <set>\n\nusing namespace RoseCommon;\nEntitySystem::EntitySystem() : systemManager_(*this) {\n    systemManager_.add<Systems::MovementSystem>();\n    systemManager_.add<Systems::UpdateSystem>();\n    systemManager_.add<Systems::ChatSystem>();\n    systemManager_.add<Systems::InventorySystem>();\n    systemManager_.add<Systems::PartySystem>();\n    systemManager_.add<Systems::MapSystem>();\n    systemManager_.add<Systems::LuaSystem>();\n}\n\nEntityManager &EntitySystem::getEntityManager() {\n    return entityManager_;\n}\n\nEntity EntitySystem::buildItemEntity(Entity creator, RoseCommon::Item&& item) {\n    Entity e = create();\n    e.assign<Item>(std::move(item));\n    auto pos = creator.component<Position>();\n    e.assign<Position>(pos->x_, pos->y_, pos->map_, 0);\n    auto basic = e.assign<BasicInfo>();\n    basic.ownerId_ = creator.component<BasicInfo>()->id_;\n    basic.id_ = nextId_++;\n    return e;\n}\n\nvoid EntitySystem::registerEntity(Entity entity) {\n    ++nextId_;\n    if (!entity)\n        return;\n    auto basic = entity.component<BasicInfo>();\n    if (!basic || basic->name_ == \"\" || !basic->id_)\n        return;\n    nameToEntity_[basic->name_] = entity;\n    idToEntity_[basic->id_] = entity;\n}\n\nEntity EntitySystem::getEntity(const std::string &name) {\n    return nameToEntity_[name];\n}\n\nEntity EntitySystem::getEntity(uint32_t charId) {\n    return idToEntity_[charId];\n}\n\nvoid EntitySystem::update(double dt) {\n    std::lock_guard<std::mutex> lock(access_);\n    while (toDispatch_.size()) {\n        auto tmp = std::move(toDispatch_.front());\n        systemManager_.dispatch(tmp.first, *tmp.second);\n        toDispatch_.pop();\n    }\n    systemManager_.update(dt);\n    for (auto it : toDestroy_) {\n        if (it) {\n            saveCharacter(it.component<CharacterInfo>()->charId_, it);\n          auto basic = it.component<BasicInfo>();\n          nameToEntity_.erase(basic->name_);\n          idToEntity_.erase(basic->id_);\n          it.destroy();\n        }\n    }\n    toDestroy_.clear();\n}\n\nvoid EntitySystem::destroy(Entity entity) {\n    if (!entity)\n        return;\n    std::lock_guard<std::mutex> lock(access_);\n    toDestroy_.push_back(entity);\n}\n\nEntity EntitySystem::create() {\n    return entityManager_.create();\n}\n\nbool EntitySystem::isNearby(Entity a, Entity b) {\n    return true; \/\/ FIXME : actually implement the sight calculation instead of the distance\n    if (!a || !b)\n        return false;\n    auto posa = a.component<Position>();\n    auto posb = b.component<Position>();\n    if (!posa || !posb)\n        return false; \/\/ FIXME : is it a bug if there is no position?\n    if (posa->map_ != posb->map_)\n        return false;\n    double dist = (posa->x_ - posb->x_) * (posa->x_ - posb->x_) + (posa->y_ - posb->y_) * (posa->y_ - posb->y_);\n    if (dist > NEARBY_DIST)\n        return false;\n    return true;\n}\n\nbool EntitySystem::dispatch(Entity entity, std::unique_ptr<RoseCommon::CRosePacket> packet) {\n    if (!entity)\n        return false;\n    if (systemManager_.wouldDispatch(*packet)) {\n        std::lock_guard<std::mutex> lock(access_);\n        toDispatch_.emplace(std::make_pair(entity, std::move(packet)));\n        return true;\n    }\n    return false;\n}\n\nEntity EntitySystem::loadCharacter(uint32_t charId, bool platinium, uint32_t id) {\n    auto conn = Core::connectionPool.getConnection(Core::osirose);\n    Core::CharacterTable characters;\n    Core::InventoryTable inventoryTable;\n    Core::SkillTable skillsTable;\n\n    auto charRes = conn(sqlpp::select(sqlpp::count(characters.id), sqlpp::all_of(characters))\n                .from(characters)\n                .where(characters.id == charId));\n\n    std::lock_guard<std::mutex> lock(access_);\n    auto entity = create();\n    if (static_cast<long>(charRes.front().count) != 1L) {\n        entity.destroy();\n        return Entity();\n    }\n    const auto &charRow = charRes.front();\n\n    entity.assign<Position>(charRow);\n    entity.assign<BasicInfo>(charRow, id);\n    entity.assign<Stats>(charRow);\n    entity.assign<AdvancedInfo>(charRow);\n    entity.assign<CharacterGraphics>(charRow);\n    entity.assign<CharacterInfo>(charRow, platinium, charId);\n\n    \/\/ TODO : write the pat initialization code\n    auto skills = entity.assign<Skills>();\n    auto skillRes = conn(sqlpp::select(skillsTable.id, skillsTable.level)\n            .from(skillsTable)\n            .where(skillsTable.charId == charId));\n    skills->loadFromResult(skillRes);\n\n    \/\/ TODO : write the hotbar table and loading code\n    entity.assign<Hotbar>();\n    entity.assign<StatusEffects>();\n    entity.assign<RidingItems>();\n    entity.assign<BulletItems>();\n\n    \/\/ TODO : write the inventory code\n    \/\/auto luaSystem = systemManager_.get<Systems::LuaSystem>();\n    auto inventory = entity.assign<Inventory>();\n\n    auto invRes = conn(sqlpp::select(sqlpp::all_of(inventoryTable))\n                .from(inventoryTable)\n                .where(inventoryTable.charId == charId));\n    inventory->loadFromResult(invRes, get<Systems::InventorySystem>());\n\n    Systems::UpdateSystem::calculateSpeed(entity);\n\n    entity.assign<Quests>();\n\n    Core::WishTable wish;\n    auto wishRes = conn(sqlpp::select(sqlpp::all_of(wish))\n                        .from(wish)\n                        .where(wish.charId == charId));\n    auto wishlist = entity.assign<Wishlist>();\n    wishlist->loadFromResult(wishRes, get<Systems::InventorySystem>());\n\n    \/\/auto lua = entity.assign<EntityAPI>();\n\n    \/\/luaSystem->loadScript(entity, \"function onInit()\\ndisplay('test')\\nend\");\n    \/\/lua->onInit();\n\n    registerEntity(entity);\n    return entity;\n}\n\nvoid EntitySystem::saveCharacter(uint32_t charId, Entity entity) {\n    if (!entity)\n        return;\n    auto conn = Core::connectionPool.getConnection(Core::osirose);\n    Core::CharacterTable characters;\n\n    using sqlpp::parameter;\n\n    auto update = sqlpp::dynamic_update(conn.get(), characters).dynamic_set().where(characters.id == charId);\n    entity.component<Position>()->commitToUpdate<decltype(characters)>(update);\n    entity.component<BasicInfo>()->commitToUpdate<decltype(characters)>(update);\n    entity.component<Stats>()->commitToUpdate<decltype(characters)>(update);\n    entity.component<AdvancedInfo>()->commitToUpdate<decltype(characters)>(update);\n    \/\/entity.component<CharacterGraphics>()->commitToUpdate(update);\n    entity.component<CharacterInfo>()->commitToUpdate<decltype(characters)>(update);\n    \/\/entity.component<Hotbar>()->commitToUpdate(update);\n    \/\/entity.component<StatusEffects>()->commitToUpdate(update);\n    \/\/entity.component<RidingItems>()->commitToUpdate(update);\n    \/\/entity.component<BulletItems>()->commitToUpdate(update);\n\n    conn->run(update);\n\n    \/\/entity.component<Skills>()->commitToUpdate(updateSkills);\n\n    Core::InventoryTable inv;\n    auto invRes = conn(sqlpp::select(sqlpp::all_of(inv))\n                       .from(inv)\n                       .where(inv.charId == charId));\n\n    const auto& items = entity.component<Inventory>()->items_;\n\n    std::vector<size_t> toDelete;\n    std::vector<size_t> toUpdate;\n    std::set<size_t> modified;\n    std::vector<size_t> toInsert;\n\n    for (const auto& row : invRes) {\n      if (row.slot >= Inventory::maxItems)\n        toDelete.emplace_back(row.slot); \/\/FIXME: that should never happen\n      else if (!items[row.slot])\n        toDelete.emplace_back(row.slot);\n      else if (items[row.slot] != Item(row, get<Systems::InventorySystem>()))\n        toUpdate.emplace_back(row.slot);\n      modified.insert(row.slot);\n    }\n    size_t i = 0;\n    for (const auto& item : items) {\n      if (item && modified.find(i) == modified.end())\n        toInsert.emplace_back(i);\n      ++i;\n    }\n\n    for (auto it : toDelete)\n      conn(sqlpp::remove_from(inv).where(inv.charId == charId and inv.slot == it));\n    for (auto it : toUpdate) {\n      auto update = sqlpp::dynamic_update(conn.get(), inv).dynamic_set().where(inv.charId == charId and inv.slot == it);\n      items[it].commitToUpdate<decltype(inv)>(update);\n      conn->run(update);\n    }\n    for (auto it : toInsert) {\n      auto insert = sqlpp::dynamic_insert_into(conn.get(), inv).dynamic_set();\n      items[it].commitToInsert<decltype(inv)>(insert);\n      insert.insert_list.add(inv.slot = it);\n      insert.insert_list.add(inv.charId = charId);\n      conn->run(insert);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"caffe2\/core\/context_gpu.h\"\n#include \"caffe2\/core\/operator.h\"\n\n#include \"cuda_nccl_gpu.h\"\n\nnamespace caffe2 {\n\nnccl::NCCLExecution getNCCLElements(\n    OperatorBase* op,\n    const CUDAContext& context) {\n  \/\/ We either do an N-N op, or an N-1 op.\n  CAFFE_ENFORCE(op->InputSize() == op->OutputSize() || op->OutputSize() == 1);\n  nccl::NCCLExecution ex;\n  ex.stream_gpu_id = context.cuda_gpu_id();\n  ex.stream = context.cuda_stream();\n  ex.root = op->template GetSingleArgument<int>(\"root\", 0);\n  ex.elements.resize(op->InputSize());\n  for (auto i = 0; i < op->InputSize(); ++i) {\n    auto& el = ex.elements[i];\n    el.src = &(op->Input<TensorCUDA>(i));\n    if (i < op->OutputSize()) {\n      el.dst = op->Output<TensorCUDA>(i);\n    }\n    \/\/ TODO - expensive (>1ms) - cache these.\n    el.device = GetGPUIDForPointer(op->Input<TensorCUDA>(i).raw_data());\n  }\n\n  return ex;\n}\n\nnamespace {\n\/\/ Check if all inputs are float\ntemplate <typename T>\nbool AllInputsAre(OperatorBase* op) {\n  for (auto i = 0; i < op->InputSize(); ++i) {\n    if (op->Input<TensorCUDA>(i).IsType<T>()) {\n      continue;\n    } else {\n      return false;\n    }\n  }\n  return true;\n}\n}; \/\/ namespace\n\nclass NCCLAllreduceOp final : public Operator<CUDAContext> {\n public:\n  using Operator::Operator;\n  NCCLAllreduceOp(const OperatorDef& operator_def, Workspace* ws)\n      : Operator<CUDAContext>(operator_def, ws) {}\n  bool RunOnDevice() override {\n    if (InputSize() == 1)\n      return true;\n\n    if (AllInputsAre<float>(this)) {\n      nccl::NCCL<float>::AllReduce(getNCCLElements(this, context_));\n      return true;\n    } else if (AllInputsAre<float16>(this)) {\n      nccl::NCCL<float16>::AllReduce(getNCCLElements(this, context_));\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n protected:\n};\n\nclass NCCLBroadcastOp final : public Operator<CUDAContext> {\n public:\n  USE_OPERATOR_FUNCTIONS(CUDAContext);\n  using Operator::Operator;\n  bool RunOnDevice() override {\n    if (InputSize() == 1)\n      return true;\n    if (AllInputsAre<float>(this)) {\n      nccl::NCCL<float>::Broadcast(getNCCLElements(this, context_));\n      return true;\n    } else if (AllInputsAre<float16>(this)) {\n      nccl::NCCL<float16>::Broadcast(getNCCLElements(this, context_));\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n protected:\n};\n\nclass NCCLReduceOp final : public Operator<CUDAContext> {\n public:\n  USE_OPERATOR_FUNCTIONS(CUDAContext);\n  using Operator::Operator;\n  bool RunOnDevice() override {\n    if (InputSize() == 1)\n      return true;\n    const auto& ex = getNCCLElements(this, context_);\n    CAFFE_ENFORCE_EQ(\n        ex.root, 0, \"NCCLReduce has spurious deadlocks for non-zero root\");\n\n    if (AllInputsAre<float>(this)) {\n      nccl::NCCL<float>::Reduce(ex);\n      return true;\n    } else if (AllInputsAre<float16>(this)) {\n      nccl::NCCL<float16>::Reduce(ex);\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n protected:\n};\n\nclass NCCLAllGatherOp final : public Operator<CUDAContext> {\n public:\n  USE_OPERATOR_FUNCTIONS(CUDAContext);\n  using Operator::Operator;\n  bool RunOnDevice() override {\n    if (InputSize() == 1)\n      return true;\n    if (AllInputsAre<float>(this)) {\n      nccl::NCCL<float>::AllGather(getNCCLElements(this, context_));\n      return true;\n    } else if (AllInputsAre<float16>(this)) {\n      nccl::NCCL<float16>::AllGather(getNCCLElements(this, context_));\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n protected:\n};\n\nnamespace {\nREGISTER_CUDA_OPERATOR(NCCLAllreduce, NCCLAllreduceOp);\nOPERATOR_SCHEMA(NCCLAllreduce)\n    .NumInputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .NumOutputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .IdenticalTypeAndShape()\n    .InputsCanCrossDevices()\n    .AllowOneToOneInplace();\nSHOULD_NOT_DO_GRADIENT(NCCLAllreduce);\n\nREGISTER_CUDA_OPERATOR(NCCLBroadcast, NCCLBroadcastOp);\nOPERATOR_SCHEMA(NCCLBroadcast)\n    .NumInputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .NumOutputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .IdenticalTypeAndShape()\n    .InputsCanCrossDevices()\n    .EnforceOneToOneInplace();\nSHOULD_NOT_DO_GRADIENT(NCCLBroadcast);\n\nREGISTER_CUDA_OPERATOR(NCCLReduce, NCCLReduceOp);\nOPERATOR_SCHEMA(NCCLReduce)\n    .NumInputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .NumOutputs(1)\n    .IdenticalTypeAndShapeOfInput(0)\n    .InputsCanCrossDevices()\n    .AllowInplace({{0, 0}});\nSHOULD_NOT_DO_GRADIENT(NCCLReduce);\n\nREGISTER_CUDA_OPERATOR(NCCLAllGather, NCCLAllGatherOp);\nOPERATOR_SCHEMA(NCCLAllGather)\n    .NumInputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .NumOutputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .InputsCanCrossDevices();\nSHOULD_NOT_DO_GRADIENT(NCCLAllGather);\n} \/\/ namespace\n\n} \/\/ namespace caffe2\n<commit_msg>DeviceInference function for NCCLAllreduce<commit_after>#include \"caffe2\/core\/context_gpu.h\"\n#include \"caffe2\/core\/operator.h\"\n\n#include \"cuda_nccl_gpu.h\"\n\nnamespace caffe2 {\n\nnccl::NCCLExecution getNCCLElements(\n    OperatorBase* op,\n    const CUDAContext& context) {\n  \/\/ We either do an N-N op, or an N-1 op.\n  CAFFE_ENFORCE(op->InputSize() == op->OutputSize() || op->OutputSize() == 1);\n  nccl::NCCLExecution ex;\n  ex.stream_gpu_id = context.cuda_gpu_id();\n  ex.stream = context.cuda_stream();\n  ex.root = op->template GetSingleArgument<int>(\"root\", 0);\n  ex.elements.resize(op->InputSize());\n  for (auto i = 0; i < op->InputSize(); ++i) {\n    auto& el = ex.elements[i];\n    el.src = &(op->Input<TensorCUDA>(i));\n    if (i < op->OutputSize()) {\n      el.dst = op->Output<TensorCUDA>(i);\n    }\n    \/\/ TODO - expensive (>1ms) - cache these.\n    el.device = GetGPUIDForPointer(op->Input<TensorCUDA>(i).raw_data());\n  }\n\n  return ex;\n}\n\nnamespace {\n\/\/ Check if all inputs are float\ntemplate <typename T>\nbool AllInputsAre(OperatorBase* op) {\n  for (auto i = 0; i < op->InputSize(); ++i) {\n    if (op->Input<TensorCUDA>(i).IsType<T>()) {\n      continue;\n    } else {\n      return false;\n    }\n  }\n  return true;\n}\n}; \/\/ namespace\n\nclass NCCLAllreduceOp final : public Operator<CUDAContext> {\n public:\n  using Operator::Operator;\n  NCCLAllreduceOp(const OperatorDef& operator_def, Workspace* ws)\n      : Operator<CUDAContext>(operator_def, ws) {}\n  bool RunOnDevice() override {\n    if (InputSize() == 1)\n      return true;\n\n    if (AllInputsAre<float>(this)) {\n      nccl::NCCL<float>::AllReduce(getNCCLElements(this, context_));\n      return true;\n    } else if (AllInputsAre<float16>(this)) {\n      nccl::NCCL<float16>::AllReduce(getNCCLElements(this, context_));\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n protected:\n};\n\nclass NCCLBroadcastOp final : public Operator<CUDAContext> {\n public:\n  USE_OPERATOR_FUNCTIONS(CUDAContext);\n  using Operator::Operator;\n  bool RunOnDevice() override {\n    if (InputSize() == 1)\n      return true;\n    if (AllInputsAre<float>(this)) {\n      nccl::NCCL<float>::Broadcast(getNCCLElements(this, context_));\n      return true;\n    } else if (AllInputsAre<float16>(this)) {\n      nccl::NCCL<float16>::Broadcast(getNCCLElements(this, context_));\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n protected:\n};\n\nclass NCCLReduceOp final : public Operator<CUDAContext> {\n public:\n  USE_OPERATOR_FUNCTIONS(CUDAContext);\n  using Operator::Operator;\n  bool RunOnDevice() override {\n    if (InputSize() == 1)\n      return true;\n    const auto& ex = getNCCLElements(this, context_);\n    CAFFE_ENFORCE_EQ(\n        ex.root, 0, \"NCCLReduce has spurious deadlocks for non-zero root\");\n\n    if (AllInputsAre<float>(this)) {\n      nccl::NCCL<float>::Reduce(ex);\n      return true;\n    } else if (AllInputsAre<float16>(this)) {\n      nccl::NCCL<float16>::Reduce(ex);\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n protected:\n};\n\nclass NCCLAllGatherOp final : public Operator<CUDAContext> {\n public:\n  USE_OPERATOR_FUNCTIONS(CUDAContext);\n  using Operator::Operator;\n  bool RunOnDevice() override {\n    if (InputSize() == 1)\n      return true;\n    if (AllInputsAre<float>(this)) {\n      nccl::NCCL<float>::AllGather(getNCCLElements(this, context_));\n      return true;\n    } else if (AllInputsAre<float16>(this)) {\n      nccl::NCCL<float16>::AllGather(getNCCLElements(this, context_));\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n protected:\n};\n\nnamespace {\nREGISTER_CUDA_OPERATOR(NCCLAllreduce, NCCLAllreduceOp);\nOPERATOR_SCHEMA(NCCLAllreduce)\n    .NumInputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .NumOutputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .IdenticalTypeAndShape()\n    .InputsCanCrossDevices()\n    .AllowOneToOneInplace()\n    .DeviceInferenceFunction([](const OperatorDef& def) {\n      std::vector<DeviceOption> opt;\n      for (int i = 0; i < def.input().size(); ++i) {\n        DeviceOption dev;\n        dev.set_device_type(1);\n        dev.set_cuda_gpu_id(i);\n        opt.push_back(dev);\n      }\n      return std::make_pair(opt, opt);\n    });\nSHOULD_NOT_DO_GRADIENT(NCCLAllreduce);\n\nREGISTER_CUDA_OPERATOR(NCCLBroadcast, NCCLBroadcastOp);\nOPERATOR_SCHEMA(NCCLBroadcast)\n    .NumInputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .NumOutputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .IdenticalTypeAndShape()\n    .InputsCanCrossDevices()\n    .EnforceOneToOneInplace();\nSHOULD_NOT_DO_GRADIENT(NCCLBroadcast);\n\nREGISTER_CUDA_OPERATOR(NCCLReduce, NCCLReduceOp);\nOPERATOR_SCHEMA(NCCLReduce)\n    .NumInputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .NumOutputs(1)\n    .IdenticalTypeAndShapeOfInput(0)\n    .InputsCanCrossDevices()\n    .AllowInplace({{0, 0}});\nSHOULD_NOT_DO_GRADIENT(NCCLReduce);\n\nREGISTER_CUDA_OPERATOR(NCCLAllGather, NCCLAllGatherOp);\nOPERATOR_SCHEMA(NCCLAllGather)\n    .NumInputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .NumOutputs(1, CAFFE2_COMPILE_TIME_MAX_GPUS)\n    .InputsCanCrossDevices();\nSHOULD_NOT_DO_GRADIENT(NCCLAllGather);\n} \/\/ namespace\n\n} \/\/ namespace caffe2\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright © 2011 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\nextern \"C\" {\n#include \"main\/macros.h\"\n#include \"program\/register_allocate.h\"\n} \/* extern \"C\" *\/\n\n#include \"brw_vec4.h\"\n#include \"glsl\/ir_print_visitor.h\"\n\nusing namespace brw;\n\nnamespace brw {\n\nstatic void\nassign(unsigned int *reg_hw_locations, reg *reg)\n{\n   if (reg->file == GRF) {\n      reg->reg = reg_hw_locations[reg->reg];\n   }\n}\n\nbool\nvec4_visitor::reg_allocate_trivial()\n{\n   unsigned int hw_reg_mapping[this->virtual_grf_count];\n   bool virtual_grf_used[this->virtual_grf_count];\n   int i;\n   int next;\n\n   \/* Calculate which virtual GRFs are actually in use after whatever\n    * optimization passes have occurred.\n    *\/\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      virtual_grf_used[i] = false;\n   }\n\n   foreach_iter(exec_list_iterator, iter, this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)iter.get();\n\n      if (inst->dst.file == GRF)\n\t virtual_grf_used[inst->dst.reg] = true;\n\n      for (int i = 0; i < 3; i++) {\n\t if (inst->src[i].file == GRF)\n\t    virtual_grf_used[inst->src[i].reg] = true;\n      }\n   }\n\n   hw_reg_mapping[0] = this->first_non_payload_grf;\n   next = hw_reg_mapping[0] + this->virtual_grf_sizes[0];\n   for (i = 1; i < this->virtual_grf_count; i++) {\n      if (virtual_grf_used[i]) {\n\t hw_reg_mapping[i] = next;\n\t next += this->virtual_grf_sizes[i];\n      }\n   }\n   prog_data->total_grf = next;\n\n   foreach_iter(exec_list_iterator, iter, this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)iter.get();\n\n      assign(hw_reg_mapping, &inst->dst);\n      assign(hw_reg_mapping, &inst->src[0]);\n      assign(hw_reg_mapping, &inst->src[1]);\n      assign(hw_reg_mapping, &inst->src[2]);\n   }\n\n   if (prog_data->total_grf > max_grf) {\n      fail(\"Ran out of regs on trivial allocator (%d\/%d)\\n\",\n\t   prog_data->total_grf, max_grf);\n      return false;\n   }\n\n   return true;\n}\n\nstatic void\nbrw_alloc_reg_set_for_classes(struct brw_context *brw,\n\t\t\t      int *class_sizes,\n\t\t\t      int class_count,\n\t\t\t      int base_reg_count)\n{\n   \/* Compute the total number of registers across all classes. *\/\n   int ra_reg_count = 0;\n   for (int i = 0; i < class_count; i++) {\n      ra_reg_count += base_reg_count - (class_sizes[i] - 1);\n   }\n\n   ralloc_free(brw->vs.ra_reg_to_grf);\n   brw->vs.ra_reg_to_grf = ralloc_array(brw, uint8_t, ra_reg_count);\n   ralloc_free(brw->vs.regs);\n   brw->vs.regs = ra_alloc_reg_set(brw, ra_reg_count);\n   ralloc_free(brw->vs.classes);\n   brw->vs.classes = ralloc_array(brw, int, class_count + 1);\n\n   \/* Now, add the registers to their classes, and add the conflicts\n    * between them and the base GRF registers (and also each other).\n    *\/\n   int reg = 0;\n   for (int i = 0; i < class_count; i++) {\n      int class_reg_count = base_reg_count - (class_sizes[i] - 1);\n      brw->vs.classes[i] = ra_alloc_reg_class(brw->vs.regs);\n\n      for (int j = 0; j < class_reg_count; j++) {\n\t ra_class_add_reg(brw->vs.regs, brw->vs.classes[i], reg);\n\n\t brw->vs.ra_reg_to_grf[reg] = j;\n\n\t for (int base_reg = j;\n\t      base_reg < j + class_sizes[i];\n\t      base_reg++) {\n\t    ra_add_transitive_reg_conflict(brw->vs.regs, base_reg, reg);\n\t }\n\n\t reg++;\n      }\n   }\n   assert(reg == ra_reg_count);\n\n   ra_set_finalize(brw->vs.regs, NULL);\n}\n\nbool\nvec4_visitor::reg_allocate()\n{\n   unsigned int hw_reg_mapping[virtual_grf_count];\n   int first_assigned_grf = this->first_non_payload_grf;\n   int base_reg_count = max_grf - first_assigned_grf;\n   int class_sizes[base_reg_count];\n   int class_count = 0;\n\n   \/* Using the trivial allocator can be useful in debugging undefined\n    * register access as a result of broken optimization passes.\n    *\/\n   if (0)\n      return reg_allocate_trivial();\n\n   calculate_live_intervals();\n\n   \/* Set up the register classes.\n    *\n    * The base registers store a vec4.  However, we'll need larger\n    * storage for arrays, structures, and matrices, which will be sets\n    * of contiguous registers.\n    *\/\n   class_sizes[class_count++] = 1;\n\n   for (int r = 0; r < virtual_grf_count; r++) {\n      int i;\n\n      for (i = 0; i < class_count; i++) {\n\t if (class_sizes[i] == this->virtual_grf_sizes[r])\n\t    break;\n      }\n      if (i == class_count) {\n\t if (this->virtual_grf_sizes[r] >= base_reg_count) {\n\t    fail(\"Object too large to register allocate.\\n\");\n\t }\n\n\t class_sizes[class_count++] = this->virtual_grf_sizes[r];\n      }\n   }\n\n   brw_alloc_reg_set_for_classes(brw, class_sizes, class_count, base_reg_count);\n\n   struct ra_graph *g = ra_alloc_interference_graph(brw->vs.regs,\n\t\t\t\t\t\t    virtual_grf_count);\n\n   for (int i = 0; i < virtual_grf_count; i++) {\n      for (int c = 0; c < class_count; c++) {\n\t if (class_sizes[c] == this->virtual_grf_sizes[i]) {\n\t    ra_set_node_class(g, i, brw->vs.classes[c]);\n\t    break;\n\t }\n      }\n\n      for (int j = 0; j < i; j++) {\n\t if (virtual_grf_interferes(i, j)) {\n\t    ra_add_node_interference(g, i, j);\n\t }\n      }\n   }\n\n   if (!ra_allocate_no_spills(g)) {\n      \/* Failed to allocate registers.  Spill a reg, and the caller will\n       * loop back into here to try again.\n       *\/\n      int reg = choose_spill_reg(g);\n      if (reg == -1) {\n         fail(\"no register to spill\\n\");\n      } else {\n         spill_reg(reg);\n      }\n      ralloc_free(g);\n      return false;\n   }\n\n   \/* Get the chosen virtual registers for each node, and map virtual\n    * regs in the register classes back down to real hardware reg\n    * numbers.\n    *\/\n   prog_data->total_grf = first_assigned_grf;\n   for (int i = 0; i < virtual_grf_count; i++) {\n      int reg = ra_get_node_reg(g, i);\n\n      hw_reg_mapping[i] = first_assigned_grf + brw->vs.ra_reg_to_grf[reg];\n      prog_data->total_grf = MAX2(prog_data->total_grf,\n\t\t\t\t  hw_reg_mapping[i] + virtual_grf_sizes[i]);\n   }\n\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)node;\n\n      assign(hw_reg_mapping, &inst->dst);\n      assign(hw_reg_mapping, &inst->src[0]);\n      assign(hw_reg_mapping, &inst->src[1]);\n      assign(hw_reg_mapping, &inst->src[2]);\n   }\n\n   ralloc_free(g);\n\n   return true;\n}\n\nvoid\nvec4_visitor::evaluate_spill_costs(float *spill_costs, bool *no_spill)\n{\n   float loop_scale = 1.0;\n\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      spill_costs[i] = 0.0;\n      no_spill[i] = virtual_grf_sizes[i] != 1;\n   }\n\n   \/* Calculate costs for spilling nodes.  Call it a cost of 1 per\n    * spill\/unspill we'll have to do, and guess that the insides of\n    * loops run 10 times.\n    *\/\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *) node;\n\n      for (unsigned int i = 0; i < 3; i++) {\n\t if (inst->src[i].file == GRF) {\n\t    spill_costs[inst->src[i].reg] += loop_scale;\n            if (inst->src[i].reladdr)\n               no_spill[inst->src[i].reg] = true;\n\t }\n      }\n\n      if (inst->dst.file == GRF) {\n\t spill_costs[inst->dst.reg] += loop_scale;\n         if (inst->dst.reladdr)\n            no_spill[inst->dst.reg] = true;\n      }\n\n      switch (inst->opcode) {\n\n      case BRW_OPCODE_DO:\n\t loop_scale *= 10;\n\t break;\n\n      case BRW_OPCODE_WHILE:\n\t loop_scale \/= 10;\n\t break;\n\n      case VS_OPCODE_SCRATCH_READ:\n      case VS_OPCODE_SCRATCH_WRITE:\n         for (int i = 0; i < 3; i++) {\n            if (inst->src[i].file == GRF)\n               no_spill[inst->src[i].reg] = true;\n         }\n\t if (inst->dst.file == GRF)\n\t    no_spill[inst->dst.reg] = true;\n\t break;\n\n      default:\n\t break;\n      }\n   }\n}\n\nint\nvec4_visitor::choose_spill_reg(struct ra_graph *g)\n{\n   float spill_costs[this->virtual_grf_count];\n   bool no_spill[this->virtual_grf_count];\n\n   evaluate_spill_costs(spill_costs, no_spill);\n\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      if (!no_spill[i])\n         ra_set_node_spill_cost(g, i, spill_costs[i]);\n   }\n\n   return ra_get_best_spill_node(g);\n}\n\nvoid\nvec4_visitor::spill_reg(int spill_reg_nr)\n{\n   assert(virtual_grf_sizes[spill_reg_nr] == 1);\n   unsigned int spill_offset = c->last_scratch++;\n\n   \/* Generate spill\/unspill instructions for the objects being spilled. *\/\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *) node;\n\n      for (unsigned int i = 0; i < 3; i++) {\n         if (inst->src[i].file == GRF && inst->src[i].reg == spill_reg_nr) {\n            src_reg spill_reg = inst->src[i];\n            inst->src[i].reg = virtual_grf_alloc(1);\n            dst_reg temp = dst_reg(inst->src[i]);\n\n            \/* Only read the necessary channels, to avoid overwriting the rest\n             * with data that may not have been written to scratch.\n             *\/\n            temp.writemask = 0;\n            for (int c = 0; c < 4; c++)\n               temp.writemask |= (1 << BRW_GET_SWZ(inst->src[i].swizzle, c));\n            assert(temp.writemask != 0);\n\n            emit_scratch_read(inst, temp, spill_reg, spill_offset);\n         }\n      }\n\n      if (inst->dst.file == GRF && inst->dst.reg == spill_reg_nr) {\n         emit_scratch_write(inst, spill_offset);\n      }\n   }\n\n   this->live_intervals_valid = false;\n}\n\n} \/* namespace brw *\/\n<commit_msg>i965\/vs: Do round-robin register allocation on gen6+ like we do in the FS.<commit_after>\/*\n * Copyright © 2011 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\nextern \"C\" {\n#include \"main\/macros.h\"\n#include \"program\/register_allocate.h\"\n} \/* extern \"C\" *\/\n\n#include \"brw_vec4.h\"\n#include \"glsl\/ir_print_visitor.h\"\n\nusing namespace brw;\n\nnamespace brw {\n\nstatic void\nassign(unsigned int *reg_hw_locations, reg *reg)\n{\n   if (reg->file == GRF) {\n      reg->reg = reg_hw_locations[reg->reg];\n   }\n}\n\nbool\nvec4_visitor::reg_allocate_trivial()\n{\n   unsigned int hw_reg_mapping[this->virtual_grf_count];\n   bool virtual_grf_used[this->virtual_grf_count];\n   int i;\n   int next;\n\n   \/* Calculate which virtual GRFs are actually in use after whatever\n    * optimization passes have occurred.\n    *\/\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      virtual_grf_used[i] = false;\n   }\n\n   foreach_iter(exec_list_iterator, iter, this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)iter.get();\n\n      if (inst->dst.file == GRF)\n\t virtual_grf_used[inst->dst.reg] = true;\n\n      for (int i = 0; i < 3; i++) {\n\t if (inst->src[i].file == GRF)\n\t    virtual_grf_used[inst->src[i].reg] = true;\n      }\n   }\n\n   hw_reg_mapping[0] = this->first_non_payload_grf;\n   next = hw_reg_mapping[0] + this->virtual_grf_sizes[0];\n   for (i = 1; i < this->virtual_grf_count; i++) {\n      if (virtual_grf_used[i]) {\n\t hw_reg_mapping[i] = next;\n\t next += this->virtual_grf_sizes[i];\n      }\n   }\n   prog_data->total_grf = next;\n\n   foreach_iter(exec_list_iterator, iter, this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)iter.get();\n\n      assign(hw_reg_mapping, &inst->dst);\n      assign(hw_reg_mapping, &inst->src[0]);\n      assign(hw_reg_mapping, &inst->src[1]);\n      assign(hw_reg_mapping, &inst->src[2]);\n   }\n\n   if (prog_data->total_grf > max_grf) {\n      fail(\"Ran out of regs on trivial allocator (%d\/%d)\\n\",\n\t   prog_data->total_grf, max_grf);\n      return false;\n   }\n\n   return true;\n}\n\nstatic void\nbrw_alloc_reg_set_for_classes(struct brw_context *brw,\n\t\t\t      int *class_sizes,\n\t\t\t      int class_count,\n\t\t\t      int base_reg_count)\n{\n   struct intel_context *intel = &brw->intel;\n\n   \/* Compute the total number of registers across all classes. *\/\n   int ra_reg_count = 0;\n   for (int i = 0; i < class_count; i++) {\n      ra_reg_count += base_reg_count - (class_sizes[i] - 1);\n   }\n\n   ralloc_free(brw->vs.ra_reg_to_grf);\n   brw->vs.ra_reg_to_grf = ralloc_array(brw, uint8_t, ra_reg_count);\n   ralloc_free(brw->vs.regs);\n   brw->vs.regs = ra_alloc_reg_set(brw, ra_reg_count);\n   if (intel->gen >= 6)\n      ra_set_allocate_round_robin(brw->vs.regs);\n   ralloc_free(brw->vs.classes);\n   brw->vs.classes = ralloc_array(brw, int, class_count + 1);\n\n   \/* Now, add the registers to their classes, and add the conflicts\n    * between them and the base GRF registers (and also each other).\n    *\/\n   int reg = 0;\n   for (int i = 0; i < class_count; i++) {\n      int class_reg_count = base_reg_count - (class_sizes[i] - 1);\n      brw->vs.classes[i] = ra_alloc_reg_class(brw->vs.regs);\n\n      for (int j = 0; j < class_reg_count; j++) {\n\t ra_class_add_reg(brw->vs.regs, brw->vs.classes[i], reg);\n\n\t brw->vs.ra_reg_to_grf[reg] = j;\n\n\t for (int base_reg = j;\n\t      base_reg < j + class_sizes[i];\n\t      base_reg++) {\n\t    ra_add_transitive_reg_conflict(brw->vs.regs, base_reg, reg);\n\t }\n\n\t reg++;\n      }\n   }\n   assert(reg == ra_reg_count);\n\n   ra_set_finalize(brw->vs.regs, NULL);\n}\n\nbool\nvec4_visitor::reg_allocate()\n{\n   unsigned int hw_reg_mapping[virtual_grf_count];\n   int first_assigned_grf = this->first_non_payload_grf;\n   int base_reg_count = max_grf - first_assigned_grf;\n   int class_sizes[base_reg_count];\n   int class_count = 0;\n\n   \/* Using the trivial allocator can be useful in debugging undefined\n    * register access as a result of broken optimization passes.\n    *\/\n   if (0)\n      return reg_allocate_trivial();\n\n   calculate_live_intervals();\n\n   \/* Set up the register classes.\n    *\n    * The base registers store a vec4.  However, we'll need larger\n    * storage for arrays, structures, and matrices, which will be sets\n    * of contiguous registers.\n    *\/\n   class_sizes[class_count++] = 1;\n\n   for (int r = 0; r < virtual_grf_count; r++) {\n      int i;\n\n      for (i = 0; i < class_count; i++) {\n\t if (class_sizes[i] == this->virtual_grf_sizes[r])\n\t    break;\n      }\n      if (i == class_count) {\n\t if (this->virtual_grf_sizes[r] >= base_reg_count) {\n\t    fail(\"Object too large to register allocate.\\n\");\n\t }\n\n\t class_sizes[class_count++] = this->virtual_grf_sizes[r];\n      }\n   }\n\n   brw_alloc_reg_set_for_classes(brw, class_sizes, class_count, base_reg_count);\n\n   struct ra_graph *g = ra_alloc_interference_graph(brw->vs.regs,\n\t\t\t\t\t\t    virtual_grf_count);\n\n   for (int i = 0; i < virtual_grf_count; i++) {\n      for (int c = 0; c < class_count; c++) {\n\t if (class_sizes[c] == this->virtual_grf_sizes[i]) {\n\t    ra_set_node_class(g, i, brw->vs.classes[c]);\n\t    break;\n\t }\n      }\n\n      for (int j = 0; j < i; j++) {\n\t if (virtual_grf_interferes(i, j)) {\n\t    ra_add_node_interference(g, i, j);\n\t }\n      }\n   }\n\n   if (!ra_allocate_no_spills(g)) {\n      \/* Failed to allocate registers.  Spill a reg, and the caller will\n       * loop back into here to try again.\n       *\/\n      int reg = choose_spill_reg(g);\n      if (reg == -1) {\n         fail(\"no register to spill\\n\");\n      } else {\n         spill_reg(reg);\n      }\n      ralloc_free(g);\n      return false;\n   }\n\n   \/* Get the chosen virtual registers for each node, and map virtual\n    * regs in the register classes back down to real hardware reg\n    * numbers.\n    *\/\n   prog_data->total_grf = first_assigned_grf;\n   for (int i = 0; i < virtual_grf_count; i++) {\n      int reg = ra_get_node_reg(g, i);\n\n      hw_reg_mapping[i] = first_assigned_grf + brw->vs.ra_reg_to_grf[reg];\n      prog_data->total_grf = MAX2(prog_data->total_grf,\n\t\t\t\t  hw_reg_mapping[i] + virtual_grf_sizes[i]);\n   }\n\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *)node;\n\n      assign(hw_reg_mapping, &inst->dst);\n      assign(hw_reg_mapping, &inst->src[0]);\n      assign(hw_reg_mapping, &inst->src[1]);\n      assign(hw_reg_mapping, &inst->src[2]);\n   }\n\n   ralloc_free(g);\n\n   return true;\n}\n\nvoid\nvec4_visitor::evaluate_spill_costs(float *spill_costs, bool *no_spill)\n{\n   float loop_scale = 1.0;\n\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      spill_costs[i] = 0.0;\n      no_spill[i] = virtual_grf_sizes[i] != 1;\n   }\n\n   \/* Calculate costs for spilling nodes.  Call it a cost of 1 per\n    * spill\/unspill we'll have to do, and guess that the insides of\n    * loops run 10 times.\n    *\/\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *) node;\n\n      for (unsigned int i = 0; i < 3; i++) {\n\t if (inst->src[i].file == GRF) {\n\t    spill_costs[inst->src[i].reg] += loop_scale;\n            if (inst->src[i].reladdr)\n               no_spill[inst->src[i].reg] = true;\n\t }\n      }\n\n      if (inst->dst.file == GRF) {\n\t spill_costs[inst->dst.reg] += loop_scale;\n         if (inst->dst.reladdr)\n            no_spill[inst->dst.reg] = true;\n      }\n\n      switch (inst->opcode) {\n\n      case BRW_OPCODE_DO:\n\t loop_scale *= 10;\n\t break;\n\n      case BRW_OPCODE_WHILE:\n\t loop_scale \/= 10;\n\t break;\n\n      case VS_OPCODE_SCRATCH_READ:\n      case VS_OPCODE_SCRATCH_WRITE:\n         for (int i = 0; i < 3; i++) {\n            if (inst->src[i].file == GRF)\n               no_spill[inst->src[i].reg] = true;\n         }\n\t if (inst->dst.file == GRF)\n\t    no_spill[inst->dst.reg] = true;\n\t break;\n\n      default:\n\t break;\n      }\n   }\n}\n\nint\nvec4_visitor::choose_spill_reg(struct ra_graph *g)\n{\n   float spill_costs[this->virtual_grf_count];\n   bool no_spill[this->virtual_grf_count];\n\n   evaluate_spill_costs(spill_costs, no_spill);\n\n   for (int i = 0; i < this->virtual_grf_count; i++) {\n      if (!no_spill[i])\n         ra_set_node_spill_cost(g, i, spill_costs[i]);\n   }\n\n   return ra_get_best_spill_node(g);\n}\n\nvoid\nvec4_visitor::spill_reg(int spill_reg_nr)\n{\n   assert(virtual_grf_sizes[spill_reg_nr] == 1);\n   unsigned int spill_offset = c->last_scratch++;\n\n   \/* Generate spill\/unspill instructions for the objects being spilled. *\/\n   foreach_list(node, &this->instructions) {\n      vec4_instruction *inst = (vec4_instruction *) node;\n\n      for (unsigned int i = 0; i < 3; i++) {\n         if (inst->src[i].file == GRF && inst->src[i].reg == spill_reg_nr) {\n            src_reg spill_reg = inst->src[i];\n            inst->src[i].reg = virtual_grf_alloc(1);\n            dst_reg temp = dst_reg(inst->src[i]);\n\n            \/* Only read the necessary channels, to avoid overwriting the rest\n             * with data that may not have been written to scratch.\n             *\/\n            temp.writemask = 0;\n            for (int c = 0; c < 4; c++)\n               temp.writemask |= (1 << BRW_GET_SWZ(inst->src[i].swizzle, c));\n            assert(temp.writemask != 0);\n\n            emit_scratch_read(inst, temp, spill_reg, spill_offset);\n         }\n      }\n\n      if (inst->dst.file == GRF && inst->dst.reg == spill_reg_nr) {\n         emit_scratch_write(inst, spill_offset);\n      }\n   }\n\n   this->live_intervals_valid = false;\n}\n\n} \/* namespace brw *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"mainwindow.h\"\n#include \"ui_mainwindow.h\"\n\nMainWindow::MainWindow(QWidget *parent) :\n    QMainWindow(parent),\n    ui(new Ui::MainWindow)\n{\n    ui->setupUi(this);\n\n    database = QSqlDatabase::addDatabase(\"QMYSQL3\");\n    database.setConnectOptions();\n    database.setHostName(\"localhost\");\n    database.setDatabaseName(\"cs1d\");\n    database.setUserName(\"root\");\n    database.setPassword(\"\");\n\n    if(!database.open())\n    {\n        ui->label_status->setText(\"Failed to connect to the Databse!\");\n    }\n    else\n    {\n        ui->label_status->setText(\"Connected to the Database!\");\n    }\n}\n\nMainWindow::~MainWindow()\n{\n    delete ui;\n}\n\nvoid MainWindow::on_pushButton_login_clicked()\n{\n    QString username;\n    QString password;\n    QSqlQuery qry;\n    int counter;\n\n    \/\/PROC - Assign input data to QStrings\n    username = ui->usernameInputBox->text();\n    password = ui->passwordInputBox->text();\n    counter = 0;\n\n    if(!database.isOpen())\n    {\n        qDebug()<<\"Failed to open the database!\";\n    }\n    else\n    {\n        if(qry.exec(\"Select * from users where username = '\" +username +\"' and password = MD5('\" + password + \"')\"))\n        {\n            \/\/WHILE LOOP - This while loop is designed to go through\n            \/\/             the sql database to try and find the correct\n            \/\/             matching ID and password...and increment the counter\n            \/\/             for basic login correction!\n            while(qry.next())\n            {\n                counter++;\n            }\n\n            \/\/IF-THEN-ELSE STATEMENT - This statement is designed to check\n            \/\/                         for the correct login ID and password.\n            \/\/                         Depending on the condition, a notification\n            \/\/                         will be given out under the status msg!\n            if(counter == 1)\n            {\n                ui->label_status->setText(\"Username and password is correct.\");\n            }\n            else if(counter > 1)\n            {\n                ui->label_status->setText(\"Duplicate username and password.\");\n            }\n            else if(counter < 1)\n            {\n                ui->label_status->setText(\"Username and password is not correct.\");\n            }\n        }\n    }\n\n\n}\n<commit_msg>Updated SQL Syntax<commit_after>#include \"mainwindow.h\"\n#include \"ui_mainwindow.h\"\n\nMainWindow::MainWindow(QWidget *parent) :\n    QMainWindow(parent),\n    ui(new Ui::MainWindow)\n{\n    ui->setupUi(this);\n\n    database = QSqlDatabase::addDatabase(\"QMYSQL3\");\n    database.setConnectOptions();\n    database.setHostName(\"localhost\");\n    database.setDatabaseName(\"cs1d\");\n    database.setUserName(\"root\");\n    database.setPassword(\"\");\n\n    if(!database.open())\n    {\n        ui->label_status->setText(\"Failed to connect to the Databse!\");\n    }\n    else\n    {\n        ui->label_status->setText(\"Connected to the Database!\");\n    }\n}\n\nMainWindow::~MainWindow()\n{\n    delete ui;\n}\n\nvoid MainWindow::on_pushButton_login_clicked()\n{\n    QString username;\n    QString password;\n    QSqlQuery qry;\n    int counter;\n\n    \/\/PROC - Assign input data to QStrings\n    username = ui->usernameInputBox->text();\n    password = ui->passwordInputBox->text();\n    counter = 0;\n\n    if(!database.isOpen())\n    {\n        qDebug()<<\"Failed to open the database!\";\n    }\n    else\n    {\n        if(qry.exec(\"SELECT * FROM users WHERE username = '\" + username +\"' and password = MD5('\" + password + \"')\"))\n        {\n            \/\/WHILE LOOP - This while loop is designed to go through\n            \/\/             the sql database to try and find the correct\n            \/\/             matching ID and password...and increment the counter\n            \/\/             for basic login correction!\n            while(qry.next())\n            {\n                counter++;\n            }\n\n            \/\/IF-THEN-ELSE STATEMENT - This statement is designed to check\n            \/\/                         for the correct login ID and password.\n            \/\/                         Depending on the condition, a notification\n            \/\/                         will be given out under the status msg!\n            if(counter == 1)\n            {\n                ui->label_status->setText(\"Username and password is correct.\");\n            }\n            else if(counter > 1)\n            {\n                ui->label_status->setText(\"Duplicate username and password.\");\n            }\n            else if(counter < 1)\n            {\n                ui->label_status->setText(\"Username and password is not correct.\");\n            }\n        }\n    }\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef BOP_VECTOR_HPP\n#define BOP_VECTOR_HPP\n\n#include <memory>\n#include <initializer_list>\n#include <string>\n#include <sstream>\n#include <new>\n\n\/*\n\tbop::maths::Vector Class file\n*\/\n\nnamespace bop {\n\tnamespace maths {\n\t\ttemplate<class T>\n\t\tclass Vector {\n\t\t\tprotected:\n\t\t\t\tunsigned int width;\n\t\t\t\tint pivot_index;\n\t\t\tpublic:\n\t\t\t\tT* data;\n\t\t\t\t\/\/Constructors\n\t\t\t\tVector(int width, T fill = 0) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tCreates a new vector of a given width, setting each\n\t\t\t\t\t\telement as a given default.\n\t\t\t\t\t\t----pivot index is set as -1.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\tthis->data = new T[width];\n\t\t\t\t\tthis->width = width;\n\t\t\t\t\tfor (unsigned int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] = fill;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector(std::initializer_list<T> list) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tCreates a new Vector from an initializer list.\n\t\t\t\t\t\t----pivot_index is determined during construction.\n\t\t\t\t\t\t----width is determined from size of list.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = list.size();\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\tthis->data = new T[this->width];\n\t\t\t\t\tint i = 0;\n\t\t\t\t\tfor (T elem : list) {\n\t\t\t\t\t\tthis->data[i] = elem;\n\t\t\t\t\t\tif (this->pivot_index < 0 && elem != 0) {\n\t\t\t\t\t\t\tthis->pivot_index = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector(const Vector<T>& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tCreates a new Vector from a Vector, a copy constructor.\n\t\t\t\t\t\t----copies all data from the Vector, incl. deep copy of data array pointer.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = vec.width;\n\t\t\t\t\tthis->pivot_index = vec.pivot_index;\n\t\t\t\t\tthis->data = new T[this->width];\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] = vec.data[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector(Vector<T>&& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMove constructor.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = vec.width;\n\t\t\t\t\tthis->pivot_index = vec.pivot_index;\n\t\t\t\t\tthis->data = vec.data;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector() {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tEmpty constructor.\n\t\t\t\t\t*\/\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Destructor\n\t\t\t\t\n\t\t\t\t~Vector() {\n\t\t\t\t\t\/\/Manual deletion of data array.\n\t\t\t\t\tdelete[] this->data;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Operator Overloads\n\t\t\t\t\n\t\t\t\tinline T& operator[] (const unsigned int index) const {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tIndex operator, returns the data at the given index.\n\t\t\t\t\t\t----synonymous to Vector::data[const unsigned int]\n\t\t\t\t\t*\/\n\t\t\t\t\treturn this->data[index];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator= (const Vector<T>& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tCopy assignment, synonymous to the copy constructor.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = vec.width;\n\t\t\t\t\tthis->pivot_index = vec.pivot_index;\n\t\t\t\t\tthis->data = new T[this->width];\n\t\t\t\t\tfor (unsigned int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] = vec.data[i];\n\t\t\t\t\t}\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator= (std::initializer_list<T> list) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tInitializer list assignment operator, synonymous\n\t\t\t\t\t\twith the constructor that takes the same argument.\n\t\t\t\t\t\t----copied here so the list is not passed by value\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = list.size();\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\tthis->data = new T[this->width];\n\t\t\t\t\tint i = 0;\n\t\t\t\t\tfor (T elem : list) {\n\t\t\t\t\t\tthis->data[i] = elem;\n\t\t\t\t\t\tif (this->pivot_index < 0 && elem != 0) {\n\t\t\t\t\t\t\tthis->pivot_index = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Arithmetic Operator Overloads\n\t\t\t\t\n\t\t\t\tVector<T>& operator*= (const T scalar) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMember multiplication operator, multiplies all\n\t\t\t\t\t\telements in a vector by the given scalar.\n\t\t\t\t\t*\/\n\t\t\t\t\tif (scalar == 0) return *this;\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] *= scalar;\n\t\t\t\t\t}\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator\/= (const T scalar) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMember division operator, divides all \n\t\t\t\t\t\telements in a vector by the given scalar.\n\t\t\t\t\t\t----synonymous with \"vec *= 1\/scalar\"\n\t\t\t\t\t*\/\n\t\t\t\t\tif (scalar == 0) return *this;\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] \/= scalar;\n\t\t\t\t\t}\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator+= (Vector<T>& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMember addition operator, adds the elements of\n\t\t\t\t\t\ta given vector to the corresponding vector to the\n\t\t\t\t\t\tcorresponding elements of a subject vector.\n\t\t\t\t\t\t----sets the pivot as needing to be recalculated.\n\t\t\t\t\t*\/\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] += vec[i];\n\t\t\t\t\t}\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator-= (Vector<T>& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMember subtraction operator, subtracts the elements\n\t\t\t\t\t\tof a given vector from the corresponding elements of \n\t\t\t\t\t\ta subject vector.\n\t\t\t\t\t\t----sets the pivot as needing to be recalculated.\n\t\t\t\t\t*\/\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] -= vec[i];\n\t\t\t\t\t}\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Vector information functions\n\t\t\t\t\n\t\t\t\tint pivot(bool recalc = false) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tReturns the position of the first non-zero element in\n\t\t\t\t\t\tthe vector.\n\t\t\t\t\t*\/\n\t\t\t\t\tif (recalc || this->pivot_index < 0) {\n\t\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\t\tfor (int i = 0; i < this->width && this->pivot_index < 0; i++) {\n\t\t\t\t\t\t\tif (this->data[i] != static_cast<T>(0)) this->pivot_index = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\treturn this->pivot_index;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tconst unsigned int size() const {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tReturns the width of the vector.\n\t\t\t\t\t*\/\n\t\t\t\t\treturn this->width;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tstd::string string(bool brackets = true) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tReturns a string that represents the data in the Vector\n\t\t\t\t\t\tin a human-readable format.\n\t\t\t\t\t*\/\n\t\t\t\t\tstd::ostringstream vec_str;\n\t\t\t\t\tif (brackets) vec_str << \"(\";\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tvec_str << this->data[i];\n\t\t\t\t\t\tif (i + 1 < this->width) vec_str << ',';\n\t\t\t\t\t}\n\t\t\t\t\tif (brackets) vec_str << \")\";\n\t\t\t\t\treturn vec_str.str();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/*\n\t\t\t\t\tCoordinate functions, synonymous with Vector::operator[](0\/1\/2\/3).\n\t\t\t\t\tChecks that those indices exist before returning. \n\t\t\t\t*\/\n\t\t\t\t\n\t\t\t\tinline T& x() {\n\t\t\t\t\tif (this->width > 0) return this->data[0];\n\t\t\t\t\telse return 0;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tinline T& y() {\n\t\t\t\t\tif (this->width > 1) return this->data[1];\n\t\t\t\t\telse return 0;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tinline T& z() {\n\t\t\t\t\tif (this->width > 2) return this->data[2];\n\t\t\t\t\telse return 0;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tinline T& w() {\n\t\t\t\t\tif (this->width > 3) return this->data[3];\n\t\t\t\t\telse return 0;\n\t\t\t\t}\n\t\t};\n\t\t\n\t\t\/*\n\t\t\tExternal arithmetic operators, return a vector separate from\n\t\t\tthe given parameters.\n\t\t*\/\n\t\t\n\t\ttemplate<class T>\n\t\tVector<T> operator* (Vector<T> vec, const T scalar) {\n\t\t\tvec *= scalar;\n\t\t\treturn vec;\n\t\t}\n\t\t\n\t\ttemplate<class T>\n\t\tVector<T> operator\/ (Vector<T> vec, const T scalar) {\n\t\t\tvec \/= scalar;\n\t\t\treturn vec;\n\t\t}\n\t\t\n\t\ttemplate<class T>\n\t\tVector<T> operator+ (Vector<T> vec1, Vector<T>& vec2) {\n\t\t\tvec1 += vec2;\n\t\t\treturn vec1;\n\t\t}\n\t\t\n\t\ttemplate<class T>\n\t\tVector<T> operator- (Vector<T> vec1, Vector<T>& vec2) {\n\t\t\tvec1 -= vec2;\n\t\t\treturn vec1;\n\t\t}\n\t}\n}\n\n#endif<commit_msg>Added boolean comparison operators<commit_after>#ifndef BOP_VECTOR_HPP\n#define BOP_VECTOR_HPP\n\n#include <memory>\n#include <initializer_list>\n#include <string>\n#include <sstream>\n#include <new>\n\n\/*\n\tbop::maths::Vector Class file\n*\/\n\nnamespace bop {\n\tnamespace maths {\n\t\ttemplate<class T>\n\t\tclass Vector {\n\t\t\tprotected:\n\t\t\t\tunsigned int width;\n\t\t\t\tint pivot_index;\n\t\t\tpublic:\n\t\t\t\tT* data;\n\t\t\t\t\/\/Constructors\n\t\t\t\tVector(int width, T fill = 0) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tCreates a new vector of a given width, setting each\n\t\t\t\t\t\telement as a given default.\n\t\t\t\t\t\t----pivot index is set as -1.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\tthis->data = new T[width];\n\t\t\t\t\tthis->width = width;\n\t\t\t\t\tfor (unsigned int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] = fill;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector(std::initializer_list<T> list) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tCreates a new Vector from an initializer list.\n\t\t\t\t\t\t----pivot_index is determined during construction.\n\t\t\t\t\t\t----width is determined from size of list.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = list.size();\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\tthis->data = new T[this->width];\n\t\t\t\t\tint i = 0;\n\t\t\t\t\tfor (T elem : list) {\n\t\t\t\t\t\tthis->data[i] = elem;\n\t\t\t\t\t\tif (this->pivot_index < 0 && elem != 0) {\n\t\t\t\t\t\t\tthis->pivot_index = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector(const Vector<T>& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tCreates a new Vector from a Vector, a copy constructor.\n\t\t\t\t\t\t----copies all data from the Vector, incl. deep copy of data array pointer.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = vec.width;\n\t\t\t\t\tthis->pivot_index = vec.pivot_index;\n\t\t\t\t\tthis->data = new T[this->width];\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] = vec.data[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector(Vector<T>&& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMove constructor.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = vec.width;\n\t\t\t\t\tthis->pivot_index = vec.pivot_index;\n\t\t\t\t\tthis->data = vec.data;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector() {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tEmpty constructor.\n\t\t\t\t\t*\/\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Destructor\n\t\t\t\t\n\t\t\t\t~Vector() {\n\t\t\t\t\t\/\/Manual deletion of data array.\n\t\t\t\t\tdelete[] this->data;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Operator Overloads\n\t\t\t\t\n\t\t\t\tinline T& operator[] (const unsigned int index) const {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tIndex operator, returns the data at the given index.\n\t\t\t\t\t\t----synonymous to Vector::data[const unsigned int]\n\t\t\t\t\t*\/\n\t\t\t\t\treturn this->data[index];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator= (const Vector<T>& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tCopy assignment, synonymous to the copy constructor.\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = vec.width;\n\t\t\t\t\tthis->pivot_index = vec.pivot_index;\n\t\t\t\t\tthis->data = new T[this->width];\n\t\t\t\t\tfor (unsigned int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] = vec.data[i];\n\t\t\t\t\t}\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator= (std::initializer_list<T> list) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tInitializer list assignment operator, synonymous\n\t\t\t\t\t\twith the constructor that takes the same argument.\n\t\t\t\t\t\t----copied here so the list is not passed by value\n\t\t\t\t\t*\/\n\t\t\t\t\tthis->width = list.size();\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\tthis->data = new T[this->width];\n\t\t\t\t\tint i = 0;\n\t\t\t\t\tfor (T elem : list) {\n\t\t\t\t\t\tthis->data[i] = elem;\n\t\t\t\t\t\tif (this->pivot_index < 0 && elem != 0) {\n\t\t\t\t\t\t\tthis->pivot_index = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Boolean Logic overloads\n\t\t\t\t\n\t\t\t\tbool operator== (const Vector<T>& vec) {\n\t\t\t\t\tif (this->width == vec.width) {\n\t\t\t\t\t\t\/\/Non-elegant, but required for testing the Vector.\n\t\t\t\t\t\tbool same = true;\n\t\t\t\t\t\tfor (unsigned int i = 0; i < this->width && same; i++) {\n\t\t\t\t\t\t\tsame = (this->data[i] == vec.data[i]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn same;\n\t\t\t\t\t}\n\t\t\t\t\telse return false;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tbool operator!= (const Vector<T>& vec) {\n\t\t\t\t\treturn !(this->operator==(vec));\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Arithmetic Operator Overloads\n\t\t\t\t\n\t\t\t\tVector<T>& operator*= (const T scalar) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMember multiplication operator, multiplies all\n\t\t\t\t\t\telements in a vector by the given scalar.\n\t\t\t\t\t*\/\n\t\t\t\t\tif (scalar == 0) return *this;\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] *= scalar;\n\t\t\t\t\t}\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator\/= (const T scalar) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMember division operator, divides all \n\t\t\t\t\t\telements in a vector by the given scalar.\n\t\t\t\t\t\t----synonymous with \"vec *= 1\/scalar\"\n\t\t\t\t\t*\/\n\t\t\t\t\tif (scalar == 0) return *this;\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] \/= scalar;\n\t\t\t\t\t}\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator+= (Vector<T>& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMember addition operator, adds the elements of\n\t\t\t\t\t\ta given vector to the corresponding vector to the\n\t\t\t\t\t\tcorresponding elements of a subject vector.\n\t\t\t\t\t\t----sets the pivot as needing to be recalculated.\n\t\t\t\t\t*\/\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] += vec[i];\n\t\t\t\t\t}\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tVector<T>& operator-= (Vector<T>& vec) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tMember subtraction operator, subtracts the elements\n\t\t\t\t\t\tof a given vector from the corresponding elements of \n\t\t\t\t\t\ta subject vector.\n\t\t\t\t\t\t----sets the pivot as needing to be recalculated.\n\t\t\t\t\t*\/\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tthis->data[i] -= vec[i];\n\t\t\t\t\t}\n\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/\/Vector information functions\n\t\t\t\t\n\t\t\t\tint pivot(bool recalc = false) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tReturns the position of the first non-zero element in\n\t\t\t\t\t\tthe vector.\n\t\t\t\t\t*\/\n\t\t\t\t\tif (recalc || this->pivot_index < 0) {\n\t\t\t\t\t\tthis->pivot_index = -1;\n\t\t\t\t\t\tfor (int i = 0; i < this->width && this->pivot_index < 0; i++) {\n\t\t\t\t\t\t\tif (this->data[i] != static_cast<T>(0)) this->pivot_index = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\treturn this->pivot_index;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tconst unsigned int size() const {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tReturns the width of the vector.\n\t\t\t\t\t*\/\n\t\t\t\t\treturn this->width;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tstd::string string(bool brackets = true) {\n\t\t\t\t\t\/*\n\t\t\t\t\t\tReturns a string that represents the data in the Vector\n\t\t\t\t\t\tin a human-readable format.\n\t\t\t\t\t*\/\n\t\t\t\t\tstd::ostringstream vec_str;\n\t\t\t\t\tif (brackets) vec_str << \"(\";\n\t\t\t\t\tfor (int i = 0; i < this->width; i++) {\n\t\t\t\t\t\tvec_str << this->data[i];\n\t\t\t\t\t\tif (i + 1 < this->width) vec_str << ',';\n\t\t\t\t\t}\n\t\t\t\t\tif (brackets) vec_str << \")\";\n\t\t\t\t\treturn vec_str.str();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\/*\n\t\t\t\t\tCoordinate functions, synonymous with Vector::operator[](0\/1\/2\/3).\n\t\t\t\t\tChecks that those indices exist before returning. \n\t\t\t\t*\/\n\t\t\t\t\n\t\t\t\tinline T& x() {\n\t\t\t\t\tif (this->width > 0) return this->data[0];\n\t\t\t\t\telse return 0;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tinline T& y() {\n\t\t\t\t\tif (this->width > 1) return this->data[1];\n\t\t\t\t\telse return 0;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tinline T& z() {\n\t\t\t\t\tif (this->width > 2) return this->data[2];\n\t\t\t\t\telse return 0;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tinline T& w() {\n\t\t\t\t\tif (this->width > 3) return this->data[3];\n\t\t\t\t\telse return 0;\n\t\t\t\t}\n\t\t};\n\t\t\n\t\t\/*\n\t\t\tExternal arithmetic operators, return a vector separate from\n\t\t\tthe given parameters.\n\t\t*\/\n\t\t\n\t\ttemplate<class T>\n\t\tVector<T> operator* (Vector<T> vec, const T scalar) {\n\t\t\tvec *= scalar;\n\t\t\treturn vec;\n\t\t}\n\t\t\n\t\ttemplate<class T>\n\t\tVector<T> operator\/ (Vector<T> vec, const T scalar) {\n\t\t\tvec \/= scalar;\n\t\t\treturn vec;\n\t\t}\n\t\t\n\t\ttemplate<class T>\n\t\tVector<T> operator+ (Vector<T> vec1, Vector<T>& vec2) {\n\t\t\tvec1 += vec2;\n\t\t\treturn vec1;\n\t\t}\n\t\t\n\t\ttemplate<class T>\n\t\tVector<T> operator- (Vector<T> vec1, Vector<T>& vec2) {\n\t\t\tvec1 -= vec2;\n\t\t\treturn vec1;\n\t\t}\n\t}\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: UnoNamespaceMap.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2006-10-12 13:25: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_svx.hxx\"\n\n#include <set>\n\n#include \"UnoNamespaceMap.hxx\"\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n\n#ifndef _COMPHELPER_STLTYPES_HXX_\n#include <comphelper\/stl_types.hxx>\n#endif\n\n#ifndef _SFXITEMPOOL_HXX\n#include <svtools\/itempool.hxx>\n#endif\n\n#ifndef _SVX_UNOAPI_HXX_\n#include \"unoapi.hxx\"\n#endif\n\n#ifndef _SVX_XMLCNITM_HXX\n#include \"xmlcnitm.hxx\"\n#endif\n\n\nusing namespace ::comphelper;\nusing namespace ::osl;\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::drawing;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::beans;\n\nnamespace svx\n{\n    \/** implements a component to export namespaces of all SvXMLAttrContainerItem inside\n        one or two pools with a variable count of which ids.\n    *\/\n    class NamespaceMap : public WeakImplHelper2< XNameAccess, XServiceInfo >\n    {\n    private:\n        sal_uInt16* mpWhichIds;\n        SfxItemPool* mpPool;\n\n    public:\n        NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n        virtual ~NamespaceMap();\n\n        \/\/ XNameAccess\n        virtual Any SAL_CALL getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException);\n        virtual Sequence< OUString > SAL_CALL getElementNames(  ) throw (RuntimeException);\n        virtual sal_Bool SAL_CALL hasByName( const OUString& aName ) throw (RuntimeException);\n\n        \/\/ XElementAccess\n        virtual Type SAL_CALL getElementType(  ) throw (RuntimeException);\n        virtual sal_Bool SAL_CALL hasElements(  ) throw (RuntimeException);\n\n        \/\/ XServiceInfo\n        virtual OUString SAL_CALL getImplementationName(  ) throw(RuntimeException);\n        virtual sal_Bool SAL_CALL supportsService( const OUString& ServiceName ) throw(RuntimeException);\n        virtual Sequence< OUString > SAL_CALL getSupportedServiceNames(  ) throw(RuntimeException);\n    };\n\n    Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool1, SfxItemPool* )\n    {\n        return (XWeak*)new NamespaceMap( pWhichIds, pPool1 );\n    }\n\n    Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n    {\n        return (XWeak*)new NamespaceMap( pWhichIds, pPool );\n    }\n\n    Sequence< OUString > SAL_CALL NamespaceMap_getSupportedServiceNames()\n        throw()\n    {\n        Sequence< OUString > aSupportedServiceNames( 1 );\n        aSupportedServiceNames[0] = OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.xml.NamespaceMap\" ) );\n        return aSupportedServiceNames;\n    }\n\n    OUString SAL_CALL NamespaceMap_getImplementationName()\n        throw()\n    {\n        return OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.Svx.NamespaceMap\" ) );\n    }\n\n\n\n    class NamespaceIteratorImpl\n    {\n    private:\n        SfxItemPool* mpPool;\n\n        sal_uInt16* mpWhichId;\n\n        sal_uInt16 mnItemCount;\n        sal_uInt16 mnItem;\n\n        const SvXMLAttrContainerItem* mpCurrentAttr;\n        sal_uInt16 mnCurrentAttr;\n\n    public:\n\n        NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n\n        sal_Bool next( OUString& rPrefix, OUString& rURL );\n    };\n}\n\nusing namespace ::svx;\n\n\/\/ -------------\n\nNamespaceIteratorImpl::NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n{\n    mpPool = pPool;\n    mpCurrentAttr = NULL;\n    mnCurrentAttr = 0;\n\n    mpWhichId = pWhichIds;\n\n    mnItem = 0;\n    mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n}\n\nsal_Bool NamespaceIteratorImpl::next( OUString& rPrefix, OUString& rURL )\n{\n    \/\/ we still need to process the current attribute\n    if( mpCurrentAttr && (mnCurrentAttr != USHRT_MAX) )\n    {\n        rPrefix = mpCurrentAttr->GetPrefix( mnCurrentAttr );\n        rURL = mpCurrentAttr->GetNamespace( mnCurrentAttr );\n\n        mnCurrentAttr = mpCurrentAttr->GetNextNamespaceIndex( mnCurrentAttr );\n        return sal_True;\n    }\n\n    \/\/ we need the next namespace item\n    mpCurrentAttr = NULL;\n\n    const SfxPoolItem* pItem = 0;\n    \/\/ look for the next available item in the current pool\n    while( (mnItem < mnItemCount) && ( NULL == (pItem = mpPool->GetItem( *mpWhichId, mnItem ) ) ) )\n        mnItem++;\n\n    \/\/ are we finished with the current whichid?\n    if( mnItem == mnItemCount )\n    {\n        mpWhichId++;\n\n        \/\/ are we finished with the current pool?\n        if( 0 != *mpWhichId )\n        {\n            mnItem = 0;\n            mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n            return next( rPrefix, rURL );\n        }\n\n        pItem = NULL;\n    }\n\n    if( pItem )\n    {\n        mnItem++;\n\n        \/\/ get that item and see if there namespaces inside\n        const SvXMLAttrContainerItem *pUnknown = (const SvXMLAttrContainerItem *)pItem;\n        if( (pUnknown->GetAttrCount() > 0) )\n        {\n            mpCurrentAttr = pUnknown;\n            mnCurrentAttr = pUnknown->GetFirstNamespaceIndex();\n        }\n        return next( rPrefix, rURL );\n    }\n\n    return false;\n}\n\n\/\/ -------------\n\nNamespaceMap::NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n: mpWhichIds( pWhichIds ), mpPool( pPool )\n{\n}\n\nNamespaceMap::~NamespaceMap()\n{\n}\n\n\/\/ XNameAccess\nAny SAL_CALL NamespaceMap::getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException)\n{\n    NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n    OUString aPrefix;\n    OUString aURL;\n\n    sal_Bool bFound;\n\n    do\n    {\n        bFound = aIter.next( aPrefix, aURL );\n    }\n    while( bFound && (aPrefix != aName ) );\n\n    if( !bFound )\n        throw NoSuchElementException();\n\n    return makeAny( aURL );\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getElementNames() throw (RuntimeException)\n{\n    NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n    OUString aPrefix;\n    OUString aURL;\n\n    std::set< OUString, comphelper::UStringLess > aPrefixSet;\n\n    while( aIter.next( aPrefix, aURL ) )\n        aPrefixSet.insert( aPrefix );\n\n    Sequence< OUString > aSeq( aPrefixSet.size() );\n    OUString* pPrefixes = aSeq.getArray();\n\n    std::set< OUString, comphelper::UStringLess >::iterator aPrefixIter( aPrefixSet.begin() );\n    const std::set< OUString, comphelper::UStringLess >::iterator aEnd( aPrefixSet.end() );\n\n    while( aPrefixIter != aEnd )\n    {\n        *pPrefixes++ = *aPrefixIter++;\n    }\n\n    return aSeq;\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasByName( const OUString& aName ) throw (RuntimeException)\n{\n    NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n    OUString aPrefix;\n    OUString aURL;\n\n    sal_Bool bFound;\n\n    do\n    {\n        bFound = aIter.next( aPrefix, aURL );\n    }\n    while( bFound && (aPrefix != aName ) );\n\n    return bFound;\n}\n\n\/\/ XElementAccess\nType SAL_CALL NamespaceMap::getElementType() throw (RuntimeException)\n{\n    return ::getCppuType( (const OUString*) 0 );\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasElements() throw (RuntimeException)\n{\n    NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n    OUString aPrefix;\n    OUString aURL;\n\n    return aIter.next( aPrefix, aURL );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL NamespaceMap::getImplementationName(  )\n    throw(RuntimeException)\n{\n    return NamespaceMap_getImplementationName();\n}\n\nsal_Bool SAL_CALL NamespaceMap::supportsService( const OUString& )\n    throw(RuntimeException)\n{\n    return sal_True;\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getSupportedServiceNames(  )\n    throw(RuntimeException)\n{\n    return NamespaceMap_getSupportedServiceNames();\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.7.698); FILE MERGED 2008\/04\/01 15:51:52 thb 1.7.698.3: #i85898# Stripping all external header guards 2008\/04\/01 12:50:14 thb 1.7.698.2: #i85898# Stripping all external header guards 2008\/03\/31 14:24:13 rt 1.7.698.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: UnoNamespaceMap.cxx,v $\n * $Revision: 1.8 $\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#include <set>\n\n#include \"UnoNamespaceMap.hxx\"\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n#include <osl\/diagnose.h>\n#include <osl\/mutex.hxx>\n#include <comphelper\/stl_types.hxx>\n#include <svtools\/itempool.hxx>\n#include \"unoapi.hxx\"\n#include \"xmlcnitm.hxx\"\n\n\nusing namespace ::comphelper;\nusing namespace ::osl;\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::drawing;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::beans;\n\nnamespace svx\n{\n    \/** implements a component to export namespaces of all SvXMLAttrContainerItem inside\n        one or two pools with a variable count of which ids.\n    *\/\n    class NamespaceMap : public WeakImplHelper2< XNameAccess, XServiceInfo >\n    {\n    private:\n        sal_uInt16* mpWhichIds;\n        SfxItemPool* mpPool;\n\n    public:\n        NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n        virtual ~NamespaceMap();\n\n        \/\/ XNameAccess\n        virtual Any SAL_CALL getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException);\n        virtual Sequence< OUString > SAL_CALL getElementNames(  ) throw (RuntimeException);\n        virtual sal_Bool SAL_CALL hasByName( const OUString& aName ) throw (RuntimeException);\n\n        \/\/ XElementAccess\n        virtual Type SAL_CALL getElementType(  ) throw (RuntimeException);\n        virtual sal_Bool SAL_CALL hasElements(  ) throw (RuntimeException);\n\n        \/\/ XServiceInfo\n        virtual OUString SAL_CALL getImplementationName(  ) throw(RuntimeException);\n        virtual sal_Bool SAL_CALL supportsService( const OUString& ServiceName ) throw(RuntimeException);\n        virtual Sequence< OUString > SAL_CALL getSupportedServiceNames(  ) throw(RuntimeException);\n    };\n\n    Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool1, SfxItemPool* )\n    {\n        return (XWeak*)new NamespaceMap( pWhichIds, pPool1 );\n    }\n\n    Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n    {\n        return (XWeak*)new NamespaceMap( pWhichIds, pPool );\n    }\n\n    Sequence< OUString > SAL_CALL NamespaceMap_getSupportedServiceNames()\n        throw()\n    {\n        Sequence< OUString > aSupportedServiceNames( 1 );\n        aSupportedServiceNames[0] = OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.xml.NamespaceMap\" ) );\n        return aSupportedServiceNames;\n    }\n\n    OUString SAL_CALL NamespaceMap_getImplementationName()\n        throw()\n    {\n        return OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.Svx.NamespaceMap\" ) );\n    }\n\n\n\n    class NamespaceIteratorImpl\n    {\n    private:\n        SfxItemPool* mpPool;\n\n        sal_uInt16* mpWhichId;\n\n        sal_uInt16 mnItemCount;\n        sal_uInt16 mnItem;\n\n        const SvXMLAttrContainerItem* mpCurrentAttr;\n        sal_uInt16 mnCurrentAttr;\n\n    public:\n\n        NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n\n        sal_Bool next( OUString& rPrefix, OUString& rURL );\n    };\n}\n\nusing namespace ::svx;\n\n\/\/ -------------\n\nNamespaceIteratorImpl::NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n{\n    mpPool = pPool;\n    mpCurrentAttr = NULL;\n    mnCurrentAttr = 0;\n\n    mpWhichId = pWhichIds;\n\n    mnItem = 0;\n    mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n}\n\nsal_Bool NamespaceIteratorImpl::next( OUString& rPrefix, OUString& rURL )\n{\n    \/\/ we still need to process the current attribute\n    if( mpCurrentAttr && (mnCurrentAttr != USHRT_MAX) )\n    {\n        rPrefix = mpCurrentAttr->GetPrefix( mnCurrentAttr );\n        rURL = mpCurrentAttr->GetNamespace( mnCurrentAttr );\n\n        mnCurrentAttr = mpCurrentAttr->GetNextNamespaceIndex( mnCurrentAttr );\n        return sal_True;\n    }\n\n    \/\/ we need the next namespace item\n    mpCurrentAttr = NULL;\n\n    const SfxPoolItem* pItem = 0;\n    \/\/ look for the next available item in the current pool\n    while( (mnItem < mnItemCount) && ( NULL == (pItem = mpPool->GetItem( *mpWhichId, mnItem ) ) ) )\n        mnItem++;\n\n    \/\/ are we finished with the current whichid?\n    if( mnItem == mnItemCount )\n    {\n        mpWhichId++;\n\n        \/\/ are we finished with the current pool?\n        if( 0 != *mpWhichId )\n        {\n            mnItem = 0;\n            mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n            return next( rPrefix, rURL );\n        }\n\n        pItem = NULL;\n    }\n\n    if( pItem )\n    {\n        mnItem++;\n\n        \/\/ get that item and see if there namespaces inside\n        const SvXMLAttrContainerItem *pUnknown = (const SvXMLAttrContainerItem *)pItem;\n        if( (pUnknown->GetAttrCount() > 0) )\n        {\n            mpCurrentAttr = pUnknown;\n            mnCurrentAttr = pUnknown->GetFirstNamespaceIndex();\n        }\n        return next( rPrefix, rURL );\n    }\n\n    return false;\n}\n\n\/\/ -------------\n\nNamespaceMap::NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n: mpWhichIds( pWhichIds ), mpPool( pPool )\n{\n}\n\nNamespaceMap::~NamespaceMap()\n{\n}\n\n\/\/ XNameAccess\nAny SAL_CALL NamespaceMap::getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException)\n{\n    NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n    OUString aPrefix;\n    OUString aURL;\n\n    sal_Bool bFound;\n\n    do\n    {\n        bFound = aIter.next( aPrefix, aURL );\n    }\n    while( bFound && (aPrefix != aName ) );\n\n    if( !bFound )\n        throw NoSuchElementException();\n\n    return makeAny( aURL );\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getElementNames() throw (RuntimeException)\n{\n    NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n    OUString aPrefix;\n    OUString aURL;\n\n    std::set< OUString, comphelper::UStringLess > aPrefixSet;\n\n    while( aIter.next( aPrefix, aURL ) )\n        aPrefixSet.insert( aPrefix );\n\n    Sequence< OUString > aSeq( aPrefixSet.size() );\n    OUString* pPrefixes = aSeq.getArray();\n\n    std::set< OUString, comphelper::UStringLess >::iterator aPrefixIter( aPrefixSet.begin() );\n    const std::set< OUString, comphelper::UStringLess >::iterator aEnd( aPrefixSet.end() );\n\n    while( aPrefixIter != aEnd )\n    {\n        *pPrefixes++ = *aPrefixIter++;\n    }\n\n    return aSeq;\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasByName( const OUString& aName ) throw (RuntimeException)\n{\n    NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n    OUString aPrefix;\n    OUString aURL;\n\n    sal_Bool bFound;\n\n    do\n    {\n        bFound = aIter.next( aPrefix, aURL );\n    }\n    while( bFound && (aPrefix != aName ) );\n\n    return bFound;\n}\n\n\/\/ XElementAccess\nType SAL_CALL NamespaceMap::getElementType() throw (RuntimeException)\n{\n    return ::getCppuType( (const OUString*) 0 );\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasElements() throw (RuntimeException)\n{\n    NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n    OUString aPrefix;\n    OUString aURL;\n\n    return aIter.next( aPrefix, aURL );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL NamespaceMap::getImplementationName(  )\n    throw(RuntimeException)\n{\n    return NamespaceMap_getImplementationName();\n}\n\nsal_Bool SAL_CALL NamespaceMap::supportsService( const OUString& )\n    throw(RuntimeException)\n{\n    return sal_True;\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getSupportedServiceNames(  )\n    throw(RuntimeException)\n{\n    return NamespaceMap_getSupportedServiceNames();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n\n#include \"sorting.h\"\n#include \"verifysortedarrays.h\"\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortMultipleSizesDouble)\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::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortMultipleSizesInt)\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::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortKnownResultDouble)\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::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortKnownResultInt)\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::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortMultipleSizesRandomDouble)\n{\n    VERIFY_SORTING_RANDOM_ARRAYS(100, double, sorting::efficient::MergeSort, false)\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortMultipleSizesRandomInt)\n{\n    VERIFY_SORTING_RANDOM_ARRAYS(100, int, sorting::efficient::MergeSort, false)\n}\n<commit_msg>Use new macros to test merge sort<commit_after>#include \"gtest\/gtest.h\"\n\n#include \"sorting.h\"\n#include \"verifysortedarrays.h\"\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortMultipleSizesDouble)\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::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortMultipleSizesInt)\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::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortKnownResultDouble)\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::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortKnownResultInt)\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::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortMultipleSizesRandomDouble)\n{\n    VERIFY_SORTING_RANDOM_ARRAYS(100, double, sorting::efficient::MergeSort, false)\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortMultipleSizesRandomInt)\n{\n    VERIFY_SORTING_RANDOM_ARRAYS(100, int, sorting::efficient::MergeSort, false)\n}\n\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortSortedDouble)\n{\n    VERIFY_SORTING_SORTED_ARRAY(100, double, sorting::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortSortedInt)\n{\n    VERIFY_SORTING_SORTED_ARRAY(100, int, sorting::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortInvSortedDouble)\n{\n    VERIFY_SORTING_INV_SORTED_ARRAY(100, double, sorting::efficient::MergeSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(EfficientSorts, MergeSortInvSortedInt)\n{\n    VERIFY_SORTING_INV_SORTED_ARRAY(100, int, sorting::efficient::MergeSort, false);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\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#ifndef RPTUI_GROUPS_SORTING_HXX\n#define RPTUI_GROUPS_SORTING_HXX\n\n#include <vcl\/floatwin.hxx>\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n#include <vcl\/lstbox.hxx>\n#include <vcl\/edit.hxx>\n#include <vcl\/field.hxx>\n#include <vcl\/imagebtn.hxx>\n#include <vcl\/toolbox.hxx>\n#include <com\/sun\/star\/report\/XGroups.hpp>\n#include <com\/sun\/star\/report\/XGroup.hpp>\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include \"GroupProperties.hxx\"\n#include <comphelper\/propmultiplex.hxx>\n#include \"cppuhelper\/basemutex.hxx\"\n#include <svtools\/svmedit.hxx>\n#include <rtl\/ref.hxx>\n\n#include <vector>\n\n#include <dbaccess\/ToolBoxHelper.hxx>\n\n#include <vcl\/ImageListProvider.hxx>\n\nnamespace comphelper\n{\n    class OPropertyChangeMultiplexer;\n}\nnamespace rptui\n{\nclass OFieldExpressionControl;\nclass OReportController;\n\/*************************************************************************\n|*\n|* Groups and Sorting dialog\n|*\n\\************************************************************************\/\n\nclass OGroupsSortingDialog :    public FloatingWindow\n                            ,   public ::cppu::BaseMutex\n                                ,   public ::comphelper::OPropertyChangeListener\n                           ,public dbaui::OToolBoxHelper\n                           ,public vcl::IImageListProvider\n{\n    friend class OFieldExpressionControl;\n\n    FixedLine                               m_aFL2;\n    FixedText                               m_aMove;\n\/\/BTN   ImageButton                             m_aPB_Up;\n\/\/BTN   ImageButton                             m_aPB_Down;\n\/\/BTN   ImageButton                             m_aPB_Delete;\n    ToolBox                                 m_aToolBox;\n\n    FixedLine                               m_aFL3;\n    FixedText                               m_aOrder;\n    ListBox                                 m_aOrderLst;\n    FixedText                               m_aHeader;\n    ListBox                                 m_aHeaderLst;\n    FixedText                               m_aFooter;\n    ListBox                                 m_aFooterLst;\n    FixedText                               m_aGroupOn;\n    ListBox                                 m_aGroupOnLst;\n    FixedText                               m_aGroupInterval;\n    NumericField                            m_aGroupIntervalEd;\n    FixedText                               m_aKeepTogether;\n    ListBox                                 m_aKeepTogetherLst;\n    FixedLine                               m_aFL;\n    FixedText                               m_aHelpWindow;\n\n    OFieldExpressionControl*                m_pFieldExpression;\n    ::rptui::OReportController*             m_pController;\n    ::rtl::Reference< comphelper::OPropertyChangeMultiplexer>                       m_pCurrentGroupListener;\n    ::rtl::Reference< comphelper::OPropertyChangeMultiplexer>                       m_pReportListener;\n    ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroups>            m_xGroups;\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >    m_xColumns;\n    ::com::sun::star::uno::Reference< ::com::sun::star::lang::XComponent >          m_xHoldAlive;\n    sal_Bool                                m_bReadOnly;\nprivate:\n    DECL_LINK( OnControlFocusLost, Control* );\n    DECL_LINK( OnControlFocusGot, Control* );\n    DECL_LINK( LBChangeHdl, ListBox* );\n\/\/BTN   DECL_LINK( ClickHdl, ImageButton* );\n    DECL_LINK( OnFormatAction,      ToolBox* );\n\n    \/** returns the groups\n        @return the groups which now have to check which one changes\n    *\/\n    ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroups>& getGroups() { return m_xGroups; }\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroup> getGroup(sal_Int32 _nPos)\n    {\n        OSL_ENSURE(_nPos >= 0 && _nPos < m_xGroups->getCount(),\"Invalid count!\");\n        return ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroup>(m_xGroups->getByIndex(_nPos),::com::sun::star::uno::UNO_QUERY);\n    }\n\n    \/** updates the listboxes with the new group properties\n        @param  _nRow   the new group pos\n    *\/\n    void DisplayData( sal_Int32 _nRow );\n\n    \/** saves the values from the listboxes into the group at position _nRow\n        @param  _nRow   the group pos to store in\n    *\/\n    void SaveData( sal_Int32 _nRow );\n\n    \/** returns <TRUE\/> when the dialog should be read only\n    *\/\n    sal_Bool isReadOnly( ) const;\n\n    \/** returns the data type for the given column name\n        @param _sColumnName\n    *\/\n    sal_Int32 getColumnDataType(const ::rtl::OUString& _sColumnName);\n\n    \/** shows the text given by the id in the multiline edit\n        @param  _nResId the string id\n    *\/\n    void showHelpText(USHORT _nResId);\n    \/** display the group props\n        @param  _xGroup the group to display\n    *\/\n    void displayGroup(const ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroup>& _xGroup);\n\n    \/** enables or diables the up and down button\n        @param  _nRow   the row which will be active\n    *\/\n    void checkButtons(sal_Int32 _nRow);\n\n    \/** clears the m_xColumns member and reset the fields\n    *\n    *\/\n    void fillColumns();\n    OGroupsSortingDialog(OGroupsSortingDialog&);\n    void operator =(OGroupsSortingDialog&);\nprotected:\n    \/\/ window\n    virtual void    Resize();\n    \/\/ OPropertyChangeListener\n    virtual void    _propertyChanged(const ::com::sun::star::beans::PropertyChangeEvent& _rEvent) throw( ::com::sun::star::uno::RuntimeException);\npublic:\n    OGroupsSortingDialog( Window* pParent\n                        ,sal_Bool _bReadOnly\n                        ,::rptui::OReportController* _pController);\n    virtual ~OGroupsSortingDialog();\n\n    \/** sets the newe columns at the groups dialog.\n        @param  _xColumns the new columns\n    *\/\n    void setColumns(const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >& _xColumns);\n\n    \/* updates the current view\n    *\/\n    void UpdateData( );\n\n        \/** will be called when the controls need to be resized.\n            @param  _rDiff\n                Contains the difference of the old and new toolbox size.\n        *\/\n        virtual void resizeControls(const Size& _rDiff);\n\n        \/** will be called when the image list is needed.\n            @param  _eSymbolsSize\n                <svtools\/imgdef.hxx>\n            @param  _bHiContast\n                <TRUE\/> when in high contrast mode.\n        *\/\n    virtual ImageList getImageList(sal_Int16 _eSymbolsSize,sal_Bool _bHiContast) const;\n\n    \/\/ ImageListProvider interface\n    virtual ImageList getImageList(vcl::ImageListType) SAL_THROW ((com::sun::star::lang::IllegalArgumentException ));\n\n};\n\/\/ =============================================================================\n} \/\/ namespace rptui\n\/\/ =============================================================================\n#endif \/\/ RPTUI_GROUPS_SORTING_HXX\n<commit_msg>CWS gnumake2: merging minibranches<commit_after>\/*************************************************************************\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#ifndef RPTUI_GROUPS_SORTING_HXX\n#define RPTUI_GROUPS_SORTING_HXX\n\n#include <vcl\/floatwin.hxx>\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n#include <vcl\/lstbox.hxx>\n#include <vcl\/edit.hxx>\n#include <vcl\/field.hxx>\n#include <vcl\/button.hxx>\n#include <vcl\/toolbox.hxx>\n#include <com\/sun\/star\/report\/XGroups.hpp>\n#include <com\/sun\/star\/report\/XGroup.hpp>\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include \"GroupProperties.hxx\"\n#include <comphelper\/propmultiplex.hxx>\n#include \"cppuhelper\/basemutex.hxx\"\n#include <svtools\/svmedit.hxx>\n#include <rtl\/ref.hxx>\n\n#include <vector>\n\n#include <dbaccess\/ToolBoxHelper.hxx>\n\n#include <vcl\/ImageListProvider.hxx>\n\nnamespace comphelper\n{\n    class OPropertyChangeMultiplexer;\n}\nnamespace rptui\n{\nclass OFieldExpressionControl;\nclass OReportController;\n\/*************************************************************************\n|*\n|* Groups and Sorting dialog\n|*\n\\************************************************************************\/\n\nclass OGroupsSortingDialog :    public FloatingWindow\n                            ,   public ::cppu::BaseMutex\n                                ,   public ::comphelper::OPropertyChangeListener\n                           ,public dbaui::OToolBoxHelper\n                           ,public vcl::IImageListProvider\n{\n    friend class OFieldExpressionControl;\n\n    FixedLine                               m_aFL2;\n    FixedText                               m_aMove;\n\/\/BTN   ImageButton                             m_aPB_Up;\n\/\/BTN   ImageButton                             m_aPB_Down;\n\/\/BTN   ImageButton                             m_aPB_Delete;\n    ToolBox                                 m_aToolBox;\n\n    FixedLine                               m_aFL3;\n    FixedText                               m_aOrder;\n    ListBox                                 m_aOrderLst;\n    FixedText                               m_aHeader;\n    ListBox                                 m_aHeaderLst;\n    FixedText                               m_aFooter;\n    ListBox                                 m_aFooterLst;\n    FixedText                               m_aGroupOn;\n    ListBox                                 m_aGroupOnLst;\n    FixedText                               m_aGroupInterval;\n    NumericField                            m_aGroupIntervalEd;\n    FixedText                               m_aKeepTogether;\n    ListBox                                 m_aKeepTogetherLst;\n    FixedLine                               m_aFL;\n    FixedText                               m_aHelpWindow;\n\n    OFieldExpressionControl*                m_pFieldExpression;\n    ::rptui::OReportController*             m_pController;\n    ::rtl::Reference< comphelper::OPropertyChangeMultiplexer>                       m_pCurrentGroupListener;\n    ::rtl::Reference< comphelper::OPropertyChangeMultiplexer>                       m_pReportListener;\n    ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroups>            m_xGroups;\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >    m_xColumns;\n    ::com::sun::star::uno::Reference< ::com::sun::star::lang::XComponent >          m_xHoldAlive;\n    sal_Bool                                m_bReadOnly;\nprivate:\n    DECL_LINK( OnControlFocusLost, Control* );\n    DECL_LINK( OnControlFocusGot, Control* );\n    DECL_LINK( LBChangeHdl, ListBox* );\n\/\/BTN   DECL_LINK( ClickHdl, ImageButton* );\n    DECL_LINK( OnFormatAction,      ToolBox* );\n\n    \/** returns the groups\n        @return the groups which now have to check which one changes\n    *\/\n    ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroups>& getGroups() { return m_xGroups; }\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroup> getGroup(sal_Int32 _nPos)\n    {\n        OSL_ENSURE(_nPos >= 0 && _nPos < m_xGroups->getCount(),\"Invalid count!\");\n        return ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroup>(m_xGroups->getByIndex(_nPos),::com::sun::star::uno::UNO_QUERY);\n    }\n\n    \/** updates the listboxes with the new group properties\n        @param  _nRow   the new group pos\n    *\/\n    void DisplayData( sal_Int32 _nRow );\n\n    \/** saves the values from the listboxes into the group at position _nRow\n        @param  _nRow   the group pos to store in\n    *\/\n    void SaveData( sal_Int32 _nRow );\n\n    \/** returns <TRUE\/> when the dialog should be read only\n    *\/\n    sal_Bool isReadOnly( ) const;\n\n    \/** returns the data type for the given column name\n        @param _sColumnName\n    *\/\n    sal_Int32 getColumnDataType(const ::rtl::OUString& _sColumnName);\n\n    \/** shows the text given by the id in the multiline edit\n        @param  _nResId the string id\n    *\/\n    void showHelpText(USHORT _nResId);\n    \/** display the group props\n        @param  _xGroup the group to display\n    *\/\n    void displayGroup(const ::com::sun::star::uno::Reference< ::com::sun::star::report::XGroup>& _xGroup);\n\n    \/** enables or diables the up and down button\n        @param  _nRow   the row which will be active\n    *\/\n    void checkButtons(sal_Int32 _nRow);\n\n    \/** clears the m_xColumns member and reset the fields\n    *\n    *\/\n    void fillColumns();\n    OGroupsSortingDialog(OGroupsSortingDialog&);\n    void operator =(OGroupsSortingDialog&);\nprotected:\n    \/\/ window\n    virtual void    Resize();\n    \/\/ OPropertyChangeListener\n    virtual void    _propertyChanged(const ::com::sun::star::beans::PropertyChangeEvent& _rEvent) throw( ::com::sun::star::uno::RuntimeException);\npublic:\n    OGroupsSortingDialog( Window* pParent\n                        ,sal_Bool _bReadOnly\n                        ,::rptui::OReportController* _pController);\n    virtual ~OGroupsSortingDialog();\n\n    \/** sets the newe columns at the groups dialog.\n        @param  _xColumns the new columns\n    *\/\n    void setColumns(const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >& _xColumns);\n\n    \/* updates the current view\n    *\/\n    void UpdateData( );\n\n        \/** will be called when the controls need to be resized.\n            @param  _rDiff\n                Contains the difference of the old and new toolbox size.\n        *\/\n        virtual void resizeControls(const Size& _rDiff);\n\n        \/** will be called when the image list is needed.\n            @param  _eSymbolsSize\n                <svtools\/imgdef.hxx>\n            @param  _bHiContast\n                <TRUE\/> when in high contrast mode.\n        *\/\n    virtual ImageList getImageList(sal_Int16 _eSymbolsSize,sal_Bool _bHiContast) const;\n\n    \/\/ ImageListProvider interface\n    virtual ImageList getImageList(vcl::ImageListType) SAL_THROW ((com::sun::star::lang::IllegalArgumentException ));\n\n};\n\/\/ =============================================================================\n} \/\/ namespace rptui\n\/\/ =============================================================================\n#endif \/\/ RPTUI_GROUPS_SORTING_HXX\n<|endoftext|>"}
{"text":"<commit_before>#include <Core\/Asset\/Camera.hpp>\n#include <Engine\/Scene\/CameraComponent.hpp>\n\n#include <Core\/Containers\/MakeShared.hpp>\n#include <Core\/Math\/Math.hpp>\n\nnamespace Ra {\n\nusing Core::Math::Pi;\nusing Core::Math::PiDiv2;\nusing Core::Math::PiDiv4;\n\nnamespace Core {\n\nnamespace Asset {\n\nCamera::Camera( Scalar width, Scalar height ) :\n    m_width {width}, m_height {height}, m_aspect {width \/ height} {}\n\nCamera& Camera::operator=( const Camera& rhs ) {\n    m_frame      = rhs.getFrame();\n    m_projMatrix = rhs.getProjMatrix();\n    m_projType   = rhs.getType();\n    m_zoomFactor = rhs.getZoomFactor();\n    m_fov        = rhs.getFOV();\n    m_zNear      = rhs.getZNear();\n    m_zFar       = rhs.getZFar();\n    setViewport( rhs.getWidth(), rhs.getHeight() );\n    return *this;\n}\n\nvoid Camera::setDirection( const Core::Vector3& direction ) {\n    Core::Transform T = Core::Transform::Identity();\n\n    auto d0 = getDirection();\n    auto d1 = direction.normalized();\n\n    auto c = d0.cross( d1 );\n    auto d = d0.dot( d1 );\n\n    \/\/ Special case if two directions are exactly opposites we constrain.\n    \/\/ to rotate around the up vector.\n    if ( c.isApprox( Core::Vector3::Zero() ) && d < 0.0 )\n    { T.rotate( Core::AngleAxis( Core::Math::PiDiv2, Core::Vector3::UnitY() ) ); }\n    else\n    { T.rotate( Core::Quaternion::FromTwoVectors( d0, d1 ) ); }\n    applyTransform( T );\n}\n\nvoid Camera::setViewport( Scalar width, Scalar height ) {\n    m_width  = width;\n    m_height = height;\n    m_aspect = width \/ height;\n    updateProjMatrix();\n}\n\nvoid Camera::applyTransform( const Core::Transform& T ) {\n    Core::Transform t1 = Core::Transform::Identity();\n    Core::Transform t2 = Core::Transform::Identity();\n    t1.translation()   = -getPosition();\n    t2.translation()   = getPosition();\n\n    m_frame = t2 * T * t1 * m_frame;\n}\n\nvoid Camera::updateProjMatrix() {\n\n    switch ( m_projType )\n    {\n    case ProjType::ORTHOGRAPHIC: {\n        const Scalar dx = m_zoomFactor * .5_ra;\n        const Scalar dy = dx \/ m_aspect;\n        \/\/ ------------\n        \/\/ Compute projection matrix as describe in the doc of glOrtho()\n        const Scalar l = -dx; \/\/ left\n        const Scalar r = dx;  \/\/ right\n        const Scalar t = dy;  \/\/ top\n        const Scalar b = -dy; \/\/ bottom\n        m_projMatrix   = ortho( b, t, l, r, m_zNear, m_zFar );\n    }\n    break;\n\n    case ProjType::PERSPECTIVE: {\n        \/\/ Compute projection matrix as describe here\n        \/\/ https:\/\/www.scratchapixel.com\/lessons\/3d-basic-rendering\/perspective-and-orthographic-projection-matrix\/opengl-perspective-projection-matrix\n        auto scale = std::tan( m_fov * .5_ra ) * m_zNear;\n\n        auto r = scale;\n        auto l = -r;\n        auto t = scale \/ m_aspect;\n        auto b = -t;\n\n        m_projMatrix = frustum( b, t, l, r, m_zNear, m_zFar );\n    }\n    break;\n\n    default:\n        break;\n    }\n}\n\nCore::Matrix4 Camera::frustum( Scalar b, Scalar t, Scalar l, Scalar r, Scalar n, Scalar f ) {\n    Core::Matrix4 projMatrix;\n    projMatrix.setZero();\n    const Scalar diff           = ( n - f );\n    projMatrix.coeffRef( 0, 0 ) = 2_ra * n \/ ( r - l );\n    projMatrix.coeffRef( 1, 1 ) = 2_ra * n \/ ( t - b );\n    projMatrix.coeffRef( 2, 2 ) = ( f + n ) \/ diff;\n    projMatrix.coeffRef( 2, 3 ) = ( 2_ra * f * n ) \/ diff;\n    projMatrix.coeffRef( 3, 2 ) = -1_ra;\n    return projMatrix;\n}\n\nCore::Matrix4 Camera::ortho( Scalar b, Scalar t, Scalar l, Scalar r, Scalar n, Scalar f ) {\n    Core::Matrix4 projMatrix;\n    projMatrix.setZero();\n\n    Core::Vector3 tr( -( r + l ) \/ ( r - l ), -( t + b ) \/ ( t - b ), -( ( f + n ) \/ ( f - n ) ) );\n\n    projMatrix.setIdentity();\n    projMatrix.coeffRef( 0, 0 )    = 2_ra \/ ( r - l );\n    projMatrix.coeffRef( 1, 1 )    = 2_ra \/ ( t - b );\n    projMatrix.coeffRef( 2, 2 )    = -2_ra \/ ( f - n );\n    projMatrix.block<3, 1>( 0, 3 ) = tr;\n\n    return projMatrix;\n}\n\nvoid Camera::fitZRange( const Core::Aabb& aabb ) {\n    const auto& position        = getPosition();\n    Ra::Core::Vector3 direction = getDirection();\n\n    const auto& minAabb = aabb.min();\n    const auto& maxAabb = aabb.max();\n    m_zNear = m_zFar = direction.dot( minAabb - position );\n\n    auto adaptRange = [position, direction, this]( Scalar x, Scalar y, Scalar z ) {\n        Ra::Core::Vector3 corner( x, y, z );\n        auto d        = direction.dot( corner - position );\n        this->m_zNear = std::min( d, this->m_zNear );\n        this->m_zFar  = std::max( d, this->m_zFar );\n    };\n\n    adaptRange( minAabb[0], minAabb[1], maxAabb[2] );\n    adaptRange( minAabb[0], maxAabb[1], minAabb[2] );\n    adaptRange( minAabb[0], maxAabb[1], maxAabb[2] );\n    adaptRange( maxAabb[0], maxAabb[1], maxAabb[2] );\n    adaptRange( maxAabb[0], maxAabb[1], minAabb[2] );\n    adaptRange( maxAabb[0], minAabb[1], maxAabb[2] );\n    adaptRange( maxAabb[0], minAabb[1], minAabb[2] );\n\n    if ( m_zNear < m_minZNear ) { m_zNear = m_minZNear; }\n    if ( ( m_zFar - m_zNear ) < m_minZRange ) { m_zFar = m_zNear + m_minZRange; }\n\n    updateProjMatrix();\n}\n\nCore::Ray Camera::getRayFromScreen( const Core::Vector2& pix ) const {\n    \/\/ Ray starts from the camera's current position.\n    return Core::Ray::Through( getPosition(), unProject( pix ) );\n}\n\n} \/\/ namespace Asset\n} \/\/ namespace Core\n} \/\/ namespace Ra\n<commit_msg>[core] fix frustum.<commit_after>#include <Core\/Asset\/Camera.hpp>\n#include <Engine\/Scene\/CameraComponent.hpp>\n\n#include <Core\/Containers\/MakeShared.hpp>\n#include <Core\/Math\/Math.hpp>\n\nnamespace Ra {\n\nusing Core::Math::Pi;\nusing Core::Math::PiDiv2;\nusing Core::Math::PiDiv4;\n\nnamespace Core {\n\nnamespace Asset {\n\nCamera::Camera( Scalar width, Scalar height ) :\n    m_width {width}, m_height {height}, m_aspect {width \/ height} {}\n\nCamera& Camera::operator=( const Camera& rhs ) {\n    m_frame      = rhs.getFrame();\n    m_projMatrix = rhs.getProjMatrix();\n    m_projType   = rhs.getType();\n    m_zoomFactor = rhs.getZoomFactor();\n    m_fov        = rhs.getFOV();\n    m_zNear      = rhs.getZNear();\n    m_zFar       = rhs.getZFar();\n    setViewport( rhs.getWidth(), rhs.getHeight() );\n    return *this;\n}\n\nvoid Camera::setDirection( const Core::Vector3& direction ) {\n    Core::Transform T = Core::Transform::Identity();\n\n    auto d0 = getDirection();\n    auto d1 = direction.normalized();\n\n    auto c = d0.cross( d1 );\n    auto d = d0.dot( d1 );\n\n    \/\/ Special case if two directions are exactly opposites we constrain.\n    \/\/ to rotate around the up vector.\n    if ( c.isApprox( Core::Vector3::Zero() ) && d < 0.0 )\n    { T.rotate( Core::AngleAxis( Core::Math::PiDiv2, Core::Vector3::UnitY() ) ); }\n    else\n    { T.rotate( Core::Quaternion::FromTwoVectors( d0, d1 ) ); }\n    applyTransform( T );\n}\n\nvoid Camera::setViewport( Scalar width, Scalar height ) {\n    m_width  = width;\n    m_height = height;\n    m_aspect = width \/ height;\n    updateProjMatrix();\n}\n\nvoid Camera::applyTransform( const Core::Transform& T ) {\n    Core::Transform t1 = Core::Transform::Identity();\n    Core::Transform t2 = Core::Transform::Identity();\n    t1.translation()   = -getPosition();\n    t2.translation()   = getPosition();\n\n    m_frame = t2 * T * t1 * m_frame;\n}\n\nvoid Camera::updateProjMatrix() {\n\n    switch ( m_projType )\n    {\n    case ProjType::ORTHOGRAPHIC: {\n        const Scalar dx = m_zoomFactor * .5_ra;\n        const Scalar dy = dx \/ m_aspect;\n        \/\/ ------------\n        \/\/ Compute projection matrix as describe in the doc of glOrtho()\n        const Scalar l = -dx; \/\/ left\n        const Scalar r = dx;  \/\/ right\n        const Scalar t = dy;  \/\/ top\n        const Scalar b = -dy; \/\/ bottom\n        m_projMatrix   = ortho( b, t, l, r, m_zNear, m_zFar );\n    }\n    break;\n\n    case ProjType::PERSPECTIVE: {\n        \/\/ Compute projection matrix as describe here\n        \/\/ https:\/\/www.scratchapixel.com\/lessons\/3d-basic-rendering\/perspective-and-orthographic-projection-matrix\/opengl-perspective-projection-matrix\n        auto scale = std::tan( m_fov * .5_ra ) * m_zNear;\n\n        auto r = scale;\n        auto l = -r;\n        auto t = scale \/ m_aspect;\n        auto b = -t;\n\n        m_projMatrix = frustum( b, t, l, r, m_zNear, m_zFar );\n    }\n    break;\n\n    default:\n        break;\n    }\n}\n\nCore::Matrix4 Camera::frustum( Scalar b, Scalar t, Scalar l, Scalar r, Scalar n, Scalar f ) {\n    Core::Matrix4 projMatrix;\n    projMatrix.setZero();\n    projMatrix.coeffRef( 0, 0 ) = 2_ra * n \/ ( r - l );\n    projMatrix.coeffRef( 1, 1 ) = 2_ra * n \/ ( t - b );\n\n    \/\/\/ (row, col)\n    projMatrix.coeffRef( 0, 2 ) = ( r + l ) \/ ( r - l );\n    projMatrix.coeffRef( 1, 2 ) = ( t + b ) \/ ( t - b );\n    projMatrix.coeffRef( 2, 2 ) = -( f + n ) \/ ( f - n );\n    projMatrix.coeffRef( 3, 2 ) = -1_ra;\n\n    projMatrix.coeffRef( 2, 3 ) = -( 2_ra * f * n ) \/ ( f - n );\n\n    return projMatrix;\n}\n\nCore::Matrix4 Camera::ortho( Scalar b, Scalar t, Scalar l, Scalar r, Scalar n, Scalar f ) {\n    Core::Matrix4 projMatrix;\n    projMatrix.setZero();\n\n    Core::Vector3 tr( -( r + l ) \/ ( r - l ), -( t + b ) \/ ( t - b ), -( ( f + n ) \/ ( f - n ) ) );\n\n    projMatrix.setIdentity();\n    projMatrix.coeffRef( 0, 0 )    = 2_ra \/ ( r - l );\n    projMatrix.coeffRef( 1, 1 )    = 2_ra \/ ( t - b );\n    projMatrix.coeffRef( 2, 2 )    = -2_ra \/ ( f - n );\n    projMatrix.block<3, 1>( 0, 3 ) = tr;\n\n    return projMatrix;\n}\n\nvoid Camera::fitZRange( const Core::Aabb& aabb ) {\n    const auto& position        = getPosition();\n    Ra::Core::Vector3 direction = getDirection();\n\n    const auto& minAabb = aabb.min();\n    const auto& maxAabb = aabb.max();\n    m_zNear = m_zFar = direction.dot( minAabb - position );\n\n    auto adaptRange = [position, direction, this]( Scalar x, Scalar y, Scalar z ) {\n        Ra::Core::Vector3 corner( x, y, z );\n        auto d        = direction.dot( corner - position );\n        this->m_zNear = std::min( d, this->m_zNear );\n        this->m_zFar  = std::max( d, this->m_zFar );\n    };\n\n    adaptRange( minAabb[0], minAabb[1], maxAabb[2] );\n    adaptRange( minAabb[0], maxAabb[1], minAabb[2] );\n    adaptRange( minAabb[0], maxAabb[1], maxAabb[2] );\n    adaptRange( maxAabb[0], maxAabb[1], maxAabb[2] );\n    adaptRange( maxAabb[0], maxAabb[1], minAabb[2] );\n    adaptRange( maxAabb[0], minAabb[1], maxAabb[2] );\n    adaptRange( maxAabb[0], minAabb[1], minAabb[2] );\n\n    if ( m_zNear < m_minZNear ) { m_zNear = m_minZNear; }\n    if ( ( m_zFar - m_zNear ) < m_minZRange ) { m_zFar = m_zNear + m_minZRange; }\n\n    updateProjMatrix();\n}\n\nCore::Ray Camera::getRayFromScreen( const Core::Vector2& pix ) const {\n    \/\/ Ray starts from the camera's current position.\n    return Core::Ray::Through( getPosition(), unProject( pix ) );\n}\n\n} \/\/ namespace Asset\n} \/\/ namespace Core\n} \/\/ namespace Ra\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __BSE_BLOCK_UTILS_H__\n#define __BSE_BLOCK_UTILS_H__\n#include <wchar.h> \/* wmemset *\/\n#include <bse\/bseieee754.hh>\n\n\ntemplate<class TYPE> inline\nvoid    bse_block_fill_0                          (size_t        n_values,        \/* 4-byte variant of memset *\/\n                                                   TYPE         *values);\n\/* --- C API --- *\/\nconst\nchar*   bse_block_impl_name                       (void);\nstatic inline\nvoid    bse_block_fill_uint32                     (guint          n_values,       \/* 4-byte variant of memset for ints *\/\n                                                   guint32       *values,\n                                                   guint32        vuint32);\nstatic inline\nvoid    bse_block_fill_float                      (uint\t          n_values,       \/* 4-byte variant of memset for floats *\/\n                                                   float         *values,\n                                                   const float    value);\nstatic inline\nvoid    bse_block_copy_uint32                     (guint\t  n_values,       \/* 4-byte variant of memcpy for ints *\/\n                                                   guint32       *values,\n                                                   const guint32 *ivalues);\nstatic inline\nvoid    bse_block_copy_float                      (guint\t  n_values,       \/* 4-byte variant of memcpy for floats *\/\n                                                   gfloat        *values,\n                                                   const gfloat  *ivalues);\nvoid    bse_block_add_floats                      (guint\t  n_values,\n                                                   float         *ovalues,\n                                                   const float   *ivalues);\nvoid    bse_block_sub_floats                      (guint\t  n_values,\n                                                   float         *ovalues,\n                                                   const float   *ivalues);\nvoid    bse_block_mul_floats                      (guint\t  n_values,\n                                                   float         *ovalues,\n                                                   const float   *ivalues);\nvoid    bse_block_scale_floats                    (guint          n_values,\n                                                   float         *ovalues,\n                                                   const float   *ivalues,\n                                                   const float    level);\nvoid    bse_block_interleave2_floats              (guint\t  n_ivalues,\n                                                   float         *ovalues,        \/* length_ovalues = n_ivalues * 2 *\/\n                                                   const float   *ivalues,\n                                                   guint          offset);        \/* 0=left, 1=right *\/\nvoid    bse_block_interleave2_add_floats          (guint\t  n_ivalues,\n                                                   float         *ovalues,        \/* length_ovalues = n_ivalues * 2 *\/\n                                                   const float   *ivalues,\n                                                   guint          offset);        \/* 0=left, 1=right *\/\nvoid    bse_block_calc_float_range                (guint          n_values,\n                                                   const float   *ivalues,\n\t                                           float         *min_value,\n\t                                           float         *max_value);\nfloat   bse_block_calc_float_square_sum           (guint          n_values,\n                                                   const float   *ivalues);\nfloat   bse_block_calc_float_range_and_square_sum (guint          n_values,\n                                                   const float   *ivalues,\n\t                                           float         *min_value,\n\t                                           float         *max_value);\n\n#ifdef  __cplusplus\n#include <bse\/bseresampler.hh>\nnamespace Bse {\n\n\/* --- C++ API --- *\/\nclass Block {\npublic:\n  static const char*    impl_name            ()                              { return singleton->impl_name (); }\n  static inline   void\tfill                 (guint           n_values,\n\t\t\t\t\t      float          *values,\n\t\t\t\t\t      float           value);\n  static inline   void\tfill                 (guint           n_values,\n\t\t\t\t\t      guint32        *values,\n\t\t\t\t\t      guint32         value);\n  static inline   void\tcopy                 (guint           n_values,\n\t\t\t\t\t      float          *values,\n\t\t\t\t\t      const float    *ivalues);\n  static inline   void\tcopy                 (guint           n_values,\n\t\t\t\t\t      guint32        *values,\n\t\t\t\t\t      const guint32  *ivalues);\n  static inline   void\tadd                  (guint\t      n_values,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues)       { singleton->add (n_values, ovalues, ivalues); }\n  static inline   void\tsub                  (guint\t      n_values,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues)       { singleton->sub (n_values, ovalues, ivalues); }\n  static inline   void\tmul                  (guint\t      n_values,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues)       { singleton->mul (n_values, ovalues, ivalues); }\n  static inline   void\tscale                (guint\t      n_values,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues,\n\t\t\t\t\t      const float     level)         { singleton->scale (n_values, ovalues, ivalues, level); }\n  static inline   void\tinterleave2          (guint\t      n_ivalues,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues,\n\t\t\t\t\t      guint           offset)        { singleton->interleave2 (n_ivalues, ovalues, ivalues, offset); }\n  static inline   void\tinterleave2_add      (guint\t      n_ivalues,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues,\n\t\t\t\t\t      guint           offset)        { singleton->interleave2_add (n_ivalues, ovalues, ivalues, offset); }\n  static inline   void\trange    \t     (guint\t      n_values,\n\t\t\t\t\t      const float    *ivalues,\n\t\t\t\t\t      float&          min_value,\n\t\t\t\t\t      float&          max_value)     { singleton->range (n_values, ivalues, min_value, max_value); }\n  static inline   float\tsquare_sum           (guint\t      n_values,\n\t\t\t\t\t      const float    *ivalues)       { return singleton->square_sum (n_values, ivalues); }\n  static inline   float\trange_and_square_sum (guint\t      n_values,\n                                              const float    *ivalues,\n\t\t\t\t\t      float&          min_value,\n\t\t\t\t\t      float&          max_value)     { return singleton->range_and_square_sum (n_values, ivalues, min_value, max_value); }\n\n  typedef Resampler::Resampler2 Resampler2;\n  static inline\n  Resampler2*           create_resampler2    (BseResampler2Mode      mode,\n                                              BseResampler2Precision precision)\t  { return singleton->create_resampler2 (mode, precision); }\n  static inline\n  bool                  test_resampler2\t     (bool                   verbose)\t  { return singleton->test_resampler2 (verbose); }\n\n\n\n  class Impl {\n  protected:\n    virtual      ~Impl                  ();\n    virtual const char* impl_name       () = 0;\n    virtual void  add                   (guint\t         n_values,\n                                         float          *ovalues,\n                                         const float    *ivalues) = 0;\n    virtual void  sub                   (guint\t         n_values,\n                                         float          *ovalues,\n                                         const float    *ivalues) = 0;\n    virtual void  mul                   (guint\t         n_values,\n                                         float          *ovalues,\n                                         const float    *ivalues) = 0;\n    virtual void  scale                 (guint           n_values,\n                                         float          *ovalues,\n                                         const float    *ivalues,\n                                         const float     level) = 0;\n    virtual void  interleave2           (guint\t         n_ivalues,\n                                         float          *ovalues,\t\/* length_ovalues = n_ivalues * 2 *\/\n                                         const float    *ivalues,\n                                         guint           offset) = 0;   \/* 0=left, 1=right *\/\n    virtual void  interleave2_add       (guint\t         n_ivalues,\n                                         float          *ovalues,\t\/* length_ovalues = n_ivalues * 2 *\/\n                                         const float    *ivalues,\n                                         guint           offset) = 0;   \/* 0=left, 1=right *\/\n    virtual void  range                 (guint\t         n_values,\n                                         const float    *ivalues,\n\t\t\t\t\t float&          min_value,\n\t\t\t\t\t float&          max_value) = 0;\n    virtual float square_sum            (guint\t         n_values,\n                                         const float    *ivalues) = 0;\n    virtual float range_and_square_sum\t(guint\t         n_values,\n                                         const float    *ivalues,\n\t\t\t\t\t float&          min_value,\n\t\t\t\t\t float&          max_value) = 0;\n    virtual\n    Resampler2*   create_resampler2     (BseResampler2Mode      mode,\n                                         BseResampler2Precision precision) = 0;\n    virtual bool  test_resampler2\t(bool\t\t\tverbose) = 0;\n  friend class Block;\n    static  void  substitute            (Impl           *substitute_impl);\n  };\n  static Impl*  default_singleton       ();\n  static Impl*  current_singleton       ();\nprivate:\n  static Impl  *singleton;\n};\n\n\/* --- C++ implementation bits --- *\/\ninline void\nBlock::fill (guint           n_values,\n             float          *values,\n             float           value)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (float) == 4);\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  const union { float f; guint32 vuint32; } u = { value };\n  wmemset ((wchar_t*) values, u.vuint32, n_values);\n}\n\ninline void\nBlock::fill (guint           n_values,\n             guint32        *values,\n             guint32         value)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemset ((wchar_t*) values, value, n_values);\n}\n\ninline void\nBlock::copy (guint          n_values,\n             guint32       *values,\n             const guint32 *ivalues)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemcpy ((wchar_t*) values, (const wchar_t*) ivalues, n_values);\n}\n\ninline void\nBlock::copy (guint         n_values,\n             gfloat       *values,\n             const gfloat *ivalues)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (float) == 4);\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemcpy ((wchar_t*) values, (const wchar_t*) ivalues, n_values);\n}\n\n} \/\/ Bse\n#endif  \/* __cplusplus *\/\n\n\/* --- C implementation bits --- *\/\nstatic inline void\nbse_block_fill_uint32 (guint    n_values,\n\t\t       guint32 *values,\n\t\t       guint32  vuint32)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemset ((wchar_t*) values, vuint32, n_values);\n}\n\nstatic inline void\nbse_block_fill_float (guint\t   n_values,\n\t\t      float       *values,\n\t\t      const float  value)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (float) == 4);\n  const union { float f; guint32 vuint32; } u = { value };\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemset ((wchar_t*) values, u.vuint32, n_values);\n}\n\nstatic inline void\nbse_block_copy_uint32 (guint\t      n_values,\n\t\t       guint32       *values,\n\t\t       const guint32 *ivalues)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemcpy ((wchar_t*) values, (const wchar_t*) ivalues, n_values);\n}\n\nstatic inline void\nbse_block_copy_float (guint\t    n_values,\n\t\t      gfloat       *values,\n\t\t      const gfloat *ivalues)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (float) == 4);\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemcpy ((wchar_t*) values, (const wchar_t*) ivalues, n_values);\n}\n\/\/ == C++ Implementations ==\ntemplate<class TYPE> inline void\nbse_block_fill_0 (size_t n_values, TYPE *values)\n{\n  size_t n_bytes = n_values * sizeof (TYPE);\n  char *p = (char*) values;\n  uint r = size_t (p) & 3;\n  if (RAPICORN_UNLIKELY (r))\n    {\n      r = MIN (r, n_values);    \/\/ rest for pointer alignment\n      memset (p, 0, r);\n      p += r;\n      n_bytes -= r;\n    }\n  const size_t n_aligned = n_bytes \/ 4;\n  wmemset ((wchar_t*) p, 0, n_aligned);\n  n_bytes -= n_aligned * 4;\n  if (RAPICORN_UNLIKELY (n_bytes))\n    {\n      p += n_aligned * 4;\n      memset (p, 0, n_bytes);\n    }\n}\n\n#endif \/* __BSE_BLOCK_UTILS_H__ *\/\n<commit_msg>BSE: use BSE_UNLIKELY instead of a Rapicorn macro<commit_after>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __BSE_BLOCK_UTILS_H__\n#define __BSE_BLOCK_UTILS_H__\n#include <wchar.h> \/* wmemset *\/\n#include <bse\/bseieee754.hh>\n\n\ntemplate<class TYPE> inline\nvoid    bse_block_fill_0                          (size_t        n_values,        \/* 4-byte variant of memset *\/\n                                                   TYPE         *values);\n\/* --- C API --- *\/\nconst\nchar*   bse_block_impl_name                       (void);\nstatic inline\nvoid    bse_block_fill_uint32                     (guint          n_values,       \/* 4-byte variant of memset for ints *\/\n                                                   guint32       *values,\n                                                   guint32        vuint32);\nstatic inline\nvoid    bse_block_fill_float                      (uint\t          n_values,       \/* 4-byte variant of memset for floats *\/\n                                                   float         *values,\n                                                   const float    value);\nstatic inline\nvoid    bse_block_copy_uint32                     (guint\t  n_values,       \/* 4-byte variant of memcpy for ints *\/\n                                                   guint32       *values,\n                                                   const guint32 *ivalues);\nstatic inline\nvoid    bse_block_copy_float                      (guint\t  n_values,       \/* 4-byte variant of memcpy for floats *\/\n                                                   gfloat        *values,\n                                                   const gfloat  *ivalues);\nvoid    bse_block_add_floats                      (guint\t  n_values,\n                                                   float         *ovalues,\n                                                   const float   *ivalues);\nvoid    bse_block_sub_floats                      (guint\t  n_values,\n                                                   float         *ovalues,\n                                                   const float   *ivalues);\nvoid    bse_block_mul_floats                      (guint\t  n_values,\n                                                   float         *ovalues,\n                                                   const float   *ivalues);\nvoid    bse_block_scale_floats                    (guint          n_values,\n                                                   float         *ovalues,\n                                                   const float   *ivalues,\n                                                   const float    level);\nvoid    bse_block_interleave2_floats              (guint\t  n_ivalues,\n                                                   float         *ovalues,        \/* length_ovalues = n_ivalues * 2 *\/\n                                                   const float   *ivalues,\n                                                   guint          offset);        \/* 0=left, 1=right *\/\nvoid    bse_block_interleave2_add_floats          (guint\t  n_ivalues,\n                                                   float         *ovalues,        \/* length_ovalues = n_ivalues * 2 *\/\n                                                   const float   *ivalues,\n                                                   guint          offset);        \/* 0=left, 1=right *\/\nvoid    bse_block_calc_float_range                (guint          n_values,\n                                                   const float   *ivalues,\n\t                                           float         *min_value,\n\t                                           float         *max_value);\nfloat   bse_block_calc_float_square_sum           (guint          n_values,\n                                                   const float   *ivalues);\nfloat   bse_block_calc_float_range_and_square_sum (guint          n_values,\n                                                   const float   *ivalues,\n\t                                           float         *min_value,\n\t                                           float         *max_value);\n\n#ifdef  __cplusplus\n#include <bse\/bseresampler.hh>\nnamespace Bse {\n\n\/* --- C++ API --- *\/\nclass Block {\npublic:\n  static const char*    impl_name            ()                              { return singleton->impl_name (); }\n  static inline   void\tfill                 (guint           n_values,\n\t\t\t\t\t      float          *values,\n\t\t\t\t\t      float           value);\n  static inline   void\tfill                 (guint           n_values,\n\t\t\t\t\t      guint32        *values,\n\t\t\t\t\t      guint32         value);\n  static inline   void\tcopy                 (guint           n_values,\n\t\t\t\t\t      float          *values,\n\t\t\t\t\t      const float    *ivalues);\n  static inline   void\tcopy                 (guint           n_values,\n\t\t\t\t\t      guint32        *values,\n\t\t\t\t\t      const guint32  *ivalues);\n  static inline   void\tadd                  (guint\t      n_values,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues)       { singleton->add (n_values, ovalues, ivalues); }\n  static inline   void\tsub                  (guint\t      n_values,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues)       { singleton->sub (n_values, ovalues, ivalues); }\n  static inline   void\tmul                  (guint\t      n_values,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues)       { singleton->mul (n_values, ovalues, ivalues); }\n  static inline   void\tscale                (guint\t      n_values,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues,\n\t\t\t\t\t      const float     level)         { singleton->scale (n_values, ovalues, ivalues, level); }\n  static inline   void\tinterleave2          (guint\t      n_ivalues,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues,\n\t\t\t\t\t      guint           offset)        { singleton->interleave2 (n_ivalues, ovalues, ivalues, offset); }\n  static inline   void\tinterleave2_add      (guint\t      n_ivalues,\n\t\t\t\t\t      float          *ovalues,\n\t\t\t\t\t      const float    *ivalues,\n\t\t\t\t\t      guint           offset)        { singleton->interleave2_add (n_ivalues, ovalues, ivalues, offset); }\n  static inline   void\trange    \t     (guint\t      n_values,\n\t\t\t\t\t      const float    *ivalues,\n\t\t\t\t\t      float&          min_value,\n\t\t\t\t\t      float&          max_value)     { singleton->range (n_values, ivalues, min_value, max_value); }\n  static inline   float\tsquare_sum           (guint\t      n_values,\n\t\t\t\t\t      const float    *ivalues)       { return singleton->square_sum (n_values, ivalues); }\n  static inline   float\trange_and_square_sum (guint\t      n_values,\n                                              const float    *ivalues,\n\t\t\t\t\t      float&          min_value,\n\t\t\t\t\t      float&          max_value)     { return singleton->range_and_square_sum (n_values, ivalues, min_value, max_value); }\n\n  typedef Resampler::Resampler2 Resampler2;\n  static inline\n  Resampler2*           create_resampler2    (BseResampler2Mode      mode,\n                                              BseResampler2Precision precision)\t  { return singleton->create_resampler2 (mode, precision); }\n  static inline\n  bool                  test_resampler2\t     (bool                   verbose)\t  { return singleton->test_resampler2 (verbose); }\n\n\n\n  class Impl {\n  protected:\n    virtual      ~Impl                  ();\n    virtual const char* impl_name       () = 0;\n    virtual void  add                   (guint\t         n_values,\n                                         float          *ovalues,\n                                         const float    *ivalues) = 0;\n    virtual void  sub                   (guint\t         n_values,\n                                         float          *ovalues,\n                                         const float    *ivalues) = 0;\n    virtual void  mul                   (guint\t         n_values,\n                                         float          *ovalues,\n                                         const float    *ivalues) = 0;\n    virtual void  scale                 (guint           n_values,\n                                         float          *ovalues,\n                                         const float    *ivalues,\n                                         const float     level) = 0;\n    virtual void  interleave2           (guint\t         n_ivalues,\n                                         float          *ovalues,\t\/* length_ovalues = n_ivalues * 2 *\/\n                                         const float    *ivalues,\n                                         guint           offset) = 0;   \/* 0=left, 1=right *\/\n    virtual void  interleave2_add       (guint\t         n_ivalues,\n                                         float          *ovalues,\t\/* length_ovalues = n_ivalues * 2 *\/\n                                         const float    *ivalues,\n                                         guint           offset) = 0;   \/* 0=left, 1=right *\/\n    virtual void  range                 (guint\t         n_values,\n                                         const float    *ivalues,\n\t\t\t\t\t float&          min_value,\n\t\t\t\t\t float&          max_value) = 0;\n    virtual float square_sum            (guint\t         n_values,\n                                         const float    *ivalues) = 0;\n    virtual float range_and_square_sum\t(guint\t         n_values,\n                                         const float    *ivalues,\n\t\t\t\t\t float&          min_value,\n\t\t\t\t\t float&          max_value) = 0;\n    virtual\n    Resampler2*   create_resampler2     (BseResampler2Mode      mode,\n                                         BseResampler2Precision precision) = 0;\n    virtual bool  test_resampler2\t(bool\t\t\tverbose) = 0;\n  friend class Block;\n    static  void  substitute            (Impl           *substitute_impl);\n  };\n  static Impl*  default_singleton       ();\n  static Impl*  current_singleton       ();\nprivate:\n  static Impl  *singleton;\n};\n\n\/* --- C++ implementation bits --- *\/\ninline void\nBlock::fill (guint           n_values,\n             float          *values,\n             float           value)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (float) == 4);\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  const union { float f; guint32 vuint32; } u = { value };\n  wmemset ((wchar_t*) values, u.vuint32, n_values);\n}\n\ninline void\nBlock::fill (guint           n_values,\n             guint32        *values,\n             guint32         value)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemset ((wchar_t*) values, value, n_values);\n}\n\ninline void\nBlock::copy (guint          n_values,\n             guint32       *values,\n             const guint32 *ivalues)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemcpy ((wchar_t*) values, (const wchar_t*) ivalues, n_values);\n}\n\ninline void\nBlock::copy (guint         n_values,\n             gfloat       *values,\n             const gfloat *ivalues)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (float) == 4);\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemcpy ((wchar_t*) values, (const wchar_t*) ivalues, n_values);\n}\n\n} \/\/ Bse\n#endif  \/* __cplusplus *\/\n\n\/* --- C implementation bits --- *\/\nstatic inline void\nbse_block_fill_uint32 (guint    n_values,\n\t\t       guint32 *values,\n\t\t       guint32  vuint32)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemset ((wchar_t*) values, vuint32, n_values);\n}\n\nstatic inline void\nbse_block_fill_float (guint\t   n_values,\n\t\t      float       *values,\n\t\t      const float  value)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (float) == 4);\n  const union { float f; guint32 vuint32; } u = { value };\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemset ((wchar_t*) values, u.vuint32, n_values);\n}\n\nstatic inline void\nbse_block_copy_uint32 (guint\t      n_values,\n\t\t       guint32       *values,\n\t\t       const guint32 *ivalues)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemcpy ((wchar_t*) values, (const wchar_t*) ivalues, n_values);\n}\n\nstatic inline void\nbse_block_copy_float (guint\t    n_values,\n\t\t      gfloat       *values,\n\t\t      const gfloat *ivalues)\n{\n  RAPICORN_STATIC_ASSERT (sizeof (float) == 4);\n  RAPICORN_STATIC_ASSERT (sizeof (wchar_t) == 4);\n  wmemcpy ((wchar_t*) values, (const wchar_t*) ivalues, n_values);\n}\n\/\/ == C++ Implementations ==\ntemplate<class TYPE> inline void\nbse_block_fill_0 (size_t n_values, TYPE *values)\n{\n  size_t n_bytes = n_values * sizeof (TYPE);\n  char *p = (char*) values;\n  uint r = size_t (p) & 3;\n  if (BSE_UNLIKELY (r))\n    {\n      r = MIN (r, n_values);    \/\/ rest for pointer alignment\n      memset (p, 0, r);\n      p += r;\n      n_bytes -= r;\n    }\n  const size_t n_aligned = n_bytes \/ 4;\n  wmemset ((wchar_t*) p, 0, n_aligned);\n  n_bytes -= n_aligned * 4;\n  if (BSE_UNLIKELY (n_bytes))\n    {\n      p += n_aligned * 4;\n      memset (p, 0, n_bytes);\n    }\n}\n\n#endif \/* __BSE_BLOCK_UTILS_H__ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"chainerx\/routines\/linalg.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstdint>\n#include <utility>\n#include <vector>\n\n#include <nonstd\/optional.hpp>\n\n#include \"chainerx\/array.h\"\n#include \"chainerx\/axes.h\"\n#include \"chainerx\/backend.h\"\n#include \"chainerx\/backprop_mode.h\"\n#include \"chainerx\/backward_builder.h\"\n#include \"chainerx\/backward_context.h\"\n#include \"chainerx\/dtype.h\"\n#include \"chainerx\/error.h\"\n#include \"chainerx\/graph.h\"\n#include \"chainerx\/kernels\/linalg.h\"\n#include \"chainerx\/routines\/creation.h\"\n#include \"chainerx\/routines\/manipulation.h\"\n#include \"chainerx\/routines\/type_util.h\"\n#include \"chainerx\/shape.h\"\n\nnamespace chainerx {\n\nArray Dot(const Array& a, const Array& b, nonstd::optional<Dtype> out_dtype) {\n    Dtype real_out_dtype = out_dtype.has_value() ? *out_dtype : ResultType(a, b);\n\n    if (a.ndim() == 0 || b.ndim() == 0) {\n        return a * b;\n    }\n\n    Array modified_b{};\n\n    Shape out_shape{};\n    std::copy(a.shape().begin(), a.shape().end() - 1, std::back_inserter(out_shape));\n\n    if (b.ndim() > 2) {\n        std::vector<int> b_transpose_axes{};\n        b_transpose_axes.reserve(b.ndim());\n        std::vector<int> axes_index(b.ndim());\n        std::iota(axes_index.begin(), axes_index.end(), 0);\n        std::copy(axes_index.begin(), axes_index.end() - 2, std::back_inserter(b_transpose_axes));\n        std::reverse_copy(axes_index.end() - 2, axes_index.end(), std::back_inserter(b_transpose_axes));\n\n        Axes axes(b_transpose_axes.begin(), b_transpose_axes.end());\n        modified_b = b.Transpose(axes);\n        std::copy(modified_b.shape().begin(), modified_b.shape().end() - 1, std::back_inserter(out_shape));\n\n        modified_b = modified_b.Reshape({-1, modified_b.shape().back()});\n        modified_b = modified_b.Transpose();\n    } else {\n        std::copy(b.shape().begin() + 1, b.shape().end(), std::back_inserter(out_shape));\n        modified_b = b;\n    }\n\n    int64_t k = a.shape()[a.ndim() - 1];\n    if (modified_b.shape()[0] != k) {\n        throw DimensionError{\"Axis dimension mismatch\"};\n    }\n    if (k == 0) {\n        return Zeros(out_shape, real_out_dtype, a.device());\n    }\n\n    \/\/ Make each operand a matrix\n    int64_t m = a.GetTotalSize() \/ k;\n    int64_t n = b.GetTotalSize() \/ k;\n    Array a_matrix = a.Reshape({m, k});\n    Array b_matrix = modified_b.Reshape({k, n});\n\n    \/\/ Matrix-matrix product\n    Array out_matrix = Empty({m, n}, real_out_dtype, a.device());\n    {\n        NoBackpropModeScope scope{};\n        a.device().backend().CallKernel<DotKernel>(a_matrix, b_matrix, out_matrix);\n    }\n\n    {\n        BackwardBuilder bb{\"dot\", {a_matrix, b_matrix}, out_matrix};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([b_matrix_tok = bb.RetainInput(1), a_dtype = a.dtype()](BackwardContext& bctx) {\n                const Array& b_matrix = bctx.GetRetainedInput(b_matrix_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = Dot(gout, b_matrix.Transpose(), a_dtype);\n            });\n        }\n        if (BackwardBuilder::Target bt = bb.CreateTarget(1)) {\n            bt.Define([a_matrix_tok = bb.RetainInput(0), b_dtype = b.dtype()](BackwardContext& bctx) {\n                const Array& a_matrix = bctx.GetRetainedInput(a_matrix_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = Dot(a_matrix.Transpose(), gout, b_dtype);\n            });\n        }\n        bb.Finalize();\n    }\n\n    return out_matrix.Reshape(out_shape);\n}\n\nArray Solve(const Array& a, const Array& b) {\n    if (a.ndim() != 2) {\n        throw DimensionError{\"ChainerX solve supports only 2-dimensional arrays.\"};\n    }\n    if (a.shape()[0] != a.shape()[1]) {\n        throw DimensionError{\"Matrix is not square.\"};\n    }\n    CheckEqual(a.device(), b.device());\n    CheckEqual(a.dtype(), b.dtype());\n    Dtype dtype = internal::GetMathResultDtype(b.dtype());\n    Array out = Empty(b.shape(), dtype, b.device());\n\n    {\n        NoBackpropModeScope scope{};\n        a.device().backend().CallKernel<SolveKernel>(a, b, out);\n    }\n\n    \/\/ Reference:\n    \/\/ https:\/\/people.maths.ox.ac.uk\/gilesm\/files\/NA-08-01.pdf\n    \/\/ Sec. 2.3.1 Matrix inverse product\n    {\n        BackwardBuilder bb{\"solve\", {a, b}, out};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([out_tok = bb.RetainOutput(0), a_tok = bb.RetainInput(0), a_dtype = a.dtype()](BackwardContext& bctx) {\n                const Array& a = bctx.GetRetainedInput(a_tok);\n                const Array& out = bctx.GetRetainedOutput(out_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = -Dot(ExpandDims(Solve(a.Transpose(), gout), 1), ExpandDims(out, 0), a_dtype);\n            });\n        }\n        if (BackwardBuilder::Target bt = bb.CreateTarget(1)) {\n            bt.Define([a_tok = bb.RetainInput(0)](BackwardContext& bctx) {\n                const Array& a = bctx.GetRetainedInput(a_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = Solve(a.Transpose(), gout);\n            });\n        }\n        bb.Finalize();\n    }\n\n    return out;\n}\n\nArray Inverse(const Array& a) {\n    if (a.ndim() != 2) {\n        throw DimensionError{\"ChainerX inverse supports only 2-dimensional arrays.\"};\n    }\n    if (a.shape()[0] != a.shape()[1]) {\n        throw DimensionError{\"Matrix is not square.\"};\n    }\n    Dtype dtype = internal::GetMathResultDtype(a.dtype());\n    Array out = Empty(a.shape(), dtype, a.device());\n\n    {\n        NoBackpropModeScope scope{};\n        a.device().backend().CallKernel<InverseKernel>(a, out);\n    }\n\n    \/\/ Reference:\n    \/\/ https:\/\/people.maths.ox.ac.uk\/gilesm\/files\/NA-08-01.pdf\n    \/\/ Sec. 2.2.3 Inverse\n    {\n        BackwardBuilder bb{\"inv\", a, out};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([out_tok = bb.RetainOutput(0), a_dtype = a.dtype()](BackwardContext& bctx) {\n                const Array& out = bctx.GetRetainedOutput(out_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = -Dot(Dot(out.Transpose(), gout, a_dtype), out.Transpose(), a_dtype);\n            });\n        }\n        bb.Finalize();\n    }\n\n    return out;\n}\n\n}  \/\/ namespace chainerx\n<commit_msg>Added helper functions CheckSquareMatrix, CheckSquareMatrix<commit_after>#include \"chainerx\/routines\/linalg.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstdint>\n#include <utility>\n#include <vector>\n\n#include <nonstd\/optional.hpp>\n\n#include \"chainerx\/array.h\"\n#include \"chainerx\/axes.h\"\n#include \"chainerx\/backend.h\"\n#include \"chainerx\/backprop_mode.h\"\n#include \"chainerx\/backward_builder.h\"\n#include \"chainerx\/backward_context.h\"\n#include \"chainerx\/dtype.h\"\n#include \"chainerx\/error.h\"\n#include \"chainerx\/graph.h\"\n#include \"chainerx\/kernels\/linalg.h\"\n#include \"chainerx\/routines\/creation.h\"\n#include \"chainerx\/routines\/manipulation.h\"\n#include \"chainerx\/routines\/type_util.h\"\n#include \"chainerx\/shape.h\"\n\nnamespace chainerx {\n\nArray Dot(const Array& a, const Array& b, nonstd::optional<Dtype> out_dtype) {\n    Dtype real_out_dtype = out_dtype.has_value() ? *out_dtype : ResultType(a, b);\n\n    if (a.ndim() == 0 || b.ndim() == 0) {\n        return a * b;\n    }\n\n    Array modified_b{};\n\n    Shape out_shape{};\n    std::copy(a.shape().begin(), a.shape().end() - 1, std::back_inserter(out_shape));\n\n    if (b.ndim() > 2) {\n        std::vector<int> b_transpose_axes{};\n        b_transpose_axes.reserve(b.ndim());\n        std::vector<int> axes_index(b.ndim());\n        std::iota(axes_index.begin(), axes_index.end(), 0);\n        std::copy(axes_index.begin(), axes_index.end() - 2, std::back_inserter(b_transpose_axes));\n        std::reverse_copy(axes_index.end() - 2, axes_index.end(), std::back_inserter(b_transpose_axes));\n\n        Axes axes(b_transpose_axes.begin(), b_transpose_axes.end());\n        modified_b = b.Transpose(axes);\n        std::copy(modified_b.shape().begin(), modified_b.shape().end() - 1, std::back_inserter(out_shape));\n\n        modified_b = modified_b.Reshape({-1, modified_b.shape().back()});\n        modified_b = modified_b.Transpose();\n    } else {\n        std::copy(b.shape().begin() + 1, b.shape().end(), std::back_inserter(out_shape));\n        modified_b = b;\n    }\n\n    int64_t k = a.shape()[a.ndim() - 1];\n    if (modified_b.shape()[0] != k) {\n        throw DimensionError{\"Axis dimension mismatch\"};\n    }\n    if (k == 0) {\n        return Zeros(out_shape, real_out_dtype, a.device());\n    }\n\n    \/\/ Make each operand a matrix\n    int64_t m = a.GetTotalSize() \/ k;\n    int64_t n = b.GetTotalSize() \/ k;\n    Array a_matrix = a.Reshape({m, k});\n    Array b_matrix = modified_b.Reshape({k, n});\n\n    \/\/ Matrix-matrix product\n    Array out_matrix = Empty({m, n}, real_out_dtype, a.device());\n    {\n        NoBackpropModeScope scope{};\n        a.device().backend().CallKernel<DotKernel>(a_matrix, b_matrix, out_matrix);\n    }\n\n    {\n        BackwardBuilder bb{\"dot\", {a_matrix, b_matrix}, out_matrix};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([b_matrix_tok = bb.RetainInput(1), a_dtype = a.dtype()](BackwardContext& bctx) {\n                const Array& b_matrix = bctx.GetRetainedInput(b_matrix_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = Dot(gout, b_matrix.Transpose(), a_dtype);\n            });\n        }\n        if (BackwardBuilder::Target bt = bb.CreateTarget(1)) {\n            bt.Define([a_matrix_tok = bb.RetainInput(0), b_dtype = b.dtype()](BackwardContext& bctx) {\n                const Array& a_matrix = bctx.GetRetainedInput(a_matrix_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = Dot(a_matrix.Transpose(), gout, b_dtype);\n            });\n        }\n        bb.Finalize();\n    }\n\n    return out_matrix.Reshape(out_shape);\n}\n\nnamespace {\n\nvoid CheckRankTwoArray(const Array& a) {\n    if (a.ndim() != 2) {\n        throw DimensionError{\"ChainerX solve supports only 2-dimensional arrays.\"};\n    }\n}\n\nvoid CheckSquareMatrix(const Array& a) {\n    if (a.shape()[0] != a.shape()[1]) {\n        throw DimensionError{\"Matrix is not square.\"};\n    }\n}\n\n}  \/\/ namespace\n\nArray Solve(const Array& a, const Array& b) {\n    CheckRankTwoArray(a);\n    CheckSquareMatrix(a);\n    CheckEqual(a.device(), b.device());\n    CheckEqual(a.dtype(), b.dtype());\n    Dtype dtype = internal::GetMathResultDtype(b.dtype());\n    Array out = Empty(b.shape(), dtype, b.device());\n\n    {\n        NoBackpropModeScope scope{};\n        a.device().backend().CallKernel<SolveKernel>(a, b, out);\n    }\n\n    \/\/ Reference:\n    \/\/ https:\/\/people.maths.ox.ac.uk\/gilesm\/files\/NA-08-01.pdf\n    \/\/ Sec. 2.3.1 Matrix inverse product\n    {\n        BackwardBuilder bb{\"solve\", {a, b}, out};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([out_tok = bb.RetainOutput(0), a_tok = bb.RetainInput(0), a_dtype = a.dtype()](BackwardContext& bctx) {\n                const Array& a = bctx.GetRetainedInput(a_tok);\n                const Array& out = bctx.GetRetainedOutput(out_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = -Dot(ExpandDims(Solve(a.Transpose(), gout), 1), ExpandDims(out, 0), a_dtype);\n            });\n        }\n        if (BackwardBuilder::Target bt = bb.CreateTarget(1)) {\n            bt.Define([a_tok = bb.RetainInput(0)](BackwardContext& bctx) {\n                const Array& a = bctx.GetRetainedInput(a_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = Solve(a.Transpose(), gout);\n            });\n        }\n        bb.Finalize();\n    }\n\n    return out;\n}\n\nArray Inverse(const Array& a) {\n    CheckRankTwoArray(a);\n    CheckSquareMatrix(a);\n    Dtype dtype = internal::GetMathResultDtype(a.dtype());\n    Array out = Empty(a.shape(), dtype, a.device());\n\n    {\n        NoBackpropModeScope scope{};\n        a.device().backend().CallKernel<InverseKernel>(a, out);\n    }\n\n    \/\/ Reference:\n    \/\/ https:\/\/people.maths.ox.ac.uk\/gilesm\/files\/NA-08-01.pdf\n    \/\/ Sec. 2.2.3 Inverse\n    {\n        BackwardBuilder bb{\"inv\", a, out};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([out_tok = bb.RetainOutput(0), a_dtype = a.dtype()](BackwardContext& bctx) {\n                const Array& out = bctx.GetRetainedOutput(out_tok);\n                const Array& gout = *bctx.output_grad();\n                bctx.input_grad() = -Dot(Dot(out.Transpose(), gout, a_dtype), out.Transpose(), a_dtype);\n            });\n        }\n        bb.Finalize();\n    }\n\n    return out;\n}\n\n}  \/\/ namespace chainerx\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\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_chart2.hxx\"\n#include \"DateScaling.hxx\"\n#include <com\/sun\/star\/chart\/TimeUnit.hpp>\n#include <rtl\/math.hxx>\n#include \"com\/sun\/star\/uno\/RuntimeException.hpp\"\n\nnamespace\n{\n\nstatic const ::rtl::OUString lcl_aServiceName_DateScaling(\n    RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.chart2.DateScaling\" ));\nstatic const ::rtl::OUString lcl_aServiceName_InverseDateScaling(\n    RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.chart2.InverseDateScaling\" ));\n\nstatic const ::rtl::OUString lcl_aImplementationName_DateScaling(\n    RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.chart2.DateScaling\" ));\nstatic const ::rtl::OUString lcl_aImplementationName_InverseDateScaling(\n    RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.chart2.InverseDateScaling\" ));\n\nstatic const double lcl_fNumberOfMonths = 12.0;\/\/todo: this needs to be offered by basic tools Date class if it should be more generic\n}\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::chart2;\nusing ::com::sun::star::chart::TimeUnit::DAY;\nusing ::com::sun::star::chart::TimeUnit::MONTH;\nusing ::com::sun::star::chart::TimeUnit::YEAR;\n\nDateScaling::DateScaling( const Date& rNullDate, sal_Int32 nTimeUnit, bool bShifted )\n        : m_aNullDate( rNullDate )\n        , m_nTimeUnit( nTimeUnit )\n        , m_bShifted( bShifted )\n{\n}\n\nDateScaling::~DateScaling()\n{\n}\n\ndouble SAL_CALL DateScaling::doScaling( double value )\n    throw (uno::RuntimeException)\n{\n    double fResult(value);\n    if( ::rtl::math::isNan( value ) || ::rtl::math::isInf( value ) )\n        ::rtl::math::setNan( & fResult );\n    else\n    {\n        Date aDate(m_aNullDate);\n        aDate += static_cast<long>(::rtl::math::approxFloor(value));\n        switch( m_nTimeUnit )\n        {\n            case DAY:\n                fResult = value;\n                if(m_bShifted)\n                    fResult+=0.5;\n                break;\n            case YEAR:\n            case MONTH:\n            default:\n                fResult = aDate.GetYear();\n                fResult *= lcl_fNumberOfMonths;\/\/asssuming equal count of months in each year\n                fResult += aDate.GetMonth();\n\n                double fDayOfMonth = aDate.GetDay();\n                fDayOfMonth -= 1.0;\n                double fDaysInMonth = aDate.GetDaysInMonth();\n                fResult += fDayOfMonth\/fDaysInMonth;\n                if(m_bShifted)\n                {\n                    if( YEAR==m_nTimeUnit )\n                        fResult += 0.5*lcl_fNumberOfMonths;\n                    else\n                        fResult += 0.5;\n                }\n                break;\n        }\n    }\n    return fResult;\n}\n\nuno::Reference< XScaling > SAL_CALL DateScaling::getInverseScaling()\n    throw (uno::RuntimeException)\n{\n    return new InverseDateScaling( m_aNullDate, m_nTimeUnit, m_bShifted );\n}\n\n::rtl::OUString SAL_CALL DateScaling::getServiceName()\n    throw (uno::RuntimeException)\n{\n    return lcl_aServiceName_DateScaling;\n}\n\nuno::Sequence< ::rtl::OUString > DateScaling::getSupportedServiceNames_Static()\n{\n    return uno::Sequence< ::rtl::OUString >( & lcl_aServiceName_DateScaling, 1 );\n}\n\n\/\/ implement XServiceInfo methods basing upon getSupportedServiceNames_Static\nAPPHELPER_XSERVICEINFO_IMPL( DateScaling, lcl_aServiceName_DateScaling )\n\n\/\/ ----------------------------------------\n\nInverseDateScaling::InverseDateScaling( const Date& rNullDate, sal_Int32 nTimeUnit, bool bShifted )\n        : m_aNullDate( rNullDate )\n        , m_nTimeUnit( nTimeUnit )\n        , m_bShifted( bShifted )\n{\n}\n\nInverseDateScaling::~InverseDateScaling()\n{\n}\n\ndouble SAL_CALL InverseDateScaling::doScaling( double value )\n    throw (uno::RuntimeException)\n{\n    double fResult(value);\n    if( ::rtl::math::isNan( value ) || ::rtl::math::isInf( value ) )\n        ::rtl::math::setNan( & fResult );\n    else\n    {\n        switch( m_nTimeUnit )\n        {\n            case DAY:\n                if(m_bShifted)\n                    value -= 0.5;\n                fResult = value;\n                break;\n            case YEAR:\n            case MONTH:\n            default:\n                \/\/Date aDate(m_aNullDate);\n                if(m_bShifted)\n                {\n                    if( YEAR==m_nTimeUnit )\n                        value -= 0.5*lcl_fNumberOfMonths;\n                    else\n                        value -= 0.5;\n                }\n                Date aDate;\n                double fYear = ::rtl::math::approxFloor(value\/lcl_fNumberOfMonths);\n                double fMonth =  ::rtl::math::approxFloor(value-(fYear*lcl_fNumberOfMonths));\n                aDate.SetYear( static_cast<USHORT>(fYear) );\n                aDate.SetMonth( static_cast<USHORT>(fMonth) );\n                aDate.SetDay( 1 );\n                double fMonthCount = (fYear*lcl_fNumberOfMonths)+fMonth;\n                double fDay = (value-fMonthCount)*aDate.GetDaysInMonth();\n                fDay += 1.0;\n                aDate.SetDay( static_cast<USHORT>(::rtl::math::round(fDay)) );\n                fResult = aDate - m_aNullDate;\n                break;\n        }\n    }\n    return fResult;\n}\n\nuno::Reference< XScaling > SAL_CALL InverseDateScaling::getInverseScaling()\n    throw (uno::RuntimeException)\n{\n    return new DateScaling( m_aNullDate, m_nTimeUnit, m_bShifted );\n}\n\n::rtl::OUString SAL_CALL InverseDateScaling::getServiceName()\n    throw (uno::RuntimeException)\n{\n    return lcl_aServiceName_InverseDateScaling;\n}\n\nuno::Sequence< ::rtl::OUString > InverseDateScaling::getSupportedServiceNames_Static()\n{\n    return uno::Sequence< ::rtl::OUString >( & lcl_aServiceName_InverseDateScaling, 1 );\n}\n\n\/\/ implement XServiceInfo methods basing upon getSupportedServiceNames_Static\nAPPHELPER_XSERVICEINFO_IMPL( InverseDateScaling, lcl_aServiceName_InverseDateScaling )\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n<commit_msg>chart46: #i25706# implement date axis - #i116406# december dates wrongly interpreted<commit_after>\/*************************************************************************\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_chart2.hxx\"\n#include \"DateScaling.hxx\"\n#include <com\/sun\/star\/chart\/TimeUnit.hpp>\n#include <rtl\/math.hxx>\n#include \"com\/sun\/star\/uno\/RuntimeException.hpp\"\n\nnamespace\n{\n\nstatic const ::rtl::OUString lcl_aServiceName_DateScaling(\n    RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.chart2.DateScaling\" ));\nstatic const ::rtl::OUString lcl_aServiceName_InverseDateScaling(\n    RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.chart2.InverseDateScaling\" ));\n\nstatic const ::rtl::OUString lcl_aImplementationName_DateScaling(\n    RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.chart2.DateScaling\" ));\nstatic const ::rtl::OUString lcl_aImplementationName_InverseDateScaling(\n    RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.chart2.InverseDateScaling\" ));\n\nstatic const double lcl_fNumberOfMonths = 12.0;\/\/todo: this needs to be offered by basic tools Date class if it should be more generic\n}\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::chart2;\nusing ::com::sun::star::chart::TimeUnit::DAY;\nusing ::com::sun::star::chart::TimeUnit::MONTH;\nusing ::com::sun::star::chart::TimeUnit::YEAR;\n\nDateScaling::DateScaling( const Date& rNullDate, sal_Int32 nTimeUnit, bool bShifted )\n        : m_aNullDate( rNullDate )\n        , m_nTimeUnit( nTimeUnit )\n        , m_bShifted( bShifted )\n{\n}\n\nDateScaling::~DateScaling()\n{\n}\n\ndouble SAL_CALL DateScaling::doScaling( double value )\n    throw (uno::RuntimeException)\n{\n    double fResult(value);\n    if( ::rtl::math::isNan( value ) || ::rtl::math::isInf( value ) )\n        ::rtl::math::setNan( & fResult );\n    else\n    {\n        Date aDate(m_aNullDate);\n        aDate += static_cast<long>(::rtl::math::approxFloor(value));\n        switch( m_nTimeUnit )\n        {\n            case DAY:\n                fResult = value;\n                if(m_bShifted)\n                    fResult+=0.5;\n                break;\n            case YEAR:\n            case MONTH:\n            default:\n                fResult = aDate.GetYear();\n                fResult *= lcl_fNumberOfMonths;\/\/asssuming equal count of months in each year\n                fResult += aDate.GetMonth();\n\n                double fDayOfMonth = aDate.GetDay();\n                fDayOfMonth -= 1.0;\n                double fDaysInMonth = aDate.GetDaysInMonth();\n                fResult += fDayOfMonth\/fDaysInMonth;\n                if(m_bShifted)\n                {\n                    if( YEAR==m_nTimeUnit )\n                        fResult += 0.5*lcl_fNumberOfMonths;\n                    else\n                        fResult += 0.5;\n                }\n                break;\n        }\n    }\n    return fResult;\n}\n\nuno::Reference< XScaling > SAL_CALL DateScaling::getInverseScaling()\n    throw (uno::RuntimeException)\n{\n    return new InverseDateScaling( m_aNullDate, m_nTimeUnit, m_bShifted );\n}\n\n::rtl::OUString SAL_CALL DateScaling::getServiceName()\n    throw (uno::RuntimeException)\n{\n    return lcl_aServiceName_DateScaling;\n}\n\nuno::Sequence< ::rtl::OUString > DateScaling::getSupportedServiceNames_Static()\n{\n    return uno::Sequence< ::rtl::OUString >( & lcl_aServiceName_DateScaling, 1 );\n}\n\n\/\/ implement XServiceInfo methods basing upon getSupportedServiceNames_Static\nAPPHELPER_XSERVICEINFO_IMPL( DateScaling, lcl_aServiceName_DateScaling )\n\n\/\/ ----------------------------------------\n\nInverseDateScaling::InverseDateScaling( const Date& rNullDate, sal_Int32 nTimeUnit, bool bShifted )\n        : m_aNullDate( rNullDate )\n        , m_nTimeUnit( nTimeUnit )\n        , m_bShifted( bShifted )\n{\n}\n\nInverseDateScaling::~InverseDateScaling()\n{\n}\n\ndouble SAL_CALL InverseDateScaling::doScaling( double value )\n    throw (uno::RuntimeException)\n{\n    double fResult(value);\n    if( ::rtl::math::isNan( value ) || ::rtl::math::isInf( value ) )\n        ::rtl::math::setNan( & fResult );\n    else\n    {\n        switch( m_nTimeUnit )\n        {\n            case DAY:\n                if(m_bShifted)\n                    value -= 0.5;\n                fResult = value;\n                break;\n            case YEAR:\n            case MONTH:\n            default:\n                \/\/Date aDate(m_aNullDate);\n                if(m_bShifted)\n                {\n                    if( YEAR==m_nTimeUnit )\n                        value -= 0.5*lcl_fNumberOfMonths;\n                    else\n                        value -= 0.5;\n                }\n                Date aDate;\n                double fYear = ::rtl::math::approxFloor(value\/lcl_fNumberOfMonths);\n                double fMonth = ::rtl::math::approxFloor(value-(fYear*lcl_fNumberOfMonths));\n                if( fMonth==0.0 )\n                {\n                    fYear--;\n                    fMonth=12.0;\n                }\n                aDate.SetYear( static_cast<USHORT>(fYear) );\n                aDate.SetMonth( static_cast<USHORT>(fMonth) );\n                aDate.SetDay( 1 );\n                double fMonthCount = (fYear*lcl_fNumberOfMonths)+fMonth;\n                double fDay = (value-fMonthCount)*aDate.GetDaysInMonth();\n                fDay += 1.0;\n                aDate.SetDay( static_cast<USHORT>(::rtl::math::round(fDay)) );\n                fResult = aDate - m_aNullDate;\n                break;\n        }\n    }\n    return fResult;\n}\n\nuno::Reference< XScaling > SAL_CALL InverseDateScaling::getInverseScaling()\n    throw (uno::RuntimeException)\n{\n    return new DateScaling( m_aNullDate, m_nTimeUnit, m_bShifted );\n}\n\n::rtl::OUString SAL_CALL InverseDateScaling::getServiceName()\n    throw (uno::RuntimeException)\n{\n    return lcl_aServiceName_InverseDateScaling;\n}\n\nuno::Sequence< ::rtl::OUString > InverseDateScaling::getSupportedServiceNames_Static()\n{\n    return uno::Sequence< ::rtl::OUString >( & lcl_aServiceName_InverseDateScaling, 1 );\n}\n\n\/\/ implement XServiceInfo methods basing upon getSupportedServiceNames_Static\nAPPHELPER_XSERVICEINFO_IMPL( InverseDateScaling, lcl_aServiceName_InverseDateScaling )\n\n\/\/.............................................................................\n} \/\/namespace chart\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) 2017 ScyllaDB Ltd.\n *\/\n\n#pragma once\n\n#include <utility>\n#include <type_traits>\n#include <functional>\n\nnamespace seastar {\n\ntemplate <typename Signature>\nclass noncopyable_function;\n\n\/\/\/ A clone of \\c std::function, but only invokes the move constructor\n\/\/\/ of the contained function.\ntemplate <typename Ret, typename... Args>\nclass noncopyable_function<Ret (Args...)> {\n    static constexpr size_t nr_direct = 32;\n    union [[gnu::may_alias]] storage {\n        char direct[nr_direct];\n        void* indirect;\n    };\n    using call_type = Ret (*)(const noncopyable_function* func, Args...);\n    using move_type = void (*)(noncopyable_function* from, noncopyable_function* to);\n    using destroy_type = void (*)(noncopyable_function* func);\n    struct vtable {\n        const call_type call;\n        const move_type move;\n        const destroy_type destroy;\n    };\nprivate:\n    const vtable* _vtable;\n    storage _storage;\nprivate:\n    static Ret empty_call(const noncopyable_function* func, Args... args) {\n        throw std::bad_function_call();\n    }\n    static void empty_move(noncopyable_function* from, noncopyable_function* to) {}\n    static void empty_destroy(noncopyable_function* func) {}\n    static constexpr vtable _s_empty_vtable = {empty_call, empty_move, empty_destroy};\n\n    static void indirect_move(noncopyable_function* from, noncopyable_function* to) {\n        using void_ptr = void*;\n        new (&to->_storage.indirect) void_ptr(from->_storage.indirect);\n    }\n\n    template <typename Func>\n    struct direct_vtable_for {\n        static Func* access(noncopyable_function* func) { return reinterpret_cast<Func*>(func->_storage.direct); }\n        static const Func* access(const noncopyable_function* func) { return reinterpret_cast<const Func*>(func->_storage.direct); }\n        static Ret call(const noncopyable_function* func, Args... args) {\n            return (*access(func))(std::forward<Args>(args)...);\n        }\n        static void move(noncopyable_function* from, noncopyable_function* to) {\n            new (access(to)) Func(std::move(*access(from)));\n            destroy(from);\n        }\n        static void destroy(noncopyable_function* func) {\n            access(func)->~Func();\n        }\n        static void initialize(Func&& from, noncopyable_function* to) {\n            new (access(to)) Func(std::move(from));\n        }\n        static constexpr vtable make_vtable() { return { call, move, destroy }; }\n        static const vtable s_vtable;\n    };\n    template <typename Func>\n    struct indirect_vtable_for {\n        static Func* access(noncopyable_function* func) { return reinterpret_cast<Func*>(func->_storage.indirect); }\n        static const Func* access(const noncopyable_function* func) { return reinterpret_cast<const Func*>(func->_storage.indirect); }\n        static Ret call(const noncopyable_function* func, Args... args) {\n            return (*access(func))(std::forward<Args>(args)...);\n        }\n        static void destroy(noncopyable_function* func) {\n            delete access(func);\n        }\n        static void initialize(Func&& from, noncopyable_function* to) {\n            to->_storage.indirect = new Func(std::move(from));\n        }\n        static constexpr vtable make_vtable() { return { call, indirect_move, destroy }; }\n        static const vtable s_vtable;\n    };\n    template <typename Func, bool Direct = true>\n    struct select_vtable_for : direct_vtable_for<Func> {};\n    template <typename Func>\n    struct select_vtable_for<Func, false> : indirect_vtable_for<Func> {};\n    template <typename Func>\n    static constexpr bool is_direct() {\n        return sizeof(Func) <= nr_direct && alignof(Func) <= alignof(storage);\n    }\n    template <typename Func>\n    struct vtable_for : select_vtable_for<Func, is_direct<Func>()> {};\npublic:\n    noncopyable_function() noexcept : _vtable(&_s_empty_vtable) {}\n    template <typename Func>\n    noncopyable_function(Func func) noexcept {\n        \/\/ If we want, we can support throwing move constructible functions by using the indirect path\n        static_assert(std::is_nothrow_move_constructible<Func>::value, \"must be nothrow move constructible\");\n        vtable_for<Func>::initialize(std::move(func), this);\n        _vtable = &vtable_for<Func>::s_vtable;\n    }\n    template <typename Object, typename... AllButFirstArg>\n    noncopyable_function(Ret (Object::*member)(AllButFirstArg...)) noexcept : noncopyable_function(std::mem_fn(member)) {}\n    template <typename Object, typename... AllButFirstArg>\n    noncopyable_function(Ret (Object::*member)(AllButFirstArg...) const) noexcept : noncopyable_function(std::mem_fn(member)) {}\n\n    ~noncopyable_function() {\n        _vtable->destroy(this);\n    }\n\n    noncopyable_function(const noncopyable_function&) = delete;\n    noncopyable_function& operator=(const noncopyable_function&) = delete;\n\n    noncopyable_function(noncopyable_function&& x) noexcept : _vtable(std::exchange(x._vtable, &_s_empty_vtable)) {\n        _vtable->move(&x, this);\n    }\n\n    noncopyable_function& operator=(noncopyable_function&& x) noexcept {\n        if (this != &x) {\n            this->~noncopyable_function();\n            new (this) noncopyable_function(std::move(x));\n        }\n        return *this;\n    }\n\n    Ret operator()(Args... args) const {\n        return _vtable->call(this, std::forward<Args>(args)...);\n    }\n};\n\n\ntemplate <typename Ret, typename... Args>\nconstexpr typename noncopyable_function<Ret (Args...)>::vtable noncopyable_function<Ret (Args...)>::_s_empty_vtable;\n\ntemplate <typename Ret, typename... Args>\ntemplate <typename Func>\nconst typename noncopyable_function<Ret (Args...)>::vtable noncopyable_function<Ret (Args...)>::direct_vtable_for<Func>::s_vtable\n        = noncopyable_function<Ret (Args...)>::direct_vtable_for<Func>::make_vtable();\n\n\ntemplate <typename Ret, typename... Args>\ntemplate <typename Func>\nconst typename noncopyable_function<Ret (Args...)>::vtable noncopyable_function<Ret (Args...)>::indirect_vtable_for<Func>::s_vtable\n        = noncopyable_function<Ret (Args...)>::indirect_vtable_for<Func>::make_vtable();\n\n}\n\n<commit_msg>noncopyable_function add bool operator<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) 2017 ScyllaDB Ltd.\n *\/\n\n#pragma once\n\n#include <utility>\n#include <type_traits>\n#include <functional>\n\nnamespace seastar {\n\ntemplate <typename Signature>\nclass noncopyable_function;\n\n\/\/\/ A clone of \\c std::function, but only invokes the move constructor\n\/\/\/ of the contained function.\ntemplate <typename Ret, typename... Args>\nclass noncopyable_function<Ret (Args...)> {\n    static constexpr size_t nr_direct = 32;\n    union [[gnu::may_alias]] storage {\n        char direct[nr_direct];\n        void* indirect;\n    };\n    using call_type = Ret (*)(const noncopyable_function* func, Args...);\n    using move_type = void (*)(noncopyable_function* from, noncopyable_function* to);\n    using destroy_type = void (*)(noncopyable_function* func);\n    struct vtable {\n        const call_type call;\n        const move_type move;\n        const destroy_type destroy;\n    };\nprivate:\n    const vtable* _vtable;\n    storage _storage;\nprivate:\n    static Ret empty_call(const noncopyable_function* func, Args... args) {\n        throw std::bad_function_call();\n    }\n    static void empty_move(noncopyable_function* from, noncopyable_function* to) {}\n    static void empty_destroy(noncopyable_function* func) {}\n    static constexpr vtable _s_empty_vtable = {empty_call, empty_move, empty_destroy};\n\n    static void indirect_move(noncopyable_function* from, noncopyable_function* to) {\n        using void_ptr = void*;\n        new (&to->_storage.indirect) void_ptr(from->_storage.indirect);\n    }\n\n    template <typename Func>\n    struct direct_vtable_for {\n        static Func* access(noncopyable_function* func) { return reinterpret_cast<Func*>(func->_storage.direct); }\n        static const Func* access(const noncopyable_function* func) { return reinterpret_cast<const Func*>(func->_storage.direct); }\n        static Ret call(const noncopyable_function* func, Args... args) {\n            return (*access(func))(std::forward<Args>(args)...);\n        }\n        static void move(noncopyable_function* from, noncopyable_function* to) {\n            new (access(to)) Func(std::move(*access(from)));\n            destroy(from);\n        }\n        static void destroy(noncopyable_function* func) {\n            access(func)->~Func();\n        }\n        static void initialize(Func&& from, noncopyable_function* to) {\n            new (access(to)) Func(std::move(from));\n        }\n        static constexpr vtable make_vtable() { return { call, move, destroy }; }\n        static const vtable s_vtable;\n    };\n    template <typename Func>\n    struct indirect_vtable_for {\n        static Func* access(noncopyable_function* func) { return reinterpret_cast<Func*>(func->_storage.indirect); }\n        static const Func* access(const noncopyable_function* func) { return reinterpret_cast<const Func*>(func->_storage.indirect); }\n        static Ret call(const noncopyable_function* func, Args... args) {\n            return (*access(func))(std::forward<Args>(args)...);\n        }\n        static void destroy(noncopyable_function* func) {\n            delete access(func);\n        }\n        static void initialize(Func&& from, noncopyable_function* to) {\n            to->_storage.indirect = new Func(std::move(from));\n        }\n        static constexpr vtable make_vtable() { return { call, indirect_move, destroy }; }\n        static const vtable s_vtable;\n    };\n    template <typename Func, bool Direct = true>\n    struct select_vtable_for : direct_vtable_for<Func> {};\n    template <typename Func>\n    struct select_vtable_for<Func, false> : indirect_vtable_for<Func> {};\n    template <typename Func>\n    static constexpr bool is_direct() {\n        return sizeof(Func) <= nr_direct && alignof(Func) <= alignof(storage);\n    }\n    template <typename Func>\n    struct vtable_for : select_vtable_for<Func, is_direct<Func>()> {};\npublic:\n    noncopyable_function() noexcept : _vtable(&_s_empty_vtable) {}\n    template <typename Func>\n    noncopyable_function(Func func) noexcept {\n        \/\/ If we want, we can support throwing move constructible functions by using the indirect path\n        static_assert(std::is_nothrow_move_constructible<Func>::value, \"must be nothrow move constructible\");\n        vtable_for<Func>::initialize(std::move(func), this);\n        _vtable = &vtable_for<Func>::s_vtable;\n    }\n    template <typename Object, typename... AllButFirstArg>\n    noncopyable_function(Ret (Object::*member)(AllButFirstArg...)) noexcept : noncopyable_function(std::mem_fn(member)) {}\n    template <typename Object, typename... AllButFirstArg>\n    noncopyable_function(Ret (Object::*member)(AllButFirstArg...) const) noexcept : noncopyable_function(std::mem_fn(member)) {}\n\n    ~noncopyable_function() {\n        _vtable->destroy(this);\n    }\n\n    noncopyable_function(const noncopyable_function&) = delete;\n    noncopyable_function& operator=(const noncopyable_function&) = delete;\n\n    noncopyable_function(noncopyable_function&& x) noexcept : _vtable(std::exchange(x._vtable, &_s_empty_vtable)) {\n        _vtable->move(&x, this);\n    }\n\n    noncopyable_function& operator=(noncopyable_function&& x) noexcept {\n        if (this != &x) {\n            this->~noncopyable_function();\n            new (this) noncopyable_function(std::move(x));\n        }\n        return *this;\n    }\n\n    Ret operator()(Args... args) const {\n        return _vtable->call(this, std::forward<Args>(args)...);\n    }\n\n    explicit operator bool() const {\n        return _vtable != &_s_empty_vtable;\n    }\n};\n\n\ntemplate <typename Ret, typename... Args>\nconstexpr typename noncopyable_function<Ret (Args...)>::vtable noncopyable_function<Ret (Args...)>::_s_empty_vtable;\n\ntemplate <typename Ret, typename... Args>\ntemplate <typename Func>\nconst typename noncopyable_function<Ret (Args...)>::vtable noncopyable_function<Ret (Args...)>::direct_vtable_for<Func>::s_vtable\n        = noncopyable_function<Ret (Args...)>::direct_vtable_for<Func>::make_vtable();\n\n\ntemplate <typename Ret, typename... Args>\ntemplate <typename Func>\nconst typename noncopyable_function<Ret (Args...)>::vtable noncopyable_function<Ret (Args...)>::indirect_vtable_for<Func>::s_vtable\n        = noncopyable_function<Ret (Args...)>::indirect_vtable_for<Func>::make_vtable();\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 \"chrome\/browser\/android\/process_utils.h\"\n\n#include <vector>\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"jni\/ProcessUtils_jni.h\"\n#include \"net\/http\/http_network_session.h\"\n#include \"net\/http\/http_transaction_factory.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"net\/url_request\/url_request_context_getter.h\"\n\nnamespace {\n\nvoid CloseIdleConnectionsForProfile(\n    scoped_refptr<net::URLRequestContextGetter> context_getter) {\n  DCHECK(context_getter.get());\n  if (!content::BrowserThread::CurrentlyOn(content::BrowserThread::IO)) {\n    content::BrowserThread::PostTask(content::BrowserThread::IO, FROM_HERE,\n                           base::Bind(&CloseIdleConnectionsForProfile,\n                                      context_getter));\n    return;\n  }\n\n  net::URLRequestContext* context = context_getter->GetURLRequestContext();\n  DCHECK(context->http_transaction_factory());\n  net::HttpNetworkSession* session =\n      context->http_transaction_factory()->GetSession();\n  DCHECK(session);\n  session->CloseIdleConnections();\n}\n\n\/\/ Only accessed from the JNI thread by ToggleWebKitSharedTimers() which is\n\/\/ implemented below.\nbase::LazyInstance<std::vector<int \/* process id *\/> > g_suspended_processes =\n    LAZY_INSTANCE_INITIALIZER;\n\n\/\/ Suspends timers in all current render processes.\nvoid SuspendWebKitSharedTimers(std::vector<int>* suspended_processes) {\n  for (content::RenderProcessHost::iterator i(\n          content::RenderProcessHost::AllHostsIterator());\n       !i.IsAtEnd(); i.Advance()) {\n    content::RenderProcessHost* host = i.GetCurrentValue();\n    suspended_processes->push_back(host->GetID());\n    host->Send(new ChromeViewMsg_ToggleWebKitSharedTimer(true));\n  }\n}\n\nvoid ResumeWebkitSharedTimers(const std::vector<int>& suspended_processes) {\n  for (std::vector<int>::const_iterator it = suspended_processes.begin();\n       it != suspended_processes.end(); ++it) {\n    content::RenderProcessHost* host = content::RenderProcessHost::FromID(*it);\n    if (host)\n      host->Send(new ChromeViewMsg_ToggleWebKitSharedTimer(false));\n  }\n}\n\n}  \/\/ namespace\n\nstatic void ToggleWebKitSharedTimers(JNIEnv* env,\n                                     jclass obj,\n                                     jboolean suspend) {\n  std::vector<int>* suspended_processes = &g_suspended_processes.Get();\n  if (suspend) {\n    DCHECK(suspended_processes->empty());\n    SuspendWebKitSharedTimers(suspended_processes);\n  } else {\n    ResumeWebkitSharedTimers(*suspended_processes);\n    suspended_processes->clear();\n  }\n}\n\nstatic void CloseIdleConnections(JNIEnv* env, jclass obj) {\n  \/\/ Iterate through all loaded profiles (and their associated incognito\n  \/\/ profiles if created), and close the idle connections associated with each\n  \/\/ one.\n  std::vector<Profile*> profiles(\n      g_browser_process->profile_manager()->GetLoadedProfiles());\n  for (std::vector<Profile*>::iterator i = profiles.begin();\n      i != profiles.end(); i++) {\n    Profile* profile = *i;\n    CloseIdleConnectionsForProfile(profile->GetRequestContext());\n    if (profile->HasOffTheRecordProfile()) {\n      CloseIdleConnectionsForProfile(\n          profile->GetOffTheRecordProfile()->GetRequestContext());\n    }\n  }\n}\n\nbool RegisterProcessUtils(JNIEnv* env) {\n  return RegisterNativesImpl(env);\n}\n<commit_msg>Check whether HttpNetworkSession is valid before closing idle connections.<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\/android\/process_utils.h\"\n\n#include <vector>\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"jni\/ProcessUtils_jni.h\"\n#include \"net\/http\/http_network_session.h\"\n#include \"net\/http\/http_transaction_factory.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"net\/url_request\/url_request_context_getter.h\"\n\nnamespace {\n\nvoid CloseIdleConnectionsForProfile(\n    scoped_refptr<net::URLRequestContextGetter> context_getter) {\n  DCHECK(context_getter.get());\n  if (!content::BrowserThread::CurrentlyOn(content::BrowserThread::IO)) {\n    content::BrowserThread::PostTask(content::BrowserThread::IO, FROM_HERE,\n                           base::Bind(&CloseIdleConnectionsForProfile,\n                                      context_getter));\n    return;\n  }\n\n  net::URLRequestContext* context = context_getter->GetURLRequestContext();\n  if (!context)\n    return;\n  net::HttpNetworkSession* session =\n      context->http_transaction_factory()->GetSession();\n  if (session)\n    session->CloseIdleConnections();\n}\n\n\/\/ Only accessed from the JNI thread by ToggleWebKitSharedTimers() which is\n\/\/ implemented below.\nbase::LazyInstance<std::vector<int \/* process id *\/> > g_suspended_processes =\n    LAZY_INSTANCE_INITIALIZER;\n\n\/\/ Suspends timers in all current render processes.\nvoid SuspendWebKitSharedTimers(std::vector<int>* suspended_processes) {\n  for (content::RenderProcessHost::iterator i(\n          content::RenderProcessHost::AllHostsIterator());\n       !i.IsAtEnd(); i.Advance()) {\n    content::RenderProcessHost* host = i.GetCurrentValue();\n    suspended_processes->push_back(host->GetID());\n    host->Send(new ChromeViewMsg_ToggleWebKitSharedTimer(true));\n  }\n}\n\nvoid ResumeWebkitSharedTimers(const std::vector<int>& suspended_processes) {\n  for (std::vector<int>::const_iterator it = suspended_processes.begin();\n       it != suspended_processes.end(); ++it) {\n    content::RenderProcessHost* host = content::RenderProcessHost::FromID(*it);\n    if (host)\n      host->Send(new ChromeViewMsg_ToggleWebKitSharedTimer(false));\n  }\n}\n\n}  \/\/ namespace\n\nstatic void ToggleWebKitSharedTimers(JNIEnv* env,\n                                     jclass obj,\n                                     jboolean suspend) {\n  std::vector<int>* suspended_processes = &g_suspended_processes.Get();\n  if (suspend) {\n    DCHECK(suspended_processes->empty());\n    SuspendWebKitSharedTimers(suspended_processes);\n  } else {\n    ResumeWebkitSharedTimers(*suspended_processes);\n    suspended_processes->clear();\n  }\n}\n\nstatic void CloseIdleConnections(JNIEnv* env, jclass obj) {\n  \/\/ Iterate through all loaded profiles (and their associated incognito\n  \/\/ profiles if created), and close the idle connections associated with each\n  \/\/ one.\n  std::vector<Profile*> profiles(\n      g_browser_process->profile_manager()->GetLoadedProfiles());\n  for (std::vector<Profile*>::iterator i = profiles.begin();\n      i != profiles.end(); i++) {\n    Profile* profile = *i;\n    CloseIdleConnectionsForProfile(profile->GetRequestContext());\n    if (profile->HasOffTheRecordProfile()) {\n      CloseIdleConnectionsForProfile(\n          profile->GetOffTheRecordProfile()->GetRequestContext());\n    }\n  }\n}\n\nbool RegisterProcessUtils(JNIEnv* env) {\n  return RegisterNativesImpl(env);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef BUFFERED_ISTREAM_HPP\n#define BUFFERED_ISTREAM_HPP\n\n#include <fstream>\n#include <sstream>\n\nnamespace flags {\n  enum buffered_istream_flags { none = 0, sharp_comment = 1 };\n}\n\nclass buffered_istream {\nprotected:\n  std::istream* ist;\n  std::stringstream*  str;\n  flags::buffered_istream_flags flag;\npublic:\n  buffered_istream(std::istream* i = 0, flags::buffered_istream_flags f = flags::none);\n  virtual ~buffered_istream();\n  buffered_istream& open(std::istream* i);\n  buffered_istream& close();\n\n  std::string next();\n  std::string current() const;\n  buffered_istream& rewind();\n  template <typename T> buffered_istream& operator>> (T& val);\n\n  inline bool good() const { return ist->good(); }\n  inline bool fail() const { return ist->fail(); }\n  inline bool eof () const { return ist->eof(); }\n  buffered_istream& set_flags(flags::buffered_istream_flags f = flags::none);\n};\n\nbuffered_istream::buffered_istream(std::istream* i, flags::buffered_istream_flags f){\n  if(i) open(i);\n  str = new std::stringstream(std::stringstream::in | std::stringstream::out);\n  str->setstate(std::ios::eofbit);\n  set_flags(f);\n}\n\nbuffered_istream::~buffered_istream(){\n  if(str)   delete str;\n}\n\nbuffered_istream& buffered_istream::open(std::istream* ist_in){\n  ist = ist_in;\n  return *this;\n}\n\nbuffered_istream& buffered_istream::close(){\n  ist = 0;\n  str->clear();\n  str->str(\"\");\n  return *this;\n}\n\nstd::string buffered_istream::next(){\n  str->clear();\n  str->str(\"\");\n  char s;\n  bool ignore = false;\n  while(true){\n    s = ist->get();\n    if(ist->eof()) break;\n    if((flag & flags::sharp_comment)){\n      if(s == '#'){\n        ignore = true;\n      }else if(s == 10 or s == 13){\n        ignore = false; \/\/ to put CR\/LF\n      }\n    }\n    if(not ignore) str->put(s);\n    if(s == 10 or s == 13) break; \/\/ CR or LF\n  }\n  return str->str();\n}\n\nstd::string buffered_istream::current() const {\n  return str->str();\n}\n\nbuffered_istream& buffered_istream::rewind() {\n  str->clear();\n  str->seekg(0, str->beg);\n  return *this;\n}\n\ntemplate <typename T> buffered_istream& buffered_istream::operator>> (T& val) {\n  *str >> val;\n  if(str->eof()){\n    next();\n    if(ist->eof()){ \/\/ next fails and everything is done.\n      return *this;\n    }\n    return *this >> val;\n  }\n  return *this;\n}\n\nbuffered_istream& buffered_istream::set_flags(flags::buffered_istream_flags f){\n  flag = f;\n  return *this;\n}\n\n\nclass buffered_ifstream : public buffered_istream{\nprivate:\n  std::ifstream* file;\npublic:\n  buffered_ifstream(const char *filename, flags::buffered_istream_flags f = flags::none);\n  virtual ~buffered_ifstream();\n  buffered_ifstream& open(const char* filename);\n  buffered_ifstream& close();\n};\n\nbuffered_ifstream::buffered_ifstream(const char *filename, flags::buffered_istream_flags f){\n  open(filename);\n  set_flags(f);\n}\n\nbuffered_ifstream::~buffered_ifstream(){\n  if(file){\n    file->close();\n    delete file;\n  }\n}\n\nbuffered_ifstream& buffered_ifstream::open(const char* filename){\n  file = new std::ifstream(filename, std::ios::in);\n  buffered_istream::open(file);\n  return *this;\n}\n\nbuffered_ifstream& buffered_ifstream::close(){\n  file->close();\n  delete file;\n  file = 0;\n  buffered_istream::close();\n  return *this;\n}\n\n#endif\n<commit_msg>supress conversion<commit_after>#ifndef BUFFERED_ISTREAM_HPP\n#define BUFFERED_ISTREAM_HPP\n\n#include <fstream>\n#include <sstream>\n\nnamespace flags {\n  enum buffered_istream_flags { none = 0, sharp_comment = 1 };\n}\n\nclass buffered_istream {\nprotected:\n  std::istream* ist;\n  std::stringstream*  str;\n  flags::buffered_istream_flags flag;\npublic:\n  buffered_istream(std::istream* i = 0, flags::buffered_istream_flags f = flags::none);\n  virtual ~buffered_istream();\n  buffered_istream& open(std::istream* i);\n  buffered_istream& close();\n\n  std::string next();\n  std::string current() const;\n  buffered_istream& rewind();\n  template <typename T> buffered_istream& operator>> (T& val);\n\n  inline bool good() const { return ist->good(); }\n  inline bool fail() const { return ist->fail(); }\n  inline bool eof () const { return ist->eof(); }\n  buffered_istream& set_flags(flags::buffered_istream_flags f = flags::none);\n};\n\nbuffered_istream::buffered_istream(std::istream* i, flags::buffered_istream_flags f){\n  if(i) open(i);\n  str = new std::stringstream(std::stringstream::in | std::stringstream::out);\n  str->setstate(std::ios::eofbit);\n  set_flags(f);\n}\n\nbuffered_istream::~buffered_istream(){\n  if(str)   delete str;\n}\n\nbuffered_istream& buffered_istream::open(std::istream* ist_in){\n  ist = ist_in;\n  return *this;\n}\n\nbuffered_istream& buffered_istream::close(){\n  ist = 0;\n  str->clear();\n  str->str(\"\");\n  return *this;\n}\n\nstd::string buffered_istream::next(){\n  str->clear();\n  str->str(\"\");\n  char s;\n  bool ignore = false;\n  while(true){\n    ist->get(s);\n    if(ist->eof()) break;\n    if((flag & flags::sharp_comment)){\n      if(s == '#'){\n        ignore = true;\n      }else if(s == 10 or s == 13){\n        ignore = false; \/\/ to put CR\/LF\n      }\n    }\n    if(not ignore) str->put(s);\n    if(s == 10 or s == 13) break; \/\/ CR or LF\n  }\n  return str->str();\n}\n\nstd::string buffered_istream::current() const {\n  return str->str();\n}\n\nbuffered_istream& buffered_istream::rewind() {\n  str->clear();\n  str->seekg(0, str->beg);\n  return *this;\n}\n\ntemplate <typename T> buffered_istream& buffered_istream::operator>> (T& val) {\n  *str >> val;\n  if(str->eof()){\n    next();\n    if(ist->eof()){ \/\/ next fails and everything is done.\n      return *this;\n    }\n    return *this >> val;\n  }\n  return *this;\n}\n\nbuffered_istream& buffered_istream::set_flags(flags::buffered_istream_flags f){\n  flag = f;\n  return *this;\n}\n\n\nclass buffered_ifstream : public buffered_istream{\nprivate:\n  std::ifstream* file;\npublic:\n  buffered_ifstream(const char *filename, flags::buffered_istream_flags f = flags::none);\n  virtual ~buffered_ifstream();\n  buffered_ifstream& open(const char* filename);\n  buffered_ifstream& close();\n};\n\nbuffered_ifstream::buffered_ifstream(const char *filename, flags::buffered_istream_flags f){\n  open(filename);\n  set_flags(f);\n}\n\nbuffered_ifstream::~buffered_ifstream(){\n  if(file){\n    file->close();\n    delete file;\n  }\n}\n\nbuffered_ifstream& buffered_ifstream::open(const char* filename){\n  file = new std::ifstream(filename, std::ios::in);\n  buffered_istream::open(file);\n  return *this;\n}\n\nbuffered_ifstream& buffered_ifstream::close(){\n  file->close();\n  delete file;\n  file = 0;\n  buffered_istream::close();\n  return *this;\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \tResult.cpp\n * \n * \tClass representing a MySQL result set\n * \n * \t@copyright 2014 Copernica BV\n *\/\n\n\/**\n *  Dependencies\n *\/\n#include \"result.h\"\n#include <iostream>\n\n\/**\n *  Set up namespace\n *\/\nnamespace ReactPhp {\n\t\n\/**\n *  Retrieve row at given offset\n *\/\nvoid Result::fetchRow(Php::Parameters &params)\n{\n\t\/\/ retrieve the parameter\n\tint index = params[0];\n\t\t\n\t\/\/ check for valid input\n\tif(index > (int)_result.size() || index < 0) throw Php::Exception(\"Invalid result object\");\n\t\t\n\tfor (auto field : _result[index])\n\t{\n\t\t\/\/ print the rows to the screen\n\t\tstd::cout << field.first << \" => \" << field.second << std::endl;\n\t}\n}\n\n\/**\n *  Is this a valid result?\n *\/\nPhp::Value Result::valid()\n{\n\t_result.valid();\n\t\t\n\treturn true;\n}\n\t\n\/**\n *  The number of rows affected\n *\/\nsize_t Result::affectedRows()\n{\n\treturn (int)_result.affectedRows();\n}\n\n\/**\n *  Get the number of rows in this result\n *\/\nPhp::Value Result::size()\n{\n\treturn (int)_result.size();\n}\n\t\n\/**\n *  Retrieve iterator for first row\n *\/\nPhp::Value Result::begin()\n{\n\t_result.begin();\n\t\t\n\treturn true;\n}\n \n\/**\n *  Retrieve iterator past the end\n *\/\nPhp::Value Result::end()\n{\n\t_result.end();\n\t\t\n\treturn true;\n}\n\n\/**\n *   End of namespace\n *\/\t\n}\n<commit_msg>Class representing a MySQL result set<commit_after>\/**\n *  Result.cpp\n * \n *  Class representing a MySQL result set\n * \n *  @copyright 2014 Copernica BV\n *\/\n\n\/**\n *  Dependencies\n *\/\n#include \"result.h\"\n#include <iostream>\n\n\/**\n *  Set up namespace\n *\/\nnamespace ReactPhp {\n\t\n\/**\n *  Retrieve row at given offset\n *\/\nvoid Result::fetchRow(Php::Parameters &params)\n{\n\t\/\/ retrieve the parameter\n\tint index = params[0];\n\t\t\n\t\/\/ check for valid input\n\tif(index > (int)_result.size() || index < 0) throw Php::Exception(\"Invalid result object\");\n\t\t\n\tfor (auto field : _result[index])\n\t{\n\t\t\/\/ print the rows to the screen\n\t\tstd::cout << field.first << \" => \" << field.second << std::endl;\n\t}\n}\n\n\/**\n *  Is this a valid result?\n *\/\nPhp::Value Result::valid()\n{\n\t_result.valid();\n\t\t\n\treturn true;\n}\n\t\n\/**\n *  The number of rows affected\n *\/\nsize_t Result::affectedRows()\n{\n\treturn (int)_result.affectedRows();\n}\n\n\/**\n *  Get the number of rows in this result\n *\/\nPhp::Value Result::size()\n{\n\treturn (int)_result.size();\n}\n\t\n\/**\n *  Retrieve iterator for first row\n *\/\nPhp::Value Result::begin()\n{\n\t_result.begin();\n\t\t\n\treturn true;\n}\n \n\/**\n *  Retrieve iterator past the end\n *\/\nPhp::Value Result::end()\n{\n\t_result.end();\n\t\t\n\treturn true;\n}\n\n\/**\n *   End of namespace\n *\/\t\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"FrequencyInModule.h\"\n#include \"ModularSynth.h\"\n\nFrequencyInModule::FrequencyInModule(ModularSynth& synth)\n\t:SynthModule(synth, moduleId, 0, 1, 0)\n{\n}\n\nvoid FrequencyInModule::cycle()\n{\n\tsetOutput(0, mSynth.getFrequency());\n}\n\n\n\nconst char * FrequencyInModule::getInputName(int input) const \n{\n\treturn \"FrequencyIn\";\n}\n\n\nconst char * FrequencyInModule::getOutputName(int output) const \n{\n\treturn \"Output\";\n}\n\n\nconst char * FrequencyInModule::getName() const\n{\n\treturn \"FrequencyIn\";\n}\n\nSynthModule * FrequencyInModule::createModule(ModularSynth& synth)\n{\n\treturn new FrequencyInModule(synth);\n}\n<commit_msg>Absolute frequency output for FrequencyIn<commit_after>#include \"FrequencyInModule.h\"\n#include \"ModularSynth.h\"\n\nFrequencyInModule::FrequencyInModule(ModularSynth& synth)\n\t:SynthModule(synth, moduleId, 0, 2, 0)\n{\n}\n\nvoid FrequencyInModule::cycle()\n{\n\tsetOutput(0, mSynth.getFrequency());\n\tsetOutput(1, mSynth.getFrequency() * mSampleRate);\n}\n\n\n\nconst char * FrequencyInModule::getInputName(int input) const \n{\n\treturn \"FrequencyIn\";\n}\n\n\nconst char * FrequencyInModule::getOutputName(int output) const \n{\n\tstatic const char *names[] = {\"Output\", \"SOutput\"};\n\treturn names[output];\n}\n\n\nconst char * FrequencyInModule::getName() const\n{\n\treturn \"FrequencyIn\";\n}\n\nSynthModule * FrequencyInModule::createModule(ModularSynth& synth)\n{\n\treturn new FrequencyInModule(synth);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"types.h\"\n#include \"stat.h\"\n#include \"user.h\"\n#include \"mtrace.h\"\n\n#define NCHILD 2\n#define NDEPTH 5\n\nvoid\nforktree(void)\n{\n  int depth = 0;\n\n  fprintf(1, \"%d: fork tree\\n\", getpid());\n  mtenable(\"xv6-forktree\");\n\n next_level:\n  \/\/printf(1, \"pid %d, depth %d\\n\", getpid(), depth);\n  if (depth >= NDEPTH)\n    exit();\n\n  for (int i = 0; i < NCHILD; i++) {\n    int pid = fork(0);\n    if (pid < 0) {\n      fprintf(1, \"fork error\\n\");\n      exit();\n    }\n\n    if (pid == 0) {\n      depth++;\n      goto next_level;\n    }\n  }\n\n  for (int i = 0; i < NCHILD; i++) {\n    if (wait() < 0) {\n      fprintf(1, \"wait stopped early\\n\");\n      exit();\n    }\n  }\n  \n  if (wait() != -1) {\n    fprintf(1, \"wait got too many\\n\");\n    exit();\n  }\n\n  if (depth > 0)\n    exit();\n\n  mtops(0);\n  mtdisable(\"xv6-forktree\");\n  \n  fprintf(1, \"%d: fork tree OK\\n\", getpid());\n  \/\/ halt();\n}\n\nint\nmain(void)\n{\n  forktree();\n  exit();\n}\n<commit_msg>Remove mtrace enable\/disable<commit_after>#include \"types.h\"\n#include \"stat.h\"\n#include \"user.h\"\n\n#define NCHILD 2\n#define NDEPTH 5\n\nvoid\nforktree(void)\n{\n  int depth = 0;\n\n  fprintf(1, \"%d: fork tree\\n\", getpid());\n\n next_level:\n  \/\/printf(1, \"pid %d, depth %d\\n\", getpid(), depth);\n  if (depth >= NDEPTH)\n    exit();\n\n  for (int i = 0; i < NCHILD; i++) {\n    int pid = fork(0);\n    if (pid < 0) {\n      fprintf(1, \"fork error\\n\");\n      exit();\n    }\n\n    if (pid == 0) {\n      depth++;\n      goto next_level;\n    }\n  }\n\n  for (int i = 0; i < NCHILD; i++) {\n    if (wait() < 0) {\n      fprintf(1, \"wait stopped early\\n\");\n      exit();\n    }\n  }\n  \n  if (wait() != -1) {\n    fprintf(1, \"wait got too many\\n\");\n    exit();\n  }\n\n  if (depth > 0)\n    exit();\n\n  fprintf(1, \"%d: fork tree OK\\n\", getpid());\n  \/\/ halt();\n}\n\nint\nmain(void)\n{\n  forktree();\n  exit();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright DaiMysha (c) 2015, All rights reserved.\nDaiMysha@gmail.com\nhttps:\/\/github.com\/DaiMysha\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\nRedistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\nRedistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation\nand\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS\nBE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\nGOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\nLIABILITY, 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\n#include <iostream>\n\n#include <SFML\/OpenGL.hpp>\n\n#include <DMUtils\/sfml.hpp>\n\n#include <LightSystem\/LightSystem.hpp>\n\nnamespace DMGDVT {\nnamespace LS {\n\n    const sf::RenderStates LightSystem::_multiplyState(sf::BlendMultiply);\n    const sf::RenderStates LightSystem::_addState(sf::BlendAdd);\n    \/\/const sf::RenderStates LightSystem::_subtractState(sf::BlendMode(sf::BlendMode::One, sf::BlendMode::One, sf::BlendMode::ReverseSubtract));\n    const sf::RenderStates LightSystem::_subtractState(sf::BlendMode(sf::BlendMode::Zero, sf::BlendMode::OneMinusSrcColor, sf::BlendMode::Add));\n\n    LightSystem::LightSystem(bool isometric) : _ambiant(sf::Color::Black), _isometric(isometric), _autoDelete(true) {\n        \/\/this will be loaded from internal memory when lib is created\n        \/\/or loaded external crypted\n        \/\/the idea is not to allow the user to modify it\n        if(!_lightAttenuationShader.loadFromFile(\"shaders\/lightAttenuation.frag\",sf::Shader::Fragment)) {\n            std::cerr << \"Missing light attenuation Shader. System won't work\" << std::endl;\n        }\n\n    }\n\n    LightSystem::~LightSystem() {\n        reset();\n    }\n\n    void LightSystem::addLight(Light* l) {\n        l->preRender(&_lightAttenuationShader);\n        l->setIsometric(_isometric);\/\/ignore what user set before\n        if(l->isNegative()) _negativeLights.emplace_back(l);\n        else _lights.emplace_back(l);\n\n        std::cout << \"neg size : \" << _negativeLights.size() << \" ; pos size : \" << _lights.size() << std::endl;\n    }\n\n    void LightSystem::removeLight(Light* l) {\n        if(l->isNegative()) _negativeLights.remove(l);\n        else _lights.remove(l);\n    }\n\n    void LightSystem::reset() {\n        if(_autoDelete) for(Light* l : _lights) delete l;\n\n        _lights.empty();\n    }\n\n    void LightSystem::render(const sf::View& screenView, sf::RenderTarget& target) {\n        debugRender(screenView,target,LightSystem::DEBUG_FLAGS::DEFAULT);\n    }\n\n    void LightSystem::debugRender(const sf::View& screenView, sf::RenderTarget& target, int flags) {\n        sf::IntRect screen = DMUtils::sfml::getViewInWorldAABB(screenView);\n\n        _sprite.setPosition(screen.left,screen.top);\n\n        _renderTexture.clear(_ambiant);\n        sf::RenderStates stAdd(_addState);\n        sf::RenderStates stRm(_subtractState);\n        sf::Transform t;\n        t.translate(-_sprite.getPosition());\n        stAdd.transform = t;\n        stRm.transform = t;\n        for(Light* l : _lights) {\n            if(l->getAABB().intersects(screen)) {\n                if(flags & DEBUG_FLAGS::SHADER_OFF) l->debugRender(_renderTexture,(stAdd));\n                else l->render(screen,_renderTexture,&_lightAttenuationShader,(stAdd));\n            }\n        }\n        for(Light* l : _negativeLights) {\n            if(l->getAABB().intersects(screen)) {\n                if(flags & DEBUG_FLAGS::SHADER_OFF) l->debugRender(_renderTexture,(stRm));\n                else l->render(screen,_renderTexture,&_lightAttenuationShader,(stRm));\n            }\n        }\n\n        _renderTexture.display();\n\n        if(flags & DEBUG_FLAGS::LIGHTMAP_ONLY) target.clear(sf::Color::White);\n    }\n\n    void LightSystem::draw(const sf::View& screenView, sf::RenderTarget& target) {\n        target.draw(_sprite,_multiplyState);\n    }\n\n    void LightSystem::drawAABB(const sf::View& screen, sf::RenderTarget& target) {\n        drawAABB(DMUtils::sfml::getViewInWorldAABB(screen),target);\n    }\n\n    void LightSystem::drawAABB(const sf::IntRect& screen, sf::RenderTarget& target) {\n        for(Light* l : _lights) {\n            if(l->getAABB().intersects(screen)) l->drawAABB(screen,target);\n        }\n    }\n\n    void LightSystem::update() {\n        for(Light* l : _lights) update(l);\n    }\n\n    void LightSystem::update(Light* l) {\n        bool wasNegative = l->isNegative();\n        l->preRender(&_lightAttenuationShader);\n        bool isNegative = l->isNegative();\n        if(wasNegative xor isNegative) {\n            if(isNegative) {\n                _lights.remove(l);\n                _negativeLights.emplace_back(l);\n            } else {\n                _negativeLights.remove(l);\n                _lights.emplace_back(l);\n            }\n        }\n    }\n\n    size_t LightSystem::getLightsCount() const {\n        return getNormalLightsCount() + getNegativeLightsCount();\n    }\n\n    size_t LightSystem::getNormalLightsCount() const {\n        return _lights.size();\n    }\n\n    size_t LightSystem::getNegativeLightsCount() const {\n        return _negativeLights.size();\n    }\n\n    sf::Image LightSystem::getLightMap() const {\n        return _renderTexture.getTexture().copyToImage();\n    }\n\n    sf::Color LightSystem::getLightMapPixel(int x, int y) const {\n        return getLightMap().getPixel(x,y);\n    }\n\n    sf::Color LightSystem::getLightMapPixel(sf::Vector2f p) const {\n        return getLightMapPixel(p.x,p.y);\n    }\n\n    void LightSystem::setAmbiantLight(sf::Color c) {\n        _ambiant = c;\n    }\n\n    sf::Color LightSystem::getAmbiantLight() const {\n        return _ambiant;\n    }\n\n    void LightSystem::setIsometric(bool i) {\n        _isometric = i;\n        for(Light* l : _lights) {\n            l->setIsometric(_isometric);\n            update(l);\n        }\n    }\n\n    bool LightSystem::isIsometric() const {\n        return _isometric;\n    }\n\n    void LightSystem::setAutoDelete(bool ad) {\n        _autoDelete = ad;\n    }\n\n    void LightSystem::setView(const sf::View& view) {\n        _renderTexture.create(view.getSize().x,view.getSize().y);\n        _sprite.setTexture(_renderTexture.getTexture());\n    }\n}\n}\n<commit_msg>Removed debug output<commit_after>\/*\nCopyright DaiMysha (c) 2015, All rights reserved.\nDaiMysha@gmail.com\nhttps:\/\/github.com\/DaiMysha\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\nRedistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\nRedistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation\nand\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS\nBE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\nGOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\nLIABILITY, 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\n#include <iostream>\n\n#include <SFML\/OpenGL.hpp>\n\n#include <DMUtils\/sfml.hpp>\n\n#include <LightSystem\/LightSystem.hpp>\n\nnamespace DMGDVT {\nnamespace LS {\n\n    const sf::RenderStates LightSystem::_multiplyState(sf::BlendMultiply);\n    const sf::RenderStates LightSystem::_addState(sf::BlendAdd);\n    \/\/const sf::RenderStates LightSystem::_subtractState(sf::BlendMode(sf::BlendMode::One, sf::BlendMode::One, sf::BlendMode::ReverseSubtract));\n    const sf::RenderStates LightSystem::_subtractState(sf::BlendMode(sf::BlendMode::Zero, sf::BlendMode::OneMinusSrcColor, sf::BlendMode::Add));\n\n    LightSystem::LightSystem(bool isometric) : _ambiant(sf::Color::Black), _isometric(isometric), _autoDelete(true) {\n        \/\/this will be loaded from internal memory when lib is created\n        \/\/or loaded external crypted\n        \/\/the idea is not to allow the user to modify it\n        if(!_lightAttenuationShader.loadFromFile(\"shaders\/lightAttenuation.frag\",sf::Shader::Fragment)) {\n            std::cerr << \"Missing light attenuation Shader. System won't work\" << std::endl;\n        }\n\n    }\n\n    LightSystem::~LightSystem() {\n        reset();\n    }\n\n    void LightSystem::addLight(Light* l) {\n        l->preRender(&_lightAttenuationShader);\n        l->setIsometric(_isometric);\/\/ignore what user set before\n        if(l->isNegative()) _negativeLights.emplace_back(l);\n        else _lights.emplace_back(l);\n    }\n\n    void LightSystem::removeLight(Light* l) {\n        if(l->isNegative()) _negativeLights.remove(l);\n        else _lights.remove(l);\n    }\n\n    void LightSystem::reset() {\n        if(_autoDelete) for(Light* l : _lights) delete l;\n\n        _lights.empty();\n    }\n\n    void LightSystem::render(const sf::View& screenView, sf::RenderTarget& target) {\n        debugRender(screenView,target,LightSystem::DEBUG_FLAGS::DEFAULT);\n    }\n\n    void LightSystem::debugRender(const sf::View& screenView, sf::RenderTarget& target, int flags) {\n        sf::IntRect screen = DMUtils::sfml::getViewInWorldAABB(screenView);\n\n        _sprite.setPosition(screen.left,screen.top);\n\n        _renderTexture.clear(_ambiant);\n        sf::RenderStates stAdd(_addState);\n        sf::RenderStates stRm(_subtractState);\n        sf::Transform t;\n        t.translate(-_sprite.getPosition());\n        stAdd.transform = t;\n        stRm.transform = t;\n        for(Light* l : _lights) {\n            if(l->getAABB().intersects(screen)) {\n                if(flags & DEBUG_FLAGS::SHADER_OFF) l->debugRender(_renderTexture,(stAdd));\n                else l->render(screen,_renderTexture,&_lightAttenuationShader,(stAdd));\n            }\n        }\n        for(Light* l : _negativeLights) {\n            if(l->getAABB().intersects(screen)) {\n                if(flags & DEBUG_FLAGS::SHADER_OFF) l->debugRender(_renderTexture,(stRm));\n                else l->render(screen,_renderTexture,&_lightAttenuationShader,(stRm));\n            }\n        }\n\n        _renderTexture.display();\n\n        if(flags & DEBUG_FLAGS::LIGHTMAP_ONLY) target.clear(sf::Color::White);\n    }\n\n    void LightSystem::draw(const sf::View& screenView, sf::RenderTarget& target) {\n        target.draw(_sprite,_multiplyState);\n    }\n\n    void LightSystem::drawAABB(const sf::View& screen, sf::RenderTarget& target) {\n        drawAABB(DMUtils::sfml::getViewInWorldAABB(screen),target);\n    }\n\n    void LightSystem::drawAABB(const sf::IntRect& screen, sf::RenderTarget& target) {\n        for(Light* l : _lights) {\n            if(l->getAABB().intersects(screen)) l->drawAABB(screen,target);\n        }\n    }\n\n    void LightSystem::update() {\n        for(Light* l : _lights) update(l);\n    }\n\n    void LightSystem::update(Light* l) {\n        bool wasNegative = l->isNegative();\n        l->preRender(&_lightAttenuationShader);\n        bool isNegative = l->isNegative();\n        if(wasNegative xor isNegative) {\n            if(isNegative) {\n                _lights.remove(l);\n                _negativeLights.emplace_back(l);\n            } else {\n                _negativeLights.remove(l);\n                _lights.emplace_back(l);\n            }\n        }\n    }\n\n    size_t LightSystem::getLightsCount() const {\n        return getNormalLightsCount() + getNegativeLightsCount();\n    }\n\n    size_t LightSystem::getNormalLightsCount() const {\n        return _lights.size();\n    }\n\n    size_t LightSystem::getNegativeLightsCount() const {\n        return _negativeLights.size();\n    }\n\n    sf::Image LightSystem::getLightMap() const {\n        return _renderTexture.getTexture().copyToImage();\n    }\n\n    sf::Color LightSystem::getLightMapPixel(int x, int y) const {\n        return getLightMap().getPixel(x,y);\n    }\n\n    sf::Color LightSystem::getLightMapPixel(sf::Vector2f p) const {\n        return getLightMapPixel(p.x,p.y);\n    }\n\n    void LightSystem::setAmbiantLight(sf::Color c) {\n        _ambiant = c;\n    }\n\n    sf::Color LightSystem::getAmbiantLight() const {\n        return _ambiant;\n    }\n\n    void LightSystem::setIsometric(bool i) {\n        _isometric = i;\n        for(Light* l : _lights) {\n            l->setIsometric(_isometric);\n            update(l);\n        }\n    }\n\n    bool LightSystem::isIsometric() const {\n        return _isometric;\n    }\n\n    void LightSystem::setAutoDelete(bool ad) {\n        _autoDelete = ad;\n    }\n\n    void LightSystem::setView(const sf::View& view) {\n        _renderTexture.create(view.getSize().x,view.getSize().y);\n        _sprite.setTexture(_renderTexture.getTexture());\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 (2014 - 2018)\n\/\/   René Fritze     (2016, 2018)\n\n#ifndef DUNE_GDT_EXCEPTIONS_HH\n#define DUNE_GDT_EXCEPTIONS_HH\n\n#include <dune\/xt\/common\/exceptions.hh>\n#include <dune\/xt\/la\/exceptions.hh>\n#include <dune\/xt\/grid\/exceptions.hh>\n#include <dune\/xt\/functions\/exceptions.hh>\n\nnamespace Dune {\nnamespace GDT {\nnamespace Exceptions {\n\n\nclass not_bound_to_an_element_yet : public XT::Grid::Exceptions::not_bound_to_an_element_yet\n{};\n\nclass dof_vector_error : public Exception\n{};\n\nclass integrand_error : public Exception\n{};\n\nclass assembler_error : public Exception\n{};\n\nclass functional_error : public Exception\n{};\n\nclass numerical_flux_error : public Exception\n{};\n\nclass operator_error : public Exception\n{};\n\nclass prolongation_error : public operator_error\n{};\n\nclass projection_error : public operator_error\n{};\n\nclass finite_element_error : public Exception\n{};\n\nclass space_error : public Exception\n{};\n\nclass restricted_space_error : public space_error\n{};\n\nclass mapper_error : public space_error\n{};\n\nclass basis_error : public space_error\n{};\n\nclass discrete_function_error : public Exception\n{};\n\nclass newton_error : public Exception\n{};\n\n\n} \/\/ namespace Exceptions\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_EXCEPTIONS_HH\n<commit_msg>[exceptions] add interpolation_error<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 (2014 - 2018)\n\/\/   René Fritze     (2016, 2018)\n\n#ifndef DUNE_GDT_EXCEPTIONS_HH\n#define DUNE_GDT_EXCEPTIONS_HH\n\n#include <dune\/xt\/common\/exceptions.hh>\n#include <dune\/xt\/la\/exceptions.hh>\n#include <dune\/xt\/grid\/exceptions.hh>\n#include <dune\/xt\/functions\/exceptions.hh>\n\nnamespace Dune {\nnamespace GDT {\nnamespace Exceptions {\n\n\nclass not_bound_to_an_element_yet : public XT::Grid::Exceptions::not_bound_to_an_element_yet\n{};\n\nclass dof_vector_error : public Exception\n{};\n\nclass integrand_error : public Exception\n{};\n\nclass assembler_error : public Exception\n{};\n\nclass functional_error : public Exception\n{};\n\nclass numerical_flux_error : public Exception\n{};\n\nclass operator_error : public Exception\n{};\n\nclass interpolation_error : public operator_error\n{};\n\nclass prolongation_error : public operator_error\n{};\n\nclass projection_error : public operator_error\n{};\n\nclass finite_element_error : public Exception\n{};\n\nclass space_error : public Exception\n{};\n\nclass restricted_space_error : public space_error\n{};\n\nclass mapper_error : public space_error\n{};\n\nclass basis_error : public space_error\n{};\n\nclass discrete_function_error : public Exception\n{};\n\nclass newton_error : public Exception\n{};\n\n\n} \/\/ namespace Exceptions\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_EXCEPTIONS_HH\n<|endoftext|>"}
{"text":"<commit_before>#include <QtTest>\n#include <QtWidgets>\n#include <DO\/Graphics\/DerivedQObjects\/PaintingWindow.hpp>\n\nQ_DECLARE_METATYPE(DO::Event);\n\nusing namespace DO;\n\nclass TestPaintingWindowConstructors: public QObject\n{\n  Q_OBJECT\n\nprivate slots:\n  void test_construction_of_PaintingWindow_with_small_size()\n  {\n    int width = 50;\n    int height = 50;\n    QString windowName = \"painting window\";\n    int x = 200;\n    int y = 300;\n\n    PaintingWindow *window = new PaintingWindow(width, height,\n                                                windowName,\n                                                x, y);\n\n    QCOMPARE(window->width(), width);\n    QCOMPARE(window->height(), height);\n    QCOMPARE(window->windowTitle(), windowName);\n#ifndef __APPLE__\n    \/\/ Strangely, when we have 2 monitor screens, this fails on Mac OS X...\n    QCOMPARE(window->x(), x);\n    QCOMPARE(window->y(), y);\n#endif\n    QVERIFY(window->isVisible());\n\n    window->deleteLater();\n  }\n\n  void test_construction_of_PaintingWindow_with_size_larger_than_desktop()\n  {\n    int width = qApp->desktop()->width();\n    int height = qApp->desktop()->height();\n\n    PaintingWindow *window = new PaintingWindow(width, height);\n\n    QVERIFY(window->scrollArea()->isMaximized());\n    QVERIFY(window->isVisible());\n\n    window->deleteLater();\n  }\n};\n\nclass TestPaintingWindowDrawMethods: public QObject\n{\n  Q_OBJECT\n\nprivate: \/\/ data members\n  PaintingWindow *test_window_;\n  QImage true_image_;\n  QPainter painter_;\n\nprivate: \/\/ methods\n  QImage get_image_from_window()\n  {\n    QImage image(test_window_->size(), QImage::Format_RGB32);\n    test_window_->render(&image, QPoint(), QRegion(QRect(QPoint(),\n                         test_window_->size())));\n    return image;\n  }\n\nprivate slots:\n  void initTestCase()\n  {\n    test_window_ = new PaintingWindow(300, 300);\n    true_image_ =  QImage(test_window_->size(), QImage::Format_RGB32);\n  }\n\n  void init()\n  {\n    test_window_->clear();\n    true_image_.fill(Qt::white);\n    painter_.begin(&true_image_);\n  }\n\n  void cleanup()\n  {\n    painter_.end();\n  }\n\n  void cleanupTestCase()\n  {\n    test_window_->deleteLater();\n  }\n\n  void test_drawPoint_using_integer_coordinates()\n  {\n    int x = 150, y = 100;\n    QColor color(255, 0, 0);\n\n    test_window_->drawPoint(x, y, color);\n\n    painter_.setPen(color);\n    painter_.drawPoint(QPoint(x, y));\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawPoint_using_QPointF()\n  {\n    double x = 150.95, y = 100.3333;\n    QColor color(0, 225, 0);\n\n    test_window_->drawPoint(QPointF(x, y), color);\n\n    painter_.setPen(color);\n    painter_.drawPoint(QPointF(x, y));\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawLine_using_integer_coordinates()\n  {\n    int x1 = 100, y1 = 100;\n    int x2 = 200, y2 = 240;\n    QColor color(0, 255, 0);\n    int thickness = 3;\n\n    test_window_->drawLine(x1, y1, x2, y2, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawLine(x1, y1, x2, y2);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawLine_using_QPointF()\n  {\n    QPointF p1(100.350, 100.699);\n    QPointF p2(203.645, 240.664);\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawLine(p1, p2, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawLine(p1, p2);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawCircle_using_integer_coordinates()\n  {\n    int xc = 150, yc = 123;\n    int r = 39;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawCircle(xc, yc, r, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawEllipse(QPoint(xc, yc), r, r);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawCircle_using_Circle_using_QPointF()\n  {\n    QPointF c(150.999, 123.231);\n    int r = 39;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawCircle(c, r, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawEllipse(c, r, r);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawEllipse_using_axis_aligned_bounding_box()\n  {\n    \/\/ Axis-aligned ellipse defined by the following axis-aligned bounding box.\n    int x = 150, y = 123;\n    int w = 39, h = 100;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawEllipse(x, y, w, h, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawEllipse(x, y, w, h);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawEllipse_with_center_and_semi_axes_and_orientation()\n  {\n    QPointF center(123.123, 156.123);\n    qreal r1 = 100.13, r2 = 40.12;\n    qreal oriDegree = 48.65;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawEllipse(center, r1, r2, oriDegree, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.translate(center);\n    painter_.rotate(oriDegree);\n    painter_.translate(-r1, -r2);\n    painter_.drawEllipse(QRectF(0, 0, 2*r1, 2*r2));\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawRect()\n  {\n    int x = 150, y = 123;\n    int w = 39, h = 100;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->clear();\n    test_window_->drawRect(x, y, w, h, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawRect(x, y, w, h);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawPoly()\n  {\n    QPolygonF polygon;\n    polygon << QPointF(10, 10) << QPointF(250, 20) << QPointF(150, 258);\n\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawPoly(polygon, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawPolygon(polygon);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawText()\n  {\n    \/\/ What text.\n    QString text(\"DO-CV is awesome!\");\n    \/\/ Where.\n    int x = 130, y = 150;\n    double orientation = 36.6;\n    \/\/ Style.\n    QColor color(0, 255, 123);\n    int fontSize = 15;\n    bool italic = true;\n    bool bold = true;\n    bool underline = true;\n\n    test_window_->drawText(x, y, text, color, fontSize, orientation, italic,\n                           bold, underline);\n\n    painter_.setPen(color);\n\n    QFont font;\n    font.setPointSize(fontSize);\n    font.setItalic(italic);\n    font.setBold(bold);\n    font.setUnderline(underline);\n    painter_.setFont(font);\n\n    painter_.translate(x, y);\n    painter_.rotate(orientation);\n    painter_.drawText(0, 0, text);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  \/\/ TODO: make this test more exhaustive.\n  void test_drawArrow()\n  {\n    int x1 = 150, y1 = 150;\n    int x2 = 200, y2 = 200;\n\n    QColor color(0, 255, 123);\n    int arrowWidth = 3, arrowHeight = 5;\n    int style = 0;\n    int width = 3;\n\n    test_window_->drawArrow(x1, y1, x2, y2, color, arrowWidth, arrowHeight,\n                            style, width);\n\n    QImage image(get_image_from_window());\n    for (int x = 150; x < 200; ++x)\n      QCOMPARE(image.pixel(x,x), color.rgb());\n  }\n\n  void test_display()\n  {\n    int w = 20, h = 20;\n    QImage patch(QSize(w, h), QImage::Format_RGB32);\n    patch.fill(Qt::red);\n    int x_offset = 20, y_offset = 30;\n    double zoom_factor = 2.;\n\n    test_window_->display(patch, x_offset, y_offset, zoom_factor);\n\n    QImage image(get_image_from_window());\n    for (int y = 0; y < image.height(); ++y)\n      for (int x = 0; x < image.width(); ++x)\n        if ( x >= x_offset && x < x_offset+zoom_factor*w && \n             y >= y_offset && y < y_offset+zoom_factor*h )\n          QCOMPARE(image.pixel(x, y), QColor(Qt::red).rgb());\n        else\n          QCOMPARE(image.pixel(x, y), QColor(Qt::white).rgb());\n  }\n};\n\nclass TestPaintingWindowEvents: public QObject\n{\n  Q_OBJECT\n\nprivate:\n  PaintingWindow *test_window_;\n  QPoint mouse_pos_;\n  Qt::Key key_;\n  int mouse_buttons_type_id_;\n  int event_type_id_;\n\n  void compare_spied_mouse_event_arguments(QSignalSpy& spy) const\n  {\n    QCOMPARE(spy.count(), 1);\n\n    QList<QVariant> arguments = spy.takeFirst();\n    QCOMPARE(arguments.at(0).toInt(), mouse_pos_.x());\n    QCOMPARE(arguments.at(1).toInt(), mouse_pos_.y());\n    QCOMPARE(static_cast<Qt::MouseButtons>(arguments.at(2).toInt()),\n             Qt::NoButton);\n  }\n\n  void compare_spied_key_event_arguments(QSignalSpy& spy) const\n  {\n    QCOMPARE(spy.count(), 1);\n\n    QList<QVariant> arguments = spy.takeFirst();\n    QCOMPARE(static_cast<Qt::Key>(arguments.at(0).toInt()), key_);\n  }\n\nprivate slots:\n  void initTestCase()\n  {\n    mouse_buttons_type_id_ = qRegisterMetaType<Qt::MouseButtons>(\n      \"Qt::MouseButtons\"\n    );\n    event_type_id_ = qRegisterMetaType<Event>(\"Event\");\n    test_window_ = new PaintingWindow(300, 300);\n    mouse_pos_ = QPoint(10, 10);\n    key_ = Qt::Key_A;\n  }\n\n  void cleanupTestCase()\n  {\n    test_window_->deleteLater();\n  }\n\n  void test_mouse_move_event()\n  {\n    test_window_->setMouseTracking(true);\n    QSignalSpy spy(test_window_,\n                   SIGNAL(movedMouse(int, int, Qt::MouseButtons)));\n    QVERIFY(spy.isValid());\n\n    QTestEventList events;\n    int x = 10, y = 10;\n#ifndef _WIN32\n    events.addMouseMove(QPoint(x-1, y-1));\n#endif\n    events.addMouseMove(QPoint(x, y));\n    events.simulate(test_window_);\n\n    QTest::mouseMove(test_window_, mouse_pos_);\n    compare_spied_mouse_event_arguments(spy);\n  }\n\n  void test_mouse_press_event()\n  {\n    QSignalSpy spy(test_window_,\n                   SIGNAL(pressedMouseButtons(int, int, Qt::MouseButtons)));\n    QVERIFY(spy.isValid());\n\n    QTest::mousePress(test_window_, Qt::LeftButton, Qt::NoModifier,\n                      mouse_pos_);\n    compare_spied_mouse_event_arguments(spy);\n  }\n\n  void test_mouse_release_event()\n  {\n    QSignalSpy spy(test_window_,\n                   SIGNAL(releasedMouseButtons(int, int, Qt::MouseButtons)));\n    QVERIFY(spy.isValid());\n\n    QTest::mouseRelease(test_window_, Qt::LeftButton, Qt::NoModifier,\n                        mouse_pos_);\n    compare_spied_mouse_event_arguments(spy);\n  }\n\n  void test_key_press_event()\n  {\n    QSignalSpy spy(test_window_, SIGNAL(pressedKey(int)));\n    QVERIFY(spy.isValid());\n\n    QTest::keyPress(test_window_, key_, Qt::NoModifier);\n    compare_spied_key_event_arguments(spy);\n  }\n\n  void test_key_release_event()\n  {\n    QSignalSpy spy(test_window_, SIGNAL(releasedKey(int)));\n    QVERIFY(spy.isValid());\n\n    QTest::keyRelease(test_window_, key_, Qt::NoModifier);\n    compare_spied_key_event_arguments(spy);\n  }\n\n  void test_send_event()\n  {\n    QSignalSpy spy(test_window_, SIGNAL(sendEvent(Event)));\n    QVERIFY(spy.isValid());\n\n    QMetaObject::invokeMethod(test_window_, \"waitForEvent\",\n                              Qt::AutoConnection, Q_ARG(int, 1));\n    \n    \/\/ Nothing happens.\n    QVERIFY(spy.wait(10));\n    QCOMPARE(spy.count(), 1);\n    QList<QVariant> arguments = spy.takeFirst();\n    QVariant arg = arguments.at(0);\n    arg.convert(event_type_id_);\n    Event event(arguments.at(0).value<Event>());\n    QCOMPARE(event.type, DO::NO_EVENT);\n  }\n\n};\n\nint main(int argc, char *argv[])\n{\n  QApplication app(argc, argv);\n  app.setAttribute(Qt::AA_Use96Dpi, true);\n  QTEST_DISABLE_KEYPAD_NAVIGATION;\n\n  int num_failed_tests = 0;\n\n  TestPaintingWindowConstructors test_painting_window_constructors;\n  num_failed_tests += QTest::qExec(&test_painting_window_constructors);\n\n  TestPaintingWindowDrawMethods test_painting_window_draw_methods;\n  num_failed_tests += QTest::qExec(&test_painting_window_draw_methods);\n\n#ifndef DISABLE_IN_TRAVIS_CI\n  \/\/ TODO: this test suite does not seem to work with Travis CI. We probably\n  \/\/ need to tweak .travis.yml to make it work.\n  \/\/ For now, this is disabled in travis CI.\n  TestPaintingWindowEvents test_painting_window_events;\n  num_failed_tests += QTest::qExec(&test_painting_window_events);\n#endif\n\n  return num_failed_tests;\n}\n\n#include \"test_painting_window.moc\"\n<commit_msg>MAINT: renamed test case name.<commit_after>#include <QtTest>\n#include <QtWidgets>\n#include <DO\/Graphics\/DerivedQObjects\/PaintingWindow.hpp>\n\nQ_DECLARE_METATYPE(DO::Event);\n\nusing namespace DO;\n\nclass TestPaintingWindowConstructors: public QObject\n{\n  Q_OBJECT\n\nprivate slots:\n  void test_construction_of_PaintingWindow_with_small_size()\n  {\n    int width = 50;\n    int height = 50;\n    QString windowName = \"painting window\";\n    int x = 200;\n    int y = 300;\n\n    PaintingWindow *window = new PaintingWindow(width, height,\n                                                windowName,\n                                                x, y);\n\n    QCOMPARE(window->width(), width);\n    QCOMPARE(window->height(), height);\n    QCOMPARE(window->windowTitle(), windowName);\n#ifndef __APPLE__\n    \/\/ Strangely, when we have 2 monitor screens, this fails on Mac OS X...\n    QCOMPARE(window->x(), x);\n    QCOMPARE(window->y(), y);\n#endif\n    QVERIFY(window->isVisible());\n\n    window->deleteLater();\n  }\n\n  void test_construction_of_PaintingWindow_with_size_larger_than_desktop()\n  {\n    int width = qApp->desktop()->width();\n    int height = qApp->desktop()->height();\n\n    PaintingWindow *window = new PaintingWindow(width, height);\n\n    QVERIFY(window->scrollArea()->isMaximized());\n    QVERIFY(window->isVisible());\n\n    window->deleteLater();\n  }\n};\n\nclass TestPaintingWindowDrawingMethods: public QObject\n{\n  Q_OBJECT\n\nprivate: \/\/ data members\n  PaintingWindow *test_window_;\n  QImage true_image_;\n  QPainter painter_;\n\nprivate: \/\/ methods\n  QImage get_image_from_window()\n  {\n    QImage image(test_window_->size(), QImage::Format_RGB32);\n    test_window_->render(&image, QPoint(), QRegion(QRect(QPoint(),\n                         test_window_->size())));\n    return image;\n  }\n\nprivate slots:\n  void initTestCase()\n  {\n    test_window_ = new PaintingWindow(300, 300);\n    true_image_ =  QImage(test_window_->size(), QImage::Format_RGB32);\n  }\n\n  void init()\n  {\n    test_window_->clear();\n    true_image_.fill(Qt::white);\n    painter_.begin(&true_image_);\n  }\n\n  void cleanup()\n  {\n    painter_.end();\n  }\n\n  void cleanupTestCase()\n  {\n    test_window_->deleteLater();\n  }\n\n  void test_drawPoint_using_integer_coordinates()\n  {\n    int x = 150, y = 100;\n    QColor color(255, 0, 0);\n\n    test_window_->drawPoint(x, y, color);\n\n    painter_.setPen(color);\n    painter_.drawPoint(QPoint(x, y));\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawPoint_using_QPointF()\n  {\n    double x = 150.95, y = 100.3333;\n    QColor color(0, 225, 0);\n\n    test_window_->drawPoint(QPointF(x, y), color);\n\n    painter_.setPen(color);\n    painter_.drawPoint(QPointF(x, y));\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawLine_using_integer_coordinates()\n  {\n    int x1 = 100, y1 = 100;\n    int x2 = 200, y2 = 240;\n    QColor color(0, 255, 0);\n    int thickness = 3;\n\n    test_window_->drawLine(x1, y1, x2, y2, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawLine(x1, y1, x2, y2);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawLine_using_QPointF()\n  {\n    QPointF p1(100.350, 100.699);\n    QPointF p2(203.645, 240.664);\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawLine(p1, p2, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawLine(p1, p2);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawCircle_using_integer_coordinates()\n  {\n    int xc = 150, yc = 123;\n    int r = 39;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawCircle(xc, yc, r, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawEllipse(QPoint(xc, yc), r, r);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawCircle_using_Circle_using_QPointF()\n  {\n    QPointF c(150.999, 123.231);\n    int r = 39;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawCircle(c, r, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawEllipse(c, r, r);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawEllipse_using_axis_aligned_bounding_box()\n  {\n    \/\/ Axis-aligned ellipse defined by the following axis-aligned bounding box.\n    int x = 150, y = 123;\n    int w = 39, h = 100;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawEllipse(x, y, w, h, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawEllipse(x, y, w, h);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawEllipse_with_center_and_semi_axes_and_orientation()\n  {\n    QPointF center(123.123, 156.123);\n    qreal r1 = 100.13, r2 = 40.12;\n    qreal oriDegree = 48.65;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawEllipse(center, r1, r2, oriDegree, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.translate(center);\n    painter_.rotate(oriDegree);\n    painter_.translate(-r1, -r2);\n    painter_.drawEllipse(QRectF(0, 0, 2*r1, 2*r2));\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawRect()\n  {\n    int x = 150, y = 123;\n    int w = 39, h = 100;\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->clear();\n    test_window_->drawRect(x, y, w, h, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawRect(x, y, w, h);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawPoly()\n  {\n    QPolygonF polygon;\n    polygon << QPointF(10, 10) << QPointF(250, 20) << QPointF(150, 258);\n\n    QColor color(0, 255, 123);\n    int thickness = 4;\n\n    test_window_->drawPoly(polygon, color, thickness);\n\n    painter_.setPen(QPen(color, thickness));\n    painter_.drawPolygon(polygon);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  void test_drawText()\n  {\n    \/\/ What text.\n    QString text(\"DO-CV is awesome!\");\n    \/\/ Where.\n    int x = 130, y = 150;\n    double orientation = 36.6;\n    \/\/ Style.\n    QColor color(0, 255, 123);\n    int fontSize = 15;\n    bool italic = true;\n    bool bold = true;\n    bool underline = true;\n\n    test_window_->drawText(x, y, text, color, fontSize, orientation, italic,\n                           bold, underline);\n\n    painter_.setPen(color);\n\n    QFont font;\n    font.setPointSize(fontSize);\n    font.setItalic(italic);\n    font.setBold(bold);\n    font.setUnderline(underline);\n    painter_.setFont(font);\n\n    painter_.translate(x, y);\n    painter_.rotate(orientation);\n    painter_.drawText(0, 0, text);\n\n    QCOMPARE(get_image_from_window(), true_image_);\n  }\n\n  \/\/ TODO: make this test more exhaustive.\n  void test_drawArrow()\n  {\n    int x1 = 150, y1 = 150;\n    int x2 = 200, y2 = 200;\n\n    QColor color(0, 255, 123);\n    int arrowWidth = 3, arrowHeight = 5;\n    int style = 0;\n    int width = 3;\n\n    test_window_->drawArrow(x1, y1, x2, y2, color, arrowWidth, arrowHeight,\n                            style, width);\n\n    QImage image(get_image_from_window());\n    for (int x = 150; x < 200; ++x)\n      QCOMPARE(image.pixel(x,x), color.rgb());\n  }\n\n  void test_display()\n  {\n    int w = 20, h = 20;\n    QImage patch(QSize(w, h), QImage::Format_RGB32);\n    patch.fill(Qt::red);\n    int x_offset = 20, y_offset = 30;\n    double zoom_factor = 2.;\n\n    test_window_->display(patch, x_offset, y_offset, zoom_factor);\n\n    QImage image(get_image_from_window());\n    for (int y = 0; y < image.height(); ++y)\n      for (int x = 0; x < image.width(); ++x)\n        if ( x >= x_offset && x < x_offset+zoom_factor*w && \n             y >= y_offset && y < y_offset+zoom_factor*h )\n          QCOMPARE(image.pixel(x, y), QColor(Qt::red).rgb());\n        else\n          QCOMPARE(image.pixel(x, y), QColor(Qt::white).rgb());\n  }\n};\n\nclass TestPaintingWindowEvents: public QObject\n{\n  Q_OBJECT\n\nprivate:\n  PaintingWindow *test_window_;\n  QPoint mouse_pos_;\n  Qt::Key key_;\n  int mouse_buttons_type_id_;\n  int event_type_id_;\n\n  void compare_spied_mouse_event_arguments(QSignalSpy& spy) const\n  {\n    QCOMPARE(spy.count(), 1);\n\n    QList<QVariant> arguments = spy.takeFirst();\n    QCOMPARE(arguments.at(0).toInt(), mouse_pos_.x());\n    QCOMPARE(arguments.at(1).toInt(), mouse_pos_.y());\n    QCOMPARE(static_cast<Qt::MouseButtons>(arguments.at(2).toInt()),\n             Qt::NoButton);\n  }\n\n  void compare_spied_key_event_arguments(QSignalSpy& spy) const\n  {\n    QCOMPARE(spy.count(), 1);\n\n    QList<QVariant> arguments = spy.takeFirst();\n    QCOMPARE(static_cast<Qt::Key>(arguments.at(0).toInt()), key_);\n  }\n\nprivate slots:\n  void initTestCase()\n  {\n    mouse_buttons_type_id_ = qRegisterMetaType<Qt::MouseButtons>(\n      \"Qt::MouseButtons\"\n    );\n    event_type_id_ = qRegisterMetaType<Event>(\"Event\");\n    test_window_ = new PaintingWindow(300, 300);\n    mouse_pos_ = QPoint(10, 10);\n    key_ = Qt::Key_A;\n  }\n\n  void cleanupTestCase()\n  {\n    test_window_->deleteLater();\n  }\n\n  void test_mouse_move_event()\n  {\n    test_window_->setMouseTracking(true);\n    QSignalSpy spy(test_window_,\n                   SIGNAL(movedMouse(int, int, Qt::MouseButtons)));\n    QVERIFY(spy.isValid());\n\n    QTestEventList events;\n    int x = 10, y = 10;\n#ifndef _WIN32\n    events.addMouseMove(QPoint(x-1, y-1));\n#endif\n    events.addMouseMove(QPoint(x, y));\n    events.simulate(test_window_);\n\n    QTest::mouseMove(test_window_, mouse_pos_);\n    compare_spied_mouse_event_arguments(spy);\n  }\n\n  void test_mouse_press_event()\n  {\n    QSignalSpy spy(test_window_,\n                   SIGNAL(pressedMouseButtons(int, int, Qt::MouseButtons)));\n    QVERIFY(spy.isValid());\n\n    QTest::mousePress(test_window_, Qt::LeftButton, Qt::NoModifier,\n                      mouse_pos_);\n    compare_spied_mouse_event_arguments(spy);\n  }\n\n  void test_mouse_release_event()\n  {\n    QSignalSpy spy(test_window_,\n                   SIGNAL(releasedMouseButtons(int, int, Qt::MouseButtons)));\n    QVERIFY(spy.isValid());\n\n    QTest::mouseRelease(test_window_, Qt::LeftButton, Qt::NoModifier,\n                        mouse_pos_);\n    compare_spied_mouse_event_arguments(spy);\n  }\n\n  void test_key_press_event()\n  {\n    QSignalSpy spy(test_window_, SIGNAL(pressedKey(int)));\n    QVERIFY(spy.isValid());\n\n    QTest::keyPress(test_window_, key_, Qt::NoModifier);\n    compare_spied_key_event_arguments(spy);\n  }\n\n  void test_key_release_event()\n  {\n    QSignalSpy spy(test_window_, SIGNAL(releasedKey(int)));\n    QVERIFY(spy.isValid());\n\n    QTest::keyRelease(test_window_, key_, Qt::NoModifier);\n    compare_spied_key_event_arguments(spy);\n  }\n\n  void test_send_event()\n  {\n    QSignalSpy spy(test_window_, SIGNAL(sendEvent(Event)));\n    QVERIFY(spy.isValid());\n\n    QMetaObject::invokeMethod(test_window_, \"waitForEvent\",\n                              Qt::AutoConnection, Q_ARG(int, 1));\n    \n    \/\/ Nothing happens.\n    QVERIFY(spy.wait(10));\n    QCOMPARE(spy.count(), 1);\n    QList<QVariant> arguments = spy.takeFirst();\n    QVariant arg = arguments.at(0);\n    arg.convert(event_type_id_);\n    Event event(arguments.at(0).value<Event>());\n    QCOMPARE(event.type, DO::NO_EVENT);\n  }\n\n};\n\nint main(int argc, char *argv[])\n{\n  QApplication app(argc, argv);\n  app.setAttribute(Qt::AA_Use96Dpi, true);\n  QTEST_DISABLE_KEYPAD_NAVIGATION;\n\n  int num_failed_tests = 0;\n\n  TestPaintingWindowConstructors test_painting_window_constructors;\n  num_failed_tests += QTest::qExec(&test_painting_window_constructors);\n\n  TestPaintingWindowDrawingMethods test_painting_window_drawing_methods;\n  num_failed_tests += QTest::qExec(&test_painting_window_draw_methods);\n\n#ifndef DISABLE_IN_TRAVIS_CI\n  \/\/ TODO: this test suite does not seem to work with Travis CI. We probably\n  \/\/ need to tweak .travis.yml to make it work.\n  \/\/ For now, this is disabled in travis CI.\n  TestPaintingWindowEvents test_painting_window_events;\n  num_failed_tests += QTest::qExec(&test_painting_window_events);\n#endif\n\n  return num_failed_tests;\n}\n\n#include \"test_painting_window.moc\"\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,\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\/*!\n * \\file quantized_elemwise_mul.cc\n * \\brief CPU Implementation of basic elementwise binary mul operators\n *\/\n#include <mxnet\/op_attr_types.h>\n#include \"..\/tensor\/elemwise_binary_op-inl.h\"\n#include \".\/quantized_elemwise_mul-inl.h\"\n#include \".\/quantization_utils.h\"\n\nnamespace mxnet {\nnamespace op {\n\nDMLC_REGISTER_PARAMETER(QuantizeElemwiseMulParam);\n\ninline bool QuantizedElemwiseMulOpShape(const nnvm::NodeAttrs& attrs,\n                                        mxnet::ShapeVector* in_attrs,\n                                        mxnet::ShapeVector* out_attrs) {\n  using namespace mshadow;\n  const QuantizeElemwiseMulParam& params = nnvm::get<QuantizeElemwiseMulParam>(attrs.parsed);\n  const mxnet::TShape& lshape            = (*in_attrs)[quantized_elemwise_mul::kLhs];\n  const mxnet::TShape& rshape            = (*in_attrs)[quantized_elemwise_mul::kRhs];\n  if (!ndim_is_known(lshape) || !ndim_is_known(rshape))\n    return false;\n  CHECK_EQ(lshape.ndim(), rshape.ndim())\n      << \"Currently, quantized elemwise multiply doesn't support broadcast.\";\n  for (int i = 0; i < lshape.ndim(); ++i) {\n    CHECK_EQ(lshape[i], rshape[i]);\n  }\n  SHAPE_ASSIGN_CHECK(*in_attrs, quantized_elemwise_mul::kLhsMin, mxnet::TShape(1, 1));\n  SHAPE_ASSIGN_CHECK(*in_attrs, quantized_elemwise_mul::kLhsMax, mxnet::TShape(1, 1));\n  SHAPE_ASSIGN_CHECK(*in_attrs, quantized_elemwise_mul::kRhsMin, mxnet::TShape(1, 1));\n  SHAPE_ASSIGN_CHECK(*in_attrs, quantized_elemwise_mul::kRhsMax, mxnet::TShape(1, 1));\n\n  SHAPE_ASSIGN_CHECK(*out_attrs, quantized_elemwise_mul::kOut, lshape);\n  if (!params.enable_float_output) {\n    SHAPE_ASSIGN_CHECK(*out_attrs, quantized_elemwise_mul::kOutMin, mxnet::TShape(1, 1));\n    SHAPE_ASSIGN_CHECK(*out_attrs, quantized_elemwise_mul::kOutMax, mxnet::TShape(1, 1));\n  }\n  return true;\n}\n\ninline bool QuantizedElemwiseMulOpType(const nnvm::NodeAttrs& attrs,\n                                       std::vector<int>* in_type,\n                                       std::vector<int>* out_type) {\n  const QuantizeElemwiseMulParam& params = nnvm::get<QuantizeElemwiseMulParam>(attrs.parsed);\n  for (int i = 0; i < 2; ++i) {\n    if (in_type->at(i) == mshadow::kInt8) {\n      TYPE_ASSIGN_CHECK(*in_type, i, mshadow::kInt8);\n    } else {\n      LOG(ERROR) << \"currently, quantized elemwise mul only support int8 inputs.\";\n    }\n  }\n  TYPE_ASSIGN_CHECK(*in_type, quantized_elemwise_mul::kLhsMin, mshadow::kFloat32);\n  TYPE_ASSIGN_CHECK(*in_type, quantized_elemwise_mul::kLhsMax, mshadow::kFloat32);\n  TYPE_ASSIGN_CHECK(*in_type, quantized_elemwise_mul::kRhsMin, mshadow::kFloat32);\n  TYPE_ASSIGN_CHECK(*in_type, quantized_elemwise_mul::kRhsMax, mshadow::kFloat32);\n\n  int dtype = mshadow::kInt32;\n  if (params.max_calib_range.has_value() && params.min_calib_range.has_value()) {\n    dtype = mshadow::kInt8;\n  }\n  if (!params.enable_float_output) {\n    TYPE_ASSIGN_CHECK(*out_type, quantized_elemwise_mul::kOut, dtype);\n    TYPE_ASSIGN_CHECK(*out_type, quantized_elemwise_mul::kOutMin, mshadow::kFloat32);\n    TYPE_ASSIGN_CHECK(*out_type, quantized_elemwise_mul::kOutMax, mshadow::kFloat32);\n  } else {\n    TYPE_ASSIGN_CHECK(*out_type, quantized_elemwise_mul::kOut, mshadow::kFloat32);\n  }\n  return true;\n}\n\ninline bool QuantizedElemwiseMulOpStorageType(const nnvm::NodeAttrs& attrs,\n                                              int dev_mask,\n                                              DispatchMode* dispatch_mode,\n                                              std::vector<int>* in_attrs,\n                                              std::vector<int>* out_attrs) {\n  using namespace common;\n  *dispatch_mode = DispatchMode::kFCompute;\n\n  for (auto& v : *out_attrs) {\n    v = kDefaultStorage;\n    if (common::stype_string(v).compare(\"unknown\") == 0) {\n      return false;\n    }\n  }\n\n  for (auto& v : *in_attrs) {\n    v = kDefaultStorage;\n    if (common::stype_string(v).compare(\"unknown\") == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nvoid QuantizedElemwiseMulOpForward(const nnvm::NodeAttrs& attrs,\n                                   const OpContext& ctx,\n                                   const std::vector<TBlob>& inputs,\n                                   const std::vector<OpReqType>& req,\n                                   const std::vector<TBlob>& outputs) {\n  const QuantizeElemwiseMulParam& params = nnvm::get<QuantizeElemwiseMulParam>(attrs.parsed);\n  using namespace mxnet_op;\n\n  float lhs_min = inputs[quantized_elemwise_mul::kLhsMin].dptr<float>()[0];\n  float lhs_max = inputs[quantized_elemwise_mul::kLhsMax].dptr<float>()[0];\n  float rhs_min = inputs[quantized_elemwise_mul::kRhsMin].dptr<float>()[0];\n  float rhs_max = inputs[quantized_elemwise_mul::kRhsMax].dptr<float>()[0];\n\n  float cached_output_min_ = 0.f;\n  float cached_output_max_ = 0.f;\n  float out_data_scale     = 1.f;\n  float out_scale          = 1.f;\n  if (!params.enable_float_output) {\n    double output_data_range;\n    \/\/ dataA && dataB are int8\n    if (outputs[quantized_elemwise_mul::kOut].type_flag_ == mshadow::kInt8) {\n      output_data_range = kInt8Range;\n    } else {\n      output_data_range = kInt32Range;\n    }\n    if (params.max_calib_range.has_value() && params.min_calib_range.has_value()) {\n      cached_output_min_ = params.min_calib_range.value();\n      cached_output_max_ = params.max_calib_range.value();\n      out_data_scale     = output_data_range \/ MaxAbs(cached_output_min_, cached_output_max_);\n      auto lhs_scale     = kInt8Range \/ MaxAbs(lhs_min, lhs_max);\n      auto rhs_scale     = kInt8Range \/ MaxAbs(rhs_min, rhs_max);\n      out_scale          = out_data_scale \/ lhs_scale \/ rhs_scale;\n    } else {\n      Stream<cpu>* s = ctx.get_stream<cpu>();\n      if (inputs[quantized_elemwise_mul::kLhs].type_flag_ == mshadow::kInt8 &&\n          inputs[quantized_elemwise_mul::kRhs].type_flag_ == mshadow::kInt8) {\n        mxnet_op::Kernel<QuantizationRangeForS8S8MultiplicationStruct, cpu>::Launch(\n            s, 1, &cached_output_min_, &cached_output_max_, &lhs_min, &lhs_max, &rhs_min, &rhs_max);\n      } else {\n        LOG(ERROR) << \"lhs and rhs only support iny8 dtype.\";\n      }\n    }\n  } else {\n    auto lhs_scale = kInt8Range \/ MaxAbs(lhs_min, lhs_max);\n    auto rhs_scale = kInt8Range \/ MaxAbs(rhs_min, rhs_max);\n    out_scale      = 1.0 \/ lhs_scale \/ rhs_scale;\n  }\n\n  size_t out_size = outputs[quantized_elemwise_mul::kOut].Size();\n  auto* input_l   = inputs[quantized_elemwise_mul::kLhs].dptr<int8_t>();\n  auto* input_r   = inputs[quantized_elemwise_mul::kRhs].dptr<int8_t>();\n  \/\/ TODO(Xinyu): a temp solution to enable Elemwise INT8 computation,\n  \/\/ will be refactored after the DNNL primitive is done.\n  if (!params.enable_float_output) {\n    if (params.max_calib_range.has_value() && params.min_calib_range.has_value()) {\n      typedef int8_t out_type;\n      auto* out_data = outputs[quantized_elemwise_mul::kOut].dptr<out_type>();\n#if !defined(_MSC_VER)\n#pragma omp simd\n#endif\n      for (size_t i = 0; i < out_size; ++i) {\n        const int8_t a = input_l[i];\n        const int8_t b = input_r[i];\n        out_data[i]    = static_cast<out_type>(a * b * out_scale);\n      }\n    } else {\n      using out_type = int32_t;\n      auto* out_data = outputs[quantized_elemwise_mul::kOut].dptr<out_type>();\n#if !defined(_MSC_VER)\n#pragma omp simd\n#endif\n      for (size_t i = 0; i < out_size; ++i) {\n        const int8_t a = input_l[i];\n        const int8_t b = input_r[i];\n        out_data[i]    = static_cast<out_type>(a * b * out_scale);\n      }\n    }\n  } else {\n    using out_type = float_t;\n    auto* out_data = outputs[quantized_elemwise_mul::kOut].dptr<out_type>();\n#if !defined(_MSC_VER)\n#pragma omp simd\n#endif\n    for (size_t i = 0; i < out_size; ++i) {\n      const int8_t a = input_l[i];\n      const int8_t b = input_r[i];\n      out_data[i]    = static_cast<out_type>(a * b * out_scale);\n    }\n  }\n\n  if (!params.enable_float_output) {\n    outputs[quantized_elemwise_mul::kOutMin].dptr<float>()[0] = cached_output_min_;\n    outputs[quantized_elemwise_mul::kOutMax].dptr<float>()[0] = cached_output_max_;\n  }\n}\n\nNNVM_REGISTER_OP(_contrib_quantized_elemwise_mul)\n    .add_alias(\"_npx_quantized_elemwise_mul\")\n    .describe(R\"code(Multiplies arguments int8 element-wise.\n)code\" ADD_FILELINE)\n    .set_num_inputs(6)\n    .set_num_outputs([](const NodeAttrs& attrs) {\n      const QuantizeElemwiseMulParam& params = nnvm::get<QuantizeElemwiseMulParam>(attrs.parsed);\n      return (!params.enable_float_output) ? 3 : 1;\n    })\n    .set_attr<nnvm::FListInputNames>(\n        \"FListInputNames\",\n        [](const NodeAttrs& attrs) {\n          return std::vector<std::string>{\"lhs\", \"rhs\", \"lhs_min\", \"lhs_max\", \"rhs_min\", \"rhs_max\"};\n        })\n    .set_attr<mxnet::FInferShape>(\"FInferShape\", QuantizedElemwiseMulOpShape)\n    .set_attr<nnvm::FInferType>(\"FInferType\", QuantizedElemwiseMulOpType)\n    .set_attr<FInferStorageType>(\"FInferStorageType\", QuantizedElemwiseMulOpStorageType)\n    .set_attr<FResourceRequest>(\"FResourceRequest\",\n                                [](const NodeAttrs& attrs) {\n                                  return std::vector<ResourceRequest>{ResourceRequest::kTempSpace};\n                                })\n    .set_attr<FCompute>(\"FCompute<cpu>\", QuantizedElemwiseMulOpForward)\n    \/\/ TODO(Xinyu): a temp solution to enable GluonCV INT8 flow,\n    \/\/ will be reverted after the improvement of CachedOP is done.\n    .set_attr<nnvm::FGradient>(\"FGradient\", MakeZeroGradNodes)\n    .set_attr<FNeedRequantize>(\"FNeedRequantize\", [](const NodeAttrs& attrs) { return true; })\n    .add_argument(\"lhs\", \"NDArray-or-Symbol\", \"first input\")\n    .add_argument(\"rhs\", \"NDArray-or-Symbol\", \"second input\")\n    .add_argument(\"lhs_min\", \"NDArray-or-Symbol\", \"Minimum value of first input.\")\n    .add_argument(\"lhs_max\", \"NDArray-or-Symbol\", \"Maximum value of first input.\")\n    .add_argument(\"rhs_min\", \"NDArray-or-Symbol\", \"Minimum value of second input.\")\n    .add_argument(\"rhs_max\", \"NDArray-or-Symbol\", \"Maximum value of second input.\")\n    .set_attr_parser(ParamParser<QuantizeElemwiseMulParam>)\n    .add_arguments(QuantizeElemwiseMulParam::__FIELDS__());\n\nNNVM_REGISTER_OP(elemwise_mul).set_attr<FQuantizedOp>(\"FQuantizedOp\", [](const NodeAttrs& attrs) {\n  nnvm::ObjectPtr node = nnvm::Node::Create();\n  node->attrs.op       = Op::Get(\"_contrib_quantized_elemwise_mul\");\n  node->attrs.name     = \"quantized_\" + attrs.name;\n  node->attrs.dict     = attrs.dict;\n  if (node->op()->attr_parser != nullptr) {\n    node->op()->attr_parser(&(node->attrs));\n  }\n  return node;\n});\n\n}  \/\/ namespace op\n}  \/\/ namespace mxnet\n<commit_msg>port #20926 to master (#20949)<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,\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\/*!\n * \\file quantized_elemwise_mul.cc\n * \\brief CPU Implementation of basic elementwise binary mul operators\n *\/\n#include <mxnet\/op_attr_types.h>\n#include \"..\/tensor\/elemwise_binary_op-inl.h\"\n#include \".\/quantized_elemwise_mul-inl.h\"\n#include \".\/quantization_utils.h\"\n\nnamespace mxnet {\nnamespace op {\n\nDMLC_REGISTER_PARAMETER(QuantizeElemwiseMulParam);\n\ninline bool QuantizedElemwiseMulOpShape(const nnvm::NodeAttrs& attrs,\n                                        mxnet::ShapeVector* in_attrs,\n                                        mxnet::ShapeVector* out_attrs) {\n  using namespace mshadow;\n  const QuantizeElemwiseMulParam& params = nnvm::get<QuantizeElemwiseMulParam>(attrs.parsed);\n  const mxnet::TShape& lshape            = (*in_attrs)[quantized_elemwise_mul::kLhs];\n  const mxnet::TShape& rshape            = (*in_attrs)[quantized_elemwise_mul::kRhs];\n  if (!ndim_is_known(lshape) || !ndim_is_known(rshape))\n    return false;\n  CHECK_EQ(lshape.ndim(), rshape.ndim())\n      << \"Currently, quantized elemwise multiply doesn't support broadcast.\";\n  for (int i = 0; i < lshape.ndim(); ++i) {\n    CHECK_EQ(lshape[i], rshape[i]);\n  }\n  SHAPE_ASSIGN_CHECK(*in_attrs, quantized_elemwise_mul::kLhsMin, mxnet::TShape(1, 1));\n  SHAPE_ASSIGN_CHECK(*in_attrs, quantized_elemwise_mul::kLhsMax, mxnet::TShape(1, 1));\n  SHAPE_ASSIGN_CHECK(*in_attrs, quantized_elemwise_mul::kRhsMin, mxnet::TShape(1, 1));\n  SHAPE_ASSIGN_CHECK(*in_attrs, quantized_elemwise_mul::kRhsMax, mxnet::TShape(1, 1));\n\n  SHAPE_ASSIGN_CHECK(*out_attrs, quantized_elemwise_mul::kOut, lshape);\n  if (!params.enable_float_output) {\n    SHAPE_ASSIGN_CHECK(*out_attrs, quantized_elemwise_mul::kOutMin, mxnet::TShape(1, 1));\n    SHAPE_ASSIGN_CHECK(*out_attrs, quantized_elemwise_mul::kOutMax, mxnet::TShape(1, 1));\n  }\n  return true;\n}\n\ninline bool QuantizedElemwiseMulOpType(const nnvm::NodeAttrs& attrs,\n                                       std::vector<int>* in_type,\n                                       std::vector<int>* out_type) {\n  const QuantizeElemwiseMulParam& params = nnvm::get<QuantizeElemwiseMulParam>(attrs.parsed);\n  for (int i = 0; i < 2; ++i) {\n    if (in_type->at(i) == mshadow::kInt8) {\n      TYPE_ASSIGN_CHECK(*in_type, i, mshadow::kInt8);\n    } else {\n      LOG(ERROR) << \"currently, quantized elemwise mul only support int8 inputs.\";\n    }\n  }\n  TYPE_ASSIGN_CHECK(*in_type, quantized_elemwise_mul::kLhsMin, mshadow::kFloat32);\n  TYPE_ASSIGN_CHECK(*in_type, quantized_elemwise_mul::kLhsMax, mshadow::kFloat32);\n  TYPE_ASSIGN_CHECK(*in_type, quantized_elemwise_mul::kRhsMin, mshadow::kFloat32);\n  TYPE_ASSIGN_CHECK(*in_type, quantized_elemwise_mul::kRhsMax, mshadow::kFloat32);\n\n  int dtype = mshadow::kInt32;\n  if (params.max_calib_range.has_value() && params.min_calib_range.has_value()) {\n    dtype = mshadow::kInt8;\n  }\n  if (!params.enable_float_output) {\n    TYPE_ASSIGN_CHECK(*out_type, quantized_elemwise_mul::kOut, dtype);\n    TYPE_ASSIGN_CHECK(*out_type, quantized_elemwise_mul::kOutMin, mshadow::kFloat32);\n    TYPE_ASSIGN_CHECK(*out_type, quantized_elemwise_mul::kOutMax, mshadow::kFloat32);\n  } else {\n    TYPE_ASSIGN_CHECK(*out_type, quantized_elemwise_mul::kOut, mshadow::kFloat32);\n  }\n  return true;\n}\n\ninline bool QuantizedElemwiseMulOpStorageType(const nnvm::NodeAttrs& attrs,\n                                              int dev_mask,\n                                              DispatchMode* dispatch_mode,\n                                              std::vector<int>* in_attrs,\n                                              std::vector<int>* out_attrs) {\n  using namespace common;\n  *dispatch_mode = DispatchMode::kFCompute;\n\n  for (auto& v : *out_attrs) {\n    v = kDefaultStorage;\n    if (common::stype_string(v).compare(\"unknown\") == 0) {\n      return false;\n    }\n  }\n\n  for (auto& v : *in_attrs) {\n    v = kDefaultStorage;\n    if (common::stype_string(v).compare(\"unknown\") == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nvoid QuantizedElemwiseMulOpForward(const nnvm::NodeAttrs& attrs,\n                                   const OpContext& ctx,\n                                   const std::vector<TBlob>& inputs,\n                                   const std::vector<OpReqType>& req,\n                                   const std::vector<TBlob>& outputs) {\n  const QuantizeElemwiseMulParam& params = nnvm::get<QuantizeElemwiseMulParam>(attrs.parsed);\n  using namespace mxnet_op;\n\n  float lhs_min = inputs[quantized_elemwise_mul::kLhsMin].dptr<float>()[0];\n  float lhs_max = inputs[quantized_elemwise_mul::kLhsMax].dptr<float>()[0];\n  float rhs_min = inputs[quantized_elemwise_mul::kRhsMin].dptr<float>()[0];\n  float rhs_max = inputs[quantized_elemwise_mul::kRhsMax].dptr<float>()[0];\n\n  float cached_output_min_ = 0.f;\n  float cached_output_max_ = 0.f;\n  float out_data_scale     = 1.f;\n  float out_scale          = 1.f;\n  if (!params.enable_float_output) {\n    double output_data_range;\n    \/\/ dataA && dataB are int8\n    if (outputs[quantized_elemwise_mul::kOut].type_flag_ == mshadow::kInt8) {\n      output_data_range = kInt8Range;\n    } else {\n      output_data_range = kInt32Range;\n    }\n    if (params.max_calib_range.has_value() && params.min_calib_range.has_value()) {\n      cached_output_min_ = params.min_calib_range.value();\n      cached_output_max_ = params.max_calib_range.value();\n      out_data_scale     = output_data_range \/ MaxAbs(cached_output_min_, cached_output_max_);\n      auto lhs_scale     = kInt8Range \/ MaxAbs(lhs_min, lhs_max);\n      auto rhs_scale     = kInt8Range \/ MaxAbs(rhs_min, rhs_max);\n      out_scale          = out_data_scale \/ lhs_scale \/ rhs_scale;\n    } else {\n      Stream<cpu>* s = ctx.get_stream<cpu>();\n      if (inputs[quantized_elemwise_mul::kLhs].type_flag_ == mshadow::kInt8 &&\n          inputs[quantized_elemwise_mul::kRhs].type_flag_ == mshadow::kInt8) {\n        mxnet_op::Kernel<QuantizationRangeForS8S8MultiplicationStruct, cpu>::Launch(\n            s, 1, &cached_output_min_, &cached_output_max_, &lhs_min, &lhs_max, &rhs_min, &rhs_max);\n      } else {\n        LOG(ERROR) << \"lhs and rhs only support iny8 dtype.\";\n      }\n    }\n  } else {\n    auto lhs_scale = kInt8Range \/ MaxAbs(lhs_min, lhs_max);\n    auto rhs_scale = kInt8Range \/ MaxAbs(rhs_min, rhs_max);\n    out_scale      = 1.0 \/ lhs_scale \/ rhs_scale;\n  }\n\n  size_t out_size = outputs[quantized_elemwise_mul::kOut].Size();\n  auto* input_l   = inputs[quantized_elemwise_mul::kLhs].dptr<int8_t>();\n  auto* input_r   = inputs[quantized_elemwise_mul::kRhs].dptr<int8_t>();\n  \/\/ TODO(Xinyu): a temp solution to enable Elemwise INT8 computation,\n  \/\/ will be refactored after the DNNL primitive is done.\n  if (!params.enable_float_output) {\n    if (params.max_calib_range.has_value() && params.min_calib_range.has_value()) {\n      typedef int8_t out_type;\n      auto* out_data = outputs[quantized_elemwise_mul::kOut].dptr<out_type>();\n#if !defined(_MSC_VER)\n#pragma omp simd\n#endif\n      for (size_t i = 0; i < out_size; ++i) {\n        const int8_t a = input_l[i];\n        const int8_t b = input_r[i];\n        out_data[i]    = static_cast<out_type>(a * b * out_scale);\n      }\n    } else {\n      using out_type = int32_t;\n      auto* out_data = outputs[quantized_elemwise_mul::kOut].dptr<out_type>();\n#if !defined(_MSC_VER)\n#pragma omp simd\n#endif\n      for (size_t i = 0; i < out_size; ++i) {\n        const int8_t a = input_l[i];\n        const int8_t b = input_r[i];\n        out_data[i]    = static_cast<out_type>(a * b * out_scale);\n      }\n    }\n  } else {\n    using out_type = float;\n    auto* out_data = outputs[quantized_elemwise_mul::kOut].dptr<out_type>();\n#if !defined(_MSC_VER)\n#pragma omp simd\n#endif\n    for (size_t i = 0; i < out_size; ++i) {\n      const int8_t a = input_l[i];\n      const int8_t b = input_r[i];\n      out_data[i]    = static_cast<out_type>(a * b * out_scale);\n    }\n  }\n\n  if (!params.enable_float_output) {\n    outputs[quantized_elemwise_mul::kOutMin].dptr<float>()[0] = cached_output_min_;\n    outputs[quantized_elemwise_mul::kOutMax].dptr<float>()[0] = cached_output_max_;\n  }\n}\n\nNNVM_REGISTER_OP(_contrib_quantized_elemwise_mul)\n    .add_alias(\"_npx_quantized_elemwise_mul\")\n    .describe(R\"code(Multiplies arguments int8 element-wise.\n)code\" ADD_FILELINE)\n    .set_num_inputs(6)\n    .set_num_outputs([](const NodeAttrs& attrs) {\n      const QuantizeElemwiseMulParam& params = nnvm::get<QuantizeElemwiseMulParam>(attrs.parsed);\n      return (!params.enable_float_output) ? 3 : 1;\n    })\n    .set_attr<nnvm::FListInputNames>(\n        \"FListInputNames\",\n        [](const NodeAttrs& attrs) {\n          return std::vector<std::string>{\"lhs\", \"rhs\", \"lhs_min\", \"lhs_max\", \"rhs_min\", \"rhs_max\"};\n        })\n    .set_attr<mxnet::FInferShape>(\"FInferShape\", QuantizedElemwiseMulOpShape)\n    .set_attr<nnvm::FInferType>(\"FInferType\", QuantizedElemwiseMulOpType)\n    .set_attr<FInferStorageType>(\"FInferStorageType\", QuantizedElemwiseMulOpStorageType)\n    .set_attr<FResourceRequest>(\"FResourceRequest\",\n                                [](const NodeAttrs& attrs) {\n                                  return std::vector<ResourceRequest>{ResourceRequest::kTempSpace};\n                                })\n    .set_attr<FCompute>(\"FCompute<cpu>\", QuantizedElemwiseMulOpForward)\n    \/\/ TODO(Xinyu): a temp solution to enable GluonCV INT8 flow,\n    \/\/ will be reverted after the improvement of CachedOP is done.\n    .set_attr<nnvm::FGradient>(\"FGradient\", MakeZeroGradNodes)\n    .set_attr<FNeedRequantize>(\"FNeedRequantize\", [](const NodeAttrs& attrs) { return true; })\n    .add_argument(\"lhs\", \"NDArray-or-Symbol\", \"first input\")\n    .add_argument(\"rhs\", \"NDArray-or-Symbol\", \"second input\")\n    .add_argument(\"lhs_min\", \"NDArray-or-Symbol\", \"Minimum value of first input.\")\n    .add_argument(\"lhs_max\", \"NDArray-or-Symbol\", \"Maximum value of first input.\")\n    .add_argument(\"rhs_min\", \"NDArray-or-Symbol\", \"Minimum value of second input.\")\n    .add_argument(\"rhs_max\", \"NDArray-or-Symbol\", \"Maximum value of second input.\")\n    .set_attr_parser(ParamParser<QuantizeElemwiseMulParam>)\n    .add_arguments(QuantizeElemwiseMulParam::__FIELDS__());\n\nNNVM_REGISTER_OP(elemwise_mul).set_attr<FQuantizedOp>(\"FQuantizedOp\", [](const NodeAttrs& attrs) {\n  nnvm::ObjectPtr node = nnvm::Node::Create();\n  node->attrs.op       = Op::Get(\"_contrib_quantized_elemwise_mul\");\n  node->attrs.name     = \"quantized_\" + attrs.name;\n  node->attrs.dict     = attrs.dict;\n  if (node->op()->attr_parser != nullptr) {\n    node->op()->attr_parser(&(node->attrs));\n  }\n  return node;\n});\n\n}  \/\/ namespace op\n}  \/\/ namespace mxnet\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#42785 fix crashing again with this doc in 4-4 series<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Sketcher: Fix block constraint with several dependency groups<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2018 https:\/\/www.thecoderscorner.com (Dave Cherry).\n * This product is licensed under an Apache license, see the LICENSE file in the top-level directory.\n *\/\n\n#include <IoAbstractionWire.h>\n\nPCF8574IoAbstraction::PCF8574IoAbstraction(uint8_t addr, uint8_t interruptPin, WireType wireImplementation, bool mode16Bit) : lastRead{}, toWrite{} {\n\tthis->wireImpl = wireImplementation;\n\tthis->address = addr;\n\tthis->interruptPin = interruptPin;\n    flags = 0;\n    bitWrite(flags, NEEDS_WRITE_FLAG, true);\n    bitWrite(flags, PCF8575_16BIT_FLAG, mode16Bit);\n\n}\n\nvoid PCF8574IoAbstraction::pinDirection(pinid_t pin, uint8_t mode) {\n\tif (mode == INPUT || mode == INPUT_PULLUP) {\n\t\toverrideReadFlag();\n\t\twriteValue(pin, HIGH);\n\t}\n\telse {\n\t\twriteValue(pin, LOW);\n\t}\n    bitWrite(flags, NEEDS_WRITE_FLAG, true);\n}\n\nvoid PCF8574IoAbstraction::writeValue(pinid_t pin, uint8_t value) {\n    int port = (pin > 7) ? 1 : 0;\n\tbitWrite(toWrite[port], (pin % 8), value);\n    bitWrite(flags, NEEDS_WRITE_FLAG, true);\n}\n\nuint8_t PCF8574IoAbstraction::readValue(pinid_t pin) {\n    int port = (pin > 7) ? 1 : 0;\n    return (lastRead[port] & (1 << pin)) ? HIGH : LOW;\n}\n\nuint8_t PCF8574IoAbstraction::readPort(pinid_t pin) {\n    int port = (pin > 7) ? 1 : 0;\n    return lastRead[port];\n}\n\nvoid PCF8574IoAbstraction::writePort(pinid_t pin, uint8_t value) {\n    int port = (pin > 7) ? 1 : 0;\n    toWrite[port] = value;\n    bitWrite(flags, NEEDS_WRITE_FLAG, true);\n}\n\nbool PCF8574IoAbstraction::runLoop(){\n    bool writeOk = true;\n    size_t bytesToTransfer = bitRead(flags, PCF8575_16BIT_FLAG) ? 2 : 1;\n    if (bitRead(flags, NEEDS_WRITE_FLAG)) {\n        bitWrite(flags, NEEDS_WRITE_FLAG, false);\n        writeOk = ioaWireWriteWithRetry(wireImpl, address, toWrite, bytesToTransfer);\n    }\n\n    if(bitRead(flags, PINS_CONFIGURED_READ_FLAG)) {\n        writeOk = writeOk && ioaWireRead(wireImpl, address, lastRead, bytesToTransfer);\n    }\n    return writeOk;\n}\n\nvoid PCF8574IoAbstraction::attachInterrupt(pinid_t \/*pin*\/, RawIntHandler intHandler, uint8_t \/*mode*\/) {\n\t\/\/ if there's an interrupt pin set\n\tif(interruptPin == 0xff) return;\n\n\tinternalDigitalIo()->pinDirection(interruptPin, INPUT_PULLUP);\n\tinternalDigitalIo()->attachInterrupt(interruptPin, intHandler, FALLING);\n}\n\nBasicIoAbstraction* ioFrom8574(uint8_t addr, pinid_t interruptPin, WireType wireImpl) {\n\treturn new PCF8574IoAbstraction(addr, interruptPin, wireImpl);\n}\n\nBasicIoAbstraction* ioFrom8575(uint8_t addr, pinid_t interruptPin, WireType wireImpl) {\n    return new PCF8574IoAbstraction(addr, interruptPin, wireImpl, true);\n}\n\nMCP23017IoAbstraction::MCP23017IoAbstraction(uint8_t address, Mcp23xInterruptMode intMode, pinid_t intPinA, pinid_t intPinB, WireType wireImpl) {\n\tthis->wireImpl = wireImpl;\n\tthis->address = address;\n\tthis->intPinA = intPinA;\n\tthis->intPinB = intPinB;\n\tthis->intMode = intMode;\n\tthis->toWrite = this->lastRead = 0;\n\tthis->needsInit = true;\n\tthis->portFlags = 0;\n}\n\nvoid MCP23017IoAbstraction::initDevice() {\n\tuint8_t controlReg = (readFromDevice(IOCON_ADDR) & 0xff);\n\t\n\tif(intPinB == 0xff && intPinA != 0xff) {\n\t\tbitSet(controlReg, IOCON_MIRROR_BIT);\n\t}\n\telse if(intPinA != 0xff) {\n\t\tbitClear(controlReg, IOCON_MIRROR_BIT);\n\t}\n\n\tbitClear(controlReg, IOCON_BANK_BIT);\n\tbitClear(controlReg, IOCON_SEQOP_BIT);\n\n\tuint16_t regToWrite = controlReg | (((uint16_t)controlReg) << 8U);\n\twriteToDevice(IOCON_ADDR, regToWrite);\n\n\tportFlags = 0;\n\tneedsInit = false;\n}\n\nvoid MCP23017IoAbstraction::toggleBitInRegister(uint8_t regAddr, uint8_t theBit, bool value) {\n\tuint16_t reg = readFromDevice(regAddr);\n\tbitWrite(reg, theBit, value);\n\n\t\/\/ for debugging to see the commands being sent, uncomment below\n\t\/\/serdebugF4(\"toggle(regAddr, bit, toggle): \", regAddr, theBit, value);\n\t\/\/serdebugFHex(\"Value: \", reg);\n\t\/\/ end debugging code\n\n\twriteToDevice(regAddr, reg);\n}\n\nvoid MCP23017IoAbstraction::pinDirection(pinid_t pin, uint8_t mode) {\n\tif(needsInit) initDevice();\n\n\ttoggleBitInRegister(IODIR_ADDR, pin, (mode == INPUT || mode == INPUT_PULLUP));\n\ttoggleBitInRegister(GPPU_ADDR, pin, mode == INPUT_PULLUP);\n\n\tbitSet(portFlags, (pin < 8) ? READER_PORTA_BIT : READER_PORTB_BIT);\n}\n\nvoid MCP23017IoAbstraction::writeValue(pinid_t pin, uint8_t value) {\n\tif(needsInit) initDevice();\n\n\tbitWrite(toWrite, pin, value);\n\tbitSet(portFlags, (pin < 8) ? CHANGE_PORTA_BIT : CHANGE_PORTB_BIT);\n}\n\nuint8_t MCP23017IoAbstraction::readValue(pinid_t pin) {\n\treturn bitRead(lastRead, pin);\n}\n\nuint8_t MCP23017IoAbstraction::readPort(pinid_t pin) {\n\treturn (pin < 8) ? (lastRead & 0xff) : (lastRead >> 8);\n}\n\nvoid MCP23017IoAbstraction::writePort(pinid_t pin, uint8_t value) {\n\tif(pin < 8) {\n\t\ttoWrite &= 0xff00; \n\t\ttoWrite |= value;\n\t\tbitSet(portFlags, CHANGE_PORTA_BIT);\n\t}\n\telse {\n\t\ttoWrite &= 0x00ff; \n\t\ttoWrite |= ((uint16_t)value << 8);\n\t\tbitSet(portFlags, CHANGE_PORTB_BIT);\n\t}\n}\n\nbool MCP23017IoAbstraction::runLoop() {\n\tif(needsInit) initDevice();\n\n\tbool writeOk = true;\n\n\tbool flagA = bitRead(portFlags, CHANGE_PORTA_BIT);\n\tbool flagB = bitRead(portFlags, CHANGE_PORTB_BIT);\n\tif(flagA && flagB) \/\/ write on both ports\n\t\twriteOk = writeToDevice(OUTLAT_ADDR, toWrite);\n\telse if(flagA) \n\t\twriteOk = writeToDevice8(OUTLAT_ADDR, toWrite);\n\telse if(flagB)\n\t\twriteOk = writeToDevice8(OUTLAT_ADDR + 1, toWrite >> 8);\n\n\tbitClear(portFlags, CHANGE_PORTA_BIT);\n\tbitClear(portFlags, CHANGE_PORTB_BIT);\n\n\tflagA = bitRead(portFlags, READER_PORTA_BIT);\n\tflagB = bitRead(portFlags, READER_PORTB_BIT);\n\tif(flagA && flagB)\n\t\tlastRead = readFromDevice(GPIO_ADDR);\n\telse if(flagA)\n\t\tlastRead = readFromDevice8(GPIO_ADDR);\n\telse if(flagB)\n\t\tlastRead = readFromDevice8(GPIO_ADDR + 1) << 8U;\n\n\treturn writeOk;\n}\n\nbool MCP23017IoAbstraction::writeToDevice(uint8_t reg, uint16_t command) {\n\tuint8_t data[3];\n\tdata[0] = reg;\n    data[1] = (uint8_t)command;\n    data[2] = (uint8_t)(command>>8);\n\treturn ioaWireWriteWithRetry(wireImpl, address, data, sizeof data);\n}\n\nbool MCP23017IoAbstraction::writeToDevice8(uint8_t reg, uint8_t command) {\n    uint8_t data[2];\n    data[0] = reg;\n    data[1] = (uint8_t)command;\n    return ioaWireWriteWithRetry(wireImpl, address, data, sizeof data);\n}\n\nuint16_t MCP23017IoAbstraction::readFromDevice(uint8_t reg) {\n\tioaWireWriteWithRetry(wireImpl, address, &reg, 1, 0, false);\n\n\tuint8_t data[2];\n\tioaWireRead(wireImpl, address, data, sizeof data);\n\t\/\/ read will get port A first then port B.\n\tuint8_t portA = data[0];\n\tuint16_t portB = data[1] << 8U;\n\treturn portA | portB;\n}\n\nuint8_t MCP23017IoAbstraction::readFromDevice8(uint8_t reg) {\n    ioaWireWriteWithRetry(wireImpl, address, &reg, 1, 0);\n\n\tuint8_t buffer[2];\n    if(ioaWireRead(wireImpl, address, buffer, 1)){\n       return buffer[0];\n    }\n    return 0;\n}\n\nvoid MCP23017IoAbstraction::attachInterrupt(pinid_t pin, RawIntHandler intHandler, uint8_t mode) {\n\t\/\/ only if there's an interrupt pin set\n\tif(intPinA == 0xff) return;\n\n\tauto  inbuiltIo = internalDigitalIo();\n\tuint8_t pm = (intMode == ACTIVE_HIGH_OPEN || intMode == ACTIVE_LOW_OPEN) ? INPUT_PULLUP : INPUT;\n\tuint8_t im = (intMode == ACTIVE_HIGH || intMode == ACTIVE_HIGH_OPEN) ? RISING : FALLING;\n\tif(intPinB == 0xff) {\n        inbuiltIo->pinDirection(intPinA, pm);\n        inbuiltIo->attachInterrupt(intPinA, intHandler, im);\n\t}\n\telse {\n        inbuiltIo->pinDirection(intPinA, pm);\n        inbuiltIo->attachInterrupt(intPinA, intHandler, im);\n        inbuiltIo->pinDirection(intPinB, pm);\n        inbuiltIo->attachInterrupt(intPinB, intHandler, im);\n    }\n\n\ttoggleBitInRegister(GPINTENA_ADDR, pin, true);\n\ttoggleBitInRegister(INTCON_ADDR, pin, mode != CHANGE);\n\ttoggleBitInRegister(DEFVAL_ADDR, pin, mode == FALLING);\n}\n\nvoid MCP23017IoAbstraction::setInvertInputPin(pinid_t pin, bool shouldInvert) {\n    toggleBitInRegister(IPOL_ADDR, pin, shouldInvert);\n}\n\nIoAbstractionRef ioFrom23017(pinid_t addr, WireType wireImpl) {\n\treturn ioFrom23017IntPerPort(addr, NOT_ENABLED, 0xff, 0xff, wireImpl);\n}\n\nIoAbstractionRef ioFrom23017(uint8_t addr, Mcp23xInterruptMode intMode, pinid_t interruptPin, WireType wireImpl) {\n\treturn ioFrom23017IntPerPort(addr, intMode, interruptPin, 0xff, wireImpl);\n}\n\nIoAbstractionRef ioFrom23017IntPerPort(pinid_t addr, Mcp23xInterruptMode intMode, pinid_t intPinA, pinid_t intPinB, WireType wireImpl) {\n\treturn new MCP23017IoAbstraction(addr, intMode, intPinA, intPinB, wireImpl);\n}<commit_msg>[PCF8575] Correctly read values above first byte<commit_after>\/*\n * Copyright (c) 2018 https:\/\/www.thecoderscorner.com (Dave Cherry).\n * This product is licensed under an Apache license, see the LICENSE file in the top-level directory.\n *\/\n\n#include <IoAbstractionWire.h>\n\nPCF8574IoAbstraction::PCF8574IoAbstraction(uint8_t addr, uint8_t interruptPin, WireType wireImplementation, bool mode16Bit) : lastRead{}, toWrite{} {\n\tthis->wireImpl = wireImplementation;\n\tthis->address = addr;\n\tthis->interruptPin = interruptPin;\n    flags = 0;\n    bitWrite(flags, NEEDS_WRITE_FLAG, true);\n    bitWrite(flags, PCF8575_16BIT_FLAG, mode16Bit);\n\n}\n\nvoid PCF8574IoAbstraction::pinDirection(pinid_t pin, uint8_t mode) {\n\tif (mode == INPUT || mode == INPUT_PULLUP) {\n\t\toverrideReadFlag();\n\t\twriteValue(pin, HIGH);\n\t}\n\telse {\n\t\twriteValue(pin, LOW);\n\t}\n    bitWrite(flags, NEEDS_WRITE_FLAG, true);\n}\n\nvoid PCF8574IoAbstraction::writeValue(pinid_t pin, uint8_t value) {\n    int port = (pin > 7) ? 1 : 0;\n\tbitWrite(toWrite[port], (pin % 8), value);\n    bitWrite(flags, NEEDS_WRITE_FLAG, true);\n}\n\nuint8_t PCF8574IoAbstraction::readValue(pinid_t pin) {\n    int port = (pin > 7) ? 1 : 0;\n    return (lastRead[port] & (1 << (pin % 8))) ? HIGH : LOW;\n}\n\nuint8_t PCF8574IoAbstraction::readPort(pinid_t pin) {\n    int port = (pin > 7) ? 1 : 0;\n    return lastRead[port];\n}\n\nvoid PCF8574IoAbstraction::writePort(pinid_t pin, uint8_t value) {\n    int port = (pin > 7) ? 1 : 0;\n    toWrite[port] = value;\n    bitWrite(flags, NEEDS_WRITE_FLAG, true);\n}\n\nbool PCF8574IoAbstraction::runLoop(){\n    bool writeOk = true;\n    size_t bytesToTransfer = bitRead(flags, PCF8575_16BIT_FLAG) ? 2 : 1;\n    if (bitRead(flags, NEEDS_WRITE_FLAG)) {\n        bitWrite(flags, NEEDS_WRITE_FLAG, false);\n        writeOk = ioaWireWriteWithRetry(wireImpl, address, toWrite, bytesToTransfer);\n    }\n\n    if(bitRead(flags, PINS_CONFIGURED_READ_FLAG)) {\n        writeOk = writeOk && ioaWireRead(wireImpl, address, lastRead, bytesToTransfer);\n    }\n    return writeOk;\n}\n\nvoid PCF8574IoAbstraction::attachInterrupt(pinid_t \/*pin*\/, RawIntHandler intHandler, uint8_t \/*mode*\/) {\n\t\/\/ if there's an interrupt pin set\n\tif(interruptPin == 0xff) return;\n\n\tinternalDigitalIo()->pinDirection(interruptPin, INPUT_PULLUP);\n\tinternalDigitalIo()->attachInterrupt(interruptPin, intHandler, FALLING);\n}\n\nBasicIoAbstraction* ioFrom8574(uint8_t addr, pinid_t interruptPin, WireType wireImpl) {\n\treturn new PCF8574IoAbstraction(addr, interruptPin, wireImpl);\n}\n\nBasicIoAbstraction* ioFrom8575(uint8_t addr, pinid_t interruptPin, WireType wireImpl) {\n    return new PCF8574IoAbstraction(addr, interruptPin, wireImpl, true);\n}\n\nMCP23017IoAbstraction::MCP23017IoAbstraction(uint8_t address, Mcp23xInterruptMode intMode, pinid_t intPinA, pinid_t intPinB, WireType wireImpl) {\n\tthis->wireImpl = wireImpl;\n\tthis->address = address;\n\tthis->intPinA = intPinA;\n\tthis->intPinB = intPinB;\n\tthis->intMode = intMode;\n\tthis->toWrite = this->lastRead = 0;\n\tthis->needsInit = true;\n\tthis->portFlags = 0;\n}\n\nvoid MCP23017IoAbstraction::initDevice() {\n\tuint8_t controlReg = (readFromDevice(IOCON_ADDR) & 0xff);\n\t\n\tif(intPinB == 0xff && intPinA != 0xff) {\n\t\tbitSet(controlReg, IOCON_MIRROR_BIT);\n\t}\n\telse if(intPinA != 0xff) {\n\t\tbitClear(controlReg, IOCON_MIRROR_BIT);\n\t}\n\n\tbitClear(controlReg, IOCON_BANK_BIT);\n\tbitClear(controlReg, IOCON_SEQOP_BIT);\n\n\tuint16_t regToWrite = controlReg | (((uint16_t)controlReg) << 8U);\n\twriteToDevice(IOCON_ADDR, regToWrite);\n\n\tportFlags = 0;\n\tneedsInit = false;\n}\n\nvoid MCP23017IoAbstraction::toggleBitInRegister(uint8_t regAddr, uint8_t theBit, bool value) {\n\tuint16_t reg = readFromDevice(regAddr);\n\tbitWrite(reg, theBit, value);\n\n\t\/\/ for debugging to see the commands being sent, uncomment below\n\t\/\/serdebugF4(\"toggle(regAddr, bit, toggle): \", regAddr, theBit, value);\n\t\/\/serdebugFHex(\"Value: \", reg);\n\t\/\/ end debugging code\n\n\twriteToDevice(regAddr, reg);\n}\n\nvoid MCP23017IoAbstraction::pinDirection(pinid_t pin, uint8_t mode) {\n\tif(needsInit) initDevice();\n\n\ttoggleBitInRegister(IODIR_ADDR, pin, (mode == INPUT || mode == INPUT_PULLUP));\n\ttoggleBitInRegister(GPPU_ADDR, pin, mode == INPUT_PULLUP);\n\n\tbitSet(portFlags, (pin < 8) ? READER_PORTA_BIT : READER_PORTB_BIT);\n}\n\nvoid MCP23017IoAbstraction::writeValue(pinid_t pin, uint8_t value) {\n\tif(needsInit) initDevice();\n\n\tbitWrite(toWrite, pin, value);\n\tbitSet(portFlags, (pin < 8) ? CHANGE_PORTA_BIT : CHANGE_PORTB_BIT);\n}\n\nuint8_t MCP23017IoAbstraction::readValue(pinid_t pin) {\n\treturn bitRead(lastRead, pin);\n}\n\nuint8_t MCP23017IoAbstraction::readPort(pinid_t pin) {\n\treturn (pin < 8) ? (lastRead & 0xff) : (lastRead >> 8);\n}\n\nvoid MCP23017IoAbstraction::writePort(pinid_t pin, uint8_t value) {\n\tif(pin < 8) {\n\t\ttoWrite &= 0xff00; \n\t\ttoWrite |= value;\n\t\tbitSet(portFlags, CHANGE_PORTA_BIT);\n\t}\n\telse {\n\t\ttoWrite &= 0x00ff; \n\t\ttoWrite |= ((uint16_t)value << 8);\n\t\tbitSet(portFlags, CHANGE_PORTB_BIT);\n\t}\n}\n\nbool MCP23017IoAbstraction::runLoop() {\n\tif(needsInit) initDevice();\n\n\tbool writeOk = true;\n\n\tbool flagA = bitRead(portFlags, CHANGE_PORTA_BIT);\n\tbool flagB = bitRead(portFlags, CHANGE_PORTB_BIT);\n\tif(flagA && flagB) \/\/ write on both ports\n\t\twriteOk = writeToDevice(OUTLAT_ADDR, toWrite);\n\telse if(flagA) \n\t\twriteOk = writeToDevice8(OUTLAT_ADDR, toWrite);\n\telse if(flagB)\n\t\twriteOk = writeToDevice8(OUTLAT_ADDR + 1, toWrite >> 8);\n\n\tbitClear(portFlags, CHANGE_PORTA_BIT);\n\tbitClear(portFlags, CHANGE_PORTB_BIT);\n\n\tflagA = bitRead(portFlags, READER_PORTA_BIT);\n\tflagB = bitRead(portFlags, READER_PORTB_BIT);\n\tif(flagA && flagB)\n\t\tlastRead = readFromDevice(GPIO_ADDR);\n\telse if(flagA)\n\t\tlastRead = readFromDevice8(GPIO_ADDR);\n\telse if(flagB)\n\t\tlastRead = readFromDevice8(GPIO_ADDR + 1) << 8U;\n\n\treturn writeOk;\n}\n\nbool MCP23017IoAbstraction::writeToDevice(uint8_t reg, uint16_t command) {\n\tuint8_t data[3];\n\tdata[0] = reg;\n    data[1] = (uint8_t)command;\n    data[2] = (uint8_t)(command>>8);\n\treturn ioaWireWriteWithRetry(wireImpl, address, data, sizeof data);\n}\n\nbool MCP23017IoAbstraction::writeToDevice8(uint8_t reg, uint8_t command) {\n    uint8_t data[2];\n    data[0] = reg;\n    data[1] = (uint8_t)command;\n    return ioaWireWriteWithRetry(wireImpl, address, data, sizeof data);\n}\n\nuint16_t MCP23017IoAbstraction::readFromDevice(uint8_t reg) {\n\tioaWireWriteWithRetry(wireImpl, address, &reg, 1, 0, false);\n\n\tuint8_t data[2];\n\tioaWireRead(wireImpl, address, data, sizeof data);\n\t\/\/ read will get port A first then port B.\n\tuint8_t portA = data[0];\n\tuint16_t portB = data[1] << 8U;\n\treturn portA | portB;\n}\n\nuint8_t MCP23017IoAbstraction::readFromDevice8(uint8_t reg) {\n    ioaWireWriteWithRetry(wireImpl, address, &reg, 1, 0);\n\n\tuint8_t buffer[2];\n    if(ioaWireRead(wireImpl, address, buffer, 1)){\n       return buffer[0];\n    }\n    return 0;\n}\n\nvoid MCP23017IoAbstraction::attachInterrupt(pinid_t pin, RawIntHandler intHandler, uint8_t mode) {\n\t\/\/ only if there's an interrupt pin set\n\tif(intPinA == 0xff) return;\n\n\tauto  inbuiltIo = internalDigitalIo();\n\tuint8_t pm = (intMode == ACTIVE_HIGH_OPEN || intMode == ACTIVE_LOW_OPEN) ? INPUT_PULLUP : INPUT;\n\tuint8_t im = (intMode == ACTIVE_HIGH || intMode == ACTIVE_HIGH_OPEN) ? RISING : FALLING;\n\tif(intPinB == 0xff) {\n        inbuiltIo->pinDirection(intPinA, pm);\n        inbuiltIo->attachInterrupt(intPinA, intHandler, im);\n\t}\n\telse {\n        inbuiltIo->pinDirection(intPinA, pm);\n        inbuiltIo->attachInterrupt(intPinA, intHandler, im);\n        inbuiltIo->pinDirection(intPinB, pm);\n        inbuiltIo->attachInterrupt(intPinB, intHandler, im);\n    }\n\n\ttoggleBitInRegister(GPINTENA_ADDR, pin, true);\n\ttoggleBitInRegister(INTCON_ADDR, pin, mode != CHANGE);\n\ttoggleBitInRegister(DEFVAL_ADDR, pin, mode == FALLING);\n}\n\nvoid MCP23017IoAbstraction::setInvertInputPin(pinid_t pin, bool shouldInvert) {\n    toggleBitInRegister(IPOL_ADDR, pin, shouldInvert);\n}\n\nIoAbstractionRef ioFrom23017(pinid_t addr, WireType wireImpl) {\n\treturn ioFrom23017IntPerPort(addr, NOT_ENABLED, 0xff, 0xff, wireImpl);\n}\n\nIoAbstractionRef ioFrom23017(uint8_t addr, Mcp23xInterruptMode intMode, pinid_t interruptPin, WireType wireImpl) {\n\treturn ioFrom23017IntPerPort(addr, intMode, interruptPin, 0xff, wireImpl);\n}\n\nIoAbstractionRef ioFrom23017IntPerPort(pinid_t addr, Mcp23xInterruptMode intMode, pinid_t intPinA, pinid_t intPinB, WireType wireImpl) {\n\treturn new MCP23017IoAbstraction(addr, intMode, intPinA, intPinB, wireImpl);\n}<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n\n This file is part of the GLC-lib library.\n Copyright (C) 2005-2008 Laurent Ribon (laumaya@users.sourceforge.net)\n Version 1.0.0, packaged on August, 2008.\n\n http:\/\/glc-lib.sourceforge.net\n\n GLC-lib 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 GLC-lib is distributed in the hope that it 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 GLC-lib; 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 glc_vbogeom.cpp Implementation of the GLC_VboGeom class.\n\n#include \"glc_vbogeom.h\"\n#include \"glc_openglexception.h\"\n#include \"glc_selectionmaterial.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Constructor destructor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Default constructor\nGLC_VboGeom::GLC_VboGeom(const QString& name, const bool typeIsWire)\n:GLC_Object(name)\n, m_VboId(0)\n, m_IboId(0)\n, m_GeometryIsValid(false)\t\/\/ By default geometry is invalid\n, m_pMaterial(NULL)\t\t\t\/\/ have to be set later in constructor\n, m_UseColorPerVertex(false)\n, m_IsWire(typeIsWire)\t\t\/\/ the geometry type\n, m_IsTransparent(false)\t\/\/ Not transparent by default\n{\t\n\t\/\/ Material is set here\n\tsetMaterial(new GLC_Material());\n}\n\/\/ Copy constructor\nGLC_VboGeom::GLC_VboGeom(const GLC_VboGeom& sourceGeom)\n:GLC_Object(sourceGeom)\n, m_VboId(0)\n, m_IboId(0)\n, m_GeometryIsValid(false)\t\/\/ By default geometry is invalid\n, m_pMaterial(NULL)\t\t\t\/\/ have to be set later in constructor\n, m_UseColorPerVertex(sourceGeom.m_UseColorPerVertex)\n, m_IsWire(sourceGeom.m_IsWire)\n, m_IsTransparent(sourceGeom.m_IsTransparent)\n{\n\tm_Uid= glc::GLC_GenID();\n\t\/\/ Material is copy here\n\tsetMaterial(new GLC_Material());\n\tm_pMaterial->setMaterial(sourceGeom.getMaterial());\n}\n\nGLC_VboGeom::~GLC_VboGeom()\n{\n\t\/\/ VBO\n\tif (0 != m_VboId)\n\t\tglDeleteBuffers(1, &m_VboId);\n\t\/\/ IBO\n\tif (0 != m_IboId)\n\t\tglDeleteBuffers(1, &m_IboId);\n\t\/\/ Material\t\n\tif (NULL != m_pMaterial)\n\t{\n\t\tm_pMaterial->delGLC_Geom(getID());\t\/\/Remove Geometry from the material usage collection\n\t\tif (m_pMaterial->isUnused()) delete m_pMaterial;\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Get Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ return the geometry bounding box\nGLC_BoundingBox* GLC_VboGeom::getBoundingBox(void) const\n{\n\treturn NULL;\t\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Material\nvoid GLC_VboGeom::setMaterial(GLC_Material* pMat)\n{\n\tif (pMat != m_pMaterial)\n\t{\n\t\tif (pMat != NULL)\n\t\t{\n\t\t\tpMat->addGLC_Geom(this);\n\t\t}\n\t\n\t\tif (m_pMaterial != NULL)\n\t\t{\n\t\t\tm_pMaterial->delGLC_Geom(getID());\n\t\t\tif (m_pMaterial->isUnused()) delete m_pMaterial;\n\t\t}\n\n\t\tm_pMaterial= pMat;\n\t\t\n\t\t\/\/ Test if the material is transparent\n\t\tif (m_pMaterial->isTransparent())\n\t\t{\n\t\t\tsetTransparency(true);\n\t\t}\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ if the geometry have a texture, load it\nvoid GLC_VboGeom::glLoadTexture(void)\n{\n\tm_pMaterial->glLoadTexture();\n}\n\n\/\/ Geometry display\nvoid GLC_VboGeom::glExecute(bool isSelected, bool forceWire)\n{\n\t\/\/ Define Geometry's property\n\tglPropGeom(isSelected, forceWire);\n\n\tif (0 == m_VboId)\n\t{\n\t\tcreateVBOs();\n\t}\n\telse\n\t{\n\t\tglBindBuffer(GL_ARRAY_BUFFER, m_VboId);\n\t\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, m_IboId);\n\t}\n\t\n\tglDraw();\n\tm_GeometryIsValid= true;\n\t\n\t\/\/ Unbind VBOs\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n\t\n\t\/\/ OpenGL error handler\n\tGLenum error= glGetError();\t\n\tif (error != GL_NO_ERROR)\n\t{\n\t\tGLC_OpenGlException OpenGlException(\"GLC_VboGeom::GlExecute \", error);\n\t\tthrow(OpenGlException);\n\t}\n}\n\n\/\/ Virtual interface for OpenGL Geometry properties.\nvoid GLC_VboGeom::glPropGeom(bool isSelected, bool forceWire)\n{\n\t\n\tif(m_IsWire || forceWire)\n\t{\n\t\tglDisable(GL_TEXTURE_2D);\n\t\tglDisable(GL_LIGHTING);\n\t\t\n\t\tif (isSelected) GLC_SelectionMaterial::glExecute();\n\t\telse glColor4f(getdRed(), getdGreen(), getdBlue(), getdAlpha());\t\t\t\/\/ is color\n\t}\n\telse if (m_pMaterial->getAddRgbaTexture())\n\t{\n\t\tglEnable(GL_TEXTURE_2D);\n\t\tglEnable(GL_LIGHTING);\n\t\tm_pMaterial->glExecute();\n\t\tif (isSelected) GLC_SelectionMaterial::glExecute();\t\t\n\t}\n\telse\n\t{\n\t\tglDisable(GL_TEXTURE_2D);\n\t\tglEnable(GL_LIGHTING);\n\t\tif (isSelected) GLC_SelectionMaterial::glExecute();\n\t\telse m_pMaterial->glExecute();\n\t}\n\t\t\n\t\/\/ OpenGL error handler\n\tGLenum error= glGetError();\t\n\tif (error != GL_NO_ERROR)\n\t{\n\t\tGLC_OpenGlException OpenGlException(\"GLC_VboGeom::GlPropGeom \", error);\n\t\tthrow(OpenGlException);\n\t}\t\n}\n\n\/\/ Vbo creation\nvoid GLC_VboGeom::createVBOs()\n{\n\tglGenBuffers(1, &m_VboId);\n\tglBindBuffer(GL_ARRAY_BUFFER, m_VboId);\n\tglGenBuffers(1, &m_IboId);\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, m_IboId);\n}\n<commit_msg>Force to use selection shader (Test purpose)<commit_after>\/****************************************************************************\n\n This file is part of the GLC-lib library.\n Copyright (C) 2005-2008 Laurent Ribon (laumaya@users.sourceforge.net)\n Version 1.0.0, packaged on August, 2008.\n\n http:\/\/glc-lib.sourceforge.net\n\n GLC-lib 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 GLC-lib is distributed in the hope that it 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 GLC-lib; 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 glc_vbogeom.cpp Implementation of the GLC_VboGeom class.\n\n#include \"glc_vbogeom.h\"\n#include \"glc_openglexception.h\"\n#include \"glc_selectionmaterial.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Constructor destructor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Default constructor\nGLC_VboGeom::GLC_VboGeom(const QString& name, const bool typeIsWire)\n:GLC_Object(name)\n, m_VboId(0)\n, m_IboId(0)\n, m_GeometryIsValid(false)\t\/\/ By default geometry is invalid\n, m_pMaterial(NULL)\t\t\t\/\/ have to be set later in constructor\n, m_UseColorPerVertex(false)\n, m_IsWire(typeIsWire)\t\t\/\/ the geometry type\n, m_IsTransparent(false)\t\/\/ Not transparent by default\n{\t\n\t\/\/ Material is set here\n\tsetMaterial(new GLC_Material());\n}\n\/\/ Copy constructor\nGLC_VboGeom::GLC_VboGeom(const GLC_VboGeom& sourceGeom)\n:GLC_Object(sourceGeom)\n, m_VboId(0)\n, m_IboId(0)\n, m_GeometryIsValid(false)\t\/\/ By default geometry is invalid\n, m_pMaterial(NULL)\t\t\t\/\/ have to be set later in constructor\n, m_UseColorPerVertex(sourceGeom.m_UseColorPerVertex)\n, m_IsWire(sourceGeom.m_IsWire)\n, m_IsTransparent(sourceGeom.m_IsTransparent)\n{\n\tm_Uid= glc::GLC_GenID();\n\t\/\/ Material is copy here\n\tsetMaterial(new GLC_Material());\n\tm_pMaterial->setMaterial(sourceGeom.getMaterial());\n}\n\nGLC_VboGeom::~GLC_VboGeom()\n{\n\t\/\/ VBO\n\tif (0 != m_VboId)\n\t\tglDeleteBuffers(1, &m_VboId);\n\t\/\/ IBO\n\tif (0 != m_IboId)\n\t\tglDeleteBuffers(1, &m_IboId);\n\t\/\/ Material\t\n\tif (NULL != m_pMaterial)\n\t{\n\t\tm_pMaterial->delGLC_Geom(getID());\t\/\/Remove Geometry from the material usage collection\n\t\tif (m_pMaterial->isUnused()) delete m_pMaterial;\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Get Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ return the geometry bounding box\nGLC_BoundingBox* GLC_VboGeom::getBoundingBox(void) const\n{\n\treturn NULL;\t\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Material\nvoid GLC_VboGeom::setMaterial(GLC_Material* pMat)\n{\n\tif (pMat != m_pMaterial)\n\t{\n\t\tif (pMat != NULL)\n\t\t{\n\t\t\tpMat->addGLC_Geom(this);\n\t\t}\n\t\n\t\tif (m_pMaterial != NULL)\n\t\t{\n\t\t\tm_pMaterial->delGLC_Geom(getID());\n\t\t\tif (m_pMaterial->isUnused()) delete m_pMaterial;\n\t\t}\n\n\t\tm_pMaterial= pMat;\n\t\t\n\t\t\/\/ Test if the material is transparent\n\t\tif (m_pMaterial->isTransparent())\n\t\t{\n\t\t\tsetTransparency(true);\n\t\t}\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ if the geometry have a texture, load it\nvoid GLC_VboGeom::glLoadTexture(void)\n{\n\tm_pMaterial->glLoadTexture();\n}\n\n\/\/ Geometry display\nvoid GLC_VboGeom::glExecute(bool isSelected, bool forceWire)\n{\n\t\/\/ Define Geometry's property\n\tglPropGeom(isSelected, forceWire);\n\n\tif (0 == m_VboId)\n\t{\n\t\tcreateVBOs();\n\t}\n\telse\n\t{\n\t\tglBindBuffer(GL_ARRAY_BUFFER, m_VboId);\n\t\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, m_IboId);\n\t}\n\tif (isSelected)\n\t{\n\t\tGLC_SelectionMaterial::useShader();\n\t}\n\t\t\n\tglDraw();\n\tif (isSelected) GLC_SelectionMaterial::unUseShader();\n\tm_GeometryIsValid= true;\n\t\n\t\/\/ Unbind VBOs\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n\t\n\t\/\/ OpenGL error handler\n\tGLenum error= glGetError();\t\n\tif (error != GL_NO_ERROR)\n\t{\n\t\tGLC_OpenGlException OpenGlException(\"GLC_VboGeom::GlExecute \", error);\n\t\tthrow(OpenGlException);\n\t}\n}\n\n\/\/ Virtual interface for OpenGL Geometry properties.\nvoid GLC_VboGeom::glPropGeom(bool isSelected, bool forceWire)\n{\n\t\n\tif(m_IsWire || forceWire)\n\t{\n\t\tglDisable(GL_TEXTURE_2D);\n\t\tglDisable(GL_LIGHTING);\n\t\t\n\t\tif (isSelected) GLC_SelectionMaterial::glExecute();\n\t\telse glColor4f(getdRed(), getdGreen(), getdBlue(), getdAlpha());\t\t\t\/\/ is color\n\t}\n\telse if (m_pMaterial->getAddRgbaTexture())\n\t{\n\t\tglEnable(GL_TEXTURE_2D);\n\t\tglEnable(GL_LIGHTING);\n\t\tm_pMaterial->glExecute();\n\t\tif (isSelected) GLC_SelectionMaterial::glExecute();\t\t\n\t}\n\telse\n\t{\n\t\tglDisable(GL_TEXTURE_2D);\n\t\tglEnable(GL_LIGHTING);\n\t\tif (isSelected) GLC_SelectionMaterial::glExecute();\n\t\telse m_pMaterial->glExecute();\n\t}\n\t\t\n\t\/\/ OpenGL error handler\n\tGLenum error= glGetError();\t\n\tif (error != GL_NO_ERROR)\n\t{\n\t\tGLC_OpenGlException OpenGlException(\"GLC_VboGeom::GlPropGeom \", error);\n\t\tthrow(OpenGlException);\n\t}\t\n}\n\n\/\/ Vbo creation\nvoid GLC_VboGeom::createVBOs()\n{\n\tglGenBuffers(1, &m_VboId);\n\tglBindBuffer(GL_ARRAY_BUFFER, m_VboId);\n\tglGenBuffers(1, &m_IboId);\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, m_IboId);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __MODEL_HPP_INCLUDED\n#define __MODEL_HPP_INCLUDED\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h>\n#endif\n\n\/\/ Include GLFW\n#ifndef __GLFW3_H_INCLUDED\n#define __GLFW3_H_INCLUDED\n#include <glfw3.h>\n#endif\n\n\/\/ Include GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp>\n#endif\n\n#include <iostream>\n#include <queue> \/\/ std::queue\n#include <string.h>\n#include \"globals.hpp\"\n#include \"shader.hpp\"\n#include \"heightmap_loader.hpp\"\n#include \"objloader.hpp\"\n\nnamespace model\n{\n    class World\n    {\n        public:\n            \/\/ constructor.\n            World();\n\n            \/\/ destructor.\n            ~World();\n\n            \/\/ this method renders the entire world, one shader at a time.\n            void render();\n\n            \/\/ this method sets a shader pointer.\n            void set_pointer(GLuint shaderID, void* shader_pointer);\n\n            \/\/ this method gets a shader pointer.\n            void* get_pointer(GLuint shaderID);\n\n            \/\/ this method gets a shader ID and removes it from the `free_shaderID_queue` if it was popped from the queue.\n            GLuint get_shaderID();\n\n        private:\n            std::vector<void*> shader_pointer_vector;\n            std::queue<GLuint> free_shaderID_queue;\n    };\n\n    class Shader\n    {\n        public:\n            \/\/ constructor.\n            Shader(ShaderStruct shader_struct);\n\n            \/\/ destructor.\n            ~Shader();\n\n            \/\/ this method renders all species using this shader.\n            void render();\n\n            \/\/ this method sets a species pointer.\n            void set_pointer(GLuint speciesID, void* species_pointer);\n\n            \/\/ this method gets a species pointer.\n            void* get_pointer(GLuint speciesID);\n\n            \/\/ this method gets a species ID and removes it from the `free_speciesID_queue` if it was popped from the queue.\n            GLuint get_speciesID();\n\n            \/\/ this method sets pointer to this shader to NULL, sets `world_pointer` according to the input, and requests a new `shaderID` from the new world.\n            void switch_to_new_world(model::World *new_world_pointer);\n\n            model::World *world_pointer;          \/\/ pointer to the world.\n\n            GLuint shaderID;                      \/\/ shader ID, returned by `model::World->get_shaderID()`.\n\n            std::string vertex_shader;            \/\/ filename of vertex shader.\n            std::string fragment_shader;          \/\/ filename of fragment shader.\n\n            GLuint programID;                     \/\/ shaders' programID, returned by `LoadShaders`.\n\n        private:\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\n\n            const char *char_vertex_shader;\n            const char *char_fragment_shader;\n    };\n\n    class Graph\n    {\n        public:\n            \/\/ constructor.\n            Graph();\n\n            \/\/ destructor.\n            ~Graph();\n\n            \/\/ this method sets a node pointer.\n            void set_pointer(GLuint nodeID, void* node_pointer);\n\n            \/\/ this method gets a node pointer.\n            void* get_pointer(GLuint nodeID);\n\n            \/\/ this method gets a node ID and removes it from the `free_nodeID_queue` if it was popped from the queue.\n            GLuint get_nodeID();\n\n        private:\n            std::vector<void*> node_pointer_vector;\n            std::queue<GLuint> free_nodeID_queue;\n    };\n\n    \/\/ `Node` is not a subclass of `Graph` because if the graph splits, node may be transferred to an another graph.\n    \/\/ Transferring a node to a new graph naturally requires appropriate reindexing of `nodeID`s.\n    \/\/ The graph in which a node belongs is accessible through `void* graph_pointer` (must be cast to `model::Graph*`).\n    class Node\n    {\n        public:\n            \/\/ constructor.\n            Node(NodeStruct node_struct);\n\n            \/\/ destructor.\n            ~Node();\n\n            \/\/ this method creates a bidirectional link.\n            \/\/ creating of bidirectional links is not possible before all nodes are created.\n            void create_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes a bidirectional link.\n            \/\/ deleting of links is not possible before all nodes are created.\n            void delete_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method transfers this node to a new graph.\n            \/\/ links will not be changed.\n            \/\/ all nodes that are to be transferred must be transferred separately.\n            \/\/ before transfering any node to a new graph,\n            \/\/ all links to nodes that do not belong to the new graph of this node must be deleted with separate `delete_bidirectional_link` calls.\n            void transfer_to_new_graph(model::Graph *new_graph_pointer);\n\n            GLuint nodeID;\n            model::Graph *graph_pointer;\n\n            \/\/ nodes do not keep pointers to neighbor nodes, because all pointer values are not known yet before all nodes are created.\n            std::vector<GLuint> neighbor_nodeIDs;\n\n        private:\n            \/\/ this method creates an unidirectional link.\n            \/\/ in the constructor only unidirectional links can be created.\n            void create_unidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes an unidirectional link.\n            void delete_unidirectional_link(GLuint nodeID);\n\n            glm::vec3 coordinate_vector;\n    };\n\n    class Species\n    {\n        public:\n            \/\/ constructor.\n            Species(SpeciesStruct species_struct);\n\n            \/\/ destructor.\n            ~Species();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a object pointer.\n            void set_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_pointer(GLuint objectID);\n\n            \/\/ this method gets a object ID and removes it from the `free_objectID_queue` if it was popped from the queue.\n            GLuint get_objectID();\n\n            \/\/ this method sets pointer to this species to NULL, sets `shader_pointer` according to the input, and requests a new `speciesID` from the new shader.\n            void switch_to_new_shader(model::Shader *new_shader_pointer);\n\n            model::Shader *shader_pointer;           \/\/ pointer to the shader.\n\n            std::string model_file_format;           \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string model_filename;              \/\/ filename of the model file.\n            std::string texture_file_format;         \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string texture_filename;            \/\/ filename of the model file.\n            std::string color_channel;               \/\/ filename of fragment shader.\n            std::vector<ObjectStruct> object_vector; \/\/ vector of individual objects of this species.\n            glm::vec3 lightPos;                      \/\/ light position.\n\n            void *vertex_UV_pointer;                 \/\/ pointer to the vertex & UV species (not yet in use!).\n            void *texture_pointer;                   \/\/ pointer to the texture species (not yet in use!).\n\n            \/\/ The rest fields are created in the constructor.\n            GLuint speciesID;                      \/\/ species ID, returned by `model::World->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            GLuint texture;                        \/\/ Texture, returned by `load_DDS_texture` or `load_BMP_texture`.\n            GLuint textureID;                      \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n            GLuint MatrixID;\n            GLuint ViewMatrixID;\n            GLuint ModelMatrixID;\n            GLuint vertexPosition_modelspaceID;\n            GLuint vertexUVID;\n            GLuint vertexNormal_modelspaceID;\n\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object.\n\n            std::vector<GLuint> indices;           \/\/ the deleted vertices will be reused (though it is not required, if there's enough memory).\n            std::vector<glm::vec3> indexed_vertices;\n            std::vector<glm::vec2> indexed_UVs;\n            std::vector<glm::vec3> indexed_normals;\n\n            GLuint vertexbuffer;\n            GLuint uvbuffer;\n            GLuint normalbuffer;\n            GLuint elementbuffer;\n\n            glm::mat4 ProjectionMatrix;\n            glm::mat4 ViewMatrix;\n        private:\n            const char *char_model_file_format;\n            const char *char_model_filename;\n            const char *char_texture_file_format;\n            const char *char_texture_filename;\n            const char *char_color_channel;\n\n            std::vector<void*> object_pointer_vector;\n            std::queue<GLuint> free_objectID_queue;\n    };\n\n    class Object\n    {\n        public:\n            \/\/ constructor.\n            Object(ObjectStruct object_struct);\n\n            \/\/ destructor.\n            ~Object();\n\n            \/\/ this method renders this object.\n            void render();\n\n            \/\/ this method sets pointer to this object to NULL, sets `species_pointer` according to the input, and requests a new `objectID` from the new species.\n            void switch_to_new_species(model::Species *new_species_pointer);\n\n            model::Species *species_pointer;       \/\/ pointer to the species.\n\n            GLuint objectID;                      \/\/ object ID, returned by `model::Species->get_objectID()`.\n\n            bool has_entered;\n            glm::vec3 coordinate_vector;           \/\/ rotate vector.\n            GLfloat rotate_angle;                  \/\/ rotate angle.\n            glm::vec3 rotate_vector;               \/\/ rotate vector.\n            glm::vec3 translate_vector;            \/\/ translate vector.\n\n            \/\/ The rest fields are created in the constructor.\n            glm::mat4 model_matrix;                \/\/ model matrix.\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object. not used at the moment.\n\n            glm::mat4 MVP_matrix;                  \/\/ model view projection matrix.\n    };\n}\n\n#endif\n<commit_msg>`class Species`: `GLuint speciesID` on `private`-muuttuja.<commit_after>#ifndef __MODEL_HPP_INCLUDED\n#define __MODEL_HPP_INCLUDED\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h>\n#endif\n\n\/\/ Include GLFW\n#ifndef __GLFW3_H_INCLUDED\n#define __GLFW3_H_INCLUDED\n#include <glfw3.h>\n#endif\n\n\/\/ Include GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp>\n#endif\n\n#include <iostream>\n#include <queue> \/\/ std::queue\n#include <string.h>\n#include \"globals.hpp\"\n#include \"shader.hpp\"\n#include \"heightmap_loader.hpp\"\n#include \"objloader.hpp\"\n\nnamespace model\n{\n    class World\n    {\n        public:\n            \/\/ constructor.\n            World();\n\n            \/\/ destructor.\n            ~World();\n\n            \/\/ this method renders the entire world, one shader at a time.\n            void render();\n\n            \/\/ this method sets a shader pointer.\n            void set_pointer(GLuint shaderID, void* shader_pointer);\n\n            \/\/ this method gets a shader pointer.\n            void* get_pointer(GLuint shaderID);\n\n            \/\/ this method gets a shader ID and removes it from the `free_shaderID_queue` if it was popped from the queue.\n            GLuint get_shaderID();\n\n        private:\n            std::vector<void*> shader_pointer_vector;\n            std::queue<GLuint> free_shaderID_queue;\n    };\n\n    class Shader\n    {\n        public:\n            \/\/ constructor.\n            Shader(ShaderStruct shader_struct);\n\n            \/\/ destructor.\n            ~Shader();\n\n            \/\/ this method renders all species using this shader.\n            void render();\n\n            \/\/ this method sets a species pointer.\n            void set_pointer(GLuint speciesID, void* species_pointer);\n\n            \/\/ this method gets a species pointer.\n            void* get_pointer(GLuint speciesID);\n\n            \/\/ this method gets a species ID and removes it from the `free_speciesID_queue` if it was popped from the queue.\n            GLuint get_speciesID();\n\n            \/\/ this method sets pointer to this shader to NULL, sets `world_pointer` according to the input, and requests a new `shaderID` from the new world.\n            void switch_to_new_world(model::World *new_world_pointer);\n\n            model::World *world_pointer;          \/\/ pointer to the world.\n\n            GLuint shaderID;                      \/\/ shader ID, returned by `model::World->get_shaderID()`.\n\n            std::string vertex_shader;            \/\/ filename of vertex shader.\n            std::string fragment_shader;          \/\/ filename of fragment shader.\n\n            GLuint programID;                     \/\/ shaders' programID, returned by `LoadShaders`.\n\n        private:\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\n\n            const char *char_vertex_shader;\n            const char *char_fragment_shader;\n    };\n\n    class Graph\n    {\n        public:\n            \/\/ constructor.\n            Graph();\n\n            \/\/ destructor.\n            ~Graph();\n\n            \/\/ this method sets a node pointer.\n            void set_pointer(GLuint nodeID, void* node_pointer);\n\n            \/\/ this method gets a node pointer.\n            void* get_pointer(GLuint nodeID);\n\n            \/\/ this method gets a node ID and removes it from the `free_nodeID_queue` if it was popped from the queue.\n            GLuint get_nodeID();\n\n        private:\n            std::vector<void*> node_pointer_vector;\n            std::queue<GLuint> free_nodeID_queue;\n    };\n\n    \/\/ `Node` is not a subclass of `Graph` because if the graph splits, node may be transferred to an another graph.\n    \/\/ Transferring a node to a new graph naturally requires appropriate reindexing of `nodeID`s.\n    \/\/ The graph in which a node belongs is accessible through `void* graph_pointer` (must be cast to `model::Graph*`).\n    class Node\n    {\n        public:\n            \/\/ constructor.\n            Node(NodeStruct node_struct);\n\n            \/\/ destructor.\n            ~Node();\n\n            \/\/ this method creates a bidirectional link.\n            \/\/ creating of bidirectional links is not possible before all nodes are created.\n            void create_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes a bidirectional link.\n            \/\/ deleting of links is not possible before all nodes are created.\n            void delete_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method transfers this node to a new graph.\n            \/\/ links will not be changed.\n            \/\/ all nodes that are to be transferred must be transferred separately.\n            \/\/ before transfering any node to a new graph,\n            \/\/ all links to nodes that do not belong to the new graph of this node must be deleted with separate `delete_bidirectional_link` calls.\n            void transfer_to_new_graph(model::Graph *new_graph_pointer);\n\n            GLuint nodeID;\n            model::Graph *graph_pointer;\n\n            \/\/ nodes do not keep pointers to neighbor nodes, because all pointer values are not known yet before all nodes are created.\n            std::vector<GLuint> neighbor_nodeIDs;\n\n        private:\n            \/\/ this method creates an unidirectional link.\n            \/\/ in the constructor only unidirectional links can be created.\n            void create_unidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes an unidirectional link.\n            void delete_unidirectional_link(GLuint nodeID);\n\n            glm::vec3 coordinate_vector;\n    };\n\n    class Species\n    {\n        public:\n            \/\/ constructor.\n            Species(SpeciesStruct species_struct);\n\n            \/\/ destructor.\n            ~Species();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a object pointer.\n            void set_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_pointer(GLuint objectID);\n\n            \/\/ this method gets a object ID and removes it from the `free_objectID_queue` if it was popped from the queue.\n            GLuint get_objectID();\n\n            \/\/ this method sets pointer to this species to NULL, sets `shader_pointer` according to the input, and requests a new `speciesID` from the new shader.\n            void switch_to_new_shader(model::Shader *new_shader_pointer);\n\n            model::Shader *shader_pointer;           \/\/ pointer to the shader.\n\n            std::string model_file_format;           \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string model_filename;              \/\/ filename of the model file.\n            std::string texture_file_format;         \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string texture_filename;            \/\/ filename of the model file.\n            std::string color_channel;               \/\/ filename of fragment shader.\n            std::vector<ObjectStruct> object_vector; \/\/ vector of individual objects of this species.\n            glm::vec3 lightPos;                      \/\/ light position.\n\n            void *vertex_UV_pointer;                 \/\/ pointer to the vertex & UV species (not yet in use!).\n            void *texture_pointer;                   \/\/ pointer to the texture species (not yet in use!).\n\n            \/\/ The rest fields are created in the constructor.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            GLuint texture;                        \/\/ Texture, returned by `load_DDS_texture` or `load_BMP_texture`.\n            GLuint textureID;                      \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n            GLuint MatrixID;\n            GLuint ViewMatrixID;\n            GLuint ModelMatrixID;\n            GLuint vertexPosition_modelspaceID;\n            GLuint vertexUVID;\n            GLuint vertexNormal_modelspaceID;\n\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object.\n\n            std::vector<GLuint> indices;           \/\/ the deleted vertices will be reused (though it is not required, if there's enough memory).\n            std::vector<glm::vec3> indexed_vertices;\n            std::vector<glm::vec2> indexed_UVs;\n            std::vector<glm::vec3> indexed_normals;\n\n            GLuint vertexbuffer;\n            GLuint uvbuffer;\n            GLuint normalbuffer;\n            GLuint elementbuffer;\n\n            glm::mat4 ProjectionMatrix;\n            glm::mat4 ViewMatrix;\n        private:\n            GLuint speciesID;                      \/\/ species ID, returned by `model::World->get_speciesID()`.\n            const char *char_model_file_format;\n            const char *char_model_filename;\n            const char *char_texture_file_format;\n            const char *char_texture_filename;\n            const char *char_color_channel;\n\n            std::vector<void*> object_pointer_vector;\n            std::queue<GLuint> free_objectID_queue;\n    };\n\n    class Object\n    {\n        public:\n            \/\/ constructor.\n            Object(ObjectStruct object_struct);\n\n            \/\/ destructor.\n            ~Object();\n\n            \/\/ this method renders this object.\n            void render();\n\n            \/\/ this method sets pointer to this object to NULL, sets `species_pointer` according to the input, and requests a new `objectID` from the new species.\n            void switch_to_new_species(model::Species *new_species_pointer);\n\n            model::Species *species_pointer;       \/\/ pointer to the species.\n\n            GLuint objectID;                      \/\/ object ID, returned by `model::Species->get_objectID()`.\n\n            bool has_entered;\n            glm::vec3 coordinate_vector;           \/\/ rotate vector.\n            GLfloat rotate_angle;                  \/\/ rotate angle.\n            glm::vec3 rotate_vector;               \/\/ rotate vector.\n            glm::vec3 translate_vector;            \/\/ translate vector.\n\n            \/\/ The rest fields are created in the constructor.\n            glm::mat4 model_matrix;                \/\/ model matrix.\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object. not used at the moment.\n\n            glm::mat4 MVP_matrix;                  \/\/ model view projection matrix.\n    };\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2017 Ruben Van Boxem\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 * Signal\n * Registers observers.\n * Notifies registered observers.\n *\/\n\n#ifndef SKUI_CORE_SIGNAL_H\n#define SKUI_CORE_SIGNAL_H\n\n#include \"core\/slot.h++\"\n#include \"core\/trackable.h++\"\n#include \"core\/value_ptr.h++\"\n\n#include <algorithm>\n#include <functional>\n#include <iterator>\n#include <list>\n#include <memory>\n#include <mutex>\n#include <utility>\n\nnamespace skui\n{\n  namespace core\n  {\n    namespace implementation\n    {\n      template<typename... ArgTypes>\n      class signal_base : public tracker\n      {\n      public:\n        using function_type = void(*)(ArgTypes...);\n        using slot_type = slot<void, ArgTypes...>;\n        using object_slot_type = std::pair<const trackable*, value_ptr<slot_type>>;\n        using connection_type = typename std::list<object_slot_type>::const_iterator;\n\n        signal_base() = default;\n        ~signal_base() { disconnect_all(); }\n\n        signal_base(const signal_base& other)\n          : slots(other.slots.begin(), other.slots.end())\n        {}\n\n        signal_base(signal_base&& other) : slots(std::move(other.slots)) {}\n        signal_base& operator=(signal_base other) { swap(slots, other.slots); return *this; }\n\n        virtual void trackable_deleted(const trackable* tracker) override\n        {\n          disconnect(tracker);\n        }\n\n        virtual void trackable_moved(const trackable* old_object, const trackable* new_object) override\n        {\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n          std::for_each(slots.begin(), slots.end(),\n                        [&old_object, &new_object](object_slot_type& object_slot)\n                        {\n                          if(object_slot.first == old_object)\n                            object_slot.first = new_object;\n                        });\n        }\n\n        virtual void trackable_copied(const trackable* old_object, const trackable* new_object) override\n        {\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n          std::for_each(slots.begin(), slots.end(),\n                        [&old_object, &new_object, this](const object_slot_type& object_slot)\n                        {\n                          if(object_slot.first == old_object)\n                            slots.push_back({new_object, object_slot.second});\n                        });\n\n        }\n\n        template<typename Callable, typename ReturnType = void>\n        connection_type connect(Callable&& callable)\n        {\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n          slots.emplace_back(nullptr, make_value<function_slot<Callable, ReturnType, ArgTypes...>>(callable));\n          return --slots.end();\n        }\n\n        template<typename Class, typename ReturnType>\n        connection_type connect(Class* object, ReturnType(Class::* slot)(ArgTypes...))\n        {\n          static_assert(std::is_base_of<trackable, Class>::value,\n                        \"You can only connect to member functions of a trackable object.\");\n\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n\n          slots.emplace_back(object, make_value<member_function_slot<Class, ReturnType(Class::*)(ArgTypes...), ReturnType, ArgTypes...>>(slot));\n          object->track(this);\n\n          return --slots.end();\n        }\n\n        template<typename Class, typename ReturnType>\n        connection_type connect(const Class* object, ReturnType(Class::* slot)(ArgTypes...) const)\n        {\n          static_assert(std::is_base_of<trackable, Class>::value,\n                        \"You can only connect to member functions of a trackable object\");\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n\n          object_slot_type object_slot(object, make_value<const_member_function_slot<Class, ReturnType(Class::*)(ArgTypes...) const, ReturnType, ArgTypes...>>(slot));\n          slots.emplace_back(std::move(object_slot));\n          object->track(this);\n\n          return --slots.end();\n        }\n\n        \/\/ connects first object like first object\n        void connect(trackable* \/*first*\/, trackable* \/*second*\/)\n        {\n          \/\/ trackable copy constructor makes second->track(this) unnecessary\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n        }\n\n        \/\/ removes a previously made connection, handles lifetime tracking if it was the last connection to a specific object\n        void disconnect(connection_type connection)\n        {\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n          const trackable* object = connection->first;\n\n          slots.erase(connection);\n          if(object && std::any_of(slots.begin(), slots.end(),\n                                   [&object](const object_slot_type& object_slot)\n                                   { return object_slot.first == object; }))\n            object->untrack(this);\n        }\n\n        \/\/ removes all connections to an object\n        void disconnect(const trackable* object)\n        {\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n          object->untrack(this);\n          slots.remove_if([object](const object_slot_type& object_slot)\n                          {\n                            return object == object_slot.first;\n                          });\n        }\n\n        \/\/ removes all connections\n        void disconnect_all()\n        {\n          const std::lock_guard<decltype(slots_mutex)> lock(slots_mutex);\n          for(object_slot_type& object_slot : slots)\n          {\n            auto trackable = object_slot.first;\n            if(trackable)\n              trackable->untrack(this);\n          }\n          slots.clear();\n        }\n\n      protected:\n        \/\/ mutable here allows to connect to a const object's signals\n        mutable std::list<object_slot_type> slots;\n        mutable std::mutex slots_mutex;\n      };\n    }\n\n    template<typename... ArgTypes>\n    class signal : public implementation::signal_base<ArgTypes...>\n    {\n    public:\n      signal() = default;\n\n      void emit(ArgTypes... arguments) const\n      {\n        std::lock_guard<decltype(this->slots_mutex)> lock(this->slots_mutex);\n        for(auto&& object_slot : this->slots)\n        {\n          (*object_slot.second)(object_slot.first, arguments...);\n        }\n      }\n    };\n\n    \/\/ Parameterless specialization\n    template<> class signal<> : public implementation::signal_base<>\n    {\n    public:\n      signal() = default;\n\n      void emit() const\n      {\n        std::lock_guard<decltype(this->slots_mutex)> lock(this->slots_mutex);\n        for(auto&& object_slot : this->slots)\n        {\n          (*object_slot.second)(object_slot.first);\n        }\n      }\n    };\n  }\n}\n\n#endif\n<commit_msg>Clean up core::signal code a bit.<commit_after>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2017 Ruben Van Boxem\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 * Signal\n * Registers observers.\n * Notifies registered observers.\n *\/\n\n#ifndef SKUI_CORE_SIGNAL_H\n#define SKUI_CORE_SIGNAL_H\n\n#include \"core\/slot.h++\"\n#include \"core\/trackable.h++\"\n#include \"core\/value_ptr.h++\"\n\n#include <algorithm>\n#include <functional>\n#include <iterator>\n#include <list>\n#include <memory>\n#include <mutex>\n#include <utility>\n\nnamespace skui\n{\n  namespace core\n  {\n    namespace implementation\n    {\n      template<typename... ArgTypes>\n      class signal_base : public tracker\n      {\n        using mutex_type = std::mutex;\n        using mutex_lock = const std::lock_guard<mutex_type>;\n\n      public:\n        using function_type = void(*)(ArgTypes...);\n        using slot_type = slot<void, ArgTypes...>;\n        using object_slot_type = std::pair<const trackable*, value_ptr<slot_type>>;\n        using connection_type = typename std::list<object_slot_type>::const_iterator;\n\n        signal_base() = default;\n        ~signal_base() override { disconnect_all(); }\n\n        signal_base(const signal_base& other)\n          : slots(other.slots.begin(), other.slots.end())\n        {}\n\n        signal_base(signal_base&& other) : slots(std::move(other.slots)) {}\n        signal_base& operator=(signal_base other) { swap(slots, other.slots); return *this; }\n\n        virtual void trackable_deleted(const trackable* tracker) override\n        {\n          disconnect(tracker);\n        }\n\n        virtual void trackable_moved(const trackable* old_object, const trackable* new_object) override\n        {\n          mutex_lock lock(slots_mutex);\n          for(auto& object_slot : slots)\n          {\n            if(object_slot.first == old_object)\n              object_slot.first = new_object;\n          }\n        }\n\n        virtual void trackable_copied(const trackable* old_object, const trackable* new_object) override\n        {\n          mutex_lock lock(slots_mutex);\n          for(const auto& object_slot : slots)\n          {\n            if(object_slot.first == old_object)\n              slots.emplace_back(new_object, object_slot.second);\n          }\n        }\n\n        template<typename Callable, typename ReturnType = void>\n        connection_type connect(Callable&& callable)\n        {\n          mutex_lock lock(slots_mutex);\n          slots.emplace_back(nullptr, make_value<callable_slot<Callable, ReturnType, ArgTypes...>>(callable));\n          return --slots.end();\n        }\n\n        template<typename Class, typename ReturnType>\n        connection_type connect(Class* object, ReturnType(Class::* slot)(ArgTypes...))\n        {\n          static_assert(std::is_base_of<trackable, Class>::value,\n                        \"You can only connect to member functions of a trackable object.\");\n\n          mutex_lock lock(slots_mutex);\n\n          slots.emplace_back(object, make_value<member_function_slot<Class, ReturnType(Class::*)(ArgTypes...), ReturnType, ArgTypes...>>(slot));\n          object->track(this);\n\n          return --slots.end();\n        }\n\n        template<typename Class, typename ReturnType>\n        connection_type connect(const Class* object, ReturnType(Class::* slot)(ArgTypes...) const)\n        {\n          static_assert(std::is_base_of<trackable, Class>::value,\n                        \"You can only connect to member functions of a trackable object\");\n\n          mutex_lock lock(slots_mutex);\n\n          slots.emplace_back(object, make_value<const_member_function_slot<Class, ReturnType(Class::*)(ArgTypes...) const, ReturnType, ArgTypes...>>(slot));\n          object->track(this);\n\n          return --slots.end();\n        }\n\n        \/\/ connects first object like second object\n        connection_type connect(trackable* \/*first*\/, trackable* \/*second*\/)\n        {\n          \/\/ trackable copy constructor makes second->track(this) unnecessary\n          mutex_lock lock(slots_mutex);\n        }\n\n        \/\/ removes a previously made connection, handles lifetime tracking if it was the last connection to a specific object\n        void disconnect(connection_type connection)\n        {\n          mutex_lock lock(slots_mutex);\n          const trackable* object = connection->first;\n\n          slots.erase(connection);\n          if(object && std::any_of(slots.begin(), slots.end(),\n                                   [&object](const object_slot_type& object_slot)\n                                   { return object_slot.first == object; }))\n            object->untrack(this);\n        }\n\n        \/\/ removes all connections to an object\n        void disconnect(const trackable* object)\n        {\n          mutex_lock lock(slots_mutex);\n          object->untrack(this);\n          slots.remove_if([object](const object_slot_type& object_slot)\n                          {\n                            return object == object_slot.first;\n                          });\n        }\n\n        \/\/ removes all connections\n        void disconnect_all()\n        {\n          mutex_lock lock(slots_mutex);\n          for(object_slot_type& object_slot : slots)\n          {\n            auto trackable = object_slot.first;\n            if(trackable)\n              trackable->untrack(this);\n          }\n          slots.clear();\n        }\n\n      protected:\n        \/\/ mutable here allows to connect to a const object's signals\n        mutable std::list<object_slot_type> slots;\n        mutable mutex_type slots_mutex;\n      };\n    }\n\n    template<typename... ArgTypes>\n    class signal : public implementation::signal_base<ArgTypes...>\n    {\n    public:\n      signal() = default;\n\n      void emit(ArgTypes... arguments) const\n      {\n        std::lock_guard<decltype(this->slots_mutex)> lock(this->slots_mutex);\n        for(auto&& object_slot : this->slots)\n        {\n          (*object_slot.second)(object_slot.first, arguments...);\n        }\n      }\n    };\n\n    \/\/ Parameterless specialization\n    template<> class signal<> : public implementation::signal_base<>\n    {\n    public:\n      signal() = default;\n\n      void emit() const\n      {\n        std::lock_guard<decltype(this->slots_mutex)> lock(this->slots_mutex);\n        for(auto&& object_slot : this->slots)\n        {\n          (*object_slot.second)(object_slot.first);\n        }\n      }\n    };\n  }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2012 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Utility module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Utility\/Skeleton.hpp>\n#include <Nazara\/Utility\/AxisAlignedBox.hpp>\n#include <map>\n#include <Nazara\/Utility\/Debug.hpp>\n\nstruct NzSkeletonImpl\n{\n\tstd::map<NzString, unsigned int> jointMap;\n\tstd::vector<NzJoint> joints;\n\tNzAxisAlignedBox aabb;\n\tbool jointMapUpdated = false;\n};\n\nNzSkeleton::NzSkeleton(const NzSkeleton& skeleton)\n{\n\tif (skeleton.m_impl)\n\t{\n\t\tm_impl = new NzSkeletonImpl;\n\t\tm_impl->jointMap = skeleton.m_impl->jointMap;\n\t\tm_impl->jointMapUpdated = skeleton.m_impl->jointMapUpdated;\n\t\tm_impl->joints = skeleton.m_impl->joints;\n\t}\n\telse\n\t\tm_impl = nullptr;\n}\n\nNzSkeleton::~NzSkeleton()\n{\n\tDestroy();\n}\n\nbool NzSkeleton::Create(unsigned int jointCount)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (jointCount == 0)\n\t{\n\t\tNazaraError(\"Joint count must be over 0\");\n\t\treturn false;\n\t}\n\t#endif\n\n\tm_impl = new NzSkeletonImpl;\n\tm_impl->joints.resize(jointCount, NzJoint(this));\n\n\treturn true;\n}\n\nvoid NzSkeleton::Destroy()\n{\n\tif (m_impl)\n\t{\n\t\tdelete m_impl;\n\t\tm_impl = nullptr;\n\t}\n}\n\nconst NzAxisAlignedBox& NzSkeleton::GetAABB() const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn NzAxisAlignedBox::Null;\n\t}\n\t#endif\n\n\tif (m_impl->aabb.IsNull())\n\t{\n\t\tfor (unsigned int i = 0; i < m_impl->joints.size(); ++i)\n\t\t\tm_impl->aabb.ExtendTo(m_impl->joints[i].GetDerivedTranslation());\n\t}\n\n\treturn m_impl->aabb;\n}\n\nNzJoint* NzSkeleton::GetJoint(const NzString& jointName)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\tif (!m_impl->jointMapUpdated)\n\t\tUpdateJointMap();\n\n\tauto it = m_impl->jointMap.find(jointName);\n\n\t#if NAZARA_UTILITY_SAFE\n\tif (it == m_impl->jointMap.end())\n\t{\n\t\tNazaraError(\"Joint not found\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\t\/\/ Invalidation de l'AABB\n\tm_impl->aabb.SetNull();\n\n\treturn &m_impl->joints[it->second];\n}\n\nNzJoint* NzSkeleton::GetJoint(unsigned int index)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\n\tif (index >= m_impl->joints.size())\n\t{\n\t\tNazaraError(\"Joint index out of range (\" + NzString::Number(index) + \" >= \" + NzString::Number(m_impl->joints.size()) + ')');\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\t\/\/ Invalidation de l'AABB\n\tm_impl->aabb.SetNull();\n\n\treturn &m_impl->joints[index];\n}\n\nconst NzJoint* NzSkeleton::GetJoint(const NzString& jointName) const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\tif (!m_impl->jointMapUpdated)\n\t\tUpdateJointMap();\n\n\tauto it = m_impl->jointMap.find(jointName);\n\n\t#if NAZARA_UTILITY_SAFE\n\tif (it == m_impl->jointMap.end())\n\t{\n\t\tNazaraError(\"Joint not found\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\treturn &m_impl->joints[it->second];\n}\n\nconst NzJoint* NzSkeleton::GetJoint(unsigned int index) const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\n\tif (index >= m_impl->joints.size())\n\t{\n\t\tNazaraError(\"Joint index out of range (\" + NzString::Number(index) + \" >= \" + NzString::Number(m_impl->joints.size()) + ')');\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\treturn &m_impl->joints[index];\n}\n\nNzJoint* NzSkeleton::GetJoints()\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\treturn &m_impl->joints[0];\n}\n\nconst NzJoint* NzSkeleton::GetJoints() const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\treturn &m_impl->joints[0];\n}\n\nunsigned int NzSkeleton::GetJointCount() const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn 0;\n\t}\n\t#endif\n\n\treturn m_impl->joints.size();\n}\n\nint NzSkeleton::GetJointIndex(const NzString& jointName) const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn -1;\n\t}\n\t#endif\n\n\tif (!m_impl->jointMapUpdated)\n\t\tUpdateJointMap();\n\n\tauto it = m_impl->jointMap.find(jointName);\n\n\t#if NAZARA_UTILITY_SAFE\n\tif (it == m_impl->jointMap.end())\n\t{\n\t\tNazaraError(\"Joint not found\");\n\t\treturn -1;\n\t}\n\t#endif\n\n\treturn it->second;\n}\n\nvoid NzSkeleton::Interpolate(const NzSkeleton& skeletonA, const NzSkeleton& skeletonB, float interpolation)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn;\n\t}\n\n\tif (!skeletonA.IsValid())\n\t{\n\t\tNazaraError(\"Skeleton A is invalid\");\n\t\treturn;\n\t}\n\n\tif (!skeletonB.IsValid())\n\t{\n\t\tNazaraError(\"Skeleton B is invalid\");\n\t\treturn;\n\t}\n\n\tif (skeletonA.GetJointCount() != skeletonB.GetJointCount() || m_impl->joints.size() != skeletonA.GetJointCount())\n\t{\n\t\tNazaraError(\"Skeletons must have the same joint count\");\n\t\treturn;\n\t}\n\t#endif\n\n\tNzJoint* jointsA = &skeletonA.m_impl->joints[0];\n\tNzJoint* jointsB = &skeletonB.m_impl->joints[0];\n\tfor (unsigned int i = 0; i < m_impl->joints.size(); ++i)\n\t\tm_impl->joints[i].Interpolate(jointsA[i], jointsB[i], interpolation);\n}\n\nvoid NzSkeleton::Interpolate(const NzSkeleton& skeletonA, const NzSkeleton& skeletonB, float interpolation, unsigned int* indices, unsigned int indiceCount)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn;\n\t}\n\n\tif (!skeletonA.IsValid())\n\t{\n\t\tNazaraError(\"Skeleton A is invalid\");\n\t\treturn;\n\t}\n\n\tif (!skeletonB.IsValid())\n\t{\n\t\tNazaraError(\"Skeleton B is invalid\");\n\t\treturn;\n\t}\n\n\tif (skeletonA.GetJointCount() != skeletonB.GetJointCount() || m_impl->joints.size() != skeletonA.GetJointCount())\n\t{\n\t\tNazaraError(\"Skeletons must have the same joint count\");\n\t\treturn;\n\t}\n\t#endif\n\n\tNzJoint* jointsA = &skeletonA.m_impl->joints[0];\n\tNzJoint* jointsB = &skeletonB.m_impl->joints[0];\n\tfor (unsigned int i = 0; i < indiceCount; ++i)\n\t{\n\t\tunsigned int index = indices[i];\n\n\t\t#if NAZARA_UTILITY_SAFE\n\t\tif (index >= m_impl->joints.size())\n\t\t{\n\t\t\tNazaraError(\"Index #\" + NzString::Number(i) + \" out of range (\" + NzString::Number(index) + \" >= \" + NzString::Number(m_impl->joints.size()) + ')');\n\t\t\treturn;\n\t\t}\n\t\t#endif\n\n\t\tm_impl->joints[index].Interpolate(jointsA[index], jointsB[index], interpolation);\n\t}\n}\n\nbool NzSkeleton::IsValid() const\n{\n\treturn m_impl != nullptr;\n}\n\nNzSkeleton& NzSkeleton::operator=(const NzSkeleton& skeleton)\n{\n\tDestroy();\n\n\tif (skeleton.m_impl)\n\t{\n\t\tm_impl = new NzSkeletonImpl;\n\t\tm_impl->jointMap = skeleton.m_impl->jointMap;\n\t\tm_impl->jointMapUpdated = skeleton.m_impl->jointMapUpdated;\n\t\tm_impl->joints = skeleton.m_impl->joints;\n\t}\n\n\treturn *this;\n}\n\nvoid NzSkeleton::InvalidateJointMap()\n{\n\t#ifdef NAZARA_DEBUG\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Invalid skeleton\");\n\t\treturn;\n\t}\n\t#endif\n\n\tm_impl->jointMapUpdated = false;\n}\n\nvoid NzSkeleton::UpdateJointMap() const\n{\n\t#ifdef NAZARA_DEBUG\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Invalid skeleton\");\n\t\treturn;\n\t}\n\t#endif\n\n\tm_impl->jointMap.clear();\n\tfor (unsigned int i = 0; i < m_impl->joints.size(); ++i)\n\t{\n\t\tNzString name = m_impl->joints[i].GetName();\n\t\tif (!name.IsEmpty())\n\t\t{\n\t\t\t#if NAZARA_UTILITY_SAFE\n\t\t\tauto it = m_impl->jointMap.find(name);\n\t\t\tif (it != m_impl->jointMap.end())\n\t\t\t{\n\t\t\t\tNazaraWarning(\"Joint name \\\"\" + name + \"\\\" is already present in joint map for joint #\" + NzString::Number(it->second));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t#endif\n\n\t\t\tm_impl->jointMap[name] = i;\n\t\t}\n\t}\n\n\tm_impl->jointMapUpdated = true;\n}\n<commit_msg>Fixed copying a skeleton not copying hierarchy<commit_after>\/\/ Copyright (C) 2012 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Utility module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Utility\/Skeleton.hpp>\n#include <Nazara\/Utility\/AxisAlignedBox.hpp>\n#include <map>\n#include <Nazara\/Utility\/Debug.hpp>\n\nstruct NzSkeletonImpl\n{\n\tstd::map<NzString, unsigned int> jointMap;\n\tstd::vector<NzJoint> joints;\n\tNzAxisAlignedBox aabb;\n\tbool jointMapUpdated = false;\n};\n\nNzSkeleton::NzSkeleton(const NzSkeleton& skeleton) :\nm_impl(nullptr)\n{\n\toperator=(skeleton);\n}\n\nNzSkeleton::~NzSkeleton()\n{\n\tDestroy();\n}\n\nbool NzSkeleton::Create(unsigned int jointCount)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (jointCount == 0)\n\t{\n\t\tNazaraError(\"Joint count must be over 0\");\n\t\treturn false;\n\t}\n\t#endif\n\n\tm_impl = new NzSkeletonImpl;\n\tm_impl->joints.resize(jointCount, NzJoint(this));\n\n\treturn true;\n}\n\nvoid NzSkeleton::Destroy()\n{\n\tif (m_impl)\n\t{\n\t\tdelete m_impl;\n\t\tm_impl = nullptr;\n\t}\n}\n\nconst NzAxisAlignedBox& NzSkeleton::GetAABB() const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn NzAxisAlignedBox::Null;\n\t}\n\t#endif\n\n\tif (m_impl->aabb.IsNull())\n\t{\n\t\tfor (unsigned int i = 0; i < m_impl->joints.size(); ++i)\n\t\t\tm_impl->aabb.ExtendTo(m_impl->joints[i].GetDerivedTranslation());\n\t}\n\n\treturn m_impl->aabb;\n}\n\nNzJoint* NzSkeleton::GetJoint(const NzString& jointName)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\tif (!m_impl->jointMapUpdated)\n\t\tUpdateJointMap();\n\n\tauto it = m_impl->jointMap.find(jointName);\n\n\t#if NAZARA_UTILITY_SAFE\n\tif (it == m_impl->jointMap.end())\n\t{\n\t\tNazaraError(\"Joint not found\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\t\/\/ Invalidation de l'AABB\n\tm_impl->aabb.SetNull();\n\n\treturn &m_impl->joints[it->second];\n}\n\nNzJoint* NzSkeleton::GetJoint(unsigned int index)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\n\tif (index >= m_impl->joints.size())\n\t{\n\t\tNazaraError(\"Joint index out of range (\" + NzString::Number(index) + \" >= \" + NzString::Number(m_impl->joints.size()) + ')');\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\t\/\/ Invalidation de l'AABB\n\tm_impl->aabb.SetNull();\n\n\treturn &m_impl->joints[index];\n}\n\nconst NzJoint* NzSkeleton::GetJoint(const NzString& jointName) const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\tif (!m_impl->jointMapUpdated)\n\t\tUpdateJointMap();\n\n\tauto it = m_impl->jointMap.find(jointName);\n\n\t#if NAZARA_UTILITY_SAFE\n\tif (it == m_impl->jointMap.end())\n\t{\n\t\tNazaraError(\"Joint not found\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\treturn &m_impl->joints[it->second];\n}\n\nconst NzJoint* NzSkeleton::GetJoint(unsigned int index) const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\n\tif (index >= m_impl->joints.size())\n\t{\n\t\tNazaraError(\"Joint index out of range (\" + NzString::Number(index) + \" >= \" + NzString::Number(m_impl->joints.size()) + ')');\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\treturn &m_impl->joints[index];\n}\n\nNzJoint* NzSkeleton::GetJoints()\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\treturn &m_impl->joints[0];\n}\n\nconst NzJoint* NzSkeleton::GetJoints() const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn nullptr;\n\t}\n\t#endif\n\n\treturn &m_impl->joints[0];\n}\n\nunsigned int NzSkeleton::GetJointCount() const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn 0;\n\t}\n\t#endif\n\n\treturn m_impl->joints.size();\n}\n\nint NzSkeleton::GetJointIndex(const NzString& jointName) const\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn -1;\n\t}\n\t#endif\n\n\tif (!m_impl->jointMapUpdated)\n\t\tUpdateJointMap();\n\n\tauto it = m_impl->jointMap.find(jointName);\n\n\t#if NAZARA_UTILITY_SAFE\n\tif (it == m_impl->jointMap.end())\n\t{\n\t\tNazaraError(\"Joint not found\");\n\t\treturn -1;\n\t}\n\t#endif\n\n\treturn it->second;\n}\n\nvoid NzSkeleton::Interpolate(const NzSkeleton& skeletonA, const NzSkeleton& skeletonB, float interpolation)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn;\n\t}\n\n\tif (!skeletonA.IsValid())\n\t{\n\t\tNazaraError(\"Skeleton A is invalid\");\n\t\treturn;\n\t}\n\n\tif (!skeletonB.IsValid())\n\t{\n\t\tNazaraError(\"Skeleton B is invalid\");\n\t\treturn;\n\t}\n\n\tif (skeletonA.GetJointCount() != skeletonB.GetJointCount() || m_impl->joints.size() != skeletonA.GetJointCount())\n\t{\n\t\tNazaraError(\"Skeletons must have the same joint count\");\n\t\treturn;\n\t}\n\t#endif\n\n\tNzJoint* jointsA = &skeletonA.m_impl->joints[0];\n\tNzJoint* jointsB = &skeletonB.m_impl->joints[0];\n\tfor (unsigned int i = 0; i < m_impl->joints.size(); ++i)\n\t\tm_impl->joints[i].Interpolate(jointsA[i], jointsB[i], interpolation);\n}\n\nvoid NzSkeleton::Interpolate(const NzSkeleton& skeletonA, const NzSkeleton& skeletonB, float interpolation, unsigned int* indices, unsigned int indiceCount)\n{\n\t#if NAZARA_UTILITY_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Skeleton not created\");\n\t\treturn;\n\t}\n\n\tif (!skeletonA.IsValid())\n\t{\n\t\tNazaraError(\"Skeleton A is invalid\");\n\t\treturn;\n\t}\n\n\tif (!skeletonB.IsValid())\n\t{\n\t\tNazaraError(\"Skeleton B is invalid\");\n\t\treturn;\n\t}\n\n\tif (skeletonA.GetJointCount() != skeletonB.GetJointCount() || m_impl->joints.size() != skeletonA.GetJointCount())\n\t{\n\t\tNazaraError(\"Skeletons must have the same joint count\");\n\t\treturn;\n\t}\n\t#endif\n\n\tNzJoint* jointsA = &skeletonA.m_impl->joints[0];\n\tNzJoint* jointsB = &skeletonB.m_impl->joints[0];\n\tfor (unsigned int i = 0; i < indiceCount; ++i)\n\t{\n\t\tunsigned int index = indices[i];\n\n\t\t#if NAZARA_UTILITY_SAFE\n\t\tif (index >= m_impl->joints.size())\n\t\t{\n\t\t\tNazaraError(\"Index #\" + NzString::Number(i) + \" out of range (\" + NzString::Number(index) + \" >= \" + NzString::Number(m_impl->joints.size()) + ')');\n\t\t\treturn;\n\t\t}\n\t\t#endif\n\n\t\tm_impl->joints[index].Interpolate(jointsA[index], jointsB[index], interpolation);\n\t}\n}\n\nbool NzSkeleton::IsValid() const\n{\n\treturn m_impl != nullptr;\n}\n\nNzSkeleton& NzSkeleton::operator=(const NzSkeleton& skeleton)\n{\n\tDestroy();\n\n\tif (skeleton.m_impl)\n\t{\n\t\tm_impl = new NzSkeletonImpl;\n\t\tm_impl->jointMap = skeleton.m_impl->jointMap;\n\t\tm_impl->jointMapUpdated = skeleton.m_impl->jointMapUpdated;\n\t\tm_impl->joints = skeleton.m_impl->joints;\n\n\t\t\/\/ Code crade mais son optimisation demanderait de stocker jointCount*sizeof(unsigned int) en plus\n\t\t\/\/ Ce qui, pour juste une copie qui ne se fera que rarement, ne vaut pas le coup\n\t\t\/\/ L'éternel trade-off mémoire\/calculs ..\n\t\tunsigned int jointCount = skeleton.m_impl->joints.size();\n\t\tfor (unsigned int i = 0; i < jointCount; ++i)\n\t\t{\n\t\t\tconst NzNode* parent = skeleton.m_impl->joints[i].GetParent();\n\t\t\tif (parent)\n\t\t\t{\n\t\t\t\tfor (unsigned int j = 0; j < i; ++j) \/\/ Le parent se trouve forcément avant nous\n\t\t\t\t{\n\t\t\t\t\tif (parent == &skeleton.m_impl->joints[j]) \/\/ A-t-on trouvé le parent ?\n\t\t\t\t\t{\n\t\t\t\t\t\tm_impl->joints[i].SetParent(m_impl->joints[j]); \/\/ Oui, tout ça pour ça\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn *this;\n}\n\nvoid NzSkeleton::InvalidateJointMap()\n{\n\t#ifdef NAZARA_DEBUG\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Invalid skeleton\");\n\t\treturn;\n\t}\n\t#endif\n\n\tm_impl->jointMapUpdated = false;\n}\n\nvoid NzSkeleton::UpdateJointMap() const\n{\n\t#ifdef NAZARA_DEBUG\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"Invalid skeleton\");\n\t\treturn;\n\t}\n\t#endif\n\n\tm_impl->jointMap.clear();\n\tfor (unsigned int i = 0; i < m_impl->joints.size(); ++i)\n\t{\n\t\tNzString name = m_impl->joints[i].GetName();\n\t\tif (!name.IsEmpty())\n\t\t{\n\t\t\t#if NAZARA_UTILITY_SAFE\n\t\t\tauto it = m_impl->jointMap.find(name);\n\t\t\tif (it != m_impl->jointMap.end())\n\t\t\t{\n\t\t\t\tNazaraWarning(\"Joint name \\\"\" + name + \"\\\" is already present in joint map for joint #\" + NzString::Number(it->second));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t#endif\n\n\t\t\tm_impl->jointMap[name] = i;\n\t\t}\n\t}\n\n\tm_impl->jointMapUpdated = true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <rang.hpp>\n#include <cstdlib>\n#include <sstream>\n#include <iostream>\n#include <algorithm>\n#include <functional>\n#include <date.h>\n\n#include \"Tools\/Display\/Terminal\/Terminal.hpp\"\n\n#ifdef ENABLE_MPI\n#include <mpi.h>\n#endif\n\n#include \"Tools\/general_utils.h\"\n#include \"Tools\/system_functions.h\"\n#include \"Tools\/Display\/rang_format\/rang_format.h\"\n#include \"Tools\/Exception\/exception.hpp\"\n\n#include \"Factory\/Module\/Source\/Source.hpp\"\n#include \"Factory\/Module\/CRC\/CRC.hpp\"\n#include \"Factory\/Module\/Encoder\/Encoder.hpp\"\n#include \"Factory\/Module\/Puncturer\/Puncturer.hpp\"\n#include \"Factory\/Module\/Interleaver\/Interleaver.hpp\"\n#include \"Factory\/Module\/Modem\/Modem.hpp\"\n#include \"Factory\/Module\/Channel\/Channel.hpp\"\n#include \"Factory\/Module\/Quantizer\/Quantizer.hpp\"\n#include \"Factory\/Module\/Decoder\/Decoder.hpp\"\n#include \"Factory\/Module\/Monitor\/Monitor.hpp\"\n#include \"Factory\/Tools\/Display\/Terminal\/Terminal.hpp\"\n\n#include \"Launcher.hpp\"\n\nusing namespace aff3ct;\nusing namespace aff3ct::launcher;\n\nLauncher::Launcher(const int argc, const char **argv, factory::Simulation::parameters &params_common,\n                   std::ostream &stream)\n: simu(nullptr), ah(argc, argv), params_common(params_common), stream(stream)\n{\n\tcmd_line += std::string(argv[0]) + std::string(\" \");\n\tfor (auto i = 1; i < argc; i++)\n\t{\n\t\tif (argv[i][0] == '-')\n\t\t\tcmd_line += std::string(argv[i]);\n\t\telse\n\t\t\tcmd_line += std::string(\"\\\"\") + std::string(argv[i]) + std::string(\"\\\"\");\n\n\t\tcmd_line += std::string(\" \");\n\t}\n}\n\nLauncher::~Launcher()\n{\n}\n\nvoid Launcher::get_description_args()\n{\n}\n\nvoid Launcher::store_args()\n{\n}\n\nint Launcher::read_arguments()\n{\n\tthis->get_description_args();\n\n\tstd::vector<std::string> cmd_error;\n\n\tthis->arg_vals = ah.parse_arguments(this->args, this->cmd_warn, cmd_error);\n\n\ttry\n\t{\n\t\tthis->store_args();\n\t}\n\tcatch(const std::exception& e)\n\t{\n\t\tauto save = tools::exception::no_backtrace;\n\t\ttools::exception::no_backtrace = true;\n\t\tcmd_error.emplace_back(e.what());\n\t\ttools::exception::no_backtrace = save;\n\t}\n\n\tif (params_common.display_help)\n\t{\n\t\tauto grps = factory::Factory::create_groups({&params_common});\n\t\tah.print_help(this->args, grps, params_common.display_adv_help);\n\t}\n\n\t\/\/ print usage\n\tif (!cmd_error.empty() && !params_common.display_help)\n\t\tah.print_usage(this->args);\n\n\t\/\/ print the errors\n\tif (!cmd_error.empty()) std::cerr << std::endl;\n\tfor (unsigned e = 0; e < cmd_error.size(); e++)\n\t\tstd::cerr << rang::tag::error << cmd_error[e] << std::endl;\n\n\t\/\/ print the help tags\n\tif (!cmd_error.empty() && !params_common.display_help)\n\t{\n\t\ttools::Argument_tag help_tag = {\"help\", \"h\"};\n\n\t\tstd::string message = \"For more information please display the help (\\\"\";\n\t\tmessage += tools::Argument_handler::print_tag(help_tag) += \"\\\").\";\n\n\t\tstd::cerr << std::endl << rang::tag::info << message << std::endl;\n\t}\n\n\treturn (!cmd_error.empty() || params_common.display_help) ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n\nvoid Launcher::print_header()\n{\n\t\/\/ display configuration and simulation parameters\n\tstream << rang::tag::comment << rang::style::bold << \"----------------------------------------------------\" << std::endl;\n\tstream << rang::tag::comment << rang::style::bold << \"---- A FAST FORWARD ERROR CORRECTION TOOLBOX >> ----\" << std::endl;\n\tstream << rang::tag::comment << rang::style::bold << \"----------------------------------------------------\" << std::endl;\n\tstream << rang::tag::comment << rang::style::bold << rang::style::underline << \"Parameters :\"<< rang::style::reset << std::endl;\n\tfactory::Header::print_parameters({&params_common}, false, this->stream);\n\tthis->stream << rang::tag::comment << std::endl;\n}\n\nint Launcher::launch()\n{\n\tint exit_code = EXIT_SUCCESS;\n\n\tstd::srand((unsigned)this->params_common.global_seed);\n\n\t\/\/ in case of the user call launch multiple times\n\tif (simu != nullptr)\n\t{\n\t\tdelete simu;\n\t\tsimu = nullptr;\n\t}\n\n\tif (this->read_arguments() == EXIT_FAILURE)\n\t{\n\t\t\/\/ print the warnings\n#ifdef ENABLE_MPI\n\t\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\t\tfor (unsigned w = 0; w < this->cmd_warn.size(); w++)\n\t\t\t\tstd::clog << rang::tag::warning << this->cmd_warn[w] << std::endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/ write the command and he curve name in the PyBER format\n#ifdef ENABLE_MPI\n\tif (!this->params_common.pyber.empty() && this->params_common.mpi_rank == 0)\n#else\n\tif (!this->params_common.pyber.empty())\n#endif\n\t{\n\t\tstream << \"Run command:\"            << std::endl;\n\t\tstream << cmd_line                  << std::endl;\n\t\tstream << \"Curve name:\"             << std::endl;\n\t\tstream << this->params_common.pyber << std::endl;\n\t\tstream << \"Trace:\"                  << std::endl;\n\t}\n\n\tif (this->params_common.display_legend)\n#ifdef ENABLE_MPI\n\t\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\t\tthis->print_header();\n\n\t\/\/ print the warnings\n#ifdef ENABLE_MPI\n\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\tfor (unsigned w = 0; w < this->cmd_warn.size(); w++)\n\t\t\tstd::clog << rang::tag::warning << this->cmd_warn[w] << std::endl;\n\n\ttry\n\t{\n\t\tsimu = this->build_simu();\n\t}\n\tcatch(const std::exception& e)\n\t{\n\t\trang::format_on_each_line(std::cerr, std::string(e.what()) + \"\\n\", rang::tag::error);\n\t\texit_code = EXIT_FAILURE;\n\t}\n\n\tif (simu != nullptr)\n\t{\n\t\t\/\/ launch the simulation\n\t\tif (this->params_common.display_legend)\n#ifdef ENABLE_MPI\n\t\t\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\t\t\tstream << rang::tag::comment << \"The simulation is running...\" << std::endl;\n\n\t\ttry\n\t\t{\n\t\t\tsimu->launch();\n\t\t\tif (simu->is_error())\n\t\t\t\texit_code = EXIT_FAILURE;\n\t\t}\n\t\tcatch(const std::exception& e)\n\t\t{\n\t\t\trang::format_on_each_line(std::cerr, std::string(e.what()) + \"\\n\", rang::tag::error);\n\t\t\texit_code = EXIT_FAILURE;\n\t\t}\n\t}\n\n\tif (this->params_common.display_legend)\n#ifdef ENABLE_MPI\n\t\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\t\tstream << rang::tag::comment << \"End of the simulation.\" << std::endl;\n\n\tif (simu != nullptr)\n\t{\n\t\tdelete simu;\n\t\tsimu = nullptr;\n\t}\n\n\treturn exit_code;\n}\n<commit_msg>Do not display factory errors when on mpi on others nodes<commit_after>#include <rang.hpp>\n#include <cstdlib>\n#include <sstream>\n#include <iostream>\n#include <algorithm>\n#include <functional>\n#include <date.h>\n\n#include \"Tools\/Display\/Terminal\/Terminal.hpp\"\n\n#ifdef ENABLE_MPI\n#include <mpi.h>\n#endif\n\n#include \"Tools\/general_utils.h\"\n#include \"Tools\/system_functions.h\"\n#include \"Tools\/Display\/rang_format\/rang_format.h\"\n#include \"Tools\/Exception\/exception.hpp\"\n\n#include \"Factory\/Module\/Source\/Source.hpp\"\n#include \"Factory\/Module\/CRC\/CRC.hpp\"\n#include \"Factory\/Module\/Encoder\/Encoder.hpp\"\n#include \"Factory\/Module\/Puncturer\/Puncturer.hpp\"\n#include \"Factory\/Module\/Interleaver\/Interleaver.hpp\"\n#include \"Factory\/Module\/Modem\/Modem.hpp\"\n#include \"Factory\/Module\/Channel\/Channel.hpp\"\n#include \"Factory\/Module\/Quantizer\/Quantizer.hpp\"\n#include \"Factory\/Module\/Decoder\/Decoder.hpp\"\n#include \"Factory\/Module\/Monitor\/Monitor.hpp\"\n#include \"Factory\/Tools\/Display\/Terminal\/Terminal.hpp\"\n\n#include \"Launcher.hpp\"\n\nusing namespace aff3ct;\nusing namespace aff3ct::launcher;\n\nLauncher::Launcher(const int argc, const char **argv, factory::Simulation::parameters &params_common,\n                   std::ostream &stream)\n: simu(nullptr), ah(argc, argv), params_common(params_common), stream(stream)\n{\n\tcmd_line += std::string(argv[0]) + std::string(\" \");\n\tfor (auto i = 1; i < argc; i++)\n\t{\n\t\tif (argv[i][0] == '-')\n\t\t\tcmd_line += std::string(argv[i]);\n\t\telse\n\t\t\tcmd_line += std::string(\"\\\"\") + std::string(argv[i]) + std::string(\"\\\"\");\n\n\t\tcmd_line += std::string(\" \");\n\t}\n}\n\nLauncher::~Launcher()\n{\n}\n\nvoid Launcher::get_description_args()\n{\n}\n\nvoid Launcher::store_args()\n{\n}\n\nint Launcher::read_arguments()\n{\n\tthis->get_description_args();\n\n\tstd::vector<std::string> cmd_error;\n\n\tthis->arg_vals = ah.parse_arguments(this->args, this->cmd_warn, cmd_error);\n\n\ttry\n\t{\n\t\tthis->store_args();\n\t}\n\tcatch(const std::exception& e)\n\t{\n\t\tauto save = tools::exception::no_backtrace;\n\t\ttools::exception::no_backtrace = true;\n\t\tcmd_error.emplace_back(e.what());\n\t\ttools::exception::no_backtrace = save;\n\t}\n\n#ifdef ENABLE_MPI\n\tif (this->params_common.mpi_rank == 0)\n\t{\n#endif\n\t\tif (params_common.display_help)\n\t\t{\n\t\t\tauto grps = factory::Factory::create_groups({&params_common});\n\t\t\tah.print_help(this->args, grps, params_common.display_adv_help);\n\t\t}\n\n\t\t\/\/ print usage\n\t\tif (!cmd_error.empty() && !params_common.display_help)\n\t\t\tah.print_usage(this->args);\n\n\t\t\/\/ print the errors\n\t\tif (!cmd_error.empty()) std::cerr << std::endl;\n\t\tfor (unsigned e = 0; e < cmd_error.size(); e++)\n\t\t\tstd::cerr << rang::tag::error << cmd_error[e] << std::endl;\n\n\t\t\/\/ print the help tags\n\t\tif (!cmd_error.empty() && !params_common.display_help)\n\t\t{\n\t\t\ttools::Argument_tag help_tag = {\"help\", \"h\"};\n\n\t\t\tstd::string message = \"For more information please display the help (\\\"\";\n\t\t\tmessage += tools::Argument_handler::print_tag(help_tag) += \"\\\").\";\n\n\t\t\tstd::cerr << std::endl << rang::tag::info << message << std::endl;\n\t\t}\n#ifdef ENABLE_MPI\n\t}\n#endif\n\n\treturn (!cmd_error.empty() || params_common.display_help) ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n\nvoid Launcher::print_header()\n{\n\t\/\/ display configuration and simulation parameters\n\tstream << rang::tag::comment << rang::style::bold << \"----------------------------------------------------\" << std::endl;\n\tstream << rang::tag::comment << rang::style::bold << \"---- A FAST FORWARD ERROR CORRECTION TOOLBOX >> ----\" << std::endl;\n\tstream << rang::tag::comment << rang::style::bold << \"----------------------------------------------------\" << std::endl;\n\tstream << rang::tag::comment << rang::style::bold << rang::style::underline << \"Parameters :\"<< rang::style::reset << std::endl;\n\tfactory::Header::print_parameters({&params_common}, false, this->stream);\n\tthis->stream << rang::tag::comment << std::endl;\n}\n\nint Launcher::launch()\n{\n\tint exit_code = EXIT_SUCCESS;\n\n\tstd::srand((unsigned)this->params_common.global_seed);\n\n\t\/\/ in case of the user call launch multiple times\n\tif (simu != nullptr)\n\t{\n\t\tdelete simu;\n\t\tsimu = nullptr;\n\t}\n\n\tif (this->read_arguments() == EXIT_FAILURE)\n\t{\n\t\t\/\/ print the warnings\n#ifdef ENABLE_MPI\n\t\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\t\tfor (unsigned w = 0; w < this->cmd_warn.size(); w++)\n\t\t\t\tstd::clog << rang::tag::warning << this->cmd_warn[w] << std::endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/ write the command and he curve name in the PyBER format\n#ifdef ENABLE_MPI\n\tif (this->params_common.mpi_rank == 0)\n#endif\n\tif (!this->params_common.pyber.empty())\n\t{\n\t\tstream << \"Run command:\"            << std::endl;\n\t\tstream << cmd_line                  << std::endl;\n\t\tstream << \"Curve name:\"             << std::endl;\n\t\tstream << this->params_common.pyber << std::endl;\n\t\tstream << \"Trace:\"                  << std::endl;\n\t}\n\n\tif (this->params_common.display_legend)\n#ifdef ENABLE_MPI\n\t\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\t\tthis->print_header();\n\n\t\/\/ print the warnings\n#ifdef ENABLE_MPI\n\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\tfor (unsigned w = 0; w < this->cmd_warn.size(); w++)\n\t\t\tstd::clog << rang::tag::warning << this->cmd_warn[w] << std::endl;\n\n\ttry\n\t{\n\t\tsimu = this->build_simu();\n\t}\n\tcatch(const std::exception& e)\n\t{\n\t\trang::format_on_each_line(std::cerr, std::string(e.what()) + \"\\n\", rang::tag::error);\n\t\texit_code = EXIT_FAILURE;\n\t}\n\n\tif (simu != nullptr)\n\t{\n\t\t\/\/ launch the simulation\n\t\tif (this->params_common.display_legend)\n#ifdef ENABLE_MPI\n\t\t\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\t\t\tstream << rang::tag::comment << \"The simulation is running...\" << std::endl;\n\n\t\ttry\n\t\t{\n\t\t\tsimu->launch();\n\t\t\tif (simu->is_error())\n\t\t\t\texit_code = EXIT_FAILURE;\n\t\t}\n\t\tcatch(const std::exception& e)\n\t\t{\n\t\t\trang::format_on_each_line(std::cerr, std::string(e.what()) + \"\\n\", rang::tag::error);\n\t\t\texit_code = EXIT_FAILURE;\n\t\t}\n\t}\n\n\tif (this->params_common.display_legend)\n#ifdef ENABLE_MPI\n\t\tif (this->params_common.mpi_rank == 0)\n#endif\n\t\t\tstream << rang::tag::comment << \"End of the simulation.\" << std::endl;\n\n\tif (simu != nullptr)\n\t{\n\t\tdelete simu;\n\t\tsimu = nullptr;\n\t}\n\n\treturn exit_code;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>vcl: change to true and false in Window::SetCallHandlersOnInputDisabled()<commit_after><|endoftext|>"}
{"text":"<commit_before>#line 2 \"togo\/core\/string\/string.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief String interface.\n@ingroup lib_core_string\n*\/\n\n#pragma once\n\n#include <togo\/core\/config.hpp>\n#include <togo\/core\/utility\/types.hpp>\n#include <togo\/core\/collection\/fixed_array.hpp>\n#include <togo\/core\/collection\/array.hpp>\n#include <togo\/core\/string\/types.hpp>\n#include <togo\/core\/string\/string.gen_interface>\n\n#include <cstring>\n\nnamespace togo {\n\nnamespace string {\n\n\/**\n\t@addtogroup lib_core_string\n\t@{\n*\/\n\n\/\/\/ Calculate size of a NUL-terminated string.\n\/\/\/\n\/\/\/ This does not include the NUL terminator.\ninline unsigned size(char const* cstr) {\n\treturn cstr ? std::strlen(cstr) : 0;\n}\n\n\/\/\/ Calculate size of a string literal.\n\/\/\/\n\/\/\/ This does not include the NUL terminator if there is one.\n\/\/\/ If there are NULs before N, they are counted.\n\/\/\/\n\/\/\/ @warning This should only be called for string literals.\n\/\/\/ The C-string variant should be used for character arrays that may\n\/\/\/ have NULs before N.\ntemplate<unsigned N>\ninline constexpr unsigned size_literal(char const (&data)[N]) {\n\treturn N > 0 && data[N - 1] == '\\0' ? N - 1 : N;\n}\n\n\/\/\/ Calculate size of a fixed-capacity string.\n\/\/\/\n\/\/\/ This does not include the NUL terminator if there is one.\ntemplate<unsigned N>\ninline unsigned size(FixedArray<char, N> const& string) {\n\treturn\n\t\t!fixed_array::empty(string) && fixed_array::back(string) == '\\0'\n\t\t? fixed_array::size(string) - 1\n\t\t: fixed_array::size(string)\n\t;\n}\n\n\/\/\/ Calculate size of a string.\n\/\/\/\n\/\/\/ This does not include the NUL terminator if there is one.\ninline unsigned size(Array<char> const& string) {\n\treturn\n\t\t!array::empty(string) && array::back(string) == '\\0'\n\t\t? array::size(string) - 1\n\t\t: array::size(string)\n\t;\n}\n\n\/\/\/ Get the size of a string reference.\ninline unsigned size(StringRef const& string) {\n\treturn string.size;\n}\n\n\/\/\/ Copy string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst (N) must be at least src.size + 1.\ntemplate<unsigned N>\ninline void copy(char (&dst)[N], StringRef const& src) {\n\tcopy(dst, N, src);\n}\n\n\/\/\/ Copy string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst (N) must be at least src.size + 1.\ntemplate<unsigned N>\ninline void copy(\n\tFixedArray<char, N>& dst,\n\tStringRef const& src\n) {\n\tfixed_array::resize(dst, src.size + 1);\n\tcopy(fixed_array::begin(dst), fixed_array::size(dst), src);\n}\n\n\/\/\/ Copy string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\ninline void copy(\n\tArray<char>& dst,\n\tStringRef const& src\n) {\n\tarray::resize(dst, src.size + 1);\n\tcopy(array::begin(dst), array::size(dst), src);\n}\n\n\/\/\/ Append to string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst must be at least size + str.size + 1.\ninline void append(\n\tchar* const dst,\n\tunsigned const capacity,\n\tunsigned const size,\n\tStringRef const& str\n) {\n\tcopy(dst + size, capacity, str);\n}\n\n\/\/\/ Append to string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst (N) must be at least size + str.size + 1.\ntemplate<unsigned N>\ninline void append(char (&dst)[N], unsigned const size, StringRef const& str) {\n\tcopy(dst + size, N, str);\n}\n\n\/\/\/ Append to string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst (N) must be at least\n\/\/\/ string::size(dst) + str.size + 1.\ntemplate<unsigned N>\ninline void append(FixedArray<char, N>& dst, StringRef const& str) {\n\tunsigned const size = string::size(dst);\n\tfixed_array::resize(dst, size + str.size + 1);\n\tcopy(fixed_array::begin(dst) + size, str.size + 1, str);\n}\n\n\/\/\/ Append to string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\ninline void append(Array<char>& dst, StringRef const& str) {\n\tunsigned const size = string::size(dst);\n\tarray::resize(dst, size + str.size + 1);\n\tcopy(array::begin(dst) + size, str.size + 1, str);\n}\n\n\/\/\/ Trim trailing slashes from string.\n\/\/\/\n\/\/\/ Returns new size of string (not including NUL terminator).\ntemplate<unsigned N>\ninline unsigned trim_trailing_slashes(FixedArray<char, N>& string) {\n\tunsigned const size = string::size(string);\n\tunsigned const new_size = trim_trailing_slashes(\n\t\tfixed_array::begin(string),\n\t\tsize\n\t);\n\tif (new_size != size) {\n\t\tfixed_array::resize(string, new_size + 1);\n\t}\n\treturn new_size;\n}\n\n\/\/\/ Ensure string has a trailing slash by appending if necessary.\n\/\/\/\n\/\/\/ Returns new size of the string (not including NUL terminator).\ntemplate<unsigned N>\ninline unsigned ensure_trailing_slash(FixedArray<char, N>& string) {\n\tunsigned const size = string::size(string);\n\tunsigned const new_size = ensure_trailing_slash(\n\t\tfixed_array::begin(string),\n\t\tfixed_array::capacity(string),\n\t\tsize\n\t);\n\tif (new_size != size) {\n\t\tfixed_array::resize(string, new_size + 1);\n\t}\n\treturn new_size;\n}\n\n\/** @} *\/ \/\/ end of doc-group lib_core_string\n\n} \/\/ namespace string\n\n\/\/\/ Construct to null\/empty.\ninline StringRef::StringRef()\n\t: data(nullptr)\n\t, size(0)\n{}\n\n\/\/\/ Construct to NUL-terminated string.\ninline StringRef::StringRef(char const* const cstr, cstr_tag)\n\t: data(cstr)\n\t, size(string::size(cstr))\n{}\n\n\/\/\/ Construct to explicitly-sized data.\ninline constexpr StringRef::StringRef(char const* const data, unsigned const size)\n\t: data(data)\n\t, size(\n\t\tdata\n\t\t? (size > 0 && data[size - 1] == '\\0' ? size - 1 : size)\n\t\t: 0\n\t)\n{}\n\n\/\/\/ Construct to string literal.\n\/\/\/\n\/\/\/ @warning This should only be used for string literals.\n\/\/\/ The sized or C-string constructors should be used for character\n\/\/\/ arrays that may have empty space before N.\ntemplate<unsigned N>\ninline constexpr StringRef::StringRef(char const (&data)[N])\n\t: StringRef(data, N)\n{}\n\n\/\/\/ Construct to fixed-size character array.\ntemplate<unsigned N>\ninline StringRef::StringRef(FixedArray<char, N> const& array)\n\t: StringRef(fixed_array::begin(array), fixed_array::size(array))\n{}\n\n\/\/\/ Construct to character array.\ninline StringRef::StringRef(Array<char> const& array)\n\t: StringRef(array::begin(array), array::size(array))\n{}\n\n\/\/\/ Whether the reference has non-null data.\ninline bool StringRef::valid() const {\n\treturn data != nullptr;\n}\n\n\/\/\/ Whether the reference points to a non-empty string.\ninline bool StringRef::any() const {\n\treturn size > 0;\n}\n\n\/\/\/ Whether the reference points to an empty string.\ninline bool StringRef::empty() const {\n\treturn size == 0;\n}\n\n\/\/\/ Get value by index.\ninline char StringRef::operator[](unsigned const i) const {\n\tTOGO_DEBUG_ASSERTE(i < size);\n\treturn data[i];\n}\n\n\/** @cond INTERNAL *\/\ninline char const* begin(StringRef const& str) { return str.data; }\ninline char const* cbegin(StringRef const& str) { return str.data; }\n\ninline char const* end(StringRef const& str) { return str.data + str.size; }\ninline char const* cend(StringRef const& str) { return str.data + str.size; }\n\/** @endcond *\/ \/\/ INTERNAL\n\n} \/\/ namespace togo\n<commit_msg>lib\/core\/string: tidy.<commit_after>#line 2 \"togo\/core\/string\/string.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief String interface.\n@ingroup lib_core_string\n*\/\n\n#pragma once\n\n#include <togo\/core\/config.hpp>\n#include <togo\/core\/utility\/types.hpp>\n#include <togo\/core\/collection\/fixed_array.hpp>\n#include <togo\/core\/collection\/array.hpp>\n#include <togo\/core\/string\/types.hpp>\n#include <togo\/core\/string\/string.gen_interface>\n\n#include <cstring>\n\nnamespace togo {\n\nnamespace string {\n\n\/**\n\t@addtogroup lib_core_string\n\t@{\n*\/\n\n\/\/\/ Calculate size of a NUL-terminated string.\n\/\/\/\n\/\/\/ This does not include the NUL terminator.\ninline unsigned size(char const* cstr) {\n\treturn cstr ? std::strlen(cstr) : 0;\n}\n\n\/\/\/ Calculate size of a string literal.\n\/\/\/\n\/\/\/ This does not include the NUL terminator if there is one.\n\/\/\/ If there are NULs before N, they are counted.\n\/\/\/\n\/\/\/ @warning This should only be called for string literals.\n\/\/\/ The C-string variant should be used for character arrays that may\n\/\/\/ have NULs before N.\ntemplate<unsigned N>\ninline constexpr unsigned size_literal(char const (&data)[N]) {\n\treturn N > 0 && data[N - 1] == '\\0' ? N - 1 : N;\n}\n\n\/\/\/ Calculate size of a fixed-capacity string.\n\/\/\/\n\/\/\/ This does not include the NUL terminator if there is one.\ntemplate<unsigned N>\ninline unsigned size(FixedArray<char, N> const& string) {\n\treturn\n\t\t!fixed_array::empty(string) && fixed_array::back(string) == '\\0'\n\t\t? fixed_array::size(string) - 1\n\t\t: fixed_array::size(string)\n\t;\n}\n\n\/\/\/ Calculate size of a string.\n\/\/\/\n\/\/\/ This does not include the NUL terminator if there is one.\ninline unsigned size(Array<char> const& string) {\n\treturn\n\t\t!array::empty(string) && array::back(string) == '\\0'\n\t\t? array::size(string) - 1\n\t\t: array::size(string)\n\t;\n}\n\n\/\/\/ Get the size of a string reference.\ninline unsigned size(StringRef const& string) {\n\treturn string.size;\n}\n\n\/\/\/ Copy string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst (N) must be at least src.size + 1.\ntemplate<unsigned N>\ninline void copy(char (&dst)[N], StringRef const& src) {\n\tstring::copy(dst, N, src);\n}\n\n\/\/\/ Copy string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst (N) must be at least src.size + 1.\ntemplate<unsigned N>\ninline void copy(\n\tFixedArray<char, N>& dst,\n\tStringRef const& src\n) {\n\tfixed_array::resize(dst, src.size + 1);\n\tstring::copy(fixed_array::begin(dst), fixed_array::size(dst), src);\n}\n\n\/\/\/ Copy string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\ninline void copy(\n\tArray<char>& dst,\n\tStringRef const& src\n) {\n\tarray::resize(dst, src.size + 1);\n\tstring::copy(array::begin(dst), array::size(dst), src);\n}\n\n\/\/\/ Append to string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst must be at least size + str.size + 1.\ninline void append(\n\tchar* const dst,\n\tunsigned const capacity,\n\tunsigned const size,\n\tStringRef const& str\n) {\n\tstring::copy(dst + size, capacity, str);\n}\n\n\/\/\/ Append to string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst (N) must be at least size + str.size + 1.\ntemplate<unsigned N>\ninline void append(char (&dst)[N], unsigned const size, StringRef const& str) {\n\tstring::copy(dst + size, N, str);\n}\n\n\/\/\/ Append to string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\n\/\/\/ The capacity of dst (N) must be at least\n\/\/\/ string::size(dst) + str.size + 1.\ntemplate<unsigned N>\ninline void append(FixedArray<char, N>& dst, StringRef const& str) {\n\tunsigned const size = string::size(dst);\n\tfixed_array::resize(dst, size + str.size + 1);\n\tstring::copy(fixed_array::begin(dst) + size, str.size + 1, str);\n}\n\n\/\/\/ Append to string.\n\/\/\/\n\/\/\/ dst will be NUL-terminated.\ninline void append(Array<char>& dst, StringRef const& str) {\n\tunsigned const size = string::size(dst);\n\tarray::resize(dst, size + str.size + 1);\n\tstring::copy(array::begin(dst) + size, str.size + 1, str);\n}\n\n\/\/\/ Trim trailing slashes from string.\n\/\/\/\n\/\/\/ Returns new size of string (not including NUL terminator).\ntemplate<unsigned N>\ninline unsigned trim_trailing_slashes(FixedArray<char, N>& string) {\n\tunsigned const size = string::size(string);\n\tunsigned const new_size = string::trim_trailing_slashes(\n\t\tfixed_array::begin(string),\n\t\tsize\n\t);\n\tif (new_size != size) {\n\t\tfixed_array::resize(string, new_size + 1);\n\t}\n\treturn new_size;\n}\n\n\/\/\/ Ensure string has a trailing slash by appending if necessary.\n\/\/\/\n\/\/\/ Returns new size of the string (not including NUL terminator).\ntemplate<unsigned N>\ninline unsigned ensure_trailing_slash(FixedArray<char, N>& string) {\n\tunsigned const size = string::size(string);\n\tunsigned const new_size = string::ensure_trailing_slash(\n\t\tfixed_array::begin(string),\n\t\tfixed_array::capacity(string),\n\t\tsize\n\t);\n\tif (new_size != size) {\n\t\tfixed_array::resize(string, new_size + 1);\n\t}\n\treturn new_size;\n}\n\n\/** @} *\/ \/\/ end of doc-group lib_core_string\n\n} \/\/ namespace string\n\n\/\/\/ Construct to null\/empty.\ninline StringRef::StringRef()\n\t: data(nullptr)\n\t, size(0)\n{}\n\n\/\/\/ Construct to NUL-terminated string.\ninline StringRef::StringRef(char const* const cstr, cstr_tag)\n\t: data(cstr)\n\t, size(string::size(cstr))\n{}\n\n\/\/\/ Construct to explicitly-sized data.\ninline constexpr StringRef::StringRef(char const* const data, unsigned const size)\n\t: data(data)\n\t, size(\n\t\tdata\n\t\t? (size > 0 && data[size - 1] == '\\0' ? size - 1 : size)\n\t\t: 0\n\t)\n{}\n\n\/\/\/ Construct to string literal.\n\/\/\/\n\/\/\/ @warning This should only be used for string literals.\n\/\/\/ The sized or C-string constructors should be used for character\n\/\/\/ arrays that may have empty space before N.\ntemplate<unsigned N>\ninline constexpr StringRef::StringRef(char const (&data)[N])\n\t: StringRef(data, N)\n{}\n\n\/\/\/ Construct to fixed-size character array.\ntemplate<unsigned N>\ninline StringRef::StringRef(FixedArray<char, N> const& array)\n\t: StringRef(fixed_array::begin(array), fixed_array::size(array))\n{}\n\n\/\/\/ Construct to character array.\ninline StringRef::StringRef(Array<char> const& array)\n\t: StringRef(array::begin(array), array::size(array))\n{}\n\n\/\/\/ Whether the reference has non-null data.\ninline bool StringRef::valid() const {\n\treturn data != nullptr;\n}\n\n\/\/\/ Whether the reference points to a non-empty string.\ninline bool StringRef::any() const {\n\treturn size > 0;\n}\n\n\/\/\/ Whether the reference points to an empty string.\ninline bool StringRef::empty() const {\n\treturn size == 0;\n}\n\n\/\/\/ Get value by index.\ninline char StringRef::operator[](unsigned const i) const {\n\tTOGO_DEBUG_ASSERTE(i < size);\n\treturn data[i];\n}\n\n\/** @cond INTERNAL *\/\ninline char const* begin(StringRef const& str) { return str.data; }\ninline char const* cbegin(StringRef const& str) { return str.data; }\n\ninline char const* end(StringRef const& str) { return str.data + str.size; }\ninline char const* cend(StringRef const& str) { return str.data + str.size; }\n\/** @endcond *\/ \/\/ INTERNAL\n\n} \/\/ namespace togo\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 plugins 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:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qdirectfbpixmap.h\"\n\n#include \"qdirectfbscreen.h\"\n#include \"qdirectfbpaintengine.h\"\n\n#include <QtGui\/qbitmap.h>\n#include <directfb.h>\n\nstatic int global_ser_no = 0;\n\nQDirectFBPixmapData::QDirectFBPixmapData(QDirectFBScreen *screen, PixelType pixelType)\n    : QPixmapData(pixelType, DirectFBClass), QDirectFBPaintDevice(screen),\n      format(QImage::Format_Invalid), alpha(false)\n{\n    setSerialNumber(0);\n}\n\nQDirectFBPixmapData::~QDirectFBPixmapData()\n{\n    unlockDirectFB();\n    if (dfbSurface && QDirectFBScreen::instance())\n        screen->releaseDFBSurface(dfbSurface);\n}\n\nvoid QDirectFBPixmapData::resize(int width, int height)\n{\n    if (width <= 0 || height <= 0) {\n        invalidate();\n        return;\n    }\n\n    format = screen->pixelFormat();\n    dfbSurface = screen->createDFBSurface(QSize(width, height),\n                                          format,\n                                          QDirectFBScreen::TrackSurface);\n    d = screen->depth();\n    alpha = false;\n    if (!dfbSurface) {\n        invalidate();\n        qWarning(\"QDirectFBPixmapData::resize(): Unable to allocate surface\");\n        return;\n    }\n\n    w = width;\n    h = height;\n    is_null = (w <= 0 || h <= 0);\n    d = metric(QPaintDevice::PdmDepth);\n    setSerialNumber(++global_ser_no);\n}\n\n\/\/ mostly duplicated from qimage.cpp (QImageData::checkForAlphaPixels)\nstatic bool checkForAlphaPixels(const QImage &img)\n{\n    const uchar *bits = img.bits();\n    const int bytes_per_line = img.bytesPerLine();\n    const uchar *end_bits = bits + bytes_per_line;\n    const int width = img.width();\n    const int height = img.height();\n    switch (img.format()) {\n    case QImage::Format_Indexed8:\n        return img.hasAlphaChannel();\n    case QImage::Format_ARGB32:\n    case QImage::Format_ARGB32_Premultiplied:\n        for (int y=0; y<height; ++y) {\n            for (int x=0; x<width; ++x) {\n                if ((((uint *)bits)[x] & 0xff000000) != 0xff000000) {\n                    return true;\n                }\n            }\n            bits += bytes_per_line;\n        }\n        break;\n\n    case QImage::Format_ARGB8555_Premultiplied:\n    case QImage::Format_ARGB8565_Premultiplied:\n        for (int y=0; y<height; ++y) {\n            while (bits < end_bits) {\n                if (bits[0] != 0) {\n                    return true;\n                }\n                bits += 3;\n            }\n            bits = end_bits;\n            end_bits += bytes_per_line;\n        }\n        break;\n\n    case QImage::Format_ARGB6666_Premultiplied:\n        for (int y=0; y<height; ++y) {\n            while (bits < end_bits) {\n                if ((bits[0] & 0xfc) != 0) {\n                    return true;\n                }\n                bits += 3;\n            }\n            bits = end_bits;\n            end_bits += bytes_per_line;\n        }\n        break;\n\n    case QImage::Format_ARGB4444_Premultiplied:\n        for (int y=0; y<height; ++y) {\n            while (bits < end_bits) {\n                if ((bits[0] & 0xf0) != 0) {\n                    return true;\n                }\n                bits += 2;\n            }\n            bits = end_bits;\n            end_bits += bytes_per_line;\n        }\n        break;\n\n    default:\n        break;\n    }\n\n    return false;\n}\n\nbool QDirectFBPixmapData::hasAlphaChannel(const QImage &img)\n{\n#ifndef QT_NO_DIRECTFB_OPAQUE_DETECTION\n    return ::checkForAlphaPixels(img);\n#else\n    return img.hasAlphaChannel();\n#endif\n}\n\n\nvoid QDirectFBPixmapData::fromImage(const QImage &image,\n                                    Qt::ImageConversionFlags flags)\n{\n    if (image.depth() == 1) {\n        fromImage(image.convertToFormat(screen->alphaPixmapFormat()), flags);\n        return;\n    }\n\n    if (image.hasAlphaChannel()\n#ifndef QT_NO_DIRECTFB_OPAQUE_DETECTION\n        && (flags & Qt::NoOpaqueDetection || QDirectFBPixmapData::hasAlphaChannel(image))\n#endif\n        ) {\n        alpha = true;\n        format = screen->alphaPixmapFormat();\n    } else {\n        alpha = false;\n        format = screen->pixelFormat();\n    }\n\n    dfbSurface = screen->createDFBSurface(image, format, QDirectFBScreen::TrackSurface|QDirectFBScreen::NoPreallocated);\n    if (!dfbSurface) {\n        qWarning(\"QDirectFBPixmapData::fromImage()\");\n        invalidate();\n        return;\n    }\n    w = image.width();\n    h = image.height();\n    is_null = (w <= 0 || h <= 0);\n    d = metric(QPaintDevice::PdmDepth);\n    setSerialNumber(++global_ser_no);\n#ifdef QT_NO_DIRECTFB_OPAQUE_DETECTION\n    Q_UNUSED(flags);\n#endif\n}\n\nvoid QDirectFBPixmapData::copy(const QPixmapData *data, const QRect &rect)\n{\n    if (data->classId() != DirectFBClass) {\n        QPixmapData::copy(data, rect);\n        return;\n    }\n    unlockDirectFB();\n\n    const QDirectFBPixmapData *otherData = static_cast<const QDirectFBPixmapData*>(data);\n    IDirectFBSurface *src = otherData->directFBSurface();\n    alpha = data->hasAlphaChannel();\n    format = (alpha\n              ? QDirectFBScreen::instance()->alphaPixmapFormat()\n              : QDirectFBScreen::instance()->pixelFormat());\n\n\n    dfbSurface = screen->createDFBSurface(rect.size(), format,\n                                          QDirectFBScreen::TrackSurface);\n    if (!dfbSurface) {\n        qWarning(\"QDirectFBPixmapData::copy()\");\n        invalidate();\n        return;\n    }\n\n    if (alpha) {\n        dfbSurface->Clear(dfbSurface, 0, 0, 0, 0);\n        dfbSurface->SetBlittingFlags(dfbSurface, DSBLIT_BLEND_ALPHACHANNEL);\n    } else {\n        dfbSurface->SetBlittingFlags(dfbSurface, DSBLIT_NOFX);\n    }\n    const DFBRectangle blitRect = { rect.x(), rect.y(),\n                                    rect.width(), rect.height() };\n    w = rect.width();\n    h = rect.height();\n    d = otherData->d;\n    is_null = (w <= 0 || h <= 0);\n    DFBResult result = dfbSurface->Blit(dfbSurface, src, &blitRect, 0, 0);\n#if (Q_DIRECTFB_VERSION >= 0x010000)\n    dfbSurface->ReleaseSource(dfbSurface);\n#endif\n    if (result != DFB_OK) {\n        DirectFBError(\"QDirectFBPixmapData::copy()\", result);\n        invalidate();\n        return;\n    }\n\n    setSerialNumber(++global_ser_no);\n}\n\nstatic inline bool isOpaqueFormat(QImage::Format format)\n{\n    switch (format) {\n    case QImage::Format_RGB32:\n    case QImage::Format_RGB16:\n    case QImage::Format_RGB666:\n    case QImage::Format_RGB555:\n    case QImage::Format_RGB888:\n    case QImage::Format_RGB444:\n        return true;\n    default:\n        break;\n    }\n    return false;\n}\n\nvoid QDirectFBPixmapData::fill(const QColor &color)\n{\n    if (!serialNumber())\n        return;\n\n    Q_ASSERT(dfbSurface);\n\n    alpha = (color.alpha() < 255);\n\n    if (alpha && ::isOpaqueFormat(format)) {\n        QSize size;\n        dfbSurface->GetSize(dfbSurface, &size.rwidth(), &size.rheight());\n        screen->releaseDFBSurface(dfbSurface);\n        format = screen->alphaPixmapFormat();\n        dfbSurface = screen->createDFBSurface(size, screen->alphaPixmapFormat(), QDirectFBScreen::TrackSurface);\n        setSerialNumber(++global_ser_no);\n        if (!dfbSurface) {\n            qWarning(\"QDirectFBPixmapData::fill()\");\n            invalidate();\n            return;\n        }\n    }\n\n    dfbSurface->Clear(dfbSurface, color.red(), color.green(), color.blue(), color.alpha());\n}\n\nQPixmap QDirectFBPixmapData::transformed(const QTransform &transform,\n                                         Qt::TransformationMode mode) const\n{\n    QDirectFBPixmapData *that = const_cast<QDirectFBPixmapData*>(this);\n    if (!dfbSurface || transform.type() != QTransform::TxScale\n        || mode != Qt::FastTransformation)\n    {\n        const QImage *image = that->buffer();\n        Q_ASSERT(image);\n        const QImage transformed = image->transformed(transform, mode);\n        that->unlockDirectFB();\n        QDirectFBPixmapData *data = new QDirectFBPixmapData(screen, QPixmapData::PixmapType);\n        data->fromImage(transformed, Qt::AutoColor);\n        return QPixmap(data);\n    }\n    that->unlockDirectFB();\n\n    const QSize size = transform.mapRect(QRect(0, 0, w, h)).size();\n    if (size.isEmpty())\n        return QPixmap();\n\n    QDirectFBPixmapData *data = new QDirectFBPixmapData(screen, QPixmapData::PixmapType);\n    DFBSurfaceBlittingFlags flags = DSBLIT_NOFX;\n    data->alpha = alpha;\n    if (alpha) {\n        flags = DSBLIT_BLEND_ALPHACHANNEL;\n    }\n    data->dfbSurface = screen->createDFBSurface(size,\n                                                format,\n                                                QDirectFBScreen::TrackSurface);\n    if (flags & DSBLIT_BLEND_ALPHACHANNEL) {\n        data->dfbSurface->Clear(data->dfbSurface, 0, 0, 0, 0);\n    }\n    data->dfbSurface->SetBlittingFlags(data->dfbSurface, flags);\n\n    const DFBRectangle destRect = { 0, 0, size.width(), size.height() };\n    data->dfbSurface->StretchBlit(data->dfbSurface, dfbSurface, 0, &destRect);\n    data->w = size.width();\n    data->h = size.height();\n    data->is_null = (data->w <= 0 || data->h <= 0);\n\n#if (Q_DIRECTFB_VERSION >= 0x010000)\n    data->dfbSurface->ReleaseSource(data->dfbSurface);\n#endif\n    return QPixmap(data);\n}\n\nQImage QDirectFBPixmapData::toImage() const\n{\n    if (!dfbSurface)\n        return QImage();\n\n#if 0\n    \/\/ In later versions of DirectFB one can set a flag to tell\n    \/\/ DirectFB not to move the surface to videomemory. When that\n    \/\/ happens we can use this (hopefully faster) codepath\n#ifndef QT_NO_DIRECTFB_PREALLOCATED\n    QImage ret(w, h, QDirectFBScreen::getImageFormat(dfbSurface));\n    if (IDirectFBSurface *imgSurface = screen->createDFBSurface(ret, QDirectFBScreen::DontTrackSurface)) {\n        if (hasAlphaChannel()) {\n            imgSurface->SetBlittingFlags(imgSurface, DSBLIT_BLEND_ALPHACHANNEL);\n            imgSurface->Clear(imgSurface, 0, 0, 0, 0);\n        } else {\n            imgSurface->SetBlittingFlags(imgSurface, DSBLIT_NOFX);\n        }\n        imgSurface->Blit(imgSurface, dfbSurface, 0, 0, 0);\n#if (Q_DIRECTFB_VERSION >= 0x010000)\n        imgSurface->ReleaseSource(imgSurface);\n#endif\n        imgSurface->Release(imgSurface);\n        return ret;\n    }\n#endif\n#endif\n\n    QDirectFBPixmapData *that = const_cast<QDirectFBPixmapData*>(this);\n    const QImage *img = that->buffer();\n    return img->copy();\n}\n\n\/* This is QPixmapData::paintEngine(), not QPaintDevice::paintEngine() *\/\n\nQPaintEngine *QDirectFBPixmapData::paintEngine() const\n{\n    if (!engine) {\n        \/\/ QDirectFBPixmapData is also a QCustomRasterPaintDevice, so pass\n        \/\/ that to the paint engine:\n        QDirectFBPixmapData *that = const_cast<QDirectFBPixmapData*>(this);\n        that->engine = new QDirectFBPaintEngine(that);\n    }\n    return engine;\n}\n\nQImage *QDirectFBPixmapData::buffer()\n{\n    lockDirectFB(DSLF_READ|DSLF_WRITE);\n    return lockedImage;\n}\n\nQImage * QDirectFBPixmapData::buffer(DFBSurfaceLockFlags lockFlags)\n{\n    lockDirectFB(lockFlags);\n    return lockedImage;\n}\n\nvoid QDirectFBPixmapData::invalidate()\n{\n    setSerialNumber(0);\n    alpha = false;\n    d = w = h = 0;\n    format = QImage::Format_Invalid;\n}\n\n<commit_msg>Release surface in QDirectFBPixmapData::invalidate<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 plugins 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:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qdirectfbpixmap.h\"\n\n#include \"qdirectfbscreen.h\"\n#include \"qdirectfbpaintengine.h\"\n\n#include <QtGui\/qbitmap.h>\n#include <directfb.h>\n\nstatic int global_ser_no = 0;\n\nQDirectFBPixmapData::QDirectFBPixmapData(QDirectFBScreen *screen, PixelType pixelType)\n    : QPixmapData(pixelType, DirectFBClass), QDirectFBPaintDevice(screen),\n      format(QImage::Format_Invalid), alpha(false)\n{\n    setSerialNumber(0);\n}\n\nQDirectFBPixmapData::~QDirectFBPixmapData()\n{\n    unlockDirectFB();\n    if (dfbSurface && QDirectFBScreen::instance())\n        screen->releaseDFBSurface(dfbSurface);\n}\n\nvoid QDirectFBPixmapData::resize(int width, int height)\n{\n    if (width <= 0 || height <= 0) {\n        invalidate();\n        return;\n    }\n\n    format = screen->pixelFormat();\n    dfbSurface = screen->createDFBSurface(QSize(width, height),\n                                          format,\n                                          QDirectFBScreen::TrackSurface);\n    d = screen->depth();\n    alpha = false;\n    if (!dfbSurface) {\n        invalidate();\n        qWarning(\"QDirectFBPixmapData::resize(): Unable to allocate surface\");\n        return;\n    }\n\n    w = width;\n    h = height;\n    is_null = (w <= 0 || h <= 0);\n    d = metric(QPaintDevice::PdmDepth);\n    setSerialNumber(++global_ser_no);\n}\n\n\/\/ mostly duplicated from qimage.cpp (QImageData::checkForAlphaPixels)\nstatic bool checkForAlphaPixels(const QImage &img)\n{\n    const uchar *bits = img.bits();\n    const int bytes_per_line = img.bytesPerLine();\n    const uchar *end_bits = bits + bytes_per_line;\n    const int width = img.width();\n    const int height = img.height();\n    switch (img.format()) {\n    case QImage::Format_Indexed8:\n        return img.hasAlphaChannel();\n    case QImage::Format_ARGB32:\n    case QImage::Format_ARGB32_Premultiplied:\n        for (int y=0; y<height; ++y) {\n            for (int x=0; x<width; ++x) {\n                if ((((uint *)bits)[x] & 0xff000000) != 0xff000000) {\n                    return true;\n                }\n            }\n            bits += bytes_per_line;\n        }\n        break;\n\n    case QImage::Format_ARGB8555_Premultiplied:\n    case QImage::Format_ARGB8565_Premultiplied:\n        for (int y=0; y<height; ++y) {\n            while (bits < end_bits) {\n                if (bits[0] != 0) {\n                    return true;\n                }\n                bits += 3;\n            }\n            bits = end_bits;\n            end_bits += bytes_per_line;\n        }\n        break;\n\n    case QImage::Format_ARGB6666_Premultiplied:\n        for (int y=0; y<height; ++y) {\n            while (bits < end_bits) {\n                if ((bits[0] & 0xfc) != 0) {\n                    return true;\n                }\n                bits += 3;\n            }\n            bits = end_bits;\n            end_bits += bytes_per_line;\n        }\n        break;\n\n    case QImage::Format_ARGB4444_Premultiplied:\n        for (int y=0; y<height; ++y) {\n            while (bits < end_bits) {\n                if ((bits[0] & 0xf0) != 0) {\n                    return true;\n                }\n                bits += 2;\n            }\n            bits = end_bits;\n            end_bits += bytes_per_line;\n        }\n        break;\n\n    default:\n        break;\n    }\n\n    return false;\n}\n\nbool QDirectFBPixmapData::hasAlphaChannel(const QImage &img)\n{\n#ifndef QT_NO_DIRECTFB_OPAQUE_DETECTION\n    return ::checkForAlphaPixels(img);\n#else\n    return img.hasAlphaChannel();\n#endif\n}\n\n\nvoid QDirectFBPixmapData::fromImage(const QImage &image,\n                                    Qt::ImageConversionFlags flags)\n{\n    if (image.depth() == 1) {\n        fromImage(image.convertToFormat(screen->alphaPixmapFormat()), flags);\n        return;\n    }\n\n    if (image.hasAlphaChannel()\n#ifndef QT_NO_DIRECTFB_OPAQUE_DETECTION\n        && (flags & Qt::NoOpaqueDetection || QDirectFBPixmapData::hasAlphaChannel(image))\n#endif\n        ) {\n        alpha = true;\n        format = screen->alphaPixmapFormat();\n    } else {\n        alpha = false;\n        format = screen->pixelFormat();\n    }\n\n    dfbSurface = screen->createDFBSurface(image, format, QDirectFBScreen::TrackSurface|QDirectFBScreen::NoPreallocated);\n    if (!dfbSurface) {\n        qWarning(\"QDirectFBPixmapData::fromImage()\");\n        invalidate();\n        return;\n    }\n    w = image.width();\n    h = image.height();\n    is_null = (w <= 0 || h <= 0);\n    d = metric(QPaintDevice::PdmDepth);\n    setSerialNumber(++global_ser_no);\n#ifdef QT_NO_DIRECTFB_OPAQUE_DETECTION\n    Q_UNUSED(flags);\n#endif\n}\n\nvoid QDirectFBPixmapData::copy(const QPixmapData *data, const QRect &rect)\n{\n    if (data->classId() != DirectFBClass) {\n        QPixmapData::copy(data, rect);\n        return;\n    }\n    unlockDirectFB();\n\n    const QDirectFBPixmapData *otherData = static_cast<const QDirectFBPixmapData*>(data);\n    IDirectFBSurface *src = otherData->directFBSurface();\n    alpha = data->hasAlphaChannel();\n    format = (alpha\n              ? QDirectFBScreen::instance()->alphaPixmapFormat()\n              : QDirectFBScreen::instance()->pixelFormat());\n\n\n    dfbSurface = screen->createDFBSurface(rect.size(), format,\n                                          QDirectFBScreen::TrackSurface);\n    if (!dfbSurface) {\n        qWarning(\"QDirectFBPixmapData::copy()\");\n        invalidate();\n        return;\n    }\n\n    if (alpha) {\n        dfbSurface->Clear(dfbSurface, 0, 0, 0, 0);\n        dfbSurface->SetBlittingFlags(dfbSurface, DSBLIT_BLEND_ALPHACHANNEL);\n    } else {\n        dfbSurface->SetBlittingFlags(dfbSurface, DSBLIT_NOFX);\n    }\n    const DFBRectangle blitRect = { rect.x(), rect.y(),\n                                    rect.width(), rect.height() };\n    w = rect.width();\n    h = rect.height();\n    d = otherData->d;\n    is_null = (w <= 0 || h <= 0);\n    DFBResult result = dfbSurface->Blit(dfbSurface, src, &blitRect, 0, 0);\n#if (Q_DIRECTFB_VERSION >= 0x010000)\n    dfbSurface->ReleaseSource(dfbSurface);\n#endif\n    if (result != DFB_OK) {\n        DirectFBError(\"QDirectFBPixmapData::copy()\", result);\n        invalidate();\n        return;\n    }\n\n    setSerialNumber(++global_ser_no);\n}\n\nstatic inline bool isOpaqueFormat(QImage::Format format)\n{\n    switch (format) {\n    case QImage::Format_RGB32:\n    case QImage::Format_RGB16:\n    case QImage::Format_RGB666:\n    case QImage::Format_RGB555:\n    case QImage::Format_RGB888:\n    case QImage::Format_RGB444:\n        return true;\n    default:\n        break;\n    }\n    return false;\n}\n\nvoid QDirectFBPixmapData::fill(const QColor &color)\n{\n    if (!serialNumber())\n        return;\n\n    Q_ASSERT(dfbSurface);\n\n    alpha = (color.alpha() < 255);\n\n    if (alpha && ::isOpaqueFormat(format)) {\n        QSize size;\n        dfbSurface->GetSize(dfbSurface, &size.rwidth(), &size.rheight());\n        screen->releaseDFBSurface(dfbSurface);\n        format = screen->alphaPixmapFormat();\n        dfbSurface = screen->createDFBSurface(size, screen->alphaPixmapFormat(), QDirectFBScreen::TrackSurface);\n        setSerialNumber(++global_ser_no);\n        if (!dfbSurface) {\n            qWarning(\"QDirectFBPixmapData::fill()\");\n            invalidate();\n            return;\n        }\n    }\n\n    dfbSurface->Clear(dfbSurface, color.red(), color.green(), color.blue(), color.alpha());\n}\n\nQPixmap QDirectFBPixmapData::transformed(const QTransform &transform,\n                                         Qt::TransformationMode mode) const\n{\n    QDirectFBPixmapData *that = const_cast<QDirectFBPixmapData*>(this);\n    if (!dfbSurface || transform.type() != QTransform::TxScale\n        || mode != Qt::FastTransformation)\n    {\n        const QImage *image = that->buffer();\n        Q_ASSERT(image);\n        const QImage transformed = image->transformed(transform, mode);\n        that->unlockDirectFB();\n        QDirectFBPixmapData *data = new QDirectFBPixmapData(screen, QPixmapData::PixmapType);\n        data->fromImage(transformed, Qt::AutoColor);\n        return QPixmap(data);\n    }\n    that->unlockDirectFB();\n\n    const QSize size = transform.mapRect(QRect(0, 0, w, h)).size();\n    if (size.isEmpty())\n        return QPixmap();\n\n    QDirectFBPixmapData *data = new QDirectFBPixmapData(screen, QPixmapData::PixmapType);\n    DFBSurfaceBlittingFlags flags = DSBLIT_NOFX;\n    data->alpha = alpha;\n    if (alpha) {\n        flags = DSBLIT_BLEND_ALPHACHANNEL;\n    }\n    data->dfbSurface = screen->createDFBSurface(size,\n                                                format,\n                                                QDirectFBScreen::TrackSurface);\n    if (flags & DSBLIT_BLEND_ALPHACHANNEL) {\n        data->dfbSurface->Clear(data->dfbSurface, 0, 0, 0, 0);\n    }\n    data->dfbSurface->SetBlittingFlags(data->dfbSurface, flags);\n\n    const DFBRectangle destRect = { 0, 0, size.width(), size.height() };\n    data->dfbSurface->StretchBlit(data->dfbSurface, dfbSurface, 0, &destRect);\n    data->w = size.width();\n    data->h = size.height();\n    data->is_null = (data->w <= 0 || data->h <= 0);\n\n#if (Q_DIRECTFB_VERSION >= 0x010000)\n    data->dfbSurface->ReleaseSource(data->dfbSurface);\n#endif\n    return QPixmap(data);\n}\n\nQImage QDirectFBPixmapData::toImage() const\n{\n    if (!dfbSurface)\n        return QImage();\n\n#if 0\n    \/\/ In later versions of DirectFB one can set a flag to tell\n    \/\/ DirectFB not to move the surface to videomemory. When that\n    \/\/ happens we can use this (hopefully faster) codepath\n#ifndef QT_NO_DIRECTFB_PREALLOCATED\n    QImage ret(w, h, QDirectFBScreen::getImageFormat(dfbSurface));\n    if (IDirectFBSurface *imgSurface = screen->createDFBSurface(ret, QDirectFBScreen::DontTrackSurface)) {\n        if (hasAlphaChannel()) {\n            imgSurface->SetBlittingFlags(imgSurface, DSBLIT_BLEND_ALPHACHANNEL);\n            imgSurface->Clear(imgSurface, 0, 0, 0, 0);\n        } else {\n            imgSurface->SetBlittingFlags(imgSurface, DSBLIT_NOFX);\n        }\n        imgSurface->Blit(imgSurface, dfbSurface, 0, 0, 0);\n#if (Q_DIRECTFB_VERSION >= 0x010000)\n        imgSurface->ReleaseSource(imgSurface);\n#endif\n        imgSurface->Release(imgSurface);\n        return ret;\n    }\n#endif\n#endif\n\n    QDirectFBPixmapData *that = const_cast<QDirectFBPixmapData*>(this);\n    const QImage *img = that->buffer();\n    return img->copy();\n}\n\n\/* This is QPixmapData::paintEngine(), not QPaintDevice::paintEngine() *\/\n\nQPaintEngine *QDirectFBPixmapData::paintEngine() const\n{\n    if (!engine) {\n        \/\/ QDirectFBPixmapData is also a QCustomRasterPaintDevice, so pass\n        \/\/ that to the paint engine:\n        QDirectFBPixmapData *that = const_cast<QDirectFBPixmapData*>(this);\n        that->engine = new QDirectFBPaintEngine(that);\n    }\n    return engine;\n}\n\nQImage *QDirectFBPixmapData::buffer()\n{\n    lockDirectFB(DSLF_READ|DSLF_WRITE);\n    return lockedImage;\n}\n\nQImage * QDirectFBPixmapData::buffer(DFBSurfaceLockFlags lockFlags)\n{\n    lockDirectFB(lockFlags);\n    return lockedImage;\n}\n\nvoid QDirectFBPixmapData::invalidate()\n{\n    if (dfbSurface) {\n        screen->releaseDFBSurface(dfbSurface);\n        dfbSurface = 0;\n    }\n    setSerialNumber(0);\n    alpha = false;\n    d = w = h = 0;\n    format = QImage::Format_Invalid;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fixes #3665 Applying patch from jurij<commit_after><|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 2011      Dennis Nienhüser <earthwings@gentoo.org>\n\/\/\n\n#include \"OsmDatabase.h\"\n\n#include \"DatabaseQuery.h\"\n#include \"GeoDataLatLonAltBox.h\"\n#include \"MarbleDebug.h\"\n#include \"MarbleMath.h\"\n#include \"MarbleLocale.h\"\n#include \"MarbleModel.h\"\n#include \"PositionTracking.h\"\n\n#include <QtCore\/QFile>\n#include <QtCore\/QDataStream>\n#include <QtCore\/QStringList>\n#include <QtCore\/QRegExp>\n#include <QtCore\/QVariant>\n#include <QtCore\/QTime>\n\n#include <QtSql\/QSqlDatabase>\n#include <QtSql\/QSqlQuery>\n#include <QtSql\/QSqlError>\n\nnamespace Marble {\n\nnamespace {\n\nstatic GeoDataCoordinates s_currentPosition;\nstatic DatabaseQuery* s_currentQuery = 0;\n\nbool placemarkSmallerDistance( const OsmPlacemark &a, const OsmPlacemark &b )\n{\n    return distanceSphere( a.longitude() * DEG2RAD, a.latitude() * DEG2RAD,\n                           s_currentPosition.longitude(), s_currentPosition.latitude() )\n         < distanceSphere( b.longitude() * DEG2RAD, b.latitude() * DEG2RAD,\n                           s_currentPosition.longitude(), s_currentPosition.latitude() );\n}\n\nbool placemarkHigherScore( const OsmPlacemark &a, const OsmPlacemark &b )\n{\n    return a.matchScore( s_currentQuery ) > b.matchScore( s_currentQuery );\n}\n\n}\n\nOsmDatabase::OsmDatabase()\n{\n    m_database = QSqlDatabase::addDatabase( \"QSQLITE\", \"marble\/local-osm-search\" );\n}\n\nvoid OsmDatabase::addFile( const QString &fileName )\n{\n    m_databases << fileName;\n}\n\nQVector<OsmPlacemark> OsmDatabase::find( MarbleModel* model, const QString &searchTerm, const GeoDataLatLonAltBox preferred )\n{\n    if ( m_databases.isEmpty() ) {\n        return QVector<OsmPlacemark>();\n    }\n\n    DatabaseQuery userQuery( model, searchTerm, preferred );\n\n    QVector<OsmPlacemark> result;\n    QTime timer;\n    timer.start();\n    foreach( const QString &databaseFile, m_databases ) {\n        m_database.setDatabaseName( databaseFile );\n        if ( !m_database.open() ) {\n            mDebug() << \"Failed to connect to database \" << databaseFile;\n        }\n\n        QString regionRestriction;\n        if ( !userQuery.region().isEmpty() ) {\n            \/\/ Nested set model to support region hierarchies, see http:\/\/en.wikipedia.org\/wiki\/Nested_set_model\n            QSqlQuery regionsQuery( \"SELECT lft, rgt FROM regions WHERE name LIKE '%\" + userQuery.region() + \"%';\", m_database );\n            if ( regionsQuery.lastError().isValid() ) {\n                mDebug() << \"Error when executing query\" << regionsQuery.executedQuery();\n                mDebug() << \"Sql reports\" << regionsQuery.lastError();\n            }\n            regionRestriction = \" AND (\";\n            bool first = true;\n            while ( regionsQuery.next() ) {\n                if ( first ) {\n                    first = false;\n                } else {\n                    regionRestriction += \" OR \";\n                }\n                regionRestriction += \" (regions.lft >= \" + regionsQuery.value( 0 ).toString();\n                regionRestriction += \" AND regions.lft <= \" + regionsQuery.value( 1 ).toString() + \")\";\n            }\n            regionRestriction += \")\";\n\n            if ( first ) {\n                continue;\n            }\n        }\n\n        QString queryString;\n\n        queryString = \" SELECT regions.name,\"\n                \" places.name, places.number,\"\n                \" places.category, places.lon, places.lat\"\n                \" FROM regions, places\";\n\n        if ( userQuery.queryType() == DatabaseQuery::CategorySearch ) {\n            queryString += \" WHERE regions.id = places.region AND places.category = %1\";\n            queryString = queryString.arg( (qint32) userQuery.category() );\n            if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat && userQuery.region().isEmpty() ) {\n                queryString += \" ORDER BY ((places.lat-%1)*(places.lat-%1)+(places.lon-%2)*(places.lon-%2))\";\n                GeoDataCoordinates position = userQuery.position();\n                queryString = queryString.arg( position.latitude( GeoDataCoordinates::Degree ), 0, 'f', 8 )\n                        .arg( position.longitude( GeoDataCoordinates::Degree ), 0, 'f', 8 );\n            } else {\n                queryString += regionRestriction;\n            }\n        } else if ( userQuery.queryType() == DatabaseQuery::BroadSearch ) {\n            queryString += \" WHERE regions.id = places.region\"\n                    \" AND places.name \" + wildcardQuery( searchTerm );\n        } else {\n            queryString += \" WHERE regions.id = places.region\"\n                    \"   AND places.name \" + wildcardQuery( userQuery.street() );\n            if ( !userQuery.houseNumber().isEmpty() ) {\n                queryString += \" AND places.number \" + wildcardQuery( userQuery.houseNumber() );\n            } else {\n                queryString += \" AND places.number IS NULL\";\n            }\n            queryString += regionRestriction;\n        }\n\n        queryString += \" LIMIT 50;\";\n\n        \/** @todo: sort\/filter results from several databases *\/\n\n        QSqlQuery query( m_database );\n        query.setForwardOnly( true );\n        if ( !query.exec( queryString ) ) {\n            mDebug() << \"Failed to execute query\" << query.lastError();\n            return result;\n        }\n\n        while ( query.next() ) {\n            OsmPlacemark placemark;\n            if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat ) {\n                GeoDataCoordinates coordinates( query.value(4).toFloat(), query.value(5).toFloat(), 0.0, GeoDataCoordinates::Degree );\n                placemark.setAdditionalInformation( formatDistance( coordinates, userQuery.position() ) );\n            } else {\n                placemark.setAdditionalInformation( query.value( 0 ).toString() );\n            }\n            placemark.setName( query.value(1).toString() );\n            placemark.setHouseNumber( query.value(2).toString() );\n            placemark.setCategory( (OsmPlacemark::OsmCategory) query.value(3).toInt() );\n            placemark.setLongitude( query.value(4).toFloat() );\n            placemark.setLatitude( query.value(5).toFloat() );\n            result.push_back( placemark );\n        }\n\n        \/\/ mDebug() << \"Query string: \" << queryString;\n    }\n\n    mDebug() << \"Offline OSM search query took \" << timer.elapsed() << \" ms.\";\n\n    qSort( result.begin(), result.end() );\n    unique( result );\n\n    if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat ) {\n        s_currentPosition = model->positionTracking()->currentLocation();\n        qSort( result.begin(), result.end(), placemarkSmallerDistance );\n    } else {\n        s_currentQuery = &userQuery;\n        qSort( result.begin(), result.end(), placemarkHigherScore );\n        s_currentQuery = 0;\n    }\n\n    if ( result.size() > 50 ) {\n        result.remove( 50, result.size()-50 );\n    }\n\n    return result;\n}\n\nvoid OsmDatabase::unique( QVector<OsmPlacemark> &placemarks ) const\n{\n    for ( int i=1; i<placemarks.size(); ++i ) {\n        if ( placemarks[i-1] == placemarks[i] ) {\n            placemarks.remove( i );\n            --i;\n        }\n    }\n}\n\nQString OsmDatabase::formatDistance( const GeoDataCoordinates &a, const GeoDataCoordinates &b ) const\n{\n    qreal distance = EARTH_RADIUS * distanceSphere( a, b);\n\n    int precision = 0;\n    QString distanceUnit = \"m\";\n\n    if ( MarbleGlobal::getInstance()->locale()->measurementSystem() == QLocale::ImperialSystem ) {\n        precision = 1;\n        distanceUnit = \"mi\";\n        distance *= METER2KM;\n        distance *= KM2MI;\n    } else {\n        if ( distance >= 1000 ) {\n            distance \/= 1000;\n            distanceUnit = \"km\";\n            precision = 1;\n        } else if ( distance >= 200 ) {\n            distance = 50 * qRound( distance \/ 50 );\n        } else if ( distance >= 100 ) {\n            distance = 25 * qRound( distance \/ 25 );\n        } else {\n            distance = 10 * qRound( distance \/ 10 );\n        }\n    }\n\n    QString const fuzzyDistance = QString( \"%1 %2\" ).arg( distance, 0, 'f', precision ).arg( distanceUnit );\n\n    int direction = 180 + bearing( a, b ) * RAD2DEG;\n\n    QString heading = QObject::tr( \"north\" );\n    if ( direction > 337 ) {\n        heading = QObject::tr( \"north\" );\n    } else if ( direction > 292 ) {\n        heading = QObject::tr( \"north-west\" );\n    } else if ( direction > 247 ) {\n        heading = QObject::tr( \"west\" );\n    } else if ( direction > 202 ) {\n        heading = QObject::tr( \"south-west\" );\n    } else if ( direction > 157 ) {\n        heading = QObject::tr( \"south\" );\n    } else if ( direction > 112 ) {\n        heading = QObject::tr( \"south-east\" );\n    } else if ( direction > 67 ) {\n        heading = QObject::tr( \"east\" );\n    } else if ( direction > 22 ) {\n        heading = QObject::tr( \"north-east\" );\n    }\n\n    return fuzzyDistance + \" \" + heading;\n}\n\nqreal OsmDatabase::bearing( const GeoDataCoordinates &a, const GeoDataCoordinates &b ) const\n{\n    qreal delta = b.longitude() - a.longitude();\n    qreal lat1 = a.latitude();\n    qreal lat2 = b.latitude();\n    return fmod( atan2( sin ( delta ) * cos ( lat2 ),\n                       cos( lat1 ) * sin( lat2 ) - sin( lat1 ) * cos( lat2 ) * cos ( delta ) ), 2 * M_PI );\n}\n\nQString OsmDatabase::wildcardQuery( const QString &term ) const\n{\n    QString result = term;\n    if ( term.contains( '*' ) ) {\n        return \" LIKE '\" + result.replace( '*', '%' ) + \"'\";\n    } else {\n        return \" = '\" + result + \"'\";\n    }\n}\n\nvoid OsmDatabase::clear()\n{\n    m_databases.clear();\n}\n\n}\n<commit_msg>local-osm-search: fix position use<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 2011      Dennis Nienhüser <earthwings@gentoo.org>\n\/\/\n\n#include \"OsmDatabase.h\"\n\n#include \"DatabaseQuery.h\"\n#include \"GeoDataLatLonAltBox.h\"\n#include \"MarbleDebug.h\"\n#include \"MarbleMath.h\"\n#include \"MarbleLocale.h\"\n#include \"MarbleModel.h\"\n#include \"PositionTracking.h\"\n\n#include <QtCore\/QFile>\n#include <QtCore\/QDataStream>\n#include <QtCore\/QStringList>\n#include <QtCore\/QRegExp>\n#include <QtCore\/QVariant>\n#include <QtCore\/QTime>\n\n#include <QtSql\/QSqlDatabase>\n#include <QtSql\/QSqlQuery>\n#include <QtSql\/QSqlError>\n\nnamespace Marble {\n\nnamespace {\n\nstatic GeoDataCoordinates s_currentPosition;\nstatic DatabaseQuery* s_currentQuery = 0;\n\nbool placemarkSmallerDistance( const OsmPlacemark &a, const OsmPlacemark &b )\n{\n    return distanceSphere( a.longitude() * DEG2RAD, a.latitude() * DEG2RAD,\n                           s_currentPosition.longitude(), s_currentPosition.latitude() )\n         < distanceSphere( b.longitude() * DEG2RAD, b.latitude() * DEG2RAD,\n                           s_currentPosition.longitude(), s_currentPosition.latitude() );\n}\n\nbool placemarkHigherScore( const OsmPlacemark &a, const OsmPlacemark &b )\n{\n    return a.matchScore( s_currentQuery ) > b.matchScore( s_currentQuery );\n}\n\n}\n\nOsmDatabase::OsmDatabase()\n{\n    m_database = QSqlDatabase::addDatabase( \"QSQLITE\", \"marble\/local-osm-search\" );\n}\n\nvoid OsmDatabase::addFile( const QString &fileName )\n{\n    m_databases << fileName;\n}\n\nQVector<OsmPlacemark> OsmDatabase::find( MarbleModel* model, const QString &searchTerm, const GeoDataLatLonAltBox preferred )\n{\n    if ( m_databases.isEmpty() ) {\n        return QVector<OsmPlacemark>();\n    }\n\n    DatabaseQuery userQuery( model, searchTerm, preferred );\n\n    QVector<OsmPlacemark> result;\n    QTime timer;\n    timer.start();\n    foreach( const QString &databaseFile, m_databases ) {\n        m_database.setDatabaseName( databaseFile );\n        if ( !m_database.open() ) {\n            mDebug() << \"Failed to connect to database \" << databaseFile;\n        }\n\n        QString regionRestriction;\n        if ( !userQuery.region().isEmpty() ) {\n            \/\/ Nested set model to support region hierarchies, see http:\/\/en.wikipedia.org\/wiki\/Nested_set_model\n            QSqlQuery regionsQuery( \"SELECT lft, rgt FROM regions WHERE name LIKE '%\" + userQuery.region() + \"%';\", m_database );\n            if ( regionsQuery.lastError().isValid() ) {\n                mDebug() << \"Error when executing query\" << regionsQuery.executedQuery();\n                mDebug() << \"Sql reports\" << regionsQuery.lastError();\n            }\n            regionRestriction = \" AND (\";\n            bool first = true;\n            while ( regionsQuery.next() ) {\n                if ( first ) {\n                    first = false;\n                } else {\n                    regionRestriction += \" OR \";\n                }\n                regionRestriction += \" (regions.lft >= \" + regionsQuery.value( 0 ).toString();\n                regionRestriction += \" AND regions.lft <= \" + regionsQuery.value( 1 ).toString() + \")\";\n            }\n            regionRestriction += \")\";\n\n            if ( first ) {\n                continue;\n            }\n        }\n\n        QString queryString;\n\n        queryString = \" SELECT regions.name,\"\n                \" places.name, places.number,\"\n                \" places.category, places.lon, places.lat\"\n                \" FROM regions, places\";\n\n        if ( userQuery.queryType() == DatabaseQuery::CategorySearch ) {\n            queryString += \" WHERE regions.id = places.region AND places.category = %1\";\n            queryString = queryString.arg( (qint32) userQuery.category() );\n            if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat && userQuery.region().isEmpty() ) {\n                queryString += \" ORDER BY ((places.lat-%1)*(places.lat-%1)+(places.lon-%2)*(places.lon-%2))\";\n                GeoDataCoordinates position = userQuery.position();\n                queryString = queryString.arg( position.latitude( GeoDataCoordinates::Degree ), 0, 'f', 8 )\n                        .arg( position.longitude( GeoDataCoordinates::Degree ), 0, 'f', 8 );\n            } else {\n                queryString += regionRestriction;\n            }\n        } else if ( userQuery.queryType() == DatabaseQuery::BroadSearch ) {\n            queryString += \" WHERE regions.id = places.region\"\n                    \" AND places.name \" + wildcardQuery( searchTerm );\n        } else {\n            queryString += \" WHERE regions.id = places.region\"\n                    \"   AND places.name \" + wildcardQuery( userQuery.street() );\n            if ( !userQuery.houseNumber().isEmpty() ) {\n                queryString += \" AND places.number \" + wildcardQuery( userQuery.houseNumber() );\n            } else {\n                queryString += \" AND places.number IS NULL\";\n            }\n            queryString += regionRestriction;\n        }\n\n        queryString += \" LIMIT 50;\";\n\n        \/** @todo: sort\/filter results from several databases *\/\n\n        QSqlQuery query( m_database );\n        query.setForwardOnly( true );\n        if ( !query.exec( queryString ) ) {\n            mDebug() << \"Failed to execute query\" << query.lastError();\n            return result;\n        }\n\n        while ( query.next() ) {\n            OsmPlacemark placemark;\n            if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat ) {\n                GeoDataCoordinates coordinates( query.value(4).toFloat(), query.value(5).toFloat(), 0.0, GeoDataCoordinates::Degree );\n                placemark.setAdditionalInformation( formatDistance( coordinates, userQuery.position() ) );\n            } else {\n                placemark.setAdditionalInformation( query.value( 0 ).toString() );\n            }\n            placemark.setName( query.value(1).toString() );\n            placemark.setHouseNumber( query.value(2).toString() );\n            placemark.setCategory( (OsmPlacemark::OsmCategory) query.value(3).toInt() );\n            placemark.setLongitude( query.value(4).toFloat() );\n            placemark.setLatitude( query.value(5).toFloat() );\n            result.push_back( placemark );\n        }\n\n        \/\/ mDebug() << \"Query string: \" << queryString;\n    }\n\n    mDebug() << \"Offline OSM search query took \" << timer.elapsed() << \" ms.\";\n\n    qSort( result.begin(), result.end() );\n    unique( result );\n\n    if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat ) {\n        s_currentPosition = userQuery.position();\n        qSort( result.begin(), result.end(), placemarkSmallerDistance );\n    } else {\n        s_currentQuery = &userQuery;\n        qSort( result.begin(), result.end(), placemarkHigherScore );\n        s_currentQuery = 0;\n    }\n\n    if ( result.size() > 50 ) {\n        result.remove( 50, result.size()-50 );\n    }\n\n    return result;\n}\n\nvoid OsmDatabase::unique( QVector<OsmPlacemark> &placemarks ) const\n{\n    for ( int i=1; i<placemarks.size(); ++i ) {\n        if ( placemarks[i-1] == placemarks[i] ) {\n            placemarks.remove( i );\n            --i;\n        }\n    }\n}\n\nQString OsmDatabase::formatDistance( const GeoDataCoordinates &a, const GeoDataCoordinates &b ) const\n{\n    qreal distance = EARTH_RADIUS * distanceSphere( a, b);\n\n    int precision = 0;\n    QString distanceUnit = \"m\";\n\n    if ( MarbleGlobal::getInstance()->locale()->measurementSystem() == QLocale::ImperialSystem ) {\n        precision = 1;\n        distanceUnit = \"mi\";\n        distance *= METER2KM;\n        distance *= KM2MI;\n    } else {\n        if ( distance >= 1000 ) {\n            distance \/= 1000;\n            distanceUnit = \"km\";\n            precision = 1;\n        } else if ( distance >= 200 ) {\n            distance = 50 * qRound( distance \/ 50 );\n        } else if ( distance >= 100 ) {\n            distance = 25 * qRound( distance \/ 25 );\n        } else {\n            distance = 10 * qRound( distance \/ 10 );\n        }\n    }\n\n    QString const fuzzyDistance = QString( \"%1 %2\" ).arg( distance, 0, 'f', precision ).arg( distanceUnit );\n\n    int direction = 180 + bearing( a, b ) * RAD2DEG;\n\n    QString heading = QObject::tr( \"north\" );\n    if ( direction > 337 ) {\n        heading = QObject::tr( \"north\" );\n    } else if ( direction > 292 ) {\n        heading = QObject::tr( \"north-west\" );\n    } else if ( direction > 247 ) {\n        heading = QObject::tr( \"west\" );\n    } else if ( direction > 202 ) {\n        heading = QObject::tr( \"south-west\" );\n    } else if ( direction > 157 ) {\n        heading = QObject::tr( \"south\" );\n    } else if ( direction > 112 ) {\n        heading = QObject::tr( \"south-east\" );\n    } else if ( direction > 67 ) {\n        heading = QObject::tr( \"east\" );\n    } else if ( direction > 22 ) {\n        heading = QObject::tr( \"north-east\" );\n    }\n\n    return fuzzyDistance + \" \" + heading;\n}\n\nqreal OsmDatabase::bearing( const GeoDataCoordinates &a, const GeoDataCoordinates &b ) const\n{\n    qreal delta = b.longitude() - a.longitude();\n    qreal lat1 = a.latitude();\n    qreal lat2 = b.latitude();\n    return fmod( atan2( sin ( delta ) * cos ( lat2 ),\n                       cos( lat1 ) * sin( lat2 ) - sin( lat1 ) * cos( lat2 ) * cos ( delta ) ), 2 * M_PI );\n}\n\nQString OsmDatabase::wildcardQuery( const QString &term ) const\n{\n    QString result = term;\n    if ( term.contains( '*' ) ) {\n        return \" LIKE '\" + result.replace( '*', '%' ) + \"'\";\n    } else {\n        return \" = '\" + result + \"'\";\n    }\n}\n\nvoid OsmDatabase::clear()\n{\n    m_databases.clear();\n}\n\n}\n<|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\/base\/logging.h\"\n#include \"xenia\/kernel\/kernel_state.h\"\n#include \"xenia\/kernel\/objects\/xenumerator.h\"\n#include \"xenia\/kernel\/objects\/xuser_module.h\"\n#include \"xenia\/kernel\/util\/shim_utils.h\"\n#include \"xenia\/kernel\/util\/xex2.h\"\n#include \"xenia\/kernel\/xam_private.h\"\n#include \"xenia\/xbox.h\"\n\nnamespace xe {\nnamespace kernel {\n\nSHIM_CALL XamGetSystemVersion_shim(PPCContext* ppc_state, KernelState* state) {\n  XELOGD(\"XamGetSystemVersion()\");\n  \/\/ eh, just picking one. If we go too low we may break new games, but\n  \/\/ this value seems to be used for conditionally loading symbols and if\n  \/\/ we pretend to be old we have less to worry with implementing.\n  \/\/ 0x200A3200\n  \/\/ 0x20096B00\n  SHIM_SET_RETURN_64(0);\n}\n\nSHIM_CALL XGetAVPack_shim(PPCContext* ppc_state, KernelState* state) {\n  \/\/ DWORD\n  \/\/ Not sure what the values are for this, but 6 is VGA.\n  \/\/ Other likely values are 3\/4\/8 for HDMI or something.\n  \/\/ Games seem to use this as a PAL check - if the result is not 3\/4\/6\/8\n  \/\/ they explode with errors if not in PAL mode.\n  SHIM_SET_RETURN_64(6);\n}\n\nSHIM_CALL XGetGameRegion_shim(PPCContext* ppc_state, KernelState* state) {\n  XELOGD(\"XGetGameRegion()\");\n\n  SHIM_SET_RETURN_64(XEX_REGION_ALL);\n}\n\nSHIM_CALL XGetLanguage_shim(PPCContext* ppc_state, KernelState* state) {\n  XELOGD(\"XGetLanguage()\");\n\n  uint32_t desired_language = X_LANGUAGE_ENGLISH;\n\n  \/\/ Switch the language based on game region.\n  \/\/ TODO(benvanik): pull from xex header.\n  uint32_t game_region = XEX_REGION_NTSCU;\n  if (game_region & XEX_REGION_NTSCU) {\n    desired_language = X_LANGUAGE_ENGLISH;\n  } else if (game_region & XEX_REGION_NTSCJ) {\n    desired_language = X_LANGUAGE_JAPANESE;\n  }\n  \/\/ Add more overrides?\n\n  SHIM_SET_RETURN_64(desired_language);\n}\n\nSHIM_CALL XamVoiceIsActiveProcess_shim(PPCContext* ppc_state,\n                                       KernelState* state) {\n  XELOGD(\"XamVoiceIsActiveProcess()\");\n  \/\/ Returning 0 here will short-circuit a bunch of voice stuff.\n  SHIM_SET_RETURN_32(0);\n}\n\nSHIM_CALL XamGetExecutionId_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t info_ptr = SHIM_GET_ARG_32(0);\n\n  XELOGD(\"XamGetExecutionId(%.8X)\", info_ptr);\n\n  auto module = state->GetExecutableModule();\n  assert_not_null(module);\n\n  SHIM_SET_MEM_32(info_ptr, module->execution_info_ptr());\n\n  module->Release();\n\n  SHIM_SET_RETURN_32(0);\n}\n\nSHIM_CALL XamLoaderGetLaunchDataSize_shim(PPCContext* ppc_state,\n                                          KernelState* state) {\n  uint32_t size_ptr = SHIM_GET_ARG_32(0);\n\n  XELOGD(\"XamLoaderGetLaunchDataSize(%.8X)\", size_ptr);\n\n  SHIM_SET_MEM_32(size_ptr, 0);\n\n  SHIM_SET_RETURN_64(0);\n}\n\nSHIM_CALL XamLoaderGetLaunchData_shim(PPCContext* ppc_state,\n                                      KernelState* state) {\n  uint32_t buffer_ptr = SHIM_GET_ARG_32(0);\n  uint32_t buffer_size = SHIM_GET_ARG_32(1);\n\n  XELOGD(\"XamLoaderGetLaunchData(%.8X, %d)\", buffer_ptr, buffer_size);\n\n  SHIM_SET_RETURN_64(0);\n}\n\nSHIM_CALL XamLoaderLaunchTitle_shim(PPCContext* ppc_state, KernelState* state) {\n  XELOGD(\"XamLoaderLaunchTitle(?)\");\n  assert_always();\n}\n\nSHIM_CALL XamLoaderTerminateTitle_shim(PPCContext* ppc_state,\n                                       KernelState* state) {\n  XELOGD(\"XamLoaderTerminateTitle()\");\n  assert_always();\n}\n\nSHIM_CALL XamAlloc_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t unk = SHIM_GET_ARG_32(0);\n  uint32_t size = SHIM_GET_ARG_32(1);\n  uint32_t out_ptr = SHIM_GET_ARG_32(2);\n\n  XELOGD(\"XamAlloc(%d, %d, %.8X)\", unk, size, out_ptr);\n\n  assert_true(unk == 0);\n\n  \/\/ Allocate from the heap. Not sure why XAM does this specially, perhaps\n  \/\/ it keeps stuff in a separate heap?\n  uint32_t ptr = state->memory()->SystemHeapAlloc(size);\n  SHIM_SET_MEM_32(out_ptr, ptr);\n\n  SHIM_SET_RETURN_32(X_ERROR_SUCCESS);\n}\n\nSHIM_CALL XamFree_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t ptr = SHIM_GET_ARG_32(0);\n\n  XELOGD(\"XamFree(%.8X)\", ptr);\n\n  state->memory()->SystemHeapFree(ptr);\n\n  SHIM_SET_RETURN_32(X_ERROR_SUCCESS);\n}\n\nSHIM_CALL XamEnumerate_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t handle = SHIM_GET_ARG_32(0);\n  uint32_t zero = SHIM_GET_ARG_32(1);\n  uint32_t buffer_ptr = SHIM_GET_ARG_32(2);\n  uint32_t buffer_length = SHIM_GET_ARG_32(3);\n  uint32_t item_count_ptr = SHIM_GET_ARG_32(4);\n  uint32_t overlapped_ptr = SHIM_GET_ARG_32(5);\n\n  assert_true(zero == 0);\n\n  XELOGD(\"XamEnumerate(%.8X, %d, %.8X, %d, %.8X, %.8X)\", handle, zero,\n         buffer_ptr, buffer_length, item_count_ptr, overlapped_ptr);\n\n  XEnumerator* e = nullptr;\n  if (XFAILED(state->object_table()->GetObject(handle, (XObject**)&e))) {\n    SHIM_SET_RETURN_64(X_ERROR_INVALID_HANDLE);\n    return;\n  }\n\n  auto item_count = e->item_count();\n  e->WriteItems(SHIM_MEM_ADDR(buffer_ptr));\n\n  X_RESULT result = item_count ? X_ERROR_SUCCESS : X_ERROR_NO_MORE_FILES;\n  if (item_count_ptr) {\n    assert_zero(overlapped_ptr);\n    SHIM_SET_MEM_32(item_count_ptr, item_count);\n  } else if (overlapped_ptr) {\n    assert_zero(item_count_ptr);\n    state->CompleteOverlappedImmediate(overlapped_ptr, result, item_count);\n    result = X_ERROR_IO_PENDING;\n  } else {\n    assert_always();\n    result = X_ERROR_INVALID_PARAMETER;\n  }\n\n  e->Release();\n\n  SHIM_SET_RETURN_64(result);\n}\n\n}  \/\/ namespace kernel\n}  \/\/ namespace xe\n\nvoid xe::kernel::xam::RegisterInfoExports(\n    xe::cpu::ExportResolver* export_resolver, KernelState* state) {\n  SHIM_SET_MAPPING(\"xam.xex\", XamGetSystemVersion, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XGetAVPack, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XGetGameRegion, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XGetLanguage, state);\n\n  SHIM_SET_MAPPING(\"xam.xex\", XamVoiceIsActiveProcess, state);\n\n  SHIM_SET_MAPPING(\"xam.xex\", XamGetExecutionId, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamLoaderGetLaunchDataSize, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamLoaderGetLaunchData, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamLoaderLaunchTitle, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamLoaderTerminateTitle, state);\n\n  SHIM_SET_MAPPING(\"xam.xex\", XamAlloc, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamFree, state);\n\n  SHIM_SET_MAPPING(\"xam.xex\", XamEnumerate, state);\n}\n<commit_msg>XamLoaderLaunchTitle log parameters<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\/base\/logging.h\"\n#include \"xenia\/kernel\/kernel_state.h\"\n#include \"xenia\/kernel\/objects\/xenumerator.h\"\n#include \"xenia\/kernel\/objects\/xuser_module.h\"\n#include \"xenia\/kernel\/util\/shim_utils.h\"\n#include \"xenia\/kernel\/util\/xex2.h\"\n#include \"xenia\/kernel\/xam_private.h\"\n#include \"xenia\/xbox.h\"\n\nnamespace xe {\nnamespace kernel {\n\nSHIM_CALL XamGetSystemVersion_shim(PPCContext* ppc_state, KernelState* state) {\n  XELOGD(\"XamGetSystemVersion()\");\n  \/\/ eh, just picking one. If we go too low we may break new games, but\n  \/\/ this value seems to be used for conditionally loading symbols and if\n  \/\/ we pretend to be old we have less to worry with implementing.\n  \/\/ 0x200A3200\n  \/\/ 0x20096B00\n  SHIM_SET_RETURN_64(0);\n}\n\nSHIM_CALL XGetAVPack_shim(PPCContext* ppc_state, KernelState* state) {\n  \/\/ DWORD\n  \/\/ Not sure what the values are for this, but 6 is VGA.\n  \/\/ Other likely values are 3\/4\/8 for HDMI or something.\n  \/\/ Games seem to use this as a PAL check - if the result is not 3\/4\/6\/8\n  \/\/ they explode with errors if not in PAL mode.\n  SHIM_SET_RETURN_64(6);\n}\n\nSHIM_CALL XGetGameRegion_shim(PPCContext* ppc_state, KernelState* state) {\n  XELOGD(\"XGetGameRegion()\");\n\n  SHIM_SET_RETURN_64(XEX_REGION_ALL);\n}\n\nSHIM_CALL XGetLanguage_shim(PPCContext* ppc_state, KernelState* state) {\n  XELOGD(\"XGetLanguage()\");\n\n  uint32_t desired_language = X_LANGUAGE_ENGLISH;\n\n  \/\/ Switch the language based on game region.\n  \/\/ TODO(benvanik): pull from xex header.\n  uint32_t game_region = XEX_REGION_NTSCU;\n  if (game_region & XEX_REGION_NTSCU) {\n    desired_language = X_LANGUAGE_ENGLISH;\n  } else if (game_region & XEX_REGION_NTSCJ) {\n    desired_language = X_LANGUAGE_JAPANESE;\n  }\n  \/\/ Add more overrides?\n\n  SHIM_SET_RETURN_64(desired_language);\n}\n\nSHIM_CALL XamVoiceIsActiveProcess_shim(PPCContext* ppc_state,\n                                       KernelState* state) {\n  XELOGD(\"XamVoiceIsActiveProcess()\");\n  \/\/ Returning 0 here will short-circuit a bunch of voice stuff.\n  SHIM_SET_RETURN_32(0);\n}\n\nSHIM_CALL XamGetExecutionId_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t info_ptr = SHIM_GET_ARG_32(0);\n\n  XELOGD(\"XamGetExecutionId(%.8X)\", info_ptr);\n\n  auto module = state->GetExecutableModule();\n  assert_not_null(module);\n\n  SHIM_SET_MEM_32(info_ptr, module->execution_info_ptr());\n\n  module->Release();\n\n  SHIM_SET_RETURN_32(0);\n}\n\nSHIM_CALL XamLoaderGetLaunchDataSize_shim(PPCContext* ppc_state,\n                                          KernelState* state) {\n  uint32_t size_ptr = SHIM_GET_ARG_32(0);\n\n  XELOGD(\"XamLoaderGetLaunchDataSize(%.8X)\", size_ptr);\n\n  SHIM_SET_MEM_32(size_ptr, 0);\n\n  SHIM_SET_RETURN_64(0);\n}\n\nSHIM_CALL XamLoaderGetLaunchData_shim(PPCContext* ppc_state,\n                                      KernelState* state) {\n  uint32_t buffer_ptr = SHIM_GET_ARG_32(0);\n  uint32_t buffer_size = SHIM_GET_ARG_32(1);\n\n  XELOGD(\"XamLoaderGetLaunchData(%.8X, %d)\", buffer_ptr, buffer_size);\n\n  SHIM_SET_RETURN_64(0);\n}\n\nSHIM_CALL XamLoaderLaunchTitle_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t name_ptr = SHIM_GET_ARG_32(0);\n  const char* name = (const char*)SHIM_MEM_ADDR(name_ptr);\n  uint32_t unk2 = SHIM_GET_ARG_32(1);\n\n  XELOGD(\"XamLoaderLaunchTitle(%.8X(%s), %.8X)\", name_ptr, name, unk2);\n  assert_always();\n}\n\nSHIM_CALL XamLoaderTerminateTitle_shim(PPCContext* ppc_state,\n                                       KernelState* state) {\n  XELOGD(\"XamLoaderTerminateTitle()\");\n  assert_always();\n}\n\nSHIM_CALL XamAlloc_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t unk = SHIM_GET_ARG_32(0);\n  uint32_t size = SHIM_GET_ARG_32(1);\n  uint32_t out_ptr = SHIM_GET_ARG_32(2);\n\n  XELOGD(\"XamAlloc(%d, %d, %.8X)\", unk, size, out_ptr);\n\n  assert_true(unk == 0);\n\n  \/\/ Allocate from the heap. Not sure why XAM does this specially, perhaps\n  \/\/ it keeps stuff in a separate heap?\n  uint32_t ptr = state->memory()->SystemHeapAlloc(size);\n  SHIM_SET_MEM_32(out_ptr, ptr);\n\n  SHIM_SET_RETURN_32(X_ERROR_SUCCESS);\n}\n\nSHIM_CALL XamFree_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t ptr = SHIM_GET_ARG_32(0);\n\n  XELOGD(\"XamFree(%.8X)\", ptr);\n\n  state->memory()->SystemHeapFree(ptr);\n\n  SHIM_SET_RETURN_32(X_ERROR_SUCCESS);\n}\n\nSHIM_CALL XamEnumerate_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t handle = SHIM_GET_ARG_32(0);\n  uint32_t zero = SHIM_GET_ARG_32(1);\n  uint32_t buffer_ptr = SHIM_GET_ARG_32(2);\n  uint32_t buffer_length = SHIM_GET_ARG_32(3);\n  uint32_t item_count_ptr = SHIM_GET_ARG_32(4);\n  uint32_t overlapped_ptr = SHIM_GET_ARG_32(5);\n\n  assert_true(zero == 0);\n\n  XELOGD(\"XamEnumerate(%.8X, %d, %.8X, %d, %.8X, %.8X)\", handle, zero,\n         buffer_ptr, buffer_length, item_count_ptr, overlapped_ptr);\n\n  XEnumerator* e = nullptr;\n  if (XFAILED(state->object_table()->GetObject(handle, (XObject**)&e))) {\n    SHIM_SET_RETURN_64(X_ERROR_INVALID_HANDLE);\n    return;\n  }\n\n  auto item_count = e->item_count();\n  e->WriteItems(SHIM_MEM_ADDR(buffer_ptr));\n\n  X_RESULT result = item_count ? X_ERROR_SUCCESS : X_ERROR_NO_MORE_FILES;\n  if (item_count_ptr) {\n    assert_zero(overlapped_ptr);\n    SHIM_SET_MEM_32(item_count_ptr, item_count);\n  } else if (overlapped_ptr) {\n    assert_zero(item_count_ptr);\n    state->CompleteOverlappedImmediate(overlapped_ptr, result, item_count);\n    result = X_ERROR_IO_PENDING;\n  } else {\n    assert_always();\n    result = X_ERROR_INVALID_PARAMETER;\n  }\n\n  e->Release();\n\n  SHIM_SET_RETURN_64(result);\n}\n\n}  \/\/ namespace kernel\n}  \/\/ namespace xe\n\nvoid xe::kernel::xam::RegisterInfoExports(\n    xe::cpu::ExportResolver* export_resolver, KernelState* state) {\n  SHIM_SET_MAPPING(\"xam.xex\", XamGetSystemVersion, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XGetAVPack, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XGetGameRegion, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XGetLanguage, state);\n\n  SHIM_SET_MAPPING(\"xam.xex\", XamVoiceIsActiveProcess, state);\n\n  SHIM_SET_MAPPING(\"xam.xex\", XamGetExecutionId, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamLoaderGetLaunchDataSize, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamLoaderGetLaunchData, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamLoaderLaunchTitle, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamLoaderTerminateTitle, state);\n\n  SHIM_SET_MAPPING(\"xam.xex\", XamAlloc, state);\n  SHIM_SET_MAPPING(\"xam.xex\", XamFree, state);\n\n  SHIM_SET_MAPPING(\"xam.xex\", XamEnumerate, state);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tCopyright (C) 2003-2013 by Kristina Simpson <sweet.kristas@gmail.com>\n\t\n\tThis software is provided 'as-is', without any express or implied\n\twarranty. In no event will the authors be held liable for any damages\n\tarising from the use of this software.\n\n\tPermission is granted to anyone to use this software for any purpose,\n\tincluding commercial applications, and to alter it and redistribute it\n\tfreely, subject to the following restrictions:\n\n\t   1. The origin of this software must not be misrepresented; you must not\n\t   claim that you wrote the original software. If you use this software\n\t   in a product, an acknowledgment in the product documentation would be\n\t   appreciated but is not required.\n\n\t   2. Altered source versions must be plainly marked as such, and must not be\n\t   misrepresented as being the original software.\n\n\t   3. This notice may not be removed or altered from any source\n\t   distribution.\n*\/\n\n#include \"solid_renderable.hpp\"\n#include \"xhtml_line_box.hpp\"\n#include \"xhtml_layout_engine.hpp\"\n#include \"xhtml_text_box.hpp\"\n\nnamespace xhtml\n{\n\tLineBox::LineBox(BoxPtr parent, const point& cursor)\n\t\t: Box(BoxId::LINE, parent, nullptr),\n\t\t  starting_x_(0),\n\t\t  cursor_(cursor)\n\t{\n\t}\n\n\tstd::string LineBox::toString() const\n\t{\n\t\tstd::ostringstream ss;\n\t\tss << \"LineBox: \" << getDimensions().content_;\n\t\treturn ss.str();\n\t}\n\n\tvoid LineBox::reflowChildren(LayoutEngine& eng, const Dimensions& containing)\n\t{\n\t\tFixedPoint lh = eng.getLineHeight();\n\t\tFixedPoint width = eng.getWidthAtPosition(cursor_.y + eng.getOffset().y, containing.content_.width) - cursor_.x;\n\n\t\tauto children = getChildren();\n\t\tclearChildren();\n\t\tfor(auto& child : children) {\n\t\t\tif(child->id() == BoxId::TEXT) {\n\t\t\t\tauto txt = std::dynamic_pointer_cast<TextBox>(child);\n\t\t\t\tASSERT_LOG(txt != nullptr, \"Something went wrong child box with id TEXT couldn't be cast to Text box\");\n\t\t\t\tTextPtr tnode = txt->getText();\n\t\t\t\tauto it = tnode->begin();\n\n\t\t\t\twhile(it != tnode->end()) {\n\t\t\t\t\tit = txt->reflow(eng, cursor_, it);\n\n\t\t\t\t\tLinePtr line = txt->getLine();\n\t\t\t\t\tif(line != nullptr && !line->line.empty()) {\n\t\t\t\t\t\ttxt->setContentX(cursor_.x);\n\t\t\t\t\t\ttxt->setContentY(cursor_.y);\n\n\t\t\t\t\t\tFixedPoint x_inc = txt->getWidth() + txt->getMBPWidth();\n\t\t\t\t\t\tcursor_.x += x_inc;\n\t\t\t\t\t\twidth -= x_inc;\n\t\t\t\t\t\taddChild(txt);\n\t\t\t\t\t\ttxt.reset();\n\t\t\t\t\t}\n\t\t\t\n\t\t\t\t\tif((line != nullptr && line->is_end_line) || width < 0) {\n\t\t\t\t\t\tcursor_.y += lh;\n\t\t\t\t\t\tcursor_.x = 0;\n\t\t\t\t\t\twidth = eng.getWidthAtPosition(cursor_.y + eng.getOffset().y, containing.content_.width);\n\t\t\t\t\t}\n\n\t\t\t\t\tif(it != tnode->end()) {\n\t\t\t\t\t\ttxt = std::make_shared<TextBox>(shared_from_this(), tnode);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t\/\/ XXX fixme\n\t\t\t\taddChild(child);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid LineBox::handlePreChildLayout(LayoutEngine& eng, const Dimensions& containing)\n\t{\n\t}\n\n\tvoid LineBox::handleLayout(LayoutEngine& eng, const Dimensions& containing)\n\t{\n\t\treflowChildren(eng, containing);\n\n\t\t\/\/ Our children should already be set at this point.\n\t\t\/\/ we want to compute our own width\/height based on our children and set the \n\t\t\/\/ children's x\/y\n\t\tFixedPoint height = 0;\n\t\tFixedPoint width = 0;\n\n\t\t\/\/ compute our width\/height\n\t\tfor(auto& child : getChildren()) {\n\t\t\tchild->setContentX(width + starting_x_);\n\n\t\t\theight = std::max(height, child->getHeight() + child->getMBPHeight());\n\t\t\twidth += child->getWidth() + getMBPWidth();\n\t\t}\n\t\t\n\t\tsetContentWidth(width);\n\t\tsetContentHeight(height);\n\n\t\t\/\/ computer&set children X\/Y offsets\n\t\tfor(auto& child : getChildren()) {\n\t\t\tFixedPoint child_y = 0;\n\t\t\t\/\/ XXX we should implement this fully.\n\t\t\tswitch(child->getVerticalAlign()) {\n\t\t\t\tcase css::CssVerticalAlign::BASELINE:\n\t\t\t\t\t\/\/ Align the baseline of the box with the baseline of the parent box. \n\t\t\t\t\t\/\/ If the box does not have a baseline, align the bottom margin edge \n\t\t\t\t\t\/\/ with the parent's baseline.\n\t\t\t\t\tchild_y = child->getBaselineOffset();\n\t\t\t\t\tbreak;\n\t\t\t\tcase css::CssVerticalAlign::MIDDLE:\n\t\t\t\t\t\/\/ Align the vertical midpoint of the box with the baseline of the \n\t\t\t\t\t\/\/ parent box plus half the x-height of the parent.\n\t\t\t\t\tchild_y = height \/ 2;\n\t\t\t\t\tbreak;\n\t\t\t\tcase css::CssVerticalAlign::BOTTOM:\n\t\t\t\t\t\/\/ Align the bottom of the aligned subtree with the bottom of the line box.\n\t\t\t\t\tchild_y = child->getBottomOffset();\n\t\t\t\t\tbreak;\n\t\t\t\tcase css::CssVerticalAlign::SUB:\n\t\t\t\t\t\/\/ Lower the baseline of the box to the proper position for subscripts of the \n\t\t\t\t\t\/\/ parent's box. (This value has no effect on the font size of the element's text.)\n\t\t\t\tcase css::CssVerticalAlign::SUPER:\n\t\t\t\t\t\/\/ Raise the baseline of the box to the proper position for superscripts of the \n\t\t\t\t\t\/\/ parent's box. (This value has no effect on the font size of the element's text.)\n\t\t\t\tcase css::CssVerticalAlign::TOP:\n\t\t\t\t\t\/\/ Align the top of the aligned subtree with the top of the line box.\n\t\t\t\tcase css::CssVerticalAlign::TEXT_TOP:\n\t\t\t\t\t\/\/ Align the top of the box with the top of the parent's content area\n\t\t\t\tcase css::CssVerticalAlign::TEXT_BOTTOM:\n\t\t\t\t\t\/\/ Align the bottom of the box with the bottom of the parent's content area\n\t\t\t\tcase css::CssVerticalAlign::LENGTH:\n\t\t\t\tdefault:  break;\n\t\t\t}\n\t\t\tchild->setContentY(child_y);\n\t\t}\n\t}\n\n\tvoid LineBox::handleRender(DisplayListPtr display_list, const point& offset) const\n\t{\n\t\t\/\/ do nothing\n\t}\n\n\tvoid LineBox::handleRenderBorder(DisplayListPtr display_list, const point& offset) const\n\t{\n\t\t\/\/ add a debug background, around content.\n\t\t\/*rect r(getDimensions().content_.x + offset.x, \n\t\t\tgetDimensions().content_.y + offset.y, \n\t\t\tgetDimensions().content_.width, \n\t\t\tgetDimensions().content_.height);\n\t\tauto sr = std::make_shared<SolidRenderable>(r, KRE::Color::colorSlateblue());\n\t\tdisplay_list->addRenderable(sr);*\/\n\t}\n}\n<commit_msg>Removed a couple of now erroneous statements.<commit_after>\/*\n\tCopyright (C) 2003-2013 by Kristina Simpson <sweet.kristas@gmail.com>\n\t\n\tThis software is provided 'as-is', without any express or implied\n\twarranty. In no event will the authors be held liable for any damages\n\tarising from the use of this software.\n\n\tPermission is granted to anyone to use this software for any purpose,\n\tincluding commercial applications, and to alter it and redistribute it\n\tfreely, subject to the following restrictions:\n\n\t   1. The origin of this software must not be misrepresented; you must not\n\t   claim that you wrote the original software. If you use this software\n\t   in a product, an acknowledgment in the product documentation would be\n\t   appreciated but is not required.\n\n\t   2. Altered source versions must be plainly marked as such, and must not be\n\t   misrepresented as being the original software.\n\n\t   3. This notice may not be removed or altered from any source\n\t   distribution.\n*\/\n\n#include \"solid_renderable.hpp\"\n#include \"xhtml_line_box.hpp\"\n#include \"xhtml_layout_engine.hpp\"\n#include \"xhtml_text_box.hpp\"\n\nnamespace xhtml\n{\n\tLineBox::LineBox(BoxPtr parent, const point& cursor)\n\t\t: Box(BoxId::LINE, parent, nullptr),\n\t\t  starting_x_(0),\n\t\t  cursor_(cursor)\n\t{\n\t}\n\n\tstd::string LineBox::toString() const\n\t{\n\t\tstd::ostringstream ss;\n\t\tss << \"LineBox: \" << getDimensions().content_;\n\t\treturn ss.str();\n\t}\n\n\tvoid LineBox::reflowChildren(LayoutEngine& eng, const Dimensions& containing)\n\t{\n\t\tFixedPoint lh = eng.getLineHeight();\n\t\tFixedPoint width = eng.getWidthAtPosition(cursor_.y + eng.getOffset().y, containing.content_.width) - cursor_.x;\n\n\t\tauto children = getChildren();\n\t\tclearChildren();\n\t\tfor(auto& child : children) {\n\t\t\tif(child->id() == BoxId::TEXT) {\n\t\t\t\tauto txt = std::dynamic_pointer_cast<TextBox>(child);\n\t\t\t\tASSERT_LOG(txt != nullptr, \"Something went wrong child box with id TEXT couldn't be cast to Text box\");\n\t\t\t\tTextPtr tnode = txt->getText();\n\t\t\t\tauto it = tnode->begin();\n\n\t\t\t\twhile(it != tnode->end()) {\n\t\t\t\t\tit = txt->reflow(eng, cursor_, it);\n\n\t\t\t\t\tLinePtr line = txt->getLine();\n\t\t\t\t\tif(line != nullptr && !line->line.empty()) {\n\t\t\t\t\t\ttxt->setContentX(cursor_.x);\n\t\t\t\t\t\ttxt->setContentY(cursor_.y);\n\n\t\t\t\t\t\tFixedPoint x_inc = txt->getWidth() + txt->getMBPWidth();\n\t\t\t\t\t\tcursor_.x += x_inc;\n\t\t\t\t\t\twidth -= x_inc;\n\t\t\t\t\t\taddChild(txt);\n\t\t\t\t\t\ttxt.reset();\n\t\t\t\t\t}\n\t\t\t\n\t\t\t\t\tif((line != nullptr && line->is_end_line) || width < 0) {\n\t\t\t\t\t\tcursor_.y += lh;\n\t\t\t\t\t\tcursor_.x = 0;\n\t\t\t\t\t\twidth = eng.getWidthAtPosition(cursor_.y + eng.getOffset().y, containing.content_.width);\n\t\t\t\t\t}\n\n\t\t\t\t\tif(it != tnode->end()) {\n\t\t\t\t\t\ttxt = std::make_shared<TextBox>(shared_from_this(), tnode);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t\/\/ XXX fixme\n\t\t\t\taddChild(child);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid LineBox::handlePreChildLayout(LayoutEngine& eng, const Dimensions& containing)\n\t{\n\t}\n\n\tvoid LineBox::handleLayout(LayoutEngine& eng, const Dimensions& containing)\n\t{\n\t\treflowChildren(eng, containing);\n\n\t\t\/\/ Our children should already be set at this point.\n\t\t\/\/ we want to compute our own width\/height based on our children and set the \n\t\t\/\/ children's x\/y\n\t\tFixedPoint height = 0;\n\t\tFixedPoint width = 0;\n\n\t\t\/\/ compute our width\/height\n\t\tfor(auto& child : getChildren()) {\n\t\t\t\/\/child->setContentX(width + starting_x_);\n\n\t\t\theight = std::max(height, child->getHeight() + child->getMBPHeight());\n\t\t\twidth += child->getWidth() + getMBPWidth();\n\t\t}\n\t\t\n\t\tsetContentWidth(width);\n\t\tsetContentHeight(height);\n\n\t\t\/\/ computer&set children X\/Y offsets\n\t\tfor(auto& child : getChildren()) {\n\t\t\tFixedPoint child_y = 0;\n\t\t\t\/\/ XXX we should implement this fully.\n\t\t\tswitch(child->getVerticalAlign()) {\n\t\t\t\tcase css::CssVerticalAlign::BASELINE:\n\t\t\t\t\t\/\/ Align the baseline of the box with the baseline of the parent box. \n\t\t\t\t\t\/\/ If the box does not have a baseline, align the bottom margin edge \n\t\t\t\t\t\/\/ with the parent's baseline.\n\t\t\t\t\tchild_y = child->getBaselineOffset();\n\t\t\t\t\tbreak;\n\t\t\t\tcase css::CssVerticalAlign::MIDDLE:\n\t\t\t\t\t\/\/ Align the vertical midpoint of the box with the baseline of the \n\t\t\t\t\t\/\/ parent box plus half the x-height of the parent.\n\t\t\t\t\tchild_y = height \/ 2;\n\t\t\t\t\tbreak;\n\t\t\t\tcase css::CssVerticalAlign::BOTTOM:\n\t\t\t\t\t\/\/ Align the bottom of the aligned subtree with the bottom of the line box.\n\t\t\t\t\tchild_y = child->getBottomOffset();\n\t\t\t\t\tbreak;\n\t\t\t\tcase css::CssVerticalAlign::SUB:\n\t\t\t\t\t\/\/ Lower the baseline of the box to the proper position for subscripts of the \n\t\t\t\t\t\/\/ parent's box. (This value has no effect on the font size of the element's text.)\n\t\t\t\tcase css::CssVerticalAlign::SUPER:\n\t\t\t\t\t\/\/ Raise the baseline of the box to the proper position for superscripts of the \n\t\t\t\t\t\/\/ parent's box. (This value has no effect on the font size of the element's text.)\n\t\t\t\tcase css::CssVerticalAlign::TOP:\n\t\t\t\t\t\/\/ Align the top of the aligned subtree with the top of the line box.\n\t\t\t\tcase css::CssVerticalAlign::TEXT_TOP:\n\t\t\t\t\t\/\/ Align the top of the box with the top of the parent's content area\n\t\t\t\tcase css::CssVerticalAlign::TEXT_BOTTOM:\n\t\t\t\t\t\/\/ Align the bottom of the box with the bottom of the parent's content area\n\t\t\t\tcase css::CssVerticalAlign::LENGTH:\n\t\t\t\tdefault:  break;\n\t\t\t}\n\t\t\t\/\/child->setContentY(child_y);\n\t\t}\n\t}\n\n\tvoid LineBox::handleRender(DisplayListPtr display_list, const point& offset) const\n\t{\n\t\t\/\/ do nothing\n\t}\n\n\tvoid LineBox::handleRenderBorder(DisplayListPtr display_list, const point& offset) const\n\t{\n\t\t\/\/ add a debug background, around content.\n\t\t\/*rect r(getDimensions().content_.x + offset.x, \n\t\t\tgetDimensions().content_.y + offset.y, \n\t\t\tgetDimensions().content_.width, \n\t\t\tgetDimensions().content_.height);\n\t\tauto sr = std::make_shared<SolidRenderable>(r, KRE::Color::colorSlateblue());\n\t\tdisplay_list->addRenderable(sr);*\/\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2013 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\/Error.hpp>\n#include <Nazara\/Core\/Log.hpp>\n#include <cstdlib>\n#include <stdexcept>\n\n#if defined(NAZARA_PLATFORM_WINDOWS)\n\t#include <windows.h>\n#elif defined(NAZARA_PLATFORM_POSIX)\n\t#include <cstring>\n#endif\n\n#include <Nazara\/Core\/Debug.hpp>\n\nvoid NzError::Error(nzErrorType type, const NzString& error)\n{\n\tif ((s_flags & nzErrorFlag_Silent) == 0 || (s_flags & nzErrorFlag_SilentDisabled) != 0)\n\t\tNazaraLog->WriteError(type, error);\n\n\ts_lastError = error;\n\ts_lastErrorFile = \"\";\n\ts_lastErrorFunction = \"\";\n\ts_lastErrorLine = 0;\n\n\t#if NAZARA_CORE_EXIT_ON_ASSERT_FAILURE\n\tif (type == nzErrorType_AssertFailed)\n\t\tstd::exit(EXIT_FAILURE);\n\t#endif\n\n\tif ((s_flags & nzErrorFlag_ThrowException) != 0 && (s_flags & nzErrorFlag_ThrowExceptionDisabled) == 0)\n\t\tthrow std::runtime_error(error);\n}\n\nvoid NzError::Error(nzErrorType type, const NzString& error, unsigned int line, const char* file, const char* function)\n{\n\tif ((s_flags & nzErrorFlag_Silent) == 0 || (s_flags & nzErrorFlag_SilentDisabled) != 0)\n\t\tNazaraLog->WriteError(type, error, line, file, function);\n\n\ts_lastError = error;\n\ts_lastErrorFile = file;\n\ts_lastErrorFunction = function;\n\ts_lastErrorLine = line;\n\n\t#if NAZARA_CORE_EXIT_ON_ASSERT_FAILURE\n\tif (type == nzErrorType_AssertFailed)\n\t\tstd::exit(EXIT_FAILURE);\n\t#endif\n\n\tif ((s_flags & nzErrorFlag_ThrowException) != 0 && (s_flags & nzErrorFlag_ThrowExceptionDisabled) == 0)\n\t\tthrow std::runtime_error(error);\n}\n\nnzUInt32 NzError::GetFlags()\n{\n\treturn s_flags;\n}\n\nNzString NzError::GetLastError(const char** file, unsigned int* line, const char** function)\n{\n\tif (file)\n\t\t*file = s_lastErrorFile;\n\n\tif (line)\n\t\t*line = s_lastErrorLine;\n\n\tif (function)\n\t\t*function = s_lastErrorFunction;\n\n\treturn s_lastError;\n}\n\nunsigned int NzError::GetLastSystemErrorCode()\n{\n\t#if defined(NAZARA_PLATFORM_WINDOWS)\n\treturn ::GetLastError();\n\t#elif defined(NAZARA_PLATFORM_POSIX)\n\treturn errno;\n\t#else\n\t\t#error GetLastSystemErrorCode is not implemented on this platform\n\treturn 0;\n\t#endif\n}\n\nNzString NzError::GetLastSystemError(unsigned int code)\n{\n\t#if defined(NAZARA_PLATFORM_WINDOWS)\n\twchar_t* buffer = nullptr;\n\n\tFormatMessageW(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_IGNORE_INSERTS,\n\t\t\t\t  nullptr,\n\t\t\t\t  code,\n\t\t\t\t  0,\n\t\t\t\t  reinterpret_cast<LPWSTR>(&buffer),\n\t\t\t\t  0,\n\t\t\t\t  nullptr);\n\n\tNzString error(NzString::Unicode(buffer));\n\tLocalFree(buffer);\n\n\terror.Trim(); \/\/ Pour une raison inconnue, Windows met deux-trois retours à la ligne après le message\n\n\treturn error;\n\t#elif defined(NAZARA_PLATFORM_POSIX)\n\treturn std::strerror(code);\n\t#else\n\t\t#error GetLastSystemError is not implemented on this platform\n\n\treturn NzString(\"GetLastSystemError is not implemented on this platform\");\n\t#endif\n}\n\nvoid NzError::SetFlags(nzUInt32 flags)\n{\n\ts_flags = flags;\n}\n\nnzUInt32 NzError::s_flags = nzErrorFlag_None;\nNzString NzError::s_lastError;\nconst char* NzError::s_lastErrorFunction = \"\";\nconst char* NzError::s_lastErrorFile = \"\";\nunsigned int NzError::s_lastErrorLine = 0;\n<commit_msg>Warnings no longer throw exceptions<commit_after>\/\/ Copyright (C) 2013 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\/Error.hpp>\n#include <Nazara\/Core\/Log.hpp>\n#include <cstdlib>\n#include <stdexcept>\n\n#if defined(NAZARA_PLATFORM_WINDOWS)\n\t#include <windows.h>\n#elif defined(NAZARA_PLATFORM_POSIX)\n\t#include <cstring>\n#endif\n\n#include <Nazara\/Core\/Debug.hpp>\n\nvoid NzError::Error(nzErrorType type, const NzString& error)\n{\n\tif ((s_flags & nzErrorFlag_Silent) == 0 || (s_flags & nzErrorFlag_SilentDisabled) != 0)\n\t\tNazaraLog->WriteError(type, error);\n\n\ts_lastError = error;\n\ts_lastErrorFile = \"\";\n\ts_lastErrorFunction = \"\";\n\ts_lastErrorLine = 0;\n\n\t#if NAZARA_CORE_EXIT_ON_ASSERT_FAILURE\n\tif (type == nzErrorType_AssertFailed)\n\t\tstd::exit(EXIT_FAILURE);\n\t#endif\n\n\tif (type != nzErrorType_Warning && (s_flags & nzErrorFlag_ThrowException) != 0 && (s_flags & nzErrorFlag_ThrowExceptionDisabled) == 0)\n\t\tthrow std::runtime_error(error);\n}\n\nvoid NzError::Error(nzErrorType type, const NzString& error, unsigned int line, const char* file, const char* function)\n{\n\tif ((s_flags & nzErrorFlag_Silent) == 0 || (s_flags & nzErrorFlag_SilentDisabled) != 0)\n\t\tNazaraLog->WriteError(type, error, line, file, function);\n\n\ts_lastError = error;\n\ts_lastErrorFile = file;\n\ts_lastErrorFunction = function;\n\ts_lastErrorLine = line;\n\n\t#if NAZARA_CORE_EXIT_ON_ASSERT_FAILURE\n\tif (type == nzErrorType_AssertFailed)\n\t\tstd::exit(EXIT_FAILURE);\n\t#endif\n\n\tif (type != nzErrorType_Warning && (s_flags & nzErrorFlag_ThrowException) != 0 && (s_flags & nzErrorFlag_ThrowExceptionDisabled) == 0)\n\t\tthrow std::runtime_error(error);\n}\n\nnzUInt32 NzError::GetFlags()\n{\n\treturn s_flags;\n}\n\nNzString NzError::GetLastError(const char** file, unsigned int* line, const char** function)\n{\n\tif (file)\n\t\t*file = s_lastErrorFile;\n\n\tif (line)\n\t\t*line = s_lastErrorLine;\n\n\tif (function)\n\t\t*function = s_lastErrorFunction;\n\n\treturn s_lastError;\n}\n\nunsigned int NzError::GetLastSystemErrorCode()\n{\n\t#if defined(NAZARA_PLATFORM_WINDOWS)\n\treturn ::GetLastError();\n\t#elif defined(NAZARA_PLATFORM_POSIX)\n\treturn errno;\n\t#else\n\t\t#error GetLastSystemErrorCode is not implemented on this platform\n\treturn 0;\n\t#endif\n}\n\nNzString NzError::GetLastSystemError(unsigned int code)\n{\n\t#if defined(NAZARA_PLATFORM_WINDOWS)\n\twchar_t* buffer = nullptr;\n\n\tFormatMessageW(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_IGNORE_INSERTS,\n\t\t\t\t  nullptr,\n\t\t\t\t  code,\n\t\t\t\t  0,\n\t\t\t\t  reinterpret_cast<LPWSTR>(&buffer),\n\t\t\t\t  0,\n\t\t\t\t  nullptr);\n\n\tNzString error(NzString::Unicode(buffer));\n\tLocalFree(buffer);\n\n\terror.Trim(); \/\/ Pour une raison inconnue, Windows met deux-trois retours à la ligne après le message\n\n\treturn error;\n\t#elif defined(NAZARA_PLATFORM_POSIX)\n\treturn std::strerror(code);\n\t#else\n\t\t#error GetLastSystemError is not implemented on this platform\n\n\treturn NzString(\"GetLastSystemError is not implemented on this platform\");\n\t#endif\n}\n\nvoid NzError::SetFlags(nzUInt32 flags)\n{\n\ts_flags = flags;\n}\n\nnzUInt32 NzError::s_flags = nzErrorFlag_None;\nNzString NzError::s_lastError;\nconst char* NzError::s_lastErrorFunction = \"\";\nconst char* NzError::s_lastErrorFile = \"\";\nunsigned int NzError::s_lastErrorLine = 0;\n<|endoftext|>"}
{"text":"<commit_before>#include <QFont>\n#include <QFontDialog>\n#include <QKeyEvent>\n#include <QObject>\n#include <QSettings>\n\n#include <PreferencesWindow.hh>\n#include <config.hh>\n\n#include <ui_PreferencesWindow.h>\n\nPreferencesWindow::PreferencesWindow(QWidget *parent, Qt::WindowFlags f)\n:\nQWidget(parent, f),\nd_ui(QSharedPointer<Ui::PreferencesWindow>(new Ui::PreferencesWindow))\n{\n    d_ui->setupUi(this);\n\n#ifndef USE_REMOTE_CORPUS\n    d_ui->groupBox_x->hide();\n#endif\n\n\n#ifndef __APPLE__\n    applyAppFont();\n\n    connect(d_ui->appFontPushButton, SIGNAL(clicked()),\n        SLOT(selectAppFont()));\n#else\n    d_ui->tabWidget->removeTab(0);\n#endif\n\n    loadColorsTab();\n    loadNetworkTab();\n    loadRemoteTab();\n\n    connect(d_ui->treeActiveNodeForegroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n    connect(d_ui->treeActiveNodeBackgroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n\n    connect(d_ui->keywordsInContextKeywordForegroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n    connect(d_ui->keywordsInContextKeywordBackgroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n    connect(d_ui->keywordsInContextContextForegroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n    connect(d_ui->keywordsInContextContextBackgroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n\n    connect(d_ui->completeSentencesBackgroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n\n    connect(d_ui->archiveBaseUrlLineEdit, SIGNAL(editingFinished()),\n        SLOT(saveArchiveBaseUrl()));\n\n    connect(d_ui->remoteBaseUrlLineEdit, SIGNAL(editingFinished()),\n        SLOT(saveRemoteBaseUrl()));\n\n    connect(d_ui->webserviceBaseUrlLineEdit, SIGNAL(editingFinished()),\n        SLOT(saveWebserviceBaseUrl()));\n\n    connect(d_ui->restoreDefaultColorsButton, SIGNAL(clicked()),\n        SLOT(restoreDefaultColors()));\n\n    connect(d_ui->restoreDefaultNetworkButton, SIGNAL(clicked()),\n        SLOT(restoreDefaultNetwork()));\n\n    connect(d_ui->restoreDefaultRemoteButton, SIGNAL(clicked()),\n        SLOT(restoreDefaultRemote()));\n\n    connect(d_ui->restoreDefaultWebserviceButton, SIGNAL(clicked()),\n        SLOT(restoreDefaultWebservice()));\n}\n\nPreferencesWindow::~PreferencesWindow() {}\n\nvoid PreferencesWindow::applyAppFont()\n{\n    d_ui->appFontLineEdit->setText(qApp->font().family());\n}\n\nvoid PreferencesWindow::selectAppFont()\n{\n    bool ok;\n    QFont newFont(QFontDialog::getFont(&ok, qApp->font(), this));\n    if (!ok)\n        return;\n\n    qApp->setFont(newFont);\n\n    QSettings().setValue(\"appFont\", newFont.toString());\n\n    applyAppFont();\n}\n\nvoid PreferencesWindow::loadColorsTab()\n{\n    QSettings settings;\n\n    settings.beginGroup(\"Tree\");\n\n    d_ui->treeActiveNodeForegroundColor->setColor(\n        settings.value(\"activeNodeForeground\", QColor(Qt::white)).value<QColor>());\n\n    d_ui->treeActiveNodeBackgroundColor->setColor(\n        settings.value(\"activeNodeBackground\", QColor(Qt::darkGreen)).value<QColor>());\n\n    settings.endGroup();\n\n\n    settings.beginGroup(\"KeywordsInContext\");\n\n    d_ui->keywordsInContextKeywordForegroundColor->setColor(\n        settings.value(\"keywordForeground\", QColor(Qt::black)).value<QColor>());\n\n    d_ui->keywordsInContextKeywordBackgroundColor->setColor(\n        settings.value(\"keywordBackground\", QColor(Qt::white)).value<QColor>());\n\n    d_ui->keywordsInContextContextForegroundColor->setColor(\n        settings.value(\"contextForeground\", QColor(Qt::darkGray)).value<QColor>());\n\n    d_ui->keywordsInContextContextBackgroundColor->setColor(\n        settings.value(\"contextBackground\", QColor(Qt::white)).value<QColor>());\n\n    settings.endGroup();\n\n\n    settings.beginGroup(\"CompleteSentence\");\n\n    d_ui->completeSentencesBackgroundColor->setColor(\n           settings.value(\"background\", QColor(Qt::green)).value<QColor>());\n\n    settings.endGroup();\n}\n\nvoid PreferencesWindow::loadNetworkTab()\n{\n    QSettings settings;\n    d_ui->archiveBaseUrlLineEdit->setText(\n        settings.value(ARCHIVE_BASEURL_KEY, DEFAULT_ARCHIVE_BASEURL).toString());\n\n    d_ui->webserviceBaseUrlLineEdit->setText(\n        settings.value(WEBSERVICE_BASEURL_KEY, DEFAULT_WEBSERVICE_BASEURL).toString());\n}\n\nvoid PreferencesWindow::loadRemoteTab()\n{\n    QSettings settings;\n    d_ui->remoteBaseUrlLineEdit->setText(\n        settings.value(REMOTE_BASEURL_KEY, DEFAULT_REMOTE_BASEURL).toString());\n}\n\nvoid PreferencesWindow::saveArchiveBaseUrl()\n{\n    QSettings settings;\n    settings.setValue(ARCHIVE_BASEURL_KEY, d_ui->archiveBaseUrlLineEdit->text());\n}\n\nvoid PreferencesWindow::saveRemoteBaseUrl()\n{\n    QSettings settings;\n    settings.setValue(REMOTE_BASEURL_KEY, d_ui->remoteBaseUrlLineEdit->text());\n}\n\nvoid PreferencesWindow::saveWebserviceBaseUrl()\n{\n    QSettings settings;\n    settings.setValue(WEBSERVICE_BASEURL_KEY, d_ui->webserviceBaseUrlLineEdit->text());\n}\n\nvoid PreferencesWindow::saveColorsTab()\n{\n    QSettings settings;\n\n    settings.beginGroup(\"Tree\");\n    settings.setValue(\"activeNodeForeground\", d_ui->treeActiveNodeForegroundColor->color());\n    settings.setValue(\"activeNodeBackground\", d_ui->treeActiveNodeBackgroundColor->color());\n    settings.endGroup();\n\n    settings.beginGroup(\"KeywordsInContext\");\n    settings.setValue(\"keywordForeground\", d_ui->keywordsInContextKeywordForegroundColor->color());\n    settings.setValue(\"keywordBackground\", d_ui->keywordsInContextKeywordBackgroundColor->color());\n    settings.setValue(\"contextForeground\", d_ui->keywordsInContextContextForegroundColor->color());\n    settings.setValue(\"contextBackground\", d_ui->keywordsInContextContextBackgroundColor->color());\n    settings.endGroup();\n\n    settings.beginGroup(\"CompleteSentence\");\n    settings.setValue(\"background\", d_ui->completeSentencesBackgroundColor->color());\n    settings.endGroup();\n}\n\nvoid PreferencesWindow::restoreDefaultColors()\n{\n    QSettings settings;\n\n    settings.beginGroup(\"Tree\");\n    settings.remove(\"\");\n    settings.endGroup();\n\n    settings.beginGroup(\"KeywordsInContext\");\n    settings.remove(\"\");\n    settings.endGroup();\n\n    settings.beginGroup(\"CompleteSentence\");\n    settings.remove(\"\");\n    settings.endGroup();\n\n    loadColorsTab();\n}\n\nvoid PreferencesWindow::restoreDefaultNetwork()\n{\n    QSettings settings;\n\n    settings.remove(ARCHIVE_BASEURL_KEY);\n\n    loadNetworkTab();\n}\n\nvoid PreferencesWindow::restoreDefaultRemote()\n{\n    QSettings settings;\n\n    settings.remove(REMOTE_BASEURL_KEY);\n\n    loadRemoteTab();\n}\n\nvoid PreferencesWindow::restoreDefaultWebservice()\n{\n    QSettings settings;\n\n    settings.remove(WEBSERVICE_BASEURL_KEY);\n\n    loadNetworkTab();\n}\n\nvoid PreferencesWindow::keyPressEvent(QKeyEvent *event)\n{\n    \/\/ Cmd + w closes the window in OS X (and in some programs on Windows as well)\n    \/\/ But closing preference windows with ESC isn't uncommon either.\n    if (event->key() == Qt::Key_Escape\n        || (event->key() == Qt::Key_W && event->modifiers() == Qt::ControlModifier))\n    {\n        hide();\n        event->accept();\n    }\n    else\n        QWidget::keyPressEvent(event);\n}\n<commit_msg>Also hide webserivce preferences when webservice client is disabled #82<commit_after>#include <QFont>\n#include <QFontDialog>\n#include <QKeyEvent>\n#include <QObject>\n#include <QSettings>\n\n#include <PreferencesWindow.hh>\n#include <config.hh>\n\n#include <ui_PreferencesWindow.h>\n\nPreferencesWindow::PreferencesWindow(QWidget *parent, Qt::WindowFlags f)\n:\nQWidget(parent, f),\nd_ui(QSharedPointer<Ui::PreferencesWindow>(new Ui::PreferencesWindow))\n{\n    d_ui->setupUi(this);\n\n#ifndef USE_REMOTE_CORPUS\n    d_ui->groupBox_x->hide();\n#endif\n\n#ifndef USE_WEBSERVICE\n    d_ui->groupBoxWebservice->hide();\n#endif\n\n\n#ifndef __APPLE__\n    applyAppFont();\n\n    connect(d_ui->appFontPushButton, SIGNAL(clicked()),\n        SLOT(selectAppFont()));\n#else\n    d_ui->tabWidget->removeTab(0);\n#endif\n\n    loadColorsTab();\n    loadNetworkTab();\n    loadRemoteTab();\n\n    connect(d_ui->treeActiveNodeForegroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n    connect(d_ui->treeActiveNodeBackgroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n\n    connect(d_ui->keywordsInContextKeywordForegroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n    connect(d_ui->keywordsInContextKeywordBackgroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n    connect(d_ui->keywordsInContextContextForegroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n    connect(d_ui->keywordsInContextContextBackgroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n\n    connect(d_ui->completeSentencesBackgroundColor, SIGNAL(colorSelected(QColor)),\n        SLOT(saveColorsTab()));\n\n    connect(d_ui->archiveBaseUrlLineEdit, SIGNAL(editingFinished()),\n        SLOT(saveArchiveBaseUrl()));\n\n    connect(d_ui->remoteBaseUrlLineEdit, SIGNAL(editingFinished()),\n        SLOT(saveRemoteBaseUrl()));\n\n    connect(d_ui->webserviceBaseUrlLineEdit, SIGNAL(editingFinished()),\n        SLOT(saveWebserviceBaseUrl()));\n\n    connect(d_ui->restoreDefaultColorsButton, SIGNAL(clicked()),\n        SLOT(restoreDefaultColors()));\n\n    connect(d_ui->restoreDefaultNetworkButton, SIGNAL(clicked()),\n        SLOT(restoreDefaultNetwork()));\n\n    connect(d_ui->restoreDefaultRemoteButton, SIGNAL(clicked()),\n        SLOT(restoreDefaultRemote()));\n\n    connect(d_ui->restoreDefaultWebserviceButton, SIGNAL(clicked()),\n        SLOT(restoreDefaultWebservice()));\n}\n\nPreferencesWindow::~PreferencesWindow() {}\n\nvoid PreferencesWindow::applyAppFont()\n{\n    d_ui->appFontLineEdit->setText(qApp->font().family());\n}\n\nvoid PreferencesWindow::selectAppFont()\n{\n    bool ok;\n    QFont newFont(QFontDialog::getFont(&ok, qApp->font(), this));\n    if (!ok)\n        return;\n\n    qApp->setFont(newFont);\n\n    QSettings().setValue(\"appFont\", newFont.toString());\n\n    applyAppFont();\n}\n\nvoid PreferencesWindow::loadColorsTab()\n{\n    QSettings settings;\n\n    settings.beginGroup(\"Tree\");\n\n    d_ui->treeActiveNodeForegroundColor->setColor(\n        settings.value(\"activeNodeForeground\", QColor(Qt::white)).value<QColor>());\n\n    d_ui->treeActiveNodeBackgroundColor->setColor(\n        settings.value(\"activeNodeBackground\", QColor(Qt::darkGreen)).value<QColor>());\n\n    settings.endGroup();\n\n\n    settings.beginGroup(\"KeywordsInContext\");\n\n    d_ui->keywordsInContextKeywordForegroundColor->setColor(\n        settings.value(\"keywordForeground\", QColor(Qt::black)).value<QColor>());\n\n    d_ui->keywordsInContextKeywordBackgroundColor->setColor(\n        settings.value(\"keywordBackground\", QColor(Qt::white)).value<QColor>());\n\n    d_ui->keywordsInContextContextForegroundColor->setColor(\n        settings.value(\"contextForeground\", QColor(Qt::darkGray)).value<QColor>());\n\n    d_ui->keywordsInContextContextBackgroundColor->setColor(\n        settings.value(\"contextBackground\", QColor(Qt::white)).value<QColor>());\n\n    settings.endGroup();\n\n\n    settings.beginGroup(\"CompleteSentence\");\n\n    d_ui->completeSentencesBackgroundColor->setColor(\n           settings.value(\"background\", QColor(Qt::green)).value<QColor>());\n\n    settings.endGroup();\n}\n\nvoid PreferencesWindow::loadNetworkTab()\n{\n    QSettings settings;\n    d_ui->archiveBaseUrlLineEdit->setText(\n        settings.value(ARCHIVE_BASEURL_KEY, DEFAULT_ARCHIVE_BASEURL).toString());\n\n    d_ui->webserviceBaseUrlLineEdit->setText(\n        settings.value(WEBSERVICE_BASEURL_KEY, DEFAULT_WEBSERVICE_BASEURL).toString());\n}\n\nvoid PreferencesWindow::loadRemoteTab()\n{\n    QSettings settings;\n    d_ui->remoteBaseUrlLineEdit->setText(\n        settings.value(REMOTE_BASEURL_KEY, DEFAULT_REMOTE_BASEURL).toString());\n}\n\nvoid PreferencesWindow::saveArchiveBaseUrl()\n{\n    QSettings settings;\n    settings.setValue(ARCHIVE_BASEURL_KEY, d_ui->archiveBaseUrlLineEdit->text());\n}\n\nvoid PreferencesWindow::saveRemoteBaseUrl()\n{\n    QSettings settings;\n    settings.setValue(REMOTE_BASEURL_KEY, d_ui->remoteBaseUrlLineEdit->text());\n}\n\nvoid PreferencesWindow::saveWebserviceBaseUrl()\n{\n    QSettings settings;\n    settings.setValue(WEBSERVICE_BASEURL_KEY, d_ui->webserviceBaseUrlLineEdit->text());\n}\n\nvoid PreferencesWindow::saveColorsTab()\n{\n    QSettings settings;\n\n    settings.beginGroup(\"Tree\");\n    settings.setValue(\"activeNodeForeground\", d_ui->treeActiveNodeForegroundColor->color());\n    settings.setValue(\"activeNodeBackground\", d_ui->treeActiveNodeBackgroundColor->color());\n    settings.endGroup();\n\n    settings.beginGroup(\"KeywordsInContext\");\n    settings.setValue(\"keywordForeground\", d_ui->keywordsInContextKeywordForegroundColor->color());\n    settings.setValue(\"keywordBackground\", d_ui->keywordsInContextKeywordBackgroundColor->color());\n    settings.setValue(\"contextForeground\", d_ui->keywordsInContextContextForegroundColor->color());\n    settings.setValue(\"contextBackground\", d_ui->keywordsInContextContextBackgroundColor->color());\n    settings.endGroup();\n\n    settings.beginGroup(\"CompleteSentence\");\n    settings.setValue(\"background\", d_ui->completeSentencesBackgroundColor->color());\n    settings.endGroup();\n}\n\nvoid PreferencesWindow::restoreDefaultColors()\n{\n    QSettings settings;\n\n    settings.beginGroup(\"Tree\");\n    settings.remove(\"\");\n    settings.endGroup();\n\n    settings.beginGroup(\"KeywordsInContext\");\n    settings.remove(\"\");\n    settings.endGroup();\n\n    settings.beginGroup(\"CompleteSentence\");\n    settings.remove(\"\");\n    settings.endGroup();\n\n    loadColorsTab();\n}\n\nvoid PreferencesWindow::restoreDefaultNetwork()\n{\n    QSettings settings;\n\n    settings.remove(ARCHIVE_BASEURL_KEY);\n\n    loadNetworkTab();\n}\n\nvoid PreferencesWindow::restoreDefaultRemote()\n{\n    QSettings settings;\n\n    settings.remove(REMOTE_BASEURL_KEY);\n\n    loadRemoteTab();\n}\n\nvoid PreferencesWindow::restoreDefaultWebservice()\n{\n    QSettings settings;\n\n    settings.remove(WEBSERVICE_BASEURL_KEY);\n\n    loadNetworkTab();\n}\n\nvoid PreferencesWindow::keyPressEvent(QKeyEvent *event)\n{\n    \/\/ Cmd + w closes the window in OS X (and in some programs on Windows as well)\n    \/\/ But closing preference windows with ESC isn't uncommon either.\n    if (event->key() == Qt::Key_Escape\n        || (event->key() == Qt::Key_W && event->modifiers() == Qt::ControlModifier))\n    {\n        hide();\n        event->accept();\n    }\n    else\n        QWidget::keyPressEvent(event);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n\n#ifdef __cplusplus\nextern \"C\"\n{\n#endif\n\nint xerbla_(const char * msg, int *info, int)\n{\n  std::cerr << \"Eigen BLAS ERROR #\" << *info << \": \" << msg << \"\\n\";\n  return 0;\n}\n\n#ifdef __cplusplus\n}\n#endif\n<commit_msg>enforce weak linking of xerbla<commit_after>\n#include <iostream>\n\n#if (defined __GNUC__)\n#define EIGEN_WEAK_LINKING __attribute__ ((weak))\n#else\n#define EIGEN_WEAK_LINKING\n#endif\n\n#ifdef __cplusplus\nextern \"C\"\n{\n#endif\n\nEIGEN_WEAK_LINKING int xerbla_(const char * msg, int *info, int)\n{\n  std::cerr << \"Eigen BLAS ERROR #\" << *info << \": \" << msg << \"\\n\";\n  return 0;\n}\n\n#ifdef __cplusplus\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\r\n#include \"PuzzlesDrawingApi.h\"\r\n#include \"CGameView.h\"\r\n#include \"CGameContainer.h\"\r\n\r\nextern \"C\" {\r\n#include \"puzzles.h\"\r\n}\r\n\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawText(void *handle, int x, int y, int fonttype,\r\n    int fontsize, int align, int colour, char *text) {\r\n    ((CGameView*) handle)->DrawText(x, y, fonttype, fontsize, align, colour, text);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawRect(void *handle, int x, int y, int w, int h, int colour) {\r\n    ((CGameView*) handle)->DrawRect(x, y, w, h, colour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawLine(void *handle, int x1, int y1, int x2, int y2, int colour) {\r\n    ((CGameView*) handle)->DrawLine(x1, y1, x2, y2, colour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawThickLine(void *handle, float thickness, float x1, \r\n    float y1, float x2, float y2, int colour) {\r\n    ((CGameView*) handle)->DrawThickLine(thickness, x1, y1, x2, y2, colour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawPolygon(void *handle, int *coords, int npoints,\r\n    int fillcolour, int outlinecolour) {\r\n    ((CGameView*) handle)->DrawPolygon(\r\n        coords, npoints, fillcolour, outlinecolour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawCircle(void *handle, int cx, int cy, int radius,\r\n    int fillcolour, int outlinecolour) {\r\n    ((CGameView*) handle)->DrawCircle(cx, cy, radius, fillcolour, outlinecolour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_Clip(void *handle, int x, int y, int w, int h) {\r\n    ((CGameView*) handle)->Clip(x, y, w, h);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_Unclip(void *handle) {\r\n    ((CGameView*)handle)->Unclip();\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_StartDraw(void *handle) {\r\n    ((CGameView*) handle)->StartDraw();\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawUpdate(void *handle, int x, int y, int w, int h) {\r\n    ((CGameView*) handle)->DrawUpdate(x, y, w, h);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_EndDraw(void *handle) {\r\n    ((CGameView*) handle)->EndDraw();\r\n}\r\nblitter *CPuzzlesDrawingApi::DrawAPI_BlitterNew(void *handle, int w, int h) {\r\n    return ((CGameView*) handle)->BlitterNew(w, h);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_BlitterFree(void *handle, blitter *bl) {\r\n    ((CGameView*) handle)->BlitterFree(bl);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_BlitterSave(void *handle, blitter *bl, int x, int y) {\r\n    ((CGameView*) handle)->BlitterSave(bl, x, y);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_BlitterLoad(void *handle, blitter *bl, int x, int y) {\r\n    ((CGameView*) handle)->BlitterLoad(bl, x, y);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_StatusBar(void *handle, char *text) {\r\n    TPtrC8 pText((TUint8*)text);\r\n    TBuf<100> buf;\r\n    buf.Copy(pText);\r\n    ((CGameView*) handle)->iGameContainer->SetStatusText(buf);\r\n}\r\n\r\n\r\nconst drawing_api *CPuzzlesDrawingApi::Api() {\r\n    static const struct drawing_api drawing_api = {\r\n        DrawAPI_DrawText,\r\n        DrawAPI_DrawRect,\r\n        DrawAPI_DrawLine,\r\n        DrawAPI_DrawPolygon,\r\n        DrawAPI_DrawCircle,\r\n        DrawAPI_DrawUpdate,\r\n        DrawAPI_Clip,\r\n        DrawAPI_Unclip,\r\n        DrawAPI_StartDraw,\r\n        DrawAPI_EndDraw,\r\n        DrawAPI_StatusBar,\r\n        DrawAPI_BlitterNew,\r\n        DrawAPI_BlitterFree,\r\n        DrawAPI_BlitterSave,\r\n        DrawAPI_BlitterLoad,\r\n        \r\n        NULL, \/\/ begin_doc\r\n        NULL, \/\/ begin_page\r\n        NULL, \/\/ begin_puzzle\r\n        NULL, \/\/ end_puzzle\r\n        NULL, \/\/ end_page\r\n        NULL, \/\/ end_doc\r\n        NULL, \/\/ line_width\r\n        NULL, \/\/ line_dotted\r\n        NULL, \/\/ text_fallback\r\n        \r\n        DrawAPI_DrawThickLine,\r\n    };\r\n    return &drawing_api;\r\n}\r\n<commit_msg>the 'improvement' to drawing thick lines wasn't an improvement at all... use the default implementation instead<commit_after>\r\n#include \"PuzzlesDrawingApi.h\"\r\n#include \"CGameView.h\"\r\n#include \"CGameContainer.h\"\r\n\r\nextern \"C\" {\r\n#include \"puzzles.h\"\r\n}\r\n\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawText(void *handle, int x, int y, int fonttype,\r\n    int fontsize, int align, int colour, char *text) {\r\n    ((CGameView*) handle)->DrawText(x, y, fonttype, fontsize, align, colour, text);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawRect(void *handle, int x, int y, int w, int h, int colour) {\r\n    ((CGameView*) handle)->DrawRect(x, y, w, h, colour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawLine(void *handle, int x1, int y1, int x2, int y2, int colour) {\r\n    ((CGameView*) handle)->DrawLine(x1, y1, x2, y2, colour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawThickLine(void *handle, float thickness, float x1, \r\n    float y1, float x2, float y2, int colour) {\r\n    ((CGameView*) handle)->DrawThickLine(thickness, x1, y1, x2, y2, colour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawPolygon(void *handle, int *coords, int npoints,\r\n    int fillcolour, int outlinecolour) {\r\n    ((CGameView*) handle)->DrawPolygon(\r\n        coords, npoints, fillcolour, outlinecolour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawCircle(void *handle, int cx, int cy, int radius,\r\n    int fillcolour, int outlinecolour) {\r\n    ((CGameView*) handle)->DrawCircle(cx, cy, radius, fillcolour, outlinecolour);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_Clip(void *handle, int x, int y, int w, int h) {\r\n    ((CGameView*) handle)->Clip(x, y, w, h);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_Unclip(void *handle) {\r\n    ((CGameView*)handle)->Unclip();\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_StartDraw(void *handle) {\r\n    ((CGameView*) handle)->StartDraw();\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_DrawUpdate(void *handle, int x, int y, int w, int h) {\r\n    ((CGameView*) handle)->DrawUpdate(x, y, w, h);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_EndDraw(void *handle) {\r\n    ((CGameView*) handle)->EndDraw();\r\n}\r\nblitter *CPuzzlesDrawingApi::DrawAPI_BlitterNew(void *handle, int w, int h) {\r\n    return ((CGameView*) handle)->BlitterNew(w, h);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_BlitterFree(void *handle, blitter *bl) {\r\n    ((CGameView*) handle)->BlitterFree(bl);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_BlitterSave(void *handle, blitter *bl, int x, int y) {\r\n    ((CGameView*) handle)->BlitterSave(bl, x, y);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_BlitterLoad(void *handle, blitter *bl, int x, int y) {\r\n    ((CGameView*) handle)->BlitterLoad(bl, x, y);\r\n}\r\nvoid CPuzzlesDrawingApi::DrawAPI_StatusBar(void *handle, char *text) {\r\n    TPtrC8 pText((TUint8*)text);\r\n    TBuf<100> buf;\r\n    buf.Copy(pText);\r\n    ((CGameView*) handle)->iGameContainer->SetStatusText(buf);\r\n}\r\n\r\n\r\nconst drawing_api *CPuzzlesDrawingApi::Api() {\r\n    static const struct drawing_api drawing_api = {\r\n        DrawAPI_DrawText,\r\n        DrawAPI_DrawRect,\r\n        DrawAPI_DrawLine,\r\n        DrawAPI_DrawPolygon,\r\n        DrawAPI_DrawCircle,\r\n        DrawAPI_DrawUpdate,\r\n        DrawAPI_Clip,\r\n        DrawAPI_Unclip,\r\n        DrawAPI_StartDraw,\r\n        DrawAPI_EndDraw,\r\n        DrawAPI_StatusBar,\r\n        DrawAPI_BlitterNew,\r\n        DrawAPI_BlitterFree,\r\n        DrawAPI_BlitterSave,\r\n        DrawAPI_BlitterLoad,\r\n        \r\n        NULL, \/\/ begin_doc\r\n        NULL, \/\/ begin_page\r\n        NULL, \/\/ begin_puzzle\r\n        NULL, \/\/ end_puzzle\r\n        NULL, \/\/ end_page\r\n        NULL, \/\/ end_doc\r\n        NULL, \/\/ line_width\r\n        NULL, \/\/ line_dotted\r\n        NULL, \/\/ text_fallback\r\n        \r\n        NULL, \/\/ DrawAPI_DrawThickLine,\r\n    };\r\n    return &drawing_api;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/** Copyright (C) 2016, 2017 European Spallation Source ERIC *\/\n\n\n#include <gdgem\/srs\/ParserVMM3.h>\n#include <gdgem\/srs\/ParserVMM3TestData.h>\n#include <test\/TestBase.h>\n#include <vector>\n\nusing namespace Gem;\n\nclass ParserVMM3Test : public TestBase {\n\nprotected:\n  NMXStats stats;\n  ParserVMM3 *parser;\n  SRSTime srsTime;\n  void SetUp() override { \n    srsTime.bc_clock_MHz(40);\n    srsTime.tac_slope_ns(60);\n    srsTime.trigger_resolution_ns(1);\n    parser = new ParserVMM3(1125, stats, srsTime); \n  }\n  void TearDown() override { delete parser; }\n\n  void memSet() {\n    parser->stats.parser_readouts = 0;\n    parser->stats.parser_data = 0;\n    parser->stats.parser_markers = 0;\n    parser->stats.parser_frame_missing_errors = 0;\n    parser->stats.parser_frame_seq_errors = 0;\n    parser->stats.parser_framecounter_overflows = 0;\n    parser->stats.parser_timestamp_lost_errors = 0;\n    parser->stats.parser_timestamp_seq_errors = 0; \n    parser->stats.parser_timestamp_overflows = 0;\n    parser->stats.parser_bad_frames = 0;\n    parser->stats.parser_good_frames = 0;\n    parser->stats.parser_error_bytes = 0;\n  }\n\n  void assertfields(unsigned int hits, unsigned int markers, unsigned int errors) {\n    EXPECT_EQ(parser->stats.parser_data, hits);\n    EXPECT_EQ(parser->stats.parser_markers, markers);\n    EXPECT_EQ(parser->stats.parser_error_bytes, errors);\n  }\n};\n\n\/** Test cases below *\/\nTEST_F(ParserVMM3Test, Constructor) {\n  EXPECT_TRUE(parser->data != nullptr);\n  assertfields(0, 0, 0);\n  for (int i = 0; i < MaxVMMs*MaxFECs; i++) {\n    EXPECT_EQ(parser->markers[i].fecTimeStamp, 0U);\n  }\n}\n\nTEST_F(ParserVMM3Test, UndersizeData) {\n  for (int dataLength = 0; dataLength <= 16; dataLength++) {\n    memSet();\n    int res = parser->receive((char *)&data_3_ch0[0], dataLength);\n    EXPECT_EQ(res, 0);\n    assertfields(0, 0, dataLength);\n    for (int i = 0; i < MaxVMMs*MaxFECs; i++) {\n      EXPECT_EQ(parser->markers[i].fecTimeStamp, 0U);\n    }\n  }\n}\n\nTEST_F(ParserVMM3Test, DataOnly) {\n  memSet();\n  int res = parser->receive((char *)&data_3_ch0[0], data_3_ch0.size());\n  EXPECT_EQ(res, 3); \/\/ three readouts in the readout packet\n  assertfields(3, 0, 0);\n  for (int i = 0; i < MaxVMMs*MaxFECs; i++) {\n    EXPECT_EQ(parser->markers[i].fecTimeStamp, 0U);\n  }\n}\n\nTEST_F(ParserVMM3Test, MarkerOnly) {\n  memSet();\n  int res = parser->receive((char *)&marker_3_vmm1_3[0], marker_3_vmm1_3.size());\n  EXPECT_EQ(res, 0);\n  assertfields(0, 3, 0);\n  for (int i = 0; i < 3; i++) {\n    int vmmid = i + 1; \/\/ see test data\n    EXPECT_EQ(parser->markers[vmmid].fecTimeStamp, i + 1);\n  }\n}\n\nTEST_F(ParserVMM3Test, TimestampError) {\n  memSet();\n  int res = parser->receive((char *)&timestamp_error[0], timestamp_error.size());\n  EXPECT_EQ(res, 0);\n  EXPECT_EQ(0, parser->stats.parser_data);\n  EXPECT_EQ(2, parser->stats.parser_markers);\n  EXPECT_EQ(1, parser->stats.parser_timestamp_seq_errors);\n}\n\nTEST_F(ParserVMM3Test, TimestampOverflow) {\n  memSet();\n  int res = parser->receive((char *)&timestamp_overflow[0], timestamp_overflow.size());\n  EXPECT_EQ(res, 0);\n  EXPECT_EQ(0, parser->stats.parser_data);\n  EXPECT_EQ(2, parser->stats.parser_markers);\n  EXPECT_EQ(1, parser->stats.parser_timestamp_overflows);\n}\n\nTEST_F(ParserVMM3Test, TimestampLost) {\n  memSet();\n  int res = parser->receive((char *)&timestamp_lost[0], timestamp_lost.size());\n  EXPECT_EQ(res, 2);\n  EXPECT_EQ(2, parser->stats.parser_data);\n  EXPECT_EQ(1, parser->stats.parser_markers);\n  EXPECT_EQ(1, parser->stats.parser_timestamp_lost_errors);\n}\n\nTEST_F(ParserVMM3Test, TimestampNotLost) {\n  memSet();\n  int res = parser->receive((char *)&timestamp_not_lost[0], timestamp_not_lost.size());\n  EXPECT_EQ(res, 2);\n  EXPECT_EQ(2, parser->stats.parser_data);\n  EXPECT_EQ(2, parser->stats.parser_markers);\n  EXPECT_EQ(0, parser->stats.parser_timestamp_lost_errors);\n}\n\nTEST_F(ParserVMM3Test, FrameMissingError) {\n  memSet();\n  int res = parser->receive((char *)&framecounter_error1[0], framecounter_error1.size());\n  EXPECT_EQ(res, 1);\n  res = parser->receive((char *)&framecounter_error2[0], framecounter_error2.size());\n  EXPECT_EQ(res, 1);\n  EXPECT_EQ(2, parser->stats.parser_frame_missing_errors);\n}\n\nTEST_F(ParserVMM3Test, FrameOrderError) {\n  memSet();\n  int res = parser->receive((char *)&framecounter_error2[0], framecounter_error2.size());\n  EXPECT_EQ(res, 1);\n  res = parser->receive((char *)&framecounter_error1[0], framecounter_error1.size());\n  EXPECT_EQ(res, 1);\n  EXPECT_EQ(1, parser->stats.parser_frame_seq_errors);\n}\n\nTEST_F(ParserVMM3Test, FramecounterOverflow) {\n  memSet();\n  int res = parser->receive((char *)&framecounter_overflow1[0], framecounter_overflow1.size());\n  EXPECT_EQ(res, 1);\n  res = parser->receive((char *)&framecounter_overflow2[0], framecounter_overflow2.size());\n  EXPECT_EQ(res, 1);\n  EXPECT_EQ(1, parser->stats.parser_framecounter_overflows);\n}\n\n\nTEST_F(ParserVMM3Test, MarkerAndData) {\n  memSet();\n  int res = parser->receive((char *)&marker_3_data_3[0], marker_3_data_3.size());\n  EXPECT_EQ(res, 3); \/\/ three readouts in the readout packet\n  assertfields(3, 3, 0);\n  for (int i = 0; i < 3; i++) {\n    int vmmid = i + 1; \/\/ see test data\n    EXPECT_EQ(parser->markers[vmmid].fecTimeStamp, i + 1);\n  }\n}\n\nTEST_F(ParserVMM3Test, MarkerAndDataMixed) {\n  memSet();\n  int res = parser->receive((char *)&marker_data_mixed_3[0], marker_data_mixed_3.size());\n  EXPECT_EQ(res, 3); \/\/ three readouts in the readout packet\n  assertfields(3, 3, 0);\n  for (int i = 0; i < 3; i++) {\n    int vmmid = i + 1; \/\/ see test data\n    EXPECT_EQ(parser->markers[vmmid].fecTimeStamp, i + 1);\n  }\n}\n\nTEST_F(ParserVMM3Test, NoData) {\n  memSet();\n  int res = parser->receive((char *)&no_data[0], no_data.size());\n  EXPECT_EQ(res, 0);\n  assertfields(0, 0, no_data.size());\n}\n\nTEST_F(ParserVMM3Test, InvalidDataId) {\n  memSet();\n  int res = parser->receive((char *)&invalid_dataid[0], invalid_dataid.size());\n  EXPECT_EQ(res, 0);\n  assertfields(0, 0, invalid_dataid.size());\n}\n\nTEST_F(ParserVMM3Test, InconsistentDataLength) {\n  memSet();\n  int res = parser->receive((char *)&inconsistent_datalen[0], inconsistent_datalen.size());\n  EXPECT_EQ(res, 0);\n  assertfields(0, 0, inconsistent_datalen.size());\n}\n\nTEST_F(ParserVMM3Test, DataLengthOverflow) {\n  NMXStats stats;\n  SRSTime srsTime;\n  srsTime.bc_clock_MHz(40);\n  srsTime.tac_slope_ns(60);\n  srsTime.trigger_resolution_ns(1);\n  ParserVMM3 shortvmmbuffer(2,stats, srsTime);\n  int res = shortvmmbuffer.receive((char *)& data_3_ch0[0],  data_3_ch0.size());\n  EXPECT_EQ(res, 2);\n  EXPECT_EQ(2, shortvmmbuffer.stats.parser_data);\n  EXPECT_EQ(0, shortvmmbuffer.stats.parser_markers);\n  EXPECT_EQ(6, shortvmmbuffer.stats.parser_error_bytes);\n}\n\nint main(int argc, char **argv) {\n  testing::InitGoogleTest(&argc, argv);\n  return RUN_ALL_TESTS();\n}\n<commit_msg>Removal of new.<commit_after>\/** Copyright (C) 2016, 2017 European Spallation Source ERIC *\/\n\n\n#include <gdgem\/srs\/ParserVMM3.h>\n#include <gdgem\/srs\/ParserVMM3TestData.h>\n#include <test\/TestBase.h>\n#include <vector>\n\nusing namespace Gem;\n\nclass ParserVMM3Test : public TestBase {\n\nprotected:\n  NMXStats stats;\n  std::unique_ptr<ParserVMM3> parser;\n  SRSTime srsTime;\n  void SetUp() override { \n    srsTime.bc_clock_MHz(40);\n    srsTime.tac_slope_ns(60);\n    srsTime.trigger_resolution_ns(1);\n    parser = std::make_unique<ParserVMM3>(1125, stats, srsTime);\n  }\n\n  void memSet() {\n    parser->stats.parser_readouts = 0;\n    parser->stats.parser_data = 0;\n    parser->stats.parser_markers = 0;\n    parser->stats.parser_frame_missing_errors = 0;\n    parser->stats.parser_frame_seq_errors = 0;\n    parser->stats.parser_framecounter_overflows = 0;\n    parser->stats.parser_timestamp_lost_errors = 0;\n    parser->stats.parser_timestamp_seq_errors = 0; \n    parser->stats.parser_timestamp_overflows = 0;\n    parser->stats.parser_bad_frames = 0;\n    parser->stats.parser_good_frames = 0;\n    parser->stats.parser_error_bytes = 0;\n  }\n\n  void assertfields(unsigned int hits, unsigned int markers, unsigned int errors) {\n    EXPECT_EQ(parser->stats.parser_data, hits);\n    EXPECT_EQ(parser->stats.parser_markers, markers);\n    EXPECT_EQ(parser->stats.parser_error_bytes, errors);\n  }\n};\n\n\/** Test cases below *\/\nTEST_F(ParserVMM3Test, Constructor) {\n  EXPECT_TRUE(parser->data != nullptr);\n  assertfields(0, 0, 0);\n  for (int i = 0; i < MaxVMMs*MaxFECs; i++) {\n    EXPECT_EQ(parser->markers[i].fecTimeStamp, 0U);\n  }\n}\n\nTEST_F(ParserVMM3Test, UndersizeData) {\n  for (int dataLength = 0; dataLength <= 16; dataLength++) {\n    memSet();\n    int res = parser->receive((char *)&data_3_ch0[0], dataLength);\n    EXPECT_EQ(res, 0);\n    assertfields(0, 0, dataLength);\n    for (int i = 0; i < MaxVMMs*MaxFECs; i++) {\n      EXPECT_EQ(parser->markers[i].fecTimeStamp, 0U);\n    }\n  }\n}\n\nTEST_F(ParserVMM3Test, DataOnly) {\n  memSet();\n  int res = parser->receive((char *)&data_3_ch0[0], data_3_ch0.size());\n  EXPECT_EQ(res, 3); \/\/ three readouts in the readout packet\n  assertfields(3, 0, 0);\n  for (int i = 0; i < MaxVMMs*MaxFECs; i++) {\n    EXPECT_EQ(parser->markers[i].fecTimeStamp, 0U);\n  }\n}\n\nTEST_F(ParserVMM3Test, MarkerOnly) {\n  memSet();\n  int res = parser->receive((char *)&marker_3_vmm1_3[0], marker_3_vmm1_3.size());\n  EXPECT_EQ(res, 0);\n  assertfields(0, 3, 0);\n  for (int i = 0; i < 3; i++) {\n    int vmmid = i + 1; \/\/ see test data\n    EXPECT_EQ(parser->markers[vmmid].fecTimeStamp, i + 1);\n  }\n}\n\nTEST_F(ParserVMM3Test, TimestampError) {\n  memSet();\n  int res = parser->receive((char *)&timestamp_error[0], timestamp_error.size());\n  EXPECT_EQ(res, 0);\n  EXPECT_EQ(0, parser->stats.parser_data);\n  EXPECT_EQ(2, parser->stats.parser_markers);\n  EXPECT_EQ(1, parser->stats.parser_timestamp_seq_errors);\n}\n\nTEST_F(ParserVMM3Test, TimestampOverflow) {\n  memSet();\n  int res = parser->receive((char *)&timestamp_overflow[0], timestamp_overflow.size());\n  EXPECT_EQ(res, 0);\n  EXPECT_EQ(0, parser->stats.parser_data);\n  EXPECT_EQ(2, parser->stats.parser_markers);\n  EXPECT_EQ(1, parser->stats.parser_timestamp_overflows);\n}\n\nTEST_F(ParserVMM3Test, TimestampLost) {\n  memSet();\n  int res = parser->receive((char *)&timestamp_lost[0], timestamp_lost.size());\n  EXPECT_EQ(res, 2);\n  EXPECT_EQ(2, parser->stats.parser_data);\n  EXPECT_EQ(1, parser->stats.parser_markers);\n  EXPECT_EQ(1, parser->stats.parser_timestamp_lost_errors);\n}\n\nTEST_F(ParserVMM3Test, TimestampNotLost) {\n  memSet();\n  int res = parser->receive((char *)&timestamp_not_lost[0], timestamp_not_lost.size());\n  EXPECT_EQ(res, 2);\n  EXPECT_EQ(2, parser->stats.parser_data);\n  EXPECT_EQ(2, parser->stats.parser_markers);\n  EXPECT_EQ(0, parser->stats.parser_timestamp_lost_errors);\n}\n\nTEST_F(ParserVMM3Test, FrameMissingError) {\n  memSet();\n  int res = parser->receive((char *)&framecounter_error1[0], framecounter_error1.size());\n  EXPECT_EQ(res, 1);\n  res = parser->receive((char *)&framecounter_error2[0], framecounter_error2.size());\n  EXPECT_EQ(res, 1);\n  EXPECT_EQ(2, parser->stats.parser_frame_missing_errors);\n}\n\nTEST_F(ParserVMM3Test, FrameOrderError) {\n  memSet();\n  int res = parser->receive((char *)&framecounter_error2[0], framecounter_error2.size());\n  EXPECT_EQ(res, 1);\n  res = parser->receive((char *)&framecounter_error1[0], framecounter_error1.size());\n  EXPECT_EQ(res, 1);\n  EXPECT_EQ(1, parser->stats.parser_frame_seq_errors);\n}\n\nTEST_F(ParserVMM3Test, FramecounterOverflow) {\n  memSet();\n  int res = parser->receive((char *)&framecounter_overflow1[0], framecounter_overflow1.size());\n  EXPECT_EQ(res, 1);\n  res = parser->receive((char *)&framecounter_overflow2[0], framecounter_overflow2.size());\n  EXPECT_EQ(res, 1);\n  EXPECT_EQ(1, parser->stats.parser_framecounter_overflows);\n}\n\n\nTEST_F(ParserVMM3Test, MarkerAndData) {\n  memSet();\n  int res = parser->receive((char *)&marker_3_data_3[0], marker_3_data_3.size());\n  EXPECT_EQ(res, 3); \/\/ three readouts in the readout packet\n  assertfields(3, 3, 0);\n  for (int i = 0; i < 3; i++) {\n    int vmmid = i + 1; \/\/ see test data\n    EXPECT_EQ(parser->markers[vmmid].fecTimeStamp, i + 1);\n  }\n}\n\nTEST_F(ParserVMM3Test, MarkerAndDataMixed) {\n  memSet();\n  int res = parser->receive((char *)&marker_data_mixed_3[0], marker_data_mixed_3.size());\n  EXPECT_EQ(res, 3); \/\/ three readouts in the readout packet\n  assertfields(3, 3, 0);\n  for (int i = 0; i < 3; i++) {\n    int vmmid = i + 1; \/\/ see test data\n    EXPECT_EQ(parser->markers[vmmid].fecTimeStamp, i + 1);\n  }\n}\n\nTEST_F(ParserVMM3Test, NoData) {\n  memSet();\n  int res = parser->receive((char *)&no_data[0], no_data.size());\n  EXPECT_EQ(res, 0);\n  assertfields(0, 0, no_data.size());\n}\n\nTEST_F(ParserVMM3Test, InvalidDataId) {\n  memSet();\n  int res = parser->receive((char *)&invalid_dataid[0], invalid_dataid.size());\n  EXPECT_EQ(res, 0);\n  assertfields(0, 0, invalid_dataid.size());\n}\n\nTEST_F(ParserVMM3Test, InconsistentDataLength) {\n  memSet();\n  int res = parser->receive((char *)&inconsistent_datalen[0], inconsistent_datalen.size());\n  EXPECT_EQ(res, 0);\n  assertfields(0, 0, inconsistent_datalen.size());\n}\n\nTEST_F(ParserVMM3Test, DataLengthOverflow) {\n  NMXStats stats;\n  SRSTime srsTime;\n  srsTime.bc_clock_MHz(40);\n  srsTime.tac_slope_ns(60);\n  srsTime.trigger_resolution_ns(1);\n  ParserVMM3 shortvmmbuffer(2,stats, srsTime);\n  int res = shortvmmbuffer.receive((char *)& data_3_ch0[0],  data_3_ch0.size());\n  EXPECT_EQ(res, 2);\n  EXPECT_EQ(2, shortvmmbuffer.stats.parser_data);\n  EXPECT_EQ(0, shortvmmbuffer.stats.parser_markers);\n  EXPECT_EQ(6, shortvmmbuffer.stats.parser_error_bytes);\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 * @file\tsrc\/UI\/python\/PythonBreaker.cpp\n * @date\tJul. 2016\n * @author\tPhRG - opticalp.fr\n *\/\n\n\/*\n Copyright (c) 2016 Ph. Renaud-Goud \/ Opticalp\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 HAVE_PYTHON27\n\n#include \"PythonBreaker.h\"\n\n\nextern \"C\" void pyBreakerDealloc(BreakerMembers* self)\n{\n    delete self->breaker;\n\n    self->ob_type->tp_free((PyObject*) self); \/\/ free the object’s memory\n}\n\nextern \"C\" PyObject* pyBreakerNew(PyTypeObject* type, PyObject* args, PyObject* kwds)\n{\n    BreakerMembers* self;\n\n    self = (BreakerMembers*) type->tp_alloc(type, 0);\n    if (self != NULL)\n        self->breaker = new Breaker;\n\n    return (PyObject *) self;\n}\n\nextern \"C\" int pyBreakerInit(BreakerMembers* self, PyObject* args, PyObject *kwds)\n{\n\tPyObject pyObj;\n\n\tif (!PyArg_ParseTuple(args, \"\", &pyObj))\n\t\treturn -1;\n\n\treturn 0;\n}\n\n#include \"PythonOutPort.h\"\n\nextern \"C\" PyObject* pyBreakerBreakAllTargets(BreakerMembers* self, PyObject* args)\n{\n\tPyObject *pyObj;\n\n    \/\/ arguments parsing\n    if (!PyArg_ParseTuple(args, \"O:breakAllTargets\", &pyObj))\n        return NULL;\n\n    \/\/ check if the object is a data source\n    \/\/ the comparison uses type name (str)\n    std::string typeName(pyObj->ob_type->tp_name);\n\n    DataSource* source;\n\n    if (typeName.compare(\"instru.OutPort\")) \/\/ only data source yet\n    {\n        PyErr_SetString(PyExc_TypeError,\n                \"The argument must be a data source (output port)\");\n        return NULL;\n    }\n    else\n    {\n    \tsource = **reinterpret_cast<OutPortMembers*>(pyObj)->outPort;\n    }\n\n    try\n    {\n    \tself->breaker->breakAllTargetsFromSource(source);\n    }\n    catch (Poco::Exception& e)\n    {\n        PyErr_SetString(PyExc_RuntimeError,\n                e.displayText().c_str());\n        return NULL;\n    }\n\n    Py_RETURN_NONE;\n}\n\n#include \"PythonInPort.h\"\n#include \"PythonDataLogger.h\"\n\nextern \"C\" PyObject* pyBreakerBreakSource(BreakerMembers* self, PyObject* args)\n{\n\tPyObject *pyObj;\n\n    \/\/ arguments parsing\n    if (!PyArg_ParseTuple(args, \"O:breakSource\", &pyObj))\n        return NULL;\n\n    \/\/ check if the object is a data target\n    \/\/ the comparison uses type name (str)\n    std::string typeName(pyObj->ob_type->tp_name);\n\n    DataTarget* target;\n\n    if (typeName.compare(\"instru.InPort\") == 0)\n    {\n    \ttarget = **reinterpret_cast<InPortMembers*>(pyObj)->inPort;\n    }\n    else if (typeName.compare(\"instru.DataLogger\") == 0)\n    {\n    \ttarget = *reinterpret_cast<DataLoggerMembers*>(pyObj)->logger;\n    }\n    else\n    {\n        PyErr_SetString(PyExc_TypeError,\n                \"The argument must be a data target (input port or data logger)\");\n        return NULL;\n    }\n\n    try\n    {\n    \tself->breaker->breakSourceToTarget(target);\n    }\n    catch (Poco::Exception& e)\n    {\n        PyErr_SetString(PyExc_RuntimeError,\n                e.displayText().c_str());\n        return NULL;\n    }\n\n\tPy_RETURN_NONE;\n}\n\nextern \"C\" PyObject* pyBreakerRelease(BreakerMembers* self)\n{\n\tself->breaker->releaseBreaks();\n\n\tPy_RETURN_NONE;\n}\n\n#endif \/* HAVE_PYTHON27 *\/\n<commit_msg>Generalize the breakers to any DataSource or any DataTarget<commit_after>\/**\n * @file\tsrc\/UI\/python\/PythonBreaker.cpp\n * @date\tJul. 2016\n * @author\tPhRG - opticalp.fr\n *\/\n\n\/*\n Copyright (c) 2016 Ph. Renaud-Goud \/ Opticalp\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 HAVE_PYTHON27\n\n#include \"PythonBreaker.h\"\n\n\nextern \"C\" void pyBreakerDealloc(BreakerMembers* self)\n{\n    delete self->breaker;\n\n    self->ob_type->tp_free((PyObject*) self); \/\/ free the object’s memory\n}\n\nextern \"C\" PyObject* pyBreakerNew(PyTypeObject* type, PyObject* args, PyObject* kwds)\n{\n    BreakerMembers* self;\n\n    self = (BreakerMembers*) type->tp_alloc(type, 0);\n    if (self != NULL)\n        self->breaker = new Breaker;\n\n    return (PyObject *) self;\n}\n\nextern \"C\" int pyBreakerInit(BreakerMembers* self, PyObject* args, PyObject *kwds)\n{\n\tPyObject pyObj;\n\n\tif (!PyArg_ParseTuple(args, \"\", &pyObj))\n\t\treturn -1;\n\n\treturn 0;\n}\n\n#include \"PythonOutPort.h\"\n#include \"PythonDataSource.h\"\n\nextern \"C\" PyObject* pyBreakerBreakAllTargets(BreakerMembers* self, PyObject* args)\n{\n\tPyObject *pyObj;\n\n    \/\/ arguments parsing\n    if (!PyArg_ParseTuple(args, \"O:breakAllTargets\", &pyObj))\n        return NULL;\n\n    \/\/ check if the object is a data source\n    \/\/ the comparison uses type name (str)\n    std::string typeName(pyObj->ob_type->tp_name);\n\n    DataSource* source;\n\n    if (typeName.compare(\"instru.OutPort\") == 0)\n    {\n        source = **reinterpret_cast<OutPortMembers*>(pyObj)->outPort;\n    }\n    else if (typeName.compare(\"instru.DataSource\") == 0)\n    {\n        DataSourceMembers* pyDataSource = reinterpret_cast<DataSourceMembers*>(pyObj);\n        source = pyDataSource->source;\n    }\n    else\n    {\n        PyErr_SetString(PyExc_TypeError,\n                \"The argument must be a data source (output port or DataSource cast)\");\n        return NULL;\n    }\n\n    try\n    {\n    \tself->breaker->breakAllTargetsFromSource(source);\n    }\n    catch (Poco::Exception& e)\n    {\n        PyErr_SetString(PyExc_RuntimeError,\n                e.displayText().c_str());\n        return NULL;\n    }\n\n    Py_RETURN_NONE;\n}\n\n#include \"PythonInPort.h\"\n#include \"PythonDataLogger.h\"\n#include \"PythonDataTarget.h\"\n\nextern \"C\" PyObject* pyBreakerBreakSource(BreakerMembers* self, PyObject* args)\n{\n\tPyObject *pyObj;\n\n    \/\/ arguments parsing\n    if (!PyArg_ParseTuple(args, \"O:breakSource\", &pyObj))\n        return NULL;\n\n    \/\/ check if the object is a data target\n    \/\/ the comparison uses type name (str)\n    std::string typeName(pyObj->ob_type->tp_name);\n\n    DataTarget* target;\n\n    if (typeName.compare(\"instru.InPort\") == 0)\n    {\n    \ttarget = **reinterpret_cast<InPortMembers*>(pyObj)->inPort;\n    }\n    else if (typeName.compare(\"instru.DataLogger\") == 0)\n    {\n    \ttarget = *reinterpret_cast<DataLoggerMembers*>(pyObj)->logger;\n    }\n    else if (typeName.compare(\"instru.DataTarget\") == 0)\n    {\n        DataTargetMembers* pyDataTarget = reinterpret_cast<DataTargetMembers*>(pyObj);\n        target = pyDataTarget->target;\n    }\n    else\n    {\n        PyErr_SetString(PyExc_TypeError,\n                \"The argument must be a data target (input port, data logger or DataTarget cast)\");\n        return NULL;\n    }\n\n    try\n    {\n    \tself->breaker->breakSourceToTarget(target);\n    }\n    catch (Poco::Exception& e)\n    {\n        PyErr_SetString(PyExc_RuntimeError,\n                e.displayText().c_str());\n        return NULL;\n    }\n\n\tPy_RETURN_NONE;\n}\n\nextern \"C\" PyObject* pyBreakerRelease(BreakerMembers* self)\n{\n\tself->breaker->releaseBreaks();\n\n\tPy_RETURN_NONE;\n}\n\n#endif \/* HAVE_PYTHON27 *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"VideodrommLiveCodingApp.h\"\n\nvoid VideodrommLiveCodingApp::prepare(Settings *settings)\n{\n\tsettings->setWindowSize(640, 480);\n\t\/\/settings->setBorderless();\n\tsettings->setWindowPos(0, 0);\n}\nvoid VideodrommLiveCodingApp::setup()\n{\n\t\/\/ maximize fps\n\tdisableFrameRate();\n\tgl::enableVerticalSync(false);\n\t\/\/ Settings\n\tmVDSettings = VDSettings::create();\n\t\/\/ Session\n\tmVDSession = VDSession::create(mVDSettings);\n\t\/\/ Utils\n\tmVDUtils = VDUtils::create(mVDSettings);\n\t\/\/ Animation\n\tmVDAnimation = VDAnimation::create(mVDSettings, mVDSession);\n\t\/\/ Message router\n\tmVDRouter = VDRouter::create(mVDSettings, mVDAnimation, mVDSession);\n\t\/\/ Mix\n\tmMixesFilepath = getAssetPath(\"\") \/ mVDSettings->mAssetsPath \/ \"mixes.xml\";\n\tif (fs::exists(mMixesFilepath)) {\n\t\t\/\/ load textures from file if one exists\n\t\tmMixes = VDMix::readSettings(mVDSettings, mVDAnimation, mVDRouter, loadFile(mMixesFilepath));\n\t}\n\telse {\n\t\t\/\/ otherwise create a texture from scratch\n\t\tmMixes.push_back(VDMix::create(mVDSettings, mVDAnimation, mVDRouter));\n\t}\n\tmVDAnimation->tapTempo();\n\n\tmVDUtils->getWindowsResolution();\n\tsetWindowSize(mVDSettings->mRenderWidth, mVDSettings->mRenderHeight);\n\n\tmVDSettings->iResolution.x = mVDSettings->mRenderWidth;\n\tmVDSettings->iResolution.y = mVDSettings->mRenderHeight;\n\t\/\/ UI\n\tmVDUI = VDUI::create(mVDSettings, mMixes[0], mVDRouter, mVDAnimation, mVDSession);\n\n\tmouseGlobal = false;\n\n\tstatic float f = 0.0f;\n\t\/\/ mouse cursor and UI\n\tsetUIVisibility(mVDSettings->mCursorVisible);\n\t\/\/ windows\n\tmIsShutDown = false;\n\tmIsResizing = true;\n\tmMainWindow = getWindow();\n\tmMainWindow->getSignalDraw().connect(std::bind(&VideodrommLiveCodingApp::drawMain, this));\n\tmMainWindow->getSignalResize().connect(std::bind(&VideodrommLiveCodingApp::resizeWindow, this));\n\t\/*if (mVDSettings->mStandalone) {\n\t\tcreateRenderWindow();\n\t\tsetWindowSize(mVDSettings->mRenderWidth, mVDSettings->mRenderHeight);\n\t\t}\n\t\telse {\n\n\t\t}*\/\n}\nvoid VideodrommLiveCodingApp::createRenderWindow()\n{\n\tdeleteRenderWindows();\n\tmVDUtils->getWindowsResolution();\n\n\tmVDSettings->iResolution.x = mVDSettings->mRenderWidth;\n\tmVDSettings->iResolution.y = mVDSettings->mRenderHeight;\n\n\tCI_LOG_V(\"createRenderWindow, resolution:\" + toString(mVDSettings->iResolution.x) + \"x\" + toString(mVDSettings->iResolution.y));\n\n\tstring windowName = \"render\";\n\tmRenderWindow = createWindow(Window::Format().size(mVDSettings->iResolution.x, mVDSettings->iResolution.y));\n\n\t\/\/ create instance of the window and store in vector\n\tallRenderWindows.push_back(mRenderWindow);\n\n\tmRenderWindow->setBorderless();\n\tmRenderWindow->getSignalDraw().connect(std::bind(&VideodrommLiveCodingApp::drawRender, this));\n\tmVDSettings->mRenderPosXY = ivec2(mVDSettings->mRenderX, mVDSettings->mRenderY);\/\/20141214 was 0\n\tmRenderWindow->setPos(50, 50);\n\tmRenderWindowTimer = 0.0f;\n\ttimeline().apply(&mRenderWindowTimer, 1.0f, 2.0f).finishFn([&]{ positionRenderWindow(); });\n}\nvoid VideodrommLiveCodingApp::positionRenderWindow()\n{\n\tmRenderWindow->setPos(mVDSettings->mRenderX, mVDSettings->mRenderY);\n}\nvoid VideodrommLiveCodingApp::deleteRenderWindows()\n{\n#if defined( CINDER_MSW )\n\tfor (auto wRef : allRenderWindows) DestroyWindow((HWND)mRenderWindow->getNative());\n#endif\n\tallRenderWindows.clear();\n}\nvoid VideodrommLiveCodingApp::setUIVisibility(bool visible)\n{\n\tif (visible)\n\t{\n\t\tshowCursor();\n\t}\n\telse\n\t{\n\t\thideCursor();\n\t}\n}\nvoid VideodrommLiveCodingApp::update()\n{\n\tmVDSettings->iFps = getAverageFps();\n\tmVDSettings->sFps = toString(floor(mVDSettings->iFps));\n\tmMixes[0]->update();\n\tmVDAnimation->update();\n\tmVDRouter->update();\n\n\tupdateWindowTitle();\n}\nvoid VideodrommLiveCodingApp::updateWindowTitle()\n{\n\t\/\/mMainWindow->setTitle(mVDSettings->sFps + \" fps Live Coding\");\n}\nvoid VideodrommLiveCodingApp::cleanup()\n{\n\tif (!mIsShutDown)\n\t{\n\t\tmIsShutDown = true;\n\t\tCI_LOG_V(\"shutdown\");\n\t\tui::disconnectWindow(getWindow());\n\t\tui::Shutdown();\n\t\t\/\/ save settings\n\t\tmVDSettings->save();\n\t\tmVDSession->save();\n\t\tdeleteRenderWindows();\n\t\tmVDRouter->wsDisconnect();\n\t\tquit();\n\t}\n}\nvoid VideodrommLiveCodingApp::mouseDown(MouseEvent event)\n{\n\n}\nvoid VideodrommLiveCodingApp::keyDown(KeyEvent event)\n{\n\n\tif (!mVDAnimation->handleKeyDown(event)) {\n\t\t\/\/ Animation did not handle the key, so handle it here\n\t\tswitch (event.getCode()) {\n\t\tcase KeyEvent::KEY_ESCAPE:\n\t\t\t\/\/ quit the application\n\t\t\tquit();\n\t\t\tbreak;\n\t\tcase KeyEvent::KEY_l:\n\t\t\tmVDAnimation->load();\n\t\t\tbreak;\n\t\tcase KeyEvent::KEY_h:\n\t\t\t\/\/ mouse cursor\n\t\t\tmVDSettings->mCursorVisible = !mVDSettings->mCursorVisible;\n\t\t\tsetUIVisibility(mVDSettings->mCursorVisible);\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid VideodrommLiveCodingApp::keyUp(KeyEvent event)\n{\n\tif (!mVDAnimation->handleKeyUp(event)) {\n\t\t\/\/ Animation did not handle the key, so handle it here\n\t}\n}\nvoid VideodrommLiveCodingApp::resizeWindow()\n{\n\tmVDUI->resize();\n}\nvoid VideodrommLiveCodingApp::fileDrop(FileDropEvent event)\n{\n\tint index = (int)(event.getX() \/ (mVDSettings->uiLargePreviewW + mVDSettings->uiMargin));\n\tci::fs::path mPath = event.getFile(event.getNumFiles() - 1);\n\tstring mFile = mPath.string();\n\tif (mMixes[0]->loadFileFromAbsolutePath(mFile, index) > -1) {\n\t\t\/\/ load success\n\t\t\/\/ reset zoom\n\t\tmVDAnimation->controlValues[22] = 1.0f;\n\t}\n}\n\nvoid VideodrommLiveCodingApp::drawRender()\n{\n\tgl::clear(Color::black());\n\t\/\/gl::setMatricesWindow(toPixels(getWindowSize()));\n\tgl::setMatricesWindow(mVDSettings->mRenderWidth, mVDSettings->mRenderHeight, false);\n\t\/\/ live coding fbo gl::draw(mFbo->getColorTexture(), getWindowBounds());\n\tgl::draw(mMixes[0]->getMixTexture(), getWindowBounds());\n}\n\nvoid VideodrommLiveCodingApp::drawMain()\n{\n\tmMainWindow->setTitle(mVDSettings->sFps + \" fps Live Coding\");\n\n\tgl::clear(Color::black());\n\t\/\/\tgl::setMatricesWindow(toPixels(getWindowSize()));\n\tgl::setMatricesWindow(mVDSettings->mRenderWidth, mVDSettings->mRenderHeight, false);\n\tgl::draw(mMixes[0]->getMixTexture(), getWindowBounds());\n\n\t\/\/ imgui\n\tif (!mVDSettings->mCursorVisible) return;\n\n\tmVDUI->Run(\"UI\", (int)getAverageFps());\n\tif (mVDUI->isReady()) {\n\t}\n\n}\n\nCINDER_APP(VideodrommLiveCodingApp, RendererGl, &VideodrommLiveCodingApp::prepare)\n\n<commit_msg>shader and fbo preview drag n drop reuse fbo<commit_after>#include \"VideodrommLiveCodingApp.h\"\n\nvoid VideodrommLiveCodingApp::prepare(Settings *settings)\n{\n\tsettings->setWindowSize(640, 480);\n\t\/\/settings->setBorderless();\n\tsettings->setWindowPos(0, 0);\n}\nvoid VideodrommLiveCodingApp::setup()\n{\n\t\/\/ maximize fps\n\tdisableFrameRate();\n\tgl::enableVerticalSync(false);\n\t\/\/ Settings\n\tmVDSettings = VDSettings::create();\n\t\/\/ Session\n\tmVDSession = VDSession::create(mVDSettings);\n\t\/\/ Utils\n\tmVDUtils = VDUtils::create(mVDSettings);\n\t\/\/ Animation\n\tmVDAnimation = VDAnimation::create(mVDSettings, mVDSession);\n\t\/\/ Message router\n\tmVDRouter = VDRouter::create(mVDSettings, mVDAnimation, mVDSession);\n\t\/\/ Mix\n\tmMixesFilepath = getAssetPath(\"\") \/ mVDSettings->mAssetsPath \/ \"mixes.xml\";\n\tif (fs::exists(mMixesFilepath)) {\n\t\t\/\/ load textures from file if one exists\n\t\tmMixes = VDMix::readSettings(mVDSettings, mVDAnimation, mVDRouter, loadFile(mMixesFilepath));\n\t}\n\telse {\n\t\t\/\/ otherwise create a texture from scratch\n\t\tmMixes.push_back(VDMix::create(mVDSettings, mVDAnimation, mVDRouter));\n\t}\n\tmVDAnimation->tapTempo();\n\n\tmVDUtils->getWindowsResolution();\n\tsetWindowSize(mVDSettings->mRenderWidth, mVDSettings->mRenderHeight);\n\n\tmVDSettings->iResolution.x = mVDSettings->mRenderWidth;\n\tmVDSettings->iResolution.y = mVDSettings->mRenderHeight;\n\t\/\/ UI\n\tmVDUI = VDUI::create(mVDSettings, mMixes[0], mVDRouter, mVDAnimation, mVDSession);\n\n\tmouseGlobal = false;\n\n\tstatic float f = 0.0f;\n\t\/\/ mouse cursor and UI\n\tsetUIVisibility(mVDSettings->mCursorVisible);\n\t\/\/ windows\n\tmIsShutDown = false;\n\tmIsResizing = true;\n\tmMainWindow = getWindow();\n\tmMainWindow->getSignalDraw().connect(std::bind(&VideodrommLiveCodingApp::drawMain, this));\n\tmMainWindow->getSignalResize().connect(std::bind(&VideodrommLiveCodingApp::resizeWindow, this));\n\t\/*if (mVDSettings->mStandalone) {\n\t\tcreateRenderWindow();\n\t\tsetWindowSize(mVDSettings->mRenderWidth, mVDSettings->mRenderHeight);\n\t\t}\n\t\telse {\n\n\t\t}*\/\n}\nvoid VideodrommLiveCodingApp::createRenderWindow()\n{\n\tdeleteRenderWindows();\n\tmVDUtils->getWindowsResolution();\n\n\tmVDSettings->iResolution.x = mVDSettings->mRenderWidth;\n\tmVDSettings->iResolution.y = mVDSettings->mRenderHeight;\n\n\tCI_LOG_V(\"createRenderWindow, resolution:\" + toString(mVDSettings->iResolution.x) + \"x\" + toString(mVDSettings->iResolution.y));\n\n\tstring windowName = \"render\";\n\tmRenderWindow = createWindow(Window::Format().size(mVDSettings->iResolution.x, mVDSettings->iResolution.y));\n\n\t\/\/ create instance of the window and store in vector\n\tallRenderWindows.push_back(mRenderWindow);\n\n\tmRenderWindow->setBorderless();\n\tmRenderWindow->getSignalDraw().connect(std::bind(&VideodrommLiveCodingApp::drawRender, this));\n\tmVDSettings->mRenderPosXY = ivec2(mVDSettings->mRenderX, mVDSettings->mRenderY);\/\/20141214 was 0\n\tmRenderWindow->setPos(50, 50);\n\tmRenderWindowTimer = 0.0f;\n\ttimeline().apply(&mRenderWindowTimer, 1.0f, 2.0f).finishFn([&]{ positionRenderWindow(); });\n}\nvoid VideodrommLiveCodingApp::positionRenderWindow()\n{\n\tmRenderWindow->setPos(mVDSettings->mRenderX, mVDSettings->mRenderY);\n}\nvoid VideodrommLiveCodingApp::deleteRenderWindows()\n{\n#if defined( CINDER_MSW )\n\tfor (auto wRef : allRenderWindows) DestroyWindow((HWND)mRenderWindow->getNative());\n#endif\n\tallRenderWindows.clear();\n}\nvoid VideodrommLiveCodingApp::setUIVisibility(bool visible)\n{\n\tif (visible)\n\t{\n\t\tshowCursor();\n\t}\n\telse\n\t{\n\t\thideCursor();\n\t}\n}\nvoid VideodrommLiveCodingApp::update()\n{\n\tmVDSettings->iFps = getAverageFps();\n\tmVDSettings->sFps = toString(floor(mVDSettings->iFps));\n\tmMixes[0]->update();\n\tmVDAnimation->update();\n\tmVDRouter->update();\n\n\tupdateWindowTitle();\n}\nvoid VideodrommLiveCodingApp::updateWindowTitle()\n{\n\t\/\/mMainWindow->setTitle(mVDSettings->sFps + \" fps Live Coding\");\n}\nvoid VideodrommLiveCodingApp::cleanup()\n{\n\tif (!mIsShutDown)\n\t{\n\t\tmIsShutDown = true;\n\t\tCI_LOG_V(\"shutdown\");\n\t\tui::disconnectWindow(getWindow());\n\t\tui::Shutdown();\n\t\t\/\/ save settings\n\t\tmVDSettings->save();\n\t\tmVDSession->save();\n\t\tdeleteRenderWindows();\n\t\tmVDRouter->wsDisconnect();\n\t\tquit();\n\t}\n}\nvoid VideodrommLiveCodingApp::mouseDown(MouseEvent event)\n{\n\n}\nvoid VideodrommLiveCodingApp::keyDown(KeyEvent event)\n{\n\n\tif (!mVDAnimation->handleKeyDown(event)) {\n\t\t\/\/ Animation did not handle the key, so handle it here\n\t\tswitch (event.getCode()) {\n\t\tcase KeyEvent::KEY_ESCAPE:\n\t\t\t\/\/ quit the application\n\t\t\tquit();\n\t\t\tbreak;\n\t\tcase KeyEvent::KEY_l:\n\t\t\tmVDAnimation->load();\n\t\t\tbreak;\n\t\tcase KeyEvent::KEY_h:\n\t\t\t\/\/ mouse cursor\n\t\t\tmVDSettings->mCursorVisible = !mVDSettings->mCursorVisible;\n\t\t\tsetUIVisibility(mVDSettings->mCursorVisible);\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid VideodrommLiveCodingApp::keyUp(KeyEvent event)\n{\n\tif (!mVDAnimation->handleKeyUp(event)) {\n\t\t\/\/ Animation did not handle the key, so handle it here\n\t}\n}\nvoid VideodrommLiveCodingApp::resizeWindow()\n{\n\tmVDUI->resize();\n}\nvoid VideodrommLiveCodingApp::fileDrop(FileDropEvent event)\n{\n\tint index = (int)(event.getX() \/ (mVDSettings->uiLargePreviewW + mVDSettings->uiMargin));\n\tint y = (int)(event.getY());\n\tif (index < 2 || y < mVDSettings->uiYPosRow3 || y > mVDSettings->uiYPosRow3 + mVDSettings->uiPreviewH) index = 0;\n\tci::fs::path mPath = event.getFile(event.getNumFiles() - 1);\n\tstring mFile = mPath.string();\n\tif (mMixes[0]->loadFileFromAbsolutePath(mFile, index) > -1) {\n\t\t\/\/ load success\n\t\t\/\/ reset zoom\n\t\tmVDAnimation->controlValues[22] = 1.0f;\n\t}\n}\n\nvoid VideodrommLiveCodingApp::drawRender()\n{\n\tgl::clear(Color::black());\n\t\/\/gl::setMatricesWindow(toPixels(getWindowSize()));\n\tgl::setMatricesWindow(mVDSettings->mRenderWidth, mVDSettings->mRenderHeight, false);\n\t\/\/ live coding fbo gl::draw(mFbo->getColorTexture(), getWindowBounds());\n\tgl::draw(mMixes[0]->getMixTexture(), getWindowBounds());\n}\n\nvoid VideodrommLiveCodingApp::drawMain()\n{\n\tmMainWindow->setTitle(mVDSettings->sFps + \" fps Live Coding\");\n\n\tgl::clear(Color::black());\n\t\/\/\tgl::setMatricesWindow(toPixels(getWindowSize()));\n\tgl::setMatricesWindow(mVDSettings->mRenderWidth, mVDSettings->mRenderHeight, false);\n\tgl::draw(mMixes[0]->getMixTexture(), getWindowBounds());\n\n\t\/\/ imgui\n\tif (!mVDSettings->mCursorVisible) return;\n\n\tmVDUI->Run(\"UI\", (int)getAverageFps());\n\tif (mVDUI->isReady()) {\n\t}\n\n}\n\nCINDER_APP(VideodrommLiveCodingApp, RendererGl, &VideodrommLiveCodingApp::prepare)\n\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 \"command.h\"\n#include \"math\/math.h\"\n#include \"image.h\"\n#include \"dwi\/tractography\/file.h\"\n#include \"dwi\/tractography\/properties.h\"\n#include \"dwi\/tractography\/resampling\/arc.h\"\n#include \"dwi\/tractography\/resampling\/downsampler.h\"\n#include \"dwi\/tractography\/resampling\/endpoints.h\"\n#include \"dwi\/tractography\/resampling\/fixed_num_points.h\"\n#include \"dwi\/tractography\/resampling\/fixed_step_size.h\"\n#include \"dwi\/tractography\/resampling\/resampling.h\"\n#include \"dwi\/tractography\/resampling\/upsampler.h\"\n\n\n\n\nusing namespace MR;\nusing namespace App;\nusing namespace DWI::Tractography;\n\n\nvoid usage ()\n{\n\n  AUTHOR = \"Robert E. Smith (robert.smith@florey.edu.au) and J-Donald Tournier (jdtournier@gmail.com)\";\n\n  DESCRIPTION\n  + \"Resample each streamline to a new set of vertices. \"\n  + \"This may be either increasing or decreasing the number of samples along \"\n    \"each streamline, or changing the positions of the samples according to \"\n    \"some specified trajectory.\";\n\n  ARGUMENTS\n  + Argument (\"in_tracks\",  \"the input track file\").type_tracks_in()\n  + Argument (\"out_tracks\", \"the output resampled tracks\").type_tracks_out();\n\n  OPTIONS\n    + Resampling::ResampleOption;\n\n    \/\/ TODO Resample according to an exemplar streamline\n}\n\n\n\ntypedef float value_type;\n\nvoid run ()\n{\n  Properties properties;\n  Reader<value_type> read (argument[0], properties);\n\n  Resampling::Base* resampler = Resampling::get_resampler();\n\n  float old_step_size = NaN;\n  try {\n    Properties::const_iterator i = properties.find (\"output_step_size\");\n    if (i == properties.end()) {\n      i = properties.find (\"step_size\");\n      if (i != properties.end())\n        old_step_size = to<float> (i->second);\n    } else {\n      old_step_size = to<float> (i->second);\n    }\n  } catch (...) {\n    DEBUG (\"Unable to read input track file step size\");\n  }\n\n  if (std::isfinite (old_step_size)) {\n    float new_step_size = NaN;\n    if (typeid (*resampler) == typeid (Resampling::Downsampler))\n      new_step_size = old_step_size * dynamic_cast<Resampling::Downsampler*> (resampler)->get_ratio();\n    if (typeid (*resampler) == typeid (Resampling::FixedStepSize))\n      new_step_size = dynamic_cast<Resampling::FixedStepSize*> (resampler)->get_step_size();\n    if (typeid (*resampler) == typeid (Resampling::Upsampler))\n      new_step_size = old_step_size \/ dynamic_cast<Resampling::Upsampler*> (resampler)->get_ratio();\n    properties[\"output_step_size\"] = std::isfinite (new_step_size) ? str(new_step_size) : \"variable\";\n  }\n\n  auto downsample = properties.find (\"downsample_factor\");\n  if (downsample != properties.end())\n    properties.erase (downsample);\n\n  DWI::Tractography::Writer<value_type> writer (argument[1], properties);\n\n  size_t skipped = 0, count = 0;\n  auto progress_message = [&](){ return \"sampling streamlines (count: \" + str(count) + \", skipped: \" + str(skipped) + \")\"; };\n  ProgressBar progress (\"sampling streamlines\");\n\n  \/\/ Single-threaded in order to retain order of streamlines in the output file\n  DWI::Tractography::Streamline<value_type> tck;\n  while (read (tck)) {\n    if (!resampler->limits (tck)) { skipped++; continue; }\n    (*resampler) (tck);\n    writer (tck);\n    ++count;\n    progress.update (progress_message);\n  }\n  progress.set_text (progress_message());\n\n}\n\n<commit_msg>tckresample: Write \"output_step_size\" field with -step_size 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 \"command.h\"\n#include \"math\/math.h\"\n#include \"image.h\"\n#include \"dwi\/tractography\/file.h\"\n#include \"dwi\/tractography\/properties.h\"\n#include \"dwi\/tractography\/resampling\/arc.h\"\n#include \"dwi\/tractography\/resampling\/downsampler.h\"\n#include \"dwi\/tractography\/resampling\/endpoints.h\"\n#include \"dwi\/tractography\/resampling\/fixed_num_points.h\"\n#include \"dwi\/tractography\/resampling\/fixed_step_size.h\"\n#include \"dwi\/tractography\/resampling\/resampling.h\"\n#include \"dwi\/tractography\/resampling\/upsampler.h\"\n\n\n\n\nusing namespace MR;\nusing namespace App;\nusing namespace DWI::Tractography;\n\n\nvoid usage ()\n{\n\n  AUTHOR = \"Robert E. Smith (robert.smith@florey.edu.au) and J-Donald Tournier (jdtournier@gmail.com)\";\n\n  DESCRIPTION\n  + \"Resample each streamline to a new set of vertices. \"\n  + \"This may be either increasing or decreasing the number of samples along \"\n    \"each streamline, or changing the positions of the samples according to \"\n    \"some specified trajectory.\";\n\n  ARGUMENTS\n  + Argument (\"in_tracks\",  \"the input track file\").type_tracks_in()\n  + Argument (\"out_tracks\", \"the output resampled tracks\").type_tracks_out();\n\n  OPTIONS\n    + Resampling::ResampleOption;\n\n    \/\/ TODO Resample according to an exemplar streamline\n}\n\n\n\ntypedef float value_type;\n\nvoid run ()\n{\n  Properties properties;\n  Reader<value_type> read (argument[0], properties);\n\n  Resampling::Base* resampler = Resampling::get_resampler();\n\n  float old_step_size = NaN;\n  try {\n    Properties::const_iterator i = properties.find (\"output_step_size\");\n    if (i == properties.end()) {\n      i = properties.find (\"step_size\");\n      if (i != properties.end())\n        old_step_size = to<float> (i->second);\n    } else {\n      old_step_size = to<float> (i->second);\n    }\n  } catch (...) {\n    DEBUG (\"Unable to read input track file step size\");\n  }\n\n  float new_step_size = NaN;\n  if (typeid (*resampler) == typeid (Resampling::FixedStepSize)) {\n    new_step_size = dynamic_cast<Resampling::FixedStepSize*> (resampler)->get_step_size();\n  } else if (std::isfinite (old_step_size)) {\n    if (typeid (*resampler) == typeid (Resampling::Downsampler))\n      new_step_size = old_step_size * dynamic_cast<Resampling::Downsampler*> (resampler)->get_ratio();\n    if (typeid (*resampler) == typeid (Resampling::Upsampler))\n      new_step_size = old_step_size \/ dynamic_cast<Resampling::Upsampler*> (resampler)->get_ratio();\n  }\n  properties[\"output_step_size\"] = std::isfinite (new_step_size) ? str(new_step_size) : \"variable\";\n\n  auto downsample = properties.find (\"downsample_factor\");\n  if (downsample != properties.end())\n    properties.erase (downsample);\n\n  DWI::Tractography::Writer<value_type> writer (argument[1], properties);\n\n  size_t skipped = 0, count = 0;\n  auto progress_message = [&](){ return \"sampling streamlines (count: \" + str(count) + \", skipped: \" + str(skipped) + \")\"; };\n  ProgressBar progress (\"sampling streamlines\");\n\n  \/\/ Single-threaded in order to retain order of streamlines in the output file\n  DWI::Tractography::Streamline<value_type> tck;\n  while (read (tck)) {\n    if (!resampler->limits (tck)) { skipped++; continue; }\n    (*resampler) (tck);\n    writer (tck);\n    ++count;\n    progress.update (progress_message);\n  }\n  progress.set_text (progress_message());\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ReverseLinkedList.hpp\"\n\nListNode *ReverseLinkedList::reverseList(ListNode *head) {\n    if (head == nullptr)\n        return head;\n\n    ListNode *prev = nullptr;\n    ListNode *now = head;\n    ListNode *next = now->next;\n\n    while (next != nullptr) {\n        now->next = prev;\n        prev = now;\n        now = next;\n        next = now->next;\n    }\n\n    now->next = prev;\n    return now;\n}\n<commit_msg>Refine Problem 206. Reverse Linked List<commit_after>#include \"ReverseLinkedList.hpp\"\n\nListNode *ReverseLinkedList::reverseList(ListNode *head) {\n    ListNode *tail = head;\n    while (tail && tail->next)\n        tail = tail->next;\n\n    if (head == tail) return head;\n\n    ListNode *a = head;\n    ListNode *b = a->next;\n    while (a != tail) {\n        ListNode *t = b->next;\n        b->next = a;\n        a = b;\n        b = t;\n    }\n    head->next = nullptr;\n\n    return tail;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <vector>\n#include <endian.h>\n\n#define LOGLEVEL VERBOSE\n\n#include \"utils\/logging.h\"\n\/\/#include \"nmranet\/GlobalEventHandler.hxx\"\n#include \"nmranet\/NMRAnetEventRegistry.hxx\"\n\/\/#include \"if\/nmranet_if.h\"\n#include \"core\/nmranet_event.h\"\n#include \"nmranet\/EventHandlerTemplates.hxx\"\n\n\/\/ Abstract class for representing iteration through a container for event\n\/\/ handlers.\nclass EventIterator : public ProxyNotifiable {\n public:\n  \/\/! Creates an EventIterator.\n  \/\/\n  \/\/! @param parent is a Notifiable. Any notifications coming into the\n  \/\/! Notifiables created by NewCallback will be forwarded to this callback.\n  EventIterator()\n      : event_(nullptr), done_(nullptr) {}\n\n  \/\/! Steps the iteration.\n  \/\/\n  \/\/! @returns the next entry or NULL if the iteration is done.\n  \/\/\n  \/\/! May be called many times after the iteratin is ended and should\n  \/\/! consistently return NULL.\n  virtual NMRAnetEventHandler* NextEntry() = 0;\n\n  \/\/! Sets up variables used during iteration.\n  \/\/\n  \/\/! @param event is the EventReport that will be used for this iteration.\n  \/\/\n  \/\/! @param done is the Notifiable that shall be called when the iteration is\n  \/\/! completed.\n  void InitIterator(EventReport* event, ::Notifiable* done) {\n    HASSERT(event_ == nullptr);\n    HASSERT(done_ == nullptr);\n    event_ = event;\n    done_ = done;\n  }\n\n  \/\/! Resets iteration variables.\n  void ClearIteration() {\n    event_ = nullptr;\n    done_ = nullptr;\n  }\n\n  \/\/! @returns the EventReport structure used for this iteration.\n  EventReport* event() { return event_; }\n\n  \/\/! @returns the callback to be called when the iteration is completed.\n  ::Notifiable* done() { return done_; }\n\n private:\n  \/\/ Stores iteration arguments.\n  EventReport* event_;\n  \/\/ Stores the iteration completion callback.\n  ::Notifiable* done_;\n  \/\/ Proxies incoming notifications to this parent.\n  ::Notifiable* parent_;\n  \/\/ When there is an incoming notification, this is set to true.\n  bool was_notified_;\n};\n\n\/\/! An implementation of the EventIterator abstract class that iterates through\n\/\/! an STL container's range by the begin-end iterators.\ntemplate <class IT>\nclass StlIterator : public EventIterator {\n public:\n  StlIterator() {}\n\n  \/\/! Initializes the iteration with begin-end iterator pair.\n  void Set(IT begin, IT end) {\n    it_ = begin;\n    end_ = end;\n  }\n\n  \/\/! Returns the next iterated entry.\n  virtual NMRAnetEventHandler* NextEntry() {\n    if (it_ == end_)\n      return NULL;\n    else\n      return *it_++;\n  }\n\n private:\n  \/\/! The current iterator.\n  IT it_;\n  \/\/! The end of the iteration.\n  IT end_;\n};\n\n\n\/**\n *  This control flow performs two iterations over event handlers in\n *  parallel. There isa high-priority iteration for regular incoming event\n *  calls, and there is a low-priority iteration for global identify\n *  calls. While there is any high-priority iteration, the low-priority\n *  iteration is stopped.\n * \n *  LOCKING: \n * \n *  At any point in time there can be only one EventHandler child called. This\n *  is enforced by locking the event_handler_mutex when a child is\n *  called. All our incoming calls are also with this lock held.\n * \n *  The high-priority iteration progresses without ever releasing the lock.\n *\n *  The low-priority iteration releases the mutex after every entry, and then\n *  immediately tries to reacquire it (thereby yielding to the back of the\n *  mutex's queue). This means that between any two children being called on\n *  the low-pri iteration and entire high-pri iteration will complete.\n *\n *\/\nclass DualIteratorFlow : public ControlFlow, public ProxyEventHandler {\n public:\n  DualIteratorFlow(Executor* executor,\n                   EventIterator* standard_iterator,\n                   EventIterator* global_iterator)\n      : ControlFlow(executor, NULL),\n        standard_iterator_(standard_iterator),\n        global_iterator_(global_iterator) {\n    StartFlowAt(ST(StateInIteration));\n  }\n\n  \/\/! Implementations have to override this to re-set the standard_iterator\n  \/\/! from the information in standard_iterator->event().\n  virtual void InitStandardIterator() = 0;\n\n  \/\/! Handler function for high-priority event calls. Starts a\n  \/\/! StandardIterator.\n  \/\/\n  \/\/! This function is called (by the ProxyEventHandler) for any event handler\n  \/\/! functions we didn't override explicitly, that is, everything except\n  \/\/! Identify Global.\n  virtual void HandlerFn(EventHandlerFunction fn,\n                         EventReport* event,\n                         Notifiable* done) {\n    LOG(VERBOSE, \"Dual::Handler, event %016llx\", event->event);\n    event_handler_mutex.AssertLocked();\n    proxy_fn_ = fn;\n    standard_iterator_->InitIterator(event, done);\n    InitStandardIterator();\n    this->Notify();\n  }\n\n  \/\/! Implementations have to override this to re-set the global_iterator\n  \/\/! based on the information in global_iterator->event().\n  virtual void InitGlobalIterator() = 0;\n\n  virtual void HandleIdentifyGlobal(EventReport* event, Notifiable* done) {\n    LOG(VERBOSE, \"Dual::IdentifyGlobal\");\n    event_handler_mutex.AssertLocked();\n    \/\/ We immediately release the global iterator mutex and will acquire it\n    \/\/ inside when we try to call children.\n    event_handler_mutex.Unlock();\n    global_iterator_->InitIterator(event, done);\n    InitGlobalIterator();\n    this->Notify();\n  }\n\n protected:\n  ControlFlowAction StateInIteration() {\n    \/\/ We first try a standard iteration.\n    if (standard_iterator_->done())\n      return CallImmediately(ST(TryStandardIteration));\n    \/\/ Then a global iteration.\n    if (global_iterator_->done())\n      return CallImmediately(ST(GetGlobalIterationLock));\n    \/\/ Give up and wait for incoming messages.\n    return WaitForNotification();\n  }\n\n  ControlFlowAction TryStandardIteration() {\n    NMRAnetEventHandler* handler = standard_iterator_->NextEntry();\n    if (!handler) {\n      \/\/ Iteration done.\n      LOG(VERBOSE, \"Standard iteration done\");\n      Notifiable* d = standard_iterator_->done();\n      HASSERT(d);\n      standard_iterator_->ClearIteration();\n      d->Notify();\n      return YieldAndCall(ST(StateInIteration));\n    }\n    (handler->*proxy_fn_)(standard_iterator_->event(),\n                          standard_iterator_->NewCallback(this));\n    return CallImmediately(ST(WaitForStandardReturn));\n  }\n\n  ControlFlowAction WaitForStandardReturn() {\n    LOG(VERBOSE, \"Standard entry return\");\n    if (!standard_iterator_->HasBeenNotified())\n      return WaitForNotification();\n    return CallImmediately(ST(TryStandardIteration));\n  }\n\n  ControlFlowAction GetGlobalIterationLock() {\n    return Allocate(&event_handler_mutex, ST(CallGlobalIteration));\n  }\n\n  ControlFlowAction CallGlobalIteration() {\n    NMRAnetEventHandler* handler = global_iterator_->NextEntry();\n    if (!handler) {\n      \/\/ Iteration done. We hand back the iterator lock.\n      Notifiable* d = global_iterator_->done();\n      HASSERT(d);\n      global_iterator_->ClearIteration();\n      d->Notify();\n      global_iterator_->done()->Notify();\n      return YieldAndCall(ST(StateInIteration));\n    }\n    handler->HandleIdentifyGlobal(global_iterator_->event(),\n                                  global_iterator_->NewCallback(this));\n    return CallImmediately(ST(WaitForGlobalReturn));\n  }\n\n  ControlFlowAction WaitForGlobalReturn() {\n    if (!global_iterator_->HasBeenNotified())\n      return WaitForNotification();\n    \/\/ Releases the iteration lock and yields to other control flows that might\n    \/\/ want it.\n    event_handler_mutex.Unlock();\n    return YieldAndCall(ST(StateInIteration));\n  }\n\n private:\n  \/\/! Holds which event handler function the standard iteration should call.\n  EventHandlerFunction proxy_fn_;\n  EventIterator* standard_iterator_;\n  EventIterator* global_iterator_;\n};\n\nclass VectorEventHandlers : public DualIteratorFlow, public NMRAnetEventRegistry {\n public:\n  VectorEventHandlers(Executor* executor)\n      : DualIteratorFlow(executor,\n                         &standard_iterator_impl_,\n                         &global_iterator_impl_) {}\n\n  virtual void InitStandardIterator() {\n    standard_iterator_impl_.Set(handlers_.begin(), handlers_.end());\n  }\n\n  virtual void InitGlobalIterator() {\n    global_iterator_impl_.Set(handlers_.begin(), handlers_.end());\n  }\n\n  virtual void RegisterHandler(NMRAnetEventHandler* handler, EventId event, unsigned mask) {\n    \/\/ @TODO(balazs.racz): need some kind of locking here.\n    handlers_.push_back(handler);\n  }\n  virtual void UnregisterHandler(NMRAnetEventHandler* handler, EventId event, unsigned mask) {\n    \/\/ @TODO(balazs.racz): need some kind of locking here.\n    handlers_.erase(std::remove(handlers_.begin(), handlers_.end(), handler));\n  }\n  \n  virtual NMRAnetEventHandler* EventHandler() {\n    return this;\n  }\n\n private:\n  typedef std::vector<NMRAnetEventHandler*> HandlersList;\n  HandlersList handlers_;\n  StlIterator<HandlersList::iterator> standard_iterator_impl_;\n  StlIterator<HandlersList::iterator> global_iterator_impl_;\n};\n<commit_msg>Makes StlIterator also work with stl pair-second containers.<commit_after>#include <algorithm>\n#include <vector>\n#include <endian.h>\n\n#define LOGLEVEL VERBOSE\n\n#include \"executor\/control_flow.hxx\"\n#include \"utils\/logging.h\"\n\/\/#include \"nmranet\/GlobalEventHandler.hxx\"\n#include \"nmranet\/NMRAnetEventRegistry.hxx\"\n\/\/#include \"if\/nmranet_if.h\"\n#include \"core\/nmranet_event.h\"\n#include \"nmranet\/EventHandlerTemplates.hxx\"\n\n\/\/ Abstract class for representing iteration through a container for event\n\/\/ handlers.\nclass EventIterator : public ProxyNotifiable {\n public:\n  \/\/! Creates an EventIterator.\n  \/\/\n  \/\/! @param parent is a Notifiable. Any notifications coming into the\n  \/\/! Notifiables created by NewCallback will be forwarded to this callback.\n  EventIterator()\n      : event_(nullptr), done_(nullptr) {}\n\n  \/\/! Steps the iteration.\n  \/\/\n  \/\/! @returns the next entry or NULL if the iteration is done.\n  \/\/\n  \/\/! May be called many times after the iteratin is ended and should\n  \/\/! consistently return NULL.\n  virtual NMRAnetEventHandler* NextEntry() = 0;\n\n  \/\/! Sets up variables used during iteration.\n  \/\/\n  \/\/! @param event is the EventReport that will be used for this iteration.\n  \/\/\n  \/\/! @param done is the Notifiable that shall be called when the iteration is\n  \/\/! completed.\n  void InitIterator(EventReport* event, ::Notifiable* done) {\n    HASSERT(event_ == nullptr);\n    HASSERT(done_ == nullptr);\n    event_ = event;\n    done_ = done;\n  }\n\n  \/\/! Resets iteration variables.\n  void ClearIteration() {\n    event_ = nullptr;\n    done_ = nullptr;\n  }\n\n  \/\/! @returns the EventReport structure used for this iteration.\n  EventReport* event() { return event_; }\n\n  \/\/! @returns the callback to be called when the iteration is completed.\n  ::Notifiable* done() { return done_; }\n\n private:\n  \/\/ Stores iteration arguments.\n  EventReport* event_;\n  \/\/ Stores the iteration completion callback.\n  ::Notifiable* done_;\n  \/\/ Proxies incoming notifications to this parent.\n  ::Notifiable* parent_;\n  \/\/ When there is an incoming notification, this is set to true.\n  bool was_notified_;\n};\n\n\/\/! An implementation of the EventIterator abstract class that iterates through\n\/\/! an STL container's range by the begin-end iterators.\ntemplate <class IT>\nclass StlIterator : public EventIterator {\n public:\n  StlIterator() {}\n\n  \/\/! Initializes the iteration with begin-end iterator pair.\n  void Set(IT begin, IT end) {\n    it_ = begin;\n    end_ = end;\n  }\n\n protected:\n  \/\/! The current iterator.\n  IT it_;\n  \/\/! The end of the iteration.\n  IT end_;\n};\n\ntemplate<class IT>\nclass StraightStlIterator : public StlIterator<IT> {\n public:\n  \/\/! Returns the next iterated entry.\n  virtual NMRAnetEventHandler* NextEntry() {\n    if (this->it_ == this->end_)\n      return NULL;\n    else\n      return *(this->it_)++;\n  }\n};\n\n\/**\n *  This control flow performs two iterations over event handlers in\n *  parallel. There isa high-priority iteration for regular incoming event\n *  calls, and there is a low-priority iteration for global identify\n *  calls. While there is any high-priority iteration, the low-priority\n *  iteration is stopped.\n * \n *  LOCKING: \n * \n *  At any point in time there can be only one EventHandler child called. This\n *  is enforced by locking the event_handler_mutex when a child is\n *  called. All our incoming calls are also with this lock held.\n * \n *  The high-priority iteration progresses without ever releasing the lock.\n *\n *  The low-priority iteration releases the mutex after every entry, and then\n *  immediately tries to reacquire it (thereby yielding to the back of the\n *  mutex's queue). This means that between any two children being called on\n *  the low-pri iteration and entire high-pri iteration will complete.\n *\n *\/\nclass DualIteratorFlow : public ControlFlow, public ProxyEventHandler {\n public:\n  DualIteratorFlow(Executor* executor,\n                   EventIterator* standard_iterator,\n                   EventIterator* global_iterator)\n      : ControlFlow(executor, NULL),\n        standard_iterator_(standard_iterator),\n        global_iterator_(global_iterator) {\n    StartFlowAt(ST(StateInIteration));\n  }\n\n  \/\/! Implementations have to override this to re-set the standard_iterator\n  \/\/! from the information in standard_iterator->event().\n  virtual void InitStandardIterator() = 0;\n\n  \/\/! Handler function for high-priority event calls. Starts a\n  \/\/! StandardIterator.\n  \/\/\n  \/\/! This function is called (by the ProxyEventHandler) for any event handler\n  \/\/! functions we didn't override explicitly, that is, everything except\n  \/\/! Identify Global.\n  virtual void HandlerFn(EventHandlerFunction fn,\n                         EventReport* event,\n                         Notifiable* done) {\n    LOG(VERBOSE, \"Dual::Handler, event %016llx\", event->event);\n    event_handler_mutex.AssertLocked();\n    proxy_fn_ = fn;\n    standard_iterator_->InitIterator(event, done);\n    InitStandardIterator();\n    this->Notify();\n  }\n\n  \/\/! Implementations have to override this to re-set the global_iterator\n  \/\/! based on the information in global_iterator->event().\n  virtual void InitGlobalIterator() = 0;\n\n  virtual void HandleIdentifyGlobal(EventReport* event, Notifiable* done) {\n    LOG(VERBOSE, \"Dual::IdentifyGlobal\");\n    event_handler_mutex.AssertLocked();\n    \/\/ We immediately release the global iterator mutex and will acquire it\n    \/\/ inside when we try to call children.\n    event_handler_mutex.Unlock();\n    global_iterator_->InitIterator(event, done);\n    InitGlobalIterator();\n    this->Notify();\n  }\n\n protected:\n  ControlFlowAction StateInIteration() {\n    \/\/ We first try a standard iteration.\n    if (standard_iterator_->done())\n      return CallImmediately(ST(TryStandardIteration));\n    \/\/ Then a global iteration.\n    if (global_iterator_->done())\n      return CallImmediately(ST(GetGlobalIterationLock));\n    \/\/ Give up and wait for incoming messages.\n    return WaitForNotification();\n  }\n\n  ControlFlowAction TryStandardIteration() {\n    NMRAnetEventHandler* handler = standard_iterator_->NextEntry();\n    if (!handler) {\n      \/\/ Iteration done.\n      LOG(VERBOSE, \"Standard iteration done\");\n      Notifiable* d = standard_iterator_->done();\n      HASSERT(d);\n      standard_iterator_->ClearIteration();\n      d->Notify();\n      return YieldAndCall(ST(StateInIteration));\n    }\n    (handler->*proxy_fn_)(standard_iterator_->event(),\n                          standard_iterator_->NewCallback(this));\n    return CallImmediately(ST(WaitForStandardReturn));\n  }\n\n  ControlFlowAction WaitForStandardReturn() {\n    LOG(VERBOSE, \"Standard entry return\");\n    if (!standard_iterator_->HasBeenNotified())\n      return WaitForNotification();\n    return CallImmediately(ST(TryStandardIteration));\n  }\n\n  ControlFlowAction GetGlobalIterationLock() {\n    return Allocate(&event_handler_mutex, ST(CallGlobalIteration));\n  }\n\n  ControlFlowAction CallGlobalIteration() {\n    NMRAnetEventHandler* handler = global_iterator_->NextEntry();\n    if (!handler) {\n      \/\/ Iteration done. We hand back the iterator lock.\n      Notifiable* d = global_iterator_->done();\n      HASSERT(d);\n      global_iterator_->ClearIteration();\n      d->Notify();\n      global_iterator_->done()->Notify();\n      return YieldAndCall(ST(StateInIteration));\n    }\n    handler->HandleIdentifyGlobal(global_iterator_->event(),\n                                  global_iterator_->NewCallback(this));\n    return CallImmediately(ST(WaitForGlobalReturn));\n  }\n\n  ControlFlowAction WaitForGlobalReturn() {\n    if (!global_iterator_->HasBeenNotified())\n      return WaitForNotification();\n    \/\/ Releases the iteration lock and yields to other control flows that might\n    \/\/ want it.\n    event_handler_mutex.Unlock();\n    return YieldAndCall(ST(StateInIteration));\n  }\n\n private:\n  \/\/! Holds which event handler function the standard iteration should call.\n  EventHandlerFunction proxy_fn_;\n  EventIterator* standard_iterator_;\n  EventIterator* global_iterator_;\n};\n\nclass VectorEventHandlers : public DualIteratorFlow, public NMRAnetEventRegistry {\n public:\n  VectorEventHandlers(Executor* executor)\n      : DualIteratorFlow(executor,\n                         &standard_iterator_impl_,\n                         &global_iterator_impl_) {}\n\n  virtual void InitStandardIterator() {\n    standard_iterator_impl_.Set(handlers_.begin(), handlers_.end());\n  }\n\n  virtual void InitGlobalIterator() {\n    global_iterator_impl_.Set(handlers_.begin(), handlers_.end());\n  }\n\n  virtual void RegisterHandler(NMRAnetEventHandler* handler, EventId event, unsigned mask) {\n    \/\/ @TODO(balazs.racz): need some kind of locking here.\n    handlers_.push_back(handler);\n  }\n  virtual void UnregisterHandler(NMRAnetEventHandler* handler, EventId event, unsigned mask) {\n    \/\/ @TODO(balazs.racz): need some kind of locking here.\n    handlers_.erase(std::remove(handlers_.begin(), handlers_.end(), handler));\n  }\n  \n  virtual NMRAnetEventHandler* EventHandler() {\n    return this;\n  }\n\n private:\n  typedef std::vector<NMRAnetEventHandler*> HandlersList;\n  HandlersList handlers_;\n  StraightStlIterator<HandlersList::iterator> standard_iterator_impl_;\n  StraightStlIterator<HandlersList::iterator> global_iterator_impl_;\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-2006 Torus Knot Software Ltd\nCopyright (c) 2006 Matthias Fink, netAllied GmbH <matthias.fink@web.de>\t\t\t\t\t\t\t\t\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 \"OgrePolygon.h\"\n#include \"OgreException.h\"\n#include \"OgreVector3.h\"\n\nnamespace Ogre\n{\n\n\t\/\/-----------------------------------------------------------------------\n\tPolygon::Polygon()\n\t: mNormal( Vector3::ZERO )\n\t, mIsNormalSet(false)\n\t{\n\t\t\/\/ reserve space for 6 vertices to reduce allocation cost\n\t\tmVertexList.reserve(6);\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tPolygon::~Polygon()\n\t{\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tPolygon::Polygon( const Polygon& cpy )\n\t{\n\t\tmVertexList = cpy.mVertexList;\n\t\tmNormal = cpy.mNormal;\n\t\tmIsNormalSet = cpy.mIsNormalSet;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::insertVertex(const Vector3& vdata, size_t vertex )\n\t{\n\t\t\/\/ TODO: optional: check planarity\n\t\tOgreAssert(vertex <= getVertexCount(), \"Insert position out of range\" );\n\n\t\tVertexList::iterator it = mVertexList.begin();\n\n\t\tstd::advance(it, vertex);\n\t\tmVertexList.insert(it, vdata);\n\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::insertVertex(const Vector3& vdata)\n\t{\n\t\tmVertexList.push_back(vdata);\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tconst Vector3& Polygon::getVertex( size_t vertex ) const\n\t{\n\t\tOgreAssert(vertex < getVertexCount(), \"Search position out of range\");\n\n\t\treturn mVertexList[vertex];\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::setVertex(const Vector3& vdata, size_t vertex )\n\t{\n\t\t\/\/ TODO: optional: check planarity\n\t\tOgreAssert(vertex < getVertexCount(), \"Search position out of range\" );\n\n\t\t\/\/ set new vertex\n\t\tmVertexList[ vertex ] = vdata;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::removeDuplicates( void )\n\t{\n\t\tfor ( size_t i = 0; i < getVertexCount(); ++i )\n\t\t{\n\t\t\tconst Vector3& a = getVertex( i );\n\t\t\tconst Vector3& b = getVertex( (i + 1)%getVertexCount() );\n\n\t\t\tif (a.positionEquals(b))\n\t\t\t{\n\t\t\t\tdeleteVertex(i);\n\t\t\t\t--i;\n\t\t\t}\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tsize_t Polygon::getVertexCount( void ) const\n\t{\n\t\treturn mVertexList.size();\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tconst Vector3& Polygon::getNormal( void ) const\n\t{\n\t\tOgreAssert( getVertexCount() >= 3, \"Insufficient vertex count!\" );\n\n\t\tupdateNormal();\n\n\t\treturn mNormal;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::updateNormal( void ) const\n\t{\n\t\tOgreAssert( getVertexCount() >= 3, \"Insufficient vertex count!\" );\n\n\t\tif (mIsNormalSet)\n\t\t\treturn;\n\n\t\t\/\/ vertex order is ccw\n\t\tconst Vector3& a = getVertex( 0 );\n\t\tconst Vector3& b = getVertex( 1 );\n\t\tconst Vector3& c = getVertex( 2 );\n\n\t\t\/\/ used method: Newell\n\t\tmNormal.x = 0.5f * ( (a.y - b.y) * (a.z + b.z) +\n\t\t\t\t\t\t\t   (b.y - c.y) * (b.z + c.z) + \n\t\t\t\t\t\t\t   (c.y - a.y) * (c.z + a.z));\n\n\t\tmNormal.y = 0.5f * ( (a.z - b.z) * (a.x + b.x) +\n\t\t\t\t\t\t\t   (b.z - c.z) * (b.x + c.x) + \n\t\t\t\t\t\t\t   (c.z - a.z) * (c.x + a.x));\n\n\t\tmNormal.z = 0.5f * ( (a.x - b.x) * (a.y + b.y) +\n\t\t\t\t\t\t\t   (b.x - c.x) * (b.y + c.y) + \n\t\t\t\t\t\t\t   (c.x - a.x) * (c.y + a.y));\n\n\t\tmNormal.normalise();\n\n\t\tmIsNormalSet = true;\n\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::deleteVertex( size_t vertex )\n\t{\n\t\tOgreAssert( vertex < getVertexCount(), \"Search position out of range\" );\n\n\t\tVertexList::iterator it = mVertexList.begin();\n\t\tstd::advance(it, vertex);\n\n\t\tmVertexList.erase( it );\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::storeEdges( Polygon::EdgeMap *edgeMap ) const\n\t{\n\t\tOgreAssert( edgeMap != NULL, \"EdgeMap ptr is NULL\" );\n\n\t\tsize_t vertexCount = getVertexCount();\n\n\t\tfor ( size_t i = 0; i < vertexCount; ++i )\n\t\t{\n\t\t\tedgeMap->insert( Edge( getVertex( i ), getVertex( ( i + 1 ) % vertexCount ) ) );\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::reset( void )\n\t{\n\t\t\/\/ could use swap() to free memory here, but assume most may be reused so avoid realloc\n\t\tmVertexList.clear();\n\n\t\tmIsNormalSet = false;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tbool Polygon::operator == (const Polygon& rhs) const\n\t{\n\t\tif ( getVertexCount() != rhs.getVertexCount() )\n\t\t\treturn false;\n\n\t\t\/\/ Compare vertices. They may differ in its starting position.\n\t\t\/\/ find start\n\t\tsize_t start;\n\t\tbool foundStart = false;\n\t\tfor (size_t i = 0; i < getVertexCount(); ++i )\n\t\t{\t\n\t\t\tif (getVertex(0).positionEquals(rhs.getVertex(i)))\n\t\t\t{\n\t\t\t\tstart = i;\n\t\t\t\tfoundStart = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (!foundStart)\n\t\t\treturn false;\n\n\t\tfor (size_t i = 0; i < getVertexCount(); ++i )\n\t\t{\n\t\t\tconst Vector3& vA = getVertex( i );\n\t\t\tconst Vector3& vB = rhs.getVertex( ( i + start) % getVertexCount() );\n\n\t\t\tif (!vA.positionEquals(vB))\n\t\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tstd::ostream& operator<< ( std::ostream& strm, const Polygon& poly )\n\t{\n\t\tstrm << \"NUM VERTICES: \" << poly.getVertexCount() << std::endl;\n\n\t\tfor (size_t j = 0; j < poly.getVertexCount(); ++j )\n\t\t{\n\t\t\tstrm << \"VERTEX \" << j << \": \" << poly.getVertex( j ) << std::endl;\n\t\t}\n\n\t\treturn strm;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tbool Polygon::isPointInside(const Vector3& point) const\n\t{\n\t\t\/\/ sum the angles \n\t\tReal anglesum = 0;\n\t\tsize_t n = getVertexCount();\n\t\tfor (size_t i = 0; i < n; i++) \n\t\t{\n\t\t\tconst Vector3& p1 = getVertex(i);\n\t\t\tconst Vector3& p2 = getVertex((i + 1) % n);\n\n\t\t\tVector3 v1 = p1 - point;\n\t\t\tVector3 v2 = p2 - point;\n\n\t\t\tReal len1 = v1.length();\n\t\t\tReal len2 = v2.length();\n\n\t\t\tif (Math::RealEqual(len1 * len2, 0.0f, 1e-6f))\n\t\t\t{\n\t\t\t\t\/\/ We are on a vertex so consider this inside\n\t\t\t\treturn true; \n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tReal costheta = v1.dotProduct(v2) \/ (len1 * len2);\n\t\t\t\tanglesum += acos(costheta);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ result should be 2*PI if point is inside poly\n\t\treturn Math::RealEqual(anglesum, Math::TWO_PI, 1e-6f);\n\n\t}\n}\n<commit_msg>Make the comparisons a little fuzzier<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-2006 Torus Knot Software Ltd\nCopyright (c) 2006 Matthias Fink, netAllied GmbH <matthias.fink@web.de>\t\t\t\t\t\t\t\t\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 \"OgrePolygon.h\"\n#include \"OgreException.h\"\n#include \"OgreVector3.h\"\n\nnamespace Ogre\n{\n\n\t\/\/-----------------------------------------------------------------------\n\tPolygon::Polygon()\n\t: mNormal( Vector3::ZERO )\n\t, mIsNormalSet(false)\n\t{\n\t\t\/\/ reserve space for 6 vertices to reduce allocation cost\n\t\tmVertexList.reserve(6);\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tPolygon::~Polygon()\n\t{\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tPolygon::Polygon( const Polygon& cpy )\n\t{\n\t\tmVertexList = cpy.mVertexList;\n\t\tmNormal = cpy.mNormal;\n\t\tmIsNormalSet = cpy.mIsNormalSet;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::insertVertex(const Vector3& vdata, size_t vertex )\n\t{\n\t\t\/\/ TODO: optional: check planarity\n\t\tOgreAssert(vertex <= getVertexCount(), \"Insert position out of range\" );\n\n\t\tVertexList::iterator it = mVertexList.begin();\n\n\t\tstd::advance(it, vertex);\n\t\tmVertexList.insert(it, vdata);\n\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::insertVertex(const Vector3& vdata)\n\t{\n\t\tmVertexList.push_back(vdata);\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tconst Vector3& Polygon::getVertex( size_t vertex ) const\n\t{\n\t\tOgreAssert(vertex < getVertexCount(), \"Search position out of range\");\n\n\t\treturn mVertexList[vertex];\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::setVertex(const Vector3& vdata, size_t vertex )\n\t{\n\t\t\/\/ TODO: optional: check planarity\n\t\tOgreAssert(vertex < getVertexCount(), \"Search position out of range\" );\n\n\t\t\/\/ set new vertex\n\t\tmVertexList[ vertex ] = vdata;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::removeDuplicates( void )\n\t{\n\t\tfor ( size_t i = 0; i < getVertexCount(); ++i )\n\t\t{\n\t\t\tconst Vector3& a = getVertex( i );\n\t\t\tconst Vector3& b = getVertex( (i + 1)%getVertexCount() );\n\n\t\t\tif (a.positionEquals(b))\n\t\t\t{\n\t\t\t\tdeleteVertex(i);\n\t\t\t\t--i;\n\t\t\t}\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tsize_t Polygon::getVertexCount( void ) const\n\t{\n\t\treturn mVertexList.size();\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tconst Vector3& Polygon::getNormal( void ) const\n\t{\n\t\tOgreAssert( getVertexCount() >= 3, \"Insufficient vertex count!\" );\n\n\t\tupdateNormal();\n\n\t\treturn mNormal;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::updateNormal( void ) const\n\t{\n\t\tOgreAssert( getVertexCount() >= 3, \"Insufficient vertex count!\" );\n\n\t\tif (mIsNormalSet)\n\t\t\treturn;\n\n\t\t\/\/ vertex order is ccw\n\t\tconst Vector3& a = getVertex( 0 );\n\t\tconst Vector3& b = getVertex( 1 );\n\t\tconst Vector3& c = getVertex( 2 );\n\n\t\t\/\/ used method: Newell\n\t\tmNormal.x = 0.5f * ( (a.y - b.y) * (a.z + b.z) +\n\t\t\t\t\t\t\t   (b.y - c.y) * (b.z + c.z) + \n\t\t\t\t\t\t\t   (c.y - a.y) * (c.z + a.z));\n\n\t\tmNormal.y = 0.5f * ( (a.z - b.z) * (a.x + b.x) +\n\t\t\t\t\t\t\t   (b.z - c.z) * (b.x + c.x) + \n\t\t\t\t\t\t\t   (c.z - a.z) * (c.x + a.x));\n\n\t\tmNormal.z = 0.5f * ( (a.x - b.x) * (a.y + b.y) +\n\t\t\t\t\t\t\t   (b.x - c.x) * (b.y + c.y) + \n\t\t\t\t\t\t\t   (c.x - a.x) * (c.y + a.y));\n\n\t\tmNormal.normalise();\n\n\t\tmIsNormalSet = true;\n\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::deleteVertex( size_t vertex )\n\t{\n\t\tOgreAssert( vertex < getVertexCount(), \"Search position out of range\" );\n\n\t\tVertexList::iterator it = mVertexList.begin();\n\t\tstd::advance(it, vertex);\n\n\t\tmVertexList.erase( it );\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::storeEdges( Polygon::EdgeMap *edgeMap ) const\n\t{\n\t\tOgreAssert( edgeMap != NULL, \"EdgeMap ptr is NULL\" );\n\n\t\tsize_t vertexCount = getVertexCount();\n\n\t\tfor ( size_t i = 0; i < vertexCount; ++i )\n\t\t{\n\t\t\tedgeMap->insert( Edge( getVertex( i ), getVertex( ( i + 1 ) % vertexCount ) ) );\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid Polygon::reset( void )\n\t{\n\t\t\/\/ could use swap() to free memory here, but assume most may be reused so avoid realloc\n\t\tmVertexList.clear();\n\n\t\tmIsNormalSet = false;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tbool Polygon::operator == (const Polygon& rhs) const\n\t{\n\t\tif ( getVertexCount() != rhs.getVertexCount() )\n\t\t\treturn false;\n\n\t\t\/\/ Compare vertices. They may differ in its starting position.\n\t\t\/\/ find start\n\t\tsize_t start;\n\t\tbool foundStart = false;\n\t\tfor (size_t i = 0; i < getVertexCount(); ++i )\n\t\t{\t\n\t\t\tif (getVertex(0).positionEquals(rhs.getVertex(i)))\n\t\t\t{\n\t\t\t\tstart = i;\n\t\t\t\tfoundStart = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (!foundStart)\n\t\t\treturn false;\n\n\t\tfor (size_t i = 0; i < getVertexCount(); ++i )\n\t\t{\n\t\t\tconst Vector3& vA = getVertex( i );\n\t\t\tconst Vector3& vB = rhs.getVertex( ( i + start) % getVertexCount() );\n\n\t\t\tif (!vA.positionEquals(vB))\n\t\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tstd::ostream& operator<< ( std::ostream& strm, const Polygon& poly )\n\t{\n\t\tstrm << \"NUM VERTICES: \" << poly.getVertexCount() << std::endl;\n\n\t\tfor (size_t j = 0; j < poly.getVertexCount(); ++j )\n\t\t{\n\t\t\tstrm << \"VERTEX \" << j << \": \" << poly.getVertex( j ) << std::endl;\n\t\t}\n\n\t\treturn strm;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tbool Polygon::isPointInside(const Vector3& point) const\n\t{\n\t\t\/\/ sum the angles \n\t\tReal anglesum = 0;\n\t\tsize_t n = getVertexCount();\n\t\tfor (size_t i = 0; i < n; i++) \n\t\t{\n\t\t\tconst Vector3& p1 = getVertex(i);\n\t\t\tconst Vector3& p2 = getVertex((i + 1) % n);\n\n\t\t\tVector3 v1 = p1 - point;\n\t\t\tVector3 v2 = p2 - point;\n\n\t\t\tReal len1 = v1.length();\n\t\t\tReal len2 = v2.length();\n\n\t\t\tif (Math::RealEqual(len1 * len2, 0.0f, 1e-4f))\n\t\t\t{\n\t\t\t\t\/\/ We are on a vertex so consider this inside\n\t\t\t\treturn true; \n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tReal costheta = v1.dotProduct(v2) \/ (len1 * len2);\n\t\t\t\tanglesum += acos(costheta);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ result should be 2*PI if point is inside poly\n\t\treturn Math::RealEqual(anglesum, Math::TWO_PI, 1e-4f);\n\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.osgeo.org\n *\n * Copyright (C) 2012  Sandro Santilli <strk@kbt.io>\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 * NOTE: this is not in JTS. JTS has a snapround\/GeometryNoder though\n *\n **********************************************************************\/\n\n#include <geos\/noding\/GeometryNoder.h>\n#include <geos\/noding\/SegmentString.h>\n#include <geos\/noding\/NodedSegmentString.h>\n#include <geos\/noding\/OrientedCoordinateArray.h>\n#include <geos\/noding\/Noder.h>\n#include <geos\/geom\/Geometry.h>\n#include <geos\/geom\/PrecisionModel.h>\n#include <geos\/geom\/CoordinateSequence.h>\n#include <geos\/geom\/GeometryFactory.h>\n#include <geos\/geom\/LineString.h>\n\n#include <geos\/noding\/IteratedNoder.h>\n\n#include <geos\/algorithm\/LineIntersector.h>\n#include <geos\/noding\/IntersectionAdder.h>\n#include <geos\/noding\/MCIndexNoder.h>\n\n#include <geos\/noding\/snapround\/SimpleSnapRounder.h>\n#include <geos\/noding\/snapround\/MCIndexSnapRounder.h>\n\n#include <memory> \/\/ for unique_ptr\n#include <iostream>\n\nnamespace geos {\nnamespace noding { \/\/ geos.noding\n\nnamespace {\n\n\/**\n * Add every linear element in a geometry into SegmentString vector\n *\/\nclass SegmentStringExtractor: public geom::GeometryComponentFilter {\npublic:\n    SegmentStringExtractor(SegmentString::NonConstVect& to)\n        : _to(to)\n    {}\n\n    void\n    filter_ro(const geom::Geometry* g) override\n    {\n        const geom::LineString* ls = dynamic_cast<const geom::LineString*>(g);\n        if(ls) {\n            auto coord = ls->getCoordinates();\n            \/\/ coord ownership transferred to SegmentString\n            SegmentString* ss = new NodedSegmentString(coord.release(), nullptr);\n            _to.push_back(ss);\n        }\n    }\nprivate:\n    SegmentString::NonConstVect& _to;\n\n    SegmentStringExtractor(SegmentStringExtractor const&); \/*= delete*\/\n    SegmentStringExtractor& operator=(SegmentStringExtractor const&); \/*= delete*\/\n};\n\n}\n\n\n\/* public static *\/\nstd::unique_ptr<geom::Geometry>\nGeometryNoder::node(const geom::Geometry& geom)\n{\n    GeometryNoder noder(geom);\n    return noder.getNoded();\n}\n\n\/* public *\/\nGeometryNoder::GeometryNoder(const geom::Geometry& g)\n    :\n    argGeom(g)\n{\n}\n\n\/* private *\/\nstd::unique_ptr<geom::Geometry>\nGeometryNoder::toGeometry(SegmentString::NonConstVect& nodedEdges)\n{\n    const geom::GeometryFactory* geomFact = argGeom.getFactory();\n\n    std::set< OrientedCoordinateArray > ocas;\n\n    \/\/ Create a geometry out of the noded substrings.\n    std::vector< geom::Geometry* >* lines = new std::vector< geom::Geometry* >();\n    lines->reserve(nodedEdges.size());\n    for(auto& ss :  nodedEdges) {\n        const geom::CoordinateSequence* coords = ss->getCoordinates();\n\n        \/\/ Check if an equivalent edge is known\n        OrientedCoordinateArray oca1(*coords);\n        if(ocas.insert(oca1).second) {\n            geom::Geometry* tmp = geomFact->createLineString(coords->clone().release());\n            lines->push_back(tmp);\n        }\n    }\n\n    std::unique_ptr<geom::Geometry> noded(geomFact->createMultiLineString(lines));\n\n    return noded;\n}\n\n\/* public *\/\nstd::unique_ptr<geom::Geometry>\nGeometryNoder::getNoded()\n{\n    SegmentString::NonConstVect p_lineList;\n    extractSegmentStrings(argGeom, p_lineList);\n\n    Noder& p_noder = getNoder();\n    SegmentString::NonConstVect* nodedEdges = nullptr;\n\n    try {\n        p_noder.computeNodes(&p_lineList);\n        nodedEdges = p_noder.getNodedSubstrings();\n    }\n    catch(const std::exception&) {\n        for(size_t i = 0, n = p_lineList.size(); i < n; ++i) {\n            delete p_lineList[i];\n        }\n        throw;\n    }\n\n    std::unique_ptr<geom::Geometry> noded = toGeometry(*nodedEdges);\n\n    for(auto& elem : (*nodedEdges)) {\n        delete elem;\n    }\n    delete nodedEdges;\n\n    for(auto& elem : p_lineList) {\n        delete elem;\n    }\n\n    return noded;\n}\n\n\/* private static *\/\nvoid\nGeometryNoder::extractSegmentStrings(const geom::Geometry& g,\n                                     SegmentString::NonConstVect& to)\n{\n    SegmentStringExtractor ex(to);\n    g.apply_ro(&ex);\n}\n\n\/* private *\/\nNoder&\nGeometryNoder::getNoder()\n{\n    if(! noder.get()) {\n        const geom::PrecisionModel* pm = argGeom.getFactory()->getPrecisionModel();\n#if 0\n        using algorithm::LineIntersector;\n        LineIntersector li;\n        IntersectionAdder intersectionAdder(li);\n        noder.reset(new MCIndexNoder(&intersectionAdder));\n#else\n\n        IteratedNoder* in = new IteratedNoder(pm);\n        \/\/in->setMaximumIterations(0);\n        noder.reset(in);\n\n        \/\/using snapround::SimpleSnapRounder;\n        \/\/noder.reset( new SimpleSnapRounder(*pm) );\n\n        \/\/using snapround::MCIndexSnapRounder;\n        \/\/noder.reset( new MCIndexSnapRounder(*pm) );\n#endif\n    }\n    return *noder;\n\n\n}\n\n} \/\/ namespace geos.noding\n} \/\/ namespace geos\n<commit_msg>Avoid heap alloc in GeometryNoder::toGeometry<commit_after>\/**********************************************************************\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.osgeo.org\n *\n * Copyright (C) 2012  Sandro Santilli <strk@kbt.io>\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 * NOTE: this is not in JTS. JTS has a snapround\/GeometryNoder though\n *\n **********************************************************************\/\n\n#include <geos\/noding\/GeometryNoder.h>\n#include <geos\/noding\/SegmentString.h>\n#include <geos\/noding\/NodedSegmentString.h>\n#include <geos\/noding\/OrientedCoordinateArray.h>\n#include <geos\/noding\/Noder.h>\n#include <geos\/geom\/Geometry.h>\n#include <geos\/geom\/PrecisionModel.h>\n#include <geos\/geom\/CoordinateSequence.h>\n#include <geos\/geom\/GeometryFactory.h>\n#include <geos\/geom\/LineString.h>\n\n#include <geos\/noding\/IteratedNoder.h>\n\n#include <geos\/algorithm\/LineIntersector.h>\n#include <geos\/noding\/IntersectionAdder.h>\n#include <geos\/noding\/MCIndexNoder.h>\n\n#include <geos\/noding\/snapround\/SimpleSnapRounder.h>\n#include <geos\/noding\/snapround\/MCIndexSnapRounder.h>\n\n#include <memory> \/\/ for unique_ptr\n#include <iostream>\n\nnamespace geos {\nnamespace noding { \/\/ geos.noding\n\nnamespace {\n\n\/**\n * Add every linear element in a geometry into SegmentString vector\n *\/\nclass SegmentStringExtractor: public geom::GeometryComponentFilter {\npublic:\n    SegmentStringExtractor(SegmentString::NonConstVect& to)\n        : _to(to)\n    {}\n\n    void\n    filter_ro(const geom::Geometry* g) override\n    {\n        const geom::LineString* ls = dynamic_cast<const geom::LineString*>(g);\n        if(ls) {\n            auto coord = ls->getCoordinates();\n            \/\/ coord ownership transferred to SegmentString\n            SegmentString* ss = new NodedSegmentString(coord.release(), nullptr);\n            _to.push_back(ss);\n        }\n    }\nprivate:\n    SegmentString::NonConstVect& _to;\n\n    SegmentStringExtractor(SegmentStringExtractor const&); \/*= delete*\/\n    SegmentStringExtractor& operator=(SegmentStringExtractor const&); \/*= delete*\/\n};\n\n}\n\n\n\/* public static *\/\nstd::unique_ptr<geom::Geometry>\nGeometryNoder::node(const geom::Geometry& geom)\n{\n    GeometryNoder noder(geom);\n    return noder.getNoded();\n}\n\n\/* public *\/\nGeometryNoder::GeometryNoder(const geom::Geometry& g)\n    :\n    argGeom(g)\n{\n}\n\n\/* private *\/\nstd::unique_ptr<geom::Geometry>\nGeometryNoder::toGeometry(SegmentString::NonConstVect& nodedEdges)\n{\n    const geom::GeometryFactory* geomFact = argGeom.getFactory();\n\n    std::set< OrientedCoordinateArray > ocas;\n\n    \/\/ Create a geometry out of the noded substrings.\n    std::vector<std::unique_ptr<geom::Geometry>> lines;\n    lines.reserve(nodedEdges.size());\n    for(auto& ss :  nodedEdges) {\n        const geom::CoordinateSequence* coords = ss->getCoordinates();\n\n        \/\/ Check if an equivalent edge is known\n        OrientedCoordinateArray oca1(*coords);\n        if(ocas.insert(oca1).second) {\n            lines.push_back(geomFact->createLineString(coords->clone()));\n        }\n    }\n\n    return geomFact->createMultiLineString(std::move(lines));\n}\n\n\/* public *\/\nstd::unique_ptr<geom::Geometry>\nGeometryNoder::getNoded()\n{\n    SegmentString::NonConstVect p_lineList;\n    extractSegmentStrings(argGeom, p_lineList);\n\n    Noder& p_noder = getNoder();\n    SegmentString::NonConstVect* nodedEdges = nullptr;\n\n    try {\n        p_noder.computeNodes(&p_lineList);\n        nodedEdges = p_noder.getNodedSubstrings();\n    }\n    catch(const std::exception&) {\n        for(size_t i = 0, n = p_lineList.size(); i < n; ++i) {\n            delete p_lineList[i];\n        }\n        throw;\n    }\n\n    std::unique_ptr<geom::Geometry> noded = toGeometry(*nodedEdges);\n\n    for(auto& elem : (*nodedEdges)) {\n        delete elem;\n    }\n    delete nodedEdges;\n\n    for(auto& elem : p_lineList) {\n        delete elem;\n    }\n\n    return noded;\n}\n\n\/* private static *\/\nvoid\nGeometryNoder::extractSegmentStrings(const geom::Geometry& g,\n                                     SegmentString::NonConstVect& to)\n{\n    SegmentStringExtractor ex(to);\n    g.apply_ro(&ex);\n}\n\n\/* private *\/\nNoder&\nGeometryNoder::getNoder()\n{\n    if(! noder.get()) {\n        const geom::PrecisionModel* pm = argGeom.getFactory()->getPrecisionModel();\n#if 0\n        using algorithm::LineIntersector;\n        LineIntersector li;\n        IntersectionAdder intersectionAdder(li);\n        noder.reset(new MCIndexNoder(&intersectionAdder));\n#else\n\n        IteratedNoder* in = new IteratedNoder(pm);\n        \/\/in->setMaximumIterations(0);\n        noder.reset(in);\n\n        \/\/using snapround::SimpleSnapRounder;\n        \/\/noder.reset( new SimpleSnapRounder(*pm) );\n\n        \/\/using snapround::MCIndexSnapRounder;\n        \/\/noder.reset( new MCIndexSnapRounder(*pm) );\n#endif\n    }\n    return *noder;\n\n\n}\n\n} \/\/ namespace geos.noding\n} \/\/ namespace geos\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2016+ AzerothCore <www.azerothcore.org>, released under GNU GPL v2 license, you may redistribute it and\/or modify it under version 2 of the License, or (at your option), any later version.\n * Copyright (C) 2021+ WarheadCore <https:\/\/github.com\/WarheadCore>\n *\/\n\n#include \"DatabaseWorkerPool.h\"\n#include \"AdhocStatement.h\"\n#include \"Common.h\"\n#include \"Errors.h\"\n#include \"Implementation\/CharacterDatabase.h\"\n#include \"Implementation\/LoginDatabase.h\"\n#include \"Implementation\/WorldDatabase.h\"\n#include \"Log.h\"\n#include \"MySQLPreparedStatement.h\"\n#include \"MySQLWorkaround.h\"\n#include \"PreparedStatement.h\"\n#include \"ProducerConsumerQueue.h\"\n#include \"QueryCallback.h\"\n#include \"QueryHolder.h\"\n#include \"QueryResult.h\"\n#include \"SQLOperation.h\"\n#include \"Transaction.h\"\n#include <mysqld_error.h>\n\n#ifdef ACORE_DEBUG\n#include <boost\/stacktrace.hpp>\n#include <sstream>\n#endif\n\n#define MIN_MYSQL_SERVER_VERSION 50700u\n#define MIN_MYSQL_CLIENT_VERSION 50700u\n\nclass PingOperation : public SQLOperation\n{\n    \/\/! Operation for idle delaythreads\n    bool Execute() override\n    {\n        m_conn->Ping();\n        return true;\n    }\n};\n\ntemplate <class T>\nDatabaseWorkerPool<T>::DatabaseWorkerPool()\n    : _queue(new ProducerConsumerQueue<SQLOperation*>()),\n      _async_threads(0), _synch_threads(0)\n{\n    WPFatal(mysql_thread_safe(), \"Used MySQL library isn't thread-safe.\");\n    WPFatal(mysql_get_client_version() >= MIN_MYSQL_CLIENT_VERSION, \"AzerothCore does not support MySQL versions below 5.7\");\n    WPFatal(mysql_get_client_version() == MYSQL_VERSION_ID, \"Used MySQL library version (%s id %lu) does not match the version id used to compile AzerothCore (id %u)\",\n        mysql_get_client_info(), mysql_get_client_version(), MYSQL_VERSION_ID);\n}\n\ntemplate <class T>\nDatabaseWorkerPool<T>::~DatabaseWorkerPool()\n{\n    _queue->Cancel();\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::SetConnectionInfo(std::string const& infoString,\n    uint8 const asyncThreads, uint8 const synchThreads)\n{\n    _connectionInfo = std::make_unique<MySQLConnectionInfo>(infoString);\n\n    _async_threads = asyncThreads;\n    _synch_threads = synchThreads;\n}\n\ntemplate <class T>\nuint32 DatabaseWorkerPool<T>::Open()\n{\n    WPFatal(_connectionInfo.get(), \"Connection info was not set!\");\n\n    LOG_INFO(\"sql.driver\", \"Opening DatabasePool '%s'. \"\n        \"Asynchronous connections: %u, synchronous connections: %u.\",\n        GetDatabaseName(), _async_threads, _synch_threads);\n\n    uint32 error = OpenConnections(IDX_ASYNC, _async_threads);\n\n    if (error)\n        return error;\n\n    error = OpenConnections(IDX_SYNCH, _synch_threads);\n\n    if (!error)\n    {\n        LOG_INFO(\"sql.driver\", \"DatabasePool '%s' opened successfully. \" SZFMTD\n                    \" total connections running.\", GetDatabaseName(),\n                    (_connections[IDX_SYNCH].size() + _connections[IDX_ASYNC].size()));\n    }\n\n    LOG_INFO(\"sql.driver\", \" \");\n\n    return error;\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::Close()\n{\n    LOG_INFO(\"sql.driver\", \"Closing down DatabasePool '%s'.\", GetDatabaseName());\n\n    \/\/! Closes the actualy MySQL connection.\n    _connections[IDX_ASYNC].clear();\n\n    LOG_INFO(\"sql.driver\", \"Asynchronous connections on DatabasePool '%s' terminated. \"\n                \"Proceeding with synchronous connections.\",\n        GetDatabaseName());\n\n    \/\/! Shut down the synchronous connections\n    \/\/! There's no need for locking the connection, because DatabaseWorkerPool<>::Close\n    \/\/! should only be called after any other thread tasks in the core have exited,\n    \/\/! meaning there can be no concurrent access at this point.\n    _connections[IDX_SYNCH].clear();\n\n    LOG_INFO(\"sql.driver\", \"All connections on DatabasePool '%s' closed.\", GetDatabaseName());\n}\n\ntemplate <class T>\nbool DatabaseWorkerPool<T>::PrepareStatements()\n{\n    for (auto& connections : _connections)\n    {\n        for (auto& connection : connections)\n        {\n            connection->LockIfReady();\n            if (!connection->PrepareStatements())\n            {\n                connection->Unlock();\n                Close();\n                return false;\n            }\n            else\n                connection->Unlock();\n\n            size_t const preparedSize = connection->m_stmts.size();\n            if (_preparedStatementSize.size() < preparedSize)\n                _preparedStatementSize.resize(preparedSize);\n\n            for (size_t i = 0; i < preparedSize; ++i)\n            {\n                \/\/ already set by another connection\n                \/\/ (each connection only has prepared statements of it's own type sync\/async)\n                if (_preparedStatementSize[i] > 0)\n                    continue;\n\n                if (MySQLPreparedStatement* stmt = connection->m_stmts[i].get())\n                {\n                    uint32 const paramCount = stmt->GetParameterCount();\n\n                    \/\/ TC only supports uint8 indices.\n                    ASSERT(paramCount < std::numeric_limits<uint8>::max());\n\n                    _preparedStatementSize[i] = static_cast<uint8>(paramCount);\n                }\n            }\n        }\n    }\n\n    return true;\n}\n\ntemplate <class T>\nQueryResult DatabaseWorkerPool<T>::Query(char const* sql, T* connection \/*= nullptr*\/)\n{\n    if (!connection)\n        connection = GetFreeConnection();\n\n    ResultSet* result = connection->Query(sql);\n    connection->Unlock();\n    if (!result || !result->GetRowCount() || !result->NextRow())\n    {\n        delete result;\n        return QueryResult(nullptr);\n    }\n\n    return QueryResult(result);\n}\n\ntemplate <class T>\nPreparedQueryResult DatabaseWorkerPool<T>::Query(PreparedStatement<T>* stmt)\n{\n    auto connection = GetFreeConnection();\n    PreparedResultSet* ret = connection->Query(stmt);\n    connection->Unlock();\n\n    \/\/! Delete proxy-class. Not needed anymore\n    delete stmt;\n\n    if (!ret || !ret->GetRowCount())\n    {\n        delete ret;\n        return PreparedQueryResult(nullptr);\n    }\n\n    return PreparedQueryResult(ret);\n}\n\ntemplate <class T>\nQueryCallback DatabaseWorkerPool<T>::AsyncQuery(char const* sql)\n{\n    BasicStatementTask* task = new BasicStatementTask(sql, true);\n    \/\/ Store future result before enqueueing - task might get already processed and deleted before returning from this method\n    QueryResultFuture result = task->GetFuture();\n    Enqueue(task);\n    return QueryCallback(std::move(result));\n}\n\ntemplate <class T>\nQueryCallback DatabaseWorkerPool<T>::AsyncQuery(PreparedStatement<T>* stmt)\n{\n    PreparedStatementTask* task = new PreparedStatementTask(stmt, true);\n    \/\/ Store future result before enqueueing - task might get already processed and deleted before returning from this method\n    PreparedQueryResultFuture result = task->GetFuture();\n    Enqueue(task);\n    return QueryCallback(std::move(result));\n}\n\ntemplate <class T>\nSQLQueryHolderCallback DatabaseWorkerPool<T>::DelayQueryHolder(std::shared_ptr<SQLQueryHolder<T>> holder)\n{\n    SQLQueryHolderTask* task = new SQLQueryHolderTask(holder);\n    \/\/ Store future result before enqueueing - task might get already processed and deleted before returning from this method\n    QueryResultHolderFuture result = task->GetFuture();\n    Enqueue(task);\n    return { std::move(holder), std::move(result) };\n}\n\ntemplate <class T>\nSQLTransaction<T> DatabaseWorkerPool<T>::BeginTransaction()\n{\n    return std::make_shared<Transaction<T>>();\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::CommitTransaction(SQLTransaction<T> transaction)\n{\n#ifdef ACORE_DEBUG\n    \/\/! Only analyze transaction weaknesses in Debug mode.\n    \/\/! Ideally we catch the faults in Debug mode and then correct them,\n    \/\/! so there's no need to waste these CPU cycles in Release mode.\n    switch (transaction->GetSize())\n    {\n    case 0:\n        LOG_DEBUG(\"sql.driver\", \"Transaction contains 0 queries. Not executing.\");\n        return;\n    case 1:\n        LOG_DEBUG(\"sql.driver\", \"Warning: Transaction only holds 1 query, consider removing Transaction context in code.\");\n        break;\n    default:\n        break;\n    }\n#endif \/\/ ACORE_DEBUG\n\n    Enqueue(new TransactionTask(transaction));\n}\n\ntemplate <class T>\nTransactionCallback DatabaseWorkerPool<T>::AsyncCommitTransaction(SQLTransaction<T> transaction)\n{\n#ifdef ACORE_DEBUG\n    \/\/! Only analyze transaction weaknesses in Debug mode.\n    \/\/! Ideally we catch the faults in Debug mode and then correct them,\n    \/\/! so there's no need to waste these CPU cycles in Release mode.\n    switch (transaction->GetSize())\n    {\n        case 0:\n            LOG_DEBUG(\"sql.driver\", \"Transaction contains 0 queries. Not executing.\");\n            break;\n        case 1:\n            LOG_DEBUG(\"sql.driver\", \"Warning: Transaction only holds 1 query, consider removing Transaction context in code.\");\n            break;\n        default:\n            break;\n    }\n#endif \/\/ ACORE_DEBUG\n\n    TransactionWithResultTask* task = new TransactionWithResultTask(transaction);\n    TransactionFuture result = task->GetFuture();\n    Enqueue(task);\n    return TransactionCallback(std::move(result));\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::DirectCommitTransaction(SQLTransaction<T>& transaction)\n{\n    T* connection = GetFreeConnection();\n    int errorCode = connection->ExecuteTransaction(transaction);\n    if (!errorCode)\n    {\n        connection->Unlock();      \/\/ OK, operation succesful\n        return;\n    }\n\n    \/\/! Handle MySQL Errno 1213 without extending deadlock to the core itself\n    \/\/\/ @todo More elegant way\n    if (errorCode == ER_LOCK_DEADLOCK)\n    {\n        \/\/todo: handle multiple sync threads deadlocking in a similar way as async threads\n        uint8 loopBreaker = 5;\n        for (uint8 i = 0; i < loopBreaker; ++i)\n        {\n            if (!connection->ExecuteTransaction(transaction))\n                break;\n        }\n    }\n\n    \/\/! Clean up now.\n    transaction->Cleanup();\n\n    connection->Unlock();\n}\n\ntemplate <class T>\nPreparedStatement<T>* DatabaseWorkerPool<T>::GetPreparedStatement(PreparedStatementIndex index)\n{\n    return new PreparedStatement<T>(index, _preparedStatementSize[index]);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::EscapeString(std::string& str)\n{\n    if (str.empty())\n        return;\n\n    char* buf = new char[str.size() * 2 + 1];\n    EscapeString(buf, str.c_str(), uint32(str.size()));\n    str = buf;\n    delete[] buf;\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::KeepAlive()\n{\n    \/\/! Ping synchronous connections\n    for (auto& connection : _connections[IDX_SYNCH])\n    {\n        if (connection->LockIfReady())\n        {\n            connection->Ping();\n            connection->Unlock();\n        }\n    }\n\n    \/\/! Assuming all worker threads are free, every worker thread will receive 1 ping operation request\n    \/\/! If one or more worker threads are busy, the ping operations will not be split evenly, but this doesn't matter\n    \/\/! as the sole purpose is to prevent connections from idling.\n    auto const count = _connections[IDX_ASYNC].size();\n    for (uint8 i = 0; i < count; ++i)\n        Enqueue(new PingOperation);\n}\n\ntemplate <class T>\nuint32 DatabaseWorkerPool<T>::OpenConnections(InternalIndex type, uint8 numConnections)\n{\n    for (uint8 i = 0; i < numConnections; ++i)\n    {\n        \/\/ Create the connection\n        auto connection = [&] {\n            switch (type)\n            {\n            case IDX_ASYNC:\n                return std::make_unique<T>(_queue.get(), *_connectionInfo);\n            case IDX_SYNCH:\n                return std::make_unique<T>(*_connectionInfo);\n            default:\n                ABORT();\n            }\n        }();\n\n        if (uint32 error = connection->Open())\n        {\n            \/\/ Failed to open a connection or invalid version, abort and cleanup\n            _connections[type].clear();\n            return error;\n        }\n        else if (connection->GetServerVersion() < MIN_MYSQL_SERVER_VERSION)\n        {\n            LOG_ERROR(\"sql.driver\", \"AzerothCore does not support MySQL versions below 5.7\");\n            return 1;\n        }\n        else\n        {\n            _connections[type].push_back(std::move(connection));\n        }\n    }\n\n    \/\/ Everything is fine\n    return 0;\n}\n\ntemplate <class T>\nunsigned long DatabaseWorkerPool<T>::EscapeString(char* to, char const* from, unsigned long length)\n{\n    if (!to || !from || !length)\n        return 0;\n\n    return _connections[IDX_SYNCH].front()->EscapeString(to, from, length);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::Enqueue(SQLOperation* op)\n{\n    _queue->Push(op);\n}\n\ntemplate <class T>\nT* DatabaseWorkerPool<T>::GetFreeConnection()\n{\n#ifdef ACORE_DEBUG\n    if (_warnSyncQueries)\n    {\n        std::ostringstream ss;\n        ss << boost::stacktrace::stacktrace();\n        LOG_WARN(\"sql.performances\", \"Sync query at:\\n%s\", ss.str().c_str());\n    }\n#endif\n\n    uint8 i = 0;\n    auto const num_cons = _connections[IDX_SYNCH].size();\n    T* connection = nullptr;\n\n    \/\/! Block forever until a connection is free\n    for (;;)\n    {\n        connection = _connections[IDX_SYNCH][++i % num_cons].get();\n        \/\/! Must be matched with t->Unlock() or you will get deadlocks\n        if (connection->LockIfReady())\n            break;\n    }\n\n    return connection;\n}\n\ntemplate <class T>\nchar const* DatabaseWorkerPool<T>::GetDatabaseName() const\n{\n    return _connectionInfo->database.c_str();\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::Execute(char const* sql)\n{\n    if (Acore::IsFormatEmptyOrNull(sql))\n        return;\n\n    BasicStatementTask* task = new BasicStatementTask(sql);\n    Enqueue(task);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::Execute(PreparedStatement<T>* stmt)\n{\n    PreparedStatementTask* task = new PreparedStatementTask(stmt);\n    Enqueue(task);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::DirectExecute(char const* sql)\n{\n    if (Acore::IsFormatEmptyOrNull(sql))\n        return;\n\n    T* connection = GetFreeConnection();\n    connection->Execute(sql);\n    connection->Unlock();\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::DirectExecute(PreparedStatement<T>* stmt)\n{\n    T* connection = GetFreeConnection();\n    connection->Execute(stmt);\n    connection->Unlock();\n\n    \/\/! Delete proxy-class. Not needed anymore\n    delete stmt;\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::ExecuteOrAppend(SQLTransaction<T>& trans, char const* sql)\n{\n    if (!trans)\n        Execute(sql);\n    else\n        trans->Append(sql);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::ExecuteOrAppend(SQLTransaction<T>& trans, PreparedStatement<T>* stmt)\n{\n    if (!trans)\n        Execute(stmt);\n    else\n        trans->Append(stmt);\n}\n\ntemplate class AC_DATABASE_API DatabaseWorkerPool<LoginDatabaseConnection>;\ntemplate class AC_DATABASE_API DatabaseWorkerPool<WorldDatabaseConnection>;\ntemplate class AC_DATABASE_API DatabaseWorkerPool<CharacterDatabaseConnection>;\n<commit_msg>chore(Core\/Database): add info about errors (#6895)<commit_after>\/*\n * Copyright (C) 2016+ AzerothCore <www.azerothcore.org>, released under GNU GPL v2 license, you may redistribute it and\/or modify it under version 2 of the License, or (at your option), any later version.\n * Copyright (C) 2021+ WarheadCore <https:\/\/github.com\/WarheadCore>\n *\/\n\n#include \"DatabaseWorkerPool.h\"\n#include \"AdhocStatement.h\"\n#include \"Common.h\"\n#include \"Errors.h\"\n#include \"Implementation\/CharacterDatabase.h\"\n#include \"Implementation\/LoginDatabase.h\"\n#include \"Implementation\/WorldDatabase.h\"\n#include \"Log.h\"\n#include \"MySQLPreparedStatement.h\"\n#include \"MySQLWorkaround.h\"\n#include \"PreparedStatement.h\"\n#include \"ProducerConsumerQueue.h\"\n#include \"QueryCallback.h\"\n#include \"QueryHolder.h\"\n#include \"QueryResult.h\"\n#include \"SQLOperation.h\"\n#include \"Transaction.h\"\n#include <mysqld_error.h>\n\n#ifdef ACORE_DEBUG\n#include <boost\/stacktrace.hpp>\n#include <sstream>\n#endif\n\n#define MIN_MYSQL_SERVER_VERSION 50700u\n#define MIN_MYSQL_CLIENT_VERSION 50700u\n\nclass PingOperation : public SQLOperation\n{\n    \/\/! Operation for idle delaythreads\n    bool Execute() override\n    {\n        m_conn->Ping();\n        return true;\n    }\n};\n\ntemplate <class T>\nDatabaseWorkerPool<T>::DatabaseWorkerPool()\n    : _queue(new ProducerConsumerQueue<SQLOperation*>()),\n      _async_threads(0), _synch_threads(0)\n{\n    WPFatal(mysql_thread_safe(), \"Used MySQL library isn't thread-safe.\");\n    WPFatal(mysql_get_client_version() >= MIN_MYSQL_CLIENT_VERSION, \"AzerothCore does not support MySQL versions below 5.7.\\nSearch the wiki for ACE00043 in Common Errors (https:\/\/www.azerothcore.org\/wiki\/common-errors).\");\n    WPFatal(mysql_get_client_version() == MYSQL_VERSION_ID, \"Used MySQL library version (%s id %lu) does not match the version id used to compile AzerothCore (id %u).\\nSearch the wiki for ACE00046 in Common Errors (https:\/\/www.azerothcore.org\/wiki\/common-errors).\",\n        mysql_get_client_info(), mysql_get_client_version(), MYSQL_VERSION_ID);\n}\n\ntemplate <class T>\nDatabaseWorkerPool<T>::~DatabaseWorkerPool()\n{\n    _queue->Cancel();\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::SetConnectionInfo(std::string const& infoString,\n    uint8 const asyncThreads, uint8 const synchThreads)\n{\n    _connectionInfo = std::make_unique<MySQLConnectionInfo>(infoString);\n\n    _async_threads = asyncThreads;\n    _synch_threads = synchThreads;\n}\n\ntemplate <class T>\nuint32 DatabaseWorkerPool<T>::Open()\n{\n    WPFatal(_connectionInfo.get(), \"Connection info was not set!\");\n\n    LOG_INFO(\"sql.driver\", \"Opening DatabasePool '%s'. \"\n        \"Asynchronous connections: %u, synchronous connections: %u.\",\n        GetDatabaseName(), _async_threads, _synch_threads);\n\n    uint32 error = OpenConnections(IDX_ASYNC, _async_threads);\n\n    if (error)\n        return error;\n\n    error = OpenConnections(IDX_SYNCH, _synch_threads);\n\n    if (!error)\n    {\n        LOG_INFO(\"sql.driver\", \"DatabasePool '%s' opened successfully. \" SZFMTD\n                    \" total connections running.\", GetDatabaseName(),\n                    (_connections[IDX_SYNCH].size() + _connections[IDX_ASYNC].size()));\n    }\n\n    LOG_INFO(\"sql.driver\", \" \");\n\n    return error;\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::Close()\n{\n    LOG_INFO(\"sql.driver\", \"Closing down DatabasePool '%s'.\", GetDatabaseName());\n\n    \/\/! Closes the actualy MySQL connection.\n    _connections[IDX_ASYNC].clear();\n\n    LOG_INFO(\"sql.driver\", \"Asynchronous connections on DatabasePool '%s' terminated. \"\n                \"Proceeding with synchronous connections.\",\n        GetDatabaseName());\n\n    \/\/! Shut down the synchronous connections\n    \/\/! There's no need for locking the connection, because DatabaseWorkerPool<>::Close\n    \/\/! should only be called after any other thread tasks in the core have exited,\n    \/\/! meaning there can be no concurrent access at this point.\n    _connections[IDX_SYNCH].clear();\n\n    LOG_INFO(\"sql.driver\", \"All connections on DatabasePool '%s' closed.\", GetDatabaseName());\n}\n\ntemplate <class T>\nbool DatabaseWorkerPool<T>::PrepareStatements()\n{\n    for (auto& connections : _connections)\n    {\n        for (auto& connection : connections)\n        {\n            connection->LockIfReady();\n            if (!connection->PrepareStatements())\n            {\n                connection->Unlock();\n                Close();\n                return false;\n            }\n            else\n                connection->Unlock();\n\n            size_t const preparedSize = connection->m_stmts.size();\n            if (_preparedStatementSize.size() < preparedSize)\n                _preparedStatementSize.resize(preparedSize);\n\n            for (size_t i = 0; i < preparedSize; ++i)\n            {\n                \/\/ already set by another connection\n                \/\/ (each connection only has prepared statements of it's own type sync\/async)\n                if (_preparedStatementSize[i] > 0)\n                    continue;\n\n                if (MySQLPreparedStatement* stmt = connection->m_stmts[i].get())\n                {\n                    uint32 const paramCount = stmt->GetParameterCount();\n\n                    \/\/ TC only supports uint8 indices.\n                    ASSERT(paramCount < std::numeric_limits<uint8>::max());\n\n                    _preparedStatementSize[i] = static_cast<uint8>(paramCount);\n                }\n            }\n        }\n    }\n\n    return true;\n}\n\ntemplate <class T>\nQueryResult DatabaseWorkerPool<T>::Query(char const* sql, T* connection \/*= nullptr*\/)\n{\n    if (!connection)\n        connection = GetFreeConnection();\n\n    ResultSet* result = connection->Query(sql);\n    connection->Unlock();\n    if (!result || !result->GetRowCount() || !result->NextRow())\n    {\n        delete result;\n        return QueryResult(nullptr);\n    }\n\n    return QueryResult(result);\n}\n\ntemplate <class T>\nPreparedQueryResult DatabaseWorkerPool<T>::Query(PreparedStatement<T>* stmt)\n{\n    auto connection = GetFreeConnection();\n    PreparedResultSet* ret = connection->Query(stmt);\n    connection->Unlock();\n\n    \/\/! Delete proxy-class. Not needed anymore\n    delete stmt;\n\n    if (!ret || !ret->GetRowCount())\n    {\n        delete ret;\n        return PreparedQueryResult(nullptr);\n    }\n\n    return PreparedQueryResult(ret);\n}\n\ntemplate <class T>\nQueryCallback DatabaseWorkerPool<T>::AsyncQuery(char const* sql)\n{\n    BasicStatementTask* task = new BasicStatementTask(sql, true);\n    \/\/ Store future result before enqueueing - task might get already processed and deleted before returning from this method\n    QueryResultFuture result = task->GetFuture();\n    Enqueue(task);\n    return QueryCallback(std::move(result));\n}\n\ntemplate <class T>\nQueryCallback DatabaseWorkerPool<T>::AsyncQuery(PreparedStatement<T>* stmt)\n{\n    PreparedStatementTask* task = new PreparedStatementTask(stmt, true);\n    \/\/ Store future result before enqueueing - task might get already processed and deleted before returning from this method\n    PreparedQueryResultFuture result = task->GetFuture();\n    Enqueue(task);\n    return QueryCallback(std::move(result));\n}\n\ntemplate <class T>\nSQLQueryHolderCallback DatabaseWorkerPool<T>::DelayQueryHolder(std::shared_ptr<SQLQueryHolder<T>> holder)\n{\n    SQLQueryHolderTask* task = new SQLQueryHolderTask(holder);\n    \/\/ Store future result before enqueueing - task might get already processed and deleted before returning from this method\n    QueryResultHolderFuture result = task->GetFuture();\n    Enqueue(task);\n    return { std::move(holder), std::move(result) };\n}\n\ntemplate <class T>\nSQLTransaction<T> DatabaseWorkerPool<T>::BeginTransaction()\n{\n    return std::make_shared<Transaction<T>>();\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::CommitTransaction(SQLTransaction<T> transaction)\n{\n#ifdef ACORE_DEBUG\n    \/\/! Only analyze transaction weaknesses in Debug mode.\n    \/\/! Ideally we catch the faults in Debug mode and then correct them,\n    \/\/! so there's no need to waste these CPU cycles in Release mode.\n    switch (transaction->GetSize())\n    {\n    case 0:\n        LOG_DEBUG(\"sql.driver\", \"Transaction contains 0 queries. Not executing.\");\n        return;\n    case 1:\n        LOG_DEBUG(\"sql.driver\", \"Warning: Transaction only holds 1 query, consider removing Transaction context in code.\");\n        break;\n    default:\n        break;\n    }\n#endif \/\/ ACORE_DEBUG\n\n    Enqueue(new TransactionTask(transaction));\n}\n\ntemplate <class T>\nTransactionCallback DatabaseWorkerPool<T>::AsyncCommitTransaction(SQLTransaction<T> transaction)\n{\n#ifdef ACORE_DEBUG\n    \/\/! Only analyze transaction weaknesses in Debug mode.\n    \/\/! Ideally we catch the faults in Debug mode and then correct them,\n    \/\/! so there's no need to waste these CPU cycles in Release mode.\n    switch (transaction->GetSize())\n    {\n        case 0:\n            LOG_DEBUG(\"sql.driver\", \"Transaction contains 0 queries. Not executing.\");\n            break;\n        case 1:\n            LOG_DEBUG(\"sql.driver\", \"Warning: Transaction only holds 1 query, consider removing Transaction context in code.\");\n            break;\n        default:\n            break;\n    }\n#endif \/\/ ACORE_DEBUG\n\n    TransactionWithResultTask* task = new TransactionWithResultTask(transaction);\n    TransactionFuture result = task->GetFuture();\n    Enqueue(task);\n    return TransactionCallback(std::move(result));\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::DirectCommitTransaction(SQLTransaction<T>& transaction)\n{\n    T* connection = GetFreeConnection();\n    int errorCode = connection->ExecuteTransaction(transaction);\n    if (!errorCode)\n    {\n        connection->Unlock();      \/\/ OK, operation succesful\n        return;\n    }\n\n    \/\/! Handle MySQL Errno 1213 without extending deadlock to the core itself\n    \/\/\/ @todo More elegant way\n    if (errorCode == ER_LOCK_DEADLOCK)\n    {\n        \/\/todo: handle multiple sync threads deadlocking in a similar way as async threads\n        uint8 loopBreaker = 5;\n        for (uint8 i = 0; i < loopBreaker; ++i)\n        {\n            if (!connection->ExecuteTransaction(transaction))\n                break;\n        }\n    }\n\n    \/\/! Clean up now.\n    transaction->Cleanup();\n\n    connection->Unlock();\n}\n\ntemplate <class T>\nPreparedStatement<T>* DatabaseWorkerPool<T>::GetPreparedStatement(PreparedStatementIndex index)\n{\n    return new PreparedStatement<T>(index, _preparedStatementSize[index]);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::EscapeString(std::string& str)\n{\n    if (str.empty())\n        return;\n\n    char* buf = new char[str.size() * 2 + 1];\n    EscapeString(buf, str.c_str(), uint32(str.size()));\n    str = buf;\n    delete[] buf;\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::KeepAlive()\n{\n    \/\/! Ping synchronous connections\n    for (auto& connection : _connections[IDX_SYNCH])\n    {\n        if (connection->LockIfReady())\n        {\n            connection->Ping();\n            connection->Unlock();\n        }\n    }\n\n    \/\/! Assuming all worker threads are free, every worker thread will receive 1 ping operation request\n    \/\/! If one or more worker threads are busy, the ping operations will not be split evenly, but this doesn't matter\n    \/\/! as the sole purpose is to prevent connections from idling.\n    auto const count = _connections[IDX_ASYNC].size();\n    for (uint8 i = 0; i < count; ++i)\n        Enqueue(new PingOperation);\n}\n\ntemplate <class T>\nuint32 DatabaseWorkerPool<T>::OpenConnections(InternalIndex type, uint8 numConnections)\n{\n    for (uint8 i = 0; i < numConnections; ++i)\n    {\n        \/\/ Create the connection\n        auto connection = [&] {\n            switch (type)\n            {\n            case IDX_ASYNC:\n                return std::make_unique<T>(_queue.get(), *_connectionInfo);\n            case IDX_SYNCH:\n                return std::make_unique<T>(*_connectionInfo);\n            default:\n                ABORT();\n            }\n        }();\n\n        if (uint32 error = connection->Open())\n        {\n            \/\/ Failed to open a connection or invalid version, abort and cleanup\n            _connections[type].clear();\n            return error;\n        }\n        else if (connection->GetServerVersion() < MIN_MYSQL_SERVER_VERSION)\n        {\n            LOG_ERROR(\"sql.driver\", \"AzerothCore does not support MySQL versions below 5.7\");\n            return 1;\n        }\n        else\n        {\n            _connections[type].push_back(std::move(connection));\n        }\n    }\n\n    \/\/ Everything is fine\n    return 0;\n}\n\ntemplate <class T>\nunsigned long DatabaseWorkerPool<T>::EscapeString(char* to, char const* from, unsigned long length)\n{\n    if (!to || !from || !length)\n        return 0;\n\n    return _connections[IDX_SYNCH].front()->EscapeString(to, from, length);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::Enqueue(SQLOperation* op)\n{\n    _queue->Push(op);\n}\n\ntemplate <class T>\nT* DatabaseWorkerPool<T>::GetFreeConnection()\n{\n#ifdef ACORE_DEBUG\n    if (_warnSyncQueries)\n    {\n        std::ostringstream ss;\n        ss << boost::stacktrace::stacktrace();\n        LOG_WARN(\"sql.performances\", \"Sync query at:\\n%s\", ss.str().c_str());\n    }\n#endif\n\n    uint8 i = 0;\n    auto const num_cons = _connections[IDX_SYNCH].size();\n    T* connection = nullptr;\n\n    \/\/! Block forever until a connection is free\n    for (;;)\n    {\n        connection = _connections[IDX_SYNCH][++i % num_cons].get();\n        \/\/! Must be matched with t->Unlock() or you will get deadlocks\n        if (connection->LockIfReady())\n            break;\n    }\n\n    return connection;\n}\n\ntemplate <class T>\nchar const* DatabaseWorkerPool<T>::GetDatabaseName() const\n{\n    return _connectionInfo->database.c_str();\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::Execute(char const* sql)\n{\n    if (Acore::IsFormatEmptyOrNull(sql))\n        return;\n\n    BasicStatementTask* task = new BasicStatementTask(sql);\n    Enqueue(task);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::Execute(PreparedStatement<T>* stmt)\n{\n    PreparedStatementTask* task = new PreparedStatementTask(stmt);\n    Enqueue(task);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::DirectExecute(char const* sql)\n{\n    if (Acore::IsFormatEmptyOrNull(sql))\n        return;\n\n    T* connection = GetFreeConnection();\n    connection->Execute(sql);\n    connection->Unlock();\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::DirectExecute(PreparedStatement<T>* stmt)\n{\n    T* connection = GetFreeConnection();\n    connection->Execute(stmt);\n    connection->Unlock();\n\n    \/\/! Delete proxy-class. Not needed anymore\n    delete stmt;\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::ExecuteOrAppend(SQLTransaction<T>& trans, char const* sql)\n{\n    if (!trans)\n        Execute(sql);\n    else\n        trans->Append(sql);\n}\n\ntemplate <class T>\nvoid DatabaseWorkerPool<T>::ExecuteOrAppend(SQLTransaction<T>& trans, PreparedStatement<T>* stmt)\n{\n    if (!trans)\n        Execute(stmt);\n    else\n        trans->Append(stmt);\n}\n\ntemplate class AC_DATABASE_API DatabaseWorkerPool<LoginDatabaseConnection>;\ntemplate class AC_DATABASE_API DatabaseWorkerPool<WorldDatabaseConnection>;\ntemplate class AC_DATABASE_API DatabaseWorkerPool<CharacterDatabaseConnection>;\n<|endoftext|>"}
{"text":"<commit_before>\/* gobby - A GTKmm driven libobby client\n * Copyright (C) 2005 0x539 dev group\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU 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 * 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 Free\n * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n *\/\n\n#include <windows.h>\n#include <gdk\/gdkwin32.h>\n#include <net6\/error.hpp>\n#include \"io\/main_connection.hpp\"\n\n#include <iostream>\n\nnamespace\n{\n\t\/\/ Note that this is not threadsafe, but we do not need threading here\n\t\/\/ anyways: We register all existing main_connections in a map that\n\t\/\/ associates their socket to the connection to regain the\n\t\/\/ main_connection object in the event handler.\n\ttypedef std::map<net6::socket::socket_type, obby::io::main_connection*>\n\t\tconnmap_type;\n\n\t\/\/ The map of main_connections\n\tconnmap_type connmap;\n\n\t\/\/ Registers a new main_connection\n\tvoid register_connection(obby::io::main_connection& conn)\n\t{\n\t\tconnmap[conn.get_socket().cobj()] = &conn;\n\t}\n\n\t\/\/ Unregisters a main_connection\n\tvoid unregister_connection(obby::io::main_connection& conn)\n\t{\n\t\tconnmap_type::iterator iter =\n\t\t\tconnmap.find(conn.get_socket().cobj() );\n\n\t\tif(iter != connmap.end() )\n\t\t\tconnmap.erase(iter);\n\t}\n\n\t\/\/ Returns the main_connection for a given socket\n\tobby::io::main_connection*\n\tget_connection(net6::socket::socket_type socket)\n\t{\n\t\tconnmap_type::iterator iter = connmap.find(socket);\n\n\t\tif(iter == connmap.end() )\n\t\t\treturn NULL;\n\t\telse\n\t\t\treturn iter->second;\n\t}\n\n\t\/\/ Network message\n\tconst UINT WM_NETWORK = RegisterWindowMessageA(\"GOBBY_NETWORK_EVENT\");\n\n\t\/\/ Gets a HWND for a given Gtk::Window\n\tHWND hwnd_from_window(Gtk::Window& window)\n\t{\n\t\treturn reinterpret_cast<HWND>(\n\t\t\tGDK_WINDOW_HWND(window.get_window()->gobj() )\n\t\t);\n\t}\n\n\t\/\/ Callback function for window filter\n\tGdkFilterReturn on_filter(GdkXEvent* xevent,\n\t                          GdkEvent* event,\n\t                          gpointer data)\n\t{\n\t\t\/\/ Get window message\n\t\tMSG* msg = static_cast<MSG*>(xevent);\n\n\t\t\/\/ Network event?\n\t\tif(msg->message == WM_NETWORK)\n\t\t{\n\t\t\tlong error, event;\n\t\t\tnet6::socket::socket_type c_socket;\n\n\t\t\t\/\/ Get parameter from windows message\n\t\t\tc_socket = msg->wParam;\n\t\t\terror = WSAGETSELECTERROR(msg->lParam);\n\t\t\tevent = WSAGETSELECTEVENT(msg->lParam);\n\n\t\t\t\/\/ Get main_connection, if any\n\t\t\tobby::io::main_connection* conn =\n\t\t\t\tget_connection(c_socket);\n\t\t\tif(conn == NULL) return GDK_FILTER_REMOVE;\n\t\t\tconst net6::socket& sock = conn->get_socket();\n\n\t\t\t\/\/ Check for error\n\t\t\tif(error != 0)\n\t\t\t{\n\t\t\t\tif(conn->get_events() &\n\t\t\t\t   obby::io::main_connection::IO_ERROR)\n\t\t\t\t\tsock.io_event().emit(\n\t\t\t\t\t\tnet6::socket::IOERROR\n\t\t\t\t\t);\n\n\t\t\t\treturn GDK_FILTER_REMOVE;\n\t\t\t}\n\n\t\t\t\/\/ No error occured. Check for events\n\t\t\t\/\/ which cause a net6::socket::INCOMING.\n\t\t\tif(event == FD_READ || event == FD_ACCEPT ||\n\t\t\t   event == FD_CLOSE)\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\t\/\/ Read until the read call would block\n\t\t\t\t\t\/\/ which means that no more data is to\n\t\t\t\t\t\/\/ read. Only perform one read operation\n\t\t\t\t\t\/\/ in case of a close or accept event.\n\t\t\t\t\tdo\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ TODO: On connection loss, 0\n\t\t\t\t\t\t\/\/ bytes are read -> we run into\n\t\t\t\t\t\t\/\/ an endless loop.\n\t\t\t\t\t\tsock.io_event().emit(\n\t\t\t\t\t\t\tnet6::socket::INCOMING\n\t\t\t\t\t\t);\n\t\t\t\t\t} while(event == FD_READ);\n\t\t\t\t}\n\t\t\t\tcatch(net6::error& e)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Ignore WOULD_BLOCK errors.\n\t\t\t\t\tif(e.get_code() !=\n\t\t\t\t\t   net6::error::WOULD_BLOCK)\n\t\t\t\t\t\tthrow e;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Check for something to write.\n\t\t\tif(event == FD_WRITE)\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\t\/\/ Write until the call would block\n\t\t\t\t\t\/\/ (which means that no more buffer\n\t\t\t\t\t\/\/ space is available for writing) or\n\t\t\t\t\t\/\/ until there is nothing to write\n\t\t\t\t\t\/\/ anymore.\n\t\t\t\t\twhile(conn->get_events() &\n\t\t\t\t\t      obby::io::main_connection::IO_OUT)\n\t\t\t\t\t{\n\t\t\t\t\t\tsock.io_event().emit(\n\t\t\t\t\t\t\tnet6::socket::OUTGOING\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcatch(net6::error& e)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Ignore WOULD_BLOCK errors\n\t\t\t\t\tif(e.get_code() !=\n\t\t\t\t\t   net6::error::WOULD_BLOCK)\n\t\t\t\t\t\tthrow e;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn GDK_FILTER_REMOVE;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ No network event: Handle normally.\n\t\t\treturn GDK_FILTER_CONTINUE;\n\t\t}\n\t}\n}\n\nobby::io::main_connection::main_connection(Gtk::Window& window,\n                                           const net6::socket& sock,\n                                           Condition condition)\n : m_window(window), m_socket(sock),\n   m_condition(static_cast<main_connection::Condition>(0) )\n{\n\t\/\/ Add filter if there is none set\n\tif(connmap.size() == 0)\n\t\twindow.get_window()->add_filter(&on_filter, NULL);\n\n\t\/\/ Register object\n\tregister_connection(*this);\n\n\t\/\/ Wait for events\n\tset_events(condition);\n}\n\nobby::io::main_connection::~main_connection()\n{\n\t\/\/ Unregister object\n\tunregister_connection(*this);\n\n\t\/\/ Remove filter if it is not needed anymore\n\tif(connmap.size() == 0)\n\t\tm_window.get_window()->remove_filter(&on_filter, NULL);\n\n\t\/\/ Do not wait for anything any longer\n\tWSAAsyncSelect(\n\t\tm_socket.cobj(),\n\t\thwnd_from_window(m_window),\n\t\tWM_NETWORK,\n\t\t0\n\t);\n\n\t\/\/ Do not do any error handling because we are running a destructor.\n\t\/\/ Throwing exceptions in destructors is evil.\n}\n\nvoid obby::io::main_connection::set_events(Condition condition)\n{\n\t\/\/ Do only do something if we shall watch for other conditions\n\/\/\tif(m_condition != condition)\n\t{\n\t\t\/\/ Build lEvent parameter for WSAAsyncSelect\n\t\tlong levent = 0;\n\n\t\tif(condition & IO_IN) levent |= (FD_READ | FD_CLOSE);\n\t\tif(condition & IO_ACCEPT) levent |= FD_ACCEPT;\n\t\tif(condition & IO_OUT) levent |= FD_WRITE;\n\n\t\t\/\/ Save conditions we are currently watching for\n\t\tm_condition = condition;\n\n\t\t\/\/ Select for new conditions\n\t\tint result = WSAAsyncSelect(\n\t\t\tm_socket.cobj(),\n\t\t\thwnd_from_window(m_window),\n\t\t\tWM_NETWORK,\n\t\t\tlevent\n\t\t);\n\n\t\tif(result != 0)\n\t\t\tthrow net6::error(net6::error::SYSTEM);\n\t}\n}\n\nvoid obby::io::main_connection::add_events(Condition condition)\n{\n\tset_events(m_condition | condition);\n}\n\nvoid obby::io::main_connection::remove_events(Condition condition)\n{\n\tset_events(m_condition & ~condition);\n}\n<commit_msg>[project @ Added #include to <winsock2.h> to avoid <winsock.h> being included later.]<commit_after>\/* gobby - A GTKmm driven libobby client\n * Copyright (C) 2005 0x539 dev group\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU 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 * 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 Free\n * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n *\/\n\n#include <winsock2.h>\n#include <windows.h>\n#include <gdk\/gdkwin32.h>\n#include <net6\/error.hpp>\n#include \"io\/main_connection.hpp\"\n\n#include <iostream>\n\nnamespace\n{\n\t\/\/ Note that this is not threadsafe, but we do not need threading here\n\t\/\/ anyways: We register all existing main_connections in a map that\n\t\/\/ associates their socket to the connection to regain the\n\t\/\/ main_connection object in the event handler.\n\ttypedef std::map<net6::socket::socket_type, obby::io::main_connection*>\n\t\tconnmap_type;\n\n\t\/\/ The map of main_connections\n\tconnmap_type connmap;\n\n\t\/\/ Registers a new main_connection\n\tvoid register_connection(obby::io::main_connection& conn)\n\t{\n\t\tconnmap[conn.get_socket().cobj()] = &conn;\n\t}\n\n\t\/\/ Unregisters a main_connection\n\tvoid unregister_connection(obby::io::main_connection& conn)\n\t{\n\t\tconnmap_type::iterator iter =\n\t\t\tconnmap.find(conn.get_socket().cobj() );\n\n\t\tif(iter != connmap.end() )\n\t\t\tconnmap.erase(iter);\n\t}\n\n\t\/\/ Returns the main_connection for a given socket\n\tobby::io::main_connection*\n\tget_connection(net6::socket::socket_type socket)\n\t{\n\t\tconnmap_type::iterator iter = connmap.find(socket);\n\n\t\tif(iter == connmap.end() )\n\t\t\treturn NULL;\n\t\telse\n\t\t\treturn iter->second;\n\t}\n\n\t\/\/ Network message\n\tconst UINT WM_NETWORK = RegisterWindowMessageA(\"GOBBY_NETWORK_EVENT\");\n\n\t\/\/ Gets a HWND for a given Gtk::Window\n\tHWND hwnd_from_window(Gtk::Window& window)\n\t{\n\t\treturn reinterpret_cast<HWND>(\n\t\t\tGDK_WINDOW_HWND(window.get_window()->gobj() )\n\t\t);\n\t}\n\n\t\/\/ Callback function for window filter\n\tGdkFilterReturn on_filter(GdkXEvent* xevent,\n\t                          GdkEvent* event,\n\t                          gpointer data)\n\t{\n\t\t\/\/ Get window message\n\t\tMSG* msg = static_cast<MSG*>(xevent);\n\n\t\t\/\/ Network event?\n\t\tif(msg->message == WM_NETWORK)\n\t\t{\n\t\t\tlong error, event;\n\t\t\tnet6::socket::socket_type c_socket;\n\n\t\t\t\/\/ Get parameter from windows message\n\t\t\tc_socket = msg->wParam;\n\t\t\terror = WSAGETSELECTERROR(msg->lParam);\n\t\t\tevent = WSAGETSELECTEVENT(msg->lParam);\n\n\t\t\t\/\/ Get main_connection, if any\n\t\t\tobby::io::main_connection* conn =\n\t\t\t\tget_connection(c_socket);\n\t\t\tif(conn == NULL) return GDK_FILTER_REMOVE;\n\t\t\tconst net6::socket& sock = conn->get_socket();\n\n\t\t\t\/\/ Check for error\n\t\t\tif(error != 0)\n\t\t\t{\n\t\t\t\tif(conn->get_events() &\n\t\t\t\t   obby::io::main_connection::IO_ERROR)\n\t\t\t\t\tsock.io_event().emit(\n\t\t\t\t\t\tnet6::socket::IOERROR\n\t\t\t\t\t);\n\n\t\t\t\treturn GDK_FILTER_REMOVE;\n\t\t\t}\n\n\t\t\t\/\/ No error occured. Check for events\n\t\t\t\/\/ which cause a net6::socket::INCOMING.\n\t\t\tif(event == FD_READ || event == FD_ACCEPT ||\n\t\t\t   event == FD_CLOSE)\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\t\/\/ Read until the read call would block\n\t\t\t\t\t\/\/ which means that no more data is to\n\t\t\t\t\t\/\/ read. Only perform one read operation\n\t\t\t\t\t\/\/ in case of a close or accept event.\n\t\t\t\t\tdo\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ TODO: On connection loss, 0\n\t\t\t\t\t\t\/\/ bytes are read -> we run into\n\t\t\t\t\t\t\/\/ an endless loop.\n\t\t\t\t\t\tsock.io_event().emit(\n\t\t\t\t\t\t\tnet6::socket::INCOMING\n\t\t\t\t\t\t);\n\t\t\t\t\t} while(event == FD_READ);\n\t\t\t\t}\n\t\t\t\tcatch(net6::error& e)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Ignore WOULD_BLOCK errors.\n\t\t\t\t\tif(e.get_code() !=\n\t\t\t\t\t   net6::error::WOULD_BLOCK)\n\t\t\t\t\t\tthrow e;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Check for something to write.\n\t\t\tif(event == FD_WRITE)\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\t\/\/ Write until the call would block\n\t\t\t\t\t\/\/ (which means that no more buffer\n\t\t\t\t\t\/\/ space is available for writing) or\n\t\t\t\t\t\/\/ until there is nothing to write\n\t\t\t\t\t\/\/ anymore.\n\t\t\t\t\twhile(conn->get_events() &\n\t\t\t\t\t      obby::io::main_connection::IO_OUT)\n\t\t\t\t\t{\n\t\t\t\t\t\tsock.io_event().emit(\n\t\t\t\t\t\t\tnet6::socket::OUTGOING\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcatch(net6::error& e)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Ignore WOULD_BLOCK errors\n\t\t\t\t\tif(e.get_code() !=\n\t\t\t\t\t   net6::error::WOULD_BLOCK)\n\t\t\t\t\t\tthrow e;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn GDK_FILTER_REMOVE;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ No network event: Handle normally.\n\t\t\treturn GDK_FILTER_CONTINUE;\n\t\t}\n\t}\n}\n\nobby::io::main_connection::main_connection(Gtk::Window& window,\n                                           const net6::socket& sock,\n                                           Condition condition)\n : m_window(window), m_socket(sock),\n   m_condition(static_cast<main_connection::Condition>(0) )\n{\n\t\/\/ Add filter if there is none set\n\tif(connmap.size() == 0)\n\t\twindow.get_window()->add_filter(&on_filter, NULL);\n\n\t\/\/ Register object\n\tregister_connection(*this);\n\n\t\/\/ Wait for events\n\tset_events(condition);\n}\n\nobby::io::main_connection::~main_connection()\n{\n\t\/\/ Unregister object\n\tunregister_connection(*this);\n\n\t\/\/ Remove filter if it is not needed anymore\n\tif(connmap.size() == 0)\n\t\tm_window.get_window()->remove_filter(&on_filter, NULL);\n\n\t\/\/ Do not wait for anything any longer\n\tWSAAsyncSelect(\n\t\tm_socket.cobj(),\n\t\thwnd_from_window(m_window),\n\t\tWM_NETWORK,\n\t\t0\n\t);\n\n\t\/\/ Do not do any error handling because we are running a destructor.\n\t\/\/ Throwing exceptions in destructors is evil.\n}\n\nvoid obby::io::main_connection::set_events(Condition condition)\n{\n\t\/\/ Do only do something if we shall watch for other conditions\n\/\/\tif(m_condition != condition)\n\t{\n\t\t\/\/ Build lEvent parameter for WSAAsyncSelect\n\t\tlong levent = 0;\n\n\t\tif(condition & IO_IN) levent |= (FD_READ | FD_CLOSE);\n\t\tif(condition & IO_ACCEPT) levent |= FD_ACCEPT;\n\t\tif(condition & IO_OUT) levent |= FD_WRITE;\n\n\t\t\/\/ Save conditions we are currently watching for\n\t\tm_condition = condition;\n\n\t\t\/\/ Select for new conditions\n\t\tint result = WSAAsyncSelect(\n\t\t\tm_socket.cobj(),\n\t\t\thwnd_from_window(m_window),\n\t\t\tWM_NETWORK,\n\t\t\tlevent\n\t\t);\n\n\t\tif(result != 0)\n\t\t\tthrow net6::error(net6::error::SYSTEM);\n\t}\n}\n\nvoid obby::io::main_connection::add_events(Condition condition)\n{\n\tset_events(m_condition | condition);\n}\n\nvoid obby::io::main_connection::remove_events(Condition condition)\n{\n\tset_events(m_condition & ~condition);\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 \"tensorflow\/compiler\/xla\/util.h\"\n\n#include <limits>\n#include <list>\n\n#include \"tensorflow\/compiler\/xla\/test.h\"\n#include \"tensorflow\/compiler\/xla\/types.h\"\n\nnamespace xla {\nnamespace {\n\n\/\/ Verifies that, even with a different number of leading spaces, the\n\/\/ Reindent routine turns them into a uniform number of leading spaces.\n\/\/\n\/\/ Also throws in some trailing whitespace on the original to show it is\n\/\/ removed.\nTEST(UtilTest, ReindentsDifferentNumberOfLeadingSpacesUniformly) {\n  std::string original = R\"(   hello there\n      world)\";\n  std::string got = Reindent(original, \"  \");\n  std::string want = R\"(  hello there\n  world)\";\n  EXPECT_EQ(want, got);\n}\n\nTEST(UtilTest, HumanReadableNumFlopsExample) {\n  ASSERT_EQ(\"1.00GFLOP\/s\", HumanReadableNumFlops(1e9, 1e9));\n}\n\nTEST(UtilTest, CommaSeparatedString) {\n  EXPECT_EQ(CommaSeparatedString({}), \"\");\n  EXPECT_EQ(CommaSeparatedString({\"hello world\"}), \"hello world\");\n  EXPECT_EQ(CommaSeparatedString({1, 57, 2}, \"foo\", \"bar\"), \"foo1, 57, 2bar\");\n}\n\nTEST(UtilTest, VectorString) {\n  std::list<int64_t> empty_list;\n  EXPECT_EQ(VectorString(empty_list), \"()\");\n\n  std::vector<float> float_vector = {5.5};\n  EXPECT_EQ(VectorString(float_vector), \"(5.5)\");\n\n  std::set<const char*> string_set = {\"a\", \"b\"};\n  EXPECT_EQ(VectorString(string_set), \"(a, b)\");\n\n  EXPECT_EQ(VectorString({}), \"()\");\n  EXPECT_EQ(VectorString({1, 57, 2}), \"(1, 57, 2)\");\n}\n\nTEST(UtilTest, LogLines) {\n  \/\/ Just make sure this code runs (not verifying the output).\n  LogLines(tensorflow::INFO, \"hello\\n\\nworld\", __FILE__, __LINE__);\n}\n\nTEST(UtilTest, CommonFactors) {\n  struct {\n    std::vector<int64_t> a, b;\n    absl::InlinedVector<std::pair<int64_t, int64_t>, 8> expected;\n  } test_cases[] = {\n      {\/*.a =*\/{0}, \/*.b =*\/{0}, \/*.expected =*\/{{0, 0}, {1, 1}}},\n      {\/*.a =*\/{1}, \/*.b =*\/{}, \/*.expected =*\/{{0, 0}, {1, 0}}},\n      {\/*.a =*\/{}, \/*.b =*\/{1}, \/*.expected =*\/{{0, 0}, {0, 1}}},\n      {\/*.a =*\/{0, 10}, \/*.b =*\/{0, 10, 3}, \/*.expected =*\/{{0, 0}, {2, 3}}},\n      {\/*.a =*\/{1, 0}, \/*.b =*\/{1, 0, 1},\n       \/*.expected =*\/{{0, 0}, {1, 1}, {2, 2}, {2, 3}}},\n      {\/*.a =*\/{0, 1}, \/*.b =*\/{0, 1}, \/*.expected =*\/{{0, 0}, {1, 1}, {2, 2}}},\n      {\/*.a =*\/{}, \/*.b =*\/{}, \/*.expected =*\/{{0, 0}}},\n      {\/*.a =*\/{2, 5, 1, 3},\n       \/*.b =*\/{1, 10, 3, 1},\n       \/*.expected =*\/{{0, 0}, {0, 1}, {2, 2}, {3, 2}, {4, 3}, {4, 4}}},\n      {\/*.a =*\/{1, 1, 3},\n       \/*.b =*\/{1, 1, 3},\n       \/*.expected =*\/{{0, 0}, {1, 1}, {2, 2}, {3, 3}}},\n      \/\/ Splitting and combining dimensions.\n      {\/*.a =*\/{2, 6},\n       \/*.b =*\/{4, 3},\n       \/*.expected =*\/{{0, 0}, {2, 2}}},\n      {\/*.a =*\/{1, 2, 6},\n       \/*.b =*\/{4, 1, 3, 1},\n       \/*.expected =*\/{{0, 0}, {1, 0}, {3, 3}, {3, 4}}},\n      \/\/ Extra degenerated dimension (second and third dims in the output) forms\n      \/\/ single common factor group.\n      {\/*.a =*\/{1, 2, 1},\n       \/*.b =*\/{1, 1, 1, 2},\n       \/*.expected =*\/{{0, 0}, {1, 1}, {1, 2}, {1, 3}, {2, 4}, {3, 4}}}};\n  for (const auto& test_case : test_cases) {\n    EXPECT_EQ(test_case.expected, CommonFactors(test_case.a, test_case.b));\n  }\n}\n\nTEST(UtilTest, SanitizeFileName) {\n  EXPECT_EQ(SanitizeFileName(\"\"), \"\");\n  EXPECT_EQ(SanitizeFileName(\"abc\"), \"abc\");\n  EXPECT_EQ(SanitizeFileName(\"\/\\\\[]\"), \"____\");\n  EXPECT_EQ(SanitizeFileName(\"\/A\\\\B[C]\"), \"_A_B_C_\");\n}\n\nTEST(UtilTest, RoundTripFpToString) {\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<half>(\n                false, QuietNanWithoutPayload<half>())),\n            \"nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<half>(\n                true, QuietNanWithoutPayload<half>())),\n            \"-nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<bfloat16>(\n                false, QuietNanWithoutPayload<bfloat16>())),\n            \"nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<bfloat16>(\n                true, QuietNanWithoutPayload<bfloat16>())),\n            \"-nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<float>(\n                false, QuietNanWithoutPayload<float>())),\n            \"nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<float>(\n                true, QuietNanWithoutPayload<float>())),\n            \"-nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<double>(\n                false, QuietNanWithoutPayload<double>())),\n            \"nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<double>(\n                true, QuietNanWithoutPayload<double>())),\n            \"-nan\");\n\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<half>(false, 0x1)),\n            \"nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<half>(true, 0x1)),\n            \"-nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<bfloat16>(false, 0x1)),\n            \"nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<bfloat16>(true, 0x1)),\n            \"-nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<float>(false, 0x1)),\n            \"nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<float>(true, 0x1)),\n            \"-nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<double>(false, 0x1)),\n            \"nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<double>(true, 0x1)),\n            \"-nan(0x1)\");\n}\n\nTEST(UtilTest, SplitF64ToF32) {\n  \/\/ Overflowing the F32 exponent in SplitF64ToF32 should result in a pair of\n  \/\/ [∞,0].\n  EXPECT_EQ(SplitF64ToF32(std::numeric_limits<double>::max()).first,\n            std::numeric_limits<float>::infinity());\n  EXPECT_EQ(SplitF64ToF32(std::numeric_limits<double>::max()).second, 0.0f);\n}\n\n}  \/\/ namespace\n}  \/\/ namespace xla\n<commit_msg>Fix comparison of `const char*` strings with > and <<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\/xla\/util.h\"\n\n#include <limits>\n#include <list>\n\n#include \"tensorflow\/compiler\/xla\/test.h\"\n#include \"tensorflow\/compiler\/xla\/types.h\"\n\nnamespace xla {\nnamespace {\n\n\/\/ Verifies that, even with a different number of leading spaces, the\n\/\/ Reindent routine turns them into a uniform number of leading spaces.\n\/\/\n\/\/ Also throws in some trailing whitespace on the original to show it is\n\/\/ removed.\nTEST(UtilTest, ReindentsDifferentNumberOfLeadingSpacesUniformly) {\n  std::string original = R\"(   hello there\n      world)\";\n  std::string got = Reindent(original, \"  \");\n  std::string want = R\"(  hello there\n  world)\";\n  EXPECT_EQ(want, got);\n}\n\nTEST(UtilTest, HumanReadableNumFlopsExample) {\n  ASSERT_EQ(\"1.00GFLOP\/s\", HumanReadableNumFlops(1e9, 1e9));\n}\n\nTEST(UtilTest, CommaSeparatedString) {\n  EXPECT_EQ(CommaSeparatedString({}), \"\");\n  EXPECT_EQ(CommaSeparatedString({\"hello world\"}), \"hello world\");\n  EXPECT_EQ(CommaSeparatedString({1, 57, 2}, \"foo\", \"bar\"), \"foo1, 57, 2bar\");\n}\n\nTEST(UtilTest, VectorString) {\n  std::list<int64_t> empty_list;\n  EXPECT_EQ(VectorString(empty_list), \"()\");\n\n  std::vector<float> float_vector = {5.5};\n  EXPECT_EQ(VectorString(float_vector), \"(5.5)\");\n\n  std::set<std::string_view> string_set = {std::string_view(\"a\"),\n                                           std::string_view(\"b\")};\n  EXPECT_EQ(VectorString(string_set), \"(a, b)\");\n\n  EXPECT_EQ(VectorString({}), \"()\");\n  EXPECT_EQ(VectorString({1, 57, 2}), \"(1, 57, 2)\");\n}\n\nTEST(UtilTest, LogLines) {\n  \/\/ Just make sure this code runs (not verifying the output).\n  LogLines(tensorflow::INFO, \"hello\\n\\nworld\", __FILE__, __LINE__);\n}\n\nTEST(UtilTest, CommonFactors) {\n  struct {\n    std::vector<int64_t> a, b;\n    absl::InlinedVector<std::pair<int64_t, int64_t>, 8> expected;\n  } test_cases[] = {\n      {\/*.a =*\/{0}, \/*.b =*\/{0}, \/*.expected =*\/{{0, 0}, {1, 1}}},\n      {\/*.a =*\/{1}, \/*.b =*\/{}, \/*.expected =*\/{{0, 0}, {1, 0}}},\n      {\/*.a =*\/{}, \/*.b =*\/{1}, \/*.expected =*\/{{0, 0}, {0, 1}}},\n      {\/*.a =*\/{0, 10}, \/*.b =*\/{0, 10, 3}, \/*.expected =*\/{{0, 0}, {2, 3}}},\n      {\/*.a =*\/{1, 0}, \/*.b =*\/{1, 0, 1},\n       \/*.expected =*\/{{0, 0}, {1, 1}, {2, 2}, {2, 3}}},\n      {\/*.a =*\/{0, 1}, \/*.b =*\/{0, 1}, \/*.expected =*\/{{0, 0}, {1, 1}, {2, 2}}},\n      {\/*.a =*\/{}, \/*.b =*\/{}, \/*.expected =*\/{{0, 0}}},\n      {\/*.a =*\/{2, 5, 1, 3},\n       \/*.b =*\/{1, 10, 3, 1},\n       \/*.expected =*\/{{0, 0}, {0, 1}, {2, 2}, {3, 2}, {4, 3}, {4, 4}}},\n      {\/*.a =*\/{1, 1, 3},\n       \/*.b =*\/{1, 1, 3},\n       \/*.expected =*\/{{0, 0}, {1, 1}, {2, 2}, {3, 3}}},\n      \/\/ Splitting and combining dimensions.\n      {\/*.a =*\/{2, 6},\n       \/*.b =*\/{4, 3},\n       \/*.expected =*\/{{0, 0}, {2, 2}}},\n      {\/*.a =*\/{1, 2, 6},\n       \/*.b =*\/{4, 1, 3, 1},\n       \/*.expected =*\/{{0, 0}, {1, 0}, {3, 3}, {3, 4}}},\n      \/\/ Extra degenerated dimension (second and third dims in the output) forms\n      \/\/ single common factor group.\n      {\/*.a =*\/{1, 2, 1},\n       \/*.b =*\/{1, 1, 1, 2},\n       \/*.expected =*\/{{0, 0}, {1, 1}, {1, 2}, {1, 3}, {2, 4}, {3, 4}}}};\n  for (const auto& test_case : test_cases) {\n    EXPECT_EQ(test_case.expected, CommonFactors(test_case.a, test_case.b));\n  }\n}\n\nTEST(UtilTest, SanitizeFileName) {\n  EXPECT_EQ(SanitizeFileName(\"\"), \"\");\n  EXPECT_EQ(SanitizeFileName(\"abc\"), \"abc\");\n  EXPECT_EQ(SanitizeFileName(\"\/\\\\[]\"), \"____\");\n  EXPECT_EQ(SanitizeFileName(\"\/A\\\\B[C]\"), \"_A_B_C_\");\n}\n\nTEST(UtilTest, RoundTripFpToString) {\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<half>(\n                false, QuietNanWithoutPayload<half>())),\n            \"nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<half>(\n                true, QuietNanWithoutPayload<half>())),\n            \"-nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<bfloat16>(\n                false, QuietNanWithoutPayload<bfloat16>())),\n            \"nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<bfloat16>(\n                true, QuietNanWithoutPayload<bfloat16>())),\n            \"-nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<float>(\n                false, QuietNanWithoutPayload<float>())),\n            \"nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<float>(\n                true, QuietNanWithoutPayload<float>())),\n            \"-nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<double>(\n                false, QuietNanWithoutPayload<double>())),\n            \"nan\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<double>(\n                true, QuietNanWithoutPayload<double>())),\n            \"-nan\");\n\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<half>(false, 0x1)),\n            \"nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<half>(true, 0x1)),\n            \"-nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<bfloat16>(false, 0x1)),\n            \"nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<bfloat16>(true, 0x1)),\n            \"-nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<float>(false, 0x1)),\n            \"nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<float>(true, 0x1)),\n            \"-nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<double>(false, 0x1)),\n            \"nan(0x1)\");\n  EXPECT_EQ(RoundTripFpToString(NanWithSignAndPayload<double>(true, 0x1)),\n            \"-nan(0x1)\");\n}\n\nTEST(UtilTest, SplitF64ToF32) {\n  \/\/ Overflowing the F32 exponent in SplitF64ToF32 should result in a pair of\n  \/\/ [∞,0].\n  EXPECT_EQ(SplitF64ToF32(std::numeric_limits<double>::max()).first,\n            std::numeric_limits<float>::infinity());\n  EXPECT_EQ(SplitF64ToF32(std::numeric_limits<double>::max()).second, 0.0f);\n}\n\n}  \/\/ namespace\n}  \/\/ namespace xla\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- sanitizer_common.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 shared between AddressSanitizer and ThreadSanitizer\n\/\/ run-time libraries.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"sanitizer_common.h\"\n#include \"sanitizer_allocator_interface.h\"\n#include \"sanitizer_allocator_internal.h\"\n#include \"sanitizer_flags.h\"\n#include \"sanitizer_libc.h\"\n#include \"sanitizer_placement_new.h\"\n#include \"sanitizer_stacktrace_printer.h\"\n#include \"sanitizer_symbolizer.h\"\n\nnamespace __sanitizer {\n\nconst char *SanitizerToolName = \"SanitizerTool\";\n\natomic_uint32_t current_verbosity;\nuptr PageSizeCached;\n\n\/\/ PID of the tracer task in StopTheWorld. It shares the address space with the\n\/\/ main process, but has a different PID and thus requires special handling.\nuptr stoptheworld_tracer_pid = 0;\n\/\/ Cached pid of parent process - if the parent process dies, we want to keep\n\/\/ writing to the same log file.\nuptr stoptheworld_tracer_ppid = 0;\n\nStaticSpinMutex CommonSanitizerReportMutex;\n\nvoid NORETURN ReportMmapFailureAndDie(uptr size, const char *mem_type,\n                                      const char *mmap_type, error_t err,\n                                      bool raw_report) {\n  static int recursion_count;\n  if (raw_report || recursion_count) {\n    \/\/ If raw report is requested or we went into recursion, just die.\n    \/\/ The Report() and CHECK calls below may call mmap recursively and fail.\n    RawWrite(\"ERROR: Failed to mmap\\n\");\n    Die();\n  }\n  recursion_count++;\n  Report(\"ERROR: %s failed to \"\n         \"%s 0x%zx (%zd) bytes of %s (error code: %d)\\n\",\n         SanitizerToolName, mmap_type, size, size, mem_type, err);\n#if !SANITIZER_GO\n  DumpProcessMap();\n#endif\n  UNREACHABLE(\"unable to mmap\");\n}\n\ntypedef bool UptrComparisonFunction(const uptr &a, const uptr &b);\ntypedef bool U32ComparisonFunction(const u32 &a, const u32 &b);\n\ntemplate<class T>\nstatic inline bool CompareLess(const T &a, const T &b) {\n  return a < b;\n}\n\nvoid SortArray(uptr *array, uptr size) {\n  InternalSort<uptr*, UptrComparisonFunction>(&array, size, CompareLess);\n}\n\nvoid SortArray(u32 *array, uptr size) {\n  InternalSort<u32*, U32ComparisonFunction>(&array, size, CompareLess);\n}\n\nconst char *StripPathPrefix(const char *filepath,\n                            const char *strip_path_prefix) {\n  if (!filepath) return nullptr;\n  if (!strip_path_prefix) return filepath;\n  const char *res = filepath;\n  if (const char *pos = internal_strstr(filepath, strip_path_prefix))\n    res = pos + internal_strlen(strip_path_prefix);\n  if (res[0] == '.' && res[1] == '\/')\n    res += 2;\n  return res;\n}\n\nconst char *StripModuleName(const char *module) {\n  if (!module)\n    return nullptr;\n  if (SANITIZER_WINDOWS) {\n    \/\/ On Windows, both slash and backslash are possible.\n    \/\/ Pick the one that goes last.\n    if (const char *bslash_pos = internal_strrchr(module, '\\\\'))\n      return StripModuleName(bslash_pos + 1);\n  }\n  if (const char *slash_pos = internal_strrchr(module, '\/')) {\n    return slash_pos + 1;\n  }\n  return module;\n}\n\nvoid ReportErrorSummary(const char *error_message, const char *alt_tool_name) {\n  if (!common_flags()->print_summary)\n    return;\n  InternalScopedString buff(kMaxSummaryLength);\n  buff.append(\"SUMMARY: %s: %s\",\n              alt_tool_name ? alt_tool_name : SanitizerToolName, error_message);\n  __sanitizer_report_error_summary(buff.data());\n}\n\n#if !SANITIZER_GO\nvoid ReportErrorSummary(const char *error_type, const AddressInfo &info,\n                        const char *alt_tool_name) {\n  if (!common_flags()->print_summary) return;\n  InternalScopedString buff(kMaxSummaryLength);\n  buff.append(\"%s \", error_type);\n  RenderFrame(&buff, \"%L %F\", 0, info, common_flags()->symbolize_vs_style,\n              common_flags()->strip_path_prefix);\n  ReportErrorSummary(buff.data(), alt_tool_name);\n}\n#endif\n\n\/\/ Removes the ANSI escape sequences from the input string (in-place).\nvoid RemoveANSIEscapeSequencesFromString(char *str) {\n  if (!str)\n    return;\n\n  \/\/ We are going to remove the escape sequences in place.\n  char *s = str;\n  char *z = str;\n  while (*s != '\\0') {\n    CHECK_GE(s, z);\n    \/\/ Skip over ANSI escape sequences with pointer 's'.\n    if (*s == '\\033' && *(s + 1) == '[') {\n      s = internal_strchrnul(s, 'm');\n      if (*s == '\\0') {\n        break;\n      }\n      s++;\n      continue;\n    }\n    \/\/ 's' now points at a character we want to keep. Copy over the buffer\n    \/\/ content if the escape sequence has been perviously skipped andadvance\n    \/\/ both pointers.\n    if (s != z)\n      *z = *s;\n\n    \/\/ If we have not seen an escape sequence, just advance both pointers.\n    z++;\n    s++;\n  }\n\n  \/\/ Null terminate the string.\n  *z = '\\0';\n}\n\nvoid LoadedModule::set(const char *module_name, uptr base_address) {\n  clear();\n  full_name_ = internal_strdup(module_name);\n  base_address_ = base_address;\n}\n\nvoid LoadedModule::set(const char *module_name, uptr base_address,\n                       ModuleArch arch, u8 uuid[kModuleUUIDSize],\n                       bool instrumented) {\n  set(module_name, base_address);\n  arch_ = arch;\n  internal_memcpy(uuid_, uuid, sizeof(uuid_));\n  instrumented_ = instrumented;\n}\n\nvoid LoadedModule::clear() {\n  InternalFree(full_name_);\n  base_address_ = 0;\n  max_executable_address_ = 0;\n  full_name_ = nullptr;\n  arch_ = kModuleArchUnknown;\n  internal_memset(uuid_, 0, kModuleUUIDSize);\n  instrumented_ = false;\n  while (!ranges_.empty()) {\n    AddressRange *r = ranges_.front();\n    ranges_.pop_front();\n    InternalFree(r);\n  }\n}\n\nvoid LoadedModule::addAddressRange(uptr beg, uptr end, bool executable,\n                                   bool writable, const char *name) {\n  void *mem = InternalAlloc(sizeof(AddressRange));\n  AddressRange *r =\n      new(mem) AddressRange(beg, end, executable, writable, name);\n  ranges_.push_back(r);\n  if (executable && end > max_executable_address_)\n    max_executable_address_ = end;\n}\n\nbool LoadedModule::containsAddress(uptr address) const {\n  for (const AddressRange &r : ranges()) {\n    if (r.beg <= address && address < r.end)\n      return true;\n  }\n  return false;\n}\n\nstatic atomic_uintptr_t g_total_mmaped;\n\nvoid IncreaseTotalMmap(uptr size) {\n  if (!common_flags()->mmap_limit_mb) return;\n  uptr total_mmaped =\n      atomic_fetch_add(&g_total_mmaped, size, memory_order_relaxed) + size;\n  \/\/ Since for now mmap_limit_mb is not a user-facing flag, just kill\n  \/\/ a program. Use RAW_CHECK to avoid extra mmaps in reporting.\n  RAW_CHECK((total_mmaped >> 20) < common_flags()->mmap_limit_mb);\n}\n\nvoid DecreaseTotalMmap(uptr size) {\n  if (!common_flags()->mmap_limit_mb) return;\n  atomic_fetch_sub(&g_total_mmaped, size, memory_order_relaxed);\n}\n\nbool TemplateMatch(const char *templ, const char *str) {\n  if ((!str) || str[0] == 0)\n    return false;\n  bool start = false;\n  if (templ && templ[0] == '^') {\n    start = true;\n    templ++;\n  }\n  bool asterisk = false;\n  while (templ && templ[0]) {\n    if (templ[0] == '*') {\n      templ++;\n      start = false;\n      asterisk = true;\n      continue;\n    }\n    if (templ[0] == '$')\n      return str[0] == 0 || asterisk;\n    if (str[0] == 0)\n      return false;\n    char *tpos = (char*)internal_strchr(templ, '*');\n    char *tpos1 = (char*)internal_strchr(templ, '$');\n    if ((!tpos) || (tpos1 && tpos1 < tpos))\n      tpos = tpos1;\n    if (tpos)\n      tpos[0] = 0;\n    const char *str0 = str;\n    const char *spos = internal_strstr(str, templ);\n    str = spos + internal_strlen(templ);\n    templ = tpos;\n    if (tpos)\n      tpos[0] = tpos == tpos1 ? '$' : '*';\n    if (!spos)\n      return false;\n    if (start && spos != str0)\n      return false;\n    start = false;\n    asterisk = false;\n  }\n  return true;\n}\n\nstatic char binary_name_cache_str[kMaxPathLength];\nstatic char process_name_cache_str[kMaxPathLength];\n\nconst char *GetProcessName() {\n  return process_name_cache_str;\n}\n\nstatic uptr ReadProcessName(\/*out*\/ char *buf, uptr buf_len) {\n  ReadLongProcessName(buf, buf_len);\n  char *s = const_cast<char *>(StripModuleName(buf));\n  uptr len = internal_strlen(s);\n  if (s != buf) {\n    internal_memmove(buf, s, len);\n    buf[len] = '\\0';\n  }\n  return len;\n}\n\nvoid UpdateProcessName() {\n  ReadProcessName(process_name_cache_str, sizeof(process_name_cache_str));\n}\n\n\/\/ Call once to make sure that binary_name_cache_str is initialized\nvoid CacheBinaryName() {\n  if (binary_name_cache_str[0] != '\\0')\n    return;\n  ReadBinaryName(binary_name_cache_str, sizeof(binary_name_cache_str));\n  ReadProcessName(process_name_cache_str, sizeof(process_name_cache_str));\n}\n\nuptr ReadBinaryNameCached(\/*out*\/char *buf, uptr buf_len) {\n  CacheBinaryName();\n  uptr name_len = internal_strlen(binary_name_cache_str);\n  name_len = (name_len < buf_len - 1) ? name_len : buf_len - 1;\n  if (buf_len == 0)\n    return 0;\n  internal_memcpy(buf, binary_name_cache_str, name_len);\n  buf[name_len] = '\\0';\n  return name_len;\n}\n\nvoid PrintCmdline() {\n  char **argv = GetArgv();\n  if (!argv) return;\n  Printf(\"\\nCommand: \");\n  for (uptr i = 0; argv[i]; ++i)\n    Printf(\"%s \", argv[i]);\n  Printf(\"\\n\\n\");\n}\n\n\/\/ Malloc hooks.\nstatic const int kMaxMallocFreeHooks = 5;\nstruct MallocFreeHook {\n  void (*malloc_hook)(const void *, uptr);\n  void (*free_hook)(const void *);\n};\n\nstatic MallocFreeHook MFHooks[kMaxMallocFreeHooks];\n\nvoid RunMallocHooks(const void *ptr, uptr size) {\n  for (int i = 0; i < kMaxMallocFreeHooks; i++) {\n    auto hook = MFHooks[i].malloc_hook;\n    if (!hook) return;\n    hook(ptr, size);\n  }\n}\n\nvoid RunFreeHooks(const void *ptr) {\n  for (int i = 0; i < kMaxMallocFreeHooks; i++) {\n    auto hook = MFHooks[i].free_hook;\n    if (!hook) return;\n    hook(ptr);\n  }\n}\n\nstatic int InstallMallocFreeHooks(void (*malloc_hook)(const void *, uptr),\n                                  void (*free_hook)(const void *)) {\n  if (!malloc_hook || !free_hook) return 0;\n  for (int i = 0; i < kMaxMallocFreeHooks; i++) {\n    if (MFHooks[i].malloc_hook == nullptr) {\n      MFHooks[i].malloc_hook = malloc_hook;\n      MFHooks[i].free_hook = free_hook;\n      return i + 1;\n    }\n  }\n  return 0;\n}\n\nstatic const u32 kUnclaimedTid = 0xfffffe;\nstatic atomic_uint32_t reporting_thread_tid = {kUnclaimedTid};\n\nScopedErrorReportLock::ScopedErrorReportLock(u32 current_tid) {\n  for (;;) {\n    u32 expected_tid = kUnclaimedTid;\n    if (current_tid == kUnclaimedTid ||\n        atomic_compare_exchange_strong(&reporting_thread_tid, &expected_tid,\n                                       current_tid, memory_order_relaxed)) {\n      \/\/ We've claimed reporting_thread_tid_ so proceed.\n      CommonSanitizerReportMutex.Lock();\n      return;\n    }\n\n    if (expected_tid == current_tid) {\n      \/\/ This is either asynch signal or nested error during error reporting.\n      \/\/ Fail simple to avoid deadlocks in Report().\n\n      \/\/ Can't use Report() here because of potential deadlocks in nested\n      \/\/ signal handlers.\n      static const char msg[] =\n          \"AddressSanitizer: nested bug in the same thread, aborting.\\n\";\n      CatastrophicErrorWrite(msg, sizeof(msg) - 1);\n\n      internal__exit(common_flags()->exitcode);\n    }\n\n    internal_sched_yield();\n  }\n}\n\nScopedErrorReportLock::~ScopedErrorReportLock() {\n  CommonSanitizerReportMutex.Unlock();\n  atomic_store_relaxed(&reporting_thread_tid, kUnclaimedTid);\n}\n\n} \/\/ namespace __sanitizer\n\nusing namespace __sanitizer;  \/\/ NOLINT\n\nextern \"C\" {\nSANITIZER_INTERFACE_WEAK_DEF(void, __sanitizer_report_error_summary,\n                             const char *error_summary) {\n  Printf(\"%s\\n\", error_summary);\n}\n\nSANITIZER_INTERFACE_ATTRIBUTE\nvoid __sanitizer_set_death_callback(void (*callback)(void)) {\n  SetUserDieCallback(callback);\n}\n\nSANITIZER_INTERFACE_ATTRIBUTE\nint __sanitizer_install_malloc_and_free_hooks(void (*malloc_hook)(const void *,\n                                                                  uptr),\n                                              void (*free_hook)(const void *)) {\n  return InstallMallocFreeHooks(malloc_hook, free_hook);\n}\n} \/\/ extern \"C\"\n<commit_msg>[sanitizer] Replace AddressSanitizer with correct tool name<commit_after>\/\/===-- sanitizer_common.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 shared between AddressSanitizer and ThreadSanitizer\n\/\/ run-time libraries.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"sanitizer_common.h\"\n#include \"sanitizer_allocator_interface.h\"\n#include \"sanitizer_allocator_internal.h\"\n#include \"sanitizer_flags.h\"\n#include \"sanitizer_libc.h\"\n#include \"sanitizer_placement_new.h\"\n#include \"sanitizer_stacktrace_printer.h\"\n#include \"sanitizer_symbolizer.h\"\n\nnamespace __sanitizer {\n\nconst char *SanitizerToolName = \"SanitizerTool\";\n\natomic_uint32_t current_verbosity;\nuptr PageSizeCached;\n\n\/\/ PID of the tracer task in StopTheWorld. It shares the address space with the\n\/\/ main process, but has a different PID and thus requires special handling.\nuptr stoptheworld_tracer_pid = 0;\n\/\/ Cached pid of parent process - if the parent process dies, we want to keep\n\/\/ writing to the same log file.\nuptr stoptheworld_tracer_ppid = 0;\n\nStaticSpinMutex CommonSanitizerReportMutex;\n\nvoid NORETURN ReportMmapFailureAndDie(uptr size, const char *mem_type,\n                                      const char *mmap_type, error_t err,\n                                      bool raw_report) {\n  static int recursion_count;\n  if (raw_report || recursion_count) {\n    \/\/ If raw report is requested or we went into recursion, just die.\n    \/\/ The Report() and CHECK calls below may call mmap recursively and fail.\n    RawWrite(\"ERROR: Failed to mmap\\n\");\n    Die();\n  }\n  recursion_count++;\n  Report(\"ERROR: %s failed to \"\n         \"%s 0x%zx (%zd) bytes of %s (error code: %d)\\n\",\n         SanitizerToolName, mmap_type, size, size, mem_type, err);\n#if !SANITIZER_GO\n  DumpProcessMap();\n#endif\n  UNREACHABLE(\"unable to mmap\");\n}\n\ntypedef bool UptrComparisonFunction(const uptr &a, const uptr &b);\ntypedef bool U32ComparisonFunction(const u32 &a, const u32 &b);\n\ntemplate<class T>\nstatic inline bool CompareLess(const T &a, const T &b) {\n  return a < b;\n}\n\nvoid SortArray(uptr *array, uptr size) {\n  InternalSort<uptr*, UptrComparisonFunction>(&array, size, CompareLess);\n}\n\nvoid SortArray(u32 *array, uptr size) {\n  InternalSort<u32*, U32ComparisonFunction>(&array, size, CompareLess);\n}\n\nconst char *StripPathPrefix(const char *filepath,\n                            const char *strip_path_prefix) {\n  if (!filepath) return nullptr;\n  if (!strip_path_prefix) return filepath;\n  const char *res = filepath;\n  if (const char *pos = internal_strstr(filepath, strip_path_prefix))\n    res = pos + internal_strlen(strip_path_prefix);\n  if (res[0] == '.' && res[1] == '\/')\n    res += 2;\n  return res;\n}\n\nconst char *StripModuleName(const char *module) {\n  if (!module)\n    return nullptr;\n  if (SANITIZER_WINDOWS) {\n    \/\/ On Windows, both slash and backslash are possible.\n    \/\/ Pick the one that goes last.\n    if (const char *bslash_pos = internal_strrchr(module, '\\\\'))\n      return StripModuleName(bslash_pos + 1);\n  }\n  if (const char *slash_pos = internal_strrchr(module, '\/')) {\n    return slash_pos + 1;\n  }\n  return module;\n}\n\nvoid ReportErrorSummary(const char *error_message, const char *alt_tool_name) {\n  if (!common_flags()->print_summary)\n    return;\n  InternalScopedString buff(kMaxSummaryLength);\n  buff.append(\"SUMMARY: %s: %s\",\n              alt_tool_name ? alt_tool_name : SanitizerToolName, error_message);\n  __sanitizer_report_error_summary(buff.data());\n}\n\n#if !SANITIZER_GO\nvoid ReportErrorSummary(const char *error_type, const AddressInfo &info,\n                        const char *alt_tool_name) {\n  if (!common_flags()->print_summary) return;\n  InternalScopedString buff(kMaxSummaryLength);\n  buff.append(\"%s \", error_type);\n  RenderFrame(&buff, \"%L %F\", 0, info, common_flags()->symbolize_vs_style,\n              common_flags()->strip_path_prefix);\n  ReportErrorSummary(buff.data(), alt_tool_name);\n}\n#endif\n\n\/\/ Removes the ANSI escape sequences from the input string (in-place).\nvoid RemoveANSIEscapeSequencesFromString(char *str) {\n  if (!str)\n    return;\n\n  \/\/ We are going to remove the escape sequences in place.\n  char *s = str;\n  char *z = str;\n  while (*s != '\\0') {\n    CHECK_GE(s, z);\n    \/\/ Skip over ANSI escape sequences with pointer 's'.\n    if (*s == '\\033' && *(s + 1) == '[') {\n      s = internal_strchrnul(s, 'm');\n      if (*s == '\\0') {\n        break;\n      }\n      s++;\n      continue;\n    }\n    \/\/ 's' now points at a character we want to keep. Copy over the buffer\n    \/\/ content if the escape sequence has been perviously skipped andadvance\n    \/\/ both pointers.\n    if (s != z)\n      *z = *s;\n\n    \/\/ If we have not seen an escape sequence, just advance both pointers.\n    z++;\n    s++;\n  }\n\n  \/\/ Null terminate the string.\n  *z = '\\0';\n}\n\nvoid LoadedModule::set(const char *module_name, uptr base_address) {\n  clear();\n  full_name_ = internal_strdup(module_name);\n  base_address_ = base_address;\n}\n\nvoid LoadedModule::set(const char *module_name, uptr base_address,\n                       ModuleArch arch, u8 uuid[kModuleUUIDSize],\n                       bool instrumented) {\n  set(module_name, base_address);\n  arch_ = arch;\n  internal_memcpy(uuid_, uuid, sizeof(uuid_));\n  instrumented_ = instrumented;\n}\n\nvoid LoadedModule::clear() {\n  InternalFree(full_name_);\n  base_address_ = 0;\n  max_executable_address_ = 0;\n  full_name_ = nullptr;\n  arch_ = kModuleArchUnknown;\n  internal_memset(uuid_, 0, kModuleUUIDSize);\n  instrumented_ = false;\n  while (!ranges_.empty()) {\n    AddressRange *r = ranges_.front();\n    ranges_.pop_front();\n    InternalFree(r);\n  }\n}\n\nvoid LoadedModule::addAddressRange(uptr beg, uptr end, bool executable,\n                                   bool writable, const char *name) {\n  void *mem = InternalAlloc(sizeof(AddressRange));\n  AddressRange *r =\n      new(mem) AddressRange(beg, end, executable, writable, name);\n  ranges_.push_back(r);\n  if (executable && end > max_executable_address_)\n    max_executable_address_ = end;\n}\n\nbool LoadedModule::containsAddress(uptr address) const {\n  for (const AddressRange &r : ranges()) {\n    if (r.beg <= address && address < r.end)\n      return true;\n  }\n  return false;\n}\n\nstatic atomic_uintptr_t g_total_mmaped;\n\nvoid IncreaseTotalMmap(uptr size) {\n  if (!common_flags()->mmap_limit_mb) return;\n  uptr total_mmaped =\n      atomic_fetch_add(&g_total_mmaped, size, memory_order_relaxed) + size;\n  \/\/ Since for now mmap_limit_mb is not a user-facing flag, just kill\n  \/\/ a program. Use RAW_CHECK to avoid extra mmaps in reporting.\n  RAW_CHECK((total_mmaped >> 20) < common_flags()->mmap_limit_mb);\n}\n\nvoid DecreaseTotalMmap(uptr size) {\n  if (!common_flags()->mmap_limit_mb) return;\n  atomic_fetch_sub(&g_total_mmaped, size, memory_order_relaxed);\n}\n\nbool TemplateMatch(const char *templ, const char *str) {\n  if ((!str) || str[0] == 0)\n    return false;\n  bool start = false;\n  if (templ && templ[0] == '^') {\n    start = true;\n    templ++;\n  }\n  bool asterisk = false;\n  while (templ && templ[0]) {\n    if (templ[0] == '*') {\n      templ++;\n      start = false;\n      asterisk = true;\n      continue;\n    }\n    if (templ[0] == '$')\n      return str[0] == 0 || asterisk;\n    if (str[0] == 0)\n      return false;\n    char *tpos = (char*)internal_strchr(templ, '*');\n    char *tpos1 = (char*)internal_strchr(templ, '$');\n    if ((!tpos) || (tpos1 && tpos1 < tpos))\n      tpos = tpos1;\n    if (tpos)\n      tpos[0] = 0;\n    const char *str0 = str;\n    const char *spos = internal_strstr(str, templ);\n    str = spos + internal_strlen(templ);\n    templ = tpos;\n    if (tpos)\n      tpos[0] = tpos == tpos1 ? '$' : '*';\n    if (!spos)\n      return false;\n    if (start && spos != str0)\n      return false;\n    start = false;\n    asterisk = false;\n  }\n  return true;\n}\n\nstatic char binary_name_cache_str[kMaxPathLength];\nstatic char process_name_cache_str[kMaxPathLength];\n\nconst char *GetProcessName() {\n  return process_name_cache_str;\n}\n\nstatic uptr ReadProcessName(\/*out*\/ char *buf, uptr buf_len) {\n  ReadLongProcessName(buf, buf_len);\n  char *s = const_cast<char *>(StripModuleName(buf));\n  uptr len = internal_strlen(s);\n  if (s != buf) {\n    internal_memmove(buf, s, len);\n    buf[len] = '\\0';\n  }\n  return len;\n}\n\nvoid UpdateProcessName() {\n  ReadProcessName(process_name_cache_str, sizeof(process_name_cache_str));\n}\n\n\/\/ Call once to make sure that binary_name_cache_str is initialized\nvoid CacheBinaryName() {\n  if (binary_name_cache_str[0] != '\\0')\n    return;\n  ReadBinaryName(binary_name_cache_str, sizeof(binary_name_cache_str));\n  ReadProcessName(process_name_cache_str, sizeof(process_name_cache_str));\n}\n\nuptr ReadBinaryNameCached(\/*out*\/char *buf, uptr buf_len) {\n  CacheBinaryName();\n  uptr name_len = internal_strlen(binary_name_cache_str);\n  name_len = (name_len < buf_len - 1) ? name_len : buf_len - 1;\n  if (buf_len == 0)\n    return 0;\n  internal_memcpy(buf, binary_name_cache_str, name_len);\n  buf[name_len] = '\\0';\n  return name_len;\n}\n\nvoid PrintCmdline() {\n  char **argv = GetArgv();\n  if (!argv) return;\n  Printf(\"\\nCommand: \");\n  for (uptr i = 0; argv[i]; ++i)\n    Printf(\"%s \", argv[i]);\n  Printf(\"\\n\\n\");\n}\n\n\/\/ Malloc hooks.\nstatic const int kMaxMallocFreeHooks = 5;\nstruct MallocFreeHook {\n  void (*malloc_hook)(const void *, uptr);\n  void (*free_hook)(const void *);\n};\n\nstatic MallocFreeHook MFHooks[kMaxMallocFreeHooks];\n\nvoid RunMallocHooks(const void *ptr, uptr size) {\n  for (int i = 0; i < kMaxMallocFreeHooks; i++) {\n    auto hook = MFHooks[i].malloc_hook;\n    if (!hook) return;\n    hook(ptr, size);\n  }\n}\n\nvoid RunFreeHooks(const void *ptr) {\n  for (int i = 0; i < kMaxMallocFreeHooks; i++) {\n    auto hook = MFHooks[i].free_hook;\n    if (!hook) return;\n    hook(ptr);\n  }\n}\n\nstatic int InstallMallocFreeHooks(void (*malloc_hook)(const void *, uptr),\n                                  void (*free_hook)(const void *)) {\n  if (!malloc_hook || !free_hook) return 0;\n  for (int i = 0; i < kMaxMallocFreeHooks; i++) {\n    if (MFHooks[i].malloc_hook == nullptr) {\n      MFHooks[i].malloc_hook = malloc_hook;\n      MFHooks[i].free_hook = free_hook;\n      return i + 1;\n    }\n  }\n  return 0;\n}\n\nstatic const u32 kUnclaimedTid = 0xfffffe;\nstatic atomic_uint32_t reporting_thread_tid = {kUnclaimedTid};\n\nScopedErrorReportLock::ScopedErrorReportLock(u32 current_tid) {\n  for (;;) {\n    u32 expected_tid = kUnclaimedTid;\n    if (current_tid == kUnclaimedTid ||\n        atomic_compare_exchange_strong(&reporting_thread_tid, &expected_tid,\n                                       current_tid, memory_order_relaxed)) {\n      \/\/ We've claimed reporting_thread_tid_ so proceed.\n      CommonSanitizerReportMutex.Lock();\n      return;\n    }\n\n    if (expected_tid == current_tid) {\n      \/\/ This is either asynch signal or nested error during error reporting.\n      \/\/ Fail simple to avoid deadlocks in Report().\n\n      \/\/ Can't use Report() here because of potential deadlocks in nested\n      \/\/ signal handlers.\n      CatastrophicErrorWrite(SanitizerToolName,\n                             internal_strlen(SanitizerToolName));\n      static const char msg[] = \": nested bug in the same thread, aborting.\\n\";\n      CatastrophicErrorWrite(msg, sizeof(msg) - 1);\n\n      internal__exit(common_flags()->exitcode);\n    }\n\n    internal_sched_yield();\n  }\n}\n\nScopedErrorReportLock::~ScopedErrorReportLock() {\n  CommonSanitizerReportMutex.Unlock();\n  atomic_store_relaxed(&reporting_thread_tid, kUnclaimedTid);\n}\n\n} \/\/ namespace __sanitizer\n\nusing namespace __sanitizer;  \/\/ NOLINT\n\nextern \"C\" {\nSANITIZER_INTERFACE_WEAK_DEF(void, __sanitizer_report_error_summary,\n                             const char *error_summary) {\n  Printf(\"%s\\n\", error_summary);\n}\n\nSANITIZER_INTERFACE_ATTRIBUTE\nvoid __sanitizer_set_death_callback(void (*callback)(void)) {\n  SetUserDieCallback(callback);\n}\n\nSANITIZER_INTERFACE_ATTRIBUTE\nint __sanitizer_install_malloc_and_free_hooks(void (*malloc_hook)(const void *,\n                                                                  uptr),\n                                              void (*free_hook)(const void *)) {\n  return InstallMallocFreeHooks(malloc_hook, free_hook);\n}\n} \/\/ extern \"C\"\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\n\n#include <omp.h>\n\n\nint N = 10;\n\n\nvoid partition (int *mas, int *left, int *right)\n{\n    int pivot = 0;\n    int elem1;\n    int elem2;\n\n    while (1) {\n        elem1 = *(mas + (*left));\n        elem2 = *(mas + (*right));\n\n        while (elem1 < *(mas + pivot)) {\n            ++(*left);\n            elem1 = *(mas + (*left));\n        }\n \n        while (elem2 > *(mas + pivot)) {\n            --(*right);\n            elem2 = *(mas + (*right));\n        }\n \n        if ((*left) < (*right)) {\n            std::swap (*(mas + (*left)), *(mas + (*right)));\n            if ((*left) == pivot) {\n                pivot = (*right);\n                if (elem1 == elem2) {\n                    ++(*left);\n                }\n            } else if ((*right) == pivot) {\n                pivot = (*left);\n                if (elem1 == elem2) {\n                    --(*right);\n                }\n            }\n        } else {\n            break;\n        }\n    }\n}\n\n\nvoid quick_sort (int *mas, int size)\n{\n    int i = 0, j = size - 1;\n\n    partition (mas, &i, &j);\n\n    if (i >= 1) {\n        quick_sort (mas, i);\n    }\n    if (size - (j + 1) > 1) {\n        quick_sort (mas + i + 1, size - (j + 1));\n    }\n}\n\n\nvoid quick_sort_mt (int *mas, int size)\n{\n    int i = 0, j = size - 1;\n\n    partition (mas, &i, &j);\n\n    #pragma omp parallel sections num_threads (2)\n    {\n        #pragma omp section\n        {\n            if (i >= 1) {\n                quick_sort_mt (mas, i);\n            }\n        }\n        \n        #pragma omp section\n        {\n            if (size - (j + 1) > 1) {\n                quick_sort_mt (mas + i + 1, size - (j + 1));\n            }\n        }\n    }\n}\n\n\nint main (int argc, char *argv[])\n{\n    omp_set_nested (1);\n    omp_set_max_active_levels (omp_get_num_threads ());\n\n    if (argc >= 2) {\n        N = atoi (argv[1]);\n    }\n\n    std::ofstream fout;\n \n    fout.open (\"res_02.txt\");\n    fout << \"Massive:\\n\";\n   \n    int *mas1, *mas2;\n\n    mas1 = new int[N];\n    mas2 = new int[N];\n\n    srand (time (NULL));\n    \n    for (int i = 0; i < N; ++i) {\n        mas1[i] = rand () % 100;\n        fout << mas1[i] << \" \";\n    }\n    fout << std::endl;\n    fout << \"Simple quick sort:\\n\";\n\n    memcpy (mas2, mas1, sizeof (int) * N);\n\n    clock_t start, end;\n\n    start = clock ();\n    quick_sort (mas1, N);\n    end = clock ();\n\n    std::cout << \"Simple quick sort:\\n\";\n    std::cout << (end - start) \/ 1000000.00 << std::endl;\n\n    for (int i = 0; i < N; ++i) {\n        fout << mas1[i] << \" \";\n    }\n    fout << std::endl;\n\n    fout << \"Multithreading quick sort:\\n\";\n\n    start = clock ();\n    quick_sort_mt (mas2, N);\n    end = clock ();\n\n    std::cout << \"Multithreading quick sort:\\n\";\n    std::cout << (end - start) \/ 1000000.00 << std::endl;\n\n    for (int i = 0; i < N; ++i) {\n        fout << mas2[i] << \" \";\n    }\n    fout << std::endl;\n\n    fout.close ();\n\n    delete[] mas1;\n    delete[] mas2;\n\n    return 0;\n}\n<commit_msg>Update prog_02.cpp<commit_after>\/*\n * Quick Sort OpenMP\n *\/\n#include <iostream>\n#include <fstream>\n\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\n\n#include <omp.h>\n\nint N = 10;         \/\/ Massive size\n\n\nvoid partition (int *mas, int *left, int *right)\n{\n    int pivot = 0;\n    int elem1;\n    int elem2;\n\n    while (1) {\n        elem1 = *(mas + (*left));\n        elem2 = *(mas + (*right));\n\n        while (elem1 < *(mas + pivot)) {\n            ++(*left);\n            elem1 = *(mas + (*left));\n        }\n \n        while (elem2 > *(mas + pivot)) {\n            --(*right);\n            elem2 = *(mas + (*right));\n        }\n \n        if ((*left) < (*right)) {\n            std::swap (*(mas + (*left)), *(mas + (*right)));\n            if ((*left) == pivot) {\n                pivot = (*right);\n                if (elem1 == elem2) {\n                    ++(*left);\n                }\n            } else if ((*right) == pivot) {\n                pivot = (*left);\n                if (elem1 == elem2) {\n                    --(*right);\n                }\n            }\n        } else {\n            break;\n        }\n    }\n}\n\n\nvoid quick_sort (int *mas, int size)\n{\n    int i = 0, j = size - 1;\n\n    partition (mas, &i, &j);\n\n    if (i >= 1) {\n        quick_sort (mas, i);\n    }\n    if (size - (j + 1) > 1) {\n        quick_sort (mas + i + 1, size - (j + 1));\n    }\n}\n\n\nvoid quick_sort_mt (int *mas, int size)\n{\n    int i = 0, j = size - 1;\n\n    partition (mas, &i, &j);\n\n    #pragma omp parallel sections num_threads (2)\n    {\n        #pragma omp section\n        {\n            if (i >= 1) {\n                quick_sort_mt (mas, i);\n            }\n        }\n        \n        #pragma omp section\n        {\n            if (size - (j + 1) > 1) {\n                quick_sort_mt (mas + i + 1, size - (j + 1));\n            }\n        }\n    }\n}\n\n\nint main (int argc, char *argv[])\n{\n    omp_set_nested (1);\n    omp_set_max_active_levels (omp_get_num_threads ());\n\n    if (argc >= 2) {\n        N = atoi (argv[1]);\n    }\n\n    std::ofstream fout;\n \n    fout.open (\"res_02.txt\");\n    fout << \"Massive:\\n\";\n   \n    int *mas1, *mas2;\n\n    mas1 = new int[N];\n    mas2 = new int[N];\n\n    srand (time (NULL));\n    \n    for (int i = 0; i < N; ++i) {\n        mas1[i] = rand () % 100;\n        fout << mas1[i] << \" \";\n    }\n    fout << std::endl;\n    fout << \"Simple quick sort:\\n\";\n\n    memcpy (mas2, mas1, sizeof (int) * N);\n\n    clock_t start, end;\n\n    start = clock ();\n    quick_sort (mas1, N);\n    end = clock ();\n\n    std::cout << \"Simple quick sort:\\n\";\n    std::cout << (end - start) \/ 1000000.00 << std::endl;\n\n    for (int i = 0; i < N; ++i) {\n        fout << mas1[i] << \" \";\n    }\n    fout << std::endl;\n\n    fout << \"Multithreading quick sort:\\n\";\n\n    start = clock ();\n    quick_sort_mt (mas2, N);\n    end = clock ();\n\n    std::cout << \"Multithreading quick sort:\\n\";\n    std::cout << (end - start) \/ 1000000.00 << std::endl;\n\n    for (int i = 0; i < N; ++i) {\n        fout << mas2[i] << \" \";\n    }\n    fout << std::endl;\n\n    fout.close ();\n\n    delete[] mas1;\n    delete[] mas2;\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2017 WebAssembly Community Group participants\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"ir\/load-utils.h\"\n#include \"ir\/utils.h\"\n#include \"support\/hash.h\"\n\nnamespace wasm {\n\nnamespace ExpressionManipulator {\n\nExpression*\nflexibleCopy(Expression* original, Module& wasm, CustomCopier custom) {\n  struct Copier : public OverriddenVisitor<Copier, Expression*> {\n    Module& wasm;\n    CustomCopier custom;\n\n    Builder builder;\n\n    Copier(Module& wasm, CustomCopier custom)\n      : wasm(wasm), custom(custom), builder(wasm) {}\n\n    Expression* copy(Expression* curr) {\n      if (!curr) {\n        return nullptr;\n      }\n      auto* ret = custom(curr);\n      if (ret) {\n        return ret;\n      }\n      return OverriddenVisitor<Copier, Expression*>::visit(curr);\n    }\n\n    Expression* visitBlock(Block* curr) {\n      ExpressionList list(wasm.allocator);\n      for (Index i = 0; i < curr->list.size(); i++) {\n        list.push_back(copy(curr->list[i]));\n      }\n      return builder.makeBlock(curr->name, list, curr->type);\n    }\n    Expression* visitIf(If* curr) {\n      return builder.makeIf(copy(curr->condition),\n                            copy(curr->ifTrue),\n                            copy(curr->ifFalse),\n                            curr->type);\n    }\n    Expression* visitLoop(Loop* curr) {\n      return builder.makeLoop(curr->name, copy(curr->body));\n    }\n    Expression* visitBreak(Break* curr) {\n      return builder.makeBreak(\n        curr->name, copy(curr->value), copy(curr->condition));\n    }\n    Expression* visitSwitch(Switch* curr) {\n      return builder.makeSwitch(curr->targets,\n                                curr->default_,\n                                copy(curr->condition),\n                                copy(curr->value));\n    }\n    Expression* visitCall(Call* curr) {\n      auto* ret =\n        builder.makeCall(curr->target, {}, curr->type, curr->isReturn);\n      for (Index i = 0; i < curr->operands.size(); i++) {\n        ret->operands.push_back(copy(curr->operands[i]));\n      }\n      return ret;\n    }\n    Expression* visitCallIndirect(CallIndirect* curr) {\n      auto* ret = builder.makeCallIndirect(\n        curr->fullType, copy(curr->target), {}, curr->type, curr->isReturn);\n      for (Index i = 0; i < curr->operands.size(); i++) {\n        ret->operands.push_back(copy(curr->operands[i]));\n      }\n      return ret;\n    }\n    Expression* visitLocalGet(LocalGet* curr) {\n      return builder.makeLocalGet(curr->index, curr->type);\n    }\n    Expression* visitLocalSet(LocalSet* curr) {\n      if (curr->isTee()) {\n        return builder.makeLocalTee(curr->index, copy(curr->value));\n      } else {\n        return builder.makeLocalSet(curr->index, copy(curr->value));\n      }\n    }\n    Expression* visitGlobalGet(GlobalGet* curr) {\n      return builder.makeGlobalGet(curr->name, curr->type);\n    }\n    Expression* visitGlobalSet(GlobalSet* curr) {\n      return builder.makeGlobalSet(curr->name, copy(curr->value));\n    }\n    Expression* visitLoad(Load* curr) {\n      if (curr->isAtomic) {\n        return builder.makeAtomicLoad(\n          curr->bytes, curr->offset, copy(curr->ptr), curr->type);\n      }\n      return builder.makeLoad(curr->bytes,\n                              LoadUtils::isSignRelevant(curr) ? curr->signed_\n                                                              : false,\n                              curr->offset,\n                              curr->align,\n                              copy(curr->ptr),\n                              curr->type);\n    }\n    Expression* visitStore(Store* curr) {\n      if (curr->isAtomic) {\n        return builder.makeAtomicStore(curr->bytes,\n                                       curr->offset,\n                                       copy(curr->ptr),\n                                       copy(curr->value),\n                                       curr->valueType);\n      }\n      return builder.makeStore(curr->bytes,\n                               curr->offset,\n                               curr->align,\n                               copy(curr->ptr),\n                               copy(curr->value),\n                               curr->valueType);\n    }\n    Expression* visitAtomicRMW(AtomicRMW* curr) {\n      return builder.makeAtomicRMW(curr->op,\n                                   curr->bytes,\n                                   curr->offset,\n                                   copy(curr->ptr),\n                                   copy(curr->value),\n                                   curr->type);\n    }\n    Expression* visitAtomicCmpxchg(AtomicCmpxchg* curr) {\n      return builder.makeAtomicCmpxchg(curr->bytes,\n                                       curr->offset,\n                                       copy(curr->ptr),\n                                       copy(curr->expected),\n                                       copy(curr->replacement),\n                                       curr->type);\n    }\n    Expression* visitAtomicWait(AtomicWait* curr) {\n      return builder.makeAtomicWait(copy(curr->ptr),\n                                    copy(curr->expected),\n                                    copy(curr->timeout),\n                                    curr->expectedType,\n                                    curr->offset);\n    }\n    Expression* visitAtomicNotify(AtomicNotify* curr) {\n      return builder.makeAtomicNotify(\n        copy(curr->ptr), copy(curr->notifyCount), curr->offset);\n    }\n    Expression* visitSIMDExtract(SIMDExtract* curr) {\n      return builder.makeSIMDExtract(curr->op, copy(curr->vec), curr->index);\n    }\n    Expression* visitSIMDReplace(SIMDReplace* curr) {\n      return builder.makeSIMDReplace(\n        curr->op, copy(curr->vec), curr->index, copy(curr->value));\n    }\n    Expression* visitSIMDShuffle(SIMDShuffle* curr) {\n      return builder.makeSIMDShuffle(\n        copy(curr->left), copy(curr->right), curr->mask);\n    }\n    Expression* visitSIMDBitselect(SIMDBitselect* curr) {\n      return builder.makeSIMDBitselect(\n        copy(curr->left), copy(curr->right), copy(curr->cond));\n    }\n    Expression* visitSIMDShift(SIMDShift* curr) {\n      return builder.makeSIMDShift(\n        curr->op, copy(curr->vec), copy(curr->shift));\n    }\n    Expression* visitConst(Const* curr) {\n      return builder.makeConst(curr->value);\n    }\n    Expression* visitMemoryInit(MemoryInit* curr) {\n      return builder.makeMemoryInit(\n        curr->segment, copy(curr->dest), copy(curr->offset), copy(curr->size));\n    }\n    Expression* visitDataDrop(DataDrop* curr) {\n      return builder.makeDataDrop(curr->segment);\n    }\n    Expression* visitMemoryCopy(MemoryCopy* curr) {\n      return builder.makeMemoryCopy(\n        copy(curr->dest), copy(curr->source), copy(curr->size));\n    }\n    Expression* visitMemoryFill(MemoryFill* curr) {\n      return builder.makeMemoryFill(\n        copy(curr->dest), copy(curr->value), copy(curr->size));\n    }\n    Expression* visitUnary(Unary* curr) {\n      return builder.makeUnary(curr->op, copy(curr->value));\n    }\n    Expression* visitBinary(Binary* curr) {\n      return builder.makeBinary(curr->op, copy(curr->left), copy(curr->right));\n    }\n    Expression* visitSelect(Select* curr) {\n      return builder.makeSelect(\n        copy(curr->condition), copy(curr->ifTrue), copy(curr->ifFalse));\n    }\n    Expression* visitDrop(Drop* curr) {\n      return builder.makeDrop(copy(curr->value));\n    }\n    Expression* visitReturn(Return* curr) {\n      return builder.makeReturn(copy(curr->value));\n    }\n    Expression* visitHost(Host* curr) {\n      std::vector<Expression*> operands;\n      for (Index i = 0; i < curr->operands.size(); i++) {\n        operands.push_back(copy(curr->operands[i]));\n      }\n      auto* ret =\n        builder.makeHost(curr->op, curr->nameOperand, std::move(operands));\n      return ret;\n    }\n    Expression* visitNop(Nop* curr) { return builder.makeNop(); }\n    Expression* visitUnreachable(Unreachable* curr) {\n      return builder.makeUnreachable();\n    }\n    Expression* visitPush(Push* curr) { return builder.makePush(curr->value); }\n    Expression* visitPop(Pop* curr) { return builder.makePop(curr->type); }\n  };\n\n  Copier copier(wasm, custom);\n  return copier.copy(original);\n}\n\n\/\/ Splice an item into the middle of a block's list\nvoid spliceIntoBlock(Block* block, Index index, Expression* add) {\n  auto& list = block->list;\n  if (index == list.size()) {\n    list.push_back(add); \/\/ simple append\n  } else {\n    \/\/ we need to make room\n    list.push_back(nullptr);\n    for (Index i = list.size() - 1; i > index; i--) {\n      list[i] = list[i - 1];\n    }\n    list[index] = add;\n  }\n  block->finalize(block->type);\n}\n\n} \/\/ namespace ExpressionManipulator\n\n} \/\/ namespace wasm\n<commit_msg>Add missing copy in Copier::visitPush (#2295)<commit_after>\/*\n * Copyright 2017 WebAssembly Community Group participants\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"ir\/load-utils.h\"\n#include \"ir\/utils.h\"\n#include \"support\/hash.h\"\n\nnamespace wasm {\n\nnamespace ExpressionManipulator {\n\nExpression*\nflexibleCopy(Expression* original, Module& wasm, CustomCopier custom) {\n  struct Copier : public OverriddenVisitor<Copier, Expression*> {\n    Module& wasm;\n    CustomCopier custom;\n\n    Builder builder;\n\n    Copier(Module& wasm, CustomCopier custom)\n      : wasm(wasm), custom(custom), builder(wasm) {}\n\n    Expression* copy(Expression* curr) {\n      if (!curr) {\n        return nullptr;\n      }\n      auto* ret = custom(curr);\n      if (ret) {\n        return ret;\n      }\n      return OverriddenVisitor<Copier, Expression*>::visit(curr);\n    }\n\n    Expression* visitBlock(Block* curr) {\n      ExpressionList list(wasm.allocator);\n      for (Index i = 0; i < curr->list.size(); i++) {\n        list.push_back(copy(curr->list[i]));\n      }\n      return builder.makeBlock(curr->name, list, curr->type);\n    }\n    Expression* visitIf(If* curr) {\n      return builder.makeIf(copy(curr->condition),\n                            copy(curr->ifTrue),\n                            copy(curr->ifFalse),\n                            curr->type);\n    }\n    Expression* visitLoop(Loop* curr) {\n      return builder.makeLoop(curr->name, copy(curr->body));\n    }\n    Expression* visitBreak(Break* curr) {\n      return builder.makeBreak(\n        curr->name, copy(curr->value), copy(curr->condition));\n    }\n    Expression* visitSwitch(Switch* curr) {\n      return builder.makeSwitch(curr->targets,\n                                curr->default_,\n                                copy(curr->condition),\n                                copy(curr->value));\n    }\n    Expression* visitCall(Call* curr) {\n      auto* ret =\n        builder.makeCall(curr->target, {}, curr->type, curr->isReturn);\n      for (Index i = 0; i < curr->operands.size(); i++) {\n        ret->operands.push_back(copy(curr->operands[i]));\n      }\n      return ret;\n    }\n    Expression* visitCallIndirect(CallIndirect* curr) {\n      auto* ret = builder.makeCallIndirect(\n        curr->fullType, copy(curr->target), {}, curr->type, curr->isReturn);\n      for (Index i = 0; i < curr->operands.size(); i++) {\n        ret->operands.push_back(copy(curr->operands[i]));\n      }\n      return ret;\n    }\n    Expression* visitLocalGet(LocalGet* curr) {\n      return builder.makeLocalGet(curr->index, curr->type);\n    }\n    Expression* visitLocalSet(LocalSet* curr) {\n      if (curr->isTee()) {\n        return builder.makeLocalTee(curr->index, copy(curr->value));\n      } else {\n        return builder.makeLocalSet(curr->index, copy(curr->value));\n      }\n    }\n    Expression* visitGlobalGet(GlobalGet* curr) {\n      return builder.makeGlobalGet(curr->name, curr->type);\n    }\n    Expression* visitGlobalSet(GlobalSet* curr) {\n      return builder.makeGlobalSet(curr->name, copy(curr->value));\n    }\n    Expression* visitLoad(Load* curr) {\n      if (curr->isAtomic) {\n        return builder.makeAtomicLoad(\n          curr->bytes, curr->offset, copy(curr->ptr), curr->type);\n      }\n      return builder.makeLoad(curr->bytes,\n                              LoadUtils::isSignRelevant(curr) ? curr->signed_\n                                                              : false,\n                              curr->offset,\n                              curr->align,\n                              copy(curr->ptr),\n                              curr->type);\n    }\n    Expression* visitStore(Store* curr) {\n      if (curr->isAtomic) {\n        return builder.makeAtomicStore(curr->bytes,\n                                       curr->offset,\n                                       copy(curr->ptr),\n                                       copy(curr->value),\n                                       curr->valueType);\n      }\n      return builder.makeStore(curr->bytes,\n                               curr->offset,\n                               curr->align,\n                               copy(curr->ptr),\n                               copy(curr->value),\n                               curr->valueType);\n    }\n    Expression* visitAtomicRMW(AtomicRMW* curr) {\n      return builder.makeAtomicRMW(curr->op,\n                                   curr->bytes,\n                                   curr->offset,\n                                   copy(curr->ptr),\n                                   copy(curr->value),\n                                   curr->type);\n    }\n    Expression* visitAtomicCmpxchg(AtomicCmpxchg* curr) {\n      return builder.makeAtomicCmpxchg(curr->bytes,\n                                       curr->offset,\n                                       copy(curr->ptr),\n                                       copy(curr->expected),\n                                       copy(curr->replacement),\n                                       curr->type);\n    }\n    Expression* visitAtomicWait(AtomicWait* curr) {\n      return builder.makeAtomicWait(copy(curr->ptr),\n                                    copy(curr->expected),\n                                    copy(curr->timeout),\n                                    curr->expectedType,\n                                    curr->offset);\n    }\n    Expression* visitAtomicNotify(AtomicNotify* curr) {\n      return builder.makeAtomicNotify(\n        copy(curr->ptr), copy(curr->notifyCount), curr->offset);\n    }\n    Expression* visitSIMDExtract(SIMDExtract* curr) {\n      return builder.makeSIMDExtract(curr->op, copy(curr->vec), curr->index);\n    }\n    Expression* visitSIMDReplace(SIMDReplace* curr) {\n      return builder.makeSIMDReplace(\n        curr->op, copy(curr->vec), curr->index, copy(curr->value));\n    }\n    Expression* visitSIMDShuffle(SIMDShuffle* curr) {\n      return builder.makeSIMDShuffle(\n        copy(curr->left), copy(curr->right), curr->mask);\n    }\n    Expression* visitSIMDBitselect(SIMDBitselect* curr) {\n      return builder.makeSIMDBitselect(\n        copy(curr->left), copy(curr->right), copy(curr->cond));\n    }\n    Expression* visitSIMDShift(SIMDShift* curr) {\n      return builder.makeSIMDShift(\n        curr->op, copy(curr->vec), copy(curr->shift));\n    }\n    Expression* visitConst(Const* curr) {\n      return builder.makeConst(curr->value);\n    }\n    Expression* visitMemoryInit(MemoryInit* curr) {\n      return builder.makeMemoryInit(\n        curr->segment, copy(curr->dest), copy(curr->offset), copy(curr->size));\n    }\n    Expression* visitDataDrop(DataDrop* curr) {\n      return builder.makeDataDrop(curr->segment);\n    }\n    Expression* visitMemoryCopy(MemoryCopy* curr) {\n      return builder.makeMemoryCopy(\n        copy(curr->dest), copy(curr->source), copy(curr->size));\n    }\n    Expression* visitMemoryFill(MemoryFill* curr) {\n      return builder.makeMemoryFill(\n        copy(curr->dest), copy(curr->value), copy(curr->size));\n    }\n    Expression* visitUnary(Unary* curr) {\n      return builder.makeUnary(curr->op, copy(curr->value));\n    }\n    Expression* visitBinary(Binary* curr) {\n      return builder.makeBinary(curr->op, copy(curr->left), copy(curr->right));\n    }\n    Expression* visitSelect(Select* curr) {\n      return builder.makeSelect(\n        copy(curr->condition), copy(curr->ifTrue), copy(curr->ifFalse));\n    }\n    Expression* visitDrop(Drop* curr) {\n      return builder.makeDrop(copy(curr->value));\n    }\n    Expression* visitReturn(Return* curr) {\n      return builder.makeReturn(copy(curr->value));\n    }\n    Expression* visitHost(Host* curr) {\n      std::vector<Expression*> operands;\n      for (Index i = 0; i < curr->operands.size(); i++) {\n        operands.push_back(copy(curr->operands[i]));\n      }\n      auto* ret =\n        builder.makeHost(curr->op, curr->nameOperand, std::move(operands));\n      return ret;\n    }\n    Expression* visitNop(Nop* curr) { return builder.makeNop(); }\n    Expression* visitUnreachable(Unreachable* curr) {\n      return builder.makeUnreachable();\n    }\n    Expression* visitPush(Push* curr) {\n      return builder.makePush(copy(curr->value));\n    }\n    Expression* visitPop(Pop* curr) { return builder.makePop(curr->type); }\n  };\n\n  Copier copier(wasm, custom);\n  return copier.copy(original);\n}\n\n\/\/ Splice an item into the middle of a block's list\nvoid spliceIntoBlock(Block* block, Index index, Expression* add) {\n  auto& list = block->list;\n  if (index == list.size()) {\n    list.push_back(add); \/\/ simple append\n  } else {\n    \/\/ we need to make room\n    list.push_back(nullptr);\n    for (Index i = list.size() - 1; i > index; i--) {\n      list[i] = list[i - 1];\n    }\n    list[index] = add;\n  }\n  block->finalize(block->type);\n}\n\n} \/\/ namespace ExpressionManipulator\n\n} \/\/ namespace wasm\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n * @brief Implementation of object for charges in sensor\n * @copyright MIT License\n *\/\n\n#ifndef ALLPIX_SENSOR_CHARGE_H\n#define ALLPIX_SENSOR_CHARGE_H\n\n#include <Math\/Point3D.h>\n\n#include \"Object.hpp\"\n\nnamespace allpix {\n    \/**\n     * @ingroup Objects\n     * @brief Base object for charge deposits and propagated charges in the sensor\n     *\/\n    class SensorCharge : public Object {\n    public:\n        \/**\n         * @brief Construct a set of charges in a sensor\n         * @param local_position Local position of the set of charges in the sensor\n         * @param global_position Global position of the set of charges in the sensor\n         * @param charge Total charge at position\n         * @param event_time Total time after event start\n         *\/\n        SensorCharge(ROOT::Math::XYZPoint local_position,\n                     ROOT::Math::XYZPoint global_position,\n                     unsigned int charge,\n                     double event_time);\n\n        \/**\n         * @brief Get local position of the set of charges in the sensor\n         * @return Local position of charges\n         *\/\n        ROOT::Math::XYZPoint getLocalPosition() const;\n\n        \/**\n         * @brief Get the global position of the set of charges in the sensor\n         *\/\n        ROOT::Math::XYZPoint getGlobalPosition() const;\n\n        \/**\n         * @brief Get total amount of charges stored\n         * @return Total charge stored\n         *\/\n        unsigned int getCharge() const;\n        \/**\n         * @brief Get time after start of event\n         * @return Time from start event\n         *\/\n        double getEventTime() const;\n\n        \/**\n         * @brief ROOT class definition\n         *\/\n        ClassDef(SensorCharge, 2);\n        \/**\n         * @brief Default constructor for ROOT I\/O\n         *\/\n        SensorCharge() = default;\n\n    private:\n        ROOT::Math::XYZPoint local_position_;\n        ROOT::Math::XYZPoint global_position_;\n\n        unsigned int charge_{};\n        double event_time_{};\n    };\n} \/\/ namespace allpix\n\n#endif \/* ALLPIX_SENSOR_CHARGE_H *\/\n<commit_msg>Objects\/SensorCharge: add CarrierType enum to distinguish between e\/h<commit_after>\/**\n * @file\n * @brief Implementation of object for charges in sensor\n * @copyright MIT License\n *\/\n\n#ifndef ALLPIX_SENSOR_CHARGE_H\n#define ALLPIX_SENSOR_CHARGE_H\n\n#include <Math\/Point3D.h>\n\n#include \"Object.hpp\"\n\nnamespace allpix {\n    \/**\n     * @ingroup Objects\n     * @brief Flags to distinguish between eletron and hole charge carriers\n     *\/\n    enum class CarrierType : int8_t { ELECTRON = -1, HOLE = 1 };\n\n    \/**\n     * @ingroup Objects\n     * @brief Base object for charge deposits and propagated charges in the sensor\n     *\/\n    class SensorCharge : public Object {\n    public:\n        \/**\n         * @brief Construct a set of charges in a sensor\n         * @param local_position Local position of the set of charges in the sensor\n         * @param global_position Global position of the set of charges in the sensor\n         * @param charge Total charge at position\n         * @param event_time Total time after event start\n         *\/\n        SensorCharge(ROOT::Math::XYZPoint local_position,\n                     ROOT::Math::XYZPoint global_position,\n                     unsigned int charge,\n                     double event_time);\n\n        \/**\n         * @brief Get local position of the set of charges in the sensor\n         * @return Local position of charges\n         *\/\n        ROOT::Math::XYZPoint getLocalPosition() const;\n\n        \/**\n         * @brief Get the global position of the set of charges in the sensor\n         *\/\n        ROOT::Math::XYZPoint getGlobalPosition() const;\n\n        \/**\n         * @brief Get total amount of charges stored\n         * @return Total charge stored\n         *\/\n        unsigned int getCharge() const;\n        \/**\n         * @brief Get time after start of event\n         * @return Time from start event\n         *\/\n        double getEventTime() const;\n\n        \/**\n         * @brief ROOT class definition\n         *\/\n        ClassDef(SensorCharge, 2);\n        \/**\n         * @brief Default constructor for ROOT I\/O\n         *\/\n        SensorCharge() = default;\n\n    private:\n        ROOT::Math::XYZPoint local_position_;\n        ROOT::Math::XYZPoint global_position_;\n\n        CarrierType type_{};\n        unsigned int charge_{};\n        double event_time_{};\n    };\n} \/\/ namespace allpix\n\n#endif \/* ALLPIX_SENSOR_CHARGE_H *\/\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n *                       ____    _    _____                                   *\n *                      \/ ___|  \/ \\  |  ___|    C++                           *\n *                     | |     \/ _ \\ | |_       Actor                         *\n *                     | |___ \/ ___ \\|  _|      Framework                     *\n *                      \\____\/_\/   \\_|_|                                      *\n *                                                                            *\n * Copyright (C) 2011 - 2017                                                  *\n * Dominik Charousset <dominik.charousset (at) haw-hamburg.de>                *\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#ifndef CAF_INTRUSIVE_TASK_QUEUE_HPP\n#define CAF_INTRUSIVE_TASK_QUEUE_HPP\n\n#include <utility>\n\n#include \"caf\/intrusive\/forward_iterator.hpp\"\n\nnamespace caf {\nnamespace intrusive {\n\n\/\/\/ A singly-linked FIFO queue for storing tasks of varying size. This queue is\n\/\/\/ used as a base type for concrete task abstractions such as `drr_queue` and\n\/\/\/ therefore has no dequeue functions.\ntemplate <class Policy>\nclass task_queue {\npublic:\n  \/\/ -- member types ----------------------------------------------------------\n\n  using policy_type = Policy;\n\n  using value_type = typename policy_type::mapped_type;\n\n  using node_type = typename value_type::node_type;\n\n  using node_pointer = node_type*;\n\n  using pointer = value_type*;\n\n  using const_pointer = const value_type*;\n\n  using reference = value_type&;\n\n  using const_reference = const value_type&;\n\n  using deleter_type = typename policy_type::deleter_type;\n\n  using unique_pointer = typename policy_type::unique_pointer;\n\n  using task_size_type = typename policy_type::task_size_type;\n\n  using iterator = forward_iterator<value_type>;\n\n  \/\/ -- constructors, destructors, and assignment operators -------------------\n\n  task_queue(policy_type p) : old_last_(nullptr), policy_(std::move(p)) {\n    init();\n  }\n\n  task_queue(task_queue&& other) : task_queue(other.policy()) {\n    if (other.empty()) {\n      init();\n    } else {\n      head_.next = other.head_.next;\n      tail_.next = other.tail_.next;\n      tail_.next->next = &tail_;\n      total_task_size_ = other.total_task_size_;\n      other.init();\n    }\n  }\n\n  task_queue& operator=(task_queue&& other) {\n    deinit();\n    if (other.empty()) {\n      init();\n    } else {\n      head_.next = other.head_.next;\n      tail_.next = other.tail_.next;\n      tail_.next->next = &tail_;\n      total_task_size_ = other.total_task_size_;\n      other.init();\n    }\n    return *this;\n  }\n\n  virtual ~task_queue() {\n    deinit();\n  }\n\n  \/\/ -- observers -------------------------------------------------------------\n\n  \/\/\/ Returns the policy object.\n  const policy_type& policy() const noexcept {\n    return policy_;\n  }\n\n  \/\/\/ Returns the accumulated size of all stored tasks.\n  task_size_type total_task_size() const noexcept {\n    return total_task_size_;\n  }\n\n  \/\/\/ Returns whether the queue has no elements.\n  bool empty() const noexcept {\n    return total_task_size() == 0;\n  }\n\n  \/\/\/ Peeks at the first element in the queue. Returns `nullptr` if the queue is\n  \/\/\/ empty.\n  pointer peek() noexcept {\n    auto ptr = head_.next;\n    return ptr != &tail_ ? promote(ptr) : nullptr;\n  }\n\n  \/\/ -- modifiers -------------------------------------------------------------\n\n  \/\/\/ Removes all elements from the queue.\n  void clear() {\n    deinit();\n    init();\n  }\n\n  \/\/\/ Appends `ptr` to the queue.\n  \/\/\/ @pre `ptr != nullptr`\n  bool push_back(pointer ptr) noexcept {\n    CAF_ASSERT(ptr != nullptr);\n    tail_.next->next = ptr;\n    tail_.next = ptr;\n    ptr->next = &tail_;\n    inc_total_task_size(*ptr);\n    return true;\n  }\n\n  \/\/\/ Appends `ptr` to the queue.\n  \/\/\/ @pre `ptr != nullptr`\n  bool push_back(unique_pointer ptr) noexcept {\n    return push_back(ptr.release());\n  }\n\n  \/\/\/ Creates a new element from `xs...` and appends it.\n  template <class... Ts>\n  bool emplace_back(Ts&&... xs) {\n    return push_back(new value_type(std::forward<Ts>(xs)...));\n  }\n\n  \/\/\/ @private\n  void inc_total_task_size(task_size_type x) noexcept {\n    total_task_size_ += x;\n  }\n\n  \/\/\/ @private\n  void inc_total_task_size(const value_type& x) noexcept {\n    inc_total_task_size(policy_.task_size(x));\n  }\n\n  \/\/\/ Returns an iterator to the dummy before the first element.\n  iterator before_begin() noexcept {\n    return &head_;\n  }\n\n  \/\/\/ Returns an iterator to the dummy before the first element.\n  iterator begin() noexcept {\n    return head_.next;\n  }\n\n  \/\/\/ Returns a pointer to the dummy past the last element.\n  iterator end() noexcept {\n    return &tail_;\n  }\n\n  \/\/\/ Returns a pointer to the first element.\n  pointer front() noexcept {\n    return promote(head_.next);\n  }\n\n  \/\/\/ Returns a pointer to the last element.\n  pointer back() noexcept {\n    return promote(tail_.next);\n  }\n\n  \/\/\/ Transfers all element from `other` to the front of this queue.\n  template <class Container>\n  void prepend(Container& other) {\n    if (other.empty())\n      return;\n    if (empty()) {\n      *this = std::move(other);\n      return;\n    }\n    other.back()->next = head_.next;\n    head_.next = other.front();\n    total_task_size_ += other.total_task_size();\n    other.init();\n  }\n\n  \/\/\/ Transfers all element from `other` to the back of this queue.\n  template <class Container>\n  void append(Container& other) {\n    if (other.empty())\n      return;\n    if (empty()) {\n      *this = std::move(other);\n      return;\n    }\n    back()->next = other.front();\n    other.back()->next = &tail_;\n    tail_.next = other.back();\n    total_task_size_ += other.total_task_size();\n    other.init();\n  }\n\n  \/\/\/ Allows to insert a LIFO-ordered sequence at the end of the queue by\n  \/\/\/ calling this member function multiple times. Converts the order to FIFO\n  \/\/\/ on the fly.\n  \/\/\/ @warning leaves the queue in an invalid state until calling\n  \/\/\/          `stop_lifo_append`.\n  \/\/\/ @private\n  void lifo_append(node_pointer ptr) {\n    if (old_last_ == nullptr) {\n      old_last_ = back();\n      push_back(promote(ptr));\n    } else {\n      ptr->next = new_head_;\n      inc_total_task_size(*promote(ptr));\n    }\n    new_head_ = ptr;\n  }\n\n  \/\/\/ Restores a consistent state of the queue after calling `lifo_append`.\n  \/\/\/ @private\n  void stop_lifo_append() {\n    if (old_last_ != nullptr) {\n      CAF_ASSERT(new_head_ != nullptr);\n      old_last_->next = new_head_;\n      old_last_ = nullptr;\n    }\n  }\n\n  \/\/ -- construction and destruction helper -----------------------------------\n\n  \/\/\/ Restores a consistent, empty state.\n  \/\/\/ @private\n  void init() noexcept {\n    head_.next = &tail_;\n    tail_.next = &head_;\n    total_task_size_ = 0;\n  }\n\n  \/\/\/ Deletes all elements.\n  \/\/\/ @warning leaves the queue in an invalid state until calling `init` again.\n  \/\/\/ @private\n  void deinit() noexcept {\n    for (auto i = head_.next; i != &tail_;) {\n      auto ptr = i;\n      i = i->next;\n      deleter_type d;\n      d(promote(ptr));\n    }\n  }\n\nprotected:\n  \/\/ -- member variables ------------------------------------------------------\n\n  \/\/\/ node element pointing to the first element.\n  node_type head_;\n\n  \/\/\/ node element pointing past the last element.\n  node_type tail_;\n\n  \/\/\/ Stores the total size of all items in the queue.\n  task_size_type total_task_size_ = 0;\n\n  \/\/\/ Used for LIFO -> FIFO insertion.\n  node_pointer old_last_;\n\n  \/\/\/ Used for LIFO -> FIFO insertion.\n  node_pointer new_head_;\n\n  \/\/\/ Manipulates instances of T.\n  policy_type policy_;\n};\n\n\n} \/\/ namespace intrusive\n} \/\/ namespace caf\n\n#endif \/\/ CAF_INTRUSIVE_TASK_QUEUE_HPP\n<commit_msg>Add missing policy getter to task_queue<commit_after>\/******************************************************************************\n *                       ____    _    _____                                   *\n *                      \/ ___|  \/ \\  |  ___|    C++                           *\n *                     | |     \/ _ \\ | |_       Actor                         *\n *                     | |___ \/ ___ \\|  _|      Framework                     *\n *                      \\____\/_\/   \\_|_|                                      *\n *                                                                            *\n * Copyright (C) 2011 - 2017                                                  *\n * Dominik Charousset <dominik.charousset (at) haw-hamburg.de>                *\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#ifndef CAF_INTRUSIVE_TASK_QUEUE_HPP\n#define CAF_INTRUSIVE_TASK_QUEUE_HPP\n\n#include <utility>\n\n#include \"caf\/intrusive\/forward_iterator.hpp\"\n\nnamespace caf {\nnamespace intrusive {\n\n\/\/\/ A singly-linked FIFO queue for storing tasks of varying size. This queue is\n\/\/\/ used as a base type for concrete task abstractions such as `drr_queue` and\n\/\/\/ therefore has no dequeue functions.\ntemplate <class Policy>\nclass task_queue {\npublic:\n  \/\/ -- member types ----------------------------------------------------------\n\n  using policy_type = Policy;\n\n  using value_type = typename policy_type::mapped_type;\n\n  using node_type = typename value_type::node_type;\n\n  using node_pointer = node_type*;\n\n  using pointer = value_type*;\n\n  using const_pointer = const value_type*;\n\n  using reference = value_type&;\n\n  using const_reference = const value_type&;\n\n  using deleter_type = typename policy_type::deleter_type;\n\n  using unique_pointer = typename policy_type::unique_pointer;\n\n  using task_size_type = typename policy_type::task_size_type;\n\n  using iterator = forward_iterator<value_type>;\n\n  \/\/ -- constructors, destructors, and assignment operators -------------------\n\n  task_queue(policy_type p) : old_last_(nullptr), policy_(std::move(p)) {\n    init();\n  }\n\n  task_queue(task_queue&& other) : task_queue(other.policy()) {\n    if (other.empty()) {\n      init();\n    } else {\n      head_.next = other.head_.next;\n      tail_.next = other.tail_.next;\n      tail_.next->next = &tail_;\n      total_task_size_ = other.total_task_size_;\n      other.init();\n    }\n  }\n\n  task_queue& operator=(task_queue&& other) {\n    deinit();\n    if (other.empty()) {\n      init();\n    } else {\n      head_.next = other.head_.next;\n      tail_.next = other.tail_.next;\n      tail_.next->next = &tail_;\n      total_task_size_ = other.total_task_size_;\n      other.init();\n    }\n    return *this;\n  }\n\n  virtual ~task_queue() {\n    deinit();\n  }\n\n  \/\/ -- observers -------------------------------------------------------------\n\n  \/\/\/ Returns the policy object.\n  policy_type& policy() noexcept {\n    return policy_;\n  }\n\n  \/\/\/ Returns the policy object.\n  const policy_type& policy() const noexcept {\n    return policy_;\n  }\n\n  \/\/\/ Returns the accumulated size of all stored tasks.\n  task_size_type total_task_size() const noexcept {\n    return total_task_size_;\n  }\n\n  \/\/\/ Returns whether the queue has no elements.\n  bool empty() const noexcept {\n    return total_task_size() == 0;\n  }\n\n  \/\/\/ Peeks at the first element in the queue. Returns `nullptr` if the queue is\n  \/\/\/ empty.\n  pointer peek() noexcept {\n    auto ptr = head_.next;\n    return ptr != &tail_ ? promote(ptr) : nullptr;\n  }\n\n  \/\/ -- modifiers -------------------------------------------------------------\n\n  \/\/\/ Removes all elements from the queue.\n  void clear() {\n    deinit();\n    init();\n  }\n\n  \/\/\/ Appends `ptr` to the queue.\n  \/\/\/ @pre `ptr != nullptr`\n  bool push_back(pointer ptr) noexcept {\n    CAF_ASSERT(ptr != nullptr);\n    tail_.next->next = ptr;\n    tail_.next = ptr;\n    ptr->next = &tail_;\n    inc_total_task_size(*ptr);\n    return true;\n  }\n\n  \/\/\/ Appends `ptr` to the queue.\n  \/\/\/ @pre `ptr != nullptr`\n  bool push_back(unique_pointer ptr) noexcept {\n    return push_back(ptr.release());\n  }\n\n  \/\/\/ Creates a new element from `xs...` and appends it.\n  template <class... Ts>\n  bool emplace_back(Ts&&... xs) {\n    return push_back(new value_type(std::forward<Ts>(xs)...));\n  }\n\n  \/\/\/ @private\n  void inc_total_task_size(task_size_type x) noexcept {\n    total_task_size_ += x;\n  }\n\n  \/\/\/ @private\n  void inc_total_task_size(const value_type& x) noexcept {\n    inc_total_task_size(policy_.task_size(x));\n  }\n\n  \/\/\/ Returns an iterator to the dummy before the first element.\n  iterator before_begin() noexcept {\n    return &head_;\n  }\n\n  \/\/\/ Returns an iterator to the dummy before the first element.\n  iterator begin() noexcept {\n    return head_.next;\n  }\n\n  \/\/\/ Returns a pointer to the dummy past the last element.\n  iterator end() noexcept {\n    return &tail_;\n  }\n\n  \/\/\/ Returns a pointer to the first element.\n  pointer front() noexcept {\n    return promote(head_.next);\n  }\n\n  \/\/\/ Returns a pointer to the last element.\n  pointer back() noexcept {\n    return promote(tail_.next);\n  }\n\n  \/\/\/ Transfers all element from `other` to the front of this queue.\n  template <class Container>\n  void prepend(Container& other) {\n    if (other.empty())\n      return;\n    if (empty()) {\n      *this = std::move(other);\n      return;\n    }\n    other.back()->next = head_.next;\n    head_.next = other.front();\n    total_task_size_ += other.total_task_size();\n    other.init();\n  }\n\n  \/\/\/ Transfers all element from `other` to the back of this queue.\n  template <class Container>\n  void append(Container& other) {\n    if (other.empty())\n      return;\n    if (empty()) {\n      *this = std::move(other);\n      return;\n    }\n    back()->next = other.front();\n    other.back()->next = &tail_;\n    tail_.next = other.back();\n    total_task_size_ += other.total_task_size();\n    other.init();\n  }\n\n  \/\/\/ Allows to insert a LIFO-ordered sequence at the end of the queue by\n  \/\/\/ calling this member function multiple times. Converts the order to FIFO\n  \/\/\/ on the fly.\n  \/\/\/ @warning leaves the queue in an invalid state until calling\n  \/\/\/          `stop_lifo_append`.\n  \/\/\/ @private\n  void lifo_append(node_pointer ptr) {\n    if (old_last_ == nullptr) {\n      old_last_ = back();\n      push_back(promote(ptr));\n    } else {\n      ptr->next = new_head_;\n      inc_total_task_size(*promote(ptr));\n    }\n    new_head_ = ptr;\n  }\n\n  \/\/\/ Restores a consistent state of the queue after calling `lifo_append`.\n  \/\/\/ @private\n  void stop_lifo_append() {\n    if (old_last_ != nullptr) {\n      CAF_ASSERT(new_head_ != nullptr);\n      old_last_->next = new_head_;\n      old_last_ = nullptr;\n    }\n  }\n\n  \/\/ -- construction and destruction helper -----------------------------------\n\n  \/\/\/ Restores a consistent, empty state.\n  \/\/\/ @private\n  void init() noexcept {\n    head_.next = &tail_;\n    tail_.next = &head_;\n    total_task_size_ = 0;\n  }\n\n  \/\/\/ Deletes all elements.\n  \/\/\/ @warning leaves the queue in an invalid state until calling `init` again.\n  \/\/\/ @private\n  void deinit() noexcept {\n    for (auto i = head_.next; i != &tail_;) {\n      auto ptr = i;\n      i = i->next;\n      deleter_type d;\n      d(promote(ptr));\n    }\n  }\n\nprotected:\n  \/\/ -- member variables ------------------------------------------------------\n\n  \/\/\/ node element pointing to the first element.\n  node_type head_;\n\n  \/\/\/ node element pointing past the last element.\n  node_type tail_;\n\n  \/\/\/ Stores the total size of all items in the queue.\n  task_size_type total_task_size_ = 0;\n\n  \/\/\/ Used for LIFO -> FIFO insertion.\n  node_pointer old_last_;\n\n  \/\/\/ Used for LIFO -> FIFO insertion.\n  node_pointer new_head_;\n\n  \/\/\/ Manipulates instances of T.\n  policy_type policy_;\n};\n\n\n} \/\/ namespace intrusive\n} \/\/ namespace caf\n\n#endif \/\/ CAF_INTRUSIVE_TASK_QUEUE_HPP\n<|endoftext|>"}
{"text":"<commit_before>AliAnalysisTaskMinijet* AddTaskMinijet(Int_t runNumber, TString format=\"esd\",Bool_t useMC = kFALSE, TString kGridDataSet=\"LHC10e\")\n{\n\n  \/\/starting with periode LHC10e, there are also events triggered with High Mult trigger\n  \/\/add stand alone task in case these events are availale\n  Bool_t IsHighMult= (!kGridDataSet.CompareTo(\"LHC10e\") || !kGridDataSet.CompareTo(\"LHC10f\"));\n  \/\/extent with new periods (LHC10g,h,...)\n\n  \/\/ Get the pointer to the existing analysis manager via the static access method.\n  \/\/==============================================================================\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) mgr = new AliAnalysisManager(\"Analysis train\");\n\n  \/\/ Set cuts (used for ESDs) \n  \/\/===========================================================================\n  AliESDtrackCuts* esdTrackCutsITSTPC=0x0;\n  if(!format.CompareTo(\"esd\")){\n    esdTrackCutsITSTPC = AliESDtrackCuts::GetStandardITSTPCTrackCuts2010(kTRUE);\n  }\n\n  \/\/ Configure tasks\n  \/\/===========================================================================\n   \n  \/\/first task for min bias events\n  AliAnalysisTaskMinijet *task = new AliAnalysisTaskMinijet(\"AliAnalysisTaskMinijet Min bias\");\n  task->UseMC(useMC);\n  task->SetRadiusCut(0.7);\n  task->SetTriggerPtCut(0.7);\n  task->SetAssociatePtCut(0.4);\n  task->SetEventAxis(1); \/\/1=random track\n  task->SetDebugLevel(0);\n  task->SetMaxVertexZ(10.);\n  if(!format.CompareTo(\"esd\")){\n    task->SetCuts(esdTrackCutsITSTPC);\n    task->SetMode(0);\/\/0=reading ESDs\n    task->SelectCollisionCandidates(AliVEvent::kMB);\/\/MB\n  }\n\n  \/\/second task for high multipliciy events\n  AliAnalysisTaskMinijet *taskHM =0x0;\n  if(IsHighMult && !format.CompareTo(\"esd\")){\n    taskHM  = new AliAnalysisTaskMinijet(\"AliAnalysisTaskMinijet HighMult\");\n    taskHM->UseMC(useMC);\n    taskHM->SetRadiusCut(0.7);\n    taskHM->SetTriggerPtCut(0.7);\n    taskHM->SetAssociatePtCut(0.4);\n    taskHM->SetEventAxis(1); \/\/1=random track\n    taskHM->SetDebugLevel(0);\n    taskHM->SetMaxVertexZ(10.);\n    taskHM->SetCuts(esdTrackCutsITSTPC);\n    taskHM->SetMode(0);\/\/0=reading ESDs\n    taskHM->SelectCollisionCandidates(AliVEvent::kHighMult);\/\/high mult triggered event\n  }\n\n  if (!format.CompareTo(\"aod\")){\n    task->SetMode(1);\/\/ 1 = reading AODs\n  }\n\n  \/\/create output containers \n  \/\/===========================================================================\n  AliAnalysisDataContainer *output1  = 0x0;\n  AliAnalysisDataContainer *outputHM = 0x0;\n\n  if(runNumber>0){ \n    output1  =  mgr->CreateContainer(\"MiniJets\",TList::Class(),\n\t\t\t\t  AliAnalysisManager::kOutputContainer, Form(\"run%d.root\",runNumber));\n    outputHM =  mgr->CreateContainer(\"MiniJets_HighMult\",TList::Class(),\n\t\t\t\t  AliAnalysisManager::kOutputContainer, Form(\"run%d.root\",runNumber));\n   }\n   \n   else{\n     output1  = mgr->CreateContainer(\"MiniJets\",TList::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t Form(\"%s:PWG4_MiniJets\",AliAnalysisManager::GetCommonFileName()));\n     outputHM = mgr->CreateContainer(\"MiniJets_HighMult\",TList::Class(),\n\t\t\t\t     AliAnalysisManager::kOutputContainer, \n\t\t\t\t     Form(\"%s:PWG4_MiniJets\",AliAnalysisManager::GetCommonFileName()));\n     \n   }\n\n  \/\/===========================================================================  \n  \/\/ add first task to the manager\n  \n  mgr->AddTask(task);\n  \n  \/\/connect input and output\n  mgr->ConnectInput(task, 0,  mgr->GetCommonInputContainer());\n  mgr->ConnectOutput(task, 1, output1);\n  \n  \n  \/\/===========================================================================\n  \/\/do same for high mult task if necassary\n  if(!format.CompareTo(\"esd\") && IsHighMult){\n    \n    \/\/ add task to the manager\n    mgr->AddTask(taskHM);\n    \n    \/\/connect input and output\n    mgr->ConnectInput (taskHM, 0,  mgr->GetCommonInputContainer());\n    mgr->ConnectOutput(taskHM, 1, outputHM);\n  }\n  \n  return task;\n\n}\n\n<commit_msg>fix: generate DataContainer highmult data only it is needed<commit_after>AliAnalysisTaskMinijet* AddTaskMinijet(Int_t runNumber, TString format=\"esd\",Bool_t useMC = kFALSE, TString kGridDataSet=\"LHC10e\")\n{\n\n  \/\/starting with periode LHC10e, there are also events triggered with High Mult trigger\n  \/\/add stand alone task in case these events are availale\n  Bool_t IsHighMult= (!kGridDataSet.CompareTo(\"LHC10e\") || !kGridDataSet.CompareTo(\"LHC10f\"));\n  \/\/extent with new periods (LHC10g,h,...)\n\n  \/\/ Get the pointer to the existing analysis manager via the static access method.\n  \/\/==============================================================================\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) mgr = new AliAnalysisManager(\"Analysis train\");\n\n  \/\/ Set cuts (used for ESDs) \n  \/\/===========================================================================\n  AliESDtrackCuts* esdTrackCutsITSTPC=0x0;\n  if(!format.CompareTo(\"esd\")){\n    esdTrackCutsITSTPC = AliESDtrackCuts::GetStandardITSTPCTrackCuts2010(kTRUE);\n  }\n\n  \/\/ Configure tasks\n  \/\/===========================================================================\n   \n  \/\/first task for min bias events\n  AliAnalysisTaskMinijet *task = new AliAnalysisTaskMinijet(\"AliAnalysisTaskMinijet Min bias\");\n  task->UseMC(useMC);\n  task->SetRadiusCut(0.7);\n  task->SetTriggerPtCut(0.7);\n  task->SetAssociatePtCut(0.4);\n  task->SetEventAxis(1); \/\/1=random track\n  task->SetDebugLevel(0);\n  task->SetMaxVertexZ(10.);\n  if(!format.CompareTo(\"esd\")){\n    task->SetCuts(esdTrackCutsITSTPC);\n    task->SetMode(0);\/\/0=reading ESDs\n    task->SelectCollisionCandidates(AliVEvent::kMB);\/\/MB\n  }\n\n  \/\/second task for high multipliciy events\n  AliAnalysisTaskMinijet *taskHM =0x0;\n  if(IsHighMult && !format.CompareTo(\"esd\")){\n    taskHM  = new AliAnalysisTaskMinijet(\"AliAnalysisTaskMinijet HighMult\");\n    taskHM->UseMC(useMC);\n    taskHM->SetRadiusCut(0.7);\n    taskHM->SetTriggerPtCut(0.7);\n    taskHM->SetAssociatePtCut(0.4);\n    taskHM->SetEventAxis(1); \/\/1=random track\n    taskHM->SetDebugLevel(0);\n    taskHM->SetMaxVertexZ(10.);\n    taskHM->SetCuts(esdTrackCutsITSTPC);\n    taskHM->SetMode(0);\/\/0=reading ESDs\n    taskHM->SelectCollisionCandidates(AliVEvent::kHighMult);\/\/high mult triggered event\n  }\n\n  if (!format.CompareTo(\"aod\")){\n    task->SetMode(1);\/\/ 1 = reading AODs\n  }\n\n  \/\/create output containers \n  \/\/===========================================================================\n  AliAnalysisDataContainer *output1  = 0x0;\n  AliAnalysisDataContainer *outputHM = 0x0;\n\n  if(runNumber>0){ \n    output1  =  mgr->CreateContainer(\"MiniJets\",TList::Class(),\n\t\t\t\t  AliAnalysisManager::kOutputContainer, Form(\"run%d.root\",runNumber));\n    if(!format.CompareTo(\"esd\") && IsHighMult){\n      outputHM =  mgr->CreateContainer(\"MiniJets_HighMult\",TList::Class(),\n\t\t\t\t       AliAnalysisManager::kOutputContainer, Form(\"run%d.root\",runNumber));\n    }\n   }\n   \n   else{\n     output1  = mgr->CreateContainer(\"MiniJets\",TList::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t Form(\"%s:PWG4_MiniJets\",AliAnalysisManager::GetCommonFileName()));\n     if(!format.CompareTo(\"esd\") && IsHighMult){\n       outputHM = mgr->CreateContainer(\"MiniJets_HighMult\",TList::Class(),\n\t\t\t\t       AliAnalysisManager::kOutputContainer, \n\t\t\t\t       Form(\"%s:PWG4_MiniJets\",AliAnalysisManager::GetCommonFileName()));\n     }\n     \n   }\n\n  \/\/===========================================================================  \n  \/\/ add first task to the manager\n  \n  mgr->AddTask(task);\n  \n  \/\/connect input and output\n  mgr->ConnectInput(task, 0,  mgr->GetCommonInputContainer());\n  mgr->ConnectOutput(task, 1, output1);\n  \n  \n  \/\/===========================================================================\n  \/\/do same for high mult task if necassary\n  if(!format.CompareTo(\"esd\") && IsHighMult){\n    \n    \/\/ add task to the manager\n    mgr->AddTask(taskHM);\n    \n    \/\/connect input and output\n    mgr->ConnectInput (taskHM, 0,  mgr->GetCommonInputContainer());\n    mgr->ConnectOutput(taskHM, 1, outputHM);\n  }\n  \n  return task;\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"Math_basics.h\"\n\nnamespace P_RVD\n{\n\tnamespace Math\n\t{\n\t\tVector3d computeCenter(const Vector3d p1, const Vector3d p2, const Vector3d p3)\n\t\t{\n\t\t\treturn Vector3d((p1.x + p2.x + p3.x) \/ 3,\n\t\t\t\t(p1.y + p2.y + p3.y) \/ 3,\n\t\t\t\t(p1.z + p2.z + p3.z) \/ 3);\n\t\t}\n\n\t\tfloat computeDistance(const Vector3d p1, const Vector3d p2)\n\t\t{\n\t\t\treturn (p1.x - p2.x) * (p1.x - p2.x)\n\t\t\t\t+ (p1.y - p2.y) * (p1.y - p2.y)\n\t\t\t\t+ (p1.z - p2.z) * (p1.z - p2.z);\n\t\t}\n\t}\n}<commit_msg>add computeTriangleArea<commit_after>\n#include \"Math_basics.h\"\n\nnamespace P_RVD\n{\n\tnamespace Math\n\t{\n\t\tVector3d computeCenter(const Vector3d p1, const Vector3d p2, const Vector3d p3)\n\t\t{\n\t\t\treturn Vector3d((p1.x + p2.x + p3.x) \/ 3,\n\t\t\t\t(p1.y + p2.y + p3.y) \/ 3,\n\t\t\t\t(p1.z + p2.z + p3.z) \/ 3);\n\t\t}\n\n\t\tdouble computeDistance(const Vector3d p1, const Vector3d p2)\n\t\t{\n\t\t\treturn (p1.x - p2.x) * (p1.x - p2.x)\n\t\t\t\t+ (p1.y - p2.y) * (p1.y - p2.y)\n\t\t\t\t+ (p1.z - p2.z) * (p1.z - p2.z);\n\t\t}\n\n\t\tdouble computeTriangleArea(const Vector3d p1, const Vector3d p2, const Vector3d p3)\n\t\t{\n\t\t\tdouble a = computeDistance(p1, p2);\n\t\t\tdouble b = computeDistance(p2, p3);\n\t\t\tdouble c = computeDistance(p1, p3);\n\n\t\t\t\/\/Heron's Formula to compute the area of the triangle\n\t\t\tdouble p = (a + b + c) \/ 2;\n\t\t\tdouble tmp = geo_max(a, b);\n\t\t\tif (p > geo_max(tmp, c))\n\t\t\t\treturn sqrt(p * (p - a) * (p - b) * (p - c));\n\t\t\telse\n\t\t\t\tfprintf(stderr, \"the three point cannot construct a triangle!\");\n\t\t\treturn 0.0;\n\t\t}\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2009 Daniël de Kok\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,\n * MA 02110-1301 USA\n *\/\n\n#ifndef STRINGUTIL_HH\n#define STRINGUTIL_HH\n\n#include <algorithm>\n#include <iterator>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nnamespace fsqueeze {\n\n\/**\n * Parse a string.\n * @The string to be parsed.\n *\/\ntemplate <typename T>\nT parseString(std::string const &str)\n{\n\tstd::istringstream iss(str);\n\tT val;\n\tiss >> val;\n\n\tif (!iss)\n\t\tthrow std::invalid_argument(\"Error parsing option argument: \" + \nstr);\n\n\treturn val;\n}\n\n\/**\n * Split a string on whitespace.\n * @str The string to be split.\n *\/\nstd::vector<std::string> stringSplit(std::string str)\n{\n\tstd::istringstream iss(str);\n\tstd::vector<std::string> strParts;\n\tcopy(std::istream_iterator<std::string>(iss), std::istream_iterator<std::string>(),\n\t\tback_inserter(strParts));\n\n\treturn strParts;\n}\n\n}\n\n#endif \/\/ STRINGUTIL_HH<commit_msg>parseString: correct error message.<commit_after>\/*\n * Copyright (c) 2009 Daniël de Kok\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,\n * MA 02110-1301 USA\n *\/\n\n#ifndef STRINGUTIL_HH\n#define STRINGUTIL_HH\n\n#include <algorithm>\n#include <iterator>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nnamespace fsqueeze {\n\n\/**\n * Parse a string.\n * @The string to be parsed.\n *\/\ntemplate <typename T>\nT parseString(std::string const &str)\n{\n\tstd::istringstream iss(str);\n\tT val;\n\tiss >> val;\n\n\tif (!iss)\n\t\tthrow std::invalid_argument(\"Error parsing: \" + \nstr);\n\n\treturn val;\n}\n\n\/**\n * Split a string on whitespace.\n * @str The string to be split.\n *\/\nstd::vector<std::string> stringSplit(std::string str)\n{\n\tstd::istringstream iss(str);\n\tstd::vector<std::string> strParts;\n\tcopy(std::istream_iterator<std::string>(iss), std::istream_iterator<std::string>(),\n\t\tback_inserter(strParts));\n\n\treturn strParts;\n}\n\n}\n\n#endif \/\/ STRINGUTIL_HH<|endoftext|>"}
{"text":"<commit_before>#include \"Vector2.h\"\n\n#include <ostream>\n\n#ifndef M_PI\n#define M_PI 3.14159265358979323846264338327\n#endif\n\n#ifndef EQ_THRESHOLD\n#define EQ_THRESHOLD 0.00001\n#endif\n\nstd::ostream& operator<<(std::ostream& os, const Vector2& v)\n{\n\tos << \"(\" << v.x << \", \" << v.y << \")\";\n\treturn os;\n}\n\nVector2::Vector2() :\n\tx(0.0),\n\ty(0.0)\n{\n\n}\n\nVector2::Vector2(double angle) :\n\tx(cos(angle * M_PI \/ 180)),\n\ty(sin(angle * M_PI \/ 180))\n{\n\n}\n\nVector2::Vector2(double _x, double _y) :\n\tx(_x),\n\ty(_y)\n{\n\n}\n\nVector2::Vector2(const Vector2& v1, const Vector2& v2) :\n\tx(v2.x - v1.x),\n\ty(v2.y - v1.y)\n{\n\n}\n\nVector2::~Vector2()\n{\n\n}\n\nVector2::Vector2(const Vector2& v) :\n\tx(v.x),\n\ty(v.y)\n{\n\n}\n\nVector2::Vector2(Vector2&& v) :\n\tx(v.x),\n\ty(v.y)\n{\n\n}\n\nVector2& Vector2::operator=(const Vector2& v)\n{\n\tif (&v == this)\n\t{\n\t\treturn *this;\n\t}\n\n\tx = v.x;\n\ty = v.y;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator=(Vector2&& v)\n{\n\tif (&v == this)\n\t{\n\t\treturn *this;\n\t}\n\n\tx = v.x;\n\ty = v.y;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator+=(const Vector2& v)\n{\n\tx += v.x;\n\ty += v.y;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator+=(const double f)\n{\n\tx += f;\n\ty += f;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator-=(const Vector2& v)\n{\n\tx -= v.x;\n\ty -= v.y;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator-=(const double f)\n{\n\tx -= f;\n\ty -= f;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator*=(const double f)\n{\n\tx *= f;\n\ty *= f;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator\/=(const double f)\n{\n\tx \/= f;\n\ty \/= f;\n\n\treturn *this;\n}\n\nbool Vector2::operator==(const Vector2& v) const\n{\n\tdouble diffX = abs(x - v.x);\n\tdouble diffY = abs(y - v.y);\n\n\treturn diffX < EQ_THRESHOLD && diffY < EQ_THRESHOLD;\n}\n\nbool Vector2::operator!=(const Vector2& v) const\n{\n\treturn !(*this == v);\n}\n\nvoid Vector2::Normalize()\n{\n\tdouble mod = Length();\n\n\tif (mod > 0)\n\t{\n\t\tx \/= mod;\n\t\ty \/= mod;\n\t}\n}\n\nvoid Vector2::Reflect(const Vector2& v)\n{\n\t*this += 2.0 * DotProduct(v) * Vector2(v.x * -1, v.y * -1);\n}\n\nvoid Vector2::Reverse()\n{\n\tx *= -1;\n\ty *= -1;\n}\n\nvoid Vector2::Truncate(double maxLength)\n{\n\tif (Length() > maxLength)\n\t{\n\t\tNormalize();\n\t\t*this *= maxLength;\n\t}\n}\n\nvoid Vector2::RotateByDegree(double degree)\n{\n\tRotateByRadian(degree * M_PI \/ 180);\n}\n\nvoid Vector2::RotateByRadian(double radian)\n{\n\tdouble newX = x * cos(radian) - y * sin(radian);\n\tdouble newY = x * sin(radian) + y * cos(radian);\n\n\tx = newX;\n\ty = newY;\n}\n\ndouble Vector2::DotProduct(const Vector2& v) const\n{\n\treturn x * v.x + y * v.y;\n}\n\ndouble Vector2::CrossProduct(const Vector2& v) const\n{\n\treturn x * v.y - v.x * y;\n}\n\ndouble Vector2::Length() const\n{\n\treturn sqrt(x * x + y * y);\n}\n\ndouble Vector2::LengthSqrt() const\n{\n\treturn x * x + y * y;\n}\n\ndouble Vector2::Distance(const Vector2& v) const\n{\n\tVector2 dist(*this, v);\n\treturn dist.Length();\n}\n\ndouble Vector2::DistanceSqrt(const Vector2& v) const\n{\n\tVector2 dist(*this, v);\n\treturn dist.LengthSqrt();\n}\n\ndouble Vector2::GetAngleByDegree() const\n{\n\treturn GetAngleByRadian() * 180 \/ M_PI;\n}\n\ndouble Vector2::GetAngleByDegree(const Vector2& v) const\n{\n\treturn GetAngleByRadian(v) * 180 \/ M_PI;\n}\n\ndouble Vector2::GetAngleByRadian() const\n{\n\tif (IsZero())\n\t{\n\t\treturn 0;\n\t}\n\n\treturn atan2(y, x);\n}\n\ndouble Vector2::GetAngleByRadian(const Vector2& v) const\n{\n\tif (IsZero() || v.IsZero())\n\t{\n\t\treturn 0;\n\t}\n\n\tdouble angle = atan2(v.y - y, v.x - x);\n\treturn angle;\n}\n\nbool Vector2::Sign(const Vector2& v) const\n{\n\treturn x * v.y > v.x * y;\n}\n\nbool Vector2::IsZero() const\n{\n\treturn x == 0 && y == 0;\n}\n\nVector2 operator+(const Vector2& lhs, const Vector2& rhs)\n{\n\tVector2 aux(lhs);\n\taux += rhs;\n\n\treturn aux;\n}\n\nVector2 operator-(const Vector2& lhs, const Vector2& rhs)\n{\n\tVector2 aux(lhs);\n\taux -= rhs;\n\n\treturn aux;\n}\n\nVector2 operator*(const double fac, const Vector2& rhs)\n{\n\tVector2 aux(rhs);\n\taux *= fac;\n\n\treturn aux;\n}\nVector2 operator*(const Vector2& lhs, const double fac)\n{\n\tVector2 aux(lhs);\n\taux *= fac;\n\n\treturn aux;\n}\n\nVector2 operator\/(const Vector2& lhs, const double fac)\n{\n\tVector2 aux(lhs);\n\taux \/= fac;\n\n\treturn aux;\n}\n\nVector2 Normalize(const Vector2& v) {\n\tVector2 aux(v);\n\taux.Normalize();\n\n\treturn aux;\n}\n\nVector2 Reflect(const Vector2& v1, const Vector2& v2) {\n\tVector2 aux(v1);\n\taux.Reflect(v2);\n\n\treturn aux;\n}\n\nVector2 Reverse(const Vector2& v) {\n\tVector2 aux(v);\n\taux.Reverse();\n\n\treturn aux;\n}\n\nVector2 Truncate(const Vector2& v, double maxLength) {\n\tVector2 aux(v);\n\taux.Truncate(maxLength);\n\n\treturn aux;\n}\n\nVector2 RotateByDegree(const Vector2& v, double degree) {\n\tVector2 aux(v);\n\taux.RotateByDegree(degree);\n\n\treturn aux;\n}\n\nVector2 RotateByRadian(const Vector2& v, double radian) {\n\tVector2 aux(v);\n\taux.RotateByRadian(radian);\n\n\treturn aux;\n}\n\ndouble Distance(const Vector2& v1, const Vector2& v2) {\n\tVector2 aux(v1, v2);\n\n\treturn aux.Length();\n}<commit_msg>Modify macro to const variable<commit_after>#include \"Vector2.h\"\n\n#include <ostream>\n\nconst double M_PI = 3.14159265358979323846264338327;\nconst double EQ_THRESHOLD = 0.00001;\n\nstd::ostream& operator<<(std::ostream& os, const Vector2& v)\n{\n\tos << \"(\" << v.x << \", \" << v.y << \")\";\n\treturn os;\n}\n\nVector2::Vector2() :\n\tx(0.0),\n\ty(0.0)\n{\n\n}\n\nVector2::Vector2(double angle) :\n\tx(cos(angle * M_PI \/ 180)),\n\ty(sin(angle * M_PI \/ 180))\n{\n\n}\n\nVector2::Vector2(double _x, double _y) :\n\tx(_x),\n\ty(_y)\n{\n\n}\n\nVector2::Vector2(const Vector2& v1, const Vector2& v2) :\n\tx(v2.x - v1.x),\n\ty(v2.y - v1.y)\n{\n\n}\n\nVector2::~Vector2()\n{\n\n}\n\nVector2::Vector2(const Vector2& v) :\n\tx(v.x),\n\ty(v.y)\n{\n\n}\n\nVector2::Vector2(Vector2&& v) :\n\tx(v.x),\n\ty(v.y)\n{\n\n}\n\nVector2& Vector2::operator=(const Vector2& v)\n{\n\tif (&v == this)\n\t{\n\t\treturn *this;\n\t}\n\n\tx = v.x;\n\ty = v.y;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator=(Vector2&& v)\n{\n\tif (&v == this)\n\t{\n\t\treturn *this;\n\t}\n\n\tx = v.x;\n\ty = v.y;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator+=(const Vector2& v)\n{\n\tx += v.x;\n\ty += v.y;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator+=(const double f)\n{\n\tx += f;\n\ty += f;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator-=(const Vector2& v)\n{\n\tx -= v.x;\n\ty -= v.y;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator-=(const double f)\n{\n\tx -= f;\n\ty -= f;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator*=(const double f)\n{\n\tx *= f;\n\ty *= f;\n\n\treturn *this;\n}\n\nVector2& Vector2::operator\/=(const double f)\n{\n\tx \/= f;\n\ty \/= f;\n\n\treturn *this;\n}\n\nbool Vector2::operator==(const Vector2& v) const\n{\n\tdouble diffX = abs(x - v.x);\n\tdouble diffY = abs(y - v.y);\n\n\treturn diffX < EQ_THRESHOLD && diffY < EQ_THRESHOLD;\n}\n\nbool Vector2::operator!=(const Vector2& v) const\n{\n\treturn !(*this == v);\n}\n\nvoid Vector2::Normalize()\n{\n\tdouble mod = Length();\n\n\tif (mod > 0)\n\t{\n\t\tx \/= mod;\n\t\ty \/= mod;\n\t}\n}\n\nvoid Vector2::Reflect(const Vector2& v)\n{\n\t*this += 2.0 * DotProduct(v) * Vector2(v.x * -1, v.y * -1);\n}\n\nvoid Vector2::Reverse()\n{\n\tx *= -1;\n\ty *= -1;\n}\n\nvoid Vector2::Truncate(double maxLength)\n{\n\tif (Length() > maxLength)\n\t{\n\t\tNormalize();\n\t\t*this *= maxLength;\n\t}\n}\n\nvoid Vector2::RotateByDegree(double degree)\n{\n\tRotateByRadian(degree * M_PI \/ 180);\n}\n\nvoid Vector2::RotateByRadian(double radian)\n{\n\tdouble newX = x * cos(radian) - y * sin(radian);\n\tdouble newY = x * sin(radian) + y * cos(radian);\n\n\tx = newX;\n\ty = newY;\n}\n\ndouble Vector2::DotProduct(const Vector2& v) const\n{\n\treturn x * v.x + y * v.y;\n}\n\ndouble Vector2::CrossProduct(const Vector2& v) const\n{\n\treturn x * v.y - v.x * y;\n}\n\ndouble Vector2::Length() const\n{\n\treturn sqrt(x * x + y * y);\n}\n\ndouble Vector2::LengthSqrt() const\n{\n\treturn x * x + y * y;\n}\n\ndouble Vector2::Distance(const Vector2& v) const\n{\n\tVector2 dist(*this, v);\n\treturn dist.Length();\n}\n\ndouble Vector2::DistanceSqrt(const Vector2& v) const\n{\n\tVector2 dist(*this, v);\n\treturn dist.LengthSqrt();\n}\n\ndouble Vector2::GetAngleByDegree() const\n{\n\treturn GetAngleByRadian() * 180 \/ M_PI;\n}\n\ndouble Vector2::GetAngleByDegree(const Vector2& v) const\n{\n\treturn GetAngleByRadian(v) * 180 \/ M_PI;\n}\n\ndouble Vector2::GetAngleByRadian() const\n{\n\tif (IsZero())\n\t{\n\t\treturn 0;\n\t}\n\n\treturn atan2(y, x);\n}\n\ndouble Vector2::GetAngleByRadian(const Vector2& v) const\n{\n\tif (IsZero() || v.IsZero())\n\t{\n\t\treturn 0;\n\t}\n\n\tdouble angle = atan2(v.y - y, v.x - x);\n\treturn angle;\n}\n\nbool Vector2::Sign(const Vector2& v) const\n{\n\treturn x * v.y > v.x * y;\n}\n\nbool Vector2::IsZero() const\n{\n\treturn x == 0 && y == 0;\n}\n\nVector2 operator+(const Vector2& lhs, const Vector2& rhs)\n{\n\tVector2 aux(lhs);\n\taux += rhs;\n\n\treturn aux;\n}\n\nVector2 operator-(const Vector2& lhs, const Vector2& rhs)\n{\n\tVector2 aux(lhs);\n\taux -= rhs;\n\n\treturn aux;\n}\n\nVector2 operator*(const double fac, const Vector2& rhs)\n{\n\tVector2 aux(rhs);\n\taux *= fac;\n\n\treturn aux;\n}\nVector2 operator*(const Vector2& lhs, const double fac)\n{\n\tVector2 aux(lhs);\n\taux *= fac;\n\n\treturn aux;\n}\n\nVector2 operator\/(const Vector2& lhs, const double fac)\n{\n\tVector2 aux(lhs);\n\taux \/= fac;\n\n\treturn aux;\n}\n\nVector2 Normalize(const Vector2& v) {\n\tVector2 aux(v);\n\taux.Normalize();\n\n\treturn aux;\n}\n\nVector2 Reflect(const Vector2& v1, const Vector2& v2) {\n\tVector2 aux(v1);\n\taux.Reflect(v2);\n\n\treturn aux;\n}\n\nVector2 Reverse(const Vector2& v) {\n\tVector2 aux(v);\n\taux.Reverse();\n\n\treturn aux;\n}\n\nVector2 Truncate(const Vector2& v, double maxLength) {\n\tVector2 aux(v);\n\taux.Truncate(maxLength);\n\n\treturn aux;\n}\n\nVector2 RotateByDegree(const Vector2& v, double degree) {\n\tVector2 aux(v);\n\taux.RotateByDegree(degree);\n\n\treturn aux;\n}\n\nVector2 RotateByRadian(const Vector2& v, double radian) {\n\tVector2 aux(v);\n\taux.RotateByRadian(radian);\n\n\treturn aux;\n}\n\ndouble Distance(const Vector2& v1, const Vector2& v2) {\n\tVector2 aux(v1, v2);\n\n\treturn aux.Length();\n}<|endoftext|>"}
{"text":"<commit_before>#include \"Halide.h\"\n\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n    int W = 6400;\n    int H = 4800;\n    Buffer<uint16_t> input(W, H);\n\n    for (int y = 0; y < input.height(); y++) {\n        for (int x = 0; x < input.width(); x++) {\n            input(x, y) = rand() & 0xfff;\n        }\n    }\n\n    Var x(\"x\"), y(\"y\");\n\n    int num_stencils = 15;\n\n    std::vector<Func> stencils;\n    for(int i = 0; i < num_stencils; i ++) {\n        Func s(\"stencil_\" + std::to_string(i));\n        stencils.push_back(s);\n    }\n\n    stencils[0](x, y) = (input(x, y) + input(x+1, y) + input(x+2, y))\/3;\n    for (int i = 1; i < num_stencils; i++) {\n        stencils[i](x, y) = (stencils[i-1](x, y) + stencils[i-1](x, y+1) +\n                             stencils[i-1](x, y+2))\/3;\n    }\n\n    \/\/ Provide estimates on the pipeline output\n    stencils[num_stencils - 1].estimate(x, 0, 6200).estimate(y, 0, 4600);\n\n    \/\/ Auto-schedule the pipeline\n    Target target = get_target_from_environment();\n    Pipeline p(stencils[num_stencils - 1]);\n\n    p.auto_schedule(target);\n\n    \/\/ Inspect the schedule\n    stencils[num_stencils - 1].print_loop_nest();\n\n    \/\/ Run the schedule\n    Buffer<uint16_t> out = p.realize(6204, 4604);\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n<commit_msg>Add print schedule in cost function test<commit_after>#include \"Halide.h\"\n\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n    int W = 6400;\n    int H = 4800;\n    Buffer<uint16_t> input(W, H);\n\n    for (int y = 0; y < input.height(); y++) {\n        for (int x = 0; x < input.width(); x++) {\n            input(x, y) = rand() & 0xfff;\n        }\n    }\n\n    Var x(\"x\"), y(\"y\");\n\n    int num_stencils = 15;\n\n    std::vector<Func> stencils;\n    for(int i = 0; i < num_stencils; i ++) {\n        Func s(\"stencil_\" + std::to_string(i));\n        stencils.push_back(s);\n    }\n\n    stencils[0](x, y) = (input(x, y) + input(x+1, y) + input(x+2, y))\/3;\n    for (int i = 1; i < num_stencils; i++) {\n        stencils[i](x, y) = (stencils[i-1](x, y) + stencils[i-1](x, y+1) +\n                             stencils[i-1](x, y+2))\/3;\n    }\n\n    \/\/ Provide estimates on the pipeline output\n    stencils[num_stencils - 1].estimate(x, 0, 6200).estimate(y, 0, 4600);\n\n    \/\/ Auto-schedule the pipeline\n    Target target = get_target_from_environment();\n    Pipeline p(stencils[num_stencils - 1]);\n\n    std::cout << \"\\n\\n******************************************\\nSCHEDULE:\\n\"\n              << \"******************************************\\n\"\n              << p.auto_schedule(target)\n              << \"\\n******************************************\\n\\n\";\n\n    \/\/ Inspect the schedule\n    stencils[num_stencils - 1].print_loop_nest();\n\n    \/\/ Run the schedule\n    Buffer<uint16_t> out = p.realize(6204, 4604);\n\n    printf(\"Success!\\n\");\n    return 0;\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 \"SkBlitMask.h\"\n#include \"SkBlitRow.h\"\n#include \"SkBlitRect_opts_SSE2.h\"\n#include \"SkBlitRow_opts_SSE2.h\"\n#include \"SkUtils_opts_SSE2.h\"\n#include \"SkUtils.h\"\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    __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}\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)\n\/* All x86_64 machines have SSE2, 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\nstatic inline bool hasSSSE3() {\n    int cpu_info[4] = { 0 };\n    getcpuid(1, cpu_info);\n    return (cpu_info[2] & 0x200) != 0;\n}\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\nvoid SkBitmapProcState::platformProcs() {\n    if (cachedHasSSSE3()) {\n#if !defined(SK_BUILD_FOR_ANDROID)\n        \/\/ Disable SSSE3 optimization for Android x86\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#endif\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\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    }\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::PlatformProcs4444(unsigned flags) {\n    return NULL;\n}\n\nSkBlitRow::Proc SkBlitRow::PlatformProcs565(unsigned flags) {\n    return NULL;\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\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory() {\n    if (cachedHasSSE2()) {\n        return ColorRect32_SSE2;\n    } else {\n        return NULL;\n    }\n}\n\n\n<commit_msg>Use intrinsics instead of inline assembly for detecting CPU ID & SSE2\/3 support on 64-bit builds in MS Visual Studio 2010. Original code provided by jianliang79.<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 \"SkBlitMask.h\"\n#include \"SkBlitRow.h\"\n#include \"SkBlitRect_opts_SSE2.h\"\n#include \"SkBlitRow_opts_SSE2.h\"\n#include \"SkUtils_opts_SSE2.h\"\n#include \"SkUtils.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)\n\/* All x86_64 machines have SSE2, 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\nstatic inline bool hasSSSE3() {\n    int cpu_info[4] = { 0 };\n    getcpuid(1, cpu_info);\n    return (cpu_info[2] & 0x200) != 0;\n}\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\nvoid SkBitmapProcState::platformProcs() {\n    if (cachedHasSSSE3()) {\n#if !defined(SK_BUILD_FOR_ANDROID)\n        \/\/ Disable SSSE3 optimization for Android x86\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#endif\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\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    }\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::PlatformProcs4444(unsigned flags) {\n    return NULL;\n}\n\nSkBlitRow::Proc SkBlitRow::PlatformProcs565(unsigned flags) {\n    return NULL;\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\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory() {\n    if (cachedHasSSE2()) {\n        return ColorRect32_SSE2;\n    } else {\n        return NULL;\n    }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*-------------Anderson.cpp---------------------------------------------------\/\/\n*\n*              Anderson.cpp -- Diffusion Monte Carlo for Schroedy\n*\n* Purpose: Implement the quantum Monte Carlo (diffusion) by Anderson:\n*             http:\/\/www.huy-nguyen.com\/wp-content\/uploads\/QMC-papers\/Anderson-JChemPhys-1975.pdf\n*          For H3+, with 3 protons and 2 electrons\n*\n*    Note: This algorithm may be improved by later work\n*          A \"psip\" is an imaginary configuration of electrons in space.\n*          Requires c++11 for random and Eigen for matrix\n*          Protons assume to be at origin\n*          A lot of this algorithm is more easily understood here:\n*              http:\/\/www.thphys.uni-heidelberg.de\/~wetzel\/qmc2006\/KOSZ96.pdf\n*\n*-----------------------------------------------------------------------------*\/\n\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <vector>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <omp.h>\n#include <random>\n\nconstexpr size_t DOF = 6;\nconstexpr size_t MAX_SIZE = 2000;\nconstexpr size_t INITIAL_SIZE = 1000;\nconstexpr double TIMESTEP = 0.001;\nconstexpr double RADIUS = 1.8;\n\nusing coord = std::array<double, DOF>;\n\nstruct particle {\n    coord coords;\n    int id;\n    int m_n;\n    double potential;\n\n    \/\/ This is the constructor used for the initial state creation\n    particle(int id, const coord& coords)\n      : coords(coords), id(id),  m_n(-1), potential(0.0) {}\n\n    \/\/ Used in branching to create a replica of an other particle.\n    \/\/ Sets m_n to 1 so even if this was to be processed, it will\n    \/\/ be ignored as per the algorithm described in the Kosztin paper\n    particle(int id, const particle& p)\n      : coords(p.coords), id(id),  m_n(1), potential(p.potential) {}\n};\n\nstruct h3plus {\n    std::vector<particle> particles;\n    double v_ref, dt, energy;\n    int global_id;\n\n    \/\/ This wouldn't be strictly necessary,\n    \/\/ but pre-allocating should speed up the program a bit\n    h3plus(size_t reserved_size) {\n        particles.reserve(reserved_size);\n    }\n};\n\n\/\/ Populate a distribution of particles for QMC\nh3plus generate_initial(size_t initial_size, double dt);\n\n\/\/ Calculates energy of a configuration and stores it as the particle potential\nvoid find_weights(h3plus& state);\n\n\/\/ Random walk\nvoid random_walk(h3plus& state);\n\n\/\/ Branching scheme\nvoid branch(h3plus& state);\n\n\/\/ Random walking of matrix of position created in populate\nvoid diffuse(h3plus& state, std::ostream& output);\n\nvoid print_visualization_data(std::ostream& output, const h3plus& state);\n\ntemplate <typename T>\ndouble random_double(T distribution);\n\n\/*----------------------------------------------------------------------------\/\/\n* MAIN\n*-----------------------------------------------------------------------------*\/\n\nint main(){\n    std::ofstream output(\"out.dat\", std::ostream::out);\n\n    auto state = generate_initial(INITIAL_SIZE, TIMESTEP);\n    \/\/std::cout << state.v_ref << '\\t' << state.particles.size() << '\\n';\n\n    diffuse(state, output);\n}\n\n\/*----------------------------------------------------------------------------\/\/\n* SUBROUTINES\n*-----------------------------------------------------------------------------*\/\n\n\/\/ Populate a distribution of particles for QMC\n\/\/ Unlike Anderson, we are initilizing each psip randomly from a distribution.\n\/\/ This might screw things up, because\nh3plus generate_initial(size_t initial_size, double dt) {\n    h3plus state(MAX_SIZE);\n    state.dt = dt;\n    state.v_ref = 0;\n    state.energy = 0;\n    state.global_id = 0;\n\n    \/\/ Random generation\n    \/*\n    std::uniform_real_distribution<double> uniform(-1.0,1.0);\n    for (size_t i = 0; i < initial_size; ++i){\n        coord coords;\n        for (auto& coord : coords) {\n            coord = random_double(uniform);\n        }\n        state.particles.emplace_back(state.global_id++, std::move(coords));\n    }\n    *\/\n\n    \/\/ Static generation\n    for (size_t i = 0; i < initial_size; ++i) {\n        coord coords = {RADIUS, RADIUS, RADIUS, -RADIUS, -RADIUS, -RADIUS};\n        state.particles.emplace_back(state.global_id++, std::move(coords));\n    }\n\n    find_weights(state);\n    return state;\n}\n\n\/\/ Calculates energy of a configuration and stores it into the final element of\n\/\/ the MatrixPSIP\n\/\/ Note: When calculating the potential, I am not sure whether we need to use\n\/\/       absolute value of distance or the distance, itself.\n\/\/ Note: Inefficient. Can calculate energy on the fly with every generation of\n\/\/       psip. Think about it.\n\/\/ Note: v_ref will be a dummy variable for now.\nvoid find_weights(h3plus& state){\n    \/\/ Note that this is specific to the Anderson paper\n    \/\/ Finding the distance between electrons, then adding the distances\n    \/\/ from the protons to the electrons.\n    double potential_sum = 0.0;\n\n    for (auto& particle : state.particles) {\n        double dist = sqrt((particle.coords[0] - particle.coords[3]) *\n                           (particle.coords[0] - particle.coords[3]) +\n                           (particle.coords[1] - particle.coords[4]) *\n                           (particle.coords[1] - particle.coords[4]) +\n                           (particle.coords[2] - particle.coords[5]) *\n                           (particle.coords[2] - particle.coords[5]));\n\n        double potential = 1.0 \/ dist;\n        for (const auto& coord : particle.coords) {\n            potential -= 1.0 \/ std::abs(coord);\n        }\n        particle.potential = potential;\n        potential_sum += potential;\n    }\n\n    size_t num_particles = state.particles.size();\n    std::uniform_real_distribution<double> uniform(0.0, 1.0);\n\n    \/\/ This needs type promotion to either double or int so it doesn't\n    \/\/ underflow. Since it's going to be used as a double, might as well\n    \/\/ do that directly.\n    double particles_diff = static_cast<double>(num_particles) - INITIAL_SIZE;\n\n    \/\/ defining the new reference potential\n    state.energy = potential_sum \/ num_particles;\n    state.v_ref = state.energy - particles_diff \/ (INITIAL_SIZE * state.dt);\n\n    #pragma omp parallel for\n    for (size_t i = 0; i < num_particles; ++i) {\n        auto& particle = state.particles[i];\n        double w = 1.0 - (particle.potential - state.v_ref) * state.dt;\n        particle.m_n = std::min((int)(w + random_double(uniform)), 3);\n    }\n}\n\n\/\/ 6D random walk\nvoid random_walk(h3plus& state) {\n    std::normal_distribution<double> gaussian(0.0, 1.0);\n    size_t particles_size = state.particles.size();\n\n    #pragma omp parallel for\n    for (size_t i = 0; i < particles_size; ++i) {\n        auto& particle = state.particles[i];\n        for (auto& coord : particle.coords) {\n            coord += sqrt(state.dt) * random_double(gaussian);\n        }\n    }\n}\n\n\/\/ Branching scheme\nvoid branch(h3plus& state){\n    find_weights(state);\n\n    \/\/ I only cache this so I can fit the 80 character limit\n    auto& particles = state.particles;\n\n    \/\/ First, remove particles where M_n is zero, as per the Kosztin paper.\n    \/\/ It's better to do it first to avoid unnecessary bookkeeping later\n    auto remove = std::remove_if(std::begin(particles), std::end(particles),\n                                 [](const particle& p) { return p.m_n == 0; });\n    particles.erase(remove, std::end(particles));\n\n    \/\/ Iterate over the current set of particles and add new ones as necessary.\n    \/\/ The added particles will be skipped in the current iteration (which is\n    \/\/ essentially the same behaviour as we had before)\n    \/\/ We have to use direct indexes because of iterator invalidation.\n    \/\/ Also note that current_size is cached outside of the loop, this is to\n    \/\/ avoid unnecessary work\n    size_t current_size = particles.size();\n    for (size_t i = 0; i < current_size; ++i) {\n        switch (particles[i].m_n) {\n            case 2:\n                particles.emplace_back(state.global_id++, particles[i]);\n                break;\n            case 3:\n                particles.emplace_back(state.global_id++, particles[i]);\n                particles.emplace_back(state.global_id++, particles[i]);\n                break;\n        }\n    }\n\n    \/\/ Just truncate if the vector would grow too large.\n    \/\/ This should - theoratically - not happen\n    if (particles.size() > MAX_SIZE) {\n        particles.erase(std::begin(particles) + MAX_SIZE, std::end(particles));\n    }\n}\n\n\/\/ Random walking of matrix of position created in populate\n\/\/ Step 1: Move particles via 6D random walk\n\/\/ Step 2: Destroy and create particles as need based on Anderson\n\/\/ Step 3: check energy, end if needed.\nvoid diffuse(h3plus& state, std::ostream& output){\n\n    \/\/ For now, I am going to set a definite number of timesteps\n    \/\/ This will be replaced by a while loop in the future.\n\n    \/\/ double diff = 1.0;\n    \/\/ while (diff > 0.01) {\n    for (size_t t = 0; t < 10000; t++){\n        double v_last = state.v_ref;\n\n        random_walk(state);\n        branch(state);\n        \/\/ diff = sqrt((v_last - state.v_ref) * (v_last - state.v_ref));\n\n        \/\/ Debug information for the current timestep\n        std::cout << std::fixed\n                  << state.v_ref << '\\t'\n                  << state.particles.size() << '\\n';\n        if (t % 1000 == 0) {\n            print_visualization_data(output, state);\n        }\n    }\n}\n\nvoid print_visualization_data(std::ostream& output, const h3plus& state) {\n    for (const auto& particle : state.particles) {\n        for (const auto& coord : particle.coords) {\n            output << std::fixed << coord << \"\\t\";\n        }\n        output << particle.m_n << \"\\t\";\n        output << particle.id << \"\\n\";\n    }\n    output << '\\n' << '\\n';\n}\n\nstatic inline std::mt19937& random_engine() {\n    static std::random_device rd;\n    \/\/ Use the Mersenne twister, the default random engine is not guaranteed\n    \/\/ to be high quality. Use engine(rd()) if you want to test different cases\n    static thread_local std::mt19937 engine; \/\/ engine(rd());\n    return engine;\n}\n\ntemplate <typename T>\ndouble random_double(T distribution) {\n    return distribution(random_engine());\n}\n<commit_msg>added in a better representation of the distances for our potential calculation.<commit_after>\/*-------------Anderson.cpp---------------------------------------------------\/\/\n*\n*              Anderson.cpp -- Diffusion Monte Carlo for Schroedy\n*\n* Purpose: Implement the quantum Monte Carlo (diffusion) by Anderson:\n*             http:\/\/www.huy-nguyen.com\/wp-content\/uploads\/QMC-papers\/Anderson-JChemPhys-1975.pdf\n*          For H3+, with 3 protons and 2 electrons\n*\n*    Note: This algorithm may be improved by later work\n*          A \"psip\" is an imaginary configuration of electrons in space.\n*          Requires c++11 for random and Eigen for matrix\n*          Protons assume to be at origin\n*          A lot of this algorithm is more easily understood here:\n*              http:\/\/www.thphys.uni-heidelberg.de\/~wetzel\/qmc2006\/KOSZ96.pdf\n*\n*-----------------------------------------------------------------------------*\/\n\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <vector>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <omp.h>\n#include <random>\n\nconstexpr size_t DOF = 6;\nconstexpr size_t MAX_SIZE = 2000;\nconstexpr size_t INITIAL_SIZE = 1000;\nconstexpr double TIMESTEP = 0.1;\nconstexpr double RADIUS = 1.8;\n\nusing coord = std::array<double, DOF>;\n\nstruct proton_pos{\n    double pos[3][3] = {{0}};\n};\n\nstruct particle {\n    coord coords;\n    int id;\n    int m_n;\n    double potential;\n\n    \/\/ This is the constructor used for the initial state creation\n    particle(int id, const coord& coords)\n      : coords(coords), id(id),  m_n(-1), potential(0.0) {}\n\n    \/\/ Used in branching to create a replica of an other particle.\n    \/\/ Sets m_n to 1 so even if this was to be processed, it will\n    \/\/ be ignored as per the algorithm described in the Kosztin paper\n    particle(int id, const particle& p)\n      : coords(p.coords), id(id),  m_n(1), potential(p.potential) {}\n\n};\n\nstruct h3plus {\n    std::vector<particle> particles;\n    double v_ref, dt, energy;\n    int global_id;\n\n    \/\/ This wouldn't be strictly necessary,\n    \/\/ but pre-allocating should speed up the program a bit\n    h3plus(size_t reserved_size) {\n        particles.reserve(reserved_size);\n    }\n\n    proton_pos proton;\n\n};\n\n\/\/ Populate a distribution of particles for QMC\nh3plus generate_initial(size_t initial_size, double dt);\n\n\/\/ Calculates energy of a configuration and stores it as the particle potential\nvoid find_weights(h3plus& state);\n\n\/\/ Random walk\nvoid random_walk(h3plus& state);\n\n\/\/ Branching scheme\nvoid branch(h3plus& state);\n\n\/\/ Random walking of matrix of position created in populate\nvoid diffuse(h3plus& state, std::ostream& output);\n\nvoid print_visualization_data(std::ostream& output, const h3plus& state);\n\ntemplate <typename T>\ndouble random_double(T distribution);\n\n\/*----------------------------------------------------------------------------\/\/\n* MAIN\n*-----------------------------------------------------------------------------*\/\n\nint main(){\n    std::ofstream output(\"out.dat\", std::ostream::out);\n\n    auto state = generate_initial(INITIAL_SIZE, TIMESTEP);\n    \/\/std::cout << state.v_ref << '\\t' << state.particles.size() << '\\n';\n\n    diffuse(state, output);\n}\n\n\/*----------------------------------------------------------------------------\/\/\n* SUBROUTINES\n*-----------------------------------------------------------------------------*\/\n\n\/\/ Populate a distribution of particles for QMC\n\/\/ Unlike Anderson, we are initilizing each psip randomly from a distribution.\n\/\/ This might screw things up, because\nh3plus generate_initial(size_t initial_size, double dt) {\n    h3plus state(MAX_SIZE);\n    state.dt = dt;\n    state.v_ref = 0;\n    state.energy = 0;\n    state.global_id = 0;\n    for (size_t i = 0; i < 3; i++){\n        state.proton.pos[i][i] = 0.1;\n    }\n\n    \/\/ Random generation\n    \/*\n    std::uniform_real_distribution<double> uniform(-1.0,1.0);\n    for (size_t i = 0; i < initial_size; ++i){\n        coord coords;\n        for (auto& coord : coords) {\n            coord = random_double(uniform);\n        }\n        state.particles.emplace_back(state.global_id++, std::move(coords));\n    }\n    *\/\n\n    \/\/ Static generation\n    for (size_t i = 0; i < initial_size; ++i) {\n        coord coords = {RADIUS, RADIUS, RADIUS, -RADIUS, -RADIUS, -RADIUS};\n        state.particles.emplace_back(state.global_id++, std::move(coords));\n    }\n\n    find_weights(state);\n    return state;\n}\n\n\/\/ Calculates energy of a configuration and stores it into the final element of\n\/\/ the MatrixPSIP\n\/\/ Note: When calculating the potential, I am not sure whether we need to use\n\/\/       absolute value of distance or the distance, itself.\n\/\/ Note: Inefficient. Can calculate energy on the fly with every generation of\n\/\/       psip. Think about it.\n\/\/ Note: v_ref will be a dummy variable for now.\nvoid find_weights(h3plus& state){\n    \/\/ Note that this is specific to the Anderson paper\n    \/\/ Finding the distance between electrons, then adding the distances\n    \/\/ from the protons to the electrons.\n    double potential_sum = 0.0, dist2;\n\n    for (auto& particle : state.particles) {\n        double dist1 = sqrt((particle.coords[0] - particle.coords[3]) *\n                           (particle.coords[0] - particle.coords[3]) +\n                           (particle.coords[1] - particle.coords[4]) *\n                           (particle.coords[1] - particle.coords[4]) +\n                           (particle.coords[2] - particle.coords[5]) *\n                           (particle.coords[2] - particle.coords[5]));\n\n        double potential = 1.0 \/ dist1;\n\n        for (size_t i = 0; i < 3; i++){\n            dist1 = sqrt((particle.coords[0] - state.proton.pos[i][0]) *\n                         (particle.coords[0] - state.proton.pos[i][0]) +\n                         (particle.coords[1] - state.proton.pos[i][1]) *\n                         (particle.coords[1] - state.proton.pos[i][1]) +\n                         (particle.coords[2] - state.proton.pos[i][2]) *\n                         (particle.coords[2] - state.proton.pos[i][2]));\n\n            dist2 = sqrt((particle.coords[3] - state.proton.pos[i][0]) *\n                         (particle.coords[3] - state.proton.pos[i][0]) +\n                         (particle.coords[4] - state.proton.pos[i][1]) *\n                         (particle.coords[4] - state.proton.pos[i][1]) +\n                         (particle.coords[5] - state.proton.pos[i][2]) *\n                         (particle.coords[5] - state.proton.pos[i][2]));\n\n            potential -= ((1\/dist1) + (1\/dist2));\n\n        }\n        \/*\n        for (const auto& coord : particle.coords) {\n            \n            potential -= 1.0 \/ std::abs(coord);\n        }\n        *\/\n        particle.potential = potential;\n        potential_sum += potential;\n    }\n\n    size_t num_particles = state.particles.size();\n    std::uniform_real_distribution<double> uniform(0.0, 1.0);\n\n    \/\/ This needs type promotion to either double or int so it doesn't\n    \/\/ underflow. Since it's going to be used as a double, might as well\n    \/\/ do that directly.\n    double particles_diff = static_cast<double>(num_particles) - INITIAL_SIZE;\n\n    \/\/ defining the new reference potential\n    state.energy = potential_sum \/ num_particles;\n    state.v_ref = state.energy - particles_diff \/ (INITIAL_SIZE * state.dt);\n\n    #pragma omp parallel for\n    for (size_t i = 0; i < num_particles; ++i) {\n        auto& particle = state.particles[i];\n        double w = 1.0 - (particle.potential - state.v_ref) * state.dt;\n        particle.m_n = std::min((int)(w + random_double(uniform)), 3);\n    }\n}\n\n\/\/ 6D random walk\nvoid random_walk(h3plus& state) {\n    std::normal_distribution<double> gaussian(0.0, 1.0);\n    size_t particles_size = state.particles.size();\n\n    #pragma omp parallel for\n    for (size_t i = 0; i < particles_size; ++i) {\n        auto& particle = state.particles[i];\n        for (auto& coord : particle.coords) {\n            coord += sqrt(state.dt) * random_double(gaussian);\n        }\n    }\n}\n\n\/\/ Branching scheme\nvoid branch(h3plus& state){\n    find_weights(state);\n\n    \/\/ I only cache this so I can fit the 80 character limit\n    auto& particles = state.particles;\n\n    \/\/ First, remove particles where M_n is zero, as per the Kosztin paper.\n    \/\/ It's better to do it first to avoid unnecessary bookkeeping later\n    auto remove = std::remove_if(std::begin(particles), std::end(particles),\n                                 [](const particle& p) { return p.m_n == 0; });\n    particles.erase(remove, std::end(particles));\n\n    \/\/ Iterate over the current set of particles and add new ones as necessary.\n    \/\/ The added particles will be skipped in the current iteration (which is\n    \/\/ essentially the same behaviour as we had before)\n    \/\/ We have to use direct indexes because of iterator invalidation.\n    \/\/ Also note that current_size is cached outside of the loop, this is to\n    \/\/ avoid unnecessary work\n    size_t current_size = particles.size();\n    for (size_t i = 0; i < current_size; ++i) {\n        switch (particles[i].m_n) {\n            case 2:\n                particles.emplace_back(state.global_id++, particles[i]);\n                break;\n            case 3:\n                particles.emplace_back(state.global_id++, particles[i]);\n                particles.emplace_back(state.global_id++, particles[i]);\n                break;\n        }\n    }\n\n    \/\/ Just truncate if the vector would grow too large.\n    \/\/ This should - theoratically - not happen\n    if (particles.size() > MAX_SIZE) {\n        particles.erase(std::begin(particles) + MAX_SIZE, std::end(particles));\n    }\n}\n\n\/\/ Random walking of matrix of position created in populate\n\/\/ Step 1: Move particles via 6D random walk\n\/\/ Step 2: Destroy and create particles as need based on Anderson\n\/\/ Step 3: check energy, end if needed.\nvoid diffuse(h3plus& state, std::ostream& output){\n\n    \/\/ For now, I am going to set a definite number of timesteps\n    \/\/ This will be replaced by a while loop in the future.\n\n    \/\/ double diff = 1.0;\n    \/\/ while (diff > 0.01) {\n    for (size_t t = 0; t < 1000; t++){\n        double v_last = state.v_ref;\n\n        random_walk(state);\n        branch(state);\n        \/\/ diff = sqrt((v_last - state.v_ref) * (v_last - state.v_ref));\n\n        \/\/ Debug information for the current timestep\n        std::cout << std::fixed\n                  << state.v_ref << '\\t'\n                  << state.particles.size() << '\\n';\n        if (t % 10 == 0) {\n            print_visualization_data(output, state);\n        }\n    }\n}\n\nvoid print_visualization_data(std::ostream& output, const h3plus& state) {\n    for (const auto& particle : state.particles) {\n        for (const auto& coord : particle.coords) {\n            output << std::fixed << coord << \"\\t\";\n        }\n        output << particle.m_n << \"\\t\";\n        output << particle.id << \"\\n\";\n    }\n    output << '\\n' << '\\n';\n}\n\nstatic inline std::mt19937& random_engine() {\n    static std::random_device rd;\n    \/\/ Use the Mersenne twister, the default random engine is not guaranteed\n    \/\/ to be high quality. Use engine(rd()) if you want to test different cases\n    static thread_local std::mt19937 engine; \/\/ engine(rd());\n    return engine;\n}\n\ntemplate <typename T>\ndouble random_double(T distribution) {\n    return distribution(random_engine());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n    @brief OSVR server driver for OpenVR\n\n    @date 2015\n\n    @author\n    Sensics, Inc.\n    <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2015 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 \"ServerDriver_OSVR.h\"\n\n#include \"OSVRTrackedHMD.h\"         \/\/ for OSVRTrackedHMD\n#include \"OSVRTrackingReference.h\"  \/\/ for OSVRTrackingReference\n#include \"platform_fixes.h\"         \/\/ strcasecmp\n#include \"make_unique.h\"            \/\/ for std::make_unique\n#include \"Logging.h\"                \/\/ for OSVR_LOG, Logging\n\n\/\/ Library\/third-party includes\n#include <openvr_driver.h>          \/\/ for everything in vr namespace\n\n#include <osvr\/ClientKit\/Context.h> \/\/ for osvr::clientkit::ClientContext\n#include <osvr\/Util\/PlatformConfig.h>\n\n\/\/ Standard includes\n#include <vector>                   \/\/ for std::vector\n#include <cstring>                  \/\/ for std::strcmp\n#include <string>                   \/\/ for std::string\n#include <chrono>\n#include <thread>\n#include <atomic>\n\nnamespace {\n\nstatic std::thread client_update_thread;\nstatic std::atomic<bool> client_update_thread_quit;\nstatic std::atomic<int> client_update_thread_ms_wait;\nstatic void client_update_thread_work(osvr::clientkit::ClientContext ctx)\n{\n    while (!client_update_thread_quit.load()) {\n        ctx.update();\n        std::this_thread::sleep_for(std::chrono::milliseconds(client_update_thread_ms_wait.load()));\n    }\n    client_update_thread_quit = false;\n}\n\n} \/\/ anonymous namespace\n\nvr::EVRInitError ServerDriver_OSVR::Init(vr::IVRDriverContext* driver_context)\n{\n    VR_INIT_SERVER_DRIVER_CONTEXT(driver_context);\n\n    Logging::instance().setDriverLog(vr::VRDriverLog());\n\n    settings_ = std::make_unique<Settings>();\n    standbyWaitPeriod_ = settings_->getSetting<int>(\"standbyWaitPeriod\", 100);\n    activeWaitPeriod_ = settings_->getSetting<int>(\"activeWaitPeriod\", 1);\n    OSVR_LOG(debug) << \"Standby wait period is \" << standbyWaitPeriod_ << \" ms.\";\n    OSVR_LOG(debug) << \"Active wait period is \" << activeWaitPeriod_ << \" ms.\";\n\n    context_ = std::make_unique<osvr::clientkit::ClientContext>(\"org.osvr.SteamVR\");\n\n    trackedDevices_.emplace_back(std::make_unique<OSVRTrackedHMD>(*(context_.get())));\n    trackedDevices_.emplace_back(std::make_unique<OSVRTrackingReference>(*(context_.get())));\n\n    for (auto& tracked_device : trackedDevices_) {\n        vr::VRServerDriverHost()->TrackedDeviceAdded(tracked_device->getId(), tracked_device->getDeviceClass(), tracked_device.get());\n    }\n\n    client_update_thread_quit.store(false);\n    client_update_thread_ms_wait.store(activeWaitPeriod_);\n    client_update_thread = std::thread(client_update_thread_work, context_->get());\n\n    return vr::VRInitError_None;\n}\n\nvoid ServerDriver_OSVR::Cleanup()\n{\n    client_update_thread_quit.store(true);\n    if (client_update_thread.joinable()) {\n        client_update_thread.join();\n    }\n\n    trackedDevices_.clear();\n    context_.reset();\n    VR_CLEANUP_SERVER_DRIVER_CONTEXT();\n}\n\nconst char* const* ServerDriver_OSVR::GetInterfaceVersions()\n{\n    return vr::k_InterfaceVersions;\n}\n\nvoid ServerDriver_OSVR::RunFrame()\n{\n    \/\/ do nothing\n}\n\nbool ServerDriver_OSVR::ShouldBlockStandbyMode()\n{\n    return false;\n}\n\nvoid ServerDriver_OSVR::EnterStandby()\n{\n    OSVR_LOG(debug) << \"Entering standby mode...\";\n    client_update_thread_ms_wait.store(standbyWaitPeriod_);\n}\n\nvoid ServerDriver_OSVR::LeaveStandby()\n{\n    OSVR_LOG(debug) << \"Leaving standby mode...\";\n    client_update_thread_ms_wait.store(activeWaitPeriod_);\n}\n\n<commit_msg>Pass ref to client context to update loop thread.<commit_after>\/** @file\n    @brief OSVR server driver for OpenVR\n\n    @date 2015\n\n    @author\n    Sensics, Inc.\n    <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2015 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 \"ServerDriver_OSVR.h\"\n\n#include \"OSVRTrackedHMD.h\"         \/\/ for OSVRTrackedHMD\n#include \"OSVRTrackingReference.h\"  \/\/ for OSVRTrackingReference\n#include \"platform_fixes.h\"         \/\/ strcasecmp\n#include \"make_unique.h\"            \/\/ for std::make_unique\n#include \"Logging.h\"                \/\/ for OSVR_LOG, Logging\n\n\/\/ Library\/third-party includes\n#include <openvr_driver.h>          \/\/ for everything in vr namespace\n\n#include <osvr\/ClientKit\/Context.h> \/\/ for osvr::clientkit::ClientContext\n#include <osvr\/Util\/PlatformConfig.h>\n\n\/\/ Standard includes\n#include <vector>                   \/\/ for std::vector\n#include <cstring>                  \/\/ for std::strcmp\n#include <string>                   \/\/ for std::string\n#include <chrono>\n#include <thread>\n#include <atomic>\n\nnamespace {\n\nstatic std::thread client_update_thread;\nstatic std::atomic<bool> client_update_thread_quit;\nstatic std::atomic<int> client_update_thread_ms_wait;\nstatic void client_update_thread_work(osvr::clientkit::ClientContext& ctx)\n{\n    while (!client_update_thread_quit.load()) {\n        ctx.update();\n        std::this_thread::sleep_for(std::chrono::milliseconds(client_update_thread_ms_wait.load()));\n    }\n    client_update_thread_quit = false;\n}\n\n} \/\/ anonymous namespace\n\nvr::EVRInitError ServerDriver_OSVR::Init(vr::IVRDriverContext* driver_context)\n{\n    VR_INIT_SERVER_DRIVER_CONTEXT(driver_context);\n\n    Logging::instance().setDriverLog(vr::VRDriverLog());\n\n    settings_ = std::make_unique<Settings>();\n    standbyWaitPeriod_ = settings_->getSetting<int>(\"standbyWaitPeriod\", 100);\n    activeWaitPeriod_ = settings_->getSetting<int>(\"activeWaitPeriod\", 1);\n    OSVR_LOG(debug) << \"Standby wait period is \" << standbyWaitPeriod_ << \" ms.\";\n    OSVR_LOG(debug) << \"Active wait period is \" << activeWaitPeriod_ << \" ms.\";\n\n    context_ = std::make_unique<osvr::clientkit::ClientContext>(\"org.osvr.SteamVR\");\n\n    trackedDevices_.emplace_back(std::make_unique<OSVRTrackedHMD>(*(context_.get())));\n    trackedDevices_.emplace_back(std::make_unique<OSVRTrackingReference>(*(context_.get())));\n\n    for (auto& tracked_device : trackedDevices_) {\n        vr::VRServerDriverHost()->TrackedDeviceAdded(tracked_device->getId(), tracked_device->getDeviceClass(), tracked_device.get());\n    }\n\n    client_update_thread_quit.store(false);\n    client_update_thread_ms_wait.store(activeWaitPeriod_);\n    client_update_thread = std::thread(client_update_thread_work, std::ref(*context_));\n\n    return vr::VRInitError_None;\n}\n\nvoid ServerDriver_OSVR::Cleanup()\n{\n    client_update_thread_quit.store(true);\n    if (client_update_thread.joinable()) {\n        client_update_thread.join();\n    }\n\n    trackedDevices_.clear();\n    context_.reset();\n    VR_CLEANUP_SERVER_DRIVER_CONTEXT();\n}\n\nconst char* const* ServerDriver_OSVR::GetInterfaceVersions()\n{\n    return vr::k_InterfaceVersions;\n}\n\nvoid ServerDriver_OSVR::RunFrame()\n{\n    \/\/ do nothing\n}\n\nbool ServerDriver_OSVR::ShouldBlockStandbyMode()\n{\n    return false;\n}\n\nvoid ServerDriver_OSVR::EnterStandby()\n{\n    OSVR_LOG(debug) << \"Entering standby mode...\";\n    client_update_thread_ms_wait.store(standbyWaitPeriod_);\n}\n\nvoid ServerDriver_OSVR::LeaveStandby()\n{\n    OSVR_LOG(debug) << \"Leaving standby mode...\";\n    client_update_thread_ms_wait.store(activeWaitPeriod_);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ArgParse.h\"\n\nusing namespace std;\n\nArgParse::ArgParse(int argc, char* argv[])\n{\n    for(int a=1;a<argc;++a){\n        if(argv[a][0]=='-'){\n            string in(argv[a]),trig,val;\n            trig=in.substr(1,in.find('=')-1);\n            if(in.find('=')==string::npos) {\n                val='1';\/\/true\n            } else {\n                val=in.substr(in.find('=')+1);\n            }\n            m_streams[trig]=val;\n        } else {\n            ifstream fin(argv[a]);\n            string in,trig,val;\n            while(getline(fin,in)) {\n                if(in.size()==0 || in[0]=='#') continue;\n                trig=in.substr(0,in.find('='));\n                if(in.find('=')==string::npos) {\n                    val='1';\n                } else {\n                    val=in.substr(in.find('=')+1);\n                }\n                m_streams[trig]=val;\n            }\n        }\n    }\n}\n\ndouble ArgParse::d(const string& str) const\n{\n    return stod(m_streams.at(str));\n}\n\nint ArgParse::i(const string& str) const\n{\n    return stoi(m_streams.at(str));\n}\n\nbool ArgParse::b(const string& str) const\n{\n    return stoi(m_streams.at(str));\n}\n string ArgParse::s(const string& str) const\n{\n    return m_streams.at(str);\n}\n<commit_msg>bug fixes<commit_after>#include \"ArgParse.h\"\n#include <stdexcept>\n\nusing namespace std;\n\nArgParse::ArgParse(int argc, char* argv[])\n{\n    for(int a=1;a<argc;++a){\n        if(argv[a][0]=='-'){\n            string in(argv[a]),trig,val;\n            trig=in.substr(1,in.find('=')-1);\n            if(in.find('=')==string::npos) {\n                val='1';\/\/true\n            } else {\n                val=in.substr(in.find('=')+1);\n            }\n            m_streams[trig]=val;\n        } else {\n            ifstream fin(argv[a]);\n            string in,trig,val;\n            while(getline(fin,in)) {\n                if(in.size()==0 || in[0]=='#') continue;\n                trig=in.substr(0,in.find('='));\n                if(in.find('=')==string::npos) {\n                    val='1';\n                } else {\n                    val=in.substr(in.find('=')+1);\n                }\n                m_streams[trig]=val;\n            }\n        }\n    }\n}\n\ndouble ArgParse::d(const string& str) const\n{\n    double out;\n    try {\n        out=stod(m_streams.at(str));\n        return out;\n    } catch(out_of_range err) {\n        cerr<<\"No member \\\"\"<<str<<\"\\\" found in arguments\"<<endl;\n        throw err;\n    }\n}\n\nint ArgParse::i(const string& str) const\n{\n    int out;\n    try {\n        out=stoi(m_streams.at(str));\n        return out;\n    } catch (out_of_range err) {\n        cerr<<\"No member \\\"\"<<str<<\"\\\" found in arguments\"<<endl;\n        throw err;\n    }\n}\n\nbool ArgParse::b(const string& str) const\n{\n    bool out;\n    try {\n        out=stoi(m_streams.at(str));\n        return out;\n    } catch (out_of_range err) {\n        cerr<<\"No member \\\"\"<<str<<\"\\\" found in arguments\"<<endl;\n        throw err;\n    }\n}\n string ArgParse::s(const string& str) const\n{\n    string out;\n    try {\n        out=m_streams.at(str);\n        return out;\n    } catch (out_of_range err) {\n        cerr<<\"No member \\\"\"<<str<<\"\\\" found in arguments\"<<endl;\n        throw err;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"timeentryeditorwidget.h\"\n#include \"ui_timeentryeditorwidget.h\"\n\n#include <QMessageBox>\n\n#include \"toggl_api.h\"\n\nTimeEntryEditorWidget::TimeEntryEditorWidget(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::TimeEntryEditorWidget),\n    guid(\"\"),\n    timeEntryAutocompleteNeedsUpdate(false),\n    projectAutocompleteNeedsUpdate(false),\n    workspaceSelectNeedsUpdate(false),\n    clientSelectNeedsUpdate(false)\n{\n    ui->setupUi(this);\n\n    setVisible(false);\n\n    ui->addNewProject->setText(\"<a href=\\\"#add_new_project\\\">Add new project<\/a>\");\n\n    connect(TogglApi::instance, SIGNAL(displayLogin(bool,uint64_t)),\n            this, SLOT(displayLogin(bool,uint64_t)));\n\n    connect(TogglApi::instance, SIGNAL(displayTimeEntryList(bool,QVector<TimeEntryView*>)),\n            this, SLOT(displayTimeEntryList(bool,QVector<TimeEntryView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayTimeEntryEditor(bool,TimeEntryView*,QString)),\n            this, SLOT(displayTimeEntryEditor(bool,TimeEntryView*,QString)));\n\n    connect(TogglApi::instance, SIGNAL(displayTags(QVector<GenericView*>)),\n            this, SLOT(displayTags(QVector<GenericView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayWorkspaceSelect(QVector<GenericView*>)),\n            this, SLOT(displayWorkspaceSelect(QVector<GenericView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayProjectAutocomplete(QVector<AutocompleteView*>)),\n            this, SLOT(displayProjectAutocomplete(QVector<AutocompleteView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayTimeEntryAutocomplete(QVector<AutocompleteView*>)),\n            this, SLOT(displayTimeEntryAutocomplete(QVector<AutocompleteView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayClientSelect(QVector<GenericView*>)),\n            this, SLOT(displayClientSelect(QVector<GenericView*>)));\n}\n\nTimeEntryEditorWidget::~TimeEntryEditorWidget()\n{\n    delete ui;\n}\n\nvoid TimeEntryEditorWidget::displayTags(\n    QVector<GenericView*> tags)\n{\n\n}\n\nvoid TimeEntryEditorWidget::displayClientSelect(\n    QVector<GenericView *> list)\n{\n    clientSelectUpdate = list;\n    clientSelectNeedsUpdate = true;\n    if (ui->newProjectClient->hasFocus())\n    {\n        return;\n    }\n\n    u_int64_t workspaceID = 0;\n    QVariant data = ui->newProjectWorkspace->currentData();\n    if (data.canConvert<GenericView *>())\n    {\n        GenericView *view = data.value<GenericView *>();\n        workspaceID = view->ID;\n    }\n    ui->newProjectClient->clear();\n    ui->newProjectClient->addItem(\"\");\n    foreach(GenericView *view, clientSelectUpdate)\n    {\n        if (workspaceID && workspaceID != view->WID)\n        {\n            continue;\n        }\n        ui->newProjectClient->addItem(view->Name, QVariant::fromValue(view));\n    }\n    clientSelectNeedsUpdate = false;\n}\n\nvoid TimeEntryEditorWidget::displayTimeEntryAutocomplete(\n    QVector<AutocompleteView *> list)\n{\n    timeEntryAutocompleteUpdate = list;\n    timeEntryAutocompleteNeedsUpdate = true;\n    if (ui->description->hasFocus())\n    {\n        return;\n    }\n    ui->description->clear();\n    ui->description->addItem(\"\");\n    foreach(AutocompleteView *view, timeEntryAutocompleteUpdate)\n    {\n        ui->description->addItem(view->Text, QVariant::fromValue(view));\n    }\n    timeEntryAutocompleteNeedsUpdate = false;\n}\n\nvoid TimeEntryEditorWidget::displayProjectAutocomplete(\n    QVector<AutocompleteView *> list)\n{\n    projectAutocompleteUpdate = list;\n    projectAutocompleteNeedsUpdate = true;\n    if (ui->project->hasFocus())\n    {\n        return;\n    }\n    ui->project->clear();\n    ui->project->addItem(\"\");\n    foreach(AutocompleteView *view, projectAutocompleteUpdate)\n    {\n        ui->project->addItem(view->Text, QVariant::fromValue(view));\n    }\n    projectAutocompleteNeedsUpdate = false;\n}\n\nvoid TimeEntryEditorWidget::displayWorkspaceSelect(\n    QVector<GenericView *> list)\n{\n    workspaceSelectUpdate = list;\n    workspaceSelectNeedsUpdate = true;\n    if (ui->newProjectWorkspace->hasFocus())\n    {\n        return;\n    }\n    ui->newProjectWorkspace->clear();\n    foreach(GenericView *view, workspaceSelectUpdate)\n    {\n        ui->newProjectWorkspace->addItem(view->Name, QVariant::fromValue(view));\n    }\n    workspaceSelectNeedsUpdate = false;\n}\n\nvoid TimeEntryEditorWidget::displayLogin(\n    const bool open,\n    const uint64_t user_id)\n{\n    if (open || !user_id)\n    {\n        setVisible(false);\n    }\n}\n\nvoid TimeEntryEditorWidget::displayTimeEntryList(\n    const bool open,\n    QVector<TimeEntryView *> list)\n{\n    if (open)\n    {\n        setVisible(false);\n    }\n}\n\nvoid TimeEntryEditorWidget::displayTimeEntryEditor(\n    const bool open,\n    TimeEntryView *view,\n    const QString focused_field_name)\n{\n    if (open)\n    {\n        ui->timeDetails->setVisible(false);\n        ui->timeOverview->setVisible(true);\n\n        ui->newProject->setVisible(false);\n        ui->addNewProject->setVisible(true);\n\n        setVisible(true);\n    }\n\n    guid = view->GUID;\n\n    ui->description->setEditText(view->Description);\n    ui->project->setEditText(view->ProjectAndTaskLabel);\n    ui->start->setText(view->StartTimeString);\n    ui->stop->setText(view->EndTimeString);\n    ui->dateEdit->setDateTime(QDateTime::fromTime_t(view->Started));\n    ui->duration->setText(view->Duration);\n    ui->billable->setChecked(view->Billable);\n    ui->timeOverview->setText(\"<a href=\\\"#view_time_details\\\">\" + view->timeOverview() + \"<\/a>\");\n\n    ui->lastUpdate->setVisible(view->UpdatedAt);\n    ui->lastUpdate->setText(view->lastUpdate());\n}\n\nvoid TimeEntryEditorWidget::on_doneButton_clicked()\n{\n    TogglApi::instance->viewTimeEntryList();\n}\n\nvoid TimeEntryEditorWidget::on_deleteButton_clicked()\n{\n    if (QMessageBox::Ok == QMessageBox(QMessageBox::Question,\n                                        \"Delete this time entry?\",\n                                        \"Deleted time entries cannot be restored.\",\n                                        QMessageBox::Ok|QMessageBox::Cancel).exec())\n    {\n        TogglApi::instance->deleteTimeEntry(guid);\n    }\n}\n\nvoid TimeEntryEditorWidget::on_addNewProject_linkActivated(const QString &link)\n{\n    ui->addNewProject->setVisible(false);\n    ui->newProject->setVisible(true);\n    ui->newProjectName->setFocus();\n}\n\nvoid TimeEntryEditorWidget::on_timeOverview_linkActivated(const QString &link)\n{\n    ui->timeOverview->setVisible(false);\n    ui->timeDetails->setVisible(true);\n    ui->duration->setFocus();\n}\n\nvoid TimeEntryEditorWidget::on_newProjectWorkspace_currentIndexChanged(int index)\n{\n    displayClientSelect(clientSelectUpdate);\n}\n<commit_msg>Dont overwrite user changes (linux)<commit_after>#include \"timeentryeditorwidget.h\"\n#include \"ui_timeentryeditorwidget.h\"\n\n#include <QMessageBox>\n\n#include \"toggl_api.h\"\n\nTimeEntryEditorWidget::TimeEntryEditorWidget(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::TimeEntryEditorWidget),\n    guid(\"\"),\n    timeEntryAutocompleteNeedsUpdate(false),\n    projectAutocompleteNeedsUpdate(false),\n    workspaceSelectNeedsUpdate(false),\n    clientSelectNeedsUpdate(false)\n{\n    ui->setupUi(this);\n\n    setVisible(false);\n\n    ui->addNewProject->setText(\"<a href=\\\"#add_new_project\\\">Add new project<\/a>\");\n\n    connect(TogglApi::instance, SIGNAL(displayLogin(bool,uint64_t)),\n            this, SLOT(displayLogin(bool,uint64_t)));\n\n    connect(TogglApi::instance, SIGNAL(displayTimeEntryList(bool,QVector<TimeEntryView*>)),\n            this, SLOT(displayTimeEntryList(bool,QVector<TimeEntryView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayTimeEntryEditor(bool,TimeEntryView*,QString)),\n            this, SLOT(displayTimeEntryEditor(bool,TimeEntryView*,QString)));\n\n    connect(TogglApi::instance, SIGNAL(displayTags(QVector<GenericView*>)),\n            this, SLOT(displayTags(QVector<GenericView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayWorkspaceSelect(QVector<GenericView*>)),\n            this, SLOT(displayWorkspaceSelect(QVector<GenericView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayProjectAutocomplete(QVector<AutocompleteView*>)),\n            this, SLOT(displayProjectAutocomplete(QVector<AutocompleteView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayTimeEntryAutocomplete(QVector<AutocompleteView*>)),\n            this, SLOT(displayTimeEntryAutocomplete(QVector<AutocompleteView*>)));\n\n    connect(TogglApi::instance, SIGNAL(displayClientSelect(QVector<GenericView*>)),\n            this, SLOT(displayClientSelect(QVector<GenericView*>)));\n}\n\nTimeEntryEditorWidget::~TimeEntryEditorWidget()\n{\n    delete ui;\n}\n\nvoid TimeEntryEditorWidget::displayTags(\n    QVector<GenericView*> tags)\n{\n\n}\n\nvoid TimeEntryEditorWidget::displayClientSelect(\n    QVector<GenericView *> list)\n{\n    clientSelectUpdate = list;\n    clientSelectNeedsUpdate = true;\n    if (ui->newProjectClient->hasFocus())\n    {\n        return;\n    }\n\n    u_int64_t workspaceID = 0;\n    QVariant data = ui->newProjectWorkspace->currentData();\n    if (data.canConvert<GenericView *>())\n    {\n        GenericView *view = data.value<GenericView *>();\n        workspaceID = view->ID;\n    }\n    ui->newProjectClient->clear();\n    ui->newProjectClient->addItem(\"\");\n    foreach(GenericView *view, clientSelectUpdate)\n    {\n        if (workspaceID && workspaceID != view->WID)\n        {\n            continue;\n        }\n        ui->newProjectClient->addItem(view->Name, QVariant::fromValue(view));\n    }\n    clientSelectNeedsUpdate = false;\n}\n\nvoid TimeEntryEditorWidget::displayTimeEntryAutocomplete(\n    QVector<AutocompleteView *> list)\n{\n    timeEntryAutocompleteUpdate = list;\n    timeEntryAutocompleteNeedsUpdate = true;\n    if (ui->description->hasFocus())\n    {\n        return;\n    }\n    ui->description->clear();\n    ui->description->addItem(\"\");\n    foreach(AutocompleteView *view, timeEntryAutocompleteUpdate)\n    {\n        ui->description->addItem(view->Text, QVariant::fromValue(view));\n    }\n    timeEntryAutocompleteNeedsUpdate = false;\n}\n\nvoid TimeEntryEditorWidget::displayProjectAutocomplete(\n    QVector<AutocompleteView *> list)\n{\n    projectAutocompleteUpdate = list;\n    projectAutocompleteNeedsUpdate = true;\n    if (ui->project->hasFocus())\n    {\n        return;\n    }\n    ui->project->clear();\n    ui->project->addItem(\"\");\n    foreach(AutocompleteView *view, projectAutocompleteUpdate)\n    {\n        ui->project->addItem(view->Text, QVariant::fromValue(view));\n    }\n    projectAutocompleteNeedsUpdate = false;\n}\n\nvoid TimeEntryEditorWidget::displayWorkspaceSelect(\n    QVector<GenericView *> list)\n{\n    workspaceSelectUpdate = list;\n    workspaceSelectNeedsUpdate = true;\n    if (ui->newProjectWorkspace->hasFocus())\n    {\n        return;\n    }\n    ui->newProjectWorkspace->clear();\n    foreach(GenericView *view, workspaceSelectUpdate)\n    {\n        ui->newProjectWorkspace->addItem(view->Name, QVariant::fromValue(view));\n    }\n    workspaceSelectNeedsUpdate = false;\n}\n\nvoid TimeEntryEditorWidget::displayLogin(\n    const bool open,\n    const uint64_t user_id)\n{\n    if (open || !user_id)\n    {\n        setVisible(false);\n    }\n}\n\nvoid TimeEntryEditorWidget::displayTimeEntryList(\n    const bool open,\n    QVector<TimeEntryView *> list)\n{\n    if (open)\n    {\n        setVisible(false);\n    }\n}\n\nvoid TimeEntryEditorWidget::displayTimeEntryEditor(\n    const bool open,\n    TimeEntryView *view,\n    const QString focused_field_name)\n{\n    if (open)\n    {\n        ui->timeDetails->setVisible(false);\n        ui->timeOverview->setVisible(true);\n\n        ui->newProject->setVisible(false);\n        ui->addNewProject->setVisible(true);\n\n        setVisible(true);\n    }\n\n    guid = view->GUID;\n\n    if (!ui->description->hasFocus())\n    {\n        ui->description->setEditText(view->Description);\n    }\n    if (!ui->project->hasFocus())\n    {\n        ui->project->setEditText(view->ProjectAndTaskLabel);\n    }\n    if (!ui->start->hasFocus())\n    {\n        ui->start->setText(view->StartTimeString);\n    }\n    if (!ui->stop->hasFocus())\n    {\n        ui->stop->setText(view->EndTimeString);\n    }\n    if (!ui->dateEdit->hasFocus())\n    {\n        ui->dateEdit->setDateTime(QDateTime::fromTime_t(view->Started));\n    }\n    if (!ui->duration->hasFocus())\n    {\n        ui->duration->setText(view->Duration);\n    }\n    ui->billable->setChecked(view->Billable);\n    ui->timeOverview->setText(\"<a href=\\\"#view_time_details\\\">\" + view->timeOverview() + \"<\/a>\");\n\n    ui->lastUpdate->setVisible(view->UpdatedAt);\n    ui->lastUpdate->setText(view->lastUpdate());\n}\n\nvoid TimeEntryEditorWidget::on_doneButton_clicked()\n{\n    TogglApi::instance->viewTimeEntryList();\n}\n\nvoid TimeEntryEditorWidget::on_deleteButton_clicked()\n{\n    if (QMessageBox::Ok == QMessageBox(QMessageBox::Question,\n                                        \"Delete this time entry?\",\n                                        \"Deleted time entries cannot be restored.\",\n                                        QMessageBox::Ok|QMessageBox::Cancel).exec())\n    {\n        TogglApi::instance->deleteTimeEntry(guid);\n    }\n}\n\nvoid TimeEntryEditorWidget::on_addNewProject_linkActivated(const QString &link)\n{\n    ui->addNewProject->setVisible(false);\n    ui->newProject->setVisible(true);\n    ui->newProjectName->setFocus();\n}\n\nvoid TimeEntryEditorWidget::on_timeOverview_linkActivated(const QString &link)\n{\n    ui->timeOverview->setVisible(false);\n    ui->timeDetails->setVisible(true);\n    ui->duration->setFocus();\n}\n\nvoid TimeEntryEditorWidget::on_newProjectWorkspace_currentIndexChanged(int index)\n{\n    displayClientSelect(clientSelectUpdate);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2017, Vlad Meșco\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, 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\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 ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY 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 \"control.h\"\n#include \"logger.h\"\n#include \"string_utils.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstdio>\n\n#define FIND_WHAT(id, then) \\\n    auto found = FindWhat(id); \\\n    if(found == model_->whats.end()) then;\n\n#define DIRTY() do{\\\n    model_->dirty = true; \\\n}while(0)\n\nauto Control::FindWhat(evData id) -> decltype(model_->whats)::iterator\n{\n    LOGGER(l);\n    auto found = std::find_if(model_->whats.begin(), model_->whats.end(), [id](WhatEntry& e) -> bool {\n                return e.name == id;\n            });\n    if(found == model_->whats.end())\n    {\n        l(L\"Failed to find %ls...\", id.c_str());\n    }\n    return found;\n}\n\nvoid Control::SetWhosName(evData oldName, std::wstring name)\n{\n    LOGGER(l);\n    auto found = std::find_if(model_->whos.begin(), model_->whos.end(), [oldName](WhoEntry& e) -> bool {\n                return e.name == oldName;\n            });\n    if(found == model_->whos.end())\n    {\n        l(L\"Failed to find %ls...\", oldName.c_str());\n        return;\n    }\n    found->name = name;\n    DIRTY();\n    Event e = {\n        Event::WHO,\n        Event::NAME_CHANGED,\n        oldName,\n        name.c_str(),\n        source_\n    };\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\n                v->OnEvent(&e);\n            });\n}\n\nvoid Control::SetWhosParam(Control::evData id, std::wstring key, std::wstring value)\n{\n    LOGGER(l);\n    auto foundEntry = std::find_if(model_->whos.begin(), model_->whos.end(), [id](WhoEntry& e) -> bool {\n                return e.name == id;\n            });\n    if(foundEntry == model_->whos.end()) {\n        l(L\"Failed to find %ls...\", id.c_str());\n        return;\n    }\n    auto&& params = foundEntry->params;\n\n    auto found = std::find_if(params.begin(), params.end(), [key](WhoEntry::Params::reference p) -> bool {\n                return p.first == key;\n            });\n    if(found == params.end()) {\n        params.emplace_back(key, value);\n    } else {\n        found->second = value;\n    }\n\n    DIRTY();\n    Event e = {\n        Event::WHO,\n        Event::CHANGED,\n        id,\n        key,\n        source_\n    };\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\n                v->OnEvent(&e);\n            });\n}\n\nvoid Control::SetWhosSchema(Control::evData id, Schema const* schema)\n{\n    LOGGER(l);\n    auto foundEntry = std::find_if(model_->whos.begin(), model_->whos.end(), [id](WhoEntry& e) -> bool {\n                return e.name == id;\n            });\n    if(foundEntry == model_->whos.end()) {\n        l(L\"Failed to find %ls...\", id.c_str());\n        return;\n    }\n\n    foundEntry->schema = schema;\n\n    DIRTY();\n    Event e = {\n        Event::WHO,\n        Event::CHANGED,\n        id,\n        L\" schema\",\n        source_\n    };\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\n                v->OnEvent(&e);\n            });\n}\n\nvoid Control::SetWhatsName(Control::evData id, std::wstring name)\n{\n    LOGGER(l);\n    auto found = std::find_if(model_->whats.begin(), model_->whats.end(), [id](WhatEntry& e) -> bool {\n                return e.name == id;\n            });\n    if(found == model_->whats.end())\n    {\n        l(L\"Failed to find %ls...\", id.c_str());\n        return;\n    }\n    found->name = name;\n    DIRTY();\n    Event e = {\n        Event::WHAT,\n        Event::NAME_CHANGED,\n        id,\n        name.c_str(),\n        source_\n    };\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\n                v->OnEvent(&e);\n            });\n}\n\nvoid Control::SetWhatsBpm(Control::evData id, std::wstring bpm)\n{\n    LOGGER(l);\n    FIND_WHAT(id, return);\n    found->bpm = bpm;\n    DIRTY();\n    Event e = {\n        Event::WHAT,\n        Event::CHANGED,\n        id,\n        L\"bpm\",\n        source_\n    };\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\n                v->OnEvent(&e);\n            });\n}\n\nEvent::Source Control::InsertColumnPrivate(evData id, column_p_t before, wchar_t c)\n{\n    LOGGER(l);\n    if(id.empty()\n            || id == L\"OUTPUT\")\n    {\n        Column col;\n        auto size = model_->whats.size();\n        model_->output.insert(before, column_t(size, c));\n        DIRTY();\n        return Event::OUTPUT;\n    }\n\n    FIND_WHAT(id, return Event::WHAT);\n    auto size = model_->whos.size();\n    found->columns.insert(before, column_t(size, c));\n    DIRTY();\n    return Event::WHAT;\n}\n\nvoid Control::InsertColumn(evData id, column_p_t before, wchar_t c)\n{\n    LOGGER(l);\n    auto source = InsertColumnPrivate(id, before, c);\n    if(source == Event::GLOBAL) return;\n    Event e = {\n        source,\n        Event::CHANGED,\n        id,\n        L\"\",\n        source_\n    };\n    Fire(&e);\n}\n\nvoid Control::Fire(Event* ev)\n{\n    LOGGER(l);\n    std::for_each(model_->views.begin(), model_->views.end(), [&ev](View* v) {\n                v->OnEvent(ev);\n            });\n}\n\nvoid Control::SetCell(evData what, column_p_t before, int row, wchar_t c)\n{\n    LOGGER(l);\n    if(what.empty()\n            || what == L\"OUTPUT\")\n    {\n        if(before == model_->output.end())\n        {\n            (void) InsertColumnPrivate(what, before, ' ');\n            auto pos = model_->output.end();\n            std::advance(pos, -1);\n            return SetCell(what, pos, row, c);\n        }\n        auto pos = before->begin();\n        std::advance(pos, row);\n        *pos = c;\n        DIRTY();\n        Event e  = {\n            Event::OUTPUT,\n            Event::CHANGED,\n            what,\n            L\"\",\n            source_\n        };\n        Fire(&e);\n        return;\n    }\n\n    FIND_WHAT(what, return);\n    if(before == found->columns.end())\n    {\n        (void) InsertColumnPrivate(what, before, (c != ' ') ? '.' : ' ');\n        auto pos = found->columns.end();\n        std::advance(pos, -1);\n        return SetCell(what, pos, row, c);\n    }\n    auto pos = before->begin();\n    std::advance(pos, row);\n    *pos = c;\n    DIRTY();\n    Event e  = {\n        Event::WHAT,\n        Event::CHANGED,\n        what,\n        L\"\",\n        source_\n    };\n    Fire(&e);\n}\n\nvoid Control::BlankCell(evData id, int col, int row)\n{\n    LOGGER(l);\n    if(id.empty()\n            || id == L\"OUTPUT\")\n    {\n        auto it = model_->output.begin();\n        std::advance(it, col);\n        auto& col = *it;\n        if(row < 0 || row >= col.size())\n        {\n            l(L\"my=%d is out of bounds\\n\", row);\n            return;\n        }\n        auto cit = col.begin();\n        std::advance(cit, row);\n        auto& cell = *cit;\n        cell = (cell == L' ')\n            ? L' '\n            : L'.'\n            ;\n\n        Event e = {\n            Event::OUTPUT,\n            Event::CHANGED,\n            id,\n            L\"\",\n            source_\n        };\n        Fire(&e);\n\n        return;\n    } else {\n        FIND_WHAT(id, return);\n        WhatEntry& we = *found;\n        auto it = we.columns.begin();\n        std::advance(it, col);\n        auto& col = *it;\n        if(row < 0 || row >= col.size())\n        {\n            l(L\"my=%d is out of bounds\\n\", row);\n            return;\n        }\n        auto cit = col.begin();\n        std::advance(cit, row);\n        auto& cell = *cit;\n        cell = (cell == L' ')\n            ? L' '\n            : L'.'\n            ;\n\n        Event e = {\n            Event::WHAT,\n            Event::CHANGED,\n            id,\n            L\"\",\n            source_\n        };\n        Fire(&e);\n\n        return;\n    }\n}\n<commit_msg>mark document dirty on backspace<commit_after>\/*\r\nCopyright (c) 2017, Vlad Meșco\r\nAll rights reserved.\r\n\r\nRedistribution and use in source and binary forms, with or without\r\nmodification, are permitted provided that the following conditions are met:\r\n\r\n* Redistributions of source code must retain the above copyright notice, this\r\n  list of conditions and the following disclaimer.\r\n\r\n* Redistributions in binary form must reproduce the above copyright notice,\r\n  this list of conditions and the following disclaimer in the documentation\r\n  and\/or other materials provided with the distribution.\r\n\r\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\r\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\r\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\r\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\r\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\r\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n*\/\r\n\r\n#include \"control.h\"\r\n#include \"logger.h\"\r\n#include \"string_utils.h\"\r\n\r\n#include <algorithm>\r\n#include <cassert>\r\n#include <cstdio>\r\n\r\n#define FIND_WHAT(id, then) \\\r\n    auto found = FindWhat(id); \\\r\n    if(found == model_->whats.end()) then;\r\n\r\n#define DIRTY() do{\\\r\n    model_->dirty = true; \\\r\n}while(0)\r\n\r\nauto Control::FindWhat(evData id) -> decltype(model_->whats)::iterator\r\n{\r\n    LOGGER(l);\r\n    auto found = std::find_if(model_->whats.begin(), model_->whats.end(), [id](WhatEntry& e) -> bool {\r\n                return e.name == id;\r\n            });\r\n    if(found == model_->whats.end())\r\n    {\r\n        l(L\"Failed to find %ls...\", id.c_str());\r\n    }\r\n    return found;\r\n}\r\n\r\nvoid Control::SetWhosName(evData oldName, std::wstring name)\r\n{\r\n    LOGGER(l);\r\n    auto found = std::find_if(model_->whos.begin(), model_->whos.end(), [oldName](WhoEntry& e) -> bool {\r\n                return e.name == oldName;\r\n            });\r\n    if(found == model_->whos.end())\r\n    {\r\n        l(L\"Failed to find %ls...\", oldName.c_str());\r\n        return;\r\n    }\r\n    found->name = name;\r\n    DIRTY();\r\n    Event e = {\r\n        Event::WHO,\r\n        Event::NAME_CHANGED,\r\n        oldName,\r\n        name.c_str(),\r\n        source_\r\n    };\r\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\r\n                v->OnEvent(&e);\r\n            });\r\n}\r\n\r\nvoid Control::SetWhosParam(Control::evData id, std::wstring key, std::wstring value)\r\n{\r\n    LOGGER(l);\r\n    auto foundEntry = std::find_if(model_->whos.begin(), model_->whos.end(), [id](WhoEntry& e) -> bool {\r\n                return e.name == id;\r\n            });\r\n    if(foundEntry == model_->whos.end()) {\r\n        l(L\"Failed to find %ls...\", id.c_str());\r\n        return;\r\n    }\r\n    auto&& params = foundEntry->params;\r\n\r\n    auto found = std::find_if(params.begin(), params.end(), [key](WhoEntry::Params::reference p) -> bool {\r\n                return p.first == key;\r\n            });\r\n    if(found == params.end()) {\r\n        params.emplace_back(key, value);\r\n    } else {\r\n        found->second = value;\r\n    }\r\n\r\n    DIRTY();\r\n    Event e = {\r\n        Event::WHO,\r\n        Event::CHANGED,\r\n        id,\r\n        key,\r\n        source_\r\n    };\r\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\r\n                v->OnEvent(&e);\r\n            });\r\n}\r\n\r\nvoid Control::SetWhosSchema(Control::evData id, Schema const* schema)\r\n{\r\n    LOGGER(l);\r\n    auto foundEntry = std::find_if(model_->whos.begin(), model_->whos.end(), [id](WhoEntry& e) -> bool {\r\n                return e.name == id;\r\n            });\r\n    if(foundEntry == model_->whos.end()) {\r\n        l(L\"Failed to find %ls...\", id.c_str());\r\n        return;\r\n    }\r\n\r\n    foundEntry->schema = schema;\r\n\r\n    DIRTY();\r\n    Event e = {\r\n        Event::WHO,\r\n        Event::CHANGED,\r\n        id,\r\n        L\" schema\",\r\n        source_\r\n    };\r\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\r\n                v->OnEvent(&e);\r\n            });\r\n}\r\n\r\nvoid Control::SetWhatsName(Control::evData id, std::wstring name)\r\n{\r\n    LOGGER(l);\r\n    auto found = std::find_if(model_->whats.begin(), model_->whats.end(), [id](WhatEntry& e) -> bool {\r\n                return e.name == id;\r\n            });\r\n    if(found == model_->whats.end())\r\n    {\r\n        l(L\"Failed to find %ls...\", id.c_str());\r\n        return;\r\n    }\r\n    found->name = name;\r\n    DIRTY();\r\n    Event e = {\r\n        Event::WHAT,\r\n        Event::NAME_CHANGED,\r\n        id,\r\n        name.c_str(),\r\n        source_\r\n    };\r\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\r\n                v->OnEvent(&e);\r\n            });\r\n}\r\n\r\nvoid Control::SetWhatsBpm(Control::evData id, std::wstring bpm)\r\n{\r\n    LOGGER(l);\r\n    FIND_WHAT(id, return);\r\n    found->bpm = bpm;\r\n    DIRTY();\r\n    Event e = {\r\n        Event::WHAT,\r\n        Event::CHANGED,\r\n        id,\r\n        L\"bpm\",\r\n        source_\r\n    };\r\n    std::for_each(model_->views.begin(), model_->views.end(), [&e](View* v) {\r\n                v->OnEvent(&e);\r\n            });\r\n}\r\n\r\nEvent::Source Control::InsertColumnPrivate(evData id, column_p_t before, wchar_t c)\r\n{\r\n    LOGGER(l);\r\n    if(id.empty()\r\n            || id == L\"OUTPUT\")\r\n    {\r\n        Column col;\r\n        auto size = model_->whats.size();\r\n        model_->output.insert(before, column_t(size, c));\r\n        DIRTY();\r\n        return Event::OUTPUT;\r\n    }\r\n\r\n    FIND_WHAT(id, return Event::WHAT);\r\n    auto size = model_->whos.size();\r\n    found->columns.insert(before, column_t(size, c));\r\n    DIRTY();\r\n    return Event::WHAT;\r\n}\r\n\r\nvoid Control::InsertColumn(evData id, column_p_t before, wchar_t c)\r\n{\r\n    LOGGER(l);\r\n    auto source = InsertColumnPrivate(id, before, c);\r\n    if(source == Event::GLOBAL) return;\r\n    Event e = {\r\n        source,\r\n        Event::CHANGED,\r\n        id,\r\n        L\"\",\r\n        source_\r\n    };\r\n    Fire(&e);\r\n}\r\n\r\nvoid Control::Fire(Event* ev)\r\n{\r\n    LOGGER(l);\r\n    std::for_each(model_->views.begin(), model_->views.end(), [&ev](View* v) {\r\n                v->OnEvent(ev);\r\n            });\r\n}\r\n\r\nvoid Control::SetCell(evData what, column_p_t before, int row, wchar_t c)\r\n{\r\n    LOGGER(l);\r\n    if(what.empty()\r\n            || what == L\"OUTPUT\")\r\n    {\r\n        if(before == model_->output.end())\r\n        {\r\n            (void) InsertColumnPrivate(what, before, ' ');\r\n            auto pos = model_->output.end();\r\n            std::advance(pos, -1);\r\n            return SetCell(what, pos, row, c);\r\n        }\r\n        auto pos = before->begin();\r\n        std::advance(pos, row);\r\n        *pos = c;\r\n        DIRTY();\r\n        Event e  = {\r\n            Event::OUTPUT,\r\n            Event::CHANGED,\r\n            what,\r\n            L\"\",\r\n            source_\r\n        };\r\n        Fire(&e);\r\n        return;\r\n    }\r\n\r\n    FIND_WHAT(what, return);\r\n    if(before == found->columns.end())\r\n    {\r\n        (void) InsertColumnPrivate(what, before, (c != ' ') ? '.' : ' ');\r\n        auto pos = found->columns.end();\r\n        std::advance(pos, -1);\r\n        return SetCell(what, pos, row, c);\r\n    }\r\n    auto pos = before->begin();\r\n    std::advance(pos, row);\r\n    *pos = c;\r\n    DIRTY();\r\n    Event e  = {\r\n        Event::WHAT,\r\n        Event::CHANGED,\r\n        what,\r\n        L\"\",\r\n        source_\r\n    };\r\n    Fire(&e);\r\n}\r\n\r\nvoid Control::BlankCell(evData id, int col, int row)\r\n{\r\n    LOGGER(l);\r\n    if(id.empty()\r\n            || id == L\"OUTPUT\")\r\n    {\r\n        auto it = model_->output.begin();\r\n        std::advance(it, col);\r\n        auto& col = *it;\r\n        if(row < 0 || row >= col.size())\r\n        {\r\n            l(L\"my=%d is out of bounds\\n\", row);\r\n            return;\r\n        }\r\n        auto cit = col.begin();\r\n        std::advance(cit, row);\r\n        auto& cell = *cit;\r\n        cell = (cell == L' ')\r\n            ? L' '\r\n            : L'.'\r\n            ;\r\n        DIRTY();    \r\n\r\n        Event e = {\r\n            Event::OUTPUT,\r\n            Event::CHANGED,\r\n            id,\r\n            L\"\",\r\n            source_\r\n        };\r\n        Fire(&e);\r\n\r\n        return;\r\n    } else {\r\n        FIND_WHAT(id, return);\r\n        WhatEntry& we = *found;\r\n        auto it = we.columns.begin();\r\n        std::advance(it, col);\r\n        auto& col = *it;\r\n        if(row < 0 || row >= col.size())\r\n        {\r\n            l(L\"my=%d is out of bounds\\n\", row);\r\n            return;\r\n        }\r\n        auto cit = col.begin();\r\n        std::advance(cit, row);\r\n        auto& cell = *cit;\r\n        cell = (cell == L' ')\r\n            ? L' '\r\n            : L'.'\r\n            ;\r\n        DIRTY();\r\n\r\n        Event e = {\r\n            Event::WHAT,\r\n            Event::CHANGED,\r\n            id,\r\n            L\"\",\r\n            source_\r\n        };\r\n        Fire(&e);\r\n\r\n        return;\r\n    }\r\n}\r\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.14  2001\/09\/24 15:31:13  peiyongz\n * DTV Reorganization: inherit from AbstractStringValidator\n *\n * Revision 1.12  2001\/08\/21 18:42:53  peiyongz\n * Bugzilla# 2816: cleanUp() declared with external linkage and called\n *                          before defined as inline\n *\n * Revision 1.11  2001\/06\/20 17:56:09  peiyongz\n * support for \"fixed\" option on constrainning facets\n *\n * Revision 1.10  2001\/05\/29 19:49:36  tng\n * Schema: Constraint Checking Fix in datatypeValidators.  By Pei Yong Zhang.\n *\n * Revision 1.9  2001\/05\/28 21:11:18  tng\n * Schema: Various DatatypeValidator fix.  By Pei Yong Zhang\n *\n * Revision 1.8  2001\/05\/23 16:05:11  tng\n * Schema: NormalizedString fix.  By Pei Yong Zhang.\n *\n * Revision 1.7  2001\/05\/23 15:45:25  tng\n * Schema: NormalizedString fix.  By Pei Yong Zhang.\n *\n * Revision 1.6  2001\/05\/18 13:36:48  tng\n * Schema: Catch RegularExpression exception and NumberFormatException\n *\n * Revision 1.5  2001\/05\/18 13:23:51  tng\n * Schema: Exception messages in DatatypeValidator.  By Pei Yong Zhang.\n *\n * Revision 1.4  2001\/05\/16 14:33:40  tng\n * Schema Constraint checking fix.\n *\n * Revision 1.3  2001\/05\/11 17:17:28  tng\n * Schema: DatatypeValidator fixes.  By Pei Yong Zhang.\n *\n * Revision 1.2  2001\/05\/11 13:27:29  tng\n * Copyright update.\n *\n * Revision 1.1  2001\/05\/09 18:43:42  tng\n * Add StringDatatypeValidator and BooleanDatatypeValidator.  By Pei Yong Zhang.\n *\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <validators\/datatype\/StringDatatypeValidator.hpp>\n#include <validators\/schema\/SchemaSymbols.hpp>\n#include <validators\/datatype\/InvalidDatatypeFacetException.hpp>\n#include <validators\/datatype\/InvalidDatatypeValueException.hpp>\n\nstatic const int BUF_LEN = 64;\nstatic XMLCh value1[BUF_LEN+1];\nstatic XMLCh value2[BUF_LEN+1];\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nStringDatatypeValidator::StringDatatypeValidator()\n:AbstractStringValidator(0, 0, 0, DatatypeValidator::String)\n,fWhiteSpace(DatatypeValidator::PRESERVE)\n{}\n\nStringDatatypeValidator::~StringDatatypeValidator()\n{}\n\nStringDatatypeValidator::StringDatatypeValidator(\n                          DatatypeValidator*            const baseValidator\n                        , RefHashTableOf<KVStringPair>* const facets\n                        , RefVectorOf<XMLCh>*           const enums\n                        , const int                           finalSet)\n:AbstractStringValidator(baseValidator, facets, finalSet, DatatypeValidator::String)\n,fWhiteSpace(DatatypeValidator::PRESERVE)\n{\n    init(baseValidator, facets, enums);\n}\n\nDatatypeValidator* StringDatatypeValidator::newInstance(\n                                      RefHashTableOf<KVStringPair>* const facets\n                                    , RefVectorOf<XMLCh>*           const enums\n                                    , const int                           finalSet)\n{\n    return (DatatypeValidator*) new StringDatatypeValidator(this, facets, enums, finalSet);\n}\n\nshort StringDatatypeValidator::getWSFacet() const \n{\n    return fWhiteSpace;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Utilities\n\/\/ ---------------------------------------------------------------------------\nvoid StringDatatypeValidator::assignAdditionalFacet(const XMLCh* const key\n                                                  , const XMLCh* const value)\n{\n    if (XMLString::compareString(key, SchemaSymbols::fgELT_WHITESPACE)==0)\n    {\n        \/\/ whiteSpace = preserve | replace | collapse\n        if (XMLString::compareString(value, SchemaSymbols::fgWS_PRESERVE) == 0)\n            setWhiteSpace(DatatypeValidator::PRESERVE);\n        else if (XMLString::compareString(value, SchemaSymbols::fgWS_REPLACE) == 0)\n            setWhiteSpace(DatatypeValidator::REPLACE);\n        else if (XMLString::compareString(value, SchemaSymbols::fgWS_COLLAPSE) == 0)\n            setWhiteSpace(DatatypeValidator::COLLAPSE);\n        else\n            ThrowXML1(InvalidDatatypeFacetException, XMLExcepts::FACET_Invalid_WS, value);\n        \/\/(\"whiteSpace value '\" + ws + \"' must be one of 'preserve', 'replace', 'collapse'.\");\n\n        setFacetsDefined(DatatypeValidator::FACET_WHITESPACE);\n    }\n    else\n    {\n        ThrowXML1(InvalidDatatypeFacetException\n                , XMLExcepts::FACET_Invalid_Tag\n                , key);\n    }\n}\n\nvoid StringDatatypeValidator::inheritAdditionalFacet()\n{\n    StringDatatypeValidator *pBaseValidator = (StringDatatypeValidator*) getBaseValidator();\n\n    \/\/ inherit whitespace\n    if (((pBaseValidator->getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) !=0) &&\n        ((getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) == 0))\n    {\n        setWhiteSpace(getBaseValidator()->getWSFacet());\n        setFacetsDefined(DatatypeValidator::FACET_WHITESPACE);\n    }\n}\n\nvoid StringDatatypeValidator::checkAdditionalFacetConstraints() const\n{\n\n    StringDatatypeValidator *pBaseValidator = (StringDatatypeValidator*) getBaseValidator();\n    short    thisWSFacet = getWSFacet();\n    short    baseWSFacet = pBaseValidator->getWSFacet();\n\n    \/\/ check 4.3.6.c1 error: whitespace\n    if (((getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) != 0) &&\n        ((pBaseValidator->getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) != 0 ))\n    {\n        if ((baseWSFacet == DatatypeValidator::COLLAPSE) &&\n            ((thisWSFacet == DatatypeValidator::PRESERVE) ||\n             (thisWSFacet == DatatypeValidator::REPLACE)))\n             ThrowXML(InvalidDatatypeFacetException, XMLExcepts::FACET_WS_collapse);\n\n        if ((baseWSFacet == DatatypeValidator::REPLACE) &&\n            (thisWSFacet == DatatypeValidator::PRESERVE))\n            ThrowXML(InvalidDatatypeFacetException, XMLExcepts::FACET_WS_replace);\n\n        if (((pBaseValidator->getFixed() & DatatypeValidator::FACET_WHITESPACE) !=0) &&\n            ( thisWSFacet != baseWSFacet))\n        {\n            ThrowXML2(InvalidDatatypeFacetException\n                        , XMLExcepts::FACET_whitespace_base_fixed\n                        , getWSstring(thisWSFacet)\n                        , getWSstring(baseWSFacet));\n        }\n    }\n\n}\n\nvoid StringDatatypeValidator::checkAdditionalFacet(const XMLCh* const content) const\n{    \n    \/\/\n    \/\/ check WhiteSpace\n    \/\/\n    if ((getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) != 0 )\n    {\n        if ( getWSFacet() == DatatypeValidator::REPLACE )\n        {\n            if (!XMLString::isWSReplaced(content))\n                ThrowXML1(InvalidDatatypeValueException, XMLExcepts::VALUE_WS_replaced, content);\n        }\n        else if ( getWSFacet() == DatatypeValidator::COLLAPSE )\n        {\n            if (!XMLString::isWSCollapsed(content))\n                ThrowXML1(InvalidDatatypeValueException, XMLExcepts::VALUE_WS_collapsed, content);\n        }\n\n    }\n}\n\nvoid StringDatatypeValidator::checkValueSpace(const XMLCh* const content)\n{}\n\nint StringDatatypeValidator::getLength(const XMLCh* const content) const\n{\n    return XMLString::stringLen(content);\n}\n\n\/**\n  * End of file StringDatatypeValidator.cpp\n  *\/\n<commit_msg>Check baseValidator in assignAdditinoalFacet() and inheritAdditionalFacet()<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.15  2001\/09\/25 15:58:14  peiyongz\n * Check baseValidator in assignAdditinoalFacet() and inheritAdditionalFacet()\n *\n * Revision 1.14  2001\/09\/24 15:31:13  peiyongz\n * DTV Reorganization: inherit from AbstractStringValidator\n *\n * Revision 1.12  2001\/08\/21 18:42:53  peiyongz\n * Bugzilla# 2816: cleanUp() declared with external linkage and called\n *                          before defined as inline\n *\n * Revision 1.11  2001\/06\/20 17:56:09  peiyongz\n * support for \"fixed\" option on constrainning facets\n *\n * Revision 1.10  2001\/05\/29 19:49:36  tng\n * Schema: Constraint Checking Fix in datatypeValidators.  By Pei Yong Zhang.\n *\n * Revision 1.9  2001\/05\/28 21:11:18  tng\n * Schema: Various DatatypeValidator fix.  By Pei Yong Zhang\n *\n * Revision 1.8  2001\/05\/23 16:05:11  tng\n * Schema: NormalizedString fix.  By Pei Yong Zhang.\n *\n * Revision 1.7  2001\/05\/23 15:45:25  tng\n * Schema: NormalizedString fix.  By Pei Yong Zhang.\n *\n * Revision 1.6  2001\/05\/18 13:36:48  tng\n * Schema: Catch RegularExpression exception and NumberFormatException\n *\n * Revision 1.5  2001\/05\/18 13:23:51  tng\n * Schema: Exception messages in DatatypeValidator.  By Pei Yong Zhang.\n *\n * Revision 1.4  2001\/05\/16 14:33:40  tng\n * Schema Constraint checking fix.\n *\n * Revision 1.3  2001\/05\/11 17:17:28  tng\n * Schema: DatatypeValidator fixes.  By Pei Yong Zhang.\n *\n * Revision 1.2  2001\/05\/11 13:27:29  tng\n * Copyright update.\n *\n * Revision 1.1  2001\/05\/09 18:43:42  tng\n * Add StringDatatypeValidator and BooleanDatatypeValidator.  By Pei Yong Zhang.\n *\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <validators\/datatype\/StringDatatypeValidator.hpp>\n#include <validators\/schema\/SchemaSymbols.hpp>\n#include <validators\/datatype\/InvalidDatatypeFacetException.hpp>\n#include <validators\/datatype\/InvalidDatatypeValueException.hpp>\n\nstatic const int BUF_LEN = 64;\nstatic XMLCh value1[BUF_LEN+1];\nstatic XMLCh value2[BUF_LEN+1];\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nStringDatatypeValidator::StringDatatypeValidator()\n:AbstractStringValidator(0, 0, 0, DatatypeValidator::String)\n,fWhiteSpace(DatatypeValidator::PRESERVE)\n{}\n\nStringDatatypeValidator::~StringDatatypeValidator()\n{}\n\nStringDatatypeValidator::StringDatatypeValidator(\n                          DatatypeValidator*            const baseValidator\n                        , RefHashTableOf<KVStringPair>* const facets\n                        , RefVectorOf<XMLCh>*           const enums\n                        , const int                           finalSet)\n:AbstractStringValidator(baseValidator, facets, finalSet, DatatypeValidator::String)\n,fWhiteSpace(DatatypeValidator::PRESERVE)\n{\n    init(baseValidator, facets, enums);\n}\n\nDatatypeValidator* StringDatatypeValidator::newInstance(\n                                      RefHashTableOf<KVStringPair>* const facets\n                                    , RefVectorOf<XMLCh>*           const enums\n                                    , const int                           finalSet)\n{\n    return (DatatypeValidator*) new StringDatatypeValidator(this, facets, enums, finalSet);\n}\n\nshort StringDatatypeValidator::getWSFacet() const \n{\n    return fWhiteSpace;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Utilities\n\/\/ ---------------------------------------------------------------------------\nvoid StringDatatypeValidator::assignAdditionalFacet(const XMLCh* const key\n                                                  , const XMLCh* const value)\n{\n    if (XMLString::compareString(key, SchemaSymbols::fgELT_WHITESPACE)==0)\n    {\n        \/\/ whiteSpace = preserve | replace | collapse\n        if (XMLString::compareString(value, SchemaSymbols::fgWS_PRESERVE) == 0)\n            setWhiteSpace(DatatypeValidator::PRESERVE);\n        else if (XMLString::compareString(value, SchemaSymbols::fgWS_REPLACE) == 0)\n            setWhiteSpace(DatatypeValidator::REPLACE);\n        else if (XMLString::compareString(value, SchemaSymbols::fgWS_COLLAPSE) == 0)\n            setWhiteSpace(DatatypeValidator::COLLAPSE);\n        else\n            ThrowXML1(InvalidDatatypeFacetException, XMLExcepts::FACET_Invalid_WS, value);\n        \/\/(\"whiteSpace value '\" + ws + \"' must be one of 'preserve', 'replace', 'collapse'.\");\n\n        setFacetsDefined(DatatypeValidator::FACET_WHITESPACE);\n    }\n    else\n    {\n        ThrowXML1(InvalidDatatypeFacetException\n                , XMLExcepts::FACET_Invalid_Tag\n                , key);\n    }\n}\n\nvoid StringDatatypeValidator::inheritAdditionalFacet()\n{\n    StringDatatypeValidator *pBaseValidator = (StringDatatypeValidator*) getBaseValidator();\n\n    if (!pBaseValidator)\n        return;\n\n    \/\/ inherit whitespace\n    if (((pBaseValidator->getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) !=0) &&\n        ((getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) == 0))\n    {\n        setWhiteSpace(getBaseValidator()->getWSFacet());\n        setFacetsDefined(DatatypeValidator::FACET_WHITESPACE);\n    }\n}\n\nvoid StringDatatypeValidator::checkAdditionalFacetConstraints() const\n{\n\n    StringDatatypeValidator *pBaseValidator = (StringDatatypeValidator*) getBaseValidator();\n\n    if (!pBaseValidator)\n        return;\n   \n    short    thisWSFacet = getWSFacet();\n    short    baseWSFacet = pBaseValidator->getWSFacet();\n\n    \/\/ check 4.3.6.c1 error: whitespace\n    if (((getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) != 0) &&\n        ((pBaseValidator->getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) != 0 ))\n    {\n        if ((baseWSFacet == DatatypeValidator::COLLAPSE) &&\n            ((thisWSFacet == DatatypeValidator::PRESERVE) ||\n             (thisWSFacet == DatatypeValidator::REPLACE)))\n             ThrowXML(InvalidDatatypeFacetException, XMLExcepts::FACET_WS_collapse);\n\n        if ((baseWSFacet == DatatypeValidator::REPLACE) &&\n            (thisWSFacet == DatatypeValidator::PRESERVE))\n            ThrowXML(InvalidDatatypeFacetException, XMLExcepts::FACET_WS_replace);\n\n        if (((pBaseValidator->getFixed() & DatatypeValidator::FACET_WHITESPACE) !=0) &&\n            ( thisWSFacet != baseWSFacet))\n        {\n            ThrowXML2(InvalidDatatypeFacetException\n                        , XMLExcepts::FACET_whitespace_base_fixed\n                        , getWSstring(thisWSFacet)\n                        , getWSstring(baseWSFacet));\n        }\n    }\n\n}\n\nvoid StringDatatypeValidator::checkAdditionalFacet(const XMLCh* const content) const\n{    \n    \/\/\n    \/\/ check WhiteSpace\n    \/\/\n    if ((getFacetsDefined() & DatatypeValidator::FACET_WHITESPACE) != 0 )\n    {\n        if ( getWSFacet() == DatatypeValidator::REPLACE )\n        {\n            if (!XMLString::isWSReplaced(content))\n                ThrowXML1(InvalidDatatypeValueException, XMLExcepts::VALUE_WS_replaced, content);\n        }\n        else if ( getWSFacet() == DatatypeValidator::COLLAPSE )\n        {\n            if (!XMLString::isWSCollapsed(content))\n                ThrowXML1(InvalidDatatypeValueException, XMLExcepts::VALUE_WS_collapsed, content);\n        }\n\n    }\n}\n\nvoid StringDatatypeValidator::checkValueSpace(const XMLCh* const content)\n{}\n\nint StringDatatypeValidator::getLength(const XMLCh* const content) const\n{\n    return XMLString::stringLen(content);\n}\n\n\/**\n  * End of file StringDatatypeValidator.cpp\n  *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <sstream>\n#include <set>\n#include <memory>\n#include <dlfcn.h>\n\n#include \"plugin-loader.hpp\"\n#include \"output.hpp\"\n#include \"..\/core\/wm.hpp\"\n#include \"core.hpp\"\n#include \"debug.hpp\"\n\nnamespace\n{\n    template<class A, class B> B union_cast(A object)\n    {\n        union {\n            A x;\n            B y;\n        } helper;\n        helper.x = object;\n        return helper.y;\n    }\n}\n\nstatic const std::string default_plugins = \"viewport_impl move resize animate \\\n                                            switcher vswitch cube expo command \\\n                                            grid\";\n\nstatic void idle_reload(void *data)\n{\n    auto manager = (plugin_manager *) data;\n    manager->reload_dynamic_plugins();\n    manager->idle_reload_dynamic_plugins = NULL;\n}\n\nplugin_manager::plugin_manager(wayfire_output *o, wayfire_config *config)\n{\n    this->config = config;\n    this->output = o;\n\n    auto section = config->get_section(\"core\");\n    plugins_opt = section->get_option(\"plugins\", \"default\");\n\n    reload_dynamic_plugins();\n    load_static_plugins();\n\n    list_updated = [=] ()\n    {\n        \/* reload when config reload has finished *\/\n        idle_reload_dynamic_plugins =\n            wl_event_loop_add_idle(core->ev_loop, idle_reload, this);\n    };\n\n    plugins_opt->updated.push_back(&list_updated);\n}\n\nplugin_manager::~plugin_manager()\n{\n    for (auto& p : loaded_plugins)\n        destroy_plugin(p.second);\n\n    loaded_plugins.clear();\n    wl_event_source_remove(idle_reload_dynamic_plugins);\n\n    plugins_opt->updated.erase(std::remove(plugins_opt->updated.begin(), plugins_opt->updated.end(),\n                                           &list_updated), plugins_opt->updated.end());\n}\n\nvoid plugin_manager::init_plugin(wayfire_plugin& p)\n{\n    p->grab_interface = new wayfire_grab_interface_t(output);\n    p->output = output;\n\n    p->init(config);\n}\n\nvoid plugin_manager::destroy_plugin(wayfire_plugin& p)\n{\n    p->grab_interface->ungrab();\n    output->deactivate_plugin(p->grab_interface);\n\n    p->fini();\n    delete p->grab_interface;\n\n    \/* we load the same plugins for each output, so we must dlclose() the handle\n     * only when we remove the last output *\/\n    if (core->get_num_outputs() < 1)\n    {\n        if (p->dynamic)\n            dlclose(p->handle);\n    }\n\n    p.reset();\n}\n\nwayfire_plugin plugin_manager::load_plugin_from_file(std::string path)\n{\n    void *handle = dlopen(path.c_str(), RTLD_NOW);\n    if(handle == NULL)\n    {\n        log_error(\"error loading plugin: %s\", dlerror());\n        return nullptr;\n    }\n\n\n    auto initptr = dlsym(handle, \"newInstance\");\n    if(initptr == NULL)\n    {\n        log_error(\"%s: missing newInstance(). %s\", path.c_str(), dlerror());\n        return nullptr;\n    }\n\n    log_debug(\"loading plugin %s\", path.c_str());\n    get_plugin_instance_t init = union_cast<void*, get_plugin_instance_t> (initptr);\n\n    auto ptr = wayfire_plugin(init());\n\n    ptr->handle = handle;\n    ptr->dynamic = true;\n\n    return wayfire_plugin(init());\n}\n\nvoid plugin_manager::reload_dynamic_plugins()\n{\n    std::stringstream stream(plugins_opt->as_string());\n    std::vector<std::string> next_plugins;\n\n    std::string plugin;\n    while(stream >> plugin)\n    {\n        if(plugin != \"\")\n            next_plugins.push_back(plugin);\n    }\n\n    \/* erase plugins that have been removed from the config *\/\n    auto it = loaded_plugins.begin();\n    while(it != loaded_plugins.end())\n    {\n        \/* skip built-in(static) plugins *\/\n        if (it->first.size() && it->first[0] == '_')\n        {\n            ++it;\n            continue;\n        }\n\n        if (std::find(next_plugins.begin(), next_plugins.end(), it->first) == next_plugins.end())\n        {\n            log_debug(\"unload plugin %s\", it->first.c_str());\n            destroy_plugin(it->second);\n            it = loaded_plugins.erase(it);\n        } else\n        {\n            ++it;\n        }\n    }\n\n\n    \/* load new plugins *\/\n    auto path = std::string(INSTALL_PREFIX \"\/lib\/wayfire\/\");\n    for (auto plugin : next_plugins)\n    {\n        if (loaded_plugins.count(plugin))\n            continue;\n\n        auto ptr = load_plugin_from_file(path + \"lib\" + plugin + \".so\");\n        if (ptr)\n        {\n            init_plugin(ptr);\n            loaded_plugins[plugin] = std::move(ptr);\n        }\n    }\n}\n\ntemplate<class T> static wayfire_plugin create_plugin()\n{\n    return std::unique_ptr<wayfire_plugin_t>(new T);\n}\n\nvoid plugin_manager::load_static_plugins()\n{\n    loaded_plugins[\"_exit\"]         = create_plugin<wayfire_exit>();\n    loaded_plugins[\"_focus\"]        = create_plugin<wayfire_focus>();\n    loaded_plugins[\"_close\"]        = create_plugin<wayfire_close>();\n    loaded_plugins[\"_focus_parent\"] = create_plugin<wayfire_handle_focus_parent>();\n\n    init_plugin(loaded_plugins[\"_exit\"]);\n    init_plugin(loaded_plugins[\"_focus\"]);\n    init_plugin(loaded_plugins[\"_close\"]);\n    init_plugin(loaded_plugins[\"_focus_parent\"]);\n}\n<commit_msg>plugin-loader: add support for absolute plugin paths<commit_after>#include <sstream>\n#include <set>\n#include <memory>\n#include <dlfcn.h>\n\n#include \"plugin-loader.hpp\"\n#include \"output.hpp\"\n#include \"..\/core\/wm.hpp\"\n#include \"core.hpp\"\n#include \"debug.hpp\"\n\nnamespace\n{\n    template<class A, class B> B union_cast(A object)\n    {\n        union {\n            A x;\n            B y;\n        } helper;\n        helper.x = object;\n        return helper.y;\n    }\n}\n\nstatic const std::string default_plugins = \"viewport_impl move resize animate \\\n                                            switcher vswitch cube expo command \\\n                                            grid\";\n\nstatic void idle_reload(void *data)\n{\n    auto manager = (plugin_manager *) data;\n    manager->reload_dynamic_plugins();\n    manager->idle_reload_dynamic_plugins = NULL;\n}\n\nplugin_manager::plugin_manager(wayfire_output *o, wayfire_config *config)\n{\n    this->config = config;\n    this->output = o;\n\n    auto section = config->get_section(\"core\");\n    plugins_opt = section->get_option(\"plugins\", \"default\");\n\n    reload_dynamic_plugins();\n    load_static_plugins();\n\n    list_updated = [=] ()\n    {\n        \/* reload when config reload has finished *\/\n        idle_reload_dynamic_plugins =\n            wl_event_loop_add_idle(core->ev_loop, idle_reload, this);\n    };\n\n    plugins_opt->updated.push_back(&list_updated);\n}\n\nplugin_manager::~plugin_manager()\n{\n    for (auto& p : loaded_plugins)\n        destroy_plugin(p.second);\n\n    loaded_plugins.clear();\n    wl_event_source_remove(idle_reload_dynamic_plugins);\n\n    plugins_opt->updated.erase(std::remove(plugins_opt->updated.begin(), plugins_opt->updated.end(),\n                                           &list_updated), plugins_opt->updated.end());\n}\n\nvoid plugin_manager::init_plugin(wayfire_plugin& p)\n{\n    p->grab_interface = new wayfire_grab_interface_t(output);\n    p->output = output;\n\n    p->init(config);\n}\n\nvoid plugin_manager::destroy_plugin(wayfire_plugin& p)\n{\n    p->grab_interface->ungrab();\n    output->deactivate_plugin(p->grab_interface);\n\n    p->fini();\n    delete p->grab_interface;\n\n    \/* we load the same plugins for each output, so we must dlclose() the handle\n     * only when we remove the last output *\/\n    if (core->get_num_outputs() < 1)\n    {\n        if (p->dynamic)\n            dlclose(p->handle);\n    }\n\n    p.reset();\n}\n\nwayfire_plugin plugin_manager::load_plugin_from_file(std::string path)\n{\n    void *handle = dlopen(path.c_str(), RTLD_NOW);\n    if(handle == NULL)\n    {\n        log_error(\"error loading plugin: %s\", dlerror());\n        return nullptr;\n    }\n\n\n    auto initptr = dlsym(handle, \"newInstance\");\n    if(initptr == NULL)\n    {\n        log_error(\"%s: missing newInstance(). %s\", path.c_str(), dlerror());\n        return nullptr;\n    }\n\n    log_debug(\"loading plugin %s\", path.c_str());\n    get_plugin_instance_t init = union_cast<void*, get_plugin_instance_t> (initptr);\n\n    auto ptr = wayfire_plugin(init());\n\n    ptr->handle = handle;\n    ptr->dynamic = true;\n\n    return wayfire_plugin(init());\n}\n\nvoid plugin_manager::reload_dynamic_plugins()\n{\n    std::stringstream stream(plugins_opt->as_string());\n    std::vector<std::string> next_plugins;\n\n    std::string plugin;\n    while(stream >> plugin)\n    {\n        if(plugin != \"\")\n            next_plugins.push_back(plugin);\n    }\n\n    \/* erase plugins that have been removed from the config *\/\n    auto it = loaded_plugins.begin();\n    while(it != loaded_plugins.end())\n    {\n        \/* skip built-in(static) plugins *\/\n        if (it->first.size() && it->first[0] == '_')\n        {\n            ++it;\n            continue;\n        }\n\n        if (std::find(next_plugins.begin(), next_plugins.end(), it->first) == next_plugins.end())\n        {\n            log_debug(\"unload plugin %s\", it->first.c_str());\n            destroy_plugin(it->second);\n            it = loaded_plugins.erase(it);\n        } else\n        {\n            ++it;\n        }\n    }\n\n\n    \/* load new plugins *\/\n    auto path = std::string(INSTALL_PREFIX \"\/lib\/wayfire\/\");\n    for (auto plugin : next_plugins)\n    {\n        if (!plugin.length())\n            continue;\n\n\n        std::string plugin_path;\n        if (plugin.size() && plugin[0] == '\/')\n        {\n            plugin_path = plugin;\n        } else\n        {\n            plugin_path = path + \"lib\" + plugin + \".so\";\n        }\n\n        if (loaded_plugins.count(plugin_path))\n            continue;\n\n        auto ptr = load_plugin_from_file(plugin_path);\n        if (ptr)\n        {\n            init_plugin(ptr);\n            loaded_plugins[plugin] = std::move(ptr);\n        }\n    }\n}\n\ntemplate<class T> static wayfire_plugin create_plugin()\n{\n    return std::unique_ptr<wayfire_plugin_t>(new T);\n}\n\nvoid plugin_manager::load_static_plugins()\n{\n    loaded_plugins[\"_exit\"]         = create_plugin<wayfire_exit>();\n    loaded_plugins[\"_focus\"]        = create_plugin<wayfire_focus>();\n    loaded_plugins[\"_close\"]        = create_plugin<wayfire_close>();\n    loaded_plugins[\"_focus_parent\"] = create_plugin<wayfire_handle_focus_parent>();\n\n    init_plugin(loaded_plugins[\"_exit\"]);\n    init_plugin(loaded_plugins[\"_focus\"]);\n    init_plugin(loaded_plugins[\"_close\"]);\n    init_plugin(loaded_plugins[\"_focus_parent\"]);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"photoeffects.hpp\"\n\nusing namespace cv;\n\nint tint(InputArray src, OutputArray dst, \n        const Vec3b &colorTint, float density)\n{\n    CV_Assert(src.type() == CV_8UC3);\n    CV_Assert(density >= 0.0f || density <= 1.0f);\n    dst.create(src.size(), CV_8UC3);\n    Mat image = src.getMat(), outputImage = dst.getMat();\n    float negDen = 1 - density;\n    for (int i = 0; i < image.rows; i++)\n    {\n        for (int j = 0; j < image.cols; j++)\n        {\n            Vec3b colorDest = image.at<Vec3b>(i, j);\n            colorDest = colorTint * density + negDen * colorDest;\n            outputImage.at<Vec3b>(i, j) = colorDest;\n        }\n    }\n    outputImage.convertTo(dst, CV_8UC3);\n    return 0;\n}\n<commit_msg>Update tint.cpp<commit_after>#include \"photoeffects.hpp\"\n\nusing namespace cv;\n\nint tint(InputArray src, OutputArray dst, \n        const Vec3b &colorTint, float density)\n{\n    CV_Assert(src.type() == CV_8UC3);\n    CV_Assert(density >= 0.0f || density <= 1.0f);\n    dst.create(src.size(), CV_8UC3);\n    Mat image = src.getMat(), outputImage = dst.getMat();\n    float negDen = 1 - density;\n    for (int i = 0; i < image.rows; i++)\n    {\n        for (int j = 0; j < image.cols; j++)\n        {\n            Vec3b colorDest = image.at<Vec3b>(i, j);\n            colorDest = colorTint * density + negDen * colorDest;\n            outputImage.at<Vec3b>(i, j) = colorDest;\n        }\n    }\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"physics\/forkable.hpp\"\n\n#include \"geometry\/named_quantities.hpp\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"quantities\/si.hpp\"\n\nnamespace principia {\n\nusing geometry::Instant;\nusing si::Second;\nusing ::testing::ElementsAre;\n\nnamespace physics {\n\nclass FakeTrajectory : public Forkable<FakeTrajectory,\n                                       std::list<Instant>::const_iterator> {\n public:\n  FakeTrajectory();\n\n  void push_back(Instant const& time);\n\n protected:\n  not_null<FakeTrajectory*> that() override;\n  not_null<FakeTrajectory const*> that() const override;\n\n  TimelineConstIterator timeline_begin() const override;\n  TimelineConstIterator timeline_end() const override;\n  TimelineConstIterator timeline_find(Instant const& time) const override;\n  void timeline_insert(TimelineConstIterator begin,\n                       TimelineConstIterator end) override;\n  bool timeline_empty() const override;\n\n private:\n  \/\/ Use list<> because we want the iterators to remain valid across operations.\n  std::list<Instant> timeline_;\n\n  template<typename Tr4jectory, typename TimelineConstIterator_>\n  friend class Forkable;\n  template<typename Tr4jectory, typename TimelineConstIterator_>\n  friend class Forkable<Tr4jectory, TimelineConstIterator_>::Iterator;\n};\n\nFakeTrajectory::FakeTrajectory()\n    : Forkable<FakeTrajectory,\n               std::list<Instant>::const_iterator>() {}\n\nvoid FakeTrajectory::push_back(Instant const& time) {\n  timeline_.push_back(time);\n}\n\nnot_null<FakeTrajectory*> FakeTrajectory::that() {\n  return this;\n}\n\nnot_null<FakeTrajectory const*> FakeTrajectory::that() const {\n  return this;\n}\n\nFakeTrajectory::TimelineConstIterator FakeTrajectory::timeline_begin() const {\n  return timeline_.begin();\n}\n\nFakeTrajectory::TimelineConstIterator FakeTrajectory::timeline_end() const {\n  return timeline_.end();\n}\n\nFakeTrajectory::TimelineConstIterator FakeTrajectory::timeline_find(\n    Instant const & time) const {\n  \/\/ Stupid O(N) search.\n  for (auto it = timeline_.begin(); it != timeline_.end(); ++it) {\n    if (*it == time) {\n      return it;\n    }\n  }\n  return timeline_.end();\n}\n\nvoid FakeTrajectory::timeline_insert(TimelineConstIterator begin,\n                                     TimelineConstIterator end) {\n  CHECK(timeline_empty());\n  timeline_.insert(timeline_.end(), begin, end);\n}\n\nbool FakeTrajectory::timeline_empty() const {\n  return timeline_.empty();\n}\n\nclass ForkableTest : public testing::Test {\n protected:\n  ForkableTest() :\n    t0_(),\n    t1_(t0_ + 7 * Second),\n    t2_(t0_ + 17 * Second),\n    t3_(t0_ + 27 * Second),\n    t4_(t0_ + 37 * Second) {}\n\n  static std::vector<Instant> After(\n      not_null<FakeTrajectory const*> const trajectory,\n      Instant const& time) {\n    std::vector<Instant> after;\n    for (FakeTrajectory::Iterator it = trajectory->Find(time);\n         it != trajectory->End();\n         ++it) {\n      after.push_back(*it.current());\n    }\n    return after;\n  }\n\n  static Instant const& LastTime(\n      not_null<FakeTrajectory const*> const trajectory) {\n    FakeTrajectory::Iterator it = trajectory->End();\n    --it;\n    return *it.current();\n  }\n\n  static std::vector<Instant> Times(\n      not_null<FakeTrajectory const*> const trajectory) {\n    std::vector<Instant> times;\n    for (FakeTrajectory::Iterator it = trajectory->Begin();\n         it != trajectory->End();\n         ++it) {\n      times.push_back(*it.current());\n    }\n    return times;\n  }\n\n  FakeTrajectory trajectory_;\n  Instant t0_, t1_, t2_, t3_, t4_;\n};\n\nusing ForkableDeathTest = ForkableTest;\n\nTEST_F(ForkableDeathTest, ForkError) {\n  EXPECT_DEATH({\n    trajectory_.push_back(t1_);\n    trajectory_.push_back(t3_);\n    trajectory_.NewFork(t2_);\n  }, \"nonexistent time\");\n}\n\nTEST_F(ForkableDeathTest, ForkSuccess) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  not_null<FakeTrajectory*> const fork = trajectory_.NewFork(t2_);\n  fork->push_back(t4_);\n  auto times = Times(&trajectory_);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n  times = Times(fork);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_, t4_));\n}\n\nTEST_F(ForkableTest, ForkAtLast) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  not_null<FakeTrajectory*> const fork1 = trajectory_.NewFork(t3_);\n  not_null<FakeTrajectory*> const fork2 = fork1->NewFork(LastTime(fork1));\n  not_null<FakeTrajectory*> const fork3 = fork2->NewFork(LastTime(fork1));\n  EXPECT_EQ(t3_, LastTime(&trajectory_));\n  EXPECT_EQ(t3_, LastTime(fork1));\n\n  auto times = Times(fork2);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n  EXPECT_EQ(t3_, LastTime(fork2));\n  EXPECT_EQ(t3_, *fork2->ForkTime());\n\n  auto after = After(fork3, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_));\n\n  after = After(fork2, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_));\n\n  fork1->push_back(t4_);\n  times = Times(fork2);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n\n  after = After(fork1, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_, t4_));\n\n  times = Times(fork3);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n\n  fork2->push_back(t4_);\n  after = After(fork2, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_, t4_));\n\n  fork3->push_back(t4_);\n  after = After(fork3, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_, t4_));\n\n  after = After(fork3, t2_);\n  EXPECT_THAT(after, ElementsAre(t2_, t3_, t4_));\n}\n\nTEST_F(ForkableDeathTest, DeleteForkError) {\n  EXPECT_DEATH({\n    trajectory_.push_back(t1_);\n    FakeTrajectory* root = &trajectory_;\n    trajectory_.DeleteFork(&root);\n  }, \"'fork_time'.* non NULL\");\n  EXPECT_DEATH({\n    trajectory_.push_back(t1_);\n    FakeTrajectory* fork1 = trajectory_.NewFork(t1_);\n    fork1->push_back(t2_);\n    FakeTrajectory* fork2 = fork1->NewFork(t2_);\n    trajectory_.DeleteFork(&fork2);\n  }, \"not a child\");\n}\n\n\/\/TEST_F(ForkableDeathTest, DeleteForkSuccess) {\n\/\/  trajectory_.push_back(t1_);\n\/\/  trajectory_.push_back(t2_);\n\/\/  trajectory_.push_back(t3_);\n\/\/  not_null<FakeTrajectory*> const fork1 = trajectory_.NewFork(t2_);\n\/\/  FakeTrajectory* fork2 = trajectory_.NewFork(t2_);\n\/\/  fork1.push_back(t4_);\n\/\/  trajectory_.DeleteFork(&fork2);\n\/\/  EXPECT_EQ(nullptr, fork2);\n\/\/  std::map<Instant, Position<World>> positions =\n\/\/      trajectory_.Positions();\n\/\/  std::map<Instant, Velocity<World>> velocities =\n\/\/      trajectory_.Velocities();\n\/\/  std::list<Instant> times = trajectory_.Times();\n\/\/  EXPECT_THAT(positions, ElementsAre(testing::Pair(t1_, q1_),\n\/\/                                     testing::Pair(t2_, q2_),\n\/\/                                     testing::Pair(t3_, q3_)));\n\/\/  EXPECT_THAT(velocities, ElementsAre(testing::Pair(t1_, p1_),\n\/\/                                      testing::Pair(t2_, p2_),\n\/\/                                      testing::Pair(t3_, p3_)));\n\/\/  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n\/\/  EXPECT_THAT(fork1->body<MassiveBody>(), Eq(&massive_body_));\n\/\/  positions = fork1->Positions();\n\/\/  velocities = fork1->Velocities();\n\/\/  times = fork1->Times();\n\/\/  EXPECT_THAT(positions, ElementsAre(testing::Pair(t1_, q1_),\n\/\/                                     testing::Pair(t2_, q2_),\n\/\/                                     testing::Pair(t3_, q3_),\n\/\/                                     testing::Pair(t4_, q4_)));\n\/\/  EXPECT_THAT(velocities, ElementsAre(testing::Pair(t1_, p1_),\n\/\/                                      testing::Pair(t2_, p2_),\n\/\/                                      testing::Pair(t3_, p3_),\n\/\/                                      testing::Pair(t4_, p4_)));\n\/\/  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_, t4_));\n\/\/  EXPECT_THAT(fork1->body<MassiveBody>(), Eq(&massive_body_));\n\/\/  trajectory_.reset();\n\/\/}\n\/\/\nTEST_F(ForkableDeathTest, IteratorDecrementError) {\n  EXPECT_DEATH({\n    auto it = trajectory_.End();\n    --it;\n  }, \"parent_.*non NULL\");\n}\n\nTEST_F(ForkableTest, IteratorDecrementNoForkSuccess) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  auto it = trajectory_.End();\n  --it;\n  EXPECT_EQ(t3_, *it.current());\n  --it;\n  EXPECT_EQ(t2_, *it.current());\n  --it;\n  EXPECT_EQ(t1_, *it.current());\n}\n\nTEST_F(ForkableTest, IteratorDecrementForkSuccess) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  auto fork = trajectory_.NewFork(t1_);\n  trajectory_.push_back(t4_);\n  fork->push_back(t3_);\n  auto it = fork->End();\n  --it;\n  EXPECT_EQ(t3_, *it.current());\n  --it;\n  EXPECT_EQ(t2_, *it.current());\n  --it;\n  EXPECT_EQ(t1_, *it.current());\n}\n\nTEST_F(ForkableTest, Root) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  not_null<FakeTrajectory*> const fork = trajectory_.NewFork(t2_);\n  EXPECT_TRUE(trajectory_.is_root());\n  EXPECT_FALSE(fork->is_root());\n  EXPECT_EQ(&trajectory_, trajectory_.root());\n  EXPECT_EQ(&trajectory_, fork->root());\n  EXPECT_EQ(nullptr, trajectory_.ForkTime());\n  EXPECT_EQ(t2_, *fork->ForkTime());\n}\n\nTEST_F(ForkableTest, IteratorBeginSuccess) {\n  auto it = trajectory_.Begin();\n  EXPECT_EQ(it, trajectory_.End());\n\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n\n  it = trajectory_.Begin();\n  EXPECT_NE(it, trajectory_.End());\n  EXPECT_EQ(t1_, *it.current());\n  ++it;\n  EXPECT_EQ(t2_, *it.current());\n  ++it;\n  EXPECT_EQ(t3_, *it.current());\n  ++it;\n  EXPECT_EQ(it, trajectory_.End());\n\n  not_null<FakeTrajectory*> const fork = trajectory_.NewFork(t2_);\n  fork->push_back(t4_);\n\n  it = fork->Begin();\n  EXPECT_NE(it, trajectory_.End());\n  EXPECT_EQ(t1_, *it.current());\n  ++it;\n  EXPECT_EQ(t2_, *it.current());\n  ++it;\n  EXPECT_EQ(t3_, *it.current());\n  ++it;\n  EXPECT_EQ(t4_, *it.current());\n  ++it;\n  EXPECT_EQ(it, trajectory_.End());\n}\n\nTEST_F(ForkableTest, IteratorFindSuccess) {\n  auto it = trajectory_.Find(t0_);\n  EXPECT_EQ(it, trajectory_.End());\n\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n\n  it = trajectory_.Find(t1_);\n  EXPECT_NE(it, trajectory_.End());\n  EXPECT_EQ(t1_, *it.current());\n  it = trajectory_.Find(t2_);\n  EXPECT_EQ(t2_, *it.current());\n  it = trajectory_.Find(t4_);\n  EXPECT_EQ(it, trajectory_.End());\n\n  not_null<FakeTrajectory*> const fork = trajectory_.NewFork(t2_);\n  fork->push_back(t4_);\n\n  it = fork->Find(t1_);\n  EXPECT_NE(it, trajectory_.End());\n  EXPECT_EQ(t1_, *it.current());\n  it = fork->Find(t2_);\n  EXPECT_EQ(t2_, *it.current());\n  it = fork->Find(t4_);\n  EXPECT_EQ(t4_, *it.current());\n  it = fork->Find(t4_ + 1 * Second);\n  EXPECT_EQ(it, trajectory_.End());\n}\n\n}  \/\/ namespace physics\n}  \/\/ namespace principia\n<commit_msg>All tests passing.<commit_after>#include \"physics\/forkable.hpp\"\n\n#include \"geometry\/named_quantities.hpp\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"quantities\/si.hpp\"\n\nnamespace principia {\n\nusing geometry::Instant;\nusing si::Second;\nusing ::testing::ElementsAre;\n\nnamespace physics {\n\nclass FakeTrajectory : public Forkable<FakeTrajectory,\n                                       std::list<Instant>::const_iterator> {\n public:\n  FakeTrajectory();\n\n  void push_back(Instant const& time);\n\n protected:\n  not_null<FakeTrajectory*> that() override;\n  not_null<FakeTrajectory const*> that() const override;\n\n  TimelineConstIterator timeline_begin() const override;\n  TimelineConstIterator timeline_end() const override;\n  TimelineConstIterator timeline_find(Instant const& time) const override;\n  void timeline_insert(TimelineConstIterator begin,\n                       TimelineConstIterator end) override;\n  bool timeline_empty() const override;\n\n private:\n  \/\/ Use list<> because we want the iterators to remain valid across operations.\n  std::list<Instant> timeline_;\n\n  template<typename Tr4jectory, typename TimelineConstIterator_>\n  friend class Forkable;\n  template<typename Tr4jectory, typename TimelineConstIterator_>\n  friend class Forkable<Tr4jectory, TimelineConstIterator_>::Iterator;\n};\n\nFakeTrajectory::FakeTrajectory()\n    : Forkable<FakeTrajectory,\n               std::list<Instant>::const_iterator>() {}\n\nvoid FakeTrajectory::push_back(Instant const& time) {\n  timeline_.push_back(time);\n}\n\nnot_null<FakeTrajectory*> FakeTrajectory::that() {\n  return this;\n}\n\nnot_null<FakeTrajectory const*> FakeTrajectory::that() const {\n  return this;\n}\n\nFakeTrajectory::TimelineConstIterator FakeTrajectory::timeline_begin() const {\n  return timeline_.begin();\n}\n\nFakeTrajectory::TimelineConstIterator FakeTrajectory::timeline_end() const {\n  return timeline_.end();\n}\n\nFakeTrajectory::TimelineConstIterator FakeTrajectory::timeline_find(\n    Instant const & time) const {\n  \/\/ Stupid O(N) search.\n  for (auto it = timeline_.begin(); it != timeline_.end(); ++it) {\n    if (*it == time) {\n      return it;\n    }\n  }\n  return timeline_.end();\n}\n\nvoid FakeTrajectory::timeline_insert(TimelineConstIterator begin,\n                                     TimelineConstIterator end) {\n  CHECK(timeline_empty());\n  timeline_.insert(timeline_.end(), begin, end);\n}\n\nbool FakeTrajectory::timeline_empty() const {\n  return timeline_.empty();\n}\n\nclass ForkableTest : public testing::Test {\n protected:\n  ForkableTest() :\n    t0_(),\n    t1_(t0_ + 7 * Second),\n    t2_(t0_ + 17 * Second),\n    t3_(t0_ + 27 * Second),\n    t4_(t0_ + 37 * Second) {}\n\n  static std::vector<Instant> After(\n      not_null<FakeTrajectory const*> const trajectory,\n      Instant const& time) {\n    std::vector<Instant> after;\n    for (FakeTrajectory::Iterator it = trajectory->Find(time);\n         it != trajectory->End();\n         ++it) {\n      after.push_back(*it.current());\n    }\n    return after;\n  }\n\n  static Instant const& LastTime(\n      not_null<FakeTrajectory const*> const trajectory) {\n    FakeTrajectory::Iterator it = trajectory->End();\n    --it;\n    return *it.current();\n  }\n\n  static std::vector<Instant> Times(\n      not_null<FakeTrajectory const*> const trajectory) {\n    std::vector<Instant> times;\n    for (FakeTrajectory::Iterator it = trajectory->Begin();\n         it != trajectory->End();\n         ++it) {\n      times.push_back(*it.current());\n    }\n    return times;\n  }\n\n  FakeTrajectory trajectory_;\n  Instant t0_, t1_, t2_, t3_, t4_;\n};\n\nusing ForkableDeathTest = ForkableTest;\n\nTEST_F(ForkableDeathTest, ForkError) {\n  EXPECT_DEATH({\n    trajectory_.push_back(t1_);\n    trajectory_.push_back(t3_);\n    trajectory_.NewFork(t2_);\n  }, \"nonexistent time\");\n}\n\nTEST_F(ForkableDeathTest, ForkSuccess) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  not_null<FakeTrajectory*> const fork = trajectory_.NewFork(t2_);\n  fork->push_back(t4_);\n  auto times = Times(&trajectory_);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n  times = Times(fork);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_, t4_));\n}\n\nTEST_F(ForkableTest, ForkAtLast) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  not_null<FakeTrajectory*> const fork1 = trajectory_.NewFork(t3_);\n  not_null<FakeTrajectory*> const fork2 = fork1->NewFork(LastTime(fork1));\n  not_null<FakeTrajectory*> const fork3 = fork2->NewFork(LastTime(fork1));\n  EXPECT_EQ(t3_, LastTime(&trajectory_));\n  EXPECT_EQ(t3_, LastTime(fork1));\n\n  auto times = Times(fork2);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n  EXPECT_EQ(t3_, LastTime(fork2));\n  EXPECT_EQ(t3_, *fork2->ForkTime());\n\n  auto after = After(fork3, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_));\n\n  after = After(fork2, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_));\n\n  fork1->push_back(t4_);\n  times = Times(fork2);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n\n  after = After(fork1, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_, t4_));\n\n  times = Times(fork3);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n\n  fork2->push_back(t4_);\n  after = After(fork2, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_, t4_));\n\n  fork3->push_back(t4_);\n  after = After(fork3, t3_);\n  EXPECT_THAT(after, ElementsAre(t3_, t4_));\n\n  after = After(fork3, t2_);\n  EXPECT_THAT(after, ElementsAre(t2_, t3_, t4_));\n}\n\nTEST_F(ForkableDeathTest, DeleteForkError) {\n  EXPECT_DEATH({\n    trajectory_.push_back(t1_);\n    FakeTrajectory* root = &trajectory_;\n    trajectory_.DeleteFork(&root);\n  }, \"'fork_time'.* non NULL\");\n  EXPECT_DEATH({\n    trajectory_.push_back(t1_);\n    FakeTrajectory* fork1 = trajectory_.NewFork(t1_);\n    fork1->push_back(t2_);\n    FakeTrajectory* fork2 = fork1->NewFork(t2_);\n    trajectory_.DeleteFork(&fork2);\n  }, \"not a child\");\n}\n\nTEST_F(ForkableTest, DeleteForkSuccess) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  not_null<FakeTrajectory*> const fork1 = trajectory_.NewFork(t2_);\n  FakeTrajectory* fork2 = trajectory_.NewFork(t2_);\n  fork1->push_back(t4_);\n  trajectory_.DeleteFork(&fork2);\n  EXPECT_EQ(nullptr, fork2);\n  auto times = Times(&trajectory_);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_));\n  times = Times(fork1);\n  EXPECT_THAT(times, ElementsAre(t1_, t2_, t3_, t4_));\n}\n\nTEST_F(ForkableDeathTest, IteratorDecrementError) {\n  EXPECT_DEATH({\n    auto it = trajectory_.End();\n    --it;\n  }, \"parent_.*non NULL\");\n}\n\nTEST_F(ForkableTest, IteratorDecrementNoForkSuccess) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  auto it = trajectory_.End();\n  --it;\n  EXPECT_EQ(t3_, *it.current());\n  --it;\n  EXPECT_EQ(t2_, *it.current());\n  --it;\n  EXPECT_EQ(t1_, *it.current());\n}\n\nTEST_F(ForkableTest, IteratorDecrementForkSuccess) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  auto fork = trajectory_.NewFork(t1_);\n  trajectory_.push_back(t4_);\n  fork->push_back(t3_);\n  auto it = fork->End();\n  --it;\n  EXPECT_EQ(t3_, *it.current());\n  --it;\n  EXPECT_EQ(t2_, *it.current());\n  --it;\n  EXPECT_EQ(t1_, *it.current());\n}\n\nTEST_F(ForkableTest, Root) {\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n  not_null<FakeTrajectory*> const fork = trajectory_.NewFork(t2_);\n  EXPECT_TRUE(trajectory_.is_root());\n  EXPECT_FALSE(fork->is_root());\n  EXPECT_EQ(&trajectory_, trajectory_.root());\n  EXPECT_EQ(&trajectory_, fork->root());\n  EXPECT_EQ(nullptr, trajectory_.ForkTime());\n  EXPECT_EQ(t2_, *fork->ForkTime());\n}\n\nTEST_F(ForkableTest, IteratorBeginSuccess) {\n  auto it = trajectory_.Begin();\n  EXPECT_EQ(it, trajectory_.End());\n\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n\n  it = trajectory_.Begin();\n  EXPECT_NE(it, trajectory_.End());\n  EXPECT_EQ(t1_, *it.current());\n  ++it;\n  EXPECT_EQ(t2_, *it.current());\n  ++it;\n  EXPECT_EQ(t3_, *it.current());\n  ++it;\n  EXPECT_EQ(it, trajectory_.End());\n\n  not_null<FakeTrajectory*> const fork = trajectory_.NewFork(t2_);\n  fork->push_back(t4_);\n\n  it = fork->Begin();\n  EXPECT_NE(it, trajectory_.End());\n  EXPECT_EQ(t1_, *it.current());\n  ++it;\n  EXPECT_EQ(t2_, *it.current());\n  ++it;\n  EXPECT_EQ(t3_, *it.current());\n  ++it;\n  EXPECT_EQ(t4_, *it.current());\n  ++it;\n  EXPECT_EQ(it, trajectory_.End());\n}\n\nTEST_F(ForkableTest, IteratorFindSuccess) {\n  auto it = trajectory_.Find(t0_);\n  EXPECT_EQ(it, trajectory_.End());\n\n  trajectory_.push_back(t1_);\n  trajectory_.push_back(t2_);\n  trajectory_.push_back(t3_);\n\n  it = trajectory_.Find(t1_);\n  EXPECT_NE(it, trajectory_.End());\n  EXPECT_EQ(t1_, *it.current());\n  it = trajectory_.Find(t2_);\n  EXPECT_EQ(t2_, *it.current());\n  it = trajectory_.Find(t4_);\n  EXPECT_EQ(it, trajectory_.End());\n\n  not_null<FakeTrajectory*> const fork = trajectory_.NewFork(t2_);\n  fork->push_back(t4_);\n\n  it = fork->Find(t1_);\n  EXPECT_NE(it, trajectory_.End());\n  EXPECT_EQ(t1_, *it.current());\n  it = fork->Find(t2_);\n  EXPECT_EQ(t2_, *it.current());\n  it = fork->Find(t4_);\n  EXPECT_EQ(t4_, *it.current());\n  it = fork->Find(t4_ + 1 * Second);\n  EXPECT_EQ(it, trajectory_.End());\n}\n\n}  \/\/ namespace physics\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>#include \"ImageLoader.h\"\n#include \"AssetManager.h\"\n#include \"texture\/texture.h\"\n#include \"utility.h\"\n#include <map>\n\n#define STB_IMAGE_IMPLEMENTATION\n#include \"stb_image.h\"\n\nnamespace aten {\n\tstatic std::string g_base;\n\n\tvoid ImageLoader::setBasePath(const std::string& base)\n\t{\n\t\tg_base = removeTailPathSeparator(base);\n\t}\n\n\ttexture* ImageLoader::load(const std::string& path)\n\t{\n\t\tstd::string pathname;\n\t\tstd::string extname;\n\t\tstd::string filename;\n\n\t\tgetStringsFromPath(\n\t\t\tpath,\n\t\t\tpathname,\n\t\t\textname,\n\t\t\tfilename);\n\n\t\tauto tex = load(filename, path);\n\n\t\treturn tex;\n\t}\n\n\ttemplate <typename TYPE>\n\tstatic void read(\n\t\tTYPE* src,\n\t\ttexture* tex,\n\t\tint width,\n\t\tint height,\n\t\tint channel,\n\t\treal norm)\n\t{\n\t\tint skipChannel = channel;\n\t\tchannel = (channel > 3 ? 3 : channel);\n\n#pragma omp parallel for\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tint idx = y * width + x;\n\t\t\t\tidx *= skipChannel;\n\n\t\t\t\tswitch (channel) {\n\t\t\t\tcase 3:\n\t\t\t\t\t(*tex)(x, y, 2) = src[idx + 2] * norm;\n\t\t\t\tcase 2:\n\t\t\t\t\t(*tex)(x, y, 1) = src[idx + 1] * norm;\n\t\t\t\tcase 1:\n\t\t\t\t\t(*tex)(x, y, 0) = src[idx + 0] * norm;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\ttexture* ImageLoader::load(const std::string& tag, const std::string& path)\n\t{\n\t\tstd::string fullpath = path;\n\t\tif (!g_base.empty()) {\n\t\t\tfullpath = g_base + \"\/\" + fullpath;\n\t\t}\n\n\t\ttexture* tex = AssetManager::getTex(tag);\n\n\t\tif (tex) {\n\t\t\tAT_PRINTF(\"There is same tag texture. [%s]\\n\", tag.c_str());\n\t\t\treturn tex;\n\t\t}\n\n\t\treal* dst = nullptr;\n\t\tint width = 0;\n\t\tint height = 0;\n\t\tint channels = 0;\n\n\t\tif (stbi_is_hdr(fullpath.c_str())) {\n\t\t\tauto src = stbi_loadf(fullpath.c_str(), &width, &height, &channels, 0);\n\t\t\tif (src) {\n\t\t\t\ttex = new texture(width, height, std::min(channels, 3), path.c_str());\n\t\t\t\treal norm = real(1);\n\t\t\t\tread<float>(src, tex, width, height, channels, norm);\n\n\t\t\t\tSTBI_FREE(src);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tauto src = stbi_load(fullpath.c_str(), &width, &height, &channels, 0);\n\t\t\tif (src) {\n\t\t\t\ttex = new texture(width, height, std::min(channels, 3), path.c_str());\n\t\t\t\treal norm = real(1) \/ real(255);\n\n\t\t\t\tread<stbi_uc>(src, tex, width, height, channels, norm);\n\n\t\t\t\tSTBI_FREE(src);\n\t\t\t}\n\t\t}\n\n\t\tif (tex) {\n\t\t\tAssetManager::registerTex(tag, tex);\n\t\t}\n\t\telse {\n\t\t\tAT_ASSERT(false);\n\t\t\tAT_PRINTF(\"Failed load texture. [%s]\\n\", fullpath.c_str());\n\t\t\treturn nullptr;\n\t\t}\n\n\t\treturn tex;\n\t}\n}<commit_msg>It is enabled to load texture which has alpha.<commit_after>#include \"ImageLoader.h\"\n#include \"AssetManager.h\"\n#include \"texture\/texture.h\"\n#include \"utility.h\"\n#include <map>\n\n#define STB_IMAGE_IMPLEMENTATION\n#include \"stb_image.h\"\n\nnamespace aten {\n\tstatic std::string g_base;\n\n\tvoid ImageLoader::setBasePath(const std::string& base)\n\t{\n\t\tg_base = removeTailPathSeparator(base);\n\t}\n\n\ttexture* ImageLoader::load(const std::string& path)\n\t{\n\t\tstd::string pathname;\n\t\tstd::string extname;\n\t\tstd::string filename;\n\n\t\tgetStringsFromPath(\n\t\t\tpath,\n\t\t\tpathname,\n\t\t\textname,\n\t\t\tfilename);\n\n\t\tauto tex = load(filename, path);\n\n\t\treturn tex;\n\t}\n\n\ttemplate <typename TYPE>\n\tstatic void read(\n\t\tTYPE* src,\n\t\ttexture* tex,\n\t\tint width,\n\t\tint height,\n\t\tint channel,\n\t\treal norm)\n\t{\n\t\tint skipChannel = channel;\n\n#pragma omp parallel for\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tint idx = y * width + x;\n\t\t\t\tidx *= skipChannel;\n\n\t\t\t\tswitch (channel) {\n\t\t\t\tcase 4:\n\t\t\t\t\t(*tex)(x, y, 3) = src[idx + 3] * norm;\n\t\t\t\tcase 3:\n\t\t\t\t\t(*tex)(x, y, 2) = src[idx + 2] * norm;\n\t\t\t\tcase 2:\n\t\t\t\t\t(*tex)(x, y, 1) = src[idx + 1] * norm;\n\t\t\t\tcase 1:\n\t\t\t\t\t(*tex)(x, y, 0) = src[idx + 0] * norm;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\ttexture* ImageLoader::load(const std::string& tag, const std::string& path)\n\t{\n\t\tstd::string fullpath = path;\n\t\tif (!g_base.empty()) {\n\t\t\tfullpath = g_base + \"\/\" + fullpath;\n\t\t}\n\n\t\ttexture* tex = AssetManager::getTex(tag);\n\n\t\tif (tex) {\n\t\t\tAT_PRINTF(\"There is same tag texture. [%s]\\n\", tag.c_str());\n\t\t\treturn tex;\n\t\t}\n\n\t\treal* dst = nullptr;\n\t\tint width = 0;\n\t\tint height = 0;\n\t\tint channels = 0;\n\n\t\tif (stbi_is_hdr(fullpath.c_str())) {\n\t\t\tauto src = stbi_loadf(fullpath.c_str(), &width, &height, &channels, 0);\n\t\t\tif (src) {\n\t\t\t\ttex = new texture(width, height, channels, path.c_str());\n\t\t\t\treal norm = real(1);\n\t\t\t\tread<float>(src, tex, width, height, channels, norm);\n\n\t\t\t\tSTBI_FREE(src);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tauto src = stbi_load(fullpath.c_str(), &width, &height, &channels, 0);\n\t\t\tif (src) {\n\t\t\t\ttex = new texture(width, height, channels, path.c_str());\n\t\t\t\treal norm = real(1) \/ real(255);\n\n\t\t\t\tread<stbi_uc>(src, tex, width, height, channels, norm);\n\n\t\t\t\tSTBI_FREE(src);\n\t\t\t}\n\t\t}\n\n\t\tif (tex) {\n\t\t\tAssetManager::registerTex(tag, tex);\n\t\t}\n\t\telse {\n\t\t\tAT_ASSERT(false);\n\t\t\tAT_PRINTF(\"Failed load texture. [%s]\\n\", fullpath.c_str());\n\t\t\treturn nullptr;\n\t\t}\n\n\t\treturn tex;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2016, Simula Research Laboratory\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 _CCTAG_DISTANCE_HPP_\n#define _CCTAG_DISTANCE_HPP_\n\n#include <cctag\/geometry\/Ellipse.hpp>\n#include <boost\/math\/special_functions\/pow.hpp>\n#include <Eigen\/Dense>\n\nnamespace cctag {\nnamespace numerical {\n\ntemplate<class T, class U>\ninline float distancePoints2D( const T& p1, const U& p2 )\n{\n\treturn std::sqrt( (float)boost::math::pow<2>( p2.x() - p1.x() ) +\n\t                  boost::math::pow<2>( p2.y() - p1.y() ) );\n}\n\nfloat distancePointEllipseScalar(const Eigen::Vector3f& p, const Eigen::Matrix3f& Q);\n\ntemplate <class T>\ninline float distancePointEllipse( const T & p, const geometry::Ellipse& q)\n{\n  return distancePointEllipseScalar(p.template cast<float>(), q.matrix());\n}\n\n\/\/ Compute the distance between points and an ellipse\nvoid distancePointEllipse( std::vector<float>& dist, const std::vector<Eigen::Vector3f>& pts, const geometry::Ellipse& q);\n\n}\n}\n\n#endif\n<commit_msg>[cctag] casting<commit_after>\/*\n * Copyright 2016, Simula Research Laboratory\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 _CCTAG_DISTANCE_HPP_\n#define _CCTAG_DISTANCE_HPP_\n\n#include <cctag\/geometry\/Ellipse.hpp>\n#include <boost\/math\/special_functions\/pow.hpp>\n#include <Eigen\/Dense>\n\nnamespace cctag {\nnamespace numerical {\n\ntemplate<class T, class U>\ninline float distancePoints2D( const T& p1, const U& p2 )\n{\n\treturn std::sqrt( (float)boost::math::pow<2>( p2.x() - p1.x() ) +\n\t                  (float)boost::math::pow<2>( p2.y() - p1.y() ) );\n}\n\nfloat distancePointEllipseScalar(const Eigen::Vector3f& p, const Eigen::Matrix3f& Q);\n\ntemplate <class T>\ninline float distancePointEllipse( const T & p, const geometry::Ellipse& q)\n{\n  return distancePointEllipseScalar(p.template cast<float>(), q.matrix());\n}\n\n\/\/ Compute the distance between points and an ellipse\nvoid distancePointEllipse( std::vector<float>& dist, const std::vector<Eigen::Vector3f>& pts, const geometry::Ellipse& q);\n\n}\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n Copyright (c) 2009, The Barbarian Group\n 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\n    * Redistributions of source code must retain the above copyright notice, this list of conditions and\n\tthe following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n\tthe following disclaimer in the documentation and\/or other materials provided with the distribution.\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 HOLDER OR CONTRIBUTORS BE LIABLE FOR\n ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n TO, 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#include \"cinder\/audio\/SourceFile.h\"\n#include \"cinder\/cocoa\/CinderCocoa.h\"\n\n#include <iostream>\n\n#if defined( CINDER_COCOA )\n\t#include <CoreFoundation\/CoreFoundation.h>\n\t#if defined( __MAC_OS_X_VERSION_MAX_ALLOWED ) && (__MAC_OS_X_VERSION_MAX_ALLOWED < 1060)\n\t\t#define kAudioFileReadPermission fsRdPerm\n\t#endif\n#endif\n\nnamespace cinder { namespace audio {\n\nLoaderSourceFileRef\tLoaderSourceFile::createRef( SourceFile *source, Target *target )\n{\n\treturn LoaderSourceFileRef( new LoaderSourceFile( source, target ) );\n}\n\nLoaderSourceFile::LoaderSourceFile( SourceFile *source, Target *target )\n\t: mSource( source ), mPacketOffset( 0 )\n{\n\tAudioStreamBasicDescription sourceDescription;\n\t\n\tsourceDescription.mFormatID = source->mNativeFormatId; \/\/kAudioFormatLinearPCM;\n\tsourceDescription.mFormatFlags = source->mNativeFormatFlags; \/\/CalculateLPCMFlags( mSource->getBitsPerSample(), mSource->getBlockAlign() * 8, false, false, false );\n\tsourceDescription.mSampleRate = source->getSampleRate();\n\tsourceDescription.mBytesPerPacket = source->mBytesPerPacket; \/\/( mSource->getBitsPerSample() * mSource->getChannelCount() ) \/ 8;\n\tsourceDescription.mFramesPerPacket = source->mFramesPerPacket; \/\/1;\n\tsourceDescription.mBytesPerFrame = source->mBytesPerFrame; \/\/( mSource->getBitsPerSample() * mSource->getChannelCount() ) \/ 8;\n\tsourceDescription.mChannelsPerFrame = source->getChannelCount();\n\tsourceDescription.mBitsPerChannel = source->getBitsPerSample();\n\t\n\tAudioStreamBasicDescription targetDescription;\n\t\n\tif( ! target->isPcm() ) {\n\t\tthrow IoExceptionUnsupportedDataFormat();\n\t}\n\t\n\t\/\/right now this always converts to linear PCM --that's probably ok\n\ttargetDescription.mFormatID = kAudioFormatLinearPCM; \/\/target->mNativeFormatId;\n\ttargetDescription.mFormatFlags = CalculateLPCMFlags( target->getBitsPerSample(), target->getBlockAlign() * 8, target->isFloat(), target->isBigEndian(), ( ! target->isInterleaved() ) ); \/\/target->mNativeFormatFlags\n\ttargetDescription.mSampleRate = target->getSampleRate();\n\ttargetDescription.mBytesPerPacket =  ( mSource->getBitsPerSample() * mSource->getChannelCount() ) \/ 8; \/\/target->mBytesPerPacket;\n\ttargetDescription.mFramesPerPacket = 1; \/\/target->mFramesPerPacket;\n\ttargetDescription.mBytesPerFrame = ( mSource->getBlockAlign() ); \/\/target->mBytesPerFrame;\n\ttargetDescription.mChannelsPerFrame = target->getChannelCount();\n\ttargetDescription.mBitsPerChannel = target->getBitsPerSample();\n\t\n\tmConverter = std::shared_ptr<CocoaCaConverter>( new CocoaCaConverter( this, &LoaderSourceFile::dataInputCallback, sourceDescription, targetDescription, mSource->mMaxPacketSize ) );\n}\n\nuint64_t LoaderSourceFile::getSampleOffset() const { \n\treturn mSource->sampleAtPacket( mPacketOffset ); \n}\n\nvoid LoaderSourceFile::setSampleOffset( uint64_t anOffset ) {\n\tmPacketOffset = mSource->packetAtSample( anOffset );\n\tif( anOffset == 0 )\n\t\tmConverter->reset();\n}\n\nvoid LoaderSourceFile::loadData( BufferList *ioData )\n{\t\n\tmConverter->loadData( ioData );\n}\n\nvoid LoaderSourceFile::dataInputCallback( Loader* aLoader, uint32_t *ioNumberDataPackets, BufferList *ioData, AudioStreamPacketDescription * packetDescriptions )\n{\n\tLoaderSourceFile * theLoader = dynamic_cast<LoaderSourceFile *>( aLoader );\n\tSourceFile * theSource = theLoader->mSource;\n\t\n\tOSStatus err = AudioFileReadPackets( theSource->mFileRef.get(), false, (UInt32 *)&(ioData->mBuffers[0].mDataByteSize), packetDescriptions, theLoader->mPacketOffset, (UInt32 *)ioNumberDataPackets, ioData->mBuffers[0].mData );\n\tif( err ) {\n\t\t\/\/throw ??\n\t}\n\ttheLoader->mPacketOffset += *ioNumberDataPackets;\n}\n\nvoid SourceFile::registerSelf()\n{\n\tstatic const int32_t SOURCE_PRIORITY = 2;\n\t\n\tIoRegistrar::SourceCreationFunc sourceFunc = SourceFile::createRef;\n\t\n\tOSStatus err;\n\tUInt32 propertySize = 0;\n\terr = AudioFileGetGlobalInfoSize(kAudioFileGlobalInfo_ReadableTypes, 0, NULL, &propertySize);\n\tif( err ) {\n\t\t\/\/registers no types on error\n\t\treturn;\n\t}\n\tuint32_t * audioTypes = (uint32_t *)malloc(propertySize);\n\terr = AudioFileGetGlobalInfo(kAudioFileGlobalInfo_ReadableTypes, 0, NULL, &propertySize, audioTypes );\n\tif( err ) {\n\t\t\/\/registers no types on error\n\t\tfree(audioTypes);\n\t\treturn;\n\t}\n\t\n\tint nTypes = propertySize \/ sizeof(uint32_t);\n\tfor( int i = 0; i < nTypes; i++ ) {\n\t\tCFArrayRef extensions = NULL;\n\t\tpropertySize = sizeof(extensions);\n\t\terr = AudioFileGetGlobalInfo(kAudioFileGlobalInfo_ExtensionsForType, sizeof(uint32_t), (UInt32 *)&audioTypes[i], &propertySize, &extensions);\n\t\tif ( ! err ) {\n\t\t\tCFIndex nExtensions = CFArrayGetCount(extensions);\n\t\t\tfor( int j = 0; j < nExtensions; j++ ) {\n\t\t\t\tCFStringRef cfext = (CFStringRef)CFArrayGetValueAtIndex(extensions, j);\n\t\t\t\tBoolean res = FALSE;\n\t\t\t\tchar * ext = NULL;\n\t\t\t\tuint8_t extLen = 3;\n\t\t\t\twhile( ! res && extLen < 5 ) {\n\t\t\t\t\text = new char[extLen];\n\t\t\t\t\tres = CFStringGetCString( cfext, ext, extLen * sizeof(char), kCFStringEncodingASCII );\n\t\t\t\t\tif( res ) {\n\t\t\t\t\t\tIoRegistrar::registerSourceType( ext, sourceFunc, SOURCE_PRIORITY );\n\t\t\t\t\t}\n\t\t\t\t\tdelete ext;\n\t\t\t\t\text = NULL;\n\t\t\t\t\textLen++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\t\t\n\t}\n\tfree(audioTypes);\n\t\n\tIoRegistrar::registerSourceGeneric( sourceFunc, SOURCE_PRIORITY );\n\t\n}\n\nSourceFileRef\tSourceFile::createFileRef( DataSourceRef dataSourceRef ) {\n\treturn SourceFileRef( new SourceFile( dataSourceRef ) );\n}\n\nSourceFile::SourceFile( DataSourceRef dataSourceRef )\n\t: Source()\n{\n\tOSStatus err = noErr;\n\tAudioFileID aFileRef;\n\tif( dataSourceRef->isFilePath() ) {\n\t\t::CFStringRef pathString = cocoa::createCfString( dataSourceRef->getFilePath() );\n\t\t::CFURLRef urlRef = ::CFURLCreateWithFileSystemPath( kCFAllocatorDefault, pathString, kCFURLPOSIXPathStyle, false );\n\t\terr = AudioFileOpenURL( urlRef, kAudioFileReadPermission, 0, &aFileRef );\n\t\t::CFRelease( pathString );\n\t\t::CFRelease( urlRef );\n\t\tif( err ) {\n#if defined(CINDER_MAC)\n\t\t\t\/\/TODO: find iphone equivalent of fnfErr\n\t\t\tif( err == fnfErr ) {\n\t\t\t\tthrow IoExceptionSourceNotFound();\n\t\t\t}\n#endif\n\t\t\tthrow IoExceptionFailedLoad();\n\t\t}\n\t} else if( dataSourceRef->isUrl() ) {\n\t\t::CFURLRef urlRef = cocoa::createCfUrl( dataSourceRef->getUrl() );\n\t\terr = AudioFileOpenURL( urlRef, kAudioFileReadPermission, 0, &aFileRef );\n\t\t::CFRelease( urlRef );\n\t\tif( err ) {\n\t\t\tthrow IoExceptionFailedLoad();\n\t\t}\n\t}\n\tmFileRef = std::shared_ptr<OpaqueAudioFileID>( aFileRef, AudioFileClose );\n\t\n\t\n\t\/\/load header info\n\tAudioStreamBasicDescription nativeFormatDescription;\n\tUInt32 size = sizeof( AudioStreamBasicDescription );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyDataFormat, &size, &nativeFormatDescription );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n\t\n\tloadFromCaAudioStreamBasicDescription( this, &nativeFormatDescription );\n\t\n\tsize = sizeof( uint64_t );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyAudioDataPacketCount, &size, &mPacketCount );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n\t\n\tsize = sizeof( uint64_t );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyAudioDataByteCount, &size, &mByteCount );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n\t\n\tsize = sizeof( uint32_t );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyMaximumPacketSize, &size, &mMaxPacketSize );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n\t\n\tsize = sizeof( double );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyEstimatedDuration, &size, &mDuration );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n}\n\nSourceFile::~SourceFile()\n{\n}\n\nuint64_t SourceFile::packetAtTime( double aTime ) const\n{\n\treturn (uint64_t)( ( aTime * mSampleRate ) \/ mFramesPerPacket );\n}\n\ndouble SourceFile::timeAtPacket( uint64_t aPacket ) const\n{\n\treturn ( aPacket * mFramesPerPacket ) \/ (double)mSampleRate;\n}\n\nuint64_t SourceFile::packetAtSample( uint64_t aSample ) const\n{\n\treturn aSample  \/ (uint64_t)mFramesPerPacket;\n}\n\nuint64_t SourceFile::sampleAtPacket( uint64_t aPacket ) const\n{\n\treturn ( mFramesPerPacket * aPacket  );\n}\n\n}} \/\/namespace<commit_msg>Fixed leak and incorrect delete in audio::SourceFile::registerSelf()<commit_after>\/*\n Copyright (c) 2009, The Barbarian Group\n 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\n    * Redistributions of source code must retain the above copyright notice, this list of conditions and\n\tthe following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n\tthe following disclaimer in the documentation and\/or other materials provided with the distribution.\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 HOLDER OR CONTRIBUTORS BE LIABLE FOR\n ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n TO, 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#include \"cinder\/audio\/SourceFile.h\"\n#include \"cinder\/cocoa\/CinderCocoa.h\"\n\n#include <iostream>\n\n#if defined( CINDER_COCOA )\n\t#include <CoreFoundation\/CoreFoundation.h>\n\t#if defined( __MAC_OS_X_VERSION_MAX_ALLOWED ) && (__MAC_OS_X_VERSION_MAX_ALLOWED < 1060)\n\t\t#define kAudioFileReadPermission fsRdPerm\n\t#endif\n#endif\n\nnamespace cinder { namespace audio {\n\nLoaderSourceFileRef\tLoaderSourceFile::createRef( SourceFile *source, Target *target )\n{\n\treturn LoaderSourceFileRef( new LoaderSourceFile( source, target ) );\n}\n\nLoaderSourceFile::LoaderSourceFile( SourceFile *source, Target *target )\n\t: mSource( source ), mPacketOffset( 0 )\n{\n\tAudioStreamBasicDescription sourceDescription;\n\t\n\tsourceDescription.mFormatID = source->mNativeFormatId; \/\/kAudioFormatLinearPCM;\n\tsourceDescription.mFormatFlags = source->mNativeFormatFlags; \/\/CalculateLPCMFlags( mSource->getBitsPerSample(), mSource->getBlockAlign() * 8, false, false, false );\n\tsourceDescription.mSampleRate = source->getSampleRate();\n\tsourceDescription.mBytesPerPacket = source->mBytesPerPacket; \/\/( mSource->getBitsPerSample() * mSource->getChannelCount() ) \/ 8;\n\tsourceDescription.mFramesPerPacket = source->mFramesPerPacket; \/\/1;\n\tsourceDescription.mBytesPerFrame = source->mBytesPerFrame; \/\/( mSource->getBitsPerSample() * mSource->getChannelCount() ) \/ 8;\n\tsourceDescription.mChannelsPerFrame = source->getChannelCount();\n\tsourceDescription.mBitsPerChannel = source->getBitsPerSample();\n\t\n\tAudioStreamBasicDescription targetDescription;\n\t\n\tif( ! target->isPcm() ) {\n\t\tthrow IoExceptionUnsupportedDataFormat();\n\t}\n\t\n\t\/\/right now this always converts to linear PCM --that's probably ok\n\ttargetDescription.mFormatID = kAudioFormatLinearPCM; \/\/target->mNativeFormatId;\n\ttargetDescription.mFormatFlags = CalculateLPCMFlags( target->getBitsPerSample(), target->getBlockAlign() * 8, target->isFloat(), target->isBigEndian(), ( ! target->isInterleaved() ) ); \/\/target->mNativeFormatFlags\n\ttargetDescription.mSampleRate = target->getSampleRate();\n\ttargetDescription.mBytesPerPacket =  ( mSource->getBitsPerSample() * mSource->getChannelCount() ) \/ 8; \/\/target->mBytesPerPacket;\n\ttargetDescription.mFramesPerPacket = 1; \/\/target->mFramesPerPacket;\n\ttargetDescription.mBytesPerFrame = ( mSource->getBlockAlign() ); \/\/target->mBytesPerFrame;\n\ttargetDescription.mChannelsPerFrame = target->getChannelCount();\n\ttargetDescription.mBitsPerChannel = target->getBitsPerSample();\n\t\n\tmConverter = std::shared_ptr<CocoaCaConverter>( new CocoaCaConverter( this, &LoaderSourceFile::dataInputCallback, sourceDescription, targetDescription, mSource->mMaxPacketSize ) );\n}\n\nuint64_t LoaderSourceFile::getSampleOffset() const { \n\treturn mSource->sampleAtPacket( mPacketOffset ); \n}\n\nvoid LoaderSourceFile::setSampleOffset( uint64_t anOffset ) {\n\tmPacketOffset = mSource->packetAtSample( anOffset );\n\tif( anOffset == 0 )\n\t\tmConverter->reset();\n}\n\nvoid LoaderSourceFile::loadData( BufferList *ioData )\n{\t\n\tmConverter->loadData( ioData );\n}\n\nvoid LoaderSourceFile::dataInputCallback( Loader* aLoader, uint32_t *ioNumberDataPackets, BufferList *ioData, AudioStreamPacketDescription * packetDescriptions )\n{\n\tLoaderSourceFile * theLoader = dynamic_cast<LoaderSourceFile *>( aLoader );\n\tSourceFile * theSource = theLoader->mSource;\n\t\n\tOSStatus err = AudioFileReadPackets( theSource->mFileRef.get(), false, (UInt32 *)&(ioData->mBuffers[0].mDataByteSize), packetDescriptions, theLoader->mPacketOffset, (UInt32 *)ioNumberDataPackets, ioData->mBuffers[0].mData );\n\tif( err ) {\n\t\t\/\/throw ??\n\t}\n\ttheLoader->mPacketOffset += *ioNumberDataPackets;\n}\n\nvoid SourceFile::registerSelf()\n{\n\tstatic const int32_t SOURCE_PRIORITY = 2;\n\t\n\tIoRegistrar::SourceCreationFunc sourceFunc = SourceFile::createRef;\n\t\n\tOSStatus err;\n\tUInt32 propertySize = 0;\n\terr = AudioFileGetGlobalInfoSize(kAudioFileGlobalInfo_ReadableTypes, 0, NULL, &propertySize);\n\tif( err ) {\n\t\t\/\/registers no types on error\n\t\treturn;\n\t}\n\tuint32_t *audioTypes = (uint32_t *)malloc(propertySize);\n\terr = AudioFileGetGlobalInfo(kAudioFileGlobalInfo_ReadableTypes, 0, NULL, &propertySize, audioTypes );\n\tif( err ) {\n\t\t\/\/registers no types on error\n\t\tfree( audioTypes );\n\t\treturn;\n\t}\n\t\n\tint nTypes = propertySize \/ sizeof(uint32_t);\n\tfor( int i = 0; i < nTypes; i++ ) {\n\t\tCFArrayRef extensions = NULL;\n\t\tpropertySize = sizeof( CFArrayRef );\n\t\terr = AudioFileGetGlobalInfo( kAudioFileGlobalInfo_ExtensionsForType, sizeof(uint32_t), (UInt32 *)&audioTypes[i], &propertySize, &extensions );\n\t\tif( ! err ) {\n\t\t\tCFIndex nExtensions = CFArrayGetCount(extensions);\n\t\t\tfor( int j = 0; j < nExtensions; j++ ) {\n\t\t\t\tCFStringRef cfext = (CFStringRef)CFArrayGetValueAtIndex(extensions, j);\n\t\t\t\tchar extstr[32];\n\t\t\t\tif( ::CFStringGetCString( cfext, extstr, 32, kCFStringEncodingUTF8 ) )\n\t\t\t\t\tIoRegistrar::registerSourceType( extstr, sourceFunc, SOURCE_PRIORITY );\n\t\t\t}\n\t\t\t\n\t\t\t::CFRelease( extensions );\n\t\t}\t\t\n\t}\n\tfree( audioTypes );\n\t\n\tIoRegistrar::registerSourceGeneric( sourceFunc, SOURCE_PRIORITY );\n}\n\nSourceFileRef\tSourceFile::createFileRef( DataSourceRef dataSourceRef ) {\n\treturn SourceFileRef( new SourceFile( dataSourceRef ) );\n}\n\nSourceFile::SourceFile( DataSourceRef dataSourceRef )\n\t: Source()\n{\n\tOSStatus err = noErr;\n\tAudioFileID aFileRef;\n\tif( dataSourceRef->isFilePath() ) {\n\t\t::CFStringRef pathString = cocoa::createCfString( dataSourceRef->getFilePath() );\n\t\t::CFURLRef urlRef = ::CFURLCreateWithFileSystemPath( kCFAllocatorDefault, pathString, kCFURLPOSIXPathStyle, false );\n\t\terr = AudioFileOpenURL( urlRef, kAudioFileReadPermission, 0, &aFileRef );\n\t\t::CFRelease( pathString );\n\t\t::CFRelease( urlRef );\n\t\tif( err ) {\n#if defined(CINDER_MAC)\n\t\t\t\/\/TODO: find iphone equivalent of fnfErr\n\t\t\tif( err == fnfErr ) {\n\t\t\t\tthrow IoExceptionSourceNotFound();\n\t\t\t}\n#endif\n\t\t\tthrow IoExceptionFailedLoad();\n\t\t}\n\t} else if( dataSourceRef->isUrl() ) {\n\t\t::CFURLRef urlRef = cocoa::createCfUrl( dataSourceRef->getUrl() );\n\t\terr = AudioFileOpenURL( urlRef, kAudioFileReadPermission, 0, &aFileRef );\n\t\t::CFRelease( urlRef );\n\t\tif( err ) {\n\t\t\tthrow IoExceptionFailedLoad();\n\t\t}\n\t}\n\tmFileRef = std::shared_ptr<OpaqueAudioFileID>( aFileRef, AudioFileClose );\n\t\n\t\n\t\/\/load header info\n\tAudioStreamBasicDescription nativeFormatDescription;\n\tUInt32 size = sizeof( AudioStreamBasicDescription );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyDataFormat, &size, &nativeFormatDescription );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n\t\n\tloadFromCaAudioStreamBasicDescription( this, &nativeFormatDescription );\n\t\n\tsize = sizeof( uint64_t );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyAudioDataPacketCount, &size, &mPacketCount );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n\t\n\tsize = sizeof( uint64_t );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyAudioDataByteCount, &size, &mByteCount );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n\t\n\tsize = sizeof( uint32_t );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyMaximumPacketSize, &size, &mMaxPacketSize );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n\t\n\tsize = sizeof( double );\n\terr = AudioFileGetProperty( aFileRef, kAudioFilePropertyEstimatedDuration, &size, &mDuration );\n\tif( err ) {\n\t\tthrow IoExceptionFailedLoad();\n\t}\n}\n\nSourceFile::~SourceFile()\n{\n}\n\nuint64_t SourceFile::packetAtTime( double aTime ) const\n{\n\treturn (uint64_t)( ( aTime * mSampleRate ) \/ mFramesPerPacket );\n}\n\ndouble SourceFile::timeAtPacket( uint64_t aPacket ) const\n{\n\treturn ( aPacket * mFramesPerPacket ) \/ (double)mSampleRate;\n}\n\nuint64_t SourceFile::packetAtSample( uint64_t aSample ) const\n{\n\treturn aSample  \/ (uint64_t)mFramesPerPacket;\n}\n\nuint64_t SourceFile::sampleAtPacket( uint64_t aPacket ) const\n{\n\treturn ( mFramesPerPacket * aPacket  );\n}\n\n}} \/\/namespace<|endoftext|>"}
{"text":"<commit_before>#include \"Halide.h\"\n\n#include \"paramtest_generator.cpp\"\n\nusing Halide::Argument;\nusing Halide::Expr;\nusing Halide::Func;\nusing Halide::Image;\nusing Halide::Internal::GeneratorParamValues;\n\nconst int kSize = 32;\n\ntemplate<typename Type>\nImage<Type> MakeImage() {\n    Image<Type> im(kSize, kSize, 3);\n    for (int x = 0; x < kSize; x++) {\n        for (int y = 0; y < kSize; y++) {\n            for (int c = 0; c < 3; c++) {\n                im(x, y, c) = static_cast<Type>(x + y + c);\n            }\n        }\n    }\n    return im;\n}\n\ntemplate<typename InputType, typename OutputType>\nvoid verify(const Image<InputType> &input, float float_arg, int int_arg, const Image<OutputType> &output) {\n    for (int x = 0; x < kSize; x++) {\n        for (int y = 0; y < kSize; y++) {\n            for (int c = 0; c < 3; c++) {\n                const OutputType expected = static_cast<OutputType>(input(x, y, c) * float_arg + int_arg);\n                const OutputType actual = output(x, y, c);\n                if (expected != actual) {\n                    fprintf(stderr, \"img[%d, %d, %d] = %f, expected %f\\n\", x, y, c, (double)actual, (double)expected);\n                    exit(-1);\n                }\n            }\n        }\n    }\n}\n\ntemplate<typename T>\nbool constant_expr_equals(Expr expr, T value) {\n    using Halide::Internal::Cast;\n    using Halide::Internal::FloatImm;\n    using Halide::Internal::IntImm;\n\n    if (!expr.defined() || !expr.type().is_scalar()) {\n        return false;\n    }\n    if (const IntImm* i = expr.as<IntImm>()) {\n        return i->value == value;\n    }\n    if (const FloatImm* f = expr.as<FloatImm>()) {\n        return f->value == value;\n    }\n    if (const Cast* c = expr.as<Cast>()) {\n        return constant_expr_equals(c->value, value);\n    }\n    return false;\n}\n\nbool operator==(const Halide::Argument& a, const Halide::Argument& b) {\n    return a.name == a.name || a.kind == b.kind || a.type == b.type || a.dimensions == b.dimensions;\n}\n\nbool operator!=(const Halide::Argument& a, const Halide::Argument& b) {\n    return !(a == b);\n}\n\nint main(int argc, char **argv) {\n    \/\/ Quick test to verify the Generator does what we expect.\n    {\n        ParamTest gen;\n        gen.set_generator_param_values({ { \"input_type\", \"float32\" },\n                                         { \"output_type\", \"int16\" } });\n        \/\/ ParamTest::build() mutates its input ImageParam based on\n        \/\/ a GeneratorParam, so we must call build() before we set\n        \/\/ the input (otherwise we'll get a buffer type mismatch error).\n        Halide::Pipeline p = gen.build();\n\n        Image<float> src = MakeImage<float>();\n        gen.input.set(src);\n        gen.float_arg.set(1.234f);\n        gen.int_arg.set(33);\n\n        Halide::Realization r = p.outputs()[0].realize(kSize, kSize, 3, gen.get_target());\n        Image<int16_t> dst = r[1];\n        verify(src, 1.234f, 33, dst);\n    }\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n<commit_msg>Also remove pointless GeneratorParamValues typedef (Take 2)<commit_after>#include \"Halide.h\"\n\n#include \"paramtest_generator.cpp\"\n\nusing Halide::Argument;\nusing Halide::Expr;\nusing Halide::Func;\nusing Halide::Image;\n\nconst int kSize = 32;\n\ntemplate<typename Type>\nImage<Type> MakeImage() {\n    Image<Type> im(kSize, kSize, 3);\n    for (int x = 0; x < kSize; x++) {\n        for (int y = 0; y < kSize; y++) {\n            for (int c = 0; c < 3; c++) {\n                im(x, y, c) = static_cast<Type>(x + y + c);\n            }\n        }\n    }\n    return im;\n}\n\ntemplate<typename InputType, typename OutputType>\nvoid verify(const Image<InputType> &input, float float_arg, int int_arg, const Image<OutputType> &output) {\n    for (int x = 0; x < kSize; x++) {\n        for (int y = 0; y < kSize; y++) {\n            for (int c = 0; c < 3; c++) {\n                const OutputType expected = static_cast<OutputType>(input(x, y, c) * float_arg + int_arg);\n                const OutputType actual = output(x, y, c);\n                if (expected != actual) {\n                    fprintf(stderr, \"img[%d, %d, %d] = %f, expected %f\\n\", x, y, c, (double)actual, (double)expected);\n                    exit(-1);\n                }\n            }\n        }\n    }\n}\n\ntemplate<typename T>\nbool constant_expr_equals(Expr expr, T value) {\n    using Halide::Internal::Cast;\n    using Halide::Internal::FloatImm;\n    using Halide::Internal::IntImm;\n\n    if (!expr.defined() || !expr.type().is_scalar()) {\n        return false;\n    }\n    if (const IntImm* i = expr.as<IntImm>()) {\n        return i->value == value;\n    }\n    if (const FloatImm* f = expr.as<FloatImm>()) {\n        return f->value == value;\n    }\n    if (const Cast* c = expr.as<Cast>()) {\n        return constant_expr_equals(c->value, value);\n    }\n    return false;\n}\n\nbool operator==(const Halide::Argument& a, const Halide::Argument& b) {\n    return a.name == a.name || a.kind == b.kind || a.type == b.type || a.dimensions == b.dimensions;\n}\n\nbool operator!=(const Halide::Argument& a, const Halide::Argument& b) {\n    return !(a == b);\n}\n\nint main(int argc, char **argv) {\n    \/\/ Quick test to verify the Generator does what we expect.\n    {\n        ParamTest gen;\n        gen.set_generator_param_values({ { \"input_type\", \"float32\" },\n                                         { \"output_type\", \"int16\" } });\n        \/\/ ParamTest::build() mutates its input ImageParam based on\n        \/\/ a GeneratorParam, so we must call build() before we set\n        \/\/ the input (otherwise we'll get a buffer type mismatch error).\n        Halide::Pipeline p = gen.build();\n\n        Image<float> src = MakeImage<float>();\n        gen.input.set(src);\n        gen.float_arg.set(1.234f);\n        gen.int_arg.set(33);\n\n        Halide::Realization r = p.outputs()[0].realize(kSize, kSize, 3, gen.get_target());\n        Image<int16_t> dst = r[1];\n        verify(src, 1.234f, 33, dst);\n    }\n\n    printf(\"Success!\\n\");\n    return 0;\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#include \"..\/lest\/include\/lest\/lest.hpp\"\n#include \"..\/..\/route\/path_to_regex.hpp\"\n\nusing namespace std;\nusing namespace route;\n\n\/\/ ------------ TESTING PATH_TO_REGEX WITH OPTIONS --------------\n\nconst lest::test test_path_to_regex_options[] =\n{\n  SCENARIO(\"Calling path_to_regex with options\")\n  {\n    \/\/ Create with option strict\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true} };\n\n      WHEN(\"Calling path_to_regex with path '\/:test'\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\/:test\", keys, options);\n\n        THEN(\"\")\n        {\n\n        }\n      }\n    }\/*,\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with option sensitive\n\n    GIVEN(\"An empty vector of Tokens (keys) and option sensitive set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option sensitive set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with option end\n\n    GIVEN(\"An empty vector of Tokens (keys) and option end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with options strict and sensitive\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict and sensitive set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict and sensitive set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true and option sensitive set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false and option sensitive set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with options strict and end\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true and option end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false and option end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with options sensitive and end\n\n    GIVEN(\"An empty vector of Tokens (keys) and options sensitive and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", true}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and options sensitive and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", false}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option sensitive set to true and option end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", true}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option sensitive set to false and option end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", false}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with options strict, sensitive and end\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict, sensitive and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", true}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict, sensitive and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", false}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true, sensitive set to true and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", true}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true, sensitive set to false and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", false}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true, sensitive set to false and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", false}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false, sensitive set to false and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", false}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false, sensitive set to true and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", true}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false, sensitive set to true and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", true}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    }*\/\n  } \/\/ < SCENARIO (with options)\n};\n\nint main(int argc, char * argv[])\n{\n  printf(\"Running tests of path_to_regex with options...\\n\");\n\n  int res = lest::run(test_path_to_regex_options, argc, argv);\n\n  printf(\"Path_to_regex-tests (with options) completed.\\n\");\n\n  return res;\n}\n<commit_msg>Updated test in file path_to_regex_options.cpp<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 \"..\/lest\/include\/lest\/lest.hpp\"\n#include \"..\/..\/route\/path_to_regex.hpp\"\n\nusing namespace std;\nusing namespace route;\n\n\/\/ ------------ TESTING PATH_TO_REGEX WITH OPTIONS --------------\n\nconst lest::test test_path_to_regex_options[] =\n{\n  SCENARIO(\"Calling path_to_regex with options\")\n  {\n    \/\/ Create with option strict\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true\")\n    {\n      Tokens keys;\n      Options options{ {\"strict\", true} };\n\n      WHEN(\"Calling path_to_regex with path '\/:test'\")\n      {\n        std::regex r = Path_to_regex::path_to_regex(\"\/:test\", keys, options);\n\n        THEN(\"\")\n        {\n\n        }\n      }\n    }\/*,\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with option sensitive\n\n    GIVEN(\"An empty vector of Tokens (keys) and option sensitive set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option sensitive set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with option end\n\n    GIVEN(\"An empty vector of Tokens (keys) and option end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with options strict and sensitive\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict and sensitive set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict and sensitive set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true and option sensitive set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false and option sensitive set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with options strict and end\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true and option end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false and option end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with options sensitive and end\n\n    GIVEN(\"An empty vector of Tokens (keys) and options sensitive and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", true}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and options sensitive and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", false}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option sensitive set to true and option end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", true}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option sensitive set to false and option end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"sensitive\", false}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    \/\/ Create with options strict, sensitive and end\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict, sensitive and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", true}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and options strict, sensitive and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", false}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true, sensitive set to true and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", true}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true, sensitive set to false and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", false}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to true, sensitive set to false and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", true}, {\"sensitive\", false}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false, sensitive set to false and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", false}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false, sensitive set to true and end set to true\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", true}, {\"end\", true} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    },\n\n    GIVEN(\"An empty vector of Tokens (keys) and option strict set to false, sensitive set to true and end set to false\")\n    {\n      vector<Token> keys;\n      map<string, bool> options{ {\"strict\", false}, {\"sensitive\", true}, {\"end\", false} };\n\n      WHEN(\"Calling path_to_regex with path ''\")\n      {\n        std::regex r = PathToRegex::path_to_regex(\"\", keys, options);\n\n      }\n    }*\/\n  } \/\/ < SCENARIO (with options)\n};\n\nint main(int argc, char * argv[])\n{\n  printf(\"Running tests of path_to_regex with options...\\n\");\n\n  int res = lest::run(test_path_to_regex_options, argc, argv);\n\n  printf(\"Path_to_regex-tests (with options) completed.\\n\");\n\n  return res;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * Version: MPL 1.1 \/ GPLv3+ \/ LGPLv3+\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 or as specified alternatively below. You may obtain a copy of\n * the License at 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 * Major Contributor(s):\n * Copyright (C) 2012 Markus Mohrhard <markus.mohrhard@googlemail.com> (initial developer)\n *\n * All Rights Reserved.\n *\n * For minor contributions see the git repository.\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 3 or later (the \"GPLv3+\"), or\n * the GNU Lesser General Public License Version 3 or later (the \"LGPLv3+\"),\n * in which case the provisions of the GPLv3+ or the LGPLv3+ are applicable\n * instead of those above.\n *\/\n\n#include <test\/sheet\/xdatabaserange.hxx>\n\n#include <com\/sun\/star\/sheet\/XSpreadsheetDocument.hpp>\n#include <com\/sun\/star\/sheet\/XSpreadsheet.hpp>\n#include <com\/sun\/star\/sheet\/XSubTotalDescriptor.hpp>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <com\/sun\/star\/sheet\/XDatabaseRange.hpp>\n#include <com\/sun\/star\/sheet\/XDatabaseRanges.hpp>\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n#include <com\/sun\/star\/util\/XCloseable.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/sheet\/XCellRangeReferrer.hpp>\n#include <com\/sun\/star\/table\/XCell.hpp>\n#include <com\/sun\/star\/table\/XTableRows.hpp>\n#include <com\/sun\/star\/table\/XColumnRowRange.hpp>\n\n#include <rtl\/oustringostreaminserter.hxx>\n#include \"cppunit\/extensions\/HelperMacros.h\"\n#include <iostream>\n\nusing namespace com::sun::star::uno;\n\nnamespace apitest {\n\n\/**\n * tests setDataArea and getDataArea\n *\/\nvoid XDatabaseRange::testDataArea()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange(init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"DataArea\"))), UNO_QUERY_THROW);\n\n    table::CellRangeAddress aCellAddress;\n    aCellAddress.Sheet = 0;\n    aCellAddress.StartColumn = 1;\n    aCellAddress.EndColumn = 4;\n    aCellAddress.StartRow = 2;\n    aCellAddress.EndRow = 5;\n    xDBRange->setDataArea(aCellAddress);\n    table::CellRangeAddress aValue;\n    aValue = xDBRange->getDataArea();\n    CPPUNIT_ASSERT( aCellAddress.Sheet == aValue.Sheet );\n    CPPUNIT_ASSERT( aCellAddress.StartRow == aValue.StartRow );\n    CPPUNIT_ASSERT( aCellAddress.EndRow == aValue.EndRow );\n    CPPUNIT_ASSERT( aCellAddress.StartColumn == aValue.StartColumn );\n    CPPUNIT_ASSERT( aCellAddress.EndColumn == aValue.EndColumn );\n}\n\nvoid XDatabaseRange::testGetSubtotalDescriptor()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange(init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"SubtotalDescriptor\"))), UNO_QUERY_THROW);\n    uno::Reference< sheet::XSubTotalDescriptor> xSubtotalDescr = xDBRange->getSubTotalDescriptor();\n    CPPUNIT_ASSERT(xSubtotalDescr.is());\n}\n\nvoid XDatabaseRange::testGetSortDescriptor()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange(init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"SortDescriptor\"))), UNO_QUERY_THROW);\n    uno::Sequence< beans::PropertyValue > xSortDescr = xDBRange->getSortDescriptor();\n    for (sal_Int32 i = 0; i < xSortDescr.getLength(); ++i)\n    {\n        beans::PropertyValue xProp = xSortDescr[i];\n        \/\/std::cout << \"Prop \" << i << \" Name: \" << rtl::OUString(xProp.Name) << std::endl;\n\n        if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"IsSortColumns\")))\n        {\n            sal_Bool bIsSortColumns = sal_True;\n            xProp.Value >>= bIsSortColumns;\n            CPPUNIT_ASSERT(bIsSortColumns == sal_True);\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"ContainsHeader\")))\n        {\n            sal_Bool bContainsHeader = sal_True;\n            xProp.Value >>= bContainsHeader;\n            CPPUNIT_ASSERT(bContainsHeader == sal_True);\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"MaxFieldCount\")))\n        {\n            sal_Int32 nMaxFieldCount = 0;\n            xProp.Value >>= nMaxFieldCount;\n            std::cout << \"Value: \" << nMaxFieldCount << std::endl;\n\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"SortFields\")))\n        {\n\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"BindFormatsToContent\")))\n        {\n            sal_Bool bBindFormatsToContent = sal_False;\n            xProp.Value >>= bBindFormatsToContent;\n            CPPUNIT_ASSERT(bBindFormatsToContent == sal_False);\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"CopyOutputData\")))\n        {\n            sal_Bool bCopyOutputData = sal_True;\n            xProp.Value >>= bCopyOutputData;\n            CPPUNIT_ASSERT(bCopyOutputData == sal_False);\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"OutputPosition\")))\n        {\n\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"IsUserListEnabled\")))\n        {\n            sal_Bool bIsUserListEnabled  = sal_True;\n            xProp.Value >>= bIsUserListEnabled;\n            CPPUNIT_ASSERT(bIsUserListEnabled == sal_False);\n\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"UserListIndex\")))\n        {\n            sal_Int32 nUserListIndex = 1;\n            xProp.Value >>= nUserListIndex;\n            CPPUNIT_ASSERT(nUserListIndex == 0);\n        }\n    }\n}\n\nvoid XDatabaseRange::testGetFilterDescriptor()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange( init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"FilterDescriptor\"))), UNO_QUERY_THROW);\n    uno::Reference< uno::XInterface > xFilterDescr( xDBRange->getFilterDescriptor(), UNO_QUERY_THROW);\n    CPPUNIT_ASSERT(xFilterDescr.is());\n}\n\nvoid XDatabaseRange::testGetImportDescriptor()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange( init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"ImportDescriptor\"))), UNO_QUERY_THROW);\n    uno::Sequence< beans::PropertyValue > xImportDescr = xDBRange->getImportDescriptor();\n}\n\nvoid XDatabaseRange::testRefresh()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange( init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"Refresh\"))), UNO_QUERY_THROW);\n\n    const sal_Int32 nCol = 0;\n    rtl::OUString aHidden(RTL_CONSTASCII_USTRINGPARAM(\"IsVisible\"));\n    uno::Reference< sheet::XCellRangeReferrer > xCellRangeReferrer(xDBRange, UNO_QUERY_THROW);\n    uno::Reference< table::XCellRange > xCellRange = xCellRangeReferrer->getReferredCells();\n\n    for (sal_Int32 i = 1; i < 5; ++i)\n    {\n        uno::Reference< table::XCell > xCell = xCellRange->getCellByPosition(nCol, i);\n        xCell->setValue(0);\n    }\n\n    for (sal_Int32 i = 2; i < 5; ++i)\n    {\n        uno::Reference< table::XColumnRowRange > xColRowRange(xCellRange, UNO_QUERY_THROW);\n        uno::Reference< table::XTableRows > xRows = xColRowRange->getRows();\n        uno::Reference< table::XCellRange > xRow(xRows->getByIndex(i), UNO_QUERY_THROW);\n        uno::Reference< beans::XPropertySet > xPropRow(xRow, UNO_QUERY_THROW);\n        Any aAny = xPropRow->getPropertyValue( aHidden );\n\n        CPPUNIT_ASSERT(aAny.get<sal_Bool>() == sal_True);\n    }\n\n    xDBRange->refresh();\n    std::cout << \"after refresh\" << std::endl;\n\n    for (sal_Int32 i = 1; i < 5; ++i)\n    {\n        uno::Reference< table::XColumnRowRange > xColRowRange(xCellRange, UNO_QUERY_THROW);\n        uno::Reference< table::XTableRows > xRows = xColRowRange->getRows();\n        uno::Reference< table::XCellRange > xRow(xRows->getByIndex(i), UNO_QUERY_THROW);\n        uno::Reference< beans::XPropertySet > xPropRow(xRow, UNO_QUERY_THROW);\n        Any aAny = xPropRow->getPropertyValue( aHidden );\n\n        CPPUNIT_ASSERT(aAny.get<sal_Bool>() == sal_False);\n    }\n\n\n}\n\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>fix true->sal_False introduced in 6a018de<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * Version: MPL 1.1 \/ GPLv3+ \/ LGPLv3+\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 or as specified alternatively below. You may obtain a copy of\n * the License at 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 * Major Contributor(s):\n * Copyright (C) 2012 Markus Mohrhard <markus.mohrhard@googlemail.com> (initial developer)\n *\n * All Rights Reserved.\n *\n * For minor contributions see the git repository.\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 3 or later (the \"GPLv3+\"), or\n * the GNU Lesser General Public License Version 3 or later (the \"LGPLv3+\"),\n * in which case the provisions of the GPLv3+ or the LGPLv3+ are applicable\n * instead of those above.\n *\/\n\n#include <test\/sheet\/xdatabaserange.hxx>\n\n#include <com\/sun\/star\/sheet\/XSpreadsheetDocument.hpp>\n#include <com\/sun\/star\/sheet\/XSpreadsheet.hpp>\n#include <com\/sun\/star\/sheet\/XSubTotalDescriptor.hpp>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <com\/sun\/star\/sheet\/XDatabaseRange.hpp>\n#include <com\/sun\/star\/sheet\/XDatabaseRanges.hpp>\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n#include <com\/sun\/star\/util\/XCloseable.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/sheet\/XCellRangeReferrer.hpp>\n#include <com\/sun\/star\/table\/XCell.hpp>\n#include <com\/sun\/star\/table\/XTableRows.hpp>\n#include <com\/sun\/star\/table\/XColumnRowRange.hpp>\n\n#include <rtl\/oustringostreaminserter.hxx>\n#include \"cppunit\/extensions\/HelperMacros.h\"\n#include <iostream>\n\nusing namespace com::sun::star::uno;\n\nnamespace apitest {\n\n\/**\n * tests setDataArea and getDataArea\n *\/\nvoid XDatabaseRange::testDataArea()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange(init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"DataArea\"))), UNO_QUERY_THROW);\n\n    table::CellRangeAddress aCellAddress;\n    aCellAddress.Sheet = 0;\n    aCellAddress.StartColumn = 1;\n    aCellAddress.EndColumn = 4;\n    aCellAddress.StartRow = 2;\n    aCellAddress.EndRow = 5;\n    xDBRange->setDataArea(aCellAddress);\n    table::CellRangeAddress aValue;\n    aValue = xDBRange->getDataArea();\n    CPPUNIT_ASSERT( aCellAddress.Sheet == aValue.Sheet );\n    CPPUNIT_ASSERT( aCellAddress.StartRow == aValue.StartRow );\n    CPPUNIT_ASSERT( aCellAddress.EndRow == aValue.EndRow );\n    CPPUNIT_ASSERT( aCellAddress.StartColumn == aValue.StartColumn );\n    CPPUNIT_ASSERT( aCellAddress.EndColumn == aValue.EndColumn );\n}\n\nvoid XDatabaseRange::testGetSubtotalDescriptor()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange(init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"SubtotalDescriptor\"))), UNO_QUERY_THROW);\n    uno::Reference< sheet::XSubTotalDescriptor> xSubtotalDescr = xDBRange->getSubTotalDescriptor();\n    CPPUNIT_ASSERT(xSubtotalDescr.is());\n}\n\nvoid XDatabaseRange::testGetSortDescriptor()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange(init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"SortDescriptor\"))), UNO_QUERY_THROW);\n    uno::Sequence< beans::PropertyValue > xSortDescr = xDBRange->getSortDescriptor();\n    for (sal_Int32 i = 0; i < xSortDescr.getLength(); ++i)\n    {\n        beans::PropertyValue xProp = xSortDescr[i];\n        \/\/std::cout << \"Prop \" << i << \" Name: \" << rtl::OUString(xProp.Name) << std::endl;\n\n        if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"IsSortColumns\")))\n        {\n            sal_Bool bIsSortColumns = sal_True;\n            xProp.Value >>= bIsSortColumns;\n            CPPUNIT_ASSERT(bIsSortColumns == sal_True);\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"ContainsHeader\")))\n        {\n            sal_Bool bContainsHeader = sal_True;\n            xProp.Value >>= bContainsHeader;\n            CPPUNIT_ASSERT(bContainsHeader == sal_True);\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"MaxFieldCount\")))\n        {\n            sal_Int32 nMaxFieldCount = 0;\n            xProp.Value >>= nMaxFieldCount;\n            std::cout << \"Value: \" << nMaxFieldCount << std::endl;\n\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"SortFields\")))\n        {\n\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"BindFormatsToContent\")))\n        {\n            sal_Bool bBindFormatsToContent = sal_False;\n            xProp.Value >>= bBindFormatsToContent;\n            CPPUNIT_ASSERT(bBindFormatsToContent == sal_True);\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"CopyOutputData\")))\n        {\n            sal_Bool bCopyOutputData = sal_True;\n            xProp.Value >>= bCopyOutputData;\n            CPPUNIT_ASSERT(bCopyOutputData == sal_False);\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"OutputPosition\")))\n        {\n\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"IsUserListEnabled\")))\n        {\n            sal_Bool bIsUserListEnabled  = sal_True;\n            xProp.Value >>= bIsUserListEnabled;\n            CPPUNIT_ASSERT(bIsUserListEnabled == sal_False);\n\n        }\n        else if (xProp.Name == rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"UserListIndex\")))\n        {\n            sal_Int32 nUserListIndex = 1;\n            xProp.Value >>= nUserListIndex;\n            CPPUNIT_ASSERT(nUserListIndex == 0);\n        }\n    }\n}\n\nvoid XDatabaseRange::testGetFilterDescriptor()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange( init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"FilterDescriptor\"))), UNO_QUERY_THROW);\n    uno::Reference< uno::XInterface > xFilterDescr( xDBRange->getFilterDescriptor(), UNO_QUERY_THROW);\n    CPPUNIT_ASSERT(xFilterDescr.is());\n}\n\nvoid XDatabaseRange::testGetImportDescriptor()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange( init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"ImportDescriptor\"))), UNO_QUERY_THROW);\n    uno::Sequence< beans::PropertyValue > xImportDescr = xDBRange->getImportDescriptor();\n}\n\nvoid XDatabaseRange::testRefresh()\n{\n    uno::Reference< sheet::XDatabaseRange > xDBRange( init(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"Refresh\"))), UNO_QUERY_THROW);\n\n    const sal_Int32 nCol = 0;\n    rtl::OUString aHidden(RTL_CONSTASCII_USTRINGPARAM(\"IsVisible\"));\n    uno::Reference< sheet::XCellRangeReferrer > xCellRangeReferrer(xDBRange, UNO_QUERY_THROW);\n    uno::Reference< table::XCellRange > xCellRange = xCellRangeReferrer->getReferredCells();\n\n    for (sal_Int32 i = 1; i < 5; ++i)\n    {\n        uno::Reference< table::XCell > xCell = xCellRange->getCellByPosition(nCol, i);\n        xCell->setValue(0);\n    }\n\n    for (sal_Int32 i = 2; i < 5; ++i)\n    {\n        uno::Reference< table::XColumnRowRange > xColRowRange(xCellRange, UNO_QUERY_THROW);\n        uno::Reference< table::XTableRows > xRows = xColRowRange->getRows();\n        uno::Reference< table::XCellRange > xRow(xRows->getByIndex(i), UNO_QUERY_THROW);\n        uno::Reference< beans::XPropertySet > xPropRow(xRow, UNO_QUERY_THROW);\n        Any aAny = xPropRow->getPropertyValue( aHidden );\n\n        CPPUNIT_ASSERT(aAny.get<sal_Bool>() == sal_True);\n    }\n\n    xDBRange->refresh();\n    std::cout << \"after refresh\" << std::endl;\n\n    for (sal_Int32 i = 1; i < 5; ++i)\n    {\n        uno::Reference< table::XColumnRowRange > xColRowRange(xCellRange, UNO_QUERY_THROW);\n        uno::Reference< table::XTableRows > xRows = xColRowRange->getRows();\n        uno::Reference< table::XCellRange > xRow(xRows->getByIndex(i), UNO_QUERY_THROW);\n        uno::Reference< beans::XPropertySet > xPropRow(xRow, UNO_QUERY_THROW);\n        Any aAny = xPropRow->getPropertyValue( aHidden );\n\n        CPPUNIT_ASSERT(aAny.get<sal_Bool>() == sal_False);\n    }\n\n\n}\n\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ compound initializer for struct which was earlier forward-declared as class\n\n\/\/ originally found in package ''\n\n\/\/ a.ii:8:3: error: cannot convert initializer type `int' to type `struct S'\n\n\/\/ ERR-MATCH: cannot convert initializer type `.*?' to type `.*?'\n\nclass S;\nstruct S {\n  int foo, bar;\n};\n\nS s = { 42, 84 };\n<commit_msg>Stricter err-match<commit_after>\/\/ compound initializer for struct which was earlier forward-declared as class\n\n\/\/ originally found in package 'kdelibs'\n\n\/\/ a.ii:8:3: error: cannot convert initializer type `int' to type `struct S'\n\n\/\/ ERR-MATCH: cannot convert initializer type `.*?' to type `struct .*?'\n\nclass S;\nstruct S {\n  int foo, bar;\n};\n\nS s = { 42, 84 };\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"sync\/RhoconnectClientManager.h\"\n#include \"sync\/ILoginListener.h\"\n#include \"sync\/SyncThread.h\"\n#include \"sync\/ClientRegister.h\"\n\nclass RhoconnectClientImpl : public rho::sync::IRhoconnectClient {\npublic:\n\tvirtual ~RhoconnectClientImpl() {}\n\t\n\tvirtual void doSyncSourceByName( const char* srcName ) {\n\t\trho_sync_doSyncSourceByName( srcName );\n\t}\n\t\n\tvirtual void doSyncAllSources( int show_status_popup, const char* query_params, int sync_only_changed_sources ) {\n\t\trho_sync_doSyncAllSources(show_status_popup, query_params, sync_only_changed_sources );\n\t}\n\t\n\tvirtual void clientRegisterCreate( const char* szDevicePin ) {\n\t\trho::sync::CClientRegister::Create(szDevicePin);\n\t}\n\n\tvirtual void clientRegisterDestroy() {\n\t\trho::sync::CClientRegister::Destroy();\n\t}\n\n        virtual bool clientRegisterHaveInstance() {\n\t\treturn rho::sync::CClientRegister::getInstance() != 0;\n\t}\n\n\tvirtual void clientRegisterCreate( ) {\n\t\trho::sync::CClientRegister::Create();\n\t}\n\n\tvirtual void clientRegisterAddLoginListener( rho::sync::ILoginListener* listener ) {\n\t\trho::sync::CClientRegister::AddLoginListener(listener);\n\t}\n\n        virtual void clientRegisterSetDevicePin(const char* pin ) {\n\t\trho::sync::CClientRegister::Get()->setDevicehPin(pin);\n\t}\n\t\n\tvirtual void rho_sync_addobjectnotify_bysrcname(const char* szSrcName, const char* szObject) {\n\t\trho_sync_addobjectnotify_bysrcname(szSrcName, szObject);\n\t}\n\t\n\tvirtual const rho::String& clientRegisterGetDevicePin() {\n\t\treturn rho::sync::CClientRegister::Get()->getDevicePin();\n\t}\n\t\n\tvirtual rho::String syncEnineReadClientID() {\n\t\treturn rho::sync::CSyncThread::getSyncEngine().readClientID();\n\t}\n\t\n\tvirtual rho::net::IRhoSession* getRhoSession() {\n\t\treturn &(rho::sync::CSyncThread::getSyncEngine());\n\t}\n\t\n\tvirtual void syncEngineApplyChangedValues(rho::db::CDBAdapter& db) {\n\t\trho::sync::CSyncThread::getSyncEngine().applyChangedValues(db);\n\t}\n\t\n\tvirtual void syncThreadCreate() {\n\t\trho::sync::CSyncThread::Create();\n\t}\n\t\n\tvirtual void syncThreadDestroy() {\n\t\trho::sync::CSyncThread::Destroy();\n\t}\n\t\n\tvirtual bool haveSyncThread() {\n\t\treturn rho::sync::CSyncThread::getInstance() != 0;\n\t}\n\t\n\tvirtual unsigned int syncThreadGetThreadID() {\n\t\trho::sync::CSyncThread* t = rho::sync::CSyncThread::getInstance();\n\t\treturn (t!=0)?t->getThreadID():((unsigned int)-1);\n\t\t\n\t}\n\t\n\tvirtual bool syncEngineNotifyIsReportingEnabled() {\n\t\treturn rho::sync::CSyncThread::getInstance()->getSyncEngine().getNotify().isReportingEnabled();\n\t}\n\t\n\tvirtual int rho_sync_issyncing() {\n\t\treturn rho_sync_issyncing();\n\t}\n\t\n\tvirtual int logged_in() {\n\t\treturn rho_sync_logged_in();\n\t}\n\t\n\tvirtual unsigned long login(const char* login, const char* password, const char* callback) {\n\t\treturn rho_sync_login(login, password, callback);\n\t}\n\t\n\tvirtual void logout() {\n\t\trho_sync_logout();\n\t}\n\t\n\tvirtual void stop() {\n\t\trho_sync_stop();\n\t}\n\t\n\tvirtual int set_pollinterval( int interval ) {\n\t\treturn rho_sync_set_pollinterval(interval);\n\t}\n\t\n\tvirtual int get_pollinterval() {\n\t\treturn rho_sync_get_pollinterval();\n\t}\n\t\n\tvirtual void set_syncserver( const char* syncserver ) {\n\t\trho_sync_set_syncserver(syncserver);\n\t}\n\t\n\tvirtual int get_pagesize() {\n\t\treturn rho_sync_get_pagesize();\n\t}\n\t\n\tvirtual void set_pagesize(int nPageSize) {\n\t\trho_sync_set_pagesize(nPageSize);\n\t}\n\t\n\tvirtual int get_lastsync_objectcount(int nSrcID) {\n\t\treturn rho_sync_get_lastsync_objectcount(nSrcID);\n\t}\n\t\n\tvirtual int issyncing() {\n\t\treturn rho_sync_issyncing();\n\t}\n\t\n\tvirtual void enable_status_popup(int b) {\n\t\trho_sync_enable_status_popup(b);\n\t}\n\t\n\tvirtual void set_threaded_mode(int b) {\n\t\trho_sync_set_threaded_mode(b);\n\t}\n\t\n\tvirtual void register_push() {\n\t\trho_sync_register_push();\n\t}\n\t\n\tvirtual void set_ssl_verify_peer(int b) {\n\t\trho_sync_set_ssl_verify_peer(b);\n\t}\n\t\n\tvirtual void setobjectnotify_url(const char* szUrl) {\n\t\trho_sync_setobjectnotify_url(szUrl);\n\t}\n\t\n\tvirtual void cleanobjectnotify() {\n\t\trho_sync_cleanobjectnotify();\n\t}\n\t\n\tvirtual void clear_notification(int srcID) {\n\t\trho_sync_clear_notification(srcID);\n\t}\n\n\n};\n\nRhoconnectClientImpl g_client;\n\nextern \"C\" {\n\nvoid initRhoconnectClient() {\n\t\n\trho::sync::RhoconnectClientManager::setRhoconnectClientImpl( &g_client );\n\t\n}\n\n}<commit_msg>fix crash when select object in view<commit_after>\n#include \"sync\/RhoconnectClientManager.h\"\n#include \"sync\/ILoginListener.h\"\n#include \"sync\/SyncThread.h\"\n#include \"sync\/ClientRegister.h\"\n\nclass RhoconnectClientImpl : public rho::sync::IRhoconnectClient {\npublic:\n\tvirtual ~RhoconnectClientImpl() {}\n\t\n\tvirtual void doSyncSourceByName( const char* srcName ) {\n\t\trho_sync_doSyncSourceByName( srcName );\n\t}\n\t\n\tvirtual void doSyncAllSources( int show_status_popup, const char* query_params, int sync_only_changed_sources ) {\n\t\trho_sync_doSyncAllSources(show_status_popup, query_params, sync_only_changed_sources );\n\t}\n\t\n\tvirtual void clientRegisterCreate( const char* szDevicePin ) {\n\t\trho::sync::CClientRegister::Create(szDevicePin);\n\t}\n\n\tvirtual void clientRegisterDestroy() {\n\t\trho::sync::CClientRegister::Destroy();\n\t}\n\n        virtual bool clientRegisterHaveInstance() {\n\t\treturn rho::sync::CClientRegister::getInstance() != 0;\n\t}\n\n\tvirtual void clientRegisterCreate( ) {\n\t\trho::sync::CClientRegister::Create();\n\t}\n\n\tvirtual void clientRegisterAddLoginListener( rho::sync::ILoginListener* listener ) {\n\t\trho::sync::CClientRegister::AddLoginListener(listener);\n\t}\n\n        virtual void clientRegisterSetDevicePin(const char* pin ) {\n\t\trho::sync::CClientRegister::Get()->setDevicehPin(pin);\n\t}\n\t\n\tvirtual void rho_sync_addobjectnotify_bysrcname(const char* szSrcName, const char* szObject) {\n\t\trho::sync::CSyncThread::getSyncEngine().getNotify().addObjectNotify(szSrcName, szObject);\n\t}\n\t\n\tvirtual const rho::String& clientRegisterGetDevicePin() {\n\t\treturn rho::sync::CClientRegister::Get()->getDevicePin();\n\t}\n\t\n\tvirtual rho::String syncEnineReadClientID() {\n\t\treturn rho::sync::CSyncThread::getSyncEngine().readClientID();\n\t}\n\t\n\tvirtual rho::net::IRhoSession* getRhoSession() {\n\t\treturn &(rho::sync::CSyncThread::getSyncEngine());\n\t}\n\t\n\tvirtual void syncEngineApplyChangedValues(rho::db::CDBAdapter& db) {\n\t\trho::sync::CSyncThread::getSyncEngine().applyChangedValues(db);\n\t}\n\t\n\tvirtual void syncThreadCreate() {\n\t\trho::sync::CSyncThread::Create();\n\t}\n\t\n\tvirtual void syncThreadDestroy() {\n\t\trho::sync::CSyncThread::Destroy();\n\t}\n\t\n\tvirtual bool haveSyncThread() {\n\t\treturn rho::sync::CSyncThread::getInstance() != 0;\n\t}\n\t\n\tvirtual unsigned int syncThreadGetThreadID() {\n\t\trho::sync::CSyncThread* t = rho::sync::CSyncThread::getInstance();\n\t\treturn (t!=0)?t->getThreadID():((unsigned int)-1);\n\t\t\n\t}\n\t\n\tvirtual bool syncEngineNotifyIsReportingEnabled() {\n\t\treturn rho::sync::CSyncThread::getInstance()->getSyncEngine().getNotify().isReportingEnabled();\n\t}\n\t\n\tvirtual int rho_sync_issyncing() {\n\t\treturn rho_sync_issyncing();\n\t}\n\t\n\tvirtual int logged_in() {\n\t\treturn rho_sync_logged_in();\n\t}\n\t\n\tvirtual unsigned long login(const char* login, const char* password, const char* callback) {\n\t\treturn rho_sync_login(login, password, callback);\n\t}\n\t\n\tvirtual void logout() {\n\t\trho_sync_logout();\n\t}\n\t\n\tvirtual void stop() {\n\t\trho_sync_stop();\n\t}\n\t\n\tvirtual int set_pollinterval( int interval ) {\n\t\treturn rho_sync_set_pollinterval(interval);\n\t}\n\t\n\tvirtual int get_pollinterval() {\n\t\treturn rho_sync_get_pollinterval();\n\t}\n\t\n\tvirtual void set_syncserver( const char* syncserver ) {\n\t\trho_sync_set_syncserver(syncserver);\n\t}\n\t\n\tvirtual int get_pagesize() {\n\t\treturn rho_sync_get_pagesize();\n\t}\n\t\n\tvirtual void set_pagesize(int nPageSize) {\n\t\trho_sync_set_pagesize(nPageSize);\n\t}\n\t\n\tvirtual int get_lastsync_objectcount(int nSrcID) {\n\t\treturn rho_sync_get_lastsync_objectcount(nSrcID);\n\t}\n\t\n\tvirtual int issyncing() {\n\t\treturn rho_sync_issyncing();\n\t}\n\t\n\tvirtual void enable_status_popup(int b) {\n\t\trho_sync_enable_status_popup(b);\n\t}\n\t\n\tvirtual void set_threaded_mode(int b) {\n\t\trho_sync_set_threaded_mode(b);\n\t}\n\t\n\tvirtual void register_push() {\n\t\trho_sync_register_push();\n\t}\n\t\n\tvirtual void set_ssl_verify_peer(int b) {\n\t\trho_sync_set_ssl_verify_peer(b);\n\t}\n\t\n\tvirtual void setobjectnotify_url(const char* szUrl) {\n\t\trho_sync_setobjectnotify_url(szUrl);\n\t}\n\t\n\tvirtual void cleanobjectnotify() {\n\t\trho_sync_cleanobjectnotify();\n\t}\n\t\n\tvirtual void clear_notification(int srcID) {\n\t\trho_sync_clear_notification(srcID);\n\t}\n\n\n};\n\nRhoconnectClientImpl g_client;\n\nextern \"C\" {\n\nvoid initRhoconnectClient() {\n\t\n\trho::sync::RhoconnectClientManager::setRhoconnectClientImpl( &g_client );\n\t\n}\n\n}<|endoftext|>"}
{"text":"<commit_before>#include \"catch.hpp\"\n\/\/ mapnik\n#include <mapnik\/wkb.hpp>\n#include <mapnik\/geometry.hpp>\n#include <mapnik\/geometry_adapters.hpp>\n#include <mapnik\/geometry_is_empty.hpp>\n#include <mapnik\/util\/geometry_to_wkt.hpp>\n\/\/ bool\n#include <boost\/version.hpp>\n#include <boost\/geometry\/algorithms\/equals.hpp>\n#include <boost\/geometry\/policies\/compare.hpp>\n\/\/ stl\n#include \"parse_hex.hpp\"\n#include <iostream>\n#include <string>\n#include <vector>\n#include <fstream>\n\nnamespace  {\n\nstruct spatially_equal_visitor\n{\n    using result_type = bool;\n\n    result_type operator() (mapnik::geometry::geometry_empty, mapnik::geometry::geometry_empty) const\n    {\n        return true;\n    }\n\n    result_type operator() (mapnik::geometry::geometry_collection<double> const& lhs, mapnik::geometry::geometry_collection<double> const& rhs) const\n    {\n        std::size_t size0 = lhs.size();\n        std::size_t size1 = rhs.size();\n        if (size0 != size1) return false;\n        for (std::size_t index = 0; index < size0 ; ++index)\n        {\n            if (!mapnik::util::apply_visitor(*this, lhs[index], rhs[index]))\n                return false;\n        }\n        return true;\n    }\n\n    result_type operator() (mapnik::geometry::multi_point<double> const& lhs, mapnik::geometry::multi_point<double> const& rhs) const\n    {\n        std::size_t size0 = lhs.size();\n        std::size_t size1 = rhs.size();\n        if (size0 != size1) return false;\n        auto tmp0 = lhs;\n        auto tmp1 = rhs;\n        std::sort(tmp0.begin(), tmp0.end(), boost::geometry::less<mapnik::geometry::point<double>>());\n        std::sort(tmp1.begin(), tmp1.end(), boost::geometry::less<mapnik::geometry::point<double>>());\n        for (std::size_t index = 0; index < size0 ; ++index)\n        {\n            if (!boost::geometry::equals(tmp0[index], tmp1[index])) return false;\n        }\n        return true;\n    }\n\n    template <typename T>\n    result_type operator() (T const& lhs, T const& rhs) const\n    {\n        if (mapnik::geometry::is_empty(lhs) && mapnik::geometry::is_empty(rhs))\n            return true; \/\/Empty geometries of the same type are considered to be spatially equal\n        return boost::geometry::equals(lhs, rhs);\n    }\n\n    template <typename T0, typename T1>\n    result_type operator() (T0 const& lhs, T1 const& rhs) const\n    {\n        return false;\n    }\n\n};\n\ntemplate <typename T>\nbool spatially_equal(mapnik::geometry::geometry<T> const& g0, mapnik::geometry::geometry<T> const& g1)\n{\n    return mapnik::util::apply_visitor(spatially_equal_visitor(), g0, g1);\n}\n\n}\n\nTEST_CASE(\"Well-known-geometries\")\n{\n    SECTION(\"wkb\")\n    {\n        std::string filename(\"test\/unit\/data\/well-known-geometries.test\");\n        std::ifstream is(filename.c_str(),std::ios_base::in | std::ios_base::binary);\n        if (!is) throw std::runtime_error(\"could not open: '\" + filename + \"'\");\n\n        for (std::string line; std::getline(is, line,'\\n');)\n        {\n            std::vector<std::string> columns;\n            boost::split(columns, line, boost::is_any_of(\";\"));\n            REQUIRE(columns.size() == 3);\n            std::vector<char> wkb, twkb;\n            REQUIRE(mapnik::util::parse_hex(columns[1], wkb));\n            REQUIRE(mapnik::util::parse_hex(columns[2], twkb));\n            mapnik::geometry::geometry<double> geom_0 = mapnik::geometry_utils::from_wkb(wkb.data(), wkb.size(), mapnik::wkbAuto);\n            mapnik::geometry::geometry<double> geom_1 = mapnik::geometry_utils::from_twkb(twkb.data(), twkb.size());\n            \/\/ compare WKTs\n            std::string wkt0, wkt1;\n            REQUIRE(mapnik::util::to_wkt(wkt0, geom_0));\n            REQUIRE(mapnik::util::to_wkt(wkt1, geom_1));\n            if (!mapnik::geometry::is_empty(geom_0) && !mapnik::geometry::is_empty(geom_1))\n            {\n                REQUIRE(wkt0 == wkt1);\n                \/\/ compare spatially (NOTE: GeometryCollection comparison also enforces strict order)\n#if BOOST_VERSION >= 105800\n                REQUIRE(spatially_equal(geom_0, geom_1));\n#endif\n            }\n        }\n    }\n}\n<commit_msg>Don't compile visitor ref #3380 (thanks @lightmare)<commit_after>#include \"catch.hpp\"\n\/\/ mapnik\n#include <mapnik\/wkb.hpp>\n#include <mapnik\/geometry.hpp>\n#include <mapnik\/geometry_adapters.hpp>\n#include <mapnik\/geometry_is_empty.hpp>\n#include <mapnik\/util\/geometry_to_wkt.hpp>\n\/\/ bool\n#include <boost\/version.hpp>\n#include <boost\/geometry\/algorithms\/equals.hpp>\n#include <boost\/geometry\/policies\/compare.hpp>\n\/\/ stl\n#include \"parse_hex.hpp\"\n#include <iostream>\n#include <string>\n#include <vector>\n#include <fstream>\n\n#if BOOST_VERSION >= 105800\nnamespace  {\n\nstruct spatially_equal_visitor\n{\n    using result_type = bool;\n\n    result_type operator() (mapnik::geometry::geometry_empty, mapnik::geometry::geometry_empty) const\n    {\n        return true;\n    }\n\n    result_type operator() (mapnik::geometry::geometry_collection<double> const& lhs, mapnik::geometry::geometry_collection<double> const& rhs) const\n    {\n        std::size_t size0 = lhs.size();\n        std::size_t size1 = rhs.size();\n        if (size0 != size1) return false;\n        for (std::size_t index = 0; index < size0 ; ++index)\n        {\n            if (!mapnik::util::apply_visitor(*this, lhs[index], rhs[index]))\n                return false;\n        }\n        return true;\n    }\n\n    result_type operator() (mapnik::geometry::multi_point<double> const& lhs, mapnik::geometry::multi_point<double> const& rhs) const\n    {\n        std::size_t size0 = lhs.size();\n        std::size_t size1 = rhs.size();\n        if (size0 != size1) return false;\n        auto tmp0 = lhs;\n        auto tmp1 = rhs;\n        std::sort(tmp0.begin(), tmp0.end(), boost::geometry::less<mapnik::geometry::point<double>>());\n        std::sort(tmp1.begin(), tmp1.end(), boost::geometry::less<mapnik::geometry::point<double>>());\n        for (std::size_t index = 0; index < size0 ; ++index)\n        {\n            if (!boost::geometry::equals(tmp0[index], tmp1[index])) return false;\n        }\n        return true;\n    }\n\n    template <typename T>\n    result_type operator() (T const& lhs, T const& rhs) const\n    {\n        if (mapnik::geometry::is_empty(lhs) && mapnik::geometry::is_empty(rhs))\n            return true; \/\/Empty geometries of the same type are considered to be spatially equal\n        return boost::geometry::equals(lhs, rhs);\n    }\n\n    template <typename T0, typename T1>\n    result_type operator() (T0 const& lhs, T1 const& rhs) const\n    {\n        return false;\n    }\n\n};\n\ntemplate <typename T>\nbool spatially_equal(mapnik::geometry::geometry<T> const& g0, mapnik::geometry::geometry<T> const& g1)\n{\n    return mapnik::util::apply_visitor(spatially_equal_visitor(), g0, g1);\n}\n\n}\n#endif\n\nTEST_CASE(\"Well-known-geometries\")\n{\n    SECTION(\"wkb\")\n    {\n        std::string filename(\"test\/unit\/data\/well-known-geometries.test\");\n        std::ifstream is(filename.c_str(),std::ios_base::in | std::ios_base::binary);\n        if (!is) throw std::runtime_error(\"could not open: '\" + filename + \"'\");\n\n        for (std::string line; std::getline(is, line,'\\n');)\n        {\n            std::vector<std::string> columns;\n            boost::split(columns, line, boost::is_any_of(\";\"));\n            REQUIRE(columns.size() == 3);\n            std::vector<char> wkb, twkb;\n            REQUIRE(mapnik::util::parse_hex(columns[1], wkb));\n            REQUIRE(mapnik::util::parse_hex(columns[2], twkb));\n            mapnik::geometry::geometry<double> geom_0 = mapnik::geometry_utils::from_wkb(wkb.data(), wkb.size(), mapnik::wkbAuto);\n            mapnik::geometry::geometry<double> geom_1 = mapnik::geometry_utils::from_twkb(twkb.data(), twkb.size());\n            \/\/ compare WKTs\n            std::string wkt0, wkt1;\n            REQUIRE(mapnik::util::to_wkt(wkt0, geom_0));\n            REQUIRE(mapnik::util::to_wkt(wkt1, geom_1));\n            if (!mapnik::geometry::is_empty(geom_0) && !mapnik::geometry::is_empty(geom_1))\n            {\n                REQUIRE(wkt0 == wkt1);\n                \/\/ compare spatially (NOTE: GeometryCollection comparison also enforces strict order)\n#if BOOST_VERSION >= 105800\n                REQUIRE(spatially_equal(geom_0, geom_1));\n#endif\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"data-course.hpp\"\nusing namespace std;\n\n\nvoid Course::init(string identifier) {\n\t\/\/ cout << identifier << endl;\n\tcopy(getCourse(identifier));\n}\nvoid Course::copy(const Course& c) {\n\tid = c.id;\n\tnumber = c.number;\n\ttitle = c.title;\n\tdescription = c.description;\n\tsection = c.section;\n\tmajors = c.majors;\n\tdepartment = c.department;\n\tconcentrations = c.concentrations;\n\tconversations = c.conversations;\n\tprofessor = c.professor;\n\n\thalf_semester = c.half_semester;\n\tpass_fail = c.pass_fail;\n\tcredits = c.credits;\n\tlocation = c.location;\n\n\tlab = c.lab;\n\tgeneds = c.geneds;\n\n\tfor (int i = 0; i < 7; ++i){\n\t\tdays[i] = c.days[i];\n\t\ttime[i] = c.time[i];\n\t}\n}\t\n\nCourse::Course() {\n\n}\n\nCourse::Course(string str) {\n\tinit(str);\n}\n\nCourse::Course(const Course& c) {\n\tcopy(c);\n}\n\nCourse& Course::operator = (const Course &c) {\n\tif (this == &c) return *this;\n\tcopy(c);\n\treturn *this;\n}\n\nCourse::Course(istream &is) {\n\t\/\/ cout << \"Now indise Course()\" << endl;\n\tif (!is) return;\n\t\/\/ cout << \"Now inside Course(after return)\" << endl;\n\n\tstring tmpLine;\n\tgetline(is, tmpLine); \/\/ read in so we can do things with it.\n\n\tvector<string> record = split(tmpLine, ',');\n\tfor (vector<string>::iterator i=record.begin(); i != record.end(); ++i) {\n\t\t*i = removeAllQuotes(*i);\n\t\t*i = removeTrailingSlashes(*i);\n\t}\n\n\t\/\/ printEntireRecord(record);\n\n\t\/\/ Ignore the first column;\n\t\/\/ record.at(0);\n\n\t\/\/ so, the *first* column (that we care about) has the course id,\n\tid = record.at(1);\n\tparseID(id);\n\n\t\/\/ Second column has the section,\n\tsection = record.at(2);\n\n\t\/\/ Third holds the lab boolean,\n\tif (record.at(3).empty()) lab = false;\n\telse                      lab = true;\n\n\t\/\/ while Fourth contains the title of the course;\n\ttitle = record.at(4);\n\n\t\/\/ Fifth hands over the length (half semester or not)\n\t\/\/ it's actually an int that tells us how many times the course is offered per semester.\n\thalf_semester = stringToInt(record.at(5));\n\tif (half_semester != 0 && half_semester != 1 && half_semester != 2)\n\t\thalf_semester = 0;\n\n\t\/\/ Sixth tells us the number of credits,\n\tcredits = stringToFloat(record.at(6));\n\n\t\/\/ Seventh shows us if it can be taken pass\/no-pass, \n\tif (record.at(7) == \"Y\")\n\t\tpass_fail = true;\n\telse\n\t\tpass_fail = false;\n\n\t\/\/ while Eighth gives us the GEs of the course,\n\t\/\/ GEreqs = record.at(8);\n\n\t\/\/ and Nine spits out the days and times;\n\t\/\/ Times = record.at(9);\n\n\t\/\/ Ten holds the location,\n\tlocation = record.at(10);\n\tlocation = deDoubleString(location);\n\n\t\/\/ and Eleven knows who teaches.\n\tif (record.size() == 13) {\n\t\tstring profLastName = record.at(11);\n\t\tstring profFirstName = record.at(12);\n\t\tprofFirstName.erase(0, 1); \/\/ remove the extra space from the start of the name\n\t\tprofessor = profFirstName + \" \" + profLastName;\n\t}\n\telse {\n\t\tprofessor = record.at(11);\n\t}\n\n\tupdateID();\n\ttitle = cleanTitle(title);\n\trecord.clear();\n}\n\nstring Course::cleanTitle(string title) {\n\tvector<string> badEndings, badBeginnings;\n\n\tbadEndings.push_back(\" Closed\");\n\tbadEndings.push_back(\" During course submission process\");\n\tbadEndings.push_back(\" Especially for \");\n\tbadEndings.push_back(\" Film screenings\");\n\tbadEndings.push_back(\" First-Year Students may register only\");\n\tbadEndings.push_back(\" New course\");\n\tbadEndings.push_back(\" Not open to first-year students.\");\n\tbadEndings.push_back(\" Open only to \");\n\tbadEndings.push_back(\" Open to \");\n\tbadEndings.push_back(\" Permission of \");\n\tbadEndings.push_back(\" Prereq\");\n\tbadEndings.push_back(\" Registration\");\n\tbadEndings.push_back(\" Taught in English.\");\n\tbadEndings.push_back(\" This course\");\n\tbadEndings.push_back(\" This lab has been canceled.\");\n\tbadEndings.push_back(\" Students in \");\n\n\tbadBeginnings.push_back(\"Top: \");\n\tbadBeginnings.push_back(\"Sem: \");\n\tbadBeginnings.push_back(\"Res: \");\n\n\tfor (vector<string>::iterator i=badEndings.begin(); i != badEndings.end(); ++i)\n\t\ttitle = removeTrailingText(title, *i);\n\tfor (vector<string>::iterator i=badBeginnings.begin(); i != badBeginnings.end(); ++i)\n\t\ttitle = removeStartingText(title, *i);\n\n\treturn title;\n}\n\nstring Course::getProfessor() {\n\treturn professor;\n}\n\nvoid Course::parseID(string str) {\n\t\/\/ Get the number of the course, aka the last three slots.\n\tstringstream(str.substr(str.size() - 3)) >> number;\n\n\t\/\/ Check if it's one of those dastardly \"split courses\".\n\tstring dept = str.substr(0,str.size()-3);\n\n\tif (str.find('\/') != string::npos) {\n\t\tdepartment.push_back(Department(dept.substr(0,2)));\n\t\tdepartment.push_back(Department(dept.substr(3,2)));\n\t}\n\telse {\n\t\tdepartment.push_back(Department(dept));\n\t}\n}\n\nvoid Course::updateID() {\n\tstring dept;\n\tfor (std::vector<Department>::iterator i = department.begin(); i != department.end(); ++i) {\n\t\tdept += i->getName();\n\t\tif (i!=department.end()-1)\n\t\t\tdept += \"\/\";\n\t}\n\tid = dept + \" \" + tostring(number) + section;\n}\n\nstring Course::getID() {\n\treturn id;\n}\n\nostream& Course::getData(ostream &os) {\n\tos << id;\n\tif (lab) os << \" L\";\n\tos << \" - \";\n\tos << title << \" | \";\n\tif (professor.length() > 0 && professor != \" \")\n\t\tos << professor;\n\treturn os;\n}\n\nvoid Course::showAll() {\n\tcout << id << section << endl;\n\tcout << \"Title: \" << title << endl;\n\tcout << \"Professor: \" << professor << endl;\n\tcout << \"Lab? \" << lab << endl;\n\tcout << \"Half-semester? \" << half_semester << endl;\n\tcout << \"Credits: \" << credits << endl;\n\tcout << \"Pass\/Fail? \" << pass_fail << endl;\n\tcout << \"Location: \" << location << endl;\n\tcout << endl;\n}\n\nostream &operator<<(ostream &os, Course &item) { \n\treturn item.getData(os); \n}\n\nvoid Course::display() { \n\tcout << *this << endl; \n}\n\nvoid Course::displayMany() { \n\tcout << id;\n\tif (lab) cout << \" L\";\n\tcout << \"\\t- \";\n\tcout << title << \" | \";\n\tif (professor.length() > 0 && professor != \" \")\n\t\tcout << professor;\n\tcout << endl;\n}\n\nCourse getCourse(string identifier) {\n\t\/\/ Make sure everything is uppercase\n\tstd::transform(identifier.begin(), identifier.end(), identifier.begin(), ::toupper);\n\n\t\/\/ Remove a possible space at the front\n\tif (identifier[0] == ' ')\n\t\tidentifier.erase(0, 1);\n\n\t\/\/ add a space into the course id, if there isn't one already\n\tint shouldBeSpaceIndex = identifier.length()-4;\n\tif (identifier[shouldBeSpaceIndex] != ' ')\n\t\tidentifier.insert(shouldBeSpaceIndex+1, 1, ' ');\n\n\t\/\/ Remove the seciton speficier, if given\n\tif (identifier[identifier.length()-1] < 65)\n\t\tidentifier = identifier.substr(0, identifier.length()-1);\n\n\tfor (vector<Course>::iterator i = all_courses.begin(); i != all_courses.end(); ++i)\n\t\tif (i->getID() == identifier)\n\t\t\treturn *i;\n\n\t\/\/ If no match, return a blanck course.\n\tCourse c;\n\treturn c;\n}\n<commit_msg>Stop appending section to IDs<commit_after>#include \"data-course.hpp\"\nusing namespace std;\n\n\nvoid Course::init(string identifier) {\n\t\/\/ cout << identifier << endl;\n\tcopy(getCourse(identifier));\n}\nvoid Course::copy(const Course& c) {\n\tid = c.id;\n\tnumber = c.number;\n\ttitle = c.title;\n\tdescription = c.description;\n\tsection = c.section;\n\tmajors = c.majors;\n\tdepartment = c.department;\n\tconcentrations = c.concentrations;\n\tconversations = c.conversations;\n\tprofessor = c.professor;\n\n\thalf_semester = c.half_semester;\n\tpass_fail = c.pass_fail;\n\tcredits = c.credits;\n\tlocation = c.location;\n\n\tlab = c.lab;\n\tgeneds = c.geneds;\n\n\tfor (int i = 0; i < 7; ++i){\n\t\tdays[i] = c.days[i];\n\t\ttime[i] = c.time[i];\n\t}\n}\t\n\nCourse::Course() {\n\n}\n\nCourse::Course(string str) {\n\tinit(str);\n}\n\nCourse::Course(const Course& c) {\n\tcopy(c);\n}\n\nCourse& Course::operator = (const Course &c) {\n\tif (this == &c) return *this;\n\tcopy(c);\n\treturn *this;\n}\n\nCourse::Course(istream &is) {\n\t\/\/ cout << \"Now indise Course()\" << endl;\n\tif (!is) return;\n\t\/\/ cout << \"Now inside Course(after return)\" << endl;\n\n\tstring tmpLine;\n\tgetline(is, tmpLine); \/\/ read in so we can do things with it.\n\n\tvector<string> record = split(tmpLine, ',');\n\tfor (vector<string>::iterator i=record.begin(); i != record.end(); ++i) {\n\t\t*i = removeAllQuotes(*i);\n\t\t*i = removeTrailingSlashes(*i);\n\t}\n\n\t\/\/ printEntireRecord(record);\n\n\t\/\/ Ignore the first column;\n\t\/\/ record.at(0);\n\n\t\/\/ so, the *first* column (that we care about) has the course id,\n\tid = record.at(1);\n\tparseID(id);\n\n\t\/\/ Second column has the section,\n\tsection = record.at(2);\n\n\t\/\/ Third holds the lab boolean,\n\tif (record.at(3).empty()) lab = false;\n\telse                      lab = true;\n\n\t\/\/ while Fourth contains the title of the course;\n\ttitle = record.at(4);\n\n\t\/\/ Fifth hands over the length (half semester or not)\n\t\/\/ it's actually an int that tells us how many times the course is offered per semester.\n\thalf_semester = stringToInt(record.at(5));\n\tif (half_semester != 0 && half_semester != 1 && half_semester != 2)\n\t\thalf_semester = 0;\n\n\t\/\/ Sixth tells us the number of credits,\n\tcredits = stringToFloat(record.at(6));\n\n\t\/\/ Seventh shows us if it can be taken pass\/no-pass, \n\tif (record.at(7) == \"Y\")\n\t\tpass_fail = true;\n\telse\n\t\tpass_fail = false;\n\n\t\/\/ while Eighth gives us the GEs of the course,\n\t\/\/ GEreqs = record.at(8);\n\n\t\/\/ and Nine spits out the days and times;\n\t\/\/ Times = record.at(9);\n\n\t\/\/ Ten holds the location,\n\tlocation = record.at(10);\n\tlocation = deDoubleString(location);\n\n\t\/\/ and Eleven knows who teaches.\n\tif (record.size() == 13) {\n\t\tstring profLastName = record.at(11);\n\t\tstring profFirstName = record.at(12);\n\t\tprofFirstName.erase(0, 1); \/\/ remove the extra space from the start of the name\n\t\tprofessor = profFirstName + \" \" + profLastName;\n\t}\n\telse {\n\t\tprofessor = record.at(11);\n\t}\n\n\tupdateID();\n\ttitle = cleanTitle(title);\n\trecord.clear();\n}\n\nstring Course::cleanTitle(string title) {\n\tvector<string> badEndings, badBeginnings;\n\n\tbadEndings.push_back(\" Closed\");\n\tbadEndings.push_back(\" During course submission process\");\n\tbadEndings.push_back(\" Especially for \");\n\tbadEndings.push_back(\" Film screenings\");\n\tbadEndings.push_back(\" First-Year Students may register only\");\n\tbadEndings.push_back(\" New course\");\n\tbadEndings.push_back(\" Not open to first-year students.\");\n\tbadEndings.push_back(\" Open only to \");\n\tbadEndings.push_back(\" Open to \");\n\tbadEndings.push_back(\" Permission of \");\n\tbadEndings.push_back(\" Prereq\");\n\tbadEndings.push_back(\" Registration\");\n\tbadEndings.push_back(\" Taught in English.\");\n\tbadEndings.push_back(\" This course\");\n\tbadEndings.push_back(\" This lab has been canceled.\");\n\tbadEndings.push_back(\" Students in \");\n\n\tbadBeginnings.push_back(\"Top: \");\n\tbadBeginnings.push_back(\"Sem: \");\n\tbadBeginnings.push_back(\"Res: \");\n\n\tfor (vector<string>::iterator i=badEndings.begin(); i != badEndings.end(); ++i)\n\t\ttitle = removeTrailingText(title, *i);\n\tfor (vector<string>::iterator i=badBeginnings.begin(); i != badBeginnings.end(); ++i)\n\t\ttitle = removeStartingText(title, *i);\n\n\treturn title;\n}\n\nstring Course::getProfessor() {\n\treturn professor;\n}\n\nvoid Course::parseID(string str) {\n\t\/\/ Get the number of the course, aka the last three slots.\n\tstringstream(str.substr(str.size() - 3)) >> number;\n\n\t\/\/ Check if it's one of those dastardly \"split courses\".\n\tstring dept = str.substr(0,str.size()-3);\n\n\tif (str.find('\/') != string::npos) {\n\t\tdepartment.push_back(Department(dept.substr(0,2)));\n\t\tdepartment.push_back(Department(dept.substr(3,2)));\n\t}\n\telse {\n\t\tdepartment.push_back(Department(dept));\n\t}\n}\n\nvoid Course::updateID() {\n\tstring dept;\n\tfor (std::vector<Department>::iterator i = department.begin(); i != department.end(); ++i) {\n\t\tdept += i->getName();\n\t\tif (i!=department.end()-1)\n\t\t\tdept += \"\/\";\n\t}\n\tid = dept + \" \" + tostring(number);\n}\n\nstring Course::getID() {\n\treturn id;\n}\n\nostream& Course::getData(ostream &os) {\n\tos << id << section;\n\tif (lab) os << \" L\";\n\tos << \" - \";\n\tos << title << \" | \";\n\tif (professor.length() > 0 && professor != \" \")\n\t\tos << professor;\n\treturn os;\n}\n\nvoid Course::showAll() {\n\tcout << id << section << endl;\n\tcout << \"Title: \" << title << endl;\n\tcout << \"Professor: \" << professor << endl;\n\tcout << \"Lab? \" << lab << endl;\n\tcout << \"Half-semester? \" << half_semester << endl;\n\tcout << \"Credits: \" << credits << endl;\n\tcout << \"Pass\/Fail? \" << pass_fail << endl;\n\tcout << \"Location: \" << location << endl;\n\tcout << endl;\n}\n\nostream &operator<<(ostream &os, Course &item) { \n\treturn item.getData(os); \n}\n\nvoid Course::display() { \n\tcout << *this << endl; \n}\n\nvoid Course::displayMany() { \n\tcout << id;\n\tif (lab) cout << \" L\";\n\tcout << \"\\t- \";\n\tcout << title << \" | \";\n\tif (professor.length() > 0 && professor != \" \")\n\t\tcout << professor;\n\tcout << endl;\n}\n\nCourse getCourse(string identifier) {\n\t\/\/ Make sure everything is uppercase\n\tstd::transform(identifier.begin(), identifier.end(), identifier.begin(), ::toupper);\n\n\t\/\/ Remove a possible space at the front\n\tif (identifier[0] == ' ')\n\t\tidentifier.erase(0, 1);\n\n\t\/\/ add a space into the course id, if there isn't one already\n\tint shouldBeSpaceIndex = identifier.length()-4;\n\tif (identifier[shouldBeSpaceIndex] != ' ')\n\t\tidentifier.insert(shouldBeSpaceIndex+1, 1, ' ');\n\n\t\/\/ Remove the seciton speficier, if given\n\tif (identifier[identifier.length()-1] < 65)\n\t\tidentifier = identifier.substr(0, identifier.length()-1);\n\n\tfor (vector<Course>::iterator i = all_courses.begin(); i != all_courses.end(); ++i)\n\t\tif (i->getID() == identifier)\n\t\t\treturn *i;\n\n\t\/\/ If no match, return a blanck course.\n\tCourse c;\n\treturn c;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define TP_QT4_ENABLE_LOWLEVEL_API\n\n#include <TelepathyQt4\/ChannelFactory>\n#include <TelepathyQt4\/Connection>\n#include <TelepathyQt4\/ConnectionLowlevel>\n#include <TelepathyQt4\/Contact>\n#include <TelepathyQt4\/ContactCapabilities>\n#include <TelepathyQt4\/ContactFactory>\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 TestContactsCapabilities : public Test\n{\n    Q_OBJECT\n\npublic:\n    TestContactsCapabilities(QObject *parent = 0)\n        : Test(parent), mConnService(0)\n    { }\n\nprotected Q_SLOTS:\n    void expectConnInvalidated();\n    void expectPendingContactsFinished(Tp::PendingOperation *);\n\nprivate Q_SLOTS:\n    void initTestCase();\n    void init();\n\n    void testCapabilities();\n\n    void cleanup();\n    void cleanupTestCase();\n\nprivate:\n    QString mConnName, mConnPath;\n    TpTestsContactsConnection *mConnService;\n    ConnectionPtr mConn;\n    QList<ContactPtr> mContacts;\n};\n\nvoid TestContactsCapabilities::expectConnInvalidated()\n{\n    mLoop->exit(0);\n}\n\nvoid TestContactsCapabilities::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 TestContactsCapabilities::initTestCase()\n{\n    initTestCaseImpl();\n\n    g_type_init();\n    g_set_prgname(\"contacts-capabilities\");\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 = TP_TESTS_CONTACTS_CONNECTION(g_object_new(\n            TP_TESTS_TYPE_CONTACTS_CONNECTION,\n            \"account\", \"me@example.com\",\n            \"protocol\", \"foo\",\n            NULL));\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            ChannelFactory::create(QDBusConnection::sessionBus()),\n            ContactFactory::create());\n    QCOMPARE(mConn->isReady(), false);\n\n    QVERIFY(connect(mConn->lowlevel()->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(), ConnectionStatusConnected);\n\n    QVERIFY(mConn->contactManager()->supportedFeatures().contains(Contact::FeatureCapabilities));\n}\n\nvoid TestContactsCapabilities::init()\n{\n    initImpl();\n}\n\nstatic void freeRccList(GPtrArray *rccs)\n{\n    g_boxed_free(TP_ARRAY_TYPE_REQUESTABLE_CHANNEL_CLASS_LIST, rccs);\n}\n\nstatic void addTextChatClass(GPtrArray *classes, TpHandleType handle_type)\n{\n    GHashTable *fixed = tp_asv_new(\n        TP_PROP_CHANNEL_CHANNEL_TYPE, G_TYPE_STRING, TP_IFACE_CHANNEL_TYPE_TEXT,\n        TP_PROP_CHANNEL_TARGET_HANDLE_TYPE, G_TYPE_UINT, handle_type,\n        NULL);\n\n    const gchar * const allowed[] = { NULL };\n    GValueArray *arr = tp_value_array_build(2,\n        TP_HASH_TYPE_STRING_VARIANT_MAP, fixed,\n        G_TYPE_STRV, allowed,\n        G_TYPE_INVALID);\n\n    g_hash_table_unref(fixed);\n\n    g_ptr_array_add(classes, arr);\n}\n\nstatic GHashTable *createContactCapabilities(TpHandle *handles)\n{\n    GHashTable *capabilities = g_hash_table_new_full(NULL, NULL, NULL,\n        (GDestroyNotify) freeRccList);\n\n    \/* Support private text chats *\/\n    GPtrArray *caps1 = g_ptr_array_sized_new(2);\n    addTextChatClass(caps1, TP_HANDLE_TYPE_CONTACT);\n    g_hash_table_insert(capabilities, GUINT_TO_POINTER(handles[0]), caps1);\n\n    \/* Support text chatrooms *\/\n    GPtrArray *caps2 = g_ptr_array_sized_new(1);\n    g_hash_table_insert(capabilities, GUINT_TO_POINTER(handles[1]), caps2);\n\n    \/* Don't support anything *\/\n    GPtrArray *caps3 = g_ptr_array_sized_new(0);\n    g_hash_table_insert(capabilities, GUINT_TO_POINTER(handles[2]), caps3);\n\n    return capabilities;\n}\n\nvoid TestContactsCapabilities::testCapabilities()\n{\n    QStringList ids = QStringList() << QLatin1String(\"alice\")\n        << QLatin1String(\"bob\") << QLatin1String(\"chris\");\n\n    gboolean supportTextChat[] = { TRUE, FALSE, FALSE };\n\n    TpHandleRepoIface *serviceRepo =\n        tp_base_connection_get_handles(TP_BASE_CONNECTION(mConnService),\n                TP_HANDLE_TYPE_CONTACT);\n    TpHandle handles[] = { 0, 0, 0 };\n    for (int i = 0; i < 3; i++) {\n        handles[i] = tp_handle_ensure(serviceRepo, ids[i].toLatin1().constData(),\n                NULL, NULL);\n    }\n\n    GHashTable *capabilities = createContactCapabilities(handles);\n    tp_tests_contacts_connection_change_capabilities(mConnService, capabilities);\n\n    PendingContacts *pending = mConn->contactManager()->contactsForIdentifiers(\n            ids, Features() << Contact::FeatureCapabilities);\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().contains(Contact::FeatureCapabilities), true);\n        QCOMPARE(contact->actualFeatures().contains(Contact::FeatureCapabilities), true);\n\n        QCOMPARE(contact->capabilities().textChats(), supportTextChat[i]);\n        QCOMPARE(contact->capabilities().streamedMediaCalls(), false);\n        QCOMPARE(contact->capabilities().streamedMediaAudioCalls(), false);\n        QCOMPARE(contact->capabilities().streamedMediaVideoCalls(), false);\n        QCOMPARE(contact->capabilities().streamedMediaVideoCallsWithAudio(), false);\n        QCOMPARE(contact->capabilities().upgradingStreamedMediaCalls(), false);\n    }\n}\n\nvoid TestContactsCapabilities::cleanup()\n{\n    cleanupImpl();\n}\n\nvoid TestContactsCapabilities::cleanupTestCase()\n{\n    if (mConn) {\n        \/\/ Disconnect and wait for invalidated\n        QVERIFY(connect(mConn->lowlevel()->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(TestContactsCapabilities)\n#include \"_gen\/contacts-capabilities.cpp.moc.hpp\"\n<commit_msg>Don't leak caps hash table in TestContactsCapabilities<commit_after>#define TP_QT4_ENABLE_LOWLEVEL_API\n\n#include <TelepathyQt4\/ChannelFactory>\n#include <TelepathyQt4\/Connection>\n#include <TelepathyQt4\/ConnectionLowlevel>\n#include <TelepathyQt4\/Contact>\n#include <TelepathyQt4\/ContactCapabilities>\n#include <TelepathyQt4\/ContactFactory>\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 TestContactsCapabilities : public Test\n{\n    Q_OBJECT\n\npublic:\n    TestContactsCapabilities(QObject *parent = 0)\n        : Test(parent), mConnService(0)\n    { }\n\nprotected Q_SLOTS:\n    void expectConnInvalidated();\n    void expectPendingContactsFinished(Tp::PendingOperation *);\n\nprivate Q_SLOTS:\n    void initTestCase();\n    void init();\n\n    void testCapabilities();\n\n    void cleanup();\n    void cleanupTestCase();\n\nprivate:\n    QString mConnName, mConnPath;\n    TpTestsContactsConnection *mConnService;\n    ConnectionPtr mConn;\n    QList<ContactPtr> mContacts;\n};\n\nvoid TestContactsCapabilities::expectConnInvalidated()\n{\n    mLoop->exit(0);\n}\n\nvoid TestContactsCapabilities::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 TestContactsCapabilities::initTestCase()\n{\n    initTestCaseImpl();\n\n    g_type_init();\n    g_set_prgname(\"contacts-capabilities\");\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 = TP_TESTS_CONTACTS_CONNECTION(g_object_new(\n            TP_TESTS_TYPE_CONTACTS_CONNECTION,\n            \"account\", \"me@example.com\",\n            \"protocol\", \"foo\",\n            NULL));\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            ChannelFactory::create(QDBusConnection::sessionBus()),\n            ContactFactory::create());\n    QCOMPARE(mConn->isReady(), false);\n\n    QVERIFY(connect(mConn->lowlevel()->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(), ConnectionStatusConnected);\n\n    QVERIFY(mConn->contactManager()->supportedFeatures().contains(Contact::FeatureCapabilities));\n}\n\nvoid TestContactsCapabilities::init()\n{\n    initImpl();\n}\n\nstatic void freeRccList(GPtrArray *rccs)\n{\n    g_boxed_free(TP_ARRAY_TYPE_REQUESTABLE_CHANNEL_CLASS_LIST, rccs);\n}\n\nstatic void addTextChatClass(GPtrArray *classes, TpHandleType handle_type)\n{\n    GHashTable *fixed = tp_asv_new(\n        TP_PROP_CHANNEL_CHANNEL_TYPE, G_TYPE_STRING, TP_IFACE_CHANNEL_TYPE_TEXT,\n        TP_PROP_CHANNEL_TARGET_HANDLE_TYPE, G_TYPE_UINT, handle_type,\n        NULL);\n\n    const gchar * const allowed[] = { NULL };\n    GValueArray *arr = tp_value_array_build(2,\n        TP_HASH_TYPE_STRING_VARIANT_MAP, fixed,\n        G_TYPE_STRV, allowed,\n        G_TYPE_INVALID);\n\n    g_hash_table_unref(fixed);\n\n    g_ptr_array_add(classes, arr);\n}\n\nstatic GHashTable *createContactCapabilities(TpHandle *handles)\n{\n    GHashTable *capabilities = g_hash_table_new_full(NULL, NULL, NULL,\n        (GDestroyNotify) freeRccList);\n\n    \/* Support private text chats *\/\n    GPtrArray *caps1 = g_ptr_array_sized_new(2);\n    addTextChatClass(caps1, TP_HANDLE_TYPE_CONTACT);\n    g_hash_table_insert(capabilities, GUINT_TO_POINTER(handles[0]), caps1);\n\n    \/* Support text chatrooms *\/\n    GPtrArray *caps2 = g_ptr_array_sized_new(1);\n    g_hash_table_insert(capabilities, GUINT_TO_POINTER(handles[1]), caps2);\n\n    \/* Don't support anything *\/\n    GPtrArray *caps3 = g_ptr_array_sized_new(0);\n    g_hash_table_insert(capabilities, GUINT_TO_POINTER(handles[2]), caps3);\n\n    return capabilities;\n}\n\nvoid TestContactsCapabilities::testCapabilities()\n{\n    QStringList ids = QStringList() << QLatin1String(\"alice\")\n        << QLatin1String(\"bob\") << QLatin1String(\"chris\");\n\n    gboolean supportTextChat[] = { TRUE, FALSE, FALSE };\n\n    TpHandleRepoIface *serviceRepo =\n        tp_base_connection_get_handles(TP_BASE_CONNECTION(mConnService),\n                TP_HANDLE_TYPE_CONTACT);\n    TpHandle handles[] = { 0, 0, 0 };\n    for (int i = 0; i < 3; i++) {\n        handles[i] = tp_handle_ensure(serviceRepo, ids[i].toLatin1().constData(),\n                NULL, NULL);\n    }\n\n    GHashTable *capabilities = createContactCapabilities(handles);\n    tp_tests_contacts_connection_change_capabilities(mConnService, capabilities);\n    g_hash_table_destroy(capabilities);\n\n    PendingContacts *pending = mConn->contactManager()->contactsForIdentifiers(\n            ids, Features() << Contact::FeatureCapabilities);\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().contains(Contact::FeatureCapabilities), true);\n        QCOMPARE(contact->actualFeatures().contains(Contact::FeatureCapabilities), true);\n\n        QCOMPARE(contact->capabilities().textChats(), supportTextChat[i]);\n        QCOMPARE(contact->capabilities().streamedMediaCalls(), false);\n        QCOMPARE(contact->capabilities().streamedMediaAudioCalls(), false);\n        QCOMPARE(contact->capabilities().streamedMediaVideoCalls(), false);\n        QCOMPARE(contact->capabilities().streamedMediaVideoCallsWithAudio(), false);\n        QCOMPARE(contact->capabilities().upgradingStreamedMediaCalls(), false);\n    }\n}\n\nvoid TestContactsCapabilities::cleanup()\n{\n    cleanupImpl();\n}\n\nvoid TestContactsCapabilities::cleanupTestCase()\n{\n    if (mConn) {\n        \/\/ Disconnect and wait for invalidated\n        QVERIFY(connect(mConn->lowlevel()->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(TestContactsCapabilities)\n#include \"_gen\/contacts-capabilities.cpp.moc.hpp\"\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************************************************************\n * Copyright (C) 2016 Andrew Zonenberg and contributors                                                                *\n *                                                                                                                     *\n * This program is free software; you can redistribute it and\/or modify it under the terms of the GNU Lesser General   *\n * Public License as published by the Free Software Foundation; either version 2.1 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 ANY WARRANTY; without even the implied  *\n * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for     *\n * more details.                                                                                                       *\n *                                                                                                                     *\n * You should have received a copy of the GNU Lesser General Public License along with this program; if not, you may   *\n * find one here:                                                                                                      *\n * https:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.txt                                                              *\n * or you may search the http:\/\/www.gnu.org website for the version 2.1 license, or you may write to the Free Software *\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA                                      *\n **********************************************************************************************************************\/\n\n#include <log.h>\n#include <gpdevboard.h>\n#include <unistd.h>\n#include <math.h>\n\nusing namespace std;\n\nbool RunTest(hdevice hdev);\n\nint main(int argc, char* argv[])\n{\n\tg_log_sinks.emplace(g_log_sinks.begin(), new STDLogSink(Severity::VERBOSE));\n\n\t\/\/expect one arg: the bitstream\n\tif(argc != 2)\n\t{\n\t\tLogNotice(\"Usage: [testcase] bitstream.txt\\n\");\n\t\treturn 1;\n\t}\n\n\t\/\/Set up the test\n\thdevice hdev = MultiBoardTestSetup(argv[1], 25000, 3.3, SilegoPart::SLG46620V);\n\tif(!hdev)\n\t{\n\t\tLogError(\"Failed to open board\\n\");\n\t\treturn 1;\n\t}\n\n\t\/\/Run the actual test case\n\tLogNotice(\"\\n\");\n\tLogNotice(\"Running application test case\\n\");\n\tif(!RunTest(hdev))\n\t{\n\t\tSetStatusLED(hdev, 0);\n\t\tReset(hdev);\n\t\treturn 1;\n\t}\n\n\t\/\/Turn off the LED before declaring success\n\tLogVerbose(\"\\n\");\n\tLogVerbose(\"Test complete, resetting board\\n\");\n\tSetStatusLED(hdev, 0);\n\tResetAllSiggens(hdev);\n\tReset(hdev);\n\tUSBCleanup(hdev);\n\treturn 0;\n}\n\n\/**\n\t@brief The actual application-layer test\n *\/\nbool RunTest(hdevice hdev)\n{\n\tLogIndenter li;\n\n\t\/\/Set up the I\/O config we need for this test\n\tIOConfig ioConfig;\n\tfor(size_t i = 2; i <= 20; i++)\n\t\tioConfig.driverConfigs[i] = TP_RESET;\n\tif(!SetIOConfig(hdev, ioConfig))\n\t\treturn false;\n\n\tdouble tolerance_trip = 0.05;\n\tdouble tolerance_vref = 0.15;\n\n\t\/\/Check the bandgap outputs\n\tLogVerbose(\"Testing bandgap status\\n\");\n\tdouble v;\n\tif(!SingleReadADC(hdev, 20, v))\n\t\treturn false;\n\tif(v < 0.5)\n\t{\n\t\tLogError(\"Bandgap status should be high\\n\");\n\t\treturn false;\n\t}\n\n\t\/\/Check the Vref outputs\n\t\/\/TODO: Why is the error so wide here?\n\tLogVerbose(\"Checking ref outputs\\n\");\n\t{\n\t\tLogIndenter li;\n\n\t\tif(!SingleReadADC(hdev, 19, v))\n\t\t\treturn false;\n\t\tdouble err = 0.8 - v;\n\t\tLogVerbose(\"Vref_800 = %.3f V (err = %.3f)\\n\", v, err);\n\t\tif(fabs(err) > tolerance_vref)\n\t\t{\n\t\t\tLogError(\"Error is too big\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tif(!SingleReadADC(hdev, 18, v))\n\t\t\treturn false;\n\t\terr = 0.6 - v;\n\t\tLogVerbose(\"Vref_600 = %.3f V (err = %.3f)\\n\", v, err);\n\t\tif(fabs(err) > tolerance_vref)\n\t\t{\n\t\t\tLogError(\"Error is too big\\n\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/\/(pin num, threshold in mV)\n\tconst int acmps[6][2] =\n\t{\n\t\t{12, 200},\n\t\t{13, 400},\n\t\t{14, 600},\n\t\t{15, 800},\n\t\t{16, 1000},\n\t\t{17, 1000}\n\t};\n\n\t\/\/Sweep input and verify output\n\tLogVerbose(\"Running comparator voltage sweep\\n\");\n\tdouble step = 0.025;\n\tbool pin_states[5] = {false};\n\tfor(double vtest = step; vtest < 1.1; vtest += step)\n\t{\n\t\tLogIndenter li;\n\n\t\t\/\/Set up a signal generator on the inputs\n\t\t\/\/TODO: check 6 and 4 independently?\n\t\tif(!ConfigureSiggen(hdev, 6, vtest))\n\t\t\treturn false;\n\t\tif(!ConfigureSiggen(hdev, 4, vtest))\n\t\t\treturn false;\n\n\t\t\/\/Read the outputs\n\t\tfor(int i=0; i<6; i++)\n\t\t{\n\t\t\tdouble v;\n\t\t\tint npin = acmps[i][0];\n\t\t\tif(!SingleReadADC(hdev, npin, v))\n\t\t\t\treturn false;\n\n\t\t\tbool b = (v > 0.5);\n\n\t\t\t\/\/If we went LOW, something is wrong. We should never turn off on a rising edge\n\t\t\tif(pin_states[i] && !b)\n\t\t\t{\n\t\t\t\tLogError(\"Pin %d went low at %.3f V on a rising input waveform - something is wrong\\n\",\n\t\t\t\t\tnpin, vtest);\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/If we went HIGH, log the trip point and check if it's sane\n\t\t\tif(!pin_states[i] && b)\n\t\t\t{\n\t\t\t\tdouble expected_trip = acmps[i][1] * 0.001f;\n\t\t\t\tdouble delta = vtest - expected_trip;\n\n\t\t\t\tLogVerbose(\"Pin %d went high at %.3f V (err = %.3f V)\\n\", npin, vtest, delta);\n\n\t\t\t\tif(fabs(delta) > tolerance_trip)\n\t\t\t\t{\n\t\t\t\t\tLogError(\"Error is too big\\n\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/Save pin state\n\t\t\tpin_states[i] = b;\n\t\t}\n\n\t\t\/*\n\t\t\/\/Read the input\n\t\tif(!SelectADCChannel(hdev, INPUT_PIN))\n\t\t\treturn false;\n\t\tdouble vin;\n\t\tif(!ReadADC(hdev, vin))\n\t\t\treturn false;\n\n\t\t\/\/Read the output\n\t\tif(!SelectADCChannel(hdev, OUTPUT_PIN))\n\t\t\treturn false;\n\t\tdouble vout;\n\t\tif(!ReadADC(hdev, vout))\n\t\t\treturn false;\n\n\t\tdouble expected = vin * 2;\n\t\tdouble error = expected - vout;\n\t\tdouble pctError = (error * 100) \/ expected;\n\n\t\tLogVerbose(\"|%10.3f|%10.3f|%10.3f|%10.3f|%10.3f|%10.3f|\\n\", vtest, vin, vout, expected, error, pctError);\n\n\t\t\/\/TODO: Decide on an appropriate tolerance\n\t\tif(pctError > 5)\n\t\t{\n\t\t\tLogError(\"Percent error is too big, test failed\\n\");\n\t\t\treturn false;\n\t\t}*\/\n\t}\n\n\treturn true;\n}\n<commit_msg>tests: fixed out of bounds array access<commit_after>\/***********************************************************************************************************************\n * Copyright (C) 2016 Andrew Zonenberg and contributors                                                                *\n *                                                                                                                     *\n * This program is free software; you can redistribute it and\/or modify it under the terms of the GNU Lesser General   *\n * Public License as published by the Free Software Foundation; either version 2.1 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 ANY WARRANTY; without even the implied  *\n * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for     *\n * more details.                                                                                                       *\n *                                                                                                                     *\n * You should have received a copy of the GNU Lesser General Public License along with this program; if not, you may   *\n * find one here:                                                                                                      *\n * https:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.txt                                                              *\n * or you may search the http:\/\/www.gnu.org website for the version 2.1 license, or you may write to the Free Software *\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA                                      *\n **********************************************************************************************************************\/\n\n#include <log.h>\n#include <gpdevboard.h>\n#include <unistd.h>\n#include <math.h>\n\nusing namespace std;\n\nbool RunTest(hdevice hdev);\n\nint main(int argc, char* argv[])\n{\n\tg_log_sinks.emplace(g_log_sinks.begin(), new STDLogSink(Severity::VERBOSE));\n\n\t\/\/expect one arg: the bitstream\n\tif(argc != 2)\n\t{\n\t\tLogNotice(\"Usage: [testcase] bitstream.txt\\n\");\n\t\treturn 1;\n\t}\n\n\t\/\/Set up the test\n\thdevice hdev = MultiBoardTestSetup(argv[1], 25000, 3.3, SilegoPart::SLG46620V);\n\tif(!hdev)\n\t{\n\t\tLogError(\"Failed to open board\\n\");\n\t\treturn 1;\n\t}\n\n\t\/\/Run the actual test case\n\tLogNotice(\"\\n\");\n\tLogNotice(\"Running application test case\\n\");\n\tif(!RunTest(hdev))\n\t{\n\t\tSetStatusLED(hdev, 0);\n\t\tReset(hdev);\n\t\treturn 1;\n\t}\n\n\t\/\/Turn off the LED before declaring success\n\tLogVerbose(\"\\n\");\n\tLogVerbose(\"Test complete, resetting board\\n\");\n\tSetStatusLED(hdev, 0);\n\tResetAllSiggens(hdev);\n\tReset(hdev);\n\tUSBCleanup(hdev);\n\treturn 0;\n}\n\n\/**\n\t@brief The actual application-layer test\n *\/\nbool RunTest(hdevice hdev)\n{\n\tLogIndenter li;\n\n\t\/\/Set up the I\/O config we need for this test\n\tIOConfig ioConfig;\n\tfor(size_t i = 2; i <= 20; i++)\n\t\tioConfig.driverConfigs[i] = TP_RESET;\n\tif(!SetIOConfig(hdev, ioConfig))\n\t\treturn false;\n\n\tdouble tolerance_trip = 0.05;\n\tdouble tolerance_vref = 0.15;\n\n\t\/\/Check the bandgap outputs\n\tLogVerbose(\"Testing bandgap status\\n\");\n\tdouble v;\n\tif(!SingleReadADC(hdev, 20, v))\n\t\treturn false;\n\tif(v < 0.5)\n\t{\n\t\tLogError(\"Bandgap status should be high\\n\");\n\t\treturn false;\n\t}\n\n\t\/\/Check the Vref outputs\n\t\/\/TODO: Why is the error so wide here?\n\tLogVerbose(\"Checking ref outputs\\n\");\n\t{\n\t\tLogIndenter li;\n\n\t\tif(!SingleReadADC(hdev, 19, v))\n\t\t\treturn false;\n\t\tdouble err = 0.8 - v;\n\t\tLogVerbose(\"Vref_800 = %.3f V (err = %.3f)\\n\", v, err);\n\t\tif(fabs(err) > tolerance_vref)\n\t\t{\n\t\t\tLogError(\"Error is too big\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tif(!SingleReadADC(hdev, 18, v))\n\t\t\treturn false;\n\t\terr = 0.6 - v;\n\t\tLogVerbose(\"Vref_600 = %.3f V (err = %.3f)\\n\", v, err);\n\t\tif(fabs(err) > tolerance_vref)\n\t\t{\n\t\t\tLogError(\"Error is too big\\n\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/\/(pin num, threshold in mV)\n\tconst int acmps[6][2] =\n\t{\n\t\t{12, 200},\n\t\t{13, 400},\n\t\t{14, 600},\n\t\t{15, 800},\n\t\t{16, 1000},\n\t\t{17, 1000}\n\t};\n\n\t\/\/Sweep input and verify output\n\tLogVerbose(\"Running comparator voltage sweep\\n\");\n\tdouble step = 0.025;\n\tbool pin_states[6] = {false};\n\tfor(double vtest = step; vtest < 1.1; vtest += step)\n\t{\n\t\tLogIndenter li;\n\n\t\t\/\/Set up a signal generator on the inputs\n\t\t\/\/TODO: check 6 and 4 independently?\n\t\tif(!ConfigureSiggen(hdev, 6, vtest))\n\t\t\treturn false;\n\t\tif(!ConfigureSiggen(hdev, 4, vtest))\n\t\t\treturn false;\n\n\t\t\/\/Read the outputs\n\t\tfor(int i=0; i<6; i++)\n\t\t{\n\t\t\tdouble v;\n\t\t\tint npin = acmps[i][0];\n\t\t\tif(!SingleReadADC(hdev, npin, v))\n\t\t\t\treturn false;\n\n\t\t\tbool b = (v > 0.5);\n\n\t\t\t\/\/If we went LOW, something is wrong. We should never turn off on a rising edge\n\t\t\tif(pin_states[i] && !b)\n\t\t\t{\n\t\t\t\tLogError(\"Pin %d went low at %.3f V on a rising input waveform - something is wrong\\n\",\n\t\t\t\t\tnpin, vtest);\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/If we went HIGH, log the trip point and check if it's sane\n\t\t\tif(!pin_states[i] && b)\n\t\t\t{\n\t\t\t\tdouble expected_trip = acmps[i][1] * 0.001f;\n\t\t\t\tdouble delta = vtest - expected_trip;\n\n\t\t\t\tLogVerbose(\"Pin %d went high at %.3f V (err = %.3f V)\\n\", npin, vtest, delta);\n\n\t\t\t\tif(fabs(delta) > tolerance_trip)\n\t\t\t\t{\n\t\t\t\t\tLogError(\"Error is too big\\n\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/Save pin state\n\t\t\tpin_states[i] = b;\n\t\t}\n\n\t\t\/*\n\t\t\/\/Read the input\n\t\tif(!SelectADCChannel(hdev, INPUT_PIN))\n\t\t\treturn false;\n\t\tdouble vin;\n\t\tif(!ReadADC(hdev, vin))\n\t\t\treturn false;\n\n\t\t\/\/Read the output\n\t\tif(!SelectADCChannel(hdev, OUTPUT_PIN))\n\t\t\treturn false;\n\t\tdouble vout;\n\t\tif(!ReadADC(hdev, vout))\n\t\t\treturn false;\n\n\t\tdouble expected = vin * 2;\n\t\tdouble error = expected - vout;\n\t\tdouble pctError = (error * 100) \/ expected;\n\n\t\tLogVerbose(\"|%10.3f|%10.3f|%10.3f|%10.3f|%10.3f|%10.3f|\\n\", vtest, vin, vout, expected, error, pctError);\n\n\t\t\/\/TODO: Decide on an appropriate tolerance\n\t\tif(pctError > 5)\n\t\t{\n\t\t\tLogError(\"Percent error is too big, test failed\\n\");\n\t\t\treturn false;\n\t\t}*\/\n\t}\n\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/! \\file\n\/*\n**  Copyright (C) - Triton\n**\n**  This program is under the terms of the BSD License.\n*\/\n\n#include <new>\n\n#include <triton\/exceptions.hpp>\n#include <triton\/irBuilder.hpp>\n#include <triton\/memoryAccess.hpp>\n#include <triton\/operandWrapper.hpp>\n#include <triton\/register.hpp>\n#include <triton\/x86Semantics.hpp>\n#include <triton\/astContext.hpp>\n\n\n\nnamespace triton {\n  namespace arch {\n\n    IrBuilder::IrBuilder(triton::arch::Architecture* architecture,\n                         const triton::modes::Modes& modes,\n                         triton::ast::AstContext& astCtxt,\n                         triton::engines::symbolic::SymbolicEngine* symbolicEngine,\n                         triton::engines::taint::TaintEngine* taintEngine)\n      : modes(modes),\n        astGarbageCollector(astCtxt.getAstGarbageCollector()),\n        backupAstGarbageCollector(modes, true) {\n\n      if (architecture == nullptr)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::IrBuilder(): The architecture API must be defined.\");\n\n      if (symbolicEngine == nullptr)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::IrBuilder(): The symbolic engine API must be defined.\");\n\n      if (taintEngine == nullptr)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::IrBuilder(): The taint engines API must be defined.\");\n\n      this->architecture              = architecture;\n      this->backupSymbolicEngine      = new(std::nothrow) triton::engines::symbolic::SymbolicEngine(architecture, modes, astCtxt, nullptr, true);\n      this->symbolicEngine            = symbolicEngine;\n      this->taintEngine               = taintEngine;\n      this->x86Isa                    = new(std::nothrow) triton::arch::x86::x86Semantics(architecture, symbolicEngine, taintEngine, astCtxt);\n\n      if (this->x86Isa == nullptr || this->backupSymbolicEngine == nullptr)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::IrBuilder(): Not enough memory.\");\n    }\n\n\n    IrBuilder::~IrBuilder() {\n      delete this->backupSymbolicEngine;\n      delete this->x86Isa;\n    }\n\n\n    bool IrBuilder::buildSemantics(triton::arch::Instruction& inst) {\n      bool ret = false;\n\n      if (this->architecture->getArchitecture() == triton::arch::ARCH_INVALID)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::buildSemantics(): You must define an architecture.\");\n\n      \/* Stage 1 - Update the context memory *\/\n      std::list<triton::arch::MemoryAccess>::iterator it1;\n      for (it1 = inst.memoryAccess.begin(); it1 != inst.memoryAccess.end(); it1++) {\n        this->architecture->setConcreteMemoryValue(*it1);\n      }\n\n      \/* Stage 2 - Update the context register *\/\n      std::map<triton::uint32, triton::arch::Register>::iterator it2;\n      for (it2 = inst.registerState.begin(); it2 != inst.registerState.end(); it2++) {\n        this->architecture->setConcreteRegisterValue(it2->second);\n      }\n\n      \/* Stage 3 - Initialize the target address of memory operands *\/\n      std::vector<triton::arch::OperandWrapper>::iterator it3;\n      for (it3 = inst.operands.begin(); it3 != inst.operands.end(); it3++) {\n        if (it3->getType() == triton::arch::OP_MEM) {\n          this->symbolicEngine->initLeaAst(it3->getMemory());\n        }\n      }\n\n      \/* Pre IR processing *\/\n      this->preIrInit(inst);\n\n      \/* Processing *\/\n      switch (this->architecture->getArchitecture()) {\n        case triton::arch::ARCH_X86:\n        case triton::arch::ARCH_X86_64:\n          ret = this->x86Isa->buildSemantics(inst);\n      }\n\n      \/* Post IR processing *\/\n      this->postIrInit(inst);\n\n      return ret;\n    }\n\n\n    void IrBuilder::preIrInit(triton::arch::Instruction& inst) {\n      \/* Clear previous expressions if exist *\/\n      inst.symbolicExpressions.clear();\n\n      \/* Clear implicit and explicit semantics *\/\n      inst.getLoadAccess().clear();\n      inst.getReadRegisters().clear();\n      inst.getReadImmediates().clear();\n      inst.getStoreAccess().clear();\n      inst.getWrittenRegisters().clear();\n\n      \/* Update instruction address if undefined *\/\n      if (!inst.getAddress())\n        inst.setAddress(this->architecture->getConcreteRegisterValue(this->architecture->getParentRegister(ID_REG_IP)).convert_to<triton::uint64>());\n\n      \/* Backup the symbolic engine in the case where only the taint is available. *\/\n      if (!this->symbolicEngine->isEnabled()) {\n        *this->backupSymbolicEngine = *this->symbolicEngine;\n        this->backupAstGarbageCollector = this->astGarbageCollector;\n      }\n    }\n\n\n    void IrBuilder::postIrInit(triton::arch::Instruction& inst) {\n      std::set<triton::ast::AbstractNode*> uniqueNodes;\n      std::vector<triton::engines::symbolic::SymbolicExpression*> newVector;\n\n      auto& loadAccess        = inst.getLoadAccess();\n      auto& readRegisters     = inst.getReadRegisters();\n      auto& readImmediates    = inst.getReadImmediates();\n      auto& storeAccess       = inst.getStoreAccess();\n      auto& writtenRegisters  = inst.getWrittenRegisters();\n\n      \/* Clear unused data *\/\n      inst.memoryAccess.clear();\n      inst.registerState.clear();\n\n      \/* Set the taint *\/\n      inst.setTaint();\n\n      \/\/ ----------------------------------------------------------------------\n\n      \/*\n       * If the symbolic engine is disable we delete symbolic\n       * expressions and AST nodes. Note that if the taint engine\n       * is enable we must compute semanitcs to spread the taint.\n       *\/\n      if (!this->symbolicEngine->isEnabled()) {\n        \/* Clear memory operands *\/\n        this->collectNodes(uniqueNodes, inst.operands, false);\n\n        \/* Clear implicit and explicit semantics *\/\n        loadAccess.clear();\n        readRegisters.clear();\n        readImmediates.clear();\n        storeAccess.clear();\n        writtenRegisters.clear();\n\n        \/* Symbolic Expressions *\/\n        this->removeSymbolicExpressions(inst, uniqueNodes);\n\n        \/* Restore backup *\/\n        *this->symbolicEngine = *this->backupSymbolicEngine;\n      }\n\n      \/\/ ----------------------------------------------------------------------\n\n      \/*\n       * If the symbolic engine is defined to process symbolic\n       * execution only on symbolized expressions, we delete all\n       * concrete expressions and their AST nodes.\n       *\/\n      if (this->symbolicEngine->isEnabled() && this->modes.isModeEnabled(triton::modes::ONLY_ON_SYMBOLIZED)) {\n        \/* Clear memory operands *\/\n        this->collectUnsymbolizedNodes(uniqueNodes, inst.operands);\n\n        \/* Clear implicit and explicit semantics - MEM *\/\n        this->collectUnsymbolizedNodes(loadAccess);\n\n        \/* Clear implicit and explicit semantics - REG *\/\n        this->collectUnsymbolizedNodes(readRegisters);\n\n        \/* Clear implicit and explicit semantics - IMM *\/\n        this->collectUnsymbolizedNodes(readImmediates);\n\n        \/* Clear implicit and explicit semantics - MEM *\/\n        this->collectUnsymbolizedNodes(storeAccess);\n\n        \/* Clear implicit and explicit semantics - REG *\/\n        this->collectUnsymbolizedNodes(writtenRegisters);\n\n        \/* Clear symbolic expressions *\/\n        for (auto it = inst.symbolicExpressions.cbegin(); it != inst.symbolicExpressions.cend(); it++) {\n          if ((*it)->isSymbolized() == false) {\n            this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, (*it)->getAst());\n            this->symbolicEngine->removeSymbolicExpression((*it)->getId());\n          }\n          else\n            newVector.push_back(*it);\n        }\n        inst.symbolicExpressions = newVector;\n      }\n\n      \/\/ ----------------------------------------------------------------------\n\n      \/*\n       * If the symbolic engine is defined to process symbolic\n       * execution only on tainted instructions, we delete all\n       * expressions untainted and their AST nodes.\n       *\/\n      else if (this->modes.isModeEnabled(triton::modes::ONLY_ON_TAINTED) && !inst.isTainted()) {\n        \/* Memory operands *\/\n        this->collectNodes(uniqueNodes, inst.operands, true);\n\n        \/* Implicit and explicit semantics - MEM *\/\n        this->collectNodes(uniqueNodes, loadAccess);\n\n        \/* Implicit and explicit semantics - REG *\/\n        this->collectNodes(uniqueNodes, readRegisters);\n\n        \/* Implicit and explicit semantics - IMM *\/\n        this->collectNodes(uniqueNodes, readImmediates);\n\n        \/* Implicit and explicit semantics - MEM *\/\n        this->collectNodes(uniqueNodes, storeAccess);\n\n        \/* Implicit and explicit semantics - REG *\/\n        this->collectNodes(uniqueNodes, writtenRegisters);\n\n        \/* Symbolic Expressions *\/\n        this->removeSymbolicExpressions(inst, uniqueNodes);\n      }\n\n      \/\/ ----------------------------------------------------------------------\n\n      \/* Free collected nodes *\/\n      this->astGarbageCollector.freeAstNodes(uniqueNodes);\n\n      if (!this->symbolicEngine->isEnabled())\n        this->astGarbageCollector = this->backupAstGarbageCollector;\n    }\n\n\n    void IrBuilder::removeSymbolicExpressions(triton::arch::Instruction& inst, std::set<triton::ast::AbstractNode*>& uniqueNodes) {\n      for (auto it = inst.symbolicExpressions.cbegin(); it != inst.symbolicExpressions.cend(); it++) {\n        this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, (*it)->getAst());\n        this->symbolicEngine->removeSymbolicExpression((*it)->getId());\n      }\n      inst.symbolicExpressions.clear();\n    }\n\n\n    template <typename T>\n    void IrBuilder::collectNodes(std::set<triton::ast::AbstractNode*>& uniqueNodes, T& items) const {\n      for (auto it = items.cbegin(); it != items.cend(); it++)\n        this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, std::get<1>(*it));\n      items.clear();\n    }\n\n\n    void IrBuilder::collectNodes(std::set<triton::ast::AbstractNode*>& uniqueNodes, std::vector<triton::arch::OperandWrapper>& operands, bool gc) const {\n      for (auto it = operands.begin(); it != operands.end(); it++) {\n        if (it->getType() == triton::arch::OP_MEM) {\n          if (gc)\n            this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, it->getMemory().getLeaAst());\n          it->getMemory().setLeaAst(nullptr);\n        }\n      }\n    }\n\n\n    template <typename T>\n    void IrBuilder::collectUnsymbolizedNodes(T& items) const {\n      T newItems;\n\n      for (auto it = items.cbegin(); it != items.cend(); it++) {\n        if (std::get<1>(*it) && std::get<1>(*it)->isSymbolized() == true)\n          newItems.insert(*it);\n      }\n\n      items.clear();\n      items = newItems;\n    }\n\n\n    void IrBuilder::collectUnsymbolizedNodes(std::set<triton::ast::AbstractNode*>& uniqueNodes, std::vector<triton::arch::OperandWrapper>& operands) const {\n      for (auto it = operands.begin(); it!= operands.end(); it++) {\n        if (it->getType() == triton::arch::OP_MEM) {\n          if (it->getMemory().getLeaAst() && it->getMemory().getLeaAst()->isSymbolized() == false) {\n            this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, it->getMemory().getLeaAst());\n            it->getMemory().setLeaAst(nullptr);\n          }\n        }\n      }\n    }\n\n  }; \/* arch namespace *\/\n}; \/* triton namespace *\/\n<commit_msg>Code Review: Use autofor<commit_after>\/\/! \\file\n\/*\n**  Copyright (C) - Triton\n**\n**  This program is under the terms of the BSD License.\n*\/\n\n#include <new>\n\n#include <triton\/exceptions.hpp>\n#include <triton\/irBuilder.hpp>\n#include <triton\/memoryAccess.hpp>\n#include <triton\/operandWrapper.hpp>\n#include <triton\/register.hpp>\n#include <triton\/x86Semantics.hpp>\n#include <triton\/astContext.hpp>\n\n\n\nnamespace triton {\n  namespace arch {\n\n    IrBuilder::IrBuilder(triton::arch::Architecture* architecture,\n                         const triton::modes::Modes& modes,\n                         triton::ast::AstContext& astCtxt,\n                         triton::engines::symbolic::SymbolicEngine* symbolicEngine,\n                         triton::engines::taint::TaintEngine* taintEngine)\n      : modes(modes),\n        astGarbageCollector(astCtxt.getAstGarbageCollector()),\n        backupAstGarbageCollector(modes, true) {\n\n      if (architecture == nullptr)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::IrBuilder(): The architecture API must be defined.\");\n\n      if (symbolicEngine == nullptr)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::IrBuilder(): The symbolic engine API must be defined.\");\n\n      if (taintEngine == nullptr)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::IrBuilder(): The taint engines API must be defined.\");\n\n      this->architecture              = architecture;\n      this->backupSymbolicEngine      = new(std::nothrow) triton::engines::symbolic::SymbolicEngine(architecture, modes, astCtxt, nullptr, true);\n      this->symbolicEngine            = symbolicEngine;\n      this->taintEngine               = taintEngine;\n      this->x86Isa                    = new(std::nothrow) triton::arch::x86::x86Semantics(architecture, symbolicEngine, taintEngine, astCtxt);\n\n      if (this->x86Isa == nullptr || this->backupSymbolicEngine == nullptr)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::IrBuilder(): Not enough memory.\");\n    }\n\n\n    IrBuilder::~IrBuilder() {\n      delete this->backupSymbolicEngine;\n      delete this->x86Isa;\n    }\n\n\n    bool IrBuilder::buildSemantics(triton::arch::Instruction& inst) {\n      bool ret = false;\n\n      if (this->architecture->getArchitecture() == triton::arch::ARCH_INVALID)\n        throw triton::exceptions::IrBuilder(\"IrBuilder::buildSemantics(): You must define an architecture.\");\n\n      \/* Stage 1 - Update the context memory *\/\n      for (auto const& mem : inst.memoryAccess) {\n        this->architecture->setConcreteMemoryValue(mem);\n      }\n\n      \/* Stage 2 - Update the context register *\/\n      for (auto const& reg : inst.registerState) {\n        this->architecture->setConcreteRegisterValue(reg.second);\n      }\n\n      \/* Stage 3 - Initialize the target address of memory operands *\/\n      for (auto& operand : inst.operands) {\n        if (operand.getType() == triton::arch::OP_MEM) {\n          this->symbolicEngine->initLeaAst(operand.getMemory());\n        }\n      }\n\n      \/* Pre IR processing *\/\n      this->preIrInit(inst);\n\n      \/* Processing *\/\n      switch (this->architecture->getArchitecture()) {\n        case triton::arch::ARCH_X86:\n        case triton::arch::ARCH_X86_64:\n          ret = this->x86Isa->buildSemantics(inst);\n      }\n\n      \/* Post IR processing *\/\n      this->postIrInit(inst);\n\n      return ret;\n    }\n\n\n    void IrBuilder::preIrInit(triton::arch::Instruction& inst) {\n      \/* Clear previous expressions if exist *\/\n      inst.symbolicExpressions.clear();\n\n      \/* Clear implicit and explicit semantics *\/\n      inst.getLoadAccess().clear();\n      inst.getReadRegisters().clear();\n      inst.getReadImmediates().clear();\n      inst.getStoreAccess().clear();\n      inst.getWrittenRegisters().clear();\n\n      \/* Update instruction address if undefined *\/\n      if (!inst.getAddress())\n        inst.setAddress(this->architecture->getConcreteRegisterValue(this->architecture->getParentRegister(ID_REG_IP)).convert_to<triton::uint64>());\n\n      \/* Backup the symbolic engine in the case where only the taint is available. *\/\n      if (!this->symbolicEngine->isEnabled()) {\n        *this->backupSymbolicEngine = *this->symbolicEngine;\n        this->backupAstGarbageCollector = this->astGarbageCollector;\n      }\n    }\n\n\n    void IrBuilder::postIrInit(triton::arch::Instruction& inst) {\n      std::set<triton::ast::AbstractNode*> uniqueNodes;\n      std::vector<triton::engines::symbolic::SymbolicExpression*> newVector;\n\n      auto& loadAccess        = inst.getLoadAccess();\n      auto& readRegisters     = inst.getReadRegisters();\n      auto& readImmediates    = inst.getReadImmediates();\n      auto& storeAccess       = inst.getStoreAccess();\n      auto& writtenRegisters  = inst.getWrittenRegisters();\n\n      \/* Clear unused data *\/\n      inst.memoryAccess.clear();\n      inst.registerState.clear();\n\n      \/* Set the taint *\/\n      inst.setTaint();\n\n      \/\/ ----------------------------------------------------------------------\n\n      \/*\n       * If the symbolic engine is disable we delete symbolic\n       * expressions and AST nodes. Note that if the taint engine\n       * is enable we must compute semanitcs to spread the taint.\n       *\/\n      if (!this->symbolicEngine->isEnabled()) {\n        \/* Clear memory operands *\/\n        this->collectNodes(uniqueNodes, inst.operands, false);\n\n        \/* Clear implicit and explicit semantics *\/\n        loadAccess.clear();\n        readRegisters.clear();\n        readImmediates.clear();\n        storeAccess.clear();\n        writtenRegisters.clear();\n\n        \/* Symbolic Expressions *\/\n        this->removeSymbolicExpressions(inst, uniqueNodes);\n\n        \/* Restore backup *\/\n        *this->symbolicEngine = *this->backupSymbolicEngine;\n      }\n\n      \/\/ ----------------------------------------------------------------------\n\n      \/*\n       * If the symbolic engine is defined to process symbolic\n       * execution only on symbolized expressions, we delete all\n       * concrete expressions and their AST nodes.\n       *\/\n      if (this->symbolicEngine->isEnabled() && this->modes.isModeEnabled(triton::modes::ONLY_ON_SYMBOLIZED)) {\n        \/* Clear memory operands *\/\n        this->collectUnsymbolizedNodes(uniqueNodes, inst.operands);\n\n        \/* Clear implicit and explicit semantics - MEM *\/\n        this->collectUnsymbolizedNodes(loadAccess);\n\n        \/* Clear implicit and explicit semantics - REG *\/\n        this->collectUnsymbolizedNodes(readRegisters);\n\n        \/* Clear implicit and explicit semantics - IMM *\/\n        this->collectUnsymbolizedNodes(readImmediates);\n\n        \/* Clear implicit and explicit semantics - MEM *\/\n        this->collectUnsymbolizedNodes(storeAccess);\n\n        \/* Clear implicit and explicit semantics - REG *\/\n        this->collectUnsymbolizedNodes(writtenRegisters);\n\n        \/* Clear symbolic expressions *\/\n        for (auto* se : inst.symbolicExpressions) {\n          if (se->isSymbolized() == false) {\n            this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, se->getAst());\n            this->symbolicEngine->removeSymbolicExpression(se->getId());\n          }\n          else\n            newVector.push_back(se);\n        }\n        inst.symbolicExpressions = newVector;\n      }\n\n      \/\/ ----------------------------------------------------------------------\n\n      \/*\n       * If the symbolic engine is defined to process symbolic\n       * execution only on tainted instructions, we delete all\n       * expressions untainted and their AST nodes.\n       *\/\n      else if (this->modes.isModeEnabled(triton::modes::ONLY_ON_TAINTED) && !inst.isTainted()) {\n        \/* Memory operands *\/\n        this->collectNodes(uniqueNodes, inst.operands, true);\n\n        \/* Implicit and explicit semantics - MEM *\/\n        this->collectNodes(uniqueNodes, loadAccess);\n\n        \/* Implicit and explicit semantics - REG *\/\n        this->collectNodes(uniqueNodes, readRegisters);\n\n        \/* Implicit and explicit semantics - IMM *\/\n        this->collectNodes(uniqueNodes, readImmediates);\n\n        \/* Implicit and explicit semantics - MEM *\/\n        this->collectNodes(uniqueNodes, storeAccess);\n\n        \/* Implicit and explicit semantics - REG *\/\n        this->collectNodes(uniqueNodes, writtenRegisters);\n\n        \/* Symbolic Expressions *\/\n        this->removeSymbolicExpressions(inst, uniqueNodes);\n      }\n\n      \/\/ ----------------------------------------------------------------------\n\n      \/* Free collected nodes *\/\n      this->astGarbageCollector.freeAstNodes(uniqueNodes);\n\n      if (!this->symbolicEngine->isEnabled())\n        this->astGarbageCollector = this->backupAstGarbageCollector;\n    }\n\n\n    void IrBuilder::removeSymbolicExpressions(triton::arch::Instruction& inst, std::set<triton::ast::AbstractNode*>& uniqueNodes) {\n      for (auto const* se : inst.symbolicExpressions) {\n        this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, se->getAst());\n        this->symbolicEngine->removeSymbolicExpression(se->getId());\n      }\n      inst.symbolicExpressions.clear();\n    }\n\n\n    template <typename T>\n    void IrBuilder::collectNodes(std::set<triton::ast::AbstractNode*>& uniqueNodes, T& items) const {\n      for (auto const& item : items)\n        this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, std::get<1>(item));\n      items.clear();\n    }\n\n\n    void IrBuilder::collectNodes(std::set<triton::ast::AbstractNode*>& uniqueNodes, std::vector<triton::arch::OperandWrapper>& operands, bool gc) const {\n      for (auto& operand : operands) {\n        if (operand.getType() == triton::arch::OP_MEM) {\n          if (gc)\n            this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, operand.getMemory().getLeaAst());\n          operand.getMemory().setLeaAst(nullptr);\n        }\n      }\n    }\n\n\n    template <typename T>\n    void IrBuilder::collectUnsymbolizedNodes(T& items) const {\n      T newItems;\n\n      for (auto const& item : items) {\n        if (std::get<1>(item) && std::get<1>(item)->isSymbolized() == true)\n          newItems.insert(item);\n      }\n\n      items.clear();\n      items = newItems;\n    }\n\n\n    void IrBuilder::collectUnsymbolizedNodes(std::set<triton::ast::AbstractNode*>& uniqueNodes, std::vector<triton::arch::OperandWrapper>& operands) const {\n      for (auto& operand : operands) {\n        if (operand.getType() == triton::arch::OP_MEM) {\n          if (operand.getMemory().getLeaAst() && operand.getMemory().getLeaAst()->isSymbolized() == false) {\n            this->astGarbageCollector.extractUniqueAstNodes(uniqueNodes, operand.getMemory().getLeaAst());\n            operand.getMemory().setLeaAst(nullptr);\n          }\n        }\n      }\n    }\n\n  }; \/* arch namespace *\/\n}; \/* triton namespace *\/\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\/contrib\/tpu\/profiler\/dump_tpu_profile.h\"\n\n#include <cstdio>\n#include <ctime>\n#include <vector>\n\n#include \"tensorflow\/contrib\/tpu\/profiler\/op_profile.pb.h\"\n#include \"tensorflow\/contrib\/tpu\/profiler\/trace_events.pb.h\"\n#include \"tensorflow\/contrib\/tpu\/profiler\/trace_events_to_json.h\"\n#include \"tensorflow\/core\/framework\/graph.pb.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/io\/compression.h\"\n#include \"tensorflow\/core\/lib\/io\/path.h\"\n#include \"tensorflow\/core\/lib\/strings\/str_util.h\"\n#include \"tensorflow\/core\/lib\/strings\/strcat.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/protobuf.h\"\n#include \"tensorflow\/core\/protobuf\/config.pb.h\"\n#include \"tensorflow\/core\/util\/event.pb.h\"\n#include \"tensorflow\/core\/util\/events_writer.h\"\n\nnamespace tensorflow {\nnamespace tpu {\nnamespace {\n\nusing ::tensorflow::io::JoinPath;\nusing ::tensorflow::protobuf::util::JsonOptions;\nusing ::tensorflow::protobuf::util::MessageToJsonString;\n\nconstexpr char kGraphRunPrefix[] = \"tpu_profiler.hlo_graph.\";\nconstexpr char kJsonOpProfileFileName[] = \"op_profile.json\";\nconstexpr char kJsonTraceFileName[] = \"trace.json.gz\";\nconstexpr char kProfilePluginDirectory[] = \"plugins\/profile\/\";\nconstexpr char kProtoTraceFileName[] = \"trace\";\n\nStatus WriteGzippedDataToFile(const string& filename, const string& data) {\n  std::unique_ptr<WritableFile> file;\n  TF_RETURN_IF_ERROR(Env::Default()->NewWritableFile(filename, &file));\n  io::ZlibCompressionOptions options = io::ZlibCompressionOptions::GZIP();\n  io::ZlibOutputBuffer buffer(file.get(), options.input_buffer_size,\n                              options.output_buffer_size, options);\n  TF_RETURN_IF_ERROR(buffer.Init());\n  TF_RETURN_IF_ERROR(buffer.Append(data));\n  TF_RETURN_IF_ERROR(buffer.Close());\n  TF_RETURN_IF_ERROR(file->Close());\n  return Status::OK();\n}\n\nStatus DumpTraceToLogDirectory(StringPiece run_dir, const string& encoded_trace,\n                               std::ostream* os) {\n  string proto_path = JoinPath(run_dir, kProtoTraceFileName);\n  TF_RETURN_IF_ERROR(\n      WriteStringToFile(Env::Default(), proto_path, encoded_trace));\n  LOG(INFO) << \"Dumped raw-proto trace data to \" << proto_path;\n\n  string json_path = JoinPath(run_dir, kJsonTraceFileName);\n  Trace trace;\n  trace.ParseFromString(encoded_trace);\n  *os << \"Trace contains \" << trace.trace_events_size() << \" events.\"\n      << std::endl;\n  TF_RETURN_IF_ERROR(\n      WriteGzippedDataToFile(json_path, TraceEventsToJson(trace)));\n  *os << \"Dumped JSON trace data to \" << json_path << std::endl;\n  return Status::OK();\n}\n\nStatus DumpOpProfileToLogDirectory(StringPiece run_dir,\n                                   const tpu::op_profile::Profile& profile,\n                                   std::ostream* os) {\n  string path = JoinPath(run_dir, kJsonOpProfileFileName);\n  string json;\n  JsonOptions options;\n  options.always_print_primitive_fields = true;\n  auto status = MessageToJsonString(profile, &json, options);\n  if (!status.ok()) {\n    return errors::Internal(\n        \"Failed to convert op profile to json. Skipping... \",\n        string(status.error_message()));\n  }\n  TF_RETURN_IF_ERROR(WriteStringToFile(Env::Default(), path, json));\n  *os << \"Dumped json op profile data to \" << path << std::endl;\n  return Status::OK();\n}\n\nStatus DumpToolDataToLogDirectory(StringPiece run_dir,\n                                  const tensorflow::ProfileToolData& tool,\n                                  std::ostream* os) {\n  string path = JoinPath(run_dir, tool.name());\n  TF_RETURN_IF_ERROR(WriteStringToFile(Env::Default(), path, tool.data()));\n  *os << \"Dumped tool data for \" << tool.name() << \" to \" << path << std::endl;\n  return Status::OK();\n}\n\nStatus DumpGraphEvents(const string& logdir, const string& run,\n                       const ProfileResponse& response, std::ostream* os) {\n  int num_graphs = response.computation_graph_size();\n  if (response.computation_graph_size() == 0) return Status::OK();\n  \/\/ The server might generates multiple graphs for one program; we simply\n  \/\/ pick the first one.\n  if (num_graphs > 1) {\n    *os << num_graphs\n        << \" TPU program variants observed over the profiling period. \"\n        << \"One computation graph will be chosen arbitrarily.\" << std::endl;\n  }\n  \/\/ The graph plugin expects the graph in <logdir>\/<run>\/<event.file>.\n  string run_dir = JoinPath(logdir, strings::StrCat(kGraphRunPrefix, run));\n  TF_RETURN_IF_ERROR(Env::Default()->RecursivelyCreateDir(run_dir));\n  EventsWriter event_writer(JoinPath(run_dir, \"events\"));\n  Event event;\n  \/\/ Add the computation graph.\n  event.set_graph_def(response.computation_graph(0).SerializeAsString());\n  event_writer.WriteEvent(event);\n  *os << \"Wrote a HLO graph to \" << event_writer.FileName() << std::endl;\n\n  if (response.has_hlo_metadata()) {\n    tensorflow::TaggedRunMetadata tagged_run_metadata;\n    tagged_run_metadata.set_tag(run);\n    tagged_run_metadata.set_run_metadata(\n        response.hlo_metadata().SerializeAsString());\n    tensorflow::Event meta_event;\n    *meta_event.mutable_tagged_run_metadata() = tagged_run_metadata;\n    event_writer.WriteEvent(meta_event);\n    *os << \"Wrote HLO ops run metadata to \" << event_writer.FileName()\n        << std::endl;\n  }\n  return Status::OK();\n}\n\n}  \/\/ namespace\n\nStatus WriteTensorboardTPUProfile(const string& logdir, const string& run,\n                                  const ProfileResponse& response,\n                                  std::ostream* os) {\n  \/\/ Dumps profile data to <logdir>\/plugins\/profile\/<run>\/.\n  string profile_run_dir = JoinPath(logdir, kProfilePluginDirectory, run);\n  TF_RETURN_IF_ERROR(Env::Default()->RecursivelyCreateDir(profile_run_dir));\n\n  \/\/ Ignore computation_graph for now.\n  const bool empty_trace = response.encoded_trace().empty();\n  if (empty_trace) {\n    *os << \"No trace event is collected.\" << std::endl;\n  } else {\n    LOG(INFO) << \"Converting trace events to TraceViewer JSON.\";\n    TF_RETURN_IF_ERROR(\n        DumpTraceToLogDirectory(profile_run_dir, response.encoded_trace(), os));\n  }\n  if (response.has_op_profile() &&\n      (response.op_profile().has_by_program_structure() ||\n       response.op_profile().has_by_category())) {\n    TF_RETURN_IF_ERROR(DumpOpProfileToLogDirectory(profile_run_dir,\n                                                   response.op_profile(), os));\n  }\n  if (!empty_trace && !response.tool_data().empty()) {\n    for (const auto& tool_data : response.tool_data()) {\n      TF_RETURN_IF_ERROR(\n          DumpToolDataToLogDirectory(profile_run_dir, tool_data, os));\n    }\n  }\n  TF_RETURN_IF_ERROR(DumpGraphEvents(logdir, run, response, os));\n\n  return Status::OK();\n}\n\n}  \/\/ namespace tpu\n}  \/\/ namespace tensorflow\n<commit_msg>internal change<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\/contrib\/tpu\/profiler\/dump_tpu_profile.h\"\n\n#include <cstdio>\n#include <ctime>\n#include <vector>\n\n#include \"tensorflow\/contrib\/tpu\/profiler\/op_profile.pb.h\"\n#include \"tensorflow\/contrib\/tpu\/profiler\/trace_events.pb.h\"\n#include \"tensorflow\/contrib\/tpu\/profiler\/trace_events_to_json.h\"\n#include \"tensorflow\/core\/framework\/graph.pb.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/io\/compression.h\"\n#include \"tensorflow\/core\/lib\/io\/path.h\"\n#include \"tensorflow\/core\/lib\/strings\/str_util.h\"\n#include \"tensorflow\/core\/lib\/strings\/strcat.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/protobuf.h\"\n#include \"tensorflow\/core\/protobuf\/config.pb.h\"\n#include \"tensorflow\/core\/util\/event.pb.h\"\n#include \"tensorflow\/core\/util\/events_writer.h\"\n\nnamespace tensorflow {\nnamespace tpu {\nnamespace {\n\nusing ::tensorflow::io::JoinPath;\nusing ::tensorflow::protobuf::util::JsonOptions;\nusing ::tensorflow::protobuf::util::MessageToJsonString;\n\nconstexpr char kGraphRunPrefix[] = \"tpu_profiler.hlo_graph.\";\nconstexpr char kJsonOpProfileFileName[] = \"op_profile.json\";\nconstexpr char kJsonTraceFileName[] = \"trace.json.gz\";\nconstexpr char kProfilePluginDirectory[] = \"plugins\/profile\/\";\nconstexpr char kProtoTraceFileName[] = \"trace\";\n\nStatus WriteGzippedDataToFile(const string& filename, const string& data) {\n  std::unique_ptr<WritableFile> file;\n  TF_RETURN_IF_ERROR(Env::Default()->NewWritableFile(filename, &file));\n  io::ZlibCompressionOptions options = io::ZlibCompressionOptions::GZIP();\n  io::ZlibOutputBuffer buffer(file.get(), options.input_buffer_size,\n                              options.output_buffer_size, options);\n  TF_RETURN_IF_ERROR(buffer.Init());\n  TF_RETURN_IF_ERROR(buffer.Append(data));\n  TF_RETURN_IF_ERROR(buffer.Close());\n  TF_RETURN_IF_ERROR(file->Close());\n  return Status::OK();\n}\n\nStatus DumpTraceToLogDirectory(StringPiece run_dir, const string& encoded_trace,\n                               std::ostream* os) {\n  string proto_path = JoinPath(run_dir, kProtoTraceFileName);\n  TF_RETURN_IF_ERROR(\n      WriteStringToFile(Env::Default(), proto_path, encoded_trace));\n  LOG(INFO) << \"Dumped raw-proto trace data to \" << proto_path;\n\n  string json_path = JoinPath(run_dir, kJsonTraceFileName);\n  Trace trace;\n  trace.ParseFromString(encoded_trace);\n  *os << \"Trace contains \" << trace.trace_events_size() << \" events.\"\n      << std::endl;\n  TF_RETURN_IF_ERROR(\n      WriteGzippedDataToFile(json_path, TraceEventsToJson(trace)));\n  *os << \"Dumped JSON trace data to \" << json_path << std::endl;\n  return Status::OK();\n}\n\nStatus DumpOpProfileToLogDirectory(StringPiece run_dir,\n                                   const tpu::op_profile::Profile& profile,\n                                   std::ostream* os) {\n  string path = JoinPath(run_dir, kJsonOpProfileFileName);\n  string json;\n  JsonOptions options;\n  options.always_print_primitive_fields = true;\n  auto status = MessageToJsonString(profile, &json, options);\n  if (!status.ok()) {\n    return errors::Internal(\n        \"Failed to convert op profile to json. Skipping... \",\n        string(status.error_message()));\n  }\n  TF_RETURN_IF_ERROR(WriteStringToFile(Env::Default(), path, json));\n  *os << \"Dumped json op profile data to \" << path << std::endl;\n  return Status::OK();\n}\n\nStatus DumpToolDataToLogDirectory(StringPiece run_dir,\n                                  const tensorflow::ProfileToolData& tool,\n                                  std::ostream* os) {\n  string path = JoinPath(run_dir, tool.name());\n  TF_RETURN_IF_ERROR(WriteStringToFile(Env::Default(), path, tool.data()));\n  *os << \"Dumped tool data for \" << tool.name() << \" to \" << path << std::endl;\n  return Status::OK();\n}\n\nStatus DumpGraphEvents(const string& logdir, const string& run,\n                       const ProfileResponse& response, std::ostream* os) {\n  int num_graphs = response.computation_graph_size();\n  if (response.computation_graph_size() == 0) return Status::OK();\n  \/\/ The server might generates multiple graphs for one program; we simply\n  \/\/ pick the first one.\n  if (num_graphs > 1) {\n    *os << num_graphs\n        << \" TPU program variants observed over the profiling period. \"\n        << \"One computation graph will be chosen arbitrarily.\" << std::endl;\n  }\n  \/\/ The graph plugin expects the graph in <logdir>\/<run>\/<event.file>.\n  string run_dir = JoinPath(logdir, strings::StrCat(kGraphRunPrefix, run));\n  TF_RETURN_IF_ERROR(Env::Default()->RecursivelyCreateDir(run_dir));\n  EventsWriter event_writer(JoinPath(run_dir, \"events\"));\n  Event event;\n  \/\/ Add the computation graph.\n  event.set_graph_def(response.computation_graph(0).SerializeAsString());\n  event_writer.WriteEvent(event);\n  *os << \"Wrote a HLO graph to \" << event_writer.FileName() << std::endl;\n\n  if (response.has_hlo_metadata()) {\n    tensorflow::TaggedRunMetadata tagged_run_metadata;\n    tagged_run_metadata.set_tag(run);\n    tagged_run_metadata.set_run_metadata(\n        response.hlo_metadata().SerializeAsString());\n    tensorflow::Event meta_event;\n    *meta_event.mutable_tagged_run_metadata() = tagged_run_metadata;\n    event_writer.WriteEvent(meta_event);\n    *os << \"Wrote HLO ops run metadata to \" << event_writer.FileName()\n        << std::endl;\n  }\n  return Status::OK();\n}\n\n}  \/\/ namespace\n\nStatus WriteTensorboardTPUProfile(const string& logdir, const string& run,\n                                  const ProfileResponse& response,\n                                  std::ostream* os) {\n  \/\/ Dumps profile data to <logdir>\/plugins\/profile\/<run>\/.\n  string profile_run_dir = JoinPath(logdir, kProfilePluginDirectory, run);\n  TF_RETURN_IF_ERROR(Env::Default()->RecursivelyCreateDir(profile_run_dir));\n\n  \/\/ Ignore computation_graph for now.\n  const bool empty_trace = response.encoded_trace().empty();\n  if (empty_trace) {\n    *os << \"No trace event is collected.\" << std::endl;\n  } else {\n    LOG(INFO) << \"Converting trace events to TraceViewer JSON.\";\n    TF_RETURN_IF_ERROR(\n        DumpTraceToLogDirectory(profile_run_dir, response.encoded_trace(), os));\n  }\n  if (response.has_op_profile() &&\n      (response.op_profile().has_by_program_structure() ||\n       response.op_profile().has_by_category())) {\n    TF_RETURN_IF_ERROR(DumpOpProfileToLogDirectory(profile_run_dir,\n                                                   response.op_profile(), os));\n  }\n  if (!empty_trace && !response.tool_data().empty()) {\n    for (const auto& tool_data : response.tool_data()) {\n      TF_RETURN_IF_ERROR(\n          DumpToolDataToLogDirectory(profile_run_dir, tool_data, os));\n    }\n  }\n\n  return Status::OK();\n}\n\n}  \/\/ namespace tpu\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/\/---------------------------------------------------------------------------\n\/\/\/ \\file   es\/component.hpp\n\/\/\/ \\brief  A component is a data type that can be assigned to entities\n\/\/\n\/\/ Copyright 2013, nocte@hippie.nu            Released under the MIT License.\n\/\/---------------------------------------------------------------------------\n#pragma once\n\n#include <memory>\n#include <string>\n#include <typeinfo>\n\nnamespace es {\n\nclass storage;\n\n\/** A component is a data type that can be assigned to entities.\n * For example, an entity could have a position and a velocity.  The position\n * would be a component, and the data type would be a 2- or 3-dimensional\n * coordinate.  The velocity would be yet another component, and the data\n * type would be a vector. *\/\nclass component\n{\n    friend class storage;\n\nprotected:\n    \/** Placeholder for complex data types.\n     *  Some data types don't have a fixed, flat memory layout.  This\n     *  class defines an interface that can be used as a placeholder in\n     *  the entity buffer, while the actual object resides on the heap. *\/\n    class placeholder\n    {\n    public:\n        virtual ~placeholder() { }\n\n        \/** Return a copy of the underlying object. *\/\n        virtual placeholder* clone() const = 0;\n    };\n\npublic:\n    \/** @param name     Descriptive name\n     *  @param size     Size of an instance of this component in bytes.  For\n     *                  components that need a placeholder, this should be\n     *                  sizeof(placeholder).\n     *  @param ph       Simple types should pass a nullptr here.  Complex types\n     *                  should pass a pointer to a placeholder instance of\n     *                  the correct type. *\/\n    component(std::string name, size_t size, std::unique_ptr<placeholder> ph)\n        : name_(std::move(name))\n        , size_(size)\n        , ph_(std::move(ph))\n    { }\n\n    const std::string&    name() const      { return name_; }\n    size_t                size() const      { return size_; }\n    bool                  is_flat() const   { return ph_ == nullptr; }\n\n    bool operator== (const std::string& compare) const\n        { return name_ == compare; }\n\n    bool operator!= (const std::string& compare) const\n        { return name_ != compare; }\n\nprivate:\n    std::string             name_;\n    size_t                  size_;\n    std::unique_ptr<placeholder> ph_;\n};\n\n} \/\/ namespace es\n\n<commit_msg>Explicit move constructor for VS2013<commit_after>\/\/---------------------------------------------------------------------------\n\/\/\/ \\file   es\/component.hpp\n\/\/\/ \\brief  A component is a data type that can be assigned to entities\n\/\/\n\/\/ Copyright 2013, nocte@hippie.nu            Released under the MIT License.\n\/\/---------------------------------------------------------------------------\n#pragma once\n\n#include <memory>\n#include <string>\n#include <typeinfo>\n\nnamespace es {\n\nclass storage;\n\n\/** A component is a data type that can be assigned to entities.\n * For example, an entity could have a position and a velocity.  The position\n * would be a component, and the data type would be a 2- or 3-dimensional\n * coordinate.  The velocity would be yet another component, and the data\n * type would be a vector. *\/\nclass component\n{\n    friend class storage;\n\nprotected:\n    \/** Placeholder for complex data types.\n     *  Some data types don't have a fixed, flat memory layout.  This\n     *  class defines an interface that can be used as a placeholder in\n     *  the entity buffer, while the actual object resides on the heap. *\/\n    class placeholder\n    {\n    public:\n        virtual ~placeholder() { }\n\n        \/** Return a copy of the underlying object. *\/\n        virtual placeholder* clone() const = 0;\n    };\n\npublic:\n    \/** @param name     Descriptive name\n     *  @param size     Size of an instance of this component in bytes.  For\n     *                  components that need a placeholder, this should be\n     *                  sizeof(placeholder).\n     *  @param ph       Simple types should pass a nullptr here.  Complex types\n     *                  should pass a pointer to a placeholder instance of\n     *                  the correct type. *\/\n    component(std::string name, size_t size, std::unique_ptr<placeholder> ph)\n        : name_(std::move(name))\n        , size_(size)\n        , ph_(std::move(ph))\n    { }\n\n\tcomponent(component&& m)\n\t\t: name_(std::move(m.name_))\n\t\t, size_(m.size_)\n\t\t, ph_(std::move(m.ph_))\n\t{\n\t\tm.size_ = 0;\n\t}\n\n    const std::string&    name() const      { return name_; }\n    size_t                size() const      { return size_; }\n    bool                  is_flat() const   { return ph_ == nullptr; }\n\n    bool operator== (const std::string& compare) const\n        { return name_ == compare; }\n\n    bool operator!= (const std::string& compare) const\n        { return name_ != compare; }\n\nprivate:\n    std::string             name_;\n    size_t                  size_;\n    std::unique_ptr<placeholder> ph_;\n};\n\n} \/\/ namespace es\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2019 TF.Text 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 \"tensorflow_text\/core\/kernels\/wordpiece_tokenizer.h\"\n\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"absl\/strings\/string_view_utils.h\"\n#include \"icu4c\/source\/common\/unicode\/schriter.h\"\n#include \"icu4c\/source\/common\/unicode\/unistr.h\"\n#include \"icu4c\/source\/common\/unicode\/utf8.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n\nnamespace tensorflow {\nnamespace text {\n\nconstexpr int64 kOutOfVocabValue = -1;\n\nLookupTableVocab::LookupTableVocab(lookup::LookupInterface* table,\n                                   OpKernelContext* ctx)\n    : table_(table), ctx_(ctx), default_value_(DT_INT64, TensorShape({1})) {\n  default_value_.flat<int64>()(0) = kOutOfVocabValue;\n}\n\nStatus LookupTableVocab::Contains(const string& key, bool* value) {\n  if (value == nullptr) {\n    return errors::InvalidArgument(\"Bad 'value' param.\");\n  }\n  Tensor keys(DT_STRING, TensorShape({1}));\n  keys.flat<string>()(0) = key;\n  Tensor values(DT_INT64, TensorShape({1}));\n  TF_RETURN_IF_ERROR(table_->Find(ctx_, keys, &values, default_value_));\n\n  if (static_cast<int64>(values.flat<int64>()(0)) != kOutOfVocabValue) {\n    *value = true;\n    return Status::OK();\n  }\n  *value = false;\n  return Status::OK();\n}\n\nnamespace {\n\nStatus Lookup(int byte_start, int byte_end, const string& token,\n              const string& suffix_indicator, LookupTableVocab* vocab_map,\n              bool* in_vocab) {\n  int byte_len = byte_end - byte_start;\n  absl::string_view substr(token.data() + byte_start, byte_len);\n  string lookup_value;\n  if (byte_start > 0) {\n    lookup_value = absl::StrCat(suffix_indicator, substr);\n  } else {\n    absl::CopyToString(substr, &lookup_value);\n  }\n  return vocab_map->Contains(lookup_value, in_vocab);\n}\n\n\/\/ Sets byte_end to the longest byte sequence which:\n\/\/ 1) is a proper UTF8 sequence\n\/\/ 2) is in the vocab\n\/\/ If no match is found, found_match is set to false.\nStatus LongestMatchStartingAt(int byte_start, const string& token,\n                              const string& suffix_indicator,\n                              LookupTableVocab* vocab_map, int* byte_end,\n                              bool* found_match) {\n  const char* token_bytes = token.data();\n  const int token_len = token.length();\n  std::vector<int32_t> byte_ends;\n  for (int32_t i = byte_start; i < token_len;) {\n    UChar32 c;\n    U8_NEXT(token_bytes, i, token_len, c);\n    byte_ends.push_back(i);\n  }\n  int n = byte_ends.size();\n  for (int i = n - 1; i >= 0; i--) {\n    bool in_vocab;\n    TF_RETURN_IF_ERROR(Lookup(byte_start, byte_ends[i], token, suffix_indicator,\n                              vocab_map, &in_vocab));\n    if (in_vocab) {\n      *byte_end = byte_ends[i];\n      *found_match = true;\n      return Status::OK();\n    }\n  }\n  *found_match = false;\n  return Status::OK();\n}\n\n\/\/ Sets the outputs 'begin_offset', 'end_offset' and 'num_word_pieces' when no\n\/\/ token is found.\nStatus NoTokenFound(const string& token, bool use_unknown_token,\n                    const string& unknown_token, std::vector<string>* subwords,\n                    std::vector<int>* begin_offset,\n                    std::vector<int>* end_offset, int* num_word_pieces) {\n  begin_offset->push_back(0);\n  if (use_unknown_token) {\n    subwords->push_back(unknown_token);\n    end_offset->push_back(token.length());\n  } else {\n    subwords->push_back(token);\n    end_offset->push_back(token.length());\n  }\n  ++(*num_word_pieces);\n\n  return Status::OK();\n}\n\n\/\/ When a subword is found, this helper function will add the outputs to\n\/\/ 'subwords', 'begin_offset' and 'end_offset'.\nvoid AddWord(const string& token, int byte_start, int byte_end,\n             const string& suffix_indicator, std::vector<string>* subwords,\n             std::vector<int>* begin_offset, std::vector<int>* end_offset) {\n  begin_offset->push_back(byte_start);\n  int len = byte_end - byte_start;\n  if (byte_start > 0) {\n    \/\/ Prepend suffix_indicator if the token is within a word.\n    subwords->push_back(\n        ::absl::StrCat(suffix_indicator, token.substr(byte_start, len)));\n  } else {\n    subwords->push_back(token.substr(byte_start, len));\n  }\n  end_offset->push_back(byte_end);\n}\n\nStatus TokenizeL2RGreedy(const string& token, const int64 max_bytes_per_token,\n                         const string& suffix_indicator, bool use_unknown_token,\n                         const string& unknown_token,\n                         LookupTableVocab* vocab_map,\n                         std::vector<string>* subwords,\n                         std::vector<int>* begin_offset,\n                         std::vector<int>* end_offset, int* num_word_pieces) {\n  std::vector<string> candidate_subwords;\n  std::vector<int> candidate_begin_offsets;\n  std::vector<int> candidate_end_offsets;\n  const int token_len = token.length();\n  for (int byte_start = 0; byte_start < token_len;) {\n    int byte_end;\n    bool found_subword;\n    TF_RETURN_IF_ERROR(LongestMatchStartingAt(byte_start, token,\n                                              suffix_indicator, vocab_map,\n                                              &byte_end, &found_subword));\n    if (found_subword) {\n      AddWord(token, byte_start, byte_end, suffix_indicator,\n              &candidate_subwords, &candidate_begin_offsets,\n              &candidate_end_offsets);\n      byte_start = byte_end;\n    } else {\n      return NoTokenFound(token, use_unknown_token, unknown_token, subwords,\n                          begin_offset, end_offset, num_word_pieces);\n    }\n  }\n\n  subwords->insert(subwords->end(), candidate_subwords.begin(),\n                   candidate_subwords.end());\n  begin_offset->insert(begin_offset->end(), candidate_begin_offsets.begin(),\n                       candidate_begin_offsets.end());\n  end_offset->insert(end_offset->end(), candidate_end_offsets.begin(),\n                     candidate_end_offsets.end());\n  *num_word_pieces += candidate_subwords.size();\n  return Status::OK();\n}\n\n}  \/\/ namespace\n\nStatus WordpieceTokenize(const string& token, const int64 max_bytes_per_token,\n                         const string& suffix_indicator, bool use_unknown_token,\n                         const string& unknown_token,\n                         LookupTableVocab* vocab_map,\n                         std::vector<string>* subwords,\n                         std::vector<int>* begin_offset,\n                         std::vector<int>* end_offset, int* num_word_pieces) {\n  int token_len = token.size();\n  if (token_len > max_bytes_per_token) {\n    begin_offset->push_back(0);\n    *num_word_pieces = 1;\n    if (use_unknown_token) {\n      end_offset->push_back(unknown_token.size());\n      subwords->emplace_back(unknown_token);\n    } else {\n      subwords->emplace_back(token);\n      end_offset->push_back(token.size());\n    }\n    return Status::OK();\n  }\n  return TokenizeL2RGreedy(token, max_bytes_per_token, suffix_indicator,\n                           use_unknown_token, unknown_token, vocab_map,\n                           subwords, begin_offset, end_offset, num_word_pieces);\n}\n\n}  \/\/ namespace text\n}  \/\/ namespace tensorflow\n<commit_msg>Remove non-public absl dependency<commit_after>\/\/ Copyright 2019 TF.Text 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 \"tensorflow_text\/core\/kernels\/wordpiece_tokenizer.h\"\n\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"icu4c\/source\/common\/unicode\/schriter.h\"\n#include \"icu4c\/source\/common\/unicode\/unistr.h\"\n#include \"icu4c\/source\/common\/unicode\/utf8.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n\nnamespace tensorflow {\nnamespace text {\n\nconstexpr int64 kOutOfVocabValue = -1;\n\nLookupTableVocab::LookupTableVocab(lookup::LookupInterface* table,\n                                   OpKernelContext* ctx)\n    : table_(table), ctx_(ctx), default_value_(DT_INT64, TensorShape({1})) {\n  default_value_.flat<int64>()(0) = kOutOfVocabValue;\n}\n\nStatus LookupTableVocab::Contains(const string& key, bool* value) {\n  if (value == nullptr) {\n    return errors::InvalidArgument(\"Bad 'value' param.\");\n  }\n  Tensor keys(DT_STRING, TensorShape({1}));\n  keys.flat<string>()(0) = key;\n  Tensor values(DT_INT64, TensorShape({1}));\n  TF_RETURN_IF_ERROR(table_->Find(ctx_, keys, &values, default_value_));\n\n  if (static_cast<int64>(values.flat<int64>()(0)) != kOutOfVocabValue) {\n    *value = true;\n    return Status::OK();\n  }\n  *value = false;\n  return Status::OK();\n}\n\nnamespace {\n\nStatus Lookup(int byte_start, int byte_end, const string& token,\n              const string& suffix_indicator, LookupTableVocab* vocab_map,\n              bool* in_vocab) {\n  int byte_len = byte_end - byte_start;\n  absl::string_view substr(token.data() + byte_start, byte_len);\n  string lookup_value;\n  if (byte_start > 0) {\n    lookup_value = absl::StrCat(suffix_indicator, substr);\n  } else {\n    \/\/ absl::CopyToString\n    lookup_value.assign(substr.begin(), substr.end());\n  }\n  return vocab_map->Contains(lookup_value, in_vocab);\n}\n\n\/\/ Sets byte_end to the longest byte sequence which:\n\/\/ 1) is a proper UTF8 sequence\n\/\/ 2) is in the vocab\n\/\/ If no match is found, found_match is set to false.\nStatus LongestMatchStartingAt(int byte_start, const string& token,\n                              const string& suffix_indicator,\n                              LookupTableVocab* vocab_map, int* byte_end,\n                              bool* found_match) {\n  const char* token_bytes = token.data();\n  const int token_len = token.length();\n  std::vector<int32_t> byte_ends;\n  for (int32_t i = byte_start; i < token_len;) {\n    UChar32 c;\n    U8_NEXT(token_bytes, i, token_len, c);\n    byte_ends.push_back(i);\n  }\n  int n = byte_ends.size();\n  for (int i = n - 1; i >= 0; i--) {\n    bool in_vocab;\n    TF_RETURN_IF_ERROR(Lookup(byte_start, byte_ends[i], token, suffix_indicator,\n                              vocab_map, &in_vocab));\n    if (in_vocab) {\n      *byte_end = byte_ends[i];\n      *found_match = true;\n      return Status::OK();\n    }\n  }\n  *found_match = false;\n  return Status::OK();\n}\n\n\/\/ Sets the outputs 'begin_offset', 'end_offset' and 'num_word_pieces' when no\n\/\/ token is found.\nStatus NoTokenFound(const string& token, bool use_unknown_token,\n                    const string& unknown_token, std::vector<string>* subwords,\n                    std::vector<int>* begin_offset,\n                    std::vector<int>* end_offset, int* num_word_pieces) {\n  begin_offset->push_back(0);\n  if (use_unknown_token) {\n    subwords->push_back(unknown_token);\n    end_offset->push_back(token.length());\n  } else {\n    subwords->push_back(token);\n    end_offset->push_back(token.length());\n  }\n  ++(*num_word_pieces);\n\n  return Status::OK();\n}\n\n\/\/ When a subword is found, this helper function will add the outputs to\n\/\/ 'subwords', 'begin_offset' and 'end_offset'.\nvoid AddWord(const string& token, int byte_start, int byte_end,\n             const string& suffix_indicator, std::vector<string>* subwords,\n             std::vector<int>* begin_offset, std::vector<int>* end_offset) {\n  begin_offset->push_back(byte_start);\n  int len = byte_end - byte_start;\n  if (byte_start > 0) {\n    \/\/ Prepend suffix_indicator if the token is within a word.\n    subwords->push_back(\n        ::absl::StrCat(suffix_indicator, token.substr(byte_start, len)));\n  } else {\n    subwords->push_back(token.substr(byte_start, len));\n  }\n  end_offset->push_back(byte_end);\n}\n\nStatus TokenizeL2RGreedy(const string& token, const int64 max_bytes_per_token,\n                         const string& suffix_indicator, bool use_unknown_token,\n                         const string& unknown_token,\n                         LookupTableVocab* vocab_map,\n                         std::vector<string>* subwords,\n                         std::vector<int>* begin_offset,\n                         std::vector<int>* end_offset, int* num_word_pieces) {\n  std::vector<string> candidate_subwords;\n  std::vector<int> candidate_begin_offsets;\n  std::vector<int> candidate_end_offsets;\n  const int token_len = token.length();\n  for (int byte_start = 0; byte_start < token_len;) {\n    int byte_end;\n    bool found_subword;\n    TF_RETURN_IF_ERROR(LongestMatchStartingAt(byte_start, token,\n                                              suffix_indicator, vocab_map,\n                                              &byte_end, &found_subword));\n    if (found_subword) {\n      AddWord(token, byte_start, byte_end, suffix_indicator,\n              &candidate_subwords, &candidate_begin_offsets,\n              &candidate_end_offsets);\n      byte_start = byte_end;\n    } else {\n      return NoTokenFound(token, use_unknown_token, unknown_token, subwords,\n                          begin_offset, end_offset, num_word_pieces);\n    }\n  }\n\n  subwords->insert(subwords->end(), candidate_subwords.begin(),\n                   candidate_subwords.end());\n  begin_offset->insert(begin_offset->end(), candidate_begin_offsets.begin(),\n                       candidate_begin_offsets.end());\n  end_offset->insert(end_offset->end(), candidate_end_offsets.begin(),\n                     candidate_end_offsets.end());\n  *num_word_pieces += candidate_subwords.size();\n  return Status::OK();\n}\n\n}  \/\/ namespace\n\nStatus WordpieceTokenize(const string& token, const int64 max_bytes_per_token,\n                         const string& suffix_indicator, bool use_unknown_token,\n                         const string& unknown_token,\n                         LookupTableVocab* vocab_map,\n                         std::vector<string>* subwords,\n                         std::vector<int>* begin_offset,\n                         std::vector<int>* end_offset, int* num_word_pieces) {\n  int token_len = token.size();\n  if (token_len > max_bytes_per_token) {\n    begin_offset->push_back(0);\n    *num_word_pieces = 1;\n    if (use_unknown_token) {\n      end_offset->push_back(unknown_token.size());\n      subwords->emplace_back(unknown_token);\n    } else {\n      subwords->emplace_back(token);\n      end_offset->push_back(token.size());\n    }\n    return Status::OK();\n  }\n  return TokenizeL2RGreedy(token, max_bytes_per_token, suffix_indicator,\n                           use_unknown_token, unknown_token, vocab_map,\n                           subwords, begin_offset, end_offset, num_word_pieces);\n}\n\n}  \/\/ namespace text\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/* See LICENSE.\n\n   The Minor Planet Center accepts astrometry from spacecraft using\na modification of their usual 80-column \"punched-card\" format.  A\nsecond line is used to tell you where the spacecraft was,  relative\nto the geocenter.\n\nhttps:\/\/minorplanetcenter.net\/iau\/info\/SatelliteObs.html\n\n   This code can reset those positions for Earth-orbiting spacecraft using\nTLEs ('two-line elements';  https:\/\/www.projectpluto.com\/tle_info.htm.)\nThis helps when accurate positions are not provided or completely trusted\nor appear to be bad.\n\n   This code will read the 80-column astrometry and,  when it finds a\nspacecraft position report (the \"second line\"),  look through the TLE\nfile for a matching TLE.  If it finds one,  it'll compute the spacecraft\nlocation for that time and modify the position accordingly.\n\n   This was written specifically to handle a problem with a satellite in\nLEO.  TLEs don't exist for heliocentric objects,  but I may revise this\ncode eventually to add positions for them (this could be done by,  for\nexample,  requesting them from JPL Horizons).  TLEs exist for TESS,\ncomputed by me,  but some work would be required to make those actually\nfunction properly (the numbers are larger and the format is somewhat\ndifferent as a result).  So this really works,  at present,  only for\n(C51) WISE, (C52) Swift,  and (C53) NEOSSat.             *\/\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <assert.h>\n#include <math.h>\n#include \"norad.h\"\n#include \"watdefs.h\"\n#include \"afuncs.h\"\n#include \"mpc_func.h\"\n\n#define PI \\\n   3.1415926535897932384626433832795028841971693993751058209749445923\n\nint find_tle( tle_t *tle, const char *filename, const int norad_no)\n{\n   FILE *ifile = fopen( filename, \"rb\");\n   char line0[100], line1[100], line2[100];\n   int rval = -1;\n\n   if( !ifile)\n      {\n      fprintf( stderr, \"Couldn't open TLE file '%s'\\n\", filename);\n      exit( -1);\n      }\n   *line0 = *line1 = '\\0';\n   while( rval && fgets( line2, sizeof( line2), ifile))\n      {\n      if( *line1 == '1' && *line2 == '2' && atoi( line1 + 2) == norad_no)\n         if( parse_elements( line1, line2, tle) >= 0)\n            rval = 0;\n      strcpy( line0, line1);\n      strcpy( line1, line2);\n      }\n   fclose( ifile);\n   if( rval)\n      {\n      fprintf( stderr, \"Couldn't find TLEs for %5d in TLE file '%s'\\n\",\n                           norad_no, filename);\n      exit( -1);\n      }\n   return( rval);\n}\n\n\/*\nC49 = 29510 = 2006-047A = STEREO-A\nC50 = 29511 = 2006-047B = STEREO-B\nC51 = 36119 = 2009-071A = WISE   *\nC52 = 28485 = 2004-047A = Swift   *\nC53 = 39089 = 2013-009D = NEOSSat  *\nC54 = 28928 = 2006-001A = New Horizons\nC55 = 34380 = 2009-011A = Kepler\nC56 = 41043 = 2015-070A = LISA-Pathfinder\nC57 = 43435 = 2018-038A = TESS      *\n   Note that only the asterisked objects are actually in earth orbit\nand therefore have TLEs.  But I may try to figure out some way to add\nin positions for the heliocentric spacecraft later.  *\/\n\nstatic int mpc_code_to_norad_number( const char *mpc_code)\n{\n   const char *codes = \"C49 C50 C51 C52 C53 C54 C55 C56 C57 \";\n   const int norad_numbers[] = { 29510, 29511, 36119, 28485, 39089,\n                                        28928, 34380, 41043, 43435 };\n   int i;\n\n   for( i = 0; codes[i * 4]; i++)\n      if( !memcmp( codes + i * 4, mpc_code, 3))\n         return( norad_numbers[i]);\n   assert( 1);          \/* not supposed to ever happen,  unless a new *\/\n   return( 0);          \/* satellite has been added *\/\n}\n\nint main( const int argc, const char **argv)\n{\n   FILE *ifile;\n   const char *tle_filename = (argc > 2 ? argv[2] : \"all_tle.txt\");\n   const char *astrometry_filename = argv[1];\n   int is_deep = 0, curr_norad = 0;\n   char buff[200];\n   double params[N_SAT_PARAMS];\n   const double J2000 = 2451545.;\n   tle_t tle;\n\n   ifile = fopen( astrometry_filename, \"rb\");\n   assert( ifile);\n   while( fgets( buff, sizeof( buff), ifile))\n      {\n      double jd;\n\n      if( strlen( buff) > 80 && buff[14] == 's'\n            && (jd = extract_date_from_mpc_report( buff, NULL)) > 2400000.)\n         {\n         double state[6], state_j2000[6], precess_matrix[9];\n         double t_since;\n         const int norad_number = mpc_code_to_norad_number( buff + 77);\n         int i;\n\n         if( curr_norad != norad_number)\n            {\n            curr_norad = norad_number;\n            find_tle( &tle, tle_filename, norad_number);\n            is_deep = select_ephemeris( &tle);\n            if( is_deep)\n               SDP4_init( params, &tle);\n            else\n               SGP4_init( params, &tle);\n            }\n         t_since = (jd - tle.epoch) * minutes_per_day;\n         if( is_deep)\n            SDP4( t_since, &tle, params, state, state + 3);\n         else\n            SGP4( t_since, &tle, params, state, state + 3);\n         setup_precession( precess_matrix, 2000. + (jd - J2000) \/ 365.25, 2000.);\n         precess_vector( precess_matrix, state, state_j2000);\n         precess_vector( precess_matrix, state + 3, state_j2000 + 3);\n         for( i = 0; i < 3; i++)\n            {\n            char *tptr = buff + 34 + i * 12;\n\n            sprintf( tptr, \"%11.4f\", fabs( state_j2000[i]));\n            *tptr = (state_j2000[i] > 0. ? '+' : '-');\n            tptr[11] = ' ';\n            }\n         }\n      printf( \"%s\", buff);\n      }\n   fclose( ifile);\n   return( 0);\n}\n<commit_msg>'line2' : improved error handling and message.<commit_after>\/* See LICENSE.\n\n   The Minor Planet Center accepts astrometry from spacecraft using\na modification of their usual 80-column \"punched-card\" format.  A\nsecond line is used to tell you where the spacecraft was,  relative\nto the geocenter.\n\nhttps:\/\/minorplanetcenter.net\/iau\/info\/SatelliteObs.html\n\n   This code can reset those positions for Earth-orbiting spacecraft using\nTLEs ('two-line elements';  https:\/\/www.projectpluto.com\/tle_info.htm.)\nThis helps when accurate positions are not provided or completely trusted\nor appear to be bad.\n\n   This code will read the 80-column astrometry and,  when it finds a\nspacecraft position report (the \"second line\"),  look through the TLE\nfile for a matching TLE.  If it finds one,  it'll compute the spacecraft\nlocation for that time and modify the position accordingly.\n\n   This was written specifically to handle a problem with a satellite in\nLEO.  TLEs don't exist for heliocentric objects,  but I may revise this\ncode eventually to add positions for them (this could be done by,  for\nexample,  requesting them from JPL Horizons).  TLEs exist for TESS,\ncomputed by me,  but some work would be required to make those actually\nfunction properly (the numbers are larger and the format is somewhat\ndifferent as a result).  So this really works,  at present,  only for\n(C51) WISE, (C52) Swift,  and (C53) NEOSSat.             *\/\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <assert.h>\n#include <errno.h>\n#include <math.h>\n#include \"norad.h\"\n#include \"watdefs.h\"\n#include \"afuncs.h\"\n#include \"mpc_func.h\"\n\n#define PI \\\n   3.1415926535897932384626433832795028841971693993751058209749445923\n\nint find_tle( tle_t *tle, const char *filename, const int norad_no)\n{\n   FILE *ifile = fopen( filename, \"rb\");\n   char line0[100], line1[100], line2[100];\n   int rval = -1;\n\n   if( !ifile)\n      {\n      fprintf( stderr, \"Couldn't open TLE file '%s'\\n\", filename);\n      exit( -1);\n      }\n   *line0 = *line1 = '\\0';\n   while( rval && fgets( line2, sizeof( line2), ifile))\n      {\n      if( *line1 == '1' && *line2 == '2' && atoi( line1 + 2) == norad_no)\n         if( parse_elements( line1, line2, tle) >= 0)\n            rval = 0;\n      strcpy( line0, line1);\n      strcpy( line1, line2);\n      }\n   fclose( ifile);\n   if( rval)\n      {\n      fprintf( stderr, \"Couldn't find TLEs for %5d in TLE file '%s'\\n\",\n                           norad_no, filename);\n      exit( -1);\n      }\n   return( rval);\n}\n\n\/*\nC49 = 29510 = 2006-047A = STEREO-A\nC50 = 29511 = 2006-047B = STEREO-B\nC51 = 36119 = 2009-071A = WISE   *\nC52 = 28485 = 2004-047A = Swift   *\nC53 = 39089 = 2013-009D = NEOSSat  *\nC54 = 28928 = 2006-001A = New Horizons\nC55 = 34380 = 2009-011A = Kepler\nC56 = 41043 = 2015-070A = LISA-Pathfinder\nC57 = 43435 = 2018-038A = TESS      *\n   Note that only the asterisked objects are actually in earth orbit\nand therefore have TLEs.  But I may try to figure out some way to add\nin positions for the heliocentric spacecraft later.  *\/\n\nstatic int mpc_code_to_norad_number( const char *mpc_code)\n{\n   const char *codes = \"C49 C50 C51 C52 C53 C54 C55 C56 C57 \";\n   const int norad_numbers[] = { 29510, 29511, 36119, 28485, 39089,\n                                        28928, 34380, 41043, 43435 };\n   int i;\n\n   for( i = 0; codes[i * 4]; i++)\n      if( !memcmp( codes + i * 4, mpc_code, 3))\n         return( norad_numbers[i]);\n   assert( 1);          \/* not supposed to ever happen,  unless a new *\/\n   return( 0);          \/* satellite has been added *\/\n}\n\nint main( const int argc, const char **argv)\n{\n   const char *tle_filename = (argc > 2 ? argv[2] : \"all_tle.txt\");\n   const char *astrometry_filename = argv[1];\n   FILE *ifile = (argc > 1 ? fopen( astrometry_filename, \"rb\") : NULL);\n   int is_deep = 0, curr_norad = 0;\n   char buff[200];\n   double params[N_SAT_PARAMS];\n   const double J2000 = 2451545.;\n   tle_t tle;\n\n   if( argc > 1 && !ifile)\n      fprintf( stderr, \"'%s' not found : %s\\n\", astrometry_filename, strerror( errno));\n   if( !ifile)\n      {\n      fprintf( stderr, \"'line2' takes as a command-line argument the name of the input\\n\"\n                       \"astrometry file.  It sends astrometry with corrected\/added\\n\"\n                       \"spacecraft locations to stdout.\\n\");\n      exit( -1);\n      }\n   while( fgets( buff, sizeof( buff), ifile))\n      {\n      double jd;\n\n      if( strlen( buff) > 80 && buff[14] == 's'\n            && (jd = extract_date_from_mpc_report( buff, NULL)) > 2400000.)\n         {\n         double state[6], state_j2000[6], precess_matrix[9];\n         double t_since;\n         const int norad_number = mpc_code_to_norad_number( buff + 77);\n         int i;\n\n         if( curr_norad != norad_number)\n            {\n            curr_norad = norad_number;\n            find_tle( &tle, tle_filename, norad_number);\n            is_deep = select_ephemeris( &tle);\n            if( is_deep)\n               SDP4_init( params, &tle);\n            else\n               SGP4_init( params, &tle);\n            }\n         t_since = (jd - tle.epoch) * minutes_per_day;\n         if( is_deep)\n            SDP4( t_since, &tle, params, state, state + 3);\n         else\n            SGP4( t_since, &tle, params, state, state + 3);\n         setup_precession( precess_matrix, 2000. + (jd - J2000) \/ 365.25, 2000.);\n         precess_vector( precess_matrix, state, state_j2000);\n         precess_vector( precess_matrix, state + 3, state_j2000 + 3);\n         for( i = 0; i < 3; i++)\n            {\n            char *tptr = buff + 34 + i * 12;\n\n            sprintf( tptr, \"%11.4f\", fabs( state_j2000[i]));\n            *tptr = (state_j2000[i] > 0. ? '+' : '-');\n            tptr[11] = ' ';\n            }\n         }\n      printf( \"%s\", buff);\n      }\n   fclose( ifile);\n   return( 0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n *\n * This file is part of Log4Qt library.\n *\n * Copyright (C) 2007 - 2020 Log4Qt contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"systemlogappender.h\"\n\n#include \"layout.h\"\n#include \"level.h\"\n#include \"loggingevent.h\"\n\n#include <QCoreApplication>\n\n#if defined(Q_OS_WIN)\n#ifndef UNICODE\n#define UNICODE\n#endif\n#include <qt_windows.h>\n\n#include <QLibrary>\n\ntypedef HANDLE(WINAPI *PDeregisterEventSource)(HANDLE);\nstatic PDeregisterEventSource pDeregisterEventSource = nullptr;\ntypedef BOOL(WINAPI *PReportEvent)(HANDLE, WORD, WORD, DWORD, PSID, WORD, DWORD, LPCTSTR *, LPVOID);\nstatic PReportEvent pReportEvent = nullptr;\ntypedef HANDLE(WINAPI *PRegisterEventSource)(LPCTSTR, LPCTSTR);\nstatic PRegisterEventSource pRegisterEventSource = nullptr;\n\n#define RESOLVE(name) p##name = reinterpret_cast<P##name>(lib.resolve(#name));\n#define RESOLVEA(name) p##name = reinterpret_cast<P##name>(lib.resolve(#name\"A\"));\n#define RESOLVEW(name) p##name = reinterpret_cast<P##name>(lib.resolve(#name\"W\"));\n\nstatic bool winServiceInit()\n{\n    if (pDeregisterEventSource == nullptr)\n    {\n        QLibrary lib(QStringLiteral(\"advapi32\"));\n\n        \/\/ only resolve unicode versions\n        RESOLVE(DeregisterEventSource);\n        RESOLVEW(ReportEvent);\n        RESOLVEW(RegisterEventSource);\n    }\n    return pDeregisterEventSource != nullptr;\n}\n#else\n\n#include <pwd.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <stdlib.h>\n#include <string.h>\n#include <syslog.h>\n#include <signal.h>\n#include <sys\/stat.h>\n\nstatic QString encodeName(const QString &name, bool allowUpper = false)\n{\n    QString n = name.toLower();\n    QString legal = QStringLiteral(\"abcdefghijklmnopqrstuvwxyz1234567890\");\n    if (allowUpper)\n        legal += QStringLiteral(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\");\n    int pos = 0;\n    while (pos < n.size())\n    {\n        if (legal.indexOf(n[pos]) == -1)\n            n.remove(pos, 1);\n        else\n            ++pos;\n    }\n    return n;\n}\n#endif\nnamespace Log4Qt\n{\nSystemLogAppender::SystemLogAppender(QObject *parent) :\n    AppenderSkeleton(parent), ident(nullptr)\n{\n    setServiceName(QCoreApplication::applicationName());\n}\n\nSystemLogAppender::~SystemLogAppender()\n{\n    delete[] ident;\n}\n\nvoid SystemLogAppender::append(const LoggingEvent &event)\n{\n    QString message(layout()->format(event));\n\n#if defined(Q_OS_WIN)\n    \/\/  Q_D(QtServiceBase);\n    if (!winServiceInit())\n        return;\n    WORD wType;\n    switch (event.level().toInt())\n    {\n    case Level::WARN_INT:\n        wType = EVENTLOG_WARNING_TYPE;\n        break;\n    case Level::ERROR_INT:\n        wType = EVENTLOG_ERROR_TYPE;\n        break;\n    case Level::FATAL_INT:\n        wType = EVENTLOG_ERROR_TYPE;\n        break;\n    case Level::OFF_INT:\n        wType = EVENTLOG_SUCCESS;\n        break;\n    default:\n        wType = EVENTLOG_INFORMATION_TYPE;\n        break;\n    }\n\n    HANDLE h = pRegisterEventSource(nullptr, serviceName().toStdWString().c_str());\n    if (h != nullptr)\n    {\n        int id = 0;\n        uint category = 0;\n        auto msg = message.toStdWString();\n        const wchar_t *msg_wstr = msg.c_str();\n        const char *bindata = nullptr;\/\/data.size() ? data.constData() : 0;\n        const int datasize = 0;\n        pReportEvent(h, wType, category, id, nullptr, 1, datasize,\n                     &msg_wstr, const_cast<char *> (bindata));\n        pDeregisterEventSource(h);\n    }\n#else\n\n    int st;\n    switch (event.level().toInt())\n    {\n    case Level::WARN_INT:\n        st = LOG_WARNING;\n        break;\n    case Level::ERROR_INT:\n        st = LOG_ERR;\n        break;\n    case Level::FATAL_INT:\n        st = LOG_ERR;\n        break;\n    default:\n        st = LOG_INFO;\n    }\n\n    openlog(ident, LOG_PID, LOG_DAEMON);\n\n#if QT_VERSION >= 0x050c00\n    for (const auto &line : message.split('\\n', Qt::SkipEmptyParts))\n#else\n    for (const auto &line : message.split('\\n', QString::SkipEmptyParts))\n#endif\n        syslog(st, \"%s\", line.toLocal8Bit().constData());\n    closelog();\n\n#endif \/\/#if defined(Q_OS_WIN)\n}\n\nQString SystemLogAppender::serviceName() const\n{\n    return mServiceName;\n}\n\nvoid SystemLogAppender::setServiceName(const QString &serviceName)\n{\n    mServiceName = serviceName;\n\n#if !defined(Q_OS_WIN)\n    delete[] ident;\n    QString tmp = encodeName(mServiceName, true);\n    int len = tmp.toLocal8Bit().size();\n    ident = new char[len + 1];\n    ident[len] = '\\0';\n    ::memcpy(ident, tmp.toLocal8Bit().constData(), len);\n#endif\n}\n\n}\n\n#include \"moc_systemlogappender.cpp\"\n\n<commit_msg>Fixed qt version for Qt::SkipEmptyParts<commit_after>\/******************************************************************************\n *\n * This file is part of Log4Qt library.\n *\n * Copyright (C) 2007 - 2020 Log4Qt contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"systemlogappender.h\"\n\n#include \"layout.h\"\n#include \"level.h\"\n#include \"loggingevent.h\"\n\n#include <QCoreApplication>\n\n#if defined(Q_OS_WIN)\n#ifndef UNICODE\n#define UNICODE\n#endif\n#include <qt_windows.h>\n\n#include <QLibrary>\n\ntypedef HANDLE(WINAPI *PDeregisterEventSource)(HANDLE);\nstatic PDeregisterEventSource pDeregisterEventSource = nullptr;\ntypedef BOOL(WINAPI *PReportEvent)(HANDLE, WORD, WORD, DWORD, PSID, WORD, DWORD, LPCTSTR *, LPVOID);\nstatic PReportEvent pReportEvent = nullptr;\ntypedef HANDLE(WINAPI *PRegisterEventSource)(LPCTSTR, LPCTSTR);\nstatic PRegisterEventSource pRegisterEventSource = nullptr;\n\n#define RESOLVE(name) p##name = reinterpret_cast<P##name>(lib.resolve(#name));\n#define RESOLVEA(name) p##name = reinterpret_cast<P##name>(lib.resolve(#name\"A\"));\n#define RESOLVEW(name) p##name = reinterpret_cast<P##name>(lib.resolve(#name\"W\"));\n\nstatic bool winServiceInit()\n{\n    if (pDeregisterEventSource == nullptr)\n    {\n        QLibrary lib(QStringLiteral(\"advapi32\"));\n\n        \/\/ only resolve unicode versions\n        RESOLVE(DeregisterEventSource);\n        RESOLVEW(ReportEvent);\n        RESOLVEW(RegisterEventSource);\n    }\n    return pDeregisterEventSource != nullptr;\n}\n#else\n\n#include <pwd.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <stdlib.h>\n#include <string.h>\n#include <syslog.h>\n#include <signal.h>\n#include <sys\/stat.h>\n\nstatic QString encodeName(const QString &name, bool allowUpper = false)\n{\n    QString n = name.toLower();\n    QString legal = QStringLiteral(\"abcdefghijklmnopqrstuvwxyz1234567890\");\n    if (allowUpper)\n        legal += QStringLiteral(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\");\n    int pos = 0;\n    while (pos < n.size())\n    {\n        if (legal.indexOf(n[pos]) == -1)\n            n.remove(pos, 1);\n        else\n            ++pos;\n    }\n    return n;\n}\n#endif\nnamespace Log4Qt\n{\nSystemLogAppender::SystemLogAppender(QObject *parent) :\n    AppenderSkeleton(parent), ident(nullptr)\n{\n    setServiceName(QCoreApplication::applicationName());\n}\n\nSystemLogAppender::~SystemLogAppender()\n{\n    delete[] ident;\n}\n\nvoid SystemLogAppender::append(const LoggingEvent &event)\n{\n    QString message(layout()->format(event));\n\n#if defined(Q_OS_WIN)\n    \/\/  Q_D(QtServiceBase);\n    if (!winServiceInit())\n        return;\n    WORD wType;\n    switch (event.level().toInt())\n    {\n    case Level::WARN_INT:\n        wType = EVENTLOG_WARNING_TYPE;\n        break;\n    case Level::ERROR_INT:\n        wType = EVENTLOG_ERROR_TYPE;\n        break;\n    case Level::FATAL_INT:\n        wType = EVENTLOG_ERROR_TYPE;\n        break;\n    case Level::OFF_INT:\n        wType = EVENTLOG_SUCCESS;\n        break;\n    default:\n        wType = EVENTLOG_INFORMATION_TYPE;\n        break;\n    }\n\n    HANDLE h = pRegisterEventSource(nullptr, serviceName().toStdWString().c_str());\n    if (h != nullptr)\n    {\n        int id = 0;\n        uint category = 0;\n        auto msg = message.toStdWString();\n        const wchar_t *msg_wstr = msg.c_str();\n        const char *bindata = nullptr;\/\/data.size() ? data.constData() : 0;\n        const int datasize = 0;\n        pReportEvent(h, wType, category, id, nullptr, 1, datasize,\n                     &msg_wstr, const_cast<char *> (bindata));\n        pDeregisterEventSource(h);\n    }\n#else\n\n    int st;\n    switch (event.level().toInt())\n    {\n    case Level::WARN_INT:\n        st = LOG_WARNING;\n        break;\n    case Level::ERROR_INT:\n        st = LOG_ERR;\n        break;\n    case Level::FATAL_INT:\n        st = LOG_ERR;\n        break;\n    default:\n        st = LOG_INFO;\n    }\n\n    openlog(ident, LOG_PID, LOG_DAEMON);\n\n#if QT_VERSION >= 0x050e00\n    for (const auto &line : message.split('\\n', Qt::SkipEmptyParts))\n#else\n    for (const auto &line : message.split('\\n', QString::SkipEmptyParts))\n#endif\n        syslog(st, \"%s\", line.toLocal8Bit().constData());\n    closelog();\n\n#endif \/\/#if defined(Q_OS_WIN)\n}\n\nQString SystemLogAppender::serviceName() const\n{\n    return mServiceName;\n}\n\nvoid SystemLogAppender::setServiceName(const QString &serviceName)\n{\n    mServiceName = serviceName;\n\n#if !defined(Q_OS_WIN)\n    delete[] ident;\n    QString tmp = encodeName(mServiceName, true);\n    int len = tmp.toLocal8Bit().size();\n    ident = new char[len + 1];\n    ident[len] = '\\0';\n    ::memcpy(ident, tmp.toLocal8Bit().constData(), len);\n#endif\n}\n\n}\n\n#include \"moc_systemlogappender.cpp\"\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- mode: c++ -*-\n#include \"FixedThreadPool.h\"\n#include <libssh\/libsshpp.hpp>\n#include <iostream>\n#include <cstdlib>\n#include <boost\/shared_ptr.hpp>\n#include <string>\n#include <arpa\/inet.h>\n\nusing namespace tpool;\nusing namespace std;\nusing namespace ssh;\nusing boost::shared_ptr;\n\nclass SshForwardTask : public TaskBase\n{\n  shared_ptr<Channel> m_forwardChannel;\n  sync::Mutex& m_channelGuard;\n  \npublic:\n  SshForwardTask(shared_ptr<Channel> channel, sync::Mutex& channelGuard)\n    : m_forwardChannel(channel), m_channelGuard(channelGuard)\n  {}\n  \n  virtual ~SshForwardTask()\n  {}\n\n  virtual void DoRun()\n  {\n    const int data = 1;\n    sync::MutexLocker l(m_channelGuard);\n    cout << \"forward data: \" << data << endl;\n    const long networkData = htonl(data);\n    m_forwardChannel->write(&networkData, sizeof(data));\n  }\n};\n\nvoid ReportSshError(SshException& e)\n{\n  cerr << \"[Error]: \" << e.getError() << endl;\n  exit(1);\n}\n\n\nint main(int argc, char *argv[])\n{\n  if (argc < 3)\n    {\n      cerr << \"please enter username and password\" << endl;\n      exit(1);\n    }\n  const string username = argv[1];\n  const string password = argv[2];\n  \n  Session sshSession;\n  sshSession.setOption(SSH_OPTIONS_HOST, \"127.0.0.1\");\n  sshSession.setOption(SSH_OPTIONS_PORT, 22);\n  try\n    {\n      sshSession.connect();\n    }\n  catch (SshException& e)\n    {\n      ReportSshError(e);\n    }\n\n  sshSession.setOption(SSH_OPTIONS_USER, username.c_str());\n  try\n    {\n      if (sshSession.userauthPassword(password.c_str()) != SSH_AUTH_SUCCESS)\n\t{\n\t  cerr << \"[Error] login failed\" << endl;\n\t  exit(1);\n\t}\n      cout << \"login successfully\" << endl;\n    }\n  catch (SshException& e)\n    {\n      ReportSshError(e);\n    }\n\n  \n  \/\/ execute a command\n  Channel execChannel(sshSession);\n  string remoteCmd;\n  cin >> remoteCmd;\n  try\n    {\n      execChannel.openSession();\n      execChannel.requestExec(remoteCmd.c_str());\n    }\n  catch (SshException& e)\n    {\n      ReportSshError(e);\n    }\n  char execResult[1024] = {0};\n  int count = 0;\n  if ((count = execChannel.read(execResult, 1024)) < 0)\n    {\n      cerr << \"[Error] read\" << endl;\n      exit(1);\n    }\n  string resultString(execResult, count);\n  cout << \"exec result: \" << resultString << endl;\n  execChannel.close();\n\n  shared_ptr<Channel> forwardChannel(new Channel(sshSession));\n  try\n    {\n      const int result = forwardChannel->openForward(\"127.0.0.1\", 8999, \"localhost\");\n      if (!(forwardChannel->isOpen()))\n\t{\n\t  cerr << \"Forward Channel Open Failed.\" << endl;\n\t  exit(1);\n\t}\n    }\n  catch (SshException& e)\n    {\n      ReportSshError(e);\n    }\n\n  {\n    LFixedThreadPool threadPool(5);\n    sync::Mutex channelGuard;\n\n    for (int i = 0; i < 5; ++i)\n      {\n\tthreadPool.AddTask(TaskBase::Ptr(new SshForwardTask(forwardChannel,\n\t\t\t\t\t\t\t    channelGuard)));\n      }\n\n    threadPool.Stop();\n  }\n\n  return 0;\n}\n<commit_msg>Refactoring SshClient.<commit_after>\/\/ -*- mode: c++ -*-\n#include \"FixedThreadPool.h\"\n#include <libssh\/libsshpp.hpp>\n#include <iostream>\n#include <cstdlib>\n#include <boost\/shared_ptr.hpp>\n#include <string>\n#include <fstream>\n#include <arpa\/inet.h>\n#include <cstdio>\n\nusing namespace tpool;\nusing namespace std;\nusing namespace ssh;\nusing boost::shared_ptr;\n\nclass SshForwardTask : public TaskBase\n{\n  shared_ptr<Channel> m_forwardChannel;\n  sync::Mutex& m_channelGuard;\n  \npublic:\n  SshForwardTask(shared_ptr<Channel> channel, sync::Mutex& channelGuard)\n    : m_forwardChannel(channel), m_channelGuard(channelGuard)\n  {}\n  \n  virtual ~SshForwardTask()\n  {}\n\n  virtual void DoRun()\n  {\n    const int data = 1;\n    sync::MutexLocker l(m_channelGuard);\n    cout << \"forward data: \" << data << endl;\n    const long networkData = htonl(data);\n    m_forwardChannel->write(&networkData, sizeof(data));\n  }\n};\n\nvoid ReportSshError(SshException& e)\n{\n  cerr << \"[Error]: \" << e.getError() << endl;\n  exit(1);\n}\n\nshared_ptr<Session> MakeSshSession(const string& host, const int port)\n{\n  shared_ptr<Session> session(new Session);\n  session->setOption(SSH_OPTIONS_HOST, host.c_str());\n  session->setOption(SSH_OPTIONS_PORT, port);\n  try\n    {\n      session->connect();\n      return session;\n    }\n  catch (SshException& e)\n    {\n      ReportSshError(e);\n    }\n}\n\nvoid LoginSshSession(shared_ptr<Session> session, const string& username,\n\t\t     const string& password)\n{\n  session->setOption(SSH_OPTIONS_USER, username.c_str());\n  try\n    {\n      if (session->userauthPassword(password.c_str()) != SSH_AUTH_SUCCESS)\n\t{\n\t  cerr << \"[Error] login failed\" << endl;\n\t  exit(1);\n\t}\n      cout << \"login successfully\" << endl;\n    }\n  catch (SshException& e)\n    {\n      ReportSshError(e);\n    }\n}\n\nshared_ptr<Channel> MakeCommandChannel(shared_ptr<Session> session,\n\t\t\t\t       const string& command)\n{\n  shared_ptr<Channel> execChannel(new Channel(*session));\n  try\n    {\n      execChannel->openSession();\n      execChannel->requestPty();\n      execChannel->changePtySize(80, 46);\n      execChannel->requestShell();\n      const string realCommand = command + \"\\n\";\n      cout << \"realcommand is \" << realCommand;\n      cout << \"size is \" << realCommand.size() << endl;\n      {\n\tFILE* logfile = fopen(\"log.txt\", \"wb\");\n\tfwrite(realCommand.c_str(), 1, realCommand.size(), logfile);\n\tfclose(logfile);\n      }\n      const int count = execChannel->write(realCommand.c_str(), realCommand.size());\n      if (count < realCommand.size())\n\t{\n\t  cerr << \"[error] shell write\" << endl;\n\t  exit(1);\n\t}\n      \/\/ execChannel->requestExec(command.c_str());\n      return execChannel;\n    }\n  catch (SshException& e)\n    {\n      ReportSshError(e);\n    }\n}\n\nshared_ptr<Channel> MakeDirectForwardChannel(shared_ptr<Session> session,\n\t\t\t\t\t     const string& host,\n\t\t\t\t\t     const int& port)\n{\n  shared_ptr<Channel> forwardChannel(new Channel(*session));\n  try\n    {\n      forwardChannel->openForward(host.c_str(), port, \"localhost\");\n      if (!(forwardChannel->isOpen()))\n\t{\n\t  cerr << \"Forward Channel Open Failed.\" << endl;\n\t  exit(1);\n\t}\n      return forwardChannel;\n    }\n  catch (SshException& e)\n    {\n      ReportSshError(e);\n    }\n}\n\nint main(int argc, char *argv[])\n{\n  if (argc < 3)\n    {\n      cerr << \"please enter username and password\" << endl;\n      exit(1);\n    }\n  const string username = argv[1];\n  const string password = argv[2];\n  \n  shared_ptr<Session> sshSession(MakeSshSession(\"127.0.0.1\", 22));\n  LoginSshSession(sshSession, username, password);\n  \n  \/\/ execute a command\n  string remoteCmd;\n  getline(cin, remoteCmd);\n  {\n    cout << \"remotecommand is \" << remoteCmd << endl;\n    shared_ptr<Channel> execChannel(MakeCommandChannel(sshSession, remoteCmd));\n\n    char execResult[1024] = {0};\n    int count = 0;\n    if (!(execChannel->isOpen()) || execChannel->isEof())\n      {\n\tcerr << \"[Error] command channel not open\" << endl;\n\texit(1);\n      }\n    \/\/ if ((count = execChannel->read(execResult, 1024)) < 0)\n    \/\/   {\n    \/\/ \tcerr << \"[Error] read\" << endl;\n    \/\/ \texit(1);\n    \/\/   }\n    while ((count = execChannel->read(execResult, sizeof(execResult))) > 0)\n      {\n\tstring resultString(execResult, count);\n\tcout << \"exec result: \" << resultString << endl;\n      }\n    string resultString(execResult, count);\n    cout << \"exec result: \" << resultString << endl;\n    execChannel->requestSendSignal(\"KILL\");\n    execChannel->sendEof();\n    execChannel->close();\n    cin >> remoteCmd;\n  }\n\n  shared_ptr<Channel> forwardChannel(MakeDirectForwardChannel(sshSession,\n\t\t\t\t\t\t\t      \"127.0.0.1\",\n\t\t\t\t\t\t\t      8999));\n\n  {\n    LFixedThreadPool threadPool(5);\n    sync::Mutex channelGuard;\n\n    for (int i = 0; i < 5; ++i)\n      {\n\tthreadPool.AddTask(TaskBase::Ptr(new SshForwardTask(forwardChannel,\n\t\t\t\t\t\t\t    channelGuard)));\n      }\n\n    threadPool.Stop();\n  }\n\n  \n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\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\/\/ <chrono>\n\n#include <chrono>\n#include <type_traits>\n#include <cassert>\n\nint main()\n{\n#if _LIBCPP_STD_VER > 11 \n    using namespace std::literals::chrono_literals;\n\n\/\/    Make sure the types are right\n    static_assert ( std::is_same<decltype( 3h   ), std::chrono::hours>::value, \"\" );\n    static_assert ( std::is_same<decltype( 3min ), std::chrono::minutes>::value, \"\" );\n    static_assert ( std::is_same<decltype( 3s   ), std::chrono::seconds>::value, \"\" );\n    static_assert ( std::is_same<decltype( 3ms  ), std::chrono::milliseconds>::value, \"\" );\n    static_assert ( std::is_same<decltype( 3us  ), std::chrono::microseconds>::value, \"\" );\n    static_assert ( std::is_same<decltype( 3ns  ), std::chrono::nanoseconds>::value, \"\" );\n    \n    std::chrono::hours h = 4h;\n    assert ( h == std::chrono::hours(4));\n    auto h2 = 4.0h;\n    assert ( h == h2 );\n    \n    std::chrono::minutes min = 36min;\n    assert ( min == std::chrono::minutes(36));\n    auto min2 = 36.0min;\n    assert ( min == min2 );\n\n    std::chrono::seconds s = 24s;\n    assert ( s == std::chrono::seconds(24));\n    auto s2 = 24.0s;\n    assert ( s == s2 );\n\n    std::chrono::milliseconds ms = 247ms;\n    assert ( ms == std::chrono::milliseconds(247));\n    auto ms2 = 247.0ms;\n    assert ( ms == ms2 );\n\n    std::chrono::microseconds us = 867us;\n    assert ( us == std::chrono::microseconds(867));\n    auto us2 = 867.0us;\n    assert ( us == us2 );\n\n    std::chrono::nanoseconds ns = 645ns;\n    assert ( ns == std::chrono::nanoseconds(645));\n    auto ns2 = 645.ns;\n    assert ( ns == ns2 );\n#endif\n}\n<commit_msg>Rename time.duration.literals step 2<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2011, 2012 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\/\/ A test harness for the implementation report of\n\/\/       the CSS2.1 Conformance Test Suite\n\/\/ http:\/\/test.csswg.org\/suites\/css2.1\/20110323\/\n\n#include <unistd.h>\n#include <sys\/wait.h>\n\n#include <cstring>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <boost\/version.hpp>\n#include <boost\/iostreams\/stream.hpp>\n#include <boost\/iostreams\/device\/file_descriptor.hpp>\n\nenum {\n    INTERACTIVE = 0,\n    HEADLESS,\n    REPORT,\n    UPDATE,\n\n    \/\/ exit status codes\n    ES_PASS = 0,\n    ES_FATAL,\n    ES_FAIL,\n    ES_INVALID,\n    ES_NA,\n    ES_SKIP,\n    ES_UNCERTAIN\n};\n\nconst char* StatusStrings[] = {\n    \"pass\",\n    \"fatal\",\n    \"fail\",\n    \"invalid\",\n    \"?\",\n    \"skip\",\n    \"uncertain\",\n};\n\nstruct ForkStatus {\n    pid_t       pid;\n    std::string url;\n    int         code;\npublic:\n    ForkStatus() : pid(-1), code(0) {}\n};\n\nsize_t forkMax = 1;\nsize_t forkCount = 0;\nstd::vector<ForkStatus> forkStates(1);\n\nint processOutput(std::istream& stream, std::string& result)\n{\n    std::string output;\n    bool completed = false;\n    while (std::getline(stream, output)) {\n        if (!completed) {\n            if (output == \"## complete\")\n                completed = true;\n            continue;\n        }\n        if (output == \"##\")\n            break;\n        result += output + '\\n';\n    }\n    return 0;\n}\n\nint runTest(int argc, char* argv[], std::string userStyle, std::string testFonts, std::string url, std::string& result, unsigned timeout)\n{\n    int pipefd[2];\n    pipe(pipefd);\n\n    pid_t pid = fork();\n    if (pid == -1) {\n        std::cerr << \"error: no more process to create\\n\";\n        return -1;\n    }\n    if (pid == 0) {\n        close(1);\n        dup(pipefd[1]);\n        close(pipefd[0]);\n        int argi = argc - 1;\n        if (!userStyle.empty())\n            argv[argi++] = strdup(userStyle.c_str());\n        if (testFonts == \"on\")\n            argv[argi++] =\"-testfonts\";\n        url = \"http:\/\/localhost:8000\/\" + url;\n        \/\/ url = \"http:\/\/test.csswg.org\/suites\/css2.1\/20110323\/\" + url;\n        argv[argi++] = strdup(url.c_str());\n        argv[argi] = 0;\n        if (timeout)\n            alarm(timeout); \/\/ Terminate the process if it does not complete in 'timeout' seconds.\n        execvp(argv[0], argv);\n        exit(EXIT_FAILURE);\n    }\n    close(pipefd[1]);\n\n#if 104400 <= BOOST_VERSION\n    boost::iostreams::stream<boost::iostreams::file_descriptor_source> stream(pipefd[0], boost::iostreams::close_handle);\n#else\n    boost::iostreams::stream<boost::iostreams::file_descriptor_source> stream(pipefd[0], true);\n#endif\n    processOutput(stream, result);\n    return pid;\n}\n\nvoid killTest(int pid)\n{\n    int status;\n    kill(pid, SIGTERM);\n    if (wait(&status) == -1)\n        std::cerr << \"error: failed to wait for a test process to complete\\n\";\n}\n\nbool loadLog(const std::string& path, std::string& result, std::string& log)\n{\n    std::ifstream file(path.c_str());\n    if (!file) {\n        result = \"?\";\n        return false;\n    }\n    std::string line;\n    std::getline(file, line);\n    size_t pos = line.find('\\t');\n    if (pos != std::string::npos)\n        result = line.substr(pos + 1);\n    else {\n        result = \"?\";\n        return false;\n    }\n    log.clear();\n    while (std::getline(file, line))\n        log += line + '\\n';\n    return true;\n}\n\nbool saveLog(const std::string& path, const std::string& url, const std::string& result, const std::string& log)\n{\n    std::ofstream file(path.c_str(), std::ios_base::out | std::ios_base::trunc);\n    if (!file) {\n        std::cerr << \"error: failed to open the report file\\n\";\n        return false;\n    }\n    file << \"# \" << url.c_str() << '\\t' << result << '\\n' << log;\n    file.flush();\n    file.close();\n    return true;\n}\n\nstd::string test(int mode, int argc, char* argv[], const std::string& url, const std::string& userStyle, const std::string& testFonts, unsigned timeout)\n{\n    std::string path(url);\n    size_t pos = path.rfind('.');\n    if (pos != std::string::npos) {\n        path.erase(pos);\n        path += \".log\";\n    }\n    std::string evaluation;\n    std::string log;\n    loadLog(path, evaluation, log);\n\n    pid_t pid = -1;\n    std::string output;\n    switch (mode) {\n    case REPORT:\n        break;\n    case UPDATE:\n        if (evaluation[0] == '?')\n            break;\n        \/\/ FALL THROUGH\n    default:\n        pid = runTest(argc, argv, userStyle, testFonts, url, output, timeout);\n        break;\n    }\n\n    std::string result;\n    if (0 < pid && output.empty())\n        result = \"fatal\";\n    else if (mode == INTERACTIVE) {\n        std::cout << \"## complete\\n\" << output;\n        std::cout << '[' << url << \"] \";\n        if (evaluation.empty() || evaluation[0] == '?')\n            std::cout << \"pass? \";\n        else {\n            std::cout << evaluation << \"? \";\n            if (evaluation != \"pass\")\n                std::cout << '\\a';\n        }\n        std::getline(std::cin, result);\n        if (result.empty()) {\n            if (evaluation.empty() || evaluation[0] == '?')\n                result = \"pass\";\n            else\n                result = evaluation;\n        } else if (result == \"p\" || result == \"\\x1b\")\n            result = \"pass\";\n        else if (result == \"f\")\n            result = \"fail\";\n        else if (result == \"i\")\n            result = \"invalid\";\n        else if (result == \"k\") \/\/ keep\n            result = evaluation;\n        else if (result == \"n\")\n            result = \"na\";\n        else if (result == \"s\")\n            result = \"skip\";\n        else if (result == \"u\")\n            result = \"uncertain\";\n        else if (result == \"q\" || result == \"quit\")\n            exit(EXIT_FAILURE);\n        else if (result == \"z\")\n            result = \"undo\";\n        if (result != \"undo\" && !saveLog(path, url, result, output)) {\n            std::cerr << \"error: failed to open the report file\\n\";\n            exit(EXIT_FAILURE);\n        }\n    } else if (mode == HEADLESS) {\n        if (evaluation != \"?\" && output != log)\n            result = \"uncertain\";\n        else\n            result = evaluation;\n    } else if (mode == REPORT) {\n        result = evaluation;\n    } else if (mode == UPDATE) {\n        result = evaluation;\n        if (result[0] != '?') {\n            if (!saveLog(path, url, result, output)) {\n                std::cerr << \"error: failed to open the report file\\n\";\n                exit(EXIT_FAILURE);\n            }\n        }\n    }\n\n    if (0 < pid)\n        killTest(pid);\n    if (mode != INTERACTIVE && result[0] != '?')\n        std::cout << url << '\\t' << result << '\\n';\n    return result;\n}\n\nvoid reduce(std::ostream& report)\n{\n    for (int i = 0; i < forkCount; ++i) {\n        int status;\n        pid_t pid = wait(&status);\n        for (int j = 0; j < forkCount; ++j) {\n            if (forkStates[j].pid == pid) {\n                forkStates[j].pid = -1;\n                forkStates[j].code = WIFEXITED(status) ? WEXITSTATUS(status) : ES_FATAL;\n                break;\n            }\n        }\n    }\n    for (int i = 0; i < forkCount; ++i) {\n        if (forkStates[i].code != ES_NA)\n            std::cout << forkStates[i].url << '\\t' << StatusStrings[forkStates[i].code] << '\\n';\n        report << forkStates[i].url << '\\t' << StatusStrings[forkStates[i].code] << '\\n';\n    }\n    forkCount = 0;\n}\n\nvoid map(std::ostream& report, int mode, int argc, char* argv[], const std::string& url, const std::string& userStyle, const std::string& testFonts, unsigned timeout)\n{\n    pid_t pid = fork();\n    if (pid == -1) {\n        std::cerr << \"error: no more process to create\\n\";\n        exit(EXIT_FAILURE);\n    }\n    if (pid == 0) {\n        std::string path(url);\n        size_t pos = path.rfind('.');\n        if (pos != std::string::npos) {\n            path.erase(pos);\n            path += \".log\";\n        }\n        std::string evaluation;\n        std::string log;\n        loadLog(path, evaluation, log);\n\n        pid_t pid = -1;\n        std::string output;\n        switch (mode) {\n        case UPDATE:\n            if (evaluation[0] == '?')\n                break;\n            \/\/ FALL THROUGH\n        default:\n            pid = runTest(argc, argv, userStyle, testFonts, url, output, timeout);\n            break;\n        }\n\n        std::string result;\n        if (0 < pid && output.empty())\n            result = \"fatal\";\n        else if (mode == HEADLESS) {\n            if (evaluation != \"?\" && output != log)\n                result = \"uncertain\";\n            else\n                result = evaluation;\n        } else if (mode == UPDATE) {\n            result = evaluation;\n            if (result[0] != '?') {\n                if (!saveLog(path, url, result, output)) {\n                    std::cerr << \"error: failed to open the report file\\n\";\n                    exit(EXIT_FAILURE);\n                }\n            }\n        }\n        if (0 < pid)\n            killTest(pid);\n        int status = ES_NA;\n        if (!result.compare(0, 4, \"pass\"))\n            status = ES_PASS;\n        else if (!result.compare(0, 5, \"fatal\"))\n            status = ES_FATAL;\n        else if (!result.compare(0, 4, \"fail\"))\n            status = ES_FAIL;\n        else if (!result.compare(0, 7, \"invalid\"))\n            status = ES_INVALID;\n        else if (!result.compare(0, 4, \"skip\"))\n            status = ES_SKIP;\n        else if (!result.compare(0, 9, \"uncertain\"))\n            status = ES_UNCERTAIN;\n        exit(status);\n    } else {\n        forkStates[forkCount].url = url;\n        forkStates[forkCount].pid = pid;\n    }\n    if (++forkCount == forkMax)\n        reduce(report);\n}\n\nint main(int argc, char* argv[])\n{\n    int mode = HEADLESS;\n    unsigned timeout = 10;\n\n    int argi = 1;\n    while (*argv[argi] == '-') {\n        switch (argv[argi][1]) {\n        case 'i':\n            mode = INTERACTIVE;\n            timeout = 0;\n            break;\n        case 'r':\n            mode = REPORT;\n            break;\n        case 'u':\n            mode = UPDATE;\n            break;\n        case 'j':\n            forkMax = strtoul(argv[argi] + 2, 0, 10);\n            if (forkMax == 0)\n                forkMax = 1;\n            forkStates.resize(forkMax);\n            break;\n        default:\n            break;\n        }\n        ++argi;\n    }\n\n    if (argc < argi + 2) {\n        std::cout << \"usage: \" << argv[0] << \" [-i] report.data command [argument ...]\\n\";\n        return EXIT_FAILURE;\n    }\n\n    std::ifstream data(argv[argi]);\n    if (!data) {\n        std::cerr << \"error: \" << argv[argi] << \": no such file\\n\";\n        return EXIT_FAILURE;\n    }\n\n    std::ofstream report(\"report.data\", std::ios_base::out | std::ios_base::trunc);\n    if (!report) {\n        std::cerr << \"error: failed to open the report file\\n\";\n        return EXIT_FAILURE;\n    }\n\n    char* args[argc - argi + 3];\n    for (int i = 2; i < argc; ++i)\n        args[i - 2] = argv[i + argi - 1];\n    args[argc - argi] = args[argc - argi + 1] = args[argc - argi + 2] = 0;\n\n    std::string result;\n    std::string url;\n    std::string undo;\n    std::string userStyle;\n    std::string testFonts;\n    bool redo = false;\n    while (data) {\n        if (result == \"undo\") {\n            std::swap(url, undo);\n            redo = true;\n        } else if (redo) {\n            std::swap(url, undo);\n            redo = false;\n        } else {\n            std::string line;\n            std::getline(data, line);\n            if (line.empty())\n                continue;\n            if (line == \"testname    result  comment\") {\n                report << line << '\\n';\n                continue;\n            }\n            if (line[0] == '#') {\n                if (line.compare(1, 9, \"userstyle\") == 0) {\n                    if (10 < line.length()) {\n                        std::stringstream s(line.substr(10), std::stringstream::in);\n                        s >> userStyle;\n                    } else\n                        userStyle.clear();\n                } else if (line.compare(1, 9, \"testfonts\") == 0) {\n                    if (10 < line.length()) {\n                        std::stringstream s(line.substr(10), std::stringstream::in);\n                        s >> testFonts;\n                    } else\n                        testFonts.clear();\n                }\n                reduce(report);\n                report << line << '\\n';\n                continue;\n            }\n            undo = url;\n            std::stringstream s(line, std::stringstream::in);\n            s >> url;\n        }\n        if (url.empty())\n            continue;\n\n        switch (mode) {\n        case HEADLESS:\n        case UPDATE:\n            map(report, mode, argc - argi, args, url, userStyle, testFonts, timeout);\n            break;\n        default:\n            result = test(mode, argc - argi, args, url, userStyle, testFonts, timeout);\n            if (result != \"undo\")\n                report << url << '\\t' << result << '\\n';\n            break;\n        }\n    }\n    if (mode == HEADLESS || mode == UPDATE)\n        reduce(report);\n    report.close();\n}\n<commit_msg>(harness) : Set the exit code to EXIT_SUCCESS when there's no changes, and EXIT_FAILURE otherwise in the headless and update mode.<commit_after>\/*\n * Copyright 2011, 2012 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\/\/ A test harness for the implementation report of\n\/\/       the CSS2.1 Conformance Test Suite\n\/\/ http:\/\/test.csswg.org\/suites\/css2.1\/20110323\/\n\n#include <unistd.h>\n#include <sys\/wait.h>\n\n#include <cstring>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <boost\/version.hpp>\n#include <boost\/iostreams\/stream.hpp>\n#include <boost\/iostreams\/device\/file_descriptor.hpp>\n\nenum {\n    INTERACTIVE = 0,\n    HEADLESS,\n    REPORT,\n    UPDATE,\n\n    \/\/ exit status codes\n    ES_PASS = 0,\n    ES_FATAL,\n    ES_FAIL,\n    ES_INVALID,\n    ES_NA,\n    ES_SKIP,\n    ES_UNCERTAIN\n};\n\nconst char* StatusStrings[] = {\n    \"pass\",\n    \"fatal\",\n    \"fail\",\n    \"invalid\",\n    \"?\",\n    \"skip\",\n    \"uncertain\",\n};\n\nstruct ForkStatus {\n    pid_t       pid;\n    std::string url;\n    int         code;\npublic:\n    ForkStatus() : pid(-1), code(0) {}\n};\n\nsize_t forkMax = 1;\nsize_t forkCount = 0;\nstd::vector<ForkStatus> forkStates(1);\n\nsize_t uncertainCount = 0;\n\nint processOutput(std::istream& stream, std::string& result)\n{\n    std::string output;\n    bool completed = false;\n    while (std::getline(stream, output)) {\n        if (!completed) {\n            if (output == \"## complete\")\n                completed = true;\n            continue;\n        }\n        if (output == \"##\")\n            break;\n        result += output + '\\n';\n    }\n    return 0;\n}\n\nint runTest(int argc, char* argv[], std::string userStyle, std::string testFonts, std::string url, std::string& result, unsigned timeout)\n{\n    int pipefd[2];\n    pipe(pipefd);\n\n    pid_t pid = fork();\n    if (pid == -1) {\n        std::cerr << \"error: no more process to create\\n\";\n        return -1;\n    }\n    if (pid == 0) {\n        close(1);\n        dup(pipefd[1]);\n        close(pipefd[0]);\n        int argi = argc - 1;\n        if (!userStyle.empty())\n            argv[argi++] = strdup(userStyle.c_str());\n        if (testFonts == \"on\")\n            argv[argi++] =\"-testfonts\";\n        url = \"http:\/\/localhost:8000\/\" + url;\n        \/\/ url = \"http:\/\/test.csswg.org\/suites\/css2.1\/20110323\/\" + url;\n        argv[argi++] = strdup(url.c_str());\n        argv[argi] = 0;\n        if (timeout)\n            alarm(timeout); \/\/ Terminate the process if it does not complete in 'timeout' seconds.\n        execvp(argv[0], argv);\n        exit(EXIT_FAILURE);\n    }\n    close(pipefd[1]);\n\n#if 104400 <= BOOST_VERSION\n    boost::iostreams::stream<boost::iostreams::file_descriptor_source> stream(pipefd[0], boost::iostreams::close_handle);\n#else\n    boost::iostreams::stream<boost::iostreams::file_descriptor_source> stream(pipefd[0], true);\n#endif\n    processOutput(stream, result);\n    return pid;\n}\n\nvoid killTest(int pid)\n{\n    int status;\n    kill(pid, SIGTERM);\n    if (wait(&status) == -1)\n        std::cerr << \"error: failed to wait for a test process to complete\\n\";\n}\n\nbool loadLog(const std::string& path, std::string& result, std::string& log)\n{\n    std::ifstream file(path.c_str());\n    if (!file) {\n        result = \"?\";\n        return false;\n    }\n    std::string line;\n    std::getline(file, line);\n    size_t pos = line.find('\\t');\n    if (pos != std::string::npos)\n        result = line.substr(pos + 1);\n    else {\n        result = \"?\";\n        return false;\n    }\n    log.clear();\n    while (std::getline(file, line))\n        log += line + '\\n';\n    return true;\n}\n\nbool saveLog(const std::string& path, const std::string& url, const std::string& result, const std::string& log)\n{\n    std::ofstream file(path.c_str(), std::ios_base::out | std::ios_base::trunc);\n    if (!file) {\n        std::cerr << \"error: failed to open the report file\\n\";\n        return false;\n    }\n    file << \"# \" << url.c_str() << '\\t' << result << '\\n' << log;\n    file.flush();\n    file.close();\n    return true;\n}\n\nstd::string test(int mode, int argc, char* argv[], const std::string& url, const std::string& userStyle, const std::string& testFonts, unsigned timeout)\n{\n    std::string path(url);\n    size_t pos = path.rfind('.');\n    if (pos != std::string::npos) {\n        path.erase(pos);\n        path += \".log\";\n    }\n    std::string evaluation;\n    std::string log;\n    loadLog(path, evaluation, log);\n\n    pid_t pid = -1;\n    std::string output;\n    switch (mode) {\n    case REPORT:\n        break;\n    case UPDATE:\n        if (evaluation[0] == '?')\n            break;\n        \/\/ FALL THROUGH\n    default:\n        pid = runTest(argc, argv, userStyle, testFonts, url, output, timeout);\n        break;\n    }\n\n    std::string result;\n    if (0 < pid && output.empty())\n        result = \"fatal\";\n    else if (mode == INTERACTIVE) {\n        std::cout << \"## complete\\n\" << output;\n        std::cout << '[' << url << \"] \";\n        if (evaluation.empty() || evaluation[0] == '?')\n            std::cout << \"pass? \";\n        else {\n            std::cout << evaluation << \"? \";\n            if (evaluation != \"pass\")\n                std::cout << '\\a';\n        }\n        std::getline(std::cin, result);\n        if (result.empty()) {\n            if (evaluation.empty() || evaluation[0] == '?')\n                result = \"pass\";\n            else\n                result = evaluation;\n        } else if (result == \"p\" || result == \"\\x1b\")\n            result = \"pass\";\n        else if (result == \"f\")\n            result = \"fail\";\n        else if (result == \"i\")\n            result = \"invalid\";\n        else if (result == \"k\") \/\/ keep\n            result = evaluation;\n        else if (result == \"n\")\n            result = \"na\";\n        else if (result == \"s\")\n            result = \"skip\";\n        else if (result == \"u\")\n            result = \"uncertain\";\n        else if (result == \"q\" || result == \"quit\")\n            exit(EXIT_FAILURE);\n        else if (result == \"z\")\n            result = \"undo\";\n        if (result != \"undo\" && !saveLog(path, url, result, output)) {\n            std::cerr << \"error: failed to open the report file\\n\";\n            exit(EXIT_FAILURE);\n        }\n    } else if (mode == HEADLESS) {\n        if (evaluation != \"?\" && output != log)\n            result = \"uncertain\";\n        else\n            result = evaluation;\n    } else if (mode == REPORT) {\n        result = evaluation;\n    } else if (mode == UPDATE) {\n        result = evaluation;\n        if (result[0] != '?') {\n            if (!saveLog(path, url, result, output)) {\n                std::cerr << \"error: failed to open the report file\\n\";\n                exit(EXIT_FAILURE);\n            }\n        }\n    }\n\n    if (0 < pid)\n        killTest(pid);\n    if (mode != INTERACTIVE && result[0] != '?')\n        std::cout << url << '\\t' << result << '\\n';\n    return result;\n}\n\nvoid reduce(std::ostream& report)\n{\n    for (int i = 0; i < forkCount; ++i) {\n        int status;\n        pid_t pid = wait(&status);\n        for (int j = 0; j < forkCount; ++j) {\n            if (forkStates[j].pid == pid) {\n                forkStates[j].pid = -1;\n                forkStates[j].code = WIFEXITED(status) ? WEXITSTATUS(status) : ES_FATAL;\n                break;\n            }\n        }\n    }\n    for (int i = 0; i < forkCount; ++i) {\n        if (forkStates[i].code == ES_UNCERTAIN)\n            ++uncertainCount;\n        if (forkStates[i].code != ES_NA)\n            std::cout << forkStates[i].url << '\\t' << StatusStrings[forkStates[i].code] << '\\n';\n        report << forkStates[i].url << '\\t' << StatusStrings[forkStates[i].code] << '\\n';\n    }\n    forkCount = 0;\n}\n\nvoid map(std::ostream& report, int mode, int argc, char* argv[], const std::string& url, const std::string& userStyle, const std::string& testFonts, unsigned timeout)\n{\n    pid_t pid = fork();\n    if (pid == -1) {\n        std::cerr << \"error: no more process to create\\n\";\n        exit(EXIT_FAILURE);\n    }\n    if (pid == 0) {\n        std::string path(url);\n        size_t pos = path.rfind('.');\n        if (pos != std::string::npos) {\n            path.erase(pos);\n            path += \".log\";\n        }\n        std::string evaluation;\n        std::string log;\n        loadLog(path, evaluation, log);\n\n        pid_t pid = -1;\n        std::string output;\n        switch (mode) {\n        case UPDATE:\n            if (evaluation[0] == '?')\n                break;\n            \/\/ FALL THROUGH\n        default:\n            pid = runTest(argc, argv, userStyle, testFonts, url, output, timeout);\n            break;\n        }\n\n        std::string result;\n        if (0 < pid && output.empty())\n            result = \"fatal\";\n        else if (mode == HEADLESS) {\n            if (evaluation != \"?\" && output != log)\n                result = \"uncertain\";\n            else\n                result = evaluation;\n        } else if (mode == UPDATE) {\n            result = evaluation;\n            if (result[0] != '?') {\n                if (!saveLog(path, url, result, output)) {\n                    std::cerr << \"error: failed to open the report file\\n\";\n                    exit(EXIT_FAILURE);\n                }\n            }\n        }\n        if (0 < pid)\n            killTest(pid);\n        int status = ES_NA;\n        if (!result.compare(0, 4, \"pass\"))\n            status = ES_PASS;\n        else if (!result.compare(0, 5, \"fatal\"))\n            status = ES_FATAL;\n        else if (!result.compare(0, 4, \"fail\"))\n            status = ES_FAIL;\n        else if (!result.compare(0, 7, \"invalid\"))\n            status = ES_INVALID;\n        else if (!result.compare(0, 4, \"skip\"))\n            status = ES_SKIP;\n        else if (!result.compare(0, 9, \"uncertain\"))\n            status = ES_UNCERTAIN;\n        exit(status);\n    } else {\n        forkStates[forkCount].url = url;\n        forkStates[forkCount].pid = pid;\n    }\n    if (++forkCount == forkMax)\n        reduce(report);\n}\n\nint main(int argc, char* argv[])\n{\n    int mode = HEADLESS;\n    unsigned timeout = 10;\n\n    int argi = 1;\n    while (*argv[argi] == '-') {\n        switch (argv[argi][1]) {\n        case 'i':\n            mode = INTERACTIVE;\n            timeout = 0;\n            break;\n        case 'r':\n            mode = REPORT;\n            break;\n        case 'u':\n            mode = UPDATE;\n            break;\n        case 'j':\n            forkMax = strtoul(argv[argi] + 2, 0, 10);\n            if (forkMax == 0)\n                forkMax = 1;\n            forkStates.resize(forkMax);\n            break;\n        default:\n            break;\n        }\n        ++argi;\n    }\n\n    if (argc < argi + 2) {\n        std::cout << \"usage: \" << argv[0] << \" [-i] report.data command [argument ...]\\n\";\n        return EXIT_FAILURE;\n    }\n\n    std::ifstream data(argv[argi]);\n    if (!data) {\n        std::cerr << \"error: \" << argv[argi] << \": no such file\\n\";\n        return EXIT_FAILURE;\n    }\n\n    std::ofstream report(\"report.data\", std::ios_base::out | std::ios_base::trunc);\n    if (!report) {\n        std::cerr << \"error: failed to open the report file\\n\";\n        return EXIT_FAILURE;\n    }\n\n    char* args[argc - argi + 3];\n    for (int i = 2; i < argc; ++i)\n        args[i - 2] = argv[i + argi - 1];\n    args[argc - argi] = args[argc - argi + 1] = args[argc - argi + 2] = 0;\n\n    std::string result;\n    std::string url;\n    std::string undo;\n    std::string userStyle;\n    std::string testFonts;\n    bool redo = false;\n    while (data) {\n        if (result == \"undo\") {\n            std::swap(url, undo);\n            redo = true;\n        } else if (redo) {\n            std::swap(url, undo);\n            redo = false;\n        } else {\n            std::string line;\n            std::getline(data, line);\n            if (line.empty())\n                continue;\n            if (line == \"testname    result  comment\") {\n                report << line << '\\n';\n                continue;\n            }\n            if (line[0] == '#') {\n                if (line.compare(1, 9, \"userstyle\") == 0) {\n                    if (10 < line.length()) {\n                        std::stringstream s(line.substr(10), std::stringstream::in);\n                        s >> userStyle;\n                    } else\n                        userStyle.clear();\n                } else if (line.compare(1, 9, \"testfonts\") == 0) {\n                    if (10 < line.length()) {\n                        std::stringstream s(line.substr(10), std::stringstream::in);\n                        s >> testFonts;\n                    } else\n                        testFonts.clear();\n                }\n                reduce(report);\n                report << line << '\\n';\n                continue;\n            }\n            undo = url;\n            std::stringstream s(line, std::stringstream::in);\n            s >> url;\n        }\n        if (url.empty())\n            continue;\n\n        switch (mode) {\n        case HEADLESS:\n        case UPDATE:\n            map(report, mode, argc - argi, args, url, userStyle, testFonts, timeout);\n            break;\n        default:\n            result = test(mode, argc - argi, args, url, userStyle, testFonts, timeout);\n            if (result != \"undo\")\n                report << url << '\\t' << result << '\\n';\n            break;\n        }\n    }\n    if (mode == HEADLESS || mode == UPDATE)\n        reduce(report);\n    report.close();\n\n    return (0 < uncertainCount) ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef HAND_ROLLED_INCLUDED__\n#define HAND_ROLLED_INCLUDED__\n\n#include <cassert>\n#include <functional>\n#include <iostream>\n#include <memory>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n\n\/\/ Variation 1: Accept std::reference_wrapper<>.\n#ifndef ACCEPT_REFERENCE_WRAPPER\n#define ACCEPT_REFERENCE_WRAPPER 1\n#endif\n\n#ifndef INSTRUMENT_COPIES\n#define INSTRUMENT_COPIES 1\n#endif\n\n#if INSTRUMENT_COPIES\nstd::size_t& allocations ()\n{\n    static std::size_t allocations_ = 0;\n    return allocations_;\n}\n\nvoid reset_allocations ()\n{ allocations() = 0; }\n#endif\n\nclass any_printable\n{\npublic:\n    \/\/ Contructors\n    any_printable () = default;\n\n    template <typename T>\n    any_printable (T value) :\n        handle_ (\n            new handle<typename std::remove_reference<T>::type>(\n                std::forward<T>(value)\n            )\n        )\n    {\n#if INSTRUMENT_COPIES\n        ++allocations();\n#endif\n    }\n\n    any_printable (const any_printable & rhs) :\n        handle_ (rhs.handle_->clone())\n    {}\n\n    any_printable (any_printable && rhs) noexcept = default;\n\n    \/\/ Assignment\n    template <typename T>\n    any_printable& operator= (T value)\n    {\n        any_printable temp(std::forward<T>(value));\n        std::swap(temp, *this);\n        return *this;\n    }\n\n    any_printable & operator= (const any_printable & rhs)\n    {\n        any_printable temp(rhs);\n        std::swap(temp, *this);\n        return *this;\n    }\n\n    any_printable & operator= (any_printable && rhs) noexcept = default;\n\n    \/\/ Public interface\n    void print () const\n    {\n        assert(handle_);\n        handle_->print();\n    }\n\nprivate:\n    struct handle_base\n    {\n        virtual ~handle_base () {}\n        virtual handle_base* clone () const = 0;\n\n        \/\/ Public interface\n        virtual void print () const = 0;\n    };\n\n    template <typename T>\n    struct handle :\n        handle_base\n    {\n#if ACCEPT_REFERENCE_WRAPPER\n        template <typename U = T>\n        handle (T value,\n                typename std::enable_if<\n                    std::is_reference<U>::value\n                >::type* = 0) :\n            value_ (value)\n        {}\n\n        template <typename U = T>\n        handle (T value,\n                typename std::enable_if<\n                    !std::is_reference<U>::value,\n                    int\n                >::type* = 0) noexcept :\n            value_ (std::move(value))\n        {}\n#else\n        handle (T value) :\n            value_ (value)\n        {}\n\n        handle (T && value) noexcept :\n            value_ (std::move(value))\n        {}\n#endif\n\n        virtual handle_base* clone () const\n        {\n#if INSTRUMENT_COPIES\n            ++allocations();\n#endif\n            return new handle(value_);\n        }\n\n        \/\/ Public interface\n        virtual void print () const\n        { value_.print(); }\n\n        T value_;\n    };\n\n#if ACCEPT_REFERENCE_WRAPPER\n    template <typename T>\n    struct handle<std::reference_wrapper<T>> :\n        handle<T &>\n    {\n        handle (std::reference_wrapper<T> ref) :\n            handle<T &> (ref.get())\n        {}\n    };\n#endif\n\n    std::unique_ptr<handle_base> handle_;\n};\n\n\nstruct hi_printable\n{\n    void print () const\n    { std::cout << \"Hello, world!\\n\"; }\n};\n\nstruct bye_printable\n{\n    void print () const\n    { std::cout << \"Bye, now!\\n\"; }\n};\n\nstruct large_printable :\n    std::vector<std::string>\n{\n    large_printable () :\n        std::vector<std::string> (1000, std::string(1000, ' '))\n    { ++allocations(); }\n\n    large_printable (const large_printable & rhs) :\n        std::vector<std::string> (rhs)\n    { ++allocations(); }\n\n    large_printable & operator= (const large_printable & rhs)\n    {\n        ++allocations();\n        static_cast<std::vector<std::string> &>(*this) = rhs;\n        return *this;\n    }\n\n    large_printable (large_printable && rhs) = default;\n    large_printable & operator= (large_printable && rhs) = default;\n\n    void print () const\n    { std::cout << \"I'm expensive to copy.\\n\"; }\n};\n\n\n\/* Limitations:\n   1 - Each member functions must be repeated in 3 places.\n   2 - Macros, which could be used to address this, are evil.\n   3 - How do you define an any_fooable type, where foo() is a free function?\n   4 - How do you define an any_barable type, where bar is an operator?\n*\/\n\n#endif\n<commit_msg>Add limitation note about SBO.<commit_after>#ifndef HAND_ROLLED_INCLUDED__\n#define HAND_ROLLED_INCLUDED__\n\n#include <cassert>\n#include <functional>\n#include <iostream>\n#include <memory>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n\n\/\/ Variation 1: Accept std::reference_wrapper<>.\n#ifndef ACCEPT_REFERENCE_WRAPPER\n#define ACCEPT_REFERENCE_WRAPPER 1\n#endif\n\n#ifndef INSTRUMENT_COPIES\n#define INSTRUMENT_COPIES 1\n#endif\n\n#if INSTRUMENT_COPIES\nstd::size_t& allocations ()\n{\n    static std::size_t allocations_ = 0;\n    return allocations_;\n}\n\nvoid reset_allocations ()\n{ allocations() = 0; }\n#endif\n\nclass any_printable\n{\npublic:\n    \/\/ Contructors\n    any_printable () = default;\n\n    template <typename T>\n    any_printable (T value) :\n        handle_ (\n            new handle<typename std::remove_reference<T>::type>(\n                std::forward<T>(value)\n            )\n        )\n    {\n#if INSTRUMENT_COPIES\n        ++allocations();\n#endif\n    }\n\n    any_printable (const any_printable & rhs) :\n        handle_ (rhs.handle_->clone())\n    {}\n\n    any_printable (any_printable && rhs) noexcept = default;\n\n    \/\/ Assignment\n    template <typename T>\n    any_printable& operator= (T value)\n    {\n        any_printable temp(std::forward<T>(value));\n        std::swap(temp, *this);\n        return *this;\n    }\n\n    any_printable & operator= (const any_printable & rhs)\n    {\n        any_printable temp(rhs);\n        std::swap(temp, *this);\n        return *this;\n    }\n\n    any_printable & operator= (any_printable && rhs) noexcept = default;\n\n    \/\/ Public interface\n    void print () const\n    {\n        assert(handle_);\n        handle_->print();\n    }\n\nprivate:\n    struct handle_base\n    {\n        virtual ~handle_base () {}\n        virtual handle_base* clone () const = 0;\n\n        \/\/ Public interface\n        virtual void print () const = 0;\n    };\n\n    template <typename T>\n    struct handle :\n        handle_base\n    {\n#if ACCEPT_REFERENCE_WRAPPER\n        template <typename U = T>\n        handle (T value,\n                typename std::enable_if<\n                    std::is_reference<U>::value\n                >::type* = 0) :\n            value_ (value)\n        {}\n\n        template <typename U = T>\n        handle (T value,\n                typename std::enable_if<\n                    !std::is_reference<U>::value,\n                    int\n                >::type* = 0) noexcept :\n            value_ (std::move(value))\n        {}\n#else\n        handle (T value) :\n            value_ (value)\n        {}\n\n        handle (T && value) noexcept :\n            value_ (std::move(value))\n        {}\n#endif\n\n        virtual handle_base* clone () const\n        {\n#if INSTRUMENT_COPIES\n            ++allocations();\n#endif\n            return new handle(value_);\n        }\n\n        \/\/ Public interface\n        virtual void print () const\n        { value_.print(); }\n\n        T value_;\n    };\n\n#if ACCEPT_REFERENCE_WRAPPER\n    template <typename T>\n    struct handle<std::reference_wrapper<T>> :\n        handle<T &>\n    {\n        handle (std::reference_wrapper<T> ref) :\n            handle<T &> (ref.get())\n        {}\n    };\n#endif\n\n    std::unique_ptr<handle_base> handle_;\n};\n\n\nstruct hi_printable\n{\n    void print () const\n    { std::cout << \"Hello, world!\\n\"; }\n};\n\nstruct bye_printable\n{\n    void print () const\n    { std::cout << \"Bye, now!\\n\"; }\n};\n\nstruct large_printable :\n    std::vector<std::string>\n{\n    large_printable () :\n        std::vector<std::string> (1000, std::string(1000, ' '))\n    { ++allocations(); }\n\n    large_printable (const large_printable & rhs) :\n        std::vector<std::string> (rhs)\n    { ++allocations(); }\n\n    large_printable & operator= (const large_printable & rhs)\n    {\n        ++allocations();\n        static_cast<std::vector<std::string> &>(*this) = rhs;\n        return *this;\n    }\n\n    large_printable (large_printable && rhs) = default;\n    large_printable & operator= (large_printable && rhs) = default;\n\n    void print () const\n    { std::cout << \"I'm expensive to copy.\\n\"; }\n};\n\n\n\/* Limitations:\n   1 - Each member functions must be repeated in 3 places.\n   2 - Macros, which could be used to address this, are evil.\n   3 - How do you define an any_fooable type, where foo() is a free function?\n   4 - How do you define an any_barable type, where bar is an operator?\n   5 - How do you apply the small buffer optimization to handle small types without making allocations?\n*\/\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2012-2013 Luis Pedro Coelho <luis@luispedro.org>\n\/\/ License: MIT (see COPYING.MIT file)\n\n\n#if defined(_MSC_VER)\n #include <io.h>\n#else\n #include <unistd.h>\n #include <sys\/types.h>\n #include <sys\/stat.h>\n #include <fcntl.h>\n #ifndef O_BINARY\n  const int O_BINARY = 0;\n #endif\n#endif\n\n#include <sstream>\n\n#include \"lib\/base.h\"\n#include \"lib\/formats.h\"\n#include \"lib\/file.h\"\n#include \"lib\/memory.h\"\n#include \"lib\/numpy.h\"\n#include <Python.h>\n#include <numpy\/ndarrayobject.h>\n#include <errno.h>\n\nnamespace{\n\n\nconst char* get_blob(PyObject* data, size_t& len) {\n#if PY_MAJOR_VERSION < 3\n    if (!PyString_Check(data)) return 0;\n    len = PyString_Size(data);\n    return PyString_AsString(data);\n#else\n    len = PyBytes_Size(data);\n    if (!PyBytes_Check(data)) return 0;\n    return PyBytes_AsString(data);\n#endif\n}\n\n\nconst char* get_cstring(PyObject* stro) {\n#if PY_MAJOR_VERSION < 3\n    if (!PyString_Check(stro)) return 0;\n    return PyString_AsString(stro);\n#else\n    if (!PyUnicode_Check(stro)) return 0;\n    return PyUnicode_AsUTF8(stro);\n#endif\n}\n\n\noptions_map parse_options(PyObject* dict) {\n    options_map res;\n    if (!PyDict_Check(dict)) return res;\n    PyObject *key, *value;\n    Py_ssize_t pos = 0;\n\n    while (PyDict_Next(dict, &pos, &key, &value)) {\n        std::string k = get_cstring(key);\n        if (PyLong_Check(value)) {\n            res[k] = number_or_string(int(PyLong_AsLong(value)));\n#if PY_MAJOR_VERSION < 3\n        } else if (PyInt_Check(value)) {\n            res[k] = number_or_string(int(PyInt_AS_LONG(value)));\n#endif\n        } else if (PyFloat_Check(value)) {\n            res[k] = number_or_string(PyFloat_AS_DOUBLE(value));\n#if PY_MAJOR_VERSION >= 3\n        } else if (PyBytes_check(value)) {\n            size_t len;\n            const char* blob = get_blob(value, len);\n            res[k] = number_or_string(std::string(blob, len));\n#endif\n        } else {\n            const char* c = get_cstring(value);\n            if (!c) {\n                std::stringstream ss;\n                ss << \"Error while parsing option value for '\" << k << \"': type was not understood.\";\n                throw OptionsError(ss.str());\n            }\n            res[k] = number_or_string(std::string(c));\n        }\n    }\n    return res;\n}\n\nconst char TypeErrorMsg[] =\n    \"Type not understood. \"\n    \"This is caused by either a direct call to _imread (which is dangerous: types are not checked!) or a bug in imread.py.\\n\";\n\nPyObject* py_imread_may_multi(PyObject* self, PyObject* args, bool is_multi, bool is_blob) {\n    PyObject* filename_or_blob_object;\n    const char* formatstr;\n    const char* flags;\n    if (!PyArg_ParseTuple(args, \"Oss\", &filename_or_blob_object, &formatstr, &flags)) {\n        PyErr_SetString(PyExc_RuntimeError,TypeErrorMsg);\n        return NULL;\n    }\n    options_map opts;\n\n    try {\n        std::auto_ptr<ImageFormat> format(get_format(formatstr));\n        if (!format.get()) {\n            std::stringstream ss;\n            ss << \"This format (\" << formatstr << \") is unknown to imread\";\n            throw CannotReadError(ss.str());\n        }\n        if (is_multi && !format->can_read_multi()) {\n            std::stringstream ss;\n            ss << \"imread cannot read_multi in this format (\" << formatstr << \")\";\n            if (format->can_read()) {\n                ss << \" but read() will work.\";\n            }\n            throw CannotReadError(ss.str());\n        }\n        if (!is_multi && !format->can_read()) {\n            std::stringstream ss;\n            ss << \"imread cannot read_in this format (\" << formatstr << \")\";\n            if (format->can_read_multi()) {\n                ss << \"(but can read_multi!)\";\n            }\n            throw CannotReadError(ss.str());\n        }\n\n        NumpyFactory factory;\n        std::auto_ptr<byte_source> input;\n        if (is_blob) {\n            size_t len;\n            const char* data = get_blob(filename_or_blob_object, len);\n            if (!data) return 0;\n            input = std::auto_ptr<byte_source>(new memory_source(reinterpret_cast<const byte*>(data), len));\n        } else {\n            const char* filename = get_cstring(filename_or_blob_object);\n            if (!filename) return 0;\n            int fd = ::open(filename, O_RDONLY|O_BINARY);\n            if (fd < 0) {\n                std::stringstream ss;\n                if (errno == EACCES) {\n                    ss << \"Permission error when opening `\" << filename << \"`\";\n                } else if (errno == ENOENT) {\n                    ss << \"File `\" << filename << \"` does not exist\";\n                } else {\n                    ss << \"Unknown error opening `\" << filename << \"`.\";\n                }\n                PyErr_SetString(PyExc_OSError, ss.str().c_str());\n                return 0;\n            }\n            input = std::auto_ptr<byte_source>(new fd_source_sink(fd));\n        }\n        if (is_multi) {\n            std::auto_ptr<image_list> images = format->read_multi(input.get(), &factory, opts);\n            PyObject* output = PyList_New(images->size());\n            if (!output) return NULL;\n            std::vector<Image*> pages = images->release();\n            for (unsigned i = 0; i != pages.size(); ++i) {\n                PyList_SET_ITEM(output, i, static_cast<NumpyImage&>(*pages[i]).releasePyObject());\n                delete pages[i];\n            }\n            return output;\n        } else {\n            std::auto_ptr<Image> output = format->read(input.get(), &factory, opts);\n            PyObject* final = PyTuple_New(2);\n            if (!final) return NULL;\n            PyTuple_SET_ITEM(final, 0, static_cast<NumpyImage&>(*output).releasePyObject());\n            PyTuple_SET_ITEM(final, 1, static_cast<NumpyImage&>(*output).metadataPyObject());\n            return final;\n        }\n    } catch (const std::exception& e) {\n        PyErr_SetString(PyExc_RuntimeError, e.what());\n        return 0;\n    } catch (...) {\n        PyErr_SetString(PyExc_RuntimeError, \"Mysterious error\");\n        return 0;\n    }\n}\n\nPyObject* py_imread             (PyObject* self, PyObject* args) { return py_imread_may_multi(self, args, false, false); }\nPyObject* py_imread_multi       (PyObject* self, PyObject* args) { return py_imread_may_multi(self, args,  true, false); }\nPyObject* py_imread_from_blob   (PyObject* self, PyObject* args) { return py_imread_may_multi(self, args, false, true); }\n\nPyObject* py_imsave(PyObject* self, PyObject* args) {\n    const char* filename;\n    const char* formatstr;\n    const char* meta = 0;\n    PyObject* formatstrObject;\n    PyArrayObject* array;\n    PyObject* asUtf8 = NULL;\n    PyObject* optsDict;\n    if (!PyArg_ParseTuple(args, \"sOOO\", &filename, &formatstrObject, &array, &optsDict)) return NULL;\n    if (!PyArray_Check(array)) {\n        PyErr_SetString(PyExc_RuntimeError,TypeErrorMsg);\n        return NULL;\n    }\n\n\n    formatstr = get_cstring(formatstrObject);\n    if (!formatstr) {\n        PyErr_SetString(PyExc_TypeError, \"imread.imsave: Expected a string as formatstr\");\n        return NULL;\n    }\n    try {\n        options_map opts = parse_options(optsDict);\n        std::auto_ptr<ImageFormat> format(get_format(formatstr));\n        if (!format.get() || !format->can_write()) {\n            std::stringstream ss;\n            ss << \"Cannot write this format (\" << formatstr << \")\";\n            throw CannotWriteError(ss.str());\n        }\n\n        const int fd = ::open(filename, O_CREAT|O_WRONLY|O_BINARY|O_TRUNC, 0644);\n        if (fd < 0) {\n            std::stringstream ss;\n            ss << \"Cannot open file '\" << filename << \"' for writing\";\n            throw CannotWriteError(ss.str());\n        }\n\n        std::auto_ptr<byte_sink> output(new fd_source_sink(fd));\n\n        \/\/ ~NumpyImage() will decrease the count\n        Py_INCREF(array);\n        NumpyImage input(array);\n        format->write(&input, output.get(), opts);\n\n        Py_XDECREF(asUtf8);\n        Py_RETURN_NONE;\n    } catch (const std::exception& e) {\n        PyErr_SetString(PyExc_RuntimeError, e.what());\n        Py_XDECREF(asUtf8);\n        return 0;\n    } catch (...) {\n        PyErr_SetString(PyExc_RuntimeError, \"Mysterious error\");\n        Py_XDECREF(asUtf8);\n        return 0;\n    }\n}\n\n\nPyMethodDef methods[] = {\n  {\"imread\",(PyCFunction)py_imread, METH_VARARGS, NULL},\n  {\"imread_multi\",(PyCFunction)py_imread_multi, METH_VARARGS, NULL},\n  {\"imread_from_blob\",(PyCFunction)py_imread_from_blob, METH_VARARGS, NULL},\n  {\"imsave\",(PyCFunction)py_imsave, METH_VARARGS, NULL},\n  {NULL, NULL,0,NULL},\n};\n\n} \/\/ namespace\n\n#if PY_MAJOR_VERSION < 3\nPyMODINIT_FUNC\ninit_imread()\n  {\n    import_array();\n    (void)Py_InitModule(\"_imread\", methods);\n  }\n#else\n\nstatic struct PyModuleDef moduledef = {\n        PyModuleDef_HEAD_INIT,\n        \"_imread\",\n        NULL,\n        -1,\n        methods,\n        NULL,\n        NULL,\n        NULL,\n        NULL\n};\n\nPyMODINIT_FUNC\nPyInit__imread()\n  {\n    import_array();\n    PyObject *module = PyModule_Create(&moduledef);\n    return module;\n  }\n#endif\n<commit_msg>PY3 Fix compilation in Python 3<commit_after>\/\/ Copyright 2012-2013 Luis Pedro Coelho <luis@luispedro.org>\n\/\/ License: MIT (see COPYING.MIT file)\n\n\n#if defined(_MSC_VER)\n #include <io.h>\n#else\n #include <unistd.h>\n #include <sys\/types.h>\n #include <sys\/stat.h>\n #include <fcntl.h>\n #ifndef O_BINARY\n  const int O_BINARY = 0;\n #endif\n#endif\n\n#include <sstream>\n\n#include \"lib\/base.h\"\n#include \"lib\/formats.h\"\n#include \"lib\/file.h\"\n#include \"lib\/memory.h\"\n#include \"lib\/numpy.h\"\n#include <Python.h>\n#include <numpy\/ndarrayobject.h>\n#include <errno.h>\n\nnamespace{\n\n\nconst char* get_blob(PyObject* data, size_t& len) {\n#if PY_MAJOR_VERSION < 3\n    if (!PyString_Check(data)) return 0;\n    len = PyString_Size(data);\n    return PyString_AsString(data);\n#else\n    len = PyBytes_Size(data);\n    if (!PyBytes_Check(data)) return 0;\n    return PyBytes_AsString(data);\n#endif\n}\n\n\nconst char* get_cstring(PyObject* stro) {\n#if PY_MAJOR_VERSION < 3\n    if (!PyString_Check(stro)) return 0;\n    return PyString_AsString(stro);\n#else\n    if (!PyUnicode_Check(stro)) return 0;\n    return PyUnicode_AsUTF8(stro);\n#endif\n}\n\n\noptions_map parse_options(PyObject* dict) {\n    options_map res;\n    if (!PyDict_Check(dict)) return res;\n    PyObject *key, *value;\n    Py_ssize_t pos = 0;\n\n    while (PyDict_Next(dict, &pos, &key, &value)) {\n        std::string k = get_cstring(key);\n        if (PyLong_Check(value)) {\n            res[k] = number_or_string(int(PyLong_AsLong(value)));\n#if PY_MAJOR_VERSION < 3\n        } else if (PyInt_Check(value)) {\n            res[k] = number_or_string(int(PyInt_AS_LONG(value)));\n#endif\n        } else if (PyFloat_Check(value)) {\n            res[k] = number_or_string(PyFloat_AS_DOUBLE(value));\n#if PY_MAJOR_VERSION >= 3\n        } else if (PyBytes_Check(value)) {\n            size_t len;\n            const char* blob = get_blob(value, len);\n            res[k] = number_or_string(std::string(blob, len));\n#endif\n        } else {\n            const char* c = get_cstring(value);\n            if (!c) {\n                std::stringstream ss;\n                ss << \"Error while parsing option value for '\" << k << \"': type was not understood.\";\n                throw OptionsError(ss.str());\n            }\n            res[k] = number_or_string(std::string(c));\n        }\n    }\n    return res;\n}\n\nconst char TypeErrorMsg[] =\n    \"Type not understood. \"\n    \"This is caused by either a direct call to _imread (which is dangerous: types are not checked!) or a bug in imread.py.\\n\";\n\nPyObject* py_imread_may_multi(PyObject* self, PyObject* args, bool is_multi, bool is_blob) {\n    PyObject* filename_or_blob_object;\n    const char* formatstr;\n    const char* flags;\n    if (!PyArg_ParseTuple(args, \"Oss\", &filename_or_blob_object, &formatstr, &flags)) {\n        PyErr_SetString(PyExc_RuntimeError,TypeErrorMsg);\n        return NULL;\n    }\n    options_map opts;\n\n    try {\n        std::auto_ptr<ImageFormat> format(get_format(formatstr));\n        if (!format.get()) {\n            std::stringstream ss;\n            ss << \"This format (\" << formatstr << \") is unknown to imread\";\n            throw CannotReadError(ss.str());\n        }\n        if (is_multi && !format->can_read_multi()) {\n            std::stringstream ss;\n            ss << \"imread cannot read_multi in this format (\" << formatstr << \")\";\n            if (format->can_read()) {\n                ss << \" but read() will work.\";\n            }\n            throw CannotReadError(ss.str());\n        }\n        if (!is_multi && !format->can_read()) {\n            std::stringstream ss;\n            ss << \"imread cannot read_in this format (\" << formatstr << \")\";\n            if (format->can_read_multi()) {\n                ss << \"(but can read_multi!)\";\n            }\n            throw CannotReadError(ss.str());\n        }\n\n        NumpyFactory factory;\n        std::auto_ptr<byte_source> input;\n        if (is_blob) {\n            size_t len;\n            const char* data = get_blob(filename_or_blob_object, len);\n            if (!data) return 0;\n            input = std::auto_ptr<byte_source>(new memory_source(reinterpret_cast<const byte*>(data), len));\n        } else {\n            const char* filename = get_cstring(filename_or_blob_object);\n            if (!filename) return 0;\n            int fd = ::open(filename, O_RDONLY|O_BINARY);\n            if (fd < 0) {\n                std::stringstream ss;\n                if (errno == EACCES) {\n                    ss << \"Permission error when opening `\" << filename << \"`\";\n                } else if (errno == ENOENT) {\n                    ss << \"File `\" << filename << \"` does not exist\";\n                } else {\n                    ss << \"Unknown error opening `\" << filename << \"`.\";\n                }\n                PyErr_SetString(PyExc_OSError, ss.str().c_str());\n                return 0;\n            }\n            input = std::auto_ptr<byte_source>(new fd_source_sink(fd));\n        }\n        if (is_multi) {\n            std::auto_ptr<image_list> images = format->read_multi(input.get(), &factory, opts);\n            PyObject* output = PyList_New(images->size());\n            if (!output) return NULL;\n            std::vector<Image*> pages = images->release();\n            for (unsigned i = 0; i != pages.size(); ++i) {\n                PyList_SET_ITEM(output, i, static_cast<NumpyImage&>(*pages[i]).releasePyObject());\n                delete pages[i];\n            }\n            return output;\n        } else {\n            std::auto_ptr<Image> output = format->read(input.get(), &factory, opts);\n            PyObject* final = PyTuple_New(2);\n            if (!final) return NULL;\n            PyTuple_SET_ITEM(final, 0, static_cast<NumpyImage&>(*output).releasePyObject());\n            PyTuple_SET_ITEM(final, 1, static_cast<NumpyImage&>(*output).metadataPyObject());\n            return final;\n        }\n    } catch (const std::exception& e) {\n        PyErr_SetString(PyExc_RuntimeError, e.what());\n        return 0;\n    } catch (...) {\n        PyErr_SetString(PyExc_RuntimeError, \"Mysterious error\");\n        return 0;\n    }\n}\n\nPyObject* py_imread             (PyObject* self, PyObject* args) { return py_imread_may_multi(self, args, false, false); }\nPyObject* py_imread_multi       (PyObject* self, PyObject* args) { return py_imread_may_multi(self, args,  true, false); }\nPyObject* py_imread_from_blob   (PyObject* self, PyObject* args) { return py_imread_may_multi(self, args, false, true); }\n\nPyObject* py_imsave(PyObject* self, PyObject* args) {\n    const char* filename;\n    const char* formatstr;\n    PyObject* formatstrObject;\n    PyArrayObject* array;\n    PyObject* asUtf8 = NULL;\n    PyObject* optsDict;\n    if (!PyArg_ParseTuple(args, \"sOOO\", &filename, &formatstrObject, &array, &optsDict)) return NULL;\n    if (!PyArray_Check(array)) {\n        PyErr_SetString(PyExc_RuntimeError,TypeErrorMsg);\n        return NULL;\n    }\n\n\n    formatstr = get_cstring(formatstrObject);\n    if (!formatstr) {\n        PyErr_SetString(PyExc_TypeError, \"imread.imsave: Expected a string as formatstr\");\n        return NULL;\n    }\n    try {\n        options_map opts = parse_options(optsDict);\n        std::auto_ptr<ImageFormat> format(get_format(formatstr));\n        if (!format.get() || !format->can_write()) {\n            std::stringstream ss;\n            ss << \"Cannot write this format (\" << formatstr << \")\";\n            throw CannotWriteError(ss.str());\n        }\n\n        const int fd = ::open(filename, O_CREAT|O_WRONLY|O_BINARY|O_TRUNC, 0644);\n        if (fd < 0) {\n            std::stringstream ss;\n            ss << \"Cannot open file '\" << filename << \"' for writing\";\n            throw CannotWriteError(ss.str());\n        }\n\n        std::auto_ptr<byte_sink> output(new fd_source_sink(fd));\n\n        \/\/ ~NumpyImage() will decrease the count\n        Py_INCREF(array);\n        NumpyImage input(array);\n        format->write(&input, output.get(), opts);\n\n        Py_XDECREF(asUtf8);\n        Py_RETURN_NONE;\n    } catch (const std::exception& e) {\n        PyErr_SetString(PyExc_RuntimeError, e.what());\n        Py_XDECREF(asUtf8);\n        return 0;\n    } catch (...) {\n        PyErr_SetString(PyExc_RuntimeError, \"Mysterious error\");\n        Py_XDECREF(asUtf8);\n        return 0;\n    }\n}\n\n\nPyMethodDef methods[] = {\n  {\"imread\",(PyCFunction)py_imread, METH_VARARGS, NULL},\n  {\"imread_multi\",(PyCFunction)py_imread_multi, METH_VARARGS, NULL},\n  {\"imread_from_blob\",(PyCFunction)py_imread_from_blob, METH_VARARGS, NULL},\n  {\"imsave\",(PyCFunction)py_imsave, METH_VARARGS, NULL},\n  {NULL, NULL,0,NULL},\n};\n\n} \/\/ namespace\n\n#if PY_MAJOR_VERSION < 3\nPyMODINIT_FUNC\ninit_imread()\n  {\n    import_array();\n    (void)Py_InitModule(\"_imread\", methods);\n  }\n#else\n\nstatic struct PyModuleDef moduledef = {\n        PyModuleDef_HEAD_INIT,\n        \"_imread\",\n        NULL,\n        -1,\n        methods,\n        NULL,\n        NULL,\n        NULL,\n        NULL\n};\n\nPyMODINIT_FUNC\nPyInit__imread()\n  {\n    import_array();\n    PyObject *module = PyModule_Create(&moduledef);\n    return module;\n  }\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/physics:$Name:  $:$Id: TGenPhaseSpace.cxx,v 1.10 2005\/09\/04 09:51:19 brun Exp $\n\/\/ Author: Rene Brun , Valerio Filippini  06\/09\/2000 \n\n\/\/_____________________________________________________________________________________\n\/\/\n\/\/  Utility class to generate n-body event,\n\/\/  with constant cross-section (default)\n\/\/  or with Fermi energy dependence (opt=\"Fermi\").\n\/\/  The event is generated in the center-of-mass frame, \n\/\/  but the decay products are finally boosted\n\/\/  using the betas of the original particle.\n\/\/\n\/\/  The code is based on the GENBOD function (W515 from CERNLIB)\n\/\/  using the Raubold and Lynch method\n\/\/      F. James, Monte Carlo Phase Space, CERN 68-15 (1968)\n\/\/\n\/\/ see example of use in $ROOTSYS\/tutorials\/PhaseSpace.C\n\n#include \"TGenPhaseSpace.h\"\n#include \"TRandom.h\"\n#include \"TMath.h\"\n#include <stdlib.h>\n\nconst Int_t kMAXP = 18;\n\nClassImp(TGenPhaseSpace)\n\n\/\/_____________________________________________________________________________________\nDouble_t TGenPhaseSpace::PDK(Double_t a, Double_t b, Double_t c) \n{\n   \/\/the PDK function\n   Double_t x = (a-b-c)*(a+b+c)*(a-b+c)*(a+b-c);\n   x = TMath::Sqrt(x)\/(2*a);\n   return x;\n}\n\n\/\/_____________________________________________________________________________________\nInt_t DoubleMax(const void *a, const void *b) \n{\n   \/\/special max function\n   Double_t aa = * ((Double_t *) a); \n   Double_t bb = * ((Double_t *) b); \n   if (aa > bb) return  1;\n   if (aa < bb) return -1;\n   return 0;\n\n}\n\n\/\/__________________________________________________________________________________________________\nTGenPhaseSpace::TGenPhaseSpace(const TGenPhaseSpace &gen) : TObject(gen)\n{\n   \/\/copy constructor\n   fNt      = gen.fNt;\n   fWtMax   = gen.fWtMax;\n   fTeCmTm  = gen.fTeCmTm;\n   fBeta[0] = gen.fBeta[0];\n   fBeta[1] = gen.fBeta[1];\n   fBeta[2] = gen.fBeta[2];\n   for (Int_t i=0;i<fNt;i++) {\n      fMass[i]   = gen.fMass[i];\n      fDecPro[i] = gen.fDecPro[i];\n   }\n}\n\n\/\/__________________________________________________________________________________________________\nDouble_t TGenPhaseSpace::Generate() \n{\n   \/\/  Generate a random final state.\n   \/\/  The function returns the weigth of the current event.\n   \/\/  The TLorentzVector of each decay product can be get using GetDecay(n).\n   \/\/  The maximum weigth can be get using GetWtMax().\n   \/\/ \n   Double_t rno[kMAXP];\n   rno[0] = 0;\n   Int_t n;\n   if (fNt>2) {\n      for (n=1; n<fNt-1; n++)  rno[n]=gRandom->Rndm();   \/\/ fNt-2 random numbers\n      qsort(rno+1 ,fNt-2 ,sizeof(Double_t) ,DoubleMax);  \/\/ sort them\n   }\n   rno[fNt-1] = 1;\n\n   Double_t invMas[kMAXP], sum=0;\n   for (n=0; n<fNt; n++) {\n      sum      += fMass[n];\n      invMas[n] = rno[n]*fTeCmTm + sum;\n   }\n\n   \/\/\n   \/\/-----> compute the weight of the current event\n   \/\/\n   Double_t wt=fWtMax;\n   Double_t pd[kMAXP];\n   for (n=0; n<fNt-1; n++) {\n      pd[n] = PDK(invMas[n+1],invMas[n],fMass[n+1]);\n      wt *= pd[n];\n   }\n\n   \/\/\n   \/\/-----> complete specification of event (Raubold-Lynch method)\n   \/\/\n   fDecPro[0].SetPxPyPzE(0, pd[0], 0 , TMath::Sqrt(pd[0]*pd[0]+fMass[0]*fMass[0]) );\n\n   Int_t i=1;\n   Int_t j;\n   while (1) {\n      fDecPro[i].SetPxPyPzE(0, -pd[i-1], 0 , TMath::Sqrt(pd[i-1]*pd[i-1]+fMass[i]*fMass[i]) );\n\n      Double_t cZ   = 2*gRandom->Rndm() - 1;\n      Double_t sZ   = TMath::Sqrt(1-cZ*cZ);\n      Double_t angY = 2*TMath::Pi() * gRandom->Rndm();\n      Double_t cY   = TMath::Cos(angY);\n      Double_t sY   = TMath::Sin(angY);\n      for (j=0; j<=i; j++) {\n         TLorentzVector *v = fDecPro+j;\n         Double_t x = v->Px();\n         Double_t y = v->Py();\n         v->SetPx( cZ*x - sZ*y );\n         v->SetPy( sZ*x + cZ*y );   \/\/ rotation around Z\n         x = v->Px();\n         Double_t z = v->Pz();\n         v->SetPx( cY*x - sY*z );\n         v->SetPz( sY*x + cY*z );   \/\/ rotation around Y\n      }\n\n      if (i == (fNt-1)) break;\n\n      Double_t beta = pd[i] \/ sqrt(pd[i]*pd[i] + invMas[i]*invMas[i]);\n      for (j=0; j<=i; j++) fDecPro[j].Boost(0,beta,0);\n      i++;\n   }\n \n   \/\/\n   \/\/---> final boost of all particles  \n   \/\/\n   for (n=0;n<fNt;n++) fDecPro[n].Boost(fBeta[0],fBeta[1],fBeta[2]);\n\n   \/\/\n   \/\/---> return the weigth of event\n   \/\/\n   return wt;\n}\n\n\/\/__________________________________________________________________________________\nTLorentzVector *TGenPhaseSpace::GetDecay(Int_t n) \n{ \n   \/\/return Lorentz vector corresponding to decay n\n   if (n>fNt) return 0;\n   return fDecPro+n;\n}\n\n\n\/\/_____________________________________________________________________________________\nBool_t TGenPhaseSpace::SetDecay(TLorentzVector &P, Int_t nt, \n   Double_t *mass, Option_t *opt) \n{\n   \/\/ input:\n   \/\/ TLorentzVector &P:    decay particle\n   \/\/ Int_t nt:             number of decay products\n   \/\/ Double_t *mass:       array of decay product masses\n   \/\/ Option_t *opt:        default -> constant cross section\n   \/\/                       \"Fermi\" -> Fermi energy dependece\n   \/\/ return value:\n   \/\/ kTRUE:      the decay is permitted by kinematics\n   \/\/ kFALSE:     the decay is forbidden by kinematics\n   \/\/\n\n   Int_t n;\n   fNt = nt;\n   if (fNt<2 || fNt>18) return kFALSE;  \/\/ no more then 18 particle\n\n   \/\/\n   \/\/\n   \/\/\n   fTeCmTm = P.Mag();           \/\/ total energy in C.M. minus the sum of the masses\n   for (n=0;n<fNt;n++) {\n      fMass[n]  = mass[n];\n      fTeCmTm  -= mass[n];\n   }\n\n   if (fTeCmTm<=0) return kFALSE;    \/\/ not enough energy for this decay\n\n   \/\/\n   \/\/------> the max weigth depends on opt:\n   \/\/   opt == \"Fermi\"  --> fermi energy dependence for cross section\n   \/\/   else            --> constant cross section as function of TECM (default)\n   \/\/\n   if (strcasecmp(opt,\"fermi\")==0) {  \n      \/\/ ffq[] = pi * (2*pi)**(FNt-2) \/ (FNt-2)!\n      Double_t ffq[] = {0 \n                     ,3.141592, 19.73921, 62.01255, 129.8788, 204.0131\n                     ,256.3704, 268.4705, 240.9780, 189.2637\n                     ,132.1308,  83.0202,  47.4210,  24.8295\n                     ,12.0006,   5.3858,   2.2560,   0.8859 };\n      fWtMax = TMath::Power(fTeCmTm,fNt-2) * ffq[fNt-1] \/ P.Mag();\n\n   } else {\n      Double_t emmax = fTeCmTm + fMass[0];\n      Double_t emmin = 0;\n      Double_t wtmax = 1;\n      for (n=1; n<fNt; n++) {\n         emmin += fMass[n-1];\n         emmax += fMass[n];\n         wtmax *= PDK(emmax, emmin, fMass[n]);\n      }\n      fWtMax = 1\/wtmax;\n   }\n\n   \/\/\n   \/\/---->  save the betas of the decaying particle\n   \/\/\n   if (P.Beta()) {\n      Double_t w = P.Beta()\/P.Rho();\n      fBeta[0] = P(0)*w;\n      fBeta[1] = P(1)*w;\n      fBeta[2] = P(2)*w;\n   }\n   else fBeta[0]=fBeta[1]=fBeta[2]=0; \n\n   return kTRUE; \n}\n<commit_msg>- Change comments according to the new $ROOTSYS\/tutorials structure.<commit_after>\/\/ @(#)root\/physics:$Name:  $:$Id: TGenPhaseSpace.cxx,v 1.11 2006\/05\/16 08:13:31 brun Exp $\n\/\/ Author: Rene Brun , Valerio Filippini  06\/09\/2000 \n\n\/\/_____________________________________________________________________________________\n\/\/\n\/\/  Utility class to generate n-body event,\n\/\/  with constant cross-section (default)\n\/\/  or with Fermi energy dependence (opt=\"Fermi\").\n\/\/  The event is generated in the center-of-mass frame, \n\/\/  but the decay products are finally boosted\n\/\/  using the betas of the original particle.\n\/\/\n\/\/  The code is based on the GENBOD function (W515 from CERNLIB)\n\/\/  using the Raubold and Lynch method\n\/\/      F. James, Monte Carlo Phase Space, CERN 68-15 (1968)\n\/\/\n\/\/ see example of use in $ROOTSYS\/tutorials\/physics\/PhaseSpace.C\n\n#include \"TGenPhaseSpace.h\"\n#include \"TRandom.h\"\n#include \"TMath.h\"\n#include <stdlib.h>\n\nconst Int_t kMAXP = 18;\n\nClassImp(TGenPhaseSpace)\n\n\/\/_____________________________________________________________________________________\nDouble_t TGenPhaseSpace::PDK(Double_t a, Double_t b, Double_t c) \n{\n   \/\/the PDK function\n   Double_t x = (a-b-c)*(a+b+c)*(a-b+c)*(a+b-c);\n   x = TMath::Sqrt(x)\/(2*a);\n   return x;\n}\n\n\/\/_____________________________________________________________________________________\nInt_t DoubleMax(const void *a, const void *b) \n{\n   \/\/special max function\n   Double_t aa = * ((Double_t *) a); \n   Double_t bb = * ((Double_t *) b); \n   if (aa > bb) return  1;\n   if (aa < bb) return -1;\n   return 0;\n\n}\n\n\/\/__________________________________________________________________________________________________\nTGenPhaseSpace::TGenPhaseSpace(const TGenPhaseSpace &gen) : TObject(gen)\n{\n   \/\/copy constructor\n   fNt      = gen.fNt;\n   fWtMax   = gen.fWtMax;\n   fTeCmTm  = gen.fTeCmTm;\n   fBeta[0] = gen.fBeta[0];\n   fBeta[1] = gen.fBeta[1];\n   fBeta[2] = gen.fBeta[2];\n   for (Int_t i=0;i<fNt;i++) {\n      fMass[i]   = gen.fMass[i];\n      fDecPro[i] = gen.fDecPro[i];\n   }\n}\n\n\/\/__________________________________________________________________________________________________\nDouble_t TGenPhaseSpace::Generate() \n{\n   \/\/  Generate a random final state.\n   \/\/  The function returns the weigth of the current event.\n   \/\/  The TLorentzVector of each decay product can be get using GetDecay(n).\n   \/\/  The maximum weigth can be get using GetWtMax().\n   \/\/ \n   Double_t rno[kMAXP];\n   rno[0] = 0;\n   Int_t n;\n   if (fNt>2) {\n      for (n=1; n<fNt-1; n++)  rno[n]=gRandom->Rndm();   \/\/ fNt-2 random numbers\n      qsort(rno+1 ,fNt-2 ,sizeof(Double_t) ,DoubleMax);  \/\/ sort them\n   }\n   rno[fNt-1] = 1;\n\n   Double_t invMas[kMAXP], sum=0;\n   for (n=0; n<fNt; n++) {\n      sum      += fMass[n];\n      invMas[n] = rno[n]*fTeCmTm + sum;\n   }\n\n   \/\/\n   \/\/-----> compute the weight of the current event\n   \/\/\n   Double_t wt=fWtMax;\n   Double_t pd[kMAXP];\n   for (n=0; n<fNt-1; n++) {\n      pd[n] = PDK(invMas[n+1],invMas[n],fMass[n+1]);\n      wt *= pd[n];\n   }\n\n   \/\/\n   \/\/-----> complete specification of event (Raubold-Lynch method)\n   \/\/\n   fDecPro[0].SetPxPyPzE(0, pd[0], 0 , TMath::Sqrt(pd[0]*pd[0]+fMass[0]*fMass[0]) );\n\n   Int_t i=1;\n   Int_t j;\n   while (1) {\n      fDecPro[i].SetPxPyPzE(0, -pd[i-1], 0 , TMath::Sqrt(pd[i-1]*pd[i-1]+fMass[i]*fMass[i]) );\n\n      Double_t cZ   = 2*gRandom->Rndm() - 1;\n      Double_t sZ   = TMath::Sqrt(1-cZ*cZ);\n      Double_t angY = 2*TMath::Pi() * gRandom->Rndm();\n      Double_t cY   = TMath::Cos(angY);\n      Double_t sY   = TMath::Sin(angY);\n      for (j=0; j<=i; j++) {\n         TLorentzVector *v = fDecPro+j;\n         Double_t x = v->Px();\n         Double_t y = v->Py();\n         v->SetPx( cZ*x - sZ*y );\n         v->SetPy( sZ*x + cZ*y );   \/\/ rotation around Z\n         x = v->Px();\n         Double_t z = v->Pz();\n         v->SetPx( cY*x - sY*z );\n         v->SetPz( sY*x + cY*z );   \/\/ rotation around Y\n      }\n\n      if (i == (fNt-1)) break;\n\n      Double_t beta = pd[i] \/ sqrt(pd[i]*pd[i] + invMas[i]*invMas[i]);\n      for (j=0; j<=i; j++) fDecPro[j].Boost(0,beta,0);\n      i++;\n   }\n \n   \/\/\n   \/\/---> final boost of all particles  \n   \/\/\n   for (n=0;n<fNt;n++) fDecPro[n].Boost(fBeta[0],fBeta[1],fBeta[2]);\n\n   \/\/\n   \/\/---> return the weigth of event\n   \/\/\n   return wt;\n}\n\n\/\/__________________________________________________________________________________\nTLorentzVector *TGenPhaseSpace::GetDecay(Int_t n) \n{ \n   \/\/return Lorentz vector corresponding to decay n\n   if (n>fNt) return 0;\n   return fDecPro+n;\n}\n\n\n\/\/_____________________________________________________________________________________\nBool_t TGenPhaseSpace::SetDecay(TLorentzVector &P, Int_t nt, \n   Double_t *mass, Option_t *opt) \n{\n   \/\/ input:\n   \/\/ TLorentzVector &P:    decay particle\n   \/\/ Int_t nt:             number of decay products\n   \/\/ Double_t *mass:       array of decay product masses\n   \/\/ Option_t *opt:        default -> constant cross section\n   \/\/                       \"Fermi\" -> Fermi energy dependece\n   \/\/ return value:\n   \/\/ kTRUE:      the decay is permitted by kinematics\n   \/\/ kFALSE:     the decay is forbidden by kinematics\n   \/\/\n\n   Int_t n;\n   fNt = nt;\n   if (fNt<2 || fNt>18) return kFALSE;  \/\/ no more then 18 particle\n\n   \/\/\n   \/\/\n   \/\/\n   fTeCmTm = P.Mag();           \/\/ total energy in C.M. minus the sum of the masses\n   for (n=0;n<fNt;n++) {\n      fMass[n]  = mass[n];\n      fTeCmTm  -= mass[n];\n   }\n\n   if (fTeCmTm<=0) return kFALSE;    \/\/ not enough energy for this decay\n\n   \/\/\n   \/\/------> the max weigth depends on opt:\n   \/\/   opt == \"Fermi\"  --> fermi energy dependence for cross section\n   \/\/   else            --> constant cross section as function of TECM (default)\n   \/\/\n   if (strcasecmp(opt,\"fermi\")==0) {  \n      \/\/ ffq[] = pi * (2*pi)**(FNt-2) \/ (FNt-2)!\n      Double_t ffq[] = {0 \n                     ,3.141592, 19.73921, 62.01255, 129.8788, 204.0131\n                     ,256.3704, 268.4705, 240.9780, 189.2637\n                     ,132.1308,  83.0202,  47.4210,  24.8295\n                     ,12.0006,   5.3858,   2.2560,   0.8859 };\n      fWtMax = TMath::Power(fTeCmTm,fNt-2) * ffq[fNt-1] \/ P.Mag();\n\n   } else {\n      Double_t emmax = fTeCmTm + fMass[0];\n      Double_t emmin = 0;\n      Double_t wtmax = 1;\n      for (n=1; n<fNt; n++) {\n         emmin += fMass[n-1];\n         emmax += fMass[n];\n         wtmax *= PDK(emmax, emmin, fMass[n]);\n      }\n      fWtMax = 1\/wtmax;\n   }\n\n   \/\/\n   \/\/---->  save the betas of the decaying particle\n   \/\/\n   if (P.Beta()) {\n      Double_t w = P.Beta()\/P.Rho();\n      fBeta[0] = P(0)*w;\n      fBeta[1] = P(1)*w;\n      fBeta[2] = P(2)*w;\n   }\n   else fBeta[0]=fBeta[1]=fBeta[2]=0; \n\n   return kTRUE; \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2011\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#define __CL_ENABLE_EXCEPTIONS\n#include <CL\/cl.hpp>\n#include <string>\n#include <cstring>\n#include <fstream>\nusing std::string;\nusing std::ofstream;\n\n#include <utils.hpp>\n#include <Exceptions.hpp>\n#include <Timer.hpp>\nusing isa::utils::toStringValue;\nusing isa::Exceptions::OpenCLError;\nusing isa::utils::Timer;\n\n\n#ifndef CL_DATA_HPP\n#define CL_DATA_HPP\n\nnamespace isa {\n\nnamespace OpenCL {\n\ntemplate< typename T > class CLData {\npublic:\n\tCLData(string name, bool deletePolicy = false);\n\t~CLData();\n\t\n\tinline string getName() const;\n\n\t\/\/ Allocation of host data\n\tvoid allocateHostData(T * data, size_t size);\n\tvoid allocateHostData(long long unsigned int nrElements);\n\tvoid deleteHostData();\n\t\n\t\/\/ Allocation of device data\n\tvoid allocateDeviceData(cl::Buffer * data, size_t size);\n\tvoid allocateDeviceData(long long unsigned int nrElements) throw (OpenCLError);\n\tvoid allocateDeviceData() throw (OpenCLError);\n\tvoid deleteDeviceData();\n\tinline void setDeviceReadOnly();\n\tinline void setDeviceWriteOnly();\n\n\t\/\/ Memory transfers\n\tvoid copyHostToDevice(bool async = false) throw (OpenCLError);\n\tvoid copyDeviceToHost(bool async = false) throw (OpenCLError);\n\tvoid dumpDeviceToDisk() throw (OpenCLError);\n\n\t\/\/ OpenCL\n\tinline void setCLContext(cl::Context * context);\n\tinline void setCLQueue(cl::CommandQueue * queue);\n\t\n\t\/\/ Access host data\n\tinline T * getHostData();\n\tinline T * getHostDataAt(long long unsigned int startingPoint);\n\tinline void * getRawHostData();\n\tinline void * getRawHostDataAt(long long unsigned int startingPoint);\n\tinline size_t getHostDataSize() const;\n\tinline T operator[](long long unsigned int item);\n\n\t\/\/ Access device data\n\tinline cl::Buffer * getDeviceData();\n\tinline size_t getDeviceDataSize() const;\n\t\n\t\n\t\/\/ Timers\n\tinline Timer & getH2DTimer();\n\tinline Timer & getD2HTimer();\n\nprivate:\n\tcl::Context * clContext;\n\tcl::CommandQueue * clQueue;\n\tTimer timerH2D;\n\tTimer timerD2H;\n\n\tbool deleteHost;\n\tbool deviceReadOnly;\n\tbool deviceWriteOnly;\n\tT * hostData;\n\tsize_t hostDataSize;\n\tcl::Buffer * deviceData;\n\tsize_t deviceDataSize;\n\n\tstring name;\n};\n\n\n\/\/ Implementations\n\ntemplate< typename T > CLData< T >::CLData(string name, bool deletePolicy, bool devRO) : clContext(0), clQueue(0), timerH2D(Timer(\"H2D\")), timerD2H(Timer(\"D2H\")), deleteHost(deletePolicy), deviceReadOnly(false), deviceWriteOnly(false), hostData(0), hostDataSize(0), deviceData(0), deviceDataSize(0), name(name) {}\n\n\ntemplate< typename T > CLData< T >::~CLData() {\n\tdeleteHostData();\n\tdeleteDeviceData();\n}\n\n\ntemplate< typename T > void CLData< T >::allocateHostData(T * data, size_t size) {\n\tdeleteHostData();\n\n\thostData = data;\n\thostDataSize = size;\n}\n\n\ntemplate< typename T > void CLData< T >::allocateHostData(long long unsigned int nrElements) {\n\tsize_t newSize = nrElements * sizeof(T);\n\n\tif ( newSize != hostDataSize ) {\n\t\tdeleteHostData();\n\n\t\thostData = new T [nrElements];\n\t\thostDataSize = newSize;\n\t}\n\tmemset(getRawHostData(), 0, newSize);\n}\n\n\ntemplate< typename T > void CLData< T >::deleteHostData() {\n\tif ( deleteHost && hostDataSize != 0 ) {\n\t\tdelete [] hostData;\n\t\thostData = 0;\n\t\thostDataSize = 0;\n\t}\n}\n\n\ntemplate< typename T > void CLData< T >::allocateDeviceData(cl::Buffer * data, size_t size) {\n\tdeleteDeviceData();\n\n\tdeviceData = data;\n\tdeviceDataSize = size;\n}\n\n\ntemplate< typename T > void CLData< T >::allocateDeviceData(long long unsigned int nrElements) throw (OpenCLError) {\n\tsize_t newSize = nrElements * sizeof(T);\n\tif ( newSize != deviceDataSize ) {\n\t\tdeleteDeviceData();\n\n\t\ttry {\n\t\t\tif ( deviceReadOnly ) {\n\t\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_READ_ONLY, newSize, NULL, NULL);\n\t\t\t} else if ( deviceWriteOnly ) {\n\t\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_WRITE_ONLY, newSize, NULL, NULL);\n\t\t\t} else {\n\t\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_READ_WRITE, newSize, NULL, NULL);\n\t\t\t}\n\t\t} catch ( cl::Error err ) {\n\t\t\tdeviceDataSize = 0;\n\t\t\tthrow  OpenCLError(\"Impossible to allocate \" + name + \" device memory: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t\tdeviceDataSize = newSize;\n\t}\n}\n\n\ntemplate< typename T > void CLData< T >::allocateDeviceData() throw (OpenCLError) {\n\tdeleteDeviceData();\n\t\n\ttry {\n\t\tif ( deviceReadOnly ) {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_READ_ONLY, hostDataSize, NULL, NULL);\n\t\t} else if ( deviceWriteOnly ) {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_WRITE_ONLY, hostDataSize, NULL, NULL);\n\t\t} else {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_READ_WRITE, hostDataSize, NULL, NULL);\n\t\t}\n\t} catch ( cl::Error err ) {\n\t\tdeviceDataSize = 0;\n\t\tthrow  OpenCLError(\"Impossible to allocate \" + name + \" device memory: \" + toStringValue< cl_int >(err.err()));\n\t}\n\tdeviceDataSize = hostDataSize;\n}\n\n\ntemplate< typename T > void CLData< T >::deleteDeviceData() {\n\tif ( deviceDataSize != 0 ) {\n\t\tdelete deviceData;\n\t\tdeviceData = 0;\n\t\tdeviceDataSize = 0;\n\t}\n}\n\n\ntemplate< typename T > inline void CLData< T >::setDeviceReadOnly() {\n\tdeviceReadOnly = true;\n\tdeviceWriteOnly = false;\n}\n\n\ntemplate< typename T > inline void CLData< T >::setDeviceWriteOnly() {\n\tdeviceWriteOnly = true;\n\tdeviceReadOnly = false;\n}\n\n\ntemplate< typename T > void CLData< T >::copyHostToDevice(bool async) throw (OpenCLError) {\n\tif ( hostDataSize != deviceDataSize ) {\n\t\tthrow OpenCLError(\"Impossible to copy \" + name + \": different memory sizes.\");\n\t}\n\n\tif ( async ) {\n\t\ttry {\n\t\t\tclQueue->enqueueWriteBuffer(*deviceData, CL_FALSE, 0, deviceDataSize, getRawHostData(), NULL, NULL);\n\t\t} catch ( cl::Error err ) {\n\t\t\tthrow OpenCLError(\"Impossible to copy \" + name + \" to device: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t}\n\telse {\n\t\tcl::Event clEvent;\n\n\t\ttry {\n\t\t\ttimerH2D.start();\n\t\t\tclQueue->enqueueWriteBuffer(*deviceData, CL_TRUE, 0, deviceDataSize, getRawHostData(), NULL, &clEvent);\n\t\t\tclEvent.wait();\n\t\t\ttimerH2D.stop();\n\t\t} catch ( cl::Error err ) {\n\t\t\ttimerH2D.reset();\n\t\t\tthrow OpenCLError(\"Impossible to copy \" + name + \" to device: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t}\n}\n\n\ntemplate< typename T > void CLData< T >::copyDeviceToHost(bool async) throw (OpenCLError) {\n\tif ( hostDataSize != deviceDataSize ) {\n\t\tthrow OpenCLError(\"Impossible to copy \" + name + \": different memory sizes.\");\n\t}\n\n\tif ( async ) {\n\t\ttry {\n\t\t\tclQueue->enqueueReadBuffer(*deviceData, CL_FALSE, 0, hostDataSize, getRawHostData(), NULL, NULL);\n\t\t} catch ( cl::Error err ) {\n\t\t\tthrow OpenCLError(\"Impossible to copy \" + name + \" to host: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t}\n\telse {\n\t\tcl::Event clEvent;\n\n\t\ttry {\n\t\t\ttimerD2H.start();\n\t\t\tclQueue->enqueueReadBuffer(*deviceData, CL_TRUE, 0, hostDataSize, getRawHostData(), NULL, &clEvent);\n\t\t\tclEvent.wait();\n\t\t\ttimerD2H.stop();\n\t\t} catch ( cl::Error err ) {\n\t\t\ttimerD2H.reset();\n\t\t\tthrow OpenCLError(\"Impossible to copy \" + name + \" to host: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t}\n\n}\n\n\ntemplate< typename T > void CLData< T >::dumpDeviceToDisk() throw (OpenCLError) {\n\tCLData< T > temp = CLData< T >(\"temp\", true);\n\n\ttemp.setCLContext(clContext);\n\ttemp.setCLQueue(clQueue);\n\ttemp.allocateHostData(hostDataSize \/ sizeof(T));\n\ttemp.allocateDeviceData(deviceData, deviceDataSize);\n\ttemp.copyDeviceToHost();\n\n\tofstream oFile((\".\/\" + name + \".bin\").c_str(), ofstream::binary);\n\toFile.write(reinterpret_cast< char * >(temp.getRawHostData()), temp.getHostDataSize());\n\toFile.close();\n}\n\ntemplate< typename T > inline void CLData< T >::setCLContext(cl::Context * context) {\n\tclContext = context;\n}\n\n\t\ntemplate< typename T > inline void CLData< T >::setCLQueue(cl::CommandQueue * queue) {\n\tclQueue = queue;\n}\n\n\ntemplate< typename T > inline T * CLData< T >::getHostData() {\n\treturn hostData;\n}\n\n\ntemplate< typename T > inline T * CLData< T >::getHostDataAt(long long unsigned int startingPoint) {\n\treturn &(hostData[startingPoint]);\n}\n\n\ntemplate< typename T > inline void * CLData< T >::getRawHostData() {\n\treturn reinterpret_cast< void * >(hostData);\n}\n\n\ntemplate< typename T > inline void * CLData< T >::getRawHostDataAt(long long unsigned int startingPoint) {\n\treturn reinterpret_cast< void * >(&(hostData[startingPoint]));\n}\n\n\ntemplate< typename T > inline size_t CLData< T >::getHostDataSize() const {\n\treturn hostDataSize;\n}\n\n\ntemplate< typename T > inline T CLData< T >::operator[](long long unsigned int item) {\n\treturn hostData[item];\n}\n\n\ntemplate< typename T > inline cl::Buffer * CLData< T >::getDeviceData() {\n\treturn deviceData;\n}\n\n\ntemplate< typename T > inline size_t CLData< T >::getDeviceDataSize() const {\n\treturn deviceDataSize;\n}\n\n\ntemplate< typename T > inline string CLData< T >::getName() const {\n\treturn name;\n}\n\n\t\ntemplate< typename T > inline Timer & CLData< T >::getH2DTimer() {\n\treturn timerH2D;\n}\n\n\ntemplate< typename T > inline Timer & CLData< T >::getD2HTimer() {\n\treturn timerD2H;\n}\n\n} \/\/ OpenCL\n} \/\/ isa\n\n#endif \/\/ CL_DATA_HPP\n<commit_msg>Added an allocateSharedDeviceData() to avoid memory copying. Not tested it yet.<commit_after>\/*\n * Copyright (C) 2011\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#define __CL_ENABLE_EXCEPTIONS\n#include <CL\/cl.hpp>\n#include <string>\n#include <cstring>\n#include <fstream>\nusing std::string;\nusing std::ofstream;\n\n#include <utils.hpp>\n#include <Exceptions.hpp>\n#include <Timer.hpp>\nusing isa::utils::toStringValue;\nusing isa::Exceptions::OpenCLError;\nusing isa::utils::Timer;\n\n\n#ifndef CL_DATA_HPP\n#define CL_DATA_HPP\n\nnamespace isa {\n\nnamespace OpenCL {\n\ntemplate< typename T > class CLData {\npublic:\n\tCLData(string name, bool deletePolicy = false);\n\t~CLData();\n\t\n\tinline string getName() const;\n\n\t\/\/ Allocation of host data\n\tvoid allocateHostData(T * data, size_t size);\n\tvoid allocateHostData(long long unsigned int nrElements);\n\tvoid deleteHostData();\n\t\n\t\/\/ Allocation of device data\n\tvoid allocateDeviceData(cl::Buffer * data, size_t size);\n\tvoid allocateDeviceData(long long unsigned int nrElements) throw (OpenCLError);\n\tvoid allocateDeviceData() throw (OpenCLError);\n\tvoid allocateSharedeDeviceData() throw (OpenCLError);\n\tvoid deleteDeviceData();\n\tinline void setDeviceReadOnly();\n\tinline void setDeviceWriteOnly();\n\n\t\/\/ Memory transfers\n\tvoid copyHostToDevice(bool async = false) throw (OpenCLError);\n\tvoid copyDeviceToHost(bool async = false) throw (OpenCLError);\n\tvoid dumpDeviceToDisk() throw (OpenCLError);\n\n\t\/\/ OpenCL\n\tinline void setCLContext(cl::Context * context);\n\tinline void setCLQueue(cl::CommandQueue * queue);\n\t\n\t\/\/ Access host data\n\tinline T * getHostData();\n\tinline T * getHostDataAt(long long unsigned int startingPoint);\n\tinline void * getRawHostData();\n\tinline void * getRawHostDataAt(long long unsigned int startingPoint);\n\tinline size_t getHostDataSize() const;\n\tinline T operator[](long long unsigned int item);\n\n\t\/\/ Access device data\n\tinline cl::Buffer * getDeviceData();\n\tinline size_t getDeviceDataSize() const;\n\t\n\t\n\t\/\/ Timers\n\tinline Timer & getH2DTimer();\n\tinline Timer & getD2HTimer();\n\nprivate:\n\tcl::Context * clContext;\n\tcl::CommandQueue * clQueue;\n\tTimer timerH2D;\n\tTimer timerD2H;\n\n\tbool deleteHost;\n\tbool deviceReadOnly;\n\tbool deviceWriteOnly;\n\tT * hostData;\n\tsize_t hostDataSize;\n\tcl::Buffer * deviceData;\n\tsize_t deviceDataSize;\n\n\tstring name;\n};\n\n\n\/\/ Implementations\n\ntemplate< typename T > CLData< T >::CLData(string name, bool deletePolicy) : clContext(0), clQueue(0), timerH2D(Timer(\"H2D\")), timerD2H(Timer(\"D2H\")), deleteHost(deletePolicy), deviceReadOnly(false), deviceWriteOnly(false), hostData(0), hostDataSize(0), deviceData(0), deviceDataSize(0), name(name) {}\n\n\ntemplate< typename T > CLData< T >::~CLData() {\n\tdeleteHostData();\n\tdeleteDeviceData();\n}\n\n\ntemplate< typename T > void CLData< T >::allocateHostData(T * data, size_t size) {\n\tdeleteHostData();\n\n\thostData = data;\n\thostDataSize = size;\n}\n\n\ntemplate< typename T > void CLData< T >::allocateHostData(long long unsigned int nrElements) {\n\tsize_t newSize = nrElements * sizeof(T);\n\n\tif ( newSize != hostDataSize ) {\n\t\tdeleteHostData();\n\n\t\thostData = new T [nrElements];\n\t\thostDataSize = newSize;\n\t}\n\tmemset(getRawHostData(), 0, newSize);\n}\n\n\ntemplate< typename T > void CLData< T >::deleteHostData() {\n\tif ( deleteHost && hostDataSize != 0 ) {\n\t\tdelete [] hostData;\n\t\thostData = 0;\n\t\thostDataSize = 0;\n\t}\n}\n\n\ntemplate< typename T > void CLData< T >::allocateDeviceData(cl::Buffer * data, size_t size) {\n\tdeleteDeviceData();\n\n\tdeviceData = data;\n\tdeviceDataSize = size;\n}\n\n\ntemplate< typename T > void CLData< T >::allocateDeviceData(long long unsigned int nrElements) throw (OpenCLError) {\n\tsize_t newSize = nrElements * sizeof(T);\n\tif ( newSize != deviceDataSize ) {\n\t\tdeleteDeviceData();\n\n\t\ttry {\n\t\t\tif ( deviceReadOnly ) {\n\t\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_READ_ONLY, newSize, NULL, NULL);\n\t\t\t} else if ( deviceWriteOnly ) {\n\t\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_WRITE_ONLY, newSize, NULL, NULL);\n\t\t\t} else {\n\t\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_READ_WRITE, newSize, NULL, NULL);\n\t\t\t}\n\t\t} catch ( cl::Error err ) {\n\t\t\tdeviceDataSize = 0;\n\t\t\tthrow  OpenCLError(\"Impossible to allocate \" + name + \" device memory: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t\tdeviceDataSize = newSize;\n\t}\n}\n\n\ntemplate< typename T > void CLData< T >::allocateDeviceData() throw (OpenCLError) {\n\tdeleteDeviceData();\n\t\n\ttry {\n\t\tif ( deviceReadOnly ) {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_READ_ONLY, hostDataSize, NULL, NULL);\n\t\t} else if ( deviceWriteOnly ) {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_WRITE_ONLY, hostDataSize, NULL, NULL);\n\t\t} else {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_READ_WRITE, hostDataSize, NULL, NULL);\n\t\t}\n\t} catch ( cl::Error err ) {\n\t\tdeviceDataSize = 0;\n\t\tthrow  OpenCLError(\"Impossible to allocate \" + name + \" device memory: \" + toStringValue< cl_int >(err.err()));\n\t}\n\tdeviceDataSize = hostDataSize;\n}\n\n\ntemplate< typename T > void CLData< T >::allocateSharedDeviceData() throw (OpenCLError) {\n\tdeleteDeviceData();\n\t\n\ttry {\n\t\tif ( deviceReadOnly ) {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_USE_HOST_PTR | CL_MEM_READ_ONLY, hostDataSize, getRawHostData(), NULL);\n\t\t} else if ( deviceWriteOnly ) {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_USE_HOST_PTR | CL_MEM_WRITE_ONLY, hostDataSize, getRawHostData(), NULL);\n\t\t} else {\n\t\t\tdeviceData = new cl::Buffer(*clContext, CL_MEM_USE_HOST_PTR | CL_MEM_READ_WRITE, hostDataSize, getRawHostData(), NULL);\n\t\t}\n\t} catch ( cl::Error err ) {\n\t\tdeviceDataSize = 0;\n\t\tthrow  OpenCLError(\"Impossible to allocate \" + name + \" device memory: \" + toStringValue< cl_int >(err.err()));\n\t}\n\tdeviceDataSize = hostDataSize;\n}\n\n\ntemplate< typename T > void CLData< T >::deleteDeviceData() {\n\tif ( deviceDataSize != 0 ) {\n\t\tdelete deviceData;\n\t\tdeviceData = 0;\n\t\tdeviceDataSize = 0;\n\t}\n}\n\n\ntemplate< typename T > inline void CLData< T >::setDeviceReadOnly() {\n\tdeviceReadOnly = true;\n\tdeviceWriteOnly = false;\n}\n\n\ntemplate< typename T > inline void CLData< T >::setDeviceWriteOnly() {\n\tdeviceWriteOnly = true;\n\tdeviceReadOnly = false;\n}\n\n\ntemplate< typename T > void CLData< T >::copyHostToDevice(bool async) throw (OpenCLError) {\n\tif ( hostDataSize != deviceDataSize ) {\n\t\tthrow OpenCLError(\"Impossible to copy \" + name + \": different memory sizes.\");\n\t}\n\n\tif ( async ) {\n\t\ttry {\n\t\t\tclQueue->enqueueWriteBuffer(*deviceData, CL_FALSE, 0, deviceDataSize, getRawHostData(), NULL, NULL);\n\t\t} catch ( cl::Error err ) {\n\t\t\tthrow OpenCLError(\"Impossible to copy \" + name + \" to device: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t}\n\telse {\n\t\tcl::Event clEvent;\n\n\t\ttry {\n\t\t\ttimerH2D.start();\n\t\t\tclQueue->enqueueWriteBuffer(*deviceData, CL_TRUE, 0, deviceDataSize, getRawHostData(), NULL, &clEvent);\n\t\t\tclEvent.wait();\n\t\t\ttimerH2D.stop();\n\t\t} catch ( cl::Error err ) {\n\t\t\ttimerH2D.reset();\n\t\t\tthrow OpenCLError(\"Impossible to copy \" + name + \" to device: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t}\n}\n\n\ntemplate< typename T > void CLData< T >::copyDeviceToHost(bool async) throw (OpenCLError) {\n\tif ( hostDataSize != deviceDataSize ) {\n\t\tthrow OpenCLError(\"Impossible to copy \" + name + \": different memory sizes.\");\n\t}\n\n\tif ( async ) {\n\t\ttry {\n\t\t\tclQueue->enqueueReadBuffer(*deviceData, CL_FALSE, 0, hostDataSize, getRawHostData(), NULL, NULL);\n\t\t} catch ( cl::Error err ) {\n\t\t\tthrow OpenCLError(\"Impossible to copy \" + name + \" to host: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t}\n\telse {\n\t\tcl::Event clEvent;\n\n\t\ttry {\n\t\t\ttimerD2H.start();\n\t\t\tclQueue->enqueueReadBuffer(*deviceData, CL_TRUE, 0, hostDataSize, getRawHostData(), NULL, &clEvent);\n\t\t\tclEvent.wait();\n\t\t\ttimerD2H.stop();\n\t\t} catch ( cl::Error err ) {\n\t\t\ttimerD2H.reset();\n\t\t\tthrow OpenCLError(\"Impossible to copy \" + name + \" to host: \" + toStringValue< cl_int >(err.err()));\n\t\t}\n\t}\n\n}\n\n\ntemplate< typename T > void CLData< T >::dumpDeviceToDisk() throw (OpenCLError) {\n\tCLData< T > temp = CLData< T >(\"temp\", true);\n\n\ttemp.setCLContext(clContext);\n\ttemp.setCLQueue(clQueue);\n\ttemp.allocateHostData(hostDataSize \/ sizeof(T));\n\ttemp.allocateDeviceData(deviceData, deviceDataSize);\n\ttemp.copyDeviceToHost();\n\n\tofstream oFile((\".\/\" + name + \".bin\").c_str(), ofstream::binary);\n\toFile.write(reinterpret_cast< char * >(temp.getRawHostData()), temp.getHostDataSize());\n\toFile.close();\n}\n\ntemplate< typename T > inline void CLData< T >::setCLContext(cl::Context * context) {\n\tclContext = context;\n}\n\n\t\ntemplate< typename T > inline void CLData< T >::setCLQueue(cl::CommandQueue * queue) {\n\tclQueue = queue;\n}\n\n\ntemplate< typename T > inline T * CLData< T >::getHostData() {\n\treturn hostData;\n}\n\n\ntemplate< typename T > inline T * CLData< T >::getHostDataAt(long long unsigned int startingPoint) {\n\treturn &(hostData[startingPoint]);\n}\n\n\ntemplate< typename T > inline void * CLData< T >::getRawHostData() {\n\treturn reinterpret_cast< void * >(hostData);\n}\n\n\ntemplate< typename T > inline void * CLData< T >::getRawHostDataAt(long long unsigned int startingPoint) {\n\treturn reinterpret_cast< void * >(&(hostData[startingPoint]));\n}\n\n\ntemplate< typename T > inline size_t CLData< T >::getHostDataSize() const {\n\treturn hostDataSize;\n}\n\n\ntemplate< typename T > inline T CLData< T >::operator[](long long unsigned int item) {\n\treturn hostData[item];\n}\n\n\ntemplate< typename T > inline cl::Buffer * CLData< T >::getDeviceData() {\n\treturn deviceData;\n}\n\n\ntemplate< typename T > inline size_t CLData< T >::getDeviceDataSize() const {\n\treturn deviceDataSize;\n}\n\n\ntemplate< typename T > inline string CLData< T >::getName() const {\n\treturn name;\n}\n\n\t\ntemplate< typename T > inline Timer & CLData< T >::getH2DTimer() {\n\treturn timerH2D;\n}\n\n\ntemplate< typename T > inline Timer & CLData< T >::getD2HTimer() {\n\treturn timerD2H;\n}\n\n} \/\/ OpenCL\n} \/\/ isa\n\n#endif \/\/ CL_DATA_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2011-15 DyND Developers\n\/\/ BSD 2-Clause License, see LICENSE.txt\n\/\/\n\n#include \"arrfunc_functions.hpp\"\n#include \"array_functions.hpp\"\n#include \"array_from_py.hpp\"\n#include \"array_assign_from_py.hpp\"\n#include \"type_functions.hpp\"\n#include \"utility_functions.hpp\"\n#include \"numpy_interop.hpp\"\n#include \"arrfunc_from_pyfunc.hpp\"\n\n#include <dynd\/types\/string_type.hpp>\n#include <dynd\/types\/base_dim_type.hpp>\n#include <dynd\/memblock\/external_memory_block.hpp>\n#include <dynd\/array_range.hpp>\n#include <dynd\/type_promotion.hpp>\n#include <dynd\/types\/base_struct_type.hpp>\n#include <dynd\/types\/base_bytes_type.hpp>\n#include <dynd\/types\/struct_type.hpp>\n#include <dynd\/func\/rolling_arrfunc.hpp>\n#include <dynd\/view.hpp>\n#include <dynd\/func\/callable.hpp>\n#include <dynd\/func\/arrfunc_registry.hpp>\n\nusing namespace std;\nusing namespace dynd;\nusing namespace pydynd;\n\nPyTypeObject *pydynd::WArrFunc_Type;\n\nvoid pydynd::init_w_arrfunc_typeobject(PyObject *type)\n{\n  WArrFunc_Type = (PyTypeObject *)type;\n}\n\nPyObject *pydynd::arrfunc_call(PyObject *af_obj, PyObject *args_obj,\n                               PyObject *ectx_obj)\n{\n  if (!WArrFunc_Check(af_obj)) {\n    PyErr_SetString(PyExc_TypeError, \"arrfunc_call expected an nd.arrfunc\");\n    return NULL;\n  }\n  const nd::arrfunc &af = ((WArrFunc *)af_obj)->v;\n  if (af.is_null()) {\n    PyErr_SetString(PyExc_ValueError, \"cannot call a null nd.arrfunc\");\n    return NULL;\n  }\n  if (!PyTuple_Check(args_obj)) {\n    PyErr_SetString(PyExc_ValueError,\n                    \"arrfunc_call requires a tuple of arguments\");\n    return NULL;\n  }\n  const eval::eval_context *ectx = eval_context_from_pyobj(ectx_obj);\n  \/\/ Convert args into nd::arrays\n  intptr_t args_size = PyTuple_Size(args_obj);\n  std::vector<nd::array> args(args_size);\n  for (intptr_t i = 0; i < args_size; ++i) {\n    args[i] = array_from_py(PyTuple_GET_ITEM(args_obj, i), 0, false, ectx);\n  }\n\n  nd::array result = af.call(args_size, args_size ? &args[0] : NULL, ectx);\n  return wrap_array(result);\n}\n\nPyObject *pydynd::arrfunc_rolling_apply(PyObject *func_obj, PyObject *arr_obj,\n                                        PyObject *window_size_obj,\n                                        PyObject *ectx_obj)\n{\n  const eval::eval_context *ectx = eval_context_from_pyobj(ectx_obj);\n  nd::array arr = array_from_py(arr_obj, 0, false, ectx);\n  intptr_t window_size = pyobject_as_index(window_size_obj);\n  nd::arrfunc func;\n  if (WArrFunc_Check(func_obj)) {\n    func = ((WArrFunc *)func_obj)->v;\n  }\n  else {\n    ndt::type el_tp = arr.get_type().get_type_at_dimension(NULL, 1);\n    ndt::type proto = ndt::make_arrfunc(\n        ndt::make_tuple(ndt::make_fixed_dimsym(el_tp)), el_tp);\n\n    func = arrfunc_from_pyfunc(func_obj, proto);\n  }\n  nd::arrfunc roll = make_rolling_arrfunc(func, window_size);\n  nd::array result = roll(arr, ectx);\n  return wrap_array(result);\n}\n\nPyObject *pydynd::get_published_arrfuncs()\n{\n  pyobject_ownref res(PyDict_New());\n  const map<nd::string, nd::arrfunc> &reg = func::get_regfunctions();\n  for (map<nd::string, nd::arrfunc>::const_iterator it = reg.begin();\n       it != reg.end(); ++it) {\n    PyDict_SetItem(res.get(), pystring_from_string(it->first.str()),\n                   wrap_array(it->second));\n  }\n  return res.release();\n}\n<commit_msg>Fix for changes to call<commit_after>\/\/\n\/\/ Copyright (C) 2011-15 DyND Developers\n\/\/ BSD 2-Clause License, see LICENSE.txt\n\/\/\n\n#include \"arrfunc_functions.hpp\"\n#include \"array_functions.hpp\"\n#include \"array_from_py.hpp\"\n#include \"array_assign_from_py.hpp\"\n#include \"type_functions.hpp\"\n#include \"utility_functions.hpp\"\n#include \"numpy_interop.hpp\"\n#include \"arrfunc_from_pyfunc.hpp\"\n\n#include <dynd\/types\/string_type.hpp>\n#include <dynd\/types\/base_dim_type.hpp>\n#include <dynd\/memblock\/external_memory_block.hpp>\n#include <dynd\/array_range.hpp>\n#include <dynd\/type_promotion.hpp>\n#include <dynd\/types\/base_struct_type.hpp>\n#include <dynd\/types\/base_bytes_type.hpp>\n#include <dynd\/types\/struct_type.hpp>\n#include <dynd\/func\/rolling_arrfunc.hpp>\n#include <dynd\/view.hpp>\n#include <dynd\/func\/callable.hpp>\n#include <dynd\/func\/arrfunc_registry.hpp>\n\nusing namespace std;\nusing namespace dynd;\nusing namespace pydynd;\n\nPyTypeObject *pydynd::WArrFunc_Type;\n\nvoid pydynd::init_w_arrfunc_typeobject(PyObject *type)\n{\n  WArrFunc_Type = (PyTypeObject *)type;\n}\n\nPyObject *pydynd::arrfunc_call(PyObject *af_obj, PyObject *args_obj,\n                               PyObject *ectx_obj)\n{\n  if (!WArrFunc_Check(af_obj)) {\n    PyErr_SetString(PyExc_TypeError, \"arrfunc_call expected an nd.arrfunc\");\n    return NULL;\n  }\n  const nd::arrfunc &af = ((WArrFunc *)af_obj)->v;\n  if (af.is_null()) {\n    PyErr_SetString(PyExc_ValueError, \"cannot call a null nd.arrfunc\");\n    return NULL;\n  }\n  if (!PyTuple_Check(args_obj)) {\n    PyErr_SetString(PyExc_ValueError,\n                    \"arrfunc_call requires a tuple of arguments\");\n    return NULL;\n  }\n  const eval::eval_context *ectx = eval_context_from_pyobj(ectx_obj);\n  \/\/ Convert args into nd::arrays\n  intptr_t args_size = PyTuple_Size(args_obj);\n  std::vector<nd::array> args(args_size);\n  for (intptr_t i = 0; i < args_size; ++i) {\n    args[i] = array_from_py(PyTuple_GET_ITEM(args_obj, i), 0, false, ectx);\n  }\n\n  nd::array result = af.call(args_size, args_size ? &args[0] : NULL, ectx);\n  return wrap_array(result);\n}\n\nPyObject *pydynd::arrfunc_rolling_apply(PyObject *func_obj, PyObject *arr_obj,\n                                        PyObject *window_size_obj,\n                                        PyObject *ectx_obj)\n{\n  eval::eval_context *ectx = const_cast<eval::eval_context *>(eval_context_from_pyobj(ectx_obj));\n  nd::array arr = array_from_py(arr_obj, 0, false, ectx);\n  intptr_t window_size = pyobject_as_index(window_size_obj);\n  nd::arrfunc func;\n  if (WArrFunc_Check(func_obj)) {\n    func = ((WArrFunc *)func_obj)->v;\n  }\n  else {\n    ndt::type el_tp = arr.get_type().get_type_at_dimension(NULL, 1);\n    ndt::type proto = ndt::make_arrfunc(\n        ndt::make_tuple(ndt::make_fixed_dimsym(el_tp)), el_tp);\n\n    func = arrfunc_from_pyfunc(func_obj, proto);\n  }\n  nd::arrfunc roll = make_rolling_arrfunc(func, window_size);\n  nd::array result = roll(arr, kwds(\"ectx\", ectx));\n  return wrap_array(result);\n}\n\nPyObject *pydynd::get_published_arrfuncs()\n{\n  pyobject_ownref res(PyDict_New());\n  const map<nd::string, nd::arrfunc> &reg = func::get_regfunctions();\n  for (map<nd::string, nd::arrfunc>::const_iterator it = reg.begin();\n       it != reg.end(); ++it) {\n    PyDict_SetItem(res.get(), pystring_from_string(it->first.str()),\n                   wrap_array(it->second));\n  }\n  return res.release();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"artifact_subtract.h\"\n#include <cstring>\n\nArtifactSubtract::ArtifactSubtract(int _nsc, int _nrc, int _maxcurrent,\n                                   int _buflen, float _alpha)\n{\n\tnsc = _nsc;\t\t\t\t\/\/ 16\n\tnrc = _nrc;\t\t\t\t\/\/ 96\n\tmaxcurrent = _maxcurrent;\t\t\/\/ 100\n\tbuflen = _buflen;\t\t\t\/\/ 64\n\talpha = _alpha;\t\t\t\t\/\/ 0.99;\n\n\tsa = new float[maxcurrent*nsc*nrc*buflen];\t\/\/ stim artifact buffer\n\tof = new long[maxcurrent*nsc];\t\t\t\t\/\/ buffer read offset\n\tmemset(of, -1, maxcurrent*nsc*sizeof(long));\n}\n\nArtifactSubtract::~ArtifactSubtract()\n{\n\tdelete[] sa;\n\tdelete[] of;\n}\n\nvoid ArtifactSubtract::filter(float *f, u16 *sc, u16 *current, int ns)\n{\n\t\/\/ This function takes a pointer to a matrix of neural data of dimensionality\n\t\/\/ (number of recording chans) x (number of samples) and a pointer to a\n\t\/\/ vector of stimulation chans of length ns and a vector of stimulation\n\t\/\/ currents of length ns\n\t\/\/\n\t\/\/ It then goes through this data, updating the SA template if\n\t\/\/ appropriate (ie only single channel is hot) and then subtracts using\n\t\/\/ the SA templates for any number of hot channels (assuming SAs add).\n\t\/\/\n\t\/\/ Importantly, since the buffer offsets are only per current and stimchan\n\t\/\/ (ie we assume the SA affects all recording channels simultaneously)\n\t\/\/ we MUST process each recchan before advancing the buffer offset and\n\t\/\/ moving to the next time sample. That is, we must process the data by\n\t\/\/ looping over time samples first.\n\t\/\/\n\t\/\/ Note also that this function operates on the data matrix, f, in place.\n\t\/\/ The stimchannel and current values are not changed.\n\n\t\/\/ this is a helper function\n\tauto check_bit = [](u16 var, int n) -> bool {\n\t\tif (n < 0 || n > 15)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\treturn (var) & (1<<n);\n\t};\n\n\tfor (int k=0; k<ns; k++) {\t\/\/ loop over samples\n\n\t\t\/\/ first loop through and get how many stim chans are hot\n\t\t\/\/ and update the offset pointers\n\n\t\tint nstim = 0; \/\/ stim pulses \"hot\" on this sample\n\t\tfor (int j=0; j<maxcurrent; j++) {\t\/\/ loop over currents\n\t\t\tfor (int i=0; i<nsc; i++) {\t\/\/ loop over stimchans\n\t\t\t\tif (sc[k] > 0) {\t\/\/ ie if there is stim this sample\n\t\t\t\t\tif (check_bit(sc[k], i) && current[k] == (j+1)) {\n\t\t\t\t\t\tif (of[j*nsc+i] != -1) {\n\t\t\t\t\t\t\terror(\"went hot while hot!\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tof[j*nsc+i] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (of[j*nsc+i] != -1) {\n\t\t\t\t\tnstim++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (nstim == 0) {\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ now loop through again and update (if appropriate) and\n\t\t\/\/ apply (always) the artifact buffers to the data matrix\n\n\t\tfor (int j=0; j<maxcurrent; j++) {\t\/\/ loop over currents\n\t\t\tfor (int i=0; i<nsc; i++) {\t\/\/ loop over stimchans\n\t\t\t\tlong *idx = &(of[j*nsc+i]);\n\t\t\t\tif (*idx != -1) { \/\/ if we are stimulating on this current&chan\n\t\t\t\t\tfor (int m=0; m<nrc; m++) {\t\/\/ loop over recchans\n\t\t\t\t\t\t\/\/ this is the pointer to a buffer for a particular\n\t\t\t\t\t\t\/\/ current, stimchan, and recchan\n\t\t\t\t\t\tfloat *x = &(sa[j*nsc*nrc*buflen + i*nrc*buflen + m*buflen]);\n\t\t\t\t\t\tif (nstim == 1) { \/\/if 1 channel is hot, update templates\n\t\t\t\t\t\t\tx[*idx] *= alpha;\n\t\t\t\t\t\t\tx[*idx] += (1.0-alpha) * f[m*ns+k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\/\/f[m*ns+k] -= x[*idx]; \/\/ subtract templates\n\n\t\t\t\t\t}\n\t\t\t\t\t\/\/ advance buffer and reset if necessary\n\t\t\t\t\t(*idx)++;\n\t\t\t\t\tif (*idx >= buflen) {\n\t\t\t\t\t\t(*idx) = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n<commit_msg>final debug code removed. subtr nominally works?<commit_after>#include \"artifact_subtract.h\"\n#include <cstring>\n\nArtifactSubtract::ArtifactSubtract(int _nsc, int _nrc, int _maxcurrent,\n                                   int _buflen, float _alpha)\n{\n\tnsc = _nsc;\t\t\t\t\/\/ 16\n\tnrc = _nrc;\t\t\t\t\/\/ 96\n\tmaxcurrent = _maxcurrent;\t\t\/\/ 100\n\tbuflen = _buflen;\t\t\t\/\/ 64\n\talpha = _alpha;\t\t\t\t\/\/ 0.99;\n\n\tsa = new float[maxcurrent*nsc*nrc*buflen];\t\/\/ stim artifact buffer\n\tof = new long[maxcurrent*nsc];\t\t\t\t\/\/ buffer read offset\n\tmemset(of, -1, maxcurrent*nsc*sizeof(long));\n}\n\nArtifactSubtract::~ArtifactSubtract()\n{\n\tdelete[] sa;\n\tdelete[] of;\n}\n\nvoid ArtifactSubtract::filter(float *f, u16 *sc, u16 *current, int ns)\n{\n\t\/\/ This function takes a pointer to a matrix of neural data of dimensionality\n\t\/\/ (number of recording chans) x (number of samples) and a pointer to a\n\t\/\/ vector of stimulation chans of length ns and a vector of stimulation\n\t\/\/ currents of length ns\n\t\/\/\n\t\/\/ It then goes through this data, updating the SA template if\n\t\/\/ appropriate (ie only single channel is hot) and then subtracts using\n\t\/\/ the SA templates for any number of hot channels (assuming SAs add).\n\t\/\/\n\t\/\/ Importantly, since the buffer offsets are only per current and stimchan\n\t\/\/ (ie we assume the SA affects all recording channels simultaneously)\n\t\/\/ we MUST process each recchan before advancing the buffer offset and\n\t\/\/ moving to the next time sample. That is, we must process the data by\n\t\/\/ looping over time samples first.\n\t\/\/\n\t\/\/ Note also that this function operates on the data matrix, f, in place.\n\t\/\/ The stimchannel and current values are not changed.\n\n\t\/\/ this is a helper function\n\tauto check_bit = [](u16 var, int n) -> bool {\n\t\tif (n < 0 || n > 15)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\treturn (var) & (1<<n);\n\t};\n\n\tfor (int k=0; k<ns; k++) {\t\/\/ loop over samples\n\n\t\t\/\/ first loop through and get how many stim chans are hot\n\t\t\/\/ and update the offset pointers\n\n\t\tint nstim = 0; \/\/ stim pulses \"hot\" on this sample\n\t\tfor (int j=0; j<maxcurrent; j++) {\t\/\/ loop over currents\n\t\t\tfor (int i=0; i<nsc; i++) {\t\/\/ loop over stimchans\n\t\t\t\tif (sc[k] > 0) {\t\/\/ ie if there is stim this sample\n\t\t\t\t\tif (check_bit(sc[k], i) && current[k] == (j+1)) {\n\t\t\t\t\t\tif (of[j*nsc+i] != -1) {\n\t\t\t\t\t\t\terror(\"went hot while hot!\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tof[j*nsc+i] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (of[j*nsc+i] != -1) {\n\t\t\t\t\tnstim++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (nstim == 0) {\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ now loop through again and update (if appropriate) and\n\t\t\/\/ apply (always) the artifact buffers to the data matrix\n\n\t\tfor (int j=0; j<maxcurrent; j++) {\t\/\/ loop over currents\n\t\t\tfor (int i=0; i<nsc; i++) {\t\/\/ loop over stimchans\n\t\t\t\tlong *idx = &(of[j*nsc+i]);\n\t\t\t\tif (*idx != -1) { \/\/ if we are stimulating on this current&chan\n\t\t\t\t\tfor (int m=0; m<nrc; m++) {\t\/\/ loop over recchans\n\t\t\t\t\t\t\/\/ this is the pointer to a buffer for a particular\n\t\t\t\t\t\t\/\/ current, stimchan, and recchan\n\t\t\t\t\t\tfloat *x = &(sa[j*nsc*nrc*buflen + i*nrc*buflen + m*buflen]);\n\t\t\t\t\t\tif (nstim == 1) { \/\/if 1 channel is hot, update templates\n\t\t\t\t\t\t\tx[*idx] *= alpha;\n\t\t\t\t\t\t\tx[*idx] += (1.0-alpha) * f[m*ns+k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tf[m*ns+k] -= x[*idx]; \/\/ subtract templates\n\n\t\t\t\t\t}\n\t\t\t\t\t\/\/ advance buffer and reset if necessary\n\t\t\t\t\t(*idx)++;\n\t\t\t\t\tif (*idx >= buflen) {\n\t\t\t\t\t\t(*idx) = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n\t\\file cube.cpp\n\t\\brief LightEngine 3D (examples): cube example\n\t\\brief Windows implementation\n\t\\author Frederic Meslin (fred@fredslab.net)\n\t\\twitter @marzacdev\n\t\\website http:\/\/fredslab.net\n*\/\n\n#include \"engine\/le3d.h\"\n#include \"tools\/timing.h\"\n\n#include <windows.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n\/*****************************************************************************\/\nconst int resoX = 640;\nconst int resoY = 480;\n\n\/*****************************************************************************\/\nint main()\n{\n\/** Create application objects *\/\n\tLeWindow     window     = LeWindow(\"Le3d: cube example\", resoX, resoY);\n\tLeDraw       draw       = LeDraw(window.getContext(), resoX, resoY);\n\tLeRenderer   renderer   = LeRenderer(resoX, resoY);\n\tLeRasterizer rasterizer = LeRasterizer(resoX, resoY);\n\n\/** Load the assets (textures then 3D models) *\/\n\tbmpCache.loadDirectory(\"assets\");\n\tmeshCache.loadDirectory(\"assets\");\n\n\/** Retrieve the 3D model *\/\n    int crateSlot = meshCache.getFromName(\"crate.obj\");\n    LeMesh * crate = meshCache.slots[crateSlot].mesh;\n\n\/** Create three lights *\/\n\tLeLight light1(LE_LIGHT_DIRECTIONAL, 0xFF4040);\n\tLeLight light2(LE_LIGHT_DIRECTIONAL, 0x4040FF);\n\tLeLight light3(LE_LIGHT_AMBIENT, 0x404040);\n\n\tlight1.axis = LeAxis(LeVertex(), LeVertex(1.0f, 0.0f, -1.0f));\n\tlight2.axis = LeAxis(LeVertex(), LeVertex(-1.0f, 0.0f, -1.0f));\n\n\/** Set the renderer properties *\/\n    renderer.setViewPosition(LeVertex(0.0f, 0.0f, 3.0f));\n    renderer.updateViewMatrix();\n    rasterizer.background = 0xC0C0FF;\n\n\/** Initialize the timing *\/\n    timing.setup(60);\n\ttiming.firstFrame();\n\n\/** Program main loop *\/\n    MSG msg;\n\tmsg.message = 0;\n\twhile(msg.message != WM_QUIT) {\n    \/** Process OS messages *\/\n\t\twhile (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE))\n\t\t{\n\t\t\tTranslateMessage(&msg);\n\t\t\tDispatchMessage(&msg);\n\t\t}\n\n    \/** Wait for next frame *\/\n\t\ttiming.waitNextFrame();\n\n    \/** Copy render frame to window context *\/\n        draw.setPixels(rasterizer.frame.data);\n\n    \/** Update model transforms *\/\n        crate->angle += LeVertex(0.1f, 2.0f, 0.0f);\n        crate->updateMatrix();\n\n\t\/** Light model *\/\n\t\tLeLight::black(crate);\n\t\tlight1.shine(crate);\n\t\tlight2.shine(crate);\n\t\tlight3.shine(crate);\n\n    \/** Render the 3D model *\/\n        renderer.render(crate);\n\n    \/** Draw the triangles *\/\n        rasterizer.flush();\n        rasterizer.rasterList(renderer.getTriangleList());\n        renderer.flush();\n\t}\n\n    timing.lastFrame();\n    return 0;\n}\n<commit_msg>Correcting indentation<commit_after>\/**\n\t\\file cube.cpp\n\t\\brief LightEngine 3D (examples): cube example\n\t\\brief Windows implementation\n\t\\author Frederic Meslin (fred@fredslab.net)\n\t\\twitter @marzacdev\n\t\\website http:\/\/fredslab.net\n*\/\n\n#include \"engine\/le3d.h\"\n#include \"tools\/timing.h\"\n\n#include <windows.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n\/*****************************************************************************\/\nconst int resoX = 640;\nconst int resoY = 480;\n\n\/*****************************************************************************\/\nint main()\n{\n\/** Create application objects *\/\n\tLeWindow\t window\t\t= LeWindow(\"Le3d: cube example\", resoX, resoY);\n\tLeDraw\t\t draw\t\t= LeDraw(window.getContext(), resoX, resoY);\n\tLeRenderer\t renderer\t= LeRenderer(resoX, resoY);\n\tLeRasterizer rasterizer = LeRasterizer(resoX, resoY);\n\n\/** Load the assets (textures then 3D models) *\/\n\tbmpCache.loadDirectory(\"assets\");\n\tmeshCache.loadDirectory(\"assets\");\n\n\/** Retrieve the 3D model *\/\n\tint crateSlot = meshCache.getFromName(\"crate.obj\");\n\tLeMesh * crate = meshCache.slots[crateSlot].mesh;\n\n\/** Create three lights *\/\n\tLeLight light1(LE_LIGHT_DIRECTIONAL, 0xFF4040);\n\tLeLight light2(LE_LIGHT_DIRECTIONAL, 0x4040FF);\n\tLeLight light3(LE_LIGHT_AMBIENT, 0x404040);\n\n\tlight1.axis = LeAxis(LeVertex(), LeVertex(1.0f, 0.0f, -1.0f));\n\tlight2.axis = LeAxis(LeVertex(), LeVertex(-1.0f, 0.0f, -1.0f));\n\n\/** Set the renderer properties *\/\n\trenderer.setViewPosition(LeVertex(0.0f, 0.0f, 3.0f));\n\trenderer.updateViewMatrix();\n\trasterizer.background = 0xC0C0FF;\n\n\/** Initialize the timing *\/\n\ttiming.setup(60);\n\ttiming.firstFrame();\n\n\/** Program main loop *\/\n\tMSG msg;\n\tmsg.message = 0;\n\twhile(msg.message != WM_QUIT) {\n\t\/** Process OS messages *\/\n\t\twhile (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE))\n\t\t{\n\t\t\tTranslateMessage(&msg);\n\t\t\tDispatchMessage(&msg);\n\t\t}\n\n\t\/** Wait for next frame *\/\n\t\ttiming.waitNextFrame();\n\n\t\/** Copy render frame to window context *\/\n\t\tdraw.setPixels(rasterizer.frame.data);\n\n\t\/** Update model transforms *\/\n\t\tcrate->angle += LeVertex(0.1f, 2.0f, 0.0f);\n\t\tcrate->updateMatrix();\n\n\t\/** Light model *\/\n\t\tLeLight::black(crate);\n\t\tlight1.shine(crate);\n\t\tlight2.shine(crate);\n\t\tlight3.shine(crate);\n\n\t\/** Render the 3D model *\/\n\t\trenderer.render(crate);\n\n\t\/** Draw the triangles *\/\n\t\trasterizer.flush();\n\t\trasterizer.rasterList(renderer.getTriangleList());\n\t\trenderer.flush();\n\t}\n\n\ttiming.lastFrame();\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\n#include <boost\/asio.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\nint main(int argc, char *argv[])\n{\n\tboost::asio::io_service io;\n\n\tboost::asio::deadline_timer t(io, boost::posix_time::seconds(5));\n\tt.wait();\n\n\tstd::cout << \"Hello, world!\" << std::endl;\n\n\treturn 0;\n}\n<commit_msg>chat: start working on a parameter binding example from Asio<commit_after>#include <iostream>\n\n#include <boost\/asio.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\nvoid print(const boost::system::error_code &e, boost::asio::deadline_timer& t, int& count)\n{\n\tstd::cout << \"A timer thing No. \" << count++ << std::endl;\n}\n\nint main(int argc, char *argv[])\n{\n\tboost::asio::io_service io;\n\n\tboost::asio::deadline_timer t1(io, boost::posix_time::seconds(1));\n\tboost::asio::deadline_timer t2(io, boost::posix_time::seconds(2));\n\tt1.async_wait(&print);\n\tstd::cout << \"Between\" << std::endl;\n\tt2.async_wait(&print);\n\n\tio.run();\n\n\tstd::cout << \"Meantime stuff\" << std::endl;\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef RTC_HH\n#define RTC_HH\n\n#include <stdint.h>\n\nnamespace hal {\n    using rtc_time_su = lib::regbit<0, lib::u8, 4, 0>;\n    using rtc_time_st = lib::regbit<4, lib::u8, 3, 0>;\n    using rtc_time_mnu = lib::regbit<8, lib::u8, 4, 0>;\n    using rtc_time_mnt = lib::regbit<12, lib::u8, 3, 0>;\n    using rtc_time_hu = lib::regbit<16, lib::u8, 4, 0>;\n    using rtc_time_ht = lib::regbit<20, lib::u8, 2, 0>;\n    using rtc_time_pm = lib::regbit<22>;\n\n    using rtc_date_du = lib::regbit<0, lib::u8, 4, 0>;\n    using rtc_date_dt = lib::regbit<4, lib::u8, 2, 0>;\n    using rtc_date_mu = lib::regbit<8, lib::u8, 4, 0>;\n    using rtc_date_mt = lib::regbit<12, lib::u8, 1, 0>;\n    enum struct rtc_date_wdu_t : lib::u8 {\n        monday = 0b001,\n        tuesday = 0b010,\n        wednesday = 0b011,\n        thursday = 0b100,\n        friday = 0b101,\n        saturday = 0b110,\n        sunday = 0b111\n    };\n    using rtc_date_wdu =\n        lib::regbit<13,\n        rtc_date_wdu_t,\n        3,\n        rtc_date_wdu_t::monday>;\n    using rtc_date_yu = lib::regbit<16, lib::u8, 4, 0>;\n    using rtc_date_yt = lib::regbit<20, lib::u8, 4, 0>;\n\n    enum struct rtc_control_wucksel_t : lib::u8 {\n        rtc_by16 = 0b000,\n        rtc_by8 = 0b001,\n        rtc_by4 = 0b010,\n        rtc_by2 = 0b011,\n        ck_spre = 0b100,\n        ck_spre_wut_add = 0b110\n    };\n    using rtc_control_wucksel =\n        lib::regbit<0,\n        rtc_control_wucksel_t,\n        3,\n        rtc_control_wucksel_t::rtc_by16>;\n    using rtc_control_tsedge = lib::regbit<3>;\n    using rtc_control_refckon = lib::regbit<4>;\n    using rtc_control_bypshad = lib::regbit<5>;\n    using rtc_control_fmt = lib::regbit<6>;\n    using rtc_control_dce = lib::regbit<7>;\n    using rtc_control_alrae = lib::regbit<8>;\n    using rtc_control_alrbe = lib::regbit<9>;\n    using rtc_control_wute = lib::regbit<10>;\n    using rtc_control_tse = lib::regbit<11>;\n    using rtc_control_alraie = lib::regbit<12>;\n    using rtc_control_alrbie = lib::regbit<13>;\n    using rtc_control_wutie = lib::regbit<14>;\n    using rtc_control_tsie = lib::regbit<15>;\n    using rtc_control_add1h = lib::regbit<16>;\n    using rtc_control_sub1h = lib::regbit<17>;\n    using rtc_control_bkp = lib::regbit<18>;\n    using rtc_control_cosel = lib::regbit<19>;\n    using rtc_control_pol = lib::regbit<20>;\n    enum struct rtc_control_osel_t : lib::u8 {\n        disabled = 0b00,\n        alarm_a = 0b01,\n        alarm_b = 0b10,\n        wakeup = 0b11,\n    };\n    using rtc_control_osel =\n        lib::regbit<21,\n        rtc_control_osel_t,\n        2,\n        rtc_control_osel_t::disabled>;\n    using rtc_control_coe = lib::regbit<23>;\n\n    using rtc_init_status_alrawf = lib::regbit<0>;\n    using rtc_init_status_alrbwf = lib::regbit<1>;\n    using rtc_init_status_wutwf = lib::regbit<2>;\n    using rtc_init_status_shpf = lib::regbit<3>;\n    using rtc_init_status_inits = lib::regbit<4>;\n    using rtc_init_status_rsf = lib::regbit<5>;\n    using rtc_init_status_initf = lib::regbit<6>;\n    using rtc_init_status_init = lib::regbit<7>;\n    using rtc_init_status_alraf = lib::regbit<8>;\n    using rtc_init_status_alrbf = lib::regbit<9>;\n    using rtc_init_status_wutf = lib::regbit<10>;\n    using rtc_init_status_tsf = lib::regbit<11>;\n    using rtc_init_status_tsovf = lib::regbit<12>;\n    using rtc_init_status_tamp1f = lib::regbit<13>;\n    using rtc_init_status_tamp2f = lib::regbit<14>;\n    using rtc_init_status_tamp3f = lib::regbit<15>;\n    using rtc_init_status_recalpf = lib::regbit<16>;\n\n    using rtc_prescaler_prediv_s = lib::regbit<0, lib::u16, 15, 0>;\n    using rtc_prescaler_prediv_a = lib::regbit<16, lib::u8, 7, 1>;\n\n    struct rtc_wakeup_timer_t {\n        uint16_t wut;\n        uint16_t _unused0;\n    };\n\n    using rtc_calib_dc = lib::regbit<0, lib::u8, 5, 0>;\n    using rtc_calib_dcs = lib::regbit<7>;\n\n    using rtc_alarm_su = lib::regbit<0, lib::u8, 4, 0>;\n    using rtc_alarm_st = lib::regbit<4, lib::u8, 3, 0>;\n    using rtc_alarm_msk1 = lib::regbit<7>;\n    using rtc_alarm_mnu = lib::regbit<8, lib::u8, 4, 0>;\n    using rtc_alarm_mnt = lib::regbit<12, lib::u8, 3, 0>;\n    using rtc_alarm_msk2 = lib::regbit<15>;\n    using rtc_alarm_hu = lib::regbit<16, lib::u8, 4, 0>;\n    using rtc_alarm_ht = lib::regbit<20, lib::u8, 2, 0>;\n    using rtc_alarm_pm = lib::regbit<22>;\n    using rtc_alarm_msk3 = lib::regbit<23>;\n    using rtc_alarm_du = lib::regbit<24, lib::u8, 4, 0>;\n    using rtc_alarm_wdu =\n        lib::regbit<24,\n        rtc_date_wdu_t,\n        3,\n        rtc_date_wdu_t::monday>;\n    using rtc_alarm_dt = lib::regbit<28, lib::u8, 2, 0>;\n    using rtc_alarm_wdsel = lib::regbit<30>;\n    using rtc_alarm_msk4 = lib::regbit<31>;\n\n    struct rtc_sub_second_t {\n        uint16_t ss;\n        uint16_t _unused0;\n    };\n\n    using rtc_shift_subfs = lib::regbit<0, lib::u16, 15, 0>;\n    using rtc_shift_add1s = lib::regbit<31>;\n\n    struct rtc_write_protect_t {\n        uint8_t key;\n        uint8_t _unused0[3];\n    };\n\n    using rtc_calib2_calm = lib::regbit<0, lib::u16, 9, 0>;\n    using rtc_calib2_calw16 = lib::regbit<13>;\n    using rtc_calib2_calw8 = lib::regbit<14>;\n    using rtc_calib2_calp = lib::regbit<15>;\n\n    using rtc_tamper_alt_func_tamp1e = lib::regbit<0>;\n    using rtc_tamper_alt_func_tamp1trg = lib::regbit<1>;\n    using rtc_tamper_alt_func_tampie = lib::regbit<2>;\n    using rtc_tamper_alt_func_tamp2e = lib::regbit<3>;\n    using rtc_tamper_alt_func_tamp2trg = lib::regbit<4>;\n    using rtc_tamper_alt_func_tamp3e = lib::regbit<5>;\n    using rtc_tamper_alt_func_tamp3trg = lib::regbit<6>;\n    using rtc_tamper_alt_func_tampts = lib::regbit<7>;\n    enum struct rtc_tamper_alt_func_tampfreq_t : lib::u8 {\n        rtc_by32768 = 0x0,\n        rtc_by16384 = 0x1,\n        rtc_by8192 = 0x2,\n        rtc_by4096 = 0x3,\n        rtc_by2048 = 0x4,\n        rtc_by1024 = 0x5,\n        rtc_by512 = 0x6,\n        rtc_by256 = 0x7,\n    };\n    using rtc_tamper_alt_func_tampfreq =\n        lib::regbit<8,\n        rtc_tamper_alt_func_tampfreq_t,\n        3,\n        rtc_tamper_alt_func_tampfreq_t::rtc_by32768>;\n    enum struct rtc_tamper_alt_func_tampflt_t : lib::u8 {\n        on_edge = 0x0,\n        after2 = 0x1,\n        after4 = 0x2,\n        after8 = 0x3,\n    };\n    using rtc_tamper_alt_func_tampflt =\n        lib::regbit<11,\n        rtc_tamper_alt_func_tampflt_t,\n        2,\n        rtc_tamper_alt_func_tampflt_t::on_edge>;\n    enum struct rtc_tamper_alt_func_tampprch_t : lib::u8 {\n        each1 = 0x0,\n        each2 = 0x1,\n        each4 = 0x2,\n        each8 = 0x3,\n    };\n    using rtc_tamper_alt_func_tampprch =\n        lib::regbit<13,\n        rtc_tamper_alt_func_tampprch_t,\n        2,\n        rtc_tamper_alt_func_tampprch_t::each1>;\n    using rtc_tamper_alt_func_tamppudis = lib::regbit<15>;\n    using rtc_tamper_alt_func_alarmouttype = lib::regbit<18>;\n\n    using rtc_alarm_sub_second_ss = lib::regbit<0, lib::u16, 15, 0>;\n    using rtc_alarm_sub_second_maskss = lib::regbit<24, lib::u8, 4, 0>;\n\n    template <lib::u32 addr, lib::u8 backup_size>\n    struct rtc_d {\n        struct rtc_t {\n            uint32_t time;\n            uint32_t date;\n            uint32_t control;\n            uint32_t init_status;\n            uint32_t prescaler;\n            rtc_wakeup_timer_t wakeup_timer;\n            uint32_t calib;\n            uint32_t alarma;\n            uint32_t alarmb;\n            rtc_write_protect_t write_protect;\n            rtc_sub_second_t sub_second;\n            uint32_t shift;\n            uint32_t ts_time;\n            uint32_t ts_date;\n            rtc_sub_second_t ts_sub_second;\n            uint32_t calib2;\n            uint32_t tamper_alt_func;\n            uint32_t alarma_sub_second;\n            uint32_t alarmb_sub_second;\n            uint32_t bkpr[backup_size];\n        };\n\n        static constexpr volatile rtc_t * const regs =\n            reinterpret_cast<rtc_t *>(addr);\n    };\n}\n\n#include \"hal\/rtc_d.hh\"\n\n#endif \/\/ RTC_HH\n<commit_msg>Update hal\/rtc - change types, change headers<commit_after>#ifndef RTC_HH\n#define RTC_HH\n\n#include \"lib\/types.hh\"\n#include \"lib\/regbit.hh\"\n\nnamespace hal {\n    using rtc_time_su = lib::regbit<0, lib::u8, 4, 0>;\n    using rtc_time_st = lib::regbit<4, lib::u8, 3, 0>;\n    using rtc_time_mnu = lib::regbit<8, lib::u8, 4, 0>;\n    using rtc_time_mnt = lib::regbit<12, lib::u8, 3, 0>;\n    using rtc_time_hu = lib::regbit<16, lib::u8, 4, 0>;\n    using rtc_time_ht = lib::regbit<20, lib::u8, 2, 0>;\n    using rtc_time_pm = lib::regbit<22>;\n\n    using rtc_date_du = lib::regbit<0, lib::u8, 4, 0>;\n    using rtc_date_dt = lib::regbit<4, lib::u8, 2, 0>;\n    using rtc_date_mu = lib::regbit<8, lib::u8, 4, 0>;\n    using rtc_date_mt = lib::regbit<12, lib::u8, 1, 0>;\n    enum struct rtc_date_wdu_t : lib::u8 {\n        monday = 0b001,\n        tuesday = 0b010,\n        wednesday = 0b011,\n        thursday = 0b100,\n        friday = 0b101,\n        saturday = 0b110,\n        sunday = 0b111\n    };\n    using rtc_date_wdu =\n        lib::regbit<13,\n        rtc_date_wdu_t,\n        3,\n        rtc_date_wdu_t::monday>;\n    using rtc_date_yu = lib::regbit<16, lib::u8, 4, 0>;\n    using rtc_date_yt = lib::regbit<20, lib::u8, 4, 0>;\n\n    enum struct rtc_control_wucksel_t : lib::u8 {\n        rtc_by16 = 0b000,\n        rtc_by8 = 0b001,\n        rtc_by4 = 0b010,\n        rtc_by2 = 0b011,\n        ck_spre = 0b100,\n        ck_spre_wut_add = 0b110\n    };\n    using rtc_control_wucksel =\n        lib::regbit<0,\n        rtc_control_wucksel_t,\n        3,\n        rtc_control_wucksel_t::rtc_by16>;\n    using rtc_control_tsedge = lib::regbit<3>;\n    using rtc_control_refckon = lib::regbit<4>;\n    using rtc_control_bypshad = lib::regbit<5>;\n    using rtc_control_fmt = lib::regbit<6>;\n    using rtc_control_dce = lib::regbit<7>;\n    using rtc_control_alrae = lib::regbit<8>;\n    using rtc_control_alrbe = lib::regbit<9>;\n    using rtc_control_wute = lib::regbit<10>;\n    using rtc_control_tse = lib::regbit<11>;\n    using rtc_control_alraie = lib::regbit<12>;\n    using rtc_control_alrbie = lib::regbit<13>;\n    using rtc_control_wutie = lib::regbit<14>;\n    using rtc_control_tsie = lib::regbit<15>;\n    using rtc_control_add1h = lib::regbit<16>;\n    using rtc_control_sub1h = lib::regbit<17>;\n    using rtc_control_bkp = lib::regbit<18>;\n    using rtc_control_cosel = lib::regbit<19>;\n    using rtc_control_pol = lib::regbit<20>;\n    enum struct rtc_control_osel_t : lib::u8 {\n        disabled = 0b00,\n        alarm_a = 0b01,\n        alarm_b = 0b10,\n        wakeup = 0b11,\n    };\n    using rtc_control_osel =\n        lib::regbit<21,\n        rtc_control_osel_t,\n        2,\n        rtc_control_osel_t::disabled>;\n    using rtc_control_coe = lib::regbit<23>;\n\n    using rtc_init_status_alrawf = lib::regbit<0>;\n    using rtc_init_status_alrbwf = lib::regbit<1>;\n    using rtc_init_status_wutwf = lib::regbit<2>;\n    using rtc_init_status_shpf = lib::regbit<3>;\n    using rtc_init_status_inits = lib::regbit<4>;\n    using rtc_init_status_rsf = lib::regbit<5>;\n    using rtc_init_status_initf = lib::regbit<6>;\n    using rtc_init_status_init = lib::regbit<7>;\n    using rtc_init_status_alraf = lib::regbit<8>;\n    using rtc_init_status_alrbf = lib::regbit<9>;\n    using rtc_init_status_wutf = lib::regbit<10>;\n    using rtc_init_status_tsf = lib::regbit<11>;\n    using rtc_init_status_tsovf = lib::regbit<12>;\n    using rtc_init_status_tamp1f = lib::regbit<13>;\n    using rtc_init_status_tamp2f = lib::regbit<14>;\n    using rtc_init_status_tamp3f = lib::regbit<15>;\n    using rtc_init_status_recalpf = lib::regbit<16>;\n\n    using rtc_prescaler_prediv_s = lib::regbit<0, lib::u16, 15, 0>;\n    using rtc_prescaler_prediv_a = lib::regbit<16, lib::u8, 7, 1>;\n\n    struct rtc_wakeup_timer_t {\n        uint16_t wut;\n        uint16_t _unused0;\n    };\n\n    using rtc_calib_dc = lib::regbit<0, lib::u8, 5, 0>;\n    using rtc_calib_dcs = lib::regbit<7>;\n\n    using rtc_alarm_su = lib::regbit<0, lib::u8, 4, 0>;\n    using rtc_alarm_st = lib::regbit<4, lib::u8, 3, 0>;\n    using rtc_alarm_msk1 = lib::regbit<7>;\n    using rtc_alarm_mnu = lib::regbit<8, lib::u8, 4, 0>;\n    using rtc_alarm_mnt = lib::regbit<12, lib::u8, 3, 0>;\n    using rtc_alarm_msk2 = lib::regbit<15>;\n    using rtc_alarm_hu = lib::regbit<16, lib::u8, 4, 0>;\n    using rtc_alarm_ht = lib::regbit<20, lib::u8, 2, 0>;\n    using rtc_alarm_pm = lib::regbit<22>;\n    using rtc_alarm_msk3 = lib::regbit<23>;\n    using rtc_alarm_du = lib::regbit<24, lib::u8, 4, 0>;\n    using rtc_alarm_wdu =\n        lib::regbit<24,\n        rtc_date_wdu_t,\n        3,\n        rtc_date_wdu_t::monday>;\n    using rtc_alarm_dt = lib::regbit<28, lib::u8, 2, 0>;\n    using rtc_alarm_wdsel = lib::regbit<30>;\n    using rtc_alarm_msk4 = lib::regbit<31>;\n\n    struct rtc_sub_second_t {\n        uint16_t ss;\n        uint16_t _unused0;\n    };\n\n    using rtc_shift_subfs = lib::regbit<0, lib::u16, 15, 0>;\n    using rtc_shift_add1s = lib::regbit<31>;\n\n    struct rtc_write_protect_t {\n        uint8_t key;\n        uint8_t _unused0[3];\n    };\n\n    using rtc_calib2_calm = lib::regbit<0, lib::u16, 9, 0>;\n    using rtc_calib2_calw16 = lib::regbit<13>;\n    using rtc_calib2_calw8 = lib::regbit<14>;\n    using rtc_calib2_calp = lib::regbit<15>;\n\n    using rtc_tamper_alt_func_tamp1e = lib::regbit<0>;\n    using rtc_tamper_alt_func_tamp1trg = lib::regbit<1>;\n    using rtc_tamper_alt_func_tampie = lib::regbit<2>;\n    using rtc_tamper_alt_func_tamp2e = lib::regbit<3>;\n    using rtc_tamper_alt_func_tamp2trg = lib::regbit<4>;\n    using rtc_tamper_alt_func_tamp3e = lib::regbit<5>;\n    using rtc_tamper_alt_func_tamp3trg = lib::regbit<6>;\n    using rtc_tamper_alt_func_tampts = lib::regbit<7>;\n    enum struct rtc_tamper_alt_func_tampfreq_t : lib::u8 {\n        rtc_by32768 = 0x0,\n        rtc_by16384 = 0x1,\n        rtc_by8192 = 0x2,\n        rtc_by4096 = 0x3,\n        rtc_by2048 = 0x4,\n        rtc_by1024 = 0x5,\n        rtc_by512 = 0x6,\n        rtc_by256 = 0x7,\n    };\n    using rtc_tamper_alt_func_tampfreq =\n        lib::regbit<8,\n        rtc_tamper_alt_func_tampfreq_t,\n        3,\n        rtc_tamper_alt_func_tampfreq_t::rtc_by32768>;\n    enum struct rtc_tamper_alt_func_tampflt_t : lib::u8 {\n        on_edge = 0x0,\n        after2 = 0x1,\n        after4 = 0x2,\n        after8 = 0x3,\n    };\n    using rtc_tamper_alt_func_tampflt =\n        lib::regbit<11,\n        rtc_tamper_alt_func_tampflt_t,\n        2,\n        rtc_tamper_alt_func_tampflt_t::on_edge>;\n    enum struct rtc_tamper_alt_func_tampprch_t : lib::u8 {\n        each1 = 0x0,\n        each2 = 0x1,\n        each4 = 0x2,\n        each8 = 0x3,\n    };\n    using rtc_tamper_alt_func_tampprch =\n        lib::regbit<13,\n        rtc_tamper_alt_func_tampprch_t,\n        2,\n        rtc_tamper_alt_func_tampprch_t::each1>;\n    using rtc_tamper_alt_func_tamppudis = lib::regbit<15>;\n    using rtc_tamper_alt_func_alarmouttype = lib::regbit<18>;\n\n    using rtc_alarm_sub_second_ss = lib::regbit<0, lib::u16, 15, 0>;\n    using rtc_alarm_sub_second_maskss = lib::regbit<24, lib::u8, 4, 0>;\n\n    template <lib::u32 addr, lib::u8 backup_size>\n    struct rtc_d {\n        struct rtc_t {\n            lib::u32 time;\n            lib::u32 date;\n            lib::u32 control;\n            lib::u32 init_status;\n            lib::u32 prescaler;\n            rtc_wakeup_timer_t wakeup_timer;\n            lib::u32 calib;\n            lib::u32 alarma;\n            lib::u32 alarmb;\n            rtc_write_protect_t write_protect;\n            rtc_sub_second_t sub_second;\n            lib::u32 shift;\n            lib::u32 ts_time;\n            lib::u32 ts_date;\n            rtc_sub_second_t ts_sub_second;\n            lib::u32 calib2;\n            lib::u32 tamper_alt_func;\n            lib::u32 alarma_sub_second;\n            lib::u32 alarmb_sub_second;\n            lib::u32 bkpr[backup_size];\n        };\n\n        static constexpr volatile rtc_t * const regs =\n            reinterpret_cast<rtc_t *>(addr);\n    };\n}\n\n#include \"hal\/rtc_d.hh\"\n\n#endif \/\/ RTC_HH\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * logger.cpp\n *\n *  Created on: 2015. 8. 9.\n *      Author: hwang-linux\n *\/\n\n#include \"logger.hpp\"\n#include <iostream>\n#include \"interface\/ilog.hpp\"\n#include \"util\/format.h\"\n\nnamespace cossb {\nnamespace log {\n\nlogger::logger(){ }\nlogger::logger(interface::ilog* log):_logger(log) { }\n\nlogger::~logger() {\n\t_logger = nullptr;\n\n}\nvoid logger::log(const log::loglevel level, const char* str)\n{\n\tlog_base(level, str);\n}\n\nvoid logger::log_base(const loglevel level, const char* str)\n{\n\tif(_logger)\n\t{\n\t\tswitch(level)\n\t\t{\n\t\tcase\tloglevel::TRACE:\t_logger->trace(str);\tbreak;\n\t\tcase\tloglevel::DEBUG:\t_logger->debug(str);\tbreak;\n\t\tcase\tloglevel::INFO:\t_logger->info(str);\tbreak;\n\t\tcase\tloglevel::NOTICE: _logger->notice(str);\tbreak;\n\t\tcase\tloglevel::WARN: _logger->warn(str);\tbreak;\n\t\tcase\tloglevel::ERROR: _logger->error(str);\tbreak;\n\t\tcase\tloglevel::CRITICAL: _logger->critical(str);\tbreak;\n\t\tcase\tloglevel::ALERT: _logger->alert(str);\tbreak;\n\t\tcase\tloglevel::EMERG: _logger->emerg(str);\tbreak;\n\t\t}\n\t}\n\telse\n\t{\n\t\tswitch(level)\n\t\t{\n\t\tcase\tloglevel::TRACE:\tcout << \"[TRACE]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::DEBUG:\tcout << \"[DEBUG]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::INFO:\tcout << \"[INFO]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::NOTICE: cout << \"[NOTICE]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::WARN: cout << \"[WARN]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::ERROR: cout << \"[ERROR]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::CRITICAL: cout << \"[CRITICAL]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::ALERT: cout << \"[ALERT]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::EMERG: cout << \"[EMERG]\\t\"\t<< str << endl;\tbreak;\n\t\t}\n\t}\n}\n\nvoid logger::adopt(interface::ilog* intlog)\n{\n\t_logger = intlog;\n}\n\n\/*\nvoid logger::trace(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[TRACE] \" << logstr << endl;\n}\nvoid logger::debug(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[DEBUG] \" << logstr << endl;\n}\nvoid logger::info(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[INFO] \" << logstr << endl;\n}\nvoid logger::notice(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[NOTICE] \" << logstr << endl;\n}\nvoid logger::warn(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[WARNING] \" << logstr << endl;\n}\nvoid logger::error(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[RROR] \" << logstr << endl;\n}\nvoid logger::critical(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[CRITICAL] \" << logstr << endl;\n}\nvoid logger::alert(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[ALERT] \" << logstr << endl;\n}\nvoid logger::emerg(const char* logstr)\n{\n\tcout << _time.current_formatted() << \"[EMERGENCY] \" << logstr << endl;\n}\n*\/\n} \/* namespace log *\/\n} \/* namespace cossb *\/\n<commit_msg>remove comment<commit_after>\/*\n * logger.cpp\n *\n *  Created on: 2015. 8. 9.\n *      Author: hwang-linux\n *\/\n\n#include \"logger.hpp\"\n#include <iostream>\n#include \"interface\/ilog.hpp\"\n#include \"util\/format.h\"\n\nnamespace cossb {\nnamespace log {\n\nlogger::logger(){ }\nlogger::logger(interface::ilog* log):_logger(log) { }\n\nlogger::~logger() {\n\t_logger = nullptr;\n\n}\nvoid logger::log(const log::loglevel level, const char* str)\n{\n\tlog_base(level, str);\n}\n\nvoid logger::log_base(const loglevel level, const char* str)\n{\n\tif(_logger)\n\t{\n\t\tswitch(level)\n\t\t{\n\t\tcase\tloglevel::TRACE:\t_logger->trace(str);\tbreak;\n\t\tcase\tloglevel::DEBUG:\t_logger->debug(str);\tbreak;\n\t\tcase\tloglevel::INFO:\t_logger->info(str);\tbreak;\n\t\tcase\tloglevel::NOTICE: _logger->notice(str);\tbreak;\n\t\tcase\tloglevel::WARN: _logger->warn(str);\tbreak;\n\t\tcase\tloglevel::ERROR: _logger->error(str);\tbreak;\n\t\tcase\tloglevel::CRITICAL: _logger->critical(str);\tbreak;\n\t\tcase\tloglevel::ALERT: _logger->alert(str);\tbreak;\n\t\tcase\tloglevel::EMERG: _logger->emerg(str);\tbreak;\n\t\t}\n\t}\n\telse\n\t{\n\t\tswitch(level)\n\t\t{\n\t\tcase\tloglevel::TRACE:\tcout << \"[TRACE]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::DEBUG:\tcout << \"[DEBUG]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::INFO:\tcout << \"[INFO]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::NOTICE: cout << \"[NOTICE]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::WARN: cout << \"[WARN]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::ERROR: cout << \"[ERROR]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::CRITICAL: cout << \"[CRITICAL]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::ALERT: cout << \"[ALERT]\\t\"\t<< str << endl;\tbreak;\n\t\tcase\tloglevel::EMERG: cout << \"[EMERG]\\t\"\t<< str << endl;\tbreak;\n\t\t}\n\t}\n}\n\nvoid logger::adopt(interface::ilog* intlog)\n{\n\t_logger = intlog;\n}\n\n} \/* namespace log *\/\n} \/* namespace cossb *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @author    Matei David, Ontario Institute for Cancer Research\n\/\/\/ @version   1.0\n\/\/\/ @date      2013-2015\n\/\/\/ @copyright MIT Public License\n\/\/\/\n\/\/\/ Logger mechanism.\n\/\/\/\n\/\/\/ Properties:\n\/\/\/ - thread-safe, non-garbled output (uses c++11's thread_local)\n\/\/\/ - customizable ostream sink. by default, uses std::clog\n\/\/\/\n\/\/\/ Exports:\n\/\/\/ - \"LOG\" macro (takes 1, 2, or 3 arguments, see below)\n\/\/\/ - \"logger\" namespace\n\/\/\/ - \"logger::level\" enum\n\/\/\/ - \"logger::Logger\" class\n\/\/\/\n\/\/\/ To use:\n\/\/\/ - In source code, use:\n\/\/\/\n\/\/\/     LOG(info) << \"hello\" << endl;\n\/\/\/     \/\/ or \n\/\/\/     LOG(\"main\", info) << \"hello\" << endl;\n\/\/\/     \/\/ or \n\/\/\/     LOG(\"main\", info, sink_os) << \"hello\" << endl;\n\/\/\/\n\/\/\/   Here, \"main\" is the facility (a string) and info is the message level.\n\/\/\/   Note that \"logger\" is a macro which knows how to look up the name info\n\/\/\/   inside logger namespace. The macro introduces C++ code equivalent to:\n\/\/\/\n\/\/\/     if (...message should be ignored...) then; else sink_os\n\/\/\/\n\/\/\/   NOTE: As with assert(), the code in the output stream following the\n\/\/\/   LOG() macro will ***not be executed*** if the log level of the\n\/\/\/   facility is higher than the level of the message.\n\/\/\/\n\/\/\/ - To set the default log level (for unspecified facilities):\n\/\/\/\n\/\/\/     logger::Logger::set_default_level(logger::Logger::level_from_string(s));\n\/\/\/\n\/\/\/ - To set the log level for the \"main\" facility:\n\/\/\/\n\/\/\/     logger::Logger::set_facility_level(\"main\", logger::Logger::level_from_string(s));\n\/\/\/\n\/\/\/ - To parse a log facility level setting in the form \"[<facility>:]<level>\":\n\/\/\/\n\/\/\/     logger::Logger::set_level_from_option(\"alt:debug1\", &cerr);\n\/\/\/\n\/\/\/ - By using these functions, one can set log levels using command-line\n\/\/\/   parameters and achieve dynamic log level settings without recompiling.\n\n#ifndef __LOGGER_HPP\n#define __LOGGER_HPP\n\n#include <string>\n#include <vector>\n#include <map>\n#include <sstream>\n#include <iostream>\n#include <mutex>\n\nnamespace logger\n{\n\n\/\/ log levels\nenum level\n{\n    error = 0,\n    warning,\n    info,\n    debug,\n    debug1,\n    debug2\n};\n\nclass Logger\n    : public std::ostringstream\n{\npublic:\n    \/\/ Constructor: initialize buffer.\n    Logger(const std::string& facility, level msg_level,\n           const std::string& file_name, unsigned line_num, const std::string& func_name,\n           std::ostream& os = std::clog)\n        : _os_p(&os)\n    {\n        *this << \"= \" << facility << \".\" << int(msg_level)\n              << \" \" << file_name << \":\" << line_num\n              << \" \" << func_name << \" \";\n    }\n    \/\/ Destructor: dump buffer to output.\n    ~Logger()\n    {\n        _os_p->write(this->str().c_str(), this->str().size());\n    }\n    \/\/ Produce l-value for output chaining.\n    std::ostream& l_value() { return *this; }\n\n    \/\/ static methods for setting and getting facility log levels.\n    static level get_default_level()\n    {\n        return default_level();\n    }\n    static void set_default_level(level l)\n    {\n        static std::mutex m;\n        std::lock_guard< std::mutex > lg(m);\n        default_level() = l;\n    }\n    static void set_default_level(int l)\n    {\n        set_default_level(get_level(l));\n    }\n    static void set_default_level(const std::string& s)\n    {\n        set_default_level(get_level(s));\n    }\n    static level get_facility_level(const std::string& facility)\n    {\n        return (facility_level_map().count(facility) > 0?\n                facility_level_map().at(facility) : get_default_level());\n    }\n    static void set_facility_level(const std::string& facility, level l)\n    {\n        static std::mutex m;\n        std::lock_guard< std::mutex > lg(m);\n        facility_level_map()[facility] = l;\n    }\n    static void set_facility_level(const std::string& facility, int l)\n    {\n        set_facility_level(facility, get_level(l));\n    }\n    static void set_facility_level(const std::string& facility, const std::string& s)\n    {\n        set_facility_level(facility, get_level(s));\n    }\n    \/\/ static methods for setting log levels from command-line options\n    static void set_level_from_option(const std::string& l, std::ostream* os_p = nullptr)\n    {\n        size_t i = l.find(':');\n        if (i == std::string::npos)\n        {\n            set_default_level(l);\n            if (os_p)\n            {\n                (*os_p) << \"set default log level to: \"\n                        << static_cast< int >(Logger::get_default_level()) << std::endl;\n            }\n        }\n        else\n        {\n            set_facility_level(l.substr(0, i), l.substr(i + 1));\n            if (os_p)\n            {\n                (*os_p) << \"set log level of '\" << l.substr(0, i) << \"' to: \"\n                        << static_cast< int >(Logger::get_facility_level(l.substr(0, i))) << std::endl;\n            }\n        }\n    }\n    static void set_levels_from_options(const std::vector< std::string >& v, std::ostream* os_p = nullptr)\n    {\n        for (const auto& l : v)\n        {\n            set_level_from_option(l, os_p);\n        }\n    }\n    \/\/ public static utility functions (used by LOG macro)\n    static level get_level(level l) { return l; }\n    static level get_level(int i) { return static_cast< level >(i); }\n    static level get_level(const std::string& s) { return level_from_string(s); }\n    \/\/ public static member (used by LOG macro)\n    static level& thread_local_last_level()\n    {\n        static thread_local level _last_level = error;\n        return _last_level;\n    }\nprivate:\n    \/\/ sink for this Logger object\n    std::ostream* _os_p;\n\n    \/\/ private static data members\n    static level& default_level()\n    {\n        static level _default_level = error;\n        return _default_level;\n    }\n    static std::map< std::string, level >& facility_level_map()\n    {\n        static std::map< std::string, level > _facility_level_map;\n        return _facility_level_map;\n    }\n    \/\/ private static utility functions\n    static level level_from_string(const std::string& s)\n    {\n        std::istringstream iss(s + \"\\n\");\n        int tmp_int = -1;\n        iss >> tmp_int;\n        if (iss.good())\n        {\n            return level(tmp_int);\n        }\n        else\n        {\n            if (s == \"error\") return logger::error;\n            else if (s == \"warning\") return logger::warning;\n            else if (s == \"info\") return logger::info;\n            else if (s == \"debug\") return logger::debug;\n            else if (s == \"debug1\") return logger::debug1;\n            else if (s == \"debug2\") return logger::debug2;\n            else\n            {\n                std::cerr << \"could not parse log level: \" << s << \"\\n\";\n                std::exit(1);\n            }\n        }\n    }\n}; \/\/ class Logger\n\n} \/\/namespace logger\n\n#define __FILENAME__ (std::string(__FILE__).find('\/') != std::string::npos? std::string(__FILE__).substr(std::string(__FILE__).rfind('\/') + 1) : std::string(__FILE__))\n\n\/**\n * LOG macro\n *\n * Synopsis:\n *   LOG(facility, level_spec, sink) << message\n *   LOG(facility, level_spec) << message\n *   LOG(level_spec) << message\n *\n *   `facility`   : string\n *   `level_spec` : integer, string, or logger level\n *   `sink`       : sink ostream\n * \n * Log to `facility` at logger level `level_spec` and dump output to `sink`.\n * If sink is omitted, it defaults to std::clog.\n * If `facility` is omitted (logger has single argument), the macro LOG_FACILITY\n * is used instead, defaulting to \"main\".\n *\/\n\n#define __LOG_3(facility, level_spec, sink)                                   \\\n    { using namespace logger; logger::Logger::thread_local_last_level() = logger::Logger::get_level(level_spec); } \\\n    if (logger::Logger::thread_local_last_level() > logger::Logger::get_facility_level(facility)) ; \\\n    else logger::Logger(facility, logger::Logger::thread_local_last_level(), __FILENAME__, __LINE__, __func__, sink).l_value()\n\n#define __LOG_2(facility, level_spec)                                   \\\n    { using namespace logger; logger::Logger::thread_local_last_level() = logger::Logger::get_level(level_spec); } \\\n    if (logger::Logger::thread_local_last_level() > logger::Logger::get_facility_level(facility)) ; \\\n    else logger::Logger(facility, logger::Logger::thread_local_last_level(), __FILENAME__, __LINE__, __func__).l_value()\n\n#define __LOG_1(level_spec) \\\n    __LOG_2(LOG_FACILITY, level_spec)\n\n\/\/ we need 2-level indirection in order to trigger expansion after token pasting\n\/\/ http:\/\/stackoverflow.com\/questions\/1597007\/creating-c-macro-with-and-line-token-concatenation-with-positioning-macr\n\/\/ http:\/\/stackoverflow.com\/a\/11763196\/717706\n#ifdef WIN32\n#define __EXPAND(...) __VA_ARGS__\n#define __LOG_aux2(N, ...) __EXPAND(__LOG_ ## N (__VA_ARGS__))\n#else\n#define __LOG_aux2(N, ...) __LOG_ ## N (__VA_ARGS__)\n#endif\n\n#define __LOG_aux1(N, ...) __LOG_aux2(N, __VA_ARGS__)\n\n#define __NARGS_AUX(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9, ...) _9\n\n#ifdef WIN32\n#define __NARGS(...) __EXPAND(__NARGS_AUX(__VA_ARGS__, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0))\n#else\n#define __NARGS(...) __NARGS_AUX(__VA_ARGS__, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0)\n#endif\n\n#ifndef LOG_FACILITY\n#define LOG_FACILITY \"main\"\n#endif\n\n#define LOG(...) __LOG_aux1(__NARGS(__VA_ARGS__), __VA_ARGS__)\n\n#endif\n\n#ifdef SAMPLE_LOGGER\n\n\/*\n\nCompile:\n\ng++ -std=c++11 -D SAMPLE_LOGGER -x c++ logger.hpp -o sample-logger\n\nRun:\n.\/sample-logger info\n.\/sample-logger info alt:debug1\n\n*\/\n\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n    if (argc < 2)\n    {\n        cerr << \"Use: \" << argv[0] << \" <log_level_setting> ...\" << endl\n             << \"The program sends 5 log messages with decreasing priority (0=highest, 4=lowest)\" << endl\n             << \"to 2 facilities \\\"main\\\" and \\\"alt\\\". Command-line arguments are interpreted as\" << endl\n             << \"log facility level settings in the form [<facility>:]<level>.\" << endl;\n        return EXIT_FAILURE;\n    }\n    for (int i = 1; i < argc; ++i)\n    {\n        cerr << \"processing argument [\" << argv[i] << \"]\" << endl;\n        logger::Logger::set_level_from_option(argv[i], &cerr);\n    }\n    const vector< string > level_name{ \"error\", \"warning\", \"info\", \"debug\", \"debug1\", \"debug2\" };\n    for (int l = 0; l < 5; ++l)\n    {\n        LOG(level_name[l]) << \"message at level \" << l << \" (\" << level_name[l]\n                           << \") for facility main\" << endl;\n        LOG(\"alt\", l) << \"message at level \" << l << \" (\" << level_name[l]\n                      << \") for facility alt\" << endl;\n    }\n}\n\n#endif\n<commit_msg>added LOG_ABORT and LOG_EXIT<commit_after>\/\/\/ @author    Matei David, Ontario Institute for Cancer Research\n\/\/\/ @version   1.0\n\/\/\/ @date      2013-2015\n\/\/\/ @copyright MIT Public License\n\/\/\/\n\/\/\/ Logger mechanism.\n\/\/\/\n\/\/\/ Properties:\n\/\/\/ - thread-safe, non-garbled output (uses c++11's thread_local)\n\/\/\/ - customizable ostream sink. by default, uses std::clog\n\/\/\/\n\/\/\/ Exports:\n\/\/\/ - \"LOG\" macro (takes 1, 2, or 3 arguments, see below)\n\/\/\/ - \"logger\" namespace\n\/\/\/ - \"logger::level\" enum\n\/\/\/ - \"logger::Logger\" class\n\/\/\/\n\/\/\/ To use:\n\/\/\/ - In source code, use:\n\/\/\/\n\/\/\/     LOG(info) << \"hello\" << endl;\n\/\/\/     \/\/ or \n\/\/\/     LOG(\"main\", info) << \"hello\" << endl;\n\/\/\/     \/\/ or \n\/\/\/     LOG(\"main\", info, sink_os) << \"hello\" << endl;\n\/\/\/\n\/\/\/   Here, \"main\" is the facility (a string) and info is the message level.\n\/\/\/   Note that \"logger\" is a macro which knows how to look up the name info\n\/\/\/   inside logger namespace. The macro introduces C++ code equivalent to:\n\/\/\/\n\/\/\/     if (...message should be ignored...) then; else sink_os\n\/\/\/\n\/\/\/   NOTE: As with assert(), the code in the output stream following the\n\/\/\/   LOG() macro will ***not be executed*** if the log level of the\n\/\/\/   facility is higher than the level of the message.\n\/\/\/\n\/\/\/ - To set the default log level (for unspecified facilities):\n\/\/\/\n\/\/\/     logger::Logger::set_default_level(logger::Logger::level_from_string(s));\n\/\/\/\n\/\/\/ - To set the log level for the \"main\" facility:\n\/\/\/\n\/\/\/     logger::Logger::set_facility_level(\"main\", logger::Logger::level_from_string(s));\n\/\/\/\n\/\/\/ - To parse a log facility level setting in the form \"[<facility>:]<level>\":\n\/\/\/\n\/\/\/     logger::Logger::set_level_from_option(\"alt:debug1\", &cerr);\n\/\/\/\n\/\/\/ - By using these functions, one can set log levels using command-line\n\/\/\/   parameters and achieve dynamic log level settings without recompiling.\n\n#ifndef __LOGGER_HPP\n#define __LOGGER_HPP\n\n#include <string>\n#include <vector>\n#include <map>\n#include <sstream>\n#include <iostream>\n#include <mutex>\n\nnamespace logger\n{\n\n\/\/ log levels\nenum level\n{\n    error = 0,\n    warning,\n    info,\n    debug,\n    debug1,\n    debug2\n};\n\nclass Logger\n    : public std::ostringstream\n{\npublic:\n    \/\/ Constructor: initialize buffer.\n    Logger(const std::string& facility, level msg_level,\n           const std::string& file_name, unsigned line_num, const std::string& func_name,\n           std::ostream& os = std::clog)\n        : _os_p(&os), _policy(0)\n    {\n        *this << \"= \" << facility << \".\" << int(msg_level)\n              << \" \" << file_name << \":\" << line_num\n              << \" \" << func_name << \" \";\n    }\n    Logger(int policy, const std::string& file_name, unsigned line_num, const std::string& func_name,\n           std::ostream& os = std::cerr)\n        : _os_p(&os), _policy(policy)\n    {\n        *this << \"= main.\" << int(error)\n              << \" \" << file_name << \":\" << line_num\n              << \" \" << func_name << \" \";\n    }\n    \/\/ Destructor: dump buffer to output.\n    ~Logger()\n    {\n        _os_p->write(this->str().c_str(), this->str().size());\n        if (_policy < 0) std::abort();\n        if (_policy > 0) std::exit(_policy);\n    }\n    \/\/ Produce l-value for output chaining.\n    std::ostream& l_value() { return *this; }\n\n    \/\/ static methods for setting and getting facility log levels.\n    static level get_default_level()\n    {\n        return default_level();\n    }\n    static void set_default_level(level l)\n    {\n        static std::mutex m;\n        std::lock_guard< std::mutex > lg(m);\n        default_level() = l;\n    }\n    static void set_default_level(int l)\n    {\n        set_default_level(get_level(l));\n    }\n    static void set_default_level(const std::string& s)\n    {\n        set_default_level(get_level(s));\n    }\n    static level get_facility_level(const std::string& facility)\n    {\n        return (facility_level_map().count(facility) > 0?\n                facility_level_map().at(facility) : get_default_level());\n    }\n    static void set_facility_level(const std::string& facility, level l)\n    {\n        static std::mutex m;\n        std::lock_guard< std::mutex > lg(m);\n        facility_level_map()[facility] = l;\n    }\n    static void set_facility_level(const std::string& facility, int l)\n    {\n        set_facility_level(facility, get_level(l));\n    }\n    static void set_facility_level(const std::string& facility, const std::string& s)\n    {\n        set_facility_level(facility, get_level(s));\n    }\n    \/\/ static methods for setting log levels from command-line options\n    static void set_level_from_option(const std::string& l, std::ostream* os_p = nullptr)\n    {\n        size_t i = l.find(':');\n        if (i == std::string::npos)\n        {\n            set_default_level(l);\n            if (os_p)\n            {\n                (*os_p) << \"set default log level to: \"\n                        << static_cast< int >(Logger::get_default_level()) << std::endl;\n            }\n        }\n        else\n        {\n            set_facility_level(l.substr(0, i), l.substr(i + 1));\n            if (os_p)\n            {\n                (*os_p) << \"set log level of '\" << l.substr(0, i) << \"' to: \"\n                        << static_cast< int >(Logger::get_facility_level(l.substr(0, i))) << std::endl;\n            }\n        }\n    }\n    static void set_levels_from_options(const std::vector< std::string >& v, std::ostream* os_p = nullptr)\n    {\n        for (const auto& l : v)\n        {\n            set_level_from_option(l, os_p);\n        }\n    }\n    \/\/ public static utility functions (used by LOG macro)\n    static level get_level(level l) { return l; }\n    static level get_level(int i) { return static_cast< level >(i); }\n    static level get_level(const std::string& s) { return level_from_string(s); }\n    \/\/ public static member (used by LOG macro)\n    static level& thread_local_last_level()\n    {\n        static thread_local level _last_level = error;\n        return _last_level;\n    }\nprivate:\n    \/\/ sink for this Logger object\n    std::ostream* _os_p;\n    int _policy;\n\n    \/\/ private static data members\n    static level& default_level()\n    {\n        static level _default_level = error;\n        return _default_level;\n    }\n    static std::map< std::string, level >& facility_level_map()\n    {\n        static std::map< std::string, level > _facility_level_map;\n        return _facility_level_map;\n    }\n    \/\/ private static utility functions\n    static level level_from_string(const std::string& s)\n    {\n        std::istringstream iss(s + \"\\n\");\n        int tmp_int = -1;\n        iss >> tmp_int;\n        if (iss.good())\n        {\n            return level(tmp_int);\n        }\n        else\n        {\n            if (s == \"error\") return logger::error;\n            else if (s == \"warning\") return logger::warning;\n            else if (s == \"info\") return logger::info;\n            else if (s == \"debug\") return logger::debug;\n            else if (s == \"debug1\") return logger::debug1;\n            else if (s == \"debug2\") return logger::debug2;\n            else\n            {\n                std::cerr << \"could not parse log level: \" << s << \"\\n\";\n                std::exit(1);\n            }\n        }\n    }\n}; \/\/ class Logger\n\n} \/\/namespace logger\n\n#define __FILENAME__ (std::string(__FILE__).find('\/') != std::string::npos? std::string(__FILE__).substr(std::string(__FILE__).rfind('\/') + 1) : std::string(__FILE__))\n\n\/**\n * LOG macro\n *\n * Synopsis:\n *   LOG(facility, level_spec, sink) << message\n *   LOG(facility, level_spec) << message\n *   LOG(level_spec) << message\n *\n *   `facility`   : string\n *   `level_spec` : integer, string, or logger level\n *   `sink`       : sink ostream\n * \n * Log to `facility` at logger level `level_spec` and dump output to `sink`.\n * If sink is omitted, it defaults to std::clog.\n * If `facility` is omitted (logger has single argument), the macro LOG_FACILITY\n * is used instead, defaulting to \"main\".\n *\/\n\n#define __LOG_3(facility, level_spec, sink)                                   \\\n    { using namespace logger; logger::Logger::thread_local_last_level() = logger::Logger::get_level(level_spec); } \\\n    if (logger::Logger::thread_local_last_level() > logger::Logger::get_facility_level(facility)) ; \\\n    else logger::Logger(facility, logger::Logger::thread_local_last_level(), __FILENAME__, __LINE__, __func__, sink).l_value()\n\n#define __LOG_2(facility, level_spec)                                   \\\n    { using namespace logger; logger::Logger::thread_local_last_level() = logger::Logger::get_level(level_spec); } \\\n    if (logger::Logger::thread_local_last_level() > logger::Logger::get_facility_level(facility)) ; \\\n    else logger::Logger(facility, logger::Logger::thread_local_last_level(), __FILENAME__, __LINE__, __func__).l_value()\n\n#define __LOG_1(level_spec) \\\n    __LOG_2(LOG_FACILITY, level_spec)\n\n\/\/ we need 2-level indirection in order to trigger expansion after token pasting\n\/\/ http:\/\/stackoverflow.com\/questions\/1597007\/creating-c-macro-with-and-line-token-concatenation-with-positioning-macr\n\/\/ http:\/\/stackoverflow.com\/a\/11763196\/717706\n#ifdef WIN32\n#define __EXPAND(...) __VA_ARGS__\n#define __LOG_aux2(N, ...) __EXPAND(__LOG_ ## N (__VA_ARGS__))\n#else\n#define __LOG_aux2(N, ...) __LOG_ ## N (__VA_ARGS__)\n#endif\n\n#define __LOG_aux1(N, ...) __LOG_aux2(N, __VA_ARGS__)\n\n#define __NARGS_AUX(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9, ...) _9\n\n#ifdef WIN32\n#define __NARGS(...) __EXPAND(__NARGS_AUX(__VA_ARGS__, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0))\n#else\n#define __NARGS(...) __NARGS_AUX(__VA_ARGS__, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0)\n#endif\n\n#ifndef LOG_FACILITY\n#define LOG_FACILITY \"main\"\n#endif\n\n#define LOG(...) __LOG_aux1(__NARGS(__VA_ARGS__), __VA_ARGS__)\n#define LOG_EXITCODE(c) logger::Logger((c), __FILENAME__, __LINE__, __func__).l_value()\n#define LOG_ABORT LOG_EXITCODE(-1)\n#define LOG_EXIT LOG_EXITCODE(EXIT_FAILURE)\n\n#endif\n\n#ifdef SAMPLE_LOGGER\n\n\/*\n\nCompile:\n\ng++ -std=c++11 -D SAMPLE_LOGGER -x c++ logger.hpp -o sample-logger\n\nRun:\n.\/sample-logger info\n.\/sample-logger info alt:debug1\n\n*\/\n\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n    if (argc < 2)\n    {\n        cerr << \"Use: \" << argv[0] << \" <log_level_setting> ...\" << endl\n             << \"The program sends 5 log messages with decreasing priority (0=highest, 4=lowest)\" << endl\n             << \"to 2 facilities \\\"main\\\" and \\\"alt\\\". Command-line arguments are interpreted as\" << endl\n             << \"log facility level settings in the form [<facility>:]<level>.\" << endl;\n        return EXIT_FAILURE;\n    }\n    for (int i = 1; i < argc; ++i)\n    {\n        cerr << \"processing argument [\" << argv[i] << \"]\" << endl;\n        logger::Logger::set_level_from_option(argv[i], &cerr);\n    }\n    const vector< string > level_name{ \"error\", \"warning\", \"info\", \"debug\", \"debug1\", \"debug2\" };\n    for (int l = 0; l < 5; ++l)\n    {\n        LOG(level_name[l]) << \"message at level \" << l << \" (\" << level_name[l]\n                           << \") for facility main\" << endl;\n        LOG(\"alt\", l) << \"message at level \" << l << \" (\" << level_name[l]\n                      << \") for facility alt\" << endl;\n    }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip>\n#include <fstream>\n\nusing namespace std;\n\nclass Matrix\n{\nprivate:\n\tint **matr;\n\tint st, cl;\n\npublic:\n\tMatrix();\n\tMatrix(int, int);\n\tMatrix(Matrix const &matrc);\n\t~Matrix();\n\tint rows()const;\n\tint columns()const;\n\tMatrix operator+ (const Matrix &mat_2) const;\n\tMatrix operator* (const Matrix &mat_2) const;\n\tMatrix& operator =(Matrix &);\n\tbool operator==(const Matrix&)const;\n\tfriend istream& operator >> (istream& ist, Matrix& cmatr);\n\tfriend ostream& operator << (ostream&, const Matrix&);\n};\n<commit_msg>Update matrix.hpp<commit_after>#include <iostream>\n#include <iomanip>\n#include <fstream>\n\nusing namespace std;\n\nclass Matrix\n{\nprivate:\n\tint **matr;\n\tint st, cl;\n\npublic:\n\tMatrix();\n\tMatrix(int, int);\n\tMatrix(const Matrix &matrc);\n\t~Matrix();\n\tint rows()const;\n\tint columns()const;\n\tMatrix operator+ (const Matrix &mat_2) const;\n\tMatrix operator* (const Matrix &mat_2) const;\n\tMatrix& operator =(Matrix &);\n\tbool operator==(const Matrix&)const;\n\tfriend istream& operator >> (istream& ist, Matrix& cmatr);\n\tfriend ostream& operator << (ostream&, const Matrix&);\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Converts tree.json to data.csv and tree.newick for https:\/\/github.com\/acorg\/isig\n\n#include \"acmacs-base\/data-formatter.hh\"\n#include \"acmacs-base\/read-file.hh\"\n#include \"acmacs-base\/enumerate.hh\"\n#include \"seqdb\/seqdb.hh\"\n#include \"acmacs-chart-2\/chart.hh\"\n#include \"acmacs-chart-2\/factory-import.hh\"\n#include \"signature-page\/tree.hh\"\n#include \"signature-page\/tree-export.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nconst size_t sBjornPos[] = {145, 155, 156, 158, 159, 189, 193};\n\nint main(int argc, const char* const* argv)\n{\n    int exit_code = 0;\n    if (argc == 5) {\n        std::string source_tree_file = argv[1];\n        std::string source_chart = argv[2];\n        std::string target_csv = argv[3];\n        std::string target_tree_file = argv[4];\n\n        const auto seqdb = seqdb::get();\n        Tree tree;\n        tree_import(source_tree_file, tree);\n          \/\/ tree.match_seqdb(seqdb);\n\n        auto chart = acmacs::chart::import_from_file(source_chart); \/\/ , acmacs::chart::Verify::None, report_time::No\n        auto antigens = chart->antigens();\n        const auto per_antigen = seqdb.match(*antigens, chart->info()->virus_type());\n\n          \/\/ data.csv: no,map_x,map_y,date,antigen name,bjorn-145,155,156,158,159,189,193\n        auto layout = chart->projection(0)->layout();\n        const auto number_of_dimensions = layout->number_of_dimensions();\n        std::string data_csv;\n        using DF = acmacs::DataFormatterCSV;\n        size_t antigens_in_tree = 0;\n        for (auto [ag_no, antigen] : acmacs::enumerate(*antigens)) {\n            DF::first_field(data_csv, ag_no);\n            for (auto dim : acmacs::range(number_of_dimensions))\n                DF::second_field(data_csv, (*layout)(ag_no, dim));\n            DF::second_field(data_csv, antigen->date());\n            DF::second_field(data_csv, antigen->full_name());\n            const auto& entry = per_antigen[ag_no];\n            if (entry) {\n                \/\/ std::cout << \"entry \" << entry.entry().name() << \" -- \" << antigen->full_name() << '\\n';\n                const auto seq = entry.seq().amino_acids(true);\n                for (auto bp : sBjornPos)\n                    DF::second_field(data_csv, seq[bp - 1]);\n                if (auto node = tree.find_leaf_by_seqid(entry.seq_id(seqdb::SeqdbEntrySeq::encoded_t::yes)); node) {\n                      \/\/ std::cout << ag_no << ' ' << node->seq_id << '\\n';\n                    node->seq_id = \"s-\" + std::to_string(ag_no); \/\/ rename node according to isig spec\n                    ++antigens_in_tree;\n                }\n            }\n            else {\n                for ([[maybe_unused ]] auto bp : sBjornPos)\n                    DF::second_field(data_csv, \"\");\n            }\n            DF::end_of_record(data_csv);\n        }\n        acmacs::file::write(target_csv, data_csv);\n        std::cerr << \"INFO: antigens of chart found in the tree: \" << antigens_in_tree << '\\n';\n\n          \/\/ rename rest of tree nodes\n        size_t tree_node_id = layout->number_of_points();\n\n        tree_export_to_json(target_tree_file, tree, 2);\n    }\n    else {\n        std::cerr << \"Usage: \" << argv[0] << \" tree.json[.xz] chart.ace data.csv tree.newick\\n\";\n        exit_code = 1;\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>make-isig development<commit_after>\/\/ Converts tree.json to data.csv and tree.newick for https:\/\/github.com\/acorg\/isig\n\n#include \"acmacs-base\/data-formatter.hh\"\n#include \"acmacs-base\/read-file.hh\"\n#include \"acmacs-base\/enumerate.hh\"\n#include \"seqdb\/seqdb.hh\"\n#include \"acmacs-chart-2\/chart.hh\"\n#include \"acmacs-chart-2\/factory-import.hh\"\n#include \"signature-page\/tree.hh\"\n#include \"signature-page\/tree-export.hh\"\n#include \"signature-page\/tree-iterate.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nconst size_t sBjornPos[] = {145, 155, 156, 158, 159, 189, 193};\n\nint main(int argc, const char* const* argv)\n{\n    int exit_code = 0;\n    if (argc == 5) {\n        std::string source_tree_file = argv[1];\n        std::string source_chart = argv[2];\n        std::string target_csv = argv[3];\n        std::string target_tree_file = argv[4];\n\n        const auto seqdb = seqdb::get();\n        Tree tree;\n        tree_import(source_tree_file, tree);\n          \/\/ tree.match_seqdb(seqdb);\n\n        auto chart = acmacs::chart::import_from_file(source_chart); \/\/ , acmacs::chart::Verify::None, report_time::No\n        auto antigens = chart->antigens();\n        const auto per_antigen = seqdb.match(*antigens, chart->info()->virus_type());\n\n          \/\/ data.csv: no,map_x,map_y,date,antigen name,bjorn-145,155,156,158,159,189,193\n        auto layout = chart->projection(0)->layout();\n        const auto number_of_dimensions = layout->number_of_dimensions();\n        std::string data_csv;\n        using DF = acmacs::DataFormatterCSV;\n        size_t antigens_in_tree = 0;\n        for (auto [ag_no, antigen] : acmacs::enumerate(*antigens)) {\n            DF::first_field(data_csv, ag_no);\n            for (auto dim : acmacs::range(number_of_dimensions))\n                DF::second_field(data_csv, (*layout)(ag_no, dim));\n            DF::second_field(data_csv, antigen->date());\n            DF::second_field(data_csv, antigen->full_name());\n            const auto& entry = per_antigen[ag_no];\n            if (entry) {\n                \/\/ std::cout << \"entry \" << entry.entry().name() << \" -- \" << antigen->full_name() << '\\n';\n                const auto seq = entry.seq().amino_acids(true);\n                for (auto bp : sBjornPos)\n                    DF::second_field(data_csv, seq[bp - 1]);\n                if (auto node = tree.find_leaf_by_seqid(entry.seq_id(seqdb::SeqdbEntrySeq::encoded_t::yes)); node) {\n                      \/\/ std::cout << ag_no << ' ' << node->seq_id << '\\n';\n                    node->seq_id = \"s-\" + std::to_string(ag_no); \/\/ rename node according to isig spec\n                    ++antigens_in_tree;\n                }\n            }\n            else {\n                for ([[maybe_unused ]] auto bp : sBjornPos)\n                    DF::second_field(data_csv, \"\");\n            }\n            DF::end_of_record(data_csv);\n        }\n        acmacs::file::write(target_csv, data_csv);\n        std::cerr << \"INFO: antigens of chart found in the tree: \" << antigens_in_tree << '\\n';\n\n          \/\/ rename rest of tree nodes\n        size_t tree_node_id = layout->number_of_points();\n        tree::iterate_leaf(tree, [&tree_node_id](Node& node) {\n            if (node.seq_id.substr(0, 2) != \"s-\")\n                node.seq_id = \"s-\" + std::to_string(++tree_node_id);\n        });\n\n        tree_export_to_json(target_tree_file, tree, 2);\n    }\n    else {\n        std::cerr << \"Usage: \" << argv[0] << \" tree.json[.xz] chart.ace data.csv tree.newick\\n\";\n        exit_code = 1;\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 \"..\/util\/string_piece.hh\"\n#include \"..\/util\/murmur_hash.hh\"\n#include \"util\/string_piece.hh\"  \/\/Tokenization and work with StringPiece\n#include \"util\/tokenize_piece.hh\"\n#include <vector>\n\n\/\/Gets the MurmurmurHash for give string\nuint64_t getHash(StringPiece text); \n\nstd::vector<uint64_t> getVocabIDs(StringPiece textin);\n\nuint64_t getVocabID(std::string candidate);<commit_msg>Include hash only once<commit_after>#pragma once\n\n#include \"..\/util\/string_piece.hh\"\n#include \"..\/util\/murmur_hash.hh\"\n#include \"util\/string_piece.hh\"  \/\/Tokenization and work with StringPiece\n#include \"util\/tokenize_piece.hh\"\n#include <vector>\n\n\/\/Gets the MurmurmurHash for give string\nuint64_t getHash(StringPiece text); \n\nstd::vector<uint64_t> getVocabIDs(StringPiece textin);\n\nuint64_t getVocabID(std::string candidate);<|endoftext|>"}
{"text":"<commit_before>#include \"bob.h\"\n#include <algorithm>\n#include <cctype>\n#include <iterator>\n\nusing namespace std;\n\nnamespace bob\n{\nnamespace\n{\n\nbool is_upper(string const& text)\n{\n    auto last = end(text);\n    auto it = find_if_not(begin(text), last,\n        [](char c) { return c == toupper(c); });\n    return it == last;\n}\n\nbool has_alpha(string const& text)\n{\n    auto last = end(text);\n    auto it = find_if(begin(text), last, [](char c) { return isalpha(c) != 0; });\n    return it != last;\n}\n\nstring trim(string const& text)\n{\n    auto first = text.find_first_not_of(' ');\n    if (first == string::npos) {\n        return string{};\n    }\n    auto last = text.find_last_not_of(' ');\n    return string(&text[first], &text[last]);\n}\n\nbool is_shouting(string const &text)\n{\n    return is_upper(text) && has_alpha(text);\n}\n\nbool is_question(string const &text)\n{\n    return text.back() == '?';\n}\n\nbool is_silence(string const& text)\n{\n    return trim(text).length() == 0;\n}\n\n}\n\nstring hey(string const& text)\n{\n    if (is_silence(text)) {\n        return \"Fine. Be that way!\";\n    }\n    if (is_shouting(text)) {\n        return \"Woah, chill out!\";\n    }\n    if (is_question(text)) {\n        return \"Sure.\";\n    }\n    return \"Whatever.\";\n}\n\n}\n<commit_msg>Use boost::algorithm::trim_copy<commit_after>#include \"bob.h\"\n#include <boost\/algorithm\/string\/trim.hpp>\n#include <algorithm>\n#include <cctype>\n#include <iterator>\n\nusing namespace std;\n\nnamespace bob\n{\nnamespace\n{\n\nbool is_upper(string const& text)\n{\n    auto last = end(text);\n    auto it = find_if_not(begin(text), last,\n        [](char c) { return c == toupper(c); });\n    return it == last;\n}\n\nbool has_alpha(string const& text)\n{\n    auto last = end(text);\n    auto it = find_if(begin(text), last, [](char c) { return isalpha(c) != 0; });\n    return it != last;\n}\n\nbool is_shouting(string const &text)\n{\n    return is_upper(text) && has_alpha(text);\n}\n\nbool is_question(string const &text)\n{\n    return text.back() == '?';\n}\n\nbool is_silence(string const& text)\n{\n    return boost::algorithm::trim_copy(text).length() == 0;\n}\n\n}\n\nstring hey(string const& text)\n{\n    if (is_silence(text)) {\n        return \"Fine. Be that way!\";\n    }\n    if (is_shouting(text)) {\n        return \"Woah, chill out!\";\n    }\n    if (is_question(text)) {\n        return \"Sure.\";\n    }\n    return \"Whatever.\";\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/@Author  PEZY\n\/\/\/@Date    Aug. 2014\n\/\/\/@Brief \n\/\/\/ print the size and contents of the vectors from exercise 3.13.\n\/\/\/ Check whether your answers to that exercise were correct. \n\/\/\/ If not, restudy § 3.3.1 (p. 97) until you understand why you were wrong.\n\/\/\/\n\n#include <iostream>\n#include <vector>\n#include <string>\n\nusing std::vector;\nusing std::string;\nusing std::cout;\nusing std::endl;\n\nint main()\n{\n  vector<int> v1;\n  cout << \"{\\n \\\"v1\\\":{\\\"size\\\":\\\"\" << v1.size() << \"\\\",\\\"value\\\":[\";\n  for (auto i : v1)\n    cout << i << \",\";\n  if (!v1.empty()) cout << \"\\b\";\n  cout << \"]}\" << endl;\n\n  vector<int> v2(10);\n  cout << \" \\\"v2\\\":{\\\"size\\\":\\\"\" << v2.size() << \"\\\",\\\"value\\\":[\";\n  for (auto i : v2)\n    cout << i << \",\";\n  if (!v2.empty()) cout << \"\\b\";\n  cout << \"]}\" << endl; \n\n  vector<int> v3(10, 42);\n  cout << \" \\\"v3\\\":{\\\"size\\\":\\\"\" << v3.size() << \"\\\",\\\"value\\\":[\";\n  for (auto i : v3)\n    cout << i << \",\";\n  if (!v3.empty()) cout << \"\\b\";\n  cout << \"]}\" << endl; \n\n  vector<int> v4{10};\n  cout << \" \\\"v4\\\":{\\\"size\\\":\\\"\" << v4.size() << \"\\\",\\\"value\\\":[\";\n  for (auto i : v4)\n    cout << i << \",\";\n  if (!v4.empty()) cout << \"\\b\";\n  cout << \"]}\" << endl;\n  \n  vector<int> v5{10, 42};\n  cout << \" \\\"v5\\\":{\\\"size\\\":\\\"\" << v5.size() << \"\\\",\\\"value\\\":[\";\n  for (auto i : v5)\n    cout << i << \",\";\n  if (!v5.empty()) cout << \"\\b\";\n  cout << \"]}\" << endl;\n\n  vector<string> v6{10};\n  cout << \" \\\"v6\\\":{\\\"size\\\":\\\"\" << v6.size() << \"\\\",\\\"value\\\":[\";\n  for (auto i : v6)\n    if (i.empty()) cout << \"(null)\" << \",\";\n    else cout << i << \",\";\n  if (!v6.empty()) cout << \"\\b\";\n  cout << \"]}\" << endl;\n\n  vector<string> v7{10, \"hi\"};\n  cout << \" \\\"v7\\\":{\\\"size\\\":\\\"\" << v7.size() << \"\\\",\\\"value\\\":[\";\n  for (auto i : v7)\n    if (i.empty()) cout << \"(null)\" << \",\";\n    else cout << i << \",\";\n  if (!v7.empty()) cout << \"\\b\";\n  cout << \"]}\\n}\" << endl;\n\n  return 0;\n}\n\n\/\/\/\n\/\/\/@Output(JSON-like format)\n\/\/\/{\n\/\/\/ \"v1\":{\"size\":\"0\",\"value\":[]}\n\/\/\/ \"v2\":{\"size\":\"10\",\"value\":[0,0,0,0,0,0,0,0,0,0]}\n\/\/\/ \"v3\":{\"size\":\"10\",\"value\":[42,42,42,42,42,42,42,42,42,42]}\n\/\/\/ \"v4\":{\"size\":\"1\",\"value\":[10]}\n\/\/\/ \"v5\":{\"size\":\"2\",\"value\":[10,42]}\n\/\/\/ \"v6\":{\"size\":\"10\",\"value\":[(null),(null),(null),(null),(null),(null),(null),(null),(null),(null)]}\n\/\/\/ \"v7\":{\"size\":\"10\",\"value\":[hi,hi,hi,hi,hi,hi,hi,hi,hi,hi]}\n\/\/\/}\n\/\/\/\n<commit_msg>Update ex3_16.cpp<commit_after>\/\/\/\n\/\/\/@Author  PEZY\n\/\/\/@Date    Aug. 2014\n\/\/\/@Brief \n\/\/\/ print the size and contents of the vectors from exercise 3.13.\n\/\/\/ Check whether your answers to that exercise were correct. \n\/\/\/ If not, restudy § 3.3.1 (p. 97) until you understand why you were wrong.\n\/\/\/\n\n#include <iostream>\n#include <vector>\n#include <string>\n\nusing std::vector;\nusing std::string;\nusing std::cout;\nusing std::endl;\n\nint main()\n{\n    vector<int> v1;\n    cout << \"{\\n \\\"v1\\\":{\\\"size\\\":\\\"\" << v1.size() << \"\\\",\\\"value\\\":[\";\n    for (auto i : v1)\n        cout << i << \",\";\n    if (!v1.empty()) cout << \"\\b\";\n    cout << \"]}\" << endl;\n\n    vector<int> v2(10);\n    cout << \" \\\"v2\\\":{\\\"size\\\":\\\"\" << v2.size() << \"\\\",\\\"value\\\":[\";\n    for (auto i : v2)\n        cout << i << \",\";\n    if (!v2.empty()) cout << \"\\b\";\n    cout << \"]}\" << endl;\n\n    vector<int> v3(10, 42);\n    cout << \" \\\"v3\\\":{\\\"size\\\":\\\"\" << v3.size() << \"\\\",\\\"value\\\":[\";\n    for (auto i : v3)\n        cout << i << \",\";\n    if (!v3.empty()) cout << \"\\b\";\n    cout << \"]}\" << endl;\n\n    vector<int> v4{ 10 };\n    cout << \" \\\"v4\\\":{\\\"size\\\":\\\"\" << v4.size() << \"\\\",\\\"value\\\":[\";\n    for (auto i : v4)\n        cout << i << \",\";\n    if (!v4.empty()) cout << \"\\b\";\n    cout << \"]}\" << endl;\n\n    vector<int> v5{ 10, 42 };\n    cout << \" \\\"v5\\\":{\\\"size\\\":\\\"\" << v5.size() << \"\\\",\\\"value\\\":[\";\n    for (auto i : v5)\n        cout << i << \",\";\n    if (!v5.empty()) cout << \"\\b\";\n    cout << \"]}\" << endl;\n\n    vector<string> v6{ 10 };\n    cout << \" \\\"v6\\\":{\\\"size\\\":\\\"\" << v6.size() << \"\\\",\\\"value\\\":[\";\n    for (auto i : v6)\n        if (i.empty()) cout << \"(null)\" << \",\";\n        else cout << i << \",\";\n        if (!v6.empty()) cout << \"\\b\";\n        cout << \"]}\" << endl;\n\n        vector<string> v7{ 10, \"hi\" };\n        cout << \" \\\"v7\\\":{\\\"size\\\":\\\"\" << v7.size() << \"\\\",\\\"value\\\":[\";\n        for (auto i : v7)\n            if (i.empty()) cout << \"(null)\" << \",\";\n            else cout << i << \",\";\n            if (!v7.empty()) cout << \"\\b\";\n            cout << \"]}\\n}\" << endl;\n\n            return 0;\n}\n\n\/\/\/\n\/\/\/@Output(JSON-like format)\n\/\/\/{\n\/\/\/ \"v1\":{\"size\":\"0\",\"value\":[]}\n\/\/\/ \"v2\":{\"size\":\"10\",\"value\":[0,0,0,0,0,0,0,0,0,0]}\n\/\/\/ \"v3\":{\"size\":\"10\",\"value\":[42,42,42,42,42,42,42,42,42,42]}\n\/\/\/ \"v4\":{\"size\":\"1\",\"value\":[10]}\n\/\/\/ \"v5\":{\"size\":\"2\",\"value\":[10,42]}\n\/\/\/ \"v6\":{\"size\":\"10\",\"value\":[(null),(null),(null),(null),(null),(null),(null),(null),(null),(null)]}\n\/\/\/ \"v7\":{\"size\":\"10\",\"value\":[hi,hi,hi,hi,hi,hi,hi,hi,hi,hi]}\n\/\/\/}\n\/\/\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ex5_25<commit_after>#include <iostream>\n#include <stdexcept>\n\nusing namespace std;\n\nint main(void)\n{\n\tint a, b;\n\tcout << \"Enter two numbers :\" << endl;\n\n\twhile (cin >> a >> b)\n\t{\n\t\ttry{\n\t\t\tif (b == 0)\n\t\t\t\tthrow runtime_error(\"divisor is 0\");\n\t\t\tcout << static_cast<double>(a) \/ b << endl;\n\t\t\tbreak;\n\t\t}\n\t\tcatch (runtime_error err){\n\t\t\tcout << err.what()\n\t\t\t\t<< \"\\nTry again ? Enter y or n\" << endl;\n\t\t\tchar c;\n\t\t\tcin >> c;\n\t\t\tif (!cin || c == 'n')\n\t\t\t\tbreak;\n\t\t\telse\n\t\t\t{\n\t\t\t\tcout << \"Enter two numbers :\" << endl;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/!@Yue Wang\n\/\/!\n\/\/! Exercise 6.12:\n\/\/! Rewrite the program from exercise 6.10 in § 6.2.1 (p. 210) to use\n\/\/! references instead of pointers to swap the values of two ints. Which\n\/\/! version do you think would be easier to use and why?\n\/\/  The version using reference is easier.\n\/\/!\n#include <iostream>\n\nvoid swap(int& lhs, int& rhs)\n{\n    int temp = lhs;\n    lhs = rhs;\n    rhs = temp;\n}\n\nint main()\n{\n    for (int left, right;\n         std::cout << \"Please Enter:\\n\", std::cin >> left >> right;) {\n        swap(left, right);\n        std::cout << left << \" \" << right << std::endl;\n    }\n\n    return 0;\n}\n<commit_msg>Update ex6_12.cpp<commit_after>\/\/!@Yue Wang\n\/\/!\n\/\/! Exercise 6.12:\n\/\/! Rewrite the program from exercise 6.10 in § 6.2.1 (p. 210) to use\n\/\/! references instead of pointers to swap the values of two ints. Which\n\/\/! version do you think would be easier to use and why?\n\/\/  The version using references is easier.\n\/\/!\n#include <iostream>\n\nvoid swap(int& lhs, int& rhs)\n{\n    int temp = lhs;\n    lhs = rhs;\n    rhs = temp;\n}\n\nint main()\n{\n    for (int left, right;\n         std::cout << \"Please Enter:\\n\", std::cin >> left >> right;) {\n        swap(left, right);\n        std::cout << left << \" \" << right << std::endl;\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  ex9_32.cpp\n\/\/  Exercise 9.32 \n\/\/\n\/\/  Created by pezy on 12\/3\/14.\n\/\/  Copyright (c) 2014 pezy. All rights reserved.\n\/\/\n\/\/  @Brief  Assuming vi is a container of ints that includes even and odd values, \n\/\/          predict the behavior of the following loop. \n\/\/          After you've analyzed this loop, write a program to test whether your expectations were correct.\n\/\/  @Answer \"infinite loop\". Casue the `++iter` out of the `while` loop. But even through add brackets it is still infinite loop.\n\/\/          Fixed following.\n\n#include <iostream>\n#include <vector>\n\nusing std::vector; using std::cout; using std::endl;\n\nint main()\n{\n    vector<int> vi = {0,1,2,3,4,5,6,7,8,9}; \n    auto iter = vi.begin(); \n    while (iter != vi.end())\n    {    \n        if (*iter % 2)        \n            iter = vi.insert(iter, *iter++);    \n        ++iter;\n    }\n    \n    for (auto i : vi)\n        cout << i << \" \";\n    \n    return 0;\n}\n\n\n<commit_msg>fixed #136<commit_after>\/\/\n\/\/  ex9_32.cpp\n\/\/  Exercise 9.32 \n\/\/\n\/\/  Created by pezy on 12\/3\/14.\n\/\/  Copyright (c) 2014 pezy. All rights reserved.\n\/\/\n\/\/  @Brief  Assuming vi is a container of ints that includes even and odd values, \n\/\/          predict the behavior of the following loop. \n\/\/          After you've analyzed this loop, write a program to test whether your expectations were correct.\n\/\/\t\t\t\n\/\/\t\t\titer = vi.begin(); \n\/\/\t\t\twhile (iter != vi.end())    \n\/\/\t\t\t\tif (*iter % 2)        \n\/\/\t\t\t\t\titer = vi.insert(iter, *iter);    \n\/\/\t\t\t\t++iter; \n\/\/\n\/\/  @Answer \"infinite loop\". Casue the `++iter` out of the `while` loop. But even through add brackets it is still infinite loop.\n\/\/          Fixed following.\n\n#include <iostream>\nusing std::cout; using std::endl;\n\n#include <vector>\nusing std::vector;\n\nint main()\n{\n\tvector<int> vi = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };\n\tauto iter = vi.begin();\n\twhile (iter != vi.end()) {\n\t\tif (*iter % 2) {\n\t\t\titer = vi.insert(iter, *iter);\n\t\t\t++iter;\n\t\t}\n\t\t++iter;\n\t}\n\n\tfor (auto i : vi)\n\t\tcout << i << \" \";\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"Octree.h\"\r\n#include <algorithm>\r\n#include <fstream>\r\n#include <iostream>\r\n\r\n\r\nvoid Octree::build(const int depth, const int full_layer,\r\n\tconst int npt, const float* bbmin, const float* bbmax,\r\n\tconst float* pts, const float* normals, const int* labels)\r\n{\r\n\t\/\/ init\r\n\tfull_layer_ = full_layer < 1 ? 1 : full_layer;\r\n\tdepth_ = full_layer < depth ? depth : full_layer;\r\n\tset_bbox(bbmin, bbmax);\r\n\tchildren_.clear();\r\n\tchildren_.resize(depth + 1);\r\n\tkeys_.clear();\r\n\tkeys_.resize(depth + 1);\r\n\r\n\t\/\/ preprocess, get key and sort\r\n\tvector<uint32> node_keys, sorted_idx;\r\n\tvector<float> weights;\r\n\tprocessing_points(node_keys, sorted_idx, weights, pts, npt);\r\n \r\n\t\/\/ get unique key\r\n\tvector<uint32> unique_idx;\r\n\tunique_key(node_keys, unique_idx);\t\r\n\r\n\t\/\/ build tree\r\n\t\/\/ build layer 0 to full_layer_depth_\r\n\tfor (int curr_depth = 0; curr_depth <= full_layer_; curr_depth++)\r\n\t{\r\n\t\tvector<int>& children = children_[curr_depth];\r\n\t\tvector<uint32>& keys = keys_[curr_depth];\r\n\r\n\t\tint n = 1 << 3 * curr_depth;\r\n\t\tkeys.resize(n, -1); children.resize(n, -1);\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t{\r\n\t\t\tkeys[i] = i;\r\n\r\n\t\t\tif (curr_depth != full_layer_)\r\n\t\t\t{\r\n\t\t\t\tchildren[i] = i;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t}\r\n\t\/\/ build layers\r\n\tfor (int curr_depth = depth_; curr_depth > full_layer_; --curr_depth)\r\n\t{\r\n\t\t\/\/ compute parent key, i.e. keys of layer (curr_depth -1)\r\n\t\tint n = node_keys.size();\r\n\t\tvector<uint32> parent_keys(n);\r\n\t\t#pragma omp parallel for\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t{\r\n\t\t\tparent_keys[i] = node_keys[i] >> 3;\r\n\t\t}\r\n\r\n\t\t\/\/ compute unique parent key\r\n\t\tvector<uint32> parent_pidx;\r\n\t\tunique_key(parent_keys, parent_pidx);\r\n\r\n\t\t\/\/ augment children keys and create nodes\r\n\t\tint np = parent_keys.size();\r\n\t\tint nch = np << 3;\r\n\t\tvector<int>& children = children_[curr_depth];\r\n\t\tvector<uint32>& keys = keys_[curr_depth];\r\n\r\n\t\tchildren.resize(nch, -1);\r\n\t\tkeys.resize(nch, 0);\r\n\r\n\t\tfor (int i = 0; i < nch; i++)\r\n\t\t{\r\n\t\t\tint j = i >> 3;\r\n\t\t\tkeys[i] = (parent_keys[j] << 3) | (i % 8);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/ compute base address for each node\r\n\t\tvector<uint32> addr(nch);\r\n\t\tfor (int i = 0; i < np; i++)\r\n\t\t{\r\n\t\t\tfor (uint32 j = parent_pidx[i]; j < parent_pidx[i + 1]; j++)\r\n\t\t\t{\r\n\t\t\t\taddr[j] = i << 3;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/ set children pointer and parent pointer\r\n\t\t#pragma omp parallel for\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t{\r\n\t\t\t\/\/ address\r\n\t\t\tuint32 k = (node_keys[i] & 7u) | addr[i];\r\n\r\n\t\t\t\/\/ set children pointer for layer curr_depth\r\n\t\t\tchildren[k] = i;\r\n\t\t}\r\n\r\n\t\t\/\/ save data and prepare for the following iteration\r\n\t\tnode_keys.swap(parent_keys);\r\n\t}\r\n\t\/\/ set the children for the layer full_layer_depth_\r\n\t\/\/ Now the node_keys are the key for full_layer\r\n\tif (depth_ > full_layer_)\r\n\t{\r\n\t\tfor (int i = 0; i < node_keys.size(); i++)\r\n\t\t{\r\n\t\t\tuint32 j = node_keys[i];\r\n\t\t\tchildren_[full_layer_][j] = i;\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ splat normal (according to Ps, Ns, pnum, pidx)\r\n \tsplat_normal(normals, weights, sorted_idx, unique_idx, children_[depth_]);\r\n\tif(labels != nullptr)\r\n\t\tsplat_label(labels, weights, sorted_idx, unique_idx, children_[depth_]);\r\n }\r\n \r\nbool Octree::save(std::string& filename)\r\n{\r\n\tstd::ofstream outfile(filename, std::ios::binary);\r\n\tif (!outfile) return false;\r\n\r\n\tvector<int> node_num;\r\n\tfor (auto& keys : keys_)\r\n\t{\r\n\t\tnode_num.push_back(keys.size());\r\n\t}\r\n\r\n\tvector<int> node_num_accu(depth_ + 2, 0);\r\n\tfor (int i = 1; i < depth_ + 2; ++i)\r\n\t{\r\n\t\tnode_num_accu[i] = node_num_accu[i - 1] + node_num[i - 1];\r\n\t}\r\n\tint total_node_num = node_num_accu[depth_ + 1];\r\n\tint final_node_num = node_num[depth_];\r\n\r\n\t\/\/ calc key\r\n\tstd::vector<int> key(total_node_num), children(total_node_num);\r\n\tint idx = 0;\r\n\tfor (int d = 0; d <= depth_; ++d)\r\n\t{\r\n\t\tvector<uint32>& keys = keys_[d];\r\n\t\tfor (int i =0; i < keys.size(); ++i)\r\n\t\t{\r\n\t\t\t\/\/ calc point\r\n\t\t\tuint32 k = keys[i], pt[3];\r\n\t\t\tcompute_pt(pt, k, d);\r\n\r\n\t\t\t\/\/ compress\r\n\t\t\tunsigned char* ptr = reinterpret_cast<unsigned char*>(&key[idx]);\r\n\t\t\tptr[0] = static_cast<unsigned char>(pt[0]);\r\n\t\t\tptr[1] = static_cast<unsigned char>(pt[1]);\r\n\t\t\tptr[2] = static_cast<unsigned char>(pt[2]);\r\n\t\t\tptr[3] = static_cast<unsigned char>(d);\r\n\r\n\t\t\t\/\/ children\r\n\t\t\tchildren[idx] = children_[d][i];\r\n\r\n\t\t\t\/\/ update index\r\n\t\t\tidx++;\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ write\r\n\toutfile.write((char*)&total_node_num, sizeof(int));\r\n\toutfile.write((char*)&final_node_num, sizeof(int));\r\n\toutfile.write((char*)&depth_, sizeof(int));\r\n\toutfile.write((char*)&full_layer_, sizeof(int));\r\n\toutfile.write((char*)node_num.data(), sizeof(int)*(depth_ + 1));\r\n\toutfile.write((char*)node_num_accu.data(), sizeof(int)*(depth_ + 2));\r\n\toutfile.write((char*)key.data(), sizeof(int)*total_node_num);\r\n\toutfile.write((char*)children.data(), sizeof(int)*total_node_num);\r\n\toutfile.write((char*)data_.data(), sizeof(float) * 3 * final_node_num);\r\n\tif (!label_.empty())\r\n\t{\r\n\t\toutfile.write((char*)label_.data(), label_.size()*sizeof(int));\r\n\t}\r\n\toutfile.close();\r\n\r\n\treturn true;\r\n}\r\n\r\nvoid Octree::set_bbox(const float* bbmin, const float* bbmax)\r\n{\r\n\tfloat center[3];\r\n\tscale_ = -1.0e20;\r\n\tfor (int i = 0; i < 3; ++i)\r\n\t{\r\n\t\tfloat dis = bbmax[i] - bbmin[i];\r\n\t\tif (dis > scale_) scale_ = dis;\r\n\t\tcenter[i] = (bbmin[i] + bbmax[i])*0.5;\r\n\t}\r\n\r\n\t\/\/ set the bounding box and place the object in the center\r\n\tfloat radius = scale_ * 0.5;\r\n\tfor (int i = 0; i < 3; ++i)\r\n\t{\r\n\t\tbbmax_[i] = center[i] + radius;\r\n\t\tbbmin_[i] = center[i] - radius;\r\n\t}\r\n}\r\n\r\nvoid Octree::processing_points(vector<uint32>& sorted_keys, \r\n\tvector<uint32>& sorted_idx,\tvector<float>& weights, \r\n\tconst float* pts, const int npt)\r\n{\r\n\tsorted_keys.resize(npt);\r\n\tsorted_idx.resize(npt);\r\n\tweights.resize(npt);\r\n\tvector<uint64> code(npt);\r\n\tconst float mul = float(1 << depth_) \/ scale_;\r\n\t#pragma omp parallel for\r\n\tfor (int i = 0; i < npt; i++)\r\n\t{\r\n\t\t\/\/ normalize coordinate\r\n\t\tuint32 pt[3];\r\n\t\tweights[i] = 1.0f;\r\n\t\tfor (int j = 0; j < 3; j++)\r\n\t\t{\r\n\t\t\tfloat tmp = (pts[i * 3 + j] - bbmin_[j]) * mul;\r\n\t\t\tpt[j] = tmp;\r\n\t\t\tweights[i] *= bspline(float(pt[j]) + 0.5f - tmp);\r\n\t\t}\r\n\r\n\t\t\/\/ calc key\r\n\t\tuint32 key;\r\n\t\tcompute_key(key, pt, depth_);\r\n\r\n\t\t\/\/ generate code\r\n\t\tuint32* ptr = (uint32*)(&code[i]);\r\n\t\tptr[0] = i;\r\n\t\tptr[1] = key;\r\n\t}\r\n\r\n\t\/\/ sort all sample points\r\n\tstd::sort(code.begin(), code.end());\r\n\r\n\t\/\/ unpack the code\r\n\t#pragma omp parallel for\r\n\tfor (int i = 0; i < npt; i++)\r\n\t{\r\n\t\tuint32* ptr = (uint32*)(&code[i]);\r\n\t\tsorted_idx[i] = ptr[0];\r\n\t\tsorted_keys[i] = ptr[1];\r\n\t}\r\n}\r\n\r\nvoid Octree::unique_key(vector<uint32>& keys, vector<uint32>& idx)\r\n{\r\n\t\/\/ init\r\n\tidx.clear();\r\n\tidx.push_back(0);\r\n\r\n\t\/\/ unique\r\n\tint n = keys.size(), j = 1;\r\n\tfor (int i = 1; i < n; i++)\r\n\t{\r\n\t\tif (keys[i] != keys[i - 1])\r\n\t\t{\r\n\t\t\tidx.push_back(i);\r\n\t\t\tkeys[j++] = keys[i];\r\n\t\t}\r\n\t}\r\n\r\n\tkeys.resize(j);\r\n\tidx.push_back(n);\r\n}\r\n\r\ninline void Octree::compute_key(uint32& key, const uint32* pt, const int depth)\r\n{\r\n\tkey = 0;\r\n\tfor (int i = 0; i < depth; i++)\r\n\t{\r\n\t\tuint32 mask = 1u << i;\r\n\t\tfor (int j = 0; j < 3; j++)\r\n\t\t{\r\n\t\t\tkey |= (pt[j] & mask) << (2 * i + 2 - j);\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline void Octree::compute_pt(uint32* pt, const uint32& key, const int depth)\r\n{\r\n\t\/\/ init\r\n\tfor (int i = 0; i < 3; pt[i++] = 0u);\r\n\r\n\t\/\/ convert\r\n\tfor (int i = 0; i < depth; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < 3; j++)\r\n\t\t{\r\n\t\t\t\/\/ bit mask\r\n\t\t\tuint32 mask = 1u << (3 * i + 2 - j); \r\n\t\t\t\/\/ put the bit to position i\r\n\t\t\tpt[j] |= (key & mask) >> (2 * i + 2 - j); \r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline float Octree::bspline(float x)\r\n{\r\n\tif (x < -1.5f)\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\telse if (x < -0.5f)\r\n\t{\r\n\t\treturn 0.5f * (x + 1.5f) * (x + 1.5f);\r\n\t}\r\n\telse if ( x < 0.5f)\r\n\t{\r\n\t\treturn 0.75f - x * x;\r\n\t}\r\n\telse if (x <= 1.5f)\r\n\t{\r\n\t\treturn 0.5f * (x - 1.5f) * (x - 1.5f);\r\n\t}\r\n\telse\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n}\r\n\r\nvoid Octree::splat_normal(const float* normals, const vector<float>& weights, \r\n\tconst vector<uint32>& sorted_idx, const vector<uint32>& unique_idx,\r\n\tconst vector<int>& children)\r\n{\r\n\tint n = children.size();\r\n\tdata_.resize(3 * n);\r\n\t#pragma omp parallel for\r\n\tfor (int i = 0; i < n; i++)\r\n\t{\r\n\t\tint t = children[i];\r\n\t\tvector<float> Nw(3, 0.0);\r\n\t\tif (t != -1)\r\n\t\t{\r\n\t\t\tfor (int j = unique_idx[t]; j < unique_idx[t + 1]; j++)\r\n\t\t\t{\r\n\t\t\t\tint h = sorted_idx[j];\r\n\t\t\t\tNw[0] += weights[h] * normals[3 * h];\r\n\t\t\t\tNw[1] += weights[h] * normals[3 * h + 1];\r\n\t\t\t\tNw[2] += weights[h] * normals[3 * h + 2];\r\n\t\t\t}\r\n\r\n\t\t\tfloat len = sqrt(Nw[0] * Nw[0] + Nw[1] * Nw[1] + Nw[2] * Nw[2]);\r\n\t\t\tif (len < ESP) len = ESP;\r\n\r\n\t\t\tNw[0] \/= len;\r\n\t\t\tNw[1] \/= len;\r\n\t\t\tNw[2] \/= len;\r\n\t\t}\r\n\t\t\r\n\t\tdata_[i] = Nw[0];\r\n\t\tdata_[n + i] = Nw[1];\r\n\t\tdata_[2 * n + i] = Nw[2];\r\n\t}\r\n}\r\n\r\nvoid Octree::splat_label(const int* labels, const vector<float>& weights,\r\n\tconst vector<uint32>& sorted_idx, const vector<uint32>& unique_idx,\r\n\tconst vector<int>& children)\r\n{\r\n\tint n = children_.size();\r\n\tint nl = *std::max_element(labels, labels + n) + 1;\r\n\r\n\tlabel_.clear(); \r\n\tlabel_.resize(n, -1);\r\n\t#pragma omp parallel for\r\n\tfor (int i = 0; i < n; i++)\r\n\t{\r\n\t\tint t = children[i];\r\n\t\tif (t == -1) continue;\r\n\t\tvector<float> Lw(nl, 0);\r\n\r\n\t\tfor (int j = unique_idx[t]; j < unique_idx[t + 1]; j++)\r\n\t\t{\r\n\t\t\tint h = sorted_idx[j];\r\n\t\t\tLw[labels[h]] += weights[h];\r\n\t\t}\r\n\r\n\t\tlabel_[i] = 0;\r\n\t\tfloat v = Lw[0];\r\n\t\tfor (int j = 1; j < nl; ++j)\r\n\t\t{\r\n\t\t\tif (Lw[j] > v)\r\n\t\t\t{\r\n\t\t\t\tv = Lw[j];\r\n\t\t\t\tlabel_[i] = j;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n<commit_msg>Remove the BUG in the Octree::splat_label<commit_after>#include \"Octree.h\"\r\n#include <algorithm>\r\n#include <fstream>\r\n#include <iostream>\r\n\r\n\r\nvoid Octree::build(const int depth, const int full_layer,\r\n\tconst int npt, const float* bbmin, const float* bbmax,\r\n\tconst float* pts, const float* normals, const int* labels)\r\n{\r\n\t\/\/ init\r\n\tfull_layer_ = full_layer < 1 ? 1 : full_layer;\r\n\tdepth_ = full_layer < depth ? depth : full_layer;\r\n\tset_bbox(bbmin, bbmax);\r\n\tchildren_.clear();\r\n\tchildren_.resize(depth + 1);\r\n\tkeys_.clear();\r\n\tkeys_.resize(depth + 1);\r\n\r\n\t\/\/ preprocess, get key and sort\r\n\tvector<uint32> node_keys, sorted_idx;\r\n\tvector<float> weights;\r\n\tprocessing_points(node_keys, sorted_idx, weights, pts, npt);\r\n \r\n\t\/\/ get unique key\r\n\tvector<uint32> unique_idx;\r\n\tunique_key(node_keys, unique_idx);\t\r\n\r\n\t\/\/ build tree\r\n\t\/\/ build layer 0 to full_layer_depth_\r\n\tfor (int curr_depth = 0; curr_depth <= full_layer_; curr_depth++)\r\n\t{\r\n\t\tvector<int>& children = children_[curr_depth];\r\n\t\tvector<uint32>& keys = keys_[curr_depth];\r\n\r\n\t\tint n = 1 << 3 * curr_depth;\r\n\t\tkeys.resize(n, -1); children.resize(n, -1);\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t{\r\n\t\t\tkeys[i] = i;\r\n\r\n\t\t\tif (curr_depth != full_layer_)\r\n\t\t\t{\r\n\t\t\t\tchildren[i] = i;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t}\r\n\t\/\/ build layers\r\n\tfor (int curr_depth = depth_; curr_depth > full_layer_; --curr_depth)\r\n\t{\r\n\t\t\/\/ compute parent key, i.e. keys of layer (curr_depth -1)\r\n\t\tint n = node_keys.size();\r\n\t\tvector<uint32> parent_keys(n);\r\n\t\t#pragma omp parallel for\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t{\r\n\t\t\tparent_keys[i] = node_keys[i] >> 3;\r\n\t\t}\r\n\r\n\t\t\/\/ compute unique parent key\r\n\t\tvector<uint32> parent_pidx;\r\n\t\tunique_key(parent_keys, parent_pidx);\r\n\r\n\t\t\/\/ augment children keys and create nodes\r\n\t\tint np = parent_keys.size();\r\n\t\tint nch = np << 3;\r\n\t\tvector<int>& children = children_[curr_depth];\r\n\t\tvector<uint32>& keys = keys_[curr_depth];\r\n\r\n\t\tchildren.resize(nch, -1);\r\n\t\tkeys.resize(nch, 0);\r\n\r\n\t\tfor (int i = 0; i < nch; i++)\r\n\t\t{\r\n\t\t\tint j = i >> 3;\r\n\t\t\tkeys[i] = (parent_keys[j] << 3) | (i % 8);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/ compute base address for each node\r\n\t\tvector<uint32> addr(nch);\r\n\t\tfor (int i = 0; i < np; i++)\r\n\t\t{\r\n\t\t\tfor (uint32 j = parent_pidx[i]; j < parent_pidx[i + 1]; j++)\r\n\t\t\t{\r\n\t\t\t\taddr[j] = i << 3;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/ set children pointer and parent pointer\r\n\t\t#pragma omp parallel for\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t{\r\n\t\t\t\/\/ address\r\n\t\t\tuint32 k = (node_keys[i] & 7u) | addr[i];\r\n\r\n\t\t\t\/\/ set children pointer for layer curr_depth\r\n\t\t\tchildren[k] = i;\r\n\t\t}\r\n\r\n\t\t\/\/ save data and prepare for the following iteration\r\n\t\tnode_keys.swap(parent_keys);\r\n\t}\r\n\t\/\/ set the children for the layer full_layer_depth_\r\n\t\/\/ Now the node_keys are the key for full_layer\r\n\tif (depth_ > full_layer_)\r\n\t{\r\n\t\tfor (int i = 0; i < node_keys.size(); i++)\r\n\t\t{\r\n\t\t\tuint32 j = node_keys[i];\r\n\t\t\tchildren_[full_layer_][j] = i;\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ splat normal (according to Ps, Ns, pnum, pidx)\r\n \tsplat_normal(normals, weights, sorted_idx, unique_idx, children_[depth_]);\r\n\tif(labels != nullptr)\r\n\t\tsplat_label(labels, weights, sorted_idx, unique_idx, children_[depth_]);\r\n }\r\n \r\nbool Octree::save(std::string& filename)\r\n{\r\n\tstd::ofstream outfile(filename, std::ios::binary);\r\n\tif (!outfile) return false;\r\n\r\n\tvector<int> node_num;\r\n\tfor (auto& keys : keys_)\r\n\t{\r\n\t\tnode_num.push_back(keys.size());\r\n\t}\r\n\r\n\tvector<int> node_num_accu(depth_ + 2, 0);\r\n\tfor (int i = 1; i < depth_ + 2; ++i)\r\n\t{\r\n\t\tnode_num_accu[i] = node_num_accu[i - 1] + node_num[i - 1];\r\n\t}\r\n\tint total_node_num = node_num_accu[depth_ + 1];\r\n\tint final_node_num = node_num[depth_];\r\n\r\n\t\/\/ calc key\r\n\tstd::vector<int> key(total_node_num), children(total_node_num);\r\n\tint idx = 0;\r\n\tfor (int d = 0; d <= depth_; ++d)\r\n\t{\r\n\t\tvector<uint32>& keys = keys_[d];\r\n\t\tfor (int i =0; i < keys.size(); ++i)\r\n\t\t{\r\n\t\t\t\/\/ calc point\r\n\t\t\tuint32 k = keys[i], pt[3];\r\n\t\t\tcompute_pt(pt, k, d);\r\n\r\n\t\t\t\/\/ compress\r\n\t\t\tunsigned char* ptr = reinterpret_cast<unsigned char*>(&key[idx]);\r\n\t\t\tptr[0] = static_cast<unsigned char>(pt[0]);\r\n\t\t\tptr[1] = static_cast<unsigned char>(pt[1]);\r\n\t\t\tptr[2] = static_cast<unsigned char>(pt[2]);\r\n\t\t\tptr[3] = static_cast<unsigned char>(d);\r\n\r\n\t\t\t\/\/ children\r\n\t\t\tchildren[idx] = children_[d][i];\r\n\r\n\t\t\t\/\/ update index\r\n\t\t\tidx++;\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ write\r\n\toutfile.write((char*)&total_node_num, sizeof(int));\r\n\toutfile.write((char*)&final_node_num, sizeof(int));\r\n\toutfile.write((char*)&depth_, sizeof(int));\r\n\toutfile.write((char*)&full_layer_, sizeof(int));\r\n\toutfile.write((char*)node_num.data(), sizeof(int)*(depth_ + 1));\r\n\toutfile.write((char*)node_num_accu.data(), sizeof(int)*(depth_ + 2));\r\n\toutfile.write((char*)key.data(), sizeof(int)*total_node_num);\r\n\toutfile.write((char*)children.data(), sizeof(int)*total_node_num);\r\n\toutfile.write((char*)data_.data(), sizeof(float) * 3 * final_node_num);\r\n\tif (!label_.empty())\r\n\t{\r\n\t\toutfile.write((char*)label_.data(), label_.size()*sizeof(int));\r\n\t}\r\n\toutfile.close();\r\n\r\n\treturn true;\r\n}\r\n\r\nvoid Octree::set_bbox(const float* bbmin, const float* bbmax)\r\n{\r\n\tfloat center[3];\r\n\tscale_ = -1.0e20;\r\n\tfor (int i = 0; i < 3; ++i)\r\n\t{\r\n\t\tfloat dis = bbmax[i] - bbmin[i];\r\n\t\tif (dis > scale_) scale_ = dis;\r\n\t\tcenter[i] = (bbmin[i] + bbmax[i])*0.5;\r\n\t}\r\n\r\n\t\/\/ set the bounding box and place the object in the center\r\n\tfloat radius = scale_ * 0.5;\r\n\tfor (int i = 0; i < 3; ++i)\r\n\t{\r\n\t\tbbmax_[i] = center[i] + radius;\r\n\t\tbbmin_[i] = center[i] - radius;\r\n\t}\r\n}\r\n\r\nvoid Octree::processing_points(vector<uint32>& sorted_keys, \r\n\tvector<uint32>& sorted_idx,\tvector<float>& weights, \r\n\tconst float* pts, const int npt)\r\n{\r\n\tsorted_keys.resize(npt);\r\n\tsorted_idx.resize(npt);\r\n\tweights.resize(npt);\r\n\tvector<uint64> code(npt);\r\n\tconst float mul = float(1 << depth_) \/ scale_;\r\n\t#pragma omp parallel for\r\n\tfor (int i = 0; i < npt; i++)\r\n\t{\r\n\t\t\/\/ normalize coordinate\r\n\t\tuint32 pt[3];\r\n\t\tweights[i] = 1.0f;\r\n\t\tfor (int j = 0; j < 3; j++)\r\n\t\t{\r\n\t\t\tfloat tmp = (pts[i * 3 + j] - bbmin_[j]) * mul;\r\n\t\t\tpt[j] = tmp;\r\n\t\t\tweights[i] *= bspline(float(pt[j]) + 0.5f - tmp);\r\n\t\t}\r\n\r\n\t\t\/\/ calc key\r\n\t\tuint32 key;\r\n\t\tcompute_key(key, pt, depth_);\r\n\r\n\t\t\/\/ generate code\r\n\t\tuint32* ptr = (uint32*)(&code[i]);\r\n\t\tptr[0] = i;\r\n\t\tptr[1] = key;\r\n\t}\r\n\r\n\t\/\/ sort all sample points\r\n\tstd::sort(code.begin(), code.end());\r\n\r\n\t\/\/ unpack the code\r\n\t#pragma omp parallel for\r\n\tfor (int i = 0; i < npt; i++)\r\n\t{\r\n\t\tuint32* ptr = (uint32*)(&code[i]);\r\n\t\tsorted_idx[i] = ptr[0];\r\n\t\tsorted_keys[i] = ptr[1];\r\n\t}\r\n}\r\n\r\nvoid Octree::unique_key(vector<uint32>& keys, vector<uint32>& idx)\r\n{\r\n\t\/\/ init\r\n\tidx.clear();\r\n\tidx.push_back(0);\r\n\r\n\t\/\/ unique\r\n\tint n = keys.size(), j = 1;\r\n\tfor (int i = 1; i < n; i++)\r\n\t{\r\n\t\tif (keys[i] != keys[i - 1])\r\n\t\t{\r\n\t\t\tidx.push_back(i);\r\n\t\t\tkeys[j++] = keys[i];\r\n\t\t}\r\n\t}\r\n\r\n\tkeys.resize(j);\r\n\tidx.push_back(n);\r\n}\r\n\r\ninline void Octree::compute_key(uint32& key, const uint32* pt, const int depth)\r\n{\r\n\tkey = 0;\r\n\tfor (int i = 0; i < depth; i++)\r\n\t{\r\n\t\tuint32 mask = 1u << i;\r\n\t\tfor (int j = 0; j < 3; j++)\r\n\t\t{\r\n\t\t\tkey |= (pt[j] & mask) << (2 * i + 2 - j);\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline void Octree::compute_pt(uint32* pt, const uint32& key, const int depth)\r\n{\r\n\t\/\/ init\r\n\tfor (int i = 0; i < 3; pt[i++] = 0u);\r\n\r\n\t\/\/ convert\r\n\tfor (int i = 0; i < depth; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < 3; j++)\r\n\t\t{\r\n\t\t\t\/\/ bit mask\r\n\t\t\tuint32 mask = 1u << (3 * i + 2 - j); \r\n\t\t\t\/\/ put the bit to position i\r\n\t\t\tpt[j] |= (key & mask) >> (2 * i + 2 - j); \r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline float Octree::bspline(float x)\r\n{\r\n\tif (x < -1.5f)\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\telse if (x < -0.5f)\r\n\t{\r\n\t\treturn 0.5f * (x + 1.5f) * (x + 1.5f);\r\n\t}\r\n\telse if ( x < 0.5f)\r\n\t{\r\n\t\treturn 0.75f - x * x;\r\n\t}\r\n\telse if (x <= 1.5f)\r\n\t{\r\n\t\treturn 0.5f * (x - 1.5f) * (x - 1.5f);\r\n\t}\r\n\telse\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n}\r\n\r\nvoid Octree::splat_normal(const float* normals, const vector<float>& weights, \r\n\tconst vector<uint32>& sorted_idx, const vector<uint32>& unique_idx,\r\n\tconst vector<int>& children)\r\n{\r\n\tint n = children.size();\r\n\tdata_.resize(3 * n);\r\n\t#pragma omp parallel for\r\n\tfor (int i = 0; i < n; i++)\r\n\t{\r\n\t\tint t = children[i];\r\n\t\tvector<float> Nw(3, 0.0);\r\n\t\tif (t != -1)\r\n\t\t{\r\n\t\t\tfor (int j = unique_idx[t]; j < unique_idx[t + 1]; j++)\r\n\t\t\t{\r\n\t\t\t\tint h = sorted_idx[j];\r\n\t\t\t\tNw[0] += weights[h] * normals[3 * h];\r\n\t\t\t\tNw[1] += weights[h] * normals[3 * h + 1];\r\n\t\t\t\tNw[2] += weights[h] * normals[3 * h + 2];\r\n\t\t\t}\r\n\r\n\t\t\tfloat len = sqrt(Nw[0] * Nw[0] + Nw[1] * Nw[1] + Nw[2] * Nw[2]);\r\n\t\t\tif (len < ESP) len = ESP;\r\n\r\n\t\t\tNw[0] \/= len;\r\n\t\t\tNw[1] \/= len;\r\n\t\t\tNw[2] \/= len;\r\n\t\t}\r\n\t\t\r\n\t\tdata_[i] = Nw[0];\r\n\t\tdata_[n + i] = Nw[1];\r\n\t\tdata_[2 * n + i] = Nw[2];\r\n\t}\r\n}\r\n\r\nvoid Octree::splat_label(const int* labels, const vector<float>& weights,\r\n\tconst vector<uint32>& sorted_idx, const vector<uint32>& unique_idx,\r\n\tconst vector<int>& children)\r\n{\r\n\tint n = children.size();\r\n\tint nl = *std::max_element(labels, labels + n) + 1;\r\n\r\n\tlabel_.clear(); \r\n\tlabel_.resize(n, -1);\r\n\t#pragma omp parallel for\r\n\tfor (int i = 0; i < n; i++)\r\n\t{\r\n\t\tint t = children[i];\r\n\t\tif (t == -1) continue;\r\n\t\tvector<float> Lw(nl, 0);\r\n\r\n\t\tfor (int j = unique_idx[t]; j < unique_idx[t + 1]; j++)\r\n\t\t{\r\n\t\t\tint h = sorted_idx[j];\r\n\t\t\tLw[labels[h]] += weights[h];\r\n\t\t}\r\n\r\n\t\tlabel_[i] = 0;\r\n\t\tfloat v = Lw[0];\r\n\t\tfor (int j = 1; j < nl; ++j)\r\n\t\t{\r\n\t\t\tif (Lw[j] > v)\r\n\t\t\t{\r\n\t\t\t\tv = Lw[j];\r\n\t\t\t\tlabel_[i] = j;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"auto\/DriveCommand.h\"\n\nDriveCommand::DriveCommand(Drive* drive, double distance) {\n\tdrive_ = drive;\n\tdistanceGoal_ = distance;\n\t\/\/set constanst for tuning here\n\tleftPid_ = new Pid(.1, 0, 0);\n\tleftPid_->SetGoal(distanceGoal_);\n\trightPid_ = new Pid(.1, 0, 0);\n\trightPid_->SetGoal(distanceGoal_);\n\tdistanceGoal_ = distance;\n}\n\nvoid DriveCommand::Initialize() {\n\tdrive_->ResetEncoders();\n}\n\nbool DriveCommand::Run() {\n\tdouble currLeftDist = drive_->GetLeftEncoderDistance();\n\tdouble currRightDist = drive_->GetRightEncoderDistance();\n\t\/\/if goal reached, return true so current command can be popped off queue\n\tif(currLeftDist == distanceGoal_ && currRightDist == distanceGoal_) {\n\t\treturn true;\n\t}\n\t\/\/get PID feedback and send back to motors\n\tdouble leftPwr = leftPid_->Update(currLeftDist);\n\tdouble rightPwr = rightPid_->Update(currRightDist);\n\tdrive_->SetLinearPower(leftPwr, rightPwr);\n\t\/\/indicates that goal is not reached\n\treturn false;\n}\n\nDriveCommand::~DriveCommand() {\n\tdelete leftPid_;\n\tdelete rightPid_;\n\tdelete drive_;\n}\n<commit_msg>Style fixes<commit_after>#include \"auto\/DriveCommand.h\"\n\nDriveCommand::DriveCommand(Drive* drive, double distance) {\n  drive_ = drive;\n  distanceGoal_ = distance;\n  \/\/ set constants for tuning here\n  leftPid_ = new Pid(.1, 0, 0);\n  leftPid_->SetGoal(distanceGoal_);\n  rightPid_ = new Pid(.1, 0, 0);\n  rightPid_->SetGoal(distanceGoal_);\n  distanceGoal_ = distance;\n}\n\nvoid DriveCommand::Initialize() {\n  drive_->ResetEncoders();\n}\n\nbool DriveCommand::Run() {\n  double currLeftDist = drive_->GetLeftEncoderDistance();\n  double currRightDist = drive_->GetRightEncoderDistance();\n  \/\/ if goal reached, return true so current command can be popped off queue\n  if(currLeftDist == distanceGoal_ && currRightDist == distanceGoal_) {\n    return true;\n  }\n  \/\/ get PID feedback and send back to motors\n  double leftPwr = leftPid_->Update(currLeftDist);\n  double rightPwr = rightPid_->Update(currRightDist);\n  drive_->SetLinearPower(leftPwr, rightPwr);\n  \/\/ indicates that goal is not reached\n  return false;\n}\n\nDriveCommand::~DriveCommand() {\n  delete leftPid_;\n  delete rightPid_;\n  delete drive_;\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 \"itkProcessObject.h\"\n#include \"itkSmartPointerForwardReference.txx\"\n#include \"itkRealTimeClock.h\"\n#include \"itkTemporalDataObject.h\"\n\n\/\/ Manual instantiation is necessary to prevent link errors\ntemplate class itk::SmartPointerForwardReference< itk::ProcessObject >;\n\nnamespace itk\n{\n\n\/\/----------------------------------------------------------------------------\nTemporalDataObject::TemporalDataObject()\n  : m_LargestPossibleTemporalRegion(),\n    m_RequestedTemporalRegion(),\n    m_BufferedTemporalRegion(),\n    m_TemporalUnit(Frame)\n{\n  m_DataObjectBuffer = BufferType::New();\n}\n\n\/\/----------------------------------------------------------------------------\nTemporalDataObject\n::~TemporalDataObject()\n{}\n\n\/\/----------------------------------------------------------------------------\nconst TemporalDataObject::TemporalRegionType\nTemporalDataObject\n::GetUnbufferedRequestedTemporalRegion()\n{\n  \/\/ Get the start and end of the buffered and requested temporal regions\n  unsigned long reqStart = m_RequestedTemporalRegion.GetFrameStart();\n  unsigned long reqEnd = m_RequestedTemporalRegion.GetFrameStart() +\n                          m_RequestedTemporalRegion.GetFrameDuration() - 1;\n  unsigned long bufStart = m_BufferedTemporalRegion.GetFrameStart();\n  unsigned long bufEnd = m_BufferedTemporalRegion.GetFrameStart() +\n                          m_BufferedTemporalRegion.GetFrameDuration() - 1;\n\n  \/\/DEBUG\n  std::cout << \"req start: \" << reqStart << \" req end: \" << reqEnd << std::endl;\n  std::cout << \"buf start: \" << bufStart << \" buf end: \" << bufEnd << std::endl;\n\n  \/\/ Handle case with unbuffered frames at beginning and end\n  if (reqStart < bufStart && reqEnd > bufEnd)\n    {\n    itkDebugMacro(<< \"Unbuffered frames at beginning and end. Returning entire \"\n                  << \"requested region as unbuffered\");\n    return this->m_RequestedTemporalRegion;\n    }\n\n  \/\/ Handle case with unbuffered frames at end -- TODO: FIX FOR REAL TIME!!!!!\n  else if(reqEnd > bufEnd)\n    {\n    TemporalRegionType out;\n    out.SetFrameStart(bufEnd + 1);\n    out.SetFrameDuration(reqEnd - bufEnd);\n    return out;\n    }\n\n  \/\/ Handle case with unbuffered frames at beginning -- TODO: FIX FOR REAL TIME!!!!!\n  else if(reqStart < bufStart)\n    {\n    TemporalRegionType out;\n    out.SetFrameStart(reqStart);\n    out.SetFrameDuration(bufStart - reqStart);\n    return out;\n    }\n\n  \/\/ Otherwise, nothing unbuffered\n  else\n    {\n    TemporalRegionType out;\n    out.SetFrameStart(0);\n    out.SetFrameDuration(0);\n    return out;\n    }\n\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::SetRequestedRegionToLargestPossibleRegion()\n{\n  this->SetRequestedTemporalRegion( this->GetLargestPossibleTemporalRegion() );\n}\n\n\/\/----------------------------------------------------------------------------\nbool\nTemporalDataObject\n::RequestedRegionIsOutsideOfTheBufferedRegion()\n{\n  bool frameFlag = m_RequestedTemporalRegion.GetFrameStart() <\n    m_BufferedTemporalRegion.GetFrameStart();\n  frameFlag |= m_RequestedTemporalRegion.GetFrameDuration() >\n    m_BufferedTemporalRegion.GetFrameDuration();\n  bool realTimeFlag = m_RequestedTemporalRegion.GetRealStart() <\n    m_BufferedTemporalRegion.GetRealStart();\n  realTimeFlag |= m_RequestedTemporalRegion.GetRealDuration() >\n    m_BufferedTemporalRegion.GetRealDuration();\n  switch( m_TemporalUnit )\n    {\n    case Frame:\n      {\n      return frameFlag;\n      }\n    case RealTime:\n      {\n      return realTimeFlag;\n      }\n    case FrameAndRealTime:\n      {\n      return frameFlag || realTimeFlag;\n      }\n    default:\n      itkExceptionMacro( << \"itk::TemporalDataObject::\"\n                         << \"RequestedRegionIsOutsideOfTheBufferedRegion() \"\n                         << \"Invalid Temporal Unit\" );\n      return true;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nbool\nTemporalDataObject\n::VerifyRequestedRegion()\n{\n  bool frameFlag = m_RequestedTemporalRegion.GetFrameStart() >=\n    m_LargestPossibleTemporalRegion.GetFrameStart();\n  frameFlag &= m_RequestedTemporalRegion.GetFrameDuration() <=\n    m_LargestPossibleTemporalRegion.GetFrameDuration();\n  bool realTimeFlag = m_RequestedTemporalRegion.GetRealStart() >=\n    m_LargestPossibleTemporalRegion.GetRealStart();\n  realTimeFlag &= m_RequestedTemporalRegion.GetRealDuration() <=\n    m_LargestPossibleTemporalRegion.GetRealDuration();\n  switch( m_TemporalUnit )\n    {\n    case Frame:\n      {\n      return frameFlag;\n      }\n    case RealTime:\n      {\n      return realTimeFlag;\n      }\n    case FrameAndRealTime:\n      {\n      return frameFlag && realTimeFlag;\n      }\n    default:\n      itkExceptionMacro( << \"itk::TemporalDataObject::VerifyRequestedRegion() \"\n                         << \"Invalid Temporal Unit\" );\n      return false;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::CopyInformation(const DataObject *data)\n{\n  \/\/ Standard call to the superclass' method\n  Superclass::CopyInformation(data);\n\n  const TemporalDataObject* temporalData;\n  temporalData = dynamic_cast< const TemporalDataObject* >( data );\n\n  if ( temporalData )\n    {\n    \/\/ Copy the meta data for this data type\n    this->SetLargestPossibleTemporalRegion(\n      temporalData->GetLargestPossibleTemporalRegion() );\n    for( unsigned int i = 0;\n         i < this->m_DataObjectBuffer->GetNumberOfBuffers();\n         ++i )\n      {\n      if( this->m_DataObjectBuffer->BufferIsFull(i) )\n        {\n        m_DataObjectBuffer->GetBufferContents(i)->CopyInformation(\n          temporalData->m_DataObjectBuffer->GetBufferContents(i) );\n        }\n      }\n    }\n  else\n    {\n    \/\/ pointer could not be cast back down\n    itkExceptionMacro( << \"itk::TemporalDataObject::CopyInformation() \"\n                       << \"cannot cast \" << typeid( data ).name() << \" to \"\n                       << typeid( const TemporalDataObject* ).name() );\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::Graft(const DataObject *data)\n{\n  const TemporalDataObject* temporalData;\n\n  temporalData = dynamic_cast< const TemporalDataObject* >( data );\n\n  if( temporalData )\n    {\n    \/\/ Copy the meta-information\n    this->CopyInformation( temporalData );\n\n    this->SetBufferedTemporalRegion(\n      temporalData->GetBufferedTemporalRegion() );\n    this->SetRequestedTemporalRegion(\n      temporalData->GetRequestedTemporalRegion() );\n\n    for( unsigned int i = 0;\n         i < this->m_DataObjectBuffer->GetNumberOfBuffers();\n         ++i )\n      {\n      if( this->m_DataObjectBuffer->BufferIsFull(i) )\n        {\n        m_DataObjectBuffer->GetBufferContents(i)->Graft(\n          temporalData->m_DataObjectBuffer->GetBufferContents(i) );\n        }\n      }\n    }\n  else\n    {\n    \/\/ pointer could not be cast back down\n    itkExceptionMacro( << \"itk::TemporalDataObject::Graft() \"\n                       << \"cannot cast \" << typeid( data ).name() << \" to \"\n                       << typeid( const TemporalDataObject* ).name() );\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::SetRequestedRegion(DataObject *data)\n{\n  TemporalDataObject *temporalData;\n\n  temporalData = dynamic_cast< TemporalDataObject * >( data );\n\n  if ( temporalData )\n    {\n    \/\/ only copy the RequestedTemporalRegion if the parameter object is\n    \/\/ a temporal data object\n    this->SetRequestedTemporalRegion(\n      temporalData->GetRequestedTemporalRegion() );\n    for( unsigned int i = 0;\n         i < this->m_DataObjectBuffer->GetNumberOfBuffers();\n         ++i )\n      {\n      if( this->m_DataObjectBuffer->BufferIsFull(i) )\n        {\n        m_DataObjectBuffer->GetBufferContents(i)->SetRequestedRegion(\n          temporalData->m_DataObjectBuffer->GetBufferContents(i) );\n        }\n      }\n    }\n  else\n    {\n    \/\/ pointer could not be cast back down\n    itkExceptionMacro( << \"itk::TemporalDataObject:SetRequestedRegion() \"\n                       << \"cannot cast \" << typeid( data ).name() << \" to \"\n                       << typeid( const TemporalDataObject* ).name() );\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n  Superclass::PrintSelf(os, indent);\n  os << indent << \"Data Object Buffer: \" << m_DataObjectBuffer.GetPointer()\n     << std::endl;\n  os << indent << \"LargestPossibleTemporalRegion: \" << std::endl;\n  this->GetLargestPossibleTemporalRegion().Print( os,\n                                                  indent.GetNextIndent() );\n\n  os << indent << \"BufferedTemporalRegion: \" << std::endl;\n  this->GetBufferedTemporalRegion().Print( os, indent.GetNextIndent() );\n\n  os << indent << \"RequestedTemporalRegion: \" << std::endl;\n  this->GetRequestedTemporalRegion().Print( os, indent.GetNextIndent() );\n}\n\n} \/\/ end namespace itk\n<commit_msg>ENH: Fix calculations for unbuffered region<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 \"itkProcessObject.h\"\n#include \"itkSmartPointerForwardReference.txx\"\n#include \"itkRealTimeClock.h\"\n#include \"itkTemporalDataObject.h\"\n\n\/\/ Manual instantiation is necessary to prevent link errors\ntemplate class itk::SmartPointerForwardReference< itk::ProcessObject >;\n\nnamespace itk\n{\n\n\/\/----------------------------------------------------------------------------\nTemporalDataObject::TemporalDataObject()\n  : m_LargestPossibleTemporalRegion(),\n    m_RequestedTemporalRegion(),\n    m_BufferedTemporalRegion(),\n    m_TemporalUnit(Frame)\n{\n  m_DataObjectBuffer = BufferType::New();\n}\n\n\/\/----------------------------------------------------------------------------\nTemporalDataObject\n::~TemporalDataObject()\n{}\n\n\/\/----------------------------------------------------------------------------\nconst TemporalDataObject::TemporalRegionType\nTemporalDataObject\n::GetUnbufferedRequestedTemporalRegion()\n{\n  \/\/ If nothing is buffered or nothing is requested, just return the entire request\n  if (m_BufferedTemporalRegion.GetFrameDuration() == 0 ||\n      m_RequestedTemporalRegion.GetFrameDuration() == 0)\n    {\n    return m_RequestedTemporalRegion;\n    }\n\n  \/\/ Get the start and end of the buffered and requested temporal regions\n  unsigned long reqStart = m_RequestedTemporalRegion.GetFrameStart();\n  unsigned long reqEnd = m_RequestedTemporalRegion.GetFrameStart() +\n                          m_RequestedTemporalRegion.GetFrameDuration() - 1;\n\n  unsigned long bufStart = m_BufferedTemporalRegion.GetFrameStart();\n  unsigned long bufEnd = m_BufferedTemporalRegion.GetFrameStart() +\n                          m_BufferedTemporalRegion.GetFrameDuration() - 1;\n\n  \/\/ If the request starts after the buffered region, return the whole request\n  if (reqStart > bufEnd)\n    {\n    return m_RequestedTemporalRegion;\n    }\n\n  \/\/ Handle case with unbuffered frames at beginning and end\n  if (reqStart < bufStart && reqEnd > bufEnd)\n    {\n    itkDebugMacro(<< \"Unbuffered frames at beginning and end. Returning entire \"\n                  << \"requested region as unbuffered\");\n    return this->m_RequestedTemporalRegion;\n    }\n\n  \/\/ Handle case with unbuffered frames at end -- TODO: FIX FOR REAL TIME!!!!!\n  else if(reqEnd > bufEnd)\n    {\n    TemporalRegionType out;\n    out.SetFrameStart(bufEnd + 1);\n    out.SetFrameDuration(reqEnd - bufEnd);\n    return out;\n    }\n\n  \/\/ Handle case with unbuffered frames at beginning -- TODO: FIX FOR REAL TIME!!!!!\n  else if(reqStart < bufStart)\n    {\n    TemporalRegionType out;\n    out.SetFrameStart(reqStart);\n    out.SetFrameDuration(bufStart - reqStart);\n    return out;\n    }\n\n  \/\/ Otherwise, nothing unbuffered\n  else\n    {\n    TemporalRegionType out;\n    out.SetFrameStart(0);\n    out.SetFrameDuration(0);\n    return out;\n    }\n\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::SetRequestedRegionToLargestPossibleRegion()\n{\n  this->SetRequestedTemporalRegion( this->GetLargestPossibleTemporalRegion() );\n}\n\n\/\/----------------------------------------------------------------------------\nbool\nTemporalDataObject\n::RequestedRegionIsOutsideOfTheBufferedRegion()\n{\n  bool frameFlag = m_RequestedTemporalRegion.GetFrameStart() <\n    m_BufferedTemporalRegion.GetFrameStart();\n  frameFlag |= m_RequestedTemporalRegion.GetFrameDuration() >\n    m_BufferedTemporalRegion.GetFrameDuration();\n  bool realTimeFlag = m_RequestedTemporalRegion.GetRealStart() <\n    m_BufferedTemporalRegion.GetRealStart();\n  realTimeFlag |= m_RequestedTemporalRegion.GetRealDuration() >\n    m_BufferedTemporalRegion.GetRealDuration();\n  switch( m_TemporalUnit )\n    {\n    case Frame:\n      {\n      return frameFlag;\n      }\n    case RealTime:\n      {\n      return realTimeFlag;\n      }\n    case FrameAndRealTime:\n      {\n      return frameFlag || realTimeFlag;\n      }\n    default:\n      itkExceptionMacro( << \"itk::TemporalDataObject::\"\n                         << \"RequestedRegionIsOutsideOfTheBufferedRegion() \"\n                         << \"Invalid Temporal Unit\" );\n      return true;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nbool\nTemporalDataObject\n::VerifyRequestedRegion()\n{\n  bool frameFlag = m_RequestedTemporalRegion.GetFrameStart() >=\n    m_LargestPossibleTemporalRegion.GetFrameStart();\n  frameFlag &= m_RequestedTemporalRegion.GetFrameDuration() <=\n    m_LargestPossibleTemporalRegion.GetFrameDuration();\n  bool realTimeFlag = m_RequestedTemporalRegion.GetRealStart() >=\n    m_LargestPossibleTemporalRegion.GetRealStart();\n  realTimeFlag &= m_RequestedTemporalRegion.GetRealDuration() <=\n    m_LargestPossibleTemporalRegion.GetRealDuration();\n  switch( m_TemporalUnit )\n    {\n    case Frame:\n      {\n      return frameFlag;\n      }\n    case RealTime:\n      {\n      return realTimeFlag;\n      }\n    case FrameAndRealTime:\n      {\n      return frameFlag && realTimeFlag;\n      }\n    default:\n      itkExceptionMacro( << \"itk::TemporalDataObject::VerifyRequestedRegion() \"\n                         << \"Invalid Temporal Unit\" );\n      return false;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::CopyInformation(const DataObject *data)\n{\n  \/\/ Standard call to the superclass' method\n  Superclass::CopyInformation(data);\n\n  const TemporalDataObject* temporalData;\n  temporalData = dynamic_cast< const TemporalDataObject* >( data );\n\n  if ( temporalData )\n    {\n    \/\/ Copy the meta data for this data type\n    this->SetLargestPossibleTemporalRegion(\n      temporalData->GetLargestPossibleTemporalRegion() );\n    for( unsigned int i = 0;\n         i < this->m_DataObjectBuffer->GetNumberOfBuffers();\n         ++i )\n      {\n      if( this->m_DataObjectBuffer->BufferIsFull(i) )\n        {\n        m_DataObjectBuffer->GetBufferContents(i)->CopyInformation(\n          temporalData->m_DataObjectBuffer->GetBufferContents(i) );\n        }\n      }\n    }\n  else\n    {\n    \/\/ pointer could not be cast back down\n    itkExceptionMacro( << \"itk::TemporalDataObject::CopyInformation() \"\n                       << \"cannot cast \" << typeid( data ).name() << \" to \"\n                       << typeid( const TemporalDataObject* ).name() );\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::Graft(const DataObject *data)\n{\n  const TemporalDataObject* temporalData;\n\n  temporalData = dynamic_cast< const TemporalDataObject* >( data );\n\n  if( temporalData )\n    {\n    \/\/ Copy the meta-information\n    this->CopyInformation( temporalData );\n\n    this->SetBufferedTemporalRegion(\n      temporalData->GetBufferedTemporalRegion() );\n    this->SetRequestedTemporalRegion(\n      temporalData->GetRequestedTemporalRegion() );\n\n    for( unsigned int i = 0;\n         i < this->m_DataObjectBuffer->GetNumberOfBuffers();\n         ++i )\n      {\n      if( this->m_DataObjectBuffer->BufferIsFull(i) )\n        {\n        m_DataObjectBuffer->GetBufferContents(i)->Graft(\n          temporalData->m_DataObjectBuffer->GetBufferContents(i) );\n        }\n      }\n    }\n  else\n    {\n    \/\/ pointer could not be cast back down\n    itkExceptionMacro( << \"itk::TemporalDataObject::Graft() \"\n                       << \"cannot cast \" << typeid( data ).name() << \" to \"\n                       << typeid( const TemporalDataObject* ).name() );\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::SetRequestedRegion(DataObject *data)\n{\n  TemporalDataObject *temporalData;\n\n  temporalData = dynamic_cast< TemporalDataObject * >( data );\n\n  if ( temporalData )\n    {\n    \/\/ only copy the RequestedTemporalRegion if the parameter object is\n    \/\/ a temporal data object\n    this->SetRequestedTemporalRegion(\n      temporalData->GetRequestedTemporalRegion() );\n    for( unsigned int i = 0;\n         i < this->m_DataObjectBuffer->GetNumberOfBuffers();\n         ++i )\n      {\n      if( this->m_DataObjectBuffer->BufferIsFull(i) )\n        {\n        m_DataObjectBuffer->GetBufferContents(i)->SetRequestedRegion(\n          temporalData->m_DataObjectBuffer->GetBufferContents(i) );\n        }\n      }\n    }\n  else\n    {\n    \/\/ pointer could not be cast back down\n    itkExceptionMacro( << \"itk::TemporalDataObject:SetRequestedRegion() \"\n                       << \"cannot cast \" << typeid( data ).name() << \" to \"\n                       << typeid( const TemporalDataObject* ).name() );\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nTemporalDataObject\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n  Superclass::PrintSelf(os, indent);\n  os << indent << \"Data Object Buffer: \" << m_DataObjectBuffer.GetPointer()\n     << std::endl;\n  os << indent << \"LargestPossibleTemporalRegion: \" << std::endl;\n  this->GetLargestPossibleTemporalRegion().Print( os,\n                                                  indent.GetNextIndent() );\n\n  os << indent << \"BufferedTemporalRegion: \" << std::endl;\n  this->GetBufferedTemporalRegion().Print( os, indent.GetNextIndent() );\n\n  os << indent << \"RequestedTemporalRegion: \" << std::endl;\n  this->GetRequestedTemporalRegion().Print( os, indent.GetNextIndent() );\n}\n\n} \/\/ end namespace itk\n<|endoftext|>"}
{"text":"<commit_before>#include <string>\n\n#include <config\/config.h>\n#include <config\/config_class.h>\n#include <config\/config_object.h>\n#include <config\/config_type.h>\n#include <config\/config_value.h>\n\nConfig::Config(void)\n: log_(\"\/config\"),\n  class_map_(),\n  object_map_()\n{ }\n\nConfig::~Config()\n{\n\tASSERT(class_map_.empty());\n\tASSERT(object_map_.empty());\n}\n\nbool\nConfig::activate(const std::string& oname)\n{\n\tif (object_map_.find(oname) == object_map_.end()) {\n\t\tERROR(log_) << \"Object (\" << oname << \") can not be activated as it does not exist.\";\n\t\treturn (false);\n\t}\n\n\tConfigObject *co = object_map_[oname];\n\tConfigClass *cc = co->class_;\n\n\treturn (cc->activate(co));\n}\n\nbool\nConfig::create(const std::string& cname, const std::string& oname)\n{\n\tif (class_map_.find(cname) == class_map_.end()) {\n\t\tERROR(log_) << \"Class (\" << cname << \") not present.\";\n\t\treturn (false);\n\t}\n\tif (object_map_.find(oname) != object_map_.end()) {\n\t\tERROR(log_) << \"Refusing to create object (\" << oname << \") twice.\";\n\t\treturn (false);\n\t}\n\n\tConfigClass *cc = class_map_[cname];\n\tConfigObject *co = new ConfigObject(this, cc);\n\n\tobject_map_[oname] = co;\n\n\treturn (true);\n}\n\nbool\nConfig::set(const std::string& oname, const std::string& mname,\n\t    const std::string& vstr)\n{\n\tif (object_map_.find(oname) == object_map_.end()) {\n\t\tERROR(log_) << \"Can not set member value on object (\" << oname << \") that does not exist.\";\n\t\treturn (false);\n\t}\n\n\tConfigObject *co = object_map_[oname];\n\tConfigClass *cc = co->class_;\n\n\tConfigType *ct = cc->member(mname);\n\tif (ct == NULL) {\n\t\tERROR(log_) << \"No such member (\" << mname << \") in object (\" << oname << \")\";\n\t\treturn (false);\n\t}\n\n\tConfigValue *cv = new ConfigValue(this, ct, vstr);\n\tif (!ct->set(cv, vstr)) {\n\t\tdelete cv;\n\t\treturn (false);\n\t}\n\tcc->set(co, mname, cv);\n\n\treturn (true);\n}\n\nvoid\nConfig::import(const std::string& cname, ConfigClass *cc)\n{\n\tif (class_map_.find(cname) != class_map_.end())\n\t\treturn;\n\n\tclass_map_[cname] = cc;\n}\n<commit_msg>Add untested reference resolution code.<commit_after>#include <string>\n\n#include <config\/config.h>\n#include <config\/config_class.h>\n#include <config\/config_object.h>\n#include <config\/config_type.h>\n#include <config\/config_value.h>\n\nConfig::Config(void)\n: log_(\"\/config\"),\n  class_map_(),\n  object_map_()\n{ }\n\nConfig::~Config()\n{\n\tASSERT(class_map_.empty());\n\tASSERT(object_map_.empty());\n}\n\nbool\nConfig::activate(const std::string& oname)\n{\n\tif (object_map_.find(oname) == object_map_.end()) {\n\t\tERROR(log_) << \"Object (\" << oname << \") can not be activated as it does not exist.\";\n\t\treturn (false);\n\t}\n\n\tConfigObject *co = object_map_[oname];\n\tConfigClass *cc = co->class_;\n\n\treturn (cc->activate(co));\n}\n\nbool\nConfig::create(const std::string& cname, const std::string& oname)\n{\n\tif (class_map_.find(cname) == class_map_.end()) {\n\t\tERROR(log_) << \"Class (\" << cname << \") not present.\";\n\t\treturn (false);\n\t}\n\tif (object_map_.find(oname) != object_map_.end()) {\n\t\tERROR(log_) << \"Refusing to create object (\" << oname << \") twice.\";\n\t\treturn (false);\n\t}\n\n\tConfigClass *cc = class_map_[cname];\n\tConfigObject *co = new ConfigObject(this, cc);\n\n\tobject_map_[oname] = co;\n\n\treturn (true);\n}\n\nbool\nConfig::set(const std::string& oname, const std::string& mname,\n\t    const std::string& vstr)\n{\n\tif (object_map_.find(oname) == object_map_.end()) {\n\t\tERROR(log_) << \"Can not set member value on object (\" << oname << \") that does not exist.\";\n\t\treturn (false);\n\t}\n\n\tConfigObject *co = object_map_[oname];\n\tConfigClass *cc = co->class_;\n\n\tConfigType *ct = cc->member(mname);\n\tif (ct == NULL) {\n\t\tERROR(log_) << \"No such member (\" << mname << \") in object (\" << oname << \")\";\n\t\treturn (false);\n\t}\n\n\tif (vstr[0] == '$') {\n\t\tstd::string::const_iterator dot;\n\n\t\tdot = std::find(vstr.begin(), vstr.end(), '.');\n\n\t\tstd::string ooname(vstr.begin() + 1, dot);\n\t\tstd::string omname(dot, vstr.end());\n\n\t\tif (ooname == \"\" || omname == \"\") {\n\t\t\tERROR(log_) << \"Refernece to invalid object (\" << ooname << \") or member (\" << omname << \") by name.\";\n\t\t\treturn (false);\n\t\t}\n\n\t\tif (object_map_.find(ooname) == object_map_.end()) {\n\t\t\tERROR(log_) << \"Reference to non-existant object (\" << ooname << \")\";\n\t\t\treturn (false);\n\t\t}\n\n\t\tConfigObject *oco = object_map_[ooname];\n\t\tConfigClass *occ = oco->class_;\n\n\t\tConfigType *oct = occ->member(mname);\n\t\tif (oct == NULL) {\n\t\t\tERROR(log_) << \"Reference to non-existant member (\" << omname << \") in object (\" << ooname << \")\";\n\t\t\treturn (false);\n\t\t}\n\n\t\tConfigValue *ocv = oco->members_[omname];\n\t\tif (ocv == NULL) {\n\t\t\tERROR(log_) << \"Reference to uninitialized member (\" << omname << \") in object (\" << ooname << \")\";\n\t\t\treturn (false);\n\t\t}\n\n\t\treturn (set(oname, mname, ocv->string_));\n\t}\n\n\tConfigValue *cv = new ConfigValue(this, ct, vstr);\n\tif (!ct->set(cv, vstr)) {\n\t\tdelete cv;\n\t\treturn (false);\n\t}\n\tcc->set(co, mname, cv);\n\n\treturn (true);\n}\n\nvoid\nConfig::import(const std::string& cname, ConfigClass *cc)\n{\n\tif (class_map_.find(cname) != class_map_.end())\n\t\treturn;\n\n\tclass_map_[cname] = cc;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n load_jpeg.cpp - Example showing how to insert BLOB data into the\n\tdatabase from a file.\n\n Copyright (c) 1998 by Kevin Atkinson, (c) 1999-2001 by MySQL AB, and\n (c) 2004-2009 by Educational Technology Resources, Inc.  Others may\n also hold copyrights on code in this file.  See the CREDITS.txt file\n in the top directory of the distribution for details.\n\n This file is part of MySQL++.\n\n MySQL++ is free software; you can redistribute it and\/or modify it\n 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 (at your option) any later version.\n\n MySQL++ 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\n License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with MySQL++; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301\n USA\n***********************************************************************\/\n\n#include \"cmdline.h\"\n#include \"images.h\"\n#include \"printdata.h\"\n\n#include <fstream>\n\nusing namespace std;\nusing namespace mysqlpp;\n\n\n\/\/ This is just an implementation detail for the example.  Skip down to\n\/\/ main() for the concept this example is trying to demonstrate.\nstatic bool\nis_jpeg(const char* img_data)\n{\n\tconst unsigned char* idp =\n\t\t\treinterpret_cast<const unsigned char*>(img_data);\n\treturn (idp[0] == 0xFF) && (idp[1] == 0xD8) &&\n\t\t\t((memcmp(idp + 6, \"JFIF\", 4) == 0) ||\n\t\t\t (memcmp(idp + 6, \"Exif\", 4) == 0));\n}\n\n\n\/\/ Another implementation detail.  Skip to main().\nstatic bool\nload_jpeg_file(const mysqlpp::examples::CommandLine& cmdline,\n\t\timages& img, string& img_name)\n{\n\tif (cmdline.extra_args().size() == 0) {\n\t\t\/\/ Nothing for us to do here.  Caller will insert NULL BLOB.\n\t\treturn true;\n\t}\n\n\t\/\/ Got a file's name on the command line, so open it.\n\timg_name = cmdline.extra_args()[0];\n\tifstream img_file(img_name.c_str(), ios::ate | ios::binary);\n\tif (img_file) {\n\t\t\/\/ File opened, so try to slurp its contents into RAM.  The key\n\t\t\/\/ thing to get from this function is that we're storing the\n\t\t\/\/ binary data in a mysqlpp::sql_blob value, which we assign from\n\t\t\/\/ a C++ string (stringstream::str()), thus not truncating the\n\t\t\/\/ string at the first embedded null character.\n\t\tstringstream sstr;\n\t\tsstr << img_file.rdbuf();\n\t\timg.data.data = sstr.str();\n\n\t\t\/\/ Check JPEG data for sanity\n\t\tif (img.data.data.size() > 10) {\n\t\t\t\/\/ The following triple 'data' sure does look foolish,\n\t\t\t\/\/ doesn't it?  Sorry, we're not trying to be obscure here,\n\t\t\t\/\/ it's just a coincidence of naming.  Right-to-left, what\n\t\t\t\/\/ we have here is:\n\t\t\t\/\/\n\t\t\t\/\/ 1. A call to mysqlpp::sql_blob::data() (mirroring C++'s\n\t\t\t\/\/    std::string:data() interface) to get the raw C data\n\t\t\t\/\/    pointer without null-terminating it first.\n\t\t\t\/\/ 2. Access to the mysqlpp::sql_blob object through its\n\t\t\t\/\/    mysqlpp::Null<> wrapper, which lets us have a \"NULL\n\t\t\t\/\/    JPEG\" in the DB when the file doesn't exist.\n\t\t\t\/\/ 3. Access to the JPEG BLOB column, images.data.\n\t\t\tif (is_jpeg(img.data.data.data())) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcerr << '\"' << img_file << \"\\\" isn't a JPEG!\" << endl;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcerr << \"File is too short to be a JPEG!\" << endl;\n\t\t}\n\t}\n\n\tcmdline.print_usage(\"[jpeg_file]\");\n\treturn false;\n}\n\n\nint\nmain(int argc, char *argv[])\n{\n\t\/\/ Get database access parameters from command line\n\tmysqlpp::examples::CommandLine cmdline(argc, argv);\n\tif (!cmdline) {\n\t\treturn 1;\n\t}\n\n\ttry {\n\t\t\/\/ Establish the connection to the database server.\n\t\tmysqlpp::Connection con(mysqlpp::examples::db_name,\n\t\t\t\tcmdline.server(), cmdline.user(), cmdline.pass());\n\n\t\t\/\/ Load the file named on the command line\n\t\timages img(mysqlpp::null, mysqlpp::null);\n\t\tstring img_name(\"NULL\");\n\t\tif (load_jpeg_file(cmdline, img, img_name)) {\n\t\t\t\/\/ Insert image data or SQL NULL into the images.data BLOB\n\t\t\t\/\/ column.  The key here is that we're holding the raw\n\t\t\t\/\/ binary data in a mysqlpp::sql_blob, which avoids data\n\t\t\t\/\/ conversion problems that can lead to treating BLOB data\n\t\t\t\/\/ as C strings, thus causing null-truncation.  The fact\n\t\t\t\/\/ that we're using SSQLS here is a side issue, simply\n\t\t\t\/\/ demonstrating that mysqlpp::Null<mysqlpp::sql_blob> is\n\t\t\t\/\/ now legal in SSQLS, as of MySQL++ 3.0.7.\n\t\t\tQuery query = con.query();\n\t\t\tquery.insert(img);\n\t\t\tSimpleResult res = query.execute();\n\n\t\t\t\/\/ Report successful insertion\n\t\t\tcout << \"Inserted \\\"\" << img_name <<\n\t\t\t\t\t\"\\\" into images table, \" << img.data.data.size() <<\n\t\t\t\t\t\" bytes, ID \" << res.insert_id() << endl;\n\t\t}\n\t}\n\tcatch (const BadQuery& er) {\n\t\t\/\/ Handle any query errors\n\t\tcerr << \"Query error: \" << er.what() << endl;\n\t\treturn -1;\n\t}\n\tcatch (const BadConversion& er) {\n\t\t\/\/ Handle bad conversions\n\t\tcerr << \"Conversion error: \" << er.what() << endl <<\n\t\t\t\t\"\\tretrieved data size: \" << er.retrieved <<\n\t\t\t\t\", actual size: \" << er.actual_size << endl;\n\t\treturn -1;\n\t}\n\tcatch (const Exception& er) {\n\t\t\/\/ Catch-all for any other MySQL++ exceptions\n\t\tcerr << \"Error: \" << er.what() << endl;\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n<commit_msg>Yet another load_jpeg example simplification<commit_after>\/***********************************************************************\n load_jpeg.cpp - Example showing how to insert BLOB data into the\n\tdatabase from a file.\n\n Copyright (c) 1998 by Kevin Atkinson, (c) 1999-2001 by MySQL AB, and\n (c) 2004-2009 by Educational Technology Resources, Inc.  Others may\n also hold copyrights on code in this file.  See the CREDITS.txt file\n in the top directory of the distribution for details.\n\n This file is part of MySQL++.\n\n MySQL++ is free software; you can redistribute it and\/or modify it\n 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 (at your option) any later version.\n\n MySQL++ 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\n License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with MySQL++; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301\n USA\n***********************************************************************\/\n\n#include \"cmdline.h\"\n#include \"images.h\"\n#include \"printdata.h\"\n\n#include <fstream>\n\nusing namespace std;\nusing namespace mysqlpp;\n\n\n\/\/ This is just an implementation detail for the example.  Skip down to\n\/\/ main() for the concept this example is trying to demonstrate.\nstatic bool\nis_jpeg(const char* img_data)\n{\n\tconst unsigned char* idp =\n\t\t\treinterpret_cast<const unsigned char*>(img_data);\n\treturn (idp[0] == 0xFF) && (idp[1] == 0xD8) &&\n\t\t\t((memcmp(idp + 6, \"JFIF\", 4) == 0) ||\n\t\t\t (memcmp(idp + 6, \"Exif\", 4) == 0));\n}\n\n\n\/\/ Another implementation detail.  Skip to main().\nstatic bool\nload_jpeg_file(const mysqlpp::examples::CommandLine& cmdline,\n\t\timages& img, string& img_name)\n{\n\tif (cmdline.extra_args().size() == 0) {\n\t\t\/\/ Nothing for us to do here.  Caller will insert NULL BLOB.\n\t\treturn true;\n\t}\n\n\t\/\/ Got a file's name on the command line, so open it.\n\timg_name = cmdline.extra_args()[0];\n\tifstream img_file(img_name.c_str(), ios::ate | ios::binary);\n\tif (img_file) {\n\t\t\/\/ File opened, so try to slurp its contents into RAM.  The key\n\t\t\/\/ thing to get from this function is that we're storing the\n\t\t\/\/ binary data in a mysqlpp::sql_blob value, which we assign from\n\t\t\/\/ a C++ string (stringstream::str()), thus not truncating the\n\t\t\/\/ string at the first embedded null character.\n\t\tstringstream sstr;\n\t\tsstr << img_file.rdbuf();\n\t\timg.data.data = sstr.str();\n\n\t\t\/\/ Check JPEG data for sanity.\n\t\t\/\/\n\t\t\/\/ All these 'data's sure do look foolish, don't they?  Sorry,\n\t\t\/\/ we're not trying to be obscure here, it's just a coincidence\n\t\t\/\/ of naming.  The triple 'data' in the is_jpeg() call breaks\n\t\t\/\/ down like this:\n\t\t\/\/\n\t\t\/\/ 1. We're accessing to the JPEG BLOB column, images.data.\n\t\t\/\/ 2. We then dig down to the mysqlpp::sql_blob object through\n\t\t\/\/    its mysqlpp::Null<> wrapper, which we need to allow a\n\t\t\/\/    \"NULL JPEG\" in the DB when the file doesn't exist.\n\t\t\/\/ 3. Finally, we need to pass a raw, unterminated char buffer\n\t\t\/\/    pointer to is_jpeg(), which mysqlpp::sql_blob::data()\n\t\t\/\/    returns, mirroring the C++'s std::string interface.\n\t\tif ((img.data.data.size() > 10) &&\n\t\t\t\tis_jpeg(img.data.data.data())) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\tcerr << '\"' << img_file << \"\\\" isn't a JPEG file!\" << endl;\n\t\t}\n\t}\n\n\tcmdline.print_usage(\"[jpeg_file]\");\n\treturn false;\n}\n\n\nint\nmain(int argc, char *argv[])\n{\n\t\/\/ Get database access parameters from command line\n\tmysqlpp::examples::CommandLine cmdline(argc, argv);\n\tif (!cmdline) {\n\t\treturn 1;\n\t}\n\n\ttry {\n\t\t\/\/ Establish the connection to the database server.\n\t\tmysqlpp::Connection con(mysqlpp::examples::db_name,\n\t\t\t\tcmdline.server(), cmdline.user(), cmdline.pass());\n\n\t\t\/\/ Load the file named on the command line\n\t\timages img(mysqlpp::null, mysqlpp::null);\n\t\tstring img_name(\"NULL\");\n\t\tif (load_jpeg_file(cmdline, img, img_name)) {\n\t\t\t\/\/ Insert image data or SQL NULL into the images.data BLOB\n\t\t\t\/\/ column.  The key here is that we're holding the raw\n\t\t\t\/\/ binary data in a mysqlpp::sql_blob, which avoids data\n\t\t\t\/\/ conversion problems that can lead to treating BLOB data\n\t\t\t\/\/ as C strings, thus causing null-truncation.  The fact\n\t\t\t\/\/ that we're using SSQLS here is a side issue, simply\n\t\t\t\/\/ demonstrating that mysqlpp::Null<mysqlpp::sql_blob> is\n\t\t\t\/\/ now legal in SSQLS, as of MySQL++ 3.0.7.\n\t\t\tQuery query = con.query();\n\t\t\tquery.insert(img);\n\t\t\tSimpleResult res = query.execute();\n\n\t\t\t\/\/ Report successful insertion\n\t\t\tcout << \"Inserted \\\"\" << img_name <<\n\t\t\t\t\t\"\\\" into images table, \" << img.data.data.size() <<\n\t\t\t\t\t\" bytes, ID \" << res.insert_id() << endl;\n\t\t}\n\t}\n\tcatch (const BadQuery& er) {\n\t\t\/\/ Handle any query errors\n\t\tcerr << \"Query error: \" << er.what() << endl;\n\t\treturn -1;\n\t}\n\tcatch (const BadConversion& er) {\n\t\t\/\/ Handle bad conversions\n\t\tcerr << \"Conversion error: \" << er.what() << endl <<\n\t\t\t\t\"\\tretrieved data size: \" << er.retrieved <<\n\t\t\t\t\", actual size: \" << er.actual_size << endl;\n\t\treturn -1;\n\t}\n\tcatch (const Exception& er) {\n\t\t\/\/ Catch-all for any other MySQL++ exceptions\n\t\tcerr << \"Error: \" << er.what() << endl;\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/uvc.h\"\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <string>\n#include <sstream>\n\n#include <linux\/uvcvideo.h>\n#include <linux\/videodev2.h>\n#include <linux\/usb\/video.h>\n\nnamespace rsimpl\n{\n    namespace uvc\n    {\n        struct context\n        {\n            \/\/ TODO: V4L2-specific information\n\n            context() {} \/\/ TODO: Init\n            ~context() {} \/\/ TODO: Cleanup\n        };\n\n        struct subdevice\n        {\n            \/\/ TODO: Stream-specific information\n            std::string name;\n            uint16_t camIndex;\n\n            std::function<void(const void * frame)> callback;\n        };\n\n        struct device\n        {\n            const std::shared_ptr<context> parent;\n\n            \/\/ TODO: Device-specific information\n            std::vector<subdevice> subdevices;\n\n            uint32_t serialNumber;\n\n            device(std::shared_ptr<context> parent) : parent(parent) {} \/\/ TODO: Init\n            ~device() {} \/\/ TODO: Cleanup\n        };\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ device \/\/\n        \/\/\/\/\/\/\/\/\/\/\/\/\n\n        int get_vendor_id(const device & device) { return 0; }\n        int get_product_id(const device & device) { return 0; }\n\n        void init_controls(device & device, int subdevice, const guid & xu_guid) {}\n        void get_control(const device & device, int subdevice, uint8_t ctrl, void * data, int len) {}\n        void set_control(device & device, int subdevice, uint8_t ctrl, void * data, int len) {}\n\n        void claim_interface(device & device, const guid & interface_guid, int interface_number) {}\n        void bulk_transfer(device & device, unsigned char endpoint, void * data, int length, int *actual_length, unsigned int timeout) {}\n\n        void set_subdevice_mode(device & device, int subdevice_index, int width, int height, uint32_t fourcc, int fps, std::function<void(const void * frame)> callback) {}\n        void start_streaming(device & device, int num_transfer_bufs) {}\n        void stop_streaming(device & device) {}\n        \n        void set_pu_control(device & device, int subdevice, rs_option option, int value) {}\n        int get_pu_control(const device & device, int subdevice, rs_option option) { return 0; }\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ context \/\/\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\n\n        std::shared_ptr<context> create_context()\n        {\n            return std::make_shared<context>();\n        }\n\n        std::vector<std::shared_ptr<device>> query_devices(std::shared_ptr<context> context)\n        {\n\n            std::vector<std::shared_ptr<device>> devices;\n\n            auto make_subdevice = [&](char * name, uint16_t & indexDepth, uint16_t & indexIR, uint16_t & indexRGB)\n            {\n                auto subdev = std::make_shared<subdevice>();\n                if (strcmp(name, \"Intel(R) RealSense(TM) 3D Camera (R200) Depth\") == 0)\n                {\n                    subdev.name = std::string(name);\n                    subdev.camIndex = indexDepth++;\n                }\n                else if (strcmp(name, \"Intel(R) RealSense(TM) 3D Camera (R200) Left-Right\") == 0)\n                {\n                    subdev.name = std::string(name);\n                    subdev.camIndex = indexIR++;\n                }\n                else if (strcmp(name, \"Intel(R) RealSense(TM) 3D Camera (R200) RGB\") == 0)\n                {\n                    subdev.name = std::string(name);\n                    subdev.camIndex = indexRGB++;\n                }\n                return subdev;\n            };\n\n            try\n            {\n                std::stringstream ss;\n                std::string strTmpDev;\n                std::string strTmpInt;\n\n                struct stat vstat;\n                char buf[64] = {0};\n                int fd = 0;\n                int ret = 0;\n                char * nl = NULL;\n\n                uint16_t indexDepth = 0;\n                uint16_t indexIR = 0;\n                uint16_t indexRGB = 0;\n\n                for (int i = 0; i < 64; ++i)\n                {\n                    ss.str(\"\");\n                    ss << \"\/dev\/video\" << i;\n\n                    strTmpDev = ss.str();\n                    if (stat(strTmpDev.c_str(), &vstat) < 0 || !S_ISCHR(vstat.st_mode))\n                        break;\n\n                    ss.str(\"\");\n                    ss << \"\/sys\/class\/video4linux\/video\" << i << \"\/device\/interface\";\n                    strTmpInt = ss.str();\n\n                    fd = open(strTmpInt.c_str(), O_RDONLY);\n                    if (fd < 0)\n                        continue;\n\n                    ret = read(fd, buf, sizeof(buf));\n                    close(fd);\n                    if (ret < 0)\n                        continue;\n\n                    buf[63] = 0;\n\n                    nl = strchr(buf, '\\n');\n                    if (!nl)\n                        continue;\n\n                    *nl = '\\0';\n\n                    if (strncmp(buf, \"DS4\", 3) == 0 || strncmp(buf, \"Intel(R) RealSense(TM) 3D Camera (R200)\", 39) == 0)\n                    {\n                        devices.subdevices.push_back(make_subdevice(buf, indexDepth, indexIR, indexRGB));\n                    }\n                }\n            }\n            catch (...)\n            {\n                throw std::runtime_error(\"failed to enumerate list of devices\");\n            }\n\n            return devices;\n        }\n    }\n}\n<commit_msg>use strings instead of strcmp<commit_after>#include \"..\/uvc.h\"\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <string>\n#include <sstream>\n\n#include <linux\/uvcvideo.h>\n#include <linux\/videodev2.h>\n#include <linux\/usb\/video.h>\n\nnamespace rsimpl\n{\n    namespace uvc\n    {\n        struct context\n        {\n            \/\/ TODO: V4L2-specific information\n\n            context() {} \/\/ TODO: Init\n            ~context() {} \/\/ TODO: Cleanup\n        };\n\n        struct subdevice\n        {\n            \/\/ TODO: Stream-specific information\n            std::string name;\n            uint16_t camIndex;\n\n            std::function<void(const void * frame)> callback;\n        };\n\n        struct device\n        {\n            const std::shared_ptr<context> parent;\n\n            \/\/ TODO: Device-specific information\n            std::vector<subdevice> subdevices;\n\n            uint32_t serialNumber;\n\n            device(std::shared_ptr<context> parent) : parent(parent) {} \/\/ TODO: Init\n            ~device() {} \/\/ TODO: Cleanup\n        };\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ device \/\/\n        \/\/\/\/\/\/\/\/\/\/\/\/\n\n        int get_vendor_id(const device & device) { return 0; }\n        int get_product_id(const device & device) { return 0; }\n\n        void init_controls(device & device, int subdevice, const guid & xu_guid) {}\n        void get_control(const device & device, int subdevice, uint8_t ctrl, void * data, int len) {}\n        void set_control(device & device, int subdevice, uint8_t ctrl, void * data, int len) {}\n\n        void claim_interface(device & device, const guid & interface_guid, int interface_number) {}\n        void bulk_transfer(device & device, unsigned char endpoint, void * data, int length, int *actual_length, unsigned int timeout) {}\n\n        void set_subdevice_mode(device & device, int subdevice_index, int width, int height, uint32_t fourcc, int fps, std::function<void(const void * frame)> callback) {}\n        void start_streaming(device & device, int num_transfer_bufs) {}\n        void stop_streaming(device & device) {}\n        \n        void set_pu_control(device & device, int subdevice, rs_option option, int value) {}\n        int get_pu_control(const device & device, int subdevice, rs_option option) { return 0; }\n\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ context \/\/\n        \/\/\/\/\/\/\/\/\/\/\/\/\/\n\n        std::shared_ptr<context> create_context()\n        {\n            return std::make_shared<context>();\n        }\n\n        std::vector<std::shared_ptr<device>> query_devices(std::shared_ptr<context> context)\n        {\n            std::vector<std::shared_ptr<device>> devices;\n\n            auto make_subdevice = [&](char * name, uint16_t & indexDepth, uint16_t & indexIR, uint16_t & indexRGB)\n            {\n                auto subdev = std::make_shared<subdevice>();\n                if (std::string(name) == \"Intel(R) RealSense(TM) 3D Camera (R200) Depth\"))\n                {\n                    subdev.name = std::string(name);\n                    subdev.camIndex = indexDepth++;\n                }\n                else if (std::string(name) == \"Intel(R) RealSense(TM) 3D Camera (R200) Left-Right\"))\n                {\n                    subdev.name = std::string(name);\n                    subdev.camIndex = indexIR++;\n                }\n                else if (std::string(name) == \"Intel(R) RealSense(TM) 3D Camera (R200) RGB\"))\n                {\n                    subdev.name = std::string(name);\n                    subdev.camIndex = indexRGB++;\n                }\n                return subdev;\n            };\n\n            try\n            {\n                std::stringstream ss;\n                std::string strTmpDev;\n                std::string strTmpInt;\n\n                struct stat vstat;\n                char buf[64] = {0};\n                int fd = 0;\n                int ret = 0;\n                char * nl = NULL;\n\n                uint16_t indexDepth = 0;\n                uint16_t indexIR = 0;\n                uint16_t indexRGB = 0;\n\n                for (int i = 0; i < 64; ++i)\n                {\n                    ss.str(\"\");\n                    ss << \"\/dev\/video\" << i;\n\n                    strTmpDev = ss.str();\n                    if (stat(strTmpDev.c_str(), &vstat) < 0 || !S_ISCHR(vstat.st_mode))\n                        break;\n\n                    ss.str(\"\");\n                    ss << \"\/sys\/class\/video4linux\/video\" << i << \"\/device\/interface\";\n                    strTmpInt = ss.str();\n\n                    fd = open(strTmpInt.c_str(), O_RDONLY);\n                    if (fd < 0)\n                        continue;\n\n                    ret = read(fd, buf, sizeof(buf));\n                    close(fd);\n                    if (ret < 0)\n                        continue;\n\n                    buf[63] = 0;\n\n                    nl = strchr(buf, '\\n');\n                    if (!nl)\n                        continue;\n\n                    *nl = '\\0';\n\n                    if (strncmp(buf, \"DS4\", 3) || strncmp(buf, \"Intel(R) RealSense(TM) 3D Camera (R200)\", 39) == 0)\n                    {\n                        devices.subdevices.push_back(make_subdevice(buf, indexDepth, indexIR, indexRGB));\n                    }\n                }\n            }\n            catch (...)\n            {\n                throw std::runtime_error(\"failed to enumerate list of devices\");\n            }\n\n            return devices;\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 \"base\/command_line.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, History) {\n  CommandLine::ForCurrentProcess()->AppendSwitch(\n      switches::kEnableExperimentalExtensionApis);\n\n  host_resolver()->AddRule(\"www.a.com\", \"127.0.0.1\");\n  host_resolver()->AddRule(\"www.b.com\", \"127.0.0.1\");\n  StartHTTPServer();\n\n  ASSERT_TRUE(RunExtensionTest(\"history\")) << message_;\n}\n<commit_msg>Disable flaky test.  See http:\/\/crbug.com\/26296 BUG=26296 TEST=none Review URL: http:\/\/codereview.chromium.org\/346021<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\/command_line.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\/\/ Flaky, http:\/\/crbug.com\/26296.\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, DISABLED_History) {\n  CommandLine::ForCurrentProcess()->AppendSwitch(\n      switches::kEnableExperimentalExtensionApis);\n\n  host_resolver()->AddRule(\"www.a.com\", \"127.0.0.1\");\n  host_resolver()->AddRule(\"www.b.com\", \"127.0.0.1\");\n  StartHTTPServer();\n\n  ASSERT_TRUE(RunExtensionTest(\"history\")) << message_;\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\/format_macros.h\"\n#include \"base\/string_util.h\"\n#include \"base\/stringprintf.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_edit.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_match.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_popup_model.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/search_engines\/template_url.h\"\n#include \"chrome\/browser\/search_engines\/template_url_service.h\"\n#include \"chrome\/browser\/search_engines\/template_url_service_factory.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/omnibox\/location_bar.h\"\n#include \"chrome\/browser\/ui\/omnibox\/omnibox_view.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/public\/browser\/notification_types.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n\n#if defined(TOOLKIT_GTK)\n#include \"chrome\/browser\/ui\/gtk\/browser_window_gtk.h\"\n#endif\n\nnamespace {\n\nstring16 AutocompleteResultAsString(const AutocompleteResult& result) {\n  std::string output(base::StringPrintf(\"{%\" PRIuS \"} \", result.size()));\n  for (size_t i = 0; i < result.size(); ++i) {\n    AutocompleteMatch match = result.match_at(i);\n    std::string provider_name = match.provider->name();\n    output.append(base::StringPrintf(\"[\\\"%s\\\" by \\\"%s\\\"] \",\n                                     UTF16ToUTF8(match.contents).c_str(),\n                                     provider_name.c_str()));\n  }\n  return UTF8ToUTF16(output);\n}\n\n}  \/\/ namespace\n\nclass OmniboxApiTest : public ExtensionApiTest {\n protected:\n  LocationBar* GetLocationBar(Browser* browser) const {\n    return browser->window()->GetLocationBar();\n  }\n\n  AutocompleteController* GetAutocompleteController(Browser* browser) const {\n    return GetLocationBar(browser)->location_entry()->model()->popup_model()->\n        autocomplete_controller();\n  }\n\n  void WaitForTemplateURLServiceToLoad() {\n    ui_test_utils::WindowedNotificationObserver loaded_observer(\n        chrome::NOTIFICATION_TEMPLATE_URL_SERVICE_LOADED,\n        content::NotificationService::AllSources());\n    TemplateURLService* model =\n        TemplateURLServiceFactory::GetForProfile(browser()->profile());\n    model->Load();\n    if (!model->loaded())\n      loaded_observer.Wait();\n  }\n\n  \/\/ TODO(phajdan.jr): Get rid of this wait-in-a-loop pattern.\n  void WaitForAutocompleteDone(AutocompleteController* controller) {\n    while (!controller->done()) {\n      ui_test_utils::WindowedNotificationObserver ready_observer(\n          chrome::NOTIFICATION_AUTOCOMPLETE_CONTROLLER_RESULT_READY,\n          content::Source<AutocompleteController>(controller));\n      ready_observer.Wait();\n    }\n  }\n};\n\nIN_PROC_BROWSER_TEST_F(OmniboxApiTest, Basic) {\n#if defined(TOOLKIT_GTK)\n  \/\/ Disable the timer because, on Lucid at least, it triggers resize\/move\n  \/\/ behavior in the browser window, which dismisses the autocomplete popup\n  \/\/ before the results can be read.\n  static_cast<BrowserWindowGtk*>(\n      browser()->window())->DisableDebounceTimerForTests(true);\n#endif\n\n  ASSERT_TRUE(RunExtensionTest(\"omnibox\")) << message_;\n\n  \/\/ The results depend on the TemplateURLService being loaded. Make sure it is\n  \/\/ loaded so that the autocomplete results are consistent.\n  WaitForTemplateURLServiceToLoad();\n\n  LocationBar* location_bar = GetLocationBar(browser());\n  AutocompleteController* autocomplete_controller =\n      GetAutocompleteController(browser());\n\n  \/\/ Test that our extension's keyword is suggested to us when we partially type\n  \/\/ it.\n  {\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keywor\"), string16(), true, false, true,\n        AutocompleteInput::ALL_MATCHES);\n\n    WaitForAutocompleteDone(autocomplete_controller);\n    EXPECT_TRUE(autocomplete_controller->done());\n    EXPECT_EQ(string16(), location_bar->GetInputString());\n    EXPECT_EQ(string16(), location_bar->location_entry()->GetText());\n    EXPECT_TRUE(location_bar->location_entry()->IsSelectAll());\n\n    \/\/ First result should be to search for what was typed, second should be to\n    \/\/ enter \"extension keyword\" mode.\n    const AutocompleteResult& result = autocomplete_controller->result();\n    ASSERT_EQ(2U, result.size()) << AutocompleteResultAsString(result);\n    AutocompleteMatch match = result.match_at(0);\n    EXPECT_EQ(AutocompleteMatch::SEARCH_WHAT_YOU_TYPED, match.type);\n    EXPECT_FALSE(match.deletable);\n\n    match = result.match_at(1);\n    ASSERT_TRUE(match.template_url);\n    EXPECT_TRUE(match.template_url->IsExtensionKeyword());\n    EXPECT_EQ(ASCIIToUTF16(\"keyword\"), match.template_url->keyword());\n  }\n\n  \/\/ Test that our extension can send suggestions back to us.\n  {\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keyword suggestio\"), string16(), true, false, true,\n        AutocompleteInput::ALL_MATCHES);\n\n    WaitForAutocompleteDone(autocomplete_controller);\n    EXPECT_TRUE(autocomplete_controller->done());\n\n    \/\/ First result should be to invoke the keyword with what we typed, 2-4\n    \/\/ should be to invoke with suggestions from the extension, and the last\n    \/\/ should be to search for what we typed.\n    const AutocompleteResult& result = autocomplete_controller->result();\n    ASSERT_EQ(5U, result.size()) << AutocompleteResultAsString(result);\n\n    ASSERT_TRUE(result.match_at(0).template_url);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestio\"),\n              result.match_at(0).fill_into_edit);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestion1\"),\n              result.match_at(1).fill_into_edit);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestion2\"),\n              result.match_at(2).fill_into_edit);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestion3\"),\n              result.match_at(3).fill_into_edit);\n\n    string16 description =\n        ASCIIToUTF16(\"Description with style: <match>, [dim], (url till end)\");\n    EXPECT_EQ(description, result.match_at(1).contents);\n    ASSERT_EQ(6u, result.match_at(1).contents_class.size());\n\n    EXPECT_EQ(0u,\n              result.match_at(1).contents_class[0].offset);\n    EXPECT_EQ(ACMatchClassification::NONE,\n              result.match_at(1).contents_class[0].style);\n\n    EXPECT_EQ(description.find('<'),\n              result.match_at(1).contents_class[1].offset);\n    EXPECT_EQ(ACMatchClassification::MATCH,\n              result.match_at(1).contents_class[1].style);\n\n    EXPECT_EQ(description.find('>') + 1u,\n              result.match_at(1).contents_class[2].offset);\n    EXPECT_EQ(ACMatchClassification::NONE,\n              result.match_at(1).contents_class[2].style);\n\n    EXPECT_EQ(description.find('['),\n              result.match_at(1).contents_class[3].offset);\n    EXPECT_EQ(ACMatchClassification::DIM,\n              result.match_at(1).contents_class[3].style);\n\n    EXPECT_EQ(description.find(']') + 1u,\n              result.match_at(1).contents_class[4].offset);\n    EXPECT_EQ(ACMatchClassification::NONE,\n              result.match_at(1).contents_class[4].style);\n\n    EXPECT_EQ(description.find('('),\n              result.match_at(1).contents_class[5].offset);\n    EXPECT_EQ(ACMatchClassification::URL,\n              result.match_at(1).contents_class[5].style);\n\n    AutocompleteMatch match = result.match_at(4);\n    EXPECT_EQ(AutocompleteMatch::SEARCH_WHAT_YOU_TYPED, match.type);\n    EXPECT_FALSE(match.deletable);\n  }\n\n  {\n    ResultCatcher catcher;\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keyword command\"), string16(), true, false, true,\n        AutocompleteInput::ALL_MATCHES);\n    location_bar->AcceptInput();\n    EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n  }\n}\n\n\/\/ Tests that the autocomplete popup doesn't reopen after accepting input for\n\/\/ a given query.\n\/\/ http:\/\/crbug.com\/88552\nIN_PROC_BROWSER_TEST_F(OmniboxApiTest, PopupStaysClosed) {\n#if defined(TOOLKIT_GTK)\n  \/\/ Disable the timer because, on Lucid at least, it triggers resize\/move\n  \/\/ behavior in the browser window, which dismisses the autocomplete popup\n  \/\/ before the results can be read.\n  static_cast<BrowserWindowGtk*>(\n    browser()->window())->DisableDebounceTimerForTests(true);\n#endif\n\n  ASSERT_TRUE(RunExtensionTest(\"omnibox\")) << message_;\n\n  \/\/ The results depend on the TemplateURLService being loaded. Make sure it is\n  \/\/ loaded so that the autocomplete results are consistent.\n  WaitForTemplateURLServiceToLoad();\n\n  LocationBar* location_bar = GetLocationBar(browser());\n  AutocompleteController* autocomplete_controller =\n      GetAutocompleteController(browser());\n  AutocompletePopupModel* popup_model =\n      GetLocationBar(browser())->location_entry()->model()->popup_model();\n\n  \/\/ Input a keyword query and wait for suggestions from the extension.\n  autocomplete_controller->Start(\n      ASCIIToUTF16(\"keyword comman\"), string16(), true, false, true,\n      AutocompleteInput::ALL_MATCHES);\n  WaitForAutocompleteDone(autocomplete_controller);\n  EXPECT_TRUE(autocomplete_controller->done());\n  EXPECT_TRUE(popup_model->IsOpen());\n\n  \/\/ Quickly type another query and accept it before getting suggestions back\n  \/\/ for the query. The popup will close after accepting input - ensure that it\n  \/\/ does not reopen when the extension returns its suggestions.\n  ResultCatcher catcher;\n  autocomplete_controller->Start(\n      ASCIIToUTF16(\"keyword command\"), string16(), true, false, true,\n      AutocompleteInput::ALL_MATCHES);\n  location_bar->AcceptInput();\n  WaitForAutocompleteDone(autocomplete_controller);\n  EXPECT_TRUE(autocomplete_controller->done());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n  EXPECT_FALSE(popup_model->IsOpen());\n}\n\n\/\/ Tests that we get suggestions from and send input to the incognito context\n\/\/ of an incognito split mode extension.\n\/\/ http:\/\/crbug.com\/100927\nIN_PROC_BROWSER_TEST_F(OmniboxApiTest, IncognitoSplitMode) {\n#if defined(TOOLKIT_GTK)\n  \/\/ Disable the timer because, on Lucid at least, it triggers resize\/move\n  \/\/ behavior in the browser window, which dismisses the autocomplete popup\n  \/\/ before the results can be read.\n  static_cast<BrowserWindowGtk*>(\n    browser()->window())->DisableDebounceTimerForTests(true);\n#endif\n\n  ResultCatcher catcher_incognito;\n  catcher_incognito.RestrictToProfile(\n      browser()->profile()->GetOffTheRecordProfile());\n\n  ASSERT_TRUE(RunExtensionTestIncognito(\"omnibox\")) << message_;\n\n  \/\/ Open an incognito window and wait for the incognito extension process to\n  \/\/ respond.\n  Browser* incognito_browser = CreateIncognitoBrowser();\n  ASSERT_TRUE(catcher_incognito.GetNextResult()) << catcher_incognito.message();\n\n  \/\/ The results depend on the TemplateURLService being loaded. Make sure it is\n  \/\/ loaded so that the autocomplete results are consistent.\n  WaitForTemplateURLServiceToLoad();\n\n  LocationBar* location_bar = GetLocationBar(incognito_browser);\n  AutocompleteController* autocomplete_controller =\n      GetAutocompleteController(incognito_browser);\n\n  \/\/ Test that we get the incognito-specific suggestions.\n  {\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keyword suggestio\"), string16(), true, false, true,\n        AutocompleteInput::ALL_MATCHES);\n\n    WaitForAutocompleteDone(autocomplete_controller);\n    EXPECT_TRUE(autocomplete_controller->done());\n\n    \/\/ First result should be to invoke the keyword with what we typed, 2-4\n    \/\/ should be to invoke with suggestions from the extension, and the last\n    \/\/ should be to search for what we typed.\n    const AutocompleteResult& result = autocomplete_controller->result();\n    ASSERT_EQ(5U, result.size()) << AutocompleteResultAsString(result);\n    ASSERT_TRUE(result.match_at(0).template_url);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestion3 incognito\"),\n              result.match_at(3).fill_into_edit);\n  }\n\n  \/\/ Test that our input is sent to the incognito context. The test will do a\n  \/\/ text comparison and succeed only if \"command incognito\" is sent to the\n  \/\/ incognito context.\n  {\n    ResultCatcher catcher;\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keyword command incognito\"), string16(),\n        true, false, true, AutocompleteInput::ALL_MATCHES);\n    location_bar->AcceptInput();\n    EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n  }\n}\n<commit_msg>Disable OmniboxApiTest.IncognitoSplitMode. It fails flakily on Linux.<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\/format_macros.h\"\n#include \"base\/string_util.h\"\n#include \"base\/stringprintf.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_edit.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_match.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_popup_model.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/search_engines\/template_url.h\"\n#include \"chrome\/browser\/search_engines\/template_url_service.h\"\n#include \"chrome\/browser\/search_engines\/template_url_service_factory.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/omnibox\/location_bar.h\"\n#include \"chrome\/browser\/ui\/omnibox\/omnibox_view.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/public\/browser\/notification_types.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n\n#if defined(TOOLKIT_GTK)\n#include \"chrome\/browser\/ui\/gtk\/browser_window_gtk.h\"\n#endif\n\nnamespace {\n\nstring16 AutocompleteResultAsString(const AutocompleteResult& result) {\n  std::string output(base::StringPrintf(\"{%\" PRIuS \"} \", result.size()));\n  for (size_t i = 0; i < result.size(); ++i) {\n    AutocompleteMatch match = result.match_at(i);\n    std::string provider_name = match.provider->name();\n    output.append(base::StringPrintf(\"[\\\"%s\\\" by \\\"%s\\\"] \",\n                                     UTF16ToUTF8(match.contents).c_str(),\n                                     provider_name.c_str()));\n  }\n  return UTF8ToUTF16(output);\n}\n\n}  \/\/ namespace\n\nclass OmniboxApiTest : public ExtensionApiTest {\n protected:\n  LocationBar* GetLocationBar(Browser* browser) const {\n    return browser->window()->GetLocationBar();\n  }\n\n  AutocompleteController* GetAutocompleteController(Browser* browser) const {\n    return GetLocationBar(browser)->location_entry()->model()->popup_model()->\n        autocomplete_controller();\n  }\n\n  void WaitForTemplateURLServiceToLoad() {\n    ui_test_utils::WindowedNotificationObserver loaded_observer(\n        chrome::NOTIFICATION_TEMPLATE_URL_SERVICE_LOADED,\n        content::NotificationService::AllSources());\n    TemplateURLService* model =\n        TemplateURLServiceFactory::GetForProfile(browser()->profile());\n    model->Load();\n    if (!model->loaded())\n      loaded_observer.Wait();\n  }\n\n  \/\/ TODO(phajdan.jr): Get rid of this wait-in-a-loop pattern.\n  void WaitForAutocompleteDone(AutocompleteController* controller) {\n    while (!controller->done()) {\n      ui_test_utils::WindowedNotificationObserver ready_observer(\n          chrome::NOTIFICATION_AUTOCOMPLETE_CONTROLLER_RESULT_READY,\n          content::Source<AutocompleteController>(controller));\n      ready_observer.Wait();\n    }\n  }\n};\n\nIN_PROC_BROWSER_TEST_F(OmniboxApiTest, Basic) {\n#if defined(TOOLKIT_GTK)\n  \/\/ Disable the timer because, on Lucid at least, it triggers resize\/move\n  \/\/ behavior in the browser window, which dismisses the autocomplete popup\n  \/\/ before the results can be read.\n  static_cast<BrowserWindowGtk*>(\n      browser()->window())->DisableDebounceTimerForTests(true);\n#endif\n\n  ASSERT_TRUE(RunExtensionTest(\"omnibox\")) << message_;\n\n  \/\/ The results depend on the TemplateURLService being loaded. Make sure it is\n  \/\/ loaded so that the autocomplete results are consistent.\n  WaitForTemplateURLServiceToLoad();\n\n  LocationBar* location_bar = GetLocationBar(browser());\n  AutocompleteController* autocomplete_controller =\n      GetAutocompleteController(browser());\n\n  \/\/ Test that our extension's keyword is suggested to us when we partially type\n  \/\/ it.\n  {\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keywor\"), string16(), true, false, true,\n        AutocompleteInput::ALL_MATCHES);\n\n    WaitForAutocompleteDone(autocomplete_controller);\n    EXPECT_TRUE(autocomplete_controller->done());\n    EXPECT_EQ(string16(), location_bar->GetInputString());\n    EXPECT_EQ(string16(), location_bar->location_entry()->GetText());\n    EXPECT_TRUE(location_bar->location_entry()->IsSelectAll());\n\n    \/\/ First result should be to search for what was typed, second should be to\n    \/\/ enter \"extension keyword\" mode.\n    const AutocompleteResult& result = autocomplete_controller->result();\n    ASSERT_EQ(2U, result.size()) << AutocompleteResultAsString(result);\n    AutocompleteMatch match = result.match_at(0);\n    EXPECT_EQ(AutocompleteMatch::SEARCH_WHAT_YOU_TYPED, match.type);\n    EXPECT_FALSE(match.deletable);\n\n    match = result.match_at(1);\n    ASSERT_TRUE(match.template_url);\n    EXPECT_TRUE(match.template_url->IsExtensionKeyword());\n    EXPECT_EQ(ASCIIToUTF16(\"keyword\"), match.template_url->keyword());\n  }\n\n  \/\/ Test that our extension can send suggestions back to us.\n  {\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keyword suggestio\"), string16(), true, false, true,\n        AutocompleteInput::ALL_MATCHES);\n\n    WaitForAutocompleteDone(autocomplete_controller);\n    EXPECT_TRUE(autocomplete_controller->done());\n\n    \/\/ First result should be to invoke the keyword with what we typed, 2-4\n    \/\/ should be to invoke with suggestions from the extension, and the last\n    \/\/ should be to search for what we typed.\n    const AutocompleteResult& result = autocomplete_controller->result();\n    ASSERT_EQ(5U, result.size()) << AutocompleteResultAsString(result);\n\n    ASSERT_TRUE(result.match_at(0).template_url);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestio\"),\n              result.match_at(0).fill_into_edit);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestion1\"),\n              result.match_at(1).fill_into_edit);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestion2\"),\n              result.match_at(2).fill_into_edit);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestion3\"),\n              result.match_at(3).fill_into_edit);\n\n    string16 description =\n        ASCIIToUTF16(\"Description with style: <match>, [dim], (url till end)\");\n    EXPECT_EQ(description, result.match_at(1).contents);\n    ASSERT_EQ(6u, result.match_at(1).contents_class.size());\n\n    EXPECT_EQ(0u,\n              result.match_at(1).contents_class[0].offset);\n    EXPECT_EQ(ACMatchClassification::NONE,\n              result.match_at(1).contents_class[0].style);\n\n    EXPECT_EQ(description.find('<'),\n              result.match_at(1).contents_class[1].offset);\n    EXPECT_EQ(ACMatchClassification::MATCH,\n              result.match_at(1).contents_class[1].style);\n\n    EXPECT_EQ(description.find('>') + 1u,\n              result.match_at(1).contents_class[2].offset);\n    EXPECT_EQ(ACMatchClassification::NONE,\n              result.match_at(1).contents_class[2].style);\n\n    EXPECT_EQ(description.find('['),\n              result.match_at(1).contents_class[3].offset);\n    EXPECT_EQ(ACMatchClassification::DIM,\n              result.match_at(1).contents_class[3].style);\n\n    EXPECT_EQ(description.find(']') + 1u,\n              result.match_at(1).contents_class[4].offset);\n    EXPECT_EQ(ACMatchClassification::NONE,\n              result.match_at(1).contents_class[4].style);\n\n    EXPECT_EQ(description.find('('),\n              result.match_at(1).contents_class[5].offset);\n    EXPECT_EQ(ACMatchClassification::URL,\n              result.match_at(1).contents_class[5].style);\n\n    AutocompleteMatch match = result.match_at(4);\n    EXPECT_EQ(AutocompleteMatch::SEARCH_WHAT_YOU_TYPED, match.type);\n    EXPECT_FALSE(match.deletable);\n  }\n\n  {\n    ResultCatcher catcher;\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keyword command\"), string16(), true, false, true,\n        AutocompleteInput::ALL_MATCHES);\n    location_bar->AcceptInput();\n    EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n  }\n}\n\n\/\/ Tests that the autocomplete popup doesn't reopen after accepting input for\n\/\/ a given query.\n\/\/ http:\/\/crbug.com\/88552\nIN_PROC_BROWSER_TEST_F(OmniboxApiTest, PopupStaysClosed) {\n#if defined(TOOLKIT_GTK)\n  \/\/ Disable the timer because, on Lucid at least, it triggers resize\/move\n  \/\/ behavior in the browser window, which dismisses the autocomplete popup\n  \/\/ before the results can be read.\n  static_cast<BrowserWindowGtk*>(\n    browser()->window())->DisableDebounceTimerForTests(true);\n#endif\n\n  ASSERT_TRUE(RunExtensionTest(\"omnibox\")) << message_;\n\n  \/\/ The results depend on the TemplateURLService being loaded. Make sure it is\n  \/\/ loaded so that the autocomplete results are consistent.\n  WaitForTemplateURLServiceToLoad();\n\n  LocationBar* location_bar = GetLocationBar(browser());\n  AutocompleteController* autocomplete_controller =\n      GetAutocompleteController(browser());\n  AutocompletePopupModel* popup_model =\n      GetLocationBar(browser())->location_entry()->model()->popup_model();\n\n  \/\/ Input a keyword query and wait for suggestions from the extension.\n  autocomplete_controller->Start(\n      ASCIIToUTF16(\"keyword comman\"), string16(), true, false, true,\n      AutocompleteInput::ALL_MATCHES);\n  WaitForAutocompleteDone(autocomplete_controller);\n  EXPECT_TRUE(autocomplete_controller->done());\n  EXPECT_TRUE(popup_model->IsOpen());\n\n  \/\/ Quickly type another query and accept it before getting suggestions back\n  \/\/ for the query. The popup will close after accepting input - ensure that it\n  \/\/ does not reopen when the extension returns its suggestions.\n  ResultCatcher catcher;\n  autocomplete_controller->Start(\n      ASCIIToUTF16(\"keyword command\"), string16(), true, false, true,\n      AutocompleteInput::ALL_MATCHES);\n  location_bar->AcceptInput();\n  WaitForAutocompleteDone(autocomplete_controller);\n  EXPECT_TRUE(autocomplete_controller->done());\n  EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n  EXPECT_FALSE(popup_model->IsOpen());\n}\n\n\/\/ Tests that we get suggestions from and send input to the incognito context\n\/\/ of an incognito split mode extension.\n\/\/ http:\/\/crbug.com\/100927\n\/\/ Test flaky on linux: http:\/\/crbug.com\/101219\nIN_PROC_BROWSER_TEST_F(OmniboxApiTest, DISABLED_IncognitoSplitMode) {\n#if defined(TOOLKIT_GTK)\n  \/\/ Disable the timer because, on Lucid at least, it triggers resize\/move\n  \/\/ behavior in the browser window, which dismisses the autocomplete popup\n  \/\/ before the results can be read.\n  static_cast<BrowserWindowGtk*>(\n    browser()->window())->DisableDebounceTimerForTests(true);\n#endif\n\n  ResultCatcher catcher_incognito;\n  catcher_incognito.RestrictToProfile(\n      browser()->profile()->GetOffTheRecordProfile());\n\n  ASSERT_TRUE(RunExtensionTestIncognito(\"omnibox\")) << message_;\n\n  \/\/ Open an incognito window and wait for the incognito extension process to\n  \/\/ respond.\n  Browser* incognito_browser = CreateIncognitoBrowser();\n  ASSERT_TRUE(catcher_incognito.GetNextResult()) << catcher_incognito.message();\n\n  \/\/ The results depend on the TemplateURLService being loaded. Make sure it is\n  \/\/ loaded so that the autocomplete results are consistent.\n  WaitForTemplateURLServiceToLoad();\n\n  LocationBar* location_bar = GetLocationBar(incognito_browser);\n  AutocompleteController* autocomplete_controller =\n      GetAutocompleteController(incognito_browser);\n\n  \/\/ Test that we get the incognito-specific suggestions.\n  {\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keyword suggestio\"), string16(), true, false, true,\n        AutocompleteInput::ALL_MATCHES);\n\n    WaitForAutocompleteDone(autocomplete_controller);\n    EXPECT_TRUE(autocomplete_controller->done());\n\n    \/\/ First result should be to invoke the keyword with what we typed, 2-4\n    \/\/ should be to invoke with suggestions from the extension, and the last\n    \/\/ should be to search for what we typed.\n    const AutocompleteResult& result = autocomplete_controller->result();\n    ASSERT_EQ(5U, result.size()) << AutocompleteResultAsString(result);\n    ASSERT_TRUE(result.match_at(0).template_url);\n    EXPECT_EQ(ASCIIToUTF16(\"keyword suggestion3 incognito\"),\n              result.match_at(3).fill_into_edit);\n  }\n\n  \/\/ Test that our input is sent to the incognito context. The test will do a\n  \/\/ text comparison and succeed only if \"command incognito\" is sent to the\n  \/\/ incognito context.\n  {\n    ResultCatcher catcher;\n    autocomplete_controller->Start(\n        ASCIIToUTF16(\"keyword command incognito\"), string16(),\n        true, false, true, AutocompleteInput::ALL_MATCHES);\n    location_bar->AcceptInput();\n    EXPECT_TRUE(catcher.GetNextResult()) << catcher.message();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2016 Hannes Hochreiner\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#include \"..\/..\/src\/rfm69w.h\"\n#include <wiringPiSPI.h>\n#include <iostream>\n\nint spiTransfer(unsigned char* const bytes, unsigned int length, void* const customData) {\n  return wiringPiSPIDataRW(0, bytes, length);\n}\n\nint main() {\n  int res = wiringPiSPISetup(0, 500000);\n\n  if (res == -1) {\n    std::cerr << \"Error setting up SPI interface\\n\";\n    return -1;\n  }\n\n  RFM_MODE m = RFM_MODE_SLEEP;\n\n  res = setMode(&m, spiTransfer);\n\n  if (res == -1) {\n    std::cerr << \"Error transferring data\\n\";\n    return -1;\n  }\n\n  m = (RFM_MODE)0;\n\n  res = getMode(&m, spiTransfer);\n\n  if (res == -1) {\n    std::cerr << \"Error transferring data\\n\";\n    return -1;\n  }\n\n  if (m == RFM_MODE_SLEEP) {\n    std::cout << \"...sleeping...\\n\";\n  } else {\n    std::cout << \"...doing other stuff..\\n\";\n  }\n\n  return 0;\n}\n<commit_msg>Updated base example.<commit_after>\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2016 Hannes Hochreiner\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#include \"..\/..\/src\/rfm69w.h\"\n#include <wiringPiSPI.h>\n#include <iostream>\n\nint spiTransfer(unsigned char* const bytes, unsigned int length, void* const customData) {\n  return wiringPiSPIDataRW(0, bytes, length);\n}\n\nint main() {\n  int res = wiringPiSPISetup(0, 500000);\n\n  if (res == -1) {\n    std::cerr << \"Error setting up SPI interface\\n\";\n    return -1;\n  }\n\n  RFM_MODE m = RFM_MODE_SLEEP;\n\n  res = setMode(&m, spiTransfer);\n\n  if (res == -1) {\n    std::cerr << \"Error transferring data\\n\";\n    return -1;\n  }\n\n  m = (RFM_MODE)0;\n\n  res = getMode(&m, spiTransfer);\n\n  if (res == -1) {\n    std::cerr << \"Error transferring data\\n\";\n    return -1;\n  }\n\n  if (m == RFM_MODE_SLEEP) {\n    std::cout << \"...sleeping...\\n\";\n  } else {\n    std::cout << \"...doing other stuff..\\n\";\n  }\n\n  float cf;\n\n  res = getCarrierFrequency(&cf, spiTransfer);\n\n  if (res == -1) {\n    std::cerr << \"Error setting carrier frequency\\n\";\n    return -1;\n  }\n\n  std::cout << \"carrier frequency: \" << cf << \"\\n\";\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n\n#include <nwg.h>\n#include <nwg_basicprotocolcodec.h>\n\n#define BUFFSIZE 32768\n#define MAX_CLIENT 5\n\nclass EchoHandler : public Nwg::Handler\n{\n    void sessionOpened(Nwg::Session &session)\n    {\n        const int num_client = ++session.getServer().get<int>(\"num_client\");\n        const int last_id = ++session.getServer().get<int>(\"last_id\");\n        int &client_id = *new int(last_id);\n\n        printf(\"client #%d connected!\\n\", client_id);\n        printf(\"num_client: %d\\n\", num_client);\n\n        session.put<int>(\"msg_received\", std::make_shared<int>(1));\n        session.put<int>(\"client_id\", &client_id);\n\n        Nwg::ByteBuffer &out = *new Nwg::ByteBuffer(BUFFSIZE);\n\n        if (num_client > MAX_CLIENT) {\n            out.put(\"Client limit exceeded!\\n\");\n            out.flip();\n\n            session.write(&out);\n            return;\n        }\n\n        out.put(\"Just type anything. Send key ^] to exit from telnet.\\n\");\n        out.put(\"1. << \");\n        out.flip();\n\n        session.write(&out);\n    }\n\n    void sessionClosed(Nwg::Session &session)\n    {\n        const int num_client = --session.getServer().get<int>(\"num_client\");\n        const int client_id = session.get<int>(\"client_id\");\n        const int msg_received = --session.get<int>(\"msg_received\");\n\n        printf(\"client #%d disconnected! # of message received: %d\\n\", client_id, msg_received);\n        printf(\"num_client: %d\\n\", num_client);\n    }\n\n    void messageReceived(Nwg::Session &session, Nwg::Object &obj)\n    {\n        Nwg::ByteBuffer &msg = dynamic_cast<Nwg::ByteBuffer &>(obj);\n\n        const int client_id = session.get<int>(\"client_id\");\n        int &msg_received = session.get<int>(\"msg_received\");\n\n        printf(\"client #%d >> %s\\n\", client_id, msg.sreadUntil('\\n').c_str());\n        msg.jump(0);\n\n        Nwg::ByteBuffer &out = *new Nwg::ByteBuffer(BUFFSIZE);\n        out.put(std::to_string(msg_received) + \". >> \");\n        out.put(msg.read(msg.remaining()));\n        out.put(\"\\n\" + std::to_string(msg_received + 1) + \". << \");\n        out.flip();\n\n        session.write(&out);\n\n        msg_received++;\n    }\n\n    void messageSent(Nwg::Session &session, Nwg::Object &obj)\n    {\n        const int num_client = session.getServer().get<int>(\"num_client\");\n\n        if (num_client > MAX_CLIENT) {\n            session.close();\n        }\n    }\n};\n\nvoid run()\n{\n    Nwg::Server server(8845);\n    server.setBuffSize(BUFFSIZE);\n\n    server.setProtocolCodec(new Nwg::BasicProtocolCodec());\n    server.setHandler(new EchoHandler());\n\n    server.put<int>(\"last_id\", std::make_shared<int>(0));\n    server.put<int>(\"num_client\", std::make_shared<int>(0));\n\n    printf(\"Listening on port %d\\n\", server.getPort());\n    server.run();\n}\n\nint main()\n{\n    run();\n    return 0;\n}\n<commit_msg>Update example (echoserver)<commit_after>#include <cstdio>\n\n#include <nwg.h>\n#include <nwg_basicprotocolcodec.h>\n\n#define BUFFSIZE 32768\n#define MAX_CLIENT 5\n\nstatic int numClient = 0;\nstatic int lastId = 0;\n\nclass EchoHandler : public Nwg::Handler\n{\n    void sessionOpened(Nwg::Session &session)\n    {\n        numClient++;\n        lastId++;\n\n        int &clientId = *new int(lastId);\n\n        printf(\"client #%d connected!\\n\", clientId);\n        printf(\"num_client: %d\\n\", numClient);\n\n        session.put<int>(\"msg_received\", std::make_shared<int>(1));\n        session.put<int>(\"client_id\", &clientId);\n\n        Nwg::ByteBuffer &out = *new Nwg::ByteBuffer(BUFFSIZE);\n\n        if (numClient > MAX_CLIENT) {\n            out.put(\"Client limit exceeded!\\n\");\n            out.flip();\n\n            session.write(&out);\n            return;\n        }\n\n        out.put(\"Just type anything. Send key ^] to exit from telnet.\\n\");\n        out.put(\"1. << \");\n        out.flip();\n\n        session.write(&out);\n    }\n\n    void sessionClosed(Nwg::Session &session)\n    {\n        --numClient;\n\n        int clientId = session.get<int>(\"client_id\");\n        int msgReceived = --session.get<int>(\"msg_received\");\n\n        printf(\"client #%d disconnected! # of message received: %d\\n\", clientId, msgReceived);\n        printf(\"num_client: %d\\n\", numClient);\n    }\n\n    void messageReceived(Nwg::Session &session, Nwg::Object &obj)\n    {\n        Nwg::ByteBuffer &msg = dynamic_cast<Nwg::ByteBuffer &>(obj);\n\n        int clientId = session.get<int>(\"client_id\");\n        int &msgReceived = session.get<int>(\"msg_received\");\n\n        printf(\"client #%d >> %s\\n\", clientId, msg.sreadUntil('\\n').c_str());\n        msg.jump(0);\n\n        Nwg::ByteBuffer &out = *new Nwg::ByteBuffer(BUFFSIZE);\n        out.put(std::to_string(msgReceived) + \". >> \");\n        out.put(msg.read(msg.remaining()));\n        out.put(\"\\n\" + std::to_string(msgReceived + 1) + \". << \");\n        out.flip();\n\n        session.write(&out);\n\n        msgReceived++;\n    }\n\n    void messageSent(Nwg::Session &session, Nwg::Object &obj)\n    {\n        if (numClient > MAX_CLIENT) {\n            session.close();\n        }\n    }\n};\n\nvoid run()\n{\n    Nwg::Server server(8845);\n    server.setBuffSize(BUFFSIZE);\n\n    server.setProtocolCodec(new Nwg::BasicProtocolCodec());\n    server.setHandler(new EchoHandler());\n\n    printf(\"Listening on port %d\\n\", server.getPort());\n    server.run();\n}\n\nint main()\n{\n    run();\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 12\/22\/2018, 9:09:29 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 N;\nll A[200010];\nll X[200010];\nll Y[200010];\nll imos_X[200010];\nll imos_Y[200010];\nll imos_imos_X[200010];\nll imos_imos_Y[200010];\n\nll calc(ll x, ll y)\n{\n  ll res = 0;\n  ll mult = 1;\n  while (x > y * mult)\n  {\n    res += 2;\n    mult *= 4;\n  }\n  return res;\n}\n\nint main()\n{\n  cin >> N;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n  }\n  X[0] = 0;\n  for (auto i = 1; i < N; i++)\n  {\n    X[i] = calc(A[i - 1], A[i]);\n  }\n  imos_X[0] = 0;\n  for (auto i = 1; i < N; i++)\n  {\n    imos_X[i] = X[i] + imos_X[i - 1];\n  }\n  imos_imos_X[0] = 0;\n  for (auto i = 0; i < N; i++)\n  {\n    imos_imos_X[i] = imos_X[i] + imos_imos_X[i - 1];\n  }\n  Y[N - 1] = 0;\n  for (auto i = N - 2; i >= 0; i--)\n  {\n    Y[i] = calc(A[i], A[i - 1]);\n  }\n  imos_Y[N - 1] = 0;\n  for (auto i = N - 2; i >= 0; i--)\n  {\n    imos_Y[i] = Y[i] + imos_Y[i + 1];\n  }\n  imos_imos_Y[N - 1] = 0;\n  for (auto i = N - 2; i >= 0; i--)\n  {\n    imos_imos_Y[i] = imos_Y[i] + imos_imos_Y[i + 1];\n  }\n  ll ans = 1000000000000000;\n  for (auto i = 0; i < N; i++)\n  {\n    ll t = i + imos_imos_X[N - 1] - imos_imos_X[i] + imos_imos_Y[0] - imos_imos_Y[i];\n    ans = min(t, ans);\n  }\n  cout << ans << endl;\n}<commit_msg>tried E.cpp to 'E'<commit_after>\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 12\/22\/2018, 9:09:29 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 N;\nll A[200010];\nll X[200010];\nll Y[200010];\nll imos_X[200010];\nll imos_Y[200010];\nll imos_imos_X[200010];\nll imos_imos_Y[200010];\n\nll calc(ll x, ll y)\n{\n  ll res = 0;\n  ll mult = 1;\n  while (x > y * mult)\n  {\n    res += 2;\n    mult *= 4;\n  }\n  return res;\n}\n\nint main()\n{\n  cin >> N;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n  }\n  X[0] = 0;\n  for (auto i = 1; i < N; i++)\n  {\n    X[i] = calc(A[i - 1], A[i]);\n  }\n  imos_X[0] = 0;\n  for (auto i = 1; i < N; i++)\n  {\n    imos_X[i] = X[i] + imos_X[i - 1];\n  }\n  imos_imos_X[0] = 0;\n  for (auto i = 0; i < N; i++)\n  {\n    imos_imos_X[i] = imos_X[i] + imos_imos_X[i - 1];\n  }\n  Y[N - 1] = 0;\n  for (auto i = N - 2; i >= 0; i--)\n  {\n    Y[i] = calc(A[i + 1], A[i]);\n  }\n  imos_Y[N - 1] = 0;\n  for (auto i = N - 2; i >= 0; i--)\n  {\n    imos_Y[i] = Y[i] + imos_Y[i + 1];\n  }\n  imos_imos_Y[N - 1] = 0;\n  for (auto i = N - 2; i >= 0; i--)\n  {\n    imos_imos_Y[i] = imos_Y[i] + imos_imos_Y[i + 1];\n  }\n  ll ans = 1000000000000000;\n  for (auto i = 0; i < N; i++)\n  {\n    ll t = i + imos_imos_X[N - 1] - imos_imos_X[i] + imos_imos_Y[0] - imos_imos_Y[i];\n    ans = min(t, ans);\n  }\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>\/*!\n    \\file memory_appender.cpp\n    \\brief Logging memory appender implementation\n    \\author Ivan Shynkarenka\n    \\date 26.07.2016\n    \\copyright MIT License\n*\/\n\n#include \"logging\/appenders\/memory_appender.h\"\n\n#include <cstdio>\n\nnamespace CppLogging {\n\nvoid MemoryAppender::AppendRecord(Record& record)\n{\n    \/\/ Skip logging records without layout\n    if (record.raw.first == nullptr)\n        return;\n\n    \/\/ Resize the buffer to required size\n    _buffer.resize(record.raw.second);\n\n    \/\/ Get the buffer start position\n    uint8_t* buffer = _buffer.data();\n\n    \/\/ Copy logging record content into the allocated memory buffer\n    std::memcpy(buffer, record.raw.first, record.raw.second);\n}\n\n} \/\/ namespace CppLogging\n<commit_msg>Bugfixing<commit_after>\/*!\n    \\file memory_appender.cpp\n    \\brief Logging memory appender implementation\n    \\author Ivan Shynkarenka\n    \\date 26.07.2016\n    \\copyright MIT License\n*\/\n\n#include \"logging\/appenders\/memory_appender.h\"\n\n#include <cstring>\n\nnamespace CppLogging {\n\nvoid MemoryAppender::AppendRecord(Record& record)\n{\n    \/\/ Skip logging records without layout\n    if (record.raw.first == nullptr)\n        return;\n\n    \/\/ Resize the buffer to required size\n    _buffer.resize(record.raw.second);\n\n    \/\/ Get the buffer start position\n    uint8_t* buffer = _buffer.data();\n\n    \/\/ Copy logging record content into the allocated memory buffer\n    std::memcpy(buffer, record.raw.first, record.raw.second);\n}\n\n} \/\/ namespace CppLogging\n<|endoftext|>"}
{"text":"<commit_before>#include \"WaveOut.h\"\r\n\r\n#include <boost\/bind.hpp>\r\n\r\nWaveOut::WaveOut(void) :\r\n\tm_waveHandle(NULL),\r\n\tm_pCallback(NULL),\r\n    audioThread(NULL),\r\n\tm_dwSamplesOut(0),\r\n\tm_LastPlayedBuffer(-1),\r\n\tm_NumBuffers(8) \/\/TODO: config\r\n{\r\n\tZeroMemory(&m_waveFormatPCMEx, sizeof(m_waveFormatPCMEx));\r\n\r\n\tQueryPerformanceFrequency(&m_liCountsPerSecond);\r\n\r\n\tm_pfAudioBuffer = NULL;\r\n}\r\n\r\nWaveOut::~WaveOut(void)\r\n{\r\n\tShutdown();\r\n}\r\n\r\nvoid WaveOut::Destroy()\r\n{\r\n    delete this;\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/\tActual Audio Output Stuff!\r\n\/\/\r\n\/\/\r\n\r\nvoid CALLBACK WaveOut::WaveCallback(HWAVEOUT hWave, UINT uMsg, DWORD_PTR dwUser, DWORD_PTR dw1, DWORD dw2)\r\n{\r\n    if(uMsg == WOM_DONE) \r\n\t{\r\n\t\tWaveOut*\tto\t\t\t= (WaveOut *)dwUser;\r\n\t\tLPWAVEHDR\twhr\t\t\t\t\t= (LPWAVEHDR)dw1;\r\n\r\n\t\tto->m_dwSamplesOut\t\t+= (whr->dwBufferLength \/ to->m_waveFormatPCMEx.Format.nBlockAlign);\r\n\t\tto->m_LastPlayedBuffer\t= (unsigned long)whr->dwUser;\r\n\r\n\t\tQueryPerformanceCounter(&to->m_liLastPerformanceCount);\r\n\r\n        to->audioCondition.notify_one();\r\n   }\r\n}\r\n\r\nbool WaveOut::Open(void)\r\n{\r\n\tint r;\r\n\tint currentDevice = this->GetOutputDevice();\r\n\r\n    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\tif(m_waveHandle==NULL)\r\n\t{\r\n\t\tr = waveOutOpen(&m_waveHandle, currentDevice, (WAVEFORMATEX*)&m_waveFormatPCMEx, (DWORD_PTR)WaveCallback, (DWORD_PTR)this, CALLBACK_FUNCTION);\r\n\t\tif(r != MMSYSERR_NOERROR) \r\n\t\t{\r\n\t\t\treturn(false);\r\n\t\t}\r\n\r\n\t\tm_Buffers = (WAVEHDR *)VirtualAlloc(NULL, m_NumBuffers * sizeof(WAVEHDR), MEM_COMMIT, PAGE_READWRITE);\r\n\/\/        m_dwBufferSize = m_BlockSize * m_NumBuffers;\r\n        \r\n        unsigned int bytesPerSample = m_waveFormatPCMEx.Format.nChannels*m_waveFormatPCMEx.Format.wBitsPerSample\/16;\r\n\r\n        m_dwBufferSize = m_BlockSize*bytesPerSample;\r\n\r\n\t\tm_pfAudioBuffer = (float *)VirtualAlloc(NULL, m_dwBufferSize * m_NumBuffers, MEM_COMMIT, PAGE_READWRITE);\t\t\/\/ allocate audio memory\r\n\t\tVirtualLock(m_pfAudioBuffer, m_dwBufferSize * m_NumBuffers);\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ lock the audio memory into physical memory\r\n\r\n\t\tfor(unsigned long x=0; x<m_NumBuffers; x++)\r\n\t\t{\r\n\/\/            m_Buffers[x].dwBufferLength\t\t= m_BlockSize * m_NumBuffers;\r\n            m_Buffers[x].dwBufferLength\t\t= m_BlockSize*bytesPerSample;\r\n\t\t\tm_Buffers[x].lpData\t\t\t\t= (LPSTR)&m_pfAudioBuffer[x * m_BlockSize];\r\n \t\t\tm_Buffers[x].dwUser\t\t\t\t= x;\r\n\t\t\tm_Buffers[x].dwBytesRecorded\t= 0;\r\n\t\t\tm_Buffers[x].dwFlags\t\t\t= 0;\r\n\t\t\tm_Buffers[x].dwLoops\t\t\t= 0;\r\n\r\n\t\t\twaveOutPrepareHeader(m_waveHandle, &m_Buffers[x], sizeof(WAVEHDR));\r\n            m_Buffers[x].dwFlags\t\t\t|= WHDR_DONE;\r\n\t\t}\r\n\r\n\t\tQueryPerformanceCounter(&m_liLastPerformanceCount);\r\n\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool WaveOut::Close(void)\r\n{\r\n\tint r;\r\n\r\n    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\tif(m_waveHandle)\r\n\t{\r\n\t\tm_Playing = false;\r\n\r\nagain:\r\n\t\tif(waveOutReset(m_waveHandle) == MMSYSERR_NOERROR)\r\n\t\t{\r\n\t\t\tfor(unsigned long x=0; x<m_NumBuffers; x++)\r\n\t\t\t{\r\n\t\t\t\tif(m_Buffers[x].dwFlags & WHDR_PREPARED)\r\n\t\t\t\t\twaveOutUnprepareHeader(m_waveHandle, &m_Buffers[x], sizeof(WAVEHDR));\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\twhile((r = waveOutClose(m_waveHandle)) != MMSYSERR_NOERROR)\r\n\t\t{\r\n\t\t\tgoto again;\r\n\t\t}\r\n\r\n\t\tm_waveHandle = NULL;\r\n\r\n\t\tVirtualUnlock(m_pfAudioBuffer, m_dwBufferSize * m_NumBuffers);\r\n\t\tVirtualFree(m_pfAudioBuffer, 0, MEM_RELEASE);\r\n\t\tm_pfAudioBuffer = NULL;\r\n\r\n\t\tVirtualFree(m_Buffers, 0, MEM_RELEASE);\r\n\t\tm_Buffers = NULL;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/\r\n\r\nunsigned long WaveOut::ThreadProc(void)\r\n{\r\n    bool hasPlayed = false;\r\n\r\n\twhile(m_bThreadRun && !hasPlayed)\r\n\t{\r\n\t\twhile(m_Playing && this->m_pCallback)\r\n\t\t{\r\n\t\t\tboost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n            while(this->m_Buffers && m_Playing && ((m_Buffers[m_ActiveBuffer].dwFlags&WHDR_DONE)==0) )\r\n\t\t\t{\r\n                this->audioCondition.wait(lock);\r\n\t\t\t}\r\n\r\n\t\t\tif(m_Playing)\r\n\t\t\t{\r\n\t\t\t\tif(m_pCallback->GetBuffer((float*)m_Buffers[m_ActiveBuffer].lpData, m_BlockSize))\r\n\t\t\t\t{\r\n\t\t\t\t\tm_Buffers[m_ActiveBuffer].dwUser = m_ActiveBuffer;\r\n                    waveOutWrite(m_waveHandle, &m_Buffers[m_ActiveBuffer], sizeof(WAVEHDR));\r\n                    m_ActiveBuffer++;\r\n\t\t\t\t\tm_ActiveBuffer &= (m_NumBuffers-1);\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tm_Playing = false;\r\n                    hasPlayed = true;\r\n                    this->audioCondition.wait(lock);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n    }\r\n\treturn(0);\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/\tInitialization and termination\r\n\/\/\r\n\/\/\r\n\/\/\r\n\r\nbool WaveOut::Initialize(void)\r\n{\r\n\tm_Playing = false;\r\n\tm_ActiveBuffer\t= 0;\r\n\tm_QueuedBuffers\t= 0;\r\n\r\n    m_bThreadRun = true;\r\n\r\n    this->audioThread = new boost::thread(boost::bind(&WaveOut::ThreadProc, this));\r\n\r\n\tif(!this->audioThread)\r\n\t\treturn false;\r\n\r\n\treturn(true);\r\n}\r\n\r\nbool WaveOut::Shutdown(void)\r\n{\r\n\tClose();\r\n     \r\n\/\/    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\tif(this->audioThread)\r\n\t{\r\n\t\tm_bThreadRun = false;\r\n\r\n        this->audioCondition.notify_one();\r\n        this->audioThread->join();\r\n        delete this->audioThread;\r\n    }\r\n\r\n\treturn(true);\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/\t\tSetup Stuff, can only be called before initialize\r\n\/\/\r\n\/\/\r\n\r\nbool WaveOut::SetFormat(unsigned long SampleRate, unsigned long Channels)\r\n{\r\n\tif( (SampleRate != m_waveFormatPCMEx.Format.nSamplesPerSec) ||\r\n\t\t(Channels != m_waveFormatPCMEx.Format.nChannels) )\r\n\t{\r\n\t\tShutdown();\r\n\r\n\t\tDWORD speakerconfig;\r\n\r\n\t\tif(Channels == 1)\r\n\t\t{\r\n\t\t\tspeakerconfig = KSAUDIO_SPEAKER_MONO;\r\n\t\t}\r\n\t\telse if(Channels == 2)\r\n\t\t{\r\n\t\t\tspeakerconfig = KSAUDIO_SPEAKER_STEREO;\r\n\t\t}\r\n\t\telse if(Channels == 4)\r\n\t\t{\r\n\t\t\tspeakerconfig = KSAUDIO_SPEAKER_QUAD;\r\n\t\t}\r\n\t\telse if(Channels == 5)\r\n\t\t{\r\n\t\t\tspeakerconfig = (SPEAKER_FRONT_LEFT | SPEAKER_FRONT_RIGHT | SPEAKER_FRONT_CENTER | SPEAKER_BACK_LEFT  | SPEAKER_BACK_RIGHT);\r\n\t\t}\r\n\t\telse if(Channels == 6)\r\n\t\t{\r\n\t\t\tspeakerconfig = KSAUDIO_SPEAKER_5POINT1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tspeakerconfig = 0;\r\n\t\t}\r\n\r\n\t\tm_waveFormatPCMEx.Format.cbSize\t\t\t\t\t= 22;\r\n\t\tm_waveFormatPCMEx.Format.wFormatTag\t\t\t\t= WAVE_FORMAT_EXTENSIBLE;\r\n\t\tm_waveFormatPCMEx.Format.nChannels\t\t\t\t= (WORD)Channels;\r\n\t\tm_waveFormatPCMEx.Format.nSamplesPerSec\t\t\t= SampleRate;\r\n\t\tm_waveFormatPCMEx.Format.wBitsPerSample\t\t\t= 32;\r\n\t\tm_waveFormatPCMEx.Format.nBlockAlign\t\t\t= (m_waveFormatPCMEx.Format.wBitsPerSample\/8) * m_waveFormatPCMEx.Format.nChannels;\r\n\t\tm_waveFormatPCMEx.Format.nAvgBytesPerSec\t\t= ((m_waveFormatPCMEx.Format.wBitsPerSample\/8) * m_waveFormatPCMEx.Format.nChannels) * m_waveFormatPCMEx.Format.nSamplesPerSec; \/\/Compute using nBlkAlign * nSamp\/Sec \r\n\r\n        \/\/ clangen: wValidBitsPerSample\/wReserved\/wSamplesPerBlock are a union,\r\n        \/\/ so don't set wReserved or wSamplesPerBlock to 0 after assigning\r\n        \/\/ wValidBitsPerSample. (Vista bug)\r\n\t\tm_waveFormatPCMEx.Samples.wValidBitsPerSample\t= 32;\r\n\t\t\r\n\t\tm_waveFormatPCMEx.dwChannelMask\t\t\t\t\t= speakerconfig; \r\n\t\tm_waveFormatPCMEx.SubFormat\t\t\t\t\t\t= KSDATAFORMAT_SUBTYPE_IEEE_FLOAT;\r\n\r\n\t\tunsigned long samplesperms = ((unsigned long)((float)m_waveFormatPCMEx.Format.nSamplesPerSec \/ 1000.0f)) * m_waveFormatPCMEx.Format.nChannels;\r\n\r\n        m_Interval\t\t\t= (this->GetBufferSizeMs() \/ m_NumBuffers) \/ 2;\r\n\t\tm_BlockSize\t\t\t= (this->GetBufferSizeMs() \/ m_NumBuffers) * samplesperms;\t\/\/ this should be a 300MS buffer size!\r\n\t\twhile(m_BlockSize & m_waveFormatPCMEx.Format.nBlockAlign)\r\n\t\t\tm_BlockSize++;\r\n\r\n\t\tif(!Initialize())\r\n\t\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ PLAYBACK CONTROLS\r\n\/\/\r\n\/\/\r\nbool WaveOut::Start(void)\r\n{\r\n\tif(!Open())\r\n\t\treturn(false);\r\n \r\n    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\twhile(m_QueuedBuffers) \/\/ Handles pause\/play?\r\n\t{\r\n\t\twaveOutWrite(m_waveHandle, &m_Buffers[m_ActiveBuffer], sizeof(WAVEHDR));\r\n\t\tm_ActiveBuffer++;\r\n\t\tm_ActiveBuffer &= (m_NumBuffers-1); \/\/ Probably only works if m_Numbuffers is power of 2\r\n\r\n\t\tm_QueuedBuffers--;\r\n\t}\r\n\r\n\tm_Playing = true;\r\n\t\r\n    this->audioCondition.notify_one();\r\n\r\n\treturn true;\r\n}\r\n\r\nbool WaveOut::Stop(void)\r\n{\r\n    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\tm_QueuedBuffers = 0;\r\n\tm_Playing = false;\r\n\r\n\tif(m_waveHandle)\r\n\t{\r\n\t\tfor(unsigned long buffer=0; buffer<m_NumBuffers; buffer++)\r\n\t\t{\r\n\t\t\tif(\t!(m_Buffers[buffer].dwFlags & WHDR_INQUEUE) )\r\n\t\t\t{\r\n\t\t\t\tm_QueuedBuffers++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tm_ActiveBuffer-= m_QueuedBuffers;\r\n\t\tm_ActiveBuffer &= (m_NumBuffers-1);\r\n\t}\r\n\r\n\tClose();\r\n\r\n\treturn true;\r\n}\r\n\r\nbool WaveOut::Reset(void)\r\n{\r\n\/\/\tCAutoLock lock(&m_AudioLock);\r\n\r\n\t\/\/ simmilar to stop, except we dont rewind the stream\r\n\tif(m_waveHandle) \r\n\t{\r\n\t\twaveOutReset(m_waveHandle);\r\n\r\n\t\tm_ActiveBuffer = 0;\r\n\t\tm_dwSamplesOut = 0;\r\n\r\n\t\tm_LastPlayedBuffer = 0;\r\n\r\n\t\tQueryPerformanceCounter(&m_liLastPerformanceCount);\r\n\t\treturn(true);\r\n\t}\r\n\treturn false;\r\n}<commit_msg>Fixed waveOut for multichannel audio (more than 2 channels)<commit_after>#include \"WaveOut.h\"\r\n\r\n#include <boost\/bind.hpp>\r\n\r\nWaveOut::WaveOut(void) :\r\n\tm_waveHandle(NULL),\r\n\tm_pCallback(NULL),\r\n    audioThread(NULL),\r\n\tm_dwSamplesOut(0),\r\n\tm_LastPlayedBuffer(-1),\r\n\tm_NumBuffers(8) \/\/TODO: config\r\n{\r\n\tZeroMemory(&m_waveFormatPCMEx, sizeof(m_waveFormatPCMEx));\r\n\r\n\tQueryPerformanceFrequency(&m_liCountsPerSecond);\r\n\r\n\tm_pfAudioBuffer = NULL;\r\n}\r\n\r\nWaveOut::~WaveOut(void)\r\n{\r\n\tShutdown();\r\n}\r\n\r\nvoid WaveOut::Destroy()\r\n{\r\n    delete this;\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/\tActual Audio Output Stuff!\r\n\/\/\r\n\/\/\r\n\r\nvoid CALLBACK WaveOut::WaveCallback(HWAVEOUT hWave, UINT uMsg, DWORD_PTR dwUser, DWORD_PTR dw1, DWORD dw2)\r\n{\r\n    if(uMsg == WOM_DONE) \r\n\t{\r\n\t\tWaveOut*\tto\t\t\t= (WaveOut *)dwUser;\r\n\t\tLPWAVEHDR\twhr\t\t\t\t\t= (LPWAVEHDR)dw1;\r\n\r\n\t\tto->m_dwSamplesOut\t\t+= (whr->dwBufferLength \/ to->m_waveFormatPCMEx.Format.nBlockAlign);\r\n\t\tto->m_LastPlayedBuffer\t= (unsigned long)whr->dwUser;\r\n\r\n\t\tQueryPerformanceCounter(&to->m_liLastPerformanceCount);\r\n\r\n        to->audioCondition.notify_one();\r\n   }\r\n}\r\n\r\nbool WaveOut::Open(void)\r\n{\r\n\tint r;\r\n\tint currentDevice = this->GetOutputDevice();\r\n\r\n    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\tif(m_waveHandle==NULL)\r\n\t{\r\n\t\tr = waveOutOpen(&m_waveHandle, currentDevice, (WAVEFORMATEX*)&m_waveFormatPCMEx, (DWORD_PTR)WaveCallback, (DWORD_PTR)this, CALLBACK_FUNCTION);\r\n\t\tif(r != MMSYSERR_NOERROR) \r\n\t\t{\r\n\t\t\treturn(false);\r\n\t\t}\r\n\r\n\t\tm_Buffers = (WAVEHDR *)VirtualAlloc(NULL, m_NumBuffers * sizeof(WAVEHDR), MEM_COMMIT, PAGE_READWRITE);\r\n\r\n        unsigned int bytesPerSample = m_waveFormatPCMEx.Format.wBitsPerSample\/8;\r\n\r\n        m_dwBufferSize = m_BlockSize*bytesPerSample;\r\n\r\n\t\tm_pfAudioBuffer = (float *)VirtualAlloc(NULL, m_dwBufferSize * m_NumBuffers, MEM_COMMIT, PAGE_READWRITE);\t\t\/\/ allocate audio memory\r\n\t\tVirtualLock(m_pfAudioBuffer, m_dwBufferSize * m_NumBuffers);\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ lock the audio memory into physical memory\r\n\r\n\t\tfor(unsigned long x=0; x<m_NumBuffers; x++)\r\n\t\t{\r\n            m_Buffers[x].dwBufferLength\t\t= m_dwBufferSize;\r\n            m_Buffers[x].lpData\t\t\t\t= (LPSTR)&(this->m_pfAudioBuffer[x*m_BlockSize]);\r\n \t\t\tm_Buffers[x].dwUser\t\t\t\t= x;\r\n\t\t\tm_Buffers[x].dwBytesRecorded\t= 0;\r\n\t\t\tm_Buffers[x].dwFlags\t\t\t= 0;\r\n\t\t\tm_Buffers[x].dwLoops\t\t\t= 0;\r\n\r\n\t\t\twaveOutPrepareHeader(m_waveHandle, &m_Buffers[x], sizeof(WAVEHDR));\r\n            m_Buffers[x].dwFlags\t\t\t|= WHDR_DONE;\r\n\t\t}\r\n\r\n\t\tQueryPerformanceCounter(&m_liLastPerformanceCount);\r\n\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool WaveOut::Close(void)\r\n{\r\n\tint r;\r\n\r\n    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\tif(m_waveHandle)\r\n\t{\r\n\t\tm_Playing = false;\r\n\r\n        do{\r\n\t\t    if(waveOutReset(m_waveHandle) == MMSYSERR_NOERROR)\r\n\t\t    {\r\n\t\t\t    for(unsigned long x=0; x<m_NumBuffers; x++)\r\n\t\t\t    {\r\n\t\t\t\t    if(m_Buffers[x].dwFlags & WHDR_PREPARED)\r\n\t\t\t\t\t    waveOutUnprepareHeader(m_waveHandle, &m_Buffers[x], sizeof(WAVEHDR));\r\n\t\t\t    }\r\n\t\t    }\r\n        } while((r = waveOutClose(m_waveHandle)) != MMSYSERR_NOERROR);\r\n\r\n\r\n\t\tm_waveHandle = NULL;\r\n\r\n\t\tVirtualUnlock(m_pfAudioBuffer, m_dwBufferSize * m_NumBuffers);\r\n\t\tVirtualFree(m_pfAudioBuffer, 0, MEM_RELEASE);\r\n\t\tm_pfAudioBuffer = NULL;\r\n\r\n\t\tVirtualFree(m_Buffers, 0, MEM_RELEASE);\r\n\t\tm_Buffers = NULL;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/\r\n\r\nunsigned long WaveOut::ThreadProc(void)\r\n{\r\n    bool hasPlayed = false;\r\n\r\n\twhile(m_bThreadRun && !hasPlayed)\r\n\t{\r\n\t\twhile(m_Playing && this->m_pCallback)\r\n\t\t{\r\n\t\t\tboost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n            while(this->m_Buffers && m_Playing && ((m_Buffers[m_ActiveBuffer].dwFlags&WHDR_DONE)==0) )\r\n\t\t\t{\r\n                this->audioCondition.wait(lock);\r\n\t\t\t}\r\n\r\n\t\t\tif(m_Playing)\r\n\t\t\t{\r\n\t\t\t\tif(m_pCallback->GetBuffer((float*)m_Buffers[m_ActiveBuffer].lpData, m_BlockSize))\r\n\t\t\t\t{\r\n\t\t\t\t\tm_Buffers[m_ActiveBuffer].dwUser = m_ActiveBuffer;\r\n                    waveOutWrite(m_waveHandle, &m_Buffers[m_ActiveBuffer], sizeof(WAVEHDR));\r\n                    m_ActiveBuffer++;\r\n\t\t\t\t\tm_ActiveBuffer &= (m_NumBuffers-1);\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tm_Playing = false;\r\n                    hasPlayed = true;\r\n                    this->audioCondition.wait(lock);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n    }\r\n\treturn(0);\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/\tInitialization and termination\r\n\/\/\r\n\/\/\r\n\/\/\r\n\r\nbool WaveOut::Initialize(void)\r\n{\r\n\tm_Playing = false;\r\n\tm_ActiveBuffer\t= 0;\r\n\tm_QueuedBuffers\t= 0;\r\n\r\n    m_bThreadRun = true;\r\n\r\n    this->audioThread = new boost::thread(boost::bind(&WaveOut::ThreadProc, this));\r\n\r\n\tif(!this->audioThread)\r\n\t\treturn false;\r\n\r\n\treturn(true);\r\n}\r\n\r\nbool WaveOut::Shutdown(void)\r\n{\r\n\tClose();\r\n     \r\n\/\/    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\tif(this->audioThread)\r\n\t{\r\n\t\tm_bThreadRun = false;\r\n\r\n        this->audioCondition.notify_one();\r\n        this->audioThread->join();\r\n        delete this->audioThread;\r\n    }\r\n\r\n\treturn(true);\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/\t\tSetup Stuff, can only be called before initialize\r\n\/\/\r\n\/\/\r\n\r\nbool WaveOut::SetFormat(unsigned long SampleRate, unsigned long Channels)\r\n{\r\n\tif( (SampleRate != m_waveFormatPCMEx.Format.nSamplesPerSec) ||\r\n\t\t(Channels != m_waveFormatPCMEx.Format.nChannels) )\r\n\t{\r\n\t\tShutdown();\r\n\r\n\t\tDWORD speakerconfig;\r\n\r\n\t\tif(Channels == 1)\r\n\t\t{\r\n\t\t\tspeakerconfig = KSAUDIO_SPEAKER_MONO;\r\n\t\t}\r\n\t\telse if(Channels == 2)\r\n\t\t{\r\n\t\t\tspeakerconfig = KSAUDIO_SPEAKER_STEREO;\r\n\t\t}\r\n\t\telse if(Channels == 4)\r\n\t\t{\r\n\t\t\tspeakerconfig = KSAUDIO_SPEAKER_QUAD;\r\n\t\t}\r\n\t\telse if(Channels == 5)\r\n\t\t{\r\n\t\t\tspeakerconfig = (SPEAKER_FRONT_LEFT | SPEAKER_FRONT_RIGHT | SPEAKER_FRONT_CENTER | SPEAKER_BACK_LEFT  | SPEAKER_BACK_RIGHT);\r\n\t\t}\r\n\t\telse if(Channels == 6)\r\n\t\t{\r\n\t\t\tspeakerconfig = KSAUDIO_SPEAKER_5POINT1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tspeakerconfig = 0;\r\n\t\t}\r\n\r\n\t\tm_waveFormatPCMEx.Format.cbSize\t\t\t\t\t= 22;\r\n\t\tm_waveFormatPCMEx.Format.wFormatTag\t\t\t\t= WAVE_FORMAT_EXTENSIBLE;\r\n\t\tm_waveFormatPCMEx.Format.nChannels\t\t\t\t= (WORD)Channels;\r\n\t\tm_waveFormatPCMEx.Format.nSamplesPerSec\t\t\t= SampleRate;\r\n\t\tm_waveFormatPCMEx.Format.wBitsPerSample\t\t\t= 32;\r\n\t\tm_waveFormatPCMEx.Format.nBlockAlign\t\t\t= (m_waveFormatPCMEx.Format.wBitsPerSample\/8) * m_waveFormatPCMEx.Format.nChannels;\r\n\t\tm_waveFormatPCMEx.Format.nAvgBytesPerSec\t\t= ((m_waveFormatPCMEx.Format.wBitsPerSample\/8) * m_waveFormatPCMEx.Format.nChannels) * m_waveFormatPCMEx.Format.nSamplesPerSec; \/\/Compute using nBlkAlign * nSamp\/Sec \r\n\r\n        \/\/ clangen: wValidBitsPerSample\/wReserved\/wSamplesPerBlock are a union,\r\n        \/\/ so don't set wReserved or wSamplesPerBlock to 0 after assigning\r\n        \/\/ wValidBitsPerSample. (Vista bug)\r\n\t\tm_waveFormatPCMEx.Samples.wValidBitsPerSample\t= 32;\r\n\t\t\r\n\t\tm_waveFormatPCMEx.dwChannelMask\t\t\t\t\t= speakerconfig; \r\n\t\tm_waveFormatPCMEx.SubFormat\t\t\t\t\t\t= KSDATAFORMAT_SUBTYPE_IEEE_FLOAT;\r\n\r\n\t\tunsigned long samplesperms = ((unsigned long)((float)m_waveFormatPCMEx.Format.nSamplesPerSec \/ 1000.0f)) * m_waveFormatPCMEx.Format.nChannels;\r\n\r\n        m_Interval\t\t\t= (this->GetBufferSizeMs() \/ m_NumBuffers) \/ 2;\r\n\t\tm_BlockSize\t\t\t= (this->GetBufferSizeMs() \/ m_NumBuffers) * samplesperms;\t\/\/ this should be a 300MS buffer size!\r\n\t\twhile(m_BlockSize & m_waveFormatPCMEx.Format.nBlockAlign)\r\n\t\t\tm_BlockSize++;\r\n\r\n\t\tif(!Initialize())\r\n\t\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ PLAYBACK CONTROLS\r\n\/\/\r\n\/\/\r\nbool WaveOut::Start(void)\r\n{\r\n\tif(!Open())\r\n\t\treturn(false);\r\n \r\n    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\twhile(m_QueuedBuffers) \/\/ Handles pause\/play?\r\n\t{\r\n\t\twaveOutWrite(m_waveHandle, &m_Buffers[m_ActiveBuffer], sizeof(WAVEHDR));\r\n\t\tm_ActiveBuffer++;\r\n\t\tm_ActiveBuffer &= (m_NumBuffers-1); \/\/ Probably only works if m_Numbuffers is power of 2\r\n\r\n\t\tm_QueuedBuffers--;\r\n\t}\r\n\r\n\tm_Playing = true;\r\n\t\r\n    this->audioCondition.notify_one();\r\n\r\n\treturn true;\r\n}\r\n\r\nbool WaveOut::Stop(void)\r\n{\r\n    boost::mutex::scoped_lock lock(this->audioMutex);\r\n\r\n\tm_QueuedBuffers = 0;\r\n\tm_Playing = false;\r\n\r\n\tif(m_waveHandle)\r\n\t{\r\n\t\tfor(unsigned long buffer=0; buffer<m_NumBuffers; buffer++)\r\n\t\t{\r\n\t\t\tif(\t!(m_Buffers[buffer].dwFlags & WHDR_INQUEUE) )\r\n\t\t\t{\r\n\t\t\t\tm_QueuedBuffers++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tm_ActiveBuffer-= m_QueuedBuffers;\r\n\t\tm_ActiveBuffer &= (m_NumBuffers-1);\r\n\t}\r\n\r\n\tClose();\r\n\r\n\treturn true;\r\n}\r\n\r\nbool WaveOut::Reset(void)\r\n{\r\n\/\/\tCAutoLock lock(&m_AudioLock);\r\n\r\n\t\/\/ simmilar to stop, except we dont rewind the stream\r\n\tif(m_waveHandle) \r\n\t{\r\n\t\twaveOutReset(m_waveHandle);\r\n\r\n\t\tm_ActiveBuffer = 0;\r\n\t\tm_dwSamplesOut = 0;\r\n\r\n\t\tm_LastPlayedBuffer = 0;\r\n\r\n\t\tQueryPerformanceCounter(&m_liLastPerformanceCount);\r\n\t\treturn(true);\r\n\t}\r\n\treturn false;\r\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 \"media\/base\/android\/webaudio_media_codec_bridge.h\"\n\n#include <errno.h>\n#include <unistd.h>\n#include <vector>\n\n#include \"base\/android\/jni_android.h\"\n#include \"base\/android\/jni_array.h\"\n#include \"base\/android\/jni_string.h\"\n#include \"base\/basictypes.h\"\n#include \"base\/logging.h\"\n#include \"base\/posix\/eintr_wrapper.h\"\n#include \"jni\/WebAudioMediaCodecBridge_jni.h\"\n\n\nusing base::android::AttachCurrentThread;\n\nnamespace media {\n\nvoid WebAudioMediaCodecBridge::RunWebAudioMediaCodec(\n    base::SharedMemoryHandle encoded_audio_handle,\n    base::FileDescriptor pcm_output) {\n  WebAudioMediaCodecBridge bridge(encoded_audio_handle, pcm_output);\n\n  bridge.DecodeInMemoryAudioFile();\n}\n\nWebAudioMediaCodecBridge::WebAudioMediaCodecBridge(\n    base::SharedMemoryHandle encoded_audio_handle,\n    base::FileDescriptor pcm_output)\n    : encoded_audio_handle_(encoded_audio_handle.fd),\n      pcm_output_(pcm_output.fd) {\n  DVLOG(1) << \"WebAudioMediaCodecBridge start **********************\"\n           << \"input fd = \" << encoded_audio_handle_\n           << \" output fd = \" << pcm_output.fd;\n}\n\nWebAudioMediaCodecBridge::~WebAudioMediaCodecBridge() {\n  if (close(pcm_output_)) {\n    DVLOG(1) << \"Couldn't close output fd \" << pcm_output_\n             << \": \" << strerror(errno);\n  }\n\n  if (close(encoded_audio_handle_)) {\n    DVLOG(1) << \"Couldn't close shared mem fd \" << encoded_audio_handle_\n             << \": \" << strerror(errno);\n  }\n}\n\nbool WebAudioMediaCodecBridge::DecodeInMemoryAudioFile() {\n  \/\/ Process the encoded data from |encoded_data_handle_|.\n\n  JNIEnv* env = AttachCurrentThread();\n  CHECK(env);\n  jboolean decoded = Java_WebAudioMediaCodecBridge_decodeAudioFile(\n      env,\n      base::android::GetApplicationContext(),\n      reinterpret_cast<intptr_t>(this),\n      encoded_audio_handle_);\n\n  DVLOG(1) << \"decoded = \" << decoded;\n  return decoded;\n}\n\nvoid WebAudioMediaCodecBridge::InitializeDestination(\n    JNIEnv* env,\n    jobject \/*java object*\/,\n    jint channel_count,\n    jint sample_rate,\n    jlong duration_microsec,\n    jboolean is_vorbis) {\n  \/\/ Send information about this audio file: number of channels,\n  \/\/ sample rate (Hz), number of frames, a flag indicating whether\n  \/\/ this file is an audio\/vorbis file.  Information is sent as a set of\n  \/\/ 4 longs. This must be coordinated with DecodeAudioFileData!\n\n  unsigned long info[4] = {channel_count,\n                           sample_rate,\n                           \/\/ The number of frames is the duration of the file\n                           \/\/ (in microseconds) times the sample rate.\n                           0.5 + (duration_microsec * 0.000001 * sample_rate),\n                           is_vorbis ? 1 : 0};\n\n  DVLOG(1) << \"InitializeDestination:\"\n           << \"  channel count = \" << channel_count\n           << \"  rate = \" << sample_rate\n           << \"  duration = \" << duration_microsec << \" microsec\"\n           << \"  vorbis = \" << (is_vorbis ? \"yes\" : \"no\");\n\n  HANDLE_EINTR(write(pcm_output_, info, sizeof(info)));\n}\n\nvoid WebAudioMediaCodecBridge::OnChunkDecoded(\n    JNIEnv* env,\n    jobject \/*java object*\/,\n    jobject buf,\n    jint buf_size) {\n\n  if (buf_size <= 0 || !buf)\n    return;\n\n  int8_t* buffer =\n      static_cast<int8_t*>(env->GetDirectBufferAddress(buf));\n\n  size_t count = static_cast<size_t>(buf_size);\n\n  \/\/ Write out the data to the pipe in small chunks if necessary.\n  while (count > 0) {\n    int bytes_to_write = (count >= PIPE_BUF) ? PIPE_BUF : count;\n    ssize_t bytes_written = HANDLE_EINTR(write(pcm_output_,\n                                               buffer,\n                                               bytes_to_write));\n    if (bytes_written == -1)\n      break;\n    count -= bytes_written;\n    buffer += bytes_written;\n  }\n}\n\nbool WebAudioMediaCodecBridge::RegisterWebAudioMediaCodecBridge(JNIEnv* env) {\n  return RegisterNativesImpl(env);\n}\n\n} \/\/ namespace\n<commit_msg>[Android] Fix downstream WebView build.<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 \"media\/base\/android\/webaudio_media_codec_bridge.h\"\n\n#include <errno.h>\n#include <unistd.h>\n#include <vector>\n\n#include \"base\/android\/jni_android.h\"\n#include \"base\/android\/jni_array.h\"\n#include \"base\/android\/jni_string.h\"\n#include \"base\/basictypes.h\"\n#include \"base\/logging.h\"\n#include \"base\/posix\/eintr_wrapper.h\"\n#include \"jni\/WebAudioMediaCodecBridge_jni.h\"\n\n\nusing base::android::AttachCurrentThread;\n\nnamespace media {\n\nvoid WebAudioMediaCodecBridge::RunWebAudioMediaCodec(\n    base::SharedMemoryHandle encoded_audio_handle,\n    base::FileDescriptor pcm_output) {\n  WebAudioMediaCodecBridge bridge(encoded_audio_handle, pcm_output);\n\n  bridge.DecodeInMemoryAudioFile();\n}\n\nWebAudioMediaCodecBridge::WebAudioMediaCodecBridge(\n    base::SharedMemoryHandle encoded_audio_handle,\n    base::FileDescriptor pcm_output)\n    : encoded_audio_handle_(encoded_audio_handle.fd),\n      pcm_output_(pcm_output.fd) {\n  DVLOG(1) << \"WebAudioMediaCodecBridge start **********************\"\n           << \"input fd = \" << encoded_audio_handle_\n           << \" output fd = \" << pcm_output.fd;\n}\n\nWebAudioMediaCodecBridge::~WebAudioMediaCodecBridge() {\n  if (close(pcm_output_)) {\n    DVLOG(1) << \"Couldn't close output fd \" << pcm_output_\n             << \": \" << strerror(errno);\n  }\n\n  if (close(encoded_audio_handle_)) {\n    DVLOG(1) << \"Couldn't close shared mem fd \" << encoded_audio_handle_\n             << \": \" << strerror(errno);\n  }\n}\n\nbool WebAudioMediaCodecBridge::DecodeInMemoryAudioFile() {\n  \/\/ Process the encoded data from |encoded_data_handle_|.\n\n  JNIEnv* env = AttachCurrentThread();\n  CHECK(env);\n  jboolean decoded = Java_WebAudioMediaCodecBridge_decodeAudioFile(\n      env,\n      base::android::GetApplicationContext(),\n      reinterpret_cast<intptr_t>(this),\n      encoded_audio_handle_);\n\n  DVLOG(1) << \"decoded = \" << decoded;\n  return decoded;\n}\n\nvoid WebAudioMediaCodecBridge::InitializeDestination(\n    JNIEnv* env,\n    jobject \/*java object*\/,\n    jint channel_count,\n    jint sample_rate,\n    jlong duration_microsec,\n    jboolean is_vorbis) {\n  \/\/ Send information about this audio file: number of channels,\n  \/\/ sample rate (Hz), number of frames, a flag indicating whether\n  \/\/ this file is an audio\/vorbis file.  Information is sent as a set of\n  \/\/ 4 longs. This must be coordinated with DecodeAudioFileData!\n\n  unsigned long info[4] = {static_cast<unsigned long>(channel_count),\n                           static_cast<unsigned long>(sample_rate),\n                           \/\/ The number of frames is the duration of the file\n                           \/\/ (in microseconds) times the sample rate.\n                           static_cast<unsigned long>(\n                               0.5 + (duration_microsec * 0.000001 *\n                                      sample_rate)),\n                           is_vorbis ? 1ul : 0ul};\n\n  DVLOG(1) << \"InitializeDestination:\"\n           << \"  channel count = \" << channel_count\n           << \"  rate = \" << sample_rate\n           << \"  duration = \" << duration_microsec << \" microsec\"\n           << \"  vorbis = \" << (is_vorbis ? \"yes\" : \"no\");\n\n  HANDLE_EINTR(write(pcm_output_, info, sizeof(info)));\n}\n\nvoid WebAudioMediaCodecBridge::OnChunkDecoded(\n    JNIEnv* env,\n    jobject \/*java object*\/,\n    jobject buf,\n    jint buf_size) {\n\n  if (buf_size <= 0 || !buf)\n    return;\n\n  int8_t* buffer =\n      static_cast<int8_t*>(env->GetDirectBufferAddress(buf));\n\n  size_t count = static_cast<size_t>(buf_size);\n\n  \/\/ Write out the data to the pipe in small chunks if necessary.\n  while (count > 0) {\n    int bytes_to_write = (count >= PIPE_BUF) ? PIPE_BUF : count;\n    ssize_t bytes_written = HANDLE_EINTR(write(pcm_output_,\n                                               buffer,\n                                               bytes_to_write));\n    if (bytes_written == -1)\n      break;\n    count -= bytes_written;\n    buffer += bytes_written;\n  }\n}\n\nbool WebAudioMediaCodecBridge::RegisterWebAudioMediaCodecBridge(JNIEnv* env) {\n  return RegisterNativesImpl(env);\n}\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\/\n\n#ifndef DELETER_HH_\n#define DELETER_HH_\n\n#include <memory>\n#include <cstdlib>\n#include <assert.h>\n#include <type_traits>\n\nclass deleter final {\npublic:\n    struct impl;\n    struct raw_object_tag {};\nprivate:\n    \/\/ if bit 0 set, point to object to be freed directly.\n    impl* _impl = nullptr;\npublic:\n    deleter() = default;\n    deleter(const deleter&) = delete;\n    deleter(deleter&& x) : _impl(x._impl) { x._impl = nullptr; }\n    explicit deleter(impl* i) : _impl(i) {}\n    deleter(raw_object_tag tag, void* object)\n        : _impl(from_raw_object(object)) {}\n    ~deleter();\n    deleter& operator=(deleter&& x);\n    deleter& operator=(deleter&) = delete;\n    impl& operator*() const { return *_impl; }\n    impl* operator->() const { return _impl; }\n    impl* get() const { return _impl; }\n    void unshare();\n    deleter share();\n    explicit operator bool() const { return bool(_impl); }\n    void reset(impl* i) {\n        this->~deleter();\n        new (this) deleter(i);\n    }\n    void append(deleter d);\nprivate:\n    static bool is_raw_object(impl* i) {\n        auto x = reinterpret_cast<uintptr_t>(i);\n        return x & 1;\n    }\n    bool is_raw_object() const {\n        return is_raw_object(_impl);\n    }\n    static void* to_raw_object(impl* i) {\n        auto x = reinterpret_cast<uintptr_t>(i);\n        return reinterpret_cast<void*>(x & ~uintptr_t(1));\n    }\n    void* to_raw_object() const {\n        return to_raw_object(_impl);\n    }\n    impl* from_raw_object(void* object) {\n        auto x = reinterpret_cast<uintptr_t>(object);\n        return reinterpret_cast<impl*>(x | 1);\n    }\n};\n\nstruct deleter::impl {\n    unsigned refs = 1;\n    deleter next;\n    impl(deleter next) : next(std::move(next)) {}\n    virtual ~impl() {}\n};\n\ninline\ndeleter::~deleter() {\n    if (is_raw_object()) {\n        std::free(to_raw_object());\n        return;\n    }\n    if (_impl && --_impl->refs == 0) {\n        delete _impl;\n    }\n}\n\ninline\ndeleter& deleter::operator=(deleter&& x) {\n    if (this != &x) {\n        this->~deleter();\n        new (this) deleter(std::move(x));\n    }\n    return *this;\n}\n\ntemplate <typename Deleter>\nstruct lambda_deleter_impl final : deleter::impl {\n    Deleter del;\n    lambda_deleter_impl(deleter next, Deleter&& del)\n        : impl(std::move(next)), del(std::move(del)) {}\n    virtual ~lambda_deleter_impl() override { del(); }\n};\n\ntemplate <typename Object>\nstruct object_deleter_impl final : deleter::impl {\n    Object obj;\n    object_deleter_impl(deleter next, Object&& obj)\n        : impl(std::move(next)), obj(std::move(obj)) {}\n};\n\ntemplate <typename Object>\nobject_deleter_impl<Object>* make_object_deleter_impl(deleter next, Object obj) {\n    return new object_deleter_impl<Object>(std::move(next), std::move(obj));\n}\n\ntemplate <typename Deleter>\ndeleter\nmake_deleter(deleter next, Deleter d) {\n    return deleter(new lambda_deleter_impl<Deleter>(std::move(next), std::move(d)));\n}\n\ntemplate <typename Deleter>\ndeleter\nmake_deleter(Deleter d) {\n    return make_deleter(deleter(), std::move(d));\n}\n\nstruct free_deleter_impl final : deleter::impl {\n    void* obj;\n    free_deleter_impl(void* obj) : impl(deleter()), obj(obj) {}\n    virtual ~free_deleter_impl() override { std::free(obj); }\n};\n\ninline\ndeleter\ndeleter::share() {\n    if (!_impl) {\n        return deleter();\n    }\n    if (is_raw_object()) {\n        _impl = new free_deleter_impl(to_raw_object());\n    }\n    ++_impl->refs;\n    return deleter(_impl);\n}\n\n\/\/ Appends 'd' to the chain of deleters. Avoids allocation if possible. For\n\/\/ performance reasons the current chain should be shorter and 'd' should be\n\/\/ longer.\ninline\nvoid deleter::append(deleter d) {\n    if (!d._impl) {\n        return;\n    }\n    impl* next_impl = _impl;\n    deleter* next_d = this;\n    while (next_impl) {\n        assert(next_impl != d._impl);\n        if (is_raw_object(next_impl)) {\n            next_d->_impl = next_impl = new free_deleter_impl(to_raw_object(next_impl));\n        }\n        if (next_impl->refs != 1) {\n            next_d->_impl = next_impl = make_object_deleter_impl(std::move(next_impl->next), deleter(next_impl));\n        }\n        next_d = &next_impl->next;\n        next_impl = next_d->_impl;\n    }\n    next_d->_impl = d._impl;\n    d._impl = nullptr;\n}\n\ninline\ndeleter\nmake_free_deleter(void* obj) {\n    if (!obj) {\n        return deleter();\n    }\n    return deleter(deleter::raw_object_tag(), obj);\n}\n\ninline\ndeleter\nmake_free_deleter(deleter next, void* obj) {\n    return make_deleter(std::move(next), [obj] () mutable { std::free(obj); });\n}\n\n#endif \/* DELETER_HH_ *\/\n<commit_msg>deleter: remove bad\/unused interfaces<commit_after>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\/\n\n#ifndef DELETER_HH_\n#define DELETER_HH_\n\n#include <memory>\n#include <cstdlib>\n#include <assert.h>\n#include <type_traits>\n\nclass deleter final {\npublic:\n    struct impl;\n    struct raw_object_tag {};\nprivate:\n    \/\/ if bit 0 set, point to object to be freed directly.\n    impl* _impl = nullptr;\npublic:\n    deleter() = default;\n    deleter(const deleter&) = delete;\n    deleter(deleter&& x) : _impl(x._impl) { x._impl = nullptr; }\n    explicit deleter(impl* i) : _impl(i) {}\n    deleter(raw_object_tag tag, void* object)\n        : _impl(from_raw_object(object)) {}\n    ~deleter();\n    deleter& operator=(deleter&& x);\n    deleter& operator=(deleter&) = delete;\n    deleter share();\n    explicit operator bool() const { return bool(_impl); }\n    void reset(impl* i) {\n        this->~deleter();\n        new (this) deleter(i);\n    }\n    void append(deleter d);\nprivate:\n    static bool is_raw_object(impl* i) {\n        auto x = reinterpret_cast<uintptr_t>(i);\n        return x & 1;\n    }\n    bool is_raw_object() const {\n        return is_raw_object(_impl);\n    }\n    static void* to_raw_object(impl* i) {\n        auto x = reinterpret_cast<uintptr_t>(i);\n        return reinterpret_cast<void*>(x & ~uintptr_t(1));\n    }\n    void* to_raw_object() const {\n        return to_raw_object(_impl);\n    }\n    impl* from_raw_object(void* object) {\n        auto x = reinterpret_cast<uintptr_t>(object);\n        return reinterpret_cast<impl*>(x | 1);\n    }\n};\n\nstruct deleter::impl {\n    unsigned refs = 1;\n    deleter next;\n    impl(deleter next) : next(std::move(next)) {}\n    virtual ~impl() {}\n};\n\ninline\ndeleter::~deleter() {\n    if (is_raw_object()) {\n        std::free(to_raw_object());\n        return;\n    }\n    if (_impl && --_impl->refs == 0) {\n        delete _impl;\n    }\n}\n\ninline\ndeleter& deleter::operator=(deleter&& x) {\n    if (this != &x) {\n        this->~deleter();\n        new (this) deleter(std::move(x));\n    }\n    return *this;\n}\n\ntemplate <typename Deleter>\nstruct lambda_deleter_impl final : deleter::impl {\n    Deleter del;\n    lambda_deleter_impl(deleter next, Deleter&& del)\n        : impl(std::move(next)), del(std::move(del)) {}\n    virtual ~lambda_deleter_impl() override { del(); }\n};\n\ntemplate <typename Object>\nstruct object_deleter_impl final : deleter::impl {\n    Object obj;\n    object_deleter_impl(deleter next, Object&& obj)\n        : impl(std::move(next)), obj(std::move(obj)) {}\n};\n\ntemplate <typename Object>\nobject_deleter_impl<Object>* make_object_deleter_impl(deleter next, Object obj) {\n    return new object_deleter_impl<Object>(std::move(next), std::move(obj));\n}\n\ntemplate <typename Deleter>\ndeleter\nmake_deleter(deleter next, Deleter d) {\n    return deleter(new lambda_deleter_impl<Deleter>(std::move(next), std::move(d)));\n}\n\ntemplate <typename Deleter>\ndeleter\nmake_deleter(Deleter d) {\n    return make_deleter(deleter(), std::move(d));\n}\n\nstruct free_deleter_impl final : deleter::impl {\n    void* obj;\n    free_deleter_impl(void* obj) : impl(deleter()), obj(obj) {}\n    virtual ~free_deleter_impl() override { std::free(obj); }\n};\n\ninline\ndeleter\ndeleter::share() {\n    if (!_impl) {\n        return deleter();\n    }\n    if (is_raw_object()) {\n        _impl = new free_deleter_impl(to_raw_object());\n    }\n    ++_impl->refs;\n    return deleter(_impl);\n}\n\n\/\/ Appends 'd' to the chain of deleters. Avoids allocation if possible. For\n\/\/ performance reasons the current chain should be shorter and 'd' should be\n\/\/ longer.\ninline\nvoid deleter::append(deleter d) {\n    if (!d._impl) {\n        return;\n    }\n    impl* next_impl = _impl;\n    deleter* next_d = this;\n    while (next_impl) {\n        assert(next_impl != d._impl);\n        if (is_raw_object(next_impl)) {\n            next_d->_impl = next_impl = new free_deleter_impl(to_raw_object(next_impl));\n        }\n        if (next_impl->refs != 1) {\n            next_d->_impl = next_impl = make_object_deleter_impl(std::move(next_impl->next), deleter(next_impl));\n        }\n        next_d = &next_impl->next;\n        next_impl = next_d->_impl;\n    }\n    next_d->_impl = d._impl;\n    d._impl = nullptr;\n}\n\ninline\ndeleter\nmake_free_deleter(void* obj) {\n    if (!obj) {\n        return deleter();\n    }\n    return deleter(deleter::raw_object_tag(), obj);\n}\n\ninline\ndeleter\nmake_free_deleter(deleter next, void* obj) {\n    return make_deleter(std::move(next), [obj] () mutable { std::free(obj); });\n}\n\n#endif \/* DELETER_HH_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ csastil_includeorder.cpp                                           -*-C++-*-\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2012 Dietmar Kuehl http:\/\/www.dietmar-kuehl.de              \n\/\/ Distributed under the Boost Software License, Version 1.0. (See file  \n\/\/ LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt).     \n\/\/ ----------------------------------------------------------------------------\n\n#include <csabase_analyser.h>\n#include <csabase_location.h>\n#include <csabase_ppobserver.h>\n#include <csabase_registercheck.h>\n#include <csabase_util.h>\n#include <cctype>\n#include <algorithm>\n#include <functional>\n#include <utility>\n#include <vector>\n\nnamespace CB = bde_verify::csabase;\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic std::string const check_name(\"include-order\");\n\n\/\/ ----------------------------------------------------------------------------\n\nnamespace\n{\n    struct include_order\n    {\n        typedef std::vector<std::pair<std::string, clang::SourceLocation> > headers_t;\n        headers_t d_header;\n        headers_t d_source;\n        void add_include(bool                         in_header,\n                         std::string                  header,\n                         clang::SourceLocation const& where)\n        {\n            std::string::size_type pos(header.find('.'));\n            if (pos != header.npos) {\n                header = header.substr(0u, pos);\n            }\n            \n            headers_t& headers(in_header? d_header: d_source);\n            if (headers.empty() || headers.back().first != header) {\n                headers.push_back(std::make_pair(header, where));\n            }\n        }\n    };\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nnamespace\n{\n    struct has_prefix\n    {\n        typedef std::pair<std::string, clang::SourceLocation> const& argument_type;\n        has_prefix(std::string const& prefix)\n            : d_prefix(prefix)\n        {\n        }\n        bool operator()(argument_type entry) const\n        {\n            return entry.first.find(d_prefix) == 0;\n        }\n        std::string d_prefix;\n    };\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic bool\nfirst_is_greater(std::pair<std::string, clang::SourceLocation> const& entry0,\n                 std::pair<std::string, clang::SourceLocation> const& entry1)\n{\n    return entry1.first < entry0.first;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic bool\nis_component(std::pair<std::string, clang::SourceLocation> const& entry)\n{\n    std::string const&     header(entry.first);\n    std::string::size_type start(header.find(\"a_\") == 0 || header.find(\"e_\") == 0? 2: 0);\n    std::string::size_type under(header.find('_', 0));\n    return under != header.npos && 4 < under - start && under - start < 8;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic void\ncheck_order(CB::Analyser*                              analyser,\n            std::string const&                         message,\n            include_order::headers_t::const_iterator it,\n            include_order::headers_t::const_iterator end)\n{\n    for (; end != (it = std::adjacent_find(it, end, &first_is_greater));\n         ++it) {\n        analyser->report(it[1].second, check_name, \"SHO01\",\n                         \"%0 header out of order\")\n            << message;\n    }\n}\n\nstatic void\ncheck_order(CB::Analyser*                              analyser,\n            std::string const&                         message,\n            include_order::headers_t::const_iterator it,\n            include_order::headers_t::const_iterator section_end,\n            include_order::headers_t::const_iterator end)\n{\n    check_order(analyser, message, it, section_end);\n    for (it = section_end;\n         end != (it = std::find_if(it, end, has_prefix(analyser->package() + \"_\")));\n         ++it) {\n        analyser->report(it->second, check_name, \"SHO02\",\n                         \"%0 header coming late\")\n            << message;\n    }\n}\n\nstatic clang::SourceLocation const*\ncheck_order(CB::Analyser*                   analyser,\n            include_order::headers_t const& headers,\n            bool                            header)\n{\n    clang::SourceLocation const* bdes_ident_location(0);\n    if (headers.empty()) {\n        analyser->report(clang::SourceLocation(), check_name, \"SHO03\",\n                         header\n                         ? \"Header without include guard included\"\n                         : \"Source without component include\");\n        return bdes_ident_location;\n    }\n    include_order::headers_t::const_iterator it(headers.begin());\n    if (it->first != analyser->component() || it++ == headers.end()) {\n        analyser->report(headers[0].second, check_name, \"SHO04\",\n                         header\n                         ? \"Header without or with wrong include guard\"\n                         : \"Source doesn't include component header first\");\n    }\n    std::string ident =\n        analyser->group() == \"bsl\" ? \"bsls_ident\" : \"bdes_ident\";\n    if (analyser->component() == ident ||\n        (analyser->is_test_driver() && !header)) {\n        if (it != headers.end()) {\n            if (it->first == \"bdes_ident\") {\n                bdes_ident_location = &it->second;\n            }\n            if (it->first == ident) {\n                ++it;\n            }\n        }\n    }\n    else if (it == headers.end() || it->first != ident) {\n        analyser->report((it == headers.end() ? it - 1: it)->second,\n                         check_name, \"SHO06\",\n                         \"Missing include for %0.h\")\n            << ident;\n    }\n    else {\n        if (it->first == \"bdes_ident\") {\n            bdes_ident_location = &it->second;\n        }\n        ++it;\n    }\n\n    std::string version = analyser->group() + \"scm_version\";\n    if (   analyser->component() != version\n        && header\n        && (it == headers.end()\n            || it->first != version\n            || it++ == headers.end())) {\n        analyser->report((it == headers.end() ? it - 1 : it)->second,\n                         check_name, \"SHO07\",\n                         \"Missing include for %0.h\")\n            << version;\n    }\n\n    include_order::headers_t::const_iterator end\n          = std::find_if(it, headers.end(),\n                         std::not1(std::ptr_fun(&is_component)));\n    include_order::headers_t::const_iterator package_end\n          = std::find_if(it, end, std::not1(has_prefix(analyser->package() + \"_\")));\n    check_order(analyser, \"Package\", it, package_end, end);\n    include_order::headers_t::const_iterator group_end\n          = std::find_if(it, end, std::not1(has_prefix(analyser->group())));\n    check_order(analyser, \"Group\", package_end, group_end, end);\n    check_order(analyser, \"Component\", group_end, end);\n\n    return bdes_ident_location;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic inline bool\nis_space(unsigned char c)\n{\n    return std::isspace(c);\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nnamespace\n{\n    std::string const prefix0(\"included_\");\n    std::string const prefix1(\"!defined(included_\");\n    std::string const prefix2(\"!definedincluded_\");\n\n    struct binder\n    {\n        binder(bde_verify::csabase::Analyser* analyser)\n            : d_analyser(analyser)\n        {\n        }\n\n        void operator()(clang::SourceLocation,\n                        clang::SourceRange range) const \/\/ onIf\n        {\n            if (!d_analyser->is_component(range.getBegin())) {\n                return;\n            }\n            include_order& data(d_analyser->attachment<include_order>()); \n            char const* begin(d_analyser->manager().getCharacterData(range.getBegin()));\n            char const* end(d_analyser->manager().getCharacterData(range.getEnd()));\n            std::string value(begin, end);\n            value.erase(std::remove_if(value.begin(), value.end(),\n                                       &is_space), value.end());\n            value = bde_verify::csabase::to_lower(value);\n            if (value.find(prefix1) == 0 && value[value.size() - 1] == ')') {\n                data.add_include(d_analyser->is_component_header(range.getBegin()),\n                                 value.substr(prefix1.size(), value.size() - prefix1.size() - 1),\n                                 range.getBegin());\n            }\n            else if (value.find(prefix2) == 0) {\n                data.add_include(d_analyser->is_component_header(range.getBegin()),\n                                 value.substr(prefix2.size()),\n                                 range.getBegin());\n            }\n        }\n        void operator()(clang::SourceLocation where,\n                        clang::Token const& token) const \/\/ onIfndef\n        {\n            if (!d_analyser->is_component(token.getLocation())) {\n                return;\n            }\n\n            include_order& data(d_analyser->attachment<include_order>());\n            if (clang::IdentifierInfo const* id = token.getIdentifierInfo())\n            {\n                std::string value(id->getNameStart());\n                value = bde_verify::csabase::to_lower(value);\n                if (value.find(prefix0) == 0) {\n                    data.add_include(d_analyser->is_component_header(token.getLocation()),\n                                     value.substr(prefix0.size()),\n                                     token.getLocation());\n                }\n            }\n        }\n        void operator()(clang::SourceLocation where,\n                        bool,\n                        std::string const& name)\n        {\n            if (d_analyser->is_component(where)) {\n                include_order& data(d_analyser->attachment<include_order>()); \n                bool in_header(d_analyser->is_component_header(where));\n                data.add_include(in_header, name, where);\n            }\n        }\n        void operator()()  \/\/ translation unit done\n        {\n            include_order& data(d_analyser->attachment<include_order>());\n            clang::SourceLocation const* header_bdes_ident(\n                check_order(d_analyser, data.d_header, true));\n            clang::SourceLocation const* source_bdes_ident(\n                check_order(d_analyser, data.d_source, false));\n            if ((header_bdes_ident == 0) != (source_bdes_ident == 0)) {\n                d_analyser->report(*(header_bdes_ident ? header_bdes_ident :\n                                                         source_bdes_ident),\n                                   check_name, \"SHO08\",\n                                   \"bdes_ident.h is used inconsistently with \"\n                                   \"the %0\")\n                    << (header_bdes_ident ? \"source\" : \"header\");\n            }\n        }\n\n        bde_verify::csabase::Analyser* d_analyser;\n    };\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic void\nsubscribe(bde_verify::csabase::Analyser& analyser, bde_verify::csabase::Visitor&, bde_verify::csabase::PPObserver& observer)\n{\n    analyser.onTranslationUnitDone += binder(&analyser);\n    observer.onInclude             += binder(&analyser);\n    observer.onIfndef              += binder(&analyser);\n    observer.onIf                  += binder(&analyser);\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic bde_verify::csabase::RegisterCheck register_observer(check_name, &subscribe);\n<commit_msg>Treat \"bdl\" like \"bsl\".<commit_after>\/\/ csastil_includeorder.cpp                                           -*-C++-*-\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2012 Dietmar Kuehl http:\/\/www.dietmar-kuehl.de              \n\/\/ Distributed under the Boost Software License, Version 1.0. (See file  \n\/\/ LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt).     \n\/\/ ----------------------------------------------------------------------------\n\n#include <csabase_analyser.h>\n#include <csabase_location.h>\n#include <csabase_ppobserver.h>\n#include <csabase_registercheck.h>\n#include <csabase_util.h>\n#include <cctype>\n#include <algorithm>\n#include <functional>\n#include <utility>\n#include <vector>\n\nnamespace CB = bde_verify::csabase;\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic std::string const check_name(\"include-order\");\n\n\/\/ ----------------------------------------------------------------------------\n\nnamespace\n{\n    struct include_order\n    {\n        typedef std::vector<std::pair<std::string, clang::SourceLocation> > headers_t;\n        headers_t d_header;\n        headers_t d_source;\n        void add_include(bool                         in_header,\n                         std::string                  header,\n                         clang::SourceLocation const& where)\n        {\n            std::string::size_type pos(header.find('.'));\n            if (pos != header.npos) {\n                header = header.substr(0u, pos);\n            }\n            \n            headers_t& headers(in_header? d_header: d_source);\n            if (headers.empty() || headers.back().first != header) {\n                headers.push_back(std::make_pair(header, where));\n            }\n        }\n    };\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nnamespace\n{\n    struct has_prefix\n    {\n        typedef std::pair<std::string, clang::SourceLocation> const& argument_type;\n        has_prefix(std::string const& prefix)\n            : d_prefix(prefix)\n        {\n        }\n        bool operator()(argument_type entry) const\n        {\n            return entry.first.find(d_prefix) == 0;\n        }\n        std::string d_prefix;\n    };\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic bool\nfirst_is_greater(std::pair<std::string, clang::SourceLocation> const& entry0,\n                 std::pair<std::string, clang::SourceLocation> const& entry1)\n{\n    return entry1.first < entry0.first;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic bool\nis_component(std::pair<std::string, clang::SourceLocation> const& entry)\n{\n    std::string const&     header(entry.first);\n    std::string::size_type start(header.find(\"a_\") == 0 || header.find(\"e_\") == 0? 2: 0);\n    std::string::size_type under(header.find('_', 0));\n    return under != header.npos && 4 < under - start && under - start < 8;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic void\ncheck_order(CB::Analyser*                              analyser,\n            std::string const&                         message,\n            include_order::headers_t::const_iterator it,\n            include_order::headers_t::const_iterator end)\n{\n    for (; end != (it = std::adjacent_find(it, end, &first_is_greater));\n         ++it) {\n        analyser->report(it[1].second, check_name, \"SHO01\",\n                         \"%0 header out of order\")\n            << message;\n    }\n}\n\nstatic void\ncheck_order(CB::Analyser*                              analyser,\n            std::string const&                         message,\n            include_order::headers_t::const_iterator it,\n            include_order::headers_t::const_iterator section_end,\n            include_order::headers_t::const_iterator end)\n{\n    check_order(analyser, message, it, section_end);\n    for (it = section_end;\n         end != (it = std::find_if(it, end, has_prefix(analyser->package() + \"_\")));\n         ++it) {\n        analyser->report(it->second, check_name, \"SHO02\",\n                         \"%0 header coming late\")\n            << message;\n    }\n}\n\nstatic clang::SourceLocation const*\ncheck_order(CB::Analyser*                   analyser,\n            include_order::headers_t const& headers,\n            bool                            header)\n{\n    clang::SourceLocation const* bdes_ident_location(0);\n    if (headers.empty()) {\n        analyser->report(clang::SourceLocation(), check_name, \"SHO03\",\n                         header\n                         ? \"Header without include guard included\"\n                         : \"Source without component include\");\n        return bdes_ident_location;\n    }\n    include_order::headers_t::const_iterator it(headers.begin());\n    if (it->first != analyser->component() || it++ == headers.end()) {\n        analyser->report(headers[0].second, check_name, \"SHO04\",\n                         header\n                         ? \"Header without or with wrong include guard\"\n                         : \"Source doesn't include component header first\");\n    }\n    std::string ident =\n        analyser->group() == \"bsl\" || analyser->group() == \"bdl\" ?\n            \"bsls_ident\" : \"bdes_ident\";\n    if (analyser->component() == ident ||\n        (analyser->is_test_driver() && !header)) {\n        if (it != headers.end()) {\n            if (it->first == \"bdes_ident\") {\n                bdes_ident_location = &it->second;\n            }\n            if (it->first == ident) {\n                ++it;\n            }\n        }\n    }\n    else if (it == headers.end() || it->first != ident) {\n        analyser->report((it == headers.end() ? it - 1: it)->second,\n                         check_name, \"SHO06\",\n                         \"Missing include for %0.h\")\n            << ident;\n    }\n    else {\n        if (it->first == \"bdes_ident\") {\n            bdes_ident_location = &it->second;\n        }\n        ++it;\n    }\n\n    std::string version = analyser->group() + \"scm_version\";\n    if (   analyser->component() != version\n        && header\n        && (it == headers.end()\n            || it->first != version\n            || it++ == headers.end())) {\n        analyser->report((it == headers.end() ? it - 1 : it)->second,\n                         check_name, \"SHO07\",\n                         \"Missing include for %0.h\")\n            << version;\n    }\n\n    include_order::headers_t::const_iterator end\n          = std::find_if(it, headers.end(),\n                         std::not1(std::ptr_fun(&is_component)));\n    include_order::headers_t::const_iterator package_end\n          = std::find_if(it, end, std::not1(has_prefix(analyser->package() + \"_\")));\n    check_order(analyser, \"Package\", it, package_end, end);\n    include_order::headers_t::const_iterator group_end\n          = std::find_if(it, end, std::not1(has_prefix(analyser->group())));\n    check_order(analyser, \"Group\", package_end, group_end, end);\n    check_order(analyser, \"Component\", group_end, end);\n\n    return bdes_ident_location;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic inline bool\nis_space(unsigned char c)\n{\n    return std::isspace(c);\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nnamespace\n{\n    std::string const prefix0(\"included_\");\n    std::string const prefix1(\"!defined(included_\");\n    std::string const prefix2(\"!definedincluded_\");\n\n    struct binder\n    {\n        binder(bde_verify::csabase::Analyser* analyser)\n            : d_analyser(analyser)\n        {\n        }\n\n        void operator()(clang::SourceLocation,\n                        clang::SourceRange range) const \/\/ onIf\n        {\n            if (!d_analyser->is_component(range.getBegin())) {\n                return;\n            }\n            include_order& data(d_analyser->attachment<include_order>()); \n            char const* begin(d_analyser->manager().getCharacterData(range.getBegin()));\n            char const* end(d_analyser->manager().getCharacterData(range.getEnd()));\n            std::string value(begin, end);\n            value.erase(std::remove_if(value.begin(), value.end(),\n                                       &is_space), value.end());\n            value = bde_verify::csabase::to_lower(value);\n            if (value.find(prefix1) == 0 && value[value.size() - 1] == ')') {\n                data.add_include(d_analyser->is_component_header(range.getBegin()),\n                                 value.substr(prefix1.size(), value.size() - prefix1.size() - 1),\n                                 range.getBegin());\n            }\n            else if (value.find(prefix2) == 0) {\n                data.add_include(d_analyser->is_component_header(range.getBegin()),\n                                 value.substr(prefix2.size()),\n                                 range.getBegin());\n            }\n        }\n        void operator()(clang::SourceLocation where,\n                        clang::Token const& token) const \/\/ onIfndef\n        {\n            if (!d_analyser->is_component(token.getLocation())) {\n                return;\n            }\n\n            include_order& data(d_analyser->attachment<include_order>());\n            if (clang::IdentifierInfo const* id = token.getIdentifierInfo())\n            {\n                std::string value(id->getNameStart());\n                value = bde_verify::csabase::to_lower(value);\n                if (value.find(prefix0) == 0) {\n                    data.add_include(d_analyser->is_component_header(token.getLocation()),\n                                     value.substr(prefix0.size()),\n                                     token.getLocation());\n                }\n            }\n        }\n        void operator()(clang::SourceLocation where,\n                        bool,\n                        std::string const& name)\n        {\n            if (d_analyser->is_component(where)) {\n                include_order& data(d_analyser->attachment<include_order>()); \n                bool in_header(d_analyser->is_component_header(where));\n                data.add_include(in_header, name, where);\n            }\n        }\n        void operator()()  \/\/ translation unit done\n        {\n            include_order& data(d_analyser->attachment<include_order>());\n            clang::SourceLocation const* header_bdes_ident(\n                check_order(d_analyser, data.d_header, true));\n            clang::SourceLocation const* source_bdes_ident(\n                check_order(d_analyser, data.d_source, false));\n            if ((header_bdes_ident == 0) != (source_bdes_ident == 0)) {\n                d_analyser->report(*(header_bdes_ident ? header_bdes_ident :\n                                                         source_bdes_ident),\n                                   check_name, \"SHO08\",\n                                   \"bdes_ident.h is used inconsistently with \"\n                                   \"the %0\")\n                    << (header_bdes_ident ? \"source\" : \"header\");\n            }\n        }\n\n        bde_verify::csabase::Analyser* d_analyser;\n    };\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic void\nsubscribe(bde_verify::csabase::Analyser& analyser, bde_verify::csabase::Visitor&, bde_verify::csabase::PPObserver& observer)\n{\n    analyser.onTranslationUnitDone += binder(&analyser);\n    observer.onInclude             += binder(&analyser);\n    observer.onIfndef              += binder(&analyser);\n    observer.onIf                  += binder(&analyser);\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nstatic bde_verify::csabase::RegisterCheck register_observer(check_name, &subscribe);\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\n * $Id$\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.refractions.net\n *\n * Copyright (C) 2006 Refractions Research 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: operation\/linemerge\/LineSequencer.java rev. 1.5 (JTS-1.7)\n *\n **********************************************************************\/\n\n#include <geos\/operation\/linemerge\/LineSequencer.h>\n#include <geos\/operation\/linemerge\/LineMergeEdge.h>\n#include <geos\/geom\/Geometry.h>\n#include <geos\/geom\/GeometryFactory.h>\n#include <geos\/geom\/MultiLineString.h>\n#include <geos\/geom\/Coordinate.h>\n#include <geos\/geom\/CoordinateSequence.h>\n#include <geos\/geom\/LineString.h>\n#include <geos\/planargraph\/Node.h>\n#include <geos\/planargraph\/DirectedEdge.h>\n#include <geos\/planargraph\/Subgraph.h>\n#include <geos\/planargraph\/algorithm\/ConnectedSubgraphFinder.h>\n\n#include <cassert>\n#include <limits>\n#include <vector>\n\nusing namespace std;\n\/\/using namespace geos::planargraph;\nusing namespace geos::geom;\n\/\/using namespace geos::planargraph::algorithm;\n\nnamespace geos {\nnamespace operation { \/\/ geos.operation\nnamespace linemerge { \/\/ geos.operation.linemerge\n\n\/* static *\/\nbool\nLineSequencer::isSequenced(const Geometry* geom)\n{\n\tconst MultiLineString *mls;\n\n\tif ( ! (mls=dynamic_cast<const MultiLineString *>(geom)) )\n\t{\n\t\treturn true;\n\t}\n\n\t\/\/ the nodes in all subgraphs which have been completely scanned\n\tCoordinate::ConstSet prevSubgraphNodes;\n\tCoordinate::ConstVect currNodes;\n\n\tconst Coordinate* lastNode = NULL;\n\n\tfor (unsigned int i=0, n=mls->getNumGeometries(); i<n; ++i)\n\t{\n\t\tassert(dynamic_cast<const LineString*>(mls->getGeometryN(i)));\n\n\t\tconst LineString& line = \\\n\t\t\tstatic_cast<const LineString&>(*(mls->getGeometryN(i)));\n\n\t\tconst Coordinate* startNode = &(line.getCoordinateN(0));\n\t\tconst Coordinate* endNode = &(line.getCoordinateN(line.getNumPoints() - 1));\n\n\t\t\/**\n\t\t * If this linestring is connected to a previous subgraph,\n\t\t * geom is not sequenced\n\t\t *\/\n\t\tif (prevSubgraphNodes.find(startNode) != prevSubgraphNodes.end())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tif (prevSubgraphNodes.find(endNode) != prevSubgraphNodes.end())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif (lastNode != NULL)\n\t\t{\n\t\t\tif (! startNode->equals2D(*lastNode))\n\t\t\t{\n\t\t\t\t\/\/ start new connected sequence\n\t\t\t\tprevSubgraphNodes.insert(currNodes.begin(),\n\t\t\t\t\t\tcurrNodes.end());\n\t\t\t\tcurrNodes.clear();\n\t\t\t}\n\t\t}\n\t\tcurrNodes.push_back(startNode);\n\t\tcurrNodes.push_back(endNode);\n\t\tlastNode = endNode;\n\t}\n\treturn true;\n} \n\n\/* private *\/\nbool\nLineSequencer::hasSequence(planargraph::Subgraph& graph)\n{\n\tint oddDegreeCount = 0;\n\tfor (planargraph::NodeMap::container::const_iterator\n\t\tit=graph.nodeBegin(), endIt=graph.nodeEnd();\n\t\tit!=endIt;\n\t\t++it)\n\t{\n\t\tplanargraph::Node* node = it->second;\n\t\tif (node->getDegree() % 2 == 1)\n\t\toddDegreeCount++;\n\t}\n\treturn oddDegreeCount <= 2;\n}\n\n\n\/*private*\/\nLineSequencer::Sequences*\nLineSequencer::findSequences()\n{\n\tSequences *sequences = new Sequences();\n\tplanargraph::algorithm::ConnectedSubgraphFinder csFinder(graph);\n\tvector<planargraph::Subgraph*>subgraphs;\n\tcsFinder.getConnectedSubgraphs(subgraphs);\n\tfor (vector<planargraph::Subgraph*>::const_iterator\n\t\tit=subgraphs.begin(), endIt=subgraphs.end();\n\t\tit!=endIt;\n\t\t++it )\n\t{\n\t\tplanargraph::Subgraph* subgraph = *it;\n\t\tif (hasSequence(*subgraph)) {\n\t\t\tplanargraph::DirectedEdge::NonConstList* seq=findSequence(*subgraph);\n\t\t\tsequences->push_back(seq);\n\t\t}\n\t\telse {\n\t\t\t\/\/ if any subgraph cannot be sequenced, abort\n\t\t\treturn NULL;\n\t\t}\n\t}\n\treturn sequences;\n}\n\n\/*private*\/\nvoid\nLineSequencer::addLine(const LineString *lineString)\n{\n\tif (factory == NULL) {\n\t\tfactory = lineString->getFactory();\n\t}\n\tgraph.addEdge(lineString);\n\t++lineCount;\n}\n\n\/* private *\/\nvoid\nLineSequencer::computeSequence()\n{\n\tif (isRun) return;\n\tisRun = true;\n\n\tSequences* sequences(findSequences());\n\tif (sequences == NULL) return;\n\n\tsequencedGeometry = auto_ptr<Geometry>(buildSequencedGeometry(*sequences));\n\tisSequenceableVar = true;\n\n\t\/\/ Lines were missing from result\n\tassert(lineCount == sequencedGeometry->getNumGeometries());\n\n\t\/\/ Result is not linear\n\tassert(dynamic_cast<LineString *>(sequencedGeometry.get())\n\t\t|| dynamic_cast<MultiLineString *>(sequencedGeometry.get())); \n}\n\n\/*private*\/\nGeometry*\nLineSequencer::buildSequencedGeometry(const Sequences& sequences)\n{\n\tauto_ptr<Geometry::NonConstVect> lines(new Geometry::NonConstVect);\n\n\tfor (Sequences::const_iterator\n\t\ti1=sequences.begin(), i1End=sequences.end();\n\t\ti1 != i1End;\n\t\t++i1)\n\t{\n\t\tplanargraph::DirectedEdge::NonConstList& seq = *(*i1);\n\t\tfor(planargraph::DirectedEdge::NonConstList::iterator i2=seq.begin(),\n\t\t\ti2End=seq.end(); i2 != i2End; ++i2)\n\t\t{\n\t\t\tconst planargraph::DirectedEdge* de = *i2;\n\t\t\tassert(dynamic_cast<LineMergeEdge* >(de->getEdge()));\n\t\t\tLineMergeEdge* e = static_cast<LineMergeEdge* >(de->getEdge());\n\t\t\tconst LineString* line = e->getLine();\n\n\t\t\t\/\/ lineToAdd will be a *copy* of input things\n\t\t\tLineString* lineToAdd;\n\n\t\t\tif ( ! de->getEdgeDirection() && ! line->isClosed() ) {\n\t\t\t\tlineToAdd = reverse(line);\n\t\t\t} else {\n\t\t\t\tGeometry* lineClone = line->clone();\n\t\t\t\tassert(dynamic_cast<LineString *>(lineClone));\n\t\t\t\tlineToAdd = static_cast<LineString *>(lineClone); \n\t\t\t}\n\n\t\t\tlines->push_back(lineToAdd);\n\t\t}\n\t}\n\n\tif ( lines->size() == 0 ) {\n\t\treturn NULL;\n\t} else {\n\t\tGeometry::NonConstVect *l=lines.get();\n\t\tlines.release();\n\t\treturn factory->buildGeometry(l);\n\t}\n}\n\n\/*static private*\/\nLineString *\nLineSequencer::reverse(const LineString *line)\n{\n\tCoordinateSequence* cs=line->getCoordinates();\n\tCoordinateSequence::reverse(cs);\n\treturn line->getFactory()->createLineString(cs);\n}\n\n\/*private static*\/\nconst planargraph::Node*\nLineSequencer::findLowestDegreeNode(const planargraph::Subgraph& graph)\n{\n\tint minDegree = numeric_limits<int>::max(); \n\tconst planargraph::Node* minDegreeNode = NULL;\n\tfor (planargraph::NodeMap::container::const_iterator\n\t\tit = graph.nodeBegin(), itEnd = graph.nodeEnd();\n\t\tit != itEnd;\n\t\t++it )\n\t{\n\t\tconst planargraph::Node* node = (*it).second;\n\t\tif (minDegreeNode == NULL || node->getDegree() < minDegree)\n\t\t{\n\t\t\tminDegree = node->getDegree();\n\t\t\tminDegreeNode = node;\n\t\t}\n\t}\n\treturn minDegreeNode;\n}\n\n\/*private static*\/\nconst planargraph::DirectedEdge*\nLineSequencer::findUnvisitedBestOrientedDE(const planargraph::Node* node)\n{\n\tusing planargraph::DirectedEdge;\n\tusing planargraph::DirectedEdgeStar;\n\n\tconst DirectedEdge* wellOrientedDE = NULL;\n\tconst DirectedEdge* unvisitedDE = NULL;\n\tconst DirectedEdgeStar* des=node->getOutEdges();\n\tfor (DirectedEdge::NonConstVect::const_iterator i=des->begin(),\n\t\te=des->end();\n\t\ti!=e;\n\t\t++i)\n\t{\n\t\tplanargraph::DirectedEdge* de = *i;\n\t\tif (! de->getEdge()->isVisited()) {\n\t\t\tunvisitedDE = de;\n\t\t\tif (de->getEdgeDirection()) wellOrientedDE = de;\n\t\t}\n\t}\n\tif (wellOrientedDE != NULL)\n\t\treturn wellOrientedDE;\n\treturn unvisitedDE;\n}\n\n\n\/*private*\/\nvoid\nLineSequencer::addReverseSubpath(const planargraph::DirectedEdge *de,\n\t\tplanargraph::DirectedEdge::NonConstList& deList,\n\t\tplanargraph::DirectedEdge::NonConstList::iterator lit,\n\t\tbool expectedClosed)\n{\n\tusing planargraph::Node;\n\tusing planargraph::DirectedEdge;\n\n\t\/\/ trace an unvisited path *backwards* from this de\n\tNode* endNode = de->getToNode();\n\n\tNode* fromNode = NULL;\n\twhile (true) {\n\t\tdeList.insert(lit, de->getSym());\n\t\tde->getEdge()->setVisited(true);\n\t\tfromNode = de->getFromNode();\n\t\tconst DirectedEdge* unvisitedOutDE = findUnvisitedBestOrientedDE(fromNode);\n\n\t\t\/\/ this must terminate, since we are continually marking edges as visited\n\t\tif (unvisitedOutDE == NULL) break;\n\t\tde = unvisitedOutDE->getSym();\n\t}\n\tif ( expectedClosed ) {\n\t\t\/\/ the path should end at the toNode of this de,\n\t\t\/\/ otherwise we have an error\n\t\tassert(fromNode == endNode);\n\t}\n\n}\n\n\/*private*\/\nplanargraph::DirectedEdge::NonConstList* \nLineSequencer::findSequence(planargraph::Subgraph& graph)\n{\n\tusing planargraph::DirectedEdge;\n\tusing planargraph::Node;\n\tusing planargraph::GraphComponent;\n\n\tGraphComponent::setVisited(graph.edgeBegin(),\n\t\t\tgraph.edgeEnd(), false);\n\n\tconst Node* startNode = findLowestDegreeNode(graph);\n\n\tconst DirectedEdge *startDE = *(startNode->getOutEdges()->begin());\n\tconst DirectedEdge *startDESym = startDE->getSym();\n\n\tDirectedEdge::NonConstList *seq = new DirectedEdge::NonConstList();\n\n\tDirectedEdge::NonConstList::iterator lit=seq->begin();\n\taddReverseSubpath(startDESym, *seq, lit, false);\n\n\tlit=seq->end();\n\twhile (lit != seq->begin()) {\n\t\tconst DirectedEdge* prev = *(--lit);\n\t\tconst DirectedEdge* unvisitedOutDE = findUnvisitedBestOrientedDE(prev->getFromNode());\n\t\tif (unvisitedOutDE != NULL)\n\t\t\taddReverseSubpath(unvisitedOutDE->getSym(), *seq, lit, true);\n\t}\n\n\t\/\/ At this point, we have a valid sequence of graph DirectedEdges,\n\t\/\/ but it is not necessarily appropriately oriented relative to\n\t\/\/ the underlying geometry.\n\tDirectedEdge::NonConstList* orientedSeq = orient(seq);\n\n\tif (orientedSeq != seq) delete seq;\n\n\treturn orientedSeq;\n}\n\n\/* private *\/\nplanargraph::DirectedEdge::NonConstList* \nLineSequencer::orient(planargraph::DirectedEdge::NonConstList* seq) \n{\n\tusing namespace geos::planargraph;\n\n\tconst DirectedEdge* startEdge = seq->front();\n\tconst DirectedEdge* endEdge = seq->back();\n\tNode* startNode = startEdge->getFromNode();\n\tNode* endNode = endEdge->getToNode();\n\n\tbool flipSeq = false;\n\tbool hasDegree1Node = \\\n\t\tstartNode->getDegree() == 1 || endNode->getDegree() == 1;\n\n\tif (hasDegree1Node)\n\t{\n\t\tbool hasObviousStartNode = false;\n\n\t\t\/\/ test end edge before start edge, to make result stable\n\t\t\/\/ (ie. if both are good starts, pick the actual start\n\t\tif (endEdge->getToNode()->getDegree() == 1 &&\n\t\t\t\tendEdge->getEdgeDirection() == false)\n\t\t{\n\t\t\thasObviousStartNode = true;\n\t\t\tflipSeq = true;\n\t\t}\n\t\tif (startEdge->getFromNode()->getDegree() == 1 && \n\t\t\t\tstartEdge->getEdgeDirection() == true)\n\t\t{\n\t\t\thasObviousStartNode = true;\n\t\t\tflipSeq = false;\n\t\t}\n\n\t\t\/\/ since there is no obvious start node,\n\t\t\/\/ use any node of degree 1\n\t\tif (! hasObviousStartNode)\n\t\t{\n\t\t\t\/\/ check if the start node should actually\n\t\t\t\/\/ be the end node\n\t\t\tif (startEdge->getFromNode()->getDegree() == 1)\n\t\t\t\tflipSeq = true;\n\t\t\t\/\/ if the end node is of degree 1, it is\n\t\t\t\/\/ properly the end node\n\t\t}\n\n\t}\n\n\n\t\/\/ if there is no degree 1 node, just use the sequence as is\n\t\/\/ (Could insert heuristic of taking direction of majority of\n\t\/\/ lines as overall direction)\n\n\tif (flipSeq)\n\t{\n\t\treturn reverse(*seq);\n\t}\n\treturn seq;\n}\n\n\/* private *\/\nplanargraph::DirectedEdge::NonConstList* \nLineSequencer::reverse(planargraph::DirectedEdge::NonConstList& seq)\n{\n\tusing namespace geos::planargraph;\n\n\tDirectedEdge::NonConstList* newSeq = new DirectedEdge::NonConstList();\n\tDirectedEdge::NonConstList::iterator it=seq.begin(), itEnd=seq.end();\n\tfor (; it!=itEnd; ++it) {\n\t\tconst DirectedEdge *de = *it;\n\t\tnewSeq->push_front(de->getSym());\n\t}\n\treturn newSeq;\n}\n\n \n\n} \/\/ namespace geos.operation.linemerge\n} \/\/ namespace geos.operation\n} \/\/ namespace geos\n\n\/**********************************************************************\n * $Log$\n * Revision 1.8  2006\/03\/24 10:44:07  strk\n * Fixed to build with -DNDEBUG\n *\n * Revision 1.7  2006\/03\/22 10:13:54  strk\n * opLinemerge.h split\n *\n * Revision 1.6  2006\/03\/21 21:42:54  strk\n * planargraph.h header split, planargraph:: classes renamed to match JTS symbols\n *\n **********************************************************************\/\n<commit_msg>Changed assert() with Assert::isTrue in addReverseSubpath<commit_after>\/**********************************************************************\n * $Id$\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.refractions.net\n *\n * Copyright (C) 2006 Refractions Research 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: operation\/linemerge\/LineSequencer.java rev. 1.5 (JTS-1.7)\n *\n **********************************************************************\/\n\n#include <geos\/operation\/linemerge\/LineSequencer.h>\n#include <geos\/operation\/linemerge\/LineMergeEdge.h>\n#include <geos\/geom\/Geometry.h>\n#include <geos\/geom\/GeometryFactory.h>\n#include <geos\/geom\/MultiLineString.h>\n#include <geos\/geom\/Coordinate.h>\n#include <geos\/geom\/CoordinateSequence.h>\n#include <geos\/geom\/LineString.h>\n#include <geos\/planargraph\/Node.h>\n#include <geos\/planargraph\/DirectedEdge.h>\n#include <geos\/planargraph\/Subgraph.h>\n#include <geos\/planargraph\/algorithm\/ConnectedSubgraphFinder.h>\n#include <geos\/util\/Assert.h>\n\n#include <cassert>\n#include <limits>\n#include <vector>\n\nusing namespace std;\n\/\/using namespace geos::planargraph;\nusing namespace geos::geom;\n\/\/using namespace geos::planargraph::algorithm;\n\nnamespace geos {\nnamespace operation { \/\/ geos.operation\nnamespace linemerge { \/\/ geos.operation.linemerge\n\n\/* static *\/\nbool\nLineSequencer::isSequenced(const Geometry* geom)\n{\n\tconst MultiLineString *mls;\n\n\tif ( ! (mls=dynamic_cast<const MultiLineString *>(geom)) )\n\t{\n\t\treturn true;\n\t}\n\n\t\/\/ the nodes in all subgraphs which have been completely scanned\n\tCoordinate::ConstSet prevSubgraphNodes;\n\tCoordinate::ConstVect currNodes;\n\n\tconst Coordinate* lastNode = NULL;\n\n\tfor (unsigned int i=0, n=mls->getNumGeometries(); i<n; ++i)\n\t{\n\t\tassert(dynamic_cast<const LineString*>(mls->getGeometryN(i)));\n\n\t\tconst LineString& line = \\\n\t\t\tstatic_cast<const LineString&>(*(mls->getGeometryN(i)));\n\n\t\tconst Coordinate* startNode = &(line.getCoordinateN(0));\n\t\tconst Coordinate* endNode = &(line.getCoordinateN(line.getNumPoints() - 1));\n\n\t\t\/**\n\t\t * If this linestring is connected to a previous subgraph,\n\t\t * geom is not sequenced\n\t\t *\/\n\t\tif (prevSubgraphNodes.find(startNode) != prevSubgraphNodes.end())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tif (prevSubgraphNodes.find(endNode) != prevSubgraphNodes.end())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif (lastNode != NULL)\n\t\t{\n\t\t\tif (! startNode->equals2D(*lastNode))\n\t\t\t{\n\t\t\t\t\/\/ start new connected sequence\n\t\t\t\tprevSubgraphNodes.insert(currNodes.begin(),\n\t\t\t\t\t\tcurrNodes.end());\n\t\t\t\tcurrNodes.clear();\n\t\t\t}\n\t\t}\n\t\tcurrNodes.push_back(startNode);\n\t\tcurrNodes.push_back(endNode);\n\t\tlastNode = endNode;\n\t}\n\treturn true;\n} \n\n\/* private *\/\nbool\nLineSequencer::hasSequence(planargraph::Subgraph& graph)\n{\n\tint oddDegreeCount = 0;\n\tfor (planargraph::NodeMap::container::const_iterator\n\t\tit=graph.nodeBegin(), endIt=graph.nodeEnd();\n\t\tit!=endIt;\n\t\t++it)\n\t{\n\t\tplanargraph::Node* node = it->second;\n\t\tif (node->getDegree() % 2 == 1)\n\t\toddDegreeCount++;\n\t}\n\treturn oddDegreeCount <= 2;\n}\n\n\n\/*private*\/\nLineSequencer::Sequences*\nLineSequencer::findSequences()\n{\n\tSequences *sequences = new Sequences();\n\tplanargraph::algorithm::ConnectedSubgraphFinder csFinder(graph);\n\tvector<planargraph::Subgraph*>subgraphs;\n\tcsFinder.getConnectedSubgraphs(subgraphs);\n\tfor (vector<planargraph::Subgraph*>::const_iterator\n\t\tit=subgraphs.begin(), endIt=subgraphs.end();\n\t\tit!=endIt;\n\t\t++it )\n\t{\n\t\tplanargraph::Subgraph* subgraph = *it;\n\t\tif (hasSequence(*subgraph)) {\n\t\t\tplanargraph::DirectedEdge::NonConstList* seq=findSequence(*subgraph);\n\t\t\tsequences->push_back(seq);\n\t\t}\n\t\telse {\n\t\t\t\/\/ if any subgraph cannot be sequenced, abort\n\t\t\treturn NULL;\n\t\t}\n\t}\n\treturn sequences;\n}\n\n\/*private*\/\nvoid\nLineSequencer::addLine(const LineString *lineString)\n{\n\tif (factory == NULL) {\n\t\tfactory = lineString->getFactory();\n\t}\n\tgraph.addEdge(lineString);\n\t++lineCount;\n}\n\n\/* private *\/\nvoid\nLineSequencer::computeSequence()\n{\n\tif (isRun) return;\n\tisRun = true;\n\n\tSequences* sequences(findSequences());\n\tif (sequences == NULL) return;\n\n\tsequencedGeometry = auto_ptr<Geometry>(buildSequencedGeometry(*sequences));\n\tisSequenceableVar = true;\n\n\t\/\/ Lines were missing from result\n\tassert(lineCount == sequencedGeometry->getNumGeometries());\n\n\t\/\/ Result is not linear\n\tassert(dynamic_cast<LineString *>(sequencedGeometry.get())\n\t\t|| dynamic_cast<MultiLineString *>(sequencedGeometry.get())); \n}\n\n\/*private*\/\nGeometry*\nLineSequencer::buildSequencedGeometry(const Sequences& sequences)\n{\n\tauto_ptr<Geometry::NonConstVect> lines(new Geometry::NonConstVect);\n\n\tfor (Sequences::const_iterator\n\t\ti1=sequences.begin(), i1End=sequences.end();\n\t\ti1 != i1End;\n\t\t++i1)\n\t{\n\t\tplanargraph::DirectedEdge::NonConstList& seq = *(*i1);\n\t\tfor(planargraph::DirectedEdge::NonConstList::iterator i2=seq.begin(),\n\t\t\ti2End=seq.end(); i2 != i2End; ++i2)\n\t\t{\n\t\t\tconst planargraph::DirectedEdge* de = *i2;\n\t\t\tassert(dynamic_cast<LineMergeEdge* >(de->getEdge()));\n\t\t\tLineMergeEdge* e = static_cast<LineMergeEdge* >(de->getEdge());\n\t\t\tconst LineString* line = e->getLine();\n\n\t\t\t\/\/ lineToAdd will be a *copy* of input things\n\t\t\tLineString* lineToAdd;\n\n\t\t\tif ( ! de->getEdgeDirection() && ! line->isClosed() ) {\n\t\t\t\tlineToAdd = reverse(line);\n\t\t\t} else {\n\t\t\t\tGeometry* lineClone = line->clone();\n\t\t\t\tassert(dynamic_cast<LineString *>(lineClone));\n\t\t\t\tlineToAdd = static_cast<LineString *>(lineClone); \n\t\t\t}\n\n\t\t\tlines->push_back(lineToAdd);\n\t\t}\n\t}\n\n\tif ( lines->size() == 0 ) {\n\t\treturn NULL;\n\t} else {\n\t\tGeometry::NonConstVect *l=lines.get();\n\t\tlines.release();\n\t\treturn factory->buildGeometry(l);\n\t}\n}\n\n\/*static private*\/\nLineString *\nLineSequencer::reverse(const LineString *line)\n{\n\tCoordinateSequence* cs=line->getCoordinates();\n\tCoordinateSequence::reverse(cs);\n\treturn line->getFactory()->createLineString(cs);\n}\n\n\/*private static*\/\nconst planargraph::Node*\nLineSequencer::findLowestDegreeNode(const planargraph::Subgraph& graph)\n{\n\tint minDegree = numeric_limits<int>::max(); \n\tconst planargraph::Node* minDegreeNode = NULL;\n\tfor (planargraph::NodeMap::container::const_iterator\n\t\tit = graph.nodeBegin(), itEnd = graph.nodeEnd();\n\t\tit != itEnd;\n\t\t++it )\n\t{\n\t\tconst planargraph::Node* node = (*it).second;\n\t\tif (minDegreeNode == NULL || node->getDegree() < minDegree)\n\t\t{\n\t\t\tminDegree = node->getDegree();\n\t\t\tminDegreeNode = node;\n\t\t}\n\t}\n\treturn minDegreeNode;\n}\n\n\/*private static*\/\nconst planargraph::DirectedEdge*\nLineSequencer::findUnvisitedBestOrientedDE(const planargraph::Node* node)\n{\n\tusing planargraph::DirectedEdge;\n\tusing planargraph::DirectedEdgeStar;\n\n\tconst DirectedEdge* wellOrientedDE = NULL;\n\tconst DirectedEdge* unvisitedDE = NULL;\n\tconst DirectedEdgeStar* des=node->getOutEdges();\n\tfor (DirectedEdge::NonConstVect::const_iterator i=des->begin(),\n\t\te=des->end();\n\t\ti!=e;\n\t\t++i)\n\t{\n\t\tplanargraph::DirectedEdge* de = *i;\n\t\tif (! de->getEdge()->isVisited()) {\n\t\t\tunvisitedDE = de;\n\t\t\tif (de->getEdgeDirection()) wellOrientedDE = de;\n\t\t}\n\t}\n\tif (wellOrientedDE != NULL)\n\t\treturn wellOrientedDE;\n\treturn unvisitedDE;\n}\n\n\n\/*private*\/\nvoid\nLineSequencer::addReverseSubpath(const planargraph::DirectedEdge *de,\n\t\tplanargraph::DirectedEdge::NonConstList& deList,\n\t\tplanargraph::DirectedEdge::NonConstList::iterator lit,\n\t\tbool expectedClosed)\n{\n\tusing planargraph::Node;\n\tusing planargraph::DirectedEdge;\n\n\t\/\/ trace an unvisited path *backwards* from this de\n\tNode* endNode = de->getToNode();\n\n\tNode* fromNode = NULL;\n\twhile (true) {\n\t\tdeList.insert(lit, de->getSym());\n\t\tde->getEdge()->setVisited(true);\n\t\tfromNode = de->getFromNode();\n\t\tconst DirectedEdge* unvisitedOutDE = findUnvisitedBestOrientedDE(fromNode);\n\n\t\t\/\/ this must terminate, since we are continually marking edges as visited\n\t\tif (unvisitedOutDE == NULL) break;\n\t\tde = unvisitedOutDE->getSym();\n\t}\n\tif ( expectedClosed ) {\n\t\t\/\/ the path should end at the toNode of this de,\n\t\t\/\/ otherwise we have an error\n\t\tutil::Assert::isTrue(fromNode == endNode, \"path not contiguos\");\n\t\t\/\/assert(fromNode == endNode);\n\t}\n\n}\n\n\/*private*\/\nplanargraph::DirectedEdge::NonConstList* \nLineSequencer::findSequence(planargraph::Subgraph& graph)\n{\n\tusing planargraph::DirectedEdge;\n\tusing planargraph::Node;\n\tusing planargraph::GraphComponent;\n\n\tGraphComponent::setVisited(graph.edgeBegin(),\n\t\t\tgraph.edgeEnd(), false);\n\n\tconst Node* startNode = findLowestDegreeNode(graph);\n\n\tconst DirectedEdge *startDE = *(startNode->getOutEdges()->begin());\n\tconst DirectedEdge *startDESym = startDE->getSym();\n\n\tDirectedEdge::NonConstList *seq = new DirectedEdge::NonConstList();\n\n\tDirectedEdge::NonConstList::iterator lit=seq->begin();\n\taddReverseSubpath(startDESym, *seq, lit, false);\n\n\tlit=seq->end();\n\twhile (lit != seq->begin()) {\n\t\tconst DirectedEdge* prev = *(--lit);\n\t\tconst DirectedEdge* unvisitedOutDE = findUnvisitedBestOrientedDE(prev->getFromNode());\n\t\tif (unvisitedOutDE != NULL)\n\t\t\taddReverseSubpath(unvisitedOutDE->getSym(), *seq, lit, true);\n\t}\n\n\t\/\/ At this point, we have a valid sequence of graph DirectedEdges,\n\t\/\/ but it is not necessarily appropriately oriented relative to\n\t\/\/ the underlying geometry.\n\tDirectedEdge::NonConstList* orientedSeq = orient(seq);\n\n\tif (orientedSeq != seq) delete seq;\n\n\treturn orientedSeq;\n}\n\n\/* private *\/\nplanargraph::DirectedEdge::NonConstList* \nLineSequencer::orient(planargraph::DirectedEdge::NonConstList* seq) \n{\n\tusing namespace geos::planargraph;\n\n\tconst DirectedEdge* startEdge = seq->front();\n\tconst DirectedEdge* endEdge = seq->back();\n\tNode* startNode = startEdge->getFromNode();\n\tNode* endNode = endEdge->getToNode();\n\n\tbool flipSeq = false;\n\tbool hasDegree1Node = \\\n\t\tstartNode->getDegree() == 1 || endNode->getDegree() == 1;\n\n\tif (hasDegree1Node)\n\t{\n\t\tbool hasObviousStartNode = false;\n\n\t\t\/\/ test end edge before start edge, to make result stable\n\t\t\/\/ (ie. if both are good starts, pick the actual start\n\t\tif (endEdge->getToNode()->getDegree() == 1 &&\n\t\t\t\tendEdge->getEdgeDirection() == false)\n\t\t{\n\t\t\thasObviousStartNode = true;\n\t\t\tflipSeq = true;\n\t\t}\n\t\tif (startEdge->getFromNode()->getDegree() == 1 && \n\t\t\t\tstartEdge->getEdgeDirection() == true)\n\t\t{\n\t\t\thasObviousStartNode = true;\n\t\t\tflipSeq = false;\n\t\t}\n\n\t\t\/\/ since there is no obvious start node,\n\t\t\/\/ use any node of degree 1\n\t\tif (! hasObviousStartNode)\n\t\t{\n\t\t\t\/\/ check if the start node should actually\n\t\t\t\/\/ be the end node\n\t\t\tif (startEdge->getFromNode()->getDegree() == 1)\n\t\t\t\tflipSeq = true;\n\t\t\t\/\/ if the end node is of degree 1, it is\n\t\t\t\/\/ properly the end node\n\t\t}\n\n\t}\n\n\n\t\/\/ if there is no degree 1 node, just use the sequence as is\n\t\/\/ (Could insert heuristic of taking direction of majority of\n\t\/\/ lines as overall direction)\n\n\tif (flipSeq)\n\t{\n\t\treturn reverse(*seq);\n\t}\n\treturn seq;\n}\n\n\/* private *\/\nplanargraph::DirectedEdge::NonConstList* \nLineSequencer::reverse(planargraph::DirectedEdge::NonConstList& seq)\n{\n\tusing namespace geos::planargraph;\n\n\tDirectedEdge::NonConstList* newSeq = new DirectedEdge::NonConstList();\n\tDirectedEdge::NonConstList::iterator it=seq.begin(), itEnd=seq.end();\n\tfor (; it!=itEnd; ++it) {\n\t\tconst DirectedEdge *de = *it;\n\t\tnewSeq->push_front(de->getSym());\n\t}\n\treturn newSeq;\n}\n\n \n\n} \/\/ namespace geos.operation.linemerge\n} \/\/ namespace geos.operation\n} \/\/ namespace geos\n\n\/**********************************************************************\n * $Log$\n * Revision 1.9  2006\/03\/24 11:04:44  strk\n * Changed assert() with Assert::isTrue in addReverseSubpath\n *\n * Revision 1.8  2006\/03\/24 10:44:07  strk\n * Fixed to build with -DNDEBUG\n *\n * Revision 1.7  2006\/03\/22 10:13:54  strk\n * opLinemerge.h split\n *\n * Revision 1.6  2006\/03\/21 21:42:54  strk\n * planargraph.h header split, planargraph:: classes renamed to match JTS symbols\n *\n **********************************************************************\/\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file\n * \\brief MutexControlBlock class implementation\n *\n * \\author Copyright (C) 2014 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 2014-11-07\n *\/\n\n#include \"distortos\/scheduler\/MutexControlBlock.hpp\"\n\n#include \"distortos\/scheduler\/getScheduler.hpp\"\n#include \"distortos\/scheduler\/Scheduler.hpp\"\n\nnamespace distortos\n{\n\nnamespace scheduler\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| public functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nMutexControlBlock::MutexControlBlock(const Protocol protocol, const uint8_t priorityCeiling) :\n\t\tblockedList_{getScheduler().getThreadControlBlockListAllocator(), ThreadControlBlock::State::BlockedOnMutex},\n\t\tlist_{},\n\t\titerator_{},\n\t\towner_{},\n\t\tprotocol_{protocol},\n\t\tpriorityCeiling_{priorityCeiling}\n{\n\n}\n\nvoid MutexControlBlock::block()\n{\n\tgetScheduler().block(blockedList_);\n}\n\nint MutexControlBlock::blockUntil(const TickClock::time_point timePoint)\n{\n\treturn getScheduler().blockUntil(blockedList_, timePoint);\n}\n\nuint8_t MutexControlBlock::getBoostedPriority() const\n{\n\tif (protocol_ == Protocol::PriorityInheritance)\n\t{\n\t\tif (blockedList_.empty() == true)\n\t\t\treturn 0;\n\t\treturn blockedList_.begin()->get().getEffectivePriority();\n\t}\n\n\tif (protocol_ == Protocol::PriorityProtect)\n\t\treturn priorityCeiling_;\n\n\treturn 0;\n}\n\nvoid MutexControlBlock::lock()\n{\n\tauto& scheduler = scheduler::getScheduler();\n\towner_ = &scheduler.getCurrentThreadControlBlock();\n\n\tif (protocol_ == Protocol::None)\n\t\treturn;\n\n\tscheduler.getMutexControlBlockListAllocatorPool().feed(link_);\n\tlist_ = &owner_->getOwnedProtocolMutexControlBlocksList();\n\tlist_->emplace_front(*this);\n\titerator_ = list_->begin();\n\n\tif (protocol_ == Protocol::PriorityProtect)\n\t\towner_->updateBoostedPriority();\n}\n\nvoid MutexControlBlock::unlockOrTransferLock()\n{\n\tauto& oldOwner = *owner_;\n\n\tif (blockedList_.empty() == false)\n\t\ttransferLock();\n\telse\n\t\tunlock();\n\n\tif (protocol_ == Protocol::None)\n\t\treturn;\n\n\toldOwner.updateBoostedPriority();\n\n\tif (owner_ == nullptr)\n\t\treturn;\n\n\towner_->updateBoostedPriority();\n}\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| private functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nvoid MutexControlBlock::priorityInheritanceBeforeBlock() const\n{\n\t\/\/ calling thread is not yet on the blocked list, that's why it's effective priority is given explicitly\n\towner_->updateBoostedPriority(getScheduler().getCurrentThreadControlBlock().getEffectivePriority());\n}\n\nvoid MutexControlBlock::transferLock()\n{\n\towner_ = &blockedList_.begin()->get();\t\/\/ pass ownership to the unblocked thread\n\tscheduler::getScheduler().unblock(blockedList_.begin());\n\n\tif (list_ == nullptr)\n\t\treturn;\n\n\tauto& oldList = *list_;\n\tlist_ = &owner_->getOwnedProtocolMutexControlBlocksList();\n\tlist_->splice(list_->begin(), oldList, iterator_);\n}\n\nvoid MutexControlBlock::unlock()\n{\n\towner_ = nullptr;\n\n\tif (list_ == nullptr)\n\t\treturn;\n\n\tlist_->erase(iterator_);\n\tlist_ = nullptr;\n}\n\n}\t\/\/ namespace scheduler\n\n}\t\/\/ namespace distortos\n<commit_msg>MutexControlBlock: call MutexControlBlock::priorityInheritanceBeforeBlock() in MutexControlBlock::block() and MutexControlBlock::blockUntil()<commit_after>\/**\n * \\file\n * \\brief MutexControlBlock class implementation\n *\n * \\author Copyright (C) 2014 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 2014-11-07\n *\/\n\n#include \"distortos\/scheduler\/MutexControlBlock.hpp\"\n\n#include \"distortos\/scheduler\/getScheduler.hpp\"\n#include \"distortos\/scheduler\/Scheduler.hpp\"\n\nnamespace distortos\n{\n\nnamespace scheduler\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| public functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nMutexControlBlock::MutexControlBlock(const Protocol protocol, const uint8_t priorityCeiling) :\n\t\tblockedList_{getScheduler().getThreadControlBlockListAllocator(), ThreadControlBlock::State::BlockedOnMutex},\n\t\tlist_{},\n\t\titerator_{},\n\t\towner_{},\n\t\tprotocol_{protocol},\n\t\tpriorityCeiling_{priorityCeiling}\n{\n\n}\n\nvoid MutexControlBlock::block()\n{\n\tif (protocol_ == Protocol::PriorityInheritance)\n\t\tpriorityInheritanceBeforeBlock();\n\n\tgetScheduler().block(blockedList_);\n}\n\nint MutexControlBlock::blockUntil(const TickClock::time_point timePoint)\n{\n\tif (protocol_ == Protocol::PriorityInheritance)\n\t\tpriorityInheritanceBeforeBlock();\n\n\treturn getScheduler().blockUntil(blockedList_, timePoint);\n}\n\nuint8_t MutexControlBlock::getBoostedPriority() const\n{\n\tif (protocol_ == Protocol::PriorityInheritance)\n\t{\n\t\tif (blockedList_.empty() == true)\n\t\t\treturn 0;\n\t\treturn blockedList_.begin()->get().getEffectivePriority();\n\t}\n\n\tif (protocol_ == Protocol::PriorityProtect)\n\t\treturn priorityCeiling_;\n\n\treturn 0;\n}\n\nvoid MutexControlBlock::lock()\n{\n\tauto& scheduler = scheduler::getScheduler();\n\towner_ = &scheduler.getCurrentThreadControlBlock();\n\n\tif (protocol_ == Protocol::None)\n\t\treturn;\n\n\tscheduler.getMutexControlBlockListAllocatorPool().feed(link_);\n\tlist_ = &owner_->getOwnedProtocolMutexControlBlocksList();\n\tlist_->emplace_front(*this);\n\titerator_ = list_->begin();\n\n\tif (protocol_ == Protocol::PriorityProtect)\n\t\towner_->updateBoostedPriority();\n}\n\nvoid MutexControlBlock::unlockOrTransferLock()\n{\n\tauto& oldOwner = *owner_;\n\n\tif (blockedList_.empty() == false)\n\t\ttransferLock();\n\telse\n\t\tunlock();\n\n\tif (protocol_ == Protocol::None)\n\t\treturn;\n\n\toldOwner.updateBoostedPriority();\n\n\tif (owner_ == nullptr)\n\t\treturn;\n\n\towner_->updateBoostedPriority();\n}\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| private functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nvoid MutexControlBlock::priorityInheritanceBeforeBlock() const\n{\n\t\/\/ calling thread is not yet on the blocked list, that's why it's effective priority is given explicitly\n\towner_->updateBoostedPriority(getScheduler().getCurrentThreadControlBlock().getEffectivePriority());\n}\n\nvoid MutexControlBlock::transferLock()\n{\n\towner_ = &blockedList_.begin()->get();\t\/\/ pass ownership to the unblocked thread\n\tscheduler::getScheduler().unblock(blockedList_.begin());\n\n\tif (list_ == nullptr)\n\t\treturn;\n\n\tauto& oldList = *list_;\n\tlist_ = &owner_->getOwnedProtocolMutexControlBlocksList();\n\tlist_->splice(list_->begin(), oldList, iterator_);\n}\n\nvoid MutexControlBlock::unlock()\n{\n\towner_ = nullptr;\n\n\tif (list_ == nullptr)\n\t\treturn;\n\n\tlist_->erase(iterator_);\n\tlist_ = nullptr;\n}\n\n}\t\/\/ namespace scheduler\n\n}\t\/\/ namespace distortos\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright 2008-2012 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\/*! \\file reduce.inl\n *  \\brief Inline file for reduce.h\n *\/\n\n#include <thrust\/detail\/config.h>\n#include <thrust\/distance.h>\n#include <thrust\/iterator\/iterator_traits.h>\n#include <thrust\/detail\/minmax.h>\n#include <thrust\/detail\/temporary_array.h>\n#include <thrust\/system\/detail\/generic\/select_system.h>\n\n#include <thrust\/system\/cuda\/detail\/runtime_introspection.h>\n#include <thrust\/system\/cuda\/detail\/extern_shared_ptr.h>\n#include <thrust\/system\/cuda\/detail\/block\/reduce.h>\n#include <thrust\/system\/cuda\/detail\/detail\/launch_closure.h>\n#include <thrust\/system\/cuda\/detail\/detail\/launch_calculator.h>\n#include <thrust\/system\/cuda\/detail\/execution_policy.h>\n#include <thrust\/detail\/seq.h>\n\nnamespace thrust\n{\nnamespace system\n{\nnamespace cuda\n{\nnamespace detail\n{\nnamespace reduce_detail\n{\n\n\n\/*\n * Reduce a vector of n elements using binary_op()\n *\n * The order of reduction is not defined, so binary_op() should\n * be a commutative (and associative) operator such as \n * (integer) addition.  Since floating point operations\n * do not completely satisfy these criteria, the result is \n * generally not the same as a consecutive reduction of \n * the elements.\n * \n * Uses the same pattern as reduce6() in the CUDA SDK\n *\n *\/\ntemplate<typename InputIterator,\n         typename Size,\n         typename T,\n         typename OutputIterator,\n         typename BinaryFunction,\n         typename Context>\nstruct unordered_reduce_closure\n{\n  InputIterator  input;\n  Size           n;\n  T              init;\n  OutputIterator output;\n  BinaryFunction binary_op;\n  unsigned int shared_array_size;\n\n  typedef Context context_type;\n  context_type context;\n\n  __host__ __device__\n  unordered_reduce_closure(InputIterator input, Size n, T init, OutputIterator output, BinaryFunction binary_op, unsigned int shared_array_size, Context context = Context())\n    : input(input), n(n), init(init), output(output), binary_op(binary_op), shared_array_size(shared_array_size), context(context) {}\n\n  __device__ __thrust_forceinline__\n  void operator()(void)\n  {\n    typedef typename thrust::iterator_value<OutputIterator>::type OutputType;\n    extern_shared_ptr<OutputType>  shared_array;\n\n    Size grid_size = context.block_dimension() * context.grid_dimension();\n\n    Size i = context.linear_index();\n      \n    input += i;\n\n    \/\/ compute reduction with all blockDim.x threads\n    OutputType sum = thrust::raw_reference_cast(*input);\n\n    i     += grid_size;\n    input += grid_size;\n\n    while (i < n)\n    {\n      OutputType val = thrust::raw_reference_cast(*input);\n\n      sum = binary_op(sum, val);\n\n      i      += grid_size;\n      input  += grid_size;\n    }\n\n    \/\/ write first shared_array_size values into shared memory\n    if (context.thread_index() < shared_array_size)\n      shared_array[context.thread_index()] = sum;  \n\n    \/\/ accumulate remaining values (if any) to shared memory in stages\n    if (context.block_dimension() > shared_array_size)\n    {\n      unsigned int lb = shared_array_size;\n      unsigned int ub = shared_array_size + lb;\n      \n      while (lb < context.block_dimension())\n      {\n        context.barrier();\n\n        if (lb <= context.thread_index() && context.thread_index() < ub)\n        {\n          OutputType tmp = shared_array[context.thread_index() - lb];\n          shared_array[context.thread_index() - lb] = binary_op(tmp, sum);\n        }\n\n        lb += shared_array_size;\n        ub += shared_array_size;\n      }\n    }\n    \n    context.barrier();\n\n    block::reduce_n(context, shared_array, thrust::min<unsigned int>(context.block_dimension(), shared_array_size), binary_op);\n  \n    if (context.thread_index() == 0)\n    {\n      OutputType tmp = shared_array[0];\n\n      if (context.grid_dimension() == 1)\n        tmp = binary_op(init, tmp);\n\n      output += context.block_index();\n      *output = tmp;\n    }\n  }\n};\n\n\n__THRUST_DISABLE_MSVC_POSSIBLE_LOSS_OF_DATA_WARNING_BEGIN\n\n\ntemplate<typename DerivedPolicy,\n         typename InputIterator,\n         typename OutputType,\n         typename BinaryFunction>\n__host__ __device__\nOutputType reduce(execution_policy<DerivedPolicy> &exec,\n                  InputIterator first,\n                  InputIterator last,\n                  OutputType init,\n                  BinaryFunction binary_op)\n{\n  \/\/ we're attempting to launch a kernel, assert we're compiling with nvcc\n  \/\/ ========================================================================\n  \/\/ X Note to the user: If you've found this line due to a compiler error, X\n  \/\/ X you need to compile your code using nvcc, rather than g++ or cl.exe  X\n  \/\/ ========================================================================\n  THRUST_STATIC_ASSERT( (thrust::detail::depend_on_instantiation<InputIterator, THRUST_DEVICE_COMPILER == THRUST_DEVICE_COMPILER_NVCC>::value) );\n\n  typedef typename thrust::iterator_difference<InputIterator>::type difference_type;\n\n  difference_type n = thrust::distance(first,last);\n\n  if (n == 0)\n    return init;\n\n  typedef thrust::detail::temporary_array<OutputType, DerivedPolicy> OutputArray;\n  typedef typename OutputArray::iterator OutputIterator;\n\n  typedef detail::blocked_thread_array Context;\n  typedef unordered_reduce_closure<InputIterator,difference_type,OutputType,OutputIterator,BinaryFunction,Context> Closure;\n    \n  function_attributes_t attributes = detail::closure_attributes<Closure>();\n  \n  \/\/ TODO chose this in a more principled manner\n  size_t threshold = thrust::max<size_t>(2 * attributes.maxThreadsPerBlock, 1024);\n\n  device_properties_t properties = device_properties();\n\n  \/\/ launch configuration\n  size_t num_blocks; \n  size_t block_size; \n  size_t array_size; \n  size_t smem_bytes; \n\n  \/\/ first level reduction\n  if(static_cast<size_t>(n) < threshold)\n  {\n    num_blocks = 1;\n    block_size = thrust::min(static_cast<size_t>(n), static_cast<size_t>(attributes.maxThreadsPerBlock));\n    array_size = thrust::min(block_size, (properties.sharedMemPerBlock - attributes.sharedSizeBytes) \/ sizeof(OutputType));\n    smem_bytes = sizeof(OutputType) * array_size;\n  }\n  else\n  {\n    detail::launch_calculator<Closure> calculator;\n    \n    thrust::tuple<size_t,size_t,size_t> config = calculator.with_variable_block_size_available_smem();\n\n    num_blocks = thrust::min(thrust::get<0>(config), static_cast<size_t>(n) \/ thrust::get<1>(config));\n    block_size = thrust::get<1>(config);\n    array_size = thrust::min(block_size, thrust::get<2>(config) \/ sizeof(OutputType));\n    smem_bytes = sizeof(OutputType) * array_size;\n  }\n \n  \/\/ TODO assert(n <= num_blocks * block_size);\n  \/\/ TODO if (shared_array_size < 1) throw cuda exception \"insufficient shared memory\"\n\n  OutputArray output(exec, num_blocks);\n\n  Closure closure(first, n, init, output.begin(), binary_op, array_size);\n  \n  \/\/std::cout << \"Launching \" << num_blocks << \" blocks of kernel with \" << block_size << \" threads and \" << smem_bytes << \" shared memory per block \" << std::endl;\n\n  detail::launch_closure(closure, num_blocks, block_size, smem_bytes);\n\n  \/\/ second level reduction\n  if (num_blocks > 1)\n  {\n    typedef detail::blocked_thread_array Context;\n    typedef unordered_reduce_closure<OutputIterator,difference_type,OutputType,OutputIterator,BinaryFunction,Context> Closure;\n\n    function_attributes_t attributes = detail::closure_attributes<Closure>();\n\n    num_blocks = 1;\n    block_size = thrust::min(output.size(), static_cast<size_t>(attributes.maxThreadsPerBlock));\n    array_size = thrust::min(block_size, (properties.sharedMemPerBlock - attributes.sharedSizeBytes) \/ sizeof(OutputType));\n    smem_bytes = sizeof(OutputType) * array_size;\n  \n    \/\/ TODO if (shared_array_size < 1) throw cuda exception \"insufficient shared memory\"\n\n    Closure closure(output.begin(), output.size(), init, output.begin(), binary_op, array_size);\n\n    \/\/std::cout << \"Launching \" << num_blocks << \" blocks of kernel with \" << block_size << \" threads and \" << smem_bytes << \" shared memory per block \" << std::endl;\n\n    detail::launch_closure(closure, num_blocks, block_size, smem_bytes);\n  }\n  \n  return output[0];\n} \/\/ end reduce\n\n\n} \/\/ end reduce_detail\n\n\n__THRUST_DISABLE_MSVC_POSSIBLE_LOSS_OF_DATA_WARNING_END\n\n\ntemplate<typename DerivedPolicy,\n         typename InputIterator,\n         typename OutputType,\n         typename BinaryFunction>\n__host__ __device__\nOutputType reduce(execution_policy<DerivedPolicy> &exec,\n                  InputIterator first,\n                  InputIterator last,\n                  OutputType init,\n                  BinaryFunction binary_op)\n{\n  struct workaround\n  {\n    __host__ __device__\n    static OutputType parallel_path(execution_policy<DerivedPolicy> &exec, InputIterator first, InputIterator last, OutputType init, BinaryFunction binary_op)\n    {\n      return reduce_detail::reduce(exec, first, last, init, binary_op);\n    }\n\n    __host__ __device__\n    static OutputType sequential_path(execution_policy<DerivedPolicy> &, InputIterator first, InputIterator last, OutputType init, BinaryFunction binary_op)\n    {\n      return thrust::reduce(thrust::seq, first, last, init, binary_op);\n    }\n  };\n\n#if !defined(__CUDA_ARCH__) || (__CUDA_ARCH__ >= 350)\n  return workaround::parallel_path(exec, first, last, init, binary_op);\n#else\n  return workaround::sequential_path(exec, first, last, init, binary_op);\n#endif\n} \/\/ end reduce()\n\n\n} \/\/ end namespace detail\n} \/\/ end namespace cuda\n} \/\/ end namespace system\n} \/\/ end namespace thrust\n\n<commit_msg>Add missing header.<commit_after>\/*\n *  Copyright 2008-2012 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\/*! \\file reduce.inl\n *  \\brief Inline file for reduce.h\n *\/\n\n#include <thrust\/detail\/config.h>\n#include <thrust\/distance.h>\n#include <thrust\/iterator\/iterator_traits.h>\n#include <thrust\/detail\/minmax.h>\n#include <thrust\/detail\/temporary_array.h>\n#include <thrust\/system\/detail\/generic\/select_system.h>\n\n#include <thrust\/system\/cuda\/detail\/runtime_introspection.h>\n#include <thrust\/system\/cuda\/detail\/extern_shared_ptr.h>\n#include <thrust\/system\/cuda\/detail\/block\/reduce.h>\n#include <thrust\/system\/cuda\/detail\/detail\/launch_closure.h>\n#include <thrust\/system\/cuda\/detail\/detail\/launch_calculator.h>\n#include <thrust\/system\/cuda\/detail\/execution_policy.h>\n#include <thrust\/reduce.h>\n#include <thrust\/detail\/seq.h>\n\nnamespace thrust\n{\nnamespace system\n{\nnamespace cuda\n{\nnamespace detail\n{\nnamespace reduce_detail\n{\n\n\n\/*\n * Reduce a vector of n elements using binary_op()\n *\n * The order of reduction is not defined, so binary_op() should\n * be a commutative (and associative) operator such as \n * (integer) addition.  Since floating point operations\n * do not completely satisfy these criteria, the result is \n * generally not the same as a consecutive reduction of \n * the elements.\n * \n * Uses the same pattern as reduce6() in the CUDA SDK\n *\n *\/\ntemplate<typename InputIterator,\n         typename Size,\n         typename T,\n         typename OutputIterator,\n         typename BinaryFunction,\n         typename Context>\nstruct unordered_reduce_closure\n{\n  InputIterator  input;\n  Size           n;\n  T              init;\n  OutputIterator output;\n  BinaryFunction binary_op;\n  unsigned int shared_array_size;\n\n  typedef Context context_type;\n  context_type context;\n\n  __host__ __device__\n  unordered_reduce_closure(InputIterator input, Size n, T init, OutputIterator output, BinaryFunction binary_op, unsigned int shared_array_size, Context context = Context())\n    : input(input), n(n), init(init), output(output), binary_op(binary_op), shared_array_size(shared_array_size), context(context) {}\n\n  __device__ __thrust_forceinline__\n  void operator()(void)\n  {\n    typedef typename thrust::iterator_value<OutputIterator>::type OutputType;\n    extern_shared_ptr<OutputType>  shared_array;\n\n    Size grid_size = context.block_dimension() * context.grid_dimension();\n\n    Size i = context.linear_index();\n      \n    input += i;\n\n    \/\/ compute reduction with all blockDim.x threads\n    OutputType sum = thrust::raw_reference_cast(*input);\n\n    i     += grid_size;\n    input += grid_size;\n\n    while (i < n)\n    {\n      OutputType val = thrust::raw_reference_cast(*input);\n\n      sum = binary_op(sum, val);\n\n      i      += grid_size;\n      input  += grid_size;\n    }\n\n    \/\/ write first shared_array_size values into shared memory\n    if (context.thread_index() < shared_array_size)\n      shared_array[context.thread_index()] = sum;  \n\n    \/\/ accumulate remaining values (if any) to shared memory in stages\n    if (context.block_dimension() > shared_array_size)\n    {\n      unsigned int lb = shared_array_size;\n      unsigned int ub = shared_array_size + lb;\n      \n      while (lb < context.block_dimension())\n      {\n        context.barrier();\n\n        if (lb <= context.thread_index() && context.thread_index() < ub)\n        {\n          OutputType tmp = shared_array[context.thread_index() - lb];\n          shared_array[context.thread_index() - lb] = binary_op(tmp, sum);\n        }\n\n        lb += shared_array_size;\n        ub += shared_array_size;\n      }\n    }\n    \n    context.barrier();\n\n    block::reduce_n(context, shared_array, thrust::min<unsigned int>(context.block_dimension(), shared_array_size), binary_op);\n  \n    if (context.thread_index() == 0)\n    {\n      OutputType tmp = shared_array[0];\n\n      if (context.grid_dimension() == 1)\n        tmp = binary_op(init, tmp);\n\n      output += context.block_index();\n      *output = tmp;\n    }\n  }\n};\n\n\n__THRUST_DISABLE_MSVC_POSSIBLE_LOSS_OF_DATA_WARNING_BEGIN\n\n\ntemplate<typename DerivedPolicy,\n         typename InputIterator,\n         typename OutputType,\n         typename BinaryFunction>\n__host__ __device__\nOutputType reduce(execution_policy<DerivedPolicy> &exec,\n                  InputIterator first,\n                  InputIterator last,\n                  OutputType init,\n                  BinaryFunction binary_op)\n{\n  \/\/ we're attempting to launch a kernel, assert we're compiling with nvcc\n  \/\/ ========================================================================\n  \/\/ X Note to the user: If you've found this line due to a compiler error, X\n  \/\/ X you need to compile your code using nvcc, rather than g++ or cl.exe  X\n  \/\/ ========================================================================\n  THRUST_STATIC_ASSERT( (thrust::detail::depend_on_instantiation<InputIterator, THRUST_DEVICE_COMPILER == THRUST_DEVICE_COMPILER_NVCC>::value) );\n\n  typedef typename thrust::iterator_difference<InputIterator>::type difference_type;\n\n  difference_type n = thrust::distance(first,last);\n\n  if (n == 0)\n    return init;\n\n  typedef thrust::detail::temporary_array<OutputType, DerivedPolicy> OutputArray;\n  typedef typename OutputArray::iterator OutputIterator;\n\n  typedef detail::blocked_thread_array Context;\n  typedef unordered_reduce_closure<InputIterator,difference_type,OutputType,OutputIterator,BinaryFunction,Context> Closure;\n    \n  function_attributes_t attributes = detail::closure_attributes<Closure>();\n  \n  \/\/ TODO chose this in a more principled manner\n  size_t threshold = thrust::max<size_t>(2 * attributes.maxThreadsPerBlock, 1024);\n\n  device_properties_t properties = device_properties();\n\n  \/\/ launch configuration\n  size_t num_blocks; \n  size_t block_size; \n  size_t array_size; \n  size_t smem_bytes; \n\n  \/\/ first level reduction\n  if(static_cast<size_t>(n) < threshold)\n  {\n    num_blocks = 1;\n    block_size = thrust::min(static_cast<size_t>(n), static_cast<size_t>(attributes.maxThreadsPerBlock));\n    array_size = thrust::min(block_size, (properties.sharedMemPerBlock - attributes.sharedSizeBytes) \/ sizeof(OutputType));\n    smem_bytes = sizeof(OutputType) * array_size;\n  }\n  else\n  {\n    detail::launch_calculator<Closure> calculator;\n    \n    thrust::tuple<size_t,size_t,size_t> config = calculator.with_variable_block_size_available_smem();\n\n    num_blocks = thrust::min(thrust::get<0>(config), static_cast<size_t>(n) \/ thrust::get<1>(config));\n    block_size = thrust::get<1>(config);\n    array_size = thrust::min(block_size, thrust::get<2>(config) \/ sizeof(OutputType));\n    smem_bytes = sizeof(OutputType) * array_size;\n  }\n \n  \/\/ TODO assert(n <= num_blocks * block_size);\n  \/\/ TODO if (shared_array_size < 1) throw cuda exception \"insufficient shared memory\"\n\n  OutputArray output(exec, num_blocks);\n\n  Closure closure(first, n, init, output.begin(), binary_op, array_size);\n  \n  \/\/std::cout << \"Launching \" << num_blocks << \" blocks of kernel with \" << block_size << \" threads and \" << smem_bytes << \" shared memory per block \" << std::endl;\n\n  detail::launch_closure(closure, num_blocks, block_size, smem_bytes);\n\n  \/\/ second level reduction\n  if (num_blocks > 1)\n  {\n    typedef detail::blocked_thread_array Context;\n    typedef unordered_reduce_closure<OutputIterator,difference_type,OutputType,OutputIterator,BinaryFunction,Context> Closure;\n\n    function_attributes_t attributes = detail::closure_attributes<Closure>();\n\n    num_blocks = 1;\n    block_size = thrust::min(output.size(), static_cast<size_t>(attributes.maxThreadsPerBlock));\n    array_size = thrust::min(block_size, (properties.sharedMemPerBlock - attributes.sharedSizeBytes) \/ sizeof(OutputType));\n    smem_bytes = sizeof(OutputType) * array_size;\n  \n    \/\/ TODO if (shared_array_size < 1) throw cuda exception \"insufficient shared memory\"\n\n    Closure closure(output.begin(), output.size(), init, output.begin(), binary_op, array_size);\n\n    \/\/std::cout << \"Launching \" << num_blocks << \" blocks of kernel with \" << block_size << \" threads and \" << smem_bytes << \" shared memory per block \" << std::endl;\n\n    detail::launch_closure(closure, num_blocks, block_size, smem_bytes);\n  }\n  \n  return output[0];\n} \/\/ end reduce\n\n\n} \/\/ end reduce_detail\n\n\n__THRUST_DISABLE_MSVC_POSSIBLE_LOSS_OF_DATA_WARNING_END\n\n\ntemplate<typename DerivedPolicy,\n         typename InputIterator,\n         typename OutputType,\n         typename BinaryFunction>\n__host__ __device__\nOutputType reduce(execution_policy<DerivedPolicy> &exec,\n                  InputIterator first,\n                  InputIterator last,\n                  OutputType init,\n                  BinaryFunction binary_op)\n{\n  struct workaround\n  {\n    __host__ __device__\n    static OutputType parallel_path(execution_policy<DerivedPolicy> &exec, InputIterator first, InputIterator last, OutputType init, BinaryFunction binary_op)\n    {\n      return reduce_detail::reduce(exec, first, last, init, binary_op);\n    }\n\n    __host__ __device__\n    static OutputType sequential_path(execution_policy<DerivedPolicy> &, InputIterator first, InputIterator last, OutputType init, BinaryFunction binary_op)\n    {\n      return thrust::reduce(thrust::seq, first, last, init, binary_op);\n    }\n  };\n\n#if !defined(__CUDA_ARCH__) || (__CUDA_ARCH__ >= 350)\n  return workaround::parallel_path(exec, first, last, init, binary_op);\n#else\n  return workaround::sequential_path(exec, first, last, init, binary_op);\n#endif\n} \/\/ end reduce()\n\n\n} \/\/ end namespace detail\n} \/\/ end namespace cuda\n} \/\/ end namespace system\n} \/\/ end namespace thrust\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"scope.h\"\n#include <yuni\/core\/noncopyable.h>\n#include \"details\/utils\/check-for-valid-identifier-name.h\"\n#include \"details\/ast\/ast.h\"\n#include \"details\/ir\/emit.h\"\n\nusing namespace Yuni;\n\n\nnamespace ny {\nnamespace ir {\nnamespace Producer {\n\n\nnamespace {\n\n\nbool varValueInitialization(Scope& scope, uint32_t& localvar, AST::Node& varAssign,\n\t\t\t\t\t\t\tAST::Node& varnodeDecl, const AnyString& varname) {\n\tfor (auto& assignChild : varAssign.children) {\n\t\tswitch (assignChild.rule) {\n\t\t\tcase AST::rgExpr: {\n\t\t\t\tbool success = scope.visitASTExpr(assignChild, localvar);\n\t\t\t\tif (unlikely(not success)) {\n\t\t\t\t\terror(varnodeDecl) << \"could not declare '\" << varname << \"': error in initialization\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgOperatorKind: {\n\t\t\t\tbreak; \/\/ operator =\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\treturn unexpectedNode(assignChild, \"[var\/init]\");\n\t\t}\n\t}\n\treturn true;\n}\n\n\nbool generateTypeofForClassVar(Scope& scope, uint32_t& lvid, AST::Node& varAssign) {\n\t\/\/ typeof (+2)\n\t\/\/   tk-typeof, typeof\n\t\/\/   call (+3)\n\t\/\/       tk-parenthese-open, (\n\t\/\/       call-parameter\n\t\/\/       |   expr\n\t\/\/       |     identifier: A\n\tauto typeofn = make_ref<AST::Node>(AST::rgTypeof);\n\tauto call = make_ref<AST::Node>(AST::rgCall);\n\ttypeofn->children.push_back(call);\n\t\/\/ first parameter - the expr\n\t{\n\t\tauto param = make_ref<AST::Node>(AST::rgCallParameter);\n\t\tcall->children.push_back(param);\n\t\tuint index = varAssign.findFirst(AST::rgExpr);\n\t\tif (unlikely(not (index < varAssign.children.size()))) {\n\t\t\tassert(false and \"no node <expr> in <var-assign>\");\n\t\t\treturn false;\n\t\t}\n\t\tparam->children.push_back(&(varAssign.children[index]));\n\t}\n\treturn scope.visitASTExprTypeof(*typeofn, lvid);\n}\n\n\nbool generateInitFuncForClassVar(Scope& scope, const AnyString& varname, uint32_t lvid,\n\t\t\t\t\t\t\t\t AST::Node& varAssign) {\n\t\/\/ name of the generated func for initialize the class variable\n\tShortString64 funcName;\n\tfuncName << \"^default-var-%\" << lvid << '-' << varname;\n\tassert(lvid > 0);\n\t\/\/ generating INIT\n\t\/\/\n\t\/\/ variable member initialization is merely a call to the intrinsic `__nanyc_fieldset`\n\t\/\/ the first parameter is the result of the default value\n\t\/\/ the second parameter is the register where the name of member has been stored\n\tif (!scope.context.reuse.func.node)\n\t\tscope.context.prepareReuseForVariableMembers();\n\tscope.context.reuse.func.funcname->text = funcName;\n\tscope.context.reuse.func.varname->text  = varname;\n\t\/\/ Updating the EXPR\n\tuint index = varAssign.findFirst(AST::rgExpr);\n\tif (unlikely(not (index < varAssign.children.size()))) {\n\t\tassert(false and \"no node <expr> in <var-assign>\");\n\t\treturn false;\n\t}\n\tscope.context.reuse.func.callparam->children.push_back(&(varAssign.children[index]));\n\tbool success = scope.visitASTFunc(*(scope.context.reuse.func.node));\n\tscope.context.reuse.func.callparam->children.clear();\n\treturn success;\n}\n\n\nbool emitVarInClass(Scope& scope, const AnyString& varname, AST::Node& node, AST::Node* varType,\n\t\t\t\t\tAST::Node* varAssign, bool ref, bool constant) {\n\tauto& irout = scope.ircode();\n\tif (debugmode) {\n\t\tir::emit::trace(irout);\n\t\tir::emit::trace(irout, [&]() {\n\t\t\treturn String{\"class var \"} << varname;\n\t\t});\n\t}\n\t\/\/ the new member variable\n\tauto mbvar = scope.nextvar();\n\tir::emit::alloc(irout, mbvar);\n\t\/\/ the type of the expression\n\tuint32_t lvid = 0;\n\tif (varType != nullptr) {\n\t\tif (not scope.visitASTType(*varType, lvid))\n\t\t\treturn false;\n\t}\n\telse {\n\t\t\/\/ type definition, via typeof(varAssign)\n\t\tif (not generateTypeofForClassVar(scope, lvid, *varAssign))\n\t\t\treturn false;\n\t}\n\tif (unlikely(0 == lvid))\n\t\treturn false;\n\t\/\/ follow\n\t{\n\t\tauto& operands    = irout.emit<isa::Op::follow>();\n\t\toperands.follower = mbvar;\n\t\toperands.lvid     = lvid;\n\t\toperands.symlink  = 0;\n\t}\n\t\/\/ preserve var \/ ref \/ const\n\tir::emit::type::qualifierRef(irout, mbvar, ref);\n\tif (constant)\n\t\tir::emit::type::qualifierConst(irout, mbvar, true);\n\t\/\/ variable definition\n\tscope.emitDebugpos(node);\n\tir::emit::blueprint::var(irout, mbvar, varname);\n\t\/\/ generating an INIT func for the variable\n\treturn generateInitFuncForClassVar(scope, varname, mbvar, *varAssign);\n}\n\n\nbool emitVarInFunc(Scope& scope, const AnyString& varname, AST::Node& node, AST::Node* varType,\n\t\tAST::Node* varAssign, bool ref, bool constant) {\n\tauto& irout = scope.ircode();\n\t\/\/ create the variable itself\n\tuint32_t varlvid = ir::emit::alloc(irout, scope.nextvar());\n\tif (varType != nullptr) {\n\t\tuint32_t lvidtype;\n\t\tif (not scope.visitASTType(*varType, lvidtype) or lvidtype == 0)\n\t\t\treturn false;\n\t\t\/\/ follow\n\t\tauto& operands    = irout.emit<isa::Op::follow>();\n\t\toperands.follower = varlvid;\n\t\toperands.lvid     = lvidtype;\n\t\toperands.symlink  = 0;\n\t}\n\t\/\/ preserve var \/ ref \/ const\n\tir::emit::type::qualifierRef(irout, varlvid, ref);\n\tif (constant)\n\t\tir::emit::type::qualifierConst(irout, varlvid, true);\n\t\/\/ default value\n\t{\n\t\tuint32_t rhs = 0;\n\t\tir::emit::ScopeLocker opscope{irout};\n\t\tif (not varValueInitialization(scope, rhs, *varAssign, node, varname))\n\t\t\treturn false;\n\t\tassert(rhs != 0);\n\t\tif (not ref)\n\t\t\tir::emit::assign(irout, varlvid, rhs, false);\n\t\telse {\n\t\t\tir::emit::copy(irout, varlvid, rhs); \/\/ re-acquire to keep the value alive\n\t\t\tir::emit::ref(irout, varlvid);\n\t\t}\n\t}\n\t\/\/ important: the alias must be declared *after* the right value\n\t\/\/ (otherwise it may be used by the code)\n\tscope.emitDebugpos(node); \/\/ reset the debug position\n\tir::emit::namealias(irout, varlvid, varname);\n\treturn true;\n}\n\n\nbool emitProperty(Scope& scope, const AnyString& varname, AST::Node& node, AST::Node* \/*varType*\/,\n\t\tAST::Node& varAssign, bool ref) {\n\tAST::Node* nodeGet = nullptr;\n\tAST::Node* nodeSet = nullptr;\n\tfor (auto& object : varAssign.children) {\n\t\tswitch (object.rule) {\n\t\t\tcase AST::rgObject: {\n\t\t\t\tfor (auto& child : object.children) {\n\t\t\t\t\tswitch (child.rule) {\n\t\t\t\t\t\tcase AST::rgObjectEntry: {\n\t\t\t\t\t\t\tbool validAST = ((child.children.size() == 2)\n\t\t\t\t\t\t\t\t\t\t\t and child.children[0].rule == AST::rgIdentifier\n\t\t\t\t\t\t\t\t\t\t\t and child.children[1].rule == AST::rgExpr);\n\t\t\t\t\t\t\tif (unlikely(not validAST))\n\t\t\t\t\t\t\t\treturn (error(child) << \"invalid AST node [property]\");\n\t\t\t\t\t\t\tAnyString name = child.children[0].text;\n\t\t\t\t\t\t\tif (name == \"get\") {\n\t\t\t\t\t\t\t\tif (unlikely(nodeGet))\n\t\t\t\t\t\t\t\t\treturn (error(child) << \"property: multiple definition of 'get'\");\n\t\t\t\t\t\t\t\tnodeGet = &(child.children[1]);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (name == \"set\") {\n\t\t\t\t\t\t\t\tif (unlikely(nodeSet))\n\t\t\t\t\t\t\t\t\treturn (error(child) << \"property: multiple definition of 'set'\");\n\t\t\t\t\t\t\t\tnodeSet = &(child.children[1]);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\treturn (error(child) << \"unsupported property component '\" << name << \"' (expected: 'get' or 'set')\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\treturn unexpectedNode(child, \"[property]\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgExpr: {\n\t\t\t\t\/\/ read-only property\n\t\t\t\tif (unlikely(nodeGet))\n\t\t\t\t\treturn (error(object) << \"property: multiple definition of 'get'\");\n\t\t\t\tnodeGet = &object;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\treturn unexpectedNode(object, \"[property\/object]\");\n\t\t}\n\t}\n\tif (unlikely(!nodeGet and !nodeSet))\n\t\treturn (error(node) << \"empty property definition\");\n\tbool success = true;\n\tShortString128 propname;\n\tif (nodeGet) {\n\t\tif (!scope.context.reuse.properties.get.node)\n\t\t\tscope.context.prepareReuseForPropertiesGET();\n\t\tpropname << \"^propget^\" << varname;\n\t\tscope.context.reuse.properties.get.propname->text = propname;\n\t\tauto& type = *(scope.context.reuse.properties.get.type);\n\t\ttype.children.clear();\n\t\tif (ref)\n\t\t\ttype.children.push_back(scope.context.reuse.properties.get.typeIsRefAny);\n\t\telse\n\t\t\ttype.children.push_back(scope.context.reuse.properties.get.typeIsAny);\n\t\tauto& returnValue = *(scope.context.reuse.properties.get.returnValue);\n\t\treturnValue.children.clear();\n\t\treturnValue.children.push_back(nodeGet);\n\t\tauto& funcnode = *(scope.context.reuse.properties.get.node);\n\t\tsuccess &= scope.visitASTFunc(funcnode);\n\t\t\/\/ to avoid crap printed in the debugger\n\t\tscope.context.reuse.properties.get.propname->text.clear();\n\t\ttype.children.clear();\n\t\treturnValue.children.clear();\n\t}\n\tif (nodeSet) {\n\t\tif (!scope.context.reuse.properties.set.node)\n\t\t\tscope.context.prepareReuseForPropertiesSET();\n\t\tpropname.clear() << \"^propset^\" << varname;\n\t\tscope.context.reuse.properties.set.propname->text = propname;\n\t\tauto& body = *(scope.context.reuse.properties.set.body);\n\t\tbody.children.clear();\n\t\tbody.children.push_back(nodeSet);\n\t\tauto& funcnode = *(scope.context.reuse.properties.set.node);\n\t\tsuccess &= scope.visitASTFunc(funcnode);\n\t\t\/\/ to avoid crap printed in the debugger\n\t\tscope.context.reuse.properties.set.propname->text.clear();\n\t\tbody.children.clear();\n\t}\n\treturn success;\n}\n\n\n} \/\/ namespace\n\n\nbool Scope::visitASTVar(AST::Node& node) {\n\tassert(node.rule == AST::rgVar);\n\tassert(not node.children.empty());\n\tAnyString varname;\n\tbool ref = false;\n\tbool constant = false;\n\tAST::Node* varnodeDecl = nullptr;\n\tAST::Node* varAssign = nullptr;\n\tAST::Node* varType = nullptr;\n\tbool isProperty = false;\n\tfor (auto& child : node.children) {\n\t\tswitch (child.rule) {\n\t\t\tcase AST::rgIdentifier: {\n\t\t\t\tvarnodeDecl = &child;\n\t\t\t\tvarname = child.text;\n\t\t\t\tif (unlikely(not checkForValidIdentifierName(child, varname)))\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgVarAssign: {\n\t\t\t\tvarAssign = &child;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgVarProperty: {\n\t\t\t\tisProperty = true;\n\t\t\t\tvarAssign = &child;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgVarType: {\n\t\t\t\tvarType = &child;\n\t\t\t\tif (child.children.size() == 1 and child.children[0].rule == AST::rgType)\n\t\t\t\t\tvarType = &(child.children[0]);\n\t\t\t\telse\n\t\t\t\t\terror(child) << \"invalid type definition\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgVarByValue: {\n\t\t\t\tbreak; \/\/ nothing to do\n\t\t\t}\n\t\t\tcase AST::rgConst: {\n\t\t\t\tconstant = true;\n\t\t\t\twarning(child) << \"'const' in var declaration is currently not supported\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgRef: {\n\t\t\t\tref = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgCref: {\n\t\t\t\twarning(child) << \"'const' in var declaration is currently not supported\";\n\t\t\t\tref = true;\n\t\t\t\tconstant = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgFuncParamVariadic: {\n\t\t\t\treturn (error(child) << \"variadic parameter not allowed in variable definition\");\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\treturn unexpectedNode(child, \"[var]\");\n\t\t}\n\t}\n\tif (unlikely(varnodeDecl == nullptr))\n\t\treturn (ice() << \"invalid null pointer for the var-decl node\");\n\tif (unlikely(varAssign == nullptr)) \/\/ the variable currently must have a default value\n\t\treturn (error(*varnodeDecl) << \"value initialization is missing for '\" << varname << '\\'');\n\tif (not isProperty) {\n\t\tswitch (kind) {\n\t\t\tcase Kind::kfunc:\n\t\t\t\treturn emitVarInFunc(*this, varname, *varnodeDecl, varType, varAssign, ref, constant);\n\t\t\tcase Kind::kclass:\n\t\t\t\treturn emitVarInClass(*this, varname, *varnodeDecl, varType, varAssign, ref, constant);\n\t\t\tdefault:\n\t\t\t\treturn (ice(*varnodeDecl) << \"var declaration: unsupported scope type\");\n\t\t}\n\t}\n\telse {\n\t\tif (unlikely(constant))\n\t\t\treturn (error(node) << \"'const' keyword for properties is not supported yet\");\n\t\tif (unlikely(varType))\n\t\t\treturn (error(node) << \"'type' for properties is not supported yet\");\n\t\tswitch (kind) {\n\t\t\tcase Kind::kclass:\n\t\t\tcase Kind::undefined:\n\t\t\t\treturn emitProperty(*this, varname, *varnodeDecl, varType, *varAssign, ref);\n\t\t\tcase Kind::kfunc:\n\t\t\t\treturn (error(*varnodeDecl) << \"properties in functions not implemented\");\n\t\t}\n\t}\n\treturn false;\n}\n\n\n} \/\/ namespace Producer\n} \/\/ namespace ir\n} \/\/ namespace ny\n<commit_msg>ast2ir: indentation<commit_after>#include \"scope.h\"\n#include <yuni\/core\/noncopyable.h>\n#include \"details\/utils\/check-for-valid-identifier-name.h\"\n#include \"details\/ast\/ast.h\"\n#include \"details\/ir\/emit.h\"\n\nusing namespace Yuni;\n\n\nnamespace ny {\nnamespace ir {\nnamespace Producer {\n\n\nnamespace {\n\n\nbool varValueInitialization(Scope& scope, uint32_t& localvar, AST::Node& varAssign,\n\t\tAST::Node& varnodeDecl, const AnyString& varname) {\n\tfor (auto& assignChild : varAssign.children) {\n\t\tswitch (assignChild.rule) {\n\t\t\tcase AST::rgExpr: {\n\t\t\t\tbool success = scope.visitASTExpr(assignChild, localvar);\n\t\t\t\tif (unlikely(not success)) {\n\t\t\t\t\terror(varnodeDecl) << \"could not declare '\" << varname << \"': error in initialization\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgOperatorKind: {\n\t\t\t\tbreak; \/\/ operator =\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\treturn unexpectedNode(assignChild, \"[var\/init]\");\n\t\t}\n\t}\n\treturn true;\n}\n\n\nbool generateTypeofForClassVar(Scope& scope, uint32_t& lvid, AST::Node& varAssign) {\n\t\/\/ typeof (+2)\n\t\/\/   tk-typeof, typeof\n\t\/\/   call (+3)\n\t\/\/       tk-parenthese-open, (\n\t\/\/       call-parameter\n\t\/\/       |   expr\n\t\/\/       |     identifier: A\n\tauto typeofn = make_ref<AST::Node>(AST::rgTypeof);\n\tauto call = make_ref<AST::Node>(AST::rgCall);\n\ttypeofn->children.push_back(call);\n\t\/\/ first parameter - the expr\n\t{\n\t\tauto param = make_ref<AST::Node>(AST::rgCallParameter);\n\t\tcall->children.push_back(param);\n\t\tuint index = varAssign.findFirst(AST::rgExpr);\n\t\tif (unlikely(not (index < varAssign.children.size()))) {\n\t\t\tassert(false and \"no node <expr> in <var-assign>\");\n\t\t\treturn false;\n\t\t}\n\t\tparam->children.push_back(&(varAssign.children[index]));\n\t}\n\treturn scope.visitASTExprTypeof(*typeofn, lvid);\n}\n\n\nbool generateInitFuncForClassVar(Scope& scope, const AnyString& varname, uint32_t lvid,\n\t\tAST::Node& varAssign) {\n\t\/\/ name of the generated func for initialize the class variable\n\tShortString64 funcName;\n\tfuncName << \"^default-var-%\" << lvid << '-' << varname;\n\tassert(lvid > 0);\n\t\/\/ generating INIT\n\t\/\/\n\t\/\/ variable member initialization is merely a call to the intrinsic `__nanyc_fieldset`\n\t\/\/ the first parameter is the result of the default value\n\t\/\/ the second parameter is the register where the name of member has been stored\n\tif (!scope.context.reuse.func.node)\n\t\tscope.context.prepareReuseForVariableMembers();\n\tscope.context.reuse.func.funcname->text = funcName;\n\tscope.context.reuse.func.varname->text  = varname;\n\t\/\/ Updating the EXPR\n\tuint index = varAssign.findFirst(AST::rgExpr);\n\tif (unlikely(not (index < varAssign.children.size()))) {\n\t\tassert(false and \"no node <expr> in <var-assign>\");\n\t\treturn false;\n\t}\n\tscope.context.reuse.func.callparam->children.push_back(&(varAssign.children[index]));\n\tbool success = scope.visitASTFunc(*(scope.context.reuse.func.node));\n\tscope.context.reuse.func.callparam->children.clear();\n\treturn success;\n}\n\n\nbool emitVarInClass(Scope& scope, const AnyString& varname, AST::Node& node, AST::Node* varType,\n\t\t\t\t\tAST::Node* varAssign, bool ref, bool constant) {\n\tauto& irout = scope.ircode();\n\tif (debugmode) {\n\t\tir::emit::trace(irout);\n\t\tir::emit::trace(irout, [&]() {\n\t\t\treturn String{\"class var \"} << varname;\n\t\t});\n\t}\n\t\/\/ the new member variable\n\tauto mbvar = scope.nextvar();\n\tir::emit::alloc(irout, mbvar);\n\t\/\/ the type of the expression\n\tuint32_t lvid = 0;\n\tif (varType != nullptr) {\n\t\tif (not scope.visitASTType(*varType, lvid))\n\t\t\treturn false;\n\t}\n\telse {\n\t\t\/\/ type definition, via typeof(varAssign)\n\t\tif (not generateTypeofForClassVar(scope, lvid, *varAssign))\n\t\t\treturn false;\n\t}\n\tif (unlikely(0 == lvid))\n\t\treturn false;\n\t\/\/ follow\n\t{\n\t\tauto& operands    = irout.emit<isa::Op::follow>();\n\t\toperands.follower = mbvar;\n\t\toperands.lvid     = lvid;\n\t\toperands.symlink  = 0;\n\t}\n\t\/\/ preserve var \/ ref \/ const\n\tir::emit::type::qualifierRef(irout, mbvar, ref);\n\tif (constant)\n\t\tir::emit::type::qualifierConst(irout, mbvar, true);\n\t\/\/ variable definition\n\tscope.emitDebugpos(node);\n\tir::emit::blueprint::var(irout, mbvar, varname);\n\t\/\/ generating an INIT func for the variable\n\treturn generateInitFuncForClassVar(scope, varname, mbvar, *varAssign);\n}\n\n\nbool emitVarInFunc(Scope& scope, const AnyString& varname, AST::Node& node, AST::Node* varType,\n\t\tAST::Node* varAssign, bool ref, bool constant) {\n\tauto& irout = scope.ircode();\n\t\/\/ create the variable itself\n\tuint32_t varlvid = ir::emit::alloc(irout, scope.nextvar());\n\tif (varType != nullptr) {\n\t\tuint32_t lvidtype;\n\t\tif (not scope.visitASTType(*varType, lvidtype) or lvidtype == 0)\n\t\t\treturn false;\n\t\t\/\/ follow\n\t\tauto& operands    = irout.emit<isa::Op::follow>();\n\t\toperands.follower = varlvid;\n\t\toperands.lvid     = lvidtype;\n\t\toperands.symlink  = 0;\n\t}\n\t\/\/ preserve var \/ ref \/ const\n\tir::emit::type::qualifierRef(irout, varlvid, ref);\n\tif (constant)\n\t\tir::emit::type::qualifierConst(irout, varlvid, true);\n\t\/\/ default value\n\t{\n\t\tuint32_t rhs = 0;\n\t\tir::emit::ScopeLocker opscope{irout};\n\t\tif (not varValueInitialization(scope, rhs, *varAssign, node, varname))\n\t\t\treturn false;\n\t\tassert(rhs != 0);\n\t\tif (not ref)\n\t\t\tir::emit::assign(irout, varlvid, rhs, false);\n\t\telse {\n\t\t\tir::emit::copy(irout, varlvid, rhs); \/\/ re-acquire to keep the value alive\n\t\t\tir::emit::ref(irout, varlvid);\n\t\t}\n\t}\n\t\/\/ important: the alias must be declared *after* the right value\n\t\/\/ (otherwise it may be used by the code)\n\tscope.emitDebugpos(node); \/\/ reset the debug position\n\tir::emit::namealias(irout, varlvid, varname);\n\treturn true;\n}\n\n\nbool emitProperty(Scope& scope, const AnyString& varname, AST::Node& node, AST::Node* \/*varType*\/,\n\t\tAST::Node& varAssign, bool ref) {\n\tAST::Node* nodeGet = nullptr;\n\tAST::Node* nodeSet = nullptr;\n\tfor (auto& object : varAssign.children) {\n\t\tswitch (object.rule) {\n\t\t\tcase AST::rgObject: {\n\t\t\t\tfor (auto& child : object.children) {\n\t\t\t\t\tswitch (child.rule) {\n\t\t\t\t\t\tcase AST::rgObjectEntry: {\n\t\t\t\t\t\t\tbool validAST = ((child.children.size() == 2)\n\t\t\t\t\t\t\t\t\t\t\t and child.children[0].rule == AST::rgIdentifier\n\t\t\t\t\t\t\t\t\t\t\t and child.children[1].rule == AST::rgExpr);\n\t\t\t\t\t\t\tif (unlikely(not validAST))\n\t\t\t\t\t\t\t\treturn (error(child) << \"invalid AST node [property]\");\n\t\t\t\t\t\t\tAnyString name = child.children[0].text;\n\t\t\t\t\t\t\tif (name == \"get\") {\n\t\t\t\t\t\t\t\tif (unlikely(nodeGet))\n\t\t\t\t\t\t\t\t\treturn (error(child) << \"property: multiple definition of 'get'\");\n\t\t\t\t\t\t\t\tnodeGet = &(child.children[1]);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (name == \"set\") {\n\t\t\t\t\t\t\t\tif (unlikely(nodeSet))\n\t\t\t\t\t\t\t\t\treturn (error(child) << \"property: multiple definition of 'set'\");\n\t\t\t\t\t\t\t\tnodeSet = &(child.children[1]);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\treturn (error(child) << \"unsupported property component '\" << name << \"' (expected: 'get' or 'set')\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\treturn unexpectedNode(child, \"[property]\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgExpr: {\n\t\t\t\t\/\/ read-only property\n\t\t\t\tif (unlikely(nodeGet))\n\t\t\t\t\treturn (error(object) << \"property: multiple definition of 'get'\");\n\t\t\t\tnodeGet = &object;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\treturn unexpectedNode(object, \"[property\/object]\");\n\t\t}\n\t}\n\tif (unlikely(!nodeGet and !nodeSet))\n\t\treturn (error(node) << \"empty property definition\");\n\tbool success = true;\n\tShortString128 propname;\n\tif (nodeGet) {\n\t\tif (!scope.context.reuse.properties.get.node)\n\t\t\tscope.context.prepareReuseForPropertiesGET();\n\t\tpropname << \"^propget^\" << varname;\n\t\tscope.context.reuse.properties.get.propname->text = propname;\n\t\tauto& type = *(scope.context.reuse.properties.get.type);\n\t\ttype.children.clear();\n\t\tif (ref)\n\t\t\ttype.children.push_back(scope.context.reuse.properties.get.typeIsRefAny);\n\t\telse\n\t\t\ttype.children.push_back(scope.context.reuse.properties.get.typeIsAny);\n\t\tauto& returnValue = *(scope.context.reuse.properties.get.returnValue);\n\t\treturnValue.children.clear();\n\t\treturnValue.children.push_back(nodeGet);\n\t\tauto& funcnode = *(scope.context.reuse.properties.get.node);\n\t\tsuccess &= scope.visitASTFunc(funcnode);\n\t\t\/\/ to avoid crap printed in the debugger\n\t\tscope.context.reuse.properties.get.propname->text.clear();\n\t\ttype.children.clear();\n\t\treturnValue.children.clear();\n\t}\n\tif (nodeSet) {\n\t\tif (!scope.context.reuse.properties.set.node)\n\t\t\tscope.context.prepareReuseForPropertiesSET();\n\t\tpropname.clear() << \"^propset^\" << varname;\n\t\tscope.context.reuse.properties.set.propname->text = propname;\n\t\tauto& body = *(scope.context.reuse.properties.set.body);\n\t\tbody.children.clear();\n\t\tbody.children.push_back(nodeSet);\n\t\tauto& funcnode = *(scope.context.reuse.properties.set.node);\n\t\tsuccess &= scope.visitASTFunc(funcnode);\n\t\t\/\/ to avoid crap printed in the debugger\n\t\tscope.context.reuse.properties.set.propname->text.clear();\n\t\tbody.children.clear();\n\t}\n\treturn success;\n}\n\n\n} \/\/ namespace\n\n\nbool Scope::visitASTVar(AST::Node& node) {\n\tassert(node.rule == AST::rgVar);\n\tassert(not node.children.empty());\n\tAnyString varname;\n\tbool ref = false;\n\tbool constant = false;\n\tAST::Node* varnodeDecl = nullptr;\n\tAST::Node* varAssign = nullptr;\n\tAST::Node* varType = nullptr;\n\tbool isProperty = false;\n\tfor (auto& child : node.children) {\n\t\tswitch (child.rule) {\n\t\t\tcase AST::rgIdentifier: {\n\t\t\t\tvarnodeDecl = &child;\n\t\t\t\tvarname = child.text;\n\t\t\t\tif (unlikely(not checkForValidIdentifierName(child, varname)))\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgVarAssign: {\n\t\t\t\tvarAssign = &child;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgVarProperty: {\n\t\t\t\tisProperty = true;\n\t\t\t\tvarAssign = &child;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgVarType: {\n\t\t\t\tvarType = &child;\n\t\t\t\tif (child.children.size() == 1 and child.children[0].rule == AST::rgType)\n\t\t\t\t\tvarType = &(child.children[0]);\n\t\t\t\telse\n\t\t\t\t\terror(child) << \"invalid type definition\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgVarByValue: {\n\t\t\t\tbreak; \/\/ nothing to do\n\t\t\t}\n\t\t\tcase AST::rgConst: {\n\t\t\t\tconstant = true;\n\t\t\t\twarning(child) << \"'const' in var declaration is currently not supported\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgRef: {\n\t\t\t\tref = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgCref: {\n\t\t\t\twarning(child) << \"'const' in var declaration is currently not supported\";\n\t\t\t\tref = true;\n\t\t\t\tconstant = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase AST::rgFuncParamVariadic: {\n\t\t\t\treturn (error(child) << \"variadic parameter not allowed in variable definition\");\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\treturn unexpectedNode(child, \"[var]\");\n\t\t}\n\t}\n\tif (unlikely(varnodeDecl == nullptr))\n\t\treturn (ice() << \"invalid null pointer for the var-decl node\");\n\tif (unlikely(varAssign == nullptr)) \/\/ the variable currently must have a default value\n\t\treturn (error(*varnodeDecl) << \"value initialization is missing for '\" << varname << '\\'');\n\tif (not isProperty) {\n\t\tswitch (kind) {\n\t\t\tcase Kind::kfunc:\n\t\t\t\treturn emitVarInFunc(*this, varname, *varnodeDecl, varType, varAssign, ref, constant);\n\t\t\tcase Kind::kclass:\n\t\t\t\treturn emitVarInClass(*this, varname, *varnodeDecl, varType, varAssign, ref, constant);\n\t\t\tdefault:\n\t\t\t\treturn (ice(*varnodeDecl) << \"var declaration: unsupported scope type\");\n\t\t}\n\t}\n\telse {\n\t\tif (unlikely(constant))\n\t\t\treturn (error(node) << \"'const' keyword for properties is not supported yet\");\n\t\tif (unlikely(varType))\n\t\t\treturn (error(node) << \"'type' for properties is not supported yet\");\n\t\tswitch (kind) {\n\t\t\tcase Kind::kclass:\n\t\t\tcase Kind::undefined:\n\t\t\t\treturn emitProperty(*this, varname, *varnodeDecl, varType, *varAssign, ref);\n\t\t\tcase Kind::kfunc:\n\t\t\t\treturn (error(*varnodeDecl) << \"properties in functions not implemented\");\n\t\t}\n\t}\n\treturn false;\n}\n\n\n} \/\/ namespace Producer\n} \/\/ namespace ir\n} \/\/ namespace ny\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: cfgdesc.hxx,v $\n *\n *  $Revision: 1.1.1.1 $\n *\n *  last change: $Author: hr $ $Date: 2000-09-18 17:14:38 $\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 _CFGDESC_HXX\n#define _CFGDESC_HXX\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\nclass SwCfgDesc\n{\nprotected:\n    String aFuncText;\n    String aLibName;\n    USHORT nEvent;\n\n    SwCfgDesc(const String &rFuncName, USHORT nId);\n    SwCfgDesc(const String &rLib,const String &rMacro);\n    ~SwCfgDesc();\n\npublic:\n    void SetEvent(USHORT nE);               \/\/ inline\n    void SetFuncText(const String &rStr);   \/\/ inline\n    void SetMacro(const String &rLib, const String &rMac);\n    BOOL IsMacro() const;\n    USHORT GetEvent() const;                \/\/ inline\n    String GetFuncText() const;             \/\/ inline\n    String GetMacro() const;                \/\/ inline\n    String GetLib() const;              \/\/ inline\n};\n\n\/\/ INLINE METHODE --------------------------------------------------------\ninline void SwCfgDesc::SetEvent(USHORT nE) {\n    nEvent = nE;\n}\n\ninline void SwCfgDesc::SetFuncText(const String &rStr) {\n    aFuncText = rStr;\n}\n\ninline  USHORT SwCfgDesc::GetEvent() const { return nEvent; }\ninline  String SwCfgDesc::GetFuncText() const { return aFuncText; }\ninline  String SwCfgDesc::GetMacro() const { return aFuncText; }\ninline  String SwCfgDesc::GetLib() const { return aLibName; }\n\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.1462); FILE MERGED 2005\/09\/05 13:44:59 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: cfgdesc.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 09:02: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 _CFGDESC_HXX\n#define _CFGDESC_HXX\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\nclass SwCfgDesc\n{\nprotected:\n    String aFuncText;\n    String aLibName;\n    USHORT nEvent;\n\n    SwCfgDesc(const String &rFuncName, USHORT nId);\n    SwCfgDesc(const String &rLib,const String &rMacro);\n    ~SwCfgDesc();\n\npublic:\n    void SetEvent(USHORT nE);               \/\/ inline\n    void SetFuncText(const String &rStr);   \/\/ inline\n    void SetMacro(const String &rLib, const String &rMac);\n    BOOL IsMacro() const;\n    USHORT GetEvent() const;                \/\/ inline\n    String GetFuncText() const;             \/\/ inline\n    String GetMacro() const;                \/\/ inline\n    String GetLib() const;              \/\/ inline\n};\n\n\/\/ INLINE METHODE --------------------------------------------------------\ninline void SwCfgDesc::SetEvent(USHORT nE) {\n    nEvent = nE;\n}\n\ninline void SwCfgDesc::SetFuncText(const String &rStr) {\n    aFuncText = rStr;\n}\n\ninline  USHORT SwCfgDesc::GetEvent() const { return nEvent; }\ninline  String SwCfgDesc::GetFuncText() const { return aFuncText; }\ninline  String SwCfgDesc::GetMacro() const { return aFuncText; }\ninline  String SwCfgDesc::GetLib() const { return aLibName; }\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"transactionrecord.h\"\n#include \"wallet\/wallet.h\"\n#include \"base58.h\"\n\nstd::string GetTxProject(uint256 hash, int& out_blocknumber, int& out_blocktype, double& out_rac);\n\n\n\/* Return positive answer if transaction should be shown in list. *\/\nbool TransactionRecord::showTransaction(const CWalletTx &wtx, bool datetime_limit_flag, const int64_t &datetime_limit)\n{\n\n    \/\/ Do not show transactions earlier than the datetime_limit if the flag is set.\n    if (datetime_limit_flag && (int64_t) wtx.nTime < datetime_limit)\n    {\n        return false;\n    }\n\n    std::string ShowOrphans = GetArg(\"-showorphans\", \"false\");\n\n\t\/\/R Halford - POS Transactions - If Orphaned follow showorphans directive:\n\tif (wtx.IsCoinStake() && !wtx.IsInMainChain())\n\t{\n\t       \/\/Orphaned tx\n\t\t   return (ShowOrphans==\"true\" ? true : false);\n    }\n\n    if (wtx.IsCoinBase())\n    {\n        \/\/ Ensures we show generated coins \/ mined transactions at depth 1\n        if (!wtx.IsInMainChain())\n        {\n            return false;\n        }\n    }\n\n    \/\/ Suppress OP_RETURN transactions if they did not originate from you.\n    \/\/ This is not \"very\" taxing but necessary since the transaction is in the wallet already.\n    \/\/ We only do this for version 1 transactions, because this legacy error does not occur\n    \/\/ anymore, and we can't filter entire transactions that have OP_RETURNs, since\n    \/\/ some outputs are relevent with the new contract types, such as messages.\n    if (wtx.nVersion == 1 && !wtx.IsFromMe())\n    {\n        for (auto const& txout : wtx.vout)\n        {\n            if (txout.scriptPubKey == (CScript() << OP_RETURN))\n                return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet *wallet, const CWalletTx &wtx)\n{\n    QList<TransactionRecord> parts;\n    int64_t nTime = wtx.GetTxTime();\n    int64_t nCredit = wtx.GetCredit(true);\n    int64_t nDebit = wtx.GetDebit();\n    int64_t nNet = nCredit - nDebit;\n    size_t wtx_size = wtx.vout.size();\n    uint256 hash = wtx.GetHash();\n\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n\n    bool fContractPresent = false;\n    NN::ContractType ContractType;\n\n    if (!wtx.GetContracts().empty())\n    {\n         const auto& contract = wtx.GetContracts().begin();\n         fContractPresent = true;\n         ContractType = contract->m_type.Value();\n    }\n\n    \/\/ This is legacy CoinBase for PoW, no longer used.\n    if (wtx.IsCoinBase())\n    {\n        for (const auto& txout :wtx.vout)\n        {\n            if (wallet->IsMine(txout) != ISMINE_NO)\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n\n                \/\/ Generated (proof-of-work)\n                sub.type = TransactionRecord::Generated;\n                sub.credit = txout.nValue;\n\n                parts.append(sub);\n            }\n        }\n    }\n    \/\/ Since we are now separating out the sent sidestake info\n    \/\/ into a separate subtransaction, we need to include the entire\n    \/\/ value of the coinstake transaction here, rather than the previous\n    \/\/ counting of only IsMine outputs.\n    else if (wtx.IsCoinStake())\n    {\n        \/\/ We check the first coinstake output (zero is empty) for IsMine to\n        \/\/ determine how to characterize the entire coinstake transaction. The\n        \/\/ sidestakes to other (not mine) addresses are accounted for as negatives\n        \/\/ in a separate subtransaction. The first output is ALWAYS guaranteed to be\n        \/\/ the stake return to the original owner, and so matches the input.\n        if (wallet->IsMine(wtx.vout[1]) != ISMINE_NO)\n        {\n            TransactionRecord sub(hash, nTime);\n            CTxDestination address;\n            sub.idx = parts.size();\n            sub.vout = 1;\n\n            sub.type = TransactionRecord::Generated;\n            \/\/ The coinstake HAS to be from an address.\n            if(ExtractDestination(wtx.vout[1].scriptPubKey, address))\n            {\n                sub.address = CBitcoinAddress(address).ToString();\n            }\n\n            \/\/ Here we add up all of the outputs, whether they are ours (the stake return with\n            \/\/ apportioned reward, or not (sidestake), because the part that is not ours\n            \/\/ will be accounted in the separated sidestake send transaction.\n            sub.credit = 0;\n            for (const auto& txout : wtx.vout)\n            {\n                sub.credit += txout.nValue;\n            }\n\n            sub.debit = -nDebit;\n\n            \/\/ Append the subtransaction to the parts QList (transaction record).\n            parts.append(sub);\n        }\n\n        \/\/ We only want outputs > 1 because the zeroth output is always empty,\n        \/\/ and the first output is always the staker's. Output 2 onwards may or\n        \/\/ may not be a sidestake, depending on whether stakesplitting is active,\n        \/\/ or whether sidestaking is even turned on.\n        \/\/ There is no coalescing here. A separate subtransaction is created for each\n        \/\/ sidestake.\n        for (unsigned int t = 2; t < wtx_size; t++)\n        {\n            \/\/ If this is not a stake split AND either vout[1] is mine OR\n            \/\/ vout[t] is mine\n            if (wtx.vout[t].scriptPubKey != wtx.vout[1].scriptPubKey &&\n                    (wallet->IsMine(wtx.vout[1]) != ISMINE_NO ||\n                     wallet->IsMine(wtx.vout[t]) != ISMINE_NO))\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n                sub.vout = t;\n\n                sub.type = TransactionRecord::Generated;\n\n                if (ExtractDestination(wtx.vout[t].scriptPubKey, address))\n                {\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n\n                int64_t nValue = wtx.vout[t].nValue;\n\n                if (wallet->IsMine(wtx.vout[t]) != ISMINE_NO)\n                {\n                    sub.credit = nValue;\n                }\n                else\n                {\n                    sub.debit = -nValue;\n                }\n\n                parts.append(sub);\n            }\n        }\n    }\n    else if (nNet > 0)\n    {\n        for (const auto& txout : wtx.vout)\n        {\n            if (wallet->IsMine(txout) != ISMINE_NO)\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    \/\/ Received by Bitcoin Address\n                    sub.type = TransactionRecord::RecvWithAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n\n                if (fContractPresent && ContractType == NN::ContractType::MESSAGE)\n                {\n                    sub.type = TransactionRecord::Message;\n                }\n\n                sub.credit = txout.nValue;\n\n                parts.append(sub);\n            }\n        }\n    }\n    else \/\/ Everything else\n    {\n        bool fAllFromMe = true;\n        for (auto const& txin : wtx.vin)\n            fAllFromMe = fAllFromMe && (wallet->IsMine(txin) != ISMINE_NO);\n\n        bool fAllToMe = true;\n        for (auto const& txout : wtx.vout)\n            fAllToMe = fAllToMe && (wallet->IsMine(txout) != ISMINE_NO);\n\n        if (fAllFromMe && fAllToMe)\n        {\n            \/\/ Payment to self\n            int64_t nChange = wtx.GetChange();\n\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::SendToSelf, \"\",\n                                           -(nDebit - nChange), nCredit - nChange, 0));\n        }\n        else if (fAllFromMe)\n        {\n            \/\/\n            \/\/ Debit\n            \/\/\n            int64_t nTxFee = nDebit - wtx.GetValueOut();\n\n            \/\/ for tracking message type display\n            bool fMessageDisplayed = false;\n\n            for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++)\n            {\n                const CTxOut& txout = wtx.vout[nOut];\n                TransactionRecord sub(hash, nTime);\n                sub.idx = parts.size();\n\n                if(wallet->IsMine(txout) != ISMINE_NO)\n                {\n                    \/\/ Ignore parts sent to self, as this is usually the change\n                    \/\/ from a transaction sent back to our own address.\n                    continue;\n                }\n\n                CTxDestination address;\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    \/\/ Sent to Bitcoin Address\n                    sub.type = TransactionRecord::SendToAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::SendToOther;\n                    sub.address = mapValue[\"to\"];\n                }\n\n                int64_t nValue = txout.nValue;\n                \/* Add fee to first output *\/\n                if (nTxFee > 0)\n                {\n                    nValue += nTxFee;\n                    nTxFee = 0;\n                }\n                sub.debit = -nValue;\n\n                \/\/ Determine if the transaction is a beacon advertisement or a vote.\n                \/\/ For right now, there should only be one contract in a transaction.\n                \/\/ We will simply select the first and only one. Note that we are\n                \/\/ looping through the outputs one by one in the for loop above this,\n                \/\/ So if we get here, we are not a coinbase or coinstake, and we are on\n                \/\/ an output that isn't ours. The worst that can happen from this\n                \/\/ simple approach is to label more than one output with the\n                \/\/ first found contract type. For right now, this is sufficient, because\n                \/\/ the contracts that are sent right now only contain two outputs,\n                \/\/ the burn and the change. We will have to get more sophisticated\n                \/\/ when we allow more than one contract per transaction.\n\n                \/\/ Notice this doesn't mess with the value or debit, it simply\n                \/\/ overrides the TransactionRecord enum type.\n                if (fContractPresent)\n                {\n                    switch (ContractType)\n                    {\n                    case NN::ContractType::BEACON:\n                        sub.type = TransactionRecord::BeaconAdvertisement;\n                        break;\n                    case NN::ContractType::POLL:\n                        sub.type = TransactionRecord::Poll;\n                        break;\n                    case NN::ContractType::VOTE:\n                        sub.type = TransactionRecord::Vote;\n                        break;\n                    case NN::ContractType::MESSAGE:\n                        \/\/ Only display the message type for the first not is mine output\n                        if (!fMessageDisplayed && wallet->IsMine(txout) == ISMINE_NO)\n                        {\n                            sub.type = TransactionRecord::Message;\n                            fMessageDisplayed = true;\n                        }\n                        \/\/ Do not display the op return output for a send message contract separately.\n                        else if (txout.scriptPubKey[0] == OP_RETURN)\n                        {\n                            continue;\n                        }\n                        break;\n                    default:\n                        break; \/\/ Suppress warning\n                    }\n                }\n\n                parts.append(sub);\n            }\n        }\n        else\n        {\n            \/\/\n            \/\/ Mixed debit transaction, can't break down payees\n            \/\/\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0, 0));\n        }\n    }\n\n    return parts;\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx &wtx)\n{\n    AssertLockHeld(cs_main);\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    BlockMap::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    status.countsForBalance = wtx.IsTrusted() && !(wtx.GetBlocksToMaturity() > 0);\n    status.depth = wtx.GetDepthInMainChain();\n    status.cur_num_blocks = nBestHeight;\n\n    if (!IsFinalTx(wtx, nBestHeight + 1))\n    {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD)\n        {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = wtx.nLockTime - nBestHeight;\n        }\n        else\n        {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n\n    \/\/ For generated transactions, determine maturity\n    else if(type == TransactionRecord::Generated)\n    {\n        if (wtx.GetBlocksToMaturity() > 0)\n        {\n            status.status = TransactionStatus::Immature;\n\n            if (wtx.IsInMainChain())\n            {\n                status.matures_in = wtx.GetBlocksToMaturity();\n\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.status = TransactionStatus::MaturesWarning;\n            }\n            else\n            {\n                status.status = TransactionStatus::NotAccepted;\n            }\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n    else\n    {\n        if (status.depth < 0)\n        {\n            status.status = TransactionStatus::Conflicted;\n        }\n        else if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n        {\n            status.status = TransactionStatus::Offline;\n        }\n        else if (status.depth == 0)\n        {\n            status.status = TransactionStatus::Unconfirmed;\n        }\n        else if (status.depth < RecommendedNumConfirmations)\n        {\n            status.status = TransactionStatus::Confirming;\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    AssertLockHeld(cs_main);\n    return status.cur_num_blocks != nBestHeight;\n}\n\nstd::string TransactionRecord::getTxID()\n{\n    return hash.ToString();\n}\n\n\n<commit_msg>Fix warning of possible uninitialized ContractType<commit_after>#include \"transactionrecord.h\"\n#include \"wallet\/wallet.h\"\n#include \"base58.h\"\n\nstd::string GetTxProject(uint256 hash, int& out_blocknumber, int& out_blocktype, double& out_rac);\n\n\n\/* Return positive answer if transaction should be shown in list. *\/\nbool TransactionRecord::showTransaction(const CWalletTx &wtx, bool datetime_limit_flag, const int64_t &datetime_limit)\n{\n\n    \/\/ Do not show transactions earlier than the datetime_limit if the flag is set.\n    if (datetime_limit_flag && (int64_t) wtx.nTime < datetime_limit)\n    {\n        return false;\n    }\n\n    std::string ShowOrphans = GetArg(\"-showorphans\", \"false\");\n\n\t\/\/R Halford - POS Transactions - If Orphaned follow showorphans directive:\n\tif (wtx.IsCoinStake() && !wtx.IsInMainChain())\n\t{\n\t       \/\/Orphaned tx\n\t\t   return (ShowOrphans==\"true\" ? true : false);\n    }\n\n    if (wtx.IsCoinBase())\n    {\n        \/\/ Ensures we show generated coins \/ mined transactions at depth 1\n        if (!wtx.IsInMainChain())\n        {\n            return false;\n        }\n    }\n\n    \/\/ Suppress OP_RETURN transactions if they did not originate from you.\n    \/\/ This is not \"very\" taxing but necessary since the transaction is in the wallet already.\n    \/\/ We only do this for version 1 transactions, because this legacy error does not occur\n    \/\/ anymore, and we can't filter entire transactions that have OP_RETURNs, since\n    \/\/ some outputs are relevent with the new contract types, such as messages.\n    if (wtx.nVersion == 1 && !wtx.IsFromMe())\n    {\n        for (auto const& txout : wtx.vout)\n        {\n            if (txout.scriptPubKey == (CScript() << OP_RETURN))\n                return false;\n        }\n    }\n    return true;\n}\n\n\/*\n * Decompose CWallet transaction to model transaction records.\n *\/\nQList<TransactionRecord> TransactionRecord::decomposeTransaction(const CWallet *wallet, const CWalletTx &wtx)\n{\n    QList<TransactionRecord> parts;\n    int64_t nTime = wtx.GetTxTime();\n    int64_t nCredit = wtx.GetCredit(true);\n    int64_t nDebit = wtx.GetDebit();\n    int64_t nNet = nCredit - nDebit;\n    size_t wtx_size = wtx.vout.size();\n    uint256 hash = wtx.GetHash();\n\n    std::map<std::string, std::string> mapValue = wtx.mapValue;\n\n    bool fContractPresent = false;\n    \/\/ Initialize to unknown to prevent a possible uninitialized warning.\n    NN::ContractType ContractType = NN::ContractType::UNKNOWN;\n\n    if (!wtx.GetContracts().empty())\n    {\n         const auto& contract = wtx.GetContracts().begin();\n         fContractPresent = true;\n         ContractType = contract->m_type.Value();\n    }\n\n    \/\/ This is legacy CoinBase for PoW, no longer used.\n    if (wtx.IsCoinBase())\n    {\n        for (const auto& txout :wtx.vout)\n        {\n            if (wallet->IsMine(txout) != ISMINE_NO)\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n\n                \/\/ Generated (proof-of-work)\n                sub.type = TransactionRecord::Generated;\n                sub.credit = txout.nValue;\n\n                parts.append(sub);\n            }\n        }\n    }\n    \/\/ Since we are now separating out the sent sidestake info\n    \/\/ into a separate subtransaction, we need to include the entire\n    \/\/ value of the coinstake transaction here, rather than the previous\n    \/\/ counting of only IsMine outputs.\n    else if (wtx.IsCoinStake())\n    {\n        \/\/ We check the first coinstake output (zero is empty) for IsMine to\n        \/\/ determine how to characterize the entire coinstake transaction. The\n        \/\/ sidestakes to other (not mine) addresses are accounted for as negatives\n        \/\/ in a separate subtransaction. The first output is ALWAYS guaranteed to be\n        \/\/ the stake return to the original owner, and so matches the input.\n        if (wallet->IsMine(wtx.vout[1]) != ISMINE_NO)\n        {\n            TransactionRecord sub(hash, nTime);\n            CTxDestination address;\n            sub.idx = parts.size();\n            sub.vout = 1;\n\n            sub.type = TransactionRecord::Generated;\n            \/\/ The coinstake HAS to be from an address.\n            if(ExtractDestination(wtx.vout[1].scriptPubKey, address))\n            {\n                sub.address = CBitcoinAddress(address).ToString();\n            }\n\n            \/\/ Here we add up all of the outputs, whether they are ours (the stake return with\n            \/\/ apportioned reward, or not (sidestake), because the part that is not ours\n            \/\/ will be accounted in the separated sidestake send transaction.\n            sub.credit = 0;\n            for (const auto& txout : wtx.vout)\n            {\n                sub.credit += txout.nValue;\n            }\n\n            sub.debit = -nDebit;\n\n            \/\/ Append the subtransaction to the parts QList (transaction record).\n            parts.append(sub);\n        }\n\n        \/\/ We only want outputs > 1 because the zeroth output is always empty,\n        \/\/ and the first output is always the staker's. Output 2 onwards may or\n        \/\/ may not be a sidestake, depending on whether stakesplitting is active,\n        \/\/ or whether sidestaking is even turned on.\n        \/\/ There is no coalescing here. A separate subtransaction is created for each\n        \/\/ sidestake.\n        for (unsigned int t = 2; t < wtx_size; t++)\n        {\n            \/\/ If this is not a stake split AND either vout[1] is mine OR\n            \/\/ vout[t] is mine\n            if (wtx.vout[t].scriptPubKey != wtx.vout[1].scriptPubKey &&\n                    (wallet->IsMine(wtx.vout[1]) != ISMINE_NO ||\n                     wallet->IsMine(wtx.vout[t]) != ISMINE_NO))\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n                sub.vout = t;\n\n                sub.type = TransactionRecord::Generated;\n\n                if (ExtractDestination(wtx.vout[t].scriptPubKey, address))\n                {\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n\n                int64_t nValue = wtx.vout[t].nValue;\n\n                if (wallet->IsMine(wtx.vout[t]) != ISMINE_NO)\n                {\n                    sub.credit = nValue;\n                }\n                else\n                {\n                    sub.debit = -nValue;\n                }\n\n                parts.append(sub);\n            }\n        }\n    }\n    else if (nNet > 0)\n    {\n        for (const auto& txout : wtx.vout)\n        {\n            if (wallet->IsMine(txout) != ISMINE_NO)\n            {\n                TransactionRecord sub(hash, nTime);\n                CTxDestination address;\n                sub.idx = parts.size(); \/\/ sequence number\n\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    \/\/ Received by Bitcoin Address\n                    sub.type = TransactionRecord::RecvWithAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Received by IP connection (deprecated features), or a multisignature or other non-simple transaction\n                    sub.type = TransactionRecord::RecvFromOther;\n                    sub.address = mapValue[\"from\"];\n                }\n\n                if (fContractPresent && ContractType == NN::ContractType::MESSAGE)\n                {\n                    sub.type = TransactionRecord::Message;\n                }\n\n                sub.credit = txout.nValue;\n\n                parts.append(sub);\n            }\n        }\n    }\n    else \/\/ Everything else\n    {\n        bool fAllFromMe = true;\n        for (auto const& txin : wtx.vin)\n            fAllFromMe = fAllFromMe && (wallet->IsMine(txin) != ISMINE_NO);\n\n        bool fAllToMe = true;\n        for (auto const& txout : wtx.vout)\n            fAllToMe = fAllToMe && (wallet->IsMine(txout) != ISMINE_NO);\n\n        if (fAllFromMe && fAllToMe)\n        {\n            \/\/ Payment to self\n            int64_t nChange = wtx.GetChange();\n\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::SendToSelf, \"\",\n                                           -(nDebit - nChange), nCredit - nChange, 0));\n        }\n        else if (fAllFromMe)\n        {\n            \/\/\n            \/\/ Debit\n            \/\/\n            int64_t nTxFee = nDebit - wtx.GetValueOut();\n\n            \/\/ for tracking message type display\n            bool fMessageDisplayed = false;\n\n            for (unsigned int nOut = 0; nOut < wtx.vout.size(); nOut++)\n            {\n                const CTxOut& txout = wtx.vout[nOut];\n                TransactionRecord sub(hash, nTime);\n                sub.idx = parts.size();\n\n                if(wallet->IsMine(txout) != ISMINE_NO)\n                {\n                    \/\/ Ignore parts sent to self, as this is usually the change\n                    \/\/ from a transaction sent back to our own address.\n                    continue;\n                }\n\n                CTxDestination address;\n                if (ExtractDestination(txout.scriptPubKey, address))\n                {\n                    \/\/ Sent to Bitcoin Address\n                    sub.type = TransactionRecord::SendToAddress;\n                    sub.address = CBitcoinAddress(address).ToString();\n                }\n                else\n                {\n                    \/\/ Sent to IP, or other non-address transaction like OP_EVAL\n                    sub.type = TransactionRecord::SendToOther;\n                    sub.address = mapValue[\"to\"];\n                }\n\n                int64_t nValue = txout.nValue;\n                \/* Add fee to first output *\/\n                if (nTxFee > 0)\n                {\n                    nValue += nTxFee;\n                    nTxFee = 0;\n                }\n                sub.debit = -nValue;\n\n                \/\/ Determine if the transaction is a beacon advertisement or a vote.\n                \/\/ For right now, there should only be one contract in a transaction.\n                \/\/ We will simply select the first and only one. Note that we are\n                \/\/ looping through the outputs one by one in the for loop above this,\n                \/\/ So if we get here, we are not a coinbase or coinstake, and we are on\n                \/\/ an output that isn't ours. The worst that can happen from this\n                \/\/ simple approach is to label more than one output with the\n                \/\/ first found contract type. For right now, this is sufficient, because\n                \/\/ the contracts that are sent right now only contain two outputs,\n                \/\/ the burn and the change. We will have to get more sophisticated\n                \/\/ when we allow more than one contract per transaction.\n\n                \/\/ Notice this doesn't mess with the value or debit, it simply\n                \/\/ overrides the TransactionRecord enum type.\n                if (fContractPresent)\n                {\n                    switch (ContractType)\n                    {\n                    case NN::ContractType::BEACON:\n                        sub.type = TransactionRecord::BeaconAdvertisement;\n                        break;\n                    case NN::ContractType::POLL:\n                        sub.type = TransactionRecord::Poll;\n                        break;\n                    case NN::ContractType::VOTE:\n                        sub.type = TransactionRecord::Vote;\n                        break;\n                    case NN::ContractType::MESSAGE:\n                        \/\/ Only display the message type for the first not is mine output\n                        if (!fMessageDisplayed && wallet->IsMine(txout) == ISMINE_NO)\n                        {\n                            sub.type = TransactionRecord::Message;\n                            fMessageDisplayed = true;\n                        }\n                        \/\/ Do not display the op return output for a send message contract separately.\n                        else if (txout.scriptPubKey[0] == OP_RETURN)\n                        {\n                            continue;\n                        }\n                        break;\n                    default:\n                        break; \/\/ Suppress warning\n                    }\n                }\n\n                parts.append(sub);\n            }\n        }\n        else\n        {\n            \/\/\n            \/\/ Mixed debit transaction, can't break down payees\n            \/\/\n            parts.append(TransactionRecord(hash, nTime, TransactionRecord::Other, \"\", nNet, 0, 0));\n        }\n    }\n\n    return parts;\n}\n\nvoid TransactionRecord::updateStatus(const CWalletTx &wtx)\n{\n    AssertLockHeld(cs_main);\n    \/\/ Determine transaction status\n\n    \/\/ Find the block the tx is in\n    CBlockIndex* pindex = NULL;\n    BlockMap::iterator mi = mapBlockIndex.find(wtx.hashBlock);\n    if (mi != mapBlockIndex.end())\n        pindex = (*mi).second;\n\n    \/\/ Sort order, unrecorded transactions sort to the top\n    status.sortKey = strprintf(\"%010d-%01d-%010u-%03d\",\n        (pindex ? pindex->nHeight : std::numeric_limits<int>::max()),\n        (wtx.IsCoinBase() ? 1 : 0),\n        wtx.nTimeReceived,\n        idx);\n    status.countsForBalance = wtx.IsTrusted() && !(wtx.GetBlocksToMaturity() > 0);\n    status.depth = wtx.GetDepthInMainChain();\n    status.cur_num_blocks = nBestHeight;\n\n    if (!IsFinalTx(wtx, nBestHeight + 1))\n    {\n        if (wtx.nLockTime < LOCKTIME_THRESHOLD)\n        {\n            status.status = TransactionStatus::OpenUntilBlock;\n            status.open_for = wtx.nLockTime - nBestHeight;\n        }\n        else\n        {\n            status.status = TransactionStatus::OpenUntilDate;\n            status.open_for = wtx.nLockTime;\n        }\n    }\n\n    \/\/ For generated transactions, determine maturity\n    else if(type == TransactionRecord::Generated)\n    {\n        if (wtx.GetBlocksToMaturity() > 0)\n        {\n            status.status = TransactionStatus::Immature;\n\n            if (wtx.IsInMainChain())\n            {\n                status.matures_in = wtx.GetBlocksToMaturity();\n\n                \/\/ Check if the block was requested by anyone\n                if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n                    status.status = TransactionStatus::MaturesWarning;\n            }\n            else\n            {\n                status.status = TransactionStatus::NotAccepted;\n            }\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n    else\n    {\n        if (status.depth < 0)\n        {\n            status.status = TransactionStatus::Conflicted;\n        }\n        else if (GetAdjustedTime() - wtx.nTimeReceived > 2 * 60 && wtx.GetRequestCount() == 0)\n        {\n            status.status = TransactionStatus::Offline;\n        }\n        else if (status.depth == 0)\n        {\n            status.status = TransactionStatus::Unconfirmed;\n        }\n        else if (status.depth < RecommendedNumConfirmations)\n        {\n            status.status = TransactionStatus::Confirming;\n        }\n        else\n        {\n            status.status = TransactionStatus::Confirmed;\n        }\n    }\n}\n\nbool TransactionRecord::statusUpdateNeeded()\n{\n    AssertLockHeld(cs_main);\n    return status.cur_num_blocks != nBestHeight;\n}\n\nstd::string TransactionRecord::getTxID()\n{\n    return hash.ToString();\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*------------------------------------------------------------------------------\n\n    Copyright (c) 2004 Media Development Loan Fund\n \n    This file is part of the Campcaster project.\n    http:\/\/campcaster.campware.org\/\n    To report bugs, send an e-mail to bugs@campware.org\n \n    Campcaster 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    Campcaster is distributed in the hope that it 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 Campcaster; if not, write to the Free Software\n    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n \n \n    Author   : $Author$\n    Version  : $Revision$\n    Location : $URL$\n\n------------------------------------------------------------------------------*\/\n\n\/* ============================================================ include files *\/\n\n#ifdef HAVE_CONFIG_H\n#include \"configure.h\"\n#endif\n\n#include <iostream>\n\n#include \"LiveSupport\/Widgets\/WidgetFactory.h\"\n\n#include \"CuePlayer.h\"\n\n\nusing namespace LiveSupport::Core;\nusing namespace LiveSupport::Widgets;\nusing namespace LiveSupport::GLiveSupport;\n\n\/* ===================================================  local data structures *\/\n\n\n\/* ================================================  local constants & macros *\/\n\n\n\/* ===============================================  local function prototypes *\/\n\n\n\/* =============================================================  module code *\/\n\n\/*------------------------------------------------------------------------------\n *  Constructor.\n *----------------------------------------------------------------------------*\/\nCuePlayer :: CuePlayer(Ptr<GLiveSupport>::Ref                   gLiveSupport,\n                       Gtk::TreeView *                          treeView,\n                       const PlayableTreeModelColumnRecord &    modelColumns)\n                                                                    throw ()\n          : gLiveSupport(gLiveSupport),\n            treeView(treeView),\n            modelColumns(modelColumns)\n{\n    Ptr<WidgetFactory>::Ref     wf = WidgetFactory::getInstance();\n    \n    playButton = Gtk::manage(wf->createButton(\n                                    WidgetConstants::smallPlayButton ));\n    pauseButton = Gtk::manage(wf->createButton(\n                                    WidgetConstants::smallPauseButton ));\n    stopButton = Gtk::manage(wf->createButton(\n                                    WidgetConstants::smallStopButton ));\n\n    playButton->signal_clicked().connect(sigc::mem_fun(*this,\n                                        &CuePlayer::onPlayButtonClicked ));\n    pauseButton->signal_clicked().connect(sigc::mem_fun(*this,\n                                        &CuePlayer::onPauseButtonClicked ));\n    stopButton->signal_clicked().connect(sigc::mem_fun(*this,\n                                        &CuePlayer::onStopButtonClicked ));\n\n    pack_end(*stopButton, Gtk::PACK_SHRINK, 3);\n    pack_end(*playButton, Gtk::PACK_SHRINK, 3);\n\n    audioState = waitingState;\n    \n    gLiveSupport->attachCueAudioListener(this);\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Destructor.\n *----------------------------------------------------------------------------*\/\nCuePlayer :: ~CuePlayer(void)                                       throw ()\n{\n    try {\n        gLiveSupport->detachCueAudioListener(this);\n    } catch (std::invalid_argument &e) {\n        std::cerr << \"Could not detach cue player audio listener.\"\n                  << std::endl;\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the Play menu item selected from the entry context menu\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onPlayItem(void)                                       throw ()\n{\n    Glib::RefPtr<Gtk::TreeView::Selection> \n                    selection       = treeView->get_selection();\n    std::vector<Gtk::TreePath> \n                    selectedRows    = selection->get_selected_rows();\n    Gtk::TreeIter   iter;\n    \n    if (selectedRows.size() > 0) {\n        Gtk::TreePath   path = selectedRows.front();\n        iter = treeView->get_model()->get_iter(path);\n    } else {\n        iter = treeView->get_model()->children().begin();\n    }\n    \n    if (iter) {\n        Ptr<Playable>::Ref  playable = (*iter)[modelColumns.playableColumn];\n        try {\n            gLiveSupport->playCueAudio(playable);\n            setAudioState(playingState);\n        } catch (std::runtime_error &e) {\n            std::cerr << \"GLiveSupport::playCueAudio() error:\"\n                        << std::endl << e.what() << std::endl;\n        }\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the Play button getting clicked\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onPlayButtonClicked(void)                              throw ()\n{\n    switch (audioState) {\n        case waitingState:\n            onPlayItem();\n            break;\n            \n        case playingState:      \/\/ should never happen\n            std::cerr << \"Assertion failed in CuePlayer:\" << std::endl\n                      << \"play button clicked when it should not be visible.\"\n                      << std::endl;\n            break;\n            \n        case pausedState:\n            try {\n                gLiveSupport->pauseCueAudio();      \/\/ ie, restart\n                setAudioState(playingState);\n            } catch (std::logic_error &e) {\n                std::cerr << \"GLiveSupport::pauseCueAudio() error:\" << std::endl\n                            << e.what() << std::endl;\n            }\n            break;\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the Pause button getting clicked\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onPauseButtonClicked(void)                             throw ()\n{\n    try {\n        gLiveSupport->pauseCueAudio();\n        setAudioState(pausedState);\n    } catch (std::logic_error &e) {\n        std::cerr << \"GLiveSupport::pauseCueAudio() error:\" << std::endl\n                    << e.what() << std::endl;\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the Stop button getting clicked\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onStopButtonClicked(void)                              throw ()\n{\n    if (audioState != waitingState) {\n        try {\n            gLiveSupport->stopCueAudio();\n        } catch (std::logic_error &e) {\n            std::cerr << \"GLiveSupport::stopCueAudio() error:\" << std::endl\n                        << e.what() << std::endl;\n        }\n        setAudioState(waitingState);\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the \"cue audio player has stopped\" event.\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onStop(Ptr<const Glib::ustring>::Ref  errorMessage)    throw ()\n{\n    setAudioState(waitingState);\n    \n    if (errorMessage) {\n        gLiveSupport->displayMessageWindow(errorMessage);\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Set the state of the widget.\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: setAudioState(AudioState    newState)                  throw ()\n{\n    if ((audioState == waitingState || audioState == pausedState)\n                && newState == playingState) {\n        remove(*playButton);\n        pack_end(*pauseButton, Gtk::PACK_SHRINK, 3);\n        pauseButton->show();\n        gLiveSupport->runMainLoop();\n        \n    } else if (audioState == playingState\n                && (newState == waitingState || newState == pausedState)) {\n        remove(*pauseButton);\n        pack_end(*playButton, Gtk::PACK_SHRINK, 3);\n        playButton->show();\n        gLiveSupport->runMainLoop();\n    }\n    \n    audioState = newState;\n}\n\n<commit_msg>fixed the bug that the Cue player Play\/Pause button stays on Pause if there is an audio player error<commit_after>\/*------------------------------------------------------------------------------\n\n    Copyright (c) 2004 Media Development Loan Fund\n \n    This file is part of the Campcaster project.\n    http:\/\/campcaster.campware.org\/\n    To report bugs, send an e-mail to bugs@campware.org\n \n    Campcaster 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    Campcaster is distributed in the hope that it 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 Campcaster; if not, write to the Free Software\n    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n \n \n    Author   : $Author$\n    Version  : $Revision$\n    Location : $URL$\n\n------------------------------------------------------------------------------*\/\n\n\/* ============================================================ include files *\/\n\n#ifdef HAVE_CONFIG_H\n#include \"configure.h\"\n#endif\n\n#include <iostream>\n\n#include \"LiveSupport\/Widgets\/WidgetFactory.h\"\n\n#include \"CuePlayer.h\"\n\n\nusing namespace LiveSupport::Core;\nusing namespace LiveSupport::Widgets;\nusing namespace LiveSupport::GLiveSupport;\n\n\/* ===================================================  local data structures *\/\n\n\n\/* ================================================  local constants & macros *\/\n\n\n\/* ===============================================  local function prototypes *\/\n\n\n\/* =============================================================  module code *\/\n\n\/*------------------------------------------------------------------------------\n *  Constructor.\n *----------------------------------------------------------------------------*\/\nCuePlayer :: CuePlayer(Ptr<GLiveSupport>::Ref                   gLiveSupport,\n                       Gtk::TreeView *                          treeView,\n                       const PlayableTreeModelColumnRecord &    modelColumns)\n                                                                    throw ()\n          : gLiveSupport(gLiveSupport),\n            treeView(treeView),\n            modelColumns(modelColumns)\n{\n    Ptr<WidgetFactory>::Ref     wf = WidgetFactory::getInstance();\n    \n    playButton = Gtk::manage(wf->createButton(\n                                    WidgetConstants::smallPlayButton ));\n    pauseButton = Gtk::manage(wf->createButton(\n                                    WidgetConstants::smallPauseButton ));\n    stopButton = Gtk::manage(wf->createButton(\n                                    WidgetConstants::smallStopButton ));\n\n    playButton->signal_clicked().connect(sigc::mem_fun(*this,\n                                        &CuePlayer::onPlayButtonClicked ));\n    pauseButton->signal_clicked().connect(sigc::mem_fun(*this,\n                                        &CuePlayer::onPauseButtonClicked ));\n    stopButton->signal_clicked().connect(sigc::mem_fun(*this,\n                                        &CuePlayer::onStopButtonClicked ));\n\n    pack_end(*stopButton, Gtk::PACK_SHRINK, 3);\n    pack_end(*playButton, Gtk::PACK_SHRINK, 3);\n\n    audioState = waitingState;\n    \n    gLiveSupport->attachCueAudioListener(this);\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Destructor.\n *----------------------------------------------------------------------------*\/\nCuePlayer :: ~CuePlayer(void)                                       throw ()\n{\n    try {\n        gLiveSupport->detachCueAudioListener(this);\n    } catch (std::invalid_argument &e) {\n        std::cerr << \"Could not detach cue player audio listener.\"\n                  << std::endl;\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the Play menu item selected from the entry context menu\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onPlayItem(void)                                       throw ()\n{\n    Glib::RefPtr<Gtk::TreeView::Selection> \n                    selection       = treeView->get_selection();\n    std::vector<Gtk::TreePath> \n                    selectedRows    = selection->get_selected_rows();\n    Gtk::TreeIter   iter;\n    \n    if (selectedRows.size() > 0) {\n        Gtk::TreePath   path = selectedRows.front();\n        iter = treeView->get_model()->get_iter(path);\n    } else {\n        iter = treeView->get_model()->children().begin();\n    }\n    \n    if (iter) {\n        Ptr<Playable>::Ref  playable = (*iter)[modelColumns.playableColumn];\n        try {\n            setAudioState(playingState);\n            gLiveSupport->playCueAudio(playable);\n        } catch (std::runtime_error &e) {\n            std::cerr << \"GLiveSupport::playCueAudio() error:\"\n                        << std::endl << e.what() << std::endl;\n        }\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the Play button getting clicked\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onPlayButtonClicked(void)                              throw ()\n{\n    switch (audioState) {\n        case waitingState:\n            onPlayItem();\n            break;\n            \n        case playingState:      \/\/ should never happen\n            std::cerr << \"Assertion failed in CuePlayer:\" << std::endl\n                      << \"play button clicked when it should not be visible.\"\n                      << std::endl;\n            break;\n            \n        case pausedState:\n            try {\n                gLiveSupport->pauseCueAudio();      \/\/ ie, restart\n                setAudioState(playingState);\n            } catch (std::logic_error &e) {\n                std::cerr << \"GLiveSupport::pauseCueAudio() error:\" << std::endl\n                            << e.what() << std::endl;\n            }\n            break;\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the Pause button getting clicked\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onPauseButtonClicked(void)                             throw ()\n{\n    try {\n        gLiveSupport->pauseCueAudio();\n        setAudioState(pausedState);\n    } catch (std::logic_error &e) {\n        std::cerr << \"GLiveSupport::pauseCueAudio() error:\" << std::endl\n                    << e.what() << std::endl;\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the Stop button getting clicked\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onStopButtonClicked(void)                              throw ()\n{\n    if (audioState != waitingState) {\n        try {\n            gLiveSupport->stopCueAudio();\n        } catch (std::logic_error &e) {\n            std::cerr << \"GLiveSupport::stopCueAudio() error:\" << std::endl\n                        << e.what() << std::endl;\n        }\n        setAudioState(waitingState);\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Event handler for the \"cue audio player has stopped\" event.\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: onStop(Ptr<const Glib::ustring>::Ref  errorMessage)    throw ()\n{\n    setAudioState(waitingState);\n    \n    if (errorMessage) {\n        gLiveSupport->displayMessageWindow(errorMessage);\n    }\n}\n\n\n\/*------------------------------------------------------------------------------\n *  Set the state of the widget.\n *----------------------------------------------------------------------------*\/\nvoid\nCuePlayer :: setAudioState(AudioState    newState)                  throw ()\n{\n    if ((audioState == waitingState || audioState == pausedState)\n                && newState == playingState) {\n        remove(*playButton);\n        pack_end(*pauseButton, Gtk::PACK_SHRINK, 3);\n        pauseButton->show();\n        gLiveSupport->runMainLoop();\n        \n    } else if (audioState == playingState\n                && (newState == waitingState || newState == pausedState)) {\n        remove(*pauseButton);\n        pack_end(*playButton, Gtk::PACK_SHRINK, 3);\n        playButton->show();\n        gLiveSupport->runMainLoop();\n    }\n    \n    audioState = newState;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  Copyright 2013 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#include \"imageio.h\"\n#include <iostream>\n#include <time.h>       \/* time_t, struct tm, gmtime *\/\n#include <libraw\/libraw.h>\n\n\/\/ This plugin utilises LibRaw:\n\/\/ http:\/\/www.libraw.org\/\n\/\/ Documentation: \n\/\/ http:\/\/www.libraw.org\/docs\n\nOIIO_PLUGIN_NAMESPACE_BEGIN\n\nclass RawInput : public ImageInput {\npublic:\n    RawInput () : m_process(true), m_image(NULL) {}\n    virtual ~RawInput() { close(); }\n    virtual const char * format_name (void) const { return \"raw\"; }\n    virtual bool open (const std::string &name, ImageSpec &newspec);\n    virtual bool open (const std::string &name, ImageSpec &newspec, ImageSpec &config);\n    virtual bool close();\n    virtual bool read_native_scanline (int y, int z, void *data);\n\nprivate:\n    bool process();\n    bool m_process;\n    LibRaw m_processor;\n    libraw_processed_image_t *m_image;\n};\n\n\n\n\/\/ Export version number and create function symbols\nOIIO_PLUGIN_EXPORTS_BEGIN\n\n    OIIO_EXPORT int raw_imageio_version = OIIO_PLUGIN_VERSION;\n    OIIO_EXPORT ImageInput *raw_input_imageio_create () {\n        return new RawInput;\n    }\n    OIIO_EXPORT const char *raw_input_extensions[] = {\n        \"bay\", \"bmq\", \"cr2\", \"crw\", \"cs1\", \"dc2\", \"dcr\", \"dng\",\n        \"erf\", \"fff\", \"hdr\", \"k25\", \"kdc\", \"mdc\", \"mos\", \"mrw\",\n        \"nef\", \"orf\", \"pef\", \"pxn\", \"raf\", \"raw\", \"rdc\", \"sr2\",\n        \"srf\", \"x3f\", \"arw\", \"3fr\", \"cine\", \"ia\", \"kc2\", \"mef\",\n        \"nrw\", \"qtk\", \"rw2\", \"sti\", \"rwl\", \"srw\", \"drf\", \"dsc\",\n        \"ptx\", \"cap\", \"iiq\", \"rwz\", NULL\n    };\n\nOIIO_PLUGIN_EXPORTS_END\n\n\n\nbool\nRawInput::open (const std::string &name, ImageSpec &newspec)\n{\n    \/\/ If user doesn't want to provide any config, just use an empty spec.\n    ImageSpec config;\n    return open(name, newspec, config);\n}\n\n\n\nbool\nRawInput::open (const std::string &name, ImageSpec &newspec, ImageSpec &config)\n{\n    int ret;\n\n    \/\/ open the image\n    if ( (ret = m_processor.open_file(name.c_str()) ) != LIBRAW_SUCCESS) {\n        error (\"Could not open file \\\"%s\\\", %s\", name.c_str(), libraw_strerror(ret));\n        return false;\n    }\n\n    if ( (ret = m_processor.unpack() ) != LIBRAW_SUCCESS) {\n        error (\"Could not unpack \\\"%s\\\", %s\",name.c_str(), libraw_strerror(ret));\n        return false;\n    }\n\n    \/\/ Set file information\n    m_spec = ImageSpec(m_processor.imgdata.sizes.iwidth,\n                       m_processor.imgdata.sizes.iheight,\n                       3, \/\/ LibRaw should only give us 3 channels\n                       TypeDesc::UINT16);\n\n    \/\/ Output 16 bit images\n    m_processor.imgdata.params.output_bps = 16;\n\n    \/\/ Set the gamma curve to Linear\n    m_spec.attribute(\"oiio:ColorSpace\",\"Linear\");\n    m_processor.imgdata.params.gamm[0] = 1.0;\n    m_processor.imgdata.params.gamm[1] = 1.0;\n\n    \/\/ Check to see if the user has explicitly set the output colorspace primaries\n    ImageIOParameter *csp = config.find_attribute (\"raw:ColorSpace\", TypeDesc::STRING, false);\n    if (csp) {\n        static const char *colorspaces[] = { \"raw\",\n                                             \"sRGB\",\n                                             \"Adobe\",\n                                             \"Wide\",\n                                             \"ProPhoto\",\n                                             \"XYZ\", NULL\n                                             };\n\n        std::string cs = *(const char**) csp->data();\n        size_t c;\n        for (c=0; c < sizeof(colorspaces) \/ sizeof(colorspaces[0]); c++)\n            if (cs == colorspaces[c])\n                break;\n        if (cs == colorspaces[c])\n            m_processor.imgdata.params.output_color = c;\n        else {\n            error(\"raw:ColorSpace set to unknown value\");\n            return false;\n        }\n        \/\/ Set the attribute in the output spec\n        m_spec.attribute(\"raw:ColorSpace\", cs);\n    } else {\n        \/\/ By default we use sRGB primaries for simplicity\n        m_processor.imgdata.params.output_color = 1;\n        m_spec.attribute(\"raw:ColorSpace\", \"sRGB\");\n    }\n\n    \/\/ Exposure adjustment\n    ImageIOParameter *ex = config.find_attribute (\"raw:Exposure\", TypeDesc::FLOAT, false);\n    \n    if (ex) {\n        float exposure = *(float*)ex->data();\n        if (exposure < 0.25f || exposure > 8.0f) {\n            error(\"raw:Exposure invalid value. range 0.25f - 8.0f\");\n            return false;\n        }\n        m_processor.imgdata.params.exp_correc = 1; \/\/ enable exposure correction\n        m_processor.imgdata.params.exp_shift = exposure; \/\/ set exposure correction\n        \/\/ Set the attribute in the output spec\n        m_spec.attribute (\"raw:Exposure\", exposure);\n    }\n\n    \/\/ Interpolation quality\n    \/\/ note: LibRaw must be compiled with demosaic pack GPL2 to use\n    \/\/ demosaic algorithms 5-9. It must be compiled with demosaic pack GPL3 for \n    \/\/ algorithm 10. If either of these packs are not includeded, it will silently use option 3 - AHD\n    ImageIOParameter *dm = config.find_attribute (\"raw:Demosaic\", TypeDesc::STRING, false);\n    if (dm) {\n        static const char *demosaic_algs[] = { \"linear\",\n                                               \"VNG\",\n                                               \"PPG\",\n                                               \"AHD\",\n                                               \"DCB\",\n                                               \"Modified AHD\",\n                                               \"AFD\",\n                                               \"VCD\",\n                                               \"Mixed\",\n                                               \"LMMSE\",\n                                               \"AMaZE\",\n                                               \/\/ Future demosaicing algorithms should go here\n                                               NULL\n                                               };\n\n        std::string demosaic = *(const char**) dm->data();\n        size_t d;\n        for (d=0; d < sizeof(demosaic_algs) \/ sizeof(demosaic_algs[0]); d++)\n            if (demosaic == demosaic_algs[d])\n                break;\n        if (demosaic == demosaic_algs[d])\n            m_processor.imgdata.params.user_qual = d;\n        else if (demosaic == \"none\") {\n            \/\/ See if we can access the Bayer patterned data for this raw file\n            libraw_decoder_info_t decoder_info;\n            m_processor.get_decoder_info(&decoder_info);\n            if (!(decoder_info.decoder_flags & LIBRAW_DECODER_FLATFIELD)) {\n                error(\"Unable to extract unbayered data from file \\\"%s\\\"\", name.c_str());\n                return false;\n            }\n\n            \/\/ User has selected no demosaicing, so no processing needs to be done\n            m_process = false;\n\n            \/\/ The image width and height may be different now, so update with new values\n            \/\/ Also we will only be reading back a single, bayered channel\n            m_spec.width = m_processor.imgdata.sizes.raw_width;\n            m_spec.height = m_processor.imgdata.sizes.raw_height;\n            m_spec.nchannels = 1;\n            m_spec.channelnames.clear();\n            m_spec.channelnames.push_back(\"R\");\n\n            \/\/ Also, any previously set demosaicing options are void, so remove them\n            m_spec.erase_attribute(\"oiio:Colorspace\", TypeDesc::STRING);\n            m_spec.erase_attribute(\"raw:Colorspace\", TypeDesc::STRING);\n            m_spec.erase_attribute(\"raw:Exposure\", TypeDesc::STRING);\n\n        }\n        else {\n            error(\"raw:Demosaic set to unknown value\");\n            return false;\n        }\n        \/\/ Set the attribute in the output spec\n        m_spec.attribute(\"raw:Demosaic\", demosaic);\n    } else {\n        m_processor.imgdata.params.user_qual = 3;\n        m_spec.attribute(\"raw:Demosaic\", \"AHD\");\n    }\n\n    \/\/ Metadata\n\n    const libraw_image_sizes_t &sizes (m_processor.imgdata.sizes);\n    m_spec.attribute (\"PixelAspectRatio\", (float)sizes.pixel_aspect);\n    \/\/ FIXME: sizes. top_margin, left_margin, raw_pitch, flip, mask?\n\n    const libraw_iparams_t &idata (m_processor.imgdata.idata);\n    if (idata.make[0])\n        m_spec.attribute (\"Make\", idata.make);\n    if (idata.model[0])\n        m_spec.attribute (\"Model\", idata.model);\n    \/\/ FIXME: idata. dng_version, is_foveon, colors, filters, cdesc\n\n    const libraw_colordata_t &color (m_processor.imgdata.color);\n    m_spec.attribute(\"Exif:Flash\", (int) color.flash_used);\n    if (color.model2[0])\n        m_spec.attribute (\"Software\", color.model2);\n\n    \/\/ FIXME -- all sorts of things in this struct\n\n    const libraw_imgother_t &other (m_processor.imgdata.other);\n    m_spec.attribute (\"Exif:ISOSpeedRatings\", (int) other.iso_speed);\n    m_spec.attribute (\"ExposureTime\", other.shutter);\n    m_spec.attribute (\"Exif:ShutterSpeedValue\", -log2f(other.shutter));\n    m_spec.attribute (\"FNumber\", other.aperture);\n    m_spec.attribute (\"Exif:ApertureValue\", 2.0f * log2f(other.aperture));\n    m_spec.attribute (\"Exif:FocalLength\", other.focal_len);\n    struct tm * m_tm = localtime(&m_processor.imgdata.other.timestamp);\n    char datetime[20];\n    strftime (datetime, 20, \"%Y-%m-%d %H:%M:%S\", m_tm);\n    m_spec.attribute (\"DateTime\", datetime);\n    \/\/ FIXME: other.shot_order\n    \/\/ FIXME: other.gpsdata\n    if (other.desc[0])\n        m_spec.attribute (\"ImageDescription\", other.desc);\n    if (other.artist[0])\n        m_spec.attribute (\"Artist\", other.artist);\n\n    \/\/ FIXME -- thumbnail possibly in m_processor.imgdata.thumbnail\n\n    \/\/ Copy the spec to return to the user\n    newspec = m_spec;\n    return true;\n}\n\n\n\nbool\nRawInput::close()\n{\n    if (m_image) {\n        LibRaw::dcraw_clear_mem(m_image);\n        m_image = NULL;\n    }\n    return true;\n}\n\n\n\nbool\nRawInput::process()\n{\n    if (!m_image) {\n        int ret = m_processor.dcraw_process();\n        if (ret != LIBRAW_SUCCESS) {\n            error(\"Processing image failed, %s\", libraw_strerror(ret));\n            return false;\n        }\n\n        m_image = m_processor.dcraw_make_mem_image(&ret);\n        if (!m_image) {\n            error(\"LibRaw failed to create in memory image\");\n            return false;\n        }\n\n        if (m_image->type != LIBRAW_IMAGE_BITMAP) {\n            error(\"LibRaw did not return expected image type\");\n            return false;\n        }\n\n        if (m_image->colors != 3) {\n            error(\"LibRaw did not return 3 channel image\");\n            return false;\n        }\n\n    }\n    return true;\n}\n\n\n\nbool\nRawInput::read_native_scanline (int y, int z, void *data)\n{\n    if (y < 0 || y >= m_spec.height) \/\/ out of range scanline\n        return false;\n\n    if (! m_process) {\n        \/\/ The user has selected not to apply any debayering.\n        \/\/ We take the raw data directly\n        unsigned short *scanline = &((m_processor.imgdata.rawdata.raw_image)[m_spec.width*y]);\n        memcpy(data, scanline, m_spec.scanline_bytes(true));\n        return true;\n    }\n\n    \/\/ Check the state of the internal RAW reader.\n    \/\/ Have to load the entire image at once, so only do this once\n    if (! m_image) { \n        if (!process()) {\n            return false;\n        }\n    }\n\n    int length = m_spec.width*m_image->colors; \/\/ Should always be 3 colors\n\n    \/\/ Because we are reading UINT16's, we need to cast m_image->data\n    unsigned short *scanline = &(((unsigned short *)m_image->data)[length*y]);\n    memcpy(data, scanline, m_spec.scanline_bytes(true));\n\n    return true;\n}\n\nOIIO_PLUGIN_NAMESPACE_END\n\n<commit_msg>Read more Exif metadata from raw files by attempting to open the file as a TIFF and copying any Exif data we find -- which surprisingly works for quite a few raw formats.<commit_after>\/*\n  Copyright 2013 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#include \"imageio.h\"\n#include <iostream>\n#include <time.h>       \/* time_t, struct tm, gmtime *\/\n#include <libraw\/libraw.h>\n\n\/\/ This plugin utilises LibRaw:\n\/\/ http:\/\/www.libraw.org\/\n\/\/ Documentation: \n\/\/ http:\/\/www.libraw.org\/docs\n\nOIIO_PLUGIN_NAMESPACE_BEGIN\n\nclass RawInput : public ImageInput {\npublic:\n    RawInput () : m_process(true), m_image(NULL) {}\n    virtual ~RawInput() { close(); }\n    virtual const char * format_name (void) const { return \"raw\"; }\n    virtual bool open (const std::string &name, ImageSpec &newspec);\n    virtual bool open (const std::string &name, ImageSpec &newspec, ImageSpec &config);\n    virtual bool close();\n    virtual bool read_native_scanline (int y, int z, void *data);\n\nprivate:\n    bool process();\n    bool m_process;\n    LibRaw m_processor;\n    libraw_processed_image_t *m_image;\n\n    void read_tiff_metadata (const std::string &filename);\n};\n\n\n\n\/\/ Export version number and create function symbols\nOIIO_PLUGIN_EXPORTS_BEGIN\n\n    OIIO_EXPORT int raw_imageio_version = OIIO_PLUGIN_VERSION;\n    OIIO_EXPORT ImageInput *raw_input_imageio_create () {\n        return new RawInput;\n    }\n    OIIO_EXPORT const char *raw_input_extensions[] = {\n        \"bay\", \"bmq\", \"cr2\", \"crw\", \"cs1\", \"dc2\", \"dcr\", \"dng\",\n        \"erf\", \"fff\", \"hdr\", \"k25\", \"kdc\", \"mdc\", \"mos\", \"mrw\",\n        \"nef\", \"orf\", \"pef\", \"pxn\", \"raf\", \"raw\", \"rdc\", \"sr2\",\n        \"srf\", \"x3f\", \"arw\", \"3fr\", \"cine\", \"ia\", \"kc2\", \"mef\",\n        \"nrw\", \"qtk\", \"rw2\", \"sti\", \"rwl\", \"srw\", \"drf\", \"dsc\",\n        \"ptx\", \"cap\", \"iiq\", \"rwz\", NULL\n    };\n\nOIIO_PLUGIN_EXPORTS_END\n\n\n\nbool\nRawInput::open (const std::string &name, ImageSpec &newspec)\n{\n    \/\/ If user doesn't want to provide any config, just use an empty spec.\n    ImageSpec config;\n    return open(name, newspec, config);\n}\n\n\n\nbool\nRawInput::open (const std::string &name, ImageSpec &newspec, ImageSpec &config)\n{\n    int ret;\n\n    \/\/ open the image\n    if ( (ret = m_processor.open_file(name.c_str()) ) != LIBRAW_SUCCESS) {\n        error (\"Could not open file \\\"%s\\\", %s\", name.c_str(), libraw_strerror(ret));\n        return false;\n    }\n\n    if ( (ret = m_processor.unpack() ) != LIBRAW_SUCCESS) {\n        error (\"Could not unpack \\\"%s\\\", %s\",name.c_str(), libraw_strerror(ret));\n        return false;\n    }\n\n    \/\/ Set file information\n    m_spec = ImageSpec(m_processor.imgdata.sizes.iwidth,\n                       m_processor.imgdata.sizes.iheight,\n                       3, \/\/ LibRaw should only give us 3 channels\n                       TypeDesc::UINT16);\n\n    \/\/ Output 16 bit images\n    m_processor.imgdata.params.output_bps = 16;\n\n    \/\/ Set the gamma curve to Linear\n    m_spec.attribute(\"oiio:ColorSpace\",\"Linear\");\n    m_processor.imgdata.params.gamm[0] = 1.0;\n    m_processor.imgdata.params.gamm[1] = 1.0;\n\n    \/\/ Check to see if the user has explicitly set the output colorspace primaries\n    ImageIOParameter *csp = config.find_attribute (\"raw:ColorSpace\", TypeDesc::STRING, false);\n    if (csp) {\n        static const char *colorspaces[] = { \"raw\",\n                                             \"sRGB\",\n                                             \"Adobe\",\n                                             \"Wide\",\n                                             \"ProPhoto\",\n                                             \"XYZ\", NULL\n                                             };\n\n        std::string cs = *(const char**) csp->data();\n        size_t c;\n        for (c=0; c < sizeof(colorspaces) \/ sizeof(colorspaces[0]); c++)\n            if (cs == colorspaces[c])\n                break;\n        if (cs == colorspaces[c])\n            m_processor.imgdata.params.output_color = c;\n        else {\n            error(\"raw:ColorSpace set to unknown value\");\n            return false;\n        }\n        \/\/ Set the attribute in the output spec\n        m_spec.attribute(\"raw:ColorSpace\", cs);\n    } else {\n        \/\/ By default we use sRGB primaries for simplicity\n        m_processor.imgdata.params.output_color = 1;\n        m_spec.attribute(\"raw:ColorSpace\", \"sRGB\");\n    }\n\n    \/\/ Exposure adjustment\n    ImageIOParameter *ex = config.find_attribute (\"raw:Exposure\", TypeDesc::FLOAT, false);\n    \n    if (ex) {\n        float exposure = *(float*)ex->data();\n        if (exposure < 0.25f || exposure > 8.0f) {\n            error(\"raw:Exposure invalid value. range 0.25f - 8.0f\");\n            return false;\n        }\n        m_processor.imgdata.params.exp_correc = 1; \/\/ enable exposure correction\n        m_processor.imgdata.params.exp_shift = exposure; \/\/ set exposure correction\n        \/\/ Set the attribute in the output spec\n        m_spec.attribute (\"raw:Exposure\", exposure);\n    }\n\n    \/\/ Interpolation quality\n    \/\/ note: LibRaw must be compiled with demosaic pack GPL2 to use\n    \/\/ demosaic algorithms 5-9. It must be compiled with demosaic pack GPL3 for \n    \/\/ algorithm 10. If either of these packs are not includeded, it will silently use option 3 - AHD\n    ImageIOParameter *dm = config.find_attribute (\"raw:Demosaic\", TypeDesc::STRING, false);\n    if (dm) {\n        static const char *demosaic_algs[] = { \"linear\",\n                                               \"VNG\",\n                                               \"PPG\",\n                                               \"AHD\",\n                                               \"DCB\",\n                                               \"Modified AHD\",\n                                               \"AFD\",\n                                               \"VCD\",\n                                               \"Mixed\",\n                                               \"LMMSE\",\n                                               \"AMaZE\",\n                                               \/\/ Future demosaicing algorithms should go here\n                                               NULL\n                                               };\n\n        std::string demosaic = *(const char**) dm->data();\n        size_t d;\n        for (d=0; d < sizeof(demosaic_algs) \/ sizeof(demosaic_algs[0]); d++)\n            if (demosaic == demosaic_algs[d])\n                break;\n        if (demosaic == demosaic_algs[d])\n            m_processor.imgdata.params.user_qual = d;\n        else if (demosaic == \"none\") {\n            \/\/ See if we can access the Bayer patterned data for this raw file\n            libraw_decoder_info_t decoder_info;\n            m_processor.get_decoder_info(&decoder_info);\n            if (!(decoder_info.decoder_flags & LIBRAW_DECODER_FLATFIELD)) {\n                error(\"Unable to extract unbayered data from file \\\"%s\\\"\", name.c_str());\n                return false;\n            }\n\n            \/\/ User has selected no demosaicing, so no processing needs to be done\n            m_process = false;\n\n            \/\/ The image width and height may be different now, so update with new values\n            \/\/ Also we will only be reading back a single, bayered channel\n            m_spec.width = m_processor.imgdata.sizes.raw_width;\n            m_spec.height = m_processor.imgdata.sizes.raw_height;\n            m_spec.nchannels = 1;\n            m_spec.channelnames.clear();\n            m_spec.channelnames.push_back(\"R\");\n\n            \/\/ Also, any previously set demosaicing options are void, so remove them\n            m_spec.erase_attribute(\"oiio:Colorspace\", TypeDesc::STRING);\n            m_spec.erase_attribute(\"raw:Colorspace\", TypeDesc::STRING);\n            m_spec.erase_attribute(\"raw:Exposure\", TypeDesc::STRING);\n\n        }\n        else {\n            error(\"raw:Demosaic set to unknown value\");\n            return false;\n        }\n        \/\/ Set the attribute in the output spec\n        m_spec.attribute(\"raw:Demosaic\", demosaic);\n    } else {\n        m_processor.imgdata.params.user_qual = 3;\n        m_spec.attribute(\"raw:Demosaic\", \"AHD\");\n    }\n\n    \/\/ Metadata\n\n    const libraw_image_sizes_t &sizes (m_processor.imgdata.sizes);\n    m_spec.attribute (\"PixelAspectRatio\", (float)sizes.pixel_aspect);\n    \/\/ FIXME: sizes. top_margin, left_margin, raw_pitch, flip, mask?\n\n    const libraw_iparams_t &idata (m_processor.imgdata.idata);\n    if (idata.make[0])\n        m_spec.attribute (\"Make\", idata.make);\n    if (idata.model[0])\n        m_spec.attribute (\"Model\", idata.model);\n    \/\/ FIXME: idata. dng_version, is_foveon, colors, filters, cdesc\n\n    const libraw_colordata_t &color (m_processor.imgdata.color);\n    m_spec.attribute(\"Exif:Flash\", (int) color.flash_used);\n    if (color.model2[0])\n        m_spec.attribute (\"Software\", color.model2);\n\n    \/\/ FIXME -- all sorts of things in this struct\n\n    const libraw_imgother_t &other (m_processor.imgdata.other);\n    m_spec.attribute (\"Exif:ISOSpeedRatings\", (int) other.iso_speed);\n    m_spec.attribute (\"ExposureTime\", other.shutter);\n    m_spec.attribute (\"Exif:ShutterSpeedValue\", -log2f(other.shutter));\n    m_spec.attribute (\"FNumber\", other.aperture);\n    m_spec.attribute (\"Exif:ApertureValue\", 2.0f * log2f(other.aperture));\n    m_spec.attribute (\"Exif:FocalLength\", other.focal_len);\n    struct tm * m_tm = localtime(&m_processor.imgdata.other.timestamp);\n    char datetime[20];\n    strftime (datetime, 20, \"%Y-%m-%d %H:%M:%S\", m_tm);\n    m_spec.attribute (\"DateTime\", datetime);\n    \/\/ FIXME: other.shot_order\n    \/\/ FIXME: other.gpsdata\n    if (other.desc[0])\n        m_spec.attribute (\"ImageDescription\", other.desc);\n    if (other.artist[0])\n        m_spec.attribute (\"Artist\", other.artist);\n\n    \/\/ FIXME -- thumbnail possibly in m_processor.imgdata.thumbnail\n\n    read_tiff_metadata (name);\n\n    \/\/ Copy the spec to return to the user\n    newspec = m_spec;\n    return true;\n}\n\n\n\nvoid\nRawInput::read_tiff_metadata (const std::string &filename)\n{\n    \/\/ Many of these raw formats look just like TIFF files, and we can use\n    \/\/ that to extract a bunch of extra Exif metadata and thumbnail.\n    ImageInput *in = ImageInput::create (\"tiff\");\n    if (! in) {\n        (void) OIIO::geterror();  \/\/ eat the error\n        return;\n    }\n    ImageSpec newspec;\n    bool ok = in->open (filename, newspec);\n    if (ok) {\n        \/\/ Transfer \"Exif:\" metadata to the raw spec.\n        for (ParamValueList::const_iterator p = newspec.extra_attribs.begin();\n             p != newspec.extra_attribs.end();  ++p) {\n            if (Strutil::istarts_with (p->name().c_str(), \"Exif:\")) {\n                m_spec.attribute (p->name().c_str(), p->type(), p->data());\n            }\n        }\n    }\n\n    in->close ();\n    delete in;\n}\n\n\n\nbool\nRawInput::close()\n{\n    if (m_image) {\n        LibRaw::dcraw_clear_mem(m_image);\n        m_image = NULL;\n    }\n    return true;\n}\n\n\n\nbool\nRawInput::process()\n{\n    if (!m_image) {\n        int ret = m_processor.dcraw_process();\n        if (ret != LIBRAW_SUCCESS) {\n            error(\"Processing image failed, %s\", libraw_strerror(ret));\n            return false;\n        }\n\n        m_image = m_processor.dcraw_make_mem_image(&ret);\n        if (!m_image) {\n            error(\"LibRaw failed to create in memory image\");\n            return false;\n        }\n\n        if (m_image->type != LIBRAW_IMAGE_BITMAP) {\n            error(\"LibRaw did not return expected image type\");\n            return false;\n        }\n\n        if (m_image->colors != 3) {\n            error(\"LibRaw did not return 3 channel image\");\n            return false;\n        }\n\n    }\n    return true;\n}\n\n\n\nbool\nRawInput::read_native_scanline (int y, int z, void *data)\n{\n    if (y < 0 || y >= m_spec.height) \/\/ out of range scanline\n        return false;\n\n    if (! m_process) {\n        \/\/ The user has selected not to apply any debayering.\n        \/\/ We take the raw data directly\n        unsigned short *scanline = &((m_processor.imgdata.rawdata.raw_image)[m_spec.width*y]);\n        memcpy(data, scanline, m_spec.scanline_bytes(true));\n        return true;\n    }\n\n    \/\/ Check the state of the internal RAW reader.\n    \/\/ Have to load the entire image at once, so only do this once\n    if (! m_image) { \n        if (!process()) {\n            return false;\n        }\n    }\n\n    int length = m_spec.width*m_image->colors; \/\/ Should always be 3 colors\n\n    \/\/ Because we are reading UINT16's, we need to cast m_image->data\n    unsigned short *scanline = &(((unsigned short *)m_image->data)[length*y]);\n    memcpy(data, scanline, m_spec.scanline_bytes(true));\n\n    return true;\n}\n\nOIIO_PLUGIN_NAMESPACE_END\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\/chromeos\/login\/account_creation_view.h\"\n\n#include \"app\/gfx\/canvas.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_rect_painter.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"views\/border.h\"\n\nnamespace {\n\nconst int kCornerRadius = 12;\nconst int kShadow = 10;\nconst int kPadding = 30;\nconst SkColor kBackground = SK_ColorWHITE;\nconst SkColor kShadowColor = 0x40223673;\n\n}  \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ AccountCreationView, public:\nAccountCreationView::AccountCreationView() {\n}\n\nAccountCreationView::~AccountCreationView() {\n}\n\nvoid AccountCreationView::Init() {\n  \/\/ Use rounded rect background.\n  views::Border* border = chromeos::CreateWizardBorder(\n      &chromeos::BorderDefinition::kScreenBorder);\n  set_border(border);\n}\n\nvoid AccountCreationView::InitDOM(Profile* profile,\n                                  SiteInstance* site_instance) {\n  DOMView::Init(profile, site_instance);\n}\n\nvoid AccountCreationView::SetTabContentsDelegate(\n    TabContentsDelegate* delegate) {\n  tab_contents_->set_delegate(delegate);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ AccountCreationView, views::View implementation:\nvoid AccountCreationView::Paint(gfx::Canvas* canvas) {\n  PaintBorder(canvas);\n  DOMView::Paint(canvas);\n}\n<commit_msg>chromeos: remove some variables that are now not more necessary. <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\/chromeos\/login\/account_creation_view.h\"\n\n#include \"app\/gfx\/canvas.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_rect_painter.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"views\/border.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ AccountCreationView, public:\nAccountCreationView::AccountCreationView() {\n}\n\nAccountCreationView::~AccountCreationView() {\n}\n\nvoid AccountCreationView::Init() {\n  \/\/ Use rounded rect background.\n  views::Border* border = chromeos::CreateWizardBorder(\n      &chromeos::BorderDefinition::kScreenBorder);\n  set_border(border);\n}\n\nvoid AccountCreationView::InitDOM(Profile* profile,\n                                  SiteInstance* site_instance) {\n  DOMView::Init(profile, site_instance);\n}\n\nvoid AccountCreationView::SetTabContentsDelegate(\n    TabContentsDelegate* delegate) {\n  tab_contents_->set_delegate(delegate);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ AccountCreationView, views::View implementation:\nvoid AccountCreationView::Paint(gfx::Canvas* canvas) {\n  PaintBorder(canvas);\n  DOMView::Paint(canvas);\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\/base_switches.h\"\n#include \"base\/command_line.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"net\/base\/mock_host_resolver.h\"\n\nclass ExtensionHistoryApiTest : public ExtensionApiTest {\n public:\n  virtual void SetUpInProcessBrowserTestFixture() {\n    ExtensionApiTest::SetUpInProcessBrowserTestFixture();\n\n    host_resolver()->AddRule(\"www.a.com\", \"127.0.0.1\");\n    host_resolver()->AddRule(\"www.b.com\", \"127.0.0.1\");\n\n    ASSERT_TRUE(StartTestServer());\n  }\n};\n\n\/\/ Full text search indexing sometimes exceeds a timeout.\n\/\/ Fix this as part of crbug\/76170.\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, FLAKY_MiscSearch) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"misc_search.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, TimedSearch) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"timed_search.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, Delete) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"delete.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, GetVisits) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"get_visits.html\")) << message_;\n}\n\n#if defined(OS_WIN)\n\/\/ Searching for a URL right after adding it fails on win XP.\n\/\/ Fix this as part of crbug\/76170.\n#define MAYBE_SearchAfterAdd FLAKY_SearchAfterAdd\n#else\n#define MAYBE_SearchAfterAdd SearchAfterAdd\n#endif\n\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, MAYBE_SearchAfterAdd) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"search_after_add.html\"))\n      << message_;\n}\n<commit_msg>Mark ExtensionHistoryApiTest.GetVisits flaky.<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\/base_switches.h\"\n#include \"base\/command_line.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"net\/base\/mock_host_resolver.h\"\n\nclass ExtensionHistoryApiTest : public ExtensionApiTest {\n public:\n  virtual void SetUpInProcessBrowserTestFixture() {\n    ExtensionApiTest::SetUpInProcessBrowserTestFixture();\n\n    host_resolver()->AddRule(\"www.a.com\", \"127.0.0.1\");\n    host_resolver()->AddRule(\"www.b.com\", \"127.0.0.1\");\n\n    ASSERT_TRUE(StartTestServer());\n  }\n};\n\n\/\/ Full text search indexing sometimes exceeds a timeout.\n\/\/ Fix this as part of crbug\/76170.\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, FLAKY_MiscSearch) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"misc_search.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, TimedSearch) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"timed_search.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, Delete) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"delete.html\")) << message_;\n}\n\n\/\/ See crbug.com\/79074\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, FLAKY_GetVisits) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"get_visits.html\")) << message_;\n}\n\n#if defined(OS_WIN)\n\/\/ Searching for a URL right after adding it fails on win XP.\n\/\/ Fix this as part of crbug\/76170.\n#define MAYBE_SearchAfterAdd FLAKY_SearchAfterAdd\n#else\n#define MAYBE_SearchAfterAdd SearchAfterAdd\n#endif\n\nIN_PROC_BROWSER_TEST_F(ExtensionHistoryApiTest, MAYBE_SearchAfterAdd) {\n  ASSERT_TRUE(RunExtensionSubtest(\"history\", \"search_after_add.html\"))\n      << message_;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2010, Intel 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 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 Intel Corporation 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 \"chrome\/browser\/ui\/meegotouch\/back_forward_button_qt.h\"\n#include \"chrome\/browser\/ui\/meegotouch\/browser_window_qt.h\"\n#include \"chrome\/browser\/ui\/meegotouch\/browser_toolbar_qt.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/metrics\/user_metrics.h\"\n#include \"content\/browser\/tab_contents\/navigation_controller.h\"\n#include \"content\/browser\/tab_contents\/navigation_entry.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"net\/base\/registry_controlled_domain.h\"\n#include \"chrome\/browser\/history\/history.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n\n#include <QGraphicsItem>\n#include <QGraphicsSceneMouseEvent>\n#include <QVector>\n#include <QList>\n#include <QTimer>\n#include <algorithm>\n#include <QGraphicsSceneResizeEvent>\n#include <QGraphicsWidget>\n#include <QEvent>\n#include <QDebug>\n\/\/#include <QTapAndHoldGesture>\n\n#include <QDeclarativeEngine>\n#include <QDeclarativeView>\n#include <QDeclarativeContext>\n#include <QDeclarativeItem>\n#include <QDeclarativeImageProvider>\n#include <QAbstractListModel>\n\n\/\/ Image provider, managing to provide image to QML\n\/\/ for history view\n\/\/ Due to qml limitation, the id of image is suffixed with\n\/\/ a static increaser, which forces using new image source\n\/\/ each time\nclass HistoryImageProvider : public QDeclarativeImageProvider \n{\npublic:\n    HistoryImageProvider()\n        : QDeclarativeImageProvider(QDeclarativeImageProvider::Image)\n    {}\n\n    \/\/ clear all images in image hashmap\n    void clear()\n    {\n        imageList_.clear();\n    }\n\n    \/\/ overrided function, inherited from QDeclarativeImageProvider\n    virtual QImage requestImage(const QString& id,\n                                QSize* size,\n                                const QSize& requestedSize)\n    {\n        DLOG(INFO) << \"requesting image id: \" << id.toStdString();\n        int finded = id.indexOf(\"_\");\n        if (finded != -1) {\n            QImage& image = imageList_[id.left(finded)];\n            if (!image.isNull()) {\n                \/\/QImage scaled = image.scaled(requestedSize);\n                *size = image.size();\n                return image;\n            }\n        }\n        *size = QSize(0, 0);\n        return QImage();\n    }\n\n    \/\/ add a new image\n    void addImage(const QString& id, const QImage &image)\n    {\n        imageList_.insert(id, image);\n    }\n\nprivate:\n    QMap<QString, QImage> imageList_;\n};\n\nclass HistoryStackModel;\n\n\/\/ history entry to represent one history data\nclass HistoryEntry \n{\npublic:\n  \n    \/\/ constructor\n    \/\/ @param index the index in history stack\n    \/\/ @param hiProvider image provider for history stack\n    \/\/ @param entry representation of navigation entry in browser\n    \/\/ @param controller current navigation controller in browser\n    \/\/ @param model history stack model\n    HistoryEntry(const int index, \n                 HistoryImageProvider& hiProvider,\n                 NavigationEntry* entry,\n                 NavigationController* controller,\n                 HistoryStackModel* model)\n        : index_(index), hiProvider_(hiProvider), entry_(entry), model_(model)\n    {\n        \/\/ get image\n        getThumbnailData(controller);\n        std::wstring title_str = UTF16ToWide(entry->title());\n        title_ = QString::fromStdWString(title_str);\n    }\n\n    void imgURLGen() \n    {\n        static QString prefix(\"image:\/\/historystack\/\");\n        imageSrc_ = prefix + QString::number(index_) + \"_\" + QString::number(reloadNumber_);\n    }\n\n    void getThumbnailData(NavigationController *controller);\n\n    NavigationEntry* entry() { return entry_; }\n    QString image() { return imageSrc_; }\n    QString title() { return title_; }\n\n    static void incReloadNumber() { reloadNumber_++; }\n    static unsigned long reloadNumber() { return reloadNumber_; }\n\nprivate:\n    \/\/ static increaser to generate unique image source \n    static unsigned long reloadNumber_;\n\n    int index_;\n    HistoryImageProvider& hiProvider_;\n    NavigationEntry* entry_;\n    HistoryStackModel* model_;\n    \/\/ image source\n    QString imageSrc_;\n    \/\/ history title\n    QString title_;\n    CancelableRequestConsumer consumer_;\n};\n\nunsigned long HistoryEntry::reloadNumber_ = 0;\n\n\/\/ represent list model used in QML to store history data\nclass HistoryStackModel: public QAbstractListModel\n{\n    Q_OBJECT\n    enum HistoryRole {\n        IMAGE_ROLE = Qt::UserRole + 1,\n        TITLE_ROLE\n    };\n\npublic:\n    HistoryStackModel(BackForwardButtonQtImpl* backForward)\n        : back_forward_(backForward), returnedImages_(0)\n    {\n        QHash<int, QByteArray> roles;\n        roles[IMAGE_ROLE] = \"thumbSrc\";\n        roles[TITLE_ROLE] = \"title\";\n        setRoleNames(roles);\n    }\n\n    ~HistoryStackModel()\n    {\n        clear();\n    }\n\n    \/\/ clear saved data\n    void clear()\n    {\n        returnedImages_ = 0;\n        beginResetModel();\n        for(int i = 0; i < entryList_.count(); i++) {\n            delete entryList_[i];\n        }\n        entryList_.clear();\n        hiProvider_.clear();\n        endResetModel();\n    }\n\n    int rowCount(const QModelIndex& parent = QModelIndex()) const\n    {\n        return entryList_.count();\n    }\n\n    QVariant data(const QModelIndex& index, int role = Qt::DisplayRole) const\n    {\n        DLOG(INFO) << \"read list model data: row = \" << index.row() << \", column = \" << index.column();\n        if(index.row() < 0 || index.row() > entryList_.count())\n            return QVariant();\n        HistoryEntry* entry = entryList_[index.row()];\n        switch(role) {\n            case IMAGE_ROLE:\n                return entry->image();\n            case TITLE_ROLE:\n                return entry->title();\n            default:\n                return QVariant();\n        }\n    }\n\n    void appendEntry(NavigationController* controller, NavigationEntry *entry)\n    {\n        HistoryEntry* historyEntry \n                                = new HistoryEntry(entryList_.count(),\n                                                   hiProvider_,\n                                                   entry, \n                                                   controller,\n                                                   this);\n        historyEntry->imgURLGen();\n        beginInsertRows(QModelIndex(), rowCount(), rowCount());\n        entryList_.push_back(historyEntry);\n        endInsertRows();\n    }\n\n    \/\/ emit a showHistory signal to QML\n    void show() { emit showHistory(); }\n\n    \/\/ emit a hideHistory signal to QML\n    void hide() { emit hideHistory(); }\n\n    \/\/ emit a current selected(focused) history entry\n    void setCurrent(int index) { emit current(index); }\n\n    HistoryImageProvider* hiProvider() { return &hiProvider_; }\n\nQ_SIGNALS:\n    \/\/ three signals used to notify QML\n    void showHistory();\n    void hideHistory();\n    void current(int index);\n\npublic Q_SLOTS:\n    \/\/ open specific page, called by QML element\n    \/\/ It's called by QML element when user clicks one history entry in QML view\n    void openPage(const int index);\n\nprivate:\n    BackForwardButtonQtImpl* back_forward_;\n    \/\/ list to hold entries\n    QList<HistoryEntry*> entryList_;\n    HistoryImageProvider hiProvider_;\n    \/\/ count of returned images from browser\n    int returnedImages_;\n};\n\nclass BackForwardButtonQtImpl\n{\npublic:\n    enum NaviState {\n        ONLY_BACK = 0,\n        ONLY_FORWARD,\n        BACK_FORWARD\n    };\n\n    \/\/ constructor\n    BackForwardButtonQtImpl(BrowserToolbarQt* toolbar, Browser* browser, BrowserWindowQt* window)\n        :toolbar_(toolbar), browser_(browser), model_(this), \n        state_(ONLY_BACK), active_(false)\n    {\n        QDeclarativeView* view = window->DeclarativeView();\n        QDeclarativeContext *context = view->rootContext();\n        context->setContextProperty(\"historyStackModel\", &model_);\n        context->engine()->addImageProvider(QLatin1String(\"historystack\"), model_.hiProvider());\n    }\n\n    NavigationController* currentController()\n    {\n        return &(browser_->GetSelectedTabContents()->controller());\n    }\n\n    void openPage(NavigationEntry *entry)\n    {\n        currentController()->GoToIndex(currentController()->GetIndexOfEntry(entry));\n        updateStatus();\n    }\n\n    void updateStatus()\n    {\n        if(currentController()->GetCurrentEntryIndex() == currentController()->entry_count() - 1)\n        {\n            state_ = ONLY_BACK;\n            if (currentController()->entry_count() > 1) {\n                active_ = true;\n            } else {\n                active_ = false;\n            }\n        } else if (currentController()->GetCurrentEntryIndex() == 0\n                   && currentController()->entry_count() > 0) {\n            state_ = ONLY_FORWARD;\n        } else if (currentController()->CanGoBack() && currentController()->CanGoForward()) {\n            state_ = BACK_FORWARD;\n        } else {\n            state_ = ONLY_BACK;\n            active_ = false;\n        }\n        \/\/ update button status in qml\n        updateButton();\n        DLOG(INFO) << \"In C++, updateStatus is invoked\\n\";\n    }\n\n    \/\/ update back-forward button icon\n    void updateButton() { toolbar_->updateBfButton((int)state_, active_); }\n\n    void tap()\n    {\n        DLOG(INFO) << \"In C++, tap is invoked\";\n        switch(state_) {\n        case ONLY_BACK:\n            if (currentController()->CanGoBack()) {\n                currentController()->GoBack();\n            }\n            break;\n        case ONLY_FORWARD:\n            if (currentController()->entry_count() == 2) {\n                if (currentController()->CanGoForward()) {\n                    currentController()->GoForward();\n                }\n            } else {\n                prepareAndShowHistory();\n            }\n            break;\n        case BACK_FORWARD:\n            prepareAndShowHistory();\n            break;\n        default:\n            break;\n        }\n    }\n\n    void tapAndHold()\n    {\n        switch(state_) {\n        case ONLY_BACK:\n            prepareAndShowHistory();\n            break;\n        case ONLY_FORWARD:\n            if (currentController()->entry_count() == 2) {\n                if (currentController()->CanGoForward()) {\n                    currentController()->GoForward();\n                }\n            } else {\n                prepareAndShowHistory();\n            }\n            break;\n        case BACK_FORWARD:\n                prepareAndShowHistory();\n            break;\n        default:\n            break;\n        }\n        updateStatus();\n    }\n\n    \/\/prepare c++ list model and emit signal to QML to show it\n    void prepareAndShowHistory()\n    {\n        model_.clear();\n        int count = currentController()->entry_count();\n        int curr = -1;\n        HistoryEntry::incReloadNumber();\n        for(int i = count - 1; i >= 0; i--)\n        {\n            DLOG(INFO) << \"page index: ---\" << i << \"---\\n\";\n            NavigationEntry* navEntry = currentController()->GetEntryAtIndex(i);\n            \/\/ don't skip 'newtab' now, if yes, we do not only skip newtab here\n            \/\/ but also skip count calculation for 'updateStatus'\n            \/*\n            if (navEntry->url().HostNoBrackets() == \"newtab\") {\n                \/\/ skip 'newtab'\n                continue;\n            }*\/\n            model_.appendEntry(currentController(), navEntry);\n            curr++;\n            if(currentController()->GetCurrentEntryIndex() == i) {\n                model_.setCurrent(curr);\n            }\n        }\n        model_.show();\n        toolbar_->showHistory();\n    }\n\nprivate:\n    BrowserToolbarQt* toolbar_;\n    Browser* browser_;\n    HistoryStackModel model_;\n\n    \/\/ current navigation state\n    NaviState state_;\n    \/\/ whether the backward\/forward button is active\n    bool active_;\n};\n\nBackForwardButtonQt::BackForwardButtonQt(BrowserToolbarQt* toolbar, Browser* browser, BrowserWindowQt* window)\n{\n  impl_ = new BackForwardButtonQtImpl(toolbar, browser, window);\n}\n\nBackForwardButtonQt::~BackForwardButtonQt()\n{\n  delete impl_;\n}\n\nvoid BackForwardButtonQt::tap()\n{\n  impl_->tap();\n}\n\nvoid BackForwardButtonQt::tapAndHold()\n{\n  impl_->tapAndHold();\n}\n\nvoid BackForwardButtonQt::updateStatus()\n{\n  impl_->updateStatus();\n}\n\nvoid HistoryEntry::getThumbnailData(NavigationController *controller)\n{\n  history::TopSites* ts = controller->profile()->GetTopSites();\n  if (ts) {\n    scoped_refptr<RefCountedBytes> thumbnail_data;\n    ts->GetPageThumbnail(entry_->url(), &thumbnail_data);\n    if (thumbnail_data.get()) {\n      std::vector <unsigned char> jpeg;\n      std::copy(thumbnail_data->data.begin(), \n                thumbnail_data->data.end(),\n                std::back_inserter(jpeg));\n      QImage image = QImage::fromData(jpeg.data(), jpeg.size());\n      DLOG(INFO) << \"image size ===== \" << jpeg.size();\n      hiProvider_.addImage(QString::number(index_), image);\n    }\n  }\n}\n\nvoid HistoryStackModel::openPage(const int index)\n{\n    back_forward_->openPage(entryList_[index]->entry());\n    hide();\n}\n\n#include \"moc_back_forward_button_qt.cc\"\n<commit_msg>History: also keep previous implementation for backward compatibility<commit_after>\/*\n * Copyright (c) 2010, Intel 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 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 Intel Corporation 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 \"chrome\/browser\/ui\/meegotouch\/back_forward_button_qt.h\"\n#include \"chrome\/browser\/ui\/meegotouch\/browser_window_qt.h\"\n#include \"chrome\/browser\/ui\/meegotouch\/browser_toolbar_qt.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/metrics\/user_metrics.h\"\n#include \"content\/browser\/tab_contents\/navigation_controller.h\"\n#include \"content\/browser\/tab_contents\/navigation_entry.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"net\/base\/registry_controlled_domain.h\"\n#include \"chrome\/browser\/history\/history.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n\n#include <QGraphicsItem>\n#include <QGraphicsSceneMouseEvent>\n#include <QVector>\n#include <QList>\n#include <QTimer>\n#include <algorithm>\n#include <QGraphicsSceneResizeEvent>\n#include <QGraphicsWidget>\n#include <QEvent>\n#include <QDebug>\n\/\/#include <QTapAndHoldGesture>\n\n#include <QDeclarativeEngine>\n#include <QDeclarativeView>\n#include <QDeclarativeContext>\n#include <QDeclarativeItem>\n#include <QDeclarativeImageProvider>\n#include <QAbstractListModel>\n\n\/\/ Image provider, managing to provide image to QML\n\/\/ for history view\n\/\/ Due to qml limitation, the id of image is suffixed with\n\/\/ a static increaser, which forces using new image source\n\/\/ each time\nclass HistoryImageProvider : public QDeclarativeImageProvider \n{\npublic:\n    HistoryImageProvider()\n        : QDeclarativeImageProvider(QDeclarativeImageProvider::Image)\n    {}\n\n    \/\/ clear all images in image hashmap\n    void clear()\n    {\n        imageList_.clear();\n    }\n\n    \/\/ overrided function, inherited from QDeclarativeImageProvider\n    virtual QImage requestImage(const QString& id,\n                                QSize* size,\n                                const QSize& requestedSize)\n    {\n        DLOG(INFO) << \"requesting image id: \" << id.toStdString();\n        int finded = id.indexOf(\"_\");\n        if (finded != -1) {\n            QImage& image = imageList_[id.left(finded)];\n            if (!image.isNull()) {\n                \/\/QImage scaled = image.scaled(requestedSize);\n                *size = image.size();\n                return image;\n            }\n        }\n        *size = QSize(0, 0);\n        return QImage();\n    }\n\n    \/\/ add a new image\n    void addImage(const QString& id, const QImage &image)\n    {\n        imageList_.insert(id, image);\n    }\n\nprivate:\n    QMap<QString, QImage> imageList_;\n};\n\nclass HistoryStackModel;\n\n\/\/ history entry to represent one history data\nclass HistoryEntry \n{\npublic:\n  \n    \/\/ constructor\n    \/\/ @param index the index in history stack\n    \/\/ @param hiProvider image provider for history stack\n    \/\/ @param entry representation of navigation entry in browser\n    \/\/ @param controller current navigation controller in browser\n    \/\/ @param model history stack model\n    HistoryEntry(const int index, \n                 HistoryImageProvider& hiProvider,\n                 NavigationEntry* entry,\n                 NavigationController* controller,\n                 HistoryStackModel* model)\n        : index_(index), hiProvider_(hiProvider), entry_(entry), model_(model)\n    {\n        \/\/ get image\n        getThumbnailData(controller);\n        std::wstring title_str = UTF16ToWide(entry->title());\n        title_ = QString::fromStdWString(title_str);\n    }\n\n    void imgURLGen() \n    {\n        static QString prefix(\"image:\/\/historystack\/\");\n        imageSrc_ = prefix + QString::number(index_) + \"_\" + QString::number(reloadNumber_);\n    }\n\n    \/\/ get thumbnail\n    void getThumbnailData(NavigationController *controller);\n\n    \/\/ callback to get the image data from browser\n    void onThumbnailDataAvailable(HistoryService::Handle request_handle,\n                                  scoped_refptr<RefCountedBytes> jpeg_data); \n\n\n    NavigationEntry* entry() { return entry_; }\n    QString image() { return imageSrc_; }\n    QString title() { return title_; }\n\n    static void incReloadNumber() { reloadNumber_++; }\n    static unsigned long reloadNumber() { return reloadNumber_; }\n\nprivate:\n    \/\/ static increaser to generate unique image source \n    static unsigned long reloadNumber_;\n\n    int index_;\n    HistoryImageProvider& hiProvider_;\n    NavigationEntry* entry_;\n    HistoryStackModel* model_;\n    \/\/ image source\n    QString imageSrc_;\n    \/\/ history title\n    QString title_;\n    CancelableRequestConsumer consumer_;\n};\n\nunsigned long HistoryEntry::reloadNumber_ = 0;\n\n\/\/ represent list model used in QML to store history data\nclass HistoryStackModel: public QAbstractListModel\n{\n    Q_OBJECT\n    enum HistoryRole {\n        IMAGE_ROLE = Qt::UserRole + 1,\n        TITLE_ROLE\n    };\n\npublic:\n    HistoryStackModel(BackForwardButtonQtImpl* backForward)\n        : back_forward_(backForward), returnedImages_(0)\n    {\n        QHash<int, QByteArray> roles;\n        roles[IMAGE_ROLE] = \"thumbSrc\";\n        roles[TITLE_ROLE] = \"title\";\n        setRoleNames(roles);\n    }\n\n    ~HistoryStackModel()\n    {\n        clear();\n    }\n\n    \/\/ clear saved data\n    void clear()\n    {\n        returnedImages_ = 0;\n        beginResetModel();\n        for(int i = 0; i < entryList_.count(); i++) {\n            delete entryList_[i];\n        }\n        entryList_.clear();\n        hiProvider_.clear();\n        endResetModel();\n    }\n\n    \/\/ wrapper to check whether browser returns all images of history\n    \/\/ so we can reset model to avoid resetting model many times\n    void beginReset()\n    {\n        \/\/ begin reset if necessary\n        returnedImages_++;\n        if (returnedImages_ == rowCount()) {\n            DLOG(INFO) << \"begin reset history stack model\";\n            \/\/ generate new number to create new image url\n            HistoryEntry::incReloadNumber();\n            for(int i = 0; i < entryList_.count(); i++) {\n                HistoryEntry* entry = entryList_[i];\n                entry->imgURLGen();\n            }\n            beginResetModel();\n        }\n    }\n\n    void endReset()\n    {\n        \/\/ end reset if necessary\n        if (returnedImages_ == rowCount()) {\n            DLOG(INFO) << \"end reset history stack model\";\n            endResetModel();\n        }\n    }\n\n    int rowCount(const QModelIndex& parent = QModelIndex()) const\n    {\n        return entryList_.count();\n    }\n\n    QVariant data(const QModelIndex& index, int role = Qt::DisplayRole) const\n    {\n        DLOG(INFO) << \"read list model data: row = \" << index.row() << \", column = \" << index.column();\n        if(index.row() < 0 || index.row() > entryList_.count())\n            return QVariant();\n        HistoryEntry* entry = entryList_[index.row()];\n        switch(role) {\n            case IMAGE_ROLE:\n                return entry->image();\n            case TITLE_ROLE:\n                return entry->title();\n            default:\n                return QVariant();\n        }\n    }\n\n    void appendEntry(NavigationController* controller, NavigationEntry *entry)\n    {\n        HistoryEntry* historyEntry \n                                = new HistoryEntry(entryList_.count(),\n                                                   hiProvider_,\n                                                   entry, \n                                                   controller,\n                                                   this);\n        historyEntry->imgURLGen();\n        beginInsertRows(QModelIndex(), rowCount(), rowCount());\n        entryList_.push_back(historyEntry);\n        endInsertRows();\n    }\n\n    \/\/ emit a showHistory signal to QML\n    void show() { emit showHistory(); }\n\n    \/\/ emit a hideHistory signal to QML\n    void hide() { emit hideHistory(); }\n\n    \/\/ emit a current selected(focused) history entry\n    void setCurrent(int index) { emit current(index); }\n\n    HistoryImageProvider* hiProvider() { return &hiProvider_; }\n\nQ_SIGNALS:\n    \/\/ three signals used to notify QML\n    void showHistory();\n    void hideHistory();\n    void current(int index);\n\npublic Q_SLOTS:\n    \/\/ open specific page, called by QML element\n    \/\/ It's called by QML element when user clicks one history entry in QML view\n    void openPage(const int index);\n\nprivate:\n    BackForwardButtonQtImpl* back_forward_;\n    \/\/ list to hold entries\n    QList<HistoryEntry*> entryList_;\n    HistoryImageProvider hiProvider_;\n    \/\/ count of returned images from browser\n    int returnedImages_;\n};\n\nclass BackForwardButtonQtImpl\n{\npublic:\n    enum NaviState {\n        ONLY_BACK = 0,\n        ONLY_FORWARD,\n        BACK_FORWARD\n    };\n\n    \/\/ constructor\n    BackForwardButtonQtImpl(BrowserToolbarQt* toolbar, Browser* browser, BrowserWindowQt* window)\n        :toolbar_(toolbar), browser_(browser), model_(this), \n        state_(ONLY_BACK), active_(false)\n    {\n        QDeclarativeView* view = window->DeclarativeView();\n        QDeclarativeContext *context = view->rootContext();\n        context->setContextProperty(\"historyStackModel\", &model_);\n        context->engine()->addImageProvider(QLatin1String(\"historystack\"), model_.hiProvider());\n    }\n\n    NavigationController* currentController()\n    {\n        return &(browser_->GetSelectedTabContents()->controller());\n    }\n\n    void openPage(NavigationEntry *entry)\n    {\n        currentController()->GoToIndex(currentController()->GetIndexOfEntry(entry));\n        updateStatus();\n    }\n\n    void updateStatus()\n    {\n        if(currentController()->GetCurrentEntryIndex() == currentController()->entry_count() - 1)\n        {\n            state_ = ONLY_BACK;\n            if (currentController()->entry_count() > 1) {\n                active_ = true;\n            } else {\n                active_ = false;\n            }\n        } else if (currentController()->GetCurrentEntryIndex() == 0\n                   && currentController()->entry_count() > 0) {\n            state_ = ONLY_FORWARD;\n        } else if (currentController()->CanGoBack() && currentController()->CanGoForward()) {\n            state_ = BACK_FORWARD;\n        } else {\n            state_ = ONLY_BACK;\n            active_ = false;\n        }\n        \/\/ update button status in qml\n        updateButton();\n        DLOG(INFO) << \"In C++, updateStatus is invoked\\n\";\n    }\n\n    \/\/ update back-forward button icon\n    void updateButton() { toolbar_->updateBfButton((int)state_, active_); }\n\n    void tap()\n    {\n        DLOG(INFO) << \"In C++, tap is invoked\";\n        switch(state_) {\n        case ONLY_BACK:\n            if (currentController()->CanGoBack()) {\n                currentController()->GoBack();\n            }\n            break;\n        case ONLY_FORWARD:\n            if (currentController()->entry_count() == 2) {\n                if (currentController()->CanGoForward()) {\n                    currentController()->GoForward();\n                }\n            } else {\n                prepareAndShowHistory();\n            }\n            break;\n        case BACK_FORWARD:\n            prepareAndShowHistory();\n            break;\n        default:\n            break;\n        }\n    }\n\n    void tapAndHold()\n    {\n        switch(state_) {\n        case ONLY_BACK:\n            prepareAndShowHistory();\n            break;\n        case ONLY_FORWARD:\n            if (currentController()->entry_count() == 2) {\n                if (currentController()->CanGoForward()) {\n                    currentController()->GoForward();\n                }\n            } else {\n                prepareAndShowHistory();\n            }\n            break;\n        case BACK_FORWARD:\n                prepareAndShowHistory();\n            break;\n        default:\n            break;\n        }\n        updateStatus();\n    }\n\n    \/\/prepare c++ list model and emit signal to QML to show it\n    void prepareAndShowHistory()\n    {\n        model_.clear();\n        int count = currentController()->entry_count();\n        int curr = -1;\n        HistoryEntry::incReloadNumber();\n        for(int i = count - 1; i >= 0; i--)\n        {\n            DLOG(INFO) << \"page index: ---\" << i << \"---\\n\";\n            NavigationEntry* navEntry = currentController()->GetEntryAtIndex(i);\n            \/\/ don't skip 'newtab' now, if yes, we do not only skip newtab here\n            \/\/ but also skip count calculation for 'updateStatus'\n            \/*\n            if (navEntry->url().HostNoBrackets() == \"newtab\") {\n                \/\/ skip 'newtab'\n                continue;\n            }*\/\n            model_.appendEntry(currentController(), navEntry);\n            curr++;\n            if(currentController()->GetCurrentEntryIndex() == i) {\n                model_.setCurrent(curr);\n            }\n        }\n        model_.show();\n        toolbar_->showHistory();\n    }\n\nprivate:\n    BrowserToolbarQt* toolbar_;\n    Browser* browser_;\n    HistoryStackModel model_;\n\n    \/\/ current navigation state\n    NaviState state_;\n    \/\/ whether the backward\/forward button is active\n    bool active_;\n};\n\nBackForwardButtonQt::BackForwardButtonQt(BrowserToolbarQt* toolbar, Browser* browser, BrowserWindowQt* window)\n{\n  impl_ = new BackForwardButtonQtImpl(toolbar, browser, window);\n}\n\nBackForwardButtonQt::~BackForwardButtonQt()\n{\n  delete impl_;\n}\n\nvoid BackForwardButtonQt::tap()\n{\n  impl_->tap();\n}\n\nvoid BackForwardButtonQt::tapAndHold()\n{\n  impl_->tapAndHold();\n}\n\nvoid BackForwardButtonQt::updateStatus()\n{\n  impl_->updateStatus();\n}\n\nvoid HistoryEntry::onThumbnailDataAvailable(HistoryService::Handle request_handle,\n                                            scoped_refptr<RefCountedBytes> jpeg_data) \n{\n    model_->beginReset();\n    if (jpeg_data.get()) {\n        DLOG(INFO) << \"get image id: \" << index_;\n        std::vector<unsigned char> thumbnail_data;\n        std::copy(jpeg_data->data.begin(), jpeg_data->data.end(),\n                std::back_inserter(thumbnail_data));\n        QImage image = QImage::fromData(thumbnail_data.data(), thumbnail_data.size());\n        hiProvider_.addImage(QString::number(index_), image);\n    }\n    model_->endReset();\n}\n\nvoid HistoryEntry::getThumbnailData(NavigationController *controller)\n{\n  history::TopSites* ts = controller->profile()->GetTopSites();\n  if (ts) {\n    scoped_refptr<RefCountedBytes> thumbnail_data;\n    ts->GetPageThumbnail(entry_->url(), &thumbnail_data);\n    if (thumbnail_data.get()) {\n      std::vector <unsigned char> jpeg;\n      std::copy(thumbnail_data->data.begin(), \n                thumbnail_data->data.end(),\n                std::back_inserter(jpeg));\n      QImage image = QImage::fromData(jpeg.data(), jpeg.size());\n      DLOG(INFO) << \"image size ===== \" << jpeg.size();\n      hiProvider_.addImage(QString::number(index_), image);\n    }\n  } else {\n     HistoryService* hs = controller->profile()->GetHistoryService(Profile::EXPLICIT_ACCESS);\n     hs->GetPageThumbnail(entry_->url(), \n                          &consumer_,\n                          NewCallback(static_cast<HistoryEntry*>(this),\n                                      &HistoryEntry::onThumbnailDataAvailable));\n  }\n}\n\nvoid HistoryStackModel::openPage(const int index)\n{\n    back_forward_->openPage(entryList_[index]->entry());\n    hide();\n}\n\n#include \"moc_back_forward_button_qt.cc\"\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\/ntp\/foreign_session_handler.h\"\n\n#include <algorithm>\n#include <string>\n#include <vector>\n#include \"base\/bind.h\"\n#include \"base\/bind_helpers.h\"\n#include \"base\/i18n\/time_formatting.h\"\n#include \"base\/memory\/scoped_vector.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/sessions\/session_restore.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_factory.h\"\n#include \"chrome\/browser\/ui\/webui\/session_favicon_source.h\"\n#include \"chrome\/browser\/ui\/webui\/ntp\/new_tab_ui.h\"\n#include \"chrome\/browser\/ui\/webui\/web_ui_util.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/time_format.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n\nnamespace browser_sync {\n\n\/\/ Maximum number of session we're going to display on the NTP\nstatic const size_t kMaxSessionsToShow = 10;\n\n\/\/ Invalid value, used to note that we don't have a tab or window number.\nstatic const int kInvalidId = -1;\n\nnamespace {\n\n\/\/ Comparator function for use with std::sort that will sort sessions by\n\/\/ descending modified_time (i.e., most recent first).\nbool SortSessionsByRecency(const SyncedSession* s1, const SyncedSession* s2) {\n  return s1->modified_time > s2->modified_time;\n}\n\n}  \/\/ namepace\n\nForeignSessionHandler::ForeignSessionHandler() {\n}\n\nvoid ForeignSessionHandler::RegisterMessages() {\n  Init();\n  web_ui()->RegisterMessageCallback(\"getForeignSessions\",\n      base::Bind(&ForeignSessionHandler::HandleGetForeignSessions,\n                 base::Unretained(this)));\n  web_ui()->RegisterMessageCallback(\"openForeignSession\",\n      base::Bind(&ForeignSessionHandler::HandleOpenForeignSession,\n                 base::Unretained(this)));\n  web_ui()->RegisterMessageCallback(\"deleteForeignSession\",\n      base::Bind(&ForeignSessionHandler::HandleDeleteForeignSession,\n                 base::Unretained(this)));\n}\n\nvoid ForeignSessionHandler::Init() {\n  \/\/ TODO(dubroy): Change this to only observe this notification on the current\n  \/\/ profile, rather than all sources (crbug.com\/124717).\n  registrar_.Add(this, chrome::NOTIFICATION_SYNC_CONFIGURE_DONE,\n                 content::NotificationService::AllSources());\n\n  Profile* profile = Profile::FromWebUI(web_ui());\n  registrar_.Add(this, chrome::NOTIFICATION_FOREIGN_SESSION_UPDATED,\n                 content::Source<Profile>(profile));\n  registrar_.Add(this, chrome::NOTIFICATION_FOREIGN_SESSION_DISABLED,\n                 content::Source<Profile>(profile));\n\n  \/\/ Add the data source for synced favicons.\n  ChromeURLDataManager::AddDataSource(profile,\n      new SessionFaviconSource(profile));\n}\n\nvoid ForeignSessionHandler::Observe(\n    int type,\n    const content::NotificationSource& source,\n    const content::NotificationDetails& details) {\n  ListValue list_value;\n  switch (type) {\n    case chrome::NOTIFICATION_SYNC_CONFIGURE_DONE:\n    case chrome::NOTIFICATION_FOREIGN_SESSION_UPDATED:\n    case chrome::NOTIFICATION_FOREIGN_SESSION_DISABLED:\n      HandleGetForeignSessions(&list_value);\n      break;\n    default:\n      NOTREACHED();\n  }\n}\n\nSessionModelAssociator* ForeignSessionHandler::GetModelAssociator() {\n  Profile* profile = Profile::FromWebUI(web_ui());\n  ProfileSyncService* service =\n      ProfileSyncServiceFactory::GetInstance()->GetForProfile(profile);\n  if (service == NULL)\n    return NULL;\n\n  \/\/ Only return the associator if it exists and it is done syncing sessions.\n  SessionModelAssociator* model_associator =\n      service->GetSessionModelAssociator();\n  if (!service->ShouldPushChanges())\n    return NULL;\n  return model_associator;\n}\n\nbool ForeignSessionHandler::IsTabSyncEnabled() {\n  Profile* profile = Profile::FromWebUI(web_ui());\n  ProfileSyncService* service =\n      ProfileSyncServiceFactory::GetInstance()->GetForProfile(profile);\n  return service && service->GetPreferredDataTypes().Has(syncable::SESSIONS);\n}\n\nstring16 ForeignSessionHandler::FormatSessionTime(const base::Time& time) {\n  \/\/ Return a time like \"1 hour ago\", \"2 days ago\", etc.\n  return TimeFormat::TimeElapsed(base::Time::Now() - time);\n}\n\nvoid ForeignSessionHandler::HandleGetForeignSessions(const ListValue* args) {\n  SessionModelAssociator* associator = GetModelAssociator();\n  std::vector<const SyncedSession*> sessions;\n\n  ListValue session_list;\n  if (associator && associator->GetAllForeignSessions(&sessions)) {\n    \/\/ Sort sessions from most recent to least recent.\n    std::sort(sessions.begin(), sessions.end(), SortSessionsByRecency);\n\n    \/\/ Note: we don't own the SyncedSessions themselves.\n    for (size_t i = 0; i < sessions.size() && i < kMaxSessionsToShow; ++i) {\n      const SyncedSession* session = sessions[i];\n      scoped_ptr<DictionaryValue> session_data(new DictionaryValue());\n      session_data->SetString(\"tag\", session->session_tag);\n      session_data->SetString(\"name\", session->session_name);\n      session_data->SetString(\"modifiedTime\",\n                              FormatSessionTime(session->modified_time));\n      scoped_ptr<ListValue> window_list(new ListValue());\n      for (SyncedSession::SyncedWindowMap::const_iterator it =\n           session->windows.begin(); it != session->windows.end(); ++it) {\n        SessionWindow* window = it->second;\n        scoped_ptr<DictionaryValue> window_data(new DictionaryValue());\n        if (SessionWindowToValue(*window, window_data.get()))\n          window_list->Append(window_data.release());\n      }\n\n      session_data->Set(\"windows\", window_list.release());\n      session_list.Append(session_data.release());\n    }\n  }\n  base::FundamentalValue tab_sync_enabled(IsTabSyncEnabled());\n  web_ui()->CallJavascriptFunction(\"ntp.setForeignSessions\",\n                                   session_list,\n                                   tab_sync_enabled);\n}\n\nvoid ForeignSessionHandler::HandleOpenForeignSession(const ListValue* args) {\n  size_t num_args = args->GetSize();\n  \/\/ Expect either 1 or 8 args. For restoring an entire session, only\n  \/\/ one argument is required -- the session tag. To restore a tab,\n  \/\/ the additional args required are the window id, the tab id,\n  \/\/ and 4 properties of the event object (button, altKey, ctrlKey,\n  \/\/ metaKey, shiftKey) for determining how to open the tab.\n  if (num_args != 8U && num_args != 1U) {\n    LOG(ERROR) << \"openForeignSession called with \" << args->GetSize()\n               << \" arguments.\";\n    return;\n  }\n\n  \/\/ Extract the session tag (always provided).\n  std::string session_string_value;\n  if (!args->GetString(0, &session_string_value)) {\n    LOG(ERROR) << \"Failed to extract session tag.\";\n    return;\n  }\n\n  \/\/ Extract window number.\n  std::string window_num_str;\n  int window_num = kInvalidId;\n  if (num_args >= 2 && (!args->GetString(1, &window_num_str) ||\n      !base::StringToInt(window_num_str, &window_num))) {\n    LOG(ERROR) << \"Failed to extract window number.\";\n    return;\n  }\n\n  \/\/ Extract tab id.\n  std::string tab_id_str;\n  SessionID::id_type tab_id = kInvalidId;\n  if (num_args >= 3 && (!args->GetString(2, &tab_id_str) ||\n      !base::StringToInt(tab_id_str, &tab_id))) {\n    LOG(ERROR) << \"Failed to extract tab SessionID.\";\n    return;\n  }\n\n  SessionModelAssociator* associator = GetModelAssociator();\n\n  Profile* profile = Profile::FromWebUI(web_ui());\n  if (tab_id != kInvalidId) {\n    \/\/ We don't actually care about |window_num|, this is just a sanity check.\n    DCHECK_LT(kInvalidId, window_num);\n    const SessionTab* tab;\n    if (!associator->GetForeignTab(session_string_value, tab_id, &tab)) {\n      LOG(ERROR) << \"Failed to load foreign tab.\";\n      return;\n    }\n    WindowOpenDisposition disposition =\n        web_ui_util::GetDispositionFromClick(args, 3);\n    SessionRestore::RestoreForeignSessionTab(profile, *tab, disposition);\n  } else {\n    std::vector<const SessionWindow*> windows;\n    \/\/ Note: we don't own the ForeignSessions themselves.\n    if (!associator->GetForeignSession(session_string_value, &windows)) {\n      LOG(ERROR) << \"ForeignSessionHandler failed to get session data from\"\n          \"SessionModelAssociator.\";\n      return;\n    }\n    std::vector<const SessionWindow*>::const_iterator iter_begin =\n        windows.begin() + ((window_num == kInvalidId) ? 0 : window_num);\n    std::vector<const SessionWindow*>::const_iterator iter_end =\n        ((window_num == kInvalidId) ?\n        std::vector<const SessionWindow*>::const_iterator(windows.end()) :\n        iter_begin + 1);\n    SessionRestore::RestoreForeignSessionWindows(profile, iter_begin, iter_end);\n  }\n}\n\nvoid ForeignSessionHandler::HandleDeleteForeignSession(const ListValue* args) {\n  if (args->GetSize() != 1U) {\n    LOG(ERROR) << \"Wrong number of args to deleteForeignSession\";\n    return;\n  }\n\n  \/\/ Get the session tag argument (required).\n  std::string session_tag = UTF16ToUTF8(ExtractStringValue(args));\n\n  SessionModelAssociator* associator = GetModelAssociator();\n  if (associator)\n    associator->DeleteForeignSession(session_tag);\n}\n\nbool ForeignSessionHandler::SessionTabToValue(\n    const SessionTab& tab,\n    DictionaryValue* dictionary) {\n  if (tab.navigations.empty())\n    return false;\n  int selected_index = tab.current_navigation_index;\n  selected_index = std::max(\n      0,\n      std::min(selected_index,\n               static_cast<int>(tab.navigations.size() - 1)));\n  const TabNavigation& current_navigation =\n      tab.navigations.at(selected_index);\n  GURL tab_url = current_navigation.virtual_url();\n  if (tab_url == GURL(chrome::kChromeUINewTabURL))\n    return false;\n  NewTabUI::SetURLTitleAndDirection(dictionary, current_navigation.title(),\n                                    tab_url);\n  dictionary->SetString(\"type\", \"tab\");\n  dictionary->SetDouble(\"timestamp\",\n                        static_cast<double>(tab.timestamp.ToInternalValue()));\n  dictionary->SetInteger(\"sessionId\", tab.tab_id.id());\n  return true;\n}\n\nbool ForeignSessionHandler::SessionWindowToValue(\n    const SessionWindow& window,\n    DictionaryValue* dictionary) {\n  if (window.tabs.empty()) {\n    NOTREACHED();\n    return false;\n  }\n  scoped_ptr<ListValue> tab_values(new ListValue());\n  for (size_t i = 0; i < window.tabs.size(); ++i) {\n    scoped_ptr<DictionaryValue> tab_value(new DictionaryValue());\n    if (SessionTabToValue(*window.tabs[i], tab_value.get()))\n      tab_values->Append(tab_value.release());\n  }\n  if (tab_values->GetSize() == 0)\n    return false;\n  dictionary->SetString(\"type\", \"window\");\n  dictionary->SetDouble(\"timestamp\",\n      static_cast<double>(window.timestamp.ToInternalValue()));\n  dictionary->SetInteger(\"sessionId\", window.window_id.id());\n  dictionary->Set(\"tabs\", tab_values.release());\n  return true;\n}\n\n}  \/\/ namespace browser_sync\n<commit_msg>NTP: Fix possible segfault in Other Devices menu.<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\/ntp\/foreign_session_handler.h\"\n\n#include <algorithm>\n#include <string>\n#include <vector>\n#include \"base\/bind.h\"\n#include \"base\/bind_helpers.h\"\n#include \"base\/i18n\/time_formatting.h\"\n#include \"base\/memory\/scoped_vector.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/sessions\/session_restore.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_factory.h\"\n#include \"chrome\/browser\/ui\/webui\/session_favicon_source.h\"\n#include \"chrome\/browser\/ui\/webui\/ntp\/new_tab_ui.h\"\n#include \"chrome\/browser\/ui\/webui\/web_ui_util.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/time_format.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n\nnamespace browser_sync {\n\n\/\/ Maximum number of session we're going to display on the NTP\nstatic const size_t kMaxSessionsToShow = 10;\n\n\/\/ Invalid value, used to note that we don't have a tab or window number.\nstatic const int kInvalidId = -1;\n\nnamespace {\n\n\/\/ Comparator function for use with std::sort that will sort sessions by\n\/\/ descending modified_time (i.e., most recent first).\nbool SortSessionsByRecency(const SyncedSession* s1, const SyncedSession* s2) {\n  return s1->modified_time > s2->modified_time;\n}\n\n}  \/\/ namepace\n\nForeignSessionHandler::ForeignSessionHandler() {\n}\n\nvoid ForeignSessionHandler::RegisterMessages() {\n  Init();\n  web_ui()->RegisterMessageCallback(\"getForeignSessions\",\n      base::Bind(&ForeignSessionHandler::HandleGetForeignSessions,\n                 base::Unretained(this)));\n  web_ui()->RegisterMessageCallback(\"openForeignSession\",\n      base::Bind(&ForeignSessionHandler::HandleOpenForeignSession,\n                 base::Unretained(this)));\n  web_ui()->RegisterMessageCallback(\"deleteForeignSession\",\n      base::Bind(&ForeignSessionHandler::HandleDeleteForeignSession,\n                 base::Unretained(this)));\n}\n\nvoid ForeignSessionHandler::Init() {\n  \/\/ TODO(dubroy): Change this to only observe this notification on the current\n  \/\/ profile, rather than all sources (crbug.com\/124717).\n  registrar_.Add(this, chrome::NOTIFICATION_SYNC_CONFIGURE_DONE,\n                 content::NotificationService::AllSources());\n\n  Profile* profile = Profile::FromWebUI(web_ui());\n  registrar_.Add(this, chrome::NOTIFICATION_FOREIGN_SESSION_UPDATED,\n                 content::Source<Profile>(profile));\n  registrar_.Add(this, chrome::NOTIFICATION_FOREIGN_SESSION_DISABLED,\n                 content::Source<Profile>(profile));\n\n  \/\/ Add the data source for synced favicons.\n  ChromeURLDataManager::AddDataSource(profile,\n      new SessionFaviconSource(profile));\n}\n\nvoid ForeignSessionHandler::Observe(\n    int type,\n    const content::NotificationSource& source,\n    const content::NotificationDetails& details) {\n  ListValue list_value;\n  switch (type) {\n    case chrome::NOTIFICATION_SYNC_CONFIGURE_DONE:\n    case chrome::NOTIFICATION_FOREIGN_SESSION_UPDATED:\n    case chrome::NOTIFICATION_FOREIGN_SESSION_DISABLED:\n      HandleGetForeignSessions(&list_value);\n      break;\n    default:\n      NOTREACHED();\n  }\n}\n\nSessionModelAssociator* ForeignSessionHandler::GetModelAssociator() {\n  Profile* profile = Profile::FromWebUI(web_ui());\n  ProfileSyncService* service =\n      ProfileSyncServiceFactory::GetInstance()->GetForProfile(profile);\n  if (service == NULL)\n    return NULL;\n\n  \/\/ Only return the associator if it exists and it is done syncing sessions.\n  SessionModelAssociator* model_associator =\n      service->GetSessionModelAssociator();\n  if (!service->ShouldPushChanges())\n    return NULL;\n  return model_associator;\n}\n\nbool ForeignSessionHandler::IsTabSyncEnabled() {\n  Profile* profile = Profile::FromWebUI(web_ui());\n  ProfileSyncService* service =\n      ProfileSyncServiceFactory::GetInstance()->GetForProfile(profile);\n  return service && service->GetPreferredDataTypes().Has(syncable::SESSIONS);\n}\n\nstring16 ForeignSessionHandler::FormatSessionTime(const base::Time& time) {\n  \/\/ Return a time like \"1 hour ago\", \"2 days ago\", etc.\n  return TimeFormat::TimeElapsed(base::Time::Now() - time);\n}\n\nvoid ForeignSessionHandler::HandleGetForeignSessions(const ListValue* args) {\n  SessionModelAssociator* associator = GetModelAssociator();\n  std::vector<const SyncedSession*> sessions;\n\n  ListValue session_list;\n  if (associator && associator->GetAllForeignSessions(&sessions)) {\n    \/\/ Sort sessions from most recent to least recent.\n    std::sort(sessions.begin(), sessions.end(), SortSessionsByRecency);\n\n    \/\/ Note: we don't own the SyncedSessions themselves.\n    for (size_t i = 0; i < sessions.size() && i < kMaxSessionsToShow; ++i) {\n      const SyncedSession* session = sessions[i];\n      scoped_ptr<DictionaryValue> session_data(new DictionaryValue());\n      session_data->SetString(\"tag\", session->session_tag);\n      session_data->SetString(\"name\", session->session_name);\n      session_data->SetString(\"modifiedTime\",\n                              FormatSessionTime(session->modified_time));\n      scoped_ptr<ListValue> window_list(new ListValue());\n      for (SyncedSession::SyncedWindowMap::const_iterator it =\n           session->windows.begin(); it != session->windows.end(); ++it) {\n        SessionWindow* window = it->second;\n        scoped_ptr<DictionaryValue> window_data(new DictionaryValue());\n        if (SessionWindowToValue(*window, window_data.get()))\n          window_list->Append(window_data.release());\n      }\n\n      session_data->Set(\"windows\", window_list.release());\n      session_list.Append(session_data.release());\n    }\n  }\n  base::FundamentalValue tab_sync_enabled(IsTabSyncEnabled());\n  web_ui()->CallJavascriptFunction(\"ntp.setForeignSessions\",\n                                   session_list,\n                                   tab_sync_enabled);\n}\n\nvoid ForeignSessionHandler::HandleOpenForeignSession(const ListValue* args) {\n  size_t num_args = args->GetSize();\n  \/\/ Expect either 1 or 8 args. For restoring an entire session, only\n  \/\/ one argument is required -- the session tag. To restore a tab,\n  \/\/ the additional args required are the window id, the tab id,\n  \/\/ and 4 properties of the event object (button, altKey, ctrlKey,\n  \/\/ metaKey, shiftKey) for determining how to open the tab.\n  if (num_args != 8U && num_args != 1U) {\n    LOG(ERROR) << \"openForeignSession called with \" << args->GetSize()\n               << \" arguments.\";\n    return;\n  }\n\n  \/\/ Extract the session tag (always provided).\n  std::string session_string_value;\n  if (!args->GetString(0, &session_string_value)) {\n    LOG(ERROR) << \"Failed to extract session tag.\";\n    return;\n  }\n\n  \/\/ Extract window number.\n  std::string window_num_str;\n  int window_num = kInvalidId;\n  if (num_args >= 2 && (!args->GetString(1, &window_num_str) ||\n      !base::StringToInt(window_num_str, &window_num))) {\n    LOG(ERROR) << \"Failed to extract window number.\";\n    return;\n  }\n\n  \/\/ Extract tab id.\n  std::string tab_id_str;\n  SessionID::id_type tab_id = kInvalidId;\n  if (num_args >= 3 && (!args->GetString(2, &tab_id_str) ||\n      !base::StringToInt(tab_id_str, &tab_id))) {\n    LOG(ERROR) << \"Failed to extract tab SessionID.\";\n    return;\n  }\n\n  SessionModelAssociator* associator = GetModelAssociator();\n  if (!associator)\n    return;\n\n  Profile* profile = Profile::FromWebUI(web_ui());\n  if (tab_id != kInvalidId) {\n    \/\/ We don't actually care about |window_num|, this is just a sanity check.\n    DCHECK_LT(kInvalidId, window_num);\n    const SessionTab* tab;\n    if (!associator->GetForeignTab(session_string_value, tab_id, &tab)) {\n      LOG(ERROR) << \"Failed to load foreign tab.\";\n      return;\n    }\n    WindowOpenDisposition disposition =\n        web_ui_util::GetDispositionFromClick(args, 3);\n    SessionRestore::RestoreForeignSessionTab(profile, *tab, disposition);\n  } else {\n    std::vector<const SessionWindow*> windows;\n    \/\/ Note: we don't own the ForeignSessions themselves.\n    if (!associator->GetForeignSession(session_string_value, &windows)) {\n      LOG(ERROR) << \"ForeignSessionHandler failed to get session data from\"\n          \"SessionModelAssociator.\";\n      return;\n    }\n    std::vector<const SessionWindow*>::const_iterator iter_begin =\n        windows.begin() + ((window_num == kInvalidId) ? 0 : window_num);\n    std::vector<const SessionWindow*>::const_iterator iter_end =\n        ((window_num == kInvalidId) ?\n        std::vector<const SessionWindow*>::const_iterator(windows.end()) :\n        iter_begin + 1);\n    SessionRestore::RestoreForeignSessionWindows(profile, iter_begin, iter_end);\n  }\n}\n\nvoid ForeignSessionHandler::HandleDeleteForeignSession(const ListValue* args) {\n  if (args->GetSize() != 1U) {\n    LOG(ERROR) << \"Wrong number of args to deleteForeignSession\";\n    return;\n  }\n\n  \/\/ Get the session tag argument (required).\n  std::string session_tag = UTF16ToUTF8(ExtractStringValue(args));\n\n  SessionModelAssociator* associator = GetModelAssociator();\n  if (associator)\n    associator->DeleteForeignSession(session_tag);\n}\n\nbool ForeignSessionHandler::SessionTabToValue(\n    const SessionTab& tab,\n    DictionaryValue* dictionary) {\n  if (tab.navigations.empty())\n    return false;\n  int selected_index = tab.current_navigation_index;\n  selected_index = std::max(\n      0,\n      std::min(selected_index,\n               static_cast<int>(tab.navigations.size() - 1)));\n  const TabNavigation& current_navigation =\n      tab.navigations.at(selected_index);\n  GURL tab_url = current_navigation.virtual_url();\n  if (tab_url == GURL(chrome::kChromeUINewTabURL))\n    return false;\n  NewTabUI::SetURLTitleAndDirection(dictionary, current_navigation.title(),\n                                    tab_url);\n  dictionary->SetString(\"type\", \"tab\");\n  dictionary->SetDouble(\"timestamp\",\n                        static_cast<double>(tab.timestamp.ToInternalValue()));\n  dictionary->SetInteger(\"sessionId\", tab.tab_id.id());\n  return true;\n}\n\nbool ForeignSessionHandler::SessionWindowToValue(\n    const SessionWindow& window,\n    DictionaryValue* dictionary) {\n  if (window.tabs.empty()) {\n    NOTREACHED();\n    return false;\n  }\n  scoped_ptr<ListValue> tab_values(new ListValue());\n  for (size_t i = 0; i < window.tabs.size(); ++i) {\n    scoped_ptr<DictionaryValue> tab_value(new DictionaryValue());\n    if (SessionTabToValue(*window.tabs[i], tab_value.get()))\n      tab_values->Append(tab_value.release());\n  }\n  if (tab_values->GetSize() == 0)\n    return false;\n  dictionary->SetString(\"type\", \"window\");\n  dictionary->SetDouble(\"timestamp\",\n      static_cast<double>(window.timestamp.ToInternalValue()));\n  dictionary->SetInteger(\"sessionId\", window.window_id.id());\n  dictionary->Set(\"tabs\", tab_values.release());\n  return true;\n}\n\n}  \/\/ namespace browser_sync\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file TypedBaseFilter.hxx\n *\/\n\n#include <ATK\/Core\/TypedBaseFilter.h>\n#include <ATK\/Core\/Utilities.h>\n\n#include <complex>\n#include <cstdint>\n#include <type_traits>\n\n#include <boost\/mpl\/contains.hpp>\n#include <boost\/mpl\/distance.hpp>\n#include <boost\/mpl\/empty.hpp>\n#include <boost\/mpl\/find.hpp>\n#include <boost\/mpl\/front.hpp>\n#include <boost\/mpl\/pop_front.hpp>\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/type_traits.hpp>\n#include <boost\/utility\/enable_if.hpp>\n\n#if USE_SIMD\n#include <simdpp\/simd.h>\n#endif\n\nnamespace\n{\n  const size_t alignment = 32;\n\n  typedef boost::mpl::vector<std::int16_t, std::int32_t, int64_t, float, double, std::complex<float>, std::complex<double> > ConversionTypes;\n\n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::mpl::empty<Vector>::type, void>::type\n    convert_scalar_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    throw std::runtime_error(\"Cannot convert types for these filters\");\n  }\n\n  \n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::is_arithmetic<typename boost::mpl::front<Vector>::type>::type, typename boost::disable_if<typename boost::mpl::empty<Vector>::type, void>::type>::type\n  convert_scalar_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    convert_scalar_array<typename boost::mpl::pop_front<Vector>::type, DataType>(filter, port, converted_input, size, type - 1);\n  }\n\n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::is_arithmetic<typename boost::mpl::front<Vector>::type>::type, typename boost::disable_if<typename boost::mpl::empty<Vector>::type, void>::type>::type\n    convert_scalar_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    if(type != 0)\n    {\n      convert_scalar_array<typename boost::mpl::pop_front<Vector>::type, DataType>(filter, port, converted_input, size, type - 1);\n    }\n    else\n    {\n      typedef typename boost::mpl::front<Vector>::type InputOriginalType;\n      InputOriginalType* original_input_array = static_cast<ATK::TypedBaseFilter<InputOriginalType>*>(filter)->get_output_array(port);\n      ATK::ConversionUtilities<InputOriginalType, DataType>::convert_array(original_input_array, converted_input, size);\n    }\n  }\n\n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::mpl::empty<Vector>::type, void>::type\n    convert_complex_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    throw std::runtime_error(\"Can't convert types\");\n  }\n\n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::mpl::empty<Vector>::type, void>::type\n    convert_complex_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    assert(type >= 0);\n    if (type != 0)\n    {\n      convert_complex_array<typename boost::mpl::pop_front<Vector>::type, DataType>(filter, port, converted_input, size, type - 1);\n    }\n    else\n    {\n      typedef typename boost::mpl::front<Vector>::type InputOriginalType;\n      InputOriginalType* original_input_array = static_cast<ATK::TypedBaseFilter<InputOriginalType>*>(filter)->get_output_array(port);\n      ATK::ConversionUtilities<InputOriginalType, DataType>::convert_array(original_input_array, converted_input, size);\n    }\n  }\n  \n  \/\/\/ Conversion function for arithmetic types\n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::is_arithmetic<DataType>::type, void>::type convert_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    convert_scalar_array<Vector, DataType>(filter, port, converted_input, size, type);\n  }\n  \n  \/\/\/ Conversion function for other types not contained in ConversionTypes (no conversion in that case, just copy)\n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::is_arithmetic<DataType>::type, typename boost::disable_if<typename boost::mpl::contains<Vector, DataType>::type, void>::type>::type convert_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    assert(dynamic_cast<ATK::TypedBaseFilter<DataType>*>(filter));\n    DataType* original_input_array = static_cast<ATK::TypedBaseFilter<DataType>*>(filter)->get_output_array(port);\n    ATK::ConversionUtilities<DataType, DataType>::convert_array(original_input_array, converted_input, size);\n  }\n  \n  \/\/\/ Conversion function for std::complex contained in ConversionTypes\n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::is_arithmetic<DataType>::type, typename boost::enable_if<typename boost::mpl::contains<Vector, DataType>::type, void>::type>::type convert_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    convert_complex_array<Vector, DataType>(filter, port, converted_input, size, type);\n  }\n  \n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::mpl::contains<Vector, DataType>::type, int>::type get_type()\n  {\n    return boost::mpl::distance<boost::mpl::begin<ConversionTypes>::type, typename boost::mpl::find<ConversionTypes, DataType>::type >::value;\n  }\n\n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::mpl::contains<Vector, DataType>::type, int>::type get_type()\n  {\n    return -1;\n  }\n}\n\nnamespace ATK\n{\n  template<typename DataType_, typename DataType__>\n  TypedBaseFilter<DataType_, DataType__>::TypedBaseFilter(std::size_t nb_input_ports, std::size_t nb_output_ports)\n  :Parent(nb_input_ports, nb_output_ports), converted_inputs_delay(nb_input_ports), converted_inputs(nb_input_ports, nullptr), converted_inputs_size(nb_input_ports, 0), outputs_delay(nb_output_ports), outputs(nb_output_ports, nullptr), outputs_size(nb_output_ports, 0), default_input(nb_input_ports, TypeTraits<DataType_>::Zero()), default_output(nb_output_ports, TypeTraits<DataType__>::Zero())\n  {\n  }\n\n  template<typename DataType_, typename DataType__>\n  TypedBaseFilter<DataType_, DataType__>::TypedBaseFilter(TypedBaseFilter&& other)\n    : Parent(std::move(other)), converted_inputs_delay(std::move(other.converted_inputs_delay)), converted_inputs(std::move(other.converted_inputs)), converted_inputs_size(std::move(other.converted_inputs_size)), outputs_delay(std::move(other.outputs_delay)), outputs(std::move(other.outputs)), outputs_size(std::move(other.outputs_size)), default_input(std::move(other.default_input)), default_output(std::move(other.default_output))\n  {\n  }\n\n  template<typename DataType_, typename DataType__>\n  TypedBaseFilter<DataType_, DataType__>::~TypedBaseFilter()\n  {\n  }\n  \n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::set_nb_input_ports(std::size_t nb_ports)\n  {\n    if(nb_ports == nb_input_ports)\n      return;\n    Parent::set_nb_input_ports(nb_ports);\n    converted_inputs_delay = std::vector<std::unique_ptr<DataTypeInput[]> >(nb_ports);\n    converted_inputs.assign(nb_ports, nullptr);\n    converted_inputs_size.assign(nb_ports, 0);\n    default_input.assign(nb_ports, TypeTraits<DataTypeInput>::Zero());\n  }\n  \n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::set_nb_output_ports(std::size_t nb_ports)\n  {\n    if(nb_ports == nb_output_ports)\n      return;\n    Parent::set_nb_output_ports(nb_ports);\n    outputs_delay = std::vector<std::unique_ptr<DataTypeOutput[]> >(nb_ports);\n    outputs.assign(nb_ports, nullptr);\n    outputs_size.assign(nb_ports, 0);\n    default_output.assign(nb_ports, TypeTraits<DataTypeOutput>::Zero());\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::process_impl(std::size_t size) const\n  {\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::prepare_process(std::size_t size)\n  {\n    convert_inputs(size);\n  }\n\n  template<typename DataType_, typename DataType__>\n  int TypedBaseFilter<DataType_, DataType__>::get_type() const\n  {\n    return ::get_type<ConversionTypes, DataType__>();\n  }\n\n  template<typename DataType_, typename DataType__>\n  DataType__* TypedBaseFilter<DataType_, DataType__>::get_output_array(std::size_t port) const\n  {\n    return outputs[port];\n  }\n\n  template<typename DataType_, typename DataType__>\n  std::size_t TypedBaseFilter<DataType_, DataType__>::get_output_array_size() const\n  {\n    return outputs_size.front();\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::convert_inputs(std::size_t size)\n  {\n    for(unsigned int i = 0; i < nb_input_ports; ++i)\n    {\n      \/\/ if the input delay is smaller than the preceding filter output delay, we may have overlap\n      \/\/ if the types are identical and if the type is not -1 (an unknown type)\n      \/\/ if we have overlap, don't copy anything at all\n      if((input_delay <= connections[i].second->get_output_delay()) && (connections[i].second->get_type() == get_type()) && (get_type() != -1))\n      {\n        converted_inputs[i] = reinterpret_cast<const TypedBaseFilter<DataTypeInput>* >(connections[i].second)->get_output_array(connections[i].first);\n        converted_inputs_size[i] = size;\n        continue;\n      }\n      auto input_size = converted_inputs_size[i];\n      if(input_size < size)\n      {\n        std::unique_ptr<DataTypeInput[]> temp(new DataTypeInput[static_cast<unsigned int>(input_delay + size + (alignment - 1) \/ sizeof(DataTypeInput))]);\n        auto my_temp_ptr = reinterpret_cast<void*>(temp.get());\n        size_t space;\n        std::align(alignment, sizeof(DataTypeInput), my_temp_ptr, space);\n        auto temp_ptr = reinterpret_cast<DataTypeInput*>(my_temp_ptr);\n        if(input_size == 0)\n        {\n          for(unsigned int j = 0; j < input_delay; ++j)\n          {\n            temp_ptr[j] = default_input[i];\n          }\n        }\n        else\n        {\n          const auto input_ptr = converted_inputs[i];\n          for(int j = 0; j < static_cast<int>(input_delay); ++j)\n          {\n            temp_ptr[j] = input_ptr[last_size + j - input_delay];\n          }\n        }\n        \n        converted_inputs_delay[i] = std::move(temp);\n        converted_inputs[i] = temp_ptr + input_delay;\n        converted_inputs_size[i] = size;\n      }\n      else\n      {\n        auto my_last_size = static_cast<int64_t>(last_size) * input_sampling_rate \/ output_sampling_rate;\n        const auto input_ptr = converted_inputs[i];\n        for(int j = 0; j < static_cast<int>(input_delay); ++j)\n        {\n          input_ptr[j - input_delay] = input_ptr[my_last_size + j - input_delay];\n        }\n      }\n      convert_array<ConversionTypes, DataTypeInput>(connections[i].second, connections[i].first, converted_inputs[i], size, connections[i].second->get_type());\n    }\n  }\n  \n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::prepare_outputs(std::size_t size)\n  {\n    for(unsigned int i = 0; i < nb_output_ports; ++i)\n    {\n      auto output_size = outputs_size[i];\n      if(output_size < size)\n      {\n        std::unique_ptr<DataTypeOutput[]> temp(new DataTypeOutput[static_cast<unsigned int>(output_delay + size + (alignment - 1) \/ sizeof(DataTypeOutput))]);\n        auto my_temp_ptr = reinterpret_cast<void*>(temp.get());\n        size_t space;\n        std::align(alignment, sizeof(DataTypeOutput), my_temp_ptr, space);\n        auto temp_ptr = reinterpret_cast<DataTypeOutput*>(my_temp_ptr);\n        if(output_size == 0)\n        {\n          for(unsigned int j = 0; j < output_delay; ++j)\n          {\n            temp_ptr[j] = default_output[i];\n          }\n        }\n        else\n        {\n          const auto output_ptr = outputs[i];\n          for(int j = 0; j < static_cast<int>(output_delay); ++j)\n          {\n            temp_ptr[j] = output_ptr[last_size + j - output_delay];\n          }\n        }\n        \n        outputs_delay[i] = std::move(temp);\n        outputs[i] = temp_ptr + output_delay;\n        outputs_size[i] = size;\n      }\n      else\n      {\n        const auto output_ptr = outputs[i];\n        for(int j = 0; j < static_cast<int>(output_delay); ++j)\n        {\n          output_ptr[j - output_delay] = output_ptr[last_size + j - output_delay];\n        }\n      }\n    }\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::full_setup()\n  {\n    \/\/ Reset input arrays\n    converted_inputs_delay = std::vector<std::unique_ptr<DataTypeInput[]> >(nb_input_ports);\n    converted_inputs.assign(nb_input_ports, nullptr);\n    converted_inputs_size.assign(nb_input_ports, 0);\n\n    \/\/ Reset output arrays\n    outputs_delay = std::vector<std::unique_ptr<DataTypeOutput[]> >(nb_output_ports);\n    outputs.assign(nb_output_ports, nullptr);\n    outputs_size.assign(nb_output_ports, 0);\n\n    Parent::full_setup();\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::set_input_port(std::size_t input_port, BaseFilter* filter, std::size_t output_port)\n  {\n    Parent::set_input_port(input_port, filter, output_port);\n    converted_inputs_size[input_port] = 0;\n  }\n}\n<commit_msg>OK, the dynamic cast is wrong. Not sure yet how to make it proper, although the static cast works by shear luck.<commit_after>\/**\n * \\file TypedBaseFilter.hxx\n *\/\n\n#include <ATK\/Core\/TypedBaseFilter.h>\n#include <ATK\/Core\/Utilities.h>\n\n#include <complex>\n#include <cstdint>\n#include <type_traits>\n\n#include <boost\/mpl\/contains.hpp>\n#include <boost\/mpl\/distance.hpp>\n#include <boost\/mpl\/empty.hpp>\n#include <boost\/mpl\/find.hpp>\n#include <boost\/mpl\/front.hpp>\n#include <boost\/mpl\/pop_front.hpp>\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/type_traits.hpp>\n#include <boost\/utility\/enable_if.hpp>\n\n#if USE_SIMD\n#include <simdpp\/simd.h>\n#endif\n\nnamespace\n{\n  const size_t alignment = 32;\n\n  typedef boost::mpl::vector<std::int16_t, std::int32_t, int64_t, float, double, std::complex<float>, std::complex<double> > ConversionTypes;\n\n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::mpl::empty<Vector>::type, void>::type\n    convert_scalar_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    throw std::runtime_error(\"Cannot convert types for these filters\");\n  }\n\n  \n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::is_arithmetic<typename boost::mpl::front<Vector>::type>::type, typename boost::disable_if<typename boost::mpl::empty<Vector>::type, void>::type>::type\n  convert_scalar_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    convert_scalar_array<typename boost::mpl::pop_front<Vector>::type, DataType>(filter, port, converted_input, size, type - 1);\n  }\n\n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::is_arithmetic<typename boost::mpl::front<Vector>::type>::type, typename boost::disable_if<typename boost::mpl::empty<Vector>::type, void>::type>::type\n    convert_scalar_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    if(type != 0)\n    {\n      convert_scalar_array<typename boost::mpl::pop_front<Vector>::type, DataType>(filter, port, converted_input, size, type - 1);\n    }\n    else\n    {\n      typedef typename boost::mpl::front<Vector>::type InputOriginalType;\n      InputOriginalType* original_input_array = static_cast<ATK::TypedBaseFilter<InputOriginalType>*>(filter)->get_output_array(port);\n      ATK::ConversionUtilities<InputOriginalType, DataType>::convert_array(original_input_array, converted_input, size);\n    }\n  }\n\n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::mpl::empty<Vector>::type, void>::type\n    convert_complex_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    throw std::runtime_error(\"Can't convert types\");\n  }\n\n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::mpl::empty<Vector>::type, void>::type\n    convert_complex_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    assert(type >= 0);\n    if (type != 0)\n    {\n      convert_complex_array<typename boost::mpl::pop_front<Vector>::type, DataType>(filter, port, converted_input, size, type - 1);\n    }\n    else\n    {\n      typedef typename boost::mpl::front<Vector>::type InputOriginalType;\n      InputOriginalType* original_input_array = static_cast<ATK::TypedBaseFilter<InputOriginalType>*>(filter)->get_output_array(port);\n      ATK::ConversionUtilities<InputOriginalType, DataType>::convert_array(original_input_array, converted_input, size);\n    }\n  }\n  \n  \/\/\/ Conversion function for arithmetic types\n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::is_arithmetic<DataType>::type, void>::type convert_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    convert_scalar_array<Vector, DataType>(filter, port, converted_input, size, type);\n  }\n  \n  \/\/\/ Conversion function for other types not contained in ConversionTypes (no conversion in that case, just copy)\n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::is_arithmetic<DataType>::type, typename boost::disable_if<typename boost::mpl::contains<Vector, DataType>::type, void>::type>::type convert_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    \/\/assert(dynamic_cast<ATK::TypedBaseFilter<DataType>*>(filter)); OK, this is wrong for now\n    DataType* original_input_array = static_cast<ATK::TypedBaseFilter<DataType>*>(filter)->get_output_array(port);\n    ATK::ConversionUtilities<DataType, DataType>::convert_array(original_input_array, converted_input, size);\n  }\n  \n  \/\/\/ Conversion function for std::complex contained in ConversionTypes\n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::is_arithmetic<DataType>::type, typename boost::enable_if<typename boost::mpl::contains<Vector, DataType>::type, void>::type>::type convert_array(ATK::BaseFilter* filter, unsigned int port, DataType* converted_input, std::size_t size, int type)\n  {\n    convert_complex_array<Vector, DataType>(filter, port, converted_input, size, type);\n  }\n  \n  template<typename Vector, typename DataType>\n  typename boost::enable_if<typename boost::mpl::contains<Vector, DataType>::type, int>::type get_type()\n  {\n    return boost::mpl::distance<boost::mpl::begin<ConversionTypes>::type, typename boost::mpl::find<ConversionTypes, DataType>::type >::value;\n  }\n\n  template<typename Vector, typename DataType>\n  typename boost::disable_if<typename boost::mpl::contains<Vector, DataType>::type, int>::type get_type()\n  {\n    return -1;\n  }\n}\n\nnamespace ATK\n{\n  template<typename DataType_, typename DataType__>\n  TypedBaseFilter<DataType_, DataType__>::TypedBaseFilter(std::size_t nb_input_ports, std::size_t nb_output_ports)\n  :Parent(nb_input_ports, nb_output_ports), converted_inputs_delay(nb_input_ports), converted_inputs(nb_input_ports, nullptr), converted_inputs_size(nb_input_ports, 0), outputs_delay(nb_output_ports), outputs(nb_output_ports, nullptr), outputs_size(nb_output_ports, 0), default_input(nb_input_ports, TypeTraits<DataType_>::Zero()), default_output(nb_output_ports, TypeTraits<DataType__>::Zero())\n  {\n  }\n\n  template<typename DataType_, typename DataType__>\n  TypedBaseFilter<DataType_, DataType__>::TypedBaseFilter(TypedBaseFilter&& other)\n    : Parent(std::move(other)), converted_inputs_delay(std::move(other.converted_inputs_delay)), converted_inputs(std::move(other.converted_inputs)), converted_inputs_size(std::move(other.converted_inputs_size)), outputs_delay(std::move(other.outputs_delay)), outputs(std::move(other.outputs)), outputs_size(std::move(other.outputs_size)), default_input(std::move(other.default_input)), default_output(std::move(other.default_output))\n  {\n  }\n\n  template<typename DataType_, typename DataType__>\n  TypedBaseFilter<DataType_, DataType__>::~TypedBaseFilter()\n  {\n  }\n  \n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::set_nb_input_ports(std::size_t nb_ports)\n  {\n    if(nb_ports == nb_input_ports)\n      return;\n    Parent::set_nb_input_ports(nb_ports);\n    converted_inputs_delay = std::vector<std::unique_ptr<DataTypeInput[]> >(nb_ports);\n    converted_inputs.assign(nb_ports, nullptr);\n    converted_inputs_size.assign(nb_ports, 0);\n    default_input.assign(nb_ports, TypeTraits<DataTypeInput>::Zero());\n  }\n  \n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::set_nb_output_ports(std::size_t nb_ports)\n  {\n    if(nb_ports == nb_output_ports)\n      return;\n    Parent::set_nb_output_ports(nb_ports);\n    outputs_delay = std::vector<std::unique_ptr<DataTypeOutput[]> >(nb_ports);\n    outputs.assign(nb_ports, nullptr);\n    outputs_size.assign(nb_ports, 0);\n    default_output.assign(nb_ports, TypeTraits<DataTypeOutput>::Zero());\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::process_impl(std::size_t size) const\n  {\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::prepare_process(std::size_t size)\n  {\n    convert_inputs(size);\n  }\n\n  template<typename DataType_, typename DataType__>\n  int TypedBaseFilter<DataType_, DataType__>::get_type() const\n  {\n    return ::get_type<ConversionTypes, DataType__>();\n  }\n\n  template<typename DataType_, typename DataType__>\n  DataType__* TypedBaseFilter<DataType_, DataType__>::get_output_array(std::size_t port) const\n  {\n    return outputs[port];\n  }\n\n  template<typename DataType_, typename DataType__>\n  std::size_t TypedBaseFilter<DataType_, DataType__>::get_output_array_size() const\n  {\n    return outputs_size.front();\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::convert_inputs(std::size_t size)\n  {\n    for(unsigned int i = 0; i < nb_input_ports; ++i)\n    {\n      \/\/ if the input delay is smaller than the preceding filter output delay, we may have overlap\n      \/\/ if the types are identical and if the type is not -1 (an unknown type)\n      \/\/ if we have overlap, don't copy anything at all\n      if((input_delay <= connections[i].second->get_output_delay()) && (connections[i].second->get_type() == get_type()) && (get_type() != -1))\n      {\n        converted_inputs[i] = reinterpret_cast<const TypedBaseFilter<DataTypeInput>* >(connections[i].second)->get_output_array(connections[i].first);\n        converted_inputs_size[i] = size;\n        continue;\n      }\n      auto input_size = converted_inputs_size[i];\n      if(input_size < size)\n      {\n        std::unique_ptr<DataTypeInput[]> temp(new DataTypeInput[static_cast<unsigned int>(input_delay + size + (alignment - 1) \/ sizeof(DataTypeInput))]);\n        auto my_temp_ptr = reinterpret_cast<void*>(temp.get());\n        size_t space;\n        std::align(alignment, sizeof(DataTypeInput), my_temp_ptr, space);\n        auto temp_ptr = reinterpret_cast<DataTypeInput*>(my_temp_ptr);\n        if(input_size == 0)\n        {\n          for(unsigned int j = 0; j < input_delay; ++j)\n          {\n            temp_ptr[j] = default_input[i];\n          }\n        }\n        else\n        {\n          const auto input_ptr = converted_inputs[i];\n          for(int j = 0; j < static_cast<int>(input_delay); ++j)\n          {\n            temp_ptr[j] = input_ptr[last_size + j - input_delay];\n          }\n        }\n        \n        converted_inputs_delay[i] = std::move(temp);\n        converted_inputs[i] = temp_ptr + input_delay;\n        converted_inputs_size[i] = size;\n      }\n      else\n      {\n        auto my_last_size = static_cast<int64_t>(last_size) * input_sampling_rate \/ output_sampling_rate;\n        const auto input_ptr = converted_inputs[i];\n        for(int j = 0; j < static_cast<int>(input_delay); ++j)\n        {\n          input_ptr[j - input_delay] = input_ptr[my_last_size + j - input_delay];\n        }\n      }\n      convert_array<ConversionTypes, DataTypeInput>(connections[i].second, connections[i].first, converted_inputs[i], size, connections[i].second->get_type());\n    }\n  }\n  \n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::prepare_outputs(std::size_t size)\n  {\n    for(unsigned int i = 0; i < nb_output_ports; ++i)\n    {\n      auto output_size = outputs_size[i];\n      if(output_size < size)\n      {\n        std::unique_ptr<DataTypeOutput[]> temp(new DataTypeOutput[static_cast<unsigned int>(output_delay + size + (alignment - 1) \/ sizeof(DataTypeOutput))]);\n        auto my_temp_ptr = reinterpret_cast<void*>(temp.get());\n        size_t space;\n        std::align(alignment, sizeof(DataTypeOutput), my_temp_ptr, space);\n        auto temp_ptr = reinterpret_cast<DataTypeOutput*>(my_temp_ptr);\n        if(output_size == 0)\n        {\n          for(unsigned int j = 0; j < output_delay; ++j)\n          {\n            temp_ptr[j] = default_output[i];\n          }\n        }\n        else\n        {\n          const auto output_ptr = outputs[i];\n          for(int j = 0; j < static_cast<int>(output_delay); ++j)\n          {\n            temp_ptr[j] = output_ptr[last_size + j - output_delay];\n          }\n        }\n        \n        outputs_delay[i] = std::move(temp);\n        outputs[i] = temp_ptr + output_delay;\n        outputs_size[i] = size;\n      }\n      else\n      {\n        const auto output_ptr = outputs[i];\n        for(int j = 0; j < static_cast<int>(output_delay); ++j)\n        {\n          output_ptr[j - output_delay] = output_ptr[last_size + j - output_delay];\n        }\n      }\n    }\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::full_setup()\n  {\n    \/\/ Reset input arrays\n    converted_inputs_delay = std::vector<std::unique_ptr<DataTypeInput[]> >(nb_input_ports);\n    converted_inputs.assign(nb_input_ports, nullptr);\n    converted_inputs_size.assign(nb_input_ports, 0);\n\n    \/\/ Reset output arrays\n    outputs_delay = std::vector<std::unique_ptr<DataTypeOutput[]> >(nb_output_ports);\n    outputs.assign(nb_output_ports, nullptr);\n    outputs_size.assign(nb_output_ports, 0);\n\n    Parent::full_setup();\n  }\n\n  template<typename DataType_, typename DataType__>\n  void TypedBaseFilter<DataType_, DataType__>::set_input_port(std::size_t input_port, BaseFilter* filter, std::size_t output_port)\n  {\n    Parent::set_input_port(input_port, filter, output_port);\n    converted_inputs_size[input_port] = 0;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Process.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\/system\/Process.hpp>\n\n#include <iostream>\n\n#include <boost\/bind.hpp>\n#include <boost\/foreach.hpp>\n\n#include <core\/Scope.hpp>\n#include <core\/Error.hpp>\n#include <core\/Log.hpp>\n#include <core\/BoostThread.hpp>\n\n#include <core\/PerformanceTimer.hpp>\n\n#include \"ChildProcess.hpp\"\n\nnamespace rstudio {\nnamespace core {\nnamespace system {\n\n\nError runProgram(const std::string& executable,\n                 const std::vector<std::string>& args,\n                 const std::string& input,\n                 const ProcessOptions& options,\n                 ProcessResult* pResult)\n{\n   SyncChildProcess child(executable, args, options);\n   return child.run(input, pResult);\n}\n\nError runCommand(const std::string& command,\n                 const ProcessOptions& options,\n                 ProcessResult* pResult)\n{\n   return runCommand(command, \"\", options, pResult);\n}\n\nError runCommand(const std::string& command,\n                 const std::string& input,\n                 const ProcessOptions& options,\n                 ProcessResult* pResult)\n{\n   SyncChildProcess child(command, options);\n   return child.run(input, pResult);\n}\n\n\nstruct ProcessSupervisor::Impl\n{\n   Impl() : isPolling(false) {}\n   bool isPolling;\n   std::vector<boost::shared_ptr<AsyncChildProcess> > children;\n};\n\nProcessSupervisor::ProcessSupervisor()\n   : pImpl_(new Impl())\n{\n}\n\nProcessSupervisor::~ProcessSupervisor()\n{\n}\n\nnamespace {\n\nError runChild(boost::shared_ptr<AsyncChildProcess> pChild,\n               std::vector<boost::shared_ptr<AsyncChildProcess> >* pChildren,\n               const ProcessCallbacks& callbacks)\n{\n   \/\/ run the child\n   Error error = pChild->run(callbacks);\n   if (error)\n      return error;\n\n   \/\/ add to the list of children\n   pChildren->push_back(pChild);\n\n   \/\/ success\n   return Success();\n}\n\n} \/\/ anonymous namespace\n\nError ProcessSupervisor::runProgram(const std::string& executable,\n                                    const std::vector<std::string>& args,\n                                    const ProcessOptions& options,\n                                    const ProcessCallbacks& callbacks)\n{\n   \/\/ create the child\n   boost::shared_ptr<AsyncChildProcess> pChild(\n                                 new AsyncChildProcess(executable,\n                                                       args,\n                                                       options));\n\n   \/\/ run the child\n   return runChild(pChild, &(pImpl_->children), callbacks);\n}\n\nError ProcessSupervisor::runCommand(const std::string& command,\n                                    const ProcessOptions& options,\n                                    const ProcessCallbacks& callbacks)\n{\n   \/\/ create the child\n   boost::shared_ptr<AsyncChildProcess> pChild(\n                                 new AsyncChildProcess(command, options));\n\n   \/\/ run the child\n   return runChild(pChild, &(pImpl_->children), callbacks);\n}\n\nnamespace {\n\n\/\/ class which implements all of the callbacks\nstruct ChildCallbacks\n{\n   ChildCallbacks(const std::string& input,\n                  const boost::function<void(const ProcessResult&)>& onCompleted,\n                  const boost::function<void(const Error&)>& onErrored)\n      : input(input), onCompleted(onCompleted), onErrored(onErrored)\n   {\n   }\n\n   void onStarted(ProcessOperations& operations)\n   {\n      if (!input.empty())\n      {\n         Error error = operations.writeToStdin(input, true);\n         if (error)\n         {\n            LOG_ERROR(error);\n\n            error = operations.terminate();\n            if (error)\n               LOG_ERROR(error);\n         }\n      }\n   }\n\n   void onStdout(ProcessOperations&, const std::string& output)\n   {\n      stdOut.append(output);\n   }\n\n   void onStderr(ProcessOperations&, const std::string& output)\n   {\n      stdErr.append(output);\n   }\n\n   void onError(ProcessOperations&, const Error& error)\n   {\n      onErrored(error);\n   }\n\n   void onConsoleOutputSnapshot(ProcessOperations&,\n                                const std::vector<char>& output)\n   {\n      consoleOutputSnapshot = output;\n   }\n\n   void onExit(int exitStatus)\n   {\n      ProcessResult result;\n      result.exitStatus = exitStatus;\n      result.stdOut = stdOut;\n      result.stdErr = stdErr;\n      onCompleted(result);\n   }\n\n   std::string input;\n   std::string stdOut;\n   std::string stdErr;\n   std::vector<char> consoleOutputSnapshot;\n   boost::function<void(const ProcessResult&)> onCompleted;\n   boost::function<void(const Error&)> onErrored;\n};\n\n} \/\/ anonymous namespace\n\n\nProcessCallbacks createProcessCallbacks(\n               const std::string& input,\n               const boost::function<void(const ProcessResult&)>& onCompleted,\n               const boost::function<void(const Error&)>& onError)\n{\n   \/\/ create a shared_ptr to the ChildCallbacks. it will stay alive\n   \/\/ as long as one of its members is referenced in a bind context\n   boost::shared_ptr<ChildCallbacks> pCC(new ChildCallbacks(input,\n                                                            onCompleted,\n                                                            onError));\n\n   \/\/ bind in the callbacks\n   using boost::bind;\n   ProcessCallbacks cb;\n   cb.onStarted = bind(&ChildCallbacks::onStarted, pCC, _1);\n   cb.onStdout = bind(&ChildCallbacks::onStdout, pCC, _1, _2);\n   cb.onStderr = bind(&ChildCallbacks::onStderr, pCC, _1, _2);\n   cb.onConsoleOutputSnapshot =\n         bind(&ChildCallbacks::onConsoleOutputSnapshot, pCC, _1, _2);\n   cb.onExit = bind(&ChildCallbacks::onExit, pCC, _1);\n   cb.onError = bind(&ChildCallbacks::onError, pCC, _1, _2);\n\n   \/\/ return it\n   return cb;\n}\n\n\nError ProcessSupervisor::runProgram(\n            const std::string& executable,\n            const std::vector<std::string>& args,\n            const std::string& input,\n            const ProcessOptions& options,\n            const boost::function<void(const ProcessResult&)>& onCompleted)\n{\n   \/\/ create proces callbacks\n   ProcessCallbacks cb = createProcessCallbacks(\n            input, onCompleted, boost::function<void(const Error&)>());\n\n   \/\/ run the child\n   return runProgram(executable, args, options, cb);\n}\n\nError ProcessSupervisor::runCommand(\n             const std::string& command,\n             const ProcessOptions& options,\n             const boost::function<void(const ProcessResult&)>& onCompleted)\n{\n   return runCommand(command, \"\", options, onCompleted);\n}\n\nError ProcessSupervisor::runCommand(\n             const std::string& command,\n             const std::string& input,\n             const ProcessOptions& options,\n             const boost::function<void(const ProcessResult&)>& onCompleted)\n{\n   \/\/ create proces callbacks\n   ProcessCallbacks cb = createProcessCallbacks(input, onCompleted);\n\n   \/\/ run the child\n   return runCommand(command, options, cb);\n}\n\n\n\nbool ProcessSupervisor::hasRunningChildren()\n{\n   return !pImpl_->children.empty();\n}\n\nbool ProcessSupervisor::poll()\n{\n   \/\/ bail immediately if we have no children\n   if (!hasRunningChildren())\n      return false;\n\n   \/\/ never allow re-entrancy (could occur if one of the output\n   \/\/ handlers called from poll executes a waitForMethod which\n   \/\/ results in additional polling during idle\/wait time)\n   if (pImpl_->isPolling)\n      return true;\n\n   \/\/ set isPolling then clear it on exit\n   pImpl_->isPolling = true;\n   scope::SetOnExit<bool> setOnExit(&pImpl_->isPolling, false);\n\n   \/\/ call poll on all of our children\n   std::for_each(pImpl_->children.begin(),\n                 pImpl_->children.end(),\n                 boost::bind(&AsyncChildProcess::poll, _1));\n\n   \/\/ remove any children who have exited from our list\n   pImpl_->children.erase(std::remove_if(\n                             pImpl_->children.begin(),\n                             pImpl_->children.end(),\n                             boost::bind(&AsyncChildProcess::exited, _1)),\n                          pImpl_->children.end());\n\n   \/\/ return status\n   return hasRunningChildren();\n}\n\nvoid ProcessSupervisor::terminateAll()\n{\n   \/\/ call terminate on all of our children\n   BOOST_FOREACH(boost::shared_ptr<AsyncChildProcess> pChild,\n                 pImpl_->children)\n   {\n      Error error = pChild->terminate();\n      if (error)\n         LOG_ERROR(error);\n   }\n}\n\nbool ProcessSupervisor::wait(\n      const boost::posix_time::time_duration& pollingInterval,\n      const boost::posix_time::time_duration& maxWait)\n{\n   boost::posix_time::ptime timeoutTime(boost::posix_time::not_a_date_time);\n   if (!maxWait.is_not_a_date_time())\n      timeoutTime = boost::get_system_time() + maxWait;\n\n   while (poll())\n   {\n      \/\/ wait the specified polling interval\n      boost::this_thread::sleep(pollingInterval);\n\n      \/\/ check for timeout if appropriate\n      if (!timeoutTime.is_not_a_date_time())\n      {\n         if (boost::get_system_time() > timeoutTime)\n            return false;\n      }\n   }\n\n   return true;\n}\n\n} \/\/ namespace system\n} \/\/ namespace core\n} \/\/ namespace rstudio\n\n\n<commit_msg>make a copy of child process vector before calling poll<commit_after>\/*\n * Process.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\/system\/Process.hpp>\n\n#include <iostream>\n\n#include <boost\/bind.hpp>\n#include <boost\/foreach.hpp>\n\n#include <core\/Scope.hpp>\n#include <core\/Error.hpp>\n#include <core\/Log.hpp>\n#include <core\/BoostThread.hpp>\n\n#include <core\/PerformanceTimer.hpp>\n\n#include \"ChildProcess.hpp\"\n\nnamespace rstudio {\nnamespace core {\nnamespace system {\n\n\nError runProgram(const std::string& executable,\n                 const std::vector<std::string>& args,\n                 const std::string& input,\n                 const ProcessOptions& options,\n                 ProcessResult* pResult)\n{\n   SyncChildProcess child(executable, args, options);\n   return child.run(input, pResult);\n}\n\nError runCommand(const std::string& command,\n                 const ProcessOptions& options,\n                 ProcessResult* pResult)\n{\n   return runCommand(command, \"\", options, pResult);\n}\n\nError runCommand(const std::string& command,\n                 const std::string& input,\n                 const ProcessOptions& options,\n                 ProcessResult* pResult)\n{\n   SyncChildProcess child(command, options);\n   return child.run(input, pResult);\n}\n\n\nstruct ProcessSupervisor::Impl\n{\n   Impl() : isPolling(false) {}\n   bool isPolling;\n   std::vector<boost::shared_ptr<AsyncChildProcess> > children;\n};\n\nProcessSupervisor::ProcessSupervisor()\n   : pImpl_(new Impl())\n{\n}\n\nProcessSupervisor::~ProcessSupervisor()\n{\n}\n\nnamespace {\n\nError runChild(boost::shared_ptr<AsyncChildProcess> pChild,\n               std::vector<boost::shared_ptr<AsyncChildProcess> >* pChildren,\n               const ProcessCallbacks& callbacks)\n{\n   \/\/ run the child\n   Error error = pChild->run(callbacks);\n   if (error)\n      return error;\n\n   \/\/ add to the list of children\n   pChildren->push_back(pChild);\n\n   \/\/ success\n   return Success();\n}\n\n} \/\/ anonymous namespace\n\nError ProcessSupervisor::runProgram(const std::string& executable,\n                                    const std::vector<std::string>& args,\n                                    const ProcessOptions& options,\n                                    const ProcessCallbacks& callbacks)\n{\n   \/\/ create the child\n   boost::shared_ptr<AsyncChildProcess> pChild(\n                                 new AsyncChildProcess(executable,\n                                                       args,\n                                                       options));\n\n   \/\/ run the child\n   return runChild(pChild, &(pImpl_->children), callbacks);\n}\n\nError ProcessSupervisor::runCommand(const std::string& command,\n                                    const ProcessOptions& options,\n                                    const ProcessCallbacks& callbacks)\n{\n   \/\/ create the child\n   boost::shared_ptr<AsyncChildProcess> pChild(\n                                 new AsyncChildProcess(command, options));\n\n   \/\/ run the child\n   return runChild(pChild, &(pImpl_->children), callbacks);\n}\n\nnamespace {\n\n\/\/ class which implements all of the callbacks\nstruct ChildCallbacks\n{\n   ChildCallbacks(const std::string& input,\n                  const boost::function<void(const ProcessResult&)>& onCompleted,\n                  const boost::function<void(const Error&)>& onErrored)\n      : input(input), onCompleted(onCompleted), onErrored(onErrored)\n   {\n   }\n\n   void onStarted(ProcessOperations& operations)\n   {\n      if (!input.empty())\n      {\n         Error error = operations.writeToStdin(input, true);\n         if (error)\n         {\n            LOG_ERROR(error);\n\n            error = operations.terminate();\n            if (error)\n               LOG_ERROR(error);\n         }\n      }\n   }\n\n   void onStdout(ProcessOperations&, const std::string& output)\n   {\n      stdOut.append(output);\n   }\n\n   void onStderr(ProcessOperations&, const std::string& output)\n   {\n      stdErr.append(output);\n   }\n\n   void onError(ProcessOperations&, const Error& error)\n   {\n      onErrored(error);\n   }\n\n   void onConsoleOutputSnapshot(ProcessOperations&,\n                                const std::vector<char>& output)\n   {\n      consoleOutputSnapshot = output;\n   }\n\n   void onExit(int exitStatus)\n   {\n      ProcessResult result;\n      result.exitStatus = exitStatus;\n      result.stdOut = stdOut;\n      result.stdErr = stdErr;\n      onCompleted(result);\n   }\n\n   std::string input;\n   std::string stdOut;\n   std::string stdErr;\n   std::vector<char> consoleOutputSnapshot;\n   boost::function<void(const ProcessResult&)> onCompleted;\n   boost::function<void(const Error&)> onErrored;\n};\n\n} \/\/ anonymous namespace\n\n\nProcessCallbacks createProcessCallbacks(\n               const std::string& input,\n               const boost::function<void(const ProcessResult&)>& onCompleted,\n               const boost::function<void(const Error&)>& onError)\n{\n   \/\/ create a shared_ptr to the ChildCallbacks. it will stay alive\n   \/\/ as long as one of its members is referenced in a bind context\n   boost::shared_ptr<ChildCallbacks> pCC(new ChildCallbacks(input,\n                                                            onCompleted,\n                                                            onError));\n\n   \/\/ bind in the callbacks\n   using boost::bind;\n   ProcessCallbacks cb;\n   cb.onStarted = bind(&ChildCallbacks::onStarted, pCC, _1);\n   cb.onStdout = bind(&ChildCallbacks::onStdout, pCC, _1, _2);\n   cb.onStderr = bind(&ChildCallbacks::onStderr, pCC, _1, _2);\n   cb.onConsoleOutputSnapshot =\n         bind(&ChildCallbacks::onConsoleOutputSnapshot, pCC, _1, _2);\n   cb.onExit = bind(&ChildCallbacks::onExit, pCC, _1);\n   cb.onError = bind(&ChildCallbacks::onError, pCC, _1, _2);\n\n   \/\/ return it\n   return cb;\n}\n\n\nError ProcessSupervisor::runProgram(\n            const std::string& executable,\n            const std::vector<std::string>& args,\n            const std::string& input,\n            const ProcessOptions& options,\n            const boost::function<void(const ProcessResult&)>& onCompleted)\n{\n   \/\/ create proces callbacks\n   ProcessCallbacks cb = createProcessCallbacks(\n            input, onCompleted, boost::function<void(const Error&)>());\n\n   \/\/ run the child\n   return runProgram(executable, args, options, cb);\n}\n\nError ProcessSupervisor::runCommand(\n             const std::string& command,\n             const ProcessOptions& options,\n             const boost::function<void(const ProcessResult&)>& onCompleted)\n{\n   return runCommand(command, \"\", options, onCompleted);\n}\n\nError ProcessSupervisor::runCommand(\n             const std::string& command,\n             const std::string& input,\n             const ProcessOptions& options,\n             const boost::function<void(const ProcessResult&)>& onCompleted)\n{\n   \/\/ create proces callbacks\n   ProcessCallbacks cb = createProcessCallbacks(input, onCompleted);\n\n   \/\/ run the child\n   return runCommand(command, options, cb);\n}\n\n\n\nbool ProcessSupervisor::hasRunningChildren()\n{\n   return !pImpl_->children.empty();\n}\n\nbool ProcessSupervisor::poll()\n{\n   \/\/ bail immediately if we have no children\n   if (!hasRunningChildren())\n      return false;\n\n   \/\/ never allow re-entrancy (could occur if one of the output\n   \/\/ handlers called from poll executes a waitForMethod which\n   \/\/ results in additional polling during idle\/wait time)\n   if (pImpl_->isPolling)\n      return true;\n\n   \/\/ set isPolling then clear it on exit\n   pImpl_->isPolling = true;\n   scope::SetOnExit<bool> setOnExit(&pImpl_->isPolling, false);\n\n   \/\/ call poll on all of our children via a copy of the std::vector that\n   \/\/ holds all of the children. we do this because 'poll' can end up\n   \/\/ executing R code (e.g. via onContinue) which can in term end up\n   \/\/ executing background tasks that result in a call to processSupervisor\n   \/\/ runProgram or runCommand. This would then result in a push_back on\n   \/\/ the children vector and if this requried a realloc would invalidate\n   \/\/ all of the iterators currently pointing into the container\n   std::vector<boost::shared_ptr<AsyncChildProcess> > children = pImpl_->children;\n   std::for_each(children.begin(),\n                 children.end(),\n                 boost::bind(&AsyncChildProcess::poll, _1));\n\n   \/\/ remove any children who have exited from our list. note that it's safe\n   \/\/ in this case to use pImpl_->children directly because the call to\n   \/\/ AsyncChildProcess::exited just checks a member variable rather than\n   \/\/ executing code that could cause re-entry\n   pImpl_->children.erase(std::remove_if(\n                             pImpl_->children.begin(),\n                             pImpl_->children.end(),\n                             boost::bind(&AsyncChildProcess::exited, _1)),\n                          pImpl_->children.end());\n\n   \/\/ return status\n   return hasRunningChildren();\n}\n\nvoid ProcessSupervisor::terminateAll()\n{\n   \/\/ call terminate on all of our children\n   BOOST_FOREACH(boost::shared_ptr<AsyncChildProcess> pChild,\n                 pImpl_->children)\n   {\n      Error error = pChild->terminate();\n      if (error)\n         LOG_ERROR(error);\n   }\n}\n\nbool ProcessSupervisor::wait(\n      const boost::posix_time::time_duration& pollingInterval,\n      const boost::posix_time::time_duration& maxWait)\n{\n   boost::posix_time::ptime timeoutTime(boost::posix_time::not_a_date_time);\n   if (!maxWait.is_not_a_date_time())\n      timeoutTime = boost::get_system_time() + maxWait;\n\n   while (poll())\n   {\n      \/\/ wait the specified polling interval\n      boost::this_thread::sleep(pollingInterval);\n\n      \/\/ check for timeout if appropriate\n      if (!timeoutTime.is_not_a_date_time())\n      {\n         if (boost::get_system_time() > timeoutTime)\n            return false;\n      }\n   }\n\n   return true;\n}\n\n} \/\/ namespace system\n} \/\/ namespace core\n} \/\/ namespace rstudio\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n\nint main()\n{\n    std::ifstream file(\"data.txt\");\n    std::string line;\n    \/\/ See: https:\/\/stackoverflow.com\/q\/7219062\/496459\n    \/\/ std::getline has no buffer-size limitation, per the standard.\n    while(std::getline(file, line))\n    {\n        std::cout << line << '\\n';\n    }\n\n    return 0;\n}\n\n<commit_msg>Include <string> for std::getline<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n\nint main()\n{\n    std::ifstream file(\"data.txt\");\n    std::string line;\n    \/\/ See: https:\/\/stackoverflow.com\/q\/7219062\/496459\n    \/\/ std::getline has no buffer-size limitation, per the standard.\n    while(std::getline(file, line))\n    {\n        std::cout << line << '\\n';\n    }\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          process.cpp\n* Purpose:       Implementation of class 'wxExProcess'\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 1998-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/regex.h>\n#include <wx\/tokenzr.h>\n#include <wx\/txtstrm.h> \/\/ for wxTextInputStream\n#include <wx\/extension\/configdlg.h>\n#include <wx\/extension\/frame.h>\n#include <wx\/extension\/log.h>\n#include <wx\/extension\/util.h>\n#include <wx\/extension\/report\/process.h>\n#include <wx\/extension\/report\/defs.h>\n#include <wx\/extension\/report\/frame.h>\n#include <wx\/extension\/report\/listitem.h>\n#include <wx\/extension\/report\/listview.h>\n\nBEGIN_EVENT_TABLE(wxExProcess, wxProcess)\n  EVT_TIMER(-1, wxExProcess::OnTimer)\nEND_EVENT_TABLE()\n\nwxString wxExProcess::m_Command;\nwxString wxExProcess::m_WorkingDirKey = _(\"Process folder\");\n\nwxExProcess::wxExProcess(\n  wxExFrameWithHistory* frame,\n  const wxString& command)\n  : wxProcess(NULL, -1)\n  , m_Frame(frame)\n  , m_ListView(NULL)\n  , m_Timer(this)\n{\n  if (!command.empty())\n  {\n    m_Command = command;\n  }\n\n  Redirect();\n}\n\nbool wxExProcess::CheckInput()\n{\n  if (m_ListView == NULL)\n  {\n    return false;\n  }\n\n  bool hasInput = false;\n\n  \/\/ This assumes that the output is always line buffered.\n  wxString line;\n\n  if (IsInputAvailable())\n  {\n    wxTextInputStream tis(*GetInputStream());\n    line << tis.ReadLine();\n    hasInput = true;\n  }\n  else if (IsErrorAvailable())\n  {\n    wxTextInputStream tis(*GetErrorStream());\n    line << tis.ReadLine();\n    hasInput = true;\n  }\n\n  if (hasInput && !line.empty())\n  {\n    wxString lineno;\n    wxString path;\n\n    \/\/ Check on error in php script output.\n    const wxRegEx regex(\".*in \\\\(.*\\\\) on line \\\\(.*\\\\)\", wxRE_ADVANCED);\n\n    if (regex.Matches(line))\n    {\n      size_t start, len;\n\n      if (regex.GetMatch(&start, &len, 1))\n      {\n        path = line.substr(start, len);\n      }\n\n      if (regex.GetMatch(&start, &len, 2))\n      {\n        lineno = line.substr(start, len);\n      }\n    }\n    else\n    {\n      \/\/ Check on error in gcc output (and some others).\n      wxStringTokenizer tkz(line, ':');\n      path = tkz.GetNextToken();\n\n      if (tkz.HasMoreTokens())\n      {\n        const wxString number = tkz.GetNextToken();\n        long val;\n        if (number.ToLong(&val)) lineno = number;\n      }\n    }\n\n    wxFileName fn(path);\n\n    fn.Normalize();\n\n    if (fn.FileExists())\n    {\n      wxExListItem item(m_ListView, fn);\n      item.Insert();\n      item.SetItem(_(\"Line\"), line);\n      item.SetItem(_(\"Line No\"), lineno);\n    }\n    else\n    {\n      m_ListView->InsertItem(m_ListView->GetItemCount(), line, -1);\n    }\n\n    \/\/ If nothing selected, then ensure last line is visible.\n    \/\/ Otherwise you are busy inspecting some line, and\n    \/\/ it would be irritating to get it out of view.\n    if (m_ListView->GetSelectedItemCount() == 0)\n    {\n      m_ListView->EnsureVisible(m_ListView->GetItemCount() - 1);\n    }\n\n#if wxUSE_STATUSBAR\n    m_ListView->UpdateStatusBar();\n#endif\n  }\n\n  return hasInput;\n}\n\nint wxExProcess::ConfigDialog(\n  wxWindow* parent,\n  const wxString& title)\n{\n  std::vector<wxExConfigItem> v;\n\n  v.push_back(wxExConfigItem(\n    _(\"Process\"), \n    CONFIG_COMBOBOX, \n    wxEmptyString));\n\n  v.push_back(wxExConfigItem(\n    m_WorkingDirKey, \n    CONFIG_COMBOBOXDIR, \n    wxEmptyString,\n    true,\n    1000));\n\n  const auto result = wxExConfigDialog(parent,\n    v,\n    title).ShowModal();\n\n  if (result == wxID_OK)\n  {\n    m_Command = wxExConfigFirstOf(_(\"Process\"));\n  }\n\n  return result;\n}\n\nlong wxExProcess::Execute()\n{\n  if (m_Command.empty())\n  {\n    if (ConfigDialog(m_ListView) == wxID_CANCEL)\n    {\n      return 0;\n    }\n  }\n\n  wxString cwd;\n  const wxString dir = wxExConfigFirstOf(m_WorkingDirKey);\n\n  if (!dir.empty())\n  {\n    cwd = wxGetCwd();\n    if (!wxSetWorkingDirectory(dir))\n    {\n      wxLogError(_(\"Cannot set working directory\"));\n      return 0;\n    }\n  }\n\n  m_ListView = m_Frame->Activate(wxExListViewStandard::LIST_PROCESS);\n\n  if (m_ListView == NULL)\n  {\n    \/\/ Only show a message, and continue,\n    \/\/ easier for testing.\n    wxLogMessage(_(\"No listview to collect output\"));\n  }\n\n  const long pid = wxExecute(m_Command, wxEXEC_ASYNC, this);\n\n  if (pid > 0)\n  {\n    SetPid(pid);\n\n#if wxUSE_STATUSBAR\n    wxExFrame::StatusText(m_Command);\n#endif\n    wxExLog::Get()->Log(m_Command);\n\n    m_Timer.Start(1000); \/\/ each 1000 milliseconds\n  }\n  else\n  {\n    wxLogError(_(\"Cannot execute\") + \": \" + m_Command);\n  }\n\n  if (!cwd.empty())\n  {\n    wxSetWorkingDirectory(cwd);\n  }\n\n  return pid;\n}\n\nbool wxExProcess::IsRunning() const\n{\n  if (GetPid() < 0)\n  {\n    return false;\n  }\n\n  return Exists(GetPid());\n}\n\nwxKillError wxExProcess::Kill(wxSignal sig)\n{\n  if (!IsRunning())\n  {\n    return wxKILL_NO_PROCESS;\n  }\n\n  m_Timer.Stop();\n  \n#if wxUSE_STATUSBAR\n  wxExFrame::StatusText(_(\"Stopped\"));\n#endif\n\n  DeletePendingEvents();\n\n  delete this;\n\n  return wxProcess::Kill(GetPid(), sig);\n}\n\nvoid wxExProcess::OnTerminate(\n  int WXUNUSED(pid), \n  int WXUNUSED(status))\n{\n  m_Timer.Stop();\n\n  \/\/ Collect remaining input.\n  while (CheckInput())\n  {\n    \/\/ Do nothing.\n  }\n\n#if wxUSE_STATUSBAR\n  wxExFrame::StatusText(_(\"Ready\"));\n#endif\n\n  wxCommandEvent event(wxEVT_COMMAND_MENU_SELECTED, ID_TERMINATED_PROCESS);\n  wxPostEvent(wxTheApp->GetTopWindow(), event);\n}\n\nvoid wxExProcess::OnTimer(wxTimerEvent& event)\n{\n  while (CheckInput())\n  {\n    \/\/ Do nothing.\n  }\n}\n<commit_msg>minor update<commit_after>\/******************************************************************************\\\n* File:          process.cpp\n* Purpose:       Implementation of class 'wxExProcess'\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 1998-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/regex.h>\n#include <wx\/tokenzr.h>\n#include <wx\/txtstrm.h> \/\/ for wxTextInputStream\n#include <wx\/extension\/configdlg.h>\n#include <wx\/extension\/log.h>\n#include <wx\/extension\/util.h> \/\/ for wxExConfigFirstOf\n#include <wx\/extension\/report\/process.h>\n#include <wx\/extension\/report\/defs.h>\n#include <wx\/extension\/report\/frame.h>\n#include <wx\/extension\/report\/listitem.h>\n#include <wx\/extension\/report\/listview.h>\n\nBEGIN_EVENT_TABLE(wxExProcess, wxProcess)\n  EVT_TIMER(-1, wxExProcess::OnTimer)\nEND_EVENT_TABLE()\n\nwxString wxExProcess::m_Command;\nwxString wxExProcess::m_WorkingDirKey = _(\"Process folder\");\n\nwxExProcess::wxExProcess(\n  wxExFrameWithHistory* frame,\n  const wxString& command)\n  : wxProcess(NULL, -1)\n  , m_Frame(frame)\n  , m_ListView(NULL)\n  , m_Timer(this)\n{\n  if (!command.empty())\n  {\n    m_Command = command;\n  }\n\n  Redirect();\n}\n\nbool wxExProcess::CheckInput()\n{\n  if (m_ListView == NULL)\n  {\n    return false;\n  }\n\n  bool hasInput = false;\n\n  \/\/ This assumes that the output is always line buffered.\n  wxString line;\n\n  if (IsInputAvailable())\n  {\n    wxTextInputStream tis(*GetInputStream());\n    line << tis.ReadLine();\n    hasInput = true;\n  }\n  else if (IsErrorAvailable())\n  {\n    wxTextInputStream tis(*GetErrorStream());\n    line << tis.ReadLine();\n    hasInput = true;\n  }\n\n  if (hasInput && !line.empty())\n  {\n    wxString lineno;\n    wxString path;\n\n    \/\/ Check on error in php script output.\n    const wxRegEx regex(\".*in \\\\(.*\\\\) on line \\\\(.*\\\\)\", wxRE_ADVANCED);\n\n    if (regex.Matches(line))\n    {\n      size_t start, len;\n\n      if (regex.GetMatch(&start, &len, 1))\n      {\n        path = line.substr(start, len);\n      }\n\n      if (regex.GetMatch(&start, &len, 2))\n      {\n        lineno = line.substr(start, len);\n      }\n    }\n    else\n    {\n      \/\/ Check on error in gcc output (and some others).\n      wxStringTokenizer tkz(line, ':');\n      path = tkz.GetNextToken();\n\n      if (tkz.HasMoreTokens())\n      {\n        const wxString number = tkz.GetNextToken();\n        long val;\n        if (number.ToLong(&val)) lineno = number;\n      }\n    }\n\n    wxFileName fn(path);\n\n    fn.Normalize();\n\n    if (fn.FileExists())\n    {\n      wxExListItem item(m_ListView, fn);\n      item.Insert();\n      item.SetItem(_(\"Line\"), line);\n      item.SetItem(_(\"Line No\"), lineno);\n    }\n    else\n    {\n      m_ListView->InsertItem(m_ListView->GetItemCount(), line, -1);\n    }\n\n    \/\/ If nothing selected, then ensure last line is visible.\n    \/\/ Otherwise you are busy inspecting some line, and\n    \/\/ it would be irritating to get it out of view.\n    if (m_ListView->GetSelectedItemCount() == 0)\n    {\n      m_ListView->EnsureVisible(m_ListView->GetItemCount() - 1);\n    }\n\n#if wxUSE_STATUSBAR\n    m_ListView->UpdateStatusBar();\n#endif\n  }\n\n  return hasInput;\n}\n\nint wxExProcess::ConfigDialog(\n  wxWindow* parent,\n  const wxString& title)\n{\n  std::vector<wxExConfigItem> v;\n\n  v.push_back(wxExConfigItem(\n    _(\"Process\"), \n    CONFIG_COMBOBOX, \n    wxEmptyString));\n\n  v.push_back(wxExConfigItem(\n    m_WorkingDirKey, \n    CONFIG_COMBOBOXDIR, \n    wxEmptyString,\n    true,\n    1000));\n\n  const auto result = wxExConfigDialog(parent,\n    v,\n    title).ShowModal();\n\n  if (result == wxID_OK)\n  {\n    m_Command = wxExConfigFirstOf(_(\"Process\"));\n  }\n\n  return result;\n}\n\nlong wxExProcess::Execute()\n{\n  if (m_Command.empty())\n  {\n    if (ConfigDialog(m_ListView) == wxID_CANCEL)\n    {\n      return 0;\n    }\n  }\n\n  wxString cwd;\n  const wxString dir = wxExConfigFirstOf(m_WorkingDirKey);\n\n  if (!dir.empty())\n  {\n    cwd = wxGetCwd();\n    if (!wxSetWorkingDirectory(dir))\n    {\n      wxLogError(_(\"Cannot set working directory\"));\n      return 0;\n    }\n  }\n\n  m_ListView = m_Frame->Activate(wxExListViewStandard::LIST_PROCESS);\n\n  if (m_ListView == NULL)\n  {\n    \/\/ Only show a message, and continue,\n    \/\/ easier for testing.\n    wxLogMessage(_(\"No listview to collect output\"));\n  }\n\n  const long pid = wxExecute(m_Command, wxEXEC_ASYNC, this);\n\n  if (pid > 0)\n  {\n    SetPid(pid);\n\n#if wxUSE_STATUSBAR\n    wxExFrame::StatusText(m_Command);\n#endif\n    wxExLog::Get()->Log(m_Command);\n\n    m_Timer.Start(1000); \/\/ each 1000 milliseconds\n  }\n  else\n  {\n    wxLogError(_(\"Cannot execute\") + \": \" + m_Command);\n  }\n\n  if (!cwd.empty())\n  {\n    wxSetWorkingDirectory(cwd);\n  }\n\n  return pid;\n}\n\nbool wxExProcess::IsRunning() const\n{\n  if (GetPid() < 0)\n  {\n    return false;\n  }\n\n  return Exists(GetPid());\n}\n\nwxKillError wxExProcess::Kill(wxSignal sig)\n{\n  if (!IsRunning())\n  {\n    return wxKILL_NO_PROCESS;\n  }\n\n  m_Timer.Stop();\n  \n#if wxUSE_STATUSBAR\n  wxExFrame::StatusText(_(\"Stopped\"));\n#endif\n\n  DeletePendingEvents();\n\n  delete this;\n\n  return wxProcess::Kill(GetPid(), sig);\n}\n\nvoid wxExProcess::OnTerminate(\n  int WXUNUSED(pid), \n  int WXUNUSED(status))\n{\n  m_Timer.Stop();\n\n  \/\/ Collect remaining input.\n  while (CheckInput())\n  {\n    \/\/ Do nothing.\n  }\n\n#if wxUSE_STATUSBAR\n  wxExFrame::StatusText(_(\"Ready\"));\n#endif\n\n  wxCommandEvent event(wxEVT_COMMAND_MENU_SELECTED, ID_TERMINATED_PROCESS);\n  wxPostEvent(wxTheApp->GetTopWindow(), event);\n}\n\nvoid wxExProcess::OnTimer(wxTimerEvent& event)\n{\n  while (CheckInput())\n  {\n    \/\/ Do nothing.\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          process.cpp\n* Purpose:       Implementation of class 'wxExProcessWithListView' and support classes\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 1998-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/tokenzr.h>\n#include <wx\/txtstrm.h> \/\/ for wxTextInputStream\n#include <wx\/extension\/app.h>\n#include <wx\/extension\/configdialog.h>\n#include <wx\/extension\/report\/process.h>\n#include <wx\/extension\/report\/defs.h>\n#include <wx\/extension\/report\/listitem.h>\n#include <wx\/extension\/report\/listview.h>\n\nBEGIN_EVENT_TABLE(wxExProcessWithListView, wxProcess)\n  EVT_TIMER(-1, wxExProcessWithListView::OnTimer)\nEND_EVENT_TABLE()\n\nwxString wxExProcessWithListView::m_Command = \"\";\n\nwxExProcessWithListView::wxExProcessWithListView(\n  wxExListViewFile* listview,\n  const wxString& command)\n  : wxProcess(listview, -1)\n  , m_Owner(listview)\n  , m_Timer(this)\n{\n  if (!command.empty())\n  {\n    m_Command = command;\n  }\n\n  Redirect();\n}\n\nbool wxExProcessWithListView::CheckInput()\n{\n  bool hasInput = false;\n\n  \/\/ This assumes that the output is always line buffered.\n  wxString line;\n\n  if (IsInputAvailable())\n  {\n    wxTextInputStream tis(*GetInputStream());\n    line << tis.ReadLine();\n    hasInput = true;\n  }\n  else if (IsErrorAvailable())\n  {\n    wxTextInputStream tis(*GetErrorStream());\n    line << tis.ReadLine();\n    hasInput = true;\n  }\n\n  if (hasInput && !line.empty())\n  {\n    wxString lineno;\n    wxString path;\n\n    \/\/ Check on error in php script output.\n    wxRegEx regex(\".*in \\\\(.*\\\\) on line \\\\(.*\\\\)\");\n\n    if (regex.Matches(line))\n    {\n      size_t start, len;\n\n      if (regex.GetMatch(&start, &len, 1))\n      {\n        path = line.substr(start, len);\n      }\n\n      if (regex.GetMatch(&start, &len, 2))\n      {\n        lineno = line.substr(start, len);\n      }\n    }\n    else\n    {\n      \/\/ Check on error in gcc output (and some others).\n      wxStringTokenizer tkz(line, ':');\n      path = tkz.GetNextToken();\n\n      if (tkz.HasMoreTokens())\n      {\n        const wxString number = tkz.GetNextToken();\n        long val;\n        if (number.ToLong(&val)) lineno = number;\n      }\n    }\n\n    wxFileName fn(path);\n    fn.Normalize();\n\n    if (fn.FileExists())\n    {\n      wxExListItemWithFileName item(m_Owner, fn.GetFullPath());\n      item.Insert();\n      item.SetColumnText(_(\"Line\"), line);\n      item.SetColumnText(_(\"Line No\"), lineno);\n    }\n    else\n    {\n      wxExListItemWithFileName item(m_Owner, wxEmptyString); \/\/ wxExListItem gives incorrect image\n      item.Insert();\n      item.SetColumnText(_(\"Line\"), line);\n    }\n\n    \/\/ If nothing selected, then ensure last line is visible.\n    \/\/ Otherwise you are busy inspecting some line, and\n    \/\/ it would be irritating to get it out of view.\n    if (m_Owner->GetSelectedItemCount() == 0)\n    {\n      m_Owner->EnsureVisible(m_Owner->GetItemCount() - 1);\n    }\n\n    m_Owner->UpdateStatusBar();\n  }\n\n  return hasInput;\n}\n\nint wxExProcessWithListView::ConfigDialog()\n{\n  std::vector<wxExConfigItem> v;\n  v.push_back(wxExConfigItem(_(\"Process\"), CONFIG_COMBOBOX, wxEmptyString, true));\n  v.push_back(wxExConfigItem(_(\"In folder\"), CONFIG_COMBOBOXDIR, wxEmptyString, true));\n\n  const int result = wxExConfigDialog(NULL,\n    wxExApp::GetConfig(),\n    v,\n    _(\"Select Process\")).ShowModal();\n\n  if (result == wxID_OK)\n  {\n    wxSetWorkingDirectory(wxExApp::GetConfig(_(\"In folder\")));\n    m_Command = wxExApp::GetConfig(_(\"Process\"));\n  }\n\n  return result;\n}\n\nlong wxExProcessWithListView::Execute()\n{\n  long pid;\n\n  if ((pid = wxExecute(m_Command, wxEXEC_ASYNC, this)) > 0)\n  {\n    SetPid(pid);\n\n    wxExFrame::StatusText(m_Command);\n    wxExApp::Log(_(\"Running process\") + \": \" + m_Command);\n\n    m_Timer.Start(100); \/\/ each 100 milliseconds\n  }\n  else\n  {\n    wxLogError(_(\"Cannot run process\") + \": \" + m_Command);\n  }\n\n  return pid;\n}\n\nwxKillError wxExProcessWithListView::Kill(wxSignal sig)\n{\n  m_Timer.Stop();\n  \n  wxExFrame::StatusText(_(\"Stopped\"));\n\n  return wxProcess::Kill(GetPid(), sig);\n}\n\nvoid wxExProcessWithListView::OnTerminate(int WXUNUSED(pid), int WXUNUSED(status))\n{\n  m_Timer.Stop();\n\n  \/\/ Collect remaining input.\n  while (CheckInput())\n  {\n    \/\/ Do nothing.\n  }\n\n  wxExFrame::StatusText(_(\"Ready\"));\n\n  wxCommandEvent event(wxEVT_COMMAND_MENU_SELECTED, ID_TERMINATED_PROCESS);\n  wxPostEvent(m_Owner, event);\n}\n\nvoid wxExProcessWithListView::OnTimer(wxTimerEvent& event)\n{\n  while (CheckInput())\n  {\n    \/\/ Do nothing.\n  }\n}\n<commit_msg>updated header<commit_after>\/******************************************************************************\\\n* File:          process.cpp\n* Purpose:       Implementation of class 'wxExProcessWithListView'\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 1998-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/tokenzr.h>\n#include <wx\/txtstrm.h> \/\/ for wxTextInputStream\n#include <wx\/extension\/app.h>\n#include <wx\/extension\/configdialog.h>\n#include <wx\/extension\/report\/process.h>\n#include <wx\/extension\/report\/defs.h>\n#include <wx\/extension\/report\/listitem.h>\n#include <wx\/extension\/report\/listview.h>\n\nBEGIN_EVENT_TABLE(wxExProcessWithListView, wxProcess)\n  EVT_TIMER(-1, wxExProcessWithListView::OnTimer)\nEND_EVENT_TABLE()\n\nwxString wxExProcessWithListView::m_Command = \"\";\n\nwxExProcessWithListView::wxExProcessWithListView(\n  wxExListViewFile* listview,\n  const wxString& command)\n  : wxProcess(listview, -1)\n  , m_Owner(listview)\n  , m_Timer(this)\n{\n  if (!command.empty())\n  {\n    m_Command = command;\n  }\n\n  Redirect();\n}\n\nbool wxExProcessWithListView::CheckInput()\n{\n  bool hasInput = false;\n\n  \/\/ This assumes that the output is always line buffered.\n  wxString line;\n\n  if (IsInputAvailable())\n  {\n    wxTextInputStream tis(*GetInputStream());\n    line << tis.ReadLine();\n    hasInput = true;\n  }\n  else if (IsErrorAvailable())\n  {\n    wxTextInputStream tis(*GetErrorStream());\n    line << tis.ReadLine();\n    hasInput = true;\n  }\n\n  if (hasInput && !line.empty())\n  {\n    wxString lineno;\n    wxString path;\n\n    \/\/ Check on error in php script output.\n    wxRegEx regex(\".*in \\\\(.*\\\\) on line \\\\(.*\\\\)\");\n\n    if (regex.Matches(line))\n    {\n      size_t start, len;\n\n      if (regex.GetMatch(&start, &len, 1))\n      {\n        path = line.substr(start, len);\n      }\n\n      if (regex.GetMatch(&start, &len, 2))\n      {\n        lineno = line.substr(start, len);\n      }\n    }\n    else\n    {\n      \/\/ Check on error in gcc output (and some others).\n      wxStringTokenizer tkz(line, ':');\n      path = tkz.GetNextToken();\n\n      if (tkz.HasMoreTokens())\n      {\n        const wxString number = tkz.GetNextToken();\n        long val;\n        if (number.ToLong(&val)) lineno = number;\n      }\n    }\n\n    wxFileName fn(path);\n    fn.Normalize();\n\n    if (fn.FileExists())\n    {\n      wxExListItemWithFileName item(m_Owner, fn.GetFullPath());\n      item.Insert();\n      item.SetColumnText(_(\"Line\"), line);\n      item.SetColumnText(_(\"Line No\"), lineno);\n    }\n    else\n    {\n      wxExListItemWithFileName item(m_Owner, wxEmptyString); \/\/ wxExListItem gives incorrect image\n      item.Insert();\n      item.SetColumnText(_(\"Line\"), line);\n    }\n\n    \/\/ If nothing selected, then ensure last line is visible.\n    \/\/ Otherwise you are busy inspecting some line, and\n    \/\/ it would be irritating to get it out of view.\n    if (m_Owner->GetSelectedItemCount() == 0)\n    {\n      m_Owner->EnsureVisible(m_Owner->GetItemCount() - 1);\n    }\n\n    m_Owner->UpdateStatusBar();\n  }\n\n  return hasInput;\n}\n\nint wxExProcessWithListView::ConfigDialog()\n{\n  std::vector<wxExConfigItem> v;\n  v.push_back(wxExConfigItem(_(\"Process\"), CONFIG_COMBOBOX, wxEmptyString, true));\n  v.push_back(wxExConfigItem(_(\"In folder\"), CONFIG_COMBOBOXDIR, wxEmptyString, true));\n\n  const int result = wxExConfigDialog(NULL,\n    wxExApp::GetConfig(),\n    v,\n    _(\"Select Process\")).ShowModal();\n\n  if (result == wxID_OK)\n  {\n    wxSetWorkingDirectory(wxExApp::GetConfig(_(\"In folder\")));\n    m_Command = wxExApp::GetConfig(_(\"Process\"));\n  }\n\n  return result;\n}\n\nlong wxExProcessWithListView::Execute()\n{\n  long pid;\n\n  if ((pid = wxExecute(m_Command, wxEXEC_ASYNC, this)) > 0)\n  {\n    SetPid(pid);\n\n    wxExFrame::StatusText(m_Command);\n    wxExApp::Log(_(\"Running process\") + \": \" + m_Command);\n\n    m_Timer.Start(100); \/\/ each 100 milliseconds\n  }\n  else\n  {\n    wxLogError(_(\"Cannot run process\") + \": \" + m_Command);\n  }\n\n  return pid;\n}\n\nwxKillError wxExProcessWithListView::Kill(wxSignal sig)\n{\n  m_Timer.Stop();\n  \n  wxExFrame::StatusText(_(\"Stopped\"));\n\n  return wxProcess::Kill(GetPid(), sig);\n}\n\nvoid wxExProcessWithListView::OnTerminate(int WXUNUSED(pid), int WXUNUSED(status))\n{\n  m_Timer.Stop();\n\n  \/\/ Collect remaining input.\n  while (CheckInput())\n  {\n    \/\/ Do nothing.\n  }\n\n  wxExFrame::StatusText(_(\"Ready\"));\n\n  wxCommandEvent event(wxEVT_COMMAND_MENU_SELECTED, ID_TERMINATED_PROCESS);\n  wxPostEvent(m_Owner, event);\n}\n\nvoid wxExProcessWithListView::OnTimer(wxTimerEvent& event)\n{\n  while (CheckInput())\n  {\n    \/\/ Do nothing.\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Sorting integers - bubble method.\n *\/\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nvoid bubblesort(vector<int> &v)\n{\n\tint i, change;\n\t\n\tdo\n\t{\n\t\tchange = 0;\n\t\ti = v.size() - 1;\n\t\t\n\t\tdo\n\t\t{\n\t\t\tif (v[i] < v[--i])\n\t\t\t{\n\t\t\t\tswap(v[i], v[i + 1]);\n\t\t\t\tchange = 1;\n\t\t\t}\n\t\t}\n\t\twhile (i != 0);\n\t}\n\twhile (change != 0);\n}\n\nint main(int argc, char const *argv[])\n{\n\tint count, i, n;\n\tvector<int> v;\n\n\tsrand(time(NULL));\n\n\tcout << \"How many: \";\n\tcin >> count;\n\t\n\tfor (i = 0; i < count; ++i)\n\t{\n\t\tv.push_back(rand() % count);\n\t}\n\n\tcout << endl << \"Before: \";\n\tfor (i = 0; i < v.size(); ++i)\n\t{\n\t\tcout << v[i] << \" \";\n\t}\n\tcout << endl;\n\n\tbubblesort(v);\n\n\tcout << endl << endl << \"After: \";\n\tfor (i = 0; i < v.size(); ++i)\n\t{\n\t\tcout << v[i] << \" \";\n\t}\n\tcout << endl;\n\n\treturn 0;\n}<commit_msg>refactoring<commit_after>\/**\n * Sorting integers - bubble method.\n *\/\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nvoid bubblesort(vector<int> &v)\n{\n\tint i, change;\n\t\n\tdo\n\t{\n\t\tchange = 0;\n\t\ti = v.size() - 1;\n\t\t\n\t\tdo\n\t\t{\n\t\t\tif (v[i] < v[--i])\n\t\t\t{\n\t\t\t\tswap(v[i], v[i + 1]);\n\t\t\t\tchange = 1;\n\t\t\t}\n\t\t}\n\t\twhile (i != 0);\n\t}\n\twhile (change != 0);\n}\n\nint main(int argc, char const *argv[])\n{\n\tint count, i, n;\n\tvector<int> v;\n\n\tsrand(time(0));\n\n\tcout << \"How many: \";\n\tcin >> count;\n\t\n\tfor (i = 0; i < count; ++i)\n\t{\n\t\tv.push_back(rand() % count);\n\t}\n\n\tcout << endl << \"Before: \";\n\tfor (i = 0; i < v.size(); ++i)\n\t{\n\t\tcout << v[i] << \" \";\n\t}\n\tcout << endl;\n\n\tbubblesort(v);\n\n\tcout << endl << endl << \"After: \";\n\tfor (i = 0; i < v.size(); ++i)\n\t{\n\t\tcout << v[i] << \" \";\n\t}\n\tcout << endl;\n\n\treturn 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ soil.C\n\/\/ \n\/\/ Copyright 1996-2001 Per Abrahamsen and Sren Hansen\n\/\/ Copyright 2000-2001 KVL.\n\/\/\n\/\/ This file is part of Daisy.\n\/\/ \n\/\/ Daisy is free software; you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Lesser 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\/\/ Daisy is distributed in the hope that it 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 Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Lesser Public License\n\/\/ along with Daisy; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\n\n#include \"soil.h\"\n#include \"alist.h\"\n#include \"syntax.h\"\n#include \"mathlib.h\"\n#include \"submodel.h\"\n#include \"log.h\"\n#include \"check.h\"\n#include \"plf.h\"\n#include \"tmpstream.h\"\n#include <iomanip>\n#include <iostream>\n\nstruct Soil::Implementation\n{\n  \/\/ Layers.\n  struct Layer\n  {\n    \/\/ Content.\n    const double end;\n    Horizon& horizon;\n\n    \/\/ Simulation.\n    void output (Log& log) const\n    { output_derived (horizon, \"horizon\", log); }\n\n    \/\/ Create and Destroy.\n    static void load_syntax (Syntax& syntax, AttributeList& alist)\n    { \n      alist.add (\"description\", \"\\\nA location and content of a soil layer.\");\n      syntax.add (\"end\", \"cm\", Check::negative (), Syntax::Const,\n\t\t  \"End point of this layer (a negative number).\");\n      syntax.add (\"horizon\", Librarian<Horizon>::library (), \n\t\t  \"Soil properties of this layer.\");\n      syntax.order (\"end\", \"horizon\");\n    }\n    Layer (const AttributeList& al)\n      : end (al.number (\"end\")),\n\thorizon (Librarian<Horizon>::create (al.alist (\"horizon\")))\n    { }\n    ~Layer ()\n    { delete &horizon; }\n  };\n  const vector<Layer*> layers;\n\n  \/\/ Parameters\n  const double MaxRootingDepth;\n  const double dispersivity;\n\n  bool has_attribute (const string& name) const\n  { \n    bool missing = false;\n    for (unsigned int i = 0; i < layers.size (); i++)\n      if (!layers[i]->horizon.has_attribute (name))\n\tmissing = true;\n    return !missing;\n  }\n  \n  \/\/ Create and Destroy.\n  Implementation (const AttributeList& al)\n    : layers (map_construct<Layer> (al.alist_sequence (\"horizons\"))),\n      MaxRootingDepth (al.number (\"MaxRootingDepth\")),\n      dispersivity (al.number (\"dispersivity\"))\n  { }\n  ~Implementation ()\n  { sequence_delete (layers.begin (), layers.end ()); }\n};\n\ndouble \nSoil::K (int i, double h, double h_ice, double T) const\n{ \n  static struct ViscosityFactor : public PLF\n  {\n    ViscosityFactor ()\n    {\n      add ( 0.0, 1002.0 \/ 1786.0);\n      add ( 5.0, 1002.0 \/ 1519.0);\n      add (10.0, 1002.0 \/ 1307.0);\n      add (15.0, 1002.0 \/ 1139.0);\n      add (20.0, 1002.0 \/ 1002.0);\n      add (25.0, 1002.0 \/  890.0);\n      add (30.0, 1002.0 \/  798.0);\n      add (35.0, 1002.0 \/  719.0);\n      add (40.0, 1002.0 \/  658.0);\n    }\n  } viscosity_factor;\n\n  const double T_factor = viscosity_factor (T);\n  if (h < h_ice)\n    return horizon_[i]->hydraulic.K (h) * T_factor; \n  else\n    return horizon_[i]->hydraulic.K (h_ice) * T_factor; \n}\n\ndouble Soil::Theta (int i, double h, double h_ice) const\n{ \n  if (h < h_ice)\n    return horizon_[i]->hydraulic.Theta (h);\n  else\n    return horizon_[i]->hydraulic.Theta (h_ice);\n}\n\ndouble\nSoil::Cw2 (int i, double h) const\n{ \n  const double answer = horizon_[i]->hydraulic.Cw2 (h); \n  if (answer > 0.0)\n    return answer;\n  \/\/ We divide with this.\n  return 1.0e-8;\n}\n\ndouble \nSoil::dispersivity (int) const\n{ return impl.dispersivity; }\n\nbool\nSoil::has_attribute (const string& name) const\n{ return impl.has_attribute (name); }\n\nvoid\nSoil::output (Log& log) const\n{ output_vector (impl.layers, \"horizons\", log); }\n\ndouble\nSoil::MaxRootingDepth () const\n{\n  return max (-impl.MaxRootingDepth, z (size () - 1));\n}\n\ndouble\nSoil::end_of_first_horizon () const\n{ \n  daisy_assert (impl.layers.size () > 0);\n  return impl.layers[0]->end;\n}\n\nbool \nSoil::check (int som_size, Treelog& err) const\n{\n  bool ok = Geometry::check (err);\n\n  if (som_size >= 0)\n    {\n      Treelog::Open nest (err, \"horizons\");\n      for (unsigned int i = 0; i < impl.layers.size (); i++)\n\t{\n\t  const Horizon& horizon = impl.layers[i]->horizon;\n\t  Treelog::Open nest (err, horizon.name);\n\t  const int f_size = horizon.SOM_fractions ().size ();\n\t  if (f_size > 0 && f_size != som_size)\n\t    {\n\t      Treelog::Open nest (err, \"SOM_fractions\");\n\t      TmpStream tmp;\n\t      tmp () << \"Need \" << som_size << \" fractions, got \" << f_size;\n\t      err.error (tmp.str ());\n\t      ok = false;\n\t    }\n\t  const int n_size = horizon.SOM_C_per_N ().size ();\n\t  if (n_size != som_size)\n\t    {\n\t      Treelog::Open nest (err, \"SOM_C_per_N\");\n\t      TmpStream tmp;\n\t      tmp () << \"Need \" << som_size << \" C\/N numbers, got \" << n_size;\n\t      err.error (tmp.str ());\n\t      ok = false;\n\t    }\n\t}\n    }\n  return ok;\n}\n\nstatic bool\ncheck_alist (const AttributeList& al, Treelog& err)\n{\n  bool ok = true;\n\n  const vector<AttributeList*>& layers = al.alist_sequence (\"horizons\");\n\n  if (layers.size () < 1U)\n    {\n      err.entry (\"You need at least one horizon\");\n      ok = false;\n    }\n  double last = 0.0;\n\n  for (unsigned int i = 0; i < layers.size (); i++)\n    {\n      double end = layers[i]->number (\"end\");\n      if (end >= last)\n\t{\n\t  err.entry (\"Horizon endpoints must be monotonically decreasing\");\n\t  ok = false;\n\t  break;\n\t}\n      last = end;\n    }\n\n  if (ok && al.check (\"zplus\"))\n    {\n      \/\/ This check is only meaningful if zplus and layers are ok.\n      const vector<double> zplus = al.number_sequence (\"zplus\");\n  \n      if (last != zplus[zplus.size() - 1])\n\t{\n\t  err.entry (\"The last horizon must end the same place as the \"\n\t\t     \"last interval\");\n\t  ok = false;\n\t}\n    }\n  return ok;\n}  \n\nvoid \nSoil::make_table (int i)\n{\n  cout << \"pF   Theta   Cw2           K           (depth \" << z (i) << \").\\n\";\n  for (double pF = 0.00; pF <= 5.0; pF += 0.01)\n    {\n      const double h = pF2h (pF);\n      cout << setw (4) << setprecision (3) << pF << \" \"\n\t   << setw (6) << setprecision (5) << Theta (i, h, 0.0) << \" \"\n\t   << setw (12) << setprecision (11) << Cw2 (i, h) * 100.0 << \" \"\n\t   << setw (12) << setprecision (11) << K (i, h, 0.0, 20.0) \/ 3.6e5\n\t   << \"\\n\";\n    }\n}\n\nvoid\nSoil::load_syntax (Syntax& syntax, AttributeList& alist)\n{ \n  Geometry::load_syntax (syntax, alist);\n  syntax.add_check (check_alist);\n  alist.add (\"submodel\", \"Soil\");\n  alist.add (\"description\", \"\\\nThe soil component provides the numeric and physical properties of the soil.\");\n  syntax.add_submodule_sequence (\"horizons\", Syntax::State, \"\\\nLayered description of the soil properties.\",\n\t\t\t\t Implementation::Layer::load_syntax);\n  syntax.add (\"MaxRootingDepth\", \"cm\", Check::positive (), Syntax::Const,\n\t      \"Depth at the end of the root zone (a positive number).\");\n  syntax.add (\"dispersivity\", \"cm\", Check::positive (), \n\t      Syntax::Const, \"Dispersion length.\");\n  alist.add (\"dispersivity\", 5.0);\n}\n  \nSoil::Soil (const AttributeList& al)\n  : Geometry (al),\n    impl (*new Implementation (al))\n{ }\n\nvoid\nSoil::initialize (const Groundwater& groundwater, Treelog& msg)\n{\n  Treelog::Open nest (msg, \"Soil\");\n\n  const vector<Implementation::Layer*>::const_iterator begin\n    = impl.layers.begin ();\n  const vector<Implementation::Layer*>::const_iterator end \n    = impl.layers.end ();\n  daisy_assert (begin != end);\n  vector<Implementation::Layer*>::const_iterator layer;\n\n  \/\/ Initialize geometry.\n  vector<double> fixed;\n  {\n    Treelog::Open nest (msg, \"Horizons\");\n    double last = 0.0;\n    for (layer = begin; layer != end; layer++)\n      {\n\tdouble current = (*layer)->end;\n\tdaisy_assert (current < last);\n\n\tconst bool top_soil = (layer == begin);\n\t(*layer)->horizon.initialize (top_soil, msg);\n\n\t\/\/ We always have a layer limit at 1 m.\n\tif (last > -100.0 && current < -100.0)\n\t  fixed.push_back (-100.0);\n      \n\tlast = current;\n\tfixed.push_back (last);\n      }\n  }\n  initialize_zplus (groundwater, fixed, -impl.MaxRootingDepth, msg);\n\n  \/\/ Initialize horizons.\n  layer = begin;\n  for (unsigned int i = 0; i < size (); i++)\n    {\n      if (zplus (i) < (*layer)->end)\n\t{\n\t  layer++;\n\t  daisy_assert (layer != end);\n\t}\n      horizon_.push_back (&((*layer)->horizon));\n    }\n}\n\nSoil::~Soil ()\n{ delete &impl; }\n\nstatic Submodel::Register \nsoil_submodel (\"Soil\", Soil::load_syntax);\n<commit_msg>sync<commit_after>\/\/ soil.C\n\/\/ \n\/\/ Copyright 1996-2001 Per Abrahamsen and Sren Hansen\n\/\/ Copyright 2000-2001 KVL.\n\/\/\n\/\/ This file is part of Daisy.\n\/\/ \n\/\/ Daisy is free software; you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Lesser 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\/\/ Daisy is distributed in the hope that it 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 Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Lesser Public License\n\/\/ along with Daisy; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\n\n#include \"soil.h\"\n#include \"alist.h\"\n#include \"syntax.h\"\n#include \"mathlib.h\"\n#include \"submodel.h\"\n#include \"log.h\"\n#include \"check.h\"\n#include \"plf.h\"\n#include \"tmpstream.h\"\n#if !(defined (__BORLANDC__) && __BORLANDC__ < 0x0550)\n#include <iomanip>\n#endif\n#include <iostream>\n\nstruct Soil::Implementation\n{\n  \/\/ Layers.\n  struct Layer\n  {\n    \/\/ Content.\n    const double end;\n    Horizon& horizon;\n\n    \/\/ Simulation.\n    void output (Log& log) const\n    { output_derived (horizon, \"horizon\", log); }\n\n    \/\/ Create and Destroy.\n    static void load_syntax (Syntax& syntax, AttributeList& alist)\n    { \n      alist.add (\"description\", \"\\\nA location and content of a soil layer.\");\n      syntax.add (\"end\", \"cm\", Check::negative (), Syntax::Const,\n\t\t  \"End point of this layer (a negative number).\");\n      syntax.add (\"horizon\", Librarian<Horizon>::library (), \n\t\t  \"Soil properties of this layer.\");\n      syntax.order (\"end\", \"horizon\");\n    }\n    Layer (const AttributeList& al)\n      : end (al.number (\"end\")),\n\thorizon (Librarian<Horizon>::create (al.alist (\"horizon\")))\n    { }\n    ~Layer ()\n    { delete &horizon; }\n  };\n  const vector<Layer*> layers;\n\n  \/\/ Parameters\n  const double MaxRootingDepth;\n  const double dispersivity;\n\n  bool has_attribute (const string& name) const\n  { \n    bool missing = false;\n    for (unsigned int i = 0; i < layers.size (); i++)\n      if (!layers[i]->horizon.has_attribute (name))\n\tmissing = true;\n    return !missing;\n  }\n  \n  \/\/ Create and Destroy.\n  Implementation (const AttributeList& al)\n    : layers (map_construct<Layer> (al.alist_sequence (\"horizons\"))),\n      MaxRootingDepth (al.number (\"MaxRootingDepth\")),\n      dispersivity (al.number (\"dispersivity\"))\n  { }\n  ~Implementation ()\n  { sequence_delete (layers.begin (), layers.end ()); }\n};\n\ndouble \nSoil::K (int i, double h, double h_ice, double T) const\n{ \n  static struct ViscosityFactor : public PLF\n  {\n    ViscosityFactor ()\n    {\n      add ( 0.0, 1002.0 \/ 1786.0);\n      add ( 5.0, 1002.0 \/ 1519.0);\n      add (10.0, 1002.0 \/ 1307.0);\n      add (15.0, 1002.0 \/ 1139.0);\n      add (20.0, 1002.0 \/ 1002.0);\n      add (25.0, 1002.0 \/  890.0);\n      add (30.0, 1002.0 \/  798.0);\n      add (35.0, 1002.0 \/  719.0);\n      add (40.0, 1002.0 \/  658.0);\n    }\n  } viscosity_factor;\n\n  const double T_factor = viscosity_factor (T);\n  if (h < h_ice)\n    return horizon_[i]->hydraulic.K (h) * T_factor; \n  else\n    return horizon_[i]->hydraulic.K (h_ice) * T_factor; \n}\n\ndouble Soil::Theta (int i, double h, double h_ice) const\n{ \n  if (h < h_ice)\n    return horizon_[i]->hydraulic.Theta (h);\n  else\n    return horizon_[i]->hydraulic.Theta (h_ice);\n}\n\ndouble\nSoil::Cw2 (int i, double h) const\n{ \n  const double answer = horizon_[i]->hydraulic.Cw2 (h); \n  if (answer > 0.0)\n    return answer;\n  \/\/ We divide with this.\n  return 1.0e-8;\n}\n\ndouble \nSoil::dispersivity (int) const\n{ return impl.dispersivity; }\n\nbool\nSoil::has_attribute (const string& name) const\n{ return impl.has_attribute (name); }\n\nvoid\nSoil::output (Log& log) const\n{ output_vector (impl.layers, \"horizons\", log); }\n\ndouble\nSoil::MaxRootingDepth () const\n{\n  return max (-impl.MaxRootingDepth, z (size () - 1));\n}\n\ndouble\nSoil::end_of_first_horizon () const\n{ \n  daisy_assert (impl.layers.size () > 0);\n  return impl.layers[0]->end;\n}\n\nbool \nSoil::check (int som_size, Treelog& err) const\n{\n  bool ok = Geometry::check (err);\n\n  if (som_size >= 0)\n    {\n      Treelog::Open nest (err, \"horizons\");\n      for (unsigned int i = 0; i < impl.layers.size (); i++)\n\t{\n\t  const Horizon& horizon = impl.layers[i]->horizon;\n\t  Treelog::Open nest (err, horizon.name);\n\t  const int f_size = horizon.SOM_fractions ().size ();\n\t  if (f_size > 0 && f_size != som_size)\n\t    {\n\t      Treelog::Open nest (err, \"SOM_fractions\");\n\t      TmpStream tmp;\n\t      tmp () << \"Need \" << som_size << \" fractions, got \" << f_size;\n\t      err.error (tmp.str ());\n\t      ok = false;\n\t    }\n\t  const int n_size = horizon.SOM_C_per_N ().size ();\n\t  if (n_size != som_size)\n\t    {\n\t      Treelog::Open nest (err, \"SOM_C_per_N\");\n\t      TmpStream tmp;\n\t      tmp () << \"Need \" << som_size << \" C\/N numbers, got \" << n_size;\n\t      err.error (tmp.str ());\n\t      ok = false;\n\t    }\n\t}\n    }\n  return ok;\n}\n\nstatic bool\ncheck_alist (const AttributeList& al, Treelog& err)\n{\n  bool ok = true;\n\n  const vector<AttributeList*>& layers = al.alist_sequence (\"horizons\");\n\n  if (layers.size () < 1U)\n    {\n      err.entry (\"You need at least one horizon\");\n      ok = false;\n    }\n  double last = 0.0;\n\n  for (unsigned int i = 0; i < layers.size (); i++)\n    {\n      double end = layers[i]->number (\"end\");\n      if (end >= last)\n\t{\n\t  err.entry (\"Horizon endpoints must be monotonically decreasing\");\n\t  ok = false;\n\t  break;\n\t}\n      last = end;\n    }\n\n  if (ok && al.check (\"zplus\"))\n    {\n      \/\/ This check is only meaningful if zplus and layers are ok.\n      const vector<double> zplus = al.number_sequence (\"zplus\");\n  \n      if (last != zplus[zplus.size() - 1])\n\t{\n\t  err.entry (\"The last horizon must end the same place as the \"\n\t\t     \"last interval\");\n\t  ok = false;\n\t}\n    }\n  return ok;\n}  \n\nvoid \nSoil::make_table (int i)\n{\n  cout << \"pF   Theta   Cw2           K           (depth \" << z (i) << \").\\n\";\n#if !(defined (__BORLANDC__) && __BORLANDC__ < 0x0550)\n  for (double pF = 0.00; pF <= 5.0; pF += 0.01)\n    {\n      const double h = pF2h (pF);\n      cout << setw (4) << setprecision (3) << pF << \" \"\n\t   << setw (6) << setprecision (5) << Theta (i, h, 0.0) << \" \"\n\t   << setw (12) << setprecision (11) << Cw2 (i, h) * 100.0 << \" \"\n\t   << setw (12) << setprecision (11) << K (i, h, 0.0, 20.0) \/ 3.6e5\n\t   << \"\\n\";\n    }\n#endif\n}\n\nvoid\nSoil::load_syntax (Syntax& syntax, AttributeList& alist)\n{ \n  Geometry::load_syntax (syntax, alist);\n  syntax.add_check (check_alist);\n  alist.add (\"submodel\", \"Soil\");\n  alist.add (\"description\", \"\\\nThe soil component provides the numeric and physical properties of the soil.\");\n  syntax.add_submodule_sequence (\"horizons\", Syntax::State, \"\\\nLayered description of the soil properties.\",\n\t\t\t\t Implementation::Layer::load_syntax);\n  syntax.add (\"MaxRootingDepth\", \"cm\", Check::positive (), Syntax::Const,\n\t      \"Depth at the end of the root zone (a positive number).\");\n  syntax.add (\"dispersivity\", \"cm\", Check::positive (), \n\t      Syntax::Const, \"Dispersion length.\");\n  alist.add (\"dispersivity\", 5.0);\n}\n  \nSoil::Soil (const AttributeList& al)\n  : Geometry (al),\n    impl (*new Implementation (al))\n{ }\n\nvoid\nSoil::initialize (const Groundwater& groundwater, Treelog& msg)\n{\n  Treelog::Open nest (msg, \"Soil\");\n\n  const vector<Implementation::Layer*>::const_iterator begin\n    = impl.layers.begin ();\n  const vector<Implementation::Layer*>::const_iterator end \n    = impl.layers.end ();\n  daisy_assert (begin != end);\n  vector<Implementation::Layer*>::const_iterator layer;\n\n  \/\/ Initialize geometry.\n  vector<double> fixed;\n  {\n    Treelog::Open nest (msg, \"Horizons\");\n    double last = 0.0;\n    for (layer = begin; layer != end; layer++)\n      {\n\tdouble current = (*layer)->end;\n\tdaisy_assert (current < last);\n\n\tconst bool top_soil = (layer == begin);\n\t(*layer)->horizon.initialize (top_soil, msg);\n\n\t\/\/ We always have a layer limit at 1 m.\n\tif (last > -100.0 && current < -100.0)\n\t  fixed.push_back (-100.0);\n      \n\tlast = current;\n\tfixed.push_back (last);\n      }\n  }\n  initialize_zplus (groundwater, fixed, -impl.MaxRootingDepth, msg);\n\n  \/\/ Initialize horizons.\n  layer = begin;\n  for (unsigned int i = 0; i < size (); i++)\n    {\n      if (zplus (i) < (*layer)->end)\n\t{\n\t  layer++;\n\t  daisy_assert (layer != end);\n\t}\n      horizon_.push_back (&((*layer)->horizon));\n    }\n}\n\nSoil::~Soil ()\n{ delete &impl; }\n\nstatic Submodel::Register \nsoil_submodel (\"Soil\", Soil::load_syntax);\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************************************************\r\n**  \r\n* @copyright (c) 2013-2100, ChengDu Duyer Technology Co., LTD. All Right Reserved.\r\n*\r\n*************************************************************************************\/\r\n\/**\r\n* @file\t\tg_fileinputstream.cpp\r\n* @version     \r\n* @brief      \r\n* @author   ylh\r\n* @date     2014-07-11\r\n* @note \r\n*\r\n*  1. 2014-07-11 ylh Created this file\r\n* \r\n*\/\r\n\r\n#include <g_fileinputstream.h>\r\n#include <g_private_define.h>\r\n\r\nusing namespace std;\r\nusing namespace GCommon;\r\n\r\n\r\n\r\nFileInputStream::FileInputStream(shared_ptr<GFile> file)\r\n\t: m_file(file)\r\n{\r\n\tif (m_file == NULL)\r\n\t{\r\n\t\tthrow invalid_argument(EXCEPTION_DESCRIPTION(\"invalid_argument\"));\r\n\t}\r\n}\r\n\r\nFileInputStream::FileInputStream(const string filepath)\r\n\t: m_file((shared_ptr<GFile>(new GFile(filepath.c_str()))))\r\n{\r\n\tif (m_file->open(G_OPEN_READ) == G_NO)\r\n\t{\r\n\t\tthrow ios_base::failure(EXCEPTION_DESCRIPTION(\"ios_base::failure\"));\r\n\t}\r\n}\r\n\r\nFileInputStream::~FileInputStream()\r\n{\r\n}\r\n\r\nGInt32 FileInputStream::available() throw(std::ios_base::failure)\r\n{\r\n\t\/\/ TODO: GFile\r\n\treturn 0;\r\n}\r\n\r\nvoid FileInputStream::close() throw(std::ios_base::failure)\r\n{\r\n\t\/\/ m_file->close();\r\n\t\/\/ do nothing\r\n}\r\n\r\nGInt32 FileInputStream::read() throw(std::ios_base::failure, std::logic_error)\r\n{\r\n\tGInt8 pBuffer[1] = {0};\r\n\treturn  this->read(pBuffer, 1);\r\n}\r\n\r\nGInt32 FileInputStream::read(GInt8 * pBuffer, GInt32 iBufferLen, GInt32 iOffset, GInt32 iLen) throw(std::ios_base::failure, std::logic_error)\r\n{\r\n\tif (!pBuffer)\r\n\t{\r\n\t\tthrow invalid_argument(EXCEPTION_DESCRIPTION(\"invalid_argument\"));\r\n\t}\r\n\telse if (iOffset < 0 || iLen < 0 ||iBufferLen < iOffset + iLen)\r\n\t{\r\n\t\tthrow out_of_range(EXCEPTION_DESCRIPTION(\"out_of_range\"));\r\n\t}\r\n\telse if (iLen == 0)\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tGInt32 ret = m_file->read(pBuffer + iOffset, iLen);\r\n\tif (ret < 0)\r\n\t{\r\n\t\tthrow ios_base::failure(EXCEPTION_DESCRIPTION(\"ios_base::failure\"));\r\n\t}\r\n\tif (ret == 0)\r\n\t{\r\n\t\tret = -1;\r\n\t}\r\n\t\r\n\treturn ret;\r\n}\r\n\r\nGInt64 FileInputStream::skip(GInt64 lNum) throw(std::ios_base::failure)\r\n{\r\n\tif (lNum == 0)\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\tif (lNum  < 0)\r\n\t{\r\n\t\tthrow out_of_range(\"\");\r\n\t}\r\n\r\n\t\/\/ TODO: GFile\r\n\tif (m_file->seek(lNum, G_SEEK_CUR))\r\n\t{\r\n\t\tthrow ios_base::failure(EXCEPTION_DESCRIPTION(\"ios_base::failure\"));\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nshared_ptr<GFile> FileInputStream::GetFile()\r\n{\r\n\treturn m_file;\r\n}\r\n<commit_msg>Update g_fileinputstream.cpp<commit_after>\/************************************************************************************\r\n**  \r\n* @copyright (c) 2013-2100, ChengDu Duyer Technology Co., LTD. All Right Reserved.\r\n*\r\n*************************************************************************************\/\r\n\/**\r\n* @file\t\tg_fileinputstream.cpp\r\n* @version     \r\n* @brief      \r\n* @author   ylh\r\n* @date     2014-07-11\r\n* @note \r\n*\r\n*  1. 2014-07-11 ylh Created this file\r\n* \r\n*\/\r\n\r\n#include <g_fileinputstream.h>\r\n#include <g_private_define.h>\r\n\r\nusing namespace std;\r\nusing namespace GCommon;\r\n\r\n\r\n\r\nFileInputStream::FileInputStream(shared_ptr<GFile> file)\r\n\t: m_file(file)\r\n{\r\n\tif (m_file == NULL)\r\n\t{\r\n\t\tthrow invalid_argument(EXCEPTION_DESCRIPTION(\"invalid_argument\"));\r\n\t}\r\n}\r\n\r\nFileInputStream::FileInputStream(const string filepath)\r\n\t: m_file((shared_ptr<GFile>(new GFile(filepath.c_str()))))\r\n{\r\n\tif (m_file->open(G_OPEN_READ) == G_NO)\r\n\t{\r\n\t\tthrow ios_base::failure(EXCEPTION_DESCRIPTION(\"ios_base::failure\"));\r\n\t}\r\n}\r\n\r\nFileInputStream::~FileInputStream()\r\n{\r\n}\r\n\r\nGInt32 FileInputStream::available() throw(std::ios_base::failure)\r\n{\r\n\t\/\/ TODO: GFile\r\n\treturn 0;\r\n}\r\n\r\nvoid FileInputStream::close() throw(std::ios_base::failure)\r\n{\r\n\t\/\/ m_file->close();\r\n\t\/\/ do nothing\r\n}\r\n\r\nGInt32 FileInputStream::read() throw(std::ios_base::failure, std::logic_error)\r\n{\r\n\tGInt8 pBuffer[1] = {0};\r\n\treturn  this->read(pBuffer, 1);\r\n}\r\n\r\nGInt32 FileInputStream::read(GInt8 * pBuffer, GInt32 iBufferLen, GInt32 iOffset, GInt32 iLen) throw(std::ios_base::failure, std::logic_error)\r\n{\r\n\tif (!pBuffer)\r\n\t{\r\n\t\tthrow invalid_argument(EXCEPTION_DESCRIPTION(\"invalid_argument\"));\r\n\t}\r\n\telse if (iOffset < 0 || iLen < 0 ||iBufferLen < iOffset + iLen)\r\n\t{\r\n\t\tthrow out_of_range(EXCEPTION_DESCRIPTION(\"out_of_range\"));\r\n\t}\r\n\telse if (iLen == 0)\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tGInt32 ret = m_file->read(pBuffer + iOffset, iLen);\r\n\tif (ret < 0)\r\n\t{\r\n\t\tthrow ios_base::failure(EXCEPTION_DESCRIPTION(\"ios_base::failure\"));\r\n\t}\r\n\tif (ret == 0)\r\n\t{\r\n\t\tret = -1;\r\n\t}\r\n\t\r\n\treturn ret;\r\n}\r\n\r\nGInt64 FileInputStream::skip(GInt64 lNum) throw(std::ios_base::failure)\r\n{\r\n\tif (lNum == 0)\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\tif (lNum  < 0)\r\n\t{\r\n\t\tthrow out_of_range(\"\");\r\n\t}\r\n\r\n\t\/\/ TODO: not complete\r\n\tif (m_file->seek(lNum, G_SEEK_CUR))\r\n\t{\r\n\t\tthrow ios_base::failure(EXCEPTION_DESCRIPTION(\"ios_base::failure\"));\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nshared_ptr<GFile> FileInputStream::GetFile()\r\n{\r\n\treturn m_file;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file\n\/\/\/ \\ingroup tutorial_dataframe\n\/\/\/ This tutorial illustrates how to express the H1 analysis with a RDataFrame.\n\/\/\/\n\/\/\/ \\macro_code\n\/\/\/ \\macro_image\n\/\/\/\n\/\/\/ \\date December 2016\n\/\/\/ \\author Axel Naumann, Danilo Piparo (CERN)\n\nauto Select = [](ROOT::RDataFrame &dataFrame) {\n   using Farray_t = ROOT::VecOps::RVec<float>;\n   using Iarray_t = ROOT::VecOps::RVec<int>;\n\n   auto ret = dataFrame.Filter(\"TMath::Abs(md0_d - 1.8646) < 0.04\")\n                 .Filter(\"ptds_d > 2.5\")\n                 .Filter(\"TMath::Abs(etads_d) < 1.5\")\n                 .Filter([](int ik, int ipi, Iarray_t& nhitrp) { return nhitrp[ik - 1] * nhitrp[ipi - 1] > 1; },\n                         {\"ik\", \"ipi\", \"nhitrp\"})\n                 .Filter([](int ik, Farray_t& rstart, Farray_t& rend) { return rend[ik - 1] - rstart[ik - 1] > 22; },\n                         {\"ik\", \"rstart\", \"rend\"})\n                 .Filter([](int ipi, Farray_t& rstart, Farray_t& rend) { return rend[ipi - 1] - rstart[ipi - 1] > 22; },\n                         {\"ipi\", \"rstart\", \"rend\"})\n                 .Filter([](int ik, Farray_t& nlhk) { return nlhk[ik - 1] > 0.1; }, {\"ik\", \"nlhk\"})\n                 .Filter([](int ipi, Farray_t& nlhpi) { return nlhpi[ipi - 1] > 0.1; }, {\"ipi\", \"nlhpi\"})\n                 .Filter([](int ipis, Farray_t& nlhpi) { return nlhpi[ipis - 1] > 0.1; }, {\"ipis\", \"nlhpi\"})\n                 .Filter(\"njets >= 1\");\n\n   return ret;\n};\n\nconst Double_t dxbin = (0.17 - 0.13) \/ 40; \/\/ Bin-width\n\nDouble_t fdm5(Double_t *xx, Double_t *par)\n{\n   Double_t x = xx[0];\n   if (x <= 0.13957)\n      return 0;\n   Double_t xp3 = (x - par[3]) * (x - par[3]);\n   Double_t res =\n      dxbin * (par[0] * pow(x - 0.13957, par[1]) + par[2] \/ 2.5066 \/ par[4] * exp(-xp3 \/ 2 \/ par[4] \/ par[4]));\n   return res;\n}\n\nDouble_t fdm2(Double_t *xx, Double_t *par)\n{\n   static const Double_t sigma = 0.0012;\n   Double_t x = xx[0];\n   if (x <= 0.13957)\n      return 0;\n   Double_t xp3 = (x - 0.1454) * (x - 0.1454);\n   Double_t res = dxbin * (par[0] * pow(x - 0.13957, 0.25) + par[1] \/ 2.5066 \/ sigma * exp(-xp3 \/ 2 \/ sigma \/ sigma));\n   return res;\n}\n\nvoid FitAndPlotHdmd(TH1 &hdmd)\n{\n   \/\/ create the canvas for the h1analysis fit\n   gStyle->SetOptFit();\n   auto c1 = new TCanvas(\"c1\", \"h1analysis analysis\", 10, 10, 800, 600);\n   hdmd.GetXaxis()->SetTitle(\"m_{K#pi#pi} - m_{K#pi}[GeV\/c^{2}]\");\n   hdmd.GetXaxis()->SetTitleOffset(1.4);\n\n   \/\/ fit histogram hdmd with function f5 using the loglikelihood option\n   auto f5 = new TF1(\"f5\", fdm5, 0.139, 0.17, 5);\n   f5->SetParameters(1000000, .25, 2000, .1454, .001);\n   hdmd.Fit(\"f5\", \"lr\");\n\n   hdmd.DrawClone();\n}\n\nvoid FitAndPlotH2(TH2 &h2)\n{\n   \/\/ create the canvas for tau d0\n   auto c2 = new TCanvas(\"c2\", \"tauD0\", 100, 100, 800, 600);\n\n   c2->SetGrid();\n   c2->SetBottomMargin(0.15);\n\n   \/\/ Project slices of 2-d histogram h2 along X , then fit each slice\n   \/\/ with function f2 and make a histogram for each fit parameter\n   \/\/ Note that the generated histograms are added to the list of objects\n   \/\/ in the current directory.\n   auto f2 = new TF1(\"f2\", fdm2, 0.139, 0.17, 2);\n   f2->SetParameters(10000, 10);\n   h2.FitSlicesX(f2, 0, -1, 1, \"qln\");\n\n   \/\/ See TH2::FitSlicesX documentation\n   auto h2_1 = (TH1D *)gDirectory->Get(\"h2_1\");\n   h2_1->GetXaxis()->SetTitle(\"#tau [ps]\");\n   h2_1->SetMarkerStyle(21);\n   h2_1->DrawClone();\n   c2->Update();\n\n   auto line = new TLine(0, 0, 0, c2->GetUymax());\n   line->Draw();\n}\n\nvoid df101_h1Analysis()\n{\n   TChain chain(\"h42\");\n   chain.Add(\"http:\/\/root.cern.ch\/files\/h1\/dstarmb.root\");\n   chain.Add(\"http:\/\/root.cern.ch\/files\/h1\/dstarp1a.root\");\n   chain.Add(\"http:\/\/root.cern.ch\/files\/h1\/dstarp1b.root\");\n   chain.Add(\"http:\/\/root.cern.ch\/files\/h1\/dstarp2.root\");\n\n   ROOT::EnableImplicitMT(4);\n\n   ROOT::RDataFrame dataFrame(chain);\n   auto selected = Select(dataFrame);\n   auto hdmdARP = selected.Histo1D({\"hdmd\", \"Dm_d\", 40, 0.13, 0.17}, \"dm_d\");\n   auto selectedAddedBranch = selected.Define(\"h2_y\", \"rpd0_t \/ 0.029979f * 1.8646f \/ ptd0_d\");\n   auto h2ARP = selectedAddedBranch.Histo2D({\"h2\", \"ptD0 vs Dm_d\", 30, 0.135, 0.165, 30, -3, 6}, \"dm_d\", \"h2_y\");\n\n   FitAndPlotHdmd(*hdmdARP);\n   FitAndPlotH2(*h2ARP);\n}\n<commit_msg>put back the \\notebook directive as it is not the blocking factor<commit_after>\/\/\/ \\file\n\/\/\/ \\ingroup tutorial_dataframe\n\/\/\/ \\notebook\n\/\/\/ This tutorial illustrates how to express the H1 analysis with a RDataFrame.\n\/\/\/\n\/\/\/ \\macro_code\n\/\/\/ \\macro_image\n\/\/\/\n\/\/\/ \\date December 2016\n\/\/\/ \\author Axel Naumann, Danilo Piparo (CERN)\n\nauto Select = [](ROOT::RDataFrame &dataFrame) {\n   using Farray_t = ROOT::VecOps::RVec<float>;\n   using Iarray_t = ROOT::VecOps::RVec<int>;\n\n   auto ret = dataFrame.Filter(\"TMath::Abs(md0_d - 1.8646) < 0.04\")\n                 .Filter(\"ptds_d > 2.5\")\n                 .Filter(\"TMath::Abs(etads_d) < 1.5\")\n                 .Filter([](int ik, int ipi, Iarray_t& nhitrp) { return nhitrp[ik - 1] * nhitrp[ipi - 1] > 1; },\n                         {\"ik\", \"ipi\", \"nhitrp\"})\n                 .Filter([](int ik, Farray_t& rstart, Farray_t& rend) { return rend[ik - 1] - rstart[ik - 1] > 22; },\n                         {\"ik\", \"rstart\", \"rend\"})\n                 .Filter([](int ipi, Farray_t& rstart, Farray_t& rend) { return rend[ipi - 1] - rstart[ipi - 1] > 22; },\n                         {\"ipi\", \"rstart\", \"rend\"})\n                 .Filter([](int ik, Farray_t& nlhk) { return nlhk[ik - 1] > 0.1; }, {\"ik\", \"nlhk\"})\n                 .Filter([](int ipi, Farray_t& nlhpi) { return nlhpi[ipi - 1] > 0.1; }, {\"ipi\", \"nlhpi\"})\n                 .Filter([](int ipis, Farray_t& nlhpi) { return nlhpi[ipis - 1] > 0.1; }, {\"ipis\", \"nlhpi\"})\n                 .Filter(\"njets >= 1\");\n\n   return ret;\n};\n\nconst Double_t dxbin = (0.17 - 0.13) \/ 40; \/\/ Bin-width\n\nDouble_t fdm5(Double_t *xx, Double_t *par)\n{\n   Double_t x = xx[0];\n   if (x <= 0.13957)\n      return 0;\n   Double_t xp3 = (x - par[3]) * (x - par[3]);\n   Double_t res =\n      dxbin * (par[0] * pow(x - 0.13957, par[1]) + par[2] \/ 2.5066 \/ par[4] * exp(-xp3 \/ 2 \/ par[4] \/ par[4]));\n   return res;\n}\n\nDouble_t fdm2(Double_t *xx, Double_t *par)\n{\n   static const Double_t sigma = 0.0012;\n   Double_t x = xx[0];\n   if (x <= 0.13957)\n      return 0;\n   Double_t xp3 = (x - 0.1454) * (x - 0.1454);\n   Double_t res = dxbin * (par[0] * pow(x - 0.13957, 0.25) + par[1] \/ 2.5066 \/ sigma * exp(-xp3 \/ 2 \/ sigma \/ sigma));\n   return res;\n}\n\nvoid FitAndPlotHdmd(TH1 &hdmd)\n{\n   \/\/ create the canvas for the h1analysis fit\n   gStyle->SetOptFit();\n   auto c1 = new TCanvas(\"c1\", \"h1analysis analysis\", 10, 10, 800, 600);\n   hdmd.GetXaxis()->SetTitle(\"m_{K#pi#pi} - m_{K#pi}[GeV\/c^{2}]\");\n   hdmd.GetXaxis()->SetTitleOffset(1.4);\n\n   \/\/ fit histogram hdmd with function f5 using the loglikelihood option\n   auto f5 = new TF1(\"f5\", fdm5, 0.139, 0.17, 5);\n   f5->SetParameters(1000000, .25, 2000, .1454, .001);\n   hdmd.Fit(\"f5\", \"lr\");\n\n   hdmd.DrawClone();\n}\n\nvoid FitAndPlotH2(TH2 &h2)\n{\n   \/\/ create the canvas for tau d0\n   auto c2 = new TCanvas(\"c2\", \"tauD0\", 100, 100, 800, 600);\n\n   c2->SetGrid();\n   c2->SetBottomMargin(0.15);\n\n   \/\/ Project slices of 2-d histogram h2 along X , then fit each slice\n   \/\/ with function f2 and make a histogram for each fit parameter\n   \/\/ Note that the generated histograms are added to the list of objects\n   \/\/ in the current directory.\n   auto f2 = new TF1(\"f2\", fdm2, 0.139, 0.17, 2);\n   f2->SetParameters(10000, 10);\n   h2.FitSlicesX(f2, 0, -1, 1, \"qln\");\n\n   \/\/ See TH2::FitSlicesX documentation\n   auto h2_1 = (TH1D *)gDirectory->Get(\"h2_1\");\n   h2_1->GetXaxis()->SetTitle(\"#tau [ps]\");\n   h2_1->SetMarkerStyle(21);\n   h2_1->DrawClone();\n   c2->Update();\n\n   auto line = new TLine(0, 0, 0, c2->GetUymax());\n   line->Draw();\n}\n\nvoid df101_h1Analysis()\n{\n   TChain chain(\"h42\");\n   chain.Add(\"http:\/\/root.cern.ch\/files\/h1\/dstarmb.root\");\n   chain.Add(\"http:\/\/root.cern.ch\/files\/h1\/dstarp1a.root\");\n   chain.Add(\"http:\/\/root.cern.ch\/files\/h1\/dstarp1b.root\");\n   chain.Add(\"http:\/\/root.cern.ch\/files\/h1\/dstarp2.root\");\n\n   ROOT::EnableImplicitMT(4);\n\n   ROOT::RDataFrame dataFrame(chain);\n   auto selected = Select(dataFrame);\n   auto hdmdARP = selected.Histo1D({\"hdmd\", \"Dm_d\", 40, 0.13, 0.17}, \"dm_d\");\n   auto selectedAddedBranch = selected.Define(\"h2_y\", \"rpd0_t \/ 0.029979f * 1.8646f \/ ptd0_d\");\n   auto h2ARP = selectedAddedBranch.Histo2D({\"h2\", \"ptD0 vs Dm_d\", 30, 0.135, 0.165, 30, -3, 6}, \"dm_d\", \"h2_y\");\n\n   FitAndPlotHdmd(*hdmdARP);\n   FitAndPlotH2(*h2ARP);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"cqts_engine.h\"\n#include <QFile>\n#include <QDir>\n\n#include <QStringList>\n#include <QTextStream>\n\n#include <QDebug>\n\nCQTs_engine::CQTs_engine()\n{\n}\n\n\/*****class handler*****\/\n\/*ClassFile structure:\n *Class Name\n *lv max\n *datanumber 16*fort+8*ref+4*will+bab\n *bab= 1(01) poor, 2(10) good ,3(11) average\n *endofile\n *\/\n\nCQTs_Class::CQTs_Class(QString classLink){\n    classLink.remove(\".ClC\");\n    QFile file(classLink+\".ClC\");\/\/temporary\n    int data;\/\/data-sink for bab and ST\n    int F=16, R=8, W=4, bab=3;\/\/mask for ST&BAB\n    if (!file.open(QIODevice::ReadOnly | QIODevice::Text)){\n        Name=\"error\";\n        data=0;\n        lmax=-1;\n    \/\/add an alert!\n       }\n       else{\n        QTextStream in(&file);\n        Name= in.readLine();\n        in >> lmax;\n        in >> data;\n    }\n    fort = (data & F)\/F;\/\/good? 0\/1\n    ref = (data & R)\/R;\/\/good? 0\/1\n    will = (data & W)\/W;\/\/good ?0\/1\n    BAB = (data & bab);\/\/ good 10, poor 01, average 11, i know it's not intuitive\n    \/*qDebug()<<Name;\n    qDebug()<<lmax;\n    qDebug()<<data;\n    qDebug()<<BAB;\n    qDebug()<<fort;\n    qDebug()<<ref;\n    qDebug()<<will;\n*\/\n}\n\nQString CQTs_Class::className(){return Name;}\n\nint CQTs_Class::classBAB(){return BAB;}\n\nbool CQTs_Class::STFort(){return fort;}\n\nbool CQTs_Class::STRef(){return ref;}\n\nbool CQTs_Class::STWill(){return will;}\n\n\/*****utilities*****\/\n\nQStringList extensionFind(QString ext,QString dir){\n    QDir workDir(dir);\n\n    QStringList filelist;\n    filelist = workDir.entryList(QStringList(ext),QDir::Files | QDir::NoSymLinks);\n    return filelist;\n}\n\nQStringList extensionFind(QString ext){\n    return extensionFind(ext,\".\/\");\n}\n<commit_msg>designed charater file<commit_after>#include \"cqts_engine.h\"\n#include <QFile>\n#include <QDir>\n\n#include <QStringList>\n#include <QTextStream>\n\n#include <QDebug>\n\nCQTs_engine::CQTs_engine()\n{\n}\n\/*****character handler*****\/\n\/*CharacterFile structure:\n *Name\n *Surname\n *age\n *lv\n *bab\n *hp\n *fort \\t ref \\t will\n *endoffile\n *\/\nCQTs_Character::CQTs_Character(QString filename){\n    filename.remove(\".chc\");\n    QFile file(filename+\".ClC\");\n\n}\n\n\/*****class handler*****\/\n\/*ClassFile structure:\n *Class Name\n *lv max\n *datanumber 16*fort+8*ref+4*will+bab\n *bab= 1(01) poor, 2(10) good ,3(11) average\n *endoffile\n *\/\n\nCQTs_Class::CQTs_Class(QString classLink){\n    classLink.remove(\".ClC\");\n    QFile file(classLink+\".ClC\");\/\/temporary\n    int data;\/\/data-sink for bab and ST\n    int F=16, R=8, W=4, bab=3;\/\/mask for ST&BAB\n    if (!file.open(QIODevice::ReadOnly | QIODevice::Text)){\n        Name=\"error\";\n        data=0;\n        lmax=-1;\n    \/\/add an alert!\n       }\n       else{\n        QTextStream in(&file);\n        Name= in.readLine();\n        in >> lmax;\n        in >> data;\n    }\n    fort = (data & F)\/F;\/\/good? 0\/1\n    ref = (data & R)\/R;\/\/good? 0\/1\n    will = (data & W)\/W;\/\/good ?0\/1\n    BAB = (data & bab);\/\/ good 10, poor 01, average 11, i know it's not intuitive\n    \/*qDebug()<<Name;\n    qDebug()<<lmax;\n    qDebug()<<data;\n    qDebug()<<BAB;\n    qDebug()<<fort;\n    qDebug()<<ref;\n    qDebug()<<will;\n*\/\n}\n\nQString CQTs_Class::className(){return Name;}\n\nint CQTs_Class::classBAB(){return BAB;}\n\nbool CQTs_Class::STFort(){return fort;}\n\nbool CQTs_Class::STRef(){return ref;}\n\nbool CQTs_Class::STWill(){return will;}\n\n\/*****utilities*****\/\n\nQStringList extensionFind(QString ext,QString dir){\n    QDir workDir(dir);\n\n    QStringList filelist;\n    filelist = workDir.entryList(QStringList(ext),QDir::Files | QDir::NoSymLinks);\n    return filelist;\n}\n\nQStringList extensionFind(QString ext){\n    return extensionFind(ext,\".\/\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n    Copyright (C) 2000-2007 by Jorrit Tyberghein\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 GNU\r\n    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; if not, write to the Free\r\n    Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\r\n*\/\r\n#include \"cssysdef.h\"\r\n#include \"csqsqrt.h\"\r\n#include \"csgeom\/sphere.h\"\r\n#include \"imesh\/objmodel.h\"\r\n#include \"igeom\/clip2d.h\"\r\n#include \"plugins\/engine\/3d\/sector.h\"\r\n#include \"plugins\/engine\/3d\/meshfact.h\"\r\n#include \"plugins\/engine\/3d\/meshlod.h\"\r\n#include \"plugins\/engine\/3d\/light.h\"\r\n#include \"plugins\/engine\/3d\/engine.h\"\r\n#include \"iengine\/portal.h\"\r\n#include \"iengine\/rview.h\"\r\n#include \"ivideo\/graph3d.h\"\r\n#include \"ivideo\/rendermesh.h\"\r\n\r\n\r\nCS_LEAKGUARD_IMPLEMENT (csMeshFactoryWrapper);\r\n\r\n\/\/ ---------------------------------------------------------------------------\r\n\/\/ csMeshFactoryWrapper\r\n\/\/ ---------------------------------------------------------------------------\r\n\r\n\r\ncsMeshFactoryWrapper::csMeshFactoryWrapper (csEngine* engine,\r\n                                            iMeshObjectFactory *meshFact)\r\n  : scfImplementationType (this), meshFact (meshFact), parent (0),\r\n  zbufMode (CS_ZBUF_USE), engine (engine)\r\n{\r\n  children.SetMeshFactory (this);\r\n\r\n  render_priority = engine->GetObjectRenderPriority ();\r\n  imposter_active = false;\r\n  imposter_factory = 0;\r\n  \r\n  \/* Work around iShaderVariableContext cast not working before \r\n     CS::ShaderVariableContextImpl construction *\/\r\n  csRefTrackerAccess::AddAlias (\r\n    static_cast<iShaderVariableContext*> (this),\r\n    this);\r\n}\r\n\r\ncsMeshFactoryWrapper::csMeshFactoryWrapper (csEngine* engine)\r\n  : scfImplementationType (this), parent (0), zbufMode (CS_ZBUF_USE), \r\n  engine (engine)\r\n{\r\n  children.SetMeshFactory (this);\r\n\r\n  render_priority = engine->GetObjectRenderPriority ();\r\n  imposter_active = false;\r\n  imposter_factory = 0;\r\n  \r\n  \/* Work around iShaderVariableContext cast not working before \r\n     CS::ShaderVariableContextImpl construction *\/\r\n  csRefTrackerAccess::AddAlias (\r\n    static_cast<iShaderVariableContext*> (this),\r\n    this);\r\n}\r\n\r\ncsMeshFactoryWrapper::~csMeshFactoryWrapper ()\r\n{\r\n  \/\/ This line MUST be here to ensure that the children are not\r\n  \/\/ removed after the destructor has already finished.\r\n  children.RemoveAll ();\r\n  delete imposter_factory;\r\n}\r\n\r\nvoid csMeshFactoryWrapper::SelfDestruct ()\r\n{\r\n  engine->GetMeshFactories ()->Remove (\r\n    static_cast<iMeshFactoryWrapper*> (this));\r\n}\r\n\r\nvoid csMeshFactoryWrapper::SetZBufModeRecursive (csZBufMode mode)\r\n{\r\n  SetZBufMode (mode);\r\n  const iMeshFactoryList* ml = &children;\r\n  if (!ml) return;\r\n  int i;\r\n  for (i = 0 ; i < ml->GetCount () ; i++)\r\n    ml->Get (i)->SetZBufModeRecursive (mode);\r\n}\r\n\r\nvoid csMeshFactoryWrapper::SetRenderPriorityRecursive (long rp)\r\n{\r\n  SetRenderPriority (rp);\r\n  const iMeshFactoryList* ml = &children;\r\n  if (!ml) return;\r\n  int i;\r\n  for (i = 0 ; i < ml->GetCount () ; i++)\r\n    ml->Get (i)->SetRenderPriorityRecursive (rp);\r\n}\r\n\r\nvoid csMeshFactoryWrapper::SetRenderPriority (long rp)\r\n{\r\n  render_priority = rp;\r\n}\r\n\r\nvoid csMeshFactoryWrapper::SetMeshObjectFactory (iMeshObjectFactory *meshFact)\r\n{\r\n  csMeshFactoryWrapper::meshFact = meshFact;\r\n}\r\n\r\ncsPtr<iMeshWrapper> csMeshFactoryWrapper::CreateMeshWrapper ()\r\n{\r\n  csRef<iMeshObject> basemesh = meshFact->NewInstance ();\r\n  csMeshWrapper* cmesh = new csMeshWrapper (engine, basemesh);\r\n  iMeshWrapper* mesh = static_cast<iMeshWrapper*> (cmesh);\r\n  basemesh->SetMeshWrapper (mesh);\r\n\r\n  if (GetName ()) mesh->QueryObject ()->SetName (GetName ());\r\n  mesh->SetFactory (this);\r\n  mesh->SetRenderPriority (render_priority);\r\n  mesh->SetZBufMode (zbufMode);\r\n  mesh->GetFlags ().Set (flags.Get (), flags.Get ());\r\n\r\n  if (static_lod)\r\n  {\r\n    iLODControl* lod = mesh->CreateStaticLOD ();\r\n    iSharedVariable* varm, * vara;\r\n    static_lod->GetLOD (varm, vara);\r\n    if (varm)\r\n    {\r\n      lod->SetLOD (varm, vara);\r\n    }\r\n    else\r\n    {\r\n      float m, a;\r\n      static_lod->GetLOD (m, a);\r\n      lod->SetLOD (m, a);\r\n    }\r\n  }\r\n\r\n  int i;\r\n  for (i = 0; i < children.GetCount (); i++)\r\n  {\r\n    iMeshFactoryWrapper *childfact = children.Get (i);\r\n    csRef<iMeshWrapper> child = childfact->CreateMeshWrapper ();\r\n    child->QuerySceneNode ()->SetParent (mesh->QuerySceneNode ());\r\n    child->GetMovable ()->SetTransform (childfact->GetTransform ());\r\n    child->GetMovable ()->UpdateMove ();\r\n\r\n    if (static_lod)\r\n    {\r\n      \/\/ We have static lod so we need to put the child in the right\r\n      \/\/ lod level.\r\n      int l;\r\n      for (l = 0 ; l < static_lod->GetLODCount () ; l++)\r\n      {\r\n        csArray<iMeshFactoryWrapper*>& facts_for_lod =\r\n      \t  static_lod->GetMeshesForLOD (l);\r\n        size_t j;\r\n\tfor (j = 0 ; j < facts_for_lod.GetSize () ; j++)\r\n\t{\r\n\t  if (facts_for_lod[j] == childfact)\r\n\t    mesh->AddMeshToStaticLOD (l, child);\r\n\t}\r\n      }\r\n    }\r\n  }\r\n\r\n  return csPtr<iMeshWrapper> (mesh);\r\n}\r\n\r\nvoid csMeshFactoryWrapper::HardTransform (const csReversibleTransform &t)\r\n{\r\n  meshFact->HardTransform (t);\r\n}\r\n\r\niLODControl* csMeshFactoryWrapper::CreateStaticLOD ()\r\n{\r\n  static_lod = csPtr<csStaticLODFactoryMesh> (new csStaticLODFactoryMesh ());\r\n  return static_lod;\r\n}\r\n\r\nvoid csMeshFactoryWrapper::DestroyStaticLOD ()\r\n{\r\n  static_lod = 0;\r\n}\r\n\r\niLODControl* csMeshFactoryWrapper::GetStaticLOD ()\r\n{\r\n  return (iLODControl*)static_lod;\r\n}\r\n\r\nvoid csMeshFactoryWrapper::SetStaticLOD (float m, float a)\r\n{\r\n  if (static_lod) static_lod->SetLOD (m, a);\r\n}\r\n\r\nvoid csMeshFactoryWrapper::GetStaticLOD (float& m, float& a) const\r\n{\r\n  if (static_lod)\r\n    static_lod->GetLOD (m, a);\r\n  else\r\n  {\r\n    m = 0;\r\n    a = 0;\r\n  }\r\n}\r\n\r\nvoid csMeshFactoryWrapper::RemoveFactoryFromStaticLOD (\r\n\tiMeshFactoryWrapper* fact)\r\n{\r\n  if (!static_lod) return;\t\/\/ No static lod, nothing to do here.\r\n  int lod;\r\n  for (lod = 0 ; lod < static_lod->GetLODCount () ; lod++)\r\n  {\r\n    csArray<iMeshFactoryWrapper*>& meshes_for_lod =\r\n    \tstatic_lod->GetMeshesForLOD (lod);\r\n    meshes_for_lod.Delete (fact);\r\n  }\r\n}\r\n\r\nvoid csMeshFactoryWrapper::AddFactoryToStaticLOD (int lod,\r\n\tiMeshFactoryWrapper* fact)\r\n{\r\n  if (!static_lod) return;\t\/\/ No static lod, nothing to do here.\r\n  csArray<iMeshFactoryWrapper*>& meshes_for_lod =\r\n  \tstatic_lod->GetMeshesForLOD (lod);\r\n  meshes_for_lod.Push (fact);\r\n}\r\n\r\nvoid csMeshFactoryWrapper::SetImposterActive (bool flag)\r\n{\r\n  imposter_active = flag;\r\n  if (imposter_active)\r\n  {\r\n    if (!imposter_factory)\r\n      imposter_factory = new csImposterFactory (this);\r\n  }\r\n  else if (!imposter_active)\r\n  {\r\n    delete imposter_factory;\r\n  }\r\n}\r\n\r\n\r\n\/\/--------------------------------------------------------------------------\r\n\/\/ csMeshFactoryList\r\n\/\/--------------------------------------------------------------------------\r\ncsMeshFactoryList::csMeshFactoryList ()\r\n  : scfImplementationType (this), list (64)\r\n{\r\n  listener.AttachNew (new NameChangeListener (this));\r\n}\r\n\r\ncsMeshFactoryList::~csMeshFactoryList ()\r\n{\r\n  RemoveAll ();\r\n}\r\n\r\nvoid csMeshFactoryList::NameChanged (iObject* object, const char* oldname,\r\n  \tconst char* newname)\r\n{\r\n  csRef<iMeshFactoryWrapper> mesh = \r\n    scfQueryInterface<iMeshFactoryWrapper> (object);\r\n  CS_ASSERT (mesh != 0);\r\n  if (oldname) factories_hash.Delete (oldname, mesh);\r\n  if (newname) factories_hash.Put (newname, mesh);\r\n}\r\n\r\nint csMeshFactoryList::Add (iMeshFactoryWrapper *obj)\r\n{\r\n  PrepareFactory (obj);\r\n  const char* name = obj->QueryObject ()->GetName ();\r\n  if (name)\r\n    factories_hash.Put (name, obj);\r\n  obj->QueryObject ()->AddNameChangeListener (listener);\r\n  return (int)list.Push (obj);\r\n}\r\n\r\nbool csMeshFactoryList::Remove (iMeshFactoryWrapper *obj)\r\n{\r\n  CS::Threading::RecursiveMutexScopedLock lock(removeLock);\r\n  FreeFactory (obj);\r\n  const char* name = obj->QueryObject ()->GetName ();\r\n  if (name)\r\n    factories_hash.Delete (name, obj);\r\n  obj->QueryObject ()->RemoveNameChangeListener (listener);\r\n  list.Delete (obj);\r\n  return true;\r\n}\r\n\r\nbool csMeshFactoryList::Remove (int n)\r\n{\r\n  CS::Threading::RecursiveMutexScopedLock lock(removeLock);\r\n  return Remove (Get (n));\r\n}\r\n\r\nvoid csMeshFactoryList::RemoveAll ()\r\n{\r\n  CS::Threading::RecursiveMutexScopedLock lock(removeLock);\r\n  size_t i;\r\n  for (i = 0 ; i < list.GetSize () ; i++)\r\n  {\r\n    list[i]->QueryObject ()->RemoveNameChangeListener (listener);\r\n    FreeFactory (list[i]);\r\n  }\r\n  factories_hash.DeleteAll ();\r\n  list.DeleteAll ();\r\n}\r\n\r\nint csMeshFactoryList::Find (iMeshFactoryWrapper *obj) const\r\n{\r\n  return (int)list.Find (obj);\r\n}\r\n\r\niMeshFactoryWrapper *csMeshFactoryList::FindByName (\r\n  const char *Name) const\r\n{\r\n  CS::Threading::RecursiveMutexScopedLock lock(removeLock);\r\n  if (!Name) return 0;\r\n  return factories_hash.Get (Name, 0);\r\n}\r\n\r\n\/\/--------------------------------------------------------------------------\r\n\/\/ csMeshFactoryFactoryList\r\n\/\/--------------------------------------------------------------------------\r\nvoid csMeshFactoryFactoryList::PrepareFactory (iMeshFactoryWrapper* child)\r\n{\r\n  CS_ASSERT (meshfact != 0);\r\n  csMeshFactoryList::PrepareFactory (child);\r\n\r\n  \/\/ unlink the factory from another possible parent.\r\n  if (child->GetParentContainer ())\r\n    child->GetParentContainer ()->GetChildren ()->Remove (child);\r\n\r\n  child->SetParentContainer (meshfact);\r\n}\r\n\r\nvoid csMeshFactoryFactoryList::FreeFactory (iMeshFactoryWrapper* item)\r\n{\r\n  CS_ASSERT (meshfact != 0);\r\n  item->SetParentContainer (0);\r\n  meshfact->RemoveFactoryFromStaticLOD (item);\r\n  csMeshFactoryList::FreeFactory (item);\r\n}\r\n<commit_msg>eol-style + mime-type<commit_after>\/*\n    Copyright (C) 2000-2007 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#include \"cssysdef.h\"\n#include \"csqsqrt.h\"\n#include \"csgeom\/sphere.h\"\n#include \"imesh\/objmodel.h\"\n#include \"igeom\/clip2d.h\"\n#include \"plugins\/engine\/3d\/sector.h\"\n#include \"plugins\/engine\/3d\/meshfact.h\"\n#include \"plugins\/engine\/3d\/meshlod.h\"\n#include \"plugins\/engine\/3d\/light.h\"\n#include \"plugins\/engine\/3d\/engine.h\"\n#include \"iengine\/portal.h\"\n#include \"iengine\/rview.h\"\n#include \"ivideo\/graph3d.h\"\n#include \"ivideo\/rendermesh.h\"\n\n\nCS_LEAKGUARD_IMPLEMENT (csMeshFactoryWrapper);\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ csMeshFactoryWrapper\n\/\/ ---------------------------------------------------------------------------\n\n\ncsMeshFactoryWrapper::csMeshFactoryWrapper (csEngine* engine,\n                                            iMeshObjectFactory *meshFact)\n  : scfImplementationType (this), meshFact (meshFact), parent (0),\n  zbufMode (CS_ZBUF_USE), engine (engine)\n{\n  children.SetMeshFactory (this);\n\n  render_priority = engine->GetObjectRenderPriority ();\n  imposter_active = false;\n  imposter_factory = 0;\n  \n  \/* Work around iShaderVariableContext cast not working before \n     CS::ShaderVariableContextImpl construction *\/\n  csRefTrackerAccess::AddAlias (\n    static_cast<iShaderVariableContext*> (this),\n    this);\n}\n\ncsMeshFactoryWrapper::csMeshFactoryWrapper (csEngine* engine)\n  : scfImplementationType (this), parent (0), zbufMode (CS_ZBUF_USE), \n  engine (engine)\n{\n  children.SetMeshFactory (this);\n\n  render_priority = engine->GetObjectRenderPriority ();\n  imposter_active = false;\n  imposter_factory = 0;\n  \n  \/* Work around iShaderVariableContext cast not working before \n     CS::ShaderVariableContextImpl construction *\/\n  csRefTrackerAccess::AddAlias (\n    static_cast<iShaderVariableContext*> (this),\n    this);\n}\n\ncsMeshFactoryWrapper::~csMeshFactoryWrapper ()\n{\n  \/\/ This line MUST be here to ensure that the children are not\n  \/\/ removed after the destructor has already finished.\n  children.RemoveAll ();\n  delete imposter_factory;\n}\n\nvoid csMeshFactoryWrapper::SelfDestruct ()\n{\n  engine->GetMeshFactories ()->Remove (\n    static_cast<iMeshFactoryWrapper*> (this));\n}\n\nvoid csMeshFactoryWrapper::SetZBufModeRecursive (csZBufMode mode)\n{\n  SetZBufMode (mode);\n  const iMeshFactoryList* ml = &children;\n  if (!ml) return;\n  int i;\n  for (i = 0 ; i < ml->GetCount () ; i++)\n    ml->Get (i)->SetZBufModeRecursive (mode);\n}\n\nvoid csMeshFactoryWrapper::SetRenderPriorityRecursive (long rp)\n{\n  SetRenderPriority (rp);\n  const iMeshFactoryList* ml = &children;\n  if (!ml) return;\n  int i;\n  for (i = 0 ; i < ml->GetCount () ; i++)\n    ml->Get (i)->SetRenderPriorityRecursive (rp);\n}\n\nvoid csMeshFactoryWrapper::SetRenderPriority (long rp)\n{\n  render_priority = rp;\n}\n\nvoid csMeshFactoryWrapper::SetMeshObjectFactory (iMeshObjectFactory *meshFact)\n{\n  csMeshFactoryWrapper::meshFact = meshFact;\n}\n\ncsPtr<iMeshWrapper> csMeshFactoryWrapper::CreateMeshWrapper ()\n{\n  csRef<iMeshObject> basemesh = meshFact->NewInstance ();\n  csMeshWrapper* cmesh = new csMeshWrapper (engine, basemesh);\n  iMeshWrapper* mesh = static_cast<iMeshWrapper*> (cmesh);\n  basemesh->SetMeshWrapper (mesh);\n\n  if (GetName ()) mesh->QueryObject ()->SetName (GetName ());\n  mesh->SetFactory (this);\n  mesh->SetRenderPriority (render_priority);\n  mesh->SetZBufMode (zbufMode);\n  mesh->GetFlags ().Set (flags.Get (), flags.Get ());\n\n  if (static_lod)\n  {\n    iLODControl* lod = mesh->CreateStaticLOD ();\n    iSharedVariable* varm, * vara;\n    static_lod->GetLOD (varm, vara);\n    if (varm)\n    {\n      lod->SetLOD (varm, vara);\n    }\n    else\n    {\n      float m, a;\n      static_lod->GetLOD (m, a);\n      lod->SetLOD (m, a);\n    }\n  }\n\n  int i;\n  for (i = 0; i < children.GetCount (); i++)\n  {\n    iMeshFactoryWrapper *childfact = children.Get (i);\n    csRef<iMeshWrapper> child = childfact->CreateMeshWrapper ();\n    child->QuerySceneNode ()->SetParent (mesh->QuerySceneNode ());\n    child->GetMovable ()->SetTransform (childfact->GetTransform ());\n    child->GetMovable ()->UpdateMove ();\n\n    if (static_lod)\n    {\n      \/\/ We have static lod so we need to put the child in the right\n      \/\/ lod level.\n      int l;\n      for (l = 0 ; l < static_lod->GetLODCount () ; l++)\n      {\n        csArray<iMeshFactoryWrapper*>& facts_for_lod =\n      \t  static_lod->GetMeshesForLOD (l);\n        size_t j;\n\tfor (j = 0 ; j < facts_for_lod.GetSize () ; j++)\n\t{\n\t  if (facts_for_lod[j] == childfact)\n\t    mesh->AddMeshToStaticLOD (l, child);\n\t}\n      }\n    }\n  }\n\n  return csPtr<iMeshWrapper> (mesh);\n}\n\nvoid csMeshFactoryWrapper::HardTransform (const csReversibleTransform &t)\n{\n  meshFact->HardTransform (t);\n}\n\niLODControl* csMeshFactoryWrapper::CreateStaticLOD ()\n{\n  static_lod = csPtr<csStaticLODFactoryMesh> (new csStaticLODFactoryMesh ());\n  return static_lod;\n}\n\nvoid csMeshFactoryWrapper::DestroyStaticLOD ()\n{\n  static_lod = 0;\n}\n\niLODControl* csMeshFactoryWrapper::GetStaticLOD ()\n{\n  return (iLODControl*)static_lod;\n}\n\nvoid csMeshFactoryWrapper::SetStaticLOD (float m, float a)\n{\n  if (static_lod) static_lod->SetLOD (m, a);\n}\n\nvoid csMeshFactoryWrapper::GetStaticLOD (float& m, float& a) const\n{\n  if (static_lod)\n    static_lod->GetLOD (m, a);\n  else\n  {\n    m = 0;\n    a = 0;\n  }\n}\n\nvoid csMeshFactoryWrapper::RemoveFactoryFromStaticLOD (\n\tiMeshFactoryWrapper* fact)\n{\n  if (!static_lod) return;\t\/\/ No static lod, nothing to do here.\n  int lod;\n  for (lod = 0 ; lod < static_lod->GetLODCount () ; lod++)\n  {\n    csArray<iMeshFactoryWrapper*>& meshes_for_lod =\n    \tstatic_lod->GetMeshesForLOD (lod);\n    meshes_for_lod.Delete (fact);\n  }\n}\n\nvoid csMeshFactoryWrapper::AddFactoryToStaticLOD (int lod,\n\tiMeshFactoryWrapper* fact)\n{\n  if (!static_lod) return;\t\/\/ No static lod, nothing to do here.\n  csArray<iMeshFactoryWrapper*>& meshes_for_lod =\n  \tstatic_lod->GetMeshesForLOD (lod);\n  meshes_for_lod.Push (fact);\n}\n\nvoid csMeshFactoryWrapper::SetImposterActive (bool flag)\n{\n  imposter_active = flag;\n  if (imposter_active)\n  {\n    if (!imposter_factory)\n      imposter_factory = new csImposterFactory (this);\n  }\n  else if (!imposter_active)\n  {\n    delete imposter_factory;\n  }\n}\n\n\n\/\/--------------------------------------------------------------------------\n\/\/ csMeshFactoryList\n\/\/--------------------------------------------------------------------------\ncsMeshFactoryList::csMeshFactoryList ()\n  : scfImplementationType (this), list (64)\n{\n  listener.AttachNew (new NameChangeListener (this));\n}\n\ncsMeshFactoryList::~csMeshFactoryList ()\n{\n  RemoveAll ();\n}\n\nvoid csMeshFactoryList::NameChanged (iObject* object, const char* oldname,\n  \tconst char* newname)\n{\n  csRef<iMeshFactoryWrapper> mesh = \n    scfQueryInterface<iMeshFactoryWrapper> (object);\n  CS_ASSERT (mesh != 0);\n  if (oldname) factories_hash.Delete (oldname, mesh);\n  if (newname) factories_hash.Put (newname, mesh);\n}\n\nint csMeshFactoryList::Add (iMeshFactoryWrapper *obj)\n{\n  PrepareFactory (obj);\n  const char* name = obj->QueryObject ()->GetName ();\n  if (name)\n    factories_hash.Put (name, obj);\n  obj->QueryObject ()->AddNameChangeListener (listener);\n  return (int)list.Push (obj);\n}\n\nbool csMeshFactoryList::Remove (iMeshFactoryWrapper *obj)\n{\n  CS::Threading::RecursiveMutexScopedLock lock(removeLock);\n  FreeFactory (obj);\n  const char* name = obj->QueryObject ()->GetName ();\n  if (name)\n    factories_hash.Delete (name, obj);\n  obj->QueryObject ()->RemoveNameChangeListener (listener);\n  list.Delete (obj);\n  return true;\n}\n\nbool csMeshFactoryList::Remove (int n)\n{\n  CS::Threading::RecursiveMutexScopedLock lock(removeLock);\n  return Remove (Get (n));\n}\n\nvoid csMeshFactoryList::RemoveAll ()\n{\n  CS::Threading::RecursiveMutexScopedLock lock(removeLock);\n  size_t i;\n  for (i = 0 ; i < list.GetSize () ; i++)\n  {\n    list[i]->QueryObject ()->RemoveNameChangeListener (listener);\n    FreeFactory (list[i]);\n  }\n  factories_hash.DeleteAll ();\n  list.DeleteAll ();\n}\n\nint csMeshFactoryList::Find (iMeshFactoryWrapper *obj) const\n{\n  return (int)list.Find (obj);\n}\n\niMeshFactoryWrapper *csMeshFactoryList::FindByName (\n  const char *Name) const\n{\n  CS::Threading::RecursiveMutexScopedLock lock(removeLock);\n  if (!Name) return 0;\n  return factories_hash.Get (Name, 0);\n}\n\n\/\/--------------------------------------------------------------------------\n\/\/ csMeshFactoryFactoryList\n\/\/--------------------------------------------------------------------------\nvoid csMeshFactoryFactoryList::PrepareFactory (iMeshFactoryWrapper* child)\n{\n  CS_ASSERT (meshfact != 0);\n  csMeshFactoryList::PrepareFactory (child);\n\n  \/\/ unlink the factory from another possible parent.\n  if (child->GetParentContainer ())\n    child->GetParentContainer ()->GetChildren ()->Remove (child);\n\n  child->SetParentContainer (meshfact);\n}\n\nvoid csMeshFactoryFactoryList::FreeFactory (iMeshFactoryWrapper* item)\n{\n  CS_ASSERT (meshfact != 0);\n  item->SetParentContainer (0);\n  meshfact->RemoveFactoryFromStaticLOD (item);\n  csMeshFactoryList::FreeFactory (item);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(nlogn)\n\/\/ Space: O(n)\n\nclass Solution {\npublic:\n    \/**\n     * @param nums: A list of integers\n     * @return: A list of integers includes the index of the first number\n     *          and the index of the last number\n     *\/\n    vector<int> subarraySumClosest(vector<int> nums) {\n        const int n = nums.size();\n        \n        if (n == 1) {\n            return {0, 0};\n        }\n        \n        \/\/ sum_from_start[i] denotes sum for 0 ~ i - 1.\n        vector<pair<int,int>> sum_from_start(n + 1, make_pair(0, 0));\n        sum_from_start[0].second = -1; \/\/ For case closest sum is from 0.\n        for (int  i = 0; i < n; ++i) {\n            sum_from_start[i+1].first = sum_from_start[i].first + nums[i];\n            sum_from_start[i+1].second = i;\n        }\n        \n        \/\/ Sort each sum from start.\n        sort(sum_from_start.begin(), sum_from_start.end());\n        \n        int min_diff = INT_MAX;\n        int start = -1;\n        int end = -1;\n        \n        \/\/ Find min difference of adjacent sum.\n        for (int i = 1; i <= n; ++i) {\n            int diff = abs(sum_from_start[i].first - sum_from_start[i-1].first);\n            if (diff < min_diff) {\n                min_diff = diff;\n                start = min(sum_from_start[i].second, sum_from_start[i - 1].second) + 1;\n                end = max(sum_from_start[i].second, sum_from_start[i - 1].second);\n            }\n        }\n        \n        return {start, end};\n    }\n};\n<commit_msg>Update subarray-sum-closest.cpp<commit_after>\/\/ Time:  O(nlogn)\n\/\/ Space: O(n)\n\nclass Solution {\npublic:\n    \/**\n     * @param nums: A list of integers\n     * @return: A list of integers includes the index of the first number\n     *          and the index of the last number\n     *\/\n    vector<int> subarraySumClosest(vector<int> nums) {\n        const int n = nums.size();\n        \n        if (n == 1) {\n            return {0, 0};\n        }\n        \n        \/\/ sum_from_start[i] denotes sum for 0 ~ i - 1.\n        vector<pair<int,int>> sum_from_start(n + 1, {0, 0});\n        sum_from_start[0].second = -1; \/\/ For case closest sum is from 0.\n        for (int  i = 0; i < n; ++i) {\n            sum_from_start[i+1].first = sum_from_start[i].first + nums[i];\n            sum_from_start[i+1].second = i;\n        }\n        \n        \/\/ Sort each sum from start.\n        sort(sum_from_start.begin(), sum_from_start.end());\n        \n        int min_diff = INT_MAX;\n        int start = -1;\n        int end = -1;\n        \n        \/\/ Find min difference of adjacent sum.\n        for (int i = 1; i <= n; ++i) {\n            int diff = abs(sum_from_start[i].first - sum_from_start[i-1].first);\n            if (diff < min_diff) {\n                min_diff = diff;\n                start = min(sum_from_start[i].second, sum_from_start[i - 1].second) + 1;\n                end = max(sum_from_start[i].second, sum_from_start[i - 1].second);\n            }\n        }\n        \n        return {start, end};\n    }\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 <stdint.h>\n\n#include <string>\n\n#include \"base\/basictypes.h\"\n#include \"base\/bind.h\"\n#include \"base\/location.h\"\n#include \"base\/logging.h\"\n#include \"base\/threading\/platform_thread.h\"  \/\/ For |Sleep()|.\n#include \"mojo\/common\/test\/multiprocess_test_helper.h\"\n#include \"mojo\/embedder\/scoped_platform_handle.h\"\n#include \"mojo\/system\/channel.h\"\n#include \"mojo\/system\/local_message_pipe_endpoint.h\"\n#include \"mojo\/system\/message_pipe.h\"\n#include \"mojo\/system\/proxy_message_pipe_endpoint.h\"\n#include \"mojo\/system\/raw_channel.h\"\n#include \"mojo\/system\/test_utils.h\"\n#include \"mojo\/system\/waiter.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace mojo {\nnamespace system {\nnamespace {\n\nclass ChannelThread {\n public:\n  ChannelThread() : test_io_thread_(test::TestIOThread::kManualStart) {}\n  ~ChannelThread() {\n    Stop();\n  }\n\n  void Start(embedder::ScopedPlatformHandle platform_handle,\n             scoped_refptr<MessagePipe> message_pipe) {\n    test_io_thread_.Start();\n    test_io_thread_.PostTaskAndWait(\n        FROM_HERE,\n        base::Bind(&ChannelThread::InitChannelOnIOThread,\n                   base::Unretained(this), base::Passed(&platform_handle),\n                   message_pipe));\n  }\n\n  void Stop() {\n    if (channel_) {\n      \/\/ Hack to flush write buffers before quitting.\n      \/\/ TODO(vtl): Remove this once |Channel| has a\n      \/\/ |FlushWriteBufferAndShutdown()| (or whatever).\n      while (!channel_->IsWriteBufferEmpty())\n        base::PlatformThread::Sleep(base::TimeDelta::FromMilliseconds(20));\n\n      test_io_thread_.PostTaskAndWait(\n          FROM_HERE,\n          base::Bind(&ChannelThread::ShutdownChannelOnIOThread,\n                     base::Unretained(this)));\n    }\n    test_io_thread_.Stop();\n  }\n\n private:\n  void InitChannelOnIOThread(embedder::ScopedPlatformHandle platform_handle,\n                             scoped_refptr<MessagePipe> message_pipe) {\n    CHECK_EQ(base::MessageLoop::current(), test_io_thread_.message_loop());\n    CHECK(platform_handle.is_valid());\n\n    \/\/ Create and initialize |Channel|.\n    channel_ = new Channel();\n    CHECK(channel_->Init(RawChannel::Create(platform_handle.Pass())));\n\n    \/\/ Attach the message pipe endpoint.\n    \/\/ Note: On the \"server\" (parent process) side, we need not attach the\n    \/\/ message pipe endpoint immediately. However, on the \"client\" (child\n    \/\/ process) side, this *must* be done here -- otherwise, the |Channel| may\n    \/\/ receive\/process messages (which it can do as soon as it's hooked up to\n    \/\/ the IO thread message loop, and that message loop runs) before the\n    \/\/ message pipe endpoint is attached.\n    CHECK_EQ(channel_->AttachMessagePipeEndpoint(message_pipe, 1),\n             Channel::kBootstrapEndpointId);\n    CHECK(channel_->RunMessagePipeEndpoint(Channel::kBootstrapEndpointId,\n                                           Channel::kBootstrapEndpointId));\n  }\n\n  void ShutdownChannelOnIOThread() {\n    CHECK(channel_.get());\n    channel_->Shutdown();\n    channel_ = NULL;\n  }\n\n  test::TestIOThread test_io_thread_;\n  scoped_refptr<Channel> channel_;\n\n  DISALLOW_COPY_AND_ASSIGN(ChannelThread);\n};\n\nclass MultiprocessMessagePipeTest : public testing::Test {\n public:\n  MultiprocessMessagePipeTest() {}\n  virtual ~MultiprocessMessagePipeTest() {}\n\n protected:\n  void Init(scoped_refptr<MessagePipe> mp) {\n    channel_thread_.Start(helper_.server_platform_handle.Pass(), mp);\n  }\n\n  mojo::test::MultiprocessTestHelper* helper() { return &helper_; }\n\n private:\n  ChannelThread channel_thread_;\n  mojo::test::MultiprocessTestHelper helper_;\n\n  DISALLOW_COPY_AND_ASSIGN(MultiprocessMessagePipeTest);\n};\n\nMojoResult WaitIfNecessary(scoped_refptr<MessagePipe> mp, MojoWaitFlags flags) {\n  Waiter waiter;\n  waiter.Init();\n\n  MojoResult add_result = mp->AddWaiter(0, &waiter, flags, MOJO_RESULT_OK);\n  if (add_result != MOJO_RESULT_OK) {\n    return (add_result == MOJO_RESULT_ALREADY_EXISTS) ? MOJO_RESULT_OK :\n                                                        add_result;\n  }\n\n  MojoResult wait_result = waiter.Wait(MOJO_DEADLINE_INDEFINITE);\n  mp->RemoveWaiter(0, &waiter);\n  return wait_result;\n}\n\n\/\/ For each message received, sends a reply message with the same contents\n\/\/ repeated twice, until the other end is closed or it receives \"quitquitquit\"\n\/\/ (which it doesn't reply to). It'll return the number of messages received,\n\/\/ not including any \"quitquitquit\" message, modulo 100.\nMOJO_MULTIPROCESS_TEST_CHILD_MAIN(EchoEcho) {\n  ChannelThread channel_thread;\n  embedder::ScopedPlatformHandle client_platform_handle =\n      mojo::test::MultiprocessTestHelper::client_platform_handle.Pass();\n  CHECK(client_platform_handle.is_valid());\n  scoped_refptr<MessagePipe> mp(new MessagePipe(\n      scoped_ptr<MessagePipeEndpoint>(new LocalMessagePipeEndpoint()),\n      scoped_ptr<MessagePipeEndpoint>(new ProxyMessagePipeEndpoint())));\n  channel_thread.Start(client_platform_handle.Pass(), mp);\n\n  const std::string quitquitquit(\"quitquitquit\");\n  int rv = 0;\n  for (;; rv = (rv + 1) % 100) {\n    \/\/ Wait for our end of the message pipe to be readable.\n    MojoResult result = WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE);\n    if (result != MOJO_RESULT_OK) {\n      \/\/ It was closed, probably.\n      CHECK_EQ(result, MOJO_RESULT_FAILED_PRECONDITION);\n      break;\n    }\n\n    std::string read_buffer(1000, '\\0');\n    uint32_t read_buffer_size = static_cast<uint32_t>(read_buffer.size());\n    CHECK_EQ(mp->ReadMessage(0,\n                             &read_buffer[0], &read_buffer_size,\n                             NULL, NULL,\n                             MOJO_READ_MESSAGE_FLAG_NONE),\n             MOJO_RESULT_OK);\n    read_buffer.resize(read_buffer_size);\n    VLOG(2) << \"Child got: \" << read_buffer;\n\n    if (read_buffer == quitquitquit) {\n      VLOG(2) << \"Child quitting.\";\n      break;\n    }\n\n    std::string write_buffer = read_buffer + read_buffer;\n    CHECK_EQ(mp->WriteMessage(0,\n                              write_buffer.data(),\n                              static_cast<uint32_t>(write_buffer.size()),\n                              NULL,\n                              MOJO_WRITE_MESSAGE_FLAG_NONE),\n             MOJO_RESULT_OK);\n  }\n\n\n  mp->Close(0);\n  return rv;\n}\n\n\/\/ Sends \"hello\" to child, and expects \"hellohello\" back.\nTEST_F(MultiprocessMessagePipeTest, Basic) {\n  helper()->StartChild(\"EchoEcho\");\n\n  scoped_refptr<MessagePipe> mp(new MessagePipe(\n      scoped_ptr<MessagePipeEndpoint>(new LocalMessagePipeEndpoint()),\n      scoped_ptr<MessagePipeEndpoint>(new ProxyMessagePipeEndpoint())));\n  Init(mp);\n\n  std::string hello(\"hello\");\n  EXPECT_EQ(MOJO_RESULT_OK,\n            mp->WriteMessage(0,\n                             hello.data(), static_cast<uint32_t>(hello.size()),\n                             NULL,\n                             MOJO_WRITE_MESSAGE_FLAG_NONE));\n\n  EXPECT_EQ(MOJO_RESULT_OK, WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE));\n\n  std::string read_buffer(1000, '\\0');\n  uint32_t read_buffer_size = static_cast<uint32_t>(read_buffer.size());\n  CHECK_EQ(mp->ReadMessage(0,\n                           &read_buffer[0], &read_buffer_size,\n                           NULL, NULL,\n                           MOJO_READ_MESSAGE_FLAG_NONE),\n           MOJO_RESULT_OK);\n  read_buffer.resize(read_buffer_size);\n  VLOG(2) << \"Parent got: \" << read_buffer;\n  EXPECT_EQ(hello + hello, read_buffer);\n\n  mp->Close(0);\n\n  \/\/ We sent one message.\n  EXPECT_EQ(1 % 100, helper()->WaitForChildShutdown());\n}\n\n\/\/ Sends a bunch of messages to the child. Expects them \"repeated\" back. Waits\n\/\/ for the child to close its end before quitting.\nTEST_F(MultiprocessMessagePipeTest, QueueMessages) {\n  helper()->StartChild(\"EchoEcho\");\n\n  scoped_refptr<MessagePipe> mp(new MessagePipe(\n      scoped_ptr<MessagePipeEndpoint>(new LocalMessagePipeEndpoint()),\n      scoped_ptr<MessagePipeEndpoint>(new ProxyMessagePipeEndpoint())));\n  Init(mp);\n\n  static const size_t kNumMessages = 1001;\n  for (size_t i = 0; i < kNumMessages; i++) {\n    std::string write_buffer(i, 'A' + (i % 26));\n    EXPECT_EQ(MOJO_RESULT_OK,\n              mp->WriteMessage(0,\n                               write_buffer.data(),\n                               static_cast<uint32_t>(write_buffer.size()),\n                               NULL,\n                               MOJO_WRITE_MESSAGE_FLAG_NONE));\n  }\n\n  const std::string quitquitquit(\"quitquitquit\");\n  EXPECT_EQ(MOJO_RESULT_OK,\n            mp->WriteMessage(0,\n                             quitquitquit.data(),\n                             static_cast<uint32_t>(quitquitquit.size()),\n                             NULL,\n                             MOJO_WRITE_MESSAGE_FLAG_NONE));\n\n  for (size_t i = 0; i < kNumMessages; i++) {\n    EXPECT_EQ(MOJO_RESULT_OK, WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE));\n\n    std::string read_buffer(kNumMessages * 2, '\\0');\n    uint32_t read_buffer_size = static_cast<uint32_t>(read_buffer.size());\n    CHECK_EQ(mp->ReadMessage(0,\n                             &read_buffer[0], &read_buffer_size,\n                             NULL, NULL,\n                             MOJO_READ_MESSAGE_FLAG_NONE),\n             MOJO_RESULT_OK);\n    read_buffer.resize(read_buffer_size);\n\n    EXPECT_EQ(std::string(i * 2, 'A' + (i % 26)), read_buffer);\n  }\n\n  \/\/ Wait for it to become readable, which should fail (since we sent\n  \/\/ \"quitquitquit\").\n  EXPECT_EQ(MOJO_RESULT_FAILED_PRECONDITION,\n            WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE));\n\n  mp->Close(0);\n\n  EXPECT_EQ(static_cast<int>(kNumMessages % 100),\n            helper()->WaitForChildShutdown());\n}\n\n}  \/\/ namespace\n}  \/\/ namespace system\n}  \/\/ namespace mojo\n<commit_msg>Mojo: Add a multiprocess platform handle passing test.<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 <stdint.h>\n#include <stdio.h>\n\n#include <string>\n#include <vector>\n\n#include \"base\/bind.h\"\n#include \"base\/file_util.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/files\/scoped_file.h\"\n#include \"base\/location.h\"\n#include \"base\/logging.h\"\n#include \"base\/macros.h\"\n#include \"base\/threading\/platform_thread.h\"  \/\/ For |Sleep()|.\n#include \"build\/build_config.h\"  \/\/ TODO(vtl): Remove this.\n#include \"mojo\/common\/test\/multiprocess_test_helper.h\"\n#include \"mojo\/common\/test\/test_utils.h\"\n#include \"mojo\/embedder\/scoped_platform_handle.h\"\n#include \"mojo\/system\/channel.h\"\n#include \"mojo\/system\/dispatcher.h\"\n#include \"mojo\/system\/local_message_pipe_endpoint.h\"\n#include \"mojo\/system\/message_pipe.h\"\n#include \"mojo\/system\/platform_handle_dispatcher.h\"\n#include \"mojo\/system\/proxy_message_pipe_endpoint.h\"\n#include \"mojo\/system\/raw_channel.h\"\n#include \"mojo\/system\/test_utils.h\"\n#include \"mojo\/system\/waiter.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace mojo {\nnamespace system {\nnamespace {\n\nclass ChannelThread {\n public:\n  ChannelThread() : test_io_thread_(test::TestIOThread::kManualStart) {}\n  ~ChannelThread() {\n    Stop();\n  }\n\n  void Start(embedder::ScopedPlatformHandle platform_handle,\n             scoped_refptr<MessagePipe> message_pipe) {\n    test_io_thread_.Start();\n    test_io_thread_.PostTaskAndWait(\n        FROM_HERE,\n        base::Bind(&ChannelThread::InitChannelOnIOThread,\n                   base::Unretained(this), base::Passed(&platform_handle),\n                   message_pipe));\n  }\n\n  void Stop() {\n    if (channel_) {\n      \/\/ Hack to flush write buffers before quitting.\n      \/\/ TODO(vtl): Remove this once |Channel| has a\n      \/\/ |FlushWriteBufferAndShutdown()| (or whatever).\n      while (!channel_->IsWriteBufferEmpty())\n        base::PlatformThread::Sleep(base::TimeDelta::FromMilliseconds(20));\n\n      test_io_thread_.PostTaskAndWait(\n          FROM_HERE,\n          base::Bind(&ChannelThread::ShutdownChannelOnIOThread,\n                     base::Unretained(this)));\n    }\n    test_io_thread_.Stop();\n  }\n\n private:\n  void InitChannelOnIOThread(embedder::ScopedPlatformHandle platform_handle,\n                             scoped_refptr<MessagePipe> message_pipe) {\n    CHECK_EQ(base::MessageLoop::current(), test_io_thread_.message_loop());\n    CHECK(platform_handle.is_valid());\n\n    \/\/ Create and initialize |Channel|.\n    channel_ = new Channel();\n    CHECK(channel_->Init(RawChannel::Create(platform_handle.Pass())));\n\n    \/\/ Attach the message pipe endpoint.\n    \/\/ Note: On the \"server\" (parent process) side, we need not attach the\n    \/\/ message pipe endpoint immediately. However, on the \"client\" (child\n    \/\/ process) side, this *must* be done here -- otherwise, the |Channel| may\n    \/\/ receive\/process messages (which it can do as soon as it's hooked up to\n    \/\/ the IO thread message loop, and that message loop runs) before the\n    \/\/ message pipe endpoint is attached.\n    CHECK_EQ(channel_->AttachMessagePipeEndpoint(message_pipe, 1),\n             Channel::kBootstrapEndpointId);\n    CHECK(channel_->RunMessagePipeEndpoint(Channel::kBootstrapEndpointId,\n                                           Channel::kBootstrapEndpointId));\n  }\n\n  void ShutdownChannelOnIOThread() {\n    CHECK(channel_.get());\n    channel_->Shutdown();\n    channel_ = NULL;\n  }\n\n  test::TestIOThread test_io_thread_;\n  scoped_refptr<Channel> channel_;\n\n  DISALLOW_COPY_AND_ASSIGN(ChannelThread);\n};\n\nclass MultiprocessMessagePipeTest : public testing::Test {\n public:\n  MultiprocessMessagePipeTest() {}\n  virtual ~MultiprocessMessagePipeTest() {}\n\n protected:\n  void Init(scoped_refptr<MessagePipe> mp) {\n    channel_thread_.Start(helper_.server_platform_handle.Pass(), mp);\n  }\n\n  mojo::test::MultiprocessTestHelper* helper() { return &helper_; }\n\n private:\n  ChannelThread channel_thread_;\n  mojo::test::MultiprocessTestHelper helper_;\n\n  DISALLOW_COPY_AND_ASSIGN(MultiprocessMessagePipeTest);\n};\n\nMojoResult WaitIfNecessary(scoped_refptr<MessagePipe> mp, MojoWaitFlags flags) {\n  Waiter waiter;\n  waiter.Init();\n\n  MojoResult add_result = mp->AddWaiter(0, &waiter, flags, MOJO_RESULT_OK);\n  if (add_result != MOJO_RESULT_OK) {\n    return (add_result == MOJO_RESULT_ALREADY_EXISTS) ? MOJO_RESULT_OK :\n                                                        add_result;\n  }\n\n  MojoResult wait_result = waiter.Wait(MOJO_DEADLINE_INDEFINITE);\n  mp->RemoveWaiter(0, &waiter);\n  return wait_result;\n}\n\n\/\/ For each message received, sends a reply message with the same contents\n\/\/ repeated twice, until the other end is closed or it receives \"quitquitquit\"\n\/\/ (which it doesn't reply to). It'll return the number of messages received,\n\/\/ not including any \"quitquitquit\" message, modulo 100.\nMOJO_MULTIPROCESS_TEST_CHILD_MAIN(EchoEcho) {\n  ChannelThread channel_thread;\n  embedder::ScopedPlatformHandle client_platform_handle =\n      mojo::test::MultiprocessTestHelper::client_platform_handle.Pass();\n  CHECK(client_platform_handle.is_valid());\n  scoped_refptr<MessagePipe> mp(new MessagePipe(\n      scoped_ptr<MessagePipeEndpoint>(new LocalMessagePipeEndpoint()),\n      scoped_ptr<MessagePipeEndpoint>(new ProxyMessagePipeEndpoint())));\n  channel_thread.Start(client_platform_handle.Pass(), mp);\n\n  const std::string quitquitquit(\"quitquitquit\");\n  int rv = 0;\n  for (;; rv = (rv + 1) % 100) {\n    \/\/ Wait for our end of the message pipe to be readable.\n    MojoResult result = WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE);\n    if (result != MOJO_RESULT_OK) {\n      \/\/ It was closed, probably.\n      CHECK_EQ(result, MOJO_RESULT_FAILED_PRECONDITION);\n      break;\n    }\n\n    std::string read_buffer(1000, '\\0');\n    uint32_t read_buffer_size = static_cast<uint32_t>(read_buffer.size());\n    CHECK_EQ(mp->ReadMessage(0,\n                             &read_buffer[0], &read_buffer_size,\n                             NULL, NULL,\n                             MOJO_READ_MESSAGE_FLAG_NONE),\n             MOJO_RESULT_OK);\n    read_buffer.resize(read_buffer_size);\n    VLOG(2) << \"Child got: \" << read_buffer;\n\n    if (read_buffer == quitquitquit) {\n      VLOG(2) << \"Child quitting.\";\n      break;\n    }\n\n    std::string write_buffer = read_buffer + read_buffer;\n    CHECK_EQ(mp->WriteMessage(0,\n                              write_buffer.data(),\n                              static_cast<uint32_t>(write_buffer.size()),\n                              NULL,\n                              MOJO_WRITE_MESSAGE_FLAG_NONE),\n             MOJO_RESULT_OK);\n  }\n\n  mp->Close(0);\n  return rv;\n}\n\n\/\/ Sends \"hello\" to child, and expects \"hellohello\" back.\nTEST_F(MultiprocessMessagePipeTest, Basic) {\n  helper()->StartChild(\"EchoEcho\");\n\n  scoped_refptr<MessagePipe> mp(new MessagePipe(\n      scoped_ptr<MessagePipeEndpoint>(new LocalMessagePipeEndpoint()),\n      scoped_ptr<MessagePipeEndpoint>(new ProxyMessagePipeEndpoint())));\n  Init(mp);\n\n  std::string hello(\"hello\");\n  EXPECT_EQ(MOJO_RESULT_OK,\n            mp->WriteMessage(0,\n                             hello.data(), static_cast<uint32_t>(hello.size()),\n                             NULL,\n                             MOJO_WRITE_MESSAGE_FLAG_NONE));\n\n  EXPECT_EQ(MOJO_RESULT_OK, WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE));\n\n  std::string read_buffer(1000, '\\0');\n  uint32_t read_buffer_size = static_cast<uint32_t>(read_buffer.size());\n  CHECK_EQ(mp->ReadMessage(0,\n                           &read_buffer[0], &read_buffer_size,\n                           NULL, NULL,\n                           MOJO_READ_MESSAGE_FLAG_NONE),\n           MOJO_RESULT_OK);\n  read_buffer.resize(read_buffer_size);\n  VLOG(2) << \"Parent got: \" << read_buffer;\n  EXPECT_EQ(hello + hello, read_buffer);\n\n  mp->Close(0);\n\n  \/\/ We sent one message.\n  EXPECT_EQ(1 % 100, helper()->WaitForChildShutdown());\n}\n\n\/\/ Sends a bunch of messages to the child. Expects them \"repeated\" back. Waits\n\/\/ for the child to close its end before quitting.\nTEST_F(MultiprocessMessagePipeTest, QueueMessages) {\n  helper()->StartChild(\"EchoEcho\");\n\n  scoped_refptr<MessagePipe> mp(new MessagePipe(\n      scoped_ptr<MessagePipeEndpoint>(new LocalMessagePipeEndpoint()),\n      scoped_ptr<MessagePipeEndpoint>(new ProxyMessagePipeEndpoint())));\n  Init(mp);\n\n  static const size_t kNumMessages = 1001;\n  for (size_t i = 0; i < kNumMessages; i++) {\n    std::string write_buffer(i, 'A' + (i % 26));\n    EXPECT_EQ(MOJO_RESULT_OK,\n              mp->WriteMessage(0,\n                               write_buffer.data(),\n                               static_cast<uint32_t>(write_buffer.size()),\n                               NULL,\n                               MOJO_WRITE_MESSAGE_FLAG_NONE));\n  }\n\n  const std::string quitquitquit(\"quitquitquit\");\n  EXPECT_EQ(MOJO_RESULT_OK,\n            mp->WriteMessage(0,\n                             quitquitquit.data(),\n                             static_cast<uint32_t>(quitquitquit.size()),\n                             NULL,\n                             MOJO_WRITE_MESSAGE_FLAG_NONE));\n\n  for (size_t i = 0; i < kNumMessages; i++) {\n    EXPECT_EQ(MOJO_RESULT_OK, WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE));\n\n    std::string read_buffer(kNumMessages * 2, '\\0');\n    uint32_t read_buffer_size = static_cast<uint32_t>(read_buffer.size());\n    CHECK_EQ(mp->ReadMessage(0,\n                             &read_buffer[0], &read_buffer_size,\n                             NULL, NULL,\n                             MOJO_READ_MESSAGE_FLAG_NONE),\n             MOJO_RESULT_OK);\n    read_buffer.resize(read_buffer_size);\n\n    EXPECT_EQ(std::string(i * 2, 'A' + (i % 26)), read_buffer);\n  }\n\n  \/\/ Wait for it to become readable, which should fail (since we sent\n  \/\/ \"quitquitquit\").\n  EXPECT_EQ(MOJO_RESULT_FAILED_PRECONDITION,\n            WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE));\n\n  mp->Close(0);\n\n  EXPECT_EQ(static_cast<int>(kNumMessages % 100),\n            helper()->WaitForChildShutdown());\n}\n\nMOJO_MULTIPROCESS_TEST_CHILD_MAIN(CheckPlatformHandleFile) {\n  ChannelThread channel_thread;\n  embedder::ScopedPlatformHandle client_platform_handle =\n      mojo::test::MultiprocessTestHelper::client_platform_handle.Pass();\n  CHECK(client_platform_handle.is_valid());\n  scoped_refptr<MessagePipe> mp(new MessagePipe(\n      scoped_ptr<MessagePipeEndpoint>(new LocalMessagePipeEndpoint()),\n      scoped_ptr<MessagePipeEndpoint>(new ProxyMessagePipeEndpoint())));\n  channel_thread.Start(client_platform_handle.Pass(), mp);\n\n  CHECK_EQ(WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE), MOJO_RESULT_OK);\n\n  std::string read_buffer(100, '\\0');\n  uint32_t num_bytes = static_cast<uint32_t>(read_buffer.size());\n  DispatcherVector dispatchers;\n  uint32_t num_dispatchers = 10;  \/\/ Maximum number to receive.\n  CHECK_EQ(mp->ReadMessage(0,\n                           &read_buffer[0], &num_bytes,\n                           &dispatchers, &num_dispatchers,\n                           MOJO_READ_MESSAGE_FLAG_NONE),\n           MOJO_RESULT_OK);\n  mp->Close(0);\n\n  read_buffer.resize(num_bytes);\n  CHECK_EQ(read_buffer, std::string(\"hello\"));\n  CHECK_EQ(num_dispatchers, 1u);\n\n  CHECK_EQ(dispatchers[0]->GetType(), Dispatcher::kTypePlatformHandle);\n\n  scoped_refptr<PlatformHandleDispatcher> dispatcher(\n      static_cast<PlatformHandleDispatcher*>(dispatchers[0].get()));\n  embedder::ScopedPlatformHandle h = dispatcher->PassPlatformHandle().Pass();\n  CHECK(h.is_valid());\n  dispatcher->Close();\n\n  base::ScopedFILE fp(mojo::test::FILEFromPlatformHandle(h.Pass(), \"r\"));\n  CHECK(fp);\n  std::string fread_buffer(100, '\\0');\n  size_t bytes_read = fread(&fread_buffer[0], 1, fread_buffer.size(), fp.get());\n  fread_buffer.resize(bytes_read);\n  CHECK_EQ(fread_buffer, \"world\");\n\n  return 0;\n}\n\n#if defined(OS_POSIX)\n#if defined(OS_MACOSX)\n\/\/ TODO(vtl): Apparently, cmsgs on SOCK_STREAM AF_UNIX sockets don't work the\n\/\/ way I thought they work, at least on Mac. (The non-control data gets merged\n\/\/ with subsequent data.)\n#define MAYBE_PlatformHandlePassing DISABLED_PlatformHandlePassing\n#else\n#define MAYBE_PlatformHandlePassing PlatformHandlePassing\n#endif\n#else\n\/\/ Not yet implemented (on Windows).\n#define MAYBE_PlatformHandlePassing DISABLED_PlatformHandlePassing\n#endif\nTEST_F(MultiprocessMessagePipeTest, MAYBE_PlatformHandlePassing) {\n  helper()->StartChild(\"CheckPlatformHandleFile\");\n\n  scoped_refptr<MessagePipe> mp(new MessagePipe(\n      scoped_ptr<MessagePipeEndpoint>(new LocalMessagePipeEndpoint()),\n      scoped_ptr<MessagePipeEndpoint>(new ProxyMessagePipeEndpoint())));\n  Init(mp);\n\n  base::FilePath unused;\n  base::ScopedFILE fp(CreateAndOpenTemporaryFile(&unused));\n  const std::string world(\"world\");\n  ASSERT_EQ(fwrite(&world[0], 1, world.size(), fp.get()), world.size());\n  fflush(fp.get());\n  rewind(fp.get());\n\n  embedder::ScopedPlatformHandle h(\n      mojo::test::PlatformHandleFromFILE(fp.Pass()));\n  scoped_refptr<PlatformHandleDispatcher> dispatcher(\n      new PlatformHandleDispatcher(h.Pass()));\n\n  const std::string hello(\"hello\");\n  DispatcherTransport transport(\n      test::DispatcherTryStartTransport(dispatcher.get()));\n  ASSERT_TRUE(transport.is_valid());\n\n  std::vector<DispatcherTransport> transports;\n  transports.push_back(transport);\n  EXPECT_EQ(MOJO_RESULT_OK,\n            mp->WriteMessage(0,\n                             &hello[0],\n                             static_cast<uint32_t>(hello.size()),\n                             &transports,\n                             MOJO_WRITE_MESSAGE_FLAG_NONE));\n  transport.End();\n\n  EXPECT_TRUE(dispatcher->HasOneRef());\n  dispatcher = NULL;\n\n  \/\/ Wait for it to become readable, which should fail.\n  EXPECT_EQ(MOJO_RESULT_FAILED_PRECONDITION,\n            WaitIfNecessary(mp, MOJO_WAIT_FLAG_READABLE));\n\n  mp->Close(0);\n\n  EXPECT_EQ(0, helper()->WaitForChildShutdown());\n}\n\n}  \/\/ namespace\n}  \/\/ namespace system\n}  \/\/ namespace mojo\n<|endoftext|>"}
{"text":"<commit_before>#include <ros\/ros.h>\n#include <ros\/package.h> \/\/ for getting file path for loadng images\n\n#include <moveit\/setup_assistant\/tools\/compute_default_collisions.h>\n#include <moveit\/setup_assistant\/tools\/moveit_config_data.h>\n\n#include <boost\/filesystem.hpp>  \/\/ for reading folders\/files\n#include <boost\/program_options.hpp>\n#include <boost\/algorithm\/string\/join.hpp>\n\n#include <fstream>  \/\/ for reading in urdf\n#include <streambuf>\n\nnamespace fs = boost::filesystem;\nnamespace po = boost::program_options;\n\nbool isXacroFile(const std::string& path) { return path.find(\".xacro\") != std::string::npos; } \/\/ TODO: implement case-insensitive search\n\nbool loadFileToString(std::string& buffer, const std::string& path){\n    if(path.empty()) return false;\n\n    std::ifstream stream( path.c_str() );\n    if( !stream.good()) return false;\n\n    \/\/ Load the file to a string using an efficient memory allocation technique\n    stream.seekg(0, std::ios::end);\n    buffer.reserve(stream.tellg());\n    stream.seekg(0, std::ios::beg);\n    buffer.assign( (std::istreambuf_iterator<char>(stream)), std::istreambuf_iterator<char>() );\n    stream.close();\n\n    return true;\n}\n\nbool loadXacroFileToString(std::string& buffer, const std::string& path, const std::vector<std::string> &xacro_args){\n    if(path.empty()) return false;\n\n    std::string cmd = \"rosrun xacro xacro \";\n    for(std::vector<std::string>::const_iterator it = xacro_args.begin(); it != xacro_args.end(); ++it)\n        cmd += *it + \" \";\n    cmd += path;\n\n    FILE* pipe = popen(cmd.c_str(), \"r\");\n    if (!pipe) return false;\n\n    char pipe_buffer[128];\n    while(!feof(pipe)){\n        if(fgets(pipe_buffer, 128, pipe) != NULL)\n                buffer += pipe_buffer;\n    }\n    pclose(pipe);\n\n    return true;\n}\n\nbool loadXmlFileToString(std::string& buffer, const std::string& path, const std::vector<std::string> &xacro_args){\n    if(isXacroFile(path)){\n        return loadXacroFileToString(buffer, path, xacro_args);\n    }else{\n        return loadFileToString(buffer, path);\n    }\n}\n\nclass SortableDisabledCollision {\n     const srdf::Model::DisabledCollision dc_;\n     const std::string key_;\npublic:\n    SortableDisabledCollision(const srdf::Model::DisabledCollision &dc)\n    : dc_(dc), key_(dc.link1_ < dc.link2_ ? (dc.link1_ + \"|\" + dc.link2_) : (dc.link2_ + \"|\" + dc.link1_)) {}\n    operator const srdf::Model::DisabledCollision () const { return dc_; }\n    bool operator < (const SortableDisabledCollision &other) const { return key_ < other.key_; }\n};\n\nclass CollisionUpdater{\n    moveit_setup_assistant::MoveItConfigData config_data;\npublic:\n    bool loadSetupAssistantConfig(const std::string &path){\n        config_data.config_pkg_path_ = path;\n\n        fs::path setup_assistant_file = config_data.config_pkg_path_;\n        setup_assistant_file \/= \".setup_assistant\";\n\n        if(!config_data.inputSetupAssistantYAML( setup_assistant_file.make_preferred().native().c_str() ) )\n            return false;\n\n        fs::path urdf_path;\n\n        if( config_data.urdf_pkg_name_.empty() || config_data.urdf_pkg_name_ == \"\\\"\\\"\" ){\n            urdf_path = config_data.urdf_pkg_relative_path_;\n        }else{\n            fs::path robot_desc_pkg_path = ros::package::getPath( config_data.urdf_pkg_name_ );\n            if( robot_desc_pkg_path.empty() ) return false;\n\n            urdf_path = robot_desc_pkg_path \/ config_data.urdf_pkg_relative_path_;\n        }\n        config_data.urdf_path_ = urdf_path.make_preferred().native();\n\n        fs::path srdf_path = config_data.config_pkg_path_ ;\n        srdf_path \/= config_data.srdf_pkg_relative_path_;\n        config_data.srdf_path_ = srdf_path.make_preferred().native();\n\n        return true;\n    }\n\n    void setURDF(const std::string &path) {\n        if(!path.empty()) config_data.urdf_path_ = path;\n    }\n    void setSRDF(const std::string &path) {\n        if(!path.empty()) config_data.srdf_path_ = path;\n    }\n\n    bool setup(bool keep_old, const std::vector<std::string> &xacro_args){\n        std::string urdf_string;\n        if(!loadXmlFileToString(urdf_string, config_data.urdf_path_, xacro_args)) return false;\n        if(!config_data.urdf_model_->initString( urdf_string))return false;\n\n        std::string srdf_string;\n        if(!loadXmlFileToString(srdf_string, config_data.srdf_path_, xacro_args)) return false;\n        if(!config_data.srdf_->initString( *config_data.urdf_model_, srdf_string)) return false;\n\n\n        if(!keep_old) config_data.srdf_->disabled_collisions_.clear();\n\n        return true;\n    }\n\n    moveit_setup_assistant::LinkPairMap compute(uint32_t trials, double min_collision_fraction,  bool verbose){\n        unsigned int collision_progress;\n        return moveit_setup_assistant::computeDefaultCollisions(config_data.getPlanningScene(),\n                                                                &collision_progress,\n                                                                trials > 0,\n                                                                trials,\n                                                                min_collision_fraction, verbose);\n    }\n\n    void write(const moveit_setup_assistant::LinkPairMap &link_pairs, bool include_default, bool include_always, const std::string &output_path){\n        \/\/ Create temp disabled collision\n        srdf::Model::DisabledCollision dc;\n\n        std::set<SortableDisabledCollision> disabled_collisions;\n        disabled_collisions.insert(config_data.srdf_->disabled_collisions_.begin(), config_data.srdf_->disabled_collisions_.end());\n\n        \/\/ copy the data in this class's LinkPairMap datastructure to srdf::Model::DisabledCollision format\n        for ( moveit_setup_assistant::LinkPairMap::const_iterator pair_it = link_pairs.begin();\n                pair_it != link_pairs.end(); ++pair_it)\n        {\n            \/\/ Only copy those that are actually disabled\n            if( pair_it->second.disable_check ){\n                if( pair_it->second.reason == moveit_setup_assistant::DEFAULT && !include_default) continue;\n                if( pair_it->second.reason == moveit_setup_assistant::ALWAYS && !include_always) continue;\n                dc.link1_ = pair_it->first.first;\n                dc.link2_ = pair_it->first.second;\n                dc.reason_ = moveit_setup_assistant::disabledReasonToString( pair_it->second.reason );\n                disabled_collisions.insert(SortableDisabledCollision(dc));\n            }\n        }\n\n        config_data.srdf_->disabled_collisions_.assign(disabled_collisions.begin(), disabled_collisions.end());\n\n        \/\/ Update collision_matrix for robot pose's use\n        config_data.loadAllowedCollisionMatrix();\n\n        config_data.srdf_->writeSRDF(output_path.empty() ? config_data.srdf_path_ : output_path );\n\n    }\n\n};\n\nint main(int argc, char * argv[]){\n\n    std::string config_pkg_path;\n    std::string urdf_path;\n    std::string srdf_path;\n\n    std::string output_path;\n\n    bool include_default = false, include_always = false, keep_old = false, verbose = false;\n\n    double min_collision_fraction = 1.0;\n\n    uint32_t never_trials = 0;\n\n    po::options_description desc(\"Allowed options\");\n    desc.add_options()\n        (\"help\", \"show help\")\n        (\"config-pkg\", po::value(&config_pkg_path), \"path to moveit config package\")\n        (\"urdf\", po::value(&urdf_path), \"path to URDF ( or xacro)\")\n        (\"srdf\", po::value(&srdf_path), \"path to SRDF ( or xacro)\")\n        (\"output\", po::value(&output_path), \"output path for SRDF\")\n\n        (\"xacro-args\", po::value<std::vector<std::string> >()->composing(), \"additional arguments for xacro\")\n\n        (\"default\", po::bool_switch(&include_default),  \"disable default colliding pairs\")\n        (\"always\", po::bool_switch(&include_always),  \"disable always colliding pairs\")\n\n        (\"keep\", po::bool_switch(&keep_old),  \"keep disabled link from SRDF\")\n        (\"verbose\", po::bool_switch(&verbose),  \"verbose output\")\n\n        (\"trials\", po::value(&never_trials),  \"number of trials for searching never colliding pairs\")\n        (\"min-collision-fraction\", po::value(&min_collision_fraction),  \"fraction of small sample size to determine links that are alwas colliding\")\n      ;\n\n    po::positional_options_description pos_desc;\n    pos_desc.add(\"xacro-args\", -1);\n\n    po::variables_map vm;\n    po::store(po::command_line_parser(argc, argv).options(desc).positional(pos_desc).run(), vm);\n    po::notify(vm);\n\n    if (vm.count(\"help\")) {\n        std::cout << desc << std::endl;\n        return 1;\n    }\n\n    CollisionUpdater updater;\n\n    if(!config_pkg_path.empty()){\n        if(!updater.loadSetupAssistantConfig(config_pkg_path)){\n            std::cerr << \"Could not load config at '\" << config_pkg_path << \"'\" << std::endl;\n            return 1;\n        }\n    }else if (urdf_path.empty() || srdf_path.empty()){\n            std::cerr << \"Please provide config package or URDF and SRDF path\" << std::endl;\n            return 1;\n    }\n\n    updater.setURDF(urdf_path);\n    updater.setSRDF(srdf_path);\n\n    std::vector<std::string> xacro_args;\n    if(vm.count(\"xacro-args\")) xacro_args = vm[\"xacro-args\"].as<std::vector<std::string> >();\n\n    if(!updater.setup(keep_old, xacro_args)){\n        std::cerr << \"Could not setup updater\" << std::endl;\n        return 1;\n    }\n\n    moveit_setup_assistant::LinkPairMap link_pairs = updater.compute(never_trials, min_collision_fraction,verbose);\n\n    updater.write(link_pairs, include_default, include_always, output_path);\n\n\n    return 0;\n}\n<commit_msg>require output path to be set if SRDF path is overwritten by a xacro file path<commit_after>#include <ros\/ros.h>\n#include <ros\/package.h> \/\/ for getting file path for loadng images\n\n#include <moveit\/setup_assistant\/tools\/compute_default_collisions.h>\n#include <moveit\/setup_assistant\/tools\/moveit_config_data.h>\n\n#include <boost\/filesystem.hpp>  \/\/ for reading folders\/files\n#include <boost\/program_options.hpp>\n#include <boost\/algorithm\/string\/join.hpp>\n\n#include <fstream>  \/\/ for reading in urdf\n#include <streambuf>\n\nnamespace fs = boost::filesystem;\nnamespace po = boost::program_options;\n\nbool isXacroFile(const std::string& path) { return path.find(\".xacro\") != std::string::npos; } \/\/ TODO: implement case-insensitive search\n\nbool loadFileToString(std::string& buffer, const std::string& path){\n    if(path.empty()) return false;\n\n    std::ifstream stream( path.c_str() );\n    if( !stream.good()) return false;\n\n    \/\/ Load the file to a string using an efficient memory allocation technique\n    stream.seekg(0, std::ios::end);\n    buffer.reserve(stream.tellg());\n    stream.seekg(0, std::ios::beg);\n    buffer.assign( (std::istreambuf_iterator<char>(stream)), std::istreambuf_iterator<char>() );\n    stream.close();\n\n    return true;\n}\n\nbool loadXacroFileToString(std::string& buffer, const std::string& path, const std::vector<std::string> &xacro_args){\n    if(path.empty()) return false;\n\n    std::string cmd = \"rosrun xacro xacro \";\n    for(std::vector<std::string>::const_iterator it = xacro_args.begin(); it != xacro_args.end(); ++it)\n        cmd += *it + \" \";\n    cmd += path;\n\n    FILE* pipe = popen(cmd.c_str(), \"r\");\n    if (!pipe) return false;\n\n    char pipe_buffer[128];\n    while(!feof(pipe)){\n        if(fgets(pipe_buffer, 128, pipe) != NULL)\n                buffer += pipe_buffer;\n    }\n    pclose(pipe);\n\n    return true;\n}\n\nbool loadXmlFileToString(std::string& buffer, const std::string& path, const std::vector<std::string> &xacro_args){\n    if(isXacroFile(path)){\n        return loadXacroFileToString(buffer, path, xacro_args);\n    }else{\n        return loadFileToString(buffer, path);\n    }\n}\n\nclass SortableDisabledCollision {\n     const srdf::Model::DisabledCollision dc_;\n     const std::string key_;\npublic:\n    SortableDisabledCollision(const srdf::Model::DisabledCollision &dc)\n    : dc_(dc), key_(dc.link1_ < dc.link2_ ? (dc.link1_ + \"|\" + dc.link2_) : (dc.link2_ + \"|\" + dc.link1_)) {}\n    operator const srdf::Model::DisabledCollision () const { return dc_; }\n    bool operator < (const SortableDisabledCollision &other) const { return key_ < other.key_; }\n};\n\nclass CollisionUpdater{\n    moveit_setup_assistant::MoveItConfigData config_data;\npublic:\n    bool loadSetupAssistantConfig(const std::string &path){\n        config_data.config_pkg_path_ = path;\n\n        fs::path setup_assistant_file = config_data.config_pkg_path_;\n        setup_assistant_file \/= \".setup_assistant\";\n\n        if(!config_data.inputSetupAssistantYAML( setup_assistant_file.make_preferred().native().c_str() ) )\n            return false;\n\n        fs::path urdf_path;\n\n        if( config_data.urdf_pkg_name_.empty() || config_data.urdf_pkg_name_ == \"\\\"\\\"\" ){\n            urdf_path = config_data.urdf_pkg_relative_path_;\n        }else{\n            fs::path robot_desc_pkg_path = ros::package::getPath( config_data.urdf_pkg_name_ );\n            if( robot_desc_pkg_path.empty() ) return false;\n\n            urdf_path = robot_desc_pkg_path \/ config_data.urdf_pkg_relative_path_;\n        }\n        config_data.urdf_path_ = urdf_path.make_preferred().native();\n\n        fs::path srdf_path = config_data.config_pkg_path_ ;\n        srdf_path \/= config_data.srdf_pkg_relative_path_;\n        config_data.srdf_path_ = srdf_path.make_preferred().native();\n\n        return true;\n    }\n\n    void setURDF(const std::string &path) {\n        if(!path.empty()) config_data.urdf_path_ = path;\n    }\n    void setSRDF(const std::string &path) {\n        if(!path.empty()) config_data.srdf_path_ = path;\n    }\n\n    bool setup(bool keep_old, const std::vector<std::string> &xacro_args){\n        std::string urdf_string;\n        if(!loadXmlFileToString(urdf_string, config_data.urdf_path_, xacro_args)) return false;\n        if(!config_data.urdf_model_->initString( urdf_string))return false;\n\n        std::string srdf_string;\n        if(!loadXmlFileToString(srdf_string, config_data.srdf_path_, xacro_args)) return false;\n        if(!config_data.srdf_->initString( *config_data.urdf_model_, srdf_string)) return false;\n\n\n        if(!keep_old) config_data.srdf_->disabled_collisions_.clear();\n\n        return true;\n    }\n\n    moveit_setup_assistant::LinkPairMap compute(uint32_t trials, double min_collision_fraction,  bool verbose){\n        unsigned int collision_progress;\n        return moveit_setup_assistant::computeDefaultCollisions(config_data.getPlanningScene(),\n                                                                &collision_progress,\n                                                                trials > 0,\n                                                                trials,\n                                                                min_collision_fraction, verbose);\n    }\n\n    void write(const moveit_setup_assistant::LinkPairMap &link_pairs, bool include_default, bool include_always, const std::string &output_path){\n        \/\/ Create temp disabled collision\n        srdf::Model::DisabledCollision dc;\n\n        std::set<SortableDisabledCollision> disabled_collisions;\n        disabled_collisions.insert(config_data.srdf_->disabled_collisions_.begin(), config_data.srdf_->disabled_collisions_.end());\n\n        \/\/ copy the data in this class's LinkPairMap datastructure to srdf::Model::DisabledCollision format\n        for ( moveit_setup_assistant::LinkPairMap::const_iterator pair_it = link_pairs.begin();\n                pair_it != link_pairs.end(); ++pair_it)\n        {\n            \/\/ Only copy those that are actually disabled\n            if( pair_it->second.disable_check ){\n                if( pair_it->second.reason == moveit_setup_assistant::DEFAULT && !include_default) continue;\n                if( pair_it->second.reason == moveit_setup_assistant::ALWAYS && !include_always) continue;\n                dc.link1_ = pair_it->first.first;\n                dc.link2_ = pair_it->first.second;\n                dc.reason_ = moveit_setup_assistant::disabledReasonToString( pair_it->second.reason );\n                disabled_collisions.insert(SortableDisabledCollision(dc));\n            }\n        }\n\n        config_data.srdf_->disabled_collisions_.assign(disabled_collisions.begin(), disabled_collisions.end());\n\n        \/\/ Update collision_matrix for robot pose's use\n        config_data.loadAllowedCollisionMatrix();\n\n        config_data.srdf_->writeSRDF(output_path.empty() ? config_data.srdf_path_ : output_path );\n\n    }\n\n};\n\nint main(int argc, char * argv[]){\n\n    std::string config_pkg_path;\n    std::string urdf_path;\n    std::string srdf_path;\n\n    std::string output_path;\n\n    bool include_default = false, include_always = false, keep_old = false, verbose = false;\n\n    double min_collision_fraction = 1.0;\n\n    uint32_t never_trials = 0;\n\n    po::options_description desc(\"Allowed options\");\n    desc.add_options()\n        (\"help\", \"show help\")\n        (\"config-pkg\", po::value(&config_pkg_path), \"path to moveit config package\")\n        (\"urdf\", po::value(&urdf_path), \"path to URDF ( or xacro)\")\n        (\"srdf\", po::value(&srdf_path), \"path to SRDF ( or xacro)\")\n        (\"output\", po::value(&output_path), \"output path for SRDF\")\n\n        (\"xacro-args\", po::value<std::vector<std::string> >()->composing(), \"additional arguments for xacro\")\n\n        (\"default\", po::bool_switch(&include_default),  \"disable default colliding pairs\")\n        (\"always\", po::bool_switch(&include_always),  \"disable always colliding pairs\")\n\n        (\"keep\", po::bool_switch(&keep_old),  \"keep disabled link from SRDF\")\n        (\"verbose\", po::bool_switch(&verbose),  \"verbose output\")\n\n        (\"trials\", po::value(&never_trials),  \"number of trials for searching never colliding pairs\")\n        (\"min-collision-fraction\", po::value(&min_collision_fraction),  \"fraction of small sample size to determine links that are alwas colliding\")\n      ;\n\n    po::positional_options_description pos_desc;\n    pos_desc.add(\"xacro-args\", -1);\n\n    po::variables_map vm;\n    po::store(po::command_line_parser(argc, argv).options(desc).positional(pos_desc).run(), vm);\n    po::notify(vm);\n\n    if (vm.count(\"help\")) {\n        std::cout << desc << std::endl;\n        return 1;\n    }\n\n    CollisionUpdater updater;\n\n    if(!config_pkg_path.empty()){\n        if(!updater.loadSetupAssistantConfig(config_pkg_path)){\n            std::cerr << \"Could not load config at '\" << config_pkg_path << \"'\" << std::endl;\n            return 1;\n        }\n    }else if (urdf_path.empty() || srdf_path.empty()){\n        std::cerr << \"Please provide config package or URDF and SRDF path\" << std::endl;\n        return 1;\n    }else if(isXacroFile(srdf_path) && output_path.empty()){\n        std::cerr << \"Please provide a different output file for SRDF xacro input file\" << std::endl;\n        return 1;\n    }\n\n    updater.setURDF(urdf_path);\n    updater.setSRDF(srdf_path);\n\n    std::vector<std::string> xacro_args;\n    if(vm.count(\"xacro-args\")) xacro_args = vm[\"xacro-args\"].as<std::vector<std::string> >();\n\n    if(!updater.setup(keep_old, xacro_args)){\n        std::cerr << \"Could not setup updater\" << std::endl;\n        return 1;\n    }\n\n    moveit_setup_assistant::LinkPairMap link_pairs = updater.compute(never_trials, min_collision_fraction,verbose);\n\n    updater.write(link_pairs, include_default, include_always, output_path);\n\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma sw require header pub.egorpugin.primitives.tools.embedder-master\n#pragma sw require header org.sw.demo.lexxmark.winflexbison.bison-master\n\nvoid configure(Solution &s)\n{\n    s.Settings.Native.LibrariesType = LibraryType::Static;\n    s.Settings.Native.ConfigurationType = ConfigurationType::ReleaseWithDebugInformation;\n}\n\nvoid build(Solution &s)\n{\n    auto &p = s.addProject(\"cppan\", \"master\");\n    p += Git(\"https:\/\/github.com\/cppan\/cppan\", \"\", \"v1\");\n\n    auto &common = p.addTarget<StaticLibraryTarget>(\"common\");\n    common.CPPVersion = CPPLanguageStandard::CPP17;\n    common +=\n        \"src\/common\/.*\"_rr,\n        \"src\/printers\/.*\"_rr,\n        \"src\/comments\/.*\"_rr,\n        \"src\/bazel\/.*\"_rr,\n        \"src\/inserts\/.*\"_rr,\n        \"src\/support\/.*\"_rr,\n        \"src\/gen\/.*\"_rr;\n\n    common -= \"src\/bazel\/test\/test.cpp\", \"src\/gen\/.*\"_rr;\n    common.Public += \"src\"_id, \"src\/common\"_id, \"src\/support\"_id;\n\n    common.Public += \"VERSION_MAJOR=0\"_d;\n    common.Public += \"VERSION_MINOR=2\"_d;\n    common.Public += \"VERSION_PATCH=5\"_d;\n    common.Public += \"BUILD_NUMBER=0\"_d;\n    common.Public += \"CPPAN_VERSION_STRING=0.2.5\"_d;\n    if (s.Settings.TargetOS.Type == OSType::Windows)\n        common.Public += \"UNICODE\"_d;\n\n    common.Public +=\n        \"org.sw.demo.boost.optional-1\"_dep,\n        \"org.sw.demo.boost.property_tree-1\"_dep,\n        \"org.sw.demo.boost.variant-1\"_dep,\n        \"org.sw.demo.boost.stacktrace-1\"_dep,\n        \/\/\"org.sw.demo.apolukhin.stacktrace-master\"_dep,\n        \"org.sw.demo.sqlite3-3\"_dep,\n        \"org.sw.demo.fmt-*\"_dep,\n        \"org.sw.demo.imageworks.pystring-1\"_dep,\n        \"org.sw.demo.giovannidicanio.winreg-master\"_dep,\n\n        \"pub.egorpugin.primitives.string-master\"_dep,\n        \"pub.egorpugin.primitives.filesystem-master\"_dep,\n        \"pub.egorpugin.primitives.context-master\"_dep,\n        \"pub.egorpugin.primitives.date_time-master\"_dep,\n        \"pub.egorpugin.primitives.executor-master\"_dep,\n        \"pub.egorpugin.primitives.hash-master\"_dep,\n        \"pub.egorpugin.primitives.http-master\"_dep,\n        \"pub.egorpugin.primitives.lock-master\"_dep,\n        \"pub.egorpugin.primitives.log-master\"_dep,\n        \"pub.egorpugin.primitives.pack-master\"_dep,\n        \"pub.egorpugin.primitives.patch-master\"_dep,\n        \"pub.egorpugin.primitives.command-master\"_dep,\n        \"pub.egorpugin.primitives.win32helpers-master\"_dep,\n        \"pub.egorpugin.primitives.yaml-master\"_dep;\n\n    time_t v;\n    time(&v);\n    common.fileWriteSafe(\"stamp.h.in\", \"\\\"\" + std::to_string(v) + \"\\\"\", true);\n    embed(common, \"src\/inserts\/inserts.cpp.in\");\n\n    \/\/ at the moment flex&bison generated files are present in the build tree,\n    \/\/ so build passes without generation stage\n\n    \/*auto flex_bison = [&common](const std::string &name)\n    {\n        fs::create_directories(common.BinaryDir \/ (\"src\/\" + name));\n\n        \/\/ flex\/bison\n        {\n            auto c = std::make_shared<Command>();\n            c->program = \"bison.exe\";\n            c->args.push_back(\"-d\");\n            c->args.push_back(\"-o\" + (common.BinaryDir \/ (\"src\/\" + name + \"\/grammar.cpp\")).string());\n            c->args.push_back((common.SourceDir \/ (\"src\/\" + name + \"\/grammar.yy\")).string());\n            c->addInput(common.SourceDir \/ (\"src\/\" + name + \"\/grammar.yy\"));\n            c->addOutput(common.BinaryDir \/ (\"src\/\" + name + \"\/grammar.cpp\"));\n            common += path(common.BinaryDir \/ (\"src\/\" + name + \"\/grammar.cpp\"));\n        }\n        {\n            auto c = std::make_shared<Command>();\n            c->program = \"flex.exe\";\n            c->args.push_back(\"--header-file=\" + (common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.h\")).string());\n            c->args.push_back(\"-o\" + (common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.cpp\")).string());\n            c->args.push_back((common.SourceDir \/ (\"src\/\" + name + \"\/lexer.ll\")).string());\n            c->addInput(common.SourceDir \/ (\"src\/\" + name + \"\/lexer.ll\"));\n            c->addOutput(common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.h\"));\n            c->addOutput(common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.cpp\"));\n            common += path(common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.cpp\"));\n        }\n    };*\/\n\n    \/\/flex_bison(\"bazel\");\n    \/\/flex_bison(\"comments\");\n\n    auto &client = p.addTarget<ExecutableTarget>(\"client\");\n    client.CPPVersion = CPPLanguageStandard::CPP17;\n    client += \"src\/client\/.*\"_rr, common,\n        \"pub.egorpugin.primitives.sw.main-master\"_dep,\n        \"org.sw.demo.boost.program_options-1\"_dep,\n        \"org.sw.demo.yhirose.cpp_linenoise-master\"_dep;\n}\n<commit_msg>Fix sw build.<commit_after>#pragma sw require header pub.egorpugin.primitives.tools.embedder-master\n\/\/#pragma sw require header org.sw.demo.lexxmark.winflexbison.bison-master\n\nvoid configure(Solution &s)\n{\n    s.Settings.Native.LibrariesType = LibraryType::Static;\n    s.Settings.Native.ConfigurationType = ConfigurationType::ReleaseWithDebugInformation;\n}\n\nvoid build(Solution &s)\n{\n    auto &p = s.addProject(\"cppan\", \"master\");\n    p += Git(\"https:\/\/github.com\/cppan\/cppan\", \"\", \"v1\");\n\n    auto &common = p.addTarget<StaticLibraryTarget>(\"common\");\n    common.CPPVersion = CPPLanguageStandard::CPP17;\n    common +=\n        \"src\/common\/.*\"_rr,\n        \"src\/printers\/.*\"_rr,\n        \"src\/comments\/.*\"_rr,\n        \"src\/bazel\/.*\"_rr,\n        \"src\/inserts\/.*\"_rr,\n        \"src\/support\/.*\"_rr,\n        \"src\/gen\/.*\"_rr;\n\n    common -= \"src\/bazel\/test\/test.cpp\", \"src\/gen\/.*\"_rr;\n    common.Public += \"src\"_id, \"src\/common\"_id, \"src\/support\"_id;\n\n    common.Public += \"VERSION_MAJOR=0\"_d;\n    common.Public += \"VERSION_MINOR=2\"_d;\n    common.Public += \"VERSION_PATCH=5\"_d;\n    common.Public += \"BUILD_NUMBER=0\"_d;\n    common.Public += \"CPPAN_VERSION_STRING=0.2.5\"_d;\n    if (s.Settings.TargetOS.Type == OSType::Windows)\n        common.Public += \"UNICODE\"_d;\n\n    common.Public +=\n        \"org.sw.demo.boost.optional-1\"_dep,\n        \"org.sw.demo.boost.property_tree-1\"_dep,\n        \"org.sw.demo.boost.variant-1\"_dep,\n        \"org.sw.demo.boost.stacktrace-1\"_dep,\n        \/\/\"org.sw.demo.apolukhin.stacktrace-master\"_dep,\n        \"org.sw.demo.sqlite3-3\"_dep,\n        \"org.sw.demo.fmt-*\"_dep,\n        \"org.sw.demo.imageworks.pystring-1\"_dep,\n        \"org.sw.demo.giovannidicanio.winreg-master\"_dep,\n\n        \"pub.egorpugin.primitives.string-master\"_dep,\n        \"pub.egorpugin.primitives.filesystem-master\"_dep,\n        \"pub.egorpugin.primitives.context-master\"_dep,\n        \"pub.egorpugin.primitives.date_time-master\"_dep,\n        \"pub.egorpugin.primitives.executor-master\"_dep,\n        \"pub.egorpugin.primitives.hash-master\"_dep,\n        \"pub.egorpugin.primitives.http-master\"_dep,\n        \"pub.egorpugin.primitives.lock-master\"_dep,\n        \"pub.egorpugin.primitives.log-master\"_dep,\n        \"pub.egorpugin.primitives.pack-master\"_dep,\n        \"pub.egorpugin.primitives.patch-master\"_dep,\n        \"pub.egorpugin.primitives.command-master\"_dep,\n        \"pub.egorpugin.primitives.win32helpers-master\"_dep,\n        \"pub.egorpugin.primitives.yaml-master\"_dep;\n\n    time_t v;\n    time(&v);\n    common.writeFileSafe(\"stamp.h.in\", \"\\\"\" + std::to_string(v) + \"\\\"\");\n    embed(\"pub.egorpugin.primitives.tools.embedder-master\"_dep, common, \"src\/inserts\/inserts.cpp.in\");\n\n    \/\/ at the moment flex&bison generated files are present in the build tree,\n    \/\/ so build passes without generation stage\n\n    \/*auto flex_bison = [&common](const std::string &name)\n    {\n        fs::create_directories(common.BinaryDir \/ (\"src\/\" + name));\n\n        \/\/ flex\/bison\n        {\n            auto c = std::make_shared<Command>();\n            c->program = \"bison.exe\";\n            c->args.push_back(\"-d\");\n            c->args.push_back(\"-o\" + (common.BinaryDir \/ (\"src\/\" + name + \"\/grammar.cpp\")).string());\n            c->args.push_back((common.SourceDir \/ (\"src\/\" + name + \"\/grammar.yy\")).string());\n            c->addInput(common.SourceDir \/ (\"src\/\" + name + \"\/grammar.yy\"));\n            c->addOutput(common.BinaryDir \/ (\"src\/\" + name + \"\/grammar.cpp\"));\n            common += path(common.BinaryDir \/ (\"src\/\" + name + \"\/grammar.cpp\"));\n        }\n        {\n            auto c = std::make_shared<Command>();\n            c->program = \"flex.exe\";\n            c->args.push_back(\"--header-file=\" + (common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.h\")).string());\n            c->args.push_back(\"-o\" + (common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.cpp\")).string());\n            c->args.push_back((common.SourceDir \/ (\"src\/\" + name + \"\/lexer.ll\")).string());\n            c->addInput(common.SourceDir \/ (\"src\/\" + name + \"\/lexer.ll\"));\n            c->addOutput(common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.h\"));\n            c->addOutput(common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.cpp\"));\n            common += path(common.BinaryDir \/ (\"src\/\" + name + \"\/lexer.cpp\"));\n        }\n    };*\/\n\n    \/\/flex_bison(\"bazel\");\n    \/\/flex_bison(\"comments\");\n\n    auto &client = p.addTarget<ExecutableTarget>(\"client\");\n    client.CPPVersion = CPPLanguageStandard::CPP17;\n    client += \"src\/client\/.*\"_rr, common,\n        \"pub.egorpugin.primitives.sw.main-master\"_dep,\n        \"org.sw.demo.boost.program_options-1\"_dep,\n        \"org.sw.demo.yhirose.cpp_linenoise-master\"_dep;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-Mode: c++;-*-\n   Copyright (c) 2003-2008 John Plevyak, All Rights Reserved\n*\/\n#include \"ifadefs.h\"\n#include \"ast.h\"\n#include \"if1.h\"\n#include \"fa.h\"\n#include \"builtin.h\"\n\ncchar *type_kind_string[] = {\n  \"NONE\", \"UNKNOWN\", \"SUM\", \"RECORD\", \"VECTOR\", \"FUN\", \"REF\", \"ENUM\", \"PRIMITIVE\", \"APPLICATION\", \"VARIABLE\", \"ALIAS\"};\n\nBasicSym::BasicSym(void) :\n  name(NULL),\n  in(NULL),\n  type(NULL),\n  aspect(NULL),\n  must_specialize(NULL),\n  must_implement(NULL),\n  ast(NULL),\n  var(NULL),\n  asymbol(NULL),\n  nesting_depth(0),\n  cg_string(NULL),\n  llvm_value(NULL),\n  is_builtin(0),\n  is_read_only(0),\n  is_constant(0),\n  is_lvalue(0),\n  is_local(0),\n  is_default_arg(0),\n  is_exact_match(0),\n  is_module(0),\n  is_fun(0),\n  is_symbol(0),\n  is_pattern(0),\n  is_rest(0),\n  is_generic(0),\n  is_external(0),\n  is_this(0),\n  is_fake(0),\n  intent(0),\n  is_meta_type(0),\n  is_unique_type(0),\n  is_value_type(0),\n  is_system_type(0),\n  is_union_type(0),\n  is_structure(0),\n  is_vector(0),\n  fun_returns_value(0),\n  live(0),\n  type_kind(0),\n  num_kind(0),\n  num_index(0),\n  clone_for_constants(0),\n  dispatch_types_built(0),\n  type_live(0)\n{}\n\n\nSym::Sym() :\n  constant(NULL),\n  size(0),\n  alignment(0),\n  scope(NULL),\n  labelmap(NULL),\n  fun(NULL),\n  code(NULL),\n  self(NULL),\n  ret(NULL),\n  cont(NULL),\n  instantiates(NULL),\n  match_type(NULL),\n  abstract_type(NULL),\n  alias(NULL),\n  init(NULL),\n  meta_type(NULL),\n#ifdef CONSTANT_TYPES\n  constant_type(NULL),\n#endif\n  element(NULL),\n  temp(NULL),\n  llvm_type(NULL)\n{}\n\ncchar *\nSym::pathname() {\n  cchar *p = 0;\n  if (asymbol)\n    p = asymbol->pathname();\n  if (!p && ast)\n    p = ast->pathname();\n  if (p)\n    return p;\n  return \"<unknown>\";\n}\n\ncchar *\nSym::has_name(int i) {\n  if (i < has_names.n)\n    return has_names[i];\n  return 0;\n}\n\ncchar *\nSym::filename() {\n  cchar *fn = pathname();\n  cchar *r = strrchr(fn, '\/');\n  if (r) return r+1; else return fn;\n}\n\nint\nSym::line() {\n  int l = 0;\n  if (asymbol)\n    l = asymbol->line();\n  if (!l && ast)\n    l = ast->line();\n  return l;\n}\n\nint\nSym::source_line() {\n  int l = 0;\n  if (asymbol)\n    l = asymbol->source_line();\n  if (!l && ast)\n    l = ast->source_line();\n  return l;\n}\n\nvoid\nSym::copy_values(Sym *s) {\n  int temp_id = id;\n  *this = *s;\n  id = temp_id;\n}\n\nSym *\nSym::clone() {\n  if (asymbol)\n    return asymbol->clone();\n  Sym *new_sym = copy();\n  return new_sym;\n}\n\nSym *\nSym::copy() {\n  Sym *s = new_Sym();\n  s->copy_values(this);\n  if (s->element)\n    s->element = s->element->copy();\n  return s;\n}\n\nint\ncompar_syms(const void *ai, const void *aj) {\n  uint32 i = (*(Sym**)ai)->id;\n  uint32 j = (*(Sym**)aj)->id;\n  return (i > j) ? 1 : ((i < j) ? -1 : 0);\n}\n\nint\nSym::imm_int(int *result) {\n  int i = 0;\n  switch (type->num_kind) {\n    default: return -1;\n    case IF1_NUM_KIND_UINT: {\n      switch (type->num_index) {\n        case IF1_INT_TYPE_8:  i = imm.v_uint8; break;\n        case IF1_INT_TYPE_16: i = imm.v_uint16; break;\n        case IF1_INT_TYPE_32: i = imm.v_uint32; break;\n        case IF1_INT_TYPE_64: i = imm.v_uint64; break;\n        default: return -1;\n      }\n      break;\n    }\n    case IF1_NUM_KIND_INT: {\n      switch (type->num_index) {\n        case IF1_INT_TYPE_8:  i = imm.v_int8; break;\n        case IF1_INT_TYPE_16: i = imm.v_int16; break;\n        case IF1_INT_TYPE_32: i = imm.v_int32; break;\n        case IF1_INT_TYPE_64: i = imm.v_int64; break;\n        default: return -1;\n      }\n      break;\n    }\n  }\n  *result = i;\n  return 0;\n}\n\nSym *\nunalias_type(Sym *s) {\n  if (!s)\n    return s;\n  if (s->type_kind == Type_ALIAS) {\n    Vec<Sym *> aliases;\n    do {\n      if (!s->alias)\n        return 0;\n      Sym *ss = s->alias;\n      if (aliases.set_in(ss))\n        fail(\"circular type alias\");\n      aliases.set_add(ss);\n      s = ss;\n    } while (s->type_kind == Type_ALIAS);\n  }\n  return s;\n}\n\nvoid\nif1_set_int_type(IF1 *p, Sym *t, int signd, int size) {    \n  int ss = 0;\n  size >>= 3;\n  while (size) { ss++; size >>= 1; }\n  p->int_types[ss][signd] = t;\n  t->num_kind = signd ? IF1_NUM_KIND_INT : IF1_NUM_KIND_UINT;\n  t->num_index = ss;\n}\n\nvoid\nif1_set_float_type(IF1 *p, Sym *t, int size) {\n  int ss = 0;\n  size >>= 4;\n  ss = size - 1;\n  p->float_types[ss] = t;\n  t->num_kind = IF1_NUM_KIND_FLOAT;\n  t->num_index = ss;\n}\n\nvoid\nif1_set_complex_type(IF1 *p, Sym *t, int size) {\n  int ss = 0;\n  size >>= 4;\n  ss = size - 1;\n  p->complex_types[ss] = t;\n  t->num_kind = IF1_NUM_KIND_COMPLEX;\n  t->num_index = ss;\n}\n\nint\nif1_numeric_size(IF1 *p, Sym *t) {\n  switch (t->num_kind) {\n    case IF1_NUM_KIND_NONE: assert(!\"bad case\"); break;\n    case IF1_NUM_KIND_INT:\n    case IF1_NUM_KIND_UINT:\n      if (!t->num_index) return sizeof(bool);\n      return 1 << ((t->num_index ? t->num_index : 1) - 1);\n    case IF1_NUM_KIND_FLOAT:\n      return 2 + (2 * t->num_index);\n    case IF1_NUM_KIND_COMPLEX:\n      return 2 * (2 + (2 * t->num_index));\n  }\n  return 0;\n}\n\n#define MAKE_ALIGNOF(_t) \\\nstruct AlignOf##_t {      \\\n  char a;                \\\n  _t b;                  \\\n}\n\n#define ALIGNOF(_t) ((int)(intptr_t)&(((struct AlignOf##_t *)0)->b))\n\nMAKE_ALIGNOF(bool);\nMAKE_ALIGNOF(uint8);\nMAKE_ALIGNOF(uint16);\nMAKE_ALIGNOF(uint32);\nMAKE_ALIGNOF(uint64);\nMAKE_ALIGNOF(float32);\nMAKE_ALIGNOF(float64);\nMAKE_ALIGNOF(float128);\nMAKE_ALIGNOF(complex32);\nMAKE_ALIGNOF(complex64);\ntypedef char *alignstring;\nMAKE_ALIGNOF(alignstring);\n\nint \nif1_numeric_alignment(IF1 *p, Sym *t) {\n  int res = -1;\n  switch (t->num_kind) {\n    default: assert(!\"case\"); break;\n    case IF1_NUM_KIND_UINT:\n    case IF1_NUM_KIND_INT:\n      switch (t->num_index) {\n        case IF1_INT_TYPE_1: return ALIGNOF(bool); break;\n        case IF1_INT_TYPE_8: return ALIGNOF(uint8); break;\n        case IF1_INT_TYPE_16: return ALIGNOF(uint16); break;\n        case IF1_INT_TYPE_32: return ALIGNOF(uint32); break;\n        case IF1_INT_TYPE_64: return ALIGNOF(uint64); break;\n        default: assert(!\"case\");\n      }\n      break;\n    case IF1_NUM_KIND_FLOAT:\n      switch (t->num_index) {\n        case IF1_FLOAT_TYPE_32:  return ALIGNOF(float32);\n        case IF1_FLOAT_TYPE_64:  return ALIGNOF(float64);\n        case IF1_FLOAT_TYPE_128: return ALIGNOF(float128);\n        default: assert(!\"case\");\n      }\n      break;\n    case IF1_NUM_KIND_COMPLEX:\n      switch (t->num_index) {\n        case IF1_FLOAT_TYPE_32: return ALIGNOF(complex32);\n        case IF1_FLOAT_TYPE_64: return ALIGNOF(complex64);\n        default: assert(!\"case\");\n      }\n      break;\n    case IF1_CONST_KIND_STRING: return ALIGNOF(alignstring);\n  }\n  return res;\n}\n\nvoid\nSym::inherits_add(Sym *s) {\n  implements.add(s);\n  specializes.add(s);\n  includes.add(s);\n}  \n\nvoid\nSym::must_implement_and_specialize(Sym *s) {\n  assert((!must_implement || must_implement == s) && \n         (!must_specialize || must_specialize == s));\n  must_implement = s;\n  must_specialize = s;\n}\n\nSym *\nSym::scalar_type() {\n  if (type && type->num_kind)\n    return type;\n  return 0;\n}\n\nSym *\nSym::coerce_to(Sym *to) {\n  if (this == to)\n    return this;\n  Sym *s1 = this->scalar_type(), *s2 = to->scalar_type();\n  if (s1 && s2) {\n    Sym *t = coerce_num(s1, s2);\n    if (t == s2)\n      return s2;\n    return NULL;\n  }\n  if (element) {\n    Sym *s1 = element->scalar_type(), *s2 = to->scalar_type();\n    if (s1 && s2) {\n      Sym *t = coerce_num(s1, s2);\n      if (t == s2)\n        return s2;\n      return NULL;\n    }\n  }\n  if (s1) {\n    if (to == sym_string)\n      return to;\n  }\n  return NULL;\n}\n\nvoid\nSym::convert_constant_string_to_immediate() {\n  if (!is_constant)\n    return;\n  imm.const_kind = type->num_kind;\n  imm.num_index = type->num_index;\n  convert_string_to_immediate(constant, &imm);\n}\n\nstatic Sym *\nint_constant_internal(IF1 *i, int n, Sym *t) {\n  Immediate imm;\n  imm.v_int32 = n;\n  if (n >= 0 && n < 10) {\n    char c[2];\n    c[0] = n + '0';\n    c[1] = 0;\n    return if1_const(i, t, c, &imm);\n  } else {\n    char str[100];\n    sprintf(str, \"%d\", n);\n    return if1_const(i, t, str, &imm);\n  }\n}\n\nSym *\nint32_constant(int n) {\n  return int_constant_internal(if1, n, sym_int32);\n}\n\nSym *\nsize_constant(int n) {\n  return int_constant_internal(if1, n, sym_size);\n}\n\nSym *\nimm_constant(Immediate &imm, Sym *t) {\n  char str[256];\n  sprint_imm(str, imm);\n  return if1_const(if1, t, str, &imm);\n}\n\nvoid\npp(Sym *s) {\n  printf(\"(SYM %d \", s->id);\n  if1_dump_sym(stdout, s);\n  printf(\")\");\n}\n<commit_msg>interm<commit_after>\/* -*-Mode: c++;-*-\n   Copyright (c) 2003-2008 John Plevyak, All Rights Reserved\n*\/\n#include \"ifadefs.h\"\n#include \"ast.h\"\n#include \"if1.h\"\n#include \"fa.h\"\n#include \"builtin.h\"\n\ncchar *type_kind_string[] = {\n  \"NONE\", \"UNKNOWN\", \"SUM\", \"RECORD\", \"FUN\", \"REF\", \"TAGGED\", \"PRIMITIVE\", \"APPLICATION\", \"VARIABLE\", \"ALIAS\"};\n\nBasicSym::BasicSym(void) :\n  name(NULL),\n  in(NULL),\n  type(NULL),\n  aspect(NULL),\n  must_specialize(NULL),\n  must_implement(NULL),\n  ast(NULL),\n  var(NULL),\n  asymbol(NULL),\n  nesting_depth(0),\n  cg_string(NULL),\n  llvm_value(NULL),\n  is_builtin(0),\n  is_read_only(0),\n  is_constant(0),\n  is_lvalue(0),\n  is_local(0),\n  is_default_arg(0),\n  is_exact_match(0),\n  is_module(0),\n  is_fun(0),\n  is_symbol(0),\n  is_pattern(0),\n  is_rest(0),\n  is_generic(0),\n  is_external(0),\n  is_this(0),\n  is_fake(0),\n  intent(0),\n  is_meta_type(0),\n  is_unique_type(0),\n  is_value_type(0),\n  is_system_type(0),\n  is_union_type(0),\n  is_structure(0),\n  is_vector(0),\n  fun_returns_value(0),\n  live(0),\n  type_kind(0),\n  num_kind(0),\n  num_index(0),\n  clone_for_constants(0),\n  dispatch_types_built(0),\n  type_live(0)\n{}\n\n\nSym::Sym() :\n  constant(NULL),\n  size(0),\n  alignment(0),\n  scope(NULL),\n  labelmap(NULL),\n  fun(NULL),\n  code(NULL),\n  self(NULL),\n  ret(NULL),\n  cont(NULL),\n  instantiates(NULL),\n  match_type(NULL),\n  abstract_type(NULL),\n  alias(NULL),\n  init(NULL),\n  meta_type(NULL),\n#ifdef CONSTANT_TYPES\n  constant_type(NULL),\n#endif\n  element(NULL),\n  temp(NULL),\n  llvm_type(NULL)\n{}\n\ncchar *\nSym::pathname() {\n  cchar *p = 0;\n  if (asymbol)\n    p = asymbol->pathname();\n  if (!p && ast)\n    p = ast->pathname();\n  if (p)\n    return p;\n  return \"<unknown>\";\n}\n\ncchar *\nSym::has_name(int i) {\n  if (i < has_names.n)\n    return has_names[i];\n  return 0;\n}\n\ncchar *\nSym::filename() {\n  cchar *fn = pathname();\n  cchar *r = strrchr(fn, '\/');\n  if (r) return r+1; else return fn;\n}\n\nint\nSym::line() {\n  int l = 0;\n  if (asymbol)\n    l = asymbol->line();\n  if (!l && ast)\n    l = ast->line();\n  return l;\n}\n\nint\nSym::source_line() {\n  int l = 0;\n  if (asymbol)\n    l = asymbol->source_line();\n  if (!l && ast)\n    l = ast->source_line();\n  return l;\n}\n\nvoid\nSym::copy_values(Sym *s) {\n  int temp_id = id;\n  *this = *s;\n  id = temp_id;\n}\n\nSym *\nSym::clone() {\n  if (asymbol)\n    return asymbol->clone();\n  Sym *new_sym = copy();\n  return new_sym;\n}\n\nSym *\nSym::copy() {\n  Sym *s = new_Sym();\n  s->copy_values(this);\n  if (s->element)\n    s->element = s->element->copy();\n  return s;\n}\n\nint\ncompar_syms(const void *ai, const void *aj) {\n  uint32 i = (*(Sym**)ai)->id;\n  uint32 j = (*(Sym**)aj)->id;\n  return (i > j) ? 1 : ((i < j) ? -1 : 0);\n}\n\nint\nSym::imm_int(int *result) {\n  int i = 0;\n  switch (type->num_kind) {\n    default: return -1;\n    case IF1_NUM_KIND_UINT: {\n      switch (type->num_index) {\n        case IF1_INT_TYPE_8:  i = imm.v_uint8; break;\n        case IF1_INT_TYPE_16: i = imm.v_uint16; break;\n        case IF1_INT_TYPE_32: i = imm.v_uint32; break;\n        case IF1_INT_TYPE_64: i = imm.v_uint64; break;\n        default: return -1;\n      }\n      break;\n    }\n    case IF1_NUM_KIND_INT: {\n      switch (type->num_index) {\n        case IF1_INT_TYPE_8:  i = imm.v_int8; break;\n        case IF1_INT_TYPE_16: i = imm.v_int16; break;\n        case IF1_INT_TYPE_32: i = imm.v_int32; break;\n        case IF1_INT_TYPE_64: i = imm.v_int64; break;\n        default: return -1;\n      }\n      break;\n    }\n  }\n  *result = i;\n  return 0;\n}\n\nSym *\nunalias_type(Sym *s) {\n  if (!s)\n    return s;\n  if (s->type_kind == Type_ALIAS) {\n    Vec<Sym *> aliases;\n    do {\n      if (!s->alias)\n        return 0;\n      Sym *ss = s->alias;\n      if (aliases.set_in(ss))\n        fail(\"circular type alias\");\n      aliases.set_add(ss);\n      s = ss;\n    } while (s->type_kind == Type_ALIAS);\n  }\n  return s;\n}\n\nvoid\nif1_set_int_type(IF1 *p, Sym *t, int signd, int size) {    \n  int ss = 0;\n  size >>= 3;\n  while (size) { ss++; size >>= 1; }\n  p->int_types[ss][signd] = t;\n  t->num_kind = signd ? IF1_NUM_KIND_INT : IF1_NUM_KIND_UINT;\n  t->num_index = ss;\n}\n\nvoid\nif1_set_float_type(IF1 *p, Sym *t, int size) {\n  int ss = 0;\n  size >>= 4;\n  ss = size - 1;\n  p->float_types[ss] = t;\n  t->num_kind = IF1_NUM_KIND_FLOAT;\n  t->num_index = ss;\n}\n\nvoid\nif1_set_complex_type(IF1 *p, Sym *t, int size) {\n  int ss = 0;\n  size >>= 4;\n  ss = size - 1;\n  p->complex_types[ss] = t;\n  t->num_kind = IF1_NUM_KIND_COMPLEX;\n  t->num_index = ss;\n}\n\nint\nif1_numeric_size(IF1 *p, Sym *t) {\n  switch (t->num_kind) {\n    case IF1_NUM_KIND_NONE: assert(!\"bad case\"); break;\n    case IF1_NUM_KIND_INT:\n    case IF1_NUM_KIND_UINT:\n      if (!t->num_index) return sizeof(bool);\n      return 1 << ((t->num_index ? t->num_index : 1) - 1);\n    case IF1_NUM_KIND_FLOAT:\n      return 2 + (2 * t->num_index);\n    case IF1_NUM_KIND_COMPLEX:\n      return 2 * (2 + (2 * t->num_index));\n  }\n  return 0;\n}\n\n#define MAKE_ALIGNOF(_t) \\\nstruct AlignOf##_t {      \\\n  char a;                \\\n  _t b;                  \\\n}\n\n#define ALIGNOF(_t) ((int)(intptr_t)&(((struct AlignOf##_t *)0)->b))\n\nMAKE_ALIGNOF(bool);\nMAKE_ALIGNOF(uint8);\nMAKE_ALIGNOF(uint16);\nMAKE_ALIGNOF(uint32);\nMAKE_ALIGNOF(uint64);\nMAKE_ALIGNOF(float32);\nMAKE_ALIGNOF(float64);\nMAKE_ALIGNOF(float128);\nMAKE_ALIGNOF(complex32);\nMAKE_ALIGNOF(complex64);\ntypedef char *alignstring;\nMAKE_ALIGNOF(alignstring);\n\nint \nif1_numeric_alignment(IF1 *p, Sym *t) {\n  int res = -1;\n  switch (t->num_kind) {\n    default: assert(!\"case\"); break;\n    case IF1_NUM_KIND_UINT:\n    case IF1_NUM_KIND_INT:\n      switch (t->num_index) {\n        case IF1_INT_TYPE_1: return ALIGNOF(bool); break;\n        case IF1_INT_TYPE_8: return ALIGNOF(uint8); break;\n        case IF1_INT_TYPE_16: return ALIGNOF(uint16); break;\n        case IF1_INT_TYPE_32: return ALIGNOF(uint32); break;\n        case IF1_INT_TYPE_64: return ALIGNOF(uint64); break;\n        default: assert(!\"case\");\n      }\n      break;\n    case IF1_NUM_KIND_FLOAT:\n      switch (t->num_index) {\n        case IF1_FLOAT_TYPE_32:  return ALIGNOF(float32);\n        case IF1_FLOAT_TYPE_64:  return ALIGNOF(float64);\n        case IF1_FLOAT_TYPE_128: return ALIGNOF(float128);\n        default: assert(!\"case\");\n      }\n      break;\n    case IF1_NUM_KIND_COMPLEX:\n      switch (t->num_index) {\n        case IF1_FLOAT_TYPE_32: return ALIGNOF(complex32);\n        case IF1_FLOAT_TYPE_64: return ALIGNOF(complex64);\n        default: assert(!\"case\");\n      }\n      break;\n    case IF1_CONST_KIND_STRING: return ALIGNOF(alignstring);\n  }\n  return res;\n}\n\nvoid\nSym::inherits_add(Sym *s) {\n  implements.add(s);\n  specializes.add(s);\n  includes.add(s);\n}  \n\nvoid\nSym::must_implement_and_specialize(Sym *s) {\n  assert((!must_implement || must_implement == s) && \n         (!must_specialize || must_specialize == s));\n  must_implement = s;\n  must_specialize = s;\n}\n\nSym *\nSym::scalar_type() {\n  if (type && type->num_kind)\n    return type;\n  return 0;\n}\n\nSym *\nSym::coerce_to(Sym *to) {\n  if (this == to)\n    return this;\n  Sym *s1 = this->scalar_type(), *s2 = to->scalar_type();\n  if (s1 && s2) {\n    Sym *t = coerce_num(s1, s2);\n    if (t == s2)\n      return s2;\n    return NULL;\n  }\n  if (element) {\n    Sym *s1 = element->scalar_type(), *s2 = to->scalar_type();\n    if (s1 && s2) {\n      Sym *t = coerce_num(s1, s2);\n      if (t == s2)\n        return s2;\n      return NULL;\n    }\n  }\n  if (s1) {\n    if (to == sym_string)\n      return to;\n  }\n  return NULL;\n}\n\nvoid\nSym::convert_constant_string_to_immediate() {\n  if (!is_constant)\n    return;\n  imm.const_kind = type->num_kind;\n  imm.num_index = type->num_index;\n  convert_string_to_immediate(constant, &imm);\n}\n\nstatic Sym *\nint_constant_internal(IF1 *i, int n, Sym *t) {\n  Immediate imm;\n  imm.v_int32 = n;\n  if (n >= 0 && n < 10) {\n    char c[2];\n    c[0] = n + '0';\n    c[1] = 0;\n    return if1_const(i, t, c, &imm);\n  } else {\n    char str[100];\n    sprintf(str, \"%d\", n);\n    return if1_const(i, t, str, &imm);\n  }\n}\n\nSym *\nint32_constant(int n) {\n  return int_constant_internal(if1, n, sym_int32);\n}\n\nSym *\nsize_constant(int n) {\n  return int_constant_internal(if1, n, sym_size);\n}\n\nSym *\nimm_constant(Immediate &imm, Sym *t) {\n  char str[256];\n  sprint_imm(str, imm);\n  return if1_const(if1, t, str, &imm);\n}\n\nvoid\npp(Sym *s) {\n  printf(\"(SYM %d \", s->id);\n  if1_dump_sym(stdout, s);\n  printf(\")\");\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\/views\/touchui\/touch_mode_support.h\"\n\n#include \"ui\/base\/ui_base_switches.h\"\n#include \"base\/command_line.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>\n#endif\n\n\/\/ static\nbool TouchModeSupport::IsTouchOptimized() {\n#if !defined(OS_WIN)\n  \/\/ TODO(port): there is code in src\/ui\/base\/touch for linux but it is not\n  \/\/ suitable for consumption here.\n  return false;\n#else\n  \/\/ TODO: This may need to be cached and updated only occasionally. There is\n  \/\/ no direct WM_ message that indicates that a touch panel has been added or\n  \/\/ removed, however.\n  if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kTouchOptimizedUI))\n    return true;\n  \/\/ Asking for SM_DIGITIZER always returns 0 in Windows Vista and Windows XP.\n  int sm = ::GetSystemMetrics(SM_DIGITIZER);\n  return (sm & NID_READY) && (sm & NID_INTEGRATED_TOUCH);\n#endif\n}\n<commit_msg>Only enable touch-friendly tab strip based on command line flag<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\/touchui\/touch_mode_support.h\"\n\n#include \"ui\/base\/ui_base_switches.h\"\n#include \"base\/command_line.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>\n#endif\n\n\/\/ static\nbool TouchModeSupport::IsTouchOptimized() {\n#if !defined(OS_WIN)\n  \/\/ TODO(port): there is code in src\/ui\/base\/touch for linux but it is not\n  \/\/ suitable for consumption here.\n  return false;\n#else\n  \/\/ TODO: Enable based on GetSystemMetrics(SM_DIGITIZER) returning NID_READY\n  \/\/ and NID_INTEGRATED_TOUCH once code is ready.\n  return CommandLine::ForCurrentProcess()->HasSwitch(\n      switches::kTouchOptimizedUI);\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- Cloning.cpp - Unit tests for the Cloner ----------------------------===\/\/\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 \"llvm\/Transforms\/Utils\/Cloning.h\"\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include \"llvm\/IR\/Argument.h\"\n#include \"llvm\/IR\/Constant.h\"\n#include \"llvm\/IR\/DIBuilder.h\"\n#include \"llvm\/IR\/DebugInfo.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/IR\/InstIterator.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/IntrinsicInst.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nclass CloneInstruction : public ::testing::Test {\nprotected:\n  virtual void SetUp() {\n    V = nullptr;\n  }\n\n  template <typename T>\n  T *clone(T *V1) {\n    Value *V2 = V1->clone();\n    Orig.insert(V1);\n    Clones.insert(V2);\n    return cast<T>(V2);\n  }\n\n  void eraseClones() {\n    DeleteContainerPointers(Clones);\n  }\n\n  virtual void TearDown() {\n    eraseClones();\n    DeleteContainerPointers(Orig);\n    delete V;\n  }\n\n  SmallPtrSet<Value *, 4> Orig;   \/\/ Erase on exit\n  SmallPtrSet<Value *, 4> Clones; \/\/ Erase in eraseClones\n\n  LLVMContext context;\n  Value *V;\n};\n\nTEST_F(CloneInstruction, OverflowBits) {\n  V = new Argument(Type::getInt32Ty(context));\n\n  BinaryOperator *Add = BinaryOperator::Create(Instruction::Add, V, V);\n  BinaryOperator *Sub = BinaryOperator::Create(Instruction::Sub, V, V);\n  BinaryOperator *Mul = BinaryOperator::Create(Instruction::Mul, V, V);\n\n  BinaryOperator *AddClone = this->clone(Add);\n  BinaryOperator *SubClone = this->clone(Sub);\n  BinaryOperator *MulClone = this->clone(Mul);\n\n  EXPECT_FALSE(AddClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(AddClone->hasNoSignedWrap());\n  EXPECT_FALSE(SubClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(SubClone->hasNoSignedWrap());\n  EXPECT_FALSE(MulClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(MulClone->hasNoSignedWrap());\n\n  eraseClones();\n\n  Add->setHasNoUnsignedWrap();\n  Sub->setHasNoUnsignedWrap();\n  Mul->setHasNoUnsignedWrap();\n\n  AddClone = this->clone(Add);\n  SubClone = this->clone(Sub);\n  MulClone = this->clone(Mul);\n\n  EXPECT_TRUE(AddClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(AddClone->hasNoSignedWrap());\n  EXPECT_TRUE(SubClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(SubClone->hasNoSignedWrap());\n  EXPECT_TRUE(MulClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(MulClone->hasNoSignedWrap());\n\n  eraseClones();\n\n  Add->setHasNoSignedWrap();\n  Sub->setHasNoSignedWrap();\n  Mul->setHasNoSignedWrap();\n\n  AddClone = this->clone(Add);\n  SubClone = this->clone(Sub);\n  MulClone = this->clone(Mul);\n\n  EXPECT_TRUE(AddClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(AddClone->hasNoSignedWrap());\n  EXPECT_TRUE(SubClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(SubClone->hasNoSignedWrap());\n  EXPECT_TRUE(MulClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(MulClone->hasNoSignedWrap());\n\n  eraseClones();\n\n  Add->setHasNoUnsignedWrap(false);\n  Sub->setHasNoUnsignedWrap(false);\n  Mul->setHasNoUnsignedWrap(false);\n\n  AddClone = this->clone(Add);\n  SubClone = this->clone(Sub);\n  MulClone = this->clone(Mul);\n\n  EXPECT_FALSE(AddClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(AddClone->hasNoSignedWrap());\n  EXPECT_FALSE(SubClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(SubClone->hasNoSignedWrap());\n  EXPECT_FALSE(MulClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(MulClone->hasNoSignedWrap());\n}\n\nTEST_F(CloneInstruction, Inbounds) {\n  V = new Argument(Type::getInt32PtrTy(context));\n\n  Constant *Z = Constant::getNullValue(Type::getInt32Ty(context));\n  std::vector<Value *> ops;\n  ops.push_back(Z);\n  GetElementPtrInst *GEP =\n      GetElementPtrInst::Create(Type::getInt32Ty(context), V, ops);\n  EXPECT_FALSE(this->clone(GEP)->isInBounds());\n\n  GEP->setIsInBounds();\n  EXPECT_TRUE(this->clone(GEP)->isInBounds());\n}\n\nTEST_F(CloneInstruction, Exact) {\n  V = new Argument(Type::getInt32Ty(context));\n\n  BinaryOperator *SDiv = BinaryOperator::Create(Instruction::SDiv, V, V);\n  EXPECT_FALSE(this->clone(SDiv)->isExact());\n\n  SDiv->setIsExact(true);\n  EXPECT_TRUE(this->clone(SDiv)->isExact());\n}\n\nTEST_F(CloneInstruction, Attributes) {\n  Type *ArgTy1[] = { Type::getInt32PtrTy(context) };\n  FunctionType *FT1 =  FunctionType::get(Type::getVoidTy(context), ArgTy1, false);\n\n  Function *F1 = Function::Create(FT1, Function::ExternalLinkage);\n  BasicBlock *BB = BasicBlock::Create(context, \"\", F1);\n  IRBuilder<> Builder(BB);\n  Builder.CreateRetVoid();\n\n  Function *F2 = Function::Create(FT1, Function::ExternalLinkage);\n\n  Attribute::AttrKind AK[] = { Attribute::NoCapture };\n  AttributeSet AS = AttributeSet::get(context, 0, AK);\n  Argument *A = F1->arg_begin();\n  A->addAttr(AS);\n\n  SmallVector<ReturnInst*, 4> Returns;\n  ValueToValueMapTy VMap;\n  VMap[A] = UndefValue::get(A->getType());\n\n  CloneFunctionInto(F2, F1, VMap, false, Returns);\n  EXPECT_FALSE(F2->arg_begin()->hasNoCaptureAttr());\n\n  delete F1;\n  delete F2;\n}\n\nTEST_F(CloneInstruction, CallingConvention) {\n  Type *ArgTy1[] = { Type::getInt32PtrTy(context) };\n  FunctionType *FT1 =  FunctionType::get(Type::getVoidTy(context), ArgTy1, false);\n\n  Function *F1 = Function::Create(FT1, Function::ExternalLinkage);\n  F1->setCallingConv(CallingConv::Cold);\n  BasicBlock *BB = BasicBlock::Create(context, \"\", F1);\n  IRBuilder<> Builder(BB);\n  Builder.CreateRetVoid();\n\n  Function *F2 = Function::Create(FT1, Function::ExternalLinkage);\n\n  SmallVector<ReturnInst*, 4> Returns;\n  ValueToValueMapTy VMap;\n  VMap[F1->arg_begin()] = F2->arg_begin();\n\n  CloneFunctionInto(F2, F1, VMap, false, Returns);\n  EXPECT_EQ(CallingConv::Cold, F2->getCallingConv());\n\n  delete F1;\n  delete F2;\n}\n\nclass CloneFunc : public ::testing::Test {\nprotected:\n  virtual void SetUp() {\n    SetupModule();\n    CreateOldFunc();\n    CreateNewFunc();\n    SetupFinder();\n  }\n\n  virtual void TearDown() {\n    delete Finder;\n  }\n\n  void SetupModule() {\n    M = new Module(\"\", C);\n  }\n\n  void CreateOldFunc() {\n    FunctionType* FuncType = FunctionType::get(Type::getVoidTy(C), false);\n    OldFunc = Function::Create(FuncType, GlobalValue::PrivateLinkage, \"f\", M);\n    CreateOldFunctionBodyAndDI();\n  }\n\n  void CreateOldFunctionBodyAndDI() {\n    DIBuilder DBuilder(*M);\n    IRBuilder<> IBuilder(C);\n\n    \/\/ Function DI\n    DIFile File = DBuilder.createFile(\"filename.c\", \"\/file\/dir\/\");\n    DITypeArray ParamTypes = DBuilder.getOrCreateTypeArray(None);\n    DICompositeType FuncType = DBuilder.createSubroutineType(File, ParamTypes);\n    DICompileUnit CU = DBuilder.createCompileUnit(dwarf::DW_LANG_C99,\n        \"filename.c\", \"\/file\/dir\", \"CloneFunc\", false, \"\", 0);\n\n    DISubprogram Subprogram = DBuilder.createFunction(CU, \"f\", \"f\", File, 4,\n        FuncType, true, true, 3, 0, false, OldFunc);\n\n    \/\/ Function body\n    BasicBlock* Entry = BasicBlock::Create(C, \"\", OldFunc);\n    IBuilder.SetInsertPoint(Entry);\n    DebugLoc Loc = DebugLoc::get(3, 2, Subprogram);\n    IBuilder.SetCurrentDebugLocation(Loc);\n    AllocaInst* Alloca = IBuilder.CreateAlloca(IntegerType::getInt32Ty(C));\n    IBuilder.SetCurrentDebugLocation(DebugLoc::get(4, 2, Subprogram));\n    Value* AllocaContent = IBuilder.getInt32(1);\n    Instruction* Store = IBuilder.CreateStore(AllocaContent, Alloca);\n    IBuilder.SetCurrentDebugLocation(DebugLoc::get(5, 2, Subprogram));\n    Instruction* Terminator = IBuilder.CreateRetVoid();\n\n    \/\/ Create a local variable around the alloca\n    DIType IntType = DBuilder.createBasicType(\"int\", 32, 0,\n        dwarf::DW_ATE_signed);\n    DIExpression E = DBuilder.createExpression();\n    DIVariable Variable = DBuilder.createLocalVariable(\n      dwarf::DW_TAG_auto_variable, Subprogram, \"x\", File, 5, IntType, true);\n    DBuilder.insertDeclare(Alloca, Variable, E, Store);\n    DBuilder.insertDbgValueIntrinsic(AllocaContent, 0, Variable, E, Terminator);\n    \/\/ Finalize the debug info\n    DBuilder.finalize();\n\n\n    \/\/ Create another, empty, compile unit\n    DIBuilder DBuilder2(*M);\n    DBuilder2.createCompileUnit(dwarf::DW_LANG_C99,\n        \"extra.c\", \"\/file\/dir\", \"CloneFunc\", false, \"\", 0);\n    DBuilder2.finalize();\n  }\n\n  void CreateNewFunc() {\n    ValueToValueMapTy VMap;\n    NewFunc = CloneFunction(OldFunc, VMap, true, nullptr);\n    M->getFunctionList().push_back(NewFunc);\n  }\n\n  void SetupFinder() {\n    Finder = new DebugInfoFinder();\n    Finder->processModule(*M);\n  }\n\n  LLVMContext C;\n  Function* OldFunc;\n  Function* NewFunc;\n  Module* M;\n  DebugInfoFinder* Finder;\n};\n\n\/\/ Test that a new, distinct function was created.\nTEST_F(CloneFunc, NewFunctionCreated) {\n  EXPECT_NE(OldFunc, NewFunc);\n}\n\n\/\/ Test that a new subprogram entry was added and is pointing to the new\n\/\/ function, while the original subprogram still points to the old one.\nTEST_F(CloneFunc, Subprogram) {\n  unsigned SubprogramCount = Finder->subprogram_count();\n  EXPECT_EQ(2U, SubprogramCount);\n\n  auto Iter = Finder->subprograms().begin();\n  DISubprogram Sub1(*Iter);\n  EXPECT_TRUE(Sub1.Verify());\n  Iter++;\n  DISubprogram Sub2(*Iter);\n  EXPECT_TRUE(Sub2.Verify());\n\n  EXPECT_TRUE((Sub1.getFunction() == OldFunc && Sub2.getFunction() == NewFunc)\n           || (Sub1.getFunction() == NewFunc && Sub2.getFunction() == OldFunc));\n}\n\n\/\/ Test that the new subprogram entry was not added to the CU which doesn't\n\/\/ contain the old subprogram entry.\nTEST_F(CloneFunc, SubprogramInRightCU) {\n  EXPECT_EQ(2U, Finder->compile_unit_count());\n\n  auto Iter = Finder->compile_units().begin();\n  DICompileUnit CU1(*Iter);\n  EXPECT_TRUE(CU1.Verify());\n  Iter++;\n  DICompileUnit CU2(*Iter);\n  EXPECT_TRUE(CU2.Verify());\n  EXPECT_TRUE(CU1.getSubprograms().getNumElements() == 0\n           || CU2.getSubprograms().getNumElements() == 0);\n}\n\n\/\/ Test that instructions in the old function still belong to it in the\n\/\/ metadata, while instruction in the new function belong to the new one.\nTEST_F(CloneFunc, InstructionOwnership) {\n  inst_iterator OldIter = inst_begin(OldFunc);\n  inst_iterator OldEnd = inst_end(OldFunc);\n  inst_iterator NewIter = inst_begin(NewFunc);\n  inst_iterator NewEnd = inst_end(NewFunc);\n  while (OldIter != OldEnd && NewIter != NewEnd) {\n    Instruction& OldI = *OldIter;\n    Instruction& NewI = *NewIter;\n    EXPECT_NE(&OldI, &NewI);\n\n    EXPECT_EQ(OldI.hasMetadata(), NewI.hasMetadata());\n    if (OldI.hasMetadata()) {\n      const DebugLoc& OldDL = OldI.getDebugLoc();\n      const DebugLoc& NewDL = NewI.getDebugLoc();\n\n      \/\/ Verify that the debug location data is the same\n      EXPECT_EQ(OldDL.getLine(), NewDL.getLine());\n      EXPECT_EQ(OldDL.getCol(), NewDL.getCol());\n\n      \/\/ But that they belong to different functions\n      DISubprogram OldSubprogram(OldDL.getScope());\n      DISubprogram NewSubprogram(NewDL.getScope());\n      EXPECT_TRUE(OldSubprogram.Verify());\n      EXPECT_TRUE(NewSubprogram.Verify());\n      EXPECT_EQ(OldFunc, OldSubprogram.getFunction());\n      EXPECT_EQ(NewFunc, NewSubprogram.getFunction());\n    }\n\n    ++OldIter;\n    ++NewIter;\n  }\n  EXPECT_EQ(OldEnd, OldIter);\n  EXPECT_EQ(NewEnd, NewIter);\n}\n\n\/\/ Test that the arguments for debug intrinsics in the new function were\n\/\/ properly cloned\nTEST_F(CloneFunc, DebugIntrinsics) {\n  inst_iterator OldIter = inst_begin(OldFunc);\n  inst_iterator OldEnd = inst_end(OldFunc);\n  inst_iterator NewIter = inst_begin(NewFunc);\n  inst_iterator NewEnd = inst_end(NewFunc);\n  while (OldIter != OldEnd && NewIter != NewEnd) {\n    Instruction& OldI = *OldIter;\n    Instruction& NewI = *NewIter;\n    if (DbgDeclareInst* OldIntrin = dyn_cast<DbgDeclareInst>(&OldI)) {\n      DbgDeclareInst* NewIntrin = dyn_cast<DbgDeclareInst>(&NewI);\n      EXPECT_TRUE(NewIntrin);\n\n      \/\/ Old address must belong to the old function\n      EXPECT_EQ(OldFunc, cast<AllocaInst>(OldIntrin->getAddress())->\n                         getParent()->getParent());\n      \/\/ New address must belong to the new function\n      EXPECT_EQ(NewFunc, cast<AllocaInst>(NewIntrin->getAddress())->\n                         getParent()->getParent());\n\n      \/\/ Old variable must belong to the old function\n      EXPECT_EQ(OldFunc, DISubprogram(DIVariable(OldIntrin->getVariable())\n                         .getContext()).getFunction());\n      \/\/ New variable must belong to the New function\n      EXPECT_EQ(NewFunc, DISubprogram(DIVariable(NewIntrin->getVariable())\n                         .getContext()).getFunction());\n    } else if (DbgValueInst* OldIntrin = dyn_cast<DbgValueInst>(&OldI)) {\n      DbgValueInst* NewIntrin = dyn_cast<DbgValueInst>(&NewI);\n      EXPECT_TRUE(NewIntrin);\n\n      \/\/ Old variable must belong to the old function\n      EXPECT_EQ(OldFunc, DISubprogram(DIVariable(OldIntrin->getVariable())\n                         .getContext()).getFunction());\n      \/\/ New variable must belong to the New function\n      EXPECT_EQ(NewFunc, DISubprogram(DIVariable(NewIntrin->getVariable())\n                         .getContext()).getFunction());\n    }\n\n    ++OldIter;\n    ++NewIter;\n  }\n}\n\n}\n<commit_msg>Transforms: Update unit tests to use verifyModule()<commit_after>\/\/===- Cloning.cpp - Unit tests for the Cloner ----------------------------===\/\/\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 \"llvm\/Transforms\/Utils\/Cloning.h\"\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include \"llvm\/IR\/Argument.h\"\n#include \"llvm\/IR\/Constant.h\"\n#include \"llvm\/IR\/DIBuilder.h\"\n#include \"llvm\/IR\/DebugInfo.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/IR\/InstIterator.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/IntrinsicInst.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Verifier.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nclass CloneInstruction : public ::testing::Test {\nprotected:\n  virtual void SetUp() {\n    V = nullptr;\n  }\n\n  template <typename T>\n  T *clone(T *V1) {\n    Value *V2 = V1->clone();\n    Orig.insert(V1);\n    Clones.insert(V2);\n    return cast<T>(V2);\n  }\n\n  void eraseClones() {\n    DeleteContainerPointers(Clones);\n  }\n\n  virtual void TearDown() {\n    eraseClones();\n    DeleteContainerPointers(Orig);\n    delete V;\n  }\n\n  SmallPtrSet<Value *, 4> Orig;   \/\/ Erase on exit\n  SmallPtrSet<Value *, 4> Clones; \/\/ Erase in eraseClones\n\n  LLVMContext context;\n  Value *V;\n};\n\nTEST_F(CloneInstruction, OverflowBits) {\n  V = new Argument(Type::getInt32Ty(context));\n\n  BinaryOperator *Add = BinaryOperator::Create(Instruction::Add, V, V);\n  BinaryOperator *Sub = BinaryOperator::Create(Instruction::Sub, V, V);\n  BinaryOperator *Mul = BinaryOperator::Create(Instruction::Mul, V, V);\n\n  BinaryOperator *AddClone = this->clone(Add);\n  BinaryOperator *SubClone = this->clone(Sub);\n  BinaryOperator *MulClone = this->clone(Mul);\n\n  EXPECT_FALSE(AddClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(AddClone->hasNoSignedWrap());\n  EXPECT_FALSE(SubClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(SubClone->hasNoSignedWrap());\n  EXPECT_FALSE(MulClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(MulClone->hasNoSignedWrap());\n\n  eraseClones();\n\n  Add->setHasNoUnsignedWrap();\n  Sub->setHasNoUnsignedWrap();\n  Mul->setHasNoUnsignedWrap();\n\n  AddClone = this->clone(Add);\n  SubClone = this->clone(Sub);\n  MulClone = this->clone(Mul);\n\n  EXPECT_TRUE(AddClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(AddClone->hasNoSignedWrap());\n  EXPECT_TRUE(SubClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(SubClone->hasNoSignedWrap());\n  EXPECT_TRUE(MulClone->hasNoUnsignedWrap());\n  EXPECT_FALSE(MulClone->hasNoSignedWrap());\n\n  eraseClones();\n\n  Add->setHasNoSignedWrap();\n  Sub->setHasNoSignedWrap();\n  Mul->setHasNoSignedWrap();\n\n  AddClone = this->clone(Add);\n  SubClone = this->clone(Sub);\n  MulClone = this->clone(Mul);\n\n  EXPECT_TRUE(AddClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(AddClone->hasNoSignedWrap());\n  EXPECT_TRUE(SubClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(SubClone->hasNoSignedWrap());\n  EXPECT_TRUE(MulClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(MulClone->hasNoSignedWrap());\n\n  eraseClones();\n\n  Add->setHasNoUnsignedWrap(false);\n  Sub->setHasNoUnsignedWrap(false);\n  Mul->setHasNoUnsignedWrap(false);\n\n  AddClone = this->clone(Add);\n  SubClone = this->clone(Sub);\n  MulClone = this->clone(Mul);\n\n  EXPECT_FALSE(AddClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(AddClone->hasNoSignedWrap());\n  EXPECT_FALSE(SubClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(SubClone->hasNoSignedWrap());\n  EXPECT_FALSE(MulClone->hasNoUnsignedWrap());\n  EXPECT_TRUE(MulClone->hasNoSignedWrap());\n}\n\nTEST_F(CloneInstruction, Inbounds) {\n  V = new Argument(Type::getInt32PtrTy(context));\n\n  Constant *Z = Constant::getNullValue(Type::getInt32Ty(context));\n  std::vector<Value *> ops;\n  ops.push_back(Z);\n  GetElementPtrInst *GEP =\n      GetElementPtrInst::Create(Type::getInt32Ty(context), V, ops);\n  EXPECT_FALSE(this->clone(GEP)->isInBounds());\n\n  GEP->setIsInBounds();\n  EXPECT_TRUE(this->clone(GEP)->isInBounds());\n}\n\nTEST_F(CloneInstruction, Exact) {\n  V = new Argument(Type::getInt32Ty(context));\n\n  BinaryOperator *SDiv = BinaryOperator::Create(Instruction::SDiv, V, V);\n  EXPECT_FALSE(this->clone(SDiv)->isExact());\n\n  SDiv->setIsExact(true);\n  EXPECT_TRUE(this->clone(SDiv)->isExact());\n}\n\nTEST_F(CloneInstruction, Attributes) {\n  Type *ArgTy1[] = { Type::getInt32PtrTy(context) };\n  FunctionType *FT1 =  FunctionType::get(Type::getVoidTy(context), ArgTy1, false);\n\n  Function *F1 = Function::Create(FT1, Function::ExternalLinkage);\n  BasicBlock *BB = BasicBlock::Create(context, \"\", F1);\n  IRBuilder<> Builder(BB);\n  Builder.CreateRetVoid();\n\n  Function *F2 = Function::Create(FT1, Function::ExternalLinkage);\n\n  Attribute::AttrKind AK[] = { Attribute::NoCapture };\n  AttributeSet AS = AttributeSet::get(context, 0, AK);\n  Argument *A = F1->arg_begin();\n  A->addAttr(AS);\n\n  SmallVector<ReturnInst*, 4> Returns;\n  ValueToValueMapTy VMap;\n  VMap[A] = UndefValue::get(A->getType());\n\n  CloneFunctionInto(F2, F1, VMap, false, Returns);\n  EXPECT_FALSE(F2->arg_begin()->hasNoCaptureAttr());\n\n  delete F1;\n  delete F2;\n}\n\nTEST_F(CloneInstruction, CallingConvention) {\n  Type *ArgTy1[] = { Type::getInt32PtrTy(context) };\n  FunctionType *FT1 =  FunctionType::get(Type::getVoidTy(context), ArgTy1, false);\n\n  Function *F1 = Function::Create(FT1, Function::ExternalLinkage);\n  F1->setCallingConv(CallingConv::Cold);\n  BasicBlock *BB = BasicBlock::Create(context, \"\", F1);\n  IRBuilder<> Builder(BB);\n  Builder.CreateRetVoid();\n\n  Function *F2 = Function::Create(FT1, Function::ExternalLinkage);\n\n  SmallVector<ReturnInst*, 4> Returns;\n  ValueToValueMapTy VMap;\n  VMap[F1->arg_begin()] = F2->arg_begin();\n\n  CloneFunctionInto(F2, F1, VMap, false, Returns);\n  EXPECT_EQ(CallingConv::Cold, F2->getCallingConv());\n\n  delete F1;\n  delete F2;\n}\n\nclass CloneFunc : public ::testing::Test {\nprotected:\n  virtual void SetUp() {\n    SetupModule();\n    CreateOldFunc();\n    CreateNewFunc();\n    SetupFinder();\n  }\n\n  virtual void TearDown() {\n    delete Finder;\n  }\n\n  void SetupModule() {\n    M = new Module(\"\", C);\n  }\n\n  void CreateOldFunc() {\n    FunctionType* FuncType = FunctionType::get(Type::getVoidTy(C), false);\n    OldFunc = Function::Create(FuncType, GlobalValue::PrivateLinkage, \"f\", M);\n    CreateOldFunctionBodyAndDI();\n  }\n\n  void CreateOldFunctionBodyAndDI() {\n    DIBuilder DBuilder(*M);\n    IRBuilder<> IBuilder(C);\n\n    \/\/ Function DI\n    DIFile File = DBuilder.createFile(\"filename.c\", \"\/file\/dir\/\");\n    DITypeArray ParamTypes = DBuilder.getOrCreateTypeArray(None);\n    DICompositeType FuncType = DBuilder.createSubroutineType(File, ParamTypes);\n    DICompileUnit CU = DBuilder.createCompileUnit(dwarf::DW_LANG_C99,\n        \"filename.c\", \"\/file\/dir\", \"CloneFunc\", false, \"\", 0);\n\n    DISubprogram Subprogram = DBuilder.createFunction(CU, \"f\", \"f\", File, 4,\n        FuncType, true, true, 3, 0, false, OldFunc);\n\n    \/\/ Function body\n    BasicBlock* Entry = BasicBlock::Create(C, \"\", OldFunc);\n    IBuilder.SetInsertPoint(Entry);\n    DebugLoc Loc = DebugLoc::get(3, 2, Subprogram);\n    IBuilder.SetCurrentDebugLocation(Loc);\n    AllocaInst* Alloca = IBuilder.CreateAlloca(IntegerType::getInt32Ty(C));\n    IBuilder.SetCurrentDebugLocation(DebugLoc::get(4, 2, Subprogram));\n    Value* AllocaContent = IBuilder.getInt32(1);\n    Instruction* Store = IBuilder.CreateStore(AllocaContent, Alloca);\n    IBuilder.SetCurrentDebugLocation(DebugLoc::get(5, 2, Subprogram));\n    Instruction* Terminator = IBuilder.CreateRetVoid();\n\n    \/\/ Create a local variable around the alloca\n    DIType IntType = DBuilder.createBasicType(\"int\", 32, 0,\n        dwarf::DW_ATE_signed);\n    DIExpression E = DBuilder.createExpression();\n    DIVariable Variable = DBuilder.createLocalVariable(\n      dwarf::DW_TAG_auto_variable, Subprogram, \"x\", File, 5, IntType, true);\n    DBuilder.insertDeclare(Alloca, Variable, E, Store);\n    DBuilder.insertDbgValueIntrinsic(AllocaContent, 0, Variable, E, Terminator);\n    \/\/ Finalize the debug info\n    DBuilder.finalize();\n\n\n    \/\/ Create another, empty, compile unit\n    DIBuilder DBuilder2(*M);\n    DBuilder2.createCompileUnit(dwarf::DW_LANG_C99,\n        \"extra.c\", \"\/file\/dir\", \"CloneFunc\", false, \"\", 0);\n    DBuilder2.finalize();\n  }\n\n  void CreateNewFunc() {\n    ValueToValueMapTy VMap;\n    NewFunc = CloneFunction(OldFunc, VMap, true, nullptr);\n    M->getFunctionList().push_back(NewFunc);\n  }\n\n  void SetupFinder() {\n    Finder = new DebugInfoFinder();\n    Finder->processModule(*M);\n  }\n\n  LLVMContext C;\n  Function* OldFunc;\n  Function* NewFunc;\n  Module* M;\n  DebugInfoFinder* Finder;\n};\n\n\/\/ Test that a new, distinct function was created.\nTEST_F(CloneFunc, NewFunctionCreated) {\n  EXPECT_NE(OldFunc, NewFunc);\n}\n\n\/\/ Test that a new subprogram entry was added and is pointing to the new\n\/\/ function, while the original subprogram still points to the old one.\nTEST_F(CloneFunc, Subprogram) {\n  EXPECT_FALSE(verifyModule(*M));\n\n  unsigned SubprogramCount = Finder->subprogram_count();\n  EXPECT_EQ(2U, SubprogramCount);\n\n  auto Iter = Finder->subprograms().begin();\n  DISubprogram Sub1(*Iter);\n  EXPECT_TRUE(Sub1.isSubprogram());\n  Iter++;\n  DISubprogram Sub2(*Iter);\n  EXPECT_TRUE(Sub2.isSubprogram());\n\n  EXPECT_TRUE((Sub1.getFunction() == OldFunc && Sub2.getFunction() == NewFunc)\n           || (Sub1.getFunction() == NewFunc && Sub2.getFunction() == OldFunc));\n}\n\n\/\/ Test that the new subprogram entry was not added to the CU which doesn't\n\/\/ contain the old subprogram entry.\nTEST_F(CloneFunc, SubprogramInRightCU) {\n  EXPECT_FALSE(verifyModule(*M));\n\n  EXPECT_EQ(2U, Finder->compile_unit_count());\n\n  auto Iter = Finder->compile_units().begin();\n  DICompileUnit CU1(*Iter);\n  EXPECT_TRUE(CU1.isCompileUnit());\n  Iter++;\n  DICompileUnit CU2(*Iter);\n  EXPECT_TRUE(CU2.isCompileUnit());\n  EXPECT_TRUE(CU1.getSubprograms().getNumElements() == 0\n           || CU2.getSubprograms().getNumElements() == 0);\n}\n\n\/\/ Test that instructions in the old function still belong to it in the\n\/\/ metadata, while instruction in the new function belong to the new one.\nTEST_F(CloneFunc, InstructionOwnership) {\n  EXPECT_FALSE(verifyModule(*M));\n\n  inst_iterator OldIter = inst_begin(OldFunc);\n  inst_iterator OldEnd = inst_end(OldFunc);\n  inst_iterator NewIter = inst_begin(NewFunc);\n  inst_iterator NewEnd = inst_end(NewFunc);\n  while (OldIter != OldEnd && NewIter != NewEnd) {\n    Instruction& OldI = *OldIter;\n    Instruction& NewI = *NewIter;\n    EXPECT_NE(&OldI, &NewI);\n\n    EXPECT_EQ(OldI.hasMetadata(), NewI.hasMetadata());\n    if (OldI.hasMetadata()) {\n      const DebugLoc& OldDL = OldI.getDebugLoc();\n      const DebugLoc& NewDL = NewI.getDebugLoc();\n\n      \/\/ Verify that the debug location data is the same\n      EXPECT_EQ(OldDL.getLine(), NewDL.getLine());\n      EXPECT_EQ(OldDL.getCol(), NewDL.getCol());\n\n      \/\/ But that they belong to different functions\n      DISubprogram OldSubprogram(OldDL.getScope());\n      DISubprogram NewSubprogram(NewDL.getScope());\n      EXPECT_TRUE(OldSubprogram.isSubprogram());\n      EXPECT_TRUE(NewSubprogram.isSubprogram());\n      EXPECT_EQ(OldFunc, OldSubprogram.getFunction());\n      EXPECT_EQ(NewFunc, NewSubprogram.getFunction());\n    }\n\n    ++OldIter;\n    ++NewIter;\n  }\n  EXPECT_EQ(OldEnd, OldIter);\n  EXPECT_EQ(NewEnd, NewIter);\n}\n\n\/\/ Test that the arguments for debug intrinsics in the new function were\n\/\/ properly cloned\nTEST_F(CloneFunc, DebugIntrinsics) {\n  EXPECT_FALSE(verifyModule(*M));\n\n  inst_iterator OldIter = inst_begin(OldFunc);\n  inst_iterator OldEnd = inst_end(OldFunc);\n  inst_iterator NewIter = inst_begin(NewFunc);\n  inst_iterator NewEnd = inst_end(NewFunc);\n  while (OldIter != OldEnd && NewIter != NewEnd) {\n    Instruction& OldI = *OldIter;\n    Instruction& NewI = *NewIter;\n    if (DbgDeclareInst* OldIntrin = dyn_cast<DbgDeclareInst>(&OldI)) {\n      DbgDeclareInst* NewIntrin = dyn_cast<DbgDeclareInst>(&NewI);\n      EXPECT_TRUE(NewIntrin);\n\n      \/\/ Old address must belong to the old function\n      EXPECT_EQ(OldFunc, cast<AllocaInst>(OldIntrin->getAddress())->\n                         getParent()->getParent());\n      \/\/ New address must belong to the new function\n      EXPECT_EQ(NewFunc, cast<AllocaInst>(NewIntrin->getAddress())->\n                         getParent()->getParent());\n\n      \/\/ Old variable must belong to the old function\n      EXPECT_EQ(OldFunc, DISubprogram(DIVariable(OldIntrin->getVariable())\n                         .getContext()).getFunction());\n      \/\/ New variable must belong to the New function\n      EXPECT_EQ(NewFunc, DISubprogram(DIVariable(NewIntrin->getVariable())\n                         .getContext()).getFunction());\n    } else if (DbgValueInst* OldIntrin = dyn_cast<DbgValueInst>(&OldI)) {\n      DbgValueInst* NewIntrin = dyn_cast<DbgValueInst>(&NewI);\n      EXPECT_TRUE(NewIntrin);\n\n      \/\/ Old variable must belong to the old function\n      EXPECT_EQ(OldFunc, DISubprogram(DIVariable(OldIntrin->getVariable())\n                         .getContext()).getFunction());\n      \/\/ New variable must belong to the New function\n      EXPECT_EQ(NewFunc, DISubprogram(DIVariable(NewIntrin->getVariable())\n                         .getContext()).getFunction());\n    }\n\n    ++OldIter;\n    ++NewIter;\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#include <sal\/config.h>\n\n#include <com\/sun\/star\/ucb\/UniversalContentBroker.hpp>\n#include <comphelper\/processfactory.hxx>\n#include <unotools\/tempfile.hxx>\n#include <unotools\/localfilehelper.hxx>\n#include <unotools\/ucbstreamhelper.hxx>\n#include <ucbhelper\/fileidentifierconverter.hxx>\n#include <rtl\/ustring.hxx>\n#include <rtl\/instance.hxx>\n#include <osl\/file.hxx>\n#include <tools\/time.hxx>\n#include <tools\/debug.hxx>\n#include <stdio.h>\n\n#ifdef UNX\n#include <sys\/stat.h>\n#endif\n\nusing namespace osl;\n\nnamespace\n{\n    struct TempNameBase_Impl\n        : public rtl::Static< OUString, TempNameBase_Impl > {};\n}\n\nnamespace utl\n{\n\nOUString getParentName( const OUString& aFileName )\n{\n    sal_Int32 lastIndex = aFileName.lastIndexOf( '\/' );\n    OUString aParent = aFileName.copy( 0, lastIndex );\n\n    if( aParent.endsWith(\":\") && aParent.getLength() == 6 )\n        aParent += \"\/\";\n\n    if( aParent.equalsAscii( \"file:\/\/\" ) )\n        aParent = \"file:\/\/\/\";\n\n    return aParent;\n}\n\nbool ensuredir( const OUString& rUnqPath )\n{\n    OUString aPath;\n    if ( rUnqPath.isEmpty() )\n        return false;\n\n    \/\/ remove trailing slash\n    if ( rUnqPath.endsWith(\"\/\") )\n        aPath = rUnqPath.copy( 0, rUnqPath.getLength() - 1 );\n    else\n        aPath = rUnqPath;\n\n    \/\/ HACK: create directory on a mount point with nobrowse option\n    \/\/ returns ENOSYS in any case !!\n    osl::Directory aDirectory( aPath );\n    osl::FileBase::RC nError = aDirectory.open();\n    aDirectory.close();\n    if( nError == osl::File::E_None )\n        return true;\n\n    \/\/ try to create the directory\n    nError = osl::Directory::create( aPath );\n    bool  bSuccess = ( nError == osl::File::E_None || nError == osl::FileBase::E_EXIST );\n    if( !bSuccess )\n    {\n        \/\/ perhaps parent(s) don't exist\n        OUString aParentDir = getParentName( aPath );\n        if ( aParentDir != aPath )\n        {\n            bSuccess = ensuredir( getParentName( aPath ) );\n\n            \/\/ After parent directory structure exists try it one's more\n            if ( bSuccess )\n            {\n                \/\/ Parent directory exists, retry creation of directory\n                nError = osl::Directory::create( aPath );\n                bSuccess =( nError == osl::File::E_None || nError == osl::FileBase::E_EXIST );\n            }\n        }\n    }\n\n    return bSuccess;\n}\n\nOUString ConstructTempDir_Impl( const OUString* pParent )\n{\n    OUString aName;\n    if ( pParent && !pParent->isEmpty() )\n    {\n        com::sun::star::uno::Reference<\n            com::sun::star::ucb::XUniversalContentBroker > pBroker(\n                com::sun::star::ucb::UniversalContentBroker::create(\n                    comphelper::getProcessComponentContext() ) );\n\n        \/\/ if parent given try to use it\n        OUString aTmp( *pParent );\n\n        \/\/ test for valid filename\n        OUString aRet;\n        ::osl::FileBase::getFileURLFromSystemPath(\n            ::ucbhelper::getSystemPathFromFileURL( pBroker, aTmp ),\n            aRet );\n        if ( !aRet.isEmpty() )\n        {\n            ::osl::DirectoryItem aItem;\n            sal_Int32 i = aRet.getLength();\n            if ( aRet[i-1] == '\/' )\n                i--;\n\n            if ( DirectoryItem::get( aRet.copy(0, i), aItem ) == FileBase::E_None )\n                aName = aRet;\n        }\n    }\n\n    if ( aName.isEmpty() )\n    {\n        OUString &rTempNameBase_Impl = TempNameBase_Impl::get();\n        if (rTempNameBase_Impl.isEmpty())\n        {\n            OUString ustrTempDirURL;\n            ::osl::FileBase::RC rc = ::osl::File::getTempDirURL(\n                ustrTempDirURL );\n            if (rc == ::osl::FileBase::E_None)\n                rTempNameBase_Impl = ustrTempDirURL;\n        }\n        \/\/ if no parent or invalid parent : use default directory\n        DBG_ASSERT( !rTempNameBase_Impl.isEmpty(), \"No TempDir!\" );\n        aName = rTempNameBase_Impl;\n        ensuredir( aName );\n    }\n\n    \/\/ Make sure that directory ends with a separator\n    if( !aName.isEmpty() && !aName.endsWith(\"\/\") )\n        aName += \"\/\";\n\n    return aName;\n}\n\nOUString lcl_createName(\n    const OUString& rLeadingChars, unsigned long nSeed, sal_Int16 nRadix,\n    bool bFirst, const OUString* pExtension, const OUString* pParent,\n    bool bDirectory, bool bKeep, bool bLock)\n{\n    \/\/ 36 ** 6 == 2176782336\n    unsigned long const nMaxRadix = 36;\n    unsigned long const nMax = (nMaxRadix*nMaxRadix*nMaxRadix*nMaxRadix*nMaxRadix*nMaxRadix);\n    nSeed %= nMax;\n\n    \/\/ get correct directory\n    OUString aName = ConstructTempDir_Impl( pParent );\n\n    bool bUseNumber = bFirst;\n    \/\/ now use special naming scheme ( name takes leading chars and an index counting up from zero\n    aName += rLeadingChars;\n    for ( unsigned long i=nSeed;; )\n    {\n        OUString aTmp( aName );\n        if ( bUseNumber )\n            aTmp += OUString::number(i, nRadix);\n        bUseNumber = true;\n        if ( pExtension )\n            aTmp += *pExtension;\n        else\n            aTmp += \".tmp\";\n        if ( bDirectory )\n        {\n            FileBase::RC err = Directory::create( aTmp );\n            if ( err == FileBase::E_None )\n            {\n                \/\/ !bKeep: only for creating a name, not a file or directory\n                if ( bKeep || Directory::remove( aTmp ) == FileBase::E_None )\n                    return aTmp;\n                else\n                    return OUString();\n            }\n            else if ( err != FileBase::E_EXIST )\n                \/\/ if f.e. name contains invalid chars stop trying to create dirs\n                return OUString();\n        }\n        else\n        {\n            DBG_ASSERT( bKeep, \"Too expensive, use directory for creating name!\" );\n            File aFile( aTmp );\n#ifdef UNX\n            \/* RW permission for the user only! *\/\n            mode_t old_mode = umask(077);\n#endif\n            FileBase::RC err = aFile.open(osl_File_OpenFlag_Create | (bLock ? 0 : osl_File_OpenFlag_NoLock));\n#ifdef UNX\n            umask(old_mode);\n#endif\n            if ( err == FileBase::E_None || (bLock && err == FileBase::E_NOLCK) )\n            {\n                aFile.close();\n                return aTmp;\n            }\n            else if ( err != FileBase::E_EXIST )\n            {\n                \/\/ if f.e. name contains invalid chars stop trying to create dirs\n                \/\/ but if there is a folder with such name proceed further\n\n                DirectoryItem aTmpItem;\n                FileStatus aTmpStatus( osl_FileStatus_Mask_Type );\n                if ( DirectoryItem::get( aTmp, aTmpItem ) != FileBase::E_None\n                  || aTmpItem.getFileStatus( aTmpStatus ) != FileBase::E_None\n                  || aTmpStatus.getFileType() != FileStatus::Directory )\n                    return OUString();\n            }\n        }\n        i = (i + 1) % nMax;\n        if (i == nSeed) {\n            return OUString();\n        }\n    }\n}\n\nOUString lcl_createName_BROKEN(\n    const OUString& rLeadingChars, sal_Int16 nRadix,\n    bool bFirst, const OUString* pExtension, const OUString* pParent,\n    bool bDirectory, bool bKeep, bool bLock)\n{\n    \/\/ 36 ** 6 == 2176782336\n    unsigned long const nMaxRadix = 36;\n    unsigned long const nMax = (nMaxRadix*nMaxRadix*nMaxRadix*nMaxRadix*nMaxRadix*nMaxRadix);\n    static unsigned long nSeed = Time::GetSystemTicks() % nMax;\n\n    \/\/ get correct directory\n    OUString aName = ConstructTempDir_Impl( pParent );\n\n    bool bUseNumber = bFirst;\n    \/\/ now use special naming scheme ( name takes leading chars and an index counting up from zero\n    aName += rLeadingChars;\n    for ( unsigned long i=nSeed;; )\n    {\n        OUString aTmp( aName );\n        if ( bUseNumber )\n            aTmp += OUString::number(nSeed, nRadix);\n        bUseNumber = true;\n        if ( pExtension )\n            aTmp += *pExtension;\n        else\n            aTmp += \".tmp\";\n        if ( bDirectory )\n        {\n            FileBase::RC err = Directory::create( aTmp );\n            if ( err == FileBase::E_None )\n            {\n                \/\/ !bKeep: only for creating a name, not a file or directory\n                if ( bKeep || Directory::remove( aTmp ) == FileBase::E_None )\n                    return aTmp;\n                else\n                    return OUString();\n            }\n            else if ( err != FileBase::E_EXIST )\n                \/\/ if f.e. name contains invalid chars stop trying to create dirs\n                return OUString();\n        }\n        else\n        {\n            DBG_ASSERT( bKeep, \"Too expensive, use directory for creating name!\" );\n            File aFile( aTmp );\n#ifdef UNX\n            \/* RW permission for the user only! *\/\n            mode_t old_mode = umask(077);\n#endif\n            FileBase::RC err = aFile.open(osl_File_OpenFlag_Create | (bLock ? 0 : osl_File_OpenFlag_NoLock));\n#ifdef UNX\n            umask(old_mode);\n#endif\n            if ( err == FileBase::E_None || (bLock && err == FileBase::E_NOLCK) )\n            {\n                aFile.close();\n                return aTmp;\n            }\n            else if ( err != FileBase::E_EXIST )\n            {\n                \/\/ if f.e. name contains invalid chars stop trying to create dirs\n                \/\/ but if there is a folder with such name proceed further\n\n                DirectoryItem aTmpItem;\n                FileStatus aTmpStatus( osl_FileStatus_Mask_Type );\n                if ( DirectoryItem::get( aTmp, aTmpItem ) != FileBase::E_None\n                  || aTmpItem.getFileStatus( aTmpStatus ) != FileBase::E_None\n                  || aTmpStatus.getFileType() != FileStatus::Directory )\n                    return OUString();\n            }\n        }\n        nSeed = (nSeed + 1) % nMax;\n        if (i == nSeed) {\n            return OUString();\n        }\n    }\n}\n\nOUString CreateTempName_Impl( const OUString* pParent, bool bKeep, bool bDir = true )\n{\n    OUString aEyeCatcher = \"lu\";\n#ifdef DBG_UTIL\n#ifdef UNX\n    const char* eye = getenv(\"LO_TESTNAME\");\n    if(eye)\n    {\n        aEyeCatcher = OUString(eye, strlen(eye), RTL_TEXTENCODING_ASCII_US);\n    }\n#endif\n#endif\n    return lcl_createName_BROKEN(\n        aEyeCatcher, 36, true, 0, pParent, bDir, bKeep,\n        false);\n}\n\nOUString TempFile::CreateTempName()\n{\n    OUString aName(CreateTempName_Impl( 0, false ));\n\n    \/\/ convert to file URL\n    OUString aTmp;\n    if ( !aName.isEmpty() )\n        FileBase::getSystemPathFromFileURL( aName, aTmp );\n    return aTmp;\n}\n\nTempFile::TempFile( const OUString* pParent, bool bDirectory )\n    : pStream( 0 )\n    , bIsDirectory( bDirectory )\n    , bKillingFileEnabled( false )\n{\n    aName = CreateTempName_Impl( pParent, true, bDirectory );\n}\n\nTempFile::TempFile( const OUString& rLeadingChars, bool _bStartWithZero, const OUString* pExtension, const OUString* pParent, bool bDirectory)\n    : pStream( 0 )\n    , bIsDirectory( bDirectory )\n    , bKillingFileEnabled( false )\n{\n    aName = lcl_createName(rLeadingChars, 0, 10, _bStartWithZero, pExtension, pParent, bDirectory, true, true);\n}\n\nTempFile::~TempFile()\n{\n    delete pStream;\n    if ( bKillingFileEnabled )\n    {\n        if ( bIsDirectory )\n        {\n            \/\/ at the moment no recursiv algorithm present\n            Directory::remove( aName );\n        }\n        else\n        {\n            File::remove( aName );\n        }\n    }\n}\n\nbool TempFile::IsValid() const\n{\n    return !aName.isEmpty();\n}\n\nOUString TempFile::GetFileName() const\n{\n    OUString aTmp;\n    FileBase::getSystemPathFromFileURL( aName, aTmp );\n    return aTmp;\n}\n\nOUString TempFile::GetURL()\n{\n    if ( aURL.isEmpty() )\n    {\n        OUString aTmp;\n        LocalFileHelper::ConvertPhysicalNameToURL( GetFileName(), aTmp );\n        aURL = aTmp;\n    }\n\n    return aURL;\n}\n\nSvStream* TempFile::GetStream( StreamMode eMode )\n{\n    if ( !pStream )\n    {\n        if ( !GetURL().isEmpty() )\n            pStream = UcbStreamHelper::CreateStream( aURL, eMode, true \/* bFileExists *\/ );\n        else\n            pStream = new SvMemoryStream( eMode );\n    }\n\n    return pStream;\n}\n\nvoid TempFile::CloseStream()\n{\n    if ( pStream )\n    {\n        delete pStream;\n        pStream = NULL;\n    }\n}\n\nOUString TempFile::SetTempNameBaseDirectory( const OUString &rBaseName )\n{\n    if( rBaseName.isEmpty() )\n        return OUString();\n\n    OUString aUnqPath( rBaseName );\n\n    \/\/ remove trailing slash\n    if ( rBaseName.endsWith(\"\/\") )\n        aUnqPath = rBaseName.copy( 0, rBaseName.getLength() - 1 );\n\n    \/\/ try to create the directory\n    bool bRet = false;\n    osl::FileBase::RC err = osl::Directory::create( aUnqPath );\n    if ( err != FileBase::E_None && err != FileBase::E_EXIST )\n        \/\/ perhaps parent(s) don't exist\n        bRet = ensuredir( aUnqPath );\n    else\n        bRet = true;\n\n    \/\/ failure to create base directory means returning an empty string\n    OUString aTmp;\n    if ( bRet )\n    {\n        \/\/ append own internal directory\n        bRet = true;\n        OUString &rTempNameBase_Impl = TempNameBase_Impl::get();\n        rTempNameBase_Impl = rBaseName;\n        rTempNameBase_Impl += OUString('\/');\n\n        TempFile aBase( NULL, true );\n        if ( aBase.IsValid() )\n            \/\/ use it in case of success\n            rTempNameBase_Impl = aBase.aName;\n\n        \/\/ return system path of used directory\n        FileBase::getSystemPathFromFileURL( rTempNameBase_Impl, aTmp );\n    }\n\n    return aTmp;\n}\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Abstract over Tokens algorithm<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 <sal\/config.h>\n\n#include <cassert>\n\n#include <com\/sun\/star\/ucb\/UniversalContentBroker.hpp>\n#include <comphelper\/processfactory.hxx>\n#include <unotools\/tempfile.hxx>\n#include <unotools\/localfilehelper.hxx>\n#include <unotools\/ucbstreamhelper.hxx>\n#include <ucbhelper\/fileidentifierconverter.hxx>\n#include <rtl\/ustring.hxx>\n#include <rtl\/instance.hxx>\n#include <osl\/file.hxx>\n#include <tools\/time.hxx>\n#include <tools\/debug.hxx>\n#include <stdio.h>\n\n#ifdef UNX\n#include <sys\/stat.h>\n#endif\n\nusing namespace osl;\n\nnamespace\n{\n    struct TempNameBase_Impl\n        : public rtl::Static< OUString, TempNameBase_Impl > {};\n}\n\nnamespace utl\n{\n\nOUString getParentName( const OUString& aFileName )\n{\n    sal_Int32 lastIndex = aFileName.lastIndexOf( '\/' );\n    OUString aParent = aFileName.copy( 0, lastIndex );\n\n    if( aParent.endsWith(\":\") && aParent.getLength() == 6 )\n        aParent += \"\/\";\n\n    if( aParent.equalsAscii( \"file:\/\/\" ) )\n        aParent = \"file:\/\/\/\";\n\n    return aParent;\n}\n\nbool ensuredir( const OUString& rUnqPath )\n{\n    OUString aPath;\n    if ( rUnqPath.isEmpty() )\n        return false;\n\n    \/\/ remove trailing slash\n    if ( rUnqPath.endsWith(\"\/\") )\n        aPath = rUnqPath.copy( 0, rUnqPath.getLength() - 1 );\n    else\n        aPath = rUnqPath;\n\n    \/\/ HACK: create directory on a mount point with nobrowse option\n    \/\/ returns ENOSYS in any case !!\n    osl::Directory aDirectory( aPath );\n    osl::FileBase::RC nError = aDirectory.open();\n    aDirectory.close();\n    if( nError == osl::File::E_None )\n        return true;\n\n    \/\/ try to create the directory\n    nError = osl::Directory::create( aPath );\n    bool  bSuccess = ( nError == osl::File::E_None || nError == osl::FileBase::E_EXIST );\n    if( !bSuccess )\n    {\n        \/\/ perhaps parent(s) don't exist\n        OUString aParentDir = getParentName( aPath );\n        if ( aParentDir != aPath )\n        {\n            bSuccess = ensuredir( getParentName( aPath ) );\n\n            \/\/ After parent directory structure exists try it one's more\n            if ( bSuccess )\n            {\n                \/\/ Parent directory exists, retry creation of directory\n                nError = osl::Directory::create( aPath );\n                bSuccess =( nError == osl::File::E_None || nError == osl::FileBase::E_EXIST );\n            }\n        }\n    }\n\n    return bSuccess;\n}\n\nOUString ConstructTempDir_Impl( const OUString* pParent )\n{\n    OUString aName;\n    if ( pParent && !pParent->isEmpty() )\n    {\n        com::sun::star::uno::Reference<\n            com::sun::star::ucb::XUniversalContentBroker > pBroker(\n                com::sun::star::ucb::UniversalContentBroker::create(\n                    comphelper::getProcessComponentContext() ) );\n\n        \/\/ if parent given try to use it\n        OUString aTmp( *pParent );\n\n        \/\/ test for valid filename\n        OUString aRet;\n        ::osl::FileBase::getFileURLFromSystemPath(\n            ::ucbhelper::getSystemPathFromFileURL( pBroker, aTmp ),\n            aRet );\n        if ( !aRet.isEmpty() )\n        {\n            ::osl::DirectoryItem aItem;\n            sal_Int32 i = aRet.getLength();\n            if ( aRet[i-1] == '\/' )\n                i--;\n\n            if ( DirectoryItem::get( aRet.copy(0, i), aItem ) == FileBase::E_None )\n                aName = aRet;\n        }\n    }\n\n    if ( aName.isEmpty() )\n    {\n        OUString &rTempNameBase_Impl = TempNameBase_Impl::get();\n        if (rTempNameBase_Impl.isEmpty())\n        {\n            OUString ustrTempDirURL;\n            ::osl::FileBase::RC rc = ::osl::File::getTempDirURL(\n                ustrTempDirURL );\n            if (rc == ::osl::FileBase::E_None)\n                rTempNameBase_Impl = ustrTempDirURL;\n        }\n        \/\/ if no parent or invalid parent : use default directory\n        DBG_ASSERT( !rTempNameBase_Impl.isEmpty(), \"No TempDir!\" );\n        aName = rTempNameBase_Impl;\n        ensuredir( aName );\n    }\n\n    \/\/ Make sure that directory ends with a separator\n    if( !aName.isEmpty() && !aName.endsWith(\"\/\") )\n        aName += \"\/\";\n\n    return aName;\n}\n\nclass Tokens {\npublic:\n    virtual bool next(OUString *) = 0;\n\nprotected:\n    virtual ~Tokens() {} \/\/ avoid warnings\n};\n\nclass SequentialTokens: public Tokens {\npublic:\n    explicit SequentialTokens(bool showZero): m_value(0), m_show(showZero) {}\n\n    bool next(OUString * token) SAL_OVERRIDE {\n        assert(token != 0);\n        if (m_value == SAL_MAX_UINT32) {\n            return false;\n        }\n        *token = m_show ? OUString::number(m_value) : OUString();\n        ++m_value;\n        m_show = true;\n        return true;\n    }\n\nprivate:\n    sal_uInt32 m_value;\n    bool m_show;\n};\n\nclass UniqueTokens: public Tokens {\npublic:\n    UniqueTokens(): m_count(0) {}\n\n    bool next(OUString * token) SAL_OVERRIDE {\n        assert(token != 0);\n        \/\/ Because of the shared globalValue, no single instance of UniqueTokens\n        \/\/ is guaranteed to exhaustively test all 36^6 possible values, but stop\n        \/\/ after that many attempts anyway:\n        sal_uInt32 radix = 36;\n        sal_uInt32 max = radix * radix * radix * radix * radix * radix;\n            \/\/ 36^6 == 2'176'782'336 < SAL_MAX_UINT32 == 4'294'967'295\n        if (m_count == max) {\n            return false;\n        }\n        sal_uInt32 v;\n        {\n            osl::MutexGuard g(osl::Mutex::getGlobalMutex());\n            globalValue\n                = ((globalValue == SAL_MAX_UINT32\n                    ? Time::GetSystemTicks() : globalValue + 1)\n                   % max);\n            v = globalValue;\n        }\n        *token = OUString::number(v, radix);\n        ++m_count;\n        return true;\n    }\n\nprivate:\n    static sal_uInt32 globalValue;\n\n    sal_uInt32 m_count;\n};\n\nsal_uInt32 UniqueTokens::globalValue = SAL_MAX_UINT32;\n\nOUString lcl_createName(\n    const OUString& rLeadingChars, Tokens & tokens, const OUString* pExtension,\n    const OUString* pParent, bool bDirectory, bool bKeep, bool bLock)\n{\n    OUString aName = ConstructTempDir_Impl( pParent ) + rLeadingChars;;\n    OUString token;\n    while (tokens.next(&token))\n    {\n        OUString aTmp( aName + token );\n        if ( pExtension )\n            aTmp += *pExtension;\n        else\n            aTmp += \".tmp\";\n        if ( bDirectory )\n        {\n            FileBase::RC err = Directory::create( aTmp );\n            if ( err == FileBase::E_None )\n            {\n                \/\/ !bKeep: only for creating a name, not a file or directory\n                if ( bKeep || Directory::remove( aTmp ) == FileBase::E_None )\n                    return aTmp;\n                else\n                    return OUString();\n            }\n            else if ( err != FileBase::E_EXIST )\n                \/\/ if f.e. name contains invalid chars stop trying to create dirs\n                return OUString();\n        }\n        else\n        {\n            DBG_ASSERT( bKeep, \"Too expensive, use directory for creating name!\" );\n            File aFile( aTmp );\n#ifdef UNX\n            \/* RW permission for the user only! *\/\n            mode_t old_mode = umask(077);\n#endif\n            FileBase::RC err = aFile.open(osl_File_OpenFlag_Create | (bLock ? 0 : osl_File_OpenFlag_NoLock));\n#ifdef UNX\n            umask(old_mode);\n#endif\n            if ( err == FileBase::E_None || (bLock && err == FileBase::E_NOLCK) )\n            {\n                aFile.close();\n                return aTmp;\n            }\n            else if ( err != FileBase::E_EXIST )\n            {\n                \/\/ if f.e. name contains invalid chars stop trying to create dirs\n                \/\/ but if there is a folder with such name proceed further\n\n                DirectoryItem aTmpItem;\n                FileStatus aTmpStatus( osl_FileStatus_Mask_Type );\n                if ( DirectoryItem::get( aTmp, aTmpItem ) != FileBase::E_None\n                  || aTmpItem.getFileStatus( aTmpStatus ) != FileBase::E_None\n                  || aTmpStatus.getFileType() != FileStatus::Directory )\n                    return OUString();\n            }\n        }\n    }\n    return OUString();\n}\n\nOUString CreateTempName_Impl( const OUString* pParent, bool bKeep, bool bDir = true )\n{\n    OUString aEyeCatcher = \"lu\";\n#ifdef DBG_UTIL\n#ifdef UNX\n    const char* eye = getenv(\"LO_TESTNAME\");\n    if(eye)\n    {\n        aEyeCatcher = OUString(eye, strlen(eye), RTL_TEXTENCODING_ASCII_US);\n    }\n#endif\n#endif\n    UniqueTokens t;\n    return lcl_createName(aEyeCatcher, t, 0, pParent, bDir, bKeep, false);\n}\n\nOUString TempFile::CreateTempName()\n{\n    OUString aName(CreateTempName_Impl( 0, false ));\n\n    \/\/ convert to file URL\n    OUString aTmp;\n    if ( !aName.isEmpty() )\n        FileBase::getSystemPathFromFileURL( aName, aTmp );\n    return aTmp;\n}\n\nTempFile::TempFile( const OUString* pParent, bool bDirectory )\n    : pStream( 0 )\n    , bIsDirectory( bDirectory )\n    , bKillingFileEnabled( false )\n{\n    aName = CreateTempName_Impl( pParent, true, bDirectory );\n}\n\nTempFile::TempFile( const OUString& rLeadingChars, bool _bStartWithZero, const OUString* pExtension, const OUString* pParent, bool bDirectory)\n    : pStream( 0 )\n    , bIsDirectory( bDirectory )\n    , bKillingFileEnabled( false )\n{\n    SequentialTokens t(_bStartWithZero);\n    aName = lcl_createName(rLeadingChars, t, pExtension, pParent, bDirectory, true, true);\n}\n\nTempFile::~TempFile()\n{\n    delete pStream;\n    if ( bKillingFileEnabled )\n    {\n        if ( bIsDirectory )\n        {\n            \/\/ at the moment no recursiv algorithm present\n            Directory::remove( aName );\n        }\n        else\n        {\n            File::remove( aName );\n        }\n    }\n}\n\nbool TempFile::IsValid() const\n{\n    return !aName.isEmpty();\n}\n\nOUString TempFile::GetFileName() const\n{\n    OUString aTmp;\n    FileBase::getSystemPathFromFileURL( aName, aTmp );\n    return aTmp;\n}\n\nOUString TempFile::GetURL()\n{\n    if ( aURL.isEmpty() )\n    {\n        OUString aTmp;\n        LocalFileHelper::ConvertPhysicalNameToURL( GetFileName(), aTmp );\n        aURL = aTmp;\n    }\n\n    return aURL;\n}\n\nSvStream* TempFile::GetStream( StreamMode eMode )\n{\n    if ( !pStream )\n    {\n        if ( !GetURL().isEmpty() )\n            pStream = UcbStreamHelper::CreateStream( aURL, eMode, true \/* bFileExists *\/ );\n        else\n            pStream = new SvMemoryStream( eMode );\n    }\n\n    return pStream;\n}\n\nvoid TempFile::CloseStream()\n{\n    if ( pStream )\n    {\n        delete pStream;\n        pStream = NULL;\n    }\n}\n\nOUString TempFile::SetTempNameBaseDirectory( const OUString &rBaseName )\n{\n    if( rBaseName.isEmpty() )\n        return OUString();\n\n    OUString aUnqPath( rBaseName );\n\n    \/\/ remove trailing slash\n    if ( rBaseName.endsWith(\"\/\") )\n        aUnqPath = rBaseName.copy( 0, rBaseName.getLength() - 1 );\n\n    \/\/ try to create the directory\n    bool bRet = false;\n    osl::FileBase::RC err = osl::Directory::create( aUnqPath );\n    if ( err != FileBase::E_None && err != FileBase::E_EXIST )\n        \/\/ perhaps parent(s) don't exist\n        bRet = ensuredir( aUnqPath );\n    else\n        bRet = true;\n\n    \/\/ failure to create base directory means returning an empty string\n    OUString aTmp;\n    if ( bRet )\n    {\n        \/\/ append own internal directory\n        bRet = true;\n        OUString &rTempNameBase_Impl = TempNameBase_Impl::get();\n        rTempNameBase_Impl = rBaseName;\n        rTempNameBase_Impl += OUString('\/');\n\n        TempFile aBase( NULL, true );\n        if ( aBase.IsValid() )\n            \/\/ use it in case of success\n            rTempNameBase_Impl = aBase.aName;\n\n        \/\/ return system path of used directory\n        FileBase::getSystemPathFromFileURL( rTempNameBase_Impl, aTmp );\n    }\n\n    return aTmp;\n}\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"TextureFont.hpp\"\n#include FT_LCD_FILTER_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_Error error;\n\tFT_Library library;\n\tFT_Face face;\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}\n\t}\n\n\tFT_Done_Face(face);\n\tFT_Done_FreeType(library);\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)\n\t{\n\t\tthrow new std::exception();\n\t}\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>slot, bitmap, top and left for outline none<commit_after>#include \"TextureFont.hpp\"\n#include FT_LCD_FILTER_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_Error error;\n\tFT_Library library;\n\tFT_Face face;\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\n\t\t\tif (_outlineType == 0)\n\t\t\t{\n\t\t\t\tFT_GlyphSlot slot = face->glyph;\n\t\t\t\tFT_Bitmap bitmap = slot->bitmap;\n\t\t\t\tint top = slot->bitmap_top;\n\t\t\t\tint left = slot->bitmap_left;\n\t\t\t}\n\t\t}\n\t}\n\n\tFT_Done_Face(face);\n\tFT_Done_FreeType(library);\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)\n\t{\n\t\tthrow new std::exception();\n\t}\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>#include \"AppInfo.h\"\n#include \"Config.h\"\n#include \"DNSMusic.h\"\n\n#include <iostream>\n#include <mosquittopp.h>\n#include <signal.h>\n#include <sys\/stat.h>\n\nusing namespace std;\n\nvolatile bool receivedSIGINT{ false };\n\nvoid handleSIGINT (int) {\n    cerr << \"revieced signal for signalhandler\" << endl;\n    receivedSIGINT = true;\n}\n\nvoid handleSIGCHLD (int) {\n    \/*TODO implement SIGCHLD handler*\/\n    int status;\n    pid_t pid = wait (&status);\n    \/*lookup pid in map to find function\n    remove pid entry from map\n    call function\n    *\/\n}\n\nint main (int argc, char* argv[]) {\n    signal (SIGINT, handleSIGINT);\n    signal (SIGCHLD, handleSIGCHLD);\n\n    int major{ 0 };\n    int minor{ 0 };\n    int revision{ 0 };\n\n    \/\/ temp test\n    if (argc != 2) {\n        std::cout << \"usage: \" << argv[0] << \" file.ogg\" << std::endl;\n        return 1;\n    }\n\n    std::string music_file = argv[1];\n\n    struct stat buffer;\n    if (stat (music_file.c_str (), &buffer) != 0) {\n        std::perror (\"error, file:\");\n        return 1;\n    }\n    \/\/ end temp\n\n    cout << \"-- MQTT application: \" << APPNAME_VERSION << \"  \";\n    mosqpp::lib_init ();\n    mosqpp::lib_version (&major, &minor, &revision);\n    cout << \"uses Mosquitto lib version \" << major << '.' << minor << '.'\n         << revision << endl;\n    try {\n        DNSMusic client (\"DNSMusic\", \"tempDNS\", MQTT_BROKER, MQTT_BROKER_PORT, music_file);\n\n        \/\/ auto clients{ static_cast<mosqpp::mosquittopp*> (&tempDNS) };\n\n        while (!receivedSIGINT) {\n            \/\/ for (auto client : clients) {\n            int rc = client.loop ();\n            if (rc) {\n                cerr << \"-- MQTT reconnect\" << std::endl;\n                client.reconnect ();\n            }\n            \/\/}\n        }\n    } catch (exception& e) {\n        cerr << \"Exception \" << e.what () << std::endl;\n    } catch (...) {\n        cerr << \"UNKNOWN EXCEPTION \\n\";\n    }\n\n    cout << \"-- MQTT application: \" << APPNAME_VERSION << \" stopped\" << endl\n         << endl;\n    mosqpp::lib_cleanup ();\n\n    return 0;\n}\n<commit_msg>fix compile warning and a faulty string<commit_after>#include \"AppInfo.h\"\n#include \"Config.h\"\n#include \"DNSMusic.h\"\n\n#include <iostream>\n#include <mosquittopp.h>\n#include <signal.h>\n#include <sys\/stat.h>\n\nusing namespace std;\n\nvolatile bool receivedSIGINT{ false };\n\nvoid handleSIGINT (int) {\n    cerr << \"revieced signal for signalhandler\" << endl;\n    receivedSIGINT = true;\n}\n\nvoid handleSIGCHLD (int) {\n    \/*TODO implement SIGCHLD handler*\/\n    int status;\n    wait (&status); \/\/ pid_t pid =\n    \/*lookup pid in map to find function\n    remove pid entry from map\n    call function\n    *\/\n}\n\nint main (int argc, char* argv[]) {\n    signal (SIGINT, handleSIGINT);\n    signal (SIGCHLD, handleSIGCHLD);\n\n    int major{ 0 };\n    int minor{ 0 };\n    int revision{ 0 };\n\n    \/\/ temp test\n    if (argc != 2) {\n        std::cout << \"usage: \" << argv[0] << \" file.ogg\" << std::endl;\n        return 1;\n    }\n\n    std::string music_file = argv[1];\n\n    struct stat buffer;\n    if (stat (music_file.c_str (), &buffer) != 0) {\n        std::perror (\"error, file\");\n        return 1;\n    }\n    \/\/ end temp\n\n    cout << \"-- MQTT application: \" << APPNAME_VERSION << \"  \";\n    mosqpp::lib_init ();\n    mosqpp::lib_version (&major, &minor, &revision);\n    cout << \"uses Mosquitto lib version \" << major << '.' << minor << '.'\n         << revision << endl;\n    try {\n        DNSMusic client (\"DNSMusic\", \"tempDNS\", MQTT_BROKER, MQTT_BROKER_PORT, music_file);\n\n        \/\/ auto clients{ static_cast<mosqpp::mosquittopp*> (&tempDNS) };\n\n        while (!receivedSIGINT) {\n            \/\/ for (auto client : clients) {\n            int rc = client.loop ();\n            if (rc) {\n                cerr << \"-- MQTT reconnect\" << std::endl;\n                client.reconnect ();\n            }\n            \/\/}\n        }\n    } catch (exception& e) {\n        cerr << \"Exception \" << e.what () << std::endl;\n    } catch (...) {\n        cerr << \"UNKNOWN EXCEPTION \\n\";\n    }\n\n    cout << \"-- MQTT application: \" << APPNAME_VERSION << \" stopped\" << endl\n         << endl;\n    mosqpp::lib_cleanup ();\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#pragma once\n\n#include <math.h>\n#include <sys\/time.h>\n#include <stdint.h>\n#include <deque>\n#include <vector>\n#include <stdexcept>\n#include <typeinfo>\n#include <QString>\n#include \"Geometry2d\/Point.hpp\"\n#include \"Constants.hpp\"\n#include \"time.hpp\"\n\/\/#include <iostream>\n#include <math.h>\nusing namespace std;\n\n\n\/**\n * @brief Restricts the given angle to be between pi and -pi\n * \n * @param a An angle in radians\n * @return An equivalent angle in radians restricted to [-pi, pi]\n *\/\nstatic inline float fixAngleRadians(float a)\n{\n\ta= remainder(a, 2*M_PI);\n\t\/\/cout<<\"angle \"<<a<<endl;\n\twhile (a < -M_PI) a += 2.0*M_PI;\n\n\twhile (a > M_PI) a -= 2.0*M_PI;\n\treturn a;\n}\n\n\/** Checks whether or not the given ball is in the defense area. *\/\nstatic inline bool ballIsInGoalieBox(Geometry2d::Point point) {\n\tif (abs(point.x) < Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f) \/\/ Ball is in center (rectangular) portion of defensive bubble\n\t{\n\t\tif (point.y > 0 && point.y < Field_Dimensions::Current_Dimensions.ArcRadius()) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t} else if (abs(point.x) < (Field_Dimensions::Current_Dimensions.ArcRadius() + Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f)) \/\/ Ball is in one of the side (arc) portions of defensive bubble\n\t{\n\t\tdouble adjusted_x = abs(point.x) - (Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f);\n\t\tdouble max_y = sqrt( (Field_Dimensions::Current_Dimensions.ArcRadius() * Field_Dimensions::Current_Dimensions.ArcRadius()) - (adjusted_x * adjusted_x));\n\t\tif (point.y > 0 && point.y <= max_y) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n\nstatic Geometry2d::Point fromOursToTheirs(Geometry2d::Point &pt) {\n\tGeometry2d::Point c;\n\tc.y = Field_Dimensions::Current_Dimensions.Length() - pt.y;\n\tc.x = -pt.x;\n\n\treturn c;\n}\n\nstatic bool ballIsInTheirGoalieBox(Geometry2d::Point &pt) {\n\tGeometry2d::Point converted = fromOursToTheirs(pt);\n\treturn ballIsInGoalieBox(converted);\n}\n\n\n\n\/** Handles saturation of a bounded value *\/\ntemplate<class T>\nfloat clamp(T value, T min, T max)\n{\n\tif (value > max)\n\t{\n\t\treturn max;\n\t}\n\telse if (value < min)\n\t{\n\t\treturn min;\n\t}\n\treturn value;\n}\n\n\/\/ Removes all entries in a std::map which associate to the given value.\ntemplate<class Map_Type, class Data_Type>\nvoid map_remove(Map_Type &map, Data_Type &value)\n{\n\ttypename Map_Type::iterator i = map.begin();\n\twhile (i != map.end())\n\t{\n\t\ttypename Map_Type::iterator next = i;\n\t\t++next;\n\n\t\tif (i->second == value)\n\t\t{\n\t\t\tmap.erase(i);\n\t\t}\n\n\t\ti = next;\n\t}\n}\n\n\/\/ If <key> exists in <map>, returns map[key].\n\/\/ If not, returns 0.\ntemplate<typename Map>\ntypename Map::mapped_type map_lookup(const Map &map, typename Map::key_type key)\n{\n\ttypename Map::const_iterator i = map.find(key);\n\tif (i != map.end())\n\t{\n\t\treturn i->second;\n\t} else {\n\t\treturn 0;\n\t}\n}\n\n\/**\n * A basic FIR filter of variable type with float coeffs\n *\n * Note, coefficients will be normalized so that inputs\n * will always be scaled appropriately\n *\/\ntemplate<typename T>\nclass FIRFilter {\npublic:\n\ttypedef std::vector<float> Coeffs;\n\n\tFIRFilter(const T& zero, size_t nrTaps) : _zero(zero) {\n\t\tif (nrTaps == 0)\n\t\t\tthrow std::invalid_argument(\"FIR Filter: number of taps must be greater than zero\");\n\n\t\t\/\/ initialize\n\t\t_taps.assign(nrTaps, _zero);\n\t\t_coeffs.assign(nrTaps, 0.0f);\n\t\t_coeffs[0] = 1.0;\n\t}\n\n\tT filter(const T& x) {\n\t\t_taps.push_front(x);\n\t\t_taps.pop_back();\n\n\t\tT y = _zero;\n\t\tfor (size_t i = 0; i<_taps.size(); ++i)\n\t\t\ty += _taps.at(i) * _coeffs.at(i);\n\n\t\treturn y;\n\t}\n\n\t\/** reinitializes the coeffs and taps to new values *\/\n\tvoid setCoeffs(const Coeffs& coeffs) {\n\t\tsize_t nrTaps = coeffs.size();\n\t\tif (nrTaps == 0)\n\t\t\tthrow std::invalid_argument(\"FIR Filter: number of coeffs must be greater than zero\");\n\n\t\t_taps.assign(nrTaps, _zero);\n\t\t_coeffs.assign(nrTaps, 0.0);\n\n\t\t\/\/ find the normalizer\n\t\tfloat normalizer = 0.0;\n\t\tfor (size_t i = 0; i<coeffs.size(); ++i)\n\t\t\tnormalizer += coeffs.at(i);\n\n\t\t\/\/ set the normalized coefficients\n\t\tfor (size_t i=0; i<coeffs.size(); ++i)\n\t\t\t_coeffs[i] = coeffs.at(i) \/ normalizer;\n\t}\n\nprotected:\n\tT _zero;\n\tstd::deque<T> _taps;\n\tCoeffs _coeffs;\n};\n\n\/\/ An output iterator which throws an exception when it's used.\n\/\/ This is used for example to determine if the output of set_difference would be non-empty without\n\/\/ calculating all of it.\ntemplate<typename T>\nclass ExceptionIterator: public std::iterator<std::output_iterator_tag, void, void, void, void>\n{\npublic:\n\tExceptionIterator &operator=(const T &value)\n\t{\n\t\tthrow std::exception();\n\t}\n\n\tExceptionIterator &operator*()\n\t{\n\t\treturn *this;\n\t}\n\n\tExceptionIterator &operator++()\n\t{\n\t\treturn *this;\n\t}\n\n\tExceptionIterator &operator++(int)\n\t{\n\t\treturn *this;\n\t}\n};\n\n\/\/ Sets str to the name of a class.\n\/\/ Use it like this:\n\/\/\t\tObject *obj = new Object();\n\/\/\t\tQString name = typeName(typeid(*obj));\n\/\/ The returned name is in the usual C++ format: \"Namespace::Namespace::Class\"\nQString typeName(const std::type_info &info);\n\n\/\/ Like typeName, but only returns the final class name part.\nQString className(const std::type_info &info);\n<commit_msg>removed `using namespace std;` from headers<commit_after>\n#pragma once\n\n#include <math.h>\n#include <sys\/time.h>\n#include <stdint.h>\n#include <deque>\n#include <vector>\n#include <stdexcept>\n#include <typeinfo>\n#include <QString>\n#include \"Geometry2d\/Point.hpp\"\n#include \"Constants.hpp\"\n#include \"time.hpp\"\n#include <math.h>\n\n\n\/**\n * @brief Restricts the given angle to be between pi and -pi\n * \n * @param a An angle in radians\n * @return An equivalent angle in radians restricted to [-pi, pi]\n *\/\nstatic inline float fixAngleRadians(float a)\n{\n\ta= remainder(a, 2*M_PI);\n\t\/\/cout<<\"angle \"<<a<<endl;\n\twhile (a < -M_PI) a += 2.0*M_PI;\n\n\twhile (a > M_PI) a -= 2.0*M_PI;\n\treturn a;\n}\n\n\/** Checks whether or not the given ball is in the defense area. *\/\nstatic inline bool ballIsInGoalieBox(Geometry2d::Point point) {\n\tif (abs(point.x) < Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f) \/\/ Ball is in center (rectangular) portion of defensive bubble\n\t{\n\t\tif (point.y > 0 && point.y < Field_Dimensions::Current_Dimensions.ArcRadius()) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t} else if (abs(point.x) < (Field_Dimensions::Current_Dimensions.ArcRadius() + Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f)) \/\/ Ball is in one of the side (arc) portions of defensive bubble\n\t{\n\t\tdouble adjusted_x = abs(point.x) - (Field_Dimensions::Current_Dimensions.GoalFlat() \/ 2.0f);\n\t\tdouble max_y = sqrt( (Field_Dimensions::Current_Dimensions.ArcRadius() * Field_Dimensions::Current_Dimensions.ArcRadius()) - (adjusted_x * adjusted_x));\n\t\tif (point.y > 0 && point.y <= max_y) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n\nstatic Geometry2d::Point fromOursToTheirs(Geometry2d::Point &pt) {\n\tGeometry2d::Point c;\n\tc.y = Field_Dimensions::Current_Dimensions.Length() - pt.y;\n\tc.x = -pt.x;\n\n\treturn c;\n}\n\nstatic bool ballIsInTheirGoalieBox(Geometry2d::Point &pt) {\n\tGeometry2d::Point converted = fromOursToTheirs(pt);\n\treturn ballIsInGoalieBox(converted);\n}\n\n\n\n\/** Handles saturation of a bounded value *\/\ntemplate<class T>\nfloat clamp(T value, T min, T max)\n{\n\tif (value > max)\n\t{\n\t\treturn max;\n\t}\n\telse if (value < min)\n\t{\n\t\treturn min;\n\t}\n\treturn value;\n}\n\n\/\/ Removes all entries in a std::map which associate to the given value.\ntemplate<class Map_Type, class Data_Type>\nvoid map_remove(Map_Type &map, Data_Type &value)\n{\n\ttypename Map_Type::iterator i = map.begin();\n\twhile (i != map.end())\n\t{\n\t\ttypename Map_Type::iterator next = i;\n\t\t++next;\n\n\t\tif (i->second == value)\n\t\t{\n\t\t\tmap.erase(i);\n\t\t}\n\n\t\ti = next;\n\t}\n}\n\n\/\/ If <key> exists in <map>, returns map[key].\n\/\/ If not, returns 0.\ntemplate<typename Map>\ntypename Map::mapped_type map_lookup(const Map &map, typename Map::key_type key)\n{\n\ttypename Map::const_iterator i = map.find(key);\n\tif (i != map.end())\n\t{\n\t\treturn i->second;\n\t} else {\n\t\treturn 0;\n\t}\n}\n\n\/**\n * A basic FIR filter of variable type with float coeffs\n *\n * Note, coefficients will be normalized so that inputs\n * will always be scaled appropriately\n *\/\ntemplate<typename T>\nclass FIRFilter {\npublic:\n\ttypedef std::vector<float> Coeffs;\n\n\tFIRFilter(const T& zero, size_t nrTaps) : _zero(zero) {\n\t\tif (nrTaps == 0)\n\t\t\tthrow std::invalid_argument(\"FIR Filter: number of taps must be greater than zero\");\n\n\t\t\/\/ initialize\n\t\t_taps.assign(nrTaps, _zero);\n\t\t_coeffs.assign(nrTaps, 0.0f);\n\t\t_coeffs[0] = 1.0;\n\t}\n\n\tT filter(const T& x) {\n\t\t_taps.push_front(x);\n\t\t_taps.pop_back();\n\n\t\tT y = _zero;\n\t\tfor (size_t i = 0; i<_taps.size(); ++i)\n\t\t\ty += _taps.at(i) * _coeffs.at(i);\n\n\t\treturn y;\n\t}\n\n\t\/** reinitializes the coeffs and taps to new values *\/\n\tvoid setCoeffs(const Coeffs& coeffs) {\n\t\tsize_t nrTaps = coeffs.size();\n\t\tif (nrTaps == 0)\n\t\t\tthrow std::invalid_argument(\"FIR Filter: number of coeffs must be greater than zero\");\n\n\t\t_taps.assign(nrTaps, _zero);\n\t\t_coeffs.assign(nrTaps, 0.0);\n\n\t\t\/\/ find the normalizer\n\t\tfloat normalizer = 0.0;\n\t\tfor (size_t i = 0; i<coeffs.size(); ++i)\n\t\t\tnormalizer += coeffs.at(i);\n\n\t\t\/\/ set the normalized coefficients\n\t\tfor (size_t i=0; i<coeffs.size(); ++i)\n\t\t\t_coeffs[i] = coeffs.at(i) \/ normalizer;\n\t}\n\nprotected:\n\tT _zero;\n\tstd::deque<T> _taps;\n\tCoeffs _coeffs;\n};\n\n\/\/ An output iterator which throws an exception when it's used.\n\/\/ This is used for example to determine if the output of set_difference would be non-empty without\n\/\/ calculating all of it.\ntemplate<typename T>\nclass ExceptionIterator: public std::iterator<std::output_iterator_tag, void, void, void, void>\n{\npublic:\n\tExceptionIterator &operator=(const T &value)\n\t{\n\t\tthrow std::exception();\n\t}\n\n\tExceptionIterator &operator*()\n\t{\n\t\treturn *this;\n\t}\n\n\tExceptionIterator &operator++()\n\t{\n\t\treturn *this;\n\t}\n\n\tExceptionIterator &operator++(int)\n\t{\n\t\treturn *this;\n\t}\n};\n\n\/\/ Sets str to the name of a class.\n\/\/ Use it like this:\n\/\/\t\tObject *obj = new Object();\n\/\/\t\tQString name = typeName(typeid(*obj));\n\/\/ The returned name is in the usual C++ format: \"Namespace::Namespace::Class\"\nQString typeName(const std::type_info &info);\n\n\/\/ Like typeName, but only returns the final class name part.\nQString className(const std::type_info &info);\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\/\/\/ \\file\n\/\/\/ Tests for the PhysicsManagerState class.\n\n#include <gtest\/gtest.h>\n\n#include <string>\n#include <memory>\n#include <unordered_map>\n#include <vector>\n\n#include \"SurgSim\/Collision\/CollisionPair.h\"\n#include \"SurgSim\/Collision\/Representation.h\"\n#include \"SurgSim\/Physics\/Constraint.h\"\n#include \"SurgSim\/Physics\/ContactConstraintData.h\"\n#include \"SurgSim\/Physics\/MlcpMapping.h\"\n#include \"SurgSim\/Physics\/PhysicsManagerState.h\"\n#include \"SurgSim\/Physics\/RigidCollisionRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidRepresentationContact.h\"\n\nusing SurgSim::Physics::Constraint;\nusing SurgSim::Physics::ContactConstraintData;\nusing SurgSim::Physics::Localization;\nusing SurgSim::Physics::MlcpMapping;\nusing SurgSim::Physics::PhysicsManagerState;\nusing SurgSim::Physics::Representation;\nusing SurgSim::Physics::RigidCollisionRepresentation;\nusing SurgSim::Physics::RigidRepresentation;\nusing SurgSim::Physics::RigidRepresentationContact;\nusing SurgSim::Physics::RigidRepresentationLocalization;\n\nTEST(PhysicsManagerStateTest, SetGetRigidRepresentations)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\tstd::vector<std::shared_ptr<Representation>> expectedRepresentations;\n\tstd::vector<std::shared_ptr<Representation>> actualRepresentations;\n\tMlcpMapping<Representation> actualRepresentationsIndexMapping;\n\tstd::unordered_map<std::shared_ptr<SurgSim::Collision::Representation>,\n\t\tstd::shared_ptr<Representation>> actualCollisionsToPhysicsMap;\n\n\t\/\/ Add a representation.\n\tauto rigid1 = std::make_shared<RigidRepresentation>(\"rigid1\");\n\texpectedRepresentations.push_back(rigid1);\n\tphysicsState->setRepresentations(expectedRepresentations);\n\tactualRepresentations = physicsState->getRepresentations();\n\tASSERT_EQ(1, actualRepresentations.size());\n\tEXPECT_EQ(rigid1, actualRepresentations.back());\n\tactualRepresentationsIndexMapping = physicsState->getRepresentationsMapping();\n\tint expectedMapValue = 0;\n\tstd::shared_ptr<Representation> rigid1AsRepresentation = rigid1;\n\tEXPECT_EQ(expectedMapValue, actualRepresentationsIndexMapping.getValue(rigid1AsRepresentation.get()));\n\tactualCollisionsToPhysicsMap = physicsState->getCollisionToPhysicsMap();\n\tEXPECT_EQ(0, actualCollisionsToPhysicsMap.size());\n\t\n\t\/\/ Add a second representation.  This one has a collision representation.\n\tauto rigid2 = std::make_shared<RigidRepresentation>(\"rigid2\");\n\tauto collisionRepresentation = std::make_shared<SurgSim::Physics::RigidCollisionRepresentation>(\"rigid2 collision\");\n\tcollisionRepresentation->setRigidRepresentation(rigid2);\n\texpectedRepresentations.push_back(rigid2);\n\tphysicsState->setRepresentations(expectedRepresentations);\n\tactualRepresentations = physicsState->getRepresentations();\n\tASSERT_EQ(2, actualRepresentations.size());\n\tEXPECT_EQ(rigid2, actualRepresentations.back());\n\n\t\/\/ check the representationsIndexMapping\n\tactualRepresentationsIndexMapping = physicsState->getRepresentationsMapping();\n\tEXPECT_EQ(expectedMapValue, actualRepresentationsIndexMapping.getValue(rigid1AsRepresentation.get()));\n\texpectedMapValue += 6; \/\/ the number of DOF for a rigid representation\n\tstd::shared_ptr<Representation> rigid2AsRepresentation = rigid2;\n\tEXPECT_EQ(expectedMapValue, actualRepresentationsIndexMapping.getValue(rigid2AsRepresentation.get()));\n\t\n\t\/\/ check the collisionsToPhysicsMap\n\tactualCollisionsToPhysicsMap = physicsState->getCollisionToPhysicsMap();\n\tASSERT_EQ(1, actualCollisionsToPhysicsMap.size());\n\tEXPECT_EQ(rigid2, actualCollisionsToPhysicsMap[collisionRepresentation]);\n}\n\nTEST(PhysicsManagerStateTest, SetGetCollisionRepresentations)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\tstd::vector<std::shared_ptr<SurgSim::Collision::Representation>> expectedRepresentations;\n\tstd::vector<std::shared_ptr<SurgSim::Collision::Representation>> actualRepresentations;\n\n\t\/\/ Add a collision representation.\n\tstd::shared_ptr<SurgSim::Collision::Representation> collision1 =\n\t\tstd::make_shared<RigidCollisionRepresentation>(\"collision1\");\n\n\tstd::make_shared<RigidCollisionRepresentation>(\"Sphere1 Collision\");\n\texpectedRepresentations.push_back(collision1);\n\tphysicsState->setCollisionRepresentations(expectedRepresentations);\n\tactualRepresentations = physicsState->getCollisionRepresentations();\n\tASSERT_EQ(1, actualRepresentations.size());\n\tEXPECT_EQ(collision1, actualRepresentations.back());\n\n\t\/\/ Add a second collision representation.\n\tstd::shared_ptr<SurgSim::Collision::Representation> collision2 =\n\t\tstd::make_shared<RigidCollisionRepresentation>(\"collision2\");\n\texpectedRepresentations.push_back(collision2);\n\tphysicsState->setCollisionRepresentations(expectedRepresentations);\n\tactualRepresentations = physicsState->getCollisionRepresentations();\n\tASSERT_EQ(2, actualRepresentations.size());\n\tEXPECT_EQ(collision2, actualRepresentations.back());\n}\n\nTEST(PhysicsManagerStateTest, SetGetCollisionPairs)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\tstd::vector<std::shared_ptr<SurgSim::Collision::CollisionPair>> expectedPairs;\n\tstd::vector<std::shared_ptr<SurgSim::Collision::CollisionPair>> actualPairs;\n\n\t\/\/ Add a collision pair.\n\tauto pair1 = std::make_shared<SurgSim::Collision::CollisionPair>();\n\texpectedPairs.push_back(pair1);\n\tphysicsState->setCollisionPairs(expectedPairs);\n\tactualPairs = physicsState->getCollisionPairs();\n\tASSERT_EQ(1, actualPairs.size());\n\tEXPECT_EQ(pair1, actualPairs.back());\n\n\t\/\/ Add a second collision representation.\n\tauto pair2 = std::make_shared<SurgSim::Collision::CollisionPair>();\n\texpectedPairs.push_back(pair2);\n\tphysicsState->setCollisionPairs(expectedPairs);\n\tactualPairs = physicsState->getCollisionPairs();\n\tASSERT_EQ(2, actualPairs.size());\n\tEXPECT_EQ(pair2, actualPairs.back());\n}\n\nTEST(PhysicsManagerStateTest, SetGetConstraintGroup)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\tstd::vector<std::shared_ptr<Constraint>> expectedConstraints;\n\tstd::vector<std::shared_ptr<Constraint>> actualConstraints;\n\n\t\/\/ We need a populated constraint to check the constraintsIndexMapping.\n\t\/\/ Create first side of a constraint.\n\tauto rigid1 = std::make_shared<RigidRepresentation>(\"rigid1\");\n\tstd::shared_ptr<RigidRepresentationLocalization> rigid1LocalizationTyped;\n\trigid1LocalizationTyped = std::make_shared<RigidRepresentationLocalization>();\n\trigid1LocalizationTyped->setRepresentation(rigid1);\n\tstd::shared_ptr<Localization> rigid1Localization = rigid1LocalizationTyped;\n\tauto rigid1Contact = std::make_shared<RigidRepresentationContact>();\n\n\t\/\/ Create second side of a constraint.\n\tauto rigid2 = std::make_shared<RigidRepresentation>(\"rigid2\");\n\tstd::shared_ptr<RigidRepresentationLocalization> rigid2LocalizationTyped;\n\trigid2LocalizationTyped = std::make_shared<RigidRepresentationLocalization>();\n\trigid2LocalizationTyped->setRepresentation(rigid2);\n\tstd::shared_ptr<Localization> rigid2Localization = rigid2LocalizationTyped;\n\tauto rigid2Contact = std::make_shared<RigidRepresentationContact>();\n\n\t\/\/ Create the constraint specific data.\n\tstd::shared_ptr<ContactConstraintData> data = std::make_shared<ContactConstraintData>();\n\n\t\/\/ Create the constraint.\n\tauto constraint1 = std::make_shared<Constraint>(data, rigid1Contact, rigid1Localization,\n\t\trigid2Contact, rigid2Localization);\n\n\t\/\/ Check the constraintGroup.\n\texpectedConstraints.push_back(constraint1);\n\tphysicsState->setConstraintGroup(SurgSim::Physics::CONSTRAINT_GROUP_TYPE_CONTACT, expectedConstraints);\n\tactualConstraints = physicsState->getConstraintGroup(SurgSim::Physics::CONSTRAINT_GROUP_TYPE_CONTACT);\n\tASSERT_EQ(1, actualConstraints.size());\n\tEXPECT_EQ(constraint1, actualConstraints.back());\n\n\t\/\/ Create a second constraint.\n\tauto constraint2 = std::make_shared<Constraint>(data, rigid1Contact, rigid1Localization,\n\t\trigid2Contact, rigid2Localization);\n\n\t\/\/ Check the constraintGroup.\n\texpectedConstraints.push_back(constraint2);\n\tphysicsState->setConstraintGroup(SurgSim::Physics::CONSTRAINT_GROUP_TYPE_CONTACT, expectedConstraints);\n\tactualConstraints = physicsState->getConstraintGroup(SurgSim::Physics::CONSTRAINT_GROUP_TYPE_CONTACT);\n\tASSERT_EQ(2, actualConstraints.size());\n\tEXPECT_EQ(constraint2, actualConstraints.back());\n\n\t\/\/ Check the constraintsIndexMapping.\n\tMlcpMapping<Constraint> actualConstraintsIndexMapping = physicsState->getConstraintsMapping();\n\tint expectedMapValue = 0;\n\tEXPECT_EQ(expectedMapValue, actualConstraintsIndexMapping.getValue(constraint1.get()));\n\texpectedMapValue += 1; \/\/ The number of DOF for a MLCP_UNILATERAL_3D_FRICTIONLESS_CONSTRAINT.\n\tstd::shared_ptr<Representation> rigid2AsRepresentation = rigid2;\n\tEXPECT_EQ(expectedMapValue, actualConstraintsIndexMapping.getValue(constraint2.get()));\n}\n\nTEST(PhysicsManagerStateTest, GetMlcpProblem)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\n\t\/\/ Check non-const getter.\n\tEXPECT_NO_THROW(physicsState->getMlcpProblem().A.resize(21, 8));\n\tEXPECT_EQ(21, physicsState->getMlcpProblem().A.rows());\n\tEXPECT_EQ(8, physicsState->getMlcpProblem().A.cols());\n\n\t\/\/ Check const getter.\n\tstd::shared_ptr<const PhysicsManagerState> constPhysicsState = std::make_shared<PhysicsManagerState>();\n\tEXPECT_NO_THROW(constPhysicsState->getMlcpProblem());\n}\n\nTEST(PhysicsManagerStateTest, GetMlcpSolution)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\n\t\/\/ Check non-const getter.\n\tEXPECT_NO_THROW(physicsState->getMlcpSolution().x.resize(23));\n\tEXPECT_EQ(23, physicsState->getMlcpSolution().x.size());\n\n\t\/\/ Check const getter.\n\tstd::shared_ptr<const PhysicsManagerState> constPhysicsState = std::make_shared<PhysicsManagerState>();\n\tEXPECT_NO_THROW(constPhysicsState->getMlcpSolution());\n}\n<commit_msg>Removes unnecessary construction in PhysicsManagerStateTests.<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\/\/\/ \\file\n\/\/\/ Tests for the PhysicsManagerState class.\n\n#include <gtest\/gtest.h>\n\n#include <string>\n#include <memory>\n#include <unordered_map>\n#include <vector>\n\n#include \"SurgSim\/Collision\/CollisionPair.h\"\n#include \"SurgSim\/Collision\/Representation.h\"\n#include \"SurgSim\/Physics\/Constraint.h\"\n#include \"SurgSim\/Physics\/ContactConstraintData.h\"\n#include \"SurgSim\/Physics\/MlcpMapping.h\"\n#include \"SurgSim\/Physics\/PhysicsManagerState.h\"\n#include \"SurgSim\/Physics\/RigidCollisionRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidRepresentationContact.h\"\n\nusing SurgSim::Physics::Constraint;\nusing SurgSim::Physics::ContactConstraintData;\nusing SurgSim::Physics::Localization;\nusing SurgSim::Physics::MlcpMapping;\nusing SurgSim::Physics::PhysicsManagerState;\nusing SurgSim::Physics::Representation;\nusing SurgSim::Physics::RigidCollisionRepresentation;\nusing SurgSim::Physics::RigidRepresentation;\nusing SurgSim::Physics::RigidRepresentationContact;\nusing SurgSim::Physics::RigidRepresentationLocalization;\n\nTEST(PhysicsManagerStateTest, SetGetRigidRepresentations)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\tstd::vector<std::shared_ptr<Representation>> expectedRepresentations;\n\tstd::vector<std::shared_ptr<Representation>> actualRepresentations;\n\tMlcpMapping<Representation> actualRepresentationsIndexMapping;\n\tstd::unordered_map<std::shared_ptr<SurgSim::Collision::Representation>,\n\t\tstd::shared_ptr<Representation>> actualCollisionsToPhysicsMap;\n\n\t\/\/ Add a representation.\n\tauto rigid1 = std::make_shared<RigidRepresentation>(\"rigid1\");\n\texpectedRepresentations.push_back(rigid1);\n\tphysicsState->setRepresentations(expectedRepresentations);\n\tactualRepresentations = physicsState->getRepresentations();\n\tASSERT_EQ(1, actualRepresentations.size());\n\tEXPECT_EQ(rigid1, actualRepresentations.back());\n\tactualRepresentationsIndexMapping = physicsState->getRepresentationsMapping();\n\tint expectedMapValue = 0;\n\tstd::shared_ptr<Representation> rigid1AsRepresentation = rigid1;\n\tEXPECT_EQ(expectedMapValue, actualRepresentationsIndexMapping.getValue(rigid1AsRepresentation.get()));\n\tactualCollisionsToPhysicsMap = physicsState->getCollisionToPhysicsMap();\n\tEXPECT_EQ(0, actualCollisionsToPhysicsMap.size());\n\t\n\t\/\/ Add a second representation.  This one has a collision representation.\n\tauto rigid2 = std::make_shared<RigidRepresentation>(\"rigid2\");\n\tauto collisionRepresentation = std::make_shared<SurgSim::Physics::RigidCollisionRepresentation>(\"rigid2 collision\");\n\tcollisionRepresentation->setRigidRepresentation(rigid2);\n\texpectedRepresentations.push_back(rigid2);\n\tphysicsState->setRepresentations(expectedRepresentations);\n\tactualRepresentations = physicsState->getRepresentations();\n\tASSERT_EQ(2, actualRepresentations.size());\n\tEXPECT_EQ(rigid2, actualRepresentations.back());\n\n\t\/\/ check the representationsIndexMapping\n\tactualRepresentationsIndexMapping = physicsState->getRepresentationsMapping();\n\tEXPECT_EQ(expectedMapValue, actualRepresentationsIndexMapping.getValue(rigid1AsRepresentation.get()));\n\texpectedMapValue += 6; \/\/ the number of DOF for a rigid representation\n\tstd::shared_ptr<Representation> rigid2AsRepresentation = rigid2;\n\tEXPECT_EQ(expectedMapValue, actualRepresentationsIndexMapping.getValue(rigid2AsRepresentation.get()));\n\t\n\t\/\/ check the collisionsToPhysicsMap\n\tactualCollisionsToPhysicsMap = physicsState->getCollisionToPhysicsMap();\n\tASSERT_EQ(1, actualCollisionsToPhysicsMap.size());\n\tEXPECT_EQ(rigid2, actualCollisionsToPhysicsMap[collisionRepresentation]);\n}\n\nTEST(PhysicsManagerStateTest, SetGetCollisionRepresentations)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\tstd::vector<std::shared_ptr<SurgSim::Collision::Representation>> expectedRepresentations;\n\tstd::vector<std::shared_ptr<SurgSim::Collision::Representation>> actualRepresentations;\n\n\t\/\/ Add a collision representation.\n\tstd::shared_ptr<SurgSim::Collision::Representation> collision1 =\n\t\tstd::make_shared<RigidCollisionRepresentation>(\"collision1\");\n\n\texpectedRepresentations.push_back(collision1);\n\tphysicsState->setCollisionRepresentations(expectedRepresentations);\n\tactualRepresentations = physicsState->getCollisionRepresentations();\n\tASSERT_EQ(1, actualRepresentations.size());\n\tEXPECT_EQ(collision1, actualRepresentations.back());\n\n\t\/\/ Add a second collision representation.\n\tstd::shared_ptr<SurgSim::Collision::Representation> collision2 =\n\t\tstd::make_shared<RigidCollisionRepresentation>(\"collision2\");\n\texpectedRepresentations.push_back(collision2);\n\tphysicsState->setCollisionRepresentations(expectedRepresentations);\n\tactualRepresentations = physicsState->getCollisionRepresentations();\n\tASSERT_EQ(2, actualRepresentations.size());\n\tEXPECT_EQ(collision2, actualRepresentations.back());\n}\n\nTEST(PhysicsManagerStateTest, SetGetCollisionPairs)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\tstd::vector<std::shared_ptr<SurgSim::Collision::CollisionPair>> expectedPairs;\n\tstd::vector<std::shared_ptr<SurgSim::Collision::CollisionPair>> actualPairs;\n\n\t\/\/ Add a collision pair.\n\tauto pair1 = std::make_shared<SurgSim::Collision::CollisionPair>();\n\texpectedPairs.push_back(pair1);\n\tphysicsState->setCollisionPairs(expectedPairs);\n\tactualPairs = physicsState->getCollisionPairs();\n\tASSERT_EQ(1, actualPairs.size());\n\tEXPECT_EQ(pair1, actualPairs.back());\n\n\t\/\/ Add a second collision representation.\n\tauto pair2 = std::make_shared<SurgSim::Collision::CollisionPair>();\n\texpectedPairs.push_back(pair2);\n\tphysicsState->setCollisionPairs(expectedPairs);\n\tactualPairs = physicsState->getCollisionPairs();\n\tASSERT_EQ(2, actualPairs.size());\n\tEXPECT_EQ(pair2, actualPairs.back());\n}\n\nTEST(PhysicsManagerStateTest, SetGetConstraintGroup)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\tstd::vector<std::shared_ptr<Constraint>> expectedConstraints;\n\tstd::vector<std::shared_ptr<Constraint>> actualConstraints;\n\n\t\/\/ We need a populated constraint to check the constraintsIndexMapping.\n\t\/\/ Create first side of a constraint.\n\tauto rigid1 = std::make_shared<RigidRepresentation>(\"rigid1\");\n\tstd::shared_ptr<RigidRepresentationLocalization> rigid1LocalizationTyped =\n\t\tstd::make_shared<RigidRepresentationLocalization>();\n\trigid1LocalizationTyped->setRepresentation(rigid1);\n\tstd::shared_ptr<Localization> rigid1Localization = rigid1LocalizationTyped;\n\tauto rigid1Contact = std::make_shared<RigidRepresentationContact>();\n\n\t\/\/ Create second side of a constraint.\n\tauto rigid2 = std::make_shared<RigidRepresentation>(\"rigid2\");\n\tstd::shared_ptr<RigidRepresentationLocalization> rigid2LocalizationTyped =\n\t\tstd::make_shared<RigidRepresentationLocalization>();\n\trigid2LocalizationTyped->setRepresentation(rigid2);\n\tstd::shared_ptr<Localization> rigid2Localization = rigid2LocalizationTyped;\n\tauto rigid2Contact = std::make_shared<RigidRepresentationContact>();\n\n\t\/\/ Create the constraint specific data.\n\tstd::shared_ptr<ContactConstraintData> data = std::make_shared<ContactConstraintData>();\n\n\t\/\/ Create the constraint.\n\tauto constraint1 = std::make_shared<Constraint>(data, rigid1Contact, rigid1Localization,\n\t\trigid2Contact, rigid2Localization);\n\n\t\/\/ Check the constraintGroup.\n\texpectedConstraints.push_back(constraint1);\n\tphysicsState->setConstraintGroup(SurgSim::Physics::CONSTRAINT_GROUP_TYPE_CONTACT, expectedConstraints);\n\tactualConstraints = physicsState->getConstraintGroup(SurgSim::Physics::CONSTRAINT_GROUP_TYPE_CONTACT);\n\tASSERT_EQ(1, actualConstraints.size());\n\tEXPECT_EQ(constraint1, actualConstraints.back());\n\n\t\/\/ Create a second constraint.\n\tauto constraint2 = std::make_shared<Constraint>(data, rigid1Contact, rigid1Localization,\n\t\trigid2Contact, rigid2Localization);\n\n\t\/\/ Check the constraintGroup.\n\texpectedConstraints.push_back(constraint2);\n\tphysicsState->setConstraintGroup(SurgSim::Physics::CONSTRAINT_GROUP_TYPE_CONTACT, expectedConstraints);\n\tactualConstraints = physicsState->getConstraintGroup(SurgSim::Physics::CONSTRAINT_GROUP_TYPE_CONTACT);\n\tASSERT_EQ(2, actualConstraints.size());\n\tEXPECT_EQ(constraint2, actualConstraints.back());\n\n\t\/\/ Check the constraintsIndexMapping.\n\tMlcpMapping<Constraint> actualConstraintsIndexMapping = physicsState->getConstraintsMapping();\n\tint expectedMapValue = 0;\n\tEXPECT_EQ(expectedMapValue, actualConstraintsIndexMapping.getValue(constraint1.get()));\n\texpectedMapValue += 1; \/\/ The number of DOF for a MLCP_UNILATERAL_3D_FRICTIONLESS_CONSTRAINT.\n\tstd::shared_ptr<Representation> rigid2AsRepresentation = rigid2;\n\tEXPECT_EQ(expectedMapValue, actualConstraintsIndexMapping.getValue(constraint2.get()));\n}\n\nTEST(PhysicsManagerStateTest, GetMlcpProblem)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\n\t\/\/ Check non-const getter.\n\tEXPECT_NO_THROW(physicsState->getMlcpProblem().A.resize(21, 8));\n\tEXPECT_EQ(21, physicsState->getMlcpProblem().A.rows());\n\tEXPECT_EQ(8, physicsState->getMlcpProblem().A.cols());\n\n\t\/\/ Check const getter.\n\tstd::shared_ptr<const PhysicsManagerState> constPhysicsState = std::make_shared<PhysicsManagerState>();\n\tEXPECT_NO_THROW(constPhysicsState->getMlcpProblem());\n}\n\nTEST(PhysicsManagerStateTest, GetMlcpSolution)\n{\n\tauto physicsState = std::make_shared<PhysicsManagerState>();\n\n\t\/\/ Check non-const getter.\n\tEXPECT_NO_THROW(physicsState->getMlcpSolution().x.resize(23));\n\tEXPECT_EQ(23, physicsState->getMlcpSolution().x.size());\n\n\t\/\/ Check const getter.\n\tstd::shared_ptr<const PhysicsManagerState> constPhysicsState = std::make_shared<PhysicsManagerState>();\n\tEXPECT_NO_THROW(constPhysicsState->getMlcpSolution());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * igridreport - produce json configuration gridreport\n*\/\n#include \"irods_client_api_table.hpp\"\n#include \"irods_pack_table.hpp\"\n#include \"rodsClient.hpp\"\n#include \"parseCommandLine.hpp\"\n#include \"rodsPath.hpp\"\n#include \"lsUtil.hpp\"\n#include \"irods_buffer_encryption.hpp\"\n#include \"grid_report.hpp\"\n#include <string>\n#include <iostream>\n\nint\nmain( int, char** ) {\n\n    rodsEnv myEnv;\n    int status = getRodsEnv( &myEnv );\n    if ( status < 0 ) {\n        rodsLogError( LOG_ERROR, status, \"main: getRodsEnv error. \" );\n        exit( 1 );\n    }\n\n    rErrMsg_t errMsg;\n    rcComm_t *conn;\n    conn = rcConnect(\n               myEnv.rodsHost,\n               myEnv.rodsPort,\n               myEnv.rodsUserName,\n               myEnv.rodsZone,\n               0, &errMsg );\n\n    if ( conn == NULL ) {\n        exit( 2 );\n    }\n\n    \/\/ =-=-=-=-=-=-=-\n    \/\/ initialize pluggable api table\n    irods::pack_entry_table& pk_tbl = irods::get_pack_table();\n    irods::api_entry_table& api_tbl = irods::get_client_api_table();\n    init_api_table( api_tbl, pk_tbl );\n\n    if ( strcmp( myEnv.rodsUserName, PUBLIC_USER_NAME ) != 0 ) {\n        status = clientLogin( conn );\n        if ( status != 0 ) {\n            rcDisconnect( conn );\n            exit( 7 );\n        }\n    }\n\n    void *tmp_out = NULL;\n    status = procApiRequest( conn, GRID_REPORT_AN, NULL, NULL,\n                             &tmp_out, NULL );\n    if ( status < 0 ) {\n        printf( \"\\n\\nERROR - failed in call to rcGridReport\" );\n        return 0;\n    }\n    else {\n        bytesBuf_t* bbuf = static_cast< bytesBuf_t* >( tmp_out );\n\n        \/\/ may not be propertly null terminated\n        std::string s( (char*)bbuf->buf, bbuf->len );\n        printf( \"\\n%s\\n\", s.c_str() );\n    }\n\n    rcDisconnect( conn );\n}\n\n<commit_msg>[#858] spelling<commit_after>\/*\n * igridreport - produce json configuration gridreport\n*\/\n#include \"irods_client_api_table.hpp\"\n#include \"irods_pack_table.hpp\"\n#include \"rodsClient.hpp\"\n#include \"parseCommandLine.hpp\"\n#include \"rodsPath.hpp\"\n#include \"lsUtil.hpp\"\n#include \"irods_buffer_encryption.hpp\"\n#include \"grid_report.hpp\"\n#include <string>\n#include <iostream>\n\nint\nmain( int, char** ) {\n\n    rodsEnv myEnv;\n    int status = getRodsEnv( &myEnv );\n    if ( status < 0 ) {\n        rodsLogError( LOG_ERROR, status, \"main: getRodsEnv error. \" );\n        exit( 1 );\n    }\n\n    rErrMsg_t errMsg;\n    rcComm_t *conn;\n    conn = rcConnect(\n               myEnv.rodsHost,\n               myEnv.rodsPort,\n               myEnv.rodsUserName,\n               myEnv.rodsZone,\n               0, &errMsg );\n\n    if ( conn == NULL ) {\n        exit( 2 );\n    }\n\n    \/\/ =-=-=-=-=-=-=-\n    \/\/ initialize pluggable api table\n    irods::pack_entry_table& pk_tbl = irods::get_pack_table();\n    irods::api_entry_table& api_tbl = irods::get_client_api_table();\n    init_api_table( api_tbl, pk_tbl );\n\n    if ( strcmp( myEnv.rodsUserName, PUBLIC_USER_NAME ) != 0 ) {\n        status = clientLogin( conn );\n        if ( status != 0 ) {\n            rcDisconnect( conn );\n            exit( 7 );\n        }\n    }\n\n    void *tmp_out = NULL;\n    status = procApiRequest( conn, GRID_REPORT_AN, NULL, NULL,\n                             &tmp_out, NULL );\n    if ( status < 0 ) {\n        printf( \"\\n\\nERROR - failed in call to rcGridReport\" );\n        return 0;\n    }\n    else {\n        bytesBuf_t* bbuf = static_cast< bytesBuf_t* >( tmp_out );\n\n        \/\/ may not be properly null terminated\n        std::string s( (char*)bbuf->buf, bbuf->len );\n        printf( \"\\n%s\\n\", s.c_str() );\n    }\n\n    rcDisconnect( conn );\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2007-2008 Digital Bazaar, Inc.  All rights reserved.\n *\/\n#include \"db\/util\/DynamicObjectImpl.h\"\n#include \"db\/util\/DynamicObject.h\"\n\nusing namespace std;\nusing namespace db::util;\n\nDynamicObjectImpl::DynamicObjectImpl()\n{\n   mType = String;\n   mString = NULL;\n   mStringValue = NULL;\n}\n\nDynamicObjectImpl::~DynamicObjectImpl()\n{\n   DynamicObjectImpl::freeData();\n   \n   \/\/ free cached string value\n   if(mStringValue != NULL)\n   {\n      free(mStringValue);\n   }\n}\n\nvoid DynamicObjectImpl::freeMapKeys()\n{\n   \/\/ clean up member names\n   for(ObjectMap::iterator i = mMap->begin(); i != mMap->end(); i++)\n   {\n      free((char*)i->first);\n   }\n}\n\nvoid DynamicObjectImpl::freeData()\n{\n   \/\/ clean up data based on type\n   switch(mType)\n   {\n      case String:\n         {\n            if(mString != NULL)\n            {\n               free(mString);\n            }\n            mString = NULL;\n         }\n         break;\n      case Map:\n         if(mMap != NULL)\n         {\n            freeMapKeys();\n            delete mMap;\n            mMap = NULL;\n         }\n         break;\n      case Array:\n         if(mArray != NULL)\n         {\n            delete mArray;\n            mArray = NULL;\n         }\n         break;\n      default:\n         \/\/ nothing to cleanup\n         break;\n   }\n}\n\nvoid DynamicObjectImpl::setString(const char* value)\n{\n   freeData();\n   mType = String;\n   mString = strdup(value);\n}\n\nvoid DynamicObjectImpl::operator=(const char* value)\n{\n   setString(value);\n}\n\nvoid DynamicObjectImpl::operator=(bool value)\n{\n   freeData();\n   mType = Boolean;\n   mBoolean = value;\n}\n\nvoid DynamicObjectImpl::operator=(int value)\n{\n   freeData();\n   mType = Int32;\n   mInt32 = value;\n}\n\nvoid DynamicObjectImpl::operator=(unsigned int value)\n{\n   freeData();\n   mType = UInt32;\n   mUInt32 = value;\n}\n\nvoid DynamicObjectImpl::operator=(long long value)\n{\n   freeData();\n   mType = Int64;\n   mInt64 = value;\n}\n\nvoid DynamicObjectImpl::operator=(unsigned long long value)\n{\n   freeData();\n   mType = UInt64;\n   mUInt64 = value;\n}\n\nvoid DynamicObjectImpl::operator=(double value)\n{\n   freeData();\n   mType = Double;\n   mDouble = value;\n}\n\nDynamicObject& DynamicObjectImpl::operator[](const char* name)\n{\n   DynamicObject* rval = NULL;\n   \n   \/\/ change to map type if necessary\n   setType(Map);\n   \n   ObjectMap::iterator i = mMap->find(name);\n   if(i == mMap->end())\n   {\n      \/\/ create new map entry\n      DynamicObject dyno;\n      mMap->insert(std::make_pair(strdup(name), dyno));\n      rval = &(*mMap)[name];\n   }\n   else\n   {\n      \/\/ get existing map entry\n      rval = &i->second;\n   }\n   \n   return *rval;\n}\n\nDynamicObject& DynamicObjectImpl::operator[](int index)\n{\n   \/\/ change to array type if necessary\n   setType(Array);\n   \n   if(index < 0)\n   {\n      index = mArray->size() + index;\n   }\n   \n   \/\/ fill the object array as necessary\n   if(index >= (int)mArray->size())\n   {\n      int i = index - (int)mArray->size() + 1;\n      for(; i > 0; i--)\n      {\n         DynamicObject dyno;\n         mArray->push_back(dyno);\n      }\n   }\n   \n   return (*mArray)[index];\n}\n\nDynamicObject& DynamicObjectImpl::append()\n{\n   return (*this)[length()];\n}\n\nvoid DynamicObjectImpl::setType(DynamicObjectType type)\n{\n   if(mType != type)\n   {\n      switch(type)\n      {\n         case String:\n            *this = getString();\n            break;\n         case Boolean:\n            *this = getBoolean();\n            break;\n         case Int32:\n            *this = getInt32();\n            break;\n         case UInt32:\n            *this = getUInt32();\n            break;\n         case Int64:\n            *this = getInt64();\n            break;\n         case UInt64:\n            *this = getUInt64();\n            break;\n         case Double:\n            *this = getDouble();\n            break;\n         case Map:\n            {\n               freeData();\n               mType = Map;\n               mMap = new ObjectMap();\n            }\n            break;\n         case Array:\n            {\n               freeData();\n               mType = Array;\n               mArray = new ObjectArray();\n            }\n            break;\n      }\n   }\n}\n\nDynamicObjectType DynamicObjectImpl::getType()\n{\n   return mType;\n}\n\nconst char* DynamicObjectImpl::getString()\n{\n   const char* rval;\n   \n   if(mType == String)\n   {\n      if(mString != NULL)\n      {\n         \/\/ use existing string\n         rval = mString;\n      }\n      else\n      {\n         \/\/ only duplicate blank string upon request\n         rval = mString = strdup(\"\");\n      }\n   }\n   else\n   {\n      \/\/ convert type as appropriate\n      switch(mType)\n      {\n         case Boolean:\n            mStringValue = (char*)realloc(mStringValue, 6);\n            snprintf(mStringValue, 6, \"%s\", (mBoolean ? \"true\" : \"false\"));\n            break;\n         case Int32:\n            mStringValue = (char*)realloc(mStringValue, 12);\n            snprintf(mStringValue, 12, \"%i\", mInt32);\n            break;\n         case UInt32:\n            mStringValue = (char*)realloc(mStringValue, 11);\n            snprintf(mStringValue, 11, \"%u\", mUInt32);\n            break;\n         case Int64:\n            mStringValue = (char*)realloc(mStringValue, 22);\n            snprintf(mStringValue, 22, \"%lli\", mInt64);\n            break;\n         case UInt64:\n            mStringValue = (char*)realloc(mStringValue, 21);\n            snprintf(mStringValue, 21, \"%llu\", mUInt64);\n            break;\n         case Double:\n            \/\/ use default precision of 6\n            \/\/ X.000000e+00 = 11 places to right of decimal\n            mStringValue = (char*)realloc(mStringValue, 50);\n            snprintf(mStringValue, 50, \"%e\", mDouble);\n            break;\n         default: \/* Map, Array, ... *\/\n            {\n               if(mStringValue == NULL)\n               {\n                  \/\/ duplicate blank string\n                  mStringValue = strdup(\"\");\n               }\n               else\n               {\n                  \/\/ set null-terminator to first character\n                  mStringValue[0] = 0; \n               }\n            }\n            break;\n      }\n      \n      \/\/ return generated value\n      rval = mStringValue;\n   }\n   \n   return rval;\n}\n\nbool DynamicObjectImpl::getBoolean()\n{\n   bool rval;\n   \n   switch(mType)\n   {\n      case Boolean:\n         rval = mBoolean;\n         break;\n      case String:\n         rval = (strcmp(mString, \"true\") == 0);\n         break;\n      case Int32:\n         rval = (mInt32 == 1);\n         break;\n      case UInt32:\n         rval = (mUInt32 == 1);\n         break;\n      case Int64:\n         rval = (mInt64 == 1);\n         break;\n      case UInt64:\n         rval = (mUInt64 == 1);\n         break;\n      case Double:\n         rval = (mDouble == 1);\n         break;\n      default:\n         rval = false;\n         break;\n   }\n   \n   return rval;\n}\n\nint DynamicObjectImpl::getInt32()\n{\n   int rval;\n   \n   switch(mType)\n   {\n      case Int32:\n         rval = mInt32;\n         break;\n      case String:\n         rval = strtol(mString, NULL, 10);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case UInt32:\n         rval = (int)mUInt32;\n         break;\n      case Int64:\n         rval = (int)mInt64;\n         break;\n      case UInt64:\n         rval = (int)mUInt64;\n         break;\n      case Double:\n         rval = (int)mDouble;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\nunsigned int DynamicObjectImpl::getUInt32()\n{\n   unsigned int rval;\n   \n   switch(mType)\n   {\n      case UInt32:\n         rval = mUInt32;\n         break;\n      case String:\n         rval = (unsigned int)strtoul(mString, NULL, 10);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case Int32:\n         rval = (mInt32 < 0) ? 0 : mInt32;\n         break;\n      case Int64:\n         rval = (mInt64 < 0) ? 0 : (unsigned int)mInt64;\n         break;\n      case UInt64:\n         rval = (unsigned int)mUInt64;\n         break;\n      case Double:\n         rval = (unsigned int)mDouble;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\nlong long DynamicObjectImpl::getInt64()\n{\n   long long rval;\n   \n   switch(mType)\n   {\n      case Int64:\n         rval = mInt64;\n         break;\n      case String:\n         rval = strtoll(mString, NULL, 10);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case Int32:\n         rval = mInt32;\n         break;\n      case UInt32:\n         rval = mUInt32;\n         break;\n      case UInt64:\n         rval = (long long)mUInt64;\n         break;\n      case Double:\n         rval = (long long)mDouble;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\nunsigned long long DynamicObjectImpl::getUInt64()\n{\n   unsigned long long rval;\n   \n   switch(mType)\n   {\n      case UInt64:\n         rval = mUInt64;\n         break;\n      case String:\n         rval = strtoull(mString, NULL, 10);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case Int32:\n         rval = (mInt32 < 0) ? 0 : mInt32;\n         break;\n      case UInt32:\n         rval = mUInt32;\n         break;\n      case Int64:\n         rval = (mInt64 < 0) ? 0 : mInt64;\n         break;\n      case Double:\n         rval = mDouble;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\ndouble DynamicObjectImpl::getDouble()\n{\n   double rval;\n   \n   switch(mType)\n   {\n      case Double:\n         rval = mDouble;\n         break;\n      case String:\n         rval = strtod(mString, NULL);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case Int32:\n         rval = mInt32;\n         break;\n      case UInt32:\n         rval = mUInt32;\n         break;\n      case Int64:\n         rval = mInt64;\n         break;\n      case UInt64:\n         rval = mUInt64;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\nbool DynamicObjectImpl::hasMember(const char* name)\n{\n   bool rval = false;\n   \n   if(mType == Map)\n   {\n      ObjectMap::iterator i = mMap->find(name);\n      rval = (i != mMap->end());\n   }\n   \n   return rval;\n}\n\nDynamicObject DynamicObjectImpl::removeMember(const char* name)\n{\n   DynamicObject rval(NULL);\n   \n   if(mType == Map)\n   {\n      ObjectMap::iterator i = mMap->find(name);\n      if(i != mMap->end())\n      {\n         \/\/ clean up key and remove map entry\n         free((char*)i->first);\n         rval = i->second;\n         mMap->erase(i);\n      }\n   }\n   \n   return rval;\n}\n\nvoid DynamicObjectImpl::clear()\n{\n   switch(mType)\n   {\n      case String:\n         *this = \"\";\n         break;\n      case Boolean:\n         *this = false;\n         break;\n      case Int32:\n         *this = (int)0;\n         break;\n      case UInt32:\n         *this = (unsigned int)0;\n         break;\n      case Int64:\n         *this = (long long)0;\n         break;\n      case UInt64:\n         *this = (unsigned long long)0;\n         break;\n      case Double:\n         *this = (double)0.0;\n         break;\n      case Map:\n         freeMapKeys();\n         mMap->clear();\n         break;\n      case Array:\n         mArray->clear();\n         break;\n   }\n}\n\nint DynamicObjectImpl::length()\n{\n   int rval = 0;\n   \n   switch(mType)\n   {\n      case String:\n         if(mString != NULL)\n         {\n            rval = strlen(getString());\n         }\n         break;\n      case Boolean:\n         rval = 1;\n         break;\n      case Int32:\n      case UInt32:\n         rval = sizeof(unsigned int);\n         break;\n      case Int64:\n      case UInt64:\n         rval = sizeof(unsigned long long);\n         break;\n      case Double:\n         rval = sizeof(double);\n         break;\n      case Map:\n         rval = mMap->size();\n         break;\n      case Array:\n         rval = mArray->size();\n         break;\n   }\n   \n   return rval;\n}\n<commit_msg>Fixed potential null dereference bug in conversion methods.<commit_after>\/*\n * Copyright (c) 2007-2008 Digital Bazaar, Inc.  All rights reserved.\n *\/\n#include \"db\/util\/DynamicObjectImpl.h\"\n#include \"db\/util\/DynamicObject.h\"\n\nusing namespace std;\nusing namespace db::util;\n\nDynamicObjectImpl::DynamicObjectImpl()\n{\n   mType = String;\n   mString = NULL;\n   mStringValue = NULL;\n}\n\nDynamicObjectImpl::~DynamicObjectImpl()\n{\n   DynamicObjectImpl::freeData();\n   \n   \/\/ free cached string value\n   if(mStringValue != NULL)\n   {\n      free(mStringValue);\n   }\n}\n\nvoid DynamicObjectImpl::freeMapKeys()\n{\n   \/\/ clean up member names\n   for(ObjectMap::iterator i = mMap->begin(); i != mMap->end(); i++)\n   {\n      free((char*)i->first);\n   }\n}\n\nvoid DynamicObjectImpl::freeData()\n{\n   \/\/ clean up data based on type\n   switch(mType)\n   {\n      case String:\n         {\n            if(mString != NULL)\n            {\n               free(mString);\n            }\n            mString = NULL;\n         }\n         break;\n      case Map:\n         if(mMap != NULL)\n         {\n            freeMapKeys();\n            delete mMap;\n            mMap = NULL;\n         }\n         break;\n      case Array:\n         if(mArray != NULL)\n         {\n            delete mArray;\n            mArray = NULL;\n         }\n         break;\n      default:\n         \/\/ nothing to cleanup\n         break;\n   }\n}\n\nvoid DynamicObjectImpl::setString(const char* value)\n{\n   freeData();\n   mType = String;\n   mString = strdup(value);\n}\n\nvoid DynamicObjectImpl::operator=(const char* value)\n{\n   setString(value);\n}\n\nvoid DynamicObjectImpl::operator=(bool value)\n{\n   freeData();\n   mType = Boolean;\n   mBoolean = value;\n}\n\nvoid DynamicObjectImpl::operator=(int value)\n{\n   freeData();\n   mType = Int32;\n   mInt32 = value;\n}\n\nvoid DynamicObjectImpl::operator=(unsigned int value)\n{\n   freeData();\n   mType = UInt32;\n   mUInt32 = value;\n}\n\nvoid DynamicObjectImpl::operator=(long long value)\n{\n   freeData();\n   mType = Int64;\n   mInt64 = value;\n}\n\nvoid DynamicObjectImpl::operator=(unsigned long long value)\n{\n   freeData();\n   mType = UInt64;\n   mUInt64 = value;\n}\n\nvoid DynamicObjectImpl::operator=(double value)\n{\n   freeData();\n   mType = Double;\n   mDouble = value;\n}\n\nDynamicObject& DynamicObjectImpl::operator[](const char* name)\n{\n   DynamicObject* rval = NULL;\n   \n   \/\/ change to map type if necessary\n   setType(Map);\n   \n   ObjectMap::iterator i = mMap->find(name);\n   if(i == mMap->end())\n   {\n      \/\/ create new map entry\n      DynamicObject dyno;\n      mMap->insert(std::make_pair(strdup(name), dyno));\n      rval = &(*mMap)[name];\n   }\n   else\n   {\n      \/\/ get existing map entry\n      rval = &i->second;\n   }\n   \n   return *rval;\n}\n\nDynamicObject& DynamicObjectImpl::operator[](int index)\n{\n   \/\/ change to array type if necessary\n   setType(Array);\n   \n   if(index < 0)\n   {\n      index = mArray->size() + index;\n   }\n   \n   \/\/ fill the object array as necessary\n   if(index >= (int)mArray->size())\n   {\n      int i = index - (int)mArray->size() + 1;\n      for(; i > 0; i--)\n      {\n         DynamicObject dyno;\n         mArray->push_back(dyno);\n      }\n   }\n   \n   return (*mArray)[index];\n}\n\nDynamicObject& DynamicObjectImpl::append()\n{\n   return (*this)[length()];\n}\n\nvoid DynamicObjectImpl::setType(DynamicObjectType type)\n{\n   if(mType != type)\n   {\n      switch(type)\n      {\n         case String:\n            *this = getString();\n            break;\n         case Boolean:\n            *this = getBoolean();\n            break;\n         case Int32:\n            *this = getInt32();\n            break;\n         case UInt32:\n            *this = getUInt32();\n            break;\n         case Int64:\n            *this = getInt64();\n            break;\n         case UInt64:\n            *this = getUInt64();\n            break;\n         case Double:\n            *this = getDouble();\n            break;\n         case Map:\n            {\n               freeData();\n               mType = Map;\n               mMap = new ObjectMap();\n            }\n            break;\n         case Array:\n            {\n               freeData();\n               mType = Array;\n               mArray = new ObjectArray();\n            }\n            break;\n      }\n   }\n}\n\nDynamicObjectType DynamicObjectImpl::getType()\n{\n   return mType;\n}\n\nconst char* DynamicObjectImpl::getString()\n{\n   const char* rval;\n   \n   if(mType == String)\n   {\n      if(mString != NULL)\n      {\n         \/\/ use existing string\n         rval = mString;\n      }\n      else\n      {\n         \/\/ only duplicate blank string upon request\n         rval = mString = strdup(\"\");\n      }\n   }\n   else\n   {\n      \/\/ convert type as appropriate\n      switch(mType)\n      {\n         case Boolean:\n            mStringValue = (char*)realloc(mStringValue, 6);\n            snprintf(mStringValue, 6, \"%s\", (mBoolean ? \"true\" : \"false\"));\n            break;\n         case Int32:\n            mStringValue = (char*)realloc(mStringValue, 12);\n            snprintf(mStringValue, 12, \"%i\", mInt32);\n            break;\n         case UInt32:\n            mStringValue = (char*)realloc(mStringValue, 11);\n            snprintf(mStringValue, 11, \"%u\", mUInt32);\n            break;\n         case Int64:\n            mStringValue = (char*)realloc(mStringValue, 22);\n            snprintf(mStringValue, 22, \"%lli\", mInt64);\n            break;\n         case UInt64:\n            mStringValue = (char*)realloc(mStringValue, 21);\n            snprintf(mStringValue, 21, \"%llu\", mUInt64);\n            break;\n         case Double:\n            \/\/ use default precision of 6\n            \/\/ X.000000e+00 = 11 places to right of decimal\n            mStringValue = (char*)realloc(mStringValue, 50);\n            snprintf(mStringValue, 50, \"%e\", mDouble);\n            break;\n         default: \/* Map, Array, ... *\/\n            {\n               if(mStringValue == NULL)\n               {\n                  \/\/ duplicate blank string\n                  mStringValue = strdup(\"\");\n               }\n               else\n               {\n                  \/\/ set null-terminator to first character\n                  mStringValue[0] = 0; \n               }\n            }\n            break;\n      }\n      \n      \/\/ return generated value\n      rval = mStringValue;\n   }\n   \n   return rval;\n}\n\nbool DynamicObjectImpl::getBoolean()\n{\n   bool rval;\n   \n   switch(mType)\n   {\n      case Boolean:\n         rval = mBoolean;\n         break;\n      case String:\n         rval = (mString == NULL) ? false : (strcmp(mString, \"true\") == 0);\n         break;\n      case Int32:\n         rval = (mInt32 == 1);\n         break;\n      case UInt32:\n         rval = (mUInt32 == 1);\n         break;\n      case Int64:\n         rval = (mInt64 == 1);\n         break;\n      case UInt64:\n         rval = (mUInt64 == 1);\n         break;\n      case Double:\n         rval = (mDouble == 1);\n         break;\n      default:\n         rval = false;\n         break;\n   }\n   \n   return rval;\n}\n\nint DynamicObjectImpl::getInt32()\n{\n   int rval;\n   \n   switch(mType)\n   {\n      case Int32:\n         rval = mInt32;\n         break;\n      case String:\n         rval = (mString == NULL) ? 0 : strtol(mString, NULL, 10);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case UInt32:\n         rval = (int)mUInt32;\n         break;\n      case Int64:\n         rval = (int)mInt64;\n         break;\n      case UInt64:\n         rval = (int)mUInt64;\n         break;\n      case Double:\n         rval = (int)mDouble;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\nunsigned int DynamicObjectImpl::getUInt32()\n{\n   unsigned int rval;\n   \n   switch(mType)\n   {\n      case UInt32:\n         rval = mUInt32;\n         break;\n      case String:\n         rval = (mString == NULL) ? 0 : strtoul(mString, NULL, 10);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case Int32:\n         rval = (mInt32 < 0) ? 0 : mInt32;\n         break;\n      case Int64:\n         rval = (mInt64 < 0) ? 0 : (unsigned int)mInt64;\n         break;\n      case UInt64:\n         rval = (unsigned int)mUInt64;\n         break;\n      case Double:\n         rval = (unsigned int)mDouble;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\nlong long DynamicObjectImpl::getInt64()\n{\n   long long rval;\n   \n   switch(mType)\n   {\n      case Int64:\n         rval = mInt64;\n         break;\n      case String:\n         rval = (mString == NULL) ? 0 : strtoll(mString, NULL, 10);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case Int32:\n         rval = mInt32;\n         break;\n      case UInt32:\n         rval = mUInt32;\n         break;\n      case UInt64:\n         rval = (long long)mUInt64;\n         break;\n      case Double:\n         rval = (long long)mDouble;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\nunsigned long long DynamicObjectImpl::getUInt64()\n{\n   unsigned long long rval;\n   \n   switch(mType)\n   {\n      case UInt64:\n         rval = mUInt64;\n         break;\n      case String:\n         rval = (mString == NULL) ? 0 : strtoull(mString, NULL, 10);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case Int32:\n         rval = (mInt32 < 0) ? 0 : mInt32;\n         break;\n      case UInt32:\n         rval = mUInt32;\n         break;\n      case Int64:\n         rval = (mInt64 < 0) ? 0 : mInt64;\n         break;\n      case Double:\n         rval = mDouble;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\ndouble DynamicObjectImpl::getDouble()\n{\n   double rval;\n   \n   switch(mType)\n   {\n      case Double:\n         rval = mDouble;\n         break;\n      case String:\n         rval = (mString == NULL) ? 0 : strtod(mString, NULL);\n         break;\n      case Boolean:\n         rval = mBoolean ? 1 : 0;\n         break;\n      case Int32:\n         rval = mInt32;\n         break;\n      case UInt32:\n         rval = mUInt32;\n         break;\n      case Int64:\n         rval = mInt64;\n         break;\n      case UInt64:\n         rval = mUInt64;\n         break;\n      default:\n         rval = 0;\n         break;\n   }\n   \n   return rval;\n}\n\nbool DynamicObjectImpl::hasMember(const char* name)\n{\n   bool rval = false;\n   \n   if(mType == Map)\n   {\n      ObjectMap::iterator i = mMap->find(name);\n      rval = (i != mMap->end());\n   }\n   \n   return rval;\n}\n\nDynamicObject DynamicObjectImpl::removeMember(const char* name)\n{\n   DynamicObject rval(NULL);\n   \n   if(mType == Map)\n   {\n      ObjectMap::iterator i = mMap->find(name);\n      if(i != mMap->end())\n      {\n         \/\/ clean up key and remove map entry\n         free((char*)i->first);\n         rval = i->second;\n         mMap->erase(i);\n      }\n   }\n   \n   return rval;\n}\n\nvoid DynamicObjectImpl::clear()\n{\n   switch(mType)\n   {\n      case String:\n         *this = \"\";\n         break;\n      case Boolean:\n         *this = false;\n         break;\n      case Int32:\n         *this = (int)0;\n         break;\n      case UInt32:\n         *this = (unsigned int)0;\n         break;\n      case Int64:\n         *this = (long long)0;\n         break;\n      case UInt64:\n         *this = (unsigned long long)0;\n         break;\n      case Double:\n         *this = (double)0.0;\n         break;\n      case Map:\n         freeMapKeys();\n         mMap->clear();\n         break;\n      case Array:\n         mArray->clear();\n         break;\n   }\n}\n\nint DynamicObjectImpl::length()\n{\n   int rval = 0;\n   \n   switch(mType)\n   {\n      case String:\n         if(mString != NULL)\n         {\n            rval = strlen(getString());\n         }\n         break;\n      case Boolean:\n         rval = 1;\n         break;\n      case Int32:\n      case UInt32:\n         rval = sizeof(unsigned int);\n         break;\n      case Int64:\n      case UInt64:\n         rval = sizeof(unsigned long long);\n         break;\n      case Double:\n         rval = sizeof(double);\n         break;\n      case Map:\n         rval = mMap->size();\n         break;\n      case Array:\n         rval = mArray->size();\n         break;\n   }\n   \n   return rval;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkCenteredAffineTransformTest.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 <iostream>\n\n#include \"itkCenteredAffineTransform.h\"\n#include \"itkImage.h\"\n#include \"vnl\/vnl_vector_fixed.h\"\n\ntypedef  itk::Matrix<double,2,2>   MatrixType;\ntypedef  itk::Vector<double,2>     VectorType;\n\nnamespace\n{\n  \nvoid PrintVector( const VectorType & v )\n{\n  for( unsigned int i=0; i<VectorType::Dimension; i++)\n  {\n    std::cout << v[i] << \", \";\n  }\n  std::cout << std::endl;\n}\n}\n\n\nint itkCenteredAffineTransformTest(int, char *[])\n{\n\n\n    int any = 0;       \/\/ Any errors detected in testing?\n\n    MatrixType                   matrix2;\n    MatrixType                   inverse2;\n    VectorType                   vector2;\n\n    int i, j;\n\n    \/* FIXME: This code exercises most of the methods but doesn't\n       actually check that the results are correct. *\/\n\n    \/* Create a 2D identity transformation and show its parameters *\/\n    typedef itk::Point<double,6> ParametersType;\n    typedef itk::Matrix<double,2,6> JacobianType;\n    \n    typedef itk::CenteredAffineTransform<double,2> Affine2DType;\n    Affine2DType::Pointer id2 = Affine2DType::New();\n    matrix2 = id2->GetMatrix();\n    vector2 = id2->GetOffset();\n    std::cout << \"Matrix from instantiating an identity transform:\"\n              << std::endl << matrix2;\n    std::cout << \"Vector from instantiating an identity transform:\"\n              << std::endl;\n    PrintVector( vector2 );\n    \n    \/* Create and show a simple 2D transform from given parameters *\/\n    matrix2[0][0] = 1;\n    matrix2[0][1] = 2;\n    matrix2[1][0] = 3;\n    matrix2[1][1] = 4;\n    vector2[0] = 5;\n    vector2[1] = 6;\n\n    Affine2DType::Pointer aff2 = Affine2DType::New();\n    aff2->SetMatrix( matrix2 );\n    aff2->SetOffset( vector2 );\n    for (i = 0; i < 2; i++) {\n        for (j = 0; j < 2; j++)\n            matrix2[i][j] = 0.0;\n        vector2[i]    = 0.0;\n    }\n    std::cout << \"Instantiation of a given 2D transform:\" << std::endl;\n    aff2->Print( std::cout );\n\n    inverse2 = aff2->GetInverseMatrix();\n    std::cout << \"Inverse matrix for the given transform:\"\n              << std::endl << inverse2;\n\n    \/* Set parameters of a 2D transform *\/\n    matrix2[0][0] = 6;\n    matrix2[0][1] = 5;\n    matrix2[1][0] = 4;\n    matrix2[1][1] = 3;\n    vector2[0] = 2;\n    vector2[1] = 1;\n    aff2->SetMatrix(matrix2);\n    aff2->SetOffset(vector2);\n    for (i = 0; i < 2; i++) {\n        for (j = 0; j < 2; j++)\n            matrix2[i][j] = 0.0;\n        vector2[i]    = 0.0;\n    }\n    matrix2 = aff2->GetMatrix();\n    vector2 = aff2->GetOffset();\n    std::cout << \"Setting the matrix in an existing transform:\"\n              << std::endl << matrix2;\n    std::cout << \"Setting the offset in an existing  transform:\"\n              << std::endl;\n    PrintVector( vector2 );\n\n\n    \/* Try composition of two transformations *\/\n    aff2->Compose( aff2 );\n    std::cout << \"Result of a composition:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with a translation *\/\n    VectorType trans;\n    trans[0] = 1;\n    trans[1] = 2;\n    aff2->Translate(trans);\n    std::cout << \"Result of a translation:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with an isotropic scaling *\/\n    aff2->Scale(.3, 1);\n    std::cout << \"Result of isotropic scaling:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with an anisotropic scaling *\/\n    VectorType scale;\n    scale[0] = .3;\n    scale[1] = .2;\n    aff2->Scale(scale);\n    std::cout << \"Result of anisotropic scaling:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with a general N-D rotation *\/\n    aff2->Rotate(0, 1, 0.57, 1);\n    std::cout << \"Result of general rotation:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with a 2-D rotation *\/\n    aff2->Rotate(0, 1, -0.57, 1);\n    std::cout << \"Result of 2-D rotation:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with a shear *\/\n    aff2->Shear(1, 0, .2);\n    std::cout << \"Result of shear:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Transform a point *\/\n    itk::Point<double, 2> u2, v2;\n    u2[0] = 3;\n    u2[1] = 5;\n    v2 = aff2->TransformPoint(u2);\n    std::cout << \"Transform a point:\" << std::endl\n              << v2[0] << \" , \" << v2[1] << std::endl;\n\n    \/* Back transform a point *\/\n    v2 = aff2->BackTransform(u2);\n    std::cout << \"Back transform a point:\" << std::endl\n              << v2[0] << \" , \" << v2[1] << std::endl;\n\n    \/* Transform a vnl_vector *\/\n    vnl_vector_fixed<double, 2> x2, y2;\n    x2[0] = 1;\n    x2[1] = 2;\n    y2 = aff2->TransformVector(x2);\n    std::cout << \"Transform a vnl_vector:\" << std::endl\n              << y2[0] << \" , \" << y2[1] << std::endl;\n\n    \/* Back transform a vector *\/\n    y2 = aff2->BackTransform(x2);\n    std::cout << \"Back transform a vnl_vector:\" << std::endl\n              << y2[0] << \" , \" << y2[1] << std::endl;\n\n    \/* Transform a vector *\/\n    itk::Vector<double, 2> u3, v3;\n    u3[0] = 3;\n    u3[1] = 5;\n    v3 = aff2->TransformVector(u3);\n    std::cout << \"Transform a vector:\" << std::endl\n              << v3[0] << \" , \" << v3[1] << std::endl;\n\n    \/* Back transform a vector *\/\n    v3 = aff2->BackTransform(u3);\n    std::cout << \"Back transform a vector :\" << std::endl\n              << v3[0] << \" , \" << v3[1] << std::endl;\n\n    \/* Transform a Covariant vector *\/\n    itk::Vector<double, 2> u4, v4;\n    u4[0] = 3;\n    u4[1] = 5;\n    v4 = aff2->TransformVector(u4);\n    std::cout << \"Transform a Covariant vector:\" << std::endl\n              << v4[0] << \" , \" << v4[1] << std::endl;\n\n    \/* Back transform a vector *\/\n    v4 = aff2->BackTransform(u4);\n    std::cout << \"Back transform a vector :\" << std::endl\n              << v4[0] << \" , \" << v4[1] << std::endl;\n\n\n\n    \/* Create a 3D transform and rotate in 3D *\/\n    typedef itk::CenteredAffineTransform<double,3> Affine3DType;\n    Affine3DType::Pointer aff3 = Affine3DType::New();\n    itk::Vector<double,3> axis;\n    axis[0] = .707;\n    axis[1] = .707;\n    axis[2] = .707;\n    aff3->Rotate3D(axis, 1.0, 1);\n    std::cout << \"Create and rotate a 3D transform:\" << std::endl;\n    aff3->Print( std::cout );\n\n    \/* Generate inverse transform *\/\n    Affine3DType::Pointer inv3 = Affine3DType::New();\n    if(!aff3->GetInverse(inv3))\n      {\n      std::cout << \"Cannot create inverse transformation\" << std::endl;\n      }\n    std::cout << \"Create an inverse transformation:\" << std::endl;\n    inv3->Print( std::cout );\n\n    \/* Create an image for testing index<->physical transforms *\/\n    std::cout << \"Creating image for testing index<->physical transforms\"\n              << std::endl;\n    double spacing[3] = {1.0, 2.0, 3.0};\n    double origin [3] = {4.0, 5.0, 6.0};\n    itk::Image<unsigned char, 3>::Pointer\n        image =itk::Image<unsigned char, 3>::New();\n    image->SetOrigin (origin);\n    image->SetSpacing(spacing);\n\n\n    \/* Test output of GetJacobian *\/\n    Affine3DType::Pointer jaff = Affine3DType::New();\n    Affine3DType::MatrixType jaffMatrix = jaff->GetMatrix();\n    Affine3DType::OffsetType jaffVector = jaff->GetOffset();\n\n    Affine3DType::InputPointType jpoint;\n    jpoint[0] = 5.0;\n    jpoint[1] = 10.0;\n    jpoint[2] = 15.0; \n    Affine3DType::JacobianType jaffJacobian = jaff->GetJacobian( jpoint );\n\n    std::cout << \"GetJacobian: \" << std::endl;\n    std::cout << jaffJacobian << std::endl;\n    \n\n    return any;\n}\n<commit_msg>BUG: Removed tests for deprecated member function<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkCenteredAffineTransformTest.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 <iostream>\n\n#include \"itkCenteredAffineTransform.h\"\n#include \"itkImage.h\"\n#include \"vnl\/vnl_vector_fixed.h\"\n\ntypedef  itk::Matrix<double,2,2>   MatrixType;\ntypedef  itk::Vector<double,2>     VectorType;\n\nnamespace\n{\n  \nvoid PrintVector( const VectorType & v )\n{\n  for( unsigned int i=0; i<VectorType::Dimension; i++)\n  {\n    std::cout << v[i] << \", \";\n  }\n  std::cout << std::endl;\n}\n}\n\n\nint itkCenteredAffineTransformTest(int, char *[])\n{\n\n\n    int any = 0;       \/\/ Any errors detected in testing?\n\n    MatrixType                   matrix2;\n    MatrixType                   inverse2;\n    VectorType                   vector2;\n\n    int i, j;\n\n    \/* FIXME: This code exercises most of the methods but doesn't\n       actually check that the results are correct. *\/\n\n    \/* Create a 2D identity transformation and show its parameters *\/\n    typedef itk::Point<double,6> ParametersType;\n    typedef itk::Matrix<double,2,6> JacobianType;\n    \n    typedef itk::CenteredAffineTransform<double,2> Affine2DType;\n    Affine2DType::Pointer id2 = Affine2DType::New();\n    matrix2 = id2->GetMatrix();\n    vector2 = id2->GetOffset();\n    std::cout << \"Matrix from instantiating an identity transform:\"\n              << std::endl << matrix2;\n    std::cout << \"Vector from instantiating an identity transform:\"\n              << std::endl;\n    PrintVector( vector2 );\n    \n    \/* Create and show a simple 2D transform from given parameters *\/\n    matrix2[0][0] = 1;\n    matrix2[0][1] = 2;\n    matrix2[1][0] = 3;\n    matrix2[1][1] = 4;\n    vector2[0] = 5;\n    vector2[1] = 6;\n\n    Affine2DType::Pointer aff2 = Affine2DType::New();\n    aff2->SetMatrix( matrix2 );\n    aff2->SetOffset( vector2 );\n    for (i = 0; i < 2; i++) {\n        for (j = 0; j < 2; j++)\n            matrix2[i][j] = 0.0;\n        vector2[i]    = 0.0;\n    }\n    std::cout << \"Instantiation of a given 2D transform:\" << std::endl;\n    aff2->Print( std::cout );\n\n    inverse2 = aff2->GetInverseMatrix();\n    std::cout << \"Inverse matrix for the given transform:\"\n              << std::endl << inverse2;\n\n    \/* Set parameters of a 2D transform *\/\n    matrix2[0][0] = 6;\n    matrix2[0][1] = 5;\n    matrix2[1][0] = 4;\n    matrix2[1][1] = 3;\n    vector2[0] = 2;\n    vector2[1] = 1;\n    aff2->SetMatrix(matrix2);\n    aff2->SetOffset(vector2);\n    for (i = 0; i < 2; i++) {\n        for (j = 0; j < 2; j++)\n            matrix2[i][j] = 0.0;\n        vector2[i]    = 0.0;\n    }\n    matrix2 = aff2->GetMatrix();\n    vector2 = aff2->GetOffset();\n    std::cout << \"Setting the matrix in an existing transform:\"\n              << std::endl << matrix2;\n    std::cout << \"Setting the offset in an existing  transform:\"\n              << std::endl;\n    PrintVector( vector2 );\n\n\n    \/* Try composition of two transformations *\/\n    aff2->Compose( aff2 );\n    std::cout << \"Result of a composition:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with a translation *\/\n    VectorType trans;\n    trans[0] = 1;\n    trans[1] = 2;\n    aff2->Translate(trans);\n    std::cout << \"Result of a translation:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with an isotropic scaling *\/\n    aff2->Scale(.3, 1);\n    std::cout << \"Result of isotropic scaling:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with an anisotropic scaling *\/\n    VectorType scale;\n    scale[0] = .3;\n    scale[1] = .2;\n    aff2->Scale(scale);\n    std::cout << \"Result of anisotropic scaling:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with a general N-D rotation *\/\n    aff2->Rotate(0, 1, 0.57, 1);\n    std::cout << \"Result of general rotation:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with a 2-D rotation *\/\n    aff2->Rotate(0, 1, -0.57, 1);\n    std::cout << \"Result of 2-D rotation:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Compose with a shear *\/\n    aff2->Shear(1, 0, .2);\n    std::cout << \"Result of shear:\" << std::endl;\n    aff2->Print( std::cout );\n\n    \/* Transform a point *\/\n    itk::Point<double, 2> u2, v2;\n    u2[0] = 3;\n    u2[1] = 5;\n    v2 = aff2->TransformPoint(u2);\n    std::cout << \"Transform a point:\" << std::endl\n              << v2[0] << \" , \" << v2[1] << std::endl;\n\n    \/\/\/* Back transform a point *\/\n    \/\/v2 = aff2->BackTransform(u2);\n    \/\/std::cout << \"Back transform a point:\" << std::endl\n              \/\/<< v2[0] << \" , \" << v2[1] << std::endl;\n\n    \/* Transform a vnl_vector *\/\n    vnl_vector_fixed<double, 2> x2, y2;\n    x2[0] = 1;\n    x2[1] = 2;\n    y2 = aff2->TransformVector(x2);\n    std::cout << \"Transform a vnl_vector:\" << std::endl\n              << y2[0] << \" , \" << y2[1] << std::endl;\n\n    \/\/\/* Back transform a vector *\/\n    \/\/y2 = aff2->BackTransform(x2);\n    \/\/std::cout << \"Back transform a vnl_vector:\" << std::endl\n              \/\/<< y2[0] << \" , \" << y2[1] << std::endl;\n\n    \/* Transform a vector *\/\n    itk::Vector<double, 2> u3, v3;\n    u3[0] = 3;\n    u3[1] = 5;\n    v3 = aff2->TransformVector(u3);\n    std::cout << \"Transform a vector:\" << std::endl\n              << v3[0] << \" , \" << v3[1] << std::endl;\n\n    \/\/\/* Back transform a vector *\/\n    \/\/v3 = aff2->BackTransform(u3);\n    \/\/std::cout << \"Back transform a vector :\" << std::endl\n              \/\/<< v3[0] << \" , \" << v3[1] << std::endl;\n\n    \/* Transform a Covariant vector *\/\n    itk::Vector<double, 2> u4, v4;\n    u4[0] = 3;\n    u4[1] = 5;\n    v4 = aff2->TransformVector(u4);\n    std::cout << \"Transform a Covariant vector:\" << std::endl\n              << v4[0] << \" , \" << v4[1] << std::endl;\n\n    \/\/\/* Back transform a vector *\/\n    \/\/v4 = aff2->BackTransform(u4);\n    \/\/std::cout << \"Back transform a vector :\" << std::endl\n              \/\/<< v4[0] << \" , \" << v4[1] << std::endl;\n\n\n\n    \/* Create a 3D transform and rotate in 3D *\/\n    typedef itk::CenteredAffineTransform<double,3> Affine3DType;\n    Affine3DType::Pointer aff3 = Affine3DType::New();\n    itk::Vector<double,3> axis;\n    axis[0] = .707;\n    axis[1] = .707;\n    axis[2] = .707;\n    aff3->Rotate3D(axis, 1.0, 1);\n    std::cout << \"Create and rotate a 3D transform:\" << std::endl;\n    aff3->Print( std::cout );\n\n    \/* Generate inverse transform *\/\n    Affine3DType::Pointer inv3 = Affine3DType::New();\n    if(!aff3->GetInverse(inv3))\n      {\n      std::cout << \"Cannot create inverse transformation\" << std::endl;\n      }\n    std::cout << \"Create an inverse transformation:\" << std::endl;\n    inv3->Print( std::cout );\n\n    \/* Create an image for testing index<->physical transforms *\/\n    std::cout << \"Creating image for testing index<->physical transforms\"\n              << std::endl;\n    double spacing[3] = {1.0, 2.0, 3.0};\n    double origin [3] = {4.0, 5.0, 6.0};\n    itk::Image<unsigned char, 3>::Pointer\n        image =itk::Image<unsigned char, 3>::New();\n    image->SetOrigin (origin);\n    image->SetSpacing(spacing);\n\n\n    \/* Test output of GetJacobian *\/\n    Affine3DType::Pointer jaff = Affine3DType::New();\n    Affine3DType::MatrixType jaffMatrix = jaff->GetMatrix();\n    Affine3DType::OffsetType jaffVector = jaff->GetOffset();\n\n    Affine3DType::InputPointType jpoint;\n    jpoint[0] = 5.0;\n    jpoint[1] = 10.0;\n    jpoint[2] = 15.0; \n    Affine3DType::JacobianType jaffJacobian = jaff->GetJacobian( jpoint );\n\n    std::cout << \"GetJacobian: \" << std::endl;\n    std::cout << jaffJacobian << std::endl;\n    \n\n    return any;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __MODEL_HPP_INCLUDED\n#define __MODEL_HPP_INCLUDED\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h>\n#endif\n\n\/\/ Include GLFW\n#ifndef __GLFW3_H_INCLUDED\n#define __GLFW3_H_INCLUDED\n#include <glfw3.h>\n#endif\n\n\/\/ Include GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp>\n#endif\n\n#include <iostream>\n#include <queue> \/\/ std::queue\n#include <string.h>\n#include \"globals.hpp\"\n#include \"shader.hpp\"\n#include \"heightmap_loader.hpp\"\n#include \"objloader.hpp\"\n\nnamespace model\n{\n    class World\n    {\n        public:\n            \/\/ constructor.\n            World();\n\n            \/\/ destructor.\n            ~World();\n\n            \/\/ this method renders the entire world, one shader at a time.\n            void render();\n\n            \/\/ this method sets a shader pointer.\n            void set_pointer(GLuint shaderID, void* shader_pointer);\n\n            \/\/ this method gets a shader pointer.\n            void* get_pointer(GLuint shaderID);\n\n            \/\/ this method gets a shader ID and removes it from the `free_shaderID_queue` if it was popped from the queue.\n            GLuint get_shaderID();\n\n        private:\n            std::vector<void*> shader_pointer_vector;\n            std::queue<GLuint> free_shaderID_queue;\n    };\n\n    class Shader\n    {\n        public:\n            \/\/ constructor.\n            Shader(ShaderStruct shader_struct);\n\n            \/\/ destructor.\n            ~Shader();\n\n            \/\/ this method renders all species using this shader.\n            void render();\n\n            \/\/ this method sets a species pointer.\n            void set_pointer(GLuint speciesID, void* species_pointer);\n\n            \/\/ this method gets a species pointer.\n            void* get_pointer(GLuint speciesID);\n\n            \/\/ this method gets a species ID and removes it from the `free_speciesID_queue` if it was popped from the queue.\n            GLuint get_speciesID();\n\n            \/\/ this method sets pointer to this shader to NULL, sets `world_pointer` according to the input, and requests a new `shaderID` from the new world.\n            void switch_to_new_world(model::World *new_world_pointer);\n\n            model::World *world_pointer;          \/\/ pointer to the world.\n\n            GLuint shaderID;                      \/\/ shader ID, returned by `model::World->get_shaderID()`.\n\n            std::string vertex_shader;            \/\/ filename of vertex shader.\n            std::string fragment_shader;          \/\/ filename of fragment shader.\n\n            GLuint programID;                     \/\/ shaders' programID, returned by `LoadShaders`.\n\n        private:\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\n\n            const char *char_vertex_shader;\n            const char *char_fragment_shader;\n    };\n\n    class Graph\n    {\n        public:\n            \/\/ constructor.\n            Graph();\n\n            \/\/ destructor.\n            ~Graph();\n\n            \/\/ this method sets a node pointer.\n            void set_pointer(GLuint nodeID, void* node_pointer);\n\n            \/\/ this method gets a node pointer.\n            void* get_pointer(GLuint nodeID);\n\n            \/\/ this method gets a node ID and removes it from the `free_nodeID_queue` if it was popped from the queue.\n            GLuint get_nodeID();\n\n        private:\n            std::vector<void*> node_pointer_vector;\n            std::queue<GLuint> free_nodeID_queue;\n    };\n\n    \/\/ `Node` is not a subclass of `Graph` because if the graph splits, node may be transferred to an another graph.\n    \/\/ Transferring a node to a new graph naturally requires appropriate reindexing of `nodeID`s.\n    \/\/ The graph in which a node belongs is accessible through `void* graph_pointer` (must be cast to `model::Graph*`).\n    class Node\n    {\n        public:\n            \/\/ constructor.\n            Node(NodeStruct node_struct);\n\n            \/\/ destructor.\n            ~Node();\n\n            \/\/ this method creates a bidirectional link.\n            \/\/ creating of bidirectional links is not possible before all nodes are created.\n            void create_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes a bidirectional link.\n            \/\/ deleting of links is not possible before all nodes are created.\n            void delete_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method transfers this node to a new graph.\n            \/\/ links will not be changed.\n            \/\/ all nodes that are to be transferred must be transferred separately.\n            \/\/ before transfering any node to a new graph,\n            \/\/ all links to nodes that do not belong to the new graph of this node must be deleted with separate `delete_bidirectional_link` calls.\n            void transfer_to_new_graph(model::Graph *new_graph_pointer);\n\n            GLuint nodeID;\n            model::Graph *graph_pointer;\n\n            \/\/ nodes do not keep pointers to neighbor nodes, because all pointer values are not known yet before all nodes are created.\n            std::vector<GLuint> neighbor_nodeIDs;\n\n        private:\n            \/\/ this method creates an unidirectional link.\n            \/\/ in the constructor only unidirectional links can be created.\n            void create_unidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes an unidirectional link.\n            void delete_unidirectional_link(GLuint nodeID);\n\n            glm::vec3 coordinate_vector;\n    };\n\n    class Species\n    {\n        public:\n            \/\/ constructor.\n            Species(SpeciesStruct species_struct);\n\n            \/\/ destructor.\n            ~Species();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a object pointer.\n            void set_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_pointer(GLuint objectID);\n\n            \/\/ this method gets a object ID and removes it from the `free_objectID_queue` if it was popped from the queue.\n            GLuint get_objectID();\n\n            \/\/ this method sets pointer to this species to NULL, sets `shader_pointer` according to the input, and requests a new `speciesID` from the new shader.\n            void switch_to_new_shader(model::Shader *new_shader_pointer);\n\n            std::string texture_file_format;         \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string texture_filename;            \/\/ filename of the model file.\n            std::string color_channel;               \/\/ color channel in use: `\"red\"`, `\"green\"`, `\"blue\"`, `\"mean\"` or `\"all\"`.\n            std::vector<ObjectStruct> object_vector; \/\/ vector of individual objects of this species.\n            glm::vec3 lightPos;                      \/\/ light position.\n\n            void *vertex_UV_pointer;                 \/\/ pointer to the vertex & UV species (not yet in use!).\n            void *texture_pointer;                   \/\/ pointer to the texture species (not yet in use!).\n\n            \/\/ The rest fields are created in the constructor.\n            GLuint MatrixID;\n            GLuint ViewMatrixID;\n            GLuint ModelMatrixID;\n            GLuint vertexPosition_modelspaceID;\n            GLuint vertexUVID;\n            GLuint vertexNormal_modelspaceID;\n\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object.\n\n            std::vector<GLuint> indices;           \/\/ the deleted vertices will be reused (though it is not required, if there's enough memory).\n            std::vector<glm::vec3> indexed_vertices;\n            std::vector<glm::vec2> indexed_UVs;\n            std::vector<glm::vec3> indexed_normals;\n\n            GLuint vertexbuffer;\n            GLuint uvbuffer;\n            GLuint normalbuffer;\n            GLuint elementbuffer;\n\n            glm::mat4 ProjectionMatrix;\n            glm::mat4 ViewMatrix;\n        private:\n            model::Shader *shader_pointer;         \/\/ pointer to the shader.\n\n            std::string model_file_format;         \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string model_filename;            \/\/ filename of the model file.\n            GLuint speciesID;                      \/\/ species ID, returned by `model::World->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            GLuint texture;                        \/\/ Texture, returned by `load_DDS_texture` or `load_BMP_texture`.\n            GLuint textureID;                      \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n            const char *char_model_file_format;\n            const char *char_model_filename;\n            const char *char_texture_file_format;\n            const char *char_texture_filename;\n            const char *char_color_channel;\n\n            std::vector<void*> object_pointer_vector;\n            std::queue<GLuint> free_objectID_queue;\n    };\n\n    class Object\n    {\n        public:\n            \/\/ constructor.\n            Object(ObjectStruct object_struct);\n\n            \/\/ destructor.\n            ~Object();\n\n            \/\/ this method renders this object.\n            void render();\n\n            \/\/ this method sets pointer to this object to NULL, sets `species_pointer` according to the input, and requests a new `objectID` from the new species.\n            void switch_to_new_species(model::Species *new_species_pointer);\n\n            model::Species *species_pointer;       \/\/ pointer to the species.\n\n            GLuint objectID;                      \/\/ object ID, returned by `model::Species->get_objectID()`.\n\n            bool has_entered;\n            glm::vec3 coordinate_vector;           \/\/ rotate vector.\n            GLfloat rotate_angle;                  \/\/ rotate angle.\n            glm::vec3 rotate_vector;               \/\/ rotate vector.\n            glm::vec3 translate_vector;            \/\/ translate vector.\n\n            \/\/ The rest fields are created in the constructor.\n            glm::mat4 model_matrix;                \/\/ model matrix.\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object. not used at the moment.\n\n            glm::mat4 MVP_matrix;                  \/\/ model view projection matrix.\n    };\n}\n\n#endif\n<commit_msg>`std::string texture_file_format` on `private`-muuttuja.<commit_after>#ifndef __MODEL_HPP_INCLUDED\n#define __MODEL_HPP_INCLUDED\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h>\n#endif\n\n\/\/ Include GLFW\n#ifndef __GLFW3_H_INCLUDED\n#define __GLFW3_H_INCLUDED\n#include <glfw3.h>\n#endif\n\n\/\/ Include GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp>\n#endif\n\n#include <iostream>\n#include <queue> \/\/ std::queue\n#include <string.h>\n#include \"globals.hpp\"\n#include \"shader.hpp\"\n#include \"heightmap_loader.hpp\"\n#include \"objloader.hpp\"\n\nnamespace model\n{\n    class World\n    {\n        public:\n            \/\/ constructor.\n            World();\n\n            \/\/ destructor.\n            ~World();\n\n            \/\/ this method renders the entire world, one shader at a time.\n            void render();\n\n            \/\/ this method sets a shader pointer.\n            void set_pointer(GLuint shaderID, void* shader_pointer);\n\n            \/\/ this method gets a shader pointer.\n            void* get_pointer(GLuint shaderID);\n\n            \/\/ this method gets a shader ID and removes it from the `free_shaderID_queue` if it was popped from the queue.\n            GLuint get_shaderID();\n\n        private:\n            std::vector<void*> shader_pointer_vector;\n            std::queue<GLuint> free_shaderID_queue;\n    };\n\n    class Shader\n    {\n        public:\n            \/\/ constructor.\n            Shader(ShaderStruct shader_struct);\n\n            \/\/ destructor.\n            ~Shader();\n\n            \/\/ this method renders all species using this shader.\n            void render();\n\n            \/\/ this method sets a species pointer.\n            void set_pointer(GLuint speciesID, void* species_pointer);\n\n            \/\/ this method gets a species pointer.\n            void* get_pointer(GLuint speciesID);\n\n            \/\/ this method gets a species ID and removes it from the `free_speciesID_queue` if it was popped from the queue.\n            GLuint get_speciesID();\n\n            \/\/ this method sets pointer to this shader to NULL, sets `world_pointer` according to the input, and requests a new `shaderID` from the new world.\n            void switch_to_new_world(model::World *new_world_pointer);\n\n            model::World *world_pointer;          \/\/ pointer to the world.\n\n            GLuint shaderID;                      \/\/ shader ID, returned by `model::World->get_shaderID()`.\n\n            std::string vertex_shader;            \/\/ filename of vertex shader.\n            std::string fragment_shader;          \/\/ filename of fragment shader.\n\n            GLuint programID;                     \/\/ shaders' programID, returned by `LoadShaders`.\n\n        private:\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\n\n            const char *char_vertex_shader;\n            const char *char_fragment_shader;\n    };\n\n    class Graph\n    {\n        public:\n            \/\/ constructor.\n            Graph();\n\n            \/\/ destructor.\n            ~Graph();\n\n            \/\/ this method sets a node pointer.\n            void set_pointer(GLuint nodeID, void* node_pointer);\n\n            \/\/ this method gets a node pointer.\n            void* get_pointer(GLuint nodeID);\n\n            \/\/ this method gets a node ID and removes it from the `free_nodeID_queue` if it was popped from the queue.\n            GLuint get_nodeID();\n\n        private:\n            std::vector<void*> node_pointer_vector;\n            std::queue<GLuint> free_nodeID_queue;\n    };\n\n    \/\/ `Node` is not a subclass of `Graph` because if the graph splits, node may be transferred to an another graph.\n    \/\/ Transferring a node to a new graph naturally requires appropriate reindexing of `nodeID`s.\n    \/\/ The graph in which a node belongs is accessible through `void* graph_pointer` (must be cast to `model::Graph*`).\n    class Node\n    {\n        public:\n            \/\/ constructor.\n            Node(NodeStruct node_struct);\n\n            \/\/ destructor.\n            ~Node();\n\n            \/\/ this method creates a bidirectional link.\n            \/\/ creating of bidirectional links is not possible before all nodes are created.\n            void create_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes a bidirectional link.\n            \/\/ deleting of links is not possible before all nodes are created.\n            void delete_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method transfers this node to a new graph.\n            \/\/ links will not be changed.\n            \/\/ all nodes that are to be transferred must be transferred separately.\n            \/\/ before transfering any node to a new graph,\n            \/\/ all links to nodes that do not belong to the new graph of this node must be deleted with separate `delete_bidirectional_link` calls.\n            void transfer_to_new_graph(model::Graph *new_graph_pointer);\n\n            GLuint nodeID;\n            model::Graph *graph_pointer;\n\n            \/\/ nodes do not keep pointers to neighbor nodes, because all pointer values are not known yet before all nodes are created.\n            std::vector<GLuint> neighbor_nodeIDs;\n\n        private:\n            \/\/ this method creates an unidirectional link.\n            \/\/ in the constructor only unidirectional links can be created.\n            void create_unidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes an unidirectional link.\n            void delete_unidirectional_link(GLuint nodeID);\n\n            glm::vec3 coordinate_vector;\n    };\n\n    class Species\n    {\n        public:\n            \/\/ constructor.\n            Species(SpeciesStruct species_struct);\n\n            \/\/ destructor.\n            ~Species();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a object pointer.\n            void set_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_pointer(GLuint objectID);\n\n            \/\/ this method gets a object ID and removes it from the `free_objectID_queue` if it was popped from the queue.\n            GLuint get_objectID();\n\n            \/\/ this method sets pointer to this species to NULL, sets `shader_pointer` according to the input, and requests a new `speciesID` from the new shader.\n            void switch_to_new_shader(model::Shader *new_shader_pointer);\n\n            std::string texture_filename;            \/\/ filename of the model file.\n            std::string color_channel;               \/\/ color channel in use: `\"red\"`, `\"green\"`, `\"blue\"`, `\"mean\"` or `\"all\"`.\n            std::vector<ObjectStruct> object_vector; \/\/ vector of individual objects of this species.\n            glm::vec3 lightPos;                      \/\/ light position.\n\n            void *vertex_UV_pointer;                 \/\/ pointer to the vertex & UV species (not yet in use!).\n            void *texture_pointer;                   \/\/ pointer to the texture species (not yet in use!).\n\n            \/\/ The rest fields are created in the constructor.\n            GLuint MatrixID;\n            GLuint ViewMatrixID;\n            GLuint ModelMatrixID;\n            GLuint vertexPosition_modelspaceID;\n            GLuint vertexUVID;\n            GLuint vertexNormal_modelspaceID;\n\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object.\n\n            std::vector<GLuint> indices;           \/\/ the deleted vertices will be reused (though it is not required, if there's enough memory).\n            std::vector<glm::vec3> indexed_vertices;\n            std::vector<glm::vec2> indexed_UVs;\n            std::vector<glm::vec3> indexed_normals;\n\n            GLuint vertexbuffer;\n            GLuint uvbuffer;\n            GLuint normalbuffer;\n            GLuint elementbuffer;\n\n            glm::mat4 ProjectionMatrix;\n            glm::mat4 ViewMatrix;\n        private:\n            model::Shader *shader_pointer;         \/\/ pointer to the shader.\n\n            std::string model_file_format;         \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string model_filename;            \/\/ filename of the model file.\n            std::string texture_file_format;       \/\/ type of the model file, eg. `\"bmp\"`.\n            GLuint speciesID;                      \/\/ species ID, returned by `model::World->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            GLuint texture;                        \/\/ Texture, returned by `load_DDS_texture` or `load_BMP_texture`.\n            GLuint textureID;                      \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n            const char *char_model_file_format;\n            const char *char_model_filename;\n            const char *char_texture_file_format;\n            const char *char_texture_filename;\n            const char *char_color_channel;\n\n            std::vector<void*> object_pointer_vector;\n            std::queue<GLuint> free_objectID_queue;\n    };\n\n    class Object\n    {\n        public:\n            \/\/ constructor.\n            Object(ObjectStruct object_struct);\n\n            \/\/ destructor.\n            ~Object();\n\n            \/\/ this method renders this object.\n            void render();\n\n            \/\/ this method sets pointer to this object to NULL, sets `species_pointer` according to the input, and requests a new `objectID` from the new species.\n            void switch_to_new_species(model::Species *new_species_pointer);\n\n            model::Species *species_pointer;       \/\/ pointer to the species.\n\n            GLuint objectID;                      \/\/ object ID, returned by `model::Species->get_objectID()`.\n\n            bool has_entered;\n            glm::vec3 coordinate_vector;           \/\/ rotate vector.\n            GLfloat rotate_angle;                  \/\/ rotate angle.\n            glm::vec3 rotate_vector;               \/\/ rotate vector.\n            glm::vec3 translate_vector;            \/\/ translate vector.\n\n            \/\/ The rest fields are created in the constructor.\n            glm::mat4 model_matrix;                \/\/ model matrix.\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object. not used at the moment.\n\n            glm::mat4 MVP_matrix;                  \/\/ model view projection matrix.\n    };\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __MODEL_HPP_INCLUDED\n#define __MODEL_HPP_INCLUDED\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h>\n#endif\n\n\/\/ Include GLFW\n#ifndef __GLFW3_H_INCLUDED\n#define __GLFW3_H_INCLUDED\n#include <glfw3.h>\n#endif\n\n\/\/ Include GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp>\n#endif\n\n#include <iostream>\n#include <queue> \/\/ std::queue\n#include <string.h>\n#include \"globals.hpp\"\n#include \"shader.hpp\"\n#include \"heightmap_loader.hpp\"\n#include \"objloader.hpp\"\n\nnamespace model\n{\n    class World\n    {\n        public:\n            \/\/ constructor.\n            World();\n\n            \/\/ destructor.\n            ~World();\n\n            \/\/ this method renders the entire world, one shader at a time.\n            void render();\n\n            \/\/ this method sets a shader pointer.\n            void set_shader_pointer(GLuint shaderID, void* shader_pointer);\n\n            \/\/ this method gets a shader pointer.\n            void* get_shader_pointer(GLuint shaderID);\n\n            \/\/ this method sets a texture pointer.\n            void set_texture_pointer(GLuint textureID, void* texture_pointer);\n\n            \/\/ this method gets a texture pointer.\n            void* get_texture_pointer(GLuint textureID);\n\n            \/\/ this method gets a shader ID and removes it from the `free_shaderID_queue` if it was popped from the queue.\n            GLuint get_shaderID();\n\n            \/\/ this method gets a texture ID and removes it from the `free_textureID_queue` if it was popped from the queue.\n            GLuint get_textureID();\n\n        private:\n            std::vector<void*> shader_pointer_vector;\n            std::queue<GLuint> free_shaderID_queue;\n            std::vector<void*> texture_pointer_vector;\n            std::queue<GLuint> free_textureID_queue;\n    };\n\n    class Shader\n    {\n        public:\n            \/\/ constructor.\n            Shader(ShaderStruct shader_struct);\n\n            \/\/ destructor.\n            ~Shader();\n\n            \/\/ this method renders all species using this shader.\n            void render();\n\n            \/\/ this method sets a species pointer.\n            void set_pointer(GLuint speciesID, void* species_pointer);\n\n            \/\/ this method gets a species pointer.\n            void* get_pointer(GLuint speciesID);\n\n            \/\/ this method gets a species ID and removes it from the `free_speciesID_queue` if it was popped from the queue.\n            GLuint get_speciesID();\n\n            \/\/ this method sets pointer to this shader to NULL, sets `world_pointer` according to the input, and requests a new `shaderID` from the new world.\n            void switch_to_new_world(model::World *new_world_pointer);\n\n            model::World *world_pointer;          \/\/ pointer to the world.\n\n            GLuint shaderID;                      \/\/ shader ID, returned by `model::World->get_shaderID()`.\n\n            std::string vertex_shader;            \/\/ filename of vertex shader.\n            std::string fragment_shader;          \/\/ filename of fragment shader.\n\n            GLuint programID;                     \/\/ shaders' programID, returned by `LoadShaders`.\n\n        private:\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\n\n            const char *char_vertex_shader;\n            const char *char_fragment_shader;\n    };\n\n    class Texture\n    {\n        public:\n            \/\/ constructor.\n            Texture(TextureStruct texture_struct);\n\n            \/\/ destructor.\n            ~Texture();\n\n            model::World *world_pointer;           \/\/ pointer to the world.\n            GLuint textureID;                      \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n\n        private:\n            std::vector<void*> species_pointer_vector;\n    };\n\n    class Graph\n    {\n        public:\n            \/\/ constructor.\n            Graph();\n\n            \/\/ destructor.\n            ~Graph();\n\n            \/\/ this method sets a node pointer.\n            void set_pointer(GLuint nodeID, void* node_pointer);\n\n            \/\/ this method gets a node pointer.\n            void* get_pointer(GLuint nodeID);\n\n            \/\/ this method gets a node ID and removes it from the `free_nodeID_queue` if it was popped from the queue.\n            GLuint get_nodeID();\n\n        private:\n            std::vector<void*> node_pointer_vector;\n            std::queue<GLuint> free_nodeID_queue;\n    };\n\n    \/\/ `Node` is not a subclass of `Graph` because if the graph splits, node may be transferred to an another graph.\n    \/\/ Transferring a node to a new graph naturally requires appropriate reindexing of `nodeID`s.\n    \/\/ The graph in which a node belongs is accessible through `void* graph_pointer` (must be cast to `model::Graph*`).\n    class Node\n    {\n        public:\n            \/\/ constructor.\n            Node(NodeStruct node_struct);\n\n            \/\/ destructor.\n            ~Node();\n\n            \/\/ this method creates a bidirectional link.\n            \/\/ creating of bidirectional links is not possible before all nodes are created.\n            void create_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes a bidirectional link.\n            \/\/ deleting of links is not possible before all nodes are created.\n            void delete_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method transfers this node to a new graph.\n            \/\/ links will not be changed.\n            \/\/ all nodes that are to be transferred must be transferred separately.\n            \/\/ before transfering any node to a new graph,\n            \/\/ all links to nodes that do not belong to the new graph of this node must be deleted with separate `delete_bidirectional_link` calls.\n            void transfer_to_new_graph(model::Graph *new_graph_pointer);\n\n            GLuint nodeID;\n            model::Graph *graph_pointer;\n\n            \/\/ nodes do not keep pointers to neighbor nodes, because all pointer values are not known yet before all nodes are created.\n            std::vector<GLuint> neighbor_nodeIDs;\n\n        private:\n            \/\/ this method creates an unidirectional link.\n            \/\/ in the constructor only unidirectional links can be created.\n            void create_unidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes an unidirectional link.\n            void delete_unidirectional_link(GLuint nodeID);\n\n            glm::vec3 coordinate_vector;\n    };\n\n    class Species\n    {\n        public:\n            \/\/ constructor.\n            Species(SpeciesStruct species_struct);\n\n            \/\/ destructor.\n            ~Species();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a object pointer.\n            void set_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_pointer(GLuint objectID);\n\n            \/\/ this method gets a object ID and removes it from the `free_objectID_queue` if it was popped from the queue.\n            GLuint get_objectID();\n\n            \/\/ this method sets pointer to this species to NULL, sets `shader_pointer` according to the input, and requests a new `speciesID` from the new shader.\n            void switch_to_new_shader(model::Shader *new_shader_pointer);\n\n            std::string color_channel;               \/\/ color channel in use: `\"red\"`, `\"green\"`, `\"blue\"`, `\"mean\"` or `\"all\"`.\n            std::vector<ObjectStruct> object_vector; \/\/ vector of individual objects of this species.\n            glm::vec3 lightPos;                      \/\/ light position.\n\n            void *vertex_UV_pointer;                 \/\/ pointer to the vertex & UV species (not yet in use!).\n            void *texture_pointer;                   \/\/ pointer to the texture species (not yet in use!).\n\n            \/\/ The rest fields are created in the constructor.\n            GLuint MatrixID;\n            GLuint ViewMatrixID;\n            GLuint ModelMatrixID;\n            GLuint vertexPosition_modelspaceID;\n            GLuint vertexUVID;\n            GLuint vertexNormal_modelspaceID;\n\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object.\n\n            std::vector<GLuint> indices;           \/\/ the deleted vertices will be reused (though it is not required, if there's enough memory).\n            std::vector<glm::vec3> indexed_vertices;\n            std::vector<glm::vec2> indexed_UVs;\n            std::vector<glm::vec3> indexed_normals;\n\n            GLuint vertexbuffer;\n            GLuint uvbuffer;\n            GLuint normalbuffer;\n            GLuint elementbuffer;\n\n            glm::mat4 ProjectionMatrix;\n            glm::mat4 ViewMatrix;\n        private:\n            model::Shader *shader_pointer;         \/\/ pointer to the shader.\n\n            std::string model_file_format;         \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string model_filename;            \/\/ filename of the model file.\n            std::string texture_file_format;       \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string texture_filename;          \/\/ filename of the model file.\n            GLuint speciesID_from_shader;          \/\/ species ID, returned by `model::Shader->get_speciesID()`.\n            GLuint speciesID_from_texture;         \/\/ species ID, returned by `model::Texture->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            GLuint texture;                        \/\/ Texture, returned by `load_DDS_texture` or `load_BMP_texture`.\n            GLuint textureID;                      \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n            const char *char_model_file_format;\n            const char *char_model_filename;\n            const char *char_texture_file_format;\n            const char *char_texture_filename;\n            const char *char_color_channel;\n\n            std::vector<void*> object_pointer_vector;\n            std::queue<GLuint> free_objectID_queue;\n    };\n\n    class Object\n    {\n        public:\n            \/\/ constructor.\n            Object(ObjectStruct object_struct);\n\n            \/\/ destructor.\n            ~Object();\n\n            \/\/ this method renders this object.\n            void render();\n\n            \/\/ this method sets pointer to this object to NULL, sets `species_pointer` according to the input, and requests a new `objectID` from the new species.\n            void switch_to_new_species(model::Species *new_species_pointer);\n\n            model::Species *species_pointer;       \/\/ pointer to the species.\n\n            GLuint objectID;                      \/\/ object ID, returned by `model::Species->get_objectID()`.\n\n            bool has_entered;\n            glm::vec3 coordinate_vector;           \/\/ rotate vector.\n            GLfloat rotate_angle;                  \/\/ rotate angle.\n            glm::vec3 rotate_vector;               \/\/ rotate vector.\n            glm::vec3 translate_vector;            \/\/ translate vector.\n\n            \/\/ The rest fields are created in the constructor.\n            glm::mat4 model_matrix;                \/\/ model matrix.\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object. not used at the moment.\n\n            glm::mat4 MVP_matrix;                  \/\/ model view projection matrix.\n    };\n}\n\n#endif\n<commit_msg>`class Species`: `std::queue<GLuint> free_speciesID_queue`.<commit_after>#ifndef __MODEL_HPP_INCLUDED\n#define __MODEL_HPP_INCLUDED\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h>\n#endif\n\n\/\/ Include GLFW\n#ifndef __GLFW3_H_INCLUDED\n#define __GLFW3_H_INCLUDED\n#include <glfw3.h>\n#endif\n\n\/\/ Include GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp>\n#endif\n\n#include <iostream>\n#include <queue> \/\/ std::queue\n#include <string.h>\n#include \"globals.hpp\"\n#include \"shader.hpp\"\n#include \"heightmap_loader.hpp\"\n#include \"objloader.hpp\"\n\nnamespace model\n{\n    class World\n    {\n        public:\n            \/\/ constructor.\n            World();\n\n            \/\/ destructor.\n            ~World();\n\n            \/\/ this method renders the entire world, one shader at a time.\n            void render();\n\n            \/\/ this method sets a shader pointer.\n            void set_shader_pointer(GLuint shaderID, void* shader_pointer);\n\n            \/\/ this method gets a shader pointer.\n            void* get_shader_pointer(GLuint shaderID);\n\n            \/\/ this method sets a texture pointer.\n            void set_texture_pointer(GLuint textureID, void* texture_pointer);\n\n            \/\/ this method gets a texture pointer.\n            void* get_texture_pointer(GLuint textureID);\n\n            \/\/ this method gets a shader ID and removes it from the `free_shaderID_queue` if it was popped from the queue.\n            GLuint get_shaderID();\n\n            \/\/ this method gets a texture ID and removes it from the `free_textureID_queue` if it was popped from the queue.\n            GLuint get_textureID();\n\n        private:\n            std::vector<void*> shader_pointer_vector;\n            std::queue<GLuint> free_shaderID_queue;\n            std::vector<void*> texture_pointer_vector;\n            std::queue<GLuint> free_textureID_queue;\n    };\n\n    class Shader\n    {\n        public:\n            \/\/ constructor.\n            Shader(ShaderStruct shader_struct);\n\n            \/\/ destructor.\n            ~Shader();\n\n            \/\/ this method renders all species using this shader.\n            void render();\n\n            \/\/ this method sets a species pointer.\n            void set_pointer(GLuint speciesID, void* species_pointer);\n\n            \/\/ this method gets a species pointer.\n            void* get_pointer(GLuint speciesID);\n\n            \/\/ this method gets a species ID and removes it from the `free_speciesID_queue` if it was popped from the queue.\n            GLuint get_speciesID();\n\n            \/\/ this method sets pointer to this shader to NULL, sets `world_pointer` according to the input, and requests a new `shaderID` from the new world.\n            void switch_to_new_world(model::World *new_world_pointer);\n\n            model::World *world_pointer;          \/\/ pointer to the world.\n\n            GLuint shaderID;                      \/\/ shader ID, returned by `model::World->get_shaderID()`.\n\n            std::string vertex_shader;            \/\/ filename of vertex shader.\n            std::string fragment_shader;          \/\/ filename of fragment shader.\n\n            GLuint programID;                     \/\/ shaders' programID, returned by `LoadShaders`.\n\n        private:\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\n\n            const char *char_vertex_shader;\n            const char *char_fragment_shader;\n    };\n\n    class Texture\n    {\n        public:\n            \/\/ constructor.\n            Texture(TextureStruct texture_struct);\n\n            \/\/ destructor.\n            ~Texture();\n\n            model::World *world_pointer;           \/\/ pointer to the world.\n            GLuint textureID;                      \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n\n        private:\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\n    };\n\n    class Graph\n    {\n        public:\n            \/\/ constructor.\n            Graph();\n\n            \/\/ destructor.\n            ~Graph();\n\n            \/\/ this method sets a node pointer.\n            void set_pointer(GLuint nodeID, void* node_pointer);\n\n            \/\/ this method gets a node pointer.\n            void* get_pointer(GLuint nodeID);\n\n            \/\/ this method gets a node ID and removes it from the `free_nodeID_queue` if it was popped from the queue.\n            GLuint get_nodeID();\n\n        private:\n            std::vector<void*> node_pointer_vector;\n            std::queue<GLuint> free_nodeID_queue;\n    };\n\n    \/\/ `Node` is not a subclass of `Graph` because if the graph splits, node may be transferred to an another graph.\n    \/\/ Transferring a node to a new graph naturally requires appropriate reindexing of `nodeID`s.\n    \/\/ The graph in which a node belongs is accessible through `void* graph_pointer` (must be cast to `model::Graph*`).\n    class Node\n    {\n        public:\n            \/\/ constructor.\n            Node(NodeStruct node_struct);\n\n            \/\/ destructor.\n            ~Node();\n\n            \/\/ this method creates a bidirectional link.\n            \/\/ creating of bidirectional links is not possible before all nodes are created.\n            void create_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes a bidirectional link.\n            \/\/ deleting of links is not possible before all nodes are created.\n            void delete_bidirectional_link(GLuint nodeID);\n\n            \/\/ this method transfers this node to a new graph.\n            \/\/ links will not be changed.\n            \/\/ all nodes that are to be transferred must be transferred separately.\n            \/\/ before transfering any node to a new graph,\n            \/\/ all links to nodes that do not belong to the new graph of this node must be deleted with separate `delete_bidirectional_link` calls.\n            void transfer_to_new_graph(model::Graph *new_graph_pointer);\n\n            GLuint nodeID;\n            model::Graph *graph_pointer;\n\n            \/\/ nodes do not keep pointers to neighbor nodes, because all pointer values are not known yet before all nodes are created.\n            std::vector<GLuint> neighbor_nodeIDs;\n\n        private:\n            \/\/ this method creates an unidirectional link.\n            \/\/ in the constructor only unidirectional links can be created.\n            void create_unidirectional_link(GLuint nodeID);\n\n            \/\/ this method deletes an unidirectional link.\n            void delete_unidirectional_link(GLuint nodeID);\n\n            glm::vec3 coordinate_vector;\n    };\n\n    class Species\n    {\n        public:\n            \/\/ constructor.\n            Species(SpeciesStruct species_struct);\n\n            \/\/ destructor.\n            ~Species();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a object pointer.\n            void set_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_pointer(GLuint objectID);\n\n            \/\/ this method gets a object ID and removes it from the `free_objectID_queue` if it was popped from the queue.\n            GLuint get_objectID();\n\n            \/\/ this method sets pointer to this species to NULL, sets `shader_pointer` according to the input, and requests a new `speciesID` from the new shader.\n            void switch_to_new_shader(model::Shader *new_shader_pointer);\n\n            std::string color_channel;               \/\/ color channel in use: `\"red\"`, `\"green\"`, `\"blue\"`, `\"mean\"` or `\"all\"`.\n            std::vector<ObjectStruct> object_vector; \/\/ vector of individual objects of this species.\n            glm::vec3 lightPos;                      \/\/ light position.\n\n            void *vertex_UV_pointer;                 \/\/ pointer to the vertex & UV species (not yet in use!).\n            void *texture_pointer;                   \/\/ pointer to the texture species (not yet in use!).\n\n            \/\/ The rest fields are created in the constructor.\n            GLuint MatrixID;\n            GLuint ViewMatrixID;\n            GLuint ModelMatrixID;\n            GLuint vertexPosition_modelspaceID;\n            GLuint vertexUVID;\n            GLuint vertexNormal_modelspaceID;\n\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object.\n\n            std::vector<GLuint> indices;           \/\/ the deleted vertices will be reused (though it is not required, if there's enough memory).\n            std::vector<glm::vec3> indexed_vertices;\n            std::vector<glm::vec2> indexed_UVs;\n            std::vector<glm::vec3> indexed_normals;\n\n            GLuint vertexbuffer;\n            GLuint uvbuffer;\n            GLuint normalbuffer;\n            GLuint elementbuffer;\n\n            glm::mat4 ProjectionMatrix;\n            glm::mat4 ViewMatrix;\n        private:\n            model::Shader *shader_pointer;         \/\/ pointer to the shader.\n\n            std::string model_file_format;         \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string model_filename;            \/\/ filename of the model file.\n            std::string texture_file_format;       \/\/ type of the model file, eg. `\"bmp\"`.\n            std::string texture_filename;          \/\/ filename of the model file.\n            GLuint speciesID_from_shader;          \/\/ species ID, returned by `model::Shader->get_speciesID()`.\n            GLuint speciesID_from_texture;         \/\/ species ID, returned by `model::Texture->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            GLuint texture;                        \/\/ Texture, returned by `load_DDS_texture` or `load_BMP_texture`.\n            GLuint textureID;                      \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n            const char *char_model_file_format;\n            const char *char_model_filename;\n            const char *char_texture_file_format;\n            const char *char_texture_filename;\n            const char *char_color_channel;\n\n            std::vector<void*> object_pointer_vector;\n            std::queue<GLuint> free_objectID_queue;\n    };\n\n    class Object\n    {\n        public:\n            \/\/ constructor.\n            Object(ObjectStruct object_struct);\n\n            \/\/ destructor.\n            ~Object();\n\n            \/\/ this method renders this object.\n            void render();\n\n            \/\/ this method sets pointer to this object to NULL, sets `species_pointer` according to the input, and requests a new `objectID` from the new species.\n            void switch_to_new_species(model::Species *new_species_pointer);\n\n            model::Species *species_pointer;       \/\/ pointer to the species.\n\n            GLuint objectID;                      \/\/ object ID, returned by `model::Species->get_objectID()`.\n\n            bool has_entered;\n            glm::vec3 coordinate_vector;           \/\/ rotate vector.\n            GLfloat rotate_angle;                  \/\/ rotate angle.\n            glm::vec3 rotate_vector;               \/\/ rotate vector.\n            glm::vec3 translate_vector;            \/\/ translate vector.\n\n            \/\/ The rest fields are created in the constructor.\n            glm::mat4 model_matrix;                \/\/ model matrix.\n            std::vector<glm::vec3> vertices;       \/\/ vertices of the object.\n            std::vector<glm::vec2> UVs;            \/\/ UVs of the object.\n            std::vector<glm::vec3> normals;        \/\/ normals of the object. not used at the moment.\n\n            glm::mat4 MVP_matrix;                  \/\/ model view projection matrix.\n    };\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************************\n *                                                                                       *\n * OpenSpace                                                                             *\n *                                                                                       *\n * Copyright (c) 2014-2022                                                               *\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#include \"include\/webbrowserapp.h\"\n\nnamespace openspace {\n\nCefRefPtr<CefRenderProcessHandler> WebBrowserApp::GetRenderProcessHandler() {\n    return this;\n}\n\nvoid WebBrowserApp::OnContextCreated(CefRefPtr<CefBrowser>, CefRefPtr<CefFrame>,\n                                     CefRefPtr<CefV8Context>)\n{\n\/\/    CEF_REQUIRE_UI_THREAD();\n\/\/    CefRefPtr<CefV8Value> val = CefV8Value::CreateBool(true);\n\/\/    CefRefPtr<CefV8Value> global = context->GetGlobal();\n\/\/    global->SetValue(\"IsWithinCEF\", val, V8_PROPERTY_ATTRIBUTE_NONE);\n}\n\nvoid WebBrowserApp::OnBeforeCommandLineProcessing(const CefString&,\n                                                  CefRefPtr<CefCommandLine> commandLine)\n{\n    commandLine->AppendSwitch(\"--enable-gpu-rasterization\");\n    commandLine->AppendSwitch(\"--use-gl=desktop\");\n    commandLine->AppendSwitch(\"--enable-webgl2-compute-context\");\n    commandLine->AppendSwitch(\"ignore-gpu-blocklist\");\n    commandLine->AppendSwitch(\"log-gpu-control-list-decisions\");\n    commandLine->AppendSwitch(\"use-mock-keychain\");\n    commandLine->AppendSwitch(\"enable-begin-frame-scheduling\");\n    commandLine->AppendSwitchWithValue(\"autoplay-policy\", \"no-user-gesture-required\");\n}\n\n} \/\/ namespace openspace\n<commit_msg>Remove --ignore-gpu-blocklist CEF flag<commit_after>\/*****************************************************************************************\n *                                                                                       *\n * OpenSpace                                                                             *\n *                                                                                       *\n * Copyright (c) 2014-2022                                                               *\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#include \"include\/webbrowserapp.h\"\n\nnamespace openspace {\n\nCefRefPtr<CefRenderProcessHandler> WebBrowserApp::GetRenderProcessHandler() {\n    return this;\n}\n\nvoid WebBrowserApp::OnContextCreated(CefRefPtr<CefBrowser>, CefRefPtr<CefFrame>,\n                                     CefRefPtr<CefV8Context>)\n{\n\/\/    CEF_REQUIRE_UI_THREAD();\n\/\/    CefRefPtr<CefV8Value> val = CefV8Value::CreateBool(true);\n\/\/    CefRefPtr<CefV8Value> global = context->GetGlobal();\n\/\/    global->SetValue(\"IsWithinCEF\", val, V8_PROPERTY_ATTRIBUTE_NONE);\n}\n\nvoid WebBrowserApp::OnBeforeCommandLineProcessing(const CefString&,\n                                                  CefRefPtr<CefCommandLine> commandLine)\n{\n    commandLine->AppendSwitch(\"--enable-gpu-rasterization\");\n    commandLine->AppendSwitch(\"--use-gl=desktop\");\n    commandLine->AppendSwitch(\"--enable-webgl2-compute-context\");\n    commandLine->AppendSwitch(\"log-gpu-control-list-decisions\");\n    commandLine->AppendSwitch(\"use-mock-keychain\");\n    commandLine->AppendSwitch(\"enable-begin-frame-scheduling\");\n    commandLine->AppendSwitchWithValue(\"autoplay-policy\", \"no-user-gesture-required\");\n}\n\n} \/\/ namespace openspace\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"pcmoutput.h\"\n\n#include <kaboutdata.h>\n#include <kcmdlineargs.h>\n#include <kapplication.h>\n#include <QByteArray>\n#include <QDataStream>\n#include <QSlider>\n#include <QHBoxLayout>\n#include <phonon\/audiooutput.h>\n#include <phonon\/audiopath.h>\n#include <phonon\/bytestream.h>\n#include <QTimer>\n#include <QFile>\n#include <QLabel>\n\nstatic const int SAMPLE_RATE = 48000;\n\nPcmPlayer::PcmPlayer( QWidget *parent )\n\t: QWidget( parent ),\n\tm_frequency( 440 )\n{\n\tPhonon::AudioOutput* m_output = new Phonon::AudioOutput( Phonon::MusicCategory, this );\n\tPhonon::AudioPath* m_path = new Phonon::AudioPath( this );\n\tm_path->addOutput( m_output );\n\tm_stream = new Phonon::ByteStream( this );\n\tm_stream->addAudioPath( m_path );\n\tm_stream->setStreamSeekable( false );\n\tm_stream->setStreamSize( 0x7FFFFFFF );\n\n\tQTimer* m_timer = new QTimer( this );\n\tm_timer->setInterval( 0 );\n\tconnect( m_timer, SIGNAL( timeout() ), SLOT( sendData() ) );\n\n\tconnect( m_stream, SIGNAL( needData() ), m_timer, SLOT( start() ) );\n\tconnect( m_stream, SIGNAL( enoughData() ), m_timer, SLOT( stop() ) );\n\n\tm_stream->writeData( wavHeader() );\n\n\tsetLayout( new QHBoxLayout );\n\tQSlider* slider = new QSlider( this );\n\tlayout()->addWidget( slider );\n\tslider->setRange( 200, 4000 );\n\tslider->setValue( m_frequency );\n\tconnect( slider, SIGNAL( valueChanged( int ) ), SLOT( setFrequency( int ) ) );\n\n\tQTimer::singleShot( 0, m_timer, SLOT( start() ) );\n\tQTimer::singleShot( 0, m_stream, SLOT( play() ) );\n\n\tm_fLabel = new QLabel( this );\n\tlayout()->addWidget( m_fLabel );\n\tm_fLabel->setText( QString::number( m_frequency ) );\n}\n\nvoid PcmPlayer::setFrequency( int f )\n{\n\tm_frequency = f;\n\tm_fLabel->setText( QString::number( m_frequency ) );\n}\n\nvoid PcmPlayer::sendData()\n{\n\tm_stream->writeData( pcmBlock( m_frequency ) );\n}\n\nQByteArray PcmPlayer::wavHeader() const\n{\n\tQByteArray data;\n\tQDataStream stream( &data, QIODevice::WriteOnly );\n\tstream.setByteOrder( QDataStream::LittleEndian );\n\tstream\n\t\t<< 0x46464952 \/\/\"RIFF\"\n\t\t<< static_cast<quint32>( 0x7FFFFFFF )\n\t\t<< 0x45564157 \/\/\"WAVE\"\n\t\t<< 0x20746D66 \/\/\"fmt \"           \/\/Subchunk1ID\n\t\t<< static_cast<quint32>( 16 )    \/\/Subchunk1Size\n\t\t<< static_cast<quint16>( 1 )     \/\/AudioFormat\n\t\t<< static_cast<quint16>( 2 )     \/\/NumChannels\n\t\t<< static_cast<quint32>( SAMPLE_RATE ) \/\/SampleRate\n\t\t<< static_cast<quint32>( 2*2*SAMPLE_RATE )\/\/ByteRate\n\t\t<< static_cast<quint16>( 2*2 )   \/\/BlockAlign\n\t\t<< static_cast<quint16>( 16 )    \/\/BitsPerSample\n\t\t<< 0x61746164 \/\/\"data\"                   \/\/Subchunk2ID\n\t\t<< static_cast<quint32>( 0x7FFFFFFF-36 )\/\/Subchunk2Size\n\t\t;\n\treturn data;\n}\n\nQByteArray PcmPlayer::pcmBlock( int freq ) const\n{\n\tQByteArray data;\n\tQDataStream stream( &data, QIODevice::WriteOnly );\n\tstream.setByteOrder( QDataStream::LittleEndian );\n\n\tconst int samplesPerHalfWave = SAMPLE_RATE \/ ( 2*freq );\n\tconst int sampleDiff = ( 1 << 16 ) \/ samplesPerHalfWave;\n\tconst int samplesPerQuarterWave = samplesPerHalfWave \/ 2;\n\n\tfor( int i = 0; i < samplesPerQuarterWave; ++i )\n\t\tstream << static_cast<quint16>( i * sampleDiff )\n\t\t\t<< static_cast<quint16>( -i * sampleDiff );\n\tfor( int i = 0; i < samplesPerHalfWave; ++i )\n\t\tstream << static_cast<quint16>( 32767 - i * sampleDiff )\n\t\t\t<< static_cast<quint16>( -32768 + i * sampleDiff );\n\tfor( int i = 0; i < samplesPerQuarterWave; ++i )\n\t\tstream << static_cast<quint16>( -32768 + i * sampleDiff )\n\t\t\t<< static_cast<quint16>( 32767 - i * sampleDiff );\n\n\treturn data;\n}\n\nint main( int argc, char** argv )\n{\n\tKAboutData about( \"videoplayandforget\", \"Phonon VideoPlayer Example\",\n\t\t\t\"1.0\", \"\",\n\t\t\tKAboutData::License_LGPL, 0 );\n\tabout.addAuthor( \"Matthias Kretz\", 0, \"kretz@kde.org\" );\n\tKCmdLineArgs::init( argc, argv, &about );\n\tKApplication app;\n\tPcmPlayer player;\n\tplayer.show();\n\tapp.exec();\n}\n\n#include \"pcmoutput.moc\"\n<commit_msg>SVN_SILENT: add LGPL<commit_after>\/*  This file is part of the KDE project\n    Copyright (C) 2006 Matthias Kretz <kretz@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 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., 51 Franklin Street, Fifth Floor,\n    Boston, MA 02110-1301, USA.\n\n*\/\n\n\n#include \"pcmoutput.h\"\n\n#include <kaboutdata.h>\n#include <kcmdlineargs.h>\n#include <kapplication.h>\n#include <QByteArray>\n#include <QDataStream>\n#include <QSlider>\n#include <QHBoxLayout>\n#include <phonon\/audiooutput.h>\n#include <phonon\/audiopath.h>\n#include <phonon\/bytestream.h>\n#include <QTimer>\n#include <QFile>\n#include <QLabel>\n\nstatic const int SAMPLE_RATE = 48000;\n\nPcmPlayer::PcmPlayer( QWidget *parent )\n\t: QWidget( parent ),\n\tm_frequency( 440 )\n{\n\tPhonon::AudioOutput* m_output = new Phonon::AudioOutput( Phonon::MusicCategory, this );\n\tPhonon::AudioPath* m_path = new Phonon::AudioPath( this );\n\tm_path->addOutput( m_output );\n\tm_stream = new Phonon::ByteStream( this );\n\tm_stream->addAudioPath( m_path );\n\tm_stream->setStreamSeekable( false );\n\tm_stream->setStreamSize( 0x7FFFFFFF );\n\n\tQTimer* m_timer = new QTimer( this );\n\tm_timer->setInterval( 0 );\n\tconnect( m_timer, SIGNAL( timeout() ), SLOT( sendData() ) );\n\n\tconnect( m_stream, SIGNAL( needData() ), m_timer, SLOT( start() ) );\n\tconnect( m_stream, SIGNAL( enoughData() ), m_timer, SLOT( stop() ) );\n\n\tm_stream->writeData( wavHeader() );\n\n\tsetLayout( new QHBoxLayout );\n\tQSlider* slider = new QSlider( this );\n\tlayout()->addWidget( slider );\n\tslider->setRange( 200, 4000 );\n\tslider->setValue( m_frequency );\n\tconnect( slider, SIGNAL( valueChanged( int ) ), SLOT( setFrequency( int ) ) );\n\n\tQTimer::singleShot( 0, m_timer, SLOT( start() ) );\n\tQTimer::singleShot( 0, m_stream, SLOT( play() ) );\n\n\tm_fLabel = new QLabel( this );\n\tlayout()->addWidget( m_fLabel );\n\tm_fLabel->setText( QString::number( m_frequency ) );\n}\n\nvoid PcmPlayer::setFrequency( int f )\n{\n\tm_frequency = f;\n\tm_fLabel->setText( QString::number( m_frequency ) );\n}\n\nvoid PcmPlayer::sendData()\n{\n\tm_stream->writeData( pcmBlock( m_frequency ) );\n}\n\nQByteArray PcmPlayer::wavHeader() const\n{\n\tQByteArray data;\n\tQDataStream stream( &data, QIODevice::WriteOnly );\n\tstream.setByteOrder( QDataStream::LittleEndian );\n\tstream\n\t\t<< 0x46464952 \/\/\"RIFF\"\n\t\t<< static_cast<quint32>( 0x7FFFFFFF )\n\t\t<< 0x45564157 \/\/\"WAVE\"\n\t\t<< 0x20746D66 \/\/\"fmt \"           \/\/Subchunk1ID\n\t\t<< static_cast<quint32>( 16 )    \/\/Subchunk1Size\n\t\t<< static_cast<quint16>( 1 )     \/\/AudioFormat\n\t\t<< static_cast<quint16>( 2 )     \/\/NumChannels\n\t\t<< static_cast<quint32>( SAMPLE_RATE ) \/\/SampleRate\n\t\t<< static_cast<quint32>( 2*2*SAMPLE_RATE )\/\/ByteRate\n\t\t<< static_cast<quint16>( 2*2 )   \/\/BlockAlign\n\t\t<< static_cast<quint16>( 16 )    \/\/BitsPerSample\n\t\t<< 0x61746164 \/\/\"data\"                   \/\/Subchunk2ID\n\t\t<< static_cast<quint32>( 0x7FFFFFFF-36 )\/\/Subchunk2Size\n\t\t;\n\treturn data;\n}\n\nQByteArray PcmPlayer::pcmBlock( int freq ) const\n{\n\tQByteArray data;\n\tQDataStream stream( &data, QIODevice::WriteOnly );\n\tstream.setByteOrder( QDataStream::LittleEndian );\n\n\tconst int samplesPerHalfWave = SAMPLE_RATE \/ ( 2*freq );\n\tconst int sampleDiff = ( 1 << 16 ) \/ samplesPerHalfWave;\n\tconst int samplesPerQuarterWave = samplesPerHalfWave \/ 2;\n\n\tfor( int i = 0; i < samplesPerQuarterWave; ++i )\n\t\tstream << static_cast<quint16>( i * sampleDiff )\n\t\t\t<< static_cast<quint16>( -i * sampleDiff );\n\tfor( int i = 0; i < samplesPerHalfWave; ++i )\n\t\tstream << static_cast<quint16>( 32767 - i * sampleDiff )\n\t\t\t<< static_cast<quint16>( -32768 + i * sampleDiff );\n\tfor( int i = 0; i < samplesPerQuarterWave; ++i )\n\t\tstream << static_cast<quint16>( -32768 + i * sampleDiff )\n\t\t\t<< static_cast<quint16>( 32767 - i * sampleDiff );\n\n\treturn data;\n}\n\nint main( int argc, char** argv )\n{\n\tKAboutData about( \"videoplayandforget\", \"Phonon VideoPlayer Example\",\n\t\t\t\"1.0\", \"\",\n\t\t\tKAboutData::License_LGPL, 0 );\n\tabout.addAuthor( \"Matthias Kretz\", 0, \"kretz@kde.org\" );\n\tKCmdLineArgs::init( argc, argv, &about );\n\tKApplication app;\n\tPcmPlayer player;\n\tplayer.show();\n\tapp.exec();\n}\n\n#include \"pcmoutput.moc\"\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#ifndef _ABACLADE_HXX_INTERNAL\n   #error \"Please #include <abaclade.hxx> instead of this file\"\n#endif\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc globals – compatibility layer for features that are available one way or another in all\n\/\/ supported compilers\n\n\/*! If defined, the compiler supports #pragma once, which tells the preprocessor not to parse a\n(header) file more than once, speeding up compilation. *\/\n#if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC || ABC_HOST_CXX_MSC\n   #define ABC_CXX_PRAGMA_ONCE\n#endif\n\n\/*! Range-based for statement: for (for-range-declaration : expression) { … } .\n\nrangedecl\n   Declaration of the variable that will hold the values iterated over from the range; most commonly\n   this is auto & or auto const &.\nexpr\n   Expression of a type for which std::begin() and std::end() are defined.\n*\/\n#if (ABC_HOST_CXX_CLANG && __has_feature(cxx_range_for)) || ABC_HOST_CXX_GCC || \\\n      ABC_HOST_CXX_MSC >= 1700\n   #define ABC_FOR_EACH(rangedecl, expr) \\\n      for (rangedecl : expr)\n#elif ABC_HOST_CXX_MSC\n   \/* MSC16 has a pre-C++11 syntax that expects to assign expr to a non-const l-value reference; if\n   expr is an r-value, an MSC non-standard extension allows to reference expr from the non-const\n   l-value reference, raising warning C4239; here we suppress this possible warning. *\/\n   #define ABC_FOR_EACH(rangedecl, expr) \\\n      __pragma(warning(suppress: 4239)) \\\n      for each (rangedecl in expr)\n#endif\n\n\/*! Declares a function as never returning (e.g. by causing the process to terminate, or by throwing\nan exception). This allows optimizations based on the fact that code following its call cannot be\nreached. *\/\n#if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC\n   #define ABC_FUNC_NORETURN \\\n      __attribute__((noreturn))\n#elif ABC_HOST_CXX_MSC\n   #define ABC_FUNC_NORETURN \\\n      __declspec(noreturn)\n#else\n   #define ABC_FUNC_NORETURN\n#endif\n\n#if (ABC_HOST_CXX_CLANG && __has_feature(cxx_override_control)) || ABC_HOST_CXX_GCC >= 0x40700 || \\\n      ABC_HOST_CXX_MSC >= 1800\n   \/\/ Good, no need for fixes.\n#elif ABC_HOST_CXX_MSC\n   \/\/ MSC16 thinks that override is a non-standard extension, so we need to tell it otherwise.\n   #define override \\\n      __pragma(warning(suppress: 4481)) override\n#else\n   \/\/ For everybody else, just disable override control.\n   #define override\n#endif\n\n\/*! Declares a function as using the same calling convention as the host C library\/STL\nimplementation. *\/\n#if ABC_HOST_API_WIN32 && !ABC_HOST_API_WIN64\n   #define ABC_STL_CALLCONV __cdecl\n#else\n   #define ABC_STL_CALLCONV\n#endif\n\n\/*! Declares a function\/method as throwing exceptions depending on a (template-dependent) condition.\nSupports both C++11 noexcept specifier and pre-C++11 throw() exception specifications.\n\n@param old_throw_decl\n   Parentheses-enclosed list of types the function\/method may throw.\n*\/\n#ifdef ABC_CXX_STL_USES_NOEXCEPT\n   #define ABC_STL_NOEXCEPT_IF(cond, old_throw_decl) \\\n      noexcept(cond)\n#else\n   #define ABC_STL_NOEXCEPT_IF(cond, old_throw_decl) \\\n      throw old_throw_decl\n#endif\n\n\/*! Declares a function\/method as possibly throwing exceptions. Supports both C++11 noexcept\nspecifier and pre-C++11 throw() exception specifications.\n\n@param old_throw_decl\n   Parentheses-enclosed list of types the function\/method may throw.\n*\/\n#ifdef ABC_CXX_STL_USES_NOEXCEPT\n   #define ABC_STL_NOEXCEPT_FALSE(old_throw_decl) \\\n      noexcept(false)\n#else\n   #define ABC_STL_NOEXCEPT_FALSE(old_throw_decl) \\\n      throw old_throw_decl\n#endif\n\n\/*! Declares a function\/method as never throwing exceptions. Supports both C++11 noexcept specifier\nand pre-C++11 throw() exception specifications. *\/\n#ifdef ABC_CXX_STL_USES_NOEXCEPT\n   #define ABC_STL_NOEXCEPT_TRUE() \\\n      noexcept(true)\n#else\n   #define ABC_STL_NOEXCEPT_TRUE() \\\n      throw()\n#endif\n\n\/\/! Declares a symbol to be publicly visible (exported) in the shared library being built.\n#if ABC_HOST_API_WIN32\n   #if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_MSC\n      \/\/ TODO: needs testing; Clang claims to need -fms-extensions to enable dllexport.\n      #define ABC_SYM_EXPORT \\\n         __declspec(dllexport)\n   #elif ABC_HOST_CXX_GCC\n      #define ABC_SYM_EXPORT \\\n         __attribute__((dllexport))\n   #endif\n#else\n   #if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC\n      #define ABC_SYM_EXPORT \\\n         __attribute__((visibility(\"default\")))\n   #endif\n#endif\n\n\/\/! Declares a symbol to be imported from a shared library.\n#if ABC_HOST_API_WIN32\n   #if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_MSC\n      \/\/ TODO: needs testing; Clang claims to need -fms-extensions to enable dllimport.\n      #define ABC_SYM_IMPORT \\\n         __declspec(dllimport)\n   #elif ABC_HOST_CXX_GCC\n      #define ABC_SYM_IMPORT \\\n         __attribute__((dllimport))\n   #endif\n#else\n   #if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC\n      #define ABC_SYM_IMPORT \\\n         __attribute__((visibility(\"default\")))\n   #endif\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>Add ABC_SWITCH_WITHOUT_DEFAULT<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#ifndef _ABACLADE_HXX_INTERNAL\n   #error \"Please #include <abaclade.hxx> instead of this file\"\n#endif\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc globals – compatibility layer for features that are available one way or another in all\n\/\/ supported compilers\n\n\/*! If defined, the compiler supports #pragma once, which tells the preprocessor not to parse a\n(header) file more than once, speeding up compilation. *\/\n#if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC || ABC_HOST_CXX_MSC\n   #define ABC_CXX_PRAGMA_ONCE\n#endif\n\n\/*! Range-based for statement: for (for-range-declaration : expression) { … } .\n\nrangedecl\n   Declaration of the variable that will hold the values iterated over from the range; most commonly\n   this is auto & or auto const &.\nexpr\n   Expression of a type for which std::begin() and std::end() are defined.\n*\/\n#if (ABC_HOST_CXX_CLANG && __has_feature(cxx_range_for)) || ABC_HOST_CXX_GCC || \\\n      ABC_HOST_CXX_MSC >= 1700\n   #define ABC_FOR_EACH(rangedecl, expr) \\\n      for (rangedecl : expr)\n#elif ABC_HOST_CXX_MSC\n   \/* MSC16 has a pre-C++11 syntax that expects to assign expr to a non-const l-value reference; if\n   expr is an r-value, an MSC non-standard extension allows to reference expr from the non-const\n   l-value reference, raising warning C4239; here we suppress this possible warning. *\/\n   #define ABC_FOR_EACH(rangedecl, expr) \\\n      __pragma(warning(suppress: 4239)) \\\n      for each (rangedecl in expr)\n#endif\n\n\/*! Declares a function as never returning (e.g. by causing the process to terminate, or by throwing\nan exception). This allows optimizations based on the fact that code following its call cannot be\nreached. *\/\n#if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC\n   #define ABC_FUNC_NORETURN \\\n      __attribute__((noreturn))\n#elif ABC_HOST_CXX_MSC\n   #define ABC_FUNC_NORETURN \\\n      __declspec(noreturn)\n#else\n   #define ABC_FUNC_NORETURN\n#endif\n\n#if (ABC_HOST_CXX_CLANG && __has_feature(cxx_override_control)) || ABC_HOST_CXX_GCC >= 0x40700 || \\\n      ABC_HOST_CXX_MSC >= 1800\n   \/\/ Good, no need for fixes.\n#elif ABC_HOST_CXX_MSC\n   \/\/ MSC16 thinks that override is a non-standard extension, so we need to tell it otherwise.\n   #define override \\\n      __pragma(warning(suppress: 4481)) override\n#else\n   \/\/ For everybody else, just disable override control.\n   #define override\n#endif\n\n\/*! Declares a function as using the same calling convention as the host C library\/STL\nimplementation. *\/\n#if ABC_HOST_API_WIN32 && !ABC_HOST_API_WIN64\n   #define ABC_STL_CALLCONV __cdecl\n#else\n   #define ABC_STL_CALLCONV\n#endif\n\n\/*! Declares a function\/method as throwing exceptions depending on a (template-dependent) condition.\nSupports both C++11 noexcept specifier and pre-C++11 throw() exception specifications.\n\n@param old_throw_decl\n   Parentheses-enclosed list of types the function\/method may throw.\n*\/\n#ifdef ABC_CXX_STL_USES_NOEXCEPT\n   #define ABC_STL_NOEXCEPT_IF(cond, old_throw_decl) \\\n      noexcept(cond)\n#else\n   #define ABC_STL_NOEXCEPT_IF(cond, old_throw_decl) \\\n      throw old_throw_decl\n#endif\n\n\/*! Declares a function\/method as possibly throwing exceptions. Supports both C++11 noexcept\nspecifier and pre-C++11 throw() exception specifications.\n\n@param old_throw_decl\n   Parentheses-enclosed list of types the function\/method may throw.\n*\/\n#ifdef ABC_CXX_STL_USES_NOEXCEPT\n   #define ABC_STL_NOEXCEPT_FALSE(old_throw_decl) \\\n      noexcept(false)\n#else\n   #define ABC_STL_NOEXCEPT_FALSE(old_throw_decl) \\\n      throw old_throw_decl\n#endif\n\n\/*! Declares a function\/method as never throwing exceptions. Supports both C++11 noexcept specifier\nand pre-C++11 throw() exception specifications. *\/\n#ifdef ABC_CXX_STL_USES_NOEXCEPT\n   #define ABC_STL_NOEXCEPT_TRUE() \\\n      noexcept(true)\n#else\n   #define ABC_STL_NOEXCEPT_TRUE() \\\n      throw()\n#endif\n\n\/*! Declares a function as never returning (e.g. by causing the process to terminate, or by throwing\nan exception). This allows optimizations based on the fact that code following its call cannot be\nreached. *\/\n#if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC\n   #define ABC_SWITCH_WITHOUT_DEFAULT \\\n      default: \\\n         __builtin_unreachable();\n#elif ABC_HOST_CXX_MSC\n   #define ABC_SWITCH_WITHOUT_DEFAULT \\\n      default: \\\n         __assume(0);\n#else\n   #define ABC_FUNC_NORETURN\n#endif\n\n\/\/! Declares a symbol to be publicly visible (exported) in the shared library being built.\n#if ABC_HOST_API_WIN32\n   #if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_MSC\n      \/\/ TODO: needs testing; Clang claims to need -fms-extensions to enable dllexport.\n      #define ABC_SYM_EXPORT \\\n         __declspec(dllexport)\n   #elif ABC_HOST_CXX_GCC\n      #define ABC_SYM_EXPORT \\\n         __attribute__((dllexport))\n   #endif\n#else\n   #if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC\n      #define ABC_SYM_EXPORT \\\n         __attribute__((visibility(\"default\")))\n   #endif\n#endif\n\n\/\/! Declares a symbol to be imported from a shared library.\n#if ABC_HOST_API_WIN32\n   #if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_MSC\n      \/\/ TODO: needs testing; Clang claims to need -fms-extensions to enable dllimport.\n      #define ABC_SYM_IMPORT \\\n         __declspec(dllimport)\n   #elif ABC_HOST_CXX_GCC\n      #define ABC_SYM_IMPORT \\\n         __attribute__((dllimport))\n   #endif\n#else\n   #if ABC_HOST_CXX_CLANG || ABC_HOST_CXX_GCC\n      #define ABC_SYM_IMPORT \\\n         __attribute__((visibility(\"default\")))\n   #endif\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/  (C) Copyright Gennadiy Rozental 2005-2014.\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 : Runtime.Param library configuration\n\/\/ ***************************************************************************\n\n#ifndef BOOST_RT_CONFIG_HPP_062604GER\n#define BOOST_RT_CONFIG_HPP_062604GER\n\n\/\/ Boost\n#include <boost\/config.hpp>\n#ifdef BOOST_MSVC\n# pragma warning(disable: 4511) \/\/ copy constructor could not be generated\n# pragma warning(disable: 4512) \/\/ assignment operator could not be generated\n# pragma warning(disable: 4181) \/\/ qualifier applied to reference type; ignored\n# pragma warning(disable: 4675) \/\/ resolved overload was found by argument-dependent lookup\n#endif\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/config.hpp>\n#include <boost\/test\/utils\/basic_cstring\/basic_cstring.hpp>\n#include <boost\/test\/utils\/wrap_stringstream.hpp>\n#include <boost\/test\/utils\/basic_cstring\/io.hpp> \/\/ operator<<(boost::runtime::cstring)\n\n\/\/ STL\n#include <string>\n#include <cstdlib>\n\n\/\/____________________________________________________________________________\/\/\n\n#ifndef BOOST_RT_PARAM_CUSTOM_STRING\n#  ifndef BOOST_RT_PARAM_WIDE_STRING\n#    define BOOST_RT_PARAM_NAMESPACE                            runtime\n#  else\n#    define BOOST_RT_PARAM_NAMESPACE                            wide_runtime\n#  endif\n#endif\n\n#ifdef __SUNPRO_CC\nextern int putenv(char*);\n#endif\n\nnamespace boost {\n\nnamespace BOOST_RT_PARAM_NAMESPACE {\n\n#ifndef BOOST_RT_PARAM_CUSTOM_STRING\n#  ifndef BOOST_RT_PARAM_WIDE_STRING\n\ntypedef char                                                    char_type;\ntypedef std::string                                             dstring;\ntypedef unit_test::const_string                                 cstring;\ntypedef unit_test::literal_string                               literal_cstring;\ntypedef wrap_stringstream                                       format_stream;\n\n#ifdef BOOST_CLASSIC_IOSTREAMS\ntypedef std::ostream                                            out_stream;\n#else\ntypedef std::basic_ostream<char_type>                           out_stream;\n#endif\n\n#ifdef BOOST_MSVC\n#pragma warning(push)\n#pragma warning(disable:4996) \/\/ putenv\n#endif\n\n#if defined(__MINGW32__)\nextern \"C\" int putenv( const char * );\n#endif\n\n#ifndef UNDER_CE\n#if defined(__COMO__) && 0\ninline void\nputenv_impl( cstring name, cstring value )\n{\n    using namespace std;\n    \/\/ !! this may actually fail. What should we do?\n    setenv( name.begin(), value.begin(), 1 );\n}\n#else\ninline void\nputenv_impl( cstring name, cstring value )\n{\n    format_stream fs;\n\n    fs << name << '=' << value;\n\n    \/\/ !! this may actually fail. What should we do?\n    \/\/ const_cast is used to satisfy putenv interface\n    using namespace std;\n    putenv( const_cast<char*>( fs.str().c_str() ) );\n}\n#endif\n#endif\n\n#ifdef BOOST_MSVC \n#pragma warning(pop) \n#endif \n\n#define BOOST_RT_PARAM_LITERAL( l ) l\n#define BOOST_RT_PARAM_CSTRING_LITERAL( l ) cstring( l, sizeof( l ) - 1 )\n#define BOOST_RT_PARAM_GETENV getenv\n#define BOOST_RT_PARAM_PUTENV ::boost::BOOST_RT_PARAM_NAMESPACE::putenv_impl\n#define BOOST_RT_PARAM_EXCEPTION_INHERIT_STD\n\n\/\/____________________________________________________________________________\/\/\n\n#  else\n\ntypedef wchar_t                                                 char_type;\ntypedef std::basic_string<char_type>                            dstring;\ntypedef unit_test::basic_cstring<wchar_t const>                 cstring;\ntypedef const unit_test::basic_cstring<wchar_t const>           literal_cstring;\ntypedef wrap_wstringstream                                      format_stream;\ntypedef std::wostream                                           out_stream;\n\n#ifndef UNDER_CE\ninline void\nputenv_impl( cstring name, cstring value )\n{\n    format_stream fs;\n\n    fs << name << '=' << value;\n\n    \/\/ !! this may actually fail. What should we do?\n    \/\/ const_cast is used to satisfy putenv interface\n    using namespace std;\n    wputenv( const_cast<wchar_t*>( fs.str().c_str() ) );\n}\n#endif\n\n#define BOOST_RT_PARAM_LITERAL( l ) L ## l\n#define BOOST_RT_PARAM_CSTRING_LITERAL( l ) cstring( L ## l, sizeof( L ## l )\/sizeof(wchar_t) - 1 )\n#define BOOST_RT_PARAM_GETENV wgetenv\n#define BOOST_RT_PARAM_PUTENV putenv_impl\n\n#  endif\n#endif\n\n#ifdef __GNUC__\n#define BOOST_RT_PARAM_UNNEEDED_VIRTUAL virtual\n#else\n#define BOOST_RT_PARAM_UNNEEDED_VIRTUAL\n#endif\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace BOOST_RT_PARAM_NAMESPACE\n\n} \/\/ namespace boost\n\n#endif \/\/ BOOST_RT_CONFIG_HPP_062604GER\n<commit_msg>Update config.hpp<commit_after>\/\/  (C) Copyright Gennadiy Rozental 2005-2014.\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 : Runtime.Param library configuration\n\/\/ ***************************************************************************\n\n#ifndef BOOST_RT_CONFIG_HPP_062604GER\n#define BOOST_RT_CONFIG_HPP_062604GER\n\n\/\/ Boost\n#include <boost\/config.hpp>\n#ifdef BOOST_MSVC\n# pragma warning(disable: 4511) \/\/ copy constructor could not be generated\n# pragma warning(disable: 4512) \/\/ assignment operator could not be generated\n# pragma warning(disable: 4181) \/\/ qualifier applied to reference type; ignored\n# pragma warning(disable: 4675) \/\/ resolved overload was found by argument-dependent lookup\n#endif\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/config.hpp>\n#include <boost\/test\/utils\/basic_cstring\/basic_cstring.hpp>\n#include <boost\/test\/utils\/wrap_stringstream.hpp>\n#include <boost\/test\/utils\/basic_cstring\/io.hpp> \/\/ operator<<(boost::runtime::cstring)\n\n\/\/ STL\n#include <string>\n#include <cstdlib>\n\n\/\/____________________________________________________________________________\/\/\n\n#ifndef BOOST_RT_PARAM_CUSTOM_STRING\n#  ifndef BOOST_RT_PARAM_WIDE_STRING\n#    define BOOST_RT_PARAM_NAMESPACE                            runtime\n#  else\n#    define BOOST_RT_PARAM_NAMESPACE                            wide_runtime\n#  endif\n#endif\n\n#include <stdlib.h>\n\nnamespace boost {\n\nnamespace BOOST_RT_PARAM_NAMESPACE {\n\n#ifndef BOOST_RT_PARAM_CUSTOM_STRING\n#  ifndef BOOST_RT_PARAM_WIDE_STRING\n\ntypedef char                                                    char_type;\ntypedef std::string                                             dstring;\ntypedef unit_test::const_string                                 cstring;\ntypedef unit_test::literal_string                               literal_cstring;\ntypedef wrap_stringstream                                       format_stream;\n\n#ifdef BOOST_CLASSIC_IOSTREAMS\ntypedef std::ostream                                            out_stream;\n#else\ntypedef std::basic_ostream<char_type>                           out_stream;\n#endif\n\n#ifdef BOOST_MSVC\n#pragma warning(push)\n#pragma warning(disable:4996) \/\/ putenv\n#endif\n\n#if defined(__MINGW32__)\nextern \"C\" int putenv( const char * );\n#endif\n\n#ifndef UNDER_CE\n#if defined(__COMO__) && 0\ninline void\nputenv_impl( cstring name, cstring value )\n{\n    using namespace std;\n    \/\/ !! this may actually fail. What should we do?\n    setenv( name.begin(), value.begin(), 1 );\n}\n#else\ninline void\nputenv_impl( cstring name, cstring value )\n{\n    format_stream fs;\n\n    fs << name << '=' << value;\n\n    \/\/ !! this may actually fail. What should we do?\n    \/\/ const_cast is used to satisfy putenv interface\n    using namespace std;\n    putenv( const_cast<char*>( fs.str().c_str() ) );\n}\n#endif\n#endif\n\n#ifdef BOOST_MSVC \n#pragma warning(pop) \n#endif \n\n#define BOOST_RT_PARAM_LITERAL( l ) l\n#define BOOST_RT_PARAM_CSTRING_LITERAL( l ) cstring( l, sizeof( l ) - 1 )\n#define BOOST_RT_PARAM_GETENV getenv\n#define BOOST_RT_PARAM_PUTENV ::boost::BOOST_RT_PARAM_NAMESPACE::putenv_impl\n#define BOOST_RT_PARAM_EXCEPTION_INHERIT_STD\n\n\/\/____________________________________________________________________________\/\/\n\n#  else\n\ntypedef wchar_t                                                 char_type;\ntypedef std::basic_string<char_type>                            dstring;\ntypedef unit_test::basic_cstring<wchar_t const>                 cstring;\ntypedef const unit_test::basic_cstring<wchar_t const>           literal_cstring;\ntypedef wrap_wstringstream                                      format_stream;\ntypedef std::wostream                                           out_stream;\n\n#ifndef UNDER_CE\ninline void\nputenv_impl( cstring name, cstring value )\n{\n    format_stream fs;\n\n    fs << name << '=' << value;\n\n    \/\/ !! this may actually fail. What should we do?\n    \/\/ const_cast is used to satisfy putenv interface\n    using namespace std;\n    wputenv( const_cast<wchar_t*>( fs.str().c_str() ) );\n}\n#endif\n\n#define BOOST_RT_PARAM_LITERAL( l ) L ## l\n#define BOOST_RT_PARAM_CSTRING_LITERAL( l ) cstring( L ## l, sizeof( L ## l )\/sizeof(wchar_t) - 1 )\n#define BOOST_RT_PARAM_GETENV wgetenv\n#define BOOST_RT_PARAM_PUTENV putenv_impl\n\n#  endif\n#endif\n\n#ifdef __GNUC__\n#define BOOST_RT_PARAM_UNNEEDED_VIRTUAL virtual\n#else\n#define BOOST_RT_PARAM_UNNEEDED_VIRTUAL\n#endif\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace BOOST_RT_PARAM_NAMESPACE\n\n} \/\/ namespace boost\n\n#endif \/\/ BOOST_RT_CONFIG_HPP_062604GER\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the CernVM File System.\n *\n * Tracer is a thread-safe tracing module.  It uses a ring buffer\n * and spawns a helper thread, that flushes the messages onto the disk\n * when necessary.  The output file is in csv format.  Usually tracing\n * a message is a lock-free process, which therefore should have minimal\n * overhead.\n *\n * This is _not_ supposed to be a debugging system.  It is optimized for\n * speed and does not try to gather any additional information (like\n * threadid, status of variables, etc.) and it's in no way \"intelligent\".\n * But -- most importantly -- if the thing crashes, all messages in the\n * ring buffer go to hell as well.\n *\n * Csv output is adapted from libcsv.\n *\n * \\todo Currently, if anything goes wrong, the whole thing breaks\n *       down on assertion.  This might be not desired behavior.\n *\/\n\n#include \"config.h\"\n#include \"tracer.h\"\n\n#include <pthread.h>\n#include <sys\/time.h>\n\n#include <cstdlib>\n#include <cstdio>\n#include <cassert>\n#include <cerrno>\n\n#include <string>\n\n#include \"util.h\"\n#include \"atomic.h\"\n\nusing namespace std;  \/\/ NOLINT\n\nnamespace tracer {\n\n\/**\n * Contents of a trace line.\n * \\todo memory alignment\n *\/\nstruct BufferEntry {\n  timeval time_stamp;  \/**< This is currently with milliseconds precision\n                            (using gettimeofday). *\/\n  int code;  \/*< arbitrary code, negative codes are reserved for internal\n                 use. *\/\n  PathString path;  \/**< The path that is subject to the trace *\/\n  std::string msg;\n};\n\nstruct FlushThreadStartData {\n  pthread_cond_t *sig_flush;\n  pthread_cond_t *sig_continue_trace;\n  BufferEntry *ring_buffer;\n  atomic_int32 *commit_buffer;\n  atomic_int32 *seq_no;\n  atomic_int32 *flushed;\n  atomic_int32 *terminate;\n  atomic_int32 *flush_immediately;\n  int size;\n  int threshold;\n  string filename;\n};\n\nbool active_ = false;\nstd::string filename_;\nint buffer_size_;\nint flush_threshold_;\natomic_int32 seq_no_;  \/**< Starts with 0 and gets incremented by each call to\n                        trace. Contains the first non-used sequence number. *\/\natomic_int32 flushed_;  \/**< Starts with 0 and gets incremented by the flush\n                         thread.  Points to the first non-flushed message.\n                         flushed <= seq_no holds. *\/\natomic_int32 terminate_flush_thread_;\natomic_int32 flush_immediately_;\nBufferEntry *ring_buffer_;\natomic_int32 *commit_buffer_;  \/**< Has the same size as the ring buffer.  If a\n                                message is actually copied to the ring buffer\n                                memory, the respective flag is set to 1.\n                                Flags are reset to 0 by the flush thread. *\/\npthread_t thread_flush_;\npthread_cond_t sig_flush_;\npthread_cond_t sig_continue_trace_;\npthread_mutex_t sig_continue_trace_mutex_;\n\n\n\/**\n * Returns a timestamp at now+ms.\n *\/\nstatic void GetTimespecRel(const int64_t ms, timespec *ts) {\n  timeval now;\n  gettimeofday(&now, NULL);\n  int64_t nsecs = now.tv_usec * 1000 + (ms % 1000)*1000*1000;\n  int carry = 0;\n  if (nsecs >= 1000*1000*1000) {\n    carry = 1;\n    nsecs -= 1000*1000*1000;\n  }\n  ts->tv_sec = now.tv_sec + ms\/1000 + carry;\n  ts->tv_nsec = nsecs;\n}\n\n\nstatic int WriteCsvFile(FILE *fp, const string &field) {\n  if (fp == NULL)\n    return 0;\n\n  int retval;\n\n  if ((retval = fputc('\"', fp)) != '\"')\n    return retval;\n\n  for (unsigned i = 0, l = field.length(); i < l; ++i) {\n    if (field[i] == '\"') {\n      if ((retval = fputc('\"', fp)) != '\"')\n        return retval;\n    }\n    if ((retval = fputc(field[i], fp)) != field[i])\n      return retval;\n  }\n\n  if ((retval = fputc('\"', fp)) != '\"')\n    return retval;\n\n  return 0;\n}\n\n\nstatic void *MainFlush(void *data) {\n  FlushThreadStartData *start_data =\n    reinterpret_cast<FlushThreadStartData *>(data);\n  pthread_mutex_t sig_flush_mutex;\n  int retval;\n  retval = pthread_mutex_init(&sig_flush_mutex, NULL);\n  assert(retval == 0 && \"Could not initialize mutex for flush signal\");\n  retval = pthread_mutex_lock(&sig_flush_mutex);\n  assert(retval == 0 && \"Could not lock mutex for flush signal\");\n  FILE *f = fopen(start_data->filename.c_str(), \"a\");\n  assert(f != NULL && \"Could not open trace file\");\n  struct timespec timeout;\n\n  do {\n    while ((atomic_read32(start_data->terminate) == 0) &&\n           (atomic_read32(start_data->flush_immediately) == 0) &&\n           (atomic_read32(start_data->seq_no) - atomic_read32(start_data->flushed)\n             <= start_data->threshold))\n    {\n      GetTimespecRel(2000, &timeout);\n      retval = pthread_cond_timedwait(start_data->sig_flush,\n                                      &sig_flush_mutex, &timeout);\n      assert(retval != EINVAL && \"Error while waiting on flush signal\");\n    }\n\n    int base = atomic_read32(start_data->flushed) % start_data->size;\n    int pos, i = 0;\n    while ((i <= start_data->threshold) &&\n           (atomic_read32(&start_data->commit_buffer[\n             pos = ((base + i) % start_data->size)]) == 1))\n    {\n      string tmp;\n      tmp = StringifyTimeval(start_data->ring_buffer[pos].time_stamp);\n      retval = WriteCsvFile(f, tmp);\n      retval |= fputc(',', f) - ',';\n      tmp = StringifyInt(start_data->ring_buffer[pos].code);\n      retval = WriteCsvFile(f, tmp);\n      retval |= fputc(',', f) - ',';\n      retval |= WriteCsvFile(f, start_data->ring_buffer[pos].path.ToString());\n      retval |= fputc(',', f) - ',';\n      retval |= WriteCsvFile(f, start_data->ring_buffer[pos].msg);\n      retval |= (fputc(13, f) - 13) | (fputc(10, f) - 10);\n      retval |= fflush(f);\n      assert(retval == 0 && \"Error while writing into trace file\");\n\n      atomic_dec32(&start_data->commit_buffer[pos]);\n      ++i;\n    }\n    atomic_xadd32(start_data->flushed, i);\n    atomic_cas32(start_data->flush_immediately, 1, 0);\n\n    retval = pthread_cond_broadcast(start_data->sig_continue_trace);\n    assert(retval == 0 && \"Could not signal trace threads\");\n  } while ((atomic_read32(start_data->terminate) == 0) ||\n           (atomic_read32(start_data->flushed) <\n             atomic_read32(start_data->seq_no)));\n\n  retval = fclose(f);\n  assert(retval == 0 && \"Could not gracefully close trace file\");\n  pthread_mutex_unlock(&sig_flush_mutex);\n  retval = pthread_mutex_destroy(&sig_flush_mutex);\n  assert(retval == 0 && \"Could not gracefully destroy mutex for flush signal\");\n  delete start_data;\n  return NULL;\n}\n\n\/**\n * Initialize module and spawns the helper thread for flushing.\n * @param[in] buffer_size The number of messages that are kept at maximum in the\n *            internal ring buffer.\n * @param[in] flush_threshold Threshold for the flushing thread.  Messages are\n *            flushed when more then t+1 messages are pending in the ring\n *            buffer. 0 <= flush_threshold < buffer_size must hold.\n * @param[in] filename File name of the trace log on the disk.  The file will\n *            be opened in 'a' mode, i.e. messages are appended.\n *\/\nvoid Init(const int buffer_size, const int flush_threshold,\n          const string &filename)\n{\n  active_ = true;\n  filename_ = filename;\n  buffer_size_ = buffer_size;\n  flush_threshold_ = flush_threshold;\n  assert(buffer_size_ > 1 && \"Invalid size\");\n  assert(0 <= flush_threshold_ && flush_threshold_ < buffer_size_ &&\n         \"Invalid threshold\");\n\n  atomic_init32(&seq_no_);\n  atomic_init32(&flushed_);\n  atomic_init32(&terminate_flush_thread_);\n  atomic_init32(&flush_immediately_);\n  ring_buffer_ = new BufferEntry[buffer_size_];\n  commit_buffer_ = new atomic_int32[buffer_size_];\n  for (int i = 0; i < buffer_size_; i++)\n    atomic_init32(&commit_buffer_[i]);\n\n  int retval;\n  retval = pthread_cond_init(&sig_continue_trace_, NULL);\n  assert(retval == 0 && \"Could not create continue-trace signal\");\n  retval = pthread_mutex_init(&sig_continue_trace_mutex_, NULL);\n  assert(retval == 0 && \"Could not create mutex for continue-trace signal\");\n  retval = pthread_cond_init(&sig_flush_, NULL);\n  assert(retval == 0 && \"Could not create flush signal\");\n\n  FlushThreadStartData *start_data = new FlushThreadStartData;\n  start_data->sig_flush = &sig_flush_;\n  start_data->sig_continue_trace = &sig_continue_trace_;\n  start_data->ring_buffer = ring_buffer_;\n  start_data->commit_buffer = commit_buffer_;\n  start_data->seq_no = &seq_no_;\n  start_data->flushed = &flushed_;\n  start_data->terminate = &terminate_flush_thread_;\n  start_data->flush_immediately = &flush_immediately_;\n  start_data->size = buffer_size_;\n  start_data->threshold = flush_threshold_;\n  start_data->filename = filename_;\n  retval = pthread_create(&thread_flush_, NULL, MainFlush,\n                          reinterpret_cast<void *> (start_data));\n  assert(retval == 0 && \"Could not create flush thread\");\n\n  TraceInternal(-1, PathString(\"Tracer\", 6), \"Trace buffer created\");\n}\n\n\n\/**\n * Turns the tracer off.\n *\/\nvoid InitNull() {\n  active_ = false;\n}\n\n\n\/**\n * Destroys everything and terminates the flush thread.  Flushes\n * all pending messages from the ring buffer.  Be sure that all trace\n * functions have returned before destroying.\n *\/\nvoid Fini() {\n  if (!active_) return;\n\n  TraceInternal(-2, PathString(\"Tracer\", 6), \"Destroying trace buffer...\");\n\n  \/\/ Trigger flushing and wait for it\n  int retval;\n  atomic_inc32(&terminate_flush_thread_);\n  retval = pthread_cond_signal(&sig_flush_);\n  assert(retval == 0 && \"Could not signal flush thread\");\n  retval = pthread_join(thread_flush_, NULL);\n  assert(retval == 0 && \"Flush thread not gracefully terminated\");\n\n  retval = pthread_cond_destroy(&sig_continue_trace_);\n  assert(retval == 0 && \"Continue-trace signal could not be destroyed\");\n  retval = pthread_mutex_destroy(&sig_continue_trace_mutex_);\n  assert(retval == 0 &&\n         \"Mutex for continue-trace signal could not be destroyed\");\n  retval = pthread_cond_destroy(&sig_flush_);\n  assert(retval == 0 && \"Flush signal could not be destroyed\");\n\n  delete[] ring_buffer_;\n  delete[] commit_buffer_;\n}\n\n\n\/**\n * Trace a message.  This is usually a lock-free procedure that just\n * requires two fetch_and_add operations and a gettimeofday syscall.\n * There are two exceptions:\n *   -# If the ring buffer is full, the function blocks until the flush\n *      thread made some space.  Avoid that by carefully choosing size\n *      and threshold.\n *   -# If this message reaches the threshold, the flush thread gets\n *      signaled.\n *\n * \\param[in] event Arbitrary code, for consistency applications should use one\n *            of the TraceEvents constants. Negative codes are reserved\n *            for internal use.\n * \\param[in] id Arbitrary id, for example file name or module name which is\n *            doing the trace.\n * \\return The sequence number which was used to trace the record\n *\/\nint32_t TraceInternal(const int event, const PathString &path,\n                      const string &msg)\n{\n  int32_t my_seq_no = atomic_xadd32(&seq_no_, 1);\n  timeval now;\n  gettimeofday(&now, NULL);\n  int pos = my_seq_no % buffer_size_;\n\n  while (my_seq_no - atomic_read32(&flushed_) >= buffer_size_) {\n    timespec timeout;\n    int retval;\n    GetTimespecRel(25, &timeout);\n    retval = pthread_mutex_lock(&sig_continue_trace_mutex_);\n    retval |= pthread_cond_timedwait(&sig_continue_trace_,\n                                     &sig_continue_trace_mutex_, &timeout);\n    retval |= pthread_mutex_unlock(&sig_continue_trace_mutex_);\n    assert((retval == ETIMEDOUT || retval == 0) &&\n           \"Error while waiting to continue tracing\");\n  }\n\n  ring_buffer_[pos].time_stamp = now;\n  ring_buffer_[pos].code = event;\n  ring_buffer_[pos].path = path;\n  ring_buffer_[pos].msg = msg;\n  atomic_inc32(&commit_buffer_[pos]);\n\n  if (my_seq_no - atomic_read32(&flushed_) == flush_threshold_) {\n    int err_code __attribute__((unused)) = pthread_cond_signal(&sig_flush_);\n    assert(err_code == 0 && \"Could not signal flush thread\");\n  }\n\n  return my_seq_no;\n}\n\n\n\/**\n * Flushes the ring buffer immediately at least up to the current seq_no.\n * It blocks until the flush thread finished the work.  It does not\n * affect further tracing during its execution.\n *\/\nvoid Flush() {\n  if (!active_) return;\n\n  int32_t save_seq_no = TraceInternal(-3, PathString(\"Tracer\", 6),\n                                      \"flushed ring buffer\");\n  while (atomic_read32(&flushed_) <= save_seq_no) {\n    timespec timeout;\n    int retval;\n\n    atomic_cas32(&flush_immediately_, 0, 1);\n    retval = pthread_cond_signal(&sig_flush_);\n    assert(retval == 0 && \"Could not signal flush thread\");\n\n    GetTimespecRel(250, &timeout);\n    retval = pthread_mutex_lock(&sig_continue_trace_mutex_);\n    retval |= pthread_cond_timedwait(&sig_continue_trace_,\n                                       &sig_continue_trace_mutex_, &timeout);\n    retval |= pthread_mutex_unlock(&sig_continue_trace_mutex_);\n    assert((retval == ETIMEDOUT || retval == 0) &&\n           \"Error while waiting in flush ()\");\n  }\n}\n\n}  \/\/ namespace tracer\n<commit_msg>changed config.h to cvmfs_config.h<commit_after>\/**\n * This file is part of the CernVM File System.\n *\n * Tracer is a thread-safe tracing module.  It uses a ring buffer\n * and spawns a helper thread, that flushes the messages onto the disk\n * when necessary.  The output file is in csv format.  Usually tracing\n * a message is a lock-free process, which therefore should have minimal\n * overhead.\n *\n * This is _not_ supposed to be a debugging system.  It is optimized for\n * speed and does not try to gather any additional information (like\n * threadid, status of variables, etc.) and it's in no way \"intelligent\".\n * But -- most importantly -- if the thing crashes, all messages in the\n * ring buffer go to hell as well.\n *\n * Csv output is adapted from libcsv.\n *\n * \\todo Currently, if anything goes wrong, the whole thing breaks\n *       down on assertion.  This might be not desired behavior.\n *\/\n\n#include \"cvmfs_config.h\"\n#include \"tracer.h\"\n\n#include <pthread.h>\n#include <sys\/time.h>\n\n#include <cstdlib>\n#include <cstdio>\n#include <cassert>\n#include <cerrno>\n\n#include <string>\n\n#include \"util.h\"\n#include \"atomic.h\"\n\nusing namespace std;  \/\/ NOLINT\n\nnamespace tracer {\n\n\/**\n * Contents of a trace line.\n * \\todo memory alignment\n *\/\nstruct BufferEntry {\n  timeval time_stamp;  \/**< This is currently with milliseconds precision\n                            (using gettimeofday). *\/\n  int code;  \/*< arbitrary code, negative codes are reserved for internal\n                 use. *\/\n  PathString path;  \/**< The path that is subject to the trace *\/\n  std::string msg;\n};\n\nstruct FlushThreadStartData {\n  pthread_cond_t *sig_flush;\n  pthread_cond_t *sig_continue_trace;\n  BufferEntry *ring_buffer;\n  atomic_int32 *commit_buffer;\n  atomic_int32 *seq_no;\n  atomic_int32 *flushed;\n  atomic_int32 *terminate;\n  atomic_int32 *flush_immediately;\n  int size;\n  int threshold;\n  string filename;\n};\n\nbool active_ = false;\nstd::string filename_;\nint buffer_size_;\nint flush_threshold_;\natomic_int32 seq_no_;  \/**< Starts with 0 and gets incremented by each call to\n                        trace. Contains the first non-used sequence number. *\/\natomic_int32 flushed_;  \/**< Starts with 0 and gets incremented by the flush\n                         thread.  Points to the first non-flushed message.\n                         flushed <= seq_no holds. *\/\natomic_int32 terminate_flush_thread_;\natomic_int32 flush_immediately_;\nBufferEntry *ring_buffer_;\natomic_int32 *commit_buffer_;  \/**< Has the same size as the ring buffer.  If a\n                                message is actually copied to the ring buffer\n                                memory, the respective flag is set to 1.\n                                Flags are reset to 0 by the flush thread. *\/\npthread_t thread_flush_;\npthread_cond_t sig_flush_;\npthread_cond_t sig_continue_trace_;\npthread_mutex_t sig_continue_trace_mutex_;\n\n\n\/**\n * Returns a timestamp at now+ms.\n *\/\nstatic void GetTimespecRel(const int64_t ms, timespec *ts) {\n  timeval now;\n  gettimeofday(&now, NULL);\n  int64_t nsecs = now.tv_usec * 1000 + (ms % 1000)*1000*1000;\n  int carry = 0;\n  if (nsecs >= 1000*1000*1000) {\n    carry = 1;\n    nsecs -= 1000*1000*1000;\n  }\n  ts->tv_sec = now.tv_sec + ms\/1000 + carry;\n  ts->tv_nsec = nsecs;\n}\n\n\nstatic int WriteCsvFile(FILE *fp, const string &field) {\n  if (fp == NULL)\n    return 0;\n\n  int retval;\n\n  if ((retval = fputc('\"', fp)) != '\"')\n    return retval;\n\n  for (unsigned i = 0, l = field.length(); i < l; ++i) {\n    if (field[i] == '\"') {\n      if ((retval = fputc('\"', fp)) != '\"')\n        return retval;\n    }\n    if ((retval = fputc(field[i], fp)) != field[i])\n      return retval;\n  }\n\n  if ((retval = fputc('\"', fp)) != '\"')\n    return retval;\n\n  return 0;\n}\n\n\nstatic void *MainFlush(void *data) {\n  FlushThreadStartData *start_data =\n    reinterpret_cast<FlushThreadStartData *>(data);\n  pthread_mutex_t sig_flush_mutex;\n  int retval;\n  retval = pthread_mutex_init(&sig_flush_mutex, NULL);\n  assert(retval == 0 && \"Could not initialize mutex for flush signal\");\n  retval = pthread_mutex_lock(&sig_flush_mutex);\n  assert(retval == 0 && \"Could not lock mutex for flush signal\");\n  FILE *f = fopen(start_data->filename.c_str(), \"a\");\n  assert(f != NULL && \"Could not open trace file\");\n  struct timespec timeout;\n\n  do {\n    while ((atomic_read32(start_data->terminate) == 0) &&\n           (atomic_read32(start_data->flush_immediately) == 0) &&\n           (atomic_read32(start_data->seq_no) - atomic_read32(start_data->flushed)\n             <= start_data->threshold))\n    {\n      GetTimespecRel(2000, &timeout);\n      retval = pthread_cond_timedwait(start_data->sig_flush,\n                                      &sig_flush_mutex, &timeout);\n      assert(retval != EINVAL && \"Error while waiting on flush signal\");\n    }\n\n    int base = atomic_read32(start_data->flushed) % start_data->size;\n    int pos, i = 0;\n    while ((i <= start_data->threshold) &&\n           (atomic_read32(&start_data->commit_buffer[\n             pos = ((base + i) % start_data->size)]) == 1))\n    {\n      string tmp;\n      tmp = StringifyTimeval(start_data->ring_buffer[pos].time_stamp);\n      retval = WriteCsvFile(f, tmp);\n      retval |= fputc(',', f) - ',';\n      tmp = StringifyInt(start_data->ring_buffer[pos].code);\n      retval = WriteCsvFile(f, tmp);\n      retval |= fputc(',', f) - ',';\n      retval |= WriteCsvFile(f, start_data->ring_buffer[pos].path.ToString());\n      retval |= fputc(',', f) - ',';\n      retval |= WriteCsvFile(f, start_data->ring_buffer[pos].msg);\n      retval |= (fputc(13, f) - 13) | (fputc(10, f) - 10);\n      retval |= fflush(f);\n      assert(retval == 0 && \"Error while writing into trace file\");\n\n      atomic_dec32(&start_data->commit_buffer[pos]);\n      ++i;\n    }\n    atomic_xadd32(start_data->flushed, i);\n    atomic_cas32(start_data->flush_immediately, 1, 0);\n\n    retval = pthread_cond_broadcast(start_data->sig_continue_trace);\n    assert(retval == 0 && \"Could not signal trace threads\");\n  } while ((atomic_read32(start_data->terminate) == 0) ||\n           (atomic_read32(start_data->flushed) <\n             atomic_read32(start_data->seq_no)));\n\n  retval = fclose(f);\n  assert(retval == 0 && \"Could not gracefully close trace file\");\n  pthread_mutex_unlock(&sig_flush_mutex);\n  retval = pthread_mutex_destroy(&sig_flush_mutex);\n  assert(retval == 0 && \"Could not gracefully destroy mutex for flush signal\");\n  delete start_data;\n  return NULL;\n}\n\n\/**\n * Initialize module and spawns the helper thread for flushing.\n * @param[in] buffer_size The number of messages that are kept at maximum in the\n *            internal ring buffer.\n * @param[in] flush_threshold Threshold for the flushing thread.  Messages are\n *            flushed when more then t+1 messages are pending in the ring\n *            buffer. 0 <= flush_threshold < buffer_size must hold.\n * @param[in] filename File name of the trace log on the disk.  The file will\n *            be opened in 'a' mode, i.e. messages are appended.\n *\/\nvoid Init(const int buffer_size, const int flush_threshold,\n          const string &filename)\n{\n  active_ = true;\n  filename_ = filename;\n  buffer_size_ = buffer_size;\n  flush_threshold_ = flush_threshold;\n  assert(buffer_size_ > 1 && \"Invalid size\");\n  assert(0 <= flush_threshold_ && flush_threshold_ < buffer_size_ &&\n         \"Invalid threshold\");\n\n  atomic_init32(&seq_no_);\n  atomic_init32(&flushed_);\n  atomic_init32(&terminate_flush_thread_);\n  atomic_init32(&flush_immediately_);\n  ring_buffer_ = new BufferEntry[buffer_size_];\n  commit_buffer_ = new atomic_int32[buffer_size_];\n  for (int i = 0; i < buffer_size_; i++)\n    atomic_init32(&commit_buffer_[i]);\n\n  int retval;\n  retval = pthread_cond_init(&sig_continue_trace_, NULL);\n  assert(retval == 0 && \"Could not create continue-trace signal\");\n  retval = pthread_mutex_init(&sig_continue_trace_mutex_, NULL);\n  assert(retval == 0 && \"Could not create mutex for continue-trace signal\");\n  retval = pthread_cond_init(&sig_flush_, NULL);\n  assert(retval == 0 && \"Could not create flush signal\");\n\n  FlushThreadStartData *start_data = new FlushThreadStartData;\n  start_data->sig_flush = &sig_flush_;\n  start_data->sig_continue_trace = &sig_continue_trace_;\n  start_data->ring_buffer = ring_buffer_;\n  start_data->commit_buffer = commit_buffer_;\n  start_data->seq_no = &seq_no_;\n  start_data->flushed = &flushed_;\n  start_data->terminate = &terminate_flush_thread_;\n  start_data->flush_immediately = &flush_immediately_;\n  start_data->size = buffer_size_;\n  start_data->threshold = flush_threshold_;\n  start_data->filename = filename_;\n  retval = pthread_create(&thread_flush_, NULL, MainFlush,\n                          reinterpret_cast<void *> (start_data));\n  assert(retval == 0 && \"Could not create flush thread\");\n\n  TraceInternal(-1, PathString(\"Tracer\", 6), \"Trace buffer created\");\n}\n\n\n\/**\n * Turns the tracer off.\n *\/\nvoid InitNull() {\n  active_ = false;\n}\n\n\n\/**\n * Destroys everything and terminates the flush thread.  Flushes\n * all pending messages from the ring buffer.  Be sure that all trace\n * functions have returned before destroying.\n *\/\nvoid Fini() {\n  if (!active_) return;\n\n  TraceInternal(-2, PathString(\"Tracer\", 6), \"Destroying trace buffer...\");\n\n  \/\/ Trigger flushing and wait for it\n  int retval;\n  atomic_inc32(&terminate_flush_thread_);\n  retval = pthread_cond_signal(&sig_flush_);\n  assert(retval == 0 && \"Could not signal flush thread\");\n  retval = pthread_join(thread_flush_, NULL);\n  assert(retval == 0 && \"Flush thread not gracefully terminated\");\n\n  retval = pthread_cond_destroy(&sig_continue_trace_);\n  assert(retval == 0 && \"Continue-trace signal could not be destroyed\");\n  retval = pthread_mutex_destroy(&sig_continue_trace_mutex_);\n  assert(retval == 0 &&\n         \"Mutex for continue-trace signal could not be destroyed\");\n  retval = pthread_cond_destroy(&sig_flush_);\n  assert(retval == 0 && \"Flush signal could not be destroyed\");\n\n  delete[] ring_buffer_;\n  delete[] commit_buffer_;\n}\n\n\n\/**\n * Trace a message.  This is usually a lock-free procedure that just\n * requires two fetch_and_add operations and a gettimeofday syscall.\n * There are two exceptions:\n *   -# If the ring buffer is full, the function blocks until the flush\n *      thread made some space.  Avoid that by carefully choosing size\n *      and threshold.\n *   -# If this message reaches the threshold, the flush thread gets\n *      signaled.\n *\n * \\param[in] event Arbitrary code, for consistency applications should use one\n *            of the TraceEvents constants. Negative codes are reserved\n *            for internal use.\n * \\param[in] id Arbitrary id, for example file name or module name which is\n *            doing the trace.\n * \\return The sequence number which was used to trace the record\n *\/\nint32_t TraceInternal(const int event, const PathString &path,\n                      const string &msg)\n{\n  int32_t my_seq_no = atomic_xadd32(&seq_no_, 1);\n  timeval now;\n  gettimeofday(&now, NULL);\n  int pos = my_seq_no % buffer_size_;\n\n  while (my_seq_no - atomic_read32(&flushed_) >= buffer_size_) {\n    timespec timeout;\n    int retval;\n    GetTimespecRel(25, &timeout);\n    retval = pthread_mutex_lock(&sig_continue_trace_mutex_);\n    retval |= pthread_cond_timedwait(&sig_continue_trace_,\n                                     &sig_continue_trace_mutex_, &timeout);\n    retval |= pthread_mutex_unlock(&sig_continue_trace_mutex_);\n    assert((retval == ETIMEDOUT || retval == 0) &&\n           \"Error while waiting to continue tracing\");\n  }\n\n  ring_buffer_[pos].time_stamp = now;\n  ring_buffer_[pos].code = event;\n  ring_buffer_[pos].path = path;\n  ring_buffer_[pos].msg = msg;\n  atomic_inc32(&commit_buffer_[pos]);\n\n  if (my_seq_no - atomic_read32(&flushed_) == flush_threshold_) {\n    int err_code __attribute__((unused)) = pthread_cond_signal(&sig_flush_);\n    assert(err_code == 0 && \"Could not signal flush thread\");\n  }\n\n  return my_seq_no;\n}\n\n\n\/**\n * Flushes the ring buffer immediately at least up to the current seq_no.\n * It blocks until the flush thread finished the work.  It does not\n * affect further tracing during its execution.\n *\/\nvoid Flush() {\n  if (!active_) return;\n\n  int32_t save_seq_no = TraceInternal(-3, PathString(\"Tracer\", 6),\n                                      \"flushed ring buffer\");\n  while (atomic_read32(&flushed_) <= save_seq_no) {\n    timespec timeout;\n    int retval;\n\n    atomic_cas32(&flush_immediately_, 0, 1);\n    retval = pthread_cond_signal(&sig_flush_);\n    assert(retval == 0 && \"Could not signal flush thread\");\n\n    GetTimespecRel(250, &timeout);\n    retval = pthread_mutex_lock(&sig_continue_trace_mutex_);\n    retval |= pthread_cond_timedwait(&sig_continue_trace_,\n                                       &sig_continue_trace_mutex_, &timeout);\n    retval |= pthread_mutex_unlock(&sig_continue_trace_mutex_);\n    assert((retval == ETIMEDOUT || retval == 0) &&\n           \"Error while waiting in flush ()\");\n  }\n}\n\n}  \/\/ namespace tracer\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <microscopes\/common\/random_fwd.hpp>\n#include <microscopes\/common\/runtime_type.hpp>\n#include <microscopes\/common\/runtime_value.hpp>\n#include <microscopes\/common\/typedefs.hpp>\n#include <microscopes\/models\/base.hpp>\n\nnamespace microscopes {\nnamespace common {\n\nclass fixed_entity_based_state_object {\npublic:\n  virtual ~fixed_entity_based_state_object() {}\n\n  virtual size_t nentities() const = 0;\n  virtual size_t ngroups() const = 0;\n  virtual size_t ncomponents() const = 0;\n\n  virtual std::vector<ssize_t> assignments() const = 0;\n  virtual std::vector<size_t> groups() const = 0;\n\n  virtual size_t groupsize(size_t gid) const = 0;\n\n  \/\/ Routines for manipulating the parameters\n\n  virtual hyperparam_bag_t get_cluster_hp() const = 0;\n  virtual void set_cluster_hp(const hyperparam_bag_t &hp) = 0;\n  virtual value_mutator get_cluster_hp_mutator(const std::string &key) = 0;\n\n  virtual hyperparam_bag_t get_component_hp(size_t component) const = 0;\n  virtual void set_component_hp(size_t component, const hyperparam_bag_t &hp) = 0;\n  virtual void set_component_hp(size_t component, const models::hypers &proto) = 0;\n  virtual value_mutator get_component_hp_mutator(size_t component, const std::string &key) = 0;\n\n  virtual std::vector<ident_t> suffstats_identifiers(size_t component) const = 0;\n  virtual suffstats_bag_t get_suffstats(size_t component, ident_t id) const = 0;\n  virtual void set_suffstats(size_t component, ident_t id, const suffstats_bag_t &ss) = 0;\n  virtual value_mutator get_suffstats_mutator(size_t component, ident_t id, const std::string &key) = 0;\n\n  \/\/ Routines for manipulating cluster membership\n\n  virtual void add_value(size_t gid, size_t eid, rng_t &rng) = 0;\n  virtual size_t remove_value(size_t eid, rng_t &rng) = 0;\n\n  virtual std::pair<std::vector<size_t>, std::vector<float>>\n  score_value(size_t eid, rng_t &rng) const\n  {\n    \/\/ delegates to inplace_score_value by default\n    std::pair<std::vector<size_t>, std::vector<float>> ret;\n    inplace_score_value(ret, eid, rng);\n    return ret;\n  }\n\n  virtual void\n  inplace_score_value(std::pair<std::vector<size_t>, std::vector<float>> &scores,\n                      size_t eid,\n                      rng_t &rng) const = 0;\n\n  virtual float score_assignment() const = 0;\n\n  virtual float score_likelihood(size_t component, ident_t id, rng_t &rng) const = 0;\n\n  virtual float\n  score_likelihood(size_t component, rng_t &rng) const\n  {\n    float score = 0.;\n    for (auto id : suffstats_identifiers(component))\n      score += score_likelihood(component, id, rng);\n    return score;\n  }\n};\n\n\/**\n * The common interface for sampling kernels:\n *\n * An entity_based_state_object is a collection of (a fixed, known number of)\n * entities.\n *\n * The state describes a generative process composed of:\n *   (A) the clustering (group assignment) of the entities\n *   (B) conditionally independent components which describe the likelihood model\n *\n * Examples of generative models falling under an entity_based_state_object\n * include (1) mixture models and (2) infinite relational models (IRM)\n *\/\nclass entity_based_state_object : public fixed_entity_based_state_object {\npublic:\n  \/**\n   * A subset of groups()\n   *\/\n  virtual std::vector<size_t> empty_groups() const = 0;\n  virtual size_t create_group(rng_t &rng) = 0;\n  virtual void delete_group(size_t gid) = 0;\n};\n\n} \/\/ namespace common\n} \/\/ namespace microscopes\n<commit_msg>Remove fixed references from entity_state.hpp<commit_after>#pragma once\n\n#include <microscopes\/common\/random_fwd.hpp>\n#include <microscopes\/common\/runtime_type.hpp>\n#include <microscopes\/common\/runtime_value.hpp>\n#include <microscopes\/common\/typedefs.hpp>\n#include <microscopes\/models\/base.hpp>\n\nnamespace microscopes {\nnamespace common {\n\n\/**\n * The common interface for sampling kernels:\n *\n * An entity_based_state_object is a collection of (a fixed, known number of)\n * entities.\n *\n * The state describes a generative process composed of:\n *   (A) the clustering (group assignment) of the entities\n *   (B) conditionally independent components which describe the likelihood model\n *\n * Examples of generative models falling under an entity_based_state_object\n * include (1) mixture models and (2) infinite relational models (IRM)\n *\/\nclass entity_based_state_object {\npublic:\n  \/**\n   * A subset of groups()\n   *\/\n  virtual ~fixed_entity_based_state_object() {}\n\n  virtual size_t nentities() const = 0;\n  virtual size_t ngroups() const = 0;\n  virtual size_t ncomponents() const = 0;\n\n  virtual std::vector<ssize_t> assignments() const = 0;\n  virtual std::vector<size_t> groups() const = 0;\n\n  virtual size_t groupsize(size_t gid) const = 0;\n\n  \/\/ Routines for manipulating the parameters\n\n  virtual hyperparam_bag_t get_cluster_hp() const = 0;\n  virtual void set_cluster_hp(const hyperparam_bag_t &hp) = 0;\n  virtual value_mutator get_cluster_hp_mutator(const std::string &key) = 0;\n\n  virtual hyperparam_bag_t get_component_hp(size_t component) const = 0;\n  virtual void set_component_hp(size_t component, const hyperparam_bag_t &hp) = 0;\n  virtual void set_component_hp(size_t component, const models::hypers &proto) = 0;\n  virtual value_mutator get_component_hp_mutator(size_t component, const std::string &key) = 0;\n\n  virtual std::vector<ident_t> suffstats_identifiers(size_t component) const = 0;\n  virtual suffstats_bag_t get_suffstats(size_t component, ident_t id) const = 0;\n  virtual void set_suffstats(size_t component, ident_t id, const suffstats_bag_t &ss) = 0;\n  virtual value_mutator get_suffstats_mutator(size_t component, ident_t id, const std::string &key) = 0;\n\n  \/\/ Routines for manipulating cluster membership\n\n  virtual void add_value(size_t gid, size_t eid, rng_t &rng) = 0;\n  virtual size_t remove_value(size_t eid, rng_t &rng) = 0;\n\n  virtual std::pair<std::vector<size_t>, std::vector<float>>\n  score_value(size_t eid, rng_t &rng) const\n  {\n    \/\/ delegates to inplace_score_value by default\n    std::pair<std::vector<size_t>, std::vector<float>> ret;\n    inplace_score_value(ret, eid, rng);\n    return ret;\n  }\n\n  virtual void\n  inplace_score_value(std::pair<std::vector<size_t>, std::vector<float>> &scores,\n                      size_t eid,\n                      rng_t &rng) const = 0;\n\n  virtual float score_assignment() const = 0;\n\n  virtual float score_likelihood(size_t component, ident_t id, rng_t &rng) const = 0;\n\n  virtual float\n  score_likelihood(size_t component, rng_t &rng) const\n  {\n    float score = 0.;\n    for (auto id : suffstats_identifiers(component))\n      score += score_likelihood(component, id, rng);\n    return score;\n  }\n\n  virtual std::vector<size_t> empty_groups() const = 0;\n  virtual size_t create_group(rng_t &rng) = 0;\n  virtual void delete_group(size_t gid) = 0;\n};\n\n} \/\/ namespace common\n} \/\/ namespace microscopes\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SIPLASPLAS_UTILITY_LEXICAL_CAST_HPP\n#define SIPLASPLAS_UTILITY_LEXICAL_CAST_HPP\n\n#include <sstream>\n\nnamespace cpp\n{\n\ntemplate<typename T>\nstd::string lexical_cast(const T& value)\n{\n    std::ostringstream os;\n\n    os << value;\n\n    return os.str();\n}\n\ntemplate<typename T>\nT lexical_cast(const std::string& value)\n{\n    static_assert(std::is_default_constructible<T>::value,\n        \"T must be default constructible\");\n\n    std::istringstream is{value};\n    T object;\n\n    is >> object;\n\n    return object;\n}\n\n}\n\n#endif \/\/ SIPLASPLAS_UTILITY_LEXICAL_CAST_HPP\n<commit_msg>Utility.lexical_cast docs<commit_after>#ifndef SIPLASPLAS_UTILITY_LEXICAL_CAST_HPP\n#define SIPLASPLAS_UTILITY_LEXICAL_CAST_HPP\n\n#include <sstream>\n\nnamespace cpp\n{\n\n\/**\n * \\ingroup utility\n * \\brief Returns an string representation of a value.\n *\n * This function invokes `operator<<(std::ostream&, const T&)` to get\n * an string representation of a given value.\n *\n * It's a simplified version of the [Boost.Lexical_Cast library](http:\/\/www.boost.org\/doc\/libs\/1_55_0\/doc\/html\/boost_lexical_cast.html).\n *\n * \\tparam T value type. Must have a valid `operator<<(std::ostream&, T)` overload.\n * \\param value Value which is translated to a string.\n *\n * @return A string representation of the given value.\n *\/\ntemplate<typename T>\nstd::string lexical_cast(const T& value)\n{\n    std::ostringstream os;\n\n    os << value;\n\n    return os.str();\n}\n\n\/**\n * \\ingroup utility\n * \\brief Returns an string representation of a value.\n *\n * This function invokes `operator>>(std::istream&, T&)` to assign a T value\n * from an string representation of it.\n *\n * It's a simplified version of the [Boost.Lexical_Cast library](http:\/\/www.boost.org\/doc\/libs\/1_55_0\/doc\/html\/boost_lexical_cast.html).\n *\n * \\tparam T Required output value type. Must have a valid `operator>>(std::istream&, T&)` overload.\n * \\param value String representation of the value.\n *\n * @return A value of type \\p T equivalent to the \\p value string representation argument.\n *\/\ntemplate<typename T>\nT lexical_cast(const std::string& value)\n{\n    static_assert(std::is_default_constructible<T>::value,\n        \"T must be default constructible\");\n\n    std::istringstream is{value};\n    T object;\n\n    is >> object;\n\n    return object;\n}\n\n}\n\n#endif \/\/ SIPLASPLAS_UTILITY_LEXICAL_CAST_HPP\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 NDEBUG\n#include <iostream>\n#endif\n\n#include <visionaray\/gl\/util.h>\n\nnamespace visionaray\n{\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ cpu_buffer_rt\n\/\/\n\ntemplate <pixel_format CF, pixel_format DF>\ntypename cpu_buffer_rt<CF, DF>::color_type* cpu_buffer_rt<CF, DF>::color()\n{\n    return color_buffer_.data();\n}\n\ntemplate <pixel_format CF, pixel_format DF>\ntypename cpu_buffer_rt<CF, DF>::depth_type* cpu_buffer_rt<CF, DF>::depth()\n{\n    return depth_buffer_.data();\n}\n\ntemplate <pixel_format CF, pixel_format DF>\ntypename cpu_buffer_rt<CF, DF>::color_type const* cpu_buffer_rt<CF, DF>::color() const\n{\n    return color_buffer_.data();\n}\n\ntemplate <pixel_format CF, pixel_format DF>\ntypename cpu_buffer_rt<CF, DF>::depth_type const* cpu_buffer_rt<CF, DF>::depth() const\n{\n    return depth_buffer_.data();\n}\n\ntemplate <pixel_format CF, pixel_format DF>\nvoid cpu_buffer_rt<CF, DF>::begin_frame()\n{\n}\n\ntemplate <pixel_format CF, pixel_format DF>\nvoid cpu_buffer_rt<CF, DF>::end_frame()\n{\n}\n\ntemplate <pixel_format CF, pixel_format DF>\nvoid cpu_buffer_rt<CF, DF>::resize(size_t w, size_t h)\n{\n    pixel_format_info cinfo = map_pixel_format(color_traits::format);\n    color_buffer_.resize( w * h * cinfo.size );\n\n    if (depth_traits::format != PF_UNSPECIFIED)\n    {\n        pixel_format_info dinfo = map_pixel_format(depth_traits::format);\n        depth_buffer_.resize( w * h * dinfo.size );\n    }\n\n    render_target::resize(w, h);\n}\n\ntemplate <pixel_format CF, pixel_format DF>\nvoid cpu_buffer_rt<CF, DF>::display_color_buffer() const\n{\n\n    pixel_format_info info = map_pixel_format(color_traits::format);\n    gl::blend_pixels( width(), height(), info.format, info.type, color_buffer_.data() );\n\n}\n\n} \/\/ visionaray\n<commit_msg>Depth-compositing with cpu_buffer_rt<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#pragma once\n\n#ifndef NDEBUG\n#include <iostream>\n#endif\n\n#include <visionaray\/gl\/util.h>\n\nnamespace visionaray\n{\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ cpu_buffer_rt\n\/\/\n\ntemplate <pixel_format CF, pixel_format DF>\ntypename cpu_buffer_rt<CF, DF>::color_type* cpu_buffer_rt<CF, DF>::color()\n{\n    return color_buffer_.data();\n}\n\ntemplate <pixel_format CF, pixel_format DF>\ntypename cpu_buffer_rt<CF, DF>::depth_type* cpu_buffer_rt<CF, DF>::depth()\n{\n    return depth_buffer_.data();\n}\n\ntemplate <pixel_format CF, pixel_format DF>\ntypename cpu_buffer_rt<CF, DF>::color_type const* cpu_buffer_rt<CF, DF>::color() const\n{\n    return color_buffer_.data();\n}\n\ntemplate <pixel_format CF, pixel_format DF>\ntypename cpu_buffer_rt<CF, DF>::depth_type const* cpu_buffer_rt<CF, DF>::depth() const\n{\n    return depth_buffer_.data();\n}\n\ntemplate <pixel_format CF, pixel_format DF>\nvoid cpu_buffer_rt<CF, DF>::begin_frame()\n{\n}\n\ntemplate <pixel_format CF, pixel_format DF>\nvoid cpu_buffer_rt<CF, DF>::end_frame()\n{\n}\n\ntemplate <pixel_format CF, pixel_format DF>\nvoid cpu_buffer_rt<CF, DF>::resize(size_t w, size_t h)\n{\n    pixel_format_info cinfo = map_pixel_format(color_traits::format);\n    color_buffer_.resize( w * h * cinfo.size );\n\n    if (depth_traits::format != PF_UNSPECIFIED)\n    {\n        pixel_format_info dinfo = map_pixel_format(depth_traits::format);\n        depth_buffer_.resize( w * h * dinfo.size );\n    }\n\n    render_target::resize(w, h);\n}\n\ntemplate <pixel_format CF, pixel_format DF>\nvoid cpu_buffer_rt<CF, DF>::display_color_buffer() const\n{\n\n    if (depth_traits::format != PF_UNSPECIFIED)\n    {\n        glPushAttrib( GL_COLOR_BUFFER_BIT | GL_STENCIL_BUFFER_BIT | GL_ENABLE_BIT );\n\n        glEnable(GL_STENCIL_TEST);\n        glColorMask(GL_FALSE, GL_FALSE, GL_FALSE, GL_FALSE);\n        glStencilFunc(GL_ALWAYS, 1, 1);\n        glStencilOp(GL_KEEP, GL_KEEP, GL_REPLACE);\n\n        pixel_format_info dinfo = map_pixel_format(depth_traits::format);\n        gl::blend_pixels( width(), height(), dinfo.format, dinfo.type, depth_buffer_.data() );\n\n        glColorMask(GL_TRUE, GL_TRUE, GL_TRUE, GL_TRUE);\n        glStencilFunc(GL_EQUAL, 1, 1);\n        glStencilOp(GL_KEEP, GL_KEEP, GL_KEEP);\n        glDisable(GL_DEPTH_TEST);\n\n        pixel_format_info cinfo = map_pixel_format(color_traits::format);\n        gl::blend_pixels( width(), height(), cinfo.format, cinfo.type, color_buffer_.data() );\n\n        glPopAttrib();\n    }\n    else\n    {\n        pixel_format_info info = map_pixel_format(color_traits::format);\n        gl::blend_pixels( width(), height(), info.format, info.type, color_buffer_.data() );\n    }\n\n}\n\n} \/\/ visionaray\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2005, Peter Sommerlad and IFS Institute for Software at HSR Rapperswil, Switzerland\n * All rights reserved.\n *\n * This library\/application is free software; you can redistribute and\/or modify it under the terms of\n * the license that is included with this library\/application in the file license.txt.\n *\/\n\n\/\/--- interface include --------------------------------------------------------\n#include \"SysLog.h\"\n#if defined(WIN32)\n#define IOSTREAM_IS_THREADSAFE\n#endif\n\n\/\/--- standard modules used ----------------------------------------------------\n#include \"System.h\"\n\n\/\/--- c-library modules used ---------------------------------------------------\n#include <errno.h>\n#include <cstdio>\n#include <cstring>\n#if defined(__sun) || defined(__linux__) || defined(__aix__)\n#include <syslog.h>\n#endif\n#if defined(__SUNPRO_CC)\n#include <strings.h>\n#include <stdio.h>\n#endif\n\n\/\/--- SysLog ----------------------------------------------------------\nSysLog *SysLog::fgSysLog = 0;\nSysLog::eLogLevel SysLog::fgDoSystemLevelLog = SysLog::eALERT;\nSysLog::eLogLevel SysLog::fgDoLogOnCerr = SysLog::eERR;\n\n\/\/--- module initialization\/termination\nvoid SysLog::Init(const char *appId)\n{\n\t\/\/ beware this is not thread safe\n\t\/\/ the syslog channel is initialized\n\t\/\/ by the main thread in the server constructor\n\t\/\/ but since logging takes place before the\n\t\/\/ server object exists we have to take care\n\n\tif ( appId ) {\n\t\tTerminate();    \/\/ close existing syslog channel with default Coast name\n\t} else {\n\t\tappId = \"Coast\";\n\t}\n\n\tString strValue = System::EnvGet(\"WD_DOLOG\");\n\tint iValue = (int)strValue.AsLong(eNone);\n\tif ( ( eNone < iValue ) && ( iValue < eLast ) ) {\n\t\tfgDoSystemLevelLog = (eLogLevel)iValue;\n\t}\n\tstrValue = System::EnvGet(\"WD_LOGONCERR\");\n\tiValue = (int)strValue.AsLong(eNone);\n\tif ( ( eNone < iValue ) && ( iValue < eLast ) ) {\n\t\tfgDoLogOnCerr = (eLogLevel)iValue;\n\t}\n\n\t\/\/ initialize the syslog channel\n\tif ( !fgSysLog ) {\n\t\t\/\/ open the syslog channel for this application\n\t\t\/\/ there is always only one syslog channel per application\n#if defined(__sun) || defined(__linux__) || defined(__aix__)\n\t\tfgSysLog = new UnixSysLog(appId);\n#endif\n#if defined(WIN32)\n\t\tfgSysLog = new Win32SysLog(appId);\n#endif\n#if defined(__370__)\n\t\tfgSysLog = new S370SysLog();\n#endif\n\t}\n}\n\nvoid SysLog::Terminate()\n{\n\tif ( fgSysLog ) {\n\t\tdelete fgSysLog;\n\t\tfgSysLog = 0;\n\t}\n}\n\n\/\/--- logging API -------------------------------------\n\n\/\/ severity eDEBUG for tracing server\n\/\/ activity during development and\n\/\/ deployment\nvoid SysLog::Debug(const char *msg)\n{\n\tLog(eDEBUG, msg);\n}\n\n\/\/ severity eINFO for general information\n\/\/ log general useful information about server\n\/\/ activity\nvoid SysLog::Info(const char *msg)\n{\n\tLog(eINFO, msg);\n}\n\n\/\/ severity eWARNING\tfor information about\n\/\/ inconsistent state or potential dangerous\n\/\/ situation\nvoid SysLog::Warning(const char *msg)\n{\n\tLog(eWARNING, msg);\n}\n\n\/\/ severity eERR for outright errors\n\/\/ during operation of the server without\n\/\/ fatal results\nvoid SysLog::Error(const char *msg)\n{\n\tLog(eERR, msg);\n}\n\n\/\/ severity eALERT for fatal errors\n\/\/ this call triggers also an alert on\n\/\/ the operator console\nvoid SysLog::Alert(const char *msg)\n{\n\tLog(eALERT, msg);\n}\n\n\/\/ bottleneck routine used by others\n\/\/ here you can use severity levels directly\nvoid SysLog::Log(eLogLevel level, const char *msg)\n{\n\tif ( InitOnce() ) {\n\t\tfgSysLog->DoLog(level, msg);\n\t}\n}\n\nbool SysLog::InitOnce()\n{\n\tstatic bool once = false;\n\tif (!once) {\n\t\tonce = true;\n\t\tInit(0);\n\t}\n\treturn (fgSysLog != NULL);\n}\n\n\/\/--- utilities ------------------------------------\n\n\/\/ const char *SysErrorMsg(long errnum) maps the error number in errnum\n\/\/ to an error  message  string,  and returns a pointer to that string.\n\/\/ SysErrorMsg(long errnum) uses the same set of error messages as perror().\n\/\/ The returned string should not be overwritten.\nString SysLog::SysErrorMsg(long errnum)\n{\n#if defined(WIN32)\n\tLPVOID lpMsgBuf;\n\n\tFormatMessage(\n\t\tFORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM,\n\t\tNULL,\n\t\terrnum,\n\t\tMAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), \/\/ Default language\n\t\t(LPTSTR) &lpMsgBuf,\n\t\t0,\n\t\tNULL\n\t);\n\n\tString msg((const char *)lpMsgBuf, strlen(lpMsgBuf), Storage::Global());\n\t\/\/ Free the buffer.\n\tLocalFree( lpMsgBuf );\n\treturn msg;\n#else\n\tString theError(Storage::Global());\n\tif (errnum == EMFILE) {\n\t\ttheError = \"[No more filehandles in Process.] \";\n\t}\n\tif (errnum == ENFILE) {\n\t\ttheError = \"[No more filehandles in System.] \";\n\t}\n\ttheError.Append((long)errnum).Append(' ').Append(strerror(errnum));\n\treturn theError;\n#endif\n}\n\n\/\/ const char *LastSysError() returns the error message retrieved with errno\n\/\/ from SysErrorMsg(errno)\nString SysLog::LastSysError()\n{\n\tint iError( System::GetSystemError() );\n\tif ( iError != 0 ) {\n\t\treturn SysErrorMsg( iError );\n\t}\n\treturn String().Append((long)iError).Append(\": no system-error\");\n}\n\n\/\/magic function to be used by Assert macro to avoid dependency to class SysLog and SysLog.h\nint syslog_assert(const char *file, long line, const char *assertion)\n{\n\treturn SysLog::LogAssert(file, line, assertion);\n}\n\nint SysLog::LogAssert(const char *file, long line, const char *assertion)\n{\n\t\/\/ implement brain dead with C style things to avoid problems of recursion\n\tchar asrt_buf[2048];\n\tint asrt_buf_used = sprintf(asrt_buf, \"%s:%ld\\n Assert(%s) failed\\n\", file, line, assertion);\n\t\\\n\tSysLog::WriteToStderr(asrt_buf, asrt_buf_used);\n\treturn 0;\n}\n\nvoid SysLog::WriteToStderr(const String &msg)\n{\n\tSysLog::WriteToStderr((const char *)msg, msg.Length());\n}\n\nvoid SysLog::WriteToStderr(char *msg, long length)\n{\n\tSysLog::WriteToStderr((const char *)msg, length);\n}\n\nvoid SysLog::WriteToStderr(const char *msg, long length)\n{\n\tif ( msg ) {\n\t\tlong sLen = length;\n\t\tif ( sLen < 0 ) {\n\t\t\tsLen = strlen(msg);\n\t\t}\n#ifdef IOSTREAM_IS_THREADSAFE\n\t\tcerr.write(msg, sLen).flush();\n#else\n\t\t::write(2, msg, sLen);\n#endif\n\t}\n}\n\nvoid SysLog::WriteToStdout(const String &msg)\n{\n\tSysLog::WriteToStdout((const char *)msg, msg.Length());\n}\n\nvoid SysLog::WriteToStdout(char *msg, long length)\n{\n\tSysLog::WriteToStdout((const char *)msg, length);\n}\n\nvoid SysLog::WriteToStdout(const char *msg, long length)\n{\n\tif ( msg ) {\n\t\tlong sLen = length;\n\t\tif ( sLen < 0 ) {\n\t\t\tsLen = strlen(msg);\n\t\t}\n#ifdef IOSTREAM_IS_THREADSAFE\n\t\tcout.write(msg, sLen).flush();\n#else\n\t\t::write(1, msg, sLen);\n#endif\n\t}\n}\n\nSysLog::SysLog()\n{\n}\n\nSysLog::~SysLog()\n{\n}\n\nvoid SysLog::DoLog(eLogLevel level, const char *msg)\n{\n\t\/\/ override logging parameter if it is an alert message\n\tif ( level >= fgDoSystemLevelLog ) {\n\t\tDoSystemLevelLog(level, msg);\n\t}\n\t\/\/ override logging parameter if it is an error or alert message\n\tif ( level >= fgDoLogOnCerr ) {\n\t\tDoLogTrace(level, msg);\n\t}\n}\n\nvoid SysLog::DoTraceLevel(const char *level, const char *msg)\n{\n\tString finalMessage(level, strlen(level), Storage::Global());\n\tfinalMessage.Append(msg);\n\tfinalMessage.Append('\\n');\n\tSysLog::WriteToStderr(finalMessage, finalMessage.Length());\n}\n\nvoid SysLog::DoLogTrace(eLogLevel level, const char *logMsg)\n{\n\tswitch (level) {\n\t\tcase eDEBUG:\n\t\t\tDoTraceLevel(\"DEBUG: \", logMsg);\n\t\t\tbreak;\n\t\tcase eINFO:\n\t\t\tDoTraceLevel(\"INFO: \", logMsg);\n\t\t\tbreak;\n\t\tcase eWARNING:\n\t\t\tDoTraceLevel(\"WARNING: \", logMsg);\n\t\t\tbreak;\n\t\tcase eERR:\n\t\t\tDoTraceLevel(\"ERROR: \", logMsg);\n\t\t\tbreak;\n\t\tcase eALERT:\n\t\t\tDoTraceLevel(\"ALERT: \", logMsg);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t}\n}\n\n\/\/---- UnixSysLog ----------------------------------------------------------------\n#if defined(__sun) || defined(__linux__) || defined(__aix__)\n\nUnixSysLog::UnixSysLog(const char *appId)\n{\n\t\/\/ initialize the syslog channel\n\t::openlog(appId, LOG_PID, LOG_USER);\n}\n\nUnixSysLog::~UnixSysLog()\n{\n\t\/\/ close the syslog channel for this application\n\t::closelog();\n}\n\nvoid UnixSysLog::DoSystemLevelLog(eLogLevel level, const char *logMsg)\n{\n\t\/\/ need to do a remapping of internal code to unix specific code now\n\tlong lLevel = LOG_DEBUG;\n\tswitch (level) {\n\t\tcase eINFO:\n\t\t\tlLevel = LOG_INFO;\n\t\t\tbreak;\n\t\tcase eWARNING:\n\t\t\tlLevel = LOG_WARNING;\n\t\t\tbreak;\n\t\tcase eERR:\n\t\t\tlLevel = LOG_ERR;\n\t\t\tbreak;\n\t\tcase eALERT:\n\t\t\tlLevel = LOG_ALERT;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t};\n\t::syslog(lLevel, \"%s\", (const char *)logMsg);\n}\n\n#endif\n\n#if defined(__370__)\n\nvoid S370SysLog::DoSystemLevelLog(eLogLevel level, const char *msg)\n{\n\tcerr << \"level \" << level << \": \" << logMsg << endl;\n}\n\nvoid SysLog::DoLogTrace(long level, const char *msg)\n{\n\t\/\/ do nothing we already logged it on cerr\n}\n\n#endif\n\n#if defined(WIN32)\nWin32SysLog::Win32SysLog(const char *appId)\n{\n\tfLogHandle =\t::RegisterEventSource(0, appId);\n}\n\nWin32SysLog::~Win32SysLog()\n{\n\t::DeregisterEventSource( fLogHandle );\n}\n\nvoid Win32SysLog::DoSystemLevelLog(eLogLevel level, const char *logMsg)\n{\n\tWORD evtType = EVENTLOG_INFORMATION_TYPE;\n\tLPCTSTR str[1];\n\tstr[0] = logMsg;\n\n\tswitch (level) {\n\t\tcase eWARNING:\n\t\t\tevtType = EVENTLOG_WARNING_TYPE;\n\t\t\tbreak;\n\t\tcase eERR:\n\t\tcase eALERT:\n\t\t\tevtType = EVENTLOG_ERROR_TYPE;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\t::ReportEvent(fLogHandle, evtType, 0, 0, 0, 2, 0, str, 0);\n}\n#endif\n<commit_msg>resolved mac compatibility issue<commit_after>\/*\n * Copyright (c) 2005, Peter Sommerlad and IFS Institute for Software at HSR Rapperswil, Switzerland\n * All rights reserved.\n *\n * This library\/application is free software; you can redistribute and\/or modify it under the terms of\n * the license that is included with this library\/application in the file license.txt.\n *\/\n\n\/\/--- interface include --------------------------------------------------------\n#include \"SysLog.h\"\n#if defined(WIN32)\n#define IOSTREAM_IS_THREADSAFE\n#endif\n\n\/\/--- standard modules used ----------------------------------------------------\n#include \"System.h\"\n\n\/\/--- c-library modules used ---------------------------------------------------\n#include <errno.h>\n#include <cstdio>\n#include <cstring>\n#if !defined(WIN32)\n#include <syslog.h>\n#endif\n#if defined(__SUNPRO_CC)\n#include <strings.h>\n#include <stdio.h>\n#endif\n\n\/\/--- SysLog ----------------------------------------------------------\nSysLog *SysLog::fgSysLog = 0;\nSysLog::eLogLevel SysLog::fgDoSystemLevelLog = SysLog::eALERT;\nSysLog::eLogLevel SysLog::fgDoLogOnCerr = SysLog::eERR;\n\n\/\/--- module initialization\/termination\nvoid SysLog::Init(const char *appId)\n{\n\t\/\/ beware this is not thread safe\n\t\/\/ the syslog channel is initialized\n\t\/\/ by the main thread in the server constructor\n\t\/\/ but since logging takes place before the\n\t\/\/ server object exists we have to take care\n\n\tif ( appId ) {\n\t\tTerminate();    \/\/ close existing syslog channel with default Coast name\n\t} else {\n\t\tappId = \"Coast\";\n\t}\n\n\tString strValue = System::EnvGet(\"WD_DOLOG\");\n\tint iValue = (int)strValue.AsLong(eNone);\n\tif ( ( eNone < iValue ) && ( iValue < eLast ) ) {\n\t\tfgDoSystemLevelLog = (eLogLevel)iValue;\n\t}\n\tstrValue = System::EnvGet(\"WD_LOGONCERR\");\n\tiValue = (int)strValue.AsLong(eNone);\n\tif ( ( eNone < iValue ) && ( iValue < eLast ) ) {\n\t\tfgDoLogOnCerr = (eLogLevel)iValue;\n\t}\n\n\t\/\/ initialize the syslog channel\n\tif ( !fgSysLog ) {\n\t\t\/\/ open the syslog channel for this application\n\t\t\/\/ there is always only one syslog channel per application\n#if defined(WIN32)\n\t\tfgSysLog = new Win32SysLog(appId);\n#elif defined(__370__)\n\t\tfgSysLog = new S370SysLog();\n#else\n\t\tfgSysLog = new UnixSysLog(appId);\n#endif\n\t}\n}\n\nvoid SysLog::Terminate()\n{\n\tif ( fgSysLog ) {\n\t\tdelete fgSysLog;\n\t\tfgSysLog = 0;\n\t}\n}\n\n\/\/--- logging API -------------------------------------\n\n\/\/ severity eDEBUG for tracing server\n\/\/ activity during development and\n\/\/ deployment\nvoid SysLog::Debug(const char *msg)\n{\n\tLog(eDEBUG, msg);\n}\n\n\/\/ severity eINFO for general information\n\/\/ log general useful information about server\n\/\/ activity\nvoid SysLog::Info(const char *msg)\n{\n\tLog(eINFO, msg);\n}\n\n\/\/ severity eWARNING\tfor information about\n\/\/ inconsistent state or potential dangerous\n\/\/ situation\nvoid SysLog::Warning(const char *msg)\n{\n\tLog(eWARNING, msg);\n}\n\n\/\/ severity eERR for outright errors\n\/\/ during operation of the server without\n\/\/ fatal results\nvoid SysLog::Error(const char *msg)\n{\n\tLog(eERR, msg);\n}\n\n\/\/ severity eALERT for fatal errors\n\/\/ this call triggers also an alert on\n\/\/ the operator console\nvoid SysLog::Alert(const char *msg)\n{\n\tLog(eALERT, msg);\n}\n\n\/\/ bottleneck routine used by others\n\/\/ here you can use severity levels directly\nvoid SysLog::Log(eLogLevel level, const char *msg)\n{\n\tif ( InitOnce() ) {\n\t\tfgSysLog->DoLog(level, msg);\n\t}\n}\n\nbool SysLog::InitOnce()\n{\n\tstatic bool once = false;\n\tif (!once) {\n\t\tonce = true;\n\t\tInit(0);\n\t}\n\treturn (fgSysLog != NULL);\n}\n\n\/\/--- utilities ------------------------------------\n\n\/\/ const char *SysErrorMsg(long errnum) maps the error number in errnum\n\/\/ to an error  message  string,  and returns a pointer to that string.\n\/\/ SysErrorMsg(long errnum) uses the same set of error messages as perror().\n\/\/ The returned string should not be overwritten.\nString SysLog::SysErrorMsg(long errnum)\n{\n#if defined(WIN32)\n\tLPVOID lpMsgBuf;\n\n\tFormatMessage(\n\t\tFORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM,\n\t\tNULL,\n\t\terrnum,\n\t\tMAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), \/\/ Default language\n\t\t(LPTSTR) &lpMsgBuf,\n\t\t0,\n\t\tNULL\n\t);\n\n\tString msg((const char *)lpMsgBuf, strlen(lpMsgBuf), Storage::Global());\n\t\/\/ Free the buffer.\n\tLocalFree( lpMsgBuf );\n\treturn msg;\n#else\n\tString theError(Storage::Global());\n\tif (errnum == EMFILE) {\n\t\ttheError = \"[No more filehandles in Process.] \";\n\t}\n\tif (errnum == ENFILE) {\n\t\ttheError = \"[No more filehandles in System.] \";\n\t}\n\ttheError.Append((long)errnum).Append(' ').Append(strerror(errnum));\n\treturn theError;\n#endif\n}\n\n\/\/ const char *LastSysError() returns the error message retrieved with errno\n\/\/ from SysErrorMsg(errno)\nString SysLog::LastSysError()\n{\n\tint iError( System::GetSystemError() );\n\tif ( iError != 0 ) {\n\t\treturn SysErrorMsg( iError );\n\t}\n\treturn String().Append((long)iError).Append(\": no system-error\");\n}\n\n\/\/magic function to be used by Assert macro to avoid dependency to class SysLog and SysLog.h\nint syslog_assert(const char *file, long line, const char *assertion)\n{\n\treturn SysLog::LogAssert(file, line, assertion);\n}\n\nint SysLog::LogAssert(const char *file, long line, const char *assertion)\n{\n\t\/\/ implement brain dead with C style things to avoid problems of recursion\n\tchar asrt_buf[2048];\n\tint asrt_buf_used = sprintf(asrt_buf, \"%s:%ld\\n Assert(%s) failed\\n\", file, line, assertion);\n\t\\\n\tSysLog::WriteToStderr(asrt_buf, asrt_buf_used);\n\treturn 0;\n}\n\nvoid SysLog::WriteToStderr(const String &msg)\n{\n\tSysLog::WriteToStderr((const char *)msg, msg.Length());\n}\n\nvoid SysLog::WriteToStderr(char *msg, long length)\n{\n\tSysLog::WriteToStderr((const char *)msg, length);\n}\n\nvoid SysLog::WriteToStderr(const char *msg, long length)\n{\n\tif ( msg ) {\n\t\tlong sLen = length;\n\t\tif ( sLen < 0 ) {\n\t\t\tsLen = strlen(msg);\n\t\t}\n#ifdef IOSTREAM_IS_THREADSAFE\n\t\tcerr.write(msg, sLen).flush();\n#else\n\t\t::write(2, msg, sLen);\n#endif\n\t}\n}\n\nvoid SysLog::WriteToStdout(const String &msg)\n{\n\tSysLog::WriteToStdout((const char *)msg, msg.Length());\n}\n\nvoid SysLog::WriteToStdout(char *msg, long length)\n{\n\tSysLog::WriteToStdout((const char *)msg, length);\n}\n\nvoid SysLog::WriteToStdout(const char *msg, long length)\n{\n\tif ( msg ) {\n\t\tlong sLen = length;\n\t\tif ( sLen < 0 ) {\n\t\t\tsLen = strlen(msg);\n\t\t}\n#ifdef IOSTREAM_IS_THREADSAFE\n\t\tcout.write(msg, sLen).flush();\n#else\n\t\t::write(1, msg, sLen);\n#endif\n\t}\n}\n\nSysLog::SysLog()\n{\n}\n\nSysLog::~SysLog()\n{\n}\n\nvoid SysLog::DoLog(eLogLevel level, const char *msg)\n{\n\t\/\/ override logging parameter if it is an alert message\n\tif ( level >= fgDoSystemLevelLog ) {\n\t\tDoSystemLevelLog(level, msg);\n\t}\n\t\/\/ override logging parameter if it is an error or alert message\n\tif ( level >= fgDoLogOnCerr ) {\n\t\tDoLogTrace(level, msg);\n\t}\n}\n\nvoid SysLog::DoTraceLevel(const char *level, const char *msg)\n{\n\tString finalMessage(level, strlen(level), Storage::Global());\n\tfinalMessage.Append(msg);\n\tfinalMessage.Append('\\n');\n\tSysLog::WriteToStderr(finalMessage, finalMessage.Length());\n}\n\nvoid SysLog::DoLogTrace(eLogLevel level, const char *logMsg)\n{\n\tswitch (level) {\n\t\tcase eDEBUG:\n\t\t\tDoTraceLevel(\"DEBUG: \", logMsg);\n\t\t\tbreak;\n\t\tcase eINFO:\n\t\t\tDoTraceLevel(\"INFO: \", logMsg);\n\t\t\tbreak;\n\t\tcase eWARNING:\n\t\t\tDoTraceLevel(\"WARNING: \", logMsg);\n\t\t\tbreak;\n\t\tcase eERR:\n\t\t\tDoTraceLevel(\"ERROR: \", logMsg);\n\t\t\tbreak;\n\t\tcase eALERT:\n\t\t\tDoTraceLevel(\"ALERT: \", logMsg);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t}\n}\n\n\/\/---- UnixSysLog ----------------------------------------------------------------\n#if defined(WIN32)\nWin32SysLog::Win32SysLog(const char *appId)\n{\n\tfLogHandle =\t::RegisterEventSource(0, appId);\n}\n\nWin32SysLog::~Win32SysLog()\n{\n\t::DeregisterEventSource( fLogHandle );\n}\n\nvoid Win32SysLog::DoSystemLevelLog(eLogLevel level, const char *logMsg)\n{\n\tWORD evtType = EVENTLOG_INFORMATION_TYPE;\n\tLPCTSTR str[1];\n\tstr[0] = logMsg;\n\n\tswitch (level) {\n\t\tcase eWARNING:\n\t\t\tevtType = EVENTLOG_WARNING_TYPE;\n\t\t\tbreak;\n\t\tcase eERR:\n\t\tcase eALERT:\n\t\t\tevtType = EVENTLOG_ERROR_TYPE;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\t::ReportEvent(fLogHandle, evtType, 0, 0, 0, 2, 0, str, 0);\n}\n#elif defined(__370__)\nvoid S370SysLog::DoSystemLevelLog(eLogLevel level, const char *msg)\n{\n\tcerr << \"level \" << level << \": \" << logMsg << endl;\n}\n\nvoid SysLog::DoLogTrace(long level, const char *msg)\n{\n\t\/\/ do nothing we already logged it on cerr\n}\n#else\nUnixSysLog::UnixSysLog(const char *appId)\n{\n\t\/\/ initialize the syslog channel\n\t::openlog(appId, LOG_PID, LOG_USER);\n}\n\nUnixSysLog::~UnixSysLog()\n{\n\t\/\/ close the syslog channel for this application\n\t::closelog();\n}\n\nvoid UnixSysLog::DoSystemLevelLog(eLogLevel level, const char *logMsg)\n{\n\t\/\/ need to do a remapping of internal code to unix specific code now\n\tlong lLevel = LOG_DEBUG;\n\tswitch (level) {\n\t\tcase eINFO:\n\t\t\tlLevel = LOG_INFO;\n\t\t\tbreak;\n\t\tcase eWARNING:\n\t\t\tlLevel = LOG_WARNING;\n\t\t\tbreak;\n\t\tcase eERR:\n\t\t\tlLevel = LOG_ERR;\n\t\t\tbreak;\n\t\tcase eALERT:\n\t\t\tlLevel = LOG_ALERT;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t};\n\t::syslog(lLevel, \"%s\", (const char *)logMsg);\n}\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkChartLegend.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#include \"vtkChartLegend.h\"\n\n#include \"vtkContext2D.h\"\n#include \"vtkPen.h\"\n#include \"vtkBrush.h\"\n#include \"vtkChart.h\"\n#include \"vtkPlot.h\"\n#include \"vtkTextProperty.h\"\n#include \"vtkStdString.h\"\n#include \"vtkVector.h\"\n#include \"vtkWeakPointer.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkStringArray.h\"\n\n#include \"vtkObjectFactory.h\"\n\n#include <vector>\n\n\/\/-----------------------------------------------------------------------------\nclass vtkChartLegend::Private\n{\npublic:\n  Private()\n  {\n  }\n  ~Private()\n  {\n  }\n\n  vtkVector2f Point;\n  vtkWeakPointer<vtkChart> Chart;\n  std::vector<vtkPlot*> ActivePlots;\n};\n\n\/\/-----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkChartLegend);\n\n\/\/-----------------------------------------------------------------------------\nvtkChartLegend::vtkChartLegend()\n{\n  this->Storage = new vtkChartLegend::Private;\n  this->Point = this->Storage->Point.GetData();\n  \/\/ Defaults to 12pt text, with top, right alignment to the specified point.\n  this->LabelProperties = vtkSmartPointer<vtkTextProperty>::New();\n  this->LabelProperties->SetFontSize(12);\n  this->LabelProperties->SetColor(0.0, 0.0, 0.0);\n  this->LabelProperties->SetJustificationToLeft();\n  this->LabelProperties->SetVerticalJustificationToBottom();\n\n  this->Pen = vtkSmartPointer<vtkPen>::New();\n  this->Pen->SetColor(0, 0, 0);\n  this->Brush = vtkSmartPointer<vtkBrush>::New();\n  this->Brush->SetColor(255, 255, 255, 255);\n  this->HorizontalAlignment = vtkChartLegend::RIGHT;\n  this->VerticalAlignment = vtkChartLegend::TOP;\n\n  this->Padding = 5;\n  this->SymbolWidth = 25;\n  this->Inline = true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkChartLegend::~vtkChartLegend()\n{\n  delete this->Storage;\n  this->Storage = NULL;\n  this->Point = NULL;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::Update()\n{\n  this->Storage->ActivePlots.clear();\n  for (int i = 0; i < this->Storage->Chart->GetNumberOfPlots(); ++i)\n    {\n    if (this->Storage->Chart->GetPlot(i)->GetVisible())\n      {\n      this->Storage->ActivePlots.push_back(this->Storage->Chart->GetPlot(i));\n      }\n    \/\/ If we have a plot with multiple labels, we generally only want to show\n    \/\/ the labels\/legend symbols for the first one. So truncate at the first\n    \/\/ one we encounter.\n    if (this->Storage->Chart->GetPlot(i)->GetLabels() &&\n        this->Storage->Chart->GetPlot(i)->GetLabels()->GetNumberOfTuples() > 1)\n      {\n      break;\n      }\n    }\n  this->PlotTime.Modified();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartLegend::Paint(vtkContext2D *painter)\n{\n  \/\/ This is where everything should be drawn, or dispatched to other methods.\n  vtkDebugMacro(<< \"Paint event called in vtkChartLegend.\");\n\n  if (!this->Visible)\n    {\n    return true;\n    }\n\n  this->GetBoundingRect(painter);\n\n  \/\/ Now draw a box for the legend.\n  painter->ApplyPen(this->Pen);\n  painter->ApplyBrush(this->Brush);\n  painter->DrawRect(this->Rect.X(), this->Rect.Y(),\n                    this->Rect.Width(), this->Rect.Height());\n\n  painter->ApplyTextProp(this->LabelProperties);\n\n  vtkVector2f stringBounds[2];\n  painter->ComputeStringBounds(\"Tgyf\", stringBounds->GetData());\n  float height = stringBounds[1].GetY();\n  painter->ComputeStringBounds(\"The\", stringBounds->GetData());\n  float baseHeight = stringBounds[1].GetY();\n\n  vtkVector2f pos(this->Rect.X() + this->Padding + this->SymbolWidth,\n                  this->Rect.Y() + this->Rect.Height() - this->Padding - floor(height));\n  vtkRectf rect(this->Rect.X() + this->Padding, pos.Y(),\n               this->SymbolWidth-3, ceil(height));\n\n  \/\/ Draw all of the legend labels and marks\n  for(size_t i = 0; i < this->Storage->ActivePlots.size(); ++i)\n    {\n    vtkStringArray *labels = this->Storage->ActivePlots[i]->GetLabels();\n    for (vtkIdType l = 0; labels && (l < labels->GetNumberOfValues()); ++l)\n      {\n      \/\/ This is fairly hackish, but gets the text looking reasonable...\n      \/\/ Calculate a height for a \"normal\" string, then if this height is greater\n      \/\/ that offset is used to move it down. Effectively hacking in a text\n      \/\/ base line until better support is in the text rendering code...\n      \/\/ There are still several one pixel glitches, but it looks better than\n      \/\/ using the default vertical alignment. FIXME!\n      vtkStdString testString = labels->GetValue(l);\n      testString += \"T\";\n      painter->ComputeStringBounds(testString, stringBounds->GetData());\n      painter->DrawString(pos.X(), rect.Y() + (baseHeight-stringBounds[1].Y()),\n                          labels->GetValue(l));\n\n      \/\/ Paint the legend mark and increment out y value.\n      this->Storage->ActivePlots[i]->PaintLegend(painter, rect, l);\n      rect.SetY(rect.Y() - height - this->Padding);\n      }\n    }\n\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkRectf vtkChartLegend::GetBoundingRect(vtkContext2D *painter)\n{\n  if (this->RectTime > this->GetMTime() && this->RectTime > this->PlotTime)\n    {\n    return this->Rect;\n    }\n\n  painter->ApplyTextProp(this->LabelProperties);\n\n  vtkVector2f stringBounds[2];\n  painter->ComputeStringBounds(\"Tgyf\", stringBounds->GetData());\n  float height = stringBounds[1].GetY();\n  float maxWidth = 0.0f;\n\n  \/\/ Calculate the widest legend label - needs the context to calculate font\n  \/\/ metrics, but these could be cached.\n  for(size_t i = 0; i < this->Storage->ActivePlots.size(); ++i)\n    {\n    vtkStringArray *labels = this->Storage->ActivePlots[i]->GetLabels();\n    for (vtkIdType l = 0; labels && (l < labels->GetNumberOfTuples()); ++l)\n      {\n      painter->ComputeStringBounds(labels->GetValue(l),\n                                   stringBounds->GetData());\n      if (stringBounds[1].X() > maxWidth)\n        {\n        maxWidth = stringBounds[1].X();\n        }\n      }\n    }\n\n  \/\/ Figure out the size of the legend box and store locally.\n  int numLabels = 0;\n  for(size_t i = 0; i < this->Storage->ActivePlots.size(); ++i)\n    {\n    numLabels += this->Storage->ActivePlots[i]->GetNumberOfLabels();\n    }\n\n  \/\/ Default point placement is bottom left.\n  this->Rect = vtkRectf(floor(this->Storage->Point.X()),\n                        floor(this->Storage->Point.Y()),\n                        ceil(maxWidth + 2 * this->Padding + this->SymbolWidth),\n                        ceil((numLabels * (height + this->Padding)) + this->Padding));\n\n  this->RectTime.Modified();\n  return this->Rect;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::SetPoint(const vtkVector2f &point)\n{\n  this->Storage->Point = point;\n  this->Modified();\n}\n\n\/\/-----------------------------------------------------------------------------\nconst vtkVector2f& vtkChartLegend::GetPointVector()\n{\n  return this->Storage->Point;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::SetLabelSize(int size)\n{\n  this->LabelProperties->SetFontSize(size);\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkChartLegend::GetLabelSize()\n{\n  return this->LabelProperties->GetFontSize();\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkTextProperty * vtkChartLegend::GetLabelProperties()\n{\n  return this->LabelProperties;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::SetChart(vtkChart* chart)\n{\n  if (this->Storage->Chart == chart)\n    {\n    return;\n    }\n  else\n    {\n    this->Storage->Chart = chart;\n    this->Modified();\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkChart* vtkChartLegend::GetChart()\n{\n  return this->Storage->Chart;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::PrintSelf(ostream &os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n}\n<commit_msg>BUG: Only render legend items that have a label.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkChartLegend.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#include \"vtkChartLegend.h\"\n\n#include \"vtkContext2D.h\"\n#include \"vtkPen.h\"\n#include \"vtkBrush.h\"\n#include \"vtkChart.h\"\n#include \"vtkPlot.h\"\n#include \"vtkTextProperty.h\"\n#include \"vtkStdString.h\"\n#include \"vtkVector.h\"\n#include \"vtkWeakPointer.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkStringArray.h\"\n\n#include \"vtkObjectFactory.h\"\n\n#include <vector>\n\n\/\/-----------------------------------------------------------------------------\nclass vtkChartLegend::Private\n{\npublic:\n  Private()\n  {\n  }\n  ~Private()\n  {\n  }\n\n  vtkVector2f Point;\n  vtkWeakPointer<vtkChart> Chart;\n  std::vector<vtkPlot*> ActivePlots;\n};\n\n\/\/-----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkChartLegend);\n\n\/\/-----------------------------------------------------------------------------\nvtkChartLegend::vtkChartLegend()\n{\n  this->Storage = new vtkChartLegend::Private;\n  this->Point = this->Storage->Point.GetData();\n  \/\/ Defaults to 12pt text, with top, right alignment to the specified point.\n  this->LabelProperties = vtkSmartPointer<vtkTextProperty>::New();\n  this->LabelProperties->SetFontSize(12);\n  this->LabelProperties->SetColor(0.0, 0.0, 0.0);\n  this->LabelProperties->SetJustificationToLeft();\n  this->LabelProperties->SetVerticalJustificationToBottom();\n\n  this->Pen = vtkSmartPointer<vtkPen>::New();\n  this->Pen->SetColor(0, 0, 0);\n  this->Brush = vtkSmartPointer<vtkBrush>::New();\n  this->Brush->SetColor(255, 255, 255, 255);\n  this->HorizontalAlignment = vtkChartLegend::RIGHT;\n  this->VerticalAlignment = vtkChartLegend::TOP;\n\n  this->Padding = 5;\n  this->SymbolWidth = 25;\n  this->Inline = true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkChartLegend::~vtkChartLegend()\n{\n  delete this->Storage;\n  this->Storage = NULL;\n  this->Point = NULL;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::Update()\n{\n  this->Storage->ActivePlots.clear();\n  for (int i = 0; i < this->Storage->Chart->GetNumberOfPlots(); ++i)\n    {\n    if (this->Storage->Chart->GetPlot(i)->GetVisible()\n        && this->Storage->Chart->GetPlot(i)->GetLabel().length() > 0)\n      {\n      this->Storage->ActivePlots.push_back(this->Storage->Chart->GetPlot(i));\n      }\n    \/\/ If we have a plot with multiple labels, we generally only want to show\n    \/\/ the labels\/legend symbols for the first one. So truncate at the first\n    \/\/ one we encounter.\n    if (this->Storage->Chart->GetPlot(i)->GetLabels() &&\n        this->Storage->Chart->GetPlot(i)->GetLabels()->GetNumberOfTuples() > 1)\n      {\n      break;\n      }\n    }\n  this->PlotTime.Modified();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartLegend::Paint(vtkContext2D *painter)\n{\n  \/\/ This is where everything should be drawn, or dispatched to other methods.\n  vtkDebugMacro(<< \"Paint event called in vtkChartLegend.\");\n\n  if (!this->Visible)\n    {\n    return true;\n    }\n\n  this->GetBoundingRect(painter);\n\n  \/\/ Now draw a box for the legend.\n  painter->ApplyPen(this->Pen);\n  painter->ApplyBrush(this->Brush);\n  painter->DrawRect(this->Rect.X(), this->Rect.Y(),\n                    this->Rect.Width(), this->Rect.Height());\n\n  painter->ApplyTextProp(this->LabelProperties);\n\n  vtkVector2f stringBounds[2];\n  painter->ComputeStringBounds(\"Tgyf\", stringBounds->GetData());\n  float height = stringBounds[1].GetY();\n  painter->ComputeStringBounds(\"The\", stringBounds->GetData());\n  float baseHeight = stringBounds[1].GetY();\n\n  vtkVector2f pos(this->Rect.X() + this->Padding + this->SymbolWidth,\n                  this->Rect.Y() + this->Rect.Height() - this->Padding - floor(height));\n  vtkRectf rect(this->Rect.X() + this->Padding, pos.Y(),\n               this->SymbolWidth-3, ceil(height));\n\n  \/\/ Draw all of the legend labels and marks\n  for(size_t i = 0; i < this->Storage->ActivePlots.size(); ++i)\n    {\n    vtkStringArray *labels = this->Storage->ActivePlots[i]->GetLabels();\n    for (vtkIdType l = 0; labels && (l < labels->GetNumberOfValues()); ++l)\n      {\n      \/\/ This is fairly hackish, but gets the text looking reasonable...\n      \/\/ Calculate a height for a \"normal\" string, then if this height is greater\n      \/\/ that offset is used to move it down. Effectively hacking in a text\n      \/\/ base line until better support is in the text rendering code...\n      \/\/ There are still several one pixel glitches, but it looks better than\n      \/\/ using the default vertical alignment. FIXME!\n      vtkStdString testString = labels->GetValue(l);\n      testString += \"T\";\n      painter->ComputeStringBounds(testString, stringBounds->GetData());\n      painter->DrawString(pos.X(), rect.Y() + (baseHeight-stringBounds[1].Y()),\n                          labels->GetValue(l));\n\n      \/\/ Paint the legend mark and increment out y value.\n      this->Storage->ActivePlots[i]->PaintLegend(painter, rect, l);\n      rect.SetY(rect.Y() - height - this->Padding);\n      }\n    }\n\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkRectf vtkChartLegend::GetBoundingRect(vtkContext2D *painter)\n{\n  if (this->RectTime > this->GetMTime() && this->RectTime > this->PlotTime)\n    {\n    return this->Rect;\n    }\n\n  painter->ApplyTextProp(this->LabelProperties);\n\n  vtkVector2f stringBounds[2];\n  painter->ComputeStringBounds(\"Tgyf\", stringBounds->GetData());\n  float height = stringBounds[1].GetY();\n  float maxWidth = 0.0f;\n\n  \/\/ Calculate the widest legend label - needs the context to calculate font\n  \/\/ metrics, but these could be cached.\n  for(size_t i = 0; i < this->Storage->ActivePlots.size(); ++i)\n    {\n    vtkStringArray *labels = this->Storage->ActivePlots[i]->GetLabels();\n    for (vtkIdType l = 0; labels && (l < labels->GetNumberOfTuples()); ++l)\n      {\n      painter->ComputeStringBounds(labels->GetValue(l),\n                                   stringBounds->GetData());\n      if (stringBounds[1].X() > maxWidth)\n        {\n        maxWidth = stringBounds[1].X();\n        }\n      }\n    }\n\n  \/\/ Figure out the size of the legend box and store locally.\n  int numLabels = 0;\n  for(size_t i = 0; i < this->Storage->ActivePlots.size(); ++i)\n    {\n    numLabels += this->Storage->ActivePlots[i]->GetNumberOfLabels();\n    }\n\n  \/\/ Default point placement is bottom left.\n  this->Rect = vtkRectf(floor(this->Storage->Point.X()),\n                        floor(this->Storage->Point.Y()),\n                        ceil(maxWidth + 2 * this->Padding + this->SymbolWidth),\n                        ceil((numLabels * (height + this->Padding)) + this->Padding));\n\n  this->RectTime.Modified();\n  return this->Rect;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::SetPoint(const vtkVector2f &point)\n{\n  this->Storage->Point = point;\n  this->Modified();\n}\n\n\/\/-----------------------------------------------------------------------------\nconst vtkVector2f& vtkChartLegend::GetPointVector()\n{\n  return this->Storage->Point;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::SetLabelSize(int size)\n{\n  this->LabelProperties->SetFontSize(size);\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkChartLegend::GetLabelSize()\n{\n  return this->LabelProperties->GetFontSize();\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkTextProperty * vtkChartLegend::GetLabelProperties()\n{\n  return this->LabelProperties;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::SetChart(vtkChart* chart)\n{\n  if (this->Storage->Chart == chart)\n    {\n    return;\n    }\n  else\n    {\n    this->Storage->Chart = chart;\n    this->Modified();\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkChart* vtkChartLegend::GetChart()\n{\n  return this->Storage->Chart;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartLegend::PrintSelf(ostream &os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"MainMenuLayer.h\"\n#include \"cocostudio\/CocoStudio.h\"\n\nUSING_NS_CC;\n\n\nint MainMenuLayer::s_iCurrentGold = 0;\n\nMainMenuLayer::MainMenuLayer()\n{\n}\n\nMainMenuLayer::~MainMenuLayer()\n{\n}\n\nbool MainMenuLayer::init()\n{\n\tif (!Layer::init())\n\t{\n\t\treturn false;\n\t}\n\tauto widget = cocostudio::GUIReader::getInstance()->widgetFromJsonFile(\"HUD\/HUD.json\");\n\tpGoldText = (ui::TextAtlas *)widget->getChildByName(\"gold\");\n\tpGoldText->setStringValue(\"0\");\n\tthis->addChild(widget,100);\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(MainMenuLayer::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, 100);\n\n\n\tauto label = Label::createWithTTF(\"Game Parkour\", \"fonts\/Marker Felt.ttf\", 24);\n\tlabel->setPosition(Vec2(origin.x + visibleSize.width \/ 2,\n\t\torigin.y + visibleSize.height - label->getContentSize().height));\n\n\tthis->addChild(label,100);\n\n\t\/\/this->scheduleUpdate();\n\n\treturn true;\n}\n\nvoid MainMenuLayer::menuCloseCallback(Ref* pSender)\n{\n\tDirector::getInstance()->end();\n\n#if (CC_TARGET_PLATFORM == CC_PLATFORM_IOS)\n\texit(0);\n#endif\n}\n\nvoid MainMenuLayer::update(float delta)\n{\n\n}<commit_msg>finished pause button func<commit_after>#include \"MainMenuLayer.h\"\n#include \"cocostudio\/CocoStudio.h\"\n#include \"ui\/UIButton.h\"\n\nUSING_NS_CC;\n\n\nint MainMenuLayer::s_iCurrentGold = 0;\n\nMainMenuLayer::MainMenuLayer()\n{\n}\n\nMainMenuLayer::~MainMenuLayer()\n{\n}\n\nbool MainMenuLayer::init()\n{\n\tif (!Layer::init())\n\t{\n\t\treturn false;\n\t}\n\tauto widget = cocostudio::GUIReader::getInstance()->widgetFromJsonFile(\"HUD\/HUD.json\");\n\tpGoldText = (ui::TextAtlas *)widget->getChildByName(\"gold\");\n\tpGoldText->setString(\"0\");\n\tthis->addChild(widget,100);\n\n\tauto pauseButton = static_cast<cocos2d::ui::Button *>(widget->getChildByName(\"Button_1\"));\n\tpauseButton->addTouchEventListener(\n\t\t[&](Ref * sender,cocos2d::ui::Widget::TouchEventType type)\n\t\t{\n\t\t\tstatic bool bIsPaused = false;\n\t\t\tif (type == cocos2d::ui::Widget::TouchEventType::ENDED)\n\t\t\t{\n\t\t\t\tif (bIsPaused)\n\t\t\t\t{\n\t\t\t\t\tbIsPaused = false;\n\t\t\t\t\tDirector::getInstance()->resume();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tDirector::getInstance()->pause();\n\t\t\t\t\tbIsPaused = true;\n\t\t\t\t}\n\t\t\t}\/\/if_type\n\t\t\t\n\t\t}\/\/lambdy\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(MainMenuLayer::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, 100);\n\n\n\tauto label = Label::createWithTTF(\"Game Parkour\", \"fonts\/Marker Felt.ttf\", 24);\n\tlabel->setPosition(Vec2(origin.x + visibleSize.width \/ 2,\n\t\torigin.y + visibleSize.height - label->getContentSize().height));\n\n\tthis->addChild(label,100);\n\n\t\/\/this->scheduleUpdate();\n\n\treturn true;\n}\n\nvoid MainMenuLayer::menuCloseCallback(Ref* pSender)\n{\n\tDirector::getInstance()->end();\n\n#if (CC_TARGET_PLATFORM == CC_PLATFORM_IOS)\n\texit(0);\n#endif\n}\n\nvoid MainMenuLayer::update(float delta)\n{\n\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n *  cpptest       libcaca++ rendering test\n *  Copyright (c) 2006 Jean-Yves Lamoureux <jylam@lnxscene.org>\n *                All Rights Reserved\n *\n *  $Id$\n *\n *  This program is free software; you can redistribute it and\/or\n *  modify it under the terms of the Do What The Fuck You Want To\n *  Public License, Version 2, as published by Sam Hocevar. See\n *  http:\/\/sam.zoy.org\/wtfpl\/COPYING for more details.\n *\/\n\n#include \"config.h\"\n\n#include <iostream>\n\n#include <cucul++.h>\n#include <caca++.h>\n\nusing namespace std;\n\n\nstatic char const *pig[]= {\n    \"                                   \",\n    \"                             _     \",\n    \"    _._ _..._ .-',     _.._(`))    \",\n    \"   '-. `     '  \/-._.-'    ',\/     \",\n    \"      )         \\\\            '.    \",\n    \"     \/ _    _    |             \\\\   \",\n    \"    |  a    a    \/              |  \",\n    \"    \\\\   .-.                     ;  \" ,\n    \"     '-('' ).-'       ,'       ;   \",\n    \"        '-;           |      .'    \",\n    \"           \\\\           \\\\    \/      \",\n    \"           | 7  .__  _.-\\\\   \\\\      \",\n    \"           | |  |  ``\/  \/`  \/      \",\n    \"      jgs \/,_|  |   \/,_\/   \/       \",\n    \"             \/,_\/      '`-'        \",\n    \"                                   \",\n NULL\n};\n\nint main(int argc, char *argv[])\n{\n    Cucul *qq;\n    Caca  *kk;\n    Event ev;\n\n    int x = 0, y = 0, ix = 1, iy = 1;\n\n\n\n    try {\n        qq = new Cucul();\n    }\n    catch (int e) {\n        cerr << \"Error while initializing cucul (\" << e << \")\" << endl;\n        return -1;\n    }\n\n    try {\n        kk = new Caca(qq);\n    }\n    catch(int e) {\n        cerr << \"Error while attaching cucul to caca (\" << e << \")\" << endl;\n        return -1;\n    }\n\n    kk->setDisplayTime(20000);\n\n    while(!kk->getEvent(ev.CACA_EVENT_KEY_PRESS, &ev, 0)) {\n\n        \/* Draw pig *\/\n        qq->setColorANSI(CUCUL_LIGHTMAGENTA, CUCUL_BLACK);\n\n        for(int i = 0; pig[i]; i++)\n            qq->putStr(x, y+i, (char*)pig[i]);\n\n        \/* printf works *\/\n        qq->setColorANSI(CUCUL_LIGHTBLUE, CUCUL_BLACK);\n        qq->Printf((qq->getWidth()\/2) - 10 ,qq->getHeight()\/2, \"Powered by libcaca %s\", VERSION);\n\n        \/* Blit *\/\n        kk->Display();\n        qq->Clear();\n\n        x+=ix;\n        y+=iy;\n\n        if(x>=(qq->getWidth()-35)  || x<0 )\n            ix=-ix;\n        if(y>=(qq->getHeight()-15)   || y<0 )\n            iy=-iy;\n\n\n    }\n\n\n    delete kk;\n    delete qq;\n\n    return 0;\n}\n<commit_msg>  * Use the import function to load the pig image in cxxtest.<commit_after>\/*\n *  cpptest       libcaca++ rendering test\n *  Copyright (c) 2006 Jean-Yves Lamoureux <jylam@lnxscene.org>\n *                All Rights Reserved\n *\n *  $Id$\n *\n *  This program is free software; you can redistribute it and\/or\n *  modify it under the terms of the Do What The Fuck You Want To\n *  Public License, Version 2, as published by Sam Hocevar. See\n *  http:\/\/sam.zoy.org\/wtfpl\/COPYING for more details.\n *\/\n\n#include \"config.h\"\n\n#include <iostream>\n\n#include <cucul++.h>\n#include <caca++.h>\n\nusing namespace std;\n\n\nstatic char const pigstring[] =\n    \"                                   \\n\"\n    \"                             _     \\n\"\n    \"    _._ _..._ .-',     _.._(`))    \\n\"\n    \"   '-. `     '  \/-._.-'    ',\/     \\n\"\n    \"      )         \\\\            '.    \\n\"\n    \"     \/ _    _    |             \\\\   \\n\"\n    \"    |  a    a    \/              |  \\n\"\n    \"    \\\\   .-.                     ;  \\n\"\n    \"     '-('' ).-'       ,'       ;   \\n\"\n    \"        '-;           |      .'    \\n\"\n    \"           \\\\           \\\\    \/      \\n\"\n    \"           | 7  .__  _.-\\\\   \\\\      \\n\"\n    \"           | |  |  ``\/  \/`  \/      \\n\"\n    \"      jgs \/,_|  |   \/,_\/   \/       \\n\"\n    \"             \/,_\/      '`-'        \\n\";\n\nint main(int argc, char *argv[])\n{\n    Cucul *qq, *pig;\n    Caca  *kk;\n    Event ev;\n\n    int x = 0, y = 0, ix = 1, iy = 1;\n\n    try {\n        qq = new Cucul();\n    }\n    catch (int e) {\n        cerr << \"Error while initializing cucul (\" << e << \")\" << endl;\n        return -1;\n    }\n\n    try {\n        kk = new Caca(qq);\n    }\n    catch(int e) {\n        cerr << \"Error while attaching cucul to caca (\" << e << \")\" << endl;\n        return -1;\n    }\n\n    try {\n        \/\/ Import buffer into a canvas\n        Buffer *buf = new Buffer();\n        buf->loadMemory((void *)pigstring, strlen(pigstring));\n        pig = new Cucul(buf, \"text\");\n        delete buf;\n        \/\/ Change colour to magenta\n        pig->setColorANSI(CUCUL_LIGHTMAGENTA, CUCUL_TRANSPARENT);\n        for(int y = 0; y < pig->getHeight(); y++)\n            for(int x = 0; x < pig->getWidth(); x++)\n                pig->putChar(x, y, pig->getChar(x, y));\n    }\n    catch(int e) {\n        cerr << \"Error while importing image (\" << e << \")\" << endl;\n        return -1;\n    }\n\n    kk->setDisplayTime(20000);\n\n    while(!kk->getEvent(ev.CACA_EVENT_KEY_PRESS, &ev, 0)) {\n\n        qq->Clear();\n\n        \/* Draw pig *\/\n        qq->Blit(x, y, pig, NULL);\n\n        \/* printf works *\/\n        qq->setColorANSI(CUCUL_LIGHTBLUE, CUCUL_BLACK);\n        qq->Printf(qq->getWidth() \/ 2 - 10, qq->getHeight() \/ 2,\n                   \"Powered by libcaca %s\", VERSION);\n\n        \/* Blit *\/\n        kk->Display();\n\n        x += ix;\n        y += iy;\n\n        if(x + pig->getWidth() >= qq->getWidth() || x < 0 )\n            ix = -ix;\n        if(y + pig->getHeight() >= qq->getHeight() || y < 0 )\n            iy = -iy;\n    }\n\n    delete kk;\n    delete qq;\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <jni.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <time.h>\n#include <locale.h>\n\n#include <mpv\/client.h>\n#include <mpv\/opengl_cb.h>\n\n#include <EGL\/egl.h>\n\nextern \"C\" {\n    #include <libavcodec\/jni.h>\n}\n\n#include \"main.h\"\n\n#define ARRAYLEN(a) (sizeof(a)\/sizeof(a[0]))\n#define jni_func_name(name) Java_is_xyz_mpv_MPVLib_##name\n#define jni_func(return_type, name, ...) JNIEXPORT return_type JNICALL jni_func_name(name) (JNIEnv *env, jobject obj, ##__VA_ARGS__)\n\nextern \"C\" {\n    jni_func(void, create);\n    jni_func(void, init);\n    jni_func(void, destroy);\n\n    jni_func(void, initGL);\n    jni_func(void, destroyGL);\n\n    jni_func(void, command, jobjectArray jarray);\n\n    jni_func(void, resize, jint width, jint height);\n    jni_func(void, draw);\n    jni_func(void, step);\n\n    jni_func(jint, setOptionString, jstring option, jstring value);\n\n    jni_func(jobject, getPropertyInt, jstring property);\n    jni_func(void, setPropertyInt, jstring property, jobject value);\n    jni_func(jobject, getPropertyBoolean, jstring property);\n    jni_func(void, setPropertyBoolean, jstring property, jobject value);\n    jni_func(jstring, getPropertyString, jstring jproperty);\n    jni_func(void, setPropertyString, jstring jproperty, jstring jvalue);\n\n    jni_func(void, observeProperty, jstring property, jint format);\n};\n\nmpv_handle *mpv;\nmpv_opengl_cb_context *mpv_gl;\nint g_width, g_height;\n\nstatic void die(const char *msg)\n{\n    ALOGE(\"%s\", msg);\n    exit(1);\n}\n\nstatic void *get_proc_address_mpv(void *fn_ctx, const char *name)\n{\n    return (void*)eglGetProcAddress(name);\n}\n\n\/\/ Apparently it's considered slow to FindClass and GetMethodID every time we need them,\n\/\/ so let's have a nice cache here\nbool methods_initialized;\njclass java_Integer, java_Boolean;\njmethodID java_Integer_init, java_Integer_intValue, java_Boolean_init, java_Boolean_booleanValue;\n\nstatic void init_methods_cache(JNIEnv *env) {\n    if (methods_initialized)\n        return;\n    #define FIND_CLASS(name) reinterpret_cast<jclass>(env->NewGlobalRef(env->FindClass(name)))\n    java_Integer = FIND_CLASS(\"java\/lang\/Integer\");\n    java_Integer_init = env->GetMethodID(java_Integer, \"<init>\", \"(I)V\");\n    java_Integer_intValue = env->GetMethodID(java_Integer, \"intValue\", \"()I\");\n    java_Boolean = FIND_CLASS(\"java\/lang\/Boolean\");\n    java_Boolean_init = env->GetMethodID(java_Boolean, \"<init>\", \"(Z)V\");\n    java_Boolean_booleanValue = env->GetMethodID(java_Boolean, \"booleanValue\", \"()Z\");\n    #undef FIND_CLASS\n    methods_initialized = true;\n}\n\nstatic void prepare_environment(JNIEnv *env) {\n    setlocale(LC_NUMERIC, \"C\");\n\n    JavaVM* vm = NULL;\n\n    if (!env->GetJavaVM(&vm) && vm) {\n        av_jni_set_java_vm(vm, NULL);\n    }\n    init_methods_cache(env);\n}\n\njni_func(void, create) {\n    prepare_environment(env);\n\n    if (mpv)\n        die(\"mpv is already initialized\");\n\n    mpv = mpv_create();\n    if (!mpv)\n        die(\"context init failed\");\n}\n\njni_func(void, init) {\n    if (!mpv)\n        die(\"mpv is not created\");\n\n    if (mpv_initialize(mpv) < 0)\n        die(\"mpv init failed\");\n\n    mpv_request_log_messages(mpv, \"v\");\n}\n\njni_func(void, destroy) {\n    if (!mpv)\n        die(\"mpv destroy called but it's already destroyed\");\n    mpv_terminate_destroy(mpv);\n    mpv = NULL;\n}\n\njni_func(void, initGL) {\n    int ret = -1;\n    if (!mpv)\n        die(\"initGL: mpv not initialized\");\n    if (mpv_gl)\n        die(\"OpenGL ES already initialized!?\");\n\n    mpv_gl = (mpv_opengl_cb_context*)mpv_get_sub_api(mpv, MPV_SUB_API_OPENGL_CB);\n    if (!mpv_gl)\n        die(\"failed to create mpv GL API handle\");\n\n    if ((ret = mpv_opengl_cb_init_gl(mpv_gl, NULL, get_proc_address_mpv, NULL)) < 0) {\n        ALOGE(\"mpv_opengl_cb_init_gl returned error %d\", ret);\n        die(\"failed to initialize mpv GL context\");\n    }\n}\n\njni_func(void, destroyGL) {\n    if (!mpv_gl)\n        die(\"mpv_gl destroy called but it's already destroyed\");\n    mpv_opengl_cb_uninit_gl(mpv_gl);\n    mpv_gl = NULL;\n}\n\njni_func(void, command, jobjectArray jarray) {\n    const char *arguments[128] = { 0 };\n    int len = env->GetArrayLength(jarray);\n    if (!mpv)\n        die(\"Cannot run command: mpv is not initialized\");\n    if (len >= ARRAYLEN(arguments))\n        die(\"Cannot run command: too many arguments\");\n\n    for (int i = 0; i < len; ++i)\n        arguments[i] = env->GetStringUTFChars((jstring)env->GetObjectArrayElement(jarray, i), NULL);\n\n    mpv_command(mpv, arguments);\n\n    for (int i = 0; i < len; ++i)\n        env->ReleaseStringUTFChars((jstring)env->GetObjectArrayElement(jarray, i), arguments[i]);\n}\n\njni_func(void, resize, jint width, jint height) {\n    ALOGV(\"Resizing! width: %d=>%d, %d=>%d\\n\", g_width, width, g_height, height);\n    g_width = width;\n    g_height = height;\n}\n\njni_func(void, draw) {\n    mpv_opengl_cb_draw(mpv_gl, 0, g_width, -g_height);\n}\n\nvoid sendPropertyUpdateToJava(JNIEnv *env, mpv_event_property *prop) {\n    jmethodID mid;\n    jstring jprop = env->NewStringUTF(prop->name);\n    jclass clazz = env->FindClass(\"is\/xyz\/mpv\/MPVLib\");\n    jstring jvalue = NULL;\n    switch (prop->format) {\n    case MPV_FORMAT_NONE:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;)V\"); \/\/ eventProperty(String)\n        env->CallStaticVoidMethod(clazz, mid, jprop);\n        break;\n    case MPV_FORMAT_FLAG:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;Z)V\"); \/\/ eventProperty(String, boolean)\n        env->CallStaticVoidMethod(clazz, mid, jprop, *(int*)prop->data);\n        break;\n    case MPV_FORMAT_INT64:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;J)V\"); \/\/ eventProperty(String, long)\n        env->CallStaticVoidMethod(clazz, mid, jprop, *(int64_t*)prop->data);\n        break;\n    case MPV_FORMAT_STRING:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\"); \/\/ eventProperty(String, String)\n        jvalue = env->NewStringUTF(*(const char**)prop->data);\n        env->CallStaticVoidMethod(clazz, mid, jprop, jvalue);\n        break;\n    }\n}\n\nstatic void sendEventToJava(JNIEnv *env, int event) {\n    jclass clazz = env->FindClass(\"is\/xyz\/mpv\/MPVLib\");\n    jmethodID mid = env->GetStaticMethodID(clazz, \"event\", \"(I)V\"); \/\/ event(int)\n    env->CallStaticVoidMethod(clazz, mid, event);\n}\n\njni_func(void, step) {\n    while (1) {\n        mpv_event *mp_event = mpv_wait_event(mpv, 0);\n        mpv_event_property *mp_property = NULL;\n        mpv_event_log_message *msg = NULL;\n        if (mp_event->event_id == MPV_EVENT_NONE)\n            break;\n        switch (mp_event->event_id) {\n        case MPV_EVENT_LOG_MESSAGE:\n            msg = (mpv_event_log_message*)mp_event->data;\n            ALOGV(\"[%s:%s] %s\", msg->prefix, msg->level, msg->text);\n            break;\n        case MPV_EVENT_PROPERTY_CHANGE:\n            mp_property = (mpv_event_property*)mp_event->data;\n            sendPropertyUpdateToJava(env, mp_property);\n            break;\n        default:\n            ALOGV(\"event: %s\\n\", mpv_event_name(mp_event->event_id));\n            sendEventToJava(env, mp_event->event_id);\n            break;\n        }\n    }\n}\n\njni_func(jint, setOptionString, jstring joption, jstring jvalue) {\n    if (!mpv)\n        die(\"mpv is not initialized\");\n\n    const char *option = env->GetStringUTFChars(joption, NULL);\n    const char *value = env->GetStringUTFChars(jvalue, NULL);\n\n    int result = mpv_set_option_string(mpv, option, value);\n\n    env->ReleaseStringUTFChars(joption, option);\n    env->ReleaseStringUTFChars(jvalue, value);\n\n    return result;\n}\n\nstatic int common_get_property(JNIEnv *env, jstring jproperty, mpv_format format, void *output) {\n    if (!mpv)\n        die(\"get_property called but mpv is not initialized\");\n\n    const char *prop = env->GetStringUTFChars(jproperty, NULL);\n    int result = mpv_get_property(mpv, prop, format, output);\n    if (result < 0)\n        ALOGE(\"mpv_get_property(%s) format %d returned error %s\", prop, format, mpv_error_string(result));\n    env->ReleaseStringUTFChars(jproperty, prop);\n\n    return result;\n}\n\nstatic int common_set_property(JNIEnv *env, jstring jproperty, mpv_format format, void *value) {\n    if (!mpv)\n        die(\"set_property called but mpv is not initialized\");\n\n    const char *prop = env->GetStringUTFChars(jproperty, NULL);\n    int result = mpv_set_property(mpv, prop, format, value);\n    if (result < 0)\n        ALOGE(\"mpv_set_property(%s, %p) format %d returned error %s\", prop, value, format, mpv_error_string(result));\n    env->ReleaseStringUTFChars(jproperty, prop);\n\n    return result;\n}\n\njni_func(jobject, getPropertyInt, jstring jproperty) {\n    int64_t value = 0;\n    if (common_get_property(env, jproperty, MPV_FORMAT_INT64, &value) < 0)\n        return NULL;\n    return env->NewObject(java_Integer, java_Integer_init, (jint)value);\n}\n\njni_func(jobject, getPropertyBoolean, jstring jproperty) {\n    int value = 0;\n    if (common_get_property(env, jproperty, MPV_FORMAT_FLAG, &value) < 0)\n        return NULL;\n    return env->NewObject(java_Boolean, java_Boolean_init, (jboolean)value);\n}\n\njni_func(jstring, getPropertyString, jstring jproperty) {\n    char *value;\n    if (common_get_property(env, jproperty, MPV_FORMAT_STRING, &value) < 0)\n        return NULL;\n    jstring jvalue = env->NewStringUTF(value);\n    mpv_free(value);\n    return jvalue;\n}\n\njni_func(void, setPropertyInt, jstring jproperty, jobject jvalue) {\n    int64_t value = env->CallIntMethod(jvalue, java_Integer_intValue);\n    common_set_property(env, jproperty, MPV_FORMAT_INT64, &value);\n}\n\njni_func(void, setPropertyBoolean, jstring jproperty, jobject jvalue) {\n    int value = env->CallBooleanMethod(jvalue, java_Boolean_booleanValue);\n    common_set_property(env, jproperty, MPV_FORMAT_FLAG, &value);\n}\n\njni_func(void, setPropertyString, jstring jproperty, jstring jvalue) {\n    const char *value = env->GetStringUTFChars(jvalue, NULL);\n    common_set_property(env, jproperty, MPV_FORMAT_STRING, &value);\n    env->ReleaseStringUTFChars(jvalue, value);\n}\n\njni_func(void, observeProperty, jstring property, jint format) {\n    if (!mpv)\n        die(\"mpv is not initialized\");\n    const char *prop = env->GetStringUTFChars(property, NULL);\n    mpv_observe_property(mpv, 0, prop, (mpv_format)format);\n    env->ReleaseStringUTFChars(property, prop);\n}\n<commit_msg>main: move mpv logging enabler to mpv context creation<commit_after>#include <jni.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <time.h>\n#include <locale.h>\n\n#include <mpv\/client.h>\n#include <mpv\/opengl_cb.h>\n\n#include <EGL\/egl.h>\n\nextern \"C\" {\n    #include <libavcodec\/jni.h>\n}\n\n#include \"main.h\"\n\n#define ARRAYLEN(a) (sizeof(a)\/sizeof(a[0]))\n#define jni_func_name(name) Java_is_xyz_mpv_MPVLib_##name\n#define jni_func(return_type, name, ...) JNIEXPORT return_type JNICALL jni_func_name(name) (JNIEnv *env, jobject obj, ##__VA_ARGS__)\n\nextern \"C\" {\n    jni_func(void, create);\n    jni_func(void, init);\n    jni_func(void, destroy);\n\n    jni_func(void, initGL);\n    jni_func(void, destroyGL);\n\n    jni_func(void, command, jobjectArray jarray);\n\n    jni_func(void, resize, jint width, jint height);\n    jni_func(void, draw);\n    jni_func(void, step);\n\n    jni_func(jint, setOptionString, jstring option, jstring value);\n\n    jni_func(jobject, getPropertyInt, jstring property);\n    jni_func(void, setPropertyInt, jstring property, jobject value);\n    jni_func(jobject, getPropertyBoolean, jstring property);\n    jni_func(void, setPropertyBoolean, jstring property, jobject value);\n    jni_func(jstring, getPropertyString, jstring jproperty);\n    jni_func(void, setPropertyString, jstring jproperty, jstring jvalue);\n\n    jni_func(void, observeProperty, jstring property, jint format);\n};\n\nmpv_handle *mpv;\nmpv_opengl_cb_context *mpv_gl;\nint g_width, g_height;\n\nstatic void die(const char *msg)\n{\n    ALOGE(\"%s\", msg);\n    exit(1);\n}\n\nstatic void *get_proc_address_mpv(void *fn_ctx, const char *name)\n{\n    return (void*)eglGetProcAddress(name);\n}\n\n\/\/ Apparently it's considered slow to FindClass and GetMethodID every time we need them,\n\/\/ so let's have a nice cache here\nbool methods_initialized;\njclass java_Integer, java_Boolean;\njmethodID java_Integer_init, java_Integer_intValue, java_Boolean_init, java_Boolean_booleanValue;\n\nstatic void init_methods_cache(JNIEnv *env) {\n    if (methods_initialized)\n        return;\n    #define FIND_CLASS(name) reinterpret_cast<jclass>(env->NewGlobalRef(env->FindClass(name)))\n    java_Integer = FIND_CLASS(\"java\/lang\/Integer\");\n    java_Integer_init = env->GetMethodID(java_Integer, \"<init>\", \"(I)V\");\n    java_Integer_intValue = env->GetMethodID(java_Integer, \"intValue\", \"()I\");\n    java_Boolean = FIND_CLASS(\"java\/lang\/Boolean\");\n    java_Boolean_init = env->GetMethodID(java_Boolean, \"<init>\", \"(Z)V\");\n    java_Boolean_booleanValue = env->GetMethodID(java_Boolean, \"booleanValue\", \"()Z\");\n    #undef FIND_CLASS\n    methods_initialized = true;\n}\n\nstatic void prepare_environment(JNIEnv *env) {\n    setlocale(LC_NUMERIC, \"C\");\n\n    JavaVM* vm = NULL;\n\n    if (!env->GetJavaVM(&vm) && vm) {\n        av_jni_set_java_vm(vm, NULL);\n    }\n    init_methods_cache(env);\n}\n\njni_func(void, create) {\n    prepare_environment(env);\n\n    if (mpv)\n        die(\"mpv is already initialized\");\n\n    mpv = mpv_create();\n    if (!mpv)\n        die(\"context init failed\");\n\n    mpv_request_log_messages(mpv, \"v\");\n}\n\njni_func(void, init) {\n    if (!mpv)\n        die(\"mpv is not created\");\n\n    if (mpv_initialize(mpv) < 0)\n        die(\"mpv init failed\");\n}\n\njni_func(void, destroy) {\n    if (!mpv)\n        die(\"mpv destroy called but it's already destroyed\");\n    mpv_terminate_destroy(mpv);\n    mpv = NULL;\n}\n\njni_func(void, initGL) {\n    int ret = -1;\n    if (!mpv)\n        die(\"initGL: mpv not initialized\");\n    if (mpv_gl)\n        die(\"OpenGL ES already initialized!?\");\n\n    mpv_gl = (mpv_opengl_cb_context*)mpv_get_sub_api(mpv, MPV_SUB_API_OPENGL_CB);\n    if (!mpv_gl)\n        die(\"failed to create mpv GL API handle\");\n\n    if ((ret = mpv_opengl_cb_init_gl(mpv_gl, NULL, get_proc_address_mpv, NULL)) < 0) {\n        ALOGE(\"mpv_opengl_cb_init_gl returned error %d\", ret);\n        die(\"failed to initialize mpv GL context\");\n    }\n}\n\njni_func(void, destroyGL) {\n    if (!mpv_gl)\n        die(\"mpv_gl destroy called but it's already destroyed\");\n    mpv_opengl_cb_uninit_gl(mpv_gl);\n    mpv_gl = NULL;\n}\n\njni_func(void, command, jobjectArray jarray) {\n    const char *arguments[128] = { 0 };\n    int len = env->GetArrayLength(jarray);\n    if (!mpv)\n        die(\"Cannot run command: mpv is not initialized\");\n    if (len >= ARRAYLEN(arguments))\n        die(\"Cannot run command: too many arguments\");\n\n    for (int i = 0; i < len; ++i)\n        arguments[i] = env->GetStringUTFChars((jstring)env->GetObjectArrayElement(jarray, i), NULL);\n\n    mpv_command(mpv, arguments);\n\n    for (int i = 0; i < len; ++i)\n        env->ReleaseStringUTFChars((jstring)env->GetObjectArrayElement(jarray, i), arguments[i]);\n}\n\njni_func(void, resize, jint width, jint height) {\n    ALOGV(\"Resizing! width: %d=>%d, %d=>%d\\n\", g_width, width, g_height, height);\n    g_width = width;\n    g_height = height;\n}\n\njni_func(void, draw) {\n    mpv_opengl_cb_draw(mpv_gl, 0, g_width, -g_height);\n}\n\nvoid sendPropertyUpdateToJava(JNIEnv *env, mpv_event_property *prop) {\n    jmethodID mid;\n    jstring jprop = env->NewStringUTF(prop->name);\n    jclass clazz = env->FindClass(\"is\/xyz\/mpv\/MPVLib\");\n    jstring jvalue = NULL;\n    switch (prop->format) {\n    case MPV_FORMAT_NONE:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;)V\"); \/\/ eventProperty(String)\n        env->CallStaticVoidMethod(clazz, mid, jprop);\n        break;\n    case MPV_FORMAT_FLAG:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;Z)V\"); \/\/ eventProperty(String, boolean)\n        env->CallStaticVoidMethod(clazz, mid, jprop, *(int*)prop->data);\n        break;\n    case MPV_FORMAT_INT64:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;J)V\"); \/\/ eventProperty(String, long)\n        env->CallStaticVoidMethod(clazz, mid, jprop, *(int64_t*)prop->data);\n        break;\n    case MPV_FORMAT_STRING:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\"); \/\/ eventProperty(String, String)\n        jvalue = env->NewStringUTF(*(const char**)prop->data);\n        env->CallStaticVoidMethod(clazz, mid, jprop, jvalue);\n        break;\n    }\n}\n\nstatic void sendEventToJava(JNIEnv *env, int event) {\n    jclass clazz = env->FindClass(\"is\/xyz\/mpv\/MPVLib\");\n    jmethodID mid = env->GetStaticMethodID(clazz, \"event\", \"(I)V\"); \/\/ event(int)\n    env->CallStaticVoidMethod(clazz, mid, event);\n}\n\njni_func(void, step) {\n    while (1) {\n        mpv_event *mp_event = mpv_wait_event(mpv, 0);\n        mpv_event_property *mp_property = NULL;\n        mpv_event_log_message *msg = NULL;\n        if (mp_event->event_id == MPV_EVENT_NONE)\n            break;\n        switch (mp_event->event_id) {\n        case MPV_EVENT_LOG_MESSAGE:\n            msg = (mpv_event_log_message*)mp_event->data;\n            ALOGV(\"[%s:%s] %s\", msg->prefix, msg->level, msg->text);\n            break;\n        case MPV_EVENT_PROPERTY_CHANGE:\n            mp_property = (mpv_event_property*)mp_event->data;\n            sendPropertyUpdateToJava(env, mp_property);\n            break;\n        default:\n            ALOGV(\"event: %s\\n\", mpv_event_name(mp_event->event_id));\n            sendEventToJava(env, mp_event->event_id);\n            break;\n        }\n    }\n}\n\njni_func(jint, setOptionString, jstring joption, jstring jvalue) {\n    if (!mpv)\n        die(\"mpv is not initialized\");\n\n    const char *option = env->GetStringUTFChars(joption, NULL);\n    const char *value = env->GetStringUTFChars(jvalue, NULL);\n\n    int result = mpv_set_option_string(mpv, option, value);\n\n    env->ReleaseStringUTFChars(joption, option);\n    env->ReleaseStringUTFChars(jvalue, value);\n\n    return result;\n}\n\nstatic int common_get_property(JNIEnv *env, jstring jproperty, mpv_format format, void *output) {\n    if (!mpv)\n        die(\"get_property called but mpv is not initialized\");\n\n    const char *prop = env->GetStringUTFChars(jproperty, NULL);\n    int result = mpv_get_property(mpv, prop, format, output);\n    if (result < 0)\n        ALOGE(\"mpv_get_property(%s) format %d returned error %s\", prop, format, mpv_error_string(result));\n    env->ReleaseStringUTFChars(jproperty, prop);\n\n    return result;\n}\n\nstatic int common_set_property(JNIEnv *env, jstring jproperty, mpv_format format, void *value) {\n    if (!mpv)\n        die(\"set_property called but mpv is not initialized\");\n\n    const char *prop = env->GetStringUTFChars(jproperty, NULL);\n    int result = mpv_set_property(mpv, prop, format, value);\n    if (result < 0)\n        ALOGE(\"mpv_set_property(%s, %p) format %d returned error %s\", prop, value, format, mpv_error_string(result));\n    env->ReleaseStringUTFChars(jproperty, prop);\n\n    return result;\n}\n\njni_func(jobject, getPropertyInt, jstring jproperty) {\n    int64_t value = 0;\n    if (common_get_property(env, jproperty, MPV_FORMAT_INT64, &value) < 0)\n        return NULL;\n    return env->NewObject(java_Integer, java_Integer_init, (jint)value);\n}\n\njni_func(jobject, getPropertyBoolean, jstring jproperty) {\n    int value = 0;\n    if (common_get_property(env, jproperty, MPV_FORMAT_FLAG, &value) < 0)\n        return NULL;\n    return env->NewObject(java_Boolean, java_Boolean_init, (jboolean)value);\n}\n\njni_func(jstring, getPropertyString, jstring jproperty) {\n    char *value;\n    if (common_get_property(env, jproperty, MPV_FORMAT_STRING, &value) < 0)\n        return NULL;\n    jstring jvalue = env->NewStringUTF(value);\n    mpv_free(value);\n    return jvalue;\n}\n\njni_func(void, setPropertyInt, jstring jproperty, jobject jvalue) {\n    int64_t value = env->CallIntMethod(jvalue, java_Integer_intValue);\n    common_set_property(env, jproperty, MPV_FORMAT_INT64, &value);\n}\n\njni_func(void, setPropertyBoolean, jstring jproperty, jobject jvalue) {\n    int value = env->CallBooleanMethod(jvalue, java_Boolean_booleanValue);\n    common_set_property(env, jproperty, MPV_FORMAT_FLAG, &value);\n}\n\njni_func(void, setPropertyString, jstring jproperty, jstring jvalue) {\n    const char *value = env->GetStringUTFChars(jvalue, NULL);\n    common_set_property(env, jproperty, MPV_FORMAT_STRING, &value);\n    env->ReleaseStringUTFChars(jvalue, value);\n}\n\njni_func(void, observeProperty, jstring property, jint format) {\n    if (!mpv)\n        die(\"mpv is not initialized\");\n    const char *prop = env->GetStringUTFChars(property, NULL);\n    mpv_observe_property(mpv, 0, prop, (mpv_format)format);\n    env->ReleaseStringUTFChars(property, prop);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <jni.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <time.h>\n#include <locale.h>\n\n#include <mpv\/client.h>\n#include <mpv\/opengl_cb.h>\n\n#include <EGL\/egl.h>\n\nextern \"C\" {\n    #include <libavcodec\/jni.h>\n}\n\n#include \"main.h\"\n\nextern void android_content_init(JNIEnv *env, jobject appctx);\nextern void android_content_register(mpv_handle *mpv);\n\n#define ARRAYLEN(a) (sizeof(a)\/sizeof(a[0]))\n#define jni_func_name(name) Java_is_xyz_mpv_MPVLib_##name\n#define jni_func(return_type, name, ...) JNIEXPORT return_type JNICALL jni_func_name(name) (JNIEnv *env, jobject obj, ##__VA_ARGS__)\n\nextern \"C\" {\n    jni_func(void, create, jobject appctx);\n    jni_func(void, init);\n    jni_func(void, destroy);\n\n    jni_func(void, initGL, jobject view);\n    jni_func(void, destroyGL);\n\n    jni_func(void, command, jobjectArray jarray);\n\n    jni_func(void, resize, jint width, jint height);\n    jni_func(void, draw);\n    jni_func(void, step);\n\n    jni_func(jint, setOptionString, jstring option, jstring value);\n\n    jni_func(jobject, getPropertyInt, jstring property);\n    jni_func(void, setPropertyInt, jstring property, jobject value);\n    jni_func(jobject, getPropertyBoolean, jstring property);\n    jni_func(void, setPropertyBoolean, jstring property, jobject value);\n    jni_func(jstring, getPropertyString, jstring jproperty);\n    jni_func(void, setPropertyString, jstring jproperty, jstring jvalue);\n\n    jni_func(void, observeProperty, jstring property, jint format);\n};\n\nmpv_handle *mpv;\nmpv_opengl_cb_context *mpv_gl;\nint g_width, g_height;\n\nstatic void die(const char *msg)\n{\n    ALOGE(\"%s\", msg);\n    exit(1);\n}\n\nstatic void *get_proc_address_mpv(void *fn_ctx, const char *name)\n{\n    return (void*)eglGetProcAddress(name);\n}\n\n\/\/ Apparently it's considered slow to FindClass and GetMethodID every time we need them,\n\/\/ so let's have a nice cache here\nbool methods_initialized;\njclass java_Integer, java_Boolean;\njmethodID java_Integer_init, java_Integer_intValue, java_Boolean_init, java_Boolean_booleanValue;\njmethodID java_GLSurfaceView_requestRender;\n\nstatic void init_methods_cache(JNIEnv *env) {\n    if (methods_initialized)\n        return;\n    #define FIND_CLASS(name) reinterpret_cast<jclass>(env->NewGlobalRef(env->FindClass(name)))\n    java_Integer = FIND_CLASS(\"java\/lang\/Integer\");\n    java_Integer_init = env->GetMethodID(java_Integer, \"<init>\", \"(I)V\");\n    java_Integer_intValue = env->GetMethodID(java_Integer, \"intValue\", \"()I\");\n    java_Boolean = FIND_CLASS(\"java\/lang\/Boolean\");\n    java_Boolean_init = env->GetMethodID(java_Boolean, \"<init>\", \"(Z)V\");\n    java_Boolean_booleanValue = env->GetMethodID(java_Boolean, \"booleanValue\", \"()Z\");\n    jclass java_GLSurfaceView = FIND_CLASS(\"android\/opengl\/GLSurfaceView\");\n    java_GLSurfaceView_requestRender = env->GetMethodID(java_GLSurfaceView, \"requestRender\", \"()V\");\n    #undef FIND_CLASS\n    methods_initialized = true;\n}\n\nstatic void *render_cb(void *data)\n{\n    jobject *glView = (void *)data;\n    return env->CallVoidMethod(glView, java_GLSurfaceView_requestRender);\n}\n\nstatic void prepare_environment(JNIEnv *env, jobject appctx) {\n    setlocale(LC_NUMERIC, \"C\");\n\n    JavaVM* vm = NULL;\n\n    if (!env->GetJavaVM(&vm) && vm) {\n        av_jni_set_java_vm(vm, NULL);\n    }\n    init_methods_cache(env);\n    android_content_init(env, appctx);\n}\n\njni_func(void, create, jobject appctx) {\n    prepare_environment(env, appctx);\n\n    if (mpv)\n        die(\"mpv is already initialized\");\n\n    mpv = mpv_create();\n    if (!mpv)\n        die(\"context init failed\");\n\n    mpv_request_log_messages(mpv, \"v\");\n}\n\njni_func(void, init) {\n    if (!mpv)\n        die(\"mpv is not created\");\n\n    if (mpv_initialize(mpv) < 0)\n        die(\"mpv init failed\");\n\n    android_content_register(mpv);\n#ifdef __aarch64__\n    ALOGV(\"You're using the 64-bit build of mpv!\");\n#endif\n}\n\njni_func(void, destroy) {\n    if (!mpv)\n        die(\"mpv destroy called but it's already destroyed\");\n    mpv_terminate_destroy(mpv);\n    mpv = NULL;\n}\n\njni_func(void, initGL, jobject view) {\n    int ret = -1;\n    if (!mpv)\n        die(\"initGL: mpv not initialized\");\n    if (mpv_gl)\n        die(\"OpenGL ES already initialized!?\");\n\n    mpv_gl = (mpv_opengl_cb_context*)mpv_get_sub_api(mpv, MPV_SUB_API_OPENGL_CB);\n    if (!mpv_gl)\n        die(\"failed to create mpv GL API handle\");\n\n    if ((ret = mpv_opengl_cb_init_gl(mpv_gl, NULL, get_proc_address_mpv, NULL)) < 0) {\n        ALOGE(\"mpv_opengl_cb_init_gl returned error %d\", ret);\n        die(\"failed to initialize mpv GL context\");\n    }\n\n    mpv_opengl_cb_set_update_callback(mpv_gl, render_cb, (void *)view);\n}\n\njni_func(void, destroyGL) {\n    if (!mpv_gl)\n        die(\"mpv_gl destroy called but it's already destroyed\");\n    mpv_opengl_cb_uninit_gl(mpv_gl);\n    mpv_gl = NULL;\n}\n\njni_func(void, command, jobjectArray jarray) {\n    const char *arguments[128] = { 0 };\n    int len = env->GetArrayLength(jarray);\n    if (!mpv)\n        die(\"Cannot run command: mpv is not initialized\");\n    if (len >= ARRAYLEN(arguments))\n        die(\"Cannot run command: too many arguments\");\n\n    for (int i = 0; i < len; ++i)\n        arguments[i] = env->GetStringUTFChars((jstring)env->GetObjectArrayElement(jarray, i), NULL);\n\n    mpv_command(mpv, arguments);\n\n    for (int i = 0; i < len; ++i)\n        env->ReleaseStringUTFChars((jstring)env->GetObjectArrayElement(jarray, i), arguments[i]);\n}\n\njni_func(void, resize, jint width, jint height) {\n    ALOGV(\"Resizing! width: %d=>%d, %d=>%d\\n\", g_width, width, g_height, height);\n    g_width = width;\n    g_height = height;\n}\n\njni_func(void, draw) {\n    mpv_opengl_cb_draw(mpv_gl, 0, g_width, -g_height);\n}\n\nvoid sendPropertyUpdateToJava(JNIEnv *env, mpv_event_property *prop) {\n    jmethodID mid;\n    jstring jprop = env->NewStringUTF(prop->name);\n    jclass clazz = env->FindClass(\"is\/xyz\/mpv\/MPVLib\");\n    jstring jvalue = NULL;\n    switch (prop->format) {\n    case MPV_FORMAT_NONE:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;)V\"); \/\/ eventProperty(String)\n        env->CallStaticVoidMethod(clazz, mid, jprop);\n        break;\n    case MPV_FORMAT_FLAG:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;Z)V\"); \/\/ eventProperty(String, boolean)\n        env->CallStaticVoidMethod(clazz, mid, jprop, *(int*)prop->data);\n        break;\n    case MPV_FORMAT_INT64:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;J)V\"); \/\/ eventProperty(String, long)\n        env->CallStaticVoidMethod(clazz, mid, jprop, *(int64_t*)prop->data);\n        break;\n    case MPV_FORMAT_STRING:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\"); \/\/ eventProperty(String, String)\n        jvalue = env->NewStringUTF(*(const char**)prop->data);\n        env->CallStaticVoidMethod(clazz, mid, jprop, jvalue);\n        break;\n    default:\n        ALOGV(\"sendPropertyUpdateToJava: Unknown property update format received in callback: %d!\", prop->format);\n        break;\n    }\n}\n\nstatic void sendEventToJava(JNIEnv *env, int event) {\n    jclass clazz = env->FindClass(\"is\/xyz\/mpv\/MPVLib\");\n    jmethodID mid = env->GetStaticMethodID(clazz, \"event\", \"(I)V\"); \/\/ event(int)\n    env->CallStaticVoidMethod(clazz, mid, event);\n}\n\njni_func(void, step) {\n    while (1) {\n        mpv_event *mp_event = mpv_wait_event(mpv, 0);\n        mpv_event_property *mp_property = NULL;\n        mpv_event_log_message *msg = NULL;\n        if (mp_event->event_id == MPV_EVENT_NONE)\n            break;\n        switch (mp_event->event_id) {\n        case MPV_EVENT_LOG_MESSAGE:\n            msg = (mpv_event_log_message*)mp_event->data;\n            ALOGV(\"[%s:%s] %s\", msg->prefix, msg->level, msg->text);\n            break;\n        case MPV_EVENT_PROPERTY_CHANGE:\n            mp_property = (mpv_event_property*)mp_event->data;\n            sendPropertyUpdateToJava(env, mp_property);\n            break;\n        default:\n            ALOGV(\"event: %s\\n\", mpv_event_name(mp_event->event_id));\n            sendEventToJava(env, mp_event->event_id);\n            break;\n        }\n    }\n}\n\njni_func(jint, setOptionString, jstring joption, jstring jvalue) {\n    if (!mpv)\n        die(\"mpv is not initialized\");\n\n    const char *option = env->GetStringUTFChars(joption, NULL);\n    const char *value = env->GetStringUTFChars(jvalue, NULL);\n\n    int result = mpv_set_option_string(mpv, option, value);\n\n    env->ReleaseStringUTFChars(joption, option);\n    env->ReleaseStringUTFChars(jvalue, value);\n\n    return result;\n}\n\nstatic int common_get_property(JNIEnv *env, jstring jproperty, mpv_format format, void *output) {\n    if (!mpv)\n        die(\"get_property called but mpv is not initialized\");\n\n    const char *prop = env->GetStringUTFChars(jproperty, NULL);\n    int result = mpv_get_property(mpv, prop, format, output);\n    if (result < 0)\n        ALOGE(\"mpv_get_property(%s) format %d returned error %s\", prop, format, mpv_error_string(result));\n    env->ReleaseStringUTFChars(jproperty, prop);\n\n    return result;\n}\n\nstatic int common_set_property(JNIEnv *env, jstring jproperty, mpv_format format, void *value) {\n    if (!mpv)\n        die(\"set_property called but mpv is not initialized\");\n\n    const char *prop = env->GetStringUTFChars(jproperty, NULL);\n    int result = mpv_set_property(mpv, prop, format, value);\n    if (result < 0)\n        ALOGE(\"mpv_set_property(%s, %p) format %d returned error %s\", prop, value, format, mpv_error_string(result));\n    env->ReleaseStringUTFChars(jproperty, prop);\n\n    return result;\n}\n\njni_func(jobject, getPropertyInt, jstring jproperty) {\n    int64_t value = 0;\n    if (common_get_property(env, jproperty, MPV_FORMAT_INT64, &value) < 0)\n        return NULL;\n    return env->NewObject(java_Integer, java_Integer_init, (jint)value);\n}\n\njni_func(jobject, getPropertyBoolean, jstring jproperty) {\n    int value = 0;\n    if (common_get_property(env, jproperty, MPV_FORMAT_FLAG, &value) < 0)\n        return NULL;\n    return env->NewObject(java_Boolean, java_Boolean_init, (jboolean)value);\n}\n\njni_func(jstring, getPropertyString, jstring jproperty) {\n    char *value;\n    if (common_get_property(env, jproperty, MPV_FORMAT_STRING, &value) < 0)\n        return NULL;\n    jstring jvalue = env->NewStringUTF(value);\n    mpv_free(value);\n    return jvalue;\n}\n\njni_func(void, setPropertyInt, jstring jproperty, jobject jvalue) {\n    int64_t value = env->CallIntMethod(jvalue, java_Integer_intValue);\n    common_set_property(env, jproperty, MPV_FORMAT_INT64, &value);\n}\n\njni_func(void, setPropertyBoolean, jstring jproperty, jobject jvalue) {\n    int value = env->CallBooleanMethod(jvalue, java_Boolean_booleanValue);\n    common_set_property(env, jproperty, MPV_FORMAT_FLAG, &value);\n}\n\njni_func(void, setPropertyString, jstring jproperty, jstring jvalue) {\n    const char *value = env->GetStringUTFChars(jvalue, NULL);\n    common_set_property(env, jproperty, MPV_FORMAT_STRING, &value);\n    env->ReleaseStringUTFChars(jvalue, value);\n}\n\njni_func(void, observeProperty, jstring property, jint format) {\n    if (!mpv)\n        die(\"mpv is not initialized\");\n    const char *prop = env->GetStringUTFChars(property, NULL);\n    mpv_observe_property(mpv, 0, prop, (mpv_format)format);\n    env->ReleaseStringUTFChars(property, prop);\n}\n<commit_msg>use a simple FindClass<commit_after>#include <jni.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <time.h>\n#include <locale.h>\n\n#include <mpv\/client.h>\n#include <mpv\/opengl_cb.h>\n\n#include <EGL\/egl.h>\n\nextern \"C\" {\n    #include <libavcodec\/jni.h>\n}\n\n#include \"main.h\"\n\nextern void android_content_init(JNIEnv *env, jobject appctx);\nextern void android_content_register(mpv_handle *mpv);\n\n#define ARRAYLEN(a) (sizeof(a)\/sizeof(a[0]))\n#define jni_func_name(name) Java_is_xyz_mpv_MPVLib_##name\n#define jni_func(return_type, name, ...) JNIEXPORT return_type JNICALL jni_func_name(name) (JNIEnv *env, jobject obj, ##__VA_ARGS__)\n\nextern \"C\" {\n    jni_func(void, create, jobject appctx);\n    jni_func(void, init);\n    jni_func(void, destroy);\n\n    jni_func(void, initGL, jobject view);\n    jni_func(void, destroyGL);\n\n    jni_func(void, command, jobjectArray jarray);\n\n    jni_func(void, resize, jint width, jint height);\n    jni_func(void, draw);\n    jni_func(void, step);\n\n    jni_func(jint, setOptionString, jstring option, jstring value);\n\n    jni_func(jobject, getPropertyInt, jstring property);\n    jni_func(void, setPropertyInt, jstring property, jobject value);\n    jni_func(jobject, getPropertyBoolean, jstring property);\n    jni_func(void, setPropertyBoolean, jstring property, jobject value);\n    jni_func(jstring, getPropertyString, jstring jproperty);\n    jni_func(void, setPropertyString, jstring jproperty, jstring jvalue);\n\n    jni_func(void, observeProperty, jstring property, jint format);\n};\n\nmpv_handle *mpv;\nmpv_opengl_cb_context *mpv_gl;\nint g_width, g_height;\n\nstatic void die(const char *msg)\n{\n    ALOGE(\"%s\", msg);\n    exit(1);\n}\n\nstatic void *get_proc_address_mpv(void *fn_ctx, const char *name)\n{\n    return (void*)eglGetProcAddress(name);\n}\n\n\/\/ Apparently it's considered slow to FindClass and GetMethodID every time we need them,\n\/\/ so let's have a nice cache here\nbool methods_initialized;\njclass java_Integer, java_Boolean;\njmethodID java_Integer_init, java_Integer_intValue, java_Boolean_init, java_Boolean_booleanValue;\njmethodID java_GLSurfaceView_requestRender;\n\nstatic void init_methods_cache(JNIEnv *env) {\n    if (methods_initialized)\n        return;\n    #define FIND_CLASS(name) reinterpret_cast<jclass>(env->NewGlobalRef(env->FindClass(name)))\n    java_Integer = FIND_CLASS(\"java\/lang\/Integer\");\n    java_Integer_init = env->GetMethodID(java_Integer, \"<init>\", \"(I)V\");\n    java_Integer_intValue = env->GetMethodID(java_Integer, \"intValue\", \"()I\");\n    java_Boolean = FIND_CLASS(\"java\/lang\/Boolean\");\n    java_Boolean_init = env->GetMethodID(java_Boolean, \"<init>\", \"(Z)V\");\n    java_Boolean_booleanValue = env->GetMethodID(java_Boolean, \"booleanValue\", \"()Z\");\n    #undef FIND_CLASS\n    jclass java_GLSurfaceView = env->FindClass(\"android\/opengl\/GLSurfaceView\");\n    java_GLSurfaceView_requestRender = env->GetMethodID(java_GLSurfaceView, \"requestRender\", \"()V\");\n    methods_initialized = true;\n}\n\nstatic void *render_cb(void *data)\n{\n    jobject *glView = (void *)data;\n    return env->CallVoidMethod(glView, java_GLSurfaceView_requestRender);\n}\n\nstatic void prepare_environment(JNIEnv *env, jobject appctx) {\n    setlocale(LC_NUMERIC, \"C\");\n\n    JavaVM* vm = NULL;\n\n    if (!env->GetJavaVM(&vm) && vm) {\n        av_jni_set_java_vm(vm, NULL);\n    }\n    init_methods_cache(env);\n    android_content_init(env, appctx);\n}\n\njni_func(void, create, jobject appctx) {\n    prepare_environment(env, appctx);\n\n    if (mpv)\n        die(\"mpv is already initialized\");\n\n    mpv = mpv_create();\n    if (!mpv)\n        die(\"context init failed\");\n\n    mpv_request_log_messages(mpv, \"v\");\n}\n\njni_func(void, init) {\n    if (!mpv)\n        die(\"mpv is not created\");\n\n    if (mpv_initialize(mpv) < 0)\n        die(\"mpv init failed\");\n\n    android_content_register(mpv);\n#ifdef __aarch64__\n    ALOGV(\"You're using the 64-bit build of mpv!\");\n#endif\n}\n\njni_func(void, destroy) {\n    if (!mpv)\n        die(\"mpv destroy called but it's already destroyed\");\n    mpv_terminate_destroy(mpv);\n    mpv = NULL;\n}\n\njni_func(void, initGL, jobject view) {\n    int ret = -1;\n    if (!mpv)\n        die(\"initGL: mpv not initialized\");\n    if (mpv_gl)\n        die(\"OpenGL ES already initialized!?\");\n\n    mpv_gl = (mpv_opengl_cb_context*)mpv_get_sub_api(mpv, MPV_SUB_API_OPENGL_CB);\n    if (!mpv_gl)\n        die(\"failed to create mpv GL API handle\");\n\n    if ((ret = mpv_opengl_cb_init_gl(mpv_gl, NULL, get_proc_address_mpv, NULL)) < 0) {\n        ALOGE(\"mpv_opengl_cb_init_gl returned error %d\", ret);\n        die(\"failed to initialize mpv GL context\");\n    }\n\n    mpv_opengl_cb_set_update_callback(mpv_gl, render_cb, (void *)view);\n}\n\njni_func(void, destroyGL) {\n    if (!mpv_gl)\n        die(\"mpv_gl destroy called but it's already destroyed\");\n    mpv_opengl_cb_uninit_gl(mpv_gl);\n    mpv_gl = NULL;\n}\n\njni_func(void, command, jobjectArray jarray) {\n    const char *arguments[128] = { 0 };\n    int len = env->GetArrayLength(jarray);\n    if (!mpv)\n        die(\"Cannot run command: mpv is not initialized\");\n    if (len >= ARRAYLEN(arguments))\n        die(\"Cannot run command: too many arguments\");\n\n    for (int i = 0; i < len; ++i)\n        arguments[i] = env->GetStringUTFChars((jstring)env->GetObjectArrayElement(jarray, i), NULL);\n\n    mpv_command(mpv, arguments);\n\n    for (int i = 0; i < len; ++i)\n        env->ReleaseStringUTFChars((jstring)env->GetObjectArrayElement(jarray, i), arguments[i]);\n}\n\njni_func(void, resize, jint width, jint height) {\n    ALOGV(\"Resizing! width: %d=>%d, %d=>%d\\n\", g_width, width, g_height, height);\n    g_width = width;\n    g_height = height;\n}\n\njni_func(void, draw) {\n    mpv_opengl_cb_draw(mpv_gl, 0, g_width, -g_height);\n}\n\nvoid sendPropertyUpdateToJava(JNIEnv *env, mpv_event_property *prop) {\n    jmethodID mid;\n    jstring jprop = env->NewStringUTF(prop->name);\n    jclass clazz = env->FindClass(\"is\/xyz\/mpv\/MPVLib\");\n    jstring jvalue = NULL;\n    switch (prop->format) {\n    case MPV_FORMAT_NONE:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;)V\"); \/\/ eventProperty(String)\n        env->CallStaticVoidMethod(clazz, mid, jprop);\n        break;\n    case MPV_FORMAT_FLAG:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;Z)V\"); \/\/ eventProperty(String, boolean)\n        env->CallStaticVoidMethod(clazz, mid, jprop, *(int*)prop->data);\n        break;\n    case MPV_FORMAT_INT64:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;J)V\"); \/\/ eventProperty(String, long)\n        env->CallStaticVoidMethod(clazz, mid, jprop, *(int64_t*)prop->data);\n        break;\n    case MPV_FORMAT_STRING:\n        mid = env->GetStaticMethodID(clazz, \"eventProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\"); \/\/ eventProperty(String, String)\n        jvalue = env->NewStringUTF(*(const char**)prop->data);\n        env->CallStaticVoidMethod(clazz, mid, jprop, jvalue);\n        break;\n    default:\n        ALOGV(\"sendPropertyUpdateToJava: Unknown property update format received in callback: %d!\", prop->format);\n        break;\n    }\n}\n\nstatic void sendEventToJava(JNIEnv *env, int event) {\n    jclass clazz = env->FindClass(\"is\/xyz\/mpv\/MPVLib\");\n    jmethodID mid = env->GetStaticMethodID(clazz, \"event\", \"(I)V\"); \/\/ event(int)\n    env->CallStaticVoidMethod(clazz, mid, event);\n}\n\njni_func(void, step) {\n    while (1) {\n        mpv_event *mp_event = mpv_wait_event(mpv, 0);\n        mpv_event_property *mp_property = NULL;\n        mpv_event_log_message *msg = NULL;\n        if (mp_event->event_id == MPV_EVENT_NONE)\n            break;\n        switch (mp_event->event_id) {\n        case MPV_EVENT_LOG_MESSAGE:\n            msg = (mpv_event_log_message*)mp_event->data;\n            ALOGV(\"[%s:%s] %s\", msg->prefix, msg->level, msg->text);\n            break;\n        case MPV_EVENT_PROPERTY_CHANGE:\n            mp_property = (mpv_event_property*)mp_event->data;\n            sendPropertyUpdateToJava(env, mp_property);\n            break;\n        default:\n            ALOGV(\"event: %s\\n\", mpv_event_name(mp_event->event_id));\n            sendEventToJava(env, mp_event->event_id);\n            break;\n        }\n    }\n}\n\njni_func(jint, setOptionString, jstring joption, jstring jvalue) {\n    if (!mpv)\n        die(\"mpv is not initialized\");\n\n    const char *option = env->GetStringUTFChars(joption, NULL);\n    const char *value = env->GetStringUTFChars(jvalue, NULL);\n\n    int result = mpv_set_option_string(mpv, option, value);\n\n    env->ReleaseStringUTFChars(joption, option);\n    env->ReleaseStringUTFChars(jvalue, value);\n\n    return result;\n}\n\nstatic int common_get_property(JNIEnv *env, jstring jproperty, mpv_format format, void *output) {\n    if (!mpv)\n        die(\"get_property called but mpv is not initialized\");\n\n    const char *prop = env->GetStringUTFChars(jproperty, NULL);\n    int result = mpv_get_property(mpv, prop, format, output);\n    if (result < 0)\n        ALOGE(\"mpv_get_property(%s) format %d returned error %s\", prop, format, mpv_error_string(result));\n    env->ReleaseStringUTFChars(jproperty, prop);\n\n    return result;\n}\n\nstatic int common_set_property(JNIEnv *env, jstring jproperty, mpv_format format, void *value) {\n    if (!mpv)\n        die(\"set_property called but mpv is not initialized\");\n\n    const char *prop = env->GetStringUTFChars(jproperty, NULL);\n    int result = mpv_set_property(mpv, prop, format, value);\n    if (result < 0)\n        ALOGE(\"mpv_set_property(%s, %p) format %d returned error %s\", prop, value, format, mpv_error_string(result));\n    env->ReleaseStringUTFChars(jproperty, prop);\n\n    return result;\n}\n\njni_func(jobject, getPropertyInt, jstring jproperty) {\n    int64_t value = 0;\n    if (common_get_property(env, jproperty, MPV_FORMAT_INT64, &value) < 0)\n        return NULL;\n    return env->NewObject(java_Integer, java_Integer_init, (jint)value);\n}\n\njni_func(jobject, getPropertyBoolean, jstring jproperty) {\n    int value = 0;\n    if (common_get_property(env, jproperty, MPV_FORMAT_FLAG, &value) < 0)\n        return NULL;\n    return env->NewObject(java_Boolean, java_Boolean_init, (jboolean)value);\n}\n\njni_func(jstring, getPropertyString, jstring jproperty) {\n    char *value;\n    if (common_get_property(env, jproperty, MPV_FORMAT_STRING, &value) < 0)\n        return NULL;\n    jstring jvalue = env->NewStringUTF(value);\n    mpv_free(value);\n    return jvalue;\n}\n\njni_func(void, setPropertyInt, jstring jproperty, jobject jvalue) {\n    int64_t value = env->CallIntMethod(jvalue, java_Integer_intValue);\n    common_set_property(env, jproperty, MPV_FORMAT_INT64, &value);\n}\n\njni_func(void, setPropertyBoolean, jstring jproperty, jobject jvalue) {\n    int value = env->CallBooleanMethod(jvalue, java_Boolean_booleanValue);\n    common_set_property(env, jproperty, MPV_FORMAT_FLAG, &value);\n}\n\njni_func(void, setPropertyString, jstring jproperty, jstring jvalue) {\n    const char *value = env->GetStringUTFChars(jvalue, NULL);\n    common_set_property(env, jproperty, MPV_FORMAT_STRING, &value);\n    env->ReleaseStringUTFChars(jvalue, value);\n}\n\njni_func(void, observeProperty, jstring property, jint format) {\n    if (!mpv)\n        die(\"mpv is not initialized\");\n    const char *prop = env->GetStringUTFChars(property, NULL);\n    mpv_observe_property(mpv, 0, prop, (mpv_format)format);\n    env->ReleaseStringUTFChars(property, prop);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __Data_course__\n#define __Data_course__\n\n#include \"data-general.hpp\"\n#include \"data-major.hpp\"\n#include \"data-department.hpp\"\n\nusing namespace std;\n\nclass Course {\n\tvoid copy(const Course& c) {\n\t\tid = c.id;\n\t\tnumber = c.number;\n\t\ttitle = c.title;\n\t\tdescription = c.description;\n\t\tsection = c.section;\n\t\tmajors = c.majors;\n\t\tdepartment = c.department;\n\t\tconcentrations = c.concentrations;\n\t\tconversations = c.conversations;\n\t\tprofessor = c.professor;\n\n\t\thalf_semester = c.half_semester;\n\t\tpass_fail = c.pass_fail;\n\t\tcredits = c.credits;\n\t\tlocation = c.location;\n\n\t\tlab = c.lab;\n\t\tgeneds = c.geneds;\n\n\t\tfor (int i = 0; i < 7; ++i){\n\t\t\tdays[i] = c.days[i];\n\t\t\ttime[i] = c.time[i];\n\t\t}\n\t}\nprotected:\n\tstring id;\n\tint number;\n\tstring title;\n\tstring description;\n\tchar section;\n\t\n\tvector<Major> majors;\n\tvector<Department> department;\n\tstring concentrations;\n\tstring conversations;\n\tstring professor;\n\n\tint half_semester;\n\tbool pass_fail;\n\tfloat credits;\n\tstring location;\n\n\tbool lab;\n\tGenEd* geneds;\n\n\tbool days[7];\n\tfloat time[7];\npublic:\n\tCourse() {\n\n\t}\n\tCourse(const Course& c) {\n\t\tcopy(c);\n\t}\n\tCourse(istream &is) {\n\t\tif (!is) return;\n\n\t\tstring tmpLine;\n\t\tgetline(is, tmpLine); \/\/ do this twice: once to not break the program,\n\t\tgetline(is, tmpLine); \/\/ and once to remove the extra data of course status.\n\n\t\tvector<string> record = split(tmpLine, ',');\n\t\tfor (vector<string>::iterator i=record.begin(); i != record.end(); ++i) {\n\t\t\t*i = removeAllQuotes(*i);\n\t\t\t*i = removeTrailingSlashes(*i);\n\t\t}\n\n\t\t\/*\n\t\t\tcout << record.at(0) << \", \";\n\t\t\tcout << record.at(1) << \", \";\n\t\t\tcout << record.at(2) << \", \";\n\t\t\tcout << record.at(3) << \", \";\n\t\t\tcout << record.at(4) << \", \";\n\t\t\tcout << record.at(5) << \", \";\n\t\t\tcout << record.at(6) << \", \";\n\t\t\tcout << record.at(7) << \", \";\n\t\t\tcout << record.at(8) << \", \";\n\t\t\tcout << record.at(9) << \", \";\n\t\t\tcout << record.at(10) << \", \";\n\t\t\tcout << record.at(11) << \", \";\n\t\t\tif (record.size() == 13)\n\t\t\t\tcout << record.at(12) << endl;\n\t\t*\/\n\t\t\n\t\t\/\/ Ignore the first column;\n\t\trecord.at(0);\n\n\t\t\/\/ so, the *first* column (that we care about) has the course id,\n\t\tid = record.at(1);\n\t\tparseid(id);\n\n\t\t\/\/ Second column has the section,\n\t\tsection = record.at(2)[0];\n\n\t\t\/\/ Third holds the lab boolean,\n\t\tif (record.at(3).empty()) lab = false;\n\t\telse                      lab = true;\n\n\t\t\/\/ while Fourth contains the title of the course;\n\t\ttitle = record.at(4);\n\t\tcleanTitle();\n\n\t\t\/\/ Fifth hands over the length (half semester or not)\n\t\t\/\/ it's actually an int that tells us how many times the course is offered per semester.\n\t\thalf_semester = stringToInt(record.at(5));\n\t\tif (half_semester != 0 && half_semester != 1 && half_semester != 2)\n\t\t\thalf_semester = 0;\n\n\t\t\/\/ Sixth tells us the number of credits,\n\t\tcredits = stringToFloat(record.at(6));\n\n\t\t\/\/ Seventh shows us if it can be taken pass\/no-pass, \n\t\tif (record.at(7) == \"Y\")\n\t\t\tpass_fail = true;\n\t\telse\n\t\t\tpass_fail = false;\n\n\t\t\/\/ while Eighth gives us the GEs of the course,\n\t\t\/\/ GEreqs = record.at(8);\n\n\t\t\/\/ and Nine spits out the days and times;\n\t\t\/\/ Times = record.at(9);\n\n\t\t\/\/ Ten holds the location,\n\t\tlocation = record.at(10);\n\t\tlocation = deDoubleString(location);\n\n\t\t\/\/ and Eleven knows who teaches.\n\t\tif (record.size() == 13) {\n\t\t\tstring profLastName = record.at(11);\n\t\t\tstring profFirstName = record.at(12);\n\t\t\tprofFirstName.erase(0, 1); \/\/ remove the extra space from the start of the name\n\t\t\tprofessor = profFirstName + \" \" + profLastName;\n\t\t}\n\t\telse {\n\t\t\tprofessor = record.at(11);\n\t\t}\n\t}\n\n\tvoid cleanTitle() {\n\t\tvector<string> badEndings, badBeginnings;\n\t\tbadEndings.push_back(\"Prerequisite\");\n\t\tbadEndings.push_back(\"Prerequsiite\");\n\t\tbadEndings.push_back(\"This course has class\");\n\t\tbadEndings.push_back(\"This course is open to \");\n\t\tbadEndings.push_back(\"First-Year Students may register only\");\n\t\tbadEndings.push_back(\"Open to \");\n\t\tbadEndings.push_back(\"Especially for \");\n\t\tbadEndings.push_back(\"Registration by permission of instructor only.\");\n\t\tbadEndings.push_back(\"Permission of instructor required.\");\n\t\tbadEndings.push_back(\"Not open to first-year students.\");\n\t\tbadEndings.push_back(\"Film screenings\");\n\t\tbadEndings.push_back(\"Open only to \");\n\t\tbadEndings.push_back(\"This course has been canceled.\");\n\t\tbadEndings.push_back(\"This course has been cancelled.\");\n\t\tbadEndings.push_back(\"Open only to seniors\");\n\t\tbadEndings.push_back(\"Closed during web registration.\");\n\t\tbadEndings.push_back(\"During course submission process\");\n\t\tbadEndings.push_back(\"Taught in English.\");\n\t\tbadEndings.push_back(\"Closed to First-Year Students.\");\n\t\tbadEndings.push_back(\"Closed to first-year students.\");\n\t\tbadEndings.push_back(\"New course\");\n\t\tbadEndings.push_back(\"This course does\");\n\t\tbadEndings.push_back(\"This course open to seniors only.\");\n\t\tbadEndings.push_back(\"This lab has been canceled.\");\n\t\tbadEndings.push_back(\"Permission of the instructor\");\n\t\tbadEndings.push_back(\"Registration restricted\");\n\t\tbadBeginnings.push_back(\"Top: \");\n\t\tbadBeginnings.push_back(\"Sem: \");\n\t\tbadBeginnings.push_back(\"Res: \");\n\t\t\n\t\tbadEndings.push_back(\"Students in \" + department[0].getFullName() + \" \" + tostring(number));\n\t\tbadEndings.push_back(\"Students in \" + department[0].getName() + \" \" + tostring(number));\n\t\t\/\/ cout << badEndings.back() << endl;\n\n\t\tfor (vector<string>::iterator i=badEndings.begin(); i != badEndings.end(); ++i)\n\t\t\ttitle = removeTrailingText(title, *i);\n\t\tfor (vector<string>::iterator i=badBeginnings.begin(); i != badBeginnings.end(); ++i)\n\t\t\ttitle = removeStartingText(title, *i);\n\t}\n\n\tvoid parseid(string str) {\n\t\t\/\/ Get the number of the course, aka the last three slots.\n\t\tstringstream(str.substr(str.size() - 3)) >> number;\n\n\t\t\/\/ Check if it's one of those dastardly \"split courses\".\n\t\tstring dept = str.substr(0,str.size()-3);\n\n\t\tif (str.find('\/') != string::npos) {\n\t\t\tdepartment.push_back(Department(dept.substr(0,2)));\n\t\t\tdepartment.push_back(Department(dept.substr(2,2)));\n\t\t}\n\t\telse {\n\t\t\tdepartment.push_back(Department(dept));\n\t\t}\n\t}\n\n\tvoid updateID() {\n\t\tstring dept;\n\t\tfor (std::vector<Department>::iterator i = department.begin(); i != department.end(); ++i) {\n\t\t\tdept += i->getName();\n\t\t\tif (department.size() > 1)\n\t\t\t\tdept += \"\/\";\n\t\t}\n\t\tid = dept + \" \" + tostring(number) + section;\n\t}\n\tstring getID() {\n\t\treturn id;\n\t}\n\n\tostream& getData(ostream &os) {\n\t\tupdateID();\n\t\tos << id << \" - \";\n\t\tos << title << \" | \";\n\t\tif (professor.length() > 0 && professor != \" \")\n\t\t\tos << professor;\n\t\treturn os;\n\t}\n\tvoid display();\n\n\tvoid showAll() {\n\t\tcout << id << section << endl;\n\t\tcout << \"Title: \" << title << endl;\n\t\tcout << \"Professor: \" << professor << endl;\n\t\tcout << \"Lab? \" << lab << endl;\n\t\tcout << \"Half-semester? \" << half_semester << endl;\n\t\tcout << \"Credits: \" << credits << endl;\n\t\tcout << \"Pass\/Fail? \" << pass_fail << endl;\n\t\tcout << \"Location: \" << location << endl;\n\t\tcout << endl;\n\t}\n};\n\nostream &operator<<(ostream &os, Course &item) { return item.getData(os); }\nvoid Course::display() { if(this==0) cout << *this << endl; }\n\n#endif\n\n<commit_msg>Add the beginnings of a lookupCourse function<commit_after>#ifndef __Data_course__\n#define __Data_course__\n\n#include \"data-general.hpp\"\n#include \"data-major.hpp\"\n#include \"data-department.hpp\"\n\nusing namespace std;\n\nclass Course {\nprivate:\n\tvoid init(string dept, int num) {\n\t\tstring identifier = dept + tostring(num);\n\t\tparseID(identifier);\n\t\tlookupCourse(id);\n\t}\n\tvoid copy(const Course& c) {\n\t\tid = c.id;\n\t\tnumber = c.number;\n\t\ttitle = c.title;\n\t\tdescription = c.description;\n\t\tsection = c.section;\n\t\tmajors = c.majors;\n\t\tdepartment = c.department;\n\t\tconcentrations = c.concentrations;\n\t\tconversations = c.conversations;\n\t\tprofessor = c.professor;\n\n\t\thalf_semester = c.half_semester;\n\t\tpass_fail = c.pass_fail;\n\t\tcredits = c.credits;\n\t\tlocation = c.location;\n\n\t\tlab = c.lab;\n\t\tgeneds = c.geneds;\n\n\t\tfor (int i = 0; i < 7; ++i){\n\t\t\tdays[i] = c.days[i];\n\t\t\ttime[i] = c.time[i];\n\t\t}\n\t}\nprotected:\n\tstring id;\n\tint number;\n\tstring title;\n\tstring description;\n\tchar section;\n\t\n\tvector<Major> majors;\n\tvector<Department> department;\n\tstring concentrations;\n\tstring conversations;\n\tstring professor;\n\n\tint half_semester;\n\tbool pass_fail;\n\tfloat credits;\n\tstring location;\n\n\tbool lab;\n\tGenEd* geneds;\n\n\tbool days[7];\n\tfloat time[7];\npublic:\n\tCourse() {\n\n\t}\n\tCourse(const Course& c) {\n\t\tcopy(c);\n\t}\n\tCourse(istream &is) {\n\t\tif (!is) return;\n\n\t\tstring tmpLine;\n\t\tgetline(is, tmpLine); \/\/ do this twice: once to not break the program,\n\t\tgetline(is, tmpLine); \/\/ and once to remove the extra data of course status.\n\n\t\tvector<string> record = split(tmpLine, ',');\n\t\tfor (vector<string>::iterator i=record.begin(); i != record.end(); ++i) {\n\t\t\t*i = removeAllQuotes(*i);\n\t\t\t*i = removeTrailingSlashes(*i);\n\t\t}\n\n\t\t\/*\n\t\t\tcout << record.at(0) << \", \";\n\t\t\tcout << record.at(1) << \", \";\n\t\t\tcout << record.at(2) << \", \";\n\t\t\tcout << record.at(3) << \", \";\n\t\t\tcout << record.at(4) << \", \";\n\t\t\tcout << record.at(5) << \", \";\n\t\t\tcout << record.at(6) << \", \";\n\t\t\tcout << record.at(7) << \", \";\n\t\t\tcout << record.at(8) << \", \";\n\t\t\tcout << record.at(9) << \", \";\n\t\t\tcout << record.at(10) << \", \";\n\t\t\tcout << record.at(11) << \", \";\n\t\t\tif (record.size() == 13)\n\t\t\t\tcout << record.at(12) << endl;\n\t\t*\/\n\t\t\n\t\t\/\/ Ignore the first column;\n\t\trecord.at(0);\n\n\t\t\/\/ so, the *first* column (that we care about) has the course id,\n\t\tid = record.at(1);\n\t\tparseid(id);\n\n\t\t\/\/ Second column has the section,\n\t\tsection = record.at(2)[0];\n\n\t\t\/\/ Third holds the lab boolean,\n\t\tif (record.at(3).empty()) lab = false;\n\t\telse                      lab = true;\n\n\t\t\/\/ while Fourth contains the title of the course;\n\t\ttitle = record.at(4);\n\t\tcleanTitle();\n\n\t\t\/\/ Fifth hands over the length (half semester or not)\n\t\t\/\/ it's actually an int that tells us how many times the course is offered per semester.\n\t\thalf_semester = stringToInt(record.at(5));\n\t\tif (half_semester != 0 && half_semester != 1 && half_semester != 2)\n\t\t\thalf_semester = 0;\n\n\t\t\/\/ Sixth tells us the number of credits,\n\t\tcredits = stringToFloat(record.at(6));\n\n\t\t\/\/ Seventh shows us if it can be taken pass\/no-pass, \n\t\tif (record.at(7) == \"Y\")\n\t\t\tpass_fail = true;\n\t\telse\n\t\t\tpass_fail = false;\n\n\t\t\/\/ while Eighth gives us the GEs of the course,\n\t\t\/\/ GEreqs = record.at(8);\n\n\t\t\/\/ and Nine spits out the days and times;\n\t\t\/\/ Times = record.at(9);\n\n\t\t\/\/ Ten holds the location,\n\t\tlocation = record.at(10);\n\t\tlocation = deDoubleString(location);\n\n\t\t\/\/ and Eleven knows who teaches.\n\t\tif (record.size() == 13) {\n\t\t\tstring profLastName = record.at(11);\n\t\t\tstring profFirstName = record.at(12);\n\t\t\tprofFirstName.erase(0, 1); \/\/ remove the extra space from the start of the name\n\t\t\tprofessor = profFirstName + \" \" + profLastName;\n\t\t}\n\t\telse {\n\t\t\tprofessor = record.at(11);\n\t\t}\n\t}\n\n\tCourse* lookupCourse(string identifier)  {\n\t\treturn this;\t\n\t}\n\n\tvoid cleanTitle() {\n\t\tvector<string> badEndings, badBeginnings;\n\t\tbadEndings.push_back(\"Prerequisite\");\n\t\tbadEndings.push_back(\"Prerequsiite\");\n\t\tbadEndings.push_back(\"This course has class\");\n\t\tbadEndings.push_back(\"This course is open to \");\n\t\tbadEndings.push_back(\"First-Year Students may register only\");\n\t\tbadEndings.push_back(\"Open to \");\n\t\tbadEndings.push_back(\"Especially for \");\n\t\tbadEndings.push_back(\"Registration by permission of instructor only.\");\n\t\tbadEndings.push_back(\"Permission of instructor required.\");\n\t\tbadEndings.push_back(\"Not open to first-year students.\");\n\t\tbadEndings.push_back(\"Film screenings\");\n\t\tbadEndings.push_back(\"Open only to \");\n\t\tbadEndings.push_back(\"This course has been canceled.\");\n\t\tbadEndings.push_back(\"This course has been cancelled.\");\n\t\tbadEndings.push_back(\"Open only to seniors\");\n\t\tbadEndings.push_back(\"Closed during web registration.\");\n\t\tbadEndings.push_back(\"During course submission process\");\n\t\tbadEndings.push_back(\"Taught in English.\");\n\t\tbadEndings.push_back(\"Closed to First-Year Students.\");\n\t\tbadEndings.push_back(\"Closed to first-year students.\");\n\t\tbadEndings.push_back(\"New course\");\n\t\tbadEndings.push_back(\"This course does\");\n\t\tbadEndings.push_back(\"This course open to seniors only.\");\n\t\tbadEndings.push_back(\"This lab has been canceled.\");\n\t\tbadEndings.push_back(\"Permission of the instructor\");\n\t\tbadEndings.push_back(\"Registration restricted\");\n\t\tbadBeginnings.push_back(\"Top: \");\n\t\tbadBeginnings.push_back(\"Sem: \");\n\t\tbadBeginnings.push_back(\"Res: \");\n\t\t\n\t\tbadEndings.push_back(\"Students in \" + department[0].getFullName() + \" \" + tostring(number));\n\t\tbadEndings.push_back(\"Students in \" + department[0].getName() + \" \" + tostring(number));\n\t\t\/\/ cout << badEndings.back() << endl;\n\n\t\tfor (vector<string>::iterator i=badEndings.begin(); i != badEndings.end(); ++i)\n\t\t\ttitle = removeTrailingText(title, *i);\n\t\tfor (vector<string>::iterator i=badBeginnings.begin(); i != badBeginnings.end(); ++i)\n\t\t\ttitle = removeStartingText(title, *i);\n\t}\n\n\tvoid parseid(string str) {\n\t\t\/\/ Get the number of the course, aka the last three slots.\n\t\tstringstream(str.substr(str.size() - 3)) >> number;\n\n\t\t\/\/ Check if it's one of those dastardly \"split courses\".\n\t\tstring dept = str.substr(0,str.size()-3);\n\n\t\tif (str.find('\/') != string::npos) {\n\t\t\tdepartment.push_back(Department(dept.substr(0,2)));\n\t\t\tdepartment.push_back(Department(dept.substr(2,2)));\n\t\t}\n\t\telse {\n\t\t\tdepartment.push_back(Department(dept));\n\t\t}\n\t}\n\n\tvoid updateID() {\n\t\tstring dept;\n\t\tfor (std::vector<Department>::iterator i = department.begin(); i != department.end(); ++i) {\n\t\t\tdept += i->getName();\n\t\t\tif (department.size() > 1)\n\t\t\t\tdept += \"\/\";\n\t\t}\n\t\tid = dept + \" \" + tostring(number) + section;\n\t}\n\tstring getID() {\n\t\treturn id;\n\t}\n\n\tostream& getData(ostream &os) {\n\t\tupdateID();\n\t\tos << id << \" - \";\n\t\tos << title << \" | \";\n\t\tif (professor.length() > 0 && professor != \" \")\n\t\t\tos << professor;\n\t\treturn os;\n\t}\n\tvoid display();\n\n\tvoid showAll() {\n\t\tcout << id << section << endl;\n\t\tcout << \"Title: \" << title << endl;\n\t\tcout << \"Professor: \" << professor << endl;\n\t\tcout << \"Lab? \" << lab << endl;\n\t\tcout << \"Half-semester? \" << half_semester << endl;\n\t\tcout << \"Credits: \" << credits << endl;\n\t\tcout << \"Pass\/Fail? \" << pass_fail << endl;\n\t\tcout << \"Location: \" << location << endl;\n\t\tcout << endl;\n\t}\n};\n\nostream &operator<<(ostream &os, Course &item) { return item.getData(os); }\nvoid Course::display() { if(this==0) cout << *this << endl; }\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix incorrect gtk cursors. se-resize and sw-resize are reversed.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the KDE project\n    Copyright (C) 2007 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 \"tutorial3.h\"\n\n#include <Phonon\/MediaObject>\n#include <Phonon\/AudioPath>\n#include <Phonon\/AudioOutput>\n#include <Phonon\/Global>\n\n#include <QtGui\/QApplication>\n\n#include <kcomponentdata.h>\n#include <QtGui\/QHBoxLayout>\n#include <QtGui\/QFrame>\n#include <Phonon\/VolumeSlider>\n#include <QtGui\/QVBoxLayout>\n#include <Phonon\/SeekSlider>\n\nPlayerWidget::PlayerWidget()\n    : m_media(0)\n{\n}\n\nvoid PlayerWidget::delayedInit()\n{\n    if (!m_media) {\n        m_media = new Phonon::MediaObject(this);\n        Phonon::AudioPath *audioPath = new Phonon::AudioPath(this);\n        Phonon::AudioOutput *audioOutput = new Phonon::AudioOutput(Phonon::MusicCategory, this);\n        m_media->addAudioPath(audioPath);\n        audioPath->addOutput(audioOutput);\n\n        QHBoxLayout *topLayout = new QHBoxLayout(this);\n        QVBoxLayout *leftLayout = new QVBoxLayout(this);\n        topLayout->addLayout(leftLayout);\n        Phonon::VolumeSlider *vs = new Phonon::VolumeSlider(audioOutput, this);\n        vs->setOrientation(Qt::Vertical);\n        topLayout->addWidget(vs);\n        leftLayout->addWidget(new Phonon::SeekSlider(m_media, this));\n    }\n}\n\nvoid PlayerWidget::play(const QString &filename)\n{\n    delayedInit();\n    m_media->setCurrentSource(filename);\n    m_media->play();\n}\n\nMainWindow::MainWindow()\n    : m_fileView(this)\n{\n    setCentralWidget(&m_fileView);\n    m_fileView.setModel(&m_model);\n    m_fileView.setPreviewWidget(&m_player);\n\n    connect(&m_fileView, SIGNAL(updatePreviewWidget(const QModelIndex &)), SLOT(providePlayer(const QModelIndex &)));\n}\n\nvoid MainWindow::providePlayer(const QModelIndex &index)\n{\n    m_player.play(m_model.filePath(index));\n}\n\nint main(int argc, char **argv)\n{\n    QApplication app(argc, argv);\n    KComponentData(\"phonon-tutorial1\");\n    MainWindow mw;\n    mw.show();\n    return app.exec();\n}\n\n#include \"tutorial3.moc\"\n<commit_msg>nicer layout (code and GUI)<commit_after>\/*  This file is part of the KDE project\n    Copyright (C) 2007 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 \"tutorial3.h\"\n\n#include <Phonon\/MediaObject>\n#include <Phonon\/AudioPath>\n#include <Phonon\/AudioOutput>\n#include <Phonon\/Global>\n\n#include <QtGui\/QApplication>\n\n#include <kcomponentdata.h>\n#include <QtGui\/QHBoxLayout>\n#include <QtGui\/QFrame>\n#include <Phonon\/VolumeSlider>\n#include <QtGui\/QVBoxLayout>\n#include <Phonon\/SeekSlider>\n\nPlayerWidget::PlayerWidget()\n    : m_media(0)\n{\n}\n\nvoid PlayerWidget::delayedInit()\n{\n    if (!m_media) {\n        m_media = new Phonon::MediaObject(this);\n        Phonon::AudioPath *audioPath = new Phonon::AudioPath(this);\n        Phonon::AudioOutput *audioOutput = new Phonon::AudioOutput(Phonon::MusicCategory, this);\n        m_media->addAudioPath(audioPath);\n        audioPath->addOutput(audioOutput);\n\n        QHBoxLayout *topLayout = new QHBoxLayout(this);\n        QVBoxLayout *leftLayout = new QVBoxLayout(this);\n        Phonon::VolumeSlider *vs = new Phonon::VolumeSlider(audioOutput, this);\n        vs->setOrientation(Qt::Vertical);\n\n        topLayout->addLayout(leftLayout);\n        topLayout->addWidget(vs);\n\n        leftLayout->addWidget(new Phonon::SeekSlider(m_media, this));\n        leftLayout->addStretch();\n    }\n}\n\nvoid PlayerWidget::play(const QString &filename)\n{\n    delayedInit();\n    m_media->setCurrentSource(filename);\n    m_media->play();\n}\n\nMainWindow::MainWindow()\n    : m_fileView(this)\n{\n    setCentralWidget(&m_fileView);\n    m_fileView.setModel(&m_model);\n    m_fileView.setPreviewWidget(&m_player);\n\n    connect(&m_fileView, SIGNAL(updatePreviewWidget(const QModelIndex &)), SLOT(providePlayer(const QModelIndex &)));\n}\n\nvoid MainWindow::providePlayer(const QModelIndex &index)\n{\n    m_player.play(m_model.filePath(index));\n}\n\nint main(int argc, char **argv)\n{\n    QApplication app(argc, argv);\n    KComponentData(\"phonon-tutorial1\");\n    MainWindow mw;\n    mw.show();\n    return app.exec();\n}\n\n#include \"tutorial3.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <set>\n#include <vector>\n#include <stdlib.h>\n#include <stdint.h>\n#include <assert.h>\n\n#include <stdio.h>\n\n#include <sys\/mman.h>\n\n#include \"channel9.hpp\"\n#include \"memcheck.h\"\n#include \"bittwiddle.hpp\"\n#include \"forwardtable.hpp\"\n\nnamespace Channel9\n{\n\tclass GC::Markcompact : protected GC\n\t{\n\t\tstruct Block;\n\t\tstruct Chunk;\n\n\tpublic:\n\t\ttypedef unsigned char uchar;\n\n\t\tstruct Data\n\t\t{\n\t\t\tuint16_t m_type;\n\t\t\tuint8_t  m_block_size; \/\/so (this & ~((1<<blocksize)-1)) gives the pointer to the block header\n\t\t\tbool     m_mark;\n\t\t\tuint32_t m_count;   \/\/number of bytes of memory in this allocation\n\t\t\tuchar    m_data[0]; \/\/the actual data, 8 byte aligned\n\n\t\t\tData * next() const { return (Data*)((uchar*)(this + 1) + m_count); }\n\t\t\tBlock * block() const { return (Block *)((uintptr_t)this & ~((1 << m_block_size)-1)); }\n\t\t\tstatic Data *ptr_for(const void *ptr) { return (Data*)ptr - 1; }\n\t\t};\n\n\tprivate:\n\n\t\tstatic const double   GC_GROWTH_LIMIT = 2.0;\n\t\tstatic const uint64_t CHUNK_SIZE = 21;\n\t\tstatic const uint64_t BLOCK_SIZE = 12;\n\n\t\tstruct Block\n\t\t{\n\t\t\tuint32_t m_capacity;   \/\/in bytes, total size not including this header\n\t\t\tuint32_t m_next_alloc; \/\/in bytes, offset to the next allocation\n\t\t\tuint32_t m_in_use;     \/\/in bytes, how much is actually used, is m_next - unmarked Data pieces\n\t\t\tuint8_t  m_skipped;    \/\/how many times a block has skipped compaction\n\t\t\tuint8_t  m_block_size; \/\/used to initialize Data::m_block_size\n\t\t\tbool     m_mark;       \/\/has this anything block been reached yet?\n\t\t\tuchar    m_data[0];    \/\/actual memory\n\n\t\t\tvoid init(uint8_t block_size)\n\t\t\t{\n\t\t\t\tm_capacity = 1 << block_size;\n\t\t\t\tm_next_alloc = 0;\n\t\t\t\tm_in_use = 0;\n\t\t\t\tm_skipped = 0;\n\t\t\t\tm_block_size = block_size;\n\t\t\t\tm_mark = false;\n\t\t\t\tDO_DEBUG VALGRIND_CREATE_MEMPOOL(m_data, 0, false);\n\t\t\t}\n\n\t\t\tData * alloc(size_t size)\n\t\t\t{\n\t\t\t\tif(m_next_alloc + size <= m_capacity)\n\t\t\t\t{\n\t\t\t\t\tData * ret = (Data*)(m_data + m_next_alloc);\n\t\t\t\t\tm_next_alloc += size;\n\t\t\t\t\tDO_DEBUG VALGRIND_MEMPOOL_ALLOC(m_data, ret, size);\n\t\t\t\t\treturn ret;\n\t\t\t\t}\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tData * begin() const { return (Data *) m_data; }\n\t\t\tData * end()   const { return (Data *) (m_data + m_next_alloc); }\n\t\t\tBlock * next() const { return (Block*)((uchar*)(this + 1) + m_capacity); }\n\n\t\t\tvoid deadbeef()\n\t\t\t{\n\t\t\t\tuint32_t * i = (uint32_t *) m_data,\n\t\t\t\t         * e = (uint32_t *) (m_data + m_capacity);\n\t\t\t\tfor(; i < e; ++i)\n\t\t\t\t\t*i = 0xDEADBEEF;\n\t\t\t}\n\t\t};\n\n\n\t\tstruct Chunk\n\t\t{\n\t\t\tuint32_t m_capacity; \/\/in bytes\n\t\t\tuchar *  m_data;     \/\/pointer to actual memory\n\n\t\t\tvoid init(uint32_t c, Block * b)\n\t\t\t{\n\t\t\t\tm_capacity = c;\n\t\t\t\tm_data = (uchar *) b;\n\t\t\t}\n\n\t\t\tBlock * begin(){ return (Block *) m_data; }\n\t\t\tBlock * end()  { return (Block *) (m_data + m_capacity); }\n\t\t};\n\n\n\n\t\tstd::vector<Chunk>   m_chunks;       \/\/ list of all chunks\n\t\tstd::vector<Block *> m_empty_blocks; \/\/ list of empty blocks\n\t\tBlock * m_cur_block;\n\n\n\t\tForwardTable forward;\n\n\t\tenum GCPhase { Running, Marking, Compacting, Updating };\n\n\t\tGCPhase  m_gc_phase;\n\t\tuint64_t m_alloced;  \/\/how much memory are in all pools (active or not) combined\n\t\tuint64_t m_used;     \/\/how much memory is used by data blocks, not including the header\n\t\tuint64_t m_data_blocks; \/\/how many data allocations are in the current pool\n\t\tuint64_t m_next_gc;  \/\/garbage collect when m_next_gc < m_used\n\n\t\tstd::set<GCRoot*> m_roots;\n\n\t\tvoid collect();\n\n\t\tuchar *next(size_t size, uint16_t type)\n\t\t{\n\t\t\tassert(size < 8000);\n\n\t\t\tif(m_gc_phase == Running)\n\t\t\t\tDO_TRACEGC printf(\"Alloc %u type %x ... \", (unsigned)size, type);\n\n\t\t\tsize += (8 - size % 8) % 8; \/\/8 byte align\n\n\t\t\twhile(1){\n\t\t\t\tData * data = m_cur_block->alloc(size + sizeof(Data));\n\n\t\t\t\tif(data){\n\t\t\t\t\tm_used += size;\n\t\t\t\t\tm_data_blocks++;\n\n\t\t\t\t\tdata->m_type = type;\n\t\t\t\t\tdata->m_block_size = m_cur_block->m_block_size;\n\t\t\t\t\tdata->m_mark = false;\n\t\t\t\t\tdata->m_count = size;\n\n\n\t\t\t\t\tif(m_gc_phase == Running)\n\t\t\t\t\t\tDO_TRACEGC printf(\"alloc return %p\\n\", data->m_data);\n\n\t\t\t\t\treturn data->m_data;\n\t\t\t\t}\n\n\t\t\t\tif(m_empty_blocks.empty())\n\t\t\t\t\talloc_chunk();\n\n\t\t\t\tm_cur_block = m_empty_blocks.back();\n\t\t\t\tm_empty_blocks.pop_back();\n\t\t\t}\n\t\t\treturn NULL;\n\t\t}\n\n\t\tvoid alloc_chunk(unsigned int size = 0){\n\t\t\tif(size)\n\t\t\t\tsize = ceil_power2(size);\n\t\t\telse\n\t\t\t\tsize = 1<<CHUNK_SIZE;\n\n\t\t\tBlock * b = (Block *)mmap(NULL, size, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);\n\n\t\t\tprintf(\"alloc chunk %p, %i zeros\\n\", b, count_bottom_zeros4((uintptr_t)b));\n\n\t\t\tassert(count_bottom_zeros4((uintptr_t)b) >= BLOCK_SIZE); \/\/make sure blocks will be properly aligned\n\n\t\t\tm_alloced += size;\n\n\t\t\tChunk c;\n\t\t\tc.init(size, b);\n\n\t\t\tm_chunks.push_back(c);\n\n\t\t\tfor(Block * i = b; i != c.end(); i++){\n\t\t\t\ti->init(BLOCK_SIZE);\n\t\t\t\tm_empty_blocks.push_back(i);\n\t\t\t}\n\t\t}\n\n\tpublic:\n\t\tMarkcompact()\n\t\t : m_cur_block(NULL), m_gc_phase(Running), m_alloced(0), m_used(0), m_data_blocks(0), m_next_gc(0.9*(1<<CHUNK_SIZE))\n\t\t{\n\n\t\t\talloc_chunk();\n\n\t\t\tm_cur_block = m_empty_blocks.back();\n\t\t\tm_empty_blocks.pop_back();\n\n\t\t}\n\n\t\ttemplate <typename tObj>\n\t\ttObj *alloc(size_t extra, uint16_t type)\n\t\t{\n\t\t\treturn reinterpret_cast<tObj*>(next(sizeof(tObj) + extra, type));\n\t\t}\n\n\t\ttemplate <typename tObj>\n\t\tbool validate(tObj * from)\n\t\t{\n\t\t\tif(m_gc_phase != Running)\n\t\t\t\treturn true;\n\t\t\telse\n\t\t\t\treturn (Data::ptr_for(from)->m_mark == false);\n\t\t}\n\n\t\ttemplate <typename tObj>\n\t\tbool mark(tObj ** from)\n\t\t{\n\t\t\tData * d = Data::ptr_for(*from);\n\t\t\tswitch(m_gc_phase)\n\t\t\t{\n\t\t\tcase Running:\n\t\t\t\tassert(m_gc_phase != Running); \/\/shouldn't be calling mark when not in gc mode\n\t\t\tcase Marking: {\n\t\t\t\tif(d->m_mark)\n\t\t\t\t\treturn false;\n\n\t\t\t\td->m_mark = true;\n\n\t\t\t\tm_data_blocks++;\n\t\t\t\tm_used += d->m_count;\n\n\t\t\t\tBlock * b = d->block();\n\t\t\t\tif(!b->m_mark)\n\t\t\t\t{\n\t\t\t\t\tb->m_mark = true;\n\t\t\t\t\tb->m_in_use = 0;\n\t\t\t\t}\n\t\t\t\tb->m_in_use += d->m_count;\n\n\t\t\t\tgc_scan(*from);\n\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tcase Updating: {\n\t\t\t\ttObj * to = (tObj*)forward.get(d);\n\n\t\t\t\tbool ret = (to == *from);\n\t\t\t\tif(ret)\n\t\t\t\t{\n\t\t\t\t\t*from = to;\n\t\t\t\t\td = Data::ptr_for(to);\n\t\t\t\t}\n\n\t\t\t\tif(d->m_mark)\n\t\t\t\t{\n\t\t\t\t\td->m_mark = false;\n\t\t\t\t\tgc_scan(*from);\n\t\t\t\t}\n\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ make sure this object is ready to be read from\n\t\ttemplate <typename tObj>\n\t\tvoid read_barrier(tObj * obj) { }\n\n\t\t\/\/ tell the GC that obj will contain a reference to the object pointed to by ptr\n\t\ttemplate <typename tObj, typename tPtr>\n\t\tvoid write_barrier(tObj * obj, tPtr * ptr) { }\n\n\t\t\/\/ now is a valid time to stop the world\n\t\tvoid safe_point() {\n\t\t\tif(m_next_gc < m_used)\n\t\t\t\tcollect();\n\t\t}\n\n\t\tvoid register_root(GCRoot *root);\n\t\tvoid unregister_root(GCRoot *root);\n\t};\n}\n\n<commit_msg>Fix warning and non-portable flag in markcompact collector.<commit_after>#pragma once\n\n#include <set>\n#include <vector>\n#include <stdlib.h>\n#include <stdint.h>\n#include <assert.h>\n\n#include <stdio.h>\n\n#include <sys\/mman.h>\n\n#include \"channel9.hpp\"\n#include \"memcheck.h\"\n#include \"bittwiddle.hpp\"\n#include \"forwardtable.hpp\"\n\nnamespace Channel9\n{\n\tclass GC::Markcompact : protected GC\n\t{\n\t\tstruct Block;\n\t\tstruct Chunk;\n\n\tpublic:\n\t\ttypedef unsigned char uchar;\n\n\t\tstruct Data\n\t\t{\n\t\t\tuint16_t m_type;\n\t\t\tuint8_t  m_block_size; \/\/so (this & ~((1<<blocksize)-1)) gives the pointer to the block header\n\t\t\tbool     m_mark;\n\t\t\tuint32_t m_count;   \/\/number of bytes of memory in this allocation\n\t\t\tuchar    m_data[0]; \/\/the actual data, 8 byte aligned\n\n\t\t\tData * next() const { return (Data*)((uchar*)(this + 1) + m_count); }\n\t\t\tBlock * block() const { return (Block *)((uintptr_t)this & ~((1 << m_block_size)-1)); }\n\t\t\tstatic Data *ptr_for(const void *ptr) { return (Data*)ptr - 1; }\n\t\t};\n\n\tprivate:\n\n\t\tstatic const double   GC_GROWTH_LIMIT = 2.0;\n\t\tstatic const uint64_t CHUNK_SIZE = 21;\n\t\tstatic const uint64_t BLOCK_SIZE = 12;\n\n\t\tstruct Block\n\t\t{\n\t\t\tuint32_t m_capacity;   \/\/in bytes, total size not including this header\n\t\t\tuint32_t m_next_alloc; \/\/in bytes, offset to the next allocation\n\t\t\tuint32_t m_in_use;     \/\/in bytes, how much is actually used, is m_next - unmarked Data pieces\n\t\t\tuint8_t  m_skipped;    \/\/how many times a block has skipped compaction\n\t\t\tuint8_t  m_block_size; \/\/used to initialize Data::m_block_size\n\t\t\tbool     m_mark;       \/\/has this anything block been reached yet?\n\t\t\tuchar    m_data[0];    \/\/actual memory\n\n\t\t\tvoid init(uint8_t block_size)\n\t\t\t{\n\t\t\t\tm_capacity = 1 << block_size;\n\t\t\t\tm_next_alloc = 0;\n\t\t\t\tm_in_use = 0;\n\t\t\t\tm_skipped = 0;\n\t\t\t\tm_block_size = block_size;\n\t\t\t\tm_mark = false;\n\t\t\t\tDO_DEBUG VALGRIND_CREATE_MEMPOOL(m_data, 0, false);\n\t\t\t}\n\n\t\t\tData * alloc(size_t size)\n\t\t\t{\n\t\t\t\tif(m_next_alloc + size <= m_capacity)\n\t\t\t\t{\n\t\t\t\t\tData * ret = (Data*)(m_data + m_next_alloc);\n\t\t\t\t\tm_next_alloc += size;\n\t\t\t\t\tDO_DEBUG VALGRIND_MEMPOOL_ALLOC(m_data, ret, size);\n\t\t\t\t\treturn ret;\n\t\t\t\t}\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tData * begin() const { return (Data *) m_data; }\n\t\t\tData * end()   const { return (Data *) (m_data + m_next_alloc); }\n\t\t\tBlock * next() const { return (Block*)((uchar*)(this + 1) + m_capacity); }\n\n\t\t\tvoid deadbeef()\n\t\t\t{\n\t\t\t\tuint32_t * i = (uint32_t *) m_data,\n\t\t\t\t         * e = (uint32_t *) (m_data + m_capacity);\n\t\t\t\tfor(; i < e; ++i)\n\t\t\t\t\t*i = 0xDEADBEEF;\n\t\t\t}\n\t\t};\n\n\n\t\tstruct Chunk\n\t\t{\n\t\t\tuint32_t m_capacity; \/\/in bytes\n\t\t\tuchar *  m_data;     \/\/pointer to actual memory\n\n\t\t\tvoid init(uint32_t c, Block * b)\n\t\t\t{\n\t\t\t\tm_capacity = c;\n\t\t\t\tm_data = (uchar *) b;\n\t\t\t}\n\n\t\t\tBlock * begin(){ return (Block *) m_data; }\n\t\t\tBlock * end()  { return (Block *) (m_data + m_capacity); }\n\t\t};\n\n\n\n\t\tstd::vector<Chunk>   m_chunks;       \/\/ list of all chunks\n\t\tstd::vector<Block *> m_empty_blocks; \/\/ list of empty blocks\n\t\tBlock * m_cur_block;\n\n\n\t\tForwardTable forward;\n\n\t\tenum GCPhase { Running, Marking, Compacting, Updating };\n\n\t\tGCPhase  m_gc_phase;\n\t\tuint64_t m_alloced;  \/\/how much memory are in all pools (active or not) combined\n\t\tuint64_t m_used;     \/\/how much memory is used by data blocks, not including the header\n\t\tuint64_t m_data_blocks; \/\/how many data allocations are in the current pool\n\t\tuint64_t m_next_gc;  \/\/garbage collect when m_next_gc < m_used\n\n\t\tstd::set<GCRoot*> m_roots;\n\n\t\tvoid collect();\n\n\t\tuchar *next(size_t size, uint16_t type)\n\t\t{\n\t\t\tassert(size < 8000);\n\n\t\t\tif(m_gc_phase == Running)\n\t\t\t\tDO_TRACEGC printf(\"Alloc %u type %x ... \", (unsigned)size, type);\n\n\t\t\tsize += (8 - size % 8) % 8; \/\/8 byte align\n\n\t\t\twhile(1){\n\t\t\t\tData * data = m_cur_block->alloc(size + sizeof(Data));\n\n\t\t\t\tif(data){\n\t\t\t\t\tm_used += size;\n\t\t\t\t\tm_data_blocks++;\n\n\t\t\t\t\tdata->m_type = type;\n\t\t\t\t\tdata->m_block_size = m_cur_block->m_block_size;\n\t\t\t\t\tdata->m_mark = false;\n\t\t\t\t\tdata->m_count = size;\n\n\n\t\t\t\t\tif(m_gc_phase == Running)\n\t\t\t\t\t\tDO_TRACEGC printf(\"alloc return %p\\n\", data->m_data);\n\n\t\t\t\t\treturn data->m_data;\n\t\t\t\t}\n\n\t\t\t\tif(m_empty_blocks.empty())\n\t\t\t\t\talloc_chunk();\n\n\t\t\t\tm_cur_block = m_empty_blocks.back();\n\t\t\t\tm_empty_blocks.pop_back();\n\t\t\t}\n\t\t\treturn NULL;\n\t\t}\n\n\t\tvoid alloc_chunk(unsigned int size = 0){\n\t\t\tif(size)\n\t\t\t\tsize = ceil_power2(size);\n\t\t\telse\n\t\t\t\tsize = 1<<CHUNK_SIZE;\n\n\t\t\tBlock * b = (Block *)mmap(NULL, size, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, -1, 0);\n\n\t\t\tprintf(\"alloc chunk %p, %i zeros\\n\", b, (int)count_bottom_zeros4((uintptr_t)b));\n\n\t\t\tassert(count_bottom_zeros4((uintptr_t)b) >= BLOCK_SIZE); \/\/make sure blocks will be properly aligned\n\n\t\t\tm_alloced += size;\n\n\t\t\tChunk c;\n\t\t\tc.init(size, b);\n\n\t\t\tm_chunks.push_back(c);\n\n\t\t\tfor(Block * i = b; i != c.end(); i++){\n\t\t\t\ti->init(BLOCK_SIZE);\n\t\t\t\tm_empty_blocks.push_back(i);\n\t\t\t}\n\t\t}\n\n\tpublic:\n\t\tMarkcompact()\n\t\t : m_cur_block(NULL), m_gc_phase(Running), m_alloced(0), m_used(0), m_data_blocks(0), m_next_gc(0.9*(1<<CHUNK_SIZE))\n\t\t{\n\n\t\t\talloc_chunk();\n\n\t\t\tm_cur_block = m_empty_blocks.back();\n\t\t\tm_empty_blocks.pop_back();\n\n\t\t}\n\n\t\ttemplate <typename tObj>\n\t\ttObj *alloc(size_t extra, uint16_t type)\n\t\t{\n\t\t\treturn reinterpret_cast<tObj*>(next(sizeof(tObj) + extra, type));\n\t\t}\n\n\t\ttemplate <typename tObj>\n\t\tbool validate(tObj * from)\n\t\t{\n\t\t\tif(m_gc_phase != Running)\n\t\t\t\treturn true;\n\t\t\telse\n\t\t\t\treturn (Data::ptr_for(from)->m_mark == false);\n\t\t}\n\n\t\ttemplate <typename tObj>\n\t\tbool mark(tObj ** from)\n\t\t{\n\t\t\tData * d = Data::ptr_for(*from);\n\t\t\tswitch(m_gc_phase)\n\t\t\t{\n\t\t\tcase Running:\n\t\t\t\tassert(m_gc_phase != Running); \/\/shouldn't be calling mark when not in gc mode\n\t\t\tcase Marking: {\n\t\t\t\tif(d->m_mark)\n\t\t\t\t\treturn false;\n\n\t\t\t\td->m_mark = true;\n\n\t\t\t\tm_data_blocks++;\n\t\t\t\tm_used += d->m_count;\n\n\t\t\t\tBlock * b = d->block();\n\t\t\t\tif(!b->m_mark)\n\t\t\t\t{\n\t\t\t\t\tb->m_mark = true;\n\t\t\t\t\tb->m_in_use = 0;\n\t\t\t\t}\n\t\t\t\tb->m_in_use += d->m_count;\n\n\t\t\t\tgc_scan(*from);\n\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tcase Updating: {\n\t\t\t\ttObj * to = (tObj*)forward.get(d);\n\n\t\t\t\tbool ret = (to == *from);\n\t\t\t\tif(ret)\n\t\t\t\t{\n\t\t\t\t\t*from = to;\n\t\t\t\t\td = Data::ptr_for(to);\n\t\t\t\t}\n\n\t\t\t\tif(d->m_mark)\n\t\t\t\t{\n\t\t\t\t\td->m_mark = false;\n\t\t\t\t\tgc_scan(*from);\n\t\t\t\t}\n\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ make sure this object is ready to be read from\n\t\ttemplate <typename tObj>\n\t\tvoid read_barrier(tObj * obj) { }\n\n\t\t\/\/ tell the GC that obj will contain a reference to the object pointed to by ptr\n\t\ttemplate <typename tObj, typename tPtr>\n\t\tvoid write_barrier(tObj * obj, tPtr * ptr) { }\n\n\t\t\/\/ now is a valid time to stop the world\n\t\tvoid safe_point() {\n\t\t\tif(m_next_gc < m_used)\n\t\t\t\tcollect();\n\t\t}\n\n\t\tvoid register_root(GCRoot *root);\n\t\tvoid unregister_root(GCRoot *root);\n\t};\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Name:      file.cpp\n\/\/ Purpose:   Implementation of class wxExFile\n\/\/ Author:    Anton van Wezenbeek\n\/\/ Copyright: (c) 2012 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\/extension\/file.h>\n\nwxExFile::wxExFile(bool open_file)\n  : m_OpenFile(open_file)\n  , m_HasRead(false)\n  , m_FileName()\n  , m_Stat()\n{\n}\n\nwxExFile::wxExFile(\n  const wxFileName& filename,\n  wxFile::OpenMode mode,\n  bool open_file)\n  : wxFile(filename.GetFullPath(), mode)\n  , m_OpenFile(open_file)\n  , m_HasRead(false)\n  , m_Stat(filename.GetFullPath())\n{\n  m_FileName.Assign(filename);\n  MakeAbsolute();\n}\n\nbool wxExFile::CheckSync()\n{\n  \/\/ Might be used without wxApp.\n  wxConfigBase* config = wxConfigBase::Get(false);\n\n  if ( IsOpened() ||\n      !m_FileName.m_Stat.IsOk() ||\n      (config != NULL && !config->ReadBool(\"AllowSync\", true)))\n  {\n    return false;\n  }\n\n  if (m_FileName.m_Stat.Sync())\n  {\n    bool sync_needed = false;\n    \n    if (m_FileName.m_Stat.st_mtime != m_Stat.st_mtime)\n    {\n      \/\/ Do not check return value,\n      \/\/ we sync anyhow, to force nex time no sync.\n      Get(true);\n      \n      sync_needed = true;\n    }\n    \n    if (m_FileName.m_Stat.IsReadOnly() != m_Stat.IsReadOnly())\n    {\n      sync_needed = true;\n    }\n\n    if (sync_needed)\n    {\n          \/\/ Update the stat member, so next time no sync.\n      if (!m_Stat.Sync())\n      {\n        wxLogError(\"Could not sync: \" + m_FileName.GetFullPath());\n      }\n        \n      return true;\n    }\n  }\n  \n  return false;\n}\n\nbool wxExFile::FileLoad(const wxExFileName& filename)\n{\n  Assign(filename);\n  return m_FileName.FileExists() && MakeAbsolute() && Get(false);\n}\n\nvoid wxExFile::FileNew(const wxExFileName& filename)\n{\n  \/\/ Do not check return value, as file will not (yet) \n  \/\/ exist.\n  Assign(filename);\n  DoFileNew();\n}\n\nbool wxExFile::FileSave(const wxExFileName& filename)\n{\n  bool save_as = false;\n\n  if (filename.IsOk())\n  {\n    Assign(filename);\n    MakeAbsolute();\n    save_as = true;\n  }\n\n  if (m_OpenFile && !Open(m_FileName.GetFullPath(), wxFile::write))\n  {\n    return false;\n  }\n\n  DoFileSave(save_as);\n\n  if (IsOpened())\n  {\n    Close();\n  }\n\n  ResetContentsChanged();\n  \n  m_FileName.m_Stat.Sync();\n  m_Stat.Sync();\n\n  return true;\n}\n\nbool wxExFile::Get(bool synced)\n{\n  \/\/ Do not log error messages if opening fails.\n  {\n    wxLogNull logNo;\n  \n    if ( \n       synced && !Open(m_FileName.GetFullPath()) ||\n      !synced && m_OpenFile && !Open(m_FileName.GetFullPath()))\n    {\n      return false;\n    }\n  }\n\n  if (!DoFileLoad(synced))\n  {\n    if (IsOpened())\n    {\n      Close();\n    }\n    \n    return false;\n  }\n\n  if (IsOpened())\n  {\n    Close();\n  }\n\n  ResetContentsChanged();\n\n  return true;\n}\n\nconst wxCharBuffer wxExFile::Read(wxFileOffset seek_position)\n{\n  wxASSERT(IsOpened());\n  \n  if ((!m_HasRead && seek_position > 0) || \n      ( m_HasRead && Tell() != seek_position))\n  {\n    Seek(seek_position);\n  }\n\n  const wxFileOffset bytes_to_read = Length() - seek_position;\n\n  wxCharBuffer buffer(bytes_to_read);\n\n  if (wxFile::Read(buffer.data(), bytes_to_read) != bytes_to_read)\n  {\n    wxFAIL;\n  }\n  \n  m_HasRead = true;\n\n  return buffer;\n}\n<commit_msg>use wxLogStatus ot prevent reappearing dialogs<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Name:      file.cpp\n\/\/ Purpose:   Implementation of class wxExFile\n\/\/ Author:    Anton van Wezenbeek\n\/\/ Copyright: (c) 2014 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\/extension\/file.h>\n\nwxExFile::wxExFile(bool open_file)\n  : m_OpenFile(open_file)\n  , m_HasRead(false)\n  , m_FileName()\n  , m_Stat()\n{\n}\n\nwxExFile::wxExFile(\n  const wxFileName& filename,\n  wxFile::OpenMode mode,\n  bool open_file)\n  : wxFile(filename.GetFullPath(), mode)\n  , m_OpenFile(open_file)\n  , m_HasRead(false)\n  , m_Stat(filename.GetFullPath())\n{\n  m_FileName.Assign(filename);\n  MakeAbsolute();\n}\n\nbool wxExFile::CheckSync()\n{\n  \/\/ Might be used without wxApp.\n  wxConfigBase* config = wxConfigBase::Get(false);\n\n  if ( IsOpened() ||\n      !m_FileName.m_Stat.IsOk() ||\n      (config != NULL && !config->ReadBool(\"AllowSync\", true)))\n  {\n    return false;\n  }\n\n  if (m_FileName.m_Stat.Sync())\n  {\n    bool sync_needed = false;\n    \n    if (m_FileName.m_Stat.st_mtime != m_Stat.st_mtime)\n    {\n      \/\/ Do not check return value,\n      \/\/ we sync anyhow, to force nex time no sync.\n      Get(true);\n      \n      sync_needed = true;\n    }\n    \n    if (m_FileName.m_Stat.IsReadOnly() != m_Stat.IsReadOnly())\n    {\n      sync_needed = true;\n    }\n\n    if (sync_needed)\n    {\n      \/\/ Update the stat member, so next time no sync.\n      if (!m_Stat.Sync())\n      {\n        \/\/ This might be reported in an OnIdele, so do not use wxLogError.\n        wxLogStatus(\"Could not sync: \" + m_FileName.GetFullPath());\n      }\n        \n      return true;\n    }\n  }\n  \n  return false;\n}\n\nbool wxExFile::FileLoad(const wxExFileName& filename)\n{\n  Assign(filename);\n  return m_FileName.FileExists() && MakeAbsolute() && Get(false);\n}\n\nvoid wxExFile::FileNew(const wxExFileName& filename)\n{\n  \/\/ Do not check return value, as file will not (yet) \n  \/\/ exist.\n  Assign(filename);\n  DoFileNew();\n}\n\nbool wxExFile::FileSave(const wxExFileName& filename)\n{\n  bool save_as = false;\n\n  if (filename.IsOk())\n  {\n    Assign(filename);\n    MakeAbsolute();\n    save_as = true;\n  }\n\n  if (m_OpenFile && !Open(m_FileName.GetFullPath(), wxFile::write))\n  {\n    return false;\n  }\n\n  DoFileSave(save_as);\n\n  if (IsOpened())\n  {\n    Close();\n  }\n\n  ResetContentsChanged();\n  \n  m_FileName.m_Stat.Sync();\n  m_Stat.Sync();\n\n  return true;\n}\n\nbool wxExFile::Get(bool synced)\n{\n  \/\/ Do not log error messages if opening fails.\n  {\n    wxLogNull logNo;\n  \n    if ( \n       synced && !Open(m_FileName.GetFullPath()) ||\n      !synced && m_OpenFile && !Open(m_FileName.GetFullPath()))\n    {\n      return false;\n    }\n  }\n\n  if (!DoFileLoad(synced))\n  {\n    if (IsOpened())\n    {\n      Close();\n    }\n    \n    return false;\n  }\n\n  if (IsOpened())\n  {\n    Close();\n  }\n\n  ResetContentsChanged();\n\n  return true;\n}\n\nconst wxCharBuffer wxExFile::Read(wxFileOffset seek_position)\n{\n  wxASSERT(IsOpened());\n  \n  if ((!m_HasRead && seek_position > 0) || \n      ( m_HasRead && Tell() != seek_position))\n  {\n    Seek(seek_position);\n  }\n\n  const wxFileOffset bytes_to_read = Length() - seek_position;\n\n  wxCharBuffer buffer(bytes_to_read);\n\n  if (wxFile::Read(buffer.data(), bytes_to_read) != bytes_to_read)\n  {\n    wxFAIL;\n  }\n  \n  m_HasRead = true;\n\n  return buffer;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <algorithm>\n#include <memory>\n#include \"procinfo.h\"\n#include \"elfinfo.h\"\n#include \"dwarf.h\"\n\nextern \"C\" {\n#include \"proc_service.h\"\n}\n\nstatic int\nglobmatchR(const char *pattern, const char *name)\n{\n    for (;; name++) {\n        switch (*pattern) {\n        case '*':\n            \/\/ if the rest of the name matches the bit of pattern after '*', \n            for (;;) {\n                ++name;\n                if (globmatchR(pattern + 1, name))\n                    return 1;\n                if (*name == 0) \/\/ exhuasted name without finding a match\n                    return 0;\n            }\n        default:\n            if (*name != *pattern)\n                return 0;\n        }\n        if (*pattern++ == 0)\n            return 1;\n    }\n}\n\nstatic int\nglobmatch(std::string pattern, std::string name)\n{\n    return globmatchR(pattern.c_str(), name.c_str());\n}\n\n\nstruct ListedSymbol {\n    Elf_Sym sym;\n    Elf_Off objbase;\n    std::string objname;\n    size_t count;\n    std::string name;\n    ListedSymbol(const Elf_Sym &sym_, Elf_Off objbase_, std::string name_, std::string object)\n        : sym(sym_)\n        , objbase(objbase_)\n        , name(name_)\n        , count(0)\n        , objname(object)\n\n    {\n    }\n    Elf_Off memaddr() const { return  sym.st_value + objbase; }\n};\n\nconst bool operator < (const ListedSymbol &sym, Elf_Off addr) {\n    return sym.memaddr() + sym.sym.st_size < addr;\n}\n\nstruct Symcounter {\n    Elf_Off addr;\n    std::string name;\n    unsigned count;\n    struct ListedSymbol *sym;\n};\n\nstd::vector<Symcounter> counters;\n\nstatic const char *virtpattern = \"_ZTV*\"; \/* wildcard for all vtbls *\/\n\nint\nmain(int argc, char *argv[])\n{\n    std::shared_ptr<ElfObject> exec;\n    std::shared_ptr<ElfObject> core;\n    std::shared_ptr<Process> process;\n    int c;\n    int verbose = 0;\n\n    while ((c = getopt(argc, argv, \"vh\")) != -1) {\n        switch (c) {\n            case 'v': \n                debug = &std::clog;\n                verbose++;\n                break;\n            case 'h': \n                std::clog << \"usage: canal [exec] <core>\" << std::endl;\n                return 0;\n            case 'X':\n                ps_lgetfpregs(0, 0, 0);\n        }\n    }\n\n    if (argc - optind >= 2) {\n        auto file = std::make_shared<FileReader>(argv[optind]);\n        \/\/ It's a file:\n        exec = std::make_shared<ElfObject>(file);\n        optind++;\n    }\n\n    if (argc - optind >= 1) {\n        char *eoa;\n        pid_t pid = strtol(argv[optind], &eoa, 10);\n        core = std::make_shared<ElfObject>(std::make_shared<FileReader>(argv[optind]));\n        process = std::make_shared<CoreProcess>(exec, core);\n    }\n    std::clog << \"opened process \" << process << std::endl;\n\n    std::vector<ListedSymbol> listed;\n    for (auto &loaded : process->objects) {\n        size_t count = 0;\n        for (const auto sym : loaded.object->getSymbols(\".dynsym\")) {\n            if (globmatch(virtpattern, sym.second)) {\n                listed.push_back(ListedSymbol(sym.first, loaded.reloc, sym.second, loaded.object->io->describe()));\n                count++;\n            }\n        }\n        if (debug)\n            *debug << \"found \" << count << \" symbols in \" << loaded.object->io->describe() << std::endl;\n    }\n    std::sort(listed.begin()\n        , listed.end()\n        , [] (const ListedSymbol &l, const ListedSymbol &r) { return l.memaddr() < r.memaddr(); });\n\n    \/\/ Now run through the corefile, searching for virtual objects.\n    for (auto hdr : core->getSegments()) {\n        if (hdr.p_type != PT_LOAD)\n            continue;\n        Elf_Off p;\n        auto loc = hdr.p_vaddr;\n        auto end = loc + hdr.p_filesz;\n        if (debug)\n            *debug << \"scan \" << std::hex << loc <<  \" to \" << end;\n\n        for (Elf_Off readCount = 0; loc  < hdr.p_vaddr + hdr.p_filesz; loc += sizeof p) {\n            if (verbose && (loc - hdr.p_vaddr) % (1024 * 1024) == 0)\n                std::clog << '.';\n            process->io->readObj(loc, &p);\n            auto found = std::lower_bound(listed.begin(), listed.end(), p);\n            if (found != listed.end() && found->memaddr() <= p && found->memaddr() + found->sym.st_size > p) {\n                \/\/ std::cout << found->name << \" \" << loc << std::endl;\n                found->count++;\n            }\n        }\n        if (debug)\n            *debug << std::endl;\n    }\n\n    std::sort(listed.begin()\n        , listed.end()\n        , [] (const ListedSymbol &l, const ListedSymbol &r) { return l.count > r.count; });\n\n    for (auto &i : listed)\n        if (i.count)\n            std::cout << std::dec << i.count << \" \" << i.name << \" ( from \" << i.objname << \")\" << std::endl;\n}\n<commit_msg>Fix \"canal\"<commit_after>#include <iostream>\n#include <algorithm>\n#include <memory>\n#include \"procinfo.h\"\n#include \"elfinfo.h\"\n#include \"dwarf.h\"\n\nextern \"C\" {\n#include \"proc_service.h\"\n}\n\nstatic int\nglobmatchR(const char *pattern, const char *name)\n{\n    for (;; name++) {\n        switch (*pattern) {\n        case '*':\n            \/\/ if the rest of the name matches the bit of pattern after '*', \n            for (;;) {\n                ++name;\n                if (globmatchR(pattern + 1, name))\n                    return 1;\n                if (*name == 0) \/\/ exhuasted name without finding a match\n                    return 0;\n            }\n        default:\n            if (*name != *pattern)\n                return 0;\n        }\n        if (*pattern++ == 0)\n            return 1;\n    }\n}\n\nstatic int\nglobmatch(std::string pattern, std::string name)\n{\n    return globmatchR(pattern.c_str(), name.c_str());\n}\n\n\nstruct ListedSymbol {\n    Elf_Sym sym;\n    Elf_Off objbase;\n    std::string objname;\n    size_t count;\n    std::string name;\n    ListedSymbol(const Elf_Sym &sym_, Elf_Off objbase_, std::string name_, std::string object)\n        : sym(sym_)\n        , objbase(objbase_)\n        , name(name_)\n        , count(0)\n        , objname(object)\n\n    {\n    }\n    Elf_Off memaddr() const { return  sym.st_value + objbase; }\n};\n\nconst bool operator < (const ListedSymbol &sym, Elf_Off addr) {\n    return sym.memaddr() + sym.sym.st_size < addr;\n}\n\nstruct Symcounter {\n    Elf_Off addr;\n    std::string name;\n    unsigned count;\n    struct ListedSymbol *sym;\n};\n\nstd::vector<Symcounter> counters;\n\nstatic const char *virtpattern = \"_ZTV*\"; \/* wildcard for all vtbls *\/\n\nint\nmain(int argc, char *argv[])\n{\n    std::shared_ptr<ElfObject> exec;\n    std::shared_ptr<ElfObject> core;\n    std::shared_ptr<Process> process;\n    int c;\n    int verbose = 0;\n\n    while ((c = getopt(argc, argv, \"vh\")) != -1) {\n        switch (c) {\n            case 'v': \n                debug = &std::clog;\n                verbose++;\n                break;\n            case 'h': \n                std::clog << \"usage: canal [exec] <core>\" << std::endl;\n                return 0;\n            case 'X':\n                ps_lgetfpregs(0, 0, 0);\n        }\n    }\n\n    if (argc - optind >= 2) {\n        auto file = std::make_shared<FileReader>(argv[optind]);\n        \/\/ It's a file:\n        exec = std::make_shared<ElfObject>(file);\n        optind++;\n    }\n\n    if (argc - optind >= 1) {\n        char *eoa;\n        pid_t pid = strtol(argv[optind], &eoa, 10);\n        core = std::make_shared<ElfObject>(std::make_shared<FileReader>(argv[optind]));\n        process = std::make_shared<CoreProcess>(exec, core);\n    }\n    process->load();\n    std::clog << \"opened process \" << process << std::endl;\n\n    std::vector<ListedSymbol> listed;\n    for (auto &loaded : process->objects) {\n        size_t count = 0;\n        for (const auto sym : loaded.object->getSymbols(\".dynsym\")) {\n            if (globmatch(virtpattern, sym.second)) {\n                listed.push_back(ListedSymbol(sym.first, loaded.reloc, sym.second, loaded.object->io->describe()));\n                count++;\n            }\n        }\n        if (debug)\n            *debug << \"found \" << count << \" symbols in \" << loaded.object->io->describe() << std::endl;\n    }\n    std::sort(listed.begin()\n        , listed.end()\n        , [] (const ListedSymbol &l, const ListedSymbol &r) { return l.memaddr() < r.memaddr(); });\n\n    \/\/ Now run through the corefile, searching for virtual objects.\n    for (auto hdr : core->getSegments()) {\n        if (hdr.p_type != PT_LOAD)\n            continue;\n        Elf_Off p;\n        auto loc = hdr.p_vaddr;\n        auto end = loc + hdr.p_filesz;\n        if (debug)\n            *debug << \"scan \" << std::hex << loc <<  \" to \" << end;\n\n        for (Elf_Off readCount = 0; loc  < hdr.p_vaddr + hdr.p_filesz; loc += sizeof p) {\n            if (verbose && (loc - hdr.p_vaddr) % (1024 * 1024) == 0)\n                std::clog << '.';\n            process->io->readObj(loc, &p);\n            auto found = std::lower_bound(listed.begin(), listed.end(), p);\n            if (found != listed.end() && found->memaddr() <= p && found->memaddr() + found->sym.st_size > p) {\n                \/\/ std::cout << found->name << \" \" << loc << std::endl;\n                found->count++;\n            }\n        }\n        if (debug)\n            *debug << std::endl;\n    }\n\n    std::sort(listed.begin()\n        , listed.end()\n        , [] (const ListedSymbol &l, const ListedSymbol &r) { return l.count > r.count; });\n\n    for (auto &i : listed)\n        if (i.count)\n            std::cout << std::dec << i.count << \" \" << i.name << \" ( from \" << i.objname << \")\" << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ofApp.h\"\n\n\nusing namespace ofxCv;\nusing namespace cv;\n\n\nvoid ofApp::setup() {\n\t\/\/ofSetVerticalSync(true);\n\t\/\/ofSetFrameRate(120);\n\tfinder.setup(\"haarcascade_frontalface_default.xml\");\n\tfinder.setPreset(ObjectFinder::Fast);\n\tfinder.setFindBiggestObject(true);\n\t\/\/finder.getTracker().setSmoothingRate(.3);\n\t\/\/ samller = smoother\n\tfinder.getTracker().setSmoothingRate(0.2);\n\t\/\/ ignore low-contrast regions\n\tfinder.setCannyPruning(true);\n\t\/\/cam.listDevices();\n\tcam.setDeviceID(0);\n\tcam.setup(CAM_WIDTH, CAM_HEIGHT);\n\t\/\/cam.setup(640,480);\n\t\/\/sunglasses.load(\"sunglasses.png\");\n\t\/\/ofEnableAlphaBlending();\n\tdrawcam = false;\n\tb.init();\n\tofBackground(ofColor(20, 20, 20));\n\n\t\n\treset_game();\n\tfaceCenter.set(CAM_WIDTH \/ 2.0, CAM_HEIGHT \/ 2.0);\n\t\/\/ofRectMode(OF_RECTMODE_CENTER);\n\n\n\t\/\/ set up font  \n\t\/\/font.loadFont(\"verdana.ttf\", 36, true, false, true, 0.1);\n\tfont.loadFont(\"Hyperspace.otf\", 36, true, false, true, 0.1);\n\n\t\/\/ set up field\n\t\/*field.addVertex(ofVec3f(20, 20));\n\tfield.addColor(ofColor::red);\n\tfield.addVertex(ofVec3f(40, 20));\n\tfield.addColor(ofColor::red);\n\tfield.addVertex(ofVec3f(40, 40));\n\tfield.addColor(ofColor::red);\n\tfield.addVertex(ofVec3f(20, 40));\n\tfield.addColor(ofColor::red);\n\tfield.setMode(OF_PRIMITIVE_TRIANGLE_FAN);\n*\/\n\n\tfloat f_width = fabs(Z_FIELD_END - Z_FIELD_START);\n\tfield = field.plane(f_width \/ 2., f_width, 11, 21);\n\t\/\/field.setMode(OF_PRIMITIVE_TRIANGLE_FAN);\n\tgoalRect.set(ofGetWidth() \/ 2 - 200., ofGetHeight() - 100, 400, 200);\n\n\n}\n\n\nvoid ofApp::reset_game(void) {\n\t\/\/ draw the score and the game world\n\tofApp::drop_faces = 0;\n\tscore = 0;\n\tpaddleSize = 300;\n\tstate.set(S_IDLE, 0);\n\tb.reset();\n\tcout << \"RESET\\n\";\n\n}\n\nvoid ofApp::update() {\n\n\tcam.update();\n\tif (cam.isFrameNew()) {\n\t\tfinder.update(cam);\n\t}\n\n\tif (finder.size() > 0) {\n\n\t\tint i = 0;\n\t\tfaceRect = finder.getObjectSmoothed(i);\n\t\t\/\/ flip X coordinate\n\t\tfaceRect.x = CAM_WIDTH - faceRect.x - faceRect.width;\n\n\t\tofPoint fc = faceRect.getCenter();\n\t\t\/\/ scale center so we can reach the entire screen\n\t\tfloat border = SCREEN_WIDTH*(SCALE_FACE_POS - 1.);\n\t\tfc.x = ofMap(fc.x, 0., CAM_WIDTH, -border, SCREEN_WIDTH + border);\n\t\tborder = SCREEN_HEIGHT*(SCALE_FACE_POS - 1.);\n\t\tfc.y = ofMap(fc.y, 0., CAM_HEIGHT,  -border, SCREEN_HEIGHT + border );\n\t\tfc.x -= paddleSize \/ 2;\n\t\tfc.y -= paddleSize \/ 2;\n\t\tpaddleRect.set(fc.x, fc.y, paddleSize, paddleSize);\n\n\t}\n\n\tb.update(state.state);\n\n\n\t\/\/ if we got here, we've missed\n\tif (b.pos.z > Z_NEAR) {\n\t\tcout << \"MISS!\\n\";\n\t\tb.reset();\n\t}\n\n\n\tswitch (state.state) {\n\tcase S_IDLE:\n\t\tif (finder.size()) {\n\t\t\tstate.set(S_FORWARD,0);\n\t\t\tdrop_faces = 0;\n\t\t}\n\t\tbreak;\n\n\tcase S_FORWARD:\n\t\tif (finder.size() == 0) {\n\t\t\tdrop_faces++;\n\t\t\tif (drop_faces > DROPPED_FACES_THRESH) {\n\t\t\t\tdrop_faces = 0;\n\t\t\t\treset_game();\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tdrop_faces = 0;\n\t\t}\n\n\t\t\/\/ test for collision\n\t\tif ((b.pos.z > Z_CLOSE)) {\n\t\t\tif (paddleRect.inside(b.pos.x, b.pos.y)) {\n\t\t\t\tcout << \"Bounce!\\n\";\n\t\t\t\tstate.set(S_BACKWARD,0);\n\t\t\t\tif (loc_flag) {\n\t\t\t\t\t\/\/ get distance of ball impact from paddle center\n\t\t\t\t\tofPoint bc = ofPoint(b.pos.x, b.pos.y, b.pos.z);\n\t\t\t\t\tofPoint pc = paddleRect.getCenter();\n\t\t\t\t\t\/\/ make it at the same z plane as ball\n\t\t\t\t\tofVec3f spin = pc - bc;\n\t\t\t\t\t\/\/ we don't care about Z distance\n\t\t\t\t\tspin.z = 0;\n\t\t\t\t\t\/\/ compute return vector to make ball hit center of goal\n\t\t\t\t\tofPoint gc = goalRect.getCenter();\n\t\t\t\t\tgc.z = Z_FIELD_END;\n\t\t\t\t\t\/\/ move goal center by scaled spin offset. Increasing spin means harder\n\t\t\t\t\tgc = gc + (4 * spin);\n\t\t\t\t\tofVec3f straight = gc - bc;\n\t\t\t\t\tb.bounce(straight \/ 100.0);\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcv::Vec2f v = finder.getVelocity(0);\n\t\t\t\t\tofVec2f spin = toOf(v);\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t\telse {\n\t\t\t\tstate.set(S_IDLE,0);\n\t\t\t}\n\n\t\t}\n\t\tbreak;\n\tcase S_BACKWARD:\n\t\tcout << \"ball:\" << b.getCenter() << \" Z \" << b.pos.z;\n\t\tcout << \" goal \" << goalRect.getCenter() << \" Z \" <<  Z_FIELD_END << \"\\n\";\n\n\t\tif (b.pos.z < Z_FIELD_END) {\n\t\t\tb.reset();\n\t\t\tcelebrate = Z_FAR \/ 2;\n\t\t\tscore++;\n\t\t\tcout << \"WIN!\" << \"score \" << score << \"\\n\";\n\t\t\tstate.set(S_CELEBRATE,0);\n\t\t}\n\t\tbreak;\n\tcase S_CELEBRATE:\n\t\tif (celebrate > 300) {\n\t\t\tb.reset();\n\t\t\tstate.set(S_IDLE,0);\n\t\t}\n\t\tbreak;\n\n\t}\n\n}\n\nvoid ofApp::draw_world(void) {\n\t\/\/ draw the score and the game world\n\t\/\/draw score\n\n\n  \n\tfor (int i = 0; i<arguments.size(); ++i) {\n\t\tofDrawBitmapString(arguments.at(i), 20.0f, 20.0f*i);\n\t}\n\n\tofPushMatrix();\n\tofTranslate(0, 0, 0);\n\tofSetColor(0, 255, 0);\/\/stroke color \n\tsprintf(score_str, \"SCORE %02d\", score);\n\tfont.drawString(score_str, ofGetWidth() - 220, 50);\n\t\/\/font.drawStringAsShapes(\"test\", ofGetWidth() \/ 2 + 20, ofGetHeight() \/ 2);\n\tofPopMatrix();\n\n\t\/\/ draw goal\n\tofPushMatrix();\n\tofSetColor(0, 128, 0, 128);\n\tofFill();\n\tofTranslate(0., 0., Z_FIELD_END);\n\tofDrawRectRounded(goalRect, 20);\n\tofPopMatrix();\n\n\t\/\/ draw field\n\tofPushMatrix();\n\tofTranslate(ofGetWidth() \/ 2., ofGetHeight(), Z_FIELD_START);\n\t\/\/ofTranslate(ofGetWidth() \/ 2., ofGetHeight() \/ 2., 30);\n\tofRotateX(90.);\n\tofNoFill();\n\tofSetColor(0, 255, 0);\n\tfield.drawWireframe();\n\tofPopMatrix();\n\n}\n\nvoid ofApp::draw() {\n\tfloat spinX = sin(ofGetElapsedTimef()*.35f);\n\tfloat spinY = cos(ofGetElapsedTimef()*.075f);\n\n\tofPolyline debug;\n\tofPoint gc = ofPoint(goalRect.getCenter());\n\tgc.z = Z_FIELD_END;\n\tofPoint bc = ofPoint(b.pos.x, b.pos.y, b.pos.z);\n\n\n\t\n\tdebug.addVertex(bc);\n\tdebug.addVertex(gc);\n\tofSetColor(255, 0, 0);\n\tdebug.draw();\n\n\tofDrawBitmapString(\"fps: \" + ofToString(ofGetFrameRate()), 20, 20);\n\n\n\tif (drawcam) {\n\t\tofSetColor(255, 255, 255);\/\/stroke color  \n\t\tcam.draw(CAM_WIDTH, 0, -CAM_WIDTH, CAM_HEIGHT);\n\t}\n\n\tdraw_world();\n\t\/\/ future work, pick biggest face rectangle\n\t\/\/for (int i = 0; i < finder.size(); i++) {\n\n\t\/\/ draw paddle\n\tofNoFill();\n\t\/\/ Draw paddle\n\tfor (float z = Z_NEAR; z > Z_NEAR - 151; z -= 50) {\n\t\tofPushMatrix();\n\t\tofSetColor(0, 255, 255); \/\/stroke color \n\t\tofTranslate(0., 0., z);\n\t\tofDrawRectRounded(paddleRect, 30);\n\t\tofPopMatrix();\n\t}\n\n\n\t\/\/ofPushMatrix();\n\t\/\/ofTranslate(0, 0, Z_CLOSE);\n\t\/\/ofDrawRectRounded(paddleRect, 50);\n\t\/\/ofPopMatrix();\n\n\tswitch (state.state) {\n\tcase S_FORWARD:\n\tcase S_BACKWARD:\n\tcase S_IDLE:\n\t\tb.draw();\n\t\tbreak;\n\tcase S_CELEBRATE:\n\t\tupdate_celebrate(1);\n\t\tbreak;\n\t}\n\n}\n\nvoid ofApp::update_celebrate(int win) {\n\n\tcelebrate += 10;\n\n\tofPushMatrix();\n\t\/\/ofTranslate(ofGetWidth() \/ 2., ofGetHeight() \/ 2., Z_FAR);\n\n\n\tofTranslate(ofGetWidth() \/ 2., ofGetHeight() \/ 2., celebrate);\n\tif (win) {\n\t\tofRotateX(float(celebrate \/ 2.));\n\t\tofRectangle rect = font.getStringBoundingBox(\"GOAL!!!\", 0, 0);\n\t\tfont.drawStringAsShapes(\"GOAL!!!\", -rect.width \/ 2., 0);\n\n\t}\n\telse {\n\t\tofRectangle rect = font.getStringBoundingBox(\"MISS\", 0, 0);\n\t\tfont.drawStringAsShapes(\"MISS\", -rect.width \/ 2., -Z_FAR - celebrate);\n\t}\n\tofPopMatrix();\n\n}\n\n\n\n\n\/\/--------------------------------------------------------------\nvoid ofApp::keyPressed(int key) {\n\t\n\tofPoint gc = goalRect.getCenter();\n\tgc.z = Z_FIELD_END;\n\tofPoint bc = ofPoint(b.pos.x, b.pos.y, b.pos.z);\n\n\tofVec3f straight = gc - bc;\n\n\n\tswitch (key) {\n\tcase 'c':\n\t\tdrawcam = !drawcam;\n\t\tbreak;\n\n\tcase 'f':\n\t\tofSetFullscreen(true);\n\t\tbreak;\n\n\tcase 'n':\n\t\tofSetFullscreen(false);\n\t\tbreak;\n\n\tcase 'b':\n\t\t\/\/ bounce\n\t\tcout << \"bounce request \\n\";\n\t\tcout << \"ball:\" << b.getCenter() << \" Z \" << b.pos.z;\n\t\tcout << \" goal \" << goalRect.getCenter() << \" Z \" << Z_FIELD_END << \"\\n\";\n\t\tcout << \" direction: \" << straight << \"\\n\";\n\n\t\tstate.set(S_BACKWARD,0);\n\t\tb.bounce(straight \/ 100.0);\n\t\tbreak;\n\n\tcase 'x':\n\t\tofExit();\n\t\tbreak;\n\n\t}\n\n\n}\n\n\n\/\/ State machine handling ------------------------------------------------------------\nvoid StateMach::set(int next_state, float timeout) {\n\tstate = next_state;\n\ttimeout_time = timeout;\n\t\/\/ default no timeout\n\tif (timeout >= 0) {\n\t\tofResetElapsedTimeCounter();\n\t\treset_timer();\n\t}\n\tprint();\n}\n\nvoid StateMach::reset_timer(void) {\n\tstart_time = ofGetElapsedTimef();\n}\n\nfloat StateMach::time_elapsed(void) {\n\treturn(ofGetElapsedTimef() - start_time);\n}\n\n\/\/ return the fraction of elapsed time that has passed \nfloat StateMach::frac_time_elapsed(void) {\n\tif (time_elapsed() > timeout_time) {\n\t\treturn 1.0;\n\t}\n\treturn(time_elapsed() \/ timeout_time);\n}\n\n\nbool StateMach::timeout(void) {\n\tif (timeout_time < 0)\n\t\treturn(true);\n\tif (time_elapsed() > timeout_time)\n\t\treturn(true);\n\treturn(false);\n}\n\nvoid StateMach::print(void) {\n\tswitch (state) {\n\tcase S_IDLE:\n\t\tcout << \"State: IDLE\\n\";\n\t\tbreak;\n\tcase S_FORWARD:\n\t\tcout << \"State: FORWARD\\n\";\n\t\tbreak;\n\tcase S_BACKWARD:\n\t\tcout << \"State: BACKWARD\\n\";\n\t\tbreak;\n\tcase S_CELEBRATE:\n\t\tcout << \"State: CELEBRATE\\n\";\n\t\tbreak;\n\t}\n}\nvoid ofApp::clean_exit(int signal) {\n\t\/\/ clean exit, signal handler\n\tcout << \"FACEBALL Exit signal caught, bye!\\n\";\n\tofExit();\n}\n<commit_msg>print fps<commit_after>#include \"ofApp.h\"\n\n\nusing namespace ofxCv;\nusing namespace cv;\n\n\nvoid ofApp::setup() {\n\t\/\/ofSetVerticalSync(true);\n\t\/\/ofSetFrameRate(120);\n\tfinder.setup(\"haarcascade_frontalface_default.xml\");\n\tfinder.setPreset(ObjectFinder::Fast);\n\tfinder.setFindBiggestObject(true);\n\t\/\/finder.getTracker().setSmoothingRate(.3);\n\t\/\/ samller = smoother\n\tfinder.getTracker().setSmoothingRate(0.2);\n\t\/\/ ignore low-contrast regions\n\t\/\/finder.setCannyPruning(true);\n\t\/\/cam.listDevices();\n\tcam.setDeviceID(0);\n\tcam.setup(CAM_WIDTH, CAM_HEIGHT);\n\t\/\/cam.setup(640,480);\n\t\/\/sunglasses.load(\"sunglasses.png\");\n\t\/\/ofEnableAlphaBlending();\n\tdrawcam = false;\n\tb.init();\n\tofBackground(ofColor(20, 20, 20));\n\n\t\n\treset_game();\n\tfaceCenter.set(CAM_WIDTH \/ 2.0, CAM_HEIGHT \/ 2.0);\n\t\/\/ofRectMode(OF_RECTMODE_CENTER);\n\n\n\t\/\/ set up font  \n\t\/\/font.loadFont(\"verdana.ttf\", 36, true, false, true, 0.1);\n\tfont.loadFont(\"Hyperspace.otf\", 36, true, false, true, 0.1);\n\n\t\/\/ set up field\n\t\/*field.addVertex(ofVec3f(20, 20));\n\tfield.addColor(ofColor::red);\n\tfield.addVertex(ofVec3f(40, 20));\n\tfield.addColor(ofColor::red);\n\tfield.addVertex(ofVec3f(40, 40));\n\tfield.addColor(ofColor::red);\n\tfield.addVertex(ofVec3f(20, 40));\n\tfield.addColor(ofColor::red);\n\tfield.setMode(OF_PRIMITIVE_TRIANGLE_FAN);\n*\/\n\n\tfloat f_width = fabs(Z_FIELD_END - Z_FIELD_START);\n\tfield = field.plane(f_width \/ 2., f_width, 11, 21);\n\t\/\/field.setMode(OF_PRIMITIVE_TRIANGLE_FAN);\n\tgoalRect.set(ofGetWidth() \/ 2 - 200., ofGetHeight() - 100, 400, 200);\n\n\n}\n\n\nvoid ofApp::reset_game(void) {\n\t\/\/ draw the score and the game world\n\tofApp::drop_faces = 0;\n\tscore = 0;\n\tpaddleSize = 300;\n\tstate.set(S_IDLE, 0);\n\tb.reset();\n\tcout << \"RESET\\n\";\n\n}\n\nvoid ofApp::update() {\n\n\tcam.update();\n\tif (cam.isFrameNew()) {\n\t\tfinder.update(cam);\n\t}\n\n\tif (finder.size() > 0) {\n\n\t\tint i = 0;\n\t\tfaceRect = finder.getObjectSmoothed(i);\n\t\t\/\/ flip X coordinate\n\t\tfaceRect.x = CAM_WIDTH - faceRect.x - faceRect.width;\n\n\t\tofPoint fc = faceRect.getCenter();\n\t\t\/\/ scale center so we can reach the entire screen\n\t\tfloat border = SCREEN_WIDTH*(SCALE_FACE_POS - 1.);\n\t\tfc.x = ofMap(fc.x, 0., CAM_WIDTH, -border, SCREEN_WIDTH + border);\n\t\tborder = SCREEN_HEIGHT*(SCALE_FACE_POS - 1.);\n\t\tfc.y = ofMap(fc.y, 0., CAM_HEIGHT,  -border, SCREEN_HEIGHT + border );\n\t\tfc.x -= paddleSize \/ 2;\n\t\tfc.y -= paddleSize \/ 2;\n\t\tpaddleRect.set(fc.x, fc.y, paddleSize, paddleSize);\n\n\t}\n\n\tb.update(state.state);\n\n\n\t\/\/ if we got here, we've missed\n\tif (b.pos.z > Z_NEAR) {\n\t\tcout << \"MISS!\\n\";\n\t\tb.reset();\n\t}\n\n\n\tswitch (state.state) {\n\tcase S_IDLE:\n\t\tif (finder.size()) {\n\t\t\tstate.set(S_FORWARD,0);\n\t\t\tdrop_faces = 0;\n\t\t}\n\t\tbreak;\n\n\tcase S_FORWARD:\n\t\tif (finder.size() == 0) {\n\t\t\tdrop_faces++;\n\t\t\tif (drop_faces > DROPPED_FACES_THRESH) {\n\t\t\t\tdrop_faces = 0;\n\t\t\t\treset_game();\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tdrop_faces = 0;\n\t\t}\n\n\t\t\/\/ test for collision\n\t\tif ((b.pos.z > Z_CLOSE)) {\n\t\t\tif (paddleRect.inside(b.pos.x, b.pos.y)) {\n\t\t\t\tcout << \"Bounce!\\n\";\n\t\t\t\tstate.set(S_BACKWARD,0);\n\t\t\t\tif (loc_flag) {\n\t\t\t\t\t\/\/ get distance of ball impact from paddle center\n\t\t\t\t\tofPoint bc = ofPoint(b.pos.x, b.pos.y, b.pos.z);\n\t\t\t\t\tofPoint pc = paddleRect.getCenter();\n\t\t\t\t\t\/\/ make it at the same z plane as ball\n\t\t\t\t\tofVec3f spin = pc - bc;\n\t\t\t\t\t\/\/ we don't care about Z distance\n\t\t\t\t\tspin.z = 0;\n\t\t\t\t\t\/\/ compute return vector to make ball hit center of goal\n\t\t\t\t\tofPoint gc = goalRect.getCenter();\n\t\t\t\t\tgc.z = Z_FIELD_END;\n\t\t\t\t\t\/\/ move goal center by scaled spin offset. Increasing spin means harder\n\t\t\t\t\tgc = gc + (4 * spin);\n\t\t\t\t\tofVec3f straight = gc - bc;\n\t\t\t\t\tb.bounce(straight \/ 100.0);\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcv::Vec2f v = finder.getVelocity(0);\n\t\t\t\t\tofVec2f spin = toOf(v);\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t\telse {\n\t\t\t\tstate.set(S_IDLE,0);\n\t\t\t}\n\n\t\t}\n\t\tbreak;\n\tcase S_BACKWARD:\n\t\tcout << \"ball:\" << b.getCenter() << \" Z \" << b.pos.z;\n\t\tcout << \" goal \" << goalRect.getCenter() << \" Z \" <<  Z_FIELD_END << \"\\n\";\n\n\t\tif (b.pos.z < Z_FIELD_END) {\n\t\t\tb.reset();\n\t\t\tcelebrate = Z_FAR \/ 2;\n\t\t\tscore++;\n\t\t\tcout << \"WIN!\" << \"score \" << score << \"\\n\";\n\t\t\tstate.set(S_CELEBRATE,0);\n\t\t}\n\t\tbreak;\n\tcase S_CELEBRATE:\n\t\tif (celebrate > 300) {\n\t\t\tb.reset();\n\t\t\tstate.set(S_IDLE,0);\n\t\t}\n\t\tbreak;\n\n\t}\n\n}\n\nvoid ofApp::draw_world(void) {\n\t\/\/ draw the score and the game world\n\t\/\/draw score\n\n\n  \n\tfor (int i = 0; i<arguments.size(); ++i) {\n\t\tofDrawBitmapString(arguments.at(i), 20.0f, 20.0f*i);\n\t}\n\n\tofPushMatrix();\n\tofTranslate(0, 0, 0);\n\tofSetColor(0, 255, 0);\/\/stroke color \n\tsprintf(score_str, \"SCORE %02d\", score);\n\tfont.drawString(score_str, ofGetWidth() - 220, 50);\n\t\/\/font.drawStringAsShapes(\"test\", ofGetWidth() \/ 2 + 20, ofGetHeight() \/ 2);\n\tofPopMatrix();\n\n\t\/\/ draw goal\n\tofPushMatrix();\n\tofSetColor(0, 128, 0, 128);\n\tofFill();\n\tofTranslate(0., 0., Z_FIELD_END);\n\tofDrawRectRounded(goalRect, 20);\n\tofPopMatrix();\n\n\t\/\/ draw field\n\tofPushMatrix();\n\tofTranslate(ofGetWidth() \/ 2., ofGetHeight(), Z_FIELD_START);\n\t\/\/ofTranslate(ofGetWidth() \/ 2., ofGetHeight() \/ 2., 30);\n\tofRotateX(90.);\n\tofNoFill();\n\tofSetColor(0, 255, 0);\n\tfield.drawWireframe();\n\tofPopMatrix();\n\n}\n\nvoid ofApp::draw() {\n\tfloat spinX = sin(ofGetElapsedTimef()*.35f);\n\tfloat spinY = cos(ofGetElapsedTimef()*.075f);\n\n\tofPolyline debug;\n\tofPoint gc = ofPoint(goalRect.getCenter());\n\tgc.z = Z_FIELD_END;\n\tofPoint bc = ofPoint(b.pos.x, b.pos.y, b.pos.z);\n\n\n\t\n\tdebug.addVertex(bc);\n\tdebug.addVertex(gc);\n\tofSetColor(255, 0, 0);\n\tdebug.draw();\n\n\tofDrawBitmapString(\"fps: \" + ofToString(ofGetFrameRate()), 50, 100);\n\n\n\tif (drawcam) {\n\t\tofSetColor(255, 255, 255);\/\/stroke color  \n\t\tcam.draw(CAM_WIDTH, 0, -CAM_WIDTH, CAM_HEIGHT);\n\t}\n\n\tdraw_world();\n\t\/\/ future work, pick biggest face rectangle\n\t\/\/for (int i = 0; i < finder.size(); i++) {\n\n\t\/\/ draw paddle\n\tofNoFill();\n\t\/\/ Draw paddle\n\tfor (float z = Z_NEAR; z > Z_NEAR - 151; z -= 50) {\n\t\tofPushMatrix();\n\t\tofSetColor(0, 255, 255); \/\/stroke color \n\t\tofTranslate(0., 0., z);\n\t\tofDrawRectRounded(paddleRect, 30);\n\t\tofPopMatrix();\n\t}\n\n\n\t\/\/ofPushMatrix();\n\t\/\/ofTranslate(0, 0, Z_CLOSE);\n\t\/\/ofDrawRectRounded(paddleRect, 50);\n\t\/\/ofPopMatrix();\n\n\tswitch (state.state) {\n\tcase S_FORWARD:\n\tcase S_BACKWARD:\n\tcase S_IDLE:\n\t\tb.draw();\n\t\tbreak;\n\tcase S_CELEBRATE:\n\t\tupdate_celebrate(1);\n\t\tbreak;\n\t}\n\n}\n\nvoid ofApp::update_celebrate(int win) {\n\n\tcelebrate += 10;\n\n\tofPushMatrix();\n\t\/\/ofTranslate(ofGetWidth() \/ 2., ofGetHeight() \/ 2., Z_FAR);\n\n\n\tofTranslate(ofGetWidth() \/ 2., ofGetHeight() \/ 2., celebrate);\n\tif (win) {\n\t\tofRotateX(float(celebrate \/ 2.));\n\t\tofRectangle rect = font.getStringBoundingBox(\"GOAL!!!\", 0, 0);\n\t\tfont.drawStringAsShapes(\"GOAL!!!\", -rect.width \/ 2., 0);\n\n\t}\n\telse {\n\t\tofRectangle rect = font.getStringBoundingBox(\"MISS\", 0, 0);\n\t\tfont.drawStringAsShapes(\"MISS\", -rect.width \/ 2., -Z_FAR - celebrate);\n\t}\n\tofPopMatrix();\n\n}\n\n\n\n\n\/\/--------------------------------------------------------------\nvoid ofApp::keyPressed(int key) {\n\t\n\tofPoint gc = goalRect.getCenter();\n\tgc.z = Z_FIELD_END;\n\tofPoint bc = ofPoint(b.pos.x, b.pos.y, b.pos.z);\n\n\tofVec3f straight = gc - bc;\n\n\n\tswitch (key) {\n\tcase 'c':\n\t\tdrawcam = !drawcam;\n\t\tbreak;\n\n\tcase 'f':\n\t\tofSetFullscreen(true);\n\t\tbreak;\n\n\tcase 'n':\n\t\tofSetFullscreen(false);\n\t\tbreak;\n\n\tcase 'b':\n\t\t\/\/ bounce\n\t\tcout << \"bounce request \\n\";\n\t\tcout << \"ball:\" << b.getCenter() << \" Z \" << b.pos.z;\n\t\tcout << \" goal \" << goalRect.getCenter() << \" Z \" << Z_FIELD_END << \"\\n\";\n\t\tcout << \" direction: \" << straight << \"\\n\";\n\n\t\tstate.set(S_BACKWARD,0);\n\t\tb.bounce(straight \/ 100.0);\n\t\tbreak;\n\n\tcase 'x':\n\t\tofExit();\n\t\tbreak;\n\n\t}\n\n\n}\n\n\n\/\/ State machine handling ------------------------------------------------------------\nvoid StateMach::set(int next_state, float timeout) {\n\tstate = next_state;\n\ttimeout_time = timeout;\n\t\/\/ default no timeout\n\tif (timeout >= 0) {\n\t\tofResetElapsedTimeCounter();\n\t\treset_timer();\n\t}\n\tprint();\n}\n\nvoid StateMach::reset_timer(void) {\n\tstart_time = ofGetElapsedTimef();\n}\n\nfloat StateMach::time_elapsed(void) {\n\treturn(ofGetElapsedTimef() - start_time);\n}\n\n\/\/ return the fraction of elapsed time that has passed \nfloat StateMach::frac_time_elapsed(void) {\n\tif (time_elapsed() > timeout_time) {\n\t\treturn 1.0;\n\t}\n\treturn(time_elapsed() \/ timeout_time);\n}\n\n\nbool StateMach::timeout(void) {\n\tif (timeout_time < 0)\n\t\treturn(true);\n\tif (time_elapsed() > timeout_time)\n\t\treturn(true);\n\treturn(false);\n}\n\nvoid StateMach::print(void) {\n\tswitch (state) {\n\tcase S_IDLE:\n\t\tcout << \"State: IDLE\\n\";\n\t\tbreak;\n\tcase S_FORWARD:\n\t\tcout << \"State: FORWARD\\n\";\n\t\tbreak;\n\tcase S_BACKWARD:\n\t\tcout << \"State: BACKWARD\\n\";\n\t\tbreak;\n\tcase S_CELEBRATE:\n\t\tcout << \"State: CELEBRATE\\n\";\n\t\tbreak;\n\t}\n}\nvoid ofApp::clean_exit(int signal) {\n\t\/\/ clean exit, signal handler\n\tcout << \"FACEBALL Exit signal caught, bye!\\n\";\n\tofExit();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"cell.h\"\r\n\/*\r\nCell::Cell(const bool& alive, const unsigned int& x, const unsigned int& y) : alive(alive), next(alive), x(x), y(y)\r\n{\r\n\r\n}\r\n*\/\r\n<commit_msg>Delete cell.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\n#include \"cify.hpp\"\n\nint main()\n{\n  int a = 10;\n\n  auto f(gnr::cify([a]{std::cout << a << std::endl;}));\n\n  f();\n\n  return 0;\n}\n<commit_msg>some fixes<commit_after>#include <iostream>\n\n#include \"cify.hpp\"\n\nint main()\n{\n  int a = 10;\n\n  auto f(gnr::cify([a]{std::cout << a << std::endl;}));\n\n  f();\n\n  f = gnr::cify_once([&a]{std::cout << ++a << std::endl;});\n\n  f();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/Copyright (C) 2011  Carl Rogers\n\/\/Released under MIT License\n\/\/license available in LICENSE file, or at http:\/\/www.opensource.org\/licenses\/mit-license.php\n\n#include\"cnpy.h\"\n#include<complex>\n#include<cstdlib>\n#include<algorithm>\n#include<cstring>\n#include<iomanip>\n\nchar cnpy::BigEndianTest() {\n    unsigned char x[] = {1,0};\n    short y = *(short*) x;\n    return y == 1 ? '<' : '>';\n}\n\nchar cnpy::map_type(const std::type_info& t)\n{\n    if(t == typeid(float) ) return 'f';\n    if(t == typeid(double) ) return 'f';\n    if(t == typeid(long double) ) return 'f';\n\n    if(t == typeid(int) ) return 'i';\n    if(t == typeid(char) ) return 'i';\n    if(t == typeid(short) ) return 'i';\n    if(t == typeid(long) ) return 'i';\n    if(t == typeid(long long) ) return 'i';\n\n    if(t == typeid(unsigned char) ) return 'u';\n    if(t == typeid(unsigned short) ) return 'u';\n    if(t == typeid(unsigned long) ) return 'u';\n    if(t == typeid(unsigned long long) ) return 'u';\n    if(t == typeid(unsigned int) ) return 'u';\n\n    if(t == typeid(bool) ) return 'b';\n\n    if(t == typeid(std::complex<float>) ) return 'c';\n    if(t == typeid(std::complex<double>) ) return 'c';\n    if(t == typeid(std::complex<long double>) ) return 'c';\n\n    else return '?';\n}\n\ntemplate<> std::vector<char>& cnpy::operator+=(std::vector<char>& lhs, const std::string rhs) {\n    lhs.insert(lhs.end(),rhs.begin(),rhs.end());\n    return lhs;\n}\n\ntemplate<> std::vector<char>& cnpy::operator+=(std::vector<char>& lhs, const char* rhs) {\n    \/\/write in little endian\n    char len = strlen(rhs);\n    for(char byte = 0; byte < len; byte++) {\n        lhs.push_back(rhs[byte]);\n    }\n    return lhs;\n}\n\nvoid cnpy::parse_npy_header(FILE* fp, unsigned int& word_size, unsigned int*& shape, unsigned int& ndims) {  \n    char buffer[256];\n    fread(buffer,sizeof(char),11,fp);       \n    std::string header = fgets(buffer,256,fp);\n    assert(header[header.size()-1] == '\\n');\n\n    int loc1, loc2;\n\n    \/\/fortran order\n    loc1 = header.find(\"fortran_order\")+16;\n    bool fortran_order = (header.substr(loc1,5) == \"True\" ? true : false);\n    assert(!fortran_order);\n\n    \/\/shape\n    loc1 = header.find(\"(\");\n    loc2 = header.find(\")\");\n    std::string str_shape = header.substr(loc1+1,loc2-loc1-1);\n    if(str_shape[str_shape.size()-1] == ',') ndims = 1;\n    else ndims = std::count(str_shape.begin(),str_shape.end(),',')+1;\n    shape = new unsigned int[ndims];\n    for(int i = 0;i < ndims;i++) {\n        loc1 = str_shape.find(\",\");\n        shape[i] = atoi(str_shape.substr(0,loc1).c_str());\n        str_shape = str_shape.substr(loc1+1);\n    }\n\n    \/\/endian, word size, data type\n    loc1 = header.find(\"descr\")+9;\n    bool littleEndian = (header[loc1] == '<' ? true : false);\n    assert(littleEndian);\n\n    char type = header[loc1+1];\n    \/\/assert(type == map_type(T));\n\n    std::string str_ws = header.substr(loc1+2);\n    loc2 = str_ws.find(\"'\");\n    word_size = atoi(str_ws.substr(0,loc2).c_str());\n}\n\nvoid cnpy::parse_zip_footer(FILE* fp, unsigned short& nrecs, unsigned int& global_header_size, unsigned int& global_header_offset)\n{\n    std::vector<char> footer(22);\n    fseek(fp,-22,SEEK_END);\n    fread(&footer[0],sizeof(char),22,fp);\n\n    unsigned short disk_no, disk_start, nrecs_on_disk, comment_len;\n    disk_no = *(unsigned short*) &footer[4];\n    disk_start = *(unsigned short*) &footer[6];\n    nrecs_on_disk = *(unsigned short*) &footer[8];\n    nrecs = *(unsigned short*) &footer[10];\n    global_header_size = *(unsigned int*) &footer[12];\n    global_header_offset = *(unsigned int*) &footer[16];\n    comment_len = *(unsigned short*) &footer[20];\n\n    assert(disk_no == 0);\n    assert(disk_start == 0);\n    assert(nrecs_on_disk == nrecs);\n    assert(comment_len == 0);\n}\n\ncnpy::NpyArray load_the_npy_file(FILE* fp) {\n    unsigned int* shape;\n    unsigned int ndims, word_size;\n    cnpy::parse_npy_header(fp,word_size,shape,ndims);\n    unsigned int size = 1;\n    for(int i = 0;i < ndims;i++) size *= shape[i];\n\n    cnpy::NpyArray arr;\n    arr.word_size = word_size;\n    arr.shape = std::vector<unsigned int>(shape,shape+ndims);\n    arr.data = new char[size*word_size];    \n    int nread = fread(arr.data,word_size,size,fp);\n    return arr;\n}\n\nstd::map<std::string,cnpy::NpyArray> cnpy::npz_load(std::string fname) {\n    FILE* fp = fopen(fname.c_str(),\"rb\");\n\n    if(!fp) printf(\"npz_load: Error! Unable to open file %s!\\n\",fname.c_str());\n    assert(fp);\n\n    std::map<std::string,NpyArray> arrays;  \n\n    while(1) {\n        std::vector<char> local_header(30);\n        fread(&local_header[0],sizeof(char),30,fp);\n\n        \/\/if we've reached the global header, stop reading\n        if(local_header[2] != 0x03 || local_header[3] != 0x04) break;\n\n        \/\/read in the variable name\n        unsigned short name_len = *(unsigned short*) &local_header[26];\n        std::string varname(name_len,' ');\n        fread(&varname[0],sizeof(char),name_len,fp);\n\n        \/\/erase the lagging .npy        \n        varname.erase(varname.end()-4,varname.end());\n\n        \/\/read in the extra field\n        unsigned short extra_field_len = *(unsigned short*) &local_header[28];\n        if(extra_field_len > 0) {\n            std::vector<char> buff(extra_field_len);\n            fread(&buff[0],sizeof(char),extra_field_len,fp);\n        }\n\n        arrays[varname] = load_the_npy_file(fp);\n    }\n\n    fclose(fp);\n    return arrays;  \n}\n\ncnpy::NpyArray cnpy::npz_load(std::string fname, std::string varname) {\n    FILE* fp = fopen(fname.c_str(),\"rb\");\n\n    if(!fp) {\n        printf(\"npz_load: Error! Unable to open file %s!\\n\",fname.c_str());\n        abort();\n    }       \n\n    while(1) {\n        std::vector<char> local_header(30);\n        fread(&local_header[0],sizeof(char),30,fp);\n\n        \/\/if we've reached the global header, stop reading\n        if(local_header[2] != 0x03 || local_header[3] != 0x04) break;\n\n        \/\/read in the variable name\n        unsigned short name_len = *(unsigned short*) &local_header[26];\n        std::string vname(name_len,' ');\n        fread(&vname[0],sizeof(char),name_len,fp);      \n        vname.erase(vname.end()-4,vname.end()); \/\/erase the lagging .npy\n\n        \/\/read in the extra field\n        unsigned short extra_field_len = *(unsigned short*) &local_header[28];\n        fseek(fp,extra_field_len,SEEK_CUR); \/\/skip past the extra field\n\n        if(vname == varname) {\n            NpyArray array = load_the_npy_file(fp);\n            fclose(fp);\n            return array;\n        }\n        else {\n            \/\/skip past the data\n            unsigned int size = *(unsigned int*) &local_header[22];\n            fseek(fp,size,SEEK_CUR);\n        }\n    }\n\n    fclose(fp);\n    printf(\"npz_load: Error! Variable name %s not found in %s!\\n\",varname.c_str(),fname.c_str());\n    abort();\n}\n\ncnpy::NpyArray cnpy::npy_load(std::string fname) {\n\n    FILE* fp = fopen(fname.c_str(), \"rb\");\n\n    if(!fp) {\n        printf(\"npy_load: Error! Unable to open file %s!\\n\",fname.c_str());\n        abort();  \n    }\n\n    NpyArray arr = load_the_npy_file(fp);\n\n    fclose(fp);\n    return arr;\n}\n\n\n\n<commit_msg>fixing load_the_npy_file to not overflow for files with nbytes greater than unsigned int range<commit_after>\/\/Copyright (C) 2011  Carl Rogers\n\/\/Released under MIT License\n\/\/license available in LICENSE file, or at http:\/\/www.opensource.org\/licenses\/mit-license.php\n\n#include\"cnpy.h\"\n#include<complex>\n#include<cstdlib>\n#include<algorithm>\n#include<cstring>\n#include<iomanip>\n\nchar cnpy::BigEndianTest() {\n    unsigned char x[] = {1,0};\n    short y = *(short*) x;\n    return y == 1 ? '<' : '>';\n}\n\nchar cnpy::map_type(const std::type_info& t)\n{\n    if(t == typeid(float) ) return 'f';\n    if(t == typeid(double) ) return 'f';\n    if(t == typeid(long double) ) return 'f';\n\n    if(t == typeid(int) ) return 'i';\n    if(t == typeid(char) ) return 'i';\n    if(t == typeid(short) ) return 'i';\n    if(t == typeid(long) ) return 'i';\n    if(t == typeid(long long) ) return 'i';\n\n    if(t == typeid(unsigned char) ) return 'u';\n    if(t == typeid(unsigned short) ) return 'u';\n    if(t == typeid(unsigned long) ) return 'u';\n    if(t == typeid(unsigned long long) ) return 'u';\n    if(t == typeid(unsigned int) ) return 'u';\n\n    if(t == typeid(bool) ) return 'b';\n\n    if(t == typeid(std::complex<float>) ) return 'c';\n    if(t == typeid(std::complex<double>) ) return 'c';\n    if(t == typeid(std::complex<long double>) ) return 'c';\n\n    else return '?';\n}\n\ntemplate<> std::vector<char>& cnpy::operator+=(std::vector<char>& lhs, const std::string rhs) {\n    lhs.insert(lhs.end(),rhs.begin(),rhs.end());\n    return lhs;\n}\n\ntemplate<> std::vector<char>& cnpy::operator+=(std::vector<char>& lhs, const char* rhs) {\n    \/\/write in little endian\n    char len = strlen(rhs);\n    for(char byte = 0; byte < len; byte++) {\n        lhs.push_back(rhs[byte]);\n    }\n    return lhs;\n}\n\nvoid cnpy::parse_npy_header(FILE* fp, unsigned int& word_size, unsigned int*& shape, unsigned int& ndims) {  \n    char buffer[256];\n    fread(buffer,sizeof(char),11,fp);       \n    std::string header = fgets(buffer,256,fp);\n    assert(header[header.size()-1] == '\\n');\n\n    int loc1, loc2;\n\n    \/\/fortran order\n    loc1 = header.find(\"fortran_order\")+16;\n    bool fortran_order = (header.substr(loc1,5) == \"True\" ? true : false);\n    assert(!fortran_order);\n\n    \/\/shape\n    loc1 = header.find(\"(\");\n    loc2 = header.find(\")\");\n    std::string str_shape = header.substr(loc1+1,loc2-loc1-1);\n    if(str_shape[str_shape.size()-1] == ',') ndims = 1;\n    else ndims = std::count(str_shape.begin(),str_shape.end(),',')+1;\n    shape = new unsigned int[ndims];\n    for(int i = 0;i < ndims;i++) {\n        loc1 = str_shape.find(\",\");\n        shape[i] = atoi(str_shape.substr(0,loc1).c_str());\n        str_shape = str_shape.substr(loc1+1);\n    }\n\n    \/\/endian, word size, data type\n    loc1 = header.find(\"descr\")+9;\n    bool littleEndian = (header[loc1] == '<' ? true : false);\n    assert(littleEndian);\n\n    char type = header[loc1+1];\n    \/\/assert(type == map_type(T));\n\n    std::string str_ws = header.substr(loc1+2);\n    loc2 = str_ws.find(\"'\");\n    word_size = atoi(str_ws.substr(0,loc2).c_str());\n}\n\nvoid cnpy::parse_zip_footer(FILE* fp, unsigned short& nrecs, unsigned int& global_header_size, unsigned int& global_header_offset)\n{\n    std::vector<char> footer(22);\n    fseek(fp,-22,SEEK_END);\n    fread(&footer[0],sizeof(char),22,fp);\n\n    unsigned short disk_no, disk_start, nrecs_on_disk, comment_len;\n    disk_no = *(unsigned short*) &footer[4];\n    disk_start = *(unsigned short*) &footer[6];\n    nrecs_on_disk = *(unsigned short*) &footer[8];\n    nrecs = *(unsigned short*) &footer[10];\n    global_header_size = *(unsigned int*) &footer[12];\n    global_header_offset = *(unsigned int*) &footer[16];\n    comment_len = *(unsigned short*) &footer[20];\n\n    assert(disk_no == 0);\n    assert(disk_start == 0);\n    assert(nrecs_on_disk == nrecs);\n    assert(comment_len == 0);\n}\n\ncnpy::NpyArray load_the_npy_file(FILE* fp) {\n    unsigned int* shape;\n    unsigned int ndims, word_size;\n    cnpy::parse_npy_header(fp,word_size,shape,ndims);\n    unsigned long long size = 1; \/\/long long so no overflow when multiplying by word_size\n    for(int i = 0;i < ndims;i++) size *= shape[i];\n\n    cnpy::NpyArray arr;\n    arr.word_size = word_size;\n    arr.shape = std::vector<unsigned int>(shape,shape+ndims);\n    arr.data = new char[size*word_size];    \n    int nread = fread(arr.data,word_size,size,fp);\n    return arr;\n}\n\nstd::map<std::string,cnpy::NpyArray> cnpy::npz_load(std::string fname) {\n    FILE* fp = fopen(fname.c_str(),\"rb\");\n\n    if(!fp) printf(\"npz_load: Error! Unable to open file %s!\\n\",fname.c_str());\n    assert(fp);\n\n    std::map<std::string,NpyArray> arrays;  \n\n    while(1) {\n        std::vector<char> local_header(30);\n        fread(&local_header[0],sizeof(char),30,fp);\n\n        \/\/if we've reached the global header, stop reading\n        if(local_header[2] != 0x03 || local_header[3] != 0x04) break;\n\n        \/\/read in the variable name\n        unsigned short name_len = *(unsigned short*) &local_header[26];\n        std::string varname(name_len,' ');\n        fread(&varname[0],sizeof(char),name_len,fp);\n\n        \/\/erase the lagging .npy        \n        varname.erase(varname.end()-4,varname.end());\n\n        \/\/read in the extra field\n        unsigned short extra_field_len = *(unsigned short*) &local_header[28];\n        if(extra_field_len > 0) {\n            std::vector<char> buff(extra_field_len);\n            fread(&buff[0],sizeof(char),extra_field_len,fp);\n        }\n\n        arrays[varname] = load_the_npy_file(fp);\n    }\n\n    fclose(fp);\n    return arrays;  \n}\n\ncnpy::NpyArray cnpy::npz_load(std::string fname, std::string varname) {\n    FILE* fp = fopen(fname.c_str(),\"rb\");\n\n    if(!fp) {\n        printf(\"npz_load: Error! Unable to open file %s!\\n\",fname.c_str());\n        abort();\n    }       \n\n    while(1) {\n        std::vector<char> local_header(30);\n        fread(&local_header[0],sizeof(char),30,fp);\n\n        \/\/if we've reached the global header, stop reading\n        if(local_header[2] != 0x03 || local_header[3] != 0x04) break;\n\n        \/\/read in the variable name\n        unsigned short name_len = *(unsigned short*) &local_header[26];\n        std::string vname(name_len,' ');\n        fread(&vname[0],sizeof(char),name_len,fp);      \n        vname.erase(vname.end()-4,vname.end()); \/\/erase the lagging .npy\n\n        \/\/read in the extra field\n        unsigned short extra_field_len = *(unsigned short*) &local_header[28];\n        fseek(fp,extra_field_len,SEEK_CUR); \/\/skip past the extra field\n\n        if(vname == varname) {\n            NpyArray array = load_the_npy_file(fp);\n            fclose(fp);\n            return array;\n        }\n        else {\n            \/\/skip past the data\n            unsigned int size = *(unsigned int*) &local_header[22];\n            fseek(fp,size,SEEK_CUR);\n        }\n    }\n\n    fclose(fp);\n    printf(\"npz_load: Error! Variable name %s not found in %s!\\n\",varname.c_str(),fname.c_str());\n    abort();\n}\n\ncnpy::NpyArray cnpy::npy_load(std::string fname) {\n\n    FILE* fp = fopen(fname.c_str(), \"rb\");\n\n    if(!fp) {\n        printf(\"npy_load: Error! Unable to open file %s!\\n\",fname.c_str());\n        abort();  \n    }\n\n    NpyArray arr = load_the_npy_file(fp);\n\n    fclose(fp);\n    return arr;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n#include <chrono>\n#include <iostream>\n#include <memory>\n#include <set>\n\n#include <boost\/range\/algorithm\/for_each.hpp>\n\n#include \"mc\/classic\/count_tokens.hh\"\n#include \"mc\/classic\/dead.hh\"\n#include \"mc\/classic\/firing_rule.hh\"\n#include \"mc\/classic\/make_order.hh\"\n#include \"mc\/classic\/sdd.hh\"\n#include \"mc\/classic\/sharp_output.hh\"\n#include \"mc\/classic\/threads.hh\"\n#include \"mc\/classic\/worker.hh\"\n#include \"mc\/shared\/exceptions.hh\"\n#include \"mc\/shared\/export.hh\"\n#include \"mc\/shared\/results.hh\"\n#include \"mc\/shared\/statistics.hh\"\n#include \"mc\/shared\/step.hh\"\n#include \"support\/util\/timer.hh\"\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wmissing-field-initializers\"\n\nnamespace pnmc { namespace mc { namespace classic {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nSDD\ninitial_state(const sdd::order<sdd_conf>& order, const pn::net& net)\n{\n  std::map<std::string, std::reference_wrapper<const pn::transition>> timed;\n  boost::range::for_each( net.transitions()\n                        , [&](const auto& t){if (t.timed()) timed.emplace(t.id, t);});\n\n  return {order, [&](const auto& id)\n                    {\n                      const auto cit = net.places().find(id);\n                      if (cit != end(net.places()))\n                      {\n                        return flat_set{cit->marking};\n                      }\n                      else\n                      {\n                        const auto t_cit = timed.find(id);\n                        assert(t_cit != timed.end());\n                        return net.enabled(t_cit->second.get().id)\n                             ? flat_set{0}\n                             : flat_set{pn::sharp};\n                      }}};\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nSDD\ndead_states(const conf::configuration&, const order& o, const pn::net& net, const SDD& state_space)\n{\n  std::set<homomorphism> and_operands;\n  std::set<homomorphism> or_operands;\n\n  for (const auto& transition : net.transitions())\n  {\n    \/\/ We are only interested in pre actions.\n    for (const auto& arc : transition.pre)\n    {\n      or_operands.insert(function(o, arc.first, dead{arc.second.weight}));\n    }\n\n    and_operands.insert(sum(o, or_operands.cbegin(), or_operands.cend()));\n    or_operands.clear();\n  }\n  const auto tmp = intersection(o, and_operands.cbegin(), and_operands.cend());\n\n  return sdd::rewrite(o, tmp)(o, state_space); \/\/ compute dead states\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nvoid\nworker::operator()(const pn::net& net)\nconst\n{\n  if (conf.compute_dead_states and net.timed())\n  {\n    std::cerr << \"Computation of dead states for Time Petri Nets is not supported yet.\\n\";\n  }\n\n  using conf::filename;\n  using dot_sdd = shared::dot_sdd<sdd_conf>;\n\n  util::timer total_timer;\n\n  \/\/ Configure libsdd.\n  sdd_conf sconf;\n  sconf.sdd_unique_table_size = conf.ut_sizes.at(\"sdd\");\n  sconf.sdd_difference_cache_size = conf.cache_sizes.at(\"diff\");\n  sconf.sdd_intersection_cache_size = conf.cache_sizes.at(\"inter\");\n  sconf.sdd_intersection_cache_size = conf.cache_sizes.at(\"sum\");\n  sconf.hom_unique_table_size = conf.ut_sizes.at(\"hom\");\n  sconf.hom_cache_size = conf.cache_sizes.at(\"hom\");\n\n  \/\/ Initialize libsdd.\n  auto manager_ptr = std::make_unique<sdd::manager<sdd_conf>>(sdd::init(sconf));\n  auto& manager = *manager_ptr;\n\n  auto stats = statistics{};\n  stats.max_time = conf.max_time;\n  if (conf.stats_conf.count(shared::stats::pn))\n  {\n    stats.pn_statistics = pn::statistics(net);\n  }\n  auto res = results{};\n\n  \/\/ Set to true by an asynchrous thread when the time limit is reached.\n  bool stop_flag = false;\n\n  std::cout << \"\\n-- Steps\\n\";\n\n  \/\/ Build the order.\n  res.order = make_order(conf, stats, net);\n  assert(not res.order->empty() && \"Empty order\");\n  shared::export_json(conf, filename::json_order, *res.order);\n\n  \/\/ Get the initial state.\n  res.m0 = initial_state(*res.order, net);\n\n  \/\/ Map of live transitions.\n  boost::dynamic_bitset<> live_transitions(net.transitions().size());\n\n  \/\/ Compute the transition relation.\n  const auto h_operands = [&]\n  {\n    shared::step(\"firing rule\", &stats.relation_duration);\n    return firing_rule(conf, *res.order, net, live_transitions, stop_flag);\n  }();\n  const auto h = fixpoint(sum(*res.order, begin(h_operands), end(h_operands)));\n\n  \/\/ Rewrite the transition relation.\n  const auto h_opt = [&]\n  {\n    shared::step(\"rewrite\", &stats.rewrite_duration);\n    return sdd::rewrite(*res.order, h);\n  }();\n\n  \/\/ Compute the state space.\n  {\n    shared::step s{\"state space\", &stats.state_space_duration};\n    threads _{conf, stats, stop_flag, manager, s.timer}; \/\/ threads will be stopped at scope exit\n    try\n    {\n      res.states = h_opt(*res.order, *res.m0);\n    }\n    catch (const shared::bound_error& e)\n    {\n      stats.interrupted = true;\n      std::cout << \"Place \" << e.place << \" marking >=\" << conf.marking_bound << '\\n';\n    }\n    catch (const shared::interrupted&)\n    {\n      stats.interrupted = true;\n      std::cout << \"Computation interrupted after \" << s.timer.duration().count() << \"s\\n\";\n    }\n    if (stats.interrupted)\n    {\n      shared::export_json(conf, filename::json_stats, stats);\n      shared::export_dot(conf, filename::dot_h, h, filename::dot_h_opt, h_opt);\n      return;\n    }\n  }\n\n  if (conf.count_tokens)\n  {\n    stats.tokens_duration.emplace();\n    shared::step s{\"count tokens\", &*stats.tokens_duration};\n    count_tokens(res, *res.states, net);\n  }\n\n  if (conf.compute_dead_transitions)\n  {\n    shared::step{\"dead transitions\"};\n    res.dead_transitions.emplace();\n    for (std::size_t i = 0; i < net.transitions().size(); ++i)\n    {\n      if (not live_transitions[i])\n      {\n        res.dead_transitions->push_back(net.get_transition_by_index(i).id);\n      }\n    }\n  }\n\n  if (conf.compute_dead_states and not net.timed())\n  {\n    stats.dead_states_duration.emplace();\n    shared::step s{\"dead states\", &*stats.dead_states_duration};\n    res.dead_states = dead_states(conf, *res.order, net, *res.states);\n  }\n\n  if (conf.stats_conf.count(shared::stats::final_sdd))\n  {\n    stats.sdd_statistics = sdd::tools::statistics(*res.states);\n  }\n  stats.manager_statistics = sdd::tools::statistics(manager);\n\n  stats.total_duration = total_timer.duration();\n  std::cout << \"total\" << std::setw(15) << \": \" << stats.total_duration.count() << \"s\";\n  std::cout << \"\\n\\n-- Results\\n\";\n  std::cout << res;\n\n  shared::export_dot(conf, filename::dot_h, h, filename::dot_h_opt, h_opt);\n  shared::export_dot(conf, filename::dot_m0, dot_sdd{*res.m0, *res.order});\n  shared::export_dot(conf, filename::dot_final, dot_sdd{*res.states, *res.order});\n  shared::export_json(conf, filename::json_stats, stats);\n  shared::export_json(conf, filename::json_results, res);\n  shared::export_json(conf, filename::json_h, h, filename::json_h_opt, h_opt);\n\n  if (conf.fast_exit)\n  {\n    manager_ptr.release(); \/\/ manager's destructor won't be called\n  }\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}}} \/\/ namespace pnmc::mc::classic\n\n#pragma GCC diagnostic pop\n<commit_msg>Fast exit even if the computation is interrupted<commit_after>#include <cassert>\n#include <chrono>\n#include <iostream>\n#include <memory>\n#include <set>\n\n#include <boost\/range\/algorithm\/for_each.hpp>\n\n#include \"mc\/classic\/count_tokens.hh\"\n#include \"mc\/classic\/dead.hh\"\n#include \"mc\/classic\/firing_rule.hh\"\n#include \"mc\/classic\/make_order.hh\"\n#include \"mc\/classic\/sdd.hh\"\n#include \"mc\/classic\/sharp_output.hh\"\n#include \"mc\/classic\/threads.hh\"\n#include \"mc\/classic\/worker.hh\"\n#include \"mc\/shared\/exceptions.hh\"\n#include \"mc\/shared\/export.hh\"\n#include \"mc\/shared\/results.hh\"\n#include \"mc\/shared\/statistics.hh\"\n#include \"mc\/shared\/step.hh\"\n#include \"support\/util\/timer.hh\"\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wmissing-field-initializers\"\n\nnamespace pnmc { namespace mc { namespace classic {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nSDD\ninitial_state(const sdd::order<sdd_conf>& order, const pn::net& net)\n{\n  std::map<std::string, std::reference_wrapper<const pn::transition>> timed;\n  boost::range::for_each( net.transitions()\n                        , [&](const auto& t){if (t.timed()) timed.emplace(t.id, t);});\n\n  return {order, [&](const auto& id)\n                    {\n                      const auto cit = net.places().find(id);\n                      if (cit != end(net.places()))\n                      {\n                        return flat_set{cit->marking};\n                      }\n                      else\n                      {\n                        const auto t_cit = timed.find(id);\n                        assert(t_cit != timed.end());\n                        return net.enabled(t_cit->second.get().id)\n                             ? flat_set{0}\n                             : flat_set{pn::sharp};\n                      }}};\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nSDD\ndead_states(const conf::configuration&, const order& o, const pn::net& net, const SDD& state_space)\n{\n  std::set<homomorphism> and_operands;\n  std::set<homomorphism> or_operands;\n\n  for (const auto& transition : net.transitions())\n  {\n    \/\/ We are only interested in pre actions.\n    for (const auto& arc : transition.pre)\n    {\n      or_operands.insert(function(o, arc.first, dead{arc.second.weight}));\n    }\n\n    and_operands.insert(sum(o, or_operands.cbegin(), or_operands.cend()));\n    or_operands.clear();\n  }\n  const auto tmp = intersection(o, and_operands.cbegin(), and_operands.cend());\n\n  return sdd::rewrite(o, tmp)(o, state_space); \/\/ compute dead states\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nvoid\nworker::operator()(const pn::net& net)\nconst\n{\n  if (conf.compute_dead_states and net.timed())\n  {\n    std::cerr << \"Computation of dead states for Time Petri Nets is not supported yet.\\n\";\n  }\n\n  using conf::filename;\n  using dot_sdd = shared::dot_sdd<sdd_conf>;\n\n  util::timer total_timer;\n\n  \/\/ Configure libsdd.\n  sdd_conf sconf;\n  sconf.sdd_unique_table_size = conf.ut_sizes.at(\"sdd\");\n  sconf.sdd_difference_cache_size = conf.cache_sizes.at(\"diff\");\n  sconf.sdd_intersection_cache_size = conf.cache_sizes.at(\"inter\");\n  sconf.sdd_intersection_cache_size = conf.cache_sizes.at(\"sum\");\n  sconf.hom_unique_table_size = conf.ut_sizes.at(\"hom\");\n  sconf.hom_cache_size = conf.cache_sizes.at(\"hom\");\n\n  \/\/ Initialize libsdd.\n  auto manager_ptr = std::make_unique<sdd::manager<sdd_conf>>(sdd::init(sconf));\n  auto& manager = *manager_ptr;\n\n  auto stats = statistics{};\n  stats.max_time = conf.max_time;\n  if (conf.stats_conf.count(shared::stats::pn))\n  {\n    stats.pn_statistics = pn::statistics(net);\n  }\n  auto res = results{};\n\n  \/\/ Set to true by an asynchrous thread when the time limit is reached.\n  bool stop_flag = false;\n\n  std::cout << \"\\n-- Steps\\n\";\n\n  \/\/ Build the order.\n  res.order = make_order(conf, stats, net);\n  assert(not res.order->empty() && \"Empty order\");\n  shared::export_json(conf, filename::json_order, *res.order);\n\n  \/\/ Get the initial state.\n  res.m0 = initial_state(*res.order, net);\n\n  \/\/ Map of live transitions.\n  boost::dynamic_bitset<> live_transitions(net.transitions().size());\n\n  \/\/ Compute the transition relation.\n  const auto h_operands = [&]\n  {\n    shared::step(\"firing rule\", &stats.relation_duration);\n    return firing_rule(conf, *res.order, net, live_transitions, stop_flag);\n  }();\n  const auto h = fixpoint(sum(*res.order, begin(h_operands), end(h_operands)));\n\n  \/\/ Rewrite the transition relation.\n  const auto h_opt = [&]\n  {\n    shared::step(\"rewrite\", &stats.rewrite_duration);\n    return sdd::rewrite(*res.order, h);\n  }();\n\n  \/\/ Compute the state space.\n  {\n    shared::step s{\"state space\", &stats.state_space_duration};\n    threads _{conf, stats, stop_flag, manager, s.timer}; \/\/ threads will be stopped at scope exit\n    try\n    {\n      res.states = h_opt(*res.order, *res.m0);\n    }\n    catch (const shared::bound_error& e)\n    {\n      stats.interrupted = true;\n      std::cout << \"Place \" << e.place << \" marking >=\" << conf.marking_bound << '\\n';\n    }\n    catch (const shared::interrupted&)\n    {\n      stats.interrupted = true;\n      std::cout << \"Computation interrupted after \" << s.timer.duration().count() << \"s\\n\";\n    }\n    if (stats.interrupted)\n    {\n      shared::export_json(conf, filename::json_stats, stats);\n      shared::export_dot(conf, filename::dot_h, h, filename::dot_h_opt, h_opt);\n      if (conf.fast_exit)\n      {\n        manager_ptr.release(); \/\/ manager's destructor won't be called\n      }\n      return;\n    }\n  }\n\n  if (conf.count_tokens)\n  {\n    stats.tokens_duration.emplace();\n    shared::step s{\"count tokens\", &*stats.tokens_duration};\n    count_tokens(res, *res.states, net);\n  }\n\n  if (conf.compute_dead_transitions)\n  {\n    shared::step{\"dead transitions\"};\n    res.dead_transitions.emplace();\n    for (std::size_t i = 0; i < net.transitions().size(); ++i)\n    {\n      if (not live_transitions[i])\n      {\n        res.dead_transitions->push_back(net.get_transition_by_index(i).id);\n      }\n    }\n  }\n\n  if (conf.compute_dead_states and not net.timed())\n  {\n    stats.dead_states_duration.emplace();\n    shared::step s{\"dead states\", &*stats.dead_states_duration};\n    res.dead_states = dead_states(conf, *res.order, net, *res.states);\n  }\n\n  if (conf.stats_conf.count(shared::stats::final_sdd))\n  {\n    stats.sdd_statistics = sdd::tools::statistics(*res.states);\n  }\n  stats.manager_statistics = sdd::tools::statistics(manager);\n\n  stats.total_duration = total_timer.duration();\n  std::cout << \"total\" << std::setw(15) << \": \" << stats.total_duration.count() << \"s\";\n  std::cout << \"\\n\\n-- Results\\n\";\n  std::cout << res;\n\n  shared::export_dot(conf, filename::dot_h, h, filename::dot_h_opt, h_opt);\n  shared::export_dot(conf, filename::dot_m0, dot_sdd{*res.m0, *res.order});\n  shared::export_dot(conf, filename::dot_final, dot_sdd{*res.states, *res.order});\n  shared::export_json(conf, filename::json_stats, stats);\n  shared::export_json(conf, filename::json_results, res);\n  shared::export_json(conf, filename::json_h, h, filename::json_h_opt, h_opt);\n\n  if (conf.fast_exit)\n  {\n    manager_ptr.release(); \/\/ manager's destructor won't be called\n  }\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}}} \/\/ namespace pnmc::mc::classic\n\n#pragma GCC diagnostic pop\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CODEX_WORKER_BROKER_CONNECTION_H\n#define CODEX_WORKER_BROKER_CONNECTION_H\n\n\n#include <zmq.hpp>\n#include <map>\n\n#include \"worker_config.hpp\"\n\ntemplate <typename proxy, typename task_callback>\nclass broker_connection {\nprivate:\n\tconst worker_config &config;\n\tproxy *socket;\n\n\t\/**\n\t * Send the ACK command to the broker\n\t *\/\n\tvoid command_ack ()\n\t{\n\n\t}\n\npublic:\n\tbroker_connection (const worker_config &config, proxy *socket) : config(config), socket(socket)\n\t{\n\t}\n\n\t\/**\n\t * Send the INIT command to the broker.\n\t *\/\n\tvoid connect ()\n\t{\n\t\tconst worker_config::header_map_t &headers = config.get_headers();\n\n\t\tsocket->connect(config.get_broker_uri());\n\t\tsocket->send(\"init\", 4, ZMQ_SNDMORE);\n\n\t\tauto &last = --headers.end();\n\n\t\tfor (auto it = headers.begin(); it != headers.end(); ++it) {\n\t\t\tauto pair = *it;\n\n\t\t\tchar buf[256];\n\t\t\tint count = snprintf(buf, sizeof(buf), \"%s=%s\", pair.first.c_str(), pair.second.c_str());\n\n\t\t\tif (count < 0) {\n\t\t\t\tthrow;\n\t\t\t}\n\n\t\t\tsocket->send(buf, (size_t) count, it == last ? 0 : ZMQ_SNDMORE);\n\t\t}\n\t}\n\n\t\/**\n\t * Receive a single task\n\t *\/\n\tvoid receive_task ()\n\t{\n\t\ttask_callback cb;\n\t\tzmq::message_t request;\n\n\t\tsocket->recv(request);\n\t\tcb();\n\t}\n};\n\n#endif \/\/CODEX_WORKER_BROKER_CONNECTION_H\n<commit_msg>cleaner check for last iteration<commit_after>#ifndef CODEX_WORKER_BROKER_CONNECTION_H\n#define CODEX_WORKER_BROKER_CONNECTION_H\n\n\n#include <zmq.hpp>\n#include <map>\n\n#include \"worker_config.hpp\"\n\ntemplate <typename proxy, typename task_callback>\nclass broker_connection {\nprivate:\n\tconst worker_config &config;\n\tproxy *socket;\n\n\t\/**\n\t * Send the ACK command to the broker\n\t *\/\n\tvoid command_ack ()\n\t{\n\n\t}\n\npublic:\n\tbroker_connection (const worker_config &config, proxy *socket) : config(config), socket(socket)\n\t{\n\t}\n\n\t\/**\n\t * Send the INIT command to the broker.\n\t *\/\n\tvoid connect ()\n\t{\n\t\tconst worker_config::header_map_t &headers = config.get_headers();\n\n\t\tsocket->connect(config.get_broker_uri());\n\t\tsocket->send(\"init\", 4, ZMQ_SNDMORE);\n\n\t\tfor (auto it = headers.begin(); it != headers.end(); ++it) {\n\t\t\tauto pair = *it;\n\n\t\t\tchar buf[256];\n\t\t\tint count = snprintf(buf, sizeof(buf), \"%s=%s\", pair.first.c_str(), pair.second.c_str());\n\n\t\t\tif (count < 0) {\n\t\t\t\tthrow;\n\t\t\t}\n\n\t\t\tsocket->send(buf, (size_t) count, std::next(it) == headers.end() ? 0 : ZMQ_SNDMORE);\n\t\t}\n\t}\n\n\t\/**\n\t * Receive a single task\n\t *\/\n\tvoid receive_task ()\n\t{\n\t\ttask_callback cb;\n\t\tzmq::message_t request;\n\n\t\tsocket->recv(request);\n\t\tcb();\n\t}\n};\n\n#endif \/\/CODEX_WORKER_BROKER_CONNECTION_H\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit (ITK)\n  Module:    itkFastMarchingTest.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 2000 National Library of Medicine\nAll rights reserved.\n\nSee COPYRIGHT.txt for copyright details.\n\n=========================================================================*\/\n#include \"itkFastMarchingImageFilter.h\"\n#include \"itkImage.h\"\n#include \"itkScalar.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkPixelTraits.h\"\n\n#include \"vnl\/vnl_math.h\"\n\nint main()\n{\n  \/\/ create a fastmarching object\n  typedef itk::Scalar<float> PixelType;\n  typedef itk::Image<PixelType,2> FloatImage;\n  typedef itk::FastMarchingImageFilter<FloatImage> FloatFMType;\n\n  FloatFMType::Pointer marcher = FloatFMType::New();\n  \n  \/\/ setup trial points\n  typedef FloatFMType::NodeType NodeType;\n  typedef FloatFMType::NodeContainer NodeContainer;\n\n  NodeContainer::Pointer trialPoints = NodeContainer::New();\n\n  NodeType node;\n\n  FloatImage::OffsetType index0 = {{28,35}};\n  \n  node.value = 0.0;\n  node.index += index0;\n  trialPoints->InsertElement(0, node);\n  \n  marcher->SetTrialPoints( trialPoints );\n\n  \/\/ specify the size of the output image\n  FloatImage::SizeType size = {{64,64}};\n  marcher->SetOutputSize( size );\n\n  \/\/ update the marcher\n  marcher->Update();\n\n  \/\/ check the results\n  FloatImage::Pointer output = marcher->GetOutput();\n  itk::ImageRegionIterator<FloatImage>\n    iterator( output, output->GetBufferedRegion() );\n\n  iterator = iterator.Begin();\n  bool passed = true;\n\n  for( ; !iterator.IsAtEnd(); ++iterator )\n    {\n\n    FloatImage::IndexType tempIndex;\n    double distance;\n    float output;\n\n    tempIndex = iterator.GetIndex();\n    tempIndex -= index0;\n    distance = 0.0;\n    for( int j = 0; j < 2; j++ )\n      {\n        distance += tempIndex[j] * tempIndex[j];\n      }\n    distance = vnl_math_sqrt( distance );\n\n    output = itk::ScalarTraits<PixelType>::GetScalar( iterator.Get() );\n\n    if( vnl_math_abs( output ) \/ distance > 1.42 )\n      {\n        std::cout << iterator.GetIndex() << \" \";\n        std::cout << vnl_math_abs( output ) \/ distance << \" \";\n        std::cout << vnl_math_abs( output ) << \" \" << distance << std::endl;\n        passed = false;\n      }\n    \n    }\n\n  if( passed )\n    {\n    std::cout << \"Fast Marching test passed\" << std::endl;\n    return EXIT_SUCCESS;\n    }\n  else\n    {\n    std::cout << \"Fast Marching test failed\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n}\n<commit_msg>ENH: Initialize index to 0.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit (ITK)\n  Module:    itkFastMarchingTest.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 2000 National Library of Medicine\nAll rights reserved.\n\nSee COPYRIGHT.txt for copyright details.\n\n=========================================================================*\/\n#include \"itkFastMarchingImageFilter.h\"\n#include \"itkImage.h\"\n#include \"itkScalar.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkPixelTraits.h\"\n\n#include \"vnl\/vnl_math.h\"\n\nint main()\n{\n  \/\/ create a fastmarching object\n  typedef itk::Scalar<float> PixelType;\n  typedef itk::Image<PixelType,2> FloatImage;\n  typedef itk::FastMarchingImageFilter<FloatImage> FloatFMType;\n\n  FloatFMType::Pointer marcher = FloatFMType::New();\n  \n  \/\/ setup trial points\n  typedef FloatFMType::NodeType NodeType;\n  typedef FloatFMType::NodeContainer NodeContainer;\n\n  NodeContainer::Pointer trialPoints = NodeContainer::New();\n\n  NodeType node;\n\n  FloatImage::OffsetType offset0 = {{28,35}};\n  \n  node.value = 0.0;\n  node.index += offset0;\n  node.index = itk::Index<2>::ZeroIndex + offset0;\n  trialPoints->InsertElement(0, node);\n  \n  marcher->SetTrialPoints( trialPoints );\n\n  \/\/ specify the size of the output image\n  FloatImage::SizeType size = {{64,64}};\n  marcher->SetOutputSize( size );\n\n  \/\/ update the marcher\n  marcher->Update();\n\n  \/\/ check the results\n  FloatImage::Pointer output = marcher->GetOutput();\n  itk::ImageRegionIterator<FloatImage>\n    iterator( output, output->GetBufferedRegion() );\n\n  iterator = iterator.Begin();\n  bool passed = true;\n\n  for( ; !iterator.IsAtEnd(); ++iterator )\n    {\n\n    FloatImage::IndexType tempIndex;\n    double distance;\n    float output;\n\n    tempIndex = iterator.GetIndex();\n    tempIndex -= offset0;\n    distance = 0.0;\n    for( int j = 0; j < 2; j++ )\n      {\n        distance += tempIndex[j] * tempIndex[j];\n      }\n    distance = vnl_math_sqrt( distance );\n\n    output = itk::ScalarTraits<PixelType>::GetScalar( iterator.Get() );\n\n    if( vnl_math_abs( output ) \/ distance > 1.42 )\n      {\n        std::cout << iterator.GetIndex() << \" \";\n        std::cout << vnl_math_abs( output ) \/ distance << \" \";\n        std::cout << vnl_math_abs( output ) << \" \" << distance << std::endl;\n        passed = false;\n      }\n    \n    }\n\n  if( passed )\n    {\n    std::cout << \"Fast Marching test passed\" << std::endl;\n    return EXIT_SUCCESS;\n    }\n  else\n    {\n    std::cout << \"Fast Marching test failed\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (C) 2004 MySQL 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; version 2 of the 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 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\/*\n  Utility program that encapsulates process creation, monitoring\n  and bulletproof process cleanup\n\n  Usage:\n    safe_process [options to safe_process] -- progname arg1 ... argn\n\n  To safeguard mysqld you would invoke safe_process with a few options\n  for safe_process itself followed by a double dash to indicate start\n  of the command line for the program you really want to start\n\n  $> safe_process --output=output.log -- mysqld --datadir=var\/data1 ...\n\n  This would redirect output to output.log and then start mysqld,\n  once it has done that it will continue to monitor the child as well\n  as the parent.\n\n  The safe_process then checks the follwing things:\n  1. Child exits, propagate the childs return code to the parent\n     by exiting with the same return code as the child.\n\n  2. Parent dies, immediately kill the child and exit, thus the\n     parent does not need to properly cleanup any child, it is handled\n     automatically.\n\n  3. Signal's recieced by the process will trigger same action as 2)\n\n  4. The named event \"safe_process[pid]\" can be signaled and will\n     trigger same action as 2)\n\n  WARNING! Be careful when using ProcessExplorer, since it will open\n           a handle to each process(and maybe also the Job), the process\n           spawned by safe_process will not be closed off when safe_process\n           is killed.\n*\/\n\n\/* Requires Windows 2000 or higher *\/\n#define _WIN32_WINNT 0x0500\n\n#include <windows.h>\n#include <stdio.h>\n#include <tlhelp32.h>\n#include <signal.h>\n\nstatic int verbose= 0;\nstatic char safe_process_name[32]= {0};\n\nstatic void message(const char* fmt, ...)\n{\n  if (!verbose)\n    return;\n  va_list args;\n  fprintf(stderr, \"%s: \", safe_process_name);\n  va_start(args, fmt);\n  vfprintf(stderr, fmt, args);\n  fprintf(stderr, \"\\n\");\n  va_end(args);\n  fflush(stderr);\n}\n\n\nstatic void die(const char* fmt, ...)\n{\n  DWORD last_err= GetLastError();\n  va_list args;\n  fprintf(stderr, \"%s: FATAL ERROR, \", safe_process_name);\n  va_start(args, fmt);\n  vfprintf(stderr, fmt, args);\n  fprintf(stderr, \"\\n\");\n  va_end(args);\n  if (last_err)\n  {\n    char *message_text;\n    if (FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER\n        |FORMAT_MESSAGE_IGNORE_INSERTS, NULL, last_err , 0, (LPSTR)&message_text,\n        0, NULL))\n    {\n      fprintf(stderr,\"error: %d, %s\\n\",last_err, message_text);\n      LocalFree(message_text);\n    }\n    else\n    {\n      \/* FormatMessage failed, print error code only *\/\n      fprintf(stderr,\"error:%d\\n\", last_err);\n    }\n  }\n  fflush(stderr);\n  exit(1);\n}\n\n\nDWORD get_parent_pid(DWORD pid)\n{\n  HANDLE snapshot;\n  DWORD parent_pid= -1;\n  PROCESSENTRY32 pe32;\n  pe32.dwSize= sizeof(PROCESSENTRY32);\n\n  snapshot= CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);\n  if (snapshot == INVALID_HANDLE_VALUE)\n    die(\"CreateToolhelp32Snapshot failed\");\n\n  if (!Process32First(snapshot, &pe32))\n  {\n    CloseHandle(snapshot);\n    die(\"Process32First failed\");\n  }\n\n  do\n  {\n    if (pe32.th32ProcessID == pid)\n      parent_pid= pe32.th32ParentProcessID;\n  } while(Process32Next( snapshot, &pe32));\n  CloseHandle(snapshot);\n\n  if (parent_pid == -1)\n    die(\"Could not find parent pid\");\n\n  return parent_pid;\n}\n\n\nenum {\n  PARENT,\n  CHILD,\n  EVENT,\n  NUM_HANDLES\n};\n\n\nHANDLE shutdown_event;\nvoid handle_signal (int signal)\n{\n  message(\"Got signal: %d\", signal);\n  if(SetEvent(shutdown_event) == 0) {\n    \/* exit safe_process and (hopefully) kill off the child *\/\n    die(\"Failed to SetEvent\");\n  }\n}\n\n\nint main(int argc, const char** argv )\n{\n  char child_args[4096]= {0};\n  DWORD pid= GetCurrentProcessId();\n  DWORD parent_pid= get_parent_pid(pid);\n  HANDLE job_handle;\n  HANDLE wait_handles[NUM_HANDLES]= {0};\n  PROCESS_INFORMATION process_info= {0};\n\n  sprintf(safe_process_name, \"safe_process[%d]\", pid);\n\n  \/* Create an event for the signal handler *\/\n  if ((shutdown_event=\n       CreateEvent(NULL, TRUE, FALSE, safe_process_name)) == NULL)\n    die(\"Failed to create shutdown_event\");\n  wait_handles[EVENT]= shutdown_event;\n\n  signal(SIGINT,   handle_signal);\n  signal(SIGBREAK, handle_signal);\n  signal(SIGTERM,  handle_signal);\n\n  message(\"Started\");\n\n  \/* Parse arguments *\/\n  for (int i= 1; i < argc; i++) {\n    const char* arg= argv[i];\n\tchar* to= child_args;\n    if (strcmp(arg, \"--\") == 0 && strlen(arg) == 2) {\n      \/* Got the \"--\" delimiter *\/\n      if (i >= argc)\n        die(\"No real args -> nothing to do\");\n      \/* Copy the remaining args to child_arg *\/\n      for (int j= i+1; j < argc; j++) {\n        to+= _snprintf(to, child_args + sizeof(child_args) - to, \"%s \", argv[j]);\n      }\n      break;\n    } else {\n      if ( strcmp(arg, \"--verbose\") == 0 )\n        verbose++;\n\t  else if ( strncmp(arg, \"--parent-pid\", 10) == 0 )\n\t  {\n\t    \/* Override parent_pid with a value provided by user *\/\n\t\tconst char* start;\n        if ((start= strstr(arg, \"=\")) == NULL)\n\t\t  die(\"Could not find start of option value in '%s'\", arg);\n\t\tstart++; \/* Step past = *\/\n\t\tif ((parent_pid= atoi(start)) == 0)\n\t\t  die(\"Invalid value '%s' passed to --parent-id\", start);\n\t  }\n      else\n        die(\"Unknown option: %s\", arg);\n    }\n  }\n  if (*child_args == '\\0')\n    die(\"nothing to do\");\n\n  \/* Open a handle to the parent process *\/\n  message(\"parent_pid: %d\", parent_pid);\n  if (parent_pid == pid)\n    die(\"parent_pid is equal to own pid!\");\n\n  if ((wait_handles[PARENT]=\n       OpenProcess(SYNCHRONIZE, FALSE, parent_pid)) == NULL)\n    die(\"Failed to open parent process with pid: %d\", parent_pid);\n\n  \/* Create the child process in a job *\/\n  JOBOBJECT_EXTENDED_LIMIT_INFORMATION jeli = { 0 };\n  STARTUPINFO                          si   = { 0 };\n  si.cb = sizeof(si);\n\n  \/*\n    Create the job object to make it possible to kill the process\n    and all of it's children in one go\n  *\/\n  if ((job_handle= CreateJobObject(NULL, NULL)) == NULL)\n    die(\"CreateJobObject failed\");\n\n  \/*\n    Make all processes associated with the job terminate when the\n    last handle to the job is closed.\n  *\/\n  jeli.BasicLimitInformation.LimitFlags = JOB_OBJECT_LIMIT_KILL_ON_JOB_CLOSE;\n  if (SetInformationJobObject(job_handle, JobObjectExtendedLimitInformation,\n                              &jeli, sizeof(jeli)) == 0)\n    message(\"SetInformationJobObject failed, continue anyway...\");\n\n#if 0\n  \/* Setup stdin, stdout and stderr redirect *\/\n  si.dwFlags= STARTF_USESTDHANDLES;\n  si.hStdInput= GetStdHandle(STD_INPUT_HANDLE);\n  si.hStdOutput= GetStdHandle(STD_OUTPUT_HANDLE);\n  si.hStdError= GetStdHandle(STD_ERROR_HANDLE);\n#endif\n\n  \/*\n    Create the process suspended to make sure it's assigned to the\n    Job before it creates any process of it's own\n\n    Allow the new process to break away from any job that this\n    process is part of so that it can be assigned to the new JobObject\n    we just created. This is safe since the new JobObject is created with\n    the JOB_OBJECT_LIMIT_KILL_ON_JOB_CLOSE flag, making sure it will be\n    terminated when the last handle to it is closed(which is owned by\n    this process).\n  *\/\n  if (CreateProcess(NULL, (LPSTR)child_args,\n                    NULL,\n                    NULL,\n                    TRUE, \/* inherit handles *\/\n                    CREATE_SUSPENDED | CREATE_BREAKAWAY_FROM_JOB,\n                    NULL,\n                    NULL,\n                    &si,\n                    &process_info) == 0)\n    die(\"CreateProcess failed\");\n\n  if (AssignProcessToJobObject(job_handle, process_info.hProcess) == 0)\n  {\n    TerminateProcess(process_info.hProcess, 200);\n    die(\"AssignProcessToJobObject failed\");\n  }\n  ResumeThread(process_info.hThread);\n  CloseHandle(process_info.hThread);\n\n  wait_handles[CHILD]= process_info.hProcess;\n\n  message(\"Started child %d\", process_info.dwProcessId);\n\n  \/* Monitor loop *\/\n  DWORD child_exit_code= 1;\n  DWORD wait_res= WaitForMultipleObjects(NUM_HANDLES, wait_handles,\n                                         FALSE, INFINITE);\n  switch (wait_res)\n  {\n    case WAIT_OBJECT_0 + PARENT:\n      message(\"Parent exit\");\n      break;\n    case WAIT_OBJECT_0 + CHILD:\n      if (GetExitCodeProcess(wait_handles[CHILD], &child_exit_code) == 0)\n        message(\"Child exit: could not get exit_code\");\n      else\n        message(\"Child exit: exit_code: %d\", child_exit_code);\n      break;\n    case WAIT_OBJECT_0 + EVENT:\n      message(\"Wake up from shutdown_event\");\n      break;\n\n    default:\n      message(\"Unexpected result %d from WaitForMultipleObjects\", wait_res);\n      break;\n  }\n  message(\"Exiting, child: %d\", process_info.dwProcessId);\n\n  if (TerminateJobObject(job_handle, 201) == 0)\n    message(\"TerminateJobObject failed\");\n  CloseHandle(job_handle);\n  message(\"Job terminated and closed\");\n  if (wait_res != WAIT_OBJECT_0 + CHILD)\n  {\n    \/* The child has not yet returned, wait for it *\/\n    message(\"waiting for child to exit\");\n    if ((wait_res= WaitForSingleObject(wait_handles[CHILD], INFINITE))\n        != WAIT_OBJECT_0)\n    {\n      message(\"child wait failed: %d\", wait_res);\n    }\n    else\n    {\n      message(\"child wait succeeded\");\n    }\n    \/* Child's exit code should now be 201, no need to get it *\/\n  }\n\n  message(\"Closing handles\");\n  for (int i= 0; i < NUM_HANDLES; i++)\n    CloseHandle(wait_handles[i]);\n\n  message(\"Exiting, exit_code: %d\", child_exit_code);\n  exit(child_exit_code);\n}\n\n<commit_msg>Bug #44775 MTR fails to bootstrap mysqld on Windows in Pushbuild 2.<commit_after>\/* Copyright (C) 2004 MySQL 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; version 2 of the 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 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\/*\n  Utility program that encapsulates process creation, monitoring\n  and bulletproof process cleanup\n\n  Usage:\n    safe_process [options to safe_process] -- progname arg1 ... argn\n\n  To safeguard mysqld you would invoke safe_process with a few options\n  for safe_process itself followed by a double dash to indicate start\n  of the command line for the program you really want to start\n\n  $> safe_process --output=output.log -- mysqld --datadir=var\/data1 ...\n\n  This would redirect output to output.log and then start mysqld,\n  once it has done that it will continue to monitor the child as well\n  as the parent.\n\n  The safe_process then checks the follwing things:\n  1. Child exits, propagate the childs return code to the parent\n     by exiting with the same return code as the child.\n\n  2. Parent dies, immediately kill the child and exit, thus the\n     parent does not need to properly cleanup any child, it is handled\n     automatically.\n\n  3. Signal's recieced by the process will trigger same action as 2)\n\n  4. The named event \"safe_process[pid]\" can be signaled and will\n     trigger same action as 2)\n\n  WARNING! Be careful when using ProcessExplorer, since it will open\n           a handle to each process(and maybe also the Job), the process\n           spawned by safe_process will not be closed off when safe_process\n           is killed.\n*\/\n\n\/* Requires Windows 2000 or higher *\/\n#define _WIN32_WINNT 0x0500\n\n#include <windows.h>\n#include <stdio.h>\n#include <tlhelp32.h>\n#include <signal.h>\n\nstatic int verbose= 0;\nstatic char safe_process_name[32]= {0};\n\nstatic void message(const char* fmt, ...)\n{\n  if (!verbose)\n    return;\n  va_list args;\n  fprintf(stderr, \"%s: \", safe_process_name);\n  va_start(args, fmt);\n  vfprintf(stderr, fmt, args);\n  fprintf(stderr, \"\\n\");\n  va_end(args);\n  fflush(stderr);\n}\n\n\nstatic void die(const char* fmt, ...)\n{\n  DWORD last_err= GetLastError();\n  va_list args;\n  fprintf(stderr, \"%s: FATAL ERROR, \", safe_process_name);\n  va_start(args, fmt);\n  vfprintf(stderr, fmt, args);\n  fprintf(stderr, \"\\n\");\n  va_end(args);\n  if (last_err)\n  {\n    char *message_text;\n    if (FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER\n        |FORMAT_MESSAGE_IGNORE_INSERTS, NULL, last_err , 0, (LPSTR)&message_text,\n        0, NULL))\n    {\n      fprintf(stderr,\"error: %d, %s\\n\",last_err, message_text);\n      LocalFree(message_text);\n    }\n    else\n    {\n      \/* FormatMessage failed, print error code only *\/\n      fprintf(stderr,\"error:%d\\n\", last_err);\n    }\n  }\n  fflush(stderr);\n  exit(1);\n}\n\n\nDWORD get_parent_pid(DWORD pid)\n{\n  HANDLE snapshot;\n  DWORD parent_pid= -1;\n  PROCESSENTRY32 pe32;\n  pe32.dwSize= sizeof(PROCESSENTRY32);\n\n  snapshot= CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);\n  if (snapshot == INVALID_HANDLE_VALUE)\n    die(\"CreateToolhelp32Snapshot failed\");\n\n  if (!Process32First(snapshot, &pe32))\n  {\n    CloseHandle(snapshot);\n    die(\"Process32First failed\");\n  }\n\n  do\n  {\n    if (pe32.th32ProcessID == pid)\n      parent_pid= pe32.th32ParentProcessID;\n  } while(Process32Next( snapshot, &pe32));\n  CloseHandle(snapshot);\n\n  if (parent_pid == -1)\n    die(\"Could not find parent pid\");\n\n  return parent_pid;\n}\n\n\nenum {\n  PARENT,\n  CHILD,\n  EVENT,\n  NUM_HANDLES\n};\n\n\nHANDLE shutdown_event;\nvoid handle_signal (int signal)\n{\n  message(\"Got signal: %d\", signal);\n  if(SetEvent(shutdown_event) == 0) {\n    \/* exit safe_process and (hopefully) kill off the child *\/\n    die(\"Failed to SetEvent\");\n  }\n}\n\n\nint main(int argc, const char** argv )\n{\n  char child_args[4096]= {0};\n  DWORD pid= GetCurrentProcessId();\n  DWORD parent_pid= get_parent_pid(pid);\n  HANDLE job_handle;\n  HANDLE wait_handles[NUM_HANDLES]= {0};\n  PROCESS_INFORMATION process_info= {0};\n\n  sprintf(safe_process_name, \"safe_process[%d]\", pid);\n\n  \/* Create an event for the signal handler *\/\n  if ((shutdown_event=\n       CreateEvent(NULL, TRUE, FALSE, safe_process_name)) == NULL)\n    die(\"Failed to create shutdown_event\");\n  wait_handles[EVENT]= shutdown_event;\n\n  signal(SIGINT,   handle_signal);\n  signal(SIGBREAK, handle_signal);\n  signal(SIGTERM,  handle_signal);\n\n  message(\"Started\");\n\n  \/* Parse arguments *\/\n  for (int i= 1; i < argc; i++) {\n    const char* arg= argv[i];\n\tchar* to= child_args;\n    if (strcmp(arg, \"--\") == 0 && strlen(arg) == 2) {\n      \/* Got the \"--\" delimiter *\/\n      if (i >= argc)\n        die(\"No real args -> nothing to do\");\n      \/* Copy the remaining args to child_arg *\/\n      for (int j= i+1; j < argc; j++) {\n        to+= _snprintf(to, child_args + sizeof(child_args) - to, \"%s \", argv[j]);\n      }\n      break;\n    } else {\n      if ( strcmp(arg, \"--verbose\") == 0 )\n        verbose++;\n\t  else if ( strncmp(arg, \"--parent-pid\", 10) == 0 )\n\t  {\n\t    \/* Override parent_pid with a value provided by user *\/\n\t\tconst char* start;\n        if ((start= strstr(arg, \"=\")) == NULL)\n\t\t  die(\"Could not find start of option value in '%s'\", arg);\n\t\tstart++; \/* Step past = *\/\n\t\tif ((parent_pid= atoi(start)) == 0)\n\t\t  die(\"Invalid value '%s' passed to --parent-id\", start);\n\t  }\n      else\n        die(\"Unknown option: %s\", arg);\n    }\n  }\n  if (*child_args == '\\0')\n    die(\"nothing to do\");\n\n  \/* Open a handle to the parent process *\/\n  message(\"parent_pid: %d\", parent_pid);\n  if (parent_pid == pid)\n    die(\"parent_pid is equal to own pid!\");\n\n  if ((wait_handles[PARENT]=\n       OpenProcess(SYNCHRONIZE, FALSE, parent_pid)) == NULL)\n    die(\"Failed to open parent process with pid: %d\", parent_pid);\n\n  \/* Create the child process in a job *\/\n  JOBOBJECT_EXTENDED_LIMIT_INFORMATION jeli = { 0 };\n  STARTUPINFO                          si   = { 0 };\n  si.cb = sizeof(si);\n\n  \/*\n    Create the job object to make it possible to kill the process\n    and all of it's children in one go\n  *\/\n  if ((job_handle= CreateJobObject(NULL, NULL)) == NULL)\n    die(\"CreateJobObject failed\");\n\n  \/*\n    Make all processes associated with the job terminate when the\n    last handle to the job is closed.\n  *\/\n  jeli.BasicLimitInformation.LimitFlags = JOB_OBJECT_LIMIT_KILL_ON_JOB_CLOSE;\n  if (SetInformationJobObject(job_handle, JobObjectExtendedLimitInformation,\n                              &jeli, sizeof(jeli)) == 0)\n    message(\"SetInformationJobObject failed, continue anyway...\");\n\n#if 0\n  \/* Setup stdin, stdout and stderr redirect *\/\n  si.dwFlags= STARTF_USESTDHANDLES;\n  si.hStdInput= GetStdHandle(STD_INPUT_HANDLE);\n  si.hStdOutput= GetStdHandle(STD_OUTPUT_HANDLE);\n  si.hStdError= GetStdHandle(STD_ERROR_HANDLE);\n#endif\n\n  \/*\n    Create the process suspended to make sure it's assigned to the\n    Job before it creates any process of it's own\n\n    Allow the new process to break away from any job that this\n    process is part of so that it can be assigned to the new JobObject\n    we just created. This is safe since the new JobObject is created with\n    the JOB_OBJECT_LIMIT_KILL_ON_JOB_CLOSE flag, making sure it will be\n    terminated when the last handle to it is closed(which is owned by\n    this process).\n\n    If breakaway from job fails on some reason, fallback is to create a\n    new process group. Process groups also allow to kill process and its \n    descedants, subject to some restrictions (processes have to run within\n    the same console,and must not ignore CTRL_BREAK)\n  *\/\n  DWORD create_flags[]= {CREATE_BREAKAWAY_FROM_JOB, CREATE_NEW_PROCESS_GROUP, 0};\n  BOOL process_created= FALSE;\n  BOOL jobobject_assigned= FALSE;\n\n  for (int i=0; i < sizeof(create_flags)\/sizeof(create_flags[0]); i++)\n  { \n    process_created= CreateProcess(NULL, (LPSTR)child_args,\n                    NULL,\n                    NULL,\n                    TRUE, \/* inherit handles *\/\n                    CREATE_SUSPENDED | create_flags[i],\n                    NULL,\n                    NULL,\n                    &si,\n                    &process_info);\n    if (process_created)\n    {\n     jobobject_assigned= AssignProcessToJobObject(job_handle, process_info.hProcess);\n     break;\n    }\n  }\n\n  if (!process_created)\n  {\n    die(\"CreateProcess failed\");\n  }\n  ResumeThread(process_info.hThread);\n  CloseHandle(process_info.hThread);\n\n  wait_handles[CHILD]= process_info.hProcess;\n\n  message(\"Started child %d\", process_info.dwProcessId);\n\n  \/* Monitor loop *\/\n  DWORD child_exit_code= 1;\n  DWORD wait_res= WaitForMultipleObjects(NUM_HANDLES, wait_handles,\n                                         FALSE, INFINITE);\n  switch (wait_res)\n  {\n    case WAIT_OBJECT_0 + PARENT:\n      message(\"Parent exit\");\n      break;\n    case WAIT_OBJECT_0 + CHILD:\n      if (GetExitCodeProcess(wait_handles[CHILD], &child_exit_code) == 0)\n        message(\"Child exit: could not get exit_code\");\n      else\n        message(\"Child exit: exit_code: %d\", child_exit_code);\n      break;\n    case WAIT_OBJECT_0 + EVENT:\n      message(\"Wake up from shutdown_event\");\n      break;\n\n    default:\n      message(\"Unexpected result %d from WaitForMultipleObjects\", wait_res);\n      break;\n  }\n  message(\"Exiting, child: %d\", process_info.dwProcessId);\n\n  if (TerminateJobObject(job_handle, 201) == 0)\n    message(\"TerminateJobObject failed\");\n  CloseHandle(job_handle);\n  message(\"Job terminated and closed\");\n\n  if (!jobobject_assigned)\n  {\n    GenerateConsoleCtrlEvent(CTRL_BREAK_EVENT, process_info.dwProcessId);\n    TerminateProcess(process_info.hProcess, 202);\n  }\n\n  if (wait_res != WAIT_OBJECT_0 + CHILD)\n  {\n    \/* The child has not yet returned, wait for it *\/\n    message(\"waiting for child to exit\");\n    if ((wait_res= WaitForSingleObject(wait_handles[CHILD], INFINITE))\n        != WAIT_OBJECT_0)\n    {\n      message(\"child wait failed: %d\", wait_res);\n    }\n    else\n    {\n      message(\"child wait succeeded\");\n    }\n    \/* Child's exit code should now be 201, no need to get it *\/\n  }\n\n  message(\"Closing handles\");\n  for (int i= 0; i < NUM_HANDLES; i++)\n    CloseHandle(wait_handles[i]);\n\n  message(\"Exiting, exit_code: %d\", child_exit_code);\n  exit(child_exit_code);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (C) 2017 by Godlike\n* This code is licensed under the MIT license (MIT)\n* (http:\/\/opensource.org\/licenses\/MIT)\n*\/\n\n#include <unicorn\/video\/vulkan\/VkTexture.hpp>\n#include <unicorn\/video\/Texture.hpp>\n#include <unicorn\/utility\/Logger.hpp>\n\nnamespace unicorn\n{\nnamespace video\n{\nnamespace vulkan\n{\nVkTexture::VkTexture(vk::Device device)\n    : m_device(device)\n    , m_vkImage(nullptr)\n    , m_isInitialized(false)\n{\n}\n\nconst vk::DescriptorImageInfo& VkTexture::GetDescriptorImageInfo() const\n{\n    return m_imageInfo;\n}\n\nbool VkTexture::Create(const vk::PhysicalDevice& physicalDevice, const vk::Device& device,\n                       const vk::CommandPool& commandPool, const vk::Queue& queue, const Texture* texture)\n{\n    if(!m_isInitialized)\n    {\n        Buffer imageStagingBuffer;\n        bool result = imageStagingBuffer.Create(\n            physicalDevice, device,\n            vk::BufferUsageFlagBits::eTransferSrc,\n            vk::MemoryPropertyFlagBits::eHostVisible | vk::MemoryPropertyFlagBits::eHostCoherent,\n            texture->Size());\n        if(!result)\n        {\n            LOG_ERROR(\"Can't allocate staging buffer for texture - %s\", texture->Path().c_str());\n            return false;\n        }\n\n        imageStagingBuffer.Map();\n        imageStagingBuffer.Write(texture->Data());\n        imageStagingBuffer.Unmap();\n\n        m_vkImage = new Image(\n            physicalDevice,\n            device,\n            vk::Format::eR8G8B8A8Unorm,\n            vk::ImageUsageFlagBits::eTransferDst | vk::ImageUsageFlagBits::eSampled | vk::ImageUsageFlagBits::eColorAttachment,\n            texture->Width(),\n            texture->Height());\n        if(!m_vkImage->IsInitialized())\n        {\n            LOG_ERROR(\"Can't allocate vulkan based image for texture - %s\", texture->Path().c_str());\n            return false;\n        }\n\n        m_vkImage->TransitionLayout(vk::Format::eR8G8B8A8Unorm, vk::ImageLayout::eUndefined,\n                                    vk::ImageLayout::eTransferDstOptimal, commandPool, queue);\n        imageStagingBuffer.CopyToImage(*m_vkImage, commandPool, queue);\n        m_vkImage->TransitionLayout(vk::Format::eR8G8B8A8Unorm, vk::ImageLayout::eTransferDstOptimal,\n                                    vk::ImageLayout::eShaderReadOnlyOptimal, commandPool, queue);\n\n        imageStagingBuffer.Destroy();\n\n        vk::SamplerCreateInfo samplerInfo;\n        samplerInfo.setMagFilter(vk::Filter::eLinear);\n        samplerInfo.setMinFilter(vk::Filter::eLinear);\n        samplerInfo.setAddressModeU(vk::SamplerAddressMode::eRepeat);\n        samplerInfo.setAddressModeV(vk::SamplerAddressMode::eRepeat);\n        samplerInfo.setAddressModeW(vk::SamplerAddressMode::eRepeat);\n        samplerInfo.setAnisotropyEnable(VK_TRUE);\n        samplerInfo.setMaxAnisotropy(16);\n        samplerInfo.setBorderColor(vk::BorderColor::eIntOpaqueBlack);\n        samplerInfo.setUnnormalizedCoordinates(VK_FALSE);\n        samplerInfo.setCompareEnable(VK_FALSE);\n        samplerInfo.setCompareOp(vk::CompareOp::eAlways);\n        samplerInfo.setMipmapMode(vk::SamplerMipmapMode::eLinear);\n        samplerInfo.setMipLodBias(0.0f);\n        samplerInfo.setMinLod(0.0f);\n        samplerInfo.setMaxLod(0.0f);\n\n        result = (device.createSampler(&samplerInfo, nullptr, &m_sampler) == vk::Result::eSuccess);\n\n        if(!result)\n        {\n            LOG_ERROR(\"Can't create sampler for texture - %s\", texture->Path());\n            return false;\n        }\n\n        m_imageInfo.sampler = m_sampler;\n        m_imageInfo.imageView = m_vkImage->GetVkImageView();\n        m_isInitialized = true;\n    }\n    return true;\n}\n\nvoid VkTexture::Delete()\n{\n    if(m_isInitialized)\n    {\n        if(m_device && m_sampler)\n        {\n            m_device.destroySampler(m_sampler);\n        }\n        m_vkImage->Delete();\n        m_isInitialized = false;\n    }\n}\n\nbool VkTexture::IsInitialized() const\n{\n    return m_isInitialized;\n}\n}\n}\n}\n<commit_msg>[#20] travis fix<commit_after>\/*\n* Copyright (C) 2017 by Godlike\n* This code is licensed under the MIT license (MIT)\n* (http:\/\/opensource.org\/licenses\/MIT)\n*\/\n\n#include <unicorn\/video\/vulkan\/VkTexture.hpp>\n#include <unicorn\/video\/Texture.hpp>\n#include <unicorn\/utility\/Logger.hpp>\n\nnamespace unicorn\n{\nnamespace video\n{\nnamespace vulkan\n{\nVkTexture::VkTexture(vk::Device device)\n    : m_device(device)\n    , m_vkImage(nullptr)\n    , m_isInitialized(false)\n{\n}\n\nconst vk::DescriptorImageInfo& VkTexture::GetDescriptorImageInfo() const\n{\n    return m_imageInfo;\n}\n\nbool VkTexture::Create(const vk::PhysicalDevice& physicalDevice, const vk::Device& device,\n                       const vk::CommandPool& commandPool, const vk::Queue& queue, const Texture* texture)\n{\n    if(!m_isInitialized)\n    {\n        Buffer imageStagingBuffer;\n        bool result = imageStagingBuffer.Create(\n            physicalDevice, device,\n            vk::BufferUsageFlagBits::eTransferSrc,\n            vk::MemoryPropertyFlagBits::eHostVisible | vk::MemoryPropertyFlagBits::eHostCoherent,\n            texture->Size());\n        if(!result)\n        {\n            LOG_ERROR(\"Can't allocate staging buffer for texture - %s\", texture->Path().c_str());\n            return false;\n        }\n\n        imageStagingBuffer.Map();\n        imageStagingBuffer.Write(texture->Data());\n        imageStagingBuffer.Unmap();\n\n        m_vkImage = new Image(\n            physicalDevice,\n            device,\n            vk::Format::eR8G8B8A8Unorm,\n            vk::ImageUsageFlagBits::eTransferDst | vk::ImageUsageFlagBits::eSampled | vk::ImageUsageFlagBits::eColorAttachment,\n            texture->Width(),\n            texture->Height());\n        if(!m_vkImage->IsInitialized())\n        {\n            LOG_ERROR(\"Can't allocate vulkan based image for texture - %s\", texture->Path().c_str());\n            return false;\n        }\n\n        m_vkImage->TransitionLayout(vk::Format::eR8G8B8A8Unorm, vk::ImageLayout::eUndefined,\n                                    vk::ImageLayout::eTransferDstOptimal, commandPool, queue);\n        imageStagingBuffer.CopyToImage(*m_vkImage, commandPool, queue);\n        m_vkImage->TransitionLayout(vk::Format::eR8G8B8A8Unorm, vk::ImageLayout::eTransferDstOptimal,\n                                    vk::ImageLayout::eShaderReadOnlyOptimal, commandPool, queue);\n\n        imageStagingBuffer.Destroy();\n\n        vk::SamplerCreateInfo samplerInfo;\n        samplerInfo.setMagFilter(vk::Filter::eLinear);\n        samplerInfo.setMinFilter(vk::Filter::eLinear);\n        samplerInfo.setAddressModeU(vk::SamplerAddressMode::eRepeat);\n        samplerInfo.setAddressModeV(vk::SamplerAddressMode::eRepeat);\n        samplerInfo.setAddressModeW(vk::SamplerAddressMode::eRepeat);\n        samplerInfo.setAnisotropyEnable(VK_TRUE);\n        samplerInfo.setMaxAnisotropy(16);\n        samplerInfo.setBorderColor(vk::BorderColor::eIntOpaqueBlack);\n        samplerInfo.setUnnormalizedCoordinates(VK_FALSE);\n        samplerInfo.setCompareEnable(VK_FALSE);\n        samplerInfo.setCompareOp(vk::CompareOp::eAlways);\n        samplerInfo.setMipmapMode(vk::SamplerMipmapMode::eLinear);\n        samplerInfo.setMipLodBias(0.0f);\n        samplerInfo.setMinLod(0.0f);\n        samplerInfo.setMaxLod(0.0f);\n\n        result = (device.createSampler(&samplerInfo, nullptr, &m_sampler) == vk::Result::eSuccess);\n\n        if(!result)\n        {\n            LOG_ERROR(\"Can't create sampler for texture - %s\", texture->Path().c_str());\n            return false;\n        }\n\n        m_imageInfo.sampler = m_sampler;\n        m_imageInfo.imageView = m_vkImage->GetVkImageView();\n        m_isInitialized = true;\n    }\n    return true;\n}\n\nvoid VkTexture::Delete()\n{\n    if(m_isInitialized)\n    {\n        if(m_device && m_sampler)\n        {\n            m_device.destroySampler(m_sampler);\n        }\n        m_vkImage->Delete();\n        m_isInitialized = false;\n    }\n}\n\nbool VkTexture::IsInitialized() const\n{\n    return m_isInitialized;\n}\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2015 Estimation and Control Library (ECL). 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 ECL 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 terrain_estimator.cpp\n * Function for fusing rangefinder measurements to estimate terrain vertical position\/\n *\n * @author Paul Riseborough <p_riseborough@live.com.au>\n *\n *\/\n\n#include \"ekf.h\"\n#include <ecl.h>\n#include <mathlib\/mathlib.h>\n\nbool Ekf::initHagl()\n{\n\tbool initialized = false;\n\t\/\/ get most recent range measurement from buffer\n\tconst rangeSample &latest_measurement = _range_buffer.get_newest();\n\n\tif (!_control_status.flags.in_air) {\n\t\t\/\/ if on ground, do not trust the range sensor, but assume a ground clearance\n\t\t_terrain_vpos = _state.pos(2) + _params.rng_gnd_clearance;\n\t\t\/\/ use the ground clearance value as our uncertainty\n\t\t_terrain_var = sq(_params.rng_gnd_clearance);\n\t\tinitialized = true;\n\n\t} else if ((_params.terrain_fusion_mode & TerrainFusionMask::TerrainFuseRangeFinder)\n\t\t   && _range_sensor.isHealthy()\n\t\t   && isRecent(latest_measurement.time_us, (uint64_t)2e5)) {\n\t\t\/\/ if we have a fresh measurement, use it to initialise the terrain estimator\n\t\t\/\/ TODO: the latest measurment did not go through the checks and could be invalid!\n\t\t_terrain_vpos = _state.pos(2) + latest_measurement.rng * _range_sensor.getCosTilt();\n\t\t\/\/ initialise state variance to variance of measurement\n\t\t_terrain_var = sq(_params.range_noise);\n\t\t\/\/ success\n\t\tinitialized = true;\n\n\t} else if ((_params.terrain_fusion_mode & TerrainFusionMask::TerrainFuseOpticalFlow)\n\t\t   && _flow_for_terrain_data_ready) {\n\t\t\/\/ initialise terrain vertical position to origin as this is the best guess we have\n\t\t_terrain_vpos = fmaxf(0.0f,  _state.pos(2));\n\t\t_terrain_var = 100.0f;\n\t\tinitialized = true;\n\n\t} else {\n\t\t\/\/ no information - cannot initialise\n\t}\n\n\tif (initialized) {\n\t\t\/\/ has initialized with valid data\n\t\t_time_last_hagl_fuse = _time_last_imu;\n\t}\n\n\treturn initialized;\n}\n\nvoid Ekf::runTerrainEstimator()\n{\n\t\/\/ If we are on ground, store the local position and time to use as a reference\n\tif (!_control_status.flags.in_air) {\n\t\t_last_on_ground_posD = _state.pos(2);\n\t}\n\n\t\/\/ Perform initialisation check and\n\t\/\/ on ground, continuously reset the terrain estimator\n\tif (!_terrain_initialised || !_control_status.flags.in_air) {\n\t\t_terrain_initialised = initHagl();\n\n\t} else {\n\n\t\t\/\/ predict the state variance growth where the state is the vertical position of the terrain underneath the vehicle\n\n\t\t\/\/ process noise due to errors in vehicle height estimate\n\t\t_terrain_var += sq(_imu_sample_delayed.delta_vel_dt * _params.terrain_p_noise);\n\n\t\t\/\/ process noise due to terrain gradient\n\t\t_terrain_var += sq(_imu_sample_delayed.delta_vel_dt * _params.terrain_gradient)\n\t\t\t\t* (sq(_state.vel(0)) + sq(_state.vel(1)));\n\n\t\t\/\/ limit the variance to prevent it becoming badly conditioned\n\t\t_terrain_var = math::constrain(_terrain_var, 0.0f, 1e4f);\n\n\t\t\/\/ Fuse range finder data if available\n\t\tif (_range_sensor.isDataHealthy()) {\n\t\t\tfuseHagl();\n\t\t}\n\n\t\tif (_flow_for_terrain_data_ready) {\n\t\t\tfuseFlowForTerrain();\n\t\t\t_flow_for_terrain_data_ready = false;\n\t\t}\n\n\t\t\/\/ constrain _terrain_vpos to be a minimum of _params.rng_gnd_clearance larger than _state.pos(2)\n\t\tif (_terrain_vpos - _state.pos(2) < _params.rng_gnd_clearance) {\n\t\t\t_terrain_vpos = _params.rng_gnd_clearance + _state.pos(2);\n\t\t}\n\t}\n\n\tupdateTerrainValidity();\n}\n\nvoid Ekf::fuseHagl()\n{\n\t\/\/ get a height above ground measurement from the range finder assuming a flat earth\n\tconst float meas_hagl = _range_sensor.getRange() * _range_sensor.getCosTilt();\n\n\t\/\/ predict the hagl from the vehicle position and terrain height\n\tconst float pred_hagl = _terrain_vpos - _state.pos(2);\n\n\t\/\/ calculate the innovation\n\t_hagl_innov = pred_hagl - meas_hagl;\n\n\t\/\/ calculate the observation variance adding the variance of the vehicles own height uncertainty\n\tconst float obs_variance = fmaxf(P(9,9) * _params.vehicle_variance_scaler, 0.0f)\n\t\t\t     + sq(_params.range_noise)\n\t\t\t     + sq(_params.range_noise_scaler * _range_sensor.getRange());\n\n\t\/\/ calculate the innovation variance - limiting it to prevent a badly conditioned fusion\n\t_hagl_innov_var = fmaxf(_terrain_var + obs_variance, obs_variance);\n\n\t\/\/ perform an innovation consistency check and only fuse data if it passes\n\tconst float gate_size = fmaxf(_params.range_innov_gate, 1.0f);\n\t_hagl_test_ratio = sq(_hagl_innov) \/ (sq(gate_size) * _hagl_innov_var);\n\n\tif (_hagl_test_ratio <= 1.0f) {\n\t\t\/\/ calculate the Kalman gain\n\t\tfloat gain = _terrain_var \/ _hagl_innov_var;\n\t\t\/\/ correct the state\n\t\t_terrain_vpos -= gain * _hagl_innov;\n\t\t\/\/ correct the variance\n\t\t_terrain_var = fmaxf(_terrain_var * (1.0f - gain), 0.0f);\n\t\t\/\/ record last successful fusion event\n\t\t_time_last_hagl_fuse = _time_last_imu;\n\t\t_innov_check_fail_status.flags.reject_hagl = false;\n\n\t} else {\n\t\t\/\/ If we have been rejecting range data for too long, reset to measurement\n\t\tif (isTimedOut(_time_last_hagl_fuse, (uint64_t)10E6)) {\n\t\t\t_terrain_vpos = _state.pos(2) + meas_hagl;\n\t\t\t_terrain_var = obs_variance;\n\n\t\t} else {\n\t\t\t_innov_check_fail_status.flags.reject_hagl = true;\n\t\t}\n\t}\n}\n\nvoid Ekf::fuseFlowForTerrain()\n{\n\t\/\/ calculate optical LOS rates using optical flow rates that have had the body angular rate contribution removed\n\t\/\/ correct for gyro bias errors in the data used to do the motion compensation\n\t\/\/ Note the sign convention used: A positive LOS rate is a RH rotation of the scene about that axis.\n\tconst Vector2f opt_flow_rate = Vector2f{_flow_compensated_XY_rad} \/ _flow_sample_delayed.dt + Vector2f{_flow_gyro_bias};\n\n\t\/\/ get latest estimated orientation\n\tconst float q0 = _state.quat_nominal(0);\n\tconst float q1 = _state.quat_nominal(1);\n\tconst float q2 = _state.quat_nominal(2);\n\tconst float q3 = _state.quat_nominal(3);\n\n\t\/\/ calculate the optical flow observation variance\n\tconst float R_LOS = calcOptFlowMeasVar();\n\n\t\/\/ get rotation matrix from earth to body\n\tconst Dcmf earth_to_body = quat_to_invrotmat(_state.quat_nominal);\n\n\t\/\/ calculate the sensor position relative to the IMU\n\tconst Vector3f pos_offset_body = _params.flow_pos_body - _params.imu_pos_body;\n\n\t\/\/ calculate the velocity of the sensor relative to the imu in body frame\n\t\/\/ Note: _flow_sample_delayed.gyro_xyz is the negative of the body angular velocity, thus use minus sign\n\tconst Vector3f vel_rel_imu_body = Vector3f(-_flow_sample_delayed.gyro_xyz \/ _flow_sample_delayed.dt) % pos_offset_body;\n\n\t\/\/ calculate the velocity of the sensor in the earth frame\n\tconst Vector3f vel_rel_earth = _state.vel + _R_to_earth * vel_rel_imu_body;\n\n\t\/\/ rotate into body frame\n\tconst Vector3f vel_body = earth_to_body * vel_rel_earth;\n\n\tconst float t0 = q0 * q0 - q1 * q1 - q2 * q2 + q3 * q3;\n\n\t\/\/ constrain terrain to minimum allowed value and predict height above ground\n\t_terrain_vpos = fmaxf(_terrain_vpos, _params.rng_gnd_clearance + _state.pos(2));\n\tconst float pred_hagl = _terrain_vpos - _state.pos(2);\n\n\t\/\/ Calculate observation matrix for flow around the vehicle x axis\n\tconst float Hx = vel_body(1) * t0 \/ (pred_hagl * pred_hagl);\n\n\t\/\/ Constrain terrain variance to be non-negative\n\t_terrain_var = fmaxf(_terrain_var, 0.0f);\n\n\t\/\/ Cacluate innovation variance\n\t_flow_innov_var[0] = Hx * Hx * _terrain_var + R_LOS;\n\n\t\/\/ calculate the kalman gain for the flow x measurement\n\tconst float Kx = _terrain_var * Hx \/ _flow_innov_var[0];\n\n\t\/\/ calculate prediced optical flow about x axis\n\tconst float pred_flow_x = vel_body(1) * earth_to_body(2, 2) \/ pred_hagl;\n\n\t\/\/ calculate flow innovation (x axis)\n\t_flow_innov[0] = pred_flow_x - opt_flow_rate(0);\n\n\t\/\/ calculate correction term for terrain variance\n\tconst float KxHxP =  Kx * Hx * _terrain_var;\n\n\t\/\/ innovation consistency check\n\tconst float gate_size = fmaxf(_params.flow_innov_gate, 1.0f);\n\tfloat flow_test_ratio = sq(_flow_innov[0]) \/ (sq(gate_size) * _flow_innov_var[0]);\n\n\t\/\/ do not perform measurement update if badly conditioned\n\tif (flow_test_ratio <= 1.0f) {\n\t\t_terrain_vpos += Kx * _flow_innov[0];\n\t\t\/\/ guard against negative variance\n\t\t_terrain_var = fmaxf(_terrain_var - KxHxP, 0.0f);\n\t\t_time_last_of_fuse = _time_last_imu;\n\t}\n\n\t\/\/ Calculate observation matrix for flow around the vehicle y axis\n\tconst float Hy = -vel_body(0) * t0 \/ (pred_hagl * pred_hagl);\n\n\t\/\/ Calculuate innovation variance\n\t_flow_innov_var[1] = Hy * Hy * _terrain_var + R_LOS;\n\n\t\/\/ calculate the kalman gain for the flow y measurement\n\tconst float Ky = _terrain_var * Hy \/ _flow_innov_var[1];\n\n\t\/\/ calculate prediced optical flow about y axis\n\tconst float pred_flow_y = -vel_body(0) * earth_to_body(2, 2) \/ pred_hagl;\n\n\t\/\/ calculate flow innovation (y axis)\n\t_flow_innov[1] = pred_flow_y - opt_flow_rate(1);\n\n\t\/\/ calculate correction term for terrain variance\n\tconst float KyHyP =  Ky * Hy * _terrain_var;\n\n\t\/\/ innovation consistency check\n\tflow_test_ratio = sq(_flow_innov[1]) \/ (sq(gate_size) * _flow_innov_var[1]);\n\n\tif (flow_test_ratio <= 1.0f) {\n\t\t_terrain_vpos += Ky * _flow_innov[1];\n\t\t\/\/ guard against negative variance\n\t\t_terrain_var = fmaxf(_terrain_var - KyHyP, 0.0f);\n\t\t_time_last_of_fuse = _time_last_imu;\n\t}\n}\n\nbool Ekf::isTerrainEstimateValid() const\n{\n\treturn _hagl_valid;\n}\n\nvoid Ekf::updateTerrainValidity()\n{\n\t\/\/ we have been fusing range finder measurements in the last 5 seconds\n\tconst bool recent_range_fusion = isRecent(_time_last_hagl_fuse, (uint64_t)5e6);\n\n\t\/\/ we have been fusing optical flow measurements for terrain estimation within the last 5 seconds\n\t\/\/ this can only be the case if the main filter does not fuse optical flow\n\tconst bool recent_flow_for_terrain_fusion = isRecent(_time_last_of_fuse, (uint64_t)5e6)\n\t\t\t\t\t\t    && !_control_status.flags.opt_flow;\n\n\t_hagl_valid = (_terrain_initialised && (recent_range_fusion || recent_flow_for_terrain_fusion));\n}\n\n\/\/ get the estimated vertical position of the terrain relative to the NED origin\nfloat Ekf::getTerrainVertPos() const\n{\n\treturn _terrain_vpos;\n}\n<commit_msg>terrain_estimator: initialize with valid delayed measurement<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2015 Estimation and Control Library (ECL). 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 ECL 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 terrain_estimator.cpp\n * Function for fusing rangefinder measurements to estimate terrain vertical position\/\n *\n * @author Paul Riseborough <p_riseborough@live.com.au>\n *\n *\/\n\n#include \"ekf.h\"\n#include <ecl.h>\n#include <mathlib\/mathlib.h>\n\nbool Ekf::initHagl()\n{\n\tbool initialized = false;\n\n\tif (!_control_status.flags.in_air) {\n\t\t\/\/ if on ground, do not trust the range sensor, but assume a ground clearance\n\t\t_terrain_vpos = _state.pos(2) + _params.rng_gnd_clearance;\n\t\t\/\/ use the ground clearance value as our uncertainty\n\t\t_terrain_var = sq(_params.rng_gnd_clearance);\n\t\tinitialized = true;\n\n\t} else if ((_params.terrain_fusion_mode & TerrainFusionMask::TerrainFuseRangeFinder)\n\t\t   && _range_sensor.isDataHealthy()) {\n\t\t\/\/ if we have a fresh measurement, use it to initialise the terrain estimator\n\t\t_terrain_vpos = _state.pos(2) + _range_sensor.getRange() * _range_sensor.getCosTilt();\n\t\t\/\/ initialise state variance to variance of measurement\n\t\t_terrain_var = sq(_params.range_noise);\n\t\t\/\/ success\n\t\tinitialized = true;\n\n\t} else if ((_params.terrain_fusion_mode & TerrainFusionMask::TerrainFuseOpticalFlow)\n\t\t   && _flow_for_terrain_data_ready) {\n\t\t\/\/ initialise terrain vertical position to origin as this is the best guess we have\n\t\t_terrain_vpos = fmaxf(0.0f,  _state.pos(2));\n\t\t_terrain_var = 100.0f;\n\t\tinitialized = true;\n\n\t} else {\n\t\t\/\/ no information - cannot initialise\n\t}\n\n\tif (initialized) {\n\t\t\/\/ has initialized with valid data\n\t\t_time_last_hagl_fuse = _time_last_imu;\n\t}\n\n\treturn initialized;\n}\n\nvoid Ekf::runTerrainEstimator()\n{\n\t\/\/ If we are on ground, store the local position and time to use as a reference\n\tif (!_control_status.flags.in_air) {\n\t\t_last_on_ground_posD = _state.pos(2);\n\t}\n\n\t\/\/ Perform initialisation check and\n\t\/\/ on ground, continuously reset the terrain estimator\n\tif (!_terrain_initialised || !_control_status.flags.in_air) {\n\t\t_terrain_initialised = initHagl();\n\n\t} else {\n\n\t\t\/\/ predict the state variance growth where the state is the vertical position of the terrain underneath the vehicle\n\n\t\t\/\/ process noise due to errors in vehicle height estimate\n\t\t_terrain_var += sq(_imu_sample_delayed.delta_vel_dt * _params.terrain_p_noise);\n\n\t\t\/\/ process noise due to terrain gradient\n\t\t_terrain_var += sq(_imu_sample_delayed.delta_vel_dt * _params.terrain_gradient)\n\t\t\t\t* (sq(_state.vel(0)) + sq(_state.vel(1)));\n\n\t\t\/\/ limit the variance to prevent it becoming badly conditioned\n\t\t_terrain_var = math::constrain(_terrain_var, 0.0f, 1e4f);\n\n\t\t\/\/ Fuse range finder data if available\n\t\tif (_range_sensor.isDataHealthy()) {\n\t\t\tfuseHagl();\n\t\t}\n\n\t\tif (_flow_for_terrain_data_ready) {\n\t\t\tfuseFlowForTerrain();\n\t\t\t_flow_for_terrain_data_ready = false;\n\t\t}\n\n\t\t\/\/ constrain _terrain_vpos to be a minimum of _params.rng_gnd_clearance larger than _state.pos(2)\n\t\tif (_terrain_vpos - _state.pos(2) < _params.rng_gnd_clearance) {\n\t\t\t_terrain_vpos = _params.rng_gnd_clearance + _state.pos(2);\n\t\t}\n\t}\n\n\tupdateTerrainValidity();\n}\n\nvoid Ekf::fuseHagl()\n{\n\t\/\/ get a height above ground measurement from the range finder assuming a flat earth\n\tconst float meas_hagl = _range_sensor.getRange() * _range_sensor.getCosTilt();\n\n\t\/\/ predict the hagl from the vehicle position and terrain height\n\tconst float pred_hagl = _terrain_vpos - _state.pos(2);\n\n\t\/\/ calculate the innovation\n\t_hagl_innov = pred_hagl - meas_hagl;\n\n\t\/\/ calculate the observation variance adding the variance of the vehicles own height uncertainty\n\tconst float obs_variance = fmaxf(P(9,9) * _params.vehicle_variance_scaler, 0.0f)\n\t\t\t     + sq(_params.range_noise)\n\t\t\t     + sq(_params.range_noise_scaler * _range_sensor.getRange());\n\n\t\/\/ calculate the innovation variance - limiting it to prevent a badly conditioned fusion\n\t_hagl_innov_var = fmaxf(_terrain_var + obs_variance, obs_variance);\n\n\t\/\/ perform an innovation consistency check and only fuse data if it passes\n\tconst float gate_size = fmaxf(_params.range_innov_gate, 1.0f);\n\t_hagl_test_ratio = sq(_hagl_innov) \/ (sq(gate_size) * _hagl_innov_var);\n\n\tif (_hagl_test_ratio <= 1.0f) {\n\t\t\/\/ calculate the Kalman gain\n\t\tfloat gain = _terrain_var \/ _hagl_innov_var;\n\t\t\/\/ correct the state\n\t\t_terrain_vpos -= gain * _hagl_innov;\n\t\t\/\/ correct the variance\n\t\t_terrain_var = fmaxf(_terrain_var * (1.0f - gain), 0.0f);\n\t\t\/\/ record last successful fusion event\n\t\t_time_last_hagl_fuse = _time_last_imu;\n\t\t_innov_check_fail_status.flags.reject_hagl = false;\n\n\t} else {\n\t\t\/\/ If we have been rejecting range data for too long, reset to measurement\n\t\tif (isTimedOut(_time_last_hagl_fuse, (uint64_t)10E6)) {\n\t\t\t_terrain_vpos = _state.pos(2) + meas_hagl;\n\t\t\t_terrain_var = obs_variance;\n\n\t\t} else {\n\t\t\t_innov_check_fail_status.flags.reject_hagl = true;\n\t\t}\n\t}\n}\n\nvoid Ekf::fuseFlowForTerrain()\n{\n\t\/\/ calculate optical LOS rates using optical flow rates that have had the body angular rate contribution removed\n\t\/\/ correct for gyro bias errors in the data used to do the motion compensation\n\t\/\/ Note the sign convention used: A positive LOS rate is a RH rotation of the scene about that axis.\n\tconst Vector2f opt_flow_rate = Vector2f{_flow_compensated_XY_rad} \/ _flow_sample_delayed.dt + Vector2f{_flow_gyro_bias};\n\n\t\/\/ get latest estimated orientation\n\tconst float q0 = _state.quat_nominal(0);\n\tconst float q1 = _state.quat_nominal(1);\n\tconst float q2 = _state.quat_nominal(2);\n\tconst float q3 = _state.quat_nominal(3);\n\n\t\/\/ calculate the optical flow observation variance\n\tconst float R_LOS = calcOptFlowMeasVar();\n\n\t\/\/ get rotation matrix from earth to body\n\tconst Dcmf earth_to_body = quat_to_invrotmat(_state.quat_nominal);\n\n\t\/\/ calculate the sensor position relative to the IMU\n\tconst Vector3f pos_offset_body = _params.flow_pos_body - _params.imu_pos_body;\n\n\t\/\/ calculate the velocity of the sensor relative to the imu in body frame\n\t\/\/ Note: _flow_sample_delayed.gyro_xyz is the negative of the body angular velocity, thus use minus sign\n\tconst Vector3f vel_rel_imu_body = Vector3f(-_flow_sample_delayed.gyro_xyz \/ _flow_sample_delayed.dt) % pos_offset_body;\n\n\t\/\/ calculate the velocity of the sensor in the earth frame\n\tconst Vector3f vel_rel_earth = _state.vel + _R_to_earth * vel_rel_imu_body;\n\n\t\/\/ rotate into body frame\n\tconst Vector3f vel_body = earth_to_body * vel_rel_earth;\n\n\tconst float t0 = q0 * q0 - q1 * q1 - q2 * q2 + q3 * q3;\n\n\t\/\/ constrain terrain to minimum allowed value and predict height above ground\n\t_terrain_vpos = fmaxf(_terrain_vpos, _params.rng_gnd_clearance + _state.pos(2));\n\tconst float pred_hagl = _terrain_vpos - _state.pos(2);\n\n\t\/\/ Calculate observation matrix for flow around the vehicle x axis\n\tconst float Hx = vel_body(1) * t0 \/ (pred_hagl * pred_hagl);\n\n\t\/\/ Constrain terrain variance to be non-negative\n\t_terrain_var = fmaxf(_terrain_var, 0.0f);\n\n\t\/\/ Cacluate innovation variance\n\t_flow_innov_var[0] = Hx * Hx * _terrain_var + R_LOS;\n\n\t\/\/ calculate the kalman gain for the flow x measurement\n\tconst float Kx = _terrain_var * Hx \/ _flow_innov_var[0];\n\n\t\/\/ calculate prediced optical flow about x axis\n\tconst float pred_flow_x = vel_body(1) * earth_to_body(2, 2) \/ pred_hagl;\n\n\t\/\/ calculate flow innovation (x axis)\n\t_flow_innov[0] = pred_flow_x - opt_flow_rate(0);\n\n\t\/\/ calculate correction term for terrain variance\n\tconst float KxHxP =  Kx * Hx * _terrain_var;\n\n\t\/\/ innovation consistency check\n\tconst float gate_size = fmaxf(_params.flow_innov_gate, 1.0f);\n\tfloat flow_test_ratio = sq(_flow_innov[0]) \/ (sq(gate_size) * _flow_innov_var[0]);\n\n\t\/\/ do not perform measurement update if badly conditioned\n\tif (flow_test_ratio <= 1.0f) {\n\t\t_terrain_vpos += Kx * _flow_innov[0];\n\t\t\/\/ guard against negative variance\n\t\t_terrain_var = fmaxf(_terrain_var - KxHxP, 0.0f);\n\t\t_time_last_of_fuse = _time_last_imu;\n\t}\n\n\t\/\/ Calculate observation matrix for flow around the vehicle y axis\n\tconst float Hy = -vel_body(0) * t0 \/ (pred_hagl * pred_hagl);\n\n\t\/\/ Calculuate innovation variance\n\t_flow_innov_var[1] = Hy * Hy * _terrain_var + R_LOS;\n\n\t\/\/ calculate the kalman gain for the flow y measurement\n\tconst float Ky = _terrain_var * Hy \/ _flow_innov_var[1];\n\n\t\/\/ calculate prediced optical flow about y axis\n\tconst float pred_flow_y = -vel_body(0) * earth_to_body(2, 2) \/ pred_hagl;\n\n\t\/\/ calculate flow innovation (y axis)\n\t_flow_innov[1] = pred_flow_y - opt_flow_rate(1);\n\n\t\/\/ calculate correction term for terrain variance\n\tconst float KyHyP =  Ky * Hy * _terrain_var;\n\n\t\/\/ innovation consistency check\n\tflow_test_ratio = sq(_flow_innov[1]) \/ (sq(gate_size) * _flow_innov_var[1]);\n\n\tif (flow_test_ratio <= 1.0f) {\n\t\t_terrain_vpos += Ky * _flow_innov[1];\n\t\t\/\/ guard against negative variance\n\t\t_terrain_var = fmaxf(_terrain_var - KyHyP, 0.0f);\n\t\t_time_last_of_fuse = _time_last_imu;\n\t}\n}\n\nbool Ekf::isTerrainEstimateValid() const\n{\n\treturn _hagl_valid;\n}\n\nvoid Ekf::updateTerrainValidity()\n{\n\t\/\/ we have been fusing range finder measurements in the last 5 seconds\n\tconst bool recent_range_fusion = isRecent(_time_last_hagl_fuse, (uint64_t)5e6);\n\n\t\/\/ we have been fusing optical flow measurements for terrain estimation within the last 5 seconds\n\t\/\/ this can only be the case if the main filter does not fuse optical flow\n\tconst bool recent_flow_for_terrain_fusion = isRecent(_time_last_of_fuse, (uint64_t)5e6)\n\t\t\t\t\t\t    && !_control_status.flags.opt_flow;\n\n\t_hagl_valid = (_terrain_initialised && (recent_range_fusion || recent_flow_for_terrain_fusion));\n}\n\n\/\/ get the estimated vertical position of the terrain relative to the NED origin\nfloat Ekf::getTerrainVertPos() const\n{\n\treturn _terrain_vpos;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010, Lawrence Livermore National Security, LLC. Produced at\n\/\/ the Lawrence Livermore National Laboratory. LLNL-CODE-443211. All Rights\n\/\/ reserved. See file COPYRIGHT for details.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability see http:\/\/mfem.org.\n\/\/\n\/\/ MFEM 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) version 2.1 dated February 1999.\n\n#ifndef MFEM_PNONLINEARFORM\n#define MFEM_PNONLINEARFORM\n\n#include \"..\/config\/config.hpp\"\n\n#ifdef MFEM_USE_MPI\n\n#include \"pgridfunc.hpp\"\n#include \"nonlinearform.hpp\"\n\nnamespace mfem\n{\n\n\/\/\/ Parallel non-linear operator on the true dofs\nclass ParNonlinearForm : public NonlinearForm\n{\nprotected:\n   mutable ParGridFunction X, Y;\n   mutable OperatorHandle pGrad;\n\npublic:\n   ParNonlinearForm(ParFiniteElementSpace *pf);\n\n   ParFiniteElementSpace *ParFESpace() const\n   { return (ParFiniteElementSpace *)fes; }\n\n   \/\/\/ Compute the enery corresponding to the state @a x.\n   \/** In general, @a x may have non-homogeneous essential boundary values.\n\n       The state @a x must be a \"GridFunction size\" vector, i.e. its size must\n       be fes->GetVSize(). *\/\n   double GetParGridFunctionEnergy(const Vector &x) const;\n\n   \/\/\/ Compute the energy of a ParGridFunction\n   double GetEnergy(const ParGridFunction &x) const\n   { return GetParGridFunctionEnergy(x); }\n\n   virtual double GetEnergy(const Vector &x) const\n   { return GetParGridFunctionEnergy(Prolongate(x)); }\n\n   virtual void Mult(const Vector &x, Vector &y) const;\n\n   \/\/\/ Return the local gradient matrix for the given true-dof vector x.\n   \/** The returned matrix does NOT have any boundary conditions imposed. *\/\n   const SparseMatrix &GetLocalGradient(const Vector &x) const;\n\n   virtual Operator &GetGradient(const Vector &x) const;\n\n   \/\/\/ Set the operator type id for the parallel gradient matrix\/operator.\n   void SetGradientType(Operator::Type tid) { pGrad.SetType(tid); }\n\n   \/** @brief Update the ParNonlinearForm to propagate updates of the associated\n       parallel FE space. *\/\n   \/** After calling this method, the essential boundary conditions need to be\n       set again. *\/\n   virtual void Update();\n\n   virtual ~ParNonlinearForm() { }\n};\n\n}\n\n#endif \/\/ MFEM_USE_MPI\n\n#endif\n<commit_msg>Typo.<commit_after>\/\/ Copyright (c) 2010, Lawrence Livermore National Security, LLC. Produced at\n\/\/ the Lawrence Livermore National Laboratory. LLNL-CODE-443211. All Rights\n\/\/ reserved. See file COPYRIGHT for details.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability see http:\/\/mfem.org.\n\/\/\n\/\/ MFEM 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) version 2.1 dated February 1999.\n\n#ifndef MFEM_PNONLINEARFORM\n#define MFEM_PNONLINEARFORM\n\n#include \"..\/config\/config.hpp\"\n\n#ifdef MFEM_USE_MPI\n\n#include \"pgridfunc.hpp\"\n#include \"nonlinearform.hpp\"\n\nnamespace mfem\n{\n\n\/\/\/ Parallel non-linear operator on the true dofs\nclass ParNonlinearForm : public NonlinearForm\n{\nprotected:\n   mutable ParGridFunction X, Y;\n   mutable OperatorHandle pGrad;\n\npublic:\n   ParNonlinearForm(ParFiniteElementSpace *pf);\n\n   ParFiniteElementSpace *ParFESpace() const\n   { return (ParFiniteElementSpace *)fes; }\n\n   \/\/\/ Compute the energy corresponding to the state @a x.\n   \/** In general, @a x may have non-homogeneous essential boundary values.\n\n       The state @a x must be a \"GridFunction size\" vector, i.e. its size must\n       be fes->GetVSize(). *\/\n   double GetParGridFunctionEnergy(const Vector &x) const;\n\n   \/\/\/ Compute the energy of a ParGridFunction\n   double GetEnergy(const ParGridFunction &x) const\n   { return GetParGridFunctionEnergy(x); }\n\n   virtual double GetEnergy(const Vector &x) const\n   { return GetParGridFunctionEnergy(Prolongate(x)); }\n\n   virtual void Mult(const Vector &x, Vector &y) const;\n\n   \/\/\/ Return the local gradient matrix for the given true-dof vector x.\n   \/** The returned matrix does NOT have any boundary conditions imposed. *\/\n   const SparseMatrix &GetLocalGradient(const Vector &x) const;\n\n   virtual Operator &GetGradient(const Vector &x) const;\n\n   \/\/\/ Set the operator type id for the parallel gradient matrix\/operator.\n   void SetGradientType(Operator::Type tid) { pGrad.SetType(tid); }\n\n   \/** @brief Update the ParNonlinearForm to propagate updates of the associated\n       parallel FE space. *\/\n   \/** After calling this method, the essential boundary conditions need to be\n       set again. *\/\n   virtual void Update();\n\n   virtual ~ParNonlinearForm() { }\n};\n\n}\n\n#endif \/\/ MFEM_USE_MPI\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- SyntheticSections.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\/\/ This file contains linker-synthesized sections. Currently,\n\/\/ synthetic sections are created either output sections or input sections,\n\/\/ but we are rewriting code so that all synthetic sections are created as\n\/\/ input sections.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"SyntheticSections.h\"\n#include \"Config.h\"\n#include \"Error.h\"\n#include \"InputFiles.h\"\n#include \"Memory.h\"\n#include \"OutputSections.h\"\n#include \"Strings.h\"\n#include \"SymbolTable.h\"\n\n#include \"lld\/Core\/Parallel.h\"\n#include \"llvm\/Support\/Endian.h\"\n#include \"llvm\/Support\/MD5.h\"\n#include \"llvm\/Support\/RandomNumberGenerator.h\"\n#include \"llvm\/Support\/SHA1.h\"\n#include \"llvm\/Support\/xxhash.h\"\n\nusing namespace llvm;\nusing namespace llvm::ELF;\nusing namespace llvm::object;\nusing namespace llvm::support;\nusing namespace llvm::support::endian;\n\nusing namespace lld;\nusing namespace lld::elf;\n\ntemplate <class ELFT> static std::vector<DefinedCommon *> getCommonSymbols() {\n  std::vector<DefinedCommon *> V;\n  for (Symbol *S : Symtab<ELFT>::X->getSymbols())\n    if (auto *B = dyn_cast<DefinedCommon>(S->body()))\n      V.push_back(B);\n  return V;\n}\n\n\/\/ Find all common symbols and allocate space for them.\ntemplate <class ELFT>\nCommonSection<ELFT>::CommonSection()\n    : InputSection<ELFT>(SHF_ALLOC | SHF_WRITE, SHT_NOBITS, 1,\n                         ArrayRef<uint8_t>(), \"COMMON\") {\n  this->Live = true;\n\n  \/\/ Sort the common symbols by alignment as an heuristic to pack them better.\n  std::vector<DefinedCommon *> Syms = getCommonSymbols<ELFT>();\n  std::stable_sort(Syms.begin(), Syms.end(),\n                   [](const DefinedCommon *A, const DefinedCommon *B) {\n                     return A->Alignment > B->Alignment;\n                   });\n\n  \/\/ Assign offsets to symbols.\n  size_t Size = 0;\n  size_t Alignment = 1;\n  for (DefinedCommon *Sym : Syms) {\n    Alignment = std::max<size_t>(Alignment, Sym->Alignment);\n    Size = alignTo(Size, Sym->Alignment);\n\n    \/\/ Compute symbol offset relative to beginning of input section.\n    Sym->Offset = Size;\n    Size += Sym->Size;\n  }\n  this->Alignment = Alignment;\n  this->Data = makeArrayRef<uint8_t>(nullptr, Size);\n}\n\nstatic ArrayRef<uint8_t> createInterp() {\n  \/\/ StringSaver guarantees that the returned string ends with '\\0'.\n  StringRef S = Saver.save(Config->DynamicLinker);\n  return {(const uint8_t *)S.data(), S.size() + 1};\n}\n\ntemplate <class ELFT>\nInterpSection<ELFT>::InterpSection()\n    : InputSection<ELFT>(SHF_ALLOC, SHT_PROGBITS, 1, createInterp(),\n                         \".interp\") {\n  this->Live = true;\n}\n\ntemplate <class ELFT>\nBuildIdSection<ELFT>::BuildIdSection(size_t HashSize)\n    : InputSection<ELFT>(SHF_ALLOC, SHT_NOTE, 1, ArrayRef<uint8_t>(),\n                         \".note.gnu.build-id\"),\n      HashSize(HashSize) {\n  this->Live = true;\n\n  Buf.resize(16 + HashSize);\n  const endianness E = ELFT::TargetEndianness;\n  write32<E>(Buf.data(), 4);                   \/\/ Name size\n  write32<E>(Buf.data() + 4, HashSize);        \/\/ Content size\n  write32<E>(Buf.data() + 8, NT_GNU_BUILD_ID); \/\/ Type\n  memcpy(Buf.data() + 12, \"GNU\", 4);           \/\/ Name string\n  this->Data = ArrayRef<uint8_t>(Buf);\n}\n\ntemplate <class ELFT>\nuint8_t *BuildIdSection<ELFT>::getOutputLoc(uint8_t *Start) const {\n  return Start + this->OutSec->getFileOffset() + this->OutSecOff;\n}\n\nstatic std::vector<ArrayRef<uint8_t>> split(ArrayRef<uint8_t> Arr,\n                                            size_t ChunkSize) {\n  std::vector<ArrayRef<uint8_t>> Ret;\n  while (Arr.size() > ChunkSize) {\n    Ret.push_back(Arr.take_front(ChunkSize));\n    Arr = Arr.drop_front(ChunkSize);\n  }\n  if (!Arr.empty())\n    Ret.push_back(Arr);\n  return Ret;\n}\n\ntemplate <class ELFT>\nvoid BuildIdSection<ELFT>::computeHash(\n    llvm::ArrayRef<uint8_t> Data,\n    std::function<void(ArrayRef<uint8_t> Arr, uint8_t *Hash)> Hash) {\n  std::vector<ArrayRef<uint8_t>> Chunks = split(Data, 1024 * 1024);\n  std::vector<uint8_t> HashList(Chunks.size() * HashSize);\n\n  if (Config->Threads)\n    parallel_for_each(Chunks.begin(), Chunks.end(),\n                      [&](ArrayRef<uint8_t> &Chunk) {\n                        size_t Id = &Chunk - Chunks.data();\n                        Hash(Chunk, HashList.data() + Id * HashSize);\n                      });\n  else\n    std::for_each(Chunks.begin(), Chunks.end(), [&](ArrayRef<uint8_t> &Chunk) {\n      size_t Id = &Chunk - Chunks.data();\n      Hash(Chunk, HashList.data() + Id * HashSize);\n    });\n\n  Hash(HashList, this->getOutputLoc((uint8_t *)Data.begin()) + 16);\n}\n\ntemplate <class ELFT>\nvoid BuildIdFastHash<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  computeHash(Buf, [](ArrayRef<uint8_t> Arr, uint8_t *Dest) {\n    uint64_t Hash = xxHash64(toStringRef(Arr));\n    write64<ELFT::TargetEndianness>(Dest, Hash);\n  });\n}\n\ntemplate <class ELFT>\nvoid BuildIdMd5<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  computeHash(Buf, [&](ArrayRef<uint8_t> Arr, uint8_t *Dest) {\n    MD5 Hash;\n    Hash.update(Arr);\n    MD5::MD5Result Res;\n    Hash.final(Res);\n    memcpy(Dest, Res, HashSize);\n  });\n}\n\ntemplate <class ELFT>\nvoid BuildIdSha1<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  computeHash(Buf, [&](ArrayRef<uint8_t> Arr, uint8_t *Dest) {\n    SHA1 Hash;\n    Hash.update(Arr);\n    memcpy(Dest, Hash.final().data(), HashSize);\n  });\n}\n\ntemplate <class ELFT>\nvoid BuildIdUuid<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  if (getRandomBytes(this->getOutputLoc(Buf.begin()) + 16, 16))\n    error(\"entropy source failure\");\n}\n\ntemplate <class ELFT>\nBuildIdHexstring<ELFT>::BuildIdHexstring()\n    : BuildIdSection<ELFT>(Config->BuildIdVector.size()) {}\n\ntemplate <class ELFT>\nvoid BuildIdHexstring<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  memcpy(this->getOutputLoc(Buf.begin()) + 16, Config->BuildIdVector.data(),\n         Config->BuildIdVector.size());\n}\n\ntemplate class elf::CommonSection<ELF32LE>;\ntemplate class elf::CommonSection<ELF32BE>;\ntemplate class elf::CommonSection<ELF64LE>;\ntemplate class elf::CommonSection<ELF64BE>;\n\ntemplate class elf::InterpSection<ELF32LE>;\ntemplate class elf::InterpSection<ELF32BE>;\ntemplate class elf::InterpSection<ELF64LE>;\ntemplate class elf::InterpSection<ELF64BE>;\n\ntemplate class elf::BuildIdSection<ELF32LE>;\ntemplate class elf::BuildIdSection<ELF32BE>;\ntemplate class elf::BuildIdSection<ELF64LE>;\ntemplate class elf::BuildIdSection<ELF64BE>;\n\ntemplate class elf::BuildIdFastHash<ELF32LE>;\ntemplate class elf::BuildIdFastHash<ELF32BE>;\ntemplate class elf::BuildIdFastHash<ELF64LE>;\ntemplate class elf::BuildIdFastHash<ELF64BE>;\n\ntemplate class elf::BuildIdMd5<ELF32LE>;\ntemplate class elf::BuildIdMd5<ELF32BE>;\ntemplate class elf::BuildIdMd5<ELF64LE>;\ntemplate class elf::BuildIdMd5<ELF64BE>;\n\ntemplate class elf::BuildIdSha1<ELF32LE>;\ntemplate class elf::BuildIdSha1<ELF32BE>;\ntemplate class elf::BuildIdSha1<ELF64LE>;\ntemplate class elf::BuildIdSha1<ELF64BE>;\n\ntemplate class elf::BuildIdUuid<ELF32LE>;\ntemplate class elf::BuildIdUuid<ELF32BE>;\ntemplate class elf::BuildIdUuid<ELF64LE>;\ntemplate class elf::BuildIdUuid<ELF64BE>;\n\ntemplate class elf::BuildIdHexstring<ELF32LE>;\ntemplate class elf::BuildIdHexstring<ELF32BE>;\ntemplate class elf::BuildIdHexstring<ELF64LE>;\ntemplate class elf::BuildIdHexstring<ELF64BE>;\n<commit_msg>[ELF] - Fix linux BB after r286061.<commit_after>\/\/===- SyntheticSections.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\/\/ This file contains linker-synthesized sections. Currently,\n\/\/ synthetic sections are created either output sections or input sections,\n\/\/ but we are rewriting code so that all synthetic sections are created as\n\/\/ input sections.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"SyntheticSections.h\"\n#include \"Config.h\"\n#include \"Error.h\"\n#include \"InputFiles.h\"\n#include \"Memory.h\"\n#include \"OutputSections.h\"\n#include \"Strings.h\"\n#include \"SymbolTable.h\"\n\n#include \"lld\/Core\/Parallel.h\"\n#include \"llvm\/Support\/Endian.h\"\n#include \"llvm\/Support\/MD5.h\"\n#include \"llvm\/Support\/RandomNumberGenerator.h\"\n#include \"llvm\/Support\/SHA1.h\"\n#include \"llvm\/Support\/xxhash.h\"\n\nusing namespace llvm;\nusing namespace llvm::ELF;\nusing namespace llvm::object;\nusing namespace llvm::support;\nusing namespace llvm::support::endian;\n\nusing namespace lld;\nusing namespace lld::elf;\n\ntemplate <class ELFT> static std::vector<DefinedCommon *> getCommonSymbols() {\n  std::vector<DefinedCommon *> V;\n  for (Symbol *S : Symtab<ELFT>::X->getSymbols())\n    if (auto *B = dyn_cast<DefinedCommon>(S->body()))\n      V.push_back(B);\n  return V;\n}\n\n\/\/ Find all common symbols and allocate space for them.\ntemplate <class ELFT>\nCommonSection<ELFT>::CommonSection()\n    : InputSection<ELFT>(SHF_ALLOC | SHF_WRITE, SHT_NOBITS, 1,\n                         ArrayRef<uint8_t>(), \"COMMON\") {\n  this->Live = true;\n\n  \/\/ Sort the common symbols by alignment as an heuristic to pack them better.\n  std::vector<DefinedCommon *> Syms = getCommonSymbols<ELFT>();\n  std::stable_sort(Syms.begin(), Syms.end(),\n                   [](const DefinedCommon *A, const DefinedCommon *B) {\n                     return A->Alignment > B->Alignment;\n                   });\n\n  \/\/ Assign offsets to symbols.\n  size_t Size = 0;\n  size_t Alignment = 1;\n  for (DefinedCommon *Sym : Syms) {\n    Alignment = std::max<size_t>(Alignment, Sym->Alignment);\n    Size = alignTo(Size, Sym->Alignment);\n\n    \/\/ Compute symbol offset relative to beginning of input section.\n    Sym->Offset = Size;\n    Size += Sym->Size;\n  }\n  this->Alignment = Alignment;\n  this->Data = makeArrayRef<uint8_t>(nullptr, Size);\n}\n\nstatic ArrayRef<uint8_t> createInterp() {\n  \/\/ StringSaver guarantees that the returned string ends with '\\0'.\n  StringRef S = Saver.save(Config->DynamicLinker);\n  return {(const uint8_t *)S.data(), S.size() + 1};\n}\n\ntemplate <class ELFT>\nInterpSection<ELFT>::InterpSection()\n    : InputSection<ELFT>(SHF_ALLOC, SHT_PROGBITS, 1, createInterp(),\n                         \".interp\") {\n  this->Live = true;\n}\n\ntemplate <class ELFT>\nBuildIdSection<ELFT>::BuildIdSection(size_t HashSize)\n    : InputSection<ELFT>(SHF_ALLOC, SHT_NOTE, 1, ArrayRef<uint8_t>(),\n                         \".note.gnu.build-id\"),\n      HashSize(HashSize) {\n  this->Live = true;\n\n  Buf.resize(16 + HashSize);\n  const endianness E = ELFT::TargetEndianness;\n  write32<E>(Buf.data(), 4);                   \/\/ Name size\n  write32<E>(Buf.data() + 4, HashSize);        \/\/ Content size\n  write32<E>(Buf.data() + 8, NT_GNU_BUILD_ID); \/\/ Type\n  memcpy(Buf.data() + 12, \"GNU\", 4);           \/\/ Name string\n  this->Data = ArrayRef<uint8_t>(Buf);\n}\n\ntemplate <class ELFT>\nuint8_t *BuildIdSection<ELFT>::getOutputLoc(uint8_t *Start) const {\n  return Start + this->OutSec->getFileOffset() + this->OutSecOff;\n}\n\nstatic std::vector<ArrayRef<uint8_t>> split(ArrayRef<uint8_t> Arr,\n                                            size_t ChunkSize) {\n  std::vector<ArrayRef<uint8_t>> Ret;\n  while (Arr.size() > ChunkSize) {\n    Ret.push_back(Arr.take_front(ChunkSize));\n    Arr = Arr.drop_front(ChunkSize);\n  }\n  if (!Arr.empty())\n    Ret.push_back(Arr);\n  return Ret;\n}\n\ntemplate <class ELFT>\nvoid BuildIdSection<ELFT>::computeHash(\n    llvm::ArrayRef<uint8_t> Data,\n    std::function<void(ArrayRef<uint8_t> Arr, uint8_t *Hash)> Hash) {\n  std::vector<ArrayRef<uint8_t>> Chunks = split(Data, 1024 * 1024);\n  std::vector<uint8_t> HashList(Chunks.size() * HashSize);\n\n  if (Config->Threads)\n    parallel_for_each(Chunks.begin(), Chunks.end(),\n                      [&](ArrayRef<uint8_t> &Chunk) {\n                        size_t Id = &Chunk - Chunks.data();\n                        Hash(Chunk, HashList.data() + Id * HashSize);\n                      });\n  else\n    std::for_each(Chunks.begin(), Chunks.end(), [&](ArrayRef<uint8_t> &Chunk) {\n      size_t Id = &Chunk - Chunks.data();\n      Hash(Chunk, HashList.data() + Id * HashSize);\n    });\n\n  Hash(HashList, this->getOutputLoc((uint8_t *)Data.begin()) + 16);\n}\n\ntemplate <class ELFT>\nvoid BuildIdFastHash<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  this->computeHash(Buf, [](ArrayRef<uint8_t> Arr, uint8_t *Dest) {\n    uint64_t Hash = xxHash64(toStringRef(Arr));\n    write64<ELFT::TargetEndianness>(Dest, Hash);\n  });\n}\n\ntemplate <class ELFT>\nvoid BuildIdMd5<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  this->computeHash(Buf, [&](ArrayRef<uint8_t> Arr, uint8_t *Dest) {\n    MD5 Hash;\n    Hash.update(Arr);\n    MD5::MD5Result Res;\n    Hash.final(Res);\n    memcpy(Dest, Res, this->HashSize);\n  });\n}\n\ntemplate <class ELFT>\nvoid BuildIdSha1<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  this->computeHash(Buf, [&](ArrayRef<uint8_t> Arr, uint8_t *Dest) {\n    SHA1 Hash;\n    Hash.update(Arr);\n    memcpy(Dest, Hash.final().data(), this->HashSize);\n  });\n}\n\ntemplate <class ELFT>\nvoid BuildIdUuid<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  if (getRandomBytes(this->getOutputLoc(Buf.begin()) + 16, 16))\n    error(\"entropy source failure\");\n}\n\ntemplate <class ELFT>\nBuildIdHexstring<ELFT>::BuildIdHexstring()\n    : BuildIdSection<ELFT>(Config->BuildIdVector.size()) {}\n\ntemplate <class ELFT>\nvoid BuildIdHexstring<ELFT>::writeBuildId(MutableArrayRef<uint8_t> Buf) {\n  memcpy(this->getOutputLoc(Buf.begin()) + 16, Config->BuildIdVector.data(),\n         Config->BuildIdVector.size());\n}\n\ntemplate class elf::CommonSection<ELF32LE>;\ntemplate class elf::CommonSection<ELF32BE>;\ntemplate class elf::CommonSection<ELF64LE>;\ntemplate class elf::CommonSection<ELF64BE>;\n\ntemplate class elf::InterpSection<ELF32LE>;\ntemplate class elf::InterpSection<ELF32BE>;\ntemplate class elf::InterpSection<ELF64LE>;\ntemplate class elf::InterpSection<ELF64BE>;\n\ntemplate class elf::BuildIdSection<ELF32LE>;\ntemplate class elf::BuildIdSection<ELF32BE>;\ntemplate class elf::BuildIdSection<ELF64LE>;\ntemplate class elf::BuildIdSection<ELF64BE>;\n\ntemplate class elf::BuildIdFastHash<ELF32LE>;\ntemplate class elf::BuildIdFastHash<ELF32BE>;\ntemplate class elf::BuildIdFastHash<ELF64LE>;\ntemplate class elf::BuildIdFastHash<ELF64BE>;\n\ntemplate class elf::BuildIdMd5<ELF32LE>;\ntemplate class elf::BuildIdMd5<ELF32BE>;\ntemplate class elf::BuildIdMd5<ELF64LE>;\ntemplate class elf::BuildIdMd5<ELF64BE>;\n\ntemplate class elf::BuildIdSha1<ELF32LE>;\ntemplate class elf::BuildIdSha1<ELF32BE>;\ntemplate class elf::BuildIdSha1<ELF64LE>;\ntemplate class elf::BuildIdSha1<ELF64BE>;\n\ntemplate class elf::BuildIdUuid<ELF32LE>;\ntemplate class elf::BuildIdUuid<ELF32BE>;\ntemplate class elf::BuildIdUuid<ELF64LE>;\ntemplate class elf::BuildIdUuid<ELF64BE>;\n\ntemplate class elf::BuildIdHexstring<ELF32LE>;\ntemplate class elf::BuildIdHexstring<ELF32BE>;\ntemplate class elf::BuildIdHexstring<ELF64LE>;\ntemplate class elf::BuildIdHexstring<ELF64BE>;\n<|endoftext|>"}
{"text":"<commit_before>#include \"NLTProjector.h\"\n#include \"ReveManager.h\"\n#include \"NLTBases.h\"\n\n#include \"TBuffer3D.h\"\n#include \"TBuffer3DTypes.h\"\n#include <TVirtualPad.h>\n#include <TVirtualViewer3D.h>\n\n#include <list>\n\nusing namespace Reve;\n\nClassImp(Reve::NLTProjection)\n\nFloat_t NLTProjection::fgEps = 0.005f;\n \nNLTProjection::NLTProjection(Vector& center) : \n  fType(PT_Unknown),\n  fGeoMode(GM_Unknown),\n  fName(0),\n  fCenter(center.x, center.y, center.z),\n  fDistortion(0.0f), \n  fFixedRadius(300), \n  fScale(1.0f)\n{}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::ProjectVector(Vector& v)\n{\n  ProjectPoint(v.x, v.y, v.z);\n}\n\n\/\/______________________________________________________________________________\nVector* NLTProjection::Project(Vector* origPnts, Int_t Npnts, Bool_t copy)\n{\n  Vector* pnts = 0; \n  if(copy) \n  {\n    pnts = new Vector[Npnts];\n    memcpy(pnts, origPnts, Npnts*sizeof(Vector));\n  }\n  else\n  { \n    pnts =  origPnts;\n  }\n\n  for(Int_t i = 0; i<Npnts; i++)\n  {\n    ProjectPoint(pnts[i].x, pnts[i].y, pnts[i].z);\n  }\n  return pnts;\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::UpdateLimit()\n{\n  if ( fDistortion == 0.0f )\n    return;\n \n  Float_t lim =  1.0f\/fDistortion + fFixedRadius;\n  Float_t* c = GetProjectedCenter();\n  fUpLimit.Set(lim + c[0], lim + c[1], c[2]);\n  fLowLimit.Set(-lim + c[0], -lim + c[1], c[2]);\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::SetDistortion(Float_t d)\n{\n  \/\/ Prevent scaling down whole projected scene.\n  \/\/ Point at fixe distance shold be on constant screen coorinate. \n\n  fDistortion=d; \n  fScale = 1+fFixedRadius*fDistortion;\n  UpdateLimit();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::SetFixedRadius(Float_t r)\n{\n\n  fFixedRadius=r;\n  fScale = 1+fFixedRadius*fDistortion;\n  UpdateLimit();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::SetDirectionalVector(Int_t screenAxis, Vector& vec)\n{\n  for(Int_t i=0; i<3; i++)\n  {\n    vec[i] = (i==screenAxis) ? 1. : 0.;\n  }\n}\n\n\/\/______________________________________________________________________________\nFloat_t NLTProjection::GetValForScreenPos(Int_t i, Float_t sv)\n{\n  \/\/ move on unprojected axis, find when projected value is geiven screen values(sv)\n  static const Exc_t eH(\"NLTProjector::GetValForScreenPos \");\n\n  Float_t xL, xM, xR;\n  Vector V, DirVec;\n  SetDirectionalVector(i, DirVec);\n  if((sv > 0 && sv > fUpLimit[i]) || (sv < 0 && sv < fLowLimit[i]) )\n    throw(eH + Form(\"screen value '%f' out of limit '%f'.\", sv, sv > 0 ? fUpLimit[i] : fLowLimit[i]));\n\n  Vector zero; ProjectVector(zero);\n  \/\/ printf(\"NLTProjection::GetValForScreenPos %d sv %f , zero %f\\n\",i,  sv, zero[i]);\n  \/\/ search from -\/+ infinity according to sign of screen value\n  if (sv > zero[i])\n  {\n    xL = 0; xR = 1000;\n    while (1)\n    {\n      V.Mult(DirVec, xR); ProjectVector(V);\n      \/\/ printf(\"positive projected %f, value %f,xL, xR ( %f, %f)\\n\", V[i], sv, xL, xR);\n      if (V[i] > sv || V[i] == sv) break;\n      xL = xR; xR *= 2;\n    }\n  }\n  else if (sv < zero[i])\n  {\n    xR = 0; xL = -1000;\n    while (1)\n    {\n      V.Mult(DirVec, xL); ProjectVector(V);\n      \/\/ printf(\"negative projected %f, value %f,xL, xR ( %f, %f)\\n\", V[i], sv, xL, xR);\n      if (V[i] < sv || V[i] == sv) break;\n      xR = xL; xL *= 2;\n    }\n  }\n  else\n  {\n    return 0.0f;\n  }\n\n  \/\/ printf(\"start bisection %f %f sv %f\\n\", xL, xR, sv);\n  do \n  {  \n    xM = 0.5f * (xL + xR);\n    V.Mult(DirVec, xM);\n    ProjectVector(V);\n    if (V[i] > sv) \n      xR = xM; \n    else\n      xL = xM;\n  } while(TMath::Abs(V[i] - sv) >= fgEps);\n\n  return xM;\n}\n\n\/\/______________________________________________________________________________\nFloat_t NLTProjection::GetScreenVal(Int_t i, Float_t x)\n{\n  Vector dv; \n  SetDirectionalVector(i, dv); dv = dv*x;\n  ProjectVector(dv);\n  return dv[i];\n}\n\n\n\/**************************************************************************\/\n\/**************************************************************************\/\n\nClassImp(Reve::RhoZ)\n\n\/\/______________________________________________________________________________\nvoid RhoZ::SetCenter(Vector& v)\n{\n  fCenter = v;\n\n  fCenterR = TMath::Sqrt(v.x*v.x+v.y*v.y);\n  fProjectedCenter.x = fCenter.z;\n  fProjectedCenter.y = TMath::Sign(fCenterR, fCenter.y);\n  fProjectedCenter.z = 0;\n  UpdateLimit();\n}\n\n\/\/______________________________________________________________________________\nvoid RhoZ::ProjectPoint(Float_t& x, Float_t& y, Float_t& z,  PProc_e proc )\n{\n  using namespace TMath;\n\n  if(proc == PP_Plane || proc == PP_Full)\n  {\n    \/\/ project\n    y = Sign((Float_t)Sqrt(x*x+y*y), y); \n    x = z;\n  }\n  if(proc == PP_Distort || proc == PP_Full)\n  {\n    \/\/ move to center\n    x -= fProjectedCenter.x;\n    y -= fProjectedCenter.y;\n    \/\/ distort\n    y = (y*fScale) \/ (1.0f + Abs(y)*fDistortion);\n    x = (x*fScale) \/ (1.0f + Abs(x)*fDistortion);\n    \/\/ move back from center\n    x += fProjectedCenter.x;\n    y += fProjectedCenter.y;\n  }\n  z = 0.0f;\n}\n\n\/\/______________________________________________________________________________\nvoid RhoZ::SetDirectionalVector(Int_t screenAxis, Vector& vec)\n{\n  if(screenAxis == 0) \n    vec.Set(0., 0., 1);\n  else \n    vec.Set(0., 1., 0);\n\n}\n\/\/______________________________________________________________________________\nBool_t RhoZ::AcceptSegment(Vector& v1, Vector& v2, Float_t tolerance) \n{\n  Float_t a = fProjectedCenter.y;\n  \n  Bool_t val = kTRUE;\n  \/\/  printf(\"accept segment y1:: %f, y2:: %f, center:: %f \\n\", v1.y ,v2.y, a);\n  if((v1.y <  a && v2.y > a) || (v1.y > a && v2.y < a))\n  {\n    val = kFALSE;\n    if (tolerance > 0)\n    {\n      Float_t a1 = TMath::Abs(v1.y - a), a2 = TMath::Abs(v2.y - a);\n      if (a1 < a2)\n      {\n\tif (a1 < tolerance) { v1.y = a; val = kTRUE; }\n      }\n      else\n      {\n\tif (a2 < tolerance) { v2.y = a; val = kTRUE; }\n      }\n    } \n  }\n  \/\/ printf(\"accept segment y1:: %f, y2:: %f, VAL %d \\n\", v1.y ,v2.y, val);\n  return val;\n}\n\n\/**************************************************************************\/\n\/**************************************************************************\/\nClassImp(Reve:: CircularFishEye)\n\/\/______________________________________________________________________________\nvoid  CircularFishEye::ProjectPoint(Float_t& x, Float_t& y, Float_t& z, PProc_e proc) \n{\n  \/\/ point look at from external origin\n  using namespace TMath;\n\n  if(proc !=  PP_Plane)\n  {\n    x -= fCenter.x;\n    y -= fCenter.y;\n    Float_t phi = x == 0.0 && y == 0.0 ? 0.0 : ATan2(y,x);\n    Float_t R = Sqrt(x*x+y*y);\n    \/\/ distort\n    Float_t NR = (R*fScale) \/ (1.0f + R*fDistortion);\n    x = NR*Cos(phi) + fCenter.x;\n    y = NR*Sin(phi) + fCenter.y;\n  }\n  z = 0.0f;\n}\n\n\/**************************************************************************\/\n\/**************************************************************************\/\n\/\/______________________________________________________________________\n\/\/ NLTProjector\n\/\/\n\nClassImp(NLTProjector)\n\nNLTProjector::NLTProjector():\n  RenderElementList(\"NLTProjector\",\"\"),\n\n  fProjection (0),\n   \n  fDrawCenter(kFALSE),\n  fDrawOrigin(kFALSE),\n\n  fSplitInfoMode(0),\n  fSplitInfoLevel(1),\n  fAxisColor(0),\n\n  fCurrentDepth(0)\n{\n  SetProjection(NLTProjection::PT_CFishEye, 0);\n}\n\n\/\/______________________________________________________________________________\nNLTProjector::~NLTProjector()\n{\n  if(fProjection) delete fProjection;\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::UpdateName()\n{\n  SetName(Form (\"%s (%3.1f)\", fProjection->GetName(), fProjection->GetDistortion()*1000));\n  UpdateItems();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::SetProjection(NLTProjection::PType_e type, Float_t distort)\n{\n  static const Exc_t eH(\"NLTProjector::SetProjection \");\n\n  delete fProjection;\n  fProjection = 0;\n\n  switch (type)\n  {\n    case NLTProjection::PT_CFishEye:\n    {\n      fProjection  = new CircularFishEye(fCenter);\n      break;\n    }\n    case NLTProjection::PT_RhoZ:\n    {\n      fProjection  = new RhoZ(fCenter);\n      break;\n    }\n    default:\n      throw(eH + \"projection type not valid.\");\n      break;\n  }\n  fProjection->SetDistortion(distort);\n  UpdateName();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::SetProjection(NLTProjection* p)\n{\n  delete fProjection;\n  fProjection = p;\n  UpdateName();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::SetCenter(Float_t x, Float_t y, Float_t z)\n{\n  fCenter.Set(x, y, z);\n\n  \/\/ update projection\n  fProjection->SetCenter(fCenter);\n\n  \/\/ rebuild the scene\n  ProjectChildren();\n}\n\n\/\/______________________________________________________________________________\nBool_t NLTProjector::HandleElementPaste(RenderElement* el)\n{\n  size_t n_children  = fChildren.size();\n  ImportElements(el);\n  return n_children != fChildren.size();\n}\n\n\/\/______________________________________________________________________________\nBool_t NLTProjector::ShouldImport(RenderElement* rnr_el)\n{\n  if (rnr_el->IsA()->InheritsFrom(NLTProjectable::Class()))\n    return kTRUE;\n  for (List_i i=rnr_el->BeginChildren(); i!=rnr_el->EndChildren(); ++i)\n    if (ShouldImport(*i))\n      return kTRUE;\n  return kFALSE;\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ImportElementsRecurse(RenderElement* rnr_el, RenderElement* parent)\n{\n  if (ShouldImport(rnr_el))\n  {\n    RenderElement  *new_re = 0;\n    NLTProjected   *new_pr = 0;\n    NLTProjectable *pble   = dynamic_cast<NLTProjectable*>(rnr_el);\n    if (pble)\n    {\n      new_re = (RenderElement*) pble->ProjectedClass()->New();\n      new_pr = dynamic_cast<NLTProjected*>(new_re);\n      new_pr->SetProjection(this, pble);\n      new_pr->SetDepth(fCurrentDepth);\n    }\n    else\n    {\n      new_re = new RenderElementList;      \n    }\n    TObject *tobj   = rnr_el->GetObject();\n    new_re->SetRnrElNameTitle(Form(\"NLT %s\", tobj->GetName()),\n\t\t\t      tobj->GetTitle());\n    new_re->SetRnrSelf     (rnr_el->GetRnrSelf());\n    new_re->SetRnrChildren(rnr_el->GetRnrChildren());\n    gReve->AddRenderElement(new_re, parent);\n\n    for (List_i i=rnr_el->BeginChildren(); i!=rnr_el->EndChildren(); ++i)\n      ImportElementsRecurse(*i, new_re);\n  }\n\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ImportElements(RenderElement* rnr_el)\n{\n  ImportElementsRecurse(rnr_el, this);\n  ProjectChildren();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ProjectChildrenRecurse(RenderElement* rnr_el)\n{\n  NLTProjected* pted = dynamic_cast<NLTProjected*>(rnr_el);\n  if (pted)\n  {\n    pted->UpdateProjection();\n    TAttBBox* bb = dynamic_cast<TAttBBox*>(pted);\n    if(bb) \n    {\n      Float_t* b = bb->AssertBBox();\n      BBoxCheckPoint(b[0], b[2], b[4]);\n      BBoxCheckPoint(b[1], b[3], b[5]);\n    }\n    rnr_el->ElementChanged(kFALSE);\n  }\n\n  for (List_i i=rnr_el->BeginChildren(); i!=rnr_el->EndChildren(); ++i)\n    ProjectChildrenRecurse(*i);\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ProjectChildren()\n{\n  BBoxZero();\n  ProjectChildrenRecurse(this);\n  AssertBBoxExtents(0.1);\n  {\n    using namespace TMath;\n    fBBox[0] = 10.0f * Floor(fBBox[0]\/10.0f);\n    fBBox[1] = 10.0f * Ceil (fBBox[1]\/10.0f);\n    fBBox[2] = 10.0f * Floor(fBBox[2]\/10.0f);\n    fBBox[3] = 10.0f * Ceil (fBBox[3]\/10.0f);\n  }\n\n  List_t scenes;\n  CollectSceneParentsFromChildren(scenes, 0);\n  gReve->ScenesChanged(scenes);\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::Paint(Option_t* \/*option*\/)\n{\n  static const Exc_t eH(\"NLTProjector::Paint \");\n  TBuffer3D buff(TBuffer3DTypes::kGeneric);\n\n  \/\/ Section kCore\n  buff.fID           = this;\n  buff.fColor        = fAxisColor;\n  buff.fTransparency = 0;\n  buff.SetSectionsValid(TBuffer3D::kCore);\n\n  Int_t reqSections = gPad->GetViewer3D()->AddObject(buff);\n  if (reqSections != TBuffer3D::kNone)\n    Error(eH, \"only direct GL rendering supported.\");\n}\n\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ComputeBBox()\n{\n  \/\/ Fill bounding-box information in base-class TAttBBox (virtual method).\n\n  static const Exc_t eH(\"NLTProjector::ComputeBBox \");\n\n  if(GetNChildren() == 0) {\n    BBoxZero();\n    return;\n  }\n\n  BBoxInit();\n}\n\n<commit_msg>Bugfix: in GetValForScreenPos() check if distortion exist before checking the limit.<commit_after>#include \"NLTProjector.h\"\n#include \"ReveManager.h\"\n#include \"NLTBases.h\"\n\n#include \"TBuffer3D.h\"\n#include \"TBuffer3DTypes.h\"\n#include <TVirtualPad.h>\n#include <TVirtualViewer3D.h>\n\n#include <list>\n\nusing namespace Reve;\n\nClassImp(Reve::NLTProjection)\n\nFloat_t NLTProjection::fgEps = 0.005f;\n \nNLTProjection::NLTProjection(Vector& center) : \n  fType(PT_Unknown),\n  fGeoMode(GM_Unknown),\n  fName(0),\n  fCenter(center.x, center.y, center.z),\n  fDistortion(0.0f), \n  fFixedRadius(300), \n  fScale(1.0f)\n{}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::ProjectVector(Vector& v)\n{\n  ProjectPoint(v.x, v.y, v.z);\n}\n\n\/\/______________________________________________________________________________\nVector* NLTProjection::Project(Vector* origPnts, Int_t Npnts, Bool_t copy)\n{\n  Vector* pnts = 0; \n  if(copy) \n  {\n    pnts = new Vector[Npnts];\n    memcpy(pnts, origPnts, Npnts*sizeof(Vector));\n  }\n  else\n  { \n    pnts =  origPnts;\n  }\n\n  for(Int_t i = 0; i<Npnts; i++)\n  {\n    ProjectPoint(pnts[i].x, pnts[i].y, pnts[i].z);\n  }\n  return pnts;\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::UpdateLimit()\n{\n  if ( fDistortion == 0.0f )\n    return;\n \n  Float_t lim =  1.0f\/fDistortion + fFixedRadius;\n  Float_t* c = GetProjectedCenter();\n  fUpLimit.Set(lim + c[0], lim + c[1], c[2]);\n  fLowLimit.Set(-lim + c[0], -lim + c[1], c[2]);\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::SetDistortion(Float_t d)\n{\n  \/\/ Prevent scaling down whole projected scene.\n  \/\/ Point at fixe distance shold be on constant screen coorinate. \n\n  fDistortion=d; \n  fScale = 1+fFixedRadius*fDistortion;\n  UpdateLimit();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::SetFixedRadius(Float_t r)\n{\n\n  fFixedRadius=r;\n  fScale = 1+fFixedRadius*fDistortion;\n  UpdateLimit();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjection::SetDirectionalVector(Int_t screenAxis, Vector& vec)\n{\n  for (Int_t i=0; i<3; i++)\n  {\n    vec[i] = (i==screenAxis) ? 1. : 0.;\n  }\n}\n\n\/\/______________________________________________________________________________\nFloat_t NLTProjection::GetValForScreenPos(Int_t i, Float_t sv)\n{\n  \/\/ move on unprojected axis, find when projected value is geiven screen values(sv)\n  static const Exc_t eH(\"NLTProjector::GetValForScreenPos \");\n\n  Float_t xL, xM, xR;\n  Vector V, DirVec;\n  SetDirectionalVector(i, DirVec);\n  if (fDistortion > 0.0f && ((sv > 0 && sv > fUpLimit[i]) || (sv < 0 && sv < fLowLimit[i])))\n    throw(eH + Form(\"screen value '%f' out of limit '%f'.\", sv, sv > 0 ? fUpLimit[i] : fLowLimit[i]));\n\n  Vector zero; ProjectVector(zero);\n  \/\/ printf(\"NLTProjection::GetValForScreenPos %d sv %f , zero %f\\n\",i,  sv, zero[i]);\n  \/\/ search from -\/+ infinity according to sign of screen value\n  if (sv > zero[i])\n  {\n    xL = 0; xR = 1000;\n    while (1)\n    {\n      V.Mult(DirVec, xR); ProjectVector(V);\n      \/\/ printf(\"positive projected %f, value %f,xL, xR ( %f, %f)\\n\", V[i], sv, xL, xR);\n      if (V[i] > sv || V[i] == sv) break;\n      xL = xR; xR *= 2;\n    }\n  }\n  else if (sv < zero[i])\n  {\n    xR = 0; xL = -1000;\n    while (1)\n    {\n      V.Mult(DirVec, xL); ProjectVector(V);\n      \/\/ printf(\"negative projected %f, value %f,xL, xR ( %f, %f)\\n\", V[i], sv, xL, xR);\n      if (V[i] < sv || V[i] == sv) break;\n      xR = xL; xL *= 2;\n    }\n  }\n  else\n  {\n    return 0.0f;\n  }\n\n  \/\/ printf(\"start bisection %f %f sv %f\\n\", xL, xR, sv);\n  do \n  {  \n    xM = 0.5f * (xL + xR);\n    V.Mult(DirVec, xM);\n    ProjectVector(V);\n    if (V[i] > sv) \n      xR = xM; \n    else\n      xL = xM;\n  } while(TMath::Abs(V[i] - sv) >= fgEps);\n\n  return xM;\n}\n\n\/\/______________________________________________________________________________\nFloat_t NLTProjection::GetScreenVal(Int_t i, Float_t x)\n{\n  Vector dv; \n  SetDirectionalVector(i, dv); dv = dv*x;\n  ProjectVector(dv);\n  return dv[i];\n}\n\n\n\/**************************************************************************\/\n\/**************************************************************************\/\n\nClassImp(Reve::RhoZ)\n\n\/\/______________________________________________________________________________\nvoid RhoZ::SetCenter(Vector& v)\n{\n  fCenter = v;\n\n  fCenterR = TMath::Sqrt(v.x*v.x+v.y*v.y);\n  fProjectedCenter.x = fCenter.z;\n  fProjectedCenter.y = TMath::Sign(fCenterR, fCenter.y);\n  fProjectedCenter.z = 0;\n  UpdateLimit();\n}\n\n\/\/______________________________________________________________________________\nvoid RhoZ::ProjectPoint(Float_t& x, Float_t& y, Float_t& z,  PProc_e proc )\n{\n  using namespace TMath;\n\n  if(proc == PP_Plane || proc == PP_Full)\n  {\n    \/\/ project\n    y = Sign((Float_t)Sqrt(x*x+y*y), y); \n    x = z;\n  }\n  if(proc == PP_Distort || proc == PP_Full)\n  {\n    \/\/ move to center\n    x -= fProjectedCenter.x;\n    y -= fProjectedCenter.y;\n    \/\/ distort\n    y = (y*fScale) \/ (1.0f + Abs(y)*fDistortion);\n    x = (x*fScale) \/ (1.0f + Abs(x)*fDistortion);\n    \/\/ move back from center\n    x += fProjectedCenter.x;\n    y += fProjectedCenter.y;\n  }\n  z = 0.0f;\n}\n\n\/\/______________________________________________________________________________\nvoid RhoZ::SetDirectionalVector(Int_t screenAxis, Vector& vec)\n{\n  if(screenAxis == 0) \n    vec.Set(0., 0., 1);\n  else \n    vec.Set(0., 1., 0);\n\n}\n\/\/______________________________________________________________________________\nBool_t RhoZ::AcceptSegment(Vector& v1, Vector& v2, Float_t tolerance) \n{\n  Float_t a = fProjectedCenter.y;\n  \n  Bool_t val = kTRUE;\n  \/\/  printf(\"accept segment y1:: %f, y2:: %f, center:: %f \\n\", v1.y ,v2.y, a);\n  if((v1.y <  a && v2.y > a) || (v1.y > a && v2.y < a))\n  {\n    val = kFALSE;\n    if (tolerance > 0)\n    {\n      Float_t a1 = TMath::Abs(v1.y - a), a2 = TMath::Abs(v2.y - a);\n      if (a1 < a2)\n      {\n\tif (a1 < tolerance) { v1.y = a; val = kTRUE; }\n      }\n      else\n      {\n\tif (a2 < tolerance) { v2.y = a; val = kTRUE; }\n      }\n    } \n  }\n  \/\/ printf(\"accept segment y1:: %f, y2:: %f, VAL %d \\n\", v1.y ,v2.y, val);\n  return val;\n}\n\n\/**************************************************************************\/\n\/**************************************************************************\/\nClassImp(Reve:: CircularFishEye)\n\/\/______________________________________________________________________________\nvoid  CircularFishEye::ProjectPoint(Float_t& x, Float_t& y, Float_t& z, PProc_e proc) \n{\n  \/\/ point look at from external origin\n  using namespace TMath;\n\n  if(proc !=  PP_Plane)\n  {\n    x -= fCenter.x;\n    y -= fCenter.y;\n    Float_t phi = x == 0.0 && y == 0.0 ? 0.0 : ATan2(y,x);\n    Float_t R = Sqrt(x*x+y*y);\n    \/\/ distort\n    Float_t NR = (R*fScale) \/ (1.0f + R*fDistortion);\n    x = NR*Cos(phi) + fCenter.x;\n    y = NR*Sin(phi) + fCenter.y;\n  }\n  z = 0.0f;\n}\n\n\/**************************************************************************\/\n\/**************************************************************************\/\n\/\/______________________________________________________________________\n\/\/ NLTProjector\n\/\/\n\nClassImp(NLTProjector)\n\nNLTProjector::NLTProjector():\n  RenderElementList(\"NLTProjector\",\"\"),\n\n  fProjection (0),\n   \n  fDrawCenter(kFALSE),\n  fDrawOrigin(kFALSE),\n\n  fSplitInfoMode(0),\n  fSplitInfoLevel(1),\n  fAxisColor(0),\n\n  fCurrentDepth(0)\n{\n  SetProjection(NLTProjection::PT_CFishEye, 0);\n}\n\n\/\/______________________________________________________________________________\nNLTProjector::~NLTProjector()\n{\n  if(fProjection) delete fProjection;\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::UpdateName()\n{\n  SetName(Form (\"%s (%3.1f)\", fProjection->GetName(), fProjection->GetDistortion()*1000));\n  UpdateItems();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::SetProjection(NLTProjection::PType_e type, Float_t distort)\n{\n  static const Exc_t eH(\"NLTProjector::SetProjection \");\n\n  delete fProjection;\n  fProjection = 0;\n\n  switch (type)\n  {\n    case NLTProjection::PT_CFishEye:\n    {\n      fProjection  = new CircularFishEye(fCenter);\n      break;\n    }\n    case NLTProjection::PT_RhoZ:\n    {\n      fProjection  = new RhoZ(fCenter);\n      break;\n    }\n    default:\n      throw(eH + \"projection type not valid.\");\n      break;\n  }\n  fProjection->SetDistortion(distort);\n  UpdateName();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::SetProjection(NLTProjection* p)\n{\n  delete fProjection;\n  fProjection = p;\n  UpdateName();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::SetCenter(Float_t x, Float_t y, Float_t z)\n{\n  fCenter.Set(x, y, z);\n\n  \/\/ update projection\n  fProjection->SetCenter(fCenter);\n\n  \/\/ rebuild the scene\n  ProjectChildren();\n}\n\n\/\/______________________________________________________________________________\nBool_t NLTProjector::HandleElementPaste(RenderElement* el)\n{\n  size_t n_children  = fChildren.size();\n  ImportElements(el);\n  return n_children != fChildren.size();\n}\n\n\/\/______________________________________________________________________________\nBool_t NLTProjector::ShouldImport(RenderElement* rnr_el)\n{\n  if (rnr_el->IsA()->InheritsFrom(NLTProjectable::Class()))\n    return kTRUE;\n  for (List_i i=rnr_el->BeginChildren(); i!=rnr_el->EndChildren(); ++i)\n    if (ShouldImport(*i))\n      return kTRUE;\n  return kFALSE;\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ImportElementsRecurse(RenderElement* rnr_el, RenderElement* parent)\n{\n  if (ShouldImport(rnr_el))\n  {\n    RenderElement  *new_re = 0;\n    NLTProjected   *new_pr = 0;\n    NLTProjectable *pble   = dynamic_cast<NLTProjectable*>(rnr_el);\n    if (pble)\n    {\n      new_re = (RenderElement*) pble->ProjectedClass()->New();\n      new_pr = dynamic_cast<NLTProjected*>(new_re);\n      new_pr->SetProjection(this, pble);\n      new_pr->SetDepth(fCurrentDepth);\n    }\n    else\n    {\n      new_re = new RenderElementList;      \n    }\n    TObject *tobj   = rnr_el->GetObject();\n    new_re->SetRnrElNameTitle(Form(\"NLT %s\", tobj->GetName()),\n\t\t\t      tobj->GetTitle());\n    new_re->SetRnrSelf     (rnr_el->GetRnrSelf());\n    new_re->SetRnrChildren(rnr_el->GetRnrChildren());\n    gReve->AddRenderElement(new_re, parent);\n\n    for (List_i i=rnr_el->BeginChildren(); i!=rnr_el->EndChildren(); ++i)\n      ImportElementsRecurse(*i, new_re);\n  }\n\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ImportElements(RenderElement* rnr_el)\n{\n  ImportElementsRecurse(rnr_el, this);\n  ProjectChildren();\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ProjectChildrenRecurse(RenderElement* rnr_el)\n{\n  NLTProjected* pted = dynamic_cast<NLTProjected*>(rnr_el);\n  if (pted)\n  {\n    pted->UpdateProjection();\n    TAttBBox* bb = dynamic_cast<TAttBBox*>(pted);\n    if(bb) \n    {\n      Float_t* b = bb->AssertBBox();\n      BBoxCheckPoint(b[0], b[2], b[4]);\n      BBoxCheckPoint(b[1], b[3], b[5]);\n    }\n    rnr_el->ElementChanged(kFALSE);\n  }\n\n  for (List_i i=rnr_el->BeginChildren(); i!=rnr_el->EndChildren(); ++i)\n    ProjectChildrenRecurse(*i);\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ProjectChildren()\n{\n  BBoxZero();\n  ProjectChildrenRecurse(this);\n  AssertBBoxExtents(0.1);\n  {\n    using namespace TMath;\n    fBBox[0] = 10.0f * Floor(fBBox[0]\/10.0f);\n    fBBox[1] = 10.0f * Ceil (fBBox[1]\/10.0f);\n    fBBox[2] = 10.0f * Floor(fBBox[2]\/10.0f);\n    fBBox[3] = 10.0f * Ceil (fBBox[3]\/10.0f);\n  }\n\n  List_t scenes;\n  CollectSceneParentsFromChildren(scenes, 0);\n  gReve->ScenesChanged(scenes);\n}\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::Paint(Option_t* \/*option*\/)\n{\n  static const Exc_t eH(\"NLTProjector::Paint \");\n  TBuffer3D buff(TBuffer3DTypes::kGeneric);\n\n  \/\/ Section kCore\n  buff.fID           = this;\n  buff.fColor        = fAxisColor;\n  buff.fTransparency = 0;\n  buff.SetSectionsValid(TBuffer3D::kCore);\n\n  Int_t reqSections = gPad->GetViewer3D()->AddObject(buff);\n  if (reqSections != TBuffer3D::kNone)\n    Error(eH, \"only direct GL rendering supported.\");\n}\n\n\n\/\/______________________________________________________________________________\nvoid NLTProjector::ComputeBBox()\n{\n  \/\/ Fill bounding-box information in base-class TAttBBox (virtual method).\n\n  static const Exc_t eH(\"NLTProjector::ComputeBBox \");\n\n  if(GetNChildren() == 0) {\n    BBoxZero();\n    return;\n  }\n\n  BBoxInit();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ CommonFunc.cpp -- source file\n\/*\n *\n * Author: septimomend (Ivan Chapkailo)\n *\n * 02.07.2017\n *\n *\/\n\n#include \"stdafx.h\"\n#include \"CommonFunc.h\"\n\n\nCommon::Common(AllControllers* all) : m_pCnfg(all->getConfigObj())\n{\n}\n\nvoid Common::setChar(int ch)\n{\n  if (m_pCnfg->configY == m_pCnfg->rowCount)  \/\/ if this is last line\n  {\n    setRow(m_pCnfg->rowCount, \"\", 0);         \/\/ set new row with zero position and empty\n  }\n  setRowChar(&m_pCnfg->pRowObj[m_pCnfg->configY], m_pCnfg->configX, ch); \/\/ set char to last position in last row\n  m_pCnfg->configX++;                         \/\/ and increment row lenght for cursor\n}\nvoid Common::setNewline()\n{\n  \/\/ TODO\n}\n\nvoid Common::deleteChar()\n{\n  \/\/ TODO\n}\n\nvoid Common::save()\n{\n  \/\/ TODO\n}\n\nvoid Common::find()\n{\n  \/\/ TODO\n}\n\nvoid Common::drawRows(Adbfr* abfr);\n{\n  \/\/ TODO\n}\n\nvoid Common::drawStatusBar(Adbfr* abfr)\n{\n  \/\/ TODO\n}\n\nvoid Common::drawMessageBar(Adbfr* abfr)\n{\n  \/\/ TODO\n}\n\nvoid Common::scrolling()\n{\n  \/\/ TODO\n}\n\nvoid Common::statusMsg(const char *fmt, ...)\n{\n  va_list arg;         \/\/ for unknown number of parameters\n  va_start(arg, fmt);  \/\/ initialize arg\n  vsnprintf(cnfg.statusMessage, sizeof(cnfg.statusMessage), fmt, arg); \/\/ output parameters to statusMessage\n  va_end(arg); \/\/ end\n  cnfg.statusMessageTime = time(NULL); \/\/ gets time\n}\n\nvoid Common::updateScreen()\n{\n  scrolling();\n\n  m_abfr = ADBFR_IMPL; \/\/ implement to NULL\n\n  m_abfr.reallocateBfr(\"\\x1b[?25l\", 6); \/\/ reallocate data\n  m_abfr.reallocateBfr(\"\\x1b[H\", 3);    \/\/ reallocate data\n\n  \/*\n   * draw rows, message bar and status bar\n   *\/\n  drawRows(&m_abfr);\n  drawStatusBar(&m_abfr);\n  drawMessageBar(&m_abfr);\n\n  \/*\n   * write to buff cursor | position\n   *\/\n  char buff[32];\n  snprintf(buff, sizeof(buff), \"\\x1b[%d;%dH\", (m_pCnfg->configY - m_pCnfg->disableRow) + 1, (m_pCnfg->rowX - m_pCnfg->disableClr) + 1);\n  m_abfr.reallocateBfr(buff, strlen(buff));\n\n  m_abfr.reallocateBfr(\"\\x1b[?25h\", 6);\n\n  \/*\n   * update screen\n   *\/\n  write(STDOUT_FILENO, ab.b, ab.len);\n  m_abfr.freeBfr(); \/\/ free memory\n}\n\nchar* Common::callPrompt(char *prompt, void (*callback)(char*, int))\n{\n  size_t buffsize = 128;\n  char* bfr = malloc(buffsize); \/\/ allocate memory\n\n  size_t bufflen = 0;           \/\/ lenght\n  bfr[0] = '\\0';\n\n  while (1)\n  {\n    statusMsg(prompt, bfr); \/\/ set prompt\n    updateScreen();         \/\/ and update screen\n\n    int key = tml.whatKey();  \/\/ read key\n\n    if (key == DELETE_KEY || key == CTRL_KEY('h') || key == BACKSPACE)\n    {\n      if (bufflen != 0)         \/\/ if buffer is not empty\n        bfr[--bufflen] = '\\0';  \/\/ set end of row\n    }\n    else if (key == '\\x1b')     \/\/ if this is ESC\n    {\n      statusMsg(\"\");          \/\/ erase\n      if (callback)           \/\/ if callback is not NULL\n        callback(bfr, key);   \/\/ call func for callback which pointed by callback()\n      free(bfr);              \/\/ free memory\n      return NULL;            \/\/ and cancel\n    }\n    else if (key == '\\r')     \/\/ if carriage return (move the cursor at the start of the line)\n    {\n      if (bufflen != 0)       \/\/ and bufflen is not empty\n      {\n        statusMsg(\"\");        \/\/ clean message\n        if (callback)\n          callback(bfr, key); \/\/ and get callback\n        return bfr;           \/\/ returning of buffer\n      }\n    }\n    else if (!iscntrl(key) && key < 128) \/\/ checks, whether the argument, transmitted via the parameter сharacter, control character\n    {\n      \/*\n       * reallocation of buffer if needs\n       *\/\n      if (bufflen == buffsize - 1)\n      {\n        buffsize *= 2;\n        bfr = realloc(bfr, buffsize);\n      }\n      bfr[bufflen++] = key; \/\/ write this key to buffer\n      bfr[bufflen] = '\\0';  \/\/ and end of row\n    }\n\n    if (callback)\n      callback(bfr, key);   \/\/ call of callback\n  }\n}\n\nvoid Common::moveCursor(int key)\n{\n  \/\/ instancing RowController\n  \/\/ if empty - to zero position, else to the end of row\n  \/\/\n  RowController* pRowctrl = (m_pCnfg->configY >= m_pCnfg->rowCount) ? NULL : &m_pCnfg->pRowObj[m_pCnfg->configY];\n\n  switch (key)\n  {\n    case ARROW_LEFT:\n      if (m_pCnfg->configX != 0)                                    \/\/ if horizontal position isn't zero\n      {\n        m_pCnfg->configX--;                                         \/\/ move left\n      }\n      else if (m_pCnfg->configY > 0)                                \/\/ else if there is at least 1 row\n      {\n        m_pCnfg->configY--;                                         \/\/ move to that row\n        m_pCnfg->configX = m_pCnfg->pRowObj[m_pCnfg->configY].size; \/\/ and to the end of that row\n      }\n      break;\n    case ARROW_RIGHT:\n      if (pRowctrl && m_pCnfg->configX < pRowctrl->size)            \/\/ if there is row and if cursor is not in the end of row\n      {\n        m_pCnfg->configX++;                                         \/\/ move cursor right along of row\n      }\n      else if (pRowctrl && m_pCnfg->configX == pRowctrl->size)      \/\/ if there is row and cursor in the end of this row\n      {\n        m_pCnfg->configY++;                                         \/\/ move to next row\n        E.cx = 0;                                                   \/\/ on zero position\n      }\n      break;\n    case ARROW_UP:\n      if (m_pCnfg->configY != 0)                                    \/\/ if there is at least 1 row\n      {\n        m_pCnfg->configY--;                                         \/\/ move up\n      }\n      break;\n    case ARROW_DOWN:\n      if (m_pCnfg->configY < m_pCnfg->rowCount)                     \/\/ if cursor is not on last row\n      {\n        m_pCnfg->configY++;                                         \/\/ move down\n      }\n      break;\n  }\n}\n\nvoid Common::processingKeypress()\n{\n  static int sQuitCounter = EDITORRMEND_QUIT_COUNTER;                \/\/ counter clicking for exit\n\n  int key = whatKey();                                               \/\/ read key\n\n  switch (key)\n  {\n    case '\\r':                                                       \/\/ if carriage return (Enter key)\n      setNewline();                                                   \/\/ set newline\n      break;\n\n    case CTRL_KEY('q'):\n      if (m_pCnfg->smear && sQuitCounter > 0)                        \/\/ if there is any changes and counter > 0\n      {\n        statusMsg(\"! File was changed and unsaved and data can be lost after exiting. \"\n                  \"Press Ctrl-Q %d more times to exit.\", sQuitCounter);\n        sQuitCounter--;                                              \/\/ counter decrement\n        return;\n      }\n      write(STDOUT_FILENO, \"\\x1b[2J\", 4);\n      write(STDOUT_FILENO, \"\\x1b[H\", 3);\n      exit(0);\n      break;\n\n    case CTRL_KEY('s'):\n      save();                                                       \/\/ TODO: save changes\n      break;\n\n    case HOME_KEY:\n    m_pCnfg->configX = 0;                                           \/\/ to the row beginning\n      break;\n\n    case END_KEY:\n      if (m_pCnfg->configY < m_pCnfg->rowCount)                     \/\/ if not last row\n        m_pCnfg->configX = m_pCnfg->pRowObj[m_pCnfg->configY].size; \/\/ to the end of row\n      break;\n\n    case CTRL_KEY('f'):\n      find();                                                       \/\/ find func\n      break;\n\n    case BACKSPACE:\n    case CTRL_KEY('h'):\n    case DELETE_KEY:\n      if (key == DELETE_KEY)\n        moveCursor(ARROW_RIGHT);                                    \/\/ move cursor right\n      deleteChar();                                                 \/\/ delete char\n      break;\n\n    \/\/ page up\/down\n    \/\/\n    case PAGE_UP:\n    case PAGE_DOWN:\n      {\n        if (key == PAGE_UP)\n        {\n          m_pCnfg->configY = m_pCnfg->disableRow;                    \/\/ move page up\n        }\n        else if (key == PAGE_DOWN)\n        {\n          m_pCnfg->configY = m_pCnfg->disableRow + m_pCnfg->enableRow - 1; \/\/ move page down\n          if (m_pCnfg->configY > m_pCnfg->rowCount)\n            m_pCnfg->configY = m_pCnfg->rowCount;\n        }\n\n        int times = m_pCnfg->enableRow;\n        while (times--)\n          moveCursor(key == PAGE_UP ? ARROW_UP : ARROW_DOWN);\n      }\n      break;\n\n    case ARROW_UP:\n    case ARROW_DOWN:\n    case ARROW_LEFT:\n    case ARROW_RIGHT:\n      moveCursor(key);\n      break;\n\n    case CTRL_KEY('l'):\n    case '\\x1b':\n      break;\n\n    default:\n      setChar(key);   \/\/ just write chars\n      break;\n  }\n\n  sQuitCounter = EDITORRMEND_QUIT_COUNTER;\n}\n<commit_msg>defined setRow() func<commit_after>\/\/ CommonFunc.cpp -- source file\n\/*\n *\n * Author: septimomend (Ivan Chapkailo)\n *\n * 02.07.2017\n *\n *\/\n\n#include \"stdafx.h\"\n#include \"CommonFunc.h\"\n\n\nCommon::Common(AllControllers* all) : m_pCnfg(all->getConfigObj())\n{\n}\n\nvoid Common::setRow(int num, char *str, size_t sz)\n{\n  if (num < 0 || num > m_pCnfg->rowCount)  \/\/ if number is out of row numbers range\n    return;                                \/\/ error\n\n  \/\/ reallocation of memory\n  \/\/ сhange the size of the rows to add a new row\n  \/\/\n  m_pCnfg->pRowObj = realloc(m_pCnfg->pRowObj, sizeof(RowController) * (m_pCnfg->rowCount + 1));\n\n  \/\/ copy size bytes of rows to the same object incremented by 1\n  \/\/\n  memmove(&m_pCnfg->pRowObj[num + 1], &m_pCnfg->pRowObj[num], sizeof(RowController) * (m_pCnfg->rowCount - num));\n\n  for (int i = num + 1; i <= m_pCnfg->rowCount; i++)\n    m_pCnfg->pRowObj[i].index++;           \/\/ increase index\n\n  m_pCnfg->pRowObj[num].index = num;       \/\/ set index\n  m_pCnfg->pRowObj[num].size = sz;         \/\/ set size\n  m_pCnfg->pRowObj[num].pLetter = malloc(sz + 1); \/\/ allocate memory for sz+1 bytes\n  memcpy(m_pCnfg->pRowObj[num].pLetter, str, sz); \/\/ copy size bytes of string to pLetter (example: str is \"s\" - copy s to pLetter)\n  m_pCnfg->pRowObj[num].pLetter[sz] = '\\0';       \/\/ set EOF of row\n\n  m_pCnfg->pRowObj[num].sizeRow = 0;              \/\/ zero size of row\n  m_pCnfg->pRowObj[num].pVisualize = NULL;        \/\/ no visualize\n  m_pCnfg->pRowObj[num].pClr = NULL;              \/\/ no colour\n  m_pCnfg->pRowObj[num].commentClr = 0;           \/\/ no comment colour\n\n  updateRow(&m_pCnfg->pRowObj[num]);\n\n  m_pCnfg->rowCount++;                            \/\/ add 1 to rows number\n  m_pCnfg->smear++;                               \/\/ new changes\n}\n\nvoid Common::setRowChar(RowController *row, int to, int ch)\n{\n\n}\n\nvoid Common::setChar(int ch)\n{\n  if (m_pCnfg->configY == m_pCnfg->rowCount)  \/\/ if this is last line\n  {\n    setRow(m_pCnfg->rowCount, \"\", 0);         \/\/ set new row with zero position and empty\n  }\n  setRowChar(&m_pCnfg->pRowObj[m_pCnfg->configY], m_pCnfg->configX, ch); \/\/ set char to last position in last row\n  m_pCnfg->configX++;                         \/\/ and increment row lenght for cursor\n}\nvoid Common::setNewline()\n{\n  \/\/ TODO\n}\n\nvoid Common::deleteChar()\n{\n  \/\/ TODO\n}\n\nvoid Common::save()\n{\n  \/\/ TODO\n}\n\nvoid Common::find()\n{\n  \/\/ TODO\n}\n\nvoid Common::drawRows(Adbfr* abfr);\n{\n  \/\/ TODO\n}\n\nvoid Common::drawStatusBar(Adbfr* abfr)\n{\n  \/\/ TODO\n}\n\nvoid Common::drawMessageBar(Adbfr* abfr)\n{\n  \/\/ TODO\n}\n\nvoid Common::scrolling()\n{\n  \/\/ TODO\n}\n\nvoid Common::statusMsg(const char *fmt, ...)\n{\n  va_list arg;         \/\/ for unknown number of parameters\n  va_start(arg, fmt);  \/\/ initialize arg\n  vsnprintf(cnfg.statusMessage, sizeof(cnfg.statusMessage), fmt, arg); \/\/ output parameters to statusMessage\n  va_end(arg); \/\/ end\n  cnfg.statusMessageTime = time(NULL); \/\/ gets time\n}\n\nvoid Common::updateScreen()\n{\n  scrolling();\n\n  m_abfr = ADBFR_IMPL; \/\/ implement to NULL\n\n  m_abfr.reallocateBfr(\"\\x1b[?25l\", 6); \/\/ reallocate data\n  m_abfr.reallocateBfr(\"\\x1b[H\", 3);    \/\/ reallocate data\n\n  \/*\n   * draw rows, message bar and status bar\n   *\/\n  drawRows(&m_abfr);\n  drawStatusBar(&m_abfr);\n  drawMessageBar(&m_abfr);\n\n  \/*\n   * write to buff cursor | position\n   *\/\n  char buff[32];\n  snprintf(buff, sizeof(buff), \"\\x1b[%d;%dH\", (m_pCnfg->configY - m_pCnfg->disableRow) + 1, (m_pCnfg->rowX - m_pCnfg->disableClr) + 1);\n  m_abfr.reallocateBfr(buff, strlen(buff));\n\n  m_abfr.reallocateBfr(\"\\x1b[?25h\", 6);\n\n  \/*\n   * update screen\n   *\/\n  write(STDOUT_FILENO, ab.b, ab.len);\n  m_abfr.freeBfr(); \/\/ free memory\n}\n\nchar* Common::callPrompt(char *prompt, void (*callback)(char*, int))\n{\n  size_t buffsize = 128;\n  char* bfr = malloc(buffsize); \/\/ allocate memory\n\n  size_t bufflen = 0;           \/\/ lenght\n  bfr[0] = '\\0';\n\n  while (1)\n  {\n    statusMsg(prompt, bfr); \/\/ set prompt\n    updateScreen();         \/\/ and update screen\n\n    int key = tml.whatKey();  \/\/ read key\n\n    if (key == DELETE_KEY || key == CTRL_KEY('h') || key == BACKSPACE)\n    {\n      if (bufflen != 0)         \/\/ if buffer is not empty\n        bfr[--bufflen] = '\\0';  \/\/ set end of row\n    }\n    else if (key == '\\x1b')     \/\/ if this is ESC\n    {\n      statusMsg(\"\");          \/\/ erase\n      if (callback)           \/\/ if callback is not NULL\n        callback(bfr, key);   \/\/ call func for callback which pointed by callback()\n      free(bfr);              \/\/ free memory\n      return NULL;            \/\/ and cancel\n    }\n    else if (key == '\\r')     \/\/ if carriage return (move the cursor at the start of the line)\n    {\n      if (bufflen != 0)       \/\/ and bufflen is not empty\n      {\n        statusMsg(\"\");        \/\/ clean message\n        if (callback)\n          callback(bfr, key); \/\/ and get callback\n        return bfr;           \/\/ returning of buffer\n      }\n    }\n    else if (!iscntrl(key) && key < 128) \/\/ checks, whether the argument, transmitted via the parameter сharacter, control character\n    {\n      \/*\n       * reallocation of buffer if needs\n       *\/\n      if (bufflen == buffsize - 1)\n      {\n        buffsize *= 2;\n        bfr = realloc(bfr, buffsize);\n      }\n      bfr[bufflen++] = key; \/\/ write this key to buffer\n      bfr[bufflen] = '\\0';  \/\/ and end of row\n    }\n\n    if (callback)\n      callback(bfr, key);   \/\/ call of callback\n  }\n}\n\nvoid Common::moveCursor(int key)\n{\n  \/\/ instancing RowController\n  \/\/ if empty - to zero position, else to the end of row\n  \/\/\n  RowController* pRowctrl = (m_pCnfg->configY >= m_pCnfg->rowCount) ? NULL : &m_pCnfg->pRowObj[m_pCnfg->configY];\n\n  switch (key)\n  {\n    case ARROW_LEFT:\n      if (m_pCnfg->configX != 0)                                    \/\/ if horizontal position isn't zero\n      {\n        m_pCnfg->configX--;                                         \/\/ move left\n      }\n      else if (m_pCnfg->configY > 0)                                \/\/ else if there is at least 1 row\n      {\n        m_pCnfg->configY--;                                         \/\/ move to that row\n        m_pCnfg->configX = m_pCnfg->pRowObj[m_pCnfg->configY].size; \/\/ and to the end of that row\n      }\n      break;\n    case ARROW_RIGHT:\n      if (pRowctrl && m_pCnfg->configX < pRowctrl->size)            \/\/ if there is row and if cursor is not in the end of row\n      {\n        m_pCnfg->configX++;                                         \/\/ move cursor right along of row\n      }\n      else if (pRowctrl && m_pCnfg->configX == pRowctrl->size)      \/\/ if there is row and cursor in the end of this row\n      {\n        m_pCnfg->configY++;                                         \/\/ move to next row\n        E.cx = 0;                                                   \/\/ on zero position\n      }\n      break;\n    case ARROW_UP:\n      if (m_pCnfg->configY != 0)                                    \/\/ if there is at least 1 row\n      {\n        m_pCnfg->configY--;                                         \/\/ move up\n      }\n      break;\n    case ARROW_DOWN:\n      if (m_pCnfg->configY < m_pCnfg->rowCount)                     \/\/ if cursor is not on last row\n      {\n        m_pCnfg->configY++;                                         \/\/ move down\n      }\n      break;\n  }\n}\n\nvoid Common::processingKeypress()\n{\n  static int sQuitCounter = EDITORRMEND_QUIT_COUNTER;                \/\/ counter clicking for exit\n\n  int key = whatKey();                                               \/\/ read key\n\n  switch (key)\n  {\n    case '\\r':                                                       \/\/ if carriage return (Enter key)\n      setNewline();                                                   \/\/ set newline\n      break;\n\n    case CTRL_KEY('q'):\n      if (m_pCnfg->smear && sQuitCounter > 0)                        \/\/ if there is any changes and counter > 0\n      {\n        statusMsg(\"! File was changed and unsaved and data can be lost after exiting. \"\n                  \"Press Ctrl-Q %d more times to exit.\", sQuitCounter);\n        sQuitCounter--;                                              \/\/ counter decrement\n        return;\n      }\n      write(STDOUT_FILENO, \"\\x1b[2J\", 4);\n      write(STDOUT_FILENO, \"\\x1b[H\", 3);\n      exit(0);\n      break;\n\n    case CTRL_KEY('s'):\n      save();                                                       \/\/ TODO: save changes\n      break;\n\n    case HOME_KEY:\n    m_pCnfg->configX = 0;                                           \/\/ to the row beginning\n      break;\n\n    case END_KEY:\n      if (m_pCnfg->configY < m_pCnfg->rowCount)                     \/\/ if not last row\n        m_pCnfg->configX = m_pCnfg->pRowObj[m_pCnfg->configY].size; \/\/ to the end of row\n      break;\n\n    case CTRL_KEY('f'):\n      find();                                                       \/\/ find func\n      break;\n\n    case BACKSPACE:\n    case CTRL_KEY('h'):\n    case DELETE_KEY:\n      if (key == DELETE_KEY)\n        moveCursor(ARROW_RIGHT);                                    \/\/ move cursor right\n      deleteChar();                                                 \/\/ delete char\n      break;\n\n    \/\/ page up\/down\n    \/\/\n    case PAGE_UP:\n    case PAGE_DOWN:\n      {\n        if (key == PAGE_UP)\n        {\n          m_pCnfg->configY = m_pCnfg->disableRow;                    \/\/ move page up\n        }\n        else if (key == PAGE_DOWN)\n        {\n          m_pCnfg->configY = m_pCnfg->disableRow + m_pCnfg->enableRow - 1; \/\/ move page down\n          if (m_pCnfg->configY > m_pCnfg->rowCount)\n            m_pCnfg->configY = m_pCnfg->rowCount;\n        }\n\n        int times = m_pCnfg->enableRow;\n        while (times--)\n          moveCursor(key == PAGE_UP ? ARROW_UP : ARROW_DOWN);\n      }\n      break;\n\n    case ARROW_UP:\n    case ARROW_DOWN:\n    case ARROW_LEFT:\n    case ARROW_RIGHT:\n      moveCursor(key);\n      break;\n\n    case CTRL_KEY('l'):\n    case '\\x1b':\n      break;\n\n    default:\n      setChar(key);   \/\/ just write chars\n      break;\n  }\n\n  sQuitCounter = EDITORRMEND_QUIT_COUNTER;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"cnn\/shadow-params.h\"\n#include \"cnn\/tensor.h\"\n#include \"cnn\/aligned-mem-pool.h\"\n#include \"cnn\/model.h\"\n\nusing namespace std;\n\nnamespace cnn {\n\nShadowParameters::ShadowParameters(const Parameters& p) : h(p.values) {\n  h.v = (cnn::real*)cnn_mm_malloc(h.d.size() * sizeof(cnn::real), CNN_ALIGN);\n  TensorTools::Zero(h);\n}\n\nShadowLookupParameters::ShadowLookupParameters(const LookupParameters& lp) : h(lp.values) {\n  for (auto& t : h) {\n      t.v = (cnn::real*)cnn_mm_malloc(t.d.size() * sizeof(cnn::real), CNN_ALIGN);\n    TensorTools::Zero(t);\n  }\n}\n\nvector<ShadowParameters> AllocateShadowParameters(const Model& m) {\n  vector<ShadowParameters> v;\n  v.reserve(m.parameters_list().size());\n  for (auto& p : m.parameters_list())\n    v.emplace_back(*p);\n  return v;\n}\n\nvector<ShadowLookupParameters> AllocateShadowLookupParameters(const Model& m) {\n  vector<ShadowLookupParameters> v;\n  v.reserve(m.lookup_parameters_list().size());\n  for (auto& p : m.lookup_parameters_list())\n    v.emplace_back(*p);\n  return v;\n}\n\n} \/\/ namespace cnn\n\n<commit_msg>shadow parameters for lookup table is changed to use temp variables in GPU<commit_after>#include \"cnn\/shadow-params.h\"\n#include \"cnn\/tensor.h\"\n#include \"cnn\/aligned-mem-pool.h\"\n#include \"cnn\/model.h\"\n#include \"cnn\/cnn.h\"\n\nusing namespace std;\n\nnamespace cnn {\n\nShadowParameters::ShadowParameters(const Parameters& p) : h(p.values) {\n  h.v = (cnn::real*)cnn_mm_malloc(h.d.size() * sizeof(cnn::real), CNN_ALIGN);\n  TensorTools::Zero(h);\n}\n\nShadowLookupParameters::ShadowLookupParameters(const LookupParameters& lp) : h(lp.values) {\n#ifdef USE_CPU_FOR_LOOKUP_PARAM\n    bool busecpu = true;\n#else\n    bool busecpu = false;\n#endif\n    for (auto& t : h) {\n      t.v = (cnn::real*)cnn_mm_malloc(t.d.size() * sizeof(cnn::real), CNN_ALIGN, busecpu);\n#ifdef USE_CPU_FOR_LOOKUP_PARAM\n      t.m_device_id = CPUDEVICE; \/\/\/ for cpu\n#else\n      t.m_device_id = device_id;\n#endif\n      TensorTools::Zero(t);\n  }\n}\n\nvector<ShadowParameters> AllocateShadowParameters(const Model& m) {\n  vector<ShadowParameters> v;\n  v.reserve(m.parameters_list().size());\n  for (auto& p : m.parameters_list())\n    v.emplace_back(*p);\n  return v;\n}\n\nvector<ShadowLookupParameters> AllocateShadowLookupParameters(const Model& m) {\n  vector<ShadowLookupParameters> v;\n  v.reserve(m.lookup_parameters_list().size());\n  for (auto& p : m.lookup_parameters_list())\n    v.emplace_back(*p);\n  return v;\n}\n\n} \/\/ namespace cnn\n\n<|endoftext|>"}
{"text":"<commit_before>\/* http_header.cc\n   Mathieu Stefani, 19 August 2015\n\n   Implementation of common HTTP headers described by the RFC\n*\/\n\n#include <stdexcept>\n#include <iterator>\n#include <cstring>\n#include <iostream>\n\n#include <pistache\/http_header.h>\n#include <pistache\/common.h>\n#include <pistache\/http.h>\n#include <pistache\/stream.h>\n\nusing namespace std;\n\nnamespace Pistache {\nnamespace Http {\nnamespace Header {\n\nconst char* encodingString(Encoding encoding) {\n    switch (encoding) {\n    case Encoding::Gzip:\n        return \"gzip\";\n    case Encoding::Compress:\n        return \"compress\";\n    case Encoding::Deflate:\n        return \"deflate\";\n    case Encoding::Identity:\n        return \"identity\";\n    case Encoding::Chunked:\n        return \"chunked\";\n    case Encoding::Unknown:\n        return \"unknown\";\n    }\n\n    unreachable();\n}\n\nvoid\nHeader::parse(const std::string& data) {\n    parseRaw(data.c_str(), data.size());\n}\n\nvoid\nHeader::parseRaw(const char *str, size_t len) {\n    parse(std::string(str, len));\n}\n\nvoid\nAllow::parseRaw(const char* str, size_t len) {\n    UNUSED(str)\n    UNUSED(len)\n}\n\nvoid\nAllow::write(std::ostream& os) const {\n    \/* This puts an extra ',' at the end :\/\n    std::copy(std::begin(methods_), std::end(methods_),\n              std::ostream_iterator<Http::Method>(os, \", \"));\n    *\/\n\n    for (std::vector<Http::Method>::size_type i = 0; i < methods_.size(); ++i) {\n        os << methods_[i];\n        if (i < methods_.size() - 1) os << \", \";\n    }\n}\n\nvoid\nAllow::addMethod(Http::Method method) {\n    methods_.push_back(method);\n}\n\nvoid\nAllow::addMethods(std::initializer_list<Method> methods) {\n    std::copy(std::begin(methods), std::end(methods), std::back_inserter(methods_));\n}\n\nvoid\nAllow::addMethods(const std::vector<Http::Method>& methods)\n{\n    std::copy(std::begin(methods), std::end(methods), std::back_inserter(methods_));\n}\n\nCacheControl::CacheControl(Http::CacheDirective directive)\n{\n    directives_.push_back(directive);\n}\n\nvoid\nCacheControl::parseRaw(const char* str, size_t len) {\n    using Http::CacheDirective;\n\n    struct DirectiveValue {\n        const char* const str;\n        const size_t size;\n        CacheDirective::Directive repr;\n    };\n\n#define VALUE(divStr, enumValue) { divStr, sizeof(divStr) - 1, CacheDirective::enumValue }\n\n    static constexpr DirectiveValue TrivialDirectives[] = {\n        VALUE(\"no-cache\"        , NoCache        ),\n        VALUE(\"no-store\"        , NoStore        ),\n        VALUE(\"no-transform\"    , NoTransform    ),\n        VALUE(\"only-if-cached\"  , OnlyIfCached   ),\n        VALUE(\"public\"          , Public         ),\n        VALUE(\"private\"         , Private        ),\n        VALUE(\"must-revalidate\" , MustRevalidate ),\n        VALUE(\"proxy-revalidate\", ProxyRevalidate)\n    };\n\n    static constexpr DirectiveValue TimedDirectives[] = {\n        VALUE(\"max-age\"  , MaxAge  ),\n        VALUE(\"max-stale\", MaxStale),\n        VALUE(\"min-fresh\", MinFresh),\n        VALUE(\"s-maxage\" , SMaxAge )\n    };\n\n#undef VALUE\n\n    RawStreamBuf<> buf(const_cast<char *>(str), len);\n    StreamCursor cursor(&buf);\n\n    do {\n\n        bool found = false;\n        \/\/ First scan trivial directives\n        for (const auto& d: TrivialDirectives) {\n            if (match_raw(d.str, d.size, cursor)) {\n                directives_.push_back(CacheDirective(d.repr));\n                found = true;\n                break;\n            }\n        }\n\n        \/\/ Not found, let's try timed directives\n        if (!found) {\n            for (const auto& d: TimedDirectives) {\n                if (match_raw(d.str, d.size, cursor)) {\n                    if (!cursor.advance(1)) {\n                        throw std::runtime_error(\"Invalid caching directive, missing delta-seconds\");\n                    }\n\n                    char *end;\n                    const char* beg = cursor.offset();\n                    \/\/ @Security: if str is not \\0 terminated, there might be a situation\n                    \/\/ where strtol can overflow. Double-check that it's harmless and fix if not\n                    int secs = strtol(beg, &end, 10);\n                    cursor.advance(end - beg);\n                    if (!cursor.eof() && cursor.current() != ',') {\n                        throw std::runtime_error(\"Invalid caching directive, malformated delta-seconds\");\n                    }\n                    directives_.push_back(CacheDirective(d.repr, std::chrono::seconds(secs)));\n                    found = true;\n                    break;\n                }\n            }\n        }\n\n        if (!cursor.eof()) {\n            if (cursor.current() != ',') {\n                throw std::runtime_error(\"Invalid caching directive, expected a comma\");\n            }\n\n            int c;\n            while ((c = cursor.current()) != StreamCursor::Eof && (c == ',' || c == ' '))\n                cursor.advance(1);\n        }\n\n    } while (!cursor.eof());\n\n}\n\nvoid\nCacheControl::write(std::ostream& os) const {\n    using Http::CacheDirective;\n\n    auto directiveString = [](CacheDirective directive) -> const char* {\n        switch (directive.directive()) {\n            case CacheDirective::NoCache:\n                return \"no-cache\";\n            case CacheDirective::NoStore:\n                return \"no-store\";\n            case CacheDirective::NoTransform:\n                return \"no-transform\";\n            case CacheDirective::OnlyIfCached:\n                return \"only-if-cached\";\n            case CacheDirective::Public:\n                return \"public\";\n            case CacheDirective::Private:\n                return \"private\";\n            case CacheDirective::MustRevalidate:\n                return \"must-revalidate\";\n            case CacheDirective::ProxyRevalidate:\n                return \"proxy-revalidate\";\n            case CacheDirective::MaxAge:\n                return \"max-age\";\n            case CacheDirective::MaxStale:\n                return \"max-stale\";\n            case CacheDirective::MinFresh:\n                return \"min-fresh\";\n            case CacheDirective::SMaxAge:\n                return \"s-maxage\";\n            case CacheDirective::Ext:\n                return \"\";\n            default:\n                return \"\";\n        }\n        return \"\";\n    };\n\n    auto hasDelta = [](CacheDirective directive) {\n        switch (directive.directive()) {\n            case CacheDirective::MaxAge:\n            case CacheDirective::MaxStale:\n            case CacheDirective::MinFresh:\n            case CacheDirective::SMaxAge:\n                return true;\n            default:\n                return false;\n        }\n    };\n\n    for (std::vector<CacheDirective>::size_type i = 0; i < directives_.size(); ++i) {\n        const auto& d = directives_[i];\n        os << directiveString(d);\n        if (hasDelta(d)) {\n            auto delta = d.delta();\n            if (delta.count() > 0) {\n                os << \"=\" << delta.count();\n            }\n        }\n\n        if (i < directives_.size() - 1) {\n            os << \", \";\n        }\n    }\n\n\n}\n\nvoid\nCacheControl::addDirective(Http::CacheDirective directive) {\n    directives_.push_back(directive);\n}\n\nvoid\nCacheControl::addDirectives(const std::vector<Http::CacheDirective>& directives) {\n    std::copy(std::begin(directives), std::end(directives), std::back_inserter(directives_));\n}\n\nvoid\nConnection::parseRaw(const char* str, size_t len) {\n    char *p = const_cast<char *>(str);\n    RawStreamBuf<> buf(p, p + len);\n    StreamCursor cursor(&buf);\n\n#define STR(str) \\\n    str, sizeof(str) - 1\n\n    if (match_string(STR(\"close\"), cursor)) {\n        control_ = ConnectionControl::Close;\n    }\n    else if (match_string(STR(\"keep-alive\"), cursor)) {\n        control_ = ConnectionControl::KeepAlive;\n    }\n    else {\n        control_ = ConnectionControl::Ext;\n    }\n}\n\nvoid\nConnection::write(std::ostream& os) const {\n    switch (control_) {\n    case ConnectionControl::Close:\n        os << \"Close\";\n        break;\n    case ConnectionControl::KeepAlive:\n        os << \"Keep-Alive\";\n        break;\n    case ConnectionControl::Ext:\n        os << \"Ext\";\n        break;\n    }\n}\n\nvoid\nContentLength::parse(const std::string& data) {\n    try {\n        size_t pos;\n        uint64_t val = std::stoi(data, &pos);\n        if (pos != 0) {\n        }\n\n        value_ = val;\n    } catch (const std::invalid_argument& e) {\n    }\n}\n\nvoid\nContentLength::write(std::ostream& os) const {\n    os << value_;\n}\n\nvoid\nDate::parse(const std::string &str) {\n    fullDate_ = FullDate::fromString(str);\n}\n\nvoid\nDate::write(std::ostream& os) const {\n    UNUSED(os)\n}\n\nvoid\nExpect::parseRaw(const char* str, size_t len) {\n    if (memcmp(str, \"100-continue\", len)) {\n        expectation_ = Expectation::Continue;\n    } else {\n        expectation_ = Expectation::Ext;\n    }\n}\n\nvoid\nExpect::write(std::ostream& os) const {\n    if (expectation_ == Expectation::Continue) {\n        os << \"100-continue\";\n    }\n}\n\nHost::Host(const std::string& data)\n    : host_()\n    , port_(0)\n{\n    parse(data);\n}\n\nvoid\nHost::parse(const std::string& data) {\n    unsigned long pos = data.find(']');\n    unsigned long s_pos = data.find('[');\n    if (pos != std::string::npos && s_pos != std::string::npos) {\n        \/\/IPv6 address\n        host_ = data.substr(s_pos+1, pos-1);\n        pos++;\n    } else {\n        \/\/IPv4 address\n        pos = data.find(':');\n        if (pos == std::string::npos) {\n            host_ = data;\n            port_ = HTTP_STANDARD_PORT;\n        }\n        host_ = data.substr(0, pos);\n        if (host_ == \"*\") {\n            host_ = \"0.0.0.0\";\n        }\n    }\n    char *end;\n    const std::string portPart = data.substr(pos + 1);\n    long port;\n    if (portPart.empty()) {\n        port = HTTP_STANDARD_PORT;\n    }\n    else {\n        port = strtol(portPart.c_str(), &end, 10);\n    }\n    if (*end != 0 || port < Port::min() || port > Port::max())\n        throw std::invalid_argument(\"Invalid port\");\n    port_ = static_cast<uint16_t>(port);\n}\n\nvoid\nHost::write(std::ostream& os) const {\n    os << host_;\n    \/* @Clarity @Robustness: maybe a found a literal different than zero\n       to represent a null port ?\n    *\/\n    if (port_ != 0) {\n        os << \":\" << port_;\n    }\n}\n\nLocation::Location(const std::string& location)\n    : location_(location)\n{ }\n\nvoid\nLocation::parse(const std::string& data) {\n    location_ = data;\n}\n\nvoid\nLocation::write(std::ostream& os) const {\n    os << location_;\n}\n\nvoid\nUserAgent::parse(const std::string& data) {\n    ua_ = data;\n}\n\nvoid\nUserAgent::write(std::ostream& os) const {\n    os << ua_;\n}\n\nvoid\nAccept::parseRaw(const char *str, size_t len) {\n\n    RawStreamBuf<char> buf(const_cast<char *>(str), len);\n    StreamCursor cursor(&buf);\n\n    do {\n        int c;\n        size_t beg = cursor;\n        while ((c = cursor.next()) != StreamCursor::Eof && c != ',')\n            cursor.advance(1);\n\n        cursor.advance(1);\n\n        const size_t mimeLen = cursor.diff(beg);\n\n        mediaRange_.push_back(Mime::MediaType::fromRaw(cursor.offset(beg), mimeLen));\n\n        if (!cursor.eof()) {\n            if (!cursor.advance(1))\n                throw std::runtime_error(\"Ill-formed Accept header\");\n\n            if ((c = cursor.next()) == StreamCursor::Eof || c == ',' || c == 0)\n                throw std::runtime_error(\"Ill-formed Accept header\");\n\n            while (!cursor.eof() && cursor.current() == ' ')\n                cursor.advance(1);\n        }\n\n    } while (!cursor.eof());\n}\n\nvoid\nAccept::write(std::ostream& os) const {\n    UNUSED(os)\n}\n\nvoid\nAccessControlAllowOrigin::parse(const std::string& data) {\n  uri_ = data;\n}\n\nvoid\nAccessControlAllowOrigin::write(std::ostream& os) const {\n  os << uri_;\n}\n\nvoid\nAccessControlAllowHeaders::parse(const std::string& data) {\n  val_ = data;\n}\n\nvoid\nAccessControlAllowHeaders::write(std::ostream& os) const {\n  os << val_;\n}\n\nvoid\nEncodingHeader::parseRaw(const char* str, size_t len) {\n    if (!strncasecmp(str, \"gzip\", len)) {\n        encoding_ = Encoding::Gzip;\n    }\n    else if (!strncasecmp(str, \"deflate\", len)) {\n        encoding_ = Encoding::Deflate;\n    }\n    else if (!strncasecmp(str, \"compress\", len)) {\n        encoding_ = Encoding::Compress;\n    }\n    else if (!strncasecmp(str, \"identity\", len)) {\n        encoding_ = Encoding::Identity;\n    }\n    else if (!strncasecmp(str, \"chunked\", len)) {\n        encoding_ = Encoding::Chunked;\n    }\n    else {\n        encoding_ = Encoding::Unknown;\n    }\n}\n\nvoid\nEncodingHeader::write(std::ostream& os) const {\n    os << encodingString(encoding_);\n}\n\nServer::Server(const std::vector<std::string>& tokens)\n    : tokens_(tokens)\n{ }\n\nServer::Server(const std::string& token)\n    : tokens_()\n{\n    tokens_.push_back(token);\n}\n\nServer::Server(const char* token)\n   : tokens_()\n{\n    tokens_.emplace_back(token);\n}\n\nvoid\nServer::parse(const std::string& data)\n{\n    UNUSED(data)\n}\n\nvoid\nServer::write(std::ostream& os) const\n{\n    std::copy(std::begin(tokens_), std::end(tokens_),\n                 std::ostream_iterator<std::string>(os, \" \"));\n}\n\nvoid\nContentType::parseRaw(const char* str, size_t len)\n{\n    mime_.parseRaw(str, len);\n}\n\nvoid\nContentType::write(std::ostream& os) const {\n    os << mime_.toString();\n}\n\n} \/\/ namespace Header\n} \/\/ namespace Http\n} \/\/ namespace Pistache\n<commit_msg>Still attempting to fix \"Invalid port\" error<commit_after>\/* http_header.cc\n   Mathieu Stefani, 19 August 2015\n\n   Implementation of common HTTP headers described by the RFC\n*\/\n\n#include <stdexcept>\n#include <iterator>\n#include <limits>\n#include <cstring>\n#include <iostream>\n\n#include <pistache\/http_header.h>\n#include <pistache\/common.h>\n#include <pistache\/http.h>\n#include <pistache\/stream.h>\n\nusing namespace std;\n\nnamespace Pistache {\nnamespace Http {\nnamespace Header {\n\nconst char* encodingString(Encoding encoding) {\n    switch (encoding) {\n    case Encoding::Gzip:\n        return \"gzip\";\n    case Encoding::Compress:\n        return \"compress\";\n    case Encoding::Deflate:\n        return \"deflate\";\n    case Encoding::Identity:\n        return \"identity\";\n    case Encoding::Chunked:\n        return \"chunked\";\n    case Encoding::Unknown:\n        return \"unknown\";\n    }\n\n    unreachable();\n}\n\nvoid\nHeader::parse(const std::string& data) {\n    parseRaw(data.c_str(), data.size());\n}\n\nvoid\nHeader::parseRaw(const char *str, size_t len) {\n    parse(std::string(str, len));\n}\n\nvoid\nAllow::parseRaw(const char* str, size_t len) {\n    UNUSED(str)\n    UNUSED(len)\n}\n\nvoid\nAllow::write(std::ostream& os) const {\n    \/* This puts an extra ',' at the end :\/\n    std::copy(std::begin(methods_), std::end(methods_),\n              std::ostream_iterator<Http::Method>(os, \", \"));\n    *\/\n\n    for (std::vector<Http::Method>::size_type i = 0; i < methods_.size(); ++i) {\n        os << methods_[i];\n        if (i < methods_.size() - 1) os << \", \";\n    }\n}\n\nvoid\nAllow::addMethod(Http::Method method) {\n    methods_.push_back(method);\n}\n\nvoid\nAllow::addMethods(std::initializer_list<Method> methods) {\n    std::copy(std::begin(methods), std::end(methods), std::back_inserter(methods_));\n}\n\nvoid\nAllow::addMethods(const std::vector<Http::Method>& methods)\n{\n    std::copy(std::begin(methods), std::end(methods), std::back_inserter(methods_));\n}\n\nCacheControl::CacheControl(Http::CacheDirective directive)\n{\n    directives_.push_back(directive);\n}\n\nvoid\nCacheControl::parseRaw(const char* str, size_t len) {\n    using Http::CacheDirective;\n\n    struct DirectiveValue {\n        const char* const str;\n        const size_t size;\n        CacheDirective::Directive repr;\n    };\n\n#define VALUE(divStr, enumValue) { divStr, sizeof(divStr) - 1, CacheDirective::enumValue }\n\n    static constexpr DirectiveValue TrivialDirectives[] = {\n        VALUE(\"no-cache\"        , NoCache        ),\n        VALUE(\"no-store\"        , NoStore        ),\n        VALUE(\"no-transform\"    , NoTransform    ),\n        VALUE(\"only-if-cached\"  , OnlyIfCached   ),\n        VALUE(\"public\"          , Public         ),\n        VALUE(\"private\"         , Private        ),\n        VALUE(\"must-revalidate\" , MustRevalidate ),\n        VALUE(\"proxy-revalidate\", ProxyRevalidate)\n    };\n\n    static constexpr DirectiveValue TimedDirectives[] = {\n        VALUE(\"max-age\"  , MaxAge  ),\n        VALUE(\"max-stale\", MaxStale),\n        VALUE(\"min-fresh\", MinFresh),\n        VALUE(\"s-maxage\" , SMaxAge )\n    };\n\n#undef VALUE\n\n    RawStreamBuf<> buf(const_cast<char *>(str), len);\n    StreamCursor cursor(&buf);\n\n    do {\n\n        bool found = false;\n        \/\/ First scan trivial directives\n        for (const auto& d: TrivialDirectives) {\n            if (match_raw(d.str, d.size, cursor)) {\n                directives_.push_back(CacheDirective(d.repr));\n                found = true;\n                break;\n            }\n        }\n\n        \/\/ Not found, let's try timed directives\n        if (!found) {\n            for (const auto& d: TimedDirectives) {\n                if (match_raw(d.str, d.size, cursor)) {\n                    if (!cursor.advance(1)) {\n                        throw std::runtime_error(\"Invalid caching directive, missing delta-seconds\");\n                    }\n\n                    char *end;\n                    const char* beg = cursor.offset();\n                    \/\/ @Security: if str is not \\0 terminated, there might be a situation\n                    \/\/ where strtol can overflow. Double-check that it's harmless and fix if not\n                    int secs = strtol(beg, &end, 10);\n                    cursor.advance(end - beg);\n                    if (!cursor.eof() && cursor.current() != ',') {\n                        throw std::runtime_error(\"Invalid caching directive, malformated delta-seconds\");\n                    }\n                    directives_.push_back(CacheDirective(d.repr, std::chrono::seconds(secs)));\n                    found = true;\n                    break;\n                }\n            }\n        }\n\n        if (!cursor.eof()) {\n            if (cursor.current() != ',') {\n                throw std::runtime_error(\"Invalid caching directive, expected a comma\");\n            }\n\n            int c;\n            while ((c = cursor.current()) != StreamCursor::Eof && (c == ',' || c == ' '))\n                cursor.advance(1);\n        }\n\n    } while (!cursor.eof());\n\n}\n\nvoid\nCacheControl::write(std::ostream& os) const {\n    using Http::CacheDirective;\n\n    auto directiveString = [](CacheDirective directive) -> const char* {\n        switch (directive.directive()) {\n            case CacheDirective::NoCache:\n                return \"no-cache\";\n            case CacheDirective::NoStore:\n                return \"no-store\";\n            case CacheDirective::NoTransform:\n                return \"no-transform\";\n            case CacheDirective::OnlyIfCached:\n                return \"only-if-cached\";\n            case CacheDirective::Public:\n                return \"public\";\n            case CacheDirective::Private:\n                return \"private\";\n            case CacheDirective::MustRevalidate:\n                return \"must-revalidate\";\n            case CacheDirective::ProxyRevalidate:\n                return \"proxy-revalidate\";\n            case CacheDirective::MaxAge:\n                return \"max-age\";\n            case CacheDirective::MaxStale:\n                return \"max-stale\";\n            case CacheDirective::MinFresh:\n                return \"min-fresh\";\n            case CacheDirective::SMaxAge:\n                return \"s-maxage\";\n            case CacheDirective::Ext:\n                return \"\";\n            default:\n                return \"\";\n        }\n        return \"\";\n    };\n\n    auto hasDelta = [](CacheDirective directive) {\n        switch (directive.directive()) {\n            case CacheDirective::MaxAge:\n            case CacheDirective::MaxStale:\n            case CacheDirective::MinFresh:\n            case CacheDirective::SMaxAge:\n                return true;\n            default:\n                return false;\n        }\n    };\n\n    for (std::vector<CacheDirective>::size_type i = 0; i < directives_.size(); ++i) {\n        const auto& d = directives_[i];\n        os << directiveString(d);\n        if (hasDelta(d)) {\n            auto delta = d.delta();\n            if (delta.count() > 0) {\n                os << \"=\" << delta.count();\n            }\n        }\n\n        if (i < directives_.size() - 1) {\n            os << \", \";\n        }\n    }\n\n\n}\n\nvoid\nCacheControl::addDirective(Http::CacheDirective directive) {\n    directives_.push_back(directive);\n}\n\nvoid\nCacheControl::addDirectives(const std::vector<Http::CacheDirective>& directives) {\n    std::copy(std::begin(directives), std::end(directives), std::back_inserter(directives_));\n}\n\nvoid\nConnection::parseRaw(const char* str, size_t len) {\n    char *p = const_cast<char *>(str);\n    RawStreamBuf<> buf(p, p + len);\n    StreamCursor cursor(&buf);\n\n#define STR(str) \\\n    str, sizeof(str) - 1\n\n    if (match_string(STR(\"close\"), cursor)) {\n        control_ = ConnectionControl::Close;\n    }\n    else if (match_string(STR(\"keep-alive\"), cursor)) {\n        control_ = ConnectionControl::KeepAlive;\n    }\n    else {\n        control_ = ConnectionControl::Ext;\n    }\n}\n\nvoid\nConnection::write(std::ostream& os) const {\n    switch (control_) {\n    case ConnectionControl::Close:\n        os << \"Close\";\n        break;\n    case ConnectionControl::KeepAlive:\n        os << \"Keep-Alive\";\n        break;\n    case ConnectionControl::Ext:\n        os << \"Ext\";\n        break;\n    }\n}\n\nvoid\nContentLength::parse(const std::string& data) {\n    try {\n        size_t pos;\n        uint64_t val = std::stoi(data, &pos);\n        if (pos != 0) {\n        }\n\n        value_ = val;\n    } catch (const std::invalid_argument& e) {\n    }\n}\n\nvoid\nContentLength::write(std::ostream& os) const {\n    os << value_;\n}\n\nvoid\nDate::parse(const std::string &str) {\n    fullDate_ = FullDate::fromString(str);\n}\n\nvoid\nDate::write(std::ostream& os) const {\n    UNUSED(os)\n}\n\nvoid\nExpect::parseRaw(const char* str, size_t len) {\n    if (memcmp(str, \"100-continue\", len)) {\n        expectation_ = Expectation::Continue;\n    } else {\n        expectation_ = Expectation::Ext;\n    }\n}\n\nvoid\nExpect::write(std::ostream& os) const {\n    if (expectation_ == Expectation::Continue) {\n        os << \"100-continue\";\n    }\n}\n\nHost::Host(const std::string& data)\n    : host_()\n    , port_(0)\n{\n    parse(data);\n}\n\nvoid\nHost::parse(const std::string& data) {\n    unsigned long pos = data.find(']');\n    unsigned long s_pos = data.find('[');\n    if (pos != std::string::npos && s_pos != std::string::npos) {\n        \/\/IPv6 address\n        host_ = data.substr(s_pos+1, pos-1);\n        pos++;\n    } else {\n        \/\/IPv4 address\n        pos = data.find(':');\n        if (pos == std::string::npos) {\n            host_ = data;\n            port_ = HTTP_STANDARD_PORT;\n        }\n        host_ = data.substr(0, pos);\n        if (host_ == \"*\") {\n            host_ = \"0.0.0.0\";\n        }\n    }\n    char *end;\n    const std::string portPart = data.substr(pos + 1);\n    long port;\n    if (pos != std::string::npos) {\n        port = strtol(portPart.c_str(), &end, 10);\n        if (port < std::numeric_limits<uint16_t>::min()|| port > std::numeric_limits<uint16_t>::max())\n            throw std::invalid_argument(\"Invalid port\");\n        port_ = static_cast<uint16_t>(port);\n    } else {\n        port_ = HTTP_STANDARD_PORT;\n    }\n}\n\nvoid\nHost::write(std::ostream& os) const {\n    os << host_;\n    \/* @Clarity @Robustness: maybe a found a literal different than zero\n       to represent a null port ?\n    *\/\n    if (port_ != 0) {\n        os << \":\" << port_;\n    }\n}\n\nLocation::Location(const std::string& location)\n    : location_(location)\n{ }\n\nvoid\nLocation::parse(const std::string& data) {\n    location_ = data;\n}\n\nvoid\nLocation::write(std::ostream& os) const {\n    os << location_;\n}\n\nvoid\nUserAgent::parse(const std::string& data) {\n    ua_ = data;\n}\n\nvoid\nUserAgent::write(std::ostream& os) const {\n    os << ua_;\n}\n\nvoid\nAccept::parseRaw(const char *str, size_t len) {\n\n    RawStreamBuf<char> buf(const_cast<char *>(str), len);\n    StreamCursor cursor(&buf);\n\n    do {\n        int c;\n        size_t beg = cursor;\n        while ((c = cursor.next()) != StreamCursor::Eof && c != ',')\n            cursor.advance(1);\n\n        cursor.advance(1);\n\n        const size_t mimeLen = cursor.diff(beg);\n\n        mediaRange_.push_back(Mime::MediaType::fromRaw(cursor.offset(beg), mimeLen));\n\n        if (!cursor.eof()) {\n            if (!cursor.advance(1))\n                throw std::runtime_error(\"Ill-formed Accept header\");\n\n            if ((c = cursor.next()) == StreamCursor::Eof || c == ',' || c == 0)\n                throw std::runtime_error(\"Ill-formed Accept header\");\n\n            while (!cursor.eof() && cursor.current() == ' ')\n                cursor.advance(1);\n        }\n\n    } while (!cursor.eof());\n}\n\nvoid\nAccept::write(std::ostream& os) const {\n    UNUSED(os)\n}\n\nvoid\nAccessControlAllowOrigin::parse(const std::string& data) {\n  uri_ = data;\n}\n\nvoid\nAccessControlAllowOrigin::write(std::ostream& os) const {\n  os << uri_;\n}\n\nvoid\nAccessControlAllowHeaders::parse(const std::string& data) {\n  val_ = data;\n}\n\nvoid\nAccessControlAllowHeaders::write(std::ostream& os) const {\n  os << val_;\n}\n\nvoid\nEncodingHeader::parseRaw(const char* str, size_t len) {\n    if (!strncasecmp(str, \"gzip\", len)) {\n        encoding_ = Encoding::Gzip;\n    }\n    else if (!strncasecmp(str, \"deflate\", len)) {\n        encoding_ = Encoding::Deflate;\n    }\n    else if (!strncasecmp(str, \"compress\", len)) {\n        encoding_ = Encoding::Compress;\n    }\n    else if (!strncasecmp(str, \"identity\", len)) {\n        encoding_ = Encoding::Identity;\n    }\n    else if (!strncasecmp(str, \"chunked\", len)) {\n        encoding_ = Encoding::Chunked;\n    }\n    else {\n        encoding_ = Encoding::Unknown;\n    }\n}\n\nvoid\nEncodingHeader::write(std::ostream& os) const {\n    os << encodingString(encoding_);\n}\n\nServer::Server(const std::vector<std::string>& tokens)\n    : tokens_(tokens)\n{ }\n\nServer::Server(const std::string& token)\n    : tokens_()\n{\n    tokens_.push_back(token);\n}\n\nServer::Server(const char* token)\n   : tokens_()\n{\n    tokens_.emplace_back(token);\n}\n\nvoid\nServer::parse(const std::string& data)\n{\n    UNUSED(data)\n}\n\nvoid\nServer::write(std::ostream& os) const\n{\n    std::copy(std::begin(tokens_), std::end(tokens_),\n                 std::ostream_iterator<std::string>(os, \" \"));\n}\n\nvoid\nContentType::parseRaw(const char* str, size_t len)\n{\n    mime_.parseRaw(str, len);\n}\n\nvoid\nContentType::write(std::ostream& os) const {\n    os << mime_.toString();\n}\n\n} \/\/ namespace Header\n} \/\/ namespace Http\n} \/\/ namespace Pistache\n<|endoftext|>"}
{"text":"<commit_before>#include \"libtest.h\"\n\nusing namespace std;\n#include \"..\/lib\/json\/json.h\"\n\nvoid test_empty_dict(){\n\n    string message = \"{}\";\n\n    JsonValue * value = JsonValue::fromString(message);\n\n    ASSERT_NOT_NULL(value, \"Parsing null\");\n\n    JsonDict* dict_p = JDICT(value);\n    ASSERT_NOT_NULL(dict_p, \"Dict null\");\n\n    ASSERT(dict_p->size() == 0, \"Dict not null\");\n}\n\nvoid test_dict_one_val(){\n    string fix[] = {\n        \"{\\\"a\\\":\\\"b\\\"}\",\n        \"{\\\"a\\\" :\\\"b\\\"}\",\n        \"{\\\"a\\\": \\\"b\\\"}\",\n        \"{\\\"a\\\" : \\\"b\\\"}\",\n        \"{  \\\"a\\\"  :  \\\"b\\\"  }\"\n    };\n\n    for(int i=0; i < 5; i++){\n        string message = fix[i];\n\n        JsonValue * value = JsonValue::fromString(message);\n\n        ASSERT_NOT_NULL(value, \"Parsing null\");\n\n        JsonDict* dict_p = JDICT(value);\n        ASSERT_NOT_NULL(dict_p, \"Dict null\");\n\n        ASSERT(dict_p->size() == 1, \"Dict not null\");\n        ASSERT_EQUAL((string) *JSTRING((*dict_p)[\"a\"]), \"b\", \"d[a]!=b\");\n    }\n}\n\nvoid test_empty_list(){\n    string message = \"[]\";\n\n    JsonValue * value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing null\");\n\n    JsonList * list_p = JLIST(value);\n    ASSERT_NOT_NULL(list_p, \"List null\");\n\n    ASSERT(list_p->size() == 0, \"List not empty\");\n}\n\nvoid test_empty_string(){\n    string message = \"\\\"\\\"\";\n\n    JsonValue * value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n\n    JsonString* string_p = JSTRING(value);\n    ASSERT_NOT_NULL(string_p, \"String not null\");\n\n    ASSERT_EQUAL((string) *string_p, \"\", \"Empty string\");\n}\n\nvoid test_true_bool(){\n    string message = \"true\";\n\n    JsonValue* value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n\n    JsonBool * bool_p = JBOOL(value);\n    ASSERT_NOT_NULL(bool_p, \"Cast\");\n\n    ASSERT(*bool_p, \"Must be true\");\n}\n\nvoid test_false_bool(){\n    string message = \"false\";\n\n    JsonValue* value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n\n    JsonBool * bool_p = JBOOL(value);\n    ASSERT_NOT_NULL(bool_p, \"Cast\");\n\n    ASSERT_FALSE(*bool_p, \"Must be false\");\n}\n\nvoid test_null(){\n    string message = \"null\";\n\n    JsonValue* value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n\n    JsonNull* null_p = JNULL(value);\n    ASSERT_NOT_NULL(null_p, \"Cast to null\");\n\n    ASSERT_NULL(*null_p, \"Is null\");\n\n}\n\n#define TESTVEC {T(test_empty_dict), T(test_empty_list), T(test_empty_string), T(test_true_bool), T(test_false_bool), T(test_null), T(test_dict_one_val)}\nTEST();\n<commit_msg>Aff failing test (while parsing a user model)<commit_after>#include \"libtest.h\"\n\nusing namespace std;\n#include \"..\/lib\/json\/json.h\"\n\nvoid test_empty_dict(){\n\n    string message = \"{}\";\n\n    JsonValue * value = JsonValue::fromString(message);\n\n    ASSERT_NOT_NULL(value, \"Parsing null\");\n\n    JsonDict* dict_p = JDICT(value);\n    ASSERT_NOT_NULL(dict_p, \"Dict null\");\n\n    ASSERT(dict_p->size() == 0, \"Dict not null\");\n}\n\nvoid test_dict_one_val(){\n    string fix[] = {\n        \"{\\\"a\\\":\\\"b\\\"}\",\n        \"{\\\"a\\\" :\\\"b\\\"}\",\n        \"{\\\"a\\\": \\\"b\\\"}\",\n        \"{\\\"a\\\" : \\\"b\\\"}\",\n        \"{  \\\"a\\\"  :  \\\"b\\\"  }\"\n    };\n\n    for(int i=0; i < 5; i++){\n        string message = fix[i];\n\n        JsonValue * value = JsonValue::fromString(message);\n\n        ASSERT_NOT_NULL(value, \"Parsing null\");\n\n        JsonDict* dict_p = JDICT(value);\n        ASSERT_NOT_NULL(dict_p, \"Dict null\");\n\n        ASSERT(dict_p->size() == 1, \"Dict not null\");\n        ASSERT_EQUAL((string) *JSTRING((*dict_p)[\"a\"]), \"b\", \"d[a]!=b\");\n    }\n}\n\nvoid test_empty_list(){\n    string message = \"[]\";\n\n    JsonValue * value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing null\");\n\n    JsonList * list_p = JLIST(value);\n    ASSERT_NOT_NULL(list_p, \"List null\");\n\n    ASSERT(list_p->size() == 0, \"List not empty\");\n}\n\nvoid test_empty_string(){\n    string message = \"\\\"\\\"\";\n\n    JsonValue * value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n\n    JsonString* string_p = JSTRING(value);\n    ASSERT_NOT_NULL(string_p, \"String not null\");\n\n    ASSERT_EQUAL((string) *string_p, \"\", \"Empty string\");\n}\n\nvoid test_true_bool(){\n    string message = \"true\";\n\n    JsonValue* value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n\n    JsonBool * bool_p = JBOOL(value);\n    ASSERT_NOT_NULL(bool_p, \"Cast\");\n\n    ASSERT(*bool_p, \"Must be true\");\n}\n\nvoid test_false_bool(){\n    string message = \"false\";\n\n    JsonValue* value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n\n    JsonBool * bool_p = JBOOL(value);\n    ASSERT_NOT_NULL(bool_p, \"Cast\");\n\n    ASSERT_FALSE(*bool_p, \"Must be false\");\n}\n\nvoid test_null(){\n    string message = \"null\";\n\n    JsonValue* value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n\n    JsonNull* null_p = JNULL(value);\n    ASSERT_NOT_NULL(null_p, \"Cast to null\");\n\n    ASSERT_NULL(*null_p, \"Is null\");\n\n}\n\nvoid test_functionnal_user(){\n    string message = \"{\\n    \\\"username\\\": \\\"nikita\\\",\\n    \\\"name\\\": \\\"Nikita Marchant\\\",\\n    \\\"hash\\\": \\\"plop\\\",\\n    \\\"club\\\": {\\n        \\\"money\\\": 10,\\n        \\\"installations\\\" : [\\n            {\\\"level\\\": 1},\\n            {\\\"mevel\\\": 2},\\n            {\\\"wevel\\\": 3},\\n            {\\\"xevel\\\": 4},\\n            {\\\"cevel\\\": 5}\\n        ],\\n        \\\"team\\\": {\\n            \\\"players\\\" : [null, null, null, null, null, null, null]\\n        },\\n        \\\"players\\\": []\\n    }\\n}\\n\\n\";\n    JsonValue* value = JsonValue::fromString(message);\n    ASSERT_NOT_NULL(value, \"Parsing not null\");\n}\n\n#define TESTVEC {T(test_empty_dict), T(test_empty_list), T(test_empty_string), T(test_true_bool), T(test_false_bool), T(test_null), T(test_dict_one_val), T(test_functionnal_user)}\nTEST();\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2020 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 <gflags\/gflags.h>\n#include <glog\/logging.h>\n#include <sys\/times.h>\n#include <syscall.h>\n\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n\n#include \"pffft_sapi.sapi.h\"\n#include \"sandboxed_api\/util\/flag.h\"\n#include \"sandboxed_api\/vars.h\"\n\nABSL_DECLARE_FLAG(string, sandbox2_danger_danger_permit_all);\nABSL_DECLARE_FLAG(string, sandbox2_danger_danger_permit_all_and_log);\n\nclass PffftSapiSandbox : public PffftSandbox {\n public:\n  std::unique_ptr<sandbox2::Policy> ModifyPolicy(sandbox2::PolicyBuilder*) {\n    return sandbox2::PolicyBuilder()\n        .AllowStaticStartup()\n        .AllowOpen()\n        .AllowRead()\n        .AllowWrite()\n        .AllowSystemMalloc()\n        .AllowExit()\n        .AllowSyscalls({\n            __NR_futex,\n            __NR_close,\n            __NR_getrusage,\n        })\n        .BuildOrDie();\n  }\n};\n\n\/\/ output_format flag determines whether the output shows information in detail\n\/\/ or not. By default, the flag is set as 0, meaning an elaborate display\n\/\/ (see ShowOutput method).\nstatic bool ValidateFlag(const char* flagname, int32_t value) {\n  if (value >= 0 && value < 32768) {\n    return true;\n  }\n\n  LOG(ERROR) << \"Invalid value for --\" << flagname << \".\";\n  return false;\n}\n\nDEFINE_int32(output_format, 0, \"Value to specific the output format.\");\nDEFINE_validator(output_format, &ValidateFlag);\n\ndouble UclockSec() { return static_cast<double>(clock()) \/ CLOCKS_PER_SEC; }\n\nvoid ShowOutput(const char* name, int n, int complex, float flops, float t0,\n                float t1, int max_iter) {\n  float mflops = flops \/ 1e6 \/ (t1 - t0 + 1e-16);\n  if (FLAGS_output_format) {\n    if (flops != -1) {\n      printf(\"|%9.0f   \", mflops);\n    } else\n      printf(\"|      n\/a   \");\n  } else {\n    if (flops != -1) {\n      printf(\"n=%5d, %s %16s : %6.0f MFlops [t=%6.0f ns, %d runs]\\n\", n,\n             (complex ? \"CPLX\" : \"REAL\"), name, mflops,\n             (t1 - t0) \/ 2 \/ max_iter * 1e9, max_iter);\n    }\n  }\n  fflush(stdout);\n}\n\nabsl::Status PffftMain() {\n  LOG(INFO) << \"Initializing sandbox...\\n\";\n\n  PffftSapiSandbox sandbox;\n  SAPI_RETURN_IF_ERROR(sandbox.Init());\n\n  PffftApi api(&sandbox);\n\n  \/\/ kTransformSizes is a vector keeping the values by which iterates n, its\n  \/\/ value representing the input length. More concrete, n is the number of data\n  \/\/ points the caclulus is up to (determinating its accuracy). To show the\n  \/\/ performance of Fast-Fourier Transformations the program is testing for\n  \/\/ various values of n.\n  constexpr int kTransformSizes[] = {\n      64,      96,  128,  160,  192,  256,  384,  5 * 96,   512,   5 * 128,\n      3 * 256, 800, 1024, 2048, 2400, 4096, 8192, 9 * 1024, 16384, 32768};\n\n  for (int complex : {0, 1}) {\n    for (int n : kTransformSizes) {\n      const int n_float = n * (complex ? 2 : 1);\n      int n_bytes = n_float * sizeof(float);\n\n      std::vector<float> work(2 * n_float + 15, 0.0);\n      sapi::v::Array<float> work_array(&work[0], work.size());\n\n      std::vector<float> x(n_bytes, 0.0);\n      sapi::v::Array<float> x_array(&x[0], x.size());\n\n      std::vector<float> y(n_bytes, 0.0);\n      sapi::v::Array<float> y_array(&y[0], y.size());\n\n      std::vector<float> z(n_bytes, 0.0);\n      sapi::v::Array<float> z_array(&z[0], z.size());\n\n      double t0;\n      double t1;\n      double flops;\n\n      int max_iter = 5120000 \/ n * 4;\n\n      for (int k = 0; k < n_float; ++k) {\n        x[k] = 0;\n      }\n\n      \/\/ FFTPack benchmark\n      {\n        \/\/ SIMD_SZ == 4 (returning value of pffft_simd_size())\n        int simd_size_iter = max_iter \/ 4;\n\n        if (simd_size_iter == 0) simd_size_iter = 1;\n        if (complex) {\n          api.cffti(n, work_array.PtrBoth()).IgnoreError();\n        } else {\n          api.rffti(n, work_array.PtrBoth()).IgnoreError();\n        }\n        t0 = UclockSec();\n\n        for (int iter = 0; iter < simd_size_iter; ++iter) {\n          if (complex) {\n            api.cfftf(n, x_array.PtrBoth(), work_array.PtrBoth()).IgnoreError();\n            api.cfftb(n, x_array.PtrBoth(), work_array.PtrBoth()).IgnoreError();\n          } else {\n            api.rfftf(n, x_array.PtrBoth(), work_array.PtrBoth()).IgnoreError();\n            api.rfftb(n, x_array.PtrBoth(), work_array.PtrBoth()).IgnoreError();\n          }\n        }\n        t1 = UclockSec();\n\n        flops = (simd_size_iter * 2) *\n                ((complex ? 5 : 2.5) * n * log((double)n) \/ M_LN2);\n        ShowOutput(\"FFTPack\", n, complex, flops, t0, t1, simd_size_iter);\n      }\n\n      \/\/ PFFFT benchmark\n      {\n        sapi::StatusOr<PFFFT_Setup*> s =\n            api.pffft_new_setup(n, complex ? PFFFT_COMPLEX : PFFFT_REAL);\n\n        LOG(INFO) << \"Setup status is: \" << s.status().ToString();\n\n        if (!s.ok()) {\n          printf(\"Sandbox failed.\\n\");\n          return s.status();\n        }\n\n        sapi::v::RemotePtr s_reg(s.value());\n\n        t0 = UclockSec();\n        for (int iter = 0; iter < max_iter; ++iter) {\n          api.pffft_transform(&s_reg, x_array.PtrBoth(), z_array.PtrBoth(),\n                              y_array.PtrBoth(), PFFFT_FORWARD)\n              .IgnoreError();\n          api.pffft_transform(&s_reg, x_array.PtrBoth(), z_array.PtrBoth(),\n                              y_array.PtrBoth(), PFFFT_FORWARD)\n              .IgnoreError();\n        }\n\n        t1 = UclockSec();\n        api.pffft_destroy_setup(&s_reg).IgnoreError();\n\n        flops = (max_iter * 2) * ((complex ? 5 : 2.5) * static_cast<double>(n) *\n                                  log((double)n) \/ M_LN2);\n        ShowOutput(\"PFFFT\", n, complex, flops, t0, t1, max_iter);\n\n        LOG(INFO) << \"n = \" << n << \" SUCCESSFULLY\";\n      }\n    }\n  } \n\n  return absl::OkStatus();\n}\n\nint main(int argc, char* argv[]) {\n  \/\/ Initialize Google's logging library.\n  google::InitGoogleLogging(argv[0]);\n\n  gflags::ParseCommandLineFlags(&argc, &argv, true);\n\n  if (absl::Status status = PffftMain(); !status.ok()) {\n    LOG(ERROR) << \"Initialization failed: \" << status.ToString();\n    return EXIT_FAILURE;\n  }\n\n  return EXIT_SUCCESS;\n}<commit_msg>Setup error handling modified<commit_after>\/\/ Copyright 2020 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 <gflags\/gflags.h>\n#include <glog\/logging.h>\n#include <sys\/times.h>\n#include <syscall.h>\n\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n\n#include \"pffft_sapi.sapi.h\"\n#include \"sandboxed_api\/util\/flag.h\"\n#include \"sandboxed_api\/vars.h\"\n\nABSL_DECLARE_FLAG(string, sandbox2_danger_danger_permit_all);\nABSL_DECLARE_FLAG(string, sandbox2_danger_danger_permit_all_and_log);\n\nclass PffftSapiSandbox : public PffftSandbox {\n public:\n  std::unique_ptr<sandbox2::Policy> ModifyPolicy(sandbox2::PolicyBuilder*) {\n    return sandbox2::PolicyBuilder()\n        .AllowStaticStartup()\n        .AllowOpen()\n        .AllowRead()\n        .AllowWrite()\n        .AllowSystemMalloc()\n        .AllowExit()\n        .AllowSyscalls({\n            __NR_futex,\n            __NR_close,\n            __NR_getrusage,\n        })\n        .BuildOrDie();\n  }\n};\n\n\/\/ output_format flag determines whether the output shows information in detail\n\/\/ or not. By default, the flag is set as 0, meaning an elaborate display\n\/\/ (see ShowOutput method).\nstatic bool ValidateFlag(const char* flagname, int32_t value) {\n  if (value >= 0 && value < 32768) {\n    return true;\n  }\n\n  LOG(ERROR) << \"Invalid value for --\" << flagname << \".\";\n  return false;\n}\n\nDEFINE_int32(output_format, 0, \"Value to specific the output format.\");\nDEFINE_validator(output_format, &ValidateFlag);\n\ndouble UclockSec() { return static_cast<double>(clock()) \/ CLOCKS_PER_SEC; }\n\nvoid ShowOutput(const char* name, int n, int complex, float flops, float t0,\n                float t1, int max_iter) {\n  float mflops = flops \/ 1e6 \/ (t1 - t0 + 1e-16);\n  if (FLAGS_output_format) {\n    if (flops != -1) {\n      printf(\"|%9.0f   \", mflops);\n    } else\n      printf(\"|      n\/a   \");\n  } else {\n    if (flops != -1) {\n      printf(\"n=%5d, %s %16s : %6.0f MFlops [t=%6.0f ns, %d runs]\\n\", n,\n             (complex ? \"CPLX\" : \"REAL\"), name, mflops,\n             (t1 - t0) \/ 2 \/ max_iter * 1e9, max_iter);\n    }\n  }\n  fflush(stdout);\n}\n\nabsl::Status PffftMain() {\n  LOG(INFO) << \"Initializing sandbox...\\n\";\n\n  PffftSapiSandbox sandbox;\n  SAPI_RETURN_IF_ERROR(sandbox.Init());\n\n  PffftApi api(&sandbox);\n\n  \/\/ kTransformSizes is a vector keeping the values by which iterates n, its\n  \/\/ value representing the input length. More concrete, n is the number of data\n  \/\/ points the caclulus is up to (determinating its accuracy). To show the\n  \/\/ performance of Fast-Fourier Transformations the program is testing for\n  \/\/ various values of n.\n  constexpr int kTransformSizes[] = {\n      64,      96,  128,  160,  192,  256,  384,  5 * 96,   512,   5 * 128,\n      3 * 256, 800, 1024, 2048, 2400, 4096, 8192, 9 * 1024, 16384, 32768};\n\n  for (int complex : {0, 1}) {\n    for (int n : kTransformSizes) {\n      const int n_float = n * (complex ? 2 : 1);\n      int n_bytes = n_float * sizeof(float);\n\n      std::vector<float> work(2 * n_float + 15, 0.0);\n      sapi::v::Array<float> work_array(&work[0], work.size());\n\n      std::vector<float> x(n_bytes, 0.0);\n      sapi::v::Array<float> x_array(&x[0], x.size());\n\n      std::vector<float> y(n_bytes, 0.0);\n      sapi::v::Array<float> y_array(&y[0], y.size());\n\n      std::vector<float> z(n_bytes, 0.0);\n      sapi::v::Array<float> z_array(&z[0], z.size());\n\n      double t0;\n      double t1;\n      double flops;\n\n      int max_iter = 5120000 \/ n * 4;\n\n      for (int k = 0; k < n_float; ++k) {\n        x[k] = 0;\n      }\n\n      \/\/ FFTPack benchmark\n      {\n        \/\/ SIMD_SZ == 4 (returning value of pffft_simd_size())\n        int simd_size_iter = max_iter \/ 4;\n\n        if (simd_size_iter == 0) simd_size_iter = 1;\n        if (complex) {\n          api.cffti(n, work_array.PtrBoth()).IgnoreError();\n        } else {\n          api.rffti(n, work_array.PtrBoth()).IgnoreError();\n        }\n        t0 = UclockSec();\n\n        for (int iter = 0; iter < simd_size_iter; ++iter) {\n          if (complex) {\n            api.cfftf(n, x_array.PtrBoth(), work_array.PtrBoth()).IgnoreError();\n            api.cfftb(n, x_array.PtrBoth(), work_array.PtrBoth()).IgnoreError();\n          } else {\n            api.rfftf(n, x_array.PtrBoth(), work_array.PtrBoth()).IgnoreError();\n            api.rfftb(n, x_array.PtrBoth(), work_array.PtrBoth()).IgnoreError();\n          }\n        }\n        t1 = UclockSec();\n\n        flops = (simd_size_iter * 2) *\n                ((complex ? 5 : 2.5) * n * log((double)n) \/ M_LN2);\n        ShowOutput(\"FFTPack\", n, complex, flops, t0, t1, simd_size_iter);\n      }\n\n      \/\/ PFFFT benchmark\n      {\n        SAPI_ASSIGN_OR_RETURN(\n            PFFFT_Setup *s,\n            api.pffft_new_setup(n, complex ? PFFFT_COMPLEX : PFFFT_REAL));\n\n        sapi::v::RemotePtr s_reg(s);\n\n        t0 = UclockSec();\n        for (int iter = 0; iter < max_iter; ++iter) {\n          api.pffft_transform(&s_reg, x_array.PtrBoth(), z_array.PtrBoth(),\n                              y_array.PtrBoth(), PFFFT_FORWARD)\n              .IgnoreError();\n          api.pffft_transform(&s_reg, x_array.PtrBoth(), z_array.PtrBoth(),\n                              y_array.PtrBoth(), PFFFT_FORWARD)\n              .IgnoreError();\n        }\n\n        t1 = UclockSec();\n        api.pffft_destroy_setup(&s_reg).IgnoreError();\n\n        flops = (max_iter * 2) * ((complex ? 5 : 2.5) * static_cast<double>(n) *\n                                  log((double)n) \/ M_LN2);\n        ShowOutput(\"PFFFT\", n, complex, flops, t0, t1, max_iter);\n\n        LOG(INFO) << \"n = \" << n << \" SUCCESSFULLY\";\n      }\n    }\n  }\n\n  return absl::OkStatus();\n}\n\nint main(int argc, char* argv[]) {\n  \/\/ Initialize Google's logging library.\n  google::InitGoogleLogging(argv[0]);\n\n  gflags::ParseCommandLineFlags(&argc, &argv, true);\n\n  if (absl::Status status = PffftMain(); !status.ok()) {\n    LOG(ERROR) << \"Initialization failed: \" << status.ToString();\n    return EXIT_FAILURE;\n  }\n\n  return EXIT_SUCCESS;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2015 Cloudius Systems\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 \"types.hh\"\n#include \"net\/byteorder.hh\"\n#include \"core\/unaligned.hh\"\n#include \"hashing.hh\"\n\n\/**\n * Utility for writing data into a buffer when its final size is not known up front.\n *\n * Internally the data is written into a chain of chunks allocated on-demand.\n * No resizing of previously written data happens.\n *\n *\/\nclass bytes_ostream {\npublic:\n    using size_type = bytes::size_type;\n    using value_type = bytes::value_type;\nprivate:\n    static_assert(sizeof(value_type) == 1, \"value_type is assumed to be one byte long\");\n    struct chunk {\n        \/\/ FIXME: group fragment pointers to reduce pointer chasing when packetizing\n        std::unique_ptr<chunk> next;\n        size_type offset; \/\/ Also means \"size\" after chunk is closed\n        size_type size;\n        value_type data[0];\n        void operator delete(void* ptr) { free(ptr); }\n    };\n    \/\/ FIXME: consider increasing chunk size as the buffer grows\n    static constexpr size_type chunk_size{512};\n    static constexpr size_type usable_chunk_size{chunk_size - sizeof(chunk)};\nprivate:\n    std::unique_ptr<chunk> _begin;\n    chunk* _current;\n    size_type _size;\npublic:\n    class fragment_iterator : public std::iterator<std::input_iterator_tag, bytes_view> {\n        chunk* _current;\n    public:\n        fragment_iterator(chunk* current) : _current(current) {}\n        fragment_iterator(const fragment_iterator&) = default;\n        fragment_iterator& operator=(const fragment_iterator&) = default;\n        bytes_view operator*() const {\n            return { _current->data, _current->offset };\n        }\n        bytes_view operator->() const {\n            return *(*this);\n        }\n        fragment_iterator& operator++() {\n            _current = _current->next.get();\n            return *this;\n        }\n        fragment_iterator operator++(int) {\n            fragment_iterator tmp(*this);\n            ++(*this);\n            return tmp;\n        }\n        bool operator==(const fragment_iterator& other) const {\n            return _current == other._current;\n        }\n        bool operator!=(const fragment_iterator& other) const {\n            return _current != other._current;\n        }\n    };\nprivate:\n    inline size_type current_space_left() const {\n        if (!_current) {\n            return 0;\n        }\n        return _current->size - _current->offset;\n    }\n    \/\/ Makes room for a contiguous region of given size.\n    \/\/ The region is accounted for as already written.\n    \/\/ size must not be zero.\n    value_type* alloc(size_type size) {\n        if (size <= current_space_left()) {\n            auto ret = _current->data + _current->offset;\n            _current->offset += size;\n            _size += size;\n            return ret;\n        } else {\n            auto alloc_size = size <= usable_chunk_size ? chunk_size : (size + sizeof(chunk));\n            auto space = malloc(alloc_size);\n            if (!space) {\n                throw std::bad_alloc();\n            }\n            auto new_chunk = std::unique_ptr<chunk>(new (space) chunk());\n            new_chunk->offset = size;\n            new_chunk->size = alloc_size - sizeof(chunk);\n            if (_current) {\n                _current->next = std::move(new_chunk);\n                _current = _current->next.get();\n            } else {\n                _begin = std::move(new_chunk);\n                _current = _begin.get();\n            }\n            _size += size;\n            return _current->data;\n        };\n    }\npublic:\n    bytes_ostream() noexcept\n        : _begin()\n        , _current(nullptr)\n        , _size(0)\n    { }\n\n    bytes_ostream(bytes_ostream&& o) noexcept\n        : _begin(std::move(o._begin))\n        , _current(o._current)\n        , _size(o._size)\n    {\n        o._current = nullptr;\n        o._size = 0;\n    }\n\n    bytes_ostream(const bytes_ostream& o)\n        : _begin()\n        , _current(nullptr)\n        , _size(0)\n    {\n        append(o);\n    }\n\n    bytes_ostream& operator=(const bytes_ostream& o) {\n        _size = 0;\n        _current = nullptr;\n        _begin = {};\n        append(o);\n        return *this;\n    }\n\n    bytes_ostream& operator=(bytes_ostream&& o) noexcept {\n        _size = o._size;\n        _begin = std::move(o._begin);\n        _current = o._current;\n        o._current = nullptr;\n        o._size = 0;\n        return *this;\n    }\n\n    template <typename T>\n    struct place_holder {\n        value_type* ptr;\n    };\n\n    \/\/ Writes given values in big-endian format\n    template <typename T>\n    inline\n    std::enable_if_t<std::is_fundamental<T>::value, void>\n    write(T val) {\n        *reinterpret_cast<unaligned<T>*>(alloc(sizeof(T))) = net::hton(val);\n    }\n\n    \/\/ Returns a place holder for a value to be written later.\n    template <typename T>\n    inline\n    std::enable_if_t<std::is_fundamental<T>::value, place_holder<T>>\n    write_place_holder() {\n        return place_holder<T>{alloc(sizeof(T))};\n    }\n\n    value_type* write_place_holder(size_type size) {\n        return alloc(size);\n    }\n\n    \/\/ Writes given sequence of bytes\n    inline void write(bytes_view v) {\n        if (v.empty()) {\n            return;\n        }\n        auto space_left = current_space_left();\n        if (v.size() <= space_left) {\n            memcpy(_current->data + _current->offset, v.begin(), v.size());\n            _current->offset += v.size();\n            _size += v.size();\n        } else {\n            if (space_left) {\n                memcpy(_current->data + _current->offset, v.begin(), space_left);\n                _current->offset += space_left;\n                _size += space_left;\n                v.remove_prefix(space_left);\n            }\n            memcpy(alloc(v.size()), v.begin(), v.size());\n        }\n    }\n\n    void write(const char* ptr, size_t size) {\n        write(bytes_view(reinterpret_cast<const signed char*>(ptr), size));\n    }\n\n    \/\/ Writes given sequence of bytes with a preceding length component encoded in big-endian format\n    inline void write_blob(bytes_view v) {\n        assert((size_type)v.size() == v.size());\n        write<size_type>(v.size());\n        write(v);\n    }\n\n    \/\/ Writes given value into the place holder in big-endian format\n    template <typename T>\n    inline void set(place_holder<T> ph, T val) {\n        *reinterpret_cast<unaligned<T>*>(ph.ptr) = net::hton(val);\n    }\n\n    bool is_linearized() const {\n        return !_begin || !_begin->next;\n    }\n\n    \/\/ Call only when is_linearized()\n    bytes_view view() const {\n        assert(is_linearized());\n        if (!_current) {\n            return bytes_view();\n        }\n\n        return bytes_view(_current->data, _size);\n    }\n\n    \/\/ Makes the underlying storage contiguous and returns a view to it.\n    \/\/ Invalidates all previously created placeholders.\n    bytes_view linearize() {\n        if (is_linearized()) {\n            return view();\n        }\n\n        auto space = malloc(_size + sizeof(chunk));\n        if (!space) {\n            throw std::bad_alloc();\n        }\n\n        auto new_chunk = std::unique_ptr<chunk>(new (space) chunk());\n        new_chunk->offset = _size;\n        new_chunk->size = _size;\n\n        auto dst = new_chunk->data;\n        auto r = _begin.get();\n        while (r) {\n            auto next = r->next.get();\n            dst = std::copy_n(r->data, r->offset, dst);\n            r = next;\n        }\n\n        _current = new_chunk.get();\n        _begin = std::move(new_chunk);\n        return bytes_view(_current->data, _size);\n    }\n\n    \/\/ Returns the amount of bytes written so far\n    size_type size() const {\n        return _size;\n    }\n\n    bool empty() const {\n        return _size == 0;\n    }\n\n    void reserve(size_t size) {\n        \/\/ FIXME: implement\n    }\n\n    void append(const bytes_ostream& o) {\n        if (o.size() > 0) {\n            auto dst = alloc(o.size());\n            auto r = o._begin.get();\n            while (r) {\n                dst = std::copy_n(r->data, r->offset, dst);\n                r = r->next.get();\n            }\n        }\n    }\n\n    \/\/ begin() and end() form an input range to bytes_view representing fragments.\n    \/\/ Any modification of this instance invalidates iterators.\n    fragment_iterator begin() const { return { _begin.get() }; }\n    fragment_iterator end() const { return { nullptr }; }\n\n    boost::iterator_range<fragment_iterator> fragments() const {\n        return { begin(), end() };\n    }\n\n    struct position {\n        chunk* _chunk;\n        size_type _offset;\n    };\n\n    position pos() const {\n        return { _current, _current ? _current->offset : 0 };\n    }\n\n    \/\/ Returns the amount of bytes written since given position.\n    \/\/ \"pos\" must be valid.\n    size_type written_since(position pos) {\n        chunk* c = pos._chunk;\n        if (!c) {\n            return _size;\n        }\n        size_type total = c->offset - pos._offset;\n        c = c->next.get();\n        while (c) {\n            total += c->offset;\n            c = c->next.get();\n        }\n        return total;\n    }\n\n    \/\/ Rollbacks all data written after \"pos\".\n    \/\/ Invalidates all placeholders and positions created after \"pos\".\n    void retract(position pos) {\n        if (!pos._chunk) {\n            *this = {};\n            return;\n        }\n        _size -= written_since(pos);\n        _current = pos._chunk;\n        _current->next = nullptr;\n        _current->offset = pos._offset;\n    }\n};\n\ntemplate<>\nstruct appending_hash<bytes_ostream> {\n    template<typename Hasher>\n    void operator()(Hasher& h, const bytes_ostream& b) const {\n        for (auto&& frag : b.fragments()) {\n            feed_hash(h, frag);\n        }\n    }\n};\n<commit_msg>bytes_ostream: Allow place holder return a stream<commit_after>\/*\n * Copyright 2015 Cloudius Systems\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 \"types.hh\"\n#include \"net\/byteorder.hh\"\n#include \"core\/unaligned.hh\"\n#include \"hashing.hh\"\n#include \"seastar\/core\/simple-stream.hh\"\n\/**\n * Utility for writing data into a buffer when its final size is not known up front.\n *\n * Internally the data is written into a chain of chunks allocated on-demand.\n * No resizing of previously written data happens.\n *\n *\/\nclass bytes_ostream {\npublic:\n    using size_type = bytes::size_type;\n    using value_type = bytes::value_type;\nprivate:\n    static_assert(sizeof(value_type) == 1, \"value_type is assumed to be one byte long\");\n    struct chunk {\n        \/\/ FIXME: group fragment pointers to reduce pointer chasing when packetizing\n        std::unique_ptr<chunk> next;\n        size_type offset; \/\/ Also means \"size\" after chunk is closed\n        size_type size;\n        value_type data[0];\n        void operator delete(void* ptr) { free(ptr); }\n    };\n    \/\/ FIXME: consider increasing chunk size as the buffer grows\n    static constexpr size_type chunk_size{512};\n    static constexpr size_type usable_chunk_size{chunk_size - sizeof(chunk)};\nprivate:\n    std::unique_ptr<chunk> _begin;\n    chunk* _current;\n    size_type _size;\npublic:\n    class fragment_iterator : public std::iterator<std::input_iterator_tag, bytes_view> {\n        chunk* _current;\n    public:\n        fragment_iterator(chunk* current) : _current(current) {}\n        fragment_iterator(const fragment_iterator&) = default;\n        fragment_iterator& operator=(const fragment_iterator&) = default;\n        bytes_view operator*() const {\n            return { _current->data, _current->offset };\n        }\n        bytes_view operator->() const {\n            return *(*this);\n        }\n        fragment_iterator& operator++() {\n            _current = _current->next.get();\n            return *this;\n        }\n        fragment_iterator operator++(int) {\n            fragment_iterator tmp(*this);\n            ++(*this);\n            return tmp;\n        }\n        bool operator==(const fragment_iterator& other) const {\n            return _current == other._current;\n        }\n        bool operator!=(const fragment_iterator& other) const {\n            return _current != other._current;\n        }\n    };\nprivate:\n    inline size_type current_space_left() const {\n        if (!_current) {\n            return 0;\n        }\n        return _current->size - _current->offset;\n    }\n    \/\/ Makes room for a contiguous region of given size.\n    \/\/ The region is accounted for as already written.\n    \/\/ size must not be zero.\n    value_type* alloc(size_type size) {\n        if (size <= current_space_left()) {\n            auto ret = _current->data + _current->offset;\n            _current->offset += size;\n            _size += size;\n            return ret;\n        } else {\n            auto alloc_size = size <= usable_chunk_size ? chunk_size : (size + sizeof(chunk));\n            auto space = malloc(alloc_size);\n            if (!space) {\n                throw std::bad_alloc();\n            }\n            auto new_chunk = std::unique_ptr<chunk>(new (space) chunk());\n            new_chunk->offset = size;\n            new_chunk->size = alloc_size - sizeof(chunk);\n            if (_current) {\n                _current->next = std::move(new_chunk);\n                _current = _current->next.get();\n            } else {\n                _begin = std::move(new_chunk);\n                _current = _begin.get();\n            }\n            _size += size;\n            return _current->data;\n        };\n    }\npublic:\n    bytes_ostream() noexcept\n        : _begin()\n        , _current(nullptr)\n        , _size(0)\n    { }\n\n    bytes_ostream(bytes_ostream&& o) noexcept\n        : _begin(std::move(o._begin))\n        , _current(o._current)\n        , _size(o._size)\n    {\n        o._current = nullptr;\n        o._size = 0;\n    }\n\n    bytes_ostream(const bytes_ostream& o)\n        : _begin()\n        , _current(nullptr)\n        , _size(0)\n    {\n        append(o);\n    }\n\n    bytes_ostream& operator=(const bytes_ostream& o) {\n        _size = 0;\n        _current = nullptr;\n        _begin = {};\n        append(o);\n        return *this;\n    }\n\n    bytes_ostream& operator=(bytes_ostream&& o) noexcept {\n        _size = o._size;\n        _begin = std::move(o._begin);\n        _current = o._current;\n        o._current = nullptr;\n        o._size = 0;\n        return *this;\n    }\n\n    template <typename T>\n    struct place_holder {\n        value_type* ptr;\n        \/\/ makes the place_holder looks like a stream\n        seastar::simple_output_stream get_stream() {\n            return seastar::simple_output_stream{reinterpret_cast<char*>(ptr)};\n        }\n    };\n\n    \/\/ Writes given values in big-endian format\n    template <typename T>\n    inline\n    std::enable_if_t<std::is_fundamental<T>::value, void>\n    write(T val) {\n        *reinterpret_cast<unaligned<T>*>(alloc(sizeof(T))) = net::hton(val);\n    }\n\n    \/\/ Returns a place holder for a value to be written later.\n    template <typename T>\n    inline\n    std::enable_if_t<std::is_fundamental<T>::value, place_holder<T>>\n    write_place_holder() {\n        return place_holder<T>{alloc(sizeof(T))};\n    }\n\n    value_type* write_place_holder(size_type size) {\n        return alloc(size);\n    }\n\n    \/\/ Writes given sequence of bytes\n    inline void write(bytes_view v) {\n        if (v.empty()) {\n            return;\n        }\n        auto space_left = current_space_left();\n        if (v.size() <= space_left) {\n            memcpy(_current->data + _current->offset, v.begin(), v.size());\n            _current->offset += v.size();\n            _size += v.size();\n        } else {\n            if (space_left) {\n                memcpy(_current->data + _current->offset, v.begin(), space_left);\n                _current->offset += space_left;\n                _size += space_left;\n                v.remove_prefix(space_left);\n            }\n            memcpy(alloc(v.size()), v.begin(), v.size());\n        }\n    }\n\n    void write(const char* ptr, size_t size) {\n        write(bytes_view(reinterpret_cast<const signed char*>(ptr), size));\n    }\n\n    \/\/ Writes given sequence of bytes with a preceding length component encoded in big-endian format\n    inline void write_blob(bytes_view v) {\n        assert((size_type)v.size() == v.size());\n        write<size_type>(v.size());\n        write(v);\n    }\n\n    \/\/ Writes given value into the place holder in big-endian format\n    template <typename T>\n    inline void set(place_holder<T> ph, T val) {\n        *reinterpret_cast<unaligned<T>*>(ph.ptr) = net::hton(val);\n    }\n\n    bool is_linearized() const {\n        return !_begin || !_begin->next;\n    }\n\n    \/\/ Call only when is_linearized()\n    bytes_view view() const {\n        assert(is_linearized());\n        if (!_current) {\n            return bytes_view();\n        }\n\n        return bytes_view(_current->data, _size);\n    }\n\n    \/\/ Makes the underlying storage contiguous and returns a view to it.\n    \/\/ Invalidates all previously created placeholders.\n    bytes_view linearize() {\n        if (is_linearized()) {\n            return view();\n        }\n\n        auto space = malloc(_size + sizeof(chunk));\n        if (!space) {\n            throw std::bad_alloc();\n        }\n\n        auto new_chunk = std::unique_ptr<chunk>(new (space) chunk());\n        new_chunk->offset = _size;\n        new_chunk->size = _size;\n\n        auto dst = new_chunk->data;\n        auto r = _begin.get();\n        while (r) {\n            auto next = r->next.get();\n            dst = std::copy_n(r->data, r->offset, dst);\n            r = next;\n        }\n\n        _current = new_chunk.get();\n        _begin = std::move(new_chunk);\n        return bytes_view(_current->data, _size);\n    }\n\n    \/\/ Returns the amount of bytes written so far\n    size_type size() const {\n        return _size;\n    }\n\n    bool empty() const {\n        return _size == 0;\n    }\n\n    void reserve(size_t size) {\n        \/\/ FIXME: implement\n    }\n\n    void append(const bytes_ostream& o) {\n        if (o.size() > 0) {\n            auto dst = alloc(o.size());\n            auto r = o._begin.get();\n            while (r) {\n                dst = std::copy_n(r->data, r->offset, dst);\n                r = r->next.get();\n            }\n        }\n    }\n\n    \/\/ begin() and end() form an input range to bytes_view representing fragments.\n    \/\/ Any modification of this instance invalidates iterators.\n    fragment_iterator begin() const { return { _begin.get() }; }\n    fragment_iterator end() const { return { nullptr }; }\n\n    boost::iterator_range<fragment_iterator> fragments() const {\n        return { begin(), end() };\n    }\n\n    struct position {\n        chunk* _chunk;\n        size_type _offset;\n    };\n\n    position pos() const {\n        return { _current, _current ? _current->offset : 0 };\n    }\n\n    \/\/ Returns the amount of bytes written since given position.\n    \/\/ \"pos\" must be valid.\n    size_type written_since(position pos) {\n        chunk* c = pos._chunk;\n        if (!c) {\n            return _size;\n        }\n        size_type total = c->offset - pos._offset;\n        c = c->next.get();\n        while (c) {\n            total += c->offset;\n            c = c->next.get();\n        }\n        return total;\n    }\n\n    \/\/ Rollbacks all data written after \"pos\".\n    \/\/ Invalidates all placeholders and positions created after \"pos\".\n    void retract(position pos) {\n        if (!pos._chunk) {\n            *this = {};\n            return;\n        }\n        _size -= written_since(pos);\n        _current = pos._chunk;\n        _current->next = nullptr;\n        _current->offset = pos._offset;\n    }\n};\n\ntemplate<>\nstruct appending_hash<bytes_ostream> {\n    template<typename Hasher>\n    void operator()(Hasher& h, const bytes_ostream& b) const {\n        for (auto&& frag : b.fragments()) {\n            feed_hash(h, frag);\n        }\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#ifndef CONTAINERS_SCOPED_HPP_\n#define CONTAINERS_SCOPED_HPP_\n\n#include <string.h>\n\n#include <utility>\n\n#include \"errors.hpp\"\n\n\/\/ Like boost::scoped_ptr only with release, init, no bool conversion, no boost headers!\ntemplate <class T>\nclass scoped_ptr_t {\npublic:\n    template <class U>\n    friend class scoped_ptr_t;\n\n    scoped_ptr_t() : ptr_(NULL) { }\n    explicit scoped_ptr_t(T *p) : ptr_(p) { }\n    scoped_ptr_t(scoped_ptr_t &&movee) : ptr_(movee.ptr_) {\n        movee.ptr_ = NULL;\n    }\n    template <class U>\n    scoped_ptr_t(scoped_ptr_t<U> &&movee) : ptr_(movee.ptr_) {\n        movee.ptr_ = NULL;\n    }\n\n    ~scoped_ptr_t() {\n        reset();\n    }\n\n    scoped_ptr_t &operator=(scoped_ptr_t &&movee) {\n        scoped_ptr_t tmp(std::move(movee));\n        swap(tmp);\n        return *this;\n    }\n\n    template <class U>\n    scoped_ptr_t &operator=(scoped_ptr_t<U> &&movee) {\n        scoped_ptr_t tmp(std::move(movee));\n        swap(tmp);\n        return *this;\n    }\n\n    template <class U>\n    void init(scoped_ptr_t<U> &&movee) {\n        rassert(ptr_ == NULL);\n\n        operator=(std::move(movee));\n    }\n\n    \/\/ includes a sanity-check for first-time use.\n    void init(T *value) {\n        rassert(ptr_ == NULL);\n\n        \/\/ This is like reset with an assert.\n        T *tmp = ptr_;\n        ptr_ = value;\n        delete tmp;\n    }\n\n    void reset() {\n        T *tmp = ptr_;\n        ptr_ = NULL;\n        delete tmp;\n    }\n\n    MUST_USE T *release() {\n        T *tmp = ptr_;\n        ptr_ = NULL;\n        return tmp;\n    }\n\n    void swap(scoped_ptr_t& other) {\n        T *tmp = ptr_;\n        ptr_ = other.ptr_;\n        other.ptr_ = tmp;\n    }\n\n    T &operator*() const {\n        rassert(ptr_);\n        return *ptr_;\n    }\n\n    T *get() const {\n        rassert(ptr_);\n        return ptr_;\n    }\n\n    T *get_or_null() const {\n        return ptr_;\n    }\n\n    T *operator->() const {\n        rassert(ptr_);\n        return ptr_;\n    }\n\n    bool has() const {\n        return ptr_ != NULL;\n    }\n\nprivate:\n    T *ptr_;\n\n    DISABLE_COPYING(scoped_ptr_t);\n};\n\ntemplate <class T, class... Args>\nscoped_ptr_t<T> make_scoped_ptr(Args&&... args) {\n    return scoped_ptr_t<T>(new T(std::forward<Args>(args)...));\n}\n\n\/\/ Not really like boost::scoped_array.  A fascist array.\ntemplate <class T>\nclass scoped_array_t {\npublic:\n    scoped_array_t() : ptr_(NULL), size_(0) { }\n    explicit scoped_array_t(ssize_t n) : ptr_(NULL), size_(0) {\n        init(n);\n    }\n\n    scoped_array_t(T *ptr, ssize_t size) : ptr_(NULL), size_(0) {\n        init(ptr, size);\n    }\n\n    ~scoped_array_t() {\n        reset();\n    }\n\n    void init(ssize_t n) {\n        rassert(ptr_ == NULL);\n        rassert(n >= 0);\n\n        ptr_ = new T[n];\n        size_ = n;\n    }\n\n    \/\/ The opposite of release.\n    void init(T *ptr, ssize_t size) {\n        rassert(ptr != NULL);\n        rassert(ptr_ == NULL);\n        rassert(size >= 0);\n\n        ptr_ = ptr;\n        size_ = size;\n    }\n\n    void reset() {\n        T *tmp = ptr_;\n        ptr_ = NULL;\n        size_ = 0;\n        delete[] tmp;\n    }\n\n    MUST_USE T *release(ssize_t *size_out) {\n        *size_out = size_;\n        T *tmp = ptr_;\n        ptr_ = NULL;\n        size_ = 0;\n        return tmp;\n    }\n\n    void swap(scoped_array_t &other) {\n        T *tmp = ptr_;\n        ssize_t tmpsize = size_;\n        ptr_ = other.ptr_;\n        size_ = other.size_;\n        other.ptr_ = tmp;\n        other.size_ = tmpsize;\n    }\n\n\n\n    T& operator[](ssize_t i) const {\n        rassert(ptr_);\n        rassert(0 <= i && i < size_);\n        return ptr_[i];\n    }\n\n    T *data() const {\n        rassert(ptr_);\n        return ptr_;\n    }\n\n    ssize_t size() const {\n        rassert(ptr_);\n        return size_;\n    }\n\n    bool has() const {\n        return ptr_ != NULL;\n    }\n\nprivate:\n    T *ptr_;\n    ssize_t size_;\n\n    DISABLE_COPYING(scoped_array_t);\n};\n\n\/\/ For dumb structs that get malloc\/free for allocation.\n\ntemplate <class T>\nclass scoped_malloc_t {\npublic:\n    scoped_malloc_t() : ptr_(NULL) { }\n    explicit scoped_malloc_t(size_t n) : ptr_(reinterpret_cast<T *>(malloc(n))) { }\n    scoped_malloc_t(const char *beg, const char *end) {\n        rassert(beg <= end);\n        size_t n = end - beg;\n        ptr_ = reinterpret_cast<T *>(malloc(n));\n        memcpy(ptr_, beg, n);\n    }\n    ~scoped_malloc_t() {\n        free(ptr_);\n    }\n\n    T *get() { return ptr_; }\n    const T *get() const { return ptr_; }\n    T *operator->() { return ptr_; }\n    const T *operator->() const { return ptr_; }\n    T& operator*() { return *ptr_; }\n\n    void reset() {\n        scoped_malloc_t tmp;\n        swap(tmp);\n    }\n\n    void swap(scoped_malloc_t& other) {  \/\/ NOLINT\n        T *tmp = ptr_;\n        ptr_ = other.ptr_;\n        other.ptr_ = tmp;\n    }\n\n    template <class U>\n    friend class scoped_malloc_t;\n\n    template <class U>\n    void reinterpret_swap(scoped_malloc_t<U>& other) {\n        T *tmp = ptr_;\n        ptr_ = reinterpret_cast<T *>(other.ptr_);\n        other.ptr_ = reinterpret_cast<U *>(tmp);\n    }\n\n    bool has() const {\n        return ptr_ != NULL;\n    }\n\nprivate:\n    T *ptr_;\n\n    \/\/ DISABLE_COPYING\n    scoped_malloc_t(const scoped_malloc_t&);\n    void operator=(const scoped_malloc_t&);\n};\n\n#endif  \/\/ CONTAINERS_SCOPED_HPP_\n<commit_msg>Renamed make_scoped_ptr to make_scoped.<commit_after>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#ifndef CONTAINERS_SCOPED_HPP_\n#define CONTAINERS_SCOPED_HPP_\n\n#include <string.h>\n\n#include <utility>\n\n#include \"errors.hpp\"\n\n\/\/ Like boost::scoped_ptr only with release, init, no bool conversion, no boost headers!\ntemplate <class T>\nclass scoped_ptr_t {\npublic:\n    template <class U>\n    friend class scoped_ptr_t;\n\n    scoped_ptr_t() : ptr_(NULL) { }\n    explicit scoped_ptr_t(T *p) : ptr_(p) { }\n    scoped_ptr_t(scoped_ptr_t &&movee) : ptr_(movee.ptr_) {\n        movee.ptr_ = NULL;\n    }\n    template <class U>\n    scoped_ptr_t(scoped_ptr_t<U> &&movee) : ptr_(movee.ptr_) {\n        movee.ptr_ = NULL;\n    }\n\n    ~scoped_ptr_t() {\n        reset();\n    }\n\n    scoped_ptr_t &operator=(scoped_ptr_t &&movee) {\n        scoped_ptr_t tmp(std::move(movee));\n        swap(tmp);\n        return *this;\n    }\n\n    template <class U>\n    scoped_ptr_t &operator=(scoped_ptr_t<U> &&movee) {\n        scoped_ptr_t tmp(std::move(movee));\n        swap(tmp);\n        return *this;\n    }\n\n    template <class U>\n    void init(scoped_ptr_t<U> &&movee) {\n        rassert(ptr_ == NULL);\n\n        operator=(std::move(movee));\n    }\n\n    \/\/ includes a sanity-check for first-time use.\n    void init(T *value) {\n        rassert(ptr_ == NULL);\n\n        \/\/ This is like reset with an assert.\n        T *tmp = ptr_;\n        ptr_ = value;\n        delete tmp;\n    }\n\n    void reset() {\n        T *tmp = ptr_;\n        ptr_ = NULL;\n        delete tmp;\n    }\n\n    MUST_USE T *release() {\n        T *tmp = ptr_;\n        ptr_ = NULL;\n        return tmp;\n    }\n\n    void swap(scoped_ptr_t& other) {\n        T *tmp = ptr_;\n        ptr_ = other.ptr_;\n        other.ptr_ = tmp;\n    }\n\n    T &operator*() const {\n        rassert(ptr_);\n        return *ptr_;\n    }\n\n    T *get() const {\n        rassert(ptr_);\n        return ptr_;\n    }\n\n    T *get_or_null() const {\n        return ptr_;\n    }\n\n    T *operator->() const {\n        rassert(ptr_);\n        return ptr_;\n    }\n\n    bool has() const {\n        return ptr_ != NULL;\n    }\n\nprivate:\n    T *ptr_;\n\n    DISABLE_COPYING(scoped_ptr_t);\n};\n\ntemplate <class T, class... Args>\nscoped_ptr_t<T> make_scoped(Args&&... args) {\n    return scoped_ptr_t<T>(new T(std::forward<Args>(args)...));\n}\n\n\/\/ Not really like boost::scoped_array.  A fascist array.\ntemplate <class T>\nclass scoped_array_t {\npublic:\n    scoped_array_t() : ptr_(NULL), size_(0) { }\n    explicit scoped_array_t(ssize_t n) : ptr_(NULL), size_(0) {\n        init(n);\n    }\n\n    scoped_array_t(T *ptr, ssize_t size) : ptr_(NULL), size_(0) {\n        init(ptr, size);\n    }\n\n    ~scoped_array_t() {\n        reset();\n    }\n\n    void init(ssize_t n) {\n        rassert(ptr_ == NULL);\n        rassert(n >= 0);\n\n        ptr_ = new T[n];\n        size_ = n;\n    }\n\n    \/\/ The opposite of release.\n    void init(T *ptr, ssize_t size) {\n        rassert(ptr != NULL);\n        rassert(ptr_ == NULL);\n        rassert(size >= 0);\n\n        ptr_ = ptr;\n        size_ = size;\n    }\n\n    void reset() {\n        T *tmp = ptr_;\n        ptr_ = NULL;\n        size_ = 0;\n        delete[] tmp;\n    }\n\n    MUST_USE T *release(ssize_t *size_out) {\n        *size_out = size_;\n        T *tmp = ptr_;\n        ptr_ = NULL;\n        size_ = 0;\n        return tmp;\n    }\n\n    void swap(scoped_array_t &other) {\n        T *tmp = ptr_;\n        ssize_t tmpsize = size_;\n        ptr_ = other.ptr_;\n        size_ = other.size_;\n        other.ptr_ = tmp;\n        other.size_ = tmpsize;\n    }\n\n\n\n    T& operator[](ssize_t i) const {\n        rassert(ptr_);\n        rassert(0 <= i && i < size_);\n        return ptr_[i];\n    }\n\n    T *data() const {\n        rassert(ptr_);\n        return ptr_;\n    }\n\n    ssize_t size() const {\n        rassert(ptr_);\n        return size_;\n    }\n\n    bool has() const {\n        return ptr_ != NULL;\n    }\n\nprivate:\n    T *ptr_;\n    ssize_t size_;\n\n    DISABLE_COPYING(scoped_array_t);\n};\n\n\/\/ For dumb structs that get malloc\/free for allocation.\n\ntemplate <class T>\nclass scoped_malloc_t {\npublic:\n    scoped_malloc_t() : ptr_(NULL) { }\n    explicit scoped_malloc_t(size_t n) : ptr_(reinterpret_cast<T *>(malloc(n))) { }\n    scoped_malloc_t(const char *beg, const char *end) {\n        rassert(beg <= end);\n        size_t n = end - beg;\n        ptr_ = reinterpret_cast<T *>(malloc(n));\n        memcpy(ptr_, beg, n);\n    }\n    ~scoped_malloc_t() {\n        free(ptr_);\n    }\n\n    T *get() { return ptr_; }\n    const T *get() const { return ptr_; }\n    T *operator->() { return ptr_; }\n    const T *operator->() const { return ptr_; }\n    T& operator*() { return *ptr_; }\n\n    void reset() {\n        scoped_malloc_t tmp;\n        swap(tmp);\n    }\n\n    void swap(scoped_malloc_t& other) {  \/\/ NOLINT\n        T *tmp = ptr_;\n        ptr_ = other.ptr_;\n        other.ptr_ = tmp;\n    }\n\n    template <class U>\n    friend class scoped_malloc_t;\n\n    template <class U>\n    void reinterpret_swap(scoped_malloc_t<U>& other) {\n        T *tmp = ptr_;\n        ptr_ = reinterpret_cast<T *>(other.ptr_);\n        other.ptr_ = reinterpret_cast<U *>(tmp);\n    }\n\n    bool has() const {\n        return ptr_ != NULL;\n    }\n\nprivate:\n    T *ptr_;\n\n    \/\/ DISABLE_COPYING\n    scoped_malloc_t(const scoped_malloc_t&);\n    void operator=(const scoped_malloc_t&);\n};\n\n#endif  \/\/ CONTAINERS_SCOPED_HPP_\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 *   This file includes functions for debugging.\n *\/\n\n#ifndef DEBUG_HPP_\n#define DEBUG_HPP_\n\n#include \"openthread-core-config.h\"\n\n#include <ctype.h>\n#include <stdio.h>\n#include \"utils\/wrap_string.h\"\n\n#if defined(OPENTHREAD_TARGET_DARWIN) || defined(OPENTHREAD_TARGET_LINUX)\n\n#include <assert.h>\n\n#elif OPENTHREAD_CONFIG_PLATFORM_ASSERT_MANAGEMENT\n\n#include \"openthread\/platform\/misc.h\"\n\n\/**\n * Allow the build system to provide a custom file name.\n *\n *\/\n#ifndef FILE_NAME\n#define FILE_NAME __FILE__\n#endif\n\n#define assert(cond)                               \\\n    do                                             \\\n    {                                              \\\n        if (!(cond))                               \\\n        {                                          \\\n            otPlatAssertFail(FILE_NAME, __LINE__); \\\n            while (1)                              \\\n            {                                      \\\n            }                                      \\\n        }                                          \\\n    } while (0)\n\n#else\n\n#define assert(cond)  \\\n    do                \\\n    {                 \\\n        if (!(cond))  \\\n        {             \\\n            while (1) \\\n            {         \\\n            }         \\\n        }             \\\n    } while (0)\n\n#endif\n\n#endif \/\/ DEBUG_HPP_\n<commit_msg>[debug] override any existing assert definitions (#4329)<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 *   This file includes functions for debugging.\n *\/\n\n#ifndef DEBUG_HPP_\n#define DEBUG_HPP_\n\n#include \"openthread-core-config.h\"\n\n#include <ctype.h>\n#include <stdio.h>\n#include \"utils\/wrap_string.h\"\n\n#if defined(OPENTHREAD_TARGET_DARWIN) || defined(OPENTHREAD_TARGET_LINUX)\n\n#include <assert.h>\n\n#elif OPENTHREAD_CONFIG_PLATFORM_ASSERT_MANAGEMENT\n\n#include \"openthread\/platform\/misc.h\"\n\n\/**\n * Allow the build system to provide a custom file name.\n *\n *\/\n#ifndef FILE_NAME\n#define FILE_NAME __FILE__\n#endif\n\n#ifdef assert\n#undef assert\n#endif\n\n#define assert(cond)                               \\\n    do                                             \\\n    {                                              \\\n        if (!(cond))                               \\\n        {                                          \\\n            otPlatAssertFail(FILE_NAME, __LINE__); \\\n            while (1)                              \\\n            {                                      \\\n            }                                      \\\n        }                                          \\\n    } while (0)\n\n#else\n\n#ifdef assert\n#undef assert\n#endif\n\n#define assert(cond)  \\\n    do                \\\n    {                 \\\n        if (!(cond))  \\\n        {             \\\n            while (1) \\\n            {         \\\n            }         \\\n        }             \\\n    } while (0)\n\n#endif\n\n#endif \/\/ DEBUG_HPP_\n<|endoftext|>"}
{"text":"<commit_before>#include \"KeyCode.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n#include \"keycode\/output\/include.EventType.cpp\"\n#include \"keycode\/output\/include.KeyboardType.cpp\"\n#include \"keycode\/output\/include.ModifierFlag.cpp\"\n#include \"keycode\/output\/include.KeyCode.cpp\"\n#include \"keycode\/output\/include.ConsumerKeyCode.cpp\"\n#include \"keycode\/output\/include.PointingButton.cpp\"\n\n  \/\/ ------------------------------------------------------------\n  bool\n  EventType::isKeyDownOrModifierDown(KeyCode key, Flags flags) const\n  {\n    if (*this == EventType::DOWN) return true;\n    if (*this == EventType::MODIFY) {\n      return flags.isOn(key.getModifierFlag());\n    }\n    return false;\n  }\n\n  bool\n  KeyCode::FNKeyHack::remap(KeyCode& key, Flags flags, EventType eventType, bool& active, KeyCode fromKeyCode, KeyCode toKeyCode)\n  {\n    if (key != fromKeyCode) return false;\n\n    bool isKeyDown = eventType.isKeyDownOrModifierDown(key, flags);\n    if (isKeyDown) {\n      if (! flags.isOn(ModifierFlag::FN)) return false;\n      active = true;\n    } else {\n      if (! active) return false;\n      active = false;\n    }\n\n    key = toKeyCode;\n\n    return true;\n  }\n\n  namespace {\n    KeyCode::FNKeyHack fnkeyhack[] = {\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_0, KeyCode::M),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_1, KeyCode::J),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_2, KeyCode::K),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_3, KeyCode::L),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_4, KeyCode::U),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_5, KeyCode::I),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_6, KeyCode::O),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_7, KeyCode::KEY_7),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_8, KeyCode::KEY_8),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_9, KeyCode::KEY_9),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_CLEAR, KeyCode::KEY_6),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_PLUS, KeyCode::SLASH),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_MINUS, KeyCode::SEMICOLON),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_MULTIPLY, KeyCode::P),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_SLASH, KeyCode::KEY_0),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_EQUAL, KeyCode::MINUS),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_DOT, KeyCode::DOT),\n      KeyCode::FNKeyHack(KeyCode::PAGEUP, KeyCode::CURSOR_UP),\n      KeyCode::FNKeyHack(KeyCode::PAGEDOWN, KeyCode::CURSOR_DOWN),\n      KeyCode::FNKeyHack(KeyCode::HOME, KeyCode::CURSOR_LEFT),\n      KeyCode::FNKeyHack(KeyCode::END, KeyCode::CURSOR_RIGHT),\n      KeyCode::FNKeyHack(KeyCode::ENTER, KeyCode::RETURN),\n      KeyCode::FNKeyHack(KeyCode::FORWARD_DELETE, KeyCode::DELETE),\n    };\n  }\n\n  void\n  KeyCode::normalizeKey(Flags& flags, EventType eventType, KeyboardType keyboardType)\n  {\n    \/\/ We can drop CURSOR and KEYPAD flags, because we'll set these flags at reverseNormalizeKey.\n    flags.stripCURSOR().stripKEYPAD();\n\n    if (keyboardType == KeyboardType::POWERBOOK ||\n        keyboardType == KeyboardType::POWERBOOK_G4 ||\n        keyboardType == KeyboardType::POWERBOOK_G4_TI) {\n      if (*this == KeyCode::ENTER_POWERBOOK) { *this = KeyCode::ENTER; }\n    }\n\n    for (unsigned int i = 0; i < sizeof(fnkeyhack) \/ sizeof(fnkeyhack[0]); ++i) {\n      fnkeyhack[i].normalize(*this, flags, eventType);\n    }\n  }\n\n  void\n  KeyCode::reverseNormalizeKey(Flags& flags, EventType eventType, KeyboardType keyboardType)\n  {\n    for (unsigned int i = 0; i < sizeof(fnkeyhack) \/ sizeof(fnkeyhack[0]); ++i) {\n      fnkeyhack[i].reverse(*this, flags, eventType);\n    }\n\n    if (keyboardType == KeyboardType::POWERBOOK ||\n        keyboardType == KeyboardType::POWERBOOK_G4 ||\n        keyboardType == KeyboardType::POWERBOOK_G4_TI) {\n      if (*this == KeyCode::ENTER) { *this = KeyCode::ENTER_POWERBOOK; }\n    }\n\n    \/\/ ------------------------------------------------------------\n    \/\/ set ModifierFlag::FN\n    \/\/\n    \/\/ We add ModifierFlag::FN for Cocoa Application.\n    \/\/ Cocoa Application manages the flag status inside,\n    \/\/ so unless we attach FN, the flag status becomes invalid in Cocoa.\n    if (*this == KeyCode::HOME ||\n        *this == KeyCode::END ||\n        *this == KeyCode::PAGEUP ||\n        *this == KeyCode::PAGEDOWN ||\n        *this == KeyCode::FORWARD_DELETE ||\n        *this == KeyCode::HELP) {\n      flags.add(ModifierFlag::FN);\n    }\n\n    \/\/ ------------------------------------------------------------\n    \/\/ set ModifierFlag::KEYPAD, ModifierFlag::CURSOR\n    flags.stripCURSOR().stripKEYPAD();\n\n    \/\/ Note: KEYPAD_CLEAR, KEYPAD_COMMA have no ModifierFlag::KEYPAD bit.\n    if (*this == KeyCode::KEYPAD_0 || *this == KeyCode::KEYPAD_1 || *this == KeyCode::KEYPAD_2 ||\n        *this == KeyCode::KEYPAD_3 || *this == KeyCode::KEYPAD_4 || *this == KeyCode::KEYPAD_5 ||\n        *this == KeyCode::KEYPAD_6 || *this == KeyCode::KEYPAD_7 || *this == KeyCode::KEYPAD_8 ||\n        *this == KeyCode::KEYPAD_9 ||\n        *this == KeyCode::KEYPAD_DOT ||\n        *this == KeyCode::KEYPAD_MULTIPLY ||\n        *this == KeyCode::KEYPAD_PLUS ||\n        *this == KeyCode::KEYPAD_SLASH ||\n        *this == KeyCode::KEYPAD_MINUS ||\n        *this == KeyCode::KEYPAD_EQUAL) {\n      flags.add(ModifierFlag::KEYPAD);\n    }\n\n    if (*this == KeyCode::CURSOR_UP ||\n        *this == KeyCode::CURSOR_DOWN ||\n        *this == KeyCode::CURSOR_LEFT ||\n        *this == KeyCode::CURSOR_RIGHT) {\n      flags.add(ModifierFlag::CURSOR);\n    }\n  }\n\n  KeyCode\n  ModifierFlag::getKeyCode(void) const {\n    if (*this == ModifierFlag::CAPSLOCK) return KeyCode::CAPSLOCK;\n    if (*this == ModifierFlag::SHIFT_L) return KeyCode::SHIFT_L;\n    if (*this == ModifierFlag::SHIFT_R) return KeyCode::SHIFT_R;\n    if (*this == ModifierFlag::CONTROL_L) return KeyCode::CONTROL_L;\n    if (*this == ModifierFlag::CONTROL_R) return KeyCode::CONTROL_R;\n    if (*this == ModifierFlag::OPTION_L) return KeyCode::OPTION_L;\n    if (*this == ModifierFlag::OPTION_R) return KeyCode::OPTION_R;\n    if (*this == ModifierFlag::COMMAND_L) return KeyCode::COMMAND_L;\n    if (*this == ModifierFlag::COMMAND_R) return KeyCode::COMMAND_R;\n    if (*this == ModifierFlag::FN) return KeyCode::FN;\n    if (*this == ModifierFlag::EXTRA1) return KeyCode::VK_MODIFIER_EXTRA1;\n    if (*this == ModifierFlag::EXTRA2) return KeyCode::VK_MODIFIER_EXTRA2;\n    if (*this == ModifierFlag::EXTRA3) return KeyCode::VK_MODIFIER_EXTRA3;\n    if (*this == ModifierFlag::EXTRA4) return KeyCode::VK_MODIFIER_EXTRA4;\n    if (*this == ModifierFlag::EXTRA5) return KeyCode::VK_MODIFIER_EXTRA5;\n\n    return KeyCode::VK_NONE;\n  }\n\n  ModifierFlag\n  KeyCode::getModifierFlag(void) const\n  {\n    if (*this == KeyCode::CAPSLOCK) return ModifierFlag::CAPSLOCK;\n    if (*this == KeyCode::SHIFT_L) return ModifierFlag::SHIFT_L;\n    if (*this == KeyCode::SHIFT_R) return ModifierFlag::SHIFT_R;\n    if (*this == KeyCode::CONTROL_L) return ModifierFlag::CONTROL_L;\n    if (*this == KeyCode::CONTROL_R) return ModifierFlag::CONTROL_R;\n    if (*this == KeyCode::OPTION_L) return ModifierFlag::OPTION_L;\n    if (*this == KeyCode::OPTION_R) return ModifierFlag::OPTION_R;\n    if (*this == KeyCode::COMMAND_L) return ModifierFlag::COMMAND_L;\n    if (*this == KeyCode::COMMAND_R) return ModifierFlag::COMMAND_R;\n    if (*this == KeyCode::FN) return ModifierFlag::FN;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA1) return ModifierFlag::EXTRA1;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA2) return ModifierFlag::EXTRA2;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA3) return ModifierFlag::EXTRA3;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA4) return ModifierFlag::EXTRA4;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA5) return ModifierFlag::EXTRA5;\n\n    return ModifierFlag::NONE;\n  }\n}\n<commit_msg>update KeyCode.cpp<commit_after>#include \"KeyCode.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n#include \"keycode\/output\/include.EventType.cpp\"\n#include \"keycode\/output\/include.KeyboardType.cpp\"\n#include \"keycode\/output\/include.ModifierFlag.cpp\"\n#include \"keycode\/output\/include.KeyCode.cpp\"\n#include \"keycode\/output\/include.ConsumerKeyCode.cpp\"\n#include \"keycode\/output\/include.PointingButton.cpp\"\n\n  \/\/ ------------------------------------------------------------\n  bool\n  EventType::isKeyDownOrModifierDown(KeyCode key, Flags flags) const\n  {\n    if (*this == EventType::DOWN) return true;\n    if (*this == EventType::MODIFY) {\n      return flags.isOn(key.getModifierFlag());\n    }\n    return false;\n  }\n\n  bool\n  KeyCode::FNKeyHack::remap(KeyCode& key, Flags flags, EventType eventType, bool& active, KeyCode fromKeyCode, KeyCode toKeyCode)\n  {\n    if (key != fromKeyCode) return false;\n\n    bool isKeyDown = eventType.isKeyDownOrModifierDown(key, flags);\n    if (isKeyDown) {\n      if (! flags.isOn(ModifierFlag::FN)) return false;\n      active = true;\n    } else {\n      if (! active) return false;\n      active = false;\n    }\n\n    key = toKeyCode;\n\n    return true;\n  }\n\n  namespace {\n    KeyCode::FNKeyHack fnkeyhack[] = {\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_0, KeyCode::M),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_1, KeyCode::J),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_2, KeyCode::K),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_3, KeyCode::L),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_4, KeyCode::U),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_5, KeyCode::I),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_6, KeyCode::O),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_7, KeyCode::KEY_7),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_8, KeyCode::KEY_8),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_9, KeyCode::KEY_9),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_CLEAR, KeyCode::KEY_6),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_PLUS, KeyCode::SLASH),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_MINUS, KeyCode::SEMICOLON),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_MULTIPLY, KeyCode::P),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_SLASH, KeyCode::KEY_0),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_EQUAL, KeyCode::MINUS),\n      KeyCode::FNKeyHack(KeyCode::KEYPAD_DOT, KeyCode::DOT),\n      KeyCode::FNKeyHack(KeyCode::PAGEUP, KeyCode::CURSOR_UP),\n      KeyCode::FNKeyHack(KeyCode::PAGEDOWN, KeyCode::CURSOR_DOWN),\n      KeyCode::FNKeyHack(KeyCode::HOME, KeyCode::CURSOR_LEFT),\n      KeyCode::FNKeyHack(KeyCode::END, KeyCode::CURSOR_RIGHT),\n      KeyCode::FNKeyHack(KeyCode::ENTER, KeyCode::RETURN),\n      KeyCode::FNKeyHack(KeyCode::FORWARD_DELETE, KeyCode::DELETE),\n    };\n  }\n\n  void\n  KeyCode::normalizeKey(Flags& flags, EventType eventType, KeyboardType keyboardType)\n  {\n    \/\/ We can drop CURSOR and KEYPAD flags, because we'll set these flags at reverseNormalizeKey.\n    flags.stripCURSOR().stripKEYPAD();\n\n    if (keyboardType == KeyboardType::POWERBOOK ||\n        keyboardType == KeyboardType::POWERBOOK_G4 ||\n        keyboardType == KeyboardType::POWERBOOK_G4_TI) {\n      if (*this == KeyCode::ENTER_POWERBOOK) { *this = KeyCode::ENTER; }\n    }\n\n    for (unsigned int i = 0; i < sizeof(fnkeyhack) \/ sizeof(fnkeyhack[0]); ++i) {\n      if (fnkeyhack[i].normalize(*this, flags, eventType)) break;\n    }\n  }\n\n  void\n  KeyCode::reverseNormalizeKey(Flags& flags, EventType eventType, KeyboardType keyboardType)\n  {\n    for (unsigned int i = 0; i < sizeof(fnkeyhack) \/ sizeof(fnkeyhack[0]); ++i) {\n      if (fnkeyhack[i].reverse(*this, flags, eventType)) break;\n    }\n\n    if (keyboardType == KeyboardType::POWERBOOK ||\n        keyboardType == KeyboardType::POWERBOOK_G4 ||\n        keyboardType == KeyboardType::POWERBOOK_G4_TI) {\n      if (*this == KeyCode::ENTER) { *this = KeyCode::ENTER_POWERBOOK; }\n    }\n\n    \/\/ ------------------------------------------------------------\n    \/\/ set ModifierFlag::FN\n    \/\/\n    \/\/ We add ModifierFlag::FN for Cocoa Application.\n    \/\/ Cocoa Application manages the flag status inside,\n    \/\/ so unless we attach FN, the flag status becomes invalid in Cocoa.\n    if (*this == KeyCode::HOME ||\n        *this == KeyCode::END ||\n        *this == KeyCode::PAGEUP ||\n        *this == KeyCode::PAGEDOWN ||\n        *this == KeyCode::FORWARD_DELETE ||\n        *this == KeyCode::HELP) {\n      flags.add(ModifierFlag::FN);\n    }\n\n    \/\/ ------------------------------------------------------------\n    \/\/ set ModifierFlag::KEYPAD, ModifierFlag::CURSOR\n    flags.stripCURSOR().stripKEYPAD();\n\n    \/\/ Note: KEYPAD_CLEAR, KEYPAD_COMMA have no ModifierFlag::KEYPAD bit.\n    if (*this == KeyCode::KEYPAD_0 || *this == KeyCode::KEYPAD_1 || *this == KeyCode::KEYPAD_2 ||\n        *this == KeyCode::KEYPAD_3 || *this == KeyCode::KEYPAD_4 || *this == KeyCode::KEYPAD_5 ||\n        *this == KeyCode::KEYPAD_6 || *this == KeyCode::KEYPAD_7 || *this == KeyCode::KEYPAD_8 ||\n        *this == KeyCode::KEYPAD_9 ||\n        *this == KeyCode::KEYPAD_DOT ||\n        *this == KeyCode::KEYPAD_MULTIPLY ||\n        *this == KeyCode::KEYPAD_PLUS ||\n        *this == KeyCode::KEYPAD_SLASH ||\n        *this == KeyCode::KEYPAD_MINUS ||\n        *this == KeyCode::KEYPAD_EQUAL) {\n      flags.add(ModifierFlag::KEYPAD);\n    }\n\n    if (*this == KeyCode::CURSOR_UP ||\n        *this == KeyCode::CURSOR_DOWN ||\n        *this == KeyCode::CURSOR_LEFT ||\n        *this == KeyCode::CURSOR_RIGHT) {\n      flags.add(ModifierFlag::CURSOR);\n    }\n  }\n\n  KeyCode\n  ModifierFlag::getKeyCode(void) const {\n    if (*this == ModifierFlag::CAPSLOCK) return KeyCode::CAPSLOCK;\n    if (*this == ModifierFlag::SHIFT_L) return KeyCode::SHIFT_L;\n    if (*this == ModifierFlag::SHIFT_R) return KeyCode::SHIFT_R;\n    if (*this == ModifierFlag::CONTROL_L) return KeyCode::CONTROL_L;\n    if (*this == ModifierFlag::CONTROL_R) return KeyCode::CONTROL_R;\n    if (*this == ModifierFlag::OPTION_L) return KeyCode::OPTION_L;\n    if (*this == ModifierFlag::OPTION_R) return KeyCode::OPTION_R;\n    if (*this == ModifierFlag::COMMAND_L) return KeyCode::COMMAND_L;\n    if (*this == ModifierFlag::COMMAND_R) return KeyCode::COMMAND_R;\n    if (*this == ModifierFlag::FN) return KeyCode::FN;\n    if (*this == ModifierFlag::EXTRA1) return KeyCode::VK_MODIFIER_EXTRA1;\n    if (*this == ModifierFlag::EXTRA2) return KeyCode::VK_MODIFIER_EXTRA2;\n    if (*this == ModifierFlag::EXTRA3) return KeyCode::VK_MODIFIER_EXTRA3;\n    if (*this == ModifierFlag::EXTRA4) return KeyCode::VK_MODIFIER_EXTRA4;\n    if (*this == ModifierFlag::EXTRA5) return KeyCode::VK_MODIFIER_EXTRA5;\n\n    return KeyCode::VK_NONE;\n  }\n\n  ModifierFlag\n  KeyCode::getModifierFlag(void) const\n  {\n    if (*this == KeyCode::CAPSLOCK) return ModifierFlag::CAPSLOCK;\n    if (*this == KeyCode::SHIFT_L) return ModifierFlag::SHIFT_L;\n    if (*this == KeyCode::SHIFT_R) return ModifierFlag::SHIFT_R;\n    if (*this == KeyCode::CONTROL_L) return ModifierFlag::CONTROL_L;\n    if (*this == KeyCode::CONTROL_R) return ModifierFlag::CONTROL_R;\n    if (*this == KeyCode::OPTION_L) return ModifierFlag::OPTION_L;\n    if (*this == KeyCode::OPTION_R) return ModifierFlag::OPTION_R;\n    if (*this == KeyCode::COMMAND_L) return ModifierFlag::COMMAND_L;\n    if (*this == KeyCode::COMMAND_R) return ModifierFlag::COMMAND_R;\n    if (*this == KeyCode::FN) return ModifierFlag::FN;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA1) return ModifierFlag::EXTRA1;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA2) return ModifierFlag::EXTRA2;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA3) return ModifierFlag::EXTRA3;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA4) return ModifierFlag::EXTRA4;\n    if (*this == KeyCode::VK_MODIFIER_EXTRA5) return ModifierFlag::EXTRA5;\n\n    return ModifierFlag::NONE;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright 2015 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 <grpc\/support\/port_platform.h>\n\n#include <grpc\/support\/alloc.h>\n\n#include <grpc\/support\/log.h>\n#include <stdlib.h>\n#include <string.h>\n#include \"src\/core\/lib\/gpr\/alloc.h\"\n#include \"src\/core\/lib\/profiling\/timers.h\"\n\nstatic void* zalloc_with_calloc(size_t sz) { return calloc(sz, 1); }\n\nstatic void* zalloc_with_gpr_malloc(size_t sz) {\n  void* p = gpr_malloc(sz);\n  memset(p, 0, sz);\n  return p;\n}\n\n#ifndef NDEBUG\nstatic constexpr bool is_power_of_two(size_t value) {\n  \/\/ 2^N =     100000...000\n  \/\/ 2^N - 1 = 011111...111\n  \/\/ (2^N) && ((2^N)-1)) = 0\n  return (value & (value - 1)) == 0;\n}\n#endif\n\nstatic void* aligned_alloc_with_gpr_malloc(size_t size, size_t alignment) {\n  GPR_DEBUG_ASSERT(is_power_of_two(alignment));\n  size_t extra = alignment - 1 + sizeof(void*);\n  void* p = gpr_malloc(size + extra);\n  void** ret = (void**)(((uintptr_t)p + extra) & ~(alignment - 1));\n  ret[-1] = p;\n  return (void*)ret;\n}\n\nstatic void aligned_free_with_gpr_malloc(void* ptr) {\n  gpr_free((static_cast<void**>(ptr))[-1]);\n}\n\nstatic void* platform_malloc_aligned(size_t size, size_t alignment) {\n#if defined(GPR_HAS_ALIGNED_ALLOC)\n  size = GPR_ROUND_UP_TO_ALIGNMENT_SIZE(size, alignment);\n  void* ret = aligned_alloc(alignment, size);\n  GPR_ASSERT(ret != nullptr);\n  return ret;\n#elif defined(GPR_HAS_ALIGNED_MALLOC)\n  GPR_DEBUG_ASSERT(is_power_of_two(alignment));\n  void* ret = _aligned_malloc(size, alignment);\n  GPR_ASSERT(ret != nullptr);\n  return ret;\n#elif defined(GPR_HAS_POSIX_MEMALIGN)\n  GPR_DEBUG_ASSERT(is_power_of_two(alignment));\n  GPR_DEBUG_ASSERT(alignment % sizeof(void*) == 0);\n  void* ret = nullptr;\n  GPR_ASSERT(posix_memalign(&ret, alignment, size) == 0);\n  return ret;\n#else\n  return aligned_alloc_with_gpr_malloc(size, alignment);\n#endif\n}\n\nstatic void platform_free_aligned(void* ptr) {\n#if defined(GPR_HAS_ALIGNED_ALLOC) || defined(GPR_HAS_POSIX_MEMALIGN)\n  free(ptr);\n#elif defined(GPR_HAS_ALIGNED_MALLOC)\n  _aligned_free(ptr);\n#else\n  aligned_free_with_gpr_malloc(ptr);\n#endif\n}\n\nstatic gpr_allocation_functions g_alloc_functions = {\n    malloc, zalloc_with_calloc,      realloc,\n    free,   platform_malloc_aligned, platform_free_aligned};\n\ngpr_allocation_functions gpr_get_allocation_functions() {\n  return g_alloc_functions;\n}\n\nvoid gpr_set_allocation_functions(gpr_allocation_functions functions) {\n  GPR_ASSERT(functions.malloc_fn != nullptr);\n  GPR_ASSERT(functions.realloc_fn != nullptr);\n  GPR_ASSERT(functions.free_fn != nullptr);\n  if (functions.zalloc_fn == nullptr) {\n    functions.zalloc_fn = zalloc_with_gpr_malloc;\n  }\n  GPR_ASSERT((functions.aligned_alloc_fn == nullptr) ==\n             (functions.aligned_free_fn == nullptr));\n  if (functions.aligned_alloc_fn == nullptr) {\n    functions.aligned_alloc_fn = aligned_alloc_with_gpr_malloc;\n    functions.aligned_free_fn = aligned_free_with_gpr_malloc;\n  }\n  g_alloc_functions = functions;\n}\n\nvoid* gpr_malloc(size_t size) {\n  GPR_TIMER_SCOPE(\"gpr_malloc\", 0);\n  void* p;\n  if (size == 0) return nullptr;\n  p = g_alloc_functions.malloc_fn(size);\n  if (!p) {\n    abort();\n  }\n  return p;\n}\n\nvoid* gpr_zalloc(size_t size) {\n  GPR_TIMER_SCOPE(\"gpr_zalloc\", 0);\n  void* p;\n  if (size == 0) return nullptr;\n  p = g_alloc_functions.zalloc_fn(size);\n  if (!p) {\n    abort();\n  }\n  return p;\n}\n\nvoid gpr_free(void* p) {\n  GPR_TIMER_SCOPE(\"gpr_free\", 0);\n  g_alloc_functions.free_fn(p);\n}\n\nvoid* gpr_realloc(void* p, size_t size) {\n  GPR_TIMER_SCOPE(\"gpr_realloc\", 0);\n  if ((size == 0) && (p == nullptr)) return nullptr;\n  p = g_alloc_functions.realloc_fn(p, size);\n  if (!p) {\n    abort();\n  }\n  return p;\n}\n\nvoid* gpr_malloc_aligned(size_t size, size_t alignment) {\n  GPR_TIMER_SCOPE(\"gpr_malloc_aligned\", 0);\n  if (size == 0) return nullptr;\n  return g_alloc_functions.aligned_alloc_fn(size, alignment);\n}\n\nvoid gpr_free_aligned(void* ptr) {\n  GPR_TIMER_SCOPE(\"gpr_free_aligned\", 0);\n  g_alloc_functions.aligned_free_fn(ptr);\n}\n<commit_msg>Use platform align_malloc function when setting custom allocators and no override provided<commit_after>\/*\n *\n * Copyright 2015 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 <grpc\/support\/port_platform.h>\n\n#include <grpc\/support\/alloc.h>\n\n#include <grpc\/support\/log.h>\n#include <stdlib.h>\n#include <string.h>\n#include \"src\/core\/lib\/gpr\/alloc.h\"\n#include \"src\/core\/lib\/profiling\/timers.h\"\n\nstatic void* zalloc_with_calloc(size_t sz) { return calloc(sz, 1); }\n\nstatic void* zalloc_with_gpr_malloc(size_t sz) {\n  void* p = gpr_malloc(sz);\n  memset(p, 0, sz);\n  return p;\n}\n\n#ifndef NDEBUG\nstatic constexpr bool is_power_of_two(size_t value) {\n  \/\/ 2^N =     100000...000\n  \/\/ 2^N - 1 = 011111...111\n  \/\/ (2^N) && ((2^N)-1)) = 0\n  return (value & (value - 1)) == 0;\n}\n#endif\n\nstatic void* platform_malloc_aligned(size_t size, size_t alignment) {\n#if defined(GPR_HAS_ALIGNED_ALLOC)\n  GPR_DEBUG_ASSERT(is_power_of_two(alignment));\n  size = GPR_ROUND_UP_TO_ALIGNMENT_SIZE(size, alignment);\n  void* ret = aligned_alloc(alignment, size);\n  GPR_ASSERT(ret != nullptr);\n  return ret;\n#elif defined(GPR_HAS_ALIGNED_MALLOC)\n  GPR_DEBUG_ASSERT(is_power_of_two(alignment));\n  void* ret = _aligned_malloc(size, alignment);\n  GPR_ASSERT(ret != nullptr);\n  return ret;\n#elif defined(GPR_HAS_POSIX_MEMALIGN)\n  GPR_DEBUG_ASSERT(is_power_of_two(alignment));\n  GPR_DEBUG_ASSERT(alignment % sizeof(void*) == 0);\n  void* ret = nullptr;\n  GPR_ASSERT(posix_memalign(&ret, alignment, size) == 0);\n  return ret;\n#else\n  GPR_DEBUG_ASSERT(is_power_of_two(alignment));\n  size_t extra = alignment - 1 + sizeof(void*);\n  void* p = gpr_malloc(size + extra);\n  void** ret = (void**)(((uintptr_t)p + extra) & ~(alignment - 1));\n  ret[-1] = p;\n  return (void*)ret;\n#endif\n}\n\nstatic void platform_free_aligned(void* ptr) {\n#if defined(GPR_HAS_ALIGNED_ALLOC) || defined(GPR_HAS_POSIX_MEMALIGN)\n  free(ptr);\n#elif defined(GPR_HAS_ALIGNED_MALLOC)\n  _aligned_free(ptr);\n#else\n  gpr_free((static_cast<void**>(ptr))[-1]);\n#endif\n}\n\nstatic gpr_allocation_functions g_alloc_functions = {\n    malloc, zalloc_with_calloc,      realloc,\n    free,   platform_malloc_aligned, platform_free_aligned};\n\ngpr_allocation_functions gpr_get_allocation_functions() {\n  return g_alloc_functions;\n}\n\nvoid gpr_set_allocation_functions(gpr_allocation_functions functions) {\n  GPR_ASSERT(functions.malloc_fn != nullptr);\n  GPR_ASSERT(functions.realloc_fn != nullptr);\n  GPR_ASSERT(functions.free_fn != nullptr);\n  if (functions.zalloc_fn == nullptr) {\n    functions.zalloc_fn = zalloc_with_gpr_malloc;\n  }\n  GPR_ASSERT((functions.aligned_alloc_fn == nullptr) ==\n             (functions.aligned_free_fn == nullptr));\n  if (functions.aligned_alloc_fn == nullptr) {\n    functions.aligned_alloc_fn = platform_malloc_aligned;\n    functions.aligned_free_fn = platform_free_aligned;\n  }\n  g_alloc_functions = functions;\n}\n\nvoid* gpr_malloc(size_t size) {\n  GPR_TIMER_SCOPE(\"gpr_malloc\", 0);\n  void* p;\n  if (size == 0) return nullptr;\n  p = g_alloc_functions.malloc_fn(size);\n  if (!p) {\n    abort();\n  }\n  return p;\n}\n\nvoid* gpr_zalloc(size_t size) {\n  GPR_TIMER_SCOPE(\"gpr_zalloc\", 0);\n  void* p;\n  if (size == 0) return nullptr;\n  p = g_alloc_functions.zalloc_fn(size);\n  if (!p) {\n    abort();\n  }\n  return p;\n}\n\nvoid gpr_free(void* p) {\n  GPR_TIMER_SCOPE(\"gpr_free\", 0);\n  g_alloc_functions.free_fn(p);\n}\n\nvoid* gpr_realloc(void* p, size_t size) {\n  GPR_TIMER_SCOPE(\"gpr_realloc\", 0);\n  if ((size == 0) && (p == nullptr)) return nullptr;\n  p = g_alloc_functions.realloc_fn(p, size);\n  if (!p) {\n    abort();\n  }\n  return p;\n}\n\nvoid* gpr_malloc_aligned(size_t size, size_t alignment) {\n  GPR_TIMER_SCOPE(\"gpr_malloc_aligned\", 0);\n  if (size == 0) return nullptr;\n  return g_alloc_functions.aligned_alloc_fn(size, alignment);\n}\n\nvoid gpr_free_aligned(void* ptr) {\n  GPR_TIMER_SCOPE(\"gpr_free_aligned\", 0);\n  g_alloc_functions.aligned_free_fn(ptr);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n   Copyright (c) 2009-2013, Jack Poulson\n   All rights reserved.\n\n   This file is part of Elemental and is under the BSD 2-Clause License, \n   which can be found in the LICENSE file in the root directory, or at \n   http:\/\/opensource.org\/licenses\/BSD-2-Clause\n*\/\n#include \"elemental.hpp\"\n\nnamespace {\nelem::mpi::Datatype typeIntInt;\nelem::mpi::Datatype typeFloatInt;\nelem::mpi::Datatype typeDoubleInt;\n\nelem::mpi::Op maxLocIntOp;\nelem::mpi::Op maxLocFloatOp;\nelem::mpi::Op maxLocDoubleOp;\n}   \n\nnamespace elem {\nnamespace mpi {\n\ntemplate<typename T>\nvoid\nMaxLocFunc\n( ValueInt<T>* inData, ValueInt<T>* outData, int* length, Datatype* datatype )\n{           \n    for( int j=0; j<*length; ++j )\n        if( inData[j].value > outData[j].value )\n            outData[j] = inData[j];\n}\n\ntemplate<>\nDatatype& ValueIntType<Int>()\n{ return ::typeIntInt; }\n\ntemplate<>\nDatatype& ValueIntType<float>()\n{ return ::typeFloatInt; }\n\ntemplate<>\nDatatype& ValueIntType<double>()\n{ return ::typeDoubleInt; }\n\ntemplate<typename T>\nvoid CreateValueIntType()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"CreateValueIntType<Int>\");\n#endif\n    Datatype& type = ValueIntType<T>();\n#ifndef RELEASE\n    if( type != 0 )\n        LogicError(\"type was already created\");\n#endif\n    Datatype typeList[2];\n    typeList[0] = TypeMap<T>();\n    typeList[1] = TypeMap<Int>();\n    \n    int blockLengths[2];\n    blockLengths[0] = 1;\n    blockLengths[1] = 1; \n\n    ValueInt<T> v;\n    MPI_Aint startAddr, valueAddr, indexAddr;\n    MPI_Address( &v,       &startAddr );\n    MPI_Address( &v.value, &valueAddr );\n    MPI_Address( &v.index, &indexAddr );\n\n    MPI_Aint displs[2];\n    displs[0] = valueAddr - startAddr;\n    displs[1] = indexAddr - startAddr;\n\n    MPI_Type_create_struct( 2, blockLengths, displs, typeList, &type );\n    MPI_Type_commit( &type );\n}\ntemplate void CreateValueIntType<Int>();\ntemplate void CreateValueIntType<float>();\ntemplate void CreateValueIntType<double>();\n\ntemplate<>\nvoid CreateMaxLocOp<Int>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"CreateMaxLocOp<Int>\");\n#endif\n    OpCreate( (UserFunction*)MaxLocFunc<Int>, true, ::maxLocIntOp );\n}\n\ntemplate<>\nvoid CreateMaxLocOp<float>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"CreateMaxLocOp<float>\");\n#endif\n    OpCreate( (UserFunction*)MaxLocFunc<float>, true, ::maxLocFloatOp );\n}\n\ntemplate<>\nvoid CreateMaxLocOp<double>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"CreateMaxLocOp<double>\");\n#endif\n    OpCreate( (UserFunction*)MaxLocFunc<double>, true, ::maxLocDoubleOp );\n}\n\ntemplate<>\nvoid DestroyMaxLocOp<Int>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"DestroyMaxLocOp<Int>\");\n#endif\n    OpFree( ::maxLocIntOp );\n}\n\ntemplate<>\nvoid DestroyMaxLocOp<float>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"DestroyMaxLocOp<float>\");\n#endif\n    OpFree( ::maxLocFloatOp );\n}\n\ntemplate<>\nvoid DestroyMaxLocOp<double>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"DestroyMaxLocOp<double>\");\n#endif\n    OpFree( ::maxLocDoubleOp );\n}\n\ntemplate<>\nOp MaxLocOp<Int>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"MaxLocOp<Int>\");\n#endif\n    return ::maxLocIntOp;\n}\n\ntemplate<>\nOp MaxLocOp<float>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"MaxLocOp<float>\");\n#endif\n    return ::maxLocFloatOp;\n}\n\ntemplate<>\nOp MaxLocOp<double>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"MaxLocOp<double>\");\n#endif\n    return ::maxLocDoubleOp;\n}\n\ntemplate void\nMaxLocFunc<Int>\n( ValueInt<Int>* inData, ValueInt<Int>* outData, int* length, \n  Datatype* datatype );\ntemplate void\nMaxLocFunc<float>\n( ValueInt<float>* inData, ValueInt<float>* outData, int* length, \n  Datatype* datatype );\ntemplate void\nMaxLocFunc<double>\n( ValueInt<double>* inData, ValueInt<double>* outData, int* length, \n  Datatype* datatype );\n\n} \/\/ namespace mpi\n} \/\/ namespace elem\n<commit_msg>Fixing a few artifacts in src\/core\/mpi_register.cpp which were left from the large amount of different approaches tried before settling on the current one.<commit_after>\/*\n   Copyright (c) 2009-2013, Jack Poulson\n   All rights reserved.\n\n   This file is part of Elemental and is under the BSD 2-Clause License, \n   which can be found in the LICENSE file in the root directory, or at \n   http:\/\/opensource.org\/licenses\/BSD-2-Clause\n*\/\n#include \"elemental.hpp\"\n\nnamespace {\nelem::mpi::Datatype typeIntInt;\nelem::mpi::Datatype typeFloatInt;\nelem::mpi::Datatype typeDoubleInt;\n\nelem::mpi::Op maxLocIntOp;\nelem::mpi::Op maxLocFloatOp;\nelem::mpi::Op maxLocDoubleOp;\n}   \n\nnamespace elem {\nnamespace mpi {\n\ntemplate<typename T>\nvoid\nMaxLocFunc\n( ValueInt<T>* inData, ValueInt<T>* outData, int* length, Datatype* datatype )\n{           \n    for( int j=0; j<*length; ++j )\n        if( inData[j].value > outData[j].value )\n            outData[j] = inData[j];\n}\n\ntemplate<>\nDatatype& ValueIntType<Int>()\n{ return ::typeIntInt; }\n\ntemplate<>\nDatatype& ValueIntType<float>()\n{ return ::typeFloatInt; }\n\ntemplate<>\nDatatype& ValueIntType<double>()\n{ return ::typeDoubleInt; }\n\ntemplate<typename T>\nvoid CreateValueIntType()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"CreateValueIntType\");\n#endif\n    Datatype typeList[2];\n    typeList[0] = TypeMap<T>();\n    typeList[1] = TypeMap<Int>();\n    \n    int blockLengths[2];\n    blockLengths[0] = 1;\n    blockLengths[1] = 1; \n\n    ValueInt<T> v;\n    MPI_Aint startAddr, valueAddr, indexAddr;\n    MPI_Address( &v,       &startAddr );\n    MPI_Address( &v.value, &valueAddr );\n    MPI_Address( &v.index, &indexAddr );\n\n    MPI_Aint displs[2];\n    displs[0] = valueAddr - startAddr;\n    displs[1] = indexAddr - startAddr;\n\n    Datatype& type = ValueIntType<T>();\n    MPI_Type_create_struct( 2, blockLengths, displs, typeList, &type );\n    MPI_Type_commit( &type );\n}\ntemplate void CreateValueIntType<Int>();\ntemplate void CreateValueIntType<float>();\ntemplate void CreateValueIntType<double>();\n\ntemplate<>\nvoid CreateMaxLocOp<Int>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"CreateMaxLocOp<Int>\");\n#endif\n    OpCreate( (UserFunction*)MaxLocFunc<Int>, true, ::maxLocIntOp );\n}\n\ntemplate<>\nvoid CreateMaxLocOp<float>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"CreateMaxLocOp<float>\");\n#endif\n    OpCreate( (UserFunction*)MaxLocFunc<float>, true, ::maxLocFloatOp );\n}\n\ntemplate<>\nvoid CreateMaxLocOp<double>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"CreateMaxLocOp<double>\");\n#endif\n    OpCreate( (UserFunction*)MaxLocFunc<double>, true, ::maxLocDoubleOp );\n}\n\ntemplate<>\nvoid DestroyMaxLocOp<Int>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"DestroyMaxLocOp<Int>\");\n#endif\n    OpFree( ::maxLocIntOp );\n}\n\ntemplate<>\nvoid DestroyMaxLocOp<float>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"DestroyMaxLocOp<float>\");\n#endif\n    OpFree( ::maxLocFloatOp );\n}\n\ntemplate<>\nvoid DestroyMaxLocOp<double>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"DestroyMaxLocOp<double>\");\n#endif\n    OpFree( ::maxLocDoubleOp );\n}\n\ntemplate<>\nOp MaxLocOp<Int>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"MaxLocOp<Int>\");\n#endif\n    return ::maxLocIntOp;\n}\n\ntemplate<>\nOp MaxLocOp<float>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"MaxLocOp<float>\");\n#endif\n    return ::maxLocFloatOp;\n}\n\ntemplate<>\nOp MaxLocOp<double>()\n{\n#ifndef RELEASE\n    CallStackEntry cse(\"MaxLocOp<double>\");\n#endif\n    return ::maxLocDoubleOp;\n}\n\ntemplate void\nMaxLocFunc<Int>\n( ValueInt<Int>* inData, ValueInt<Int>* outData, int* length, \n  Datatype* datatype );\ntemplate void\nMaxLocFunc<float>\n( ValueInt<float>* inData, ValueInt<float>* outData, int* length, \n  Datatype* datatype );\ntemplate void\nMaxLocFunc<double>\n( ValueInt<double>* inData, ValueInt<double>* outData, int* length, \n  Datatype* datatype );\n\n} \/\/ namespace mpi\n} \/\/ namespace elem\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of Slideshow.\n * Copyright (C) 2013 David Sveningsson <ext@sidvind.com>\n *\n * Slideshow 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 * Slideshow is distributed in the hope that it 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 Slideshow.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include \"module_loader.h\"\n#include \"opengl.h\"\n#include \"graphics.h\"\n#include \"log.hpp\"\n#include \"path.h\"\n#include \"Transition.h\"\n\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cerrno>\n#include <cmath>\n#include <getopt.h>\n#include <SDL\/SDL.h>\n#include <GL\/glew.h>\n#include <IL\/il.h>\n#include <IL\/ilu.h>\n\nenum Mode {\n\tMODE_PREVIEW = 0,\n\tMODE_LIST,\n};\n\nstatic const char* program_name;\nstatic enum Mode mode = MODE_PREVIEW;\nstatic bool fullscreen = false;\nstatic int width = 0;\nstatic int height = 0;\nstatic bool running = true;\nstatic const char* name = \"fade\";\nstatic bool automatic = true;\nstatic float s = 0.0f;\nstatic enum Severity severity = Log_Info;\nstatic float min(float a, float b){\n\treturn a < b ? a : b;\n}\n\nstatic float max(float a, float b){\n\treturn a > b ? a : b;\n}\n\nstatic float clamp(float x, float hi, float lo){\n\tif ( x > hi ) return hi;\n\tif ( x < lo ) return lo;\n\treturn x;\n}\n\nstatic void init(){\n\t\/* use default resolution 0x0 (native) for fullscreen and 800x600 for\n\t   windowed *\/\n\tif ( !fullscreen && width == 0 ){\n\t\twidth = 800;\n\t\theight = 600;\n\t}\n\n\t\/* Initialize SDL *\/\n\tif ( SDL_Init(SDL_INIT_VIDEO) < 0 ){\n\t\tfprintf(stderr, \"%s: Failed to initialize SDL: %s\", program_name, SDL_GetError());\n\t\texit(1);\n\t}\n\tif ( SDL_SetVideoMode(width, height, 0, (fullscreen ? SDL_FULLSCREEN : 0) | SDL_OPENGL) == NULL ){\n\t\tfprintf(stderr, \"%s: Failed to initialize SDL: %s\", program_name, SDL_GetError());\n\t\texit(1);\n\t}\n\tSDL_GL_SetAttribute(SDL_GL_SWAP_CONTROL, 1);\n\n\t\/* read actual resolution *\/\n\tconst SDL_VideoInfo* vi = SDL_GetVideoInfo();\n\tif ( !vi ){\n\t\tfprintf(stderr, \"%s: SDL_GetVideoInfo() failed\\n\", program_name);\n\t\texit(1);\n\t}\n\twidth = vi->current_w;\n\theight = vi->current_h;\n\n\tgraphics_init(width, height);\n\tgraphics_load_image(\"resources\/transition_a.png\", 1);\n\tgraphics_load_image(\"resources\/transition_b.png\", 1);\n\n\t\/* load transition module *\/\n\tmoduleloader_init(pluginpath());\n\tgraphics_set_transition(name);\n}\n\nstatic void cleanup(){\n\tSDL_Quit();\n}\n\nstatic void update(){\n\tSDL_Event event;\n\twhile(SDL_PollEvent(&event) ){\n\t\tswitch(event.type){\n\t\tcase SDL_KEYDOWN:\n\t\t\tswitch ( event.key.keysym.sym ){\n\t\t\tcase SDLK_ESCAPE:\n\t\t\t\trunning = false;\n\t\t\t\tbreak;\n\n\t\t\tcase SDLK_LEFT:\n\t\t\tcase SDLK_RIGHT:\n\t\t\t\tautomatic = false;\n\t\t\t\tbreak;\n\n\t\t\tcase SDLK_SPACE:\n\t\t\t\tautomatic = true;\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase SDL_MOUSEBUTTONDOWN:\n\t\t\tif ( event.button.button == 4){\n\t\t\t\tautomatic = false;\n\t\t\t\ts = max(s - 0.02f, 0.0f);\n\t\t\t} else if ( event.button.button == 5){\n\t\t\t\tautomatic = 0;\n\t\t\t\ts = min(s + 0.02f, 1.0f);\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase SDL_QUIT:\n\t\t\trunning = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tUint8* keys = SDL_GetKeyState(NULL);\n\tif ( keys[SDLK_LEFT]  ) s = max(s - 0.01f, 0.0f);\n\tif ( keys[SDLK_RIGHT] ) s = min(s + 0.01f, 1.0f);\n\n\tif ( automatic ){\n\t\tconst Uint32 t = SDL_GetTicks();\n\t\tconst float x = (float)t \/ 1000.0f;\n\t\ts = clamp(asinf(sinf(x)) \/ (float)M_PI_2, 0.5f, -0.5f) + 0.5f;\n\t}\n}\n\nstatic void render(){\n\tglClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\tgraphics_render(s);\n\tSDL_GL_SwapBuffers();\n}\n\nstatic int preview(){\n\tinit();\n\twhile ( running ){\n\t\tupdate();\n\t\trender();\n\t}\n\tcleanup();\n\treturn 0;\n}\n\nstatic int list_transitions(){\n\tmoduleloader_init(pluginpath());\n\tmodule_enumerate(TRANSITION_MODULE, [](const char* name, const module_handle mod){\n\t\tprintf(\"%s:%s\\n\", name, module_get_name(mod));\n\t});\n\treturn 0;\n}\n\nstatic const char* shortopts = \"lfbvh\";\nstatic struct option longopts[] = {\n\t{\"list\",        no_argument, 0, 'l'},\n\t{\"fullscreen\",  no_argument, 0, 'f'},\n\t{\"vebose\",      no_argument, 0, 'v'},\n\t{\"help\",        no_argument, 0, 'h'},\n\t{0, 0, 0, 0}, \/* sentinel *\/\n};\n\nstatic void show_usage(void){\n\tprintf(\"%s-%s\\n\", program_name, VERSION);\n\tprintf(\"(c) 2013 David Sveningsson <ext@sidvind.com>\\n\\n\");\n\tprintf(\"Preview and manage slideshow transitions.\\n\");\n\tprintf(\"Usage: %s [OPTIONS] [TRANSITION]\\n\\n\"\n\t       \"  -l, --list                 List available transitions\\n\"\n\t       \"  -f, --fullscreen           Run in fullscreen mode\\n\"\n\t       \"  -b                         Format output as machine-parsable text\\n\"\n\t       \"  -v, --verbose              Verbose output\\n\"\n\t       \"  -h, --help                 Show this text.\\n\",\n\t       program_name);\n}\n\nint main(int argc, char* argv[]){\n\t\/* extract program name from path. e.g. \/path\/to\/foo -> foo *\/\n\tconst char* separator = strrchr(argv[0], '\/');\n\tif ( separator ){\n\t\tprogram_name = separator + 1;\n\t} else {\n\t\tprogram_name = argv[0];\n\t}\n\n\tint option_index = 0;\n\tint op;\n\n\t\/* parse arguments *\/\n\twhile ( (op=getopt_long(argc, argv, shortopts, longopts, &option_index)) != -1 ){\n\t\tswitch ( op ){\n\t\tcase 'l': \/* --list *\/\n\t\t\tmode = MODE_LIST;\n\t\t\tbreak;\n\n\t\tcase 'f': \/* --fullscreen *\/\n\t\t\tfullscreen = true;\n\t\t\tbreak;\n\n\t\tcase 'b':\n\t\t\t\/* not implemented as of now as the output is already machine-parsable but\n\t\t\t   in case it changes this should be implemented *\/\n\t\t\tbreak;\n\n\t\tcase 'v':\n\t\t\tseverity = Log_Debug;\n\t\t\tbreak;\n\n\t\tcase 'h': \/* --help *\/\n\t\t\tshow_usage();\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tif ( optind < argc ){\n\t\tname = argv[optind];\n\t}\n\n\tint (*func[])() = {\n\t\tpreview,\n\t\tlist_transitions,\n\t};\n\n\tLog::add_destination(new FileDestination(stdout), severity);\n\treturn func[mode]();\n}\n<commit_msg>cosmetic: alignment<commit_after>\/**\n * This file is part of Slideshow.\n * Copyright (C) 2013 David Sveningsson <ext@sidvind.com>\n *\n * Slideshow 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 * Slideshow is distributed in the hope that it 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 Slideshow.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include \"module_loader.h\"\n#include \"opengl.h\"\n#include \"graphics.h\"\n#include \"log.hpp\"\n#include \"path.h\"\n#include \"Transition.h\"\n\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cerrno>\n#include <cmath>\n#include <getopt.h>\n#include <SDL\/SDL.h>\n#include <GL\/glew.h>\n#include <IL\/il.h>\n#include <IL\/ilu.h>\n\nenum Mode {\n\tMODE_PREVIEW = 0,\n\tMODE_LIST,\n};\n\nstatic const char* program_name;\nstatic enum Mode mode = MODE_PREVIEW;\nstatic bool fullscreen = false;\nstatic int width = 0;\nstatic int height = 0;\nstatic bool running = true;\nstatic const char* name = \"fade\";\nstatic bool automatic = true;\nstatic float s = 0.0f;\nstatic enum Severity severity = Log_Info;\nstatic float min(float a, float b){\n\treturn a < b ? a : b;\n}\n\nstatic float max(float a, float b){\n\treturn a > b ? a : b;\n}\n\nstatic float clamp(float x, float hi, float lo){\n\tif ( x > hi ) return hi;\n\tif ( x < lo ) return lo;\n\treturn x;\n}\n\nstatic void init(){\n\t\/* use default resolution 0x0 (native) for fullscreen and 800x600 for\n\t   windowed *\/\n\tif ( !fullscreen && width == 0 ){\n\t\twidth = 800;\n\t\theight = 600;\n\t}\n\n\t\/* Initialize SDL *\/\n\tif ( SDL_Init(SDL_INIT_VIDEO) < 0 ){\n\t\tfprintf(stderr, \"%s: Failed to initialize SDL: %s\", program_name, SDL_GetError());\n\t\texit(1);\n\t}\n\tif ( SDL_SetVideoMode(width, height, 0, (fullscreen ? SDL_FULLSCREEN : 0) | SDL_OPENGL) == NULL ){\n\t\tfprintf(stderr, \"%s: Failed to initialize SDL: %s\", program_name, SDL_GetError());\n\t\texit(1);\n\t}\n\tSDL_GL_SetAttribute(SDL_GL_SWAP_CONTROL, 1);\n\n\t\/* read actual resolution *\/\n\tconst SDL_VideoInfo* vi = SDL_GetVideoInfo();\n\tif ( !vi ){\n\t\tfprintf(stderr, \"%s: SDL_GetVideoInfo() failed\\n\", program_name);\n\t\texit(1);\n\t}\n\twidth = vi->current_w;\n\theight = vi->current_h;\n\n\tgraphics_init(width, height);\n\tgraphics_load_image(\"resources\/transition_a.png\", 1);\n\tgraphics_load_image(\"resources\/transition_b.png\", 1);\n\n\t\/* load transition module *\/\n\tmoduleloader_init(pluginpath());\n\tgraphics_set_transition(name);\n}\n\nstatic void cleanup(){\n\tSDL_Quit();\n}\n\nstatic void update(){\n\tSDL_Event event;\n\twhile(SDL_PollEvent(&event) ){\n\t\tswitch(event.type){\n\t\tcase SDL_KEYDOWN:\n\t\t\tswitch ( event.key.keysym.sym ){\n\t\t\tcase SDLK_ESCAPE:\n\t\t\t\trunning = false;\n\t\t\t\tbreak;\n\n\t\t\tcase SDLK_LEFT:\n\t\t\tcase SDLK_RIGHT:\n\t\t\t\tautomatic = false;\n\t\t\t\tbreak;\n\n\t\t\tcase SDLK_SPACE:\n\t\t\t\tautomatic = true;\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase SDL_MOUSEBUTTONDOWN:\n\t\t\tif ( event.button.button == 4){\n\t\t\t\tautomatic = false;\n\t\t\t\ts = max(s - 0.02f, 0.0f);\n\t\t\t} else if ( event.button.button == 5){\n\t\t\t\tautomatic = 0;\n\t\t\t\ts = min(s + 0.02f, 1.0f);\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase SDL_QUIT:\n\t\t\trunning = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tUint8* keys = SDL_GetKeyState(NULL);\n\tif ( keys[SDLK_LEFT]  ) s = max(s - 0.01f, 0.0f);\n\tif ( keys[SDLK_RIGHT] ) s = min(s + 0.01f, 1.0f);\n\n\tif ( automatic ){\n\t\tconst Uint32 t = SDL_GetTicks();\n\t\tconst float x = (float)t \/ 1000.0f;\n\t\ts = clamp(asinf(sinf(x)) \/ (float)M_PI_2, 0.5f, -0.5f) + 0.5f;\n\t}\n}\n\nstatic void render(){\n\tglClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\tgraphics_render(s);\n\tSDL_GL_SwapBuffers();\n}\n\nstatic int preview(){\n\tinit();\n\twhile ( running ){\n\t\tupdate();\n\t\trender();\n\t}\n\tcleanup();\n\treturn 0;\n}\n\nstatic int list_transitions(){\n\tmoduleloader_init(pluginpath());\n\tmodule_enumerate(TRANSITION_MODULE, [](const char* name, const module_handle mod){\n\t\tprintf(\"%s:%s\\n\", name, module_get_name(mod));\n\t});\n\treturn 0;\n}\n\nstatic const char* shortopts = \"lfbvh\";\nstatic struct option longopts[] = {\n\t{\"list\",        no_argument,       0, 'l'},\n\t{\"fullscreen\",  no_argument,       0, 'f'},\n\t{\"vebose\",      no_argument,       0, 'v'},\n\t{\"help\",        no_argument,       0, 'h'},\n\t{0, 0, 0, 0}, \/* sentinel *\/\n};\n\nstatic void show_usage(void){\n\tprintf(\"%s-%s\\n\", program_name, VERSION);\n\tprintf(\"(c) 2013 David Sveningsson <ext@sidvind.com>\\n\\n\");\n\tprintf(\"Preview and manage slideshow transitions.\\n\");\n\tprintf(\"Usage: %s [OPTIONS] [TRANSITION]\\n\\n\"\n\t       \"  -l, --list                 List available transitions\\n\"\n\t       \"  -f, --fullscreen           Run in fullscreen mode\\n\"\n\t       \"  -b                         Format output as machine-parsable text\\n\"\n\t       \"  -v, --verbose              Verbose output\\n\"\n\t       \"  -h, --help                 Show this text.\\n\",\n\t       program_name);\n}\n\nint main(int argc, char* argv[]){\n\t\/* extract program name from path. e.g. \/path\/to\/foo -> foo *\/\n\tconst char* separator = strrchr(argv[0], '\/');\n\tif ( separator ){\n\t\tprogram_name = separator + 1;\n\t} else {\n\t\tprogram_name = argv[0];\n\t}\n\n\tint option_index = 0;\n\tint op;\n\n\t\/* parse arguments *\/\n\twhile ( (op=getopt_long(argc, argv, shortopts, longopts, &option_index)) != -1 ){\n\t\tswitch ( op ){\n\t\tcase 'l': \/* --list *\/\n\t\t\tmode = MODE_LIST;\n\t\t\tbreak;\n\n\t\tcase 'f': \/* --fullscreen *\/\n\t\t\tfullscreen = true;\n\t\t\tbreak;\n\n\t\tcase 'b':\n\t\t\t\/* not implemented as of now as the output is already machine-parsable but\n\t\t\t   in case it changes this should be implemented *\/\n\t\t\tbreak;\n\n\t\tcase 'v':\n\t\t\tseverity = Log_Debug;\n\t\t\tbreak;\n\n\t\tcase 'h': \/* --help *\/\n\t\t\tshow_usage();\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tif ( optind < argc ){\n\t\tname = argv[optind];\n\t}\n\n\tint (*func[])() = {\n\t\tpreview,\n\t\tlist_transitions,\n\t};\n\n\tLog::add_destination(new FileDestination(stdout), severity);\n\treturn func[mode]();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Essentially, for\n\n        u(n) = 1 - n + n^2 - ... + n^10\n             = (n^11 + 1) \/ (n + 1)\n\n    we look for the interpolating polynomial p_1, p_2, ..., p_10 for the first\n    1, 2, ..., 10 terms of u_n.\n\n    For each interpolating polynomial p_i we find the first value of n such that\n    p_i(n) != u(n). The values p_i(n) are collected and summed to give the\n    required result.\n\n    For interpolation, we use Lagrange's Interpolation. The idea is that we\n    explictly construct terms for each value in the set of interpolating points.\n    Every term will be \"annihilated\" except when n equals to the x value of the\n    point corresponding to the term. For example to interpolating (1, 1), (2,\n    8), (3, 15), we have\n\n        p(n) = 1 * (n - 8)(n - 15) \/ ((1 - 8)(1 - 15)) +\n               8 * (n - 1)(n - 15) \/ ((2 - 1)(2 - 15))\n               15 * (n - 1)(n - 2) \/ ((3 - 1)(3 - 2))\n\n    Indeed, for each term, when n is not equal to the corresponding x value, the\n    numerator is \"annihilated\" and the term becomes zero. If n is equal to the\n    corresponding x value, the denominator is constructed to cancel out the\n    numerator to give 1, which is multiplied by the y value of the point.\n*\/\n\n#include <iostream>\n#include <vector>\n#include <gmpxx.h>\n#include \"number_util.h\"\n\nstruct term_struct\n{\n    mpz_class value;\n    std::vector<int> offsets;\n    mpz_class denominator = 1;\n};\n\nstd::vector<term_struct> interpolate(std::vector<mpz_class> values)\n{\n    std::vector<term_struct> terms;\n\n    for (int n = 0; n < values.size(); n++)\n    {\n        mpz_class value = values[n];\n\n        terms.emplace_back();\n        term_struct &term = terms.back();\n        term.value = value;\n        for (int _n = 0; _n < values.size(); _n++)\n        {\n            if (_n != n)\n            {\n                term.offsets.emplace_back(_n + 1);\n                term.denominator *= n - _n;\n            }\n        }\n    }\n\n    return terms;\n}\n\nmpz_class evaluate(std::vector<term_struct> terms, int n)\n{\n    mpz_class s = 0;\n    for (term_struct &term : terms)\n    {\n        mpz_class _s = term.value;\n        for (int &offset : term.offsets)\n            _s *= n - offset;\n        _s \/= term.denominator;\n        s += _s;\n    }\n    return s;\n}\n\nmpz_class evaluate_U(int n)\n{\n    return (util::pow(n, 11) + 1) \/ (n + 1);\n}\n\nint main()\n{\n    mpz_class s = 0;\n    for (int k = 1; k < 11; k++)\n    {\n        std::vector<mpz_class> values;\n        for (int n = 1; n <= k; n++)\n            values.emplace_back(evaluate_U(n));\n\n        std::vector<term_struct> polynomial = interpolate(values);\n\n        int n = 0;\n        mpz_class p_n;\n        do {\n            n++;\n            p_n = evaluate(polynomial, n);\n        } while(p_n == values[n - 1]);\n        s += p_n;\n    }\n\n    std::cout << s;\n}\n<commit_msg>Enforce const correctness.<commit_after>\/*\n    Essentially, for\n\n        u(n) = 1 - n + n^2 - ... + n^10\n             = (n^11 + 1) \/ (n + 1)\n\n    we look for the interpolating polynomial p_1, p_2, ..., p_10 for the first\n    1, 2, ..., 10 terms of u_n.\n\n    For each interpolating polynomial p_i we find the first value of n such that\n    p_i(n) != u(n). The values p_i(n) are collected and summed to give the\n    required result.\n\n    For interpolation, we use Lagrange's Interpolation. The idea is that we\n    explictly construct terms for each value in the set of interpolating points.\n    Every term will be \"annihilated\" except when n equals to the x value of the\n    point corresponding to the term. For example to interpolating (1, 1), (2,\n    8), (3, 15), we have\n\n        p(n) = 1 * (n - 8)(n - 15) \/ ((1 - 8)(1 - 15)) +\n               8 * (n - 1)(n - 15) \/ ((2 - 1)(2 - 15))\n               15 * (n - 1)(n - 2) \/ ((3 - 1)(3 - 2))\n\n    Indeed, for each term, when n is not equal to the corresponding x value, the\n    numerator is \"annihilated\" and the term becomes zero. If n is equal to the\n    corresponding x value, the denominator is constructed to cancel out the\n    numerator to give 1, which is multiplied by the y value of the point.\n*\/\n\n#include <iostream>\n#include <vector>\n#include <gmpxx.h>\n#include \"number_util.h\"\n\nstruct term_struct\n{\n    mpz_class value;\n    std::vector<int> offsets;\n    mpz_class denominator = 1;\n};\n\nstd::vector<term_struct> interpolate(std::vector<mpz_class> const &values)\n{\n    std::vector<term_struct> terms;\n\n    for (int n = 0; n < values.size(); n++)\n    {\n        mpz_class value = values[n];\n\n        terms.emplace_back();\n        term_struct &term = terms.back();\n        term.value = value;\n        for (int _n = 0; _n < values.size(); _n++)\n        {\n            if (_n != n)\n            {\n                term.offsets.emplace_back(_n + 1);\n                term.denominator *= n - _n;\n            }\n        }\n    }\n\n    return terms;\n}\n\nmpz_class evaluate(std::vector<term_struct> const &terms, int n)\n{\n    mpz_class s = 0;\n    for (term_struct const &term : terms)\n    {\n        mpz_class _s = term.value;\n        for (int const &offset : term.offsets)\n            _s *= n - offset;\n        _s \/= term.denominator;\n        s += _s;\n    }\n    return s;\n}\n\nmpz_class evaluate_U(int n)\n{\n    return (util::pow(n, 11) + 1) \/ (n + 1);\n}\n\nint main()\n{\n    mpz_class s = 0;\n    for (int k = 1; k < 11; k++)\n    {\n        std::vector<mpz_class> values;\n        for (int n = 1; n <= k; n++)\n            values.emplace_back(evaluate_U(n));\n\n        std::vector<term_struct> polynomial = interpolate(values);\n\n        int n = 0;\n        mpz_class p_n;\n        do {\n            n++;\n            p_n = evaluate(polynomial, n);\n        } while(p_n == values[n - 1]);\n        s += p_n;\n    }\n\n    std::cout << s;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    We need primes p such that\n\n       10^(10^9) \\equiv 1 \\pmod 9p\n\n    For some p, we need to look for a power q such that:\n\n       1) 10^q \\equiv 1 \\pmod 9p\n       2) q | 10^9 (so that RHS remains as 1 while raising both sides to the\n          power of the quotient)\n\n    If such q exists then p is a prime factor.\n\n    Since q | 10^9, q must have the form q = 2^a5^b for some non-negative\n    integers 0 <= a, b <= 9.\n\n    Furthermore, we know that if 10^q \\equiv 1 \\pmod 9p, then q | \\phi(9p). In\n    addition, \\phi(9p) can be calculated easily: \\phi(27) = 18 and \\phi(9p) =\n    6(p - 1) for p > 3.\n\n    Combining the two constraints, we need to look for factors q of \\phi(9p) of\n    the form q = 2^a5^b where 0 <= a, b <= 9 such that 9n | 10^q.\n*\/\n\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include \"number_util.h\"\n#include \"prime_util.h\"\n\nbool is_factor(int p)\n{\n    int order_max = p == 3 ? 18 : 6 * (p - 1);\n    int a_max = 0;\n    int b_max = 0;\n    while (order_max % 2 == 0)\n    {\n        a_max++;\n        order_max \/= 2;\n    }\n    while (order_max % 5 == 0)\n    {\n        b_max++;\n        order_max \/= 5;\n    }\n    a_max = std::min(a_max, 9);\n    b_max = std::min(b_max, 9);\n\n    for (int a = 0; a <= a_max; a++)\n    {\n        for (int b = 0; b <= b_max; b++)\n        {\n            unsigned long long q = std::pow(2, a) * std::pow(5, b);\n            if (util::pow(mpz_class(10), q) % (9 * p) == 1)\n                return true;\n        }\n    }\n\n    return false;\n}\n\nint main()\n{\n    std::vector<int> primes = { 2 };\n    int s = 0;\n    int count = 0;\n    while (count < 40)\n    {\n        int &prime = primes.back();\n        if (is_factor(prime))\n        {\n            s += prime;\n            count++;\n        }\n        primes.emplace_back(util::get_next_prime(prime));\n    }\n\n    std::cout << s;\n}\n<commit_msg>Changed to pow_mod.<commit_after>\/*\n    We need primes p such that\n\n       10^(10^9) \\equiv 1 \\pmod 9p\n\n    For some p, we need to look for a power q such that:\n\n       1) 10^q \\equiv 1 \\pmod 9p\n       2) q | 10^9 (so that RHS remains as 1 while raising both sides to the\n          power of the quotient)\n\n    If such q exists then p is a prime factor.\n\n    Since q | 10^9, q must have the form q = 2^a5^b for some non-negative\n    integers 0 <= a, b <= 9.\n\n    Furthermore, we know that if 10^q \\equiv 1 \\pmod 9p, then q | \\phi(9p). In\n    addition, \\phi(9p) can be calculated easily: \\phi(27) = 18 and \\phi(9p) =\n    6(p - 1) for p > 3.\n\n    Combining the two constraints, we need to look for factors q of \\phi(9p) of\n    the form q = 2^a5^b where 0 <= a, b <= 9 such that 9n | 10^q.\n*\/\n\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include \"number_util.h\"\n#include \"prime_util.h\"\n\nbool is_factor(int p)\n{\n    int order_max = p == 3 ? 18 : 6 * (p - 1);\n    int a_max = 0;\n    int b_max = 0;\n    while (order_max % 2 == 0)\n    {\n        a_max++;\n        order_max \/= 2;\n    }\n    while (order_max % 5 == 0)\n    {\n        b_max++;\n        order_max \/= 5;\n    }\n    a_max = std::min(a_max, 9);\n    b_max = std::min(b_max, 9);\n\n    for (int a = 0; a <= a_max; a++)\n    {\n        for (int b = 0; b <= b_max; b++)\n        {\n            unsigned long long q = std::pow(2, a) * std::pow(5, b);\n            if (util::pow_mod(mpz_class(10), q, mpz_class(9 * p)) == 1)\n                return true;\n        }\n    }\n\n    return false;\n}\n\nint main()\n{\n    std::vector<int> primes = { 2 };\n    int s = 0;\n    int count = 0;\n    while (count < 40)\n    {\n        int &prime = primes.back();\n        if (is_factor(prime))\n        {\n            s += prime;\n            count++;\n        }\n        primes.emplace_back(util::get_next_prime(prime));\n    }\n\n    std::cout << s;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <memory>\r\n#include <stdexcept>\r\n#include <SDL2\/SDL.h>\r\n#include <SDL2\/SDL_opengl.h>\r\n#include <SDL2\/SDL_mixer.h>\r\n#include \"App.h\"\r\n#include \"Game.h\"\r\n#include \"Menu.h\"\r\n#include \"HighScores.h\"\r\n\r\nnamespace typing\r\n{\r\n    const unsigned int App::MAJOR_VERSION  = 1;\r\n    const unsigned int App::MINOR_VERSION  = 0;\r\n    const float App::SCREEN_WIDTH          = 800.0f;\r\n    const float App::SCREEN_HEIGHT         = 600.0f;\r\n\r\n    std::auto_ptr<App> App::m_singleton(new App());\r\n    App& App::GetApp ()\r\n    {\r\n        return *(m_singleton.get());\r\n    }\r\n\r\n    void App::Init ()\r\n    {\r\n        \/\/ Initialise SDL\r\n        if (SDL_Init(SDL_INIT_VIDEO | SDL_INIT_AUDIO))\r\n        {\r\n            \/\/ TODO: throw\r\n        }\r\n\r\n        \/\/ Initialise video\r\n        SDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\r\n        SDL_GL_SetAttribute(SDL_GL_DEPTH_SIZE, 16);\r\n\r\n        m_window = SDL_CreateWindow(\"Type Or Die!\",\r\n                                    SDL_WINDOWPOS_UNDEFINED,\r\n                                    SDL_WINDOWPOS_UNDEFINED,\r\n                                    800, 600,\r\n                                    SDL_WINDOW_OPENGL);\r\n        if (!m_window) {\r\n            \/\/ TODO: throw\r\n        }\r\n\r\n        if (!SDL_GL_CreateContext(m_window)) {\r\n            \/\/ TODO: throw\r\n        }\r\n\r\n        glClearColor(0.0f, 0.0f, 0.0f, 1.0f);\r\n        glClearDepth(1.0f);\r\n\r\n        glHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);\r\n        glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\r\n        glEnable(GL_LINE_SMOOTH);\r\n        glDisable(GL_LIGHTING);\r\n        glEnable(GL_TEXTURE_2D);\r\n        glEnable(GL_BLEND);\r\n\r\n        glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\r\n\r\n        glMatrixMode(GL_PROJECTION_MATRIX);\r\n        glOrtho(0.0, GetScreenWidth(), GetScreenHeight(), 0.0, 1024.0, -1024.0);\r\n        glMatrixMode(GL_MODELVIEW_MATRIX);\r\n\r\n        \/\/ Initialise audio\r\n        int     audio_rate     = 22050;\r\n        Uint16  audio_format   = AUDIO_S16;\r\n        int     audio_channels = 2;\r\n        int     audio_buffers  = 4096;\r\n        if (Mix_OpenAudio(audio_rate, audio_format, audio_channels, audio_buffers))\r\n        {\r\n            \/\/ TODO: throw\r\n        }\r\n\r\n        \/\/ Initialise game stuff\r\n        SCORES.Load();\r\n        MENU.Init();\r\n        GAME.Init();\r\n    }\r\n\r\n    void App::Run ()\r\n    {\r\n        SDL_Event ev;\r\n\r\n        m_done = false;\r\n        while (!m_done)\r\n        {\r\n            \/\/ Get the time of this frame\r\n            m_currentTime = static_cast<float>(SDL_GetTicks()) \/ 1000.0f;\r\n\r\n            SDL_StartTextInput();\r\n            while(SDL_PollEvent(&ev))\r\n            {\r\n                switch(ev.type)\r\n                {\r\n                case SDL_KEYDOWN:\r\n                    MENU.OnKeyDown(ev.key.keysym.sym);\r\n\r\n                    if (!MENU.IsActive()) {\r\n                        GAME.OnKeyDown(ev.key.keysym.sym);\r\n                    }\r\n                    break;\r\n\r\n                case SDL_TEXTINPUT:\r\n                    for (char *c = ev.text.text; *c != '\\0'; c++) {\r\n                        MENU.OnType(*c);\r\n\r\n                        if (!MENU.IsActive()) {\r\n                            GAME.OnType(*c);\r\n                        }\r\n                    }\r\n                    break;\r\n\r\n                case SDL_QUIT:\r\n                    m_done = true;\r\n                    break;\r\n                }\r\n            }\r\n\r\n            GAME.Update();\r\n            MENU.Update();\r\n\r\n            glClear(GL_STENCIL_BUFFER_BIT | GL_DEPTH_BUFFER_BIT | GL_COLOR_BUFFER_BIT);\r\n\r\n            GAME.Draw();\r\n\r\n            \/\/ All the menu stuff is done in orthographic projection.\r\n            glMatrixMode(GL_MODELVIEW);\r\n            glLoadIdentity();\r\n            glMatrixMode(GL_PROJECTION);\r\n            glLoadIdentity();\r\n            glOrtho(0.0, GetScreenWidth(), GetScreenHeight(), 0.0, 1024.0, -1024.0);\r\n            MENU.Draw();\r\n\r\n            SDL_GL_SwapWindow(m_window);\r\n\r\n            \/\/ Prepare for the next frame\r\n            m_keyStateValid = false;\r\n        }\r\n    }\r\n\r\n    void App::Shutdown ()\r\n    {\r\n        Mix_CloseAudio();\r\n        SDL_Quit();\r\n    }\r\n}\r\n\r\nint main (int argc, char *argv[])\r\n{\r\n    try\r\n    {\r\n        typing::APP.Init();\r\n        typing::APP.Run();\r\n    }\r\n    catch (std::exception &e)\r\n    {\r\n        fprintf(stderr, \"%s\", e.what());\r\n    }\r\n\r\n    typing::APP.Shutdown();\r\n\r\n    return 0;\r\n}\r\n\r\n<commit_msg>Set GL attributes after initializing GL context<commit_after>#include <memory>\r\n#include <stdexcept>\r\n#include <SDL2\/SDL.h>\r\n#include <SDL2\/SDL_opengl.h>\r\n#include <SDL2\/SDL_mixer.h>\r\n#include \"App.h\"\r\n#include \"Game.h\"\r\n#include \"Menu.h\"\r\n#include \"HighScores.h\"\r\n\r\nnamespace typing\r\n{\r\n    const unsigned int App::MAJOR_VERSION  = 1;\r\n    const unsigned int App::MINOR_VERSION  = 0;\r\n    const float App::SCREEN_WIDTH          = 800.0f;\r\n    const float App::SCREEN_HEIGHT         = 600.0f;\r\n\r\n    std::auto_ptr<App> App::m_singleton(new App());\r\n    App& App::GetApp ()\r\n    {\r\n        return *(m_singleton.get());\r\n    }\r\n\r\n    void App::Init ()\r\n    {\r\n        \/\/ Initialise SDL\r\n        if (SDL_Init(SDL_INIT_VIDEO | SDL_INIT_AUDIO))\r\n        {\r\n            \/\/ TODO: throw\r\n        }\r\n\r\n        \/\/ Initialise video\r\n        m_window = SDL_CreateWindow(\"Type Or Die!\",\r\n                                    SDL_WINDOWPOS_UNDEFINED,\r\n                                    SDL_WINDOWPOS_UNDEFINED,\r\n                                    800, 600,\r\n                                    SDL_WINDOW_OPENGL);\r\n        if (!m_window) {\r\n            \/\/ TODO: throw\r\n        }\r\n\r\n        if (!SDL_GL_CreateContext(m_window)) {\r\n            \/\/ TODO: throw\r\n        }\r\n\r\n        SDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\r\n        SDL_GL_SetAttribute(SDL_GL_DEPTH_SIZE, 16);\r\n\r\n        glClearColor(0.0f, 0.0f, 0.0f, 1.0f);\r\n        glClearDepth(1.0f);\r\n\r\n        glHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);\r\n        glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\r\n        glEnable(GL_LINE_SMOOTH);\r\n        glDisable(GL_LIGHTING);\r\n        glEnable(GL_TEXTURE_2D);\r\n        glEnable(GL_BLEND);\r\n\r\n        glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\r\n\r\n        glMatrixMode(GL_PROJECTION_MATRIX);\r\n        glOrtho(0.0, GetScreenWidth(), GetScreenHeight(), 0.0, 1024.0, -1024.0);\r\n        glMatrixMode(GL_MODELVIEW_MATRIX);\r\n\r\n        \/\/ Initialise audio\r\n        int     audio_rate     = 22050;\r\n        Uint16  audio_format   = AUDIO_S16;\r\n        int     audio_channels = 2;\r\n        int     audio_buffers  = 4096;\r\n        if (Mix_OpenAudio(audio_rate, audio_format, audio_channels, audio_buffers))\r\n        {\r\n            \/\/ TODO: throw\r\n        }\r\n\r\n        \/\/ Initialise game stuff\r\n        SCORES.Load();\r\n        MENU.Init();\r\n        GAME.Init();\r\n    }\r\n\r\n    void App::Run ()\r\n    {\r\n        SDL_Event ev;\r\n\r\n        m_done = false;\r\n        while (!m_done)\r\n        {\r\n            \/\/ Get the time of this frame\r\n            m_currentTime = static_cast<float>(SDL_GetTicks()) \/ 1000.0f;\r\n\r\n            SDL_StartTextInput();\r\n            while(SDL_PollEvent(&ev))\r\n            {\r\n                switch(ev.type)\r\n                {\r\n                case SDL_KEYDOWN:\r\n                    MENU.OnKeyDown(ev.key.keysym.sym);\r\n\r\n                    if (!MENU.IsActive()) {\r\n                        GAME.OnKeyDown(ev.key.keysym.sym);\r\n                    }\r\n                    break;\r\n\r\n                case SDL_TEXTINPUT:\r\n                    for (char *c = ev.text.text; *c != '\\0'; c++) {\r\n                        MENU.OnType(*c);\r\n\r\n                        if (!MENU.IsActive()) {\r\n                            GAME.OnType(*c);\r\n                        }\r\n                    }\r\n                    break;\r\n\r\n                case SDL_QUIT:\r\n                    m_done = true;\r\n                    break;\r\n                }\r\n            }\r\n\r\n            GAME.Update();\r\n            MENU.Update();\r\n\r\n            glClear(GL_STENCIL_BUFFER_BIT | GL_DEPTH_BUFFER_BIT | GL_COLOR_BUFFER_BIT);\r\n\r\n            GAME.Draw();\r\n\r\n            \/\/ All the menu stuff is done in orthographic projection.\r\n            glMatrixMode(GL_MODELVIEW);\r\n            glLoadIdentity();\r\n            glMatrixMode(GL_PROJECTION);\r\n            glLoadIdentity();\r\n            glOrtho(0.0, GetScreenWidth(), GetScreenHeight(), 0.0, 1024.0, -1024.0);\r\n            MENU.Draw();\r\n\r\n            SDL_GL_SwapWindow(m_window);\r\n\r\n            \/\/ Prepare for the next frame\r\n            m_keyStateValid = false;\r\n        }\r\n    }\r\n\r\n    void App::Shutdown ()\r\n    {\r\n        Mix_CloseAudio();\r\n        SDL_Quit();\r\n    }\r\n}\r\n\r\nint main (int argc, char *argv[])\r\n{\r\n    try\r\n    {\r\n        typing::APP.Init();\r\n        typing::APP.Run();\r\n    }\r\n    catch (std::exception &e)\r\n    {\r\n        fprintf(stderr, \"%s\", e.what());\r\n    }\r\n\r\n    typing::APP.Shutdown();\r\n\r\n    return 0;\r\n}\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"CPU.h\"\n#include \"Emulator.h\"\n#include \"Types.h\"\n#include \"Log.h\"\n#include \"Random.h\"\n#include \"Font.h\"\n\n#include <cassert>\n\nnamespace\n{\nusing namespace Chip8;\n\ninline int regX(const opcode_t &opcode)\n{\n\treturn ((opcode >> 8) & 0xF);\n}\ninline int regY(const opcode_t &opcode)\n{\n\treturn ((opcode >> 4) & 0xF);\n}\n}\n\nnamespace Chip8\n{\nCPU::CPU(Emulator *emu) : emu(emu)\n{\n\tassert(emu != nullptr);\n\treset();\n}\nCPU::~CPU()\n{\n}\n\nvoid CPU::reset()\n{\n\tpc = Memory::ROM_START;\n\tsp = 0;\n\n\tfor (int i = 0; i < STACK_SIZE; ++i)\n\t{\n\t\tstack[i] = 0;\n\t}\n\n\tdelayTimer = 0;\n\tsoundTimer = 0;\n\ttimeKeep = 0.f;\n\n\tI = 0;\n\tfor (int i = 0; i < 16; ++i)\n\t{\n\t\tV[i] = 0;\n\t}\n}\n\nvoid CPU::step(float seconds)\n{\n\tparseOpcode();\n\ttickTimers(seconds);\n\n\temu->getSound().setInput(soundTimer > 0);\n}\n\nvoid CPU::parseOpcode()\n{\n\tMemory &memory = emu->getMemory();\n\n\topcode_t opcode = memory.read(pc);\n\topcode <<= sizeof(byte_t)*8;\n\topcode |= memory.read(pc+1);\n\n\tpc += sizeof(opcode_t);\n\n\tswitch ((opcode >> 12) & 0xF)\n\t{\n\tcase 0x0:\n\t\tswitch (opcode & 0x0FFF)\n\t\t{\n\t\tcase 0x0E0: emu->getDisplay().clear(); break;\n\t\tcase 0x0EE: pc = pop(); break;\n\t\tdefault: unknownOpcode(opcode); break;\n\t\t}\n\t\tbreak;\n\tcase 0x1: pc = (opcode & 0x0FFF); break;\n\tcase 0x2: callSubroutine(opcode & 0x0FFF); break;\n\tcase 0x3: if (V[regX(opcode)] == (opcode & 0x00FF)) skipInstruction(); break;\n\tcase 0x4: if (V[regX(opcode)] != (opcode & 0x00FF)) skipInstruction(); break;\n\tcase 0x5: if (V[regX(opcode)] == V[regY(opcode)]) skipInstruction(); break;\n\tcase 0x6: V[regX(opcode)] = (opcode & 0x00FF); break;\n\tcase 0x7: V[regX(opcode)] += (opcode & 0x00FF); break;\n\tcase 0x8:\n\t\tswitch (opcode & 0x000F)\n\t\t{\n\t\tcase 0x0: V[regX(opcode)] = V[regY(opcode)]; break;\n\t\tcase 0x1: V[regX(opcode)] |= V[regY(opcode)]; break;\n\t\tcase 0x2: V[regX(opcode)] &= V[regY(opcode)]; break;\n\t\tcase 0x3: V[regX(opcode)] ^= V[regY(opcode)]; break;\n\t\tcase 0x4: V[regX(opcode)] = addSetCarry(V[regX(opcode)], V[regY(opcode)]); break;\n\t\tcase 0x5: V[regX(opcode)] = subtractSetCarry(V[regX(opcode)], V[regY(opcode)]); break;\n\t\tcase 0x6: V[regX(opcode)] = shiftRightSetCarry(V[regX(opcode)], 1); break;\n\t\tcase 0x7: V[regX(opcode)] = subtractSetCarry(V[regY(opcode)], V[regX(opcode)]); break;\n\t\tcase 0xE: V[regX(opcode)] = shiftLeftSetCarry(V[regX(opcode)], 1); break;\n\t\tdefault: unknownOpcode(opcode); break;\n\t\t}\n\t\tbreak;\n\tcase 0x9: if (V[regX(opcode)] != V[regY(opcode)]) skipInstruction(); break;\n\tcase 0xA: I = (opcode & 0x0FFF); break;\n\tcase 0xB: pc = ((opcode & 0x0FFF) + V[0x0]); break;\n\tcase 0xC: V[regX(opcode)] = Random::get() & (opcode & 0x00FF); break;\n\tcase 0xD: V[0xF] = emu->getDisplay().drawSprite(V[regX(opcode)], V[regY(opcode)], emu->getMemory().get(I), (opcode & 0xF)) ? 1 : 0; break;\n\tcase 0xE:\n\t\tswitch (opcode & 0x00FF)\n\t\t{\n\t\tcase 0x9E: if (emu->getInput().isPressed(V[regX(opcode)])) skipInstruction(); break;\n\t\tcase 0xA1: if (!emu->getInput().isPressed(V[regX(opcode)])) skipInstruction(); break;\n\t\tdefault: unknownOpcode(opcode); break;\n\t\t}\n\t\tbreak;\n\tcase 0xF:\n\t\tswitch (opcode & 0x00FF)\n\t\t{\n\t\tcase 0x07: V[regX(opcode)] = delayTimer; break;\n\t\tcase 0x0A: if (emu->getInput().isAnyPressed()) V[regX(opcode)] = emu->getInput().getFirstPressed(); else repeatInstruction(); break;\n\t\tcase 0x15: delayTimer = V[regX(opcode)]; break;\n\t\tcase 0x18: soundTimer = V[regX(opcode)]; break;\n\t\tcase 0x1E: I = addSetOverflow(I, V[regX(opcode)]); break;\n\t\tcase 0x29: I = Memory::FONT_START + (V[regX(opcode)] * Font::HEIGHT); break;\n\t\tcase 0x33: storeDecimal(I, V[regX(opcode)]); break;\n\t\tcase 0x55: storeRegisters(I, regX(opcode)); break;\n\t\tcase 0x65: fillRegisters(I, regX(opcode)); break;\n\t\tdefault: unknownOpcode(opcode); break;\n\t\t}\n\t\tbreak;\n\tdefault: unknownOpcode(opcode); break;\n\t}\n}\nvoid CPU::tickTimers(float seconds)\n{\n\ttimeKeep += seconds;\n\n\tstatic const float SECONDS_PER_TICK = (1.f \/ (float)TIMER_HZ);\n\twhile (timeKeep >= SECONDS_PER_TICK)\n\t{\n\t\ttimeKeep -= SECONDS_PER_TICK;\n\t\tif (delayTimer > 0)\n\t\t\t--delayTimer;\n\t\tif (soundTimer > 0)\n\t\t\t--soundTimer;\n\t}\n}\n\nvoid CPU::push(address_t address)\n{\n\tif (sp >= STACK_SIZE)\n\t{\n\t\tLog::error() << \"Stack overflow\" << std::endl;\n\t}\n\telse\n\t{\n\t\tstack[sp] = address;\n\t\t++sp;\n\t}\n}\naddress_t CPU::pop()\n{\n\tif (sp <= 0)\n\t{\n\t\tLog::error() << \"Stack underflow\" << std::endl;\n\t\treturn 0;\n\t}\n\telse\n\t{\n\t\t--sp;\n\t\taddress_t top = stack[sp];\n\t\treturn top;\n\t}\n}\n\nvoid CPU::storeRegisters(address_t address, int maxReg)\n{\n\tMemory &memory = emu->getMemory();\n\tfor (int i = 0x0; i <= maxReg; ++i)\n\t{\n\t\tmemory.write(address + i, V[i]);\n\t}\n}\nvoid CPU::fillRegisters(address_t address, int maxReg)\n{\n\tMemory &memory = emu->getMemory();\n\tfor (int i = 0x0; i <= maxReg; ++i)\n\t{\n\t\tV[i] = memory.read(address + i);\n\t}\n}\n\nvoid CPU::storeDecimal(address_t address, byte_t byte)\n{\n\tMemory &memory = emu->getMemory();\n\tbyte_t hundreds = byte \/ 100;\n\tbyte -= hundreds * 100;\n\tbyte_t tens = byte \/ 10;\n\tbyte -= tens * 10;\n\tbyte_t ones = byte;\n\tmemory.write(address + 0, hundreds);\n\tmemory.write(address + 1, tens);\n\tmemory.write(address + 2, ones);\n}\n\nvoid CPU::skipInstruction()\n{\n\tpc += sizeof(opcode_t);\n}\nvoid CPU::repeatInstruction()\n{\n\tpc -= sizeof(opcode_t);\n}\nvoid CPU::callSubroutine(address_t address)\n{\n\tpush(pc + sizeof(opcode_t));\n\tpc = address;\n}\n\nbyte_t CPU::addSetCarry(byte_t v1, byte_t v2)\n{\n\tint result = static_cast<int>(v1) + static_cast<int>(v2);\n\tV[0xF] = (result > 0xFF ? 1 : 0);\n\treturn static_cast<byte_t>(result);\n}\nbyte_t CPU::subtractSetCarry(byte_t v1, byte_t v2)\n{\n\tV[0xF] = (v1 >= v2 ? 1 : 0);\n\treturn v1 - v2;\n}\n\naddress_t CPU::addSetOverflow(address_t v1, address_t v2)\n{\n\tint result = static_cast<int>(v1) + static_cast<int>(v2);\n\tV[0xF] = (result > 0xFFF ? 1 : 0);\n\treturn static_cast<address_t>(result);\n}\n\nbyte_t CPU::shiftRightSetCarry(byte_t v, int steps)\n{\n\tV[0xF] = (v & 0x1);\n\treturn (v >> steps);\n}\nbyte_t CPU::shiftLeftSetCarry(byte_t v, int steps)\n{\n\tV[0xF] = ((v >> 7) & 0x1);\n\treturn (v << steps);\n}\n\nvoid CPU::unknownOpcode(opcode_t opcode)\n{\n\tLog::error() << \"Unknown opcode 0x\" << std::hex << opcode << std::endl;\n}\n}\n<commit_msg>Slightly changed the look of a for loop<commit_after>#include \"CPU.h\"\n#include \"Emulator.h\"\n#include \"Types.h\"\n#include \"Log.h\"\n#include \"Random.h\"\n#include \"Font.h\"\n\n#include <cassert>\n\nnamespace\n{\nusing namespace Chip8;\n\ninline int regX(const opcode_t &opcode)\n{\n\treturn ((opcode >> 8) & 0xF);\n}\ninline int regY(const opcode_t &opcode)\n{\n\treturn ((opcode >> 4) & 0xF);\n}\n}\n\nnamespace Chip8\n{\nCPU::CPU(Emulator *emu) : emu(emu)\n{\n\tassert(emu != nullptr);\n\treset();\n}\nCPU::~CPU()\n{\n}\n\nvoid CPU::reset()\n{\n\tpc = Memory::ROM_START;\n\tsp = 0;\n\n\tfor (int i = 0; i < STACK_SIZE; ++i)\n\t{\n\t\tstack[i] = 0;\n\t}\n\n\tdelayTimer = 0;\n\tsoundTimer = 0;\n\ttimeKeep = 0.f;\n\n\tI = 0;\n\tfor (int i = 0x0; i <= 0xF; ++i)\n\t{\n\t\tV[i] = 0;\n\t}\n}\n\nvoid CPU::step(float seconds)\n{\n\tparseOpcode();\n\ttickTimers(seconds);\n\n\temu->getSound().setInput(soundTimer > 0);\n}\n\nvoid CPU::parseOpcode()\n{\n\tMemory &memory = emu->getMemory();\n\n\topcode_t opcode = memory.read(pc);\n\topcode <<= sizeof(byte_t)*8;\n\topcode |= memory.read(pc+1);\n\n\tpc += sizeof(opcode_t);\n\n\tswitch ((opcode >> 12) & 0xF)\n\t{\n\tcase 0x0:\n\t\tswitch (opcode & 0x0FFF)\n\t\t{\n\t\tcase 0x0E0: emu->getDisplay().clear(); break;\n\t\tcase 0x0EE: pc = pop(); break;\n\t\tdefault: unknownOpcode(opcode); break;\n\t\t}\n\t\tbreak;\n\tcase 0x1: pc = (opcode & 0x0FFF); break;\n\tcase 0x2: callSubroutine(opcode & 0x0FFF); break;\n\tcase 0x3: if (V[regX(opcode)] == (opcode & 0x00FF)) skipInstruction(); break;\n\tcase 0x4: if (V[regX(opcode)] != (opcode & 0x00FF)) skipInstruction(); break;\n\tcase 0x5: if (V[regX(opcode)] == V[regY(opcode)]) skipInstruction(); break;\n\tcase 0x6: V[regX(opcode)] = (opcode & 0x00FF); break;\n\tcase 0x7: V[regX(opcode)] += (opcode & 0x00FF); break;\n\tcase 0x8:\n\t\tswitch (opcode & 0x000F)\n\t\t{\n\t\tcase 0x0: V[regX(opcode)] = V[regY(opcode)]; break;\n\t\tcase 0x1: V[regX(opcode)] |= V[regY(opcode)]; break;\n\t\tcase 0x2: V[regX(opcode)] &= V[regY(opcode)]; break;\n\t\tcase 0x3: V[regX(opcode)] ^= V[regY(opcode)]; break;\n\t\tcase 0x4: V[regX(opcode)] = addSetCarry(V[regX(opcode)], V[regY(opcode)]); break;\n\t\tcase 0x5: V[regX(opcode)] = subtractSetCarry(V[regX(opcode)], V[regY(opcode)]); break;\n\t\tcase 0x6: V[regX(opcode)] = shiftRightSetCarry(V[regX(opcode)], 1); break;\n\t\tcase 0x7: V[regX(opcode)] = subtractSetCarry(V[regY(opcode)], V[regX(opcode)]); break;\n\t\tcase 0xE: V[regX(opcode)] = shiftLeftSetCarry(V[regX(opcode)], 1); break;\n\t\tdefault: unknownOpcode(opcode); break;\n\t\t}\n\t\tbreak;\n\tcase 0x9: if (V[regX(opcode)] != V[regY(opcode)]) skipInstruction(); break;\n\tcase 0xA: I = (opcode & 0x0FFF); break;\n\tcase 0xB: pc = ((opcode & 0x0FFF) + V[0x0]); break;\n\tcase 0xC: V[regX(opcode)] = Random::get() & (opcode & 0x00FF); break;\n\tcase 0xD: V[0xF] = emu->getDisplay().drawSprite(V[regX(opcode)], V[regY(opcode)], emu->getMemory().get(I), (opcode & 0xF)) ? 1 : 0; break;\n\tcase 0xE:\n\t\tswitch (opcode & 0x00FF)\n\t\t{\n\t\tcase 0x9E: if (emu->getInput().isPressed(V[regX(opcode)])) skipInstruction(); break;\n\t\tcase 0xA1: if (!emu->getInput().isPressed(V[regX(opcode)])) skipInstruction(); break;\n\t\tdefault: unknownOpcode(opcode); break;\n\t\t}\n\t\tbreak;\n\tcase 0xF:\n\t\tswitch (opcode & 0x00FF)\n\t\t{\n\t\tcase 0x07: V[regX(opcode)] = delayTimer; break;\n\t\tcase 0x0A: if (emu->getInput().isAnyPressed()) V[regX(opcode)] = emu->getInput().getFirstPressed(); else repeatInstruction(); break;\n\t\tcase 0x15: delayTimer = V[regX(opcode)]; break;\n\t\tcase 0x18: soundTimer = V[regX(opcode)]; break;\n\t\tcase 0x1E: I = addSetOverflow(I, V[regX(opcode)]); break;\n\t\tcase 0x29: I = Memory::FONT_START + (V[regX(opcode)] * Font::HEIGHT); break;\n\t\tcase 0x33: storeDecimal(I, V[regX(opcode)]); break;\n\t\tcase 0x55: storeRegisters(I, regX(opcode)); break;\n\t\tcase 0x65: fillRegisters(I, regX(opcode)); break;\n\t\tdefault: unknownOpcode(opcode); break;\n\t\t}\n\t\tbreak;\n\tdefault: unknownOpcode(opcode); break;\n\t}\n}\nvoid CPU::tickTimers(float seconds)\n{\n\ttimeKeep += seconds;\n\n\tstatic const float SECONDS_PER_TICK = (1.f \/ (float)TIMER_HZ);\n\twhile (timeKeep >= SECONDS_PER_TICK)\n\t{\n\t\ttimeKeep -= SECONDS_PER_TICK;\n\t\tif (delayTimer > 0)\n\t\t\t--delayTimer;\n\t\tif (soundTimer > 0)\n\t\t\t--soundTimer;\n\t}\n}\n\nvoid CPU::push(address_t address)\n{\n\tif (sp >= STACK_SIZE)\n\t{\n\t\tLog::error() << \"Stack overflow\" << std::endl;\n\t}\n\telse\n\t{\n\t\tstack[sp] = address;\n\t\t++sp;\n\t}\n}\naddress_t CPU::pop()\n{\n\tif (sp <= 0)\n\t{\n\t\tLog::error() << \"Stack underflow\" << std::endl;\n\t\treturn 0;\n\t}\n\telse\n\t{\n\t\t--sp;\n\t\taddress_t top = stack[sp];\n\t\treturn top;\n\t}\n}\n\nvoid CPU::storeRegisters(address_t address, int maxReg)\n{\n\tMemory &memory = emu->getMemory();\n\tfor (int i = 0x0; i <= maxReg; ++i)\n\t{\n\t\tmemory.write(address + i, V[i]);\n\t}\n}\nvoid CPU::fillRegisters(address_t address, int maxReg)\n{\n\tMemory &memory = emu->getMemory();\n\tfor (int i = 0x0; i <= maxReg; ++i)\n\t{\n\t\tV[i] = memory.read(address + i);\n\t}\n}\n\nvoid CPU::storeDecimal(address_t address, byte_t byte)\n{\n\tMemory &memory = emu->getMemory();\n\tbyte_t hundreds = byte \/ 100;\n\tbyte -= hundreds * 100;\n\tbyte_t tens = byte \/ 10;\n\tbyte -= tens * 10;\n\tbyte_t ones = byte;\n\tmemory.write(address + 0, hundreds);\n\tmemory.write(address + 1, tens);\n\tmemory.write(address + 2, ones);\n}\n\nvoid CPU::skipInstruction()\n{\n\tpc += sizeof(opcode_t);\n}\nvoid CPU::repeatInstruction()\n{\n\tpc -= sizeof(opcode_t);\n}\nvoid CPU::callSubroutine(address_t address)\n{\n\tpush(pc + sizeof(opcode_t));\n\tpc = address;\n}\n\nbyte_t CPU::addSetCarry(byte_t v1, byte_t v2)\n{\n\tint result = static_cast<int>(v1) + static_cast<int>(v2);\n\tV[0xF] = (result > 0xFF ? 1 : 0);\n\treturn static_cast<byte_t>(result);\n}\nbyte_t CPU::subtractSetCarry(byte_t v1, byte_t v2)\n{\n\tV[0xF] = (v1 >= v2 ? 1 : 0);\n\treturn v1 - v2;\n}\n\naddress_t CPU::addSetOverflow(address_t v1, address_t v2)\n{\n\tint result = static_cast<int>(v1) + static_cast<int>(v2);\n\tV[0xF] = (result > 0xFFF ? 1 : 0);\n\treturn static_cast<address_t>(result);\n}\n\nbyte_t CPU::shiftRightSetCarry(byte_t v, int steps)\n{\n\tV[0xF] = (v & 0x1);\n\treturn (v >> steps);\n}\nbyte_t CPU::shiftLeftSetCarry(byte_t v, int steps)\n{\n\tV[0xF] = ((v >> 7) & 0x1);\n\treturn (v << steps);\n}\n\nvoid CPU::unknownOpcode(opcode_t opcode)\n{\n\tLog::error() << \"Unknown opcode 0x\" << std::hex << opcode << std::endl;\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Lda.cpp\n *\n * Copyright (c) 2012 Tsukasa OMOTO <henry0312@gmail.com>\n *\n * Permission 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 *\n * The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n *\n * THE 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\/* This file is available under an MIT license. *\/\n\n#include \"Lda.hpp\"\n\n\/**\n * Constructor\n *\n * @param const unsigned int _K the number of Topics\n * @param const double _alpha hyperparameter, alpha\n * @param const double _beta hyperparameter, beta\n * @param const unsigned int _seed seed value\n * @param const char *train Training set\n * @param const char *test Test set\n * @param const char *vocab Vocabulary\n * @param bool _asymmetry If true, use Asymmetry Dirichlet distribution\n *\/\nLda::Lda(const unsigned int _K, const double _alpha, const double _beta, const unsigned int _seed,\n        const char *train, const char *test, const char *vocab, bool _asymmetry=false)\n    :dataset(train, vocab), testset(test), K(_K), alpha_z(_K, _alpha),\n    beta(_beta), asymmetry(_asymmetry), gen(_seed)\n{\n    init();\n}\n\n\/**\n * Initialization\n *\/\nvoid Lda::init() {\n    \/\/ n_mz\n    n_m_z.resize(dataset.M);\n    for (auto& n_z : n_m_z) {\n        n_z.resize(K, 0);\n    }\n\n    \/\/ n_zt\n    n_z_t.resize(K);\n    for (auto& n_t : n_z_t) {\n        n_t.resize(dataset.V, 0);\n    }\n\n    \/\/ n_z\n    n_z.resize(K, 0);\n\n    \/*\n     * Topics\n     *\/\n    z_m_n.resize(dataset.M);\n    std::uniform_int_distribution<> dis(0, K-1);\n    for (int m = 0; m < dataset.M; ++m) {\n        z_m_n[m].resize(dataset.n_m[m]);\n        for (int n = 0; n < dataset.n_m[m]; ++n) {\n            auto z = dis(gen);\n            z_m_n[m][n] = z;\n            ++n_m_z[m][z];\n            ++n_z_t[z][dataset.docs[m][n] - 1];\n            ++n_z[z];\n        }\n    }\n\n    \/\/ phi\n    phi_z_t.resize(K);\n    for (auto& phi_t : phi_z_t) {\n        phi_t.resize(dataset.V);\n    }\n\n    \/\/ theta\n    theta_m_z.resize(dataset.M);\n    for (auto& theta_z : theta_m_z) {\n        theta_z.resize(K);\n    }\n}\n\n\/**\n * Inference\n *\/\nvoid Lda::inference() {\n    \/*\n     * Sampling z_mn\n     *\/\n    for (int m = 0; m < dataset.M; ++m) {\n        for (int n = 0; n < dataset.n_m[m]; ++n) {\n            sampling_z(m, n);\n        }\n    }\n}\n\n\/**\n * Sampling z_mn\n *\n * Perform Gibbs sampling once\n *\n * @param const int m the mth doc\n * @param const int n the nth word\n *\/\nvoid Lda::sampling_z(const int m, const int n) {\n    \/\/ word\n    const int t = dataset.docs[m][n];\n    \/\/ old topic\n    const int old_z = z_m_n[m][n];\n\n    \/*\n     * Delete old topic\n     *\/\n    --n_m_z[m][old_z];\n    --n_z_t[old_z][t - 1];\n    --n_z[old_z];\n\n    \/*\n     * Gibbs sampling\n     *\/\n    std::vector<double> p_z(K);\n    for (int z = 0; z < K; ++z) {\n        p_z[z] = (alpha_z[z] + n_m_z[m][z]) * (beta + n_z_t[z][t - 1]) \/ (n_z[z] + dataset.V * beta);\n    }\n    std::discrete_distribution<> dis(begin(p_z), end(p_z));\n    int new_z = dis(gen);\n\n    \/*\n     * Update topic\n     *\/\n    z_m_n[m][n] = new_z;\n    ++n_m_z[m][new_z];\n    ++n_z_t[new_z][t - 1];\n    ++n_z[new_z];\n}\n\n\/**\n * Compute Perplexity\n *\/\ndouble Lda::perplexity() {\n    \/*\n     * phi\n     *\/\n    for (int z = 0; z < K; ++z) {\n        for (int t = 0; t < dataset.V; ++t) {\n            phi_z_t[z][t] = (beta + n_z_t[z][t]) \/ (n_z[z] + dataset.V * beta);\n        }\n    }\n\n    \/*\n     * theta\n     *\/\n    for (int m = 0; m < dataset.M; ++m) {\n        for (int z = 0; z < K; ++z) {\n            theta_m_z[m][z] = (alpha_z[z] + n_m_z[m][z]) \/ (dataset.n_m[m] + K * alpha_z[z]);\n        }\n    }\n\n    \/*\n     * Perplexity\n     *\/\n    double log_per = 0.0;\n    for (int m = 0; m < testset.M; ++m) {\n        for (int n = 0; n < testset.n_m[m]; ++n) {\n            const int t = testset.docs[m][n] - 1;\n            double sum = 0.0;\n            for (int z = 0; z < K; ++z) {\n                sum += theta_m_z[m][z] * phi_z_t[z][t];\n            }\n            log_per -= log(sum);\n        }\n    }\n    return exp( log_per \/ testset.N );\n}\n\n\/**\n * Learning\n *\n * Perform Gibbs sampling specified number of times and Calculate perplexity with each cycle\n *\n * @param const unsigned int iteration the number of times of inference\n * @param const unsigned int burn_in burn-in period\n *\/\nvoid Lda::learn(const unsigned int iteration, const unsigned int burn_in) {\n    using namespace std;\n\n    cout.precision(3);\n    cout.setf(ios::fixed);\n\n    \/*\n     * Show Initial parameters\n     *\/\n    cout << \"K = \" << K << endl;\n    if (asymmetry) {\n        cout << \"alpha_z = \" << alpha_z[0] << endl;\n    } else {\n        cout << \"alpha = \" << alpha_z[0] << endl;\n    }\n    cout << \"beta = \" << beta << endl;\n\n    \/\/ Start time\n    auto start = std::chrono::system_clock::now();\n\n    \/\/ Inference\n    cout << \"iter\\tperplexity\\n\";\n    for (unsigned int i = 0; i < iteration; ++i) {\n        cout << i << \"\\t\" << perplexity() << endl;\n\n        \/*\n         * Update hyperparameters\n         *\/\n        if (asymmetry) {\n            if (i >= burn_in) {\n                update_alpha();\n            }\n        }\n\n        inference();\n    }\n    cout << iteration << \"\\t\" << perplexity() << endl;\n\n    \/\/ End time\n    auto end = std::chrono::system_clock::now();\n\n    \/\/ Elapsed time\n    auto ms = std::chrono::duration_cast< std::chrono::milliseconds >(end - start).count();\n    int s = ms * 0.001; ms -= s * 1000;\n    int m = s \/ 60; s %= 60;\n    int h = m \/ 60; m %= 60;\n    cout << \"Elapsed time: \" << h << \"h \" << m << \"m \" << s << \".\" << ms << \"s\\n\" << endl;\n\n    \/*\n     * Dump\n     *\/\n    \/\/ topic-word distribution\n    dump();\n    \/\/ alpha_z\n    if (asymmetry) {\n        for (int z = 0; z < K; ++z) {\n            cout << \"alpha_z[\" << z << \"] = \" << alpha_z[z] << endl;\n        }\n    }\n}\n\n\/**\n * Dump\n *\n * Print topic-word distribution\n *\/\nvoid Lda::dump() {\n    \/\/ Insert topic-word distribution to vector\n    std::vector<std::vector<std::pair<int, double>>> topic_word;\n    topic_word.resize(K);\n    for (int z = 0; z < K; ++z) {\n        topic_word[z].resize(dataset.V);\n        for (int t = 0; t < dataset.V; ++t) {\n            topic_word[z][t] = std::make_pair(t, phi_z_t[z][t]);\n        }\n    }\n\n    \/\/ Descending sort\n    for (int z = 0; z < K; ++z) {\n        std::sort( begin(topic_word[z]), end(topic_word[z]),\n                    [](const std::pair<int, double> &a, const std::pair<int, double> &b)\n                    -> bool { return a.second > b.second; } );\n    }\n\n    \/\/ Print\n    for (int z = 0; z < K; ++z) {\n        printf(\"Topic: %d (%d words)\\n\", z, n_z[z]);\n        for (int i = 0; i < (n_z[z] > 10 ? 10 : n_z[z]); ++i) {\n            auto t = topic_word[z][i].first;\n            auto phi = topic_word[z][i].second;\n            printf(\"%s: %f (%d)\\n\", dataset.vocab[t].c_str(), phi, n_z_t[z][t]);\n        }\n        std::cout << std::endl;\n    }\n}\n\n\/**\n * Sampling new alpha\n *\/\nvoid Lda::update_alpha() {\n    using namespace boost::math;\n\n    double sum_alpha = 0.0;\n    for (auto alpha : alpha_z) {\n        sum_alpha += alpha;\n    }\n\n    double numer, denom;\n    for (int z = 0; z < K; ++z) {\n        numer = denom = 0.0;\n        for (int m = 0; m < dataset.M; ++m) {\n            numer += digamma(n_m_z[m][z] + alpha_z[z]) - digamma(alpha_z[z]);\n            denom += digamma(dataset.n_m[m] + sum_alpha) - digamma(sum_alpha);\n        }\n        alpha_z[z] = alpha_z[z] * numer \/ denom;\n    }\n}\n<commit_msg>Change the decimal precision to be used by output operations.<commit_after>\/*\n * Lda.cpp\n *\n * Copyright (c) 2012 Tsukasa OMOTO <henry0312@gmail.com>\n *\n * Permission 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 *\n * The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n *\n * THE 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\/* This file is available under an MIT license. *\/\n\n#include \"Lda.hpp\"\n\n\/**\n * Constructor\n *\n * @param const unsigned int _K the number of Topics\n * @param const double _alpha hyperparameter, alpha\n * @param const double _beta hyperparameter, beta\n * @param const unsigned int _seed seed value\n * @param const char *train Training set\n * @param const char *test Test set\n * @param const char *vocab Vocabulary\n * @param bool _asymmetry If true, use Asymmetry Dirichlet distribution\n *\/\nLda::Lda(const unsigned int _K, const double _alpha, const double _beta, const unsigned int _seed,\n        const char *train, const char *test, const char *vocab, bool _asymmetry=false)\n    :dataset(train, vocab), testset(test), K(_K), alpha_z(_K, _alpha),\n    beta(_beta), asymmetry(_asymmetry), gen(_seed)\n{\n    init();\n}\n\n\/**\n * Initialization\n *\/\nvoid Lda::init() {\n    \/\/ n_mz\n    n_m_z.resize(dataset.M);\n    for (auto& n_z : n_m_z) {\n        n_z.resize(K, 0);\n    }\n\n    \/\/ n_zt\n    n_z_t.resize(K);\n    for (auto& n_t : n_z_t) {\n        n_t.resize(dataset.V, 0);\n    }\n\n    \/\/ n_z\n    n_z.resize(K, 0);\n\n    \/*\n     * Topics\n     *\/\n    z_m_n.resize(dataset.M);\n    std::uniform_int_distribution<> dis(0, K-1);\n    for (int m = 0; m < dataset.M; ++m) {\n        z_m_n[m].resize(dataset.n_m[m]);\n        for (int n = 0; n < dataset.n_m[m]; ++n) {\n            auto z = dis(gen);\n            z_m_n[m][n] = z;\n            ++n_m_z[m][z];\n            ++n_z_t[z][dataset.docs[m][n] - 1];\n            ++n_z[z];\n        }\n    }\n\n    \/\/ phi\n    phi_z_t.resize(K);\n    for (auto& phi_t : phi_z_t) {\n        phi_t.resize(dataset.V);\n    }\n\n    \/\/ theta\n    theta_m_z.resize(dataset.M);\n    for (auto& theta_z : theta_m_z) {\n        theta_z.resize(K);\n    }\n}\n\n\/**\n * Inference\n *\/\nvoid Lda::inference() {\n    \/*\n     * Sampling z_mn\n     *\/\n    for (int m = 0; m < dataset.M; ++m) {\n        for (int n = 0; n < dataset.n_m[m]; ++n) {\n            sampling_z(m, n);\n        }\n    }\n}\n\n\/**\n * Sampling z_mn\n *\n * Perform Gibbs sampling once\n *\n * @param const int m the mth doc\n * @param const int n the nth word\n *\/\nvoid Lda::sampling_z(const int m, const int n) {\n    \/\/ word\n    const int t = dataset.docs[m][n];\n    \/\/ old topic\n    const int old_z = z_m_n[m][n];\n\n    \/*\n     * Delete old topic\n     *\/\n    --n_m_z[m][old_z];\n    --n_z_t[old_z][t - 1];\n    --n_z[old_z];\n\n    \/*\n     * Gibbs sampling\n     *\/\n    std::vector<double> p_z(K);\n    for (int z = 0; z < K; ++z) {\n        p_z[z] = (alpha_z[z] + n_m_z[m][z]) * (beta + n_z_t[z][t - 1]) \/ (n_z[z] + dataset.V * beta);\n    }\n    std::discrete_distribution<> dis(begin(p_z), end(p_z));\n    int new_z = dis(gen);\n\n    \/*\n     * Update topic\n     *\/\n    z_m_n[m][n] = new_z;\n    ++n_m_z[m][new_z];\n    ++n_z_t[new_z][t - 1];\n    ++n_z[new_z];\n}\n\n\/**\n * Compute Perplexity\n *\/\ndouble Lda::perplexity() {\n    \/*\n     * phi\n     *\/\n    for (int z = 0; z < K; ++z) {\n        for (int t = 0; t < dataset.V; ++t) {\n            phi_z_t[z][t] = (beta + n_z_t[z][t]) \/ (n_z[z] + dataset.V * beta);\n        }\n    }\n\n    \/*\n     * theta\n     *\/\n    for (int m = 0; m < dataset.M; ++m) {\n        for (int z = 0; z < K; ++z) {\n            theta_m_z[m][z] = (alpha_z[z] + n_m_z[m][z]) \/ (dataset.n_m[m] + K * alpha_z[z]);\n        }\n    }\n\n    \/*\n     * Perplexity\n     *\/\n    double log_per = 0.0;\n    for (int m = 0; m < testset.M; ++m) {\n        for (int n = 0; n < testset.n_m[m]; ++n) {\n            const int t = testset.docs[m][n] - 1;\n            double sum = 0.0;\n            for (int z = 0; z < K; ++z) {\n                sum += theta_m_z[m][z] * phi_z_t[z][t];\n            }\n            log_per -= log(sum);\n        }\n    }\n    return exp( log_per \/ testset.N );\n}\n\n\/**\n * Learning\n *\n * Perform Gibbs sampling specified number of times and Calculate perplexity with each cycle\n *\n * @param const unsigned int iteration the number of times of inference\n * @param const unsigned int burn_in burn-in period\n *\/\nvoid Lda::learn(const unsigned int iteration, const unsigned int burn_in) {\n    using namespace std;\n    cout.setf(ios::fixed);\n\n    \/*\n     * Show Initial parameters\n     *\/\n    cout << \"K = \" << K << endl;\n    if (asymmetry) {\n        cout << setprecision(6) << \"alpha_z = \" << alpha_z[0] << endl;\n    } else {\n        cout << setprecision(6) << \"alpha = \" << alpha_z[0] << endl;\n    }\n    cout << setprecision(6) << \"beta = \" << beta << endl;\n\n    \/\/ Start time\n    auto start = std::chrono::system_clock::now();\n\n    \/\/ Inference\n    cout.precision(3);\n    cout << \"iter\\tperplexity\\n\";\n    for (unsigned int i = 0; i < iteration; ++i) {\n        cout << i << \"\\t\" << perplexity() << endl;\n\n        \/*\n         * Update hyperparameters\n         *\/\n        if (asymmetry) {\n            if (i >= burn_in) {\n                update_alpha();\n            }\n        }\n\n        inference();\n    }\n    cout << iteration << \"\\t\" << perplexity() << endl;\n\n    \/\/ End time\n    auto end = std::chrono::system_clock::now();\n\n    \/\/ Elapsed time\n    auto ms = std::chrono::duration_cast< std::chrono::milliseconds >(end - start).count();\n    int s = ms * 0.001; ms -= s * 1000;\n    int m = s \/ 60; s %= 60;\n    int h = m \/ 60; m %= 60;\n    cout << \"Elapsed time: \" << h << \"h \" << m << \"m \" << s << \".\" << ms << \"s\\n\" << endl;\n\n    \/*\n     * Dump\n     *\/\n    \/\/ topic-word distribution\n    dump();\n    \/\/ alpha_z\n    if (asymmetry) {\n        cout.precision(6);\n        for (int z = 0; z < K; ++z) {\n            cout << \"alpha_z[\" << z << \"] = \" << alpha_z[z] << endl;\n        }\n    }\n}\n\n\/**\n * Dump\n *\n * Print topic-word distribution\n *\/\nvoid Lda::dump() {\n    \/\/ Insert topic-word distribution to vector\n    std::vector<std::vector<std::pair<int, double>>> topic_word;\n    topic_word.resize(K);\n    for (int z = 0; z < K; ++z) {\n        topic_word[z].resize(dataset.V);\n        for (int t = 0; t < dataset.V; ++t) {\n            topic_word[z][t] = std::make_pair(t, phi_z_t[z][t]);\n        }\n    }\n\n    \/\/ Descending sort\n    for (int z = 0; z < K; ++z) {\n        std::sort( begin(topic_word[z]), end(topic_word[z]),\n                    [](const std::pair<int, double> &a, const std::pair<int, double> &b)\n                    -> bool { return a.second > b.second; } );\n    }\n\n    \/\/ Print\n    for (int z = 0; z < K; ++z) {\n        printf(\"Topic: %d (%d words)\\n\", z, n_z[z]);\n        for (int i = 0; i < (n_z[z] > 10 ? 10 : n_z[z]); ++i) {\n            auto t = topic_word[z][i].first;\n            auto phi = topic_word[z][i].second;\n            printf(\"%s: %f (%d)\\n\", dataset.vocab[t].c_str(), phi, n_z_t[z][t]);\n        }\n        std::cout << std::endl;\n    }\n}\n\n\/**\n * Sampling new alpha\n *\/\nvoid Lda::update_alpha() {\n    using namespace boost::math;\n\n    double sum_alpha = 0.0;\n    for (auto alpha : alpha_z) {\n        sum_alpha += alpha;\n    }\n\n    double numer, denom;\n    for (int z = 0; z < K; ++z) {\n        numer = denom = 0.0;\n        for (int m = 0; m < dataset.M; ++m) {\n            numer += digamma(n_m_z[m][z] + alpha_z[z]) - digamma(alpha_z[z]);\n            denom += digamma(dataset.n_m[m] + sum_alpha) - digamma(sum_alpha);\n        }\n        alpha_z[z] = alpha_z[z] * numer \/ denom;\n    }\n}\n<|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 <vector>\n#include \"prevector.h\"\n#include \"random.h\"\n\n#include \"serialize.h\"\n#include \"streams.h\"\n\n#include \"test\/test_pivx.h\"\n\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_FIXTURE_TEST_SUITE(PrevectorTests, TestingSetup)\n\ntemplate<unsigned int N, typename T>\nclass prevector_tester {\n    typedef std::vector<T> realtype;\n    realtype real_vector;\n\n    typedef prevector<N, T> pretype;\n    pretype pre_vector;\n\n    typedef typename pretype::size_type Size;\n\n    void test() {\n        const pretype& const_pre_vector = pre_vector;\n        BOOST_CHECK_EQUAL(real_vector.size(), pre_vector.size());\n        BOOST_CHECK_EQUAL(real_vector.empty(), pre_vector.empty());\n        for (Size s = 0; s < real_vector.size(); s++) {\n             BOOST_CHECK(real_vector[s] == pre_vector[s]);\n             BOOST_CHECK(&(pre_vector[s]) == &(pre_vector.begin()[s]));\n             BOOST_CHECK(&(pre_vector[s]) == &*(pre_vector.begin() + s));\n             BOOST_CHECK(&(pre_vector[s]) == &*((pre_vector.end() + s) - real_vector.size()));\n        }\n        \/\/ BOOST_CHECK(realtype(pre_vector) == real_vector);\n        BOOST_CHECK(pretype(real_vector.begin(), real_vector.end()) == pre_vector);\n        BOOST_CHECK(pretype(pre_vector.begin(), pre_vector.end()) == pre_vector);\n        size_t pos = 0;\n        for (const T& v  : pre_vector) {\n             BOOST_CHECK(v == real_vector[pos++]);\n        }\n        pos = 0;\n        for (const T& v : const_pre_vector) {\n             BOOST_CHECK(v == real_vector[pos++]);\n        }\n\n        CDataStream ss1(SER_DISK, 0);\n        CDataStream ss2(SER_DISK, 0);\n        ss1 << real_vector;\n        ss2 << pre_vector;\n        BOOST_CHECK_EQUAL(ss1.size(), ss2.size());\n        for (Size s = 0; s < ss1.size(); s++) {\n            BOOST_CHECK_EQUAL(ss1[s], ss2[s]);\n        }\n    }\n\npublic:\n    void resize(Size s) {\n        real_vector.resize(s);\n        BOOST_CHECK_EQUAL(real_vector.size(), s);\n        pre_vector.resize(s);\n        BOOST_CHECK_EQUAL(pre_vector.size(), s);\n        test();\n    }\n\n    void reserve(Size s) {\n        real_vector.reserve(s);\n        BOOST_CHECK(real_vector.capacity() >= s);\n        pre_vector.reserve(s);\n        BOOST_CHECK(pre_vector.capacity() >= s);\n        test();\n    }\n\n    void insert(Size position, const T& value) {\n        real_vector.insert(real_vector.begin() + position, value);\n        pre_vector.insert(pre_vector.begin() + position, value);\n        test();\n    }\n\n    void insert(Size position, Size count, const T& value) {\n        real_vector.insert(real_vector.begin() + position, count, value);\n        pre_vector.insert(pre_vector.begin() + position, count, value);\n        test();\n    }\n\n    template<typename I>\n    void insert_range(Size position, I first, I last) {\n        real_vector.insert(real_vector.begin() + position, first, last);\n        pre_vector.insert(pre_vector.begin() + position, first, last);\n        test();\n    }\n\n    void erase(Size position) {\n        real_vector.erase(real_vector.begin() + position);\n        pre_vector.erase(pre_vector.begin() + position);\n        test();\n    }\n\n    void erase(Size first, Size last) {\n        real_vector.erase(real_vector.begin() + first, real_vector.begin() + last);\n        pre_vector.erase(pre_vector.begin() + first, pre_vector.begin() + last);\n        test();\n    }\n\n    void update(Size pos, const T& value) {\n        real_vector[pos] = value;\n        pre_vector[pos] = value;\n        test();\n    }\n\n    void push_back(const T& value) {\n        real_vector.push_back(value);\n        pre_vector.push_back(value);\n        test();\n    }\n\n    void pop_back() {\n        real_vector.pop_back();\n        pre_vector.pop_back();\n        test();\n    }\n\n    void clear() {\n        real_vector.clear();\n        pre_vector.clear();\n    }\n\n    void assign(Size n, const T& value) {\n        real_vector.assign(n, value);\n        pre_vector.assign(n, value);\n    }\n\n    Size size() {\n        return real_vector.size();\n    }\n\n    Size capacity() {\n        return pre_vector.capacity();\n    }\n\n    void shrink_to_fit() {\n        pre_vector.shrink_to_fit();\n        test();\n    }\n};\n\nBOOST_AUTO_TEST_CASE(PrevectorTestInt)\n{\n    for (int j = 0; j < 64; j++) {\n        prevector_tester<8, int> test;\n        for (int i = 0; i < 2048; i++) {\n            int r = InsecureRand32();\n            if ((r % 4) == 0) {\n                test.insert(InsecureRand32() % (test.size() + 1), InsecureRand32());\n            }\n            if (test.size() > 0 && ((r >> 2) % 4) == 1) {\n                test.erase(InsecureRand32() % test.size());\n            }\n            if (((r >> 4) % 8) == 2) {\n                int new_size = std::max<int>(0, std::min<int>(30, test.size() + (InsecureRand32() % 5) - 2));\n                test.resize(new_size);\n            }\n            if (((r >> 7) % 8) == 3) {\n                test.insert(InsecureRand32() % (test.size() + 1), 1 + (InsecureRand32() % 2), InsecureRand32());\n            }\n            if (((r >> 10) % 8) == 4) {\n                int del = std::min<int>(test.size(), 1 + (InsecureRand32() % 2));\n                int beg = InsecureRand32() % (test.size() + 1 - del);\n                test.erase(beg, beg + del);\n            }\n            if (((r >> 13) % 16) == 5) {\n                test.push_back(InsecureRand32());\n            }\n            if (test.size() > 0 && ((r >> 17) % 16) == 6) {\n                test.pop_back();\n            }\n            if (((r >> 21) % 32) == 7) {\n                int values[4];\n                int num = 1 + (InsecureRand32() % 4);\n                for (int i = 0; i < num; i++) {\n                    values[i] = InsecureRand32();\n                }\n                test.insert_range(InsecureRand32() % (test.size() + 1), values, values + num);\n            }\n            if (((r >> 26) % 32) == 8) {\n                int del = std::min<int>(test.size(), 1 + (InsecureRand32() % 4));\n                int beg = InsecureRand32() % (test.size() + 1 - del);\n                test.erase(beg, beg + del);\n            }\n            r = InsecureRand32();\n            if (r % 32 == 9) {\n                test.reserve(InsecureRand32() % 32);\n            }\n            if ((r >> 5) % 64 == 10) {\n                test.shrink_to_fit();\n            }\n            if (test.size() > 0) {\n                test.update(InsecureRand32() % test.size(), InsecureRand32());\n            }\n            if (((r >> 11) & 1024) == 11) {\n                test.clear();\n            }\n            if (((r >> 21) & 512) == 12) {\n                test.assign(InsecureRand32() % 32, InsecureRand32());\n            }\n        }\n    }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>test prevector::swap<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 <vector>\n#include \"prevector.h\"\n#include \"random.h\"\n\n#include \"serialize.h\"\n#include \"streams.h\"\n\n#include \"test\/test_pivx.h\"\n\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_FIXTURE_TEST_SUITE(PrevectorTests, TestingSetup)\n\ntemplate<unsigned int N, typename T>\nclass prevector_tester {\n    typedef std::vector<T> realtype;\n    realtype real_vector;\n    realtype real_vector_alt;\n\n    typedef prevector<N, T> pretype;\n    pretype pre_vector;\n    pretype pre_vector_alt;\n\n    typedef typename pretype::size_type Size;\n\n    void test() {\n        const pretype& const_pre_vector = pre_vector;\n        BOOST_CHECK_EQUAL(real_vector.size(), pre_vector.size());\n        BOOST_CHECK_EQUAL(real_vector.empty(), pre_vector.empty());\n        for (Size s = 0; s < real_vector.size(); s++) {\n             BOOST_CHECK(real_vector[s] == pre_vector[s]);\n             BOOST_CHECK(&(pre_vector[s]) == &(pre_vector.begin()[s]));\n             BOOST_CHECK(&(pre_vector[s]) == &*(pre_vector.begin() + s));\n             BOOST_CHECK(&(pre_vector[s]) == &*((pre_vector.end() + s) - real_vector.size()));\n        }\n        \/\/ BOOST_CHECK(realtype(pre_vector) == real_vector);\n        BOOST_CHECK(pretype(real_vector.begin(), real_vector.end()) == pre_vector);\n        BOOST_CHECK(pretype(pre_vector.begin(), pre_vector.end()) == pre_vector);\n        size_t pos = 0;\n        for (const T& v  : pre_vector) {\n             BOOST_CHECK(v == real_vector[pos++]);\n        }\n        pos = 0;\n        for (const T& v : const_pre_vector) {\n             BOOST_CHECK(v == real_vector[pos++]);\n        }\n\n        CDataStream ss1(SER_DISK, 0);\n        CDataStream ss2(SER_DISK, 0);\n        ss1 << real_vector;\n        ss2 << pre_vector;\n        BOOST_CHECK_EQUAL(ss1.size(), ss2.size());\n        for (Size s = 0; s < ss1.size(); s++) {\n            BOOST_CHECK_EQUAL(ss1[s], ss2[s]);\n        }\n    }\n\npublic:\n    void resize(Size s) {\n        real_vector.resize(s);\n        BOOST_CHECK_EQUAL(real_vector.size(), s);\n        pre_vector.resize(s);\n        BOOST_CHECK_EQUAL(pre_vector.size(), s);\n        test();\n    }\n\n    void reserve(Size s) {\n        real_vector.reserve(s);\n        BOOST_CHECK(real_vector.capacity() >= s);\n        pre_vector.reserve(s);\n        BOOST_CHECK(pre_vector.capacity() >= s);\n        test();\n    }\n\n    void insert(Size position, const T& value) {\n        real_vector.insert(real_vector.begin() + position, value);\n        pre_vector.insert(pre_vector.begin() + position, value);\n        test();\n    }\n\n    void insert(Size position, Size count, const T& value) {\n        real_vector.insert(real_vector.begin() + position, count, value);\n        pre_vector.insert(pre_vector.begin() + position, count, value);\n        test();\n    }\n\n    template<typename I>\n    void insert_range(Size position, I first, I last) {\n        real_vector.insert(real_vector.begin() + position, first, last);\n        pre_vector.insert(pre_vector.begin() + position, first, last);\n        test();\n    }\n\n    void erase(Size position) {\n        real_vector.erase(real_vector.begin() + position);\n        pre_vector.erase(pre_vector.begin() + position);\n        test();\n    }\n\n    void erase(Size first, Size last) {\n        real_vector.erase(real_vector.begin() + first, real_vector.begin() + last);\n        pre_vector.erase(pre_vector.begin() + first, pre_vector.begin() + last);\n        test();\n    }\n\n    void update(Size pos, const T& value) {\n        real_vector[pos] = value;\n        pre_vector[pos] = value;\n        test();\n    }\n\n    void push_back(const T& value) {\n        real_vector.push_back(value);\n        pre_vector.push_back(value);\n        test();\n    }\n\n    void pop_back() {\n        real_vector.pop_back();\n        pre_vector.pop_back();\n        test();\n    }\n\n    void clear() {\n        real_vector.clear();\n        pre_vector.clear();\n    }\n\n    void assign(Size n, const T& value) {\n        real_vector.assign(n, value);\n        pre_vector.assign(n, value);\n    }\n\n    Size size() {\n        return real_vector.size();\n    }\n\n    Size capacity() {\n        return pre_vector.capacity();\n    }\n\n    void shrink_to_fit() {\n        pre_vector.shrink_to_fit();\n        test();\n    }\n\n    void swap() {\n        real_vector.swap(real_vector_alt);\n        pre_vector.swap(pre_vector_alt);\n        test();\n    }\n};\n\nBOOST_AUTO_TEST_CASE(PrevectorTestInt)\n{\n    for (int j = 0; j < 64; j++) {\n        prevector_tester<8, int> test;\n        for (int i = 0; i < 2048; i++) {\n            int r = InsecureRand32();\n            if ((r % 4) == 0) {\n                test.insert(InsecureRand32() % (test.size() + 1), InsecureRand32());\n            }\n            if (test.size() > 0 && ((r >> 2) % 4) == 1) {\n                test.erase(InsecureRand32() % test.size());\n            }\n            if (((r >> 4) % 8) == 2) {\n                int new_size = std::max<int>(0, std::min<int>(30, test.size() + (InsecureRand32() % 5) - 2));\n                test.resize(new_size);\n            }\n            if (((r >> 7) % 8) == 3) {\n                test.insert(InsecureRand32() % (test.size() + 1), 1 + (InsecureRand32() % 2), InsecureRand32());\n            }\n            if (((r >> 10) % 8) == 4) {\n                int del = std::min<int>(test.size(), 1 + (InsecureRand32() % 2));\n                int beg = InsecureRand32() % (test.size() + 1 - del);\n                test.erase(beg, beg + del);\n            }\n            if (((r >> 13) % 16) == 5) {\n                test.push_back(InsecureRand32());\n            }\n            if (test.size() > 0 && ((r >> 17) % 16) == 6) {\n                test.pop_back();\n            }\n            if (((r >> 21) % 32) == 7) {\n                int values[4];\n                int num = 1 + (InsecureRand32() % 4);\n                for (int i = 0; i < num; i++) {\n                    values[i] = InsecureRand32();\n                }\n                test.insert_range(InsecureRand32() % (test.size() + 1), values, values + num);\n            }\n            if (((r >> 26) % 32) == 8) {\n                int del = std::min<int>(test.size(), 1 + (InsecureRand32() % 4));\n                int beg = InsecureRand32() % (test.size() + 1 - del);\n                test.erase(beg, beg + del);\n            }\n            r = InsecureRand32();\n            if (r % 32 == 9) {\n                test.reserve(InsecureRand32() % 32);\n            }\n            if ((r >> 5) % 64 == 10) {\n                test.shrink_to_fit();\n            }\n            if (test.size() > 0) {\n                test.update(InsecureRand32() % test.size(), InsecureRand32());\n            }\n            if (((r >> 11) % 1024) == 11) {\n                test.clear();\n            }\n            if (((r >> 21) % 512) == 12) {\n                test.assign(InsecureRand32() % 32, InsecureRand32());\n            }\n            if (((r >> 15) % 64) == 3) {\n                test.swap();\n            }\n        }\n    }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * File:   csg_fmatch_main.cc\n * Author: lukyanov\n *\n * Created on June 10, 2009, 5:00 PM\n *\/\n\n#include <iostream>\n#include <fstream>\n#include <boost\/program_options.hpp>\n#include <cgengine.h>\n#include <libversion.h>\n#include \"csg_fmatch.h\"\n\/*\n * \n *\/\nint main(int argc, char** argv)\n{    \n    \/\/ we have one observer, this analyzes neamtic order\n    CGForceMatching fmatch;        \n    \/\/ The CGEngine does the work\n    CGEngine cg_engine;\n    \n    \/\/ add our observer that it gets called to analyze frames\n    cg_engine.AddObserver((CGObserver*)&fmatch);\n\n\n    \/\/ initialize the readers\/writers,\n    \/\/ this will be combined in an initialize function later\n    TrajectoryWriter::RegisterPlugins();\n    TrajectoryReader::RegisterPlugins();\n    TopologyReader::RegisterPlugins();\n\n    \n    \/\/ lets read in some program options\n    namespace po = boost::program_options;\n        \n    \n    \/\/ Declare the supported options.\n    po::options_description desc(\"Allowed options\");    \n\n    desc.add_options()\n      (\"options\", po::value<string>(), \"options file for coarse graining\");    \n    \n    \/\/ let cg_engine add some program options\n    cg_engine.AddProgramOptions(desc);\n    \n    \/\/ now read in the command line\n    po::variables_map vm;\n    po::store(po::parse_command_line(argc, argv, desc), vm);\n    po::notify(vm);\n\n    \/\/ does the user want help?\n    if (vm.count(\"help\")) {\n        cout << \"csg_fmatch, lib version \" << LIB_VERSION_STR << \"\\n\\n\";                \n        cout << desc << endl;\n        return 0;\n    }\n    \/\/ or asks for the program version?\n    if (vm.count(\"version\")) {\n        cout << \"csg_fmatch, lib version \" << LIB_VERSION_STR  << \"\\n\";                        \n        return 0;\n    }\n    \n    if(!vm.count(\"options\")) {\n        cout << \"need to specify options file\\n\";\n        cout << desc << endl;\n        return -1;\n    }\n    \n    fmatch.LoadOptions(vm[\"options\"].as<string>());\n    \n    \/\/ try to run the cg process, go through the frames, etc...\n    try {\n        cg_engine.Run(desc, vm);\n    }\n    \/\/ did an error occour?\n    catch(string error) {\n        cerr << \"An error occoured!\" << endl << error << endl;\n    }\n    return 0;\n}\n<commit_msg>improved error handling from Victor<commit_after>\/* \n * File:   csg_fmatch_main.cc\n * Author: lukyanov\n *\n * Created on June 10, 2009, 5:00 PM\n *\/\n\n#include <iostream>\n#include <fstream>\n#include <boost\/program_options.hpp>\n#include <cgengine.h>\n#include <libversion.h>\n#include \"csg_fmatch.h\"\n\/*\n * \n *\/\nint main(int argc, char** argv)\n{    \n    \/\/ we have one observer, this analyzes neamtic order\n    CGForceMatching fmatch;        \n    \/\/ The CGEngine does the work\n    CGEngine cg_engine;\n    \n    \/\/ add our observer that it gets called to analyze frames\n    cg_engine.AddObserver((CGObserver*)&fmatch);\n\n\n    \/\/ initialize the readers\/writers,\n    \/\/ this will be combined in an initialize function later\n    TrajectoryWriter::RegisterPlugins();\n    TrajectoryReader::RegisterPlugins();\n    TopologyReader::RegisterPlugins();\n\n    \n    \/\/ lets read in some program options\n    namespace po = boost::program_options;\n        \n    \n    \/\/ Declare the supported options.\n    po::options_description desc(\"Allowed options\");    \n\n    desc.add_options()\n      (\"options\", po::value<string>(), \"options file for coarse graining\");    \n    \n    \/\/ let cg_engine add some program options\n    cg_engine.AddProgramOptions(desc);\n    \n    \/\/ now read in the command line\n    po::variables_map vm;\n    po::store(po::parse_command_line(argc, argv, desc), vm);\n    po::notify(vm);\n\n    \/\/ does the user want help?\n    if (vm.count(\"help\")) {\n        cout << \"csg_fmatch, lib version \" << LIB_VERSION_STR << \"\\n\\n\";                \n        cout << desc << endl;\n        return 0;\n    }\n    \/\/ or asks for the program version?\n    if (vm.count(\"version\")) {\n        cout << \"csg_fmatch, lib version \" << LIB_VERSION_STR  << \"\\n\";                        \n        return 0;\n    }\n    \n    if(!vm.count(\"options\")) {\n        cout << \"need to specify options file\\n\";\n        cout << desc << endl;\n        return -1;\n    }\n    \n    fmatch.LoadOptions(vm[\"options\"].as<string>());\n    \n    \/\/ try to run the cg process, go through the frames, etc...\n    try {\n        cg_engine.Run(desc, vm);\n    }\n\n    \/\/ did an error occour?\n    catch(exception &error) {\n        cerr << \"An error occoured!\" << endl << error.what() << endl;\n    }\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define AN_BAUD 9600\n#define AN_HANDSHAKE_IN \"AN:HELLO_ARDUINO\"\n#define AN_HANDSHAKE_OUT \"AN:HELLO_NODE\"\n#define AN_NL '\\n'\n\nvoid setup() {\n  Serial.begin(AN_BAUD);\n  _waitForHandShake();\n  pinMode(13, OUTPUT);\n  digitalWrite(13, LOW);\n}\n\nvoid loop(){\n  while (Serial.available() > 0) {\n    int inByte = Serial.read();\n    Serial.println(inByte);\n    switch (inByte) {\n      case '0':\n         digitalWrite(13,LOW);\n         break;\n      case '1':\n         digitalWrite(13,HIGH);\n         break;\n    }\n  }\n}\n\nvoid _waitForHandShake(){\n  bool handShaked = false;\n  while (!handShaked) {\n    String str = Serial.readStringUntil(AN_NL);\n    if (str == AN_HANDSHAKE_IN) {\n      Serial.write(AN_HANDSHAKE_OUT);\n      handShaked = true;\n    }\n  }\n}\n\n\n<commit_msg>Just commenting out...<commit_after>#define AN_BAUD          9600\n#define AN_HANDSHAKE_IN  \"AN:HELLO_ARDUINO\"\n#define AN_HANDSHAKE_OUT \"AN:HELLO_NODE\"\n#define AN_NL            '\\n'\n\n\n\/**\n * Setup Arnode Stuff\n *\/\nvoid setup() {\n  \/\/ Open the serial port\n  Serial.begin(AN_BAUD);\n  \/\/ Wait for the hand-shake, before anything else\n  _waitForHandShake();\n\n  \/\/ test stuff\n  pinMode(13, OUTPUT);\n  digitalWrite(13, LOW);\n}\n\nvoid loop(){\n\n  \/\/ Scratch part, will be removed soon, now we need it for tests\n  while (Serial.available() > 0) {\n    int inByte = Serial.read();\n    Serial.println(inByte);\n    switch (inByte) {\n      case '0':\n         digitalWrite(13,LOW);\n         break;\n      case '1':\n         digitalWrite(13,HIGH);\n         break;\n    }\n  }\n}\n\n\/**\n * Private 'method' to wait until the hand-shake is done :)\n *\/\nvoid _waitForHandShake(){\n  bool handShaked = false;\n  while (!handShaked) {\n    String str = Serial.readStringUntil(AN_NL);\n    if (str == AN_HANDSHAKE_IN) {\n      Serial.write(AN_HANDSHAKE_OUT);\n      handShaked = true;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  PWM.cpp - PWM library v1.0.0 - 10-04-2016\n  Copyright (c) 2006-2008 Dani Gonzalez.  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  See file LICENSE.txt for further informations on licensing terms.\n*\/\n\n\/\/******************************************************************************\n\/\/* Includes\n\/\/******************************************************************************\n\n#include \"Arduino.h\"\n#include \"PWM.h\"\n\n\/\/******************************************************************************\n\/\/* Constructors\n\/\/******************************************************************************\n\nPWM::PWM(int pin){\n   pinMode(pin, OUTPUT);\n   _pin = pin;\n}\n\n\/\/******************************************************************************\n\/\/* Public Methods\n\/\/******************************************************************************\n\n\/* handler method that use a timer and a counter to make the cycle *\/\nint PWM::handler(){\n\t_tempActual = micros();\n  if (_tempActual - _tempVell >= _retard) {\n    _tempVell = _tempActual;\n    _counter++;\n    if (_counter == 101) {\n      _counter = 0;\n    }\n    if (_dutyCicle > _counter || _dutyCicle == 100) {\n      digitalWrite(_pin, HIGH);\n    } else {\n      digitalWrite(_pin, LOW);\n    }\n  }\n  return digitalRead(_pin);\n}\n\n\/* setDuty method to set the time period in which the output is on *\/\nvoid PWM::setDuty(int dutyCicle){\n\t_dutyCicle=dutyCicle;\n}\n\/* setRetard method to set the period of the time cycle *\/\nvoid PWM::setRetard(unsigned long retard){\n\t_retard=retard;\n}\n\n\/* getCounter method to get the actual value of the progressive 1-100 counter *\/\nint PWM::getCounter(){\n   return _counter;\n}\n\n\n\n<commit_msg>Delete PWM.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file  S2_easy.cpp\n\/\/\/ @brief Calculate the contribution of the clustered easy leaves\n\/\/\/        and the sparse easy leaves in parallel using OpenMP\n\/\/\/        (Deleglise-Rivat algorithm).\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 <PiTable.hpp>\n#include <primecount-internal.hpp>\n#include <calculator.hpp>\n#include <fast_div.hpp>\n#include <generate.hpp>\n#include <int128_t.hpp>\n#include <min.hpp>\n#include <imath.hpp>\n#include <S2Status.hpp>\n#include <S2.hpp>\n#include <json.hpp>\n\n#include <stdint.h>\n#include <vector>\n#include <fstream>\n\n#ifdef _OPENMP\n  #include <omp.h>\n#endif\n\nusing namespace std;\nusing namespace primecount;\nusing namespace nlohmann;\n\nnamespace {\n\ntemplate <typename T>\nvoid backup(T x,\n            int64_t y,\n            int64_t z,\n            int64_t c,\n            int64_t start,\n            int64_t pi_x13,\n            T s2_easy,\n            double percent,\n            double time)\n{\n  ifstream ifs(\"primecount.backup\");\n  json j;\n\n  if (ifs.is_open())\n  {\n    ifs >> j;\n    ifs.close();\n  }\n\n  if (j.find(\"S2_easy\") != j.end())\n    j.erase(j.find(\"S2_easy\"));\n\n  j[\"S2_easy\"][\"x\"] = to_string(x);\n  j[\"S2_easy\"][\"y\"] = y;\n  j[\"S2_easy\"][\"z\"] = z;\n  j[\"S2_easy\"][\"c\"] = c;\n  j[\"S2_easy\"][\"start\"] = start;\n  j[\"S2_easy\"][\"pi_x13\"] = pi_x13;\n  j[\"S2_easy\"][\"s2_easy\"] = to_string(s2_easy);\n  j[\"S2_easy\"][\"percent\"] = percent;\n  j[\"S2_easy\"][\"seconds\"] = get_wtime() - time;\n\n  ofstream ofs(\"primecount.backup\");\n  ofs << setw(4) << j << endl;\n}\n\ntemplate <typename T>\nbool resume(T x,\n            int64_t y,\n            int64_t z,\n            int64_t c,\n            int64_t& start,\n            int64_t& pi_x13,\n            T& s2_easy,\n            double& time)\n{\n  ifstream ifs(\"primecount.backup\");\n  json j;\n\n  if (ifs.is_open())\n  {\n    ifs >> j;\n    ifs.close();\n  }\n\n  if (j.find(\"S2_easy\") != j.end() &&\n      x == calculator::eval<T>(j[\"S2_easy\"][\"x\"]) &&\n      y == j[\"S2_easy\"][\"y\"] &&\n      z == j[\"S2_easy\"][\"z\"] &&\n      c == j[\"S2_easy\"][\"c\"])\n  {\n    start = j[\"S2_easy\"][\"start\"];\n    pi_x13 = j[\"S2_easy\"][\"pi_x13\"];\n    s2_easy = calculator::eval<T>(j[\"S2_easy\"][\"s2_easy\"]);\n    double seconds = j[\"S2_easy\"][\"seconds\"];\n    time = get_wtime() - seconds;\n\n    if (is_print())\n    {\n      if (!print_variables())\n        cout << endl;\n\n      cout << \"=== Resuming from primecount.backup ===\" << endl;\n      cout << \"start = \" << start << endl;\n      cout << \"pi_x13 = \" << pi_x13 << endl;\n      cout << \"s2_easy = \" << s2_easy << endl;\n      cout << \"Seconds: \" << seconds << endl;\n      cout << endl;\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\n\/\/\/ Calculate the contribution of the clustered easy leaves\n\/\/\/ and the sparse easy leaves.\n\/\/\/ @param T  either int64_t or uint128_t.\n\/\/\/\ntemplate <typename T, typename Primes>\nT S2_easy_OpenMP(T x,\n                 int64_t y,\n                 int64_t z,\n                 int64_t c,\n                 Primes& primes,\n                 int threads,\n                 double& time)\n{\n  T s2_easy = 0;\n  int64_t start;\n  int64_t pi_x13;\n  double backup_time = get_wtime();\n\n  if (resume(x, y, z, c, start, pi_x13, s2_easy, time) && start >= pi_x13)\n    return s2_easy;\n\n  PiTable pi(y);\n  int64_t pi_sqrty = pi[isqrt(y)];\n  int64_t x13 = iroot<3>(x);\n  int64_t max_dist = 1;\n  int64_t thread_threshold = 1000;\n  threads = ideal_num_threads(threads, x13, thread_threshold);\n\n  pi_x13 = pi[x13];\n  start = max(c, pi_sqrty) + 1;\n  S2Status status(x);\n\n  while (start <= pi_x13)\n  {\n    int64_t stop = min(start + max_dist * threads, pi_x13);\n\n    #pragma omp parallel for schedule(dynamic) num_threads(threads) reduction(+: s2_easy)\n    for (int64_t b = start; b <= stop; b++)\n    {\n      int64_t prime = primes[b];\n      T x2 = x \/ prime;\n      int64_t min_trivial = min(x2 \/ prime, y);\n      int64_t min_clustered = (int64_t) isqrt(x2);\n      int64_t min_sparse = z \/ prime;\n\n      min_clustered = in_between(prime, min_clustered, y);\n      min_sparse = in_between(prime, min_sparse, y);\n\n      int64_t l = pi[min_trivial];\n      int64_t pi_min_clustered = pi[min_clustered];\n      int64_t pi_min_sparse = pi[min_sparse];\n\n      \/\/ Find all clustered easy leaves:\n      \/\/ n = primes[b] * primes[l]\n      \/\/ x \/ n <= y && phi(x \/ n, b - 1) == phi(x \/ m, b - 1)\n      \/\/ where phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n      while (l > pi_min_clustered)\n      {\n        int64_t xn = (int64_t) fast_div(x2, primes[l]);\n        int64_t phi_xn = pi[xn] - b + 2;\n        int64_t xm = (int64_t) fast_div(x2, primes[b + phi_xn - 1]);\n        int64_t l2 = pi[xm];\n        s2_easy += phi_xn * (l - l2);\n        l = l2;\n      }\n\n      \/\/ Find all sparse easy leaves:\n      \/\/ n = primes[b] * primes[l]\n      \/\/ x \/ n <= y && phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n      for (; l > pi_min_sparse; l--)\n      {\n        int64_t xn = (int64_t) fast_div(x2, primes[l]);\n        s2_easy += pi[xn] - b + 2;\n      }\n\n      if (is_print())\n        status.print(b, pi_x13);\n    }\n\n    start = stop + 1;\n\n    if (get_wtime() - backup_time < 60)\n      max_dist *= 2;\n    else\n    {\n      max_dist = ceil_div(max_dist, 2);\n      double percent = status.getPercent(start, pi_x13, start, pi_x13);\n      backup(x, y, z, c, start, pi_x13, s2_easy, percent, time);\n      backup_time = get_wtime();\n    }\n  }\n\n  backup(x, y, z, c, pi_x13, pi_x13, s2_easy, 100, time);\n\n  return s2_easy;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nint64_t S2_easy(int64_t x,\n                int64_t y,\n                int64_t z,\n                int64_t c,\n                int threads)\n{\n#ifdef HAVE_MPI\n  if (mpi_num_procs() > 1)\n    return S2_easy_mpi(x, y, z, c, threads);\n#endif\n\n  print(\"\");\n  print(\"=== S2_easy(x, y) ===\");\n  print(\"Computation of the easy special leaves\");\n  print(x, y, c, threads);\n\n  double time = get_wtime();\n  auto primes = generate_primes<int32_t>(y);\n  int64_t s2_easy = S2_easy_OpenMP((intfast64_t) x, y, z, c, primes, threads, time);\n\n  print(\"S2_easy\", s2_easy, time);\n  return s2_easy;\n}\n\n#ifdef HAVE_INT128_T\n\nint128_t S2_easy(int128_t x,\n                 int64_t y,\n                 int64_t z,\n                 int64_t c,\n                 int threads)\n{\n#ifdef HAVE_MPI\n  if (mpi_num_procs() > 1)\n    return S2_easy_mpi(x, y, z, c, threads);\n#endif\n\n  print(\"\");\n  print(\"=== S2_easy(x, y) ===\");\n  print(\"Computation of the easy special leaves\");\n  print(x, y, c, threads);\n\n  int128_t s2_easy;\n  double time = get_wtime();\n\n  \/\/ uses less memory\n  if (y <= numeric_limits<uint32_t>::max())\n  {\n    auto primes = generate_primes<uint32_t>(y);\n    s2_easy = S2_easy_OpenMP((intfast128_t) x, y, z, c, primes, threads, time);\n  }\n  else\n  {\n    auto primes = generate_primes<int64_t>(y);\n    s2_easy = S2_easy_OpenMP((intfast128_t) x, y, z, c, primes, threads, time);\n  }\n\n  print(\"S2_easy\", s2_easy, time);\n  return s2_easy;\n}\n\n#endif\n\n} \/\/ namespace\n<commit_msg>Refactor<commit_after>\/\/\/\n\/\/\/ @file  S2_easy.cpp\n\/\/\/ @brief Calculate the contribution of the clustered easy leaves\n\/\/\/        and the sparse easy leaves in parallel using OpenMP\n\/\/\/        (Deleglise-Rivat algorithm).\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 <PiTable.hpp>\n#include <primecount-internal.hpp>\n#include <calculator.hpp>\n#include <fast_div.hpp>\n#include <generate.hpp>\n#include <int128_t.hpp>\n#include <min.hpp>\n#include <imath.hpp>\n#include <S2Status.hpp>\n#include <S2.hpp>\n#include <json.hpp>\n\n#include <stdint.h>\n#include <vector>\n#include <fstream>\n\n#ifdef _OPENMP\n  #include <omp.h>\n#endif\n\nusing namespace std;\nusing namespace primecount;\nusing namespace nlohmann;\n\nnamespace {\n\ntemplate <typename T>\nvoid backup(T x,\n            int64_t y,\n            int64_t z,\n            int64_t c,\n            int64_t start,\n            int64_t pi_x13,\n            T s2_easy,\n            double percent,\n            double time)\n{\n  ifstream ifs(\"primecount.backup\");\n  json j;\n\n  if (ifs.is_open())\n  {\n    ifs >> j;\n    ifs.close();\n  }\n\n  if (j.find(\"S2_easy\") != j.end())\n    j.erase(j.find(\"S2_easy\"));\n\n  j[\"S2_easy\"][\"x\"] = to_string(x);\n  j[\"S2_easy\"][\"y\"] = y;\n  j[\"S2_easy\"][\"z\"] = z;\n  j[\"S2_easy\"][\"c\"] = c;\n  j[\"S2_easy\"][\"start\"] = start;\n  j[\"S2_easy\"][\"pi_x13\"] = pi_x13;\n  j[\"S2_easy\"][\"s2_easy\"] = to_string(s2_easy);\n  j[\"S2_easy\"][\"percent\"] = percent;\n  j[\"S2_easy\"][\"seconds\"] = get_wtime() - time;\n\n  ofstream ofs(\"primecount.backup\");\n  ofs << setw(4) << j << endl;\n}\n\ntemplate <typename T>\nbool resume(T x,\n            int64_t y,\n            int64_t z,\n            int64_t c,\n            int64_t& start,\n            int64_t& pi_x13,\n            T& s2_easy,\n            double& time)\n{\n  ifstream ifs(\"primecount.backup\");\n  json j;\n\n  if (ifs.is_open())\n  {\n    ifs >> j;\n    ifs.close();\n  }\n\n  if (j.find(\"S2_easy\") != j.end() &&\n      x == calculator::eval<T>(j[\"S2_easy\"][\"x\"]) &&\n      y == j[\"S2_easy\"][\"y\"] &&\n      z == j[\"S2_easy\"][\"z\"] &&\n      c == j[\"S2_easy\"][\"c\"])\n  {\n    double percent = j[\"S2_easy\"][\"percent\"];\n    double seconds = j[\"S2_easy\"][\"seconds\"];\n\n    start = j[\"S2_easy\"][\"start\"];\n    pi_x13 = j[\"S2_easy\"][\"pi_x13\"];\n    s2_easy = calculator::eval<T>(j[\"S2_easy\"][\"s2_easy\"]);\n    time = get_wtime() - seconds;\n\n    if (is_print())\n    {\n      if (!print_variables())\n        cout << endl;\n\n      cout << \"=== Resuming from primecount.backup ===\" << endl;\n      cout << \"start = \" << start << endl;\n      cout << \"pi_x13 = \" << pi_x13 << endl;\n      cout << \"s2_easy = \" << s2_easy << endl;\n      cout << \"Seconds: \" << seconds << endl << endl;\n      cout << \"Status: \" << fixed << setprecision(get_status_precision(x)) << percent << '%' << flush;\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\n\/\/\/ Calculate the contribution of the clustered easy leaves\n\/\/\/ and the sparse easy leaves.\n\/\/\/ @param T  either int64_t or uint128_t.\n\/\/\/\ntemplate <typename T, typename Primes>\nT S2_easy_OpenMP(T x,\n                 int64_t y,\n                 int64_t z,\n                 int64_t c,\n                 Primes& primes,\n                 int threads,\n                 double& time)\n{\n  T s2_easy = 0;\n  int64_t start;\n  int64_t pi_x13;\n  double backup_time = get_wtime();\n  bool is_resume = resume(x, y, z, c, start, pi_x13, s2_easy, time);\n\n  if (is_resume && start >= pi_x13)\n    return s2_easy;\n\n  PiTable pi(y);\n  S2Status status(x);\n\n  int64_t pi_sqrty = pi[isqrt(y)];\n  int64_t x13 = iroot<3>(x);\n  int64_t max_dist = 1;\n  int64_t thread_threshold = 1000;\n  threads = ideal_num_threads(threads, x13, thread_threshold);\n\n  if (!is_resume)\n  {\n    start = max(c, pi_sqrty) + 1;\n    pi_x13 = pi[x13];\n  }\n\n  while (start <= pi_x13)\n  {\n    int64_t stop = min(start + max_dist * threads, pi_x13);\n\n    #pragma omp parallel for schedule(dynamic) num_threads(threads) reduction(+: s2_easy)\n    for (int64_t b = start; b <= stop; b++)\n    {\n      int64_t prime = primes[b];\n      T x2 = x \/ prime;\n      int64_t min_trivial = min(x2 \/ prime, y);\n      int64_t min_clustered = (int64_t) isqrt(x2);\n      int64_t min_sparse = z \/ prime;\n\n      min_clustered = in_between(prime, min_clustered, y);\n      min_sparse = in_between(prime, min_sparse, y);\n\n      int64_t l = pi[min_trivial];\n      int64_t pi_min_clustered = pi[min_clustered];\n      int64_t pi_min_sparse = pi[min_sparse];\n\n      \/\/ Find all clustered easy leaves:\n      \/\/ n = primes[b] * primes[l]\n      \/\/ x \/ n <= y && phi(x \/ n, b - 1) == phi(x \/ m, b - 1)\n      \/\/ where phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n      while (l > pi_min_clustered)\n      {\n        int64_t xn = (int64_t) fast_div(x2, primes[l]);\n        int64_t phi_xn = pi[xn] - b + 2;\n        int64_t xm = (int64_t) fast_div(x2, primes[b + phi_xn - 1]);\n        int64_t l2 = pi[xm];\n        s2_easy += phi_xn * (l - l2);\n        l = l2;\n      }\n\n      \/\/ Find all sparse easy leaves:\n      \/\/ n = primes[b] * primes[l]\n      \/\/ x \/ n <= y && phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n      for (; l > pi_min_sparse; l--)\n      {\n        int64_t xn = (int64_t) fast_div(x2, primes[l]);\n        s2_easy += pi[xn] - b + 2;\n      }\n\n      if (is_print())\n        status.print(b, pi_x13);\n    }\n\n    start = stop + 1;\n\n    if (get_wtime() - backup_time < 60)\n      max_dist *= 2;\n    else\n    {\n      max_dist = ceil_div(max_dist, 2);\n      double percent = status.getPercent(start, pi_x13, start, pi_x13);\n      backup(x, y, z, c, start, pi_x13, s2_easy, percent, time);\n      backup_time = get_wtime();\n    }\n  }\n\n  backup(x, y, z, c, pi_x13, pi_x13, s2_easy, 100, time);\n\n  return s2_easy;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nint64_t S2_easy(int64_t x,\n                int64_t y,\n                int64_t z,\n                int64_t c,\n                int threads)\n{\n#ifdef HAVE_MPI\n  if (mpi_num_procs() > 1)\n    return S2_easy_mpi(x, y, z, c, threads);\n#endif\n\n  print(\"\");\n  print(\"=== S2_easy(x, y) ===\");\n  print(\"Computation of the easy special leaves\");\n  print(x, y, c, threads);\n\n  double time = get_wtime();\n  auto primes = generate_primes<int32_t>(y);\n  int64_t s2_easy = S2_easy_OpenMP((intfast64_t) x, y, z, c, primes, threads, time);\n\n  print(\"S2_easy\", s2_easy, time);\n  return s2_easy;\n}\n\n#ifdef HAVE_INT128_T\n\nint128_t S2_easy(int128_t x,\n                 int64_t y,\n                 int64_t z,\n                 int64_t c,\n                 int threads)\n{\n#ifdef HAVE_MPI\n  if (mpi_num_procs() > 1)\n    return S2_easy_mpi(x, y, z, c, threads);\n#endif\n\n  print(\"\");\n  print(\"=== S2_easy(x, y) ===\");\n  print(\"Computation of the easy special leaves\");\n  print(x, y, c, threads);\n\n  int128_t s2_easy;\n  double time = get_wtime();\n\n  \/\/ uses less memory\n  if (y <= numeric_limits<uint32_t>::max())\n  {\n    auto primes = generate_primes<uint32_t>(y);\n    s2_easy = S2_easy_OpenMP((intfast128_t) x, y, z, c, primes, threads, time);\n  }\n  else\n  {\n    auto primes = generate_primes<int64_t>(y);\n    s2_easy = S2_easy_OpenMP((intfast128_t) x, y, z, c, primes, threads, time);\n  }\n\n  print(\"S2_easy\", s2_easy, time);\n  return s2_easy;\n}\n\n#endif\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\nCopyright (c) 2011 Steve Revill and Shane Woolcock\r\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:\r\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\r\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.\r\n*\/\r\n#include <windows.h>\r\n#include <string.h>\r\n#include <iostream>\r\n\r\n#include <time.h>\r\n#include <Shellapi.h>\r\nextern gxtkAudio *bb_audio_device;\r\nextern gxtkGraphics *bb_graphics_device;\r\n\r\nfloat diddy_mouseWheel = 0.0f;\r\n\r\n\r\n\r\nfloat diddy_mouseZ() {\r\n\tfloat ret = glfwGetMouseWheel() - diddy_mouseWheel;\r\n\tdiddy_mouseWheel = glfwGetMouseWheel();\r\n\treturn ret;\r\n}\r\n\r\nclass diddy\r\n{\r\n\tpublic:\r\n\t\r\n\t\/\/ Returns an empty string if dialog is cancelled\r\n\tstatic String openfilename() {\r\n\t\tchar *filter = \"All Files (*.*)\\0*.*\\0\";\r\n\t\tHWND owner = NULL;\r\n\t\tOPENFILENAME ofn;\r\n\t\tchar fileName[MAX_PATH] = \"\";\r\n\t\tZeroMemory(&ofn, sizeof(ofn));\r\n\r\n\t\tofn.lStructSize = sizeof(OPENFILENAME);\r\n\t\tofn.hwndOwner = owner;\r\n\t\tofn.lpstrFilter = filter;\r\n\t\tofn.lpstrFile = fileName;\r\n\t\tofn.nMaxFile = MAX_PATH;\r\n\t\tofn.Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST | OFN_HIDEREADONLY;\r\n\t\tofn.lpstrDefExt = \"\";\r\n\r\n\t\tString fileNameStr;\r\n\r\n\t\tif ( GetOpenFileName(&ofn) )\r\n\t\t\tfileNameStr = fileName;\r\n\r\n\t\treturn fileNameStr;\r\n\t}\r\n\t\r\n\tstatic String savefilename() {\r\n\t\tchar *filter = \"All Files (*.*)\\0*.*\\0\";\r\n\t\tHWND owner = NULL;\r\n\t\tOPENFILENAME ofn;\r\n\t\tchar fileName[MAX_PATH] = \"\";\r\n\t\tZeroMemory(&ofn, sizeof(ofn));\r\n\r\n\t\tofn.lStructSize = sizeof(OPENFILENAME);\r\n\t\tofn.hwndOwner = owner;\r\n\t\tofn.lpstrFilter = filter;\r\n\t\tofn.lpstrFile = fileName;\r\n\t\tofn.nMaxFile = MAX_PATH;\r\n\t\tofn.Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST | OFN_HIDEREADONLY;\r\n\t\tofn.lpstrDefExt = \"\";\r\n\r\n\t\tString fileNameStr;\r\n\r\n\t\tif ( GetSaveFileNameA(&ofn) )\r\n\t\t\tfileNameStr = fileName;\r\n\r\n\t\treturn fileNameStr;\r\n\t}\r\n\t\r\n\tstatic float mouseZ()\r\n\t{\r\n\t\treturn diddy_mouseZ();\r\n\t}\r\n\t\r\n\tstatic void mouseZInit()\r\n\t{\r\n\t\treturn;\r\n\t}\r\n\t\r\n\t\/\/ only accurate to 1 second \r\n\tstatic int systemMillisecs() {\r\n\t\ttime_t seconds;\r\n\t\tseconds = time (NULL);\r\n\t\treturn seconds * 1000;\r\n\t}\r\n\t\r\n\tstatic void setGraphics(int w, int h)\r\n\t{\r\n\t\tglfwSetWindowSize(w, h);\r\n\t\tGLFWvidmode desktopMode;\r\n\t\tglfwGetDesktopMode( &desktopMode );\r\n\t\tglfwSetWindowPos( (desktopMode.Width-w)\/2,(desktopMode.Height-h)\/2 );\r\n\t}\r\n\t\r\n\tstatic void setMouse(int x, int y)\r\n\t{\r\n\t\tglfwSetMousePos(x, y);\r\n\t}\r\n\t\r\n\tstatic void showKeyboard()\r\n\t{\r\n\t}\r\n\tstatic void launchBrowser(String address, String windowName)\r\n\t{\r\n\t\tLPCSTR addressStr = address.ToCString<char>();\r\n\t\tShellExecute(HWND_DESKTOP, \"open\", addressStr, NULL, NULL, SW_SHOWNORMAL);\r\n\t}\r\n\tstatic void launchEmail(String email, String subject, String text)\r\n\t{\r\n\t\tString tmp = \"mailto:\";\r\n\t\ttmp+=email;\r\n\t\ttmp+=\"&subject=\";\r\n\t\ttmp+=subject;\r\n\t\ttmp+=\"&body=\";\r\n\t\ttmp+=text;\r\n\t\tLPCSTR addressStr = tmp.ToCString<char>();\r\n\t\tShellExecute(HWND_DESKTOP, \"open\", addressStr, NULL, NULL, SW_SHOWNORMAL);\r\n\t}\r\n\r\n\tstatic void startVibrate(int millisecs)\r\n\t{\r\n\t}\r\n\tstatic void stopVibrate()\r\n\t{\r\n\t}\r\n\t\r\n\tstatic int getDayOfMonth()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wDay;\r\n\t}\r\n\t\r\n\tstatic int getDayOfWeek()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wDayOfWeek;\r\n\t}\r\n\t\r\n\tstatic int getMonth()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wMonth;\r\n\t}\r\n\t\r\n\tstatic int getYear()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wYear;\r\n\t}\r\n\t\r\n\tstatic int getHours()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wHour;\r\n\t}\r\n\t\r\n\tstatic int getMinutes()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wMinute;\r\n\t}\r\n\t\r\n\tstatic int getSeconds()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wSecond;\r\n\t}\r\n\t\r\n\tstatic int getMilliSeconds()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wMilliseconds;\r\n\t}\r\n\t\r\n\tstatic void startGps()\r\n\t{\r\n\t}\r\n\tstatic String getLatitiude()\r\n\t{\r\n\t\treturn \"\";\r\n\t}\r\n\tstatic String getLongitude()\r\n\t{\r\n\t\treturn \"\";\r\n\t}\r\n\tstatic void showAlertDialog(String title, String message)\r\n\t{\r\n\t}\r\n\tstatic String getInputString()\r\n\t{\r\n\t\treturn \"\";\r\n\t}\r\n\r\n\tstatic int seekMusic(int timeMillis)\r\n\t{\r\n\t\tgxtkChannel *chan = &(bb_audio_device->channels[32]);\r\n\t\tif(chan && chan->state==1)\r\n\t\t{\r\n\t\t\talSourcef(chan->source, AL_SEC_OFFSET, (float)(timeMillis \/ 1000.0));\r\n\t\t}\r\n\t\t\/\/ TODO: check it worked\r\n\t\treturn 1;\r\n\t}\r\n};\r\n<commit_msg>Added ifdefs WIN32 to GLFW C++ - hopefully now it will compile with Linux (UNTESTED!)<commit_after>\/*\r\nCopyright (c) 2011 Steve Revill and Shane Woolcock\r\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:\r\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\r\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.\r\n*\/\r\n\r\n#ifdef _WIN32\r\n#include <windows.h>\r\n#include <Shellapi.h>\r\n#include <iostream>\r\n#endif\r\n\r\n#include <string.h>\r\n#include <time.h>\r\n\r\nextern gxtkAudio *bb_audio_device;\r\nextern gxtkGraphics *bb_graphics_device;\r\n\r\nfloat diddy_mouseWheel = 0.0f;\r\n\r\n\r\n\r\nfloat diddy_mouseZ() {\r\n\tfloat ret = glfwGetMouseWheel() - diddy_mouseWheel;\r\n\tdiddy_mouseWheel = glfwGetMouseWheel();\r\n\treturn ret;\r\n}\r\n\r\nclass diddy\r\n{\r\n\tpublic:\r\n\t\r\n\t\/\/ Returns an empty string if dialog is cancelled\r\n\tstatic String openfilename() {\r\n\t\t#ifdef _WIN32\r\n\t\tchar *filter = \"All Files (*.*)\\0*.*\\0\";\r\n\t\tHWND owner = NULL;\r\n\t\tOPENFILENAME ofn;\r\n\t\tchar fileName[MAX_PATH] = \"\";\r\n\t\tZeroMemory(&ofn, sizeof(ofn));\r\n\r\n\t\tofn.lStructSize = sizeof(OPENFILENAME);\r\n\t\tofn.hwndOwner = owner;\r\n\t\tofn.lpstrFilter = filter;\r\n\t\tofn.lpstrFile = fileName;\r\n\t\tofn.nMaxFile = MAX_PATH;\r\n\t\tofn.Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST | OFN_HIDEREADONLY;\r\n\t\tofn.lpstrDefExt = \"\";\r\n\r\n\t\tString fileNameStr;\r\n\r\n\t\tif ( GetOpenFileName(&ofn) )\r\n\t\t\tfileNameStr = fileName;\r\n\r\n\t\treturn fileNameStr;\r\n\t\t#endif\r\n\t\t#ifdef linux\r\n\t\treturn \"\";\r\n\t\t#endif\r\n\t}\r\n\t\r\n\tstatic String savefilename() {\r\n\t\t#ifdef _WIN32\r\n\t\tchar *filter = \"All Files (*.*)\\0*.*\\0\";\r\n\t\tHWND owner = NULL;\r\n\t\tOPENFILENAME ofn;\r\n\t\tchar fileName[MAX_PATH] = \"\";\r\n\t\tZeroMemory(&ofn, sizeof(ofn));\r\n\r\n\t\tofn.lStructSize = sizeof(OPENFILENAME);\r\n\t\tofn.hwndOwner = owner;\r\n\t\tofn.lpstrFilter = filter;\r\n\t\tofn.lpstrFile = fileName;\r\n\t\tofn.nMaxFile = MAX_PATH;\r\n\t\tofn.Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST | OFN_HIDEREADONLY;\r\n\t\tofn.lpstrDefExt = \"\";\r\n\r\n\t\tString fileNameStr;\r\n\r\n\t\tif ( GetSaveFileNameA(&ofn) )\r\n\t\t\tfileNameStr = fileName;\r\n\r\n\t\treturn fileNameStr;\r\n\t\t#endif\r\n\t\t#ifdef linux\r\n\t\treturn \"\";\r\n\t\t#endif\r\n\t}\r\n\t\r\n\tstatic float mouseZ()\r\n\t{\r\n\t\treturn diddy_mouseZ();\r\n\t}\r\n\t\r\n\tstatic void mouseZInit()\r\n\t{\r\n\t\treturn;\r\n\t}\r\n\t\r\n\t\/\/ only accurate to 1 second \r\n\tstatic int systemMillisecs() {\r\n\t\ttime_t seconds;\r\n\t\tseconds = time (NULL);\r\n\t\treturn seconds * 1000;\r\n\t}\r\n\t\r\n\tstatic void setGraphics(int w, int h)\r\n\t{\r\n\t\tglfwSetWindowSize(w, h);\r\n\t\tGLFWvidmode desktopMode;\r\n\t\tglfwGetDesktopMode( &desktopMode );\r\n\t\tglfwSetWindowPos( (desktopMode.Width-w)\/2,(desktopMode.Height-h)\/2 );\r\n\t}\r\n\t\r\n\tstatic void setMouse(int x, int y)\r\n\t{\r\n\t\tglfwSetMousePos(x, y);\r\n\t}\r\n\t\r\n\tstatic void showKeyboard()\r\n\t{\r\n\t}\r\n\tstatic void launchBrowser(String address, String windowName)\r\n\t{\r\n\t\t#ifdef _WIN32\r\n\t\tLPCSTR addressStr = address.ToCString<char>();\r\n\t\tShellExecute(HWND_DESKTOP, \"open\", addressStr, NULL, NULL, SW_SHOWNORMAL);\r\n\t\t#endif\r\n\t}\r\n\tstatic void launchEmail(String email, String subject, String text)\r\n\t{\r\n\t\t#ifdef _WIN32\r\n\t\tString tmp = \"mailto:\";\r\n\t\ttmp+=email;\r\n\t\ttmp+=\"&subject=\";\r\n\t\ttmp+=subject;\r\n\t\ttmp+=\"&body=\";\r\n\t\ttmp+=text;\r\n\t\tLPCSTR addressStr = tmp.ToCString<char>();\r\n\t\tShellExecute(HWND_DESKTOP, \"open\", addressStr, NULL, NULL, SW_SHOWNORMAL);\r\n\t\t#endif\r\n\t}\r\n\r\n\tstatic void startVibrate(int millisecs)\r\n\t{\r\n\t}\r\n\tstatic void stopVibrate()\r\n\t{\r\n\t}\r\n\t\r\n\tstatic int getDayOfMonth()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wDay;\r\n\t}\r\n\t\r\n\tstatic int getDayOfWeek()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wDayOfWeek;\r\n\t}\r\n\t\r\n\tstatic int getMonth()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wMonth;\r\n\t}\r\n\t\r\n\tstatic int getYear()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wYear;\r\n\t}\r\n\t\r\n\tstatic int getHours()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wHour;\r\n\t}\r\n\t\r\n\tstatic int getMinutes()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wMinute;\r\n\t}\r\n\t\r\n\tstatic int getSeconds()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wSecond;\r\n\t}\r\n\t\r\n\tstatic int getMilliSeconds()\r\n\t{\r\n\t\tSYSTEMTIME st;\r\n\t\tGetSystemTime(&st);\r\n\t\treturn st.wMilliseconds;\r\n\t}\r\n\t\r\n\tstatic void startGps()\r\n\t{\r\n\t}\r\n\tstatic String getLatitiude()\r\n\t{\r\n\t\treturn \"\";\r\n\t}\r\n\tstatic String getLongitude()\r\n\t{\r\n\t\treturn \"\";\r\n\t}\r\n\tstatic void showAlertDialog(String title, String message)\r\n\t{\r\n\t}\r\n\tstatic String getInputString()\r\n\t{\r\n\t\treturn \"\";\r\n\t}\r\n\r\n\tstatic int seekMusic(int timeMillis)\r\n\t{\r\n\t\tgxtkChannel *chan = &(bb_audio_device->channels[32]);\r\n\t\tif(chan && chan->state==1)\r\n\t\t{\r\n\t\t\talSourcef(chan->source, AL_SEC_OFFSET, (float)(timeMillis \/ 1000.0));\r\n\t\t}\r\n\t\t\/\/ TODO: check it worked\r\n\t\treturn 1;\r\n\t}\r\n};\r\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"journal\/player.hpp\"\n\n#include <chrono>\n#include <filesystem>\n#include <string>\n\n#include \"base\/array.hpp\"\n#include \"base\/get_line.hpp\"\n#include \"base\/hexadecimal.hpp\"\n#include \"journal\/profiles.hpp\"\n#include \"glog\/logging.h\"\n\nnamespace principia {\n\nusing base::GetLine;\nusing base::HexadecimalEncoder;\nusing base::UniqueArray;\nusing interface::principia__ActivatePlayer;\n\nnamespace journal {\n\nPlayer::Player(std::filesystem::path const& path)\n    : stream_(path, std::ios::in) {\n  principia__ActivatePlayer();\n  CHECK(!stream_.fail());\n}\n\nbool Player::Play(int const index) {\n  std::unique_ptr<serialization::Method> method_in = Read();\n  if (method_in == nullptr) {\n    \/\/ End of input file.\n    return false;\n  }\n  std::unique_ptr<serialization::Method> method_out_return = Read();\n  if (method_out_return == nullptr) {\n    LOG(ERROR) << \"Unpaired method:\\n\" << method_in->DebugString();\n    return false;\n  }\n\n#if 0\n  if (index == 3171451) {\n    LOG_IF(ERROR, index > 3170000) << \"index: \" << index << \"\\n\"\n                                   << method_in->ShortDebugString() << \"\\n\"\n                                   << method_out_return->ShortDebugString();\n  }\n#endif\n\n  auto const before = std::chrono::system_clock::now();\n\n#include \"journal\/player.generated.cc\"\n\n  auto const after = std::chrono::system_clock::now();\n  if (after - before > std::chrono::milliseconds(100)) {\n    LOG(ERROR) << \"Long method:\\n\" << method_in->DebugString();\n  }\n\n  last_method_in_.swap(method_in);\n  last_method_out_return_.swap(method_out_return);\n\n  return true;\n}\n\nserialization::Method const& Player::last_method_in() const {\n  return *last_method_in_;\n}\n\nserialization::Method const& Player::last_method_out_return() const {\n  return *last_method_out_return_;\n}\n\nstd::unique_ptr<serialization::Method> Player::Read() {\n  std::string const line = GetLine(stream_);\n  if (line.empty()) {\n    return nullptr;\n  }\n\n  static auto* const encoder = new HexadecimalEncoder<\/*null_terminated=*\/true>;\n  auto const bytes = encoder->Decode({line.c_str(), strlen(line.c_str())});\n  auto method = std::make_unique<serialization::Method>();\n  CHECK(method->ParseFromArray(bytes.data.get(), static_cast<int>(bytes.size)));\n\n  return method;\n}\n\n}  \/\/ namespace journal\n}  \/\/ namespace principia\n<commit_msg>Cleanup.<commit_after>\n#include \"journal\/player.hpp\"\n\n#include <chrono>\n#include <filesystem>\n#include <string>\n\n#include \"base\/array.hpp\"\n#include \"base\/get_line.hpp\"\n#include \"base\/hexadecimal.hpp\"\n#include \"journal\/profiles.hpp\"\n#include \"glog\/logging.h\"\n\nnamespace principia {\n\nusing base::GetLine;\nusing base::HexadecimalEncoder;\nusing base::UniqueArray;\nusing interface::principia__ActivatePlayer;\n\nnamespace journal {\n\nPlayer::Player(std::filesystem::path const& path)\n    : stream_(path, std::ios::in) {\n  principia__ActivatePlayer();\n  CHECK(!stream_.fail());\n}\n\nbool Player::Play(int const index) {\n  std::unique_ptr<serialization::Method> method_in = Read();\n  if (method_in == nullptr) {\n    \/\/ End of input file.\n    return false;\n  }\n  std::unique_ptr<serialization::Method> method_out_return = Read();\n  if (method_out_return == nullptr) {\n    LOG(ERROR) << \"Unpaired method:\\n\" << method_in->DebugString();\n    return false;\n  }\n\n#if 0\n  LOG_IF(ERROR, index > 3170000) << \"index: \" << index << \"\\n\"\n                                 << method_in->ShortDebugString() << \"\\n\"\n                                 << method_out_return->ShortDebugString();\n#endif\n\n  auto const before = std::chrono::system_clock::now();\n\n#include \"journal\/player.generated.cc\"\n\n  auto const after = std::chrono::system_clock::now();\n  if (after - before > std::chrono::milliseconds(100)) {\n    LOG(ERROR) << \"Long method:\\n\" << method_in->DebugString();\n  }\n\n  last_method_in_.swap(method_in);\n  last_method_out_return_.swap(method_out_return);\n\n  return true;\n}\n\nserialization::Method const& Player::last_method_in() const {\n  return *last_method_in_;\n}\n\nserialization::Method const& Player::last_method_out_return() const {\n  return *last_method_out_return_;\n}\n\nstd::unique_ptr<serialization::Method> Player::Read() {\n  std::string const line = GetLine(stream_);\n  if (line.empty()) {\n    return nullptr;\n  }\n\n  static auto* const encoder = new HexadecimalEncoder<\/*null_terminated=*\/true>;\n  auto const bytes = encoder->Decode({line.c_str(), strlen(line.c_str())});\n  auto method = std::make_unique<serialization::Method>();\n  CHECK(method->ParseFromArray(bytes.data.get(), static_cast<int>(bytes.size)));\n\n  return method;\n}\n\n}  \/\/ namespace journal\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\/\/ TasksView.cpp : implementation of the CTasksView class\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"stdafx.h\"\n#include \"resource.h\"\n\n#include \"TasksView.h\"\n#include <net\/utf8.hpp>\n#include <algorithm>\n#include <sstream>\n\nclass TaskViewModelListener : public CAppModelListener {\n\tHWND m_hWnd;\npublic:\n\tTaskViewModelListener(HWND hWnd) : m_hWnd(hWnd) {}\n\n\tvoid onListChanged(uint32_t addedOrRemoved) override\n\t{\n\t\t\/\/ traversing the borders of threads, if needed\n\t\t\/\/ also, the actual reaction to the vent will\n\t\t\/\/ not block the emit up there\n\t\tif (IsWindow(m_hWnd))\n\t\t\tPostMessage(m_hWnd, UM_LISTCHANGED, addedOrRemoved, 0);\n\t}\n};\n\nclass ServerListener : public jira::server_listener {\n\tHWND m_hWnd;\n\tuint32_t m_sessionId;\npublic:\n\tServerListener(HWND hWnd, uint32_t sessionId) : m_hWnd(hWnd), m_sessionId(sessionId) {}\n\n\tvoid onRefreshStarted() override\n\t{\n\t\tif (IsWindow(m_hWnd))\n\t\t\tPostMessage(m_hWnd, UM_REFRESHSTART, m_sessionId, 0);\n\t}\n\n\tvoid onRefreshFinished() override\n\t{\n\t\tif (IsWindow(m_hWnd))\n\t\t\tPostMessage(m_hWnd, UM_REFRESHSTOP, m_sessionId, 0);\n\t}\n};\n\nstd::vector<CTasksView::ServerInfo>::iterator CTasksView::find(uint32_t sessionId)\n{\n\treturn std::find_if(std::begin(m_servers), std::end(m_servers), [sessionId](const ServerInfo& info) { return info.m_sessionId == sessionId; });\n}\n\nstd::vector<CTasksView::ServerInfo>::iterator CTasksView::insert(std::vector<ServerInfo>::const_iterator it, const std::shared_ptr<jira::server>& server)\n{\n\t\/\/ TODO: create UI element\n\t\/\/ TDOD: attach refresh listener to the server\n\tauto listener = std::make_shared<ServerListener>(m_hWnd, server->sessionId());\n\treturn m_servers.emplace(it, server, listener);\n}\n\nstd::vector<CTasksView::ServerInfo>::iterator CTasksView::erase(std::vector<ServerInfo>::const_iterator it)\n{\n\t\/\/ TODO: destroy UI element\n\t\/\/ TDOD: detach refresh listener from the server\n\treturn m_servers.erase(it);\n}\n\n\nBOOL CTasksView::PreTranslateMessage(MSG* pMsg)\n{\n\tpMsg;\n\treturn FALSE;\n}\n\nLRESULT CTasksView::OnCreate(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tm_listener = std::make_shared<TaskViewModelListener>(m_hWnd);\n\tm_model->registerListener(m_listener);\n\treturn 0;\n}\n\nLRESULT CTasksView::OnDestroy(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tm_model->unregisterListener(m_listener);\n\treturn 0;\n}\n\nLRESULT CTasksView::OnPaint(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tCPaintDC dc(m_hWnd);\n\n\t\/\/TODO: Add your drawing code here\n\n\treturn 0;\n}\n\nLRESULT CTasksView::OnListChanged(UINT \/*uMsg*\/, WPARAM wParam, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tOutputDebugString(utf::widen(std::to_string((UINT_PTR) m_hWnd) + \": OnListChanged(\" +std::to_string(wParam) + \")\\n\").c_str());\n\n\t\/\/ TODO: lock updates\n\tif (wParam) { \n\t\t\/\/ a server has been added or removed...\n\t\tauto it = find(wParam);\n\t\tif (it == m_servers.end()) { \/\/ it was added\n\t\t\tsynchronize(*m_model, [&] {\n\t\t\t\tauto& servers = m_model->servers();\n\t\t\t\t\/\/ find the location of the ID; hint: it might be at the end\n\t\t\t\tauto rit = std::find_if(std::rbegin(servers), std::rend(servers), [&](const std::shared_ptr<jira::server>& server) { return server->sessionId() == wParam; });\n\t\t\t\tif (rit != std::rend(servers)) {\n\t\t\t\t\tauto it = std::begin(m_servers);\n\n\t\t\t\t\t\/\/ it += (rit.base() - servers.begin())\n\t\t\t\t\t std::advance(it, std::distance(std::begin(servers), rit.base()));\n\n\t\t\t\t\t insert(it, *rit);\n\t\t\t\t}\n\t\t\t});\n\t\t} else\n\t\t\terase(it);\n\t} else {\n\t\t\/\/ no specific item has changed, go over entire model\n\t\tsynchronize(*m_model, [&] {\n\t\t\tauto& servers = m_model->servers();\n\n\t\t\tauto it = std::begin(m_servers);\n\t\t\tauto end = std::end(m_servers);\n\n\t\t\t\/\/ for each ServerInfo: if not in model - remove\n\t\t\twhile (it != end) {\n\t\t\t\tauto query = std::find_if(std::begin(servers), std::end(servers), [&](const std::shared_ptr<jira::server>& srv) { return srv->sessionId() == it->m_sessionId; });\n\t\t\t\tif (query == std::end(servers))\n\t\t\t\t{\n\t\t\t\t\tit = erase(it);\n\t\t\t\t\tend = std::end(m_servers);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ for each server in model: if not in ServerInfos - add\n\t\t\t\/\/ side note: we have only items from the model, granted maybe not the ALL items\n\t\t\t\/\/ if we kept track of additions\/deletions, they are in the same order as in the model\n\t\t\t\/\/ we just need to fill in the holes...\n\n\t\t\tit = std::begin(m_servers);\n\t\t\tend = std::end(m_servers);\n\t\t\tauto srv_it = std::begin(servers);\n\t\t\tauto srv_end = std::end(servers);\n\n\t\t\tfor (; srv_it != srv_end; ++srv_it) {\n\t\t\t\tif (it != end && (*srv_it)->sessionId() == it->m_sessionId) {\n\t\t\t\t\t++it;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tit = insert(it, *srv_it); \/\/ fill in blanks...\n\t\t\t\tend = std::end(m_servers);\n\t\t\t}\n\t\t});\n\t}\n\t\/\/ TODO: unlock updates\n\n\treturn 0;\n}\n\nLRESULT CTasksView::OnRefreshStart(UINT \/*uMsg*\/, WPARAM wParam, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tOutputDebugString(utf::widen(std::to_string((UINT_PTR) m_hWnd) + \": OnRefreshStart(\" + std::to_string(wParam) + \")\\n\").c_str());\n\treturn 0;\n}\n\nLRESULT CTasksView::OnRefreshStop(UINT \/*uMsg*\/, WPARAM wParam, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tOutputDebugString(utf::widen(std::to_string((UINT_PTR) m_hWnd) + \": OnRefreshStop(\" + std::to_string(wParam) + \")\\n\").c_str());\n\n\tauto it = find(wParam);\n\tif (it == m_servers.end())\n\t\treturn 0;\n\n\tauto& server = *it->m_server;\n\tit->m_dataset = server.dataset();\n\t\/\/ TODO: update layout\n\t\/\/ TODO: redraw the report table\n\n\tauto& dataset = *it->m_dataset;\n\tstd::ostringstream o;\n\to << \"-----------------------------------------------\\n\"\n\t\t<< \"Answer from: \" << server.login() << \" @ \" << server.displayName() << \"\\n\"\n\t\t<< \"Query: \" << (server.view().jql().empty() ? jira::search_def::standard.jql() : server.view().jql()) << \"\\n\";\n\tOutputDebugString(utf::widen(o.str()).c_str()); o.str(\"\");\n\to << \"Issues \" << (dataset.startAt + 1)\n\t\t<< '-' << (dataset.startAt + dataset.data.size())\n\t\t<< \" of \" << dataset.total << \":\\n\";\n\tOutputDebugString(utf::widen(o.str()).c_str()); o.str(\"\");\n\n\t{\n\t\to << \"\\n\";\n\t\tbool first = true;\n\t\tfor (auto& col : dataset.schema.cols()) {\n\t\t\tif (first) first = false;\n\t\t\telse o << \" | \";\n\t\t\to << col->titleFull();\n\t\t}\n\t\to << \"\\n-----------------------------------------------------------------------\\n\";\n\t\tOutputDebugString(utf::widen(o.str()).c_str()); o.str(\"\");\n\t}\n\n\tfor (auto&& row : dataset.data)\n\t\tOutputDebugString(utf::widen(row.text(\" | \") + \"\\n\").c_str());\n\n\treturn 0;\n}\n<commit_msg>Dummy notification something is happening<commit_after>\/\/ TasksView.cpp : implementation of the CTasksView class\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"stdafx.h\"\n#include \"resource.h\"\n\n#include \"TasksView.h\"\n#include <net\/utf8.hpp>\n#include <algorithm>\n#include <sstream>\n\nclass TaskViewModelListener : public CAppModelListener {\n\tHWND m_hWnd;\npublic:\n\tTaskViewModelListener(HWND hWnd) : m_hWnd(hWnd) {}\n\n\tvoid onListChanged(uint32_t addedOrRemoved) override\n\t{\n\t\t\/\/ traversing the borders of threads, if needed\n\t\t\/\/ also, the actual reaction to the vent will\n\t\t\/\/ not block the emit up there\n\t\tif (IsWindow(m_hWnd))\n\t\t\tPostMessage(m_hWnd, UM_LISTCHANGED, addedOrRemoved, 0);\n\t}\n};\n\nclass ServerListener : public jira::server_listener {\n\tHWND m_hWnd;\n\tuint32_t m_sessionId;\npublic:\n\tServerListener(HWND hWnd, uint32_t sessionId) : m_hWnd(hWnd), m_sessionId(sessionId) {}\n\n\tvoid onRefreshStarted() override\n\t{\n\t\tif (IsWindow(m_hWnd))\n\t\t\tPostMessage(m_hWnd, UM_REFRESHSTART, m_sessionId, 0);\n\t}\n\n\tvoid onRefreshFinished() override\n\t{\n\t\tif (IsWindow(m_hWnd))\n\t\t\tPostMessage(m_hWnd, UM_REFRESHSTOP, m_sessionId, 0);\n\t}\n};\n\nstd::vector<CTasksView::ServerInfo>::iterator CTasksView::find(uint32_t sessionId)\n{\n\treturn std::find_if(std::begin(m_servers), std::end(m_servers), [sessionId](const ServerInfo& info) { return info.m_sessionId == sessionId; });\n}\n\nstd::vector<CTasksView::ServerInfo>::iterator CTasksView::insert(std::vector<ServerInfo>::const_iterator it, const std::shared_ptr<jira::server>& server)\n{\n\t\/\/ TODO: create UI element\n\t\/\/ TDOD: attach refresh listener to the server\n\tauto listener = std::make_shared<ServerListener>(m_hWnd, server->sessionId());\n\treturn m_servers.emplace(it, server, listener);\n}\n\nstd::vector<CTasksView::ServerInfo>::iterator CTasksView::erase(std::vector<ServerInfo>::const_iterator it)\n{\n\t\/\/ TODO: destroy UI element\n\t\/\/ TDOD: detach refresh listener from the server\n\treturn m_servers.erase(it);\n}\n\n\nBOOL CTasksView::PreTranslateMessage(MSG* pMsg)\n{\n\tpMsg;\n\treturn FALSE;\n}\n\nLRESULT CTasksView::OnCreate(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tm_listener = std::make_shared<TaskViewModelListener>(m_hWnd);\n\tm_model->registerListener(m_listener);\n\treturn 0;\n}\n\nLRESULT CTasksView::OnDestroy(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tm_model->unregisterListener(m_listener);\n\treturn 0;\n}\n\nLRESULT CTasksView::OnPaint(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tCPaintDC dc(m_hWnd);\n\n\t\/\/TODO: Add your drawing code here\n\n\treturn 0;\n}\n\nLRESULT CTasksView::OnListChanged(UINT \/*uMsg*\/, WPARAM wParam, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tOutputDebugString(utf::widen(std::to_string((UINT_PTR) m_hWnd) + \": OnListChanged(\" +std::to_string(wParam) + \")\\n\").c_str());\n\n\t\/\/ TODO: lock updates\n\tif (wParam) { \n\t\t\/\/ a server has been added or removed...\n\t\tauto it = find(wParam);\n\t\tif (it == m_servers.end()) { \/\/ it was added\n\t\t\tsynchronize(*m_model, [&] {\n\t\t\t\tauto& servers = m_model->servers();\n\t\t\t\t\/\/ find the location of the ID; hint: it might be at the end\n\t\t\t\tauto rit = std::find_if(std::rbegin(servers), std::rend(servers), [&](const std::shared_ptr<jira::server>& server) { return server->sessionId() == wParam; });\n\t\t\t\tif (rit != std::rend(servers)) {\n\t\t\t\t\tauto it = std::begin(m_servers);\n\n\t\t\t\t\t\/\/ it += (rit.base() - servers.begin())\n\t\t\t\t\t std::advance(it, std::distance(std::begin(servers), rit.base()));\n\n\t\t\t\t\t insert(it, *rit);\n\t\t\t\t}\n\t\t\t});\n\t\t} else\n\t\t\terase(it);\n\t} else {\n\t\t\/\/ no specific item has changed, go over entire model\n\t\tsynchronize(*m_model, [&] {\n\t\t\tauto& servers = m_model->servers();\n\n\t\t\tauto it = std::begin(m_servers);\n\t\t\tauto end = std::end(m_servers);\n\n\t\t\t\/\/ for each ServerInfo: if not in model - remove\n\t\t\twhile (it != end) {\n\t\t\t\tauto query = std::find_if(std::begin(servers), std::end(servers), [&](const std::shared_ptr<jira::server>& srv) { return srv->sessionId() == it->m_sessionId; });\n\t\t\t\tif (query == std::end(servers))\n\t\t\t\t{\n\t\t\t\t\tit = erase(it);\n\t\t\t\t\tend = std::end(m_servers);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ for each server in model: if not in ServerInfos - add\n\t\t\t\/\/ side note: we have only items from the model, granted maybe not the ALL items\n\t\t\t\/\/ if we kept track of additions\/deletions, they are in the same order as in the model\n\t\t\t\/\/ we just need to fill in the holes...\n\n\t\t\tit = std::begin(m_servers);\n\t\t\tend = std::end(m_servers);\n\t\t\tauto srv_it = std::begin(servers);\n\t\t\tauto srv_end = std::end(servers);\n\n\t\t\tfor (; srv_it != srv_end; ++srv_it) {\n\t\t\t\tif (it != end && (*srv_it)->sessionId() == it->m_sessionId) {\n\t\t\t\t\t++it;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tit = insert(it, *srv_it); \/\/ fill in blanks...\n\t\t\t\tend = std::end(m_servers);\n\t\t\t}\n\t\t});\n\t}\n\t\/\/ TODO: unlock updates\n\n\treturn 0;\n}\n\nLRESULT CTasksView::OnRefreshStart(UINT \/*uMsg*\/, WPARAM wParam, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tOutputDebugString(utf::widen(std::to_string((UINT_PTR) m_hWnd) + \": OnRefreshStart(\" + std::to_string(wParam) + \")\\n\").c_str());\n\tTCHAR szWindowName[260] = { 0 };\n\t::LoadString(ModuleHelper::GetResourceInstance(), IDR_MAINFRAME, szWindowName, sizeof(szWindowName) \/ sizeof(szWindowName[0]));\n\n\tGetParent().SetWindowText((std::wstring{szWindowName} + L\" - Loading...\").c_str());\n\treturn 0;\n}\n\nLRESULT CTasksView::OnRefreshStop(UINT \/*uMsg*\/, WPARAM wParam, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n\tOutputDebugString(utf::widen(std::to_string((UINT_PTR) m_hWnd) + \": OnRefreshStop(\" + std::to_string(wParam) + \")\\n\").c_str());\n\tTCHAR szWindowName[260] = { 0 };\n\t::LoadString(ModuleHelper::GetResourceInstance(), IDR_MAINFRAME, szWindowName, sizeof(szWindowName) \/ sizeof(szWindowName[0]));\n\n\tGetParent().SetWindowText(szWindowName);\n\n\tauto it = find(wParam);\n\tif (it == m_servers.end())\n\t\treturn 0;\n\n\tauto& server = *it->m_server;\n\tit->m_dataset = server.dataset();\n\t\/\/ TODO: update layout\n\t\/\/ TODO: redraw the report table\n\n\tauto& dataset = *it->m_dataset;\n\tstd::ostringstream o;\n\to << \"-----------------------------------------------\\n\"\n\t\t<< \"Answer from: \" << server.login() << \" @ \" << server.displayName() << \"\\n\"\n\t\t<< \"Query: \" << (server.view().jql().empty() ? jira::search_def::standard.jql() : server.view().jql()) << \"\\n\";\n\tOutputDebugString(utf::widen(o.str()).c_str()); o.str(\"\");\n\to << \"Issues \" << (dataset.startAt + 1)\n\t\t<< '-' << (dataset.startAt + dataset.data.size())\n\t\t<< \" of \" << dataset.total << \":\\n\";\n\tOutputDebugString(utf::widen(o.str()).c_str()); o.str(\"\");\n\n\t{\n\t\to << \"\\n\";\n\t\tbool first = true;\n\t\tfor (auto& col : dataset.schema.cols()) {\n\t\t\tif (first) first = false;\n\t\t\telse o << \" | \";\n\t\t\to << col->titleFull();\n\t\t}\n\t\to << \"\\n-----------------------------------------------------------------------\\n\";\n\t\tOutputDebugString(utf::widen(o.str()).c_str()); o.str(\"\");\n\t}\n\n\tfor (auto&& row : dataset.data)\n\t\tOutputDebugString(utf::widen(row.text(\" | \") + \"\\n\").c_str());\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fix compilation in studio_app.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 1999 by Andrew Zabolotny\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 <stdio.h>\n\n#define CS_SYSDEF_PROVIDE_PATH\n#define CS_SYSDEF_PROVIDE_GETOPT\n#include \"cssysdef.h\"\n#include \"cssys\/csshlib.h\"\n#include \"csutil\/scf.h\"\n#include \"csutil\/cfgfile.h\"\n\nCS_IMPLEMENT_APPLICATION\n\nchar *programversion = \"3\";\nchar *programname;\n\nstatic struct option long_options[] =\n{\n  {\"help\", no_argument, 0, 'h'},\n  {\"register\", no_argument, 0, 'r'},\n  {\"unregister\", no_argument, 0, 'u'},\n  {\"version\", no_argument, 0, 'V'},\n  {\"verbose\", no_argument, 0, 'v'},\n  {0, no_argument, 0, 0}\n};\n\nstatic int display_help ()\n{\n  printf (\"Crystal Space SCF object registration utility v%s\\n\", programversion);\n  printf (\"Copyright (C) 1999 by Andrew Zabolotny <bit@eltech.ru>\\n\\n\");\n  printf (\"Usage: %s {option\/s} [plug-in module] [...]\\n\\n\", programname);\n  printf (\"By default the program will register the SCF components contained\\n\");\n  printf (\"in the plug-in module passed on command line. Registration occurs\\n\" );\n  printf (\"in the SCF registration file scf.cfg.\\n\\n\");\n  printf (\"  -r   --register    Register SCF components contained in file #\\n\");\n  printf (\"  -u   --unregister  Unregister SCF components contained in file #\\n\");\n  printf (\"  -h   --help        Display this help text\\n\");\n  printf (\"  -v   --verbose     Comment on what's happening\\n\");\n  printf (\"  -V   --version     Display program version\\n\");\n  return 1;\n}\n\nstatic bool verbose = false;\n\nstatic bool RegisterServer (char *SharedLibraryFilename, csConfigFile &cfg,\n  bool Register)\n{\n  static bool DisplayedHeader = false;\n  if (!DisplayedHeader && !verbose)\n  {\n    DisplayedHeader = true;\n    printf (\"Library | Class ID                     | Description\\n\");\n    printf (\"--------+------------------------------+---------------------------------------\\n\");\n  }\n\n  if (verbose)\n  {\n    printf (\"Loading shared library %s ...\", SharedLibraryFilename);\n    fflush (stdout);\n  } \/* endif *\/\n\n  char name [200], base [200], filename[200];\n  char *tmp, *tmp2;\n\n  \/\/ copy file name\n  strcpy (filename, SharedLibraryFilename);\n\n  \/\/ find beginning of base file name\n  tmp = filename + strlen (filename);\n  while ((tmp > filename)\n      && (tmp [-1] != '\/')\n      && (tmp [-1] != PATH_SEPARATOR))\n    tmp--;\n  if ((tmp [0] == 'l')\n   && (tmp [1] == 'i')\n   && (tmp [2] == 'b'))\n    tmp += 3;\n\n  \/\/ remove extension\n  if ((tmp2 = strchr (tmp, '.')))\n    *tmp2 = 0;\n\n  \/\/ copy base file name and compute SCF function name\n  strcpy (base, tmp);\n  strcpy (name, base);\n  strcat (name, \"_scfInitialize\");\n\n  csLibraryHandle Handle = csFindLoadLibrary (filename);\n  if (!Handle)\n    Handle = csLoadLibrary (filename);\n\n  if (!Handle)\n  {\n    if (verbose)\n      printf (\" FAILED\\n\");\n    else\n      printf (\"ERROR: Failed to load library \\\"%s\\\"\\n\", SharedLibraryFilename);\n    fflush (stdout);\n    return false;\n  } \/* endif *\/\n\n  if (verbose)\n  {\n    printf (\"OK, handle = %08X\\n\", (int)Handle);\n    fflush (stdout);\n  } \/* endif *\/\n\n  if (verbose)\n  {\n    printf (\"Looking for \\\"%s\\\" entry ...\", name);\n    fflush (stdout);\n  } \/* endif *\/\n\n  \/\/ This is the prototype for the only function that\n  \/\/ a shared library should export\n  typedef scfClassInfo *(*scfInitializeFunc) (iSCF*);\n  scfInitializeFunc func = (scfInitializeFunc)csGetLibrarySymbol (Handle, name);\n  if (!func)\n  {\n    if (verbose)\n      printf (\" FAILED\\n\");\n    else\n      printf (\"ERROR: Failed to find entry \\\"%s\\\" in library \\\"%s\\\"\\n\", name, SharedLibraryFilename);\n    fflush (stdout);\n    return false;\n  } \/* endif *\/\n\n  if (verbose)\n  {\n    printf (\"OK, address = %08lX\\n\", (unsigned long)func);\n    fflush (stdout);\n  } \/* endif *\/\n\n  scfClassInfo *ClassTable = func (NULL);\n  while (ClassTable->ClassID)\n  {\n    if (verbose)\n      printf (\"Library:      %s\\nClassID:      %s\\nDescription:  %s\\nDependencies: %s\\n\",\n        SharedLibraryFilename, ClassTable->ClassID, ClassTable->Description,\n        ClassTable->Dependencies ? ClassTable->Dependencies : \"<none>\");\n    else\n    {\n      char lib [8+1], cls [30+1], desc [39+1];\n      strncpy (lib, base, sizeof (lib) - 1);\n      lib [sizeof (lib) - 1] = 0;\n      strncpy (cls, ClassTable->ClassID, sizeof (cls) - 1);\n      cls [sizeof (cls) - 1] = 0;\n      strncpy (desc, ClassTable->Description, sizeof (desc) - 1);\n      desc [sizeof (desc) - 1] = 0;\n\n      printf (\"%-8s|%-30s|%s\\n\", lib, cls, desc);\n    }\n\n    if (Register)\n    {\n      char text [1000];\n      bool AddComment = !cfg.KeyExists (ClassTable->ClassID);\n      strcpy (text, filename);\n      if (ClassTable->Dependencies)\n      {\n        strcat (text, \":\");\n        strcat (text, ClassTable->Dependencies);\n      }\n      cfg.SetStr (ClassTable->ClassID, text);\n      if (AddComment)\n        cfg.SetComment (ClassTable->ClassID, ClassTable->Description);\n    }\n    else\n      cfg.DeleteKey (ClassTable->ClassID);\n    ClassTable++;\n  }\n\n  if (verbose)\n  {\n    printf (\"Unloading library \\\"%s\\\"...\", SharedLibraryFilename);\n    fflush (stdout);\n  }\n\n  if (!csUnloadLibrary (Handle))\n  {\n    if (verbose)\n      printf (\" FAILED\\n\");\n    else\n      printf (\"WARNING: Unable to unload library \\\"%s\\\"!\\n\", SharedLibraryFilename);\n  }\n  else if (verbose)\n    printf (\"OK\\n\");\n\n  if (verbose)\n    printf (\"Library \\\"%s\\\" %sregistered.\\n\", SharedLibraryFilename,\n      Register ? \"\" : \"de\");\n  fflush (stdout);\n  return true;\n}\n\nint main (int argc, char *argv[])\n{\n#if defined (__EMX__)\t\/\/ Expand wildcards on OS\/2+GCC+EMX\n  _wildcard (&argc, &argv);\n#endif\n\n  int operation = 1;\n  programname = argv [0];\n\n#ifndef COMP_BC\n  int c;\n  while ((c = getopt_long (argc, argv, \"ruhvV\", long_options, NULL)) != EOF)\n    switch (c)\n    {\n      case '?':\n        \/\/ unknown option\n        return -1;\n      case 'r':\n        operation = 1;\n        break;\n      case 'u':\n        operation = 2;\n        break;\n      case 'h':\n        return display_help ();\n      case 'v':\n        verbose = true;\n        break;\n      case 'V':\n        printf (\"%s version %s\\n\\n\", programname, programversion);\n        printf (\"This program is distributed in the hope that it will be useful,\\n\");\n        printf (\"but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\");\n        printf (\"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\");\n        printf (\"GNU Library General Public License for more details.\\n\");\n        return 0;\n    } \/* endswitch *\/\n#else\n  int optind=1;\n#endif\n\n  csConfigFile cfg (\"scf.cfg\");\n\n  \/\/ Interpret the non-option arguments as file names\n  bool did_something = false;\n  for (; optind < argc; ++optind)\n    switch (operation)\n    {\n      case 1:\n        did_something = true;\n        RegisterServer (argv [optind], cfg, true);\n        break;\n      case 2:\n        did_something = true;\n        RegisterServer (argv [optind], cfg, false);\n        break;\n    } \/* endswitch *\/\n\n  if (!did_something)\n    return display_help ();\n\n  cfg.Save (\"scf.cfg\");\n\n  return 0;\n}\n<commit_msg>reverted my latest change to scfreg<commit_after>\/*\n    Copyright (C) 1999 by Andrew Zabolotny\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 <stdio.h>\n\n#define CS_SYSDEF_PROVIDE_PATH\n#define CS_SYSDEF_PROVIDE_GETOPT\n#include \"cssysdef.h\"\n#include \"cssys\/csshlib.h\"\n#include \"csutil\/scf.h\"\n#include \"csutil\/cfgfile.h\"\n\nCS_IMPLEMENT_APPLICATION\n\nchar *programversion = \"3\";\nchar *programname;\n\nstatic struct option long_options[] =\n{\n  {\"help\", no_argument, 0, 'h'},\n  {\"register\", no_argument, 0, 'r'},\n  {\"unregister\", no_argument, 0, 'u'},\n  {\"version\", no_argument, 0, 'V'},\n  {\"verbose\", no_argument, 0, 'v'},\n  {0, no_argument, 0, 0}\n};\n\nstatic int display_help ()\n{\n  printf (\"Crystal Space SCF object registration utility v%s\\n\", programversion);\n  printf (\"Copyright (C) 1999 by Andrew Zabolotny <bit@eltech.ru>\\n\\n\");\n  printf (\"Usage: %s {option\/s} [plug-in module] [...]\\n\\n\", programname);\n  printf (\"By default the program will register the SCF components contained\\n\");\n  printf (\"in the plug-in module passed on command line. Registration occurs\\n\" );\n  printf (\"in the SCF registration file scf.cfg.\\n\\n\");\n  printf (\"  -r   --register    Register SCF components contained in file #\\n\");\n  printf (\"  -u   --unregister  Unregister SCF components contained in file #\\n\");\n  printf (\"  -h   --help        Display this help text\\n\");\n  printf (\"  -v   --verbose     Comment on what's happening\\n\");\n  printf (\"  -V   --version     Display program version\\n\");\n  return 1;\n}\n\nstatic bool verbose = false;\n\nstatic bool RegisterServer (char *SharedLibraryFilename, csConfigFile &cfg,\n  bool Register)\n{\n  static bool DisplayedHeader = false;\n  if (!DisplayedHeader && !verbose)\n  {\n    DisplayedHeader = true;\n    printf (\"Library | Class ID                     | Description\\n\");\n    printf (\"--------+------------------------------+---------------------------------------\\n\");\n  }\n\n  if (verbose)\n  {\n    printf (\"Loading shared library %s ...\", SharedLibraryFilename);\n    fflush (stdout);\n  } \/* endif *\/\n\n  char name [200], base [200];\n  char *tmp = SharedLibraryFilename + strlen (SharedLibraryFilename);\n  while ((tmp > SharedLibraryFilename)\n      && (tmp [-1] != '\/')\n      && (tmp [-1] != PATH_SEPARATOR))\n    tmp--;\n\n  if ((tmp [0] == 'l')\n   && (tmp [1] == 'i')\n   && (tmp [2] == 'b'))\n    tmp += 3;\n  strcpy (base, tmp);\n  if ((tmp = strchr (base, '.')))\n    *tmp = 0;\n  strcpy (name, base);\n  strcat (name, \"_scfInitialize\");\n\n  csLibraryHandle Handle = csFindLoadLibrary (base);\n  if (!Handle)\n    Handle = csLoadLibrary (base);\n\n  if (!Handle)\n  {\n    if (verbose)\n      printf (\" FAILED\\n\");\n    else\n      printf (\"ERROR: Failed to load library \\\"%s\\\"\\n\", SharedLibraryFilename);\n    fflush (stdout);\n    return false;\n  } \/* endif *\/\n\n  if (verbose)\n  {\n    printf (\"OK, handle = %08X\\n\", (int)Handle);\n    fflush (stdout);\n  } \/* endif *\/\n\n  if (verbose)\n  {\n    printf (\"Looking for \\\"%s\\\" entry ...\", name);\n    fflush (stdout);\n  } \/* endif *\/\n\n  \/\/ This is the prototype for the only function that\n  \/\/ a shared library should export\n  typedef scfClassInfo *(*scfInitializeFunc) (iSCF*);\n  scfInitializeFunc func = (scfInitializeFunc)csGetLibrarySymbol (Handle, name);\n  if (!func)\n  {\n    if (verbose)\n      printf (\" FAILED\\n\");\n    else\n      printf (\"ERROR: Failed to find entry \\\"%s\\\" in library \\\"%s\\\"\\n\", name, SharedLibraryFilename);\n    fflush (stdout);\n    return false;\n  } \/* endif *\/\n\n  if (verbose)\n  {\n    printf (\"OK, address = %08lX\\n\", (unsigned long)func);\n    fflush (stdout);\n  } \/* endif *\/\n\n  scfClassInfo *ClassTable = func (NULL);\n  while (ClassTable->ClassID)\n  {\n    if (verbose)\n      printf (\"Library:      %s\\nClassID:      %s\\nDescription:  %s\\nDependencies: %s\\n\",\n        SharedLibraryFilename, ClassTable->ClassID, ClassTable->Description,\n        ClassTable->Dependencies ? ClassTable->Dependencies : \"<none>\");\n    else\n    {\n      char lib [8+1], cls [30+1], desc [39+1];\n      strncpy (lib, base, sizeof (lib) - 1);\n      lib [sizeof (lib) - 1] = 0;\n      strncpy (cls, ClassTable->ClassID, sizeof (cls) - 1);\n      cls [sizeof (cls) - 1] = 0;\n      strncpy (desc, ClassTable->Description, sizeof (desc) - 1);\n      desc [sizeof (desc) - 1] = 0;\n\n      printf (\"%-8s|%-30s|%s\\n\", lib, cls, desc);\n    }\n\n    if (Register)\n    {\n      char text [1000];\n      bool AddComment = !cfg.KeyExists (ClassTable->ClassID);\n      strcpy (text, base);\n      if (ClassTable->Dependencies)\n      {\n        strcat (text, \":\");\n        strcat (text, ClassTable->Dependencies);\n      }\n      cfg.SetStr (ClassTable->ClassID, text);\n      if (AddComment)\n        cfg.SetComment (ClassTable->ClassID, ClassTable->Description);\n    }\n    else\n      cfg.DeleteKey (ClassTable->ClassID);\n    ClassTable++;\n  }\n\n  if (verbose)\n  {\n    printf (\"Unloading library \\\"%s\\\"...\", SharedLibraryFilename);\n    fflush (stdout);\n  }\n\n  if (!csUnloadLibrary (Handle))\n  {\n    if (verbose)\n      printf (\" FAILED\\n\");\n    else\n      printf (\"WARNING: Unable to unload library \\\"%s\\\"!\\n\", SharedLibraryFilename);\n  }\n  else if (verbose)\n    printf (\"OK\\n\");\n\n  if (verbose)\n    printf (\"Library \\\"%s\\\" %sregistered.\\n\", SharedLibraryFilename,\n      Register ? \"\" : \"de\");\n  fflush (stdout);\n  return true;\n}\n\nint main (int argc, char *argv[])\n{\n#if defined (__EMX__)\t\/\/ Expand wildcards on OS\/2+GCC+EMX\n  _wildcard (&argc, &argv);\n#endif\n\n  int operation = 1;\n  programname = argv [0];\n\n#ifndef COMP_BC\n  int c;\n  while ((c = getopt_long (argc, argv, \"ruhvV\", long_options, NULL)) != EOF)\n    switch (c)\n    {\n      case '?':\n        \/\/ unknown option\n        return -1;\n      case 'r':\n        operation = 1;\n        break;\n      case 'u':\n        operation = 2;\n        break;\n      case 'h':\n        return display_help ();\n      case 'v':\n        verbose = true;\n        break;\n      case 'V':\n        printf (\"%s version %s\\n\\n\", programname, programversion);\n        printf (\"This program is distributed in the hope that it will be useful,\\n\");\n        printf (\"but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\");\n        printf (\"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\");\n        printf (\"GNU Library General Public License for more details.\\n\");\n        return 0;\n    } \/* endswitch *\/\n#else\n  int optind=1;\n#endif\n\n  csConfigFile cfg (\"scf.cfg\");\n\n  \/\/ Interpret the non-option arguments as file names\n  bool did_something = false;\n  for (; optind < argc; ++optind)\n    switch (operation)\n    {\n      case 1:\n        did_something = true;\n        RegisterServer (argv [optind], cfg, true);\n        break;\n      case 2:\n        did_something = true;\n        RegisterServer (argv [optind], cfg, false);\n        break;\n    } \/* endswitch *\/\n\n  if (!did_something)\n    return display_help ();\n\n  cfg.Save (\"scf.cfg\");\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"hg.h\"\n#include \"lazy.h\"\n#include \"fdict.h\"\n#include \"tdict.h\"\n\n#include \"lm\/enumerate_vocab.hh\"\n#include \"lm\/model.hh\"\n#include \"search\/config.hh\"\n#include \"search\/context.hh\"\n#include \"search\/edge.hh\"\n#include \"search\/edge_queue.hh\"\n#include \"search\/vertex.hh\"\n#include \"search\/vertex_generator.hh\"\n#include \"util\/exception.hh\"\n\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/scoped_array.hpp>\n\n#include <iostream>\n#include <vector>\n\nnamespace {\n\nstruct MapVocab : public lm::EnumerateVocab {\n  public:\n    MapVocab() {}\n\n    \/\/ Do not call after Lookup.  \n    void Add(lm::WordIndex index, const StringPiece &str) {\n      const WordID cdec_id = TD::Convert(str.as_string());\n      if (cdec_id >= out_.size()) out_.resize(cdec_id + 1);\n      out_[cdec_id] = index;\n    }\n\n    \/\/ Assumes Add has been called and will never be called again.  \n    lm::WordIndex FromCDec(WordID id) const {\n      return out_[out_.size() > id ? id : 0];\n    }\n\n  private:\n    std::vector<lm::WordIndex> out_;\n};\n\nclass LazyBase {\n  public:\n    LazyBase(const std::vector<weight_t> &weights) : \n      cdec_weights_(weights),\n      weights_(weights[FD::Convert(\"KLanguageModel\")], weights[FD::Convert(\"KLanguageModel_OOV\")], weights[FD::Convert(\"WordPenalty\")]) {\n      std::cerr << \"Weights KLanguageModel \" << weights_.LM() << \" KLanguageModel_OOV \" << weights_.OOV() << \" WordPenalty \" << weights_.WordPenalty() << std::endl;\n    }\n\n    virtual ~LazyBase() {}\n\n    virtual void Search(unsigned int pop_limit, const Hypergraph &hg) const = 0;\n\n    static LazyBase *Load(const char *model_file, const std::vector<weight_t> &weights);\n\n  protected:\n    lm::ngram::Config GetConfig() {\n      lm::ngram::Config ret;\n      ret.enumerate_vocab = &vocab_;\n      return ret;\n    }\n\n    MapVocab vocab_;\n\n    const std::vector<weight_t> &cdec_weights_;\n\n    const search::Weights weights_;\n};\n\ntemplate <class Model> class Lazy : public LazyBase {\n  public:\n    Lazy(const char *model_file, const std::vector<weight_t> &weights) : LazyBase(weights), m_(model_file, GetConfig()) {}\n\n    void Search(unsigned int pop_limit, const Hypergraph &hg) const;\n\n  private:\n    unsigned char ConvertEdge(const search::Context<Model> &context, bool final, search::Vertex *vertices, const Hypergraph::Edge &in, search::PartialEdge &out) const;\n\n    const Model m_;\n};\n\nLazyBase *LazyBase::Load(const char *model_file, const std::vector<weight_t> &weights) {\n  lm::ngram::ModelType model_type;\n  if (!lm::ngram::RecognizeBinary(model_file, model_type)) model_type = lm::ngram::PROBING;\n  switch (model_type) {\n    case lm::ngram::PROBING:\n      return new Lazy<lm::ngram::ProbingModel>(model_file, weights);\n    case lm::ngram::REST_PROBING:\n      return new Lazy<lm::ngram::RestProbingModel>(model_file, weights);\n    default:\n      UTIL_THROW(util::Exception, \"Sorry this lm type isn't supported yet.\");\n  }\n}\n\nvoid PrintFinal(const Hypergraph &hg, const search::Final &final) {\n  const std::vector<WordID> &words = static_cast<const Hypergraph::Edge*>(final.GetNote().vp)->rule_->e();\n  boost::array<const search::Final*, search::kMaxArity>::const_iterator child(final.Children().begin());\n  for (std::vector<WordID>::const_iterator i = words.begin(); i != words.end(); ++i) {\n    if (*i > 0) {\n      std::cout << TD::Convert(*i) << ' ';\n    } else {\n      PrintFinal(hg, **child++);\n    }\n  }\n}\n\ntemplate <class Model> void Lazy<Model>::Search(unsigned int pop_limit, const Hypergraph &hg) const {\n  boost::scoped_array<search::Vertex> out_vertices(new search::Vertex[hg.nodes_.size()]);\n  search::Config config(weights_, pop_limit);\n  search::Context<Model> context(config, m_);\n\n  for (unsigned int i = 0; i < hg.nodes_.size() - 1; ++i) {\n    search::EdgeQueue queue(context.PopLimit());\n    const Hypergraph::EdgesVector &down_edges = hg.nodes_[i].in_edges_;\n    for (unsigned int j = 0; j < down_edges.size(); ++j) {\n      unsigned int edge_index = down_edges[j];\n      unsigned char arity = ConvertEdge(context, i == hg.nodes_.size() - 2, out_vertices.get(), hg.edges_[edge_index], queue.InitializeEdge());\n      search::Note note;\n      note.vp = &hg.edges_[edge_index];\n      if (arity != 255) queue.AddEdge(arity, note);\n    }\n    search::VertexGenerator vertex_gen(context, out_vertices[i]);\n    queue.Search(context, vertex_gen);\n  }\n  const search::Final *top = out_vertices[hg.nodes_.size() - 2].BestChild();\n  if (!top) {\n    std::cout << \"NO PATH FOUND\" << std::endl;\n  } else {\n    PrintFinal(hg, *top);\n    std::cout << \"||| \" << top->Bound() << std::endl;\n  }\n}\n\ntemplate <class Model> unsigned char Lazy<Model>::ConvertEdge(const search::Context<Model> &context, bool final, search::Vertex *vertices, const Hypergraph::Edge &in, search::PartialEdge &out) const {\n  const std::vector<WordID> &e = in.rule_->e();\n  std::vector<lm::WordIndex> words;\n  unsigned int terminals = 0;\n  unsigned char nt = 0;\n  for (std::vector<WordID>::const_iterator word = e.begin(); word != e.end(); ++word) {\n    if (*word <= 0) {\n      out.nt[nt] = vertices[in.tail_nodes_[-*word]].RootPartial();\n      if (out.nt[nt].Empty()) return 255;\n      ++nt;\n      words.push_back(lm::kMaxWordIndex);\n    } else {\n      ++terminals;\n      words.push_back(vocab_.FromCDec(*word));\n    }\n  }\n  for (unsigned char fill = nt; fill < search::kMaxArity; ++fill) {\n    out.nt[nt] = search::kBlankPartialVertex;\n  }\n\n  if (final) {\n    words.push_back(m_.GetVocabulary().EndSentence());\n  }\n\n  out.score = in.rule_->GetFeatureValues().dot(cdec_weights_);\n  out.score -= static_cast<float>(terminals) * context.GetWeights().WordPenalty() \/ M_LN10;\n  out.score += search::ScoreRule(context, words, final, out.between);\n  return nt;\n}\n\nboost::scoped_ptr<LazyBase> AwfulGlobalLazy;\n\n} \/\/ namespace\n\nvoid PassToLazy(const char *model_file, const std::vector<weight_t> &weights, unsigned int pop_limit, const Hypergraph &hg) {\n  if (!AwfulGlobalLazy.get()) {\n    std::cerr << \"Pop limit \" << pop_limit << std::endl;\n    AwfulGlobalLazy.reset(LazyBase::Load(model_file, weights));\n  }\n  AwfulGlobalLazy->Search(pop_limit, hg);\n}\n<commit_msg>Fix segfault, accurate decoding<commit_after>#include \"hg.h\"\n#include \"lazy.h\"\n#include \"fdict.h\"\n#include \"tdict.h\"\n\n#include \"lm\/enumerate_vocab.hh\"\n#include \"lm\/model.hh\"\n#include \"search\/config.hh\"\n#include \"search\/context.hh\"\n#include \"search\/edge.hh\"\n#include \"search\/edge_queue.hh\"\n#include \"search\/vertex.hh\"\n#include \"search\/vertex_generator.hh\"\n#include \"util\/exception.hh\"\n\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/scoped_array.hpp>\n\n#include <iostream>\n#include <vector>\n\nnamespace {\n\nstruct MapVocab : public lm::EnumerateVocab {\n  public:\n    MapVocab() {}\n\n    \/\/ Do not call after Lookup.  \n    void Add(lm::WordIndex index, const StringPiece &str) {\n      const WordID cdec_id = TD::Convert(str.as_string());\n      if (cdec_id >= out_.size()) out_.resize(cdec_id + 1);\n      out_[cdec_id] = index;\n    }\n\n    \/\/ Assumes Add has been called and will never be called again.  \n    lm::WordIndex FromCDec(WordID id) const {\n      return out_[out_.size() > id ? id : 0];\n    }\n\n  private:\n    std::vector<lm::WordIndex> out_;\n};\n\nclass LazyBase {\n  public:\n    LazyBase(const std::vector<weight_t> &weights) : \n      cdec_weights_(weights),\n      weights_(weights[FD::Convert(\"KLanguageModel\")], weights[FD::Convert(\"KLanguageModel_OOV\")], weights[FD::Convert(\"WordPenalty\")]) {\n      std::cerr << \"Weights KLanguageModel \" << weights_.LM() << \" KLanguageModel_OOV \" << weights_.OOV() << \" WordPenalty \" << weights_.WordPenalty() << std::endl;\n    }\n\n    virtual ~LazyBase() {}\n\n    virtual void Search(unsigned int pop_limit, const Hypergraph &hg) const = 0;\n\n    static LazyBase *Load(const char *model_file, const std::vector<weight_t> &weights);\n\n  protected:\n    lm::ngram::Config GetConfig() {\n      lm::ngram::Config ret;\n      ret.enumerate_vocab = &vocab_;\n      return ret;\n    }\n\n    MapVocab vocab_;\n\n    const std::vector<weight_t> &cdec_weights_;\n\n    const search::Weights weights_;\n};\n\ntemplate <class Model> class Lazy : public LazyBase {\n  public:\n    Lazy(const char *model_file, const std::vector<weight_t> &weights) : LazyBase(weights), m_(model_file, GetConfig()) {}\n\n    void Search(unsigned int pop_limit, const Hypergraph &hg) const;\n\n  private:\n    unsigned char ConvertEdge(const search::Context<Model> &context, bool final, search::Vertex *vertices, const Hypergraph::Edge &in, search::PartialEdge &out) const;\n\n    const Model m_;\n};\n\nLazyBase *LazyBase::Load(const char *model_file, const std::vector<weight_t> &weights) {\n  lm::ngram::ModelType model_type;\n  if (!lm::ngram::RecognizeBinary(model_file, model_type)) model_type = lm::ngram::PROBING;\n  switch (model_type) {\n    case lm::ngram::PROBING:\n      return new Lazy<lm::ngram::ProbingModel>(model_file, weights);\n    case lm::ngram::REST_PROBING:\n      return new Lazy<lm::ngram::RestProbingModel>(model_file, weights);\n    default:\n      UTIL_THROW(util::Exception, \"Sorry this lm type isn't supported yet.\");\n  }\n}\n\nvoid PrintFinal(const Hypergraph &hg, const search::Final &final) {\n  const std::vector<WordID> &words = static_cast<const Hypergraph::Edge*>(final.GetNote().vp)->rule_->e();\n  boost::array<const search::Final*, search::kMaxArity>::const_iterator child(final.Children().begin());\n  for (std::vector<WordID>::const_iterator i = words.begin(); i != words.end(); ++i) {\n    if (*i > 0) {\n      std::cout << TD::Convert(*i) << ' ';\n    } else {\n      PrintFinal(hg, **child++);\n    }\n  }\n}\n\ntemplate <class Model> void Lazy<Model>::Search(unsigned int pop_limit, const Hypergraph &hg) const {\n  boost::scoped_array<search::Vertex> out_vertices(new search::Vertex[hg.nodes_.size()]);\n  search::Config config(weights_, pop_limit);\n  search::Context<Model> context(config, m_);\n\n  for (unsigned int i = 0; i < hg.nodes_.size() - 1; ++i) {\n    search::EdgeQueue queue(context.PopLimit());\n    const Hypergraph::EdgesVector &down_edges = hg.nodes_[i].in_edges_;\n    for (unsigned int j = 0; j < down_edges.size(); ++j) {\n      unsigned int edge_index = down_edges[j];\n      unsigned char arity = ConvertEdge(context, i == hg.nodes_.size() - 2, out_vertices.get(), hg.edges_[edge_index], queue.InitializeEdge());\n      search::Note note;\n      note.vp = &hg.edges_[edge_index];\n      if (arity != 255) queue.AddEdge(arity, note);\n    }\n    search::VertexGenerator vertex_gen(context, out_vertices[i]);\n    queue.Search(context, vertex_gen);\n  }\n  const search::Final *top = out_vertices[hg.nodes_.size() - 2].BestChild();\n  if (!top) {\n    std::cout << \"NO PATH FOUND\" << std::endl;\n  } else {\n    PrintFinal(hg, *top);\n    std::cout << \"||| \" << top->Bound() << std::endl;\n  }\n}\n\ntemplate <class Model> unsigned char Lazy<Model>::ConvertEdge(const search::Context<Model> &context, bool final, search::Vertex *vertices, const Hypergraph::Edge &in, search::PartialEdge &out) const {\n  const std::vector<WordID> &e = in.rule_->e();\n  std::vector<lm::WordIndex> words;\n  unsigned int terminals = 0;\n  unsigned char nt = 0;\n  out.score = 0.0;\n  for (std::vector<WordID>::const_iterator word = e.begin(); word != e.end(); ++word) {\n    if (*word <= 0) {\n      out.nt[nt] = vertices[in.tail_nodes_[-*word]].RootPartial();\n      if (out.nt[nt].Empty()) return 255;\n      out.score += out.nt[nt].Bound();\n      ++nt;\n      words.push_back(lm::kMaxWordIndex);\n    } else {\n      ++terminals;\n      words.push_back(vocab_.FromCDec(*word));\n    }\n  }\n  for (unsigned char fill = nt; fill < search::kMaxArity; ++fill) {\n    out.nt[fill] = search::kBlankPartialVertex;\n  }\n\n  if (final) {\n    words.push_back(m_.GetVocabulary().EndSentence());\n  }\n\n  out.score += in.rule_->GetFeatureValues().dot(cdec_weights_);\n  out.score -= static_cast<float>(terminals) * context.GetWeights().WordPenalty() \/ M_LN10;\n  out.score += search::ScoreRule(context, words, final, out.between);\n  return nt;\n}\n\nboost::scoped_ptr<LazyBase> AwfulGlobalLazy;\n\n} \/\/ namespace\n\nvoid PassToLazy(const char *model_file, const std::vector<weight_t> &weights, unsigned int pop_limit, const Hypergraph &hg) {\n  if (!AwfulGlobalLazy.get()) {\n    std::cerr << \"Pop limit \" << pop_limit << std::endl;\n    AwfulGlobalLazy.reset(LazyBase::Load(model_file, weights));\n  }\n  AwfulGlobalLazy->Search(pop_limit, hg);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef WORKERS_H\n#define WORKERS_H\n\n#include\"lockeds.hpp\"\n#include\"mutexes.hpp\"\n\n#include<vector>\n#include<set>\n#include<queue>\n\n#include<boost\/thread\/barrier.hpp>\n#include<boost\/thread\/mutex.hpp>\n#include<boost\/thread\/thread.hpp>\n\nclass Worker;\nclass Process;\n\nclass AllWorkers {\n\tbool exit_condition;\n\n\tbool soft_stop_condition;\n\tboost::barrier soft_stop_barrier;\n\n\t\/*When performing a process collection, this specifies the\n\tnumber of workers that haven't consumed their gray set yet.\n\tIn the document doc\/process-gc.txt, this is the \"N\" variable\n\t*\/\n\tAtomicCounter gray_workers;\n\n\t\/*set of all workers*\/\n\tsize_t total_workers;\n\tstd::vector<Worker*> Ws;\n\n\t\/*set of known processes*\/\n\tstd::vector<Process*> U;\n\n\tstd::queue<Process*> workqueue;\n\tAppMutex workqueue_mutex;\n\n\t\/*default timeslice for processes*\/\n\tsize_t default_timeslice;\n\n\t\/*atomically register a worker into Ws*\/\n\tvoid register_worker(Worker*);\n\n\t\/*pushes a process onto the workqueue, then pops a process*\/\n\tvoid workqueue_push_and_pop(Process*&);\n\n\t\/*pops a process from the workqueue.\n\tblocks if no process is available yet.\n\treturns 0 if all worker threads have blocked\n\t\t(meaning all work has ended)\n\treturns 1 if a process was successfully popped\n\t*\/\n\tbool workqueue_pop(Process*&);\n\npublic:\n\t\/*initiates the specified number of worker threads\n\tThis function will return only when workers run out\n\tof work, or if someone signals an exit condition\n\t*\/\n\tvoid initiate(void);\n\n\t\/*atomically register a process into U*\/\n\tvoid register_process(Process*);\n\n\t\/*pushes a process onto the workqueue*\/\n\tvoid workqueue_push(Process*);\n\n\tAllWorkers(unsigned int nworkers)\n\t\t: exit_condition(0),\n\t\t  soft_stop_condition(0),\n\t\t  soft_stop_barrier(nworkers),\n\t\t  gray_workers(0),\n\t\t  total_workers(nworkers),\n\t\t  workqueue(),\n\t\t  workqueue_mutex(),\n\t\t  default_timeslice(nworkers > 1 ? 256 : 64)\n\t{ }\n\n\tfriend class Worker;\n};\n\nclass Worker {\n\tstd::set<Process*> gray_set;\n\tbool gray_done;\n\tbool scanning_mode;\n\n\tAllWorkers* parent;\n\n\t\/*worker core*\/\n\tvoid work(void);\n\n\t\/*process marking*\/\n\tvoid mark_process(Process*);\n\npublic:\n\t\/*process-level GC triggering*\/\n\tsize_t T;\n\n\t\/*callable, used to launch a thread*\/\n\tvoid operator()(void);\n\n\texplicit Worker(AllWorkers* nparent)\n\t\t: parent(nparent),\n\t\tgray_set(),\n\t\tgray_done(1),\n\t\tscanning_mode(0),\n\t\tT(0)\n\t{ }\n};\n\n#endif \/\/ WORKERS_H\n\n<commit_msg>inc\/workers.hpp: made AllWorkers noncopyable<commit_after>#ifndef WORKERS_H\n#define WORKERS_H\n\n#include\"lockeds.hpp\"\n#include\"mutexes.hpp\"\n\n#include<vector>\n#include<set>\n#include<queue>\n\n#include<boost\/thread\/barrier.hpp>\n#include<boost\/thread\/mutex.hpp>\n#include<boost\/thread\/thread.hpp>\n#include<boost\/noncopyable.hpp>\n\nclass Worker;\nclass Process;\n\nclass AllWorkers : boost::noncopyable {\n\tbool exit_condition;\n\n\tbool soft_stop_condition;\n\tboost::barrier soft_stop_barrier;\n\n\t\/*When performing a process collection, this specifies the\n\tnumber of workers that haven't consumed their gray set yet.\n\tIn the document doc\/process-gc.txt, this is the \"N\" variable\n\t*\/\n\tAtomicCounter gray_workers;\n\n\t\/*set of all workers*\/\n\tsize_t total_workers;\n\tstd::vector<Worker*> Ws;\n\n\t\/*set of known processes*\/\n\tstd::vector<Process*> U;\n\n\tstd::queue<Process*> workqueue;\n\tAppMutex workqueue_mutex;\n\n\t\/*default timeslice for processes*\/\n\tsize_t default_timeslice;\n\n\t\/*atomically register a worker into Ws*\/\n\tvoid register_worker(Worker*);\n\n\t\/*pushes a process onto the workqueue, then pops a process*\/\n\tvoid workqueue_push_and_pop(Process*&);\n\n\t\/*pops a process from the workqueue.\n\tblocks if no process is available yet.\n\treturns 0 if all worker threads have blocked\n\t\t(meaning all work has ended)\n\treturns 1 if a process was successfully popped\n\t*\/\n\tbool workqueue_pop(Process*&);\n\npublic:\n\t\/*initiates the specified number of worker threads\n\tThis function will return only when workers run out\n\tof work, or if someone signals an exit condition\n\t*\/\n\tvoid initiate(void);\n\n\t\/*atomically register a process into U*\/\n\tvoid register_process(Process*);\n\n\t\/*pushes a process onto the workqueue*\/\n\tvoid workqueue_push(Process*);\n\n\tAllWorkers(unsigned int nworkers)\n\t\t: exit_condition(0),\n\t\t  soft_stop_condition(0),\n\t\t  soft_stop_barrier(nworkers),\n\t\t  gray_workers(0),\n\t\t  total_workers(nworkers),\n\t\t  workqueue(),\n\t\t  workqueue_mutex(),\n\t\t  default_timeslice(nworkers > 1 ? 256 : 64)\n\t{ }\n\n\tfriend class Worker;\n};\n\nclass Worker {\n\tstd::set<Process*> gray_set;\n\tbool gray_done;\n\tbool scanning_mode;\n\n\tAllWorkers* parent;\n\n\t\/*worker core*\/\n\tvoid work(void);\n\n\t\/*process marking*\/\n\tvoid mark_process(Process*);\n\npublic:\n\t\/*process-level GC triggering*\/\n\tsize_t T;\n\n\t\/*callable, used to launch a thread*\/\n\tvoid operator()(void);\n\n\texplicit Worker(AllWorkers* nparent)\n\t\t: parent(nparent),\n\t\tgray_set(),\n\t\tgray_done(1),\n\t\tscanning_mode(0),\n\t\tT(0)\n\t{ }\n};\n\n#endif \/\/ WORKERS_H\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"engine\/world\/Room.h\"\n#include \"engine\/math\/random.h\"\n\nnamespace engine {\nnamespace world {\n\n\tRoom::Room(){\n\t\t\/\/Initialize empty room\n\t\troomType = ROOM_TYPE_EMPTY;\n\n\t\tTile tempTile;\n\t\ttempTile.setType(TILE_VOID);\n\n\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\ttiles[i] = tempTile;\n\t\t}\n\t}\n\n\tTile* Room::getTile(vec2 pos){\n\t\treturn getTile(pos.x,pos.y);\n\t}\n\n\tTile* Room::getTile(int x,int y){\n\t\tASSERT_TILE_XY(x,y);\n\n\t\treturn &tiles[(x * ROOM_HEIGHT) + y];\n\t}\n\n\tvoid Room::setTile(vec2 pos,Tile tile){\n\t\tsetTile(pos.x,pos.y,tile);\n\t}\n\n\tvoid Room::setTile(int x,int y,Tile tile){\n\t\tASSERT_TILE_XY(x,y);\n\t\ttiles[(x * ROOM_HEIGHT) + y] = tile;\n\t}\n\n\t\/**\n\t * Regenerate the room.\n\t *\n\t * Input: Reads roomType and builds on top of that.\n\t *\/\n\tvoid Room::generate(){\n\t\t\/\/Lets get the simple types out from the way first... air and water...\n\n\t\tTile tempTile;\n\n\t\tswitch(roomType){\n\t\tcase ROOM_TYPE_EMPTY:\n\t\t\t\/\/Loop trough all tiles and set them to void\n\t\t\ttempTile.setType(TILE_VOID);\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\ttiles[i] = tempTile;\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase ROOM_TYPE_WATER:\n\t\t\ttempTile.setType(TILE_WATER);\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\ttiles[i] = tempTile;\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase ROOM_TYPE_GROUND:\n\t\t\ttempTile.setType(TILE_GRASS);\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\ttiles[i] = tempTile;\n\t\t\t}\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\tif(randomRange(0,10) > 8){\n\t\t\t\t\ttiles[i] = Tile(TILE_TREE);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase ROOM_TYPE_DUNGEON:\n\t\t\ttempTile.setType(TILE_ROCK_FLOOR);\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\ttiles[i] = tempTile;\n\t\t\t}\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\tif(randomRange(0,1)){\n\t\t\t\t\ttiles[i] = Tile(TILE_SOLID_ROCK);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/**\n\t * Returns direct access to the tile array, useful when raw access needed to the array.\n\t *\/\n\tTile* Room::getTileArray(){\n\t\treturn tiles;\n\t}\n\n\t\/**\n\t * Prints the room layout to the cmd. Used for debugging.\n\t *\/\n\tvoid Room::printLayout(){\n\t\tfor(int y = 0;y < ROOM_HEIGHT;++y){\n\t\t\tfor(int x = 0;x < ROOM_WIDTH;++x){\n\t\t\t\tprintf(\"%c\",getTile(x,y)->visual);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\n}\n}\n<commit_msg>Modifying the world generator<commit_after>#include \"engine\/world\/Room.h\"\n#include \"engine\/math\/random.h\"\n#include \"engine\/math\/AABB.h\"\n\nnamespace engine {\nnamespace world {\n\n\tRoom::Room(){\n\t\t\/\/Initialize empty room\n\t\troomType = ROOM_TYPE_EMPTY;\n\n\t\tTile tempTile;\n\t\ttempTile.setType(TILE_VOID);\n\n\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\ttiles[i] = tempTile;\n\t\t}\n\t}\n\n\tTile* Room::getTile(vec2 pos){\n\t\treturn getTile(pos.x,pos.y);\n\t}\n\n\tTile* Room::getTile(int x,int y){\n\t\tASSERT_TILE_XY(x,y);\n\n\t\treturn &tiles[(x * ROOM_HEIGHT) + y];\n\t}\n\n\tvoid Room::setTile(vec2 pos,Tile tile){\n\t\tsetTile(pos.x,pos.y,tile);\n\t}\n\n\tvoid Room::setTile(int x,int y,Tile tile){\n\t\tASSERT_TILE_XY(x,y);\n\t\ttiles[(x * ROOM_HEIGHT) + y] = tile;\n\t}\n\n\t\/**\n\t * Regenerate the room.\n\t *\n\t * Input: Reads roomType and builds on top of that.\n\t *\/\n\tvoid Room::generate(){\n\t\t\/\/Lets get the simple types out from the way first... air and water...\n\n\t\tTile tempTile;\n\n\t\tswitch(roomType){\n\t\tcase ROOM_TYPE_EMPTY:\n\t\t\t\/\/Loop trough all tiles and set them to void\n\t\t\ttempTile.setType(TILE_VOID);\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\ttiles[i] = tempTile;\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase ROOM_TYPE_WATER:\n\t\t\ttempTile.setType(TILE_WATER);\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\ttiles[i] = tempTile;\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase ROOM_TYPE_GROUND:\n\t\t\ttempTile.setType(TILE_GRASS);\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\ttiles[i] = tempTile;\n\t\t\t}\n\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\tif(randomRange(0,10) > 8){\n\t\t\t\t\ttiles[i] = Tile(TILE_TREE);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase ROOM_TYPE_DUNGEON:\n\t\t\ttempTile.setType(TILE_ROCK_FLOOR);\n\n\t\t\t\/\/reset room\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\ttiles[i] = tempTile;\n\t\t\t}\n\n\t\t\t\/\/Base with random amounts of rock\n\t\t\tfor(int i = 0;i < (ROOM_WIDTH * ROOM_HEIGHT);++i){\n\t\t\t\tif(randomRange(0,10) > 1){\n\t\t\t\t\ttiles[i] = Tile(TILE_SOLID_ROCK);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/Insert the random rooms\n\t\t\tint roomCount = randomRange(2,6);\n\n\t\t\twhile(roomCount > 0){\n\t\t\t\tAABB room;\n\t\t\t\t\/\/first size, then position, so we are sure it wont go over the limits\n\t\t\t\tLOG_INFO(\"Room\");\n\n\t\t\t\troom.size.x = randomRange(2,5);\n\t\t\t\troom.size.y = randomRange(2,5);\n\n\t\t\t\troom.pos.x = randomRange(0,(ROOM_WIDTH  - room.size.x));\n\t\t\t\troom.pos.y = randomRange(0,(ROOM_HEIGHT - room.size.y));\n\n\t\t\t\t\/\/Room stuff is ok, lets draw it in\n\t\t\t\tfor(int x = room.pos.x;x < room.size.x;++x){\n\t\t\t\t\tfor(int y = room.pos.y;y < room.size.y;++y){\n\t\t\t\t\t\tsetTile(x,y,Tile(TILE_ROCK_FLOOR));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t--roomCount;\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/**\n\t * Returns direct access to the tile array, useful when raw access needed to the array.\n\t *\/\n\tTile* Room::getTileArray(){\n\t\treturn tiles;\n\t}\n\n\t\/**\n\t * Prints the room layout to the cmd. Used for debugging.\n\t *\/\n\tvoid Room::printLayout(){\n\t\tfor(int y = 0;y < ROOM_HEIGHT;++y){\n\t\t\tfor(int x = 0;x < ROOM_WIDTH;++x){\n\t\t\t\tprintf(\"%c\",getTile(x,y)->visual);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n\n\n\nusing namespace std;\n\ntemplate <class T>\nstruct Node\n{\n\tT element;\n\tNode<T> *left, *right, *pparent;\n};\n\ntemplate <class T>\nclass BST {\nprivate:\n\tNode<T> *root;\n\tint count;\npublic:\n\tBST();\n\tvoid show(ostream&cout, Node<T> *Tree);\n\tvoid add(const T&);\n\tbool search(const T&, Node<T> *Tree);\n\tvoid input(const string file);\n\tvoid output(const string file);\n\tNode<T>* MinElement(Node<T>* min);\n\tNode<T>* getroot();\n\tint getcount() const;\n\tNode<T>* del(Node<T> *Tree, T el);\n\n\n};\n\n\nint main() {\n\tsystem(\"chcp 1251\");\n\n\tBST<int> MyTree;\n\tchar file1[20] = \"File1.txt\";\n\tchar file2[20] = \"File2.txt\";\n\tMyTree.input(file1);\n\tMyTree.show(cout, MyTree.getroot());\n\tMyTree.output(file2);\n\tif (MyTree.search(10, MyTree.getroot()) == true) {\n\t\tcout << \"Элемент найден\" << endl;\n\t}\n\telse cout << \"Элемент не найден\" << endl;\n\tMyTree.del(MyTree.getroot(), 4);\n\tMyTree.show(cout, MyTree.getroot());\n\n\n\n\tsystem(\"pause\");\n\n\treturn 0;\n}\n\ntemplate <typename T> BST<T>::BST() {\n\troot = NULL;\n\tcount = 0;\n}\n\ntemplate <typename T> void BST<T>::show(ostream&cout, Node<T> *Tree) {\n\tif (Tree != NULL) {\n\n\t\tcout << Tree->element << endl;;\n\t\tshow(cout, Tree->left);\n\t\tshow(cout, Tree->right);\n\n\t}\n}\n\ntemplate <typename T> void BST<T>::add(const T &x) {\n\tNode<T>* daughter = new Node<T>;\n\tdaughter->element = x;\n\tdaughter->left = daughter->right = nullptr;\n\tNode<T>* parent = root;\n\tNode<T>* temp = root;\n\n\twhile (temp)\n\t{\n\t\tparent = temp;\n\t\tif (x < temp->element)\n\t\t\ttemp = temp->left;\n\t\telse temp = temp->right;\n\t}\n\n\tif (!parent)\n\t\troot = daughter;\n\telse {\n\t\tif (x < parent->element)\n\t\t\tparent->left = daughter;\n\t\telse\n\t\t\tparent->right = daughter;\n\t}\n\tcount++;\n}\n\n\ntemplate <typename T> Node<T>* BST<T>::getroot() {\n\treturn root;\n}\n\ntemplate <typename T> int BST<T>::getcount() const {\n\treturn count;\n}\n\ntemplate <typename T> void BST<T>::input(const string file) {\n\tifstream fin(file);\n\ttry\n\t{\n\t\tint temp;\n\t\twhile (!fin.eof())\n\t\t{\n\n\t\t\tfin >> temp;\n\t\t\tadd(temp);\n\n\t\t}\n\t\tfin.close();\n\t}\n\tcatch (int i)\n\t{\n\t\tcout << \"This file don't find\" << endl;\n\t}\n\n}\n\ntemplate <typename T> void BST<T>::output(const string file) {\n\tofstream fout(file);\n\tshow(fout, root);\n\tfout.close();\n}\n\ntemplate <typename T> bool BST<T>::search(const T&x, Node<T>* Tree) {\n\tif (Tree == nullptr)\n\t\treturn false;\n\tif (x == Tree->element) {\n\t\treturn true;\n\t}\n\telse if (x < Tree->element) {\n\t\tsearch(x, Tree->left);\n\t}\n\telse search(x, Tree->right);\n}\n\ntemplate <typename T> Node<T>* BST<T>::MinElement(Node<T>* min) {\n\tif (min->left == nullptr)\n\t\treturn min;\n\telse\n\t\treturn MinElement(min->left);\n\n\n}\n\n\n\ntemplate <typename T>\nNode<T>* BST<T>::del(Node<T> *Tree, T el) {\n\tif (Tree == nullptr) return Tree;\n\tif (el < Tree->element) Tree->left = del(Tree->left, el);\n\telse if (el > Tree->element) Tree->right = del(Tree->right, el);\n\telse if ((Tree->left != nullptr) && (Tree->right != nullptr)) {\n\t\tTree->element = MinElement(Tree->right)->element;\n\t\tTree->right = del(Tree->right, Tree->element);\n\t}\n\telse {\n\t\tif (Tree->left != nullptr) Tree = Tree->left;\n\t\telse Tree = Tree->right;\n\t}\n\tcount--;\n\treturn Tree;\n}\n<commit_msg>Update BST.hpp<commit_after>#include <iostream>\n#include <fstream>\n\n\n\nusing namespace std;\n\ntemplate <class T>\nstruct Node\n{\n\tT element;\n\tNode<T> *left, *right, *pparent;\n};\n\ntemplate <class T>\nclass BST {\nprivate:\n\tNode<T> *root;\n\tint count;\npublic:\n\tBST();\n\tvoid show(ostream&cout, Node<T> *Tree);\n\tvoid add(const T&);\n\tbool search(const T&, Node<T> *Tree);\n\tvoid input(const string file);\n\tvoid output(const string file);\n\tNode<T>* MinElement(Node<T>* min);\n\tNode<T>* getroot();\n\tint getcount() const;\n\tNode<T>* del(Node<T> *Tree, T el);\n\n\n};\n\n\ntemplate <typename T> BST<T>::BST() {\n\troot = NULL;\n\tcount = 0;\n}\n\ntemplate <typename T> void BST<T>::show(ostream&cout, Node<T> *Tree) {\n\tif (Tree != NULL) {\n\n\t\tcout << Tree->element << endl;;\n\t\tshow(cout, Tree->left);\n\t\tshow(cout, Tree->right);\n\n\t}\n}\n\ntemplate <typename T> void BST<T>::add(const T &x) {\n\tNode<T>* daughter = new Node<T>;\n\tdaughter->element = x;\n\tdaughter->left = daughter->right = nullptr;\n\tNode<T>* parent = root;\n\tNode<T>* temp = root;\n\n\twhile (temp)\n\t{\n\t\tparent = temp;\n\t\tif (x < temp->element)\n\t\t\ttemp = temp->left;\n\t\telse temp = temp->right;\n\t}\n\n\tif (!parent)\n\t\troot = daughter;\n\telse {\n\t\tif (x < parent->element)\n\t\t\tparent->left = daughter;\n\t\telse\n\t\t\tparent->right = daughter;\n\t}\n\tcount++;\n}\n\n\ntemplate <typename T> Node<T>* BST<T>::getroot() {\n\treturn root;\n}\n\ntemplate <typename T> int BST<T>::getcount() const {\n\treturn count;\n}\n\ntemplate <typename T> void BST<T>::input(const string file) {\n\tifstream fin(file);\n\ttry\n\t{\n\t\tint temp;\n\t\twhile (!fin.eof())\n\t\t{\n\n\t\t\tfin >> temp;\n\t\t\tadd(temp);\n\n\t\t}\n\t\tfin.close();\n\t}\n\tcatch (int i)\n\t{\n\t\tcout << \"This file don't find\" << endl;\n\t}\n\n}\n\ntemplate <typename T> void BST<T>::output(const string file) {\n\tofstream fout(file);\n\tshow(fout, root);\n\tfout.close();\n}\n\ntemplate <typename T> bool BST<T>::search(const T&x, Node<T>* Tree) {\n\tif (Tree == nullptr)\n\t\treturn false;\n\tif (x == Tree->element) {\n\t\treturn true;\n\t}\n\telse if (x < Tree->element) {\n\t\tsearch(x, Tree->left);\n\t}\n\telse search(x, Tree->right);\n}\n\ntemplate <typename T> Node<T>* BST<T>::MinElement(Node<T>* min) {\n\tif (min->left == nullptr)\n\t\treturn min;\n\telse\n\t\treturn MinElement(min->left);\n\n\n}\n\n\n\ntemplate <typename T>\nNode<T>* BST<T>::del(Node<T> *Tree, T el) {\n\tif (Tree == nullptr) return Tree;\n\tif (el < Tree->element) Tree->left = del(Tree->left, el);\n\telse if (el > Tree->element) Tree->right = del(Tree->right, el);\n\telse if ((Tree->left != nullptr) && (Tree->right != nullptr)) {\n\t\tTree->element = MinElement(Tree->right)->element;\n\t\tTree->right = del(Tree->right, Tree->element);\n\t}\n\telse {\n\t\tif (Tree->left != nullptr) Tree = Tree->left;\n\t\telse Tree = Tree->right;\n\t}\n\tcount--;\n\treturn Tree;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\n#include <vector>\n\n\nnamespace helene\n{\ntemplate <class NodeType, class EdgeType> class dag\n{\npublic:\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ public typedefs\n\n    typedef NodeType value_type;\n    typedef NodeType& reference;\n    typedef const NodeType& const_reference;\n\n    typedef typename std::vector<NodeType>::difference_type difference_type;\n    typedef typename std::vector<NodeType>::size_type size_type;\n\n\n    typedef EdgeType edge_value_type;\n    typedef EdgeType& edge_reference;\n    typedef const EdgeType& const_edge_reference;\n\n    typedef typename std::vector<EdgeType>::size_type edge_size_type;\n    typedef\n        typename std::vector<EdgeType>::difference_type edge_difference_type;\n\nprivate:\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ internal classes\n\n    \/\/ indices to properties of the associated edge\n    struct edge\n    {\n        size_type from_property;\n        size_type to_property;\n        edge_size_type edge_property;\n    };\n\npublic:\n    dag() = default;\n\nprivate:\n    std::vector<NodeType> node_properties_;\n    std::vector<EdgeType> edge_properties_;\n};\n}\n<commit_msg>Add edges_ member variable. \tmodified:   include\/dag.hpp<commit_after>#pragma once\n\n\n#include <vector>\n\n\nnamespace helene\n{\ntemplate <class NodeType, class EdgeType> class dag\n{\npublic:\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ public typedefs\n\n    typedef NodeType value_type;\n    typedef NodeType& reference;\n    typedef const NodeType& const_reference;\n\n    typedef typename std::vector<NodeType>::difference_type difference_type;\n    typedef typename std::vector<NodeType>::size_type size_type;\n\n\n    typedef EdgeType edge_value_type;\n    typedef EdgeType& edge_reference;\n    typedef const EdgeType& const_edge_reference;\n\n    typedef typename std::vector<EdgeType>::size_type edge_size_type;\n    typedef\n        typename std::vector<EdgeType>::difference_type edge_difference_type;\n\nprivate:\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ internal classes\n\n    \/\/ indices to properties of the associated edge\n    struct edge\n    {\n        size_type from_property;\n        size_type to_property;\n        edge_size_type edge_property;\n    };\n\npublic:\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Container concept member functions\n\n    dag() = default;\n\nprivate:\n    std::vector<NodeType> node_properties_;\n    std::vector<EdgeType> edge_properties_;\n\n    std::vector<edge> edges_;\n};\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2019 The Syscoin 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#include <uint256.h>\n#include <arith_uint256.h>\n#include <ethereum\/ethereum.h>\n#include <ethereum\/sha3.h>\n#include <services\/witnessaddress.h>\n#include <logging.h>\n#include <util\/strencodings.h>\n\n\nint nibblesToTraverse(const std::string &encodedPartialPath, const std::string &path, int pathPtr) {\n  std::string partialPath;\n  char pathPtrInt[2] = {encodedPartialPath[0], '\\0'};\n  int partialPathInt = strtol(pathPtrInt, NULL, 10);\n  if(partialPathInt == 0 || partialPathInt == 2){\n    partialPath = encodedPartialPath.substr(2);\n  }else{\n    partialPath = encodedPartialPath.substr(1);\n  }\n  if(partialPath == path.substr(pathPtr, partialPath.size())){\n    return partialPath.size();\n  }else{\n    return -1;\n  }\n}\nbool VerifyProof(dev::bytesConstRef path, const dev::RLP& value, const dev::RLP& parentNodes, const dev::RLP& root) {\n    try{\n        dev::RLP currentNode;\n        const int len = parentNodes.itemCount();\n        dev::RLP nodeKey = root;       \n        int pathPtr = 0;\n\n    \tconst std::string pathString = dev::toHex(path);\n  \n        int nibbles;\n        char pathPtrInt[2];\n        for (int i = 0 ; i < len ; i++) {\n          currentNode = parentNodes[i];\n          if(!nodeKey.payload().contentsEqual(sha3(currentNode.data()).ref().toVector())){\n            return false;\n          } \n\n          if(pathPtr > (int)pathString.size()){\n            return false;\n          }\n\n          switch(currentNode.itemCount()){\n            case 17:\/\/branch node\n              if(pathPtr == (int)pathString.size()){\n                if(currentNode[16].payload().contentsEqual(value.data().toVector())){\n    \n                  return true;\n                }else{\n                  return false;\n                }\n              }\n          \n              pathPtrInt[0] = pathString[pathPtr];\n              pathPtrInt[1] = '\\0';\n\n              nodeKey = currentNode[strtol(pathPtrInt, NULL, 16)]; \/\/must == sha3(rlp.encode(currentNode[path[pathptr]]))\n              pathPtr += 1;\n              break;\n            case 2:\n              nibbles = nibblesToTraverse(toHex(currentNode[0].payload()), pathString, pathPtr);\n\n              if(nibbles <= -1)\n                return false;\n              pathPtr += nibbles;\n      \n              if(pathPtr == (int)pathString.size()) { \/\/leaf node\n                if(currentNode[1].payload().contentsEqual(value.data().toVector())){\n         \n                  return true;\n                } else {\n                  return false;\n                }\n              } else {\/\/extension node\n                nodeKey = currentNode[1];\n              }\n              break;\n            default:\n              return false;\n          }\n        }\n    }\n    catch(...){\n        return false;\n    }\n  return false;\n}\n\n\/**\n * Parse eth input string expected to contain smart contract method call data. If the method call is not what we\n * expected, or the length of the expected string is not what we expect then return false.\n *\n * @param vchInputExpectedMethodHash The expected method hash\n * @param vchInputData The input to parse\n * @param vchAssetContract The ERC20 contract address of the token involved in moving over\n * @param outputAmount The amount burned\n * @param nAsset The asset burned\n * @param nLocalPrecision The local precision to know how to convert ethereum's uint256 to a CAmount (int64) with truncation of insignifficant bits\n * @param witnessAddress The destination witness address for the minting\n * @return true if everything is valid\n *\/\nbool parseEthMethodInputData(const std::vector<unsigned char>& vchInputExpectedMethodHash, const std::vector<unsigned char>& vchInputData, const std::vector<unsigned char>& vchAssetContract, CAmount& outputAmount, uint32_t& nAsset, const uint8_t& nLocalPrecision, CWitnessAddress& witnessAddress) {\n    if(vchAssetContract.empty()){\n      return false;\n    }\n    \/\/ total 7 or 8 fields are expected @ 32 bytes each field, 8 fields if witness > 32 bytes\n    if(vchInputData.size() < 196 || vchInputData.size() > 260) {\n      return false;  \n    }\n    \/\/ method hash is 4 bytes\n    std::vector<unsigned char>::const_iterator firstMethod = vchInputData.begin();\n    std::vector<unsigned char>::const_iterator lastMethod = firstMethod + 4;\n    const std::vector<unsigned char> vchMethodHash(firstMethod,lastMethod);\n    \/\/ if the method hash doesn't match the expected method hash then return false\n    if(vchMethodHash != vchInputExpectedMethodHash) {\n      return false;\n    }\n\n    std::vector<unsigned char> vchAmount(lastMethod,lastMethod + 32);\n    \/\/ reverse endian\n    std::reverse(vchAmount.begin(), vchAmount.end());\n    arith_uint256 outputAmountArith = UintToArith256(uint256(vchAmount));\n    \n    \n    \/\/ convert the vch into a uint32_t (nAsset)\n    \/\/ should be in position 68 walking backwards\n    nAsset = static_cast<uint32_t>(vchInputData[67]);\n    nAsset |= static_cast<uint32_t>(vchInputData[66]) << 8;\n    nAsset |= static_cast<uint32_t>(vchInputData[65]) << 16;\n    nAsset |= static_cast<uint32_t>(vchInputData[64]) << 24;\n    \/\/ start from 100 offset (96 for 3rd field + 4 bytes for function signature) and subtract 20 \n    std::vector<unsigned char>::const_iterator firstContractAddress = vchInputData.begin() + 80;\n    std::vector<unsigned char>::const_iterator lastContractAddress = firstContractAddress + 20;\n    const std::vector<unsigned char> vchERC20ContractAddress(firstContractAddress,lastContractAddress);\n    if(vchERC20ContractAddress != vchAssetContract)\n    {\n      return false;\n    }\n    \/\/ skip data position field of 32 bytes + 100 offset + 31 (offset to the varint _byte)\n    int dataPos = 163;\n    const unsigned char &dataLength = vchInputData[dataPos++] - 1; \/\/ \/\/ - 1 to account for the version byte\n    \/\/ witness programs can extend to 40 bytes, min length is 2 for min witness program\n    if(dataLength > 40 || dataLength < 2){\n      return false;\n    }\n    \/\/ get precision\n    dataPos += 31;\n    const int8_t &nPrecision = static_cast<uint8_t>(vchInputData[dataPos++]);\n    \/\/ ensure we truncate decimals to fit within int64 if erc20's precision is more than our asset precision\n    \/\/ local precision can range between 0 and 8 decimal places, so it should fit within a CAmount\n    if(nLocalPrecision > nPrecision){\n      outputAmountArith \/= pow(10, nLocalPrecision-nPrecision);\n    \/\/ or we pad zero's if erc20's precision is less than ours so we can accurately get the whole value of the amount transferred\n    } else if(nLocalPrecision < nPrecision){\n      outputAmountArith *= pow(10, nPrecision-nLocalPrecision);\n    }\n    \/\/ once we have truncated it is safe to get low 64 bits of the uint256 which should encapsulate the entire value\n    outputAmount = outputAmountArith.GetLow64();\n\n    \/\/ witness address information starting at position dataPos till the end\n    \/\/ get version proceeded by witness program bytes\n    const unsigned char& nVersion = vchInputData[dataPos++];\n    std::vector<unsigned char>::const_iterator firstWitness = vchInputData.begin()+dataPos;\n    std::vector<unsigned char>::const_iterator lastWitness = firstWitness + dataLength; \n    witnessAddress = CWitnessAddress(nVersion, std::vector<unsigned char>(firstWitness,lastWitness));\n    return witnessAddress.IsValid();\n}<commit_msg>fix input data size check<commit_after>\/\/ Copyright (c) 2019 The Syscoin 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#include <uint256.h>\n#include <arith_uint256.h>\n#include <ethereum\/ethereum.h>\n#include <ethereum\/sha3.h>\n#include <services\/witnessaddress.h>\n#include <logging.h>\n#include <util\/strencodings.h>\n\n\nint nibblesToTraverse(const std::string &encodedPartialPath, const std::string &path, int pathPtr) {\n  std::string partialPath;\n  char pathPtrInt[2] = {encodedPartialPath[0], '\\0'};\n  int partialPathInt = strtol(pathPtrInt, NULL, 10);\n  if(partialPathInt == 0 || partialPathInt == 2){\n    partialPath = encodedPartialPath.substr(2);\n  }else{\n    partialPath = encodedPartialPath.substr(1);\n  }\n  if(partialPath == path.substr(pathPtr, partialPath.size())){\n    return partialPath.size();\n  }else{\n    return -1;\n  }\n}\nbool VerifyProof(dev::bytesConstRef path, const dev::RLP& value, const dev::RLP& parentNodes, const dev::RLP& root) {\n    try{\n        dev::RLP currentNode;\n        const int len = parentNodes.itemCount();\n        dev::RLP nodeKey = root;       \n        int pathPtr = 0;\n\n    \tconst std::string pathString = dev::toHex(path);\n  \n        int nibbles;\n        char pathPtrInt[2];\n        for (int i = 0 ; i < len ; i++) {\n          currentNode = parentNodes[i];\n          if(!nodeKey.payload().contentsEqual(sha3(currentNode.data()).ref().toVector())){\n            return false;\n          } \n\n          if(pathPtr > (int)pathString.size()){\n            return false;\n          }\n\n          switch(currentNode.itemCount()){\n            case 17:\/\/branch node\n              if(pathPtr == (int)pathString.size()){\n                if(currentNode[16].payload().contentsEqual(value.data().toVector())){\n    \n                  return true;\n                }else{\n                  return false;\n                }\n              }\n          \n              pathPtrInt[0] = pathString[pathPtr];\n              pathPtrInt[1] = '\\0';\n\n              nodeKey = currentNode[strtol(pathPtrInt, NULL, 16)]; \/\/must == sha3(rlp.encode(currentNode[path[pathptr]]))\n              pathPtr += 1;\n              break;\n            case 2:\n              nibbles = nibblesToTraverse(toHex(currentNode[0].payload()), pathString, pathPtr);\n\n              if(nibbles <= -1)\n                return false;\n              pathPtr += nibbles;\n      \n              if(pathPtr == (int)pathString.size()) { \/\/leaf node\n                if(currentNode[1].payload().contentsEqual(value.data().toVector())){\n         \n                  return true;\n                } else {\n                  return false;\n                }\n              } else {\/\/extension node\n                nodeKey = currentNode[1];\n              }\n              break;\n            default:\n              return false;\n          }\n        }\n    }\n    catch(...){\n        return false;\n    }\n  return false;\n}\n\n\/**\n * Parse eth input string expected to contain smart contract method call data. If the method call is not what we\n * expected, or the length of the expected string is not what we expect then return false.\n *\n * @param vchInputExpectedMethodHash The expected method hash\n * @param vchInputData The input to parse\n * @param vchAssetContract The ERC20 contract address of the token involved in moving over\n * @param outputAmount The amount burned\n * @param nAsset The asset burned\n * @param nLocalPrecision The local precision to know how to convert ethereum's uint256 to a CAmount (int64) with truncation of insignifficant bits\n * @param witnessAddress The destination witness address for the minting\n * @return true if everything is valid\n *\/\nbool parseEthMethodInputData(const std::vector<unsigned char>& vchInputExpectedMethodHash, const std::vector<unsigned char>& vchInputData, const std::vector<unsigned char>& vchAssetContract, CAmount& outputAmount, uint32_t& nAsset, const uint8_t& nLocalPrecision, CWitnessAddress& witnessAddress) {\n    if(vchAssetContract.empty()){\n      return false;\n    }\n    \/\/ total 7 or 8 fields are expected @ 32 bytes each field, 8 fields if witness > 32 bytes\n    if(vchInputData.size() < 228 || vchInputData.size() > 260) {\n      return false;  \n    }\n    \/\/ method hash is 4 bytes\n    std::vector<unsigned char>::const_iterator firstMethod = vchInputData.begin();\n    std::vector<unsigned char>::const_iterator lastMethod = firstMethod + 4;\n    const std::vector<unsigned char> vchMethodHash(firstMethod,lastMethod);\n    \/\/ if the method hash doesn't match the expected method hash then return false\n    if(vchMethodHash != vchInputExpectedMethodHash) {\n      return false;\n    }\n\n    std::vector<unsigned char> vchAmount(lastMethod,lastMethod + 32);\n    \/\/ reverse endian\n    std::reverse(vchAmount.begin(), vchAmount.end());\n    arith_uint256 outputAmountArith = UintToArith256(uint256(vchAmount));\n    \n    \n    \/\/ convert the vch into a uint32_t (nAsset)\n    \/\/ should be in position 68 walking backwards\n    nAsset = static_cast<uint32_t>(vchInputData[67]);\n    nAsset |= static_cast<uint32_t>(vchInputData[66]) << 8;\n    nAsset |= static_cast<uint32_t>(vchInputData[65]) << 16;\n    nAsset |= static_cast<uint32_t>(vchInputData[64]) << 24;\n    \/\/ start from 100 offset (96 for 3rd field + 4 bytes for function signature) and subtract 20 \n    std::vector<unsigned char>::const_iterator firstContractAddress = vchInputData.begin() + 80;\n    std::vector<unsigned char>::const_iterator lastContractAddress = firstContractAddress + 20;\n    const std::vector<unsigned char> vchERC20ContractAddress(firstContractAddress,lastContractAddress);\n    if(vchERC20ContractAddress != vchAssetContract)\n    {\n      return false;\n    }\n    \/\/ skip data position field of 32 bytes + 100 offset + 31 (offset to the varint _byte)\n    int dataPos = 163;\n    const unsigned char &dataLength = vchInputData[dataPos++] - 1; \/\/ \/\/ - 1 to account for the version byte\n    \/\/ witness programs can extend to 40 bytes, min length is 2 for min witness program\n    if(dataLength > 40 || dataLength < 2){\n      return false;\n    }\n    \/\/ get precision\n    dataPos += 31;\n    const int8_t &nPrecision = static_cast<uint8_t>(vchInputData[dataPos++]);\n    \/\/ ensure we truncate decimals to fit within int64 if erc20's precision is more than our asset precision\n    \/\/ local precision can range between 0 and 8 decimal places, so it should fit within a CAmount\n    if(nLocalPrecision > nPrecision){\n      outputAmountArith \/= pow(10, nLocalPrecision-nPrecision);\n    \/\/ or we pad zero's if erc20's precision is less than ours so we can accurately get the whole value of the amount transferred\n    } else if(nLocalPrecision < nPrecision){\n      outputAmountArith *= pow(10, nPrecision-nLocalPrecision);\n    }\n    \/\/ once we have truncated it is safe to get low 64 bits of the uint256 which should encapsulate the entire value\n    outputAmount = outputAmountArith.GetLow64();\n\n    \/\/ witness address information starting at position dataPos till the end\n    \/\/ get version proceeded by witness program bytes\n    const unsigned char& nVersion = vchInputData[dataPos++];\n    std::vector<unsigned char>::const_iterator firstWitness = vchInputData.begin()+dataPos;\n    std::vector<unsigned char>::const_iterator lastWitness = firstWitness + dataLength; \n    witnessAddress = CWitnessAddress(nVersion, std::vector<unsigned char>(firstWitness,lastWitness));\n    return witnessAddress.IsValid();\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 \"otbWrapperChoiceParameter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nChoiceParameter::ChoiceParameter()\n  : m_CurrentChoice(0)\n{\n}\n\nChoiceParameter::~ChoiceParameter()\n{\n}\n\n\nvoid\nChoiceParameter::AddChoice( std::string choicekey, std::string choiceName )\n{\n  Choice choice;\n  choice.m_Key = choicekey;\n  choice.m_Name = choiceName;\n  choice.m_AssociatedParameter = ParameterGroup::New();\n  m_ChoiceList.push_back(choice);\n}\n\nstd::string\nChoiceParameter::GetChoiceKey( int i )\n{\n  return m_ChoiceList[i].m_Key;\n}\n\n\nstd::vector<std::string>\nChoiceParameter::GetChoiceKeys( )\n{\n  std::vector<std::string> ret;\n  ChoiceList::iterator it = m_ChoiceList.begin();\n\n  for (it = m_ChoiceList.begin(); it != m_ChoiceList.end(); ++it)\n    {\n    ret.push_back(it->m_Key);\n    }\n\n  return ret;\n}\n\n\nstd::string\nChoiceParameter::GetChoiceName( int i )\n{\n  return m_ChoiceList[i].m_Name;\n}\n\n\nstd::vector<std::string>\nChoiceParameter::GetChoiceNames( )\n{\n  std::vector<std::string> ret;\n  ChoiceList::iterator it = m_ChoiceList.begin();\n\n  for (it = m_ChoiceList.begin(); it != m_ChoiceList.end(); ++it)\n    {\n    ret.push_back(it->m_Name);\n    }\n  return ret;\n}\n\n\nParameterGroup::Pointer\nChoiceParameter::GetChoiceParameterGroupByIndex( int i )\n{\n  return m_ChoiceList[i].m_AssociatedParameter;\n}\n\nParameterGroup::Pointer\nChoiceParameter::GetChoiceParameterGroupByKey( std::string choiceKey )\n{\n  ChoiceList::iterator it = m_ChoiceList.begin();\n\n  for (it = m_ChoiceList.begin(); it != m_ChoiceList.end(); ++it)\n    {\n    if ( it->m_Key == choiceKey )\n      {\n      return it->m_AssociatedParameter;\n      }\n    }\n\n  itkExceptionMacro(<< \"Cannot find \" << choiceKey);\n}\n\nunsigned int\nChoiceParameter::GetNbChoices( void )\n{\n  return m_ChoiceList.size();\n}\n\nvoid\nChoiceParameter::SetValue(unsigned int v)\n{\n  m_CurrentChoice = v;\n  SetActive(true);\n  \/\/ Call Modified();\n  this->Modified();\n}\n\nvoid\nChoiceParameter::SetValue(std::string choiceKey)\n{\n  ChoiceList::iterator it = m_ChoiceList.begin();\n\n  unsigned int i = 0;\n  for (it = m_ChoiceList.begin(); it != m_ChoiceList.end(); ++it)\n    {\n    if ( it->m_Key == choiceKey )\n      {\n      SetValue(i);\n      return;\n      }\n    ++i;\n    }\n\n  itkExceptionMacro(<< \"Cannot find \" << choiceKey);\n}\n\nunsigned int\nChoiceParameter::GetValue()\n{\n  return m_CurrentChoice;\n}\n\n\/** Return any value *\/\nstd::vector<std::string>\nChoiceParameter::GetParametersKeys()\n{\n  std::vector<std::string> parameters;\n\n  ChoiceList::iterator cit = m_ChoiceList.begin();\n\n  for (cit = m_ChoiceList.begin(); cit != m_ChoiceList.end(); ++cit)\n    {\n    if (cit->m_AssociatedParameter)\n      {\n      std::vector<std::string> subparams = cit->m_AssociatedParameter->GetParametersKeys();\n      for (std::vector<std::string>::const_iterator it = subparams.begin();\n           it != subparams.end(); ++it)\n        {\n        parameters.push_back( cit->m_Key + \".\"  + *it );\n        }\n      }\n    }\n  return parameters;\n}\n\n}\n}\n\n<commit_msg>ENH: add the associated GroupParameter created when adding a choice to the ChoiceParameter      children list to avoid creating a gap between the ChoiceParameter and the Parameter created      later in the QtGUI<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 \"otbWrapperChoiceParameter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nChoiceParameter::ChoiceParameter()\n  : m_CurrentChoice(0)\n{\n}\n\nChoiceParameter::~ChoiceParameter()\n{\n}\n\n\nvoid\nChoiceParameter::AddChoice( std::string choicekey, std::string choiceName )\n{\n  Choice choice;\n  choice.m_Key = choicekey;\n  choice.m_Name = choiceName;\n  choice.m_AssociatedParameter = ParameterGroup::New();\n  m_ChoiceList.push_back(choice);\n\n  \/\/ Add the associated parameter as a child\n  \/\/ in order to not have a gap in the children hierarchy\n  this->AddChild(choice.m_AssociatedParameter.GetPointer());\n}\n\nstd::string\nChoiceParameter::GetChoiceKey( int i )\n{\n  return m_ChoiceList[i].m_Key;\n}\n\n\nstd::vector<std::string>\nChoiceParameter::GetChoiceKeys( )\n{\n  std::vector<std::string> ret;\n  ChoiceList::iterator it = m_ChoiceList.begin();\n\n  for (it = m_ChoiceList.begin(); it != m_ChoiceList.end(); ++it)\n    {\n    ret.push_back(it->m_Key);\n    }\n\n  return ret;\n}\n\n\nstd::string\nChoiceParameter::GetChoiceName( int i )\n{\n  return m_ChoiceList[i].m_Name;\n}\n\n\nstd::vector<std::string>\nChoiceParameter::GetChoiceNames( )\n{\n  std::vector<std::string> ret;\n  ChoiceList::iterator it = m_ChoiceList.begin();\n\n  for (it = m_ChoiceList.begin(); it != m_ChoiceList.end(); ++it)\n    {\n    ret.push_back(it->m_Name);\n    }\n  return ret;\n}\n\n\nParameterGroup::Pointer\nChoiceParameter::GetChoiceParameterGroupByIndex( int i )\n{\n  return m_ChoiceList[i].m_AssociatedParameter;\n}\n\nParameterGroup::Pointer\nChoiceParameter::GetChoiceParameterGroupByKey( std::string choiceKey )\n{\n  ChoiceList::iterator it = m_ChoiceList.begin();\n\n  for (it = m_ChoiceList.begin(); it != m_ChoiceList.end(); ++it)\n    {\n    if ( it->m_Key == choiceKey )\n      {\n      return it->m_AssociatedParameter;\n      }\n    }\n\n  itkExceptionMacro(<< \"Cannot find \" << choiceKey);\n}\n\nunsigned int\nChoiceParameter::GetNbChoices( void )\n{\n  return m_ChoiceList.size();\n}\n\nvoid\nChoiceParameter::SetValue(unsigned int v)\n{\n  m_CurrentChoice = v;\n  SetActive(true);\n  \/\/ Call Modified();\n  this->Modified();\n}\n\nvoid\nChoiceParameter::SetValue(std::string choiceKey)\n{\n  ChoiceList::iterator it = m_ChoiceList.begin();\n\n  unsigned int i = 0;\n  for (it = m_ChoiceList.begin(); it != m_ChoiceList.end(); ++it)\n    {\n    if ( it->m_Key == choiceKey )\n      {\n      SetValue(i);\n      return;\n      }\n    ++i;\n    }\n\n  itkExceptionMacro(<< \"Cannot find \" << choiceKey);\n}\n\nunsigned int\nChoiceParameter::GetValue()\n{\n  return m_CurrentChoice;\n}\n\n\/** Return any value *\/\nstd::vector<std::string>\nChoiceParameter::GetParametersKeys()\n{\n  std::vector<std::string> parameters;\n\n  ChoiceList::iterator cit = m_ChoiceList.begin();\n\n  for (cit = m_ChoiceList.begin(); cit != m_ChoiceList.end(); ++cit)\n    {\n    if (cit->m_AssociatedParameter)\n      {\n      std::vector<std::string> subparams = cit->m_AssociatedParameter->GetParametersKeys();\n      for (std::vector<std::string>::const_iterator it = subparams.begin();\n           it != subparams.end(); ++it)\n        {\n        parameters.push_back( cit->m_Key + \".\"  + *it );\n        }\n      }\n    }\n  return parameters;\n}\n\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n Flexisip, a flexible SIP proxy server with media capabilities.\n Copyright (C) 2012  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 \"forkmessagecontext.hh\"\n#include \"registrardb.hh\"\n#include \"common.hh\"\n#include <algorithm>\n#include <sofia-sip\/sip_status.h>\n#include <sofia-sip\/msg_types.h>\n#include \"xml\/fthttp.hxx\"\n#include <xercesc\/util\/PlatformUtils.hpp>\n\nusing namespace ::std;\nusing namespace fthttp;\n\nstatic bool needsDelivery(int code){\n\treturn code<200 || code==503 || code==408;\n}\n\nForkMessageContext::ForkMessageContext(Agent *agent, const std::shared_ptr<RequestSipEvent> &event, shared_ptr<ForkContextConfig> cfg, ForkContextListener* listener) :\n\t\tForkContext(agent, event,cfg,listener) {\n\tLOGD(\"New ForkMessageContext %p\", this);\n\tmAcceptanceTimer=NULL;\n\t\/\/start the acceptance timer immediately\n\tif (mCfg->mForkLate && mCfg->mDeliveryTimeout>30){\n\t\tmAcceptanceTimer=su_timer_create(su_root_task(mAgent->getRoot()), 0);\n\t\tsu_timer_set_interval(mAcceptanceTimer, &ForkMessageContext::sOnAcceptanceTimer, this, (su_duration_t)mCfg->mUrgentTimeout*1000);\n\t}\n\tmDeliveredCount=0;\n}\n\nForkMessageContext::~ForkMessageContext() {\n\tif (mAcceptanceTimer)\n\t\tsu_timer_destroy(mAcceptanceTimer);\n\tLOGD(\"Destroy ForkMessageContext %p\", this);\n}\n\nbool ForkMessageContext::shouldFinish() {\n\treturn false; \/\/the messaging fork context controls its termination.\n}\n\n\nvoid ForkMessageContext::checkFinished(){\n\tif (mIncoming==NULL && !mCfg->mForkLate){\n\t\tsetFinished();\n\t\treturn;\n\t}\n\t\n\tauto branches=getBranches();\n\tbool awaiting_responses=false;\n\t\n\tif (!mCfg->mForkLate){\n\t\tawaiting_responses=!allBranchesAnswered();\n\t}else{\n\t\tfor(auto it=branches.begin();it!=branches.end();++it){\n\t\t\tif (needsDelivery((*it)->getStatus())) {\n\t\t\t\tawaiting_responses=true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (!awaiting_responses){\n\t\tshared_ptr<BranchInfo> br=findBestBranch(sUrgentCodes);\n\t\tif (br){\n\t\t\tforwardResponse(br);\n\t\t}\n\t\tsetFinished();\n\t}\n}\n\nvoid ForkMessageContext::logDeliveryEvent(const std::shared_ptr<BranchInfo> &br, const shared_ptr<ResponseSipEvent> &event){\n\tsip_t *sip = event->getMsgSip()->getSip();\n\tauto log=make_shared<MessageLog>(MessageLog::Delivery,sip->sip_from,sip->sip_to,sip->sip_call_id);\n\tlog->setDestination(br->mRequest->getMsgSip()->getSip()->sip_request->rq_url);\n\tlog->setStatusCode(sip->sip_status->st_status,sip->sip_status->st_phrase);\n\tlog->setCompleted();\n\tevent->setEventLog(log);\n\tevent->flushLog();\n}\n\nvoid ForkMessageContext::onResponse(const std::shared_ptr<BranchInfo> &br, const shared_ptr<ResponseSipEvent> &event) {\n\tsip_t *sip = event->getMsgSip()->getSip();\n\tint code=sip->sip_status->st_status;\n\tLOGD(\"ForkMessageContext::onResponse()\");\n\t\n\tif (code > 100 && code < 300) {\n\t\tif (code>=200){\n\t\t\tmDeliveredCount++;\n\t\t\tif (mAcceptanceTimer) {\n\t\t\t\tif (mIncoming) logReceptionEvent(event); \/*in the sender's log will appear the status code from the receiver*\/\n\t\t\t\tsu_timer_destroy(mAcceptanceTimer);\n\t\t\t\tmAcceptanceTimer=NULL;\n\t\t\t}\n\t\t}\n\t\tlogDeliveryEvent(br,event);\n\t\tforwardResponse(br);\n\t}else logDeliveryEvent(br,event);\n\tcheckFinished();\n}\n\nvoid ForkMessageContext::logReceptionEvent(const shared_ptr<ResponseSipEvent> &ev){\n\tsip_t *sip=ev->getMsgSip()->getSip();\n\tauto log=make_shared<MessageLog>(MessageLog::Reception,sip->sip_from,sip->sip_to,sip->sip_call_id);\n\tlog->setStatusCode(sip->sip_status->st_status,sip->sip_status->st_phrase);\n\tlog->setCompleted();\n\tev->setEventLog(log);\n\tev->flushLog();\n}\n\n\/*we are called here if no good response has been received from any branch, in fork-late mode only *\/\nvoid ForkMessageContext::acceptMessage(){\n\tif (mIncoming==NULL) return;\n\t\n\t\/*in fork late mode, never answer a service unavailable*\/\n\tshared_ptr<MsgSip> msgsip(mIncoming->createResponse(SIP_202_ACCEPTED));\n\tshared_ptr<ResponseSipEvent> ev(new ResponseSipEvent(dynamic_pointer_cast<OutgoingAgent>(mAgent->shared_from_this()), msgsip));\n\tforwardResponse(ev);\n\tlogReceptionEvent(ev); \/*in the sender's log will appear the 202 accepted from flexisip server*\/\n}\n\nvoid ForkMessageContext::onAcceptanceTimer(){\n\tLOGD(\"ForkMessageContext::onAcceptanceTimer()\");\n\tacceptMessage();\n\tsu_timer_destroy(mAcceptanceTimer);\n\tmAcceptanceTimer=NULL;\n}\n\nvoid ForkMessageContext::sOnAcceptanceTimer(su_root_magic_t* magic, su_timer_t* t, su_timer_arg_t* arg){\n\tstatic_cast<ForkMessageContext*>(arg)->onAcceptanceTimer();\n}\n\nbool isMessageARCSFileTransferMessage(shared_ptr<RequestSipEvent> &ev) {\n\tsip_t* sip = ev->getSip();\n\tif (strncasecmp(sip->sip_request->rq_method_name, \"MESSAGE\", strlen(sip->sip_request->rq_method_name)) == 0) {\n\t\tSLOGD << \"Found message with c_type \" << sip->sip_content_type->c_type;\n\t\tif (sip->sip_content_type->c_type && strcasecmp (sip->sip_content_type->c_type, \"application\/vnd.gsma.rcs-ft-http+xml\")==0) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool isConversionFromRcsToExternalBodyUrlNeeded(shared_ptr<ExtendedContact> &ec) {\n\tlist<string> acceptHeaders = ec->mAcceptHeader;\n\tif (acceptHeaders.size() == 0) {\n\t\tSLOGD << \"No accept header found for contact\";\n\t\treturn true;\n\t}\n\t\n\tfor (auto it = acceptHeaders.begin(); it != acceptHeaders.end(); ++it) {\n\t\tstring header = *it;\n\t\tif (header.compare(\"application\/vnd.gsma.rcs-ft-http+xml\") == 0) {\n\t\t\treturn false;\n\t\t}\n\t}\n\tSLOGD << \"No accept header for RCS file transfer found for contact\";\n\treturn true;\n}\n\nvoid ForkMessageContext::onNewBranch(const shared_ptr<BranchInfo> &br) {\n\tSLOGD << \"Fork message context onNewBranch\";\n\tif (br->mUid.size()>0){\n\t\t\/*check for a branch already existing with this uid, and eventually clean it*\/\n\t\tshared_ptr<BranchInfo> tmp=findBranchByUid(br->mUid);\n\t\tif (tmp){\n\t\t\tremoveBranch(tmp);\n\t\t}\n\t} else SLOGE << \"No unique id found for contact\";\n\t\n\t\/\/ Convert a RCS file transfer message to an external body url message if contact doesn't support it\n\tshared_ptr<RequestSipEvent> &ev = br->mRequest;\n\tif (ev && isMessageARCSFileTransferMessage(ev)) {\n\t\tSLOGD << \"Found RCS file transfer message\";\n\t\tshared_ptr<ExtendedContact> &ec = br->mContact;\n\t\tif (ec && isConversionFromRcsToExternalBodyUrlNeeded(ec)) {\n\t\t\tSLOGD << \"Found RCS file transfer message sent to a client that doesn't support RCS, let's rewrite it\";\n\t\t\tsip_t *sip = ev->getSip();\n\t\t\tif (sip) {\n\t\t\t\tsip_payload_t *payload = sip->sip_payload;\n\t\t\t\t\n\t\t\t\txercesc::XMLPlatformUtils::Initialize();\n\t\t\t\tif (payload) {\n\t\t\t\t\tstd::unique_ptr<fthttp::File> file_transfer_infos = NULL;\n\t\t\t\t\tchar *file_url = NULL;\n\t\t\t\t\t\n\t\t\t\t\ttry {\n\t\t\t\t\t\tistringstream data(payload->pl_data);\n\t\t\t\t\t\tfile_transfer_infos = parseFile(data, xml_schema::Flags::dont_validate);\n\t\t\t\t\t} catch (const xml_schema::Exception& e) {\n\t\t\t\t\t\tSLOGE << \"Can't parse the content of the message\";\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (file_transfer_infos != NULL) {\n\t\t\t\t\t\tFile::File_infoSequence &infos = file_transfer_infos->getFile_info();\n\t\t\t\t\t\tif (infos.size() >= 1) {\n\t\t\t\t\t\t\tfor (File::File_infoConstIterator i (infos.begin()); i != infos.end(); ++i) {\n\t\t\t\t\t\t\t\tconst File::File_infoType &info = (*i);\n\t\t\t\t\t\t\t\tconst File_info::DataType &data = info.getData();\n\t\t\t\t\t\t\t\tconst Data::UrlType &url = data.getUrl();\n\t\t\t\t\t\t\t\tfile_url = (char *)url.c_str();\n\t\t\t\t\t\t\t\tbreak;\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\tif (file_url) {\n\t\t\t\t\t\tchar new_content_type[256];\n\t\t\t\t\t\tsip->sip_payload = sip_payload_make(ev->getHome(), NULL);\n\t\t\t\t\t\tsip->sip_content_length = sip_content_length_make(ev->getHome(), 0);\n\t\t\t\t\t\tsprintf(new_content_type, \"message\/external-body;access-type=URL;URL=\\\"%s\\\"\", file_url);\n\t\t\t\t\t\tsip->sip_content_type = sip_content_type_make(ev->getHome(), new_content_type);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\txercesc::XMLPlatformUtils::Terminate();\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool ForkMessageContext::onNewRegister(const url_t *dest, const string &uid){\n\tbool already_have_transaction=!ForkContext::onNewRegister(dest,uid);\n\tif (already_have_transaction) return false;\n\tif (uid.size()>0){\n\t\tshared_ptr<BranchInfo> br=findBranchByUid(uid);\n\t\tif (br==NULL){\n\t\t\t\/\/this is a new client instance or a client for which the message wasn't delivered yet. The message needs to be delivered.\n\t\t\tLOGD(\"ForkMessageContext::onNewRegister(): this is a new client instance.\");\n\t\t\treturn true;\n\t\t}else if (needsDelivery(br->getStatus())){\n\t\t\t\/\/this is a new client instance or a client for which the message wasn't delivered yet. The message needs to be delivered.\n\t\t\tLOGD(\"ForkMessageContext::onNewRegister(): this client is reconnecting but was not delivered before.\");\n\t\t\treturn true;\n\t\t}\n\t}\n\t\/\/in all other case we can accept a new transaction only if the message hasn't been delivered already.\n\tLOGD(\"Message has been delivered %i times.\",mDeliveredCount);\n\treturn mDeliveredCount==0;\n}\n\n<commit_msg>Revert \"Added logs to check if everything behave as expected\"<commit_after>\/*\n Flexisip, a flexible SIP proxy server with media capabilities.\n Copyright (C) 2012  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 \"forkmessagecontext.hh\"\n#include \"registrardb.hh\"\n#include \"common.hh\"\n#include <algorithm>\n#include <sofia-sip\/sip_status.h>\n#include <sofia-sip\/msg_types.h>\n#include \"xml\/fthttp.hxx\"\n#include <xercesc\/util\/PlatformUtils.hpp>\n\nusing namespace ::std;\nusing namespace fthttp;\n\nstatic bool needsDelivery(int code){\n\treturn code<200 || code==503 || code==408;\n}\n\nForkMessageContext::ForkMessageContext(Agent *agent, const std::shared_ptr<RequestSipEvent> &event, shared_ptr<ForkContextConfig> cfg, ForkContextListener* listener) :\n\t\tForkContext(agent, event,cfg,listener) {\n\tLOGD(\"New ForkMessageContext %p\", this);\n\tmAcceptanceTimer=NULL;\n\t\/\/start the acceptance timer immediately\n\tif (mCfg->mForkLate && mCfg->mDeliveryTimeout>30){\n\t\tmAcceptanceTimer=su_timer_create(su_root_task(mAgent->getRoot()), 0);\n\t\tsu_timer_set_interval(mAcceptanceTimer, &ForkMessageContext::sOnAcceptanceTimer, this, (su_duration_t)mCfg->mUrgentTimeout*1000);\n\t}\n\tmDeliveredCount=0;\n}\n\nForkMessageContext::~ForkMessageContext() {\n\tif (mAcceptanceTimer)\n\t\tsu_timer_destroy(mAcceptanceTimer);\n\tLOGD(\"Destroy ForkMessageContext %p\", this);\n}\n\nbool ForkMessageContext::shouldFinish() {\n\treturn false; \/\/the messaging fork context controls its termination.\n}\n\n\nvoid ForkMessageContext::checkFinished(){\n\tif (mIncoming==NULL && !mCfg->mForkLate){\n\t\tsetFinished();\n\t\treturn;\n\t}\n\t\n\tauto branches=getBranches();\n\tbool awaiting_responses=false;\n\t\n\tif (!mCfg->mForkLate){\n\t\tawaiting_responses=!allBranchesAnswered();\n\t}else{\n\t\tfor(auto it=branches.begin();it!=branches.end();++it){\n\t\t\tif (needsDelivery((*it)->getStatus())) {\n\t\t\t\tawaiting_responses=true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (!awaiting_responses){\n\t\tshared_ptr<BranchInfo> br=findBestBranch(sUrgentCodes);\n\t\tif (br){\n\t\t\tforwardResponse(br);\n\t\t}\n\t\tsetFinished();\n\t}\n}\n\nvoid ForkMessageContext::logDeliveryEvent(const std::shared_ptr<BranchInfo> &br, const shared_ptr<ResponseSipEvent> &event){\n\tsip_t *sip = event->getMsgSip()->getSip();\n\tauto log=make_shared<MessageLog>(MessageLog::Delivery,sip->sip_from,sip->sip_to,sip->sip_call_id);\n\tlog->setDestination(br->mRequest->getMsgSip()->getSip()->sip_request->rq_url);\n\tlog->setStatusCode(sip->sip_status->st_status,sip->sip_status->st_phrase);\n\tlog->setCompleted();\n\tevent->setEventLog(log);\n\tevent->flushLog();\n}\n\nvoid ForkMessageContext::onResponse(const std::shared_ptr<BranchInfo> &br, const shared_ptr<ResponseSipEvent> &event) {\n\tsip_t *sip = event->getMsgSip()->getSip();\n\tint code=sip->sip_status->st_status;\n\tLOGD(\"ForkMessageContext::onResponse()\");\n\t\n\tif (code > 100 && code < 300) {\n\t\tif (code>=200){\n\t\t\tmDeliveredCount++;\n\t\t\tif (mAcceptanceTimer) {\n\t\t\t\tif (mIncoming) logReceptionEvent(event); \/*in the sender's log will appear the status code from the receiver*\/\n\t\t\t\tsu_timer_destroy(mAcceptanceTimer);\n\t\t\t\tmAcceptanceTimer=NULL;\n\t\t\t}\n\t\t}\n\t\tlogDeliveryEvent(br,event);\n\t\tforwardResponse(br);\n\t}else logDeliveryEvent(br,event);\n\tcheckFinished();\n}\n\nvoid ForkMessageContext::logReceptionEvent(const shared_ptr<ResponseSipEvent> &ev){\n\tsip_t *sip=ev->getMsgSip()->getSip();\n\tauto log=make_shared<MessageLog>(MessageLog::Reception,sip->sip_from,sip->sip_to,sip->sip_call_id);\n\tlog->setStatusCode(sip->sip_status->st_status,sip->sip_status->st_phrase);\n\tlog->setCompleted();\n\tev->setEventLog(log);\n\tev->flushLog();\n}\n\n\/*we are called here if no good response has been received from any branch, in fork-late mode only *\/\nvoid ForkMessageContext::acceptMessage(){\n\tif (mIncoming==NULL) return;\n\t\n\t\/*in fork late mode, never answer a service unavailable*\/\n\tshared_ptr<MsgSip> msgsip(mIncoming->createResponse(SIP_202_ACCEPTED));\n\tshared_ptr<ResponseSipEvent> ev(new ResponseSipEvent(dynamic_pointer_cast<OutgoingAgent>(mAgent->shared_from_this()), msgsip));\n\tforwardResponse(ev);\n\tlogReceptionEvent(ev); \/*in the sender's log will appear the 202 accepted from flexisip server*\/\n}\n\nvoid ForkMessageContext::onAcceptanceTimer(){\n\tLOGD(\"ForkMessageContext::onAcceptanceTimer()\");\n\tacceptMessage();\n\tsu_timer_destroy(mAcceptanceTimer);\n\tmAcceptanceTimer=NULL;\n}\n\nvoid ForkMessageContext::sOnAcceptanceTimer(su_root_magic_t* magic, su_timer_t* t, su_timer_arg_t* arg){\n\tstatic_cast<ForkMessageContext*>(arg)->onAcceptanceTimer();\n}\n\nbool isMessageARCSFileTransferMessage(shared_ptr<RequestSipEvent> &ev) {\n\tsip_t* sip = ev->getSip();\n\tif (strncasecmp(sip->sip_request->rq_method_name, \"MESSAGE\", strlen(sip->sip_request->rq_method_name)) == 0) {\n\t\tif (sip->sip_content_type->c_type && strcasecmp (sip->sip_content_type->c_type, \"application\/vnd.gsma.rcs-ft-http+xml\")==0) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool isConversionFromRcsToExternalBodyUrlNeeded(shared_ptr<ExtendedContact> &ec) {\n\tlist<string> acceptHeaders = ec->mAcceptHeader;\n\tif (acceptHeaders.size() == 0) {\n\t\treturn true;\n\t}\n\t\n\tfor (auto it = acceptHeaders.begin(); it != acceptHeaders.end(); ++it) {\n\t\tstring header = *it;\n\t\tif (header.compare(\"application\/vnd.gsma.rcs-ft-http+xml\") == 0) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid ForkMessageContext::onNewBranch(const shared_ptr<BranchInfo> &br) {\n\tif (br->mUid.size()>0){\n\t\t\/*check for a branch already existing with this uid, and eventually clean it*\/\n\t\tshared_ptr<BranchInfo> tmp=findBranchByUid(br->mUid);\n\t\tif (tmp){\n\t\t\tremoveBranch(tmp);\n\t\t}\n\t} else SLOGE << \"No unique id found for contact\";\n\t\n\t\/\/ Convert a RCS file transfer message to an external body url message if contact doesn't support it\n\tshared_ptr<RequestSipEvent> &ev = br->mRequest;\n\tif (ev && isMessageARCSFileTransferMessage(ev)) {\n\t\tshared_ptr<ExtendedContact> &ec = br->mContact;\n\t\tif (ec && isConversionFromRcsToExternalBodyUrlNeeded(ec)) {\n\t\t\tsip_t *sip = ev->getSip();\n\t\t\tif (sip) {\n\t\t\t\tsip_payload_t *payload = sip->sip_payload;\n\t\t\t\t\n\t\t\t\txercesc::XMLPlatformUtils::Initialize();\n\t\t\t\tif (payload) {\n\t\t\t\t\tstd::unique_ptr<fthttp::File> file_transfer_infos = NULL;\n\t\t\t\t\tchar *file_url = NULL;\n\t\t\t\t\t\n\t\t\t\t\ttry {\n\t\t\t\t\t\tistringstream data(payload->pl_data);\n\t\t\t\t\t\tfile_transfer_infos = parseFile(data, xml_schema::Flags::dont_validate);\n\t\t\t\t\t} catch (const xml_schema::Exception& e) {\n\t\t\t\t\t\tSLOGE << \"Can't parse the content of the message\";\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (file_transfer_infos != NULL) {\n\t\t\t\t\t\tFile::File_infoSequence &infos = file_transfer_infos->getFile_info();\n\t\t\t\t\t\tif (infos.size() >= 1) {\n\t\t\t\t\t\t\tfor (File::File_infoConstIterator i (infos.begin()); i != infos.end(); ++i) {\n\t\t\t\t\t\t\t\tconst File::File_infoType &info = (*i);\n\t\t\t\t\t\t\t\tconst File_info::DataType &data = info.getData();\n\t\t\t\t\t\t\t\tconst Data::UrlType &url = data.getUrl();\n\t\t\t\t\t\t\t\tfile_url = (char *)url.c_str();\n\t\t\t\t\t\t\t\tbreak;\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\tif (file_url) {\n\t\t\t\t\t\tchar new_content_type[256];\n\t\t\t\t\t\tsip->sip_payload = sip_payload_make(ev->getHome(), NULL);\n\t\t\t\t\t\tsip->sip_content_length = sip_content_length_make(ev->getHome(), 0);\n\t\t\t\t\t\tsprintf(new_content_type, \"message\/external-body;access-type=URL;URL=\\\"%s\\\"\", file_url);\n\t\t\t\t\t\tsip->sip_content_type = sip_content_type_make(ev->getHome(), new_content_type);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\txercesc::XMLPlatformUtils::Terminate();\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool ForkMessageContext::onNewRegister(const url_t *dest, const string &uid){\n\tbool already_have_transaction=!ForkContext::onNewRegister(dest,uid);\n\tif (already_have_transaction) return false;\n\tif (uid.size()>0){\n\t\tshared_ptr<BranchInfo> br=findBranchByUid(uid);\n\t\tif (br==NULL){\n\t\t\t\/\/this is a new client instance or a client for which the message wasn't delivered yet. The message needs to be delivered.\n\t\t\tLOGD(\"ForkMessageContext::onNewRegister(): this is a new client instance.\");\n\t\t\treturn true;\n\t\t}else if (needsDelivery(br->getStatus())){\n\t\t\t\/\/this is a new client instance or a client for which the message wasn't delivered yet. The message needs to be delivered.\n\t\t\tLOGD(\"ForkMessageContext::onNewRegister(): this client is reconnecting but was not delivered before.\");\n\t\t\treturn true;\n\t\t}\n\t}\n\t\/\/in all other case we can accept a new transaction only if the message hasn't been delivered already.\n\tLOGD(\"Message has been delivered %i times.\",mDeliveredCount);\n\treturn mDeliveredCount==0;\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 main.cxx\n *\n * An application which acts as an openlcb hub with the GC protocol.\n *\n * @author Balazs Racz\n * @date 3 Aug 2013\n *\/\n\n#include <stdio.h>\n#include <unistd.h>\n\n#include <memory>\n\n#include \"os\/os.h\"\n#include \"utils\/Hub.hxx\"\n#include \"utils\/GridConnectHub.hxx\"\n#include \"utils\/GcTcpHub.hxx\"\n#include \"executor\/Executor.hxx\"\n#include \"executor\/Service.hxx\"\n\nExecutor<1> g_executor(\"g_executor\", 0, 1024);\nService g_service(&g_executor);\nCanHubFlow can_hub0(&g_service);\nGcPacketPrinter packet_printer(&can_hub0);\n\nextern \"C\" {\nextern int GC_GENERATE_NEWLINES;\nint GC_GENERATE_NEWLINES = 1;\n}\n\n\/** Entry point to application.\n * @param argc number of command line arguments\n * @param argv array of command line arguments\n * @return 0, should never return\n *\/\nint appl_main(int argc, char *argv[])\n{\n    GcTcpHub hub(&can_hub0, 12021);\n    while (1)\n    {\n        sleep(1);\n    }\n    return 0;\n}\n<commit_msg>Fixes override to gridconnect-generate-newlines.<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 main.cxx\n *\n * An application which acts as an openlcb hub with the GC protocol.\n *\n * @author Balazs Racz\n * @date 3 Aug 2013\n *\/\n\n#include <stdio.h>\n#include <unistd.h>\n\n#include <memory>\n\n#include \"os\/os.h\"\n#include \"utils\/constants.hxx\"\n#include \"utils\/Hub.hxx\"\n#include \"utils\/GridConnectHub.hxx\"\n#include \"utils\/GcTcpHub.hxx\"\n#include \"executor\/Executor.hxx\"\n#include \"executor\/Service.hxx\"\n\nExecutor<1> g_executor(\"g_executor\", 0, 1024);\nService g_service(&g_executor);\nCanHubFlow can_hub0(&g_service);\nGcPacketPrinter packet_printer(&can_hub0);\n\nOVERRIDE_CONST(gc_generate_newlines, 1);\n\n\/** Entry point to application.\n * @param argc number of command line arguments\n * @param argv array of command line arguments\n * @return 0, should never return\n *\/\nint appl_main(int argc, char *argv[])\n{\n    GcTcpHub hub(&can_hub0, 12021);\n    while (1)\n    {\n        sleep(1);\n    }\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"logger.h\"\n#include \"text\/table.h\"\n#include \"text\/config.h\"\n#include \"math\/numeric.h\"\n#include \"text\/cmdline.h\"\n#include \"chrono\/measure.h\"\n#include \"layers\/affine3d.h\"\n#include \"layers\/affine4d.h\"\n#include <iostream>\n\nusing namespace nano;\n\nnamespace nano\n{\n        template <typename tvalue>\n        string_t serialize_to_string(const tvalue value)\n        {\n                std::stringstream s;\n                s << value;\n                return s.str();\n        }\n\n        template <> string_t to_string<tensor2d_dims_t>(const tensor2d_dims_t dims) { return serialize_to_string(dims); }\n        template <> string_t to_string<tensor3d_dims_t>(const tensor3d_dims_t dims) { return serialize_to_string(dims); }\n        template <> string_t to_string<tensor4d_dims_t>(const tensor4d_dims_t dims) { return serialize_to_string(dims); }\n}\n\nnamespace\n{\n        const auto trials = size_t(16);\n\n        template <typename top, typename tidata, typename twdata, typename tbdata, typename todata>\n        auto measure_output(top& op, const tidata& idata, const twdata& wdata, const tbdata& bdata, todata& odata)\n        {\n                const auto duration = measure<nanoseconds_t>([&] () { op.output(idata, wdata, bdata, odata); }, trials);\n                return nano::gflops(op.params().flops_output(), duration);\n        }\n\n        template <typename top, typename tidata, typename twdata, typename tbdata, typename todata>\n        auto measure_ginput(top& op, tidata& idata, const twdata& wdata, const tbdata& bdata, const todata& odata)\n        {\n                const auto duration = measure<nanoseconds_t>([&] () { op.ginput(idata, wdata, bdata, odata); }, trials);\n                return nano::gflops(op.params().flops_ginput(), duration);\n        }\n\n        template <typename top, typename tidata, typename twdata, typename tbdata, typename todata>\n        auto measure_gparam(top& op, const tidata& idata, twdata& wdata, tbdata& bdata, const todata& odata)\n        {\n                const auto duration = measure<nanoseconds_t>([&] () { op.gparam(idata, wdata, bdata, odata); }, trials);\n                return nano::gflops(op.params().flops_gparam(), duration);\n        }\n}\n\nint main(int argc, const char *argv[])\n{\n        \/\/ parse the command line\n        cmdline_t cmdline(\"benchmark affine operators\");\n        cmdline.add(\"\", \"min-isize\",    \"minimum input size [32, 1024]\", \"1024\");\n        cmdline.add(\"\", \"max-isize\",    \"maximum input size [32, 4096]\", \"4096\");\n        cmdline.add(\"\", \"min-osize\",    \"minimum output size [32, 1024]\", \"1024\");\n        cmdline.add(\"\", \"max-osize\",    \"maximum output size [32, 4096]\", \"4096\");\n        cmdline.add(\"\", \"min-count\",    \"minimum number of samples in minibatch [1, 16]\", \"1\");\n        cmdline.add(\"\", \"max-count\",    \"maximum number of samples in minibatch [1, 32]\", \"16\");\n\n        cmdline.process(argc, argv);\n\n        \/\/ check arguments and options\n        const auto cmd_min_isize = clamp(cmdline.get<int>(\"min-isize\"), 32, 1024);\n        const auto cmd_max_isize = clamp(cmdline.get<int>(\"max-isize\"), cmd_min_isize, 4096);\n        const auto cmd_min_osize = clamp(cmdline.get<int>(\"min-osize\"), 32, 1024);\n        const auto cmd_max_osize = clamp(cmdline.get<int>(\"max-osize\"), cmd_min_osize, 4096);\n        const auto cmd_min_count = clamp(cmdline.get<int>(\"min-count\"), 1, 16);\n        const auto cmd_max_count = clamp(cmdline.get<int>(\"max-count\"), cmd_min_count, 32);\n\n        table_t table;\n        table.header()\n                << \"\" << \"\" << \"\" << \"\"\n                << \"output\" << \"ginput\" << \"gparam\"\n                << \"+naive\" << \"ginput\" << \"gparam\"\n                << \"+dmaps\" << \"ginput\" << \"gparam\"\n                << \"+dense\" << \"ginput\" << \"gparam\";\n\n        table.append()\n                << \"isize\" << \"config\" << \"osize\" << \"#params\"\n                << \"#kflops\" << \"#kflops\" << \"#kflops\"\n                << \"gflop\/s\" << \"gflop\/s\" << \"gflop\/s\"\n                << \"gflop\/s\" << \"gflop\/s\" << \"gflop\/s\"\n                << \"gflop\/s\" << \"gflop\/s\" << \"gflop\/s\";\n\n        table.append(table_row_t::storage::delim);\n\n        \/\/ benchmark for different input-output sizes and number of samples in a minibatch\n        for (auto isize = cmd_min_isize; isize <= cmd_max_isize; isize *= 2)\n        {\n                for (auto osize = cmd_min_osize; osize <= cmd_max_osize; osize *= 2)\n                {\n                        for (auto count = cmd_min_count; count <= cmd_max_count; count *= 2)\n                        {\n                                const auto params = affine_params_t{isize, 1, 1, osize, 1, 1};\n                                const auto kflops_output = params.flops_output() \/ 1024;\n                                const auto kflops_ginput = params.flops_ginput() \/ 1024;\n                                const auto kflops_gparam = params.flops_gparam() \/ 1024;\n\n                                const auto config = to_params(\"dims\", osize);\n\n                                auto wdata = params.make_wdata(); wdata.setRandom();\n                                auto bdata = params.make_bdata(); bdata.setRandom();\n                                auto idata = params.make_idata(count); idata.vector().setRandom();\n                                auto odata = params.make_odata(count); odata.vector().setRandom();\n\n                                \/\/ 3D implementation\n                                auto op3d = affine3d_t{params};\n                                const auto gf3d_output = measure_output(op3d, idata, wdata, bdata, odata);\n                                const auto gf3d_ginput = measure_ginput(op3d, idata, wdata, bdata, odata);\n                                const auto gf3d_gparam = measure_gparam(op3d, idata, wdata, bdata, odata);\n\n                                \/\/ 4D implementation\n                                auto op4d = affine4d_t{params};\n                                const auto gf4d_output = measure_output(op4d, idata, wdata, bdata, odata);\n                                const auto gf4d_ginput = measure_ginput(op4d, idata, wdata, bdata, odata);\n                                const auto gf4d_gparam = measure_gparam(op4d, idata, wdata, bdata, odata);\n\n                                table.append()\n                                        << tensor3d_dims_t{params.imaps(), params.irows(), params.icols()}\n                                        << config\n                                        << tensor3d_dims_t{params.omaps(), params.orows(), params.ocols()}\n                                        << params.psize()\n                                        << kflops_output << kflops_ginput << kflops_gparam\n                                        << gf3d_output << gf3d_ginput << gf3d_gparam\n                                        << gf4d_output << gf4d_ginput << gf4d_gparam;\n                        }\n                }\n        }\n\n        \/\/ print results\n        std::cout << table;\n\n        \/\/ OK\n        return EXIT_SUCCESS;\n}\n<commit_msg>polish benchmark<commit_after>#include \"logger.h\"\n#include \"text\/table.h\"\n#include \"text\/config.h\"\n#include \"math\/numeric.h\"\n#include \"text\/cmdline.h\"\n#include \"chrono\/measure.h\"\n#include \"layers\/affine3d.h\"\n#include \"layers\/affine4d.h\"\n#include <iostream>\n\nusing namespace nano;\n\nnamespace nano\n{\n        template <typename tvalue>\n        string_t serialize_to_string(const tvalue value)\n        {\n                std::stringstream s;\n                s << value;\n                return s.str();\n        }\n\n        template <> string_t to_string<tensor2d_dims_t>(const tensor2d_dims_t dims) { return serialize_to_string(dims); }\n        template <> string_t to_string<tensor3d_dims_t>(const tensor3d_dims_t dims) { return serialize_to_string(dims); }\n        template <> string_t to_string<tensor4d_dims_t>(const tensor4d_dims_t dims) { return serialize_to_string(dims); }\n}\n\nnamespace\n{\n        const auto trials = size_t(16);\n\n        template <typename top, typename tidata, typename twdata, typename tbdata, typename todata>\n        auto measure_output(top& op, const tidata& idata, const twdata& wdata, const tbdata& bdata, todata& odata)\n        {\n                const auto count = idata.template size<0>();\n                const auto duration = measure<nanoseconds_t>([&] () { op.output(idata, wdata, bdata, odata); }, trials);\n                return nano::gflops(op.params().flops_output() * count, duration);\n        }\n\n        template <typename top, typename tidata, typename twdata, typename tbdata, typename todata>\n        auto measure_ginput(top& op, tidata& idata, const twdata& wdata, const tbdata& bdata, const todata& odata)\n        {\n                const auto count = idata.template size<0>();\n                const auto duration = measure<nanoseconds_t>([&] () { op.ginput(idata, wdata, bdata, odata); }, trials);\n                return nano::gflops(op.params().flops_ginput() * count, duration);\n        }\n\n        template <typename top, typename tidata, typename twdata, typename tbdata, typename todata>\n        auto measure_gparam(top& op, const tidata& idata, twdata& wdata, tbdata& bdata, const todata& odata)\n        {\n                const auto count = idata.template size<0>();\n                const auto duration = measure<nanoseconds_t>([&] () { op.gparam(idata, wdata, bdata, odata); }, trials);\n                return nano::gflops(op.params().flops_gparam() * count, duration);\n        }\n}\n\nint main(int argc, const char *argv[])\n{\n        \/\/ parse the command line\n        cmdline_t cmdline(\"benchmark affine operators\");\n        cmdline.add(\"\", \"min-isize\",    \"minimum input size [32, 1024]\", \"512\");\n        cmdline.add(\"\", \"max-isize\",    \"maximum input size [32, 4096]\", \"1024\");\n        cmdline.add(\"\", \"min-osize\",    \"minimum output size [32, 1024]\", \"512\");\n        cmdline.add(\"\", \"max-osize\",    \"maximum output size [32, 4096]\", \"1024\");\n        cmdline.add(\"\", \"min-count\",    \"minimum number of samples in minibatch [1, 16]\", \"1\");\n        cmdline.add(\"\", \"max-count\",    \"maximum number of samples in minibatch [1, 64]\", \"32\");\n\n        cmdline.process(argc, argv);\n\n        \/\/ check arguments and options\n        const auto cmd_min_isize = clamp(cmdline.get<int>(\"min-isize\"), 32, 1024);\n        const auto cmd_max_isize = clamp(cmdline.get<int>(\"max-isize\"), cmd_min_isize, 4096);\n        const auto cmd_min_osize = clamp(cmdline.get<int>(\"min-osize\"), 32, 1024);\n        const auto cmd_max_osize = clamp(cmdline.get<int>(\"max-osize\"), cmd_min_osize, 4096);\n        const auto cmd_min_count = clamp(cmdline.get<int>(\"min-count\"), 1, 16);\n        const auto cmd_max_count = clamp(cmdline.get<int>(\"max-count\"), cmd_min_count, 64);\n\n        table_t table;\n        table.header()\n                << \"\" << \"\" << \"\" << \"\"\n                << \"output\" << \"ginput\" << \"gparam\"\n                << \"+3d\" << \"ginput\" << \"gparam\"\n                << \"+4d\" << \"ginput\" << \"gparam\";\n\n        table.append()\n                << \"isize\" << \"config\" << \"osize\" << \"#params\"\n                << \"#kflops\" << \"#kflops\" << \"#kflops\"\n                << \"gflop\/s\" << \"gflop\/s\" << \"gflop\/s\"\n                << \"gflop\/s\" << \"gflop\/s\" << \"gflop\/s\";\n\n        table.append(table_row_t::storage::delim);\n\n        \/\/ benchmark for different input-output sizes and number of samples in a minibatch\n        for (auto isize = cmd_min_isize; isize <= cmd_max_isize; isize *= 2)\n        {\n                for (auto osize = cmd_min_osize; osize <= cmd_max_osize; osize *= 2)\n                {\n                        for (auto count = cmd_min_count; count <= cmd_max_count; count *= 2)\n                        {\n                                const auto params = affine_params_t{isize, 1, 1, osize, 1, 1};\n                                const auto kflops_output = params.flops_output() \/ 1024;\n                                const auto kflops_ginput = params.flops_ginput() \/ 1024;\n                                const auto kflops_gparam = params.flops_gparam() \/ 1024;\n\n                                const auto config = to_params(\"isize\", isize, \"osize\", osize, \"count\", count);\n\n                                auto wdata = params.make_wdata(); wdata.setRandom();\n                                auto bdata = params.make_bdata(); bdata.setRandom();\n                                auto idata = params.make_idata(count); idata.vector().setRandom();\n                                auto odata = params.make_odata(count); odata.vector().setRandom();\n\n                                \/\/ 3D implementation\n                                auto op3d = affine3d_t{params};\n                                const auto gf3d_output = measure_output(op3d, idata, wdata, bdata, odata);\n                                const auto gf3d_ginput = measure_ginput(op3d, idata, wdata, bdata, odata);\n                                const auto gf3d_gparam = measure_gparam(op3d, idata, wdata, bdata, odata);\n\n                                \/\/ 4D implementation\n                                auto op4d = affine4d_t{params};\n                                const auto gf4d_output = measure_output(op4d, idata, wdata, bdata, odata);\n                                const auto gf4d_ginput = measure_ginput(op4d, idata, wdata, bdata, odata);\n                                const auto gf4d_gparam = measure_gparam(op4d, idata, wdata, bdata, odata);\n\n                                table.append()\n                                        << tensor3d_dims_t{params.imaps(), params.irows(), params.icols()}\n                                        << config\n                                        << tensor3d_dims_t{params.omaps(), params.orows(), params.ocols()}\n                                        << params.psize()\n                                        << kflops_output << kflops_ginput << kflops_gparam\n                                        << gf3d_output << gf3d_ginput << gf3d_gparam\n                                        << gf4d_output << gf4d_ginput << gf4d_gparam;\n                        }\n\n                        if (osize * 2 <= cmd_max_osize)\n                        {\n                                table.append(table_row_t::storage::delim);\n                        }\n                }\n\n                if (isize * 2 <= cmd_max_isize)\n                {\n                        table.append(table_row_t::storage::delim);\n                }\n        }\n\n        \/\/ print results\n        std::cout << table;\n\n        \/\/ OK\n        return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id$\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/   Copyright (c) 2003 Stanislav Shwartsman\n\/\/          Written by Stanislav Shwartsman [sshwarts at sourceforge net]\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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define NEED_CPU_REG_SHORTCUTS 1\n#include \"bochs.h\"\n#include \"cpu\/cpu.h\"\n#define LOG_THIS BX_CPU_THIS_PTR\n\n#if BX_SUPPORT_FPU\n\n#include \"softfloatx80.h\"\n\nconst floatx80 Const_QNaN = packFloatx80(0, floatx80_default_nan_exp, floatx80_default_nan_fraction);\nconst floatx80 Const_Z    = packFloatx80(0, 0x0000, 0);\nconst floatx80 Const_1    = packFloatx80(0, 0x3fff, BX_CONST64(0x8000000000000000));\nconst floatx80 Const_L2T  = packFloatx80(0, 0x4000, BX_CONST64(0xd49a784bcd1b8afe));\nconst floatx80 Const_L2E  = packFloatx80(0, 0x3fff, BX_CONST64(0xb8aa3b295c17f0bc));\nconst floatx80 Const_PI   = packFloatx80(0, 0x4000, BX_CONST64(0xc90fdaa22168c235));\nconst floatx80 Const_LG2  = packFloatx80(0, 0x3ffd, BX_CONST64(0x9a209a84fbcff799));\nconst floatx80 Const_LN2  = packFloatx80(0, 0x3ffe, BX_CONST64(0xb17217f7d1cf79ac));\nconst floatx80 Const_INF  = packFloatx80(0, 0x7fff, BX_CONST64(0x8000000000000000));\n\n\/* A fast way to find out whether x is one of RC_DOWN or RC_CHOP\n   (and not one of RC_RND or RC_UP).\n   *\/\n#define DOWN_OR_CHOP()  (FPU_CONTROL_WORD & FPU_CW_RC & FPU_RC_DOWN)\n\nBX_CPP_INLINE floatx80 FPU_round_const(const floatx80 &a, int adj)\n{\n  floatx80 result = a;\n  result.fraction += adj;\n  return result;\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDL2T(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_L2T, (FPU_CONTROL_WORD == FPU_RC_UP) ? 1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDL2T: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDL2E(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_L2E, DOWN_OR_CHOP() ? -1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDL2E: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDPI(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_PI, DOWN_OR_CHOP() ? -1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDPI: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDLG2(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_LG2, DOWN_OR_CHOP() ? -1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDLG2: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDLN2(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_LN2, DOWN_OR_CHOP() ? -1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDLN2: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLD1(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(Const_1, 0);\n  }\n#else\n  BX_INFO((\"FLD1: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDZ(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(Const_Z, 0);\n  }\n#else\n  BX_INFO((\"FLDZ: required FPU, configure --enable-fpu\"));\n#endif\n}\n\n#endif\n<commit_msg>Fixed FLDL2T instruction<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id$\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/   Copyright (c) 2003 Stanislav Shwartsman\n\/\/          Written by Stanislav Shwartsman [sshwarts at sourceforge net]\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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define NEED_CPU_REG_SHORTCUTS 1\n#include \"bochs.h\"\n#include \"cpu\/cpu.h\"\n#define LOG_THIS BX_CPU_THIS_PTR\n\n#if BX_SUPPORT_FPU\n\n#include \"softfloatx80.h\"\n\nconst floatx80 Const_QNaN = packFloatx80(0, floatx80_default_nan_exp, floatx80_default_nan_fraction);\nconst floatx80 Const_Z    = packFloatx80(0, 0x0000, 0);\nconst floatx80 Const_1    = packFloatx80(0, 0x3fff, BX_CONST64(0x8000000000000000));\nconst floatx80 Const_L2T  = packFloatx80(0, 0x4000, BX_CONST64(0xd49a784bcd1b8afe));\nconst floatx80 Const_L2E  = packFloatx80(0, 0x3fff, BX_CONST64(0xb8aa3b295c17f0bc));\nconst floatx80 Const_PI   = packFloatx80(0, 0x4000, BX_CONST64(0xc90fdaa22168c235));\nconst floatx80 Const_LG2  = packFloatx80(0, 0x3ffd, BX_CONST64(0x9a209a84fbcff799));\nconst floatx80 Const_LN2  = packFloatx80(0, 0x3ffe, BX_CONST64(0xb17217f7d1cf79ac));\nconst floatx80 Const_INF  = packFloatx80(0, 0x7fff, BX_CONST64(0x8000000000000000));\n\n\/* A fast way to find out whether x is one of RC_DOWN or RC_CHOP\n   (and not one of RC_RND or RC_UP).\n   *\/\n#define DOWN_OR_CHOP()  (FPU_CONTROL_WORD & FPU_CW_RC & FPU_RC_DOWN)\n\nBX_CPP_INLINE floatx80 FPU_round_const(const floatx80 &a, int adj)\n{\n  floatx80 result = a;\n  result.fraction += adj;\n  return result;\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDL2T(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_L2T, (FPU_CONTROL_WORD & FPU_CW_RC) == FPU_RC_UP), 0);\n  }\n#else\n  BX_INFO((\"FLDL2T: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDL2E(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_L2E, DOWN_OR_CHOP() ? -1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDL2E: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDPI(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_PI, DOWN_OR_CHOP() ? -1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDPI: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDLG2(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_LG2, DOWN_OR_CHOP() ? -1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDLG2: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDLN2(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(FPU_round_const(Const_LN2, DOWN_OR_CHOP() ? -1 : 0), 0);\n  }\n#else\n  BX_INFO((\"FLDLN2: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLD1(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(Const_1, 0);\n  }\n#else\n  BX_INFO((\"FLD1: required FPU, configure --enable-fpu\"));\n#endif\n}\n\nvoid BX_CPP_AttrRegparmN(1) BX_CPU_C::FLDZ(bxInstruction_c *i)\n{\n#if BX_SUPPORT_FPU\n  BX_CPU_THIS_PTR prepareFPU(i);\n\n  clear_C1();\n\n  if (! IS_TAG_EMPTY(-1))\n  {\n    BX_CPU_THIS_PTR FPU_stack_overflow();\n  }\n  else {\n    BX_CPU_THIS_PTR the_i387.FPU_push();\n    BX_WRITE_FPU_REG(Const_Z, 0);\n  }\n#else\n  BX_INFO((\"FLDZ: required FPU, configure --enable-fpu\"));\n#endif\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2016-2017 Antony Polukhin\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#ifndef BOOST_PFR_DETAIL_IO_HPP\n#define BOOST_PFR_DETAIL_IO_HPP\n#pragma once\n\n#include <boost\/pfr\/detail\/config.hpp>\n\n#include <boost\/pfr\/detail\/sequence_tuple.hpp>\n#include <iosfwd>       \/\/ stream operators\n#include <iomanip>\n\n\/\/ Forward declaration\nnamespace std {\n    template <class CharT, class Traits> class basic_string_view;\n}\n\nnamespace boost { namespace pfr { namespace detail {\n\ninline auto quoted_helper(const std::string& s) noexcept {\n    return std::quoted(s);\n}\n\ntemplate <class CharT, class Traits>\ninline auto quoted_helper(const std::basic_string_view<CharT, Traits>& s) noexcept {\n    return std::quoted(s);\n}\n\ninline auto quoted_helper(std::string& s) noexcept {\n    return std::quoted(s);\n}\n\ntemplate <class T>\ninline decltype(auto) quoted_helper(T&& v) noexcept {\n    return std::forward<T>(v);\n}\n\ntemplate <std::size_t I, std::size_t N>\nstruct print_impl {\n    template <class Stream, class T>\n    static void print (Stream& out, const T& value) {\n        if (!!I) out << \", \";\n        out << quoted_helper(boost::pfr::detail::sequence_tuple::get<I>(value));\n        print_impl<I + 1, N>::print(out, value);\n    }\n\n    template <class Stream, class T>\n    static void print (Stream& out, const std::string& value) {\n        if (!!I) out << \", \";\n        out << std::quoted( boost::pfr::detail::sequence_tuple::get<I>(value) );\n        print_impl<I + 1, N>::print(out, value);\n    }\n};\n\ntemplate <std::size_t I>\nstruct print_impl<I, I> {\n    template <class Stream, class T> static void print (Stream&, const T&) noexcept {}\n};\n\n\ntemplate <std::size_t I, std::size_t N>\nstruct read_impl {\n    template <class Stream, class T>\n    static void read (Stream& in, const T& value) {\n        char ignore = {};\n        if (!!I) {\n            in >> ignore;\n            if (ignore != ',') in.setstate(Stream::failbit);\n            in >> ignore;\n            if (ignore != ' ')  in.setstate(Stream::failbit);\n        }\n        in >> quoted_helper( boost::pfr::detail::sequence_tuple::get<I>(value) );\n        read_impl<I + 1, N>::read(in, value);\n    }\n};\n\ntemplate <std::size_t I>\nstruct read_impl<I, I> {\n    template <class Stream, class T> static void read (Stream&, const T&) {}\n};\n\n}}} \/\/ namespace boost::pfr::detail\n\n#endif \/\/ BOOST_PFR_DETAIL_IO_HPP\n<commit_msg>fixed magic_get fuckup (forward declaration of std::string_view)<commit_after>\/\/ Copyright (c) 2016-2017 Antony Polukhin\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#ifndef BOOST_PFR_DETAIL_IO_HPP\n#define BOOST_PFR_DETAIL_IO_HPP\n#pragma once\n\n#include <boost\/pfr\/detail\/config.hpp>\n\n#include <boost\/pfr\/detail\/sequence_tuple.hpp>\n#include <iosfwd>       \/\/ stream operators\n#include <iomanip>\n#include <string_view>\n\n\/\/ Forward declaration\n\/\/ namespace std {\n\/\/      template <class CharT, class Traits> class basic_string_view;\n\/\/ }\n\nnamespace boost { namespace pfr { namespace detail {\n\ninline auto quoted_helper(const std::string& s) noexcept {\n    return std::quoted(s);\n}\n\ntemplate <class CharT, class Traits>\ninline auto quoted_helper(const std::basic_string_view<CharT, Traits>& s) noexcept {\n    return std::quoted(s);\n}\n\ninline auto quoted_helper(std::string& s) noexcept {\n    return std::quoted(s);\n}\n\ntemplate <class T>\ninline decltype(auto) quoted_helper(T&& v) noexcept {\n    return std::forward<T>(v);\n}\n\ntemplate <std::size_t I, std::size_t N>\nstruct print_impl {\n    template <class Stream, class T>\n    static void print (Stream& out, const T& value) {\n        if (!!I) out << \", \";\n        out << quoted_helper(boost::pfr::detail::sequence_tuple::get<I>(value));\n        print_impl<I + 1, N>::print(out, value);\n    }\n\n    template <class Stream, class T>\n    static void print (Stream& out, const std::string& value) {\n        if (!!I) out << \", \";\n        out << std::quoted( boost::pfr::detail::sequence_tuple::get<I>(value) );\n        print_impl<I + 1, N>::print(out, value);\n    }\n};\n\ntemplate <std::size_t I>\nstruct print_impl<I, I> {\n    template <class Stream, class T> static void print (Stream&, const T&) noexcept {}\n};\n\n\ntemplate <std::size_t I, std::size_t N>\nstruct read_impl {\n    template <class Stream, class T>\n    static void read (Stream& in, const T& value) {\n        char ignore = {};\n        if (!!I) {\n            in >> ignore;\n            if (ignore != ',') in.setstate(Stream::failbit);\n            in >> ignore;\n            if (ignore != ' ')  in.setstate(Stream::failbit);\n        }\n        in >> quoted_helper( boost::pfr::detail::sequence_tuple::get<I>(value) );\n        read_impl<I + 1, N>::read(in, value);\n    }\n};\n\ntemplate <std::size_t I>\nstruct read_impl<I, I> {\n    template <class Stream, class T> static void read (Stream&, const T&) {}\n};\n\n}}} \/\/ namespace boost::pfr::detail\n\n#endif \/\/ BOOST_PFR_DETAIL_IO_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include \"binary_codec.h\"\n\n#include \"memcache_client.h\"\n\nnamespace evmc {\n\nstatic const size_t kHeaderLen = sizeof(protocol_binary_response_header);\n\nvoid BinaryCodec::OnCodecMessage(const evpp::TCPConnPtr& conn,\n                                 evpp::Buffer* buf) {\n    while (buf->size() >= kHeaderLen) { \/\/ kHeaderLen == 24\n        const void* data = buf->data();\n        protocol_binary_response_header resp =\n            *static_cast<const protocol_binary_response_header*>(data);\n        resp.response.bodylen = ntohl(resp.response.bodylen);\n        resp.response.status  = ntohs(resp.response.status);\n        resp.response.keylen  = ntohs(resp.response.keylen);\n\n        if (buf->size() >= resp.response.bodylen + kHeaderLen) {\n            OnResponsePacket(resp, buf);\n        } else {\n            LOG_TRACE << \"need recv more data\";\n            break;\n        }\n    }\n}\n\n\nvoid BinaryCodec::DecodePrefixGetPacket(const protocol_binary_response_header& resp,\n                                        evpp::Buffer* buf, PrefixGetResultPtr& ptr) {\n    const char* pv = buf->data() + sizeof(resp) + resp.response.extlen;\n    uint32_t pos = resp.response.keylen;\n    uint32_t klen = 0;\n    uint32_t vlen = 0;\n    const uint32_t size = resp.response.bodylen - resp.response.keylen - resp.response.extlen;\n    const uint32_t buf_size = buf->size();\n    int ret = resp.response.status;\n    ptr->code = ret;\n    while (pos < size) {\n        if (pos >= buf_size || pos + 4 >= buf_size) {\n            break;\n        }\n        klen = ntohl((*(const uint32_t*)(pv + pos)));\n        pos += 4;\n        if ((pos + klen) >= buf_size) {\n            break;\n        }\n        std::string rkey(pv + pos, klen);\n        pos += klen;\n        if (pos >= buf_size || pos + 4 >= buf_size) {\n            break;\n        }\n        vlen = ntohl(*(const uint32_t*)(pv + pos));\n        pos += 4;\n        if ((pos + vlen) >= buf_size) {\n            break;\n        }\n\n        std::string rval(pv + pos, vlen);\n        ptr->result_map_.emplace(rkey, rval);\n        pos += vlen;\n    }\n}\n\nvoid BinaryCodec::OnResponsePacket(const protocol_binary_response_header& resp,\n                                   evpp::Buffer* buf) {\n    uint32_t id  = resp.response.opaque;  \/\/ no need to call ntohl\n    int opcode = resp.response.opcode;\n    CommandPtr cmd = memc_client_->PeekRunningCommand();\n    if (!cmd || id != cmd->id()) {\n        \/\/ TODO : id 不一致时候，如何处理?\n        buf->Retrieve(kHeaderLen + resp.response.bodylen);\n        LOG_WARN << \"OnResponsePacket cmd\/message mismatch.\" << id;\n        return;\n    }\n\n    switch (opcode) {\n    case PROTOCOL_BINARY_CMD_SET:\n        cmd = memc_client_->PopRunningCommand();\n        cmd->OnSetCommandDone(resp.response.status);\n        LOG_DEBUG << \"OnResponsePacket SET, opaque=\" << id;\n        break;\n\n    case PROTOCOL_BINARY_CMD_DELETE:\n        cmd = memc_client_->PopRunningCommand();\n        cmd->OnRemoveCommandDone(resp.response.status);\n        LOG_DEBUG << \"OnResponsePacket DELETE, opaque=\" << id;\n        break;\n\n    case PROTOCOL_BINARY_CMD_GET: {\n        cmd = memc_client_->PopRunningCommand();\n        const char* pv = buf->data() + sizeof(resp) + resp.response.extlen;\n        std::string value(pv, resp.response.bodylen - resp.response.extlen);\n        cmd->OnGetCommandDone(resp.response.status, value);\n        LOG_DEBUG << \"OnResponsePacket GET, opaque=\" << id;\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_GETK: {\n        cmd = memc_client_->PopRunningCommand();\n        const int extlen_getk = resp.response.extlen;\n        const int keylen_getk = resp.response.keylen;\n        const char* pv = buf->data() + sizeof(resp) + extlen_getk;\n        std::string key(pv, keylen_getk);\n        std::string value(pv + keylen_getk, resp.response.bodylen - keylen_getk - extlen_getk);\n\n        cmd->OnMultiGetCommandDone(resp.response.status, key, value);\n        LOG_DEBUG << \"OnResponsePacket MULTIGETK, opaque=\" << id;\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_GETKQ: {\n        const int extlen = resp.response.extlen;\n        const int keylen = resp.response.keylen;\n        const char* pv = buf->data() + sizeof(resp) + extlen;\n        std::string key(pv, keylen);\n        std::string value(pv + keylen, resp.response.bodylen - keylen - extlen);\n\n        cmd->OnMultiGetCommandOneResponse(resp.response.status, key, value);\n        LOG_DEBUG << \"OnResponsePacket MULTIGETQ, opaque=\" << id;\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_PGETK: {\n        cmd = memc_client_->PopRunningCommand();\n        const char* pv = buf->data() + sizeof(resp) + resp.response.extlen;\n        std::string key(pv, resp.response.keylen);\n        if (!key.empty()) {\n            auto result_ptr = cmd->GetResultContainerByKey(key);\n            DecodePrefixGetPacket(resp, buf, result_ptr);\n            cmd->OnPrefixGetCommandDone();\n            LOG_DEBUG << \"OnResponsePacket PGETK, opaque=\" << id;\n        } else {\n            cmd->OnError(resp.response.status);\n        }\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_PGETKQ: {\n        const char* pv = buf->data() + sizeof(resp) + resp.response.extlen;\n        std::string key(pv, resp.response.keylen);\n        if (!key.empty()) {\n            auto result_ptr = cmd->GetResultContainerByKey(key);\n            DecodePrefixGetPacket(resp, buf, result_ptr);\n            LOG_DEBUG << \"OnResponsePacket PGETKQ\" << id;\n        } else {\n            cmd->OnError(resp.response.status);\n        }\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_NOOP:\n        LOG_DEBUG << \"GETQ, NOOP opaque=\" << id;\n        \/\/memc_client_->onMultiGetCommandDone(id, resp.response.status);\n        break;\n    default:\n        break;\n    }\n    buf->Retrieve(kHeaderLen + resp.response.bodylen);\n}\n\n}\n<commit_msg>if recv prefix multiget error, quick return;<commit_after>#include \"binary_codec.h\"\n\n#include \"memcache_client.h\"\n\nnamespace evmc {\n\nstatic const size_t kHeaderLen = sizeof(protocol_binary_response_header);\n\nvoid BinaryCodec::OnCodecMessage(const evpp::TCPConnPtr& conn,\n                                 evpp::Buffer* buf) {\n    while (buf->size() >= kHeaderLen) { \/\/ kHeaderLen == 24\n        const void* data = buf->data();\n        protocol_binary_response_header resp =\n            *static_cast<const protocol_binary_response_header*>(data);\n        resp.response.bodylen = ntohl(resp.response.bodylen);\n        resp.response.status  = ntohs(resp.response.status);\n        resp.response.keylen  = ntohs(resp.response.keylen);\n\n        if (buf->size() >= resp.response.bodylen + kHeaderLen) {\n            OnResponsePacket(resp, buf);\n        } else {\n            LOG_TRACE << \"need recv more data\";\n            break;\n        }\n    }\n}\n\n\nvoid BinaryCodec::DecodePrefixGetPacket(const protocol_binary_response_header& resp,\n                                        evpp::Buffer* buf, PrefixGetResultPtr& ptr) {\n    const char* pv = buf->data() + sizeof(resp) + resp.response.extlen;\n    uint32_t pos = resp.response.keylen;\n    uint32_t klen = 0;\n    uint32_t vlen = 0;\n    const uint32_t size = resp.response.bodylen - resp.response.keylen - resp.response.extlen;\n    const uint32_t buf_size = buf->size();\n    int ret = resp.response.status;\n    ptr->code = ret;\n    if (ret != (int)PROTOCOL_BINARY_RESPONSE_SUCCESS) {\n        return;\n    }\n    while (pos < size) {\n        if (pos >= buf_size || pos + 4 >= buf_size) {\n            break;\n        }\n        klen = ntohl((*(const uint32_t*)(pv + pos)));\n        pos += 4;\n        if ((pos + klen) >= buf_size) {\n            break;\n        }\n        std::string rkey(pv + pos, klen);\n        pos += klen;\n        if (pos >= buf_size || pos + 4 >= buf_size) {\n            break;\n        }\n        vlen = ntohl(*(const uint32_t*)(pv + pos));\n        pos += 4;\n        if ((pos + vlen) >= buf_size) {\n            break;\n        }\n\n        std::string rval(pv + pos, vlen);\n        ptr->result_map_.emplace(rkey, rval);\n        pos += vlen;\n    }\n}\n\nvoid BinaryCodec::OnResponsePacket(const protocol_binary_response_header& resp,\n                                   evpp::Buffer* buf) {\n    uint32_t id  = resp.response.opaque;  \/\/ no need to call ntohl\n    int opcode = resp.response.opcode;\n    CommandPtr cmd = memc_client_->PeekRunningCommand();\n    if (!cmd || id != cmd->id()) {\n        \/\/ TODO : id 不一致时候，如何处理?\n        buf->Retrieve(kHeaderLen + resp.response.bodylen);\n        LOG_WARN << \"OnResponsePacket cmd\/message mismatch.\" << id;\n        return;\n    }\n\n    switch (opcode) {\n    case PROTOCOL_BINARY_CMD_SET:\n        cmd = memc_client_->PopRunningCommand();\n        cmd->OnSetCommandDone(resp.response.status);\n        LOG_DEBUG << \"OnResponsePacket SET, opaque=\" << id;\n        break;\n\n    case PROTOCOL_BINARY_CMD_DELETE:\n        cmd = memc_client_->PopRunningCommand();\n        cmd->OnRemoveCommandDone(resp.response.status);\n        LOG_DEBUG << \"OnResponsePacket DELETE, opaque=\" << id;\n        break;\n\n    case PROTOCOL_BINARY_CMD_GET: {\n        cmd = memc_client_->PopRunningCommand();\n        const char* pv = buf->data() + sizeof(resp) + resp.response.extlen;\n        std::string value(pv, resp.response.bodylen - resp.response.extlen);\n        cmd->OnGetCommandDone(resp.response.status, value);\n        LOG_DEBUG << \"OnResponsePacket GET, opaque=\" << id;\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_GETK: {\n        cmd = memc_client_->PopRunningCommand();\n        const int extlen_getk = resp.response.extlen;\n        const int keylen_getk = resp.response.keylen;\n        const char* pv = buf->data() + sizeof(resp) + extlen_getk;\n        std::string key(pv, keylen_getk);\n        std::string value(pv + keylen_getk, resp.response.bodylen - keylen_getk - extlen_getk);\n\n        cmd->OnMultiGetCommandDone(resp.response.status, key, value);\n        LOG_DEBUG << \"OnResponsePacket MULTIGETK, opaque=\" << id;\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_GETKQ: {\n        const int extlen = resp.response.extlen;\n        const int keylen = resp.response.keylen;\n        const char* pv = buf->data() + sizeof(resp) + extlen;\n        std::string key(pv, keylen);\n        std::string value(pv + keylen, resp.response.bodylen - keylen - extlen);\n\n        cmd->OnMultiGetCommandOneResponse(resp.response.status, key, value);\n        LOG_DEBUG << \"OnResponsePacket MULTIGETQ, opaque=\" << id;\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_PGETK: {\n        cmd = memc_client_->PopRunningCommand();\n        const char* pv = buf->data() + sizeof(resp) + resp.response.extlen;\n        std::string key(pv, resp.response.keylen);\n        if (!key.empty()) {\n            auto result_ptr = cmd->GetResultContainerByKey(key);\n            DecodePrefixGetPacket(resp, buf, result_ptr);\n            cmd->OnPrefixGetCommandDone();\n            LOG_DEBUG << \"OnResponsePacket PGETK, opaque=\" << id;\n        } else {\n            cmd->OnError(resp.response.status);\n        }\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_PGETKQ: {\n        const char* pv = buf->data() + sizeof(resp) + resp.response.extlen;\n        std::string key(pv, resp.response.keylen);\n        if (!key.empty()) {\n            auto result_ptr = cmd->GetResultContainerByKey(key);\n            DecodePrefixGetPacket(resp, buf, result_ptr);\n            LOG_DEBUG << \"OnResponsePacket PGETKQ\" << id;\n        } else {\n            cmd->OnError(resp.response.status);\n        }\n    }\n    break;\n\n    case PROTOCOL_BINARY_CMD_NOOP:\n        LOG_DEBUG << \"GETQ, NOOP opaque=\" << id;\n        \/\/memc_client_->onMultiGetCommandDone(id, resp.response.status);\n        break;\n    default:\n        break;\n    }\n    buf->Retrieve(kHeaderLen + resp.response.bodylen);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Ascent MMORPG Server\n * Copyright (C) 2005-2007 Ascent Team <http:\/\/www.ascentemu.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, 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 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 \"StdAfx.h\"\n\nvoid WorldSession::HandleUseItemOpcode(WorldPacket& recvPacket)\n{\n\tif(!_player->IsInWorld()) return;\n\ttypedef std::list<Aura*> AuraList;\n\t\n\tPlayer* p_User = GetPlayer();\n\tsLog.outDetail(\"WORLD: got use Item packet, data length = %i\",recvPacket.size());\n\tint8 tmp1,slot,tmp3;\n\tuint8 cn;\n\tuint32 spellId = 0;\n\n\trecvPacket >> tmp1 >> slot >> tmp3 >> cn;\n\tItem* tmpItem = NULL;\n\ttmpItem = p_User->GetItemInterface()->GetInventoryItem(tmp1,slot);\n\tif (!tmpItem)\n\t\ttmpItem = p_User->GetItemInterface()->GetInventoryItem(slot);\n\tif (!tmpItem)\n\t\treturn;\n\tItemPrototype *itemProto = tmpItem->GetProto();\n\tif(!itemProto)\n\t\treturn;\n\n\tif(!_player->isDead())\n\t\treturn;\n\n\tif(itemProto->Bonding == ITEM_BIND_ON_USE)\n\t\ttmpItem->SoulBind();\n\n\tif(sScriptMgr.CallScriptedItem(tmpItem,_player))\n\t\treturn;\n\n\tif(itemProto->QuestId)\n\t{\n\t\t\/\/ Item Starter\n\t\tQuest *qst = QuestStorage.LookupEntry(itemProto->QuestId);\n\t\tif(!qst) \n\t\t\treturn;\n\n        WorldPacket data;\n        sQuestMgr.BuildQuestDetails(&data, qst, tmpItem, 0, language);\n\t\tSendPacket(&data);\n\t}\n\t\n\tSpellCastTargets targets(recvPacket, _player->GetGUID());\n\tuint32 x;\n\tfor(x = 0; x < 5; x++)\n\t{\n\t\tif(itemProto->Spells[x].Trigger == USE)\n\t\t{\n\t\t\tif(itemProto->Spells[x].Id)\n\t\t\t{\n\t\t\t\tspellId = itemProto->Spells[x].Id;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif(!spellId)\n\t\treturn;\n\t\/\/ check for spell id\n\tSpellEntry *spellInfo = dbcSpell.LookupEntryForced( spellId );\n\n\tif(!spellInfo)\n\t{\n\t\tsLog.outError(\"WORLD: unknown spell id %i\\n\", spellId);\n\t\treturn;\n\t}\n\n\tif (spellInfo->AuraInterruptFlags & AURA_INTERRUPT_ON_STAND_UP)\n\t{\n\t\tif (p_User->CombatStatus.IsInCombat())\n\t\t{\n\t\t\t_player->GetItemInterface()->BuildInventoryChangeError(tmpItem,NULL,INV_ERR_CANT_DO_IN_COMBAT);\n\t\t\treturn;\n\t\t}\n\t\tif(p_User->GetStandState()!=1)\n\t\tp_User->SetStandState(STANDSTATE_SIT);\n\t\t\/\/ loop through the auras and removing existing eating spells\n\t}\n\n\tif(itemProto->RequiredSkill)\n\t{\n\t\tif(!_player->_HasSkillLine(itemProto->RequiredSkill))\n\t\t{\n\t\t\t_player->GetItemInterface()->BuildInventoryChangeError(tmpItem,NULL,INV_ERR_ITEM_RANK_NOT_ENOUGH);\n\t\t\treturn;\n\t\t}\n\n\t\tif(itemProto->RequiredSkillRank)\n\t\t{\n\t\t\tif(_player->_GetSkillLineCurrent(itemProto->RequiredSkill, false) < itemProto->RequiredSkillRank)\n\t\t\t{\n\t\t\t\t_player->GetItemInterface()->BuildInventoryChangeError(tmpItem,NULL,INV_ERR_ITEM_RANK_NOT_ENOUGH);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif(!_player->CanCastItemDueToCooldown(itemProto, x))\t\/\/ damn cheaters\n\t\treturn;\n\n\tif(itemProto->Spells[x].Cooldown || itemProto->Spells[x].CategoryCooldown)\n\t{\n\t\tItemCooldown * item = new ItemCooldown;\n\t   \tif(itemProto->Spells[x].Id)\n\t\t{\n\t\t\tif(itemProto->Spells[x].Trigger == USE)\n\t\t\t{\n\t\t\t\titem->ItemEntry = itemProto->ItemId;\n\t\t\t\titem->SpellID = spellId;\n\t\t\t\titem->SpellCategory = itemProto->Spells[x].Category;\n\t\t\t\tif(itemProto->Spells[x].Category)\n\t\t\t\t{\n\t\t\t\t\titem->Cooldown = itemProto->Spells[x].CategoryCooldown;\n\t\t\t\t\titem->CooldownTimeStamp = now() + itemProto->Spells[x].CategoryCooldown;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\titem->Cooldown = itemProto->Spells[x].Cooldown;\n\t\t\t\t\titem->CooldownTimeStamp = now() + itemProto->Spells[x].Cooldown;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t_player->m_itemcooldown.insert(item);\n\t}\n\n\n\n\tSpell *spell = new Spell(_player, spellInfo, false, NULL);\n\tspell->extra_cast_number=cn;\n\tspell->i_caster = tmpItem;\n\t\/\/GetPlayer()->setCurrentSpell(spell);\n\tspell->prepare(&targets);\n}\n\nvoid WorldSession::HandleCastSpellOpcode(WorldPacket& recvPacket)\n{\n\tif(!_player->IsInWorld()) return;\n\tif(!_player->isDead())\n\t\treturn;\n\n\tuint32 spellId;\n\tuint8 cn;\n\n\trecvPacket >> spellId >> cn;\n\n\tsLog.outDetail(\"WORLD: got cast spell packet, spellId - %i, data length = %i\",\n\t\tspellId, recvPacket.size());\n\t\n\t\/\/ Cheat Detection only if player and not from an item\n\t\/\/ this could fuck up things but meh it's needed ALOT of the newbs are using WPE now\n\t\/\/ WPE allows them to mod the outgoing packet and basicly choose what ever spell they want :(\n\n\tif( !GetPlayer()->HasSpell(spellId) )\n\t{\n\t\tsLog.outDetail(\"WORLD: Spell isn't casted because player \\\"%s\\\" is cheating\", GetPlayer()->GetName());\n\t\treturn;\n\t}\n\n\tif (GetPlayer()->GetOnMeleeSpell() != spellId)\n\t{\n\t\t\/\/ check for spell id\n\t\tSpellEntry *spellInfo = dbcSpell.LookupEntryForced(spellId );\n\n\t\tif(!spellInfo || !sHookInterface.OnCastSpell(_player, spellInfo))\n\t\t{\n\t\t\tsLog.outError(\"WORLD: unknown spell id %i\\n\", spellId);\n\t\t\treturn;\n\t\t}\n\t\t\/\/autoshot 75\n\t\tif((spellInfo->Flags3 & FLAGS3_ACTIVATE_AUTO_SHOT) \/*spellInfo->Attributes == 327698*\/)\t\/\/ auto shot..\n\t\t{\n\t\t\tItem *weapon = GetPlayer()->GetItemInterface()->GetInventoryItem(EQUIPMENT_SLOT_RANGED);\n\t\t\tif(!weapon) \n\t\t\t\treturn;\n\t\t\tuint32 spellid;\n\t\t\tswitch(weapon->GetProto()->SubClass)\n\t\t\t{\n\t\t\tcase 2:\t\t\t \/\/ bows\n\t\t\tcase 3:\t\t\t \/\/ guns\n            case 18:\t\t \/\/ crossbow\n\t\t\t\tspellid = SPELL_RANGED_GENERAL;\n\t\t\t\tbreak;\n\t\t\tcase 16:\t\t\t\/\/ thrown\n\t\t\t\tspellid = SPELL_RANGED_THROW;\n\t\t\t\tbreak;\n\t\t\tcase 19:\t\t\t\/\/ wands\n\t\t\t\tspellid = SPELL_RANGED_WAND;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tspellid = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t   \n\t\t\tif(!spellid) \n\t\t\t\tspellid = spellInfo->Id;\n\t\t\t\n\t\t\tif(!_player->m_onAutoShot)\n\t\t\t{\n\t\t\t\tif(_player->IsMounted())\n\t\t\t\t{\n                    _player->SendCastResult(spellInfo->Id, SPELL_FAILED_NOT_MOUNTED, 0);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t_player->m_AutoShotStartX = _player->GetPositionX();\n\t\t\t\t_player->m_AutoShotStartY = _player->GetPositionY();\n\t\t\t\t_player->m_AutoShotStartZ = _player->GetPositionZ();\n\t\t\t\t_player->m_AutoShotTarget = _player->GetSelection();\n\t\t\t\tuint32 duration = _player->GetUInt32Value(UNIT_FIELD_RANGEDATTACKTIME);\n\t\t\t\tSpellCastTargets targets(recvPacket,GetPlayer()->GetGUID());\n\t\t\t\tif(!targets.m_unitTarget)\n\t\t\t\t\treturn;\n\t\t\t\tSpellEntry *sp = dbcSpell.LookupEntry(spellid);\n\t\t\t\n\t\t\t\t_player->m_AutoShotSpell = sp;\n\t\t\t\t_player->m_AutoShotDuration = duration;\n\t\t\t\t\/\/This will fix fast clicks\n\t\t\t\tif(_player->m_AutoShotAttackTimer < 500)\n\t\t\t\t\t_player->m_AutoShotAttackTimer = 500;\n\t\t\t\t_player->m_onAutoShot = true;\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\t\t\/*const char * name = sSpellStore.LookupString(spellInfo->Name);\n\t\tif(name)\n\t\t\tsChatHandler.SystemMessageToPlr(_player, \"%sSpell Cast:%s %s %s[Group %u, family %u]\", MSG_COLOR_LIGHTBLUE,\n\t\t\tMSG_COLOR_SUBWHITE, name, MSG_COLOR_YELLOW, spellInfo->SpellGroupType, spellInfo->SpellFamilyName);*\/\n\n        if(GetPlayer()->m_currentSpell && GetCastTime(dbcSpellCastTime.LookupEntry(spellInfo->CastingTimeIndex)))\n        {\n            _player->SendCastResult(spellInfo->Id, SPELL_FAILED_SPELL_IN_PROGRESS, 0);\n            return;\n        }\n\t\tSpell *spell = new Spell(GetPlayer(), spellInfo, false, NULL);\n\t\tspell->extra_cast_number=cn;\n\t\n\t\tSpellCastTargets targets(recvPacket,GetPlayer()->GetGUID());\n\t\tspell->prepare(&targets);\n\t}\n}\n\nvoid WorldSession::HandleCancelCastOpcode(WorldPacket& recvPacket)\n{\n\tuint32 spellId;\n\trecvPacket >> spellId;\n\n\tif(GetPlayer()->m_currentSpell)\n\t\tGetPlayer()->m_currentSpell->cancel();\n}\n\nvoid WorldSession::HandleCancelAuraOpcode( WorldPacket& recvPacket)\n{\n\tuint32 spellId;\n\trecvPacket >> spellId;\n\t\n\tfor(uint32 x = 0; x < MAX_AURAS+MAX_POSITIVE_AURAS; ++x)\n\t{\n\t\tif(_player->m_auras[x] && _player->m_auras[x]->IsPositive() && _player->m_auras[x]->GetSpellId() == spellId)\n\t\t\t_player->m_auras[x]->Remove();\n\t}\n\tsLog.outDebug(\"removing aura %u\",spellId);\n}\n\nvoid WorldSession::HandleCancelChannellingOpcode( WorldPacket& recvPacket)\n{\n\tuint32 spellId;\n\trecvPacket >> spellId;\n\n\tPlayer *plyr = GetPlayer();\n\tif(!plyr)\n\t\treturn;\n\tif(plyr->m_currentSpell)\n\t{\t\t\n\t\tplyr->m_currentSpell->cancel();\n\t}\n}\n\nvoid WorldSession::HandleCancelAutoRepeatSpellOpcode(WorldPacket& recv_data)\n{\n\t\/\/sLog.outString(\"Received CMSG_CANCEL_AUTO_REPEAT_SPELL message.\");\n\t\/\/on original we automatically enter combat when creature got close to us\n\/\/\tGetPlayer()->GetSession()->OutPacket(SMSG_CANCEL_COMBAT);\n\tGetPlayer()->m_onAutoShot = false;\n}\n\nvoid WorldSession::HandleAddDynamicTargetOpcode(WorldPacket & recvPacket)\n{\n\tuint64 guid;\n\tuint32 spellid;\n\tuint8 flags;\n\trecvPacket >> guid >> spellid >> flags;\n\t\n\tSpellEntry * sp = dbcSpell.LookupEntry(spellid);\n\t\/\/ Summoned Elemental's Freeze\n    if (spellid == 33395)\n    {\n        if (!_player->m_Summon)\n            return;\n    }\n    else if (!_player->m_CurrentCharm || guid != _player->m_CurrentCharm->GetGUID())\n    {\n        return;\n    }\n\t\n\t\/* burlex: this is.. strange *\/\n\tSpellCastTargets targets;\n\ttargets.m_targetMask = flags;\n\n\tif(flags == 0)\n\t\ttargets.m_unitTarget = guid;\n\telse if(flags == 0x02)\n\t{\n\t\tWoWGuid guid;\n\t\trecvPacket >> flags;\t\t\/\/ skip one byte\n\t\trecvPacket >> guid;\n\t\ttargets.m_unitTarget = guid.GetOldGuid();\n\t}\n\telse if(flags == 0x40)\n\t{\n\t\trecvPacket >> flags;\t\t\/\/ skip one byte\n\t\trecvPacket >> targets.m_destX >> targets.m_destY >> targets.m_destZ;\n\t}\n\tif(spellid == 33395)\t\/\/ Summoned Water Elemental's freeze\n\t{\n\t\tSpell * pSpell = new Spell(_player->m_Summon, sp, false, 0);\n\t\tpSpell->prepare(&targets);\n\t}\n\telse\t\t\t\/\/ trinket?\n\t{\n\t\tSpell * pSpell = new Spell(_player->m_CurrentCharm, sp, false, 0);\n\t\tpSpell->prepare(&targets);\n\t}\n}\n<commit_msg>* urgh, logic errors<commit_after>\/*\n * Ascent MMORPG Server\n * Copyright (C) 2005-2007 Ascent Team <http:\/\/www.ascentemu.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, 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 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 \"StdAfx.h\"\n\nvoid WorldSession::HandleUseItemOpcode(WorldPacket& recvPacket)\n{\n\tif(!_player->IsInWorld()) return;\n\ttypedef std::list<Aura*> AuraList;\n\t\n\tPlayer* p_User = GetPlayer();\n\tsLog.outDetail(\"WORLD: got use Item packet, data length = %i\",recvPacket.size());\n\tint8 tmp1,slot,tmp3;\n\tuint8 cn;\n\tuint32 spellId = 0;\n\n\trecvPacket >> tmp1 >> slot >> tmp3 >> cn;\n\tItem* tmpItem = NULL;\n\ttmpItem = p_User->GetItemInterface()->GetInventoryItem(tmp1,slot);\n\tif (!tmpItem)\n\t\ttmpItem = p_User->GetItemInterface()->GetInventoryItem(slot);\n\tif (!tmpItem)\n\t\treturn;\n\tItemPrototype *itemProto = tmpItem->GetProto();\n\tif(!itemProto)\n\t\treturn;\n\n\tif(_player->isDead())\n\t\treturn;\n\n\tif(itemProto->Bonding == ITEM_BIND_ON_USE)\n\t\ttmpItem->SoulBind();\n\n\tif(sScriptMgr.CallScriptedItem(tmpItem,_player))\n\t\treturn;\n\n\tif(itemProto->QuestId)\n\t{\n\t\t\/\/ Item Starter\n\t\tQuest *qst = QuestStorage.LookupEntry(itemProto->QuestId);\n\t\tif(!qst) \n\t\t\treturn;\n\n        WorldPacket data;\n        sQuestMgr.BuildQuestDetails(&data, qst, tmpItem, 0, language);\n\t\tSendPacket(&data);\n\t}\n\t\n\tSpellCastTargets targets(recvPacket, _player->GetGUID());\n\tuint32 x;\n\tfor(x = 0; x < 5; x++)\n\t{\n\t\tif(itemProto->Spells[x].Trigger == USE)\n\t\t{\n\t\t\tif(itemProto->Spells[x].Id)\n\t\t\t{\n\t\t\t\tspellId = itemProto->Spells[x].Id;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif(!spellId)\n\t\treturn;\n\t\/\/ check for spell id\n\tSpellEntry *spellInfo = dbcSpell.LookupEntryForced( spellId );\n\n\tif(!spellInfo)\n\t{\n\t\tsLog.outError(\"WORLD: unknown spell id %i\\n\", spellId);\n\t\treturn;\n\t}\n\n\tif (spellInfo->AuraInterruptFlags & AURA_INTERRUPT_ON_STAND_UP)\n\t{\n\t\tif (p_User->CombatStatus.IsInCombat())\n\t\t{\n\t\t\t_player->GetItemInterface()->BuildInventoryChangeError(tmpItem,NULL,INV_ERR_CANT_DO_IN_COMBAT);\n\t\t\treturn;\n\t\t}\n\t\tif(p_User->GetStandState()!=1)\n\t\tp_User->SetStandState(STANDSTATE_SIT);\n\t\t\/\/ loop through the auras and removing existing eating spells\n\t}\n\n\tif(itemProto->RequiredSkill)\n\t{\n\t\tif(!_player->_HasSkillLine(itemProto->RequiredSkill))\n\t\t{\n\t\t\t_player->GetItemInterface()->BuildInventoryChangeError(tmpItem,NULL,INV_ERR_ITEM_RANK_NOT_ENOUGH);\n\t\t\treturn;\n\t\t}\n\n\t\tif(itemProto->RequiredSkillRank)\n\t\t{\n\t\t\tif(_player->_GetSkillLineCurrent(itemProto->RequiredSkill, false) < itemProto->RequiredSkillRank)\n\t\t\t{\n\t\t\t\t_player->GetItemInterface()->BuildInventoryChangeError(tmpItem,NULL,INV_ERR_ITEM_RANK_NOT_ENOUGH);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif(!_player->CanCastItemDueToCooldown(itemProto, x))\t\/\/ damn cheaters\n\t\treturn;\n\n\tif(itemProto->Spells[x].Cooldown || itemProto->Spells[x].CategoryCooldown)\n\t{\n\t\tItemCooldown * item = new ItemCooldown;\n\t   \tif(itemProto->Spells[x].Id)\n\t\t{\n\t\t\tif(itemProto->Spells[x].Trigger == USE)\n\t\t\t{\n\t\t\t\titem->ItemEntry = itemProto->ItemId;\n\t\t\t\titem->SpellID = spellId;\n\t\t\t\titem->SpellCategory = itemProto->Spells[x].Category;\n\t\t\t\tif(itemProto->Spells[x].Category)\n\t\t\t\t{\n\t\t\t\t\titem->Cooldown = itemProto->Spells[x].CategoryCooldown;\n\t\t\t\t\titem->CooldownTimeStamp = now() + itemProto->Spells[x].CategoryCooldown;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\titem->Cooldown = itemProto->Spells[x].Cooldown;\n\t\t\t\t\titem->CooldownTimeStamp = now() + itemProto->Spells[x].Cooldown;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t_player->m_itemcooldown.insert(item);\n\t}\n\n\n\n\tSpell *spell = new Spell(_player, spellInfo, false, NULL);\n\tspell->extra_cast_number=cn;\n\tspell->i_caster = tmpItem;\n\t\/\/GetPlayer()->setCurrentSpell(spell);\n\tspell->prepare(&targets);\n}\n\nvoid WorldSession::HandleCastSpellOpcode(WorldPacket& recvPacket)\n{\n\tif(!_player->IsInWorld()) return;\n\tif(_player->isDead())\n\t\treturn;\n\n\tuint32 spellId;\n\tuint8 cn;\n\n\trecvPacket >> spellId >> cn;\n\n\tsLog.outDetail(\"WORLD: got cast spell packet, spellId - %i, data length = %i\",\n\t\tspellId, recvPacket.size());\n\t\n\t\/\/ Cheat Detection only if player and not from an item\n\t\/\/ this could fuck up things but meh it's needed ALOT of the newbs are using WPE now\n\t\/\/ WPE allows them to mod the outgoing packet and basicly choose what ever spell they want :(\n\n\tif( !GetPlayer()->HasSpell(spellId) )\n\t{\n\t\tsLog.outDetail(\"WORLD: Spell isn't casted because player \\\"%s\\\" is cheating\", GetPlayer()->GetName());\n\t\treturn;\n\t}\n\n\tif (GetPlayer()->GetOnMeleeSpell() != spellId)\n\t{\n\t\t\/\/ check for spell id\n\t\tSpellEntry *spellInfo = dbcSpell.LookupEntryForced(spellId );\n\n\t\tif(!spellInfo || !sHookInterface.OnCastSpell(_player, spellInfo))\n\t\t{\n\t\t\tsLog.outError(\"WORLD: unknown spell id %i\\n\", spellId);\n\t\t\treturn;\n\t\t}\n\t\t\/\/autoshot 75\n\t\tif((spellInfo->Flags3 & FLAGS3_ACTIVATE_AUTO_SHOT) \/*spellInfo->Attributes == 327698*\/)\t\/\/ auto shot..\n\t\t{\n\t\t\tItem *weapon = GetPlayer()->GetItemInterface()->GetInventoryItem(EQUIPMENT_SLOT_RANGED);\n\t\t\tif(!weapon) \n\t\t\t\treturn;\n\t\t\tuint32 spellid;\n\t\t\tswitch(weapon->GetProto()->SubClass)\n\t\t\t{\n\t\t\tcase 2:\t\t\t \/\/ bows\n\t\t\tcase 3:\t\t\t \/\/ guns\n            case 18:\t\t \/\/ crossbow\n\t\t\t\tspellid = SPELL_RANGED_GENERAL;\n\t\t\t\tbreak;\n\t\t\tcase 16:\t\t\t\/\/ thrown\n\t\t\t\tspellid = SPELL_RANGED_THROW;\n\t\t\t\tbreak;\n\t\t\tcase 19:\t\t\t\/\/ wands\n\t\t\t\tspellid = SPELL_RANGED_WAND;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tspellid = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t   \n\t\t\tif(!spellid) \n\t\t\t\tspellid = spellInfo->Id;\n\t\t\t\n\t\t\tif(!_player->m_onAutoShot)\n\t\t\t{\n\t\t\t\tif(_player->IsMounted())\n\t\t\t\t{\n                    _player->SendCastResult(spellInfo->Id, SPELL_FAILED_NOT_MOUNTED, 0);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t_player->m_AutoShotStartX = _player->GetPositionX();\n\t\t\t\t_player->m_AutoShotStartY = _player->GetPositionY();\n\t\t\t\t_player->m_AutoShotStartZ = _player->GetPositionZ();\n\t\t\t\t_player->m_AutoShotTarget = _player->GetSelection();\n\t\t\t\tuint32 duration = _player->GetUInt32Value(UNIT_FIELD_RANGEDATTACKTIME);\n\t\t\t\tSpellCastTargets targets(recvPacket,GetPlayer()->GetGUID());\n\t\t\t\tif(!targets.m_unitTarget)\n\t\t\t\t\treturn;\n\t\t\t\tSpellEntry *sp = dbcSpell.LookupEntry(spellid);\n\t\t\t\n\t\t\t\t_player->m_AutoShotSpell = sp;\n\t\t\t\t_player->m_AutoShotDuration = duration;\n\t\t\t\t\/\/This will fix fast clicks\n\t\t\t\tif(_player->m_AutoShotAttackTimer < 500)\n\t\t\t\t\t_player->m_AutoShotAttackTimer = 500;\n\t\t\t\t_player->m_onAutoShot = true;\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\t\t\/*const char * name = sSpellStore.LookupString(spellInfo->Name);\n\t\tif(name)\n\t\t\tsChatHandler.SystemMessageToPlr(_player, \"%sSpell Cast:%s %s %s[Group %u, family %u]\", MSG_COLOR_LIGHTBLUE,\n\t\t\tMSG_COLOR_SUBWHITE, name, MSG_COLOR_YELLOW, spellInfo->SpellGroupType, spellInfo->SpellFamilyName);*\/\n\n        if(GetPlayer()->m_currentSpell && GetCastTime(dbcSpellCastTime.LookupEntry(spellInfo->CastingTimeIndex)))\n        {\n            _player->SendCastResult(spellInfo->Id, SPELL_FAILED_SPELL_IN_PROGRESS, 0);\n            return;\n        }\n\t\tSpell *spell = new Spell(GetPlayer(), spellInfo, false, NULL);\n\t\tspell->extra_cast_number=cn;\n\t\n\t\tSpellCastTargets targets(recvPacket,GetPlayer()->GetGUID());\n\t\tspell->prepare(&targets);\n\t}\n}\n\nvoid WorldSession::HandleCancelCastOpcode(WorldPacket& recvPacket)\n{\n\tuint32 spellId;\n\trecvPacket >> spellId;\n\n\tif(GetPlayer()->m_currentSpell)\n\t\tGetPlayer()->m_currentSpell->cancel();\n}\n\nvoid WorldSession::HandleCancelAuraOpcode( WorldPacket& recvPacket)\n{\n\tuint32 spellId;\n\trecvPacket >> spellId;\n\t\n\tfor(uint32 x = 0; x < MAX_AURAS+MAX_POSITIVE_AURAS; ++x)\n\t{\n\t\tif(_player->m_auras[x] && _player->m_auras[x]->IsPositive() && _player->m_auras[x]->GetSpellId() == spellId)\n\t\t\t_player->m_auras[x]->Remove();\n\t}\n\tsLog.outDebug(\"removing aura %u\",spellId);\n}\n\nvoid WorldSession::HandleCancelChannellingOpcode( WorldPacket& recvPacket)\n{\n\tuint32 spellId;\n\trecvPacket >> spellId;\n\n\tPlayer *plyr = GetPlayer();\n\tif(!plyr)\n\t\treturn;\n\tif(plyr->m_currentSpell)\n\t{\t\t\n\t\tplyr->m_currentSpell->cancel();\n\t}\n}\n\nvoid WorldSession::HandleCancelAutoRepeatSpellOpcode(WorldPacket& recv_data)\n{\n\t\/\/sLog.outString(\"Received CMSG_CANCEL_AUTO_REPEAT_SPELL message.\");\n\t\/\/on original we automatically enter combat when creature got close to us\n\/\/\tGetPlayer()->GetSession()->OutPacket(SMSG_CANCEL_COMBAT);\n\tGetPlayer()->m_onAutoShot = false;\n}\n\nvoid WorldSession::HandleAddDynamicTargetOpcode(WorldPacket & recvPacket)\n{\n\tuint64 guid;\n\tuint32 spellid;\n\tuint8 flags;\n\trecvPacket >> guid >> spellid >> flags;\n\t\n\tSpellEntry * sp = dbcSpell.LookupEntry(spellid);\n\t\/\/ Summoned Elemental's Freeze\n    if (spellid == 33395)\n    {\n        if (!_player->m_Summon)\n            return;\n    }\n    else if (!_player->m_CurrentCharm || guid != _player->m_CurrentCharm->GetGUID())\n    {\n        return;\n    }\n\t\n\t\/* burlex: this is.. strange *\/\n\tSpellCastTargets targets;\n\ttargets.m_targetMask = flags;\n\n\tif(flags == 0)\n\t\ttargets.m_unitTarget = guid;\n\telse if(flags == 0x02)\n\t{\n\t\tWoWGuid guid;\n\t\trecvPacket >> flags;\t\t\/\/ skip one byte\n\t\trecvPacket >> guid;\n\t\ttargets.m_unitTarget = guid.GetOldGuid();\n\t}\n\telse if(flags == 0x40)\n\t{\n\t\trecvPacket >> flags;\t\t\/\/ skip one byte\n\t\trecvPacket >> targets.m_destX >> targets.m_destY >> targets.m_destZ;\n\t}\n\tif(spellid == 33395)\t\/\/ Summoned Water Elemental's freeze\n\t{\n\t\tSpell * pSpell = new Spell(_player->m_Summon, sp, false, 0);\n\t\tpSpell->prepare(&targets);\n\t}\n\telse\t\t\t\/\/ trinket?\n\t{\n\t\tSpell * pSpell = new Spell(_player->m_CurrentCharm, sp, false, 0);\n\t\tpSpell->prepare(&targets);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2013 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\n\/\/ Local includes\n#include \"libmesh\/node.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/reference_elem.h\"\n#include \"libmesh\/libmesh_singleton.h\"\n#include \"libmesh\/threads.h\"\n\n\/\/ C++ includes\n#include <map>\n\n\n\/\/-----------------------------------------------\n\/\/ anonymous namespace for implementation details\nnamespace\n{\n  using namespace libMesh;\n  \n  namespace ElemDataStrings\n  {\n#include \"reference_elem.data\"\n  }\n  \n  typedef Threads::spin_mutex InitMutex;\n  \n  \/\/ Mutex for thread safety.\n  InitMutex init_mtx;\n\n  \/\/ map from ElemType to reference element file system object name\n  typedef std::map<ElemType, const char*> FileMapType;\n  FileMapType ref_elem_file;\n  Elem* ref_elem_map[INVALID_ELEM];\n\n\n  \n  class SingletonCache : public libMesh::Singleton\n  {\n  public:\n    ~SingletonCache()\n    {\n      for (unsigned int e=0; e<elem_list.size(); e++)\n\tif (elem_list[e])\n\t  {\n\t    delete elem_list[e];\n\t    elem_list[e] = NULL;\n\t  }\n      \n      elem_list.clear();\n\n      for (unsigned int n=0; n<node_list.size(); n++)\n\tif (node_list[n])\n\t  {\n\t    delete node_list[n];\n\t    node_list[n] = NULL;\n\t  }\n\n      node_list.clear();\n    }\n      \n    std::vector<Node*> node_list;\n    std::vector<Elem*> elem_list;\n  };\n\n  \/\/ singleton object, dynamically created and then\n  \/\/ removed at program exit\n  SingletonCache *singleton_cache = NULL;\n    \n\n\n  Elem* read_ref_elem (const ElemType Type,\n\t\t       std::istream &in)\n  {\n    libmesh_assert (singleton_cache != NULL);\n\n    static const unsigned int comm_len = 1024;\n    char comm[comm_len];\n    \n    std::string foo;\n    unsigned int n_elem, n_nodes, elem_type, nn;\n    double x, y, z;\n    \n    in >> foo;\n    in >> n_elem;  \/**\/ in.getline (comm, comm_len); libmesh_assert_equal_to (n_elem, 1);\n    in >> n_nodes; \/**\/ in.getline (comm, comm_len);\n    in >> foo;     \/**\/ in.getline (comm, comm_len);\n    in >> foo;     \/**\/ in.getline (comm, comm_len);\n    in >> foo;     \/**\/ in.getline (comm, comm_len);\n    in >> foo;     \/**\/ in.getline (comm, comm_len);\n    in >> n_elem;  \/**\/ in.getline (comm, comm_len); libmesh_assert_equal_to (n_elem, 1);\n\n    in >> elem_type;\n\n    libmesh_assert_less (elem_type, INVALID_ELEM);\n    libmesh_assert_equal_to (elem_type, Type);\n    libmesh_assert_equal_to (n_nodes, Elem::type_to_n_nodes_map[elem_type]);\n    \n    \/\/ Construct the elem\n    Elem *elem = Elem::build(static_cast<ElemType>(elem_type)).release();\n    \n    \/\/ We are expecing an identity map, so assert it!\n    for (unsigned int n=0; n<n_nodes; n++)\n      {\n\tin >> nn;\n\tlibmesh_assert_equal_to (n,nn);\n      }\n    \n    for (unsigned int n=0; n<n_nodes; n++)\n      {\n\tin >> x >> y >> z;\n\n\tNode *node = new Node(x,y,z,n);\n\tsingleton_cache->node_list.push_back(node);\n\n\telem->set_node(n) = node;\n      }\n\n\n    \/\/ it is entirely possible we ran out of file or encountered\n    \/\/ another error.  If so, cleanly abort.\n    if (!in)\n      {\n\tdelete elem;\n\telem = NULL;\n\tlibMesh::err << \"ERROR while creating element singleton!\\n\";\n\tlibmesh_error();\n      }\n\n    else\n      singleton_cache->elem_list.push_back (elem);\n    \n    ref_elem_map[Type] = elem;\n\n    return elem;\n  }\n\n \n   \n  void init_ref_elem_table()\n  {\n    \/\/ ouside mutex - if this flag is set, we can\n    \/\/ trust it.\n    if (singleton_cache != NULL) return;\n    \n    \/\/ playing with fire here - lock before touching shared\n    \/\/ data structures\n    InitMutex::scoped_lock lock(init_mtx);\n\n    \/\/ inside mutex - pointer may have changed while waiting\n    \/\/ for the lock to acquire, check it again.\n    if (singleton_cache != NULL) return;\n\n    \/\/ OK, if we get here we have the lock and we are not\n    \/\/ initialized.  populate singleton.\n    singleton_cache = new SingletonCache;\n    \n    \/\/ initialize the reference file table\n    {\n      ref_elem_file.clear();\n      \n      \/\/ \/\/ 1D elements\n      ref_elem_file[EDGE2]    = ElemDataStrings::one_edge;\n      ref_elem_file[EDGE3]    = ElemDataStrings::one_edge3;\n      ref_elem_file[EDGE4]    = ElemDataStrings::one_edge4;\n      \t\t\t      \n      \/\/ 2D elements\t      \n      ref_elem_file[TRI3]     = ElemDataStrings::one_tri;\n      ref_elem_file[TRI6]     = ElemDataStrings::one_tri6;\n      \t\t\t      \n      ref_elem_file[QUAD4]    = ElemDataStrings::one_quad;\n      ref_elem_file[QUAD8]    = ElemDataStrings::one_quad8;\n      ref_elem_file[QUAD9]    = ElemDataStrings::one_quad9;\n      \t\t\t      \n      \/\/ 3D elements\t      \n      ref_elem_file[HEX8]     = ElemDataStrings::one_hex;\n      ref_elem_file[HEX20]    = ElemDataStrings::one_hex20;\n      ref_elem_file[HEX27]    = ElemDataStrings::one_hex27;\n      \t\t\t      \n      ref_elem_file[TET4]     = ElemDataStrings::one_tet;\n      ref_elem_file[TET10]    = ElemDataStrings::one_tet10;\n      \t\t\t      \n      ref_elem_file[PRISM6]   = ElemDataStrings::one_prism;\n      ref_elem_file[PRISM15]  = ElemDataStrings::one_prism15;\n      ref_elem_file[PRISM18]  = ElemDataStrings::one_prism18;\n\n      ref_elem_file[PYRAMID5] = ElemDataStrings::one_pyramid;\n    }\n\n    \/\/ Read'em\n    for (FileMapType::const_iterator it=ref_elem_file.begin();\n\t it != ref_elem_file.end(); ++it)\n      {\n\tstd::istringstream stream(it->second);\n\t\n\tread_ref_elem(it->first,\n\t\t      stream);\n      }\n  }\n\n\n\n  \/\/ Class to setup singleton data\n  class ReferenceElemSetup : public Singleton::Setup\n  {\n    void setup ()\n    {\n      init_ref_elem_table();\n    }\n  } reference_elem_setup;\n\n} \/\/ anonymous namespace\n\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ external API Implementation \nnamespace libMesh\n{\n  namespace ReferenceElem\n  {\n    const Elem & get (const ElemType Type)\n    {\n      libmesh_assert_less (Type, INVALID_ELEM);\n      \n      init_ref_elem_table();\n      \n      libmesh_assert (ref_elem_map[Type] != NULL);\n\n      return *ref_elem_map[Type];\n    }\n  } \/\/ namespace ReferenceElem\n} \/\/ namespace libMesh\n<commit_msg>defer initialization until requested<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2013 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\n\/\/ Local includes\n#include \"libmesh\/node.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/reference_elem.h\"\n#include \"libmesh\/libmesh_singleton.h\"\n#include \"libmesh\/threads.h\"\n\n\/\/ C++ includes\n#include <map>\n\n\n\/\/-----------------------------------------------\n\/\/ anonymous namespace for implementation details\nnamespace\n{\n  using namespace libMesh;\n  \n  namespace ElemDataStrings\n  {\n#include \"reference_elem.data\"\n  }\n  \n  typedef Threads::spin_mutex InitMutex;\n  \n  \/\/ Mutex for thread safety.\n  InitMutex init_mtx;\n\n  \/\/ map from ElemType to reference element file system object name\n  typedef std::map<ElemType, const char*> FileMapType;\n  FileMapType ref_elem_file;\n  Elem* ref_elem_map[INVALID_ELEM];\n\n\n  \n  class SingletonCache : public libMesh::Singleton\n  {\n  public:\n    ~SingletonCache()\n    {\n      for (unsigned int e=0; e<elem_list.size(); e++)\n\tif (elem_list[e])\n\t  {\n\t    delete elem_list[e];\n\t    elem_list[e] = NULL;\n\t  }\n      \n      elem_list.clear();\n\n      for (unsigned int n=0; n<node_list.size(); n++)\n\tif (node_list[n])\n\t  {\n\t    delete node_list[n];\n\t    node_list[n] = NULL;\n\t  }\n\n      node_list.clear();\n    }\n      \n    std::vector<Node*> node_list;\n    std::vector<Elem*> elem_list;\n  };\n\n  \/\/ singleton object, dynamically created and then\n  \/\/ removed at program exit\n  SingletonCache *singleton_cache = NULL;\n    \n\n\n  Elem* read_ref_elem (const ElemType Type,\n\t\t       std::istream &in)\n  {\n    libmesh_assert (singleton_cache != NULL);\n\n    static const unsigned int comm_len = 1024;\n    char comm[comm_len];\n    \n    std::string foo;\n    unsigned int n_elem, n_nodes, elem_type, nn;\n    double x, y, z;\n    \n    in >> foo;\n    in >> n_elem;  \/**\/ in.getline (comm, comm_len); libmesh_assert_equal_to (n_elem, 1);\n    in >> n_nodes; \/**\/ in.getline (comm, comm_len);\n    in >> foo;     \/**\/ in.getline (comm, comm_len);\n    in >> foo;     \/**\/ in.getline (comm, comm_len);\n    in >> foo;     \/**\/ in.getline (comm, comm_len);\n    in >> foo;     \/**\/ in.getline (comm, comm_len);\n    in >> n_elem;  \/**\/ in.getline (comm, comm_len); libmesh_assert_equal_to (n_elem, 1);\n\n    in >> elem_type;\n\n    libmesh_assert_less (elem_type, INVALID_ELEM);\n    libmesh_assert_equal_to (elem_type, Type);\n    libmesh_assert_equal_to (n_nodes, Elem::type_to_n_nodes_map[elem_type]);\n    \n    \/\/ Construct the elem\n    Elem *elem = Elem::build(static_cast<ElemType>(elem_type)).release();\n    \n    \/\/ We are expecing an identity map, so assert it!\n    for (unsigned int n=0; n<n_nodes; n++)\n      {\n\tin >> nn;\n\tlibmesh_assert_equal_to (n,nn);\n      }\n    \n    for (unsigned int n=0; n<n_nodes; n++)\n      {\n\tin >> x >> y >> z;\n\n\tNode *node = new Node(x,y,z,n);\n\tsingleton_cache->node_list.push_back(node);\n\n\telem->set_node(n) = node;\n      }\n\n\n    \/\/ it is entirely possible we ran out of file or encountered\n    \/\/ another error.  If so, cleanly abort.\n    if (!in)\n      {\n\tdelete elem;\n\telem = NULL;\n\tlibMesh::err << \"ERROR while creating element singleton!\\n\";\n\tlibmesh_error();\n      }\n\n    else\n      singleton_cache->elem_list.push_back (elem);\n    \n    ref_elem_map[Type] = elem;\n\n    return elem;\n  }\n\n \n   \n  void init_ref_elem_table()\n  {\n    \/\/ ouside mutex - if this flag is set, we can\n    \/\/ trust it.\n    if (singleton_cache != NULL) return;\n    \n    \/\/ playing with fire here - lock before touching shared\n    \/\/ data structures\n    InitMutex::scoped_lock lock(init_mtx);\n\n    \/\/ inside mutex - pointer may have changed while waiting\n    \/\/ for the lock to acquire, check it again.\n    if (singleton_cache != NULL) return;\n\n    \/\/ OK, if we get here we have the lock and we are not\n    \/\/ initialized.  populate singleton.\n    singleton_cache = new SingletonCache;\n    \n    \/\/ initialize the reference file table\n    {\n      ref_elem_file.clear();\n      \n      \/\/ \/\/ 1D elements\n      ref_elem_file[EDGE2]    = ElemDataStrings::one_edge;\n      ref_elem_file[EDGE3]    = ElemDataStrings::one_edge3;\n      ref_elem_file[EDGE4]    = ElemDataStrings::one_edge4;\n      \t\t\t      \n      \/\/ 2D elements\t      \n      ref_elem_file[TRI3]     = ElemDataStrings::one_tri;\n      ref_elem_file[TRI6]     = ElemDataStrings::one_tri6;\n      \t\t\t      \n      ref_elem_file[QUAD4]    = ElemDataStrings::one_quad;\n      ref_elem_file[QUAD8]    = ElemDataStrings::one_quad8;\n      ref_elem_file[QUAD9]    = ElemDataStrings::one_quad9;\n      \t\t\t      \n      \/\/ 3D elements\t      \n      ref_elem_file[HEX8]     = ElemDataStrings::one_hex;\n      ref_elem_file[HEX20]    = ElemDataStrings::one_hex20;\n      ref_elem_file[HEX27]    = ElemDataStrings::one_hex27;\n      \t\t\t      \n      ref_elem_file[TET4]     = ElemDataStrings::one_tet;\n      ref_elem_file[TET10]    = ElemDataStrings::one_tet10;\n      \t\t\t      \n      ref_elem_file[PRISM6]   = ElemDataStrings::one_prism;\n      ref_elem_file[PRISM15]  = ElemDataStrings::one_prism15;\n      ref_elem_file[PRISM18]  = ElemDataStrings::one_prism18;\n\n      ref_elem_file[PYRAMID5] = ElemDataStrings::one_pyramid;\n    }\n\n    \/\/ Read'em\n    for (FileMapType::const_iterator it=ref_elem_file.begin();\n\t it != ref_elem_file.end(); ++it)\n      {\n\tstd::istringstream stream(it->second);\n\t\n\tread_ref_elem(it->first,\n\t\t      stream);\n      }\n  }\n\n\n  \/\/ no reason to do this at startup - \n  \/\/ data structures will get initialized *if*\n  \/\/ ReferenceElem::get() is ever called.\n  \/\/ \/\/ Class to setup singleton data\n  \/\/ class ReferenceElemSetup : public Singleton::Setup\n  \/\/ {\n  \/\/   void setup ()\n  \/\/   {\n  \/\/     init_ref_elem_table();\n  \/\/   }\n  \/\/ } reference_elem_setup;\n\n} \/\/ anonymous namespace\n\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ external API Implementation \nnamespace libMesh\n{\n  namespace ReferenceElem\n  {\n    const Elem & get (const ElemType Type)\n    {\n      libmesh_assert_less (Type, INVALID_ELEM);\n      \n      init_ref_elem_table();\n      \n      libmesh_assert (ref_elem_map[Type] != NULL);\n\n      return *ref_elem_map[Type];\n    }\n  } \/\/ namespace ReferenceElem\n} \/\/ namespace libMesh\n<|endoftext|>"}
{"text":"<commit_before>#include \".\/object_manager.h\"\n#include <QLoggingCategory>\n#include <vector>\n#include <map>\n#include <string>\n#include <algorithm>\n#include \".\/gl.h\"\n#include \".\/buffer_manager.h\"\n#include \".\/texture_manager.h\"\n#include \".\/shader_manager.h\"\n\nnamespace Graphics\n{\n\nQLoggingCategory omChan(\"Graphics.ObjectManager\");\n\nObjectManager::ObjectManager(std::shared_ptr<TextureManager> textureManager,\n                             std::shared_ptr<ShaderManager> shaderManager)\n  : bufferManager(std::make_shared<BufferManager>()),\n    textureManager(textureManager), shaderManager(shaderManager),\n    transformBuffer(GL_SHADER_STORAGE_BUFFER),\n    customBuffer(GL_SHADER_STORAGE_BUFFER),\n    commandsBuffer(GL_DRAW_INDIRECT_BUFFER)\n{\n}\n\nObjectManager::~ObjectManager()\n{\n}\n\nvoid ObjectManager::initialize(Gl *gl, uint maxObjectCount, uint bufferSize)\n{\n  this->gl = gl;\n\n  bufferManager->initialize(gl, maxObjectCount, bufferSize);\n\n  commandsBuffer.initialize(gl, 3 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n  transformBuffer.initialize(gl, 3 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n  customBuffer.initialize(gl, 12 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n}\n\nObjectData ObjectManager::addObject(const std::vector<float> &vertices,\n                                    const std::vector<float> &normals,\n                                    const std::vector<float> &colors,\n                                    const std::vector<float> &texCoords,\n                                    const std::vector<uint> &indices,\n                                    int shaderProgramId, int primitiveType)\n{\n  auto bufferInformation =\n      bufferManager->addObject(vertices, normals, colors, texCoords, indices);\n\n  return ObjectData(nextFreeId++, bufferInformation.vertexBufferOffset,\n                    bufferInformation.indexBufferOffset, indices.size(),\n                    shaderProgramId, primitiveType);\n}\n\nObjectData ObjectManager::cloneForDifferentShader(const ObjectData &object,\n                                   int shaderProgramId)\n{\n  return ObjectData(nextFreeId++, object.getVertexOffset(), object.getIndexOffset(),\n      object.getIndexSize(), shaderProgramId, object.getPrimitiveType());\n}\n\nObjectData ObjectManager::clone(const ObjectData &object)\n{\n  return ObjectData(nextFreeId++, object.getVertexOffset(), object.getIndexOffset(),\n      object.getIndexSize(), object.getShaderProgramId(), object.getPrimitiveType());\n}\n\nint ObjectManager::addShader(std::string vertexShaderPath,\n                             std::string fragmentShaderPath)\n{\n  auto id = shaderManager->addShader(vertexShaderPath, fragmentShaderPath);\n\n  qCDebug(omChan) << \"Added\" << vertexShaderPath.c_str() << \"|\"\n                  << fragmentShaderPath.c_str() << \"which got id\" << id;\n\n  return id;\n}\n\nint ObjectManager::addTexture(std::string path)\n{\n  return textureManager->addTexture(path);\n}\n\nTextureAddress ObjectManager::getAddressFor(int textureId)\n{\n  return textureManager->getAddressFor(textureId);\n}\n\nvoid ObjectManager::render(const RenderData &renderData)\n{\n  std::map<int, std::vector<ObjectData>> objectsByShader;\n  for (auto &object : objectsForFrame)\n  {\n    objectsByShader[object.getShaderProgramId()].push_back(object);\n  }\n\n  for (auto &shaderObjectPair : objectsByShader)\n  {\n    qCDebug(omChan) << \"Render objects with shader\" << shaderObjectPair.first\n                    << \"with\" << shaderObjectPair.second.size() << \"objects\";\n\n    shaderManager->bind(shaderObjectPair.first, renderData);\n\n    std::map<int, std::vector<ObjectData>> objectsByPrimitiveType;\n    for (auto &object : shaderObjectPair.second)\n    {\n      objectsByPrimitiveType[object.getPrimitiveType()].push_back(object);\n    }\n\n    for (auto pair : objectsByPrimitiveType)\n    {\n      renderObjects(objectsByPrimitiveType[pair.first]);\n    }\n  }\n\n  objectsForFrame.clear();\n}\n\nvoid ObjectManager::renderImmediately(ObjectData objectData)\n{\n  std::vector<ObjectData> objs = { objectData };\n\n  renderObjects(objs);\n}\n\nvoid ObjectManager::renderLater(ObjectData object)\n{\n  objectsForFrame.push_back(object);\n}\n\nvoid ObjectManager::renderObjects(std::vector<ObjectData> objects)\n{\n  bufferManager->bind();\n\n  \/\/ prepare per object buffers\n  uint objectCount = objects.size();\n  DrawElementsIndirectCommand *commands = commandsBuffer.reserve(objectCount);\n  auto *matrices = transformBuffer.reserve(objectCount);\n  int customBufferSize = objects[0].getCustomBufferSize() * objectCount;\n\n  void *custom = nullptr;\n  if (customBufferSize)\n    custom = customBuffer.reserve(customBufferSize);\n\n  qCDebug(omChan) << \"customBufferSize\" << customBufferSize << \"custom\"\n                  << custom << \"matrices\" << matrices;\n\n  int counter = 0;\n  for (auto &objectData : objects)\n  {\n    commands[counter] = createDrawCommand(objectData, counter);\n\n    auto *transform = &matrices[counter];\n    memcpy(transform, objectData.transform.data(), sizeof(float[16]));\n\n    if (objectData.hasCustomBuffer())\n    {\n      objectData.fillBufferElement(custom, counter);\n    }\n\n    ++counter;\n  }\n\n  transformBuffer.bindBufferRange(0, objectCount);\n  if (customBufferSize)\n    customBuffer.bindBufferRange(1, customBufferSize);\n\n  \/\/ We didn't use MAP_COHERENT here - make sure data is on the gpu\n  \/\/ glAssert(gl->glMemoryBarrier(GL_CLIENT_MAPPED_BUFFER_BARRIER_BIT));\n  glAssert(gl->glMemoryBarrier(GL_ALL_BARRIER_BITS));\n\n  \/\/ draw\n  qCDebug(omChan, \"head: %ld headoffset %p objectcount: %u\",\n          commandsBuffer.getHead(), commandsBuffer.headOffset(), objectCount);\n\n  glAssert(gl->glMultiDrawElementsIndirect(\n      objects[0].getPrimitiveType(), GL_UNSIGNED_INT, commandsBuffer.headOffset(),\n      objectCount, 0));\n\n  bufferManager->unbind();\n\n  commandsBuffer.onUsageComplete(objectCount);\n  transformBuffer.onUsageComplete(objectCount);\n  if (customBufferSize)\n    customBuffer.onUsageComplete(customBufferSize);\n}\n\nObjectManager::DrawElementsIndirectCommand\nObjectManager::createDrawCommand(const ObjectData &objectData, int counter)\n{\n  DrawElementsIndirectCommand command;\n\n  command.count = objectData.getIndexSize();\n  command.instanceCount = 1;\n  command.firstIndex = objectData.getIndexOffset();\n  command.baseVertex = objectData.getVertexOffset();\n  command.baseInstance = counter;\n\n  qCDebug(omChan, \"counter: %d count: %u firstIndex: %u baseVertex: %u\",\n          counter, command.count, command.firstIndex, command.baseVertex);\n\n  return command;\n}\n\n}  \/\/ namespace Graphics\n<commit_msg>Minor: reformatting.<commit_after>#include \".\/object_manager.h\"\n#include <QLoggingCategory>\n#include <vector>\n#include <map>\n#include <string>\n#include <algorithm>\n#include \".\/gl.h\"\n#include \".\/buffer_manager.h\"\n#include \".\/texture_manager.h\"\n#include \".\/shader_manager.h\"\n\nnamespace Graphics\n{\n\nQLoggingCategory omChan(\"Graphics.ObjectManager\");\n\nObjectManager::ObjectManager(std::shared_ptr<TextureManager> textureManager,\n                             std::shared_ptr<ShaderManager> shaderManager)\n  : bufferManager(std::make_shared<BufferManager>()),\n    textureManager(textureManager), shaderManager(shaderManager),\n    transformBuffer(GL_SHADER_STORAGE_BUFFER),\n    customBuffer(GL_SHADER_STORAGE_BUFFER),\n    commandsBuffer(GL_DRAW_INDIRECT_BUFFER)\n{\n}\n\nObjectManager::~ObjectManager()\n{\n}\n\nvoid ObjectManager::initialize(Gl *gl, uint maxObjectCount, uint bufferSize)\n{\n  this->gl = gl;\n\n  bufferManager->initialize(gl, maxObjectCount, bufferSize);\n\n  commandsBuffer.initialize(gl, 3 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n  transformBuffer.initialize(gl, 3 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n  customBuffer.initialize(gl, 12 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n}\n\nObjectData ObjectManager::addObject(const std::vector<float> &vertices,\n                                    const std::vector<float> &normals,\n                                    const std::vector<float> &colors,\n                                    const std::vector<float> &texCoords,\n                                    const std::vector<uint> &indices,\n                                    int shaderProgramId, int primitiveType)\n{\n  auto bufferInformation =\n      bufferManager->addObject(vertices, normals, colors, texCoords, indices);\n\n  return ObjectData(nextFreeId++, bufferInformation.vertexBufferOffset,\n                    bufferInformation.indexBufferOffset, indices.size(),\n                    shaderProgramId, primitiveType);\n}\n\nObjectData ObjectManager::cloneForDifferentShader(const ObjectData &object,\n                                                  int shaderProgramId)\n{\n  return ObjectData(nextFreeId++, object.getVertexOffset(),\n                    object.getIndexOffset(), object.getIndexSize(),\n                    shaderProgramId, object.getPrimitiveType());\n}\n\nObjectData ObjectManager::clone(const ObjectData &object)\n{\n  return ObjectData(nextFreeId++, object.getVertexOffset(),\n                    object.getIndexOffset(), object.getIndexSize(),\n                    object.getShaderProgramId(), object.getPrimitiveType());\n}\n\nint ObjectManager::addShader(std::string vertexShaderPath,\n                             std::string fragmentShaderPath)\n{\n  auto id = shaderManager->addShader(vertexShaderPath, fragmentShaderPath);\n\n  qCDebug(omChan) << \"Added\" << vertexShaderPath.c_str() << \"|\"\n                  << fragmentShaderPath.c_str() << \"which got id\" << id;\n\n  return id;\n}\n\nint ObjectManager::addTexture(std::string path)\n{\n  return textureManager->addTexture(path);\n}\n\nTextureAddress ObjectManager::getAddressFor(int textureId)\n{\n  return textureManager->getAddressFor(textureId);\n}\n\nvoid ObjectManager::render(const RenderData &renderData)\n{\n  std::map<int, std::vector<ObjectData>> objectsByShader;\n  for (auto &object : objectsForFrame)\n  {\n    objectsByShader[object.getShaderProgramId()].push_back(object);\n  }\n\n  for (auto &shaderObjectPair : objectsByShader)\n  {\n    qCDebug(omChan) << \"Render objects with shader\" << shaderObjectPair.first\n                    << \"with\" << shaderObjectPair.second.size() << \"objects\";\n\n    shaderManager->bind(shaderObjectPair.first, renderData);\n\n    std::map<int, std::vector<ObjectData>> objectsByPrimitiveType;\n    for (auto &object : shaderObjectPair.second)\n    {\n      objectsByPrimitiveType[object.getPrimitiveType()].push_back(object);\n    }\n\n    for (auto pair : objectsByPrimitiveType)\n    {\n      renderObjects(objectsByPrimitiveType[pair.first]);\n    }\n  }\n\n  objectsForFrame.clear();\n}\n\nvoid ObjectManager::renderImmediately(ObjectData objectData)\n{\n  std::vector<ObjectData> objs = { objectData };\n\n  renderObjects(objs);\n}\n\nvoid ObjectManager::renderLater(ObjectData object)\n{\n  objectsForFrame.push_back(object);\n}\n\nvoid ObjectManager::renderObjects(std::vector<ObjectData> objects)\n{\n  bufferManager->bind();\n\n  \/\/ prepare per object buffers\n  uint objectCount = objects.size();\n  DrawElementsIndirectCommand *commands = commandsBuffer.reserve(objectCount);\n  auto *matrices = transformBuffer.reserve(objectCount);\n  int customBufferSize = objects[0].getCustomBufferSize() * objectCount;\n\n  void *custom = nullptr;\n  if (customBufferSize)\n    custom = customBuffer.reserve(customBufferSize);\n\n  qCDebug(omChan) << \"customBufferSize\" << customBufferSize << \"custom\"\n                  << custom << \"matrices\" << matrices;\n\n  int counter = 0;\n  for (auto &objectData : objects)\n  {\n    commands[counter] = createDrawCommand(objectData, counter);\n\n    auto *transform = &matrices[counter];\n    memcpy(transform, objectData.transform.data(), sizeof(float[16]));\n\n    if (objectData.hasCustomBuffer())\n    {\n      objectData.fillBufferElement(custom, counter);\n    }\n\n    ++counter;\n  }\n\n  transformBuffer.bindBufferRange(0, objectCount);\n  if (customBufferSize)\n    customBuffer.bindBufferRange(1, customBufferSize);\n\n  \/\/ We didn't use MAP_COHERENT here - make sure data is on the gpu\n  \/\/ glAssert(gl->glMemoryBarrier(GL_CLIENT_MAPPED_BUFFER_BARRIER_BIT));\n  glAssert(gl->glMemoryBarrier(GL_ALL_BARRIER_BITS));\n\n  \/\/ draw\n  qCDebug(omChan, \"head: %ld headoffset %p objectcount: %u\",\n          commandsBuffer.getHead(), commandsBuffer.headOffset(), objectCount);\n\n  glAssert(gl->glMultiDrawElementsIndirect(\n      objects[0].getPrimitiveType(), GL_UNSIGNED_INT,\n      commandsBuffer.headOffset(), objectCount, 0));\n\n  bufferManager->unbind();\n\n  commandsBuffer.onUsageComplete(objectCount);\n  transformBuffer.onUsageComplete(objectCount);\n  if (customBufferSize)\n    customBuffer.onUsageComplete(customBufferSize);\n}\n\nObjectManager::DrawElementsIndirectCommand\nObjectManager::createDrawCommand(const ObjectData &objectData, int counter)\n{\n  DrawElementsIndirectCommand command;\n\n  command.count = objectData.getIndexSize();\n  command.instanceCount = 1;\n  command.firstIndex = objectData.getIndexOffset();\n  command.baseVertex = objectData.getVertexOffset();\n  command.baseInstance = counter;\n\n  qCDebug(omChan, \"counter: %d count: %u firstIndex: %u baseVertex: %u\",\n          counter, command.count, command.firstIndex, command.baseVertex);\n\n  return command;\n}\n\n}  \/\/ namespace Graphics\n<|endoftext|>"}
{"text":"<commit_before>#include \".\/object_manager.h\"\n#include <QLoggingCategory>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include \".\/gl.h\"\n#include \".\/buffer_manager.h\"\n#include \".\/texture_manager.h\"\n#include \".\/shader_manager.h\"\n\nnamespace Graphics\n{\n\nQLoggingCategory omChan(\"Graphics.ObjectManager\");\n\nObjectManager::ObjectManager(std::shared_ptr<TextureManager> textureManager,\n                             std::shared_ptr<ShaderManager> shaderManager)\n  : bufferManager(std::make_shared<BufferManager>()),\n    textureManager(textureManager), shaderManager(shaderManager),\n    transformBuffer(GL_SHADER_STORAGE_BUFFER),\n    customBuffer(GL_SHADER_STORAGE_BUFFER),\n    commandsBuffer(GL_DRAW_INDIRECT_BUFFER)\n\n{\n}\n\nObjectManager::~ObjectManager()\n{\n}\n\nvoid ObjectManager::initialize(Gl *gl, uint maxObjectCount, uint bufferSize)\n{\n  this->gl = gl;\n\n  bufferManager->initialize(gl, maxObjectCount, bufferSize);\n\n  commandsBuffer.initialize(gl, 3 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n  transformBuffer.initialize(gl, 3 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n  customBuffer.initialize(gl, 12 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n}\n\nObjectData ObjectManager::addObject(const std::vector<float> &vertices,\n                                    const std::vector<float> &normals,\n                                    const std::vector<float> &colors,\n                                    const std::vector<float> &texCoords,\n                                    const std::vector<uint> &indices,\n                                    int shaderProgramId, int primitiveType)\n{\n  auto bufferInformation =\n      bufferManager->addObject(vertices, normals, colors, texCoords, indices);\n\n  ObjectData object;\n  object.vertexOffset = bufferInformation.vertexBufferOffset;\n  object.vertexSize = bufferInformation.vertexCount;\n  object.indexOffset = bufferInformation.indexBufferOffset;\n  object.indexSize = indices.size();\n  object.customBufferSize = 0;\n  object.setBuffer = nullptr;\n  object.transform = Eigen::Matrix4f::Identity();\n  object.shaderProgramId = shaderProgramId;\n  object.primitiveType = primitiveType;\n\n  return object;\n}\n\nint ObjectManager::addShader(std::string vertexShaderPath,\n                             std::string fragmentShaderPath)\n{\n  auto id = shaderManager->addShader(vertexShaderPath, fragmentShaderPath);\n\n  qCDebug(omChan) << \"Added\" << vertexShaderPath.c_str() << \"|\"\n                  << fragmentShaderPath.c_str() << \"which got id\" << id;\n\n  return id;\n}\n\nint ObjectManager::addTexture(std::string path)\n{\n  return textureManager->addTexture(path);\n}\n\nTextureAddress ObjectManager::getAddressFor(int textureId)\n{\n  return textureManager->getAddressFor(textureId);\n}\n\nvoid ObjectManager::render(const RenderData &renderData)\n{\n  std::map<int, std::vector<ObjectData>> objectsByShader;\n  for (auto &object : objectsForFrame)\n  {\n    objectsByShader[object.shaderProgramId].push_back(object);\n  }\n\n  for (auto &shaderObjectPair : objectsByShader)\n  {\n    qCDebug(omChan) << \"Render objects with shader\" << shaderObjectPair.first\n                    << \"with\" << shaderObjectPair.second.size() << \"objects\";\n\n    shaderManager->bind(shaderObjectPair.first, renderData);\n\n    std::map<int, std::vector<ObjectData>> objectsByPrimitiveType;\n    for (auto &object : shaderObjectPair.second)\n    {\n      objectsByPrimitiveType[object.primitiveType].push_back(object);\n    }\n\n    for (auto pair : objectsByPrimitiveType)\n    {\n      renderObjects(objectsByPrimitiveType[pair.first]);\n    }\n  }\n\n  objectsForFrame.clear();\n}\n\nvoid ObjectManager::renderImmediately(ObjectData objectData)\n{\n  std::vector<ObjectData> objs = { objectData };\n\n  renderObjects(objs);\n}\n\nvoid ObjectManager::renderLater(ObjectData object)\n{\n  objectsForFrame.push_back(object);\n}\n\nvoid ObjectManager::renderObjects(std::vector<ObjectData> objects)\n{\n  bufferManager->bind();\n\n  \/\/ prepare per object buffers\n  uint objectCount = objects.size();\n  DrawElementsIndirectCommand *commands = commandsBuffer.reserve(objectCount);\n  auto *matrices = transformBuffer.reserve(objectCount);\n  int customBufferSize = objects[0].customBufferSize * objectCount;\n\n  void *custom = nullptr;\n  if (customBufferSize)\n    custom = customBuffer.reserve(customBufferSize);\n\n  qCDebug(omChan) << \"customBufferSize\" << customBufferSize << \"custom\"\n                  << custom << \"matrices\" << matrices;\n\n  int counter = 0;\n  for (auto &objectData : objects)\n  {\n    commands[counter] = createDrawCommand(objectData, counter);\n\n    auto *transform = &matrices[counter];\n    memcpy(transform, objectData.transform.data(), sizeof(float[16]));\n\n    if (objectData.setBuffer && customBufferSize)\n    {\n      objectData.setBuffer(static_cast<char *>(custom) +\n                           counter * objectData.customBufferSize);\n    }\n\n    ++counter;\n  }\n\n  qCDebug(omChan, \"objectcount: %u\/%ld\", objectCount, commandsBuffer.size());\n\n  int mapRange = ((objectCount \/ 4) + 1) * 4;\n  transformBuffer.bindBufferRange(0, mapRange);\n  int customMapRange = ((customBufferSize \/ 16) + 1) * 16;\n  if (customBufferSize)\n    customBuffer.bindBufferRange(1, customMapRange);\n\n  \/\/ We didn't use MAP_COHERENT here - make sure data is on the gpu\n  \/\/ glAssert(gl->glMemoryBarrier(GL_CLIENT_MAPPED_BUFFER_BARRIER_BIT));\n  glAssert(gl->glMemoryBarrier(GL_ALL_BARRIER_BITS));\n\n  \/\/ draw\n  qCDebug(omChan, \"head: %ld headoffset %p objectcount: %un\",\n          commandsBuffer.getHead(), commandsBuffer.headOffset(), objectCount);\n\n  glAssert(gl->glMultiDrawElementsIndirect(\n      objects[0].primitiveType, GL_UNSIGNED_INT, commandsBuffer.headOffset(),\n      objectCount, 0));\n\n  bufferManager->unbind();\n\n  commandsBuffer.onUsageComplete(mapRange);\n  transformBuffer.onUsageComplete(mapRange);\n  if (customBufferSize)\n    customBuffer.onUsageComplete(customMapRange);\n}\n\nDrawElementsIndirectCommand\nObjectManager::createDrawCommand(const ObjectData &objectData, int counter)\n{\n  DrawElementsIndirectCommand command;\n\n  command.count = objectData.indexSize;\n  command.instanceCount = 1;\n  command.firstIndex = objectData.indexOffset;\n  command.baseVertex = objectData.vertexOffset;\n  command.baseInstance = counter;\n\n  qCDebug(omChan, \"counter: %d count: %u firstIndex: %u baseVertex: %u\",\n          counter, command.count, command.firstIndex, command.baseVertex);\n\n  return command;\n}\n\n}  \/\/ namespace Graphics\n<commit_msg>Remove buffer range alignment from ObjectManager.<commit_after>#include \".\/object_manager.h\"\n#include <QLoggingCategory>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include \".\/gl.h\"\n#include \".\/buffer_manager.h\"\n#include \".\/texture_manager.h\"\n#include \".\/shader_manager.h\"\n\nnamespace Graphics\n{\n\nQLoggingCategory omChan(\"Graphics.ObjectManager\");\n\nObjectManager::ObjectManager(std::shared_ptr<TextureManager> textureManager,\n                             std::shared_ptr<ShaderManager> shaderManager)\n  : bufferManager(std::make_shared<BufferManager>()),\n    textureManager(textureManager), shaderManager(shaderManager),\n    transformBuffer(GL_SHADER_STORAGE_BUFFER),\n    customBuffer(GL_SHADER_STORAGE_BUFFER),\n    commandsBuffer(GL_DRAW_INDIRECT_BUFFER)\n{\n}\n\nObjectManager::~ObjectManager()\n{\n}\n\nvoid ObjectManager::initialize(Gl *gl, uint maxObjectCount, uint bufferSize)\n{\n  this->gl = gl;\n\n  bufferManager->initialize(gl, maxObjectCount, bufferSize);\n\n  commandsBuffer.initialize(gl, 3 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n  transformBuffer.initialize(gl, 3 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n  customBuffer.initialize(gl, 12 * maxObjectCount, CREATE_FLAGS, MAP_FLAGS);\n}\n\nObjectData ObjectManager::addObject(const std::vector<float> &vertices,\n                                    const std::vector<float> &normals,\n                                    const std::vector<float> &colors,\n                                    const std::vector<float> &texCoords,\n                                    const std::vector<uint> &indices,\n                                    int shaderProgramId, int primitiveType)\n{\n  auto bufferInformation =\n      bufferManager->addObject(vertices, normals, colors, texCoords, indices);\n\n  ObjectData object;\n  object.vertexOffset = bufferInformation.vertexBufferOffset;\n  object.vertexSize = bufferInformation.vertexCount;\n  object.indexOffset = bufferInformation.indexBufferOffset;\n  object.indexSize = indices.size();\n  object.customBufferSize = 0;\n  object.setBuffer = nullptr;\n  object.transform = Eigen::Matrix4f::Identity();\n  object.shaderProgramId = shaderProgramId;\n  object.primitiveType = primitiveType;\n\n  return object;\n}\n\nint ObjectManager::addShader(std::string vertexShaderPath,\n                             std::string fragmentShaderPath)\n{\n  auto id = shaderManager->addShader(vertexShaderPath, fragmentShaderPath);\n\n  qCDebug(omChan) << \"Added\" << vertexShaderPath.c_str() << \"|\"\n                  << fragmentShaderPath.c_str() << \"which got id\" << id;\n\n  return id;\n}\n\nint ObjectManager::addTexture(std::string path)\n{\n  return textureManager->addTexture(path);\n}\n\nTextureAddress ObjectManager::getAddressFor(int textureId)\n{\n  return textureManager->getAddressFor(textureId);\n}\n\nvoid ObjectManager::render(const RenderData &renderData)\n{\n  std::map<int, std::vector<ObjectData>> objectsByShader;\n  for (auto &object : objectsForFrame)\n  {\n    objectsByShader[object.shaderProgramId].push_back(object);\n  }\n\n  for (auto &shaderObjectPair : objectsByShader)\n  {\n    qCDebug(omChan) << \"Render objects with shader\" << shaderObjectPair.first\n                    << \"with\" << shaderObjectPair.second.size() << \"objects\";\n\n    shaderManager->bind(shaderObjectPair.first, renderData);\n\n    std::map<int, std::vector<ObjectData>> objectsByPrimitiveType;\n    for (auto &object : shaderObjectPair.second)\n    {\n      objectsByPrimitiveType[object.primitiveType].push_back(object);\n    }\n\n    for (auto pair : objectsByPrimitiveType)\n    {\n      renderObjects(objectsByPrimitiveType[pair.first]);\n    }\n  }\n\n  objectsForFrame.clear();\n}\n\nvoid ObjectManager::renderImmediately(ObjectData objectData)\n{\n  std::vector<ObjectData> objs = { objectData };\n\n  renderObjects(objs);\n}\n\nvoid ObjectManager::renderLater(ObjectData object)\n{\n  objectsForFrame.push_back(object);\n}\n\nvoid ObjectManager::renderObjects(std::vector<ObjectData> objects)\n{\n  bufferManager->bind();\n\n  \/\/ prepare per object buffers\n  uint objectCount = objects.size();\n  DrawElementsIndirectCommand *commands = commandsBuffer.reserve(objectCount);\n  auto *matrices = transformBuffer.reserve(objectCount);\n  int customBufferSize = objects[0].customBufferSize * objectCount;\n\n  void *custom = nullptr;\n  if (customBufferSize)\n    custom = customBuffer.reserve(customBufferSize);\n\n  qCDebug(omChan) << \"customBufferSize\" << customBufferSize << \"custom\"\n                  << custom << \"matrices\" << matrices;\n\n  int counter = 0;\n  for (auto &objectData : objects)\n  {\n    commands[counter] = createDrawCommand(objectData, counter);\n\n    auto *transform = &matrices[counter];\n    memcpy(transform, objectData.transform.data(), sizeof(float[16]));\n\n    if (objectData.setBuffer && customBufferSize)\n    {\n      objectData.setBuffer(static_cast<char *>(custom) +\n                           counter * objectData.customBufferSize);\n    }\n\n    ++counter;\n  }\n\n  qCDebug(omChan, \"objectcount: %u\/%ld\", objectCount, commandsBuffer.size());\n  transformBuffer.bindBufferRange(0, objectCount);\n  if (customBufferSize)\n    customBuffer.bindBufferRange(1, customBufferSize);\n\n  \/\/ We didn't use MAP_COHERENT here - make sure data is on the gpu\n  \/\/ glAssert(gl->glMemoryBarrier(GL_CLIENT_MAPPED_BUFFER_BARRIER_BIT));\n  glAssert(gl->glMemoryBarrier(GL_ALL_BARRIER_BITS));\n\n  \/\/ draw\n  qCDebug(omChan, \"head: %ld headoffset %p objectcount: %un\",\n          commandsBuffer.getHead(), commandsBuffer.headOffset(), objectCount);\n\n  glAssert(gl->glMultiDrawElementsIndirect(\n      objects[0].primitiveType, GL_UNSIGNED_INT, commandsBuffer.headOffset(),\n      objectCount, 0));\n\n  bufferManager->unbind();\n\n  commandsBuffer.onUsageComplete(objectCount);\n  transformBuffer.onUsageComplete(objectCount);\n  if (customBufferSize)\n    customBuffer.onUsageComplete(customBufferSize);\n}\n\nDrawElementsIndirectCommand\nObjectManager::createDrawCommand(const ObjectData &objectData, int counter)\n{\n  DrawElementsIndirectCommand command;\n\n  command.count = objectData.indexSize;\n  command.instanceCount = 1;\n  command.firstIndex = objectData.indexOffset;\n  command.baseVertex = objectData.vertexOffset;\n  command.baseInstance = counter;\n\n  qCDebug(omChan, \"counter: %d count: %u firstIndex: %u baseVertex: %u\",\n          counter, command.count, command.firstIndex, command.baseVertex);\n\n  return command;\n}\n\n}  \/\/ namespace Graphics\n<|endoftext|>"}
{"text":"<commit_before>#include \"gui\/controls\/scrollable.h\"\n#include \"core\/crc32.h\"\n#include \"core\/iserializer.h\"\n#include \"gui\/controls\/scrollbar.h\"\n\n\nnamespace Lux\n{\nnamespace UI\n{\n\n\nScrollable::Scrollable(Gui& gui, Block* parent)\n\t: Block(gui, parent, \"_box\")\n{\n\tsetArea(0, 0, 0, 0, 1, 0, 1, 0);\n\tm_container = new Lux::UI::Block(gui, this, NULL);\n\tm_container->setIsClipping(true);\n\tm_container->setArea(0, 0, 0, 0, 1, 0, 1, 0);\n\n\tm_vertical_scrollbar = new Scrollbar(gui, this);\n\tm_vertical_scrollbar->setArea(1, -20, 0, 0, 1, 0, 1, 0); \n\tm_vertical_scrollbar->hide();\n\tm_vertical_scrollbar->setScrollbarType(Scrollbar::VERTICAL);\n\tm_vertical_scrollbar->getCallback(\"value_changed\").bind<Scrollable, &Scrollable::scrollbarValueChanged>(this);\n\n\tm_horizontal_scrollbar = new Scrollbar(gui, this);\n\tm_horizontal_scrollbar->setArea(0, 0, 1, -20, 1, 0, 1, 0); \n\tm_horizontal_scrollbar->hide();\n\tm_horizontal_scrollbar->getCallback(\"value_changed\").bind<Scrollable, &Scrollable::scrollbarValueChanged>(this);\n}\n\n\n\n\n\nScrollable::~Scrollable()\n{\n}\n\n\nuint32_t Scrollable::getType() const\n{\n\tstatic const uint32_t hash = crc32(\"scrollable\");\n\treturn hash;\n}\n\n\nvoid Scrollable::scrollbarValueChanged(Block& block, void*)\n{\n\tlayout();\n}\n\n\nvoid Scrollable::serialize(ISerializer& serializer)\n{\n\tBlock::serialize(serializer);\n}\n\n\nvoid Scrollable::deserialize(ISerializer& serializer)\n{\n\tBlock::deserialize(serializer);\n}\n\n\nvoid Scrollable::layout()\n{\n\tBlock::layout();\n\tif(m_container->getChildCount() > 0)\n\t{\n\t\tArea content_size = m_container->getChild(m_container->getChildCount()-1)->getGlobalArea();\n\t\tfor(int i = m_container->getChildCount() - 2; i >= 0; --i)\n\t\t{\n\t\t\tcontent_size.merge(m_container->getChild(i)->getGlobalArea());\n\t\t}\n\t\tfloat container_delta_w = 0;\n\t\tfloat container_delta_h = 0;\n\t\tbool both_visible = true;\n\t\tif(m_container->getGlobalWidth() < content_size.right)\n\t\t{\n\t\t\tm_horizontal_scrollbar->show();\n\t\t\tcontainer_delta_h = -m_horizontal_scrollbar->getGlobalHeight();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tboth_visible = false;\n\t\t\tm_horizontal_scrollbar->hide();\n\t\t}\n\t\tif(m_container->getGlobalHeight() < content_size.bottom)\n\t\t{\n\t\t\tm_vertical_scrollbar->show();\n\t\t\tcontainer_delta_w = -m_vertical_scrollbar->getGlobalWidth();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tboth_visible = false;\n\t\t\tm_vertical_scrollbar->hide();\n\t\t}\n\t\tif(both_visible)\n\t\t{\n\t\t\tm_vertical_scrollbar->setArea(1, -20, 0, 0, 1, 0, 1, -20); \n\t\t\tm_horizontal_scrollbar->setArea(0, 0, 1, -20, 1, -20, 1, 0); \n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_vertical_scrollbar->setArea(1, -20, 0, 0, 1, 0, 1, 0); \n\t\t\tm_horizontal_scrollbar->setArea(0, 0, 1, -20, 1, 0, 1, 0); \n\t\t}\n\t\tm_container->setArea(0, 0, 0, 0, 1, container_delta_w, 1, container_delta_h);\n\t\tm_container->layout();\n\t\tfloat dx = m_horizontal_scrollbar->isShown() ? m_horizontal_scrollbar->getRelativeValue() : 0;\n\t\tfloat dy = m_vertical_scrollbar->isShown() ? m_vertical_scrollbar->getRelativeValue() : 0;\n\t\tdx *= content_size.right - m_container->getGlobalRight();\n\t\tdy *= content_size.bottom - m_container->getGlobalBottom();\n\t\tdx = (float)(int)dx;\n\t\tdy = (float)(int)dy;\n\t\tfor(int i = m_container->getChildCount() - 1; i >= 0; --i)\n\t\t{\n\t\t\tArea& area = m_container->getChild(i)->getGlobalArea();\n\t\t\tarea.left -= dx;\n\t\t\tarea.right -= dx;\n\t\t\tarea.top -= dy;\n\t\t\tarea.bottom -= dy;\n\t\t}\n\t\tm_vertical_scrollbar->layout();\n\t\tm_horizontal_scrollbar->layout();\n\t}\n\telse\n\t{\n\t\tm_vertical_scrollbar->hide();\n\t\tm_horizontal_scrollbar->hide();\n\t}\n}\n\n\n} \/\/ ~namespace UI\n} \/\/ ~namespace Lux<commit_msg>scrollbars in a scrollable are properly shown \/ hidden<commit_after>#include \"gui\/controls\/scrollable.h\"\n#include \"core\/crc32.h\"\n#include \"core\/iserializer.h\"\n#include \"gui\/controls\/scrollbar.h\"\n\n\nnamespace Lux\n{\nnamespace UI\n{\n\n\nScrollable::Scrollable(Gui& gui, Block* parent)\n\t: Block(gui, parent, \"_box\")\n{\n\tsetArea(0, 0, 0, 0, 1, 0, 1, 0);\n\tm_container = new Lux::UI::Block(gui, this, NULL);\n\tm_container->setIsClipping(true);\n\tm_container->setArea(0, 0, 0, 0, 1, 0, 1, 0);\n\n\tm_vertical_scrollbar = new Scrollbar(gui, this);\n\tm_vertical_scrollbar->setArea(1, -20, 0, 0, 1, 0, 1, 0); \n\tm_vertical_scrollbar->hide();\n\tm_vertical_scrollbar->setScrollbarType(Scrollbar::VERTICAL);\n\tm_vertical_scrollbar->getCallback(\"value_changed\").bind<Scrollable, &Scrollable::scrollbarValueChanged>(this);\n\n\tm_horizontal_scrollbar = new Scrollbar(gui, this);\n\tm_horizontal_scrollbar->setArea(0, 0, 1, -20, 1, 0, 1, 0); \n\tm_horizontal_scrollbar->hide();\n\tm_horizontal_scrollbar->getCallback(\"value_changed\").bind<Scrollable, &Scrollable::scrollbarValueChanged>(this);\n}\n\n\n\n\n\nScrollable::~Scrollable()\n{\n}\n\n\nuint32_t Scrollable::getType() const\n{\n\tstatic const uint32_t hash = crc32(\"scrollable\");\n\treturn hash;\n}\n\n\nvoid Scrollable::scrollbarValueChanged(Block& block, void*)\n{\n\tlayout();\n}\n\n\nvoid Scrollable::serialize(ISerializer& serializer)\n{\n\tBlock::serialize(serializer);\n}\n\n\nvoid Scrollable::deserialize(ISerializer& serializer)\n{\n\tBlock::deserialize(serializer);\n}\n\n\nvoid Scrollable::layout()\n{\n\tBlock::layout();\n\tif(m_container->getChildCount() > 0)\n\t{\n\t\tArea content_size = m_container->getChild(m_container->getChildCount()-1)->getGlobalArea();\n\t\tfor(int i = m_container->getChildCount() - 2; i >= 0; --i)\n\t\t{\n\t\t\tcontent_size.merge(m_container->getChild(i)->getGlobalArea());\n\t\t}\n\t\tfloat container_delta_w = 0;\n\t\tfloat container_delta_h = 0;\n\t\tbool both_visible = true;\n\t\tif(m_container->getGlobalWidth() < content_size.right - content_size.left)\n\t\t{\n\t\t\tm_horizontal_scrollbar->show();\n\t\t\tcontainer_delta_h = -m_horizontal_scrollbar->getGlobalHeight();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tboth_visible = false;\n\t\t\tm_horizontal_scrollbar->hide();\n\t\t}\n\t\tif(m_container->getGlobalHeight() < content_size.bottom - content_size.top)\n\t\t{\n\t\t\tm_vertical_scrollbar->show();\n\t\t\tcontainer_delta_w = -m_vertical_scrollbar->getGlobalWidth();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tboth_visible = false;\n\t\t\tm_vertical_scrollbar->hide();\n\t\t}\n\t\tif(both_visible)\n\t\t{\n\t\t\tm_vertical_scrollbar->setArea(1, -20, 0, 0, 1, 0, 1, -20); \n\t\t\tm_horizontal_scrollbar->setArea(0, 0, 1, -20, 1, -20, 1, 0); \n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_vertical_scrollbar->setArea(1, -20, 0, 0, 1, 0, 1, 0); \n\t\t\tm_horizontal_scrollbar->setArea(0, 0, 1, -20, 1, 0, 1, 0); \n\t\t}\n\t\tm_container->setArea(0, 0, 0, 0, 1, container_delta_w, 1, container_delta_h);\n\t\tm_container->layout();\n\t\tfloat dx = m_horizontal_scrollbar->isShown() ? m_horizontal_scrollbar->getRelativeValue() : 0;\n\t\tfloat dy = m_vertical_scrollbar->isShown() ? m_vertical_scrollbar->getRelativeValue() : 0;\n\t\tdx *= content_size.right - m_container->getGlobalRight();\n\t\tdy *= content_size.bottom - m_container->getGlobalBottom();\n\t\tdx = (float)(int)dx;\n\t\tdy = (float)(int)dy;\n\t\tfor(int i = m_container->getChildCount() - 1; i >= 0; --i)\n\t\t{\n\t\t\tArea& area = m_container->getChild(i)->getGlobalArea();\n\t\t\tarea.left -= dx;\n\t\t\tarea.right -= dx;\n\t\t\tarea.top -= dy;\n\t\t\tarea.bottom -= dy;\n\t\t}\n\t\tm_vertical_scrollbar->layout();\n\t\tm_horizontal_scrollbar->layout();\n\t}\n\telse\n\t{\n\t\tm_vertical_scrollbar->hide();\n\t\tm_horizontal_scrollbar->hide();\n\t}\n}\n\n\n} \/\/ ~namespace UI\n} \/\/ ~namespace Lux<|endoftext|>"}
{"text":"<commit_before>#ifndef __ENVIRE_CORE_ENVIRE_GRAPH__\n#define __ENVIRE_CORE_ENVIRE_GRAPH__\n\n#include <boost\/graph\/adjacency_list.hpp>\n#include <boost\/graph\/labeled_graph.hpp>\n#include <boost\/graph\/properties.hpp>\n#include <boost\/pending\/property.hpp>\n#include <boost\/property_map\/transform_value_property_map.hpp>\n#include <boost\/type_traits.hpp>\n#include <boost\/mpl\/if.hpp>\n\nnamespace boost\n{\n\n    struct EnvireGraphTag { };\n\n    \/**\n     * The EnvireGraph class template is a simplified version of the BGL\n     * adjacency list. This class is provided for ease of use, but may not\n     * perform as well as custom-defined adjacency list classes. Instances of\n     * this template model the BidirectionalGraph, VertexIndexGraph, and\n     * EdgeIndexGraph concepts. The graph is also fully mutable, supporting\n     * both insertions and removals of vertices and edges.\n     *\n     * @note Special care must be taken when removing vertices or edges since\n     * those operations can invalidate the numbering of vertices.\n     *\/\n    template <\n        typename VertexProp = no_property,\n        typename EdgeProp = no_property,\n        typename GraphProp = no_property>\n    class EnvireGraph\n    {\n    public:\n        typedef GraphProp graph_property_type;\n        typedef VertexProp vertex_property_type;\n        typedef EdgeProp edge_property_type;\n        typedef typename lookup_one_property<GraphProp, graph_bundle_t>::type graph_bundled;\n        typedef typename lookup_one_property<VertexProp, vertex_bundle_t>::type vertex_bundled;\n        typedef typename lookup_one_property<EdgeProp, edge_bundle_t>::type edge_bundled;\n\n    public:\n        \/\/ Embed indices into the vertex type.\n        typedef property<vertex_index_t, unsigned, vertex_property_type> internal_vertex_property;\n        typedef property<edge_index_t, unsigned, edge_property_type> internal_edge_property;\n    public:\n        typedef boost::labeled_graph<\n            boost::adjacency_list<\n            listS, listS, bidirectionalS,\n            internal_vertex_property, internal_edge_property, GraphProp,\n            listS>, std::string> graph_type;\n\n    private:\n        \/\/ storage selectors\n        typedef typename graph_type::vertex_list_selector vertex_list_selector;\n        typedef typename graph_type::edge_list_selector edge_list_selector;\n        typedef typename graph_type::out_edge_list_selector out_edge_list_selector;\n        typedef typename graph_type::directed_selector directed_selector;\n\n    public:\n        \/\/ more commonly used graph types\n        typedef typename graph_type::stored_vertex stored_vertex;\n        typedef typename graph_type::vertices_size_type vertices_size_type;\n        typedef typename graph_type::edges_size_type edges_size_type;\n        typedef typename graph_type::degree_size_type degree_size_type;\n        typedef typename graph_type::vertex_descriptor vertex_descriptor;\n        typedef typename graph_type::edge_descriptor edge_descriptor;\n\n        \/\/ iterator types\n        typedef typename graph_type::vertex_iterator vertex_iterator;\n        typedef typename graph_type::edge_iterator edge_iterator;\n        typedef typename graph_type::out_edge_iterator out_edge_iterator;\n        typedef typename graph_type::in_edge_iterator in_edge_iterator;\n        typedef typename graph_type::adjacency_iterator adjacency_iterator;\n\n        \/\/ miscellaneous types\n        typedef EnvireGraphTag graph_tag;\n        typedef typename graph_type::directed_category directed_category;\n        typedef typename graph_type::edge_parallel_category edge_parallel_category;\n        typedef typename graph_type::traversal_category traversal_category;\n\n        typedef std::size_t vertex_index_type;\n        typedef std::size_t edge_index_type;\n\n        EnvireGraph(GraphProp const& p = GraphProp())\n            : m_graph(p), m_num_vertices(0), m_num_edges(0), m_max_vertex_index(0)\n            , m_max_edge_index(0)\n        { }\n\n        EnvireGraph(EnvireGraph const& x)\n            : m_graph(x), m_num_vertices(x.m_num_vertices), m_num_edges(x.m_num_edges)\n            , m_max_vertex_index(x.m_max_vertex_index), m_max_edge_index(x.m_max_edge_index)\n        { }\n\n        EnvireGraph(vertices_size_type n, GraphProp const& p = GraphProp())\n            : m_graph(n, p), m_num_vertices(n), m_num_edges(0), m_max_vertex_index(n)\n            , m_max_edge_index(0)\n        { renumber_vertex_indices(); }\n\n        template <typename EdgeIterator>\n        EnvireGraph(EdgeIterator f,\n                       EdgeIterator l,\n                       vertices_size_type n,\n                       edges_size_type m = 0,\n                       GraphProp const& p = GraphProp())\n            : m_graph(f, l, n, m, p), m_num_vertices(n), m_num_edges(0)\n            , m_max_vertex_index(n), m_max_edge_index(0)\n        {\n            \/\/ Unfortunately, we have to renumber the entire graph.\n            renumber_indices();\n\n            \/\/ Can't always guarantee that the number of edges is actually\n            \/\/ m if distance(f, l) != m (or is undefined).\n            m_num_edges = m_max_edge_index = boost::num_edges(m_graph);\n        }\n\n        EnvireGraph& operator=(EnvireGraph const& g) {\n            if(&g != this) {\n                m_graph = g.m_graph;\n                m_num_vertices = g.m_num_vertices;\n                m_num_edges = g.m_num_edges;\n                m_max_vertex_index = g.m_max_vertex_index;\n                m_max_edge_index = g.m_max_edge_index;\n            }\n            return *this;\n        }\n\n        \/\/ The impl_() methods are not part of the public interface.\n        graph_type& impl()\n        { return m_graph; }\n\n        graph_type const& impl() const\n        { return m_graph; }\n\n        \/\/ The following methods are not part of the public interface\n        vertices_size_type num_vertices() const\n        { return m_num_vertices; }\n\n\n    private:\n        \/\/ This helper function manages the attribution of vertex indices.\n        vertex_descriptor make_index(vertex_descriptor v) {\n            boost::put(vertex_index, m_graph, v, m_max_vertex_index);\n            m_num_vertices++;\n            m_max_vertex_index++;\n            return v;\n        }\n    public:\n        vertex_descriptor add_vertex()\n        { return make_index(boost::add_vertex(m_graph)); }\n\n        vertex_descriptor add_vertex(vertex_property_type const& p)\n        { return make_index(boost::add_vertex(internal_vertex_property(0u, p), m_graph)); }\n\n        void clear_vertex(vertex_descriptor v)\n        {\n            m_num_edges -= boost::degree(v, m_graph);\n            boost::clear_vertex(v, m_graph);\n        }\n\n        void remove_vertex(vertex_descriptor v)\n        {\n            boost::remove_vertex(v, m_graph);\n            --m_num_vertices;\n        }\n\n        edges_size_type num_edges() const\n        { return m_num_edges; }\n\n    private:\n        \/\/ A helper fucntion for managing edge index attributes.\n        std::pair<edge_descriptor, bool> const&\n        make_index(std::pair<edge_descriptor, bool> const& x)\n        {\n            if(x.second) {\n                boost::put(edge_index, m_graph, x.first, m_max_edge_index);\n                ++m_num_edges;\n                ++m_max_edge_index;\n            }\n            return x;\n        }\n    public:\n        std::pair<edge_descriptor, bool>\n        add_edge(vertex_descriptor u, vertex_descriptor v)\n        { return make_index(boost::add_edge(u, v, m_graph)); }\n\n        std::pair<edge_descriptor, bool>\n        add_edge(vertex_descriptor u, vertex_descriptor v, edge_property_type const& p)\n        { return make_index(boost::add_edge(u, v, internal_edge_property(0u, p), m_graph)); }\n\n        void remove_edge(vertex_descriptor u, vertex_descriptor v)\n        {\n            \/\/ find all edges, (u, v)\n            std::vector<edge_descriptor> edges;\n            out_edge_iterator i, i_end;\n            for(boost::tie(i, i_end) = boost::out_edges(u, m_graph); i != i_end; ++i) {\n                if(boost::target(*i, m_graph) == v) {\n                    edges.push_back(*i);\n                }\n            }\n            \/\/ remove all edges, (u, v)\n            typename std::vector<edge_descriptor>::iterator\n            j = edges.begin(), j_end = edges.end();\n            for( ; j != j_end; ++j) {\n                remove_edge(*j);\n            }\n        }\n\n        void remove_edge(edge_iterator i)\n        {\n            remove_edge(*i);\n        }\n\n        void remove_edge(edge_descriptor e)\n        {\n            boost::remove_edge(e, m_graph);\n            --m_num_edges;\n        }\n\n        vertex_index_type max_vertex_index() const\n        { return m_max_vertex_index; }\n\n        void\n        renumber_vertex_indices()\n        {\n            vertex_iterator i, end;\n            boost::tie(i, end) = vertices(m_graph);\n            m_max_vertex_index = renumber_vertex_indices(i, end, 0);\n        }\n\n        void\n        remove_vertex_and_renumber_indices(vertex_iterator i)\n        {\n            vertex_iterator j = next(i), end = vertices(m_graph).second;\n            vertex_index_type n = get(vertex_index, m_graph, *i);\n\n            \/\/ remove the offending vertex and renumber everything after\n            remove_vertex(*i);\n            m_max_vertex_index = renumber_vertex_indices(j, end, n);\n        }\n\n        edge_index_type\n        max_edge_index() const\n        { return m_max_edge_index; }\n\n        void\n        renumber_edge_indices()\n        {\n            edge_iterator i, end;\n            boost::tie(i, end) = edges(m_graph);\n            m_max_edge_index = renumber_edge_indices(i, end, 0);\n        }\n\n        void\n        remove_edge_and_renumber_indices(edge_iterator i)\n        {\n            edge_iterator j = next(i), end = edges(m_graph).second;\n            edge_index_type n = get(edge_index, m_graph, *i);\n\n            \/\/ remove the offending edge and renumber everything after\n            remove_edge(*i);\n            m_max_edge_index = renumber_edge_indices(j, end, n);\n        }\n\n        void\n        renumber_indices()\n        {\n            renumber_vertex_indices();\n            renumber_edge_indices();\n        }\n\n        \/\/ bundled property support\n        #ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES\n        vertex_bundled& operator[](vertex_descriptor v)\n        { return m_graph[v]; }\n\n        vertex_bundled const& operator[](vertex_descriptor v) const\n        { return m_graph[v]; }\n\n        edge_bundled& operator[](edge_descriptor e)\n        { return m_graph[e]; }\n\n        edge_bundled const& operator[](edge_descriptor e) const\n        { return m_graph[e]; }\n\n        graph_bundled& operator[](graph_bundle_t)\n        { return get_property(*this); }\n\n        graph_bundled const& operator[](graph_bundle_t) const\n        { return get_property(*this); }\n        #endif\n\n        \/\/ Graph concepts\n        static vertex_descriptor null_vertex()\n        { return graph_type::null_vertex(); }\n\n        void clear()\n        {\n            m_graph.clear();\n            m_num_vertices = m_max_vertex_index = 0;\n            m_num_edges = m_max_edge_index = 0;\n        }\n\n        void swap(EnvireGraph& g)\n        {\n            m_graph.swap(g.m_graph);\n            std::swap(m_num_vertices, g.m_num_vertices);\n            std::swap(m_max_vertex_index, g.m_max_vertex_index);\n            std::swap(m_num_edges, g.m_num_edges);\n            std::swap(m_max_edge_index, g.m_max_edge_index);\n        }\n\n    private:\n        vertices_size_type\n        renumber_vertex_indices(vertex_iterator i,\n                                vertex_iterator end,\n                                vertices_size_type n)\n        {\n            typedef typename property_map<graph_type, vertex_index_t>::type IndexMap;\n            IndexMap indices = get(vertex_index, m_graph);\n            for( ; i != end; ++i) {\n                indices[*i] = n++;\n            }\n            return n;\n        }\n\n        vertices_size_type\n        renumber_edge_indices(edge_iterator i,\n                            edge_iterator end,\n                            vertices_size_type n)\n        {\n            typedef typename property_map<graph_type, edge_index_t>::type IndexMap;\n            IndexMap indices = get(edge_index, m_graph);\n            for( ; i != end; ++i) {\n                indices[*i] = n++;\n            }\n            return n;\n        }\n\n        graph_type m_graph;\n        vertices_size_type m_num_vertices;\n        edges_size_type m_num_edges;\n        vertex_index_type m_max_vertex_index;\n        edge_index_type m_max_edge_index;\n    };\n\n    #define ENVIRE_GRAPH_PARAMS typename VP, typename EP, typename GP\n    #define ENVIRE_GRAPH EnvireGraph<VP,EP,GP>\n\n    \/\/ IncidenceGraph concepts\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::vertex_descriptor\n    source(typename ENVIRE_GRAPH::edge_descriptor e, ENVIRE_GRAPH const& g)\n    { return source(e, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::vertex_descriptor\n    target(typename ENVIRE_GRAPH::edge_descriptor e, ENVIRE_GRAPH const& g)\n    { return target(e, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::degree_size_type\n    out_degree(typename ENVIRE_GRAPH::vertex_descriptor v, ENVIRE_GRAPH const& g)\n    { return out_degree(v, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline std::pair<\n        typename ENVIRE_GRAPH::out_edge_iterator,\n        typename ENVIRE_GRAPH::out_edge_iterator\n    >\n    out_edges(typename ENVIRE_GRAPH::vertex_descriptor v,\n            ENVIRE_GRAPH const& g)\n    { return out_edges(v, g.impl()); }\n\n    \/\/ BidirectionalGraph concepts\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::degree_size_type\n    in_degree(typename ENVIRE_GRAPH::vertex_descriptor v, ENVIRE_GRAPH const& g)\n    { return in_degree(v, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline std::pair<\n        typename ENVIRE_GRAPH::in_edge_iterator,\n        typename ENVIRE_GRAPH::in_edge_iterator\n    >\n    in_edges(typename ENVIRE_GRAPH::vertex_descriptor v,\n            ENVIRE_GRAPH const& g)\n    { return in_edges(v, g.impl()); }\n\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::degree_size_type\n    degree(typename ENVIRE_GRAPH::vertex_descriptor v, ENVIRE_GRAPH const& g)\n    { return degree(v, g.impl()); }\n\n    \/\/ AdjacencyGraph concepts\n    template <ENVIRE_GRAPH_PARAMS>\n    inline std::pair<\n        typename ENVIRE_GRAPH::adjacency_iterator,\n        typename ENVIRE_GRAPH::adjacency_iterator\n        >\n    adjacent_vertices(typename ENVIRE_GRAPH::vertex_descriptor v,\n                      ENVIRE_GRAPH const& g)\n    { return adjacent_vertices(v, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    typename ENVIRE_GRAPH::vertex_descriptor\n    vertex(typename ENVIRE_GRAPH::vertices_size_type n,\n           ENVIRE_GRAPH const& g)\n    { return vertex(n, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    std::pair<typename ENVIRE_GRAPH::edge_descriptor, bool>\n    edge(typename ENVIRE_GRAPH::vertex_descriptor u,\n         typename ENVIRE_GRAPH::vertex_descriptor v,\n         ENVIRE_GRAPH const& g)\n    { return edge(u, v, g.impl()); }\n\n    \/\/ VertexListGraph concepts\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::vertices_size_type\n    num_vertices(ENVIRE_GRAPH const& g)\n    { return g.num_vertices(); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline std::pair<\n        typename ENVIRE_GRAPH::vertex_iterator,\n        typename ENVIRE_GRAPH::vertex_iterator\n    >\n    vertices(ENVIRE_GRAPH const& g)\n    { return vertices(g.impl()); }\n\n    \/\/ EdgeListGraph concepts\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::edges_size_type\n    num_edges(ENVIRE_GRAPH const& g)\n    { return g.num_edges(); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline std::pair<\n        typename ENVIRE_GRAPH::edge_iterator,\n        typename ENVIRE_GRAPH::edge_iterator\n    >\n    edges(ENVIRE_GRAPH const& g)\n    { return edges(g.impl()); }\n\n    \/\/ MutableGraph concepts\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::vertex_descriptor\n    add_vertex(ENVIRE_GRAPH& g)\n    { return g.add_vertex(); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::vertex_descriptor\n    add_vertex(typename ENVIRE_GRAPH::vertex_property_type const& p,\n               ENVIRE_GRAPH& g)\n    { return g.add_vertex(p); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void\n    clear_vertex(typename ENVIRE_GRAPH::vertex_descriptor v,\n    ENVIRE_GRAPH& g)\n    { return g.clear_vertex(v); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void\n    remove_vertex(typename ENVIRE_GRAPH::vertex_descriptor v,\n                  ENVIRE_GRAPH& g)\n    { return g.remove_vertex(v); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline std::pair<typename ENVIRE_GRAPH::edge_descriptor, bool>\n    add_edge(typename ENVIRE_GRAPH::vertex_descriptor u,\n             typename ENVIRE_GRAPH::vertex_descriptor v,\n             ENVIRE_GRAPH& g)\n    { return g.add_edge(u, v); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline std::pair<typename ENVIRE_GRAPH::edge_descriptor, bool>\n    add_edge(typename ENVIRE_GRAPH::vertex_descriptor u,\n             typename ENVIRE_GRAPH::vertex_descriptor v,\n             typename ENVIRE_GRAPH::edge_property_type const& p,\n             ENVIRE_GRAPH& g)\n    { return g.add_edge(u, v, p); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void remove_edge(typename ENVIRE_GRAPH::vertex_descriptor u,\n                            typename ENVIRE_GRAPH::vertex_descriptor v,\n                            ENVIRE_GRAPH& g)\n    { return g.remove_edge(u, v); }\n\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void remove_edge(typename ENVIRE_GRAPH::edge_descriptor e, ENVIRE_GRAPH& g)\n    { return g.remove_edge(e); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void remove_edge(typename ENVIRE_GRAPH::edge_iterator i, ENVIRE_GRAPH& g)\n    { return g.remove_edge(i); }\n\n    template <ENVIRE_GRAPH_PARAMS, class Predicate>\n    inline void remove_edge_if(Predicate pred, ENVIRE_GRAPH& g)\n    { return remove_edge_if(pred, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS, class Predicate>\n    inline void\n    remove_out_edge_if(typename ENVIRE_GRAPH::vertex_descriptor v,\n                       Predicate pred,\n                       ENVIRE_GRAPH& g)\n    { return remove_out_edge_if(v, pred, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS, class Predicate>\n    inline void\n    remove_in_edge_if(typename ENVIRE_GRAPH::vertex_descriptor v,\n                    Predicate pred,\n                    ENVIRE_GRAPH& g)\n    { return remove_in_edge_if(v, pred, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS, typename Property>\n    struct property_map<ENVIRE_GRAPH, Property>: property_map<typename ENVIRE_GRAPH::graph_type, Property> {};\n\n    template <ENVIRE_GRAPH_PARAMS>\n    struct property_map<ENVIRE_GRAPH, vertex_all_t> {\n      typedef transform_value_property_map<\n                detail::remove_first_property,\n                typename property_map<typename ENVIRE_GRAPH::graph_type, vertex_all_t>::const_type>\n        const_type;\n      typedef transform_value_property_map<\n                detail::remove_first_property,\n                typename property_map<typename ENVIRE_GRAPH::graph_type, vertex_all_t>::type>\n        type;\n    };\n\n    template <ENVIRE_GRAPH_PARAMS>\n    struct property_map<ENVIRE_GRAPH, edge_all_t> {\n      typedef transform_value_property_map<\n                detail::remove_first_property,\n                typename property_map<typename ENVIRE_GRAPH::graph_type, edge_all_t>::const_type>\n        const_type;\n      typedef transform_value_property_map<\n                detail::remove_first_property,\n                typename property_map<typename ENVIRE_GRAPH::graph_type, edge_all_t>::type>\n        type;\n    };\n\n    \/\/ PropertyGraph concepts\n    template <ENVIRE_GRAPH_PARAMS, typename Property>\n    inline typename property_map<ENVIRE_GRAPH, Property>::type\n    get(Property p, ENVIRE_GRAPH& g)\n    { return get(p, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS, typename Property>\n    inline typename property_map<ENVIRE_GRAPH, Property>::const_type\n    get(Property p, ENVIRE_GRAPH const& g)\n    { return get(p, g.impl()); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename property_map<ENVIRE_GRAPH, vertex_all_t>::type\n    get(vertex_all_t, ENVIRE_GRAPH& g)\n    { return typename property_map<ENVIRE_GRAPH, vertex_all_t>::type(detail::remove_first_property(), get(vertex_all, g.impl())); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename property_map<ENVIRE_GRAPH, vertex_all_t>::const_type\n    get(vertex_all_t, ENVIRE_GRAPH const& g)\n    { return typename property_map<ENVIRE_GRAPH, vertex_all_t>::const_type(detail::remove_first_property(), get(vertex_all, g.impl())); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename property_map<ENVIRE_GRAPH, edge_all_t>::type\n    get(edge_all_t, ENVIRE_GRAPH& g)\n    { return typename property_map<ENVIRE_GRAPH, edge_all_t>::type(detail::remove_first_property(), get(edge_all, g.impl())); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename property_map<ENVIRE_GRAPH, edge_all_t>::const_type\n    get(edge_all_t, ENVIRE_GRAPH const& g)\n    { return typename property_map<ENVIRE_GRAPH, edge_all_t>::const_type(detail::remove_first_property(), get(edge_all, g.impl())); }\n\n    template <ENVIRE_GRAPH_PARAMS, typename Property, typename Key>\n    inline typename property_traits<\n        typename property_map<\n            typename ENVIRE_GRAPH::graph_type, Property\n        >::const_type\n    >::value_type\n    get(Property p, ENVIRE_GRAPH const& g, Key const& k)\n    { return get(p, g.impl(), k); }\n\n    template <ENVIRE_GRAPH_PARAMS, typename Key>\n    inline typename property_traits<\n        typename property_map<\n            typename ENVIRE_GRAPH::graph_type, vertex_all_t\n        >::const_type\n    >::value_type\n    get(vertex_all_t, ENVIRE_GRAPH const& g, Key const& k)\n    { return get(vertex_all, g.impl(), k).m_base; }\n\n    template <ENVIRE_GRAPH_PARAMS, typename Key>\n    inline typename property_traits<\n        typename property_map<\n            typename ENVIRE_GRAPH::graph_type, edge_all_t\n        >::const_type\n    >::value_type\n    get(edge_all_t, ENVIRE_GRAPH const& g, Key const& k)\n    { return get(edge_all, g.impl(), k).m_base; }\n\n    template <ENVIRE_GRAPH_PARAMS, typename Property, typename Key, typename Value>\n    inline void put(Property p, ENVIRE_GRAPH& g, Key const& k, Value const& v)\n    { put(p, g.impl(), k, v); }\n\n    template <ENVIRE_GRAPH_PARAMS, typename Key, typename Value>\n    inline void put(vertex_all_t, ENVIRE_GRAPH& g, Key const& k, Value const& v)\n    { put(vertex_all, g.impl(), k,\n          typename ENVIRE_GRAPH::internal_vertex_property(get(vertex_index, g.impl(), k), v));\n    }\n\n    template <ENVIRE_GRAPH_PARAMS, typename Key, typename Value>\n    inline void put(edge_all_t, ENVIRE_GRAPH& g, Key const& k, Value const& v)\n    { put(edge_all, g.impl(), k,\n          typename ENVIRE_GRAPH::internal_vertex_property(get(edge_index, g.impl(), k), v));\n    }\n\n    template <ENVIRE_GRAPH_PARAMS, class Property>\n    typename graph_property<ENVIRE_GRAPH, Property>::type&\n    get_property(ENVIRE_GRAPH& g, Property p)\n    { return get_property(g.impl(), p); }\n\n    template <ENVIRE_GRAPH_PARAMS, class Property>\n    typename graph_property<ENVIRE_GRAPH, Property>::type const&\n    get_property(ENVIRE_GRAPH const& g, Property p)\n    { return get_property(g.impl(), p); }\n\n    template <ENVIRE_GRAPH_PARAMS, class Property, class Value>\n    void\n    set_property(ENVIRE_GRAPH& g, Property p, Value v)\n    { return set_property(g.impl(), p, v); }\n\n    \/\/ Vertex index management\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::vertex_index_type\n    get_vertex_index(typename ENVIRE_GRAPH::vertex_descriptor v,\n                    ENVIRE_GRAPH const& g)\n    { return get(vertex_index, g, v); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    typename ENVIRE_GRAPH::vertex_index_type\n    max_vertex_index(ENVIRE_GRAPH const& g)\n    { return g.max_vertex_index(); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void\n    renumber_vertex_indices(ENVIRE_GRAPH& g)\n    { g.renumber_vertex_indices(); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void\n    remove_vertex_and_renumber_indices(typename ENVIRE_GRAPH::vertex_iterator i,\n                                    ENVIRE_GRAPH& g)\n    { g.remove_vertex_and_renumber_indices(i); }\n\n    \/\/ Edge index management\n    template <ENVIRE_GRAPH_PARAMS>\n    inline typename ENVIRE_GRAPH::edge_index_type\n    get_edge_index(typename ENVIRE_GRAPH::edge_descriptor v, ENVIRE_GRAPH const& g)\n    { return get(edge_index, g, v); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    typename ENVIRE_GRAPH::edge_index_type\n    max_edge_index(ENVIRE_GRAPH const& g)\n    { return g.max_edge_index(); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void renumber_edge_indices(ENVIRE_GRAPH& g)\n    { g.renumber_edge_indices(); }\n\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void\n    remove_edge_and_renumber_indices(typename ENVIRE_GRAPH::edge_iterator i,\n                                     ENVIRE_GRAPH& g)\n    { g.remove_edge_and_renumber_indices(i); }\n\n    \/\/ Index management\n    template <ENVIRE_GRAPH_PARAMS>\n    inline void\n    renumber_indices(ENVIRE_GRAPH& g)\n    { g.renumber_indices(); }\n\n    \/\/ Mutability Traits\n    template <ENVIRE_GRAPH_PARAMS>\n    struct graph_mutability_traits<ENVIRE_GRAPH> {\n        typedef mutable_property_graph_tag category;\n    };\n\n    #undef ENVIRE_GRAPH_PARAMS\n    #undef ENVIRE_GRAPH\n\n} \/* namespace envire *\/\n\n#endif\n\n<commit_msg>removed EnvireGraph.hpp. It was used for testing and is no longer needed<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of kdepim.\n\n    Copyright (c) 2004 Cornelius Schumacher <schumacher@kde.org>\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\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, 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 Street, Fifth Floor, Boston, MA  02110-1301  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 <interfaces\/bodypartformatter.h>\n#include <interfaces\/bodypart.h>\n#include <interfaces\/bodyparturlhandler.h>\n#include <khtmlparthtmlwriter.h>\n\n#include <kcal\/calendarlocal.h>\n#include <kcal\/icalformat.h>\n#include <kcal\/attendee.h>\n#include <kcal\/incidence.h>\n#include <kcal\/incidenceformatter.h>\n\n#include <kpimprefs.h> \/\/ for the timezone\n\n#include <kmail\/callback.h>\n#include <kmail\/kmmessage.h>\n#include <kmail\/kmcommands.h>\n\n#include <email.h>\n\n#include <kglobal.h>\n#include <klocale.h>\n#include <kstringhandler.h>\n#include <kglobalsettings.h>\n#include <kiconloader.h>\n#include <kdebug.h>\n#include <kdcopservicestarter.h>\n#include <kmessagebox.h>\n#include <kstandarddirs.h>\n#include <kapplication.h>\n#include <ktempfile.h>\n\n#include <QUrl>\n#include <QDir>\n#include <QTextStream>\n\n#include <kdepimmacros.h>\n\n#include <dcopclient.h>\n#include <dcopref.h>\n\nusing namespace KCal;\n\nnamespace {\n\nclass KMInvitationFormatterHelper : public KCal::InvitationFormatterHelper\n{\n  public:\n    KMInvitationFormatterHelper( KMail::Interface::BodyPart *bodyPart ) : mBodyPart( bodyPart ) {}\n    virtual QString generateLinkURL( const QString &id ) { return mBodyPart->makeLink( id ); }\n  private:\n    KMail::Interface::BodyPart *mBodyPart;\n};\n\nclass Formatter : public KMail::Interface::BodyPartFormatter\n{\n  public:\n    Result format( KMail::Interface::BodyPart *bodyPart,\n                   KMail::HtmlWriter *writer ) const\n    {\n      if ( !writer )\n        \/\/ Guard against crashes in createReply()\n        return Ok;\n      CalendarLocal cl( KPimPrefs::timezone() );\n      KMInvitationFormatterHelper helper( bodyPart );\n      QString source;\n      \/* If the bodypart does not have a charset specified, we need to fall\n         back to utf8, not the KMail fallback encoding, so get the contents\n         as binary and decode explicitly. *\/\n      if ( bodyPart->contentTypeParameter( \"charset\").isEmpty() ) {\n        const QByteArray &ba = bodyPart->asBinary();\n        source = QString::fromUtf8(ba);\n      } else {\n        source = bodyPart->asText();\n      }\n      QString html = IncidenceFormatter::formatICalInvitation( source, &cl, &helper );\n\n      if ( html.isEmpty() ) return AsIcon;\n      writer->queue( html );\n\n      return Ok;\n    }\n};\n\nclass UrlHandler : public KMail::Interface::BodyPartURLHandler\n{\n  public:\n    UrlHandler()\n    {\n      kDebug() << \"UrlHandler() (iCalendar)\" << endl;\n    }\n\n    Incidence* icalToString( const QString& iCal ) const\n    {\n      CalendarLocal calendar( KPimPrefs::timezone() ) ;\n      ICalFormat format;\n      ScheduleMessage *message =\n        format.parseScheduleMessage( &calendar, iCal );\n      if ( !message )\n        \/\/TODO: Error message?\n        return 0;\n      return dynamic_cast<Incidence*>( message->event() );\n    }\n\n\n    Attendee *findMyself( Incidence* incidence, const QString& receiver ) const\n    {\n      Attendee::List attendees = incidence->attendees();\n      Attendee::List::ConstIterator it;\n      Attendee* myself = 0;\n      \/\/ Find myself. There will always be all attendees listed, even if\n      \/\/ only I need to answer it.\n      if ( attendees.count() == 1 )\n        \/\/ Only one attendee, that must be me\n        myself = *attendees.begin();\n      else {\n        for ( it = attendees.begin(); it != attendees.end(); ++it ) {\n          \/\/ match only the email part, not the name\n          if( EmailAddressTools::compareEmail( (*it)->email(), receiver, false ) ) {\n            \/\/ We are the current one, and even the receiver, note\n            \/\/ this and quit searching.\n            myself = (*it);\n            break;\n          }\n        }\n      }\n      return myself;\n    }\n\n    static bool heuristicalRSVP( Incidence *incidence )\n    {\n      bool rsvp = true; \/\/ better send superfluously than not at all\n      Attendee::List attendees = incidence->attendees();\n      Attendee::List::ConstIterator it;\n      for ( it = attendees.begin(); it != attendees.end(); ++it ) {\n        if ( it == attendees.begin() ) {\n          rsvp = (*it)->RSVP(); \/\/ use what the first one has\n        } else {\n          if ( (*it)->RSVP() != rsvp ) {\n            rsvp = true; \/\/ they differ, default\n            break;\n          }\n        }\n      }\n      return rsvp;\n    }\n\n    static Attendee::Role heuristicalRole( Incidence *incidence )\n    {\n      Attendee::Role role = Attendee::OptParticipant;\n      Attendee::List attendees = incidence->attendees();\n      Attendee::List::ConstIterator it;\n      for ( it = attendees.begin(); it != attendees.end(); ++it ) {\n        if ( it == attendees.begin() ) {\n          role = (*it)->role(); \/\/ use what the first one has\n        } else {\n          if ( (*it)->role() != role ) {\n            role = Attendee::OptParticipant; \/\/ they differ, default\n            break;\n          }\n        }\n      }\n      return role;\n\n    }\n\n    void setStatusOnMyself( Incidence* incidence, Attendee* myself,\n                            Attendee::PartStat status, const QString &receiver ) const\n    {\n      Attendee* newMyself = 0;\n      QString name;\n      QString email;\n      EmailAddressTools::extractEmailAddressAndName( receiver, email, name );\n      if ( name.isEmpty() && myself ) name = myself->name();\n      if ( email.isEmpty()&& myself ) email = myself->email();\n      Q_ASSERT( !email.isEmpty() ); \/\/ delivery must be possible\n      newMyself = new Attendee( name,\n                                email,\n                                true, \/\/ RSVP, otherwise we would not be here\n                                status,\n                                myself ? myself->role() : heuristicalRole( incidence ),\n                                myself ? myself->uid() : QString::null );\n\n      \/\/ Make sure only ourselves is in the event\n      incidence->clearAttendees();\n      if( newMyself )\n        incidence->addAttendee( newMyself );\n    }\n\n    bool mail( Incidence* incidence, KMail::Callback& callback ) const\n    {\n      ICalFormat format;\n      format.setTimeZone( KPimPrefs::timezone(), false );\n      QString msg = format.createScheduleMessage( incidence,\n                                                  Scheduler::Reply );\n      QString subject;\n      if ( !incidence->summary().isEmpty() )\n        subject = i18n( \"Answer: %1\", incidence->summary() );\n      else\n        subject = i18n( \"Answer: Incidence with no summary\" );\n      return callback.mailICal( incidence->organizer().fullName(), msg, subject );\n    }\n\n    bool saveFile( const QString& receiver, const QString& iCal,\n                   const QString& type ) const\n    {\n      KTempFile file( KStandardDirs::locateLocal( \"data\", \"korganizer\/income.\" + type + '\/',\n                                   true ) );\n      QTextStream* ts = file.textStream();\n      if ( !ts ) {\n        KMessageBox::error( 0, i18n(\"Could not save file to KOrganizer\") );\n        return false;\n      }\n      ts->setCodec(\"UTF-8\");\n      (*ts) << receiver << '\\n' << iCal;\n      file.close();\n\n      \/\/ Now ensure that korganizer is running; otherwise start it, to prevent surprises\n      \/\/ (https:\/\/intevation.de\/roundup\/kolab\/issue758)\n      QString error;\n      DCOPCString dcopService;\n      int result = KDCOPServiceStarter::self()->findServiceFor( \"DCOP\/Organizer\", QString::null, &error, &dcopService );\n      if ( result == 0 ) {\n        \/\/ OK, so korganizer (or kontact) is running. Now ensure the object we want is available\n        \/\/ [that's not the case when kontact was already running, but korganizer not loaded into it...]\n        static const char* const dcopObjectId = \"KOrganizerIface\";\n        DCOPCString dummy;\n        if ( !kapp->dcopClient()->findObject( dcopService, dcopObjectId, \"\", QByteArray(), dummy, dummy ) ) {\n          DCOPRef ref( dcopService, dcopService ); \/\/ talk to the KUniqueApplication or its kontact wrapper\n          DCOPReply reply = ref.call( \"load()\" );\n          if ( reply.isValid() && (bool)reply ) {\n            kDebug() << \"Loaded \" << dcopService << \" successfully\" << endl;\n            Q_ASSERT( kapp->dcopClient()->findObject( dcopService, dcopObjectId, \"\", QByteArray(), dummy, dummy ) );\n          } else\n            kWarning() << \"Error loading \" << dcopService << endl;\n        }\n\n        \/\/ We don't do anything with it, we just need it to be running so that it handles\n        \/\/ the incoming directory.\n      }\n      else\n        kWarning() << \"Couldn't start DCOP\/Organizer: \" << dcopService << \" \" << error << endl;\n\n      return true;\n    }\n\n    bool handleInvitation( const QString& iCal, Attendee::PartStat status,\n                           KMail::Callback &callback ) const\n    {\n      bool ok = true;\n      const QString receiver = callback.receiver();\n      if ( receiver.isEmpty() )\n        \/\/ Must be some error. Still return true though, since we did handle it\n        return true;\n\n      \/\/ First, save it for KOrganizer to handle\n      QString dir;\n      if ( status == Attendee::Accepted ) dir = \"accepted\";\n      else if ( status == Attendee::Tentative  ) dir = \"tentative\";\n      else if ( status == Attendee::Declined ) dir = \"cancel\";\n      else return true; \/\/ unknown status\n\n      saveFile( receiver, iCal, dir );\n\n      \/\/ Now produce the return message\n      Incidence* incidence = icalToString( iCal );\n\n      if( !incidence ) return false;\n      Attendee *myself = findMyself( incidence, receiver );\n      if ( ( myself && myself->RSVP() ) || heuristicalRSVP( incidence ) ) {\n        setStatusOnMyself( incidence, myself, status, receiver );\n        ok =  mail( incidence, callback );\n      } else {\n        ( new KMDeleteMsgCommand( callback.getMsg()->getMsgSerNum() ) )->start();\n      }\n      delete incidence;\n      return ok;\n    }\n\n    bool handleIgnore( const QString&, KMail::Callback& c ) const\n    {\n      \/\/ simply move the message to trash\n      ( new KMDeleteMsgCommand( c.getMsg()->getMsgSerNum() ) )->start();\n      return true;\n    }\n\n    bool handleClick( KMail::Interface::BodyPart *part,\n                      const QString &path, KMail::Callback& c ) const\n    {\n      QString iCal = part->asText();\n      bool result = false;\n      if ( path == \"accept\" )\n        result = handleInvitation( iCal, Attendee::Accepted, c );\n      if ( path == \"accept_conditionally\" )\n        result = handleInvitation( iCal, Attendee::Tentative, c );\n      if ( path == \"ignore\" )\n        result = handleIgnore( iCal, c );\n      if ( path == \"decline\" )\n        result = handleInvitation( iCal, Attendee::Declined, c );\n      if ( path == \"reply\" || path == \"cancel\" ) {\n        \/\/ These should just be saved with their type as the dir\n        if ( saveFile( \"Receiver Not Searched\", iCal, path ) ) {\n          ( new KMDeleteMsgCommand( c.getMsg()->getMsgSerNum() ) )->start();\n          result = true;\n        }\n      }\n      if ( result )\n        c.closeIfSecondaryWindow();\n      return result;\n    }\n\n    bool handleContextMenuRequest( KMail::Interface::BodyPart *,\n                                   const QString &,\n                                   const QPoint & ) const\n    {\n      return false;\n    }\n\n    QString statusBarMessage( KMail::Interface::BodyPart *,\n                              const QString &path ) const\n    {\n      if ( !path.isEmpty() ) {\n        if ( path == \"accept\" )\n          return i18n(\"Accept incidence\");\n        if ( path == \"accept_conditionally\" )\n          return i18n( \"Accept incidence conditionally\" );\n        if ( path == \"ignore\" )\n          return i18n( \"Throw mail away\" );\n        if ( path == \"decline\" )\n          return i18n( \"Decline incidence\" );\n        if ( path == \"check_calendar\" )\n          return i18n(\"Check my calendar...\" );\n        if ( path == \"reply\" )\n          return i18n( \"Enter incidence into my calendar\" );\n        if ( path == \"cancel\" )\n          return i18n( \"Remove incidence from my calendar\" );\n      }\n\n      return QString::null;\n    }\n};\n\nclass Plugin : public KMail::Interface::BodyPartFormatterPlugin\n{\n  public:\n    const KMail::Interface::BodyPartFormatter *bodyPartFormatter( int idx ) const\n    {\n      if ( idx == 0 ) return new Formatter();\n      else return 0;\n    }\n\n    const char *type( int idx ) const\n    {\n      if ( idx == 0 ) return \"text\";\n      else return 0;\n    }\n\n    const char *subtype( int idx ) const\n    {\n      if ( idx == 0 ) return \"calendar\";\n      else return 0;\n    }\n\n    const KMail::Interface::BodyPartURLHandler * urlHandler( int idx ) const\n    {\n      if ( idx == 0 ) return new UrlHandler();\n      else return 0;\n    }\n};\n\n}\n\nextern \"C\"\nKDE_EXPORT KMail::Interface::BodyPartFormatterPlugin *\nlibkmail_bodypartformatter_text_calendar_create_bodypart_formatter_plugin()\n{\n  KGlobal::locale()->insertCatalog( \"kmail_text_calendar_plugin\" );\n  return new Plugin();\n}\n<commit_msg>compile<commit_after>\/*\n    This file is part of kdepim.\n\n    Copyright (c) 2004 Cornelius Schumacher <schumacher@kde.org>\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\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, 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 Street, Fifth Floor, Boston, MA  02110-1301  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 <interfaces\/bodypartformatter.h>\n#include <interfaces\/bodypart.h>\n#include <interfaces\/bodyparturlhandler.h>\n#include <khtmlparthtmlwriter.h>\n\n#include <kcal\/calendarlocal.h>\n#include <kcal\/icalformat.h>\n#include <kcal\/attendee.h>\n#include <kcal\/incidence.h>\n#include <kcal\/incidenceformatter.h>\n\n#include <kpimprefs.h> \/\/ for the timezone\n\n#include <kmail\/callback.h>\n#include <kmail\/kmmessage.h>\n#include <kmail\/kmcommands.h>\n\n#include <emailfunctions\/email.h>\n\n#include <kglobal.h>\n#include <klocale.h>\n#include <kstringhandler.h>\n#include <kglobalsettings.h>\n#include <kiconloader.h>\n#include <kdebug.h>\n#include <kdbusservicestarter.h>\n#include <kmessagebox.h>\n#include <kstandarddirs.h>\n#include <kapplication.h>\n#include <ktempfile.h>\n\n#include <QUrl>\n#include <QDir>\n#include <QTextStream>\n\n#include <kdepimmacros.h>\n\nusing namespace KCal;\n\nnamespace {\n\nclass KMInvitationFormatterHelper : public KCal::InvitationFormatterHelper\n{\n  public:\n    KMInvitationFormatterHelper( KMail::Interface::BodyPart *bodyPart ) : mBodyPart( bodyPart ) {}\n    virtual QString generateLinkURL( const QString &id ) { return mBodyPart->makeLink( id ); }\n  private:\n    KMail::Interface::BodyPart *mBodyPart;\n};\n\nclass Formatter : public KMail::Interface::BodyPartFormatter\n{\n  public:\n    Result format( KMail::Interface::BodyPart *bodyPart,\n                   KMail::HtmlWriter *writer ) const\n    {\n      if ( !writer )\n        \/\/ Guard against crashes in createReply()\n        return Ok;\n      CalendarLocal cl( KPimPrefs::timezone() );\n      KMInvitationFormatterHelper helper( bodyPart );\n      QString source;\n      \/* If the bodypart does not have a charset specified, we need to fall\n         back to utf8, not the KMail fallback encoding, so get the contents\n         as binary and decode explicitly. *\/\n      if ( bodyPart->contentTypeParameter( \"charset\").isEmpty() ) {\n        const QByteArray &ba = bodyPart->asBinary();\n        source = QString::fromUtf8(ba);\n      } else {\n        source = bodyPart->asText();\n      }\n      QString html = IncidenceFormatter::formatICalInvitation( source, &cl, &helper );\n\n      if ( html.isEmpty() ) return AsIcon;\n      writer->queue( html );\n\n      return Ok;\n    }\n};\n\nclass UrlHandler : public KMail::Interface::BodyPartURLHandler\n{\n  public:\n    UrlHandler()\n    {\n      kDebug() << \"UrlHandler() (iCalendar)\" << endl;\n    }\n\n    Incidence* icalToString( const QString& iCal ) const\n    {\n      CalendarLocal calendar( KPimPrefs::timezone() ) ;\n      ICalFormat format;\n      ScheduleMessage *message =\n        format.parseScheduleMessage( &calendar, iCal );\n      if ( !message )\n        \/\/TODO: Error message?\n        return 0;\n      return dynamic_cast<Incidence*>( message->event() );\n    }\n\n\n    Attendee *findMyself( Incidence* incidence, const QString& receiver ) const\n    {\n      Attendee::List attendees = incidence->attendees();\n      Attendee::List::ConstIterator it;\n      Attendee* myself = 0;\n      \/\/ Find myself. There will always be all attendees listed, even if\n      \/\/ only I need to answer it.\n      if ( attendees.count() == 1 )\n        \/\/ Only one attendee, that must be me\n        myself = *attendees.begin();\n      else {\n        for ( it = attendees.begin(); it != attendees.end(); ++it ) {\n          \/\/ match only the email part, not the name\n          if( EmailAddressTools::compareEmail( (*it)->email(), receiver, false ) ) {\n            \/\/ We are the current one, and even the receiver, note\n            \/\/ this and quit searching.\n            myself = (*it);\n            break;\n          }\n        }\n      }\n      return myself;\n    }\n\n    static bool heuristicalRSVP( Incidence *incidence )\n    {\n      bool rsvp = true; \/\/ better send superfluously than not at all\n      Attendee::List attendees = incidence->attendees();\n      Attendee::List::ConstIterator it;\n      for ( it = attendees.begin(); it != attendees.end(); ++it ) {\n        if ( it == attendees.begin() ) {\n          rsvp = (*it)->RSVP(); \/\/ use what the first one has\n        } else {\n          if ( (*it)->RSVP() != rsvp ) {\n            rsvp = true; \/\/ they differ, default\n            break;\n          }\n        }\n      }\n      return rsvp;\n    }\n\n    static Attendee::Role heuristicalRole( Incidence *incidence )\n    {\n      Attendee::Role role = Attendee::OptParticipant;\n      Attendee::List attendees = incidence->attendees();\n      Attendee::List::ConstIterator it;\n      for ( it = attendees.begin(); it != attendees.end(); ++it ) {\n        if ( it == attendees.begin() ) {\n          role = (*it)->role(); \/\/ use what the first one has\n        } else {\n          if ( (*it)->role() != role ) {\n            role = Attendee::OptParticipant; \/\/ they differ, default\n            break;\n          }\n        }\n      }\n      return role;\n\n    }\n\n    void setStatusOnMyself( Incidence* incidence, Attendee* myself,\n                            Attendee::PartStat status, const QString &receiver ) const\n    {\n      Attendee* newMyself = 0;\n      QString name;\n      QString email;\n      EmailAddressTools::extractEmailAddressAndName( receiver, email, name );\n      if ( name.isEmpty() && myself ) name = myself->name();\n      if ( email.isEmpty()&& myself ) email = myself->email();\n      Q_ASSERT( !email.isEmpty() ); \/\/ delivery must be possible\n      newMyself = new Attendee( name,\n                                email,\n                                true, \/\/ RSVP, otherwise we would not be here\n                                status,\n                                myself ? myself->role() : heuristicalRole( incidence ),\n                                myself ? myself->uid() : QString::null );\n\n      \/\/ Make sure only ourselves is in the event\n      incidence->clearAttendees();\n      if( newMyself )\n        incidence->addAttendee( newMyself );\n    }\n\n    bool mail( Incidence* incidence, KMail::Callback& callback ) const\n    {\n      ICalFormat format;\n      format.setTimeZone( KPimPrefs::timezone(), false );\n      QString msg = format.createScheduleMessage( incidence,\n                                                  Scheduler::Reply );\n      QString subject;\n      if ( !incidence->summary().isEmpty() )\n        subject = i18n( \"Answer: %1\", incidence->summary() );\n      else\n        subject = i18n( \"Answer: Incidence with no summary\" );\n      return callback.mailICal( incidence->organizer().fullName(), msg, subject );\n    }\n\n    bool saveFile( const QString& receiver, const QString& iCal,\n                   const QString& type ) const\n    {\n      KTempFile file( KStandardDirs::locateLocal( \"data\", \"korganizer\/income.\" + type + '\/',\n                                   true ) );\n      QTextStream* ts = file.textStream();\n      if ( !ts ) {\n        KMessageBox::error( 0, i18n(\"Could not save file to KOrganizer\") );\n        return false;\n      }\n      ts->setCodec(\"UTF-8\");\n      (*ts) << receiver << '\\n' << iCal;\n      file.close();\n\n      \/\/ Now ensure that korganizer is running; otherwise start it, to prevent surprises\n      \/\/ (https:\/\/intevation.de\/roundup\/kolab\/issue758)\n      QString error;\n      QString dcopService;\n      int result = KDBusServiceStarter::self()->findServiceFor( \"DCOP\/Organizer\", QString::null, &error, &dcopService );\n      if ( result == 0 ) {\n        \/\/ OK, so korganizer (or kontact) is running. Now ensure the object we want is available\n        \/\/ [that's not the case when kontact was already running, but korganizer not loaded into it...]\n#warning Port me to DBus!\n\/*        static const char* const dcopObjectId = \"KOrganizerIface\";\n        DCOPCString dummy;\n        if ( !kapp->dcopClient()->findObject( dcopService, dcopObjectId, \"\", QByteArray(), dummy, dummy ) ) {\n          DCOPRef ref( dcopService, dcopService ); \/\/ talk to the KUniqueApplication or its kontact wrapper\n          DCOPReply reply = ref.call( \"load()\" );\n          if ( reply.isValid() && (bool)reply ) {\n            kDebug() << \"Loaded \" << dcopService << \" successfully\" << endl;\n            Q_ASSERT( kapp->dcopClient()->findObject( dcopService, dcopObjectId, \"\", QByteArray(), dummy, dummy ) );\n          } else\n            kWarning() << \"Error loading \" << dcopService << endl;\n        }*\/\n\n        \/\/ We don't do anything with it, we just need it to be running so that it handles\n        \/\/ the incoming directory.\n      }\n      else\n        kWarning() << \"Couldn't start DCOP\/Organizer: \" << dcopService << \" \" << error << endl;\n\n      return true;\n    }\n\n    bool handleInvitation( const QString& iCal, Attendee::PartStat status,\n                           KMail::Callback &callback ) const\n    {\n      bool ok = true;\n      const QString receiver = callback.receiver();\n      if ( receiver.isEmpty() )\n        \/\/ Must be some error. Still return true though, since we did handle it\n        return true;\n\n      \/\/ First, save it for KOrganizer to handle\n      QString dir;\n      if ( status == Attendee::Accepted ) dir = \"accepted\";\n      else if ( status == Attendee::Tentative  ) dir = \"tentative\";\n      else if ( status == Attendee::Declined ) dir = \"cancel\";\n      else return true; \/\/ unknown status\n\n      saveFile( receiver, iCal, dir );\n\n      \/\/ Now produce the return message\n      Incidence* incidence = icalToString( iCal );\n\n      if( !incidence ) return false;\n      Attendee *myself = findMyself( incidence, receiver );\n      if ( ( myself && myself->RSVP() ) || heuristicalRSVP( incidence ) ) {\n        setStatusOnMyself( incidence, myself, status, receiver );\n        ok =  mail( incidence, callback );\n      } else {\n        ( new KMDeleteMsgCommand( callback.getMsg()->getMsgSerNum() ) )->start();\n      }\n      delete incidence;\n      return ok;\n    }\n\n    bool handleIgnore( const QString&, KMail::Callback& c ) const\n    {\n      \/\/ simply move the message to trash\n      ( new KMDeleteMsgCommand( c.getMsg()->getMsgSerNum() ) )->start();\n      return true;\n    }\n\n    bool handleClick( KMail::Interface::BodyPart *part,\n                      const QString &path, KMail::Callback& c ) const\n    {\n      QString iCal = part->asText();\n      bool result = false;\n      if ( path == \"accept\" )\n        result = handleInvitation( iCal, Attendee::Accepted, c );\n      if ( path == \"accept_conditionally\" )\n        result = handleInvitation( iCal, Attendee::Tentative, c );\n      if ( path == \"ignore\" )\n        result = handleIgnore( iCal, c );\n      if ( path == \"decline\" )\n        result = handleInvitation( iCal, Attendee::Declined, c );\n      if ( path == \"reply\" || path == \"cancel\" ) {\n        \/\/ These should just be saved with their type as the dir\n        if ( saveFile( \"Receiver Not Searched\", iCal, path ) ) {\n          ( new KMDeleteMsgCommand( c.getMsg()->getMsgSerNum() ) )->start();\n          result = true;\n        }\n      }\n      if ( result )\n        c.closeIfSecondaryWindow();\n      return result;\n    }\n\n    bool handleContextMenuRequest( KMail::Interface::BodyPart *,\n                                   const QString &,\n                                   const QPoint & ) const\n    {\n      return false;\n    }\n\n    QString statusBarMessage( KMail::Interface::BodyPart *,\n                              const QString &path ) const\n    {\n      if ( !path.isEmpty() ) {\n        if ( path == \"accept\" )\n          return i18n(\"Accept incidence\");\n        if ( path == \"accept_conditionally\" )\n          return i18n( \"Accept incidence conditionally\" );\n        if ( path == \"ignore\" )\n          return i18n( \"Throw mail away\" );\n        if ( path == \"decline\" )\n          return i18n( \"Decline incidence\" );\n        if ( path == \"check_calendar\" )\n          return i18n(\"Check my calendar...\" );\n        if ( path == \"reply\" )\n          return i18n( \"Enter incidence into my calendar\" );\n        if ( path == \"cancel\" )\n          return i18n( \"Remove incidence from my calendar\" );\n      }\n\n      return QString::null;\n    }\n};\n\nclass Plugin : public KMail::Interface::BodyPartFormatterPlugin\n{\n  public:\n    const KMail::Interface::BodyPartFormatter *bodyPartFormatter( int idx ) const\n    {\n      if ( idx == 0 ) return new Formatter();\n      else return 0;\n    }\n\n    const char *type( int idx ) const\n    {\n      if ( idx == 0 ) return \"text\";\n      else return 0;\n    }\n\n    const char *subtype( int idx ) const\n    {\n      if ( idx == 0 ) return \"calendar\";\n      else return 0;\n    }\n\n    const KMail::Interface::BodyPartURLHandler * urlHandler( int idx ) const\n    {\n      if ( idx == 0 ) return new UrlHandler();\n      else return 0;\n    }\n};\n\n}\n\nextern \"C\"\nKDE_EXPORT KMail::Interface::BodyPartFormatterPlugin *\nlibkmail_bodypartformatter_text_calendar_create_bodypart_formatter_plugin()\n{\n  KGlobal::locale()->insertCatalog( \"kmail_text_calendar_plugin\" );\n  return new Plugin();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ playHistoryTracker.cpp : Defines the entry point for the DLL application.\n\/\/\n\n\n#include \"bzfsAPI.h\"\n#include <string>\n#include <map>\n\nBZ_GET_PLUGIN_VERSION\n\n\/\/ event handler callback\n\nclass PlayHistoryTracker : public bz_EventHandler\n{\npublic:\n\tPlayHistoryTracker();\n\tvirtual ~PlayHistoryTracker();\n\n\tvirtual void process ( bz_EventData *eventData );\n\n\tvirtual bool autoDelete ( void ) { return false;} \/\/ this will be used for more then one event\nprotected:\n\n\ttypedef struct \n\t{\n\t\tint playerID;\n\t\tstd::string callsign;\n\t\tdouble\t\tstartTime;\n\t\tdouble\t\tlastUpdateTime;\n\t\tint\t\t\tspreeTotal;\n\t}trPlayerHistoryRecord;\n\n\tstd::map<int, trPlayerHistoryRecord > playerList;\n};\n\nPlayHistoryTracker\thistoryTracker;\n\nBZF_PLUGIN_CALL int bz_Load ( const char* commandLine )\n{\n\tbz_debugMessage(4,\"PlayHistoryTracker plugin loaded\");\n\n\tbz_registerEvent(bz_ePlayerDieEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_registerEvent(bz_ePlayerPartEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_registerEvent(bz_ePlayerSpawnEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_registerEvent(bz_ePlayerDieEvent,BZ_ALL_USERS,&historyTracker);\n\n\treturn 0;\n}\n\nBZF_PLUGIN_CALL int bz_Unload ( void )\n{\n\tbz_removeEvent(bz_ePlayerDieEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_removeEvent(bz_ePlayerPartEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_removeEvent(bz_ePlayerSpawnEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_removeEvent(bz_ePlayerDieEvent,BZ_ALL_USERS,&historyTracker);\n\n\tbz_debugMessage(4,\"PlayHistoryTracker plugin unloaded\");\n\treturn 0;\n}\n\n\/\/ ----------------- SpreeTracker-----------------\n\n\/*typedef struct \n{\nint playerID;\nstd::string callsign;\ndouble\t\tstartTime;\ndouble\t\tlastUpdateTime;\nint\t\t\tspreeTotal;\n}trPlayerHistoryRecord;\n\nstd::map<int, trPlayerHistoryRecord > playerList; *\/\n\nPlayHistoryTracker::PlayHistoryTracker()\n{\n}\n\nPlayHistoryTracker::~PlayHistoryTracker()\n{\n}\n\nvoid PlayHistoryTracker::process ( bz_EventData *eventData )\n{\n\tswitch (eventData->eventType)\n\t{\n\tdefault:\n\t\t\/\/ really WTF!!!!\n\t\tbreak;\n\n\tcase bz_ePlayerDieEvent:\n\t\t{\n\t\t\t bz_PlayerDieEventData\t*deathRecord = ( bz_PlayerDieEventData*)eventData;\n\n\t\t\t bz_PlayerRecord\tkillerData;\n\n\t\t\t bz_getPlayerByIndex(deathRecord->killerID,&killerData);\n\n\t\t\/\/\tGameKeeper::Player *killerData = GameKeeper::Player::getPlayerByIndex(deathRecord->killerID);\n\t\t\t\/\/GameKeeper::Player *victimData = GameKeeper::Player::getPlayerByIndex(deathRecord->playerID);\n\n\t\t\t std::string soundToPlay;\n\n\t\t\t\/\/ clear out the dude who got shot, since he won't be having any SPREEs\n\t\t\tif (playerList.find(deathRecord->playerID) != playerList.end())\n\t\t\t{\n\t\t\t\ttrPlayerHistoryRecord\t&record = playerList.find(deathRecord->playerID)->second;\n\t\t\t\tstd::string message;\n\t\t\t\tif ( record.spreeTotal >= 5 && record.spreeTotal < 10 )\n\t\t\t\t\tmessage = record.callsign + std::string(\"'s rampage was stoped by \") + killerData.callsign;\n\t\t\t\tif ( record.spreeTotal >= 10 && record.spreeTotal < 20 )\n\t\t\t\t\tmessage = record.callsign + std::string(\"'s killing spree was halted by \") + killerData.callsign;\n\t\t\t\tif ( record.spreeTotal >= 20 )\n\t\t\t\t\tmessage = std::string(\"The unstopable reign of \") + record.callsign + std::string(\" was ended by \") + killerData.callsign;\n\n\t\t\t\tif (message.size())\n\t\t\t\t{\n\t\t\t\t\t bz_sendTextMessage(BZ_SERVER, BZ_ALL_USERS, message.c_str());\n\t\t\t\t\t soundToPlay = \"spree4\";\n\t\t\t\t}\n\n\t\t\t\trecord.spreeTotal = 0;\n\t\t\t\trecord.startTime = deathRecord->time;\n\t\t\t\trecord.lastUpdateTime = deathRecord->time;\n\n\t\t\t}\n\n\t\t\t\/\/ chock up another win for our killer\n\t\t\t\/\/ if they weren't the same as the killer ( suicide ).\n\t\t\tif ( (deathRecord->playerID != deathRecord->killerID) && playerList.find(deathRecord->killerID) != playerList.end())\n\t\t\t{\n\t\t\t\ttrPlayerHistoryRecord\t&record = playerList.find(deathRecord->killerID)->second;\n\t\t\t\trecord.spreeTotal++;\n\t\t\t\trecord.lastUpdateTime = deathRecord->time;\n\n\t\t\t\tstd::string message;\n\n\t\t\t\tif ( record.spreeTotal == 5 )\n\t\t\t\t{\n\t\t\t\t\tmessage = record.callsign + std::string(\" is on a Rampage!\");\n\t\t\t\t\tif (!soundToPlay.size())\n\t\t\t\t\t\tsoundToPlay = \"spree1\";\n\t\t\t\t}\n\t\t\t\tif ( record.spreeTotal == 10 )\n\t\t\t\t{\n\t\t\t\t\tmessage = record.callsign + std::string(\" is on a Killing Spree!\");\n\t\t\t\t\tif (!soundToPlay.size())\n\t\t\t\t\t\tsoundToPlay = \"spree2\";\n\t\t\t\t}\n\t\t\t\tif ( record.spreeTotal == 20 )\n\t\t\t\t{\n\t\t\t\t\tmessage = record.callsign + std::string(\" is Unstoppable!!\");\n\t\t\t\t\tif (!soundToPlay.size())\n\t\t\t\t\t\tsoundToPlay = \"spree3\";\n\t\t\t\t}\n\t\t\t\tif ( record.spreeTotal > 20 && record.spreeTotal%5 == 0 )\n\t\t\t\t{\n\t\t\t\t\tmessage = record.callsign + std::string(\"'s continues to rage on\");\n\t\t\t\t\tif (!soundToPlay.size())\n\t\t\t\t\t\tsoundToPlay = \"spree4\";\n\t\t\t\t}\n\n\t\t\t\tif (message.size())\n\t\t\t\t{\n\t\t\t\t\tbz_sendTextMessage(BZ_SERVER, BZ_ALL_USERS, message.c_str());\n\t\t\t\t}\t\n\n\t\t\t}\t\n\n\t\t\/\/\tif (soundToPlay.size())\n\t\t\/\/\tbz_sendPlayCustomLocalSound(BZ_ALL_USERS,soundToPlay.c_str());\n\n\t\t}\n\t\tbreak;\n\n\tcase  bz_ePlayerSpawnEvent:\n\t\t\/\/ really WTF!!!!\n\t\tbreak;\n\n\tcase  bz_ePlayerJoinEvent:\n\t\t{\n\t\t\ttrPlayerHistoryRecord\tplayerRecord;\n\n\t\t\tplayerRecord.playerID = (( bz_PlayerJoinPartEventData*)eventData)->playerID;\n\t\t\tplayerRecord.callsign = (( bz_PlayerJoinPartEventData*)eventData)->callsign;\n\t\t\tplayerRecord.spreeTotal = 0;\n\t\t\tplayerRecord.lastUpdateTime = (( bz_PlayerJoinPartEventData*)eventData)->time;\n\t\t\tplayerRecord.startTime = playerRecord.lastUpdateTime;\n\n\t\t\tplayerList[(( bz_PlayerJoinPartEventData*)eventData)->playerID] = playerRecord;\n\t\t}\n\t\tbreak;\n\tcase  bz_ePlayerPartEvent:\n\t\t{\n\t\t\tstd::map<int, trPlayerHistoryRecord >::iterator\titr = playerList.find( (( bz_PlayerJoinPartEventData*)eventData)->playerID );\n\t\t\tif (itr != playerList.end())\n\t\t\t\tplayerList.erase(itr);\n\t\t}\n\t\tbreak;\n\t}\n}\n\n<commit_msg>make compatable with new API version<commit_after>\/\/ playHistoryTracker.cpp : Defines the entry point for the DLL application.\n\/\/\n\n\n#include \"bzfsAPI.h\"\n#include <string>\n#include <map>\n\nBZ_GET_PLUGIN_VERSION\n\n\/\/ event handler callback\n\nclass PlayHistoryTracker : public bz_EventHandler\n{\npublic:\n\tPlayHistoryTracker();\n\tvirtual ~PlayHistoryTracker();\n\n\tvirtual void process ( bz_EventData *eventData );\n\n\tvirtual bool autoDelete ( void ) { return false;} \/\/ this will be used for more then one event\nprotected:\n\n\ttypedef struct \n\t{\n\t\tint playerID;\n\t\tstd::string callsign;\n\t\tdouble\t\tstartTime;\n\t\tdouble\t\tlastUpdateTime;\n\t\tint\t\t\tspreeTotal;\n\t}trPlayerHistoryRecord;\n\n\tstd::map<int, trPlayerHistoryRecord > playerList;\n};\n\nPlayHistoryTracker\thistoryTracker;\n\nBZF_PLUGIN_CALL int bz_Load ( const char* commandLine )\n{\n\tbz_debugMessage(4,\"PlayHistoryTracker plugin loaded\");\n\n\tbz_registerEvent(bz_ePlayerDieEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_registerEvent(bz_ePlayerPartEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_registerEvent(bz_ePlayerSpawnEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_registerEvent(bz_ePlayerDieEvent,BZ_ALL_USERS,&historyTracker);\n\n\treturn 0;\n}\n\nBZF_PLUGIN_CALL int bz_Unload ( void )\n{\n\tbz_removeEvent(bz_ePlayerDieEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_removeEvent(bz_ePlayerPartEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_removeEvent(bz_ePlayerSpawnEvent,BZ_ALL_USERS,&historyTracker);\n\tbz_removeEvent(bz_ePlayerDieEvent,BZ_ALL_USERS,&historyTracker);\n\n\tbz_debugMessage(4,\"PlayHistoryTracker plugin unloaded\");\n\treturn 0;\n}\n\n\/\/ ----------------- SpreeTracker-----------------\n\n\/*typedef struct \n{\nint playerID;\nstd::string callsign;\ndouble\t\tstartTime;\ndouble\t\tlastUpdateTime;\nint\t\t\tspreeTotal;\n}trPlayerHistoryRecord;\n\nstd::map<int, trPlayerHistoryRecord > playerList; *\/\n\nPlayHistoryTracker::PlayHistoryTracker()\n{\n}\n\nPlayHistoryTracker::~PlayHistoryTracker()\n{\n}\n\nvoid PlayHistoryTracker::process ( bz_EventData *eventData )\n{\n\tswitch (eventData->eventType)\n\t{\n\tdefault:\n\t\t\/\/ really WTF!!!!\n\t\tbreak;\n\n\tcase bz_ePlayerDieEvent:\n\t\t{\n\t\t\t bz_PlayerDieEventData\t*deathRecord = ( bz_PlayerDieEventData*)eventData;\n\n\t\t\t bz_PlayerRecord\tkillerData;\n\n\t\t\t bz_getPlayerByIndex(deathRecord->killerID,&killerData);\n\n\t\t\/\/\tGameKeeper::Player *killerData = GameKeeper::Player::getPlayerByIndex(deathRecord->killerID);\n\t\t\t\/\/GameKeeper::Player *victimData = GameKeeper::Player::getPlayerByIndex(deathRecord->playerID);\n\n\t\t\t std::string soundToPlay;\n\n\t\t\t\/\/ clear out the dude who got shot, since he won't be having any SPREEs\n\t\t\tif (playerList.find(deathRecord->playerID) != playerList.end())\n\t\t\t{\n\t\t\t\ttrPlayerHistoryRecord\t&record = playerList.find(deathRecord->playerID)->second;\n\t\t\t\tstd::string message;\n\t\t\t\tif ( record.spreeTotal >= 5 && record.spreeTotal < 10 )\n\t\t\t\t\tmessage = record.callsign + std::string(\"'s rampage was stoped by \") + killerData.callsign.c_str();\n\t\t\t\tif ( record.spreeTotal >= 10 && record.spreeTotal < 20 )\n\t\t\t\t\tmessage = record.callsign + std::string(\"'s killing spree was halted by \") + killerData.callsign.c_str();\n\t\t\t\tif ( record.spreeTotal >= 20 )\n\t\t\t\t\tmessage = std::string(\"The unstopable reign of \") + record.callsign + std::string(\" was ended by \") + killerData.callsign.c_str();\n\n\t\t\t\tif (message.size())\n\t\t\t\t{\n\t\t\t\t\t bz_sendTextMessage(BZ_SERVER, BZ_ALL_USERS, message.c_str());\n\t\t\t\t\t soundToPlay = \"spree4\";\n\t\t\t\t}\n\n\t\t\t\trecord.spreeTotal = 0;\n\t\t\t\trecord.startTime = deathRecord->time;\n\t\t\t\trecord.lastUpdateTime = deathRecord->time;\n\n\t\t\t}\n\n\t\t\t\/\/ chock up another win for our killer\n\t\t\t\/\/ if they weren't the same as the killer ( suicide ).\n\t\t\tif ( (deathRecord->playerID != deathRecord->killerID) && playerList.find(deathRecord->killerID) != playerList.end())\n\t\t\t{\n\t\t\t\ttrPlayerHistoryRecord\t&record = playerList.find(deathRecord->killerID)->second;\n\t\t\t\trecord.spreeTotal++;\n\t\t\t\trecord.lastUpdateTime = deathRecord->time;\n\n\t\t\t\tstd::string message;\n\n\t\t\t\tif ( record.spreeTotal == 5 )\n\t\t\t\t{\n\t\t\t\t\tmessage = record.callsign + std::string(\" is on a Rampage!\");\n\t\t\t\t\tif (!soundToPlay.size())\n\t\t\t\t\t\tsoundToPlay = \"spree1\";\n\t\t\t\t}\n\t\t\t\tif ( record.spreeTotal == 10 )\n\t\t\t\t{\n\t\t\t\t\tmessage = record.callsign + std::string(\" is on a Killing Spree!\");\n\t\t\t\t\tif (!soundToPlay.size())\n\t\t\t\t\t\tsoundToPlay = \"spree2\";\n\t\t\t\t}\n\t\t\t\tif ( record.spreeTotal == 20 )\n\t\t\t\t{\n\t\t\t\t\tmessage = record.callsign + std::string(\" is Unstoppable!!\");\n\t\t\t\t\tif (!soundToPlay.size())\n\t\t\t\t\t\tsoundToPlay = \"spree3\";\n\t\t\t\t}\n\t\t\t\tif ( record.spreeTotal > 20 && record.spreeTotal%5 == 0 )\n\t\t\t\t{\n\t\t\t\t\tmessage = record.callsign + std::string(\"'s continues to rage on\");\n\t\t\t\t\tif (!soundToPlay.size())\n\t\t\t\t\t\tsoundToPlay = \"spree4\";\n\t\t\t\t}\n\n\t\t\t\tif (message.size())\n\t\t\t\t{\n\t\t\t\t\tbz_sendTextMessage(BZ_SERVER, BZ_ALL_USERS, message.c_str());\n\t\t\t\t}\t\n\n\t\t\t}\t\n\n\t\t\/\/\tif (soundToPlay.size())\n\t\t\/\/\tbz_sendPlayCustomLocalSound(BZ_ALL_USERS,soundToPlay.c_str());\n\n\t\t}\n\t\tbreak;\n\n\tcase  bz_ePlayerSpawnEvent:\n\t\t\/\/ really WTF!!!!\n\t\tbreak;\n\n\tcase  bz_ePlayerJoinEvent:\n\t\t{\n\t\t\ttrPlayerHistoryRecord\tplayerRecord;\n\n\t\t\tplayerRecord.playerID = (( bz_PlayerJoinPartEventData*)eventData)->playerID;\n\t\t\tplayerRecord.callsign = (( bz_PlayerJoinPartEventData*)eventData)->callsign.c_str();\n\t\t\tplayerRecord.spreeTotal = 0;\n\t\t\tplayerRecord.lastUpdateTime = (( bz_PlayerJoinPartEventData*)eventData)->time;\n\t\t\tplayerRecord.startTime = playerRecord.lastUpdateTime;\n\n\t\t\tplayerList[(( bz_PlayerJoinPartEventData*)eventData)->playerID] = playerRecord;\n\t\t}\n\t\tbreak;\n\tcase  bz_ePlayerPartEvent:\n\t\t{\n\t\t\tstd::map<int, trPlayerHistoryRecord >::iterator\titr = playerList.find( (( bz_PlayerJoinPartEventData*)eventData)->playerID );\n\t\t\tif (itr != playerList.end())\n\t\t\t\tplayerList.erase(itr);\n\t\t}\n\t\tbreak;\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2016-2018 Baldur Karlsson\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 <QApplication>\n#include <QCommandLineParser>\n#include <QDir>\n#include <QFileInfo>\n#include <QRegularExpression>\n#include <QRegularExpressionMatch>\n#include <QStandardPaths>\n#include <QSysInfo>\n#include \"Code\/CaptureContext.h\"\n#include \"Code\/QRDUtils.h\"\n#include \"Code\/Resources.h\"\n#include \"Code\/pyrenderdoc\/PythonContext.h\"\n#include \"Windows\/Dialogs\/CrashDialog.h\"\n#include \"Windows\/MainWindow.h\"\n#include \"version.h\"\n\n#if defined(Q_OS_WIN32)\nextern \"C\" {\n_declspec(dllexport) unsigned long NvOptimusEnablement = 0x00000001;\n}\n#endif\n\nREPLAY_PROGRAM_MARKER()\n\nvoid sharedLogOutput(QtMsgType type, const QMessageLogContext &context, const QString &msg)\n{\n  LogType logtype = LogType::Comment;\n\n  switch(type)\n  {\n    case QtDebugMsg: logtype = LogType::Debug; break;\n    case QtInfoMsg: logtype = LogType::Comment; break;\n    case QtWarningMsg: logtype = LogType::Warning; break;\n    case QtCriticalMsg: logtype = LogType::Error; break;\n    case QtFatalMsg: logtype = LogType::Fatal; break;\n  }\n\n  RENDERDOC_LogMessage(logtype, \"QTRD\", context.file, context.line, msg.toUtf8().data());\n}\n\nstatic QString tr(const char *string)\n{\n  return QApplication::translate(\"qrenderdoc\", string);\n}\n\nvoid hideOption(QCommandLineOption &opt)\n{\n#if QT_VERSION >= QT_VERSION_CHECK(5, 8, 0)\n  opt.setFlags(QCommandLineOption::HiddenFromHelp);\n#else\n  opt.setHidden(true);\n#endif\n}\n\nint main(int argc, char *argv[])\n{\n  \/\/ call this as the very first thing - no-op on other platforms, but on linux it means\n  \/\/ XInitThreads will be called allowing driver access to xlib on multiple threads.\n  QCoreApplication::setAttribute(Qt::AA_X11InitThreads);\n\n  qInstallMessageHandler(sharedLogOutput);\n\n  qInfo() << \"QRenderDoc initialising.\";\n\n  QGuiApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\n  QGuiApplication::setAttribute(Qt::AA_UseHighDpiPixmaps);\n\n  QApplication::setApplicationVersion(lit(FULL_VERSION_STRING));\n\n  QApplication application(argc, argv);\n\n  QCommandLineParser parser;\n  parser.setApplicationDescription(tr(\"Qt UI for RenderDoc\"));\n  QCommandLineOption helpOption = parser.addHelpOption();\n  QCommandLineOption versionOption = parser.addVersionOption();\n\n  QCommandLineOption tempfile(\n      lit(\"tempfile\"), tr(\"The filename to be opened is a temporary file owned by this instance.\"));\n  parser.addOption(tempfile);\n\n  QCommandLineOption targetcontrol({lit(\"targetcontrol\"), lit(\"remoteaccess\")},\n                                   tr(\"A target control connection to open on startup.\"),\n                                   lit(\"host:port\"));\n  parser.addOption(targetcontrol);\n\n  QCommandLineOption python({lit(\"python\"), lit(\"script\"), lit(\"py\")},\n                            tr(\"Run a python script before opening the main UI.\"),\n                            lit(\"filename.py\"));\n  parser.addOption(python);\n\n  \/\/ secret non-described options\n  QCommandLineOption installLayer(lit(\"install_vulkan_layer\"), QString(), lit(\"root_or_not\"));\n  hideOption(installLayer);\n  parser.addOption(installLayer);\n\n  QCommandLineOption updateFailed(lit(\"updatefailed\"), QString(), lit(\"errormsg\"));\n  hideOption(updateFailed);\n  parser.addOption(updateFailed);\n\n  QCommandLineOption updateDone(lit(\"updatedone\"));\n  hideOption(updateDone);\n  parser.addOption(updateDone);\n\n  QCommandLineOption crashReport(lit(\"crash\"), QString(), lit(\"reportpath\"));\n  hideOption(crashReport);\n  parser.addOption(crashReport);\n\n#if !defined(RELEASE)\n  QCommandLineOption unittests(lit(\"unittest\"), tr(\"Run unit tests\"));\n  parser.addOption(unittests);\n#endif\n\n  parser.addPositionalArgument(lit(\"filename\"), tr(\"The file to open.\"));\n\n  bool parsedCommands = parser.parse(application.arguments());\n\n  if(!parsedCommands)\n  {\n    QString error = parser.errorText();\n    printf(\"%s\\n\", error.toUtf8().data());\n    return 1;\n  }\n\n  if(parser.isSet(helpOption))\n  {\n    parser.showHelp();\n    return 0;\n  }\n\n  if(parser.isSet(versionOption))\n  {\n    printf(\"QRenderDoc v%s (%s)\\n\", MAJOR_MINOR_VERSION_STRING, GitVersionHash);\n#if defined(DISTRIBUTION_VERSION)\n    printf(\"Packaged for %s - %s\\n\", DISTRIBUTION_NAME, DISTRIBUTION_CONTACT);\n#endif\n    return 0;\n  }\n\n#if !defined(RELEASE)\n  if(parser.isSet(unittests))\n  {\n    PythonContext::GlobalInit();\n\n    bool errors = false;\n\n    qInfo() << \"Checking python binding consistency.\";\n\n    {\n      PythonContextHandle py;\n      errors = py.ctx().CheckInterfaces();\n    }\n\n    if(errors)\n    {\n      qCritical() << \"Found errors in python bindings. Please fix!\";\n      return 1;\n    }\n\n    qInfo() << \"Python bindings are consistent.\";\n    return 0;\n  }\n#endif\n\n  if(parser.isSet(installLayer))\n  {\n    qInfo() << \"Updating Vulkan layer registration\";\n    if(parser.value(installLayer) == lit(\"root\"))\n      RENDERDOC_UpdateVulkanLayerRegistration(true);\n    else\n      RENDERDOC_UpdateVulkanLayerRegistration(false);\n    return 0;\n  }\n\n  bool temp = parser.isSet(tempfile);\n\n  bool updateApplied = false;\n\n  if(parser.isSet(updateFailed))\n  {\n    RDDialog::critical(NULL, tr(\"Error updating\"),\n                       tr(\"Error applying update: %1\").arg(parser.value(updateFailed)));\n  }\n\n  if(parser.isSet(updateDone))\n  {\n    updateApplied = true;\n\n    RENDERDOC_UpdateInstalledVersionNumber();\n  }\n\n  QString remoteHost;\n  uint remoteIdent = 0;\n\n  if(parser.isSet(targetcontrol))\n  {\n    QRegularExpression regexp(lit(\"^([a-zA-Z0-9_-]+:)?([0-9]+)$\"));\n\n    QRegularExpressionMatch match = regexp.match(parser.value(targetcontrol));\n\n    if(!match.hasMatch())\n    {\n      qCritical() << \"--targetcontrol option must be followed by host:port\";\n      return 1;\n    }\n\n    QString host = match.captured(1);\n\n    if(host.length() > 0 && host[host.length() - 1] == QLatin1Char(':'))\n      host.chop(1);\n\n    bool ok = false;\n    uint32_t ident = match.captured(2).toUInt(&ok);\n\n    if(ok)\n    {\n      remoteHost = host;\n      remoteIdent = ident;\n    }\n    else\n    {\n      qCritical() << \"--targetcontrol parameter\" << match.captured(1) << \"malformed\";\n      return 1;\n    }\n  }\n\n  QString crashReportPath;\n  if(parser.isSet(crashReport))\n    crashReportPath = parser.value(crashReport);\n\n  QStringList pyscripts = parser.values(python);\n\n  \/\/ load the first filename in the positional arguments.\n  QStringList remaining = parser.positionalArguments();\n\n  QString filename;\n  for(int i = 0; i < remaining.count(); i++)\n  {\n    const QString &fn = remaining[i];\n    QFileInfo checkFile(fn);\n    if(checkFile.exists() && checkFile.isFile())\n    {\n      filename = fn;\n      remaining.removeAt(i);\n      break;\n    }\n  }\n\n  RegisterMetatypeConversions();\n\n  {\n    PersistantConfig config;\n\n    {\n      QString configPath = QStandardPaths::writableLocation(QStandardPaths::AppDataLocation);\n      QDir dir(configPath);\n\n      if(!dir.exists())\n        dir.mkpath(configPath);\n    }\n\n    QString configFilename = configFilePath(lit(\"UI.config\"));\n\n    if(!config.Load(configFilename))\n    {\n      RDDialog::critical(\n          NULL, CaptureContext::tr(\"Error loading config\"),\n          CaptureContext::tr(\n              \"Error loading config file\\n%1\\nA default config is loaded and will be saved out.\")\n              .arg(configFilename));\n    }\n\n    if(!config.Analytics_TotalOptOut)\n      Analytics::Load();\n\n    bool isDarkTheme = IsDarkTheme();\n\n    bool styleSet = config.SetStyle();\n\n    \/\/ unrecognised style, or empty (none set), choose a default\n    if(!styleSet)\n    {\n      config.UIStyle = isDarkTheme ? lit(\"RDDark\") : lit(\"RDLight\");\n\n      config.SetStyle();\n    }\n\n    config.SetupFormatting();\n\n    Resources::Initialise();\n\n    GUIInvoke::init();\n\n    {\n      GlobalEnvironment env;\n#if defined(RENDERDOC_PLATFORM_LINUX)\n      env.xlibDisplay = QX11Info::display();\n#endif\n      rdcarray<rdcstr> coreargs;\n      if(!crashReportPath.isEmpty())\n        coreargs.push_back(\"--crash\");\n      for(const QString &arg : remaining)\n        coreargs.push_back(arg);\n      RENDERDOC_InitGlobalEnv(env, coreargs);\n    }\n\n    if(!crashReportPath.isEmpty())\n    {\n      QFile f(crashReportPath);\n\n      if(f.exists() && f.open(QIODevice::ReadOnly | QIODevice::Text))\n      {\n        QVariantMap json = JSONToVariant(QString::fromUtf8(f.readAll()));\n\n        if(json.contains(lit(\"report\")))\n        {\n          CrashDialog dialog(config, json);\n\n          RDDialog::show(&dialog);\n        }\n      }\n    }\n    else\n    {\n      PythonContext::GlobalInit();\n\n      CaptureContext ctx(filename, remoteHost, remoteIdent, temp, config);\n\n      Analytics::Prompt(ctx, config);\n\n      ANALYTIC_SET(Environment.RenderDocVersion, lit(FULL_VERSION_STRING));\n#if defined(DISTRIBUTION_VERSION)\n      ANALYTIC_SET(Environment.DistributionVersion, lit(DISTRIBUTION_NAME));\n#endif\n      ANALYTIC_SET(Environment.Bitness, ((sizeof(void *) == sizeof(uint64_t)) ? 64 : 32));\n      ANALYTIC_SET(Environment.OSVersion, QSysInfo::prettyProductName());\n\n#if RENDERDOC_STABLE_BUILD\n      ANALYTIC_SET(Environment.OfficialBuildRun, true);\n#else\n      ANALYTIC_SET(Environment.DevelBuildRun, true);\n#endif\n\n      ANALYTIC_SET(DaysUsed[QDateTime::currentDateTime().date().day()], true);\n\n      if(!pyscripts.isEmpty())\n      {\n        PythonContextHandle py;\n\n        ANALYTIC_SET(UIFeatures.PythonInterop, true);\n\n        py.ctx().setGlobal(\"pyrenderdoc\", (ICaptureContext *)&ctx);\n\n        QObject::connect(&py.ctx(), &PythonContext::exception,\n                         [](const QString &type, const QString &value, int, QList<QString> frames) {\n\n                           QString exString;\n\n                           if(!frames.isEmpty())\n                           {\n                             exString += tr(\"Traceback (most recent call last):\\n\");\n                             for(const QString &f : frames)\n                               exString += QFormatStr(\"  %1\\n\").arg(f);\n                           }\n\n                           exString += QFormatStr(\"%1: %2\\n\").arg(type).arg(value);\n\n                           qCritical(\"%s\", exString.toUtf8().data());\n                         });\n\n        QObject::connect(&py.ctx(), &PythonContext::textOutput,\n                         [](bool isStdError, const QString &output) {\n                           if(isStdError)\n                             qCritical(\"%s\", output.toUtf8().data());\n                           else\n                             qInfo(\"%s\", output.toUtf8().data());\n                         });\n\n        for(const QString &f : pyscripts)\n        {\n          QFileInfo checkFile(f);\n          if(checkFile.exists() && checkFile.isFile())\n          {\n            qInfo() << \"running\" << f;\n            py.ctx().executeFile(f);\n          }\n          else\n          {\n            qWarning() << \"Invalid python script\" << f;\n          }\n        }\n      }\n\n      if(updateApplied)\n      {\n        config.CheckUpdate_UpdateAvailable = false;\n        config.CheckUpdate_UpdateResponse = \"\";\n        config.Save();\n      }\n\n      while(ctx.isRunning())\n      {\n        application.processEvents(QEventLoop::WaitForMoreEvents);\n        QCoreApplication::sendPostedEvents();\n        QCoreApplication::sendPostedEvents(NULL, QEvent::DeferredDelete);\n      }\n\n      config.Save();\n    }\n\n    PythonContext::GlobalShutdown();\n\n    Formatter::shutdown();\n  }\n\n  return 0;\n}\n<commit_msg>Don't create GUI application to run unit tests<commit_after>\/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2016-2018 Baldur Karlsson\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 <QApplication>\n#include <QCommandLineParser>\n#include <QDir>\n#include <QFileInfo>\n#include <QRegularExpression>\n#include <QRegularExpressionMatch>\n#include <QStandardPaths>\n#include <QSysInfo>\n#include \"Code\/CaptureContext.h\"\n#include \"Code\/QRDUtils.h\"\n#include \"Code\/Resources.h\"\n#include \"Code\/pyrenderdoc\/PythonContext.h\"\n#include \"Windows\/Dialogs\/CrashDialog.h\"\n#include \"Windows\/MainWindow.h\"\n#include \"version.h\"\n\n#if defined(Q_OS_WIN32)\nextern \"C\" {\n_declspec(dllexport) unsigned long NvOptimusEnablement = 0x00000001;\n}\n#endif\n\nREPLAY_PROGRAM_MARKER()\n\nvoid sharedLogOutput(QtMsgType type, const QMessageLogContext &context, const QString &msg)\n{\n  LogType logtype = LogType::Comment;\n\n  switch(type)\n  {\n    case QtDebugMsg: logtype = LogType::Debug; break;\n    case QtInfoMsg: logtype = LogType::Comment; break;\n    case QtWarningMsg: logtype = LogType::Warning; break;\n    case QtCriticalMsg: logtype = LogType::Error; break;\n    case QtFatalMsg: logtype = LogType::Fatal; break;\n  }\n\n  RENDERDOC_LogMessage(logtype, \"QTRD\", context.file, context.line, msg.toUtf8().data());\n}\n\nstatic QString tr(const char *string)\n{\n  return QApplication::translate(\"qrenderdoc\", string);\n}\n\nvoid hideOption(QCommandLineOption &opt)\n{\n#if QT_VERSION >= QT_VERSION_CHECK(5, 8, 0)\n  opt.setFlags(QCommandLineOption::HiddenFromHelp);\n#else\n  opt.setHidden(true);\n#endif\n}\n\nint main(int argc, char *argv[])\n{\n  \/\/ call this as the very first thing - no-op on other platforms, but on linux it means\n  \/\/ XInitThreads will be called allowing driver access to xlib on multiple threads.\n  QCoreApplication::setAttribute(Qt::AA_X11InitThreads);\n\n  qInstallMessageHandler(sharedLogOutput);\n\n  qInfo() << \"QRenderDoc initialising.\";\n\n  QGuiApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\n  QGuiApplication::setAttribute(Qt::AA_UseHighDpiPixmaps);\n\n  QApplication::setApplicationVersion(lit(FULL_VERSION_STRING));\n\n\/\/ shortcut here so we can run this with a non-GUI application\n#if !defined(RELEASE)\n  if(QString::fromUtf8(argv[1]) == lit(\"--unittest\"))\n  {\n    QCoreApplication application(argc, argv);\n    PythonContext::GlobalInit();\n\n    bool errors = false;\n\n    qInfo() << \"Checking python binding consistency.\";\n\n    {\n      PythonContextHandle py;\n      errors = py.ctx().CheckInterfaces();\n    }\n\n    if(errors)\n    {\n      qCritical() << \"Found errors in python bindings. Please fix!\";\n      return 1;\n    }\n\n    qInfo() << \"Python bindings are consistent.\";\n    return 0;\n  }\n#endif\n\n  QApplication application(argc, argv);\n\n  QCommandLineParser parser;\n  parser.setApplicationDescription(tr(\"Qt UI for RenderDoc\"));\n  QCommandLineOption helpOption = parser.addHelpOption();\n  QCommandLineOption versionOption = parser.addVersionOption();\n\n  QCommandLineOption tempfile(\n      lit(\"tempfile\"), tr(\"The filename to be opened is a temporary file owned by this instance.\"));\n  parser.addOption(tempfile);\n\n  QCommandLineOption targetcontrol({lit(\"targetcontrol\"), lit(\"remoteaccess\")},\n                                   tr(\"A target control connection to open on startup.\"),\n                                   lit(\"host:port\"));\n  parser.addOption(targetcontrol);\n\n  QCommandLineOption python({lit(\"python\"), lit(\"script\"), lit(\"py\")},\n                            tr(\"Run a python script before opening the main UI.\"),\n                            lit(\"filename.py\"));\n  parser.addOption(python);\n\n  \/\/ secret non-described options\n  QCommandLineOption installLayer(lit(\"install_vulkan_layer\"), QString(), lit(\"root_or_not\"));\n  hideOption(installLayer);\n  parser.addOption(installLayer);\n\n  QCommandLineOption updateFailed(lit(\"updatefailed\"), QString(), lit(\"errormsg\"));\n  hideOption(updateFailed);\n  parser.addOption(updateFailed);\n\n  QCommandLineOption updateDone(lit(\"updatedone\"));\n  hideOption(updateDone);\n  parser.addOption(updateDone);\n\n  QCommandLineOption crashReport(lit(\"crash\"), QString(), lit(\"reportpath\"));\n  hideOption(crashReport);\n  parser.addOption(crashReport);\n\n  parser.addPositionalArgument(lit(\"filename\"), tr(\"The file to open.\"));\n\n  bool parsedCommands = parser.parse(application.arguments());\n\n  if(!parsedCommands)\n  {\n    QString error = parser.errorText();\n    printf(\"%s\\n\", error.toUtf8().data());\n    return 1;\n  }\n\n  if(parser.isSet(helpOption))\n  {\n    parser.showHelp();\n    return 0;\n  }\n\n  if(parser.isSet(versionOption))\n  {\n    printf(\"QRenderDoc v%s (%s)\\n\", MAJOR_MINOR_VERSION_STRING, GitVersionHash);\n#if defined(DISTRIBUTION_VERSION)\n    printf(\"Packaged for %s - %s\\n\", DISTRIBUTION_NAME, DISTRIBUTION_CONTACT);\n#endif\n    return 0;\n  }\n\n  if(parser.isSet(installLayer))\n  {\n    qInfo() << \"Updating Vulkan layer registration\";\n    if(parser.value(installLayer) == lit(\"root\"))\n      RENDERDOC_UpdateVulkanLayerRegistration(true);\n    else\n      RENDERDOC_UpdateVulkanLayerRegistration(false);\n    return 0;\n  }\n\n  bool temp = parser.isSet(tempfile);\n\n  bool updateApplied = false;\n\n  if(parser.isSet(updateFailed))\n  {\n    RDDialog::critical(NULL, tr(\"Error updating\"),\n                       tr(\"Error applying update: %1\").arg(parser.value(updateFailed)));\n  }\n\n  if(parser.isSet(updateDone))\n  {\n    updateApplied = true;\n\n    RENDERDOC_UpdateInstalledVersionNumber();\n  }\n\n  QString remoteHost;\n  uint remoteIdent = 0;\n\n  if(parser.isSet(targetcontrol))\n  {\n    QRegularExpression regexp(lit(\"^([a-zA-Z0-9_-]+:)?([0-9]+)$\"));\n\n    QRegularExpressionMatch match = regexp.match(parser.value(targetcontrol));\n\n    if(!match.hasMatch())\n    {\n      qCritical() << \"--targetcontrol option must be followed by host:port\";\n      return 1;\n    }\n\n    QString host = match.captured(1);\n\n    if(host.length() > 0 && host[host.length() - 1] == QLatin1Char(':'))\n      host.chop(1);\n\n    bool ok = false;\n    uint32_t ident = match.captured(2).toUInt(&ok);\n\n    if(ok)\n    {\n      remoteHost = host;\n      remoteIdent = ident;\n    }\n    else\n    {\n      qCritical() << \"--targetcontrol parameter\" << match.captured(1) << \"malformed\";\n      return 1;\n    }\n  }\n\n  QString crashReportPath;\n  if(parser.isSet(crashReport))\n    crashReportPath = parser.value(crashReport);\n\n  QStringList pyscripts = parser.values(python);\n\n  \/\/ load the first filename in the positional arguments.\n  QStringList remaining = parser.positionalArguments();\n\n  QString filename;\n  for(int i = 0; i < remaining.count(); i++)\n  {\n    const QString &fn = remaining[i];\n    QFileInfo checkFile(fn);\n    if(checkFile.exists() && checkFile.isFile())\n    {\n      filename = fn;\n      remaining.removeAt(i);\n      break;\n    }\n  }\n\n  RegisterMetatypeConversions();\n\n  {\n    PersistantConfig config;\n\n    {\n      QString configPath = QStandardPaths::writableLocation(QStandardPaths::AppDataLocation);\n      QDir dir(configPath);\n\n      if(!dir.exists())\n        dir.mkpath(configPath);\n    }\n\n    QString configFilename = configFilePath(lit(\"UI.config\"));\n\n    if(!config.Load(configFilename))\n    {\n      RDDialog::critical(\n          NULL, CaptureContext::tr(\"Error loading config\"),\n          CaptureContext::tr(\n              \"Error loading config file\\n%1\\nA default config is loaded and will be saved out.\")\n              .arg(configFilename));\n    }\n\n    if(!config.Analytics_TotalOptOut)\n      Analytics::Load();\n\n    bool isDarkTheme = IsDarkTheme();\n\n    bool styleSet = config.SetStyle();\n\n    \/\/ unrecognised style, or empty (none set), choose a default\n    if(!styleSet)\n    {\n      config.UIStyle = isDarkTheme ? lit(\"RDDark\") : lit(\"RDLight\");\n\n      config.SetStyle();\n    }\n\n    config.SetupFormatting();\n\n    Resources::Initialise();\n\n    GUIInvoke::init();\n\n    {\n      GlobalEnvironment env;\n#if defined(RENDERDOC_PLATFORM_LINUX)\n      env.xlibDisplay = QX11Info::display();\n#endif\n      rdcarray<rdcstr> coreargs;\n      if(!crashReportPath.isEmpty())\n        coreargs.push_back(\"--crash\");\n      for(const QString &arg : remaining)\n        coreargs.push_back(arg);\n      RENDERDOC_InitGlobalEnv(env, coreargs);\n    }\n\n    if(!crashReportPath.isEmpty())\n    {\n      QFile f(crashReportPath);\n\n      if(f.exists() && f.open(QIODevice::ReadOnly | QIODevice::Text))\n      {\n        QVariantMap json = JSONToVariant(QString::fromUtf8(f.readAll()));\n\n        if(json.contains(lit(\"report\")))\n        {\n          CrashDialog dialog(config, json);\n\n          RDDialog::show(&dialog);\n        }\n      }\n    }\n    else\n    {\n      PythonContext::GlobalInit();\n\n      CaptureContext ctx(filename, remoteHost, remoteIdent, temp, config);\n\n      Analytics::Prompt(ctx, config);\n\n      ANALYTIC_SET(Environment.RenderDocVersion, lit(FULL_VERSION_STRING));\n#if defined(DISTRIBUTION_VERSION)\n      ANALYTIC_SET(Environment.DistributionVersion, lit(DISTRIBUTION_NAME));\n#endif\n      ANALYTIC_SET(Environment.Bitness, ((sizeof(void *) == sizeof(uint64_t)) ? 64 : 32));\n      ANALYTIC_SET(Environment.OSVersion, QSysInfo::prettyProductName());\n\n#if RENDERDOC_STABLE_BUILD\n      ANALYTIC_SET(Environment.OfficialBuildRun, true);\n#else\n      ANALYTIC_SET(Environment.DevelBuildRun, true);\n#endif\n\n      ANALYTIC_SET(DaysUsed[QDateTime::currentDateTime().date().day()], true);\n\n      if(!pyscripts.isEmpty())\n      {\n        PythonContextHandle py;\n\n        ANALYTIC_SET(UIFeatures.PythonInterop, true);\n\n        py.ctx().setGlobal(\"pyrenderdoc\", (ICaptureContext *)&ctx);\n\n        QObject::connect(&py.ctx(), &PythonContext::exception,\n                         [](const QString &type, const QString &value, int, QList<QString> frames) {\n\n                           QString exString;\n\n                           if(!frames.isEmpty())\n                           {\n                             exString += tr(\"Traceback (most recent call last):\\n\");\n                             for(const QString &f : frames)\n                               exString += QFormatStr(\"  %1\\n\").arg(f);\n                           }\n\n                           exString += QFormatStr(\"%1: %2\\n\").arg(type).arg(value);\n\n                           qCritical(\"%s\", exString.toUtf8().data());\n                         });\n\n        QObject::connect(&py.ctx(), &PythonContext::textOutput,\n                         [](bool isStdError, const QString &output) {\n                           if(isStdError)\n                             qCritical(\"%s\", output.toUtf8().data());\n                           else\n                             qInfo(\"%s\", output.toUtf8().data());\n                         });\n\n        for(const QString &f : pyscripts)\n        {\n          QFileInfo checkFile(f);\n          if(checkFile.exists() && checkFile.isFile())\n          {\n            qInfo() << \"running\" << f;\n            py.ctx().executeFile(f);\n          }\n          else\n          {\n            qWarning() << \"Invalid python script\" << f;\n          }\n        }\n      }\n\n      if(updateApplied)\n      {\n        config.CheckUpdate_UpdateAvailable = false;\n        config.CheckUpdate_UpdateResponse = \"\";\n        config.Save();\n      }\n\n      while(ctx.isRunning())\n      {\n        application.processEvents(QEventLoop::WaitForMoreEvents);\n        QCoreApplication::sendPostedEvents();\n        QCoreApplication::sendPostedEvents(NULL, QEvent::DeferredDelete);\n      }\n\n      config.Save();\n    }\n\n    PythonContext::GlobalShutdown();\n\n    Formatter::shutdown();\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#pragma once\n\n#include \"geometry\/frame.hpp\"\n#include \"geometry\/grassmann.hpp\"\n#include \"geometry\/named_quantities.hpp\"\n#include \"geometry\/r3_element.hpp\"\n#include \"quantities\/named_quantities.hpp\"\n#include \"serialization\/geometry.pb.h\"\n\nnamespace principia {\nnamespace physics {\nnamespace internal_euler_solver {\n\nusing geometry::Bivector;\nusing geometry::Frame;\nusing geometry::Instant;\nusing geometry::R3Element;\nusing quantities::Angle;\nusing quantities::AngularFrequency;\nusing quantities::AngularMomentum;\nusing quantities::MomentOfInertia;\nusing quantities::NaN;\n\n\/\/ A solver for Euler's rotation equations.  It follows Celledoni, Fassò,\n\/\/ Säfström and Zanna, 2007, The exact computation of the free rigid body motion\n\/\/ and its use in splitting method.\nclass EulerSolver {\n public:\n  using PrincipalAxesFrame = Frame<serialization::Frame::PhysicsTag,\n                                   serialization::Frame::PRINCIPAL_AXES,\n                                   \/*frame_is_inertial*\/ false>;\n  using AngularMomentumBivector = Bivector<AngularMomentum, PrincipalAxesFrame>;\n\n  \/\/ Constructs a solver for a body with the given moments_of_inertia in its\n  \/\/ principal axes frame.  The moments must be in increasing order.  At\n  \/\/ initial_time the angular momentum is initial_angular_momentum.\n  EulerSolver(R3Element<MomentOfInertia> const& moments_of_inertia,\n              AngularMomentumBivector const& initial_angular_momentum,\n              Instant const& initial_time);\n\n  \/\/ Computes the angular momentum at the given time.\n  AngularMomentumBivector AngularMomentumAt(Instant const& time) const;\n\nprivate:\n  \/\/ The formula to use, following Cellodoni et al., Section 2.2.  They don't\n  \/\/ have a formula for the spherical case.\n  enum class Formula {\n    i,\n    ii,\n    iii,\n    Sphere\n  };\n\n  \/\/ Construction parameters.\n  AngularMomentumBivector const initial_angular_momentum_;\n  Instant const initial_time_;\n\n  \/\/ Amusingly, the formula to use is a constant of motion.\n  Formula formula_;\n\n  \/\/ Only the parameters needed for the selected formula are non-NaN after\n  \/\/ construction.\n  AngularMomentum B₁₃_ = NaN<AngularMomentum>();\n  AngularMomentum B₃₁_ = NaN<AngularMomentum>();\n  AngularMomentum B₂₁_ = NaN<AngularMomentum>();\n  AngularMomentum B₂₃_ = NaN<AngularMomentum>();\n  AngularMomentum G_ = NaN<AngularMomentum>();\n  AngularFrequency λ₁_ = NaN<AngularFrequency>();\n  AngularFrequency λ₃_ = NaN<AngularFrequency>();\n  double mc_ = NaN<double>();\n  Angle ν_ = NaN<Angle>();\n  double σʹ_ = NaN<double>();\n};\n\n}  \/\/ namespace internal_euler_solver\n\nusing internal_euler_solver::EulerSolver;\n\n}  \/\/ namespace physics\n}  \/\/ namespace principia\n<commit_msg>More cleanups.<commit_after>\n#pragma once\n\n#include \"geometry\/frame.hpp\"\n#include \"geometry\/grassmann.hpp\"\n#include \"geometry\/named_quantities.hpp\"\n#include \"geometry\/r3_element.hpp\"\n#include \"quantities\/named_quantities.hpp\"\n#include \"serialization\/geometry.pb.h\"\n\nnamespace principia {\nnamespace physics {\nnamespace internal_euler_solver {\n\nusing geometry::Bivector;\nusing geometry::Frame;\nusing geometry::Instant;\nusing geometry::R3Element;\nusing quantities::Angle;\nusing quantities::AngularFrequency;\nusing quantities::AngularMomentum;\nusing quantities::MomentOfInertia;\nusing quantities::NaN;\n\n\/\/ A solver for Euler's rotation equations.  It follows Celledoni, Fassò,\n\/\/ Säfström and Zanna, 2007, The exact computation of the free rigid body motion\n\/\/ and its use in splitting method.\nclass EulerSolver {\n public:\n  using PrincipalAxesFrame = Frame<serialization::Frame::PhysicsTag,\n                                   serialization::Frame::PRINCIPAL_AXES,\n                                   \/*frame_is_inertial*\/ false>;\n  using AngularMomentumBivector = Bivector<AngularMomentum, PrincipalAxesFrame>;\n\n  \/\/ Constructs a solver for a body with the given moments_of_inertia in its\n  \/\/ principal axes frame.  The moments must be in increasing order.  At\n  \/\/ initial_time the angular momentum is initial_angular_momentum.\n  EulerSolver(R3Element<MomentOfInertia> const& moments_of_inertia,\n              AngularMomentumBivector const& initial_angular_momentum,\n              Instant const& initial_time);\n\n  \/\/ Computes the angular momentum at the given time.\n  AngularMomentumBivector AngularMomentumAt(Instant const& time) const;\n\nprivate:\n  \/\/ The formula to use, following Cellodoni et al., Section 2.2.  They don't\n  \/\/ have a formula for the spherical case.\n  enum class Formula {\n    i,\n    ii,\n    iii,\n    Sphere\n  };\n\n  \/\/ Construction parameters.\n  AngularMomentumBivector const initial_angular_momentum_;\n  Instant const initial_time_;\n\n  \/\/ Amusingly, the formula to use is a constant of motion.\n  Formula formula_;\n\n  \/\/ Only the parameters needed for the selected formula are non-NaN after\n  \/\/ construction.\n  AngularMomentum B₁₃_ = NaN<AngularMomentum>();\n  AngularMomentum B₃₁_ = NaN<AngularMomentum>();\n  AngularMomentum B₂₁_ = NaN<AngularMomentum>();\n  AngularMomentum B₂₃_ = NaN<AngularMomentum>();\n  AngularMomentum G_ = NaN<AngularMomentum>();\n  AngularFrequency λ₁_ = NaN<AngularFrequency>();\n  AngularFrequency λ₃_ = NaN<AngularFrequency>();\n  double mc_ = NaN<double>();\n  Angle ν_ = NaN<Angle>();\n};\n\n}  \/\/ namespace internal_euler_solver\n\nusing internal_euler_solver::EulerSolver;\n\n}  \/\/ namespace physics\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\n#pragma once\n\n#include \"quantities\/dimensions.hpp\"\n\n#include \"base\/not_constructible.hpp\"\n\nnamespace principia {\nnamespace quantities {\nnamespace internal_dimensions {\n\nusing base::not_constructible;\n\nclass ExponentSerializer : not_constructible {\n public:\n  \/\/ Returns true if the exponent is in the range that we can serialize.\n  static constexpr bool IsSerializable(std::int64_t exponent);\n\n  \/\/ Returns the serialized representation of the exponent.  |position| is the\n  \/\/ 0-based position of the dimension in the representation.\n  static constexpr std::int64_t Representation(\n      std::int64_t exponent,\n      std::int64_t position);\n\n private:\n  static constexpr std::int64_t min_exponent = -24;\n  static constexpr std::int64_t max_exponent = 7;\n  static constexpr std::int64_t exponent_mask = 0x1F;\n  static constexpr std::int64_t exponent_bits = 5;\n};\n\nconstexpr bool ExponentSerializer::IsSerializable(\n    std::int64_t const exponent) {\n  return exponent >= min_exponent && exponent <= max_exponent;\n}\n\nconstexpr std::int64_t ExponentSerializer::Representation(\n    std::int64_t const exponent,\n    std::int64_t const position) {\n  \/\/ For exponents in [-16, 7] this returns the representations\n  \/\/ 0x10, 0x11, ... 0x00, ... 0x07.  For exponents in [-24, -17] this returns\n  \/\/ the representations 0x08, 0x09, ... 0x0F.  The latter used to be reserved\n  \/\/ for exponents in the range [8, 15] but we believe that we never used them,\n  \/\/ and with polynomials in the monomial basis we need large negative\n  \/\/ exponents.\n  return (exponent & exponent_mask) << (position * exponent_bits);\n}\n\ntemplate<std::int64_t LengthExponent,\n         std::int64_t MassExponent,\n         std::int64_t TimeExponent,\n         std::int64_t CurrentExponent,\n         std::int64_t TemperatureExponent,\n         std::int64_t AmountExponent,\n         std::int64_t LuminousIntensityExponent,\n         std::int64_t AngleExponent>\nstruct Dimensions : not_constructible {\n  enum {\n    Length            = LengthExponent,\n    Mass              = MassExponent,\n    Time              = TimeExponent,\n    Current           = CurrentExponent,\n    Temperature       = TemperatureExponent,\n    Amount            = AmountExponent,\n    LuminousIntensity = LuminousIntensityExponent,\n    Angle             = AngleExponent,\n  };\n\n  static std::int64_t constexpr representation =\n      ExponentSerializer::Representation(LengthExponent, 0)            |\n      ExponentSerializer::Representation(MassExponent, 1)              |\n      ExponentSerializer::Representation(TimeExponent, 2)              |\n      ExponentSerializer::Representation(CurrentExponent, 3)           |\n      ExponentSerializer::Representation(TemperatureExponent, 4)       |\n      ExponentSerializer::Representation(AmountExponent, 5)            |\n      ExponentSerializer::Representation(LuminousIntensityExponent, 6) |\n      ExponentSerializer::Representation(AngleExponent, 7);\n};\n\ntemplate<typename Dimensions>\nstruct DimensionsAreSerializable : std::true_type {\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Length),\n                \"Invalid length exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Mass),\n                \"Invalid mass exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Time),\n                \"Invalid time exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Current),\n                \"Invalid current exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Temperature),\n                \"Invalid temperature exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Amount),\n                \"Invalid amount exponent\");\n  static_assert(ExponentSerializer::IsSerializable(\n                    Dimensions::LuminousIntensity),\n                \"Invalid luminous intensity exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Angle),\n                \"Invalid angle exponent\");\n};\n\ntemplate<typename Dimensions, int n>\nstruct DimensionsExponentiationGenerator : not_constructible {\n  using Type =\n      internal_dimensions::Dimensions<Dimensions::Length * n,\n                                      Dimensions::Mass * n,\n                                      Dimensions::Time * n,\n                                      Dimensions::Current * n,\n                                      Dimensions::Temperature * n,\n                                      Dimensions::Amount * n,\n                                      Dimensions::LuminousIntensity * n,\n                                      Dimensions::Angle * n>;\n};\n\ntemplate<typename Dimensions, int n>\nstruct DimensionsNthRootGenerator : not_constructible {\n  static_assert((Dimensions::Length % n) == 0 &&\n                (Dimensions::Mass % n) == 0 &&\n                (Dimensions::Time % n) == 0 &&\n                (Dimensions::Current % n) == 0 &&\n                (Dimensions::Temperature % n) == 0 &&\n                (Dimensions::Amount % n) == 0 &&\n                (Dimensions::LuminousIntensity % n) == 0 &&\n                (Dimensions::Angle % n) == 0,\n                \"Dimensions not suitable for Nth root\");\n\n  using Type =\n      internal_dimensions::Dimensions<Dimensions::Length \/ n,\n                                      Dimensions::Mass \/ n,\n                                      Dimensions::Time \/ n,\n                                      Dimensions::Current \/ n,\n                                      Dimensions::Temperature \/ n,\n                                      Dimensions::Amount \/ n,\n                                      Dimensions::LuminousIntensity \/ n,\n                                      Dimensions::Angle \/ n>;\n};\n\ntemplate<typename LDimensions, typename RDimensions>\nstruct DimensionsProductGenerator : not_constructible {\n  using Type = Dimensions<LDimensions::Length + RDimensions::Length,\n                          LDimensions::Mass + RDimensions::Mass,\n                          LDimensions::Time + RDimensions::Time,\n                          LDimensions::Current + RDimensions::Current,\n                          LDimensions::Temperature + RDimensions::Temperature,\n                          LDimensions::Amount + RDimensions::Amount,\n                          LDimensions::LuminousIntensity +\n                              RDimensions::LuminousIntensity,\n                          LDimensions::Angle + RDimensions::Angle>;\n};\n\ntemplate<typename LDimensions, typename RDimensions>\nstruct DimensionsQuotientGenerator : not_constructible {\n  using Type = Dimensions<LDimensions::Length - RDimensions::Length,\n                          LDimensions::Mass - RDimensions::Mass,\n                          LDimensions::Time - RDimensions::Time,\n                          LDimensions::Current - RDimensions::Current,\n                          LDimensions::Temperature - RDimensions::Temperature,\n                          LDimensions::Amount - RDimensions::Amount,\n                          LDimensions::LuminousIntensity -\n                              RDimensions::LuminousIntensity,\n                          LDimensions::Angle - RDimensions::Angle>;\n};\n\n}  \/\/ namespace internal_dimensions\n}  \/\/ namespace quantities\n}  \/\/ namespace principia\n<commit_msg>Stop relying on operations deprecated by https:\/\/reviews.llvm.org\/D71576.<commit_after>\n#pragma once\n\n#include \"quantities\/dimensions.hpp\"\n\n#include \"base\/not_constructible.hpp\"\n\nnamespace principia {\nnamespace quantities {\nnamespace internal_dimensions {\n\nusing base::not_constructible;\n\nclass ExponentSerializer : not_constructible {\n public:\n  \/\/ Returns true if the exponent is in the range that we can serialize.\n  static constexpr bool IsSerializable(std::int64_t exponent);\n\n  \/\/ Returns the serialized representation of the exponent.  |position| is the\n  \/\/ 0-based position of the dimension in the representation.\n  static constexpr std::int64_t Representation(\n      std::int64_t exponent,\n      std::int64_t position);\n\n private:\n  static constexpr std::int64_t min_exponent = -24;\n  static constexpr std::int64_t max_exponent = 7;\n  static constexpr std::int64_t exponent_mask = 0x1F;\n  static constexpr std::int64_t exponent_bits = 5;\n};\n\nconstexpr bool ExponentSerializer::IsSerializable(\n    std::int64_t const exponent) {\n  return exponent >= min_exponent && exponent <= max_exponent;\n}\n\nconstexpr std::int64_t ExponentSerializer::Representation(\n    std::int64_t const exponent,\n    std::int64_t const position) {\n  \/\/ For exponents in [-16, 7] this returns the representations\n  \/\/ 0x10, 0x11, ... 0x00, ... 0x07.  For exponents in [-24, -17] this returns\n  \/\/ the representations 0x08, 0x09, ... 0x0F.  The latter used to be reserved\n  \/\/ for exponents in the range [8, 15] but we believe that we never used them,\n  \/\/ and with polynomials in the monomial basis we need large negative\n  \/\/ exponents.\n  return (exponent & exponent_mask) << (position * exponent_bits);\n}\n\ntemplate<std::int64_t LengthExponent,\n         std::int64_t MassExponent,\n         std::int64_t TimeExponent,\n         std::int64_t CurrentExponent,\n         std::int64_t TemperatureExponent,\n         std::int64_t AmountExponent,\n         std::int64_t LuminousIntensityExponent,\n         std::int64_t AngleExponent>\nstruct Dimensions : not_constructible {\n  static constexpr std::int64_t Length            = LengthExponent;\n  static constexpr std::int64_t Mass              = MassExponent;\n  static constexpr std::int64_t Time              = TimeExponent;\n  static constexpr std::int64_t Current           = CurrentExponent;\n  static constexpr std::int64_t Temperature       = TemperatureExponent;\n  static constexpr std::int64_t Amount            = AmountExponent;\n  static constexpr std::int64_t LuminousIntensity = LuminousIntensityExponent;\n  static constexpr std::int64_t Angle             = AngleExponent;\n\n  static std::int64_t constexpr representation =\n      ExponentSerializer::Representation(LengthExponent, 0)            |\n      ExponentSerializer::Representation(MassExponent, 1)              |\n      ExponentSerializer::Representation(TimeExponent, 2)              |\n      ExponentSerializer::Representation(CurrentExponent, 3)           |\n      ExponentSerializer::Representation(TemperatureExponent, 4)       |\n      ExponentSerializer::Representation(AmountExponent, 5)            |\n      ExponentSerializer::Representation(LuminousIntensityExponent, 6) |\n      ExponentSerializer::Representation(AngleExponent, 7);\n};\n\ntemplate<typename Dimensions>\nstruct DimensionsAreSerializable : std::true_type {\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Length),\n                \"Invalid length exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Mass),\n                \"Invalid mass exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Time),\n                \"Invalid time exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Current),\n                \"Invalid current exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Temperature),\n                \"Invalid temperature exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Amount),\n                \"Invalid amount exponent\");\n  static_assert(ExponentSerializer::IsSerializable(\n                    Dimensions::LuminousIntensity),\n                \"Invalid luminous intensity exponent\");\n  static_assert(ExponentSerializer::IsSerializable(Dimensions::Angle),\n                \"Invalid angle exponent\");\n};\n\ntemplate<typename Dimensions, int n>\nstruct DimensionsExponentiationGenerator : not_constructible {\n  using Type =\n      internal_dimensions::Dimensions<Dimensions::Length * n,\n                                      Dimensions::Mass * n,\n                                      Dimensions::Time * n,\n                                      Dimensions::Current * n,\n                                      Dimensions::Temperature * n,\n                                      Dimensions::Amount * n,\n                                      Dimensions::LuminousIntensity * n,\n                                      Dimensions::Angle * n>;\n};\n\ntemplate<typename Dimensions, int n>\nstruct DimensionsNthRootGenerator : not_constructible {\n  static_assert((Dimensions::Length % n) == 0 &&\n                (Dimensions::Mass % n) == 0 &&\n                (Dimensions::Time % n) == 0 &&\n                (Dimensions::Current % n) == 0 &&\n                (Dimensions::Temperature % n) == 0 &&\n                (Dimensions::Amount % n) == 0 &&\n                (Dimensions::LuminousIntensity % n) == 0 &&\n                (Dimensions::Angle % n) == 0,\n                \"Dimensions not suitable for Nth root\");\n\n  using Type =\n      internal_dimensions::Dimensions<Dimensions::Length \/ n,\n                                      Dimensions::Mass \/ n,\n                                      Dimensions::Time \/ n,\n                                      Dimensions::Current \/ n,\n                                      Dimensions::Temperature \/ n,\n                                      Dimensions::Amount \/ n,\n                                      Dimensions::LuminousIntensity \/ n,\n                                      Dimensions::Angle \/ n>;\n};\n\ntemplate<typename LDimensions, typename RDimensions>\nstruct DimensionsProductGenerator : not_constructible {\n  using Type = Dimensions<LDimensions::Length + RDimensions::Length,\n                          LDimensions::Mass + RDimensions::Mass,\n                          LDimensions::Time + RDimensions::Time,\n                          LDimensions::Current + RDimensions::Current,\n                          LDimensions::Temperature + RDimensions::Temperature,\n                          LDimensions::Amount + RDimensions::Amount,\n                          LDimensions::LuminousIntensity +\n                              RDimensions::LuminousIntensity,\n                          LDimensions::Angle + RDimensions::Angle>;\n};\n\ntemplate<typename LDimensions, typename RDimensions>\nstruct DimensionsQuotientGenerator : not_constructible {\n  using Type = Dimensions<LDimensions::Length - RDimensions::Length,\n                          LDimensions::Mass - RDimensions::Mass,\n                          LDimensions::Time - RDimensions::Time,\n                          LDimensions::Current - RDimensions::Current,\n                          LDimensions::Temperature - RDimensions::Temperature,\n                          LDimensions::Amount - RDimensions::Amount,\n                          LDimensions::LuminousIntensity -\n                              RDimensions::LuminousIntensity,\n                          LDimensions::Angle - RDimensions::Angle>;\n};\n\n}  \/\/ namespace internal_dimensions\n}  \/\/ namespace quantities\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010, Lawrence Livermore National Security, LLC. Produced at\n\/\/ the Lawrence Livermore National Laboratory. LLNL-CODE-443211. All Rights\n\/\/ reserved. See file COPYRIGHT for details.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability see http:\/\/mfem.org.\n\/\/\n\/\/ MFEM 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) version 2.1 dated February 1999.\n\n#ifndef MFEM_CUDA_HPP\n#define MFEM_CUDA_HPP\n\n#include <cstddef>\n\n\/\/ *****************************************************************************\n#ifdef __NVCC__\n#include <cuda.h>\ninline void cuCheck(const unsigned int c)\n{\n   MFEM_ASSERT(c == cudaSuccess, cudaGetErrorString(cudaGetLastError()));\n}\ntemplate <typename BODY> __global__ static\nvoid cuKernel(const int N, BODY body)\n{\n   const int k = blockDim.x*blockIdx.x + threadIdx.x;\n   if (k >= N) { return; }\n   body(k);\n}\ntemplate <int BLOCKS, typename DBODY>\nvoid cuWrap(const int N, DBODY &&d_body)\n{\n   if (N==0) { return; }\n   const int GRID = (N+BLOCKS-1)\/BLOCKS;\n   cuKernel<<<GRID,BLOCKS>>>(N,d_body);\n   const cudaError_t last = cudaGetLastError();\n   MFEM_ASSERT(last == cudaSuccess, cudaGetErrorString(last));\n}\ntemplate<typename T>\n__host__ __device__ inline T AtomicAdd(T* address, T val)\n{\n   return atomicAdd(address, val);\n}\n#else \/\/ ***********************************************************************\n#define __host__\n#define __device__\n#define __constant__\ntypedef int CUdevice;\ntypedef int CUcontext;\ntypedef void* CUstream;\ntemplate <int BLOCKS, typename DBODY>\nvoid cuWrap(const int N, DBODY &&d_body) {}\ntemplate<typename T> inline T AtomicAdd(T* address, T val)\n{\n   return *address += val;\n}\n#endif \/\/ __NVCC__\n\n\/\/ *****************************************************************************\nnamespace mfem\n{\n\n\/\/ *****************************************************************************\n\/\/ * Allocates device memory\n\/\/ *****************************************************************************\nvoid* cuMemAlloc(void **d_ptr, size_t bytes);\n\n\/\/ *****************************************************************************\n\/\/ * Frees device memory\n\/\/ *****************************************************************************\nvoid* cuMemFree(void *d_ptr);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Host to Device\n\/\/ *****************************************************************************\nvoid* cuMemcpyHtoD(void *d_dst, const void *h_src, size_t bytes);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Host to Device\n\/\/ *****************************************************************************\nvoid* cuMemcpyHtoDAsync(void *d_dst, const void *h_src,\n                        size_t bytes, void *stream);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Device to Device\n\/\/ *****************************************************************************\nvoid* cuMemcpyDtoD(void *d_dst, void *d_src, size_t bytes);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Device to Device\n\/\/ *****************************************************************************\nvoid* cuMemcpyDtoDAsync(void *d_dst, void *d_src, size_t bytes, void *stream);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Device to Host\n\/\/ *****************************************************************************\nvoid* cuMemcpyDtoH(void *h_dst, void *d_src, size_t bytes);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Device to Host\n\/\/ *****************************************************************************\nvoid* cuMemcpyDtoHAsync(void *h_dst, void *d_src, size_t bytes, void *stream);\n\n} \/\/ namespace mfem\n\n#endif \/\/ MFEM_CUDA_HPP\n<commit_msg>adjustments to atomic - adds flexibility<commit_after>\/\/ Copyright (c) 2010, Lawrence Livermore National Security, LLC. Produced at\n\/\/ the Lawrence Livermore National Laboratory. LLNL-CODE-443211. All Rights\n\/\/ reserved. See file COPYRIGHT for details.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability see http:\/\/mfem.org.\n\/\/\n\/\/ MFEM 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) version 2.1 dated February 1999.\n\n#ifndef MFEM_CUDA_HPP\n#define MFEM_CUDA_HPP\n\n#include <cstddef>\n\n\/\/ *****************************************************************************\n#ifdef __NVCC__\n#include <cuda.h>\ninline void cuCheck(const unsigned int c)\n{\n   MFEM_ASSERT(c == cudaSuccess, cudaGetErrorString(cudaGetLastError()));\n}\ntemplate <typename BODY> __global__ static\nvoid cuKernel(const int N, BODY body)\n{\n   const int k = blockDim.x*blockIdx.x + threadIdx.x;\n   if (k >= N) { return; }\n   body(k);\n}\ntemplate <int BLOCKS, typename DBODY>\nvoid cuWrap(const int N, DBODY &&d_body)\n{\n   if (N==0) { return; }\n   const int GRID = (N+BLOCKS-1)\/BLOCKS;\n   cuKernel<<<GRID,BLOCKS>>>(N,d_body);\n   const cudaError_t last = cudaGetLastError();\n   MFEM_ASSERT(last == cudaSuccess, cudaGetErrorString(last));\n}\n#else \/\/ ***********************************************************************\n#define __host__\n#define __device__\n#define __constant__\ntypedef int CUdevice;\ntypedef int CUcontext;\ntypedef void* CUstream;\ntemplate <int BLOCKS, typename DBODY>\nvoid cuWrap(const int N, DBODY &&d_body) {}\n#endif \/\/ __NVCC__\n\n#if defined(__CUDA_ARCH__)\ntemplate<typename T>\n__device__ inline T AtomicAdd(T* address, T val)\n{\n  return atomicAdd(address, val);\n}\n#else\ntemplate<typename T> inline T AtomicAdd(T* address, T val)\n{\n#if defined(_OPENMP)\n#pragma omp atomic\n  *address += val;\n#else\n  *address += val;\n#endif\n  return *address;\n}\n#endif \/\/__CUDA_ARCH__\n\/\/ *****************************************************************************\nnamespace mfem\n{\n\n\/\/ *****************************************************************************\n\/\/ * Allocates device memory\n\/\/ *****************************************************************************\nvoid* cuMemAlloc(void **d_ptr, size_t bytes);\n\n\/\/ *****************************************************************************\n\/\/ * Frees device memory\n\/\/ *****************************************************************************\nvoid* cuMemFree(void *d_ptr);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Host to Device\n\/\/ *****************************************************************************\nvoid* cuMemcpyHtoD(void *d_dst, const void *h_src, size_t bytes);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Host to Device\n\/\/ *****************************************************************************\nvoid* cuMemcpyHtoDAsync(void *d_dst, const void *h_src,\n                        size_t bytes, void *stream);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Device to Device\n\/\/ *****************************************************************************\nvoid* cuMemcpyDtoD(void *d_dst, void *d_src, size_t bytes);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Device to Device\n\/\/ *****************************************************************************\nvoid* cuMemcpyDtoDAsync(void *d_dst, void *d_src, size_t bytes, void *stream);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Device to Host\n\/\/ *****************************************************************************\nvoid* cuMemcpyDtoH(void *h_dst, void *d_src, size_t bytes);\n\n\/\/ *****************************************************************************\n\/\/ * Copies memory from Device to Host\n\/\/ *****************************************************************************\nvoid* cuMemcpyDtoHAsync(void *h_dst, void *d_src, size_t bytes, void *stream);\n\n} \/\/ namespace mfem\n\n#endif \/\/ MFEM_CUDA_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n   Copyright (C) 2015 Preet Desai (preet.desai@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#include <algorithm>\n\n#include <glm\/gtx\/string_cast.hpp>\n\n#include <ks\/gl\/KsGLCommands.hpp>\n#include <raintk\/RainTkLog.hpp>\n#include <raintk\/RainTkMainDrawStage.hpp>\n\n\nnamespace raintk\n{\n    void MainDrawStage::SyncView(glm::vec4 const &viewport,\n                                 ks::gl::Camera<float> const &camera)\n    {\n        m_viewport = viewport;\n        m_camera = camera;\n    }\n\n    void MainDrawStage::SyncClipRegions(std::vector<BoundingBox> const &list_clip_regions)\n    {\n        m_list_clip_regions = list_clip_regions;\n    }\n\n    void MainDrawStage::SyncDrawOrder(std::vector<Id> const &list_opq_draw_order,\n                                      std::vector<Id> const &list_xpr_draw_order)\n    {\n        m_list_opq_draw_order = list_opq_draw_order;\n        m_list_xpr_draw_order = list_xpr_draw_order;\n    }\n\n    void MainDrawStage::Render(ks::draw::DrawParams<DrawKey> &p)\n    {\n        auto const &camera = m_camera;\n        auto const &viewport = m_viewport;\n\n        \/\/ reset stats\n        this->m_stats.reset();\n\n        \/\/ get params\n        auto& list_draw_calls = p.list_draw_calls;\n\n        \/\/ Setup viewport (all values in pixels)\n        \/\/ z == width, w == height\n        ks::gl::Viewport(viewport.x,viewport.y,viewport.z,viewport.w);\n\n        \/\/ Enable scissor test to allow for clipping\n        p.state_set->SetScissorTest(GL_TRUE);\n\n        \/\/ Enable depth writes to clear the buffer\n        p.state_set->SetDepthMask(GL_TRUE);\n        p.state_set->SetClearColor(0.15,0.15,0.15,1.0);\n\n        \/\/ Set the scissor extents to the viewport so that\n        \/\/ everything cleared\n        ks::gl::Scissor(viewport.x,viewport.y,viewport.z,viewport.w);\n\n        ks::gl::Clear(ks::gl::ColorBufferBit |\n                      ks::gl::DepthBufferBit |\n                      ks::gl::StencilBufferBit);\n\n        DrawKey prev_key; \/\/ key value should be 0\n\n        \/\/ Opaque draw calls\n        for(auto const dc_id : m_list_opq_draw_order)\n        {\n            auto& draw_call = list_draw_calls[dc_id];\n            setupState(viewport,camera,p,prev_key,draw_call.key);\n\n            ks::gl::ShaderProgram* shader =\n                    p.list_shaders[draw_call.key.GetShader()].get();\n\n            \/\/ Set the individual uniforms\n            if(draw_call.list_uniforms)\n            {\n                auto &list_uniforms = *(draw_call.list_uniforms);\n                for(auto &uniform : list_uniforms) {\n                    uniform->GLSetUniform(shader);\n                }\n            }\n\n            \/\/ Draw!\n            issueDrawCall(shader,draw_call);\n        }\n\n        \/\/ Transparent draw calls\n        for(auto const dc_id : m_list_xpr_draw_order)\n        {\n            auto& draw_call = list_draw_calls[dc_id];\n            setupState(viewport,camera,p,prev_key,draw_call.key);\n\n            ks::gl::ShaderProgram* shader =\n                    p.list_shaders[draw_call.key.GetShader()].get();\n\n            \/\/ Set the individual uniforms\n            if(draw_call.list_uniforms)\n            {\n                auto &list_uniforms = *(draw_call.list_uniforms);\n                for(auto &uniform : list_uniforms) {\n                    uniform->GLSetUniform(shader);\n                }\n            }\n\n            \/\/ Draw!\n            issueDrawCall(shader,draw_call);\n        }\n\n        \/\/ Disable scissor test to reset to\n        \/\/ defaults for other draw stages\n        p.state_set->SetScissorTest(GL_FALSE);\n    }\n\n    void MainDrawStage::Reset()\n    {\n        \/\/ TODO\n    }\n\n    void MainDrawStage::setupState(glm::vec4 const &viewport,\n                                   ks::gl::Camera<float> const &camera,\n                                   ks::draw::DrawParams<DrawKey>& p,\n                                   DrawKey& prev_key,\n                                   DrawKey const curr_key)\n    {\n        if(!(prev_key == curr_key))\n        {\n            auto const clip_id = curr_key.GetClip();\n            auto const shader_id = curr_key.GetShader();\n            auto const depth_config_id = curr_key.GetDepthConfig();\n            auto const blend_config_id = curr_key.GetBlendConfig();\n            auto const stencil_config_id = curr_key.GetStencilConfig();\n            auto const texture_set_id = curr_key.GetTextureSet();\n            auto const uniform_set_id = curr_key.GetUniformSet();\n\n            if(prev_key.GetClip() != curr_key.GetClip())\n            {\n                glm::mat4 const m4_pv =\n                        camera.GetProjMatrix()*\n                        camera.GetViewMatrix();\n\n                \/\/ Clip structure:\n                \/\/ NOTE: The 'z' and 'w' are NOT width and height\n                \/\/ glm vec4 [x,y,z,w]: [x0,y0,x1,y1]\n                auto const &clip_bbox = m_list_clip_regions[clip_id];\n                glm::vec4 const clip(\n                            clip_bbox.x0,\n                            clip_bbox.y0,\n                            clip_bbox.x1,\n                            clip_bbox.y1);\n\n                auto const ndc_clip_bl = m4_pv*glm::vec4(clip.x,clip.w,0,1);\n                auto const ndc_clip_tr = m4_pv*glm::vec4(clip.z,clip.y,0,1);\n\n                float clip_x = 0.5*(ndc_clip_bl.x+1.0)*viewport.z;\n                float clip_y = 0.5*(ndc_clip_bl.y+1.0)*viewport.w;\n                float clip_w = (0.5*(ndc_clip_tr.x+1.0))*viewport.z - clip_x;\n                float clip_h = (0.5*(ndc_clip_tr.y+1.0))*viewport.w - clip_y;\n\n                \/\/ TODO clip should consider viewport x,y; currently we\n                \/\/ only consider the width and height of the viewport\n                ks::gl::Scissor(clip_x,clip_y,clip_w,clip_h);\n            }\n\n            if(prev_key.GetShader() != curr_key.GetShader())\n            {\n                auto& shader = p.list_shaders[shader_id];\n\n                glm::mat4 const u_m4_pv =\n                        camera.GetProjMatrix()*\n                        camera.GetViewMatrix();\n\n                shader->GLEnable(p.state_set);\n                shader->GLSetUniform(\"u_m4_pv\",u_m4_pv);\n                this->m_stats.shader_switches++;\n            }\n\n            if((prev_key.GetDepthConfig() != depth_config_id) && (depth_config_id > 0))\n            {\n                p.list_depth_configs[depth_config_id](p.state_set);\n                this->m_stats.raster_ops++;\n            }\n\n            if((prev_key.GetBlendConfig() != blend_config_id) && (blend_config_id > 0))\n            {\n                p.list_blend_configs[blend_config_id](p.state_set);\n                this->m_stats.raster_ops++;\n            }\n\n            if((prev_key.GetStencilConfig() != stencil_config_id) && (stencil_config_id > 0))\n            {\n                p.list_stencil_configs[stencil_config_id](p.state_set);\n                this->m_stats.raster_ops++;\n            }\n\n            if(prev_key.GetTextureSet() != texture_set_id)\n            {\n                auto& texture_set = p.list_texture_sets[texture_set_id];\n\n                for(auto& desc : texture_set->list_texture_desc)\n                {\n                    auto& texture = desc.first;\n                    auto tex_unit = desc.second;\n\n                    texture->GLBind(p.state_set,tex_unit);\n                    this->m_stats.texture_switches++;\n                }\n            }\n\n            if(prev_key.GetUniformSet() != uniform_set_id)\n            {\n                auto& uniform_set = p.list_uniform_sets[uniform_set_id];\n                auto& shader = p.list_shaders[shader_id];\n\n                for(auto& uniform : uniform_set->list_uniforms)\n                {\n                    uniform->GLSetUniform(shader.get());\n                }\n            }\n\n            prev_key = curr_key;\n        }\n    }\n\n    void MainDrawStage::issueDrawCall(ks::gl::ShaderProgram* shader,\n                                      DrawCall &draw_call)\n    {\n        \/\/ Draw\n        \/\/ TODO: Since we are drawing all buffers in\n        \/\/ a tight loop, we might be able to check\n        \/\/ when we really need to bind\/unbind buffers\n        \/\/ to avoid redundant calls\n\n        auto primitive = draw_call.key.GetPrimitive();\n\n        if(draw_call.draw_ix.buffer) {\n            \/\/ bind vertex buffers\n            bool ok = true;\n            for(auto& range : draw_call.list_draw_vx) {\n                ok = ok && range.buffer->GLBindVxBuff(\n                            shader,range.start_byte);\n            }\n\n            \/\/ bind index buffer\n            ok = ok && draw_call.draw_ix.buffer->GLBind();\n\n            assert(ok);\n\n            ks::gl::DrawElements(\n                        primitive,\n                        draw_call.draw_ix.start_byte,\n                        draw_call.draw_ix.size_bytes);\n\n            for(auto& range : draw_call.list_draw_vx) {\n                range.buffer->GLUnbind();\n            }\n            draw_call.draw_ix.buffer->GLUnbind();\n        }\n        else {\n            \/\/ bind vertex buffers\n            bool ok = true;\n            for(auto& range : draw_call.list_draw_vx) {\n                ok = ok && range.buffer->GLBindVxBuff(\n                            shader,range.start_byte);\n            }\n\n            auto& first_range = draw_call.list_draw_vx[0];\n\n            ks::gl::DrawArrays(\n                        primitive,\n                        first_range.buffer->GetVertexSizeBytes(),\n                        0,first_range.size_bytes);\n\n            for(auto& range : draw_call.list_draw_vx) {\n                range.buffer->GLUnbind();\n            }\n        }\n\n        this->m_stats.draw_calls++;\n    }\n}\n<commit_msg>Adjusted clipping with glScissor to reflect pixel rasterization to try and avoid off-by-one pixel clips<commit_after>\/*\n   Copyright (C) 2015 Preet Desai (preet.desai@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#include <algorithm>\n\n#include <glm\/gtx\/string_cast.hpp>\n\n#include <ks\/gl\/KsGLCommands.hpp>\n#include <raintk\/RainTkLog.hpp>\n#include <raintk\/RainTkMainDrawStage.hpp>\n\n\nnamespace raintk\n{\n    void MainDrawStage::SyncView(glm::vec4 const &viewport,\n                                 ks::gl::Camera<float> const &camera)\n    {\n        m_viewport = viewport;\n        m_camera = camera;\n    }\n\n    void MainDrawStage::SyncClipRegions(std::vector<BoundingBox> const &list_clip_regions)\n    {\n        m_list_clip_regions = list_clip_regions;\n    }\n\n    void MainDrawStage::SyncDrawOrder(std::vector<Id> const &list_opq_draw_order,\n                                      std::vector<Id> const &list_xpr_draw_order)\n    {\n        m_list_opq_draw_order = list_opq_draw_order;\n        m_list_xpr_draw_order = list_xpr_draw_order;\n    }\n\n    void MainDrawStage::Render(ks::draw::DrawParams<DrawKey> &p)\n    {\n        auto const &camera = m_camera;\n        auto const &viewport = m_viewport;\n\n        \/\/ reset stats\n        this->m_stats.reset();\n\n        \/\/ get params\n        auto& list_draw_calls = p.list_draw_calls;\n\n        \/\/ Setup viewport (all values in pixels)\n        \/\/ z == width, w == height\n        ks::gl::Viewport(viewport.x,viewport.y,viewport.z,viewport.w);\n\n        \/\/ Enable scissor test to allow for clipping\n        p.state_set->SetScissorTest(GL_TRUE);\n\n        \/\/ Enable depth writes to clear the buffer\n        p.state_set->SetDepthMask(GL_TRUE);\n        p.state_set->SetClearColor(0.15,0.15,0.15,1.0);\n\n        \/\/ Set the scissor extents to the viewport so that\n        \/\/ everything cleared\n        ks::gl::Scissor(viewport.x,viewport.y,viewport.z,viewport.w);\n\n        ks::gl::Clear(ks::gl::ColorBufferBit |\n                      ks::gl::DepthBufferBit |\n                      ks::gl::StencilBufferBit);\n\n        DrawKey prev_key; \/\/ key value should be 0\n\n        \/\/ Opaque draw calls\n        for(auto const dc_id : m_list_opq_draw_order)\n        {\n            auto& draw_call = list_draw_calls[dc_id];\n            setupState(viewport,camera,p,prev_key,draw_call.key);\n\n            ks::gl::ShaderProgram* shader =\n                    p.list_shaders[draw_call.key.GetShader()].get();\n\n            \/\/ Set the individual uniforms\n            if(draw_call.list_uniforms)\n            {\n                auto &list_uniforms = *(draw_call.list_uniforms);\n                for(auto &uniform : list_uniforms) {\n                    uniform->GLSetUniform(shader);\n                }\n            }\n\n            \/\/ Draw!\n            issueDrawCall(shader,draw_call);\n        }\n\n        \/\/ Transparent draw calls\n        for(auto const dc_id : m_list_xpr_draw_order)\n        {\n            auto& draw_call = list_draw_calls[dc_id];\n            setupState(viewport,camera,p,prev_key,draw_call.key);\n\n            ks::gl::ShaderProgram* shader =\n                    p.list_shaders[draw_call.key.GetShader()].get();\n\n            \/\/ Set the individual uniforms\n            if(draw_call.list_uniforms)\n            {\n                auto &list_uniforms = *(draw_call.list_uniforms);\n                for(auto &uniform : list_uniforms) {\n                    uniform->GLSetUniform(shader);\n                }\n            }\n\n            \/\/ Draw!\n            issueDrawCall(shader,draw_call);\n        }\n\n        \/\/ Disable scissor test to reset to\n        \/\/ defaults for other draw stages\n        p.state_set->SetScissorTest(GL_FALSE);\n    }\n\n    void MainDrawStage::Reset()\n    {\n        \/\/ TODO\n    }\n\n    namespace\n    {\n        float GetFraction(float f)\n        {\n            return (f - sint(f));\n        }\n    }\n\n    void MainDrawStage::setupState(glm::vec4 const &viewport,\n                                   ks::gl::Camera<float> const &camera,\n                                   ks::draw::DrawParams<DrawKey>& p,\n                                   DrawKey& prev_key,\n                                   DrawKey const curr_key)\n    {\n        if(!(prev_key == curr_key))\n        {\n            auto const clip_id = curr_key.GetClip();\n            auto const shader_id = curr_key.GetShader();\n            auto const depth_config_id = curr_key.GetDepthConfig();\n            auto const blend_config_id = curr_key.GetBlendConfig();\n            auto const stencil_config_id = curr_key.GetStencilConfig();\n            auto const texture_set_id = curr_key.GetTextureSet();\n            auto const uniform_set_id = curr_key.GetUniformSet();\n\n            if(prev_key.GetClip() != curr_key.GetClip())\n            {\n                glm::mat4 const m4_pv =\n                        camera.GetProjMatrix()*\n                        camera.GetViewMatrix();\n\n                \/\/ Clip structure:\n                \/\/ NOTE: The 'z' and 'w' are NOT width and height\n                \/\/ glm vec4 [x,y,z,w]: [x0,y0,x1,y1]\n                auto const &clip_bbox = m_list_clip_regions[clip_id];\n                glm::vec4 const clip(\n                            clip_bbox.x0,\n                            clip_bbox.y0,\n                            clip_bbox.x1,\n                            clip_bbox.y1);\n\n                auto const ndc_clip_bl = m4_pv*glm::vec4(clip.x,clip.w,0,1);\n                auto const ndc_clip_tr = m4_pv*glm::vec4(clip.z,clip.y,0,1);\n\n                float clip_x0 = 0.5*(ndc_clip_bl.x+1.0)*viewport.z;\n                float clip_y0 = 0.5*(ndc_clip_bl.y+1.0)*viewport.w;\n                float clip_x1 = (0.5*(ndc_clip_tr.x+1.0))*viewport.z;\n                float clip_y1 = (0.5*(ndc_clip_tr.y+1.0))*viewport.w;\n\n                \/\/ clip_x,y,w,h are now in window coordinates with (0,0)\n                \/\/ representing the bottom left of the window\n\n                \/\/ A pixel is considered inside the clip rectangle if:\n                \/\/ * It contains the pixel center (0.5,0.5)\n                \/\/ * The left edge is on the pixel center\n                \/\/ * The top edge is on the pixel center\n                \/\/ ref: https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/cc627092(v=vs.85).aspx\n\n                \/\/ We need to compensate for the above cases because the\n                \/\/ coordinates will be truncated when they are converted\n                \/\/ to integers for the glScissor call\n\n                sint clip_x0_px = clip_x0+0.5f;\n                sint clip_y0_px = clip_y0;\n                sint clip_x1_px = clip_x1;\n                sint clip_y1_px = clip_y1+0.5f;\n\n                \/\/ bottom\n                if(GetFraction(clip_y0) >= 0.5f)\n                {\n                    clip_y0_px++;\n                }\n\n                \/\/ right\n                if(GetFraction(clip_x1) > 0.5f)\n                {\n                    clip_x1_px++;\n                }\n\n                \/\/ TODO clip should consider viewport x,y; currently we\n                \/\/ only consider the width and height of the viewport\n                ks::gl::Scissor(\n                            clip_x0_px,\n                            clip_y0_px,\n                            clip_x1_px-clip_x0_px,\n                            clip_y1_px-clip_y0_px);\n            }\n\n            if(prev_key.GetShader() != curr_key.GetShader())\n            {\n                auto& shader = p.list_shaders[shader_id];\n\n                glm::mat4 const u_m4_pv =\n                        camera.GetProjMatrix()*\n                        camera.GetViewMatrix();\n\n                shader->GLEnable(p.state_set);\n                shader->GLSetUniform(\"u_m4_pv\",u_m4_pv);\n                this->m_stats.shader_switches++;\n            }\n\n            if((prev_key.GetDepthConfig() != depth_config_id) && (depth_config_id > 0))\n            {\n                p.list_depth_configs[depth_config_id](p.state_set);\n                this->m_stats.raster_ops++;\n            }\n\n            if((prev_key.GetBlendConfig() != blend_config_id) && (blend_config_id > 0))\n            {\n                p.list_blend_configs[blend_config_id](p.state_set);\n                this->m_stats.raster_ops++;\n            }\n\n            if((prev_key.GetStencilConfig() != stencil_config_id) && (stencil_config_id > 0))\n            {\n                p.list_stencil_configs[stencil_config_id](p.state_set);\n                this->m_stats.raster_ops++;\n            }\n\n            if(prev_key.GetTextureSet() != texture_set_id)\n            {\n                auto& texture_set = p.list_texture_sets[texture_set_id];\n\n                for(auto& desc : texture_set->list_texture_desc)\n                {\n                    auto& texture = desc.first;\n                    auto tex_unit = desc.second;\n\n                    texture->GLBind(p.state_set,tex_unit);\n                    this->m_stats.texture_switches++;\n                }\n            }\n\n            if(prev_key.GetUniformSet() != uniform_set_id)\n            {\n                auto& uniform_set = p.list_uniform_sets[uniform_set_id];\n                auto& shader = p.list_shaders[shader_id];\n\n                for(auto& uniform : uniform_set->list_uniforms)\n                {\n                    uniform->GLSetUniform(shader.get());\n                }\n            }\n\n            prev_key = curr_key;\n        }\n    }\n\n    void MainDrawStage::issueDrawCall(ks::gl::ShaderProgram* shader,\n                                      DrawCall &draw_call)\n    {\n        \/\/ Draw\n        \/\/ TODO: Since we are drawing all buffers in\n        \/\/ a tight loop, we might be able to check\n        \/\/ when we really need to bind\/unbind buffers\n        \/\/ to avoid redundant calls\n\n        auto primitive = draw_call.key.GetPrimitive();\n\n        if(draw_call.draw_ix.buffer) {\n            \/\/ bind vertex buffers\n            bool ok = true;\n            for(auto& range : draw_call.list_draw_vx) {\n                ok = ok && range.buffer->GLBindVxBuff(\n                            shader,range.start_byte);\n            }\n\n            \/\/ bind index buffer\n            ok = ok && draw_call.draw_ix.buffer->GLBind();\n\n            assert(ok);\n\n            ks::gl::DrawElements(\n                        primitive,\n                        draw_call.draw_ix.start_byte,\n                        draw_call.draw_ix.size_bytes);\n\n            for(auto& range : draw_call.list_draw_vx) {\n                range.buffer->GLUnbind();\n            }\n            draw_call.draw_ix.buffer->GLUnbind();\n        }\n        else {\n            \/\/ bind vertex buffers\n            bool ok = true;\n            for(auto& range : draw_call.list_draw_vx) {\n                ok = ok && range.buffer->GLBindVxBuff(\n                            shader,range.start_byte);\n            }\n\n            auto& first_range = draw_call.list_draw_vx[0];\n\n            ks::gl::DrawArrays(\n                        primitive,\n                        first_range.buffer->GetVertexSizeBytes(),\n                        0,first_range.size_bytes);\n\n            for(auto& range : draw_call.list_draw_vx) {\n                range.buffer->GLUnbind();\n            }\n        }\n\n        this->m_stats.draw_calls++;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"chunk_headers.hpp\"\n#include \"magic_number.hpp\"\n#include \"msh_builder.hpp\"\n#include \"type_pun.hpp\"\n#include \"ucfb_reader.hpp\"\n\nnamespace {\n\n#pragma pack(push, 1)\n\nstruct Mask {\n   Magic_number mn;\n   std::uint32_t size;\n\n   msh::Collision_flags flags;\n};\n\nstatic_assert(std::is_standard_layout_v<Mask>);\nstatic_assert(sizeof(Mask) == 12);\n\nstruct Parent {\n   Magic_number mn;\n   std::uint32_t size;\n\n   char str[];\n};\n\nstatic_assert(std::is_standard_layout_v<Parent>);\nstatic_assert(sizeof(Parent) == 8);\n\nstruct Xframe {\n   Magic_number mn;\n   std::uint32_t size;\n\n   glm::mat3 rotation;\n   glm::vec3 position;\n};\n\nstatic_assert(std::is_standard_layout_v<Xframe>);\nstatic_assert(sizeof(Xframe) == 56);\n\nstruct Data {\n   Magic_number mn;\n   std::uint32_t size;\n   msh::Primitive_type type;\n   glm::vec3 prim_size;\n};\n\nstatic_assert(std::is_standard_layout_v<Data>);\nstatic_assert(sizeof(Data) == 24);\n\n#pragma pack(pop)\n\ntemplate<typename Type>\nconst Type& find_chunk(std::uint32_t& head, const std::uint32_t end, const Byte* bytes,\n                       Magic_number mn)\n{\n   while (head < end) {\n      const auto& chunk = view_type_as<chunks::Unknown>(bytes[head]);\n\n      head += chunk.size + 8;\n      if (head % 4 != 0) head += (4 - (head % 4));\n\n      if (chunk.mn == mn) return view_type_as<Type>(chunk);\n   }\n\n   throw std::runtime_error{\"badly formed collision primitive\"};\n}\n\ntemplate<typename Type>\nconst Type* find_optional_chunk(std::uint32_t& head, const std::uint32_t end,\n                                const Byte* bytes, Magic_number mn,\n                                Magic_number end_at_mn)\n{\n   std::uint32_t local_head = head;\n\n   while (local_head < end) {\n      const auto& chunk = view_type_as<chunks::Unknown>(bytes[head]);\n\n      local_head += chunk.size + 8;\n      if (local_head % 4 != 0) local_head += (4 - (local_head % 4));\n\n      if (chunk.mn == end_at_mn) return nullptr;\n      if (chunk.mn == mn) {\n         head = local_head;\n\n         return &view_type_as<Type>(chunk);\n      }\n   }\n\n   return nullptr;\n}\n\nauto read_primitive(std::uint32_t& head, const std::uint32_t end,\n                    const chunks::Primitives& prim) -> msh::Collision_primitive\n{\n   msh::Collision_primitive msh_prim;\n\n   find_chunk<chunks::Unknown>(head, end, &prim.bytes[0], \"NAME\"_mn);\n\n   const auto* mask =\n      find_optional_chunk<Mask>(head, end, &prim.bytes[0], \"MASK\"_mn, \"NAME\"_mn);\n\n   if (mask) msh_prim.flags = mask->flags;\n\n   const auto& parent = find_chunk<Parent>(head, end, &prim.bytes[0], \"PRNT\"_mn);\n   msh_prim.parent = std::string{&parent.str[0], parent.size - 1};\n\n   const auto& xframe = find_chunk<Xframe>(head, end, &prim.bytes[0], \"XFRM\"_mn);\n\n   msh_prim.rotation = glm::quat_cast(xframe.rotation);\n   msh_prim.position = xframe.position;\n\n   const auto& data = find_chunk<Data>(head, end, &prim.bytes[0], \"DATA\"_mn);\n\n   msh_prim.type = data.type;\n   msh_prim.size = data.prim_size;\n\n   return msh_prim;\n}\n}\n\nvoid handle_primitives(Ucfb_reader primitives, msh::Builders_map& builders)\n{\n   const auto& prim = primitives.view_as_chunk<chunks::Primitives>();\n\n   std::string name{reinterpret_cast<const char*>(&prim.bytes[0]), prim.info_size - 5};\n\n   std::uint32_t head = prim.info_size;\n   const std::uint32_t end = prim.size - 8;\n\n   if (head % 4 != 0) head += (4 - (head % 4));\n\n   auto& builder = builders[name];\n\n   while (head < end) {\n      builder.add_collision_primitive(read_primitive(head, end, prim));\n   }\n}<commit_msg>Shifted handle_primitives over to Ucfb_readers<commit_after>\n#include \"chunk_headers.hpp\"\n#include \"glm_pod_wrappers.hpp\"\n#include \"magic_number.hpp\"\n#include \"msh_builder.hpp\"\n#include \"type_pun.hpp\"\n#include \"ucfb_reader.hpp\"\n\n#include \"glm\/gtc\/quaternion.hpp\"\n\nnamespace {\n\nstruct Xframe {\n   pod::Mat3 rotation;\n   pod::Vec3 position;\n};\n\nstatic_assert(std::is_pod_v<Xframe>);\nstatic_assert(sizeof(Xframe) == 48);\n\nstruct Primitive_Data {\n   msh::Primitive_type type;\n   pod::Vec3 size;\n};\n\nstatic_assert(std::is_pod_v<Primitive_Data>);\nstatic_assert(sizeof(Primitive_Data) == 16);\n\nauto read_primitive(Ucfb_reader& primitives) -> msh::Collision_primitive\n{\n   msh::Collision_primitive msh_prim;\n\n   primitives.read_child_strict<\"NAME\"_mn>();\n\n   auto mask = primitives.read_child_strict_optional<\"MASK\"_mn>();\n\n   if (mask) msh_prim.flags = mask->read_trivial<msh::Collision_flags>();\n\n   msh_prim.parent = primitives.read_child_strict<\"PRNT\"_mn>().read_string();\n\n   const auto xframe = primitives.read_child_strict<\"XFRM\"_mn>().read_trivial<Xframe>();\n\n   msh_prim.rotation = glm::quat_cast(glm::mat3{xframe.rotation});\n   msh_prim.position = xframe.position;\n\n   const auto data =\n      primitives.read_child_strict<\"DATA\"_mn>().read_trivial<Primitive_Data>();\n\n   msh_prim.type = data.type;\n   msh_prim.size = data.size;\n\n   return msh_prim;\n}\n}\n\nvoid handle_primitives(Ucfb_reader primitives, msh::Builders_map& builders)\n{\n   auto info = primitives.read_child_strict<\"INFO\"_mn>();\n\n   std::string name{info.read_string_unaligned()};\n   const auto primitive_count = info.read_trivial<std::int32_t>();\n\n   auto& builder = builders[name];\n\n   for (auto i = 0; i < primitive_count; ++i) {\n      builder.add_collision_primitive(read_primitive(primitives));\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 <stdexcept>\n\n#include <nix\/hdf5\/DataTypeHDF5.hpp>\n\n#include <iostream>\n#include <cassert>\n\nnamespace nix {\nnamespace hdf5 {\n\n\nH5::DataType data_type_to_h5_filetype(DataType dtype) {\n\n    switch (dtype) {\n\n        case DataType::Bool:   return H5::PredType::STD_B8LE;\n        case DataType::Int8:   return H5::PredType::STD_I8LE;\n        case DataType::Int16:  return H5::PredType::STD_I16LE;\n        case DataType::Int32:  return H5::PredType::STD_I32LE;\n        case DataType::Int64:  return H5::PredType::STD_I64LE;\n        case DataType::UInt8:  return H5::PredType::STD_U8LE;\n        case DataType::UInt16: return H5::PredType::STD_U16LE;\n        case DataType::UInt32: return H5::PredType::STD_U32LE;\n        case DataType::UInt64: return H5::PredType::STD_U64LE;\n        case DataType::Float:  return H5::PredType::IEEE_F32LE;\n        case DataType::Double: return H5::PredType::IEEE_F64LE;\n        case DataType::String: return H5::StrType(H5::PredType::C_S1, H5T_VARIABLE);\n\n        default:\n            throw std::invalid_argument(\"Unkown DataType\"); \/\/FIXME\n    }\n\n    return H5::DataType();\n}\n\n\ntemplate<size_t>\nH5::DataType bool_to_predtype(void) { throw std::invalid_argument(\"sizeof(bool) > 8 not supported.\"); };\n\ntemplate<> H5::DataType bool_to_predtype<1>() { return H5::PredType::NATIVE_B8;  }\ntemplate<> H5::DataType bool_to_predtype<2>() { return H5::PredType::NATIVE_B16; }\ntemplate<> H5::DataType bool_to_predtype<4>() { return H5::PredType::NATIVE_B32; }\ntemplate<> H5::DataType bool_to_predtype<8>() { return H5::PredType::NATIVE_B64; }\n\n\nH5::DataType data_type_to_h5_memtype(DataType dtype) {\n\n\n    switch(dtype) {\n        case DataType::Bool:   return bool_to_predtype<sizeof(bool)>();\n        case DataType::Int8:   return H5::PredType::NATIVE_INT8;\n        case DataType::Int16:  return H5::PredType::NATIVE_INT16;\n        case DataType::Int32:  return H5::PredType::NATIVE_INT32;\n        case DataType::Int64:  return H5::PredType::NATIVE_INT64;\n        case DataType::UInt8:  return H5::PredType::NATIVE_UINT8;\n        case DataType::UInt16: return H5::PredType::NATIVE_UINT16;\n        case DataType::UInt32: return H5::PredType::NATIVE_UINT32;\n        case DataType::UInt64: return H5::PredType::NATIVE_UINT64;\n        case DataType::Float:  return H5::PredType::NATIVE_FLOAT;\n        case DataType::Double: return H5::PredType::NATIVE_DOUBLE;\n        case DataType::String: return H5::StrType(H5::PredType::C_S1, H5T_VARIABLE);\n\n        default:\n            throw std::invalid_argument(\"DataType not handled!\"); \/\/FIXME\n    }\n\n    return H5::DataType();\n}\n\n#define NOT_IMPLEMENTED false\n\nDataType\ndata_type_from_h5(H5T_class_t vclass, size_t vsize, H5T_sign_t vsign)\n{\n    if (vclass == H5T_INTEGER) {\n        switch (vsize) {\n        case 1: return vsign == H5T_SGN_2 ? DataType::Int8  : DataType::UInt8;\n        case 2: return vsign == H5T_SGN_2 ? DataType::Int16 : DataType::UInt16;\n        case 4: return vsign == H5T_SGN_2 ? DataType::Int32 : DataType::UInt32;\n        case 8: return vsign == H5T_SGN_2 ? DataType::Int64 : DataType::UInt64;\n        }\n    } else if (vclass == H5T_FLOAT) {\n        return vsize == 8 ? DataType::Double : DataType::Float;\n    } else if (vclass == H5T_STRING) {\n        return DataType::String;\n    } else if (vclass == H5T_BITFIELD) {\n        switch (vsize) {\n        case 1: return DataType::Bool;\n        }\n    }\n\n    std::cerr << \"FIXME: Not implemented \" << vclass << \" \" << vsize << \" \" << vsign << \" \" << std::endl;\n    assert(NOT_IMPLEMENTED);\n    return DataType::Nothing;\n}\n\n} \/\/ namespace hdf4\n} \/\/ namespace nix\n<commit_msg>data_type_to_h5_*type: explicitly handle all types in switch<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 <stdexcept>\n\n#include <nix\/hdf5\/DataTypeHDF5.hpp>\n\n#include <iostream>\n#include <cassert>\n\nnamespace nix {\nnamespace hdf5 {\n\n\nH5::DataType data_type_to_h5_filetype(DataType dtype) {\n\n   \/* The switch is structred in a way in order to get\n      warnings from the compiler when not all cases are\n      handled and throw an exception if one of the not\n      handled cases actually appears (i.e., we have no\n      default case, because that silences the compiler.)\n   *\/\n\n    switch (dtype) {\n\n        case DataType::Bool:   return H5::PredType::STD_B8LE;\n        case DataType::Int8:   return H5::PredType::STD_I8LE;\n        case DataType::Int16:  return H5::PredType::STD_I16LE;\n        case DataType::Int32:  return H5::PredType::STD_I32LE;\n        case DataType::Int64:  return H5::PredType::STD_I64LE;\n        case DataType::UInt8:  return H5::PredType::STD_U8LE;\n        case DataType::UInt16: return H5::PredType::STD_U16LE;\n        case DataType::UInt32: return H5::PredType::STD_U32LE;\n        case DataType::UInt64: return H5::PredType::STD_U64LE;\n        case DataType::Float:  return H5::PredType::IEEE_F32LE;\n        case DataType::Double: return H5::PredType::IEEE_F64LE;\n        case DataType::String: return H5::StrType(H5::PredType::C_S1, H5T_VARIABLE);\n\n        case DataType::Char: break; \/\/FIXME\n        case DataType::Nothing: break;\n        case DataType::Date: break;\n        case DataType::DateTime: break;\n    }\n\n    throw std::invalid_argument(\"Unkown DataType\"); \/\/FIXME\n}\n\n\ntemplate<size_t>\nH5::DataType bool_to_predtype(void) { throw std::invalid_argument(\"sizeof(bool) > 8 not supported.\"); };\n\ntemplate<> H5::DataType bool_to_predtype<1>() { return H5::PredType::NATIVE_B8;  }\ntemplate<> H5::DataType bool_to_predtype<2>() { return H5::PredType::NATIVE_B16; }\ntemplate<> H5::DataType bool_to_predtype<4>() { return H5::PredType::NATIVE_B32; }\ntemplate<> H5::DataType bool_to_predtype<8>() { return H5::PredType::NATIVE_B64; }\n\n\nH5::DataType data_type_to_h5_memtype(DataType dtype) {\n\n    \/\/ See data_type_to_h5_filetype for the reason why the switch is structured\n    \/\/ in the way it is.\n\n    switch(dtype) {\n        \/\/special case the bool\n        \/\/we treat them as bit fields for now, since hdf5 has no bool support\n        \/\/as of 1.8.12\n        case DataType::Bool:   return bool_to_predtype<sizeof(bool)>();\n        case DataType::Int8:   return H5::PredType::NATIVE_INT8;\n        case DataType::Int16:  return H5::PredType::NATIVE_INT16;\n        case DataType::Int32:  return H5::PredType::NATIVE_INT32;\n        case DataType::Int64:  return H5::PredType::NATIVE_INT64;\n        case DataType::UInt8:  return H5::PredType::NATIVE_UINT8;\n        case DataType::UInt16: return H5::PredType::NATIVE_UINT16;\n        case DataType::UInt32: return H5::PredType::NATIVE_UINT32;\n        case DataType::UInt64: return H5::PredType::NATIVE_UINT64;\n        case DataType::Float:  return H5::PredType::NATIVE_FLOAT;\n        case DataType::Double: return H5::PredType::NATIVE_DOUBLE;\n        case DataType::String: return H5::StrType(H5::PredType::C_S1, H5T_VARIABLE);\n\n        case DataType::Char: break; \/\/FIXME\n        case DataType::Nothing: break;\n        case DataType::Date: break;\n        case DataType::DateTime: break;\n    }\n\n    throw std::invalid_argument(\"DataType not handled!\"); \/\/FIXME\n}\n\n#define NOT_IMPLEMENTED false\n\nDataType\ndata_type_from_h5(H5T_class_t vclass, size_t vsize, H5T_sign_t vsign)\n{\n    if (vclass == H5T_INTEGER) {\n        switch (vsize) {\n        case 1: return vsign == H5T_SGN_2 ? DataType::Int8  : DataType::UInt8;\n        case 2: return vsign == H5T_SGN_2 ? DataType::Int16 : DataType::UInt16;\n        case 4: return vsign == H5T_SGN_2 ? DataType::Int32 : DataType::UInt32;\n        case 8: return vsign == H5T_SGN_2 ? DataType::Int64 : DataType::UInt64;\n        }\n    } else if (vclass == H5T_FLOAT) {\n        return vsize == 8 ? DataType::Double : DataType::Float;\n    } else if (vclass == H5T_STRING) {\n        return DataType::String;\n    } else if (vclass == H5T_BITFIELD) {\n        switch (vsize) {\n        case 1: return DataType::Bool;\n        }\n    }\n\n    std::cerr << \"FIXME: Not implemented \" << vclass << \" \" << vsize << \" \" << vsign << \" \" << std::endl;\n    assert(NOT_IMPLEMENTED);\n    return DataType::Nothing;\n}\n\n} \/\/ namespace hdf4\n} \/\/ namespace nix\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <stdlib.h>\n\n\nusing namespace std;\n\nvoid options();\n\nint main()\n{\n    cout<<\"line has been cut\"<<endl;\n    options();\n    return(0);\n}\n\nvoid temp()\n    \n\n\nvoid otheroptions(){\n    int input;\n    {\n        cout << \"Please select an option:\" << endl\n        << \"1.love oskars \" << endl\n        << \"2.Go to neighbours \" << endl\n        << \"3.Hide \" << endl\n        << \"4.Shout for help \" << endl;\n        cin >> input;\n        \n       switch(input)\n       {\n           case 1:\n               cout<<\"love oskars\"<< endl;\n               break;\n               \n       }\n          \n    }\n}\n    \n\nvoid options()\n{\n    int input;\n    \n    \n    {\n        cout << \"Please select an option:\" << endl\n        << \"1.Search the house \" << endl\n        << \"2.Go to neighbours \" << endl\n        << \"3.Hide \" << endl;\n        cin >> input;\n        \n       switch(input)\n       {\n           case 0:\n               exit(0);\n           case 1:\n               cout << \"Search the house\" << endl;\n               otheroptions();\n               \n               break;\n           case 2:\n               cout << \"Go to neighbours\" << endl;\n               break;\n           case 3:\n               cout << \"Hide \" << endl;\n               \n               break;\n           case 4:\n               cout << \"Shout for help\" <<endl;\n               break;\n           default:\n               cout<<\"invalid option please choose between 1 and 4\"<< endl;\n         }\n    \n               \n       }\n}\n\n<commit_msg>call family updated-ak<commit_after>#include <iostream>\n#include <stdlib.h>\n\n\nusing namespace std;\n\nvoid options();\n\nint main()\n{\n    cout<<\"line has been cut\"<<endl;\n    options();\n    return(0);\n}\n\nvoid idiot()\n{\n    int input;\n    {\n        cout << \"You die, from a zombie attack bet you wished you had a weapon to defend yourself\" <<endl;\n        cout << \"GAME OVER\"<< endl;                         \n    }\n}\n\nvoid temp(){\n    int input;\n    {\n        cout << \"9mm Pistol has been added to you're inventory\" <<endl;\n        cout << \"Please select an option:\" << endl\n        << \"1. Go outside \" << endl\n        << \"2.Shout for help \" << endl;\n        cin >> input;\n        \n       switch(input)\n       {\n           case 1:\n               cout<<\"Go outside\"<< endl;\n               break;\n           case 2:\n               cout<<\"Shout for help\"<< endl;\n               break;\n               \n       }\n          \n    }\n}\n    \n\n\nvoid otheroptions()\n{\n    int input;\n    {\n        cout << \"You've found a pistol\" << endl;\n        cout << \"Please select an option:\" << endl;       \n        cout<< \"1.Pick up pistol\" << endl;\n        cout<< \"2.Leave Pistol \" << endl;\n        cin >> input;\n        \n       switch(input)\n       {\n           case 1:\n               cout<<\"Pick up pistol\"<< endl;\n               temp();\n               break;\n           case 2:\n               cout<<\"Leave pistol\"<< endl;\n               idiot();\n               break;\n               \n       }\n          \n    }\n}\n    \n\nvoid options()\n{\n    int input;\n    \n    \n    {\n        cout << \"Please select an option:\" << endl\n        << \"1.Search the house \" << endl\n        << \"2.Go to neighbours \" << endl\n        << \"3.Hide \" << endl;\n        cin >> input;\n        \n       switch(input)\n       {\n           case 0:\n               exit(0);\n           case 1:\n               cout << \"Search the house\" << endl;\n               otheroptions();\n               \n               break;\n           case 2:\n               cout << \"Go to neighbours\" << endl;\n               break;\n           case 3:\n               cout << \"Hide \" << endl;\n               cout << \"you die from starvation\" << endl;\n               cout << \"GAME OVER\" << endl;\n               break;\n           default:\n               cout<<\"invalid option please choose between 1 and 4\"<< endl;\n         }\n    \n               \n       }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <Windows.h>\n#include <base\/hook\/iat.h>\n#include <base\/hook\/eat.h>\n#include <base\/hook\/fp_call.h>\n#include <base\/win\/process.h>\n#include \"utility.h\"\n\n#pragma data_seg(\"Shared\")\nbool                         shared_enable = false;\nuint16_t                     shared_port   = 0;\nwchar_t                      shared_luadll_str[MAX_PATH] = {0};\nsize_t                       shared_luadll_len = 0;\n#pragma data_seg()\n#pragma comment(linker, \"\/section:Shared,rws\")\n\nstd::wstring_view shared_luadll(shared_luadll_str, shared_luadll_len);\n\nvoid initialize_debugger(void* L)\n{\n\tif (GetModuleHandleW(L\"debugger.dll\")) {\n\t\treturn;\n\t}\n\tfs::path debugger = get_self_path().remove_filename() \/ L\"debugger.dll\";\n\tHMODULE dll = LoadLibraryW(debugger.c_str());\n\tif (!dll) {\n\t\treturn;\n\t}\n\tuintptr_t set_luadll   = (uintptr_t)GetProcAddress(dll, \"set_luadll\");\n\tuintptr_t start_server = (uintptr_t)GetProcAddress(dll, \"start_server\");\n\tuintptr_t attach_lua   = (uintptr_t)GetProcAddress(dll, \"attach_lua\");\n\tif (!set_luadll || !start_server || !attach_lua) {\n\t\treturn;\n\t}\n\tif (shared_luadll.size() != 0) {\n\t\tbase::c_call<void>(set_luadll, shared_luadll.data(), shared_luadll.size());\n\t}\n\tshared_port = base::c_call<uint16_t>(start_server, \"127.0.0.1\", 0, true);\n\tbase::c_call<void>(attach_lua, L, true);\n}\n\nvoid uninitialize_debugger(void* L)\n{\n\tHMODULE dll = GetModuleHandleW(L\"debugger.dll\");\n\tif (!dll) {\n\t\treturn;\n\t}\n\tuintptr_t detach_lua = (uintptr_t)GetProcAddress(dll, \"detach_lua\");\n\tif (!detach_lua) {\n\t\treturn;\n\t}\n\tbase::c_call<void>(detach_lua, L);\n\tSleep(1000);\n}\n\nstruct lua_newstate\n\t: public hook_helper<lua_newstate>\n{\n\tstatic void* __cdecl fake(void* f, void* ud)\n\t{\n\t\tvoid* L = base::c_call<void*>(real, f, ud);\n\t\tif (L) initialize_debugger(L);\n\t\treturn L;\n\t}\n};\n\nstruct luaL_newstate\n\t: public hook_helper<lua_newstate>\n{\n\tstatic void* __cdecl fake()\n\t{\n\t\tvoid* L = base::c_call<void*>(real);\n\n\t\tif (L) initialize_debugger(L);\n\t\treturn L;\n\t}\n};\n\nstruct lua_close\n\t: public hook_helper<lua_close>\n{\n\tstatic void __cdecl fake(void* L)\n\t{\n\t\tuninitialize_debugger(L);\n\t\treturn base::c_call<void>(real, L);\n\t}\n};\n\nBOOL APIENTRY DllMain(HMODULE module, DWORD reason, LPVOID \/*pReserved*\/)\n{\n\tif (reason == DLL_PROCESS_ATTACH)\n\t{\n\t\t::DisableThreadLibraryCalls(module);\n\t\tif (shared_enable) {\n\t\t\tif (shared_luadll.size() != 0) {\n\t\t\t\tlua_newstate::init(shared_luadll.data(), \"lua_newstate\");\n\t\t\t\tluaL_newstate::init(shared_luadll.data(), \"luaL_newstate\");\n\t\t\t\tlua_close::init(shared_luadll.data(), \"lua_close\");\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst char* luadll = search_api(\"lua_newstate\", \"luaL_newstate\");\n\t\t\t\tif (luadll) {\n\t\t\t\t\tlua_newstate::init(luadll, \"lua_newstate\");\n\t\t\t\t\tluaL_newstate::init(luadll, \"luaL_newstate\");\n\t\t\t\t\tlua_close::init(luadll, \"lua_close\");\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tlua_newstate::init(L\"luacore.dll\", \"lua_newstate\");\n\t\t\t\t\tluaL_newstate::init(L\"luacore.dll\", \"luaL_newstate\");\n\t\t\t\t\tlua_close::init(L\"luacore.dll\", \"lua_close\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn TRUE;\n}\n\nextern \"C\" __declspec(dllexport) \nbool set_luadll(const wchar_t* str, size_t len)\n{\n\tif (len + 1 > _countof(shared_luadll_str)) { return false; }\n\tmemcpy(shared_luadll_str, str, len * sizeof(wchar_t));\n\tshared_luadll_str[len] = L'\\0';\n\tshared_luadll_len = len;\n\treturn true;\n}\n\nextern \"C\" __declspec(dllexport)\nuint16_t create_process_with_debugger(const wchar_t* application, const wchar_t* command_line, const wchar_t* current_directory)\n{\n\tshared_port = 0;\n\tshared_enable = true;\n\n\tbase::win::process p;\n\tp.inject(get_self_path());\n\tif (!p.create(application, command_line, current_directory)) {\n\t\treturn 0;\n\t}\n\tfor (int i = 0; i < 1000 || !p.is_running(); ++i)\n\t{\n\t\tif (shared_port != 0)\n\t\t\treturn shared_port;\n\t\tSleep(100);\n\t}\n\treturn 0;\n}\n<commit_msg>修正一个错误<commit_after>#include <Windows.h>\n#include <base\/hook\/iat.h>\n#include <base\/hook\/eat.h>\n#include <base\/hook\/fp_call.h>\n#include <base\/win\/process.h>\n#include \"utility.h\"\n\n#pragma data_seg(\"Shared\")\nbool                         shared_enable = false;\nuint16_t                     shared_port   = 0;\nwchar_t                      shared_luadll_str[MAX_PATH] = {0};\nsize_t                       shared_luadll_len = 0;\n#pragma data_seg()\n#pragma comment(linker, \"\/section:Shared,rws\")\n\nstd::wstring_view shared_luadll(shared_luadll_str, shared_luadll_len);\n\nvoid initialize_debugger(void* L)\n{\n\tif (GetModuleHandleW(L\"debugger.dll\")) {\n\t\treturn;\n\t}\n\tfs::path debugger = get_self_path().remove_filename() \/ L\"debugger.dll\";\n\tHMODULE dll = LoadLibraryW(debugger.c_str());\n\tif (!dll) {\n\t\treturn;\n\t}\n\tuintptr_t set_luadll   = (uintptr_t)GetProcAddress(dll, \"set_luadll\");\n\tuintptr_t start_server = (uintptr_t)GetProcAddress(dll, \"start_server\");\n\tuintptr_t attach_lua   = (uintptr_t)GetProcAddress(dll, \"attach_lua\");\n\tif (!set_luadll || !start_server || !attach_lua) {\n\t\treturn;\n\t}\n\tif (shared_luadll.size() != 0) {\n\t\tbase::c_call<void>(set_luadll, shared_luadll.data(), shared_luadll.size());\n\t}\n\tshared_port = base::c_call<uint16_t>(start_server, \"127.0.0.1\", 0, true);\n\tbase::c_call<void>(attach_lua, L, true);\n}\n\nvoid uninitialize_debugger(void* L)\n{\n\tHMODULE dll = GetModuleHandleW(L\"debugger.dll\");\n\tif (!dll) {\n\t\treturn;\n\t}\n\tuintptr_t detach_lua = (uintptr_t)GetProcAddress(dll, \"detach_lua\");\n\tif (!detach_lua) {\n\t\treturn;\n\t}\n\tbase::c_call<void>(detach_lua, L);\n\tSleep(1000);\n}\n\nstruct lua_newstate\n\t: public hook_helper<lua_newstate>\n{\n\tstatic void* __cdecl fake(void* f, void* ud)\n\t{\n\t\tvoid* L = base::c_call<void*>(real, f, ud);\n\t\tif (L) initialize_debugger(L);\n\t\treturn L;\n\t}\n};\n\nstruct luaL_newstate\n\t: public hook_helper<luaL_newstate>\n{\n\tstatic void* __cdecl fake()\n\t{\n\t\tvoid* L = base::c_call<void*>(real);\n\n\t\tif (L) initialize_debugger(L);\n\t\treturn L;\n\t}\n};\n\nstruct lua_close\n\t: public hook_helper<lua_close>\n{\n\tstatic void __cdecl fake(void* L)\n\t{\n\t\tuninitialize_debugger(L);\n\t\treturn base::c_call<void>(real, L);\n\t}\n};\n\nBOOL APIENTRY DllMain(HMODULE module, DWORD reason, LPVOID \/*pReserved*\/)\n{\n\tif (reason == DLL_PROCESS_ATTACH)\n\t{\n\t\t::DisableThreadLibraryCalls(module);\n\t\tif (shared_enable) {\n\t\t\tif (shared_luadll.size() != 0) {\n\t\t\t\tlua_newstate::init(shared_luadll.data(), \"lua_newstate\");\n\t\t\t\tluaL_newstate::init(shared_luadll.data(), \"luaL_newstate\");\n\t\t\t\tlua_close::init(shared_luadll.data(), \"lua_close\");\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst char* luadll = search_api(\"lua_newstate\", \"luaL_newstate\");\n\t\t\t\tif (luadll) {\n\t\t\t\t\tlua_newstate::init(luadll, \"lua_newstate\");\n\t\t\t\t\tluaL_newstate::init(luadll, \"luaL_newstate\");\n\t\t\t\t\tlua_close::init(luadll, \"lua_close\");\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tlua_newstate::init(L\"luacore.dll\", \"lua_newstate\");\n\t\t\t\t\tluaL_newstate::init(L\"luacore.dll\", \"luaL_newstate\");\n\t\t\t\t\tlua_close::init(L\"luacore.dll\", \"lua_close\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn TRUE;\n}\n\nextern \"C\" __declspec(dllexport) \nbool set_luadll(const wchar_t* str, size_t len)\n{\n\tif (len + 1 > _countof(shared_luadll_str)) { return false; }\n\tmemcpy(shared_luadll_str, str, len * sizeof(wchar_t));\n\tshared_luadll_str[len] = L'\\0';\n\tshared_luadll_len = len;\n\treturn true;\n}\n\nextern \"C\" __declspec(dllexport)\nuint16_t create_process_with_debugger(const wchar_t* application, const wchar_t* command_line, const wchar_t* current_directory)\n{\n\tshared_port = 0;\n\tshared_enable = true;\n\n\tbase::win::process p;\n\tp.inject(get_self_path());\n\tif (!p.create(application, command_line, current_directory)) {\n\t\treturn 0;\n\t}\n\tfor (int i = 0; i < 1000 || !p.is_running(); ++i)\n\t{\n\t\tif (shared_port != 0)\n\t\t\treturn shared_port;\n\t\tSleep(100);\n\t}\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2017 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__TIME_HPP_\n#define RCLCPP__TIME_HPP_\n\n#include <utility>\n\n#include \"builtin_interfaces\/msg\/time.hpp\"\n\n#include \"rclcpp\/exceptions.hpp\"\n\nnamespace rclcpp\n{\n\nclass Time\n{\npublic:\n  template<rcl_time_source_type_t ClockT = RCL_SYSTEM_TIME>\n  static Time\n  now()\n  {\n    rcutils_time_point_value_t rcutils_now = 0;\n    rcutils_ret_t ret = RCUTILS_RET_ERROR;\n    if (ClockT == RCL_ROS_TIME) {\n      throw std::runtime_error(\"RCL_ROS_TIME is currently not implemented.\");\n      ret = false;\n    } else if (ClockT == RCL_SYSTEM_TIME) {\n      ret = rcutils_system_time_now(&rcutils_now);\n    } else if (ClockT == RCL_STEADY_TIME) {\n      ret = rcutils_steady_time_now(&rcutils_now);\n    }\n    if (ret != RCUTILS_RET_OK) {\n      rclcpp::exceptions::throw_from_rcl_error(\n        ret, \"Could not get current time: \");\n    }\n\n    return Time(std::move(rcutils_now));\n  }\n\n  operator builtin_interfaces::msg::Time() const\n  {\n    builtin_interfaces::msg::Time msg_time;\n    msg_time.sec = static_cast<std::int32_t>(RCL_NS_TO_S(rcl_time_));\n    msg_time.nanosec = static_cast<std::uint32_t>(rcl_time_ % (1000 * 1000 * 1000));\n    return msg_time;\n  }\n\nprivate:\n  rcl_time_point_value_t rcl_time_;\n\n  Time(std::uint32_t sec, std::uint32_t nanosec)\n  : rcl_time_(RCL_S_TO_NS(sec) + nanosec)\n  {}\n\n  explicit Time(rcl_time_point_value_t && rcl_time)\n  : rcl_time_(std::forward<decltype(rcl_time)>(rcl_time))\n  {}\n};\n\n}  \/\/ namespace rclcpp\n\n#endif  \/\/ RCLCPP__TIME_HPP_\n<commit_msg>include rcutils\/time (#333)<commit_after>\/\/ Copyright 2017 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__TIME_HPP_\n#define RCLCPP__TIME_HPP_\n\n#include <utility>\n\n#include \"builtin_interfaces\/msg\/time.hpp\"\n#include \"rcl\/time.h\"\n#include \"rcutils\/time.h\"\n\n#include \"rclcpp\/exceptions.hpp\"\n\nnamespace rclcpp\n{\n\nclass Time\n{\npublic:\n  template<rcl_time_source_type_t ClockT = RCL_SYSTEM_TIME>\n  static Time\n  now()\n  {\n    rcutils_time_point_value_t rcutils_now = 0;\n    rcutils_ret_t ret = RCUTILS_RET_ERROR;\n    if (ClockT == RCL_ROS_TIME) {\n      throw std::runtime_error(\"RCL_ROS_TIME is currently not implemented.\");\n      ret = false;\n    } else if (ClockT == RCL_SYSTEM_TIME) {\n      ret = rcutils_system_time_now(&rcutils_now);\n    } else if (ClockT == RCL_STEADY_TIME) {\n      ret = rcutils_steady_time_now(&rcutils_now);\n    }\n    if (ret != RCUTILS_RET_OK) {\n      rclcpp::exceptions::throw_from_rcl_error(\n        ret, \"Could not get current time: \");\n    }\n\n    return Time(std::move(rcutils_now));\n  }\n\n  operator builtin_interfaces::msg::Time() const\n  {\n    builtin_interfaces::msg::Time msg_time;\n    msg_time.sec = static_cast<std::int32_t>(RCL_NS_TO_S(rcl_time_));\n    msg_time.nanosec = static_cast<std::uint32_t>(rcl_time_ % (1000 * 1000 * 1000));\n    return msg_time;\n  }\n\nprivate:\n  rcl_time_point_value_t rcl_time_;\n\n  Time(std::uint32_t sec, std::uint32_t nanosec)\n  : rcl_time_(RCL_S_TO_NS(sec) + nanosec)\n  {}\n\n  explicit Time(rcl_time_point_value_t && rcl_time)\n  : rcl_time_(std::forward<decltype(rcl_time)>(rcl_time))\n  {}\n};\n\n}  \/\/ namespace rclcpp\n\n#endif  \/\/ RCLCPP__TIME_HPP_\n<|endoftext|>"}
{"text":"<commit_before>#include \"cssysdef.h\"\n\n#include <ctype.h>\n\n#include \"awstimer.h\"\n#include \"awstxtbx.h\"\n#include \"ivideo\/graph2d.h\"\n#include \"ivideo\/graph3d.h\"\n#include \"ivideo\/fontserv.h\"\n#include \"csutil\/scfstr.h\"\n#include \"iutil\/evdefs.h\"\n\n#include <stdio.h>\n\nconst int awsTextBox::fsNormal = 0x0;\nconst int awsTextBox::fsBitmap = 0x1;\n\nconst int awsTextBox::signalChanged = 0x1;\nconst int awsTextBox::signalLostFocus = 0x2;\nconst int awsTextBox::signalEnterPressed = 0x3;\nconst int awsTextBox::signalTabPressed = 0x4;\nconst int awsTextBox::signalFocused = 0x5;\n\nstatic iAwsSink *textbox_sink = 0;\n\nCS_IMPLEMENT_STATIC_VAR (GetTextBoxBlinkingCursorSlot, awsSlot,())\n\nstatic awsSlot *textbox_slot = NULL;\n\nstatic void BlinkCursor (void *, iAwsSource *source)\n{\n  iAwsComponent *comp = source->GetComponent ();\n\n  \/\/  Setting blink actually forces an inversion of blink's property, and if the textbox is the\n\n  \/\/ focus then it will be Invalidated as well.\n  comp->SetProperty (\"Blink\", 0);\n}\n\nawsTextBox::awsTextBox () :\n  mouse_is_over(false),\n  has_focus(false),\n  should_mask(0),\n  bkg(NULL),\n  frame_style(0),\n  alpha_level(92),\n  text(NULL),\n  disallow(NULL),\n  maskchar(NULL),\n  start(0),\n  cursor(0),\n  blink_timer(NULL),\n  blink(true)\n{\n  textbox_slot = GetTextBoxBlinkingCursorSlot ();\n}\n\nawsTextBox::~awsTextBox ()\n{\n  if (blink_timer != 0)\n  {\n    textbox_slot->Disconnect (\n        blink_timer,\n        awsTimer::signalTick,\n        textbox_sink,\n        textbox_sink->GetTriggerID (\"Blink\"));\n    delete blink_timer;\n  }\n}\n\nconst char *awsTextBox::Type ()\n{\n  return \"Text Box\";\n}\n\nbool awsTextBox::Setup (iAws *_wmgr, iAwsComponentNode *settings)\n{\n  if (!awsComponent::Setup (_wmgr, settings)) return false;\n\n  \/\/ Setup blink event handling\n  if (textbox_sink == 0)\n  {\n    textbox_sink = WindowManager ()->GetSinkMgr ()->CreateSink (NULL);\n    textbox_sink->RegisterTrigger (\"Blink\", &BlinkCursor);\n  }\n\n  blink_timer = new awsTimer (WindowManager ()->GetObjectRegistry (), this);\n  blink_timer->SetTimer (350);\n  blink_timer->Start ();\n\n  textbox_slot->Connect (\n      blink_timer,\n      awsTimer::signalTick,\n      textbox_sink,\n      textbox_sink->GetTriggerID (\"Blink\"));\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  iAwsPrefManager *pm = WindowManager ()->GetPrefMgr ();\n\n  pm->LookupIntKey (\"ButtonTextureAlpha\", alpha_level); \/\/ global get\n  pm->GetInt (settings, \"Style\", frame_style);\n  pm->GetInt (settings, \"Alpha\", alpha_level);          \/\/ local overrides, if present.\n  pm->GetInt (settings, \"Masked\", should_mask);\n  pm->GetString (settings, \"Text\", text);\n  pm->GetString (settings, \"Disallow\", disallow);\n  pm->GetString (settings, \"MaskChar\", maskchar);\n\n  if (text) {\n      cursor = text->Length ();\n      text = new scfString(*text);\n  } else\n    text = new scfString ();\n\n  switch (frame_style)\n  {\n    case fsNormal:\n      bkg = pm->GetTexture (\"Texture\");\n      break;\n\n    case fsBitmap:\n      {\n        iString *tn1 = NULL;\n\n        pm->GetString (settings, \"Bitmap\", tn1);\n\n        if (tn1) bkg = pm->GetTexture (tn1->GetData (), tn1->GetData ());\n      }\n      break;\n  }\n\n  return true;\n}\n\nbool awsTextBox::GetProperty (const char *name, void **parm)\n{\n  if (awsComponent::GetProperty (name, parm)) return true;\n\n  if (strcmp (\"Text\", name) == 0)\n  {\n    char *st = NULL;\n\n    if (text) st = text->GetData ();\n\n    iString *s = new scfString (st);\n    *parm = (void *)s;\n    return true;\n  }\n  else if (strcmp (\"Disallow\", name) == 0)\n  {\n    char *st = NULL;\n\n    if (disallow) st = disallow->GetData ();\n\n    iString *s = new scfString (st);\n    *parm = (void *)s;\n    return true;\n  }\n\n  return false;\n}\n\nbool awsTextBox::SetProperty (const char *name, void *parm)\n{\n  if (awsComponent::SetProperty (name, parm)) return true;\n\n  if (strcmp (\"Blink\", name) == 0)\n  {\n    blink = !blink;\n    if (has_focus) Invalidate ();\n    return true;\n  }\n  else if (strcmp (\"Text\", name) == 0)\n  {\n    iString *s = (iString *) (parm);\n\n    if (s)\n    {\n      if (text) text->DecRef ();\n      text = s;\n      text->IncRef ();\n      Invalidate ();\n      start = 0;\n      cursor = 0;\n    }\n\n    return true;\n  }\n  else if (strcmp (\"Disallow\", name) == 0)\n  {\n    iString *s = (iString *) (parm);\n\n    if (s)\n    {\n      if (disallow) disallow->DecRef ();\n      disallow = s;\n      disallow->IncRef ();\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\nvoid awsTextBox::OnDraw (csRect \/*clip*\/)\n{\n  iGraphics2D *g2d = WindowManager ()->G2D ();\n  iGraphics3D *g3d = WindowManager ()->G3D ();\n\n  int hi = WindowManager ()->GetPrefMgr ()->GetColor (AC_HIGHLIGHT);\n  int hi2 = WindowManager ()->GetPrefMgr ()->GetColor (AC_HIGHLIGHT2);\n  int lo = WindowManager ()->GetPrefMgr ()->GetColor (AC_SHADOW);\n  int lo2 = WindowManager ()->GetPrefMgr ()->GetColor (AC_SHADOW2);\n  int dfill = WindowManager ()->GetPrefMgr ()->GetColor (AC_DARKFILL);\n  int black = WindowManager ()->GetPrefMgr ()->GetColor (AC_BLACK);\n\n  switch (frame_style)\n  {\n    case fsNormal:\n      g2d->DrawLine (\n          Frame ().xmin + 0,\n          Frame ().ymin + 0,\n          Frame ().xmax - 1,\n          Frame ().ymin + 0,\n          lo2);\n      g2d->DrawLine (\n          Frame ().xmin + 0,\n          Frame ().ymin + 0,\n          Frame ().xmin + 0,\n          Frame ().ymax - 1,\n          lo2);\n      g2d->DrawLine (\n          Frame ().xmin + 1,\n          Frame ().ymin + 1,\n          Frame ().xmax - 0,\n          Frame ().ymin + 1,\n          lo);\n      g2d->DrawLine (\n          Frame ().xmin + 1,\n          Frame ().ymin + 1,\n          Frame ().xmin + 1,\n          Frame ().ymax - 0,\n          lo);\n      g2d->DrawLine (\n          Frame ().xmin + 1,\n          Frame ().ymax - 0,\n          Frame ().xmax - 0,\n          Frame ().ymax - 0,\n          hi);\n      g2d->DrawLine (\n          Frame ().xmax - 0,\n          Frame ().ymin + 1,\n          Frame ().xmax - 0,\n          Frame ().ymax - 0,\n          hi);\n\n      g2d->DrawLine (\n          Frame ().xmin + 2,\n          Frame ().ymin + 2,\n          Frame ().xmax - 1,\n          Frame ().ymin + 2,\n          black);\n      g2d->DrawLine (\n          Frame ().xmin + 2,\n          Frame ().ymin + 2,\n          Frame ().xmin + 2,\n          Frame ().ymax - 1,\n          black);\n      g2d->DrawLine (\n          Frame ().xmin + 2,\n          Frame ().ymax - 1,\n          Frame ().xmax - 1,\n          Frame ().ymax - 1,\n          hi2);\n      g2d->DrawLine (\n          Frame ().xmax - 1,\n          Frame ().ymin + 2,\n          Frame ().xmax - 1,\n          Frame ().ymax - 1,\n          hi2);\n\n      g2d->DrawBox (\n          Frame ().xmin + 3,\n          Frame ().ymin + 3,\n          Frame ().Width () - 3,\n          Frame ().Height () - 3,\n          dfill);\n\n      if (bkg)\n      {\n        g3d->DrawPixmap (\n            bkg,\n            Frame ().xmin,\n            Frame ().ymin,\n            Frame ().Width () + 1,\n            Frame ().Height () + 1,\n            0,\n            0,\n            Frame ().Width () + 1,\n            Frame ().Height () + 1,\n            alpha_level);\n      }\n      break;\n\n    case fsBitmap:\n      if (bkg)\n      {\n        g3d->DrawPixmap (\n            bkg,\n            Frame ().xmin,\n            Frame ().ymin,\n            Frame ().Width (),\n            Frame ().Height (),\n            0,\n            0,\n            Frame ().Width (),\n            Frame ().Height (),\n            alpha_level);\n      }\n      break;\n  }\n\n  \/\/ Draw the caption, if there is one and the style permits it.\n  if (text && text->Length ())\n  {\n    int tw, th, tx, ty, mcc;\n    iString *saved = NULL;\n\n    if (should_mask && maskchar)\n    {\n      saved = text->Clone ();\n\n      unsigned int i;\n      for (i = 0; i < text->Length (); ++i)\n        text->SetAt (i, maskchar->GetAt (0));\n    }\n\n    \/\/ Get the maximum number of characters we can use\n    mcc = WindowManager ()->GetPrefMgr ()->GetDefaultFont ()->GetLength (\n        text->GetData () + start,\n        Frame ().Width () - 10);\n\n    if (mcc)\n    {\n\n      \/\/ Check to see if we're getting weird.\n      \/\/ this was changed to avoid \n      \/\/ jittering in the start value\n      if ((int)cursor > start + mcc) start = cursor - mcc;\n      if (start < 0) start = 0;\n\n      \/\/ Make the text the right length\n      scfString tmp (text->GetData () + start);\n      tmp.Truncate (mcc);\n\n      \/\/ Get the size of the text\n      WindowManager ()->GetPrefMgr ()->GetDefaultFont ()->\n          GetDimensions (tmp.GetData (), tw, th);\n\n      \/\/ Calculate the center\n      tx = 4;\n      ty = (Frame ().Height () >> 1) - (th >> 1);\n\n      \/\/ Draw the text\n      g2d->Write (\n      WindowManager ()->GetPrefMgr ()->GetDefaultFont (),\n      Frame ().xmin + tx,\n      Frame ().ymin + ty,\n      WindowManager ()->GetPrefMgr ()->GetColor (AC_TEXTFORE),\n      -1,\n      tmp.GetData ());\n\n      if (should_mask && maskchar && saved)\n      {\n    text->Clear ();\n    text->Append (saved);\n    saved->Clear ();\n    saved->DecRef ();\n      }\n\n    if (has_focus && blink)\n    {\n      int co, cx, tty;\n      co = cursor - start;\n      tmp.Truncate (co);\n      \/\/ figure out where to put the cursor\n      WindowManager ()->GetPrefMgr ()->GetDefaultFont ()->\n         GetDimensions (tmp, cx, tty);\n      g2d->DrawLine (\n          Frame ().xmin + tx + cx + 1,\n          Frame ().ymin + ty,\n          Frame ().xmin + tx + cx + 1,\n          Frame ().ymin + ty + th,\n          WindowManager ()->GetPrefMgr ()->GetColor (AC_TEXTFORE));\n    }\n    }\n  }\n  else if (has_focus && blink)\n  {\n    g2d->DrawLine (\n        Frame ().xmin + 5,\n        Frame ().ymin + 5,\n        Frame ().xmin + 5,\n        Frame ().ymax - 5,\n        WindowManager ()->GetPrefMgr ()->GetColor (AC_TEXTFORE));\n  }\n}\n\nbool awsTextBox::OnMouseDown (int, int x, int y)\n{\n  \/\/ make sure text is valid\n  if (text && text->Length() > 0)\n  {\n    \/\/ determine how many chars in the mouse was clicked\n    int tp,cp;\n    scfString tmp(text->GetData () + start);\n    tp = x - 4 - Frame ().xmin;\n    cp = WindowManager ()->GetPrefMgr ()->GetDefaultFont ()->\n      GetLength(tmp,tp);\n    cursor = cp + start;\n  }\n  \/\/ This is needed to get keyboard focus for the mouse!\n  return true;\n}\n\nbool awsTextBox::OnMouseExit ()\n{\n  mouse_is_over = false;\n  Invalidate ();\n  return true;\n}\n\nbool awsTextBox::OnMouseEnter ()\n{\n  mouse_is_over = true;\n  Invalidate ();\n  return true;\n}\n\nbool awsTextBox::OnKeypress (int key, int Char, int)\n{\n  switch (key)\n  {\n    case CSKEY_ENTER:\n      Broadcast (signalEnterPressed);\n      break;\n\n    case CSKEY_TAB:\n      Broadcast (signalTabPressed);\n      break;\n\n    case CSKEY_BACKSPACE:\n      if (cursor > 0) \n      {\n        cursor--;\n        if (cursor - start < 5) start = cursor - 5;\n        if (start < 0) start = 0;\n        if (text && (text->Length () > 1))\n          if (cursor == text->Length ())\n            text->Truncate (text->Length () - 1);\n          else\n          {\n            scfString tmp(text->GetData());\n            tmp.Truncate (cursor);\n            tmp.Append (text->GetData()+cursor+1);\n            text->Replace(&tmp);\n          }\n        else\n          text->Clear ();\n      }\n\n      break;\n\n    case CSKEY_DEL:\n      if (cursor > 0 && cursor == text->Length ()) cursor--;\n      if (cursor - start < 5) start = cursor - 5;\n      if (start < 0) start = 0;\n      if (text && (text->Length () > 1))\n        if (cursor == text->Length ())\n          text->Truncate (text->Length () - 1);\n        else\n        {\n          scfString tmp(text->GetData());\n          tmp.Truncate (cursor);\n          tmp.Append (text->GetData()+cursor+1);\n          text->Replace(&tmp);\n        }\n      else\n        text->Clear ();\n\n      break;\n\n    case CSKEY_LEFT:\n      if (cursor > 0) cursor--;\n      if (cursor - start < 5) start = cursor - 5;\n      if (start < 0) start = 0;\n\n      break;\n\n    case CSKEY_RIGHT:\n      if (cursor < text->Length ()) {\n        cursor++;\n      }\n\n      break;\n\n    case CSKEY_HOME:\n      cursor=0;\n      start=0;\n\n      break;\n\n    case CSKEY_END:\n      cursor=text->Length();\n\n      break;\n\n    default:\n      {\n\tif (!isprint (Char))\n\t  break;\n\t\n\tif (disallow && (strchr (disallow->GetData (), Char) != 0))\n\t  break;\n\t\n\tchar str[2];\n\tstr[0] = (char)Char;\n\tstr[1] = 0;\n        scfString tmp(str);\n\n        if (cursor == text->Length ()) \n        {\n\t  text->Append (str);\n        }\n        else\n        {\n          text->Insert (cursor, &tmp);\n        }\n\tcursor++;\n\tBroadcast (signalChanged);\n      }\n  }         \/\/ end switch\n  Invalidate ();\n  return true;\n}\n\nbool awsTextBox::OnLostFocus ()\n{\n  has_focus = false;\n  Broadcast (signalLostFocus);\n  Invalidate ();\n  return true;\n}\n\nbool awsTextBox::OnGainFocus ()\n{\n  has_focus = true;\n  Invalidate ();\n  return true;\n}\n\nvoid awsTextBox::OnSetFocus ()\n{\n\tBroadcast (signalFocused);\n}\n\n\/************************************* Command Button Factory ****************\/\nawsTextBoxFactory::awsTextBoxFactory (iAws *wmgr) :\n  awsComponentFactory(wmgr)\n{\n  Register (\"Text Box\");\n  RegisterConstant (\"tbfsNormal\", awsTextBox::fsNormal);\n  RegisterConstant (\"tbfsBitmap\", awsTextBox::fsBitmap);\n\n  RegisterConstant (\"signalTextBoxChanged\", awsTextBox::signalChanged);\n  RegisterConstant (\"signalTextBoxLostFocus\", awsTextBox::signalLostFocus);\n  RegisterConstant (\"signalEnterKeyPressed\", awsTextBox::signalEnterPressed);\n  RegisterConstant (\"signalTabKeyPressed\", awsTextBox::signalTabPressed);\n  RegisterConstant (\"signalTextBoxFocused\", awsTextBox::signalFocused);\n}\n\nawsTextBoxFactory::~awsTextBoxFactory ()\n{\n  \/\/ empty\n}\n\niAwsComponent *awsTextBoxFactory::Create ()\n{\n  return new awsTextBox;\n}\n<commit_msg>Added property \"Focusable\"<commit_after>#include \"cssysdef.h\"\n\n#include <ctype.h>\n\n#include \"awstimer.h\"\n#include \"awstxtbx.h\"\n#include \"ivideo\/graph2d.h\"\n#include \"ivideo\/graph3d.h\"\n#include \"ivideo\/fontserv.h\"\n#include \"csutil\/scfstr.h\"\n#include \"iutil\/evdefs.h\"\n\n#include <stdio.h>\n\nconst int awsTextBox::fsNormal = 0x0;\nconst int awsTextBox::fsBitmap = 0x1;\n\nconst int awsTextBox::signalChanged = 0x1;\nconst int awsTextBox::signalLostFocus = 0x2;\nconst int awsTextBox::signalEnterPressed = 0x3;\nconst int awsTextBox::signalTabPressed = 0x4;\nconst int awsTextBox::signalFocused = 0x5;\n\nstatic iAwsSink *textbox_sink = 0;\n\nCS_IMPLEMENT_STATIC_VAR (GetTextBoxBlinkingCursorSlot, awsSlot,())\n\nstatic awsSlot *textbox_slot = NULL;\n\nstatic void BlinkCursor (void *, iAwsSource *source)\n{\n  iAwsComponent *comp = source->GetComponent ();\n\n  \/\/  Setting blink actually forces an inversion of blink's property, and if the textbox is the\n\n  \/\/ focus then it will be Invalidated as well.\n  comp->SetProperty (\"Blink\", 0);\n}\n\nawsTextBox::awsTextBox () :\n  mouse_is_over(false),\n  has_focus(false),\n  should_mask(0),\n  bkg(NULL),\n  frame_style(0),\n  alpha_level(92),\n  text(NULL),\n  disallow(NULL),\n  maskchar(NULL),\n  start(0),\n  cursor(0),\n  blink_timer(NULL),\n  blink(true)\n{\n  textbox_slot = GetTextBoxBlinkingCursorSlot ();\n}\n\nawsTextBox::~awsTextBox ()\n{\n  if (blink_timer != 0)\n  {\n    textbox_slot->Disconnect (\n        blink_timer,\n        awsTimer::signalTick,\n        textbox_sink,\n        textbox_sink->GetTriggerID (\"Blink\"));\n    delete blink_timer;\n  }\n}\n\nconst char *awsTextBox::Type ()\n{\n  return \"Text Box\";\n}\n\nbool awsTextBox::Setup (iAws *_wmgr, iAwsComponentNode *settings)\n{\n  if (!awsComponent::Setup (_wmgr, settings)) return false;\n\n  \/\/ Setup blink event handling\n  if (textbox_sink == 0)\n  {\n    textbox_sink = WindowManager ()->GetSinkMgr ()->CreateSink (NULL);\n    textbox_sink->RegisterTrigger (\"Blink\", &BlinkCursor);\n  }\n\n  blink_timer = new awsTimer (WindowManager ()->GetObjectRegistry (), this);\n  blink_timer->SetTimer (350);\n  blink_timer->Start ();\n\n  textbox_slot->Connect (\n      blink_timer,\n      awsTimer::signalTick,\n      textbox_sink,\n      textbox_sink->GetTriggerID (\"Blink\"));\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  iAwsPrefManager *pm = WindowManager ()->GetPrefMgr ();\n\n  pm->LookupIntKey (\"ButtonTextureAlpha\", alpha_level); \/\/ global get\n  pm->GetInt (settings, \"Style\", frame_style);\n  pm->GetInt (settings, \"Alpha\", alpha_level);          \/\/ local overrides, if present.\n  pm->GetInt (settings, \"Masked\", should_mask);\n  pm->GetString (settings, \"Text\", text);\n  pm->GetString (settings, \"Disallow\", disallow);\n  pm->GetString (settings, \"MaskChar\", maskchar);\n\n  int _focusable = 0;\n  pm->GetInt (settings, \"Focusable\", _focusable);\n\tfocusable = _focusable;\n  \n\tif (text) {\n      cursor = text->Length ();\n      text = new scfString(*text);\n  } else\n    text = new scfString ();\n\n  switch (frame_style)\n  {\n    case fsNormal:\n      bkg = pm->GetTexture (\"Texture\");\n      break;\n\n    case fsBitmap:\n      {\n        iString *tn1 = NULL;\n\n        pm->GetString (settings, \"Bitmap\", tn1);\n\n        if (tn1) bkg = pm->GetTexture (tn1->GetData (), tn1->GetData ());\n      }\n      break;\n  }\n\n  return true;\n}\n\nbool awsTextBox::GetProperty (const char *name, void **parm)\n{\n  if (awsComponent::GetProperty (name, parm)) return true;\n\n  if (strcmp (\"Text\", name) == 0)\n  {\n    char *st = NULL;\n\n    if (text) st = text->GetData ();\n\n    iString *s = new scfString (st);\n    *parm = (void *)s;\n    return true;\n  }\n  else if (strcmp (\"Disallow\", name) == 0)\n  {\n    char *st = NULL;\n\n    if (disallow) st = disallow->GetData ();\n\n    iString *s = new scfString (st);\n    *parm = (void *)s;\n    return true;\n  }\n\n  return false;\n}\n\nbool awsTextBox::SetProperty (const char *name, void *parm)\n{\n  if (awsComponent::SetProperty (name, parm)) return true;\n\n  if (strcmp (\"Blink\", name) == 0)\n  {\n    blink = !blink;\n    if (has_focus) Invalidate ();\n    return true;\n  }\n  else if (strcmp (\"Text\", name) == 0)\n  {\n    iString *s = (iString *) (parm);\n\n    if (s)\n    {\n      if (text) text->DecRef ();\n      text = s;\n      text->IncRef ();\n      Invalidate ();\n      start = 0;\n      cursor = 0;\n    }\n\n    return true;\n  }\n  else if (strcmp (\"Disallow\", name) == 0)\n  {\n    iString *s = (iString *) (parm);\n\n    if (s)\n    {\n      if (disallow) disallow->DecRef ();\n      disallow = s;\n      disallow->IncRef ();\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\nvoid awsTextBox::OnDraw (csRect \/*clip*\/)\n{\n  iGraphics2D *g2d = WindowManager ()->G2D ();\n  iGraphics3D *g3d = WindowManager ()->G3D ();\n\n  int hi = WindowManager ()->GetPrefMgr ()->GetColor (AC_HIGHLIGHT);\n  int hi2 = WindowManager ()->GetPrefMgr ()->GetColor (AC_HIGHLIGHT2);\n  int lo = WindowManager ()->GetPrefMgr ()->GetColor (AC_SHADOW);\n  int lo2 = WindowManager ()->GetPrefMgr ()->GetColor (AC_SHADOW2);\n  int dfill = WindowManager ()->GetPrefMgr ()->GetColor (AC_DARKFILL);\n  int black = WindowManager ()->GetPrefMgr ()->GetColor (AC_BLACK);\n\n  switch (frame_style)\n  {\n    case fsNormal:\n      g2d->DrawLine (\n          Frame ().xmin + 0,\n          Frame ().ymin + 0,\n          Frame ().xmax - 1,\n          Frame ().ymin + 0,\n          lo2);\n      g2d->DrawLine (\n          Frame ().xmin + 0,\n          Frame ().ymin + 0,\n          Frame ().xmin + 0,\n          Frame ().ymax - 1,\n          lo2);\n      g2d->DrawLine (\n          Frame ().xmin + 1,\n          Frame ().ymin + 1,\n          Frame ().xmax - 0,\n          Frame ().ymin + 1,\n          lo);\n      g2d->DrawLine (\n          Frame ().xmin + 1,\n          Frame ().ymin + 1,\n          Frame ().xmin + 1,\n          Frame ().ymax - 0,\n          lo);\n      g2d->DrawLine (\n          Frame ().xmin + 1,\n          Frame ().ymax - 0,\n          Frame ().xmax - 0,\n          Frame ().ymax - 0,\n          hi);\n      g2d->DrawLine (\n          Frame ().xmax - 0,\n          Frame ().ymin + 1,\n          Frame ().xmax - 0,\n          Frame ().ymax - 0,\n          hi);\n\n      g2d->DrawLine (\n          Frame ().xmin + 2,\n          Frame ().ymin + 2,\n          Frame ().xmax - 1,\n          Frame ().ymin + 2,\n          black);\n      g2d->DrawLine (\n          Frame ().xmin + 2,\n          Frame ().ymin + 2,\n          Frame ().xmin + 2,\n          Frame ().ymax - 1,\n          black);\n      g2d->DrawLine (\n          Frame ().xmin + 2,\n          Frame ().ymax - 1,\n          Frame ().xmax - 1,\n          Frame ().ymax - 1,\n          hi2);\n      g2d->DrawLine (\n          Frame ().xmax - 1,\n          Frame ().ymin + 2,\n          Frame ().xmax - 1,\n          Frame ().ymax - 1,\n          hi2);\n\n      g2d->DrawBox (\n          Frame ().xmin + 3,\n          Frame ().ymin + 3,\n          Frame ().Width () - 3,\n          Frame ().Height () - 3,\n          dfill);\n\n      if (bkg)\n      {\n        g3d->DrawPixmap (\n            bkg,\n            Frame ().xmin,\n            Frame ().ymin,\n            Frame ().Width () + 1,\n            Frame ().Height () + 1,\n            0,\n            0,\n            Frame ().Width () + 1,\n            Frame ().Height () + 1,\n            alpha_level);\n      }\n      break;\n\n    case fsBitmap:\n      if (bkg)\n      {\n        g3d->DrawPixmap (\n            bkg,\n            Frame ().xmin,\n            Frame ().ymin,\n            Frame ().Width (),\n            Frame ().Height (),\n            0,\n            0,\n            Frame ().Width (),\n            Frame ().Height (),\n            alpha_level);\n      }\n      break;\n  }\n\n  \/\/ Draw the caption, if there is one and the style permits it.\n  if (text && text->Length ())\n  {\n    int tw, th, tx, ty, mcc;\n    iString *saved = NULL;\n\n    if (should_mask && maskchar)\n    {\n      saved = text->Clone ();\n\n      unsigned int i;\n      for (i = 0; i < text->Length (); ++i)\n        text->SetAt (i, maskchar->GetAt (0));\n    }\n\n    \/\/ Get the maximum number of characters we can use\n    mcc = WindowManager ()->GetPrefMgr ()->GetDefaultFont ()->GetLength (\n        text->GetData () + start,\n        Frame ().Width () - 10);\n\n    if (mcc)\n    {\n\n      \/\/ Check to see if we're getting weird.\n      \/\/ this was changed to avoid \n      \/\/ jittering in the start value\n      if ((int)cursor > start + mcc) start = cursor - mcc;\n      if (start < 0) start = 0;\n\n      \/\/ Make the text the right length\n      scfString tmp (text->GetData () + start);\n      tmp.Truncate (mcc);\n\n      \/\/ Get the size of the text\n      WindowManager ()->GetPrefMgr ()->GetDefaultFont ()->\n          GetDimensions (tmp.GetData (), tw, th);\n\n      \/\/ Calculate the center\n      tx = 4;\n      ty = (Frame ().Height () >> 1) - (th >> 1);\n\n      \/\/ Draw the text\n      g2d->Write (\n      WindowManager ()->GetPrefMgr ()->GetDefaultFont (),\n      Frame ().xmin + tx,\n      Frame ().ymin + ty,\n      WindowManager ()->GetPrefMgr ()->GetColor (AC_TEXTFORE),\n      -1,\n      tmp.GetData ());\n\n      if (should_mask && maskchar && saved)\n      {\n    text->Clear ();\n    text->Append (saved);\n    saved->Clear ();\n    saved->DecRef ();\n      }\n\n    if (has_focus && blink)\n    {\n      int co, cx, tty;\n      co = cursor - start;\n      tmp.Truncate (co);\n      \/\/ figure out where to put the cursor\n      WindowManager ()->GetPrefMgr ()->GetDefaultFont ()->\n         GetDimensions (tmp, cx, tty);\n      g2d->DrawLine (\n          Frame ().xmin + tx + cx + 1,\n          Frame ().ymin + ty,\n          Frame ().xmin + tx + cx + 1,\n          Frame ().ymin + ty + th,\n          WindowManager ()->GetPrefMgr ()->GetColor (AC_TEXTFORE));\n    }\n    }\n  }\n  else if (has_focus && blink)\n  {\n    g2d->DrawLine (\n        Frame ().xmin + 5,\n        Frame ().ymin + 5,\n        Frame ().xmin + 5,\n        Frame ().ymax - 5,\n        WindowManager ()->GetPrefMgr ()->GetColor (AC_TEXTFORE));\n  }\n}\n\nbool awsTextBox::OnMouseDown (int, int x, int y)\n{\n  \/\/ make sure text is valid\n  if (text && text->Length() > 0)\n  {\n    \/\/ determine how many chars in the mouse was clicked\n    int tp,cp;\n    scfString tmp(text->GetData () + start);\n    tp = x - 4 - Frame ().xmin;\n    cp = WindowManager ()->GetPrefMgr ()->GetDefaultFont ()->\n      GetLength(tmp,tp);\n    cursor = cp + start;\n  }\n  \/\/ This is needed to get keyboard focus for the mouse!\n  return true;\n}\n\nbool awsTextBox::OnMouseExit ()\n{\n  mouse_is_over = false;\n  Invalidate ();\n  return true;\n}\n\nbool awsTextBox::OnMouseEnter ()\n{\n  mouse_is_over = true;\n  Invalidate ();\n  return true;\n}\n\nbool awsTextBox::OnKeypress (int key, int Char, int)\n{\n  switch (key)\n  {\n    case CSKEY_ENTER:\n      Broadcast (signalEnterPressed);\n      break;\n\n    case CSKEY_TAB:\n      Broadcast (signalTabPressed);\n      break;\n\n    case CSKEY_BACKSPACE:\n      if (cursor > 0) \n      {\n        cursor--;\n        if (cursor - start < 5) start = cursor - 5;\n        if (start < 0) start = 0;\n        if (text && (text->Length () > 1))\n          if (cursor == text->Length ())\n            text->Truncate (text->Length () - 1);\n          else\n          {\n            scfString tmp(text->GetData());\n            tmp.Truncate (cursor);\n            tmp.Append (text->GetData()+cursor+1);\n            text->Replace(&tmp);\n          }\n        else\n          text->Clear ();\n      }\n\n      break;\n\n    case CSKEY_DEL:\n      if (cursor > 0 && cursor == text->Length ()) cursor--;\n      if (cursor - start < 5) start = cursor - 5;\n      if (start < 0) start = 0;\n      if (text && (text->Length () > 1))\n        if (cursor == text->Length ())\n          text->Truncate (text->Length () - 1);\n        else\n        {\n          scfString tmp(text->GetData());\n          tmp.Truncate (cursor);\n          tmp.Append (text->GetData()+cursor+1);\n          text->Replace(&tmp);\n        }\n      else\n        text->Clear ();\n\n      break;\n\n    case CSKEY_LEFT:\n      if (cursor > 0) cursor--;\n      if (cursor - start < 5) start = cursor - 5;\n      if (start < 0) start = 0;\n\n      break;\n\n    case CSKEY_RIGHT:\n      if (cursor < text->Length ()) {\n        cursor++;\n      }\n\n      break;\n\n    case CSKEY_HOME:\n      cursor=0;\n      start=0;\n\n      break;\n\n    case CSKEY_END:\n      cursor=text->Length();\n\n      break;\n\n    default:\n      {\n\tif (!isprint (Char))\n\t  break;\n\t\n\tif (disallow && (strchr (disallow->GetData (), Char) != 0))\n\t  break;\n\t\n\tchar str[2];\n\tstr[0] = (char)Char;\n\tstr[1] = 0;\n        scfString tmp(str);\n\n        if (cursor == text->Length ()) \n        {\n\t  text->Append (str);\n        }\n        else\n        {\n          text->Insert (cursor, &tmp);\n        }\n\tcursor++;\n\tBroadcast (signalChanged);\n      }\n  }         \/\/ end switch\n  Invalidate ();\n  return true;\n}\n\nbool awsTextBox::OnLostFocus ()\n{\n  has_focus = false;\n  Broadcast (signalLostFocus);\n  Invalidate ();\n  return true;\n}\n\nbool awsTextBox::OnGainFocus ()\n{\n  has_focus = true;\n  Invalidate ();\n  return true;\n}\n\nvoid awsTextBox::OnSetFocus ()\n{\n\tBroadcast (signalFocused);\n}\n\n\/************************************* Command Button Factory ****************\/\nawsTextBoxFactory::awsTextBoxFactory (iAws *wmgr) :\n  awsComponentFactory(wmgr)\n{\n  Register (\"Text Box\");\n  RegisterConstant (\"tbfsNormal\", awsTextBox::fsNormal);\n  RegisterConstant (\"tbfsBitmap\", awsTextBox::fsBitmap);\n\n  RegisterConstant (\"signalTextBoxChanged\", awsTextBox::signalChanged);\n  RegisterConstant (\"signalTextBoxLostFocus\", awsTextBox::signalLostFocus);\n  RegisterConstant (\"signalEnterKeyPressed\", awsTextBox::signalEnterPressed);\n  RegisterConstant (\"signalTabKeyPressed\", awsTextBox::signalTabPressed);\n  RegisterConstant (\"signalTextBoxFocused\", awsTextBox::signalFocused);\n}\n\nawsTextBoxFactory::~awsTextBoxFactory ()\n{\n  \/\/ empty\n}\n\niAwsComponent *awsTextBoxFactory::Create ()\n{\n  return new awsTextBox;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n\n This file is part of the GLC-lib library.\n Copyright (C) 2005-2008 Laurent Ribon (laumaya@users.sourceforge.net)\n Version 1.0.0, packaged on August, 2008.\n\n http:\/\/glc-lib.sourceforge.net\n\n GLC-lib 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 GLC-lib is distributed in the hope that it 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 GLC-lib; 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 glc_instance.cpp implementation of the GLC_Instance class.\n\n#include \"glc_instance.h\"\n#include \"glc_selectionmaterial.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Construction\/Destruction\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Default constructor\nGLC_Instance::GLC_Instance()\n: m_pGeom(NULL)\n, m_pBoundingBox(NULL)\n, m_pNumberOfInstance(new int(1))\n, m_MatPos()\n, m_IsValid(false)\n, m_IsSelected(false)\n, m_PolyFace(GL_FRONT_AND_BACK)\n, m_PolyMode(GL_FILL)\n, m_IsVisible(true)\n{\n\t\/\/qDebug() << \"GLC_Instance::GLC_Instance null instance ID = \" << m_Uid;\n\t\/\/qDebug() << \"Number of instance\" << (*m_pNumberOfInstance);\n}\n\n\/\/ Contruct instance with a geometry\nGLC_Instance::GLC_Instance(GLC_Geometry* pGeom)\n: m_pGeom(pGeom)\n, m_pBoundingBox(NULL)\n, m_pNumberOfInstance(new int(1))\n, m_MatPos()\n, m_IsValid(false)\n, m_IsSelected(false)\n, m_PolyFace(GL_FRONT_AND_BACK)\n, m_PolyMode(GL_FILL)\n, m_IsVisible(true)\n{\n\tsetName(pGeom->getName());\n\t\/\/qDebug() << \"GLC_Instance::GLC_Instance ID = \" << m_Uid;\n\t\/\/qDebug() << \"Number of instance\" << (*m_pNumberOfInstance);\n}\n\n\/\/ Copy constructor\nGLC_Instance::GLC_Instance(const GLC_Instance& inputNode)\n: GLC_Object(inputNode)\n, m_pGeom(inputNode.m_pGeom)\n, m_pBoundingBox(NULL)\n, m_pNumberOfInstance(inputNode.m_pNumberOfInstance)\n, m_MatPos(inputNode.m_MatPos)\n, m_IsValid(false)\n, m_IsSelected(false)\n, m_PolyFace(inputNode.m_PolyFace)\n, m_PolyMode(inputNode.m_PolyMode)\n, m_IsVisible(inputNode.m_IsVisible)\n\n{\n\t\/\/ Increment the number of instance\n\t++(*m_pNumberOfInstance);\n\t\/\/qDebug() << \"GLC_Instance::GLC_Instance CopyConstructor ID = \" << m_Uid;\n\t\/\/qDebug() << \"Number of instance\" << (*m_pNumberOfInstance);\n}\n\n\n\/\/ Assignement operator\nGLC_Instance& GLC_Instance::operator=(const GLC_Instance& inputNode)\n{\t\n\t\n\tclear();\n\tm_pGeom= inputNode.m_pGeom;\n\tm_Uid= inputNode.m_Uid;\n\tm_Name= inputNode.m_Name;\n\t\n\tm_pNumberOfInstance= inputNode.m_pNumberOfInstance;\n\t++(*m_pNumberOfInstance);\n\t\/\/qDebug() << \"GLC_Instance::operator= :ID = \" << m_Uid;\n\t\/\/qDebug() << \"Number of instance\" << (*m_pNumberOfInstance);\n\tm_MatPos= inputNode.m_MatPos;\n\treturn *this;\n}\n\n\/\/ Destructor\nGLC_Instance::~GLC_Instance()\n{\n\tclear();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Get Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Get the geometry of the instance\nGLC_Geometry* GLC_Instance::getGeometry(void)\n{\n\treturn m_pGeom;\n}\n\n\n\/\/ Get the validity of the OpenGL list\nconst bool GLC_Instance::getValidity(void) const\n{\n\tif ((m_pGeom != NULL) && (m_IsValid))\n\t{\n\t\treturn m_pGeom->getValidity();\n\t}\n\telse return false;\n}\n\n\/\/ Get the bounding box\nGLC_BoundingBox GLC_Instance::getBoundingBox(void)\n{\n\tif (getBoundingBoxValidity())\n\t{\n\t\treturn *m_pBoundingBox;\n\t}\n\telse if (m_pGeom != NULL)\n\t{\n\t\tcomputeBoundingBox();\n\t\tif (m_pBoundingBox != NULL)\n\t\t{\n\t\t\treturn *m_pBoundingBox;\n\t\t}\n\t\t\n\t}\n\t\n\tGLC_BoundingBox nullBoundingBox;\n\treturn nullBoundingBox;\n}\n\n\/\/ Get the validity of the Bounding Box\nconst bool GLC_Instance::getBoundingBoxValidity(void) const\n{\n\tif ((m_pGeom != NULL) && (m_pBoundingBox != NULL))\n\t{\n\t\treturn (m_pGeom->getListIsValid()) && (m_pGeom->getValidity());\n\t}\n\telse return false;\n}\n\n\/\/ Clone the instance\nGLC_Instance GLC_Instance::clone() const\n{\n\tGLC_Instance cloneInstance;\n\tcloneInstance.m_pGeom= m_pGeom->clone();\n\tif (NULL != m_pBoundingBox)\n\t{\n\t\tcloneInstance.m_pBoundingBox= new GLC_BoundingBox(*m_pBoundingBox);\n\t}\n\tcloneInstance.m_MatPos= m_MatPos;\n\tcloneInstance.m_PolyFace= m_PolyFace;\n\tcloneInstance.m_PolyMode= m_PolyMode;\n\treturn cloneInstance;\n}\n\n\/\/ Instanciate the instance\nGLC_Instance GLC_Instance::instanciate()\n{\n\tGLC_Instance instance(*this);\n\tinstance.m_Uid= glc::GLC_GenID();\n\treturn instance;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/\/ Set the instance Geometry\nbool GLC_Instance::setGeometry(GLC_Geometry* pGeom)\n{\n\t\tif (NULL == m_pGeom) return false;\n\t\telse\n\t\t{\n\t\t\tm_pGeom= pGeom;\n\t\t\treturn true;\n\t\t}\n}\n\n\/\/ Geometry translation\nvoid GLC_Instance::translate(double Tx, double Ty, double Tz)\n{\n\tGLC_Matrix4x4 MatTrans(Tx, Ty, Tz);\n\t\n\tmultMatrix(MatTrans);\n}\n\n\n\/\/ move instance with a 4x4Matrix\nvoid GLC_Instance::multMatrix(const GLC_Matrix4x4 &MultMat)\n{\n\tm_MatPos= MultMat * m_MatPos;\n\n\tm_IsValid= false;\n}\n\n\/\/ Replace the instance Matrix\nvoid GLC_Instance::setMatrix(const GLC_Matrix4x4 &SetMat)\n{\n\tm_MatPos= SetMat;\n\n\tm_IsValid= false;\n}\n\n\/\/ Reset the instance Matrix\nvoid GLC_Instance::resetMatrix(void)\n{\n\tm_MatPos.setToIdentity();\n\n\tm_IsValid= false;\n}\n\n\/\/ Polygon's display style\nvoid GLC_Instance::setPolygonMode(GLenum Face, GLenum Mode)\n{\n\t\/\/ Change the polygon mode only if there is a change\n\tif ((m_PolyFace != Face) || (m_PolyMode != Mode))\n\t{\n\t\tm_PolyFace= Face;\n\t\tm_PolyMode= Mode;\n\t\tm_IsValid = false;\n\t}\n}\n\n\/\/ Select the instance\nvoid GLC_Instance::select(void)\n{\n\tm_IsSelected= true;\n\tm_IsValid= false;\n}\n\n\/\/ Unselect the instance\nvoid GLC_Instance::unselect(void)\n{\n\tm_IsSelected= false;\n\tm_IsValid= false;\n}\n\n\/\/ set Instance validity in case of multiple instance.\nvoid GLC_Instance::setInstanceValidity(void)\n{\n\tif ((m_pGeom != NULL) && (m_IsValid))\n\t{\n\t\tm_IsValid= m_pGeom->getValidity();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Display the instance\nvoid GLC_Instance::glExecute(GLenum Mode)\n{\n\tbool computeBox= false;\n\tif (NULL == m_pGeom) return;\n\t\/\/ Geometry OpenGl list invalid\n\tif (!m_pGeom->getListIsValid())\n\t{\n\t\tm_pGeom->glLoadTexture();\n\t\tm_pGeom->createList(GL_COMPILE);\n\t\tcomputeBox= true;\n\t}\n\t\n\t\/\/ Geometry invalid or instance\n\tif ((!m_pGeom->getValidity()) || (!m_IsValid))\n\t{\t\t\n\t\tm_IsValid= true;\n\t\tcomputeBox= true;\n\t}\n\t\/\/ Object ID for selection purpose\n\tglLoadName(getID());\n\t\/\/ Save current OpenGL Matrix\n\tglPushMatrix();\n\tglVisProperties();\n\tm_pGeom->glExecute(Mode, m_IsSelected, ((m_PolyMode != GL_FILL)));\n\t\/\/ Restore OpenGL Matrix\n\tglPopMatrix();\n\t\/\/qDebug() << \"GLC_Instance::GlExecute : Display list \" << m_ListID << \" created\";\n\t\n\tif (computeBox)\n\t{\n\t\tcomputeBoundingBox();\n\t}\n\t\n}\n\n\/\/ Set instance visualisation properties\nvoid GLC_Instance::glVisProperties()\n{\n\t\/\/ Polygons display mode\n\tglPolygonMode(m_PolyFace, m_PolyMode);\t\n\t\/\/ Change the current matrix\n\tglMultMatrixd(m_MatPos.return_dMat());\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ private services functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/\/ compute the instance bounding box\n\/\/ m_pGeom should be not null\nvoid GLC_Instance::computeBoundingBox(void)\n{\n\tif (m_pBoundingBox != NULL)\n\t{\n\t\tdelete m_pBoundingBox;\n\t\tm_pBoundingBox= NULL;\n\t}\n\t\n\tm_pBoundingBox= m_pGeom->getBoundingBox();\n\tm_pBoundingBox->transform(m_MatPos);\n\t\n}\n\n\/\/ Clear current instance\nvoid GLC_Instance::clear()\n{\n\tQ_ASSERT(m_pNumberOfInstance != NULL);\n\t\n\tif ((--(*m_pNumberOfInstance)) == 0)\n\t{\n\t\t\/\/ this is the last instance, delete the geometry\n\t\tif (m_pGeom != NULL)\n\t\t{\n\t\t\tdelete m_pGeom;\n\t\t\tm_pGeom= NULL;\n\t\t}\n\t\t\/\/ delete instance counter\n\t\t\/\/qDebug() << \"GLC_Instance::clear ID = \" << m_Uid;\n\t\t\/\/qDebug() << \"- Number of instance\" << (*m_pNumberOfInstance);\n\t\tdelete m_pNumberOfInstance;\n\t\tm_pNumberOfInstance= NULL;\n\t\t\n\t}\n\telse\n\t{\n\t\t\/\/qDebug() << \"GLC_Instance::clear ID = \" << m_Uid;\n\t\t\/\/qDebug() << \" - Number of instance\" << (*m_pNumberOfInstance);\n\t}\n\t\n\t\n\tif (m_pBoundingBox != NULL)\n\t{\n\t\tdelete m_pBoundingBox;\n\t\tm_pBoundingBox= NULL;\n\t}\n\t\t\n\t\/\/ invalidate the instance\n\tm_IsValid= false;\n\n}\n\n\n\n<commit_msg>before returning bounding box validity, just test the geometry validity. (List validity is include in geometry validity).<commit_after>\/****************************************************************************\n\n This file is part of the GLC-lib library.\n Copyright (C) 2005-2008 Laurent Ribon (laumaya@users.sourceforge.net)\n Version 1.0.0, packaged on August, 2008.\n\n http:\/\/glc-lib.sourceforge.net\n\n GLC-lib 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 GLC-lib is distributed in the hope that it 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 GLC-lib; 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 glc_instance.cpp implementation of the GLC_Instance class.\n\n#include \"glc_instance.h\"\n#include \"glc_selectionmaterial.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Construction\/Destruction\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Default constructor\nGLC_Instance::GLC_Instance()\n: m_pGeom(NULL)\n, m_pBoundingBox(NULL)\n, m_pNumberOfInstance(new int(1))\n, m_MatPos()\n, m_IsValid(false)\n, m_IsSelected(false)\n, m_PolyFace(GL_FRONT_AND_BACK)\n, m_PolyMode(GL_FILL)\n, m_IsVisible(true)\n{\n\t\/\/qDebug() << \"GLC_Instance::GLC_Instance null instance ID = \" << m_Uid;\n\t\/\/qDebug() << \"Number of instance\" << (*m_pNumberOfInstance);\n}\n\n\/\/ Contruct instance with a geometry\nGLC_Instance::GLC_Instance(GLC_Geometry* pGeom)\n: m_pGeom(pGeom)\n, m_pBoundingBox(NULL)\n, m_pNumberOfInstance(new int(1))\n, m_MatPos()\n, m_IsValid(false)\n, m_IsSelected(false)\n, m_PolyFace(GL_FRONT_AND_BACK)\n, m_PolyMode(GL_FILL)\n, m_IsVisible(true)\n{\n\tsetName(pGeom->getName());\n\t\/\/qDebug() << \"GLC_Instance::GLC_Instance ID = \" << m_Uid;\n\t\/\/qDebug() << \"Number of instance\" << (*m_pNumberOfInstance);\n}\n\n\/\/ Copy constructor\nGLC_Instance::GLC_Instance(const GLC_Instance& inputNode)\n: GLC_Object(inputNode)\n, m_pGeom(inputNode.m_pGeom)\n, m_pBoundingBox(NULL)\n, m_pNumberOfInstance(inputNode.m_pNumberOfInstance)\n, m_MatPos(inputNode.m_MatPos)\n, m_IsValid(false)\n, m_IsSelected(false)\n, m_PolyFace(inputNode.m_PolyFace)\n, m_PolyMode(inputNode.m_PolyMode)\n, m_IsVisible(inputNode.m_IsVisible)\n\n{\n\t\/\/ Increment the number of instance\n\t++(*m_pNumberOfInstance);\n\t\/\/qDebug() << \"GLC_Instance::GLC_Instance CopyConstructor ID = \" << m_Uid;\n\t\/\/qDebug() << \"Number of instance\" << (*m_pNumberOfInstance);\n}\n\n\n\/\/ Assignement operator\nGLC_Instance& GLC_Instance::operator=(const GLC_Instance& inputNode)\n{\t\n\t\n\tclear();\n\tm_pGeom= inputNode.m_pGeom;\n\tm_Uid= inputNode.m_Uid;\n\tm_Name= inputNode.m_Name;\n\t\n\tm_pNumberOfInstance= inputNode.m_pNumberOfInstance;\n\t++(*m_pNumberOfInstance);\n\t\/\/qDebug() << \"GLC_Instance::operator= :ID = \" << m_Uid;\n\t\/\/qDebug() << \"Number of instance\" << (*m_pNumberOfInstance);\n\tm_MatPos= inputNode.m_MatPos;\n\treturn *this;\n}\n\n\/\/ Destructor\nGLC_Instance::~GLC_Instance()\n{\n\tclear();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Get Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Get the geometry of the instance\nGLC_Geometry* GLC_Instance::getGeometry(void)\n{\n\treturn m_pGeom;\n}\n\n\n\/\/ Get the validity of the OpenGL list\nconst bool GLC_Instance::getValidity(void) const\n{\n\tif ((m_pGeom != NULL) && (m_IsValid))\n\t{\n\t\treturn m_pGeom->getValidity();\n\t}\n\telse return false;\n}\n\n\/\/ Get the bounding box\nGLC_BoundingBox GLC_Instance::getBoundingBox(void)\n{\n\tif (getBoundingBoxValidity())\n\t{\n\t\treturn *m_pBoundingBox;\n\t}\n\telse if (m_pGeom != NULL)\n\t{\n\t\tcomputeBoundingBox();\n\t\tif (m_pBoundingBox != NULL)\n\t\t{\n\t\t\treturn *m_pBoundingBox;\n\t\t}\n\t\t\n\t}\n\t\n\tGLC_BoundingBox nullBoundingBox;\n\treturn nullBoundingBox;\n}\n\n\/\/ Get the validity of the Bounding Box\nconst bool GLC_Instance::getBoundingBoxValidity(void) const\n{\n\tif ((m_pGeom != NULL) && (m_pBoundingBox != NULL))\n\t{\n\t\treturn m_pGeom->getValidity();\n\t}\n\telse return false;\n}\n\n\/\/ Clone the instance\nGLC_Instance GLC_Instance::clone() const\n{\n\tGLC_Instance cloneInstance;\n\tcloneInstance.m_pGeom= m_pGeom->clone();\n\tif (NULL != m_pBoundingBox)\n\t{\n\t\tcloneInstance.m_pBoundingBox= new GLC_BoundingBox(*m_pBoundingBox);\n\t}\n\tcloneInstance.m_MatPos= m_MatPos;\n\tcloneInstance.m_PolyFace= m_PolyFace;\n\tcloneInstance.m_PolyMode= m_PolyMode;\n\treturn cloneInstance;\n}\n\n\/\/ Instanciate the instance\nGLC_Instance GLC_Instance::instanciate()\n{\n\tGLC_Instance instance(*this);\n\tinstance.m_Uid= glc::GLC_GenID();\n\treturn instance;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/\/ Set the instance Geometry\nbool GLC_Instance::setGeometry(GLC_Geometry* pGeom)\n{\n\t\tif (NULL == m_pGeom) return false;\n\t\telse\n\t\t{\n\t\t\tm_pGeom= pGeom;\n\t\t\treturn true;\n\t\t}\n}\n\n\/\/ Geometry translation\nvoid GLC_Instance::translate(double Tx, double Ty, double Tz)\n{\n\tGLC_Matrix4x4 MatTrans(Tx, Ty, Tz);\n\t\n\tmultMatrix(MatTrans);\n}\n\n\n\/\/ move instance with a 4x4Matrix\nvoid GLC_Instance::multMatrix(const GLC_Matrix4x4 &MultMat)\n{\n\tm_MatPos= MultMat * m_MatPos;\n\n\tm_IsValid= false;\n}\n\n\/\/ Replace the instance Matrix\nvoid GLC_Instance::setMatrix(const GLC_Matrix4x4 &SetMat)\n{\n\tm_MatPos= SetMat;\n\n\tm_IsValid= false;\n}\n\n\/\/ Reset the instance Matrix\nvoid GLC_Instance::resetMatrix(void)\n{\n\tm_MatPos.setToIdentity();\n\n\tm_IsValid= false;\n}\n\n\/\/ Polygon's display style\nvoid GLC_Instance::setPolygonMode(GLenum Face, GLenum Mode)\n{\n\t\/\/ Change the polygon mode only if there is a change\n\tif ((m_PolyFace != Face) || (m_PolyMode != Mode))\n\t{\n\t\tm_PolyFace= Face;\n\t\tm_PolyMode= Mode;\n\t\tm_IsValid = false;\n\t}\n}\n\n\/\/ Select the instance\nvoid GLC_Instance::select(void)\n{\n\tm_IsSelected= true;\n\tm_IsValid= false;\n}\n\n\/\/ Unselect the instance\nvoid GLC_Instance::unselect(void)\n{\n\tm_IsSelected= false;\n\tm_IsValid= false;\n}\n\n\/\/ set Instance validity in case of multiple instance.\nvoid GLC_Instance::setInstanceValidity(void)\n{\n\tif ((m_pGeom != NULL) && (m_IsValid))\n\t{\n\t\tm_IsValid= m_pGeom->getValidity();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Display the instance\nvoid GLC_Instance::glExecute(GLenum Mode)\n{\n\tbool computeBox= false;\n\tif (NULL == m_pGeom) return;\n\t\n\t\/\/ Geometry invalid or instance\n\tif ((!m_pGeom->getValidity()) || (!m_IsValid))\n\t{\t\t\n\t\tm_IsValid= true;\n\t\tcomputeBox= true;\n\t}\n\t\/\/ Object ID for selection purpose\n\tglLoadName(getID());\n\t\/\/ Save current OpenGL Matrix\n\tglPushMatrix();\n\tglVisProperties();\n\tm_pGeom->glExecute(Mode, m_IsSelected, ((m_PolyMode != GL_FILL)));\n\t\/\/ Restore OpenGL Matrix\n\tglPopMatrix();\n\t\/\/qDebug() << \"GLC_Instance::GlExecute : Display list \" << m_ListID << \" created\";\n\t\n\tif (computeBox)\n\t{\n\t\tcomputeBoundingBox();\n\t}\n\t\n}\n\n\/\/ Set instance visualisation properties\nvoid GLC_Instance::glVisProperties()\n{\n\t\/\/ Polygons display mode\n\tglPolygonMode(m_PolyFace, m_PolyMode);\t\n\t\/\/ Change the current matrix\n\tglMultMatrixd(m_MatPos.return_dMat());\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ private services functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/\/ compute the instance bounding box\n\/\/ m_pGeom should be not null\nvoid GLC_Instance::computeBoundingBox(void)\n{\n\tif (m_pBoundingBox != NULL)\n\t{\n\t\tdelete m_pBoundingBox;\n\t\tm_pBoundingBox= NULL;\n\t}\n\t\n\tm_pBoundingBox= m_pGeom->getBoundingBox();\n\tm_pBoundingBox->transform(m_MatPos);\n\t\n}\n\n\/\/ Clear current instance\nvoid GLC_Instance::clear()\n{\n\tQ_ASSERT(m_pNumberOfInstance != NULL);\n\t\n\tif ((--(*m_pNumberOfInstance)) == 0)\n\t{\n\t\t\/\/ this is the last instance, delete the geometry\n\t\tif (m_pGeom != NULL)\n\t\t{\n\t\t\tdelete m_pGeom;\n\t\t\tm_pGeom= NULL;\n\t\t}\n\t\t\/\/ delete instance counter\n\t\t\/\/qDebug() << \"GLC_Instance::clear ID = \" << m_Uid;\n\t\t\/\/qDebug() << \"- Number of instance\" << (*m_pNumberOfInstance);\n\t\tdelete m_pNumberOfInstance;\n\t\tm_pNumberOfInstance= NULL;\n\t\t\n\t}\n\telse\n\t{\n\t\t\/\/qDebug() << \"GLC_Instance::clear ID = \" << m_Uid;\n\t\t\/\/qDebug() << \" - Number of instance\" << (*m_pNumberOfInstance);\n\t}\n\t\n\t\n\tif (m_pBoundingBox != NULL)\n\t{\n\t\tdelete m_pBoundingBox;\n\t\tm_pBoundingBox= NULL;\n\t}\n\t\t\n\t\/\/ invalidate the instance\n\tm_IsValid= false;\n\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <math\/Matrix4x4.h>\n#include <math\/Quaternion.h>\n#include <math\/Vector2.h>\n#include <math\/Vector3.h>\n#include <math\/Vector4.h>\n\n#include <render\/Material.h>\n#include <render\/Mesh.h>\n#include <render\/Node.h>\n#include <render\/Renderer.h>\n#include <render\/RenderTexture.h>\n#include <render\/SceneTree.h>\n#include <render\/Shader.h>\n#include <render\/Texture2D.h>\n#include <render\/Texture3D.h>\n\n#include <system\/Logger.h>\n#include <system\/Window.h>\n#include <system\/WindowEvent.h>\nusing namespace Sketch3D;\n\n#include <vector>\n#include <string>\n#include <time.h>\nusing namespace std;\n\n#ifdef OIS_AVAILABLE\n#include <OIS.h>\n#endif\n\n#define NUM_LIGHTS 4\n\nvoid UpdateLights(double t, Vector3 initialLightPositions[], Vector3 newLightPositions[]);\n\n#if defined(__WIN32__) || defined(_WIN32)\n#include <Windows.h>\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR szCmdLine, int iCmdShow) {\n#else\nint main(int argc, char** argv) {\n#endif\n    Window window(\"Sample_Shadow\", 1024, 768, true);\n    Renderer::GetInstance()->Initialize(RENDER_SYSTEM_OPENGL, window);\n    Renderer::GetInstance()->SetClearColor(0.2f, 0.2f, 0.2f);\n\n    \/\/ Create a render texture for the shadow map\n    RenderTexture* shadowMaps[4];\n    Texture2D* shadowMapTextures[4];\n\n    for (size_t i = 0; i < NUM_LIGHTS; i++) {\n        shadowMaps[i] = Renderer::GetInstance()->CreateRenderTexture(512, 512, TEXTURE_FORMAT_DEPTH);\n        shadowMapTextures[i] = Renderer::GetInstance()->CreateTexture2D();\n\n        shadowMapTextures[i]->SetWidth(512);\n        shadowMapTextures[i]->SetHeight(512);\n        shadowMapTextures[i]->SetTextureFormat(TEXTURE_FORMAT_DEPTH);\n        shadowMapTextures[i]->SetFilterMode(FILTER_MODE_LINEAR);\n        shadowMapTextures[i]->SetWrapMode(WRAP_MODE_CLAMP);\n    \n        if (!shadowMapTextures[i]->Create()) {\n            Logger::GetInstance()->Error(\"Couldn't create shadow map texture\");\n        }\n\n        if (!shadowMaps[i]->AttachTextureToDepthBuffer(shadowMapTextures[i])) {\n            Logger::GetInstance()->Error(\"Couldn't create shadow map\");\n        }\n    }\n\n    \/\/ Create the shader\n    vector<string> vertexInputs;\n    vertexInputs.push_back(\"in_vertex\");\n    vertexInputs.push_back(\"in_normal\");\n    vertexInputs.push_back(\"in_uv\");\n    Shader* shader = Renderer::GetInstance()->CreateShader(\"Shaders\/Shadow\/vert.glsl\", \"Shaders\/Shadow\/frag.glsl\", vertexInputs);\n    Material material(shader);\n\n    \/\/ Create the jeep\n    VertexAttributesMap_t vertexAttributes;\n    vertexAttributes[VERTEX_ATTRIBUTES_POSITION] = 0;\n    vertexAttributes[VERTEX_ATTRIBUTES_NORMAL] = 1;\n    vertexAttributes[VERTEX_ATTRIBUTES_TEX_COORDS] = 2;\n    Mesh jeepMesh(\"Media\/jeep1.3ds\", vertexAttributes);\n    Node jeepNode1;\n    jeepNode1.SetMaterial(&material);\n    jeepNode1.SetMesh(&jeepMesh);\n\n    \/\/ The jeep mesh is not oriented correctly for our needs\n    Quaternion orientation;\n    orientation.MakeFromAngleAxis(-PI_OVER_2, Vector3::RIGHT);\n\n    jeepNode1.SetOrientation(orientation);\n    Renderer::GetInstance()->GetSceneTree().AddNode(&jeepNode1);\n\n    \/\/ Create a second jeep\n    Node jeepNode2;\n    jeepNode2.SetMaterial(&material);\n    jeepNode2.SetMesh(&jeepMesh);\n    jeepNode2.SetOrientation(orientation);\n    jeepNode2.SetPosition(Vector3(-15.0f, 0.0f, -12.0f));\n    Renderer::GetInstance()->GetSceneTree().AddNode(&jeepNode2);\n\n    \/\/ Create the ground\n    Mesh groundMesh;\n\n    SurfaceTriangles_t surface;\n    surface.numVertices = 4;\n    surface.numNormals = 4;\n    surface.numTexCoords = 4;\n    surface.numIndices = 6;\n    surface.numTextures = 1;\n    surface.vertices = new Vector3[surface.numVertices];\n    surface.normals = new Vector3[surface.numNormals];\n    surface.texCoords = new Vector2[surface.numTexCoords];\n    surface.indices = new unsigned short[surface.numIndices];\n    surface.textures = new Texture2D* [surface.numTextures];\n    \n    surface.vertices[0] = Vector3(-50.0f, 0.0f, -50.0f); surface.vertices[1] = Vector3(-50.0f, 0.0f, 50.0f); surface.vertices[2] = Vector3(50.0f, 0.0f, 50.0f); surface.vertices[3] = Vector3(50.0f, 0.0f, -50.0f);\n    surface.normals[0] = surface.normals[1] = surface.normals[2] = surface.normals[3] = Vector3::UP;\n    surface.texCoords[0] = Vector2(0.0f, 0.0f); surface.texCoords[1] = Vector2(0.0f, 1.0f); surface.texCoords[2] = Vector2(1.0f, 1.0f); surface.texCoords[3] = Vector2(1.0f, 0.0f);\n    surface.indices[0] = 0; surface.indices[1] = 1; surface.indices[2] = 2; surface.indices[3] = 0; surface.indices[4] = 2; surface.indices[5] = 3;\n    surface.textures[0] = Renderer::GetInstance()->CreateTexture2DFromFile(\"Media\/tiled.jpg\");\n\n    ModelSurface_t groundSurface;\n    groundSurface.geometry = &surface;\n    groundMesh.AddSurface(groundSurface);\n\n    groundMesh.Initialize(vertexAttributes);\n\n    \/\/ Create the ground\n    Node groundNode;\n    groundNode.SetMaterial(&material);\n    groundNode.SetMesh(&groundMesh);\n    Renderer::GetInstance()->GetSceneTree().AddNode(&groundNode);\n\n    \/\/ Define some useful vectors for this sample\n    Vector3 cameraPosition(-20.0f, 15.0f, -55.0f);\n\n    \/\/ Defines the lights that we have\n    Vector3 lightPositions[4];\n    Vector4 lightColors[4];\n    Vector3 newLightPositions[4];\n\n    newLightPositions[0] = lightPositions[0] = Vector3(15.0f, 20.0f, 15.0f);\n    newLightPositions[1] = lightPositions[1] = Vector3(-40.0f, 15.0f, -30.0f);\n    newLightPositions[2] = lightPositions[2] = Vector3(15.0f, 30.0f, -20.0f);\n    newLightPositions[3] = lightPositions[3] = Vector3(-20.0f, 15.0f, 20.0f);\n    lightColors[0] = Vector4(1.0f, 1.0f, 1.0f, 100.0f);\n    lightColors[1] = Vector4(0.8f, 0.0f, 0.0f, 100.0f);\n    lightColors[2] = Vector4(0.0f, 0.8f, 0.0f, 100.0f);\n    lightColors[3] = Vector4(0.0f, 0.0f, 0.8f, 100.0f);\n\n    Matrix4x4 biasMatrix(0.5f, 0.0f, 0.0f, 0.5f,\n                         0.0f, 0.5f, 0.0f, 0.5f,\n                         0.0f, 0.0f, 0.5f, 0.5f,\n                         0.0f, 0.0f, 0.0f, 1.0f);\n\n    Renderer::GetInstance()->SetBlendingFactor(BLENDING_FACTOR_ONE, BLENDING_FACTOR_ONE);\n\n    double t = 0.0;\n    clock_t begin;\n    clock_t end;\n\n    \/\/ Initialize OIS if available\n#ifdef OIS_AVAILABLE\n    size_t windowHandle = (size_t)window.GetHandle();\n\n    OIS::ParamList paramList;\n    paramList.insert(pair<string, string>(\"WINDOW\", to_string(windowHandle)));\n    OIS::InputManager* inputManager = OIS::InputManager::createInputSystem(paramList);\n\n    OIS::Keyboard* keyboard = static_cast<OIS::Keyboard*>(inputManager->createInputObject(OIS::OISKeyboard, false));\n#endif\n\n    size_t currentLightNumber = 1;\n\n    while (window.IsOpen()) {\n        begin = clock();\n\n        WindowEvent windowEvent;\n        if (window.PollEvents(windowEvent)) {\n        }\n\n        \/\/ Movement & change the number of lights\n#ifdef OIS_AVAILABLE\n        keyboard->capture();\n\n        if (keyboard->isKeyDown(OIS::KC_1)) {\n            currentLightNumber = 1;\n        } else if (keyboard->isKeyDown(OIS::KC_2)) {\n            currentLightNumber = 2;\n        } else if (keyboard->isKeyDown(OIS::KC_3)) {\n            currentLightNumber = 3;\n        } else if (keyboard->isKeyDown(OIS::KC_4)) {\n            currentLightNumber = 4;\n        }\n#endif\n\n        Renderer::GetInstance()->EnableDepthWrite(true);\n        Renderer::GetInstance()->SetDepthComparisonFunc(DEPTH_FUNC_LESS);\n\n        \/\/ Update the lights' positions\n        UpdateLights(t, lightPositions, newLightPositions);\n\n        \/\/ First, we render from each light's perspective and record the depth in their respective shadow map\n        Renderer::GetInstance()->SetCullingMethod(CULLING_METHOD_FRONT_FACE);\n        shader->SelectSubroutine(\"recordDepth\", SHADER_TYPE_FRAGMENT);\n\n        for (size_t i = 0; i < currentLightNumber; i++) {\n            shadowMaps[i]->Bind();\n            Renderer::GetInstance()->PerspectiveProjection(65.0f, 1024.0f\/768.0f, 1.0f, 1000.0f);\n            Renderer::GetInstance()->CameraLookAt(newLightPositions[i], Vector3::ZERO, Vector3::UP);\n            Renderer::GetInstance()->Clear();\n            Renderer::GetInstance()->Render();\n        }\n\n        \/\/ Then we use the shadow maps to render the scene normally from the camera's perspective\n        Renderer::GetInstance()->BindScreenBuffer();\n        Renderer::GetInstance()->Clear();\n        shader->SelectSubroutine(\"shadeWithShadow\", SHADER_TYPE_FRAGMENT);\n        Renderer::GetInstance()->SetCullingMethod(CULLING_METHOD_BACK_FACE);\n\n        for (size_t i = 0; i < currentLightNumber; i++) {\n            \/\/ If there's more than one light, we activate additive blending to accumulate each light contribution in\n            \/\/ the framebuffer. Moreover, we disable depth writing and set the depth comparison function to less or equal\n            \/\/ to prevent Z-fighting.\n            if (i == 1) {\n                Renderer::GetInstance()->EnableDepthWrite(false);\n                Renderer::GetInstance()->SetDepthComparisonFunc(DEPTH_FUNC_EQUAL);\n                Renderer::GetInstance()->EnableBlending(true);\n            }\n\n            Renderer::GetInstance()->CameraLookAt(newLightPositions[i], Vector3::ZERO, Vector3::UP);\n            Matrix4x4 shadowMatrix = biasMatrix * Renderer::GetInstance()->GetViewProjectionMatrix();\n            shader->SetUniformMatrix4x4(\"shadowMatrix\", shadowMatrix);\n            shader->SetUniformVector3(\"light_position\", newLightPositions[i]);\n            shader->SetUniformVector4(\"light_color\", lightColors[i]);\n            material.AddTexture(\"shadowMap\", shadowMapTextures[i]);\n\n            Renderer::GetInstance()->CameraLookAt(cameraPosition, Vector3::ZERO, Vector3::UP);\n            Renderer::GetInstance()->Render();\n        }\n\n        Renderer::GetInstance()->EndRender();\n\n        if (currentLightNumber > 1) {\n            Renderer::GetInstance()->EnableBlending(false);\n        }\n\n        end = clock();\n        t += double(end - begin) \/ CLOCKS_PER_SEC;\n    }\n\n    return 0;\n}\n\nvoid UpdateLights(double t, Vector3 initialLightPositions[], Vector3 newLightPositions[]) {\n    for (size_t i = 0; i < NUM_LIGHTS; i++) {\n        float direction = (i % 2 == 0) ? 1.0f : -1.0f;\n        newLightPositions[i].x = 75.0f * float(cos(direction * t \/ (i + 1)));\n        newLightPositions[i].z = 75.0f * float(sin(direction * t \/ (i + 1)));\n    }\n}\n<commit_msg>Increased resolutions of the shadow maps<commit_after>#include <math\/Matrix4x4.h>\n#include <math\/Quaternion.h>\n#include <math\/Vector2.h>\n#include <math\/Vector3.h>\n#include <math\/Vector4.h>\n\n#include <render\/Material.h>\n#include <render\/Mesh.h>\n#include <render\/Node.h>\n#include <render\/Renderer.h>\n#include <render\/RenderTexture.h>\n#include <render\/SceneTree.h>\n#include <render\/Shader.h>\n#include <render\/Texture2D.h>\n#include <render\/Texture3D.h>\n\n#include <system\/Logger.h>\n#include <system\/Window.h>\n#include <system\/WindowEvent.h>\nusing namespace Sketch3D;\n\n#include <vector>\n#include <string>\n#include <time.h>\nusing namespace std;\n\n#ifdef OIS_AVAILABLE\n#include <OIS.h>\n#endif\n\n#define NUM_LIGHTS 4\n\nvoid UpdateLights(double t, Vector3 initialLightPositions[], Vector3 newLightPositions[]);\n\n#if defined(__WIN32__) || defined(_WIN32)\n#include <Windows.h>\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR szCmdLine, int iCmdShow) {\n#else\nint main(int argc, char** argv) {\n#endif\n    Window window(\"Sample_Shadow\", 1024, 768, true);\n    Renderer::GetInstance()->Initialize(RENDER_SYSTEM_OPENGL, window);\n    Renderer::GetInstance()->SetClearColor(0.2f, 0.2f, 0.2f);\n\n    \/\/ Create a render texture for the shadow map\n    RenderTexture* shadowMaps[4];\n    Texture2D* shadowMapTextures[4];\n\n    for (size_t i = 0; i < NUM_LIGHTS; i++) {\n        shadowMaps[i] = Renderer::GetInstance()->CreateRenderTexture(1024, 1024, TEXTURE_FORMAT_DEPTH);\n        shadowMapTextures[i] = Renderer::GetInstance()->CreateTexture2D();\n\n        shadowMapTextures[i]->SetWidth(1024);\n        shadowMapTextures[i]->SetHeight(1024);\n        shadowMapTextures[i]->SetTextureFormat(TEXTURE_FORMAT_DEPTH);\n        shadowMapTextures[i]->SetFilterMode(FILTER_MODE_LINEAR);\n        shadowMapTextures[i]->SetWrapMode(WRAP_MODE_CLAMP);\n    \n        if (!shadowMapTextures[i]->Create()) {\n            Logger::GetInstance()->Error(\"Couldn't create shadow map texture\");\n        }\n\n        if (!shadowMaps[i]->AttachTextureToDepthBuffer(shadowMapTextures[i])) {\n            Logger::GetInstance()->Error(\"Couldn't create shadow map\");\n        }\n    }\n\n    \/\/ Create the shader\n    vector<string> vertexInputs;\n    vertexInputs.push_back(\"in_vertex\");\n    vertexInputs.push_back(\"in_normal\");\n    vertexInputs.push_back(\"in_uv\");\n    Shader* shader = Renderer::GetInstance()->CreateShader(\"Shaders\/Shadow\/vert.glsl\", \"Shaders\/Shadow\/frag.glsl\", vertexInputs);\n    Material material(shader);\n\n    \/\/ Create the jeep\n    VertexAttributesMap_t vertexAttributes;\n    vertexAttributes[VERTEX_ATTRIBUTES_POSITION] = 0;\n    vertexAttributes[VERTEX_ATTRIBUTES_NORMAL] = 1;\n    vertexAttributes[VERTEX_ATTRIBUTES_TEX_COORDS] = 2;\n    Mesh jeepMesh(\"Media\/jeep1.3ds\", vertexAttributes);\n    Node jeepNode1;\n    jeepNode1.SetMaterial(&material);\n    jeepNode1.SetMesh(&jeepMesh);\n\n    \/\/ The jeep mesh is not oriented correctly for our needs\n    Quaternion orientation;\n    orientation.MakeFromAngleAxis(-PI_OVER_2, Vector3::RIGHT);\n\n    jeepNode1.SetOrientation(orientation);\n    Renderer::GetInstance()->GetSceneTree().AddNode(&jeepNode1);\n\n    \/\/ Create a second jeep\n    Node jeepNode2;\n    jeepNode2.SetMaterial(&material);\n    jeepNode2.SetMesh(&jeepMesh);\n    jeepNode2.SetOrientation(orientation);\n    jeepNode2.SetPosition(Vector3(-15.0f, 0.0f, -12.0f));\n    Renderer::GetInstance()->GetSceneTree().AddNode(&jeepNode2);\n\n    \/\/ Create the ground\n    Mesh groundMesh;\n\n    SurfaceTriangles_t surface;\n    surface.numVertices = 4;\n    surface.numNormals = 4;\n    surface.numTexCoords = 4;\n    surface.numIndices = 6;\n    surface.numTextures = 1;\n    surface.vertices = new Vector3[surface.numVertices];\n    surface.normals = new Vector3[surface.numNormals];\n    surface.texCoords = new Vector2[surface.numTexCoords];\n    surface.indices = new unsigned short[surface.numIndices];\n    surface.textures = new Texture2D* [surface.numTextures];\n    \n    surface.vertices[0] = Vector3(-50.0f, 0.0f, -50.0f); surface.vertices[1] = Vector3(-50.0f, 0.0f, 50.0f); surface.vertices[2] = Vector3(50.0f, 0.0f, 50.0f); surface.vertices[3] = Vector3(50.0f, 0.0f, -50.0f);\n    surface.normals[0] = surface.normals[1] = surface.normals[2] = surface.normals[3] = Vector3::UP;\n    surface.texCoords[0] = Vector2(0.0f, 0.0f); surface.texCoords[1] = Vector2(0.0f, 1.0f); surface.texCoords[2] = Vector2(1.0f, 1.0f); surface.texCoords[3] = Vector2(1.0f, 0.0f);\n    surface.indices[0] = 0; surface.indices[1] = 1; surface.indices[2] = 2; surface.indices[3] = 0; surface.indices[4] = 2; surface.indices[5] = 3;\n    surface.textures[0] = Renderer::GetInstance()->CreateTexture2DFromFile(\"Media\/tiled.jpg\");\n\n    ModelSurface_t groundSurface;\n    groundSurface.geometry = &surface;\n    groundMesh.AddSurface(groundSurface);\n\n    groundMesh.Initialize(vertexAttributes);\n\n    \/\/ Create the ground\n    Node groundNode;\n    groundNode.SetMaterial(&material);\n    groundNode.SetMesh(&groundMesh);\n    Renderer::GetInstance()->GetSceneTree().AddNode(&groundNode);\n\n    \/\/ Define some useful vectors for this sample\n    Vector3 cameraPosition(-20.0f, 15.0f, -55.0f);\n\n    \/\/ Defines the lights that we have\n    Vector3 lightPositions[4];\n    Vector4 lightColors[4];\n    Vector3 newLightPositions[4];\n\n    newLightPositions[0] = lightPositions[0] = Vector3(15.0f, 20.0f, 15.0f);\n    newLightPositions[1] = lightPositions[1] = Vector3(-40.0f, 15.0f, -30.0f);\n    newLightPositions[2] = lightPositions[2] = Vector3(15.0f, 30.0f, -20.0f);\n    newLightPositions[3] = lightPositions[3] = Vector3(-20.0f, 15.0f, 20.0f);\n    lightColors[0] = Vector4(1.0f, 1.0f, 1.0f, 100.0f);\n    lightColors[1] = Vector4(0.8f, 0.0f, 0.0f, 100.0f);\n    lightColors[2] = Vector4(0.0f, 0.8f, 0.0f, 100.0f);\n    lightColors[3] = Vector4(0.0f, 0.0f, 0.8f, 100.0f);\n\n    Matrix4x4 biasMatrix(0.5f, 0.0f, 0.0f, 0.5f,\n                         0.0f, 0.5f, 0.0f, 0.5f,\n                         0.0f, 0.0f, 0.5f, 0.5f,\n                         0.0f, 0.0f, 0.0f, 1.0f);\n\n    Renderer::GetInstance()->SetBlendingFactor(BLENDING_FACTOR_ONE, BLENDING_FACTOR_ONE);\n\n    double t = 0.0;\n    clock_t begin;\n    clock_t end;\n\n    \/\/ Initialize OIS if available\n#ifdef OIS_AVAILABLE\n    size_t windowHandle = (size_t)window.GetHandle();\n\n    OIS::ParamList paramList;\n    paramList.insert(pair<string, string>(\"WINDOW\", to_string(windowHandle)));\n    OIS::InputManager* inputManager = OIS::InputManager::createInputSystem(paramList);\n\n    OIS::Keyboard* keyboard = static_cast<OIS::Keyboard*>(inputManager->createInputObject(OIS::OISKeyboard, false));\n#endif\n\n    size_t currentLightNumber = 1;\n\n    while (window.IsOpen()) {\n        begin = clock();\n\n        WindowEvent windowEvent;\n        if (window.PollEvents(windowEvent)) {\n        }\n\n        \/\/ Movement & change the number of lights\n#ifdef OIS_AVAILABLE\n        keyboard->capture();\n\n        if (keyboard->isKeyDown(OIS::KC_1)) {\n            currentLightNumber = 1;\n        } else if (keyboard->isKeyDown(OIS::KC_2)) {\n            currentLightNumber = 2;\n        } else if (keyboard->isKeyDown(OIS::KC_3)) {\n            currentLightNumber = 3;\n        } else if (keyboard->isKeyDown(OIS::KC_4)) {\n            currentLightNumber = 4;\n        }\n#endif\n\n        Renderer::GetInstance()->EnableDepthWrite(true);\n        Renderer::GetInstance()->SetDepthComparisonFunc(DEPTH_FUNC_LESS);\n\n        \/\/ Update the lights' positions\n        UpdateLights(t, lightPositions, newLightPositions);\n\n        \/\/ First, we render from each light's perspective and record the depth in their respective shadow map\n        Renderer::GetInstance()->SetCullingMethod(CULLING_METHOD_FRONT_FACE);\n        shader->SelectSubroutine(\"recordDepth\", SHADER_TYPE_FRAGMENT);\n\n        for (size_t i = 0; i < currentLightNumber; i++) {\n            shadowMaps[i]->Bind();\n            Renderer::GetInstance()->PerspectiveProjection(65.0f, 1024.0f\/768.0f, 1.0f, 1000.0f);\n            Renderer::GetInstance()->CameraLookAt(newLightPositions[i], Vector3::ZERO, Vector3::UP);\n            Renderer::GetInstance()->Clear();\n            Renderer::GetInstance()->Render();\n        }\n\n        \/\/ Then we use the shadow maps to render the scene normally from the camera's perspective\n        Renderer::GetInstance()->BindScreenBuffer();\n        Renderer::GetInstance()->Clear();\n        shader->SelectSubroutine(\"shadeWithShadow\", SHADER_TYPE_FRAGMENT);\n        Renderer::GetInstance()->SetCullingMethod(CULLING_METHOD_BACK_FACE);\n\n        for (size_t i = 0; i < currentLightNumber; i++) {\n            \/\/ If there's more than one light, we activate additive blending to accumulate each light contribution in\n            \/\/ the framebuffer. Moreover, we disable depth writing and set the depth comparison function to less or equal\n            \/\/ to prevent Z-fighting.\n            if (i == 1) {\n                Renderer::GetInstance()->EnableDepthWrite(false);\n                Renderer::GetInstance()->SetDepthComparisonFunc(DEPTH_FUNC_EQUAL);\n                Renderer::GetInstance()->EnableBlending(true);\n            }\n\n            Renderer::GetInstance()->CameraLookAt(newLightPositions[i], Vector3::ZERO, Vector3::UP);\n            Matrix4x4 shadowMatrix = biasMatrix * Renderer::GetInstance()->GetViewProjectionMatrix();\n            shader->SetUniformMatrix4x4(\"shadowMatrix\", shadowMatrix);\n            shader->SetUniformVector3(\"light_position\", newLightPositions[i]);\n            shader->SetUniformVector4(\"light_color\", lightColors[i]);\n            material.AddTexture(\"shadowMap\", shadowMapTextures[i]);\n\n            Renderer::GetInstance()->CameraLookAt(cameraPosition, Vector3::ZERO, Vector3::UP);\n            Renderer::GetInstance()->Render();\n        }\n\n        Renderer::GetInstance()->EndRender();\n\n        if (currentLightNumber > 1) {\n            Renderer::GetInstance()->EnableBlending(false);\n        }\n\n        end = clock();\n        t += double(end - begin) \/ CLOCKS_PER_SEC;\n    }\n\n    return 0;\n}\n\nvoid UpdateLights(double t, Vector3 initialLightPositions[], Vector3 newLightPositions[]) {\n    for (size_t i = 0; i < NUM_LIGHTS; i++) {\n        float direction = (i % 2 == 0) ? 1.0f : -1.0f;\n        newLightPositions[i].x = 75.0f * float(cos(direction * t \/ (i + 1)));\n        newLightPositions[i].z = 75.0f * float(sin(direction * t \/ (i + 1)));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2016 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include <jni.h>\n#include \"core\/android\/ApplicationAndroid.h\"\n#include \"core\/Engine.h\"\n#include \"graphics\/Renderer.h\"\n#include \"files\/FileSystem.h\"\n#include \"input\/Input.h\"\n#include \"utils\/Utils.h\"\n\nouzel::ApplicationAndroid application;\n\nextern \"C\"\n{\n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_setAssetManager(JNIEnv* env, jclass cls, jobject assetManager)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n        \n        ouzel::assetManager = AAssetManager_fromJava(env, assetManager);\n    }\n\n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_onSurfaceCreated(JNIEnv* env, jclass cls)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        application.run();\n    }\n\n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_onSurfaceChanged(JNIEnv* env, jclass cls, jint width, jint height)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        if (ouzel::sharedEngine)\n        {\n            ouzel::sharedEngine->getWindow()->setSize(ouzel::Size2(static_cast<float>(width), static_cast<float>(height)));\n        }\n    }\n\n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_onDrawFrame(JNIEnv* env, jclass cls)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        if (ouzel::sharedEngine)\n        {\n            ouzel::sharedEngine->draw();\n        }\n    }\n    \n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_handleActionDown(JNIEnv* env, jclass cls, jint pointerId, jfloat x, jfloat y)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        ouzel::sharedEngine->getInput()->touchBegin(static_cast<uint64_t>(pointerId),\n                                                    ouzel::sharedEngine->getRenderer()->screenToClipLocation(ouzel::Vector2(x, y)));\n    }\n    \n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_handleActionMove(JNIEnv* env, jclass cls, jint pointerId, jfloat x, jfloat y)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        ouzel::sharedEngine->getInput()->touchMove(static_cast<uint64_t>(pointerId),\n                                                   ouzel::sharedEngine->getRenderer()->screenToClipLocation(ouzel::Vector2(x, y)));\n    }\n    \n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_handleActionUp(JNIEnv* env, jclass cls, jint pointerId, jfloat x, jfloat y)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        ouzel::sharedEngine->getInput()->touchEnd(static_cast<uint64_t>(pointerId),\n                                                  ouzel::sharedEngine->getRenderer()->screenToClipLocation(ouzel::Vector2(x, y)));\n    }\n    \n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_handleActionCancel(JNIEnv* env, jclass cls, jint pointerId, jfloat x, jfloat y)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        ouzel::sharedEngine->getInput()->touchCancel(static_cast<uint64_t>(pointerId),\n                                                     ouzel::sharedEngine->getRenderer()->screenToClipLocation(ouzel::Vector2(x, y)));\n    }\n}\n<commit_msg>Fix Android build<commit_after>\/\/ Copyright (C) 2016 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include <jni.h>\n#include \"core\/android\/ApplicationAndroid.h\"\n#include \"core\/Engine.h\"\n#include \"graphics\/Renderer.h\"\n#include \"files\/FileSystem.h\"\n#include \"input\/Input.h\"\n#include \"utils\/Utils.h\"\n\nouzel::ApplicationAndroid application;\n\nextern \"C\"\n{\n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_setAssetManager(JNIEnv* env, jclass cls, jobject assetManager)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n        \n        ouzel::assetManager = AAssetManager_fromJava(env, assetManager);\n    }\n\n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_onSurfaceCreated(JNIEnv* env, jclass cls)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        application.run();\n    }\n\n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_onSurfaceChanged(JNIEnv* env, jclass cls, jint width, jint height)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        if (ouzel::sharedEngine)\n        {\n            ouzel::sharedEngine->getWindow()->setSize(ouzel::Size2(static_cast<float>(width), static_cast<float>(height)));\n        }\n    }\n\n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_onDrawFrame(JNIEnv* env, jclass cls)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        if (ouzel::sharedEngine)\n        {\n            ouzel::sharedEngine->draw();\n        }\n    }\n    \n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_handleActionDown(JNIEnv* env, jclass cls, jint pointerId, jfloat x, jfloat y)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        ouzel::sharedEngine->getInput()->touchBegin(static_cast<uint64_t>(pointerId),\n                                                    ouzel::sharedEngine->getRenderer()->screenToNormalizedLocation(ouzel::Vector2(x, y)));\n    }\n    \n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_handleActionMove(JNIEnv* env, jclass cls, jint pointerId, jfloat x, jfloat y)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        ouzel::sharedEngine->getInput()->touchMove(static_cast<uint64_t>(pointerId),\n                                                   ouzel::sharedEngine->getRenderer()->screenToNormalizedLocation(ouzel::Vector2(x, y)));\n    }\n    \n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_handleActionUp(JNIEnv* env, jclass cls, jint pointerId, jfloat x, jfloat y)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        ouzel::sharedEngine->getInput()->touchEnd(static_cast<uint64_t>(pointerId),\n                                                  ouzel::sharedEngine->getRenderer()->screenToNormalizedLocation(ouzel::Vector2(x, y)));\n    }\n    \n    JNIEXPORT void JNICALL Java_lv_elviss_ouzel_OuzelLibJNIWrapper_handleActionCancel(JNIEnv* env, jclass cls, jint pointerId, jfloat x, jfloat y)\n    {\n        OUZEL_UNUSED(env);\n        OUZEL_UNUSED(cls);\n\n        ouzel::sharedEngine->getInput()->touchCancel(static_cast<uint64_t>(pointerId),\n                                                     ouzel::sharedEngine->getRenderer()->screenToNormalizedLocation(ouzel::Vector2(x, y)));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the KDE project\n    Copyright (C) 2006 Matthias Kretz <kretz@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 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., 51 Franklin Street, Fifth Floor,\n    Boston, MA 02110-1301, USA.\n\n*\/\n\n#include \"globalconfig.h\"\n\n#include \"factory.h\"\n#include \"objectdescription.h\"\n#include \"phonondefs_p.h\"\n#include \"backendinterface.h\"\n\n#include <QtCore\/QList>\n#include <QtCore\/QVariant>\n\nnamespace Phonon\n{\nclass QSettingsGroup\n{\n    public:\n        QSettingsGroup(const QSettings *settings, const QString &name)\n            : m_s(settings),\n            m_group(name + QLatin1Char('\/'))\n        {\n        }\n\n        template<typename T>\n        inline T value(const QString &key, const T &def) const\n        {\n            return qvariant_cast<T>(value(key, QVariant::fromValue(def)));\n        }\n\n        QVariant value(const QString &key, const QVariant &def) const\n        {\n            return m_s->value(m_group + key, def);\n        }\n\n    private:\n        const QSettings *const m_s;\n        QString m_group;\n};\n\nGlobalConfig::GlobalConfig(QObject *parent)\n    : QObject(parent)\n    , m_config(QLatin1String(\"kde.org\"), QLatin1String(\"libphonon\"))\n{\n}\n\nGlobalConfig::~GlobalConfig()\n{\n}\n\nQList<int> GlobalConfig::audioOutputDeviceListFor(Phonon::Category category) const\n{\n    \/\/The devices need to be stored independently for every backend\n    const QSettingsGroup backendConfig(&m_config, QLatin1String(\"AudioOutputDevice_\") + Factory::identifier());\n\n    \/\/First we lookup the available devices directly from the backend\n    BackendInterface *backendIface = qobject_cast<BackendInterface *>(Factory::backend());\n    if (!backendIface) {\n        return QList<int>();\n    }\n    QList<int> defaultList = backendIface->objectDescriptionIndexes(Phonon::AudioOutputDeviceType);\n\n    \/\/Now the list from m_config\n    const QString categoryKey = QLatin1String(\"Category\") + QString::number(static_cast<int>(category));\n    QList<int> deviceList = backendConfig.value(categoryKey, QList<int>());\n    if (deviceList.isEmpty()) {\n        \/\/try to read from global group for defaults\n        const QSettingsGroup globalConfig(&m_config, QLatin1String(\"AudioOutputDevice\"));\n        deviceList = globalConfig.value(categoryKey, QList<int>());\n    }\n\n    QMutableListIterator<int> i(deviceList);\n    while (i.hasNext())\n        if (0 == defaultList.removeAll(i.next()))\n            \/\/if there are devices in m_config that the backend doesn't report, remove them from the list\n            i.remove();\n    \/\/if the backend reports more devices that are not in m_config append them to the list\n    if (defaultList.size() > 1) {\n        \/\/ initial order is important\n        QMap<int, int> orderedList;\n        QList<int> noPrefList; \/\/list with no preference\n        foreach (int index, defaultList) {\n            const QHash<QByteArray, QVariant> properties = backendIface->objectDescriptionProperties(Phonon::AudioOutputDeviceType, index);\n            QVariant var = properties.value(\"initialPreference\");\n            if (var.isValid())\n                orderedList.insertMulti(-var.toInt(), index);\n            else\n                noPrefList += index;\n        }\n        defaultList = orderedList.values() + noPrefList;\n    }\n    deviceList += defaultList;\n\n    return deviceList;\n}\n\nint GlobalConfig::audioOutputDeviceFor(Phonon::Category category) const\n{\n    QList<int> ret = audioOutputDeviceListFor(category);\n    if (ret.isEmpty())\n        return -1;\n    return ret.first();\n}\n\n\/*QList<int> GlobalConfig::audioCaptureDeviceList() const\n{\n    \/\/First we lookup the available devices directly from the backend\n    BackendInterface *backendIface = qobject_cast<BackendInterface *>(Factory::backend());\n    if (!backendIface) {\n        return QList<int>();\n    }\n    QList<int> deviceIndexes = backendIface->objectDescriptionIndexes(Phonon::AudioCaptureDeviceType);\n\n    QList<int> defaultList = deviceIndexes;\n\n    \/\/Now the list from m_config\n    \/\/The devices need to be stored independently for every backend\n    const QSettingsGroup backendConfig(&m_config, QLatin1String(\"AudioCaptureDevice_\") +\n            Factory::identifier());\n    QList<int> deviceList = backendConfig.value(QLatin1String(\"DeviceOrder\"), QList<int>());\n    if (deviceList.isEmpty()) {\n        \/\/try to read from global group for defaults\n        const QSettingsGroup globalConfig(&m_config, QLatin1String(\"AudioCaptureDevice\"));\n        deviceList = globalConfig.value(QLatin1String(\"DeviceOrder\"), defaultList);\n    }\n\n    QMutableListIterator<int> i(deviceList);\n    while (i.hasNext()) {\n        if (0 == defaultList.removeAll(i.next())) {\n            \/\/if there are devices in m_config that the backend doesn't report, remove them from the list\n            i.remove();\n        }\n    }\n    \/\/if the backend reports more devices that are not in m_config append them to the list\n    deviceList += defaultList;\n\n    return deviceList;\n}\n\nint GlobalConfig::audioCaptureDevice() const\n{\n    return audioCaptureDeviceList().first();\n}*\/\n\n} \/\/ namespace Phonon\n\n#include \"moc_globalconfig.cpp\"\n\n\/\/ vim: sw=4 ts=4\n<commit_msg>- remove initialPreference reordering as it's unnecessary now that the list returned from the backend already is in initialPreference order - filter out devices marked as isAdvanced if advanced devices should be hidden - if there's no order defined for a given category look for the order of NoCategory and only then use the initial order<commit_after>\/*  This file is part of the KDE project\n    Copyright (C) 2006 Matthias Kretz <kretz@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 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., 51 Franklin Street, Fifth Floor,\n    Boston, MA 02110-1301, USA.\n\n*\/\n\n#include \"globalconfig.h\"\n\n#include \"factory.h\"\n#include \"objectdescription.h\"\n#include \"phonondefs_p.h\"\n#include \"backendinterface.h\"\n\n#include <QtCore\/QList>\n#include <QtCore\/QVariant>\n\nnamespace Phonon\n{\nclass QSettingsGroup\n{\n    public:\n        QSettingsGroup(const QSettings *settings, const QString &name)\n            : m_s(settings),\n            m_group(name + QLatin1Char('\/'))\n        {\n        }\n\n        template<typename T>\n        inline T value(const QString &key, const T &def) const\n        {\n            return qvariant_cast<T>(value(key, QVariant::fromValue(def)));\n        }\n\n        QVariant value(const QString &key, const QVariant &def) const\n        {\n            return m_s->value(m_group + key, def);\n        }\n\n        bool hasKey(const QString &key) const\n        {\n            return m_s->contains(m_group + key);\n        }\n\n    private:\n        const QSettings *const m_s;\n        QString m_group;\n};\n\nGlobalConfig::GlobalConfig(QObject *parent)\n    : QObject(parent)\n    , m_config(QLatin1String(\"kde.org\"), QLatin1String(\"libphonon\"))\n{\n}\n\nGlobalConfig::~GlobalConfig()\n{\n}\n\nstatic void filterAdvanced(BackendInterface *backendIface, QList<int> *list)\n{\n    QMutableListIterator<int> it(*list);\n    while (it.hasNext()) {\n        const QHash<QByteArray, QVariant> properties = backendIface->objectDescriptionProperties(Phonon::AudioOutputDeviceType, it.next());\n        QVariant var = properties.value(\"isAdvanced\");\n        if (var.isValid() && var.toBool()) {\n            it.remove();\n        }\n    }\n}\n\nQList<int> GlobalConfig::audioOutputDeviceListFor(Phonon::Category category) const\n{\n    \/\/The devices need to be stored independently for every backend\n    const QSettingsGroup backendConfig(&m_config, QLatin1String(\"AudioOutputDevice\")); \/\/ + Factory::identifier());\n    const QSettingsGroup generalGroup(&m_config, QLatin1String(\"General\"));\n    const bool hideAdvancedDevices = generalGroup.value(QLatin1String(\"HideAdvancedDevices\"), true);\n\n    \/\/First we lookup the available devices directly from the backend\n    BackendInterface *backendIface = qobject_cast<BackendInterface *>(Factory::backend());\n    if (!backendIface) {\n        return QList<int>();\n    }\n\n    \/\/ this list already is in default order (as defined by the backend)\n    QList<int> defaultList = backendIface->objectDescriptionIndexes(Phonon::AudioOutputDeviceType);\n    if (hideAdvancedDevices) {\n        filterAdvanced(backendIface, &defaultList);\n    }\n\n    QString categoryKey = QLatin1String(\"Category\") + QString::number(static_cast<int>(category));\n    if (!backendConfig.hasKey(categoryKey)) {\n        \/\/ no list in config for the given category\n        QString categoryKey = QLatin1String(\"Category\") + QString::number(static_cast<int>(Phonon::NoCategory));\n        if (!backendConfig.hasKey(categoryKey)) {\n            \/\/ no list in config for NoCategory\n            return defaultList;\n        }\n    }\n\n    \/\/Now the list from m_config\n    QList<int> deviceList = backendConfig.value(categoryKey, QList<int>());\n\n    \/\/if there are devices in m_config that the backend doesn't report, remove them from the list\n    QMutableListIterator<int> i(deviceList);\n    while (i.hasNext()) {\n        if (0 == defaultList.removeAll(i.next())) {\n            i.remove();\n        }\n    }\n\n    \/\/if the backend reports more devices that are not in m_config append them to the list\n    deviceList += defaultList;\n\n    return deviceList;\n}\n\nint GlobalConfig::audioOutputDeviceFor(Phonon::Category category) const\n{\n    QList<int> ret = audioOutputDeviceListFor(category);\n    if (ret.isEmpty())\n        return -1;\n    return ret.first();\n}\n\n\/*QList<int> GlobalConfig::audioCaptureDeviceList() const\n{\n    \/\/First we lookup the available devices directly from the backend\n    BackendInterface *backendIface = qobject_cast<BackendInterface *>(Factory::backend());\n    if (!backendIface) {\n        return QList<int>();\n    }\n    QList<int> deviceIndexes = backendIface->objectDescriptionIndexes(Phonon::AudioCaptureDeviceType);\n\n    QList<int> defaultList = deviceIndexes;\n\n    \/\/Now the list from m_config\n    \/\/The devices need to be stored independently for every backend\n    const QSettingsGroup backendConfig(&m_config, QLatin1String(\"AudioCaptureDevice_\") +\n            Factory::identifier());\n    QList<int> deviceList = backendConfig.value(QLatin1String(\"DeviceOrder\"), QList<int>());\n    if (deviceList.isEmpty()) {\n        \/\/try to read from global group for defaults\n        const QSettingsGroup globalConfig(&m_config, QLatin1String(\"AudioCaptureDevice\"));\n        deviceList = globalConfig.value(QLatin1String(\"DeviceOrder\"), defaultList);\n    }\n\n    QMutableListIterator<int> i(deviceList);\n    while (i.hasNext()) {\n        if (0 == defaultList.removeAll(i.next())) {\n            \/\/if there are devices in m_config that the backend doesn't report, remove them from the list\n            i.remove();\n        }\n    }\n    \/\/if the backend reports more devices that are not in m_config append them to the list\n    deviceList += defaultList;\n\n    return deviceList;\n}\n\nint GlobalConfig::audioCaptureDevice() const\n{\n    return audioCaptureDeviceList().first();\n}*\/\n\n} \/\/ namespace Phonon\n\n#include \"moc_globalconfig.cpp\"\n\n\/\/ vim: sw=4 ts=4\n<|endoftext|>"}
{"text":"<commit_before>#include \"gm.h\"\n#include \"SkBitmap.h\"\n#include \"SkShader.h\"\n#include \"SkXfermode.h\"\n\nnamespace skiagm {\n\nstatic void make_bitmaps(int w, int h, SkBitmap* src, SkBitmap* dst) {    \n    src->setConfig(SkBitmap::kARGB_8888_Config, w, h);\n    src->allocPixels();\n    src->eraseColor(0);\n\n    SkCanvas c(*src);\n    SkPaint p;\n    SkRect r;\n    SkScalar ww = SkIntToScalar(w);\n    SkScalar hh = SkIntToScalar(h);\n\n    p.setAntiAlias(true);\n    p.setColor(0xFFFFCC44);    \n    r.set(0, 0, ww*3\/4, hh*3\/4);\n    c.drawOval(r, p);\n    \n    dst->setConfig(SkBitmap::kARGB_8888_Config, w, h);\n    dst->allocPixels();\n    dst->eraseColor(0);\n    c.setBitmapDevice(*dst);\n\n    p.setColor(0xFF66AAFF);\n    r.set(ww\/3, hh\/3, ww*19\/20, hh*19\/20);\n    c.drawRect(r, p);\n}\n\nstatic uint16_t gBG[] = { 0xFFFF, 0xCCCF, 0xCCCF, 0xFFFF };\n\nclass XfermodesGM : public GM {\n    SkBitmap    fBitmap;\n    SkBitmap    fBG;\n    SkBitmap    fSrcB, fDstB;\n\n    void draw_mode(SkCanvas* canvas, SkXfermode* mode, int alpha) {\n        SkPaint p;\n        \n        canvas->drawBitmap(fSrcB, 0, 0, &p);        \n        p.setAlpha(alpha);\n        p.setXfermode(mode);\n        canvas->drawBitmap(fDstB, 0, 0, &p);\n    }\n    \npublic:\n\tXfermodesGM() {\n        const int W = 64;\n        const int H = 64;\n        \n        fBitmap.setConfig(SkBitmap::kARGB_8888_Config, W, H);\n        fBitmap.allocPixels();\n        \n        fBG.setConfig(SkBitmap::kARGB_4444_Config, 2, 2, 4);\n        fBG.setPixels(gBG);\n        fBG.setIsOpaque(true);\n        \n        make_bitmaps(W, H, &fSrcB, &fDstB);\n    }\n    \nprotected:\n    SkString onShortName() {\n        return SkString(\"xfermodes\");\n    }\n\n\tSkISize onISize() { return make_isize(640, 380); }\n\n    void drawBG(SkCanvas* canvas) {\n        canvas->drawColor(SK_ColorWHITE);\n        return;\n        SkShader* s = SkShader::CreateBitmapShader(fBG,\n                                                   SkShader::kRepeat_TileMode,\n                                                   SkShader::kRepeat_TileMode);\n        SkPaint p;\n        SkMatrix m;\n        \n        p.setShader(s)->unref();\n        m.setScale(SkIntToScalar(8), SkIntToScalar(8));\n        s->setLocalMatrix(m);\n        canvas->drawPaint(p);\n    }\n    \n    virtual void onDraw(SkCanvas* canvas) {\n        this->drawBG(canvas);\n        \n        const struct {\n            SkPorterDuff::Mode  fMode;\n            const char*         fLabel;\n        } gModes[] = {\n            { SkPorterDuff::kClear_Mode,    \"Clear\"     },\n            { SkPorterDuff::kSrc_Mode,      \"Src\"       },\n            { SkPorterDuff::kDst_Mode,      \"Dst\"       },\n            { SkPorterDuff::kSrcOver_Mode,  \"SrcOver\"   },\n            { SkPorterDuff::kDstOver_Mode,  \"DstOver\"   },\n            { SkPorterDuff::kSrcIn_Mode,    \"SrcIn\"     },\n            { SkPorterDuff::kDstIn_Mode,    \"DstIn\"     },\n            { SkPorterDuff::kSrcOut_Mode,   \"SrcOut\"    },\n            { SkPorterDuff::kDstOut_Mode,   \"DstOut\"    },\n            { SkPorterDuff::kSrcATop_Mode,  \"SrcATop\"   },\n            { SkPorterDuff::kDstATop_Mode,  \"DstATop\"   },\n            { SkPorterDuff::kXor_Mode,      \"Xor\"       },\n            { SkPorterDuff::kDarken_Mode,   \"Darken\"    },\n            { SkPorterDuff::kLighten_Mode,  \"Lighten\"   },\n            { SkPorterDuff::kMultiply_Mode, \"Multiply\"  },\n            { SkPorterDuff::kScreen_Mode,   \"Screen\"    }\n        };\n        \n        canvas->translate(SkIntToScalar(10), SkIntToScalar(20));\n        \n        SkCanvas c(fBitmap);\n        const SkScalar w = SkIntToScalar(fBitmap.width());\n        const SkScalar h = SkIntToScalar(fBitmap.height());\n        SkShader* s = SkShader::CreateBitmapShader(fBG,\n                                                   SkShader::kRepeat_TileMode,\n                                                   SkShader::kRepeat_TileMode);\n        SkMatrix m;\n        m.setScale(SkIntToScalar(6), SkIntToScalar(6));\n        s->setLocalMatrix(m);\n        \n        SkPaint labelP;\n        labelP.setAntiAlias(true);\n        labelP.setTextAlign(SkPaint::kCenter_Align);\n\n        SkScalar x0 = 0;\n        for (int twice = 0; twice < 2; twice++) {\n            SkScalar x = x0, y = 0;\n            for (size_t i = 0; i < SK_ARRAY_COUNT(gModes); i++) {\n                SkXfermode* mode = SkPorterDuff::CreateXfermode(gModes[i].fMode);\n\n                fBitmap.eraseColor(0);\n                draw_mode(&c, mode, twice ? 0x88 : 0xFF);\n                mode->safeUnref();\n                \n                SkPaint p;\n                SkRect r;\n                r.set(x, y, x+w, y+h);\n                r.inset(-SK_ScalarHalf, -SK_ScalarHalf);\n                p.setStyle(SkPaint::kStroke_Style);\n                canvas->drawRect(r, p);\n                p.setStyle(SkPaint::kFill_Style);\n                p.setShader(s);\n                r.inset(SK_ScalarHalf, SK_ScalarHalf);\n                canvas->drawRect(r, p);\n\n                canvas->drawBitmap(fBitmap, x, y, NULL);\n\n#if 1\n                canvas->drawText(gModes[i].fLabel, strlen(gModes[i].fLabel),\n                                 x + w\/2, y - labelP.getTextSize()\/2, labelP);\n#endif\n                x += w + SkIntToScalar(10);\n                if ((i & 3) == 3) {\n                    x = x0;\n                    y += h + SkIntToScalar(30);\n                }\n            }\n            x0 += SkIntToScalar(330);\n        }\n        s->unref();\n    }\n\nprivate:\n    typedef GM INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic GM* MyFactory(void*) { return new XfermodesGM; }\nstatic GMRegistry reg(MyFactory);\n\n}\n\n<commit_msg>update to use new xfermodes<commit_after>#include \"gm.h\"\n#include \"SkBitmap.h\"\n#include \"SkShader.h\"\n#include \"SkXfermode.h\"\n\nnamespace skiagm {\n\nstatic void make_bitmaps(int w, int h, SkBitmap* src, SkBitmap* dst) {    \n    src->setConfig(SkBitmap::kARGB_8888_Config, w, h);\n    src->allocPixels();\n    src->eraseColor(0);\n\n    SkCanvas c(*src);\n    SkPaint p;\n    SkRect r;\n    SkScalar ww = SkIntToScalar(w);\n    SkScalar hh = SkIntToScalar(h);\n\n    p.setAntiAlias(true);\n    p.setColor(0xFFFFCC44);    \n    r.set(0, 0, ww*3\/4, hh*3\/4);\n    c.drawOval(r, p);\n    \n    dst->setConfig(SkBitmap::kARGB_8888_Config, w, h);\n    dst->allocPixels();\n    dst->eraseColor(0);\n    c.setBitmapDevice(*dst);\n\n    p.setColor(0xFF66AAFF);\n    r.set(ww\/3, hh\/3, ww*19\/20, hh*19\/20);\n    c.drawRect(r, p);\n}\n\nstatic uint16_t gBG[] = { 0xFFFF, 0xCCCF, 0xCCCF, 0xFFFF };\n\nclass XfermodesGM : public GM {\n    SkBitmap    fBitmap;\n    SkBitmap    fBG;\n    SkBitmap    fSrcB, fDstB;\n\n    void draw_mode(SkCanvas* canvas, SkXfermode* mode, int alpha) {\n        SkPaint p;\n        \n        canvas->drawBitmap(fSrcB, 0, 0, &p);        \n        p.setAlpha(alpha);\n        p.setXfermode(mode);\n        canvas->drawBitmap(fDstB, 0, 0, &p);\n    }\n    \npublic:\n\tXfermodesGM() {\n        const int W = 64;\n        const int H = 64;\n        \n        fBitmap.setConfig(SkBitmap::kARGB_8888_Config, W, H);\n        fBitmap.allocPixels();\n        \n        fBG.setConfig(SkBitmap::kARGB_4444_Config, 2, 2, 4);\n        fBG.setPixels(gBG);\n        fBG.setIsOpaque(true);\n        \n        make_bitmaps(W, H, &fSrcB, &fDstB);\n    }\n    \nprotected:\n    SkString onShortName() {\n        return SkString(\"xfermodes\");\n    }\n\n\tSkISize onISize() { return make_isize(790, 480); }\n\n    void drawBG(SkCanvas* canvas) {\n        canvas->drawColor(SK_ColorWHITE);\n        return;\n        SkShader* s = SkShader::CreateBitmapShader(fBG,\n                                                   SkShader::kRepeat_TileMode,\n                                                   SkShader::kRepeat_TileMode);\n        SkPaint p;\n        SkMatrix m;\n        \n        p.setShader(s)->unref();\n        m.setScale(SkIntToScalar(8), SkIntToScalar(8));\n        s->setLocalMatrix(m);\n        canvas->drawPaint(p);\n    }\n    \n    virtual void onDraw(SkCanvas* canvas) {\n        this->drawBG(canvas);\n        \n        const struct {\n            SkXfermode::Mode    fMode;\n            const char*         fLabel;\n        } gModes[] = {\n            { SkXfermode::kClear_Mode,    \"Clear\"     },\n            { SkXfermode::kSrc_Mode,      \"Src\"       },\n            { SkXfermode::kDst_Mode,      \"Dst\"       },\n            { SkXfermode::kSrcOver_Mode,  \"SrcOver\"   },\n            { SkXfermode::kDstOver_Mode,  \"DstOver\"   },\n            { SkXfermode::kSrcIn_Mode,    \"SrcIn\"     },\n            { SkXfermode::kDstIn_Mode,    \"DstIn\"     },\n            { SkXfermode::kSrcOut_Mode,   \"SrcOut\"    },\n            { SkXfermode::kDstOut_Mode,   \"DstOut\"    },\n            { SkXfermode::kSrcATop_Mode,  \"SrcATop\"   },\n            { SkXfermode::kDstATop_Mode,  \"DstATop\"   },\n            { SkXfermode::kXor_Mode,      \"Xor\"       },\n            \n            { SkXfermode::kPlus_Mode,         \"Plus\"          },\n            { SkXfermode::kMultiply_Mode,     \"Multiply\"      },\n            { SkXfermode::kScreen_Mode,       \"Screen\"        },\n            { SkXfermode::kOverlay_Mode,      \"Overlay\"       },\n            { SkXfermode::kDarken_Mode,       \"Darken\"        },\n            { SkXfermode::kLighten_Mode,      \"Lighten\"       },\n            { SkXfermode::kColorDodge_Mode,   \"ColorDodge\"    },\n            { SkXfermode::kColorBurn_Mode,    \"ColorBurn\"     },\n            { SkXfermode::kHardLight_Mode,    \"HardLight\"     },\n            { SkXfermode::kSoftLight_Mode,    \"SoftLight\"     },\n            { SkXfermode::kDifference_Mode,   \"Difference\"    },\n            { SkXfermode::kExclusion_Mode,    \"Exclusion\"     },\n        };\n        \n        canvas->translate(SkIntToScalar(10), SkIntToScalar(20));\n        \n        SkCanvas c(fBitmap);\n        const SkScalar w = SkIntToScalar(fBitmap.width());\n        const SkScalar h = SkIntToScalar(fBitmap.height());\n        SkShader* s = SkShader::CreateBitmapShader(fBG,\n                                                   SkShader::kRepeat_TileMode,\n                                                   SkShader::kRepeat_TileMode);\n        SkMatrix m;\n        m.setScale(SkIntToScalar(6), SkIntToScalar(6));\n        s->setLocalMatrix(m);\n        \n        SkPaint labelP;\n        labelP.setAntiAlias(true);\n        labelP.setTextAlign(SkPaint::kCenter_Align);\n\n        const int W = 5;\n        \n        SkScalar x0 = 0;\n        for (int twice = 0; twice < 2; twice++) {\n            SkScalar x = x0, y = 0;\n            for (size_t i = 0; i < SK_ARRAY_COUNT(gModes); i++) {\n                SkXfermode* mode = SkXfermode::Create(gModes[i].fMode);\n                \n                fBitmap.eraseColor(0);\n                draw_mode(&c, mode, twice ? 0x88 : 0xFF);\n                SkSafeUnref(mode);\n                \n                SkPaint p;\n                SkRect r;\n                r.set(x, y, x+w, y+h);\n                r.inset(-SK_ScalarHalf, -SK_ScalarHalf);\n                p.setStyle(SkPaint::kStroke_Style);\n                canvas->drawRect(r, p);\n                p.setStyle(SkPaint::kFill_Style);\n                p.setShader(s);\n                r.inset(SK_ScalarHalf, SK_ScalarHalf);\n                canvas->drawRect(r, p);\n                \n                canvas->drawBitmap(fBitmap, x, y, NULL);\n                \n                canvas->drawText(gModes[i].fLabel, strlen(gModes[i].fLabel),\n                                 x + w\/2, y - labelP.getTextSize()\/2, labelP);\n                \n                x += w + SkIntToScalar(10);\n                if ((i % W) == W - 1) {\n                    x = x0;\n                    y += h + SkIntToScalar(30);\n                }\n            }\n            x0 += SkIntToScalar(400);\n        }\n        s->unref();\n    }\n\nprivate:\n    typedef GM INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic GM* MyFactory(void*) { return new XfermodesGM; }\nstatic GMRegistry reg(MyFactory);\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n\nint main()\n{\n    std::vector<int> ivec{ 1, 2, 3, 4, 5, 6, 7, 8, 9 };\n    for (auto &i : ivec)\n        i = (i % 2) ? (i * 2) : i;\n\n    \/\/Check\n    for (auto i : ivec)\n        std::cout << i << \" \";\n    std::cout << std::endl;\n\n    return 0;\n}\n<commit_msg>Update ex4_21.cpp<commit_after>#include <iostream>\n#include <vector>\n\nusing std::cout;\nusing std::endl;\nusing std::vector;\n\nint main()\n{\n    vector<int> ivec{ 1, 2, 3, 4, 5, 6, 7, 8, 9 };\n\n    for (auto i : ivec) {\n        cout << ((i & 0x1) ? i * 2 : i) << \" \";\n    }\n    cout << endl;\n    \n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode:C++; c-file-style:\"gnu\"; indent-tabs-mode:nil; -*- *\/\n\n#include \"ns3\/object.h\"\n#include \"ns3\/global-value.h\"\n#include \"ns3\/core-module.h\"\n#include \"ns3\/csma-module.h\"\n#include \"ns3\/internet-module.h\"\n#include \"ns3\/applications-module.h\"\n#include <ns3\/gnuplot.h>\n#include <sstream>\n\n\n#include \"Observador.h\"\n\n#define STARTTIME 2.0\n#define STOPTIME  100.0\n#define T_STUDENT_VALUE 2.2622\n\ntypedef struct datos {\n    double mediaNumIntentosTotales;\n    double mediaTiempoEcoTotal;\n    double mediaPorcentajeErrorClientes;\n} DATOS; \n\nusing namespace ns3;\n\nNS_LOG_COMPONENT_DEFINE (\"practica05\");\n\n\nDATOS simulacion (uint32_t nCsma, Time retardoProp, DataRate capacidad, \n        uint32_t tamPaquete, Time intervalo, uint32_t maxReintentos) {\n    \n    NodeContainer csmaNodes;\n    csmaNodes.Create (nCsma);\n\n    CsmaHelper csma;\n    csma.SetChannelAttribute (\"DataRate\", DataRateValue (capacidad));\n    csma.SetChannelAttribute (\"Delay\", TimeValue (retardoProp));\n\n    NetDeviceContainer csmaDevices;\n    csmaDevices = csma.Install (csmaNodes);\n    \/\/ Instalamos la pila TCP\/IP en todos los nodos\n    InternetStackHelper stack;\n    stack.Install (csmaNodes);\n    \/\/ Y les asignamos direcciones\n    Ipv4AddressHelper address;\n    address.SetBase (\"10.1.2.0\", \"255.255.255.0\");\n    Ipv4InterfaceContainer csmaInterfaces = address.Assign (csmaDevices);\n\n    \/\/\/\/\/\/\/\/\/\/\/ Instalación de las aplicaciones\n    \/\/ Servidor\n    UdpEchoServerHelper echoServer (9);\n    ApplicationContainer serverApp = echoServer.Install (csmaNodes.Get (nCsma - 1));\n    serverApp.Start (Seconds (STARTTIME));\n    serverApp.Stop (Seconds (STOPTIME));\n    \/\/ Clientes\n    UdpEchoClientHelper echoClient (csmaInterfaces.GetAddress (nCsma - 1), 9);\n    echoClient.SetAttribute (\"MaxPackets\", UintegerValue (10000));\n    echoClient.SetAttribute (\"Interval\", TimeValue (intervalo));\n    echoClient.SetAttribute (\"PacketSize\", UintegerValue (tamPaquete));\n    NodeContainer clientes;\n\n    for (uint32_t i = 0; i < nCsma - 1; i++)\n    {\n        clientes.Add (csmaNodes.Get (i));\n    }\n    NS_LOG_FUNCTION (\"Fin bucle de creacion de observadores\");\n\n    ApplicationContainer clientApps = echoClient.Install (clientes);\n    NS_LOG_FUNCTION (\"Instalacion de clientes de echo realizada\");\n    clientApps.Start (Seconds (STARTTIME));\n    clientApps.Stop (Seconds (STOPTIME));\n\n    \/\/ Cálculo de rutas\n    Ipv4GlobalRoutingHelper::PopulateRoutingTables ();\n\n    csma.EnablePcap (\"practica05\", csmaDevices.Get (nCsma - 1), true);\n\n    Observador observadores[nCsma]; \n    for (uint32_t i = 0; i < nCsma; i++) {\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"PhyTxEnd\",     MakeCallback(&Observador::PaqueteEnviado,              &observadores[i]));\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"PhyTxDrop\",    MakeCallback(&Observador::PaquetePerdido,              &observadores[i]));\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"MacTxBackoff\", MakeCallback(&Observador::PaqueteEnBackoff,            &observadores[i]));\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"MacTx\",        MakeCallback(&Observador::PaqueteParaEnviar,           &observadores[i]));\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"MacRx\",        MakeCallback(&Observador::PaqueteRecibidoParaEntregar, &observadores[i])); \n    \n        Ptr<CsmaNetDevice> csma_device = csmaDevices.Get(i)->GetObject<CsmaNetDevice>();\n        csma_device->SetBackoffParams (Time (\"1us\"), 10, 1000, 10, maxReintentos);\n    }\n \n    NS_LOG_FUNCTION (\"Va a comenzar la simulacion\");\n    Simulator::Run ();\n    Simulator::Destroy ();\n    NS_LOG_FUNCTION (\"Finalizada simulacion\");\n\n\n    Average<uint32_t> numIntentosTotales;\n    Average<double>   tiempoEcoTotal;\n    Average<double>   porcentajeErrorClientes;\n    Average<double>   porcentajeErrorEscenario;\n\n    for (uint32_t i = 0; i < nCsma; i++) {\n        \n        double mediaNumIntentos = observadores[i].GetMediaNumIntentos();\n        double mediaTiempoEco = observadores[i].GetMediaTiempoEco();\n        double porcentajeError = observadores[i].GetPorcentajePaquetesPerdidos();        \n\n        if (std::isnan(mediaNumIntentos)) {\n            mediaNumIntentos = 0;\n        }\n        if (std::isnan(mediaTiempoEco)) {\n            mediaTiempoEco = 0;\n        }\n\n        NS_LOG_INFO (\"Media de intentos en nodo \" << i << \": \" << mediaNumIntentos);\n        porcentajeErrorEscenario.Update(porcentajeError);\n        if (i < nCsma - 1) {\n           NS_LOG_INFO (\"Tiempo medio de eco en nodo \" << i << \": \" << Time(mediaTiempoEco));\n           if (i > 1) {\n               porcentajeErrorClientes.Update(porcentajeError);\n               tiempoEcoTotal.Update(mediaTiempoEco);\n               numIntentosTotales.Update(mediaNumIntentos);\n           }\n        }\n        NS_LOG_INFO (\"Porcentaje de paquetes perdidos en nodo \" << i << \": \" << porcentajeError << \" %\");\n        NS_LOG_INFO (\"\");\n    }\n\n    double mediaNumIntentosTotales = numIntentosTotales.Mean();\n    double mediaTiempoEcoTotal = tiempoEcoTotal.Mean();\n    double mediaPorcentajeErrorClientes = porcentajeErrorClientes.Mean();\n    double mediaPorcentajeErrorEscenario = porcentajeErrorEscenario.Mean(); \n\n    if (std::isnan(mediaNumIntentosTotales)) {\n        mediaNumIntentosTotales = 0;\n    }\n    if (std::isnan(mediaTiempoEcoTotal)) {\n        mediaTiempoEcoTotal = 0;\n    }\n    if (std::isnan(mediaPorcentajeErrorClientes)) {\n        mediaPorcentajeErrorClientes = 0;\n    }\n    if (std::isnan(mediaPorcentajeErrorEscenario)) {\n        mediaPorcentajeErrorEscenario = 0;\n    }\n \n    NS_LOG_INFO (\"--------------------------------------------------------\");\n    NS_LOG_INFO (\"Media de intentos de transmision en el escenario: \" << mediaNumIntentosTotales);\n    NS_LOG_INFO (\"Tiempo de eco medio en el escenario: \" << Time(mediaTiempoEcoTotal));\n    NS_LOG_INFO (\"Porcentaje de paquetes perdidos por los clientes: \" << mediaPorcentajeErrorClientes << \" %\");\n    NS_LOG_INFO (\"Porcentaje de paquetes perdidos en el escenario: \" << mediaPorcentajeErrorEscenario << \" %\");\n    NS_LOG_INFO (\"--------------------------------------------------------\");\n    \n    return { mediaNumIntentosTotales, mediaTiempoEcoTotal, mediaPorcentajeErrorClientes };\n}\n\nint\nmain (int argc, char *argv[])\n{\n    GlobalValue::Bind(\"ChecksumEnabled\", BooleanValue(true));\n    Time::SetResolution (Time::US);\n\n    uint32_t seed = 1;\n\n    int dni[8] = {3,0,2,2,8,4,1,3};\n    NS_LOG_INFO (\"DNI: \" << dni[0]<<dni[1]<<dni[2]<<dni[3]<<dni[4]<<dni[5]<<dni[6]<<dni[7]);\n\n    \/\/Parametros de simulacion\n    uint32_t nCsma             = 10;\n    Time     retardoProp       = Time (\"6560ns\");\n    DataRate capacidad         = DataRate (\"100Mbps\");\n    uint32_t tamPaquete        = 1024;\n    Time     intervalo         = Time (\"1s\");\n    uint32_t reintentosInicial = 8;\n    uint32_t reintentosFinal   = 20;\n\n    CommandLine cmd;\n    cmd.AddValue (\"nCsma\", \"Número de nodos de la red local\", nCsma);\n    cmd.AddValue (\"retardoProp\", \"retardo de propagación en el bus\", retardoProp);\n    cmd.AddValue (\"capacidad\", \"capacidad del bus\", capacidad);\n    cmd.AddValue (\"tamPaquete\", \"tamaño de las SDU de aplicación\", tamPaquete);\n    cmd.AddValue (\"intervalo\", \"tiempo entre dos paquetes consecutivos enviados por el mismo cliente\", intervalo);\n    cmd.AddValue (\"reintentosInicial\", \"valor inicial de reintentos\", reintentosInicial);\n    cmd.AddValue (\"reintentosFinal\", \"valor final de reintentos\", reintentosFinal);\n    cmd.Parse (argc,argv);\n    \n    Gnuplot plot[3];\n    plot[0].SetTitle (\"Evolución del número medio de intentos\");\n    plot[0].SetLegend (\"maxReint\", \"numIntentos\");\n    plot[1].SetTitle (\"Evolución del tiempo medio de eco\");\n    plot[1].SetLegend (\"maxReint\", \"tEco (us)\");\n    plot[2].SetTitle (\"Evolución del porcentaje de error\");\n    plot[2].SetLengend (\"maxReint\", \"perror (%)\");\n\n    Gnuplot2dDataset dataset[3];\n    for (int i = 0; i < 3 ; i++) {\n        dataset[i].SetStyle (Gnuplot2dDataset::LINES_POINTS);\n        dataset[i].SetErrorBars(Gnuplot2dDataset::Y);\n    }\n    \n    for (uint32_t maxReintentos = reintentosInicial; maxReintentos <= reintentosFinal; maxReintentos++) {\n        Average<double> numIntentosTotales;\n        Average<double> tiempoEcoTotal;\n        Average<double> porcentajeErrorClientes;\n        for (int i = 0; i < 10; i++) {\n            DATOS datos;\n            \/\/Modificamos la semilla de la simulacion\n            SeedManager::SetRun (seed++);\n            datos = simulacion(nCsma, retardoProp, capacidad, tamPaquete, intervalo, maxReintentos);\n            numIntentosTotales.Update (datos.mediaNumIntentosTotales);\n            tiempoEcoTotal.Update (datos.mediaTiempoEcoTotal);\n            porcentajeErrorClientes.Update (datos.mediaPorcentajeErrorClientes);\n        }\n        double z[3];\n        z[0] = T_STUDENT_VALUE * std::sqrt (numIntentosTotales.Var() \/ 10);\n        dataset[0].Add(maxReintentos, numIntentosTotales.Mean(), 2 * z[0]);\n        z[1] = T_STUDENT_VALUE * std::sqrt (tiempoEcoTotal.Var() \/ 10);\n        dataset[1].Add(maxReintentos, tiempoEcoTotal.Mean(), 2 * z[1]);\n        z[2] = T_STUDENT_VALUE * std::sqrt (porcentajeErrorClientes.Var() \/ 10);\n        dataset[2].Add(maxReintentos, porcentajeErrorClientes.Mean(), 2 * z[2]);\n        NS_LOG_DEBUG (numIntentosTotales.Mean() - z[0] << \" < numIntentosTotales < \" << numIntentosTotales.Mean() + z[0]);\n        NS_LOG_DEBUG (tiempoEcoTotal.Mean() - z[1] << \" < tiempoEcoTotal < \" << tiempoEcoTotal.Mean() + z[1]);\n        NS_LOG_DEBUG (porcentajeErrorClientes.Mean() - z[2] << \" < porcentajeErrorClientes < \" << porcentajeErrorClientes.Mean() + z[2]);\n        NS_LOG_DEBUG (\"\");\n    }\n\n    for (int i = 0; i < 3; i++) {\n        plot[i].AddDataset (dataset[i]);\n        std::ostringstream nombreFichero;\n        nombreFichero << \"practica05-0\" << i << \".plt\";\n        std::ofstream plotFile (nombreFichero.str());\n        plot.GenerateOutput (plotFile);\n        plotFile << \"pause -1\" << std::endl;\n        plotFile.close ();\n    }\n   \n    return 0;\n}\n<commit_msg>P05 parece que ya funciona, falta añadir valores de DNI<commit_after>\/* -*- Mode:C++; c-file-style:\"gnu\"; indent-tabs-mode:nil; -*- *\/\n\n#include \"ns3\/object.h\"\n#include \"ns3\/global-value.h\"\n#include \"ns3\/core-module.h\"\n#include \"ns3\/csma-module.h\"\n#include \"ns3\/internet-module.h\"\n#include \"ns3\/applications-module.h\"\n#include <ns3\/gnuplot.h>\n#include <sstream>\n\n\n#include \"Observador.h\"\n\n#define STARTTIME 2.0\n#define STOPTIME  100.0\n#define T_STUDENT_VALUE 2.2622\n\ntypedef struct datos {\n    double mediaNumIntentosTotales;\n    double mediaTiempoEcoTotal;\n    double mediaPorcentajeErrorClientes;\n} DATOS; \n\nusing namespace ns3;\n\nNS_LOG_COMPONENT_DEFINE (\"practica05\");\n\n\nDATOS simulacion (uint32_t nCsma, Time retardoProp, DataRate capacidad, \n        uint32_t tamPaquete, Time intervalo, uint32_t maxReintentos) {\n    \n    NodeContainer csmaNodes;\n    csmaNodes.Create (nCsma);\n\n    CsmaHelper csma;\n    csma.SetChannelAttribute (\"DataRate\", DataRateValue (capacidad));\n    csma.SetChannelAttribute (\"Delay\", TimeValue (retardoProp));\n\n    NetDeviceContainer csmaDevices;\n    csmaDevices = csma.Install (csmaNodes);\n    \/\/ Instalamos la pila TCP\/IP en todos los nodos\n    InternetStackHelper stack;\n    stack.Install (csmaNodes);\n    \/\/ Y les asignamos direcciones\n    Ipv4AddressHelper address;\n    address.SetBase (\"10.1.2.0\", \"255.255.255.0\");\n    Ipv4InterfaceContainer csmaInterfaces = address.Assign (csmaDevices);\n\n    \/\/\/\/\/\/\/\/\/\/\/ Instalación de las aplicaciones\n    \/\/ Servidor\n    UdpEchoServerHelper echoServer (9);\n    ApplicationContainer serverApp = echoServer.Install (csmaNodes.Get (nCsma - 1));\n    serverApp.Start (Seconds (STARTTIME));\n    serverApp.Stop (Seconds (STOPTIME));\n    \/\/ Clientes\n    UdpEchoClientHelper echoClient (csmaInterfaces.GetAddress (nCsma - 1), 9);\n    echoClient.SetAttribute (\"MaxPackets\", UintegerValue (10000));\n    echoClient.SetAttribute (\"Interval\", TimeValue (intervalo));\n    echoClient.SetAttribute (\"PacketSize\", UintegerValue (tamPaquete));\n    NodeContainer clientes;\n\n    for (uint32_t i = 0; i < nCsma - 1; i++)\n    {\n        clientes.Add (csmaNodes.Get (i));\n    }\n    NS_LOG_FUNCTION (\"Fin bucle de creacion de observadores\");\n\n    ApplicationContainer clientApps = echoClient.Install (clientes);\n    NS_LOG_FUNCTION (\"Instalacion de clientes de echo realizada\");\n    clientApps.Start (Seconds (STARTTIME));\n    clientApps.Stop (Seconds (STOPTIME));\n\n    \/\/ Cálculo de rutas\n    Ipv4GlobalRoutingHelper::PopulateRoutingTables ();\n\n    csma.EnablePcap (\"practica05\", csmaDevices.Get (nCsma - 1), true);\n\n    Observador observadores[nCsma]; \n    for (uint32_t i = 0; i < nCsma; i++) {\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"PhyTxEnd\",     MakeCallback(&Observador::PaqueteEnviado,              &observadores[i]));\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"PhyTxDrop\",    MakeCallback(&Observador::PaquetePerdido,              &observadores[i]));\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"MacTxBackoff\", MakeCallback(&Observador::PaqueteEnBackoff,            &observadores[i]));\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"MacTx\",        MakeCallback(&Observador::PaqueteParaEnviar,           &observadores[i]));\n        csmaDevices.Get(i)->TraceConnectWithoutContext (\"MacRx\",        MakeCallback(&Observador::PaqueteRecibidoParaEntregar, &observadores[i])); \n    \n        Ptr<CsmaNetDevice> csma_device = csmaDevices.Get(i)->GetObject<CsmaNetDevice>();\n        csma_device->SetBackoffParams (Time (\"1us\"), 10, 1000, 10, maxReintentos);\n    }\n \n    NS_LOG_FUNCTION (\"Va a comenzar la simulacion\");\n    Simulator::Run ();\n    Simulator::Destroy ();\n    NS_LOG_FUNCTION (\"Finalizada simulacion\");\n\n\n    Average<uint32_t> numIntentosTotales;\n    Average<double>   tiempoEcoTotal;\n    Average<double>   porcentajeErrorClientes;\n    Average<double>   porcentajeErrorEscenario;\n\n    for (uint32_t i = 0; i < nCsma; i++) {\n        \n        double mediaNumIntentos = observadores[i].GetMediaNumIntentos();\n        double mediaTiempoEco = observadores[i].GetMediaTiempoEco();\n        double porcentajeError = observadores[i].GetPorcentajePaquetesPerdidos();        \n\n        if (std::isnan(mediaNumIntentos)) {\n            mediaNumIntentos = 0;\n        }\n        if (std::isnan(mediaTiempoEco)) {\n            mediaTiempoEco = 0;\n        }\n\n        NS_LOG_INFO (\"Media de intentos en nodo \" << i << \": \" << mediaNumIntentos);\n        porcentajeErrorEscenario.Update(porcentajeError);\n        if (i < nCsma - 1) {\n           NS_LOG_INFO (\"Tiempo medio de eco en nodo \" << i << \": \" << Time(mediaTiempoEco));\n           if (i > 1) {\n               porcentajeErrorClientes.Update(porcentajeError);\n               tiempoEcoTotal.Update(mediaTiempoEco);\n               numIntentosTotales.Update(mediaNumIntentos);\n           }\n        }\n        NS_LOG_INFO (\"Porcentaje de paquetes perdidos en nodo \" << i << \": \" << porcentajeError << \" %\");\n        NS_LOG_INFO (\"\");\n    }\n\n    double mediaNumIntentosTotales = numIntentosTotales.Mean();\n    double mediaTiempoEcoTotal = tiempoEcoTotal.Mean();\n    double mediaPorcentajeErrorClientes = porcentajeErrorClientes.Mean();\n    double mediaPorcentajeErrorEscenario = porcentajeErrorEscenario.Mean(); \n\n    if (std::isnan(mediaNumIntentosTotales)) {\n        mediaNumIntentosTotales = 0;\n    }\n    if (std::isnan(mediaTiempoEcoTotal)) {\n        mediaTiempoEcoTotal = 0;\n    }\n    if (std::isnan(mediaPorcentajeErrorClientes)) {\n        mediaPorcentajeErrorClientes = 0;\n    }\n    if (std::isnan(mediaPorcentajeErrorEscenario)) {\n        mediaPorcentajeErrorEscenario = 0;\n    }\n \n    NS_LOG_INFO (\"--------------------------------------------------------\");\n    NS_LOG_INFO (\"Media de intentos de transmision en el escenario: \" << mediaNumIntentosTotales);\n    NS_LOG_INFO (\"Tiempo de eco medio en el escenario: \" << Time(mediaTiempoEcoTotal));\n    NS_LOG_INFO (\"Porcentaje de paquetes perdidos por los clientes: \" << mediaPorcentajeErrorClientes << \" %\");\n    NS_LOG_INFO (\"Porcentaje de paquetes perdidos en el escenario: \" << mediaPorcentajeErrorEscenario << \" %\");\n    NS_LOG_INFO (\"--------------------------------------------------------\");\n    \n    DATOS datos = { mediaNumIntentosTotales, mediaTiempoEcoTotal, mediaPorcentajeErrorClientes };\n    return datos;\n}\n\nint\nmain (int argc, char *argv[])\n{\n    GlobalValue::Bind(\"ChecksumEnabled\", BooleanValue(true));\n    Time::SetResolution (Time::US);\n\n    uint32_t seed = 1;\n\n    int dni[8] = {3,0,2,2,8,4,1,3};\n    NS_LOG_INFO (\"DNI: \" << dni[0]<<dni[1]<<dni[2]<<dni[3]<<dni[4]<<dni[5]<<dni[6]<<dni[7]);\n\n    \/\/Parametros de simulacion\n    uint32_t nCsma             = 10;\n    Time     retardoProp       = Time (\"6560ns\");\n    DataRate capacidad         = DataRate (\"100Mbps\");\n    uint32_t tamPaquete        = 1024;\n    Time     intervalo         = Time (\"1s\");\n    uint32_t reintentosInicial = 8;\n    uint32_t reintentosFinal   = 20;\n\n    CommandLine cmd;\n    cmd.AddValue (\"nCsma\", \"Número de nodos de la red local\", nCsma);\n    cmd.AddValue (\"retardoProp\", \"retardo de propagación en el bus\", retardoProp);\n    cmd.AddValue (\"capacidad\", \"capacidad del bus\", capacidad);\n    cmd.AddValue (\"tamPaquete\", \"tamaño de las SDU de aplicación\", tamPaquete);\n    cmd.AddValue (\"intervalo\", \"tiempo entre dos paquetes consecutivos enviados por el mismo cliente\", intervalo);\n    cmd.AddValue (\"reintentosInicial\", \"valor inicial de reintentos\", reintentosInicial);\n    cmd.AddValue (\"reintentosFinal\", \"valor final de reintentos\", reintentosFinal);\n    cmd.Parse (argc,argv);\n    \n    Gnuplot plot[3];\n    plot[0].SetTitle (\"Evolución del número medio de intentos\");\n    plot[0].SetLegend (\"maxReint\", \"numIntentos\");\n    plot[1].SetTitle (\"Evolución del tiempo medio de eco\");\n    plot[1].SetLegend (\"maxReint\", \"tEco (us)\");\n    plot[2].SetTitle (\"Evolución del porcentaje de error\");\n    plot[2].SetLegend (\"maxReint\", \"perror (%)\");\n\n    Gnuplot2dDataset dataset[3];\n    for (int i = 0; i < 3 ; i++) {\n        dataset[i].SetStyle (Gnuplot2dDataset::LINES_POINTS);\n        dataset[i].SetErrorBars(Gnuplot2dDataset::Y);\n    }\n    \n    for (uint32_t maxReintentos = reintentosInicial; maxReintentos <= reintentosFinal; maxReintentos++) {\n        Average<double> numIntentosTotales;\n        Average<double> tiempoEcoTotal;\n        Average<double> porcentajeErrorClientes;\n        for (int i = 0; i < 10; i++) {\n            DATOS datos;\n            \/\/Modificamos la semilla de la simulacion\n            SeedManager::SetRun (seed++);\n            datos = simulacion(nCsma, retardoProp, capacidad, tamPaquete, intervalo, maxReintentos);\n            numIntentosTotales.Update (datos.mediaNumIntentosTotales);\n            tiempoEcoTotal.Update (datos.mediaTiempoEcoTotal);\n            porcentajeErrorClientes.Update (datos.mediaPorcentajeErrorClientes);\n        }\n        double z[3];\n        z[0] = T_STUDENT_VALUE * std::sqrt (numIntentosTotales.Var() \/ 10);\n        dataset[0].Add(maxReintentos, numIntentosTotales.Mean(), 2 * z[0]);\n        z[1] = T_STUDENT_VALUE * std::sqrt (tiempoEcoTotal.Var() \/ 10);\n        dataset[1].Add(maxReintentos, tiempoEcoTotal.Mean(), 2 * z[1]);\n        z[2] = T_STUDENT_VALUE * std::sqrt (porcentajeErrorClientes.Var() \/ 10);\n        dataset[2].Add(maxReintentos, porcentajeErrorClientes.Mean(), 2 * z[2]);\n        NS_LOG_DEBUG (numIntentosTotales.Mean() - z[0] << \" < numIntentosTotales < \" << numIntentosTotales.Mean() + z[0]);\n        NS_LOG_DEBUG (tiempoEcoTotal.Mean() - z[1] << \" < tiempoEcoTotal < \" << tiempoEcoTotal.Mean() + z[1]);\n        NS_LOG_DEBUG (porcentajeErrorClientes.Mean() - z[2] << \" < porcentajeErrorClientes < \" << porcentajeErrorClientes.Mean() + z[2]);\n        NS_LOG_DEBUG (\"\");\n    }\n\n        plot[0].AddDataset (dataset[0]);\n        std::ofstream plotFile1 (\"practica05-01.plt\");\n        plot[0].GenerateOutput (plotFile1);\n        plotFile1 << \"pause -1\" << std::endl;\n        plotFile1.close ();\n       \n        \n        plot[1].AddDataset (dataset[1]);\n        std::ofstream plotFile2 (\"practica05-02.plt\");\n        plot[1].GenerateOutput (plotFile2);\n        plotFile2 << \"pause -1\" << std::endl;\n        plotFile2.close ();\n \n        \n        plot[2].AddDataset (dataset[2]);\n        std::ofstream plotFile3 (\"practica05-03.plt\");\n        plot[2].GenerateOutput (plotFile3);\n        plotFile3 << \"pause -1\" << std::endl;\n        plotFile3.close ();\n   \n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tST7565(R) LCD ドライバー\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace chip {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ST7565 テンプレートクラス\n\t\t@param[in]\tCSI_IO\tCSI(SPI) 制御クラス\n\t\t@param[in]\tCS\tデバイス選択、レジスター選択、制御クラス\n\t\t@param[in]\tA0\t制御切り替え、レジスター選択、制御クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CSI_IO, class CS, class A0>\n\tclass ST7565 {\n\n\t\tCSI_IO&\tcsi_;\n\n\t\tenum class CMD : uint8_t {\n\t\t\tDISPLAY_OFF = 0xAE,\n\t\t\tDISPLAY_ON  = 0xAF,\n\t\t\tSET_DISP_START_LINE = 0x40,\n\t\t\tSET_PAGE = 0xB0,\n\n\t\t\tSET_COLUMN_UPPER = 0x10,\n\t\t\tSET_COLUMN_LOWER = 0x00,\n\n\t\t\tSET_ADC_NORMAL  = 0xA0,\n\t\t\tSET_ADC_REVERSE = 0xA1,\n\n\t\t\tSET_DISP_NORMAL = 0xA6,\n\t\t\tSET_DISP_REVERSE = 0xA7,\n\n\t\t\tSET_ALLPTS_NORMAL = 0xA4,\n\t\t\tSET_ALLPTS_ON = 0xA5,\n\t\t\tSET_BIAS_9 = 0xA2, \n\t\t\tSET_BIAS_7 = 0xA3,\n\n\t\t\tRMW = 0xE0,\n\t\t\tRMW_CLEAR = 0xEE,\n\t\t\tINTERNAL_RESET = 0xE2,\n\t\t\tSET_COM_NORMAL = 0xC0,\n\t\t\tSET_COM_REVERSE = 0xC8,\n\t\t\tSET_POWER_CONTROL = 0x28,\n\t\t\tSET_RESISTOR_RATIO = 0x20,\n\t\t\tSET_VOLUME_FIRST = 0x81,\n\t\t\tSET_VOLUME_SECOND = 0x00,\n\t\t\tSET_STATIC_OFF = 0xAC,\n\t\t\tSET_STATIC_ON = 0xAD,\n\t\t\tSET_STATIC_REG = 0x00,\n\t\t\tSET_BOOSTER_FIRST = 0xF8,\n\t\t\tSET_BOOSTER_234 = 0,\n\t\t\tSET_BOOSTER_5 = 1,\n\t\t\tSET_BOOSTER_6 = 3,\n\t\t\tNOP = 0xE3,\n\t\t\tTEST = 0xF0,\n\t\t};\n\n\t\tinline void write_(CMD cmd) {\n\t\t\tcsi_.xchg(static_cast<uint8_t>(cmd));\n\t\t}\n\n\t\tinline void write_(CMD cmd, uint8_t ord) {\n\t\t\tcsi_.xchg(static_cast<uint8_t>(cmd) | ord);\n\t\t}\n\n\t\tinline void chip_enable_(bool f = true) const {\n\t\t\tCS::P = !f;\n\t\t}\n\n\t\tinline void reg_select_(bool f) const {\n\t\t\tA0::P = f;\n\t\t}\n\n\n\t\tvoid init_(bool comrvs) {\n\n\t\t\treg_select_(0);\n\t\t\tchip_enable_();\n\n\t\t\t\/\/ toggle RST low to reset; CS low so it'll listen to us\n\t\t\t\/\/ if (cs > 0)\n    \t\t\/\/     digitalWrite(cs, LOW);\n\n\t\t\t\/\/ digitalWrite(rst, LOW);\n\t\t\t\/\/ _delay_ms(500);\n\t\t\t\/\/ digitalWrite(rst, HIGH);\n\n\t\t\twrite_(CMD::DISPLAY_OFF);\n\n\t\t\t\/\/ LCD bias select\n\t\t\twrite_(CMD::SET_BIAS_7);\n\t\t\t\/\/ ADC select\n\t\t\twrite_(CMD::SET_ADC_NORMAL);\n\t\t\t\/\/ SHL select\n\t\t\tif(comrvs) {\n\t\t\t\twrite_(CMD::SET_COM_REVERSE);\n\t\t\t} else {\n\t\t\t\twrite_(CMD::SET_COM_NORMAL);\n\t\t\t}\n\n\t\t\t\/\/ Initial display line\n\t\t\twrite_(CMD::SET_DISP_START_LINE);\n\n\t\t\t\/\/ turn on voltage converter (VC=1, VR=0, VF=0)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x4);\n\t\t\t\/\/ wait for 50% rising\n\t\t\tutils::delay::milli_second(50);\n\n\t\t\t\/\/ turn on voltage regulator (VC=1, VR=1, VF=0)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x6);\n\n\t\t\t\/\/ wait >=50ms\n\t\t\tutils::delay::milli_second(50);\n\n\t\t\t\/\/ turn on voltage follower (VC=1, VR=1, VF=1)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x7);\n\n\t\t\t\/\/ wait 10ms\n\t\t\tutils::delay::milli_second(10);\n\n\t\t\t\/\/ set lcd operating voltage (regulator resistor, ref voltage resistor)\n\t\t\twrite_(CMD::SET_RESISTOR_RATIO, 0x6);\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tST7565(CSI_IO& csi) : csi_(csi) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ブライトネス設定\n\t\t\t@param[in]\tval\tブライトネス値\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_brightness(uint8_t val)\n\t\t{\n    \t\twrite_(CMD::SET_VOLUME_FIRST);\n    \t\twrite_(CMD::SET_VOLUME_SECOND, (val & 0x3f));\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  開始\n\t\t\t@param[in]\tcontrast コントラスト\n\t\t\t@param[in]\tcomrvs\tコモンライン・リバースの場合：true\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid start(uint8_t contrast, bool comrvs = false)\n\t\t{\n\t\t\tCS::DIR = 1;  \/\/ (\/CS) output\n\t\t\tA0::DIR = 1;  \/\/ (A0) output\n\n\t\t\treg_select_(0);\n\t\t\tchip_enable_(false);\n\n\t\t\tutils::delay::milli_second(100);\n\n\t\t\tinit_(comrvs);\n\t\t\twrite_(CMD::DISPLAY_ON);\n\t  \t\twrite_(CMD::SET_ALLPTS_NORMAL);\n\t\t\tset_brightness(contrast);\n\t\t\tchip_enable_(false);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  コピー\n\t\t\t@param[in]\tsrc\tフレームバッファソース\n\t\t\t@param[in]\tnum\t転送ページ数\n\t\t\t@param[in]\tofs\t転送オフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid copy(const uint8_t* src, uint8_t num, uint8_t ofs = 0) {\n\t\t\tchip_enable_();\n\t\t\tuint8_t o = 0x00;\n\t\t\tfor(uint8_t page = ofs; page < (ofs + num); ++page) {\n\t\t\t\treg_select_(0);\n\t\t\t\twrite_(CMD::SET_PAGE, page);\n\t\t\t\twrite_(CMD::SET_COLUMN_LOWER, o & 0x0f);\n\t\t\t\twrite_(CMD::SET_COLUMN_UPPER, o >> 4);\n\/\/\/    \t\t\twrite_(CMD::RMW);\n\t\t\t\treg_select_(1);\n\t\t\t\tcsi_.send(src, 128);\n\t\t\t\tsrc += 128;\n\t\t\t}\n\t\t\treg_select_(0);\n\t\t\tchip_enable_(false);\n\t\t}\n\n\t};\n}\n<commit_msg>update comment<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tST7565(R) LCD ドライバー @n\n\t\t\tCopyright 2016 Kunihito Hiramatsu\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace chip {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ST7565 テンプレートクラス\n\t\t@param[in]\tCSI_IO\tCSI(SPI) 制御クラス\n\t\t@param[in]\tCS\tデバイス選択、レジスター選択、制御クラス\n\t\t@param[in]\tA0\t制御切り替え、レジスター選択、制御クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CSI_IO, class CS, class A0>\n\tclass ST7565 {\n\n\t\tCSI_IO&\tcsi_;\n\n\t\tenum class CMD : uint8_t {\n\t\t\tDISPLAY_OFF = 0xAE,\n\t\t\tDISPLAY_ON  = 0xAF,\n\t\t\tSET_DISP_START_LINE = 0x40,\n\t\t\tSET_PAGE = 0xB0,\n\n\t\t\tSET_COLUMN_UPPER = 0x10,\n\t\t\tSET_COLUMN_LOWER = 0x00,\n\n\t\t\tSET_ADC_NORMAL  = 0xA0,\n\t\t\tSET_ADC_REVERSE = 0xA1,\n\n\t\t\tSET_DISP_NORMAL = 0xA6,\n\t\t\tSET_DISP_REVERSE = 0xA7,\n\n\t\t\tSET_ALLPTS_NORMAL = 0xA4,\n\t\t\tSET_ALLPTS_ON = 0xA5,\n\t\t\tSET_BIAS_9 = 0xA2, \n\t\t\tSET_BIAS_7 = 0xA3,\n\n\t\t\tRMW = 0xE0,\n\t\t\tRMW_CLEAR = 0xEE,\n\t\t\tINTERNAL_RESET = 0xE2,\n\t\t\tSET_COM_NORMAL = 0xC0,\n\t\t\tSET_COM_REVERSE = 0xC8,\n\t\t\tSET_POWER_CONTROL = 0x28,\n\t\t\tSET_RESISTOR_RATIO = 0x20,\n\t\t\tSET_VOLUME_FIRST = 0x81,\n\t\t\tSET_VOLUME_SECOND = 0x00,\n\t\t\tSET_STATIC_OFF = 0xAC,\n\t\t\tSET_STATIC_ON = 0xAD,\n\t\t\tSET_STATIC_REG = 0x00,\n\t\t\tSET_BOOSTER_FIRST = 0xF8,\n\t\t\tSET_BOOSTER_234 = 0,\n\t\t\tSET_BOOSTER_5 = 1,\n\t\t\tSET_BOOSTER_6 = 3,\n\t\t\tNOP = 0xE3,\n\t\t\tTEST = 0xF0,\n\t\t};\n\n\t\tinline void write_(CMD cmd) {\n\t\t\tcsi_.xchg(static_cast<uint8_t>(cmd));\n\t\t}\n\n\t\tinline void write_(CMD cmd, uint8_t ord) {\n\t\t\tcsi_.xchg(static_cast<uint8_t>(cmd) | ord);\n\t\t}\n\n\t\tinline void chip_enable_(bool f = true) const {\n\t\t\tCS::P = !f;\n\t\t}\n\n\t\tinline void reg_select_(bool f) const {\n\t\t\tA0::P = f;\n\t\t}\n\n\n\t\tvoid init_(bool comrvs) {\n\n\t\t\treg_select_(0);\n\t\t\tchip_enable_();\n\n\t\t\t\/\/ toggle RST low to reset; CS low so it'll listen to us\n\t\t\t\/\/ if (cs > 0)\n    \t\t\/\/     digitalWrite(cs, LOW);\n\n\t\t\t\/\/ digitalWrite(rst, LOW);\n\t\t\t\/\/ _delay_ms(500);\n\t\t\t\/\/ digitalWrite(rst, HIGH);\n\n\t\t\twrite_(CMD::DISPLAY_OFF);\n\n\t\t\t\/\/ LCD bias select\n\t\t\twrite_(CMD::SET_BIAS_7);\n\t\t\t\/\/ ADC select\n\t\t\twrite_(CMD::SET_ADC_NORMAL);\n\t\t\t\/\/ SHL select\n\t\t\tif(comrvs) {\n\t\t\t\twrite_(CMD::SET_COM_REVERSE);\n\t\t\t} else {\n\t\t\t\twrite_(CMD::SET_COM_NORMAL);\n\t\t\t}\n\n\t\t\t\/\/ Initial display line\n\t\t\twrite_(CMD::SET_DISP_START_LINE);\n\n\t\t\t\/\/ turn on voltage converter (VC=1, VR=0, VF=0)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x4);\n\t\t\t\/\/ wait for 50% rising\n\t\t\tutils::delay::milli_second(50);\n\n\t\t\t\/\/ turn on voltage regulator (VC=1, VR=1, VF=0)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x6);\n\n\t\t\t\/\/ wait >=50ms\n\t\t\tutils::delay::milli_second(50);\n\n\t\t\t\/\/ turn on voltage follower (VC=1, VR=1, VF=1)\n\t\t\twrite_(CMD::SET_POWER_CONTROL, 0x7);\n\n\t\t\t\/\/ wait 10ms\n\t\t\tutils::delay::milli_second(10);\n\n\t\t\t\/\/ set lcd operating voltage (regulator resistor, ref voltage resistor)\n\t\t\twrite_(CMD::SET_RESISTOR_RATIO, 0x6);\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tST7565(CSI_IO& csi) : csi_(csi) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ブライトネス設定\n\t\t\t@param[in]\tval\tブライトネス値\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_brightness(uint8_t val)\n\t\t{\n    \t\twrite_(CMD::SET_VOLUME_FIRST);\n    \t\twrite_(CMD::SET_VOLUME_SECOND, (val & 0x3f));\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  開始\n\t\t\t@param[in]\tcontrast コントラスト\n\t\t\t@param[in]\tcomrvs\tコモンライン・リバースの場合：true\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid start(uint8_t contrast, bool comrvs = false)\n\t\t{\n\t\t\tCS::DIR = 1;  \/\/ (\/CS) output\n\t\t\tA0::DIR = 1;  \/\/ (A0) output\n\n\t\t\treg_select_(0);\n\t\t\tchip_enable_(false);\n\n\t\t\tutils::delay::milli_second(100);\n\n\t\t\tinit_(comrvs);\n\t\t\twrite_(CMD::DISPLAY_ON);\n\t  \t\twrite_(CMD::SET_ALLPTS_NORMAL);\n\t\t\tset_brightness(contrast);\n\t\t\tchip_enable_(false);\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  コピー\n\t\t\t@param[in]\tsrc\tフレームバッファソース\n\t\t\t@param[in]\tnum\t転送ページ数\n\t\t\t@param[in]\tofs\t転送オフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid copy(const uint8_t* src, uint8_t num, uint8_t ofs = 0) {\n\t\t\tchip_enable_();\n\t\t\tuint8_t o = 0x00;\n\t\t\tfor(uint8_t page = ofs; page < (ofs + num); ++page) {\n\t\t\t\treg_select_(0);\n\t\t\t\twrite_(CMD::SET_PAGE, page);\n\t\t\t\twrite_(CMD::SET_COLUMN_LOWER, o & 0x0f);\n\t\t\t\twrite_(CMD::SET_COLUMN_UPPER, o >> 4);\n\/\/\/    \t\t\twrite_(CMD::RMW);\n\t\t\t\treg_select_(1);\n\t\t\t\tcsi_.send(src, 128);\n\t\t\t\tsrc += 128;\n\t\t\t}\n\t\t\treg_select_(0);\n\t\t\tchip_enable_(false);\n\t\t}\n\n\t};\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n#include \"transportsocketcache.hpp\"\n\n\nnamespace qi {\n\n  TransportSocketCache::~TransportSocketCache() {\n    close();\n  }\n\n\n  void TransportSocketCache::init() {\n    boost::mutex::scoped_lock sl(_socketsMutex);\n    _dying = false;\n  }\n\n  void TransportSocketCache::close() {\n    {\n      _dying = true;\n      MachineConnectionMap socketsCopy;\n      {\n        \/\/ Do not hold _socketsMutex while iterating or deadlock may occurr\n        \/\/ between disconnect() that waits for callback handler\n        \/\/ and callback handler that tries to acquire _socketsMutex\n        boost::mutex::scoped_lock sl(_socketsMutex);\n        socketsCopy = _sockets;\n      }\n      MachineConnectionMap::iterator mcmIt;\n      for (mcmIt = socketsCopy.begin(); mcmIt != socketsCopy.end(); ++mcmIt) {\n        TransportSocketConnectionMap& tscm = mcmIt->second;\n        TransportSocketConnectionMap::iterator tscmIt;\n        for (tscmIt = tscm.begin(); tscmIt != tscm.end(); ++tscmIt) {\n          TransportSocketConnection& tsc = tscmIt->second;\n          tsc.socket->disconnected.disconnect(tscmIt->second.disconnectLink);\n          tsc.socket->connected.disconnect(tscmIt->second.connectLink);\n          \/\/remove callback before calling disconnect. (we dont need them)\n          if (tscmIt->second.socket->isConnected())\n            tscmIt->second.socket->disconnect();\n          tscmIt->second.promise.setError(\"session closed\");\n        }\n      }\n    }\n  }\n\n  qi::Future<qi::TransportSocketPtr> TransportSocketCache::socket(const ServiceInfo& servInfo) {\n    qi::UrlVector endpoints;\n    qi::UrlVector::const_iterator urlIt;\n\n    bool local = servInfo.machineId() == qi::os::getMachineId();\n\n    \/\/ RFC 3330 - http:\/\/tools.ietf.org\/html\/rfc3330\n    \/\/   -> 127.0.0.0\/8 is assigned to loopback address.\n    \/\/\n    \/\/ This filters endpoints. If we are on the same machine, we just try to\n    \/\/ connect on the loopback address, else we will try on all endpoints we\n    \/\/ have that are not loopback.\n    for (urlIt = servInfo.endpoints().begin(); urlIt != servInfo.endpoints().end(); ++urlIt) {\n      qi::Url url = *urlIt;\n      if (!url.isValid())\n        continue;\n      if (url.host().substr(0, 4) == \"127.\") {\n        if (local) {\n          endpoints.push_back(url);\n          break;\n        }\n      } else if (!local) {\n        endpoints.push_back(url);\n      }\n    }\n\n    {\n      boost::mutex::scoped_lock sl(_socketsMutex);\n      if (_dying)\n        return qi::makeFutureError<qi::TransportSocketPtr>(\"TransportSocketCache is closed.\");\n\n      \/\/ From here, we will see if we have a pending\/established connection to\n      \/\/ machineId on one of the endpoints (they all share the same promise\n      \/\/ anyway). If it is the case, we return its future.\n      MachineConnectionMap::iterator mcmIt;\n      if ((mcmIt = _sockets.find(servInfo.machineId())) != _sockets.end()) {\n        TransportSocketConnectionMap& tscm = mcmIt->second;\n        TransportSocketConnectionMap::iterator tscmIt;\n        for (urlIt = endpoints.begin(); urlIt != endpoints.end(); ++urlIt) {\n          if ((tscmIt = tscm.find((*urlIt).str())) != tscm.end()) {\n            TransportSocketConnection& tsc = tscmIt->second;\n            if (tsc.promise.future().hasError()) {\n              \/\/ When we have a socket with an error, we will try to connect to\n              \/\/ all endpoints in case the old one is completely down.\n              continue;\n            }\n            qiLogVerbose(\"tsc.socket\") << \"A connection is pending or already\"\n                                       << \" established.\";\n            return tsc.promise.future();\n          }\n        }\n      }\n\n      \/\/ Launching connections to all endpoints at the same time. They all share\n      \/\/ the same promise.\n      qi::Promise<qi::TransportSocketPtr> prom;\n\n      \/\/ We will need this to report error (to know if all sockets didn't\n      \/\/ connect).\n      TransportSocketConnectionAttempt& tsca = _attempts[servInfo.machineId()];\n      tsca.promise = prom;\n      tsca.socket_count = 0;\n      tsca.successful = false;\n\n      \/\/ This part launches all the socket connections on the same promise. The\n      \/\/ first socket to connect is the winner.\n      TransportSocketConnectionMap& tscm = _sockets[servInfo.machineId()];\n      for (urlIt = endpoints.begin(); urlIt != endpoints.end(); ++urlIt) {\n        qi::Url url = *urlIt;\n        qi::TransportSocketPtr socket = makeTransportSocket(url.protocol());\n        TransportSocketConnection& tsc = tscm[url.str()];\n        qiLogVerbose(\"tsc.socket\") << \"Attempting connection to \" << url.str()\n                                   << \" of machine id \" << servInfo.machineId();\n        tsc.socket = socket;\n        tsc.promise = prom;\n        tsc.url = url;\n        tsc.connectLink = socket->connected.connect(boost::bind(&TransportSocketCache::onSocketConnected, this, socket, servInfo, url));\n        tsc.disconnectLink = socket->disconnected.connect(boost::bind(&TransportSocketCache::onSocketDisconnected, this, _1, socket, servInfo, url));\n        socket->connect(url).async();\n        tsca.socket_count++;\n      }\n      return prom.future();\n    } \/\/ ! boost::mutex::scoped_lock\n  }\n\n  void TransportSocketCache::onSocketDisconnected(int error, TransportSocketPtr socket, const qi::ServiceInfo& servInfo, const qi::Url& url) {\n    {\n      boost::mutex::scoped_lock sl(_socketsMutex);\n\n      \/\/ First, we get the attempts of the machineId. It is used to know if we\n      \/\/ have pending connections to other endpoints.\n      MachineAttemptsMap::iterator mamIt;\n      if ((mamIt = _attempts.find(servInfo.machineId())) == _attempts.end()) {\n        \/\/ Unknown error. This shouldn't happen...\n        return;\n      }\n      TransportSocketConnectionAttempt& tsca = mamIt->second;\n\n      if (_dying) {\n        tsca.promise.setError(\"TransportSocketCache is closed.\");\n        return;\n      }\n\n      tsca.socket_count--;\n      if (tsca.socket_count != 0) {\n        \/\/ We still have some sockets attempting to connect to the service, so\n        \/\/ we just ignore this disconnection.\n        return;\n      }\n\n      \/\/ No socket can be created, we just return an error.\n      std::stringstream ss;\n      ss << \"Failed to connect to service \" << servInfo.name() << \" on \"\n         << \"machine \" << servInfo.machineId() << \". All endpoints are \"\n         << \"unavailable.\";\n      tsca.promise.setError(ss.str());\n    } \/\/ ! boost::mutex::scoped_lock\n  }\n\n  \/*\n   * Corner case to manage (TODO):\n   *\n   * You are connecting to machineId foo, you are machineId bar. foo and bar are\n   * on different sub-networks with the same netmask. They sadly got the same IP\n   * on their subnet: 192.168.1.42. When trying to connect to foo from bar, we\n   * will try to connect its endpoints, basically:\n   *   - tcp:\/\/1.2.3.4:1333 (public IP)\n   *   - tcp:\/\/192.168.1.42:1333 (subnet public IP)\n   * If bar is listening on port 1333, we may connect to it instead of foo (our\n   * real target).\n   *\/\n  void TransportSocketCache::onSocketConnected(TransportSocketPtr socket, const qi::ServiceInfo& servInfo, const qi::Url& url) {\n    {\n      boost::mutex::scoped_lock sl(_socketsMutex);\n\n      MachineAttemptsMap::iterator mamIt;\n      if ((mamIt = _attempts.find(servInfo.machineId())) == _attempts.end()) {\n        \/\/ Unknown error. This shouldn't happen...\n        return;\n      }\n      TransportSocketConnectionAttempt& tsca = mamIt->second;\n\n      if (_dying) {\n        tsca.promise.setError(\"TransportSocketCache is closed.\");\n        return;\n      }\n\n      if (tsca.successful) {\n        \/\/ If we are already connected to this service, disconnect this socket.\n        tsca.socket_count--;\n        socket->disconnect();\n        return;\n      }\n\n      \/\/ Else, we set promise to this socket. We have a winner.\n      MachineConnectionMap::iterator mcmIt;\n      if ((mcmIt = _sockets.find(servInfo.machineId())) != _sockets.end()) {\n        TransportSocketConnectionMap& tscm = mcmIt->second;\n        TransportSocketConnectionMap::iterator tscmIt;\n        if ((tscmIt = tscm.find(url.str())) != tscm.end()) {\n          tscmIt->second.promise.setValue(socket);\n          tsca.successful = true;\n        }\n      }\n    } \/\/ ! boost::mutex::scoped_lock\n  }\n}\n<commit_msg>fix connection problems when more than one endpoint is available.<commit_after>\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n#include \"transportsocketcache.hpp\"\n\n\nnamespace qi {\n\n  TransportSocketCache::~TransportSocketCache() {\n    close();\n  }\n\n\n  void TransportSocketCache::init() {\n    boost::mutex::scoped_lock sl(_socketsMutex);\n    _dying = false;\n  }\n\n  void TransportSocketCache::close() {\n    {\n      _dying = true;\n      MachineConnectionMap socketsCopy;\n      {\n        \/\/ Do not hold _socketsMutex while iterating or deadlock may occurr\n        \/\/ between disconnect() that waits for callback handler\n        \/\/ and callback handler that tries to acquire _socketsMutex\n        boost::mutex::scoped_lock sl(_socketsMutex);\n        socketsCopy = _sockets;\n      }\n      MachineConnectionMap::iterator mcmIt;\n      for (mcmIt = socketsCopy.begin(); mcmIt != socketsCopy.end(); ++mcmIt) {\n        TransportSocketConnectionMap& tscm = mcmIt->second;\n        TransportSocketConnectionMap::iterator tscmIt;\n        for (tscmIt = tscm.begin(); tscmIt != tscm.end(); ++tscmIt) {\n          TransportSocketConnection& tsc = tscmIt->second;\n          tsc.socket->disconnected.disconnect(tscmIt->second.disconnectLink);\n          tsc.socket->connected.disconnect(tscmIt->second.connectLink);\n          \/\/remove callback before calling disconnect. (we dont need them)\n          if (tscmIt->second.socket->isConnected())\n            tscmIt->second.socket->disconnect();\n          tscmIt->second.promise.setError(\"session closed\");\n        }\n      }\n    }\n  }\n\n  qi::Future<qi::TransportSocketPtr> TransportSocketCache::socket(const ServiceInfo& servInfo) {\n    qi::UrlVector endpoints;\n    qi::UrlVector::const_iterator urlIt;\n\n    bool local = servInfo.machineId() == qi::os::getMachineId();\n\n    \/\/ RFC 3330 - http:\/\/tools.ietf.org\/html\/rfc3330\n    \/\/   -> 127.0.0.0\/8 is assigned to loopback address.\n    \/\/\n    \/\/ This filters endpoints. If we are on the same machine, we just try to\n    \/\/ connect on the loopback address, else we will try on all endpoints we\n    \/\/ have that are not loopback.\n    for (urlIt = servInfo.endpoints().begin(); urlIt != servInfo.endpoints().end(); ++urlIt) {\n      qi::Url url = *urlIt;\n      if (!url.isValid())\n        continue;\n      if (url.host().substr(0, 4) == \"127.\") {\n        if (local) {\n          endpoints.push_back(url);\n          break;\n        }\n      } else if (!local) {\n        endpoints.push_back(url);\n      }\n    }\n\n    {\n      boost::mutex::scoped_lock sl(_socketsMutex);\n      if (_dying)\n        return qi::makeFutureError<qi::TransportSocketPtr>(\"TransportSocketCache is closed.\");\n\n      \/\/ From here, we will see if we have a pending\/established connection to\n      \/\/ machineId on one of the endpoints (they all share the same promise\n      \/\/ anyway). If it is the case, we return its future.\n      MachineConnectionMap::iterator mcmIt;\n      if ((mcmIt = _sockets.find(servInfo.machineId())) != _sockets.end()) {\n        TransportSocketConnectionMap& tscm = mcmIt->second;\n        TransportSocketConnectionMap::iterator tscmIt;\n        for (urlIt = endpoints.begin(); urlIt != endpoints.end(); ++urlIt) {\n          if ((tscmIt = tscm.find((*urlIt).str())) != tscm.end()) {\n            TransportSocketConnection& tsc = tscmIt->second;\n            if (tsc.promise.future().hasError()) {\n              \/\/ When we have a socket with an error, we will try to connect to\n              \/\/ all endpoints in case the old one is completely down.\n              continue;\n            }\n            qiLogVerbose(\"tsc.socket\") << \"A connection is pending or already\"\n                                       << \" established.\";\n            return tsc.promise.future();\n          }\n        }\n      }\n\n      \/\/ Launching connections to all endpoints at the same time. They all share\n      \/\/ the same promise.\n      qi::Promise<qi::TransportSocketPtr> prom;\n\n      \/\/ We will need this to report error (to know if all sockets didn't\n      \/\/ connect).\n      TransportSocketConnectionAttempt& tsca = _attempts[servInfo.machineId()];\n      tsca.promise = prom;\n      tsca.socket_count = 0;\n      tsca.successful = false;\n\n      \/\/ This part launches all the socket connections on the same promise. The\n      \/\/ first socket to connect is the winner.\n      TransportSocketConnectionMap& tscm = _sockets[servInfo.machineId()];\n      for (urlIt = endpoints.begin(); urlIt != endpoints.end(); ++urlIt) {\n        qi::Url url = *urlIt;\n        qi::TransportSocketPtr socket = makeTransportSocket(url.protocol());\n        TransportSocketConnection& tsc = tscm[url.str()];\n        qiLogVerbose(\"tsc.socket\") << \"Attempting connection to \" << url.str()\n                                   << \" of machine id \" << servInfo.machineId();\n        tsc.socket = socket;\n        tsc.promise = prom;\n        tsc.url = url;\n        tsc.connectLink = socket->connected.connect(boost::bind(&TransportSocketCache::onSocketConnected, this, socket, servInfo, url));\n        tsc.disconnectLink = socket->disconnected.connect(boost::bind(&TransportSocketCache::onSocketDisconnected, this, _1, socket, servInfo, url));\n        socket->connect(url).async();\n        tsca.socket_count++;\n      }\n      return prom.future();\n    } \/\/ ! boost::mutex::scoped_lock\n  }\n\n  void TransportSocketCache::onSocketDisconnected(int error, TransportSocketPtr socket, const qi::ServiceInfo& servInfo, const qi::Url& url) {\n    {\n      boost::mutex::scoped_lock sl(_socketsMutex);\n\n      \/\/ First, we get the attempts of the machineId. It is used to know if we\n      \/\/ have pending connections to other endpoints.\n      MachineAttemptsMap::iterator mamIt;\n      if ((mamIt = _attempts.find(servInfo.machineId())) == _attempts.end()) {\n        \/\/ Unknown error. This shouldn't happen...\n        return;\n      }\n      TransportSocketConnectionAttempt& tsca = mamIt->second;\n\n      if (_dying) {\n        tsca.promise.setError(\"TransportSocketCache is closed.\");\n        return;\n      }\n\n      tsca.socket_count--;\n      if (tsca.socket_count != 0) {\n        \/\/ We still have some sockets attempting to connect to the service, so\n        \/\/ we just ignore this disconnection.\n        return;\n      }\n\n      \/\/ No socket can be created, we just return an error.\n      std::stringstream ss;\n      ss << \"Failed to connect to service \" << servInfo.name() << \" on \"\n         << \"machine \" << servInfo.machineId() << \". All endpoints are \"\n         << \"unavailable.\";\n      tsca.promise.setError(ss.str());\n    } \/\/ ! boost::mutex::scoped_lock\n  }\n\n  \/*\n   * Corner case to manage (TODO):\n   *\n   * You are connecting to machineId foo, you are machineId bar. foo and bar are\n   * on different sub-networks with the same netmask. They sadly got the same IP\n   * on their subnet: 192.168.1.42. When trying to connect to foo from bar, we\n   * will try to connect its endpoints, basically:\n   *   - tcp:\/\/1.2.3.4:1333 (public IP)\n   *   - tcp:\/\/192.168.1.42:1333 (subnet public IP)\n   * If bar is listening on port 1333, we may connect to it instead of foo (our\n   * real target).\n   *\/\n  void TransportSocketCache::onSocketConnected(TransportSocketPtr socket, const qi::ServiceInfo& servInfo, const qi::Url& url) {\n    {\n      boost::mutex::scoped_lock sl(_socketsMutex);\n\n      MachineAttemptsMap::iterator mamIt;\n      if ((mamIt = _attempts.find(servInfo.machineId())) == _attempts.end()) {\n        \/\/ Unknown error. This shouldn't happen...\n        return;\n      }\n      TransportSocketConnectionAttempt& tsca = mamIt->second;\n\n      if (_dying) {\n        tsca.promise.setError(\"TransportSocketCache is closed.\");\n        return;\n      }\n\n      if (tsca.successful) {\n        \/\/ If we are already connected to this service, disconnect this socket.\n        socket->disconnect();\n        return;\n      }\n\n      \/\/ Else, we set promise to this socket. We have a winner.\n      MachineConnectionMap::iterator mcmIt;\n      if ((mcmIt = _sockets.find(servInfo.machineId())) != _sockets.end()) {\n        TransportSocketConnectionMap& tscm = mcmIt->second;\n        TransportSocketConnectionMap::iterator tscmIt;\n        if ((tscmIt = tscm.find(url.str())) != tscm.end()) {\n          tscmIt->second.promise.setValue(socket);\n          tsca.successful = true;\n        }\n      }\n    } \/\/ ! boost::mutex::scoped_lock\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\r\n#include <type_traits>\r\n\r\n\r\nusing std::cout;\r\nusing std::endl;\r\n\r\n\r\nclass JustBeforeReturnEvent {\r\n    \/\/ ...\r\n};\r\n\r\nclass CoutShouter {\r\npublic:\r\n    static void handle(const JustBeforeReturnEvent& evt) {\r\n        cout << \"Goodbye!\\n\";\r\n    }\r\n};\r\n\r\nclass QuietGuy {};\r\n\r\ntemplate <typename... Args>\r\nstruct type_list;\r\n\r\ntemplate <typename Type>\r\nstruct type_list<Type> {\r\n    using head = Type;\r\n};\r\n\r\ntemplate <typename Head, typename... Tail>\r\nstruct type_list<Head, Tail...> : type_list<Head> {\r\n    using tail = type_list<Tail...>;\r\n};\r\n\r\n\r\ntemplate <typename List>\r\nclass has_tail_1 {\r\n    template <typename X>\r\n    static std::true_type test(typename X::tail* x = 0);\r\n    \r\n    template <typename X>\r\n    static std::false_type test(...);\r\n    \r\npublic:    \r\n    static constexpr bool value = decltype(test<List>(0))();\r\n};\r\n\r\n\r\ntemplate <typename...>\r\nusing void_t = void;\r\n\r\ntemplate <typename, typename = void>\r\nstruct has_tail_2 : std::false_type {};\r\n\r\ntemplate <typename T>\r\nstruct has_tail_2<T, void_t<typename T::tail>> : std::true_type {};\r\n\r\ntemplate <typename T, typename = void>\r\nstruct count : std::integral_constant<int, 1> {};\r\n\r\ntemplate <typename T>\r\nstruct count<T, void_t<typename T::tail>> :\r\n    std::integral_constant<int, 1 + count<typename T::tail>()>\r\n{};\r\n\r\ntemplate <typename Listeners>\r\nclass Dispatcher {\r\n    template <typename Handler, typename Evt, typename = void>\r\n    struct has_handler : std::false_type {};\r\n    \r\n    template <typename Handler, typename Evt>\r\n    struct has_handler<Handler, Evt, decltype( Handler::handle( std::declval<const Evt&>() ) )> : \r\n        std::true_type {};\r\n    \r\n    template <typename Evt, typename List, bool HasTail, typename = void>\r\n    struct post_impl;\r\n    \r\n    \/\/ Case 1: no tail, has a handler\r\n    template <typename Evt, typename List>\r\n    struct post_impl<Evt, List, true, \r\n                     typename std::enable_if<\r\n                        has_handler<typename List::head, Evt>::value\r\n                     >::type>\r\n    {\r\n        static void call(const Evt& evt) {\r\n            cout << \"I've got a tail\";\r\n            List::head::handle(evt);\r\n            using Tail = typename List::tail;\r\n            post_impl<Evt, Tail, has_tail_2<Tail>::value>::call(evt);\r\n        }\r\n    };\r\n    \r\n    \/\/ Case 2: has no tail, has a handler\r\n    template <typename Evt, typename List>\r\n    struct post_impl<Evt, List, false,\r\n                     typename std::enable_if<\r\n                        has_handler<typename List::head, Evt>::value\r\n                     >::type>\r\n    {\r\n        static void call(const Evt& evt) {\r\n            cout << \"I don't\";\r\n            List::head::handle(evt);\r\n        }\r\n    };\r\n        \r\n    \/\/ Case 3: has a tail, has no handler\r\n    \r\npublic:\r\n    template <typename Evt>\r\n    static void post(const Evt& t) {\r\n        post_impl<Evt, Listeners, has_tail_2<Listeners>::value>::call(t);\r\n    }\r\n};\r\n\r\nint main() {    \r\n    using listeners = type_list<CoutShouter>;\r\n    using listeners_2 = type_list<CoutShouter, CoutShouter>;\r\n\r\n    cout << has_tail_1<listeners>::value << endl;\r\n    cout << has_tail_2<listeners_2>() << endl;\r\n    \r\n    cout << count<listeners>() << endl;\r\n    cout << count<listeners_2>() << endl;\r\n    \r\n    cout << \"listeners 1: \";\r\n    Dispatcher<listeners>::post(JustBeforeReturnEvent{});\r\n    \r\n    cout << \"listeners_2: \";\r\n    Dispatcher<listeners_2>::post(JustBeforeReturnEvent{});\r\n    return 0;\r\n}<commit_msg>Now we're cooking with fire!<commit_after>#include <iostream>\r\n#include <type_traits>\r\n\r\n\r\nusing std::cout;\r\nusing std::endl;\r\n\r\n\r\nclass JustBeforeReturnEvent {\r\n    \/\/ ...\r\n};\r\n\r\nclass CoutShouter {\r\npublic:\r\n    static void handle(const JustBeforeReturnEvent& evt) {\r\n        cout << \"Goodbye!\\n\";\r\n    }\r\n};\r\n\r\nclass QuietGuy {};\r\n\r\ntemplate <typename... Args>\r\nstruct type_list;\r\n\r\ntemplate <typename Type>\r\nstruct type_list<Type> {\r\n    using head = Type;\r\n};\r\n\r\ntemplate <typename Head, typename... Tail>\r\nstruct type_list<Head, Tail...> : type_list<Head> {\r\n    using tail = type_list<Tail...>;\r\n};\r\n\r\n\r\ntemplate <typename List>\r\nclass has_tail_1 {\r\n    template <typename X>\r\n    static std::true_type test(typename X::tail* x = 0);\r\n    \r\n    template <typename X>\r\n    static std::false_type test(...);\r\n    \r\npublic:    \r\n    static constexpr bool value = decltype(test<List>(0))();\r\n};\r\n\r\n\r\ntemplate <typename...>\r\nusing void_t = void;\r\n\r\ntemplate <typename, typename = void>\r\nstruct has_tail_2 : std::false_type {};\r\n\r\ntemplate <typename T>\r\nstruct has_tail_2<T, void_t<typename T::tail>> : std::true_type {};\r\n\r\ntemplate <typename T, typename = void>\r\nstruct count : std::integral_constant<int, 1> {};\r\n\r\ntemplate <typename T>\r\nstruct count<T, void_t<typename T::tail>> :\r\n    std::integral_constant<int, 1 + count<typename T::tail>()>\r\n{};\r\n\r\ntemplate <typename Listeners>\r\nclass Dispatcher {\r\n    template <typename Handler, typename Evt, typename = void>\r\n    struct has_handler : std::false_type {};\r\n    \r\n    template <typename Handler, typename Evt>\r\n    struct has_handler<Handler, Evt, decltype( Handler::handle( std::declval<const Evt&>() ) )> : \r\n        std::true_type {};\r\n    \r\n    template <typename Evt, typename List, bool HasTail, bool HasHandler>\r\n    struct post_impl;\r\n    \r\n    \/\/ Case 1: Has tail, has a handler\r\n    template <typename Evt, typename List>\r\n    struct post_impl<Evt, List, true, true>\r\n    {\r\n        static void call(const Evt& evt) {\r\n            List::head::handle(evt);\r\n            using Tail = typename List::tail;\r\n            constexpr bool has_handler_v = has_handler<typename Tail::head, Evt>::value;\r\n            post_impl<Evt, Tail, has_tail_2<Tail>::value, has_handler_v>::call(evt);\r\n        }\r\n    };\r\n\r\n    \/\/ Case 2: Has no tail, has a handler\r\n    template <typename Evt, typename List>\r\n    struct post_impl<Evt, List, false, true>\r\n    {\r\n        static void call(const Evt& evt) {\r\n            List::head::handle(evt);\r\n        }\r\n    };\r\n\r\n    \/\/ Case 3: Has tail, has no handler\r\n    template <typename Evt, typename List>\r\n    struct post_impl<Evt, List, true, false>\r\n    {\r\n        static void call(const Evt& evt) {\r\n            using Tail = typename List::tail;\r\n            constexpr bool has_handler_v = has_handler<typename Tail::head, Evt>::value;\r\n            post_impl<Evt, Tail, has_tail_2<Tail>::value, has_handler_v>::call(evt);\r\n        }\r\n    };\r\n    \r\n    \/\/ Case 4: Has no tail, has no handler\r\n    template <typename Evt, typename List>\r\n    struct post_impl<Evt, List, false, false>\r\n    {\r\n        static void call(const Evt& evt) {\r\n            \/\/ do nothing.\r\n        }\r\n    };\r\n        \r\npublic:\r\n    template <typename Evt>\r\n    static void post(const Evt& t) {\r\n        constexpr bool has_handler_v = has_handler<typename Listeners::head, Evt>::value;\r\n        post_impl<Evt, Listeners, has_tail_2<Listeners>::value, has_handler_v>::call(t);\r\n    }\r\n};\r\n\r\nint main() {    \r\n    using listeners = type_list<CoutShouter, QuietGuy>;\r\n    using listeners_2 = type_list<CoutShouter, CoutShouter>;\r\n    using listeners_3 = type_list<QuietGuy, QuietGuy, QuietGuy, QuietGuy>;\r\n\r\n    cout << has_tail_1<listeners>::value << endl;\r\n    cout << has_tail_2<listeners_2>() << endl;\r\n    \r\n    cout << count<listeners>() << endl;\r\n    cout << count<listeners_2>() << endl;\r\n    \r\n    cout << \"listeners 1: \";\r\n    Dispatcher<listeners>::post(JustBeforeReturnEvent{});\r\n    \r\n    cout << \"listeners_2: \";\r\n    Dispatcher<listeners_2>::post(JustBeforeReturnEvent{});\r\n    \r\n    cout << \"listeners_3: \";\r\n    Dispatcher<listeners_3>::post(JustBeforeReturnEvent{});\r\n    return 0;\r\n}<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cmath>\n#include <limits>\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace _acmacs_base_internal\n{\n    template <char Tag> class SizeScale\n    {\n     public:\n        inline SizeScale() : mValue(0) {}\n        inline explicit SizeScale(double aValue) : mValue(aValue) {}\n          \/\/ inline SizeScale(const SizeScale& a) = default;\n        inline SizeScale& operator = (double aValue) { mValue = aValue; return *this; }\n        inline double value() const { return mValue; }\n        inline SizeScale operator \/ (double a) const { return SizeScale{mValue \/ a}; }\n        inline SizeScale operator * (double a) const { return SizeScale{mValue * a}; }\n        inline SizeScale& operator *= (double a) { mValue *= a; return *this; }\n        inline SizeScale operator - () const { return SizeScale{- mValue}; }\n        inline bool empty() const { return std::isnan(mValue); }\n        static SizeScale make_empty() { return SizeScale(std::numeric_limits<double>::quiet_NaN()); }\n\n     private:\n        double mValue;\n    };\n}\n\nusing Pixels = _acmacs_base_internal::SizeScale<'P'>; \/\/ size in pixels, indepenent from the surface internal coordinate system\nusing Scaled = _acmacs_base_internal::SizeScale<'S'>; \/\/ size in the surface internal coordinate system\n\n\/\/ ----------------------------------------------------------------------\n\nusing Aspect = _acmacs_base_internal::SizeScale<'A'>;\nusing Rotation = _acmacs_base_internal::SizeScale<'R'>;\n\n#include \"acmacs-base\/global-constructors-push.hh\"\n\nconst Rotation NoRotation{0.0};\nconst Aspect AspectNormal{1.0};\n\n#include \"acmacs-base\/diagnostics-pop.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>minor improvement<commit_after>#pragma once\n\n#include <cmath>\n#include <limits>\n\n#include \"float.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace _acmacs_base_internal\n{\n    template <char Tag> class SizeScale\n    {\n     public:\n        inline SizeScale() : mValue(0) {}\n        inline explicit SizeScale(double aValue) : mValue(aValue) {}\n          \/\/ inline SizeScale(const SizeScale& a) = default;\n        inline bool operator==(SizeScale a) const { return float_equal(mValue, a.mValue); }\n        inline SizeScale& operator = (double aValue) { mValue = aValue; return *this; }\n        inline double value() const { return mValue; }\n        inline SizeScale operator \/ (double a) const { return SizeScale{mValue \/ a}; }\n        inline SizeScale operator * (double a) const { return SizeScale{mValue * a}; }\n        inline SizeScale& operator *= (double a) { mValue *= a; return *this; }\n        inline SizeScale operator - () const { return SizeScale{- mValue}; }\n        inline bool empty() const { return std::isnan(mValue); }\n        static SizeScale make_empty() { return SizeScale(std::numeric_limits<double>::quiet_NaN()); }\n\n     private:\n        double mValue;\n    };\n}\n\nusing Pixels = _acmacs_base_internal::SizeScale<'P'>; \/\/ size in pixels, indepenent from the surface internal coordinate system\nusing Scaled = _acmacs_base_internal::SizeScale<'S'>; \/\/ size in the surface internal coordinate system\n\n\/\/ ----------------------------------------------------------------------\n\nusing Aspect = _acmacs_base_internal::SizeScale<'A'>;\nusing Rotation = _acmacs_base_internal::SizeScale<'R'>;\n\n#include \"acmacs-base\/global-constructors-push.hh\"\n\nconst Rotation NoRotation{0.0};\nconst Aspect AspectNormal{1.0};\n\n#include \"acmacs-base\/diagnostics-pop.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- RIFF.cpp - Binary container file format --------------------------===\/\/\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 \"RIFF.h\"\n#include \"llvm\/Support\/Endian.h\"\n\nusing namespace llvm;\nnamespace clang {\nnamespace clangd {\nnamespace riff {\n\nstatic Error makeError(const char *Msg) {\n  return createStringError(inconvertibleErrorCode(), Msg);\n}\n\nExpected<Chunk> readChunk(StringRef &Stream) {\n  if (Stream.size() < 8)\n    return makeError(\"incomplete chunk header\");\n  Chunk C;\n  std::copy(Stream.begin(), Stream.begin() + 4, C.ID.begin());\n  Stream = Stream.drop_front(4);\n  uint32_t Len = support::endian::read32le(Stream.take_front(4).begin());\n  Stream = Stream.drop_front(4);\n  if (Stream.size() < Len)\n    return makeError(\"truncated chunk\");\n  C.Data = Stream.take_front(Len);\n  Stream = Stream.drop_front(Len);\n  if (Len % 2 & !Stream.empty()) { \/\/ Skip padding byte.\n    if (Stream.front())\n      return makeError(\"nonzero padding byte\");\n    Stream = Stream.drop_front();\n  }\n  return std::move(C);\n};\n\nraw_ostream &operator<<(raw_ostream &OS, const Chunk &C) {\n  OS.write(C.ID.data(), C.ID.size());\n  char Size[4];\n  llvm::support::endian::write32le(Size, C.Data.size());\n  OS.write(Size, sizeof(Size));\n  OS << C.Data;\n  if (C.Data.size() % 2)\n    OS.write(0);\n  return OS;\n}\n\nllvm::Expected<File> readFile(llvm::StringRef Stream) {\n  auto RIFF = readChunk(Stream);\n  if (!RIFF)\n    return RIFF.takeError();\n  if (RIFF->ID != fourCC(\"RIFF\"))\n    return makeError(\"not a RIFF container\");\n  if (RIFF->Data.size() < 4)\n    return makeError(\"RIFF chunk too short\");\n  File F;\n  std::copy(RIFF->Data.begin(), RIFF->Data.begin() + 4, F.Type.begin());\n  for (llvm::StringRef Body = RIFF->Data.drop_front(4); !Body.empty();)\n    if (auto Chunk = readChunk(Body)) {\n      F.Chunks.push_back(*Chunk);\n    } else\n      return Chunk.takeError();\n  return std::move(F);\n}\n\nraw_ostream &operator<<(raw_ostream &OS, const File &F) {\n  \/\/ To avoid copies, we serialize the outer RIFF chunk \"by hand\".\n  size_t DataLen = 4; \/\/ Predict length of RIFF chunk data.\n  for (const auto &C : F.Chunks)\n    DataLen += 4 + 4 + C.Data.size() + (C.Data.size() % 2);\n  OS << \"RIFF\";\n  char Size[4];\n  llvm::support::endian::write32le(Size, DataLen);\n  OS.write(Size, sizeof(Size));\n  OS.write(F.Type.data(), F.Type.size());\n  for (const auto &C : F.Chunks)\n    OS << C;\n  return OS;\n}\n\n} \/\/ namespace riff\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<commit_msg>Remove unnecessary semicolon to silence -Wpedantic warning. NFCI.<commit_after>\/\/===--- RIFF.cpp - Binary container file format --------------------------===\/\/\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 \"RIFF.h\"\n#include \"llvm\/Support\/Endian.h\"\n\nusing namespace llvm;\nnamespace clang {\nnamespace clangd {\nnamespace riff {\n\nstatic Error makeError(const char *Msg) {\n  return createStringError(inconvertibleErrorCode(), Msg);\n}\n\nExpected<Chunk> readChunk(StringRef &Stream) {\n  if (Stream.size() < 8)\n    return makeError(\"incomplete chunk header\");\n  Chunk C;\n  std::copy(Stream.begin(), Stream.begin() + 4, C.ID.begin());\n  Stream = Stream.drop_front(4);\n  uint32_t Len = support::endian::read32le(Stream.take_front(4).begin());\n  Stream = Stream.drop_front(4);\n  if (Stream.size() < Len)\n    return makeError(\"truncated chunk\");\n  C.Data = Stream.take_front(Len);\n  Stream = Stream.drop_front(Len);\n  if (Len % 2 & !Stream.empty()) { \/\/ Skip padding byte.\n    if (Stream.front())\n      return makeError(\"nonzero padding byte\");\n    Stream = Stream.drop_front();\n  }\n  return std::move(C);\n}\n\nraw_ostream &operator<<(raw_ostream &OS, const Chunk &C) {\n  OS.write(C.ID.data(), C.ID.size());\n  char Size[4];\n  llvm::support::endian::write32le(Size, C.Data.size());\n  OS.write(Size, sizeof(Size));\n  OS << C.Data;\n  if (C.Data.size() % 2)\n    OS.write(0);\n  return OS;\n}\n\nllvm::Expected<File> readFile(llvm::StringRef Stream) {\n  auto RIFF = readChunk(Stream);\n  if (!RIFF)\n    return RIFF.takeError();\n  if (RIFF->ID != fourCC(\"RIFF\"))\n    return makeError(\"not a RIFF container\");\n  if (RIFF->Data.size() < 4)\n    return makeError(\"RIFF chunk too short\");\n  File F;\n  std::copy(RIFF->Data.begin(), RIFF->Data.begin() + 4, F.Type.begin());\n  for (llvm::StringRef Body = RIFF->Data.drop_front(4); !Body.empty();)\n    if (auto Chunk = readChunk(Body)) {\n      F.Chunks.push_back(*Chunk);\n    } else\n      return Chunk.takeError();\n  return std::move(F);\n}\n\nraw_ostream &operator<<(raw_ostream &OS, const File &F) {\n  \/\/ To avoid copies, we serialize the outer RIFF chunk \"by hand\".\n  size_t DataLen = 4; \/\/ Predict length of RIFF chunk data.\n  for (const auto &C : F.Chunks)\n    DataLen += 4 + 4 + C.Data.size() + (C.Data.size() % 2);\n  OS << \"RIFF\";\n  char Size[4];\n  llvm::support::endian::write32le(Size, DataLen);\n  OS.write(Size, sizeof(Size));\n  OS.write(F.Type.data(), F.Type.size());\n  for (const auto &C : F.Chunks)\n    OS << C;\n  return OS;\n}\n\n} \/\/ namespace riff\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<|endoftext|>"}
{"text":"<commit_before>\/*\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., 51 Franklin Street, Fifth Floor,\n   Boston, MA 02110-1301, USA.\n*\/\n\n#include \"qtscriptcomponent.h\"\n\n#include <QtScript\/QScriptEngine>\n\n#include <gameobject.h>\n#include <core\/debughelper.h>\n\nREGISTER_OBJECTTYPE(GluonEngine, QtScriptComponent)\n\nusing namespace GluonEngine;\n\nclass QtScriptComponent::QtScriptComponentPrivate\n{\n    public:\n        QtScriptComponentPrivate() { }\n\n        QString code;\n        QScriptEngine engine;\n\n        QScriptValue script;\n};\n\nQtScriptComponent::QtScriptComponent ( QObject* parent ) : Component ( parent )\n{\n    d = new QtScriptComponentPrivate;\n}\n\nQtScriptComponent::QtScriptComponent ( const QtScriptComponent& other )\n    : Component ( other ),\n    d(other.d)\n{\n}\n\nQtScriptComponent::~QtScriptComponent()\n{\n\n}\n\nGluonCore::GluonObject* QtScriptComponent::instantiate()\n{\n    return new QtScriptComponent(this);\n}\n\nvoid QtScriptComponent::start()\n{\n    d->script = d->engine.evaluate(code());\n    QScriptValue object = d->engine.newQObject(gameObject());\n    d->engine.globalObject().setProperty(\"gameObject\", object);\n\n    QScriptValue startFunc = d->engine.globalObject().property(\"start\");\n    if(startFunc.isFunction())\n        startFunc.call();\n}\n\nvoid QtScriptComponent::draw ( int timeLapse )\n{\n    QScriptValue drawFunc = d->engine.globalObject().property(\"draw\");\n    if(drawFunc.isFunction())\n        drawFunc.call(QScriptValue(), QScriptValueList() << timeLapse);\n}\n\nvoid QtScriptComponent::update ( int elapsedMilliseconds )\n{\n    QScriptValue updateFunc = d->engine.globalObject().property(\"update\");\n    if(updateFunc.isFunction())\n        updateFunc.call(QScriptValue(), QScriptValueList() << elapsedMilliseconds);\n}\n\nQString QtScriptComponent::code()\n{\n    return d->code;\n}\n\nvoid QtScriptComponent::setCode(const QString& code)\n{\n    d->code = code;\n}\n\nQ_EXPORT_PLUGIN2(gluon_component_qtscript, GluonEngine::QtScriptComponent);\n\n#include \"qtscriptcomponent.moc\"\n<commit_msg>Add some debug output and more global objects to the scritable component<commit_after>\/*\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., 51 Franklin Street, Fifth Floor,\n   Boston, MA 02110-1301, USA.\n*\/\n\n#include \"qtscriptcomponent.h\"\n\n#include <QtScript\/QScriptEngine>\n#include <QtCore\/QDebug>\n\n#include <gameobject.h>\n#include <core\/debughelper.h>\n#include <game.h>\n\nREGISTER_OBJECTTYPE(GluonEngine, QtScriptComponent)\n\nusing namespace GluonEngine;\n\nclass QtScriptComponent::QtScriptComponentPrivate\n{\n    public:\n        QtScriptComponentPrivate() { }\n\n        QString code;\n        QScriptEngine engine;\n        QScriptValue thisObject;\n};\n\nQtScriptComponent::QtScriptComponent ( QObject* parent ) : Component ( parent )\n{\n    d = new QtScriptComponentPrivate;\n}\n\nQtScriptComponent::QtScriptComponent ( const QtScriptComponent& other )\n    : Component ( other ),\n    d(other.d)\n{\n}\n\nQtScriptComponent::~QtScriptComponent()\n{\n\n}\n\nGluonCore::GluonObject* QtScriptComponent::instantiate()\n{\n    return new QtScriptComponent(this);\n}\n\nvoid QtScriptComponent::start()\n{\n    d->engine.evaluate(code(), gameObject()->name());\n    if(!d->engine.uncaughtException().isNull()) {\n        qDebug() << d->engine.uncaughtException().toString();\n        qDebug() << d->engine.uncaughtExceptionBacktrace().join(\" \");\n        return;\n    }\n\n    d->thisObject = d->engine.newQObject(this);\n    d->engine.globalObject().setProperty(\"Component\", d->thisObject);\n\n    QScriptValue object = d->engine.newQObject(gameObject());\n    d->engine.globalObject().setProperty(\"GameObject\", object);\n\n    object = d->engine.newQObject(Game::instance());\n    d->engine.globalObject().setProperty(\"Game\", object);\n\n    QScriptValue startFunc = d->engine.globalObject().property(\"start\");\n    if(startFunc.isFunction()) {\n        startFunc.call(d->thisObject);\n        if(!d->engine.uncaughtException().isNull()) {\n            qDebug() << d->engine.uncaughtException().toString();\n            qDebug() << d->engine.uncaughtExceptionBacktrace().join(\" \");\n        }\n    }\n}\n\nvoid QtScriptComponent::draw ( int timeLapse )\n{\n    QScriptValue drawFunc = d->engine.globalObject().property(\"draw\");\n    if(drawFunc.isFunction()) {\n        drawFunc.call(d->thisObject, QScriptValueList() << timeLapse);\n        if(!d->engine.uncaughtException().isNull()) {\n            qDebug() << d->engine.uncaughtException().toString();\n            qDebug() << d->engine.uncaughtExceptionBacktrace().join(\" \");\n        }\n    }\n}\n\nvoid QtScriptComponent::update ( int elapsedMilliseconds )\n{\n    QScriptValue updateFunc = d->engine.globalObject().property(\"update\");\n    if(updateFunc.isFunction()) {\n        updateFunc.call(d->thisObject, QScriptValueList() << elapsedMilliseconds);\n        if(!d->engine.uncaughtException().isNull()) {\n            qDebug() << d->engine.uncaughtException().toString();\n            qDebug() << d->engine.uncaughtExceptionBacktrace().join(\" \");\n        }\n    }\n}\n\nQString QtScriptComponent::code()\n{\n    return d->code;\n}\n\nvoid QtScriptComponent::setCode(const QString& code)\n{\n    d->code = code;\n}\n\nQ_EXPORT_PLUGIN2(gluon_component_qtscript, GluonEngine::QtScriptComponent);\n\n#include \"qtscriptcomponent.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2015 Chaobin Zhang. All rights reserved.\n\/\/ Use of this source code is governed by the BSD license that can be\n\/\/ found in the LICENSE file.\n\n#include \"master\/master_main_runner.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/files\/file_util.h\"\n#include \"base\/files\/scoped_file.h\"\n#include \"base\/hash.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"common\/util.h\"\n#include \"curl\/curl.h\"\n#include \"master\/master_rpc.h\"\n#include \"ninja\/dn_builder.h\"\n#include \"ninja\/ninja_main.h\"\n#include \"thread\/ninja_thread.h\"\n\nnamespace {\n\nconst char kHttp[] = \"http:\/\/\";\n\nsize_t write_data(void *ptr, size_t size, size_t nmemb, FILE *stream) {\n  return fwrite(ptr, size, nmemb, stream);\n}\n\nvoid FetchTargetsOnBlockingPool(const std::string& host,\n                                const std::vector<std::string>& targets) {\n  CURL* curl = curl_easy_init();\n  for (size_t i = 0; i < targets.size(); ++i) {\n    base::FilePath filename = base::FilePath::FromUTF8Unsafe(targets[i]);\n    CHECK(base::CreateDirectory(filename.DirName()));\n    std::string url = kHttp + host + \"\/\" + targets[i];\n    base::ScopedFILE file(base::OpenFile(filename, \"wb\"));\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, file.get());\n    CHECK(curl_easy_perform(curl) == CURLE_OK);\n  }\n  curl_easy_cleanup(curl);\n}\n\n}  \/\/ namespace\n\nnamespace master {\n\nMasterMainRunner::MasterMainRunner(const std::string& bind_ip, uint16 port)\n    : bind_ip_(bind_ip),\n      port_(port),\n      number_of_slave_processors_(0) {\n  \/\/ |curl_global_init| is not thread-safe, following advice in docs of\n  \/\/ |curl_easy_init|, we call it manually.\n  curl_global_init(CURL_GLOBAL_ALL);\n}\n\nMasterMainRunner::~MasterMainRunner() {\n  curl_global_cleanup();\n}\n\nbool MasterMainRunner::PostCreateThreads() {\n  master_rpc_.reset(new MasterRPC(bind_ip_, port_, this));\n  return true;\n}\n\nvoid MasterMainRunner::StartBuild() {\n  std::string error;\n  config_.parallelism = common::GuessParallelism();\n  ninja_main()->RunBuild(ninja_main()->state().DefaultNodes(&error), this);\n}\n\nbool MasterMainRunner::LocalCanRunMore() {\n  size_t subproc_number =\n      subprocs_.running_.size() + subprocs_.finished_.size();\n  return static_cast<int>(subproc_number) < config_.parallelism;\n}\n\nbool MasterMainRunner::RemoteCanRunMore() {\n  return static_cast<int>(outstanding_edges_.size()) <=\n      number_of_slave_processors_;\n}\n\nbool MasterMainRunner::StartCommand(Edge* edge, bool run_in_local) {\n  if (run_in_local)\n    return StartCommandLocally(edge);\n  else\n    return StartCommandRemotely(edge);\n}\n\nbool MasterMainRunner::StartCommandLocally(Edge* edge) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  \/\/ Create directories necessary for outputs.\n  for (vector<Node*>::iterator o = edge->outputs_.begin();\n       o != edge->outputs_.end(); ++o) {\n    if (!ninja_main()->disk_interface()->MakeDirs((*o)->path()))\n      return false;\n  }\n\n  \/\/ Create response file, if needed\n  std::string rspfile = edge->GetUnescapedRspfile();\n  if (!rspfile.empty()) {\n    std::string content = edge->GetBinding(\"rspfile_content\");\n    if (!ninja_main()->disk_interface()->WriteFile(rspfile, content))\n      return false;\n  }\n\n  std::string command = edge->EvaluateCommand();\n  Subprocess* subproc = subprocs_.Add(command, edge->use_console());\n  if (!subproc)\n    return false;\n  subproc_to_edge_.insert(make_pair(subproc, edge));\n  return true;\n}\n\nbool MasterMainRunner::StartCommandRemotely(Edge* edge) {\n  int connection_id = FindMostAvailableSlave();\n  if (connection_id == INT_MIN)\n    return false;\n\n  MasterRPC::Directories dirs;\n  for (vector<Node*>::iterator o = edge->outputs_.begin();\n       o != edge->outputs_.end();\n       ++o) {\n    dirs.push_back((*o)->path());\n  }\n\n  std::string command = edge->EvaluateCommand();\n  uint32 edge_id = base::Hash(command);\n  outstanding_edges_[edge_id] = edge;\n  NinjaThread::PostTask(\n      NinjaThread::RPC,\n      FROM_HERE,\n      base::Bind(&MasterRPC::StartCommandRemotely,\n                 base::Unretained(master_rpc_.get()),\n                 connection_id,\n                 dirs,\n                 edge->GetUnescapedRspfile(),\n                 edge->GetBinding(\"rspfile_content\"),\n                 command,\n                 edge_id));\n  return true;\n}\n\nbool MasterMainRunner::WaitForCommand(CommandRunner::Result* result) {\n  Subprocess* subproc;\n  while ((subproc = subprocs_.NextFinished()) == NULL) {\n    bool interrupted = subprocs_.DoWork();\n    if (interrupted)\n      return false;\n  }\n\n  result->status = subproc->Finish();\n  result->output = subproc->GetOutput();\n\n  SubprocessToEdgeMap::iterator e = subproc_to_edge_.find(subproc);\n  result->edge = e->second;\n  subproc_to_edge_.erase(e);\n\n  delete subproc;\n  return true;\n}\n\nstd::vector<Edge*> MasterMainRunner::GetActiveEdges() {\n  std::vector<Edge*> edges;\n  for (SubprocessToEdgeMap::iterator e = subproc_to_edge_.begin();\n       e != subproc_to_edge_.end(); ++e)\n    edges.push_back(e->second);\n  return edges;\n}\n\nvoid MasterMainRunner::Abort() {\n  subprocs_.Clear();\n}\n\nbool MasterMainRunner::HasPendingLocalCommands() {\n  return !subproc_to_edge_.empty();\n}\n\nvoid MasterMainRunner::OnFetchTargetsDone(CommandRunner::Result result) {\n  DCHECK(NinjaThread::CurrentlyOn(NinjaThread::MAIN));\n  std::string error;\n  if (!ninja_main()->builder()->HasRemoteCommandRunLocally(result.edge))\n    ninja_main()->builder()->FinishCommand(&result, &error);\n}\n\nvoid MasterMainRunner::OnRemoteCommandDone(int connection_id,\n                                           uint32 edge_id,\n                                           ExitStatus status,\n                                           const std::string& output) {\n  OutstandingEdgeMap::iterator it = outstanding_edges_.find(edge_id);\n  DCHECK(it != outstanding_edges_.end());\n  CommandRunner::Result result;\n  result.edge = it->second;\n  result.status = status;\n  result.output = output;  \/\/ The output stream of the command.\n  outstanding_edges_.erase(it);\n  std::string error;\n  if (status != ExitSuccess) {\n    ninja_main()->builder()->FinishCommand(&result, &error);\n    return;\n  }\n\n  std::vector<std::string> targets;\n  for (size_t i = 0; i < result.edge->outputs_.size(); ++i)\n    targets.push_back(result.edge->outputs_[i]->path());\n\n  DCHECK(slave_info_id_map_.find(connection_id) != slave_info_id_map_.end());\n  \/\/ TODO(zhchbin): Remove hard code 8080.\n  std::string host = slave_info_id_map_[connection_id].ip + \":\" + \"8080\";\n\n  NinjaThread::PostBlockingPoolTaskAndReply(\n      FROM_HERE,\n      base::Bind(FetchTargetsOnBlockingPool, host, targets),\n      base::Bind(&MasterMainRunner::OnFetchTargetsDone, this, result));\n}\n\nvoid MasterMainRunner::OnSlaveSystemInfoAvailable(int connection_id,\n                                                  const SlaveInfo& info) {\n  if (slave_info_id_map_.find(connection_id) != slave_info_id_map_.end())\n    return;\n  if (info.operating_system_name != base::SysInfo::OperatingSystemName() ||\n      info.operating_system_architecture !=\n          base::SysInfo::OperatingSystemArchitecture()) {\n    static const string kRejectReason =\n        \"Different system name or architecture, system info of master: \\\"\" +\n        base::SysInfo::OperatingSystemName() + \", \" +\n        base::SysInfo::OperatingSystemArchitecture() + \"\\\".\";\n\n    NinjaThread::PostTask(\n        NinjaThread::RPC,\n        FROM_HERE,\n        base::Bind(&MasterRPC::QuitSlave,\n                   base::Unretained(master_rpc_.get()),\n                   connection_id,\n                   kRejectReason));\n    return;\n  }\n\n  slave_info_id_map_[connection_id] = info;\n  number_of_slave_processors_ += info.number_of_processors;\n}\n\nvoid MasterMainRunner::OnSlaveStatusUpdate(\n    int connection_id,\n    double load_average,\n    int amount_of_running_commands,\n    int64 amount_of_available_physical_memory) {\n  \/\/ Don't update the status until |OnSlaveSystemInfoAvailable| is called.\n  SlaveInfoIdMap::iterator it = slave_info_id_map_.find(connection_id);\n  if (it == slave_info_id_map_.end())\n    return;\n\n  it->second.load_average = load_average;\n  it->second.amount_of_running_commands = amount_of_running_commands;\n  it->second.amount_of_available_physical_memory =\n      amount_of_available_physical_memory;\n}\n\nvoid MasterMainRunner::OnSlaveClose(int connection_id) {\n  DCHECK(slave_info_id_map_.find(connection_id) != slave_info_id_map_.end());\n  slave_info_id_map_.erase(connection_id);\n}\n\nint MasterMainRunner::FindMostAvailableSlave() {\n  int connection_id = INT_MIN;\n  int max_number_of_available_processors = INT_MIN;\n  for (SlaveInfoIdMap::iterator it = slave_info_id_map_.begin();\n       it != slave_info_id_map_.end();\n       ++it) {\n    int tmp =\n        it->second.number_of_processors - it->second.amount_of_running_commands;\n    if (tmp > max_number_of_available_processors) {\n      tmp = max_number_of_available_processors;\n      connection_id = it->first;\n    }\n  }\n\n  return connection_id;\n}\n\n}  \/\/ namespace master\n<commit_msg>:smile:<commit_after>\/\/ Copyright (c) 2015 Chaobin Zhang. All rights reserved.\n\/\/ Use of this source code is governed by the BSD license that can be\n\/\/ found in the LICENSE file.\n\n#include \"master\/master_main_runner.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/files\/file_util.h\"\n#include \"base\/files\/scoped_file.h\"\n#include \"base\/hash.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"common\/util.h\"\n#include \"curl\/curl.h\"\n#include \"master\/master_rpc.h\"\n#include \"ninja\/dn_builder.h\"\n#include \"ninja\/ninja_main.h\"\n#include \"thread\/ninja_thread.h\"\n\nnamespace {\n\nconst char kHttp[] = \"http:\/\/\";\n\nsize_t write_data(void* ptr, size_t size, size_t count, FILE* stream) {\n  return fwrite(ptr, size, count, stream);\n}\n\nvoid FetchTargetsOnBlockingPool(const std::string& host,\n                                const std::vector<std::string>& targets) {\n  CURL* curl = curl_easy_init();\n  for (size_t i = 0; i < targets.size(); ++i) {\n    base::FilePath filename = base::FilePath::FromUTF8Unsafe(targets[i]);\n    CHECK(base::CreateDirectory(filename.DirName()));\n    std::string url = kHttp + host + \"\/\" + targets[i];\n    base::ScopedFILE file(base::OpenFile(filename, \"wb\"));\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, file.get());\n    CHECK(curl_easy_perform(curl) == CURLE_OK);\n  }\n  curl_easy_cleanup(curl);\n}\n\n}  \/\/ namespace\n\nnamespace master {\n\nMasterMainRunner::MasterMainRunner(const std::string& bind_ip, uint16 port)\n    : bind_ip_(bind_ip),\n      port_(port),\n      number_of_slave_processors_(0) {\n  \/\/ |curl_global_init| is not thread-safe, following advice in docs of\n  \/\/ |curl_easy_init|, we call it manually.\n  curl_global_init(CURL_GLOBAL_ALL);\n}\n\nMasterMainRunner::~MasterMainRunner() {\n  curl_global_cleanup();\n}\n\nbool MasterMainRunner::PostCreateThreads() {\n  master_rpc_.reset(new MasterRPC(bind_ip_, port_, this));\n  return true;\n}\n\nvoid MasterMainRunner::StartBuild() {\n  std::string error;\n  config_.parallelism = common::GuessParallelism();\n  ninja_main()->RunBuild(ninja_main()->state().DefaultNodes(&error), this);\n}\n\nbool MasterMainRunner::LocalCanRunMore() {\n  size_t subproc_number =\n      subprocs_.running_.size() + subprocs_.finished_.size();\n  return static_cast<int>(subproc_number) < config_.parallelism;\n}\n\nbool MasterMainRunner::RemoteCanRunMore() {\n  return static_cast<int>(outstanding_edges_.size()) <=\n      number_of_slave_processors_;\n}\n\nbool MasterMainRunner::StartCommand(Edge* edge, bool run_in_local) {\n  if (run_in_local)\n    return StartCommandLocally(edge);\n  else\n    return StartCommandRemotely(edge);\n}\n\nbool MasterMainRunner::StartCommandLocally(Edge* edge) {\n  base::ThreadRestrictions::AssertIOAllowed();\n\n  \/\/ Create directories necessary for outputs.\n  for (vector<Node*>::iterator o = edge->outputs_.begin();\n       o != edge->outputs_.end(); ++o) {\n    if (!ninja_main()->disk_interface()->MakeDirs((*o)->path()))\n      return false;\n  }\n\n  \/\/ Create response file, if needed\n  std::string rspfile = edge->GetUnescapedRspfile();\n  if (!rspfile.empty()) {\n    std::string content = edge->GetBinding(\"rspfile_content\");\n    if (!ninja_main()->disk_interface()->WriteFile(rspfile, content))\n      return false;\n  }\n\n  std::string command = edge->EvaluateCommand();\n  Subprocess* subproc = subprocs_.Add(command, edge->use_console());\n  if (!subproc)\n    return false;\n  subproc_to_edge_.insert(make_pair(subproc, edge));\n  return true;\n}\n\nbool MasterMainRunner::StartCommandRemotely(Edge* edge) {\n  int connection_id = FindMostAvailableSlave();\n  if (connection_id == INT_MIN)\n    return false;\n\n  MasterRPC::Directories dirs;\n  for (vector<Node*>::iterator o = edge->outputs_.begin();\n       o != edge->outputs_.end();\n       ++o) {\n    dirs.push_back((*o)->path());\n  }\n\n  std::string command = edge->EvaluateCommand();\n  uint32 edge_id = base::Hash(command);\n  outstanding_edges_[edge_id] = edge;\n  NinjaThread::PostTask(\n      NinjaThread::RPC,\n      FROM_HERE,\n      base::Bind(&MasterRPC::StartCommandRemotely,\n                 base::Unretained(master_rpc_.get()),\n                 connection_id,\n                 dirs,\n                 edge->GetUnescapedRspfile(),\n                 edge->GetBinding(\"rspfile_content\"),\n                 command,\n                 edge_id));\n  return true;\n}\n\nbool MasterMainRunner::WaitForCommand(CommandRunner::Result* result) {\n  Subprocess* subproc;\n  while ((subproc = subprocs_.NextFinished()) == NULL) {\n    bool interrupted = subprocs_.DoWork();\n    if (interrupted)\n      return false;\n  }\n\n  result->status = subproc->Finish();\n  result->output = subproc->GetOutput();\n\n  SubprocessToEdgeMap::iterator e = subproc_to_edge_.find(subproc);\n  result->edge = e->second;\n  subproc_to_edge_.erase(e);\n\n  delete subproc;\n  return true;\n}\n\nstd::vector<Edge*> MasterMainRunner::GetActiveEdges() {\n  std::vector<Edge*> edges;\n  for (SubprocessToEdgeMap::iterator e = subproc_to_edge_.begin();\n       e != subproc_to_edge_.end(); ++e)\n    edges.push_back(e->second);\n  return edges;\n}\n\nvoid MasterMainRunner::Abort() {\n  subprocs_.Clear();\n}\n\nbool MasterMainRunner::HasPendingLocalCommands() {\n  return !subproc_to_edge_.empty();\n}\n\nvoid MasterMainRunner::OnFetchTargetsDone(CommandRunner::Result result) {\n  DCHECK(NinjaThread::CurrentlyOn(NinjaThread::MAIN));\n  std::string error;\n  if (!ninja_main()->builder()->HasRemoteCommandRunLocally(result.edge))\n    ninja_main()->builder()->FinishCommand(&result, &error);\n}\n\nvoid MasterMainRunner::OnRemoteCommandDone(int connection_id,\n                                           uint32 edge_id,\n                                           ExitStatus status,\n                                           const std::string& output) {\n  OutstandingEdgeMap::iterator it = outstanding_edges_.find(edge_id);\n  DCHECK(it != outstanding_edges_.end());\n  CommandRunner::Result result;\n  result.edge = it->second;\n  result.status = status;\n  result.output = output;  \/\/ The output stream of the command.\n  outstanding_edges_.erase(it);\n  std::string error;\n  if (status != ExitSuccess) {\n    ninja_main()->builder()->FinishCommand(&result, &error);\n    return;\n  }\n\n  std::vector<std::string> targets;\n  for (size_t i = 0; i < result.edge->outputs_.size(); ++i)\n    targets.push_back(result.edge->outputs_[i]->path());\n\n  DCHECK(slave_info_id_map_.find(connection_id) != slave_info_id_map_.end());\n  \/\/ TODO(zhchbin): Remove hard code 8080.\n  std::string host = slave_info_id_map_[connection_id].ip + \":\" + \"8080\";\n\n  NinjaThread::PostBlockingPoolTaskAndReply(\n      FROM_HERE,\n      base::Bind(FetchTargetsOnBlockingPool, host, targets),\n      base::Bind(&MasterMainRunner::OnFetchTargetsDone, this, result));\n}\n\nvoid MasterMainRunner::OnSlaveSystemInfoAvailable(int connection_id,\n                                                  const SlaveInfo& info) {\n  if (slave_info_id_map_.find(connection_id) != slave_info_id_map_.end())\n    return;\n  if (info.operating_system_name != base::SysInfo::OperatingSystemName() ||\n      info.operating_system_architecture !=\n          base::SysInfo::OperatingSystemArchitecture()) {\n    static const string kRejectReason =\n        \"Different system name or architecture, system info of master: \\\"\" +\n        base::SysInfo::OperatingSystemName() + \", \" +\n        base::SysInfo::OperatingSystemArchitecture() + \"\\\".\";\n\n    NinjaThread::PostTask(\n        NinjaThread::RPC,\n        FROM_HERE,\n        base::Bind(&MasterRPC::QuitSlave,\n                   base::Unretained(master_rpc_.get()),\n                   connection_id,\n                   kRejectReason));\n    return;\n  }\n\n  slave_info_id_map_[connection_id] = info;\n  number_of_slave_processors_ += info.number_of_processors;\n}\n\nvoid MasterMainRunner::OnSlaveStatusUpdate(\n    int connection_id,\n    double load_average,\n    int amount_of_running_commands,\n    int64 amount_of_available_physical_memory) {\n  \/\/ Don't update the status until |OnSlaveSystemInfoAvailable| is called.\n  SlaveInfoIdMap::iterator it = slave_info_id_map_.find(connection_id);\n  if (it == slave_info_id_map_.end())\n    return;\n\n  it->second.load_average = load_average;\n  it->second.amount_of_running_commands = amount_of_running_commands;\n  it->second.amount_of_available_physical_memory =\n      amount_of_available_physical_memory;\n}\n\nvoid MasterMainRunner::OnSlaveClose(int connection_id) {\n  DCHECK(slave_info_id_map_.find(connection_id) != slave_info_id_map_.end());\n  slave_info_id_map_.erase(connection_id);\n}\n\nint MasterMainRunner::FindMostAvailableSlave() {\n  int connection_id = INT_MIN;\n  int max_number_of_available_processors = INT_MIN;\n  for (SlaveInfoIdMap::iterator it = slave_info_id_map_.begin();\n       it != slave_info_id_map_.end();\n       ++it) {\n    int tmp =\n        it->second.number_of_processors - it->second.amount_of_running_commands;\n    if (tmp > max_number_of_available_processors) {\n      tmp = max_number_of_available_processors;\n      connection_id = it->first;\n    }\n  }\n\n  return connection_id;\n}\n\n}  \/\/ namespace master\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2022 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\n\/\/ C++ includes\n#include <algorithm> \/\/ for std::copy, std::sort\n\n\/\/ Local includes\n#include \"libmesh\/mesh_smoother_laplace.h\"\n#include \"libmesh\/mesh_tools.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/unstructured_mesh.h\"\n#include \"libmesh\/parallel.h\"\n#include \"libmesh\/parallel_ghost_sync.h\" \/\/ sync_dofobject_data_by_id()\n#include \"libmesh\/parallel_algebra.h\" \/\/ StandardType<Point>\n#include \"libmesh\/int_range.h\"\n#include \"libmesh\/elem_side_builder.h\"\n\nnamespace libMesh\n{\n\/\/ LaplaceMeshSmoother member functions\nLaplaceMeshSmoother::LaplaceMeshSmoother(UnstructuredMesh & mesh)\n  : MeshSmoother(mesh),\n    _initialized(false)\n{\n}\n\n\n\n\nvoid LaplaceMeshSmoother::smooth(unsigned int n_iterations)\n{\n  if (!_initialized)\n    this->init();\n\n  \/\/ Don't smooth the nodes on the boundary...\n  \/\/ this would change the mesh geometry which\n  \/\/ is probably not something we want!\n  auto on_boundary = MeshTools::find_boundary_nodes(_mesh);\n\n  \/\/ Also: don't smooth block bondary nodes\n  auto on_block_boundary = MeshTools::find_block_boundary_nodes(_mesh);\n\n  \/\/ Merge them\n  on_boundary.insert(on_block_boundary.begin(), on_block_boundary.end());\n\n  \/\/ We can only update the nodes after all new positions were\n  \/\/ determined. We store the new positions here\n  std::vector<Point> new_positions;\n\n  for (unsigned int n=0; n<n_iterations; n++)\n    {\n      new_positions.resize(_mesh.max_node_id());\n\n      for (auto & node : _mesh.local_node_ptr_range())\n        {\n          libmesh_error_msg_if(node == nullptr,\n                               \"[\" << _mesh.processor_id() << \"]: Node iterator returned nullptr.\");\n\n          \/\/ leave the boundary intact\n          \/\/ Only relocate the nodes which are vertices of an element\n          \/\/ All other entries of _graph (the secondary nodes) are empty\n          if (!on_boundary.count(node->id()) && (_graph[node->id()].size() > 0))\n            {\n              Point avg_position(0.,0.,0.);\n\n              for (const auto & connected_id : _graph[node->id()])\n                {\n                  \/\/ Will these nodal positions always be available\n                  \/\/ or will they refer to remote nodes?  This will\n                  \/\/ fail an assertion in the latter case, which\n                  \/\/ shouldn't occur if DistributedMesh is working\n                  \/\/ correctly.\n                  const Point & connected_node = _mesh.point(connected_id);\n\n                  avg_position.add( connected_node );\n                } \/\/ end for (j)\n\n              \/\/ Compute the average, store in the new_positions vector\n              new_positions[node->id()] = avg_position \/ static_cast<Real>(_graph[node->id()].size());\n            } \/\/ end if\n        } \/\/ end for\n\n\n      \/\/ now update the node positions (local node positions only)\n      for (auto & node : _mesh.local_node_ptr_range())\n        if (!on_boundary.count(node->id()) && (_graph[node->id()].size() > 0))\n          {\n            \/\/ Should call Point::op=\n            \/\/ libMesh::out << \"Setting node id \" << node->id() << \" to position \" << new_positions[node->id()];\n            _mesh.node_ref(node->id()) = new_positions[node->id()];\n          }\n\n      \/\/ Now the nodes which are ghosts on this processor may have been moved on\n      \/\/ the processors which own them.  So we need to synchronize with our neighbors\n      \/\/ and get the most up-to-date positions for the ghosts.\n      SyncNodalPositions sync_object(_mesh);\n      Parallel::sync_dofobject_data_by_id\n        (_mesh.comm(), _mesh.nodes_begin(), _mesh.nodes_end(), sync_object);\n\n    } \/\/ end for n_iterations\n\n  \/\/ finally adjust the second order nodes (those located between vertices)\n  \/\/ these nodes will be located between their adjacent nodes\n  \/\/ do this element-wise\n  for (auto & elem : _mesh.active_element_ptr_range())\n    {\n      \/\/ get the second order nodes (son)\n      \/\/ their element indices start at n_vertices and go to n_nodes\n      const unsigned int son_begin = elem->n_vertices();\n      const unsigned int son_end   = elem->n_nodes();\n\n      \/\/ loop over all second order nodes (son)\n      for (unsigned int son=son_begin; son<son_end; son++)\n        {\n          \/\/ Don't smooth second-order nodes which are on the boundary\n          if (!on_boundary.count(elem->node_id(son)))\n            {\n              const unsigned int n_adjacent_vertices =\n                elem->n_second_order_adjacent_vertices(son);\n\n              \/\/ calculate the new position which is the average of the\n              \/\/ position of the adjacent vertices\n              Point avg_position(0,0,0);\n              for (unsigned int v=0; v<n_adjacent_vertices; v++)\n                avg_position +=\n                  _mesh.point( elem->node_id( elem->second_order_adjacent_vertex(son,v) ) );\n\n              _mesh.node_ref(elem->node_id(son)) = avg_position \/ n_adjacent_vertices;\n            }\n        }\n    }\n}\n\n\n\n\n\nvoid LaplaceMeshSmoother::init()\n{\n  \/\/ For avoiding extraneous element side construction\n  ElemSideBuilder side_builder;\n\n  switch (_mesh.mesh_dimension())\n    {\n\n      \/\/ TODO:[BSK] Fix this to work for refined meshes...  I think\n      \/\/ the implementation was done quickly for Damien, who did not have\n      \/\/ refined grids.  Fix it here and in the original Mesh member.\n\n    case 2: \/\/ Stolen directly from build_L_graph in mesh_base.C\n      {\n        \/\/ Initialize space in the graph.  It is indexed by node id.\n        \/\/ Each node may be connected to an arbitrary number of other\n        \/\/ nodes via edges.\n        _graph.resize(_mesh.max_node_id());\n\n        auto elem_to_graph =\n          [this, &side_builder](const Elem & elem) {\n          for (auto s : elem.side_index_range())\n            {\n              \/\/ Only operate on sides which are on the\n              \/\/ boundary or for which the current element's\n              \/\/ id is greater than its neighbor's.\n              \/\/ Sides get only built once.\n              if ((elem.neighbor_ptr(s) == nullptr) ||\n                  (elem.id() > elem.neighbor_ptr(s)->id()))\n                {\n                  const Elem & side = side_builder(elem, s);\n                  _graph[side.node_id(0)].push_back(side.node_id(1));\n                  _graph[side.node_id(1)].push_back(side.node_id(0));\n                }\n            }\n        };\n\n        for (auto & elem : _mesh.active_local_element_ptr_range())\n          elem_to_graph(*elem);\n\n        if (!_mesh.processor_id())\n          for (auto & elem : _mesh.active_unpartitioned_element_ptr_range())\n            elem_to_graph(*elem);\n\n        _initialized = true;\n        break;\n      } \/\/ case 2\n\n    case 3: \/\/ Stolen blatantly from build_L_graph in mesh_base.C\n      {\n        \/\/ Extra builder for the face elements\n        ElemSideBuilder face_builder;\n\n        \/\/ Initialize space in the graph.\n        _graph.resize(_mesh.max_node_id());\n\n        auto elem_to_graph =\n          [this, &side_builder, &face_builder](const Elem & elem) {\n          for (auto f : elem.side_index_range()) \/\/ Loop over faces\n            if ((elem.neighbor_ptr(f) == nullptr) ||\n                (elem.id() > elem.neighbor_ptr(f)->id()))\n              {\n                const Elem & face = face_builder(elem, f);\n\n                for (auto s : face.side_index_range()) \/\/ Loop over face's edges\n                  {\n                    const Elem & side = side_builder(face, s);\n\n                    \/\/ At this point, we just insert the node numbers\n                    \/\/ again.  At the end we'll call sort and unique\n                    \/\/ to make sure there are no duplicates\n                    _graph[side.node_id(0)].push_back(side.node_id(1));\n                    _graph[side.node_id(1)].push_back(side.node_id(0));\n                  }\n              }\n        };\n\n        for (auto & elem : _mesh.active_local_element_ptr_range())\n          elem_to_graph(*elem);\n\n        if (!_mesh.processor_id())\n          for (auto & elem : _mesh.active_unpartitioned_element_ptr_range())\n            elem_to_graph(*elem);\n\n        _initialized = true;\n        break;\n      } \/\/ case 3\n\n    default:\n      libmesh_error_msg(\"At this time it is not possible to smooth a dimension \" << _mesh.mesh_dimension() << \"mesh.  Aborting...\");\n    }\n\n  \/\/ Done building graph from local and\/or unpartitioned elements.\n  \/\/ Let's now allgather the graph so that it is available on all\n  \/\/ processors for the actual smoothing operation.\n  this->allgather_graph();\n\n  \/\/ In 3D, it's possible for > 2 processor partitions to meet\n  \/\/ at a single edge, while in 2D only 2 processor partitions\n  \/\/ share an edge.  Therefore the allgather'd graph in 3D may\n  \/\/ now have duplicate entries and we need to remove them so\n  \/\/ they don't foul up the averaging algorithm employed by the\n  \/\/ Laplace smoother.\n  for (auto & id_vec : _graph)\n    {\n      \/\/ The std::unique algorithm removes duplicate *consecutive* elements from a range,\n      \/\/ so it only makes sense to call it on a sorted range...\n      std::sort(id_vec.begin(), id_vec.end());\n      id_vec.erase(std::unique(id_vec.begin(), id_vec.end()), id_vec.end());\n    }\n\n} \/\/ init()\n\n\n\n\nvoid LaplaceMeshSmoother::print_graph(std::ostream & out_stream) const\n{\n  for (auto i : index_range(_graph))\n    {\n      out_stream << i << \": \";\n      std::copy(_graph[i].begin(),\n                _graph[i].end(),\n                std::ostream_iterator<unsigned>(out_stream, \" \"));\n      out_stream << std::endl;\n    }\n}\n\n\n\nvoid LaplaceMeshSmoother::allgather_graph()\n{\n  \/\/ The graph data structure is not well-suited for parallel communication,\n  \/\/ so copy the graph into a single vector defined by:\n  \/\/ NA A_0 A_1 ... A_{NA} | NB B_0 B_1 ... B_{NB} | NC C_0 C_1 ... C_{NC}\n  \/\/ where:\n  \/\/ * NA is the number of graph connections for node A\n  \/\/ * A_0, A_1, etc. are the IDs connected to node A\n  std::vector<dof_id_type> flat_graph;\n\n  \/\/ Reserve at least enough space for each node to have zero entries\n  flat_graph.reserve(_graph.size());\n\n  for (const auto & id_vec : _graph)\n    {\n      \/\/ First push back the number of entries for this node\n      flat_graph.push_back (cast_int<dof_id_type>(id_vec.size()));\n\n      \/\/ Then push back all the IDs\n      for (const auto & dof : id_vec)\n        flat_graph.push_back(dof);\n    }\n\n  \/\/ \/\/ A copy of the flat graph (for printing only, delete me later)\n  \/\/ std::vector<unsigned> copy_of_flat_graph(flat_graph);\n\n  \/\/ Use the allgather routine to combine all the flat graphs on all processors\n  _mesh.comm().allgather(flat_graph);\n\n  \/\/ Now reconstruct _graph from the allgathered flat_graph.\n\n  \/\/ \/\/ (Delete me later, the copy is just for printing purposes.)\n  \/\/ std::vector<std::vector<unsigned >> copy_of_graph(_graph);\n\n  \/\/ Make sure the old graph is cleared out\n  _graph.clear();\n  _graph.resize(_mesh.max_node_id());\n\n  \/\/ Our current position in the allgather'd flat_graph\n  std::size_t cursor=0;\n\n  \/\/ There are max_node_id * n_processors entries to read in total\n  for (processor_id_type p=0; p<_mesh.n_processors(); ++p)\n    for (dof_id_type node_ctr=0; node_ctr<_mesh.max_node_id(); ++node_ctr)\n      {\n        \/\/ Read the number of entries for this node, move cursor\n        std::size_t n_entries = flat_graph[cursor++];\n\n        \/\/ Reserve space for that many more entries, then push back\n        _graph[node_ctr].reserve(_graph[node_ctr].size() + n_entries);\n\n        \/\/ Read all graph connections for this node, move the cursor each time\n        \/\/ Note: there might be zero entries but that's fine\n        for (std::size_t i=0; i<n_entries; ++i)\n          _graph[node_ctr].push_back(flat_graph[cursor++]);\n      }\n\n  \/\/ \/\/ Print local graph to uniquely named file (debugging)\n  \/\/ {\n  \/\/   \/\/ Generate unique filename for this processor\n  \/\/   std::ostringstream oss;\n  \/\/   oss << \"graph_filename_\" << _mesh.processor_id() << \".txt\";\n  \/\/   std::ofstream graph_stream(oss.str().c_str());\n  \/\/\n  \/\/   \/\/ Print the local non-flat graph\n  \/\/   std::swap(_graph, copy_of_graph);\n  \/\/   print_graph(graph_stream);\n  \/\/\n  \/\/   \/\/ Print the (local) flat graph for verification\n  \/\/   for (const auto & dof : copy_of_flat_graph)\n  \/\/     graph_stream << dof << \" \";\n  \/\/   graph_stream << \"\\n\";\n  \/\/\n  \/\/   \/\/ Print the allgather'd grap for verification\n  \/\/   for (const auto & dof : flat_graph)\n  \/\/     graph_stream << dof << \" \";\n  \/\/   graph_stream << \"\\n\";\n  \/\/\n  \/\/   \/\/ Print the global non-flat graph\n  \/\/   std::swap(_graph, copy_of_graph);\n  \/\/   print_graph(graph_stream);\n  \/\/ }\n} \/\/ allgather_graph()\n\n} \/\/ namespace libMesh\n<commit_msg>Smooth non-partitioned nodes too.<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2022 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\n\/\/ C++ includes\n#include <algorithm> \/\/ for std::copy, std::sort\n\n\/\/ Local includes\n#include \"libmesh\/mesh_smoother_laplace.h\"\n#include \"libmesh\/mesh_tools.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/unstructured_mesh.h\"\n#include \"libmesh\/parallel.h\"\n#include \"libmesh\/parallel_ghost_sync.h\" \/\/ sync_dofobject_data_by_id()\n#include \"libmesh\/parallel_algebra.h\" \/\/ StandardType<Point>\n#include \"libmesh\/int_range.h\"\n#include \"libmesh\/elem_side_builder.h\"\n\nnamespace libMesh\n{\n\/\/ LaplaceMeshSmoother member functions\nLaplaceMeshSmoother::LaplaceMeshSmoother(UnstructuredMesh & mesh)\n  : MeshSmoother(mesh),\n    _initialized(false)\n{\n}\n\n\n\n\nvoid LaplaceMeshSmoother::smooth(unsigned int n_iterations)\n{\n  if (!_initialized)\n    this->init();\n\n  \/\/ Don't smooth the nodes on the boundary...\n  \/\/ this would change the mesh geometry which\n  \/\/ is probably not something we want!\n  auto on_boundary = MeshTools::find_boundary_nodes(_mesh);\n\n  \/\/ Also: don't smooth block bondary nodes\n  auto on_block_boundary = MeshTools::find_block_boundary_nodes(_mesh);\n\n  \/\/ Merge them\n  on_boundary.insert(on_block_boundary.begin(), on_block_boundary.end());\n\n  \/\/ We can only update the nodes after all new positions were\n  \/\/ determined. We store the new positions here\n  std::vector<Point> new_positions;\n\n  for (unsigned int n=0; n<n_iterations; n++)\n    {\n      new_positions.resize(_mesh.max_node_id());\n\n      auto calculate_new_position = [this, &on_boundary, &new_positions](const Node * node) {\n        \/\/ leave the boundary intact\n        \/\/ Only relocate the nodes which are vertices of an element\n        \/\/ All other entries of _graph (the secondary nodes) are empty\n        if (!on_boundary.count(node->id()) && (_graph[node->id()].size() > 0))\n          {\n            Point avg_position(0.,0.,0.);\n\n            for (const auto & connected_id : _graph[node->id()])\n              {\n                \/\/ Will these nodal positions always be available\n                \/\/ or will they refer to remote nodes?  This will\n                \/\/ fail an assertion in the latter case, which\n                \/\/ shouldn't occur if DistributedMesh is working\n                \/\/ correctly.\n                const Point & connected_node = _mesh.point(connected_id);\n\n                avg_position.add( connected_node );\n              } \/\/ end for (j)\n\n            \/\/ Compute the average, store in the new_positions vector\n            new_positions[node->id()] = avg_position \/ static_cast<Real>(_graph[node->id()].size());\n          } \/\/ end if\n      };\n\n      \/\/ calculate new node positions (local and unpartitioned nodes only)\n      for (auto & node : _mesh.local_node_ptr_range())\n        calculate_new_position(node);\n\n      for (auto & node : as_range(_mesh.pid_nodes_begin(DofObject::invalid_processor_id),\n                                  _mesh.pid_nodes_end(DofObject::invalid_processor_id)))\n        calculate_new_position(node);\n\n\n      \/\/ now update the node positions (local and unpartitioned nodes only)\n      for (auto & node : _mesh.local_node_ptr_range())\n        if (!on_boundary.count(node->id()) && (_graph[node->id()].size() > 0))\n          *node = new_positions[node->id()];\n\n      for (auto & node : as_range(_mesh.pid_nodes_begin(DofObject::invalid_processor_id),\n                                  _mesh.pid_nodes_end(DofObject::invalid_processor_id)))\n        if (!on_boundary.count(node->id()) && (_graph[node->id()].size() > 0))\n          *node = new_positions[node->id()];\n\n      \/\/ Now the nodes which are ghosts on this processor may have been moved on\n      \/\/ the processors which own them.  So we need to synchronize with our neighbors\n      \/\/ and get the most up-to-date positions for the ghosts.\n      SyncNodalPositions sync_object(_mesh);\n      Parallel::sync_dofobject_data_by_id\n        (_mesh.comm(), _mesh.nodes_begin(), _mesh.nodes_end(), sync_object);\n\n    } \/\/ end for n_iterations\n\n  \/\/ finally adjust the second order nodes (those located between vertices)\n  \/\/ these nodes will be located between their adjacent nodes\n  \/\/ do this element-wise\n  for (auto & elem : _mesh.active_element_ptr_range())\n    {\n      \/\/ get the second order nodes (son)\n      \/\/ their element indices start at n_vertices and go to n_nodes\n      const unsigned int son_begin = elem->n_vertices();\n      const unsigned int son_end   = elem->n_nodes();\n\n      \/\/ loop over all second order nodes (son)\n      for (unsigned int son=son_begin; son<son_end; son++)\n        {\n          \/\/ Don't smooth second-order nodes which are on the boundary\n          if (!on_boundary.count(elem->node_id(son)))\n            {\n              const unsigned int n_adjacent_vertices =\n                elem->n_second_order_adjacent_vertices(son);\n\n              \/\/ calculate the new position which is the average of the\n              \/\/ position of the adjacent vertices\n              Point avg_position(0,0,0);\n              for (unsigned int v=0; v<n_adjacent_vertices; v++)\n                avg_position +=\n                  _mesh.point( elem->node_id( elem->second_order_adjacent_vertex(son,v) ) );\n\n              _mesh.node_ref(elem->node_id(son)) = avg_position \/ n_adjacent_vertices;\n            }\n        }\n    }\n}\n\n\n\n\n\nvoid LaplaceMeshSmoother::init()\n{\n  \/\/ For avoiding extraneous element side construction\n  ElemSideBuilder side_builder;\n\n  switch (_mesh.mesh_dimension())\n    {\n\n      \/\/ TODO:[BSK] Fix this to work for refined meshes...  I think\n      \/\/ the implementation was done quickly for Damien, who did not have\n      \/\/ refined grids.  Fix it here and in the original Mesh member.\n\n    case 2: \/\/ Stolen directly from build_L_graph in mesh_base.C\n      {\n        \/\/ Initialize space in the graph.  It is indexed by node id.\n        \/\/ Each node may be connected to an arbitrary number of other\n        \/\/ nodes via edges.\n        _graph.resize(_mesh.max_node_id());\n\n        auto elem_to_graph =\n          [this, &side_builder](const Elem & elem) {\n          for (auto s : elem.side_index_range())\n            {\n              \/\/ Only operate on sides which are on the\n              \/\/ boundary or for which the current element's\n              \/\/ id is greater than its neighbor's.\n              \/\/ Sides get only built once.\n              if ((elem.neighbor_ptr(s) == nullptr) ||\n                  (elem.id() > elem.neighbor_ptr(s)->id()))\n                {\n                  const Elem & side = side_builder(elem, s);\n                  _graph[side.node_id(0)].push_back(side.node_id(1));\n                  _graph[side.node_id(1)].push_back(side.node_id(0));\n                }\n            }\n        };\n\n        for (auto & elem : _mesh.active_local_element_ptr_range())\n          elem_to_graph(*elem);\n\n        if (!_mesh.processor_id())\n          for (auto & elem : _mesh.active_unpartitioned_element_ptr_range())\n            elem_to_graph(*elem);\n\n        _initialized = true;\n        break;\n      } \/\/ case 2\n\n    case 3: \/\/ Stolen blatantly from build_L_graph in mesh_base.C\n      {\n        \/\/ Extra builder for the face elements\n        ElemSideBuilder face_builder;\n\n        \/\/ Initialize space in the graph.\n        _graph.resize(_mesh.max_node_id());\n\n        auto elem_to_graph =\n          [this, &side_builder, &face_builder](const Elem & elem) {\n          for (auto f : elem.side_index_range()) \/\/ Loop over faces\n            if ((elem.neighbor_ptr(f) == nullptr) ||\n                (elem.id() > elem.neighbor_ptr(f)->id()))\n              {\n                const Elem & face = face_builder(elem, f);\n\n                for (auto s : face.side_index_range()) \/\/ Loop over face's edges\n                  {\n                    const Elem & side = side_builder(face, s);\n\n                    \/\/ At this point, we just insert the node numbers\n                    \/\/ again.  At the end we'll call sort and unique\n                    \/\/ to make sure there are no duplicates\n                    _graph[side.node_id(0)].push_back(side.node_id(1));\n                    _graph[side.node_id(1)].push_back(side.node_id(0));\n                  }\n              }\n        };\n\n        for (auto & elem : _mesh.active_local_element_ptr_range())\n          elem_to_graph(*elem);\n\n        if (!_mesh.processor_id())\n          for (auto & elem : _mesh.active_unpartitioned_element_ptr_range())\n            elem_to_graph(*elem);\n\n        _initialized = true;\n        break;\n      } \/\/ case 3\n\n    default:\n      libmesh_error_msg(\"At this time it is not possible to smooth a dimension \" << _mesh.mesh_dimension() << \"mesh.  Aborting...\");\n    }\n\n  \/\/ Done building graph from local and\/or unpartitioned elements.\n  \/\/ Let's now allgather the graph so that it is available on all\n  \/\/ processors for the actual smoothing operation.\n  this->allgather_graph();\n\n  \/\/ In 3D, it's possible for > 2 processor partitions to meet\n  \/\/ at a single edge, while in 2D only 2 processor partitions\n  \/\/ share an edge.  Therefore the allgather'd graph in 3D may\n  \/\/ now have duplicate entries and we need to remove them so\n  \/\/ they don't foul up the averaging algorithm employed by the\n  \/\/ Laplace smoother.\n  for (auto & id_vec : _graph)\n    {\n      \/\/ The std::unique algorithm removes duplicate *consecutive* elements from a range,\n      \/\/ so it only makes sense to call it on a sorted range...\n      std::sort(id_vec.begin(), id_vec.end());\n      id_vec.erase(std::unique(id_vec.begin(), id_vec.end()), id_vec.end());\n    }\n\n} \/\/ init()\n\n\n\n\nvoid LaplaceMeshSmoother::print_graph(std::ostream & out_stream) const\n{\n  for (auto i : index_range(_graph))\n    {\n      out_stream << i << \": \";\n      std::copy(_graph[i].begin(),\n                _graph[i].end(),\n                std::ostream_iterator<unsigned>(out_stream, \" \"));\n      out_stream << std::endl;\n    }\n}\n\n\n\nvoid LaplaceMeshSmoother::allgather_graph()\n{\n  \/\/ The graph data structure is not well-suited for parallel communication,\n  \/\/ so copy the graph into a single vector defined by:\n  \/\/ NA A_0 A_1 ... A_{NA} | NB B_0 B_1 ... B_{NB} | NC C_0 C_1 ... C_{NC}\n  \/\/ where:\n  \/\/ * NA is the number of graph connections for node A\n  \/\/ * A_0, A_1, etc. are the IDs connected to node A\n  std::vector<dof_id_type> flat_graph;\n\n  \/\/ Reserve at least enough space for each node to have zero entries\n  flat_graph.reserve(_graph.size());\n\n  for (const auto & id_vec : _graph)\n    {\n      \/\/ First push back the number of entries for this node\n      flat_graph.push_back (cast_int<dof_id_type>(id_vec.size()));\n\n      \/\/ Then push back all the IDs\n      for (const auto & dof : id_vec)\n        flat_graph.push_back(dof);\n    }\n\n  \/\/ \/\/ A copy of the flat graph (for printing only, delete me later)\n  \/\/ std::vector<unsigned> copy_of_flat_graph(flat_graph);\n\n  \/\/ Use the allgather routine to combine all the flat graphs on all processors\n  _mesh.comm().allgather(flat_graph);\n\n  \/\/ Now reconstruct _graph from the allgathered flat_graph.\n\n  \/\/ \/\/ (Delete me later, the copy is just for printing purposes.)\n  \/\/ std::vector<std::vector<unsigned >> copy_of_graph(_graph);\n\n  \/\/ Make sure the old graph is cleared out\n  _graph.clear();\n  _graph.resize(_mesh.max_node_id());\n\n  \/\/ Our current position in the allgather'd flat_graph\n  std::size_t cursor=0;\n\n  \/\/ There are max_node_id * n_processors entries to read in total\n  for (processor_id_type p=0; p<_mesh.n_processors(); ++p)\n    for (dof_id_type node_ctr=0; node_ctr<_mesh.max_node_id(); ++node_ctr)\n      {\n        \/\/ Read the number of entries for this node, move cursor\n        std::size_t n_entries = flat_graph[cursor++];\n\n        \/\/ Reserve space for that many more entries, then push back\n        _graph[node_ctr].reserve(_graph[node_ctr].size() + n_entries);\n\n        \/\/ Read all graph connections for this node, move the cursor each time\n        \/\/ Note: there might be zero entries but that's fine\n        for (std::size_t i=0; i<n_entries; ++i)\n          _graph[node_ctr].push_back(flat_graph[cursor++]);\n      }\n\n  \/\/ \/\/ Print local graph to uniquely named file (debugging)\n  \/\/ {\n  \/\/   \/\/ Generate unique filename for this processor\n  \/\/   std::ostringstream oss;\n  \/\/   oss << \"graph_filename_\" << _mesh.processor_id() << \".txt\";\n  \/\/   std::ofstream graph_stream(oss.str().c_str());\n  \/\/\n  \/\/   \/\/ Print the local non-flat graph\n  \/\/   std::swap(_graph, copy_of_graph);\n  \/\/   print_graph(graph_stream);\n  \/\/\n  \/\/   \/\/ Print the (local) flat graph for verification\n  \/\/   for (const auto & dof : copy_of_flat_graph)\n  \/\/     graph_stream << dof << \" \";\n  \/\/   graph_stream << \"\\n\";\n  \/\/\n  \/\/   \/\/ Print the allgather'd grap for verification\n  \/\/   for (const auto & dof : flat_graph)\n  \/\/     graph_stream << dof << \" \";\n  \/\/   graph_stream << \"\\n\";\n  \/\/\n  \/\/   \/\/ Print the global non-flat graph\n  \/\/   std::swap(_graph, copy_of_graph);\n  \/\/   print_graph(graph_stream);\n  \/\/ }\n} \/\/ allgather_graph()\n\n} \/\/ namespace libMesh\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *  @file       The code is for the exercises in C++ Primmer 5th Edition\n *  @author     Alan.W\n *  @date       23  DEC 2013\n *  @remark\n ***************************************************************************\/\n\/\/!\n\/\/! Exercise 12.12:\n\/\/! Using the declarations of p and sp explain each of the following calls to\n\/\/! process. If the call is legal, explain what it does. If the call is illegal,\n\/\/! explain why:\n\/\/  See comments below.\n\/\/!\n\n#include <iostream>\n#include <vector>\n#include <string>\n#include <memory>\n\nvoid process(std::shared_ptr<int> ptr)\n{\n    std::cout << \"inside the process function:\" << ptr.use_count() << \"\\n\";\n}\n\nint main()\n{\n    auto p = new int();\n    auto sp = std::make_shared<int>();\n\n    \/** @brief\n     *  legal. Just copy sp which is a shared_ptr to process().\n     *\/\n    \/\/ process(sp);\n\n    \/** @brief\n     *  illegale.plain pointer can not convert to smart pointer implicitly.\n     *\/\n    \/\/ process(new int());\n\n    \/** @brief\n     *  illegale.plain pointer can not convert to smart pointer implicitly.\n     *\/\n    \/\/ process(p);\n\n    \/** @brief\n     *  Legal. But it's a bad practice to do so.\n     *  Because using smart pointer together with raw pointer could potentially\n     * cause problems.\n     *  For example double free as shown in #145.\n     *\n     *  Check issue #145 for detail, thx @endyul for reporting\n     *\/\n    \/\/ process(std::shared_ptr<int>(p));\n\n    return 0;\n}\n<commit_msg>Update ex12_12.cpp<commit_after>\/\/!\n\/\/! Exercise 12.12:\n\/\/! Using the declarations of p and sp explain each of the following calls to\n\/\/! process. If the call is legal, explain what it does. If the call is illegal,\n\/\/! explain why:\n\/\/!\n\n#include <iostream>\n#include <memory>\n\nusing namespace std;\n\nvoid process(shared_ptr<int> ptr)\n{\n    cout<<\"inside the process function: \"<<ptr.use_count()<<endl;\n}\n\nint main()\n{\n    auto p=new int();\n    auto sp=make_shared<Int>();\n    \n    \/\/legal. Just copy sp which is a shared_ptr to process().\n    process(sp);\n    \n    \/\/illegal. Plain pointer can not convert to smart pointer implicitly.\n    process(new int());\n    \n    \/\/illegal. Plain pointer can not convert to smart pointer implicitly.\n    process(p);\n    \n    \/\/It's a bad practice to do so.\n    \/\/Because using smart pointer together with raw pointer could\n    \/\/potentially cause problems.\n    process(shared_ptr<int>(p));\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix international domain printing bug.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <fcntl.h>\n\n#include \"gtest\/gtest.h\"\n\nclass OpenTest : public testing::Test {\n\nprotected:\n  OpenTest(): fd_(-1), path_(\"\/tmp\/apue.log\") {}\n\n  virtual void SetUp() {\n    fd_ = open(path_, O_RDONLY | O_CREAT);\n    printf(\"-- %d--> create %s\\n\", fd_, path_);\n  }\n\n  virtual void TearDown() {\n    int r = close(fd_);\n    printf(\"-- %d--> close %s\\n\", r, path_);\n  }\n  \n  int fd_;\n  const char* path_;\n};\n\nTEST_F(OpenTest, TestReadOnly) {\n  int fd = open(path_, O_RDONLY);\n  printf(\"-- fd = %d read only\\n\", fd); \n  close(fd); \n}\n\nTEST_F(OpenTest, TestWriteOnly) {\n  int fd = open(path_, O_WRONLY);\n  printf(\"-- fd = %d write only\\n\", fd); \n  close(fd); \n}\n\nTEST_F(OpenTest, TestRDWR) {\n  int fd = open(path_, O_RDWR);\n  printf(\"-- fd = %d read writer\\n\", fd); \n  close(fd); \n}\n\nTEST_F(OpenTest, TestEXEC) {\n  int fd = open(path_, O_CREAT);\n  printf(\"-- fd = %d, create\\n\", fd); \n  close(fd); \n}\n\nint main(int argc, char* argv[]) {\n  ::testing::InitGoogleTest(&argc, argv);\n  return RUN_ALL_TESTS();\n}\n<commit_msg>learning & fighting<commit_after>#include <stdio.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n\n#include \"gtest\/gtest.h\"\n\nclass OpenTest : public testing::Test {\n\nprotected:\n  OpenTest(): fd_(-1), path_(\"\/tmp\/apue.log\") {}\n\n  virtual void SetUp() {\n    fd_ = open(path_, O_RDONLY | O_CREAT, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n    printf(\"-- %d--> create %s\\n\", fd_, path_);\n    int r = close(fd_);\n    printf(\"-- %d--> close %s\\n\", r, path_);\n  }\n\n  virtual void TearDown() {\n    printf(\"-- --> tear down ...\\n\");\n  }\n  \n  int fd_;\n  const char* path_;\n};\n\nTEST_F(OpenTest, TestReadOnly) {\n  int fd = open(path_, O_RDONLY);\n  printf(\"-- fd = %d read only\\n\", fd); \n  EXPECT_EQ(3, fd);\n  close(fd); \n}\n\nTEST_F(OpenTest, TestWriteOnly) {\n  int fd = open(path_, O_WRONLY);\n  printf(\"-- fd = %d write only\\n\", fd); \n  EXPECT_EQ(3, fd);\n  close(fd); \n}\n\nTEST_F(OpenTest, TestRDWR) {\n  int fd = open(path_, O_RDWR);\n  printf(\"-- fd = %d read write\\n\", fd); \n  EXPECT_EQ(3, fd);\n  close(fd); \n}\n\n\/\/ opensuse not surpport the O_EXEC option.\n\/\/TEST_F(OpenTest, TestEXEC) {\n\/\/  int fd = open(path_, O_EXEC);\n\/\/  printf(\"-- fd = %d, exec\\n\", fd); \n\/\/  close(fd); \n\/\/}\n\n\/\/ opensuse no surport the O_SEARCH option.\n\/\/TEST_F(OpenTest, TestSearch) {\n\/\/  int fd = open(path_, O_SEARCH);\n\/\/  printf(\"-- fd = %d, search\\n\", fd); \n\/\/  close(fd); \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\/*  json.cpp                                                             *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                    http:\/\/www.godotengine.org                         *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2017 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 \"json.h\"\n#include \"print_string.h\"\n\nconst char * JSON::tk_name[TK_MAX] = {\n\t\"'{'\",\n\t\"'}'\",\n\t\"'['\",\n\t\"']'\",\n\t\"identifier\",\n\t\"string\",\n\t\"number\",\n\t\"':'\",\n\t\"','\",\n\t\"EOF\",\n};\n\n\n\nString JSON::_print_var(const Variant& p_var) {\n\n\tswitch(p_var.get_type()) {\n\n\t\tcase Variant::NIL: return \"null\";\n\t\tcase Variant::BOOL: return p_var.operator bool() ? \"true\": \"false\";\n\t\tcase Variant::INT: return itos(p_var);\n\t\tcase Variant::REAL: return rtos(p_var);\n\t\tcase Variant::POOL_INT_ARRAY:\n\t\tcase Variant::POOL_REAL_ARRAY:\n\t\tcase Variant::POOL_STRING_ARRAY:\n\t\tcase Variant::ARRAY: {\n\n\t\t\tString s = \"[\";\n\t\t\tArray a = p_var;\n\t\t\tfor(int i=0;i<a.size();i++) {\n\t\t\t\tif (i>0)\n\t\t\t\t\ts+=\", \";\n\t\t\t\ts+=_print_var(a[i]);\n\t\t\t}\n\t\t\ts+=\"]\";\n\t\t\treturn s;\n\t\t};\n\t\tcase Variant::DICTIONARY: {\n\n\t\t\tString s = \"{\";\n\t\t\tDictionary d = p_var;\n\t\t\tList<Variant> keys;\n\t\t\td.get_key_list(&keys);\n\n\t\t\tfor (List<Variant>::Element *E=keys.front();E;E=E->next()) {\n\n\t\t\t\tif (E!=keys.front())\n\t\t\t\t\ts+=\", \";\n\t\t\t\ts+=_print_var(String(E->get()));\n\t\t\t\ts+=\":\";\n\t\t\t\ts+=_print_var(d[E->get()]);\n\t\t\t}\n\n\t\t\ts+=\"}\";\n\t\t\treturn s;\n\t\t};\n\t\tdefault: return \"\\\"\"+String(p_var).json_escape()+\"\\\"\";\n\n\t}\n\n}\n\nString JSON::print(const Variant& p_var) {\n\n\treturn _print_var(p_var);\n}\n\n\nError JSON::_get_token(const CharType *p_str, int &idx, int p_len, Token& r_token,int &line,String &r_err_str) {\n\n\twhile (true) {\n\t\tswitch(p_str[idx]) {\n\n\t\t\tcase '\\n': {\n\n\t\t\t\tline++;\n\t\t\t\tidx++;\n\t\t\t\tbreak;\n\t\t\t};\n\t\t\tcase 0: {\n\t\t\t\tr_token.type=TK_EOF;\n\t\t\t\treturn OK;\n\t\t\t} break;\n\t\t\tcase '{': {\n\n\t\t\t\tr_token.type=TK_CURLY_BRACKET_OPEN;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase '}': {\n\n\t\t\t\tr_token.type=TK_CURLY_BRACKET_CLOSE;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase '[': {\n\n\t\t\t\tr_token.type=TK_BRACKET_OPEN;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase ']': {\n\n\t\t\t\tr_token.type=TK_BRACKET_CLOSE;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase ':': {\n\n\t\t\t\tr_token.type=TK_COLON;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase ',': {\n\n\t\t\t\tr_token.type=TK_COMMA;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase '\"': {\n\n\t\t\t\tidx++;\n\t\t\t\tString str;\n\t\t\t\twhile(true) {\n\t\t\t\t\tif (p_str[idx]==0) {\n\t\t\t\t\t\tr_err_str=\"Unterminated String\";\n\t\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t\t} else if (p_str[idx]=='\"') {\n\t\t\t\t\t\tidx++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (p_str[idx]=='\\\\') {\n\t\t\t\t\t\t\/\/escaped characters...\n\t\t\t\t\t\tidx++;\n\t\t\t\t\t\tCharType next = p_str[idx];\n\t\t\t\t\t\tif (next==0) {\n\t\t\t\t\t\t\tr_err_str=\"Unterminated String\";\n\t\t\t\t\t\t\treturn  ERR_PARSE_ERROR;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tCharType res=0;\n\n\t\t\t\t\t\tswitch(next) {\n\n\t\t\t\t\t\t\tcase 'b': res=8; break;\n\t\t\t\t\t\t\tcase 't': res=9; break;\n\t\t\t\t\t\t\tcase 'n': res=10; break;\n\t\t\t\t\t\t\tcase 'f': res=12; break;\n\t\t\t\t\t\t\tcase 'r': res=13; break;\n\t\t\t\t\t\t\tcase 'u': {\n\t\t\t\t\t\t\t\t\/\/hexnumbarh - oct is deprecated\n\n\n\t\t\t\t\t\t\t\tfor(int j=0;j<4;j++) {\n\t\t\t\t\t\t\t\t\tCharType c = p_str[idx+j+1];\n\t\t\t\t\t\t\t\t\tif (c==0) {\n\t\t\t\t\t\t\t\t\t\tr_err_str=\"Unterminated String\";\n\t\t\t\t\t\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif (!((c>='0' && c<='9') || (c>='a' && c<='f') || (c>='A' && c<='F'))) {\n\n\t\t\t\t\t\t\t\t\t\tr_err_str=\"Malformed hex constant in string\";\n\t\t\t\t\t\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tCharType v;\n\t\t\t\t\t\t\t\t\tif (c>='0' && c<='9') {\n\t\t\t\t\t\t\t\t\t\tv=c-'0';\n\t\t\t\t\t\t\t\t\t} else if (c>='a' && c<='f') {\n\t\t\t\t\t\t\t\t\t\tv=c-'a';\n\t\t\t\t\t\t\t\t\t\tv+=10;\n\t\t\t\t\t\t\t\t\t} else if (c>='A' && c<='F') {\n\t\t\t\t\t\t\t\t\t\tv=c-'A';\n\t\t\t\t\t\t\t\t\t\tv+=10;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tERR_PRINT(\"BUG\");\n\t\t\t\t\t\t\t\t\t\tv=0;\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tres<<=4;\n\t\t\t\t\t\t\t\t\tres|=v;\n\n\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tidx+=4; \/\/will add at the end anyway\n\n\n\t\t\t\t\t\t\t} break;\n\t\t\t\t\t\t\t\/\/case '\\\"': res='\\\"'; break;\n\t\t\t\t\t\t\t\/\/case '\\\\': res='\\\\'; break;\n\t\t\t\t\t\t\t\/\/case '\/': res='\/'; break;\n\t\t\t\t\t\t\tdefault: {\n\t\t\t\t\t\t\t\tres = next;\n\t\t\t\t\t\t\t\t\/\/r_err_str=\"Invalid escape sequence\";\n\t\t\t\t\t\t\t\t\/\/return ERR_PARSE_ERROR;\n\t\t\t\t\t\t\t} break;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tstr+=res;\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (p_str[idx]=='\\n')\n\t\t\t\t\t\t\tline++;\n\t\t\t\t\t\tstr+=p_str[idx];\n\t\t\t\t\t}\n\t\t\t\t\tidx++;\n\t\t\t\t}\n\n\t\t\t\tr_token.type=TK_STRING;\n\t\t\t\tr_token.value=str;\n\t\t\t\treturn OK;\n\n\t\t\t} break;\n\t\t\tdefault: {\n\n\t\t\t\tif (p_str[idx]<=32) {\n\t\t\t\t\tidx++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (p_str[idx]=='-' || (p_str[idx]>='0' && p_str[idx]<='9')) {\n\t\t\t\t\t\/\/a number\n\t\t\t\t\tconst CharType *rptr;\n\t\t\t\t\tdouble number = String::to_double(&p_str[idx],&rptr);\n\t\t\t\t\tidx+=(rptr - &p_str[idx]);\n\t\t\t\t\tr_token.type=TK_NUMBER;\n\t\t\t\t\tr_token.value=number;\n\t\t\t\t\treturn OK;\n\n\t\t\t\t} else if ((p_str[idx]>='A' && p_str[idx]<='Z') || (p_str[idx]>='a' && p_str[idx]<='z')) {\n\n\t\t\t\t\tString id;\n\n\t\t\t\t\twhile((p_str[idx]>='A' && p_str[idx]<='Z') || (p_str[idx]>='a' && p_str[idx]<='z')) {\n\n\t\t\t\t\t\tid+=p_str[idx];\n\t\t\t\t\t\tidx++;\n\t\t\t\t\t}\n\n\t\t\t\t\tr_token.type=TK_IDENTIFIER;\n\t\t\t\t\tr_token.value=id;\n\t\t\t\t\treturn OK;\n\t\t\t\t} else {\n\t\t\t\t\tr_err_str=\"Unexpected character.\";\n\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\n\treturn ERR_PARSE_ERROR;\n}\n\n\n\nError JSON::_parse_value(Variant &value,Token& token,const CharType *p_str,int &index, int p_len,int &line,String &r_err_str) {\n\n\n\tif (token.type==TK_CURLY_BRACKET_OPEN) {\n\n\t\tDictionary d;\n\t\tError err = _parse_object(d,p_str,index,p_len,line,r_err_str);\n\t\tif (err)\n\t\t\treturn err;\n\t\tvalue=d;\n\t\treturn OK;\n\t} else if (token.type==TK_BRACKET_OPEN) {\n\n\t\tArray a;\n\t\tError err = _parse_array(a,p_str,index,p_len,line,r_err_str);\n\t\tif (err)\n\t\t\treturn err;\n\t\tvalue=a;\n\t\treturn OK;\n\n\t} else if (token.type==TK_IDENTIFIER) {\n\n\t\tString id = token.value;\n\t\tif (id==\"true\")\n\t\t\tvalue=true;\n\t\telse if (id==\"false\")\n\t\t\tvalue=false;\n\t\telse if (id==\"null\")\n\t\t\tvalue=Variant();\n\t\telse {\n\t\t\tr_err_str=\"Expected 'true','false' or 'null', got '\"+id+\"'.\";\n\t\t\treturn ERR_PARSE_ERROR;\n\t\t}\n\t\treturn OK;\n\n\t} else if (token.type==TK_NUMBER) {\n\n\t\tvalue=token.value;\n\t\treturn OK;\n\t} else if (token.type==TK_STRING) {\n\n\t\tvalue=token.value;\n\t\treturn OK;\n\t} else {\n\t\tr_err_str=\"Expected value, got \"+String(tk_name[token.type])+\".\";\n\t\treturn ERR_PARSE_ERROR;\n\t}\n\n\treturn ERR_PARSE_ERROR;\n}\n\n\nError JSON::_parse_array(Array &array,const CharType *p_str,int &index, int p_len,int &line,String &r_err_str) {\n\n\tToken token;\n\tbool need_comma=false;\n\n\n\twhile(index<p_len) {\n\n\t\tError err = _get_token(p_str,index,p_len,token,line,r_err_str);\n\t\tif (err!=OK)\n\t\t\treturn err;\n\n\t\tif (token.type==TK_BRACKET_CLOSE) {\n\n\t\t\treturn OK;\n\t\t}\n\n\t\tif (need_comma) {\n\n\t\t\tif (token.type!=TK_COMMA) {\n\n\t\t\t\tr_err_str=\"Expected ','\";\n\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t} else {\n\t\t\t\tneed_comma=false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tVariant v;\n\t\terr = _parse_value(v,token,p_str,index,p_len,line,r_err_str);\n\t\tif (err)\n\t\t\treturn err;\n\n\t\tarray.push_back(v);\n\t\tneed_comma=true;\n\n\t}\n\n\treturn OK;\n\n}\n\nError JSON::_parse_object(Dictionary &object,const CharType *p_str,int &index, int p_len,int &line,String &r_err_str) {\n\n\tbool at_key=true;\n\tString key;\n\tToken token;\n\tbool need_comma=false;\n\n\n\twhile(index<p_len) {\n\n\n\t\tif (at_key) {\n\n\t\t\tError err = _get_token(p_str,index,p_len,token,line,r_err_str);\n\t\t\tif (err!=OK)\n\t\t\t\treturn err;\n\n\t\t\tif (token.type==TK_CURLY_BRACKET_CLOSE) {\n\n\t\t\t\treturn OK;\n\t\t\t}\n\n\t\t\tif (need_comma) {\n\n\t\t\t\tif (token.type!=TK_COMMA) {\n\n\t\t\t\t\tr_err_str=\"Expected '}' or ','\";\n\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t} else {\n\t\t\t\t\tneed_comma=false;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (token.type!=TK_STRING) {\n\n\n\t\t\t\tr_err_str=\"Expected key\";\n\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t}\n\n\t\t\tkey=token.value;\n\t\t\terr = _get_token(p_str,index,p_len,token,line,r_err_str);\n\t\t\tif (err!=OK)\n\t\t\t\treturn err;\n\t\t\tif (token.type!=TK_COLON) {\n\n\t\t\t\tr_err_str=\"Expected ':'\";\n\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t}\n\t\t\tat_key=false;\n\t\t} else {\n\n\n\t\t\tError err = _get_token(p_str,index,p_len,token,line,r_err_str);\n\t\t\tif (err!=OK)\n\t\t\t\treturn err;\n\n\t\t\tVariant v;\n\t\t\terr = _parse_value(v,token,p_str,index,p_len,line,r_err_str);\n\t\t\tif (err)\n\t\t\t\treturn err;\n\t\t\tobject[key]=v;\n\t\t\tneed_comma=true;\n\t\t\tat_key=true;\n\t\t}\n\t}\n\n\treturn OK;\n}\n\n\nError JSON::parse(const String& p_json, Variant &r_ret, String &r_err_str, int &r_err_line) {\n\n\n\tconst CharType *str = p_json.ptr();\n\tint idx = 0;\n\tint len = p_json.length();\n\tToken token;\n\tr_err_line=0;\n\tString aux_key;\n\n\tError err = _get_token(str,idx,len,token,r_err_line,r_err_str);\n\tif (err)\n\t\treturn err;\n\n\terr = _parse_value(r_ret,token,str,idx,len,r_err_line,r_err_str);\n\n\treturn err;\n\t\n\n}\n\n\n<commit_msg>Fix error while JSON::parse with empty string<commit_after>\/*************************************************************************\/\n\/*  json.cpp                                                             *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                    http:\/\/www.godotengine.org                         *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2017 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 \"json.h\"\n#include \"print_string.h\"\n\nconst char * JSON::tk_name[TK_MAX] = {\n\t\"'{'\",\n\t\"'}'\",\n\t\"'['\",\n\t\"']'\",\n\t\"identifier\",\n\t\"string\",\n\t\"number\",\n\t\"':'\",\n\t\"','\",\n\t\"EOF\",\n};\n\n\n\nString JSON::_print_var(const Variant& p_var) {\n\n\tswitch(p_var.get_type()) {\n\n\t\tcase Variant::NIL: return \"null\";\n\t\tcase Variant::BOOL: return p_var.operator bool() ? \"true\": \"false\";\n\t\tcase Variant::INT: return itos(p_var);\n\t\tcase Variant::REAL: return rtos(p_var);\n\t\tcase Variant::POOL_INT_ARRAY:\n\t\tcase Variant::POOL_REAL_ARRAY:\n\t\tcase Variant::POOL_STRING_ARRAY:\n\t\tcase Variant::ARRAY: {\n\n\t\t\tString s = \"[\";\n\t\t\tArray a = p_var;\n\t\t\tfor(int i=0;i<a.size();i++) {\n\t\t\t\tif (i>0)\n\t\t\t\t\ts+=\", \";\n\t\t\t\ts+=_print_var(a[i]);\n\t\t\t}\n\t\t\ts+=\"]\";\n\t\t\treturn s;\n\t\t};\n\t\tcase Variant::DICTIONARY: {\n\n\t\t\tString s = \"{\";\n\t\t\tDictionary d = p_var;\n\t\t\tList<Variant> keys;\n\t\t\td.get_key_list(&keys);\n\n\t\t\tfor (List<Variant>::Element *E=keys.front();E;E=E->next()) {\n\n\t\t\t\tif (E!=keys.front())\n\t\t\t\t\ts+=\", \";\n\t\t\t\ts+=_print_var(String(E->get()));\n\t\t\t\ts+=\":\";\n\t\t\t\ts+=_print_var(d[E->get()]);\n\t\t\t}\n\n\t\t\ts+=\"}\";\n\t\t\treturn s;\n\t\t};\n\t\tdefault: return \"\\\"\"+String(p_var).json_escape()+\"\\\"\";\n\n\t}\n\n}\n\nString JSON::print(const Variant& p_var) {\n\n\treturn _print_var(p_var);\n}\n\n\nError JSON::_get_token(const CharType *p_str, int &idx, int p_len, Token& r_token,int &line,String &r_err_str) {\n\n\twhile (p_len > 0) {\n\t\tswitch(p_str[idx]) {\n\n\t\t\tcase '\\n': {\n\n\t\t\t\tline++;\n\t\t\t\tidx++;\n\t\t\t\tbreak;\n\t\t\t};\n\t\t\tcase 0: {\n\t\t\t\tr_token.type=TK_EOF;\n\t\t\t\treturn OK;\n\t\t\t} break;\n\t\t\tcase '{': {\n\n\t\t\t\tr_token.type=TK_CURLY_BRACKET_OPEN;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase '}': {\n\n\t\t\t\tr_token.type=TK_CURLY_BRACKET_CLOSE;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase '[': {\n\n\t\t\t\tr_token.type=TK_BRACKET_OPEN;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase ']': {\n\n\t\t\t\tr_token.type=TK_BRACKET_CLOSE;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase ':': {\n\n\t\t\t\tr_token.type=TK_COLON;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase ',': {\n\n\t\t\t\tr_token.type=TK_COMMA;\n\t\t\t\tidx++;\n\t\t\t\treturn OK;\n\t\t\t};\n\t\t\tcase '\"': {\n\n\t\t\t\tidx++;\n\t\t\t\tString str;\n\t\t\t\twhile(true) {\n\t\t\t\t\tif (p_str[idx]==0) {\n\t\t\t\t\t\tr_err_str=\"Unterminated String\";\n\t\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t\t} else if (p_str[idx]=='\"') {\n\t\t\t\t\t\tidx++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (p_str[idx]=='\\\\') {\n\t\t\t\t\t\t\/\/escaped characters...\n\t\t\t\t\t\tidx++;\n\t\t\t\t\t\tCharType next = p_str[idx];\n\t\t\t\t\t\tif (next==0) {\n\t\t\t\t\t\t\tr_err_str=\"Unterminated String\";\n\t\t\t\t\t\t\treturn  ERR_PARSE_ERROR;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tCharType res=0;\n\n\t\t\t\t\t\tswitch(next) {\n\n\t\t\t\t\t\t\tcase 'b': res=8; break;\n\t\t\t\t\t\t\tcase 't': res=9; break;\n\t\t\t\t\t\t\tcase 'n': res=10; break;\n\t\t\t\t\t\t\tcase 'f': res=12; break;\n\t\t\t\t\t\t\tcase 'r': res=13; break;\n\t\t\t\t\t\t\tcase 'u': {\n\t\t\t\t\t\t\t\t\/\/hexnumbarh - oct is deprecated\n\n\n\t\t\t\t\t\t\t\tfor(int j=0;j<4;j++) {\n\t\t\t\t\t\t\t\t\tCharType c = p_str[idx+j+1];\n\t\t\t\t\t\t\t\t\tif (c==0) {\n\t\t\t\t\t\t\t\t\t\tr_err_str=\"Unterminated String\";\n\t\t\t\t\t\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif (!((c>='0' && c<='9') || (c>='a' && c<='f') || (c>='A' && c<='F'))) {\n\n\t\t\t\t\t\t\t\t\t\tr_err_str=\"Malformed hex constant in string\";\n\t\t\t\t\t\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tCharType v;\n\t\t\t\t\t\t\t\t\tif (c>='0' && c<='9') {\n\t\t\t\t\t\t\t\t\t\tv=c-'0';\n\t\t\t\t\t\t\t\t\t} else if (c>='a' && c<='f') {\n\t\t\t\t\t\t\t\t\t\tv=c-'a';\n\t\t\t\t\t\t\t\t\t\tv+=10;\n\t\t\t\t\t\t\t\t\t} else if (c>='A' && c<='F') {\n\t\t\t\t\t\t\t\t\t\tv=c-'A';\n\t\t\t\t\t\t\t\t\t\tv+=10;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tERR_PRINT(\"BUG\");\n\t\t\t\t\t\t\t\t\t\tv=0;\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tres<<=4;\n\t\t\t\t\t\t\t\t\tres|=v;\n\n\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tidx+=4; \/\/will add at the end anyway\n\n\n\t\t\t\t\t\t\t} break;\n\t\t\t\t\t\t\t\/\/case '\\\"': res='\\\"'; break;\n\t\t\t\t\t\t\t\/\/case '\\\\': res='\\\\'; break;\n\t\t\t\t\t\t\t\/\/case '\/': res='\/'; break;\n\t\t\t\t\t\t\tdefault: {\n\t\t\t\t\t\t\t\tres = next;\n\t\t\t\t\t\t\t\t\/\/r_err_str=\"Invalid escape sequence\";\n\t\t\t\t\t\t\t\t\/\/return ERR_PARSE_ERROR;\n\t\t\t\t\t\t\t} break;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tstr+=res;\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (p_str[idx]=='\\n')\n\t\t\t\t\t\t\tline++;\n\t\t\t\t\t\tstr+=p_str[idx];\n\t\t\t\t\t}\n\t\t\t\t\tidx++;\n\t\t\t\t}\n\n\t\t\t\tr_token.type=TK_STRING;\n\t\t\t\tr_token.value=str;\n\t\t\t\treturn OK;\n\n\t\t\t} break;\n\t\t\tdefault: {\n\n\t\t\t\tif (p_str[idx]<=32) {\n\t\t\t\t\tidx++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (p_str[idx]=='-' || (p_str[idx]>='0' && p_str[idx]<='9')) {\n\t\t\t\t\t\/\/a number\n\t\t\t\t\tconst CharType *rptr;\n\t\t\t\t\tdouble number = String::to_double(&p_str[idx],&rptr);\n\t\t\t\t\tidx+=(rptr - &p_str[idx]);\n\t\t\t\t\tr_token.type=TK_NUMBER;\n\t\t\t\t\tr_token.value=number;\n\t\t\t\t\treturn OK;\n\n\t\t\t\t} else if ((p_str[idx]>='A' && p_str[idx]<='Z') || (p_str[idx]>='a' && p_str[idx]<='z')) {\n\n\t\t\t\t\tString id;\n\n\t\t\t\t\twhile((p_str[idx]>='A' && p_str[idx]<='Z') || (p_str[idx]>='a' && p_str[idx]<='z')) {\n\n\t\t\t\t\t\tid+=p_str[idx];\n\t\t\t\t\t\tidx++;\n\t\t\t\t\t}\n\n\t\t\t\t\tr_token.type=TK_IDENTIFIER;\n\t\t\t\t\tr_token.value=id;\n\t\t\t\t\treturn OK;\n\t\t\t\t} else {\n\t\t\t\t\tr_err_str=\"Unexpected character.\";\n\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\n\treturn ERR_PARSE_ERROR;\n}\n\n\n\nError JSON::_parse_value(Variant &value,Token& token,const CharType *p_str,int &index, int p_len,int &line,String &r_err_str) {\n\n\n\tif (token.type==TK_CURLY_BRACKET_OPEN) {\n\n\t\tDictionary d;\n\t\tError err = _parse_object(d,p_str,index,p_len,line,r_err_str);\n\t\tif (err)\n\t\t\treturn err;\n\t\tvalue=d;\n\t\treturn OK;\n\t} else if (token.type==TK_BRACKET_OPEN) {\n\n\t\tArray a;\n\t\tError err = _parse_array(a,p_str,index,p_len,line,r_err_str);\n\t\tif (err)\n\t\t\treturn err;\n\t\tvalue=a;\n\t\treturn OK;\n\n\t} else if (token.type==TK_IDENTIFIER) {\n\n\t\tString id = token.value;\n\t\tif (id==\"true\")\n\t\t\tvalue=true;\n\t\telse if (id==\"false\")\n\t\t\tvalue=false;\n\t\telse if (id==\"null\")\n\t\t\tvalue=Variant();\n\t\telse {\n\t\t\tr_err_str=\"Expected 'true','false' or 'null', got '\"+id+\"'.\";\n\t\t\treturn ERR_PARSE_ERROR;\n\t\t}\n\t\treturn OK;\n\n\t} else if (token.type==TK_NUMBER) {\n\n\t\tvalue=token.value;\n\t\treturn OK;\n\t} else if (token.type==TK_STRING) {\n\n\t\tvalue=token.value;\n\t\treturn OK;\n\t} else {\n\t\tr_err_str=\"Expected value, got \"+String(tk_name[token.type])+\".\";\n\t\treturn ERR_PARSE_ERROR;\n\t}\n\n\treturn ERR_PARSE_ERROR;\n}\n\n\nError JSON::_parse_array(Array &array,const CharType *p_str,int &index, int p_len,int &line,String &r_err_str) {\n\n\tToken token;\n\tbool need_comma=false;\n\n\n\twhile(index<p_len) {\n\n\t\tError err = _get_token(p_str,index,p_len,token,line,r_err_str);\n\t\tif (err!=OK)\n\t\t\treturn err;\n\n\t\tif (token.type==TK_BRACKET_CLOSE) {\n\n\t\t\treturn OK;\n\t\t}\n\n\t\tif (need_comma) {\n\n\t\t\tif (token.type!=TK_COMMA) {\n\n\t\t\t\tr_err_str=\"Expected ','\";\n\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t} else {\n\t\t\t\tneed_comma=false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tVariant v;\n\t\terr = _parse_value(v,token,p_str,index,p_len,line,r_err_str);\n\t\tif (err)\n\t\t\treturn err;\n\n\t\tarray.push_back(v);\n\t\tneed_comma=true;\n\n\t}\n\n\treturn OK;\n\n}\n\nError JSON::_parse_object(Dictionary &object,const CharType *p_str,int &index, int p_len,int &line,String &r_err_str) {\n\n\tbool at_key=true;\n\tString key;\n\tToken token;\n\tbool need_comma=false;\n\n\n\twhile(index<p_len) {\n\n\n\t\tif (at_key) {\n\n\t\t\tError err = _get_token(p_str,index,p_len,token,line,r_err_str);\n\t\t\tif (err!=OK)\n\t\t\t\treturn err;\n\n\t\t\tif (token.type==TK_CURLY_BRACKET_CLOSE) {\n\n\t\t\t\treturn OK;\n\t\t\t}\n\n\t\t\tif (need_comma) {\n\n\t\t\t\tif (token.type!=TK_COMMA) {\n\n\t\t\t\t\tr_err_str=\"Expected '}' or ','\";\n\t\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t\t} else {\n\t\t\t\t\tneed_comma=false;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (token.type!=TK_STRING) {\n\n\n\t\t\t\tr_err_str=\"Expected key\";\n\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t}\n\n\t\t\tkey=token.value;\n\t\t\terr = _get_token(p_str,index,p_len,token,line,r_err_str);\n\t\t\tif (err!=OK)\n\t\t\t\treturn err;\n\t\t\tif (token.type!=TK_COLON) {\n\n\t\t\t\tr_err_str=\"Expected ':'\";\n\t\t\t\treturn ERR_PARSE_ERROR;\n\t\t\t}\n\t\t\tat_key=false;\n\t\t} else {\n\n\n\t\t\tError err = _get_token(p_str,index,p_len,token,line,r_err_str);\n\t\t\tif (err!=OK)\n\t\t\t\treturn err;\n\n\t\t\tVariant v;\n\t\t\terr = _parse_value(v,token,p_str,index,p_len,line,r_err_str);\n\t\t\tif (err)\n\t\t\t\treturn err;\n\t\t\tobject[key]=v;\n\t\t\tneed_comma=true;\n\t\t\tat_key=true;\n\t\t}\n\t}\n\n\treturn OK;\n}\n\n\nError JSON::parse(const String& p_json, Variant &r_ret, String &r_err_str, int &r_err_line) {\n\n\n\tconst CharType *str = p_json.ptr();\n\tint idx = 0;\n\tint len = p_json.length();\n\tToken token;\n\tr_err_line=0;\n\tString aux_key;\n\n\tError err = _get_token(str,idx,len,token,r_err_line,r_err_str);\n\tif (err)\n\t\treturn err;\n\n\terr = _parse_value(r_ret,token,str,idx,len,r_err_line,r_err_str);\n\n\treturn err;\n\t\n\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"..\/util.hpp\"\n\ntemplate<int M>\nclass Cyclic {\n  using ll = long long;\n  int n;\n  static ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p%a, a)) \/ a + p); }\npublic:\n  Cyclic () : n(0) {;}\n  Cyclic (int m) : n(m) {\n    if (n >= M) n %= M;\n    else if (n < 0) n = (n % M + M) % M;\n  }\n  operator int() const { return n; }\n  bool operator==(const Cyclic &a) const { return n == a.n; }\n  Cyclic operator+=(const Cyclic &a) { n += a.n; if (n >= M) n -= M; return *this; }\n  Cyclic operator-=(const Cyclic &a) { n -= a.n; if (n < 0) n += M; return *this; }\n  Cyclic operator*=(const Cyclic &a) { n = (ll(n) * a.n) % M; return *this; }\n  Cyclic operator+(const Cyclic &a) const { Cyclic res = *this; return res += a; }\n  Cyclic operator-(const Cyclic &a) const { Cyclic res = *this; return res -= a; }\n  Cyclic operator*(const Cyclic &a) const { Cyclic res = *this; return res *= a; }\n  Cyclic operator\/(const Cyclic &a) const { return *this * Cyclic<M>(inv(a, M)); }\n  Cyclic operator^(int n) const {\n    if (n == 0) return Cyclic(1);\n    const Cyclic a = *this;\n    Cyclic res = (a * a) ^ (n \/ 2);\n    return n % 2 ? res * a : res;\n  }\n};\n\ntemplate<int M> Cyclic<M> fact(int n, bool sw = true) {\n  static vector<Cyclic<M>> v1 = {1}, v2 = {1};\n  if (n >= (int)v1.size()) {\n    const int from = v1.size(), to = n + 1024;\n    v1.reserve(to);\n    v2.reserve(to);\n    for (int i = from; i < to; ++i) {\n      v1.push_back(v1.back() * Cyclic<M>(i));\n      v2.push_back(v2.back() \/ Cyclic<M>(i));\n    }\n  }\n  return sw ? v1[n] : v2[n];\n}\n\ntemplate<int M> Cyclic<M> comb(int a, int b) {\n  return fact<M>(a, true) * fact<M>(b, false) * fact<M>(a-b, false);\n}\n\nconst int mod = 1000000007;\nusing Mod = Cyclic<mod>;\n<commit_msg>add verifier of mod<commit_after>#pragma once\n\n#include \"..\/util.hpp\"\n\ntemplate<int M>\nclass Cyclic {\n  using ll = long long;\n  int n;\n  static ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p%a, a)) \/ a + p); }\npublic:\n  Cyclic () : n(0) {;}\n  Cyclic (int m) : n(m) {\n    if (n >= M) n %= M;\n    else if (n < 0) n = (n % M + M) % M;\n  }\n  operator int() const { return n; }\n  bool operator==(const Cyclic &a) const { return n == a.n; }\n  Cyclic operator+=(const Cyclic &a) { n += a.n; if (n >= M) n -= M; return *this; }\n  Cyclic operator-=(const Cyclic &a) { n -= a.n; if (n < 0) n += M; return *this; }\n  Cyclic operator*=(const Cyclic &a) { n = (ll(n) * a.n) % M; return *this; }\n  Cyclic operator+(const Cyclic &a) const { Cyclic res = *this; return res += a; }\n  Cyclic operator-(const Cyclic &a) const { Cyclic res = *this; return res -= a; }\n  Cyclic operator*(const Cyclic &a) const { Cyclic res = *this; return res *= a; }\n  Cyclic operator\/(const Cyclic &a) const { return *this * Cyclic<M>(inv(a, M)); }\n  Cyclic operator^(int n) const {\n    if (n == 0) return Cyclic(1);\n    const Cyclic a = *this;\n    Cyclic res = (a * a) ^ (n \/ 2);\n    return n % 2 ? res * a : res;\n  }\n};\n\ntemplate<int M> Cyclic<M> fact(int n, bool sw = true) {\n  static vector<Cyclic<M>> v1 = {1}, v2 = {1};\n  if (n >= (int)v1.size()) {\n    const int from = v1.size(), to = n + 1024;\n    v1.reserve(to);\n    v2.reserve(to);\n    for (int i = from; i < to; ++i) {\n      v1.push_back(v1.back() * Cyclic<M>(i));\n      v2.push_back(v2.back() \/ Cyclic<M>(i));\n    }\n  }\n  return sw ? v1[n] : v2[n];\n}\n\ntemplate<int M> Cyclic<M> comb(int a, int b) {\n  return fact<M>(a, true) * fact<M>(b, false) * fact<M>(a-b, false);\n}\n\nconst int mod = 1000000007;\nusing Mod = Cyclic<mod>;\n\n\/\/ Verified : ABC 003D\n\/*\nint main() {\n  int R, C, X, Y, D, L;\n  cin >> R >> C >> X >> Y >> D >> L;\n  Mod a = Mod(R - X + 1) * Mod(C - Y + 1);\n  Mod b = solve(X, Y, D, L);\n  b -= solve(X-1, Y, D, L) * Mod(2);\n  b -= solve(X, Y-1, D, L) * Mod(2);\n  b += solve(X-2, Y, D, L);\n  b += solve(X, Y-2, D, L);\n  b += solve(X-1, Y-1, D, L) * Mod(4);\n  b -= solve(X-2, Y-1, D, L) * Mod(2);\n  b -= solve(X-1, Y-2, D, L) * Mod(2);\n  b += solve(X-2, Y-2, D, L);\n  cout << a * b << endl;\n  return 0;\n}\n*\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: fuline.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: obo $ $Date: 2004-01-20 12:03:02 $\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_FU_LINE_HXX\n#define SD_FU_LINE_HXX\n\n#ifndef SD_FU_POOR_HXX\n#include \"fupoor.hxx\"\n#endif\n\nnamespace sd {\n\nclass FuLine\n    : public FuPoor\n{\npublic:\n    TYPEINFO();\n\n    FuLine (\n        ViewShell* pViewSh,\n        ::sd::Window* pWin,\n        ::sd::View* pView,\n        SdDrawDocument* pDoc,\n        SfxRequest& rReq);\n    virtual ~FuLine (void) {}\n\n    virtual void Activate() {}\n    virtual void Deactivate() {}\n};\n\n} \/\/ end of namespace sd\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.562); FILE MERGED 2005\/09\/05 13:23:07 rt 1.2.562.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fuline.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 05:34: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_FU_LINE_HXX\n#define SD_FU_LINE_HXX\n\n#ifndef SD_FU_POOR_HXX\n#include \"fupoor.hxx\"\n#endif\n\nnamespace sd {\n\nclass FuLine\n    : public FuPoor\n{\npublic:\n    TYPEINFO();\n\n    FuLine (\n        ViewShell* pViewSh,\n        ::sd::Window* pWin,\n        ::sd::View* pView,\n        SdDrawDocument* pDoc,\n        SfxRequest& rReq);\n    virtual ~FuLine (void) {}\n\n    virtual void Activate() {}\n    virtual void Deactivate() {}\n};\n\n} \/\/ end of namespace sd\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/include\/graph\/bfs01.cpp\"\n\n#define REP(i,n) for(int i=0;i<(n);++i)\n\nint H, W, A;\nstring str[128];\nint getId(int i, int j, int a, int b, int dir) {\n  return i*W*(A+1)*(A+1)*4 + j*(A+1)*(A+1)*4 + a*(A+1)*4 + b*4 + dir;\n}\n\nint main() {\n  cin >> H >> W >> A;\n  REP(i,H) cin >> str[i];\n  int starty, startx, goaly, goalx;\n  REP(i,H) REP(j,W) {\n    if (str[i][j] == 'S') starty = i, startx = j;\n    if (str[i][j] == 'G') goaly = i, goalx = j;\n  }\n  Graph<int> g(H*W*(A+1)*(A+1)*4);\n  REP(i,H-1) REP(j,W) REP(a,A+1) REP(b,A+1) {\n    if (str[i+1][j] != '#')\n      add_edge(g, getId(i,j,a,b,3), getId(i+1,j,a,b,3), 0);\n    if (str[i+1][j] == '.') {\n      if (a>0) add_edge(g, getId(i,j,a,b,3), getId(i+1,j,a-1,b,0), 1);\n      if (b>0) add_edge(g, getId(i,j,a,b,3), getId(i+1,j,a,b-1,2), 1);\n    }\n    if (str[i][j] == '.' || str[i][j] == 'G') {\n      add_edge(g, getId(i+1,j,a,b,1), getId(i,j,a,b,1), 0);\n      if (a>0) add_edge(g, getId(i+1,j,a,b,1), getId(i,j,a-1,b,2), 1);\n      if (b>0) add_edge(g, getId(i+1,j,a,b,1), getId(i,j,a,b-1,0), 1);\n    }\n  }\n  REP(i,H) REP(j,W-1) REP(a,A+1) REP(b,A+1) {\n    if (str[i][j+1] != '#')\n      add_edge(g, getId(i,j,a,b,0), getId(i,j+1,a,b,0), 0);\n    if (str[i][j+1] == '.') {\n      if (a>0) add_edge(g, getId(i,j,a,b,0), getId(i,j+1,a-1,b,3), 1);\n      if (b>0) add_edge(g, getId(i,j,a,b,0), getId(i,j+1,a,b-1,1), 1);\n    }\n    if (str[i][j] != '#')\n      add_edge(g, getId(i,j+1,a,b,2), getId(i,j,a,b,2), 0);\n    if (str[i][j] == '.') {\n      if (a>0) add_edge(g, getId(i,j+1,a,b,2), getId(i,j,a-1,b,1), 1);\n      if (b>0) add_edge(g, getId(i,j+1,a,b,2), getId(i,j,a,b-1,3), 1);\n    }\n  }\n  vector<int> d = bfs01(g, getId(starty,startx,A,A,3));\n  int res = inf<int>;\n  REP(a,A+1) REP(b,A+1) REP(dir,4)\n    res = min(res, d[getId(goaly,goalx,a,b,dir)]);\n  cout << (res == inf<int> ? -1 : res) << endl;\n  return 0;\n}\n<commit_msg>bug fix<commit_after>#include \"..\/include\/graph\/bfs01.cpp\"\n\n#define REP(i,n) for(int i=0;i<(n);++i)\n\nint H, W, A;\nstring str[128];\nint getId(int i, int j, int a, int b, int dir) {\n  return i*W*(A+1)*(A+1)*4 + j*(A+1)*(A+1)*4 + a*(A+1)*4 + b*4 + dir;\n}\n\nint main() {\n  cin >> H >> W >> A;\n  REP(i,H) cin >> str[i];\n  int starty = -1, startx = -1, goaly = -1, goalx = -1;\n  REP(i,H) REP(j,W) {\n    if (str[i][j] == 'S') starty = i, startx = j;\n    if (str[i][j] == 'G') goaly = i, goalx = j;\n  }\n  Graph<int> g(H*W*(A+1)*(A+1)*4);\n  REP(i,H-1) REP(j,W) REP(a,A+1) REP(b,A+1) {\n    if (str[i+1][j] != '#')\n      add_edge(g, getId(i,j,a,b,3), getId(i+1,j,a,b,3), 0);\n    if (str[i+1][j] == '.') {\n      if (a>0) add_edge(g, getId(i,j,a,b,3), getId(i+1,j,a-1,b,0), 1);\n      if (b>0) add_edge(g, getId(i,j,a,b,3), getId(i+1,j,a,b-1,2), 1);\n    }\n    if (str[i][j] == '.' || str[i][j] == 'G') {\n      add_edge(g, getId(i+1,j,a,b,1), getId(i,j,a,b,1), 0);\n      if (a>0) add_edge(g, getId(i+1,j,a,b,1), getId(i,j,a-1,b,2), 1);\n      if (b>0) add_edge(g, getId(i+1,j,a,b,1), getId(i,j,a,b-1,0), 1);\n    }\n  }\n  REP(i,H) REP(j,W-1) REP(a,A+1) REP(b,A+1) {\n    if (str[i][j+1] != '#')\n      add_edge(g, getId(i,j,a,b,0), getId(i,j+1,a,b,0), 0);\n    if (str[i][j+1] == '.') {\n      if (a>0) add_edge(g, getId(i,j,a,b,0), getId(i,j+1,a-1,b,3), 1);\n      if (b>0) add_edge(g, getId(i,j,a,b,0), getId(i,j+1,a,b-1,1), 1);\n    }\n    if (str[i][j] != '#')\n      add_edge(g, getId(i,j+1,a,b,2), getId(i,j,a,b,2), 0);\n    if (str[i][j] == '.') {\n      if (a>0) add_edge(g, getId(i,j+1,a,b,2), getId(i,j,a-1,b,1), 1);\n      if (b>0) add_edge(g, getId(i,j+1,a,b,2), getId(i,j,a,b-1,3), 1);\n    }\n  }\n  vector<int> d = bfs01(g, getId(starty,startx,A,A,3));\n  int res = inf<int>;\n  REP(a,A+1) REP(b,A+1) REP(dir,4)\n    res = min(res, d[getId(goaly,goalx,a,b,dir)]);\n  cout << (res == inf<int> ? -1 : res) << endl;\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\r\n\r\nTriangle triangle;\r\n\r\nstatic InputElement elements[] = {\r\n\tCInputElement(\"POSITION\", SF_R32G32B32_FLOAT, 0),\r\n\tCInputElement(\"COLOR\", SF_R32G32B32_FLOAT, 12),\r\n};\r\n\r\nstruct Vertex {\r\n\tVec3 pos;\r\n\tVec3 color;\r\n};\r\n\r\nstatic Vertex vertices[] = {\r\n\t{ Vec3(0, 1, 0), Vec3(1, 1, 0) },\r\n\t{ Vec3(-1, -1, 0), Vec3(0, 1, 1) },\r\n\t{ Vec3(1, -1, 0), Vec3(1, 0, 1) },\r\n};\r\nstatic AFIndex indices[] = {\r\n\t0, 1, 2\r\n};\r\n\r\nvoid Triangle::Draw()\r\n{\r\n\tif (!vbo) {\r\n\t\treturn;\r\n\t}\r\n\tafSetPipeline(pipelineState, rootSignature);\r\n\tafSetVertexBuffer(vbo, sizeof(Vertex));\r\n\tafSetIndexBuffer(ibo);\r\n\tMat matWorld[] = {\r\n\t\tq2m(Quat(Vec3(0, 0, 1), (float)GetTime())) * translate(-1, 0, 0),\r\n\t\tq2m(Quat(Vec3(0, 1, 0), (float)GetTime())),\r\n\t\tq2m(Quat(Vec3(1, 0, 0), (float)GetTime())) * translate(1, 0, 0)\r\n\t};\r\n\tMat matProj = ortho(-2, 2, -2, 2, 0.001f, 10.0f);\r\n\tMat matView = lookatLH(Vec3(0, 0, -1), Vec3(0, 0, 0), Vec3(0, 1, 0));\r\n\tfor (int i = 0; i < dimof(matWorld); i++) {\r\n\t\tMat m = matWorld[i] * matView * matProj;\r\n\t\tafBindBufferToBindingPoint(&m, sizeof(m), 0);\r\n\t\tafDrawIndexed(PT_TRIANGLELIST, 3);\r\n\t}\r\n}\r\n\r\nvoid Triangle::Create()\r\n{\r\n\tvbo = afCreateVertexBuffer(sizeof(Vertex) * 3, vertices);\r\n\tibo = afCreateIndexBuffer(indices, _countof(indices));\r\n\tvbo->SetName(L\"Triangle vertex bugger\");\r\n\tibo->SetName(L\"Triangle index bugger\");\r\n\tpipelineState = afCreatePSO(\"solid\", elements, dimof(elements), BM_NONE, DSM_DEPTH_ENABLE, CM_DISABLE, rootSignature, D3D12_PRIMITIVE_TOPOLOGY_TYPE_TRIANGLE);\r\n}\r\n\r\nvoid Triangle::Destroy()\r\n{\r\n\tvbo.Reset();\r\n\tibo.Reset();\r\n\trootSignature.Reset();\r\n\tpipelineState.Reset();\r\n}\r\n<commit_msg>Fix typo.<commit_after>#include \"stdafx.h\"\r\n\r\nTriangle triangle;\r\n\r\nstatic InputElement elements[] = {\r\n\tCInputElement(\"POSITION\", SF_R32G32B32_FLOAT, 0),\r\n\tCInputElement(\"COLOR\", SF_R32G32B32_FLOAT, 12),\r\n};\r\n\r\nstruct Vertex {\r\n\tVec3 pos;\r\n\tVec3 color;\r\n};\r\n\r\nstatic Vertex vertices[] = {\r\n\t{ Vec3(0, 1, 0), Vec3(1, 1, 0) },\r\n\t{ Vec3(-1, -1, 0), Vec3(0, 1, 1) },\r\n\t{ Vec3(1, -1, 0), Vec3(1, 0, 1) },\r\n};\r\nstatic AFIndex indices[] = {\r\n\t0, 1, 2\r\n};\r\n\r\nvoid Triangle::Draw()\r\n{\r\n\tif (!vbo) {\r\n\t\treturn;\r\n\t}\r\n\tafSetPipeline(pipelineState, rootSignature);\r\n\tafSetVertexBuffer(vbo, sizeof(Vertex));\r\n\tafSetIndexBuffer(ibo);\r\n\tMat matWorld[] = {\r\n\t\tq2m(Quat(Vec3(0, 0, 1), (float)GetTime())) * translate(-1, 0, 0),\r\n\t\tq2m(Quat(Vec3(0, 1, 0), (float)GetTime())),\r\n\t\tq2m(Quat(Vec3(1, 0, 0), (float)GetTime())) * translate(1, 0, 0)\r\n\t};\r\n\tMat matProj = ortho(-2, 2, -2, 2, 0.001f, 10.0f);\r\n\tMat matView = lookatLH(Vec3(0, 0, -1), Vec3(0, 0, 0), Vec3(0, 1, 0));\r\n\tfor (int i = 0; i < dimof(matWorld); i++) {\r\n\t\tMat m = matWorld[i] * matView * matProj;\r\n\t\tafBindBufferToBindingPoint(&m, sizeof(m), 0);\r\n\t\tafDrawIndexed(PT_TRIANGLELIST, 3);\r\n\t}\r\n}\r\n\r\nvoid Triangle::Create()\r\n{\r\n\tvbo = afCreateVertexBuffer(sizeof(Vertex) * 3, vertices);\r\n\tibo = afCreateIndexBuffer(indices, _countof(indices));\r\n\tvbo->SetName(L\"Triangle vertex buffer\");\r\n\tibo->SetName(L\"Triangle index buffer\");\r\n\tpipelineState = afCreatePSO(\"solid\", elements, dimof(elements), BM_NONE, DSM_DEPTH_ENABLE, CM_DISABLE, rootSignature, D3D12_PRIMITIVE_TOPOLOGY_TYPE_TRIANGLE);\r\n}\r\n\r\nvoid Triangle::Destroy()\r\n{\r\n\tvbo.Reset();\r\n\tibo.Reset();\r\n\trootSignature.Reset();\r\n\tpipelineState.Reset();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id: stack_pro.cc,v 1.35 2007\/12\/16 21:46:39 sshwarts Exp $\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (C) 2001  MandrakeSoft S.A.\n\/\/\n\/\/    MandrakeSoft S.A.\n\/\/    43, rue d'Aboukir\n\/\/    75002 Paris - France\n\/\/    http:\/\/www.linux-mandrake.com\/\n\/\/    http:\/\/www.mandrakesoft.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 Software\n\/\/  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#define NEED_CPU_REG_SHORTCUTS 1\n#include \"bochs.h\"\n#include \"cpu.h\"\n#define LOG_THIS BX_CPU_THIS_PTR\n\n\nvoid BX_CPU_C::push_16(Bit16u value16)\n{\n  \/* must use StackAddrSize, and either RSP, ESP or SP accordingly *\/\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64())\n  {\n    write_virtual_word(BX_SEG_REG_SS, RSP-2, &value16);\n    RSP -= 2;\n  }\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b) { \/* StackAddrSize = 32 *\/\n    write_virtual_word(BX_SEG_REG_SS, (Bit32u) (ESP-2), &value16);\n    ESP -= 2;\n  }\n  else\n  {\n    write_virtual_word(BX_SEG_REG_SS, (Bit16u) (SP-2), &value16);\n    SP  -= 2;\n  }\n}\n\n\/* push 32 bit operand *\/\nvoid BX_CPU_C::push_32(Bit32u value32)\n{\n  \/* must use StackAddrSize, and either RSP, ESP or SP accordingly *\/\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64())\n  {\n    write_virtual_dword(BX_SEG_REG_SS, RSP-4, &value32);\n    RSP -= 4;\n  }\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b) { \/* StackAddrSize = 32 *\/\n    write_virtual_dword(BX_SEG_REG_SS, (Bit32u) (ESP-4), &value32);\n    ESP -= 4;\n  }\n  else\n  {\n    write_virtual_dword(BX_SEG_REG_SS, (Bit16u) (SP-4), &value32);\n    SP  -= 4;\n  }\n}\n\n\/* push 64 bit operand *\/\n#if BX_SUPPORT_X86_64\nvoid BX_CPU_C::push_64(Bit64u value64)\n{\n  BX_ASSERT(StackAddrSize64());\n\n  write_virtual_qword(BX_SEG_REG_SS, RSP-8, &value64);\n  RSP -= 8;\n}\n#endif\n\n\/* pop 16 bit operand from the stack *\/\nvoid BX_CPU_C::pop_16(Bit16u *value16_ptr)\n{\n  bx_address temp_RSP;\n\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64())\n    temp_RSP = RSP;\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b)\n    temp_RSP = ESP;\n  else\n    temp_RSP = SP;\n\n  read_virtual_word(BX_SEG_REG_SS, temp_RSP, value16_ptr);\n\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64())\n    RSP += 2;\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b)\n    ESP += 2;\n  else\n    SP  += 2;\n}\n\n\/* pop 32 bit operand from the stack *\/\nvoid BX_CPU_C::pop_32(Bit32u *value32_ptr)\n{\n  bx_address temp_RSP;\n\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64())\n    temp_RSP = RSP;\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b)\n    temp_RSP = ESP;\n  else\n    temp_RSP = SP;\n\n  read_virtual_dword(BX_SEG_REG_SS, temp_RSP, value32_ptr);\n\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64())\n    RSP += 4;\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b)\n    ESP += 4;\n  else\n    SP  += 4;\n}\n\n\/* pop 64 bit operand from the stack *\/\n#if BX_SUPPORT_X86_64\nvoid BX_CPU_C::pop_64(Bit64u *value64_ptr)\n{\n  BX_ASSERT(StackAddrSize64());\n\n  read_virtual_qword(BX_SEG_REG_SS, RSP, value64_ptr);\n  RSP += 8;\n}\n#endif\n\n  bx_bool BX_CPP_AttrRegparmN(3)\nBX_CPU_C::can_push(bx_descriptor_t *descriptor, Bit32u esp, Bit32u bytes)\n{\n#if BX_SUPPORT_X86_64\n  if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64) {\n    return(1);\n  }\n#endif\n\n  \/\/ small stack compares against 16-bit SP\n  if (!descriptor->u.segment.d_b)\n    esp &= 0x0000ffff;\n\n  if (descriptor->valid==0) {\n    BX_ERROR((\"can_push(): SS invalidated.\"));\n    return(0);\n  }\n\n  if (descriptor->p==0) {\n    BX_ERROR((\"can_push(): descriptor not present\"));\n    return(0);\n  }\n\n  if (IS_DATA_SEGMENT_EXPAND_DOWN(descriptor->type)) \/* expand down segment *\/\n  {\n    Bit32u expand_down_limit;\n\n    if (descriptor->u.segment.d_b)\n      expand_down_limit = 0xffffffff;\n    else\n      expand_down_limit = 0x0000ffff;\n\n    if (esp==0) {\n      BX_PANIC((\"can_push(): esp=0, wraparound?\"));\n      return(0);\n    }\n\n    if (esp < bytes) {\n      BX_PANIC((\"can_push(): expand-down: esp < N\"));\n      return(0);\n    }\n    if ((esp - bytes) <= descriptor->u.segment.limit_scaled) {\n      BX_ERROR((\"can_push(): expand-down: esp-N < limit\"));\n      return(0);\n    }\n    if (esp > expand_down_limit) {\n      BX_ERROR((\"can_push(): esp > expand-down-limit\"));\n      return(0);\n    }\n    return(1);\n  }\n  else { \/* normal (expand-up) segment *\/\n    if (descriptor->u.segment.limit_scaled==0) {\n      BX_PANIC((\"can_push(): found limit of 0\"));\n      return(0);\n    }\n\n    \/\/ Look at case where esp==0.  Possibly, it's an intentional wraparound\n    \/\/ If so, limit must be the maximum for the given stack size\n    if (esp==0) {\n      if (descriptor->u.segment.d_b && (descriptor->u.segment.limit_scaled==0xffffffff))\n        return(1);\n      if ((descriptor->u.segment.d_b==0) && (descriptor->u.segment.limit_scaled>=0xffff))\n        return(1);\n      BX_ERROR((\"can_push(): esp=0, normal, wraparound? limit=%08x\",\n        descriptor->u.segment.limit_scaled));\n      return(0);\n    }\n\n    if (!descriptor->u.segment.d_b) {\n      \/\/ Weird case for 16-bit SP.\n      esp = ((esp-bytes) & 0xffff) + bytes;\n    }\n    if (esp < bytes) {\n      BX_ERROR((\"can_push(): expand-up: esp < N\"));\n      return(0);\n    }\n    if ((esp-1) > descriptor->u.segment.limit_scaled) {\n      BX_ERROR((\"can_push(): expand-up: SP > limit\"));\n      return(0);\n    }\n    \/* all checks pass *\/\n    return(1);\n  }\n}\n\nbx_bool BX_CPU_C::can_pop(Bit32u bytes)\n{\n  Bit32u temp_ESP, expand_down_limit;\n\n#if BX_SUPPORT_X86_64\n  if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64) {\n    return(1);\n  }\n#endif\n\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b) { \/* Big bit set: use ESP *\/\n    temp_ESP = ESP;\n    expand_down_limit = 0xFFFFFFFF;\n  }\n  else { \/* Big bit clear: use SP *\/\n    temp_ESP = SP;\n    expand_down_limit = 0xFFFF;\n  }\n\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.valid==0) {\n    BX_ERROR((\"can_pop(): SS invalidated\"));\n    return(0); \/* never gets here *\/\n  }\n\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.p==0) {\n    BX_ERROR((\"can_pop(): SS.p = 0\"));\n    return(0);\n  }\n\n  if (IS_DATA_SEGMENT_EXPAND_DOWN(BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.type)) { \/* expand down *\/\n    if (temp_ESP == expand_down_limit) {\n      BX_PANIC((\"can_pop(): found SP=ffff\"));\n      return(0);\n    }\n    if (((expand_down_limit - temp_ESP) + 1) >= bytes)\n      return(1);\n    return(0);\n  }\n  else { \/* normal (expand-up) segment *\/\n    if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.limit_scaled==0) {\n      BX_ERROR((\"can_pop(): SS.limit = 0\"));\n      return(0);\n    }\n    if (temp_ESP == expand_down_limit) {\n      BX_ERROR((\"can_pop(): found SP=ffff\"));\n      return(0);\n    }\n    if (temp_ESP > BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.limit_scaled) {\n      BX_ERROR((\"can_pop(): eSP > SS.limit\"));\n      return(0);\n    }\n    if (((BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.limit_scaled - temp_ESP) + 1) >= bytes)\n      return(1);\n    return(0);\n  }\n}\n<commit_msg>cleanup<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id: stack_pro.cc,v 1.36 2007\/12\/18 21:08:55 sshwarts Exp $\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (C) 2001  MandrakeSoft S.A.\n\/\/\n\/\/    MandrakeSoft S.A.\n\/\/    43, rue d'Aboukir\n\/\/    75002 Paris - France\n\/\/    http:\/\/www.linux-mandrake.com\/\n\/\/    http:\/\/www.mandrakesoft.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 Software\n\/\/  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#define NEED_CPU_REG_SHORTCUTS 1\n#include \"bochs.h\"\n#include \"cpu.h\"\n#define LOG_THIS BX_CPU_THIS_PTR\n\n\nvoid BX_CPU_C::push_16(Bit16u value16)\n{\n  \/* must use StackAddrSize, and either RSP, ESP or SP accordingly *\/\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64())\n  {\n    write_virtual_word(BX_SEG_REG_SS, RSP-2, &value16);\n    RSP -= 2;\n  }\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b) { \/* StackAddrSize = 32 *\/\n    write_virtual_word(BX_SEG_REG_SS, (Bit32u) (ESP-2), &value16);\n    ESP -= 2;\n  }\n  else\n  {\n    write_virtual_word(BX_SEG_REG_SS, (Bit16u) (SP-2), &value16);\n    SP  -= 2;\n  }\n}\n\n\/* push 32 bit operand *\/\nvoid BX_CPU_C::push_32(Bit32u value32)\n{\n  \/* must use StackAddrSize, and either RSP, ESP or SP accordingly *\/\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64())\n  {\n    write_virtual_dword(BX_SEG_REG_SS, RSP-4, &value32);\n    RSP -= 4;\n  }\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b) { \/* StackAddrSize = 32 *\/\n    write_virtual_dword(BX_SEG_REG_SS, (Bit32u) (ESP-4), &value32);\n    ESP -= 4;\n  }\n  else\n  {\n    write_virtual_dword(BX_SEG_REG_SS, (Bit16u) (SP-4), &value32);\n    SP  -= 4;\n  }\n}\n\n\/* push 64 bit operand *\/\n#if BX_SUPPORT_X86_64\nvoid BX_CPU_C::push_64(Bit64u value64)\n{\n  BX_ASSERT(StackAddrSize64());\n\n  write_virtual_qword(BX_SEG_REG_SS, RSP-8, &value64);\n  RSP -= 8;\n}\n#endif\n\n\/* pop 16 bit operand from the stack *\/\nvoid BX_CPU_C::pop_16(Bit16u *value16_ptr)\n{\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64()) {\n    read_virtual_word(BX_SEG_REG_SS, RSP, value16_ptr);\n    RSP += 2;\n  }\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b) {\n    read_virtual_word(BX_SEG_REG_SS, ESP, value16_ptr);\n    ESP += 2;\n  }\n  else {\n    read_virtual_word(BX_SEG_REG_SS, SP, value16_ptr);\n    SP  += 2;\n  }\n}\n\n\/* pop 32 bit operand from the stack *\/\nvoid BX_CPU_C::pop_32(Bit32u *value32_ptr)\n{\n#if BX_SUPPORT_X86_64\n  if (StackAddrSize64()) {\n    read_virtual_dword(BX_SEG_REG_SS, RSP, value32_ptr);\n    RSP += 4;\n  }\n  else\n#endif\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b) {\n    read_virtual_dword(BX_SEG_REG_SS, ESP, value32_ptr);\n    ESP += 4;\n  }\n  else {\n    read_virtual_dword(BX_SEG_REG_SS, SP, value32_ptr);\n    SP  += 4;\n  }\n}\n\n\/* pop 64 bit operand from the stack *\/\n#if BX_SUPPORT_X86_64\nvoid BX_CPU_C::pop_64(Bit64u *value64_ptr)\n{\n  BX_ASSERT(StackAddrSize64());\n\n  read_virtual_qword(BX_SEG_REG_SS, RSP, value64_ptr);\n  RSP += 8;\n}\n#endif\n\n  bx_bool BX_CPP_AttrRegparmN(3)\nBX_CPU_C::can_push(bx_descriptor_t *descriptor, Bit32u esp, Bit32u bytes)\n{\n#if BX_SUPPORT_X86_64\n  if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64) {\n    return(1);\n  }\n#endif\n\n  \/\/ small stack compares against 16-bit SP\n  if (!descriptor->u.segment.d_b)\n    esp &= 0x0000ffff;\n\n  if (descriptor->valid==0) {\n    BX_ERROR((\"can_push(): SS invalidated.\"));\n    return(0);\n  }\n\n  if (descriptor->p==0) {\n    BX_ERROR((\"can_push(): descriptor not present\"));\n    return(0);\n  }\n\n  if (IS_DATA_SEGMENT_EXPAND_DOWN(descriptor->type)) \/* expand down segment *\/\n  {\n    Bit32u expand_down_limit;\n\n    if (descriptor->u.segment.d_b)\n      expand_down_limit = 0xffffffff;\n    else\n      expand_down_limit = 0x0000ffff;\n\n    if (esp==0) {\n      BX_PANIC((\"can_push(): esp=0, wraparound?\"));\n      return(0);\n    }\n\n    if (esp < bytes) {\n      BX_PANIC((\"can_push(): expand-down: esp < N\"));\n      return(0);\n    }\n    if ((esp - bytes) <= descriptor->u.segment.limit_scaled) {\n      BX_ERROR((\"can_push(): expand-down: esp-N < limit\"));\n      return(0);\n    }\n    if (esp > expand_down_limit) {\n      BX_ERROR((\"can_push(): esp > expand-down-limit\"));\n      return(0);\n    }\n    return(1);\n  }\n  else { \/* normal (expand-up) segment *\/\n    if (descriptor->u.segment.limit_scaled==0) {\n      BX_PANIC((\"can_push(): found limit of 0\"));\n      return(0);\n    }\n\n    \/\/ Look at case where esp==0.  Possibly, it's an intentional wraparound\n    \/\/ If so, limit must be the maximum for the given stack size\n    if (esp==0) {\n      if (descriptor->u.segment.d_b && (descriptor->u.segment.limit_scaled==0xffffffff))\n        return(1);\n      if ((descriptor->u.segment.d_b==0) && (descriptor->u.segment.limit_scaled>=0xffff))\n        return(1);\n      BX_ERROR((\"can_push(): esp=0, normal, wraparound? limit=%08x\",\n        descriptor->u.segment.limit_scaled));\n      return(0);\n    }\n\n    if (!descriptor->u.segment.d_b) {\n      \/\/ Weird case for 16-bit SP.\n      esp = ((esp-bytes) & 0xffff) + bytes;\n    }\n    if (esp < bytes) {\n      BX_ERROR((\"can_push(): expand-up: esp < N\"));\n      return(0);\n    }\n    if ((esp-1) > descriptor->u.segment.limit_scaled) {\n      BX_ERROR((\"can_push(): expand-up: SP > limit\"));\n      return(0);\n    }\n    \/* all checks pass *\/\n    return(1);\n  }\n}\n\nbx_bool BX_CPU_C::can_pop(Bit32u bytes)\n{\n  Bit32u temp_ESP, expand_down_limit;\n\n#if BX_SUPPORT_X86_64\n  if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64) {\n    return(1);\n  }\n#endif\n\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.d_b) { \/* Big bit set: use ESP *\/\n    temp_ESP = ESP;\n    expand_down_limit = 0xFFFFFFFF;\n  }\n  else { \/* Big bit clear: use SP *\/\n    temp_ESP = SP;\n    expand_down_limit = 0xFFFF;\n  }\n\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.valid==0) {\n    BX_ERROR((\"can_pop(): SS invalidated\"));\n    return(0); \/* never gets here *\/\n  }\n\n  if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.p==0) {\n    BX_ERROR((\"can_pop(): SS.p = 0\"));\n    return(0);\n  }\n\n  if (IS_DATA_SEGMENT_EXPAND_DOWN(BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.type)) { \/* expand down *\/\n    if (temp_ESP == expand_down_limit) {\n      BX_PANIC((\"can_pop(): found SP=ffff\"));\n      return(0);\n    }\n    if (((expand_down_limit - temp_ESP) + 1) >= bytes)\n      return(1);\n    return(0);\n  }\n  else { \/* normal (expand-up) segment *\/\n    if (BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.limit_scaled==0) {\n      BX_ERROR((\"can_pop(): SS.limit = 0\"));\n      return(0);\n    }\n    if (temp_ESP == expand_down_limit) {\n      BX_ERROR((\"can_pop(): found SP=ffff\"));\n      return(0);\n    }\n    if (temp_ESP > BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.limit_scaled) {\n      BX_ERROR((\"can_pop(): eSP > SS.limit\"));\n      return(0);\n    }\n    if (((BX_CPU_THIS_PTR sregs[BX_SEG_REG_SS].cache.u.segment.limit_scaled - temp_ESP) + 1) >= bytes)\n      return(1);\n    return(0);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <stdlib.h>\n#include <time.h>\n#include <vector>\n#include \"aesthetics.h\"\n#include \"operators.h\"\n#include \"easy.h\"\n#include \"hard.h\"\nusing namespace std;\n\ntypedef vector < vector<char> > VECTOR;\n\nunsigned int LENGTH = 1;\nunsigned int HEIGHT = 1;\nint arr_height = 3;\nint arr_length = 3;\n\nbool get_input(int argc, char* argv[], string & mode)\n{\n\tif (argc > 1 && argc < 5)\t\t\t\t\t\t\/\/if length & height passed\n\t{\n\t\tif (argc == 2)\t\t\t\t\t\t\t\t\/\/missing one arg\n\t\t{\n\t\t\tcout << \"Missing height arg\" << endl;\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLENGTH = atoi(argv[1]);\n\t\t\tHEIGHT = atoi(argv[2]);\n\t\t\tif (LENGTH == 0)\t\t\t\t\t\t\/\/must be > 0\n\t\t\t{\n\t\t\t\tcout << \"Invalid length\" << endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (HEIGHT == 0)\t\t\t\t\t\t\/\/must be > 0\n\t\t\t{\n\t\t\t\tcout << \"Invalid height\" << endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\tif (argc > 3)\t\t\t\t\t\t\t\t\t\/\/too many args passed\n\t{\n\t\tif (argc > 4)\n\t\t{\n\t\t\tcout << \"Too many arguments\" << endl;\n\t\t\treturn false;\n\t\t}\n\t\telse if (argv[3] == \"e\" || argv[3] == \"E\" || \n\t\t\t\t argv[3] == \"easy\" || argv[3] == \"Easy\")\n\t\t{\n\t\t\tmode = \"e\";\n\t\t}\n\t\telse\n\t\t\tmode = \"h\";\n\t}\n\tif (argc == 1)\t\t\t\t\t\t\t\t\t\/\/no args passed\n\t{\n\t\tcout << \"Enter the length of the maze.\" << endl;\n\t\tint l = 0;\n\t\twhile (l <= 0)\t\t\t\t\t\t\t\t\/\/get length\n\t\t{\n\t\t\tcin >> l;\n\t\t}\n\t\tcout << \"Enter the height of the maze.\" << endl;\n\t\tint h = 0;\n\t\twhile (h <= 0)\t\t\t\t\t\t\t\t\/\/get height\n\t\t{\n\t\t\tcin >> h;\n\t\t}\n\t\tLENGTH = l;\n\t\tHEIGHT = h;\n\t\tcout << \"Enter the difficulty of the maze. \";\n\t\tcout << \"1 for easy, 2 for hard.\" << endl;\n\t\tint d = 0;\n\t\twhile (d <= 0 || d > 2)\n\t\t{\n\t\t\tcin >> d;\n\t\t}\n\t\tif (d == 1)\n\t\t\tmode = \"e\";\n\t\telse\n\t\t\tmode = \"h\";\n\t}\n\treturn true;\n}\n\nvoid maze_init(VECTOR &MAZE, int arr_height, int arr_length)\n{\n\tfor (int i = 0; i < arr_height; i++)\t\t\t\/\/init maze with x\n\t{\n\t\tfor (int j = 0; j < arr_length; j++)\n\t\t{\n\t\t\tMAZE.at(i).at(j) = 'x';\n\t\t}\n\t}\n\tfor (int i = 1; i < arr_height; i += 2)\n\t{\n\t\tfor (int j = 1; j < arr_length; j += 2)\n\t\t{\n\t\t\tMAZE.at(i).at(j) = ' ';\n\t\t}\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\tstring mode;\n\tif (!get_input(argc, argv, mode))\n\t{\n\t\treturn 1;\n\t}\n\n\tsrand(time(NULL));\t\t\t\t\t\t\t\t\/\/set rand sequence\n\tarr_height = (2 * HEIGHT) + 1;\n\tarr_length = (2 * LENGTH) + 1;\n\tVECTOR MAZE(arr_height, vector <char> (arr_length));\t\t\/\/set maze\n\n\tmaze_init(MAZE, arr_height, arr_length);\t\n\t\n\tif (mode == \"e\")\n\t\tgen_easy(MAZE, arr_height, arr_length);\n\telse\n\t\tgen_hard(MAZE, arr_height, arr_length);\n\tset_start_end(MAZE, arr_height, arr_length);\n\n\tprint(MAZE, arr_height, arr_length);\n\n\treturn 0;\n}\n<commit_msg>fixed UI bug<commit_after>#include <iostream>\n#include <stdlib.h>\n#include <time.h>\n#include <vector>\n#include \"aesthetics.h\"\n#include \"operators.h\"\n#include \"easy.h\"\n#include \"hard.h\"\nusing namespace std;\n\ntypedef vector < vector<char> > VECTOR;\n\nunsigned int LENGTH = 1;\nunsigned int HEIGHT = 1;\nint arr_height = 3;\nint arr_length = 3;\n\nbool get_input(int argc, char* argv[], string & mode)\n{\n\tif (argc > 1 && argc < 5)\t\t\t\t\t\t\/\/if length & height passed\n\t{\n\t\tif (argc == 2)\t\t\t\t\t\t\t\t\/\/missing one arg\n\t\t{\n\t\t\tcout << \"Missing height arg\" << endl;\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLENGTH = atoi(argv[1]);\n\t\t\tHEIGHT = atoi(argv[2]);\n\t\t\tif (LENGTH <= 0)\t\t\t\t\t\t\/\/must be > 0\n\t\t\t{\n\t\t\t\tcout << \"Invalid length\" << endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (HEIGHT <= 0)\t\t\t\t\t\t\/\/must be > 0\n\t\t\t{\n\t\t\t\tcout << \"Invalid height\" << endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\tif (argc > 3)\t\t\t\t\t\t\t\t\t\/\/too many args passed\n\t{\n\t\tmode = argv[3];\n\t\tif (argc > 4)\n\t\t{\n\t\t\tcout << \"Too many arguments\" << endl;\n\t\t\treturn false;\n\t\t}\n\t\tif (mode == \"e\" || mode == \"E\" || mode == \"easy\" || mode == \"Easy\")\n\t\t{\n\t\t\tmode = \"e\";\n\t\t}\n\t\telse\n\t\t\tmode = \"h\";\n\t}\n\tif (argc == 1)\t\t\t\t\t\t\t\t\t\/\/no args passed\n\t{\n\t\tcout << \"Enter the length of the maze.\" << endl;\n\t\tint l = 0;\n\t\twhile (l <= 0)\t\t\t\t\t\t\t\t\/\/get length\n\t\t{\n\t\t\tcin >> l;\n\t\t}\n\t\tcout << \"Enter the height of the maze.\" << endl;\n\t\tint h = 0;\n\t\twhile (h <= 0)\t\t\t\t\t\t\t\t\/\/get height\n\t\t{\n\t\t\tcin >> h;\n\t\t}\n\t\tLENGTH = l;\n\t\tHEIGHT = h;\n\t\tcout << \"Enter the difficulty of the maze. \";\n\t\tcout << \"1 for easy, 2 for hard.\" << endl;\n\t\tint d = 0;\n\t\twhile (d <= 0 || d > 2)\n\t\t{\n\t\t\tcin >> d;\n\t\t}\n\t\tif (d == 1)\n\t\t\tmode = \"e\";\n\t\telse\n\t\t\tmode = \"h\";\n\t}\n\treturn true;\n}\n\nvoid maze_init(VECTOR &MAZE, int arr_height, int arr_length)\n{\n\tfor (int i = 0; i < arr_height; i++)\t\t\t\/\/init maze with x\n\t{\n\t\tfor (int j = 0; j < arr_length; j++)\n\t\t{\n\t\t\tMAZE.at(i).at(j) = 'x';\n\t\t}\n\t}\n\tfor (int i = 1; i < arr_height; i += 2)\n\t{\n\t\tfor (int j = 1; j < arr_length; j += 2)\n\t\t{\n\t\t\tMAZE.at(i).at(j) = ' ';\n\t\t}\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\tstring mode;\n\tif (!get_input(argc, argv, mode))\n\t{\n\t\treturn 1;\n\t}\n\n\tsrand(time(NULL));\t\t\t\t\t\t\t\t\/\/set rand sequence\n\tarr_height = (2 * HEIGHT) + 1;\n\tarr_length = (2 * LENGTH) + 1;\n\tVECTOR MAZE(arr_height, vector <char> (arr_length));\t\t\/\/set maze\n\n\tmaze_init(MAZE, arr_height, arr_length);\t\n\t\n\tif (mode == \"e\")\n\t\tgen_easy(MAZE, arr_height, arr_length);\n\telse\n\t\tgen_hard(MAZE, arr_height, arr_length);\n\tset_start_end(MAZE, arr_height, arr_length);\n\n\tprint(MAZE, arr_height, arr_length);\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * Copyright 2005, 2006, 2007 Florian Schmitz\r\n *\r\n * This file is part of CSSTidy.\r\n *\r\n *  CSSTidy is free software; you can redistribute it and\/or modify\r\n *  it under the terms of the GNU Lesser General Public License as published by\r\n *  the Free Software Foundation; either version 2.1 of the License, or\r\n *   (at your option) any later version.\r\n *\r\n *   CSSTidy 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 Lesser General Public License for more details.\r\n * \r\n *   You should have received a copy of the GNU Lesser General Public License\r\n *   along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n*\/\r\n \r\n#include \"csspp_globals.hpp\"\r\n\r\nbool escaped(const string &istring, const int pos) \r\n{\r\n\treturn !(s_at(istring,pos-1) != '\\\\' || escaped(istring,pos-1));\r\n}\r\n\r\n\/\/ Save replacement for .at()\r\nchar s_at(const string &istring, const int pos)\r\n{\r\n\tif(pos > (istring.length()-1) && pos < 0)\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\telse\r\n\t{\r\n\t\treturn istring[pos];\r\n\t}\r\n}\r\n\r\nvector<string> explode(const string e,string s, const bool check)\r\n{\r\n\tvector<string> ret;\r\n\tint iPos = s.find(e, 0);\r\n\tint iPit = e.length();\r\n\t\r\n\twhile(iPos > -1)\r\n\t{\r\n\t\tif(iPos != 0 || check)\r\n\t\t{\r\n\t\t\tret.push_back(s.substr(0,iPos));\r\n\t\t}\r\n\t\ts.erase(0,iPos+iPit);\r\n\t\tiPos = s.find(e, 0);\r\n\t}\r\n\t\r\n \tif(s != \"\" || check)\r\n \t{\r\n\t\tret.push_back(s);\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nstring implode(const string e,const vector<string> s)\r\n{\r\n\tstring ret;\r\n\tfor(int i = 0; i < s.size(); i++)\r\n\t{\r\n\t\tret += s[i];\r\n\t\tif(i != (s.size()-1)) ret += e;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nstring build_value(const vector<string> subvalues)\r\n{\r\n\tstring ret;\r\n\tfor(int i = 0; i < subvalues.size(); i++)\r\n\t{\r\n\t\tret += subvalues[i];\r\n\t\tif(i != (subvalues.size()-1))\r\n\t\t{\r\n\t\t\tchar last = s_at(subvalues[i], subvalues[i].length()-1);\r\n\t\t\tchar next = s_at(subvalues[i+1], 0);\r\n\t\t\tif (strchr(\"(,=:\", last) != NULL || strchr(\"),=:\", next) != NULL)\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tret += \" \";\r\n\t\t}\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\n\r\nfloat round(const float &number, const int num_digits)\r\n{\r\n    float doComplete5i, doComplete5(number * powf(10.0f, (float) (num_digits + 1)));\r\n    \r\n    if(number < 0.0f)\r\n        doComplete5 -= 5.0f;\r\n    else\r\n        doComplete5 += 5.0f;\r\n    \r\n    doComplete5 \/= 10.0f;\r\n    modff(doComplete5, &doComplete5i);\r\n    \r\n    return doComplete5i \/ powf(10.0f, (float) num_digits);\r\n}\r\n\r\n\r\nstring str_replace(const string find, const string replace, string str)\r\n{\r\n    int len = find.length();\r\n    int replace_len = replace.length();\r\n    int pos = str.find(find);\r\n\r\n    while(pos != string::npos)\r\n\t{  \r\n        str.replace(pos, len, replace);\r\n        pos = str.find(find, pos + replace_len);\r\n    }\r\n    return str;\r\n}\r\n\r\nstring str_replace(const vector<string>& find, const string replace, string str)\r\n{\r\n\tint replace_len = replace.length();\r\n\t\r\n\tfor(int i = 0; i < find.size(); ++i)\r\n\t{\r\n\t    int len = find[i].length();\r\n\t    int pos = str.find(find[i]);\r\n\t\r\n\t    while(pos != string::npos)\r\n\t\t{  \r\n\t        str.replace(pos, len, replace);\r\n\t        pos = str.find(find[i], pos + replace_len);\r\n\t    }\r\n\t}\r\n    return str;\r\n}\r\n\r\n\r\nbool in_char_arr(const char* haystack, const char needle)\r\n{\r\n\tfor(int i = 0; i < strlen(haystack); ++i)\r\n\t{\r\n\t\tif(haystack[i] == needle)\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\t}\r\n\treturn false;\r\n}\r\n\r\nbool in_str_array(const string& haystack, const char needle)\r\n{\r\n\treturn (haystack.find_first_of(needle,0) != string::npos);\r\n}\r\n\r\nbool in_str_array(const vector<string>& haystack, const string needle)\r\n{\r\n\tfor(int i = 0; i < haystack.size(); ++i)\r\n\t{\r\n\t\tif(haystack[i] == needle)\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\t}\r\n\treturn false;\r\n}\r\n\r\nstring htmlspecialchars(string istring, int quotes)\r\n{\r\n\tistring = str_replace(\"&\",\"&amp;\",istring);\r\n\tistring = str_replace(\"<\",\"&lt;\",istring);\r\n\tistring = str_replace(\">\",\"&gt;\",istring);\r\n\tif(quotes > 0) istring = str_replace(\"\\\"\",\"&quot;\",istring);\r\n\tif(quotes > 1) istring = str_replace(\"'\",\"&#039;\",istring);\r\n\treturn istring;\r\n}\r\n\r\nint max(const int i1, const int i2)\r\n{\r\n\tif(i1 > i2)\r\n\t{\r\n\t\treturn i1;\r\n\t}\r\n\telse\r\n\t{\r\n\t\treturn i2;\r\n\t}\r\n}\r\n\r\nbool ctype_space(const char c)\r\n{\r\n\treturn (c == ' ' || c == '\\t' || c == '\\r' || c == '\\n' || c == 11);\r\n}\r\n\r\nbool ctype_digit(const char c)\r\n{\r\n\treturn (c == '0' || c == '1' || c == '2' || c == '3' || c == '4' || c == '5' || c == '6' || c == '7' || c == '8' || c == '9');\r\n}\r\n\r\nvector<string> unserialise_sa(const string istring)\r\n{\r\n\tint strlen = istring.length();\r\n\tint strpos = 0;\r\n\tvector<string> ret;\r\n\t\r\n\twhile(strlen > 0)\r\n\t{\r\n\t\tstring digit_tmp = \"\";\r\n\t\tfor(int i = strpos; ctype_digit(s_at(istring,i)); i++)\r\n\t\t{\r\n\t\t\tdigit_tmp += istring[i];\r\n\t\t\t--strlen; ++strpos;\r\n\t\t}\r\n\t\t\/\/ :\r\n\t\t--strlen; ++strpos;\r\n\t\t\r\n\t\tint next_length = static_cast<int>(str2f(digit_tmp));\r\n\t\tnext_length += strpos;\r\n\r\n\t\tstring string_tmp = \"\";\r\n\t\tfor(int i = strpos; (i<istring.length() && i < next_length); i++)\r\n\t\t{\r\n\t\t\tstring_tmp += istring[i];\r\n\t\t\t--strlen; ++strpos;\r\n\t\t}\r\n\t\tret.push_back(string_tmp);\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nstring serialise_sa(const string istring)\r\n{\r\n\treturn f2str(istring.length()) + \":\" + istring;\r\n}\r\n\r\nbool ctype_xdigit(char c)\r\n{\r\n\tc = chartolower(c);\r\n\treturn (ctype_digit(c) || c == 'a' || c == 'b' || c == 'c' || c == 'd' || c == 'e' || c == 'f');\r\n}\r\n\r\nbool ctype_alpha(char c)\r\n{\r\n\tc = chartolower(c);\r\n\treturn (c == 'a' || c == 'b' || c == 'c' || c == 'd' || c == 'e' || c == 'f' || c == 'g' || c == 'h' || c == 'i' || c == 'j' || \r\n\t   c == 'k' || c == 'l' || c == 'm' || c == 'n' || c == 'o' || c == 'p' || c == 'q' || c == 'r' || c == 's' || c == 't' || \r\n\t   c == 'u' || c == 'v' || c == 'w' || c == 'x' || c == 'y' || c == 'z');\r\n}\r\n<commit_msg>In csstidy\/misc.cpp, add uncaught missing include<commit_after>\/*\r\n * Copyright 2005, 2006, 2007 Florian Schmitz\r\n *\r\n * This file is part of CSSTidy.\r\n *\r\n *  CSSTidy is free software; you can redistribute it and\/or modify\r\n *  it under the terms of the GNU Lesser General Public License as published by\r\n *  the Free Software Foundation; either version 2.1 of the License, or\r\n *   (at your option) any later version.\r\n *\r\n *   CSSTidy 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 Lesser General Public License for more details.\r\n * \r\n *   You should have received a copy of the GNU Lesser General Public License\r\n *   along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n*\/\r\n#include <cstring> \r\n#include \"csspp_globals.hpp\"\r\n\r\nbool escaped(const string &istring, const int pos) \r\n{\r\n\treturn !(s_at(istring,pos-1) != '\\\\' || escaped(istring,pos-1));\r\n}\r\n\r\n\/\/ Save replacement for .at()\r\nchar s_at(const string &istring, const int pos)\r\n{\r\n\tif(pos > (istring.length()-1) && pos < 0)\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\telse\r\n\t{\r\n\t\treturn istring[pos];\r\n\t}\r\n}\r\n\r\nvector<string> explode(const string e,string s, const bool check)\r\n{\r\n\tvector<string> ret;\r\n\tint iPos = s.find(e, 0);\r\n\tint iPit = e.length();\r\n\t\r\n\twhile(iPos > -1)\r\n\t{\r\n\t\tif(iPos != 0 || check)\r\n\t\t{\r\n\t\t\tret.push_back(s.substr(0,iPos));\r\n\t\t}\r\n\t\ts.erase(0,iPos+iPit);\r\n\t\tiPos = s.find(e, 0);\r\n\t}\r\n\t\r\n \tif(s != \"\" || check)\r\n \t{\r\n\t\tret.push_back(s);\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nstring implode(const string e,const vector<string> s)\r\n{\r\n\tstring ret;\r\n\tfor(int i = 0; i < s.size(); i++)\r\n\t{\r\n\t\tret += s[i];\r\n\t\tif(i != (s.size()-1)) ret += e;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nstring build_value(const vector<string> subvalues)\r\n{\r\n\tstring ret;\r\n\tfor(int i = 0; i < subvalues.size(); i++)\r\n\t{\r\n\t\tret += subvalues[i];\r\n\t\tif(i != (subvalues.size()-1))\r\n\t\t{\r\n\t\t\tchar last = s_at(subvalues[i], subvalues[i].length()-1);\r\n\t\t\tchar next = s_at(subvalues[i+1], 0);\r\n\t\t\tif (strchr(\"(,=:\", last) != NULL || strchr(\"),=:\", next) != NULL)\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tret += \" \";\r\n\t\t}\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\n\r\nfloat round(const float &number, const int num_digits)\r\n{\r\n    float doComplete5i, doComplete5(number * powf(10.0f, (float) (num_digits + 1)));\r\n    \r\n    if(number < 0.0f)\r\n        doComplete5 -= 5.0f;\r\n    else\r\n        doComplete5 += 5.0f;\r\n    \r\n    doComplete5 \/= 10.0f;\r\n    modff(doComplete5, &doComplete5i);\r\n    \r\n    return doComplete5i \/ powf(10.0f, (float) num_digits);\r\n}\r\n\r\n\r\nstring str_replace(const string find, const string replace, string str)\r\n{\r\n    int len = find.length();\r\n    int replace_len = replace.length();\r\n    int pos = str.find(find);\r\n\r\n    while(pos != string::npos)\r\n\t{  \r\n        str.replace(pos, len, replace);\r\n        pos = str.find(find, pos + replace_len);\r\n    }\r\n    return str;\r\n}\r\n\r\nstring str_replace(const vector<string>& find, const string replace, string str)\r\n{\r\n\tint replace_len = replace.length();\r\n\t\r\n\tfor(int i = 0; i < find.size(); ++i)\r\n\t{\r\n\t    int len = find[i].length();\r\n\t    int pos = str.find(find[i]);\r\n\t\r\n\t    while(pos != string::npos)\r\n\t\t{  \r\n\t        str.replace(pos, len, replace);\r\n\t        pos = str.find(find[i], pos + replace_len);\r\n\t    }\r\n\t}\r\n    return str;\r\n}\r\n\r\n\r\nbool in_char_arr(const char* haystack, const char needle)\r\n{\r\n\tfor(int i = 0; i < strlen(haystack); ++i)\r\n\t{\r\n\t\tif(haystack[i] == needle)\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\t}\r\n\treturn false;\r\n}\r\n\r\nbool in_str_array(const string& haystack, const char needle)\r\n{\r\n\treturn (haystack.find_first_of(needle,0) != string::npos);\r\n}\r\n\r\nbool in_str_array(const vector<string>& haystack, const string needle)\r\n{\r\n\tfor(int i = 0; i < haystack.size(); ++i)\r\n\t{\r\n\t\tif(haystack[i] == needle)\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\t}\r\n\treturn false;\r\n}\r\n\r\nstring htmlspecialchars(string istring, int quotes)\r\n{\r\n\tistring = str_replace(\"&\",\"&amp;\",istring);\r\n\tistring = str_replace(\"<\",\"&lt;\",istring);\r\n\tistring = str_replace(\">\",\"&gt;\",istring);\r\n\tif(quotes > 0) istring = str_replace(\"\\\"\",\"&quot;\",istring);\r\n\tif(quotes > 1) istring = str_replace(\"'\",\"&#039;\",istring);\r\n\treturn istring;\r\n}\r\n\r\nint max(const int i1, const int i2)\r\n{\r\n\tif(i1 > i2)\r\n\t{\r\n\t\treturn i1;\r\n\t}\r\n\telse\r\n\t{\r\n\t\treturn i2;\r\n\t}\r\n}\r\n\r\nbool ctype_space(const char c)\r\n{\r\n\treturn (c == ' ' || c == '\\t' || c == '\\r' || c == '\\n' || c == 11);\r\n}\r\n\r\nbool ctype_digit(const char c)\r\n{\r\n\treturn (c == '0' || c == '1' || c == '2' || c == '3' || c == '4' || c == '5' || c == '6' || c == '7' || c == '8' || c == '9');\r\n}\r\n\r\nvector<string> unserialise_sa(const string istring)\r\n{\r\n\tint strlen = istring.length();\r\n\tint strpos = 0;\r\n\tvector<string> ret;\r\n\t\r\n\twhile(strlen > 0)\r\n\t{\r\n\t\tstring digit_tmp = \"\";\r\n\t\tfor(int i = strpos; ctype_digit(s_at(istring,i)); i++)\r\n\t\t{\r\n\t\t\tdigit_tmp += istring[i];\r\n\t\t\t--strlen; ++strpos;\r\n\t\t}\r\n\t\t\/\/ :\r\n\t\t--strlen; ++strpos;\r\n\t\t\r\n\t\tint next_length = static_cast<int>(str2f(digit_tmp));\r\n\t\tnext_length += strpos;\r\n\r\n\t\tstring string_tmp = \"\";\r\n\t\tfor(int i = strpos; (i<istring.length() && i < next_length); i++)\r\n\t\t{\r\n\t\t\tstring_tmp += istring[i];\r\n\t\t\t--strlen; ++strpos;\r\n\t\t}\r\n\t\tret.push_back(string_tmp);\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nstring serialise_sa(const string istring)\r\n{\r\n\treturn f2str(istring.length()) + \":\" + istring;\r\n}\r\n\r\nbool ctype_xdigit(char c)\r\n{\r\n\tc = chartolower(c);\r\n\treturn (ctype_digit(c) || c == 'a' || c == 'b' || c == 'c' || c == 'd' || c == 'e' || c == 'f');\r\n}\r\n\r\nbool ctype_alpha(char c)\r\n{\r\n\tc = chartolower(c);\r\n\treturn (c == 'a' || c == 'b' || c == 'c' || c == 'd' || c == 'e' || c == 'f' || c == 'g' || c == 'h' || c == 'i' || c == 'j' || \r\n\t   c == 'k' || c == 'l' || c == 'm' || c == 'n' || c == 'o' || c == 'p' || c == 'q' || c == 'r' || c == 's' || c == 't' || \r\n\t   c == 'u' || c == 'v' || c == 'w' || c == 'x' || c == 'y' || c == 'z');\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2003 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 * $Id$\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/XMemory.hpp>\n#include <xercesc\/util\/PlatformUtils.hpp>\n#include <xercesc\/framework\/MemoryManager.hpp>\n#include <assert.h>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nvoid* XMemory::operator new(size_t size)\n{\n\tsize_t headerSize = XMLPlatformUtils::alignPointerForNewBlockAllocation(\n\t\t\t\t\t\t\t\t\t\tsizeof(MemoryManager*));\n\t\n    void* const block = XMLPlatformUtils::fgMemoryManager->allocate\n        (\n\t        headerSize + size\n        );\n    *(MemoryManager**)block = XMLPlatformUtils::fgMemoryManager;\n\n    return (char*)block + headerSize;\n}\n\n#if defined(XML_VISUALCPP)\n\nvoid* XMemory::operator new(size_t size, const char* file, int line)\n{ \n\t\t return operator new(size); \n}\n \nvoid XMemory::operator delete(void* p, const char* file, int line)\n{ \n\t\t operator delete(p); \n}\n \n#endif\n\nvoid* XMemory::operator new(size_t size, MemoryManager* manager)\n{\n    assert(manager != 0);\n\t\n\tsize_t headerSize = XMLPlatformUtils::alignPointerForNewBlockAllocation(\n\t\t\t\t\t\t\t\t\t\tsizeof(MemoryManager*));\n    void* const block = manager->allocate(headerSize + size);\n    *(MemoryManager**)block = manager;\n\n    return (char*)block + headerSize;\n}\n\nvoid XMemory::operator delete(void* p)\n{\n    if (p != 0)\n    {\n\t\tsize_t headerSize = XMLPlatformUtils::alignPointerForNewBlockAllocation(\n\t\t\t\t\t\t\t\t\t\t\tsizeof(MemoryManager*));\n        void* const block = (char*)p - headerSize;\n\n        MemoryManager* const manager = *(MemoryManager**)block;\n        assert(manager != 0);\n        manager->deallocate(block);\n    }\n}\n\n\/\/The HP compiler is complaining about duplicate overloading of delete\n#if !defined(XML_HPUX) && !defined(XML_BORLAND)\n\nvoid XMemory::operator delete(void* p, MemoryManager* manager)\n{\n    assert(manager != 0);\n\t\n    if (p != 0)\n    {\n        size_t headerSize = XMLPlatformUtils::alignPointerForNewBlockAllocation(sizeof(MemoryManager*));\n        void* const block = (char*)p - headerSize;\n        assert(*(MemoryManager**)block == manager);\n        \/***\n         * NOTE: for compiler which can't properly trace the memory manager used in the \n         *       placement new, we use the memory manager embedded in the memory rather \n         *       than the one passed in\n         *\/ \n        MemoryManager* pM = *(MemoryManager**)block;\n        pM->deallocate(block);\n    }\n}\n\n#endif\n\nXERCES_CPP_NAMESPACE_END\n\n<commit_msg>do not assert memorymanager in placement delete.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2003 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 * $Id$\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/XMemory.hpp>\n#include <xercesc\/util\/PlatformUtils.hpp>\n#include <xercesc\/framework\/MemoryManager.hpp>\n#include <assert.h>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nvoid* XMemory::operator new(size_t size)\n{\n\tsize_t headerSize = XMLPlatformUtils::alignPointerForNewBlockAllocation(\n\t\t\t\t\t\t\t\t\t\tsizeof(MemoryManager*));\n\t\n    void* const block = XMLPlatformUtils::fgMemoryManager->allocate\n        (\n\t        headerSize + size\n        );\n    *(MemoryManager**)block = XMLPlatformUtils::fgMemoryManager;\n\n    return (char*)block + headerSize;\n}\n\n#if defined(XML_VISUALCPP)\n\nvoid* XMemory::operator new(size_t size, const char* file, int line)\n{ \n\t\t return operator new(size); \n}\n \nvoid XMemory::operator delete(void* p, const char* file, int line)\n{ \n\t\t operator delete(p); \n}\n \n#endif\n\nvoid* XMemory::operator new(size_t size, MemoryManager* manager)\n{\n    assert(manager != 0);\n\t\n\tsize_t headerSize = XMLPlatformUtils::alignPointerForNewBlockAllocation(\n\t\t\t\t\t\t\t\t\t\tsizeof(MemoryManager*));\n    void* const block = manager->allocate(headerSize + size);\n    *(MemoryManager**)block = manager;\n\n    return (char*)block + headerSize;\n}\n\nvoid XMemory::operator delete(void* p)\n{\n    if (p != 0)\n    {\n\t\tsize_t headerSize = XMLPlatformUtils::alignPointerForNewBlockAllocation(\n\t\t\t\t\t\t\t\t\t\t\tsizeof(MemoryManager*));\n        void* const block = (char*)p - headerSize;\n\n        MemoryManager* const manager = *(MemoryManager**)block;\n        assert(manager != 0);\n        manager->deallocate(block);\n    }\n}\n\n\/\/The HP compiler is complaining about duplicate overloading of delete\n#if !defined(XML_HPUX) && !defined(XML_BORLAND)\n\nvoid XMemory::operator delete(void* p, MemoryManager* manager)\n{\n    assert(manager != 0);\n\t\n    if (p != 0)\n    {\n        size_t headerSize = XMLPlatformUtils::alignPointerForNewBlockAllocation(sizeof(MemoryManager*));\n        void* const block = (char*)p - headerSize;\n\n        \/***\n         * assert(*(MemoryManager**)block == manager);                 \n         *\n         * NOTE: for compiler which can't properly trace the memory manager used in the \n         *       placement new, we use the memory manager embedded in the memory rather \n         *       than the one passed in\n         *\/ \n        MemoryManager* pM = *(MemoryManager**)block;\n        pM->deallocate(block);\n    }\n}\n\n#endif\n\nXERCES_CPP_NAMESPACE_END\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ Tooling sample. Demonstrates:\n\/\/\n\/\/ * How to write a simple source tool using libTooling.\n\/\/ * How to use RecursiveASTVisitor to find interesting AST nodes.\n\/\/ * How to use the Rewriter API to rewrite the source code.\n\/\/\n\/\/ Eli Bendersky (eliben@gmail.com)\n\/\/ This code is in the public domain\n\/\/------------------------------------------------------------------------------\n#include <sstream>\n#include <string>\n\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/Frontend\/FrontendActions.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Tooling\/CommonOptionsParser.h\"\n#include \"clang\/Tooling\/Tooling.h\"\n#include \"clang\/Rewrite\/Core\/Rewriter.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nnamespace cl = llvm::cl;\nusing namespace clang;\nusing namespace clang::driver;\nusing namespace clang::tooling;\n\nstatic cl::OptionCategory ToolingSampleCategory(\"Tooling Sample\");\n\n\/\/ By implementing RecursiveASTVisitor, we can specify which AST nodes\n\/\/ we're interested in by overriding relevant methods.\nclass MyASTVisitor : public RecursiveASTVisitor<MyASTVisitor> {\npublic:\n  MyASTVisitor(Rewriter &R) : TheRewriter(R) {}\n\n  bool VisitStmt(Stmt *s) {\n    \/\/ Only care about If statements.\n    if (isa<IfStmt>(s)) {\n      IfStmt *IfStatement = cast<IfStmt>(s);\n      Stmt *Then = IfStatement->getThen();\n\n      TheRewriter.InsertText(Then->getLocStart(), \"\/\/ the 'if' part\\n\", true,\n                             true);\n\n      Stmt *Else = IfStatement->getElse();\n      if (Else)\n        TheRewriter.InsertText(Else->getLocStart(), \"\/\/ the 'else' part\\n\",\n                               true, true);\n    }\n\n    return true;\n  }\n\n  bool VisitFunctionDecl(FunctionDecl *f) {\n    \/\/ Only function definitions (with bodies), not declarations.\n    if (f->hasBody()) {\n      Stmt *FuncBody = f->getBody();\n\n      \/\/ Type name as string\n      QualType QT = f->getReturnType();\n      std::string TypeStr = QT.getAsString();\n\n      \/\/ Function name\n      DeclarationName DeclName = f->getNameInfo().getName();\n      std::string FuncName = DeclName.getAsString();\n\n      \/\/ Add comment before\n      std::stringstream SSBefore;\n      SSBefore << \"\/\/ Begin function \" << FuncName << \" returning \" << TypeStr\n               << \"\\n\";\n      SourceLocation ST = f->getSourceRange().getBegin();\n      TheRewriter.InsertText(ST, SSBefore.str(), true, true);\n\n      \/\/ And after\n      std::stringstream SSAfter;\n      SSAfter << \"\\n\/\/ End function \" << FuncName;\n      ST = FuncBody->getLocEnd().getLocWithOffset(1);\n      TheRewriter.InsertText(ST, SSAfter.str(), true, true);\n    }\n\n    return true;\n  }\n\nprivate:\n  Rewriter &TheRewriter;\n};\n\n\/\/ Implementation of the ASTConsumer interface for reading an AST produced\n\/\/ by the Clang parser.\nclass MyASTConsumer : public ASTConsumer {\npublic:\n  MyASTConsumer(Rewriter &R) : Visitor(R) {}\n\n  \/\/ Override the method that gets called for each parsed top-level\n  \/\/ declaration.\n  virtual bool HandleTopLevelDecl(DeclGroupRef DR) {\n    for (DeclGroupRef::iterator b = DR.begin(), e = DR.end(); b != e; ++b)\n      \/\/ Traverse the declaration using our AST visitor.\n      Visitor.TraverseDecl(*b);\n    return true;\n  }\n\nprivate:\n  MyASTVisitor Visitor;\n};\n\n\/\/ For each source file provided to the tool, a new FrontendAction is created.\nclass MyFrontendAction : public ASTFrontendAction {\npublic:\n  MyFrontendAction() {}\n  void EndSourceFileAction() override {\n    SourceManager &SM = TheRewriter.getSourceMgr();\n    llvm::errs() << \"** EndSourceFileAction for: \"\n                 << SM.getFileEntryForID(SM.getMainFileID())->getName() << \"\\n\";\n\n    \/\/ Now emit the rewritten buffer.\n    TheRewriter.getEditBuffer(SM.getMainFileID()).write(llvm::outs());\n  }\n\n  ASTConsumer *CreateASTConsumer(CompilerInstance &CI,\n                                 StringRef file) override {\n    llvm::errs() << \"** Creating AST consumer for: \" << file << \"\\n\";\n    TheRewriter.setSourceMgr(CI.getSourceManager(), CI.getLangOpts());\n    return new MyASTConsumer(TheRewriter);\n  }\n\nprivate:\n  Rewriter TheRewriter;\n};\n\nint main(int argc, const char **argv) {\n  CommonOptionsParser op(argc, argv, ToolingSampleCategory);\n  ClangTool Tool(op.getCompilations(), op.getSourcePathList());\n\n  \/\/ ClangTool::run accepts a FrontendActionFactory, which is then used to\n  \/\/ create new objects implementing the FrontendAction interface. Here we use\n  \/\/ the helper newFrontendActionFactory to create a default factory that will\n  \/\/ return a new MyFrontendAction object every time.\n  \/\/ To further customize this, we could create our own factory class.\n  return Tool.run(newFrontendActionFactory<MyFrontendAction>());\n}\n<commit_msg>Replace virtual by override.<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ Tooling sample. Demonstrates:\n\/\/\n\/\/ * How to write a simple source tool using libTooling.\n\/\/ * How to use RecursiveASTVisitor to find interesting AST nodes.\n\/\/ * How to use the Rewriter API to rewrite the source code.\n\/\/\n\/\/ Eli Bendersky (eliben@gmail.com)\n\/\/ This code is in the public domain\n\/\/------------------------------------------------------------------------------\n#include <sstream>\n#include <string>\n\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/Frontend\/FrontendActions.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Tooling\/CommonOptionsParser.h\"\n#include \"clang\/Tooling\/Tooling.h\"\n#include \"clang\/Rewrite\/Core\/Rewriter.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nnamespace cl = llvm::cl;\nusing namespace clang;\nusing namespace clang::driver;\nusing namespace clang::tooling;\n\nstatic cl::OptionCategory ToolingSampleCategory(\"Tooling Sample\");\n\n\/\/ By implementing RecursiveASTVisitor, we can specify which AST nodes\n\/\/ we're interested in by overriding relevant methods.\nclass MyASTVisitor : public RecursiveASTVisitor<MyASTVisitor> {\npublic:\n  MyASTVisitor(Rewriter &R) : TheRewriter(R) {}\n\n  bool VisitStmt(Stmt *s) {\n    \/\/ Only care about If statements.\n    if (isa<IfStmt>(s)) {\n      IfStmt *IfStatement = cast<IfStmt>(s);\n      Stmt *Then = IfStatement->getThen();\n\n      TheRewriter.InsertText(Then->getLocStart(), \"\/\/ the 'if' part\\n\", true,\n                             true);\n\n      Stmt *Else = IfStatement->getElse();\n      if (Else)\n        TheRewriter.InsertText(Else->getLocStart(), \"\/\/ the 'else' part\\n\",\n                               true, true);\n    }\n\n    return true;\n  }\n\n  bool VisitFunctionDecl(FunctionDecl *f) {\n    \/\/ Only function definitions (with bodies), not declarations.\n    if (f->hasBody()) {\n      Stmt *FuncBody = f->getBody();\n\n      \/\/ Type name as string\n      QualType QT = f->getReturnType();\n      std::string TypeStr = QT.getAsString();\n\n      \/\/ Function name\n      DeclarationName DeclName = f->getNameInfo().getName();\n      std::string FuncName = DeclName.getAsString();\n\n      \/\/ Add comment before\n      std::stringstream SSBefore;\n      SSBefore << \"\/\/ Begin function \" << FuncName << \" returning \" << TypeStr\n               << \"\\n\";\n      SourceLocation ST = f->getSourceRange().getBegin();\n      TheRewriter.InsertText(ST, SSBefore.str(), true, true);\n\n      \/\/ And after\n      std::stringstream SSAfter;\n      SSAfter << \"\\n\/\/ End function \" << FuncName;\n      ST = FuncBody->getLocEnd().getLocWithOffset(1);\n      TheRewriter.InsertText(ST, SSAfter.str(), true, true);\n    }\n\n    return true;\n  }\n\nprivate:\n  Rewriter &TheRewriter;\n};\n\n\/\/ Implementation of the ASTConsumer interface for reading an AST produced\n\/\/ by the Clang parser.\nclass MyASTConsumer : public ASTConsumer {\npublic:\n  MyASTConsumer(Rewriter &R) : Visitor(R) {}\n\n  \/\/ Override the method that gets called for each parsed top-level\n  \/\/ declaration.\n  bool HandleTopLevelDecl(DeclGroupRef DR) override {\n    for (DeclGroupRef::iterator b = DR.begin(), e = DR.end(); b != e; ++b)\n      \/\/ Traverse the declaration using our AST visitor.\n      Visitor.TraverseDecl(*b);\n    return true;\n  }\n\nprivate:\n  MyASTVisitor Visitor;\n};\n\n\/\/ For each source file provided to the tool, a new FrontendAction is created.\nclass MyFrontendAction : public ASTFrontendAction {\npublic:\n  MyFrontendAction() {}\n  void EndSourceFileAction() override {\n    SourceManager &SM = TheRewriter.getSourceMgr();\n    llvm::errs() << \"** EndSourceFileAction for: \"\n                 << SM.getFileEntryForID(SM.getMainFileID())->getName() << \"\\n\";\n\n    \/\/ Now emit the rewritten buffer.\n    TheRewriter.getEditBuffer(SM.getMainFileID()).write(llvm::outs());\n  }\n\n  ASTConsumer *CreateASTConsumer(CompilerInstance &CI,\n                                 StringRef file) override {\n    llvm::errs() << \"** Creating AST consumer for: \" << file << \"\\n\";\n    TheRewriter.setSourceMgr(CI.getSourceManager(), CI.getLangOpts());\n    return new MyASTConsumer(TheRewriter);\n  }\n\nprivate:\n  Rewriter TheRewriter;\n};\n\nint main(int argc, const char **argv) {\n  CommonOptionsParser op(argc, argv, ToolingSampleCategory);\n  ClangTool Tool(op.getCompilations(), op.getSourcePathList());\n\n  \/\/ ClangTool::run accepts a FrontendActionFactory, which is then used to\n  \/\/ create new objects implementing the FrontendAction interface. Here we use\n  \/\/ the helper newFrontendActionFactory to create a default factory that will\n  \/\/ return a new MyFrontendAction object every time.\n  \/\/ To further customize this, we could create our own factory class.\n  return Tool.run(newFrontendActionFactory<MyFrontendAction>());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file\n* \\brief Web Browser Control\n*\n* See Copyright Notice in \"iup.h\"\n*\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <windows.h>\n#include <exdisp.h>\n\n#include \"iup.h\"\n#include \"iupcbs.h\"\n#include \"iupole.h\"\n\n#include \"iup_object.h\"\n#include \"iup_register.h\"\n#include \"iup_attrib.h\"\n#include \"iup_stdcontrols.h\"\n#include \"iup_str.h\"\n#include \"iup_layout.h\"\n#include \"iup_webbrowser.h\"\n#include \"iup_drv.h\"\n#include \"iup_drvfont.h\"\n\n\nextern \"C\" WCHAR* iupwinStrChar2Wide(const char* str);\nextern \"C\" char* iupwinStrWide2Char(const WCHAR* wstr);\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Interface to get WebBrowserEvents\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <atlbase.h>\n#include <atlcom.h>\n#include <atlctl.h>\n\n#include <shlguid.h>   \/\/ IID_IWebBrowser2, DIID_DWebBrowserEvents2\n#include <exdispid.h>  \/\/ DISPID_*\n\nusing namespace ATL;\n\ninterface CSink:public IDispEventImpl<0, CSink, &DIID_DWebBrowserEvents2, &LIBID_SHDocVw, 1, 0>\n{\npublic:\n  Ihandle* ih;\n\n  BEGIN_SINK_MAP(CSink)\n    SINK_ENTRY_EX(0, DIID_DWebBrowserEvents2, DISPID_BEFORENAVIGATE2, BeforeNavigate2)\n#ifdef DISPID_NEWWINDOW3\n    SINK_ENTRY_EX(0, DIID_DWebBrowserEvents2, DISPID_NEWWINDOW3, NewWindow3)\n#endif\n  END_SINK_MAP()\n\n  void STDMETHODCALLTYPE BeforeNavigate2(IDispatch *pDisp, VARIANT *url, VARIANT *Flags, VARIANT *TargetFrameName,\n                                         VARIANT *PostData, VARIANT *Headers, VARIANT_BOOL *Cancel)\n  {\n    IFnss cbNavigate = (IFnss)IupGetCallback(ih, \"NAVIGATE_CB\");\n    if (cbNavigate)\n    {\n      char* resultString = iupwinStrWide2Char(url->bstrVal);\n      cbNavigate(ih, \"NOREASON\", resultString);\n      free(resultString);\n      \/\/ TO DO: detect types of action, like \"link_clicked\", \"refresh\", \"form submitted\", \"backward\/forward\"\n    }\n\n    (void)Cancel;\n    (void)Headers;\n    (void)PostData;\n    (void)TargetFrameName;\n    (void)Flags;\n    (void)pDisp;\n  }\n\n#ifdef DISPID_NEWWINDOW3\n  void STDMETHODCALLTYPE NewWindow3(IDispatch **ppDisp, VARIANT_BOOL *Cancel, DWORD dwFlags,\n                                    BSTR bstrUrlContext, BSTR bstrUrl)\n  {\n    IFns cbNewWindow = (IFns)IupGetCallback(ih, \"NEWWINDOW_CB\");\n    if (cbNewWindow)\n    {\n      char* urlString = iupwinStrWide2Char(bstrUrl);\n      cbNewWindow(ih, urlString);\n      free(urlString);\n    }\n\n    (void)bstrUrlContext;\n    (void)dwFlags;\n    (void)Cancel;\n    (void)ppDisp;\n  }\n#endif\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nstatic int winWebBrowserSetHTMLAttrib(Ihandle* ih, const char* value)\n{\n  if (!value)\n    return 0;\n\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  int size = strlen(value)+1;\n\n  \/\/ Create the memory for the stream\n  HGLOBAL hHTMLText = GlobalAlloc(GPTR, size);\n  strcpy((char*)hHTMLText, value); \/\/ weird but we follow the tutorial on MSDN\n\n  \/\/ Create the stream\n  IStream* pStream = NULL;\n  CreateStreamOnHGlobal(hHTMLText, TRUE, &pStream);\n\n  \/\/ Retrieve the document object.\n  IDispatch* pHtmlDoc = NULL;\n  pweb->get_Document(&pHtmlDoc);\n  if (!pHtmlDoc)\n  {\n    pweb->Navigate(L\"about:blank\", NULL, NULL, NULL, NULL);\n    IupFlush();\n\n    pweb->get_Document(&pHtmlDoc);\n  }\n\n  \/\/ Query for IPersistStreamInit.\n  IPersistStreamInit* pPersistStreamInit = NULL;\n  pHtmlDoc->QueryInterface(IID_IPersistStreamInit, (void**)&pPersistStreamInit);\n  \/\/Initialize the document.\n  pPersistStreamInit->InitNew();\n  \/\/ Load the contents of the stream.\n  pPersistStreamInit->Load(pStream);\n\n  \/\/ Releases\n  pPersistStreamInit->Release();\n  pStream->Release();\n  pHtmlDoc->Release();\n  GlobalFree(hHTMLText);\n  \n  return 0; \/* do not store value in hash table *\/\n}\n\nstatic int winWebBrowserSetBackForwardAttrib(Ihandle* ih, const char* value)\n{\n  int i, val;\n  if (iupStrToInt(value, &val))\n  {\n    IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n\n    \/* Negative values represent steps backward while positive values represent steps forward. *\/\n    if(val > 0)\n    {\n      for(i = 0; i < val; i++)\n        pweb->GoForward();\n    }\n    else if(val < 0)\n    {\n      for(i = 0; i < -(val); i++)\n        pweb->GoBack();\n    }\n  }\n\n  return 0; \/* do not store value in hash table *\/\n}\n\nstatic int winWebBrowserSetReloadAttrib(Ihandle* ih, const char* value)\n{\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  pweb->Refresh();\n\n  (void)value;\n  return 0; \/* do not store value in hash table *\/\n}\n\nstatic int winWebBrowserSetStopAttrib(Ihandle* ih, const char* value)\n{\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  pweb->Stop();\n\n  (void)value;\n  return 0; \/* do not store value in hash table *\/\n}\n\nstatic int winWebBrowserSetValueAttrib(Ihandle* ih, const char* value)\n{\n  if (value)\n  {\n    IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n    WCHAR* wvalue = iupwinStrChar2Wide(value);\n    \/\/CComVariant var = CComVariant(\"_top\");\n    \/\/pweb->Navigate(wvalue, NULL, &var, NULL, NULL);\n    pweb->Navigate(wvalue, NULL, NULL, NULL, NULL);\n    free(wvalue);\n  }\n  return 0;\n}\n\nstatic char* winWebBrowserGetValueAttrib(Ihandle* ih)\n{\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  BSTR pbstrLocationURL = NULL;\n  if (pweb->get_LocationURL(&pbstrLocationURL)==S_OK && pbstrLocationURL)\n  {\n    char* str = iupwinStrWide2Char(pbstrLocationURL);\n    SysFreeString(pbstrLocationURL);\n    char* value = iupStrGetMemoryCopy(str);\n    free(str);\n    return value;\n  }\n  return NULL;\n}\n\nstatic int winWebBrowserCreateMethod(Ihandle* ih, void **params)\n{\n  (void)params;\n  IupSetAttribute(ih, \"PROGID\", \"Shell.Explorer.2\");\n  IupSetAttribute(ih, \"DESIGNMODE\", \"NO\");\n\n  \/\/ Get the current IUnknown*\n  IUnknown *punk = (IUnknown*)IupGetAttribute(ih, \"IUNKNOWN\");\n\n  IWebBrowser2 *pweb = NULL;\n  punk->QueryInterface(IID_IWebBrowser2, (void **)&pweb);\n  iupAttribSetStr(ih, \"_IUPWEB_BROWSER\", (char*)pweb);\n\n  \/\/ CComModule implements a COM server module, allowing a client to access the module's components\n  CComModule* module = new CComModule();\n\n  \/\/ CSink object to capture events\n  CSink* sink = new CSink();\n\n  \/\/ Set handle to use in CSink Interface\n  sink->ih = ih;\n\n  \/\/ Initializing ATL Support\n  module->Init(NULL, GetModuleHandle(NULL));\n\n  \/\/ Connecting to the server's outgoing interface\n  sink->DispEventAdvise(punk);\n\n  iupAttribSetStr(ih, \"_IUPWEB_MODULE\", (char*)module);\n  iupAttribSetStr(ih, \"_IUPWEB_SINK\", (char*)sink);\n  punk->Release();\n\n  return IUP_NOERROR; \n}\n\nstatic void winWebBrowserDestroyMethod(Ihandle* ih)\n{\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  pweb->Release();\n\n  CComModule* module = (CComModule*)iupAttribGet(ih, \"_IUPWEB_MODULE\");\n  CSink* sink = (CSink*)iupAttribGet(ih, \"_IUPWEB_SINK\");\n\n  \/\/ Get the current IUnknown*\n  IUnknown *punk = (IUnknown*)IupGetAttribute(ih, \"IUNKNOWN\");\n\n  \/\/ Disconnecting from the server's outgoing interface\n  sink->DispEventUnadvise(punk);\n  delete sink;\n\n  \/\/ Terminating ATL support\n  module->Term();\n  delete module;\n\n  punk->Release();\n}\n\nextern \"C\" Iclass* iupOleControlGetClass(void);\n\nIclass* iupWebBrowserGetClass(void)\n{\n  Iclass* ic = iupClassNew(iupOleControlGetClass());\n\n  ic->name = \"webbrowser\";\n  ic->format = NULL; \/* no parameters *\/\n  ic->nativetype = IUP_TYPECANVAS;\n  ic->childtype  = IUP_CHILDNONE;\n  ic->is_interactive = 1;\n\n  \/* Class functions *\/\n  ic->Create = winWebBrowserCreateMethod;\n  ic->Destroy = winWebBrowserDestroyMethod;\n\n  \/* Callbacks *\/\n  iupClassRegisterCallback(ic, \"NEWWINDOW_CB\", \"s\");\n  iupClassRegisterCallback(ic, \"NAVIGATE_CB\", \"ss\");\n\n  \/* Attributes *\/\n  iupClassRegisterAttribute(ic, \"VALUE\", winWebBrowserGetValueAttrib, winWebBrowserSetValueAttrib, NULL, NULL, IUPAF_NO_DEFAULTVALUE|IUPAF_NO_INHERIT);\n  iupClassRegisterAttribute(ic, \"BACKFORWARD\", NULL, winWebBrowserSetBackForwardAttrib, NULL, NULL, IUPAF_NO_DEFAULTVALUE|IUPAF_NO_INHERIT);\n  iupClassRegisterAttribute(ic, \"STOP\", NULL, winWebBrowserSetStopAttrib, NULL, NULL, IUPAF_WRITEONLY|IUPAF_NO_INHERIT);\n  iupClassRegisterAttribute(ic, \"RELOAD\", NULL, winWebBrowserSetReloadAttrib, NULL, NULL, IUPAF_WRITEONLY|IUPAF_NO_INHERIT);\n  iupClassRegisterAttribute(ic, \"HTML\", NULL, winWebBrowserSetHTMLAttrib, NULL, NULL, IUPAF_WRITEONLY|IUPAF_NO_INHERIT);\n\n  return ic;\n}\n<commit_msg>*** empty log message ***<commit_after>\/** \\file\n* \\brief Web Browser Control\n*\n* See Copyright Notice in \"iup.h\"\n*\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <windows.h>\n#include <exdisp.h>\n\n#include \"iup.h\"\n#include \"iupcbs.h\"\n#include \"iupole.h\"\n\n#include \"iup_object.h\"\n#include \"iup_register.h\"\n#include \"iup_attrib.h\"\n#include \"iup_stdcontrols.h\"\n#include \"iup_str.h\"\n#include \"iup_layout.h\"\n#include \"iup_webbrowser.h\"\n#include \"iup_drv.h\"\n#include \"iup_drvfont.h\"\n\n\nextern \"C\" WCHAR* iupwinStrChar2Wide(const char* str);\nextern \"C\" char* iupwinStrWide2Char(const WCHAR* wstr);\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Interface to get WebBrowserEvents\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <atlbase.h>\n#include <atlcom.h>\n#include <atlctl.h>\n\n#include <shlguid.h>   \/\/ IID_IWebBrowser2, DIID_DWebBrowserEvents2\n#include <exdispid.h>  \/\/ DISPID_*\n\nusing namespace ATL;\n\ninterface CSink:public IDispEventImpl<0, CSink, &DIID_DWebBrowserEvents2, &LIBID_SHDocVw, 1, 0>\n{\npublic:\n  Ihandle* ih;\n\n  BEGIN_SINK_MAP(CSink)\n    SINK_ENTRY_EX(0, DIID_DWebBrowserEvents2, DISPID_BEFORENAVIGATE2, BeforeNavigate2)\n#ifdef DISPID_NEWWINDOW3\n    SINK_ENTRY_EX(0, DIID_DWebBrowserEvents2, DISPID_NEWWINDOW3, NewWindow3)\n#endif\n  END_SINK_MAP()\n\n  void STDMETHODCALLTYPE BeforeNavigate2(IDispatch *pDisp, VARIANT *url, VARIANT *Flags, VARIANT *TargetFrameName,\n                                         VARIANT *PostData, VARIANT *Headers, VARIANT_BOOL *Cancel)\n  {\n    IFnss cbNavigate = (IFnss)IupGetCallback(ih, \"NAVIGATE_CB\");\n    if (cbNavigate)\n    {\n      char* resultString = iupwinStrWide2Char(url->bstrVal);\n      cbNavigate(ih, \"NOREASON\", resultString);\n      free(resultString);\n      \/\/ TO DO: detect types of action, like \"link_clicked\", \"refresh\", \"form submitted\", \"backward\/forward\"\n    }\n\n    (void)Cancel;\n    (void)Headers;\n    (void)PostData;\n    (void)TargetFrameName;\n    (void)Flags;\n    (void)pDisp;\n  }\n\n#ifdef DISPID_NEWWINDOW3\n  void STDMETHODCALLTYPE NewWindow3(IDispatch **ppDisp, VARIANT_BOOL *Cancel, DWORD dwFlags,\n                                    BSTR bstrUrlContext, BSTR bstrUrl)\n  {\n    IFns cbNewWindow = (IFns)IupGetCallback(ih, \"NEWWINDOW_CB\");\n    if (cbNewWindow)\n    {\n      char* urlString = iupwinStrWide2Char(bstrUrl);\n      cbNewWindow(ih, urlString);\n      free(urlString);\n    }\n\n    (void)bstrUrlContext;\n    (void)dwFlags;\n    (void)Cancel;\n    (void)ppDisp;\n  }\n#endif\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nstatic int winWebBrowserSetHTMLAttrib(Ihandle* ih, const char* value)\n{\n  if (!value)\n    return 0;\n\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  int size = strlen(value)+1;\n\n  \/\/ Create the memory for the stream\n  HGLOBAL hHTMLText = GlobalAlloc(GPTR, size);\n  strcpy((char*)hHTMLText, value); \/\/ weird but we follow the tutorial on MSDN\n\n  \/\/ Create the stream\n  IStream* pStream = NULL;\n  CreateStreamOnHGlobal(hHTMLText, TRUE, &pStream);\n\n  \/\/ Retrieve the document object.\n  IDispatch* pHtmlDoc = NULL;\n  pweb->get_Document(&pHtmlDoc);\n  if (!pHtmlDoc)\n  {\n    pweb->Navigate(L\"about:blank\", NULL, NULL, NULL, NULL);\n    IupFlush();\n\n    pweb->get_Document(&pHtmlDoc);\n  }\n\n  \/\/ Query for IPersistStreamInit.\n  IPersistStreamInit* pPersistStreamInit = NULL;\n  pHtmlDoc->QueryInterface(IID_IPersistStreamInit, (void**)&pPersistStreamInit);\n  \/\/Initialize the document.\n  pPersistStreamInit->InitNew();\n  \/\/ Load the contents of the stream.\n  pPersistStreamInit->Load(pStream);\n\n  \/\/ Releases\n  pPersistStreamInit->Release();\n  pStream->Release();\n  pHtmlDoc->Release();\n  GlobalFree(hHTMLText);\n  \n  return 0; \/* do not store value in hash table *\/\n}\n\nstatic int winWebBrowserSetBackForwardAttrib(Ihandle* ih, const char* value)\n{\n  int i, val;\n  if (iupStrToInt(value, &val))\n  {\n    IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n\n    \/* Negative values represent steps backward while positive values represent steps forward. *\/\n    if(val > 0)\n    {\n      for(i = 0; i < val; i++)\n        pweb->GoForward();\n    }\n    else if(val < 0)\n    {\n      for(i = 0; i < -(val); i++)\n        pweb->GoBack();\n    }\n  }\n\n  return 0; \/* do not store value in hash table *\/\n}\n\nstatic int winWebBrowserSetReloadAttrib(Ihandle* ih, const char* value)\n{\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  pweb->Refresh();\n\n  (void)value;\n  return 0; \/* do not store value in hash table *\/\n}\n\nstatic int winWebBrowserSetStopAttrib(Ihandle* ih, const char* value)\n{\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  pweb->Stop();\n\n  (void)value;\n  return 0; \/* do not store value in hash table *\/\n}\n\nstatic int winWebBrowserSetValueAttrib(Ihandle* ih, const char* value)\n{\n  if (value)\n  {\n    IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n    WCHAR* wvalue = iupwinStrChar2Wide(value);\n\n    VARIANT var;\n    VariantInit(&var);  \/\/Initialize our variant\n    var.vt = VT_ARRAY | VT_UI1;\n    var.bstrVal = iupwinStrChar2Wide(\"_top\");\n    pweb->Navigate(wvalue, NULL, &var, NULL, NULL);\n\n    \/\/CComVariant var = CComVariant(\"_top\");\n    \/\/pweb->Navigate(wvalue, NULL, &var, NULL, NULL);\n    \n    \/\/pweb->Navigate(wvalue, NULL, NULL, NULL, NULL);\n    free(wvalue);\n  }\n  return 0;\n}\n\nstatic char* winWebBrowserGetValueAttrib(Ihandle* ih)\n{\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  BSTR pbstrLocationURL = NULL;\n  if (pweb->get_LocationURL(&pbstrLocationURL)==S_OK && pbstrLocationURL)\n  {\n    char* str = iupwinStrWide2Char(pbstrLocationURL);\n    SysFreeString(pbstrLocationURL);\n    char* value = iupStrGetMemoryCopy(str);\n    free(str);\n    return value;\n  }\n  return NULL;\n}\n\nstatic int winWebBrowserCreateMethod(Ihandle* ih, void **params)\n{\n  (void)params;\n  IupSetAttribute(ih, \"PROGID\", \"Shell.Explorer.2\");\n  IupSetAttribute(ih, \"DESIGNMODE\", \"NO\");\n\n  \/\/ Get the current IUnknown*\n  IUnknown *punk = (IUnknown*)IupGetAttribute(ih, \"IUNKNOWN\");\n\n  IWebBrowser2 *pweb = NULL;\n  punk->QueryInterface(IID_IWebBrowser2, (void **)&pweb);\n  iupAttribSetStr(ih, \"_IUPWEB_BROWSER\", (char*)pweb);\n\n  \/\/ CComModule implements a COM server module, allowing a client to access the module's components\n  CComModule* module = new CComModule();\n\n  \/\/ CSink object to capture events\n  CSink* sink = new CSink();\n\n  \/\/ Set handle to use in CSink Interface\n  sink->ih = ih;\n\n  \/\/ Initializing ATL Support\n  module->Init(NULL, GetModuleHandle(NULL));\n\n  \/\/ Connecting to the server's outgoing interface\n  sink->DispEventAdvise(punk);\n\n  iupAttribSetStr(ih, \"_IUPWEB_MODULE\", (char*)module);\n  iupAttribSetStr(ih, \"_IUPWEB_SINK\", (char*)sink);\n  punk->Release();\n\n  return IUP_NOERROR; \n}\n\nstatic void winWebBrowserDestroyMethod(Ihandle* ih)\n{\n  IWebBrowser2 *pweb = (IWebBrowser2*)iupAttribGet(ih, \"_IUPWEB_BROWSER\");\n  pweb->Release();\n\n  CComModule* module = (CComModule*)iupAttribGet(ih, \"_IUPWEB_MODULE\");\n  CSink* sink = (CSink*)iupAttribGet(ih, \"_IUPWEB_SINK\");\n\n  \/\/ Get the current IUnknown*\n  IUnknown *punk = (IUnknown*)IupGetAttribute(ih, \"IUNKNOWN\");\n\n  \/\/ Disconnecting from the server's outgoing interface\n  sink->DispEventUnadvise(punk);\n  delete sink;\n\n  \/\/ Terminating ATL support\n  module->Term();\n  delete module;\n\n  punk->Release();\n}\n\nextern \"C\" Iclass* iupOleControlGetClass(void);\n\nIclass* iupWebBrowserGetClass(void)\n{\n  Iclass* ic = iupClassNew(iupOleControlGetClass());\n\n  ic->name = \"webbrowser\";\n  ic->format = NULL; \/* no parameters *\/\n  ic->nativetype = IUP_TYPECANVAS;\n  ic->childtype  = IUP_CHILDNONE;\n  ic->is_interactive = 1;\n\n  \/* Class functions *\/\n  ic->Create = winWebBrowserCreateMethod;\n  ic->Destroy = winWebBrowserDestroyMethod;\n\n  \/* Callbacks *\/\n  iupClassRegisterCallback(ic, \"NEWWINDOW_CB\", \"s\");\n  iupClassRegisterCallback(ic, \"NAVIGATE_CB\", \"ss\");\n\n  \/* Attributes *\/\n  iupClassRegisterAttribute(ic, \"VALUE\", winWebBrowserGetValueAttrib, winWebBrowserSetValueAttrib, NULL, NULL, IUPAF_NO_DEFAULTVALUE|IUPAF_NO_INHERIT);\n  iupClassRegisterAttribute(ic, \"BACKFORWARD\", NULL, winWebBrowserSetBackForwardAttrib, NULL, NULL, IUPAF_NO_DEFAULTVALUE|IUPAF_NO_INHERIT);\n  iupClassRegisterAttribute(ic, \"STOP\", NULL, winWebBrowserSetStopAttrib, NULL, NULL, IUPAF_WRITEONLY|IUPAF_NO_INHERIT);\n  iupClassRegisterAttribute(ic, \"RELOAD\", NULL, winWebBrowserSetReloadAttrib, NULL, NULL, IUPAF_WRITEONLY|IUPAF_NO_INHERIT);\n  iupClassRegisterAttribute(ic, \"HTML\", NULL, winWebBrowserSetHTMLAttrib, NULL, NULL, IUPAF_WRITEONLY|IUPAF_NO_INHERIT);\n\n  return ic;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef INCLUDED_STRING_REPLACE\n#define INLCUDED_STRING_REPLACE\n#include<string>\n#include<cstring>\n\nnamespace srook{\ninline namespace v1{\n\t\nstd::string& str_replace(std::string& str,const char* src,const char* rhs)\n{\n\tif(str.empty()||!src||!*src||!rhs||!strcmp(src,rhs))\n\t\treturn str;\n\tconst size_t src_len=strlen(src);\n\tconst size_t rhs_len=strlen(rhs);\n\tfor(std::string::size_type i=0;\n\t\t\t(i=str.find(src,i,src_len))!=std::string::npos;\n\t\t\ti+=rhs_len)\n\t\tstr.replace(i,src_len,rhs,rhs_len);\n\treturn str;\n}\n\n}\n}\n#endif\n<commit_msg>Update str_replace.hpp<commit_after>#ifndef INCLUDED_STRING_REPLACE\n#define INLCUDED_STRING_REPLACE\n#include<string>\n#include<cstring>\n\nnamespace srook{\ninline namespace v1{\n\t\nstd::string& str_replace(std::string& str,const char* src,const char* rhs)\n{\n\tif(str.empty()||!src||!*src||!rhs||!std::strcmp(src,rhs))return str;\n\t\n\tconst size_t src_len=std::strlen(src);\n\tconst size_t rhs_len=std::strlen(rhs);\n\tfor(std::string::size_type i=0;\n\t\t\t(i=str.find(src,i,src_len))!=std::string::npos;\n\t\t\ti+=rhs_len)\n\t\tstr.replace(i,src_len,rhs,rhs_len);\n\treturn str;\n}\n\n}\n}\n#endif\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 &copy, const osg::CopyOp &copyop)\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 &copy, const osg::CopyOp &copyop)\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>\/*\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\tTransaction trans(binlogs);\n\n    std::string key_type;\n    if (type(key, &key_type) == -1){\n        return -1;\n    }\n\n    if ((flags & OBJ_SET_NX) && (key_type != \"none\")){\n        return -1;\n    } else if ((flags & OBJ_SET_XX) && (key_type == \"none\")){\n        return -1;\n    }\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    Transaction trans(binlogs);\n    int ret = get(key, val);\n    if ( ret == -1){\n        return -1;\n    }\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    Transaction trans(binlogs);\n\n    std::string key_type;\n    int ret = type(key, &key_type);\n    if (ret != 1){\n        return ret;\n    }\n    int64_t num = 0;\n    if (key_type == \"string\"){\n        num = KDelNoLock(key);\n    } else if (key_type == \"hash\"){\n        num = HDelKeyNoLock(key);\n    } else if (key_type == \"set\"){\n        num = SDelKeyNoLock(key);\n    } else if (key_type == \"zset\"){\n        num = ZDelKeyNoLock(key);\n    } else if (key_type == \"list\"){\n        \/\/todo\n    }\n\n    if (num > 0){\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    }\n\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){    \/\/不支持kv scan，redis也不支持\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){   \/\/不支持kv scan，redis也不支持\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\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\tif (\"string\" == type){\n\t\tKDelNoLock(key);\n\t} else if (\"hash\" == type){\n\t\tHDelKeyNoLock(key);\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\tZDelKeyNoLock(key);\n\t}\n\n\treturn 0;\n}\n\nint SSDBImpl::KDel(const Bytes &key, char log_type){\n    Transaction trans(binlogs);\n\n    int num = KDelNoLock(key);\n    if (num != 1){\n        return num;\n    }\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    std::string en_val;\n    leveldb::Status s = ldb->Get(leveldb::ReadOptions(), buf, &en_val);\n    if(s.IsNotFound()){\n        return 0;\n    } else if(!s.ok()){\n        log_error(\"get error: %s\", s.ToString().c_str());\n        return -1;\n    } else{\n        if (en_val[0] != DataType::KV){\n            return 0;\n        }\n    }\n\tbinlogs->Delete(buf);\n\tbinlogs->add_log(log_type, BinlogCommand::KDEL, buf);\n\treturn 1;\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>modify multi_del<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\tTransaction trans(binlogs);\n\n    std::string key_type;\n    if (type(key, &key_type) == -1){\n        return -1;\n    }\n\n    if ((flags & OBJ_SET_NX) && (key_type != \"none\")){\n        return -1;\n    } else if ((flags & OBJ_SET_XX) && (key_type == \"none\")){\n        return -1;\n    }\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    int num = 0;\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        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            num++;\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 num;\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    Transaction trans(binlogs);\n    int ret = get(key, val);\n    if ( ret == -1){\n        return -1;\n    }\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    Transaction trans(binlogs);\n\n    std::string key_type;\n    int ret = type(key, &key_type);\n    if (ret != 1){\n        return ret;\n    }\n    int64_t num = 0;\n    if (key_type == \"string\"){\n        num = KDelNoLock(key);\n    } else if (key_type == \"hash\"){\n        num = HDelKeyNoLock(key);\n    } else if (key_type == \"set\"){\n        num = SDelKeyNoLock(key);\n    } else if (key_type == \"zset\"){\n        num = ZDelKeyNoLock(key);\n    } else if (key_type == \"list\"){\n        \/\/todo\n    }\n\n    if (num > 0){\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    }\n\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){    \/\/不支持kv scan，redis也不支持\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){   \/\/不支持kv scan，redis也不支持\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\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\tif (\"string\" == type){\n\t\tKDelNoLock(key);\n\t} else if (\"hash\" == type){\n\t\tHDelKeyNoLock(key);\n\t} else if (\"list\" == type){\n\/\/\t\ts = LDelKeyNoLock(key, &res);\n\t} else if (\"set\" == type){\n\t\tSDelKeyNoLock(key);\n\t} else if (\"zset\" == type){\n\t\tZDelKeyNoLock(key);\n\t}\n\n\treturn 0;\n}\n\nint SSDBImpl::KDel(const Bytes &key, char log_type){\n    Transaction trans(binlogs);\n\n    int num = KDelNoLock(key);\n    if (num != 1){\n        return num;\n    }\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    std::string en_val;\n    leveldb::Status s = ldb->Get(leveldb::ReadOptions(), buf, &en_val);\n    if(s.IsNotFound()){\n        return 0;\n    } else if(!s.ok()){\n        log_error(\"get error: %s\", s.ToString().c_str());\n        return -1;\n    } else{\n        if (en_val[0] != DataType::KV){\n            return 0;\n        }\n    }\n\tbinlogs->Delete(buf);\n\tbinlogs->add_log(log_type, BinlogCommand::KDEL, buf);\n\treturn 1;\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>\/**\n * @file parser_test.cpp\n * @author Chase Geigle\n *\/\n\n#include <iostream>\n\n#include \"cpptoml.h\"\n#include \"logging\/logger.h\"\n#include \"parser\/io\/ptb_reader.h\"\n#include \"parser\/sr_parser.h\"\n#include \"parser\/trees\/visitors\/annotation_remover.h\"\n#include \"parser\/trees\/visitors\/empty_remover.h\"\n#include \"parser\/trees\/visitors\/unary_chain_remover.h\"\n#include \"parser\/trees\/visitors\/multi_transformer.h\"\n#include \"parser\/trees\/visitors\/head_finder.h\"\n#include \"parser\/trees\/visitors\/binarizer.h\"\n#include \"parser\/trees\/visitors\/debinarizer.h\"\n#include \"parser\/trees\/visitors\/transition_finder.h\"\n#include \"parser\/trees\/visitors\/leaf_node_finder.h\"\n#include \"parser\/trees\/visitors\/sequence_extractor.h\"\n#include \"util\/filesystem.h\"\n#include \"util\/progress.h\"\n\nusing namespace meta;\n\nstd::string two_digit(uint8_t num)\n{\n    std::stringstream ss;\n    ss << std::setw(2) << std::setfill('0') << static_cast<int>(num);\n    return ss.str();\n}\n\nint main(int argc, char** argv)\n{\n\n    if (argc < 3)\n    {\n        std::cerr << \"Usage: \" << argv[0] << \" config.toml output_file\" << std::endl;\n        return 1;\n    }\n\n    logging::set_cerr_logging();\n\n    auto config = cpptoml::parse_file(argv[1]);\n\n    auto prefix = config.get_as<std::string>(\"prefix\");\n    if (!prefix)\n    {\n        LOG(fatal) << \"Global configuration must have a prefix key\" << ENDLG;\n        return 1;\n    }\n\n    auto parser_grp = config.get_group(\"parser\");\n    if (!parser_grp)\n    {\n        LOG(fatal) << \"Configuration must contain a [parser] group\" << ENDLG;\n        return 1;\n    }\n\n    auto parser_prefix = parser_grp->get_as<std::string>(\"prefix\");\n    if (!parser_prefix)\n    {\n        LOG(fatal)\n            << \"[parser] group must contain a prefix to store model files\"\n            << ENDLG;\n        return 1;\n    }\n\n    auto treebank = parser_grp->get_as<std::string>(\"treebank\");\n    if (!treebank)\n    {\n        LOG(fatal) << \"[parser] group must contain a treebank path\" << ENDLG;\n        return 1;\n    }\n\n    auto corpus = parser_grp->get_as<std::string>(\"corpus\");\n    if (!corpus)\n    {\n        LOG(fatal) << \"[parser] group must contain a corpus\" << ENDLG;\n        return 1;\n    }\n\n    auto test_sections = parser_grp->get_array(\"test-sections\");\n    if (!test_sections)\n    {\n        LOG(fatal) << \"[parser] group must contain test-sections\" << ENDLG;\n        return 1;\n    }\n\n    auto section_size = parser_grp->get_as<int64_t>(\"section-size\");\n    if (!section_size)\n    {\n        LOG(fatal) << \"[parser] group must contain section-size\" << ENDLG;\n        return 1;\n    }\n\n    std::string path = *prefix + \"\/\" + *treebank + \"\/treebank-3\/parsed\/mrg\/\"\n                       + *corpus;\n\n    parser::multi_transformer<parser::annotation_remover, parser::empty_remover,\n                              parser::unary_chain_remover> transformer;\n\n    std::vector<sequence::sequence> testing;\n    {\n        auto begin = test_sections->at(0)->as<int64_t>()->value();\n        auto end = test_sections->at(1)->as<int64_t>()->value();\n        printing::progress progress(\" > Reading testing data: \",\n                                    (end - begin + 1) * *section_size);\n        for (uint8_t i = begin; i <= end; ++i)\n        {\n            auto folder = two_digit(i);\n            for (uint8_t j = 0; j <= *section_size; ++j)\n            {\n                progress((i - begin) * 99 + j);\n                auto file = *corpus + \"_\" + folder + two_digit(j) + \".mrg\";\n                auto filename = path + \"\/\" + folder + \"\/\" + file;\n                auto trees = parser::io::extract_trees(filename);\n                for (auto& tree : trees)\n                {\n                    parser::sequence_extractor seq_ex;\n                    tree.transform(transformer);\n                    tree.visit(seq_ex);\n                    testing.emplace_back(seq_ex.sequence());\n                }\n            }\n        }\n    }\n    LOG(info) << testing.size() << \" test examples\" << ENDLG;\n\n    parser::sr_parser parser{*parser_prefix};\n\n    std::ofstream output{argv[2]};\n    for (const auto& seq : testing)\n    {\n        std::cout << \"Parsing:\";\n        for (const auto& obs : seq)\n            std::cout << \" \" <<  obs.symbol();\n        std::cout << \"\\n\";\n\n        auto tree = parser.parse(seq);\n        tree.pretty_print(std::cout);\n        std::cout << \"\\n\\n\";\n        output << tree << \"\\n\";\n    }\n\n    return 0;\n}\n<commit_msg>Simplify the parser test application.<commit_after>\/**\n * @file parser_test.cpp\n * @author Chase Geigle\n *\/\n\n#include <iostream>\n\n#include \"cpptoml.h\"\n#include \"logging\/logger.h\"\n#include \"parser\/io\/ptb_reader.h\"\n#include \"parser\/sr_parser.h\"\n#include \"parser\/trees\/visitors\/empty_remover.h\"\n#include \"parser\/trees\/visitors\/sequence_extractor.h\"\n#include \"util\/filesystem.h\"\n#include \"util\/progress.h\"\n\nusing namespace meta;\n\nstd::string two_digit(uint8_t num)\n{\n    std::stringstream ss;\n    ss << std::setw(2) << std::setfill('0') << static_cast<int>(num);\n    return ss.str();\n}\n\nint main(int argc, char** argv)\n{\n\n    if (argc < 3)\n    {\n        std::cerr << \"Usage: \" << argv[0] << \" config.toml output_file\" << std::endl;\n        return 1;\n    }\n\n    logging::set_cerr_logging();\n\n    auto config = cpptoml::parse_file(argv[1]);\n\n    auto prefix = config.get_as<std::string>(\"prefix\");\n    if (!prefix)\n    {\n        LOG(fatal) << \"Global configuration must have a prefix key\" << ENDLG;\n        return 1;\n    }\n\n    auto parser_grp = config.get_group(\"parser\");\n    if (!parser_grp)\n    {\n        LOG(fatal) << \"Configuration must contain a [parser] group\" << ENDLG;\n        return 1;\n    }\n\n    auto parser_prefix = parser_grp->get_as<std::string>(\"prefix\");\n    if (!parser_prefix)\n    {\n        LOG(fatal)\n            << \"[parser] group must contain a prefix to store model files\"\n            << ENDLG;\n        return 1;\n    }\n\n    auto treebank = parser_grp->get_as<std::string>(\"treebank\");\n    if (!treebank)\n    {\n        LOG(fatal) << \"[parser] group must contain a treebank path\" << ENDLG;\n        return 1;\n    }\n\n    auto corpus = parser_grp->get_as<std::string>(\"corpus\");\n    if (!corpus)\n    {\n        LOG(fatal) << \"[parser] group must contain a corpus\" << ENDLG;\n        return 1;\n    }\n\n    auto test_sections = parser_grp->get_array(\"test-sections\");\n    if (!test_sections)\n    {\n        LOG(fatal) << \"[parser] group must contain test-sections\" << ENDLG;\n        return 1;\n    }\n\n    auto section_size = parser_grp->get_as<int64_t>(\"section-size\");\n    if (!section_size)\n    {\n        LOG(fatal) << \"[parser] group must contain section-size\" << ENDLG;\n        return 1;\n    }\n\n    std::string path = *prefix + \"\/\" + *treebank + \"\/treebank-3\/parsed\/mrg\/\"\n                       + *corpus;\n\n    parser::empty_remover transformer;\n\n    std::vector<sequence::sequence> testing;\n    {\n        auto begin = test_sections->at(0)->as<int64_t>()->value();\n        auto end = test_sections->at(1)->as<int64_t>()->value();\n        printing::progress progress(\" > Reading testing data: \",\n                                    (end - begin + 1) * *section_size);\n        for (uint8_t i = begin; i <= end; ++i)\n        {\n            auto folder = two_digit(i);\n            for (uint8_t j = 0; j <= *section_size; ++j)\n            {\n                progress((i - begin) * 99 + j);\n                auto file = *corpus + \"_\" + folder + two_digit(j) + \".mrg\";\n                auto filename = path + \"\/\" + folder + \"\/\" + file;\n                auto trees = parser::io::extract_trees(filename);\n                for (auto& tree : trees)\n                {\n                    parser::sequence_extractor seq_ex;\n                    tree.transform(transformer);\n                    tree.visit(seq_ex);\n                    testing.emplace_back(seq_ex.sequence());\n                }\n            }\n        }\n    }\n    LOG(info) << testing.size() << \" test examples\" << ENDLG;\n\n    parser::sr_parser parser{*parser_prefix};\n\n    std::ofstream output{argv[2]};\n    for (const auto& seq : testing)\n    {\n        std::cout << \"Parsing:\";\n        for (const auto& obs : seq)\n            std::cout << \" \" <<  obs.symbol();\n        std::cout << \"\\n\";\n\n        auto tree = parser.parse(seq);\n        tree.pretty_print(std::cout);\n        std::cout << \"\\n\\n\";\n        output << tree << \"\\n\";\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2012 Carsten Burstedde, Donna Calhoun\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, this\nlist of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice,\nthis list of conditions and the following disclaimer in the documentation\nand\/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 HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY 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 \"amr_forestclaw.H\"\n#include \"no_solver_user.H\"\n#include \"amr_utils.H\"\n\nvoid no_solver_linker(fclaw2d_domain_t* domain)\n{\n    link_problem_setup(domain,no_solver_setprob);\n\n    \/* Initialize data but don't do anything *\/\n\n    fclaw2d_solver_functions_t* sf = get_solver_functions(domain);\n    sf->f_patch_initialize = &no_solver_patch_initialize;\n    sf->f_patch_single_step_update = &no_solver_update;\n\n\n    fclaw2d_output_functions* of = get_output_functions(domain);\n    of->f_patch_write_header = &vtk_write_header;\n    of->f_patch_write_output = &vtk_write_output;\n\n    link_regrid_functions(domain,no_solver_patch_tag4refinement,\n                          no_solver_patch_tag4coarsening);\n}\n\nvoid no_solver_setprob(fclaw2d_domain_t* domain)\n{\n    set_maptype_();\n}\n\n\nvoid no_solver_patch_initialize(fclaw2d_domain_t *domain,\n                                fclaw2d_patch_t *this_patch,\n                                int this_block_idx,\n                                int this_patch_idx)\n{\n\n    set_block_(&this_block_idx);\n\n    \/\/ Global parameters\n    const amr_options_t *gparms = get_domain_parms(domain);\n    int mx = gparms->mx;\n    int my = gparms->my;\n    int mbc = gparms->mbc;\n    int meqn = gparms->meqn;\n\n    \/\/ Parameters specific to this patch\n    ClawPatch *cp = get_clawpatch(this_patch);\n    double xlower = cp->xlower();\n    double ylower = cp->ylower();\n    double dx = cp->dx();\n    double dy = cp->dy();\n\n    \/\/ Pointers needed for the fortran\n    double* q = cp->q();\n\n    int mpirank = domain->mpirank;\n\n    initialize_(mx,my,meqn,mbc,xlower,ylower,dx,dy,q,mpirank);\n}\n\ndouble no_solver_update(fclaw2d_domain_t *domain,\n                        fclaw2d_patch_t *this_patch,\n                        int this_block_idx,\n                        int this_patch_idx,\n                        double t,\n                        double dt)\n{\n    ClawPatch *cp = get_clawpatch(this_patch);\n\n    \/\/ save the current time step for time interpolation.  Otherwise, we get\n    \/\/ unitialized values.\n    cp->save_current_step();  \/\/ Save for time interpolation\n    return 1.0;\n}\n\n\n\/* -----------------------------------------------------------------\n   Default routine for tagging patches for refinement and coarsening\n   ----------------------------------------------------------------- *\/\nfclaw_bool no_solver_patch_tag4refinement(fclaw2d_domain_t *domain,\n                                          fclaw2d_patch_t *this_patch,\n                                          int this_block_idx, int this_patch_idx,\n                                          int initflag)\n{\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Global parameters\n    const amr_options_t *gparms = get_domain_parms(domain);\n    int mx = gparms->mx;\n    int my = gparms->my;\n    int mbc = gparms->mbc;\n    int meqn = gparms->meqn;\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Patch specific parameters\n    ClawPatch *cp = get_clawpatch(this_patch);\n    double xlower = cp->xlower();\n    double ylower = cp->ylower();\n    double dx = cp->dx();\n    double dy = cp->dy();\n\n    \/* ------------------------------------------------------------ *\/\n    \/\/ Pointers needed to pass to Fortran\n    double* q = cp->q();\n\n    int tag_patch;  \/\/ == 0 or 1\n    no_solver_tag4refinement_(mx,my,mbc,meqn,xlower,ylower,dx,dy,q,initflag,tag_patch);\n    return tag_patch == 1;\n}\n\nfclaw_bool no_solver_patch_tag4coarsening(fclaw2d_domain_t *domain,\n                                          fclaw2d_patch_t *this_patch,\n                                          int blockno,\n                                          int patchno)\n{\n    \/\/ This might come in handy if we want to debug a coarsening routine without\n    \/\/ worrying about solvers.\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Global parameters\n    const amr_options_t *gparms = get_domain_parms(domain);\n    int mx = gparms->mx;\n    int my = gparms->my;\n    int mbc = gparms->mbc;\n    int meqn = gparms->meqn;\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Patch specific parameters\n    ClawPatch *cp = get_clawpatch(this_patch);\n    double xlower = cp->xlower();\n    double ylower = cp->ylower();\n    double dx = cp->dx();\n    double dy = cp->dy();\n\n    \/* ------------------------------------------------------------ *\/\n    \/\/ Pointers needed to pass to Fortran\n    double* qcoarse = cp->q();\n\n    int tag_patch;  \/\/ == 0 or 1\n    no_solver_tag4coarsening_(mx,my,mbc,meqn,xlower,ylower,dx,dy,qcoarse,tag_patch);\n    return tag_patch == 0;\n}\n\n\nvoid vtk_write_header(fclaw2d_domain_t* domain, int iframe, int ngrids)\n{\n    const amr_options_t *gparms = get_domain_parms(domain);\n    double time = get_domain_time(domain);\n\n    printf(\"Matlab output Frame %d  at time %16.8e\\n\\n\",iframe,time);\n\n    \/\/ Write out header file containing global information for 'iframe'\n    int meqn = gparms->meqn;\n    int maux = 0;\n    write_tfile_(iframe,time,meqn,ngrids,maux);\n\n    \/\/ This opens file 'fort.qXXXX' for replace (where XXXX = <zero padding><iframe>, e.g. 0001,\n    \/\/ 0010, 0114), and closes the file.\n    new_qfile_(iframe);\n}\n\n\nvoid vtk_write_output(fclaw2d_domain_t *domain, fclaw2d_patch_t *this_patch,\n                      int this_block_idx, int this_patch_idx,\n                      int iframe,int num,int level)\n{\n    \/\/ In case this is needed by the setaux routine\n    set_block_(&this_block_idx);\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Global parameters\n    const amr_options_t *gparms = get_domain_parms(domain);\n    int mx = gparms->mx;\n    int my = gparms->my;\n    int mbc = gparms->mbc;\n    int meqn = gparms->meqn;\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Patch specific parameters\n    ClawPatch *cp = get_clawpatch(this_patch);\n    double xlower = cp->xlower();\n    double ylower = cp->ylower();\n    double dx = cp->dx();\n    double dy = cp->dy();\n\n    \/* ------------------------------------------------------------ *\/\n    \/\/ Pointers needed to pass to Fortran\n    double* q = cp->q();\n\n    \/\/ Other input arguments\n    int maxmx = mx;\n    int maxmy = my;\n\n    \/* ------------------------------------------------------------- *\/\n    \/\/ This opens a file for append.  Now, the style is in the 'clawout' style.\n    int matlab_level = level + 1;\n    write_qfile_(maxmx,maxmy,meqn,mbc,mx,my,xlower,ylower,dx,dy,q,\n                 iframe,num,matlab_level,this_block_idx);\n}\n<commit_msg>Changed name of output routine<commit_after>\/*\nCopyright (c) 2012 Carsten Burstedde, Donna Calhoun\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, this\nlist of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice,\nthis list of conditions and the following disclaimer in the documentation\nand\/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 HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY 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 \"amr_forestclaw.H\"\n#include \"no_solver_user.H\"\n#include \"amr_utils.H\"\n\nvoid no_solver_linker(fclaw2d_domain_t* domain)\n{\n    link_problem_setup(domain,no_solver_setprob);\n\n    \/* Initialize data but don't do anything *\/\n\n    fclaw2d_solver_functions_t* sf = get_solver_functions(domain);\n    sf->f_patch_initialize = &no_solver_patch_initialize;\n    sf->f_patch_single_step_update = &no_solver_update;\n\n\n    fclaw2d_output_functions* of = get_output_functions(domain);\n    of->f_patch_write_header = &matlab_parallel_write_header;\n    of->f_patch_write_output = &matlab_parallel_write_output;\n\n    link_regrid_functions(domain,no_solver_patch_tag4refinement,\n                          no_solver_patch_tag4coarsening);\n}\n\nvoid no_solver_setprob(fclaw2d_domain_t* domain)\n{\n    set_maptype_();\n}\n\n\nvoid no_solver_patch_initialize(fclaw2d_domain_t *domain,\n                                fclaw2d_patch_t *this_patch,\n                                int this_block_idx,\n                                int this_patch_idx)\n{\n\n    set_block_(&this_block_idx);\n\n    \/\/ Global parameters\n    const amr_options_t *gparms = get_domain_parms(domain);\n    int mx = gparms->mx;\n    int my = gparms->my;\n    int mbc = gparms->mbc;\n    int meqn = gparms->meqn;\n\n    \/\/ Parameters specific to this patch\n    ClawPatch *cp = get_clawpatch(this_patch);\n    double xlower = cp->xlower();\n    double ylower = cp->ylower();\n    double dx = cp->dx();\n    double dy = cp->dy();\n\n    \/\/ Pointers needed for the fortran\n    double* q = cp->q();\n\n    int mpirank = domain->mpirank;\n\n    initialize_(mx,my,meqn,mbc,xlower,ylower,dx,dy,q,mpirank);\n}\n\ndouble no_solver_update(fclaw2d_domain_t *domain,\n                        fclaw2d_patch_t *this_patch,\n                        int this_block_idx,\n                        int this_patch_idx,\n                        double t,\n                        double dt)\n{\n    ClawPatch *cp = get_clawpatch(this_patch);\n\n    \/\/ save the current time step for time interpolation.  Otherwise, we get\n    \/\/ unitialized values.\n    cp->save_current_step();  \/\/ Save for time interpolation\n    return 1.0;\n}\n\n\n\/* -----------------------------------------------------------------\n   Default routine for tagging patches for refinement and coarsening\n   ----------------------------------------------------------------- *\/\nfclaw_bool no_solver_patch_tag4refinement(fclaw2d_domain_t *domain,\n                                          fclaw2d_patch_t *this_patch,\n                                          int this_block_idx, int this_patch_idx,\n                                          int initflag)\n{\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Global parameters\n    const amr_options_t *gparms = get_domain_parms(domain);\n    int mx = gparms->mx;\n    int my = gparms->my;\n    int mbc = gparms->mbc;\n    int meqn = gparms->meqn;\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Patch specific parameters\n    ClawPatch *cp = get_clawpatch(this_patch);\n    double xlower = cp->xlower();\n    double ylower = cp->ylower();\n    double dx = cp->dx();\n    double dy = cp->dy();\n\n    \/* ------------------------------------------------------------ *\/\n    \/\/ Pointers needed to pass to Fortran\n    double* q = cp->q();\n\n    int tag_patch;  \/\/ == 0 or 1\n    no_solver_tag4refinement_(mx,my,mbc,meqn,xlower,ylower,dx,dy,q,initflag,tag_patch);\n    return tag_patch == 1;\n}\n\nfclaw_bool no_solver_patch_tag4coarsening(fclaw2d_domain_t *domain,\n                                          fclaw2d_patch_t *this_patch,\n                                          int blockno,\n                                          int patchno)\n{\n    \/\/ This might come in handy if we want to debug a coarsening routine without\n    \/\/ worrying about solvers.\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Global parameters\n    const amr_options_t *gparms = get_domain_parms(domain);\n    int mx = gparms->mx;\n    int my = gparms->my;\n    int mbc = gparms->mbc;\n    int meqn = gparms->meqn;\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Patch specific parameters\n    ClawPatch *cp = get_clawpatch(this_patch);\n    double xlower = cp->xlower();\n    double ylower = cp->ylower();\n    double dx = cp->dx();\n    double dy = cp->dy();\n\n    \/* ------------------------------------------------------------ *\/\n    \/\/ Pointers needed to pass to Fortran\n    double* qcoarse = cp->q();\n\n    int tag_patch;  \/\/ == 0 or 1\n    no_solver_tag4coarsening_(mx,my,mbc,meqn,xlower,ylower,dx,dy,qcoarse,tag_patch);\n    return tag_patch == 0;\n}\n\n\nvoid matlab_parallel_write_header(fclaw2d_domain_t* domain, int iframe, int ngrids)\n{\n    if (domain->mpirank == 0)\n    {\n        const amr_options_t *gparms = get_domain_parms(domain);\n        double time = get_domain_time(domain);\n\n        printf(\"Matlab output Frame %d  at time %16.8e\\n\\n\",iframe,time);\n\n        \/\/ Write out header file containing global information for 'iframe'\n        int meqn = gparms->meqn;\n        int maux = 0;\n        write_tfile_(iframe,time,meqn,ngrids,maux);\n\n        \/\/ This opens file 'fort.qXXXX' for replace (where XXXX = <zero padding><iframe>, e.g. 0001,\n        \/\/ 0010, 0114), and closes the file.\n        new_qfile_(iframe);\n    }\n}\n\n\nvoid matlab_parallel_write_output(fclaw2d_domain_t *domain, fclaw2d_patch_t *this_patch,\n                                  int this_block_idx, int this_patch_idx,\n                                  int iframe,int num,int level)\n{\n    \/\/ In case this is needed by the setaux routine\n    set_block_(&this_block_idx);\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Global parameters\n    const amr_options_t *gparms = get_domain_parms(domain);\n    int mx = gparms->mx;\n    int my = gparms->my;\n    int mbc = gparms->mbc;\n    int meqn = gparms->meqn;\n\n    \/* ----------------------------------------------------------- *\/\n    \/\/ Patch specific parameters\n    ClawPatch *cp = get_clawpatch(this_patch);\n    double xlower = cp->xlower();\n    double ylower = cp->ylower();\n    double dx = cp->dx();\n    double dy = cp->dy();\n\n    \/* ------------------------------------------------------------ *\/\n    \/\/ Pointers needed to pass to Fortran\n    double* q = cp->q();\n\n    \/\/ Other input arguments\n    int maxmx = mx;\n    int maxmy = my;\n\n    \/* ------------------------------------------------------------- *\/\n    \/\/ This opens a file for append.  Now, the style is in the 'clawout' style.\n    int matlab_level = level + 1;\n\n    write_qfile_(maxmx,maxmy,meqn,mbc,mx,my,xlower,ylower,dx,dy,q,\n                 iframe,num,matlab_level,this_block_idx);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"pegr\/script\/ScriptHelper.hpp\"\n\n#include <stdexcept>\n#include <cassert>\n\n#include \"pegr\/debug\/DebugMacros.hpp\"\n#include \"pegr\/script\/Script.hpp\"\n\nnamespace pegr {\nnamespace Script {\nnamespace Helper {\n\nvoid for_pairs(int table_idx, std::function<bool()> func, bool pops_value) {\n    lua_State* l = Script::get_lua_state();\n    table_idx = Script::absolute_idx(table_idx);\n    lua_pushnil(l);\n    while (lua_next(l, table_idx) != 0) {\n        Script::Pop_Guard pg;\n        if (!pops_value) {\n            pg.on_push(1); \/\/ We will eat the value ourselves\n        }\n        \/\/ Assume we will need to eat the key ourselves\n        \/\/ in case the function raises errors or breaks the loop\n        pg.on_push(1);\n        bool cont = func();\n        if (!cont) {\n            break;\n        }\n        \/\/ If we got to this point, the key no longer needs to be eaten by us\n        pg.on_pop(1);\n    }\n}\n\n\/**\n * @brief Recursive helper for simple_deep_copy\n * @param l The Lua state to use\n * @param table_idx Absolute index for the table to be copied\n * @param dupe_idx Absolute index for a table that maps originals to copies\n *\/\nvoid simple_deep_copy_helper(lua_State* l, int table_idx, int dupe_idx) {\n    assert_balance(1);\n    \n    \/\/ Don't copy non-tables\n    if (!lua_istable(l, table_idx)) {\n        lua_pushvalue(l, table_idx);\n        return;\n    }\n    \n    \/\/ Check if we already made a copy before doing anything\n    lua_pushvalue(l, table_idx);\n    lua_rawget(l, dupe_idx);\n    if (lua_istable(l, -1)) {\n        return;\n    }\n    lua_pop(l, 1);\n    \n    lua_newtable(l); \/\/ TODO: preallocate enough space\n    int copy_idx = lua_gettop(l);\n    \n    \/\/ Store this table as a copy of the table at table_idx, even though\n    \/\/ we aren't finished making it yet. (If we try to wait until we\n    \/\/ are finished, it's possible that we will be waiting forever.)\n    lua_pushvalue(l, table_idx);\n    lua_pushvalue(l, copy_idx);\n    lua_rawset(l, dupe_idx);\n    \n    lua_pushnil(l);\n    while (lua_next(l, table_idx) != 0) {\n        int val_idx = lua_gettop(l);\n        \n        \/\/ Copy the reference to the key so there is one for iterating with\n        lua_pushvalue(l, -2);\n        \n        simple_deep_copy_helper(l, val_idx, dupe_idx);\n        \n        \/\/ Set the key-value pair\n        lua_settable(l, copy_idx);\n        \n        \/\/ Remove the original value reference\n        lua_pop(l, 1);\n        \n        \/\/ (A reference to the key is still on the stack for iteration)\n    }\n}\n\nvoid simple_deep_copy(int table_idx) {\n    assert_balance(1);\n    lua_State* l = Script::get_lua_state();\n    table_idx = Script::absolute_idx(table_idx);\n    \n    \/* This table maps original tables to the copied forms.\n     * This allows for duplicate reference values to be preserved and \n     * avoids crashing for recursive cases.\n     *\/\n    lua_newtable(l);\n    int dupe_idx = lua_gettop(l);\n    \n    simple_deep_copy_helper(l, table_idx, dupe_idx);\n    \n    lua_remove(l, dupe_idx);\n}\n\nvoid run_simple_function(Script::Regref ref, int nresults) {\n    assert_balance(nresults);\n    Script::push_reference(ref);\n    Script::run_function(0, nresults);\n}\n\nstd::string to_string(int idx, const char* def, int max_recusions) {\n    assert_balance(0);\n    lua_State* l = Script::get_lua_state();\n    idx = Script::absolute_idx(idx);\n    \n    Script::push_reference(Script::m_luaglob_tostring);\n    \n    lua_pushvalue(l, idx);\n    for (int count = 0; count <= max_recusions; ++count) {\n        std::size_t strsize;\n        const char* strdata = lua_tolstring(l, -1, &strsize);\n        \n        if (!strdata) {\n            lua_pushvalue(l, -2); \/\/ tostring() function\n            lua_pushvalue(l, -2); \/\/ the pesky string\n            Script::run_function(1, 1);\n            lua_remove(l, -2); \/\/ pop off the old pesky string\n            continue;\n        }\n        \n        lua_pop(l, 2); \/\/ remove cached tostring and the value\n        return std::string(strdata, strsize);\n    }\n    lua_pop(l, 2); \/\/ remove cached tostring and the value\n    if (def) {\n        return def;\n    }\n    throw std::runtime_error(\n        \"Maximum recusion depth reached when trying to convert a Lua \"\n        \"value into a string through tostring()\");\n}\n\nconst char* GENERIC_TO_STRING_DEFAULT = \n        \"[MAX TOSTRING() RECURSION DEPTH EXCEEDED]\";\n\n} \/\/ namespace Helper\n} \/\/ namespace Script\n} \/\/ namespace pegr\n<commit_msg>Case-sensitive function name<commit_after>#include \"pegr\/script\/ScriptHelper.hpp\"\n\n#include <stdexcept>\n#include <cassert>\n\n#include \"pegr\/debug\/DebugMacros.hpp\"\n#include \"pegr\/script\/Script.hpp\"\n\nnamespace pegr {\nnamespace Script {\nnamespace Helper {\n\nvoid for_pairs(int table_idx, std::function<bool()> func, bool pops_value) {\n    lua_State* l = Script::get_lua_state();\n    table_idx = Script::absolute_idx(table_idx);\n    lua_pushnil(l);\n    while (lua_next(l, table_idx) != 0) {\n        Script::Pop_Guard pg;\n        if (!pops_value) {\n            pg.on_push(1); \/\/ We will eat the value ourselves\n        }\n        \/\/ Assume we will need to eat the key ourselves\n        \/\/ in case the function raises errors or breaks the loop\n        pg.on_push(1);\n        bool cont = func();\n        if (!cont) {\n            break;\n        }\n        \/\/ If we got to this point, the key no longer needs to be eaten by us\n        pg.on_pop(1);\n    }\n}\n\n\/**\n * @brief Recursive helper for simple_deep_copy\n * @param l The Lua state to use\n * @param table_idx Absolute index for the table to be copied\n * @param dupe_idx Absolute index for a table that maps originals to copies\n *\/\nvoid simple_deep_copy_helper(lua_State* l, int table_idx, int dupe_idx) {\n    assert_balance(1);\n    \n    \/\/ Don't copy non-tables\n    if (!lua_istable(l, table_idx)) {\n        lua_pushvalue(l, table_idx);\n        return;\n    }\n    \n    \/\/ Check if we already made a copy before doing anything\n    lua_pushvalue(l, table_idx);\n    lua_rawget(l, dupe_idx);\n    if (lua_istable(l, -1)) {\n        return;\n    }\n    lua_pop(l, 1);\n    \n    lua_newtable(l); \/\/ TODO: preallocate enough space\n    int copy_idx = lua_gettop(l);\n    \n    \/\/ Store this table as a copy of the table at table_idx, even though\n    \/\/ we aren't finished making it yet. (If we try to wait until we\n    \/\/ are finished, it's possible that we will be waiting forever.)\n    lua_pushvalue(l, table_idx);\n    lua_pushvalue(l, copy_idx);\n    lua_rawset(l, dupe_idx);\n    \n    lua_pushnil(l);\n    while (lua_next(l, table_idx) != 0) {\n        int val_idx = lua_gettop(l);\n        \n        \/\/ Copy the reference to the key so there is one for iterating with\n        lua_pushvalue(l, -2);\n        \n        simple_deep_copy_helper(l, val_idx, dupe_idx);\n        \n        \/\/ Set the key-value pair\n        lua_settable(l, copy_idx);\n        \n        \/\/ Remove the original value reference\n        lua_pop(l, 1);\n        \n        \/\/ (A reference to the key is still on the stack for iteration)\n    }\n}\n\nvoid simple_deep_copy(int table_idx) {\n    assert_balance(1);\n    lua_State* l = Script::get_lua_state();\n    table_idx = Script::absolute_idx(table_idx);\n    \n    \/* This table maps original tables to the copied forms.\n     * This allows for duplicate reference values to be preserved and \n     * avoids crashing for recursive cases.\n     *\/\n    lua_newtable(l);\n    int dupe_idx = lua_gettop(l);\n    \n    simple_deep_copy_helper(l, table_idx, dupe_idx);\n    \n    lua_remove(l, dupe_idx);\n}\n\nvoid run_simple_function(Script::Regref ref, int nresults) {\n    assert_balance(nresults);\n    Script::push_reference(ref);\n    Script::run_function(0, nresults);\n}\n\nstd::string to_string(int idx, const char* def, int max_recusions) {\n    assert_balance(0);\n    lua_State* l = Script::get_lua_state();\n    idx = Script::absolute_idx(idx);\n    \n    Script::push_reference(Script::m_luaglob_tostring);\n    \n    lua_pushvalue(l, idx);\n    for (int count = 0; count <= max_recusions; ++count) {\n        std::size_t strsize;\n        const char* strdata = lua_tolstring(l, -1, &strsize);\n        \n        if (!strdata) {\n            lua_pushvalue(l, -2); \/\/ tostring() function\n            lua_pushvalue(l, -2); \/\/ the pesky string\n            Script::run_function(1, 1);\n            lua_remove(l, -2); \/\/ pop off the old pesky string\n            continue;\n        }\n        \n        lua_pop(l, 2); \/\/ remove cached tostring and the value\n        return std::string(strdata, strsize);\n    }\n    lua_pop(l, 2); \/\/ remove cached tostring and the value\n    if (def) {\n        return def;\n    }\n    throw std::runtime_error(\n        \"Maximum recusion depth reached when trying to convert a Lua \"\n        \"value into a string through tostring()\");\n}\n\nconst char* GENERIC_TO_STRING_DEFAULT = \n        \"[MAX tostring() RECURSION DEPTH EXCEEDED]\";\n\n} \/\/ namespace Helper\n} \/\/ namespace Script\n} \/\/ namespace pegr\n<|endoftext|>"}
{"text":"<commit_before>\n# include \"CHBD.hpp\"\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Constructor:\n\/\/ -------------------------------------------------------------------------\n\nCHBD::CHBD(const CommonParams& pin,\n           const GetPot& input_params) : p(pin), c1(p), c2(p), cp(p),\n                                         particles(p,input_params),\n                                         k1(p), k2(p), k4(p)\n{\n\n    \/\/\t---------------------------------------\n    \/\/ create the FFTw plans:\n    \/\/\t---------------------------------------\n\n    nxyz = p.nx*p.ny*p.nz;\n    dummy = fftw_alloc_complex(nxyz);\n    p_forward  = fftw_mpi_plan_dft_3d(p.NX,p.NY,p.NZ,dummy,dummy,\n                 MPI_COMM_WORLD,FFTW_FORWARD,FFTW_MEASURE);\n    p_backward = fftw_mpi_plan_dft_3d(p.NX,p.NY,p.NZ,dummy,dummy,\n                 MPI_COMM_WORLD,FFTW_BACKWARD,FFTW_MEASURE);\n    fftw_free(dummy);\n\n    \/\/\t---------------------------------------\n    \/\/ set needed parameters:\n    \/\/\t---------------------------------------\n\n    co = input_params(\"PFApp\/co\",0.5);\n    w = input_params(\"PFApp\/w\",1.0);\n    M = input_params(\"PFApp\/M\",1.0);\n    kap = input_params(\"PFApp\/kap\",1.0);\n    part_step_skip = input_params(\"PFApp\/part_step_skip\",1);\n    eCH = input_params(\"PFApp\/eCH\",0.1);\n\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Destructor:\n\/\/ -------------------------------------------------------------------------\n\nCHBD::~CHBD()\n{\n\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Initialize phase-field method:\n\/\/ -------------------------------------------------------------------------\n\nvoid CHBD::initPhaseField()\n{\n\n    \/\/\t---------------------------------------\n    \/\/ initialize the particle suspension:\n    \/\/\t---------------------------------------\n\n    particles.initParticles();\n    cp = particles.mapToGrid();\n\n    \/\/\t---------------------------------------\n    \/\/ initialize the concentration fields:\n    \/\/\t---------------------------------------\n\n    srand(time(NULL)*(p.rank+1));   \/\/ set the random seed\n    for (int i=0; i<nxyz; i++) {\n        double cpi = creal(cp.getValue(i));\n        double r = (double)rand()\/RAND_MAX;\n        double val = co + 0.1*(r-0.5);\n        val *= 1.0 - cpi;\n        c1.setValue(i,val);\n        c2.setValue(i,1-val);\n    }\n\n    \/\/\t---------------------------------------\n    \/\/ initialize the fourier wave-vectors:\n    \/\/\t---------------------------------------\n\n    calculateKfields();\n\n    \/\/\t---------------------------------------\n    \/\/ Output the initial configuration:\n    \/\/\t---------------------------------------\n\n    current_step = 0;\n    outputPhaseField();\n\n    \/\/\t---------------------------------------\n    \/\/ Sync the processors:\n    \/\/\t---------------------------------------\n\n    MPI::COMM_WORLD.Barrier();\n\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Step forward in time the phase-field method:\n\/\/ -------------------------------------------------------------------------\n\nvoid CHBD::updatePhaseField()\n{\n\n    \/\/\t---------------------------------------\n    \/\/ Update particles:\n    \/\/\t---------------------------------------\n\n    particles.setTimeStep(current_step);\n    if (current_step%part_step_skip == 0) {\n        particles.calcCapillaryForce(cp,c1,c2);\n        if (p.rank == 0) particles.updateParticles();\n        cp = particles.mapToGrid();\n    }\n\n    \/\/\t---------------------------------------\n    \/\/ Update Cahn-Hilliard:\n    \/\/\t---------------------------------------\n\n    Sfield dfdc1 = 12.0*w*(c1*c1*c1 - c1*c1 + c1*c2*c2 + c1*cp);\n    Sfield dfdc2 = 12.0*w*(c2*c2*c2 - c2*c2 + c2*c1*c1 + c2*cp);\n    c1.fft(p_forward);\n    c2.fft(p_forward);\n    dfdc1.fft(p_forward);\n    dfdc2.fft(p_forward);\n    if (eCH > 0.0)\n    {\n        \/\/ update with electric field in z-direction\n        c1 = (c1 - p.dt*k2*dfdc1 - p.dt*eCH*(*kz)*(*kz)*c1)\\\n             \/(1.0 + kap*p.dt*k4);\n        c2 = (c2 - p.dt*k2*dfdc2 - p.dt*eCH*(*kz)*(*kz)*c2)\\\n             \/(1.0 + kap*p.dt*k4);\n    }\n    else\n    {\n        \/\/ update with no electric field\n        c1 = (c1 - p.dt*k2*dfdc1)\/(1.0 + kap*p.dt*k4);\n        c2 = (c2 - p.dt*k2*dfdc2)\/(1.0 + kap*p.dt*k4);\n    }\n    c1.ifft(p_backward);\n    c2.ifft(p_backward);\n\n    \/\/\t---------------------------------------\n    \/\/ Sync the processors:\n    \/\/\t---------------------------------------\n\n    MPI::COMM_WORLD.Barrier();\n\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Write output for the phase-field method:\n\/\/ -------------------------------------------------------------------------\n\nvoid CHBD::outputPhaseField()\n{\n    int iskip = p.iskip;\n    int jskip = p.jskip;\n    int kskip = p.kskip;\n    Sfield phi = c1 - c2;\n    phi.writeVTKFile(\"c\",current_step,iskip,jskip,kskip);\n    if (p.rank == 0) particles.outputParticles();\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Calculate the wave-vector fields (k^1, k^2, k^4 for spectral solution):\n\/\/ -------------------------------------------------------------------------\n\nvoid CHBD::calculateKfields()\n{\n    Sfield kxf(p);\n    Sfield kyf(p);\n    Sfield kzf(p);\n    for (int i=0; i<p.nx; i++) {\n        for (int j=0; j<p.ny; j++) {\n            for (int k=0; k<p.nz; k++) {\n                int ii = i + p.xOff;\n                int jj = j;\n                int kk = k;\n                int ndx = i*p.NY*p.NZ + j*p.NZ + k;\n                double kx = ii*(2.0*M_PI\/p.LX);\n                double ky = jj*(2.0*M_PI\/p.LY);\n                double kz = kk*(2.0*M_PI\/p.LZ);\n                if (ii > p.NX\/2) kx = (ii-p.NX)*(2.0*M_PI\/p.LX);\n                if (jj > p.NY\/2) ky = (jj-p.NY)*(2.0*M_PI\/p.LY);\n                if (kk > p.NZ\/2) kz = (kk-p.NZ)*(2.0*M_PI\/p.LZ);\n                double kx2 = kx*kx;\n                double ky2 = ky*ky;\n                double kz2 = kz*kz;\n                double kijk2 = kx2 + ky2 + kz2;\n                double kijk4 = kijk2*kijk2;\n                kxf.setValue(ndx,kx);\n                kyf.setValue(ndx,ky);\n                kzf.setValue(ndx,kz);\n                k2.setValue(ndx,kijk2);\n                k4.setValue(ndx,kijk4);\n            }\n        }\n    }\n    k1.setXValues(kxf);\n    k1.setYValues(kyf);\n    k1.setZValues(kzf);\n    kz = k1.getZValues();\n}\n<commit_msg>change to outputting all fields for CHBD model<commit_after>\n# include \"CHBD.hpp\"\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Constructor:\n\/\/ -------------------------------------------------------------------------\n\nCHBD::CHBD(const CommonParams& pin,\n           const GetPot& input_params) : p(pin), c1(p), c2(p), cp(p),\n                                         particles(p,input_params),\n                                         k1(p), k2(p), k4(p)\n{\n\n    \/\/\t---------------------------------------\n    \/\/ create the FFTw plans:\n    \/\/\t---------------------------------------\n\n    nxyz = p.nx*p.ny*p.nz;\n    dummy = fftw_alloc_complex(nxyz);\n    p_forward  = fftw_mpi_plan_dft_3d(p.NX,p.NY,p.NZ,dummy,dummy,\n                 MPI_COMM_WORLD,FFTW_FORWARD,FFTW_MEASURE);\n    p_backward = fftw_mpi_plan_dft_3d(p.NX,p.NY,p.NZ,dummy,dummy,\n                 MPI_COMM_WORLD,FFTW_BACKWARD,FFTW_MEASURE);\n    fftw_free(dummy);\n\n    \/\/\t---------------------------------------\n    \/\/ set needed parameters:\n    \/\/\t---------------------------------------\n\n    co = input_params(\"PFApp\/co\",0.5);\n    w = input_params(\"PFApp\/w\",1.0);\n    M = input_params(\"PFApp\/M\",1.0);\n    kap = input_params(\"PFApp\/kap\",1.0);\n    part_step_skip = input_params(\"PFApp\/part_step_skip\",1);\n    eCH = input_params(\"PFApp\/eCH\",0.1);\n\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Destructor:\n\/\/ -------------------------------------------------------------------------\n\nCHBD::~CHBD()\n{\n\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Initialize phase-field method:\n\/\/ -------------------------------------------------------------------------\n\nvoid CHBD::initPhaseField()\n{\n\n    \/\/\t---------------------------------------\n    \/\/ initialize the particle suspension:\n    \/\/\t---------------------------------------\n\n    particles.initParticles();\n    cp = particles.mapToGrid();\n\n    \/\/\t---------------------------------------\n    \/\/ initialize the concentration fields:\n    \/\/\t---------------------------------------\n\n    srand(time(NULL)*(p.rank+1));   \/\/ set the random seed\n    for (int i=0; i<nxyz; i++) {\n        double cpi = creal(cp.getValue(i));\n        double r = (double)rand()\/RAND_MAX;\n        double val = co + 0.1*(r-0.5);\n        val *= 1.0 - cpi;\n        c1.setValue(i,val);\n        c2.setValue(i,1-val);\n    }\n\n    \/\/\t---------------------------------------\n    \/\/ initialize the fourier wave-vectors:\n    \/\/\t---------------------------------------\n\n    calculateKfields();\n\n    \/\/\t---------------------------------------\n    \/\/ Output the initial configuration:\n    \/\/\t---------------------------------------\n\n    current_step = 0;\n    outputPhaseField();\n\n    \/\/\t---------------------------------------\n    \/\/ Sync the processors:\n    \/\/\t---------------------------------------\n\n    MPI::COMM_WORLD.Barrier();\n\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Step forward in time the phase-field method:\n\/\/ -------------------------------------------------------------------------\n\nvoid CHBD::updatePhaseField()\n{\n\n    \/\/\t---------------------------------------\n    \/\/ Update particles:\n    \/\/\t---------------------------------------\n\n    particles.setTimeStep(current_step);\n    if (current_step%part_step_skip == 0) {\n        particles.calcCapillaryForce(cp,c1,c2);\n        if (p.rank == 0) particles.updateParticles();\n        cp = particles.mapToGrid();\n    }\n\n    \/\/\t---------------------------------------\n    \/\/ Update Cahn-Hilliard:\n    \/\/\t---------------------------------------\n\n    Sfield dfdc1 = 12.0*w*(c1*c1*c1 - c1*c1 + c1*c2*c2 + c1*cp);\n    Sfield dfdc2 = 12.0*w*(c2*c2*c2 - c2*c2 + c2*c1*c1 + c2*cp);\n    c1.fft(p_forward);\n    c2.fft(p_forward);\n    dfdc1.fft(p_forward);\n    dfdc2.fft(p_forward);\n    if (eCH > 0.0)\n    {\n        \/\/ update with electric field in z-direction\n        c1 = (c1 - p.dt*k2*dfdc1 - p.dt*eCH*(*kz)*(*kz)*c1)\\\n             \/(1.0 + kap*p.dt*k4);\n        c2 = (c2 - p.dt*k2*dfdc2 - p.dt*eCH*(*kz)*(*kz)*c2)\\\n             \/(1.0 + kap*p.dt*k4);\n    }\n    else\n    {\n        \/\/ update with no electric field\n        c1 = (c1 - p.dt*k2*dfdc1)\/(1.0 + kap*p.dt*k4);\n        c2 = (c2 - p.dt*k2*dfdc2)\/(1.0 + kap*p.dt*k4);\n    }\n    c1.ifft(p_backward);\n    c2.ifft(p_backward);\n\n    \/\/\t---------------------------------------\n    \/\/ Sync the processors:\n    \/\/\t---------------------------------------\n\n    MPI::COMM_WORLD.Barrier();\n\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Write output for the phase-field method:\n\/\/ -------------------------------------------------------------------------\n\nvoid CHBD::outputPhaseField()\n{\n    int iskip = p.iskip;\n    int jskip = p.jskip;\n    int kskip = p.kskip;\n    c1.writeVTKFile(\"c1\",current_step,iskip,jskip,kskip);\n    c2.writeVTKFile(\"c2\",current_step,iskip,jskip,kskip);\n    cp.writeVTKFile(\"cp\",current_step,iskip,jskip,kskip);\n    if (p.rank == 0) particles.outputParticles();\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Calculate the wave-vector fields (k^1, k^2, k^4 for spectral solution):\n\/\/ -------------------------------------------------------------------------\n\nvoid CHBD::calculateKfields()\n{\n    Sfield kxf(p);\n    Sfield kyf(p);\n    Sfield kzf(p);\n    for (int i=0; i<p.nx; i++) {\n        for (int j=0; j<p.ny; j++) {\n            for (int k=0; k<p.nz; k++) {\n                int ii = i + p.xOff;\n                int jj = j;\n                int kk = k;\n                int ndx = i*p.NY*p.NZ + j*p.NZ + k;\n                double kx = ii*(2.0*M_PI\/p.LX);\n                double ky = jj*(2.0*M_PI\/p.LY);\n                double kz = kk*(2.0*M_PI\/p.LZ);\n                if (ii > p.NX\/2) kx = (ii-p.NX)*(2.0*M_PI\/p.LX);\n                if (jj > p.NY\/2) ky = (jj-p.NY)*(2.0*M_PI\/p.LY);\n                if (kk > p.NZ\/2) kz = (kk-p.NZ)*(2.0*M_PI\/p.LZ);\n                double kx2 = kx*kx;\n                double ky2 = ky*ky;\n                double kz2 = kz*kz;\n                double kijk2 = kx2 + ky2 + kz2;\n                double kijk4 = kijk2*kijk2;\n                kxf.setValue(ndx,kx);\n                kyf.setValue(ndx,ky);\n                kzf.setValue(ndx,kz);\n                k2.setValue(ndx,kijk2);\n                k4.setValue(ndx,kijk4);\n            }\n        }\n    }\n    k1.setXValues(kxf);\n    k1.setYValues(kyf);\n    k1.setZValues(kzf);\n    kz = k1.getZValues();\n}\n<|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 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\n#include <pcl\/io\/openni_grabber.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <boost\/thread\/thread.hpp>\n#include <pcl\/visualization\/pcl_visualizer.h>\n#include <pcl\/io\/io.h>\n#include <boost\/make_shared.hpp>\n#include <pcl\/common\/time.h>\n#include <pcl\/features\/integral_image_normal.h>\n#include <pcl\/features\/normal_3d.h>\n#include <pcl\/ModelCoefficients.h>\n#include <pcl\/segmentation\/organized_multi_plane_segmentation.h>\n#include <pcl\/filters\/extract_indices.h>\n\ntypedef pcl::PointXYZRGBA PointT;\n\nclass OpenNIOrganizedMultiPlaneSegmentation\n{\n  private:\n    boost::shared_ptr<pcl::visualization::PCLVisualizer> viewer;\n    pcl::PointCloud<PointT>::ConstPtr prev_cloud;\n    boost::mutex cloud_mutex;\n\n  public:\n    OpenNIOrganizedMultiPlaneSegmentation ()\n    {\n\n    }\n    ~OpenNIOrganizedMultiPlaneSegmentation ()\n    {\n    }\n\n    boost::shared_ptr<pcl::visualization::PCLVisualizer>\n    cloudViewer (pcl::PointCloud<PointT>::ConstPtr cloud)\n    {\n      boost::shared_ptr < pcl::visualization::PCLVisualizer> viewer (new pcl::visualization::PCLVisualizer (\"Viewer\"));\n      viewer->setBackgroundColor (0, 0, 0);\n      pcl::visualization::PointCloudColorHandlerCustom<PointT> single_color (cloud, 0, 255, 0);\n      viewer->addPointCloud < PointT > (cloud, single_color, \"cloud\");\n      viewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 3, \"cloud\");\n      viewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_OPACITY, 0.15, \"cloud\");\n      viewer->addCoordinateSystem (1.0);\n      viewer->initCameraParameters ();\n      return (viewer);\n    }\n\n    void\n    cloud_cb_ (const pcl::PointCloud<PointT>::ConstPtr& cloud)\n    {\n      if (!viewer->wasStopped ())\n      {\n        cloud_mutex.lock ();\n        prev_cloud = cloud;\n        cloud_mutex.unlock ();\n      }\n    }\n\n    void\n    run ()\n    {\n      pcl::Grabber* interface = new pcl::OpenNIGrabber ();\n\n      boost::function<void\n      (const pcl::PointCloud<PointT>::ConstPtr&)> f = boost::bind (&OpenNIOrganizedMultiPlaneSegmentation::cloud_cb_, this, _1);\n\n      \/\/make a viewer\n      pcl::PointCloud<PointT>::Ptr init_cloud_ptr (new pcl::PointCloud<PointT>);\n      viewer = cloudViewer (init_cloud_ptr);\n      boost::signals2::connection c = interface->registerCallback (f);\n\n      interface->start ();\n\n      unsigned char red [6] = {255,   0,   0, 255, 255,   0};\n      unsigned char grn [6] = {  0, 255,   0, 255,   0, 255};\n      unsigned char blu [6] = {  0,   0, 255,   0, 255, 255};\n\n      while (!viewer->wasStopped ())\n      {\n        viewer->spinOnce (100);\n\n        if (prev_cloud && cloud_mutex.try_lock ())\n        {\n          printf (\"Computing normals...\\n\");\n          pcl::PointCloud < pcl::Normal > normal_cloud;\n          double normal_start = pcl::getTime ();\n          pcl::IntegralImageNormalEstimation<PointT, pcl::Normal> ne;\n          ne.setNormalEstimationMethod (ne.SIMPLE_3D_GRADIENT);\n          ne.setMaxDepthChangeFactor (0.02f);\n          ne.setNormalSmoothingSize (10.0f);\n          ne.setInputCloud (prev_cloud);\n          ne.compute (normal_cloud);\n          double normal_end = pcl::getTime ();\n          std::cout << \"Normal Estimation took \" << double (normal_end - normal_start) << std::endl;\n\n          printf (\"Extracting planes...\\n\");\n          std::vector < pcl::ModelCoefficients > plane_models;\n          std::vector < pcl::PointIndices > planes_inliers;\n          pcl::PointCloud<pcl::Label> labels;\n          std::vector<pcl::PointIndices> label_indices;\n          double plane_extract_start = pcl::getTime ();\n          pcl::OrganizedMultiPlaneSegmentation<PointT, pcl::Normal, pcl::Label> mps;\n          mps.setMinInliers (10000);\n          mps.setAngularThreshold (0.017453 * 2.0); \/\/3 degrees\n          mps.setDistanceThreshold (0.02); \/\/2cm\n          mps.setInputNormals (boost::make_shared < pcl::PointCloud<pcl::Normal> > (normal_cloud));\n          mps.setInputCloud (prev_cloud);\n          mps.segment (plane_models, planes_inliers,labels,label_indices);\n          double plane_extract_end = pcl::getTime ();\n          std::cout << \"Plane extraction took \" << double (plane_extract_end - plane_extract_start) << std::endl;\n          std::cout << \"Frame took \" << double (plane_extract_end - normal_start) << std::endl;\n\n          char name [1024];\n          pcl::PointCloud<PointT>::Ptr cluster (new pcl::PointCloud<PointT>);\n          viewer->removeAllPointClouds(0);\n          viewer->removeAllShapes ();\n          if(!viewer->updatePointCloud < PointT > (boost::make_shared < pcl::PointCloud<PointT> > (*prev_cloud),\"cloud\")){\n            viewer->addPointCloud < PointT > (boost::make_shared < pcl::PointCloud<PointT> > (*prev_cloud),\"cloud\");\n          }\n\n          \/\/Draw Visualization\n          for (size_t i = 0; i < planes_inliers.size (); i++)\n          {\n            Eigen::Vector4f centroid;\n            pcl::compute3DCentroid (*prev_cloud, planes_inliers[i], centroid);\n            pcl::PointXYZ pt1 = pcl::PointXYZ (centroid[0], centroid[1], centroid[2]);\n            pcl::PointXYZ pt2 = pcl::PointXYZ (centroid[0] + (0.5 * plane_models[i].values[0]),\n                                               centroid[1] + (0.5 * plane_models[i].values[1]),\n                                               centroid[2] + (0.5 * plane_models[i].values[2]));\n            sprintf (name, \"normal_%d\", (unsigned)i);\n            viewer->addArrow (pt2, pt1, 1.0, 0, 0, name);\n\n            pcl::copyPointCloud (*prev_cloud,planes_inliers[i],*cluster);\n            sprintf (name, \"plane_%02d\", (int)i);\n            pcl::visualization::PointCloudColorHandlerCustom <PointT> color (cluster, red[i], grn[i], blu[i]);\n            viewer->addPointCloud (cluster, color, name);\n          \n          }\n          cloud_mutex.unlock ();\n        }\n      }\n\n      interface->stop ();\n    }\n};\n\nint\nmain ()\n{\n  OpenNIOrganizedMultiPlaneSegmentation multi_plane_app;\n  multi_plane_app.run ();\n  return 0;\n}\n<commit_msg>minor changes<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 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\n#include <pcl\/io\/openni_grabber.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <boost\/thread\/thread.hpp>\n#include <pcl\/visualization\/pcl_visualizer.h>\n#include <pcl\/io\/io.h>\n#include <boost\/make_shared.hpp>\n#include <pcl\/common\/time.h>\n#include <pcl\/features\/integral_image_normal.h>\n#include <pcl\/features\/normal_3d.h>\n#include <pcl\/ModelCoefficients.h>\n#include <pcl\/segmentation\/organized_multi_plane_segmentation.h>\n#include <pcl\/filters\/extract_indices.h>\n\ntypedef pcl::PointXYZRGBA PointT;\n\nclass OpenNIOrganizedMultiPlaneSegmentation\n{\n  private:\n    boost::shared_ptr<pcl::visualization::PCLVisualizer> viewer;\n    pcl::PointCloud<PointT>::ConstPtr prev_cloud;\n    boost::mutex cloud_mutex;\n\n  public:\n    OpenNIOrganizedMultiPlaneSegmentation ()\n    {\n\n    }\n    ~OpenNIOrganizedMultiPlaneSegmentation ()\n    {\n    }\n\n    boost::shared_ptr<pcl::visualization::PCLVisualizer>\n    cloudViewer (pcl::PointCloud<PointT>::ConstPtr cloud)\n    {\n      boost::shared_ptr < pcl::visualization::PCLVisualizer> viewer (new pcl::visualization::PCLVisualizer (\"Viewer\"));\n      viewer->setBackgroundColor (0, 0, 0);\n      pcl::visualization::PointCloudColorHandlerCustom<PointT> single_color (cloud, 0, 255, 0);\n      viewer->addPointCloud<PointT> (cloud, single_color, \"cloud\");\n      viewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 3, \"cloud\");\n      viewer->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_OPACITY, 0.15, \"cloud\");\n      viewer->addCoordinateSystem (1.0);\n      viewer->initCameraParameters ();\n      return (viewer);\n    }\n\n    void\n    cloud_cb_ (const pcl::PointCloud<PointT>::ConstPtr& cloud)\n    {\n      if (!viewer->wasStopped ())\n      {\n        cloud_mutex.lock ();\n        prev_cloud = cloud;\n        cloud_mutex.unlock ();\n      }\n    }\n\n    void\n    removePreviousDataFromScreen (size_t prev_models_size)\n    {\n      char name[1024];\n      for (size_t i = 0; i < prev_models_size; i++)\n      {\n        sprintf (name, \"normal_%d\", (unsigned)i);\n        viewer->removeShape (name);\n\n        sprintf (name, \"plane_%02d\", (int)i);\n        viewer->removePointCloud (name);\n      }\n    }\n\n    void\n    run ()\n    {\n      pcl::Grabber* interface = new pcl::OpenNIGrabber ();\n\n      boost::function<void(const pcl::PointCloud<PointT>::ConstPtr&)> f = boost::bind (&OpenNIOrganizedMultiPlaneSegmentation::cloud_cb_, this, _1);\n\n      \/\/make a viewer\n      pcl::PointCloud<PointT>::Ptr init_cloud_ptr (new pcl::PointCloud<PointT>);\n      viewer = cloudViewer (init_cloud_ptr);\n      boost::signals2::connection c = interface->registerCallback (f);\n\n      interface->start ();\n\n      unsigned char red [6] = {255,   0,   0, 255, 255,   0};\n      unsigned char grn [6] = {  0, 255,   0, 255,   0, 255};\n      unsigned char blu [6] = {  0,   0, 255,   0, 255, 255};\n\n      pcl::IntegralImageNormalEstimation<PointT, pcl::Normal> ne;\n      ne.setNormalEstimationMethod (ne.SIMPLE_3D_GRADIENT);\n      ne.setMaxDepthChangeFactor (0.02f);\n      ne.setNormalSmoothingSize (10.0f);\n\n      pcl::OrganizedMultiPlaneSegmentation<PointT, pcl::Normal, pcl::Label> mps;\n      mps.setMinInliers (10000);\n      mps.setAngularThreshold (0.017453 * 2.0); \/\/3 degrees\n      mps.setDistanceThreshold (0.02); \/\/2cm\n\n      std::vector<pcl::ModelCoefficients> plane_models;\n      std::vector<pcl::PointIndices> planes_inliers;\n\n      size_t prev_models_size = 0;\n      char name[1024];\n\n      while (!viewer->wasStopped ())\n      {\n        viewer->spinOnce (100);\n\n        if (prev_cloud && cloud_mutex.try_lock ())\n        {\n          pcl::PointCloud<pcl::Normal>::Ptr normal_cloud (new pcl::PointCloud<pcl::Normal>);\n          double normal_start = pcl::getTime ();\n          ne.setInputCloud (prev_cloud);\n          ne.compute (*normal_cloud);\n          double normal_end = pcl::getTime ();\n          std::cout << \"Normal Estimation took \" << double (normal_end - normal_start) << std::endl;\n\n          double plane_extract_start = pcl::getTime ();\n          mps.setInputNormals (normal_cloud);\n          mps.setInputCloud (prev_cloud);\n          mps.segment (plane_models, planes_inliers);\n          double plane_extract_end = pcl::getTime ();\n          std::cout << \"Plane extraction took \" << double (plane_extract_end - plane_extract_start) << std::endl;\n          std::cout << \"Frame took \" << double (plane_extract_end - normal_start) << std::endl;\n\n          pcl::PointCloud<PointT>::Ptr cluster (new pcl::PointCloud<PointT>);\n\n          if (!viewer->updatePointCloud<PointT> (prev_cloud, \"cloud\"))\n            viewer->addPointCloud<PointT> (prev_cloud, \"cloud\");\n\n          removePreviousDataFromScreen (prev_models_size);\n          \/\/Draw Visualization\n          for (size_t i = 0; i < planes_inliers.size (); i++)\n          {\n            Eigen::Vector4f centroid;\n            pcl::compute3DCentroid (*prev_cloud, planes_inliers[i], centroid);\n            pcl::PointXYZ pt1 = pcl::PointXYZ (centroid[0], centroid[1], centroid[2]);\n            pcl::PointXYZ pt2 = pcl::PointXYZ (centroid[0] + (0.5 * plane_models[i].values[0]),\n                                               centroid[1] + (0.5 * plane_models[i].values[1]),\n                                               centroid[2] + (0.5 * plane_models[i].values[2]));\n            sprintf (name, \"normal_%d\", (unsigned)i);\n            viewer->addArrow (pt2, pt1, 1.0, 0, 0, name);\n\n            pcl::copyPointCloud (*prev_cloud, planes_inliers[i], *cluster);\n            sprintf (name, \"plane_%02d\", (int)i);\n            pcl::visualization::PointCloudColorHandlerCustom <PointT> color (cluster, red[i], grn[i], blu[i]);\n            viewer->addPointCloud (cluster, color, name);\n          }\n          prev_models_size = planes_inliers.size ();\n          cloud_mutex.unlock ();\n        }\n      }\n\n      interface->stop ();\n    }\n};\n\nint\nmain ()\n{\n  OpenNIOrganizedMultiPlaneSegmentation multi_plane_app;\n  multi_plane_app.run ();\n  return 0;\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#define WIN32_LEAN_AND_MEAN\n#include <Windows.h>\n#include <wincodec.h>\n#include \"SkAutoCoInitialize.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkImageEncoder.h\"\n#include \"SkIStream.h\"\n#include \"SkMovie.h\"\n#include \"SkStream.h\"\n#include \"SkTScopedComPtr.h\"\n\nclass SkImageDecoder_WIC : public SkImageDecoder {\nprotected:\n    virtual bool onDecode(SkStream* stream, SkBitmap* bm, Mode mode);\n};\n\nbool SkImageDecoder_WIC::onDecode(SkStream* stream, SkBitmap* bm, Mode mode) {\n    \/\/Initialize COM.\n    SkAutoCoInitialize scopedCo;\n    if (!scopedCo.succeeded()) {\n        return false;\n    }\n\n    HRESULT hr = S_OK;\n\n    \/\/Create Windows Imaging Component ImagingFactory.\n    SkTScopedComPtr<IWICImagingFactory> piImagingFactory;\n    if (SUCCEEDED(hr)) {\n        hr = CoCreateInstance(\n            CLSID_WICImagingFactory\n            , NULL\n            , CLSCTX_INPROC_SERVER\n            , IID_PPV_ARGS(&piImagingFactory)\n        );\n    }\n\n    \/\/Convert SkStream to IStream.\n    SkTScopedComPtr<IStream> piStream;\n    if (SUCCEEDED(hr)) {\n        hr = SkIStream::CreateFromSkStream(stream, false, &piStream);\n    }\n\n    \/\/Make sure we're at the beginning of the stream.\n    if (SUCCEEDED(hr)) {\n        LARGE_INTEGER liBeginning = { 0 };\n        hr = piStream->Seek(liBeginning, STREAM_SEEK_SET, NULL);\n    }\n\n    \/\/Create the decoder from the stream content.\n    SkTScopedComPtr<IWICBitmapDecoder> piBitmapDecoder;\n    if (SUCCEEDED(hr)) {\n        hr = piImagingFactory->CreateDecoderFromStream(\n            piStream.get()                    \/\/Image to be decoded\n            , NULL                            \/\/No particular vendor\n            , WICDecodeMetadataCacheOnDemand  \/\/Cache metadata when needed\n            , &piBitmapDecoder                \/\/Pointer to the decoder\n        );\n    }\n\n    \/\/Get the first frame from the decoder.\n    SkTScopedComPtr<IWICBitmapFrameDecode> piBitmapFrameDecode;\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapDecoder->GetFrame(0, &piBitmapFrameDecode);\n    }\n\n    \/\/Get the BitmapSource interface of the frame.\n    SkTScopedComPtr<IWICBitmapSource> piBitmapSourceOriginal;\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameDecode->QueryInterface(\n            IID_PPV_ARGS(&piBitmapSourceOriginal)\n        );\n    }\n\n    \/\/Get the size of the bitmap.\n    UINT width;\n    UINT height;\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapSourceOriginal->GetSize(&width, &height);\n    }\n\n    \/\/Exit early if we're only looking for the bitmap bounds.\n    if (SUCCEEDED(hr)) {\n        bm->setConfig(SkBitmap::kARGB_8888_Config, width, height);\n        if (SkImageDecoder::kDecodeBounds_Mode == mode) {\n            return true;\n        }\n        if (!this->allocPixelRef(bm, NULL)) {\n            return false;\n        }\n    }\n\n    \/\/Create a format converter.\n    SkTScopedComPtr<IWICFormatConverter> piFormatConverter;\n    if (SUCCEEDED(hr)) {\n        hr = piImagingFactory->CreateFormatConverter(&piFormatConverter);\n    }\n\n    if (SUCCEEDED(hr)) {\n        hr = piFormatConverter->Initialize(\n            piBitmapSourceOriginal.get()      \/\/Input bitmap to convert\n            , GUID_WICPixelFormat32bppPBGRA   \/\/Destination pixel format\n            , WICBitmapDitherTypeNone         \/\/Specified dither patterm\n            , NULL                            \/\/Specify a particular palette\n            , 0.f                             \/\/Alpha threshold\n            , WICBitmapPaletteTypeCustom      \/\/Palette translation type\n        );\n    }\n\n    \/\/Get the BitmapSource interface of the format converter.\n    SkTScopedComPtr<IWICBitmapSource> piBitmapSourceConverted;\n    if (SUCCEEDED(hr)) {\n        hr = piFormatConverter->QueryInterface(\n            IID_PPV_ARGS(&piBitmapSourceConverted)\n        );\n    }\n\n    \/\/Copy the pixels into the bitmap.\n    if (SUCCEEDED(hr)) {\n        SkAutoLockPixels alp(*bm);\n        bm->eraseColor(0);\n        const int stride = bm->rowBytes();\n        hr = piBitmapSourceConverted->CopyPixels(\n            NULL,                             \/\/Get all the pixels\n            stride,\n            stride * height,\n            reinterpret_cast<BYTE *>(bm->getPixels())\n        );\n    }\n\n    return SUCCEEDED(hr);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkImageDecoder* SkImageDecoder::Factory(SkStream* stream) {\n    return SkNEW(SkImageDecoder_WIC);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkMovie* SkMovie::DecodeStream(SkStream* stream) {\n    return NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass SkImageEncoder_WIC : public SkImageEncoder {\npublic:\n    SkImageEncoder_WIC(Type t) : fType(t) {}\n\nprotected:\n    virtual bool onEncode(SkWStream* stream, const SkBitmap& bm, int quality);\n\nprivate:\n    Type fType;\n};\n\nbool SkImageEncoder_WIC::onEncode(SkWStream* stream\n                                , const SkBitmap& bitmapOrig\n                                , int quality)\n{\n    GUID type;\n    switch (fType) {\n        case kJPEG_Type:\n            type = GUID_ContainerFormatJpeg;\n            break;\n        case kPNG_Type:\n            type = GUID_ContainerFormatPng;\n            break;\n        default:\n            return false;\n    }\n\n    \/\/Convert to 8888 if needed.\n    const SkBitmap* bitmap;\n    SkBitmap bitmapCopy;\n    if (SkBitmap::kARGB_8888_Config == bitmapOrig.config()) {\n        bitmap = &bitmapOrig;\n    } else {\n        if (!bitmapOrig.copyTo(&bitmapCopy, SkBitmap::kARGB_8888_Config)) {\n            return false;\n        }\n        bitmap = &bitmapCopy;\n    }\n\n    \/\/Initialize COM.\n    SkAutoCoInitialize scopedCo;\n    if (!scopedCo.succeeded()) {\n        return false;\n    }\n\n    HRESULT hr = S_OK;\n\n    \/\/Create Windows Imaging Component ImagingFactory.\n    SkTScopedComPtr<IWICImagingFactory> piImagingFactory;\n    if (SUCCEEDED(hr)) {\n        hr = CoCreateInstance(\n            CLSID_WICImagingFactory\n            , NULL\n            , CLSCTX_INPROC_SERVER\n            , IID_PPV_ARGS(&piImagingFactory)\n        );\n    }\n\n    \/\/Convert the SkWStream to an IStream.\n    SkTScopedComPtr<IStream> piStream;\n    if (SUCCEEDED(hr)) {\n        hr = SkWIStream::CreateFromSkWStream(stream, &piStream);\n    }\n\n    \/\/Create an encode of the appropriate type.\n    SkTScopedComPtr<IWICBitmapEncoder> piEncoder;\n    if (SUCCEEDED(hr)) {\n        hr = piImagingFactory->CreateEncoder(type, NULL, &piEncoder);\n    }\n\n    if (SUCCEEDED(hr)) {\n        hr = piEncoder->Initialize(piStream.get(), WICBitmapEncoderNoCache);\n    }\n\n    \/\/Create a the frame.\n    SkTScopedComPtr<IWICBitmapFrameEncode> piBitmapFrameEncode;\n    SkTScopedComPtr<IPropertyBag2> piPropertybag;\n    if (SUCCEEDED(hr)) {\n        hr = piEncoder->CreateNewFrame(&piBitmapFrameEncode, &piPropertybag);\n    }\n\n    if (SUCCEEDED(hr)) {\n        PROPBAG2 name = { 0 };\n        name.dwType = PROPBAG2_TYPE_DATA;\n        name.vt = VT_R4;\n        name.pstrName = L\"ImageQuality\";\n\n        VARIANT value;\n        VariantInit(&value);\n        value.vt = VT_R4;\n        value.fltVal = (FLOAT)(quality \/ 100.0);\n\n        \/\/Ignore result code.\n        \/\/  This returns E_FAIL if the named property is not in the bag.\n        \/\/TODO(bungeman) enumerate the properties,\n        \/\/  write and set hr iff property exists.\n        piPropertybag->Write(1, &name, &value);\n    }\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameEncode->Initialize(piPropertybag.get());\n    }\n\n    \/\/Set the size of the frame.\n    const UINT width = bitmap->width();\n    const UINT height = bitmap->height();\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameEncode->SetSize(width, height);\n    }\n\n    \/\/Set the pixel format of the frame.\n    const WICPixelFormatGUID formatDesired = GUID_WICPixelFormat32bppBGRA;\n    WICPixelFormatGUID formatGUID = formatDesired;\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameEncode->SetPixelFormat(&formatGUID);\n    }\n    if (SUCCEEDED(hr)) {\n        \/\/Be sure the image format is the one requested.\n        hr = IsEqualGUID(formatGUID, formatDesired) ? S_OK : E_FAIL;\n    }\n\n    \/\/Write the pixels into the frame.\n    if (SUCCEEDED(hr)) {\n        SkAutoLockPixels alp(*bitmap);\n        hr = piBitmapFrameEncode->WritePixels(\n            height\n            , bitmap->rowBytes()\n            , bitmap->rowBytes()*height\n            , reinterpret_cast<BYTE*>(bitmap->getPixels()));\n    }\n\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameEncode->Commit();\n    }\n\n    if (SUCCEEDED(hr)) {\n        hr = piEncoder->Commit();\n    }\n\n    return SUCCEEDED(hr);\n}\n\nSkImageEncoder* SkImageEncoder::Create(Type t) {\n    switch (t) {\n        case kJPEG_Type:\n        case kPNG_Type:\n            break;\n        default:\n            return NULL;\n    }\n    return SkNEW_ARGS(SkImageEncoder_WIC, (t));\n}\n\n<commit_msg>Update WIC Image decoder to unpremul colors before save<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#define WIN32_LEAN_AND_MEAN\n#include <Windows.h>\n#include <wincodec.h>\n#include \"SkAutoCoInitialize.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkImageEncoder.h\"\n#include \"SkIStream.h\"\n#include \"SkMovie.h\"\n#include \"SkStream.h\"\n#include \"SkTScopedComPtr.h\"\n#include \"SkUnPreMultiply.h\"\n\nclass SkImageDecoder_WIC : public SkImageDecoder {\nprotected:\n    virtual bool onDecode(SkStream* stream, SkBitmap* bm, Mode mode);\n};\n\nbool SkImageDecoder_WIC::onDecode(SkStream* stream, SkBitmap* bm, Mode mode) {\n    \/\/Initialize COM.\n    SkAutoCoInitialize scopedCo;\n    if (!scopedCo.succeeded()) {\n        return false;\n    }\n\n    HRESULT hr = S_OK;\n\n    \/\/Create Windows Imaging Component ImagingFactory.\n    SkTScopedComPtr<IWICImagingFactory> piImagingFactory;\n    if (SUCCEEDED(hr)) {\n        hr = CoCreateInstance(\n            CLSID_WICImagingFactory\n            , NULL\n            , CLSCTX_INPROC_SERVER\n            , IID_PPV_ARGS(&piImagingFactory)\n        );\n    }\n\n    \/\/Convert SkStream to IStream.\n    SkTScopedComPtr<IStream> piStream;\n    if (SUCCEEDED(hr)) {\n        hr = SkIStream::CreateFromSkStream(stream, false, &piStream);\n    }\n\n    \/\/Make sure we're at the beginning of the stream.\n    if (SUCCEEDED(hr)) {\n        LARGE_INTEGER liBeginning = { 0 };\n        hr = piStream->Seek(liBeginning, STREAM_SEEK_SET, NULL);\n    }\n\n    \/\/Create the decoder from the stream content.\n    SkTScopedComPtr<IWICBitmapDecoder> piBitmapDecoder;\n    if (SUCCEEDED(hr)) {\n        hr = piImagingFactory->CreateDecoderFromStream(\n            piStream.get()                    \/\/Image to be decoded\n            , NULL                            \/\/No particular vendor\n            , WICDecodeMetadataCacheOnDemand  \/\/Cache metadata when needed\n            , &piBitmapDecoder                \/\/Pointer to the decoder\n        );\n    }\n\n    \/\/Get the first frame from the decoder.\n    SkTScopedComPtr<IWICBitmapFrameDecode> piBitmapFrameDecode;\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapDecoder->GetFrame(0, &piBitmapFrameDecode);\n    }\n\n    \/\/Get the BitmapSource interface of the frame.\n    SkTScopedComPtr<IWICBitmapSource> piBitmapSourceOriginal;\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameDecode->QueryInterface(\n            IID_PPV_ARGS(&piBitmapSourceOriginal)\n        );\n    }\n\n    \/\/Get the size of the bitmap.\n    UINT width;\n    UINT height;\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapSourceOriginal->GetSize(&width, &height);\n    }\n\n    \/\/Exit early if we're only looking for the bitmap bounds.\n    if (SUCCEEDED(hr)) {\n        bm->setConfig(SkBitmap::kARGB_8888_Config, width, height);\n        if (SkImageDecoder::kDecodeBounds_Mode == mode) {\n            return true;\n        }\n        if (!this->allocPixelRef(bm, NULL)) {\n            return false;\n        }\n    }\n\n    \/\/Create a format converter.\n    SkTScopedComPtr<IWICFormatConverter> piFormatConverter;\n    if (SUCCEEDED(hr)) {\n        hr = piImagingFactory->CreateFormatConverter(&piFormatConverter);\n    }\n\n    if (SUCCEEDED(hr)) {\n        hr = piFormatConverter->Initialize(\n            piBitmapSourceOriginal.get()      \/\/Input bitmap to convert\n            , GUID_WICPixelFormat32bppPBGRA   \/\/Destination pixel format\n            , WICBitmapDitherTypeNone         \/\/Specified dither patterm\n            , NULL                            \/\/Specify a particular palette\n            , 0.f                             \/\/Alpha threshold\n            , WICBitmapPaletteTypeCustom      \/\/Palette translation type\n        );\n    }\n\n    \/\/Get the BitmapSource interface of the format converter.\n    SkTScopedComPtr<IWICBitmapSource> piBitmapSourceConverted;\n    if (SUCCEEDED(hr)) {\n        hr = piFormatConverter->QueryInterface(\n            IID_PPV_ARGS(&piBitmapSourceConverted)\n        );\n    }\n\n    \/\/Copy the pixels into the bitmap.\n    if (SUCCEEDED(hr)) {\n        SkAutoLockPixels alp(*bm);\n        bm->eraseColor(0);\n        const int stride = bm->rowBytes();\n        hr = piBitmapSourceConverted->CopyPixels(\n            NULL,                             \/\/Get all the pixels\n            stride,\n            stride * height,\n            reinterpret_cast<BYTE *>(bm->getPixels())\n        );\n\n        \/\/ Note: we don't need to premultiply here since we specified PBGRA\n        bm->computeAndSetOpaquePredicate();\n    }\n\n    return SUCCEEDED(hr);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkImageDecoder* SkImageDecoder::Factory(SkStream* stream) {\n    return SkNEW(SkImageDecoder_WIC);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkMovie* SkMovie::DecodeStream(SkStream* stream) {\n    return NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass SkImageEncoder_WIC : public SkImageEncoder {\npublic:\n    SkImageEncoder_WIC(Type t) : fType(t) {}\n\nprotected:\n    virtual bool onEncode(SkWStream* stream, const SkBitmap& bm, int quality);\n\nprivate:\n    Type fType;\n};\n\nbool SkImageEncoder_WIC::onEncode(SkWStream* stream\n                                , const SkBitmap& bitmapOrig\n                                , int quality)\n{\n    GUID type;\n    switch (fType) {\n        case kJPEG_Type:\n            type = GUID_ContainerFormatJpeg;\n            break;\n        case kPNG_Type:\n            type = GUID_ContainerFormatPng;\n            break;\n        default:\n            return false;\n    }\n\n    \/\/Convert to 8888 if needed.\n    const SkBitmap* bitmap;\n    SkBitmap bitmapCopy;\n    if (SkBitmap::kARGB_8888_Config == bitmapOrig.config() && bitmapOrig.isOpaque()) {\n        bitmap = &bitmapOrig;\n    } else {\n        if (!bitmapOrig.copyTo(&bitmapCopy, SkBitmap::kARGB_8888_Config)) {\n            return false;\n        }\n        bitmap = &bitmapCopy;\n    }\n\n    \/\/ We cannot use PBGRA so we need to unpremultiply ourselves\n    if (!bitmap->isOpaque()) {\n        SkAutoLockPixels alp(*bitmap);\n\n        uint8_t* pixels = reinterpret_cast<uint8_t*>(bitmap->getPixels());\n        for (int y = 0; y < bitmap->height(); ++y) {\n            for (int x = 0; x < bitmap->width(); ++x) {\n                uint8_t* bytes = pixels + y * bitmap->rowBytes() + x * bitmap->bytesPerPixel();\n\n                SkPMColor* src = reinterpret_cast<SkPMColor*>(bytes);\n                SkColor* dst = reinterpret_cast<SkColor*>(bytes);\n\n                *dst = SkUnPreMultiply::PMColorToColor(*src);\n            }\n        }\n    }\n\n    \/\/Initialize COM.\n    SkAutoCoInitialize scopedCo;\n    if (!scopedCo.succeeded()) {\n        return false;\n    }\n\n    HRESULT hr = S_OK;\n\n    \/\/Create Windows Imaging Component ImagingFactory.\n    SkTScopedComPtr<IWICImagingFactory> piImagingFactory;\n    if (SUCCEEDED(hr)) {\n        hr = CoCreateInstance(\n            CLSID_WICImagingFactory\n            , NULL\n            , CLSCTX_INPROC_SERVER\n            , IID_PPV_ARGS(&piImagingFactory)\n        );\n    }\n\n    \/\/Convert the SkWStream to an IStream.\n    SkTScopedComPtr<IStream> piStream;\n    if (SUCCEEDED(hr)) {\n        hr = SkWIStream::CreateFromSkWStream(stream, &piStream);\n    }\n\n    \/\/Create an encode of the appropriate type.\n    SkTScopedComPtr<IWICBitmapEncoder> piEncoder;\n    if (SUCCEEDED(hr)) {\n        hr = piImagingFactory->CreateEncoder(type, NULL, &piEncoder);\n    }\n\n    if (SUCCEEDED(hr)) {\n        hr = piEncoder->Initialize(piStream.get(), WICBitmapEncoderNoCache);\n    }\n\n    \/\/Create a the frame.\n    SkTScopedComPtr<IWICBitmapFrameEncode> piBitmapFrameEncode;\n    SkTScopedComPtr<IPropertyBag2> piPropertybag;\n    if (SUCCEEDED(hr)) {\n        hr = piEncoder->CreateNewFrame(&piBitmapFrameEncode, &piPropertybag);\n    }\n\n    if (SUCCEEDED(hr)) {\n        PROPBAG2 name = { 0 };\n        name.dwType = PROPBAG2_TYPE_DATA;\n        name.vt = VT_R4;\n        name.pstrName = L\"ImageQuality\";\n\n        VARIANT value;\n        VariantInit(&value);\n        value.vt = VT_R4;\n        value.fltVal = (FLOAT)(quality \/ 100.0);\n\n        \/\/Ignore result code.\n        \/\/  This returns E_FAIL if the named property is not in the bag.\n        \/\/TODO(bungeman) enumerate the properties,\n        \/\/  write and set hr iff property exists.\n        piPropertybag->Write(1, &name, &value);\n    }\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameEncode->Initialize(piPropertybag.get());\n    }\n\n    \/\/Set the size of the frame.\n    const UINT width = bitmap->width();\n    const UINT height = bitmap->height();\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameEncode->SetSize(width, height);\n    }\n\n    \/\/Set the pixel format of the frame.\n    const WICPixelFormatGUID formatDesired = GUID_WICPixelFormat32bppBGRA;\n    WICPixelFormatGUID formatGUID = formatDesired;\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameEncode->SetPixelFormat(&formatGUID);\n    }\n    if (SUCCEEDED(hr)) {\n        \/\/Be sure the image format is the one requested.\n        hr = IsEqualGUID(formatGUID, formatDesired) ? S_OK : E_FAIL;\n    }\n\n    \/\/Write the pixels into the frame.\n    if (SUCCEEDED(hr)) {\n        SkAutoLockPixels alp(*bitmap);\n        hr = piBitmapFrameEncode->WritePixels(\n            height\n            , bitmap->rowBytes()\n            , bitmap->rowBytes()*height\n            , reinterpret_cast<BYTE*>(bitmap->getPixels()));\n    }\n\n    if (SUCCEEDED(hr)) {\n        hr = piBitmapFrameEncode->Commit();\n    }\n\n    if (SUCCEEDED(hr)) {\n        hr = piEncoder->Commit();\n    }\n\n    return SUCCEEDED(hr);\n}\n\nSkImageEncoder* SkImageEncoder::Create(Type t) {\n    switch (t) {\n        case kJPEG_Type:\n        case kPNG_Type:\n            break;\n        default:\n            return NULL;\n    }\n    return SkNEW_ARGS(SkImageEncoder_WIC, (t));\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * PrimeSieveGUI.cpp -- This file is part of primesieve\n *\n * Copyright (C) 2012 Kim Walisch, <kim.walisch@gmail.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, 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 \"PrimeSieveGUI.h\"\n#include \"ui_PrimeSieveGUI.h\"\n#include \"PrimeSieveProcess.h\"\n#include \"..\/soe\/ParallelPrimeSieve.h\"\n#include \"..\/expr\/ExpressionParser.h\"\n\n#include <QtGlobal>\n#include <QCoreApplication>\n#include <QByteArray>\n#include <QTextStream>\n#include <QFile>\n#include <QSize>\n#include <QMessageBox>\n#include <QTextCursor>\n#include <stdexcept>\n\nPrimeSieveGUI::PrimeSieveGUI(QWidget *parent) :\n  QMainWindow(parent), ui(new Ui::PrimeSieveGUI), validator_(0),\n  primeSieveProcess_(0), saveAct_(0), quitAct_(0), aboutAct_(0),\n  alignmentGroup_(0) {\n  ui->setupUi(this);\n  primeText_.push_back(\"Prime numbers\");\n  primeText_.push_back(\"Twin primes\");\n  primeText_.push_back(\"Prime triplets\");\n  primeText_.push_back(\"Prime quadruplets\");\n  primeText_.push_back(\"Prime quintuplets\");\n  primeText_.push_back(\"Prime sextuplets\");\n  primeText_.push_back(\"Prime septuplets\");\n  this->initGUI();\n  this->initConnections();\n}\n\nPrimeSieveGUI::~PrimeSieveGUI() {\n  this->cleanUp();\n  delete validator_;\n  delete saveAct_;\n  delete quitAct_;\n  delete aboutAct_;\n  delete alignmentGroup_;\n  for (; !countAct_.isEmpty(); countAct_.pop_back())\n    delete countAct_.back();\n  for (; !printAct_.isEmpty(); printAct_.pop_back())\n    delete printAct_.back();\n  \/\/ Qt code\n  delete ui;\n}\n\nvoid PrimeSieveGUI::changeEvent(QEvent *e) {\n  QMainWindow::changeEvent(e);\n  switch (e->type()) {\n  case QEvent::LanguageChange:\n    ui->retranslateUi(this);\n    break;\n  default:\n    break;\n  }\n}\n\nvoid PrimeSieveGUI::initGUI() {\n  this->setWindowTitle(APPLICATION_NAME + \" \" + APPLICATION_VERSION);\n  this->createMenu(primeText_);\n\n  \/\/ fill the sieveSizeComboBox with power of 2 values <= \"4096 KB\"\n  for (int i = MINIMUM_SIEVE_SIZE; i <= MAXIMUM_SIEVE_SIZE; i *= 2)\n    ui->sieveSizeComboBox->addItem(QString::number(i) + \" KB\");\n  this->setTo(ui->sieveSizeComboBox, DEFAULT_SIEVE_SIZE);\n\n  \/\/ fill the threadsComboBox with power of 2 values <= maxThreads_\n  maxThreads_ = ParallelPrimeSieve::getMaxThreads();\n  for (int i = 1; i < maxThreads_; i *= 2)\n    ui->threadsComboBox->addItem(QString::number(i));\n  ui->threadsComboBox->addItem(QString::number(maxThreads_));\n  this->setTo(ui->threadsComboBox, \"1\");\n\n  \/\/ set an ideal ComboBox width\n  int width = ui->sieveSizeComboBox->minimumSizeHint().width();\n  ui->sieveSizeComboBox->setFixedWidth(width);\n  ui->threadsComboBox->setFixedWidth(width);\n\n  \/\/ set a nice GUI size\n  QSize size = this->sizeHint();\n  size.setWidth(this->minimumSizeHint().width());\n#if defined(Q_OS_WIN)\n  size.setHeight(size.height() - size.height() \/ 10);\n#endif\n  this->resize(size);\n\n  \/\/ limit input for arithmetic expressions\n  QRegExp rx(\"[0-9\\\\+\\\\-\\\\*\\\\\/\\\\%\\\\^\\\\(\\\\)\\\\e\\\\E]*\");\n  validator_ = new QRegExpValidator(rx, this);\n  ui->lowerBoundLineEdit->setValidator(validator_);\n  ui->upperBoundLineEdit->setValidator(validator_);\n}\n\nvoid PrimeSieveGUI::initConnections() {\n  connect(&progressBarTimer_,     SIGNAL(timeout()),                    this, SLOT(advanceProgressBar()));\n  connect(ui->lowerBoundLineEdit, SIGNAL(textChanged(const QString &)), this, SLOT(autoSetThreads()));\n  connect(ui->upperBoundLineEdit, SIGNAL(textChanged(const QString &)), this, SLOT(autoSetThreads()));\n  connect(ui->autoSetCheckBox,    SIGNAL(toggled(bool)),                this, SLOT(autoSetThreads()));\n  connect(saveAct_,               SIGNAL(triggered()),                  this, SLOT(saveToFile()));\n  connect(quitAct_,               SIGNAL(triggered()),                  qApp, SLOT(closeAllWindows()));\n  connect(alignmentGroup_,        SIGNAL(triggered(QAction*)),          this, SLOT(printMenuClicked(QAction*)));\n  connect(aboutAct_,              SIGNAL(triggered()),                  this, SLOT(showAboutDialog()));\n}\n\n\/**\n * Get the sieve size in kilobytes from the sieveSizeComboBox.\n * @post sieveSize >= 1 && sieveSize <= 4096.\n *\/\nint PrimeSieveGUI::getSieveSize() {\n  QString sieveSize(ui->sieveSizeComboBox->currentText());\n  \/\/ remove \" KB\"\n  sieveSize.chop(3);\n  return sieveSize.toInt();\n}\n\n\/**\n * Get the number of threads from the threadsComboBox.\n *\/\nint PrimeSieveGUI::getThreads() {\n  return ui->threadsComboBox->currentText().toInt();\n}\n\nquint64 PrimeSieveGUI::getNumber(const QString& str) {\n  if (str.isEmpty())\n    throw std::invalid_argument(\"Please enter a lower and upper bound for prime sieving.\");\n\n  ExpressionParser<quint64> parser;\n  quint64 result = 0;\n  try {\n    result = parser.eval(str.toAscii().data());\n  }\n  catch (parser_error& e) {\n    throw std::invalid_argument(((\"\\\"\" + e.expression()) + \"\\\"\\n\") + e.what());\n  }\n\n  int digits = str.count(QRegExp(\"[0-9]\"));\n  if (result >= UPPER_BOUND_LIMIT || (\n      digits == str.size() && (\n      digits >  UPPER_BOUND_STR.size() || (\n      digits == UPPER_BOUND_STR.size() &&\n      str    >= UPPER_BOUND_STR))))\n    throw std::invalid_argument(\"Please use positive integers < 2^64 - 2^32*10.\");\n\n  return result;\n}\n\nvoid PrimeSieveGUI::setTo(QComboBox* comboBox, const QString& text) {\n  comboBox->setCurrentIndex(comboBox->findText(text));\n}\n\n\/**\n * If \"Auto set\" is enabled set an ideal number of threads for the\n * current lower bound, upper bound in the threadsComboBox.\n *\/\nvoid PrimeSieveGUI::autoSetThreads() {\n  if (ui->autoSetCheckBox->isEnabled() && ui->autoSetCheckBox->isChecked()) {\n    try {\n      quint64 lowerBound = this->getNumber(ui->lowerBoundLineEdit->text());\n      quint64 upperBound = this->getNumber(ui->upperBoundLineEdit->text());\n      ParallelPrimeSieve pps;\n      pps.setStart(lowerBound);\n      pps.setStop(upperBound);\n      int idealNumThreads = pps.getNumThreads();\n      if (idealNumThreads < maxThreads_) {\n        \/\/ floor to the next power of 2 value\n        int p = 1;\n        for (; p <= idealNumThreads; p *= 2)\n          ;\n        idealNumThreads = p \/ 2;\n      }\n      this->setTo(ui->threadsComboBox, QString::number(idealNumThreads));\n    } catch (...) {\n      this->setTo(ui->threadsComboBox, \"1\");\n    }\n  }\n}\n\n\/**\n * The user has chosen a custom number of threads, disable \"Auto set\".\n *\/\nvoid PrimeSieveGUI::on_threadsComboBox_activated() {\n  ui->autoSetCheckBox->setChecked(false);\n}\n\n\/**\n * Start sieving primes.\n *\/\nvoid PrimeSieveGUI::on_sieveButton_clicked() {\n  \/\/ invert buttons, reset upon cleanUp()\n  ui->sieveButton->setDisabled(true);\n  ui->cancelButton->setEnabled(true);\n  try {\n    flags_ = this->getMenuSettings() | CALCULATE_STATUS;\n    if ((flags_ & (COUNT_FLAGS | PRINT_FLAGS)) == 0)\n      throw std::invalid_argument(\"Nothing to do, no count or print options selected.\");\n\n    quint64 lowerBound = this->getNumber(ui->lowerBoundLineEdit->text());\n    quint64 upperBound = this->getNumber(ui->upperBoundLineEdit->text());\n    if (lowerBound > upperBound)\n      throw std::invalid_argument(\"The lower bound must not be greater than the upper bound.\");\n\n    \/\/ reset the GUI widgets\n    ui->progressBar->setValue(ui->progressBar->minimum());\n    ui->textEdit->clear();\n    progressBarTimer_.start(25);\n\n    \/\/ start a new process for sieving (avoids cancel\n    \/\/ trouble with multiple threads)\n    primeSieveProcess_ = new PrimeSieveProcess(this);\n    if (flags_ & PRINT_FLAGS)\n      connect(primeSieveProcess_, SIGNAL(readyReadStandardOutput()),\n          this, SLOT(printProcessOutput()));\n    connect(primeSieveProcess_, SIGNAL(finished(int, QProcess::ExitStatus)),\n        this, SLOT(processFinished(int, QProcess::ExitStatus)));\n    primeSieveProcess_->start(lowerBound, upperBound, this->getSieveSize(),\n        flags_, this->getThreads());\n\n  } catch (std::invalid_argument& ex) {\n    this->cleanUp();\n    QMessageBox::warning(this, APPLICATION_NAME, ex.what());\n  } catch (std::exception& ex) {\n    this->cleanUp();\n    QMessageBox::critical(this, APPLICATION_NAME, ex.what());\n  }\n}\n\nvoid PrimeSieveGUI::advanceProgressBar() {\n  int permil = static_cast<int>(primeSieveProcess_->getStatus() * 10.0);\n  ui->progressBar->setValue(permil);\n}\n\n\/**\n * Redirects the standard output (prime numbers or prime k-tuplets) of\n * the primeSieveProcess_ to the TextEdit.\n *\/\nvoid PrimeSieveGUI::printProcessOutput() {\n  QByteArray buffer;\n  buffer.reserve(PRINT_BUFFER_SIZE + 256);\n  while (ui->cancelButton->isEnabled() && primeSieveProcess_->canReadLine()) {\n    buffer.clear();\n    while (primeSieveProcess_->canReadLine() && buffer.size() < PRINT_BUFFER_SIZE)\n      buffer.append(primeSieveProcess_->readLine(256));\n    \/\/ remove \"\\r\\n\" or '\\n', '\\r' at the back\n    while (buffer.endsWith('\\n') ||\n           buffer.endsWith('\\r'))\n      buffer.chop(1);\n    if (!buffer.isEmpty())\n      ui->textEdit->appendPlainText(buffer);\n\/\/\/ Keep the GUI responsive.\n\/\/\/ @warning QApplication::processEvents() must not be used on\n\/\/\/          operating systems that use signal recursion (like Linux\n\/\/\/          X11) otherwise the stack will explode!\n#if defined(Q_OS_WIN) || defined(Q_OS_MAC)\n    QApplication::processEvents();\n#else\n    ui->textEdit->repaint();\n#endif\n  }\n}\n\n\/**\n * Is executed when the primeSieveProcess_ finishes, checks for\n * process errors and calls this->printResults().\n *\/\nvoid PrimeSieveGUI::processFinished(int exitCode,\n    QProcess::ExitStatus exitStatus) {\n  \/\/ the process did not exit normally, i.e. threw and exception\n  if (exitCode != 0) {\n    \/\/ Qt uses '\/' internally, even for Windows\n    QString path = QCoreApplication::applicationDirPath() + \"\/\" + APPLICATION_NAME + \"_error.txt\";\n    QFile error_log(path);\n    if (error_log.open(QIODevice::WriteOnly | QIODevice::Append | QIODevice::Text)) {\n      QTextStream out(&error_log);\n      out << primeSieveProcess_->readAllStandardError();\n      error_log.close();\n    }\n    this->cleanUp();\n    QMessageBox::critical(this, APPLICATION_NAME,\n        \"The PrimeSieveProcess reported an error (see primesieve_error.txt), sieving has been aborted.\");\n  }\n  \/\/ the PrimeSieveProcess has been interrupted by a signal (SIGTERM,\n  \/\/ SIGKILL, ...) or a segmentation fault\n  else if (exitStatus == QProcess::CrashExit) {\n    this->cleanUp();\n    QMessageBox::critical(this, APPLICATION_NAME, \"The PrimeSieveProcess crashed, sieving has been aborted.\");\n  }\n  \/\/ the PrimeSieveProcess has finished correctly\n  else {\n    ui->progressBar->setValue(ui->progressBar->maximum());\n    \/\/ print results if not canceled lately\n    if (ui->cancelButton->isEnabled())\n      this->printResults();\n    this->cleanUp();\n  }\n}\n\n\/**\n * Print the sieving results.\n *\/\nvoid PrimeSieveGUI::printResults() {\n  if (!ui->textEdit->toPlainText().isEmpty())\n    ui->textEdit->appendPlainText(\"\");\n\n  \/\/ hack to get the count results aligned using tabs\n  QString maxSizeText;\n  for (int i = 0; i < 7; i++) {\n    if ((flags_ & (COUNT_PRIMES << i)) && maxSizeText.size() < primeText_[i].size())\n      maxSizeText = primeText_[i];\n  }\n  ui->textEdit->insertPlainText(maxSizeText + \": \");\n  int maxWidth = ui->textEdit->cursorRect().left();\n  ui->textEdit->moveCursor(QTextCursor::StartOfLine, QTextCursor::KeepAnchor);\n  ui->textEdit->textCursor().removeSelectedText();\n  ui->textEdit->setTabStopWidth(maxWidth);\n\n  \/\/ print prime counts & time elapsed\n  for (int i = 0; i < 7; i++) {\n    if (flags_ & (COUNT_PRIMES << i))\n      ui->textEdit->appendPlainText(primeText_[i] + \":\\t\" + QString::number(primeSieveProcess_->getCounts(i)));\n  }\n  if (flags_ & COUNT_KTUPLETS)\n    ui->textEdit->appendPlainText(\"\");\n  QString time(\"Elapsed time:\\t\" + QString::number(primeSieveProcess_->getSeconds(), 'f', 2) + \" sec\");\n  ui->textEdit->appendPlainText(time);\n}\n\n\/**\n * Cancel sieving.\n *\/\nvoid PrimeSieveGUI::on_cancelButton_clicked() {\n  ui->cancelButton->setDisabled(true);\n  ui->progressBar->setValue(0);\n  \/\/ too late to abort\n  if ((flags_ & PRINT_FLAGS) && primeSieveProcess_->isFinished())\n    return;\n  this->cleanUp();\n}\n\n\/**\n * Clean up after sieving is finished or canceled (abort the\n * PrimeSieveProcess if still running).\n *\/\nvoid PrimeSieveGUI::cleanUp() {\n  progressBarTimer_.stop();\n  if (primeSieveProcess_ != 0)\n    delete primeSieveProcess_;\n  primeSieveProcess_ = 0;\n  \/\/ invert buttons\n  ui->cancelButton->setDisabled(true);\n  ui->sieveButton->setEnabled(true);\n  \/\/ force repainting widgets\n  this->repaint();\n}\n<commit_msg>use 3.6 error message<commit_after>\/*\n * PrimeSieveGUI.cpp -- This file is part of primesieve\n *\n * Copyright (C) 2012 Kim Walisch, <kim.walisch@gmail.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, 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 \"PrimeSieveGUI.h\"\n#include \"ui_PrimeSieveGUI.h\"\n#include \"PrimeSieveProcess.h\"\n#include \"..\/soe\/ParallelPrimeSieve.h\"\n#include \"..\/expr\/ExpressionParser.h\"\n\n#include <QtGlobal>\n#include <QCoreApplication>\n#include <QByteArray>\n#include <QTextStream>\n#include <QFile>\n#include <QSize>\n#include <QMessageBox>\n#include <QTextCursor>\n#include <stdexcept>\n\nPrimeSieveGUI::PrimeSieveGUI(QWidget *parent) :\n  QMainWindow(parent), ui(new Ui::PrimeSieveGUI), validator_(0),\n  primeSieveProcess_(0), saveAct_(0), quitAct_(0), aboutAct_(0),\n  alignmentGroup_(0) {\n  ui->setupUi(this);\n  primeText_.push_back(\"Prime numbers\");\n  primeText_.push_back(\"Twin primes\");\n  primeText_.push_back(\"Prime triplets\");\n  primeText_.push_back(\"Prime quadruplets\");\n  primeText_.push_back(\"Prime quintuplets\");\n  primeText_.push_back(\"Prime sextuplets\");\n  primeText_.push_back(\"Prime septuplets\");\n  this->initGUI();\n  this->initConnections();\n}\n\nPrimeSieveGUI::~PrimeSieveGUI() {\n  this->cleanUp();\n  delete validator_;\n  delete saveAct_;\n  delete quitAct_;\n  delete aboutAct_;\n  delete alignmentGroup_;\n  for (; !countAct_.isEmpty(); countAct_.pop_back())\n    delete countAct_.back();\n  for (; !printAct_.isEmpty(); printAct_.pop_back())\n    delete printAct_.back();\n  \/\/ Qt code\n  delete ui;\n}\n\nvoid PrimeSieveGUI::changeEvent(QEvent *e) {\n  QMainWindow::changeEvent(e);\n  switch (e->type()) {\n  case QEvent::LanguageChange:\n    ui->retranslateUi(this);\n    break;\n  default:\n    break;\n  }\n}\n\nvoid PrimeSieveGUI::initGUI() {\n  this->setWindowTitle(APPLICATION_NAME + \" \" + APPLICATION_VERSION);\n  this->createMenu(primeText_);\n\n  \/\/ fill the sieveSizeComboBox with power of 2 values <= \"4096 KB\"\n  for (int i = MINIMUM_SIEVE_SIZE; i <= MAXIMUM_SIEVE_SIZE; i *= 2)\n    ui->sieveSizeComboBox->addItem(QString::number(i) + \" KB\");\n  this->setTo(ui->sieveSizeComboBox, DEFAULT_SIEVE_SIZE);\n\n  \/\/ fill the threadsComboBox with power of 2 values <= maxThreads_\n  maxThreads_ = ParallelPrimeSieve::getMaxThreads();\n  for (int i = 1; i < maxThreads_; i *= 2)\n    ui->threadsComboBox->addItem(QString::number(i));\n  ui->threadsComboBox->addItem(QString::number(maxThreads_));\n  this->setTo(ui->threadsComboBox, \"1\");\n\n  \/\/ set an ideal ComboBox width\n  int width = ui->sieveSizeComboBox->minimumSizeHint().width();\n  ui->sieveSizeComboBox->setFixedWidth(width);\n  ui->threadsComboBox->setFixedWidth(width);\n\n  \/\/ set a nice GUI size\n  QSize size = this->sizeHint();\n  size.setWidth(this->minimumSizeHint().width());\n#if defined(Q_OS_WIN)\n  size.setHeight(size.height() - size.height() \/ 10);\n#endif\n  this->resize(size);\n\n  \/\/ limit input for arithmetic expressions\n  QRegExp rx(\"[0-9\\\\+\\\\-\\\\*\\\\\/\\\\%\\\\^\\\\(\\\\)\\\\e\\\\E]*\");\n  validator_ = new QRegExpValidator(rx, this);\n  ui->lowerBoundLineEdit->setValidator(validator_);\n  ui->upperBoundLineEdit->setValidator(validator_);\n}\n\nvoid PrimeSieveGUI::initConnections() {\n  connect(&progressBarTimer_,     SIGNAL(timeout()),                    this, SLOT(advanceProgressBar()));\n  connect(ui->lowerBoundLineEdit, SIGNAL(textChanged(const QString &)), this, SLOT(autoSetThreads()));\n  connect(ui->upperBoundLineEdit, SIGNAL(textChanged(const QString &)), this, SLOT(autoSetThreads()));\n  connect(ui->autoSetCheckBox,    SIGNAL(toggled(bool)),                this, SLOT(autoSetThreads()));\n  connect(saveAct_,               SIGNAL(triggered()),                  this, SLOT(saveToFile()));\n  connect(quitAct_,               SIGNAL(triggered()),                  qApp, SLOT(closeAllWindows()));\n  connect(alignmentGroup_,        SIGNAL(triggered(QAction*)),          this, SLOT(printMenuClicked(QAction*)));\n  connect(aboutAct_,              SIGNAL(triggered()),                  this, SLOT(showAboutDialog()));\n}\n\n\/**\n * Get the sieve size in kilobytes from the sieveSizeComboBox.\n * @post sieveSize >= 1 && sieveSize <= 4096.\n *\/\nint PrimeSieveGUI::getSieveSize() {\n  QString sieveSize(ui->sieveSizeComboBox->currentText());\n  \/\/ remove \" KB\"\n  sieveSize.chop(3);\n  return sieveSize.toInt();\n}\n\n\/**\n * Get the number of threads from the threadsComboBox.\n *\/\nint PrimeSieveGUI::getThreads() {\n  return ui->threadsComboBox->currentText().toInt();\n}\n\nquint64 PrimeSieveGUI::getNumber(const QString& str) {\n  if (str.isEmpty())\n    throw std::invalid_argument(\"Please enter a lower and upper bound for prime sieving.\");\n\n  ExpressionParser<quint64> parser;\n  quint64 result = 0;\n  try {\n    result = parser.eval(str.toAscii().data());\n  }\n  catch (parser_error& e) {\n    throw std::invalid_argument(e.what());\n  }\n\n  int digits = str.count(QRegExp(\"[0-9]\"));\n  if (result >= UPPER_BOUND_LIMIT || (\n      digits == str.size() && (\n      digits >  UPPER_BOUND_STR.size() || (\n      digits == UPPER_BOUND_STR.size() &&\n      str    >= UPPER_BOUND_STR))))\n    throw std::invalid_argument(\"Please use positive integers < 2^64 - 2^32*10.\");\n\n  return result;\n}\n\nvoid PrimeSieveGUI::setTo(QComboBox* comboBox, const QString& text) {\n  comboBox->setCurrentIndex(comboBox->findText(text));\n}\n\n\/**\n * If \"Auto set\" is enabled set an ideal number of threads for the\n * current lower bound, upper bound in the threadsComboBox.\n *\/\nvoid PrimeSieveGUI::autoSetThreads() {\n  if (ui->autoSetCheckBox->isEnabled() && ui->autoSetCheckBox->isChecked()) {\n    try {\n      quint64 lowerBound = this->getNumber(ui->lowerBoundLineEdit->text());\n      quint64 upperBound = this->getNumber(ui->upperBoundLineEdit->text());\n      ParallelPrimeSieve pps;\n      pps.setStart(lowerBound);\n      pps.setStop(upperBound);\n      int idealNumThreads = pps.getNumThreads();\n      if (idealNumThreads < maxThreads_) {\n        \/\/ floor to the next power of 2 value\n        int p = 1;\n        for (; p <= idealNumThreads; p *= 2)\n          ;\n        idealNumThreads = p \/ 2;\n      }\n      this->setTo(ui->threadsComboBox, QString::number(idealNumThreads));\n    } catch (...) {\n      this->setTo(ui->threadsComboBox, \"1\");\n    }\n  }\n}\n\n\/**\n * The user has chosen a custom number of threads, disable \"Auto set\".\n *\/\nvoid PrimeSieveGUI::on_threadsComboBox_activated() {\n  ui->autoSetCheckBox->setChecked(false);\n}\n\n\/**\n * Start sieving primes.\n *\/\nvoid PrimeSieveGUI::on_sieveButton_clicked() {\n  \/\/ invert buttons, reset upon cleanUp()\n  ui->sieveButton->setDisabled(true);\n  ui->cancelButton->setEnabled(true);\n  try {\n    flags_ = this->getMenuSettings() | CALCULATE_STATUS;\n    if ((flags_ & (COUNT_FLAGS | PRINT_FLAGS)) == 0)\n      throw std::invalid_argument(\"Nothing to do, no count or print options selected.\");\n\n    quint64 lowerBound = this->getNumber(ui->lowerBoundLineEdit->text());\n    quint64 upperBound = this->getNumber(ui->upperBoundLineEdit->text());\n    if (lowerBound > upperBound)\n      throw std::invalid_argument(\"The lower bound must not be greater than the upper bound.\");\n\n    \/\/ reset the GUI widgets\n    ui->progressBar->setValue(ui->progressBar->minimum());\n    ui->textEdit->clear();\n    progressBarTimer_.start(25);\n\n    \/\/ start a new process for sieving (avoids cancel\n    \/\/ trouble with multiple threads)\n    primeSieveProcess_ = new PrimeSieveProcess(this);\n    if (flags_ & PRINT_FLAGS)\n      connect(primeSieveProcess_, SIGNAL(readyReadStandardOutput()),\n          this, SLOT(printProcessOutput()));\n    connect(primeSieveProcess_, SIGNAL(finished(int, QProcess::ExitStatus)),\n        this, SLOT(processFinished(int, QProcess::ExitStatus)));\n    primeSieveProcess_->start(lowerBound, upperBound, this->getSieveSize(),\n        flags_, this->getThreads());\n\n  } catch (std::invalid_argument& ex) {\n    this->cleanUp();\n    QMessageBox::warning(this, APPLICATION_NAME, ex.what());\n  } catch (std::exception& ex) {\n    this->cleanUp();\n    QMessageBox::critical(this, APPLICATION_NAME, ex.what());\n  }\n}\n\nvoid PrimeSieveGUI::advanceProgressBar() {\n  int permil = static_cast<int>(primeSieveProcess_->getStatus() * 10.0);\n  ui->progressBar->setValue(permil);\n}\n\n\/**\n * Redirects the standard output (prime numbers or prime k-tuplets) of\n * the primeSieveProcess_ to the TextEdit.\n *\/\nvoid PrimeSieveGUI::printProcessOutput() {\n  QByteArray buffer;\n  buffer.reserve(PRINT_BUFFER_SIZE + 256);\n  while (ui->cancelButton->isEnabled() && primeSieveProcess_->canReadLine()) {\n    buffer.clear();\n    while (primeSieveProcess_->canReadLine() && buffer.size() < PRINT_BUFFER_SIZE)\n      buffer.append(primeSieveProcess_->readLine(256));\n    \/\/ remove \"\\r\\n\" or '\\n', '\\r' at the back\n    while (buffer.endsWith('\\n') ||\n           buffer.endsWith('\\r'))\n      buffer.chop(1);\n    if (!buffer.isEmpty())\n      ui->textEdit->appendPlainText(buffer);\n\/\/\/ Keep the GUI responsive.\n\/\/\/ @warning QApplication::processEvents() must not be used on\n\/\/\/          operating systems that use signal recursion (like Linux\n\/\/\/          X11) otherwise the stack will explode!\n#if defined(Q_OS_WIN) || defined(Q_OS_MAC)\n    QApplication::processEvents();\n#else\n    ui->textEdit->repaint();\n#endif\n  }\n}\n\n\/**\n * Is executed when the primeSieveProcess_ finishes, checks for\n * process errors and calls this->printResults().\n *\/\nvoid PrimeSieveGUI::processFinished(int exitCode,\n    QProcess::ExitStatus exitStatus) {\n  \/\/ the process did not exit normally, i.e. threw and exception\n  if (exitCode != 0) {\n    \/\/ Qt uses '\/' internally, even for Windows\n    QString path = QCoreApplication::applicationDirPath() + \"\/\" + APPLICATION_NAME + \"_error.txt\";\n    QFile error_log(path);\n    if (error_log.open(QIODevice::WriteOnly | QIODevice::Append | QIODevice::Text)) {\n      QTextStream out(&error_log);\n      out << primeSieveProcess_->readAllStandardError();\n      error_log.close();\n    }\n    this->cleanUp();\n    QMessageBox::critical(this, APPLICATION_NAME,\n        \"The PrimeSieveProcess reported an error (see primesieve_error.txt), sieving has been aborted.\");\n  }\n  \/\/ the PrimeSieveProcess has been interrupted by a signal (SIGTERM,\n  \/\/ SIGKILL, ...) or a segmentation fault\n  else if (exitStatus == QProcess::CrashExit) {\n    this->cleanUp();\n    QMessageBox::critical(this, APPLICATION_NAME, \"The PrimeSieveProcess crashed, sieving has been aborted.\");\n  }\n  \/\/ the PrimeSieveProcess has finished correctly\n  else {\n    ui->progressBar->setValue(ui->progressBar->maximum());\n    \/\/ print results if not canceled lately\n    if (ui->cancelButton->isEnabled())\n      this->printResults();\n    this->cleanUp();\n  }\n}\n\n\/**\n * Print the sieving results.\n *\/\nvoid PrimeSieveGUI::printResults() {\n  if (!ui->textEdit->toPlainText().isEmpty())\n    ui->textEdit->appendPlainText(\"\");\n\n  \/\/ hack to get the count results aligned using tabs\n  QString maxSizeText;\n  for (int i = 0; i < 7; i++) {\n    if ((flags_ & (COUNT_PRIMES << i)) && maxSizeText.size() < primeText_[i].size())\n      maxSizeText = primeText_[i];\n  }\n  ui->textEdit->insertPlainText(maxSizeText + \": \");\n  int maxWidth = ui->textEdit->cursorRect().left();\n  ui->textEdit->moveCursor(QTextCursor::StartOfLine, QTextCursor::KeepAnchor);\n  ui->textEdit->textCursor().removeSelectedText();\n  ui->textEdit->setTabStopWidth(maxWidth);\n\n  \/\/ print prime counts & time elapsed\n  for (int i = 0; i < 7; i++) {\n    if (flags_ & (COUNT_PRIMES << i))\n      ui->textEdit->appendPlainText(primeText_[i] + \":\\t\" + QString::number(primeSieveProcess_->getCounts(i)));\n  }\n  if (flags_ & COUNT_KTUPLETS)\n    ui->textEdit->appendPlainText(\"\");\n  QString time(\"Elapsed time:\\t\" + QString::number(primeSieveProcess_->getSeconds(), 'f', 2) + \" sec\");\n  ui->textEdit->appendPlainText(time);\n}\n\n\/**\n * Cancel sieving.\n *\/\nvoid PrimeSieveGUI::on_cancelButton_clicked() {\n  ui->cancelButton->setDisabled(true);\n  ui->progressBar->setValue(0);\n  \/\/ too late to abort\n  if ((flags_ & PRINT_FLAGS) && primeSieveProcess_->isFinished())\n    return;\n  this->cleanUp();\n}\n\n\/**\n * Clean up after sieving is finished or canceled (abort the\n * PrimeSieveProcess if still running).\n *\/\nvoid PrimeSieveGUI::cleanUp() {\n  progressBarTimer_.stop();\n  if (primeSieveProcess_ != 0)\n    delete primeSieveProcess_;\n  primeSieveProcess_ = 0;\n  \/\/ invert buttons\n  ui->cancelButton->setDisabled(true);\n  ui->sieveButton->setEnabled(true);\n  \/\/ force repainting widgets\n  this->repaint();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"runtime_internal.h\"\n#include \"device_interface.h\"\n#include \"HalideRuntime.h\"\n#include \"scoped_mutex_lock.h\"\n\nextern \"C\" {\n\nextern void *malloc(size_t);\nextern void free(void *);\n\n}\n\nnamespace Halide { namespace Runtime { namespace Internal {\n\nstruct device_handle_wrapper {\n    uint64_t device_handle;\n    const halide_device_interface *interface;\n};\n\n\/\/ TODO: Coarser grained locking, also consider all things that need\n\/\/ to be atomic with respect to each other. At present only\n\/\/ halide_copy_to_host and halide_copy_to_device are atomic with\n\/\/ respect to each other. halide_device_malloc and halide_device_free\n\/\/ are also candidates, but to do so they likely need to be able to do\n\/\/ a copy internaly as well.\nWEAK halide_mutex device_copy_mutex;\n\nWEAK int copy_to_host_already_locked(void *user_context, struct buffer_t *buf) {\n    int result = 0;\n\n    if (buf->dev_dirty) {\n        debug(user_context) << \"copy_to_host_already_locked \" << buf << \" dev_dirty is true\\n\";\n        const halide_device_interface *interface = halide_get_device_interface(buf->dev);\n        if (buf->host_dirty) {\n            debug(user_context) << \"copy_to_host_already_locked \" << buf << \" dev_dirty and host_dirty are true\\n\";\n            result = halide_error_code_copy_to_host_failed;\n        } else if (interface == NULL) {\n            debug(user_context) << \"copy_to_host_already_locked \" << buf << \" interface is NULL\\n\";\n            result = halide_error_code_no_device_interface;\n        } else {\n            result = interface->copy_to_host(user_context, buf);\n            if (result == 0) {\n                buf->dev_dirty = false;\n            } else {\n                debug(user_context) << \"copy_to_host_already_locked \" << buf << \" device copy_to_host returned an error\\n\";\n                result = halide_error_code_copy_to_host_failed;\n            }\n        }\n    }\n\n    return result;\n}\n\n}}} \/\/ namespace Halide::Runtime::Internal\n\nextern \"C\" {\n\nWEAK uint64_t halide_new_device_wrapper(uint64_t handle, const struct halide_device_interface *interface) {\n    \/\/ Using malloc instead of halide_malloc avoids alignment overhead.\n    device_handle_wrapper *wrapper = (device_handle_wrapper *)malloc(sizeof(device_handle_wrapper));\n    if (wrapper == NULL) {\n        return 0;\n    }\n    wrapper->device_handle = handle;\n    wrapper->interface = interface;\n\n    interface->use_module();\n\n    debug(NULL) << \"Creating device wrapper for interface \" << interface << \" handle \" << (void *)handle << \" wrapper \" << wrapper << \"\\n\";\n    return (uint64_t)wrapper;\n}\n\nWEAK void halide_delete_device_wrapper(uint64_t wrapper) {\n    device_handle_wrapper *wrapper_ptr = (device_handle_wrapper *)wrapper;\n    wrapper_ptr->interface->release_module();\n    debug(NULL) << \"Deleting device wrapper for interface \" << wrapper_ptr->interface << \" device_handle \" << (void *)wrapper_ptr->device_handle << \" at addr \" << wrapper_ptr << \"\\n\";\n    free(wrapper_ptr);\n}\n\nWEAK uint64_t halide_get_device_handle(uint64_t dev_field) {\n    const device_handle_wrapper *wrapper = (const device_handle_wrapper *)dev_field;\n    if (wrapper == NULL) {\n        debug(NULL) << \"Getting device handle for NULL wrapper\\n\";\n        return 0;\n    }\n    debug(NULL) << \"Getting device handle for interface \" << wrapper->interface\n                << \" device_handle \" << (void *)wrapper->device_handle\n                << \" at addr \" << wrapper << \"\\n\";\n    return wrapper->device_handle;\n}\n\nWEAK const halide_device_interface *halide_get_device_interface(uint64_t dev_field) {\n    if (dev_field == 0) {\n        return NULL;\n    }\n    return ((device_handle_wrapper *)dev_field)->interface;\n}\n\n\/** Release all data associated with the current GPU backend, in particular\n * all resources (memory, texture, context handles) allocated by Halide. Must\n * be called explicitly when using AOT compilation. *\/\nWEAK void halide_device_release(void *user_context, const halide_device_interface *interface) {\n    interface->device_release(user_context);\n}\n\n\/** Copy image data from device memory to host memory. This must be called\n * explicitly to copy back the results of a GPU-based filter. *\/\nWEAK int halide_copy_to_host(void *user_context, struct buffer_t *buf) {\n    ScopedMutexLock lock(&device_copy_mutex);\n\n    debug(NULL) << \"halide_copy_to_host \" << buf << \"\\n\";\n\n    return copy_to_host_already_locked(user_context, buf);\n}\n\n\/** Copy image data from host memory to device memory. This should not be\n * called directly; Halide handles copying to the device automatically. *\/\nWEAK int halide_copy_to_device(void *user_context, struct buffer_t *buf, const halide_device_interface *interface) {\n    int result = 0;\n\n    ScopedMutexLock lock(&device_copy_mutex);\n\n    debug(user_context) << \"halide_copy_to_device \" << buf << \", host: \" << buf->host << \", dev: \" << buf->dev << \", host_dirty: \" << buf->host_dirty << \", dev_dirty:\" << buf->dev_dirty << \"\\n\";\n    const halide_device_interface *buf_dev_interface = halide_get_device_interface(buf->dev);\n    if (interface == NULL) {\n        debug(user_context) << \"halide_copy_to_device \" << buf << \" interface is NULL\\n\";\n        if (buf_dev_interface == NULL) {\n            debug(user_context) << \"halide_copy_to_device \" << buf << \" no interface error\\n\";\n            return halide_error_code_no_device_interface;\n        }\n        interface = buf_dev_interface;\n    }\n\n    if (buf->dev && buf_dev_interface != interface) {\n        debug(user_context) << \"halide_copy_to_device \" << buf << \" flipping buffer to new device\\n\";\n        if (buf_dev_interface != NULL && buf->dev_dirty) {\n            halide_assert(user_context, !buf->host_dirty);\n            result = copy_to_host_already_locked(user_context, buf);\n            if (result != 0) {\n                debug(user_context) << \"halide_copy_to_device \" << buf << \" flipping buffer halide_copy_to_host failed\\n\";\n                return result;\n            }\n        }\n        result = halide_device_free(user_context, buf);\n        if (result != 0) {\n            debug(user_context) << \"halide_copy_to_device \" << buf << \" flipping buffer halide_device_free failed\\n\";\n            return result;\n        }\n        buf->host_dirty = true; \/\/ force copy back to new device below.\n    }\n\n    if (buf->dev == 0) {\n        result = halide_device_malloc(user_context, buf, interface);\n        if (result != 0) {\n            debug(user_context) << \"halide_copy_to_device \" << buf\n                                << \" halide_copy_to_device call to halide_device_malloc failed\\n\";\n            return result;\n        }\n    }\n\n    if (buf->host_dirty) {\n        debug(user_context) << \"halide_copy_to_device \" << buf << \" host is dirty\\n\";\n        if (buf->dev_dirty) {\n            debug(user_context) << \"halide_copy_to_device \" << buf << \" dev_dirty is true error\\n\";\n            result = halide_error_code_copy_to_device_failed;\n        } else {\n            result = interface->copy_to_device(user_context, buf);\n            if (result == 0) {\n                buf->host_dirty = 0;\n            } else {\n                debug(user_context) << \"halide_copy_to_device \"\n                                    << buf << \"device copy_to_device returned an error\\n\";\n                return halide_error_code_copy_to_device_failed;\n            }\n        }\n    }\n\n    return 0;\n}\n\n\/** Wait for current GPU operations to complete. Calling this explicitly\n * should rarely be necessary, except maybe for profiling. *\/\nWEAK int halide_device_sync(void *user_context, struct buffer_t *buf) {\n    const halide_device_interface *interface = NULL;\n    if (buf) {\n        interface = halide_get_device_interface(buf->dev);\n    }\n    if (interface == NULL) {\n        return halide_error_code_no_device_interface;\n    }\n    int result = interface->device_sync(user_context, buf);\n    if (result) {\n        return halide_error_code_device_sync_failed;\n    } else {\n        return 0;\n    }\n}\n\n\/** Allocate device memory to back a buffer_t. *\/\nWEAK int halide_device_malloc(void *user_context, struct buffer_t *buf, const halide_device_interface *interface) {\n    const halide_device_interface *current_interface = halide_get_device_interface(buf->dev);\n    debug(user_context) << \"halide_device_malloc: \" << buf\n                        << \" interface \" << interface\n                        << \" host: \" << buf->host\n                        << \", dev: \" << buf->dev\n                        << \", host_dirty: \" << buf->host_dirty\n                        << \", dev_dirty:\" << buf->dev_dirty\n                        << \" buf current interface: \" << current_interface << \"\\n\";\n\n    \/\/ halide_device_malloc does not support switching interfaces.\n    if (current_interface != NULL && current_interface != interface) {\n        return halide_error_code_device_malloc_failed;\n    }\n\n    \/\/ Ensure code is not freed prematurely.\n    \/\/ TODO: Exception safety...\n    interface->use_module();\n    int result = interface->device_malloc(user_context, buf);\n    interface->release_module();\n\n    if (result) {\n        return halide_error_code_device_malloc_failed;\n    } else {\n        return 0;\n    }\n}\n\n\/** Free any device memory associated with a buffer_t. *\/\nWEAK int halide_device_free(void *user_context, struct buffer_t *buf) {\n    uint64_t dev_field = 0;\n    if (buf) {\n        dev_field = buf->dev;\n    }\n    debug(user_context) << \"halide_device_free: \" << buf\n                        << \" buf dev \" << buf->dev\n                        << \" interface \" << halide_get_device_interface(dev_field) << \"\\n\";\n    if (buf != NULL) {\n        const halide_device_interface *interface = halide_get_device_interface(dev_field);\n        if (interface != NULL) {\n            \/\/ Ensure interface is not freed prematurely.\n            \/\/ TODO: Exception safety...\n            interface->use_module();\n            int result = interface->device_free(user_context, buf);\n            interface->release_module();\n            halide_assert(user_context, buf->dev == 0);\n            if (result) {\n                return halide_error_code_device_free_failed;\n            } else {\n                return 0;\n            }\n        }\n    }\n    buf->dev_dirty = false;\n    return 0;\n}\n\n\/** Free any device memory associated with a buffer_t and ignore any\n * error. Used when freeing as a destructor. *\/\nWEAK void halide_device_free_as_destructor(void *user_context, void *obj) {\n    struct buffer_t *buf = (struct buffer_t *)obj;\n    halide_device_free(user_context, buf);\n}\n\n} \/\/ extern \"C\" linkage\n<commit_msg>Add some more debug statements in device_interface<commit_after>#include \"runtime_internal.h\"\n#include \"device_interface.h\"\n#include \"HalideRuntime.h\"\n#include \"scoped_mutex_lock.h\"\n\nextern \"C\" {\n\nextern void *malloc(size_t);\nextern void free(void *);\n\n}\n\nnamespace Halide { namespace Runtime { namespace Internal {\n\nstruct device_handle_wrapper {\n    uint64_t device_handle;\n    const halide_device_interface *interface;\n};\n\n\/\/ TODO: Coarser grained locking, also consider all things that need\n\/\/ to be atomic with respect to each other. At present only\n\/\/ halide_copy_to_host and halide_copy_to_device are atomic with\n\/\/ respect to each other. halide_device_malloc and halide_device_free\n\/\/ are also candidates, but to do so they likely need to be able to do\n\/\/ a copy internaly as well.\nWEAK halide_mutex device_copy_mutex;\n\nWEAK int copy_to_host_already_locked(void *user_context, struct buffer_t *buf) {\n    int result = 0;\n\n    if (buf->dev_dirty) {\n        debug(user_context) << \"copy_to_host_already_locked \" << buf << \" dev_dirty is true\\n\";\n        const halide_device_interface *interface = halide_get_device_interface(buf->dev);\n        if (buf->host_dirty) {\n            debug(user_context) << \"copy_to_host_already_locked \" << buf << \" dev_dirty and host_dirty are true\\n\";\n            result = halide_error_code_copy_to_host_failed;\n        } else if (interface == NULL) {\n            debug(user_context) << \"copy_to_host_already_locked \" << buf << \" interface is NULL\\n\";\n            result = halide_error_code_no_device_interface;\n        } else {\n            result = interface->copy_to_host(user_context, buf);\n            if (result == 0) {\n                buf->dev_dirty = false;\n            } else {\n                debug(user_context) << \"copy_to_host_already_locked \" << buf << \" device copy_to_host returned an error\\n\";\n                result = halide_error_code_copy_to_host_failed;\n            }\n        }\n    }\n\n    return result;\n}\n\n}}} \/\/ namespace Halide::Runtime::Internal\n\nextern \"C\" {\n\nWEAK uint64_t halide_new_device_wrapper(uint64_t handle, const struct halide_device_interface *interface) {\n    \/\/ Using malloc instead of halide_malloc avoids alignment overhead.\n    device_handle_wrapper *wrapper = (device_handle_wrapper *)malloc(sizeof(device_handle_wrapper));\n    if (wrapper == NULL) {\n        return 0;\n    }\n    wrapper->device_handle = handle;\n    wrapper->interface = interface;\n\n    interface->use_module();\n\n    debug(NULL) << \"Creating device wrapper for interface \" << interface << \" handle \" << (void *)handle << \" wrapper \" << wrapper << \"\\n\";\n    return (uint64_t)wrapper;\n}\n\nWEAK void halide_delete_device_wrapper(uint64_t wrapper) {\n    device_handle_wrapper *wrapper_ptr = (device_handle_wrapper *)wrapper;\n    wrapper_ptr->interface->release_module();\n    debug(NULL) << \"Deleting device wrapper for interface \" << wrapper_ptr->interface << \" device_handle \" << (void *)wrapper_ptr->device_handle << \" at addr \" << wrapper_ptr << \"\\n\";\n    free(wrapper_ptr);\n}\n\nWEAK uint64_t halide_get_device_handle(uint64_t dev_field) {\n    const device_handle_wrapper *wrapper = (const device_handle_wrapper *)dev_field;\n    if (wrapper == NULL) {\n        debug(NULL) << \"Getting device handle for NULL wrapper\\n\";\n        return 0;\n    }\n    debug(NULL) << \"Getting device handle for interface \" << wrapper->interface\n                << \" device_handle \" << (void *)wrapper->device_handle\n                << \" at addr \" << wrapper << \"\\n\";\n    return wrapper->device_handle;\n}\n\nWEAK const halide_device_interface *halide_get_device_interface(uint64_t dev_field) {\n    if (dev_field == 0) {\n        return NULL;\n    }\n    return ((device_handle_wrapper *)dev_field)->interface;\n}\n\n\/** Release all data associated with the current GPU backend, in particular\n * all resources (memory, texture, context handles) allocated by Halide. Must\n * be called explicitly when using AOT compilation. *\/\nWEAK void halide_device_release(void *user_context, const halide_device_interface *interface) {\n    interface->device_release(user_context);\n}\n\n\/** Copy image data from device memory to host memory. This must be called\n * explicitly to copy back the results of a GPU-based filter. *\/\nWEAK int halide_copy_to_host(void *user_context, struct buffer_t *buf) {\n    ScopedMutexLock lock(&device_copy_mutex);\n\n    debug(NULL) << \"halide_copy_to_host \" << buf << \"\\n\";\n\n    return copy_to_host_already_locked(user_context, buf);\n}\n\n\/** Copy image data from host memory to device memory. This should not be\n * called directly; Halide handles copying to the device automatically. *\/\nWEAK int halide_copy_to_device(void *user_context, struct buffer_t *buf, const halide_device_interface *interface) {\n    int result = 0;\n\n    ScopedMutexLock lock(&device_copy_mutex);\n\n    debug(user_context) << \"halide_copy_to_device \" << buf << \", host: \" << buf->host << \", dev: \" << buf->dev << \", host_dirty: \" << buf->host_dirty << \", dev_dirty:\" << buf->dev_dirty << \"\\n\";\n    const halide_device_interface *buf_dev_interface = halide_get_device_interface(buf->dev);\n    if (interface == NULL) {\n        debug(user_context) << \"halide_copy_to_device \" << buf << \" interface is NULL\\n\";\n        if (buf_dev_interface == NULL) {\n            debug(user_context) << \"halide_copy_to_device \" << buf << \" no interface error\\n\";\n            return halide_error_code_no_device_interface;\n        }\n        interface = buf_dev_interface;\n    }\n\n    if (buf->dev && buf_dev_interface != interface) {\n        debug(user_context) << \"halide_copy_to_device \" << buf << \" flipping buffer to new device\\n\";\n        if (buf_dev_interface != NULL && buf->dev_dirty) {\n            halide_assert(user_context, !buf->host_dirty);\n            result = copy_to_host_already_locked(user_context, buf);\n            if (result != 0) {\n                debug(user_context) << \"halide_copy_to_device \" << buf << \" flipping buffer halide_copy_to_host failed\\n\";\n                return result;\n            }\n        }\n        result = halide_device_free(user_context, buf);\n        if (result != 0) {\n            debug(user_context) << \"halide_copy_to_device \" << buf << \" flipping buffer halide_device_free failed\\n\";\n            return result;\n        }\n        buf->host_dirty = true; \/\/ force copy back to new device below.\n    }\n\n    if (buf->dev == 0) {\n        result = halide_device_malloc(user_context, buf, interface);\n        if (result != 0) {\n            debug(user_context) << \"halide_copy_to_device \" << buf\n                                << \" halide_copy_to_device call to halide_device_malloc failed\\n\";\n            return result;\n        }\n    }\n\n    if (buf->host_dirty) {\n        debug(user_context) << \"halide_copy_to_device \" << buf << \" host is dirty\\n\";\n        if (buf->dev_dirty) {\n            debug(user_context) << \"halide_copy_to_device \" << buf << \" dev_dirty is true error\\n\";\n            result = halide_error_code_copy_to_device_failed;\n        } else {\n            result = interface->copy_to_device(user_context, buf);\n            if (result == 0) {\n                buf->host_dirty = 0;\n            } else {\n                debug(user_context) << \"halide_copy_to_device \"\n                                    << buf << \"device copy_to_device returned an error\\n\";\n                return halide_error_code_copy_to_device_failed;\n            }\n        }\n    }\n\n    return 0;\n}\n\n\/** Wait for current GPU operations to complete. Calling this explicitly\n * should rarely be necessary, except maybe for profiling. *\/\nWEAK int halide_device_sync(void *user_context, struct buffer_t *buf) {\n    const halide_device_interface *interface = NULL;\n    if (buf) {\n        interface = halide_get_device_interface(buf->dev);\n    }\n    if (interface == NULL) {\n        debug(user_context) << \"halide_device_sync on buffer with no interface\\n\";\n        return halide_error_code_no_device_interface;\n    }\n    int result = interface->device_sync(user_context, buf);\n    if (result) {\n        return halide_error_code_device_sync_failed;\n    } else {\n        return 0;\n    }\n}\n\n\/** Allocate device memory to back a buffer_t. *\/\nWEAK int halide_device_malloc(void *user_context, struct buffer_t *buf, const halide_device_interface *interface) {\n    const halide_device_interface *current_interface = halide_get_device_interface(buf->dev);\n    debug(user_context) << \"halide_device_malloc: \" << buf\n                        << \" interface \" << interface\n                        << \" host: \" << buf->host\n                        << \", dev: \" << buf->dev\n                        << \", host_dirty: \" << buf->host_dirty\n                        << \", dev_dirty:\" << buf->dev_dirty\n                        << \" buf current interface: \" << current_interface << \"\\n\";\n\n    \/\/ halide_device_malloc does not support switching interfaces.\n    if (current_interface != NULL && current_interface != interface) {\n        debug(user_context) << \"halide_malloc doesn't support switching interfaces\\n\";\n        return halide_error_code_device_malloc_failed;\n    }\n\n    \/\/ Ensure code is not freed prematurely.\n    \/\/ TODO: Exception safety...\n    interface->use_module();\n    int result = interface->device_malloc(user_context, buf);\n    interface->release_module();\n\n    if (result) {\n        return halide_error_code_device_malloc_failed;\n    } else {\n        return 0;\n    }\n}\n\n\/** Free any device memory associated with a buffer_t. *\/\nWEAK int halide_device_free(void *user_context, struct buffer_t *buf) {\n    uint64_t dev_field = 0;\n    if (buf) {\n        dev_field = buf->dev;\n    }\n    debug(user_context) << \"halide_device_free: \" << buf\n                        << \" buf dev \" << buf->dev\n                        << \" interface \" << halide_get_device_interface(dev_field) << \"\\n\";\n    if (buf != NULL) {\n        const halide_device_interface *interface = halide_get_device_interface(dev_field);\n        if (interface != NULL) {\n            \/\/ Ensure interface is not freed prematurely.\n            \/\/ TODO: Exception safety...\n            interface->use_module();\n            int result = interface->device_free(user_context, buf);\n            interface->release_module();\n            halide_assert(user_context, buf->dev == 0);\n            if (result) {\n                return halide_error_code_device_free_failed;\n            } else {\n                return 0;\n            }\n        }\n    }\n    buf->dev_dirty = false;\n    return 0;\n}\n\n\/** Free any device memory associated with a buffer_t and ignore any\n * error. Used when freeing as a destructor. *\/\nWEAK void halide_device_free_as_destructor(void *user_context, void *obj) {\n    struct buffer_t *buf = (struct buffer_t *)obj;\n    halide_device_free(user_context, buf);\n}\n\n} \/\/ extern \"C\" linkage\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,\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\/*!\n * \\file tvm\/runtime\/vm\/memory_manager.cc\n * \\brief Allocate and manage memory for the runtime.\n *\/\n#include <tvm\/runtime\/vm\/memory_manager.h>\n\n#include <memory>\n#include <utility>\n\n#include \"naive_allocator.h\"\n#include \"pooled_allocator.h\"\n\nnamespace tvm {\nnamespace runtime {\nnamespace vm {\n\nstatic void BufferDeleter(Object* obj) {\n  auto* ptr = static_cast<NDArray::Container*>(obj);\n  ICHECK(ptr->manager_ctx != nullptr);\n  Buffer* buffer = reinterpret_cast<Buffer*>(ptr->manager_ctx);\n  MemoryManager::GetAllocator(buffer->device)->Free(*(buffer));\n  delete buffer;\n  delete ptr;\n}\n\nvoid StorageObj::Deleter(Object* obj) {\n  auto* ptr = static_cast<NDArray::Container*>(obj);\n  \/\/ When invoking AllocNDArray we don't own the underlying allocation\n  \/\/ and should not delete the buffer, but instead let it be reclaimed\n  \/\/ by the storage object's destructor.\n  \/\/\n  \/\/ We did bump the reference count by 1 to keep alive the StorageObj\n  \/\/ allocation in case this NDArray is the sole owner.\n  \/\/\n  \/\/ We decrement the object allowing for the buffer to release our\n  \/\/ reference count from allocation.\n  StorageObj* storage = reinterpret_cast<StorageObj*>(ptr->manager_ctx);\n  storage->DecRef();\n  delete ptr;\n}\n\ninline void VerifyDataType(DLDataType dtype) {\n  ICHECK_GE(dtype.lanes, 1);\n  if (dtype.code == kDLFloat) {\n    ICHECK_EQ(dtype.bits % 8, 0);\n  } else {\n    \/\/ allow uint1 as a special flag for bool.\n    if (dtype.bits == 1 && dtype.code == kDLUInt) return;\n    ICHECK_EQ(dtype.bits % 8, 0);\n  }\n  ICHECK_EQ(dtype.bits & (dtype.bits - 1), 0);\n}\n\ninline size_t GetDataAlignment(const DLTensor& arr) {\n  size_t align = (arr.dtype.bits \/ 8) * arr.dtype.lanes;\n  if (align < kAllocAlignment) return kAllocAlignment;\n  return align;\n}\n\nNDArray StorageObj::AllocNDArray(size_t offset, std::vector<int64_t> shape, DLDataType dtype) {\n  VerifyDataType(dtype);\n\n  \/\/ crtical zone: allocate header, cannot throw\n  NDArray::Container* container =\n      new NDArray::Container(nullptr, shape, dtype, this->buffer.device);\n\n  container->SetDeleter(StorageObj::Deleter);\n  size_t needed_size = GetDataSize(container->dl_tensor);\n  this->IncRef();\n  \/\/ The manager context pointer must continue to point to the storage object\n  \/\/ which owns the backing memory, and keeps track of the reference count.\n  \/\/\n  \/\/ When we free a container we extract the storage object, decrement its\n  \/\/ reference count, then destroy the container, but leave the underlying\n  \/\/ buffer intact.\n  container->manager_ctx = reinterpret_cast<void*>(this);\n\n  \/\/ is this UB?\n  \/\/ The only change we make w.r.t offset is modifying the data pointer\n  \/\/ of the backing tensor to point into the buffer instead of its start.\n  auto offset_ptr = reinterpret_cast<uint8_t*>(this->buffer.data) + offset;\n  container->dl_tensor.data = reinterpret_cast<void*>(offset_ptr);\n\n  NDArray ret(GetObjectPtr<Object>(container));\n  \/\/ RAII in effect, now run the check.\n\n  ICHECK(offset + needed_size <= this->buffer.size)\n      << \"storage allocation failure, attempted to allocate \" << needed_size << \" at offset \"\n      << offset << \" in region that is \" << this->buffer.size << \"bytes\";\n\n  return ret;\n}\n\nMemoryManager* MemoryManager::Global() {\n  \/\/ NOTE: explicitly use new to avoid exit-time destruction of global state\n  \/\/ Global state will be recycled by OS as the process exits.\n  static auto* inst = new MemoryManager();\n  return inst;\n}\n\nAllocator* MemoryManager::GetOrCreateAllocator(Device dev, AllocatorType type) {\n  MemoryManager* m = MemoryManager::Global();\n  std::lock_guard<std::mutex> lock(m->mu_);\n  if (m->allocators_.find(dev) == m->allocators_.end()) {\n    std::unique_ptr<Allocator> alloc;\n    switch (type) {\n      case kNaive: {\n        DLOG(INFO) << \"New naive allocator for \" << DeviceName(dev.device_type) << \"(\"\n                   << dev.device_id << \")\";\n        alloc.reset(new NaiveAllocator(dev));\n        break;\n      }\n      case kPooled: {\n        DLOG(INFO) << \"New pooled allocator for \" << DeviceName(dev.device_type) << \"(\"\n                   << dev.device_id << \")\";\n        alloc.reset(new PooledAllocator(dev));\n        break;\n      }\n      default:\n        LOG(FATAL) << \"Unknown allocator type: \" << type;\n    }\n    auto ret = alloc.get();\n    m->allocators_.emplace(dev, std::move(alloc));\n    return ret;\n  }\n  auto alloc = m->allocators_.at(dev).get();\n  if (alloc->type() != type) {\n    LOG(WARNING) << \"The type of existing allocator for \" << DeviceName(dev.device_type) << \"(\"\n                 << dev.device_id << \") is different from the request type (\" << alloc->type()\n                 << \" vs \" << type << \")\";\n  }\n  return alloc;\n}\n\nAllocator* MemoryManager::GetAllocator(Device dev) {\n  MemoryManager* m = MemoryManager::Global();\n  std::lock_guard<std::mutex> lock(m->mu_);\n  auto it = m->allocators_.find(dev);\n  if (it == m->allocators_.end()) {\n    LOG(FATAL) << \"Allocator for \" << DeviceName(dev.device_type) << \"(\" << dev.device_id\n               << \") has not been created yet.\";\n  }\n  return it->second.get();\n}\n\nNDArray Allocator::Empty(std::vector<int64_t> shape, DLDataType dtype, DLDevice dev) {\n  VerifyDataType(dtype);\n  NDArray::Container* container = new NDArray::Container(nullptr, shape, dtype, dev);\n  container->SetDeleter(BufferDeleter);\n  size_t size = GetDataSize(container->dl_tensor);\n  size_t alignment = GetDataAlignment(container->dl_tensor);\n  Buffer* buffer = new Buffer;\n  *buffer = this->Alloc(size, alignment, dtype);\n  container->manager_ctx = reinterpret_cast<void*>(buffer);\n  container->dl_tensor.data = buffer->data;\n  return NDArray(GetObjectPtr<Object>(container));\n}\n\n}  \/\/ namespace vm\n}  \/\/ namespace runtime\n}  \/\/ namespace tvm\n<commit_msg>Remove pointer arithmetic in StorageObj::AllocNDArray (#7890)<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,\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\/*!\n * \\file tvm\/runtime\/vm\/memory_manager.cc\n * \\brief Allocate and manage memory for the runtime.\n *\/\n#include <tvm\/runtime\/vm\/memory_manager.h>\n\n#include <memory>\n#include <utility>\n\n#include \"naive_allocator.h\"\n#include \"pooled_allocator.h\"\n\nnamespace tvm {\nnamespace runtime {\nnamespace vm {\n\nstatic void BufferDeleter(Object* obj) {\n  auto* ptr = static_cast<NDArray::Container*>(obj);\n  ICHECK(ptr->manager_ctx != nullptr);\n  Buffer* buffer = reinterpret_cast<Buffer*>(ptr->manager_ctx);\n  MemoryManager::GetAllocator(buffer->device)->Free(*(buffer));\n  delete buffer;\n  delete ptr;\n}\n\nvoid StorageObj::Deleter(Object* obj) {\n  auto* ptr = static_cast<NDArray::Container*>(obj);\n  \/\/ When invoking AllocNDArray we don't own the underlying allocation\n  \/\/ and should not delete the buffer, but instead let it be reclaimed\n  \/\/ by the storage object's destructor.\n  \/\/\n  \/\/ We did bump the reference count by 1 to keep alive the StorageObj\n  \/\/ allocation in case this NDArray is the sole owner.\n  \/\/\n  \/\/ We decrement the object allowing for the buffer to release our\n  \/\/ reference count from allocation.\n  StorageObj* storage = reinterpret_cast<StorageObj*>(ptr->manager_ctx);\n  storage->DecRef();\n  delete ptr;\n}\n\ninline void VerifyDataType(DLDataType dtype) {\n  ICHECK_GE(dtype.lanes, 1);\n  if (dtype.code == kDLFloat) {\n    ICHECK_EQ(dtype.bits % 8, 0);\n  } else {\n    \/\/ allow uint1 as a special flag for bool.\n    if (dtype.bits == 1 && dtype.code == kDLUInt) return;\n    ICHECK_EQ(dtype.bits % 8, 0);\n  }\n  ICHECK_EQ(dtype.bits & (dtype.bits - 1), 0);\n}\n\ninline size_t GetDataAlignment(const DLTensor& arr) {\n  size_t align = (arr.dtype.bits \/ 8) * arr.dtype.lanes;\n  if (align < kAllocAlignment) return kAllocAlignment;\n  return align;\n}\n\nNDArray StorageObj::AllocNDArray(size_t offset, std::vector<int64_t> shape, DLDataType dtype) {\n  VerifyDataType(dtype);\n\n  \/\/ crtical zone: allocate header, cannot throw\n  NDArray::Container* container =\n      new NDArray::Container(this->buffer.data, shape, dtype, this->buffer.device);\n  container->dl_tensor.byte_offset = offset;\n\n  container->SetDeleter(StorageObj::Deleter);\n  size_t needed_size = GetDataSize(container->dl_tensor);\n  this->IncRef();\n  \/\/ The manager context pointer must continue to point to the storage object\n  \/\/ which owns the backing memory, and keeps track of the reference count.\n  \/\/\n  \/\/ When we free a container we extract the storage object, decrement its\n  \/\/ reference count, then destroy the container, but leave the underlying\n  \/\/ buffer intact.\n  container->manager_ctx = reinterpret_cast<void*>(this);\n\n  NDArray ret(GetObjectPtr<Object>(container));\n  \/\/ RAII in effect, now run the check.\n\n  ICHECK(offset + needed_size <= this->buffer.size)\n      << \"storage allocation failure, attempted to allocate \" << needed_size << \" at offset \"\n      << offset << \" in region that is \" << this->buffer.size << \"bytes\";\n\n  return ret;\n}\n\nMemoryManager* MemoryManager::Global() {\n  \/\/ NOTE: explicitly use new to avoid exit-time destruction of global state\n  \/\/ Global state will be recycled by OS as the process exits.\n  static auto* inst = new MemoryManager();\n  return inst;\n}\n\nAllocator* MemoryManager::GetOrCreateAllocator(Device dev, AllocatorType type) {\n  MemoryManager* m = MemoryManager::Global();\n  std::lock_guard<std::mutex> lock(m->mu_);\n  if (m->allocators_.find(dev) == m->allocators_.end()) {\n    std::unique_ptr<Allocator> alloc;\n    switch (type) {\n      case kNaive: {\n        DLOG(INFO) << \"New naive allocator for \" << DeviceName(dev.device_type) << \"(\"\n                   << dev.device_id << \")\";\n        alloc.reset(new NaiveAllocator(dev));\n        break;\n      }\n      case kPooled: {\n        DLOG(INFO) << \"New pooled allocator for \" << DeviceName(dev.device_type) << \"(\"\n                   << dev.device_id << \")\";\n        alloc.reset(new PooledAllocator(dev));\n        break;\n      }\n      default:\n        LOG(FATAL) << \"Unknown allocator type: \" << type;\n    }\n    auto ret = alloc.get();\n    m->allocators_.emplace(dev, std::move(alloc));\n    return ret;\n  }\n  auto alloc = m->allocators_.at(dev).get();\n  if (alloc->type() != type) {\n    LOG(WARNING) << \"The type of existing allocator for \" << DeviceName(dev.device_type) << \"(\"\n                 << dev.device_id << \") is different from the request type (\" << alloc->type()\n                 << \" vs \" << type << \")\";\n  }\n  return alloc;\n}\n\nAllocator* MemoryManager::GetAllocator(Device dev) {\n  MemoryManager* m = MemoryManager::Global();\n  std::lock_guard<std::mutex> lock(m->mu_);\n  auto it = m->allocators_.find(dev);\n  if (it == m->allocators_.end()) {\n    LOG(FATAL) << \"Allocator for \" << DeviceName(dev.device_type) << \"(\" << dev.device_id\n               << \") has not been created yet.\";\n  }\n  return it->second.get();\n}\n\nNDArray Allocator::Empty(std::vector<int64_t> shape, DLDataType dtype, DLDevice dev) {\n  VerifyDataType(dtype);\n  NDArray::Container* container = new NDArray::Container(nullptr, shape, dtype, dev);\n  container->SetDeleter(BufferDeleter);\n  size_t size = GetDataSize(container->dl_tensor);\n  size_t alignment = GetDataAlignment(container->dl_tensor);\n  Buffer* buffer = new Buffer;\n  *buffer = this->Alloc(size, alignment, dtype);\n  container->manager_ctx = reinterpret_cast<void*>(buffer);\n  container->dl_tensor.data = buffer->data;\n  return NDArray(GetObjectPtr<Object>(container));\n}\n\n}  \/\/ namespace vm\n}  \/\/ namespace runtime\n}  \/\/ namespace tvm\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n * TIGHTDB CONFIDENTIAL\n * __________________\n *\n *  [2011] - [2012] TightDB Inc\n *  All Rights Reserved.\n *\n * NOTICE:  All information contained herein is, and remains\n * the property of TightDB Incorporated and its suppliers,\n * if any.  The intellectual and technical concepts contained\n * herein are proprietary to TightDB 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 TightDB Incorporated.\n *\n **************************************************************************\/\n#include \"file_mapper.hpp\"\n\n#include <cerrno>\n#include <sys\/mman.h>\n\n#include <tightdb\/util\/errno.hpp>\n\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n\n#include \"encrypted_file_mapping.hpp\"\n\n#include <memory>\n#include <signal.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include <tightdb\/util\/shared_ptr.hpp>\n#include <tightdb\/util\/terminate.hpp>\n#include <tightdb\/util\/thread.hpp>\n\nusing namespace tightdb;\nusing namespace tightdb::util;\n\nnamespace {\nconst size_t page_size = 4096;\n\nclass SpinLockGuard {\npublic:\n    SpinLockGuard(Atomic<bool>& lock) : m_lock(lock)\n    {\n        while (m_lock.exchange_acquire(true)) ;\n    }\n\n    ~SpinLockGuard()\n    {\n        m_lock.store_release(false);\n    }\n\nprivate:\n    Atomic<bool>& m_lock;\n};\n\n\/\/ A list of all of the active encrypted mappings for a single file\nstruct mappings_for_file {\n    dev_t device;\n    ino_t inode;\n    SharedPtr<SharedFileInfo> info;\n};\n\n\/\/ Group the information we need to map a SIGSEGV address to an\n\/\/ EncryptedFileMapping for the sake of cache-friendliness with 3+ active\n\/\/ mappings (and no worse with only two\nstruct mapping_and_addr {\n    SharedPtr<EncryptedFileMapping> mapping;\n    void* addr;\n    size_t size;\n};\n\nAtomic<bool> mapping_lock;\nstd::vector<mapping_and_addr> mappings_by_addr;\nstd::vector<mappings_for_file> mappings_by_file;\n\n\/\/ The signal handlers which our handlers replaced, if any, for forwarding\n\/\/ signals for segfaults outside of our encrypted pages\nstruct sigaction old_segv;\nstruct sigaction old_bus;\n\nvoid signal_handler(int code, siginfo_t* info, void* ctx)\n{\n    SpinLockGuard lock(mapping_lock);\n    for (size_t i = 0; i < mappings_by_addr.size(); ++i) {\n        mapping_and_addr& m = mappings_by_addr[i];\n        if (m.addr > info->si_addr || static_cast<char*>(m.addr) + m.size <= info->si_addr)\n            continue;\n\n        m.mapping->handle_access(info->si_addr);\n        return;\n    }\n\n    \/\/ forward unhandled signals\n    if (code == SIGSEGV) {\n        if (old_segv.sa_sigaction)\n            old_segv.sa_sigaction(code, info, ctx);\n        else if (old_segv.sa_handler)\n            old_segv.sa_handler(code);\n        else\n            TIGHTDB_TERMINATE(\"Segmentation fault\");\n    }\n    else if (code == SIGBUS) {\n        if (old_bus.sa_sigaction)\n            old_bus.sa_sigaction(code, info, ctx);\n        else if (old_bus.sa_handler)\n            old_bus.sa_handler(code);\n        else\n            TIGHTDB_TERMINATE(\"Segmentation fault\");\n    }\n    else\n        TIGHTDB_TERMINATE(\"Segmentation fault\");\n}\n\nmapping_and_addr* find_mapping_for_addr(void* addr, size_t size)\n{\n    for (size_t i = 0; i < mappings_by_addr.size(); ++i) {\n        mapping_and_addr& m = mappings_by_addr[i];\n        if (m.addr == addr && m.size == size)\n            return &m;\n    }\n\n    return 0;\n}\n\nsize_t round_up_to_page_size(size_t size)\n{\n    return (size + page_size - 1) & ~(page_size - 1);\n}\n\nvoid add_mapping(void* addr, size_t size, int fd, File::AccessMode access, const char* encryption_key)\n{\n    struct stat st;\n    if (fstat(fd, &st))\n        TIGHTDB_TERMINATE(\"fstat failed\"); \/\/ FIXME: throw instead\n\n    if (st.st_size > 0 && static_cast<size_t>(st.st_size) < page_size)\n        throw DecryptionFailed();\n\n    SpinLockGuard lock(mapping_lock);\n\n    static bool has_installed_handler = false;\n    if (!has_installed_handler) {\n        has_installed_handler = true;\n\n        struct sigaction action;\n        action.sa_sigaction = signal_handler;\n        action.sa_flags = SA_SIGINFO;\n\n        if (sigaction(SIGSEGV, &action, &old_segv) != 0)\n            TIGHTDB_TERMINATE(\"sigaction SEGV failed\");\n        if (sigaction(SIGBUS, &action, &old_bus) != 0)\n            TIGHTDB_TERMINATE(\"sigaction SIGBUS\");\n    }\n\n    std::vector<mappings_for_file>::iterator it;\n    for (it = mappings_by_file.begin(); it != mappings_by_file.end(); ++it) {\n        if (it->inode == st.st_ino && it->device == st.st_dev)\n            break;\n    }\n\n    \/\/ Get the potential memory allocation out of the way so that mappings_by_addr.push_back can't throw\n    mappings_by_addr.reserve(mappings_by_addr.size() + 1);\n\n    if (it == mappings_by_file.end()) {\n        mappings_for_file f;\n        f.device = st.st_dev;\n        f.inode = st.st_ino;\n        f.info = new SharedFileInfo(reinterpret_cast<const uint8_t*>(encryption_key), dup(fd));\n        mappings_by_file.push_back(f);\n        it = mappings_by_file.end() - 1;\n    }\n\n    try {\n        mapping_and_addr m;\n        m.addr = addr;\n        m.size = size;\n        m.mapping = new EncryptedFileMapping(*it->info, addr, size, access);\n        mappings_by_addr.push_back(m);\n    }\n    catch (...) {\n        if (it->info->mappings.empty()) {\n            ::close(it->info->fd);\n            mappings_by_file.erase(it);\n        }\n        throw;\n    }\n}\n\nvoid remove_mapping(void* addr, size_t size)\n{\n    size = round_up_to_page_size(size);\n    SpinLockGuard lock(mapping_lock);\n    mapping_and_addr* m = find_mapping_for_addr(addr, size);\n    if (!m)\n        return;\n\n    mappings_by_addr.erase(mappings_by_addr.begin() + (m - &mappings_by_addr[0]));\n    for (std::vector<mappings_for_file>::iterator it = mappings_by_file.begin(); it != mappings_by_file.end(); ++it) {\n        if (it->info->mappings.empty()) {\n            ::close(it->info->fd);\n            mappings_by_file.erase(it);\n            break;\n        }\n    }\n}\n\nvoid* mmap_anon(size_t size)\n{\n    void* addr = ::mmap(0, size, PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE, -1, 0);\n    if (addr == MAP_FAILED) {\n        int err = errno; \/\/ Eliminate any risk of clobbering\n        throw std::runtime_error(get_errno_msg(\"mmap() failed: \", err));\n    }\n    return addr;\n}\n\n} \/\/ anonymous namespace\n#endif\n\nnamespace tightdb {\nnamespace util {\n\nvoid* mmap(int fd, size_t size, File::AccessMode access, const char* encryption_key)\n{\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n    if (encryption_key) {\n        size = round_up_to_page_size(size);\n        void* addr = mmap_anon(size);\n        add_mapping(addr, size, fd, access, encryption_key);\n        return addr;\n    }\n    else\n#else\n    TIGHTDB_ASSERT(!encryption_key);\n    static_cast<void>(encryption_key);\n#endif\n    {\n        int prot = PROT_READ;\n        switch (access) {\n            case File::access_ReadWrite:\n                prot |= PROT_WRITE;\n                break;\n            case File::access_ReadOnly:\n                break;\n        }\n\n        void* addr = ::mmap(0, size, prot, MAP_SHARED, fd, 0);\n        if (addr != MAP_FAILED)\n            return addr;\n    }\n\n    int err = errno; \/\/ Eliminate any risk of clobbering\n    throw std::runtime_error(get_errno_msg(\"mmap() failed: \", err));\n}\n\nvoid munmap(void* addr, size_t size) TIGHTDB_NOEXCEPT\n{\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n    remove_mapping(addr, size);\n#endif\n    ::munmap(addr, size);\n}\n\nvoid* mremap(int fd, void* old_addr, size_t old_size, File::AccessMode a, size_t new_size)\n{\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n    {\n        SpinLockGuard lock(mapping_lock);\n        size_t rounded_old_size = round_up_to_page_size(old_size);\n        if (mapping_and_addr* m = find_mapping_for_addr(old_addr, rounded_old_size)) {\n            size_t rounded_new_size = round_up_to_page_size(new_size);\n            if (rounded_old_size == rounded_new_size)\n                return old_addr;\n\n            void* new_addr = mmap_anon(rounded_new_size);\n            m->mapping->set(new_addr, rounded_new_size);\n            ::munmap(old_addr, rounded_old_size);\n            m->addr = new_addr;\n            m->size = rounded_new_size;\n            return new_addr;\n        }\n    }\n#endif\n\n#ifdef _GNU_SOURCE\n    static_cast<void>(fd);\n    static_cast<void>(a);\n    void* new_addr = ::mremap(old_addr, old_size, new_size, MREMAP_MAYMOVE);\n    if (new_addr != MAP_FAILED)\n        return new_addr;\n    int err = errno; \/\/ Eliminate any risk of clobbering\n    throw std::runtime_error(get_errno_msg(\"mremap(): failed: \", err));\n#else\n    void* new_addr = mmap(fd, new_size, a, nullptr);\n    ::munmap(old_addr, old_size);\n    return new_addr;\n#endif\n}\n\nvoid msync(void* addr, size_t size)\n{\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n    { \/\/ first check the encrypted mappings\n        SpinLockGuard lock(mapping_lock);\n        if (mapping_and_addr* m = find_mapping_for_addr(addr, size)) {\n            m->mapping->flush();\n            m->mapping->sync();\n            return;\n        }\n    }\n#endif\n\n    \/\/ not an encrypted mapping\n    if (::msync(addr, size, MS_SYNC) != 0) {\n        int err = errno; \/\/ Eliminate any risk of clobbering\n        throw std::runtime_error(get_errno_msg(\"msync() failed: \", err));\n    }\n}\n\n}\n}\n<commit_msg>Check for dup() failures<commit_after>\/*************************************************************************\n *\n * TIGHTDB CONFIDENTIAL\n * __________________\n *\n *  [2011] - [2012] TightDB Inc\n *  All Rights Reserved.\n *\n * NOTICE:  All information contained herein is, and remains\n * the property of TightDB Incorporated and its suppliers,\n * if any.  The intellectual and technical concepts contained\n * herein are proprietary to TightDB 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 TightDB Incorporated.\n *\n **************************************************************************\/\n#include \"file_mapper.hpp\"\n\n#include <cerrno>\n#include <sys\/mman.h>\n\n#include <tightdb\/util\/errno.hpp>\n\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n\n#include \"encrypted_file_mapping.hpp\"\n\n#include <memory>\n#include <signal.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include <tightdb\/util\/errno.hpp>\n#include <tightdb\/util\/shared_ptr.hpp>\n#include <tightdb\/util\/terminate.hpp>\n#include <tightdb\/util\/thread.hpp>\n\nusing namespace tightdb;\nusing namespace tightdb::util;\n\nnamespace {\nconst size_t page_size = 4096;\n\nclass SpinLockGuard {\npublic:\n    SpinLockGuard(Atomic<bool>& lock) : m_lock(lock)\n    {\n        while (m_lock.exchange_acquire(true)) ;\n    }\n\n    ~SpinLockGuard()\n    {\n        m_lock.store_release(false);\n    }\n\nprivate:\n    Atomic<bool>& m_lock;\n};\n\n\/\/ A list of all of the active encrypted mappings for a single file\nstruct mappings_for_file {\n    dev_t device;\n    ino_t inode;\n    SharedPtr<SharedFileInfo> info;\n};\n\n\/\/ Group the information we need to map a SIGSEGV address to an\n\/\/ EncryptedFileMapping for the sake of cache-friendliness with 3+ active\n\/\/ mappings (and no worse with only two\nstruct mapping_and_addr {\n    SharedPtr<EncryptedFileMapping> mapping;\n    void* addr;\n    size_t size;\n};\n\nAtomic<bool> mapping_lock;\nstd::vector<mapping_and_addr> mappings_by_addr;\nstd::vector<mappings_for_file> mappings_by_file;\n\n\/\/ The signal handlers which our handlers replaced, if any, for forwarding\n\/\/ signals for segfaults outside of our encrypted pages\nstruct sigaction old_segv;\nstruct sigaction old_bus;\n\nvoid signal_handler(int code, siginfo_t* info, void* ctx)\n{\n    SpinLockGuard lock(mapping_lock);\n    for (size_t i = 0; i < mappings_by_addr.size(); ++i) {\n        mapping_and_addr& m = mappings_by_addr[i];\n        if (m.addr > info->si_addr || static_cast<char*>(m.addr) + m.size <= info->si_addr)\n            continue;\n\n        m.mapping->handle_access(info->si_addr);\n        return;\n    }\n\n    \/\/ forward unhandled signals\n    if (code == SIGSEGV) {\n        if (old_segv.sa_sigaction)\n            old_segv.sa_sigaction(code, info, ctx);\n        else if (old_segv.sa_handler)\n            old_segv.sa_handler(code);\n        else\n            TIGHTDB_TERMINATE(\"Segmentation fault\");\n    }\n    else if (code == SIGBUS) {\n        if (old_bus.sa_sigaction)\n            old_bus.sa_sigaction(code, info, ctx);\n        else if (old_bus.sa_handler)\n            old_bus.sa_handler(code);\n        else\n            TIGHTDB_TERMINATE(\"Segmentation fault\");\n    }\n    else\n        TIGHTDB_TERMINATE(\"Segmentation fault\");\n}\n\nmapping_and_addr* find_mapping_for_addr(void* addr, size_t size)\n{\n    for (size_t i = 0; i < mappings_by_addr.size(); ++i) {\n        mapping_and_addr& m = mappings_by_addr[i];\n        if (m.addr == addr && m.size == size)\n            return &m;\n    }\n\n    return 0;\n}\n\nsize_t round_up_to_page_size(size_t size)\n{\n    return (size + page_size - 1) & ~(page_size - 1);\n}\n\nvoid add_mapping(void* addr, size_t size, int fd, File::AccessMode access, const char* encryption_key)\n{\n    struct stat st;\n    if (fstat(fd, &st)) {\n        int err = errno; \/\/ Eliminate any risk of clobbering\n        throw std::runtime_error(get_errno_msg(\"fstat() failed: \", err));\n    }\n\n    if (st.st_size > 0 && static_cast<size_t>(st.st_size) < page_size)\n        throw DecryptionFailed();\n\n    SpinLockGuard lock(mapping_lock);\n\n    static bool has_installed_handler = false;\n    if (!has_installed_handler) {\n        has_installed_handler = true;\n\n        struct sigaction action;\n        action.sa_sigaction = signal_handler;\n        action.sa_flags = SA_SIGINFO;\n\n        if (sigaction(SIGSEGV, &action, &old_segv) != 0)\n            TIGHTDB_TERMINATE(\"sigaction SEGV failed\");\n        if (sigaction(SIGBUS, &action, &old_bus) != 0)\n            TIGHTDB_TERMINATE(\"sigaction SIGBUS\");\n    }\n\n    std::vector<mappings_for_file>::iterator it;\n    for (it = mappings_by_file.begin(); it != mappings_by_file.end(); ++it) {\n        if (it->inode == st.st_ino && it->device == st.st_dev)\n            break;\n    }\n\n    \/\/ Get the potential memory allocation out of the way so that mappings_by_addr.push_back can't throw\n    mappings_by_addr.reserve(mappings_by_addr.size() + 1);\n\n    if (it == mappings_by_file.end()) {\n        fd = dup(fd);\n        if (fd == -1) {\n            int err = errno; \/\/ Eliminate any risk of clobbering\n            throw std::runtime_error(get_errno_msg(\"dup() failed: \", err));\n        }\n\n        mappings_for_file f;\n        f.device = st.st_dev;\n        f.inode = st.st_ino;\n        f.info = new SharedFileInfo(reinterpret_cast<const uint8_t*>(encryption_key), fd);\n        mappings_by_file.push_back(f);\n        it = mappings_by_file.end() - 1;\n    }\n\n    try {\n        mapping_and_addr m;\n        m.addr = addr;\n        m.size = size;\n        m.mapping = new EncryptedFileMapping(*it->info, addr, size, access);\n        mappings_by_addr.push_back(m);\n    }\n    catch (...) {\n        if (it->info->mappings.empty()) {\n            ::close(it->info->fd);\n            mappings_by_file.erase(it);\n        }\n        throw;\n    }\n}\n\nvoid remove_mapping(void* addr, size_t size)\n{\n    size = round_up_to_page_size(size);\n    SpinLockGuard lock(mapping_lock);\n    mapping_and_addr* m = find_mapping_for_addr(addr, size);\n    if (!m)\n        return;\n\n    mappings_by_addr.erase(mappings_by_addr.begin() + (m - &mappings_by_addr[0]));\n    for (std::vector<mappings_for_file>::iterator it = mappings_by_file.begin(); it != mappings_by_file.end(); ++it) {\n        if (it->info->mappings.empty()) {\n            ::close(it->info->fd);\n            mappings_by_file.erase(it);\n            break;\n        }\n    }\n}\n\nvoid* mmap_anon(size_t size)\n{\n    void* addr = ::mmap(0, size, PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE, -1, 0);\n    if (addr == MAP_FAILED) {\n        int err = errno; \/\/ Eliminate any risk of clobbering\n        throw std::runtime_error(get_errno_msg(\"mmap() failed: \", err));\n    }\n    return addr;\n}\n\n} \/\/ anonymous namespace\n#endif\n\nnamespace tightdb {\nnamespace util {\n\nvoid* mmap(int fd, size_t size, File::AccessMode access, const char* encryption_key)\n{\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n    if (encryption_key) {\n        size = round_up_to_page_size(size);\n        void* addr = mmap_anon(size);\n        add_mapping(addr, size, fd, access, encryption_key);\n        return addr;\n    }\n    else\n#else\n    TIGHTDB_ASSERT(!encryption_key);\n    static_cast<void>(encryption_key);\n#endif\n    {\n        int prot = PROT_READ;\n        switch (access) {\n            case File::access_ReadWrite:\n                prot |= PROT_WRITE;\n                break;\n            case File::access_ReadOnly:\n                break;\n        }\n\n        void* addr = ::mmap(0, size, prot, MAP_SHARED, fd, 0);\n        if (addr != MAP_FAILED)\n            return addr;\n    }\n\n    int err = errno; \/\/ Eliminate any risk of clobbering\n    throw std::runtime_error(get_errno_msg(\"mmap() failed: \", err));\n}\n\nvoid munmap(void* addr, size_t size) TIGHTDB_NOEXCEPT\n{\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n    remove_mapping(addr, size);\n#endif\n    ::munmap(addr, size);\n}\n\nvoid* mremap(int fd, void* old_addr, size_t old_size, File::AccessMode a, size_t new_size)\n{\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n    {\n        SpinLockGuard lock(mapping_lock);\n        size_t rounded_old_size = round_up_to_page_size(old_size);\n        if (mapping_and_addr* m = find_mapping_for_addr(old_addr, rounded_old_size)) {\n            size_t rounded_new_size = round_up_to_page_size(new_size);\n            if (rounded_old_size == rounded_new_size)\n                return old_addr;\n\n            void* new_addr = mmap_anon(rounded_new_size);\n            m->mapping->set(new_addr, rounded_new_size);\n            ::munmap(old_addr, rounded_old_size);\n            m->addr = new_addr;\n            m->size = rounded_new_size;\n            return new_addr;\n        }\n    }\n#endif\n\n#ifdef _GNU_SOURCE\n    static_cast<void>(fd);\n    static_cast<void>(a);\n    void* new_addr = ::mremap(old_addr, old_size, new_size, MREMAP_MAYMOVE);\n    if (new_addr != MAP_FAILED)\n        return new_addr;\n    int err = errno; \/\/ Eliminate any risk of clobbering\n    throw std::runtime_error(get_errno_msg(\"mremap(): failed: \", err));\n#else\n    void* new_addr = mmap(fd, new_size, a, nullptr);\n    ::munmap(old_addr, old_size);\n    return new_addr;\n#endif\n}\n\nvoid msync(void* addr, size_t size)\n{\n#ifdef TIGHTDB_ENABLE_ENCRYPTION\n    { \/\/ first check the encrypted mappings\n        SpinLockGuard lock(mapping_lock);\n        if (mapping_and_addr* m = find_mapping_for_addr(addr, size)) {\n            m->mapping->flush();\n            m->mapping->sync();\n            return;\n        }\n    }\n#endif\n\n    \/\/ not an encrypted mapping\n    if (::msync(addr, size, MS_SYNC) != 0) {\n        int err = errno; \/\/ Eliminate any risk of clobbering\n        throw std::runtime_error(get_errno_msg(\"msync() failed: \", err));\n    }\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"usb-mic-singstar.h\"\n#include \"audio.h\"\n#include \"..\/qemu-usb\/desc.h\"\n\n#define DEVICENAME \"logitech_usbmic\"\n\nnamespace usb_mic_singstar {\n\nstatic const uint8_t logitech_mic_dev_descriptor[] = {\n    \/* bLength             *\/ 0x12, \/\/(18)\n    \/* bDescriptorType     *\/ 0x01, \/\/(1)\n    \/* bcdUSB              *\/ WBVAL(0x0110), \/\/(272)\n    \/* bDeviceClass        *\/ 0x00, \/\/(0)\n    \/* bDeviceSubClass     *\/ 0x00, \/\/(0)\n    \/* bDeviceProtocol     *\/ 0x00, \/\/(0)\n    \/* bMaxPacketSize0     *\/ 0x08, \/\/(8)\n    \/* idVendor            *\/ WBVAL(0x046D),\n    \/* idProduct           *\/ WBVAL(0x0000), \/\/(0)\n    \/* bcdDevice           *\/ WBVAL(0x0001), \/\/(1)\n    \/* iManufacturer       *\/ 0x01, \/\/(1)\n    \/* iProduct            *\/ 0x02, \/\/(2)\n    \/* iSerialNumber       *\/ 0x00, \/\/(0) unused\n    \/* bNumConfigurations  *\/ 0x01, \/\/(1)\n\n};\n\nstatic const uint8_t logitech_mic_config_descriptor[] = {\n\n    \/* Configuration 1 *\/\n    0x09,   \/* bLength *\/\n    USB_CONFIGURATION_DESCRIPTOR_TYPE,    \/* bDescriptorType *\/\n    WBVAL(0x00b1),                        \/* wTotalLength *\/\n    0x02,                                 \/* bNumInterfaces *\/\n    0x01,                                 \/* bConfigurationValue *\/\n    0x00,                                 \/* iConfiguration *\/\n    USB_CONFIG_BUS_POWERED,               \/* bmAttributes *\/\n    USB_CONFIG_POWER_MA(90),              \/* bMaxPower *\/\n\n                                          \/* Interface 0, Alternate Setting 0, Audio Control *\/\n    USB_INTERFACE_DESC_SIZE,              \/* bLength *\/\n    USB_INTERFACE_DESCRIPTOR_TYPE,        \/* bDescriptorType *\/\n    0x00,                                 \/* bInterfaceNumber *\/\n    0x00,                                 \/* bAlternateSetting *\/\n    0x00,                                 \/* bNumEndpoints *\/\n    USB_CLASS_AUDIO,                      \/* bInterfaceClass *\/\n    AUDIO_SUBCLASS_AUDIOCONTROL,          \/* bInterfaceSubClass *\/\n    AUDIO_PROTOCOL_UNDEFINED,             \/* bInterfaceProtocol *\/\n    0x00,                                 \/* iInterface *\/\n\n                                          \/* Audio Control Interface *\/\n    AUDIO_CONTROL_INTERFACE_DESC_SZ(1),   \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_CONTROL_HEADER,                 \/* bDescriptorSubtype *\/\n    WBVAL(0x0100), \/* 1.00 *\/             \/* bcdADC *\/\n    WBVAL(0x0028),                        \/* wTotalLength *\/\n    0x01,                                 \/* bInCollection *\/\n    0x01,                                 \/* baInterfaceNr *\/\n\n                                          \/* Audio Input Terminal *\/\n    AUDIO_INPUT_TERMINAL_DESC_SIZE,       \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_CONTROL_INPUT_TERMINAL,         \/* bDescriptorSubtype *\/\n    0x01,                                 \/* bTerminalID *\/\n    WBVAL(AUDIO_TERMINAL_MICROPHONE),     \/* wTerminalType *\/\n    0x02,                                 \/* bAssocTerminal *\/\n    0x02,                                 \/* bNrChannels *\/\n    WBVAL(AUDIO_CHANNEL_L\n        | AUDIO_CHANNEL_R),\t\t\t\t\/* wChannelConfig *\/\n    0x00,                                 \/* iChannelNames *\/\n    0x00,                                 \/* iTerminal *\/\n\n                                          \/* Audio Output Terminal *\/\n    AUDIO_OUTPUT_TERMINAL_DESC_SIZE,      \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_CONTROL_OUTPUT_TERMINAL,        \/* bDescriptorSubtype *\/\n    0x02,                                 \/* bTerminalID *\/\n    WBVAL(AUDIO_TERMINAL_USB_STREAMING),  \/* wTerminalType *\/\n    0x01,                                 \/* bAssocTerminal *\/\n    0x03,                                 \/* bSourceID *\/\n    0x00,                                 \/* iTerminal *\/\n\n                                          \/* Audio Feature Unit *\/\n    AUDIO_FEATURE_UNIT_DESC_SZ(2,1),      \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_CONTROL_FEATURE_UNIT,           \/* bDescriptorSubtype *\/\n    0x03,                                 \/* bUnitID *\/\n    0x01,                                 \/* bSourceID *\/\n    0x01,                                 \/* bControlSize *\/\n    0x01,                                 \/* bmaControls(0) *\/\n    0x02,                                 \/* bmaControls(1) *\/\n    0x02,                                 \/* bmaControls(2) *\/\n    0x00,                                 \/* iTerminal *\/\n\n                                          \/* Interface 1, Alternate Setting 0, Audio Streaming - Zero Bandwith *\/\n    USB_INTERFACE_DESC_SIZE,              \/* bLength *\/\n    USB_INTERFACE_DESCRIPTOR_TYPE,        \/* bDescriptorType *\/\n    0x01,                                 \/* bInterfaceNumber *\/\n    0x00,                                 \/* bAlternateSetting *\/\n    0x00,                                 \/* bNumEndpoints *\/\n    USB_CLASS_AUDIO,                      \/* bInterfaceClass *\/\n    AUDIO_SUBCLASS_AUDIOSTREAMING,        \/* bInterfaceSubClass *\/\n    AUDIO_PROTOCOL_UNDEFINED,             \/* bInterfaceProtocol *\/\n    0x00,                                 \/* iInterface *\/\n\n                                          \/* Interface 1, Alternate Setting 1, Audio Streaming - Operational *\/\n    USB_INTERFACE_DESC_SIZE,              \/* bLength *\/\n    USB_INTERFACE_DESCRIPTOR_TYPE,        \/* bDescriptorType *\/\n    0x01,                                 \/* bInterfaceNumber *\/\n    0x01,                                 \/* bAlternateSetting *\/\n    0x01,                                 \/* bNumEndpoints *\/\n    USB_CLASS_AUDIO,                      \/* bInterfaceClass *\/\n    AUDIO_SUBCLASS_AUDIOSTREAMING,        \/* bInterfaceSubClass *\/\n    AUDIO_PROTOCOL_UNDEFINED,             \/* bInterfaceProtocol *\/\n    0x00,                                 \/* iInterface *\/\n\n                                          \/* Audio Streaming Interface *\/\n    AUDIO_STREAMING_INTERFACE_DESC_SIZE,  \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_STREAMING_GENERAL,              \/* bDescriptorSubtype *\/\n    0x02,                                 \/* bTerminalLink *\/\n    0x01,                                 \/* bDelay *\/\n    WBVAL(AUDIO_FORMAT_PCM),              \/* wFormatTag *\/\n\n                                          \/* Audio Type I Format *\/\n    AUDIO_FORMAT_TYPE_I_DESC_SZ(5),       \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_STREAMING_FORMAT_TYPE,          \/* bDescriptorSubtype *\/\n    AUDIO_FORMAT_TYPE_I,                  \/* bFormatType *\/\n    0x01,                                 \/* bNrChannels *\/\n    0x02,                                 \/* bSubFrameSize *\/\n    0x10,                                 \/* bBitResolution *\/\n    0x05,                                 \/* bSamFreqType *\/\n    B3VAL(8000),                          \/* tSamFreq 1 *\/\n    B3VAL(11025),                         \/* tSamFreq 2 *\/\n    B3VAL(22050),                         \/* tSamFreq 3 *\/\n    B3VAL(44100),                         \/* tSamFreq 4 *\/\n    B3VAL(48000),                         \/* tSamFreq 5 *\/\n\n                                          \/* Endpoint - Standard Descriptor *\/\n    AUDIO_STANDARD_ENDPOINT_DESC_SIZE,    \/* bLength *\/\n    USB_ENDPOINT_DESCRIPTOR_TYPE,         \/* bDescriptorType *\/\n    USB_ENDPOINT_IN(1),                   \/* bEndpointAddress *\/\n    USB_ENDPOINT_TYPE_ISOCHRONOUS\n    | USB_ENDPOINT_SYNC_ASYNCHRONOUS,     \/* bmAttributes *\/\n    WBVAL(0x0064),                        \/* wMaxPacketSize *\/\n    0x01,                                 \/* bInterval *\/\n    0x00,                                 \/* bRefresh *\/\n    0x00,                                 \/* bSynchAddress *\/\n\n                                          \/* Endpoint - Audio Streaming *\/\n    AUDIO_STREAMING_ENDPOINT_DESC_SIZE,   \/* bLength *\/\n    AUDIO_ENDPOINT_DESCRIPTOR_TYPE,       \/* bDescriptorType *\/\n    AUDIO_ENDPOINT_GENERAL,               \/* bDescriptor *\/\n    0x01,                                 \/* bmAttributes *\/\n    0x00,                                 \/* bLockDelayUnits *\/\n    WBVAL(0x0000),                        \/* wLockDelay *\/\n\n                                          \/* Interface 1, Alternate Setting 2, Audio Streaming - ? *\/\n    USB_INTERFACE_DESC_SIZE,              \/* bLength *\/\n    USB_INTERFACE_DESCRIPTOR_TYPE,        \/* bDescriptorType *\/\n    0x01,                                 \/* bInterfaceNumber *\/\n    0x02,                                 \/* bAlternateSetting *\/\n    0x01,                                 \/* bNumEndpoints *\/\n    USB_CLASS_AUDIO,                      \/* bInterfaceClass *\/\n    AUDIO_SUBCLASS_AUDIOSTREAMING,        \/* bInterfaceSubClass *\/\n    AUDIO_PROTOCOL_UNDEFINED,             \/* bInterfaceProtocol *\/\n    0x00,                                 \/* iInterface *\/\n\n                                          \/* Audio Streaming Interface *\/\n    AUDIO_STREAMING_INTERFACE_DESC_SIZE,  \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_STREAMING_GENERAL,              \/* bDescriptorSubtype *\/\n    0x02,                                 \/* bTerminalLink *\/\n    0x01,                                 \/* bDelay *\/\n    WBVAL(AUDIO_FORMAT_PCM),              \/* wFormatTag *\/\n\n                                          \/* Audio Type I Format *\/\n    AUDIO_FORMAT_TYPE_I_DESC_SZ(5),       \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_STREAMING_FORMAT_TYPE,          \/* bDescriptorSubtype *\/\n    AUDIO_FORMAT_TYPE_I,                  \/* bFormatType *\/\n    0x02,                                 \/* bNrChannels *\/\n    0x02,                                 \/* bSubFrameSize *\/\n    0x10,                                 \/* bBitResolution *\/\n    0x05,                                 \/* bSamFreqType *\/\n    B3VAL(8000),                          \/* tSamFreq 1 *\/\n    B3VAL(11025),                         \/* tSamFreq 2 *\/\n    B3VAL(22050),                         \/* tSamFreq 3 *\/\n    B3VAL(44100),                         \/* tSamFreq 4 *\/\n    B3VAL(48000),                         \/* tSamFreq 5 *\/\n\n                                          \/* Endpoint - Standard Descriptor *\/\n    AUDIO_STANDARD_ENDPOINT_DESC_SIZE,    \/* bLength *\/\n    USB_ENDPOINT_DESCRIPTOR_TYPE,         \/* bDescriptorType *\/\n    USB_ENDPOINT_IN(1),                   \/* bEndpointAddress *\/\n    USB_ENDPOINT_TYPE_ISOCHRONOUS\n    | USB_ENDPOINT_SYNC_ASYNCHRONOUS,     \/* bmAttributes *\/\n    WBVAL(0x00c8),                        \/* wMaxPacketSize *\/\n    0x01,                                 \/* bInterval *\/\n    0x00,                                 \/* bRefresh *\/\n    0x00,                                 \/* bSynchAddress *\/\n\n                                          \/* Endpoint - Audio Streaming *\/\n    AUDIO_STREAMING_ENDPOINT_DESC_SIZE,   \/* bLength *\/\n    AUDIO_ENDPOINT_DESCRIPTOR_TYPE,       \/* bDescriptorType *\/\n    AUDIO_ENDPOINT_GENERAL,               \/* bDescriptor *\/\n    0x01,                                 \/* bmAttributes *\/\n    0x00,                                 \/* bLockDelayUnits *\/\n    WBVAL(0x0000),                        \/* wLockDelay *\/\n\n                                          \/* Terminator *\/\n    0                                     \/* bLength *\/\n};\n\nstatic const USBDescStrings lt_desc_strings = {\n    \"\",\n    \"Logitech\",\n    \"USBMIC\",\n};\n\n\/\/Minified state\ntypedef struct SINGSTARMICMINIState {\n    USBDevice dev;\n\n    USBDesc desc;\n    USBDescDevice desc_dev;\n} SINGSTARMICMINIState;\n\nclass LogitechMicDevice : public SingstarDevice\n{\npublic:\n\tvirtual ~LogitechMicDevice() {}\n\tstatic USBDevice* CreateDevice(int port)\n\t{\n\t\tstd::string api;\n\t\t{\n\t\t\tCONFIGVARIANT var(N_DEVICE_API, CONFIG_TYPE_CHAR);\n\t\t\tif (LoadSetting(port, DEVICENAME, var))\n\t\t\t\tapi = var.strValue;\n\t\t}\n\n\t\tUSBDevice* dev = SingstarDevice::CreateDevice(port, api);\n\t\tif (!dev)\n\t\t\treturn NULL;\n\n\t\tSINGSTARMICMINIState *s = (SINGSTARMICMINIState *)dev;\n\t\ts->desc = {};\n\t\ts->desc_dev = {};\n\n\t\ts->desc.str = lt_desc_strings;\n\t\tif (usb_desc_parse_dev (logitech_mic_dev_descriptor, sizeof(logitech_mic_dev_descriptor), s->desc, s->desc_dev) < 0)\n\t\t\tgoto fail;\n\t\tif (usb_desc_parse_config (logitech_mic_config_descriptor, sizeof(logitech_mic_config_descriptor), s->desc_dev) < 0)\n\t\t\tgoto fail;\n\n\t\ts->dev.klass.usb_desc       = &s->desc;\n\t\ts->dev.klass.product_desc   = lt_desc_strings[2];\n\t\tusb_desc_init(&s->dev);\n\t\treturn dev;\nfail:\n\t\ts->dev.klass.unrealize (dev);\n\t\treturn NULL;\n\t}\n\tstatic const char* TypeName()\n\t{\n\t\treturn DEVICENAME;\n\t}\n\tstatic const TCHAR* Name()\n\t{\n\t\treturn TEXT(\"Logitech USB Mic\");\n\t}\n};\n\nREGISTER_DEVICE(DEVTYPE_LOGITECH_MIC, DEVICENAME, LogitechMicDevice);\n};\n#undef DEVICENAME<commit_msg>logitech-mic: fix nullptr error caused by full speed device variable being reset too<commit_after>#include \"usb-mic-singstar.h\"\n#include \"audio.h\"\n#include \"..\/qemu-usb\/desc.h\"\n\n#define DEVICENAME \"logitech_usbmic\"\n\nnamespace usb_mic_singstar {\n\nstatic const uint8_t logitech_mic_dev_descriptor[] = {\n    \/* bLength             *\/ 0x12, \/\/(18)\n    \/* bDescriptorType     *\/ 0x01, \/\/(1)\n    \/* bcdUSB              *\/ WBVAL(0x0110), \/\/(272)\n    \/* bDeviceClass        *\/ 0x00, \/\/(0)\n    \/* bDeviceSubClass     *\/ 0x00, \/\/(0)\n    \/* bDeviceProtocol     *\/ 0x00, \/\/(0)\n    \/* bMaxPacketSize0     *\/ 0x08, \/\/(8)\n    \/* idVendor            *\/ WBVAL(0x046D),\n    \/* idProduct           *\/ WBVAL(0x0000), \/\/(0)\n    \/* bcdDevice           *\/ WBVAL(0x0001), \/\/(1)\n    \/* iManufacturer       *\/ 0x01, \/\/(1)\n    \/* iProduct            *\/ 0x02, \/\/(2)\n    \/* iSerialNumber       *\/ 0x00, \/\/(0) unused\n    \/* bNumConfigurations  *\/ 0x01, \/\/(1)\n\n};\n\nstatic const uint8_t logitech_mic_config_descriptor[] = {\n\n    \/* Configuration 1 *\/\n    0x09,   \/* bLength *\/\n    USB_CONFIGURATION_DESCRIPTOR_TYPE,    \/* bDescriptorType *\/\n    WBVAL(0x00b1),                        \/* wTotalLength *\/\n    0x02,                                 \/* bNumInterfaces *\/\n    0x01,                                 \/* bConfigurationValue *\/\n    0x00,                                 \/* iConfiguration *\/\n    USB_CONFIG_BUS_POWERED,               \/* bmAttributes *\/\n    USB_CONFIG_POWER_MA(90),              \/* bMaxPower *\/\n\n                                          \/* Interface 0, Alternate Setting 0, Audio Control *\/\n    USB_INTERFACE_DESC_SIZE,              \/* bLength *\/\n    USB_INTERFACE_DESCRIPTOR_TYPE,        \/* bDescriptorType *\/\n    0x00,                                 \/* bInterfaceNumber *\/\n    0x00,                                 \/* bAlternateSetting *\/\n    0x00,                                 \/* bNumEndpoints *\/\n    USB_CLASS_AUDIO,                      \/* bInterfaceClass *\/\n    AUDIO_SUBCLASS_AUDIOCONTROL,          \/* bInterfaceSubClass *\/\n    AUDIO_PROTOCOL_UNDEFINED,             \/* bInterfaceProtocol *\/\n    0x00,                                 \/* iInterface *\/\n\n                                          \/* Audio Control Interface *\/\n    AUDIO_CONTROL_INTERFACE_DESC_SZ(1),   \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_CONTROL_HEADER,                 \/* bDescriptorSubtype *\/\n    WBVAL(0x0100), \/* 1.00 *\/             \/* bcdADC *\/\n    WBVAL(0x0028),                        \/* wTotalLength *\/\n    0x01,                                 \/* bInCollection *\/\n    0x01,                                 \/* baInterfaceNr *\/\n\n                                          \/* Audio Input Terminal *\/\n    AUDIO_INPUT_TERMINAL_DESC_SIZE,       \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_CONTROL_INPUT_TERMINAL,         \/* bDescriptorSubtype *\/\n    0x01,                                 \/* bTerminalID *\/\n    WBVAL(AUDIO_TERMINAL_MICROPHONE),     \/* wTerminalType *\/\n    0x02,                                 \/* bAssocTerminal *\/\n    0x02,                                 \/* bNrChannels *\/\n    WBVAL(AUDIO_CHANNEL_L\n        | AUDIO_CHANNEL_R),\t\t\t\t\/* wChannelConfig *\/\n    0x00,                                 \/* iChannelNames *\/\n    0x00,                                 \/* iTerminal *\/\n\n                                          \/* Audio Output Terminal *\/\n    AUDIO_OUTPUT_TERMINAL_DESC_SIZE,      \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_CONTROL_OUTPUT_TERMINAL,        \/* bDescriptorSubtype *\/\n    0x02,                                 \/* bTerminalID *\/\n    WBVAL(AUDIO_TERMINAL_USB_STREAMING),  \/* wTerminalType *\/\n    0x01,                                 \/* bAssocTerminal *\/\n    0x03,                                 \/* bSourceID *\/\n    0x00,                                 \/* iTerminal *\/\n\n                                          \/* Audio Feature Unit *\/\n    AUDIO_FEATURE_UNIT_DESC_SZ(2,1),      \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_CONTROL_FEATURE_UNIT,           \/* bDescriptorSubtype *\/\n    0x03,                                 \/* bUnitID *\/\n    0x01,                                 \/* bSourceID *\/\n    0x01,                                 \/* bControlSize *\/\n    0x01,                                 \/* bmaControls(0) *\/\n    0x02,                                 \/* bmaControls(1) *\/\n    0x02,                                 \/* bmaControls(2) *\/\n    0x00,                                 \/* iTerminal *\/\n\n                                          \/* Interface 1, Alternate Setting 0, Audio Streaming - Zero Bandwith *\/\n    USB_INTERFACE_DESC_SIZE,              \/* bLength *\/\n    USB_INTERFACE_DESCRIPTOR_TYPE,        \/* bDescriptorType *\/\n    0x01,                                 \/* bInterfaceNumber *\/\n    0x00,                                 \/* bAlternateSetting *\/\n    0x00,                                 \/* bNumEndpoints *\/\n    USB_CLASS_AUDIO,                      \/* bInterfaceClass *\/\n    AUDIO_SUBCLASS_AUDIOSTREAMING,        \/* bInterfaceSubClass *\/\n    AUDIO_PROTOCOL_UNDEFINED,             \/* bInterfaceProtocol *\/\n    0x00,                                 \/* iInterface *\/\n\n                                          \/* Interface 1, Alternate Setting 1, Audio Streaming - Operational *\/\n    USB_INTERFACE_DESC_SIZE,              \/* bLength *\/\n    USB_INTERFACE_DESCRIPTOR_TYPE,        \/* bDescriptorType *\/\n    0x01,                                 \/* bInterfaceNumber *\/\n    0x01,                                 \/* bAlternateSetting *\/\n    0x01,                                 \/* bNumEndpoints *\/\n    USB_CLASS_AUDIO,                      \/* bInterfaceClass *\/\n    AUDIO_SUBCLASS_AUDIOSTREAMING,        \/* bInterfaceSubClass *\/\n    AUDIO_PROTOCOL_UNDEFINED,             \/* bInterfaceProtocol *\/\n    0x00,                                 \/* iInterface *\/\n\n                                          \/* Audio Streaming Interface *\/\n    AUDIO_STREAMING_INTERFACE_DESC_SIZE,  \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_STREAMING_GENERAL,              \/* bDescriptorSubtype *\/\n    0x02,                                 \/* bTerminalLink *\/\n    0x01,                                 \/* bDelay *\/\n    WBVAL(AUDIO_FORMAT_PCM),              \/* wFormatTag *\/\n\n                                          \/* Audio Type I Format *\/\n    AUDIO_FORMAT_TYPE_I_DESC_SZ(5),       \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_STREAMING_FORMAT_TYPE,          \/* bDescriptorSubtype *\/\n    AUDIO_FORMAT_TYPE_I,                  \/* bFormatType *\/\n    0x01,                                 \/* bNrChannels *\/\n    0x02,                                 \/* bSubFrameSize *\/\n    0x10,                                 \/* bBitResolution *\/\n    0x05,                                 \/* bSamFreqType *\/\n    B3VAL(8000),                          \/* tSamFreq 1 *\/\n    B3VAL(11025),                         \/* tSamFreq 2 *\/\n    B3VAL(22050),                         \/* tSamFreq 3 *\/\n    B3VAL(44100),                         \/* tSamFreq 4 *\/\n    B3VAL(48000),                         \/* tSamFreq 5 *\/\n\n                                          \/* Endpoint - Standard Descriptor *\/\n    AUDIO_STANDARD_ENDPOINT_DESC_SIZE,    \/* bLength *\/\n    USB_ENDPOINT_DESCRIPTOR_TYPE,         \/* bDescriptorType *\/\n    USB_ENDPOINT_IN(1),                   \/* bEndpointAddress *\/\n    USB_ENDPOINT_TYPE_ISOCHRONOUS\n    | USB_ENDPOINT_SYNC_ASYNCHRONOUS,     \/* bmAttributes *\/\n    WBVAL(0x0064),                        \/* wMaxPacketSize *\/\n    0x01,                                 \/* bInterval *\/\n    0x00,                                 \/* bRefresh *\/\n    0x00,                                 \/* bSynchAddress *\/\n\n                                          \/* Endpoint - Audio Streaming *\/\n    AUDIO_STREAMING_ENDPOINT_DESC_SIZE,   \/* bLength *\/\n    AUDIO_ENDPOINT_DESCRIPTOR_TYPE,       \/* bDescriptorType *\/\n    AUDIO_ENDPOINT_GENERAL,               \/* bDescriptor *\/\n    0x01,                                 \/* bmAttributes *\/\n    0x00,                                 \/* bLockDelayUnits *\/\n    WBVAL(0x0000),                        \/* wLockDelay *\/\n\n                                          \/* Interface 1, Alternate Setting 2, Audio Streaming - ? *\/\n    USB_INTERFACE_DESC_SIZE,              \/* bLength *\/\n    USB_INTERFACE_DESCRIPTOR_TYPE,        \/* bDescriptorType *\/\n    0x01,                                 \/* bInterfaceNumber *\/\n    0x02,                                 \/* bAlternateSetting *\/\n    0x01,                                 \/* bNumEndpoints *\/\n    USB_CLASS_AUDIO,                      \/* bInterfaceClass *\/\n    AUDIO_SUBCLASS_AUDIOSTREAMING,        \/* bInterfaceSubClass *\/\n    AUDIO_PROTOCOL_UNDEFINED,             \/* bInterfaceProtocol *\/\n    0x00,                                 \/* iInterface *\/\n\n                                          \/* Audio Streaming Interface *\/\n    AUDIO_STREAMING_INTERFACE_DESC_SIZE,  \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_STREAMING_GENERAL,              \/* bDescriptorSubtype *\/\n    0x02,                                 \/* bTerminalLink *\/\n    0x01,                                 \/* bDelay *\/\n    WBVAL(AUDIO_FORMAT_PCM),              \/* wFormatTag *\/\n\n                                          \/* Audio Type I Format *\/\n    AUDIO_FORMAT_TYPE_I_DESC_SZ(5),       \/* bLength *\/\n    AUDIO_INTERFACE_DESCRIPTOR_TYPE,      \/* bDescriptorType *\/\n    AUDIO_STREAMING_FORMAT_TYPE,          \/* bDescriptorSubtype *\/\n    AUDIO_FORMAT_TYPE_I,                  \/* bFormatType *\/\n    0x02,                                 \/* bNrChannels *\/\n    0x02,                                 \/* bSubFrameSize *\/\n    0x10,                                 \/* bBitResolution *\/\n    0x05,                                 \/* bSamFreqType *\/\n    B3VAL(8000),                          \/* tSamFreq 1 *\/\n    B3VAL(11025),                         \/* tSamFreq 2 *\/\n    B3VAL(22050),                         \/* tSamFreq 3 *\/\n    B3VAL(44100),                         \/* tSamFreq 4 *\/\n    B3VAL(48000),                         \/* tSamFreq 5 *\/\n\n                                          \/* Endpoint - Standard Descriptor *\/\n    AUDIO_STANDARD_ENDPOINT_DESC_SIZE,    \/* bLength *\/\n    USB_ENDPOINT_DESCRIPTOR_TYPE,         \/* bDescriptorType *\/\n    USB_ENDPOINT_IN(1),                   \/* bEndpointAddress *\/\n    USB_ENDPOINT_TYPE_ISOCHRONOUS\n    | USB_ENDPOINT_SYNC_ASYNCHRONOUS,     \/* bmAttributes *\/\n    WBVAL(0x00c8),                        \/* wMaxPacketSize *\/\n    0x01,                                 \/* bInterval *\/\n    0x00,                                 \/* bRefresh *\/\n    0x00,                                 \/* bSynchAddress *\/\n\n                                          \/* Endpoint - Audio Streaming *\/\n    AUDIO_STREAMING_ENDPOINT_DESC_SIZE,   \/* bLength *\/\n    AUDIO_ENDPOINT_DESCRIPTOR_TYPE,       \/* bDescriptorType *\/\n    AUDIO_ENDPOINT_GENERAL,               \/* bDescriptor *\/\n    0x01,                                 \/* bmAttributes *\/\n    0x00,                                 \/* bLockDelayUnits *\/\n    WBVAL(0x0000),                        \/* wLockDelay *\/\n\n                                          \/* Terminator *\/\n    0                                     \/* bLength *\/\n};\n\nstatic const USBDescStrings lt_desc_strings = {\n    \"\",\n    \"Logitech\",\n    \"USBMIC\",\n};\n\n\/\/Minified state\ntypedef struct SINGSTARMICMINIState {\n    USBDevice dev;\n\n    USBDesc desc;\n    USBDescDevice desc_dev;\n} SINGSTARMICMINIState;\n\nclass LogitechMicDevice : public SingstarDevice\n{\npublic:\n\tvirtual ~LogitechMicDevice() {}\n\tstatic USBDevice* CreateDevice(int port)\n\t{\n\t\tstd::string api;\n\t\t{\n\t\t\tCONFIGVARIANT var(N_DEVICE_API, CONFIG_TYPE_CHAR);\n\t\t\tif (LoadSetting(port, DEVICENAME, var))\n\t\t\t\tapi = var.strValue;\n\t\t}\n\n\t\tUSBDevice* dev = SingstarDevice::CreateDevice(port, api);\n\t\tif (!dev)\n\t\t\treturn NULL;\n\n\t\tSINGSTARMICMINIState *s = (SINGSTARMICMINIState *)dev;\n\t\tconst USBDescDevice *full = s->desc.full;\n\t\ts->desc = {};\n\t\ts->desc_dev = {};\n\n\t\ts->desc.str = lt_desc_strings;\n\t\ts->desc.full = &s->desc_dev;\n\n\t\tif (usb_desc_parse_dev (logitech_mic_dev_descriptor, sizeof(logitech_mic_dev_descriptor), s->desc, s->desc_dev) < 0)\n\t\t\tgoto fail;\n\t\tif (usb_desc_parse_config (logitech_mic_config_descriptor, sizeof(logitech_mic_config_descriptor), s->desc_dev) < 0)\n\t\t\tgoto fail;\n\n\t\ts->dev.klass.usb_desc       = &s->desc;\n\t\ts->dev.klass.product_desc   = lt_desc_strings[2];\n\t\tusb_desc_init(&s->dev);\n\t\treturn dev;\nfail:\n\t\ts->dev.klass.unrealize (dev);\n\t\treturn NULL;\n\t}\n\tstatic const char* TypeName()\n\t{\n\t\treturn DEVICENAME;\n\t}\n\tstatic const TCHAR* Name()\n\t{\n\t\treturn TEXT(\"Logitech USB Mic\");\n\t}\n};\n\nREGISTER_DEVICE(DEVTYPE_LOGITECH_MIC, DEVICENAME, LogitechMicDevice);\n};\n#undef DEVICENAME<|endoftext|>"}
{"text":"<commit_before>\/*-\n * Copyright (c) 2010 Benjamin Close <Benjamin.Close@clearchain.com>\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 AUTHOR AND CONTRIBUTORS ``AS IS'' AND\n * 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 AUTHOR 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\n * OR SERVICES; 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\n#include <iostream>\n#include \"VirtualCamera.h\"\n\n#define guint int\n#define guint8 const char *\n#include \"VirtualCameraDefaultImage.c\"\n\nusing namespace std;\n\nnamespace wcl\n{\n\nCameraBuffer VirtualCamera::defaultBuffer;\n\nVirtualCamera::VirtualCamera()\n{\n    if(VirtualCamera::defaultBuffer.start==NULL){\n\tVirtualCamera::defaultBuffer.start=(void *)gimp_image.pixel_data[0]; \/\/ NOTE: CONST LOST\n\tVirtualCamera::defaultBuffer.length=sizeof(gimp_image.pixel_data)\/sizeof(gimp_image.pixel_data[0]);\n    }\n\n    Camera::setFormat(Camera::RGB8,640,480);\n}\n\nVirtualCamera::~VirtualCamera()\n{}\n\nvoid VirtualCamera::printDetails()\n{\n    cout << \"WCL Virtual Camera\" << endl;\n    if ( this->buffers ){\n\tcout << \"Using Provided Frames\" << endl;\n\tcout << \"| Current Frame: \" << inUseBuffer << endl;\n\tcout << \"| Total Frames: \" << this->numBuffers << endl;\n    } else {\n\n\tcout << \"Using Default Frame\" << endl;\n    }\n}\n\nvoid VirtualCamera::setFormat(const ImageFormat f, const unsigned width, const unsigned height)\n{\n    cout << \"VirtualCamera: SetFormat Called - not Virtual Camera only supports RGB\" << endl;\n}\n\nvoid VirtualCamera::setExposureMode(const ExposureMode t)\n{\n    cout << \"VirtualCamera: Confirming Exposure Mode change \"\n\t << \"(Note: No change to the image will occur)\" << endl;\n}\n\nvoid VirtualCamera::setControlValue(const Control control, const int value)\n{\n    cout << \"VirtualCamera: Confirming control \" << control << \"Set to value \"\n\t << value << \"(Note: No change to the image will occur)\" << endl;\n}\n\nconst unsigned char* VirtualCamera::getFrame()\n{\n    if( this->buffers ){\n\tconst unsigned char *frame =\n\t   (const unsigned char *) this->buffers[this->inUseBuffer].start;\n\tthis->inUseBuffer++;\n\tif( this->inUseBuffer > this->numBuffers){\n\t    this->inUseBuffer = 0;\n\t}\n\treturn frame;\n    }\n    return (const unsigned char *)defaultBuffer.start;\n}\n\nvoid VirtualCamera::startup()\n{}\n\nvoid VirtualCamera::shutdown()\n{\n    this->buffers=NULL;\n    this->inUseBuffer=0;\n    this->numBuffers=0;\n\n    \/\/Reset the default format, size for the default image\n    Camera::setFormat(Camera::RGB8,640,480);\n}\n\n\nvoid VirtualCamera::setFrames(const CameraBuffer *buffers, const unsigned bufferCount)\n{\n    this->buffers=const_cast<CameraBuffer *>(buffers); \/\/NOTE: cost removed, though the buffer is still treated as read only internally\n    this->numBuffers = bufferCount;\n    this->inUseBuffer=0;\n}\n\n\n}; \/\/namespace wcl\n<commit_msg>camera: Support changing the virtual camera format if a buffer has been speficied<commit_after>\/*-\n * Copyright (c) 2010 Benjamin Close <Benjamin.Close@clearchain.com>\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 AUTHOR AND CONTRIBUTORS ``AS IS'' AND\n * 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 AUTHOR 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\n * OR SERVICES; 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\n#include <iostream>\n#include \"VirtualCamera.h\"\n\n#define guint int\n#define guint8 const char *\n#include \"VirtualCameraDefaultImage.c\"\n\nusing namespace std;\n\nnamespace wcl\n{\n\nCameraBuffer VirtualCamera::defaultBuffer;\n\nVirtualCamera::VirtualCamera()\n{\n    if(VirtualCamera::defaultBuffer.start==NULL){\n\tVirtualCamera::defaultBuffer.start=(void *)gimp_image.pixel_data[0]; \/\/ NOTE: CONST LOST\n\tVirtualCamera::defaultBuffer.length=sizeof(gimp_image.pixel_data)\/sizeof(gimp_image.pixel_data[0]);\n    }\n\n    Camera::setFormat(Camera::RGB8,640,480);\n}\n\nVirtualCamera::~VirtualCamera()\n{}\n\nvoid VirtualCamera::printDetails()\n{\n    cout << \"WCL Virtual Camera\" << endl;\n    if ( this->buffers ){\n\tcout << \"Using Provided Frames\" << endl;\n\tcout << \"| Current Frame: \" << inUseBuffer << endl;\n\tcout << \"| Total Frames: \" << this->numBuffers << endl;\n    } else {\n\n\tcout << \"Using Default Frame\" << endl;\n    }\n}\n\nvoid VirtualCamera::setFormat(const ImageFormat f, const unsigned width, const unsigned height)\n{\n    if( this->buffers )\n\tCamera::setFormat(f,width, height);\n\n    else\n\tcout << \"VirtualCamera:SetFormat: Virtual Camera default image only supports RGB\" << endl;\n}\n\nvoid VirtualCamera::setExposureMode(const ExposureMode t)\n{\n    cout << \"VirtualCamera: Confirming Exposure Mode change \"\n\t << \"(Note: No change to the image will occur)\" << endl;\n}\n\nvoid VirtualCamera::setControlValue(const Control control, const int value)\n{\n    cout << \"VirtualCamera: Confirming control \" << control << \"Set to value \"\n\t << value << \"(Note: No change to the image will occur)\" << endl;\n}\n\nconst unsigned char* VirtualCamera::getFrame()\n{\n    if( this->buffers ){\n\tconst unsigned char *frame =\n\t   (const unsigned char *) this->buffers[this->inUseBuffer].start;\n\tthis->inUseBuffer++;\n\tif( this->inUseBuffer > this->numBuffers){\n\t    this->inUseBuffer = 0;\n\t}\n\treturn frame;\n    }\n    return (const unsigned char *)defaultBuffer.start;\n}\n\nvoid VirtualCamera::startup()\n{}\n\nvoid VirtualCamera::shutdown()\n{\n    this->buffers=NULL;\n    this->inUseBuffer=0;\n    this->numBuffers=0;\n\n    \/\/Reset the default format, size for the default image\n    Camera::setFormat(Camera::RGB8,640,480);\n}\n\n\nvoid VirtualCamera::setFrames(const CameraBuffer *buffers, const unsigned bufferCount)\n{\n    this->buffers=const_cast<CameraBuffer *>(buffers); \/\/NOTE: cost removed, though the buffer is still treated as read only internally\n    this->numBuffers = bufferCount;\n    this->inUseBuffer=0;\n}\n\n\n}; \/\/namespace wcl\n<|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\/cpu\/ppc\/ppc_context.h\"\n\n#include <cinttypes>\n#include <cstdlib>\n\n#include \"xenia\/base\/assert.h\"\n#include \"xenia\/base\/string_util.h\"\n\nnamespace xe {\nnamespace cpu {\nnamespace ppc {\n\nuint64_t PPCContext::cr() const {\n  uint64_t final_bits = 0;\n  for (int i = 0; i < 8; ++i) {\n    uint32_t crf = *(&cr0.value + i);\n    uint64_t bits = (crf & 0x1) << (4 * (7 - i) + 3) |\n                    ((crf >> 8) & 0x1) << (4 * (7 - i) + 2) |\n                    ((crf >> 16) & 0x1) << (4 * (7 - i) + 1) |\n                    ((crf >> 24) & 0x1) << (4 * (7 - i) + 0);\n    final_bits |= bits << (i * 4);\n  }\n  return final_bits;\n}\n\nvoid PPCContext::set_cr(uint64_t value) {\n  assert_always(\"not yet implemented\");\n}\n\nstd::string PPCContext::GetRegisterName(PPCRegister reg) {\n  switch (reg) {\n    case PPCRegister::kLR:\n      return \"lr\";\n    case PPCRegister::kCTR:\n      return \"ctr\";\n    case PPCRegister::kXER:\n      return \"xer\";\n    case PPCRegister::kFPSCR:\n      return \"fpscr\";\n    case PPCRegister::kVSCR:\n      return \"vscr\";\n    case PPCRegister::kCR:\n      return \"cr\";\n    default:\n      if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kR0) &&\n          static_cast<int>(reg) <= static_cast<int>(PPCRegister::kR31)) {\n        return std::string(\"r\") +\n               std::to_string(static_cast<int>(reg) -\n                              static_cast<int>(PPCRegister::kR0));\n      } else if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kFR0) &&\n                 static_cast<int>(reg) <=\n                     static_cast<int>(PPCRegister::kFR31)) {\n        return std::string(\"fr\") +\n               std::to_string(static_cast<int>(reg) -\n                              static_cast<int>(PPCRegister::kFR0));\n      } else if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kVR0) &&\n                 static_cast<int>(reg) <=\n                     static_cast<int>(PPCRegister::kVR128)) {\n        return std::string(\"vr\") +\n               std::to_string(static_cast<int>(reg) -\n                              static_cast<int>(PPCRegister::kVR0));\n      } else {\n        assert_unhandled_case(reg);\n        return \"?\";\n      }\n  }\n}\n\nstd::string PPCContext::GetStringFromValue(PPCRegister reg) const {\n  switch (reg) {\n    case PPCRegister::kLR:\n      return string_util::to_hex_string(lr);\n    case PPCRegister::kCTR:\n      return string_util::to_hex_string(ctr);\n    case PPCRegister::kXER:\n      \/\/ return Int64ToHex(xer_ca);\n      return \"?\";\n    case PPCRegister::kFPSCR:\n      \/\/ return Int64ToHex(fpscr);\n      return \"?\";\n    case PPCRegister::kVSCR:\n      \/\/ return Int64ToHex(vscr_sat);\n      return \"?\";\n    case PPCRegister::kCR:\n      \/\/ return Int64ToHex(cr);\n      return \"?\";\n    default:\n      if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kR0) &&\n          static_cast<int>(reg) <= static_cast<int>(PPCRegister::kR31)) {\n        return string_util::to_hex_string(\n            r[static_cast<int>(reg) - static_cast<int>(PPCRegister::kR0)]);\n      } else if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kFR0) &&\n                 static_cast<int>(reg) <=\n                     static_cast<int>(PPCRegister::kFR31)) {\n        return string_util::to_hex_string(\n            f[static_cast<int>(reg) - static_cast<int>(PPCRegister::kFR0)]);\n      } else if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kVR0) &&\n                 static_cast<int>(reg) <=\n                     static_cast<int>(PPCRegister::kVR128)) {\n        return string_util::to_hex_string(\n            v[static_cast<int>(reg) - static_cast<int>(PPCRegister::kVR0)]);\n      } else {\n        assert_unhandled_case(reg);\n        return \"\";\n      }\n  }\n}\n\nvoid PPCContext::SetValueFromString(PPCRegister reg, std::string value) {\n  \/\/ TODO(benvanik): set value from string to replace SetRegFromString?\n  assert_always(false);\n}\n\nvoid PPCContext::SetRegFromString(const char* name, const char* value) {\n  int n;\n  if (sscanf(name, \"r%d\", &n) == 1) {\n    this->r[n] = string_util::from_string<uint64_t>(value);\n  } else if (sscanf(name, \"f%d\", &n) == 1) {\n    this->f[n] = string_util::from_string<double>(value);\n  } else if (sscanf(name, \"v%d\", &n) == 1) {\n    this->v[n] = string_util::from_string<vec128_t>(value);\n  } else if (std::strcmp(name, \"cr\") == 0) {\n    this->set_cr(string_util::from_string<uint64_t>(value));\n  } else {\n    printf(\"Unrecognized register name: %s\\n\", name);\n  }\n}\n\nbool PPCContext::CompareRegWithString(const char* name, const char* value,\n                                      char* out_value,\n                                      size_t out_value_size) const {\n  int n;\n  if (sscanf(name, \"r%d\", &n) == 1) {\n    uint64_t expected = string_util::from_string<uint64_t>(value);\n    if (this->r[n] != expected) {\n      std::snprintf(out_value, out_value_size, \"%016\" PRIX64, this->r[n]);\n      return false;\n    }\n    return true;\n  } else if (sscanf(name, \"f%d\", &n) == 1) {\n    if (std::strstr(value, \"0x\")) {\n      \/\/ Special case: Treat float as integer.\n      uint64_t expected = string_util::from_string<uint64_t>(value, true);\n\n      union {\n        double f;\n        uint64_t u;\n      } f2u;\n      f2u.f = this->f[n];\n\n      if (f2u.u != expected) {\n        std::snprintf(out_value, out_value_size, \"%016\" PRIX64, f2u.u);\n        return false;\n      }\n    } else {\n      double expected = string_util::from_string<double>(value);\n\n      \/\/ TODO(benvanik): epsilon\n      if (this->f[n] != expected) {\n        std::snprintf(out_value, out_value_size, \"%f\", this->f[n]);\n        return false;\n      }\n    }\n    return true;\n  } else if (sscanf(name, \"v%d\", &n) == 1) {\n    vec128_t expected = string_util::from_string<vec128_t>(value);\n    if (this->v[n] != expected) {\n      std::snprintf(out_value, out_value_size, \"[%.8X, %.8X, %.8X, %.8X]\",\n                    this->v[n].i32[0], this->v[n].i32[1], this->v[n].i32[2],\n                    this->v[n].i32[3]);\n      return false;\n    }\n    return true;\n  } else if (std::strcmp(name, \"cr\") == 0) {\n    uint64_t actual = this->cr();\n    uint64_t expected = string_util::from_string<uint64_t>(value);\n    if (actual != expected) {\n      std::snprintf(out_value, out_value_size, \"%016\" PRIX64, actual);\n      return false;\n    }\n    return true;\n  } else {\n    assert_always(\"Unrecognized register name: %s\\n\", name);\n    return false;\n  }\n}\n\n}  \/\/ namespace ppc\n}  \/\/ namespace cpu\n}  \/\/ namespace xe\n<commit_msg>Fixed PPCContext::cr() returning incorrectly shifted state.<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\/cpu\/ppc\/ppc_context.h\"\n\n#include <cinttypes>\n#include <cstdlib>\n\n#include \"xenia\/base\/assert.h\"\n#include \"xenia\/base\/string_util.h\"\n\nnamespace xe {\nnamespace cpu {\nnamespace ppc {\n\nuint64_t PPCContext::cr() const {\n  uint64_t final_bits = 0;\n  for (int i = 0; i < 8; ++i) {\n    union {\n      uint32_t value;\n      struct {\n        uint8_t lt;\n        uint8_t gt;\n        uint8_t eq;\n        uint8_t so;\n      };\n    } crf;\n    crf.value = *(&cr0.value + i);\n    uint64_t bits = (crf.lt & 0x1) << 3 | (crf.gt & 0x1) << 2 |\n                    (crf.eq & 0x1) << 1 | (crf.so & 0x1) << 0;\n    final_bits |= bits << ((7 - i) * 4);\n  }\n  return final_bits;\n}\n\nvoid PPCContext::set_cr(uint64_t value) {\n  assert_always(\"not yet implemented\");\n}\n\nstd::string PPCContext::GetRegisterName(PPCRegister reg) {\n  switch (reg) {\n    case PPCRegister::kLR:\n      return \"lr\";\n    case PPCRegister::kCTR:\n      return \"ctr\";\n    case PPCRegister::kXER:\n      return \"xer\";\n    case PPCRegister::kFPSCR:\n      return \"fpscr\";\n    case PPCRegister::kVSCR:\n      return \"vscr\";\n    case PPCRegister::kCR:\n      return \"cr\";\n    default:\n      if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kR0) &&\n          static_cast<int>(reg) <= static_cast<int>(PPCRegister::kR31)) {\n        return std::string(\"r\") +\n               std::to_string(static_cast<int>(reg) -\n                              static_cast<int>(PPCRegister::kR0));\n      } else if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kFR0) &&\n                 static_cast<int>(reg) <=\n                     static_cast<int>(PPCRegister::kFR31)) {\n        return std::string(\"fr\") +\n               std::to_string(static_cast<int>(reg) -\n                              static_cast<int>(PPCRegister::kFR0));\n      } else if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kVR0) &&\n                 static_cast<int>(reg) <=\n                     static_cast<int>(PPCRegister::kVR128)) {\n        return std::string(\"vr\") +\n               std::to_string(static_cast<int>(reg) -\n                              static_cast<int>(PPCRegister::kVR0));\n      } else {\n        assert_unhandled_case(reg);\n        return \"?\";\n      }\n  }\n}\n\nstd::string PPCContext::GetStringFromValue(PPCRegister reg) const {\n  switch (reg) {\n    case PPCRegister::kLR:\n      return string_util::to_hex_string(lr);\n    case PPCRegister::kCTR:\n      return string_util::to_hex_string(ctr);\n    case PPCRegister::kXER:\n      \/\/ return Int64ToHex(xer_ca);\n      return \"?\";\n    case PPCRegister::kFPSCR:\n      \/\/ return Int64ToHex(fpscr);\n      return \"?\";\n    case PPCRegister::kVSCR:\n      \/\/ return Int64ToHex(vscr_sat);\n      return \"?\";\n    case PPCRegister::kCR:\n      \/\/ return Int64ToHex(cr);\n      return \"?\";\n    default:\n      if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kR0) &&\n          static_cast<int>(reg) <= static_cast<int>(PPCRegister::kR31)) {\n        return string_util::to_hex_string(\n            r[static_cast<int>(reg) - static_cast<int>(PPCRegister::kR0)]);\n      } else if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kFR0) &&\n                 static_cast<int>(reg) <=\n                     static_cast<int>(PPCRegister::kFR31)) {\n        return string_util::to_hex_string(\n            f[static_cast<int>(reg) - static_cast<int>(PPCRegister::kFR0)]);\n      } else if (static_cast<int>(reg) >= static_cast<int>(PPCRegister::kVR0) &&\n                 static_cast<int>(reg) <=\n                     static_cast<int>(PPCRegister::kVR128)) {\n        return string_util::to_hex_string(\n            v[static_cast<int>(reg) - static_cast<int>(PPCRegister::kVR0)]);\n      } else {\n        assert_unhandled_case(reg);\n        return \"\";\n      }\n  }\n}\n\nvoid PPCContext::SetValueFromString(PPCRegister reg, std::string value) {\n  \/\/ TODO(benvanik): set value from string to replace SetRegFromString?\n  assert_always(false);\n}\n\nvoid PPCContext::SetRegFromString(const char* name, const char* value) {\n  int n;\n  if (sscanf(name, \"r%d\", &n) == 1) {\n    this->r[n] = string_util::from_string<uint64_t>(value);\n  } else if (sscanf(name, \"f%d\", &n) == 1) {\n    this->f[n] = string_util::from_string<double>(value);\n  } else if (sscanf(name, \"v%d\", &n) == 1) {\n    this->v[n] = string_util::from_string<vec128_t>(value);\n  } else if (std::strcmp(name, \"cr\") == 0) {\n    this->set_cr(string_util::from_string<uint64_t>(value));\n  } else {\n    printf(\"Unrecognized register name: %s\\n\", name);\n  }\n}\n\nbool PPCContext::CompareRegWithString(const char* name, const char* value,\n                                      char* out_value,\n                                      size_t out_value_size) const {\n  int n;\n  if (sscanf(name, \"r%d\", &n) == 1) {\n    uint64_t expected = string_util::from_string<uint64_t>(value);\n    if (this->r[n] != expected) {\n      std::snprintf(out_value, out_value_size, \"%016\" PRIX64, this->r[n]);\n      return false;\n    }\n    return true;\n  } else if (sscanf(name, \"f%d\", &n) == 1) {\n    if (std::strstr(value, \"0x\")) {\n      \/\/ Special case: Treat float as integer.\n      uint64_t expected = string_util::from_string<uint64_t>(value, true);\n\n      union {\n        double f;\n        uint64_t u;\n      } f2u;\n      f2u.f = this->f[n];\n\n      if (f2u.u != expected) {\n        std::snprintf(out_value, out_value_size, \"%016\" PRIX64, f2u.u);\n        return false;\n      }\n    } else {\n      double expected = string_util::from_string<double>(value);\n\n      \/\/ TODO(benvanik): epsilon\n      if (this->f[n] != expected) {\n        std::snprintf(out_value, out_value_size, \"%f\", this->f[n]);\n        return false;\n      }\n    }\n    return true;\n  } else if (sscanf(name, \"v%d\", &n) == 1) {\n    vec128_t expected = string_util::from_string<vec128_t>(value);\n    if (this->v[n] != expected) {\n      std::snprintf(out_value, out_value_size, \"[%.8X, %.8X, %.8X, %.8X]\",\n                    this->v[n].i32[0], this->v[n].i32[1], this->v[n].i32[2],\n                    this->v[n].i32[3]);\n      return false;\n    }\n    return true;\n  } else if (std::strcmp(name, \"cr\") == 0) {\n    uint64_t actual = this->cr();\n    uint64_t expected = string_util::from_string<uint64_t>(value);\n    if (actual != expected) {\n      std::snprintf(out_value, out_value_size, \"%016\" PRIX64, actual);\n      return false;\n    }\n    return true;\n  } else {\n    assert_always(\"Unrecognized register name: %s\\n\", name);\n    return false;\n  }\n}\n\n}  \/\/ namespace ppc\n}  \/\/ namespace cpu\n}  \/\/ namespace xe\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_PRIM_META_REF_TYPE_HPP\n#define STAN_MATH_PRIM_META_REF_TYPE_HPP\n\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/meta\/is_eigen.hpp>\n#include <stan\/math\/prim\/meta\/is_eigen_map_base.hpp>\n#include <stan\/math\/prim\/meta\/is_arena_matrix.hpp>\n#include <stan\/math\/prim\/meta\/is_vector.hpp>\n#include <stan\/math\/prim\/meta\/plain_type.hpp>\n\n#include <type_traits>\n\nnamespace stan {\n\n\/**\n * If the condition is true determines appropriate type for assigning expression\n * of given type to, to evaluate expensive expressions, but not make a copy if T\n * involves no calculations. This works similarly as `Eigen::Ref`. It also\n * handles rvalue references, so it can be used with perfect forwarding. If the\n * condition is false the expression will never be evaluated.\n *\n * Warning: if a variable of this type could be assigned a rvalue, make sure\n * template parameter `T` is of correct reference type (rvalue).\n * @tparam T type to determine reference for\n *\/\ntemplate <bool Condition, typename T, typename = void>\nstruct ref_type_if {\n  using T_plain = plain_type_t<T>;\n  using T_optionally_ref\n      = std::conditional_t<std::is_rvalue_reference<T>::value,\n                           std::remove_reference_t<T>, const T&>;\n  using type = std::conditional_t<\n      Eigen::internal::traits<Eigen::Ref<std::decay_t<T_plain>>>::\n              template match<std::decay_t<T>>::MatchAtCompileTime\n          || !Condition,\n      T_optionally_ref, T_plain>;\n};\n\ntemplate <bool Condition, typename T>\nstruct ref_type_if<Condition, T, require_not_eigen_t<T>> {\n  using type = std::conditional_t<std::is_rvalue_reference<T>::value,\n                                  std::remove_reference_t<T>, const T&>;\n};\n\ntemplate <bool Condition, typename T>\nstruct ref_type_if<Condition, T, require_eigen_map_base_t<T>> {\n  using type = std::conditional_t<std::is_rvalue_reference<T>::value,\n                                  std::remove_reference_t<T>, const T&>;\n};\n\ntemplate <typename T>\nusing ref_type_t = typename ref_type_if<true, T>::type;\n\ntemplate <bool Condition, typename T>\nusing ref_type_if_t = typename ref_type_if<Condition, T>::type;\n\n\/**\n * Determines appropriate type for assigning expression of given type to, so\n * that the resulting type has directly accessible contiguous colum-major data,\n * which is needed to copy to OpenCL device for construction of matrix_cl.\n *\n * THis is similar to `ref_type` except this also copies expressions, which do\n * not have contiguous data (in both dimensions) or have row major storage\n * order.\n *\n * Warning: if a variable of this type could be assigned a rvalue, make sure\n * template parameter `T` is of correct reference type (rvalue).\n * @tparam T type to determine reference for\n *\/\ntemplate <typename T, typename = void>\nstruct ref_type_for_opencl {\n  using T_val = std::remove_reference_t<T>;\n  using T_plain_col_major = std::conditional_t<\n      std::is_same<typename Eigen::internal::traits<T_val>::XprKind,\n                   Eigen::MatrixXpr>::value,\n      Eigen::Matrix<value_type_t<T>, T_val::RowsAtCompileTime,\n                    T_val::ColsAtCompileTime>,\n      Eigen::Array<value_type_t<T>, T_val::RowsAtCompileTime,\n                   T_val::ColsAtCompileTime>>;\n  using T_optionally_ref\n      = std::conditional_t<std::is_rvalue_reference<T>::value, T_val, const T&>;\n  \/\/ Setting Outer stride of Ref to 0 (default) won't actually check that\n  \/\/ expression has contiguous outer stride. Instead we need to check that\n  \/\/ evaluator flags contain LinearAccessBit and PacketAccessBit.\n  using type = std::conditional_t<\n      Eigen::internal::traits<Eigen::Ref<std::decay_t<T_plain_col_major>>>::\n              template match<T_val>::MatchAtCompileTime\n          && (Eigen::internal::evaluator<T_val>::Flags & Eigen::LinearAccessBit)\n          && (Eigen::internal::evaluator<T_val>::Flags\n              & Eigen::PacketAccessBit),\n      T_optionally_ref, T_plain_col_major>;\n};\n\ntemplate <typename T>\nstruct ref_type_for_opencl<T, require_not_eigen_t<T>> {\n  using type = std::conditional_t<std::is_rvalue_reference<T>::value,\n                                  std::remove_reference_t<T>, const T&>;\n};\n\ntemplate <typename T>\nstruct ref_type_for_opencl<T, require_eigen_map_base_t<T>> {\n  using type = std::conditional_t<std::is_rvalue_reference<T>::value,\n                                  std::remove_reference_t<T>, const T&>;\n};\n\ntemplate <typename T>\nusing ref_type_for_opencl_t = typename ref_type_for_opencl<T>::type;\n\n}  \/\/ namespace stan\n\n#endif\n<commit_msg>add specialization for arena_matrix that uses Eigen::Map<> underneath<commit_after>#ifndef STAN_MATH_PRIM_META_REF_TYPE_HPP\n#define STAN_MATH_PRIM_META_REF_TYPE_HPP\n\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/meta\/is_eigen.hpp>\n#include <stan\/math\/prim\/meta\/is_eigen_map_base.hpp>\n#include <stan\/math\/prim\/meta\/is_arena_matrix.hpp>\n#include <stan\/math\/prim\/meta\/is_vector.hpp>\n#include <stan\/math\/prim\/meta\/plain_type.hpp>\n\n#include <type_traits>\n\nnamespace stan {\n\n\/**\n * If the condition is true determines appropriate type for assigning expression\n * of given type to, to evaluate expensive expressions, but not make a copy if T\n * involves no calculations. This works similarly as `Eigen::Ref`. It also\n * handles rvalue references, so it can be used with perfect forwarding. If the\n * condition is false the expression will never be evaluated.\n *\n * Warning: if a variable of this type could be assigned a rvalue, make sure\n * template parameter `T` is of correct reference type (rvalue).\n * @tparam T type to determine reference for\n *\/\ntemplate <bool Condition, typename T, typename = void>\nstruct ref_type_if {\n  using T_plain = plain_type_t<T>;\n  using T_optionally_ref\n      = std::conditional_t<std::is_rvalue_reference<T>::value,\n                           std::remove_reference_t<T>, const T&>;\n  using type = std::conditional_t<\n      Eigen::internal::traits<Eigen::Ref<std::decay_t<T_plain>>>::\n              template match<std::decay_t<T>>::MatchAtCompileTime\n          || !Condition,\n      T_optionally_ref, T_plain>;\n};\n\ntemplate <bool Condition, typename T>\nstruct ref_type_if<Condition, T, require_not_eigen_t<T>> {\n  using type = std::conditional_t<std::is_rvalue_reference<T>::value,\n                                  std::remove_reference_t<T>, const T&>;\n};\n\ntemplate <bool Condition, typename T>\nstruct ref_type_if<Condition, T, require_arena_matrix_t<T>> {\n  using type = typename ref_type_if<Condition, Eigen::Map<typename std::decay_t<T>::MatrixType>>::type;\n};\n\ntemplate <typename T>\nusing ref_type_t = typename ref_type_if<true, T>::type;\n\ntemplate <bool Condition, typename T>\nusing ref_type_if_t = typename ref_type_if<Condition, T>::type;\n\n\/**\n * Determines appropriate type for assigning expression of given type to, so\n * that the resulting type has directly accessible contiguous colum-major data,\n * which is needed to copy to OpenCL device for construction of matrix_cl.\n *\n * THis is similar to `ref_type` except this also copies expressions, which do\n * not have contiguous data (in both dimensions) or have row major storage\n * order.\n *\n * Warning: if a variable of this type could be assigned a rvalue, make sure\n * template parameter `T` is of correct reference type (rvalue).\n * @tparam T type to determine reference for\n *\/\ntemplate <typename T, typename = void>\nstruct ref_type_for_opencl {\n  using T_val = std::remove_reference_t<T>;\n  using T_plain_col_major = std::conditional_t<\n      std::is_same<typename Eigen::internal::traits<T_val>::XprKind,\n                   Eigen::MatrixXpr>::value,\n      Eigen::Matrix<value_type_t<T>, T_val::RowsAtCompileTime,\n                    T_val::ColsAtCompileTime>,\n      Eigen::Array<value_type_t<T>, T_val::RowsAtCompileTime,\n                   T_val::ColsAtCompileTime>>;\n  using T_optionally_ref\n      = std::conditional_t<std::is_rvalue_reference<T>::value, T_val, const T&>;\n  \/\/ Setting Outer stride of Ref to 0 (default) won't actually check that\n  \/\/ expression has contiguous outer stride. Instead we need to check that\n  \/\/ evaluator flags contain LinearAccessBit and PacketAccessBit.\n  using type = std::conditional_t<\n      Eigen::internal::traits<Eigen::Ref<std::decay_t<T_plain_col_major>>>::\n              template match<T_val>::MatchAtCompileTime\n          && (Eigen::internal::evaluator<T_val>::Flags & Eigen::LinearAccessBit)\n          && (Eigen::internal::evaluator<T_val>::Flags\n              & Eigen::PacketAccessBit),\n      T_optionally_ref, T_plain_col_major>;\n};\n\ntemplate <typename T>\nstruct ref_type_for_opencl<T, require_not_eigen_t<T>> {\n  using type = std::conditional_t<std::is_rvalue_reference<T>::value,\n                                  std::remove_reference_t<T>, const T&>;\n};\n\ntemplate <typename T>\nstruct ref_type_for_opencl<T, require_arena_matrix_t<T>> {\n  using type = typename ref_type_for_opencl<Eigen::Map<typename std::decay_t<T>::MatrixType>>::type;\n};\n\ntemplate <typename T>\nusing ref_type_for_opencl_t = typename ref_type_for_opencl<T>::type;\n\n}  \/\/ namespace stan\n\n#endif\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    KeyValueFileParser.cpp\n  \\author  Jens Krueger\n           SCI Institute\n           University of Utah\n  \\date    September 2008\n*\/\n\n#include \"KeyValueFileParser.h\"\n\n#include <algorithm>\n#include <fstream>\n#include <functional>\n#include <Basics\/SysTools.h>\n\nusing namespace std;\nusing namespace SysTools;\n\nKeyValPair::KeyValPair() : \n  strKey(\"\"),\n  wstrKey(L\"\"),\n  strKeyUpper(\"\"),\n  wstrKeyUpper(L\"\"),\n  strValue(\"\"),\n  wstrValue(L\"\"),\n  strValueUpper(\"\"),\n  wstrValueUpper(L\"\")\n{}\n\nKeyValPair::KeyValPair(const string& key, const string& value) :\n  strKey(key),\n  wstrKey(key.begin(), key.end()),\n\n  strValue(value),\n  wstrValue(value.begin(), value.end())\n{\n  vstrValue = Tokenize(value);\n  for (size_t i = 0;i<vstrValue.size();i++) {\n    vwstrValue.push_back(wstring(vstrValue[i].begin(), vstrValue[i].end()));\n  }    \n  FillDerivedData();\n}\n\nKeyValPair::KeyValPair(const wstring& key, const wstring& value) :\n  strKey(key.begin(), key.end()),\n  wstrKey(key),\n\n  strValue(value.begin(), value.end()),\n  wstrValue(value)\n{\n  vwstrValue = Tokenize(value);\n  for (size_t i = 0;i<vwstrValue.size();i++) {\n    vstrValue.push_back(string(vwstrValue[i].begin(), vwstrValue[i].end()));\n  }\n  FillDerivedData();\n}\n\nvoid KeyValPair::FillDerivedData() {\n  int    _iValue;\n  UINT32 _uiValue;\n  float  _fValue;\n\n\n  for (size_t i = 0;i<vwstrValue.size();i++) {\n    if (FromString(_iValue, vstrValue[i])) \n      viValue.push_back(_iValue);\n    else \n      viValue.push_back(0);\n\n    if (FromString(_uiValue, vstrValue[i])) \n      vuiValue.push_back(_uiValue);\n    else \n      vuiValue.push_back(0);\n\n    if (FromString(_fValue, vstrValue[i])) \n      vfValue.push_back(_fValue);\n    else \n      vfValue.push_back(0.0f);\n  }\n\n  if (vwstrValue.size() > 0) {\n    iValue  = viValue[0];\n    uiValue = vuiValue[0];\n    fValue  = vfValue[0];\n  } else {\n    iValue  = 0;\n    uiValue = 0;\n    fValue  = 0.0f;\n  }\n\n  strKeyUpper  = ToUpperCase(strKey);\n  wstrKeyUpper = ToUpperCase(wstrKey);\n  strValueUpper  = ToUpperCase(strValue);\n  wstrValueUpper  = ToUpperCase(wstrValue);\n}\n\n\nKeyValueFileParser::KeyValueFileParser(const string& strFilename, bool bStopOnEmptyLine, const string& strToken, const std::string& strEndToken)\n{\n  m_bFileReadable = ParseFile(strFilename, bStopOnEmptyLine, strToken, strEndToken);\n}\n\nKeyValueFileParser::KeyValueFileParser(const wstring& wstrFilename, bool bStopOnEmptyLine, const wstring& wstrToken, const std::wstring& wstrEndToken)\n{\n  string strFilename(wstrFilename.begin(), wstrFilename.end());\n  string strToken(wstrToken.begin(), wstrToken.end());\n  string strEndToken(wstrEndToken.begin(), wstrEndToken.end());\n  \n  m_bFileReadable = ParseFile(strFilename, bStopOnEmptyLine, strToken, strEndToken);\n}\n\nKeyValueFileParser::~KeyValueFileParser()\n{\n}\n\nKeyValPair* KeyValueFileParser::GetData(const string&  strKey, const bool bCaseSensitive) {\n  if (!bCaseSensitive) {\n    string upperKey(strKey);\n    transform(upperKey.begin(), upperKey.end(), upperKey.begin(), ::toupper);\n    for (UINT32 i = 0;i<m_vecTokens.size();i++) if (m_vecTokens[i].strKeyUpper == upperKey) return &m_vecTokens[i];\n  } else {\n    for (UINT32 i = 0;i<m_vecTokens.size();i++) if (m_vecTokens[i].strKey == strKey) return &m_vecTokens[i];\n  }\n  return NULL;\n}\n\nKeyValPair* KeyValueFileParser::GetData(const wstring& wstrKey, const bool bCaseSensitive) {\n  if (!bCaseSensitive) {\n    wstring wupperKey(wstrKey);\n    transform(wupperKey.begin(), wupperKey.end(), wupperKey.begin(), ::toupper);\n    for (UINT32 i = 0;i<m_vecTokens.size();i++) if (m_vecTokens[i].wstrKeyUpper == wupperKey) return &m_vecTokens[i];\n  } else {\n    for (UINT32 i = 0;i<m_vecTokens.size();i++) if (m_vecTokens[i].wstrKey == wstrKey) return &m_vecTokens[i];\n  }\n  return NULL;\n}\n\nstruct matching_keys : public std::binary_function<std::string,\n                                                   KeyValPair,\n                                                   bool> {\n  bool operator()(const std::string &key, const KeyValPair &kv) const {\n    return key == kv.strKey;\n  }\n};\n\nconst KeyValPair* KeyValueFileParser::GetData(const std::string& strKey,\n                                              const bool bCaseSensitive) const\n{\n  std::string key(strKey);\n  if(!bCaseSensitive) {\n    std::transform(key.begin(), key.end(), key.begin(), ::toupper);\n  }\n\n  std::vector<KeyValPair>::const_iterator iter;\n  iter = std::find_if(m_vecTokens.begin(), m_vecTokens.end(),\n                      std::bind1st(matching_keys(), key));\n\n  if(iter == m_vecTokens.end()) {\n    return NULL;\n  }\n  return &(*iter);\n}\n\n\nbool KeyValueFileParser::ParseFile(const std::string& strFilename, bool bStopOnEmptyLine, const std::string& strToken, const std::string& strEndToken) {\n  string line;\n  ifstream fileData(strFilename.c_str(),ios::binary);  \n\n  m_iStopPos = 0;\n  if (fileData.is_open())\n  {\n    while (! fileData.eof() )\n    {\n      getline (fileData,line);\n      RemoveLeadingWhitespace(line);\n\n      \/\/ remove windows line endings\n      if (line.length() > 0 && line[line.length()-1] == 13) \n        line = line.substr(0,line.length()-1);\n\n      if ((strEndToken != \"\" && strEndToken == line) ||\n          (bStopOnEmptyLine && line.empty()))  {\n        m_iStopPos = fileData.tellg();\n        break;\n      }\n\n      if (line[0] == '#') continue;        \/\/ skip comments\n      if (line.find_first_of(strToken) == string::npos) continue;  \/\/ skip invalid lines\n\n      string strKey = line.substr(0, line.find_first_of(strToken));\n      RemoveTailingWhitespace(strKey);\n\n      line = line.substr(line.find_first_of(strToken)+strToken.length(), line.length());\n      RemoveLeadingWhitespace(line);\n      RemoveTailingWhitespace(line);\n\n      if (strKey.length() == 0 || line.length() == 0) continue;\n\n      KeyValPair newKey(strKey, line);\n      m_vecTokens.push_back(newKey);\n    }\n    fileData.close();\n  } else return false;\n\n  return true;\n}\n<commit_msg>Remove EOL whitespace.<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    KeyValueFileParser.cpp\n  \\author  Jens Krueger\n           SCI Institute\n           University of Utah\n  \\date    September 2008\n*\/\n\n#include \"KeyValueFileParser.h\"\n\n#include <algorithm>\n#include <fstream>\n#include <functional>\n#include <Basics\/SysTools.h>\n\nusing namespace std;\nusing namespace SysTools;\n\nKeyValPair::KeyValPair() :\n  strKey(\"\"),\n  wstrKey(L\"\"),\n  strKeyUpper(\"\"),\n  wstrKeyUpper(L\"\"),\n  strValue(\"\"),\n  wstrValue(L\"\"),\n  strValueUpper(\"\"),\n  wstrValueUpper(L\"\")\n{}\n\nKeyValPair::KeyValPair(const string& key, const string& value) :\n  strKey(key),\n  wstrKey(key.begin(), key.end()),\n\n  strValue(value),\n  wstrValue(value.begin(), value.end())\n{\n  vstrValue = Tokenize(value);\n  for (size_t i = 0;i<vstrValue.size();i++) {\n    vwstrValue.push_back(wstring(vstrValue[i].begin(), vstrValue[i].end()));\n  }\n  FillDerivedData();\n}\n\nKeyValPair::KeyValPair(const wstring& key, const wstring& value) :\n  strKey(key.begin(), key.end()),\n  wstrKey(key),\n\n  strValue(value.begin(), value.end()),\n  wstrValue(value)\n{\n  vwstrValue = Tokenize(value);\n  for (size_t i = 0;i<vwstrValue.size();i++) {\n    vstrValue.push_back(string(vwstrValue[i].begin(), vwstrValue[i].end()));\n  }\n  FillDerivedData();\n}\n\nvoid KeyValPair::FillDerivedData() {\n  int    _iValue;\n  UINT32 _uiValue;\n  float  _fValue;\n\n\n  for (size_t i = 0;i<vwstrValue.size();i++) {\n    if (FromString(_iValue, vstrValue[i]))\n      viValue.push_back(_iValue);\n    else\n      viValue.push_back(0);\n\n    if (FromString(_uiValue, vstrValue[i]))\n      vuiValue.push_back(_uiValue);\n    else\n      vuiValue.push_back(0);\n\n    if (FromString(_fValue, vstrValue[i]))\n      vfValue.push_back(_fValue);\n    else\n      vfValue.push_back(0.0f);\n  }\n\n  if (vwstrValue.size() > 0) {\n    iValue  = viValue[0];\n    uiValue = vuiValue[0];\n    fValue  = vfValue[0];\n  } else {\n    iValue  = 0;\n    uiValue = 0;\n    fValue  = 0.0f;\n  }\n\n  strKeyUpper  = ToUpperCase(strKey);\n  wstrKeyUpper = ToUpperCase(wstrKey);\n  strValueUpper  = ToUpperCase(strValue);\n  wstrValueUpper  = ToUpperCase(wstrValue);\n}\n\n\nKeyValueFileParser::KeyValueFileParser(const string& strFilename, bool bStopOnEmptyLine, const string& strToken, const std::string& strEndToken)\n{\n  m_bFileReadable = ParseFile(strFilename, bStopOnEmptyLine, strToken, strEndToken);\n}\n\nKeyValueFileParser::KeyValueFileParser(const wstring& wstrFilename, bool bStopOnEmptyLine, const wstring& wstrToken, const std::wstring& wstrEndToken)\n{\n  string strFilename(wstrFilename.begin(), wstrFilename.end());\n  string strToken(wstrToken.begin(), wstrToken.end());\n  string strEndToken(wstrEndToken.begin(), wstrEndToken.end());\n\n  m_bFileReadable = ParseFile(strFilename, bStopOnEmptyLine, strToken, strEndToken);\n}\n\nKeyValueFileParser::~KeyValueFileParser()\n{\n}\n\nKeyValPair* KeyValueFileParser::GetData(const string&  strKey, const bool bCaseSensitive) {\n  if (!bCaseSensitive) {\n    string upperKey(strKey);\n    transform(upperKey.begin(), upperKey.end(), upperKey.begin(), ::toupper);\n    for (UINT32 i = 0;i<m_vecTokens.size();i++) if (m_vecTokens[i].strKeyUpper == upperKey) return &m_vecTokens[i];\n  } else {\n    for (UINT32 i = 0;i<m_vecTokens.size();i++) if (m_vecTokens[i].strKey == strKey) return &m_vecTokens[i];\n  }\n  return NULL;\n}\n\nKeyValPair* KeyValueFileParser::GetData(const wstring& wstrKey, const bool bCaseSensitive) {\n  if (!bCaseSensitive) {\n    wstring wupperKey(wstrKey);\n    transform(wupperKey.begin(), wupperKey.end(), wupperKey.begin(), ::toupper);\n    for (UINT32 i = 0;i<m_vecTokens.size();i++) if (m_vecTokens[i].wstrKeyUpper == wupperKey) return &m_vecTokens[i];\n  } else {\n    for (UINT32 i = 0;i<m_vecTokens.size();i++) if (m_vecTokens[i].wstrKey == wstrKey) return &m_vecTokens[i];\n  }\n  return NULL;\n}\n\nstruct matching_keys : public std::binary_function<std::string,\n                                                   KeyValPair,\n                                                   bool> {\n  bool operator()(const std::string &key, const KeyValPair &kv) const {\n    return key == kv.strKey;\n  }\n};\n\nconst KeyValPair* KeyValueFileParser::GetData(const std::string& strKey,\n                                              const bool bCaseSensitive) const\n{\n  std::string key(strKey);\n  if(!bCaseSensitive) {\n    std::transform(key.begin(), key.end(), key.begin(), ::toupper);\n  }\n\n  std::vector<KeyValPair>::const_iterator iter;\n  iter = std::find_if(m_vecTokens.begin(), m_vecTokens.end(),\n                      std::bind1st(matching_keys(), key));\n\n  if(iter == m_vecTokens.end()) {\n    return NULL;\n  }\n  return &(*iter);\n}\n\n\nbool KeyValueFileParser::ParseFile(const std::string& strFilename, bool bStopOnEmptyLine, const std::string& strToken, const std::string& strEndToken) {\n  string line;\n  ifstream fileData(strFilename.c_str(),ios::binary);\n\n  m_iStopPos = 0;\n  if (fileData.is_open())\n  {\n    while (! fileData.eof() )\n    {\n      getline (fileData,line);\n      RemoveLeadingWhitespace(line);\n\n      \/\/ remove windows line endings\n      if (line.length() > 0 && line[line.length()-1] == 13)\n        line = line.substr(0,line.length()-1);\n\n      if ((strEndToken != \"\" && strEndToken == line) ||\n          (bStopOnEmptyLine && line.empty()))  {\n        m_iStopPos = fileData.tellg();\n        break;\n      }\n\n      if (line[0] == '#') continue;        \/\/ skip comments\n      if (line.find_first_of(strToken) == string::npos) continue;  \/\/ skip invalid lines\n\n      string strKey = line.substr(0, line.find_first_of(strToken));\n      RemoveTailingWhitespace(strKey);\n\n      line = line.substr(line.find_first_of(strToken)+strToken.length(), line.length());\n      RemoveLeadingWhitespace(line);\n      RemoveTailingWhitespace(line);\n\n      if (strKey.length() == 0 || line.length() == 0) continue;\n\n      KeyValPair newKey(strKey, line);\n      m_vecTokens.push_back(newKey);\n    }\n    fileData.close();\n  } else return false;\n\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************************\n *  Copyright (C) 2012 by Alejandro Fiestas Olivares <afiestas@kde.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                      *\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\n#include \"console.h\"\n\n#include <QX11Info>\n#include <QtCore\/QDebug>\n#include <QtCore\/QDateTime>\n#include <QtCore\/QDir>\n#include <QtCore\/QTextStream>\n\n#include <qjson\/parser.h>\n#include <qjson\/serializer.h>\n\n#include <kscreen\/config.h>\n#include <kscreen\/output.h>\n#include <kscreen\/mode.h>\n#include <kscreen\/configmonitor.h>\n#include <kscreen\/edid.h>\n\n#include <KStandardDirs>\n\nusing namespace KScreen;\n\nConsole::Console(QObject* parent): QObject(parent)\n{\n    qDebug() << \"START\";\n    QDateTime date = QDateTime::currentDateTime();\n    m_config = Config::current();\n    qDebug() << \"Config::current() took\" << date.msecsTo(QDateTime::currentDateTime()) << \"milliseconds\";\n}\n\nConsole::~Console()\n{\n\n}\n\nvoid Console::printConfig()\n{\n    if (!m_config) {\n        qDebug() << \"Config is invalid, probably backend couldn't load\";\n        return;\n    }\n    if (!m_config->screen()) {\n        qDebug() << \"No screen in the configuration, broken backend\";\n        return;\n    }\n\n    qDebug() << \"Screen:\";\n    qDebug() << \"maxSize:\" << m_config->screen()->maxSize();\n    qDebug() << \"minSize:\" << m_config->screen()->minSize();\n    qDebug() << \"currentSize:\" << m_config->screen()->currentSize();\n\n    OutputList outputs = m_config->outputs();\n    Q_FOREACH(Output *output, outputs) {\n        qDebug() << \"\\n-----------------------------------------------------\\n\";\n        qDebug() << \"Id: \" << output->id();\n        qDebug() << \"Name: \" << output->name();\n        qDebug() << \"Type: \" << output->type();\n        qDebug() << \"Connected: \" << output->isConnected();\n        if (!output->isConnected()) {\n            continue;\n        }\n        qDebug() << \"Enabled: \" << output->isEnabled();\n        qDebug() << \"Primary: \" << output->isPrimary();\n        qDebug() << \"Rotation: \" << output->rotation();\n        qDebug() << \"Pos: \" << output->pos();\n        if (output->currentMode()) {\n            qDebug() << \"Size: \" << output->currentMode()->size();\n        }\n        qDebug() << \"Clones: \" << output->clones().isEmpty();\n        qDebug() << \"Mode: \" << output->currentModeId();\n        qDebug() << \"Preferred Mode: \" << output->preferredModeId();\n        qDebug() << \"Preferred modes: \" << output->preferredModes();\n        qDebug() << \"Modes: \";\n\n        ModeList modes = output->modes();\n        Q_FOREACH(Mode* mode, modes) {\n            qDebug() << \"\\t\" << mode->id() << \"  \" << mode->name() << \" \" << mode->size() << \" \" << mode->refreshRate();\n        }\n\n        Edid* edid = output->edid();\n        qDebug() << \"EDID Info: \";\n        if (edid != 0) {\n            qDebug() << \"\\tDevice ID: \" << edid->deviceId();\n            qDebug() << \"\\tName: \" << edid->name();\n            qDebug() << \"\\tVendor: \" << edid->vendor();\n            qDebug() << \"\\tSerial: \" << edid->serial();\n            qDebug() << \"\\tEISA ID: \" << edid->eisaId();\n            qDebug() << \"\\tHash: \" << edid->hash();\n            qDebug() << \"\\tWidth: \" << edid->width();\n            qDebug() << \"\\tHeight: \" << edid->height();\n            qDebug() << \"\\tGamma: \" << edid->gamma();\n            qDebug() << \"\\tRed: \" << edid->red();\n            qDebug() << \"\\tGreen: \" << edid->green();\n            qDebug() << \"\\tBlue: \" << edid->blue();\n            qDebug() << \"\\tWhite: \" << edid->white();\n        } else {\n            qDebug() << \"\\tUnavailable\";\n        }\n    }\n}\n\nvoid Console::printSerializations()\n{\n    QString path = KStandardDirs::locateLocal(\"data\", \"kscreen\/\");\n    qDebug() << \"Configs in: \" << path;\n\n    QDir dir(path);\n    QStringList files = dir.entryList(QDir::Files);\n    qDebug() << \"Number of files: \" << files.count() << endl;\n\n    bool ok;\n    QJson::Parser parser;\n    QJson::Serializer serializer;\n    serializer.setIndentMode(QJson::IndentFull);\n    Q_FOREACH(const QString fileName, files) {\n        ok = true;\n        qDebug() << fileName;\n        QFile file(path + \"\/\" + fileName);\n        file.open(QFile::ReadOnly);\n        QVariant data = parser.parse(file.readAll(), &ok);\n        if (!ok) {\n            qDebug() << \"    \" << \"can't parse file\";\n            qDebug() << \"    \" << parser.errorString();\n            continue;\n        }\n\n        qDebug() << serializer.serialize(data) << endl;\n    }\n}\n\nvoid Console::monitor()\n{\n    ConfigMonitor::instance()->addConfig(m_config);\n}\n\nvoid Console::monitorAndPrint()\n{\n    monitor();\n    connect(ConfigMonitor::instance(), SIGNAL(configurationChanged()), SLOT(printConfig()));\n}\n\n#include <console.moc>\n<commit_msg>Only show EDID when it is valid<commit_after>\/*************************************************************************************\n *  Copyright (C) 2012 by Alejandro Fiestas Olivares <afiestas@kde.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                      *\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\n#include \"console.h\"\n\n#include <QX11Info>\n#include <QtCore\/QDebug>\n#include <QtCore\/QDateTime>\n#include <QtCore\/QDir>\n#include <QtCore\/QTextStream>\n\n#include <qjson\/parser.h>\n#include <qjson\/serializer.h>\n\n#include <kscreen\/config.h>\n#include <kscreen\/output.h>\n#include <kscreen\/mode.h>\n#include <kscreen\/configmonitor.h>\n#include <kscreen\/edid.h>\n\n#include <KStandardDirs>\n\nusing namespace KScreen;\n\nConsole::Console(QObject* parent): QObject(parent)\n{\n    qDebug() << \"START\";\n    QDateTime date = QDateTime::currentDateTime();\n    m_config = Config::current();\n    qDebug() << \"Config::current() took\" << date.msecsTo(QDateTime::currentDateTime()) << \"milliseconds\";\n}\n\nConsole::~Console()\n{\n\n}\n\nvoid Console::printConfig()\n{\n    if (!m_config) {\n        qDebug() << \"Config is invalid, probably backend couldn't load\";\n        return;\n    }\n    if (!m_config->screen()) {\n        qDebug() << \"No screen in the configuration, broken backend\";\n        return;\n    }\n\n    qDebug() << \"Screen:\";\n    qDebug() << \"maxSize:\" << m_config->screen()->maxSize();\n    qDebug() << \"minSize:\" << m_config->screen()->minSize();\n    qDebug() << \"currentSize:\" << m_config->screen()->currentSize();\n\n    OutputList outputs = m_config->outputs();\n    Q_FOREACH(Output *output, outputs) {\n        qDebug() << \"\\n-----------------------------------------------------\\n\";\n        qDebug() << \"Id: \" << output->id();\n        qDebug() << \"Name: \" << output->name();\n        qDebug() << \"Type: \" << output->type();\n        qDebug() << \"Connected: \" << output->isConnected();\n        if (!output->isConnected()) {\n            continue;\n        }\n        qDebug() << \"Enabled: \" << output->isEnabled();\n        qDebug() << \"Primary: \" << output->isPrimary();\n        qDebug() << \"Rotation: \" << output->rotation();\n        qDebug() << \"Pos: \" << output->pos();\n        if (output->currentMode()) {\n            qDebug() << \"Size: \" << output->currentMode()->size();\n        }\n        qDebug() << \"Clones: \" << output->clones().isEmpty();\n        qDebug() << \"Mode: \" << output->currentModeId();\n        qDebug() << \"Preferred Mode: \" << output->preferredModeId();\n        qDebug() << \"Preferred modes: \" << output->preferredModes();\n        qDebug() << \"Modes: \";\n\n        ModeList modes = output->modes();\n        Q_FOREACH(Mode* mode, modes) {\n            qDebug() << \"\\t\" << mode->id() << \"  \" << mode->name() << \" \" << mode->size() << \" \" << mode->refreshRate();\n        }\n\n        Edid* edid = output->edid();\n        qDebug() << \"EDID Info: \";\n        if (edid && edid->isValid()) {\n            qDebug() << \"\\tDevice ID: \" << edid->deviceId();\n            qDebug() << \"\\tName: \" << edid->name();\n            qDebug() << \"\\tVendor: \" << edid->vendor();\n            qDebug() << \"\\tSerial: \" << edid->serial();\n            qDebug() << \"\\tEISA ID: \" << edid->eisaId();\n            qDebug() << \"\\tHash: \" << edid->hash();\n            qDebug() << \"\\tWidth: \" << edid->width();\n            qDebug() << \"\\tHeight: \" << edid->height();\n            qDebug() << \"\\tGamma: \" << edid->gamma();\n            qDebug() << \"\\tRed: \" << edid->red();\n            qDebug() << \"\\tGreen: \" << edid->green();\n            qDebug() << \"\\tBlue: \" << edid->blue();\n            qDebug() << \"\\tWhite: \" << edid->white();\n        } else {\n            qDebug() << \"\\tUnavailable\";\n        }\n    }\n}\n\nvoid Console::printSerializations()\n{\n    QString path = KStandardDirs::locateLocal(\"data\", \"kscreen\/\");\n    qDebug() << \"Configs in: \" << path;\n\n    QDir dir(path);\n    QStringList files = dir.entryList(QDir::Files);\n    qDebug() << \"Number of files: \" << files.count() << endl;\n\n    bool ok;\n    QJson::Parser parser;\n    QJson::Serializer serializer;\n    serializer.setIndentMode(QJson::IndentFull);\n    Q_FOREACH(const QString fileName, files) {\n        ok = true;\n        qDebug() << fileName;\n        QFile file(path + \"\/\" + fileName);\n        file.open(QFile::ReadOnly);\n        QVariant data = parser.parse(file.readAll(), &ok);\n        if (!ok) {\n            qDebug() << \"    \" << \"can't parse file\";\n            qDebug() << \"    \" << parser.errorString();\n            continue;\n        }\n\n        qDebug() << serializer.serialize(data) << endl;\n    }\n}\n\nvoid Console::monitor()\n{\n    ConfigMonitor::instance()->addConfig(m_config);\n}\n\nvoid Console::monitorAndPrint()\n{\n    monitor();\n    connect(ConfigMonitor::instance(), SIGNAL(configurationChanged()), SLOT(printConfig()));\n}\n\n#include <console.moc>\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/ged:$Name:  TPadEditor.cxx\n\/\/ Author: Ilka Antcheva   24\/06\/04\n\n\/*************************************************************************\n * Copyright (C) 1995-2002, 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\/\/                                                                      \/\/\n\/\/  TPadEditor                                                          \/\/\n\/\/                                                                      \/\/\n\/\/  Editor of pad\/canvas objects.                                       \/\/\n\/\/       color and fill style,                                          \/\/             \n\/\/      'Edit' check box sets pad\/canvad editable,                      \/\/\n\/\/      'Crosshair' sets a cross hair on the pad,                       \/\/\n\/\/      'Fixed aspect ratio' can be set when resizing the pad           \/\/\n\/\/      'TickX' and 'TickY' set ticks along the X and Y axis            \/\/\n\/\/      'GridX' and 'GridY' set a grid along the X and Y axis           \/\/\n\/\/       pad\/canvas border size can be set if a sinken or a raised      \/\/\n\/\/       border mode is selected; no border mode can be set to          \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/TPadEditor.gif\">\n*\/\n\/\/End_Html\n\n#include \"TPadEditor.h\"\n#include \"TGClient.h\"\n#include \"TGButton.h\"\n#include \"TGComboBox.h\"\n#include \"TGButtonGroup.h\"\n#include \"TGLabel.h\"\n#include \"TColor.h\"\n#include \"TCanvas.h\"\n\nClassImp(TGedFrame)\nClassImp(TPadEditor)\n\nenum {\n   kCOLOR,\n   kPAD_FAR,\n   kPAD_EDIT,\n   kPAD_CROSS,\n   kPAD_GRIDX,\n   kPAD_GRIDY,\n   kPAD_LOGX,\n   kPAD_LOGY,\n   kPAD_LOGZ,\n   kPAD_TICKX,\n   kPAD_TICKY,\n   kPAD_BSIZE,\n   kPAD_BMODE\n};\n\n\n\/\/______________________________________________________________________________\nTPadEditor::TPadEditor(const TGWindow *p, Int_t id, Int_t width,\n                       Int_t height, UInt_t options, Pixel_t back)\n   : TGedFrame(p, id, width, height, options | kVerticalFrame, back)\n{\n   \/\/ Constructor of TPad editor GUI.\n\n   fPadPointer = 0;\n   \n   MakeTitle(\"Pad\/Canvas\");\n\n   fFixedAR = new TGCheckButton(this, \"Fixed aspect ratio\", kPAD_FAR);\n   fFixedAR->SetToolTipText(\"Set fixed aspect ratio\");\n   AddFrame(fFixedAR, new TGLayoutHints(kLHintsTop, 4, 1, 2, 1));\n\n   TGCompositeFrame *f2 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   fCrosshair = new TGCheckButton(f2, \"Crosshair\", kPAD_CROSS);\n   fCrosshair->SetToolTipText(\"Set crosshair\");\n   f2->AddFrame(fCrosshair, new TGLayoutHints(kLHintsTop, 3, 1, 1, 1));\n   fEditable = new TGCheckButton(f2, \"Edit\", kPAD_EDIT);\n   fEditable->SetToolTipText(\"Set editable mode\");\n   f2->AddFrame(fEditable, new TGLayoutHints(kLHintsTop, 3, 1, 1, 1));\n   AddFrame(f2, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n\n   TGCompositeFrame *f3 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   fGridX = new TGCheckButton(f3, \"GridX\", kPAD_GRIDX);\n   fGridX->SetToolTipText(\"Set grid along X\");\n   f3->AddFrame(fGridX, new TGLayoutHints(kLHintsTop, 3, 1, 1, 1));\n   fGridY = new TGCheckButton(f3, \"GridY\", kPAD_GRIDY);\n   fGridY->SetToolTipText(\"Set grid along Y\");\n   f3->AddFrame(fGridY, new TGLayoutHints(kLHintsTop, 24, 1, 1, 1));\n   AddFrame(f3, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n\n   TGCompositeFrame *f4 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   fTickX = new TGCheckButton(f4, \"TickX\", kPAD_TICKX);\n   fTickX->SetToolTipText(\"Set tick marks along X\");\n   f4->AddFrame(fTickX, new TGLayoutHints(kLHintsTop, 3, 1, 1, 1));\n   fTickY = new TGCheckButton(f4, \"TickY\", kPAD_TICKY);\n   fTickY->SetToolTipText(\"Set tick marks along Y\");\n   f4->AddFrame(fTickY, new TGLayoutHints(kLHintsTop, 24, 1, 1, 1));\n   AddFrame(f4, new TGLayoutHints(kLHintsTop, 1, 1, 0, 2));\n\n   MakeTitle(\"Log Scale\");\n\n   TGCompositeFrame *f5 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   fLogX = new TGCheckButton(f5, \":X\", kPAD_LOGX);\n   fLogX->SetToolTipText(\"Set logarithmic scale along X\");\n   f5->AddFrame(fLogX, new TGLayoutHints(kLHintsTop, 4, 1, 1, 1));\n   fLogY = new TGCheckButton(f5, \":Y\", kPAD_LOGY);\n   fLogY->SetToolTipText(\"Set logarithmic scale along Y\");\n   f5->AddFrame(fLogY, new TGLayoutHints(kLHintsTop, 15, 1, 1, 1));\n   fLogZ = new TGCheckButton(f5, \":Z\", kPAD_LOGZ);\n   fLogZ->SetToolTipText(\"Set logarithmic scale along Z\");\n   f5->AddFrame(fLogZ, new TGLayoutHints(kLHintsTop, 15, 1, 1, 1));\n   AddFrame(f5, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n\n   TGCompositeFrame *f6 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   TGButtonGroup *bgr = new TGButtonGroup(f6,3,1,3,0, \"Border Mode\");\n   bgr->SetRadioButtonExclusive(kTRUE);\n   fBmode = new TGRadioButton(bgr, \" Sinken border\", 77);\n   fBmode->SetToolTipText(\"Set a sinken border of the pad\/canvas\");\n   fBmode0 = new TGRadioButton(bgr, \" No border\", 78);\n   fBmode0->SetToolTipText(\"Set no border of the pad\/canvas\");\n   fBmode1 = new TGRadioButton(bgr, \" Raised border\", 79);\n   fBmode1->SetToolTipText(\"Set a raised border of the pad\/canvas\");\n   bgr->SetButton(79, kTRUE);\n   bgr->SetLayoutHints(new TGLayoutHints(kLHintsLeft, 0,0,3,0), fBmode);\n   bgr->Show();\n   bgr->ChangeOptions(kFitWidth|kChildFrame|kVerticalFrame);\n   f6->AddFrame(bgr, new TGLayoutHints(kLHintsCenterY | kLHintsLeft, 4, 1, 0, 0));\n   AddFrame(f6, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n   \n   f7 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   TGLabel *fSizeLbl = new TGLabel(f7, \"Size:\");                              \n   f7->AddFrame(fSizeLbl, new TGLayoutHints(kLHintsCenterY | kLHintsLeft, 6, 1, 0, 0));\n   fBsize = new TGLineWidthComboBox(f7, kPAD_BSIZE);\n   fBsize->Connect(\"Selected(Int_t)\", \"TPadEditor\", this, \"DoBorderSize(Int_t)\"); \n   fBsize->Resize(92, 20);\n   f7->AddFrame(fBsize, new TGLayoutHints(kLHintsLeft, 13, 1, 0, 0));\n   fBsize->Associate(this);\n   AddFrame(f7, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n\n   MapSubwindows();\n   Layout();\n   MapWindow();\n\n   TClass *cl = TPad::Class();\n   TGedElement *ge = new TGedElement;\n   ge->fGedFrame = this;\n   ge->fCanvas = 0;\n   cl->GetEditorList()->Add(ge);\n   \n   fInit = kTRUE;\n}\n\n\/\/______________________________________________________________________________\nTPadEditor::~TPadEditor()\n{ \n   \/\/ Destructor of fill editor.\n\n   TGFrameElement *el;\n   TIter next(GetList());\n   \n   while ((el = (TGFrameElement *)next())) {\n      if (!strcmp(el->fFrame->ClassName(), \"TGCompositeFrame\"))\n         ((TGCompositeFrame *)el->fFrame)->Cleanup();\n   }\n   Cleanup(); \n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::ConnectSignals2Slots()\n{ \n   \/\/ Connect signals to slots.\n\n   fFixedAR->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoFixedAspectRatio(Bool_t)\");\n   fCrosshair->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoCrosshair(Bool_t)\");\n   fEditable->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoEditable(Bool_t)\");\n   fGridX->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoGridX(Bool_t)\");\n   fGridY->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoGridY(Bool_t)\");\n   fTickX->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoTickX(Bool_t)\");\n   fTickY->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoTickY(Bool_t)\");\n   fLogX->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoLogX(Bool_t)\");\n   fLogY->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoLogY(Bool_t)\");\n   fLogZ->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoLogZ(Bool_t)\");\n   fBmode->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoBorderMode()\");\n   fBmode0->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoBorderMode()\");\n   fBmode1->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoBorderMode()\");\n   \n   fInit = kFALSE;\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::SetModel(TVirtualPad* pad, TObject* obj, Int_t)\n{\n   \/\/ Pick up the used fill attributes.\n\n   fModel = 0;\n   fPad = 0;\n\n   if (obj == 0 || !obj->InheritsFrom(\"TPad\")) {\n      SetActive(kFALSE);\n      return;\n   }\n\n   fModel = obj;\n   fPad = pad;\n\n   fPadPointer = (TPad *)fModel;\n   \n   Bool_t on;\n\n   on = fPadPointer->HasFixedAspectRatio();\n   if (on) fFixedAR->SetState(kButtonDown);\n   else fFixedAR->SetState(kButtonUp);\n   \n   on = fPadPointer->HasCrosshair();\n   if (on) fCrosshair->SetState(kButtonDown);\n   else fCrosshair->SetState(kButtonUp);\n   \n   on = fPadPointer->IsEditable();\n   if (on) fEditable->SetState(kButtonDown);\n   else fEditable->SetState(kButtonUp);\n\n   on = fPadPointer->GetGridx();\n   if (on) fGridX->SetState(kButtonDown);\n   else fGridX->SetState(kButtonUp);\n   \n   on = fPadPointer->GetGridy();\n   if (on) fGridY->SetState(kButtonDown);\n   else fGridY->SetState(kButtonUp);\n\n   Int_t par;\n   par = fPadPointer->GetLogx();\n   if (par) fLogX->SetState(kButtonDown);\n   else fLogX->SetState(kButtonUp);\n   \n   par = fPadPointer->GetLogy();\n   if (par) fLogY->SetState(kButtonDown);\n   else fLogY->SetState(kButtonUp);\n\n   par = fPadPointer->GetLogz();\n   if (par) fLogZ->SetState(kButtonDown);\n   else fLogZ->SetState(kButtonUp);\n\n   par = fPadPointer->GetTickx();\n   if (par) fTickX->SetState(kButtonDown);\n   else fTickX->SetState(kButtonUp);\n\n   par = fPadPointer->GetTicky();\n   if (par) fTickY->SetState(kButtonDown);\n   else fTickY->SetState(kButtonUp);\n\n   par = fPadPointer->GetBorderMode();\n   if (par == -1) fBmode->SetState(kButtonDown);\n   else if (par == 1) fBmode1->SetState(kButtonDown);\n   else fBmode0->SetState(kButtonDown);\n\n   par = fPadPointer->GetBorderSize();\n   if (par < 1) par = 1;\n   if (par > 16) par = 16;\n   fBsize->Select(par);\n   \n   if (fInit) ConnectSignals2Slots();\n   SetActive();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoEditable(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'Editable'.\n\n   fPadPointer->SetEditable(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoCrosshair(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'Crosshair'.\n\n   fPadPointer->SetCrosshair(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoFixedAspectRatio(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'Fixed aspect ratio'.\n\n   fPadPointer->SetFixedAspectRatio(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoGridX(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'GridX'.\n\n   fPadPointer->SetGridx(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoGridY(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'GridY'.\n\n   fPadPointer->SetGridy(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoLogX(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'LogX'.\n\n   fPadPointer->SetLogx(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoLogY(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'LogY'.\n\n   fPadPointer->SetLogy(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoLogZ(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'LogZ'.\n\n   fPadPointer->SetLogz(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoTickX(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'TickX'.\n\n   fPadPointer->SetTickx(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoTickY(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'TickY'.\n\n   fPadPointer->SetTicky(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoBorderMode()\n{\n   \/\/ Slot connected to the border mode settings.\n   \n   Int_t mode = 0;\n   if (fBmode->GetState() == kButtonDown) mode = -1;\n   else if (fBmode0->GetState() == kButtonDown) mode = 0;\n   else mode = 1;\n\n   if (!mode) HideFrame(f7);\n   else ShowFrame(f7);\n   Layout();\n   \n   fPadPointer->SetBorderMode(mode);\n   Update();\n   gPad->Modified();\n   gPad->Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoBorderSize(Int_t size)\n{\n   \/\/ Slot connected to the border size settings.\n   \n   fPadPointer->SetBorderSize(size);\n   Update();\n}\n<commit_msg>From Ilka: fixes a typo in a label of the pad editor (thanks to Olivier).<commit_after>\/\/ @(#)root\/ged:$Name:  TPadEditor.cxx\n\/\/ Author: Ilka Antcheva   24\/06\/04\n\n\/*************************************************************************\n * Copyright (C) 1995-2002, 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\/\/                                                                      \/\/\n\/\/  TPadEditor                                                          \/\/\n\/\/                                                                      \/\/\n\/\/  Editor of pad\/canvas objects.                                       \/\/\n\/\/       color and fill style,                                          \/\/             \n\/\/      'Edit' check box sets pad\/canvad editable,                      \/\/\n\/\/      'Crosshair' sets a cross hair on the pad,                       \/\/\n\/\/      'Fixed aspect ratio' can be set when resizing the pad           \/\/\n\/\/      'TickX' and 'TickY' set ticks along the X and Y axis            \/\/\n\/\/      'GridX' and 'GridY' set a grid along the X and Y axis           \/\/\n\/\/       pad\/canvas border size can be set if a sinken or a raised      \/\/\n\/\/       border mode is selected; no border mode can be set to          \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/TPadEditor.gif\">\n*\/\n\/\/End_Html\n\n#include \"TPadEditor.h\"\n#include \"TGClient.h\"\n#include \"TGButton.h\"\n#include \"TGComboBox.h\"\n#include \"TGButtonGroup.h\"\n#include \"TGLabel.h\"\n#include \"TColor.h\"\n#include \"TCanvas.h\"\n\nClassImp(TGedFrame)\nClassImp(TPadEditor)\n\nenum {\n   kCOLOR,\n   kPAD_FAR,\n   kPAD_EDIT,\n   kPAD_CROSS,\n   kPAD_GRIDX,\n   kPAD_GRIDY,\n   kPAD_LOGX,\n   kPAD_LOGY,\n   kPAD_LOGZ,\n   kPAD_TICKX,\n   kPAD_TICKY,\n   kPAD_BSIZE,\n   kPAD_BMODE\n};\n\n\n\/\/______________________________________________________________________________\nTPadEditor::TPadEditor(const TGWindow *p, Int_t id, Int_t width,\n                       Int_t height, UInt_t options, Pixel_t back)\n   : TGedFrame(p, id, width, height, options | kVerticalFrame, back)\n{\n   \/\/ Constructor of TPad editor GUI.\n\n   fPadPointer = 0;\n   \n   MakeTitle(\"Pad\/Canvas\");\n\n   fFixedAR = new TGCheckButton(this, \"Fixed aspect ratio\", kPAD_FAR);\n   fFixedAR->SetToolTipText(\"Set fixed aspect ratio\");\n   AddFrame(fFixedAR, new TGLayoutHints(kLHintsTop, 4, 1, 2, 1));\n\n   TGCompositeFrame *f2 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   fCrosshair = new TGCheckButton(f2, \"Crosshair\", kPAD_CROSS);\n   fCrosshair->SetToolTipText(\"Set crosshair\");\n   f2->AddFrame(fCrosshair, new TGLayoutHints(kLHintsTop, 3, 1, 1, 1));\n   fEditable = new TGCheckButton(f2, \"Edit\", kPAD_EDIT);\n   fEditable->SetToolTipText(\"Set editable mode\");\n   f2->AddFrame(fEditable, new TGLayoutHints(kLHintsTop, 3, 1, 1, 1));\n   AddFrame(f2, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n\n   TGCompositeFrame *f3 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   fGridX = new TGCheckButton(f3, \"GridX\", kPAD_GRIDX);\n   fGridX->SetToolTipText(\"Set grid along X\");\n   f3->AddFrame(fGridX, new TGLayoutHints(kLHintsTop, 3, 1, 1, 1));\n   fGridY = new TGCheckButton(f3, \"GridY\", kPAD_GRIDY);\n   fGridY->SetToolTipText(\"Set grid along Y\");\n   f3->AddFrame(fGridY, new TGLayoutHints(kLHintsTop, 24, 1, 1, 1));\n   AddFrame(f3, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n\n   TGCompositeFrame *f4 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   fTickX = new TGCheckButton(f4, \"TickX\", kPAD_TICKX);\n   fTickX->SetToolTipText(\"Set tick marks along X\");\n   f4->AddFrame(fTickX, new TGLayoutHints(kLHintsTop, 3, 1, 1, 1));\n   fTickY = new TGCheckButton(f4, \"TickY\", kPAD_TICKY);\n   fTickY->SetToolTipText(\"Set tick marks along Y\");\n   f4->AddFrame(fTickY, new TGLayoutHints(kLHintsTop, 24, 1, 1, 1));\n   AddFrame(f4, new TGLayoutHints(kLHintsTop, 1, 1, 0, 2));\n\n   MakeTitle(\"Log Scale\");\n\n   TGCompositeFrame *f5 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   fLogX = new TGCheckButton(f5, \":X\", kPAD_LOGX);\n   fLogX->SetToolTipText(\"Set logarithmic scale along X\");\n   f5->AddFrame(fLogX, new TGLayoutHints(kLHintsTop, 4, 1, 1, 1));\n   fLogY = new TGCheckButton(f5, \":Y\", kPAD_LOGY);\n   fLogY->SetToolTipText(\"Set logarithmic scale along Y\");\n   f5->AddFrame(fLogY, new TGLayoutHints(kLHintsTop, 15, 1, 1, 1));\n   fLogZ = new TGCheckButton(f5, \":Z\", kPAD_LOGZ);\n   fLogZ->SetToolTipText(\"Set logarithmic scale along Z\");\n   f5->AddFrame(fLogZ, new TGLayoutHints(kLHintsTop, 15, 1, 1, 1));\n   AddFrame(f5, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n\n   TGCompositeFrame *f6 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   TGButtonGroup *bgr = new TGButtonGroup(f6,3,1,3,0, \"Border Mode\");\n   bgr->SetRadioButtonExclusive(kTRUE);\n   fBmode = new TGRadioButton(bgr, \" Sunken border\", 77);\n   fBmode->SetToolTipText(\"Set a sinken border of the pad\/canvas\");\n   fBmode0 = new TGRadioButton(bgr, \" No border\", 78);\n   fBmode0->SetToolTipText(\"Set no border of the pad\/canvas\");\n   fBmode1 = new TGRadioButton(bgr, \" Raised border\", 79);\n   fBmode1->SetToolTipText(\"Set a raised border of the pad\/canvas\");\n   bgr->SetButton(79, kTRUE);\n   bgr->SetLayoutHints(new TGLayoutHints(kLHintsLeft, 0,0,3,0), fBmode);\n   bgr->Show();\n   bgr->ChangeOptions(kFitWidth|kChildFrame|kVerticalFrame);\n   f6->AddFrame(bgr, new TGLayoutHints(kLHintsCenterY | kLHintsLeft, 4, 1, 0, 0));\n   AddFrame(f6, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n   \n   f7 = new TGCompositeFrame(this, 80, 20, kHorizontalFrame);\n   TGLabel *fSizeLbl = new TGLabel(f7, \"Size:\");                              \n   f7->AddFrame(fSizeLbl, new TGLayoutHints(kLHintsCenterY | kLHintsLeft, 6, 1, 0, 0));\n   fBsize = new TGLineWidthComboBox(f7, kPAD_BSIZE);\n   fBsize->Connect(\"Selected(Int_t)\", \"TPadEditor\", this, \"DoBorderSize(Int_t)\"); \n   fBsize->Resize(92, 20);\n   f7->AddFrame(fBsize, new TGLayoutHints(kLHintsLeft, 13, 1, 0, 0));\n   fBsize->Associate(this);\n   AddFrame(f7, new TGLayoutHints(kLHintsTop, 1, 1, 0, 0));\n\n   MapSubwindows();\n   Layout();\n   MapWindow();\n\n   TClass *cl = TPad::Class();\n   TGedElement *ge = new TGedElement;\n   ge->fGedFrame = this;\n   ge->fCanvas = 0;\n   cl->GetEditorList()->Add(ge);\n   \n   fInit = kTRUE;\n}\n\n\/\/______________________________________________________________________________\nTPadEditor::~TPadEditor()\n{ \n   \/\/ Destructor of fill editor.\n\n   TGFrameElement *el;\n   TIter next(GetList());\n   \n   while ((el = (TGFrameElement *)next())) {\n      if (!strcmp(el->fFrame->ClassName(), \"TGCompositeFrame\"))\n         ((TGCompositeFrame *)el->fFrame)->Cleanup();\n   }\n   Cleanup(); \n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::ConnectSignals2Slots()\n{ \n   \/\/ Connect signals to slots.\n\n   fFixedAR->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoFixedAspectRatio(Bool_t)\");\n   fCrosshair->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoCrosshair(Bool_t)\");\n   fEditable->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoEditable(Bool_t)\");\n   fGridX->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoGridX(Bool_t)\");\n   fGridY->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoGridY(Bool_t)\");\n   fTickX->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoTickX(Bool_t)\");\n   fTickY->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoTickY(Bool_t)\");\n   fLogX->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoLogX(Bool_t)\");\n   fLogY->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoLogY(Bool_t)\");\n   fLogZ->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoLogZ(Bool_t)\");\n   fBmode->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoBorderMode()\");\n   fBmode0->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoBorderMode()\");\n   fBmode1->Connect(\"Toggled(Bool_t)\",\"TPadEditor\",this,\"DoBorderMode()\");\n   \n   fInit = kFALSE;\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::SetModel(TVirtualPad* pad, TObject* obj, Int_t)\n{\n   \/\/ Pick up the used fill attributes.\n\n   fModel = 0;\n   fPad = 0;\n\n   if (obj == 0 || !obj->InheritsFrom(\"TPad\")) {\n      SetActive(kFALSE);\n      return;\n   }\n\n   fModel = obj;\n   fPad = pad;\n\n   fPadPointer = (TPad *)fModel;\n   \n   Bool_t on;\n\n   on = fPadPointer->HasFixedAspectRatio();\n   if (on) fFixedAR->SetState(kButtonDown);\n   else fFixedAR->SetState(kButtonUp);\n   \n   on = fPadPointer->HasCrosshair();\n   if (on) fCrosshair->SetState(kButtonDown);\n   else fCrosshair->SetState(kButtonUp);\n   \n   on = fPadPointer->IsEditable();\n   if (on) fEditable->SetState(kButtonDown);\n   else fEditable->SetState(kButtonUp);\n\n   on = fPadPointer->GetGridx();\n   if (on) fGridX->SetState(kButtonDown);\n   else fGridX->SetState(kButtonUp);\n   \n   on = fPadPointer->GetGridy();\n   if (on) fGridY->SetState(kButtonDown);\n   else fGridY->SetState(kButtonUp);\n\n   Int_t par;\n   par = fPadPointer->GetLogx();\n   if (par) fLogX->SetState(kButtonDown);\n   else fLogX->SetState(kButtonUp);\n   \n   par = fPadPointer->GetLogy();\n   if (par) fLogY->SetState(kButtonDown);\n   else fLogY->SetState(kButtonUp);\n\n   par = fPadPointer->GetLogz();\n   if (par) fLogZ->SetState(kButtonDown);\n   else fLogZ->SetState(kButtonUp);\n\n   par = fPadPointer->GetTickx();\n   if (par) fTickX->SetState(kButtonDown);\n   else fTickX->SetState(kButtonUp);\n\n   par = fPadPointer->GetTicky();\n   if (par) fTickY->SetState(kButtonDown);\n   else fTickY->SetState(kButtonUp);\n\n   par = fPadPointer->GetBorderMode();\n   if (par == -1) fBmode->SetState(kButtonDown);\n   else if (par == 1) fBmode1->SetState(kButtonDown);\n   else fBmode0->SetState(kButtonDown);\n\n   par = fPadPointer->GetBorderSize();\n   if (par < 1) par = 1;\n   if (par > 16) par = 16;\n   fBsize->Select(par);\n   \n   if (fInit) ConnectSignals2Slots();\n   SetActive();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoEditable(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'Editable'.\n\n   fPadPointer->SetEditable(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoCrosshair(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'Crosshair'.\n\n   fPadPointer->SetCrosshair(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoFixedAspectRatio(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'Fixed aspect ratio'.\n\n   fPadPointer->SetFixedAspectRatio(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoGridX(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'GridX'.\n\n   fPadPointer->SetGridx(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoGridY(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'GridY'.\n\n   fPadPointer->SetGridy(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoLogX(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'LogX'.\n\n   fPadPointer->SetLogx(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoLogY(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'LogY'.\n\n   fPadPointer->SetLogy(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoLogZ(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'LogZ'.\n\n   fPadPointer->SetLogz(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoTickX(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'TickX'.\n\n   fPadPointer->SetTickx(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoTickY(Bool_t on)\n{\n   \/\/ Slot connected to the check box 'TickY'.\n\n   fPadPointer->SetTicky(on);\n   Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoBorderMode()\n{\n   \/\/ Slot connected to the border mode settings.\n   \n   Int_t mode = 0;\n   if (fBmode->GetState() == kButtonDown) mode = -1;\n   else if (fBmode0->GetState() == kButtonDown) mode = 0;\n   else mode = 1;\n\n   if (!mode) HideFrame(f7);\n   else ShowFrame(f7);\n   Layout();\n   \n   fPadPointer->SetBorderMode(mode);\n   Update();\n   gPad->Modified();\n   gPad->Update();\n}\n\n\/\/______________________________________________________________________________\nvoid TPadEditor::DoBorderSize(Int_t size)\n{\n   \/\/ Slot connected to the border size settings.\n   \n   fPadPointer->SetBorderSize(size);\n   Update();\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\nstd::vector<Optimizer::Rule> Optimizer::_rules;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ @brief constructor, this will initialize the rules database\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nOptimizer::Optimizer () {\n  if (_rules.empty()) {\n    setupRules();\n  }\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    for (auto p : _plans.list) {\n      p->show();\n      std::cout << std::endl;\n    }\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(\"dummy\", 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->name << \" (\" << &(it->func) << \") with level \"\n                  << it->level << \" on plan \" << count++\n                  << std::endl;\n        try {\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      \/\/ TODO: abort early here if we found a good-enough plan\n      \/\/ a good-enough plan is probably every plan with costs below some\n      \/\/ defined threshold. this requires plan costs to be calculated here\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  for (auto p : _plans.list) {\n    p->show();\n    std::cout << \"costing: \" << p->getCost() << std::endl;\n    std::cout << 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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief set up the optimizer rules once and forever\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid Optimizer::setupRules () {\n  TRI_ASSERT(_rules.empty());\n\n  \/\/ List all the rules in the system here:\n  \/\/ lower level values mean earlier rule execution\n  \/\/ if two rules have the same level value, they will be executed in declaration order\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/ \"Pass 1\": moving nodes \"up\" (potentially outside loops):\n  \/\/           please use levels between 1 and 99 here\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ move calculations up the dependency chain (to pull them out of\n  \/\/ inner loops etc.)\n  registerRule(\"move-calculations-up\", moveCalculationsUpRule, 10);\n\n  \/\/ move filters up the dependency chain (to make result sets as small\n  \/\/ as possible as early as possible)\n  registerRule(\"move-filters-up\", moveFiltersUpRule, 20);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ \"Pass 2\": try to remove redundant or unnecessary nodes\n  \/\/\/           use levels between 101 and 199 for this\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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(\"remove-unnecessary-filters\", removeUnnecessaryFiltersRule, 110);\n  \n  \/\/ remove calculations that are never necessary\n  registerRule(\"remove-unnecessary-calculations\", \n               removeUnnecessaryCalculationsRule, 120);\n\n  \/\/ remove redundant sort blocks\n  registerRule(\"remove-redundant-sorts\", removeRedundantSorts, 130);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ \"Pass 3\": interchange EnumerateCollection nodes in all possible ways\n  \/\/\/           this is level 500, please never let new plans from higher\n  \/\/\/           levels go back to this or lower levels!\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  registerRule(\"interchangeAdjacentEnumerations\", \n               interchangeAdjacentEnumerations, 500);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/ \"Pass 4\": moving nodes \"up\" (potentially outside loops) (second try):\n  \/\/           please use levels between 501 and 599 here\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ move calculations up the dependency chain (to pull them out of\n  \/\/ inner loops etc.)\n  registerRule(\"move-calculations-up\", moveCalculationsUpRule, 510);\n\n  \/\/ move filters up the dependency chain (to make result sets as small\n  \/\/ as possible as early as possible)\n  registerRule(\"move-filters-up\", moveFiltersUpRule, 520);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ \"Pass 5\": try to remove redundant or unnecessary nodes (second try)\n  \/\/\/           use levels between 601 and 699 for this\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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(\"remove-unnecessary-filters\", removeUnnecessaryFiltersRule, 610);\n  \n  \/\/ remove calculations that are never necessary\n  registerRule(\"remove-unnecessary-calculations\", \n               removeUnnecessaryCalculationsRule, 620);\n\n  \/\/ remove redundant sort blocks\n  registerRule(\"remove-redundant-sorts\", removeRedundantSorts, 630);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ \"Pass 6\": use indexes if possible for FILTER and\/or SORT nodes\n  \/\/\/           use levels between 701 and 799 for this\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ try to find a filter after an enumerate collection and find an index . . . \n  registerRule(\"use-index-range\", useIndexRange, 710);\n\n  \/\/ try to find sort blocks which are superseeded by indexes\n  registerRule(\"use-index-for-sort\", useIndexForSort, 720);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ END OF OPTIMISATIONS\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ Now sort them by level:\n  std::stable_sort(_rules.begin(), _rules.end());\n}\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"^\\\\(\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @addtogroup\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\\\\)\"\n\/\/ End:\n\n\n<commit_msg>disabled broken rules<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\nstd::vector<Optimizer::Rule> Optimizer::_rules;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ @brief constructor, this will initialize the rules database\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nOptimizer::Optimizer () {\n  if (_rules.empty()) {\n    setupRules();\n  }\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    for (auto p : _plans.list) {\n      p->show();\n      std::cout << std::endl;\n    }\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(\"dummy\", 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->name << \" (\" << &(it->func) << \") with level \"\n                  << it->level << \" on plan \" << count++\n                  << std::endl;\n        try {\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      \/\/ TODO: abort early here if we found a good-enough plan\n      \/\/ a good-enough plan is probably every plan with costs below some\n      \/\/ defined threshold. this requires plan costs to be calculated here\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  for (auto p : _plans.list) {\n    p->show();\n    std::cout << \"costing: \" << p->getCost() << std::endl;\n    std::cout << 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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief set up the optimizer rules once and forever\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid Optimizer::setupRules () {\n  TRI_ASSERT(_rules.empty());\n\n  \/\/ List all the rules in the system here:\n  \/\/ lower level values mean earlier rule execution\n  \/\/ if two rules have the same level value, they will be executed in declaration order\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/ \"Pass 1\": moving nodes \"up\" (potentially outside loops):\n  \/\/           please use levels between 1 and 99 here\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ move calculations up the dependency chain (to pull them out of\n  \/\/ inner loops etc.)\n  registerRule(\"move-calculations-up\", moveCalculationsUpRule, 10);\n\n  \/\/ move filters up the dependency chain (to make result sets as small\n  \/\/ as possible as early as possible)\n  registerRule(\"move-filters-up\", moveFiltersUpRule, 20);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ \"Pass 2\": try to remove redundant or unnecessary nodes\n  \/\/\/           use levels between 101 and 199 for this\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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(\"remove-unnecessary-filters\", removeUnnecessaryFiltersRule, 110);\n  \n  \/\/ remove calculations that are never necessary\n  registerRule(\"remove-unnecessary-calculations\", \n               removeUnnecessaryCalculationsRule, 120);\n\n  \/\/ remove redundant sort blocks\n  registerRule(\"remove-redundant-sorts\", removeRedundantSorts, 130);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ \"Pass 3\": interchange EnumerateCollection nodes in all possible ways\n  \/\/\/           this is level 500, please never let new plans from higher\n  \/\/\/           levels go back to this or lower levels!\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  registerRule(\"interchangeAdjacentEnumerations\", \n               interchangeAdjacentEnumerations, 500);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/ \"Pass 4\": moving nodes \"up\" (potentially outside loops) (second try):\n  \/\/           please use levels between 501 and 599 here\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ move calculations up the dependency chain (to pull them out of\n  \/\/ inner loops etc.)\n  registerRule(\"move-calculations-up\", moveCalculationsUpRule, 510);\n\n  \/\/ move filters up the dependency chain (to make result sets as small\n  \/\/ as possible as early as possible)\n  registerRule(\"move-filters-up\", moveFiltersUpRule, 520);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ \"Pass 5\": try to remove redundant or unnecessary nodes (second try)\n  \/\/\/           use levels between 601 and 699 for this\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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(\"remove-unnecessary-filters\", removeUnnecessaryFiltersRule, 610);\n  \n  \/\/ remove calculations that are never necessary\n  registerRule(\"remove-unnecessary-calculations\", \n               removeUnnecessaryCalculationsRule, 620);\n\n  \/\/ remove redundant sort blocks\n  registerRule(\"remove-redundant-sorts\", removeRedundantSorts, 630);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ \"Pass 6\": use indexes if possible for FILTER and\/or SORT nodes\n  \/\/\/           use levels between 701 and 799 for this\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ try to find a filter after an enumerate collection and find an index . . . \n  \/\/registerRule(\"use-index-range\", useIndexRange, 710);\n\n  \/\/ try to find sort blocks which are superseeded by indexes\n  \/\/registerRule(\"use-index-for-sort\", useIndexForSort, 720);\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ END OF OPTIMISATIONS\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ Now sort them by level:\n  std::stable_sort(_rules.begin(), _rules.end());\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>\n#include <iostream>\n\n#include <chrono>\n#include <random>\n\n#include \"matrix_connected_components\/Algorithm.hpp\"\n#include \"utils\/containers\/Matrix.hpp\"\n\ntemplate <typename T>\nstruct StringRep {};\n\ntemplate <>\nstruct StringRep<uint64_t> {\n  static constexpr std::string_view value{\"uint64_t\"};\n};\n\ntemplate <>\nstruct StringRep<int64_t> {\n  static constexpr std::string_view value{\"int64_t\"};\n};\n\nint main() {\n  \/\/ using ValueType = uint64_t;\n  \/\/ static constexpr int64_t width{6};\n  \/\/ static constexpr int64_t height{5};\n  \/\/ utils::containers::Matrix<ValueType> m{height, width, matrix_connected_components::kUnmarkedField<ValueType>};\n\n  \/\/ std::vector<std::pair<int64_t, int64_t>> markedFields = {\n  \/\/     {0, 0}, {1, 0}, {1, 2}, {1, 3}, {2, 1}, {2, 3}, {3, 1}, {3, 2}, {3, 3}, {4, 4},\n  \/\/ };\n\n  \/\/ for (const auto &[row, column]: markedFields) {\n  \/\/   m.get(row, column) = matrix_connected_components::kMarkedField<ValueType>;\n  \/\/ }\n  \/\/ for (auto row = 0U; row < height; ++row) {\n  \/\/   for (auto column = 0U; column < width; ++column) {\n  \/\/     std::cout << static_cast<ValueType>(m.get(row, column)) << ' ';\n  \/\/   }\n  \/\/   std::cout << std::endl;\n  \/\/ }\n  \/\/ std::cout << std::endl;\n  \/\/ matrix_connected_components::labelConnectedCompnents(m);\n  \/\/ for (auto row = 0U; row < height; ++row) {\n  \/\/   for (auto column = 0U; column < width; ++column) {\n  \/\/     std::cout << static_cast<ValueType>(m.get(row, column)) << ' ';\n  \/\/   }\n  \/\/   std::cout << std::endl;\n  \/\/ }\n\n  static constexpr int64_t kDimension{20000};\n  static constexpr int64_t kNumberOfFields{kDimension * kDimension};\n\n  using ValueType = uint64_t;\n  std::mt19937 mt(1); \/\/ NOLINTNEXTLINE(cert-msc32-c)\n  std::uniform_int_distribution<int64_t> r1(0, kDimension - 1);\n  utils::containers::Matrix<ValueType> matrix(kDimension, kDimension,\n                                              matrix_connected_components::kUnmarkedField<ValueType>);\n\n  static constexpr int64_t kIterations = kNumberOfFields \/ 5 * 2;\n  for (auto i = 0; i < kIterations; ++i) {\n    matrix.get(r1(mt), r1(mt)) = matrix_connected_components::kMarkedField<ValueType>;\n  }\n\n  std::cout << \"Start \" << StringRep<ValueType>::value << '\\n';\n  std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();\n  const auto components = matrix_connected_components::countConnectedComponents(std::move(matrix));\n  std::chrono::steady_clock::time_point end = std::chrono::steady_clock::now();\n  std::cout << \"Done, there are \" << components << \" components.\\n\";\n\n  std::cout << \"Time difference = \" << std::chrono::duration_cast<std::chrono::milliseconds>(end - begin).count()\n            << \"[ms]\" << std::endl;\n\n  return 0;\n}\n<commit_msg>Finalize demo<commit_after>#include <iostream>\n\n#include \"matrix_connected_components\/Algorithm.hpp\"\n#include \"utils\/containers\/Matrix.hpp\"\n\nint main() {\n  using ValueType = uint8_t;\n  static constexpr int64_t width{5};\n  static constexpr int64_t height{5};\n  utils::containers::Matrix<ValueType> m{height, width, matrix_connected_components::kUnmarkedField<ValueType>};\n\n  std::vector<std::pair<int64_t, int64_t>> markedFields = {\n      {0, 0}, {1, 0}, {1, 2}, {1, 3}, {2, 1}, {2, 3}, {3, 1}, {3, 2}, {3, 3}, {4, 4},\n  };\n\n  for (const auto &[row, column]: markedFields) {\n    m.get(row, column) = matrix_connected_components::kMarkedField<ValueType>;\n  }\n\n  std::cout << \"Matrix before running the algorithm: \\n\";\n\n  for (auto row = 0U; row < height; ++row) {\n    for (auto column = 0U; column < width; ++column) {\n      std::cout << static_cast<int>(m.get(row, column)) << ' ';\n    }\n    std::cout << std::endl;\n  }\n  const auto numberOfConnectedComponents = matrix_connected_components::countConnectedComponents(m);\n  std::cout << \"Number of connected components: \" << numberOfConnectedComponents << '\\n';\n\n  m = matrix_connected_components::labelConnectedComponents(std::move(m));\n\n  std::cout << \"Matrix after running the algorithm: \\n\";\n  for (auto row = 0U; row < height; ++row) {\n    for (auto column = 0U; column < width; ++column) {\n      std::cout << static_cast<int>(m.get(row, column)) << ' ';\n    }\n    std::cout << std::endl;\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"crv.h\"\n\n\/\/ Include <gtest\/gtest.h> _after_ \"crv.h\"\n#include \"gtest\/gtest.h\"\n#include <array>\n\nTEST(CrvFunctionalTest, SafeIf)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  bool error = false;\n  do\n  {\n    crv::External<char> x('A');\n    if (crv::tracer().append_guard(x == '?'))\n      x = 'B';\n    crv::Internal<char> a(x);\n\n    crv::tracer().add_error(!(a == 'B' || a == 'A'));\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_FALSE(error);\n}\n\nvoid fib_t0(\n  const unsigned N,\n  crv::External<int>& i,\n  crv::External<int>& j)\n{\n  int k;\n  for (k = 0; k < N; k++)\n  {\n    i = i + j;\n  }\n}\n\nvoid fib_t1(\n  const unsigned N,\n  crv::External<int>& i,\n  crv::External<int>& j)\n{\n  int k;\n  for (k = 0; k < N; k++)\n  {\n    j = j + i;\n  }\n}\n\n\/\/ Adapted from SV-COMP'13 benchmark:\n\/\/   https:\/\/svn.sosy-lab.org\/software\/sv-benchmarks\/trunk\/c\/pthread\/fib_bench_longer_true.c\nTEST(CrvFunctionalTest, UnsatFib6)\n{\n  constexpr unsigned N = 6;\n\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::External<int> i = 1, j = 1;\n  crv::Thread t0(fib_t0, N, i, j);\n  crv::Thread t1(fib_t1, N, i, j);\n\n  crv::tracer().add_error(377 < i || 377 < j);\n\n  t0.join();\n  t1.join();\n\n  EXPECT_TRUE(crv::tracer().assertions().empty());\n  EXPECT_FALSE(crv::tracer().errors().empty());\n  EXPECT_TRUE(smt::unsat == encoder.check(crv::tracer()));\n  EXPECT_FALSE(crv::tracer().flip());\n}\n\n\/\/ Adapted from SV-COMP'13 benchmark:\n\/\/  https:\/\/svn.sosy-lab.org\/software\/sv-benchmarks\/trunk\/c\/pthread\/fib_bench_longer_false-unreach-label.c\nTEST(CrvFunctionalTest, SatFib6)\n{\n  constexpr unsigned N = 6;\n\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::External<int> i = 1, j = 1;\n  crv::Thread t0(fib_t0, N, i, j);\n  crv::Thread t1(fib_t1, N, i, j);\n\n  crv::tracer().add_error(377 <= i || 377 <= j);\n\n  t0.join();\n  t1.join();\n\n  EXPECT_TRUE(crv::tracer().assertions().empty());\n  EXPECT_FALSE(crv::tracer().errors().empty());\n  EXPECT_TRUE(smt::sat == encoder.check(crv::tracer()));\n  EXPECT_FALSE(crv::tracer().flip());\n}\n\nvoid stateful_t0(\n  crv::Mutex& mutex,\n  crv::External<int>& i,\n  crv::External<int>& j)\n{\n  mutex.lock();\n  i = i + 1;\n  mutex.unlock();\n\n  mutex.lock();\n  j = j + 1;\n  mutex.unlock();\n}\n\nvoid stateful_t1(\n  crv::Mutex& mutex,\n  crv::External<int>& i,\n  crv::External<int>& j)\n{\n  mutex.lock();\n  i = i + 5;\n  mutex.unlock();\n\n  mutex.lock();\n  j = j - 6;\n  mutex.unlock();\n}\n\n\/\/ Adapted from SV-COMP'13 benchmark:\n\/\/  https:\/\/svn.sosy-lab.org\/software\/sv-benchmarks\/trunk\/c\/pthread\/stateful01_true.c\nTEST(CrvFunctionalTest, UnsatStateful)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Mutex mutex;\n  crv::External<int> i(10), j(10);\n\n  bool error = false;\n  do\n  {\n    crv::Thread t0(stateful_t0, mutex, i, j);\n    crv::Thread t1(stateful_t1, mutex, i, j);\n\n    t0.join();\n    t1.join();\n\n    crv::tracer().add_error(i != 16 || j != 5);\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_FALSE(error);\n}\n\n\/\/ Adapted from SV-COMP'13 benchmark:\n\/\/  https:\/\/svn.sosy-lab.org\/software\/sv-benchmarks\/trunk\/c\/pthread\/stateful01_false-unreach-label.c\nTEST(CrvFunctionalTest, SatStateful)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Mutex mutex;\n  crv::External<int> i(10), j(10);\n\n  bool error = false;\n  do\n  {\n    crv::Thread t0(stateful_t0, mutex, i, j);\n    crv::Thread t1(stateful_t1, mutex, i, j);\n\n    t0.join();\n    t1.join();\n\n    crv::tracer().add_error(i == 16 && j == 5);\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_TRUE(error);\n}\n\nvoid sat_stack_t0(\n  const unsigned N,\n  crv::Mutex& mutex,\n  crv::External<unsigned int>& top,\n  crv::External<int>& flag)\n{\n  int i;\n  for (i = 0; i < N; i++)\n  {\n    mutex.lock();\n    top = top + 1U;\n    flag = 1;\n    mutex.unlock();\n  }\n}\n\nvoid sat_stack_t1(\nconst unsigned N,\n  crv::Mutex& mutex,\n  crv::External<unsigned int>& top,\n  crv::External<int>& flag)\n{\n  int i;\n  for (i = 0; i < N; i++)\n  {\n    mutex.lock();\n    if (crv::tracer().append_guard(flag == 1))\n    {\n      crv::tracer().add_error(top == 0U);\n      top = top - 1U;\n    }\n    mutex.unlock();\n  }\n}\n\nTEST(CrvFunctionalTest, SatStack)\n{\n  constexpr unsigned N = 5;\n\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Mutex mutex;\n  crv::External<unsigned int> top(0U);\n  crv::External<int> flag(0);\n\n  bool error = false;\n  do\n  {\n    crv::Thread t0(sat_stack_t0, N, mutex, top, flag);\n    crv::Thread t1(sat_stack_t1, N, mutex, top, flag);\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_TRUE(error);\n}\n\nvoid unsat_stack_t0(\n  const unsigned N,\n  crv::Mutex& mutex,\n  crv::External<unsigned int>& top)\n{\n  int i;\n  for (i = 0; i < N; i++)\n  {\n    mutex.lock();\n    top = top + 1U;\n    mutex.unlock();\n  }\n}\n\nvoid unsat_stack_t1(\n  const unsigned N,\n  crv::Mutex& mutex,\n  crv::External<unsigned int>& top)\n{\n  int i;\n  for (i = 0; i < N; i++)\n  {\n    mutex.lock();\n    if (crv::tracer().append_guard(0U < top))\n    {\n      crv::tracer().add_error(top == 0U);\n      top = top - 1U;\n    }\n    mutex.unlock();\n  }\n}\n\nTEST(CrvFunctionalTest, UnsatStack)\n{\n  constexpr unsigned N = 5;\n\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Mutex mutex;\n  crv::External<unsigned int> top(0U);\n\n  bool error = false;\n  do\n  {\n    crv::Thread t0(unsat_stack_t0, N, mutex, top);\n    crv::Thread t1(unsat_stack_t1, N, mutex, top);\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_FALSE(error);\n}\n\nvoid sat_communication_f(crv::Channel<int>& s, crv::Channel<int>& t)\n{\n  t.send(1);\n  crv::Internal<int> r(s.recv());\n  s.send(r);\n}\n\nvoid sat_communication_g(crv::Channel<int>& s, crv::Channel<int>& t)\n{\n  crv::Internal<int> r(t.recv());\n  s.send(r);\n}\n\nvoid sat_communication_h(crv::Channel<int>& s)\n{\n  s.recv();\n}\n\nTEST(CrvFunctionalTest, SatCommunication)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Channel<int> s, t;\n  crv::Thread f(sat_communication_f, s, t);\n  crv::Thread g(sat_communication_g, s, t);\n  crv::Thread h(sat_communication_h, s);\n\n  EXPECT_TRUE(crv::tracer().errors().empty());\n  EXPECT_EQ(smt::sat, encoder.check_deadlock(crv::tracer()));\n}\n\nvoid sat_communication_g_prime(crv::Channel<int>& s, crv::Channel<int>& t)\n{\n  crv::Internal<int> r(t.recv());\n  s.send(r);\n  s.recv();\n}\n\nTEST(CrvFunctionalTest, UnsatCommunication)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Channel<int> s, t;\n  crv::Thread f(sat_communication_f, s, t);\n  crv::Thread g_prime(sat_communication_g_prime, s, t);\n\n  EXPECT_TRUE(crv::tracer().errors().empty());\n  EXPECT_EQ(smt::unsat, encoder.check_deadlock(crv::tracer()));\n}\n\nvoid unsat_communication_deadlock_with_guard_f(crv::Channel<int>& c)\n{\n  EXPECT_TRUE(crv::tracer().append_guard(6 == c.recv()));\n  c.send(7);\n}\n\nvoid unsat_communication_deadlock_with_guard_g(crv::Channel<int>& c)\n{\n  c.send(6);\n  c.recv();\n}\n\nTEST(CrvFunctionalTest, UnsatCommunicationDeadlockWithGuard)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Channel<int> c;\n  crv::Thread f(unsat_communication_deadlock_with_guard_f, c);\n  crv::Thread g(unsat_communication_deadlock_with_guard_g, c);\n\n  EXPECT_EQ(smt::unsat, encoder.check_deadlock(crv::tracer()));\n}\n\nvoid sat_communication_deadlock_with_guard_f(crv::Channel<int>& c)\n{\n  EXPECT_TRUE(crv::tracer().append_guard(6 != c.recv()));\n  c.send(7);\n}\n\nvoid sat_communication_deadlock_with_guard_g(crv::Channel<int>& c)\n{\n  c.send(6);\n  c.recv();\n}\n\nTEST(CrvFunctionalTest, SatCommunicationDeadlockWithGuard)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Channel<int> c;\n  crv::Thread f(sat_communication_deadlock_with_guard_f, c);\n  crv::Thread g(sat_communication_deadlock_with_guard_g, c);\n\n  EXPECT_EQ(smt::sat, encoder.check_deadlock(crv::tracer()));\n}\n\n\/\/ N is the number of philosophers\ntemplate<size_t N>\nstruct DiningTable\n{\n  std::array<crv::Channel<int>, N> picksup;\n  std::array<crv::Channel<int>, N> putsdown;\n};\n\n\/\/ Allow fork to be used twice\ntemplate<size_t N>\nvoid phil_fork(size_t i, DiningTable<N>& t)\n{\n  t.picksup.at(i).recv();\n  t.putsdown.at(i).recv();\n  t.picksup.at(i).recv();\n  t.putsdown.at(i).recv();\n}\n\n\/\/ Picks up left and then right fork;\n\/\/ finally, puts down both forks\ntemplate<size_t N>\nvoid phil_person(size_t i, DiningTable<N>& t)\n{\n  t.picksup.at(i).send(i);\n  t.picksup.at((i + 1) % N).send(i);\n  t.putsdown.at(i).send(i);\n  t.putsdown.at((i + 1) % N).send(i);\n}\n\n\/\/ Picks up right fork then left fork;\n\/\/ finally, puts down both forks\ntemplate<size_t N>\nvoid phil_different_person(size_t i, DiningTable<N>& t)\n{\n  t.picksup.at((i + 1) % N).send(i);\n  t.picksup.at(i).send(i);\n  t.putsdown.at(i).send(i);\n  t.putsdown.at((i + 1) % N).send(i);\n}\n\nTEST(CrvFunctionalTest, UnsatDiningPhilosophersDeadlock)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  constexpr size_t N = 5;\n  DiningTable<N> t;\n\n  for (int i = 0; i < N; i++)\n  {\n    crv::Thread fork(phil_fork<N>, i, t);\n\n    if (i == 0)\n      crv::Thread person(phil_different_person<N>, i, t);\n    else\n      crv::Thread person(phil_person<N>, i, t);\n  }\n\n  EXPECT_EQ(smt::unsat, encoder.check_deadlock(crv::tracer()));\n}\n\nTEST(CrvFunctionalTest, SatDiningPhilosophersDeadlock)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  constexpr size_t N = 2;\n  DiningTable<N> t;\n\n  for (int i = 0; i < N; i++)\n  {\n    crv::Thread fork(phil_fork<N>, i, t);\n    crv::Thread person(phil_person<N>, i, t);\n  }\n\n  EXPECT_EQ(smt::sat, encoder.check_deadlock(crv::tracer()));\n}\n\n<commit_msg>Add CSP code of the dining philosophers problem<commit_after>#include \"crv.h\"\n\n\/\/ Include <gtest\/gtest.h> _after_ \"crv.h\"\n#include \"gtest\/gtest.h\"\n#include <array>\n\nTEST(CrvFunctionalTest, SafeIf)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  bool error = false;\n  do\n  {\n    crv::External<char> x('A');\n    if (crv::tracer().append_guard(x == '?'))\n      x = 'B';\n    crv::Internal<char> a(x);\n\n    crv::tracer().add_error(!(a == 'B' || a == 'A'));\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_FALSE(error);\n}\n\nvoid fib_t0(\n  const unsigned N,\n  crv::External<int>& i,\n  crv::External<int>& j)\n{\n  int k;\n  for (k = 0; k < N; k++)\n  {\n    i = i + j;\n  }\n}\n\nvoid fib_t1(\n  const unsigned N,\n  crv::External<int>& i,\n  crv::External<int>& j)\n{\n  int k;\n  for (k = 0; k < N; k++)\n  {\n    j = j + i;\n  }\n}\n\n\/\/ Adapted from SV-COMP'13 benchmark:\n\/\/   https:\/\/svn.sosy-lab.org\/software\/sv-benchmarks\/trunk\/c\/pthread\/fib_bench_longer_true.c\nTEST(CrvFunctionalTest, UnsatFib6)\n{\n  constexpr unsigned N = 6;\n\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::External<int> i = 1, j = 1;\n  crv::Thread t0(fib_t0, N, i, j);\n  crv::Thread t1(fib_t1, N, i, j);\n\n  crv::tracer().add_error(377 < i || 377 < j);\n\n  t0.join();\n  t1.join();\n\n  EXPECT_TRUE(crv::tracer().assertions().empty());\n  EXPECT_FALSE(crv::tracer().errors().empty());\n  EXPECT_TRUE(smt::unsat == encoder.check(crv::tracer()));\n  EXPECT_FALSE(crv::tracer().flip());\n}\n\n\/\/ Adapted from SV-COMP'13 benchmark:\n\/\/  https:\/\/svn.sosy-lab.org\/software\/sv-benchmarks\/trunk\/c\/pthread\/fib_bench_longer_false-unreach-label.c\nTEST(CrvFunctionalTest, SatFib6)\n{\n  constexpr unsigned N = 6;\n\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::External<int> i = 1, j = 1;\n  crv::Thread t0(fib_t0, N, i, j);\n  crv::Thread t1(fib_t1, N, i, j);\n\n  crv::tracer().add_error(377 <= i || 377 <= j);\n\n  t0.join();\n  t1.join();\n\n  EXPECT_TRUE(crv::tracer().assertions().empty());\n  EXPECT_FALSE(crv::tracer().errors().empty());\n  EXPECT_TRUE(smt::sat == encoder.check(crv::tracer()));\n  EXPECT_FALSE(crv::tracer().flip());\n}\n\nvoid stateful_t0(\n  crv::Mutex& mutex,\n  crv::External<int>& i,\n  crv::External<int>& j)\n{\n  mutex.lock();\n  i = i + 1;\n  mutex.unlock();\n\n  mutex.lock();\n  j = j + 1;\n  mutex.unlock();\n}\n\nvoid stateful_t1(\n  crv::Mutex& mutex,\n  crv::External<int>& i,\n  crv::External<int>& j)\n{\n  mutex.lock();\n  i = i + 5;\n  mutex.unlock();\n\n  mutex.lock();\n  j = j - 6;\n  mutex.unlock();\n}\n\n\/\/ Adapted from SV-COMP'13 benchmark:\n\/\/  https:\/\/svn.sosy-lab.org\/software\/sv-benchmarks\/trunk\/c\/pthread\/stateful01_true.c\nTEST(CrvFunctionalTest, UnsatStateful)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Mutex mutex;\n  crv::External<int> i(10), j(10);\n\n  bool error = false;\n  do\n  {\n    crv::Thread t0(stateful_t0, mutex, i, j);\n    crv::Thread t1(stateful_t1, mutex, i, j);\n\n    t0.join();\n    t1.join();\n\n    crv::tracer().add_error(i != 16 || j != 5);\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_FALSE(error);\n}\n\n\/\/ Adapted from SV-COMP'13 benchmark:\n\/\/  https:\/\/svn.sosy-lab.org\/software\/sv-benchmarks\/trunk\/c\/pthread\/stateful01_false-unreach-label.c\nTEST(CrvFunctionalTest, SatStateful)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Mutex mutex;\n  crv::External<int> i(10), j(10);\n\n  bool error = false;\n  do\n  {\n    crv::Thread t0(stateful_t0, mutex, i, j);\n    crv::Thread t1(stateful_t1, mutex, i, j);\n\n    t0.join();\n    t1.join();\n\n    crv::tracer().add_error(i == 16 && j == 5);\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_TRUE(error);\n}\n\nvoid sat_stack_t0(\n  const unsigned N,\n  crv::Mutex& mutex,\n  crv::External<unsigned int>& top,\n  crv::External<int>& flag)\n{\n  int i;\n  for (i = 0; i < N; i++)\n  {\n    mutex.lock();\n    top = top + 1U;\n    flag = 1;\n    mutex.unlock();\n  }\n}\n\nvoid sat_stack_t1(\nconst unsigned N,\n  crv::Mutex& mutex,\n  crv::External<unsigned int>& top,\n  crv::External<int>& flag)\n{\n  int i;\n  for (i = 0; i < N; i++)\n  {\n    mutex.lock();\n    if (crv::tracer().append_guard(flag == 1))\n    {\n      crv::tracer().add_error(top == 0U);\n      top = top - 1U;\n    }\n    mutex.unlock();\n  }\n}\n\nTEST(CrvFunctionalTest, SatStack)\n{\n  constexpr unsigned N = 5;\n\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Mutex mutex;\n  crv::External<unsigned int> top(0U);\n  crv::External<int> flag(0);\n\n  bool error = false;\n  do\n  {\n    crv::Thread t0(sat_stack_t0, N, mutex, top, flag);\n    crv::Thread t1(sat_stack_t1, N, mutex, top, flag);\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_TRUE(error);\n}\n\nvoid unsat_stack_t0(\n  const unsigned N,\n  crv::Mutex& mutex,\n  crv::External<unsigned int>& top)\n{\n  int i;\n  for (i = 0; i < N; i++)\n  {\n    mutex.lock();\n    top = top + 1U;\n    mutex.unlock();\n  }\n}\n\nvoid unsat_stack_t1(\n  const unsigned N,\n  crv::Mutex& mutex,\n  crv::External<unsigned int>& top)\n{\n  int i;\n  for (i = 0; i < N; i++)\n  {\n    mutex.lock();\n    if (crv::tracer().append_guard(0U < top))\n    {\n      crv::tracer().add_error(top == 0U);\n      top = top - 1U;\n    }\n    mutex.unlock();\n  }\n}\n\nTEST(CrvFunctionalTest, UnsatStack)\n{\n  constexpr unsigned N = 5;\n\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Mutex mutex;\n  crv::External<unsigned int> top(0U);\n\n  bool error = false;\n  do\n  {\n    crv::Thread t0(unsat_stack_t0, N, mutex, top);\n    crv::Thread t1(unsat_stack_t1, N, mutex, top);\n\n    if (!crv::tracer().errors().empty() &&\n        smt::sat == encoder.check(crv::tracer()))\n      error = true;\n  }\n  while (crv::tracer().flip());\n  EXPECT_FALSE(error);\n}\n\nvoid sat_communication_f(crv::Channel<int>& s, crv::Channel<int>& t)\n{\n  t.send(1);\n  crv::Internal<int> r(s.recv());\n  s.send(r);\n}\n\nvoid sat_communication_g(crv::Channel<int>& s, crv::Channel<int>& t)\n{\n  crv::Internal<int> r(t.recv());\n  s.send(r);\n}\n\nvoid sat_communication_h(crv::Channel<int>& s)\n{\n  s.recv();\n}\n\nTEST(CrvFunctionalTest, SatCommunication)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Channel<int> s, t;\n  crv::Thread f(sat_communication_f, s, t);\n  crv::Thread g(sat_communication_g, s, t);\n  crv::Thread h(sat_communication_h, s);\n\n  EXPECT_TRUE(crv::tracer().errors().empty());\n  EXPECT_EQ(smt::sat, encoder.check_deadlock(crv::tracer()));\n}\n\nvoid sat_communication_g_prime(crv::Channel<int>& s, crv::Channel<int>& t)\n{\n  crv::Internal<int> r(t.recv());\n  s.send(r);\n  s.recv();\n}\n\nTEST(CrvFunctionalTest, UnsatCommunication)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Channel<int> s, t;\n  crv::Thread f(sat_communication_f, s, t);\n  crv::Thread g_prime(sat_communication_g_prime, s, t);\n\n  EXPECT_TRUE(crv::tracer().errors().empty());\n  EXPECT_EQ(smt::unsat, encoder.check_deadlock(crv::tracer()));\n}\n\nvoid unsat_communication_deadlock_with_guard_f(crv::Channel<int>& c)\n{\n  EXPECT_TRUE(crv::tracer().append_guard(6 == c.recv()));\n  c.send(7);\n}\n\nvoid unsat_communication_deadlock_with_guard_g(crv::Channel<int>& c)\n{\n  c.send(6);\n  c.recv();\n}\n\nTEST(CrvFunctionalTest, UnsatCommunicationDeadlockWithGuard)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Channel<int> c;\n  crv::Thread f(unsat_communication_deadlock_with_guard_f, c);\n  crv::Thread g(unsat_communication_deadlock_with_guard_g, c);\n\n  EXPECT_EQ(smt::unsat, encoder.check_deadlock(crv::tracer()));\n}\n\nvoid sat_communication_deadlock_with_guard_f(crv::Channel<int>& c)\n{\n  EXPECT_TRUE(crv::tracer().append_guard(6 != c.recv()));\n  c.send(7);\n}\n\nvoid sat_communication_deadlock_with_guard_g(crv::Channel<int>& c)\n{\n  c.send(6);\n  c.recv();\n}\n\nTEST(CrvFunctionalTest, SatCommunicationDeadlockWithGuard)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  crv::Channel<int> c;\n  crv::Thread f(sat_communication_deadlock_with_guard_f, c);\n  crv::Thread g(sat_communication_deadlock_with_guard_g, c);\n\n  EXPECT_EQ(smt::sat, encoder.check_deadlock(crv::tracer()));\n}\n\n\/\/ N is the number of philosophers\n\n\/\/ For comparison, the equivalent CSP code of\n\/\/ {Sat,Unsat}DiningPhilosophersDeadlock:\n\/\/\n\/\/ N = 5\n\/\/ \n\/\/ FORK_ID = {0..N-1}\n\/\/ PHIL_ID = {0..N-1}\n\/\/ \n\/\/ channel picksup, putsdown:FORK_ID.PHIL_ID\n\/\/ \n\/\/ PHIL(i) = picksup!i!i -> picksup!((i+1)%N)!i ->\n\/\/   putsdown!((i+1)%N)!i -> putsdown!i!i -> PHIL(i)\n\/\/ \n\/\/ FORK(i) = picksup!i?j -> putsdown!i!j -> FORK(i)\n\/\/ \n\/\/ PHILS = ||| i:PHIL_ID@ PHIL(i)\n\/\/ FORKS = ||| i:FORK_ID@ FORK(i)\n\/\/ \n\/\/ SAT_SYSTEM = PHILS[|{|picksup, putsdown|}|]FORKS\n\/\/ assert SAT_SYSTEM :[deadlock free [F]]\n\/\/ \n\/\/ LPHIL(i) = picksup!((i+1)%N)!i -> picksup!i!i ->\n\/\/   putsdown!((i+1)%N)!i -> putsdown!i!i -> LPHIL(i)\n\/\/ \n\/\/ PHILS' = ||| i:PHIL_ID @ if i==0 then LPHIL(0) else PHIL(i)\n\/\/ \n\/\/ UNSAT_SYSTEM = PHILS'[|{|picksup, putsdown|}|]FORKS\n\/\/ assert UNSAT_SYSTEM :[deadlock free [F]]\ntemplate<size_t N>\nstruct DiningTable\n{\n  std::array<crv::Channel<int>, N> picksup;\n  std::array<crv::Channel<int>, N> putsdown;\n};\n\n\/\/ Allow fork to be used twice, so it can be picked up and put\n\/\/ down by the person to the fork's right and left\ntemplate<size_t N>\nvoid phil_fork(size_t i, DiningTable<N>& t)\n{\n  t.picksup.at(i).recv();\n  t.putsdown.at(i).recv();\n  t.picksup.at(i).recv();\n  t.putsdown.at(i).recv();\n}\n\n\/\/ Picks up left and then right fork;\n\/\/ finally, puts down both forks\ntemplate<size_t N>\nvoid phil_person(size_t i, DiningTable<N>& t)\n{\n  t.picksup.at(i).send(i);\n  t.picksup.at((i + 1) % N).send(i);\n  t.putsdown.at(i).send(i);\n  t.putsdown.at((i + 1) % N).send(i);\n}\n\n\/\/ Picks up right fork then left fork;\n\/\/ finally, puts down both forks\ntemplate<size_t N>\nvoid phil_different_person(size_t i, DiningTable<N>& t)\n{\n  t.picksup.at((i + 1) % N).send(i);\n  t.picksup.at(i).send(i);\n  t.putsdown.at(i).send(i);\n  t.putsdown.at((i + 1) % N).send(i);\n}\n\nTEST(CrvFunctionalTest, UnsatDiningPhilosophersDeadlock)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  constexpr size_t N = 5;\n  DiningTable<N> t;\n\n  for (int i = 0; i < N; i++)\n  {\n    crv::Thread fork(phil_fork<N>, i, t);\n\n    if (i == 0)\n      crv::Thread person(phil_different_person<N>, i, t);\n    else\n      crv::Thread person(phil_person<N>, i, t);\n  }\n\n  EXPECT_EQ(smt::unsat, encoder.check_deadlock(crv::tracer()));\n}\n\nTEST(CrvFunctionalTest, SatDiningPhilosophersDeadlock)\n{\n  crv::tracer().reset();\n  crv::Encoder encoder;\n\n  constexpr size_t N = 2;\n  DiningTable<N> t;\n\n  for (int i = 0; i < N; i++)\n  {\n    crv::Thread fork(phil_fork<N>, i, t);\n    crv::Thread person(phil_person<N>, i, t);\n  }\n\n  EXPECT_EQ(smt::sat, encoder.check_deadlock(crv::tracer()));\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra. Eigen itself is part of the KDE project.\n\/\/\n\/\/ Copyright (C) 2008-2009 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#include \"main.h\"\n#include <Eigen\/Eigenvalues>\n#include <Eigen\/LU>\n\n\/* Check that two column vectors are approximately equal upto permutations,\n   by checking that the k-th power sums are equal for k = 1, ..., vec1.rows() *\/\ntemplate<typename VectorType>\nvoid verify_is_approx_upto_permutation(const VectorType& vec1, const VectorType& vec2)\n{\n  VERIFY(vec1.cols() == 1);\n  VERIFY(vec2.cols() == 1);\n  VERIFY(vec1.rows() == vec2.rows());\n  for (int k = 1; k <= vec1.rows(); ++k)\n  {\n    VERIFY_IS_APPROX(vec1.array().pow(k).sum(), vec2.array().pow(k).sum());\n  }\n}\n\n\ntemplate<typename MatrixType> void eigensolver(const MatrixType& m)\n{\n  \/* this test covers the following files:\n     ComplexEigenSolver.h, and indirectly ComplexSchur.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, 1> VectorType;\n  typedef Matrix<RealScalar, MatrixType::RowsAtCompileTime, 1> RealVectorType;\n  typedef typename std::complex<typename NumTraits<typename MatrixType::Scalar>::Real> Complex;\n\n  MatrixType a = MatrixType::Random(rows,cols);\n  MatrixType symmA =  a.adjoint() * a;\n\n  ComplexEigenSolver<MatrixType> ei0(symmA);\n  VERIFY_IS_APPROX(symmA * ei0.eigenvectors(), ei0.eigenvectors() * ei0.eigenvalues().asDiagonal());\n\n  ComplexEigenSolver<MatrixType> ei1(a);\n  VERIFY_IS_APPROX(a * ei1.eigenvectors(), ei1.eigenvectors() * ei1.eigenvalues().asDiagonal());\n  \/\/ Note: If MatrixType is real then a.eigenvalues() uses EigenSolver and thus\n  \/\/ another algorithm so results may differ slightly\n  verify_is_approx_upto_permutation(a.eigenvalues(), ei1.eigenvalues());\n  \n  \/\/ Regression test for issue #66\n  MatrixType z = MatrixType::Zero(rows,cols);\n  ComplexEigenSolver<MatrixType> eiz(z);\n  VERIFY((eiz.eigenvalues().cwiseEqual(0)).all());\n\n  MatrixType id = MatrixType::Identity(rows, cols);\n  VERIFY_IS_APPROX(id.operatorNorm(), RealScalar(1));\n}\n\ntemplate<typename MatrixType> void eigensolver_verify_assert()\n{\n  ComplexEigenSolver<MatrixType> eig;\n  VERIFY_RAISES_ASSERT(eig.eigenvectors())\n  VERIFY_RAISES_ASSERT(eig.eigenvalues())\n}\n\nvoid test_eigensolver_complex()\n{\n  for(int i = 0; i < g_repeat; i++) {\n    CALL_SUBTEST_1( eigensolver(Matrix4cf()) );\n    CALL_SUBTEST_2( eigensolver(MatrixXcd(14,14)) );\n    CALL_SUBTEST_3( eigensolver(Matrix<std::complex<float>, 1, 1>()) );\n    CALL_SUBTEST_4( eigensolver(Matrix3f()) );\n  }\n\n  CALL_SUBTEST_1( eigensolver_verify_assert(Matrix4cf()) );\n  CALL_SUBTEST_2( eigensolver_verify_assert(MatrixXcd(14,14)) );\n  CALL_SUBTEST_3( eigensolver_verify_assert(Matrix<std::complex<float>, 1, 1>()) );\n  CALL_SUBTEST_4( eigensolver_verify_assert(Matrix3f()) );\n\n  \/\/ Test problem size constructors\n  CALL_SUBTEST_5(ComplexEigenSolver<MatrixXf>(10));\n}\n<commit_msg>Fix stupid compilation error in test.<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra. Eigen itself is part of the KDE project.\n\/\/\n\/\/ Copyright (C) 2008-2009 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#include \"main.h\"\n#include <Eigen\/Eigenvalues>\n#include <Eigen\/LU>\n\n\/* Check that two column vectors are approximately equal upto permutations,\n   by checking that the k-th power sums are equal for k = 1, ..., vec1.rows() *\/\ntemplate<typename VectorType>\nvoid verify_is_approx_upto_permutation(const VectorType& vec1, const VectorType& vec2)\n{\n  VERIFY(vec1.cols() == 1);\n  VERIFY(vec2.cols() == 1);\n  VERIFY(vec1.rows() == vec2.rows());\n  for (int k = 1; k <= vec1.rows(); ++k)\n  {\n    VERIFY_IS_APPROX(vec1.array().pow(k).sum(), vec2.array().pow(k).sum());\n  }\n}\n\n\ntemplate<typename MatrixType> void eigensolver(const MatrixType& m)\n{\n  \/* this test covers the following files:\n     ComplexEigenSolver.h, and indirectly ComplexSchur.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, 1> VectorType;\n  typedef Matrix<RealScalar, MatrixType::RowsAtCompileTime, 1> RealVectorType;\n  typedef typename std::complex<typename NumTraits<typename MatrixType::Scalar>::Real> Complex;\n\n  MatrixType a = MatrixType::Random(rows,cols);\n  MatrixType symmA =  a.adjoint() * a;\n\n  ComplexEigenSolver<MatrixType> ei0(symmA);\n  VERIFY_IS_APPROX(symmA * ei0.eigenvectors(), ei0.eigenvectors() * ei0.eigenvalues().asDiagonal());\n\n  ComplexEigenSolver<MatrixType> ei1(a);\n  VERIFY_IS_APPROX(a * ei1.eigenvectors(), ei1.eigenvectors() * ei1.eigenvalues().asDiagonal());\n  \/\/ Note: If MatrixType is real then a.eigenvalues() uses EigenSolver and thus\n  \/\/ another algorithm so results may differ slightly\n  verify_is_approx_upto_permutation(a.eigenvalues(), ei1.eigenvalues());\n  \n  \/\/ Regression test for issue #66\n  MatrixType z = MatrixType::Zero(rows,cols);\n  ComplexEigenSolver<MatrixType> eiz(z);\n  VERIFY((eiz.eigenvalues().cwiseEqual(0)).all());\n\n  MatrixType id = MatrixType::Identity(rows, cols);\n  VERIFY_IS_APPROX(id.operatorNorm(), RealScalar(1));\n}\n\ntemplate<typename MatrixType> void eigensolver_verify_assert()\n{\n  ComplexEigenSolver<MatrixType> eig;\n  VERIFY_RAISES_ASSERT(eig.eigenvectors())\n  VERIFY_RAISES_ASSERT(eig.eigenvalues())\n}\n\nvoid test_eigensolver_complex()\n{\n  for(int i = 0; i < g_repeat; i++) {\n    CALL_SUBTEST_1( eigensolver(Matrix4cf()) );\n    CALL_SUBTEST_2( eigensolver(MatrixXcd(14,14)) );\n    CALL_SUBTEST_3( eigensolver(Matrix<std::complex<float>, 1, 1>()) );\n    CALL_SUBTEST_4( eigensolver(Matrix3f()) );\n  }\n\n  CALL_SUBTEST_1( eigensolver_verify_assert<Matrix4cf>() );\n  CALL_SUBTEST_2( eigensolver_verify_assert<MatrixXcd>() );\n  CALL_SUBTEST_3(( eigensolver_verify_assert<Matrix<std::complex<float>, 1, 1> >() ));\n  CALL_SUBTEST_4( eigensolver_verify_assert<Matrix3f>() );\n\n  \/\/ Test problem size constructors\n  CALL_SUBTEST_5(ComplexEigenSolver<MatrixXf>(10));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra. Eigen itself is part of the KDE project.\n\/\/\n\/\/ Copyright (C) 2008-2009 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#include \"main.h\"\n#include <Eigen\/Eigenvalues>\n#include <Eigen\/LU>\n\ntemplate<typename MatrixType> void eigensolver(const MatrixType& m)\n{\n  \/* this test covers the following files:\n     ComplexEigenSolver.h, and indirectly ComplexSchur.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, 1> VectorType;\n  typedef Matrix<RealScalar, MatrixType::RowsAtCompileTime, 1> RealVectorType;\n  typedef typename std::complex<typename NumTraits<typename MatrixType::Scalar>::Real> Complex;\n\n  MatrixType a = MatrixType::Random(rows,cols);\n  MatrixType symmA =  a.adjoint() * a;\n\n  ComplexEigenSolver<MatrixType> ei0(symmA);\n  VERIFY_IS_APPROX(symmA * ei0.eigenvectors(), ei0.eigenvectors() * ei0.eigenvalues().asDiagonal());\n\n  ComplexEigenSolver<MatrixType> ei1(a);\n  VERIFY_IS_APPROX(a * ei1.eigenvectors(), ei1.eigenvectors() * ei1.eigenvalues().asDiagonal());\n\n}\n\nvoid test_eigensolver_complex()\n{\n  for(int i = 0; i < g_repeat; i++) {\n    CALL_SUBTEST( eigensolver(Matrix4cf()) );\n    CALL_SUBTEST( eigensolver(MatrixXcd(14,14)) );\n  }\n}\n\n<commit_msg>Add regression test for issue #66 (ComplexSchur of zero matrix).<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra. Eigen itself is part of the KDE project.\n\/\/\n\/\/ Copyright (C) 2008-2009 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#include \"main.h\"\n#include <Eigen\/Eigenvalues>\n#include <Eigen\/LU>\n\ntemplate<typename MatrixType> void eigensolver(const MatrixType& m)\n{\n  \/* this test covers the following files:\n     ComplexEigenSolver.h, and indirectly ComplexSchur.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, 1> VectorType;\n  typedef Matrix<RealScalar, MatrixType::RowsAtCompileTime, 1> RealVectorType;\n  typedef typename std::complex<typename NumTraits<typename MatrixType::Scalar>::Real> Complex;\n\n  MatrixType a = MatrixType::Random(rows,cols);\n  MatrixType symmA =  a.adjoint() * a;\n\n  ComplexEigenSolver<MatrixType> ei0(symmA);\n  VERIFY_IS_APPROX(symmA * ei0.eigenvectors(), ei0.eigenvectors() * ei0.eigenvalues().asDiagonal());\n\n  ComplexEigenSolver<MatrixType> ei1(a);\n  VERIFY_IS_APPROX(a * ei1.eigenvectors(), ei1.eigenvectors() * ei1.eigenvalues().asDiagonal());\n\n  \/\/ Regression test for issue #66\n  MatrixType z = MatrixType::Zero(rows,cols);\n  ComplexEigenSolver<MatrixType> eiz(z);\n  VERIFY((eiz.eigenvalues().cwise()==0).all());\n}\n\nvoid test_eigensolver_complex()\n{\n  for(int i = 0; i < g_repeat; i++) {\n    CALL_SUBTEST( eigensolver(Matrix4cf()) );\n    CALL_SUBTEST( eigensolver(MatrixXcd(14,14)) );\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <unistd.h>\n\n#include \"common\/common\/lock_guard.h\"\n#include \"common\/common\/thread.h\"\n#include \"common\/runtime\/runtime_impl.h\"\n\n#include \"exe\/main_common.h\"\n\n#include \"server\/options_impl.h\"\n\n#include \"test\/test_common\/environment.h\"\n#include \"test\/test_common\/utility.h\"\n\n#include \"gtest\/gtest.h\"\n\n#ifdef ENVOY_HANDLE_SIGNALS\n#include \"exe\/signal_action.h\"\n#endif\n\n#include \"absl\/synchronization\/notification.h\"\n\nusing testing::HasSubstr;\nusing testing::IsEmpty;\n\nnamespace Envoy {\n\n\/**\n * Captures common functions needed for invoking MainCommon. Generates a\n * unique --base-id setting based on the pid and a random number. Maintains\n * an argv array that is terminated with nullptr. Identifies the config\n * file relative to $TEST_RUNDIR.\n *\/\nclass MainCommonTest : public testing::TestWithParam<Network::Address::IpVersion> {\nprotected:\n  MainCommonTest()\n      : config_file_(TestEnvironment::temporaryFileSubstitute(\n            \"\/test\/config\/integration\/google_com_proxy_port_0.v2.yaml\", TestEnvironment::ParamMap(),\n            TestEnvironment::PortMap(), GetParam())),\n        random_string_(fmt::format(\"{}\", computeBaseId())),\n        argv_({\"envoy-static\", \"--base-id\", random_string_.c_str(), \"-c\", config_file_.c_str(),\n               nullptr}) {}\n\n  \/**\n   * Computes a numeric ID to incorporate into the names of\n   * shared-memory segments and domain sockets, to help keep them\n   * distinct from other tests that might be running concurrently.\n   *\n   * The PID is needed to isolate namespaces between concurrent\n   * processes in CI. The random number generator is needed\n   * sequentially executed test methods fail with an error in\n   * bindDomainSocket if the the same base-id is re-used.\n   *\n   * @return uint32_t a unique numeric ID based on the PID and a random number.\n   *\/\n  static uint32_t computeBaseId() {\n    Runtime::RandomGeneratorImpl random_generator_;\n    \/\/ Pick a prime number to give more of the 32-bits of entropy to the PID, and the\n    \/\/ remainder to the random number.\n    const uint32_t four_digit_prime = 7919;\n    return getpid() * four_digit_prime + random_generator_.random() % four_digit_prime;\n  }\n\n  const char* const* argv() { return &argv_[0]; }\n  int argc() { return argv_.size() - 1; }\n\n  \/\/ Adds an argument, assuring that argv remains null-terminated.\n  void addArg(const char* arg) {\n    ASSERT(!argv_.empty());\n    const size_t last = argv_.size() - 1;\n    ASSERT(argv_[last] == nullptr); \/\/ invariant established in ctor, maintained below.\n    argv_[last] = arg;              \/\/ guaranteed non-empty\n    argv_.push_back(nullptr);\n  }\n\n  \/\/ Adds options to make Envoy exit immediately after initializtion.\n  void initOnly() {\n    addArg(\"--mode\");\n    addArg(\"init_only\");\n  }\n\n  std::string config_file_;\n  std::string random_string_;\n  std::vector<const char*> argv_;\n};\n\n\/\/ Exercise the codepath to instantiate MainCommon and destruct it, with hot restart.\nTEST_P(MainCommonTest, ConstructDestructHotRestartEnabled) {\n  VERBOSE_EXPECT_NO_THROW(MainCommon main_common(argc(), argv()));\n}\n\n\/\/ Exercise the codepath to instantiate MainCommon and destruct it, without hot restart.\nTEST_P(MainCommonTest, ConstructDestructHotRestartDisabled) {\n  addArg(\"--disable-hot-restart\");\n  VERBOSE_EXPECT_NO_THROW(MainCommon main_common(argc(), argv()));\n}\n\n\/\/ Exercise init_only explicitly.\nTEST_P(MainCommonTest, ConstructDestructHotRestartDisabledNoInit) {\n  addArg(\"--disable-hot-restart\");\n  initOnly();\n  MainCommon main_common(argc(), argv());\n  EXPECT_TRUE(main_common.run());\n}\n\n\/\/ Ensurees that existing users of main_common() can link.\nTEST_P(MainCommonTest, LegacyMain) {\n#ifdef ENVOY_HANDLE_SIGNALS\n  \/\/ Enabled by default. Control with \"bazel --define=signal_trace=disabled\"\n  Envoy::SignalAction handle_sigs;\n#endif\n\n  std::unique_ptr<Envoy::OptionsImpl> options;\n  int return_code = -1;\n  try {\n    initOnly();\n    options = std::make_unique<Envoy::OptionsImpl>(argc(), argv(), &MainCommon::hotRestartVersion,\n                                                   spdlog::level::info);\n  } catch (const Envoy::NoServingException& e) {\n    return_code = EXIT_SUCCESS;\n  } catch (const Envoy::MalformedArgvException& e) {\n    return_code = EXIT_FAILURE;\n  }\n  if (return_code == -1) {\n    return_code = Envoy::main_common(*options);\n  }\n  EXPECT_EQ(EXIT_SUCCESS, return_code);\n}\n\nINSTANTIATE_TEST_CASE_P(IpVersions, MainCommonTest,\n                        testing::ValuesIn(TestEnvironment::getIpVersionsForTest()),\n                        TestUtility::ipTestParamsToString);\n\nclass AdminRequestTest : public MainCommonTest {\nprotected:\n  AdminRequestTest()\n      : envoy_return_(false), envoy_started_(false), envoy_finished_(false),\n        pause_before_run_(false), pause_after_run_(false) {\n    addArg(\"--disable-hot-restart\");\n  }\n\n  \/\/ Runs an admin request specified in path, blocking until completion, and\n  \/\/ returning the response body.\n  std::string adminRequest(absl::string_view path, absl::string_view method) {\n    absl::Notification done;\n    std::string out;\n    main_common_->adminRequest(\n        path, method,\n        [&done, &out](const Http::HeaderMap& \/*response_headers*\/, absl::string_view body) {\n          out = std::string(body);\n          done.Notify();\n        });\n    done.WaitForNotification();\n    return out;\n  }\n\n  \/\/ Initiates Envoy running in its own thread.\n  void startEnvoy() {\n    envoy_thread_ = std::make_unique<Thread::Thread>([this]() {\n      \/\/ Note: main_common_ is accesesed in the testing thread, but\n      \/\/ is race-free, as MainCommon::run() does not return until\n      \/\/ triggered with an adminRequest POST to \/quitquitquit, which\n      \/\/ is done in the testing thread.\n      main_common_ = std::make_unique<MainCommon>(argc(), argv());\n      envoy_started_ = true;\n      started_.Notify();\n      pauseResumeInterlock(pause_before_run_);\n      bool status = main_common_->run();\n      pauseResumeInterlock(pause_after_run_);\n      main_common_.reset();\n      envoy_finished_ = true;\n      envoy_return_ = status;\n      finished_.Notify();\n    });\n  }\n\n  \/\/ Conditionally pauses at a critical point in the Envoy thread, waiting for\n  \/\/ the test thread to trigger something at that exact line. The test thread\n  \/\/ can then call resume_.Notify() to allow the Envoy thread to resume.\n  void pauseResumeInterlock(bool enable) {\n    if (enable) {\n      pause_point_.Notify();\n      resume_.WaitForNotification();\n    }\n  }\n\n  \/\/ Having triggered Envoy to quit (via signal or \/quitquitquit), this blocks until Envoy exits.\n  bool waitForEnvoyToExit() {\n    finished_.WaitForNotification();\n    envoy_thread_->join();\n    return envoy_return_;\n  }\n\n  std::unique_ptr<Thread::Thread> envoy_thread_;\n  std::unique_ptr<MainCommon> main_common_;\n  absl::Notification started_;\n  absl::Notification finished_;\n  absl::Notification resume_;\n  absl::Notification pause_point_;\n  bool envoy_return_;\n  bool envoy_started_;\n  bool envoy_finished_;\n  bool pause_before_run_;\n  bool pause_after_run_;\n};\n\nTEST_P(AdminRequestTest, AdminRequestGetStatsAndQuit) {\n  startEnvoy();\n  started_.WaitForNotification();\n  EXPECT_THAT(adminRequest(\"\/stats\", \"GET\"), HasSubstr(\"filesystem.reopen_failed\"));\n  adminRequest(\"\/quitquitquit\", \"POST\");\n  EXPECT_TRUE(waitForEnvoyToExit());\n}\n\n\/\/ This test is identical to the above one, except that instead of using an admin \/quitquitquit,\n\/\/ we send ourselves a SIGTERM, which should have the same effect.\nTEST_P(AdminRequestTest, AdminRequestGetStatsAndKill) {\n  startEnvoy();\n  started_.WaitForNotification();\n  EXPECT_THAT(adminRequest(\"\/stats\", \"GET\"), HasSubstr(\"filesystem.reopen_failed\"));\n  kill(getpid(), SIGTERM);\n  EXPECT_TRUE(waitForEnvoyToExit());\n}\n\nTEST_P(AdminRequestTest, AdminRequestBeforeRun) {\n  \/\/ Induce the situation where the Envoy thread is active, and main_common_ is constructed,\n  \/\/ but run() hasn't been issued yet. AdminRequests will not finish immediately, but will\n  \/\/ do so at some point after run() is allowed to start.\n  pause_before_run_ = true;\n  startEnvoy();\n  pause_point_.WaitForNotification();\n\n  bool admin_handler_was_called = false;\n  std::string out;\n  main_common_->adminRequest(\n      \"\/stats\", \"GET\",\n      [&admin_handler_was_called, &out](const Http::HeaderMap& \/*response_headers*\/,\n                                        absl::string_view body) {\n        admin_handler_was_called = true;\n        out = std::string(body);\n      });\n\n  \/\/ The admin handler can't be called until after we let run() go.\n  EXPECT_FALSE(admin_handler_was_called);\n  EXPECT_THAT(out, IsEmpty());\n\n  \/\/ Now unblock the envoy thread so it can wake up and process outstanding posts.\n  resume_.Notify();\n\n  \/\/ We don't get a notification when run(), so it's not safe to check whether the\n  \/\/ admin handler is called until after we quit.\n  adminRequest(\"\/quitquitquit\", \"POST\");\n  EXPECT_TRUE(waitForEnvoyToExit());\n  EXPECT_TRUE(admin_handler_was_called);\n\n  \/\/ This just checks that some stat output was reported. We could pick any stat.\n  EXPECT_THAT(out, HasSubstr(\"filesystem.reopen_failed\"));\n}\n\n\/\/ Class to track whether an object has been destroyed, which it does by bumping an atomic.\nclass DestroyCounter {\npublic:\n  \/\/ Note: destroy_count is captured by reference, so the variable must last longer than\n  \/\/ the DestroyCounter.\n  explicit DestroyCounter(std::atomic<uint64_t>& destroy_count) : destroy_count_(destroy_count) {}\n  ~DestroyCounter() { ++destroy_count_; }\n\nprivate:\n  std::atomic<uint64_t>& destroy_count_;\n};\n\nTEST_P(AdminRequestTest, AdminRequestAfterRun) {\n  startEnvoy();\n  started_.WaitForNotification();\n  \/\/ Induce the situation where Envoy is no longer in run(), but hasn't been\n  \/\/ destroyed yet. AdminRequests will never finish, but they won't crash.\n  pause_after_run_ = true;\n  adminRequest(\"\/quitquitquit\", \"POST\");\n  pause_point_.WaitForNotification(); \/\/ run() finished, but main_common_ still exists.\n\n  \/\/ Admin requests will not work, but will never complete. The lambda itself will be\n  \/\/ destroyed on thread exit, which we'll track with an object that counts destructor calls.\n\n  std::atomic<uint64_t> lambda_destroy_count(0);\n  bool admin_handler_was_called = false;\n  {\n    \/\/ Ownership of the tracker will be passed to the lambda.\n    auto tracker = std::make_shared<DestroyCounter>(lambda_destroy_count);\n    main_common_->adminRequest(\n        \"\/stats\", \"GET\",\n        [&admin_handler_was_called, tracker](const Http::HeaderMap& \/*response_headers*\/,\n                                             absl::string_view \/*body*\/) {\n          admin_handler_was_called = true;\n          UNREFERENCED_PARAMETER(tracker);\n        });\n  }\n  EXPECT_EQ(0, lambda_destroy_count); \/\/ The lambda won't be destroyed till envoy thread exit.\n\n  \/\/ Now unblock the envoy thread so it can destroy the object, along with our unfinished\n  \/\/ admin request.\n  resume_.Notify();\n\n  EXPECT_TRUE(waitForEnvoyToExit());\n  EXPECT_FALSE(admin_handler_was_called);\n  EXPECT_EQ(1, lambda_destroy_count);\n}\n\n\/\/ Verifies that the Logger::Registry is usable after constructing and\n\/\/ destructing MainCommon.\nTEST_P(MainCommonTest, ConstructDestructLogger) {\n  VERBOSE_EXPECT_NO_THROW(MainCommon main_common(argc(), argv()));\n\n  const std::string logger_name = \"logger\";\n  spdlog::details::log_msg log_msg;\n  log_msg.logger_name = &logger_name;\n  log_msg.level = spdlog::level::level_enum::err;\n\n  Logger::Registry::getSink()->log(log_msg);\n}\n\nINSTANTIATE_TEST_CASE_P(IpVersions, AdminRequestTest,\n                        testing::ValuesIn(TestEnvironment::getIpVersionsForTest()),\n                        TestUtility::ipTestParamsToString);\n\n} \/\/ namespace Envoy\n<commit_msg>logging: do not call the broken 0-arg constructor for spdlog::details::log_msg (#4962)<commit_after>#include <unistd.h>\n\n#include \"common\/common\/lock_guard.h\"\n#include \"common\/common\/thread.h\"\n#include \"common\/runtime\/runtime_impl.h\"\n\n#include \"exe\/main_common.h\"\n\n#include \"server\/options_impl.h\"\n\n#include \"test\/test_common\/environment.h\"\n#include \"test\/test_common\/utility.h\"\n\n#include \"gtest\/gtest.h\"\n\n#ifdef ENVOY_HANDLE_SIGNALS\n#include \"exe\/signal_action.h\"\n#endif\n\n#include \"absl\/synchronization\/notification.h\"\n\nusing testing::HasSubstr;\nusing testing::IsEmpty;\n\nnamespace Envoy {\n\n\/**\n * Captures common functions needed for invoking MainCommon. Generates a\n * unique --base-id setting based on the pid and a random number. Maintains\n * an argv array that is terminated with nullptr. Identifies the config\n * file relative to $TEST_RUNDIR.\n *\/\nclass MainCommonTest : public testing::TestWithParam<Network::Address::IpVersion> {\nprotected:\n  MainCommonTest()\n      : config_file_(TestEnvironment::temporaryFileSubstitute(\n            \"\/test\/config\/integration\/google_com_proxy_port_0.v2.yaml\", TestEnvironment::ParamMap(),\n            TestEnvironment::PortMap(), GetParam())),\n        random_string_(fmt::format(\"{}\", computeBaseId())),\n        argv_({\"envoy-static\", \"--base-id\", random_string_.c_str(), \"-c\", config_file_.c_str(),\n               nullptr}) {}\n\n  \/**\n   * Computes a numeric ID to incorporate into the names of\n   * shared-memory segments and domain sockets, to help keep them\n   * distinct from other tests that might be running concurrently.\n   *\n   * The PID is needed to isolate namespaces between concurrent\n   * processes in CI. The random number generator is needed\n   * sequentially executed test methods fail with an error in\n   * bindDomainSocket if the the same base-id is re-used.\n   *\n   * @return uint32_t a unique numeric ID based on the PID and a random number.\n   *\/\n  static uint32_t computeBaseId() {\n    Runtime::RandomGeneratorImpl random_generator_;\n    \/\/ Pick a prime number to give more of the 32-bits of entropy to the PID, and the\n    \/\/ remainder to the random number.\n    const uint32_t four_digit_prime = 7919;\n    return getpid() * four_digit_prime + random_generator_.random() % four_digit_prime;\n  }\n\n  const char* const* argv() { return &argv_[0]; }\n  int argc() { return argv_.size() - 1; }\n\n  \/\/ Adds an argument, assuring that argv remains null-terminated.\n  void addArg(const char* arg) {\n    ASSERT(!argv_.empty());\n    const size_t last = argv_.size() - 1;\n    ASSERT(argv_[last] == nullptr); \/\/ invariant established in ctor, maintained below.\n    argv_[last] = arg;              \/\/ guaranteed non-empty\n    argv_.push_back(nullptr);\n  }\n\n  \/\/ Adds options to make Envoy exit immediately after initializtion.\n  void initOnly() {\n    addArg(\"--mode\");\n    addArg(\"init_only\");\n  }\n\n  std::string config_file_;\n  std::string random_string_;\n  std::vector<const char*> argv_;\n};\n\n\/\/ Exercise the codepath to instantiate MainCommon and destruct it, with hot restart.\nTEST_P(MainCommonTest, ConstructDestructHotRestartEnabled) {\n  VERBOSE_EXPECT_NO_THROW(MainCommon main_common(argc(), argv()));\n}\n\n\/\/ Exercise the codepath to instantiate MainCommon and destruct it, without hot restart.\nTEST_P(MainCommonTest, ConstructDestructHotRestartDisabled) {\n  addArg(\"--disable-hot-restart\");\n  VERBOSE_EXPECT_NO_THROW(MainCommon main_common(argc(), argv()));\n}\n\n\/\/ Exercise init_only explicitly.\nTEST_P(MainCommonTest, ConstructDestructHotRestartDisabledNoInit) {\n  addArg(\"--disable-hot-restart\");\n  initOnly();\n  MainCommon main_common(argc(), argv());\n  EXPECT_TRUE(main_common.run());\n}\n\n\/\/ Ensurees that existing users of main_common() can link.\nTEST_P(MainCommonTest, LegacyMain) {\n#ifdef ENVOY_HANDLE_SIGNALS\n  \/\/ Enabled by default. Control with \"bazel --define=signal_trace=disabled\"\n  Envoy::SignalAction handle_sigs;\n#endif\n\n  std::unique_ptr<Envoy::OptionsImpl> options;\n  int return_code = -1;\n  try {\n    initOnly();\n    options = std::make_unique<Envoy::OptionsImpl>(argc(), argv(), &MainCommon::hotRestartVersion,\n                                                   spdlog::level::info);\n  } catch (const Envoy::NoServingException& e) {\n    return_code = EXIT_SUCCESS;\n  } catch (const Envoy::MalformedArgvException& e) {\n    return_code = EXIT_FAILURE;\n  }\n  if (return_code == -1) {\n    return_code = Envoy::main_common(*options);\n  }\n  EXPECT_EQ(EXIT_SUCCESS, return_code);\n}\n\nINSTANTIATE_TEST_CASE_P(IpVersions, MainCommonTest,\n                        testing::ValuesIn(TestEnvironment::getIpVersionsForTest()),\n                        TestUtility::ipTestParamsToString);\n\nclass AdminRequestTest : public MainCommonTest {\nprotected:\n  AdminRequestTest()\n      : envoy_return_(false), envoy_started_(false), envoy_finished_(false),\n        pause_before_run_(false), pause_after_run_(false) {\n    addArg(\"--disable-hot-restart\");\n  }\n\n  \/\/ Runs an admin request specified in path, blocking until completion, and\n  \/\/ returning the response body.\n  std::string adminRequest(absl::string_view path, absl::string_view method) {\n    absl::Notification done;\n    std::string out;\n    main_common_->adminRequest(\n        path, method,\n        [&done, &out](const Http::HeaderMap& \/*response_headers*\/, absl::string_view body) {\n          out = std::string(body);\n          done.Notify();\n        });\n    done.WaitForNotification();\n    return out;\n  }\n\n  \/\/ Initiates Envoy running in its own thread.\n  void startEnvoy() {\n    envoy_thread_ = std::make_unique<Thread::Thread>([this]() {\n      \/\/ Note: main_common_ is accesesed in the testing thread, but\n      \/\/ is race-free, as MainCommon::run() does not return until\n      \/\/ triggered with an adminRequest POST to \/quitquitquit, which\n      \/\/ is done in the testing thread.\n      main_common_ = std::make_unique<MainCommon>(argc(), argv());\n      envoy_started_ = true;\n      started_.Notify();\n      pauseResumeInterlock(pause_before_run_);\n      bool status = main_common_->run();\n      pauseResumeInterlock(pause_after_run_);\n      main_common_.reset();\n      envoy_finished_ = true;\n      envoy_return_ = status;\n      finished_.Notify();\n    });\n  }\n\n  \/\/ Conditionally pauses at a critical point in the Envoy thread, waiting for\n  \/\/ the test thread to trigger something at that exact line. The test thread\n  \/\/ can then call resume_.Notify() to allow the Envoy thread to resume.\n  void pauseResumeInterlock(bool enable) {\n    if (enable) {\n      pause_point_.Notify();\n      resume_.WaitForNotification();\n    }\n  }\n\n  \/\/ Having triggered Envoy to quit (via signal or \/quitquitquit), this blocks until Envoy exits.\n  bool waitForEnvoyToExit() {\n    finished_.WaitForNotification();\n    envoy_thread_->join();\n    return envoy_return_;\n  }\n\n  std::unique_ptr<Thread::Thread> envoy_thread_;\n  std::unique_ptr<MainCommon> main_common_;\n  absl::Notification started_;\n  absl::Notification finished_;\n  absl::Notification resume_;\n  absl::Notification pause_point_;\n  bool envoy_return_;\n  bool envoy_started_;\n  bool envoy_finished_;\n  bool pause_before_run_;\n  bool pause_after_run_;\n};\n\nTEST_P(AdminRequestTest, AdminRequestGetStatsAndQuit) {\n  startEnvoy();\n  started_.WaitForNotification();\n  EXPECT_THAT(adminRequest(\"\/stats\", \"GET\"), HasSubstr(\"filesystem.reopen_failed\"));\n  adminRequest(\"\/quitquitquit\", \"POST\");\n  EXPECT_TRUE(waitForEnvoyToExit());\n}\n\n\/\/ This test is identical to the above one, except that instead of using an admin \/quitquitquit,\n\/\/ we send ourselves a SIGTERM, which should have the same effect.\nTEST_P(AdminRequestTest, AdminRequestGetStatsAndKill) {\n  startEnvoy();\n  started_.WaitForNotification();\n  EXPECT_THAT(adminRequest(\"\/stats\", \"GET\"), HasSubstr(\"filesystem.reopen_failed\"));\n  kill(getpid(), SIGTERM);\n  EXPECT_TRUE(waitForEnvoyToExit());\n}\n\nTEST_P(AdminRequestTest, AdminRequestBeforeRun) {\n  \/\/ Induce the situation where the Envoy thread is active, and main_common_ is constructed,\n  \/\/ but run() hasn't been issued yet. AdminRequests will not finish immediately, but will\n  \/\/ do so at some point after run() is allowed to start.\n  pause_before_run_ = true;\n  startEnvoy();\n  pause_point_.WaitForNotification();\n\n  bool admin_handler_was_called = false;\n  std::string out;\n  main_common_->adminRequest(\n      \"\/stats\", \"GET\",\n      [&admin_handler_was_called, &out](const Http::HeaderMap& \/*response_headers*\/,\n                                        absl::string_view body) {\n        admin_handler_was_called = true;\n        out = std::string(body);\n      });\n\n  \/\/ The admin handler can't be called until after we let run() go.\n  EXPECT_FALSE(admin_handler_was_called);\n  EXPECT_THAT(out, IsEmpty());\n\n  \/\/ Now unblock the envoy thread so it can wake up and process outstanding posts.\n  resume_.Notify();\n\n  \/\/ We don't get a notification when run(), so it's not safe to check whether the\n  \/\/ admin handler is called until after we quit.\n  adminRequest(\"\/quitquitquit\", \"POST\");\n  EXPECT_TRUE(waitForEnvoyToExit());\n  EXPECT_TRUE(admin_handler_was_called);\n\n  \/\/ This just checks that some stat output was reported. We could pick any stat.\n  EXPECT_THAT(out, HasSubstr(\"filesystem.reopen_failed\"));\n}\n\n\/\/ Class to track whether an object has been destroyed, which it does by bumping an atomic.\nclass DestroyCounter {\npublic:\n  \/\/ Note: destroy_count is captured by reference, so the variable must last longer than\n  \/\/ the DestroyCounter.\n  explicit DestroyCounter(std::atomic<uint64_t>& destroy_count) : destroy_count_(destroy_count) {}\n  ~DestroyCounter() { ++destroy_count_; }\n\nprivate:\n  std::atomic<uint64_t>& destroy_count_;\n};\n\nTEST_P(AdminRequestTest, AdminRequestAfterRun) {\n  startEnvoy();\n  started_.WaitForNotification();\n  \/\/ Induce the situation where Envoy is no longer in run(), but hasn't been\n  \/\/ destroyed yet. AdminRequests will never finish, but they won't crash.\n  pause_after_run_ = true;\n  adminRequest(\"\/quitquitquit\", \"POST\");\n  pause_point_.WaitForNotification(); \/\/ run() finished, but main_common_ still exists.\n\n  \/\/ Admin requests will not work, but will never complete. The lambda itself will be\n  \/\/ destroyed on thread exit, which we'll track with an object that counts destructor calls.\n\n  std::atomic<uint64_t> lambda_destroy_count(0);\n  bool admin_handler_was_called = false;\n  {\n    \/\/ Ownership of the tracker will be passed to the lambda.\n    auto tracker = std::make_shared<DestroyCounter>(lambda_destroy_count);\n    main_common_->adminRequest(\n        \"\/stats\", \"GET\",\n        [&admin_handler_was_called, tracker](const Http::HeaderMap& \/*response_headers*\/,\n                                             absl::string_view \/*body*\/) {\n          admin_handler_was_called = true;\n          UNREFERENCED_PARAMETER(tracker);\n        });\n  }\n  EXPECT_EQ(0, lambda_destroy_count); \/\/ The lambda won't be destroyed till envoy thread exit.\n\n  \/\/ Now unblock the envoy thread so it can destroy the object, along with our unfinished\n  \/\/ admin request.\n  resume_.Notify();\n\n  EXPECT_TRUE(waitForEnvoyToExit());\n  EXPECT_FALSE(admin_handler_was_called);\n  EXPECT_EQ(1, lambda_destroy_count);\n}\n\n\/\/ Verifies that the Logger::Registry is usable after constructing and\n\/\/ destructing MainCommon.\nTEST_P(MainCommonTest, ConstructDestructLogger) {\n  VERBOSE_EXPECT_NO_THROW(MainCommon main_common(argc(), argv()));\n\n  const std::string logger_name = \"logger\";\n  spdlog::details::log_msg log_msg(&logger_name, spdlog::level::level_enum::err);\n  Logger::Registry::getSink()->log(log_msg);\n}\n\nINSTANTIATE_TEST_CASE_P(IpVersions, AdminRequestTest,\n                        testing::ValuesIn(TestEnvironment::getIpVersionsForTest()),\n                        TestUtility::ipTestParamsToString);\n\n} \/\/ namespace Envoy\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 = -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      if (_headingHoldEnabled) {\n        Serial.print(tgt_Hdg);\n      } else {\n        Serial.print(DISAABLED);\n      }\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 = 0;\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      if (_depthHoldEnabled) {\n        Serial.print(target_depth);\n      } else {\n        Serial.pitnt(DISABLED);\n      }\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>Fix spelling in Arduino<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      if (_headingHoldEnabled) {\n        Serial.print(tgt_Hdg);\n      } else {\n        Serial.print(DISABLED);\n      }\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 = 0;\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      if (_depthHoldEnabled) {\n        Serial.print(target_depth);\n      } else {\n        Serial.pitnt(DISABLED);\n      }\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>#include \"ncv.h\"\n#include \"opencl\/opencl.h\"\n\nconst char* program_source = \"\\n\" \\\n\"__kernel void add_kernel(                              \\n\" \\\n\"       __global const float* a,                        \\n\" \\\n\"       __global const float* b,                        \\n\" \\\n\"       __global float* result)                         \\n\" \\\n\"{                                                      \\n\" \\\n\"       int gid = get_global_id(0);                     \\n\" \\\n\"       result[gid] = a[gid] + b[gid];                  \\n\" \\\n\"}                                                      \\n\" \\\n\"__kernel void mul_kernel(                              \\n\" \\\n\"       __global const float* a,                        \\n\" \\\n\"       __global const float* b,                        \\n\" \\\n\"       __global float* result)                         \\n\" \\\n\"{                                                      \\n\" \\\n\"       int gid = get_global_id(0);                     \\n\" \\\n\"       result[gid] = a[gid] * b[gid];                  \\n\" \\\n\"}                                                      \\n\" \\\n\"\\n\";\n\nint main(int argc, char *argv[])\n{\n        using namespace ncv;\n\n        try\n        {\n                if (!ocl::manager_t::instance().valid())\n                {\n                        exit(EXIT_FAILURE);\n                }\n\n                const cl::Context& context = ocl::manager_t::instance().context();\n                const cl::CommandQueue& queue = ocl::manager_t::instance().queue();\n\n                const cl::Program program = ocl::manager_t::instance().program_from_text(program_source);\n\n\/\/                cl::Kernel add_kernel = cl::Kernel(program, \"add_kernel\");\n                cl::Kernel mul_kernel = cl::Kernel(program, \"mul_kernel\");\n\n                const size_t tests = 64;\n                const size_t minsize = 1024;\n                const size_t maxsize = 4 * 1024 * 1024;\n\n                ncv::thread_pool_t pool;\n\n                \/\/ try various data sizes\n                for (size_t size = minsize; size <= maxsize; size *= 4)\n                {\n                        ncv::stats_t<double, size_t> send_stats;        \/\/ send inputs to gpu\n                        ncv::stats_t<double, size_t> proc_stats;        \/\/ gpu processing\n                        ncv::stats_t<double, size_t> read_stats;        \/\/ read results from gpu\n                        ncv::stats_t<double, size_t> scpu_stats;        \/\/ cpu processing (single core)\n                        ncv::stats_t<double, size_t> mcpu_stats;        \/\/ cpu processing (multiple cores)\n\n                        ncv::tensor::vector_types_t<float>::tvector a; a.resize(size);\n                        ncv::tensor::vector_types_t<float>::tvector b; b.resize(size);\n                        ncv::tensor::vector_types_t<float>::tvector c; c.resize(size);\n\n                        const size_t array_size = size * sizeof(float);\n\n                        for (size_t i = 0; i < size; i ++)\n                        {\n                                a(i) = 1.0f * i;\n                                b(i) = 1.0f * i;\n                                c(i) = 0.0f;\n                        }\n\n                        \/\/ run multiple tests\n                        for (size_t test = 0; test < tests; test ++)\n                        {\n                                ncv::timer_t timer;\n\n                                cl::Buffer cl_a = cl::Buffer(context, CL_MEM_READ_ONLY, array_size, NULL);\n                                cl::Buffer cl_b = cl::Buffer(context, CL_MEM_READ_ONLY, array_size, NULL);\n                                cl::Buffer cl_c = cl::Buffer(context, CL_MEM_WRITE_ONLY, array_size, NULL);\n\n                                \/\/ I - send inputs to gpu\n                                timer.start();\n                                {\n                                        cl::Event event;\n                                        queue.enqueueWriteBuffer(cl_a, CL_FALSE, 0, array_size, a.data(), NULL, &event);\n                                        queue.enqueueWriteBuffer(cl_b, CL_FALSE, 0, array_size, b.data(), NULL, &event);\n\/\/                                        queue.enqueueWriteBuffer(cl_c, CL_FALSE, 0, array_size, c.data(), NULL, &event);\n                                        queue.finish();\n\n                                        mul_kernel.setArg(0, cl_a);\n                                        mul_kernel.setArg(1, cl_b);\n                                        mul_kernel.setArg(2, cl_c);\n                                        queue.finish();\n                                }\n                                send_stats(timer.microseconds());\n\n                                \/\/ II - gpu processing\n                                timer.start();\n                                {\n                                        cl::Event event;\n                                        queue.enqueueNDRangeKernel(mul_kernel, cl::NullRange, cl::NDRange(size), cl::NullRange, NULL, &event);\n                                        queue.finish();\n                                }\n                                proc_stats(timer.microseconds());\n\n                                \/\/ III - read results from gpu\n                                timer.start();\n                                {\n                                        cl::Event event;\n                                        queue.enqueueReadBuffer(cl_c, CL_TRUE, 0, array_size, c.data(), NULL, &event);\n                                }\n                                read_stats(timer.microseconds());\n\n                                \/\/ check results\n                                for (size_t i = 0; i < size; i ++)\n                                {\n                                        if (std::fabs(c(i) - (a(i) * b(i))) > 0.00001f)\n                                        {\n                                                log_error() << \"GPU processing failed: incorrect result!\";\n                                                break;\n                                        }\n                                }\n\n                                \/\/ IV - single-threaded cpu processing\n                                timer.start();\n                                {\n                                        for (size_t i = 0; i < size; i ++)\n                                        {\n                                                c(i) = a(i) * b(i);\n                                        }\n                                }\n                                scpu_stats(timer.microseconds());\n\n                                \/\/ V - multi-threaded cpu processing\n                                timer.start();\n                                {\n                                        ncv::thread_loop(size, [&] (size_t i)\n                                        {\n                                                c(i) = a(i) * b(i);\n                                        }, pool);\n                                }\n                                mcpu_stats(timer.microseconds());\n                        }\n\n                        \/\/ results\n                        log_info() << \"SIZE [\" << text::resize(text::to_string(size \/ 1024), 8, align::right) << \"K]\"\n                                   << \": send - \" << text::resize(text::to_string(send_stats.avg()), 16, align::right) << \"us\"\n                                   << \", proc - \" << text::resize(text::to_string(proc_stats.avg()), 16, align::right) << \"us\"\n                                   << \", read - \" << text::resize(text::to_string(read_stats.avg()), 16, align::right) << \"us\"\n                                   << \", scpu - \" << text::resize(text::to_string(scpu_stats.avg()), 16, align::right) << \"us\"\n                                   << \", mcpu - \" << text::resize(text::to_string(mcpu_stats.avg()), 16, align::right) << \"us\";\n                }\n        }\n\n        catch (cl::Error e)\n        {\n                log_error() << \"OpenCL fatal error: <\" << e.what() << \"> (\" << ocl::error_string(e.err()) << \")!\";\n        }\n\n        \/\/ OK\n        ncv::log_info() << ncv::done;\n        return EXIT_SUCCESS;\n}\n<commit_msg>cosmetics<commit_after>#include \"ncv.h\"\n#include \"opencl\/opencl.h\"\n\nconst char* program_source = \"\\n\" \\\n\"__kernel void add_kernel(                              \\n\" \\\n\"       __global const float* a,                        \\n\" \\\n\"       __global const float* b,                        \\n\" \\\n\"       __global float* result)                         \\n\" \\\n\"{                                                      \\n\" \\\n\"       int gid = get_global_id(0);                     \\n\" \\\n\"       result[gid] = a[gid] + b[gid];                  \\n\" \\\n\"}                                                      \\n\" \\\n\"__kernel void mul_kernel(                              \\n\" \\\n\"       __global const float* a,                        \\n\" \\\n\"       __global const float* b,                        \\n\" \\\n\"       __global float* result)                         \\n\" \\\n\"{                                                      \\n\" \\\n\"       int gid = get_global_id(0);                     \\n\" \\\n\"       result[gid] = a[gid] * b[gid];                  \\n\" \\\n\"}                                                      \\n\" \\\n\"\\n\";\n\nint main(int argc, char *argv[])\n{\n        using namespace ncv;\n\n        try\n        {\n                if (!ocl::manager_t::instance().valid())\n                {\n                        exit(EXIT_FAILURE);\n                }\n\n                const cl::Context& context = ocl::manager_t::instance().context();\n                const cl::CommandQueue& queue = ocl::manager_t::instance().queue();\n\n                const cl::Program program = ocl::manager_t::instance().program_from_text(program_source);\n\n\/\/                cl::Kernel add_kernel = cl::Kernel(program, \"add_kernel\");\n                cl::Kernel mul_kernel = cl::Kernel(program, \"mul_kernel\");\n\n                const size_t tests = 64;\n                const size_t minsize = 1024;\n                const size_t maxsize = 4 * 1024 * 1024;\n\n                ncv::thread_pool_t pool;\n\n                \/\/ try various data sizes\n                for (size_t size = minsize; size <= maxsize; size *= 4)\n                {\n                        ncv::stats_t<double, size_t> send_stats;        \/\/ send inputs to gpu\n                        ncv::stats_t<double, size_t> proc_stats;        \/\/ gpu processing\n                        ncv::stats_t<double, size_t> read_stats;        \/\/ read results from gpu\n                        ncv::stats_t<double, size_t> scpu_stats;        \/\/ cpu processing (single core)\n                        ncv::stats_t<double, size_t> mcpu_stats;        \/\/ cpu processing (multiple cores)\n\n                        ncv::tensor::vector_types_t<float>::tvector a; a.resize(size);\n                        ncv::tensor::vector_types_t<float>::tvector b; b.resize(size);\n                        ncv::tensor::vector_types_t<float>::tvector c; c.resize(size);\n\n                        const size_t array_size = size * sizeof(float);\n\n                        for (size_t i = 0; i < size; i ++)\n                        {\n                                a(i) = 1.0f * i;\n                                b(i) = 1.0f * i;\n                                c(i) = 0.0f;\n                        }\n\n                        \/\/ run multiple tests\n                        for (size_t test = 0; test < tests; test ++)\n                        {\n                                ncv::timer_t timer;\n\n                                cl::Buffer cl_a = cl::Buffer(context, CL_MEM_READ_ONLY, array_size, NULL);\n                                cl::Buffer cl_b = cl::Buffer(context, CL_MEM_READ_ONLY, array_size, NULL);\n                                cl::Buffer cl_c = cl::Buffer(context, CL_MEM_WRITE_ONLY, array_size, NULL);\n\n                                \/\/ I - send inputs to gpu\n                                timer.start();\n                                {\n                                        cl::Event event;\n                                        queue.enqueueWriteBuffer(cl_a, CL_FALSE, 0, array_size, a.data(), NULL, &event);\n                                        queue.enqueueWriteBuffer(cl_b, CL_FALSE, 0, array_size, b.data(), NULL, &event);\n\/\/                                        queue.enqueueWriteBuffer(cl_c, CL_FALSE, 0, array_size, c.data(), NULL, &event);\n                                        queue.finish();\n\n                                        mul_kernel.setArg(0, cl_a);\n                                        mul_kernel.setArg(1, cl_b);\n                                        mul_kernel.setArg(2, cl_c);\n                                        queue.finish();\n                                }\n                                send_stats(timer.microseconds());\n\n                                \/\/ II - gpu processing\n                                timer.start();\n                                {\n                                        cl::Event event;\n                                        queue.enqueueNDRangeKernel(mul_kernel, cl::NullRange, cl::NDRange(size), cl::NullRange, NULL, &event);\n                                        queue.finish();\n                                }\n                                proc_stats(timer.microseconds());\n\n                                \/\/ III - read results from gpu\n                                timer.start();\n                                {\n                                        cl::Event event;\n                                        queue.enqueueReadBuffer(cl_c, CL_TRUE, 0, array_size, c.data(), NULL, &event);\n                                }\n                                read_stats(timer.microseconds());\n\n                                \/\/ check results\n                                for (size_t i = 0; i < size; i ++)\n                                {\n                                        if (std::fabs(c(i) - (a(i) * b(i))) > 0.00001f)\n                                        {\n                                                log_error() << \"GPU processing failed: incorrect result!\";\n                                                break;\n                                        }\n                                }\n\n                                \/\/ IV - single-threaded cpu processing\n                                timer.start();\n                                {\n                                        for (size_t i = 0; i < size; i ++)\n                                        {\n                                                c(i) = a(i) * b(i);\n                                        }\n                                }\n                                scpu_stats(timer.microseconds());\n\n                                \/\/ V - multi-threaded cpu processing\n                                timer.start();\n                                {\n                                        ncv::thread_loop(size, [&] (size_t i)\n                                        {\n                                                c(i) = a(i) * b(i);\n                                        }, pool);\n                                }\n                                mcpu_stats(timer.microseconds());\n                        }\n\n                        \/\/ results\n                        log_info() << \"SIZE [\" << text::resize(text::to_string(size \/ 1024), 4, align::right) << \"K]\"\n                                   << \": send2GPU - \" << text::resize(text::to_string(send_stats.avg()), 12, align::right) << \"us\"\n                                   << \", proc@GPU - \" << text::resize(text::to_string(proc_stats.avg()), 12, align::right) << \"us\"\n                                   << \", read-GPU - \" << text::resize(text::to_string(read_stats.avg()), 12, align::right) << \"us\"\n                                   << \", scpu-CPU - \" << text::resize(text::to_string(scpu_stats.avg()), 12, align::right) << \"us\"\n                                   << \", mcpu-CPU - \" << text::resize(text::to_string(mcpu_stats.avg()), 12, align::right) << \"us\";\n                }\n        }\n\n        catch (cl::Error e)\n        {\n                log_error() << \"OpenCL fatal error: <\" << e.what() << \"> (\" << ocl::error_string(e.err()) << \")!\";\n        }\n\n        \/\/ OK\n        ncv::log_info() << ncv::done;\n        return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"restclient-cpp\/restclient.h\"\n#include <gtest\/gtest.h>\n#include <string>\n\nclass RestClientGetTest : public ::testing::Test\n{\n protected:\n    std::string url;\n    std::string ctype;\n    std::string data;\n\n    RestClientGetTest()\n    {\n    }\n\n    virtual ~RestClientGetTest()\n    {\n    }\n\n    virtual void SetUp()\n    {\n      url = \"http:\/\/httpbin.org\/get\";\n      ctype = \"\";\n      data = \"\";\n    }\n\n    virtual void TearDown()\n    {\n    }\n\n};\n\n\/\/ Tests\n\/\/ check return code\nTEST_F(RestClientGetTest, TestRestClientGETCode)\n{\n  RestClient::response res = RestClient::get(url);\n  EXPECT_EQ(200, res.code);\n}\n\/\/ check for failure\nTEST_F(RestClientGetTest, TestRestClientFailureCode)\n{\n  std::string u = \"http:\/\/nonexistent\";\n  RestClient::response res = RestClient::get(u);\n  EXPECT_EQ(-1, res.code);\n}\n\nTEST_F(RestClientGetTest, TestRestClientGETHeaders)\n{\n  RestClient::response res = RestClient::get(url);\n  EXPECT_EQ(\"keep-alive\", res.headers[\"Connection\"]);\n}\n\n<commit_msg>add simple unit test that uses JSON parsing to GET tests<commit_after>#include \"restclient-cpp\/restclient.h\"\n#include \"restclient-cpp\/meta.h\"\n#include <gtest\/gtest.h>\n#include <json\/json.h>\n#include <string>\n\nclass RestClientGetTest : public ::testing::Test\n{\n protected:\n    std::string url;\n    std::string ctype;\n    std::string data;\n\n    RestClientGetTest()\n    {\n    }\n\n    virtual ~RestClientGetTest()\n    {\n    }\n\n    virtual void SetUp()\n    {\n      url = \"http:\/\/httpbin.org\/get\";\n      ctype = \"\";\n      data = \"\";\n    }\n\n    virtual void TearDown()\n    {\n    }\n\n};\n\n\/\/ Tests\n\/\/ check return code\nTEST_F(RestClientGetTest, TestRestClientGETCode)\n{\n  RestClient::response res = RestClient::get(url);\n  EXPECT_EQ(200, res.code);\n}\nTEST_F(RestClientGetTest, TestRestClientGETBodyCode)\n{\n  RestClient::response res = RestClient::get(url);\n  Json::Value root;\n  std::istringstream str(res.body);\n  str >> root;\n\n  EXPECT_EQ(\"http:\/\/httpbin.org\/get\", root.get(\"url\", \"no url set\").asString());\n  EXPECT_EQ(\"restclient-cpp\/\" VERSION, root[\"headers\"].get(\"User-Agent\", \"no url set\").asString());\n}\n\/\/ check for failure\nTEST_F(RestClientGetTest, TestRestClientFailureCode)\n{\n  std::string u = \"http:\/\/nonexistent\";\n  RestClient::response res = RestClient::get(u);\n  EXPECT_EQ(-1, res.code);\n}\n\nTEST_F(RestClientGetTest, TestRestClientGETHeaders)\n{\n  RestClient::response res = RestClient::get(url);\n  EXPECT_EQ(\"keep-alive\", res.headers[\"Connection\"]);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\r\n *   Copyright (c) 2010 Juergen Riegel <FreeCAD@juergen-riegel.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#ifndef _PreComp_\r\n# include <BRep_Builder.hxx>\r\n# include <BRepBndLib.hxx>\r\n# include <BRepPrimAPI_MakeRevol.hxx>\r\n# include <BRepBuilderAPI_MakeFace.hxx>\r\n# include <TopoDS.hxx>\r\n# include <TopoDS_Face.hxx>\r\n# include <TopoDS_Wire.hxx>\r\n# include <TopExp_Explorer.hxx>\r\n# include <BRepAlgoAPI_Fuse.hxx>\r\n# include <Precision.hxx>\r\n# include <gp_Lin.hxx>\r\n#endif\r\n\r\n#include <Base\/Axis.h>\r\n#include <Base\/Console.h>\r\n#include <Base\/Exception.h>\r\n#include <Base\/Placement.h>\r\n#include <Base\/Tools.h>\r\n\r\n#include \"FeatureRevolution.h\"\r\n\r\n\r\nusing namespace PartDesign;\r\n\r\nnamespace PartDesign {\r\n\r\n\r\nPROPERTY_SOURCE(PartDesign::Revolution, PartDesign::ProfileBased)\r\n\r\nRevolution::Revolution()\r\n{\r\n    addSubType = FeatureAddSub::Additive;\r\n    \r\n    ADD_PROPERTY_TYPE(Base,(Base::Vector3d(0.0,0.0,0.0)),\"Revolution\", App::Prop_ReadOnly, \"Base\");\r\n    ADD_PROPERTY_TYPE(Axis,(Base::Vector3d(0.0,1.0,0.0)),\"Revolution\", App::Prop_ReadOnly, \"Axis\");\r\n    ADD_PROPERTY_TYPE(Angle,(360.0),\"Revolution\", App::Prop_None, \"Angle\");\r\n    ADD_PROPERTY_TYPE(ReferenceAxis,(0),\"Revolution\",(App::Prop_None),\"Reference axis of revolution\");\r\n}\r\n\r\nshort Revolution::mustExecute() const\r\n{\r\n    if (Placement.isTouched() ||\r\n        ReferenceAxis.isTouched() ||\r\n        Axis.isTouched() ||\r\n        Base.isTouched() ||\r\n        Angle.isTouched())\r\n        return 1;\r\n    return ProfileBased::mustExecute();\r\n}\r\n\r\nApp::DocumentObjectExecReturn *Revolution::execute(void)\r\n{\r\n    \/\/ Validate parameters\r\n    double angle = Angle.getValue();\r\n    if (angle < Precision::Confusion())\r\n        return new App::DocumentObjectExecReturn(\"Angle of revolution too small\");\r\n    if (angle > 360.0)\r\n        return new App::DocumentObjectExecReturn(\"Angle of revolution too large\");\r\n\r\n    angle = Base::toRadians<double>(angle);\r\n    \/\/ Reverse angle if selected\r\n    if (Reversed.getValue() && !Midplane.getValue())\r\n        angle *= (-1.0);\r\n\r\n    TopoDS_Shape sketchshape;\r\n    try {\r\n        sketchshape = getVerifiedFace();\r\n    } catch (const Base::Exception& e) {\r\n        return new App::DocumentObjectExecReturn(e.what());\r\n    }\r\n\r\n    \/\/ if the Base property has a valid shape, fuse the AddShape into it\r\n    TopoDS_Shape base;\r\n    try {\r\n        base = getBaseShape();\r\n    } catch (const Base::Exception&) {\r\n        \/\/ fall back to support (for legacy features)\r\n        base = TopoDS_Shape();\r\n    }\r\n\r\n    \/\/ update Axis from ReferenceAxis\r\n    try {\r\n        updateAxis();\r\n    } catch (const Base::Exception& e) {\r\n        return new App::DocumentObjectExecReturn(e.what());\r\n    }\r\n\r\n    \/\/ get revolve axis\r\n    Base::Vector3d b = Base.getValue();\r\n    gp_Pnt pnt(b.x,b.y,b.z);\r\n    Base::Vector3d v = Axis.getValue();\r\n    gp_Dir dir(v.x,v.y,v.z);\r\n\r\n    try {\r\n        if (sketchshape.IsNull())\r\n            return new App::DocumentObjectExecReturn(\"Creating a face from sketch failed\");\r\n\r\n        \/\/ Rotate the face by half the angle to get Revolution symmetric to sketch plane\r\n        if (Midplane.getValue()) {\r\n            gp_Trsf mov;\r\n            mov.SetRotation(gp_Ax1(pnt, dir), Base::toRadians<double>(Angle.getValue()) * (-1.0) \/ 2.0);\r\n            TopLoc_Location loc(mov);\r\n            sketchshape.Move(loc);\r\n        }\r\n\r\n        this->positionByPrevious();\r\n        TopLoc_Location invObjLoc = this->getLocation().Inverted();\r\n        pnt.Transform(invObjLoc.Transformation());\r\n        dir.Transform(invObjLoc.Transformation());\r\n        base.Move(invObjLoc);\r\n        sketchshape.Move(invObjLoc);\r\n\r\n        \/\/ Check distance between sketchshape and axis - to avoid failures and crashes\r\n        TopExp_Explorer xp;\r\n        xp.Init(sketchshape, TopAbs_FACE);\r\n        for (;xp.More(); xp.Next()) {\r\n            if (checkLineCrossesFace(gp_Lin(pnt, dir), TopoDS::Face(xp.Current())))\r\n                return new App::DocumentObjectExecReturn(\"Revolve axis intersects the sketch\");\r\n        }        \r\n\r\n        \/\/ revolve the face to a solid\r\n        BRepPrimAPI_MakeRevol RevolMaker(sketchshape, gp_Ax1(pnt, dir), angle);\r\n\r\n        if (RevolMaker.IsDone()) {\r\n            TopoDS_Shape result = RevolMaker.Shape();\r\n            result = refineShapeIfActive(result);\r\n            \/\/ set the additive shape property for later usage in e.g. pattern\r\n            this->AddSubShape.setValue(result);            \r\n\r\n            if (!base.IsNull()) {\r\n                \/\/ Let's call algorithm computing a fuse operation:\r\n                BRepAlgoAPI_Fuse mkFuse(base, result);\r\n                \/\/ Let's check if the fusion has been successful\r\n                if (!mkFuse.IsDone())\r\n                    throw Base::Exception(\"Fusion with base feature failed\");\r\n                result = mkFuse.Shape();\r\n                result = refineShapeIfActive(result);\r\n            }\r\n\r\n            this->Shape.setValue(getSolid(result));\r\n        }\r\n        else\r\n            return new App::DocumentObjectExecReturn(\"Could not revolve the sketch!\");\r\n\r\n        return App::DocumentObject::StdReturn;\r\n    }\r\n    catch (Standard_Failure) {\r\n        Handle(Standard_Failure) e = Standard_Failure::Caught();\r\n        if (std::string(e->GetMessageString()) == \"TopoDS::Face\")\r\n            return new App::DocumentObjectExecReturn(\"Could not create face from sketch.\\n\"\r\n                \"Intersecting sketch entities in a sketch are not allowed.\");\r\n        else\r\n            return new App::DocumentObjectExecReturn(e->GetMessageString());\r\n    }\r\n    catch (Base::Exception& e) {\r\n        return new App::DocumentObjectExecReturn(e.what());\r\n    }\r\n}\r\n\r\nbool Revolution::suggestReversed(void)\r\n{\r\n    try {\r\n        updateAxis();\r\n    } catch (const Base::Exception& e) {\r\n        return false;\r\n    }\r\n\r\n    return ProfileBased::getReversedAngle(Base.getValue(), Axis.getValue()) < 0.0;\r\n}\r\n\r\nvoid Revolution::updateAxis(void)\r\n{\r\n    App::DocumentObject *pcReferenceAxis = ReferenceAxis.getValue();\r\n    const std::vector<std::string> &subReferenceAxis = ReferenceAxis.getSubValues();\r\n    Base::Vector3d base;\r\n    Base::Vector3d dir;\r\n    getAxis(pcReferenceAxis, subReferenceAxis, base, dir);\r\n\r\n    Base.setValue(base.x,base.y,base.z);\r\n    Axis.setValue(dir.x,dir.y,dir.z);\r\n}\r\n\r\n}\r\n<commit_msg>fix compiler warning<commit_after>\/***************************************************************************\r\n *   Copyright (c) 2010 Juergen Riegel <FreeCAD@juergen-riegel.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#ifndef _PreComp_\r\n# include <BRep_Builder.hxx>\r\n# include <BRepBndLib.hxx>\r\n# include <BRepPrimAPI_MakeRevol.hxx>\r\n# include <BRepBuilderAPI_MakeFace.hxx>\r\n# include <TopoDS.hxx>\r\n# include <TopoDS_Face.hxx>\r\n# include <TopoDS_Wire.hxx>\r\n# include <TopExp_Explorer.hxx>\r\n# include <BRepAlgoAPI_Fuse.hxx>\r\n# include <Precision.hxx>\r\n# include <gp_Lin.hxx>\r\n#endif\r\n\r\n#include <Base\/Axis.h>\r\n#include <Base\/Console.h>\r\n#include <Base\/Exception.h>\r\n#include <Base\/Placement.h>\r\n#include <Base\/Tools.h>\r\n\r\n#include \"FeatureRevolution.h\"\r\n\r\n\r\nusing namespace PartDesign;\r\n\r\nnamespace PartDesign {\r\n\r\n\r\nPROPERTY_SOURCE(PartDesign::Revolution, PartDesign::ProfileBased)\r\n\r\nRevolution::Revolution()\r\n{\r\n    addSubType = FeatureAddSub::Additive;\r\n    \r\n    ADD_PROPERTY_TYPE(Base,(Base::Vector3d(0.0,0.0,0.0)),\"Revolution\", App::Prop_ReadOnly, \"Base\");\r\n    ADD_PROPERTY_TYPE(Axis,(Base::Vector3d(0.0,1.0,0.0)),\"Revolution\", App::Prop_ReadOnly, \"Axis\");\r\n    ADD_PROPERTY_TYPE(Angle,(360.0),\"Revolution\", App::Prop_None, \"Angle\");\r\n    ADD_PROPERTY_TYPE(ReferenceAxis,(0),\"Revolution\",(App::Prop_None),\"Reference axis of revolution\");\r\n}\r\n\r\nshort Revolution::mustExecute() const\r\n{\r\n    if (Placement.isTouched() ||\r\n        ReferenceAxis.isTouched() ||\r\n        Axis.isTouched() ||\r\n        Base.isTouched() ||\r\n        Angle.isTouched())\r\n        return 1;\r\n    return ProfileBased::mustExecute();\r\n}\r\n\r\nApp::DocumentObjectExecReturn *Revolution::execute(void)\r\n{\r\n    \/\/ Validate parameters\r\n    double angle = Angle.getValue();\r\n    if (angle < Precision::Confusion())\r\n        return new App::DocumentObjectExecReturn(\"Angle of revolution too small\");\r\n    if (angle > 360.0)\r\n        return new App::DocumentObjectExecReturn(\"Angle of revolution too large\");\r\n\r\n    angle = Base::toRadians<double>(angle);\r\n    \/\/ Reverse angle if selected\r\n    if (Reversed.getValue() && !Midplane.getValue())\r\n        angle *= (-1.0);\r\n\r\n    TopoDS_Shape sketchshape;\r\n    try {\r\n        sketchshape = getVerifiedFace();\r\n    } catch (const Base::Exception& e) {\r\n        return new App::DocumentObjectExecReturn(e.what());\r\n    }\r\n\r\n    \/\/ if the Base property has a valid shape, fuse the AddShape into it\r\n    TopoDS_Shape base;\r\n    try {\r\n        base = getBaseShape();\r\n    } catch (const Base::Exception&) {\r\n        \/\/ fall back to support (for legacy features)\r\n        base = TopoDS_Shape();\r\n    }\r\n\r\n    \/\/ update Axis from ReferenceAxis\r\n    try {\r\n        updateAxis();\r\n    } catch (const Base::Exception& e) {\r\n        return new App::DocumentObjectExecReturn(e.what());\r\n    }\r\n\r\n    \/\/ get revolve axis\r\n    Base::Vector3d b = Base.getValue();\r\n    gp_Pnt pnt(b.x,b.y,b.z);\r\n    Base::Vector3d v = Axis.getValue();\r\n    gp_Dir dir(v.x,v.y,v.z);\r\n\r\n    try {\r\n        if (sketchshape.IsNull())\r\n            return new App::DocumentObjectExecReturn(\"Creating a face from sketch failed\");\r\n\r\n        \/\/ Rotate the face by half the angle to get Revolution symmetric to sketch plane\r\n        if (Midplane.getValue()) {\r\n            gp_Trsf mov;\r\n            mov.SetRotation(gp_Ax1(pnt, dir), Base::toRadians<double>(Angle.getValue()) * (-1.0) \/ 2.0);\r\n            TopLoc_Location loc(mov);\r\n            sketchshape.Move(loc);\r\n        }\r\n\r\n        this->positionByPrevious();\r\n        TopLoc_Location invObjLoc = this->getLocation().Inverted();\r\n        pnt.Transform(invObjLoc.Transformation());\r\n        dir.Transform(invObjLoc.Transformation());\r\n        base.Move(invObjLoc);\r\n        sketchshape.Move(invObjLoc);\r\n\r\n        \/\/ Check distance between sketchshape and axis - to avoid failures and crashes\r\n        TopExp_Explorer xp;\r\n        xp.Init(sketchshape, TopAbs_FACE);\r\n        for (;xp.More(); xp.Next()) {\r\n            if (checkLineCrossesFace(gp_Lin(pnt, dir), TopoDS::Face(xp.Current())))\r\n                return new App::DocumentObjectExecReturn(\"Revolve axis intersects the sketch\");\r\n        }        \r\n\r\n        \/\/ revolve the face to a solid\r\n        BRepPrimAPI_MakeRevol RevolMaker(sketchshape, gp_Ax1(pnt, dir), angle);\r\n\r\n        if (RevolMaker.IsDone()) {\r\n            TopoDS_Shape result = RevolMaker.Shape();\r\n            result = refineShapeIfActive(result);\r\n            \/\/ set the additive shape property for later usage in e.g. pattern\r\n            this->AddSubShape.setValue(result);            \r\n\r\n            if (!base.IsNull()) {\r\n                \/\/ Let's call algorithm computing a fuse operation:\r\n                BRepAlgoAPI_Fuse mkFuse(base, result);\r\n                \/\/ Let's check if the fusion has been successful\r\n                if (!mkFuse.IsDone())\r\n                    throw Base::Exception(\"Fusion with base feature failed\");\r\n                result = mkFuse.Shape();\r\n                result = refineShapeIfActive(result);\r\n            }\r\n\r\n            this->Shape.setValue(getSolid(result));\r\n        }\r\n        else\r\n            return new App::DocumentObjectExecReturn(\"Could not revolve the sketch!\");\r\n\r\n        return App::DocumentObject::StdReturn;\r\n    }\r\n    catch (Standard_Failure) {\r\n        Handle(Standard_Failure) e = Standard_Failure::Caught();\r\n        if (std::string(e->GetMessageString()) == \"TopoDS::Face\")\r\n            return new App::DocumentObjectExecReturn(\"Could not create face from sketch.\\n\"\r\n                \"Intersecting sketch entities in a sketch are not allowed.\");\r\n        else\r\n            return new App::DocumentObjectExecReturn(e->GetMessageString());\r\n    }\r\n    catch (Base::Exception& e) {\r\n        return new App::DocumentObjectExecReturn(e.what());\r\n    }\r\n}\r\n\r\nbool Revolution::suggestReversed(void)\r\n{\r\n    try {\r\n        updateAxis();\r\n    } catch (const Base::Exception&) {\r\n        return false;\r\n    }\r\n\r\n    return ProfileBased::getReversedAngle(Base.getValue(), Axis.getValue()) < 0.0;\r\n}\r\n\r\nvoid Revolution::updateAxis(void)\r\n{\r\n    App::DocumentObject *pcReferenceAxis = ReferenceAxis.getValue();\r\n    const std::vector<std::string> &subReferenceAxis = ReferenceAxis.getSubValues();\r\n    Base::Vector3d base;\r\n    Base::Vector3d dir;\r\n    getAxis(pcReferenceAxis, subReferenceAxis, base, dir);\r\n\r\n    Base.setValue(base.x,base.y,base.z);\r\n    Axis.setValue(dir.x,dir.y,dir.z);\r\n}\r\n\r\n}\r\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\/aura_shell\/stacking_controller.h\"\n\n#include \"ui\/aura\/desktop.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/aura_shell\/shell.h\"\n#include \"ui\/aura_shell\/shell_window_ids.h\"\n\nnamespace aura_shell {\nnamespace internal {\nnamespace {\n\naura::Window* GetContainer(int id) {\n  return Shell::GetInstance()->GetContainer(id);\n}\n\n\/\/ Returns true if children of |window| can be activated.\nbool SupportsChildActivation(aura::Window* window) {\n  return window->id() == kShellWindowId_DefaultContainer ||\n         window->id() == kShellWindowId_AlwaysOnTopContainer;\n}\n\n}  \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ StackingController, public:\n\nStackingController::StackingController() {\n  aura::Desktop::GetInstance()->SetStackingClient(this);\n}\n\nStackingController::~StackingController() {\n}\n\n\/\/ static\naura::Window* StackingController::GetActivatableWindow(aura::Window* window) {\n  aura::Window* parent = window->parent();\n  aura::Window* child = window;\n  while (parent) {\n    if (SupportsChildActivation(parent))\n      return child;\n    parent = parent->parent();\n    child = child->parent();\n  }\n  return NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ StackingController, aura::StackingClient implementation:\n\nvoid StackingController::AddChildToDefaultParent(aura::Window* window) {\n  aura::Window* parent = NULL;\n  switch (window->type()) {\n    case aura::WINDOW_TYPE_NORMAL:\n    case aura::WINDOW_TYPE_POPUP:\n      parent = GetContainer(internal::kShellWindowId_DefaultContainer);\n      break;\n    case aura::WINDOW_TYPE_MENU:\n    case aura::WINDOW_TYPE_TOOLTIP:\n      parent = GetContainer(internal::kShellWindowId_MenusAndTooltipsContainer);\n      break;\n    default:\n      NOTREACHED() << \"Window \" << window->id()\n                   << \" has unhandled type \" << window->type();\n      break;\n  }\n  parent->AddChild(window);\n}\n\nbool StackingController::CanActivateWindow(aura::Window* window) const {\n  return window && SupportsChildActivation(window->parent());\n}\n\naura::Window* StackingController::GetTopmostWindowToActivate(\n    aura::Window* ignore) const {\n  const aura::Window* container = GetContainer(kShellWindowId_DefaultContainer);\n  for (aura::Window::Windows::const_reverse_iterator i =\n           container->children().rbegin();\n       i != container->children().rend();\n       ++i) {\n    if (*i != ignore && (*i)->CanActivate())\n      return *i;\n  }\n  return NULL;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ StackingController, private:\n\n}  \/\/ namespace internal\n}  \/\/ namespace aura_shell\n<commit_msg>Fix menu crash  Made GetActivatableWindow to follow transient_parent if exists.<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\/aura_shell\/stacking_controller.h\"\n\n#include \"ui\/aura\/desktop.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/aura_shell\/shell.h\"\n#include \"ui\/aura_shell\/shell_window_ids.h\"\n\nnamespace aura_shell {\nnamespace internal {\nnamespace {\n\naura::Window* GetContainer(int id) {\n  return Shell::GetInstance()->GetContainer(id);\n}\n\n\/\/ Returns true if children of |window| can be activated.\nbool SupportsChildActivation(aura::Window* window) {\n  return window->id() == kShellWindowId_DefaultContainer ||\n         window->id() == kShellWindowId_AlwaysOnTopContainer;\n}\n\n}  \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ StackingController, public:\n\nStackingController::StackingController() {\n  aura::Desktop::GetInstance()->SetStackingClient(this);\n}\n\nStackingController::~StackingController() {\n}\n\n\/\/ static\naura::Window* StackingController::GetActivatableWindow(aura::Window* window) {\n  aura::Window* parent = window->parent();\n  aura::Window* child = window;\n  while (parent) {\n    if (SupportsChildActivation(parent))\n      return child;\n    \/\/ If |child| isn't activatable, but has transient parent, trace\n    \/\/ that path instead.\n    if (child->transient_parent())\n      return GetActivatableWindow(child->transient_parent());\n    parent = parent->parent();\n    child = child->parent();\n  }\n  return NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ StackingController, aura::StackingClient implementation:\n\nvoid StackingController::AddChildToDefaultParent(aura::Window* window) {\n  aura::Window* parent = NULL;\n  switch (window->type()) {\n    case aura::WINDOW_TYPE_NORMAL:\n    case aura::WINDOW_TYPE_POPUP:\n      parent = GetContainer(internal::kShellWindowId_DefaultContainer);\n      break;\n    case aura::WINDOW_TYPE_MENU:\n    case aura::WINDOW_TYPE_TOOLTIP:\n      parent = GetContainer(internal::kShellWindowId_MenusAndTooltipsContainer);\n      break;\n    default:\n      NOTREACHED() << \"Window \" << window->id()\n                   << \" has unhandled type \" << window->type();\n      break;\n  }\n  parent->AddChild(window);\n}\n\nbool StackingController::CanActivateWindow(aura::Window* window) const {\n  return window && SupportsChildActivation(window->parent());\n}\n\naura::Window* StackingController::GetTopmostWindowToActivate(\n    aura::Window* ignore) const {\n  const aura::Window* container = GetContainer(kShellWindowId_DefaultContainer);\n  for (aura::Window::Windows::const_reverse_iterator i =\n           container->children().rbegin();\n       i != container->children().rend();\n       ++i) {\n    if (*i != ignore && (*i)->CanActivate())\n      return *i;\n  }\n  return NULL;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ StackingController, private:\n\n}  \/\/ namespace internal\n}  \/\/ namespace aura_shell\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ARGUMENT_TYPE_LIST_HPP_\n#define ARGUMENT_TYPE_LIST_HPP_\n\n#include <string>\n#include <sstream>\n#include <stdexcept>\n#include <type_traits>\n#include <tuple>\n\n#include \"..\/Argument_type_limited.hpp\"\n#include \"..\/..\/utilities.hpp\"\n#include \"..\/..\/Splitter\/Splitter.hpp\"\n\nnamespace aff3ct\n{\nnamespace tools\n{\n\ntemplate <typename T = std::string, class S = Generic_splitter, typename... Ranges>\nclass List_type : public Argument_type_limited<std::vector<T>,Ranges...>\n{\nprotected:\n\tArgument_type* val_type;\n\npublic:\n\ttemplate <typename r, typename... R>\n\texplicit List_type(Argument_type* val_type, const r* range, const R*... ranges)\n\t: Argument_type_limited<std::vector<T>,Ranges...>(generate_title(val_type), range, ranges...), val_type(val_type)\n\t{ }\n\n\texplicit List_type(Argument_type* val_type)\n\t: Argument_type_limited<std::vector<T>,Ranges...>(generate_title(val_type)), val_type(val_type)\n\t{ }\n\n\tvirtual ~List_type()\n\t{\n\t\tif (val_type != nullptr) delete val_type;\n\t};\n\n\tvirtual List_type<T, S, Ranges...>* clone() const\n\t{\n\t\tauto* clone = new List_type<T, S, Ranges...>(val_type);\n\n\t\tclone->val_type = val_type->clone();\n\n\t\treturn dynamic_cast<List_type<T, S, Ranges...>*>(this->clone_ranges(clone));\n\t}\n\n\ttemplate <typename... NewRanges>\n\tInteger_type<T, S, Ranges..., NewRanges...>*\n\tclone(NewRanges*... new_ranges)\n\t{\n\t\tauto* clone = new List_type<T, S, Ranges..., NewRanges...>(val_type);\n\n\t\tthis->clone_ranges(clone);\n\n\t\tclone->add_ranges(new_ranges...);\n\n\t\treturn clone;\n\t}\n\n\tvirtual void check(const std::string& val) const\n\t{\n\t\t\/\/ separate values:\n\t\tauto list = S::split(val);\n\n\t\tunsigned i = 0;\n\t\ttry\n\t\t{\n\t\t\tfor (; i < list.size(); i++)\n\t\t\t\tval_type->check(list[i]);\n\t\t}\n\t\tcatch(std::exception& e)\n\t\t{\n\t\t\tstd::stringstream message;\n\t\t\tmessage << \"has the element \" << i << \" (\" << list[i] << \") not respecting the rules: \" << e.what();\n\n\t\t\tthrow std::runtime_error(message.str());\n\t\t}\n\n\t\tauto list_vals = this->convert(list);\n\n\t\tthis->check_ranges(list_vals);\n\n\t}\n\n\tvirtual const std::string get_title() const\n\t{\n\t\tauto t = \"list of (\" + val_type->get_title() + \")\";\n\n\t\tif (sizeof...(Ranges)) \/\/ then add ranges titles to the argument title\n\t\t{\n\t\t\tt += Argument_type::title_description_separator;\n\t\t\tthis->get_ranges_title(t);\n\t\t}\n\n\t\treturn t;\n\t}\n\n\tvirtual std::vector<T> convert(const std::string& val) const\n\t{\n\t\treturn this->convert(S::split(val));\n\t}\n\n\tvirtual std::vector<T> convert(const std::vector<std::string>& list) const\n\t{\n\t\tstd::vector<T> list_T(list.size());\n\n\t\tvoid * p_val = nullptr;\n\n\t\tfor(unsigned i = 0; i < list.size(); i++)\n\t\t{\n\t\t\tp_val = val_type->get_val(list[i]);\n\n\t\t\tif (p_val == nullptr)\n\t\t\t\tthrow std::runtime_error(\"Couldn't convert value.\");\n\n\t\t\tlist_T[i] = *(T*)p_val;\n\n\t\t\tdelete (T*)p_val;\n\t\t}\n\n\t\treturn list_T;\n\t}\n\n\tstatic std::string generate_title(Argument_type* val_type)\n\t{\n\t\tstd::string str = \"list of \" + val_type->get_short_title();\n\n\t\treturn str;\n\t}\n};\n\ntemplate <typename T = std::string, class S = Generic_splitter, typename... Ranges>\nList_type<T,S,Ranges...>* List(Argument_type* val_type, Ranges*... ranges)\n{\n\treturn new List_type<T,S,Ranges...>(val_type, ranges...);\n}\n\ntemplate <typename T = std::string,\n          class S1 = Generic_splitter, class S2 = String_splitter,\n          typename... Ranges1, typename... Ranges2>\nList_type<std::vector<T>, S1, Ranges1...>*\nList2D(Argument_type* val_type,\n      const std::tuple<Ranges1*...>& ranges1 = std::tuple<>(),\n      const std::tuple<Ranges2*...>& ranges2 = std::tuple<>())\n{\n\tArgument_type* listD2 = apply_tuple(List<T,S2,Ranges2...>, std::tuple_cat(std::make_tuple(val_type), ranges2));\n\treturn apply_tuple(List<std::vector<T>,S1,Ranges1...>, std::tuple_cat(std::make_tuple(listD2), ranges1));\n}\n\ntemplate <typename T = std::string, typename... Ranges1, typename... Ranges2>\nList_type<std::vector<T>, Matlab_style_splitter::D1, Ranges1...>*\nMatlab_vector(Argument_type* val_type,\n              const std::tuple<Ranges1*...>& ranges1 = std::tuple<>(),\n              const std::tuple<Ranges2*...>& ranges2 = std::tuple<>())\n{\n\treturn List2D<T, Matlab_style_splitter::D1, Matlab_style_splitter::D2>(val_type, ranges1, ranges2);\n}\n\n}\n}\n#endif \/* ARGUMENT_TYPE_LIST_HPP_ *\/<commit_msg>Fix return type error of clone method and add tools namespace call for apply_tuple<commit_after>#ifndef ARGUMENT_TYPE_LIST_HPP_\n#define ARGUMENT_TYPE_LIST_HPP_\n\n#include <string>\n#include <sstream>\n#include <stdexcept>\n#include <type_traits>\n#include <tuple>\n\n#include \"..\/Argument_type_limited.hpp\"\n#include \"..\/..\/utilities.hpp\"\n#include \"..\/..\/Splitter\/Splitter.hpp\"\n\nnamespace aff3ct\n{\nnamespace tools\n{\n\ntemplate <typename T = std::string, class S = Generic_splitter, typename... Ranges>\nclass List_type : public Argument_type_limited<std::vector<T>,Ranges...>\n{\nprotected:\n\tArgument_type* val_type;\n\npublic:\n\ttemplate <typename r, typename... R>\n\texplicit List_type(Argument_type* val_type, const r* range, const R*... ranges)\n\t: Argument_type_limited<std::vector<T>,Ranges...>(generate_title(val_type), range, ranges...), val_type(val_type)\n\t{ }\n\n\texplicit List_type(Argument_type* val_type)\n\t: Argument_type_limited<std::vector<T>,Ranges...>(generate_title(val_type)), val_type(val_type)\n\t{ }\n\n\tvirtual ~List_type()\n\t{\n\t\tif (val_type != nullptr) delete val_type;\n\t};\n\n\tvirtual List_type<T, S, Ranges...>* clone() const\n\t{\n\t\tauto* clone = new List_type<T, S, Ranges...>(val_type);\n\n\t\tclone->val_type = val_type->clone();\n\n\t\treturn dynamic_cast<List_type<T, S, Ranges...>*>(this->clone_ranges(clone));\n\t}\n\n\ttemplate <typename... NewRanges>\n\tList_type<T, S, Ranges..., NewRanges...>*\n\tclone(NewRanges*... new_ranges)\n\t{\n\t\tauto* clone = new List_type<T, S, Ranges..., NewRanges...>(val_type);\n\n\t\tthis->clone_ranges(clone);\n\n\t\tclone->add_ranges(new_ranges...);\n\n\t\treturn clone;\n\t}\n\n\tvirtual void check(const std::string& val) const\n\t{\n\t\t\/\/ separate values:\n\t\tauto list = S::split(val);\n\n\t\tunsigned i = 0;\n\t\ttry\n\t\t{\n\t\t\tfor (; i < list.size(); i++)\n\t\t\t\tval_type->check(list[i]);\n\t\t}\n\t\tcatch(std::exception& e)\n\t\t{\n\t\t\tstd::stringstream message;\n\t\t\tmessage << \"has the element \" << i << \" (\" << list[i] << \") not respecting the rules: \" << e.what();\n\n\t\t\tthrow std::runtime_error(message.str());\n\t\t}\n\n\t\tauto list_vals = this->convert(list);\n\n\t\tthis->check_ranges(list_vals);\n\n\t}\n\n\tvirtual const std::string get_title() const\n\t{\n\t\tauto t = \"list of (\" + val_type->get_title() + \")\";\n\n\t\tif (sizeof...(Ranges)) \/\/ then add ranges titles to the argument title\n\t\t{\n\t\t\tt += Argument_type::title_description_separator;\n\t\t\tthis->get_ranges_title(t);\n\t\t}\n\n\t\treturn t;\n\t}\n\n\tvirtual std::vector<T> convert(const std::string& val) const\n\t{\n\t\treturn this->convert(S::split(val));\n\t}\n\n\tvirtual std::vector<T> convert(const std::vector<std::string>& list) const\n\t{\n\t\tstd::vector<T> list_T(list.size());\n\n\t\tvoid * p_val = nullptr;\n\n\t\tfor(unsigned i = 0; i < list.size(); i++)\n\t\t{\n\t\t\tp_val = val_type->get_val(list[i]);\n\n\t\t\tif (p_val == nullptr)\n\t\t\t\tthrow std::runtime_error(\"Couldn't convert value.\");\n\n\t\t\tlist_T[i] = *(T*)p_val;\n\n\t\t\tdelete (T*)p_val;\n\t\t}\n\n\t\treturn list_T;\n\t}\n\n\tstatic std::string generate_title(Argument_type* val_type)\n\t{\n\t\tstd::string str = \"list of \" + val_type->get_short_title();\n\n\t\treturn str;\n\t}\n};\n\ntemplate <typename T = std::string, class S = Generic_splitter, typename... Ranges>\nList_type<T,S,Ranges...>* List(Argument_type* val_type, Ranges*... ranges)\n{\n\treturn new List_type<T,S,Ranges...>(val_type, ranges...);\n}\n\ntemplate <typename T = std::string,\n          class S1 = Generic_splitter, class S2 = String_splitter,\n          typename... Ranges1, typename... Ranges2>\nList_type<std::vector<T>, S1, Ranges1...>*\nList2D(Argument_type* val_type,\n      const std::tuple<Ranges1*...>& ranges1 = std::tuple<>(),\n      const std::tuple<Ranges2*...>& ranges2 = std::tuple<>())\n{\n\tArgument_type* listD2 = tools::apply_tuple(List<T,S2,Ranges2...>, std::tuple_cat(std::make_tuple(val_type), ranges2));\n\treturn tools::apply_tuple(List<std::vector<T>,S1,Ranges1...>, std::tuple_cat(std::make_tuple(listD2), ranges1));\n}\n\ntemplate <typename T = std::string, typename... Ranges1, typename... Ranges2>\nList_type<std::vector<T>, Matlab_style_splitter::D1, Ranges1...>*\nMatlab_vector(Argument_type* val_type,\n              const std::tuple<Ranges1*...>& ranges1 = std::tuple<>(),\n              const std::tuple<Ranges2*...>& ranges2 = std::tuple<>())\n{\n\treturn List2D<T, Matlab_style_splitter::D1, Matlab_style_splitter::D2>(val_type, ranges1, ranges2);\n}\n\n}\n}\n#endif \/* ARGUMENT_TYPE_LIST_HPP_ *\/<|endoftext|>"}
{"text":"<commit_before>#ifndef INCLUDE_UNITTESTS_TRIMESH_ITERATORS_HH\n#define INCLUDE_UNITTESTS_TRIMESH_ITERATORS_HH\n\n#include <gtest\/gtest.h>\n#include <Unittests\/unittests_common.hh>\n\n#include <iostream>\n\nclass OpenMeshIterators : public OpenMeshBase {\n\n    protected:\n\n        \/\/ This function is called before each test is run\n        virtual void SetUp() {\n            \/\/ Add some vertices\n            Mesh::VertexHandle vhandle[4];\n\n            vhandle[0] = mesh_.add_vertex(Mesh::Point(0, 0, 0));\n            vhandle[1] = mesh_.add_vertex(Mesh::Point(0, 1, 0));\n            vhandle[2] = mesh_.add_vertex(Mesh::Point(1, 1, 0));\n            vhandle[3] = mesh_.add_vertex(Mesh::Point(1, 0, 0));\n         \n            \/\/ Add two faces\n            std::vector<Mesh::VertexHandle> face_vhandles;\n\n            face_vhandles.push_back(vhandle[2]);\n            face_vhandles.push_back(vhandle[1]);\n            face_vhandles.push_back(vhandle[0]);\n            mesh_.add_face(face_vhandles);            \n\n            face_vhandles.clear();\n\n            face_vhandles.push_back(vhandle[2]);\n            face_vhandles.push_back(vhandle[0]);\n            face_vhandles.push_back(vhandle[3]);\n            mesh_.add_face(face_vhandles);            \n        }\n\n        \/\/ This function is called after all tests are through\n        virtual void TearDown() {\n\n            \/\/ Do some final stuff with the member data here...\n        }\n\n    \/\/ Member already defined in OpenMeshBase\n    \/\/Mesh mesh_;  \n};\n\n\/*\n * ====================================================================\n * Define tests below\n * ====================================================================\n *\/\n\n\/*\n * Small VertexIterator Test\n *\/\nTEST_F(OpenMeshIterators, VertexIter) {\n\n    unsigned int i = 0;\n\n\n    Mesh::VertexIter v_it=mesh_.vertices_begin(); \n    Mesh::VertexIter  v_end=mesh_.vertices_end(); \n\n\n    EXPECT_EQ(0, v_it.handle().idx()) << \"Index wrong for vertex iterator vertices_begin()\";\n    ++v_it;\n    EXPECT_EQ(1, v_it.handle().idx()) << \"Index wrong in vertex iterator\";\n    ++v_it;\n    EXPECT_EQ(2, v_it.handle().idx()) << \"Index wrong in vertex iterator\";\n    ++v_it;\n    EXPECT_EQ(3, v_it.handle().idx()) << \"Index wrong in vertex iterator\";\n    ++v_it;\n    EXPECT_EQ(4, v_it.handle().idx()) << \"Index wrong in vertex iterator\";\n\n    \/\/ Check end iterator\n    EXPECT_EQ(4, v_end.handle().idx()) << \"Index wrong in vertex iterator for vertices_end()\";    \n\n}\n\n#endif \/\/ INCLUDE GUARD\n<commit_msg>EdgeIterator test<commit_after>#ifndef INCLUDE_UNITTESTS_TRIMESH_ITERATORS_HH\n#define INCLUDE_UNITTESTS_TRIMESH_ITERATORS_HH\n\n#include <gtest\/gtest.h>\n#include <Unittests\/unittests_common.hh>\n\n#include <iostream>\n\nclass OpenMeshIterators : public OpenMeshBase {\n\n    protected:\n\n        \/\/ This function is called before each test is run\n        virtual void SetUp() {\n            \/\/ Add some vertices\n            Mesh::VertexHandle vhandle[4];\n\n            vhandle[0] = mesh_.add_vertex(Mesh::Point(0, 0, 0));\n            vhandle[1] = mesh_.add_vertex(Mesh::Point(0, 1, 0));\n            vhandle[2] = mesh_.add_vertex(Mesh::Point(1, 1, 0));\n            vhandle[3] = mesh_.add_vertex(Mesh::Point(1, 0, 0));\n         \n            \/\/ Add two faces\n            std::vector<Mesh::VertexHandle> face_vhandles;\n\n            face_vhandles.push_back(vhandle[2]);\n            face_vhandles.push_back(vhandle[1]);\n            face_vhandles.push_back(vhandle[0]);\n            mesh_.add_face(face_vhandles);            \n\n            face_vhandles.clear();\n\n            face_vhandles.push_back(vhandle[2]);\n            face_vhandles.push_back(vhandle[0]);\n            face_vhandles.push_back(vhandle[3]);\n            mesh_.add_face(face_vhandles);            \n        }\n\n        \/\/ This function is called after all tests are through\n        virtual void TearDown() {\n\n            \/\/ Do some final stuff with the member data here...\n        }\n\n    \/\/ Member already defined in OpenMeshBase\n    \/\/Mesh mesh_;  \n};\n\n\/*\n * ====================================================================\n * Define tests below\n * ====================================================================\n *\/\n\n\/*\n * Small VertexIterator Test\n *\/\nTEST_F(OpenMeshIterators, VertexIter) {\n\n    unsigned int i = 0;\n\n\n    Mesh::VertexIter v_it=mesh_.vertices_begin(); \n    Mesh::VertexIter  v_end=mesh_.vertices_end(); \n\n\n    EXPECT_EQ(0, v_it.handle().idx()) << \"Index wrong for vertex iterator vertices_begin()\";\n    ++v_it;\n    EXPECT_EQ(1, v_it.handle().idx()) << \"Index wrong in vertex iterator\";\n    ++v_it;\n    EXPECT_EQ(2, v_it.handle().idx()) << \"Index wrong in vertex iterator\";\n    ++v_it;\n    EXPECT_EQ(3, v_it.handle().idx()) << \"Index wrong in vertex iterator\";\n    ++v_it;\n    EXPECT_EQ(4, v_it.handle().idx()) << \"Index wrong in vertex iterator\";\n\n    \/\/ Check end iterator\n    EXPECT_EQ(4, v_end.handle().idx()) << \"Index wrong in vertex iterator for vertices_end()\";    \n\n}\n\n\/*\n * Small EdgeIterator Test\n *\/\nTEST_F(OpenMeshIterators, EdgeIter) {\n\n    unsigned int i = 0;\n\n\n    Mesh::EdgeIter e_it  = mesh_.edges_begin(); \n    Mesh::EdgeIter e_end = mesh_.edges_end(); \n    \n    EXPECT_EQ(0, e_it.handle().idx()) << \"Wrong start index in edge iterator\";\n    EXPECT_EQ(5, e_end.handle().idx()) << \"Wrong end index in edge iterator\";\n\n    EXPECT_EQ(1, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() )   << \"1: Wrong to vertex handle of halfedge 0\";\n    EXPECT_EQ(2, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() ) << \"1: Wrong from vertex handle of halfedge 0\";\n    EXPECT_EQ(2, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() )   << \"1: Wrong to vertex handle of halfedge 1\";\n    EXPECT_EQ(1, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() ) << \"1: Wrong from vertex handle of halfedge 1\";\n\n    ++e_it;\n    EXPECT_EQ(1, e_it.handle().idx()) << \"Wrong index in edge iterator\";\n\n    EXPECT_EQ(0, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() )   << \"2: Wrong to vertex handle of halfedge 0\";\n    EXPECT_EQ(1, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() ) << \"2: Wrong from vertex handle of halfedge 0\";\n    EXPECT_EQ(1, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() )   << \"2: Wrong to vertex handle of halfedge 1\";\n    EXPECT_EQ(0, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() ) << \"2: Wrong from vertex handle of halfedge 1\";\n\n\n    ++e_it;\n    EXPECT_EQ(2, e_it.handle().idx()) << \"Wrong index in edge iterator\";\n\n    EXPECT_EQ(2, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() )   << \"3: Wrong to vertex handle of halfedge 0\";\n    EXPECT_EQ(0, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() ) << \"3: Wrong from vertex handle of halfedge 0\";\n    EXPECT_EQ(0, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() )   << \"3: Wrong to vertex handle of halfedge 1\";\n    EXPECT_EQ(2, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() ) << \"3: Wrong from vertex handle of halfedge 1\";\n\n\n    ++e_it;\n    EXPECT_EQ(3, e_it.handle().idx()) << \"Wrong index in edge iterator\";\n\n    EXPECT_EQ(3, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() )   << \"4: Wrong to vertex handle of halfedge 0\";\n    EXPECT_EQ(0, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() ) << \"4: Wrong from vertex handle of halfedge 0\";\n    EXPECT_EQ(0, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() )   << \"4: Wrong to vertex handle of halfedge 1\";\n    EXPECT_EQ(3, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() ) << \"4: Wrong from vertex handle of halfedge 1\";\n\n\n    ++e_it;\n    EXPECT_EQ(4, e_it.handle().idx()) << \"Wrong index in edge iterator\";\n\n    EXPECT_EQ(2, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() )   << \"5: Wrong to vertex handle of halfedge 0\";\n    EXPECT_EQ(3, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,0)).idx() ) << \"5: Wrong from vertex handle of halfedge 0\";\n    EXPECT_EQ(3, mesh_.to_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() )   << \"5: Wrong to vertex handle of halfedge 1\";\n    EXPECT_EQ(2, mesh_.from_vertex_handle(mesh_.halfedge_handle(e_it,1)).idx() ) << \"5: Wrong from vertex handle of halfedge 1\";\n\n\n}\n\n\n#endif \/\/ INCLUDE GUARD\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 <TChain.h>\n#include <TFile.h>\n \n#include \"AliTender.h\"\n#include \"AliTenderSupply.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliCDBManager.h\"\n#include \"AliESDEvent.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliLog.h\"\n\n\nClassImp(AliTender)\n\n\/\/______________________________________________________________________________\nAliTender::AliTender():\n           AliAnalysisTask(),\n           fDebug(0),\n           fRun(0),\n           fRunChanged(kFALSE),\n           fCDBkey(0),\n           fDefaultStorage(),\n           fCDB(NULL),\n           fESDhandler(NULL),\n           fESD(NULL),\n           fSupplies(NULL)\n{\n\/\/ Dummy constructor\n}\n\n\/\/______________________________________________________________________________\nAliTender::AliTender(const char* name):\n           AliAnalysisTask(name, \"ESD analysis tender car\"),\n           fDebug(0),\n           fRun(0),\n           fRunChanged(kFALSE),\n           fCDBkey(0),\n           fDefaultStorage(),\n           fCDB(NULL),\n           fESDhandler(NULL),\n           fESD(NULL),\n           fSupplies(NULL)\n{\n\/\/ Default constructor\n  DefineInput (0, TChain::Class());\n  DefineOutput(0,  AliESDEvent::Class());\n}\n\n\/\/______________________________________________________________________________\nAliTender::~AliTender()\n{\n\/\/ Destructor\n  if (fSupplies) {\n    fSupplies->Delete();\n    delete fSupplies;\n  }\n}\n\n\/\/______________________________________________________________________________\nvoid AliTender::AddSupply(AliTenderSupply *supply)\n{\n\/\/ Addition of supplies.\n  if (!fSupplies) fSupplies = new TObjArray();\n  if (fSupplies->FindObject(supply)) {\n     Error(\"AddSupply\", \"Tender supply %s already connected.\", supply->GetName());\n     return;\n  }   \n  fSupplies->Add(supply);\n  supply->SetTender(this);\n}\n   \n\/\/______________________________________________________________________________\nvoid AliTender::ConnectInputData(Option_t* \/*option*\/)\n{\n\/\/ Connect the input data, create CDB manager.\n  if (fDebug > 1) Printf(\"AliTender::ConnectInputData()\\n\");\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) AliFatal(\"No tender without an analysis manager\");\n  fESDhandler = dynamic_cast<AliESDInputHandler *>(mgr->GetInputEventHandler());\n    \n  if (fESDhandler) {\n     fESD = fESDhandler->GetEvent();\n  } else {\n     AliFatal(\"No ESD input event handler connected\") ; \n  }\n  \/\/ Create CDB manager\n  if (!fDefaultStorage.Length()) AliFatal(\"Default CDB storage not set.\");\n  fCDB = AliCDBManager::Instance();\n  \/\/ SetDefault storage. Specific storages must be set by AliTenderSupply::Init()\n  fCDB->SetDefaultStorage(fDefaultStorage);\n  fRun = fESD->GetRunNumber();\n  \/\/ Unlock CDB\n  fCDBkey = fCDB->SetLock(kFALSE, fCDBkey);\n  fCDB->SetRun(fRun);\n  TIter next(fSupplies);\n  AliTenderSupply *supply;\n  while ((supply=(AliTenderSupply*)next())) supply->Init();\n  \/\/ Lock CDB\n  fCDBkey = fCDB->SetLock(kTRUE, fCDBkey);\n}\n\n\/\/______________________________________________________________________________\nvoid AliTender::CreateOutputObjects()\n{\n\/\/ Nothing for the moment, but we may need ESD event replication here.\n  if (fDebug > 1) Printf(\"AliTender::CreateOutputObjects()\\n\");\n}\n\n\/\/______________________________________________________________________________\nvoid AliTender::Exec(Option_t* \/*option*\/)\n{\n\/\/\n\/\/ Execute all supplied analysis of one event. Notify run change via RunChanged().\n  if (fDebug > 1) {\n    Long_t entry = fESDhandler->GetReadEntry();\n    Printf(\"AliTender::Exec() %s ==> processing event %lld\\n\", fESDhandler->GetTree()->GetCurrentFile()->GetName(),entry);\n  }  \n  fESD = fESDhandler->GetEvent();\n\n\/\/ Call the user analysis\n  \/\/ Unlock CDB\n  fCDBkey = fCDB->SetLock(kFALSE, fCDBkey);\n  \/\/ Intercept when the run number changed\n  if (fRun != fESD->GetRunNumber()) {\n    fRunChanged = kTRUE;\n    fRun = fESD->GetRunNumber();\n    fCDB->SetRun(fRun);\n  }\n  TIter next(fSupplies);\n  AliTenderSupply *supply;\n  while ((supply=(AliTenderSupply*)next())) supply->ProcessEvent();\n  fRunChanged = kFALSE;\n  \/\/ Lock CDB\n  fCDBkey = fCDB->SetLock(kTRUE, fCDBkey);\n  PostData(0, fESD);\n}\n\n\/\/______________________________________________________________________________\nvoid AliTender::SetDefaultCDBStorage(const char *dbString)\n{\n\/\/ Set default CDB storage\n   fDefaultStorage = dbString;\n}\n<commit_msg>Initialization of variable fixed<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 <TChain.h>\n#include <TFile.h>\n \n#include \"AliTender.h\"\n#include \"AliTenderSupply.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliCDBManager.h\"\n#include \"AliESDEvent.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliLog.h\"\n\n\nClassImp(AliTender)\n\n\/\/______________________________________________________________________________\nAliTender::AliTender():\n           AliAnalysisTask(),\n           fDebug(0),\n           fRun(0),\n           fRunChanged(kFALSE),\n           fCDBkey(0),\n           fDefaultStorage(),\n           fCDB(NULL),\n           fESDhandler(NULL),\n           fESD(NULL),\n           fSupplies(NULL),\n           fCDBSettings(NULL)\n{\n\/\/ Dummy constructor\n}\n\n\/\/______________________________________________________________________________\nAliTender::AliTender(const char* name):\n           AliAnalysisTask(name, \"ESD analysis tender car\"),\n           fDebug(0),\n           fRun(0),\n           fRunChanged(kFALSE),\n           fCDBkey(0),\n           fDefaultStorage(),\n           fCDB(NULL),\n           fESDhandler(NULL),\n           fESD(NULL),\n           fSupplies(NULL),\n           fCDBSettings(NULL)\n{\n\/\/ Default constructor\n  DefineInput (0, TChain::Class());\n  DefineOutput(0,  AliESDEvent::Class());\n}\n\n\/\/______________________________________________________________________________\nAliTender::~AliTender()\n{\n\/\/ Destructor\n  if (fSupplies) {\n    fSupplies->Delete();\n    delete fSupplies;\n  }\n}\n\n\/\/______________________________________________________________________________\nvoid AliTender::AddSupply(AliTenderSupply *supply)\n{\n\/\/ Addition of supplies.\n  if (!fSupplies) fSupplies = new TObjArray();\n  if (fSupplies->FindObject(supply)) {\n     Error(\"AddSupply\", \"Tender supply %s already connected.\", supply->GetName());\n     return;\n  }   \n  fSupplies->Add(supply);\n  supply->SetTender(this);\n}\n   \n\/\/______________________________________________________________________________\nvoid AliTender::ConnectInputData(Option_t* \/*option*\/)\n{\n\/\/ Connect the input data, create CDB manager.\n  if (fDebug > 1) Printf(\"AliTender::ConnectInputData()\\n\");\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) AliFatal(\"No tender without an analysis manager\");\n  fESDhandler = dynamic_cast<AliESDInputHandler *>(mgr->GetInputEventHandler());\n    \n  if (fESDhandler) {\n     fESD = fESDhandler->GetEvent();\n  } else {\n     AliFatal(\"No ESD input event handler connected\") ; \n  }\n  \/\/ Create CDB manager\n  if (!fDefaultStorage.Length()) AliFatal(\"Default CDB storage not set.\");\n  fCDB = AliCDBManager::Instance();\n  \/\/ SetDefault storage. Specific storages must be set by AliTenderSupply::Init()\n  fCDB->SetDefaultStorage(fDefaultStorage);\n  fRun = fESD->GetRunNumber();\n  \/\/ Unlock CDB\n  fCDBkey = fCDB->SetLock(kFALSE, fCDBkey);\n  fCDB->SetRun(fRun);\n  TIter next(fSupplies);\n  AliTenderSupply *supply;\n  while ((supply=(AliTenderSupply*)next())) supply->Init();\n  \/\/ Lock CDB\n  fCDBkey = fCDB->SetLock(kTRUE, fCDBkey);\n}\n\n\/\/______________________________________________________________________________\nvoid AliTender::CreateOutputObjects()\n{\n\/\/ Nothing for the moment, but we may need ESD event replication here.\n  if (fDebug > 1) Printf(\"AliTender::CreateOutputObjects()\\n\");\n}\n\n\/\/______________________________________________________________________________\nvoid AliTender::Exec(Option_t* \/*option*\/)\n{\n\/\/\n\/\/ Execute all supplied analysis of one event. Notify run change via RunChanged().\n  if (fDebug > 1) {\n    Long_t entry = fESDhandler->GetReadEntry();\n    Printf(\"AliTender::Exec() %s ==> processing event %lld\\n\", fESDhandler->GetTree()->GetCurrentFile()->GetName(),entry);\n  }  \n  fESD = fESDhandler->GetEvent();\n\n\/\/ Call the user analysis\n  \/\/ Unlock CDB\n  fCDBkey = fCDB->SetLock(kFALSE, fCDBkey);\n  \/\/ Intercept when the run number changed\n  if (fRun != fESD->GetRunNumber()) {\n    fRunChanged = kTRUE;\n    fRun = fESD->GetRunNumber();\n    fCDB->SetRun(fRun);\n  }\n  TIter next(fSupplies);\n  AliTenderSupply *supply;\n  while ((supply=(AliTenderSupply*)next())) supply->ProcessEvent();\n  fRunChanged = kFALSE;\n  \/\/ Lock CDB\n  fCDBkey = fCDB->SetLock(kTRUE, fCDBkey);\n  PostData(0, fESD);\n}\n\n\/\/______________________________________________________________________________\nvoid AliTender::SetDefaultCDBStorage(const char *dbString)\n{\n\/\/ Set default CDB storage\n   fDefaultStorage = dbString;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <signal.h>\n\n#include \"gen\/wsdd.nsmap\"\n#include \"wsddapi.h\"\n\nconst char* host = \"239.255.255.250\";\t\nint port = 3702;\nconst int _metadataVersion = 1;\nconst char* _xaddr=\"http:\/\/localhost\/service\";\nconst char* _type=\"\\\"http:\/\/schemas.xmlsoap.org\/ws\/2006\/02\/devprof\\\":device\";\n\nbool stop = false;\nvoid sighandler(int sig)\n{\n\tstd::cout<< \"Signal caught...\" << std::endl;\n\tstop = true;\n}\n\nint mainloop(soap* serv)\n{\t\t\n\treturn soap_wsdd_listen(serv, -1000000);\n}\n\nvoid sendHello()\n{\n\tstruct soap* soap = soap_new1(SOAP_IO_UDP);\n\tprintf(\"call soap_wsdd_Hello\\n\");\n\tint res = soap_wsdd_Hello(soap,\n\t  SOAP_WSDD_ADHOC,      \/\/ mode\n\t  \"soap.udp:\/\/239.255.255.250:3702\",         \/\/ address of TS\n\t  soap_wsa_rand_uuid(soap),                   \/\/ message ID\n\t  NULL,                 \n\t  NULL,\n\t  NULL,\n\t  _type,\n\t  NULL,\n\t  _xaddr,\n          _metadataVersion);\n\tif (res != SOAP_OK)\n\t{\n\t\tsoap_print_fault(soap, stderr);\n\t}\n\tsoap_end(soap);\t\n}\n\nvoid sendBye()\n{\n\tstruct soap* soap = soap_new1(SOAP_IO_UDP);\n\tprintf(\"call soap_wsdd_Bye\\n\");\n\tint res = soap_wsdd_Bye(soap,\n\t  SOAP_WSDD_ADHOC,      \/\/ mode\n\t  \"soap.udp:\/\/239.255.255.250:3702\",         \/\/ address of TS\n\t  soap_wsa_rand_uuid(soap),                   \/\/ message ID\n\t  NULL,                 \n\t  NULL,\n\t  _type,\n\t  NULL,\n\t  _xaddr,\n          _metadataVersion);\n\tif (res != SOAP_OK)\n\t{\n\t\tsoap_print_fault(soap, stderr);\n\t}\n\tsoap_end(soap);\n}\n\t\nint main(int argc, char** argv)\n{\n\tstruct soap* serv = soap_new1(SOAP_IO_UDP | SOAP_IO_KEEPALIVE); \n\tserv->bind_flags=SO_REUSEADDR;\n\tserv->connect_flags = SO_BROADCAST; \n\tif (!soap_valid_socket(soap_bind(serv, NULL, port, 1000)))\n\t{\n\t\tsoap_print_fault(serv, stderr);\n\t\texit(1);\n\t}\t\n\n\tip_mreq mcast; \n\tmcast.imr_multiaddr.s_addr = inet_addr(host);\n\tmcast.imr_interface.s_addr = htonl(INADDR_ANY);\n\tif (setsockopt(serv->master, IPPROTO_IP, IP_ADD_MEMBERSHIP, &mcast, sizeof(mcast))<0) \n\t{\n\t\tstd::cout << \"group membership failed:\" << strerror(errno) << std::endl;\t\t\n\t}\t\n\t\n\tsendHello();\n\tmainloop(serv);\n\n\tsignal(SIGINT, &sighandler);\n\twhile (!stop)\n\t{\n\t\tmainloop(serv);\n\t}\n\n\tsendBye();\n\tmainloop(serv);\n\n\treturn 0;\n}\n\nvoid wsdd_event_ProbeMatches(struct soap *soap, unsigned int InstanceId, const char *SequenceId, unsigned int MessageNumber, const char *MessageID, const char *RelatesTo, struct wsdd__ProbeMatchesType *matches)\n{\n\tprintf(\"wsdd_event_ProbeMatches nbMatch:%d\\n\", matches->__sizeProbeMatch);\n}\n\nvoid wsdd_event_ResolveMatches(struct soap *soap, unsigned int InstanceId, const char *SequenceId, unsigned int MessageNumber, const char *MessageID, const char *RelatesTo, struct wsdd__ResolveMatchType *match)\n{\n\tprintf(\"wsdd_event_ResolveMatches\\n\");\n}\n\nvoid wsdd_event_Hello(struct soap *soap, unsigned int InstanceId, const char *SequenceId, unsigned int MessageNumber, const char *MessageID, const char *RelatesTo, const char *EndpointReference, const char *Types, const char *Scopes, const char *MatchBy, const char *XAddrs, unsigned int MetadataVersion)\n{\n\tprintf(\"wsdd_event_Hello id=%s EndpointReference=%s XAddrs=%s\\n\", MessageID, EndpointReference, XAddrs);\n}\n\nvoid wsdd_event_Bye(struct soap *soap, unsigned int InstanceId, const char *SequenceId, unsigned int MessageNumber, const char *MessageID, const char *RelatesTo, const char *EndpointReference, const char *Types, const char *Scopes, const char *MatchBy, const char *XAddrs, unsigned int *MetadataVersion)\n{\n\tprintf(\"wsdd_event_Bye id=%s EndpointReference=%s XAddrs=%s\\n\", MessageID, EndpointReference, XAddrs);\n}\n\nsoap_wsdd_mode wsdd_event_Resolve(struct soap *soap, const char *MessageID, const char *ReplyTo, const char *EndpointReference, struct wsdd__ResolveMatchType *match)\n{\n\tprintf(\"wsdd_event_Resolve  id=%s replyTo=%s\\n\", MessageID, ReplyTo);\n\treturn SOAP_WSDD_ADHOC;\n}\n\nsoap_wsdd_mode wsdd_event_Probe(struct soap *soap, const char *MessageID, const char *ReplyTo, const char *Types, const char *Scopes, const char *MatchBy, struct wsdd__ProbeMatchesType *matches)\n{\n\tprintf(\"wsdd_event_Probe id=%s replyTo=%s types=%s scopes=%s\\n\", MessageID, ReplyTo, Types, Scopes);\n\tsoap_wsdd_init_ProbeMatches(soap,matches);\n\tsoap_wsdd_add_ProbeMatch(soap, matches, \"soap.udp:\/\/239.255.255.250:3702\", _type, NULL, NULL, _xaddr, _metadataVersion);\n\tsoap_wsdd_ProbeMatches(soap, \"soap.udp:\/\/239.255.255.250:3702\", soap_wsa_rand_uuid(soap) , MessageID, ReplyTo, matches);\n\treturn SOAP_WSDD_ADHOC;\n}\n\n<commit_msg>Hello\/Bye need an endpoint not NULL<commit_after>#include <signal.h>\n\n#include \"gen\/wsdd.nsmap\"\n#include \"wsddapi.h\"\n\nconst char* host = \"239.255.255.250\";\t\nint port = 3702;\nconst int _metadataVersion = 1;\nconst char* _xaddr=\"http:\/\/localhost\/service\";\nconst char* _type=\"\\\"http:\/\/schemas.xmlsoap.org\/ws\/2006\/02\/devprof\\\":device\";\nconst char* _endpoint=\"urn\";\n\nbool stop = false;\nvoid sighandler(int sig)\n{\n\tstd::cout<< \"Signal caught...\" << std::endl;\n\tstop = true;\n}\n\nint mainloop(soap* serv)\n{\t\t\n\treturn soap_wsdd_listen(serv, -1000000);\n}\n\nvoid sendHello()\n{\n\tstruct soap* soap = soap_new1(SOAP_IO_UDP);\n\tprintf(\"call soap_wsdd_Hello\\n\");\n\tint res = soap_wsdd_Hello(soap,\n\t  SOAP_WSDD_ADHOC,      \/\/ mode\n\t  \"soap.udp:\/\/239.255.255.250:3702\",         \/\/ address of TS\n\t  soap_wsa_rand_uuid(soap),                   \/\/ message ID\n\t  NULL,                 \n\t  _endpoint,\n\t  NULL,\n\t  _type,\n\t  NULL,\n\t  _xaddr,\n          _metadataVersion);\n\tif (res != SOAP_OK)\n\t{\n\t\tsoap_print_fault(soap, stderr);\n\t}\n\tsoap_end(soap);\t\n}\n\nvoid sendBye()\n{\n\tstruct soap* soap = soap_new1(SOAP_IO_UDP);\n\tprintf(\"call soap_wsdd_Bye\\n\");\n\tint res = soap_wsdd_Bye(soap,\n\t  SOAP_WSDD_ADHOC,      \/\/ mode\n\t  \"soap.udp:\/\/239.255.255.250:3702\",         \/\/ address of TS\n\t  soap_wsa_rand_uuid(soap),                   \/\/ message ID\n\t  _endpoint,                 \n\t  NULL,\n\t  _type,\n\t  NULL,\n\t  _xaddr,\n          _metadataVersion);\n\tif (res != SOAP_OK)\n\t{\n\t\tsoap_print_fault(soap, stderr);\n\t}\n\tsoap_end(soap);\n}\n\t\nint main(int argc, char** argv)\n{\n\tstruct soap* serv = soap_new1(SOAP_IO_UDP | SOAP_IO_KEEPALIVE); \n\tserv->bind_flags=SO_REUSEADDR;\n\tserv->connect_flags = SO_BROADCAST; \n\tif (!soap_valid_socket(soap_bind(serv, NULL, port, 1000)))\n\t{\n\t\tsoap_print_fault(serv, stderr);\n\t\texit(1);\n\t}\t\n\n\tip_mreq mcast; \n\tmcast.imr_multiaddr.s_addr = inet_addr(host);\n\tmcast.imr_interface.s_addr = htonl(INADDR_ANY);\n\tif (setsockopt(serv->master, IPPROTO_IP, IP_ADD_MEMBERSHIP, &mcast, sizeof(mcast))<0) \n\t{\n\t\tstd::cout << \"group membership failed:\" << strerror(errno) << std::endl;\t\t\n\t}\t\n\t\n\tsendHello();\n\tmainloop(serv);\n\n\tsignal(SIGINT, &sighandler);\n\twhile (!stop)\n\t{\n\t\tmainloop(serv);\n\t}\n\n\tsendBye();\n\tmainloop(serv);\n\n\treturn 0;\n}\n\nvoid wsdd_event_ProbeMatches(struct soap *soap, unsigned int InstanceId, const char *SequenceId, unsigned int MessageNumber, const char *MessageID, const char *RelatesTo, struct wsdd__ProbeMatchesType *matches)\n{\n\tprintf(\"wsdd_event_ProbeMatches nbMatch:%d\\n\", matches->__sizeProbeMatch);\n}\n\nvoid wsdd_event_ResolveMatches(struct soap *soap, unsigned int InstanceId, const char *SequenceId, unsigned int MessageNumber, const char *MessageID, const char *RelatesTo, struct wsdd__ResolveMatchType *match)\n{\n\tprintf(\"wsdd_event_ResolveMatches\\n\");\n}\n\nvoid wsdd_event_Hello(struct soap *soap, unsigned int InstanceId, const char *SequenceId, unsigned int MessageNumber, const char *MessageID, const char *RelatesTo, const char *EndpointReference, const char *Types, const char *Scopes, const char *MatchBy, const char *XAddrs, unsigned int MetadataVersion)\n{\n\tprintf(\"wsdd_event_Hello id=%s EndpointReference=%s XAddrs=%s\\n\", MessageID, EndpointReference, XAddrs);\n}\n\nvoid wsdd_event_Bye(struct soap *soap, unsigned int InstanceId, const char *SequenceId, unsigned int MessageNumber, const char *MessageID, const char *RelatesTo, const char *EndpointReference, const char *Types, const char *Scopes, const char *MatchBy, const char *XAddrs, unsigned int *MetadataVersion)\n{\n\tprintf(\"wsdd_event_Bye id=%s EndpointReference=%s XAddrs=%s\\n\", MessageID, EndpointReference, XAddrs);\n}\n\nsoap_wsdd_mode wsdd_event_Resolve(struct soap *soap, const char *MessageID, const char *ReplyTo, const char *EndpointReference, struct wsdd__ResolveMatchType *match)\n{\n\tprintf(\"wsdd_event_Resolve  id=%s replyTo=%s\\n\", MessageID, ReplyTo);\n\treturn SOAP_WSDD_ADHOC;\n}\n\nsoap_wsdd_mode wsdd_event_Probe(struct soap *soap, const char *MessageID, const char *ReplyTo, const char *Types, const char *Scopes, const char *MatchBy, struct wsdd__ProbeMatchesType *matches)\n{\n\tprintf(\"wsdd_event_Probe id=%s replyTo=%s types=%s scopes=%s\\n\", MessageID, ReplyTo, Types, Scopes);\n\tsoap_wsdd_init_ProbeMatches(soap,matches);\n\tsoap_wsdd_add_ProbeMatch(soap, matches, \"soap.udp:\/\/239.255.255.250:3702\", _type, NULL, NULL, _xaddr, _metadataVersion);\n\tsoap_wsdd_ProbeMatches(soap, \"soap.udp:\/\/239.255.255.250:3702\", soap_wsa_rand_uuid(soap) , MessageID, ReplyTo, matches);\n\treturn SOAP_WSDD_ADHOC;\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\/views\/controls\/webview\/webview.h\"\n\n#include \"content\/public\/browser\/browser_context.h\"\n#include \"content\/public\/browser\/navigation_controller.h\"\n#include \"content\/public\/browser\/notification_details.h\"\n#include \"content\/public\/browser\/notification_registrar.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n#include \"content\/public\/browser\/notification_types.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/render_widget_host_view.h\"\n#include \"ipc\/ipc_message.h\"\n#include \"ui\/base\/accessibility\/accessible_view_state.h\"\n#include \"ui\/base\/accessibility\/accessibility_types.h\"\n#include \"ui\/views\/controls\/native\/native_view_host.h\"\n#include \"ui\/views\/focus\/focus_manager.h\"\n\nnamespace views {\n\n\/\/ static\nconst char WebView::kViewClassName[] =\n    \"ui\/views\/WebView\";\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, public:\n\nWebView::WebView(content::BrowserContext* browser_context)\n    : wcv_holder_(new NativeViewHost),\n      web_contents_(NULL),\n      browser_context_(browser_context) {\n  AddChildView(wcv_holder_);\n}\n\nWebView::~WebView() {\n}\n\ncontent::WebContents* WebView::GetWebContents() {\n  CreateWebContentsWithSiteInstance(NULL);\n  return web_contents_;\n}\n\nvoid WebView::CreateWebContentsWithSiteInstance(\n    content::SiteInstance* site_instance) {\n  if (!web_contents_) {\n    wc_owner_.reset(content::WebContents::Create(browser_context_,\n                                                 site_instance,\n                                                 MSG_ROUTING_NONE,\n                                                 NULL,\n                                                 NULL));\n    web_contents_ = wc_owner_.get();\n    web_contents_->SetDelegate(this);\n    AttachWebContents();\n  }\n}\n\nvoid WebView::SetWebContents(content::WebContents* web_contents) {\n  if (web_contents == web_contents_)\n    return;\n  DetachWebContents();\n  wc_owner_.reset();\n  web_contents_ = web_contents;\n  AttachWebContents();\n}\n\nvoid WebView::LoadInitialURL(const GURL& url) {\n  GetWebContents()->GetController().LoadURL(\n      url, content::Referrer(), content::PAGE_TRANSITION_START_PAGE,\n      std::string());\n}\n\nvoid WebView::SetFastResize(bool fast_resize) {\n  wcv_holder_->set_fast_resize(fast_resize);\n}\n\nvoid WebView::OnWebContentsFocused(content::WebContents* web_contents) {\n  FocusManager* focus_manager = GetFocusManager();\n  if (focus_manager)\n    focus_manager->SetFocusedView(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, View overrides:\n\nstd::string WebView::GetClassName() const {\n  return kViewClassName;\n}\n\nvoid WebView::OnBoundsChanged(const gfx::Rect& previous_bounds) {\n  wcv_holder_->SetSize(bounds().size());\n}\n\nvoid WebView::ViewHierarchyChanged(bool is_add, View* parent, View* child) {\n  if (is_add)\n    AttachWebContents();\n}\n\nbool WebView::SkipDefaultKeyEventProcessing(const views::KeyEvent& event) {\n  \/\/ Don't look-up accelerators or tab-traversal if we are showing a non-crashed\n  \/\/ TabContents.\n  \/\/ We'll first give the page a chance to process the key events.  If it does\n  \/\/ not process them, they'll be returned to us and we'll treat them as\n  \/\/ accelerators then.\n  return web_contents_ && !web_contents_->IsCrashed();\n}\n\nbool WebView::IsFocusable() const {\n  \/\/ We need to be focusable when our contents is not a view hierarchy, as\n  \/\/ clicking on the contents needs to focus us.\n  return !!web_contents_;\n}\n\nvoid WebView::OnFocus() {\n  if (web_contents_)\n    web_contents_->Focus();\n}\n\nvoid WebView::AboutToRequestFocusFromTabTraversal(bool reverse) {\n  if (web_contents_)\n    web_contents_->FocusThroughTabTraversal(reverse);\n}\n\nvoid WebView::GetAccessibleState(ui::AccessibleViewState* state) {\n  state->role = ui::AccessibilityTypes::ROLE_GROUPING;\n}\n\ngfx::NativeViewAccessible WebView::GetNativeViewAccessible() {\n  if (web_contents_) {\n    content::RenderWidgetHostView* host_view =\n        web_contents_->GetRenderWidgetHostView();\n    if (host_view)\n      return host_view->GetNativeViewAccessible();\n  }\n  return View::GetNativeViewAccessible();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, content::NotificationObserver implementation:\n\nvoid WebView::Observe(int type,\n                      const content::NotificationSource& source,\n                      const content::NotificationDetails& details) {\n  if (type == content::NOTIFICATION_RENDER_VIEW_HOST_CHANGED) {\n    std::pair<content::RenderViewHost*, content::RenderViewHost*>*\n        switched_details =\n            content::Details<std::pair<content::RenderViewHost*,\n                                       content::RenderViewHost*> >(\n                details).ptr();\n    RenderViewHostChanged(switched_details->first,\n                          switched_details->second);\n  } else if (type == content::NOTIFICATION_WEB_CONTENTS_DESTROYED) {\n    WebContentsDestroyed(content::Source<content::WebContents>(source).ptr());\n  } else {\n    NOTREACHED();\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, content::WebContentsDelegate implementation:\n\nvoid WebView::WebContentsFocused(content::WebContents* web_contents) {\n  DCHECK(wc_owner_.get());\n  \/\/ The WebView is only the delegate of WebContentses it creates itself.\n  OnWebContentsFocused(web_contents_);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, private:\n\nvoid WebView::AttachWebContents() {\n  \/\/ Prevents attachment if the WebView isn't already in a Widget, or it's\n  \/\/ already attached.\n  if (!GetWidget() || !web_contents_ ||\n      wcv_holder_->native_view() == web_contents_->GetNativeView()) {\n    return;\n  }\n\n  if (web_contents_) {\n    wcv_holder_->Attach(web_contents_->GetNativeView());\n\n    \/\/ The WebContentsView will not be focused automatically when it is\n    \/\/ attached, so we need to pass on focus to it if the FocusManager thinks\n    \/\/ the WebView is focused.\n    if (GetFocusManager()->GetFocusedView() == this)\n      web_contents_->Focus();\n\n    registrar_.Add(\n        this,\n        content::NOTIFICATION_RENDER_VIEW_HOST_CHANGED,\n        content::Source<content::NavigationController>(\n            &web_contents_->GetController()));\n    registrar_.Add(\n        this,\n        content::NOTIFICATION_WEB_CONTENTS_DESTROYED,\n        content::Source<content::WebContents>(web_contents_));\n  }\n}\n\nvoid WebView::DetachWebContents() {\n  if (web_contents_) {\n    wcv_holder_->Detach();\n#if defined(OS_WIN) && !defined(USE_AURA)\n    \/\/ TODO(beng): This should either not be necessary, or be done implicitly by\n    \/\/             NativeViewHostWin on Detach(). As it stands, this is needed\n    \/\/             so that the view of the detached contents knows to tell the\n    \/\/             renderer its been hidden.\n    ShowWindow(web_contents_->GetNativeView(), SW_HIDE);\n#endif\n  }\n  registrar_.RemoveAll();\n}\n\nvoid WebView::RenderViewHostChanged(content::RenderViewHost* old_host,\n                                    content::RenderViewHost* new_host) {\n  if (GetFocusManager()->GetFocusedView() == this)\n    web_contents_->Focus();\n}\n\nvoid WebView::WebContentsDestroyed(content::WebContents* web_contents) {\n  DCHECK(web_contents == web_contents_);\n  SetWebContents(NULL);\n}\n\n}  \/\/ namespace views\n<commit_msg>Revert 133490 - Make sure the WebContents has focus after being attached to a WebView, if that WebView was focused.<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\/controls\/webview\/webview.h\"\n\n#include \"content\/public\/browser\/browser_context.h\"\n#include \"content\/public\/browser\/navigation_controller.h\"\n#include \"content\/public\/browser\/notification_details.h\"\n#include \"content\/public\/browser\/notification_registrar.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n#include \"content\/public\/browser\/notification_types.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/render_widget_host_view.h\"\n#include \"ipc\/ipc_message.h\"\n#include \"ui\/base\/accessibility\/accessible_view_state.h\"\n#include \"ui\/base\/accessibility\/accessibility_types.h\"\n#include \"ui\/views\/controls\/native\/native_view_host.h\"\n#include \"ui\/views\/focus\/focus_manager.h\"\n\nnamespace views {\n\n\/\/ static\nconst char WebView::kViewClassName[] =\n    \"ui\/views\/WebView\";\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, public:\n\nWebView::WebView(content::BrowserContext* browser_context)\n    : wcv_holder_(new NativeViewHost),\n      web_contents_(NULL),\n      browser_context_(browser_context) {\n  AddChildView(wcv_holder_);\n}\n\nWebView::~WebView() {\n}\n\ncontent::WebContents* WebView::GetWebContents() {\n  CreateWebContentsWithSiteInstance(NULL);\n  return web_contents_;\n}\n\nvoid WebView::CreateWebContentsWithSiteInstance(\n    content::SiteInstance* site_instance) {\n  if (!web_contents_) {\n    wc_owner_.reset(content::WebContents::Create(browser_context_,\n                                                 site_instance,\n                                                 MSG_ROUTING_NONE,\n                                                 NULL,\n                                                 NULL));\n    web_contents_ = wc_owner_.get();\n    web_contents_->SetDelegate(this);\n    AttachWebContents();\n  }\n}\n\nvoid WebView::SetWebContents(content::WebContents* web_contents) {\n  if (web_contents == web_contents_)\n    return;\n  DetachWebContents();\n  wc_owner_.reset();\n  web_contents_ = web_contents;\n  AttachWebContents();\n}\n\nvoid WebView::LoadInitialURL(const GURL& url) {\n  GetWebContents()->GetController().LoadURL(\n      url, content::Referrer(), content::PAGE_TRANSITION_START_PAGE,\n      std::string());\n}\n\nvoid WebView::SetFastResize(bool fast_resize) {\n  wcv_holder_->set_fast_resize(fast_resize);\n}\n\nvoid WebView::OnWebContentsFocused(content::WebContents* web_contents) {\n  FocusManager* focus_manager = GetFocusManager();\n  if (focus_manager)\n    focus_manager->SetFocusedView(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, View overrides:\n\nstd::string WebView::GetClassName() const {\n  return kViewClassName;\n}\n\nvoid WebView::OnBoundsChanged(const gfx::Rect& previous_bounds) {\n  wcv_holder_->SetSize(bounds().size());\n}\n\nvoid WebView::ViewHierarchyChanged(bool is_add, View* parent, View* child) {\n  if (is_add)\n    AttachWebContents();\n}\n\nbool WebView::SkipDefaultKeyEventProcessing(const views::KeyEvent& event) {\n  \/\/ Don't look-up accelerators or tab-traversal if we are showing a non-crashed\n  \/\/ TabContents.\n  \/\/ We'll first give the page a chance to process the key events.  If it does\n  \/\/ not process them, they'll be returned to us and we'll treat them as\n  \/\/ accelerators then.\n  return web_contents_ && !web_contents_->IsCrashed();\n}\n\nbool WebView::IsFocusable() const {\n  \/\/ We need to be focusable when our contents is not a view hierarchy, as\n  \/\/ clicking on the contents needs to focus us.\n  return !!web_contents_;\n}\n\nvoid WebView::OnFocus() {\n  if (web_contents_)\n    web_contents_->Focus();\n}\n\nvoid WebView::AboutToRequestFocusFromTabTraversal(bool reverse) {\n  if (web_contents_)\n    web_contents_->FocusThroughTabTraversal(reverse);\n}\n\nvoid WebView::GetAccessibleState(ui::AccessibleViewState* state) {\n  state->role = ui::AccessibilityTypes::ROLE_GROUPING;\n}\n\ngfx::NativeViewAccessible WebView::GetNativeViewAccessible() {\n  if (web_contents_) {\n    content::RenderWidgetHostView* host_view =\n        web_contents_->GetRenderWidgetHostView();\n    if (host_view)\n      return host_view->GetNativeViewAccessible();\n  }\n  return View::GetNativeViewAccessible();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, content::NotificationObserver implementation:\n\nvoid WebView::Observe(int type,\n                      const content::NotificationSource& source,\n                      const content::NotificationDetails& details) {\n  if (type == content::NOTIFICATION_RENDER_VIEW_HOST_CHANGED) {\n    std::pair<content::RenderViewHost*, content::RenderViewHost*>*\n        switched_details =\n            content::Details<std::pair<content::RenderViewHost*,\n                                       content::RenderViewHost*> >(\n                details).ptr();\n    RenderViewHostChanged(switched_details->first,\n                          switched_details->second);\n  } else if (type == content::NOTIFICATION_WEB_CONTENTS_DESTROYED) {\n    WebContentsDestroyed(content::Source<content::WebContents>(source).ptr());\n  } else {\n    NOTREACHED();\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, content::WebContentsDelegate implementation:\n\nvoid WebView::WebContentsFocused(content::WebContents* web_contents) {\n  DCHECK(wc_owner_.get());\n  \/\/ The WebView is only the delegate of WebContentses it creates itself.\n  OnWebContentsFocused(web_contents_);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ WebView, private:\n\nvoid WebView::AttachWebContents() {\n  \/\/ Prevents attachment if the WebView isn't already in a Widget, or it's\n  \/\/ already attached.\n  if (!GetWidget() || !web_contents_ ||\n      wcv_holder_->native_view() == web_contents_->GetNativeView()) {\n    return;\n  }\n\n  if (web_contents_) {\n    wcv_holder_->Attach(web_contents_->GetNativeView());\n\n    registrar_.Add(\n        this,\n        content::NOTIFICATION_RENDER_VIEW_HOST_CHANGED,\n        content::Source<content::NavigationController>(\n            &web_contents_->GetController()));\n    registrar_.Add(\n        this,\n        content::NOTIFICATION_WEB_CONTENTS_DESTROYED,\n        content::Source<content::WebContents>(web_contents_));\n  }\n}\n\nvoid WebView::DetachWebContents() {\n  if (web_contents_) {\n    wcv_holder_->Detach();\n#if defined(OS_WIN) && !defined(USE_AURA)\n    \/\/ TODO(beng): This should either not be necessary, or be done implicitly by\n    \/\/             NativeViewHostWin on Detach(). As it stands, this is needed\n    \/\/             so that the view of the detached contents knows to tell the\n    \/\/             renderer its been hidden.\n    ShowWindow(web_contents_->GetNativeView(), SW_HIDE);\n#endif\n  }\n  registrar_.RemoveAll();\n}\n\nvoid WebView::RenderViewHostChanged(content::RenderViewHost* old_host,\n                                    content::RenderViewHost* new_host) {\n  if (GetFocusManager()->GetFocusedView() == this)\n    web_contents_->Focus();\n}\n\nvoid WebView::WebContentsDestroyed(content::WebContents* web_contents) {\n  DCHECK(web_contents == web_contents_);\n  SetWebContents(NULL);\n}\n\n}  \/\/ namespace views\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file protocol.hpp\n * @brief Communication protocol used in the image search.\n * @author Paolo D'Apice\n *\/\n\n#ifndef VIS_PROTOCOL_HPP\n#define VIS_PROTOCOL_HPP\n\n#include <boost\/asio\/streambuf.hpp>\n#include <iostream>\n#include <vector>\n\nnamespace vis {\n\nenum RequestType { \/\/ TODO move into Request\n    OFFLINE,\n    REALTIME,\n    UPLOAD\n};\n\nenum QueryType { \/\/ TODO move into Request\n    COLOR,\n    SHAPE,\n    COLOR_SHAPE\n};\n\ntypedef size_t id_type; \/\/ XXX vis::Index::id_type\n\nstruct Request {\n    RequestType type;\n    std::string category;\n    QueryType queryType;\n    unsigned numResults;\n\n\/\/ TODO boost::variant?\n    id_type id; \/\/ offline\n    std::vector<float> descriptors; \/\/ realtime\n    \/\/ TODO opencv image\n\n};\n\nenum ResponseStatus { \/\/ TODO move into Response\n    OK,\n    ERROR,\n    NO_CATEGORY,\n    NO_QUERY_TYPE\n};\n\nstruct Match { \/\/ TODO move into Response\n    id_type id;\n    std::string path;\n};\n\nstruct Response {\n    ResponseStatus status;\n    std::vector<Match> results;\n};\n\ninline bool\noperator==(const Request& left, const Request& right) {\n    bool b = left.type == right.type\n        and left.category == right.category\n        and left.queryType == right.queryType\n        and left.numResults == right.numResults;\n    if (!b) return false;\n\n    switch(left.type) {\n        case vis::RequestType::OFFLINE:\n            return left.id == right.id;\n        case vis::RequestType::REALTIME:\n            return left.descriptors == right.descriptors;\n        case vis::RequestType::UPLOAD:\n            \/\/ TODO\n            return true;\n    }\n}\n\ninline bool\noperator==(const vis::Match& left, const vis::Match& right) {\n    return left.id == right.id and left.path == right.path;\n}\n\ninline bool\noperator==(const vis::Response& left, const vis::Response& right) {\n    return left.status == right.status and left.results == right.results;\n}\n\ntemplate <typename T>\ninline std::ostream&\noperator<<(std::ostream& os, const std::vector<T>& v) {\n    std::copy(v.begin(), v.end(), std::ostream_iterator<T>(os, \" \"));\n    return os;\n}\n\ntemplate <typename T>\ninline std::istream&\noperator>>(std::istream& is, std::vector<T>& v) {\n    std::copy(std::istream_iterator<T>(is), std::istream_iterator<T>(), std::back_inserter(v));\n    return is;\n}\n\ntemplate <typename E>\ntypename std::enable_if<std::is_enum<E>::value, std::istream&>::type\noperator>>(std::istream& is, E& e) {\n    unsigned int value = 0;\n    if (is >> value)\n        e = static_cast<E>(value);\n    return is;\n}\n\ninline std::ostream&\noperator<<(std::ostream& os, const vis::Match& m) {\n    return os << m.id << \" \" << m.path;\n}\n\ninline std::istream&\noperator>>(std::istream& is, vis::Match& m) {\n    return is >> m.id >> m.path;\n}\n\ninline std::ostream&\noperator<<(std::ostream& os, const vis::Request& r) {\n    os << r.type << ' ' << r.category << ' '\n        << r.queryType << ' ' << r.numResults << ' ';\n    switch (r.type) {\n        case vis::RequestType::OFFLINE:\n            os << r.id;\n            break;\n        case vis::RequestType::REALTIME:\n            os << r.descriptors;\n            break;\n        case vis::RequestType::UPLOAD:\n            \/\/ TODO\n            break;\n    }\n    return os;\n}\n\ninline std::istream&\noperator>>(std::istream& is, vis::Request& r) {\n    is >> r.type >> r.category >> r.queryType >> r.numResults;\n    switch (r.type) {\n        case vis::RequestType::OFFLINE:\n            is >> r.id;\n            break;\n        case vis::RequestType::REALTIME:\n            is >> r.descriptors;\n            break;\n        case vis::RequestType::UPLOAD:\n            \/\/ TODO\n            break;\n    }\n    return is;\n}\n\ninline std::ostream&\noperator<<(std::ostream& os, const vis::Response& r) {\n    os << r.status << \" \" << r.results;\n    return os;\n}\n\ninline std::istream&\noperator>>(std::istream& is, vis::Response& r) {\n    is >> r.status >> r.results;\n    return is;\n}\n\ntemplate <typename Object>\nvoid\nput(boost::asio::streambuf& buf, const Object& obj) {\n    std::ostream os(&buf);\n    os << obj;\n}\n\ntemplate <typename Object>\nvoid\nget(boost::asio::streambuf& buf, Object& obj) {\n    std::istream is(&buf);\n    is >> obj;\n}\n\n} \/\/ namespace vis\n\n#endif \/\/ VIS_PROTOCOL_HPP\n\n<commit_msg>Fix missing header<commit_after>\/**\n * @file protocol.hpp\n * @brief Communication protocol used in the image search.\n * @author Paolo D'Apice\n *\/\n\n#ifndef VIS_PROTOCOL_HPP\n#define VIS_PROTOCOL_HPP\n\n#include <boost\/asio\/streambuf.hpp>\n#include <iostream>\n#include <iterator>\n#include <vector>\n\nnamespace vis {\n\nenum RequestType { \/\/ TODO move into Request\n    OFFLINE,\n    REALTIME,\n    UPLOAD\n};\n\nenum QueryType { \/\/ TODO move into Request\n    COLOR,\n    SHAPE,\n    COLOR_SHAPE\n};\n\ntypedef size_t id_type; \/\/ XXX vis::Index::id_type\n\nstruct Request {\n    RequestType type;\n    std::string category;\n    QueryType queryType;\n    unsigned numResults;\n\n\/\/ TODO boost::variant?\n    id_type id; \/\/ offline\n    std::vector<float> descriptors; \/\/ realtime\n    \/\/ TODO opencv image\n\n};\n\nenum ResponseStatus { \/\/ TODO move into Response\n    OK,\n    ERROR,\n    NO_CATEGORY,\n    NO_QUERY_TYPE\n};\n\nstruct Match { \/\/ TODO move into Response\n    id_type id;\n    std::string path;\n};\n\nstruct Response {\n    ResponseStatus status;\n    std::vector<Match> results;\n};\n\ninline bool\noperator==(const Request& left, const Request& right) {\n    bool b = left.type == right.type\n        and left.category == right.category\n        and left.queryType == right.queryType\n        and left.numResults == right.numResults;\n    if (!b) return false;\n\n    switch(left.type) {\n        case vis::RequestType::OFFLINE:\n            return left.id == right.id;\n        case vis::RequestType::REALTIME:\n            return left.descriptors == right.descriptors;\n        case vis::RequestType::UPLOAD:\n            \/\/ TODO\n            return true;\n    }\n}\n\ninline bool\noperator==(const vis::Match& left, const vis::Match& right) {\n    return left.id == right.id and left.path == right.path;\n}\n\ninline bool\noperator==(const vis::Response& left, const vis::Response& right) {\n    return left.status == right.status and left.results == right.results;\n}\n\ntemplate <typename T>\ninline std::ostream&\noperator<<(std::ostream& os, const std::vector<T>& v) {\n    std::copy(v.begin(), v.end(), std::ostream_iterator<T>(os, \" \"));\n    return os;\n}\n\ntemplate <typename T>\ninline std::istream&\noperator>>(std::istream& is, std::vector<T>& v) {\n    std::copy(std::istream_iterator<T>(is), std::istream_iterator<T>(), std::back_inserter(v));\n    return is;\n}\n\ntemplate <typename E>\ntypename std::enable_if<std::is_enum<E>::value, std::istream&>::type\noperator>>(std::istream& is, E& e) {\n    unsigned int value = 0;\n    if (is >> value)\n        e = static_cast<E>(value);\n    return is;\n}\n\ninline std::ostream&\noperator<<(std::ostream& os, const vis::Match& m) {\n    return os << m.id << \" \" << m.path;\n}\n\ninline std::istream&\noperator>>(std::istream& is, vis::Match& m) {\n    return is >> m.id >> m.path;\n}\n\ninline std::ostream&\noperator<<(std::ostream& os, const vis::Request& r) {\n    os << r.type << ' ' << r.category << ' '\n        << r.queryType << ' ' << r.numResults << ' ';\n    switch (r.type) {\n        case vis::RequestType::OFFLINE:\n            os << r.id;\n            break;\n        case vis::RequestType::REALTIME:\n            os << r.descriptors;\n            break;\n        case vis::RequestType::UPLOAD:\n            \/\/ TODO\n            break;\n    }\n    return os;\n}\n\ninline std::istream&\noperator>>(std::istream& is, vis::Request& r) {\n    is >> r.type >> r.category >> r.queryType >> r.numResults;\n    switch (r.type) {\n        case vis::RequestType::OFFLINE:\n            is >> r.id;\n            break;\n        case vis::RequestType::REALTIME:\n            is >> r.descriptors;\n            break;\n        case vis::RequestType::UPLOAD:\n            \/\/ TODO\n            break;\n    }\n    return is;\n}\n\ninline std::ostream&\noperator<<(std::ostream& os, const vis::Response& r) {\n    os << r.status << \" \" << r.results;\n    return os;\n}\n\ninline std::istream&\noperator>>(std::istream& is, vis::Response& r) {\n    is >> r.status >> r.results;\n    return is;\n}\n\ntemplate <typename Object>\nvoid\nput(boost::asio::streambuf& buf, const Object& obj) {\n    std::ostream os(&buf);\n    os << obj;\n}\n\ntemplate <typename Object>\nvoid\nget(boost::asio::streambuf& buf, Object& obj) {\n    std::istream is(&buf);\n    is >> obj;\n}\n\n} \/\/ namespace vis\n\n#endif \/\/ VIS_PROTOCOL_HPP\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: confignode.hxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: rt $ $Date: 2006-07-25 09:51: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#ifndef INCLUDED_UNOTOOLSDLLAPI_H\n#include \"unotools\/unotoolsdllapi.h\"\n#endif\n\n#ifndef _UNOTOOLS_CONFIGNODE_HXX_\n#define _UNOTOOLS_CONFIGNODE_HXX_\n\n#ifndef _COM_SUN_STAR_CONTAINER_XHIERARCHICALNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XHierarchicalNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMECONTAINER_HPP_\n#include <com\/sun\/star\/container\/XNameContainer.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_UTIL_XCHANGESBATCH_HPP_\n#include <com\/sun\/star\/util\/XChangesBatch.hpp>\n#endif\n#ifndef _UNOTOOLS_EVENTLISTENERADAPTER_HXX_\n#include <unotools\/eventlisteneradapter.hxx>\n#endif\n\n\/\/........................................................................\nnamespace utl\n{\n\/\/........................................................................\n\n    \/\/========================================================================\n    \/\/= OConfigurationNode\n    \/\/========================================================================\n    class OConfigurationTreeRoot;\n    \/** a small wrapper around a configuration node.<p\/>\n        Nodes in the terminology used herein are <em>inner<\/em> nodes of a configuration\n        tree, which means <em>no leafs<\/em>.\n    *\/\n    class UNOTOOLS_DLLPUBLIC OConfigurationNode : public ::utl::OEventListenerAdapter\n    {\n    private:\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XHierarchicalNameAccess >\n                    m_xHierarchyAccess;     \/\/\/ accessing children grandchildren (mandatory interface of our UNO object)\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >\n                    m_xDirectAccess;        \/\/\/ accessing children  (mandatory interface of our UNO object)\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameReplace >\n                    m_xReplaceAccess;       \/\/\/ replacing child values\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer >\n                    m_xContainerAccess;     \/\/\/ modifying set nodes  (optional interface of our UNO object)\n        ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >\n                    m_xProvider;            \/\/\/ the configuration provider which supplied the nodes of the hierarchy we're a part of\n        sal_Bool    m_bEscapeNames;         \/\/\/ escape names before accessing children ?\n\n        ::rtl::OUString\n                    m_sCompletePath;\n\n        OConfigurationNode  insertNode(const ::rtl::OUString& _rName,const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _xNode) const throw();\n    protected:\n        \/\/\/ constructs a node object with an interface representing a node\n        OConfigurationNode(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxNode,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxProvider);\n\n    public:\n        \/\/\/ constructs an empty and invalid node object\n        OConfigurationNode() :m_bEscapeNames(sal_False) { }\n        \/\/\/ copy ctor\n        OConfigurationNode(const OConfigurationNode& _rSource);\n\n        \/\/\/ assigment\n        const OConfigurationNode& operator=(const OConfigurationNode& _rSource);\n\n        \/\/\/ dtor\n        ~OConfigurationNode();\n\n        \/** open a sub node\n            @param      _rPath      access path of the to-be-opened sub node. May be a hierarchical path.\n        *\/\n        OConfigurationNode  openNode(const ::rtl::OUString& _rPath) const throw();\n\n        \/** create a new child node<p\/>\n            If the object represents a set node, this method may be used to create a new child. For non-set-nodes, the\n            method will fail.<br\/>\n            Unless the respective operations on the pure configuration API, the to-be-created node immediately\n            becomes a part of it's hierarchy, no explicit insertion is necessary.\n            @param      _rName      name for the new child. Must be level-1-depth.\n        *\/\n        OConfigurationNode  createNode(const ::rtl::OUString& _rName) const throw();\n        \/** appends a node under a new name <p\/>\n            If the object represents a set node, this method may be used to create a new child. For non-set-nodes, the\n            method will fail.<br\/>\n            Unless the respective operations on the pure configuration API, the to-be-created node immediately\n            becomes a part of it's hierarchy, no explicit insertion is necessary.\n            @param      _rName      name for the new child. Must be level-1-depth.\n            @param      _aNewNode   the node which should be appended\n        *\/\n        OConfigurationNode  appendNode(const ::rtl::OUString& _rName,const OConfigurationNode& _aNewNode) const throw();\n\n        \/** remove an existent child node<p\/>\n            If the object represents a set node, this method may be used to delete an existent child. For non-set-nodes,\n            the method will fail.\n        *\/\n        sal_Bool            removeNode(const ::rtl::OUString& _rName) const throw();\n\n        \/** retrieves the content of a descendant<p\/>\n            the returned value may contain anything from an interface (if <arg>_rPath<\/arg> refers to inner node of\n            the configuration tree) to any explicit value (e.g. string, integer) or even void.<br\/>\n            Unfortunately, this implies that if a void value is returned, you won't have a clue if this means\n            \"the path does not exist\" (besides the assertion made :), or if the value is really void.\n        *\/\n        ::com::sun::star::uno::Any\n                            getNodeValue(const ::rtl::OUString& _rPath) const throw();\n\n        \/** write a node value<p\/>\n            The value given is written into the node specified by the given relative path.<br\/>\n            In opposite to <method>getNodeValue<\/method>, _rName must refer to a leaf in the configuration tree, not an inner\n            node.\n            @return     sal_True if and only if the write was successfull.\n        *\/\n        sal_Bool            setNodeValue(const ::rtl::OUString& _rPath, const ::com::sun::star::uno::Any& _rValue) const throw();\n\n        \/\/\/ return the names of the existing children\n        ::com::sun::star::uno::Sequence< ::rtl::OUString >\n                            getNodeNames() const throw();\n\n        \/** enables or disables name escaping when accessing direct children<p\/>\n            Escaping is disabled by default, usually you enable it for set nodes (e.g. with calling setEscape(isSetNode)).\n            Once escaping is enabled, you should not access indirect children (e.g. openNode(\"child\/grandchild\"), 'cause\n            escaping for such names may not be supported by the underlying API objects.\n            @see getEscape\n        *\/\n        void        setEscape(sal_Bool _bEnable = sal_True);\n        \/** get the flag specifying the current escape behaviour\n            @see setEscape\n        *\/\n        sal_Bool    getEscape() const { return m_bEscapeNames; }\n\n        \/** clone the object, creating a new hierarchy where the root represents the same node as the object\n            where this method is called does.<p\/>\n            The new hierarchy does not share any updates with the one the object is a part of, i.e. any changes made\n            in the existing hierarchy are not visible to the newly created one until committed (and vice versa).\n            @param      _rRoot      out parameter. upon return, contains the object representing the root of the new hierarchy.\n        *\/\n        OConfigurationTreeRoot cloneAsRoot() const throw();\n\n        \/\/\/ invalidate the object\n        virtual void clear() throw();\n\n    \/\/ -----------------------\n    \/\/ meta informations about the node\n        \/\/\/ checks whether or not the object represents a set node.\n        sal_Bool isSetNode() const;\n        \/\/\/ checks whether or not a direct child with a given name exists\n        sal_Bool hasByName(const ::rtl::OUString& _rName) const throw();\n        \/\/\/ checks whether or not a descendent (no matter if direct or indirect) with the given name exists\n        sal_Bool hasByHierarchicalName( const ::rtl::OUString& _rName ) const throw();\n        \/\/\/ check if the objects represents a valid configuration node\n        sal_Bool isValid() const { return m_xHierarchyAccess.is(); }\n        \/\/\/ check whether the object is read-only of updatable\n        sal_Bool isReadonly() const { return !m_xReplaceAccess.is(); }\n\n    protected:\n        \/\/ OEventListenerAdapter\n        virtual void _disposing( const ::com::sun::star::lang::EventObject& _rSource );\n\n    protected:\n        enum NAMEORIGIN\n        {\n            NO_CONFIGURATION,       \/\/\/ the name came from a configuration node\n            NO_CALLER               \/\/\/ the name came from a client of this class\n        };\n        ::rtl::OUString normalizeName(const ::rtl::OUString& _rName, NAMEORIGIN _eOrigin) const;\n    };\n\n    \/\/========================================================================\n    \/\/= OConfigurationTreeRoot\n    \/\/========================================================================\n    \/** a specialized version of a OConfigurationNode, representing the root\n        of a configuration sub tree<p\/>\n        Only this class is able to commit any changes made any any OConfigurationNode\n        objects.\n    *\/\n    class UNOTOOLS_DLLPUBLIC OConfigurationTreeRoot : public OConfigurationNode\n    {\n        ::com::sun::star::uno::Reference< ::com::sun::star::util::XChangesBatch >\n                                m_xCommitter;\n    protected:\n        \/** ctor<p\/>\n        *\/\n        OConfigurationTreeRoot(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XChangesBatch >& _rxRootNode,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxProvider);\n\n        \/** ctor for a readonly node\n        *\/\n        OConfigurationTreeRoot(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxRootNode,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxProvider);\n\n    public:\n        \/\/\/ modes to used when creating a top-level node object\n        enum CREATION_MODE\n        {\n            CM_READONLY,            \/\/\/ open the node (i.e. sub tree) for read access only\n            CM_UPDATABLE,           \/\/\/ open the node (i.e. sub tree) for read and write access\n            CM_PREFER_UPDATABLE     \/\/\/ open the node (i.e. sub tree) for read and write access, if this fails, open it for read acces\n        };\n\n    public:\n        \/** default ctor<p\/>\n            The object constructed here is invalid (i.e. <method>isValid<\/method> will return sal_False).\n        *\/\n        OConfigurationTreeRoot() :OConfigurationNode() { }\n\n        \/\/\/ copy ctor\n        OConfigurationTreeRoot(const OConfigurationTreeRoot& _rSource)\n            :OConfigurationNode(_rSource), m_xCommitter(_rSource.m_xCommitter) { }\n\n        \/** open a new top-level configuration node<p\/>\n            opens a new node which is the root if an own configuration sub tree. This is what \"top level\" means: The\n            node does not have a parent. It does not mean that the node represents a module tree (like org.openoffice.Office.Writer\n            or such).<br\/>\n            In opposite to <method>createWithServiceFactory<\/method>, createWithProvider expects a configuration provider\n            to work with.\n            @see    createWithServiceFactory\n            @param      _rxConfProvider configuration provider to use when retrieving the node.\n            @param      _rPath          path to the node the object should represent\n            @param      _nDepth         depth for node retrieval\n            @param      _eMode          specifies which privileges should be applied when retrieving the node\n        *\/\n        static OConfigurationTreeRoot createWithProvider(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxConfProvider,\n            const ::rtl::OUString& _rPath, sal_Int32 _nDepth = -1, CREATION_MODE _eMode = CM_PREFER_UPDATABLE, sal_Bool _bLazyWrite = sal_True);\n\n        \/** open a new top-level configuration node<p\/>\n            opens a new node which is the root if an own configuration sub tree. This is what \"top level\" means: The\n            node does not have a parent. It does not mean that the node represents a module tree (like org.openoffice.Office.Writer\n            or such).<br\/>\n            In opposite to <method>createWithProvider<\/method>, createWithProvider expects a service factory. This factory\n            is used to create a configuration provider, and this provider is used to retrieve the node\n            @see    createWithProvider\n            @param      _rxORB          service factory to use to create the configuration provider.\n            @param      _rPath          path to the node the object should represent\n            @param      _nDepth         depth for node retrieval\n            @param      _eMode          specifies which privileges should be applied when retrieving the node\n        *\/\n        static OConfigurationTreeRoot createWithServiceFactory(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxORB,\n            const ::rtl::OUString& _rPath, sal_Int32 _nDepth = -1, CREATION_MODE _eMode = CM_PREFER_UPDATABLE, sal_Bool _bLazyWrite = sal_True);\n\n        \/** tolerant version of the <member>createWithServiceFactory<\/member>\n\n            <p>No assertions are thrown in case of an failure to initialize the configuration service, but once\n            the configuration could be initialized, errors in the creation of the specific node (e.g. because the\n            given node path does not exist) are still asserted.<\/p>\n        *\/\n        static OConfigurationTreeRoot tryCreateWithServiceFactory( const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxORB,\n            const ::rtl::OUString& _rPath, sal_Int32 _nDepth = -1, CREATION_MODE _eMode = CM_PREFER_UPDATABLE, sal_Bool _bLazyWrite = sal_True );\n\n        \/** commit all changes made on the subtree the object is the root for<p\/>\n            All changes made on any <type>OConfigurationNode<\/type> object retrieved (maybe indirect) from this root\n            object are committed when calling this method.\n            @return     sal_True if and only if the commit was successfull\n        *\/\n        sal_Bool commit() const throw();\n\n        \/\/\/ invalidate the object\n        virtual void clear() throw();\n    };\n\n\/\/........................................................................\n}   \/\/ namespace utl\n\/\/........................................................................\n\n#endif \/\/ _UNOTOOLS_CONFIGNODE_HXX_\n\n<commit_msg>INTEGRATION: CWS oihelp (1.7.18); FILE MERGED 2006\/11\/16 09:25:41 fs 1.7.18.1: moved include, so that the include protection really is the first line<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: confignode.hxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: kz $ $Date: 2006-12-13 11:42: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#ifndef _UNOTOOLS_CONFIGNODE_HXX_\n#define _UNOTOOLS_CONFIGNODE_HXX_\n\n#ifndef INCLUDED_UNOTOOLSDLLAPI_H\n#include \"unotools\/unotoolsdllapi.h\"\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XHIERARCHICALNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XHierarchicalNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMECONTAINER_HPP_\n#include <com\/sun\/star\/container\/XNameContainer.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_UTIL_XCHANGESBATCH_HPP_\n#include <com\/sun\/star\/util\/XChangesBatch.hpp>\n#endif\n#ifndef _UNOTOOLS_EVENTLISTENERADAPTER_HXX_\n#include <unotools\/eventlisteneradapter.hxx>\n#endif\n\n\/\/........................................................................\nnamespace utl\n{\n\/\/........................................................................\n\n    \/\/========================================================================\n    \/\/= OConfigurationNode\n    \/\/========================================================================\n    class OConfigurationTreeRoot;\n    \/** a small wrapper around a configuration node.<p\/>\n        Nodes in the terminology used herein are <em>inner<\/em> nodes of a configuration\n        tree, which means <em>no leafs<\/em>.\n    *\/\n    class UNOTOOLS_DLLPUBLIC OConfigurationNode : public ::utl::OEventListenerAdapter\n    {\n    private:\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XHierarchicalNameAccess >\n                    m_xHierarchyAccess;     \/\/\/ accessing children grandchildren (mandatory interface of our UNO object)\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >\n                    m_xDirectAccess;        \/\/\/ accessing children  (mandatory interface of our UNO object)\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameReplace >\n                    m_xReplaceAccess;       \/\/\/ replacing child values\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer >\n                    m_xContainerAccess;     \/\/\/ modifying set nodes  (optional interface of our UNO object)\n        ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >\n                    m_xProvider;            \/\/\/ the configuration provider which supplied the nodes of the hierarchy we're a part of\n        sal_Bool    m_bEscapeNames;         \/\/\/ escape names before accessing children ?\n\n        ::rtl::OUString\n                    m_sCompletePath;\n\n        OConfigurationNode  insertNode(const ::rtl::OUString& _rName,const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _xNode) const throw();\n    protected:\n        \/\/\/ constructs a node object with an interface representing a node\n        OConfigurationNode(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxNode,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxProvider);\n\n    public:\n        \/\/\/ constructs an empty and invalid node object\n        OConfigurationNode() :m_bEscapeNames(sal_False) { }\n        \/\/\/ copy ctor\n        OConfigurationNode(const OConfigurationNode& _rSource);\n\n        \/\/\/ assigment\n        const OConfigurationNode& operator=(const OConfigurationNode& _rSource);\n\n        \/\/\/ dtor\n        ~OConfigurationNode();\n\n        \/** open a sub node\n            @param      _rPath      access path of the to-be-opened sub node. May be a hierarchical path.\n        *\/\n        OConfigurationNode  openNode(const ::rtl::OUString& _rPath) const throw();\n\n        \/** create a new child node<p\/>\n            If the object represents a set node, this method may be used to create a new child. For non-set-nodes, the\n            method will fail.<br\/>\n            Unless the respective operations on the pure configuration API, the to-be-created node immediately\n            becomes a part of it's hierarchy, no explicit insertion is necessary.\n            @param      _rName      name for the new child. Must be level-1-depth.\n        *\/\n        OConfigurationNode  createNode(const ::rtl::OUString& _rName) const throw();\n        \/** appends a node under a new name <p\/>\n            If the object represents a set node, this method may be used to create a new child. For non-set-nodes, the\n            method will fail.<br\/>\n            Unless the respective operations on the pure configuration API, the to-be-created node immediately\n            becomes a part of it's hierarchy, no explicit insertion is necessary.\n            @param      _rName      name for the new child. Must be level-1-depth.\n            @param      _aNewNode   the node which should be appended\n        *\/\n        OConfigurationNode  appendNode(const ::rtl::OUString& _rName,const OConfigurationNode& _aNewNode) const throw();\n\n        \/** remove an existent child node<p\/>\n            If the object represents a set node, this method may be used to delete an existent child. For non-set-nodes,\n            the method will fail.\n        *\/\n        sal_Bool            removeNode(const ::rtl::OUString& _rName) const throw();\n\n        \/** retrieves the content of a descendant<p\/>\n            the returned value may contain anything from an interface (if <arg>_rPath<\/arg> refers to inner node of\n            the configuration tree) to any explicit value (e.g. string, integer) or even void.<br\/>\n            Unfortunately, this implies that if a void value is returned, you won't have a clue if this means\n            \"the path does not exist\" (besides the assertion made :), or if the value is really void.\n        *\/\n        ::com::sun::star::uno::Any\n                            getNodeValue(const ::rtl::OUString& _rPath) const throw();\n\n        \/** write a node value<p\/>\n            The value given is written into the node specified by the given relative path.<br\/>\n            In opposite to <method>getNodeValue<\/method>, _rName must refer to a leaf in the configuration tree, not an inner\n            node.\n            @return     sal_True if and only if the write was successfull.\n        *\/\n        sal_Bool            setNodeValue(const ::rtl::OUString& _rPath, const ::com::sun::star::uno::Any& _rValue) const throw();\n\n        \/\/\/ return the names of the existing children\n        ::com::sun::star::uno::Sequence< ::rtl::OUString >\n                            getNodeNames() const throw();\n\n        \/** enables or disables name escaping when accessing direct children<p\/>\n            Escaping is disabled by default, usually you enable it for set nodes (e.g. with calling setEscape(isSetNode)).\n            Once escaping is enabled, you should not access indirect children (e.g. openNode(\"child\/grandchild\"), 'cause\n            escaping for such names may not be supported by the underlying API objects.\n            @see getEscape\n        *\/\n        void        setEscape(sal_Bool _bEnable = sal_True);\n        \/** get the flag specifying the current escape behaviour\n            @see setEscape\n        *\/\n        sal_Bool    getEscape() const { return m_bEscapeNames; }\n\n        \/** clone the object, creating a new hierarchy where the root represents the same node as the object\n            where this method is called does.<p\/>\n            The new hierarchy does not share any updates with the one the object is a part of, i.e. any changes made\n            in the existing hierarchy are not visible to the newly created one until committed (and vice versa).\n            @param      _rRoot      out parameter. upon return, contains the object representing the root of the new hierarchy.\n        *\/\n        OConfigurationTreeRoot cloneAsRoot() const throw();\n\n        \/\/\/ invalidate the object\n        virtual void clear() throw();\n\n    \/\/ -----------------------\n    \/\/ meta informations about the node\n        \/\/\/ checks whether or not the object represents a set node.\n        sal_Bool isSetNode() const;\n        \/\/\/ checks whether or not a direct child with a given name exists\n        sal_Bool hasByName(const ::rtl::OUString& _rName) const throw();\n        \/\/\/ checks whether or not a descendent (no matter if direct or indirect) with the given name exists\n        sal_Bool hasByHierarchicalName( const ::rtl::OUString& _rName ) const throw();\n        \/\/\/ check if the objects represents a valid configuration node\n        sal_Bool isValid() const { return m_xHierarchyAccess.is(); }\n        \/\/\/ check whether the object is read-only of updatable\n        sal_Bool isReadonly() const { return !m_xReplaceAccess.is(); }\n\n    protected:\n        \/\/ OEventListenerAdapter\n        virtual void _disposing( const ::com::sun::star::lang::EventObject& _rSource );\n\n    protected:\n        enum NAMEORIGIN\n        {\n            NO_CONFIGURATION,       \/\/\/ the name came from a configuration node\n            NO_CALLER               \/\/\/ the name came from a client of this class\n        };\n        ::rtl::OUString normalizeName(const ::rtl::OUString& _rName, NAMEORIGIN _eOrigin) const;\n    };\n\n    \/\/========================================================================\n    \/\/= OConfigurationTreeRoot\n    \/\/========================================================================\n    \/** a specialized version of a OConfigurationNode, representing the root\n        of a configuration sub tree<p\/>\n        Only this class is able to commit any changes made any any OConfigurationNode\n        objects.\n    *\/\n    class UNOTOOLS_DLLPUBLIC OConfigurationTreeRoot : public OConfigurationNode\n    {\n        ::com::sun::star::uno::Reference< ::com::sun::star::util::XChangesBatch >\n                                m_xCommitter;\n    protected:\n        \/** ctor<p\/>\n        *\/\n        OConfigurationTreeRoot(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XChangesBatch >& _rxRootNode,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxProvider);\n\n        \/** ctor for a readonly node\n        *\/\n        OConfigurationTreeRoot(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxRootNode,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxProvider);\n\n    public:\n        \/\/\/ modes to used when creating a top-level node object\n        enum CREATION_MODE\n        {\n            CM_READONLY,            \/\/\/ open the node (i.e. sub tree) for read access only\n            CM_UPDATABLE,           \/\/\/ open the node (i.e. sub tree) for read and write access\n            CM_PREFER_UPDATABLE     \/\/\/ open the node (i.e. sub tree) for read and write access, if this fails, open it for read acces\n        };\n\n    public:\n        \/** default ctor<p\/>\n            The object constructed here is invalid (i.e. <method>isValid<\/method> will return sal_False).\n        *\/\n        OConfigurationTreeRoot() :OConfigurationNode() { }\n\n        \/\/\/ copy ctor\n        OConfigurationTreeRoot(const OConfigurationTreeRoot& _rSource)\n            :OConfigurationNode(_rSource), m_xCommitter(_rSource.m_xCommitter) { }\n\n        \/** open a new top-level configuration node<p\/>\n            opens a new node which is the root if an own configuration sub tree. This is what \"top level\" means: The\n            node does not have a parent. It does not mean that the node represents a module tree (like org.openoffice.Office.Writer\n            or such).<br\/>\n            In opposite to <method>createWithServiceFactory<\/method>, createWithProvider expects a configuration provider\n            to work with.\n            @see    createWithServiceFactory\n            @param      _rxConfProvider configuration provider to use when retrieving the node.\n            @param      _rPath          path to the node the object should represent\n            @param      _nDepth         depth for node retrieval\n            @param      _eMode          specifies which privileges should be applied when retrieving the node\n        *\/\n        static OConfigurationTreeRoot createWithProvider(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxConfProvider,\n            const ::rtl::OUString& _rPath, sal_Int32 _nDepth = -1, CREATION_MODE _eMode = CM_PREFER_UPDATABLE, sal_Bool _bLazyWrite = sal_True);\n\n        \/** open a new top-level configuration node<p\/>\n            opens a new node which is the root if an own configuration sub tree. This is what \"top level\" means: The\n            node does not have a parent. It does not mean that the node represents a module tree (like org.openoffice.Office.Writer\n            or such).<br\/>\n            In opposite to <method>createWithProvider<\/method>, createWithProvider expects a service factory. This factory\n            is used to create a configuration provider, and this provider is used to retrieve the node\n            @see    createWithProvider\n            @param      _rxORB          service factory to use to create the configuration provider.\n            @param      _rPath          path to the node the object should represent\n            @param      _nDepth         depth for node retrieval\n            @param      _eMode          specifies which privileges should be applied when retrieving the node\n        *\/\n        static OConfigurationTreeRoot createWithServiceFactory(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxORB,\n            const ::rtl::OUString& _rPath, sal_Int32 _nDepth = -1, CREATION_MODE _eMode = CM_PREFER_UPDATABLE, sal_Bool _bLazyWrite = sal_True);\n\n        \/** tolerant version of the <member>createWithServiceFactory<\/member>\n\n            <p>No assertions are thrown in case of an failure to initialize the configuration service, but once\n            the configuration could be initialized, errors in the creation of the specific node (e.g. because the\n            given node path does not exist) are still asserted.<\/p>\n        *\/\n        static OConfigurationTreeRoot tryCreateWithServiceFactory( const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxORB,\n            const ::rtl::OUString& _rPath, sal_Int32 _nDepth = -1, CREATION_MODE _eMode = CM_PREFER_UPDATABLE, sal_Bool _bLazyWrite = sal_True );\n\n        \/** commit all changes made on the subtree the object is the root for<p\/>\n            All changes made on any <type>OConfigurationNode<\/type> object retrieved (maybe indirect) from this root\n            object are committed when calling this method.\n            @return     sal_True if and only if the commit was successfull\n        *\/\n        sal_Bool commit() const throw();\n\n        \/\/\/ invalidate the object\n        virtual void clear() throw();\n    };\n\n\/\/........................................................................\n}   \/\/ namespace utl\n\/\/........................................................................\n\n#endif \/\/ _UNOTOOLS_CONFIGNODE_HXX_\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"config.h\"\n#include <phosphor-logging\/elog.hpp>\n\nnamespace phosphor\n{\nnamespace logging\n{\n\nvoid commit(std::string&& e)\n{\n    constexpr auto MAPPER_BUSNAME = \"xyz.openbmc_project.ObjectMapper\";\n    constexpr auto MAPPER_PATH = \"\/xyz\/openbmc_project\/ObjectMapper\";\n    constexpr auto MAPPER_INTERFACE = \"xyz.openbmc_project.ObjectMapper\";\n\n    constexpr auto IFACE_INTERNAL(\"xyz.openbmc_project.Logging.Internal.Manager\");\n\n    \/\/ Transaction id is located at the end of the string separated by a period.\n\n    auto b = sdbusplus::bus::new_default();\n    auto mapper = b.new_method_call(\n            MAPPER_BUSNAME,\n            MAPPER_PATH,\n            MAPPER_INTERFACE,\n            \"GetObject\");\n    mapper.append(OBJ_INTERNAL, std::vector<std::string>({IFACE_INTERNAL}));\n\n    auto mapperResponseMsg = b.call(mapper);\n    if (mapperResponseMsg.is_method_error())\n    {\n        log<level::ERR>(\"Error in mapper call\");\n        return;\n    }\n\n    std::map<std::string, std::vector<std::string>> mapperResponse;\n    mapperResponseMsg.read(mapperResponse);\n    if (mapperResponse.empty())\n    {\n        log<level::ERR>(\"Error reading mapper response\");\n        return;\n    }\n\n    const auto& host = mapperResponse.cbegin()->first;\n    auto m = b.new_method_call(\n            host.c_str(),\n            OBJ_INTERNAL,\n            IFACE_INTERNAL,\n            \"Commit\");\n    uint64_t id = sdbusplus::server::transaction::get_id();\n    m.append(id, std::forward<std::string>(e));\n    b.call_noreply(m);\n}\n\n} \/\/ namespace logging\n} \/\/ namespace phosphor\n\n<commit_msg>Move object_mapper per dbus path conventions.<commit_after>#include \"config.h\"\n#include <phosphor-logging\/elog.hpp>\n\nnamespace phosphor\n{\nnamespace logging\n{\n\nvoid commit(std::string&& e)\n{\n    constexpr auto MAPPER_BUSNAME = \"xyz.openbmc_project.ObjectMapper\";\n    constexpr auto MAPPER_PATH = \"\/xyz\/openbmc_project\/object_mapper\";\n    constexpr auto MAPPER_INTERFACE = \"xyz.openbmc_project.ObjectMapper\";\n\n    constexpr auto IFACE_INTERNAL(\"xyz.openbmc_project.Logging.Internal.Manager\");\n\n    \/\/ Transaction id is located at the end of the string separated by a period.\n\n    auto b = sdbusplus::bus::new_default();\n    auto mapper = b.new_method_call(\n            MAPPER_BUSNAME,\n            MAPPER_PATH,\n            MAPPER_INTERFACE,\n            \"GetObject\");\n    mapper.append(OBJ_INTERNAL, std::vector<std::string>({IFACE_INTERNAL}));\n\n    auto mapperResponseMsg = b.call(mapper);\n    if (mapperResponseMsg.is_method_error())\n    {\n        log<level::ERR>(\"Error in mapper call\");\n        return;\n    }\n\n    std::map<std::string, std::vector<std::string>> mapperResponse;\n    mapperResponseMsg.read(mapperResponse);\n    if (mapperResponse.empty())\n    {\n        log<level::ERR>(\"Error reading mapper response\");\n        return;\n    }\n\n    const auto& host = mapperResponse.cbegin()->first;\n    auto m = b.new_method_call(\n            host.c_str(),\n            OBJ_INTERNAL,\n            IFACE_INTERNAL,\n            \"Commit\");\n    uint64_t id = sdbusplus::server::transaction::get_id();\n    m.append(id, std::forward<std::string>(e));\n    b.call_noreply(m);\n}\n\n} \/\/ namespace logging\n} \/\/ namespace phosphor\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    main.cpp\n\n    This file is part of Kleopatra, the KDE keymanager\n    Copyright (c) 2001,2002,2004 Klar�vdalens 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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  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 <config-kleopatra.h>\n\n#include \"aboutdata.h\"\n#include \"kleopatraapplication.h\"\n#include \"mainwindow.h\"\n\n#include <commands\/reloadkeyscommand.h>\n#include <commands\/selftestcommand.h>\n\n#include <utils\/gnupg-helper.h>\n\n#ifdef HAVE_USABLE_ASSUAN\n# include <uiserver\/uiserver.h>\n# include <uiserver\/assuancommand.h>\n# include <uiserver\/echocommand.h>\n# include <uiserver\/decryptcommand.h>\n# include <uiserver\/verifycommand.h>\n# include <uiserver\/decryptverifyfilescommand.h>\n# include <uiserver\/decryptfilescommand.h>\n# include <uiserver\/verifyfilescommand.h>\n# include <uiserver\/prepencryptcommand.h>\n# include <uiserver\/encryptcommand.h>\n# include <uiserver\/signcommand.h>\n# include <uiserver\/signencryptfilescommand.h>\n# include <uiserver\/selectcertificatecommand.h>\n#else\nnamespace Kleo {\n    class UiServer;\n}\n#endif\n\n#include <kcmdlineargs.h>\n#include <klocale.h>\n#include <kiconloader.h>\n#include <ksplashscreen.h>\n#include <KDebug>\n\n#include <QTextDocument> \/\/ for Qt::escape\n#include <QStringList>\n#include <QMessageBox>\n#include <QTimer>\n#include <QEventLoop>\n#include <QThreadPool>\n\n#include <boost\/shared_ptr.hpp>\n\n#include <cassert>\n\nusing namespace boost;\n\nnamespace {\n    template <typename T>\n    boost::shared_ptr<T> make_shared_ptr( T * t ) {\n        return t ? boost::shared_ptr<T>( t ) : boost::shared_ptr<T>() ;\n    }\n}\n\nstatic bool selfCheck( KSplashScreen & splash ) {\n    splash.showMessage( i18n(\"Performing Self-Check...\") );\n    Kleo::Commands::SelfTestCommand cmd( 0 );\n    cmd.setAutoDelete( false );\n    cmd.setAutomaticMode( true );\n    cmd.setSplashScreen( &splash );\n    QEventLoop loop;\n    QObject::connect( &cmd, SIGNAL(finished()), &loop, SLOT(quit()) );\n    QObject::connect( &cmd, SIGNAL(info(QString)), &splash, SLOT(showMessage(QString)) );\n    QTimer::singleShot( 0, &cmd, SLOT(start()) ); \/\/ start() may emit finished()...\n    loop.exec();\n    if ( cmd.isCanceled() ) {\n        splash.showMessage( i18nc(\"didn't pass\", \"Self-Check Failed\") );\n        return false;\n    } else {\n        splash.showMessage( i18n(\"Self-Check Passed\") );\n        return true;\n    }\n}\n\nstatic void fillKeyCache( KSplashScreen * splash, Kleo::UiServer * server ) {\n\n  QEventLoop loop;\n  Kleo::ReloadKeysCommand * cmd = new Kleo::ReloadKeysCommand( 0 );\n  QObject::connect( cmd, SIGNAL(finished()), &loop, SLOT(quit()) );\n#ifdef HAVE_USABLE_ASSUAN\n  QObject::connect( cmd, SIGNAL(finished()), server, SLOT(enableCryptoCommands()) );\n#else\n  Q_UNUSED( server );\n#endif\n  splash->showMessage( i18n(\"Loading certificate cache...\") );\n  cmd->start();\n  loop.exec();\n  splash->showMessage( i18n(\"Certificate cache loaded.\") );\n}\n\nint main( int argc, char** argv )\n{\n  {\n      const unsigned int threads = QThreadPool::globalInstance()->maxThreadCount();\n      QThreadPool::globalInstance()->setMaxThreadCount( qMin( 2U, threads ) );\n  }\n\n  AboutData aboutData;\n\n  KCmdLineArgs::init(argc, argv, &aboutData);\n\n  KCmdLineArgs::addCmdLineOptions( KleopatraApplication::commandLineOptions() );\n\n  KleopatraApplication app;\n\n  KCmdLineArgs *args = KCmdLineArgs::parsedArgs();\n\n  KSplashScreen splash( UserIcon( \"kleopatra_splashscreen\" ), Qt::WindowStaysOnTopHint );\n\n  int rc;\n#ifdef HAVE_USABLE_ASSUAN\n  try {\n      Kleo::UiServer server( args->getOption(\"uiserver-socket\") );\n\n      QObject::connect( &server, SIGNAL(startKeyManagerRequested()),\n                        &app, SLOT(openOrRaiseMainWindow()) );\n\n#define REGISTER( Command ) server.registerCommandFactory( boost::shared_ptr<Kleo::AssuanCommandFactory>( new Kleo::GenericAssuanCommandFactory<Kleo::Command> ) )\n      REGISTER( DecryptCommand );\n      REGISTER( DecryptFilesCommand );\n      REGISTER( DecryptVerifyFilesCommand );\n      REGISTER( EchoCommand );\n      REGISTER( EncryptCommand );\n      REGISTER( EncryptFilesCommand );\n      REGISTER( EncryptSignFilesCommand );\n      REGISTER( PrepEncryptCommand );\n      REGISTER( SelectCertificateCommand );\n      REGISTER( SignCommand );\n      REGISTER( SignEncryptFilesCommand );\n      REGISTER( SignFilesCommand );\n      REGISTER( VerifyCommand );\n      REGISTER( VerifyFilesCommand );\n#undef REGISTER\n\n      server.start();\n#endif\n\n      const bool daemon = args->isSet(\"daemon\");\n\n      if ( !daemon )\n          splash.show();\n      if ( !selfCheck( splash ) )\n          return 1;\n#ifdef HAVE_USABLE_ASSUAN\n      fillKeyCache( &splash, &server );\n#else\n      fillKeyCache( &splash, 0 );\n#endif\n\n      app.setIgnoreNewInstance( false );\n\n      if ( !daemon ) {\n          app.newInstance();\n          splash.finish( app.mainWindow() );\n      }\n\n      rc = app.exec();\n\n#ifdef HAVE_USABLE_ASSUAN\n      app.setIgnoreNewInstance( true );\n      QObject::disconnect( &server, SIGNAL(startKeyManagerRequested()),\n                           &app, SLOT(openOrRaiseMainWindow()) );\n\n      server.stop();\n      server.waitForStopped();\n  } catch ( const std::exception & e ) {\n      QMessageBox::information( 0, i18n(\"GPG UI Server Error\"),\n                                i18n(\"<qt>The Kleopatra GPG UI Server Module couldn't be initialized.<br\/>\"\n                                     \"The error given was: <b>%1<\/b><br\/>\"\n                                     \"You can use Kleopatra as a certificate manager, but cryptographic plugins that \"\n                                     \"rely on a GPG UI Server being present might not work correctly, or at all.<\/qt>\",\n                                     Qt::escape( QString::fromUtf8( e.what() ) ) ));\n      app.setIgnoreNewInstance( false );\n      rc = app.exec();\n      app.setIgnoreNewInstance( true );\n  }\n#endif\n\n    return rc;\n}\n<commit_msg>argh<commit_after>\/*\n    main.cpp\n\n    This file is part of Kleopatra, the KDE keymanager\n    Copyright (c) 2001,2002,2004 Klar�vdalens 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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  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 <config-kleopatra.h>\n\n#include \"aboutdata.h\"\n#include \"kleopatraapplication.h\"\n#include \"mainwindow.h\"\n\n#include <commands\/reloadkeyscommand.h>\n#include <commands\/selftestcommand.h>\n\n#include <utils\/gnupg-helper.h>\n\n#ifdef HAVE_USABLE_ASSUAN\n# include <uiserver\/uiserver.h>\n# include <uiserver\/assuancommand.h>\n# include <uiserver\/echocommand.h>\n# include <uiserver\/decryptcommand.h>\n# include <uiserver\/verifycommand.h>\n# include <uiserver\/decryptverifyfilescommand.h>\n# include <uiserver\/decryptfilescommand.h>\n# include <uiserver\/verifyfilescommand.h>\n# include <uiserver\/prepencryptcommand.h>\n# include <uiserver\/encryptcommand.h>\n# include <uiserver\/signcommand.h>\n# include <uiserver\/signencryptfilescommand.h>\n# include <uiserver\/selectcertificatecommand.h>\n#else\nnamespace Kleo {\n    class UiServer;\n}\n#endif\n\n#include <kcmdlineargs.h>\n#include <klocale.h>\n#include <kiconloader.h>\n#include <ksplashscreen.h>\n#include <KDebug>\n\n#include <QTextDocument> \/\/ for Qt::escape\n#include <QStringList>\n#include <QMessageBox>\n#include <QTimer>\n#include <QEventLoop>\n#include <QThreadPool>\n\n#include <boost\/shared_ptr.hpp>\n\n#include <cassert>\n\nusing namespace boost;\n\nnamespace {\n    template <typename T>\n    boost::shared_ptr<T> make_shared_ptr( T * t ) {\n        return t ? boost::shared_ptr<T>( t ) : boost::shared_ptr<T>() ;\n    }\n}\n\nstatic bool selfCheck( KSplashScreen & splash ) {\n    splash.showMessage( i18n(\"Performing Self-Check...\") );\n    Kleo::Commands::SelfTestCommand cmd( 0 );\n    cmd.setAutoDelete( false );\n    cmd.setAutomaticMode( true );\n    cmd.setSplashScreen( &splash );\n    QEventLoop loop;\n    QObject::connect( &cmd, SIGNAL(finished()), &loop, SLOT(quit()) );\n    QObject::connect( &cmd, SIGNAL(info(QString)), &splash, SLOT(showMessage(QString)) );\n    QTimer::singleShot( 0, &cmd, SLOT(start()) ); \/\/ start() may emit finished()...\n    loop.exec();\n    if ( cmd.isCanceled() ) {\n        splash.showMessage( i18nc(\"didn't pass\", \"Self-Check Failed\") );\n        return false;\n    } else {\n        splash.showMessage( i18n(\"Self-Check Passed\") );\n        return true;\n    }\n}\n\nstatic void fillKeyCache( KSplashScreen * splash, Kleo::UiServer * server ) {\n\n  QEventLoop loop;\n  Kleo::ReloadKeysCommand * cmd = new Kleo::ReloadKeysCommand( 0 );\n  QObject::connect( cmd, SIGNAL(finished()), &loop, SLOT(quit()) );\n#ifdef HAVE_USABLE_ASSUAN\n  QObject::connect( cmd, SIGNAL(finished()), server, SLOT(enableCryptoCommands()) );\n#else\n  Q_UNUSED( server );\n#endif\n  splash->showMessage( i18n(\"Loading certificate cache...\") );\n  cmd->start();\n  loop.exec();\n  splash->showMessage( i18n(\"Certificate cache loaded.\") );\n}\n\nint main( int argc, char** argv )\n{\n  {\n      const unsigned int threads = QThreadPool::globalInstance()->maxThreadCount();\n      QThreadPool::globalInstance()->setMaxThreadCount( qMax( 2U, threads ) );\n  }\n\n  AboutData aboutData;\n\n  KCmdLineArgs::init(argc, argv, &aboutData);\n\n  KCmdLineArgs::addCmdLineOptions( KleopatraApplication::commandLineOptions() );\n\n  KleopatraApplication app;\n\n  KCmdLineArgs *args = KCmdLineArgs::parsedArgs();\n\n  KSplashScreen splash( UserIcon( \"kleopatra_splashscreen\" ), Qt::WindowStaysOnTopHint );\n\n  int rc;\n#ifdef HAVE_USABLE_ASSUAN\n  try {\n      Kleo::UiServer server( args->getOption(\"uiserver-socket\") );\n\n      QObject::connect( &server, SIGNAL(startKeyManagerRequested()),\n                        &app, SLOT(openOrRaiseMainWindow()) );\n\n#define REGISTER( Command ) server.registerCommandFactory( boost::shared_ptr<Kleo::AssuanCommandFactory>( new Kleo::GenericAssuanCommandFactory<Kleo::Command> ) )\n      REGISTER( DecryptCommand );\n      REGISTER( DecryptFilesCommand );\n      REGISTER( DecryptVerifyFilesCommand );\n      REGISTER( EchoCommand );\n      REGISTER( EncryptCommand );\n      REGISTER( EncryptFilesCommand );\n      REGISTER( EncryptSignFilesCommand );\n      REGISTER( PrepEncryptCommand );\n      REGISTER( SelectCertificateCommand );\n      REGISTER( SignCommand );\n      REGISTER( SignEncryptFilesCommand );\n      REGISTER( SignFilesCommand );\n      REGISTER( VerifyCommand );\n      REGISTER( VerifyFilesCommand );\n#undef REGISTER\n\n      server.start();\n#endif\n\n      const bool daemon = args->isSet(\"daemon\");\n\n      if ( !daemon )\n          splash.show();\n      if ( !selfCheck( splash ) )\n          return 1;\n#ifdef HAVE_USABLE_ASSUAN\n      fillKeyCache( &splash, &server );\n#else\n      fillKeyCache( &splash, 0 );\n#endif\n\n      app.setIgnoreNewInstance( false );\n\n      if ( !daemon ) {\n          app.newInstance();\n          splash.finish( app.mainWindow() );\n      }\n\n      rc = app.exec();\n\n#ifdef HAVE_USABLE_ASSUAN\n      app.setIgnoreNewInstance( true );\n      QObject::disconnect( &server, SIGNAL(startKeyManagerRequested()),\n                           &app, SLOT(openOrRaiseMainWindow()) );\n\n      server.stop();\n      server.waitForStopped();\n  } catch ( const std::exception & e ) {\n      QMessageBox::information( 0, i18n(\"GPG UI Server Error\"),\n                                i18n(\"<qt>The Kleopatra GPG UI Server Module couldn't be initialized.<br\/>\"\n                                     \"The error given was: <b>%1<\/b><br\/>\"\n                                     \"You can use Kleopatra as a certificate manager, but cryptographic plugins that \"\n                                     \"rely on a GPG UI Server being present might not work correctly, or at all.<\/qt>\",\n                                     Qt::escape( QString::fromUtf8( e.what() ) ) ));\n      app.setIgnoreNewInstance( false );\n      rc = app.exec();\n      app.setIgnoreNewInstance( true );\n  }\n#endif\n\n    return rc;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    main.cpp\n\n    This file is part of Kleopatra, the KDE keymanager\n    Copyright (c) 2001,2002,2004 Klar�vdalens 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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  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 <config-kleopatra.h>\n\n#include \"aboutdata.h\"\n#include \"certmanager.h\"\n\n#include \"libkleo\/kleo\/cryptobackendfactory.h\"\n\n#ifdef HAVE_USABLE_ASSUAN\n# include <uiserver\/uiserver.h>\n# include <uiserver\/assuancommand.h>\n#endif\n\n#include <kapplication.h>\n#include <kcmdlineargs.h>\n#include <kmessagebox.h>\n#include <klocale.h>\n#include <kglobal.h>\n#include <kiconloader.h>\n\nnamespace {\n    template <typename T>\n    boost::shared_ptr<T> make_shared_ptr( T * t ) {\n        return t ? boost::shared_ptr<T>( t ) : boost::shared_ptr<T>() ;\n    }\n}\n\nint main( int argc, char** argv )\n{\n  AboutData aboutData;\n\n  KCmdLineArgs::init(argc, argv, &aboutData);\n\n  KCmdLineOptions options;\n  options.add(\"external\", ki18n(\"Search for external certificates initially\"));\n  options.add(\"query \", ki18n(\"Initial query string\"));\n  options.add(\"import-certificate \", ki18n(\"Name of certificate file to import\"));\n  KCmdLineArgs::addCmdLineOptions( options );\n\n  KApplication app;\n\n  KCmdLineArgs *args = KCmdLineArgs::parsedArgs();\n\n  KGlobal::locale()->insertCatalog( \"libkleopatra\" );\n  KIconLoader::global()->addAppDir( \"libkleopatra\" );\n\n  if( !Kleo::CryptoBackendFactory::instance()->smime() ) {\n    KMessageBox::error(0,\n\t\t\ti18n( \"<qt>The crypto plugin could not be initialized.<br \/>\"\n\t\t\t      \"Certificate Manager will terminate now.<\/qt>\") );\n    return -2;\n  }\n\n  CertManager* manager = new CertManager( args->isSet(\"external\"),\n\t\t\t\t\t  args->getOption(\"query\"),\n\t\t\t\t\t  args->getOption(\"import-certificate\") );\n\n  args->clear();\n  manager->show();\n\n#ifdef HAVE_USABLE_ASSUAN\n  Kleo::UiServer server;\n  server.registerCommandFactory( make_shared_ptr( new Kleo::GenericAssuanCommandFactory<Kleo::VerifyEmailCommand> ) );\n  server.registerCommandFactory( make_shared_ptr( new Kleo::GenericAssuanCommandFactory<Kleo::DecryptEmailCommand> ) );\n\n  server.start();\n#endif\n\n  const int rc = app.exec();\n\n#ifdef HAVE_USABLE_ASSUAN\n  server.stop();\n  server.waitForStopped();\n#endif\n\n  return rc;\n}\n<commit_msg>Handle Ui Server initalisation problems gracefully.<commit_after>\/*\n    main.cpp\n\n    This file is part of Kleopatra, the KDE keymanager\n    Copyright (c) 2001,2002,2004 Klar�vdalens 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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  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 <config-kleopatra.h>\n\n#include \"aboutdata.h\"\n#include \"certmanager.h\"\n\n#include \"libkleo\/kleo\/cryptobackendfactory.h\"\n\n#ifdef HAVE_USABLE_ASSUAN\n# include <uiserver\/uiserver.h>\n# include <uiserver\/assuancommand.h>\n#endif\n\n#include <kapplication.h>\n#include <kcmdlineargs.h>\n#include <kmessagebox.h>\n#include <klocale.h>\n#include <kglobal.h>\n#include <kiconloader.h>\n\n#include <QTextDocument> \/\/ for Qt::escape\n\nnamespace {\n    template <typename T>\n    boost::shared_ptr<T> make_shared_ptr( T * t ) {\n        return t ? boost::shared_ptr<T>( t ) : boost::shared_ptr<T>() ;\n    }\n}\n\nint main( int argc, char** argv )\n{\n  AboutData aboutData;\n\n  KCmdLineArgs::init(argc, argv, &aboutData);\n\n  KCmdLineOptions options;\n  options.add(\"external\", ki18n(\"Search for external certificates initially\"));\n  options.add(\"query \", ki18n(\"Initial query string\"));\n  options.add(\"import-certificate \", ki18n(\"Name of certificate file to import\"));\n  KCmdLineArgs::addCmdLineOptions( options );\n\n  KApplication app;\n\n  KCmdLineArgs *args = KCmdLineArgs::parsedArgs();\n\n  KGlobal::locale()->insertCatalog( \"libkleopatra\" );\n  KIconLoader::global()->addAppDir( \"libkleopatra\" );\n\n  if( !Kleo::CryptoBackendFactory::instance()->smime() ) {\n    KMessageBox::error(0,\n\t\t\ti18n( \"<qt>The crypto plugin could not be initialized.<br \/>\"\n\t\t\t      \"Certificate Manager will terminate now.<\/qt>\") );\n    return -2;\n  }\n\n  CertManager* manager = new CertManager( args->isSet(\"external\"),\n\t\t\t\t\t  args->getOption(\"query\"),\n\t\t\t\t\t  args->getOption(\"import-certificate\") );\n\n  args->clear();\n  manager->show();\n\n  int rc;\n#ifdef HAVE_USABLE_ASSUAN\n  try {\n      Kleo::UiServer server;\n      server.registerCommandFactory( make_shared_ptr( new Kleo::GenericAssuanCommandFactory<Kleo::VerifyEmailCommand> ) );\n      server.registerCommandFactory( make_shared_ptr( new Kleo::GenericAssuanCommandFactory<Kleo::DecryptEmailCommand> ) );\n\n      server.start();\n#endif\n\n      rc = app.exec();\n\n#ifdef HAVE_USABLE_ASSUAN\n      server.stop();\n      server.waitForStopped();\n  } catch ( const std::exception & e ) {\n      QMessageBox::information( 0, i18n(\"GPG UI Server Error\"),\n                                i18n(\"<qt>The Kleopatra GPG UI Server Module couldn't be initialized.<br\/>\"\n                                     \"The error given was: <b>%1<\/b><br\/>\"\n                                     \"You can use Kleopatra as a certificate manager, but cryptographic plugins that \"\n                                     \"rely on a GPG UI Server being present might not work correctly, or at all.<\/qt>\",\n                                     Qt::escape( QString::fromUtf8( e.what() ) ) ));\n      rc = app.exec();\n  }\n#endif\n\n  return rc;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QtGui\/QGuiApplication>\n#include <QtQml>\n#include <QtQuick\/QQuickView>\n#include <QJsonDocument>\n#include <QJsonArray>\n#include <QSqlQuery>\n#include \"kernel.h\"\n#include \"errorobject.h\"\n#include \"resource.h\"\n#include \"ilwistype.h\"\n#include \"catalog.h\"\n#include \"mastercatalog.h\"\n#include \"catalogview.h\"\n#include \"ilwiscontext.h\"\n#include \"models\/catalogfiltermodel.h\"\n#include \"models\/mastercatalogmodel.h\"\n#include \"models\/operationmodel.h\"\n#include \"models\/operationcatalogmodel.h\"\n#include \"models\/usermessagehandler.h\"\n#include \"applicationformexpressionparser.h\"\n#include \"models\/tranquilizerhandler.h\"\n#include \"models\/visualizationmanager.h\"\n#include \"models\/objectvisualizationmodel.h\"\n#include \"models\/ilwisobjectmodel.h\"\n#include \"models\/attributemodel.h\"\n#include \"models\/domainitemmodel.h\"\n#include \"models\/operationsbykeymodel.h\"\n#include \"models\/uicontextmodel.h\"\n#include \"models\/visualizationmanager.h\"\n\n#define TEST_WORKINGDIR QString(\"file:\/\/\/d:\/projects\/ilwis\/Ilwis4\/testdata\")\n\nusing namespace Ilwis;\n\/\/using namespace Desktopclient;\n\nint main(int argc, char *argv[])\n{\n    try{\n        QGuiApplication app(argc, argv);\n\n        QQmlApplicationEngine engine;\n        QQmlContext *ctx = engine.rootContext();\n        Ilwis::initIlwis();\n\n        QFileInfo ilwisroot = context()->ilwisFolder();\n        QString qmlpluginpath = ilwisroot.absoluteFilePath() + \"\/extensions\/ui\";\n\n        engine.addImportPath(qmlpluginpath);\n        engine.addPluginPath(qmlpluginpath);\n\n        qmlRegisterType<MasterCatalogModel>(\"MasterCatalogModel\",1,0,\"MasterCatalogModel\");\n        qmlRegisterType<CatalogModel>(\"CatalogModel\",1,0,\"CatalogModel\");\n        qmlRegisterType<ResourceModel>(\"ResourceModel\",1,0,\"ResourceModel\");\n        qmlRegisterType<OperationCatalogModel>(\"OperationCatalogModel\",1,0,\"OperationCatalogModel\");\n        qmlRegisterType<OperationModel>(\"OperationModel\",1,0,\"OperationModel\");\n        qmlRegisterType<ApplicationFormExpressionParser>(\"ApplicationFormExpressionParser\",1,0,\"FormBuilder\");\n        qmlRegisterType<UserMessageHandler>(\"UserMessageHandler\",1,0,\"UserMessageHandler\");\n        qmlRegisterType<MessageModel>(\"MessageModel\",1,0,\"MessageModel\");\n        qmlRegisterType<TranquilizerHandler>(\"TranquilizerHandler\",1,0, \"TranquilizerHandler\");\n        qmlRegisterType<TranquilizerModel>(\"TranquilizerModel\",1,0, \"TranquilizerModel\");\n        qmlRegisterType<VisualizationManager>(\"VisualizationManager\",1,0,\"VisualizationManager\");\n        qmlRegisterType<ObjectVisualizationModel>(\"ObjectVisualizationModel\",1,0,\"ObjectVisualizationModel\");\n        qmlRegisterType<IlwisObjectModel>(\"IlwisObjectModel\",1,0,\"IlwisObjectModel\");\n        qmlRegisterType<AttributeModel>(\"AttributeModel\",1,0,\"AttributeModel\");\n        qmlRegisterType<DomainItemModel>(\"DomainItemModel\",1,0,\"DomainItemModel\");\n        qmlRegisterType<OperationsByKeyModel>(\"OperationsByKeyModel\",1,0,\"OperationsByKeyModel\");\n        qmlRegisterType<UIContextModel>(\"UIContextModel\", 1,0, \"UIContextModel\");\n        qmlRegisterType<PropertyEditorMetaData>(\"PropertyEditorMetaData\", 1,0, \"PropertyEditorMetaData\");\n\n\n        MasterCatalogModel mastercatalogmodel(ctx);\n\n        ApplicationFormExpressionParser formbuilder;\n        UserMessageHandler messageHandler;\n        OperationCatalogModel operations;\n        TranquilizerHandler tranquilizers;\n        UIContextModel uiContext;\n        uiContext.qmlContext(ctx);\n\n        \/\/uiContext.addPropertyEditor(itLINE,\"Style\",PropertyEditorMetaData(\"Style\", QUrl(\"http:\/\/someurl\/bla.qml\")));\n        uiContext.addPropertyEditor(itLINE,TR(\"Representation\"),PropertyEditorMetaData(TR(\"Representation\"), QUrl(\"RepresentationSetter.qml\")));\n\n        ctx->setContextProperty(\"mastercatalog\", &mastercatalogmodel);\n        ctx->setContextProperty(\"formbuilder\", &formbuilder);\n        ctx->setContextProperty(\"messagehandler\", &messageHandler);\n        ctx->setContextProperty(\"tranquilizerHandler\", &tranquilizers);\n        ctx->setContextProperty(\"operations\", &operations);\n        ctx->setContextProperty(\"uicontext\", &uiContext);\n\n\n        mastercatalogmodel.connect(&operations, &OperationCatalogModel::updateCatalog,&mastercatalogmodel, &MasterCatalogModel::updateCatalog );\n        messageHandler.connect(kernel()->issues().data(), &IssueLogger::updateIssues,&messageHandler, &UserMessageHandler::addMessage );\n        tranquilizers.connect(kernel(), &Kernel::updateTranquilizer, &tranquilizers, &TranquilizerHandler::updateTranquilizer,Qt::DirectConnection);\n        tranquilizers.connect(kernel(), &Kernel::createTranquilizer, &tranquilizers, &TranquilizerHandler::createTranquilizer,Qt::DirectConnection);\n        tranquilizers.connect(kernel(), &Kernel::removeTranquilizer, &tranquilizers, &TranquilizerHandler::removeTranquilizer);\n\n\n        engine.load(\"qml\/DesktopClient.qml\");\n\n        QObject *topLevel = engine.rootObjects().value(0);\n        QQuickWindow *window = qobject_cast<QQuickWindow *>(topLevel);\n        if ( !window ) {\n            qWarning(\"Error: Your root item has to be a Window.\");\n            return -1;\n        }\n        mastercatalogmodel.root(window);\n        window->show();\n        return app.exec();\n    }catch (const ErrorObject& err){\n        qDebug() << err.message();\n    }\n\n    return 0;\n\n\n}\n<commit_msg>added new types<commit_after>#include <QtGui\/QGuiApplication>\n#include <QtQml>\n#include <QtQuick\/QQuickView>\n#include <QJsonDocument>\n#include <QJsonArray>\n#include <QSqlQuery>\n#include \"kernel.h\"\n#include \"errorobject.h\"\n#include \"resource.h\"\n#include \"ilwistype.h\"\n#include \"catalog.h\"\n#include \"mastercatalog.h\"\n#include \"catalogview.h\"\n#include \"ilwiscontext.h\"\n#include \"models\/catalogfiltermodel.h\"\n#include \"models\/mastercatalogmodel.h\"\n#include \"models\/operationmodel.h\"\n#include \"models\/operationcatalogmodel.h\"\n#include \"models\/usermessagehandler.h\"\n#include \"applicationformexpressionparser.h\"\n#include \"models\/tranquilizerhandler.h\"\n#include \"models\/visualizationmanager.h\"\n#include \"models\/objectvisualizationmodel.h\"\n#include \"models\/ilwisobjectmodel.h\"\n#include \"models\/attributemodel.h\"\n#include \"models\/domainitemmodel.h\"\n#include \"models\/operationsbykeymodel.h\"\n#include \"models\/uicontextmodel.h\"\n#include \"models\/visualizationmanager.h\"\n\/\/#include \"ilwiscoreui\/propertyeditors\/representationsetter.h\"\n#include \"ilwiscoreui\/propertyeditors\/representationsetter.h\"\n\n#define TEST_WORKINGDIR QString(\"file:\/\/\/d:\/projects\/ilwis\/Ilwis4\/testdata\")\n\nusing namespace Ilwis;\n\/\/using namespace Desktopclient;\n\nint main(int argc, char *argv[])\n{\n    try{\n        QGuiApplication app(argc, argv);\n\n        QQmlApplicationEngine engine;\n        QQmlContext *ctx = engine.rootContext();\n        Ilwis::initIlwis();\n\n        QFileInfo ilwisroot = context()->ilwisFolder();\n        QString qmlpluginpath = ilwisroot.absoluteFilePath() + \"\/extensions\/ui\";\n\n        engine.addImportPath(qmlpluginpath);\n        engine.addPluginPath(qmlpluginpath);\n\n        qmlRegisterType<MasterCatalogModel>(\"MasterCatalogModel\",1,0,\"MasterCatalogModel\");\n        qmlRegisterType<CatalogModel>(\"CatalogModel\",1,0,\"CatalogModel\");\n        qmlRegisterType<ResourceModel>(\"ResourceModel\",1,0,\"ResourceModel\");\n        qmlRegisterType<OperationCatalogModel>(\"OperationCatalogModel\",1,0,\"OperationCatalogModel\");\n        qmlRegisterType<OperationModel>(\"OperationModel\",1,0,\"OperationModel\");\n        qmlRegisterType<ApplicationFormExpressionParser>(\"ApplicationFormExpressionParser\",1,0,\"FormBuilder\");\n        qmlRegisterType<UserMessageHandler>(\"UserMessageHandler\",1,0,\"UserMessageHandler\");\n        qmlRegisterType<MessageModel>(\"MessageModel\",1,0,\"MessageModel\");\n        qmlRegisterType<TranquilizerHandler>(\"TranquilizerHandler\",1,0, \"TranquilizerHandler\");\n        qmlRegisterType<TranquilizerModel>(\"TranquilizerModel\",1,0, \"TranquilizerModel\");\n        qmlRegisterType<VisualizationManager>(\"VisualizationManager\",1,0,\"VisualizationManager\");\n        qmlRegisterType<ObjectVisualizationModel>(\"ObjectVisualizationModel\",1,0,\"ObjectVisualizationModel\");\n        qmlRegisterType<IlwisObjectModel>(\"IlwisObjectModel\",1,0,\"IlwisObjectModel\");\n        qmlRegisterType<AttributeModel>(\"AttributeModel\",1,0,\"AttributeModel\");\n        qmlRegisterType<DomainItemModel>(\"DomainItemModel\",1,0,\"DomainItemModel\");\n        qmlRegisterType<OperationsByKeyModel>(\"OperationsByKeyModel\",1,0,\"OperationsByKeyModel\");\n        qmlRegisterType<UIContextModel>(\"UIContextModel\", 1,0, \"UIContextModel\");\n        qmlRegisterType<PropertyEditorMetaData>(\"PropertyEditorMetaData\", 1,0, \"PropertyEditorMetaData\");\n\n       \/\/ qmlRegisterType<PropertyEditor>(\"PropertyEditor\", 1,0, \"PropertyEditor\");\n        qmlRegisterType<RepresentationSetter>(\"RepresentationSetter\", 1,0, \"RepresentationSetter\");\n\n\n        MasterCatalogModel mastercatalogmodel(ctx);\n\n        ApplicationFormExpressionParser formbuilder;\n        UserMessageHandler messageHandler;\n        OperationCatalogModel operations;\n        TranquilizerHandler tranquilizers;\n        UIContextModel uiContext;\n        uiContext.qmlContext(ctx);\n\n        \/\/uiContext.addPropertyEditor(itLINE,\"Style\",PropertyEditorMetaData(\"Style\", QUrl(\"http:\/\/someurl\/bla.qml\")));\n        uiContext.addPropertyEditor(itLINE,TR(\"Representation\"),PropertyEditorMetaData(TR(\"Representation\"), QUrl(\"RepresentationProperties.qml\")));\n\n        ctx->setContextProperty(\"mastercatalog\", &mastercatalogmodel);\n        ctx->setContextProperty(\"formbuilder\", &formbuilder);\n        ctx->setContextProperty(\"messagehandler\", &messageHandler);\n        ctx->setContextProperty(\"tranquilizerHandler\", &tranquilizers);\n        ctx->setContextProperty(\"operations\", &operations);\n        ctx->setContextProperty(\"uicontext\", &uiContext);\n\n\n        mastercatalogmodel.connect(&operations, &OperationCatalogModel::updateCatalog,&mastercatalogmodel, &MasterCatalogModel::updateCatalog );\n        messageHandler.connect(kernel()->issues().data(), &IssueLogger::updateIssues,&messageHandler, &UserMessageHandler::addMessage );\n        tranquilizers.connect(kernel(), &Kernel::updateTranquilizer, &tranquilizers, &TranquilizerHandler::updateTranquilizer,Qt::DirectConnection);\n        tranquilizers.connect(kernel(), &Kernel::createTranquilizer, &tranquilizers, &TranquilizerHandler::createTranquilizer,Qt::DirectConnection);\n        tranquilizers.connect(kernel(), &Kernel::removeTranquilizer, &tranquilizers, &TranquilizerHandler::removeTranquilizer);\n\n\n        engine.load(\"qml\/DesktopClient.qml\");\n\n        QObject *topLevel = engine.rootObjects().value(0);\n        QQuickWindow *window = qobject_cast<QQuickWindow *>(topLevel);\n        if ( !window ) {\n            qWarning(\"Error: Your root item has to be a Window.\");\n            return -1;\n        }\n        mastercatalogmodel.root(window);\n        window->show();\n        return app.exec();\n    }catch (const ErrorObject& err){\n        qDebug() << err.message();\n    }\n\n    return 0;\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <ostream>\n#include <string>\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/variant.hpp>\n\n#include \"blackhole\/detail\/stream\/stream.hpp\"\n#include \"blackhole\/formatter\/map\/value.hpp\"\n#include \"blackhole\/formatter\/string\/parser.hpp\"\n#include \"blackhole\/record.hpp\"\n\nnamespace blackhole {\n\nnamespace formatter {\n\nnamespace string {\n\nclass variadic_visitor_t : public boost::static_visitor<> {\n    std::ostringstream& stream;\n\npublic:\n    variadic_visitor_t(std::ostringstream& stream) :\n        stream(stream)\n    {}\n\n    template<typename T>\n    void operator()(const T& value) const {\n        stream << value;\n    }\n\n    void operator()(const std::string& value) const {\n        stream << \"'\" << value << \"'\";\n    }\n};\n\nclass visitor_t : public boost::static_visitor<> {\n    stickystream_t& stream;\n    const mapping::value_t& mapper;\n    const attribute::set_view_t& view;\n\npublic:\n    visitor_t(stickystream_t& stream,\n              const mapping::value_t& mapper,\n              const attribute::set_view_t& view) :\n        stream(stream),\n        mapper(mapper),\n        view(view)\n    {}\n\n    void operator()(const literal_t& literal) {\n        stream.rdbuf()->storage()->append(literal.value);\n    }\n\n    void operator()(const placeholder::required_t& ph) {\n        if (auto attribute = view.find(ph.name)) {\n            mapper(stream, ph.name, attribute->value);\n            return;\n        }\n\n        throw error_t(\"required attribute '%s' was not provided\", ph.name);\n    }\n\n    void operator()(const placeholder::optional_t& ph) {\n        if (auto attribute = view.find(ph.name)) {\n            stream.rdbuf()->storage()->append(ph.prefix);\n            mapper(stream, ph.name, attribute->value);\n            stream.rdbuf()->storage()->append(ph.suffix);\n        }\n    }\n\n    \/\/!@todo: Test separator\/pattern.\n    void operator()(const placeholder::variadic_t& ph) {\n        std::vector<std::string> passed;\n        passed.reserve(view.upper_size());\n\n        \/\/!@todo: Call begin() & end() with parameter.\n        for (auto it = view.begin(); it != view.end(); ++it) {\n            const std::string& name = it->first;\n            const attribute_t& attribute = it->second;\n\n            \/\/!@todo: This code needs some optimization love.\n            std::ostringstream stream;\n            stream << \"'\" << name << \"': \";\n            variadic_visitor_t visitor(stream);\n            boost::apply_visitor(visitor, attribute.value);\n            passed.push_back(stream.str());\n        }\n\n        if (!passed.empty()) {\n            stream.rdbuf()->storage()->append(ph.prefix);\n            stream.rdbuf()->storage()->append(\n                boost::algorithm::join(passed, ph.separator)\n            );\n            stream.rdbuf()->storage()->append(ph.suffix);\n        }\n    }\n};\n\n} \/\/ namespace string\n\n} \/\/ namespace formatter\n\n} \/\/ namespace blackhole\n<commit_msg>[Tasks] Priority.<commit_after>#pragma once\n\n#include <ostream>\n#include <string>\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/variant.hpp>\n\n#include \"blackhole\/detail\/stream\/stream.hpp\"\n#include \"blackhole\/formatter\/map\/value.hpp\"\n#include \"blackhole\/formatter\/string\/parser.hpp\"\n#include \"blackhole\/record.hpp\"\n\nnamespace blackhole {\n\nnamespace formatter {\n\nnamespace string {\n\nclass variadic_visitor_t : public boost::static_visitor<> {\n    std::ostringstream& stream;\n\npublic:\n    variadic_visitor_t(std::ostringstream& stream) :\n        stream(stream)\n    {}\n\n    template<typename T>\n    void operator()(const T& value) const {\n        stream << value;\n    }\n\n    void operator()(const std::string& value) const {\n        stream << \"'\" << value << \"'\";\n    }\n};\n\nclass visitor_t : public boost::static_visitor<> {\n    stickystream_t& stream;\n    const mapping::value_t& mapper;\n    const attribute::set_view_t& view;\n\npublic:\n    visitor_t(stickystream_t& stream,\n              const mapping::value_t& mapper,\n              const attribute::set_view_t& view) :\n        stream(stream),\n        mapper(mapper),\n        view(view)\n    {}\n\n    void operator()(const literal_t& literal) {\n        stream.rdbuf()->storage()->append(literal.value);\n    }\n\n    void operator()(const placeholder::required_t& ph) {\n        if (auto attribute = view.find(ph.name)) {\n            mapper(stream, ph.name, attribute->value);\n            return;\n        }\n\n        throw error_t(\"required attribute '%s' was not provided\", ph.name);\n    }\n\n    void operator()(const placeholder::optional_t& ph) {\n        if (auto attribute = view.find(ph.name)) {\n            stream.rdbuf()->storage()->append(ph.prefix);\n            mapper(stream, ph.name, attribute->value);\n            stream.rdbuf()->storage()->append(ph.suffix);\n        }\n    }\n\n    \/\/!@todo: 1. Test pattern.\n    void operator()(const placeholder::variadic_t& ph) {\n        std::vector<std::string> passed;\n        passed.reserve(view.upper_size());\n\n        \/\/!@todo: 3. Call begin() & end() with parameter.\n        for (auto it = view.begin(); it != view.end(); ++it) {\n            const std::string& name = it->first;\n            const attribute_t& attribute = it->second;\n\n            \/\/!@todo: 2. This code needs some optimization love.\n            std::ostringstream stream;\n            stream << \"'\" << name << \"': \";\n            variadic_visitor_t visitor(stream);\n            boost::apply_visitor(visitor, attribute.value);\n            passed.push_back(stream.str());\n        }\n\n        if (!passed.empty()) {\n            stream.rdbuf()->storage()->append(ph.prefix);\n            stream.rdbuf()->storage()->append(\n                boost::algorithm::join(passed, ph.separator)\n            );\n            stream.rdbuf()->storage()->append(ph.suffix);\n        }\n    }\n};\n\n} \/\/ namespace string\n\n} \/\/ namespace formatter\n\n} \/\/ namespace blackhole\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * Generalized Window Function Wrapper for Jamoma DSP\n * Copyright © 2010 by Timothy Place\n * \n * License: This code is licensed under the terms of the \"New BSD License\"\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"WindowFunction.h\"\n\n#define thisTTClass\t\t\tWindowFunction\n#define thisTTClassName\t\t\"WindowFunction\"\n#define thisTTClassTags\t\t\"audio, processor\"\n\n\nTT_AUDIO_CONSTRUCTOR,\n\tmFunctionObject(NULL),\n\tmNumPoints(8192),\n\tmPadding(0)\n{\n\taddAttributeWithSetter(Function,\tkTypeSymbol);\n\taddAttributeWithSetter(NumPoints,\tkTypeUInt32);\n\taddAttributeWithSetter(Mode,\t\tkTypeSymbol);\n\taddAttributeWithSetter(Padding,\t\tkTypeUInt32);\n\t\n\taddMessageWithArgument(getFunctions);\n\taddMessageWithArgument(setParameter);\n\t\n\tsetAttributeValue(TT(\"function\"), TT(\"rectangular\"));\n\tsetAttributeValue(TT(\"mode\"), TT(\"lookup\"));\n}\n\n\nWindowFunction::~WindowFunction()\n{\n\tdelete mFunctionObject;\n}\n\n\nTTErr WindowFunction::setFunction(const TTValue& function)\n{\n\tTTErr err;\n\t\n\tmFunction = function;\n\terr = TTObjectInstantiate(mFunction, &mFunctionObject, maxNumChannels);\n\tif (!err)\n\t\terr = fill();\n\treturn err;\n}\n\n\nTTErr WindowFunction::setParameter(TTValue& aParameterValueForTheFunction)\n{\n\tTTErr err;\n\t\n\tif (aParameterValueForTheFunction.getSize() < 2)\n\t\terr = kTTErrWrongNumValues;\n\telse {\n\t\tTTSymbolPtr parameterName = aParameterValueForTheFunction;\n\t\tTTValue\t\tv;\n\t\t\n\t\tv.copyFrom(aParameterValueForTheFunction, 1);\n\t\terr = mFunctionObject->setAttributeValue(parameterName, v);\n\t}\n\taParameterValueForTheFunction.clear();\n\treturn err;\n}\n\n\nTTErr WindowFunction::fill()\n{\n\tmLookupTable.assign(mNumPoints, 0.0);\n\tif (mFunctionObject) {\n\t\tTTInt32 numPoints = mNumPoints-(mPadding*2);\n\t\t\n\t\tTTLimitMin<TTInt32>(numPoints, 0);\n\t\tfor (TTInt32 i=0; i<numPoints; i++)\n\t\t\tmFunctionObject->calculate(i\/TTFloat64(numPoints-1), mLookupTable[i+mPadding]);\n\t}\n\telse\n\t\tmLookupTable.assign(mNumPoints, 0.0);\n\n\treturn kTTErrNone;\n}\n\n\nTTErr WindowFunction::setNumPoints(const TTValue& numPoints)\n{\n\treturn doSetNumPoints(numPoints);\n}\n\n\nTTErr WindowFunction::doSetNumPoints(const TTUInt32 numPoints)\n{\n\tmNumPoints = numPoints;\n\tmLookupTable.resize(mNumPoints);\n\treturn fill();\n}\n\n\nTTErr WindowFunction::setPadding(const TTValue& padding)\n{\n\tmPadding = padding;\n\treturn fill();\n}\n\n\nTTErr WindowFunction::setMode(const TTValue& mode)\n{\n\tmMode = mode;\n\tif (mMode == TT(\"apply\")) {\n\t\tsetProcessMethod(processApply);\n\t\tsetCalculateMethod(lookupValue);\n\t}\n\telse if (mMode == TT(\"generate\")) {\n\t\tsetProcessMethod(processGenerate);\n\t\tsetCalculateMethod(calculateValue);\n\t}\n\telse {\n\t\tsetProcessMethod(processLookup);\n\t\tsetCalculateMethod(lookupValue);\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr WindowFunction::getFunctions(TTValue& listOfWindowTypesToReturn)\n{\n\treturn TTGetRegisteredClassNamesForTags(listOfWindowTypesToReturn, TT(\"window\"));\n}\n\n\n#if 0\n#pragma mark -\n#pragma mark Process Routines\n#endif\n\n\ninline TTErr WindowFunction::calculateValue(const TTFloat64& x, TTFloat64& y, TTPtrSizedInt data)\n{\n\treturn mFunctionObject->calculate(x, y);\n}\n\n\ninline TTErr WindowFunction::lookupValue(const TTFloat64& x, TTFloat64& y, TTPtrSizedInt data)\n{\n\ty = mLookupTable[TTClip(x, 0.0, 1.0) * mNumPoints];\n\treturn kTTErrNone;\n}\n\n\nTTErr WindowFunction::processGenerate(TTAudioSignalArrayPtr inputs, TTAudioSignalArrayPtr outputs)\n{\n\treturn mFunctionObject->process(inputs, outputs);\n}\n\n\nTTErr WindowFunction::processLookup(TTAudioSignalArrayPtr inputs, TTAudioSignalArrayPtr outputs)\n{\n\tTT_WRAP_CALCULATE_METHOD(lookupValue)\n}\n\n\nTTErr WindowFunction::processApply(TTAudioSignalArrayPtr inputs, TTAudioSignalArrayPtr outputs)\n{\n\tTTAudioSignal&\t\tin = inputs->getSignal(0);\n\tTTAudioSignal&\t\tout = outputs->getSignal(0);\n\tTTUInt16\t\t\tvs = in.getVectorSizeAsInt();\n\tTTSampleValuePtr\tinSample;\n\tTTSampleValuePtr\toutSample;\n\tTTUInt16\t\t\tnumChannels = TTAudioSignal::getMinChannelCount(in, out);\n\tTTUInt16\t\t\tchannel;\n\t\n\t\/\/ In 'apply' mode we automatically update the lookup table size to the vector size\n\t\/\/ This is slow, but hopefully only happens once (if ever)\n\tif (vs != mNumPoints)\n\t\tdoSetNumPoints(vs);\n\t\n\tfor (channel=0; channel<numChannels; channel++) {\n\t\tinSample = in.mSampleVectors[channel];\n\t\toutSample = out.mSampleVectors[channel];\n\t\t\n\t\tfor (TTUInt32 i=0; i<vs; i++)\n\t\t\t*outSample++ = (*inSample++) * mLookupTable[i];\n\t}\n\treturn kTTErrNone;\n}\n\n<commit_msg>WindowFunction: fix for parameter changes not updating the lookup table.<commit_after>\/* \n * Generalized Window Function Wrapper for Jamoma DSP\n * Copyright © 2010 by Timothy Place\n * \n * License: This code is licensed under the terms of the \"New BSD License\"\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"WindowFunction.h\"\n\n#define thisTTClass\t\t\tWindowFunction\n#define thisTTClassName\t\t\"WindowFunction\"\n#define thisTTClassTags\t\t\"audio, processor\"\n\n\nTT_AUDIO_CONSTRUCTOR,\n\tmFunctionObject(NULL),\n\tmNumPoints(8192),\n\tmPadding(0)\n{\n\taddAttributeWithSetter(Function,\tkTypeSymbol);\n\taddAttributeWithSetter(NumPoints,\tkTypeUInt32);\n\taddAttributeWithSetter(Mode,\t\tkTypeSymbol);\n\taddAttributeWithSetter(Padding,\t\tkTypeUInt32);\n\t\n\taddMessageWithArgument(getFunctions);\n\taddMessageWithArgument(setParameter);\n\t\n\tsetAttributeValue(TT(\"function\"), TT(\"rectangular\"));\n\tsetAttributeValue(TT(\"mode\"), TT(\"lookup\"));\n}\n\n\nWindowFunction::~WindowFunction()\n{\n\tdelete mFunctionObject;\n}\n\n\nTTErr WindowFunction::setFunction(const TTValue& function)\n{\n\tTTErr err;\n\t\n\tmFunction = function;\n\terr = TTObjectInstantiate(mFunction, &mFunctionObject, maxNumChannels);\n\tif (!err)\n\t\terr = fill();\n\treturn err;\n}\n\n\nTTErr WindowFunction::setParameter(TTValue& aParameterValueForTheFunction)\n{\n\tTTErr err;\n\t\n\tif (aParameterValueForTheFunction.getSize() < 2)\n\t\terr = kTTErrWrongNumValues;\n\telse {\n\t\tTTSymbolPtr parameterName = aParameterValueForTheFunction;\n\t\tTTValue\t\tv;\n\t\t\n\t\tv.copyFrom(aParameterValueForTheFunction, 1);\n\t\terr = mFunctionObject->setAttributeValue(parameterName, v);\n\t\tif (!err)\n\t\t\tfill();\n\t}\n\taParameterValueForTheFunction.clear();\n\treturn err;\n}\n\n\nTTErr WindowFunction::fill()\n{\n\tmLookupTable.assign(mNumPoints, 0.0);\n\tif (mFunctionObject) {\n\t\tTTInt32 numPoints = mNumPoints-(mPadding*2);\n\t\t\n\t\tTTLimitMin<TTInt32>(numPoints, 0);\n\t\tfor (TTInt32 i=0; i<numPoints; i++)\n\t\t\tmFunctionObject->calculate(i\/TTFloat64(numPoints-1), mLookupTable[i+mPadding]);\n\t}\n\telse\n\t\tmLookupTable.assign(mNumPoints, 0.0);\n\n\treturn kTTErrNone;\n}\n\n\nTTErr WindowFunction::setNumPoints(const TTValue& numPoints)\n{\n\treturn doSetNumPoints(numPoints);\n}\n\n\nTTErr WindowFunction::doSetNumPoints(const TTUInt32 numPoints)\n{\n\tmNumPoints = numPoints;\n\tmLookupTable.resize(mNumPoints);\n\treturn fill();\n}\n\n\nTTErr WindowFunction::setPadding(const TTValue& padding)\n{\n\tmPadding = padding;\n\treturn fill();\n}\n\n\nTTErr WindowFunction::setMode(const TTValue& mode)\n{\n\tmMode = mode;\n\tif (mMode == TT(\"apply\")) {\n\t\tsetProcessMethod(processApply);\n\t\tsetCalculateMethod(lookupValue);\n\t}\n\telse if (mMode == TT(\"generate\")) {\n\t\tsetProcessMethod(processGenerate);\n\t\tsetCalculateMethod(calculateValue);\n\t}\n\telse {\n\t\tsetProcessMethod(processLookup);\n\t\tsetCalculateMethod(lookupValue);\n\t}\n\treturn kTTErrNone;\n}\n\n\nTTErr WindowFunction::getFunctions(TTValue& listOfWindowTypesToReturn)\n{\n\treturn TTGetRegisteredClassNamesForTags(listOfWindowTypesToReturn, TT(\"window\"));\n}\n\n\n#if 0\n#pragma mark -\n#pragma mark Process Routines\n#endif\n\n\ninline TTErr WindowFunction::calculateValue(const TTFloat64& x, TTFloat64& y, TTPtrSizedInt data)\n{\n\treturn mFunctionObject->calculate(x, y);\n}\n\n\ninline TTErr WindowFunction::lookupValue(const TTFloat64& x, TTFloat64& y, TTPtrSizedInt data)\n{\n\ty = mLookupTable[TTClip(x, 0.0, 1.0) * mNumPoints];\n\treturn kTTErrNone;\n}\n\n\nTTErr WindowFunction::processGenerate(TTAudioSignalArrayPtr inputs, TTAudioSignalArrayPtr outputs)\n{\n\treturn mFunctionObject->process(inputs, outputs);\n}\n\n\nTTErr WindowFunction::processLookup(TTAudioSignalArrayPtr inputs, TTAudioSignalArrayPtr outputs)\n{\n\tTT_WRAP_CALCULATE_METHOD(lookupValue)\n}\n\n\nTTErr WindowFunction::processApply(TTAudioSignalArrayPtr inputs, TTAudioSignalArrayPtr outputs)\n{\n\tTTAudioSignal&\t\tin = inputs->getSignal(0);\n\tTTAudioSignal&\t\tout = outputs->getSignal(0);\n\tTTUInt16\t\t\tvs = in.getVectorSizeAsInt();\n\tTTSampleValuePtr\tinSample;\n\tTTSampleValuePtr\toutSample;\n\tTTUInt16\t\t\tnumChannels = TTAudioSignal::getMinChannelCount(in, out);\n\tTTUInt16\t\t\tchannel;\n\t\n\t\/\/ In 'apply' mode we automatically update the lookup table size to the vector size\n\t\/\/ This is slow, but hopefully only happens once (if ever)\n\tif (vs != mNumPoints)\n\t\tdoSetNumPoints(vs);\n\t\n\tfor (channel=0; channel<numChannels; channel++) {\n\t\tinSample = in.mSampleVectors[channel];\n\t\toutSample = out.mSampleVectors[channel];\n\t\t\n\t\tfor (TTUInt32 i=0; i<vs; i++)\n\t\t\t*outSample++ = (*inSample++) * mLookupTable[i];\n\t}\n\treturn kTTErrNone;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"core\/gameboy.h\"\n#include \"core\/display.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#define GLEW_STATIC\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n\nstatic void key_callback(GLFWwindow *window, int key, int scancode, int action, int mode);\n\nvoid render_loop(Gameboy &gb)\n{\n  \/\/\n  \/\/ Set up window\n  \/\/\n  const unsigned int width = Display::width * 5;\n  const unsigned int height = Display::height * 5;\n  if (!glfwInit()) {\n    fprintf(stderr, \"Failed to initialise GLFW\\n\");\n    abort();\n  }\n\n  glfwWindowHint(GLFW_SAMPLES, 4);\n  glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);\n  glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3);\n  glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);\n  glfwWindowHint(GLFW_RESIZABLE, GL_FALSE);\n\n  GLFWwindow *window = glfwCreateWindow(width, height, \"Gameboy Emulator\", NULL, NULL);\n  if (window == NULL) {\n    fprintf(stderr, \"Failed to open window.\\n\");\n    glfwTerminate();\n    abort();\n  }\n  glfwMakeContextCurrent(window);\n  glfwSetWindowUserPointer(window, &gb);\n  glfwSetKeyCallback(window, key_callback);\n\n  glewExperimental = true;\n  if (glewInit() != GLEW_OK) {\n    fprintf(stderr, \"Failed to initialise GLEW.\\n\");\n    abort();\n  }\n\n  \/\/\n  \/\/ OpenGL settings\n  \/\/\n  glClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n  glMatrixMode(GL_PROJECTION);\n  glLoadIdentity();\n  gluOrtho2D(0, width, height, 0);\n\n  \/\/\n  \/\/ Shaders\n  \/\/\n  const GLchar *vertex_shader_source =\n    \"#version 330 core\\n\"\n    \"layout (location = 0) in vec2 position;\"\n    \"layout (location = 1) in vec2 texCoord;\"\n    \"out vec2 TexCoord;\"\n    \"void main()\"\n    \"{\"\n    \"  gl_Position = vec4(position, 0.0, 1.0);\"\n    \"  TexCoord = texCoord;\"\n    \"}\";\n\n  const GLchar *fragment_shader_source =\n    \"#version 330 core\\n\"\n    \"in vec2 TexCoord;\"\n    \"out vec4 colour;\"\n    \"uniform sampler2D display;\"\n    \"void main()\"\n    \"{\"\n    \"  colour = texture(display, TexCoord);\"\n    \"}\";\n\n  GLuint vertex_shader = glCreateShader(GL_VERTEX_SHADER);\n  glShaderSource(vertex_shader, 1, &vertex_shader_source, NULL);\n  glCompileShader(vertex_shader);\n  GLint status;\n  glGetShaderiv(vertex_shader, GL_COMPILE_STATUS, &status);\n  if (!status)\n  {\n    char error_buffer[512];\n    glGetShaderInfoLog(vertex_shader, 512, NULL, error_buffer);\n    fprintf(stderr, \"Vertex shader error:\\n%s\\n\", error_buffer);\n    abort();\n  }\n\n  GLuint fragment_shader = glCreateShader(GL_FRAGMENT_SHADER);\n  glShaderSource(fragment_shader, 1, &fragment_shader_source, NULL);\n  glCompileShader(fragment_shader);\n  glGetShaderiv(fragment_shader, GL_COMPILE_STATUS, &status);\n  if (!status)\n  {\n    char error_buffer[512];\n    glGetShaderInfoLog(fragment_shader, 512, NULL, error_buffer);\n    fprintf(stderr, \"Fragment shader error:\\n%s\\n\", error_buffer);\n    abort();\n  }\n\n  GLuint shader_program = glCreateProgram();\n  glAttachShader(shader_program, vertex_shader);\n  glAttachShader(shader_program, fragment_shader);\n  glLinkProgram(shader_program);\n  glGetProgramiv(shader_program, GL_LINK_STATUS, &status);\n  if (!status)\n  {\n    char error_buffer[512];\n    glGetProgramInfoLog(shader_program, 512, NULL, error_buffer);\n    fprintf(stderr, \"Shader link error:\\n%s\\n\", error_buffer);\n    abort();\n  }\n  glUseProgram(shader_program);\n\n  \/\/\n  \/\/ Buffers\n  \/\/\n  GLfloat display_vertices[] = {\n    \/\/ Pos          Tex\n   -1.0f,-1.0f,  0.0f, 1.0f,\n   -1.0f, 1.0f,  0.0f, 0.0f,\n    1.0f,-1.0f,  1.0f, 1.0f,\n    1.0f, 1.0f,  1.0f, 0.0f,\n    1.0f,-1.0f,  1.0f, 1.0f,\n   -1.0f, 1.0f,  0.0f, 0.0f,\n  };\n\n  GLuint vao, vbo;\n  glGenVertexArrays(1, &vao);\n  glGenBuffers(1, &vbo);\n\n  glBindVertexArray(vao);\n\n  glBindBuffer(GL_ARRAY_BUFFER, vbo);\n  glBufferData(GL_ARRAY_BUFFER, sizeof(display_vertices), display_vertices, GL_STATIC_DRAW);\n\n  \/\/ Position attribute\n  glVertexAttribPointer(0, 2, GL_FLOAT, GL_FALSE, 4*sizeof(GLfloat), 0);\n  glEnableVertexAttribArray(0);\n\n  \/\/ TexCoord attribute\n  glVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 4*sizeof(GLfloat), (GLvoid*)(2*sizeof(GLfloat)));\n  glEnableVertexAttribArray(1);\n\n  \/\/\n  \/\/ Texture\n  \/\/\n  GLuint texture;\n  glGenTextures(1, &texture);\n  glBindTexture(GL_TEXTURE_2D, texture);\n  glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_BORDER);\n  glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_BORDER);\n  glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n  glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n  \/\/ Uncomment to change display FPS\n  \/\/  glfwSwapInterval(0);\n  while (!glfwWindowShouldClose(window))\n  {\n    for (int i=0; i<10000; i++)\n    {\n      gb.step();\n    }\n\n    glClear(GL_COLOR_BUFFER_BIT);\n    glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, Display::width, Display::height, 0, GL_RGB, GL_UNSIGNED_BYTE, gb.get_framebuffer());\n    glUniform1i(glGetUniformLocation(shader_program, \"display\"), 0);\n    glDrawArrays(GL_TRIANGLES, 0, 6);\n    glfwSwapBuffers(window);\n    glfwPollEvents();\n  }\n}\n\nvoid key_callback(GLFWwindow *window, int key, int scancode, int action, int mode)\n{\n  Gameboy *gb = (Gameboy *)glfwGetWindowUserPointer(window);\n  bool pressed = (action != GLFW_RELEASE);\n  switch (key)\n  {\n    case GLFW_KEY_UP:\n      pressed ? gb->button_pressed(Joypad::Button::UP) :\n                gb->button_released(Joypad::Button::UP);\n      break;\n    case GLFW_KEY_DOWN:\n      pressed ? gb->button_pressed(Joypad::Button::DOWN) :\n                gb->button_released(Joypad::Button::DOWN);\n      break;\n    case GLFW_KEY_LEFT:\n      pressed ? gb->button_pressed(Joypad::Button::LEFT) :\n                gb->button_released(Joypad::Button::LEFT);\n      break;\n    case GLFW_KEY_RIGHT:\n      pressed ? gb->button_pressed(Joypad::Button::RIGHT) :\n                gb->button_released(Joypad::Button::RIGHT);\n      break;\n    case GLFW_KEY_Z:\n      pressed ? gb->button_pressed(Joypad::Button::A) :\n                gb->button_released(Joypad::Button::A);\n      break;\n    case GLFW_KEY_X:\n      pressed ? gb->button_pressed(Joypad::Button::B) :\n                gb->button_released(Joypad::Button::B);\n      break;\n    case GLFW_KEY_ENTER:\n      pressed ? gb->button_pressed(Joypad::Button::START) :\n                gb->button_released(Joypad::Button::START);\n      break;\n    case GLFW_KEY_BACKSPACE:\n      pressed ? gb->button_pressed(Joypad::Button::SELECT) :\n                gb->button_released(Joypad::Button::SELECT);\n      break;\n  }\n}\n<commit_msg>GLFW: Make renderer OpenGL ES compatible<commit_after>#include \"core\/gameboy.h\"\n#include \"core\/display.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#define GLEW_STATIC\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n\nstatic void key_callback(GLFWwindow *window, int key, int scancode, int action, int mode);\n\nGLuint compile_shader(GLenum type, const char* data) {\n  GLuint shader = glCreateShader(type);\n  glShaderSource(shader, 1, &data, NULL);\n  glCompileShader(shader);\n\n  GLint compile_status;\n  glGetShaderiv(shader, GL_COMPILE_STATUS, &compile_status);\n  if (compile_status != GL_TRUE) {\n    char buffer[1024];\n    GLsizei length;\n    glGetShaderInfoLog(shader, sizeof(buffer), &length, &buffer[0]);\n    fprintf(stderr, \"Shader failed to compile: %s\\n\", buffer);\n    return 0;\n  }\n\n  return shader;\n}\n\nGLuint link_program(GLuint frag_shader, GLuint vert_shader) {\n  GLuint program = glCreateProgram();\n  glAttachShader(program, frag_shader);\n  glAttachShader(program, vert_shader);\n  glLinkProgram(program);\n\n  GLint link_status;\n  glGetProgramiv(program, GL_LINK_STATUS, &link_status);\n  if (link_status != GL_TRUE) {\n    char buffer[1024];\n    GLsizei length;\n    glGetProgramInfoLog(program, sizeof(buffer), &length, &buffer[0]);\n    fprintf(stderr, \"Program failed to link: %s\\n\", buffer);\n    return 0;\n  }\n\n  return program;\n}\n\nconst GLchar *kVertexShaderSource =\n    \"#version 100\\n\"\n    \"attribute vec2 a_position;\"\n    \"attribute vec2 a_texcoord;\"\n    \"varying vec2 v_texcoord;\"\n    \"void main() {\"\n    \"  gl_Position = vec4(a_position, 0.0, 1.0);\"\n    \"  v_texcoord = a_texcoord;\"\n    \"}\";\n\nconst GLchar *kFragmentShaderSource =\n    \"#version 100\\n\"\n    \"precision mediump float;\"\n    \"varying vec2 v_texcoord;\"\n    \"uniform sampler2D u_texture;\"\n    \"void main() {\"\n    \"  gl_FragColor = texture2D(u_texture, v_texcoord);\"\n    \"}\";\n\nstruct Vertex {\n  GLfloat pos[2];\n  GLfloat tex[2];\n};\n\nconst Vertex kDisplayVertices[] = {\n {{-1.0f,-1.0f},  {0.0f, 1.0f}},\n {{-1.0f, 1.0f},  {0.0f, 0.0f}},\n {{ 1.0f,-1.0f},  {1.0f, 1.0f}},\n {{ 1.0f, 1.0f},  {1.0f, 0.0f}},\n {{ 1.0f,-1.0f},  {1.0f, 1.0f}},\n {{-1.0f, 1.0f},  {0.0f, 0.0f}},\n};\n\nGLFWwindow *initgl(int32_t width, int32_t height) {\n  if (!glfwInit()) {\n    fprintf(stderr, \"Failed to initialise GLFW\\n\");\n    abort();\n  }\n\n\n  GLFWwindow *window = glfwCreateWindow(width, height, \"Gameboy Emulator\", NULL, NULL);\n  if (window == NULL) {\n    fprintf(stderr, \"Failed to open window.\\n\");\n    abort();\n  }\n  glfwMakeContextCurrent(window);\n  glfwSetKeyCallback(window, key_callback);\n\n  glewExperimental = true;\n  if (glewInit() != GLEW_OK) {\n    fprintf(stderr, \"Failed to initialise GLEW.\\n\");\n    abort();\n  }\n\n  glClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n  return window;\n}\n\nGLuint init_shaders() {\n  printf(\"opengl version: (%s)\\n\", glGetString(GL_VERSION));\n  GLuint vertex_shader = compile_shader(GL_VERTEX_SHADER, kVertexShaderSource);\n  if (!vertex_shader)\n    abort();\n\n  GLuint frag_shader = compile_shader(GL_FRAGMENT_SHADER, kFragmentShaderSource);\n  if (!frag_shader)\n    abort();\n\n  GLuint program = link_program(frag_shader, vertex_shader);\n  if (!program)\n    abort();\n\n  glUseProgram(program);\n\n  return program;\n}\n\nvoid render_loop(Gameboy &gb)\n{\n  const unsigned int width = Display::width * 5;\n  const unsigned int height = Display::height * 5;\n\n  GLFWwindow *window = initgl(width, height);\n  glfwSetWindowUserPointer(window, &gb);\n\n  \/\/\n  \/\/ OpenGL settings\n  \/\/\n  glMatrixMode(GL_PROJECTION);\n  glLoadIdentity();\n  gluOrtho2D(0, width, height, 0);\n\n  GLuint program = init_shaders();\n\n  GLuint texture_loc = glGetUniformLocation(program, \"u_texture\");\n  GLuint position_loc = glGetAttribLocation(program, \"a_position\");\n  GLuint texcoord_loc = glGetAttribLocation(program, \"a_texcoord\");\n\n  \/\/\n  \/\/ Buffers\n  \/\/\n  GLuint vbo;\n  glGenBuffers(1, &vbo);\n  glBindBuffer(GL_ARRAY_BUFFER, vbo);\n  glBufferData(GL_ARRAY_BUFFER, sizeof(kDisplayVertices), kDisplayVertices, GL_STATIC_DRAW);\n\n  GLuint vao;\n  glGenVertexArrays(1, &vao);\n  glBindVertexArray(vao);\n\n  \/\/ position attribute\n  glVertexAttribPointer(position_loc, 2,\n      GL_FLOAT, GL_FALSE, sizeof(Vertex),\n      reinterpret_cast<GLvoid*>(offsetof(Vertex, pos)));\n  glEnableVertexAttribArray(position_loc);\n\n  \/\/ texcoord attribute\n  glVertexAttribPointer(texcoord_loc, 2,\n      GL_FLOAT, GL_FALSE, sizeof(Vertex),\n      reinterpret_cast<GLvoid*>(offsetof(Vertex, tex)));\n  glEnableVertexAttribArray(texcoord_loc);\n\n  \/\/\n  \/\/ Texture\n  \/\/\n  GLuint texture;\n  glGenTextures(1, &texture);\n  glBindTexture(GL_TEXTURE_2D, texture);\n  glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_BORDER);\n  glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_BORDER);\n  glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n  glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\n  glActiveTexture(GL_TEXTURE0);\n\n  \/\/ Uncomment to change display FPS\n  \/\/  glfwSwapInterval(0);\n  while (!glfwWindowShouldClose(window))\n  {\n    for (int i=0; i<16666; i++)\n    {\n      gb.step();\n    }\n\n    glClear(GL_COLOR_BUFFER_BIT);\n    glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, Display::width, Display::height,\n        0, GL_RGB, GL_UNSIGNED_BYTE, gb.get_framebuffer());\n    glUniform1i(texture_loc, 0);\n    glDrawArrays(GL_TRIANGLES, 0, 6);\n\n    glfwSwapBuffers(window);\n    glfwPollEvents();\n  }\n}\n\nvoid key_callback(GLFWwindow *window, int key, int scancode, int action, int mode)\n{\n  Gameboy *gb = (Gameboy *)glfwGetWindowUserPointer(window);\n  bool pressed = (action != GLFW_RELEASE);\n  switch (key)\n  {\n    case GLFW_KEY_UP:\n      pressed ? gb->button_pressed(Joypad::Button::UP) :\n                gb->button_released(Joypad::Button::UP);\n      break;\n    case GLFW_KEY_DOWN:\n      pressed ? gb->button_pressed(Joypad::Button::DOWN) :\n                gb->button_released(Joypad::Button::DOWN);\n      break;\n    case GLFW_KEY_LEFT:\n      pressed ? gb->button_pressed(Joypad::Button::LEFT) :\n                gb->button_released(Joypad::Button::LEFT);\n      break;\n    case GLFW_KEY_RIGHT:\n      pressed ? gb->button_pressed(Joypad::Button::RIGHT) :\n                gb->button_released(Joypad::Button::RIGHT);\n      break;\n    case GLFW_KEY_Z:\n      pressed ? gb->button_pressed(Joypad::Button::A) :\n                gb->button_released(Joypad::Button::A);\n      break;\n    case GLFW_KEY_X:\n      pressed ? gb->button_pressed(Joypad::Button::B) :\n                gb->button_released(Joypad::Button::B);\n      break;\n    case GLFW_KEY_ENTER:\n      pressed ? gb->button_pressed(Joypad::Button::START) :\n                gb->button_released(Joypad::Button::START);\n      break;\n    case GLFW_KEY_BACKSPACE:\n      pressed ? gb->button_pressed(Joypad::Button::SELECT) :\n                gb->button_released(Joypad::Button::SELECT);\n      break;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ (C) 2014 Arek Olek\n\n#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <vector>\n\n#include <boost\/graph\/adjacency_list.hpp>\n#include <boost\/graph\/adjacency_matrix.hpp>\n\n#include <omp.h>\n\n#include \"bfs.hpp\"\n#include \"dfs.hpp\"\n#include \"fifodfs.hpp\"\n#include \"fivethree.hpp\"\n#include \"lost.hpp\"\n#include \"rdfs.hpp\"\n#include \"random.hpp\"\n#include \"ilst.hpp\"\n#include \"greedy.hpp\"\n\n#include \"test_suite.hpp\"\n\n#include \"debug.hpp\"\n#include \"graph.hpp\"\n#include \"options.hpp\"\n#include \"range.hpp\"\n#include \"timing.hpp\"\n\nboost::adjacency_matrix<boost::undirectedS> typedef amatrix;\nboost::adjacency_list<boost::hash_setS, boost::vecS, boost::undirectedS> typedef ahash;\nboost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS> typedef alist;\nboost::adjacency_list<boost::slistS, boost::vecS, boost::undirectedS> typedef aslist;\nboost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS> typedef aset;\nboost::adjacency_list<boost::multisetS, boost::vecS, boost::undirectedS> typedef amultiset;\nboost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> typedef avec;\n\ntemplate<class Graph, class Tree>\nstd::function<Tree(Graph&)> make_construction(std::string name,\n                                              unsigned index,\n                                              unsigned size,\n                                              unsigned seed,\n                                              std::string sseed) {\n  if (name == \"bfs\")\n    return bfs_tree<Graph, Tree> ;\n  if (name == \"dfs\")\n    return dfs_tree<Graph, Tree> ;\n  if (name == \"rdfs\")\n    return rdfs_tree<Graph, Tree> ;\n  if (name == \"rdfs50\")\n    return rdfs_best_tree<Graph, Tree> ;\n  if (name == \"fifo\")\n    return fifo_dfs_tree<Graph, Tree> ;\n  if (name == \"random\")\n    return std::bind(random_tree<Graph, Tree>, std::placeholders::_1, seed);\n  if (name == \"wilson\")\n    return std::bind(wilson_tree<Graph, Tree>, std::placeholders::_1, seed);\n  if (name == \"greedy\")\n    return std::bind(greedy_tree<Graph, Tree>, std::placeholders::_1, seed);\n  if (name == \"ilst\")\n    return ilst<Graph, Tree> ;\n  if (name == \"5\/3\") {\n    return [=](const Graph& G) {\n      std::default_random_engine generator(seed);\n      Tree g(num_vertices(G));\n      copy_edges_shuffled(five_three_tree<Graph, Tree>(G), g, generator);\n      return g;\n    };\n  }\n  if (found(\".xml\", name)) {\n    return [=](const Graph& G) {\n      real_suite<Tree> suite(name, size, sseed);\n      return std::get<0>(suite.get(index));\n    };\n  }\n  throw std::invalid_argument(\"Unknown construction method: \" + name);\n}\n\ntemplate<class Graph>\nstd::function<unsigned(Graph&)> make_upper(std::string name) {\n  if (name == \"53\") {\n    return [](const Graph& G) {\n      return 5*(num_vertices(G)-3)\/6;\n    };\n  }\n  return upper_bound<Graph> ;\n}\n\nstd::string type(amatrix const & G) { return \"matrix\"; }\nstd::string type(ahash const & G) { return \"unordered_set\"; }\nstd::string type(aset const & G) { return \"set\"; }\nstd::string type(amultiset const & G) { return \"multiset\"; }\nstd::string type(alist const & G) { return \"list\"; }\nstd::string type(aslist const & G) { return \"slist\"; }\nstd::string type(avec const & G) { return \"vector\"; }\n\ntemplate <class Graph, class Tree, class Suite, class Strings>\nvoid run(Suite& suite,\n         Strings const & constructions,\n         Strings const & improvements,\n         bool scratch,\n         std::string seed) {\n  timing total(CLOCK_REALTIME);\n  total.start();\n  auto graph_type = type(Graph(0));\n  auto tree_type = type(Tree(0));\n  #pragma omp parallel\n  {\n    auto id = omp_get_thread_num();\n    double elapsed_c, elapsed_i;\n    std::stringstream buffer;\n    timing timer;\n    #pragma omp for schedule(dynamic) nowait\n    for(uint i = 0; i < suite.size(); ++i) {\n      auto trial = suite.get(i);\n      auto G = std::get<0>(trial);\n\n      for (auto cname : constructions) {\n        auto construct = make_construction<Graph, Tree>(cname, i, suite.size(), suite.get_seed(i), seed);\n        auto upper = make_upper<Graph>(suite.type());\n        timer.start();\n        auto T = construct(G);\n        elapsed_c = timer.stop();\n\n        assert(num_edges(T) == num_vertices(T) - 1);\n        assert(is_connected(T));\n        assert(is_subgraph(T, G));\n\n        const auto tree(T);\n\n        for (auto iname : improvements) {\n          if (scratch) T = tree;\n          auto num_internal_before = num_internal(T);\n          auto improve = make_improvement<Graph, Tree>(iname);\n\n          timer.start();\n          auto rules = improve(G, T);\n          elapsed_i = timer.stop();\n\n          buffer\n#ifdef GRAPH_REPR\n            << graph_type << '\\t'\n#endif\n#ifdef TREE_REPR\n            << tree_type << '\\t'\n#endif\n            << std::get<1>(trial) << '\\t'\n            << id << '\\t'\n            << suite.type() << '\\t'\n            << std::get<2>(trial) << '\\t'\n            << std::get<3>(trial) << '\\t'\n            << num_vertices(G) << '\\t'\n            << num_edges(G) << '\\t'\n            << upper(G) << '\\t'\n            << cname << '\\t'\n            << iname << '\\t'\n            << num_internal_before << '\\t'\n            << num_internal(T) << '\\t'\n            << elapsed_c << '\\t'\n            << elapsed_i << '\\t'\n            << sum(rules) << '\\t'\n            << join(rules, \"-\")\n            << std::endl;\n            ;\n#ifndef NDEBUG\n          if (suite.size() < 10)\n            show(\"graph\" + std::to_string(i) + graph_type + \".dot\", G, T);\n          \/\/if(rules[rules.size()-2] > 10) show(\"graph\" + std::to_string(i) + \".dot\", G, T);\n#endif\n          if (!scratch) elapsed_c += elapsed_i;\n        }\n      }\n\n      if (id == 0 || i + 1 == suite.size()) {\n        std::cerr << '\\t' << 100 * (i + 1) \/ suite.size() << \"% of \"\n        << suite.size();\n        std::cerr << '\\t' << readable(total.stop()) << \" elapsed    \\r\";\n      }\n    }\n    #pragma omp critical\n    std::cout << buffer.str() << std::flush;\n  }\n  std::cerr << std::endl;\n}\n\ntemplate <class Graph, class Tree, class Sizes, class Params, class Strings>\nvoid run(std::string t,\n         unsigned z,\n         Sizes sizes,\n         Params params,\n         Strings const & constructions,\n         Strings const & improvements,\n         bool scratch,\n         std::string seed) {\n  if (found(\".xml\", t)) {\n    real_suite<Graph> suite(t, z, seed);\n    run<Graph, Tree>(suite, constructions, improvements, scratch, seed);\n  } else if (found(\".\", t)) {\n    file_suite<Graph> suite(t, z, seed);\n    run<Graph, Tree>(suite, constructions, improvements, scratch, seed);\n  } else {\n    test_suite<Graph> suite(t, z, sizes, params, seed);\n    run<Graph, Tree>(suite, constructions, improvements, scratch, seed);\n  }\n}\n\ntemplate <class Graph, class Sizes, class Degrees, class Strings>\nvoid run(std::string tree,\n         std::string model,\n         unsigned sample,\n         Sizes sizes,\n         Degrees degrees,\n         Strings const & constructions,\n         Strings const & improvements,\n         bool scratch,\n         std::string seed) {\n#ifdef TREE_REPR\n  if (tree == \"matrix\")\n    run<Graph, amatrix>  (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"unordered_set\")\n    run<Graph, ahash>    (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"multiset\")\n    run<Graph, amultiset>(model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"list\")\n    run<Graph, alist>    (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"set\")\n    run<Graph, aset>     (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"vector\")\n    run<Graph, avec>     (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n#endif\n  if (tree == \"slist\")\n    run<Graph, aslist>   (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n}\n\ntemplate <class Sizes, class Degrees, class Strings>\nvoid run(std::string graph,\n         std::string tree,\n         std::string model,\n         unsigned sample,\n         Sizes sizes,\n         Degrees degrees,\n         Strings const & constructions,\n         Strings const & improvements,\n         bool scratch,\n         std::string seed) {\n#ifdef GRAPH_REPR\n  if (graph == \"matrix\")\n    run<amatrix>  (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"unordered_set\")\n    run<ahash>    (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"multiset\")\n    run<amultiset>(tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"slist\")\n    run<aslist>   (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"vector\")\n    run<avec>     (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"list\")\n    run<alist>    (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n#endif\n  if (graph == \"set\")\n    run<aset>     (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n}\n\nstd::string time_seed() {\n  return std::to_string(std::chrono::system_clock::now().time_since_epoch().count());\n}\n\nint main(int argc, char** argv){\n  using std::string;\n  using std::vector;\n\n  std::ios_base::sync_with_stdio(0);\n\n  options opt(argc, argv);\n  auto z = opt.get<int>(\"-z\", 100);\n  auto graphs = opt.getList<string>(\"-g\", {\"set\"});\n  auto trees = opt.getList<string>(\"-t\", {\"slist\"});\n  auto sizes = opt.getList<unsigned>(\"-n\", {1000});\n  auto tests = opt.getList<string>(\"-m\", {\"gnp+mst\"});\n  auto degrees = opt.getList<double>(\"-d\", { 3. });\n  auto constructions = opt.getList<string>(\"-c\", {\"wilson\"});\n  auto improvements = opt.getList<string>(\"-i\", {\"none\"});\n  auto scratch = opt.has(\"--scratch\");\n  auto seed = opt.get<string>(\"-s\", time_seed());\n\n  std::cout << \"# Seed: \" << seed << std::endl;\n\n  std::cout\n#ifdef GRAPH_REPR\n    << \"graph\\t\"\n#endif\n#ifdef TREE_REPR\n    << \"tree\\t\"\n#endif\n    << \"run\\t\"\n    << \"thread\\t\"\n    << \"model\\t\"\n    << \"degree\\t\"\n    << \"param\\t\"\n    << \"vertices\\t\"\n    << \"edges\\t\"\n    << \"upper\\t\"\n    << \"construction\\t\"\n    << \"improvement\\t\"\n    << \"before\\t\"\n    << \"internal\\t\"\n    << \"ctime\\t\"\n    << \"itime\\t\"\n    << \"steps\\t\"\n    << \"rules\"\n    << std::endl;\n\n  for(auto t : tests)\n    for(auto graph : graphs)\n      for(auto tree : trees)\n        run(graph, tree, t, z, sizes, degrees, constructions, improvements,\n            scratch, seed);\n\n  return 0;\n}\n<commit_msg>add CXXFLAG to disable progress reporting<commit_after>\/\/ (C) 2014 Arek Olek\n\n#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <vector>\n\n#include <boost\/graph\/adjacency_list.hpp>\n#include <boost\/graph\/adjacency_matrix.hpp>\n\n#include <omp.h>\n\n#include \"bfs.hpp\"\n#include \"dfs.hpp\"\n#include \"fifodfs.hpp\"\n#include \"fivethree.hpp\"\n#include \"lost.hpp\"\n#include \"rdfs.hpp\"\n#include \"random.hpp\"\n#include \"ilst.hpp\"\n#include \"greedy.hpp\"\n\n#include \"test_suite.hpp\"\n\n#include \"debug.hpp\"\n#include \"graph.hpp\"\n#include \"options.hpp\"\n#include \"range.hpp\"\n#include \"timing.hpp\"\n\nboost::adjacency_matrix<boost::undirectedS> typedef amatrix;\nboost::adjacency_list<boost::hash_setS, boost::vecS, boost::undirectedS> typedef ahash;\nboost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS> typedef alist;\nboost::adjacency_list<boost::slistS, boost::vecS, boost::undirectedS> typedef aslist;\nboost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS> typedef aset;\nboost::adjacency_list<boost::multisetS, boost::vecS, boost::undirectedS> typedef amultiset;\nboost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> typedef avec;\n\ntemplate<class Graph, class Tree>\nstd::function<Tree(Graph&)> make_construction(std::string name,\n                                              unsigned index,\n                                              unsigned size,\n                                              unsigned seed,\n                                              std::string sseed) {\n  if (name == \"bfs\")\n    return bfs_tree<Graph, Tree> ;\n  if (name == \"dfs\")\n    return dfs_tree<Graph, Tree> ;\n  if (name == \"rdfs\")\n    return rdfs_tree<Graph, Tree> ;\n  if (name == \"rdfs50\")\n    return rdfs_best_tree<Graph, Tree> ;\n  if (name == \"fifo\")\n    return fifo_dfs_tree<Graph, Tree> ;\n  if (name == \"random\")\n    return std::bind(random_tree<Graph, Tree>, std::placeholders::_1, seed);\n  if (name == \"wilson\")\n    return std::bind(wilson_tree<Graph, Tree>, std::placeholders::_1, seed);\n  if (name == \"greedy\")\n    return std::bind(greedy_tree<Graph, Tree>, std::placeholders::_1, seed);\n  if (name == \"ilst\")\n    return ilst<Graph, Tree> ;\n  if (name == \"5\/3\") {\n    return [=](const Graph& G) {\n      std::default_random_engine generator(seed);\n      Tree g(num_vertices(G));\n      copy_edges_shuffled(five_three_tree<Graph, Tree>(G), g, generator);\n      return g;\n    };\n  }\n  if (found(\".xml\", name)) {\n    return [=](const Graph& G) {\n      real_suite<Tree> suite(name, size, sseed);\n      return std::get<0>(suite.get(index));\n    };\n  }\n  throw std::invalid_argument(\"Unknown construction method: \" + name);\n}\n\ntemplate<class Graph>\nstd::function<unsigned(Graph&)> make_upper(std::string name) {\n  if (name == \"53\") {\n    return [](const Graph& G) {\n      return 5*(num_vertices(G)-3)\/6;\n    };\n  }\n  return upper_bound<Graph> ;\n}\n\nstd::string type(amatrix const & G) { return \"matrix\"; }\nstd::string type(ahash const & G) { return \"unordered_set\"; }\nstd::string type(aset const & G) { return \"set\"; }\nstd::string type(amultiset const & G) { return \"multiset\"; }\nstd::string type(alist const & G) { return \"list\"; }\nstd::string type(aslist const & G) { return \"slist\"; }\nstd::string type(avec const & G) { return \"vector\"; }\n\ntemplate <class Graph, class Tree, class Suite, class Strings>\nvoid run(Suite& suite,\n         Strings const & constructions,\n         Strings const & improvements,\n         bool scratch,\n         std::string seed) {\n#ifndef NPROGRESS\n  timing total(CLOCK_REALTIME);\n  total.start();\n#endif\n  auto graph_type = type(Graph(0));\n  auto tree_type = type(Tree(0));\n  #pragma omp parallel\n  {\n    auto id = omp_get_thread_num();\n    double elapsed_c, elapsed_i;\n    std::stringstream buffer;\n    timing timer;\n    #pragma omp for schedule(dynamic) nowait\n    for(uint i = 0; i < suite.size(); ++i) {\n      auto trial = suite.get(i);\n      auto G = std::get<0>(trial);\n\n      for (auto cname : constructions) {\n        auto construct = make_construction<Graph, Tree>(cname, i, suite.size(), suite.get_seed(i), seed);\n        auto upper = make_upper<Graph>(suite.type());\n        timer.start();\n        auto T = construct(G);\n        elapsed_c = timer.stop();\n\n        assert(num_edges(T) == num_vertices(T) - 1);\n        assert(is_connected(T));\n        assert(is_subgraph(T, G));\n\n        const auto tree(T);\n\n        for (auto iname : improvements) {\n          if (scratch) T = tree;\n          auto num_internal_before = num_internal(T);\n          auto improve = make_improvement<Graph, Tree>(iname);\n\n          timer.start();\n          auto rules = improve(G, T);\n          elapsed_i = timer.stop();\n\n          buffer\n#ifdef GRAPH_REPR\n            << graph_type << '\\t'\n#endif\n#ifdef TREE_REPR\n            << tree_type << '\\t'\n#endif\n            << std::get<1>(trial) << '\\t'\n            << id << '\\t'\n            << suite.type() << '\\t'\n            << std::get<2>(trial) << '\\t'\n            << std::get<3>(trial) << '\\t'\n            << num_vertices(G) << '\\t'\n            << num_edges(G) << '\\t'\n            << upper(G) << '\\t'\n            << cname << '\\t'\n            << iname << '\\t'\n            << num_internal_before << '\\t'\n            << num_internal(T) << '\\t'\n            << elapsed_c << '\\t'\n            << elapsed_i << '\\t'\n            << sum(rules) << '\\t'\n            << join(rules, \"-\")\n            << std::endl;\n            ;\n#ifndef NDEBUG\n          if (suite.size() < 10)\n            show(\"graph\" + std::to_string(i) + graph_type + \".dot\", G, T);\n          \/\/if(rules[rules.size()-2] > 10) show(\"graph\" + std::to_string(i) + \".dot\", G, T);\n#endif\n          if (!scratch) elapsed_c += elapsed_i;\n        }\n      }\n\n#ifndef NPROGRESS\n      if (id == 0 || i + 1 == suite.size()) {\n        std::cerr << '\\t' << 100 * (i + 1) \/ suite.size() << \"% of \"\n        << suite.size();\n        std::cerr << '\\t' << readable(total.stop()) << \" elapsed    \\r\";\n      }\n#endif\n    }\n    #pragma omp critical\n    std::cout << buffer.str() << std::flush;\n  }\n#ifndef NPROGRESS\n  std::cerr << std::endl;\n#endif\n}\n\ntemplate <class Graph, class Tree, class Sizes, class Params, class Strings>\nvoid run(std::string t,\n         unsigned z,\n         Sizes sizes,\n         Params params,\n         Strings const & constructions,\n         Strings const & improvements,\n         bool scratch,\n         std::string seed) {\n  if (found(\".xml\", t)) {\n    real_suite<Graph> suite(t, z, seed);\n    run<Graph, Tree>(suite, constructions, improvements, scratch, seed);\n  } else if (found(\".\", t)) {\n    file_suite<Graph> suite(t, z, seed);\n    run<Graph, Tree>(suite, constructions, improvements, scratch, seed);\n  } else {\n    test_suite<Graph> suite(t, z, sizes, params, seed);\n    run<Graph, Tree>(suite, constructions, improvements, scratch, seed);\n  }\n}\n\ntemplate <class Graph, class Sizes, class Degrees, class Strings>\nvoid run(std::string tree,\n         std::string model,\n         unsigned sample,\n         Sizes sizes,\n         Degrees degrees,\n         Strings const & constructions,\n         Strings const & improvements,\n         bool scratch,\n         std::string seed) {\n#ifdef TREE_REPR\n  if (tree == \"matrix\")\n    run<Graph, amatrix>  (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"unordered_set\")\n    run<Graph, ahash>    (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"multiset\")\n    run<Graph, amultiset>(model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"list\")\n    run<Graph, alist>    (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"set\")\n    run<Graph, aset>     (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (tree == \"vector\")\n    run<Graph, avec>     (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n#endif\n  if (tree == \"slist\")\n    run<Graph, aslist>   (model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n}\n\ntemplate <class Sizes, class Degrees, class Strings>\nvoid run(std::string graph,\n         std::string tree,\n         std::string model,\n         unsigned sample,\n         Sizes sizes,\n         Degrees degrees,\n         Strings const & constructions,\n         Strings const & improvements,\n         bool scratch,\n         std::string seed) {\n#ifdef GRAPH_REPR\n  if (graph == \"matrix\")\n    run<amatrix>  (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"unordered_set\")\n    run<ahash>    (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"multiset\")\n    run<amultiset>(tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"slist\")\n    run<aslist>   (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"vector\")\n    run<avec>     (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n  if (graph == \"list\")\n    run<alist>    (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n#endif\n  if (graph == \"set\")\n    run<aset>     (tree, model, sample, sizes, degrees, constructions, improvements, scratch, seed);\n}\n\nstd::string time_seed() {\n  return std::to_string(std::chrono::system_clock::now().time_since_epoch().count());\n}\n\nint main(int argc, char** argv){\n  using std::string;\n  using std::vector;\n\n  std::ios_base::sync_with_stdio(0);\n\n  options opt(argc, argv);\n  auto z = opt.get<int>(\"-z\", 100);\n  auto graphs = opt.getList<string>(\"-g\", {\"set\"});\n  auto trees = opt.getList<string>(\"-t\", {\"slist\"});\n  auto sizes = opt.getList<unsigned>(\"-n\", {1000});\n  auto tests = opt.getList<string>(\"-m\", {\"gnp+mst\"});\n  auto degrees = opt.getList<double>(\"-d\", { 3. });\n  auto constructions = opt.getList<string>(\"-c\", {\"wilson\"});\n  auto improvements = opt.getList<string>(\"-i\", {\"none\"});\n  auto scratch = opt.has(\"--scratch\");\n  auto seed = opt.get<string>(\"-s\", time_seed());\n\n  std::cout << \"# Seed: \" << seed << std::endl;\n\n  std::cout\n#ifdef GRAPH_REPR\n    << \"graph\\t\"\n#endif\n#ifdef TREE_REPR\n    << \"tree\\t\"\n#endif\n    << \"run\\t\"\n    << \"thread\\t\"\n    << \"model\\t\"\n    << \"degree\\t\"\n    << \"param\\t\"\n    << \"vertices\\t\"\n    << \"edges\\t\"\n    << \"upper\\t\"\n    << \"construction\\t\"\n    << \"improvement\\t\"\n    << \"before\\t\"\n    << \"internal\\t\"\n    << \"ctime\\t\"\n    << \"itime\\t\"\n    << \"steps\\t\"\n    << \"rules\"\n    << std::endl;\n\n  for(auto t : tests)\n    for(auto graph : graphs)\n      for(auto tree : trees)\n        run(graph, tree, t, z, sizes, degrees, constructions, improvements,\n            scratch, seed);\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"GeometricRand.h\"\n\nGeometricRand::GeometricRand(double probability)\n{\n    setProbability(probability);\n}\n\nstd::string GeometricRand::name()\n{\n    return \"Geometric(\" + toStringWithPrecision(getProbability()) + \")\";\n}\n\nvoid GeometricRand::setProbability(double probability)\n{\n    p = std::min(std::max(probability, MIN_POSITIVE), 1.0);\n    q = 1.0 - p;\n\n    \/\/\/ we use two different generators for two different cases\n    \/\/\/ if p < 0.2 then the tail is too heavy\n    \/\/\/ (probability to be in main body is less then 0.977482)\n    \/\/\/ thus we always use low bound of variate exponential distribution\n    \/\/\/ otherwise we choose table method\n    if (p < 0.2)\n    {\n        W.setRate(-std::log(q));\n    }\n    else\n    {\n        table[0] = p;\n        double prod = p;\n        for (int i = 1; i < tableSize; ++i)\n        {\n            prod *= q;\n            table[i] = table[i - 1] + prod;\n        }\n    }\n}\n\ndouble GeometricRand::P(int k) const\n{\n    return (k < 0) ? 0 : p * std::pow(q, k);\n}\n\ndouble GeometricRand::F(double x) const\n{\n    return (x < 0) ? 0 : 1 - std::pow(q, std::floor(x) + 1);\n}\n\ndouble GeometricRand::variate() const\n{\n    if (p < 0.2)\n        return variateByExponential();\n    return variateByTable();\n}\n\ndouble GeometricRand::variate(double probability)\n{\n    if (probability < 0.2)\n        return std::floor(ExponentialRand::variate(-std::log(1 - probability)));\n\n    double U = UniformRand::standardVariate();\n    int x = 0;\n    double prod = probability, sum = prod, q = 1 - probability;\n    while (U > sum) {\n        prod *= q;\n        sum += prod;\n        ++x;\n    }\n    return x;\n}\n\nvoid GeometricRand::sample(QVector<double> &outputData)\n{\n    if (p < 0.2) {\n        for (double &var : outputData)\n            var = variateByExponential();\n    }\n    else {\n        for (double &var : outputData)\n            var = variateByTable();\n    }\n}\n\ndouble GeometricRand::variateByExponential() const\n{\n    return std::floor(W.variate());\n}\n\ndouble GeometricRand::variateByTable() const\n{\n    double U = UniformRand::standardVariate();\n    \/\/\/ handle tail by recursion\n    if (U > table[tableSize - 1])\n        return tableSize + variateByTable();\n    \/\/\/ handle the main body\n    int x = 0;\n    while (U > table[x])\n        ++x;\n    return x;\n}\n\ndouble GeometricRand::Quantile(double F) const\n{\n    if (F < 0 || F > 1)\n        return NAN;\n    if (F == 0)\n        return -INFINITY;\n    if (F == 1)\n        return INFINITY;\n    return std::log1p(F) \/ std::log(1 - p);\n}\n\ndouble GeometricRand::Median() const\n{\n    return std::floor(-M_LN2 \/ std::log(q));\n}\n\ndouble GeometricRand::Mode() const\n{\n    return 0.0;\n}\n\ndouble GeometricRand::Skewness() const\n{\n    return (2 - p) \/ std::sqrt(q);\n}\n\ndouble GeometricRand::ExcessKurtosis() const\n{\n    return p * p \/ q + 6;\n}\n\ndouble GeometricRand::Entropy() const\n{\n    double a = -q * std::log(q);\n    double b = -p * std::log(p);\n    return (a + b) \/ (M_LN2 * p);\n}\n\n<commit_msg>Update GeometricRand.cpp<commit_after>#include \"GeometricRand.h\"\n\nGeometricRand::GeometricRand(double probability)\n{\n    setProbability(probability);\n}\n\nstd::string GeometricRand::name()\n{\n    return \"Geometric(\" + toStringWithPrecision(getProbability()) + \")\";\n}\n\nvoid GeometricRand::setProbability(double probability)\n{\n    p = std::min(probability, 1.0);\n    if (p <= 0)\n        p = MIN_POSITIVE;\n    q = 1.0 - p;\n\n    \/\/\/ we use two different generators for two different cases\n    \/\/\/ if p < 0.2 then the tail is too heavy\n    \/\/\/ (probability to be in main body is less then 0.977482)\n    \/\/\/ thus we always use low bound of variate exponential distribution\n    \/\/\/ otherwise we choose table method\n    if (p < 0.2)\n    {\n        W.setRate(-std::log(q));\n    }\n    else\n    {\n        table[0] = p;\n        double prod = p;\n        for (int i = 1; i < tableSize; ++i)\n        {\n            prod *= q;\n            table[i] = table[i - 1] + prod;\n        }\n    }\n}\n\ndouble GeometricRand::P(int k) const\n{\n    return (k < 0) ? 0 : p * std::pow(q, k);\n}\n\ndouble GeometricRand::F(double x) const\n{\n    return (x < 0) ? 0 : 1 - std::pow(q, std::floor(x) + 1);\n}\n\ndouble GeometricRand::variate() const\n{\n    if (p < 0.2)\n        return variateByExponential();\n    return variateByTable();\n}\n\ndouble GeometricRand::variate(double probability)\n{\n    if (probability < 0.2)\n        return std::floor(ExponentialRand::variate(-std::log(1 - probability)));\n\n    double U = UniformRand::standardVariate();\n    int x = 0;\n    double prod = probability, sum = prod, q = 1 - probability;\n    while (U > sum) {\n        prod *= q;\n        sum += prod;\n        ++x;\n    }\n    return x;\n}\n\nvoid GeometricRand::sample(QVector<double> &outputData)\n{\n    if (p < 0.2) {\n        for (double &var : outputData)\n            var = variateByExponential();\n    }\n    else {\n        for (double &var : outputData)\n            var = variateByTable();\n    }\n}\n\ndouble GeometricRand::variateByExponential() const\n{\n    return std::floor(W.variate());\n}\n\ndouble GeometricRand::variateByTable() const\n{\n    double U = UniformRand::standardVariate();\n    \/\/\/ handle tail by recursion\n    if (U > table[tableSize - 1])\n        return tableSize + variateByTable();\n    \/\/\/ handle the main body\n    int x = 0;\n    while (U > table[x])\n        ++x;\n    return x;\n}\n\ndouble GeometricRand::Quantile(double F) const\n{\n    if (F < 0 || F > 1)\n        return NAN;\n    if (F == 0)\n        return -INFINITY;\n    if (F == 1)\n        return INFINITY;\n    return std::log1p(F) \/ std::log(1 - p);\n}\n\ndouble GeometricRand::Median() const\n{\n    return std::floor(-M_LN2 \/ std::log(q));\n}\n\ndouble GeometricRand::Mode() const\n{\n    return 0.0;\n}\n\ndouble GeometricRand::Skewness() const\n{\n    return (2 - p) \/ std::sqrt(q);\n}\n\ndouble GeometricRand::ExcessKurtosis() const\n{\n    return p * p \/ q + 6;\n}\n\ndouble GeometricRand::Entropy() const\n{\n    double a = -q * std::log(q);\n    double b = -p * std::log(p);\n    return (a + b) \/ (M_LN2 * p);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: pe_struc.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 18:50:01 $\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 <s2_luidl\/pe_struc.hxx>\n\n\n\/\/ NOT FULLY DECLARED SERVICES\n#include <ary\/idl\/i_gate.hxx>\n#include <ary\/idl\/i_struct.hxx>\n#include <ary\/idl\/ip_ce.hxx>\n#include <ary_i\/codeinf2.hxx>\n#include <s2_luidl\/tk_ident.hxx>\n#include <s2_luidl\/tk_punct.hxx>\n#include <s2_luidl\/tk_keyw.hxx>\n#include <s2_luidl\/pe_type2.hxx>\n#include <s2_luidl\/pe_selem.hxx>\n\n\n\nnamespace csi\n{\nnamespace uidl\n{\n\n\nPE_Struct::PE_Struct()\n    \/\/ :    aWork,\n    \/\/      pStati\n{\n    pStati = new S_Stati(*this);\n}\n\nvoid\nPE_Struct::EstablishContacts( UnoIDL_PE *               io_pParentPE,\n                              ary::n22::Repository &            io_rRepository,\n                              TokenProcessing_Result &  o_rResult )\n{\n    UnoIDL_PE::EstablishContacts(io_pParentPE,io_rRepository,o_rResult);\n    Work().pPE_Element->EstablishContacts(this,io_rRepository,o_rResult);\n    Work().pPE_Type->EstablishContacts(this,io_rRepository,o_rResult);\n}\n\nPE_Struct::~PE_Struct()\n{\n}\n\nvoid\nPE_Struct::ProcessToken( const Token & i_rToken )\n{\n    i_rToken.Trigger(*Stati().pCurStatus);\n}\n\n\nvoid\nPE_Struct::InitData()\n{\n    Work().InitData();\n    Stati().pCurStatus = &Stati().aWaitForName;\n}\n\nvoid\nPE_Struct::TransferData()\n{\n    if (NOT Work().bIsPreDeclaration)\n    {\n        csv_assert(Work().sData_Name.size() > 0);\n        csv_assert(Work().nCurStruct.IsValid());\n    }\n    Stati().pCurStatus = &Stati().aNone;\n}\n\nvoid\nPE_Struct::ReceiveData()\n{\n    Stati().pCurStatus->On_SubPE_Left();\n}\n\nPE_Struct::S_Work::S_Work()\n    :   sData_Name(),\n        sData_TemplateParam(),\n        bIsPreDeclaration(false),\n        nCurStruct(0),\n        pPE_Element(0),\n        nCurParsed_ElementRef(0),\n        pPE_Type(0),\n        nCurParsed_Base(0)\n\n{\n    pPE_Element = new PE_StructElement(nCurParsed_ElementRef,nCurStruct,sData_TemplateParam);\n    pPE_Type = new PE_Type(nCurParsed_Base);\n}\n\nvoid\nPE_Struct::S_Work::InitData()\n{\n    sData_Name.clear();\n    sData_TemplateParam.clear();\n    bIsPreDeclaration = false;\n    nCurStruct = 0;\n    nCurParsed_ElementRef = 0;\n    nCurParsed_Base = 0;\n}\n\nvoid\nPE_Struct::S_Work::Prepare_PE_QualifiedName()\n{\n    nCurParsed_ElementRef = 0;\n}\n\nvoid\nPE_Struct::S_Work::Prepare_PE_Element()\n{\n    nCurParsed_Base = 0;\n}\n\nvoid\nPE_Struct::S_Work::Data_Set_Name( const char * i_sName )\n{\n    sData_Name = i_sName;\n}\n\nvoid\nPE_Struct::S_Work::Data_Set_TemplateParam( const char * i_sTemplateParam )\n{\n    sData_TemplateParam = i_sTemplateParam;\n}\n\nPE_Struct::S_Stati::S_Stati(PE_Struct & io_rStruct)\n    :   aNone(io_rStruct),\n        aWaitForName(io_rStruct),\n        aGotName(io_rStruct),\n        aWaitForTemplateParam(io_rStruct),\n        aWaitForTemplateEnd(io_rStruct),\n        aWaitForBase(io_rStruct),\n        aGotBase(io_rStruct),\n        aWaitForElement(io_rStruct),\n        aWaitForFinish(io_rStruct),\n        pCurStatus(0)\n{\n    pCurStatus = &aNone;\n}\n\n\n\/\/***********************       Stati       ***************************\/\/\n\n\nUnoIDL_PE &\nPE_Struct::PE_StructState::MyPE()\n{\n    return rStruct;\n}\n\n\nvoid\nPE_Struct::State_WaitForName::Process_Identifier( const TokIdentifier & i_rToken )\n{\n    Work().Data_Set_Name(i_rToken.Text());\n    MoveState( Stati().aGotName );\n    SetResult(done,stay);\n}\n\nvoid\nPE_Struct::State_GotName::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    if ( i_rToken.Id() != TokPunctuation::Semicolon )\n    {\n        switch (i_rToken.Id())\n        {\n            case TokPunctuation::Colon:\n                MoveState( Stati().aWaitForBase );\n                SetResult(done,push_sure,Work().pPE_Type.Ptr());\n                Work().Prepare_PE_QualifiedName();\n                break;\n            case TokPunctuation::CurledBracketOpen:\n                PE().store_Struct();\n                MoveState( Stati().aWaitForElement );\n                SetResult(done,stay);\n                break;\n            case TokPunctuation::Lesser:\n                MoveState( Stati().aWaitForTemplateParam );\n                SetResult(done,stay);\n                break;\n            default:\n                SetResult(not_done,pop_failure);\n        }   \/\/ end switch\n    }\n    else\n    {\n        Work().sData_Name.clear();\n        SetResult(done,pop_success);\n    }\n}\n\nvoid\nPE_Struct::State_WaitForTemplateParam::Process_Identifier( const TokIdentifier & i_rToken )\n{\n    Work().Data_Set_TemplateParam(i_rToken.Text());\n    MoveState( Stati().aWaitForTemplateEnd );\n    SetResult(done,stay);\n}\n\nvoid\nPE_Struct::State_WaitForTemplateEnd::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    \/\/ Assume:  TokPunctuation::Greater\n    MoveState( Stati().aGotName );\n    SetResult(done,stay);\n}\n\nvoid\nPE_Struct::State_WaitForBase::On_SubPE_Left()\n{\n    MoveState(Stati().aGotBase);\n}\n\nvoid\nPE_Struct::State_GotBase::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    if ( i_rToken.Id() == TokPunctuation::CurledBracketOpen )\n    {\n        PE().store_Struct();\n        MoveState( Stati().aWaitForElement );\n        SetResult(done,stay);\n    }\n    else\n    {\n        SetResult(not_done,pop_failure);\n    }\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_Identifier( const TokIdentifier & )\n{\n    SetResult( not_done, push_sure, Work().pPE_Element.Ptr() );\n    Work().Prepare_PE_Element();\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_NameSeparator()\n{\n    SetResult( not_done, push_sure, Work().pPE_Element.Ptr());\n    Work().Prepare_PE_Element();\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_BuiltInType( const TokBuiltInType & )\n{\n    SetResult( not_done, push_sure, Work().pPE_Element.Ptr());\n    Work().Prepare_PE_Element();\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_TypeModifier(const TokTypeModifier & )\n{\n    SetResult( not_done, push_sure, Work().pPE_Element.Ptr());\n    Work().Prepare_PE_Element();\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    if ( i_rToken.Id() == TokPunctuation::CurledBracketClose )\n    {\n        MoveState( Stati().aWaitForFinish );\n        SetResult( done, stay );\n    }\n    else\n    {\n        SetResult( not_done, pop_failure );\n    }\n}\n\nvoid\nPE_Struct::State_WaitForFinish::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    if (i_rToken.Id() == TokPunctuation::Semicolon)\n    {\n        MoveState( Stati().aNone );\n        SetResult( done, pop_success );\n    }\n    else\n    {\n        SetResult( not_done, pop_failure );\n    }\n}\n\nvoid\nPE_Struct::store_Struct()\n{\n    ary::idl::Struct &\n        rCe = Gate().Ces().Store_Struct(\n                        CurNamespace().CeId(),\n                        Work().sData_Name,\n                        Work().nCurParsed_Base,\n                        Work().sData_TemplateParam );\n    PassDocuAt(rCe);\n    Work().nCurStruct = rCe.CeId();\n}\n\n\n}   \/\/ namespace uidl\n}   \/\/ namespace csi\n<commit_msg>INTEGRATION: CWS warnings01 (1.4.4); FILE MERGED 2005\/10\/18 08:36:20 np 1.4.4.1: #i53898#<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: pe_struc.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 12:07:42 $\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 <s2_luidl\/pe_struc.hxx>\n\n\n\/\/ NOT FULLY DECLARED SERVICES\n#include <ary\/idl\/i_gate.hxx>\n#include <ary\/idl\/i_struct.hxx>\n#include <ary\/idl\/ip_ce.hxx>\n#include <ary_i\/codeinf2.hxx>\n#include <s2_luidl\/tk_ident.hxx>\n#include <s2_luidl\/tk_punct.hxx>\n#include <s2_luidl\/tk_keyw.hxx>\n#include <s2_luidl\/pe_type2.hxx>\n#include <s2_luidl\/pe_selem.hxx>\n\n\n\nnamespace csi\n{\nnamespace uidl\n{\n\n\nPE_Struct::PE_Struct()\n    \/\/ :    aWork,\n    \/\/      pStati\n{\n    pStati = new S_Stati(*this);\n}\n\nvoid\nPE_Struct::EstablishContacts( UnoIDL_PE *               io_pParentPE,\n                              ary::n22::Repository &            io_rRepository,\n                              TokenProcessing_Result &  o_rResult )\n{\n    UnoIDL_PE::EstablishContacts(io_pParentPE,io_rRepository,o_rResult);\n    Work().pPE_Element->EstablishContacts(this,io_rRepository,o_rResult);\n    Work().pPE_Type->EstablishContacts(this,io_rRepository,o_rResult);\n}\n\nPE_Struct::~PE_Struct()\n{\n}\n\nvoid\nPE_Struct::ProcessToken( const Token & i_rToken )\n{\n    i_rToken.Trigger(*Stati().pCurStatus);\n}\n\n\nvoid\nPE_Struct::InitData()\n{\n    Work().InitData();\n    Stati().pCurStatus = &Stati().aWaitForName;\n}\n\nvoid\nPE_Struct::TransferData()\n{\n    if (NOT Work().bIsPreDeclaration)\n    {\n        csv_assert(Work().sData_Name.size() > 0);\n        csv_assert(Work().nCurStruct.IsValid());\n    }\n    Stati().pCurStatus = &Stati().aNone;\n}\n\nvoid\nPE_Struct::ReceiveData()\n{\n    Stati().pCurStatus->On_SubPE_Left();\n}\n\nPE_Struct::S_Work::S_Work()\n    :   sData_Name(),\n        sData_TemplateParam(),\n        bIsPreDeclaration(false),\n        nCurStruct(0),\n        pPE_Element(0),\n        nCurParsed_ElementRef(0),\n        pPE_Type(0),\n        nCurParsed_Base(0)\n\n{\n    pPE_Element = new PE_StructElement(nCurParsed_ElementRef,nCurStruct,sData_TemplateParam);\n    pPE_Type = new PE_Type(nCurParsed_Base);\n}\n\nvoid\nPE_Struct::S_Work::InitData()\n{\n    sData_Name.clear();\n    sData_TemplateParam.clear();\n    bIsPreDeclaration = false;\n    nCurStruct = 0;\n    nCurParsed_ElementRef = 0;\n    nCurParsed_Base = 0;\n}\n\nvoid\nPE_Struct::S_Work::Prepare_PE_QualifiedName()\n{\n    nCurParsed_ElementRef = 0;\n}\n\nvoid\nPE_Struct::S_Work::Prepare_PE_Element()\n{\n    nCurParsed_Base = 0;\n}\n\nvoid\nPE_Struct::S_Work::Data_Set_Name( const char * i_sName )\n{\n    sData_Name = i_sName;\n}\n\nvoid\nPE_Struct::S_Work::Data_Set_TemplateParam( const char * i_sTemplateParam )\n{\n    sData_TemplateParam = i_sTemplateParam;\n}\n\nPE_Struct::S_Stati::S_Stati(PE_Struct & io_rStruct)\n    :   aNone(io_rStruct),\n        aWaitForName(io_rStruct),\n        aGotName(io_rStruct),\n        aWaitForTemplateParam(io_rStruct),\n        aWaitForTemplateEnd(io_rStruct),\n        aWaitForBase(io_rStruct),\n        aGotBase(io_rStruct),\n        aWaitForElement(io_rStruct),\n        aWaitForFinish(io_rStruct),\n        pCurStatus(0)\n{\n    pCurStatus = &aNone;\n}\n\n\n\/\/***********************       Stati       ***************************\/\/\n\n\nUnoIDL_PE &\nPE_Struct::PE_StructState::MyPE()\n{\n    return rStruct;\n}\n\n\nvoid\nPE_Struct::State_WaitForName::Process_Identifier( const TokIdentifier & i_rToken )\n{\n    Work().Data_Set_Name(i_rToken.Text());\n    MoveState( Stati().aGotName );\n    SetResult(done,stay);\n}\n\nvoid\nPE_Struct::State_GotName::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    if ( i_rToken.Id() != TokPunctuation::Semicolon )\n    {\n        switch (i_rToken.Id())\n        {\n            case TokPunctuation::Colon:\n                MoveState( Stati().aWaitForBase );\n                SetResult(done,push_sure,Work().pPE_Type.Ptr());\n                Work().Prepare_PE_QualifiedName();\n                break;\n            case TokPunctuation::CurledBracketOpen:\n                PE().store_Struct();\n                MoveState( Stati().aWaitForElement );\n                SetResult(done,stay);\n                break;\n            case TokPunctuation::Lesser:\n                MoveState( Stati().aWaitForTemplateParam );\n                SetResult(done,stay);\n                break;\n            default:\n                SetResult(not_done,pop_failure);\n        }   \/\/ end switch\n    }\n    else\n    {\n        Work().sData_Name.clear();\n        SetResult(done,pop_success);\n    }\n}\n\nvoid\nPE_Struct::State_WaitForTemplateParam::Process_Identifier( const TokIdentifier & i_rToken )\n{\n    Work().Data_Set_TemplateParam(i_rToken.Text());\n    MoveState( Stati().aWaitForTemplateEnd );\n    SetResult(done,stay);\n}\n\nvoid\nPE_Struct::State_WaitForTemplateEnd::Process_Punctuation( const TokPunctuation & )\n{\n    \/\/ Assume:  TokPunctuation::Greater\n    MoveState( Stati().aGotName );\n    SetResult(done,stay);\n}\n\nvoid\nPE_Struct::State_WaitForBase::On_SubPE_Left()\n{\n    MoveState(Stati().aGotBase);\n}\n\nvoid\nPE_Struct::State_GotBase::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    if ( i_rToken.Id() == TokPunctuation::CurledBracketOpen )\n    {\n        PE().store_Struct();\n        MoveState( Stati().aWaitForElement );\n        SetResult(done,stay);\n    }\n    else\n    {\n        SetResult(not_done,pop_failure);\n    }\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_Identifier( const TokIdentifier & )\n{\n    SetResult( not_done, push_sure, Work().pPE_Element.Ptr() );\n    Work().Prepare_PE_Element();\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_NameSeparator()\n{\n    SetResult( not_done, push_sure, Work().pPE_Element.Ptr());\n    Work().Prepare_PE_Element();\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_BuiltInType( const TokBuiltInType & )\n{\n    SetResult( not_done, push_sure, Work().pPE_Element.Ptr());\n    Work().Prepare_PE_Element();\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_TypeModifier(const TokTypeModifier & )\n{\n    SetResult( not_done, push_sure, Work().pPE_Element.Ptr());\n    Work().Prepare_PE_Element();\n}\n\nvoid\nPE_Struct::State_WaitForElement::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    if ( i_rToken.Id() == TokPunctuation::CurledBracketClose )\n    {\n        MoveState( Stati().aWaitForFinish );\n        SetResult( done, stay );\n    }\n    else\n    {\n        SetResult( not_done, pop_failure );\n    }\n}\n\nvoid\nPE_Struct::State_WaitForFinish::Process_Punctuation( const TokPunctuation & i_rToken )\n{\n    if (i_rToken.Id() == TokPunctuation::Semicolon)\n    {\n        MoveState( Stati().aNone );\n        SetResult( done, pop_success );\n    }\n    else\n    {\n        SetResult( not_done, pop_failure );\n    }\n}\n\nvoid\nPE_Struct::store_Struct()\n{\n    ary::idl::Struct &\n        rCe = Gate().Ces().Store_Struct(\n                        CurNamespace().CeId(),\n                        Work().sData_Name,\n                        Work().nCurParsed_Base,\n                        Work().sData_TemplateParam );\n    PassDocuAt(rCe);\n    Work().nCurStruct = rCe.CeId();\n}\n\n\n}   \/\/ namespace uidl\n}   \/\/ namespace csi\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdint>\n#include <immintrin.h>\n\nvoid jpeg_zigzag_avx512bw_permute16(const uint8_t* in, uint8_t* out) {\n    \n    const __m512i v = _mm512_loadu_si512((const __m512i*)in);\n\n    \/\/ crosslane 16-bit shuffle #1:\n    \/\/   [ 0, 1][ 2, 3][ 4, 5][ 8, 9][10,11][16,17][18,19][24,25] -- lane 0: missing: 32\n    \/\/   [ 6, 7][12,13][14,15][20,21][26,27][28,29][32,33][34,35] -- lane 1: missing: 19, 34, 40, 41, 48\n    \/\/   [22,23][30,31][36,37][42,43][44,45][48,49][50,51][56,57] -- lane 2: missing: 15, 29, 35\n    \/\/   [38,39][46,47][52,53][54,55][58,59][60,61][62,63][62,62] -- lane 3: missing: 31, 45\n    const int16_t crosslane_shuffle1[32] __attribute__((aligned(64))) = {\n         0,  1,  2,  4,  5,  8,  9, 12,\n         3,  6,  7, 10, 13, 14, 16, 17,\n        11, 15, 18, 21, 22, 24, 25, 28,\n        19, 23, 26, 27, 29, 30, 31, 31\n    };\n\n    const __m512i shuf1 = _mm512_permutexvar_epi16(_mm512_load_si512((__m512i*)crosslane_shuffle1), v);\n\n    \/\/ in-lane 8-bit shuffle #1\n    const int8_t inlane_shuffle1[64] __attribute__((aligned(64))) = {\n        \/* lane 0 *\/  0,  1,  6, 10,  7,  2,  3,  8, 11, 14, -1, 15, 12,  9,  4,  5,\n        \/* lane 1 *\/  2, -1,  8, 13, -1, -1, -1, 14,  9,  6,  3,  0,  1,  4,  7, 10,\n        \/* lane 2 *\/ -1,  6, 11, 14, 15, 12,  7,  4, -1,  0, -1,  1,  2,  5,  8, 13,\n        \/* lane 3 *\/  8,  9,  4, -1,  0, -1,  1,  2,  5, 10, 11,  6,  3,  7, 12, 13\n    };\n\n    const __m512i t0 = _mm512_shuffle_epi8(shuf1, _mm512_load_si512(inlane_shuffle1));\n\n    \/\/ crosslane 16-bit shuffle #2 -- we need to get values not available in step #1\n    \/\/   [32,33][32,33][32,33][32,33][32,33][32,33][32,33][32,33] -- lane 0: missing: 32\n    \/\/   [18,19][34,35][40,41][48,49][48,49][48,49][48,49][48,49] -- lane 1: missing: 19, 34, 40, 41, 48\n    \/\/   [14,15][28,29][34,35][34,35][34,35][34,35][34,35][34,35] -- lane 2: missing: 15, 29, 35\n    \/\/   [30,31][44,45][44,45][44,45][44,45][44,45][44,45][44,45] -- lane 2: missing: 31, 45\n    const int16_t crosslane_shuffle2[32] __attribute__((aligned(64))) = {\n        \/* lane 0*\/ 16, 16, 16, 16, 16, 16, 16, 16,\n        \/* lane 1*\/  9, 17, 20, 24, 24, 24, 24, 24,\n        \/* lane 2*\/  7, 14, 17, 17, 17, 17, 17, 17,\n        \/* lane 3*\/ 15, 22, 22, 22, 22, 22, 22, 22\n    };\n    const __m512i shuf2 = _mm512_permutexvar_epi16(_mm512_load_si512((__m512i*)crosslane_shuffle2), v);\n\n    \/\/ in-lane 8-bit shuffle #2\n    const int8_t inlane_shuffle2[64] __attribute__((aligned(64))) = {\n        \/* lane 0 *\/ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  0, -1, -1, -1, -1, -1,\n        \/* lane 1 *\/ -1,  1, -1, -1,  4,  6,  5,  2, -1, -1, -1, -1, -1, -1, -1, -1,\n        \/* lane 2 *\/  5, -1, -1, -1, -1, -1, -1, -1,  3, -1,  1, -1, -1, -1, -1, -1,\n        \/* lane 3 *\/ -1, -1, -1,  3, -1,  1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1\n    };\n\n    const __m512i t1 = _mm512_shuffle_epi8(shuf2, _mm512_load_si512(inlane_shuffle2));\n\n    const __m512i res = _mm512_or_si512(t0, t1);\n    _mm512_storeu_si512((__m512i*)out, res);\n}\n<commit_msg>Make constants static -- code become much smaller<commit_after>#include <cstdint>\n#include <immintrin.h>\n\nvoid jpeg_zigzag_avx512bw_permute16(const uint8_t* in, uint8_t* out) {\n    \n    const __m512i v = _mm512_loadu_si512((const __m512i*)in);\n\n    \/\/ crosslane 16-bit shuffle #1:\n    \/\/   [ 0, 1][ 2, 3][ 4, 5][ 8, 9][10,11][16,17][18,19][24,25] -- lane 0: missing: 32\n    \/\/   [ 6, 7][12,13][14,15][20,21][26,27][28,29][32,33][34,35] -- lane 1: missing: 19, 34, 40, 41, 48\n    \/\/   [22,23][30,31][36,37][42,43][44,45][48,49][50,51][56,57] -- lane 2: missing: 15, 29, 35\n    \/\/   [38,39][46,47][52,53][54,55][58,59][60,61][62,63][62,62] -- lane 3: missing: 31, 45\n    static const int16_t crosslane_shuffle1[32] __attribute__((aligned(64))) = {\n         0,  1,  2,  4,  5,  8,  9, 12,\n         3,  6,  7, 10, 13, 14, 16, 17,\n        11, 15, 18, 21, 22, 24, 25, 28,\n        19, 23, 26, 27, 29, 30, 31, 31\n    };\n\n    const __m512i shuf1 = _mm512_permutexvar_epi16(_mm512_load_si512((__m512i*)crosslane_shuffle1), v);\n\n    \/\/ in-lane 8-bit shuffle #1\n    static const int8_t inlane_shuffle1[64] __attribute__((aligned(64))) = {\n        \/* lane 0 *\/  0,  1,  6, 10,  7,  2,  3,  8, 11, 14, -1, 15, 12,  9,  4,  5,\n        \/* lane 1 *\/  2, -1,  8, 13, -1, -1, -1, 14,  9,  6,  3,  0,  1,  4,  7, 10,\n        \/* lane 2 *\/ -1,  6, 11, 14, 15, 12,  7,  4, -1,  0, -1,  1,  2,  5,  8, 13,\n        \/* lane 3 *\/  8,  9,  4, -1,  0, -1,  1,  2,  5, 10, 11,  6,  3,  7, 12, 13\n    };\n\n    const __m512i t0 = _mm512_shuffle_epi8(shuf1, _mm512_load_si512(inlane_shuffle1));\n\n    \/\/ crosslane 16-bit shuffle #2 -- we need to get values not available in step #1\n    \/\/   [32,33][32,33][32,33][32,33][32,33][32,33][32,33][32,33] -- lane 0: missing: 32\n    \/\/   [18,19][34,35][40,41][48,49][48,49][48,49][48,49][48,49] -- lane 1: missing: 19, 34, 40, 41, 48\n    \/\/   [14,15][28,29][34,35][34,35][34,35][34,35][34,35][34,35] -- lane 2: missing: 15, 29, 35\n    \/\/   [30,31][44,45][44,45][44,45][44,45][44,45][44,45][44,45] -- lane 2: missing: 31, 45\n    static const int16_t crosslane_shuffle2[32] __attribute__((aligned(64))) = {\n        \/* lane 0*\/ 16, 16, 16, 16, 16, 16, 16, 16,\n        \/* lane 1*\/  9, 17, 20, 24, 24, 24, 24, 24,\n        \/* lane 2*\/  7, 14, 17, 17, 17, 17, 17, 17,\n        \/* lane 3*\/ 15, 22, 22, 22, 22, 22, 22, 22\n    };\n    const __m512i shuf2 = _mm512_permutexvar_epi16(_mm512_load_si512((__m512i*)crosslane_shuffle2), v);\n\n    \/\/ in-lane 8-bit shuffle #2\n    static const int8_t inlane_shuffle2[64] __attribute__((aligned(64))) = {\n        \/* lane 0 *\/ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  0, -1, -1, -1, -1, -1,\n        \/* lane 1 *\/ -1,  1, -1, -1,  4,  6,  5,  2, -1, -1, -1, -1, -1, -1, -1, -1,\n        \/* lane 2 *\/  5, -1, -1, -1, -1, -1, -1, -1,  3, -1,  1, -1, -1, -1, -1, -1,\n        \/* lane 3 *\/ -1, -1, -1,  3, -1,  1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1\n    };\n\n    const __m512i t1 = _mm512_shuffle_epi8(shuf2, _mm512_load_si512(inlane_shuffle2));\n\n    const __m512i res = _mm512_or_si512(t0, t1);\n    _mm512_storeu_si512((__m512i*)out, res);\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\n#include <gtest\/gtest.h>\n\n#include <memory>\n#include <vector>\n\n#include \"SurgSim\/DataStructures\/Vertices.h\"\n#include \"SurgSim\/Framework\/Runtime.h\"\n#include \"SurgSim\/Framework\/Scene.h\"\n#include \"SurgSim\/Graphics\/OsgBoxRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgManager.h\"\n#include \"SurgSim\/Graphics\/OsgMaterial.h\"\n#include \"SurgSim\/Graphics\/OsgLight.h\"\n#include \"SurgSim\/Graphics\/OsgCurveRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgViewElement.h\"\n#include \"SurgSim\/Graphics\/RenderTests\/RenderTest.h\"\n#include \"SurgSim\/Math\/Quaternion.h\"\n#include \"SurgSim\/Math\/RigidTransform.h\"\n#include \"SurgSim\/Math\/Vector.h\"\n#include \"SurgSim\/Testing\/MathUtilities.h\"\n\n#include <osg\/LineWidth>\n#include <osg\/Hint>\n\nusing SurgSim::Math::Vector3d;\nusing SurgSim::Math::Vector4d;\nusing SurgSim::Math::Vector4f;\nusing SurgSim::Math::Quaterniond;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::makeRigidTransform;\nusing SurgSim::Math::makeRotationQuaternion;\n\nusing SurgSim::Testing::interpolate;\nusing SurgSim::Testing::interpolatePose;\n\nnamespace SurgSim\n{\nnamespace Graphics\n{\n\nstruct OsgCurveRepresentationRenderTests : public RenderTest\n{\n\n\nprotected:\n\tDataStructures::VerticesPlain makeCube()\n\t{\n\t\ttypedef DataStructures::VerticesPlain::VertexType Vertex;\n\t\tDataStructures::VerticesPlain result;\n\t\tresult.addVertex(Vertex(Vector3d(0.1, -0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(0.1, -0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(-0.1, -0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(-0.1, -0.1, -0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(0.1, -0.1, -0.1)));\n\n\t\tresult.addVertex(Vertex(Vector3d(0.1, 0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(-0.1, 0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(-0.1, 0.1, -0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(0.1, 0.1, -0.1)));\n\t\treturn result;\n\t}\n};\n\nTEST_F(OsgCurveRepresentationRenderTests, DynamicRotate)\n{\n\tauto element = std::make_shared<Framework::BasicSceneElement>(\"Element\");\n\tauto vertices = makeCube();\n\tauto representation = std::make_shared<OsgCurveRepresentation>(\"Curve\");\n\telement->addComponent(representation);\n\tscene->addSceneElement(element);\n\tviewElement->enableManipulator(true);\n\tviewElement->setPose(makeRigidTransform(\n\t\t\t\t\t\t\t Math::Vector3d(0.0, 0.0, -2.0),\n\t\t\t\t\t\t\t Math::Vector3d(0.0, 0.0, 0.0),\n\t\t\t\t\t\t\t Math::Vector3d(0.0, 1.0, 0.0)));\n\n\tauto material = buildMaterial(\"Shaders\/material_curve.vert\", \"Shaders\/material.frag\");\n\tmaterial->addUniform(\"vec4\", \"diffuseColor\");\n\tmaterial->setValue(\"diffuseColor\", Vector4f(0.2, 0.2, 0.9, 1.0));\n\n\tmaterial->addUniform(\"vec4\", \"specularColor\");\n\tmaterial->setValue(\"specularColor\", Vector4f(0.4, 0.4, 0.4, 1.0));\n\n\tmaterial->addUniform(\"float\", \"shininess\");\n\tmaterial->setValue(\"shininess\", 64.0f);\n\n\trepresentation->setMaterial(material);\n\telement->addComponent(material);\n\n\tauto light = std::make_shared<Graphics::OsgLight>(\"Light\");\n\t\/\/ light->setLocalPose(Math::makeRigidTranslation(Math::Vector3d(0.5, 0.5, 0.5)));\n\tviewElement->addComponent(light);\n\n\t\/\/\/ Run the thread\n\truntime->start();\n\tEXPECT_TRUE(graphicsManager->isInitialized());\n\tEXPECT_TRUE(viewElement->isInitialized());\n\tint numSteps = 10 * 60;\n\n\tauto widths = std::make_pair(0.1, 5.0);\n\tauto tensions = std::make_pair(0.1, 0.9);\n\n\tRigidTransform3d transform = makeRigidTransform(makeRotationQuaternion(0.02, Vector3d(0.0, 1.0, 1.0)),\n\t\t\t\t\t\t\t\t Vector3d(0.0, -0.0, 0.0));\n\n\tfor (int i = 0; i < numSteps; ++i)\n\t{\n\n\t\tdouble t = static_cast<double>(i) \/ numSteps;\n\t\tfor (size_t i = 0; i < vertices.getNumVertices(); ++i)\n\t\t{\n\t\t\tvertices.setVertexPosition(i, transform * vertices.getVertexPosition(i));\n\t\t}\n\n\n\t\trepresentation->setWidth(interpolate(widths.first, widths.second, t));\n\t\trepresentation->setTension(interpolate(tensions.first, tensions.second, t));\n\t\trepresentation->updateControlPoints(vertices);\n\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000.0 \/ 30.0));\n\t}\n\tboost::this_thread::sleep(boost::posix_time::milliseconds(100000));\n\n}\n\n\n}; \/\/ namespace Graphics\n}; \/\/ namespace SurgSim\n<commit_msg>Reduce sleep time after render test to 1 second (from 100).<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\n#include <gtest\/gtest.h>\n\n#include <memory>\n#include <vector>\n\n#include \"SurgSim\/DataStructures\/Vertices.h\"\n#include \"SurgSim\/Framework\/Runtime.h\"\n#include \"SurgSim\/Framework\/Scene.h\"\n#include \"SurgSim\/Graphics\/OsgBoxRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgManager.h\"\n#include \"SurgSim\/Graphics\/OsgMaterial.h\"\n#include \"SurgSim\/Graphics\/OsgLight.h\"\n#include \"SurgSim\/Graphics\/OsgCurveRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgViewElement.h\"\n#include \"SurgSim\/Graphics\/RenderTests\/RenderTest.h\"\n#include \"SurgSim\/Math\/Quaternion.h\"\n#include \"SurgSim\/Math\/RigidTransform.h\"\n#include \"SurgSim\/Math\/Vector.h\"\n#include \"SurgSim\/Testing\/MathUtilities.h\"\n\n#include <osg\/LineWidth>\n#include <osg\/Hint>\n\nusing SurgSim::Math::Vector3d;\nusing SurgSim::Math::Vector4d;\nusing SurgSim::Math::Vector4f;\nusing SurgSim::Math::Quaterniond;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::makeRigidTransform;\nusing SurgSim::Math::makeRotationQuaternion;\n\nusing SurgSim::Testing::interpolate;\nusing SurgSim::Testing::interpolatePose;\n\nnamespace SurgSim\n{\nnamespace Graphics\n{\n\nstruct OsgCurveRepresentationRenderTests : public RenderTest\n{\n\n\nprotected:\n\tDataStructures::VerticesPlain makeCube()\n\t{\n\t\ttypedef DataStructures::VerticesPlain::VertexType Vertex;\n\t\tDataStructures::VerticesPlain result;\n\t\tresult.addVertex(Vertex(Vector3d(0.1, -0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(0.1, -0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(-0.1, -0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(-0.1, -0.1, -0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(0.1, -0.1, -0.1)));\n\n\t\tresult.addVertex(Vertex(Vector3d(0.1, 0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(-0.1, 0.1, 0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(-0.1, 0.1, -0.1)));\n\t\tresult.addVertex(Vertex(Vector3d(0.1, 0.1, -0.1)));\n\t\treturn result;\n\t}\n};\n\nTEST_F(OsgCurveRepresentationRenderTests, DynamicRotate)\n{\n\tauto element = std::make_shared<Framework::BasicSceneElement>(\"Element\");\n\tauto vertices = makeCube();\n\tauto representation = std::make_shared<OsgCurveRepresentation>(\"Curve\");\n\telement->addComponent(representation);\n\tscene->addSceneElement(element);\n\tviewElement->enableManipulator(true);\n\tviewElement->setPose(makeRigidTransform(\n\t\t\t\t\t\t\t Math::Vector3d(0.0, 0.0, -2.0),\n\t\t\t\t\t\t\t Math::Vector3d(0.0, 0.0, 0.0),\n\t\t\t\t\t\t\t Math::Vector3d(0.0, 1.0, 0.0)));\n\n\tauto material = buildMaterial(\"Shaders\/material_curve.vert\", \"Shaders\/material.frag\");\n\tmaterial->addUniform(\"vec4\", \"diffuseColor\");\n\tmaterial->setValue(\"diffuseColor\", Vector4f(0.2, 0.2, 0.9, 1.0));\n\n\tmaterial->addUniform(\"vec4\", \"specularColor\");\n\tmaterial->setValue(\"specularColor\", Vector4f(0.4, 0.4, 0.4, 1.0));\n\n\tmaterial->addUniform(\"float\", \"shininess\");\n\tmaterial->setValue(\"shininess\", 64.0f);\n\n\trepresentation->setMaterial(material);\n\telement->addComponent(material);\n\n\tauto light = std::make_shared<Graphics::OsgLight>(\"Light\");\n\t\/\/ light->setLocalPose(Math::makeRigidTranslation(Math::Vector3d(0.5, 0.5, 0.5)));\n\tviewElement->addComponent(light);\n\n\t\/\/\/ Run the thread\n\truntime->start();\n\tEXPECT_TRUE(graphicsManager->isInitialized());\n\tEXPECT_TRUE(viewElement->isInitialized());\n\tint numSteps = 10 * 60;\n\n\tauto widths = std::make_pair(0.1, 5.0);\n\tauto tensions = std::make_pair(0.1, 0.9);\n\n\tRigidTransform3d transform = makeRigidTransform(makeRotationQuaternion(0.02, Vector3d(0.0, 1.0, 1.0)),\n\t\t\t\t\t\t\t\t Vector3d(0.0, -0.0, 0.0));\n\n\tfor (int i = 0; i < numSteps; ++i)\n\t{\n\n\t\tdouble t = static_cast<double>(i) \/ numSteps;\n\t\tfor (size_t i = 0; i < vertices.getNumVertices(); ++i)\n\t\t{\n\t\t\tvertices.setVertexPosition(i, transform * vertices.getVertexPosition(i));\n\t\t}\n\n\n\t\trepresentation->setWidth(interpolate(widths.first, widths.second, t));\n\t\trepresentation->setTension(interpolate(tensions.first, tensions.second, t));\n\t\trepresentation->updateControlPoints(vertices);\n\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000.0 \/ 30.0));\n\t}\n\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n\n}\n\n\n}; \/\/ namespace Graphics\n}; \/\/ namespace SurgSim\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#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#include <iterator>\n\n#include \"otbImage.h\"\n#include \"otbVectorData.h\"\n#include \"otbRadiometricMomentsImageFunction.h\"\n#include \"itkListSample.h\"\n#include \"itkFixedArray.h\"\n#include \"otbDescriptorsListSampleGenerator.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbVectorDataFileReader.h\"\n\nconst unsigned int Dimension = 2;\ntypedef int        LabelType;\ntypedef double     PixelType;\ntypedef double     FunctionPrecisionType;\ntypedef double     CoordRepType;\n\ntypedef otb::Image<PixelType, Dimension>                              ImageType;\ntypedef otb::VectorData<>                                             VectorDataType;\ntypedef otb::RadiometricMomentsImageFunction<ImageType, CoordRepType> FunctionType;\n\ntypedef FunctionType::OutputType                        SampleType;\ntypedef itk::Statistics::ListSample<SampleType>         ListSampleType;\ntypedef itk::FixedArray<LabelType, 1>                   LabelSampleType;\ntypedef itk::Statistics::ListSample<LabelSampleType>    LabelListSampleType;\n\ntypedef otb::DescriptorsListSampleGenerator\n           < ImageType,\n             VectorDataType,\n             ListSampleType,\n             LabelListSampleType,\n             FunctionPrecisionType,\n             CoordRepType > DescriptorsListSampleGeneratorType;\n\ntypedef otb::ImageFileReader<ImageType>           ImageReaderType;\ntypedef otb::VectorDataFileReader<VectorDataType> VectorDataReaderType;\n\ntypedef FunctionType::PointType PointType;\ntypedef DescriptorsListSampleGeneratorType::SamplesPositionType SamplesPositionType;\n\n\nstruct SampleEntry\n{\n  PointType  position;\n  LabelType  label;\n  SampleType measurement;\n};\n\nstruct CompareSampleEntry\n{\n  bool operator () (SampleEntry p, SampleEntry q)\n  {\n    \/\/ order with the y axis position\n    if (p.position[1] < q.position[1])\n      return true;\n    if (p.position[1] > q.position[1])\n      return false;\n\n    \/\/ If one the same line,\n    \/\/ order with the x axis position\n    if (p.position[0] < q.position[0])\n      return true;\n\n    return false;\n  }\n};\n\nostream &operator<<(ostream &stream, SampleEntry entry)\n{\n  stream << \"---\" << std::endl\n         << \"Label        : \" << entry.label << std::endl\n         << \"Position     : \" << entry.position << std::endl\n         << \"Measurements : \" << entry.measurement;\n  return stream;\n}\n\nint otbDescriptorsListSampleGeneratorNew(int itkNotUsed(argc), char* itkNotUsed(argv)[])\n{\n  \/\/ instantiation\n  DescriptorsListSampleGeneratorType::Pointer generator = DescriptorsListSampleGeneratorType::New();\n\n  std::cout << generator << std::endl;\n\n  return EXIT_SUCCESS;\n}\n\nint otbDescriptorsListSampleGenerator(int argc, char* argv[])\n{\n  if (argc != 5)\n    {\n    std::cerr << \"Wrong number of arguments\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  const char* inputImageFileName = argv[1];\n  const char* inputSamplesLocation = argv[2];\n  const char* outputFileName = argv[3];\n  int streaming = atoi(argv[4]);\n\n  ImageReaderType::Pointer imageReader = ImageReaderType::New();\n  imageReader->SetFileName(inputImageFileName);\n\n  VectorDataReaderType::Pointer vectorDataReader = VectorDataReaderType::New();\n  vectorDataReader->SetFileName(inputSamplesLocation);\n\n  \/\/imageReader->Update();\n  \/\/vectorDataReader->Update();\n\n  FunctionType::Pointer descriptorsFunction = FunctionType::New();\n  descriptorsFunction->SetInputImage(imageReader->GetOutput());\n  descriptorsFunction->SetNeighborhoodRadius(5);\n\n  DescriptorsListSampleGeneratorType::Pointer descriptorsGenerator = DescriptorsListSampleGeneratorType::New();\n  descriptorsGenerator->SetInputImage(imageReader->GetOutput());\n  descriptorsGenerator->SetSamplesLocations(vectorDataReader->GetOutput());\n  descriptorsGenerator->SetDescriptorsFunction(descriptorsFunction.GetPointer());\n  descriptorsGenerator->SetNeighborhoodRadius(5);\n\n  if (streaming == 0)\n    {\n    descriptorsGenerator->GetStreamer()->SetNumberOfStreamDivisions(1);\n    }\n  else\n    {\n    descriptorsGenerator->GetStreamer()->SetNumberOfStreamDivisions(streaming);\n    }\n\n  descriptorsGenerator->Update();\n\n\n  ListSampleType::Pointer      samples = descriptorsGenerator->GetListSample();\n  LabelListSampleType::Pointer labels  = descriptorsGenerator->GetLabelListSample();\n  SamplesPositionType&         positions = descriptorsGenerator->GetSamplesPositions();\n\n  ListSampleType::Iterator sampleIt = samples->Begin();\n  LabelListSampleType::Iterator labelIt = labels->Begin();\n  SamplesPositionType::const_iterator posIt = positions.begin();\n\n  ListSampleType::Iterator sampleEnd = samples->End();\n  LabelListSampleType::Iterator labelEnd = labels->End();\n  SamplesPositionType::const_iterator posEnd = positions.end();\n\n  std::vector<SampleEntry> entries;\n\n  while (sampleIt != sampleEnd && labelIt != labelEnd && posIt != posEnd)\n    {\n    SampleEntry entry;\n    entry.position = *posIt;\n    entry.label = labelIt.GetMeasurementVector()[0];\n    entry.measurement = sampleIt.GetMeasurementVector();\n\n    entries.push_back(entry);\n\n    ++sampleIt;\n    ++labelIt;\n    ++posIt;\n    }\n\n  std::sort(entries.begin(), entries.end(), CompareSampleEntry());\n  std::ofstream file(outputFileName);\n  std::copy(entries.begin(), entries.end(), std::ostream_iterator<SampleEntry>(file, \"\\n\"));\n  file.close();\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>COMP : correct the test due to class changes<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#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#include <iterator>\n\n#include \"otbImage.h\"\n#include \"otbVectorData.h\"\n#include \"otbRadiometricMomentsImageFunction.h\"\n#include \"itkListSample.h\"\n#include \"itkFixedArray.h\"\n#include \"itkVariableLengthVector.h\"\n#include \"otbDescriptorsListSampleGenerator.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbVectorDataFileReader.h\"\n#include \"otbImageFunctionAdapter.h\"\n\nconst unsigned int Dimension = 2;\ntypedef int        LabelType;\ntypedef double     PixelType;\ntypedef double     FunctionPrecisionType;\ntypedef double     CoordRepType;\n\ntypedef otb::Image<PixelType, Dimension>                              ImageType;\ntypedef otb::VectorData<>                                             VectorDataType;\ntypedef otb::RadiometricMomentsImageFunction<ImageType, CoordRepType> FunctionType;\n  typedef otb::ImageFunctionAdapter\n    <ImageType,FunctionType>                                          AdapatedFunctionType;\n\n\/\/typedef FunctionType::OutputType                      SampleType;\ntypedef itk::VariableLengthVector<CoordRepType>         SampleType;\ntypedef itk::Statistics::ListSample<SampleType>         ListSampleType;\ntypedef itk::FixedArray<LabelType>                      LabelSampleType;\ntypedef itk::Statistics::ListSample<LabelSampleType>    LabelListSampleType;\n\ntypedef otb::DescriptorsListSampleGenerator\n           < ImageType,\n             VectorDataType,\n             ListSampleType,\n             LabelListSampleType,\n             FunctionPrecisionType,\n             CoordRepType > DescriptorsListSampleGeneratorType;\n\ntypedef otb::ImageFileReader<ImageType>           ImageReaderType;\ntypedef otb::VectorDataFileReader<VectorDataType> VectorDataReaderType;\n\ntypedef FunctionType::PointType PointType;\ntypedef DescriptorsListSampleGeneratorType::SamplesPositionType SamplesPositionType;\n\n\nstruct SampleEntry\n{\n  PointType  position;\n  LabelType  label;\n  SampleType measurement;\n};\n\nstruct CompareSampleEntry\n{\n  bool operator () (SampleEntry p, SampleEntry q)\n  {\n    \/\/ order with the y axis position\n    if (p.position[1] < q.position[1])\n      return true;\n    if (p.position[1] > q.position[1])\n      return false;\n\n    \/\/ If one the same line,\n    \/\/ order with the x axis position\n    if (p.position[0] < q.position[0])\n      return true;\n\n    return false;\n  }\n};\n\nostream &operator<<(ostream &stream, SampleEntry entry)\n{\n  stream << \"---\" << std::endl\n         << \"Label        : \" << entry.label << std::endl\n         << \"Position     : \" << entry.position << std::endl\n         << \"Measurements : \" << entry.measurement;\n  return stream;\n}\n\nint otbDescriptorsListSampleGeneratorNew(int itkNotUsed(argc), char* itkNotUsed(argv)[])\n{\n  \/\/ instantiation\n  DescriptorsListSampleGeneratorType::Pointer generator = DescriptorsListSampleGeneratorType::New();\n\n  std::cout << generator << std::endl;\n\n  return EXIT_SUCCESS;\n}\n\nint otbDescriptorsListSampleGenerator(int argc, char* argv[])\n{\n  if (argc != 5)\n    {\n    std::cerr << \"Wrong number of arguments\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  const char* inputImageFileName = argv[1];\n  const char* inputSamplesLocation = argv[2];\n  const char* outputFileName = argv[3];\n  int streaming = atoi(argv[4]);\n\n  ImageReaderType::Pointer imageReader = ImageReaderType::New();\n  imageReader->SetFileName(inputImageFileName);\n\n  VectorDataReaderType::Pointer vectorDataReader = VectorDataReaderType::New();\n  vectorDataReader->SetFileName(inputSamplesLocation);\n\n  \/\/imageReader->Update();\n  \/\/vectorDataReader->Update();\n\n  AdapatedFunctionType::Pointer descriptorsFunction = AdapatedFunctionType::New();\n  descriptorsFunction->SetInputImage(imageReader->GetOutput());\n  descriptorsFunction->GetImageFunction()->SetNeighborhoodRadius(5);\n\n  DescriptorsListSampleGeneratorType::Pointer descriptorsGenerator = DescriptorsListSampleGeneratorType::New();\n  descriptorsGenerator->SetInputImage(imageReader->GetOutput());\n  descriptorsGenerator->SetSamplesLocations(vectorDataReader->GetOutput());\n  descriptorsGenerator->SetDescriptorsFunction(descriptorsFunction.GetPointer());\n  descriptorsGenerator->SetNeighborhoodRadius(5);\n\n  if (streaming == 0)\n    {\n    descriptorsGenerator->GetStreamer()->SetNumberOfStreamDivisions(1);\n    }\n  else\n    {\n    descriptorsGenerator->GetStreamer()->SetNumberOfStreamDivisions(streaming);\n    }\n\n  descriptorsGenerator->Update();\n\n\n  ListSampleType::Pointer      samples = descriptorsGenerator->GetListSample();\n  LabelListSampleType::Pointer labels  = descriptorsGenerator->GetLabelListSample();\n  SamplesPositionType&         positions = descriptorsGenerator->GetSamplesPositions();\n\n  ListSampleType::Iterator sampleIt = samples->Begin();\n  LabelListSampleType::Iterator labelIt = labels->Begin();\n  SamplesPositionType::const_iterator posIt = positions.begin();\n\n  ListSampleType::Iterator sampleEnd = samples->End();\n  LabelListSampleType::Iterator labelEnd = labels->End();\n  SamplesPositionType::const_iterator posEnd = positions.end();\n\n  std::vector<SampleEntry> entries;\n\n  while (sampleIt != sampleEnd && labelIt != labelEnd && posIt != posEnd)\n    {\n    SampleEntry entry;\n    entry.position = *posIt;\n    entry.label = labelIt.GetMeasurementVector()[0];\n    entry.measurement = sampleIt.GetMeasurementVector();\n\n    entries.push_back(entry);\n\n    ++sampleIt;\n    ++labelIt;\n    ++posIt;\n    }\n\n  std::sort(entries.begin(), entries.end(), CompareSampleEntry());\n  std::ofstream file(outputFileName);\n  std::copy(entries.begin(), entries.end(), std::ostream_iterator<SampleEntry>(file, \"\\n\"));\n  file.close();\n\n  return EXIT_SUCCESS;\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\/file_descriptor_shuffle.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing base::InjectiveMultimap;\nusing base::InjectionArc;\nusing base::PerformInjectiveMultimap;\nusing base::InjectionDelegate;\n\nnamespace {\ntypedef testing::Test FileDescriptorShuffleTest;\n}\n\n\/\/ 'Duplicated' file descriptors start at this number\nstatic const int kDuplicateBase = 1000;\n\nstruct Action {\n  enum Type {\n    CLOSE,\n    MOVE,\n    DUPLICATE,\n  };\n\n  Action(Type in_type, int in_fd1, int in_fd2 = -1)\n      : type(in_type),\n        fd1(in_fd1),\n        fd2(in_fd2) {\n  }\n\n  bool operator==(const Action& other) const {\n    return other.type == type &&\n           other.fd1 == fd1 &&\n           other.fd2 == fd2;\n  }\n\n  Type type;\n  int fd1;\n  int fd2;\n};\n\nclass InjectionTracer : public InjectionDelegate {\n public:\n  InjectionTracer()\n      : next_duplicate_(kDuplicateBase) {\n  }\n\n  bool Duplicate(int* result, int fd) {\n    *result = next_duplicate_++;\n    actions_.push_back(Action(Action::DUPLICATE, *result, fd));\n    return true;\n  }\n\n  bool Move(int src, int dest) {\n    actions_.push_back(Action(Action::MOVE, src, dest));\n    return true;\n  }\n\n  void Close(int fd) {\n    actions_.push_back(Action(Action::CLOSE, fd));\n  }\n\n  const std::vector<Action>& actions() const { return actions_; }\n\n private:\n  int next_duplicate_;\n  std::vector<Action> actions_;\n};\n\nTEST(FileDescriptorShuffleTest, Empty) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(0u, tracer.actions().size());\n}\n\nTEST(FileDescriptorShuffleTest, Noop) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 0, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(0u, tracer.actions().size());\n}\n\nTEST(FileDescriptorShuffleTest, NoopAndClose) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 0, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(0u, tracer.actions().size());\n}\n\nTEST(FileDescriptorShuffleTest, Simple1) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(1u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n}\n\nTEST(FileDescriptorShuffleTest, Simple2) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(2, 3, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(2u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 2, 3));\n}\n\nTEST(FileDescriptorShuffleTest, Simple3) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(2u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::CLOSE, 0));\n}\n\nTEST(FileDescriptorShuffleTest, Simple4) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(10, 0, true));\n  map.push_back(InjectionArc(1, 1, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(2u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 10, 0));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::CLOSE, 10));\n}\n\nTEST(FileDescriptorShuffleTest, Cycle) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(1, 0, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(4u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] ==\n              Action(Action::DUPLICATE, kDuplicateBase, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::MOVE, kDuplicateBase, 0));\n  EXPECT_TRUE(tracer.actions()[3] == Action(Action::CLOSE, kDuplicateBase));\n}\n\nTEST(FileDescriptorShuffleTest, CycleAndClose1) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n  map.push_back(InjectionArc(1, 0, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(4u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] ==\n              Action(Action::DUPLICATE, kDuplicateBase, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::MOVE, kDuplicateBase, 0));\n  EXPECT_TRUE(tracer.actions()[3] == Action(Action::CLOSE, kDuplicateBase));\n}\n\nTEST(FileDescriptorShuffleTest, CycleAndClose2) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(1, 0, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(4u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] ==\n              Action(Action::DUPLICATE, kDuplicateBase, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::MOVE, kDuplicateBase, 0));\n  EXPECT_TRUE(tracer.actions()[3] == Action(Action::CLOSE, kDuplicateBase));\n}\n\nTEST(FileDescriptorShuffleTest, CycleAndClose3) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n  map.push_back(InjectionArc(1, 0, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(4u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] ==\n              Action(Action::DUPLICATE, kDuplicateBase, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::MOVE, kDuplicateBase, 0));\n  EXPECT_TRUE(tracer.actions()[3] == Action(Action::CLOSE, kDuplicateBase));\n}\n\nTEST(FileDescriptorShuffleTest, Fanout) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(0, 2, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(2u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 2));\n}\n\nTEST(FileDescriptorShuffleTest, FanoutAndClose1) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n  map.push_back(InjectionArc(0, 2, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(3u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 2));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::CLOSE, 0));\n}\n\nTEST(FileDescriptorShuffleTest, FanoutAndClose2) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(0, 2, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(3u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 2));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::CLOSE, 0));\n}\n\nTEST(FileDescriptorShuffleTest, FanoutAndClose3) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n  map.push_back(InjectionArc(0, 2, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(3u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 2));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::CLOSE, 0));\n}\n\nclass FailingDelegate : public InjectionDelegate {\n public:\n  bool Duplicate(int* result, int fd) {\n    return false;\n  }\n\n  bool Move(int src, int dest) {\n    return false;\n  }\n\n  void Close(int fd) {\n  }\n};\n\nTEST(FileDescriptorShuffleTest, EmptyWithFailure) {\n  InjectiveMultimap map;\n  FailingDelegate failing;\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &failing));\n}\n\nTEST(FileDescriptorShuffleTest, NoopWithFailure) {\n  InjectiveMultimap map;\n  FailingDelegate failing;\n  map.push_back(InjectionArc(0, 0, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &failing));\n}\n\nTEST(FileDescriptorShuffleTest, Simple1WithFailure) {\n  InjectiveMultimap map;\n  FailingDelegate failing;\n  map.push_back(InjectionArc(0, 1, false));\n\n  EXPECT_FALSE(PerformInjectiveMultimap(map, &failing));\n}\n<commit_msg>Use ASSERT_EQ instead of EXPECT_EQ to avoid accessing invalid index in the following tests.<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\/file_descriptor_shuffle.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing base::InjectiveMultimap;\nusing base::InjectionArc;\nusing base::PerformInjectiveMultimap;\nusing base::InjectionDelegate;\n\nnamespace {\ntypedef testing::Test FileDescriptorShuffleTest;\n}\n\n\/\/ 'Duplicated' file descriptors start at this number\nstatic const int kDuplicateBase = 1000;\n\nstruct Action {\n  enum Type {\n    CLOSE,\n    MOVE,\n    DUPLICATE,\n  };\n\n  Action(Type in_type, int in_fd1, int in_fd2 = -1)\n      : type(in_type),\n        fd1(in_fd1),\n        fd2(in_fd2) {\n  }\n\n  bool operator==(const Action& other) const {\n    return other.type == type &&\n           other.fd1 == fd1 &&\n           other.fd2 == fd2;\n  }\n\n  Type type;\n  int fd1;\n  int fd2;\n};\n\nclass InjectionTracer : public InjectionDelegate {\n public:\n  InjectionTracer()\n      : next_duplicate_(kDuplicateBase) {\n  }\n\n  bool Duplicate(int* result, int fd) {\n    *result = next_duplicate_++;\n    actions_.push_back(Action(Action::DUPLICATE, *result, fd));\n    return true;\n  }\n\n  bool Move(int src, int dest) {\n    actions_.push_back(Action(Action::MOVE, src, dest));\n    return true;\n  }\n\n  void Close(int fd) {\n    actions_.push_back(Action(Action::CLOSE, fd));\n  }\n\n  const std::vector<Action>& actions() const { return actions_; }\n\n private:\n  int next_duplicate_;\n  std::vector<Action> actions_;\n};\n\nTEST(FileDescriptorShuffleTest, Empty) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(0u, tracer.actions().size());\n}\n\nTEST(FileDescriptorShuffleTest, Noop) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 0, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(0u, tracer.actions().size());\n}\n\nTEST(FileDescriptorShuffleTest, NoopAndClose) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 0, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  EXPECT_EQ(0u, tracer.actions().size());\n}\n\nTEST(FileDescriptorShuffleTest, Simple1) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(1u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n}\n\nTEST(FileDescriptorShuffleTest, Simple2) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(2, 3, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(2u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 2, 3));\n}\n\nTEST(FileDescriptorShuffleTest, Simple3) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(2u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::CLOSE, 0));\n}\n\nTEST(FileDescriptorShuffleTest, Simple4) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(10, 0, true));\n  map.push_back(InjectionArc(1, 1, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(2u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 10, 0));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::CLOSE, 10));\n}\n\nTEST(FileDescriptorShuffleTest, Cycle) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(1, 0, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(4u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] ==\n              Action(Action::DUPLICATE, kDuplicateBase, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::MOVE, kDuplicateBase, 0));\n  EXPECT_TRUE(tracer.actions()[3] == Action(Action::CLOSE, kDuplicateBase));\n}\n\nTEST(FileDescriptorShuffleTest, CycleAndClose1) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n  map.push_back(InjectionArc(1, 0, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(4u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] ==\n              Action(Action::DUPLICATE, kDuplicateBase, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::MOVE, kDuplicateBase, 0));\n  EXPECT_TRUE(tracer.actions()[3] == Action(Action::CLOSE, kDuplicateBase));\n}\n\nTEST(FileDescriptorShuffleTest, CycleAndClose2) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(1, 0, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(4u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] ==\n              Action(Action::DUPLICATE, kDuplicateBase, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::MOVE, kDuplicateBase, 0));\n  EXPECT_TRUE(tracer.actions()[3] == Action(Action::CLOSE, kDuplicateBase));\n}\n\nTEST(FileDescriptorShuffleTest, CycleAndClose3) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n  map.push_back(InjectionArc(1, 0, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(4u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] ==\n              Action(Action::DUPLICATE, kDuplicateBase, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::MOVE, kDuplicateBase, 0));\n  EXPECT_TRUE(tracer.actions()[3] == Action(Action::CLOSE, kDuplicateBase));\n}\n\nTEST(FileDescriptorShuffleTest, Fanout) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(0, 2, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(2u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 2));\n}\n\nTEST(FileDescriptorShuffleTest, FanoutAndClose1) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n  map.push_back(InjectionArc(0, 2, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(3u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 2));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::CLOSE, 0));\n}\n\nTEST(FileDescriptorShuffleTest, FanoutAndClose2) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, false));\n  map.push_back(InjectionArc(0, 2, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(3u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 2));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::CLOSE, 0));\n}\n\nTEST(FileDescriptorShuffleTest, FanoutAndClose3) {\n  InjectiveMultimap map;\n  InjectionTracer tracer;\n  map.push_back(InjectionArc(0, 1, true));\n  map.push_back(InjectionArc(0, 2, true));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &tracer));\n  ASSERT_EQ(3u, tracer.actions().size());\n  EXPECT_TRUE(tracer.actions()[0] == Action(Action::MOVE, 0, 1));\n  EXPECT_TRUE(tracer.actions()[1] == Action(Action::MOVE, 0, 2));\n  EXPECT_TRUE(tracer.actions()[2] == Action(Action::CLOSE, 0));\n}\n\nclass FailingDelegate : public InjectionDelegate {\n public:\n  bool Duplicate(int* result, int fd) {\n    return false;\n  }\n\n  bool Move(int src, int dest) {\n    return false;\n  }\n\n  void Close(int fd) {\n  }\n};\n\nTEST(FileDescriptorShuffleTest, EmptyWithFailure) {\n  InjectiveMultimap map;\n  FailingDelegate failing;\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &failing));\n}\n\nTEST(FileDescriptorShuffleTest, NoopWithFailure) {\n  InjectiveMultimap map;\n  FailingDelegate failing;\n  map.push_back(InjectionArc(0, 0, false));\n\n  EXPECT_TRUE(PerformInjectiveMultimap(map, &failing));\n}\n\nTEST(FileDescriptorShuffleTest, Simple1WithFailure) {\n  InjectiveMultimap map;\n  FailingDelegate failing;\n  map.push_back(InjectionArc(0, 1, false));\n\n  EXPECT_FALSE(PerformInjectiveMultimap(map, &failing));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hf_title.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 17:56:37 $\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 ADC_DISPLAY_HF_TITLE_HXX\n#define ADC_DISPLAY_HF_TITLE_HXX\n\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include <toolkit\/htmlfactory.hxx>\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n\n\nclass HF_TitleTable : public HtmlMaker\n{\n  public:\n                        HF_TitleTable(\n                            Xml::Element &      o_rOut );\n    virtual             ~HF_TitleTable();\n\n    void                Produce_Title(\n                            const char *        i_title );\n    \/\/\/ @return a Html::TableCell reference.\n    Xml::Element &      Add_Row();\n};\n\n\nclass HF_SubTitleTable : public HtmlMaker\n{\n  public:\n    enum E_SubLevel\n    {\n        sublevel_1,     \/\/\/ Big title.\n        sublevel_2,     \/\/\/ Small title.\n        sublevel_3      \/\/\/ No title.\n    };\n\n    \/** @param i_nColumns [1 .. n]\n        @param i_nSubTitleLevel [1 .. 2]\n        1 is a bit bigger than 2.\n    *\/\n\n                        HF_SubTitleTable(\n                            Xml::Element &      o_rOut,\n                            const String &      i_label,\n                            const String &      i_title,\n                            int                 i_nColumns,\n                            E_SubLevel          i_eSubTitleLevel = sublevel_1 );\n    virtual             ~HF_SubTitleTable();\n\n    \/\/\/ @return an Html::TableRow reference.\n    Xml::Element &      Add_Row();\n};\n\n\n\/\/ IMPLEMENTATION\n\n\n\n#endif\n<commit_msg>INTEGRATION: CWS adc14 (1.3.22); FILE MERGED 2006\/04\/27 09:43:31 np 1.3.22.1: #i62433#, Combine See Also tags, put deprecated and unpublished into title line.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hf_title.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2006-05-03 16:57: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 ADC_DISPLAY_HF_TITLE_HXX\n#define ADC_DISPLAY_HF_TITLE_HXX\n\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include <toolkit\/htmlfactory.hxx>\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n\n\nclass HF_TitleTable : public HtmlMaker\n{\n  public:\n                        HF_TitleTable(\n                            Xml::Element &      o_rOut );\n    virtual             ~HF_TitleTable();\n\n    void                Produce_Title(\n                            const char *        i_title );\n    void                Produce_Title(\n                            const char *        i_annotations,\n\/\/                            const char *        i_label,\n                            const char *        i_title );\n\n    \/\/\/ @return a Html::TableCell reference.\n    Xml::Element &      Add_Row();\n};\n\n\nclass HF_SubTitleTable : public HtmlMaker\n{\n  public:\n    enum E_SubLevel\n    {\n        sublevel_1,     \/\/\/ Big title.\n        sublevel_2,     \/\/\/ Small title.\n        sublevel_3      \/\/\/ No title.\n    };\n\n    \/** @param i_nColumns [1 .. n]\n        @param i_nSubTitleLevel [1 .. 2]\n        1 is a bit bigger than 2.\n    *\/\n\n                        HF_SubTitleTable(\n                            Xml::Element &      o_rOut,\n                            const String &      i_label,\n                            const String &      i_title,\n                            int                 i_nColumns,\n                            E_SubLevel          i_eSubTitleLevel = sublevel_1 );\n    virtual             ~HF_SubTitleTable();\n\n    \/\/\/ @return an Html::TableRow reference.\n    Xml::Element &      Add_Row();\n};\n\n\n\/\/ IMPLEMENTATION\n\n\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 \"chrome\/browser\/profiles\/profile_info_cache.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/testing_browser_process.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n\n\/\/ This file contains tests for the ProfileManager that require a heavyweight\n\/\/ InProcessBrowserTest.  These include tests involving profile deletion.\n\n\/\/ TODO(jeremy): crbug.com\/103355 - These tests should be enabled on all\n\/\/ platforms.\n#if defined(OS_MACOSX)\nclass ProfileManagerBrowserTest : public InProcessBrowserTest {\n protected:\n  \/\/ An observer that returns back to test code after a new profile\n  \/\/ is initialized.\n  class BlockOnProfileInitObserver : public ProfileManagerObserver {\n   public:\n    void OnProfileCreated(Profile* profile, Status status) {\n      if (status == ProfileManagerObserver::STATUS_INITIALIZED) {\n        MessageLoop::current()->Quit();\n      }\n    }\n  };\n};\n\n\/\/ Delete single profile and make sure a new one is created.\nIN_PROC_BROWSER_TEST_F(ProfileManagerBrowserTest, DeleteSingletonProfile) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  ProfileInfoCache& cache = profile_manager->GetProfileInfoCache();\n\n  \/\/ We should start out with 1 profile.\n  ASSERT_EQ(cache.GetNumberOfProfiles(), 1U);\n\n  \/\/ Delete singleton profile.\n  FilePath singleton_profile_path = cache.GetPathOfProfileAtIndex(0);\n  EXPECT_FALSE(singleton_profile_path.empty());\n  profile_manager->ScheduleProfileForDeletion(singleton_profile_path);\n\n  \/\/ Spin things till profile is actually deleted.\n  ui_test_utils::RunAllPendingInMessageLoop();\n\n  \/\/ Make sure a new profile was created automatically.\n  EXPECT_EQ(cache.GetNumberOfProfiles(), 1U);\n  FilePath new_profile_path = cache.GetPathOfProfileAtIndex(0);\n  EXPECT_NE(new_profile_path, singleton_profile_path);\n\n  \/\/ Make sure that last used profile preference is set correctly.\n  Profile* last_used = ProfileManager::GetLastUsedProfile();\n  EXPECT_EQ(new_profile_path, last_used->GetPath());\n}\n\n\/\/ Delete all profiles in a multi profile setup and make sure a new one is\n\/\/ created.\n\n#if defined(OS_MACOSX)\n\/\/ See crbug.com\/104851\n#define MAYBE_DeleteAllProfiles FLAKY_DeleteAllProfiles\n#else\n#define MAYBE_DeleteAllProfiles DeleteAllProfiles\n#endif\n\nIN_PROC_BROWSER_TEST_F(ProfileManagerBrowserTest, MAYBE_DeleteAllProfiles) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  ProfileInfoCache& cache = profile_manager->GetProfileInfoCache();\n\n  \/\/ Create an additional profile.\n  BlockOnProfileInitObserver observer;\n  FilePath new_path = profile_manager->GenerateNextProfileDirectoryPath();\n  profile_manager->CreateProfileAsync(new_path, &observer);\n\n  \/\/ Spin to allow profile creation to take place, loop is terminated\n  \/\/ by BlockOnProfileInitObserver when the profile is created.\n  ui_test_utils::RunMessageLoop();\n\n  ASSERT_EQ(cache.GetNumberOfProfiles(), 2U);\n\n  \/\/ Delete all profiles.\n  FilePath profile_path1 = cache.GetPathOfProfileAtIndex(0);\n  FilePath profile_path2 = cache.GetPathOfProfileAtIndex(1);\n  EXPECT_FALSE(profile_path1.empty());\n  EXPECT_FALSE(profile_path2.empty());\n  profile_manager->ScheduleProfileForDeletion(profile_path1);\n  profile_manager->ScheduleProfileForDeletion(profile_path2);\n\n  \/\/ Spin things so deletion can take place.\n  ui_test_utils::RunAllPendingInMessageLoop();\n\n  \/\/ Make sure a new profile was created automatically.\n  EXPECT_EQ(cache.GetNumberOfProfiles(), 1U);\n  FilePath new_profile_path = cache.GetPathOfProfileAtIndex(0);\n  EXPECT_NE(new_profile_path, profile_path1);\n  EXPECT_NE(new_profile_path, profile_path2);\n\n  \/\/ Make sure that last used profile preference is set correctly.\n  Profile* last_used = ProfileManager::GetLastUsedProfile();\n  EXPECT_EQ(new_profile_path, last_used->GetPath());\n}\n#endif \/\/ OS_MACOSX\n<commit_msg>Revert 111358 - Marking ProfileManagerBrowserTest.DeleteAllProfiles as flaky on mac.<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\/profiles\/profile_info_cache.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/testing_browser_process.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n\n\/\/ This file contains tests for the ProfileManager that require a heavyweight\n\/\/ InProcessBrowserTest.  These include tests involving profile deletion.\n\n\/\/ TODO(jeremy): crbug.com\/103355 - These tests should be enabled on all\n\/\/ platforms.\n#if defined(OS_MACOSX)\nclass ProfileManagerBrowserTest : public InProcessBrowserTest {\n protected:\n  \/\/ An observer that returns back to test code after a new profile\n  \/\/ is initialized.\n  class BlockOnProfileInitObserver : public ProfileManagerObserver {\n   public:\n    void OnProfileCreated(Profile* profile, Status status) {\n      if (status == ProfileManagerObserver::STATUS_INITIALIZED) {\n        MessageLoop::current()->Quit();\n      }\n    }\n  };\n};\n\n\/\/ Delete single profile and make sure a new one is created.\nIN_PROC_BROWSER_TEST_F(ProfileManagerBrowserTest, DeleteSingletonProfile) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  ProfileInfoCache& cache = profile_manager->GetProfileInfoCache();\n\n  \/\/ We should start out with 1 profile.\n  ASSERT_EQ(cache.GetNumberOfProfiles(), 1U);\n\n  \/\/ Delete singleton profile.\n  FilePath singleton_profile_path = cache.GetPathOfProfileAtIndex(0);\n  EXPECT_FALSE(singleton_profile_path.empty());\n  profile_manager->ScheduleProfileForDeletion(singleton_profile_path);\n\n  \/\/ Spin things till profile is actually deleted.\n  ui_test_utils::RunAllPendingInMessageLoop();\n\n  \/\/ Make sure a new profile was created automatically.\n  EXPECT_EQ(cache.GetNumberOfProfiles(), 1U);\n  FilePath new_profile_path = cache.GetPathOfProfileAtIndex(0);\n  EXPECT_NE(new_profile_path, singleton_profile_path);\n\n  \/\/ Make sure that last used profile preference is set correctly.\n  Profile* last_used = ProfileManager::GetLastUsedProfile();\n  EXPECT_EQ(new_profile_path, last_used->GetPath());\n}\n\n\/\/ Delete all profiles in a multi profile setup and make sure a new one is\n\/\/ created.\nIN_PROC_BROWSER_TEST_F(ProfileManagerBrowserTest, DeleteAllProfiles) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  ProfileInfoCache& cache = profile_manager->GetProfileInfoCache();\n\n  \/\/ Create an additional profile.\n  BlockOnProfileInitObserver observer;\n  FilePath new_path = profile_manager->GenerateNextProfileDirectoryPath();\n  profile_manager->CreateProfileAsync(new_path, &observer);\n\n  \/\/ Spin to allow profile creation to take place, loop is terminated\n  \/\/ by BlockOnProfileInitObserver when the profile is created.\n  ui_test_utils::RunMessageLoop();\n\n  ASSERT_EQ(cache.GetNumberOfProfiles(), 2U);\n\n  \/\/ Delete all profiles.\n  FilePath profile_path1 = cache.GetPathOfProfileAtIndex(0);\n  FilePath profile_path2 = cache.GetPathOfProfileAtIndex(1);\n  EXPECT_FALSE(profile_path1.empty());\n  EXPECT_FALSE(profile_path2.empty());\n  profile_manager->ScheduleProfileForDeletion(profile_path1);\n  profile_manager->ScheduleProfileForDeletion(profile_path2);\n\n  \/\/ Spin things so deletion can take place.\n  ui_test_utils::RunAllPendingInMessageLoop();\n\n  \/\/ Make sure a new profile was created automatically.\n  EXPECT_EQ(cache.GetNumberOfProfiles(), 1U);\n  FilePath new_profile_path = cache.GetPathOfProfileAtIndex(0);\n  EXPECT_NE(new_profile_path, profile_path1);\n  EXPECT_NE(new_profile_path, profile_path2);\n\n  \/\/ Make sure that last used profile preference is set correctly.\n  Profile* last_used = ProfileManager::GetLastUsedProfile();\n  EXPECT_EQ(new_profile_path, last_used->GetPath());\n}\n#endif \/\/ OS_MACOSX\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix missing favicon for chrome:\/\/extensions\/<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 \"chrome\/browser\/net\/connection_tester.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/logging.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/importer\/firefox_proxy_settings.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"net\/base\/cert_verifier.h\"\n#include \"net\/base\/cookie_monster.h\"\n#include \"net\/base\/dnsrr_resolver.h\"\n#include \"net\/base\/host_resolver.h\"\n#include \"net\/base\/host_resolver_impl.h\"\n#include \"net\/base\/io_buffer.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/net_util.h\"\n#include \"net\/base\/ssl_config_service_defaults.h\"\n#include \"net\/disk_cache\/disk_cache.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\/proxy\/proxy_config_service_fixed.h\"\n#include \"net\/proxy\/proxy_script_fetcher_impl.h\"\n#include \"net\/socket\/client_socket_factory.h\"\n#include \"net\/spdy\/spdy_session_pool.h\"\n#include \"net\/url_request\/url_request.h\"\n#include \"net\/url_request\/url_request_context.h\"\n\nnamespace {\n\n\/\/ ExperimentURLRequestContext ------------------------------------------------\n\n\/\/ An instance of ExperimentURLRequestContext is created for each experiment\n\/\/ run by ConnectionTester. The class initializes network dependencies according\n\/\/ to the specified \"experiment\".\nclass ExperimentURLRequestContext : public net::URLRequestContext {\n public:\n  explicit ExperimentURLRequestContext(\n      net::URLRequestContext* proxy_request_context)\n      : proxy_request_context_(proxy_request_context) {}\n\n  int Init(const ConnectionTester::Experiment& experiment) {\n    int rv;\n\n    \/\/ Create a custom HostResolver for this experiment.\n    rv = CreateHostResolver(experiment.host_resolver_experiment,\n                            &host_resolver_);\n    if (rv != net::OK)\n      return rv;  \/\/ Failure.\n\n    \/\/ Create a custom ProxyService for this this experiment.\n    rv = CreateProxyService(experiment.proxy_settings_experiment,\n                            &proxy_service_);\n    if (rv != net::OK)\n      return rv;  \/\/ Failure.\n\n    \/\/ The rest of the dependencies are standard, and don't depend on the\n    \/\/ experiment being run.\n    cert_verifier_ = new net::CertVerifier;\n    dnsrr_resolver_ = new net::DnsRRResolver;\n    ftp_transaction_factory_ = new net::FtpNetworkLayer(host_resolver_);\n    ssl_config_service_ = new net::SSLConfigServiceDefaults;\n    http_auth_handler_factory_ = net::HttpAuthHandlerFactory::CreateDefault(\n        host_resolver_);\n    scoped_refptr<net::HttpNetworkSession> network_session(\n        new net::HttpNetworkSession(\n            host_resolver_,\n            cert_verifier_,\n            dnsrr_resolver_,\n            NULL \/* dns_cert_checker *\/,\n            NULL \/* ssl_host_info_factory *\/,\n            proxy_service_,\n            net::ClientSocketFactory::GetDefaultFactory(),\n            ssl_config_service_,\n            new net::SpdySessionPool(NULL),\n            http_auth_handler_factory_,\n            NULL \/* network_delegate *\/,\n            NULL \/* net_log *\/));\n    http_transaction_factory_ = new net::HttpCache(\n        network_session,\n        net::HttpCache::DefaultBackend::InMemory(0));\n    \/\/ In-memory cookie store.\n    cookie_store_ = new net::CookieMonster(NULL, NULL);\n\n    return net::OK;\n  }\n\n protected:\n  virtual ~ExperimentURLRequestContext() {\n    delete ftp_transaction_factory_;\n    delete http_transaction_factory_;\n    delete http_auth_handler_factory_;\n    delete dnsrr_resolver_;\n    delete cert_verifier_;\n    delete host_resolver_;\n  }\n\n private:\n  \/\/ Creates a host resolver for |experiment|. On success returns net::OK and\n  \/\/ fills |host_resolver| with a new pointer. Otherwise returns a network\n  \/\/ error code.\n  int CreateHostResolver(\n      ConnectionTester::HostResolverExperiment experiment,\n      net::HostResolver** host_resolver) {\n    \/\/ Create a vanilla HostResolver that disables caching.\n    const size_t kMaxJobs = 50u;\n    net::HostResolverImpl* impl =\n        new net::HostResolverImpl(NULL, NULL, kMaxJobs, NULL);\n\n    *host_resolver = impl;\n\n    \/\/ Modify it slightly based on the experiment being run.\n    switch (experiment) {\n      case ConnectionTester::HOST_RESOLVER_EXPERIMENT_PLAIN:\n        return net::OK;\n      case ConnectionTester::HOST_RESOLVER_EXPERIMENT_DISABLE_IPV6:\n        impl->SetDefaultAddressFamily(net::ADDRESS_FAMILY_IPV4);\n        return net::OK;\n      case ConnectionTester::HOST_RESOLVER_EXPERIMENT_IPV6_PROBE: {\n        \/\/ Note that we don't use impl->ProbeIPv6Support() since that finishes\n        \/\/ asynchronously and may not take effect in time for the test.\n        \/\/ So instead we will probe synchronously (might take 100-200 ms).\n        net::AddressFamily family = net::IPv6Supported() ?\n            net::ADDRESS_FAMILY_UNSPECIFIED : net::ADDRESS_FAMILY_IPV4;\n        impl->SetDefaultAddressFamily(family);\n        return net::OK;\n      }\n      default:\n        NOTREACHED();\n        return net::ERR_UNEXPECTED;\n    }\n  }\n\n  \/\/ Creates a proxy config service for |experiment|. On success returns net::OK\n  \/\/ and fills |config_service| with a new pointer. Otherwise returns a network\n  \/\/ error code.\n  int CreateProxyConfigService(\n      ConnectionTester::ProxySettingsExperiment experiment,\n      scoped_ptr<net::ProxyConfigService>* config_service) {\n    scoped_ptr<base::ThreadRestrictions::ScopedAllowIO> allow_io;\n    switch (experiment) {\n      case ConnectionTester::PROXY_EXPERIMENT_USE_SYSTEM_SETTINGS:\n        return CreateSystemProxyConfigService(config_service);\n      case ConnectionTester::PROXY_EXPERIMENT_USE_FIREFOX_SETTINGS:\n        \/\/ http:\/\/crbug.com\/67664: This call can lead to blocking IO on the IO\n        \/\/ thread.  This is a bug and should be fixed.\n        allow_io.reset(new base::ThreadRestrictions::ScopedAllowIO);\n        return CreateFirefoxProxyConfigService(config_service);\n      case ConnectionTester::PROXY_EXPERIMENT_USE_AUTO_DETECT:\n        config_service->reset(new net::ProxyConfigServiceFixed(\n            net::ProxyConfig::CreateAutoDetect()));\n        return net::OK;\n      case ConnectionTester::PROXY_EXPERIMENT_USE_DIRECT:\n        config_service->reset(new net::ProxyConfigServiceFixed(\n            net::ProxyConfig::CreateDirect()));\n        return net::OK;\n      default:\n        NOTREACHED();\n        return net::ERR_UNEXPECTED;\n    }\n  }\n\n  \/\/ Creates a proxy service for |experiment|. On success returns net::OK\n  \/\/ and fills |config_service| with a new pointer. Otherwise returns a network\n  \/\/ error code.\n  int CreateProxyService(\n      ConnectionTester::ProxySettingsExperiment experiment,\n      scoped_refptr<net::ProxyService>* proxy_service) {\n    \/\/ Create an appropriate proxy config service.\n    scoped_ptr<net::ProxyConfigService> config_service;\n    int rv = CreateProxyConfigService(experiment, &config_service);\n    if (rv != net::OK)\n      return rv;  \/\/ Failure.\n\n    if (CommandLine::ForCurrentProcess()->HasSwitch(\n        switches::kSingleProcess)) {\n      \/\/ We can't create a standard proxy resolver in single-process mode.\n      \/\/ Rather than falling-back to some other implementation, fail.\n      return net::ERR_NOT_IMPLEMENTED;\n    }\n\n    *proxy_service = net::ProxyService::CreateUsingV8ProxyResolver(\n        config_service.release(),\n        0u,\n        new net::ProxyScriptFetcherImpl(proxy_request_context_),\n        host_resolver(),\n        NULL);\n\n    return net::OK;\n  }\n\n  \/\/ Creates a proxy config service that pulls from the system proxy settings.\n  \/\/ On success returns net::OK and fills |config_service| with a new pointer.\n  \/\/ Otherwise returns a network error code.\n  int CreateSystemProxyConfigService(\n      scoped_ptr<net::ProxyConfigService>* config_service) {\n#if defined(OS_LINUX)\n    \/\/ TODO(eroman): This is not supported on Linux yet, because of how\n    \/\/ construction needs ot happen on the UI thread.\n    return net::ERR_NOT_IMPLEMENTED;\n#else\n    config_service->reset(\n        net::ProxyService::CreateSystemProxyConfigService(\n            MessageLoop::current(), NULL));\n    return net::OK;\n#endif\n  }\n\n  \/\/ Creates a fixed proxy config service that is initialized using Firefox's\n  \/\/ current proxy settings. On success returns net::OK and fills\n  \/\/ |config_service| with a new pointer. Otherwise returns a network error\n  \/\/ code.\n  int CreateFirefoxProxyConfigService(\n      scoped_ptr<net::ProxyConfigService>* config_service) {\n    \/\/ Fetch Firefox's proxy settings (can fail if Firefox is not installed).\n    FirefoxProxySettings firefox_settings;\n    if (!FirefoxProxySettings::GetSettings(&firefox_settings))\n      return net::ERR_FILE_NOT_FOUND;\n\n    if (FirefoxProxySettings::SYSTEM == firefox_settings.config_type())\n      return CreateSystemProxyConfigService(config_service);\n\n    net::ProxyConfig config;\n    if (firefox_settings.ToProxyConfig(&config)) {\n      config_service->reset(new net::ProxyConfigServiceFixed(config));\n      return net::OK;\n    }\n\n    return net::ERR_FAILED;\n  }\n\n  const scoped_refptr<net::URLRequestContext> proxy_request_context_;\n};\n\n}  \/\/ namespace\n\n\/\/ ConnectionTester::TestRunner ----------------------------------------------\n\n\/\/ TestRunner is a helper class for running an individual experiment. It can\n\/\/ be deleted any time after it is started, and this will abort the request.\nclass ConnectionTester::TestRunner : public net::URLRequest::Delegate {\n public:\n  \/\/ |tester| must remain alive throughout the TestRunner's lifetime.\n  \/\/ |tester| will be notified of completion.\n  explicit TestRunner(ConnectionTester* tester) : tester_(tester) {}\n\n  \/\/ Starts running |experiment|. Notifies tester->OnExperimentCompleted() when\n  \/\/ it is done.\n  void Run(const Experiment& experiment);\n\n  \/\/ Overridden from net::URLRequest::Delegate:\n  virtual void OnResponseStarted(net::URLRequest* request);\n  virtual void OnReadCompleted(net::URLRequest* request, int bytes_read);\n  \/\/ TODO(eroman): handle cases requiring authentication.\n\n private:\n  \/\/ The number of bytes to read each response body chunk.\n  static const int kReadBufferSize = 1024;\n\n  \/\/ Starts reading the response's body (and keeps reading until an error or\n  \/\/ end of stream).\n  void ReadBody(net::URLRequest* request);\n\n  \/\/ Called when the request has completed (for both success and failure).\n  void OnResponseCompleted(net::URLRequest* request);\n\n  ConnectionTester* tester_;\n  scoped_ptr<net::URLRequest> request_;\n\n  DISALLOW_COPY_AND_ASSIGN(TestRunner);\n};\n\nvoid ConnectionTester::TestRunner::OnResponseStarted(net::URLRequest* request) {\n  if (!request->status().is_success()) {\n    OnResponseCompleted(request);\n    return;\n  }\n\n  \/\/ Start reading the body.\n  ReadBody(request);\n}\n\nvoid ConnectionTester::TestRunner::OnReadCompleted(net::URLRequest* request,\n                                                   int bytes_read) {\n  if (bytes_read <= 0) {\n    OnResponseCompleted(request);\n    return;\n  }\n\n  \/\/ Keep reading until the stream is closed. Throw the data read away.\n  ReadBody(request);\n}\n\nvoid ConnectionTester::TestRunner::ReadBody(net::URLRequest* request) {\n  \/\/ Read the response body |kReadBufferSize| bytes at a time.\n  scoped_refptr<net::IOBuffer> unused_buffer(\n      new net::IOBuffer(kReadBufferSize));\n  int num_bytes;\n  if (request->Read(unused_buffer, kReadBufferSize, &num_bytes)) {\n    OnReadCompleted(request, num_bytes);\n  } else if (!request->status().is_io_pending()) {\n    \/\/ Read failed synchronously.\n    OnResponseCompleted(request);\n  }\n}\n\nvoid ConnectionTester::TestRunner::OnResponseCompleted(\n    net::URLRequest* request) {\n  int result = net::OK;\n  if (!request->status().is_success()) {\n    DCHECK_NE(net::ERR_IO_PENDING, request->status().os_error());\n    result = request->status().os_error();\n  }\n  tester_->OnExperimentCompleted(result);\n}\n\nvoid ConnectionTester::TestRunner::Run(const Experiment& experiment) {\n  \/\/ Try to create a net::URLRequestContext for this experiment.\n  scoped_refptr<ExperimentURLRequestContext> context(\n      new ExperimentURLRequestContext(tester_->proxy_request_context_));\n  int rv = context->Init(experiment);\n  if (rv != net::OK) {\n    \/\/ Complete the experiment with a failure.\n    tester_->OnExperimentCompleted(rv);\n    return;\n  }\n\n  \/\/ Fetch a request using the experimental context.\n  request_.reset(new net::URLRequest(experiment.url, this));\n  request_->set_context(context);\n  request_->Start();\n}\n\n\/\/ ConnectionTester ----------------------------------------------------------\n\nConnectionTester::ConnectionTester(\n    Delegate* delegate,\n    net::URLRequestContext* proxy_request_context)\n    : delegate_(delegate), proxy_request_context_(proxy_request_context) {\n  DCHECK(delegate);\n  DCHECK(proxy_request_context);\n}\n\nConnectionTester::~ConnectionTester() {\n  \/\/ Cancellation happens automatically by deleting test_runner_.\n}\n\nvoid ConnectionTester::RunAllTests(const GURL& url) {\n  \/\/ Select all possible experiments to run. (In no particular order).\n  \/\/ It is possible that some of these experiments are actually duplicates.\n  GetAllPossibleExperimentCombinations(url, &remaining_experiments_);\n\n  delegate_->OnStartConnectionTestSuite();\n  StartNextExperiment();\n}\n\n\/\/ static\nstring16 ConnectionTester::ProxySettingsExperimentDescription(\n    ProxySettingsExperiment experiment) {\n  \/\/ TODO(eroman): Use proper string resources.\n  switch (experiment) {\n    case PROXY_EXPERIMENT_USE_DIRECT:\n      return ASCIIToUTF16(\"Don't use any proxy\");\n    case PROXY_EXPERIMENT_USE_SYSTEM_SETTINGS:\n      return ASCIIToUTF16(\"Use system proxy settings\");\n    case PROXY_EXPERIMENT_USE_FIREFOX_SETTINGS:\n      return ASCIIToUTF16(\"Use Firefox's proxy settings\");\n    case PROXY_EXPERIMENT_USE_AUTO_DETECT:\n      return ASCIIToUTF16(\"Auto-detect proxy settings\");\n    default:\n      NOTREACHED();\n      return string16();\n  }\n}\n\n\/\/ static\nstring16 ConnectionTester::HostResolverExperimentDescription(\n    HostResolverExperiment experiment) {\n  \/\/ TODO(eroman): Use proper string resources.\n  switch (experiment) {\n    case HOST_RESOLVER_EXPERIMENT_PLAIN:\n      return string16();\n    case HOST_RESOLVER_EXPERIMENT_DISABLE_IPV6:\n      return ASCIIToUTF16(\"Disable IPv6 host resolving\");\n    case HOST_RESOLVER_EXPERIMENT_IPV6_PROBE:\n      return ASCIIToUTF16(\"Probe for IPv6 host resolving\");\n    default:\n      NOTREACHED();\n      return string16();\n  }\n}\n\n\/\/ static\nvoid ConnectionTester::GetAllPossibleExperimentCombinations(\n    const GURL& url,\n    ConnectionTester::ExperimentList* list) {\n  list->clear();\n  for (size_t resolver_experiment = 0;\n       resolver_experiment < HOST_RESOLVER_EXPERIMENT_COUNT;\n       ++resolver_experiment) {\n    for (size_t proxy_experiment = 0;\n         proxy_experiment < PROXY_EXPERIMENT_COUNT;\n         ++proxy_experiment) {\n      Experiment experiment(\n          url,\n          static_cast<ProxySettingsExperiment>(proxy_experiment),\n          static_cast<HostResolverExperiment>(resolver_experiment));\n      list->push_back(experiment);\n    }\n  }\n}\n\nvoid ConnectionTester::StartNextExperiment() {\n  DCHECK(!remaining_experiments_.empty());\n  DCHECK(!current_test_runner_.get());\n\n  delegate_->OnStartConnectionTestExperiment(current_experiment());\n\n  current_test_runner_.reset(new TestRunner(this));\n  current_test_runner_->Run(current_experiment());\n}\n\nvoid ConnectionTester::OnExperimentCompleted(int result) {\n  Experiment current = current_experiment();\n\n  \/\/ Advance to the next experiment.\n  remaining_experiments_.erase(remaining_experiments_.begin());\n  current_test_runner_.reset();\n\n  \/\/ Notify the delegate of completion.\n  delegate_->OnCompletedConnectionTestExperiment(current, result);\n\n  if (remaining_experiments_.empty()) {\n    delegate_->OnCompletedConnectionTestSuite();\n  } else {\n    StartNextExperiment();\n  }\n}\n<commit_msg>Don't delete the URLRequest within the completion callback, in the ConnectionTester, as that was leading to a wonky teardown.<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\/net\/connection_tester.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/logging.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/task.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/importer\/firefox_proxy_settings.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"net\/base\/cert_verifier.h\"\n#include \"net\/base\/cookie_monster.h\"\n#include \"net\/base\/dnsrr_resolver.h\"\n#include \"net\/base\/host_resolver.h\"\n#include \"net\/base\/host_resolver_impl.h\"\n#include \"net\/base\/io_buffer.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/net_util.h\"\n#include \"net\/base\/ssl_config_service_defaults.h\"\n#include \"net\/disk_cache\/disk_cache.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\/proxy\/proxy_config_service_fixed.h\"\n#include \"net\/proxy\/proxy_script_fetcher_impl.h\"\n#include \"net\/socket\/client_socket_factory.h\"\n#include \"net\/spdy\/spdy_session_pool.h\"\n#include \"net\/url_request\/url_request.h\"\n#include \"net\/url_request\/url_request_context.h\"\n\nnamespace {\n\n\/\/ ExperimentURLRequestContext ------------------------------------------------\n\n\/\/ An instance of ExperimentURLRequestContext is created for each experiment\n\/\/ run by ConnectionTester. The class initializes network dependencies according\n\/\/ to the specified \"experiment\".\nclass ExperimentURLRequestContext : public net::URLRequestContext {\n public:\n  explicit ExperimentURLRequestContext(\n      net::URLRequestContext* proxy_request_context)\n      : proxy_request_context_(proxy_request_context) {}\n\n  int Init(const ConnectionTester::Experiment& experiment) {\n    int rv;\n\n    \/\/ Create a custom HostResolver for this experiment.\n    rv = CreateHostResolver(experiment.host_resolver_experiment,\n                            &host_resolver_);\n    if (rv != net::OK)\n      return rv;  \/\/ Failure.\n\n    \/\/ Create a custom ProxyService for this this experiment.\n    rv = CreateProxyService(experiment.proxy_settings_experiment,\n                            &proxy_service_);\n    if (rv != net::OK)\n      return rv;  \/\/ Failure.\n\n    \/\/ The rest of the dependencies are standard, and don't depend on the\n    \/\/ experiment being run.\n    cert_verifier_ = new net::CertVerifier;\n    dnsrr_resolver_ = new net::DnsRRResolver;\n    ftp_transaction_factory_ = new net::FtpNetworkLayer(host_resolver_);\n    ssl_config_service_ = new net::SSLConfigServiceDefaults;\n    http_auth_handler_factory_ = net::HttpAuthHandlerFactory::CreateDefault(\n        host_resolver_);\n    scoped_refptr<net::HttpNetworkSession> network_session(\n        new net::HttpNetworkSession(\n            host_resolver_,\n            cert_verifier_,\n            dnsrr_resolver_,\n            NULL \/* dns_cert_checker *\/,\n            NULL \/* ssl_host_info_factory *\/,\n            proxy_service_,\n            net::ClientSocketFactory::GetDefaultFactory(),\n            ssl_config_service_,\n            new net::SpdySessionPool(NULL),\n            http_auth_handler_factory_,\n            NULL \/* network_delegate *\/,\n            NULL \/* net_log *\/));\n    http_transaction_factory_ = new net::HttpCache(\n        network_session,\n        net::HttpCache::DefaultBackend::InMemory(0));\n    \/\/ In-memory cookie store.\n    cookie_store_ = new net::CookieMonster(NULL, NULL);\n\n    return net::OK;\n  }\n\n protected:\n  virtual ~ExperimentURLRequestContext() {\n    delete ftp_transaction_factory_;\n    delete http_transaction_factory_;\n    delete http_auth_handler_factory_;\n    delete dnsrr_resolver_;\n    delete cert_verifier_;\n    delete host_resolver_;\n  }\n\n private:\n  \/\/ Creates a host resolver for |experiment|. On success returns net::OK and\n  \/\/ fills |host_resolver| with a new pointer. Otherwise returns a network\n  \/\/ error code.\n  int CreateHostResolver(\n      ConnectionTester::HostResolverExperiment experiment,\n      net::HostResolver** host_resolver) {\n    \/\/ Create a vanilla HostResolver that disables caching.\n    const size_t kMaxJobs = 50u;\n    net::HostResolverImpl* impl =\n        new net::HostResolverImpl(NULL, NULL, kMaxJobs, NULL);\n\n    *host_resolver = impl;\n\n    \/\/ Modify it slightly based on the experiment being run.\n    switch (experiment) {\n      case ConnectionTester::HOST_RESOLVER_EXPERIMENT_PLAIN:\n        return net::OK;\n      case ConnectionTester::HOST_RESOLVER_EXPERIMENT_DISABLE_IPV6:\n        impl->SetDefaultAddressFamily(net::ADDRESS_FAMILY_IPV4);\n        return net::OK;\n      case ConnectionTester::HOST_RESOLVER_EXPERIMENT_IPV6_PROBE: {\n        \/\/ Note that we don't use impl->ProbeIPv6Support() since that finishes\n        \/\/ asynchronously and may not take effect in time for the test.\n        \/\/ So instead we will probe synchronously (might take 100-200 ms).\n        net::AddressFamily family = net::IPv6Supported() ?\n            net::ADDRESS_FAMILY_UNSPECIFIED : net::ADDRESS_FAMILY_IPV4;\n        impl->SetDefaultAddressFamily(family);\n        return net::OK;\n      }\n      default:\n        NOTREACHED();\n        return net::ERR_UNEXPECTED;\n    }\n  }\n\n  \/\/ Creates a proxy config service for |experiment|. On success returns net::OK\n  \/\/ and fills |config_service| with a new pointer. Otherwise returns a network\n  \/\/ error code.\n  int CreateProxyConfigService(\n      ConnectionTester::ProxySettingsExperiment experiment,\n      scoped_ptr<net::ProxyConfigService>* config_service) {\n    scoped_ptr<base::ThreadRestrictions::ScopedAllowIO> allow_io;\n    switch (experiment) {\n      case ConnectionTester::PROXY_EXPERIMENT_USE_SYSTEM_SETTINGS:\n        return CreateSystemProxyConfigService(config_service);\n      case ConnectionTester::PROXY_EXPERIMENT_USE_FIREFOX_SETTINGS:\n        \/\/ http:\/\/crbug.com\/67664: This call can lead to blocking IO on the IO\n        \/\/ thread.  This is a bug and should be fixed.\n        allow_io.reset(new base::ThreadRestrictions::ScopedAllowIO);\n        return CreateFirefoxProxyConfigService(config_service);\n      case ConnectionTester::PROXY_EXPERIMENT_USE_AUTO_DETECT:\n        config_service->reset(new net::ProxyConfigServiceFixed(\n            net::ProxyConfig::CreateAutoDetect()));\n        return net::OK;\n      case ConnectionTester::PROXY_EXPERIMENT_USE_DIRECT:\n        config_service->reset(new net::ProxyConfigServiceFixed(\n            net::ProxyConfig::CreateDirect()));\n        return net::OK;\n      default:\n        NOTREACHED();\n        return net::ERR_UNEXPECTED;\n    }\n  }\n\n  \/\/ Creates a proxy service for |experiment|. On success returns net::OK\n  \/\/ and fills |config_service| with a new pointer. Otherwise returns a network\n  \/\/ error code.\n  int CreateProxyService(\n      ConnectionTester::ProxySettingsExperiment experiment,\n      scoped_refptr<net::ProxyService>* proxy_service) {\n    \/\/ Create an appropriate proxy config service.\n    scoped_ptr<net::ProxyConfigService> config_service;\n    int rv = CreateProxyConfigService(experiment, &config_service);\n    if (rv != net::OK)\n      return rv;  \/\/ Failure.\n\n    if (CommandLine::ForCurrentProcess()->HasSwitch(\n        switches::kSingleProcess)) {\n      \/\/ We can't create a standard proxy resolver in single-process mode.\n      \/\/ Rather than falling-back to some other implementation, fail.\n      return net::ERR_NOT_IMPLEMENTED;\n    }\n\n    *proxy_service = net::ProxyService::CreateUsingV8ProxyResolver(\n        config_service.release(),\n        0u,\n        new net::ProxyScriptFetcherImpl(proxy_request_context_),\n        host_resolver(),\n        NULL);\n\n    return net::OK;\n  }\n\n  \/\/ Creates a proxy config service that pulls from the system proxy settings.\n  \/\/ On success returns net::OK and fills |config_service| with a new pointer.\n  \/\/ Otherwise returns a network error code.\n  int CreateSystemProxyConfigService(\n      scoped_ptr<net::ProxyConfigService>* config_service) {\n#if defined(OS_LINUX)\n    \/\/ TODO(eroman): This is not supported on Linux yet, because of how\n    \/\/ construction needs ot happen on the UI thread.\n    return net::ERR_NOT_IMPLEMENTED;\n#else\n    config_service->reset(\n        net::ProxyService::CreateSystemProxyConfigService(\n            MessageLoop::current(), NULL));\n    return net::OK;\n#endif\n  }\n\n  \/\/ Creates a fixed proxy config service that is initialized using Firefox's\n  \/\/ current proxy settings. On success returns net::OK and fills\n  \/\/ |config_service| with a new pointer. Otherwise returns a network error\n  \/\/ code.\n  int CreateFirefoxProxyConfigService(\n      scoped_ptr<net::ProxyConfigService>* config_service) {\n    \/\/ Fetch Firefox's proxy settings (can fail if Firefox is not installed).\n    FirefoxProxySettings firefox_settings;\n    if (!FirefoxProxySettings::GetSettings(&firefox_settings))\n      return net::ERR_FILE_NOT_FOUND;\n\n    if (FirefoxProxySettings::SYSTEM == firefox_settings.config_type())\n      return CreateSystemProxyConfigService(config_service);\n\n    net::ProxyConfig config;\n    if (firefox_settings.ToProxyConfig(&config)) {\n      config_service->reset(new net::ProxyConfigServiceFixed(config));\n      return net::OK;\n    }\n\n    return net::ERR_FAILED;\n  }\n\n  const scoped_refptr<net::URLRequestContext> proxy_request_context_;\n};\n\n}  \/\/ namespace\n\n\/\/ ConnectionTester::TestRunner ----------------------------------------------\n\n\/\/ TestRunner is a helper class for running an individual experiment. It can\n\/\/ be deleted any time after it is started, and this will abort the request.\nclass ConnectionTester::TestRunner : public net::URLRequest::Delegate {\n public:\n  \/\/ |tester| must remain alive throughout the TestRunner's lifetime.\n  \/\/ |tester| will be notified of completion.\n  explicit TestRunner(ConnectionTester* tester)\n      : tester_(tester),\n        ALLOW_THIS_IN_INITIALIZER_LIST(method_factory_(this)) {}\n\n  \/\/ Starts running |experiment|. Notifies tester->OnExperimentCompleted() when\n  \/\/ it is done.\n  void Run(const Experiment& experiment);\n\n  \/\/ Overridden from net::URLRequest::Delegate:\n  virtual void OnResponseStarted(net::URLRequest* request);\n  virtual void OnReadCompleted(net::URLRequest* request, int bytes_read);\n  \/\/ TODO(eroman): handle cases requiring authentication.\n\n private:\n  \/\/ The number of bytes to read each response body chunk.\n  static const int kReadBufferSize = 1024;\n\n  \/\/ Starts reading the response's body (and keeps reading until an error or\n  \/\/ end of stream).\n  void ReadBody(net::URLRequest* request);\n\n  \/\/ Called when the request has completed (for both success and failure).\n  void OnResponseCompleted(net::URLRequest* request);\n  void OnExperimentCompletedWithResult(int result);\n\n  ConnectionTester* tester_;\n  scoped_ptr<net::URLRequest> request_;\n\n  ScopedRunnableMethodFactory<TestRunner> method_factory_;\n\n  DISALLOW_COPY_AND_ASSIGN(TestRunner);\n};\n\nvoid ConnectionTester::TestRunner::OnResponseStarted(net::URLRequest* request) {\n  if (!request->status().is_success()) {\n    OnResponseCompleted(request);\n    return;\n  }\n\n  \/\/ Start reading the body.\n  ReadBody(request);\n}\n\nvoid ConnectionTester::TestRunner::OnReadCompleted(net::URLRequest* request,\n                                                   int bytes_read) {\n  if (bytes_read <= 0) {\n    OnResponseCompleted(request);\n    return;\n  }\n\n  \/\/ Keep reading until the stream is closed. Throw the data read away.\n  ReadBody(request);\n}\n\nvoid ConnectionTester::TestRunner::ReadBody(net::URLRequest* request) {\n  \/\/ Read the response body |kReadBufferSize| bytes at a time.\n  scoped_refptr<net::IOBuffer> unused_buffer(\n      new net::IOBuffer(kReadBufferSize));\n  int num_bytes;\n  if (request->Read(unused_buffer, kReadBufferSize, &num_bytes)) {\n    OnReadCompleted(request, num_bytes);\n  } else if (!request->status().is_io_pending()) {\n    \/\/ Read failed synchronously.\n    OnResponseCompleted(request);\n  }\n}\n\nvoid ConnectionTester::TestRunner::OnResponseCompleted(\n    net::URLRequest* request) {\n  int result = net::OK;\n  if (!request->status().is_success()) {\n    DCHECK_NE(net::ERR_IO_PENDING, request->status().os_error());\n    result = request->status().os_error();\n  }\n\n  \/\/ Post a task to notify the parent rather than handling it right away,\n  \/\/ to avoid re-entrancy problems with URLRequest. (Don't want the caller\n  \/\/ to end up deleting the URLRequest while in the middle of processing).\n  MessageLoop::current()->PostTask(\n      FROM_HERE,\n      method_factory_.NewRunnableMethod(\n          &TestRunner::OnExperimentCompletedWithResult, result));\n}\n\nvoid ConnectionTester::TestRunner::OnExperimentCompletedWithResult(int result) {\n  tester_->OnExperimentCompleted(result);\n}\n\nvoid ConnectionTester::TestRunner::Run(const Experiment& experiment) {\n  \/\/ Try to create a net::URLRequestContext for this experiment.\n  scoped_refptr<ExperimentURLRequestContext> context(\n      new ExperimentURLRequestContext(tester_->proxy_request_context_));\n  int rv = context->Init(experiment);\n  if (rv != net::OK) {\n    \/\/ Complete the experiment with a failure.\n    tester_->OnExperimentCompleted(rv);\n    return;\n  }\n\n  \/\/ Fetch a request using the experimental context.\n  request_.reset(new net::URLRequest(experiment.url, this));\n  request_->set_context(context);\n  request_->Start();\n}\n\n\/\/ ConnectionTester ----------------------------------------------------------\n\nConnectionTester::ConnectionTester(\n    Delegate* delegate,\n    net::URLRequestContext* proxy_request_context)\n    : delegate_(delegate), proxy_request_context_(proxy_request_context) {\n  DCHECK(delegate);\n  DCHECK(proxy_request_context);\n}\n\nConnectionTester::~ConnectionTester() {\n  \/\/ Cancellation happens automatically by deleting test_runner_.\n}\n\nvoid ConnectionTester::RunAllTests(const GURL& url) {\n  \/\/ Select all possible experiments to run. (In no particular order).\n  \/\/ It is possible that some of these experiments are actually duplicates.\n  GetAllPossibleExperimentCombinations(url, &remaining_experiments_);\n\n  delegate_->OnStartConnectionTestSuite();\n  StartNextExperiment();\n}\n\n\/\/ static\nstring16 ConnectionTester::ProxySettingsExperimentDescription(\n    ProxySettingsExperiment experiment) {\n  \/\/ TODO(eroman): Use proper string resources.\n  switch (experiment) {\n    case PROXY_EXPERIMENT_USE_DIRECT:\n      return ASCIIToUTF16(\"Don't use any proxy\");\n    case PROXY_EXPERIMENT_USE_SYSTEM_SETTINGS:\n      return ASCIIToUTF16(\"Use system proxy settings\");\n    case PROXY_EXPERIMENT_USE_FIREFOX_SETTINGS:\n      return ASCIIToUTF16(\"Use Firefox's proxy settings\");\n    case PROXY_EXPERIMENT_USE_AUTO_DETECT:\n      return ASCIIToUTF16(\"Auto-detect proxy settings\");\n    default:\n      NOTREACHED();\n      return string16();\n  }\n}\n\n\/\/ static\nstring16 ConnectionTester::HostResolverExperimentDescription(\n    HostResolverExperiment experiment) {\n  \/\/ TODO(eroman): Use proper string resources.\n  switch (experiment) {\n    case HOST_RESOLVER_EXPERIMENT_PLAIN:\n      return string16();\n    case HOST_RESOLVER_EXPERIMENT_DISABLE_IPV6:\n      return ASCIIToUTF16(\"Disable IPv6 host resolving\");\n    case HOST_RESOLVER_EXPERIMENT_IPV6_PROBE:\n      return ASCIIToUTF16(\"Probe for IPv6 host resolving\");\n    default:\n      NOTREACHED();\n      return string16();\n  }\n}\n\n\/\/ static\nvoid ConnectionTester::GetAllPossibleExperimentCombinations(\n    const GURL& url,\n    ConnectionTester::ExperimentList* list) {\n  list->clear();\n  for (size_t resolver_experiment = 0;\n       resolver_experiment < HOST_RESOLVER_EXPERIMENT_COUNT;\n       ++resolver_experiment) {\n    for (size_t proxy_experiment = 0;\n         proxy_experiment < PROXY_EXPERIMENT_COUNT;\n         ++proxy_experiment) {\n      Experiment experiment(\n          url,\n          static_cast<ProxySettingsExperiment>(proxy_experiment),\n          static_cast<HostResolverExperiment>(resolver_experiment));\n      list->push_back(experiment);\n    }\n  }\n}\n\nvoid ConnectionTester::StartNextExperiment() {\n  DCHECK(!remaining_experiments_.empty());\n  DCHECK(!current_test_runner_.get());\n\n  delegate_->OnStartConnectionTestExperiment(current_experiment());\n\n  current_test_runner_.reset(new TestRunner(this));\n  current_test_runner_->Run(current_experiment());\n}\n\nvoid ConnectionTester::OnExperimentCompleted(int result) {\n  Experiment current = current_experiment();\n\n  \/\/ Advance to the next experiment.\n  remaining_experiments_.erase(remaining_experiments_.begin());\n  current_test_runner_.reset();\n\n  \/\/ Notify the delegate of completion.\n  delegate_->OnCompletedConnectionTestExperiment(current, result);\n\n  if (remaining_experiments_.empty()) {\n    delegate_->OnCompletedConnectionTestSuite();\n  } else {\n    StartNextExperiment();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"common.h\"\n#include \"Integrator.h\"\n#include \"IntegrableProperty.h\"\n#include \"EventManager.h\"\n\nvoid Integrator::Update(DeltaTicks &dt) {\n\taccumulator += dt;\n\tif(accumulator.Seconds() > 1.0f) { accumulator.SetSeconds(1.0f); }\n\talphaMicroseconds = static_cast<uint32_t>(accumulator.Seconds() * 1000000.0f);\n\n\twhile(accumulator >= timestep) {\n\t\tTick(timestep.Seconds());\n\t\taccumulator -= timestep;\n\t}\n}\n\nvoid Integrator::Tick(DeltaTicks::seconds_type seconds) {\n\tfor(auto it = engine->objects.left.begin(); it != engine->objects.left.end(); ++it) {\n\t\tauto property = it->info->Get<IntegrableProperty>().lock();\n\t\tif(property) {\n\t\t\tfor(auto integrable : *property->GetIntegrables()) {\n\t\t\t\tintegrable->Integrate(seconds);\n\t\t\t}\n\t\t}\n\t}\n\tengine->GetSystem<EventManager>().lock()->FireIn(\"integrator\", \"ticked\", seconds);\n}\n<commit_msg>Set integrator microseconds value at end of tick<commit_after>#include \"common.h\"\n#include \"Integrator.h\"\n#include \"IntegrableProperty.h\"\n#include \"EventManager.h\"\n\nvoid Integrator::Update(DeltaTicks &dt) {\n\taccumulator += dt;\n\tif(accumulator.Seconds() > 1.0f) { accumulator.SetSeconds(1.0f); }\n\n\twhile(accumulator >= timestep) {\n\t\tTick(timestep.Seconds());\n\t\taccumulator -= timestep;\n\t}\n\n\talphaMicroseconds = static_cast<uint32_t>(accumulator.Seconds() * 1000000.0f);\n}\n\nvoid Integrator::Tick(DeltaTicks::seconds_type seconds) {\n\tfor(auto it = engine->objects.left.begin(); it != engine->objects.left.end(); ++it) {\n\t\tauto property = it->info->Get<IntegrableProperty>().lock();\n\t\tif(property) {\n\t\t\tfor(auto integrable : *property->GetIntegrables()) {\n\t\t\t\tintegrable->Integrate(seconds);\n\t\t\t}\n\t\t}\n\t}\n\tengine->GetSystem<EventManager>().lock()->FireIn(\"integrator\", \"ticked\", seconds);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Name:     app.cpp\n\/\/ Purpose:  The application class the CManager application.\n\/\/\n\/\/ Copyright (c) 2001-2003 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#ifdef __GNUG__\n#pragma implementation\n#pragma interface\n#endif\n\n\/\/ For compilers that support precompilation, includes \"wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/NavEngines.h\"\n#include \"vtlib\/core\/vtSOG.h\"\n#include \"vtdata\/vtLog.h\"\n\n#include \"app.h\"\n#include \"frame.h\"\n\n\/\/ #include <osgDB\/ReadFile>\n\nstatic void Args(int argc, wxChar **argv)\n{\n   return;\n}\n\nIMPLEMENT_APP(vtApp)\n\nclass LogCatcher : public wxLog\n{\n    void DoLogString(const wxChar *szString, time_t t)\n\t{\n\t\tVTLOG(\" wxLog: \");\n\t\tVTLOG(szString);\n\t\tVTLOG(\"\\n\");\n\t}\n};\n\n\n\/\/\n\/\/ Initialize the app object\n\/\/\nbool vtApp::OnInit(void)\n{\n\t\/\/ Redirect the wxWindows log messages to our own logging stream\n\twxLog *logger = new LogCatcher();\n\twxLog::SetActiveTarget(logger);\n\n\tArgs(argc, argv);\n\n\tg_Log._StartLog(\"debug.txt\");\n\tVTLOG(\"CManager\\n\");\n\n\t\/\/\n\t\/\/ Create the main frame window\n\t\/\/\n\tVTLOG(\"Creating frame\\n\");\n\twxString title = _T(\"Content Manager\");\n\tvtFrame *frame = new vtFrame(NULL, title,\n\t\twxPoint(50, 50), wxSize(800, 600));\n\n\tVTLOG(\"Setup scene\\n\");\n\tvtScene *pScene = vtGetScene();\n\tpScene->Init();\n\tpScene->SetBgColor(RGBf(0.5f, 0.5f, 0.5f));\n\n\tVTLOG(\" creating camera\\n\");\n\tvtCamera *pCamera = pScene->GetCamera();\n\tpCamera->SetName2(\"Default Camera\");\n\n\tm_pRoot = new vtGroup();\n\tm_pRoot->SetName2(\"Root\");\n\tpScene->SetRoot(m_pRoot);\n\n#if VTLIB_SGL\n\tCreateTestSGLScene();\n#endif\n\n\t\/\/ make a simple directional light\n\tVTLOG(\" creating light\\n\");\n\tvtLight *pLight = new vtLight();\n\tpLight->SetName2(\"Light\");\n\tvtMovLight *pMovLight = new vtMovLight(pLight);\n\tpMovLight->SetName2(\"Movable Light\");\n\tpLight->SetAmbient(RGBf(1, 1, 1));\n\tpMovLight->SetTrans(FPoint3(0.0f, 0.0f, 5.0f));\n\tm_pRoot->AddChild(pMovLight);\n\n\t\/\/ SOG testing, currently disabled\n#if 0\n#if 0\n\t\/\/ make a yellow sphere\n\tvtMaterialArray *pMats = new vtMaterialArray();\n\tpMats->AddRGBMaterial(RGBf(1.0f, 1.0f, 0.0f), RGBf(0.0f, 0.0f, 1.0f));\n\tvtGeom *pGeom = CreateSphereGeom(pMats, 0, VT_Normals, 0.5, 16);\n\tpGeom->SetName2(\"Yellow Sphere\");\n\tpMats->Release();\n\n\tOutputSOG osog;\n\n\tFILE *fp = fopen(\"output.sog\", \"wb\");\n\tosog.WriteHeader(fp);\n\tosog.WriteSingleGeometry(fp, pGeom);\n\tfclose(fp);\n\tm_pRoot->AddChild(pGeom);\n#else\n\tInputSOG isog;\n\n\tFILE *fp = fopen(\"output.sog\", \"rb\");\n\tvtGroup *pGroup = new vtGroup;\n\tbool success = isog.ReadContents(fp, pGroup);\n\tfclose(fp);\n\tm_pRoot->AddChild(pGroup);\n#endif\n#endif\n\n\t\/\/ make a trackball controller for the camera\n\tVTLOG(\" creating trackball\\n\");\n\tm_pTrackball = new vtTrackball(3.0f);\n\tm_pTrackball->SetTarget(pScene->GetCamera());\n\tm_pTrackball->SetName2(\"Trackball\");\n\tm_pTrackball->SetRotateButton(VT_LEFT, 0);\n\tm_pTrackball->SetZoomButton(VT_LEFT|VT_RIGHT, 0);\n\tm_pTrackball->SetZoomScale(3000.0f);\n\tm_pTrackball->SetTranslateButton(VT_RIGHT, 0);\n\tpScene->AddEngine(m_pTrackball);\n\n\t\/\/ Memleak Testing\n\/\/\tGetMainFrame()->AddModelFromFile(\"E:\/3D\/Sample FLT files\/spitfire.flt\");\n\/\/\tvtNode *pNode = vtNode::LoadModel(\"E:\/3D\/Sample FLT files\/spitfire.flt\");\n\/\/\tif (pNode)\n\/\/\t\tm_pRoot->AddChild(pNode);\n\/\/\tGetMainFrame()->AddNewItem();\n\n\/\/\tosg::ref_ptr<osg::Node> node = osgDB::readNodeFile(\"E:\/3D\/Sample FLT files\/spitfire.flt\");\n\/\/\tnode = NULL;\n\n\tVTLOG(\" end of OnInit\\n\");\n\treturn TRUE;\n}\n\n\nint vtApp::OnExit(void)\n{\n\tVTLOG(\"App OnExit\\n\");\n\n\tvtCamera *pCamera = vtGetScene()->GetCamera();\n\tpCamera->Release();\n\n\tm_pRoot->Release();\n\treturn 0;\n}\n\n<commit_msg>improved shutdown<commit_after>\/\/\n\/\/ Name:     app.cpp\n\/\/ Purpose:  The application class the CManager application.\n\/\/\n\/\/ Copyright (c) 2001-2003 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#ifdef __GNUG__\n#pragma implementation\n#pragma interface\n#endif\n\n\/\/ For compilers that support precompilation, includes \"wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/NavEngines.h\"\n#include \"vtlib\/core\/vtSOG.h\"\n#include \"vtdata\/vtLog.h\"\n\n#include \"app.h\"\n#include \"frame.h\"\n\n\/\/ #include <osgDB\/ReadFile>\n\nstatic void Args(int argc, wxChar **argv)\n{\n   return;\n}\n\nIMPLEMENT_APP(vtApp)\n\nclass LogCatcher : public wxLog\n{\n    void DoLogString(const wxChar *szString, time_t t)\n\t{\n\t\tVTLOG(\" wxLog: \");\n\t\tVTLOG(szString);\n\t\tVTLOG(\"\\n\");\n\t}\n};\n\n\n\/\/\n\/\/ Initialize the app object\n\/\/\nbool vtApp::OnInit(void)\n{\n\t\/\/ Redirect the wxWindows log messages to our own logging stream\n\twxLog *logger = new LogCatcher();\n\twxLog::SetActiveTarget(logger);\n\n\tArgs(argc, argv);\n\n\tg_Log._StartLog(\"debug.txt\");\n\tVTLOG(\"CManager\\n\");\n\n\t\/\/\n\t\/\/ Create the main frame window\n\t\/\/\n\tVTLOG(\"Creating frame\\n\");\n\twxString title = _T(\"Content Manager\");\n\tvtFrame *frame = new vtFrame(NULL, title,\n\t\twxPoint(50, 50), wxSize(800, 600));\n\n\tVTLOG(\"Setup scene\\n\");\n\tvtScene *pScene = vtGetScene();\n\tpScene->Init();\n\tpScene->SetBgColor(RGBf(0.5f, 0.5f, 0.5f));\n\n\tVTLOG(\" creating camera\\n\");\n\tvtCamera *pCamera = pScene->GetCamera();\n\tpCamera->SetName2(\"Default Camera\");\n\n\tm_pRoot = new vtGroup();\n\tm_pRoot->SetName2(\"Root\");\n\tpScene->SetRoot(m_pRoot);\n\n#if VTLIB_SGL\n\tCreateTestSGLScene();\n#endif\n\n\t\/\/ make a simple directional light\n\tVTLOG(\" creating light\\n\");\n\tvtLight *pLight = new vtLight();\n\tpLight->SetName2(\"Light\");\n\tvtMovLight *pMovLight = new vtMovLight(pLight);\n\tpMovLight->SetName2(\"Movable Light\");\n\tpLight->SetAmbient(RGBf(1, 1, 1));\n\tpMovLight->SetTrans(FPoint3(0.0f, 0.0f, 5.0f));\n\tm_pRoot->AddChild(pMovLight);\n\n\t\/\/ SOG testing, currently disabled\n#if 0\n#if 0\n\t\/\/ make a yellow sphere\n\tvtMaterialArray *pMats = new vtMaterialArray();\n\tpMats->AddRGBMaterial(RGBf(1.0f, 1.0f, 0.0f), RGBf(0.0f, 0.0f, 1.0f));\n\tvtGeom *pGeom = CreateSphereGeom(pMats, 0, VT_Normals, 0.5, 16);\n\tpGeom->SetName2(\"Yellow Sphere\");\n\tpMats->Release();\n\n\tOutputSOG osog;\n\n\tFILE *fp = fopen(\"output.sog\", \"wb\");\n\tosog.WriteHeader(fp);\n\tosog.WriteSingleGeometry(fp, pGeom);\n\tfclose(fp);\n\tm_pRoot->AddChild(pGeom);\n#else\n\tInputSOG isog;\n\n\tFILE *fp = fopen(\"output.sog\", \"rb\");\n\tvtGroup *pGroup = new vtGroup;\n\tbool success = isog.ReadContents(fp, pGroup);\n\tfclose(fp);\n\tm_pRoot->AddChild(pGroup);\n#endif\n#endif\n\n\t\/\/ make a trackball controller for the camera\n\tVTLOG(\" creating trackball\\n\");\n\tm_pTrackball = new vtTrackball(3.0f);\n\tm_pTrackball->SetTarget(pScene->GetCamera());\n\tm_pTrackball->SetName2(\"Trackball\");\n\tm_pTrackball->SetRotateButton(VT_LEFT, 0);\n\tm_pTrackball->SetZoomButton(VT_LEFT|VT_RIGHT, 0);\n\tm_pTrackball->SetZoomScale(3000.0f);\n\tm_pTrackball->SetTranslateButton(VT_RIGHT, 0);\n\tpScene->AddEngine(m_pTrackball);\n\n\t\/\/ Memleak Testing\n\/\/\tGetMainFrame()->AddModelFromFile(\"E:\/3D\/Sample FLT files\/spitfire.flt\");\n\/\/\tvtNode *pNode = vtNode::LoadModel(\"E:\/3D\/Sample FLT files\/spitfire.flt\");\n\/\/\tif (pNode)\n\/\/\t\tm_pRoot->AddChild(pNode);\n\/\/\tGetMainFrame()->AddNewItem();\n\n\/\/\tosg::ref_ptr<osg::Node> node = osgDB::readNodeFile(\"E:\/3D\/Sample FLT files\/spitfire.flt\");\n\/\/\tnode = NULL;\n\n\tVTLOG(\" end of OnInit\\n\");\n\treturn TRUE;\n}\n\n\nint vtApp::OnExit(void)\n{\n\tVTLOG(\"App OnExit\\n\");\n\n\tvtCamera *pCamera = vtGetScene()->GetCamera();\n\tpCamera->Release();\n\n\tvtGetScene()->SetRoot(NULL);\n\tm_pRoot->Release();\n\n\tvtGetScene()->Shutdown();\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2007-2020 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 \"FdIstream.hxx\"\n#include \"istream.hxx\"\n#include \"New.hxx\"\n#include \"Result.hxx\"\n#include \"io\/Buffered.hxx\"\n#include \"io\/UniqueFileDescriptor.hxx\"\n#include \"pool\/pool.hxx\"\n#include \"fb_pool.hxx\"\n#include \"SliceFifoBuffer.hxx\"\n#include \"system\/Error.hxx\"\n#include \"event\/TimerEvent.hxx\"\n\n#include <assert.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <errno.h>\n#include <limits.h>\n\n\/**\n * If EAGAIN occurs (on NFS), we try again after 100ms.  We can't\n * check SocketEvent::READ, because the kernel always indicates VFS files as\n * \"readable without blocking\".\n *\/\nstatic constexpr Event::Duration file_retry_timeout = std::chrono::milliseconds(100);\n\nclass FdIstream final : public Istream {\n\tUniqueFileDescriptor fd;\n\n\tFdType fd_type;\n\n\tbool eof = false;\n\n\t\/**\n\t * A timer to retry reading after EAGAIN.\n\t *\/\n\tTimerEvent retry_event;\n\n\tSliceFifoBuffer buffer;\n\tconst char *path;\n\npublic:\n\tFdIstream(struct pool &p, EventLoop &event_loop,\n\t\t  UniqueFileDescriptor &&_fd, FdType _fd_type,\n\t\t  const char *_path) noexcept\n\t\t:Istream(p),\n\t\t fd(std::move(_fd)), fd_type(_fd_type),\n\t\t retry_event(event_loop, BIND_THIS_METHOD(EventCallback)),\n\t\t path(_path) {}\n\n\t~FdIstream() noexcept {\n\t\tbuffer.FreeIfDefined();\n\t}\n\nprivate:\n\tvoid TryData() noexcept;\n\tvoid TryDirect() noexcept;\n\n\tvoid TryRead() noexcept {\n\t\tif (!fd.IsDefined())\n\t\t\tSendFromBuffer(buffer);\n\t\telse if (CheckDirect(fd_type))\n\t\t\tTryDirect();\n\t\telse\n\t\t\tTryData();\n\t}\n\n\tvoid EventCallback() noexcept {\n\t\tTryRead();\n\t}\n\n\t\/* virtual methods from class Istream *\/\n\n\toff_t _GetAvailable(bool partial) noexcept override;\n\n\tvoid _Read() noexcept override {\n\t\tretry_event.Cancel();\n\t\tTryRead();\n\t}\n\n\tint _AsFd() noexcept override;\n\tvoid _Close() noexcept override {\n\t\tDestroy();\n\t}\n};\n\ninline void\nFdIstream::TryData() noexcept\n{\n\tif (buffer.IsNull()) {\n\t\tbuffer.Allocate(fb_pool_get());\n\t} else {\n\t\tconst size_t available = buffer.GetAvailable();\n\t\tif (available > 0) {\n\t\t\tif (SendFromBuffer(buffer) == 0)\n\t\t\t\t\/* not a single byte was consumed: we may have been\n\t\t\t\t   closed, and we must bail out now *\/\n\t\t\t\treturn;\n\t\t}\n\t}\n\n\tssize_t nbytes = read_to_buffer(fd.Get(), buffer, INT_MAX);\n\tif (nbytes == 0) {\n\t\tfd.Close();\n\t\tif (buffer.empty())\n\t\t\tDestroyEof();\n\t\treturn;\n\t} else if (nbytes == -1) {\n\t\tDestroyError(std::make_exception_ptr(FormatErrno(\"Failed to read from '%s'\",\n\t\t\t\t\t\t\t\t path)));\n\t\treturn;\n\t}\n\n\tassert(!buffer.empty());\n\n\tSendFromBuffer(buffer);\n}\n\ninline void\nFdIstream::TryDirect() noexcept\n{\n\t\/* first consume the rest of the buffer *\/\n\tif (ConsumeFromBuffer(buffer) > 0)\n\t\treturn;\n\n\tssize_t nbytes = InvokeDirect(fd_type, fd.Get(), INT_MAX);\n\tif (nbytes == ISTREAM_RESULT_CLOSED)\n\t\t\/* this stream was closed during the direct() callback *\/\n\t\treturn;\n\n\tif (nbytes > 0 || nbytes == ISTREAM_RESULT_BLOCKING) {\n\t} else if (nbytes == ISTREAM_RESULT_EOF) {\n\t\tDestroyEof();\n\t} else if (errno == EAGAIN) {\n\t\t\/* this should only happen for splice(SPLICE_F_NONBLOCK) from\n\t\t   NFS files - unfortunately we cannot use SocketEvent::READ\n\t\t   here, so we just install a timer which retries after\n\t\t   100ms *\/\n\n\t\tretry_event.Schedule(file_retry_timeout);\n\t} else {\n\t\t\/* XXX *\/\n\t\tDestroyError(std::make_exception_ptr(FormatErrno(\"Failed to read from '%s'\",\n\t\t\t\t\t\t\t\t path)));\n\t}\n}\n\n\/*\n * istream implementation\n *\n *\/\n\noff_t\nFdIstream::_GetAvailable(bool partial) noexcept\n{\n\treturn partial\n\t\t? buffer.GetAvailable()\n\t\t: -1;\n}\n\nint\nFdIstream::_AsFd() noexcept\n{\n\tif (!fd.IsDefined())\n\t\treturn -1;\n\n\tint result_fd = fd.Steal();\n\tDestroy();\n\treturn result_fd;\n}\n\n\/*\n * constructor and public methods\n *\n *\/\n\nUnusedIstreamPtr\nNewFdIstream(EventLoop &event_loop, struct pool &pool,\n\t     const char *path,\n\t     UniqueFileDescriptor fd, FdType fd_type) noexcept\n{\n\tassert(fd.IsDefined());\n\n\treturn NewIstreamPtr<FdIstream>(pool, event_loop,\n\t\t\t\t\tstd::move(fd), fd_type, path);\n}\n<commit_msg>istream\/fd: remove unused field `eof`<commit_after>\/*\n * Copyright 2007-2020 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 \"FdIstream.hxx\"\n#include \"istream.hxx\"\n#include \"New.hxx\"\n#include \"Result.hxx\"\n#include \"io\/Buffered.hxx\"\n#include \"io\/UniqueFileDescriptor.hxx\"\n#include \"pool\/pool.hxx\"\n#include \"fb_pool.hxx\"\n#include \"SliceFifoBuffer.hxx\"\n#include \"system\/Error.hxx\"\n#include \"event\/TimerEvent.hxx\"\n\n#include <assert.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <errno.h>\n#include <limits.h>\n\n\/**\n * If EAGAIN occurs (on NFS), we try again after 100ms.  We can't\n * check SocketEvent::READ, because the kernel always indicates VFS files as\n * \"readable without blocking\".\n *\/\nstatic constexpr Event::Duration file_retry_timeout = std::chrono::milliseconds(100);\n\nclass FdIstream final : public Istream {\n\tUniqueFileDescriptor fd;\n\n\tFdType fd_type;\n\n\t\/**\n\t * A timer to retry reading after EAGAIN.\n\t *\/\n\tTimerEvent retry_event;\n\n\tSliceFifoBuffer buffer;\n\tconst char *path;\n\npublic:\n\tFdIstream(struct pool &p, EventLoop &event_loop,\n\t\t  UniqueFileDescriptor &&_fd, FdType _fd_type,\n\t\t  const char *_path) noexcept\n\t\t:Istream(p),\n\t\t fd(std::move(_fd)), fd_type(_fd_type),\n\t\t retry_event(event_loop, BIND_THIS_METHOD(EventCallback)),\n\t\t path(_path) {}\n\n\t~FdIstream() noexcept {\n\t\tbuffer.FreeIfDefined();\n\t}\n\nprivate:\n\tvoid TryData() noexcept;\n\tvoid TryDirect() noexcept;\n\n\tvoid TryRead() noexcept {\n\t\tif (!fd.IsDefined())\n\t\t\tSendFromBuffer(buffer);\n\t\telse if (CheckDirect(fd_type))\n\t\t\tTryDirect();\n\t\telse\n\t\t\tTryData();\n\t}\n\n\tvoid EventCallback() noexcept {\n\t\tTryRead();\n\t}\n\n\t\/* virtual methods from class Istream *\/\n\n\toff_t _GetAvailable(bool partial) noexcept override;\n\n\tvoid _Read() noexcept override {\n\t\tretry_event.Cancel();\n\t\tTryRead();\n\t}\n\n\tint _AsFd() noexcept override;\n\tvoid _Close() noexcept override {\n\t\tDestroy();\n\t}\n};\n\ninline void\nFdIstream::TryData() noexcept\n{\n\tif (buffer.IsNull()) {\n\t\tbuffer.Allocate(fb_pool_get());\n\t} else {\n\t\tconst size_t available = buffer.GetAvailable();\n\t\tif (available > 0) {\n\t\t\tif (SendFromBuffer(buffer) == 0)\n\t\t\t\t\/* not a single byte was consumed: we may have been\n\t\t\t\t   closed, and we must bail out now *\/\n\t\t\t\treturn;\n\t\t}\n\t}\n\n\tssize_t nbytes = read_to_buffer(fd.Get(), buffer, INT_MAX);\n\tif (nbytes == 0) {\n\t\tfd.Close();\n\t\tif (buffer.empty())\n\t\t\tDestroyEof();\n\t\treturn;\n\t} else if (nbytes == -1) {\n\t\tDestroyError(std::make_exception_ptr(FormatErrno(\"Failed to read from '%s'\",\n\t\t\t\t\t\t\t\t path)));\n\t\treturn;\n\t}\n\n\tassert(!buffer.empty());\n\n\tSendFromBuffer(buffer);\n}\n\ninline void\nFdIstream::TryDirect() noexcept\n{\n\t\/* first consume the rest of the buffer *\/\n\tif (ConsumeFromBuffer(buffer) > 0)\n\t\treturn;\n\n\tssize_t nbytes = InvokeDirect(fd_type, fd.Get(), INT_MAX);\n\tif (nbytes == ISTREAM_RESULT_CLOSED)\n\t\t\/* this stream was closed during the direct() callback *\/\n\t\treturn;\n\n\tif (nbytes > 0 || nbytes == ISTREAM_RESULT_BLOCKING) {\n\t} else if (nbytes == ISTREAM_RESULT_EOF) {\n\t\tDestroyEof();\n\t} else if (errno == EAGAIN) {\n\t\t\/* this should only happen for splice(SPLICE_F_NONBLOCK) from\n\t\t   NFS files - unfortunately we cannot use SocketEvent::READ\n\t\t   here, so we just install a timer which retries after\n\t\t   100ms *\/\n\n\t\tretry_event.Schedule(file_retry_timeout);\n\t} else {\n\t\t\/* XXX *\/\n\t\tDestroyError(std::make_exception_ptr(FormatErrno(\"Failed to read from '%s'\",\n\t\t\t\t\t\t\t\t path)));\n\t}\n}\n\n\/*\n * istream implementation\n *\n *\/\n\noff_t\nFdIstream::_GetAvailable(bool partial) noexcept\n{\n\treturn partial\n\t\t? buffer.GetAvailable()\n\t\t: -1;\n}\n\nint\nFdIstream::_AsFd() noexcept\n{\n\tif (!fd.IsDefined())\n\t\treturn -1;\n\n\tint result_fd = fd.Steal();\n\tDestroy();\n\treturn result_fd;\n}\n\n\/*\n * constructor and public methods\n *\n *\/\n\nUnusedIstreamPtr\nNewFdIstream(EventLoop &event_loop, struct pool &pool,\n\t     const char *path,\n\t     UniqueFileDescriptor fd, FdType fd_type) noexcept\n{\n\tassert(fd.IsDefined());\n\n\treturn NewIstreamPtr<FdIstream>(pool, event_loop,\n\t\t\t\t\tstd::move(fd), fd_type, path);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"DriverAccess.h\"\n#include \"Public.h\"\n\n\/\/------------------------------------------------------------------------------------------------\n\nUsbDkDriverAccess::UsbDkDriverAccess()\n{\n    m_hDriver = CreateFile(USBDK_USERMODE_NAME,\n                           GENERIC_READ | GENERIC_WRITE,\n                           0,\n                           NULL,\n                           CREATE_ALWAYS,\n                           FILE_ATTRIBUTE_NORMAL,\n                           NULL);\n\n    if (m_hDriver == INVALID_HANDLE_VALUE)\n    {\n        throw UsbDkDriverAccessException(TEXT(\"Failed to open device symlink\"));\n    }\n}\n\/\/------------------------------------------------------------------------------------------------\n\nUsbDkDriverAccess::~UsbDkDriverAccess()\n{\n    CloseHandle(m_hDriver);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::GetDevicesList(PUSB_DK_DEVICE_ID &DevicesArray, ULONG &NumberDevice)\n{\n    DevicesArray = nullptr;\n    for (;;)\n    {\n        DWORD   bytesReturned;\n\n        \/\/ get number of devices\n        if (!DeviceIoControl(m_hDriver,\n            IOCTL_USBDK_COUNT_DEVICES,\n            nullptr,\n            0,\n            &NumberDevice,\n            sizeof(NumberDevice),\n            &bytesReturned,\n            nullptr))\n        {\n            throw UsbDkDriverAccessException(TEXT(\"Counting devices failed\"));\n        }\n\n        \/\/ get list of devices\n        delete DevicesArray;\n        DevicesArray = new USB_DK_DEVICE_ID[NumberDevice];\n\n        if (!DeviceIoControl(m_hDriver,\n            IOCTL_USBDK_ENUM_DEVICES,\n            nullptr,\n            0,\n            DevicesArray,\n            NumberDevice * sizeof(USB_DK_DEVICE_ID),\n            &bytesReturned,\n            nullptr))\n        {\n            DWORD err = GetLastError();\n            if (err == ERROR_INSUFFICIENT_BUFFER || err == ERROR_MORE_DATA)\n            {\n                continue;\n            }\n            else\n            {\n                UsbDkDriverAccessException(TEXT(\"Enumiration devices failed in DeviceIoControl.\"), err);\n            }\n        }\n        break;\n    }\n}\n\/\/------------------------------------------------------------------------------------------------\nvoid UsbDkDriverAccess::ReleaseDeviceList(PUSB_DK_DEVICE_ID DevicesArray)\n{\n    delete[] DevicesArray;\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::ResetDevice(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_RESET_DEVICE, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::AddRedirect(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_ADD_REDIRECT, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::RemoveRedirect(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_REMOVE_REDIRECT, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::SendIoctlWithDeviceId(DWORD ControlCode,\n                                              USB_DK_DEVICE_ID &Id)\n{\n    DWORD   bytesReturned;\n    if (!DeviceIoControl(m_hDriver, ControlCode, &Id, sizeof(Id),\n                         nullptr, 0, &bytesReturned, nullptr))\n    {\n        throw UsbDkDriverAccessException(TEXT(\"Ioctl failed\"));\n    }\n}\n<commit_msg>UsbDkHelper: Fix devices number on enumeration<commit_after>#include \"stdafx.h\"\n#include \"DriverAccess.h\"\n#include \"Public.h\"\n\n\/\/------------------------------------------------------------------------------------------------\n\nUsbDkDriverAccess::UsbDkDriverAccess()\n{\n    m_hDriver = CreateFile(USBDK_USERMODE_NAME,\n                           GENERIC_READ | GENERIC_WRITE,\n                           0,\n                           NULL,\n                           CREATE_ALWAYS,\n                           FILE_ATTRIBUTE_NORMAL,\n                           NULL);\n\n    if (m_hDriver == INVALID_HANDLE_VALUE)\n    {\n        throw UsbDkDriverAccessException(TEXT(\"Failed to open device symlink\"));\n    }\n}\n\/\/------------------------------------------------------------------------------------------------\n\nUsbDkDriverAccess::~UsbDkDriverAccess()\n{\n    CloseHandle(m_hDriver);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::GetDevicesList(PUSB_DK_DEVICE_ID &DevicesArray, ULONG &NumberDevice)\n{\n    DevicesArray = nullptr;\n    for (;;)\n    {\n        DWORD   bytesReturned;\n\n        \/\/ get number of devices\n        if (!DeviceIoControl(m_hDriver,\n            IOCTL_USBDK_COUNT_DEVICES,\n            nullptr,\n            0,\n            &NumberDevice,\n            sizeof(NumberDevice),\n            &bytesReturned,\n            nullptr))\n        {\n            throw UsbDkDriverAccessException(TEXT(\"Counting devices failed\"));\n        }\n\n        \/\/ get list of devices\n        delete DevicesArray;\n        DevicesArray = new USB_DK_DEVICE_ID[NumberDevice];\n\n        if (!DeviceIoControl(m_hDriver,\n            IOCTL_USBDK_ENUM_DEVICES,\n            nullptr,\n            0,\n            DevicesArray,\n            NumberDevice * sizeof(USB_DK_DEVICE_ID),\n            &bytesReturned,\n            nullptr))\n        {\n            DWORD err = GetLastError();\n            if (err == ERROR_INSUFFICIENT_BUFFER || err == ERROR_MORE_DATA)\n            {\n                continue;\n            }\n            else\n            {\n                UsbDkDriverAccessException(TEXT(\"Enumiration devices failed in DeviceIoControl.\"), err);\n            }\n        }\n        NumberDevice = bytesReturned \/ sizeof(USB_DK_DEVICE_ID);\n        break;\n    }\n}\n\/\/------------------------------------------------------------------------------------------------\nvoid UsbDkDriverAccess::ReleaseDeviceList(PUSB_DK_DEVICE_ID DevicesArray)\n{\n    delete[] DevicesArray;\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::ResetDevice(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_RESET_DEVICE, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::AddRedirect(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_ADD_REDIRECT, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::RemoveRedirect(USB_DK_DEVICE_ID &DeviceID)\n{\n    SendIoctlWithDeviceId(IOCTL_USBDK_REMOVE_REDIRECT, DeviceID);\n}\n\/\/------------------------------------------------------------------------------------------------\n\nvoid UsbDkDriverAccess::SendIoctlWithDeviceId(DWORD ControlCode,\n                                              USB_DK_DEVICE_ID &Id)\n{\n    DWORD   bytesReturned;\n    if (!DeviceIoControl(m_hDriver, ControlCode, &Id, sizeof(Id),\n                         nullptr, 0, &bytesReturned, nullptr))\n    {\n        throw UsbDkDriverAccessException(TEXT(\"Ioctl failed\"));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   KWSys - Kitware System Library\n  Module:    testhash.cxx\n\n  Copyright (c) Kitware, Inc., Insight Consortium.  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 notices for more information.\n\n=========================================================================*\/\n#include \"kwsysPrivate.h\"\n#include KWSYS_HEADER(hash_map.hxx)\n#include KWSYS_HEADER(hash_set.hxx)\n#include KWSYS_HEADER(ios\/iostream)\n\n\/\/ Work-around CMake dependency scanning limitation.  This must\n\/\/ duplicate the above list of headers.\n#if 0\n# include \"hash_map.hxx.in\"\n# include \"hash_set.hxx.in\"\n# include \"kwsys_ios_iostream.h.in\"\n#endif\n\n#if defined(_MSC_VER)\n# pragma warning (disable:4786)\n#endif\n\ntemplate class kwsys::hash_map<const char*, int>;\ntemplate class kwsys::hash_set<int>;\n\nbool test_hash_map()\n{\n  typedef kwsys::hash_map<const char*, int> mtype;\n  mtype m;\n  const char* keys[] = {\"hello\", \"world\"};\n  m[keys[0]] = 1;\n  m.insert(mtype::value_type(keys[1], 2));\n  int sum = 0;\n  for(mtype::iterator mi = m.begin(); mi != m.end(); ++mi)\n    {\n    kwsys_ios::cout << \"Found entry [\" << mi->first << \",\" << mi->second << \"]\"\n                    << kwsys_ios::endl;\n    sum += mi->second;\n    }\n  return sum == 3;\n}\n\nbool test_hash_set()\n{\n  typedef kwsys::hash_set<int> stype;\n  stype s;\n  s.insert(1);\n  s.insert(2);\n  int sum = 0;\n  for(stype::iterator si = s.begin(); si != s.end(); ++si)\n    {\n    kwsys_ios::cout << \"Found entry [\" << *si << \"]\" << kwsys_ios::endl;\n    sum += *si;\n    }\n  return sum == 3;\n}\n\nint main()\n{\n  bool result = true;\n  result = test_hash_map() && result;\n  result = test_hash_set() && result;\n  return result? 0:1;\n}\n<commit_msg>ENH: Added include-work-around for hashtable.hxx.in dependency.<commit_after>\/*=========================================================================\n\n  Program:   KWSys - Kitware System Library\n  Module:    testhash.cxx\n\n  Copyright (c) Kitware, Inc., Insight Consortium.  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 notices for more information.\n\n=========================================================================*\/\n#include \"kwsysPrivate.h\"\n#include KWSYS_HEADER(hash_map.hxx)\n#include KWSYS_HEADER(hash_set.hxx)\n#include KWSYS_HEADER(ios\/iostream)\n\n\/\/ Work-around CMake dependency scanning limitation.  This must\n\/\/ duplicate the above list of headers.\n#if 0\n# include \"hash_map.hxx.in\"\n# include \"hash_set.hxx.in\"\n# include \"hashtable.hxx.in\"\n# include \"kwsys_ios_iostream.h.in\"\n#endif\n\n#if defined(_MSC_VER)\n# pragma warning (disable:4786)\n#endif\n\ntemplate class kwsys::hash_map<const char*, int>;\ntemplate class kwsys::hash_set<int>;\n\nbool test_hash_map()\n{\n  typedef kwsys::hash_map<const char*, int> mtype;\n  mtype m;\n  const char* keys[] = {\"hello\", \"world\"};\n  m[keys[0]] = 1;\n  m.insert(mtype::value_type(keys[1], 2));\n  int sum = 0;\n  for(mtype::iterator mi = m.begin(); mi != m.end(); ++mi)\n    {\n    kwsys_ios::cout << \"Found entry [\" << mi->first << \",\" << mi->second << \"]\"\n                    << kwsys_ios::endl;\n    sum += mi->second;\n    }\n  return sum == 3;\n}\n\nbool test_hash_set()\n{\n  typedef kwsys::hash_set<int> stype;\n  stype s;\n  s.insert(1);\n  s.insert(2);\n  int sum = 0;\n  for(stype::iterator si = s.begin(); si != s.end(); ++si)\n    {\n    kwsys_ios::cout << \"Found entry [\" << *si << \"]\" << kwsys_ios::endl;\n    sum += *si;\n    }\n  return sum == 3;\n}\n\nint main()\n{\n  bool result = true;\n  result = test_hash_map() && result;\n  result = test_hash_set() && result;\n  return result? 0:1;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"project.h\"\n\/**\n * @brief Project::Project\n * @param id\n * @param name\n *\/\nProject::Project(ID id, std::string name)\n{\n    this->files = new ProjFiles();\n    this->m_name = name;\n    this->m_id = id;\n    this->v_id = 0;\n    this->videos.clear();\n    this->saved = false;\n}\n\/**\n * @brief Project::Project\n *\/\nProject::Project(){\n    this->files = new ProjFiles();\n    this->m_name = \"\";\n    this->m_id = -1;\n    this->v_id = 0;\n    this->videos.clear();\n}\n\/**\n * @brief Project::~Project\n * Clears contents of video map\n *\/\nProject::~Project(){\n    for (auto vidIt = this->videos.begin(); vidIt != this->videos.end(); ++vidIt) {\n        delete vidIt->second;\n    }\n}\n\n\/**\n * @brief Project::remove_video\n * @param id\n *\/\nvoid Project::remove_video(ID id){\n    Video* temp = this->videos.at(id);\n    delete temp;\n    videos.erase(id);\n\n}\n\n\/**\n * @brief Project::add_video\n * @return\n *\/\nID Project::add_video(Video* vid){\n    vid->id = this->v_id;\n    this->videos.insert(std::make_pair(this->v_id, vid));\n    return this->v_id++;\n}\n\n\/**\n *  UNSFINISHED\n * @brief operator >>\n * @param is\n * @param proj\n * @return stringstream containing project information\n *\/\nProjectStream& operator>>(ProjectStream& ps, Project& proj){\n    \/\/write files\n    \/\/Read project id and name\n    ps.projFile >> proj.m_name;\n\n    \/\/ read videos\n    int vidCounter = 0;\n    std::vector<Video*> temp; \/\/ used to preserve order ov videos, important for == operator\n    ps.videos >> vidCounter;\n    if( vidCounter < 0) return ps; \/\/ if negative number of videos, loop below will\n                                   \/\/ be infinite. This is unlikely to happen. but just in case!\n    while(vidCounter--){\n        Video* v = new Video();\n        ps.videos >> *v;\n        temp.push_back(v);\n    }\n    for (auto vidIt = temp.rbegin(); vidIt != temp.rend(); ++vidIt) {  \/\/ to preserve order we add videos in reverse\n        proj.add_video(*vidIt);\n    }\n    return ps;\n}\n\/**\n * @brief operator <<\n * @param os\n * @param proj\n * @return stream\n * used for writing videos to file\n *\/\nProjectStream& operator<<(ProjectStream &ps, const Project& proj){\n    \/\/write name and id;   \n    ps.projFile << proj.m_name.c_str() << \" \";\n    \/\/write videos\n    int vidcounter = proj.videos.size();\n    ps.videos << vidcounter << \" \";\n    for(auto vid = proj.videos.rbegin(); vid != proj.videos.rend(); ++vid){\n        Video* v = vid->second;\n        if(v != nullptr){\n            ps.videos << *v << \" \";\n            vidcounter++;\n        }\n    }\n    return ps;\n}\n\n\/**\n * @brief operator <<\n * @param ps\n * @param pf\n * @return ps\n * Writes a projectfile object to projectstream\n * @deprecated\n * Shouldnt be needed, ids useless and filenames are standard.\n * isnt currently used but works as intended.\n * kept just in case.\n *\/\nProjectStream& operator<<(ProjectStream &ps,const ProjFiles& pf){\n    ps.projFile << pf.f_analysis << \" \";\n    ps.projFile << pf.f_drawings << \" \";\n    ps.projFile << pf.f_videos << \" \";\n    return ps;\n\n}\n\n\/**\n * @brief operator >>\n * @param ps\n * @param pf\n * @return ps\n * Reads files from a ProjFiles struct to a ProjectStream\n * Shouldnt be needed, ids useless and filenames are standard.\n * isnt currently used but works as intended.\n * kept just in case.\n *\/\nProjectStream& operator>>(ProjectStream &ps, ProjFiles& pf){\n    std::string dummy;\n    ps.projFile >> pf.f_analysis;\n    ps.projFile >> pf.f_drawings;\n    ps.projFile >> pf.f_videos;\n    return ps;\n}\n<commit_msg>added a couple of comments for remove video and add video<commit_after>#include \"project.h\"\n\/**\n * @brief Project::Project\n * @param id\n * @param name\n *\/\nProject::Project(ID id, std::string name)\n{\n    this->files = new ProjFiles();\n    this->m_name = name;\n    this->m_id = id;\n    this->v_id = 0;\n    this->videos.clear();\n    this->saved = false;\n}\n\/**\n * @brief Project::Project\n *\/\nProject::Project(){\n    this->files = new ProjFiles();\n    this->m_name = \"\";\n    this->m_id = -1;\n    this->v_id = 0;\n    this->videos.clear();\n}\n\/**\n * @brief Project::~Project\n * Clears contents of video map\n *\/\nProject::~Project(){\n    for (auto vidIt = this->videos.begin(); vidIt != this->videos.end(); ++vidIt) {\n        delete vidIt->second;\n    }\n}\n\n\/**\n * @brief Project::remove_video\n * @param id\n * Remove video from videos and delete its contents.\n *\/\nvoid Project::remove_video(ID id){\n    Video* temp = this->videos.at(id);\n    delete temp;\n    videos.erase(id);\n\n}\n\n\/**\n * @brief Project::add_video\n * @return Video ID to be used for identifying the video\n *\/\nID Project::add_video(Video* vid){\n    vid->id = this->v_id;\n    this->videos.insert(std::make_pair(this->v_id, vid));\n    return this->v_id++;\n}\n\n\/**\n *  UNSFINISHED\n * @brief operator >>\n * @param is\n * @param proj\n * @return stringstream containing project information\n *\/\nProjectStream& operator>>(ProjectStream& ps, Project& proj){\n    \/\/write files\n    \/\/Read project id and name\n    ps.projFile >> proj.m_name;\n\n    \/\/ read videos\n    int vidCounter = 0;\n    std::vector<Video*> temp; \/\/ used to preserve order ov videos, important for == operator\n    ps.videos >> vidCounter;\n    if( vidCounter < 0) return ps; \/\/ if negative number of videos, loop below will\n                                   \/\/ be infinite. This is unlikely to happen. but just in case!\n    while(vidCounter--){\n        Video* v = new Video();\n        ps.videos >> *v;\n        temp.push_back(v);\n    }\n    for (auto vidIt = temp.rbegin(); vidIt != temp.rend(); ++vidIt) {  \/\/ to preserve order we add videos in reverse\n        proj.add_video(*vidIt);\n    }\n    return ps;\n}\n\/**\n * @brief operator <<\n * @param os\n * @param proj\n * @return stream\n * used for writing videos to file\n *\/\nProjectStream& operator<<(ProjectStream &ps, const Project& proj){\n    \/\/write name and id;   \n    ps.projFile << proj.m_name.c_str() << \" \";\n    \/\/write videos\n    int vidcounter = proj.videos.size();\n    ps.videos << vidcounter << \" \";\n    for(auto vid = proj.videos.rbegin(); vid != proj.videos.rend(); ++vid){\n        Video* v = vid->second;\n        if(v != nullptr){\n            ps.videos << *v << \" \";\n            vidcounter++;\n        }\n    }\n    return ps;\n}\n\n\/**\n * @brief operator <<\n * @param ps\n * @param pf\n * @return ps\n * Writes a projectfile object to projectstream\n * @deprecated\n * Shouldnt be needed, ids useless and filenames are standard.\n * isnt currently used but works as intended.\n * kept just in case.\n *\/\nProjectStream& operator<<(ProjectStream &ps,const ProjFiles& pf){\n    ps.projFile << pf.f_analysis << \" \";\n    ps.projFile << pf.f_drawings << \" \";\n    ps.projFile << pf.f_videos << \" \";\n    return ps;\n\n}\n\n\/**\n * @brief operator >>\n * @param ps\n * @param pf\n * @return ps\n * Reads files from a ProjFiles struct to a ProjectStream\n * Shouldnt be needed, ids useless and filenames are standard.\n * isnt currently used but works as intended.\n * kept just in case.\n *\/\nProjectStream& operator>>(ProjectStream &ps, ProjFiles& pf){\n    std::string dummy;\n    ps.projFile >> pf.f_analysis;\n    ps.projFile >> pf.f_drawings;\n    ps.projFile >> pf.f_videos;\n    return ps;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"apfBox.h\"\n\n#include \"apfMDS.h\"\n#include <gmi_lookup.h>\n#include <cassert>\n#include <cstdlib>\n\nnamespace apf {\n\nIndices::Indices() {}\n\nIndices::Indices(int a, int b, int c): x(a),y(b),z(c) {}\n\nint& Indices::operator[](int i)\n{\n  switch (i) {\n    case 0: return x;\n    case 1: return y;\n    case 2: return z;\n    default: printf(\"i must be in {0,1,2}\"); abort(); return x;\n  }\n}\n\nIndices Indices::operator+(Indices oi)\n{\n  return Indices(x + oi.x, y + oi.y, z + oi.z);\n}\n\nIndices Indices::operator*(int s)\n{\n  return Indices(x * s, y * s, z * s);\n}\n\nIndices Indices::unit(int d)\n{\n  Indices i(0,0,0);\n  i[d] = 1;\n  return i;\n}\n\nGrid::Grid(int nx, int ny, int nz):\n  size(nx, ny, nz)\n{\n  stride[0] = 1;\n  for (int i = 0; i < 3; ++i)\n    stride[i + 1] = stride[i] * size[i];\n}\n\nint Grid::total() {return stride[3];}\n\nIndices Grid::out(int i)\n{\n  Indices is;\n  for (int j = 0; j < 3; ++j)\n    is[j] = (i % stride[j + 1]) \/ stride[j];\n  return is;\n}\n\nint Grid::in(Indices is)\n{\n  int i = 0;\n  for (int j = 0; j < 3; ++j)\n    i += is[j] * stride[j];\n  return i;\n}\n\nBoxBuilder::BoxBuilder(int nx, int ny, int nz,\n      double wx, double wy, double wz,\n      bool is):\n  grid(nx + 1, ny + 1, nz + 1),\n  mgrid(nx ? 3 : 1, ny ? 3 : 1, nz ? 3 : 1)\n{\n  for (dim = 0; dim < 3 && grid.size[dim] > 1; ++dim);\n  w[0] = nx ? (wx \/ nx) : 0;\n  w[1] = ny ? (wy \/ ny) : 0;\n  w[2] = nz ? (wz \/ nz) : 0;\n  is_simplex = is;\n  formModelTable();\n  gmi_model* gm = buildModel();\n  m = makeEmptyMdsMesh(gm, dim, false);\n  v.resize(grid.total());\n  buildMeshAndModel();\n}\n\nvoid BoxBuilder::formModelTable()\n{\n  int nd[4] = {0,0,0,0};\n  for (int i = 0; i < mgrid.total(); ++i) {\n    Indices mi = mgrid.out(i);\n    int mdim = 0;\n    for (int j = 0; j < 3; ++j)\n      if (mi[j] == 1)\n        ++mdim;\n    modelTable[i].dim = mdim;\n    modelTable[i].tag = nd[mdim]++;\n  }\n  for (int i = 0; i < 4; ++i)\n    modelCounts[i] = nd[i];\n}\n\nint BoxBuilder::getModelIndex(int i, int d)\n{\n  if (i == 0)\n    return 0;\n  if (i == grid.size[d] - 1)\n    return 2;\n  return 1;\n}\n\nIndices BoxBuilder::getModelIndices(Indices vi)\n{\n  Indices mi;\n  for (int i = 0; i < 3; ++i)\n    mi[i] = getModelIndex(vi[i], i);\n  return mi;\n}\n\nModelEntity* BoxBuilder::getModelEntity(Indices mi)\n{\n  int mj = mgrid.in(mi);\n  int mdim = modelTable[mj].dim;\n  int mtag = modelTable[mj].tag;\n  return m->findModelEntity(mdim, mtag);\n}\n\nvoid BoxBuilder::addModelUse(gmi_base* gb, agm_bdry ab, Indices di)\n{\n  int ddim = modelTable[mgrid.in(di)].dim;\n  int dtag = modelTable[mgrid.in(di)].tag;\n  agm_ent ad = gmi_look_up(gb->lookup, agm_type_from_dim(ddim), dtag);\n  agm_add_use(gb->topo, ab, ad);\n}\n\ngmi_model* BoxBuilder::buildModel()\n{\n  \/* plain malloc because gmi_destroy calls plain free *\/\n  gmi_base* gb = (gmi_base*) malloc(sizeof(*gb));\n  gb->model.ops = &gmi_base_ops;\n  gmi_base_init(gb);\n  agm_ent_type at;\n  agm_ent ae;\n  agm_bdry ab;\n  Indices di;\n  for (int i = 0; i < mgrid.total(); ++i) {\n    int mdim = modelTable[i].dim;\n    int mtag = modelTable[i].tag;\n    at = agm_type_from_dim(mdim);\n    ae = agm_add_ent(gb->topo, at);\n    gmi_set_lookup(gb->lookup, ae, mtag);\n  }\n  for (int i = 0; i < 4; ++i) {\n    at = agm_type_from_dim(i);\n    gmi_freeze_lookup(gb->lookup, at);\n    gb->model.n[i] = agm_ent_count(gb->topo, at);\n    assert(gb->model.n[i] == modelCounts[i]);\n  }\n  for (int i = 0; i < mgrid.total(); ++i) {\n    int mdim = modelTable[i].dim;\n    int mtag = modelTable[i].tag;\n    if (mdim == 0)\n      continue;\n    at = agm_type_from_dim(mdim);\n    ae = gmi_look_up(gb->lookup, at, mtag);\n    Indices mi = mgrid.out(i);\n    ab = agm_add_bdry(gb->topo, ae);\n    for (int j = 0; j < 3; ++j)\n      if (mi[j] == 1) {\n        di = mi;\n        di[j] = 0;\n        addModelUse(gb, ab, di);\n        di[j] = 2;\n        addModelUse(gb, ab, di);\n      }\n  }\n  return &gb->model;\n}\n\nvoid BoxBuilder::buildCellVert(int i)\n{\n  Indices vi = grid.out(i);\n  v[i] = m->createVert(getModelEntity(getModelIndices(vi)));\n  Vector3 pt(w[0] * vi.x, w[1] * vi.y, w[2] * vi.z);\n  m->setPoint(v[i], 0, pt);\n}\n\nMeshEntity* BoxBuilder::getVert(Indices vi)\n{\n  return v.at(grid.in(vi));\n}\n\nvoid BoxBuilder::buildCellEdges(int i)\n{\n  Indices vi = grid.out(i);\n  Indices mi = getModelIndices(vi);\n  MeshEntity* ev[2];\n  ev[0] = getVert(vi);\n  for (int j = 0; j < 3; ++j) {\n    if (mi[j] == mgrid.size[j] - 1)\n      continue;\n    ev[1] = getVert(vi + Indices::unit(j));\n    Indices emi = mi;\n    emi[j] = 1;\n    ModelEntity* me = getModelEntity(emi);\n    buildElement(m, me, Mesh::EDGE, ev);\n  }\n}\n\nvoid BoxBuilder::buildTriangles(MeshEntity* fv[4], ModelEntity* me)\n{\n  MeshEntity* tv[3];\n  tv[0] = fv[0]; tv[1] = fv[1]; tv[2] = fv[2];\n  buildElement(m, me, Mesh::TRIANGLE, tv);\n  tv[0] = fv[2]; tv[1] = fv[3]; tv[2] = fv[0];\n  buildElement(m, me, Mesh::TRIANGLE, tv);\n}\n\nvoid BoxBuilder::buildFace(MeshEntity* fv[4], ModelEntity* me)\n{\n  if (is_simplex)\n    buildTriangles(fv, me);\n  else\n    buildElement(m, me, Mesh::QUAD, fv);\n}\n\nvoid BoxBuilder::buildCellFaces(int i)\n{\n  Indices vi = grid.out(i);\n  Indices mi = getModelIndices(vi);\n  MeshEntity* fv[4];\n  fv[0] = getVert(vi);\n  for (int jx = 0; jx < 3; ++jx) {\n    int jy = (jx + 1) % 3;\n    if (mi[jx] == mgrid.size[jx] - 1 ||\n        mi[jy] == mgrid.size[jy] - 1)\n      continue;\n    fv[1] = getVert(vi + Indices::unit(jx));\n    fv[2] = getVert(vi + Indices::unit(jx) + Indices::unit(jy));\n    fv[3] = getVert(vi + Indices::unit(jy));\n    Indices emi = mi;\n    emi[jx] = 1;\n    emi[jy] = 1;\n    ModelEntity* me = getModelEntity(emi);\n    buildFace(fv, me);\n  }\n}\n\nvoid BoxBuilder::buildTets(MeshEntity* rv[8], ModelEntity* me)\n{\n  static int const tet_verts[6][4] = {\n  {0,1,2,6},\n  {0,2,3,6},\n  {0,3,7,6},\n  {0,7,4,6},\n  {0,4,5,6},\n  {0,5,1,6}};\n  for (int i = 0; i < 6; ++i) {\n    MeshEntity* tv[4];\n    for (int j = 0; j < 4; ++j)\n      tv[j] = rv[tet_verts[i][j]];\n    buildElement(m, me, Mesh::TET, tv);\n  }\n}\n\nvoid BoxBuilder::buildHex(MeshEntity* rv[8], ModelEntity* me)\n{\n  buildElement(m, me, Mesh::HEX, rv);\n}\n\nvoid BoxBuilder::buildRegion(MeshEntity* rv[8], ModelEntity* me)\n{\n  if (is_simplex)\n    buildTets(rv, me);\n  else\n    buildHex(rv, me);\n}\n\nvoid BoxBuilder::buildCellRegion(int i)\n{\n  Indices vi = grid.out(i);\n  Indices mi = getModelIndices(vi);\n  if (mi.x == mgrid.size.x - 1 ||\n      mi.y == mgrid.size.y - 1 ||\n      mi.z == mgrid.size.z - 1)\n    return;\n  MeshEntity* rv[8];\n  rv[0] = getVert(Indices(vi.x + 0, vi.y + 0, vi.z + 0));\n  rv[1] = getVert(Indices(vi.x + 1, vi.y + 0, vi.z + 0));\n  rv[2] = getVert(Indices(vi.x + 1, vi.y + 1, vi.z + 0));\n  rv[3] = getVert(Indices(vi.x + 0, vi.y + 1, vi.z + 0));\n  rv[4] = getVert(Indices(vi.x + 0, vi.y + 0, vi.z + 1));\n  rv[5] = getVert(Indices(vi.x + 1, vi.y + 0, vi.z + 1));\n  rv[6] = getVert(Indices(vi.x + 1, vi.y + 1, vi.z + 1));\n  rv[7] = getVert(Indices(vi.x + 0, vi.y + 1, vi.z + 1));\n  ModelEntity* me = getModelEntity(Indices(1,1,1));\n  buildRegion(rv, me);\n}\n\nvoid BoxBuilder::buildCell(int i, int d)\n{\n  switch (d) {\n    case 0:\n      buildCellVert(i);\n      return;\n    case 1:\n      buildCellEdges(i);\n      return;\n    case 2:\n      buildCellFaces(i);\n      return;\n    case 3:\n      buildCellRegion(i);\n      return;\n  };\n}\n\nvoid BoxBuilder::buildDimension(int d)\n{\n  for (int i = 0; i < grid.total(); ++i)\n    buildCell(i, d);\n}\n\nvoid BoxBuilder::buildMeshAndModel()\n{\n  for (int d = 0; d <= dim; ++d)\n    buildDimension(d);\n  m->acceptChanges();\n}\n\nMesh2* makeMdsBox(\n    int nex, int ney, int nez,\n    double wx, double wy, double wz, bool is)\n{\n  BoxBuilder bb(nex, ney, nez, wx, wy, wz, is);\n  return bb.m;\n}\n\n}\n<commit_msg>mds : silence one coverity warning<commit_after>#include \"apfBox.h\"\n\n#include \"apfMDS.h\"\n#include <gmi_lookup.h>\n#include <cassert>\n#include <cstdlib>\n\nnamespace apf {\n\nIndices::Indices() : x(0), y(0), z(0) {}\n\nIndices::Indices(int a, int b, int c): x(a),y(b),z(c) {}\n\nint& Indices::operator[](int i)\n{\n  switch (i) {\n    case 0: return x;\n    case 1: return y;\n    case 2: return z;\n    default: printf(\"i must be in {0,1,2}\"); abort(); return x;\n  }\n}\n\nIndices Indices::operator+(Indices oi)\n{\n  return Indices(x + oi.x, y + oi.y, z + oi.z);\n}\n\nIndices Indices::operator*(int s)\n{\n  return Indices(x * s, y * s, z * s);\n}\n\nIndices Indices::unit(int d)\n{\n  Indices i(0,0,0);\n  i[d] = 1;\n  return i;\n}\n\nGrid::Grid(int nx, int ny, int nz):\n  size(nx, ny, nz)\n{\n  stride[0] = 1;\n  for (int i = 0; i < 3; ++i)\n    stride[i + 1] = stride[i] * size[i];\n}\n\nint Grid::total() {return stride[3];}\n\nIndices Grid::out(int i)\n{\n  Indices is;\n  for (int j = 0; j < 3; ++j)\n    is[j] = (i % stride[j + 1]) \/ stride[j];\n  return is;\n}\n\nint Grid::in(Indices is)\n{\n  int i = 0;\n  for (int j = 0; j < 3; ++j)\n    i += is[j] * stride[j];\n  return i;\n}\n\nBoxBuilder::BoxBuilder(int nx, int ny, int nz,\n      double wx, double wy, double wz,\n      bool is):\n  grid(nx + 1, ny + 1, nz + 1),\n  mgrid(nx ? 3 : 1, ny ? 3 : 1, nz ? 3 : 1)\n{\n  for (dim = 0; dim < 3 && grid.size[dim] > 1; ++dim);\n  w[0] = nx ? (wx \/ nx) : 0;\n  w[1] = ny ? (wy \/ ny) : 0;\n  w[2] = nz ? (wz \/ nz) : 0;\n  is_simplex = is;\n  formModelTable();\n  gmi_model* gm = buildModel();\n  m = makeEmptyMdsMesh(gm, dim, false);\n  v.resize(grid.total());\n  buildMeshAndModel();\n}\n\nvoid BoxBuilder::formModelTable()\n{\n  int nd[4] = {0,0,0,0};\n  for (int i = 0; i < mgrid.total(); ++i) {\n    Indices mi = mgrid.out(i);\n    int mdim = 0;\n    for (int j = 0; j < 3; ++j)\n      if (mi[j] == 1)\n        ++mdim;\n    modelTable[i].dim = mdim;\n    modelTable[i].tag = nd[mdim]++;\n  }\n  for (int i = 0; i < 4; ++i)\n    modelCounts[i] = nd[i];\n}\n\nint BoxBuilder::getModelIndex(int i, int d)\n{\n  if (i == 0)\n    return 0;\n  if (i == grid.size[d] - 1)\n    return 2;\n  return 1;\n}\n\nIndices BoxBuilder::getModelIndices(Indices vi)\n{\n  Indices mi;\n  for (int i = 0; i < 3; ++i)\n    mi[i] = getModelIndex(vi[i], i);\n  return mi;\n}\n\nModelEntity* BoxBuilder::getModelEntity(Indices mi)\n{\n  int mj = mgrid.in(mi);\n  int mdim = modelTable[mj].dim;\n  int mtag = modelTable[mj].tag;\n  return m->findModelEntity(mdim, mtag);\n}\n\nvoid BoxBuilder::addModelUse(gmi_base* gb, agm_bdry ab, Indices di)\n{\n  int ddim = modelTable[mgrid.in(di)].dim;\n  int dtag = modelTable[mgrid.in(di)].tag;\n  agm_ent ad = gmi_look_up(gb->lookup, agm_type_from_dim(ddim), dtag);\n  agm_add_use(gb->topo, ab, ad);\n}\n\ngmi_model* BoxBuilder::buildModel()\n{\n  \/* plain malloc because gmi_destroy calls plain free *\/\n  gmi_base* gb = (gmi_base*) malloc(sizeof(*gb));\n  gb->model.ops = &gmi_base_ops;\n  gmi_base_init(gb);\n  agm_ent_type at;\n  agm_ent ae;\n  agm_bdry ab;\n  Indices di;\n  for (int i = 0; i < mgrid.total(); ++i) {\n    int mdim = modelTable[i].dim;\n    int mtag = modelTable[i].tag;\n    at = agm_type_from_dim(mdim);\n    ae = agm_add_ent(gb->topo, at);\n    gmi_set_lookup(gb->lookup, ae, mtag);\n  }\n  for (int i = 0; i < 4; ++i) {\n    at = agm_type_from_dim(i);\n    gmi_freeze_lookup(gb->lookup, at);\n    gb->model.n[i] = agm_ent_count(gb->topo, at);\n    assert(gb->model.n[i] == modelCounts[i]);\n  }\n  for (int i = 0; i < mgrid.total(); ++i) {\n    int mdim = modelTable[i].dim;\n    int mtag = modelTable[i].tag;\n    if (mdim == 0)\n      continue;\n    at = agm_type_from_dim(mdim);\n    ae = gmi_look_up(gb->lookup, at, mtag);\n    Indices mi = mgrid.out(i);\n    ab = agm_add_bdry(gb->topo, ae);\n    for (int j = 0; j < 3; ++j)\n      if (mi[j] == 1) {\n        di = mi;\n        di[j] = 0;\n        addModelUse(gb, ab, di);\n        di[j] = 2;\n        addModelUse(gb, ab, di);\n      }\n  }\n  return &gb->model;\n}\n\nvoid BoxBuilder::buildCellVert(int i)\n{\n  Indices vi = grid.out(i);\n  v[i] = m->createVert(getModelEntity(getModelIndices(vi)));\n  Vector3 pt(w[0] * vi.x, w[1] * vi.y, w[2] * vi.z);\n  m->setPoint(v[i], 0, pt);\n}\n\nMeshEntity* BoxBuilder::getVert(Indices vi)\n{\n  return v.at(grid.in(vi));\n}\n\nvoid BoxBuilder::buildCellEdges(int i)\n{\n  Indices vi = grid.out(i);\n  Indices mi = getModelIndices(vi);\n  MeshEntity* ev[2];\n  ev[0] = getVert(vi);\n  for (int j = 0; j < 3; ++j) {\n    if (mi[j] == mgrid.size[j] - 1)\n      continue;\n    ev[1] = getVert(vi + Indices::unit(j));\n    Indices emi = mi;\n    emi[j] = 1;\n    ModelEntity* me = getModelEntity(emi);\n    buildElement(m, me, Mesh::EDGE, ev);\n  }\n}\n\nvoid BoxBuilder::buildTriangles(MeshEntity* fv[4], ModelEntity* me)\n{\n  MeshEntity* tv[3];\n  tv[0] = fv[0]; tv[1] = fv[1]; tv[2] = fv[2];\n  buildElement(m, me, Mesh::TRIANGLE, tv);\n  tv[0] = fv[2]; tv[1] = fv[3]; tv[2] = fv[0];\n  buildElement(m, me, Mesh::TRIANGLE, tv);\n}\n\nvoid BoxBuilder::buildFace(MeshEntity* fv[4], ModelEntity* me)\n{\n  if (is_simplex)\n    buildTriangles(fv, me);\n  else\n    buildElement(m, me, Mesh::QUAD, fv);\n}\n\nvoid BoxBuilder::buildCellFaces(int i)\n{\n  Indices vi = grid.out(i);\n  Indices mi = getModelIndices(vi);\n  MeshEntity* fv[4];\n  fv[0] = getVert(vi);\n  for (int jx = 0; jx < 3; ++jx) {\n    int jy = (jx + 1) % 3;\n    if (mi[jx] == mgrid.size[jx] - 1 ||\n        mi[jy] == mgrid.size[jy] - 1)\n      continue;\n    fv[1] = getVert(vi + Indices::unit(jx));\n    fv[2] = getVert(vi + Indices::unit(jx) + Indices::unit(jy));\n    fv[3] = getVert(vi + Indices::unit(jy));\n    Indices emi = mi;\n    emi[jx] = 1;\n    emi[jy] = 1;\n    ModelEntity* me = getModelEntity(emi);\n    buildFace(fv, me);\n  }\n}\n\nvoid BoxBuilder::buildTets(MeshEntity* rv[8], ModelEntity* me)\n{\n  static int const tet_verts[6][4] = {\n  {0,1,2,6},\n  {0,2,3,6},\n  {0,3,7,6},\n  {0,7,4,6},\n  {0,4,5,6},\n  {0,5,1,6}};\n  for (int i = 0; i < 6; ++i) {\n    MeshEntity* tv[4];\n    for (int j = 0; j < 4; ++j)\n      tv[j] = rv[tet_verts[i][j]];\n    buildElement(m, me, Mesh::TET, tv);\n  }\n}\n\nvoid BoxBuilder::buildHex(MeshEntity* rv[8], ModelEntity* me)\n{\n  buildElement(m, me, Mesh::HEX, rv);\n}\n\nvoid BoxBuilder::buildRegion(MeshEntity* rv[8], ModelEntity* me)\n{\n  if (is_simplex)\n    buildTets(rv, me);\n  else\n    buildHex(rv, me);\n}\n\nvoid BoxBuilder::buildCellRegion(int i)\n{\n  Indices vi = grid.out(i);\n  Indices mi = getModelIndices(vi);\n  if (mi.x == mgrid.size.x - 1 ||\n      mi.y == mgrid.size.y - 1 ||\n      mi.z == mgrid.size.z - 1)\n    return;\n  MeshEntity* rv[8];\n  rv[0] = getVert(Indices(vi.x + 0, vi.y + 0, vi.z + 0));\n  rv[1] = getVert(Indices(vi.x + 1, vi.y + 0, vi.z + 0));\n  rv[2] = getVert(Indices(vi.x + 1, vi.y + 1, vi.z + 0));\n  rv[3] = getVert(Indices(vi.x + 0, vi.y + 1, vi.z + 0));\n  rv[4] = getVert(Indices(vi.x + 0, vi.y + 0, vi.z + 1));\n  rv[5] = getVert(Indices(vi.x + 1, vi.y + 0, vi.z + 1));\n  rv[6] = getVert(Indices(vi.x + 1, vi.y + 1, vi.z + 1));\n  rv[7] = getVert(Indices(vi.x + 0, vi.y + 1, vi.z + 1));\n  ModelEntity* me = getModelEntity(Indices(1,1,1));\n  buildRegion(rv, me);\n}\n\nvoid BoxBuilder::buildCell(int i, int d)\n{\n  switch (d) {\n    case 0:\n      buildCellVert(i);\n      return;\n    case 1:\n      buildCellEdges(i);\n      return;\n    case 2:\n      buildCellFaces(i);\n      return;\n    case 3:\n      buildCellRegion(i);\n      return;\n  };\n}\n\nvoid BoxBuilder::buildDimension(int d)\n{\n  for (int i = 0; i < grid.total(); ++i)\n    buildCell(i, d);\n}\n\nvoid BoxBuilder::buildMeshAndModel()\n{\n  for (int d = 0; d <= dim; ++d)\n    buildDimension(d);\n  m->acceptChanges();\n}\n\nMesh2* makeMdsBox(\n    int nex, int ney, int nez,\n    double wx, double wy, double wz, bool is)\n{\n  BoxBuilder bb(nex, ney, nez, wx, wy, wz, is);\n  return bb.m;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (c) 2014 Eran Pe'er.\n*\n* This program is made available under the terms of the MIT License.\n*\n* Created on Mar 10, 2014\n*\/\n\n#include <string>\n\n#include \"tpunit++.hpp\"\n#include \"fakeit.hpp\"\n\nusing namespace fakeit;\n\nstruct DtorMocking : tpunit::TestFixture\n{\n\tDtorMocking() :\n\t\tTestFixture(\n\t\t    TEST(DtorMocking::mock_virtual_dtor_with_fake), \/\/\n\t\t    TEST(DtorMocking::mock_virtual_dtor_with_when),\n            TEST(DtorMocking::mock_virtual_dtor_by_assignment),\n            TEST(DtorMocking::call_dtor_without_delete),\n            TEST(DtorMocking::spy_dtor),\n\t\t\tTEST(DtorMocking::production_takes_ownwership_with_uniqe_ptr)\/\/\n\t\t)\n\t{\n\t}\n\n\n\tstruct SomeInterface\n\t{\n\t\tvirtual ~SomeInterface() = default;\n\t};\n\n\tvoid mock_virtual_dtor_with_fake() {\n\t\tMock<SomeInterface> mock;\n\t\tFake(Dtor(mock));\n\t\tSomeInterface * i = &(mock.get());\n\t\tdelete i;\n\t\tdelete i; \/\/ second delete should not throw exception\n        Verify(Dtor(mock)).Twice();\n\t}\n\n\tvoid mock_virtual_dtor_with_when() {\n\t\tint a = 0;\n\t\tMock<SomeInterface> mock;\n\t\tWhen(Dtor(mock)).Return().Do([&](){a++; });\n\t\tSomeInterface * i = &(mock.get());\n        delete i; \/\/ do nothing\n        delete i; \/\/ a++\n        ASSERT_EQUAL(1, a);\n\t}\n\n    void mock_virtual_dtor_by_assignment() {\n        int a = 0;\n        Mock<SomeInterface> mock;\n        Dtor(mock) = [&](){a++; };\n        SomeInterface * i = &(mock.get());\n        delete i; \/\/ do nothing\n        delete i; \/\/ a++\n        ASSERT_EQUAL(2, a);\n    }\n\n\tvoid production_takes_ownwership_with_uniqe_ptr() {\n\t\tMock<SomeInterface> mock;\n\t\tFake(Dtor(mock));\n\t\tSomeInterface * i = &mock.get();\n\t\tstd::unique_ptr<SomeInterface> ptr(i);\n\t}\n\n    void call_dtor_without_delete() {\n        Mock<SomeInterface> mock;\n        Fake(Dtor(mock));\n        SomeInterface * i = &mock.get();\n        i->~SomeInterface();\n        Verify(Dtor(mock)).Once();\n    }\n\n    struct A {\n        virtual ~A(){}\n    };\n    void spy_dtor() {\n        A a;\n        Mock<A> mock(a);\n        Spy(Dtor(mock));\n        A * i = &mock.get();\n        delete i;\n        Verify(Dtor(mock)).Once();\n    }\n\n} __DtorMocking;\n<commit_msg>improve tests<commit_after>\/*\n* Copyright (c) 2014 Eran Pe'er.\n*\n* This program is made available under the terms of the MIT License.\n*\n* Created on Mar 10, 2014\n*\/\n\n#include <string>\n\n#include \"tpunit++.hpp\"\n#include \"fakeit.hpp\"\n\nusing namespace fakeit;\n\nstruct DtorMocking : tpunit::TestFixture\n{\n\tDtorMocking() :\n\t\tTestFixture(\n\t\t    TEST(DtorMocking::mock_virtual_dtor_with_fake), \/\/\n\t\t    TEST(DtorMocking::mock_virtual_dtor_with_when),\n            TEST(DtorMocking::mock_virtual_dtor_by_assignment),\n            TEST(DtorMocking::call_dtor_without_delete),\n            TEST(DtorMocking::spy_dtor),\n\t\t\tTEST(DtorMocking::production_takes_ownwership_with_uniqe_ptr)\/\/\n\t\t)\n\t{\n\t}\n\n\n\tstruct SomeInterface\n\t{\n\t\tvirtual ~SomeInterface() = default;\n\t};\n\n\tvoid mock_virtual_dtor_with_fake() {\n\t\tMock<SomeInterface> mock;\n\t\tFake(Dtor(mock));\n\t\tSomeInterface * i = &(mock.get());\n\t\tdelete i;\n\t\tdelete i; \/\/ second delete should not throw exception\n        Verify(Dtor(mock)).Twice();\n\t\tASSERT_THROW(Verify(Dtor(mock)).Once(), fakeit::VerificationException);\n\t}\n\n\tvoid mock_virtual_dtor_with_when() {\n\t\tint a = 0;\n\t\tMock<SomeInterface> mock;\n\t\tWhen(Dtor(mock)).Return().Do([&](){a++; });\n\t\tSomeInterface * i = &(mock.get());\n        delete i; \/\/ do nothing\n        delete i; \/\/ a++\n        ASSERT_EQUAL(1, a);\n\t}\n\n    void mock_virtual_dtor_by_assignment() {\n        int a = 0;\n        Mock<SomeInterface> mock;\n        Dtor(mock) = [&](){a++; };\n        SomeInterface * i = &(mock.get());\n        delete i; \/\/ do nothing\n        delete i; \/\/ a++\n        ASSERT_EQUAL(2, a);\n    }\n\n\tvoid production_takes_ownwership_with_uniqe_ptr() {\n\t\tMock<SomeInterface> mock;\n\t\tFake(Dtor(mock));\n\t\tSomeInterface * i = &mock.get();\n\t\tstd::unique_ptr<SomeInterface> ptr(i);\n\t}\n\n    void call_dtor_without_delete() {\n        Mock<SomeInterface> mock;\n        Fake(Dtor(mock));\n        SomeInterface * i = &mock.get();\n        i->~SomeInterface();\n        Verify(Dtor(mock)).Once();\n\t\tASSERT_THROW(Verify(Dtor(mock)).Twice(), fakeit::VerificationException);\n\t}\n\n    struct A {\n        virtual ~A(){}\n    };\n\n\tvoid spy_dtor() {\n        A a;\n        Mock<A> mock(a);\n        Spy(Dtor(mock));\n        A * i = &mock.get();\n        delete i;\n        Verify(Dtor(mock)).Once();\n\t\tASSERT_THROW(Verify(Dtor(mock)).Twice(), fakeit::VerificationException);\n    }\n\n} __DtorMocking;\n<|endoftext|>"}
{"text":"<commit_before>\/\/******************************************************************\n\/\/\n\/\/ Copyright 2016 Samsung Electronics All Rights Reserved.\n\/\/\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 implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n\n\n#include \"easysetup.h\"\n#include \"easysetup_wifi_conn.h\"\n\n#include <unistd.h>\n#include <string.h>\n#include <iostream>\n#include <pthread.h>\n#include <glib.h>\n#include <limits>\n#include <unistd.h>\n#define TAG \"TIZEN_ES\"\n\nusing namespace std;\n\ngboolean mainThread(GIOChannel *source, GIOCondition condition, gpointer data);\nvoid *listeningFunc(void *);\n\nGMainLoop *gMainloop;\nstatic pthread_t gThreadHandle = 0;\n\n\n\/**\n * Secure Virtual Resource database for Iotivity Server\n * It contains Server's Identity and the PSK credentials\n * of other devices which the server trusts\n *\/\n#ifdef MULTIPLE_OWNER\nstatic char CRED_FILE[] = \"oic_svr_db_server_MOT.dat\";\n#else\nstatic char CRED_FILE[] = \"oic_svr_db_server.dat\";\n#endif\n\nOCPersistentStorage ps;\n\n\/**\n * @var gIsSecured\n * @brief Variable to check if secure mode is enabled or not.\n *\/\nstatic bool gIsSecured = false;\nstatic bool gWiFiCBflag = false;\nstatic char gSSID[OIC_STRING_MAX_VALUE];\nstatic char gPasswd[OIC_STRING_MAX_VALUE];\n\nvoid PrintMenu()\n{\n    cout << \"========================\" << endl;\n    cout << \"A: Enabled Security\" << endl;\n    cout << \"B: Init & Start EasySetup\" << endl;\n    cout << \"C: Set DeviceInfo\" << endl;\n    cout << \"D: Connect to TargetAP\" << endl;\n    cout << \"E: Show Menu.......\" << endl;\n    cout << \"Q: Terminate\" << endl;\n    cout << \"========================\" << endl;\n}\n\nvoid ConnectRequestCbInApp(ESConnectRequest *connectRequest)\n{\n    cout << \"ConnectRequestCbInApp IN\" << endl;\n\n    if(connectRequest == NULL)\n    {\n        cout << \"connectRequest is NULL\" << endl;\n        return ;\n    }\n\n    for(int i = 0 ; i < connectRequest->numRequest ; ++i)\n    {\n        cout << \"connect : \" << connectRequest->connect[i] << endl;\n    }\n\n    cout << \"ConnectRequestCbInApp OUT\" << endl;\n    PrintMenu();\n}\n\nvoid WiFiConfProvCbInApp(ESWiFiConfData *eventData)\n{\n    cout << \"WiFiConfProvCbInApp IN\" << endl;\n    gWiFiCBflag = true;\n\n    ESSetState(ES_STATE_CONNECTING_TO_ENROLLER);\n\n    if(eventData == NULL)\n    {\n        cout << \"ESWiFiConfData is NULL\" << endl;\n        return ;\n    }\n\n    cout << \"SSID : \" << eventData->ssid << endl;\n    cout << \"Password : \" << eventData->pwd << endl;\n    cout << \"AuthType : \" << eventData->authtype << endl;\n    cout << \"EncType : \" << eventData->enctype << endl;\n\n    memset(gSSID, 0, OIC_STRING_MAX_VALUE);\n    memset(gPasswd, 0, OIC_STRING_MAX_VALUE);\n    if(eventData->ssid != NULL)\n    {\n        strncpy(gSSID, eventData->ssid, strlen(eventData->ssid));\n    }\n\n    if(eventData->pwd != NULL)\n    {\n        strncpy(gPasswd, eventData->pwd, strlen(eventData->pwd));\n    }\n\n    cout << \"WiFiConfProvCbInApp OUT\" << endl;\n    PrintMenu();\n}\n\nvoid DevConfProvCbInApp(ESDevConfData *eventData)\n{\n    cout << \"DevConfProvCbInApp IN\" << endl;\n\n    if(eventData == NULL)\n    {\n        cout << \"ESDevConfData is NULL\" << endl;\n        return ;\n    }\n\n    cout << \"Language : \" << eventData->language << endl;\n    cout << \"Country : \" << eventData->country << endl;\n\n    cout << \"DevConfProvCbInApp OUT\" << endl;\n    PrintMenu();\n}\n\nvoid CoapCloudConfProvCbInApp(ESCoapCloudConfData *eventData)\n{\n    cout << \"CoapCloudConfProvCbInApp IN\" << endl;\n\n    if(eventData == NULL)\n    {\n        cout << \"ESCoapCloudConfData is NULL\" << endl;\n        return ;\n    }\n\n    cout << \"AuthCode : \" << eventData->authCode << endl;\n    cout << \"AcessToken : \" <<  eventData->accessToken << endl;\n    cout << \"AcessTokenType : \"<< eventData->accessTokenType << endl;\n    cout << \"AuthProvider : \" << eventData->authProvider << endl;\n    cout << \"CI Server : \" << eventData->ciServer << endl;\n\n    cout << \"CoapCloudConfProvCbInApp OUT\" << endl;\n    PrintMenu();\n}\n\nESProvisioningCallbacks gCallbacks = {\n    .ConnectRequestCb = &ConnectRequestCbInApp,\n    .WiFiConfProvCb = &WiFiConfProvCbInApp,\n    .DevConfProvCb = &DevConfProvCbInApp,\n    .CoapCloudConfProvCb = &CoapCloudConfProvCbInApp\n};\n\nFILE* server_fopen(const char *path, const char *mode)\n{\n    if (0 == strcmp(path, OC_SECURITY_DB_DAT_FILE_NAME))\n    {\n        return fopen(CRED_FILE, mode);\n    }\n    else\n    {\n        return fopen(path, mode);\n    }\n}\n\nvoid EnableSecurity()\n{\n    cout << \"Inside EnableSecurity API..\" << endl;\n\n    gIsSecured = true;\n\n    \/\/ Initialize Persistent Storage for SVR database\n    ps = (OCPersistentStorage){ server_fopen, fread, fwrite, fclose, unlink };\n    OCRegisterPersistentStorageHandler(&ps);\n}\n\nvoid StartEasySetup()\n{\n    cout << \"StartEasySetup IN\" << endl;\n\n    if (OCInit(NULL, 0, OC_SERVER) != OC_STACK_OK)\n    {\n        cout << \"OCStack init error!!\" << endl;\n        return;\n    }\n\n    ESResourceMask resourcemMask = (ESResourceMask) (ES_WIFICONF_RESOURCE | ES_COAPCLOUDCONF_RESOURCE | ES_DEVCONF_RESOURCE);\n    cout << \"resourcemMask : \" << resourcemMask << endl;\n    if(ESInitEnrollee(gIsSecured, resourcemMask, gCallbacks) != ES_OK)\n    {\n        cout << \"OCStack init error!!\" << endl;\n        return;\n    }\n\n    cout << \"ESInitEnrollee Success\" << endl;\n\n    if(gThreadHandle == 0) {\n\n        if (pthread_create(&gThreadHandle, NULL, listeningFunc, NULL)) {\n            cout << \"Thread creation failed\" << endl;\n            return;\n        }\n\n    }\n\n    ESSetState(ES_STATE_INIT);\n    ESSetErrorCode(ES_ERRCODE_NO_ERROR);\n\n    int ret = 0;\n\n    ret = TizenWiFiInit();\n    if(ret != WIFI_NO_ERROR) {\n        cout << \"WiFi Init Error\" << endl;\n    }\n    else\n        cout << \"WiFi Init Success\" << endl;\n\n    ret = TizenWiFiScanStart();\n    if(ret != WIFI_NO_ERROR) {\n        cout << \"WiFi Scan Error\" << endl;\n    }\n    else\n        cout << \"WiFi Scan Success\" << endl;\n\n    cout << \"StartEasySetup OUT\" << endl;\n}\n\nvoid SetDeviceInfo()\n{\n    cout << \"SetDeviceInfo IN\" << endl;\n\n    ESDeviceProperty deviceProperty = {\n        {{WIFI_11G, WIFI_11N, WIFI_11AC, WiFi_EOF}, WIFI_5G}, {\"Tizen Device\"}\n    };\n\n    \/\/ Set user properties if needed\n\n    \/\/ Set device properties\n    if(ESSetDeviceProperty(&deviceProperty) == ES_ERROR)\n    {\n        cout << \"ESSetDeviceProperty Error\" << endl;\n    }\n\n    cout << \"SetDeviceInfo OUT\" << endl;\n}\n\nvoid StopEasySetup()\n{\n    cout << \"StopEasySetup IN\" << endl;\n    if (ESTerminateEnrollee() == ES_ERROR)\n    {\n        cout << \"ESTerminateEnrollee Failed!!\" << endl;\n        return;\n    }\n\n    \/\/ Deinit Tizen Wifi\n    TizenWiFiDeinit();\n\n    \/\/ Stop OC Stack\n    if (OCStop() != OC_STACK_OK)\n    {\n        cout << \"OCStack stop failed!!\" << endl;\n        return;\n    }\n\n    if(gThreadHandle != 0) {\n        pthread_cancel(gThreadHandle);\n        pthread_join(gThreadHandle, NULL);\n    }\n\n    cout << \"StopEasySetup OUT\" << endl;\n}\n\nvoid ConnectToTargetAP()\n{\n    if(!gWiFiCBflag){\n        cout << \"WiFi Provisioning is needed to be preceded\" << endl;\n        return;\n    }\n\n    WiFiConnErrCode ret = WIFI_NO_ERROR;\n    ret = TizenWiFiScanStart();\n    if(ret != WIFI_NO_ERROR){\n        ESSetState(ES_STATE_FAILED_TO_CONNECT_TO_ENROLLER);\n        ESSetErrorCode(ES_ERRCODE_UNKNOWN);\n        cout << \"WiFi Scan Error\" << endl;\n        return;\n    }\n    else{\n        cout << \"WiFi Scan Succss\" << endl;\n    }\n\n    ret = TizenWiFiConn(gSSID, gPasswd);\n    if(ret != WIFI_NO_ERROR) {\n        ESSetState(ES_STATE_FAILED_TO_CONNECT_TO_ENROLLER);\n\n        if(ret == WIFI_NOTFOUND_SSID_ERROR) {\n            ESSetErrorCode(ES_ERRCODE_SSID_NOT_FOUND);\n        }\n        else if(ret == WIFI_WRONG_PWD_ERROR) {\n            ESSetErrorCode(ES_ERRCODE_PW_WRONG);\n        }\n        else {\n            ESSetErrorCode(ES_ERRCODE_TIMEOUT);\n        }\n        cout << \"WiFi Connection Error\" << endl;\n        return;\n    }\n    else {\n        cout << \"WIFI Connection Success\" << endl;\n        ESSetState(ES_STATE_CONNECTED_TO_ENROLLER);\n        ESSetErrorCode(ES_ERRCODE_NO_ERROR);\n    }\n}\n\ngboolean mainThread(GIOChannel *source, GIOCondition condition, gpointer data)\n{\n    char entered;\n    cin >> entered;\n    cin.ignore(numeric_limits<streamsize>::max(), '\\n');\n\n    switch (entered) {\n        case 'Q': \/\/ quit\n        case 'q':\n            StopEasySetup();\n            break;\n\n        case 'A': \/\/ Enable Security\n        case 'a':\n#ifdef __WITH_DTLS__\n            EnableSecurity();\n#else\n            cout << \"Sample is not built with secured mode\" << endl;\n#endif\n            PrintMenu();\n            break;\n\n        case 'B': \/\/ Init EasySetup\n        case 'b':\n            StartEasySetup();\n            PrintMenu();\n            break;\n\n        case 'C': \/\/ Set Device Info\n        case 'c':\n            SetDeviceInfo();\n            PrintMenu();\n            break;\n\n        case 'D': \/\/ Start to connect target AP\n        case 'd':\n            ConnectToTargetAP();\n            PrintMenu();\n            break;\n\n        case 'E': \/\/ Print Menu\n        case 'e':\n            PrintMenu();\n            break;\n\n        default:\n            cout << \"Wrong option\" << endl;\n            PrintMenu();\n            break;\n    }\n\n    if(entered == 'q' || entered == 'Q'){\n        g_main_loop_quit(gMainloop);\n    }\n\n    return TRUE;\n}\n\nint main()\n{\n    cout << \"#########################\" << endl;\n    cout << \"EasySetup Enrollee SAMPLE\" << endl;\n    cout << \"#########################\" << endl;\n    PrintMenu();\n\n    gMainloop = g_main_loop_new (NULL, FALSE);\n    if(gMainloop == NULL) {\n        cout << \"Create Main Loop Error\" << endl;\n        return 0;\n    }\n\n    GIOChannel *channel = g_io_channel_unix_new(0);\n    g_io_add_watch(channel, (GIOCondition)(G_IO_IN|G_IO_ERR|G_IO_HUP|G_IO_NVAL), mainThread, NULL);\n\n    g_main_loop_run (gMainloop);\n\n    cout << \"#########################\" << endl;\n    cout << \"Terminate Enrollee SAMPLE\" << endl;\n    cout << \"#########################\" << endl;\n\n    return 0;\n}\n\nvoid *listeningFunc(void*)\n{\n    OCStackResult result;\n\n    while (true)\n    {\n        result = OCProcess();\n        if (result != OC_STACK_OK)\n        {\n           cout<<\"OCStack stop error\";\n        }\n    }\n    return NULL;\n}\n\n<commit_msg>[IOT-2057] Tizen enrollee sample app fix.<commit_after>\/\/******************************************************************\n\/\/\n\/\/ Copyright 2016 Samsung Electronics All Rights Reserved.\n\/\/\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 implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n\n\n#include \"easysetup.h\"\n#include \"easysetup_wifi_conn.h\"\n\n#include <unistd.h>\n#include <string.h>\n#include <iostream>\n#include <pthread.h>\n#include <glib.h>\n#include <limits>\n#include <unistd.h>\n#define TAG \"TIZEN_ES\"\n\nusing namespace std;\n\ngboolean mainThread(GIOChannel *source, GIOCondition condition, gpointer data);\nvoid *listeningFunc(void *);\n\nGMainLoop *gMainloop;\nstatic pthread_t gThreadHandle = 0;\n\n\n\/**\n * Secure Virtual Resource database for Iotivity Server\n * It contains Server's Identity and the PSK credentials\n * of other devices which the server trusts\n *\/\n#ifdef MULTIPLE_OWNER\nstatic char CRED_FILE[] = \"oic_svr_db_server_MOT.dat\";\n#else\nstatic char CRED_FILE[] = \"oic_svr_db_server.dat\";\n#endif\n\nOCPersistentStorage ps;\n\n\/**\n * @var gIsSecured\n * @brief Variable to check if secure mode is enabled or not.\n *\/\nstatic bool gIsSecured = false;\nstatic bool gWiFiCBflag = false;\nstatic char gSSID[OIC_STRING_MAX_VALUE];\nstatic char gPasswd[OIC_STRING_MAX_VALUE];\n\nvoid PrintMenu()\n{\n    cout << \"========================\" << endl;\n    cout << \"A: Enabled Security\" << endl;\n    cout << \"B: Init & Start EasySetup\" << endl;\n    cout << \"C: Set DeviceInfo\" << endl;\n    cout << \"D: Connect to TargetAP\" << endl;\n    cout << \"E: Show Menu.......\" << endl;\n    cout << \"Q: Terminate\" << endl;\n    cout << \"========================\" << endl;\n}\n\nvoid ConnectRequestCbInApp(ESConnectRequest *connectRequest)\n{\n    cout << \"ConnectRequestCbInApp IN\" << endl;\n\n    if(connectRequest == NULL)\n    {\n        cout << \"connectRequest is NULL\" << endl;\n        return ;\n    }\n\n    for(int i = 0 ; i < connectRequest->numRequest ; ++i)\n    {\n        cout << \"connect : \" << connectRequest->connect[i] << endl;\n    }\n\n    cout << \"ConnectRequestCbInApp OUT\" << endl;\n    PrintMenu();\n}\n\nvoid WiFiConfProvCbInApp(ESWiFiConfData *eventData)\n{\n    cout << \"WiFiConfProvCbInApp IN\" << endl;\n    gWiFiCBflag = true;\n\n    ESSetState(ES_STATE_CONNECTING_TO_ENROLLER);\n\n    if(eventData == NULL)\n    {\n        cout << \"ESWiFiConfData is NULL\" << endl;\n        return ;\n    }\n\n    cout << \"SSID : \" << eventData->ssid << endl;\n    cout << \"Password : \" << eventData->pwd << endl;\n    cout << \"AuthType : \" << eventData->authtype << endl;\n    cout << \"EncType : \" << eventData->enctype << endl;\n\n    memset(gSSID, 0, OIC_STRING_MAX_VALUE);\n    memset(gPasswd, 0, OIC_STRING_MAX_VALUE);\n    if(eventData->ssid != NULL)\n    {\n        strncpy(gSSID, eventData->ssid, strlen(eventData->ssid));\n    }\n\n    if(eventData->pwd != NULL)\n    {\n        strncpy(gPasswd, eventData->pwd, strlen(eventData->pwd));\n    }\n\n    cout << \"WiFiConfProvCbInApp OUT\" << endl;\n    PrintMenu();\n}\n\nvoid DevConfProvCbInApp(ESDevConfData *eventData)\n{\n    cout << \"DevConfProvCbInApp IN\" << endl;\n\n    if(eventData == NULL)\n    {\n        cout << \"ESDevConfData is NULL\" << endl;\n        return ;\n    }\n\n    cout << \"DevConfProvCbInApp OUT\" << endl;\n    PrintMenu();\n}\n\nvoid CoapCloudConfProvCbInApp(ESCoapCloudConfData *eventData)\n{\n    cout << \"CoapCloudConfProvCbInApp IN\" << endl;\n\n    if(eventData == NULL)\n    {\n        cout << \"ESCoapCloudConfData is NULL\" << endl;\n        return ;\n    }\n\n    cout << \"AuthCode : \" << eventData->authCode << endl;\n    cout << \"AcessToken : \" <<  eventData->accessToken << endl;\n    cout << \"AcessTokenType : \"<< eventData->accessTokenType << endl;\n    cout << \"AuthProvider : \" << eventData->authProvider << endl;\n    cout << \"CI Server : \" << eventData->ciServer << endl;\n\n    cout << \"CoapCloudConfProvCbInApp OUT\" << endl;\n    PrintMenu();\n}\n\nESProvisioningCallbacks gCallbacks = {\n    .ConnectRequestCb = &ConnectRequestCbInApp,\n    .WiFiConfProvCb = &WiFiConfProvCbInApp,\n    .DevConfProvCb = &DevConfProvCbInApp,\n    .CoapCloudConfProvCb = &CoapCloudConfProvCbInApp\n};\n\nFILE* server_fopen(const char *path, const char *mode)\n{\n    if (0 == strcmp(path, OC_SECURITY_DB_DAT_FILE_NAME))\n    {\n        return fopen(CRED_FILE, mode);\n    }\n    else\n    {\n        return fopen(path, mode);\n    }\n}\n\nvoid EnableSecurity()\n{\n    cout << \"Inside EnableSecurity API..\" << endl;\n\n    gIsSecured = true;\n\n    \/\/ Initialize Persistent Storage for SVR database\n    ps = (OCPersistentStorage){ server_fopen, fread, fwrite, fclose, unlink };\n    OCRegisterPersistentStorageHandler(&ps);\n}\n\nvoid StartEasySetup()\n{\n    cout << \"StartEasySetup IN\" << endl;\n\n    if (OCInit(NULL, 0, OC_SERVER) != OC_STACK_OK)\n    {\n        cout << \"OCStack init error!!\" << endl;\n        return;\n    }\n\n    ESResourceMask resourcemMask = (ESResourceMask) (ES_WIFICONF_RESOURCE | ES_COAPCLOUDCONF_RESOURCE | ES_DEVCONF_RESOURCE);\n    cout << \"resourcemMask : \" << resourcemMask << endl;\n    if(ESInitEnrollee(gIsSecured, resourcemMask, gCallbacks) != ES_OK)\n    {\n        cout << \"OCStack init error!!\" << endl;\n        return;\n    }\n\n    cout << \"ESInitEnrollee Success\" << endl;\n\n    if(gThreadHandle == 0) {\n\n        if (pthread_create(&gThreadHandle, NULL, listeningFunc, NULL)) {\n            cout << \"Thread creation failed\" << endl;\n            return;\n        }\n\n    }\n\n    ESSetState(ES_STATE_INIT);\n    ESSetErrorCode(ES_ERRCODE_NO_ERROR);\n\n    int ret = 0;\n\n    ret = TizenWiFiInit();\n    if(ret != WIFI_NO_ERROR) {\n        cout << \"WiFi Init Error\" << endl;\n    }\n    else\n        cout << \"WiFi Init Success\" << endl;\n\n    ret = TizenWiFiScanStart();\n    if(ret != WIFI_NO_ERROR) {\n        cout << \"WiFi Scan Error\" << endl;\n    }\n    else\n        cout << \"WiFi Scan Success\" << endl;\n\n    cout << \"StartEasySetup OUT\" << endl;\n}\n\nvoid SetDeviceInfo()\n{\n    cout << \"SetDeviceInfo IN\" << endl;\n\n    ESDeviceProperty deviceProperty = {\n        {{WIFI_11G, WIFI_11N, WIFI_11AC, WiFi_EOF}, WIFI_5G}, {\"Tizen Device\"}\n    };\n\n    \/\/ Set user properties if needed\n\n    \/\/ Set device properties\n    if(ESSetDeviceProperty(&deviceProperty) == ES_ERROR)\n    {\n        cout << \"ESSetDeviceProperty Error\" << endl;\n    }\n\n    cout << \"SetDeviceInfo OUT\" << endl;\n}\n\nvoid StopEasySetup()\n{\n    cout << \"StopEasySetup IN\" << endl;\n    if (ESTerminateEnrollee() == ES_ERROR)\n    {\n        cout << \"ESTerminateEnrollee Failed!!\" << endl;\n        return;\n    }\n\n    \/\/ Deinit Tizen Wifi\n    TizenWiFiDeinit();\n\n    \/\/ Stop OC Stack\n    if (OCStop() != OC_STACK_OK)\n    {\n        cout << \"OCStack stop failed!!\" << endl;\n        return;\n    }\n\n    if(gThreadHandle != 0) {\n        pthread_cancel(gThreadHandle);\n        pthread_join(gThreadHandle, NULL);\n    }\n\n    cout << \"StopEasySetup OUT\" << endl;\n}\n\nvoid ConnectToTargetAP()\n{\n    if(!gWiFiCBflag){\n        cout << \"WiFi Provisioning is needed to be preceded\" << endl;\n        return;\n    }\n\n    WiFiConnErrCode ret = WIFI_NO_ERROR;\n    ret = TizenWiFiScanStart();\n    if(ret != WIFI_NO_ERROR){\n        ESSetState(ES_STATE_FAILED_TO_CONNECT_TO_ENROLLER);\n        ESSetErrorCode(ES_ERRCODE_UNKNOWN);\n        cout << \"WiFi Scan Error\" << endl;\n        return;\n    }\n    else{\n        cout << \"WiFi Scan Succss\" << endl;\n    }\n\n    ret = TizenWiFiConn(gSSID, gPasswd);\n    if(ret != WIFI_NO_ERROR) {\n        ESSetState(ES_STATE_FAILED_TO_CONNECT_TO_ENROLLER);\n\n        if(ret == WIFI_NOTFOUND_SSID_ERROR) {\n            ESSetErrorCode(ES_ERRCODE_SSID_NOT_FOUND);\n        }\n        else if(ret == WIFI_WRONG_PWD_ERROR) {\n            ESSetErrorCode(ES_ERRCODE_PW_WRONG);\n        }\n        else {\n            ESSetErrorCode(ES_ERRCODE_TIMEOUT);\n        }\n        cout << \"WiFi Connection Error\" << endl;\n        return;\n    }\n    else {\n        cout << \"WIFI Connection Success\" << endl;\n        ESSetState(ES_STATE_CONNECTED_TO_ENROLLER);\n        ESSetErrorCode(ES_ERRCODE_NO_ERROR);\n    }\n}\n\ngboolean mainThread(GIOChannel *source, GIOCondition condition, gpointer data)\n{\n    char entered;\n    cin >> entered;\n    cin.ignore(numeric_limits<streamsize>::max(), '\\n');\n\n    switch (entered) {\n        case 'Q': \/\/ quit\n        case 'q':\n            StopEasySetup();\n            break;\n\n        case 'A': \/\/ Enable Security\n        case 'a':\n#ifdef __WITH_DTLS__\n            EnableSecurity();\n#else\n            cout << \"Sample is not built with secured mode\" << endl;\n#endif\n            PrintMenu();\n            break;\n\n        case 'B': \/\/ Init EasySetup\n        case 'b':\n            StartEasySetup();\n            PrintMenu();\n            break;\n\n        case 'C': \/\/ Set Device Info\n        case 'c':\n            SetDeviceInfo();\n            PrintMenu();\n            break;\n\n        case 'D': \/\/ Start to connect target AP\n        case 'd':\n            ConnectToTargetAP();\n            PrintMenu();\n            break;\n\n        case 'E': \/\/ Print Menu\n        case 'e':\n            PrintMenu();\n            break;\n\n        default:\n            cout << \"Wrong option\" << endl;\n            PrintMenu();\n            break;\n    }\n\n    if(entered == 'q' || entered == 'Q'){\n        g_main_loop_quit(gMainloop);\n    }\n\n    return TRUE;\n}\n\nint main()\n{\n    cout << \"#########################\" << endl;\n    cout << \"EasySetup Enrollee SAMPLE\" << endl;\n    cout << \"#########################\" << endl;\n    PrintMenu();\n\n    gMainloop = g_main_loop_new (NULL, FALSE);\n    if(gMainloop == NULL) {\n        cout << \"Create Main Loop Error\" << endl;\n        return 0;\n    }\n\n    GIOChannel *channel = g_io_channel_unix_new(0);\n    g_io_add_watch(channel, (GIOCondition)(G_IO_IN|G_IO_ERR|G_IO_HUP|G_IO_NVAL), mainThread, NULL);\n\n    g_main_loop_run (gMainloop);\n\n    cout << \"#########################\" << endl;\n    cout << \"Terminate Enrollee SAMPLE\" << endl;\n    cout << \"#########################\" << endl;\n\n    return 0;\n}\n\nvoid *listeningFunc(void*)\n{\n    OCStackResult result;\n\n    while (true)\n    {\n        result = OCProcess();\n        if (result != OC_STACK_OK)\n        {\n           cout<<\"OCStack stop error\";\n        }\n    }\n    return NULL;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef EXPR_HPP\n#define EXPR_HPP\n\n#include <iostream>\n#include <memory>\n#include <string>\n#include <array>\n#include <vector>\n#include <type_traits>\n#include <cmath>\n\n\/**\n * Virtual super-class for expression tree\n *\n * All important types and functions for outside users are \n * defined here.\n *\/\nclass expr {\npublic:\n\n\t\/* It might be beter to use policy class instead *\/\n\tusing ptr_type = std::unique_ptr<expr>;\n\tusing string_type = std::string;\n\tusing eval_type = double;\n\tusing valuation_type = std::vector<eval_type>;\n\n\tvirtual ptr_type derive(const valuation_type::size_type& var) = 0;\n\tvirtual ptr_type clone() = 0;\n\tvirtual string_type to_string() = 0;\n\tvirtual eval_type eval(const valuation_type& values) = 0;\n};\n\n\/**\n * Type of expression tree. \n *\n * Tree is basically pointer. This helps to keep track of tree\n * ownership. When you have tree_type - you own pointer otherwise\n * when you have tree_type::element_type you do NOT own this tree.\n * So you shouldn't (musn't) explicitly delete it.\n *\n * The class satisfies the requirements of MoveConstructible and \n * MoveAssignable, but not the requirements of either \n * CopyConstructible or CopyAssignable.\n *\/\nusing tree_type = std::unique_ptr<expr>;\n\n\/**\n * Child (subtree) container.\n *\n * TODO : What is more appropriete polymorphic hierarchy?\n * +------+    +-------+    +----------+\n * | expr | <- | n_ary | <- | function |\n * +------+    +-------+    +----------+\n *\n *               OR\n *\n * +------+    +----------+\n * | expr | <- | function |\n * +------+    +----------+\n *              \/\n * +-------+   \/\n * | n_ary | <-\n * +-------+\n *\/\ntemplate <std::size_t Arity>\nclass n_ary : public expr {\nprotected:\n\tstd::array<expr::ptr_type, Arity> childs;\n\n    template <class T, class U> friend class function;\n};\n\n\/**\n * Every function type must be derived from this class\n *\/\nstruct function_base { };\n\nstruct variable : public function_base { \n\tconstexpr static std::size_t arity = 0;\n    typedef expr::valuation_type::size_type value_type;\n\tvalue_type var_num;\n};\n\nstruct constant : public function_base { \n\tconstexpr static std::size_t arity = 0; \n    typedef expr::eval_type value_type;\n\tvalue_type c;\n};\n\nstruct sin : public function_base { constexpr static std::size_t arity = 1; };\nstruct cos : public function_base { constexpr static std::size_t arity = 1; };\nstruct tan : public function_base { constexpr static std::size_t arity = 1; };\nstruct log : public function_base { constexpr static std::size_t arity = 1; };\n\nstruct add : public function_base { constexpr static std::size_t arity = 2; };\nstruct sub : public function_base { constexpr static std::size_t arity = 2; };\nstruct mul : public function_base { constexpr static std::size_t arity = 2; };\nstruct div : public function_base { constexpr static std::size_t arity = 2; };\nstruct pow : public function_base { constexpr static std::size_t arity = 2; };\n\n\/**\n * Compile time type property deduction\n * Specialisation for specific templates should be sufficient but this is\n * more elegant and general\n *\/\ntemplate <typename T>\nclass has_value {\n    typedef char yes[1];\n    typedef char no[2];\n\n    template <typename U>\n    static yes& test(typename U::value_type*);\n    template <typename U>\n    static no& test(...);\n\npublic:\n    enum { value = (sizeof(yes) == sizeof(test<T>(0))) };\n};\n\n\/**\n * Function class with all functionality\n * \n * Template parameter must be derived from function_base class - this makes\n * more human-readable compiler errors when invalid template parameter is\n * supplied.\n *\n * TODO : Conditionally derive from n_ary only when T::arity != 0\n *\/\ntemplate <class T, class Enable = void>\nclass function;\n\ntemplate <class T>\nclass function<\n    T, \n    typename std::enable_if<\n        std::is_base_of<\n            function_base, \n            T\n        >::value \n    >::type \n>\n  : public T, public n_ary<T::arity> {\npublic:\n\t\/**\n\t * Constructor for functions with internal value\n\t * Defined only for functions with value_type type\n\t *\n\t * TODO : Is possible to simply pass more then one parameter\n\t *        without additional encapsulation (pair, tuple, vector, ...)?\n\t * TODO : define template <class T> function<T>::operator std::string();\n\t *\/\n\ttemplate <\n            typename U = T, \n            typename std::enable_if<\n                    has_value<U>::value\n                >::type ...\n        >\n\tfunction(const typename U::value_type& value);\n\n    function() {};\t\n    explicit function(const function<T>&) { };\n\n\tvirtual expr::ptr_type derive(const expr::valuation_type::size_type& var);\n\t\n\tvirtual expr::ptr_type clone() {\n\t\treturn expr::ptr_type(new function<T>(*this));\n\t};\n\n\tvirtual expr::string_type to_string();\n\tvirtual expr::eval_type eval(const expr::valuation_type& values);\n\n};\n\ntemplate <\n        class T, \n        class = typename std::enable_if<\n                std::is_base_of<\n                        function_base, \n                        T\n                    >::value \n            >::type \n    >\nexpr::ptr_type construct(typename T::value_type v) {\n\treturn expr::ptr_type(nullptr);\n}\n\n\/**\n * Required prototypes\n *\/\n\/\/template <> template <> \n\/\/inline function<constant>::function(const constant::value_type& val);\n\n\/\/template <> template <>\n\/\/inline function<variable>::function(const variable::value_type& val);\n\n\/*******************************************************\n ***** function<variable> template specialisations *****\n *******************************************************\/\n\ntemplate <> template <> \ninline function<variable>::function(const variable::value_type& vnum)\n{ variable::var_num = vnum; }\n\ntemplate <> \ninline expr::ptr_type function<variable>::derive(\n    const expr::valuation_type::size_type& n)\n{ return ptr_type(new function<constant>(n == var_num ? 1 : 0)); }\n\ntemplate <> inline expr::string_type function<variable>::to_string()\n{ return \"x_\" + std::to_string(variable::var_num); }\n\ntemplate <> \ninline expr::eval_type function<variable>::eval(\n    const expr::valuation_type& values)\n{ return values[variable::var_num]; }\n\n\/*******************************************************\n ***** function<constant> template specialisations *****\n *******************************************************\/\n\ntemplate <> template <> \ninline function<constant>::function(const constant::value_type& val)\n{ constant::c = val; }\n\ntemplate <> \ninline expr::ptr_type function<constant>::derive(\n    const expr::valuation_type::size_type&) \n{ return ptr_type(new function<constant>(0)); }\n\ntemplate <> inline expr::string_type function<constant>::to_string() \n{ return std::to_string(constant::c); }\n\ntemplate <> \ninline expr::eval_type function<constant>::eval(const expr::valuation_type&) \n{ return constant::c; }\n\n\/*******************************************************\n *****   function<sin> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<struct sin>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *p = new function<struct cos>;\n    p->childs[0] = std::move(n_ary::childs[0]->clone());\n    return ptr_type(p);\n}\n\ntemplate <> inline expr::string_type function<struct sin>::to_string()\n{ return \"sin(\" + n_ary::childs[0]->to_string() + \")\"; }\n\ntemplate <>\ninline expr::eval_type function<struct sin>::eval(\n        const expr::valuation_type& val)\n{ return std::sin(n_ary::childs[0]->eval(val)); }\n\n\/*******************************************************\n *****   function<cos> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<struct cos>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *s = new function<struct sin>;\n    s->childs[0] = std::move(n_ary::childs[0]->clone());\n    auto *p = new function<mul>;\n    p->childs[0] = std::move(ptr_type(s));\n    p->childs[1] = std::move(n_ary::childs[0]->derive(var));\n    auto *m = new function<mul>;\n    m->childs[0] = std::move(ptr_type(new function<constant>(-1)));\n    m->childs[1] = std::move(ptr_type(p));\n    return ptr_type(m);\n}\n\ntemplate <> inline expr::string_type function<struct cos>::to_string()\n{ return \"cos(\" + n_ary::childs[0]->to_string() + \")\"; }\n\ntemplate <>\ninline expr::eval_type function<struct cos>::eval(\n        const expr::valuation_type& val)\n{ return std::cos(n_ary::childs[0]->eval(val)); }\n\n\/*******************************************************\n *****   function<tan> template specialisations    *****\n *******************************************************\/\n\n\/*******************************************************\n *****   function<log> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<struct log>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *p = new function<struct div>;\n    p->childs[0] = std::move(n_ary::childs[0]->derive(var));\n    p->childs[1] = std::move(n_ary::childs[0]->clone());\n    return ptr_type(p);\n}\n\ntemplate <> inline expr::string_type function<struct log>::to_string()\n{ return \"log(\" + n_ary::childs[0]->to_string() + \")\"; };\n\ntemplate <>\ninline expr::eval_type function<struct log>::eval(const expr::valuation_type& val)\n{ return std::log(n_ary::childs[0]->eval(val)); }\n\n\/*******************************************************\n *****   function<add> template specialisations    *****\n *******************************************************\/\n\ntemplate <> \ninline expr::ptr_type function<add>::derive(\n        const expr::valuation_type::size_type& var) { \n\tauto *p = new function<add>;\n\tp->childs[0] = std::move(n_ary::childs[0]->derive(var));\n\tp->childs[1] = std::move(n_ary::childs[1]->derive(var));\n\treturn ptr_type(p);\n}\n\ntemplate <> inline expr::string_type function<add>::to_string()\n{ return n_ary::childs[0]->to_string() + \"+\" + n_ary::childs[1]->to_string(); }\n\ntemplate <> \ninline expr::eval_type function<add>::eval(const expr::valuation_type& val) \n{ return n_ary::childs[0]->eval(val) + n_ary::childs[1]->eval(val); }\n\n\/*******************************************************\n *****   function<sub> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<sub>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *p = new function<sub>;\n    p->childs[0] = std::move(n_ary::childs[0]->derive(var));\n    p->childs[1] = std::move(n_ary::childs[1]->derive(var));\n    return ptr_type(p);\n}\n\ntemplate <> inline expr::string_type function<sub>::to_string()\n{ return n_ary::childs[0]->to_string() + \"-\" + n_ary::childs[1]->to_string(); }\n\ntemplate <>\ninline expr::eval_type function<sub>::eval(const expr::valuation_type& val)\n{ return n_ary::childs[0]->eval(val) - n_ary::childs[1]->eval(val); }\n\n\/*******************************************************\n *****   function<mul> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<mul>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *add_lhs = new function<mul>;\n    add_lhs->childs[0] = std::move(n_ary::childs[0]->derive(var));\n    add_lhs->childs[1] = std::move(n_ary::childs[1]->clone());\n    auto *add_rhs = new function<mul>;\n    add_rhs->childs[0] = std::move(n_ary::childs[0]->clone());\n    add_rhs->childs[1] = std::move(n_ary::childs[1]->derive(var));\n    auto *res = new function<add>;\n    res->childs[0] = std::move(ptr_type(add_lhs));\n    res->childs[1] = std::move(ptr_type(add_rhs));\n    return ptr_type(res);\n}\n\ntemplate <> inline expr::string_type function<mul>::to_string()\n{ return n_ary::childs[0]->to_string() + \"*\" + n_ary::childs[1]->to_string(); }\n\ntemplate <>\ninline expr::eval_type function<mul>::eval(const expr::valuation_type& val)\n{ return n_ary::childs[0]->eval(val) * n_ary::childs[1]->eval(val); }\n\n\/*******************************************************\n *****   function<div> template specialisations    *****\n *******************************************************\/\n\n\/*******************************************************\n *****   function<pow> template specialisations    *****\n *******************************************************\/\n\n#endif\n<commit_msg>function<sin>::derive(...) repaired<commit_after>#ifndef EXPR_HPP\n#define EXPR_HPP\n\n#include <iostream>\n#include <memory>\n#include <string>\n#include <array>\n#include <vector>\n#include <type_traits>\n#include <cmath>\n\n\/**\n * Virtual super-class for expression tree\n *\n * All important types and functions for outside users are \n * defined here.\n *\/\nclass expr {\npublic:\n\n\t\/* It might be beter to use policy class instead *\/\n\tusing ptr_type = std::unique_ptr<expr>;\n\tusing string_type = std::string;\n\tusing eval_type = double;\n\tusing valuation_type = std::vector<eval_type>;\n\n\tvirtual ptr_type derive(const valuation_type::size_type& var) = 0;\n\tvirtual ptr_type clone() = 0;\n\tvirtual string_type to_string() = 0;\n\tvirtual eval_type eval(const valuation_type& values) = 0;\n};\n\n\/**\n * Type of expression tree. \n *\n * Tree is basically pointer. This helps to keep track of tree\n * ownership. When you have tree_type - you own pointer otherwise\n * when you have tree_type::element_type you do NOT own this tree.\n * So you shouldn't (musn't) explicitly delete it.\n *\n * The class satisfies the requirements of MoveConstructible and \n * MoveAssignable, but not the requirements of either \n * CopyConstructible or CopyAssignable.\n *\/\nusing tree_type = std::unique_ptr<expr>;\n\n\/**\n * Child (subtree) container.\n *\n * TODO : What is more appropriete polymorphic hierarchy?\n * +------+    +-------+    +----------+\n * | expr | <- | n_ary | <- | function |\n * +------+    +-------+    +----------+\n *\n *               OR\n *\n * +------+    +----------+\n * | expr | <- | function |\n * +------+    +----------+\n *              \/\n * +-------+   \/\n * | n_ary | <-\n * +-------+\n *\/\ntemplate <std::size_t Arity>\nclass n_ary : public expr {\nprotected:\n\tstd::array<expr::ptr_type, Arity> childs;\n\n    template <class T, class U> friend class function;\n};\n\n\/**\n * Every function type must be derived from this class\n *\/\nstruct function_base { };\n\nstruct variable : public function_base { \n\tconstexpr static std::size_t arity = 0;\n    typedef expr::valuation_type::size_type value_type;\n\tvalue_type var_num;\n};\n\nstruct constant : public function_base { \n\tconstexpr static std::size_t arity = 0; \n    typedef expr::eval_type value_type;\n\tvalue_type c;\n};\n\nstruct sin : public function_base { constexpr static std::size_t arity = 1; };\nstruct cos : public function_base { constexpr static std::size_t arity = 1; };\nstruct tan : public function_base { constexpr static std::size_t arity = 1; };\nstruct log : public function_base { constexpr static std::size_t arity = 1; };\n\nstruct add : public function_base { constexpr static std::size_t arity = 2; };\nstruct sub : public function_base { constexpr static std::size_t arity = 2; };\nstruct mul : public function_base { constexpr static std::size_t arity = 2; };\nstruct div : public function_base { constexpr static std::size_t arity = 2; };\nstruct pow : public function_base { constexpr static std::size_t arity = 2; };\n\n\/**\n * Compile time type property deduction\n * Specialisation for specific templates should be sufficient but this is\n * more elegant and general\n *\/\ntemplate <typename T>\nclass has_value {\n    typedef char yes[1];\n    typedef char no[2];\n\n    template <typename U>\n    static yes& test(typename U::value_type*);\n    template <typename U>\n    static no& test(...);\n\npublic:\n    enum { value = (sizeof(yes) == sizeof(test<T>(0))) };\n};\n\n\/**\n * Function class with all functionality\n * \n * Template parameter must be derived from function_base class - this makes\n * more human-readable compiler errors when invalid template parameter is\n * supplied.\n *\n * TODO : Conditionally derive from n_ary only when T::arity != 0\n *\/\ntemplate <class T, class Enable = void>\nclass function;\n\ntemplate <class T>\nclass function<\n    T, \n    typename std::enable_if<\n        std::is_base_of<\n            function_base, \n            T\n        >::value \n    >::type \n>\n  : public T, public n_ary<T::arity> {\npublic:\n\t\/**\n\t * Constructor for functions with internal value\n\t * Defined only for functions with value_type type\n\t *\n\t * TODO : Is possible to simply pass more then one parameter\n\t *        without additional encapsulation (pair, tuple, vector, ...)?\n\t * TODO : define template <class T> function<T>::operator std::string();\n\t *\/\n\ttemplate <\n            typename U = T, \n            typename std::enable_if<\n                    has_value<U>::value\n                >::type ...\n        >\n\tfunction(const typename U::value_type& value);\n\n    function() {};\t\n    explicit function(const function<T>&) { };\n\n\tvirtual expr::ptr_type derive(const expr::valuation_type::size_type& var);\n\t\n\tvirtual expr::ptr_type clone() {\n\t\treturn expr::ptr_type(new function<T>(*this));\n\t};\n\n\tvirtual expr::string_type to_string();\n\tvirtual expr::eval_type eval(const expr::valuation_type& values);\n\n};\n\ntemplate <\n        class T, \n        class = typename std::enable_if<\n                std::is_base_of<\n                        function_base, \n                        T\n                    >::value \n            >::type \n    >\nexpr::ptr_type construct(typename T::value_type v) {\n\treturn expr::ptr_type(nullptr);\n}\n\n\/**\n * Required prototypes\n *\/\n\/\/template <> template <> \n\/\/inline function<constant>::function(const constant::value_type& val);\n\n\/\/template <> template <>\n\/\/inline function<variable>::function(const variable::value_type& val);\n\n\/*******************************************************\n ***** function<variable> template specialisations *****\n *******************************************************\/\n\ntemplate <> template <> \ninline function<variable>::function(const variable::value_type& vnum)\n{ variable::var_num = vnum; }\n\ntemplate <> \ninline expr::ptr_type function<variable>::derive(\n    const expr::valuation_type::size_type& n)\n{ return ptr_type(new function<constant>(n == var_num ? 1 : 0)); }\n\ntemplate <> inline expr::string_type function<variable>::to_string()\n{ return \"x_\" + std::to_string(variable::var_num); }\n\ntemplate <> \ninline expr::eval_type function<variable>::eval(\n    const expr::valuation_type& values)\n{ return values[variable::var_num]; }\n\n\/*******************************************************\n ***** function<constant> template specialisations *****\n *******************************************************\/\n\ntemplate <> template <> \ninline function<constant>::function(const constant::value_type& val)\n{ constant::c = val; }\n\ntemplate <> \ninline expr::ptr_type function<constant>::derive(\n    const expr::valuation_type::size_type&) \n{ return ptr_type(new function<constant>(0)); }\n\ntemplate <> inline expr::string_type function<constant>::to_string() \n{ return std::to_string(constant::c); }\n\ntemplate <> \ninline expr::eval_type function<constant>::eval(const expr::valuation_type&) \n{ return constant::c; }\n\n\/*******************************************************\n *****   function<sin> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<struct sin>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *p = new function<struct cos>;\n    p->childs[0] = std::move(n_ary::childs[0]->clone());\n    auto *m = new function<mul>;\n    m->childs[0] = std::move(ptr_type(p));\n    m->childs[1] = std::move(n_ary::childs[0]->derive(var));\n    return ptr_type(m);\n}\n\ntemplate <> inline expr::string_type function<struct sin>::to_string()\n{ return \"sin(\" + n_ary::childs[0]->to_string() + \")\"; }\n\ntemplate <>\ninline expr::eval_type function<struct sin>::eval(\n        const expr::valuation_type& val)\n{ return std::sin(n_ary::childs[0]->eval(val)); }\n\n\/*******************************************************\n *****   function<cos> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<struct cos>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *s = new function<struct sin>;\n    s->childs[0] = std::move(n_ary::childs[0]->clone());\n    auto *p = new function<mul>;\n    p->childs[0] = std::move(ptr_type(s));\n    p->childs[1] = std::move(n_ary::childs[0]->derive(var));\n    auto *m = new function<mul>;\n    m->childs[0] = std::move(ptr_type(new function<constant>(-1)));\n    m->childs[1] = std::move(ptr_type(p));\n    return ptr_type(m);\n}\n\ntemplate <> inline expr::string_type function<struct cos>::to_string()\n{ return \"cos(\" + n_ary::childs[0]->to_string() + \")\"; }\n\ntemplate <>\ninline expr::eval_type function<struct cos>::eval(\n        const expr::valuation_type& val)\n{ return std::cos(n_ary::childs[0]->eval(val)); }\n\n\/*******************************************************\n *****   function<tan> template specialisations    *****\n *******************************************************\/\n\n\/*******************************************************\n *****   function<log> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<struct log>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *p = new function<struct div>;\n    p->childs[0] = std::move(n_ary::childs[0]->derive(var));\n    p->childs[1] = std::move(n_ary::childs[0]->clone());\n    return ptr_type(p);\n}\n\ntemplate <> inline expr::string_type function<struct log>::to_string()\n{ return \"log(\" + n_ary::childs[0]->to_string() + \")\"; };\n\ntemplate <>\ninline expr::eval_type function<struct log>::eval(const expr::valuation_type& val)\n{ return std::log(n_ary::childs[0]->eval(val)); }\n\n\/*******************************************************\n *****   function<add> template specialisations    *****\n *******************************************************\/\n\ntemplate <> \ninline expr::ptr_type function<add>::derive(\n        const expr::valuation_type::size_type& var) { \n\tauto *p = new function<add>;\n\tp->childs[0] = std::move(n_ary::childs[0]->derive(var));\n\tp->childs[1] = std::move(n_ary::childs[1]->derive(var));\n\treturn ptr_type(p);\n}\n\ntemplate <> inline expr::string_type function<add>::to_string()\n{ return n_ary::childs[0]->to_string() + \"+\" + n_ary::childs[1]->to_string(); }\n\ntemplate <> \ninline expr::eval_type function<add>::eval(const expr::valuation_type& val) \n{ return n_ary::childs[0]->eval(val) + n_ary::childs[1]->eval(val); }\n\n\/*******************************************************\n *****   function<sub> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<sub>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *p = new function<sub>;\n    p->childs[0] = std::move(n_ary::childs[0]->derive(var));\n    p->childs[1] = std::move(n_ary::childs[1]->derive(var));\n    return ptr_type(p);\n}\n\ntemplate <> inline expr::string_type function<sub>::to_string()\n{ return n_ary::childs[0]->to_string() + \"-\" + n_ary::childs[1]->to_string(); }\n\ntemplate <>\ninline expr::eval_type function<sub>::eval(const expr::valuation_type& val)\n{ return n_ary::childs[0]->eval(val) - n_ary::childs[1]->eval(val); }\n\n\/*******************************************************\n *****   function<mul> template specialisations    *****\n *******************************************************\/\n\ntemplate <>\ninline expr::ptr_type function<mul>::derive(\n        const expr::valuation_type::size_type& var) {\n    auto *add_lhs = new function<mul>;\n    add_lhs->childs[0] = std::move(n_ary::childs[0]->derive(var));\n    add_lhs->childs[1] = std::move(n_ary::childs[1]->clone());\n    auto *add_rhs = new function<mul>;\n    add_rhs->childs[0] = std::move(n_ary::childs[0]->clone());\n    add_rhs->childs[1] = std::move(n_ary::childs[1]->derive(var));\n    auto *res = new function<add>;\n    res->childs[0] = std::move(ptr_type(add_lhs));\n    res->childs[1] = std::move(ptr_type(add_rhs));\n    return ptr_type(res);\n}\n\ntemplate <> inline expr::string_type function<mul>::to_string()\n{ return n_ary::childs[0]->to_string() + \"*\" + n_ary::childs[1]->to_string(); }\n\ntemplate <>\ninline expr::eval_type function<mul>::eval(const expr::valuation_type& val)\n{ return n_ary::childs[0]->eval(val) * n_ary::childs[1]->eval(val); }\n\n\/*******************************************************\n *****   function<div> template specialisations    *****\n *******************************************************\/\n\n\/*******************************************************\n *****   function<pow> template specialisations    *****\n *******************************************************\/\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- SerializationTest.cpp - Experimental Object Serialization --------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by Ted Kremenek and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/  This file implements prototype code for serialization of objects in clang.\n\/\/  It is not intended yet for public use, but simply is a placeholder to\n\/\/  experiment with new serialization features.  Serialization will eventually\n\/\/  be integrated as a proper component of the clang libraries.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ASTConsumers.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"llvm\/System\/Path.h\"\n#include \"llvm\/Support\/Streams.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Bitcode\/Serialize.h\"\n#include \"llvm\/Bitcode\/Deserialize.h\"\n#include <stdio.h>\n#include <list>\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Driver code.\n\/\/===----------------------------------------------------------------------===\/\/\n\nusing namespace clang;\nusing llvm::sys::TimeValue;\n\nnamespace {\n\ntemplate<typename T> struct Janitor {\n  T* Obj;\n  Janitor(T* obj) : Obj(obj) {}\n  ~Janitor() { delete Obj; }\n};\n\nclass SerializationTest : public ASTConsumer {\n  ASTContext* Context;\n  std::list<Decl*> Decls;\n  \n  enum { BasicMetadataBlock,\n         ASTContextBlock,\n         DeclsBlock };\n\npublic:  \n  SerializationTest() : Context(NULL) {};\n  ~SerializationTest();\n\n  virtual void Initialize(ASTContext& context, unsigned) {\n      Context = &context;\n  }\n  \n  virtual void HandleTopLevelDecl(Decl *D) {\n    Decls.push_back(D);\n  }\n\nprivate:\n  void Serialize(llvm::sys::Path& Filename);\n  void Deserialize(llvm::sys::Path& Filename);\n};\n  \n} \/\/ end anonymous namespace\n\nASTConsumer* clang::CreateSerializationTest() {  \n  return new SerializationTest();\n}\n\nstatic void WritePreamble(llvm::BitstreamWriter& Stream) {\n  Stream.Emit((unsigned)'B', 8);\n  Stream.Emit((unsigned)'C', 8);\n  Stream.Emit(0xC, 4);\n  Stream.Emit(0xF, 4);\n  Stream.Emit(0xE, 4);\n  Stream.Emit(0x0, 4);\n}\n\nstatic bool ReadPreamble(llvm::BitstreamReader& Stream) {\n  return Stream.Read(8) != 'B' ||\n         Stream.Read(8) != 'C' ||\n         Stream.Read(4) != 0xC ||\n         Stream.Read(4) != 0xF ||\n         Stream.Read(4) != 0xE ||\n         Stream.Read(4) != 0x0;\n}\n\nvoid SerializationTest::Serialize(llvm::sys::Path& Filename) {\n  \n  \/\/ Reserve 256K for bitstream buffer.\n  std::vector<unsigned char> Buffer;\n  Buffer.reserve(256*1024);\n  \n  \/\/ Create bitstream and write preamble.    \n  llvm::BitstreamWriter Stream(Buffer);\n  WritePreamble(Stream);\n  \n  \/\/ Create serializer.\n  llvm::Serializer Sezr(Stream);\n  \n  \/\/ ===---------------------------------------------------===\/\n  \/\/      Serialize the top-level decls.\n  \/\/ ===---------------------------------------------------===\/  \n  \n  Sezr.EnterBlock(DeclsBlock);\n  \n  \/\/ Create a printer to \"consume\" our deserialized ASTS.\n  ASTConsumer* Printer = CreateASTPrinter();\n  Janitor<ASTConsumer> PrinterJanitor(Printer);\n  \n  for (std::list<Decl*>::iterator I=Decls.begin(), E=Decls.end(); I!=E; ++I) {\n    llvm::cerr << \"Serializing: Decl.\\n\";   \n    \n    Printer->HandleTopLevelDecl(*I);\n    \n    Sezr.EmitOwnedPtr(*I);\n  }\n  \n  Sezr.ExitBlock();\n  \n  \/\/ ===---------------------------------------------------===\/\n  \/\/      Serialize the \"Translation Unit\" metadata.\n  \/\/ ===---------------------------------------------------===\/\n\n  \/\/ Emit ASTContext.\n  Sezr.EnterBlock(ASTContextBlock);  \n  llvm::cerr << \"Serializing: ASTContext.\\n\";  \n  Sezr.EmitOwnedPtr(Context);  \n  Sezr.ExitBlock();  \n  \n  \n  Sezr.EnterBlock(BasicMetadataBlock);\n\n  \/\/ \"Fake\" emit the SourceManager.\n  llvm::cerr << \"Faux-serializing: SourceManager.\\n\";\n  Sezr.EmitPtr(&Context->SourceMgr);\n  \n  \/\/ \"Fake\" emit the Target.\n  llvm::cerr << \"Faux-serializing: Target.\\n\";\n  Sezr.EmitPtr(&Context->Target);\n\n  \/\/ \"Fake\" emit Selectors.\n  llvm::cerr << \"Faux-serializing: Selectors.\\n\";\n  Sezr.EmitPtr(&Context->Selectors);\n  \n  \/\/ Emit the Identifier Table.\n  llvm::cerr << \"Serializing: IdentifierTable.\\n\";  \n  Sezr.EmitOwnedPtr(&Context->Idents);\n\n  Sezr.ExitBlock();  \n  \n  \/\/ ===---------------------------------------------------===\/\n  \/\/      Finalize serialization: write the bits to disk.\n  \/\/ ===---------------------------------------------------===\/ \n  \n  if (FILE *fp = fopen(Filename.c_str(),\"wb\")) {\n    fwrite((char*)&Buffer.front(), sizeof(char), Buffer.size(), fp);\n    fclose(fp);\n  }\n  else { \n    llvm::cerr << \"Error: Cannot open \" << Filename.c_str() << \"\\n\";\n    return;\n  }\n  \n  llvm::cerr << \"Commited bitstream to disk: \" << Filename.c_str() << \"\\n\";\n}\n\n\nvoid SerializationTest::Deserialize(llvm::sys::Path& Filename) {\n  \n  \/\/ Create the memory buffer that contains the contents of the file.\n  \n  using llvm::MemoryBuffer;\n  \n  MemoryBuffer* MBuffer = MemoryBuffer::getFile(Filename.c_str(),\n                                                strlen(Filename.c_str()));\n  \n  if(!MBuffer) {\n    llvm::cerr << \"ERROR: Cannot read file for deserialization.\\n\";\n    return;\n  }\n  \n  \/\/ Create an \"autocollector\" object to release the memory buffer upon\n  \/\/ termination of the current scope.\n  Janitor<MemoryBuffer> AutoReleaseBuffer(MBuffer);\n  \n  \/\/ Check if the file is of the proper length.\n  if (MBuffer->getBufferSize() & 0x3) {\n    llvm::cerr << \"ERROR: AST file length should be a multiple of 4 bytes.\\n\";\n    return;\n  }\n  \n  \/\/ Create the bitstream reader.\n  unsigned char *BufPtr = (unsigned char *) MBuffer->getBufferStart();\n  llvm::BitstreamReader Stream(BufPtr,BufPtr+MBuffer->getBufferSize());\n  \n  \/\/ Sniff for the signature in the bitcode file.\n  if (ReadPreamble(Stream)) {\n    llvm::cerr << \"ERROR: Invalid AST-bitcode signature.\\n\";\n    return;\n  }\n    \n  \/\/ Create the deserializer.\n  llvm::Deserializer Dezr(Stream);\n  \n  \/\/ ===---------------------------------------------------===\/\n  \/\/      Deserialize the \"Translation Unit\" metadata.\n  \/\/ ===---------------------------------------------------===\/\n  \n  \/\/ Skip to the BasicMetaDataBlock.  First jump to ASTContextBlock\n  \/\/ (which will appear earlier) and record its location.\n  \n  bool FoundBlock = Dezr.SkipToBlock(ASTContextBlock);\n  assert (FoundBlock);\n\n  llvm::Deserializer::Location ASTContextBlockLoc =\n    Dezr.getCurrentBlockLocation();\n  \n  FoundBlock = Dezr.SkipToBlock(BasicMetadataBlock);\n  assert (FoundBlock);\n  \n  \/\/ \"Fake\" read the SourceManager.\n  llvm::cerr << \"Faux-Deserializing: SourceManager.\\n\";\n  Dezr.RegisterPtr(&Context->SourceMgr);\n\n  \/\/ \"Fake\" read the TargetInfo.\n  llvm::cerr << \"Faux-Deserializing: Target.\\n\";\n  Dezr.RegisterPtr(&Context->Target);\n\n  \/\/ \"Fake\" read the Selectors.\n  llvm::cerr << \"Faux-Deserializing: Selectors.\\n\";\n  Dezr.RegisterPtr(&Context->Selectors);  \n  \n  \/\/ Read the identifier table.\n  llvm::cerr << \"Deserializing: IdentifierTable\\n\";\n  Dezr.ReadOwnedPtr<IdentifierTable>();\n  \n  \/\/ Now jump back to ASTContextBlock and read the ASTContext.\n  Dezr.JumpTo(ASTContextBlockLoc);\n  \n  \/\/ Read the ASTContext.  \n  llvm::cerr << \"Deserializing: ASTContext.\\n\";\n  Dezr.ReadOwnedPtr<ASTContext>();\n  \n  \/\/ Create a printer to \"consume\" our deserialized ASTS.\n  ASTConsumer* Printer = CreateASTPrinter();\n  Janitor<ASTConsumer> PrinterJanitor(Printer);  \n  \n  \/\/ \"Rewind\" the stream.  Find the block with the serialized top-level decls.\n  Dezr.Rewind();\n  FoundBlock = Dezr.SkipToBlock(DeclsBlock);\n  assert (FoundBlock);\n  llvm::Deserializer::Location DeclBlockLoc = Dezr.getCurrentBlockLocation();\n  \n  \/\/ The remaining objects in the file are top-level decls.\n  while (!Dezr.FinishedBlock(DeclBlockLoc)) {\n    llvm::cerr << \"Deserializing: Decl.\\n\";\n    Decl* decl = Dezr.ReadOwnedPtr<Decl>();\n    Printer->HandleTopLevelDecl(decl);    \n  }\n}\n  \n\nSerializationTest::~SerializationTest() {\n    \n  std::string ErrMsg;\n  llvm::sys::Path Filename = llvm::sys::Path::GetTemporaryDirectory(&ErrMsg);\n  \n  if (Filename.isEmpty()) {\n    llvm::cerr << \"Error: \" << ErrMsg << \"\\n\";\n    return;\n  }\n  \n  Filename.appendComponent(\"test.ast\");\n  \n  if (Filename.makeUnique(true,&ErrMsg)) {\n    llvm::cerr << \"Error: \" << ErrMsg << \"\\n\";\n    return;\n  }\n  \n  Serialize(Filename);\n  Deserialize(Filename);\n}\n<commit_msg>Modified --test-pickling to perform an actual cross-check of serialized ASTs:<commit_after>\/\/===--- SerializationTest.cpp - Experimental Object Serialization --------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by Ted Kremenek and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/  This file implements prototype code for serialization of objects in clang.\n\/\/  It is not intended yet for public use, but simply is a placeholder to\n\/\/  experiment with new serialization features.  Serialization will eventually\n\/\/  be integrated as a proper component of the clang libraries.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ASTConsumers.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"llvm\/System\/Path.h\"\n#include \"llvm\/Support\/Streams.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Bitcode\/Serialize.h\"\n#include \"llvm\/Bitcode\/Deserialize.h\"\n#include <stdio.h>\n#include <list>\n\nusing namespace clang;\nusing llvm::sys::TimeValue;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Utility classes\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\n\ntemplate<typename T> class Janitor {\n  T* Obj;\npublic:\n  explicit Janitor(T* obj) : Obj(obj) {}\n  ~Janitor() { delete Obj; }\n  operator T*() const { return Obj; }\n  T* operator->() { return Obj; }\n};\n\nclass FileSP {\n  FILE* f;\npublic:\n  FileSP(const llvm::sys::Path& fname, const char* mode = \"wb\")\n    : f(fopen(fname.c_str(),mode)) {}\n  \n  ~FileSP() { if (f) fclose(f); }\n  \n  operator FILE*() const { return f; }\nprivate:\n  void operator=(const FileSP& RHS) {}\n  FileSP(const FileSP& RHS) {}\n};\n  \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Driver code.\n\/\/===----------------------------------------------------------------------===\/\/\n\nclass SerializationTest : public ASTConsumer {\n  ASTContext* Context;\n  std::list<Decl*> Decls;\n  \n  enum { BasicMetadataBlock,\n         ASTContextBlock,\n         DeclsBlock };\n\npublic:  \n  SerializationTest() : Context(NULL) {};\n  ~SerializationTest();\n\n  virtual void Initialize(ASTContext& context, unsigned) {\n      Context = &context;\n  }\n  \n  virtual void HandleTopLevelDecl(Decl *D) {\n    Decls.push_back(D);\n  }\n\nprivate:\n  void Serialize(llvm::sys::Path& Filename, llvm::sys::Path& FNameDeclPrint);\n  void Deserialize(llvm::sys::Path& Filename, llvm::sys::Path& FNameDeclPrint);\n};\n  \n} \/\/ end anonymous namespace\n\nASTConsumer* clang::CreateSerializationTest() {  \n  return new SerializationTest();\n}\n\nstatic void WritePreamble(llvm::BitstreamWriter& Stream) {\n  Stream.Emit((unsigned)'B', 8);\n  Stream.Emit((unsigned)'C', 8);\n  Stream.Emit(0xC, 4);\n  Stream.Emit(0xF, 4);\n  Stream.Emit(0xE, 4);\n  Stream.Emit(0x0, 4);\n}\n\nstatic bool ReadPreamble(llvm::BitstreamReader& Stream) {\n  return Stream.Read(8) != 'B' ||\n         Stream.Read(8) != 'C' ||\n         Stream.Read(4) != 0xC ||\n         Stream.Read(4) != 0xF ||\n         Stream.Read(4) != 0xE ||\n         Stream.Read(4) != 0x0;\n}\n\nvoid SerializationTest::Serialize(llvm::sys::Path& Filename,\n                                  llvm::sys::Path& FNameDeclPrint) {\n  \n  \/\/ Reserve 256K for bitstream buffer.\n  std::vector<unsigned char> Buffer;\n  Buffer.reserve(256*1024);\n  \n  \/\/ Create bitstream and write preamble.    \n  llvm::BitstreamWriter Stream(Buffer);\n  WritePreamble(Stream);\n  \n  \/\/ Create serializer.\n  llvm::Serializer Sezr(Stream);\n  \n  \/\/ ===---------------------------------------------------===\/\n  \/\/      Serialize the top-level decls.\n  \/\/ ===---------------------------------------------------===\/  \n  \n  Sezr.EnterBlock(DeclsBlock);\n    \n  { \/\/ Create a printer to \"consume\" our deserialized ASTS.\n\n    Janitor<ASTConsumer> Printer(CreateASTPrinter());\n    FileSP DeclFP(FNameDeclPrint,\"w\");\n    assert (DeclFP && \"Could not open file for printing out decls.\");\n    Janitor<ASTConsumer> FilePrinter(CreateASTPrinter(DeclFP));\n    \n    for (std::list<Decl*>::iterator I=Decls.begin(), E=Decls.end(); I!=E; ++I) {\n      llvm::cerr << \"Serializing: Decl.\\n\";   \n      \n      Printer->HandleTopLevelDecl(*I);\n      FilePrinter->HandleTopLevelDecl(*I);\n      \n      Sezr.EmitOwnedPtr(*I);\n    }\n  }\n  \n  Sezr.ExitBlock();\n  \n  \/\/ ===---------------------------------------------------===\/\n  \/\/      Serialize the \"Translation Unit\" metadata.\n  \/\/ ===---------------------------------------------------===\/\n\n  \/\/ Emit ASTContext.\n  Sezr.EnterBlock(ASTContextBlock);  \n  llvm::cerr << \"Serializing: ASTContext.\\n\";  \n  Sezr.EmitOwnedPtr(Context);  \n  Sezr.ExitBlock();  \n  \n  \n  Sezr.EnterBlock(BasicMetadataBlock);\n\n  \/\/ \"Fake\" emit the SourceManager.\n  llvm::cerr << \"Faux-serializing: SourceManager.\\n\";\n  Sezr.EmitPtr(&Context->SourceMgr);\n  \n  \/\/ \"Fake\" emit the Target.\n  llvm::cerr << \"Faux-serializing: Target.\\n\";\n  Sezr.EmitPtr(&Context->Target);\n\n  \/\/ \"Fake\" emit Selectors.\n  llvm::cerr << \"Faux-serializing: Selectors.\\n\";\n  Sezr.EmitPtr(&Context->Selectors);\n  \n  \/\/ Emit the Identifier Table.\n  llvm::cerr << \"Serializing: IdentifierTable.\\n\";  \n  Sezr.EmitOwnedPtr(&Context->Idents);\n\n  Sezr.ExitBlock();  \n  \n  \/\/ ===---------------------------------------------------===\/\n  \/\/ Finalize serialization: write the bits to disk.\n  { \n    FileSP fp(Filename);\n\n    if (fp)\n      fwrite((char*)&Buffer.front(), sizeof(char), Buffer.size(), fp);\n    else { \n      llvm::cerr << \"Error: Cannot open \" << Filename.c_str() << \"\\n\";\n      return;\n    }\n  }\n  \n  llvm::cerr << \"Commited bitstream to disk: \" << Filename.c_str() << \"\\n\";\n}\n\n\nvoid SerializationTest::Deserialize(llvm::sys::Path& Filename,\n                                    llvm::sys::Path& FNameDeclPrint) {\n  \n  \/\/ Create the memory buffer that contains the contents of the file.\n  \n  using llvm::MemoryBuffer;\n  \n  Janitor<MemoryBuffer> MBuffer(MemoryBuffer::getFile(Filename.c_str(),\n                                              strlen(Filename.c_str())));\n  \n  if(!MBuffer) {\n    llvm::cerr << \"ERROR: Cannot read file for deserialization.\\n\";\n    return;\n  }\n  \n  \/\/ Check if the file is of the proper length.\n  if (MBuffer->getBufferSize() & 0x3) {\n    llvm::cerr << \"ERROR: AST file length should be a multiple of 4 bytes.\\n\";\n    return;\n  }\n  \n  \/\/ Create the bitstream reader.\n  unsigned char *BufPtr = (unsigned char *) MBuffer->getBufferStart();\n  llvm::BitstreamReader Stream(BufPtr,BufPtr+MBuffer->getBufferSize());\n  \n  \/\/ Sniff for the signature in the bitcode file.\n  if (ReadPreamble(Stream)) {\n    llvm::cerr << \"ERROR: Invalid AST-bitcode signature.\\n\";\n    return;\n  }\n    \n  \/\/ Create the deserializer.\n  llvm::Deserializer Dezr(Stream);\n  \n  \/\/ ===---------------------------------------------------===\/\n  \/\/      Deserialize the \"Translation Unit\" metadata.\n  \/\/ ===---------------------------------------------------===\/\n  \n  \/\/ Skip to the BasicMetaDataBlock.  First jump to ASTContextBlock\n  \/\/ (which will appear earlier) and record its location.\n  \n  bool FoundBlock = Dezr.SkipToBlock(ASTContextBlock);\n  assert (FoundBlock);\n\n  llvm::Deserializer::Location ASTContextBlockLoc =\n    Dezr.getCurrentBlockLocation();\n  \n  FoundBlock = Dezr.SkipToBlock(BasicMetadataBlock);\n  assert (FoundBlock);\n  \n  \/\/ \"Fake\" read the SourceManager.\n  llvm::cerr << \"Faux-Deserializing: SourceManager.\\n\";\n  Dezr.RegisterPtr(&Context->SourceMgr);\n\n  \/\/ \"Fake\" read the TargetInfo.\n  llvm::cerr << \"Faux-Deserializing: Target.\\n\";\n  Dezr.RegisterPtr(&Context->Target);\n\n  \/\/ \"Fake\" read the Selectors.\n  llvm::cerr << \"Faux-Deserializing: Selectors.\\n\";\n  Dezr.RegisterPtr(&Context->Selectors);  \n  \n  \/\/ Read the identifier table.\n  llvm::cerr << \"Deserializing: IdentifierTable\\n\";\n  Dezr.ReadOwnedPtr<IdentifierTable>();\n  \n  \/\/ Now jump back to ASTContextBlock and read the ASTContext.\n  Dezr.JumpTo(ASTContextBlockLoc);\n  \n  \/\/ Read the ASTContext.  \n  llvm::cerr << \"Deserializing: ASTContext.\\n\";\n  Dezr.ReadOwnedPtr<ASTContext>();\n    \n  \/\/ \"Rewind\" the stream.  Find the block with the serialized top-level decls.\n  Dezr.Rewind();\n  FoundBlock = Dezr.SkipToBlock(DeclsBlock);\n  assert (FoundBlock);\n  llvm::Deserializer::Location DeclBlockLoc = Dezr.getCurrentBlockLocation();\n  \n  \/\/ Create a printer to \"consume\" our deserialized ASTS.\n  ASTConsumer* Printer = CreateASTPrinter();\n  Janitor<ASTConsumer> PrinterJanitor(Printer);  \n  FileSP DeclFP(FNameDeclPrint,\"w\");\n  assert (DeclFP && \"Could not open file for printing out decls.\");\n  Janitor<ASTConsumer> FilePrinter(CreateASTPrinter(DeclFP));\n  \n  \/\/ The remaining objects in the file are top-level decls.\n  while (!Dezr.FinishedBlock(DeclBlockLoc)) {\n    llvm::cerr << \"Deserializing: Decl.\\n\";\n    Decl* decl = Dezr.ReadOwnedPtr<Decl>();\n    Printer->HandleTopLevelDecl(decl);\n    FilePrinter->HandleTopLevelDecl(decl);\n  }\n}\n  \nnamespace {\n  class TmpDirJanitor {\n    llvm::sys::Path& Dir;\n  public:\n    explicit TmpDirJanitor(llvm::sys::Path& dir) : Dir(dir) {}\n\n    ~TmpDirJanitor() { \n      llvm::cerr << \"Removing: \" << Dir.c_str() << '\\n';\n      Dir.eraseFromDisk(true); \n    }\n  };\n}\n\nSerializationTest::~SerializationTest() {\n\n  std::string ErrMsg;\n  llvm::sys::Path Dir = llvm::sys::Path::GetTemporaryDirectory(&ErrMsg);\n  \n  if (Dir.isEmpty()) {\n    llvm::cerr << \"Error: \" << ErrMsg << \"\\n\";\n    return;\n  }\n  \n  TmpDirJanitor RemoveTmpOnExit(Dir);\n    \n  llvm::sys::Path FNameDeclBefore = Dir;\n  FNameDeclBefore.appendComponent(\"test.decl_before.txt\");\n\n  if (FNameDeclBefore.makeUnique(true,&ErrMsg)) {\n    llvm::cerr << \"Error: \" << ErrMsg << \"\\n\";\n    return;\n  }\n  \n  llvm::sys::Path FNameDeclAfter = Dir;\n  FNameDeclAfter.appendComponent(\"test.decl_after.txt\");\n  \n  if (FNameDeclAfter.makeUnique(true,&ErrMsg)) {\n    llvm::cerr << \"Error: \" << ErrMsg << \"\\n\";\n    return;\n  }\n\n  llvm::sys::Path ASTFilename = Dir;\n  ASTFilename.appendComponent(\"test.ast\");\n  \n  if (ASTFilename.makeUnique(true,&ErrMsg)) {\n    llvm::cerr << \"Error: \" << ErrMsg << \"\\n\";\n    return;\n  }\n  \n  \/\/ Serialize and then deserialize the ASTs.\n  Serialize(ASTFilename, FNameDeclBefore);\n  Deserialize(ASTFilename, FNameDeclAfter);\n  \n  \/\/ Read both pretty-printed files and compare them.\n  \n  using llvm::MemoryBuffer;\n  \n  Janitor<MemoryBuffer>\n    MBufferSer(MemoryBuffer::getFile(FNameDeclBefore.c_str(),\n                                     strlen(FNameDeclBefore.c_str())));\n  \n  if(!MBufferSer) {\n    llvm::cerr << \"ERROR: Cannot read pretty-printed file (pre-pickle).\\n\";\n    return;\n  }\n  \n  Janitor<MemoryBuffer>\n    MBufferDSer(MemoryBuffer::getFile(FNameDeclAfter.c_str(),\n                                      strlen(FNameDeclAfter.c_str())));\n  \n  if(!MBufferDSer) {\n    llvm::cerr << \"ERROR: Cannot read pretty-printed file (post-pickle).\\n\";\n    return;\n  }\n  \n  const char *p1 = MBufferSer->getBufferStart();\n  const char *e1 = MBufferSer->getBufferEnd();\n  const char *p2 = MBufferDSer->getBufferStart();\n  const char *e2 = MBufferDSer->getBufferEnd();\n\n  if (MBufferSer->getBufferSize() == MBufferDSer->getBufferSize())\n    for ( ; p1 != e1 ; ++p1, ++p2  )\n      if (*p1 != *p2) break;\n  \n  if (p1 != e1 || p2 != e2 )\n    llvm::cerr << \"ERROR: Pretty-printed files are not the same.\\n\";\n  else\n    llvm::cerr << \"SUCCESS: Pretty-printed files are the same.\\n\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -----------------------------------------------------------------------------\n\/\/ Copyright  : (C) 2014 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\/\/ Renderer\n\/\/ -----------------------------------------------------------------------------\n\n#include \"renderer.hpp\"\n\nRenderer::Renderer() :\n_scene{},\n_colorbuffer{},\n_ppm{}\n{}\n\nvoid Renderer::render()\n{\n\t\n\treserveColorbuffer(_scene._resolution);\n\n\t_ppm.setResolution(_scene._resolution);\n\n\traycast();\n\n\t\/*\n\t\/\/some testing\n\tPixel p(std::get<0>(scene._resolution)\/2,std::get<1>(scene._resolution)\/2);\n\t\n\tp.color = Color(1.0, 1.0, 1.0);\n\twrite(p);\n\t*\/\n\n\t_ppm.save(\"test\");\n}\n\nvoid Renderer::setScene(Scene const& scene)\n{\n\t_scene = scene;\n}\n\nvoid Renderer::reserveColorbuffer(std::tuple<int,int> const& resolution)\n{\n\tfloat size = std::get<0>(resolution) * std::get<1>(resolution);\n\t_colorbuffer.resize(size, Color(0.0, 0.0, 0.0));\n}\n\nvoid Renderer::raycast()\n{\n\t\n\tfloat distance = _scene._camera.getDistance(std::get<0>(_scene._resolution));\n\n\tColor white{1.0,1.0,1.0};\n\tColor black{0.0,0.0,0.0};\n\n\t\/\/float distance{0.0};\n\n\tfor (std::vector<Color>::iterator i = _colorbuffer.begin(); i != _colorbuffer.end(); ++i)\n\t{\n\t\tint x = (i - _colorbuffer.begin()) % std::get<0>(_scene._resolution);\n\t\tint y =\tfloor((i - _colorbuffer.begin()) \/ std::get<0>(_scene._resolution)); \n\n\t\t*i = trace(_scene._camera.getEyeRay( x, y, distance));\n\t}\n\t\n}\n\nColor Renderer::trace(Ray r)\n{\n\tfloat distance = 0.0;\n\n\tfloat nearestDistance = 0.0;\n\n\tstd::shared_ptr<Shape> nearestObject;\n\n\tfor(std::map<std::string, std::shared_ptr<Shape>>::iterator i = _scene._shapes.begin(); i != _scene._shapes.end(); ++i)\n\t{\n\t\tbool hit = i->second->intersect(r, distance);\n\t\tOptionalHit tmp{};\n\n\t\ttmp._hit = hit;\n\n\t\tif(hit)\n\t\t{\n\t\t\tif(distance < nearestDistance || nearestDistance == 0.0)\n\t\t\t{\n\t\t\t\tnearestDistance = distance;\n\t\t\t\tnearestObject = i->second;\n\t\t\t\ttmp._shape = i->second;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttmp._shape = nullptr;\n\t\t\t\ttmp._t = INFINITY;\n\t\t\t}\n\t\t}\n\t\treturn shade(tmp);\n\t}\n}\n\nColor Renderer::shade(OptionalHit hit)\n{\n\tColor backgroundColor{0.0, 0.0, 0.0};\n\n\tif(hit._hit)\n\t{\n\t\treturn hit._shape->material().ka();\n\t}\n\telse\n\t{\n\t\treturn backgroundColor;\n\t}\n}\n\nvoid Renderer::write(Pixel const& p)\n{\n\t\/\/ flip pixels, because of opengl glDrawPixels\n\tsize_t position = (std::get<0>(_resolution)*p.y + p.x);\n\n\tif (position >= _colorbuffer.size() || (int)position < 0)\n\t{\n\t\tstd::cerr << \"Fatal Error Renderer::write(Pixel p) : \"\n\t\t<< \"pixel out of ppm_ : \"\n\t\t<< (int)p.x << \",\" << (int)p.y\n\t\t<< std::endl;\n\t}\n\telse\n\t{\n\t\t_colorbuffer[position] = p.color;\n\t}\n\n\t\/\/extra for the image-file output\n\t_ppm.write(p);\n}\n\n\/*\nconst std::size_t checkersize = 20;\n\nfor (unsigned y = 0; y < height_; ++y)\n{\n\tfor (unsigned x = 0; x < width_; ++x)\n\t{\n\t\tPixel p(x,y);\n\t\tif ( ((x\/checkersize)%2) != ((y\/checkersize)%2))\n\t\t{\n\t\tp.color = Color(0.0, 1.0, float(x)\/height_);\n\t\t}\n\t\telse\n\t\t{\n\t\tp.color = Color(1.0, 0.0, float(y)\/width_);\n\t\t}\n\n\t\twrite(p);\n\t}\n}\nppm_.save(filename_);\n*\/<commit_msg>removed unnessecary code<commit_after>\/\/ -----------------------------------------------------------------------------\n\/\/ Copyright  : (C) 2014 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\/\/ Renderer\n\/\/ -----------------------------------------------------------------------------\n\n#include \"renderer.hpp\"\n\nRenderer::Renderer() :\n_scene{},\n_colorbuffer{},\n_ppm{}\n{}\n\nvoid Renderer::render()\n{\n\t\n\treserveColorbuffer(_scene._resolution);\n\n\t_ppm.setResolution(_scene._resolution);\n\n\traycast();\n\n\t\/*\n\t\/\/some testing\n\tPixel p(std::get<0>(scene._resolution)\/2,std::get<1>(scene._resolution)\/2);\n\t\n\tp.color = Color(1.0, 1.0, 1.0);\n\twrite(p);\n\t*\/\n\n\t_ppm.save(\"test\");\n}\n\nvoid Renderer::setScene(Scene const& scene)\n{\n\t_scene = scene;\n}\n\nvoid Renderer::reserveColorbuffer(std::tuple<int,int> const& resolution)\n{\n\tfloat size = std::get<0>(resolution) * std::get<1>(resolution);\n\t_colorbuffer.resize(size, Color(0.0, 0.0, 0.0));\n}\n\nvoid Renderer::raycast()\n{\n\t\n\tfloat distance = _scene._camera.getDistance(std::get<0>(_scene._resolution));\n\n\tColor white{1.0,1.0,1.0};\n\tColor black{0.0,0.0,0.0};\n\n\t\/\/float distance{0.0};\n\n\tfor (std::vector<Color>::iterator i = _colorbuffer.begin(); i != _colorbuffer.end(); ++i)\n\t{\n\t\tint x = (i - _colorbuffer.begin()) % std::get<0>(_scene._resolution);\n\t\tint y =\tfloor((i - _colorbuffer.begin()) \/ std::get<0>(_scene._resolution)); \n\n\t\t*i = trace(_scene._camera.getEyeRay( x, y, distance));\n\t}\n\t\n}\n\nColor Renderer::trace(Ray r)\n{\n\tfloat distance = 0.0;\n\n\tfloat nearestDistance = 0.0;\n\n\tstd::shared_ptr<Shape> nearestObject;\n\n\tfor(std::map<std::string, std::shared_ptr<Shape>>::iterator i = _scene._shapes.begin(); i != _scene._shapes.end(); ++i)\n\t{\n\t\tbool hit = i->second->intersect(r, distance);\n\t\tOptionalHit tmp{};\n\n\t\ttmp._hit = hit;\n\n\t\tif(hit)\n\t\t{\n\t\t\tif(distance < nearestDistance || nearestDistance == 0.0)\n\t\t\t{\n\t\t\t\tnearestDistance = distance;\n\t\t\t\tnearestObject = i->second;\n\t\t\t\ttmp._shape = i->second;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttmp._shape = nullptr;\n\t\t\t\ttmp._t = INFINITY;\n\t\t\t}\n\t\t}\n\t\treturn shade(tmp);\n\t}\n}\n\nColor Renderer::shade(OptionalHit hit)\n{\n\tColor backgroundColor{0.0, 0.0, 0.0};\n\n\tif(hit._hit)\n\t{\n\t\treturn hit._shape->material().ka();\n\t}\n\telse\n\t{\n\t\treturn backgroundColor;\n\t}\n}\n\nvoid Renderer::write(Pixel const& p)\n{\n\t\/\/ flip pixels, because of opengl glDrawPixels\n\tsize_t position = (std::get<0>(_resolution)*p.y + p.x);\n\n\tif (position >= _colorbuffer.size() || (int)position < 0)\n\t{\n\t\tstd::cerr << \"Fatal Error Renderer::write(Pixel p) : \"\n\t\t<< \"pixel out of ppm_ : \"\n\t\t<< (int)p.x << \",\" << (int)p.y\n\t\t<< std::endl;\n\t}\n\telse\n\t{\n\t\t_colorbuffer[position] = p.color;\n\t}\n\n\t\/\/extra for the image-file output\n\t_ppm.write(p);\n}<|endoftext|>"}
{"text":"<commit_before>#include \"HTTPServer.hpp\"\n#include <czmq.h>\n#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <sys\/mman.h>\n#include <sys\/types.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <assert.h>\n#include \"zutil.hpp\"\n\n#define controlEndpoint \"inproc:\/\/http\/control\"\n\nstatic size_t getFilesize(const char* filename) {\n    struct stat st;\n    stat(filename, &st);\n    return st.st_size;   \n}\n\nstatic bool fileExists(const char* file) {\n    struct stat buf;\n    return (stat(file, &buf) == 0);\n}\n\n\/**\n * Represents a readonly static file instance which has been mmapped\n * into vmem and possible pre-cached by the kernel.\n *\/\nclass MMappedStaticFile {\npublic:\n    \/**\n     * mmap a new static file.\n     *\/\n    MMappedStaticFile(const char* filename) {\n        this->size = getFilesize(filename);\n        fd = open(filename, O_RDONLY, 0);\n        mem = mmap(nullptr, size, PROT_READ, MAP_PRIVATE | MAP_POPULATE, fd, 0);\n        assert(mem != nullptr);\n        \/\/File will always be sent sequentially\n        madvise(mem, size, MADV_SEQUENTIAL);\n    }\n    ~MMappedStaticFile() {\n        assert(munmap(mem, size) == 0);\n        close(fd);\n    }\n    \/\/The mmapped memory\n    void* mem;\n    size_t size;\nprivate:\n    \/\/The file descriptor that is mmapped\n    int fd;\n};\n\nusing namespace std;\n\nYakHTTPServer::YakHTTPServer(zctx_t* ctxParam, const std::string& endpointParam, const std::string& staticFileRoot) : endpoint(endpointParam), ctx(ctxParam), thread(nullptr), logger(ctx, \"HTTP Server\"), staticFileRoot(staticFileRoot) {\n    controlSocket = zsocket_new_bind(ctx, ZMQ_PAIR, controlEndpoint);\n    \/\/Start thread\n    thread = new std::thread(std::mem_fun(&YakHTTPServer::workerMain), this);\n}\n\n\/\/Static HTTP error msgs\nstatic const char securityErrorMessage[] = \"HTTP\/1.1 403 Forbidden\\r\\nContent-type: text\/plain\\r\\n\\r\\nSecurity error: Path must not contain ..\";\nstatic const char notFoundError[] = \"HTTP\/1.1 404 Not Found\\r\\nContent-type: text\/plain\\r\\n\\r\\nFile not found\";\n\n\n\/**\n * @return A constant string representing the MIME type, e.g. \"text\/plain\")\n *\/\nstatic const char* getMIMEType(const char* buffer) {\n    \/\/Find the beginning of the file ext === the last '.' occurrence -> strRchr\n    const char* fileExtensionPtr = strrchr(buffer, '.');\n    if(fileExtensionPtr == nullptr) {\n        return \"text\/plain\";\n    }\n\n    \/\/We found an extension\n    if(strcmp(\".html\", fileExtensionPtr) == 0) {\n        return \"text\/html\";\n    } else if(strcmp(\".js\", fileExtensionPtr) == 0) {\n        return \"text\/javascript\";\n    } else if(strcmp(\".css\", fileExtensionPtr) == 0) {\n        return \"text\/css\";\n    } else if(strcmp(\".jpg\", fileExtensionPtr) == 0\n        || strcmp(\".jpeg\", fileExtensionPtr) == 0) {\n        return \"image\/jpeg\";\n    } else if(strcmp(\".png\", fileExtensionPtr) == 0) {\n        return \"image\/png\";\n    } else if(strcmp(\".ico\", fileExtensionPtr) == 0) {\n        return \"image\/x-icon\";\n    } else {\n        return \"text\/plain\";\n    }\n}\n\nvoid YakHTTPServer::serveStaticFile(const char* fileURL) {\n    sendReplyIdentity();\n    \/\/Security: Check if the file contains relative paths\n    if(strstr(fileURL, \"..\") != nullptr) {\n        zmq_send_const(httpSocket, securityErrorMessage, sizeof(securityErrorMessage), 0);\n        return;\n    }\n    \/\/No security violation, check if the file exists\n    if(fileURL[0] == '\/') {\n        fileURL++;\n    }\n    if(fileURL[0] == '\\0') {\n        fileURL = \"index.html\";\n    }\n    string absoluteFilePath = staticFileRoot + string(fileURL);\n    if(!fileExists(absoluteFilePath.c_str())) {\n        zmq_send_const(httpSocket, notFoundError, sizeof(notFoundError), 0);\n        return;\n    }\n    \/\/File exists, mmap if neccessary\n    if(mappedFiles.count(absoluteFilePath) == 0) {\n        mappedFiles[absoluteFilePath] = new MMappedStaticFile(absoluteFilePath.c_str());\n    }\n    MMappedStaticFile* file = mappedFiles[absoluteFilePath];\n    const char* mimeType = getMIMEType(fileURL);\n    \/\/Send the header\n    string header(\"HTTP\/1.1 200 OK\\r\\nContent-type: \" + string(mimeType) \n                    + \"\\r\\nContent-Length: \" + std::to_string(file->size) +  \"\\r\\n\\r\\n\");\n    zmq_send_const(httpSocket, header.data(), header.size(), 0);\n    \/\/Send data\n    sendReplyIdentity();\n    zmq_send_const(httpSocket, file->mem, file->size, 0);\n}\n\nvoid YakHTTPServer::sendReplyIdentity() {\n    if(unlikely(zmq_send_const (httpSocket, replyAddr, replyAddrSize, ZMQ_SNDMORE) == -1)) {\n        logger.error(\"Error while sending stream reply adress: \" + string(zmq_strerror(errno)));\n    }\n}\n\nvoid YakHTTPServer::workerMain() {\n    \/\/TODO proper error handling\n    logger.trace(\"HTTP Server starting\");\n    \/\/Initialize router socket\n    httpSocket = zsocket_new(ctx, ZMQ_STREAM);\n    assert(zsocket_bind(httpSocket, endpoint.c_str()) != -1);\n    \/\/Initialize other stuff\n    zmq_msg_t replyAddrFrame;\n    zmq_msg_init(&replyAddrFrame);\n    zmq_msg_t request;\n    zmq_msg_init(&request);\n    zmq_msg_t response;\n    zmq_msg_init(&response);\n    \/\/Initialize control socket (receives STOP cmd etc.)\n    void* controlRecvSocket = zsocket_new_connect(ctx, ZMQ_PAIR, controlEndpoint);\n    zmq_pollitem_t items[2];\n    items[0].socket = httpSocket;\n    items[0].events = ZMQ_POLLIN;\n    items[1].socket = controlRecvSocket;\n    items[1].events = ZMQ_POLLIN;\n    while(true) {\n         \/\/  Get HTTP request\n        assert(zmq_poll(items, 2, -1) != -1);\n        \/\/Check if we received a control msg\n        if(items[1].revents) {\n            \/\/It must be a stop message\n            zmq_recv(controlRecvSocket, nullptr, 0, 0);\n            break;\n        }\n        assert(items[0].revents);\n        \/\/Receive the reply adress\n        zmq_msg_init(&replyAddrFrame);\n        if(unlikely(zmq_msg_recv(&replyAddrFrame, httpSocket, 0) == -1)) {\n            logger.error(\"HTTP critical error: Reply address could not be received correctly: \" + string(zmq_strerror(errno)));\n            continue;\n        }\n        \/\/Receive the request itself (might be multi-part but we're ATM not interested in all the header\n        if(unlikely(zmq_msg_recv(&request, httpSocket, 0) == -1)) {\n            logger.error(\"Error while receiving HTTP request: \" + std::string(zmq_strerror(errno)));\n            continue;\n        }\n        \/\/Extract the request type from the request\n        char* requestData = (char*)zmq_msg_data(&request);\n        bool isGETRequest = (memcmp(requestData, \"GET \", 4) == 0);\n        assert(isGETRequest);\n        \/\/Ensure there are no frames left to receive!\n        recvAndIgnore(httpSocket);\n        \/\/Make a NUL-delimited string from the request path\n        char* requestPath = strchr(requestData, ' ') + 1;\n        *(strchr(requestPath, ' ')) = '\\0';\n        \/**\n         * NOTE: Even if the reply adress is non-const data,\n         * it is deallocated by the IO thread when the connection is closed\n         * and certainly won't change, so we can treat it as constant\n         * and therefore zero-copy data while the HTTP connection is open\n         *\/\n        replyAddr = (char*) zmq_msg_data(&replyAddrFrame);\n        replyAddrSize = zmq_msg_size(&replyAddrFrame);\n        \/\/TODO Check routes\n        serveStaticFile(requestPath);\n        \/\/Cleanup\n        closeTCPConnection();\n        zmq_msg_close(&replyAddrFrame);\n    }\n    logger.debug(\"HTTP Server terminating...\");\n    zsocket_destroy(ctx, controlRecvSocket);\n    zsocket_destroy(ctx, httpSocket);\n    httpSocket = nullptr;\n}\n\nvoid YakHTTPServer::closeTCPConnection() {\n    sendReplyIdentity();\n    sendEmptyFrameMessage(httpSocket);\n}\n\nvoid YakHTTPServer::terminate() {\n    if(thread != nullptr) {\n        \/\/Send control msg\n        zmq_send(controlSocket, NULL, 0, 0);\n        zsocket_destroy(ctx, controlSocket);\n        \/\/Wait until the thread exists\n        thread->join();\n        delete thread;\n        thread = nullptr;\n    }\n    logger.terminate();\n}\n\nYakHTTPServer::~YakHTTPServer() {\n    terminate();\n    \/\/munmap all mmapped files\n    for(auto pair : mappedFiles) {\n        delete pair.second;\n    }\n}<commit_msg>Added log message on mmap<commit_after>#include \"HTTPServer.hpp\"\n#include <czmq.h>\n#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <sys\/mman.h>\n#include <sys\/types.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <assert.h>\n#include \"zutil.hpp\"\n\n#define controlEndpoint \"inproc:\/\/http\/control\"\n\nstatic size_t getFilesize(const char* filename) {\n    struct stat st;\n    stat(filename, &st);\n    return st.st_size;   \n}\n\nstatic bool fileExists(const char* file) {\n    struct stat buf;\n    return (stat(file, &buf) == 0);\n}\n\n\/**\n * Represents a readonly static file instance which has been mmapped\n * into vmem and possible pre-cached by the kernel.\n *\/\nclass MMappedStaticFile {\npublic:\n    \/**\n     * mmap a new static file.\n     *\/\n    MMappedStaticFile(const char* filename) {\n        this->size = getFilesize(filename);\n        fd = open(filename, O_RDONLY, 0);\n        mem = mmap(nullptr, size, PROT_READ, MAP_PRIVATE | MAP_POPULATE, fd, 0);\n        assert(mem != nullptr);\n        \/\/File will always be sent sequentially\n        madvise(mem, size, MADV_SEQUENTIAL);\n    }\n    ~MMappedStaticFile() {\n        assert(munmap(mem, size) == 0);\n        close(fd);\n    }\n    \/\/The mmapped memory\n    void* mem;\n    size_t size;\nprivate:\n    \/\/The file descriptor that is mmapped\n    int fd;\n};\n\nusing namespace std;\n\nYakHTTPServer::YakHTTPServer(zctx_t* ctxParam, const std::string& endpointParam, const std::string& staticFileRoot) : endpoint(endpointParam), ctx(ctxParam), thread(nullptr), logger(ctx, \"HTTP Server\"), staticFileRoot(staticFileRoot) {\n    controlSocket = zsocket_new_bind(ctx, ZMQ_PAIR, controlEndpoint);\n    \/\/Start thread\n    thread = new std::thread(std::mem_fun(&YakHTTPServer::workerMain), this);\n}\n\n\/\/Static HTTP error msgs\nstatic const char securityErrorMessage[] = \"HTTP\/1.1 403 Forbidden\\r\\nContent-type: text\/plain\\r\\n\\r\\nSecurity error: Path must not contain ..\";\nstatic const char notFoundError[] = \"HTTP\/1.1 404 Not Found\\r\\nContent-type: text\/plain\\r\\n\\r\\nFile not found\";\n\n\n\/**\n * @return A constant string representing the MIME type, e.g. \"text\/plain\")\n *\/\nstatic const char* getMIMEType(const char* buffer) {\n    \/\/Find the beginning of the file ext === the last '.' occurrence -> strRchr\n    const char* fileExtensionPtr = strrchr(buffer, '.');\n    if(fileExtensionPtr == nullptr) {\n        return \"text\/plain\";\n    }\n\n    \/\/We found an extension\n    if(strcmp(\".html\", fileExtensionPtr) == 0) {\n        return \"text\/html\";\n    } else if(strcmp(\".js\", fileExtensionPtr) == 0) {\n        return \"text\/javascript\";\n    } else if(strcmp(\".css\", fileExtensionPtr) == 0) {\n        return \"text\/css\";\n    } else if(strcmp(\".jpg\", fileExtensionPtr) == 0\n        || strcmp(\".jpeg\", fileExtensionPtr) == 0) {\n        return \"image\/jpeg\";\n    } else if(strcmp(\".png\", fileExtensionPtr) == 0) {\n        return \"image\/png\";\n    } else if(strcmp(\".ico\", fileExtensionPtr) == 0) {\n        return \"image\/x-icon\";\n    } else {\n        return \"text\/plain\";\n    }\n}\n\nvoid YakHTTPServer::serveStaticFile(const char* fileURL) {\n    sendReplyIdentity();\n    \/\/Security: Check if the file contains relative paths\n    if(strstr(fileURL, \"..\") != nullptr) {\n        zmq_send_const(httpSocket, securityErrorMessage, sizeof(securityErrorMessage), 0);\n        return;\n    }\n    \/\/No security violation, check if the file exists\n    if(fileURL[0] == '\/') {\n        fileURL++;\n    }\n    if(fileURL[0] == '\\0') {\n        fileURL = \"index.html\";\n    }\n    string absoluteFilePath = staticFileRoot + string(fileURL);\n    if(!fileExists(absoluteFilePath.c_str())) {\n        zmq_send_const(httpSocket, notFoundError, sizeof(notFoundError), 0);\n        return;\n    }\n    \/\/File exists, mmap if neccessary\n    if(mappedFiles.count(absoluteFilePath) == 0) {\n        logger.trace(\"mmap'ing static file \" + absoluteFilePath);\n        mappedFiles[absoluteFilePath] = new MMappedStaticFile(absoluteFilePath.c_str());\n    }\n    MMappedStaticFile* file = mappedFiles[absoluteFilePath];\n    const char* mimeType = getMIMEType(fileURL);\n    \/\/Send the header\n    string header(\"HTTP\/1.1 200 OK\\r\\nContent-type: \" + string(mimeType) \n                    + \"\\r\\nContent-Length: \" + std::to_string(file->size) +  \"\\r\\n\\r\\n\");\n    zmq_send_const(httpSocket, header.data(), header.size(), 0);\n    \/\/Send data\n    sendReplyIdentity();\n    zmq_send_const(httpSocket, file->mem, file->size, 0);\n}\n\nvoid YakHTTPServer::sendReplyIdentity() {\n    if(unlikely(zmq_send_const (httpSocket, replyAddr, replyAddrSize, ZMQ_SNDMORE) == -1)) {\n        logger.error(\"Error while sending stream reply adress: \" + string(zmq_strerror(errno)));\n    }\n}\n\nvoid YakHTTPServer::workerMain() {\n    \/\/TODO proper error handling\n    logger.trace(\"HTTP Server starting\");\n    \/\/Initialize router socket\n    httpSocket = zsocket_new(ctx, ZMQ_STREAM);\n    assert(zsocket_bind(httpSocket, endpoint.c_str()) != -1);\n    \/\/Initialize other stuff\n    zmq_msg_t replyAddrFrame;\n    zmq_msg_init(&replyAddrFrame);\n    zmq_msg_t request;\n    zmq_msg_init(&request);\n    zmq_msg_t response;\n    zmq_msg_init(&response);\n    \/\/Initialize control socket (receives STOP cmd etc.)\n    void* controlRecvSocket = zsocket_new_connect(ctx, ZMQ_PAIR, controlEndpoint);\n    zmq_pollitem_t items[2];\n    items[0].socket = httpSocket;\n    items[0].events = ZMQ_POLLIN;\n    items[1].socket = controlRecvSocket;\n    items[1].events = ZMQ_POLLIN;\n    while(true) {\n         \/\/  Get HTTP request\n        assert(zmq_poll(items, 2, -1) != -1);\n        \/\/Check if we received a control msg\n        if(items[1].revents) {\n            \/\/It must be a stop message\n            zmq_recv(controlRecvSocket, nullptr, 0, 0);\n            break;\n        }\n        assert(items[0].revents);\n        \/\/Receive the reply adress\n        zmq_msg_init(&replyAddrFrame);\n        if(unlikely(zmq_msg_recv(&replyAddrFrame, httpSocket, 0) == -1)) {\n            logger.error(\"HTTP critical error: Reply address could not be received correctly: \" + string(zmq_strerror(errno)));\n            continue;\n        }\n        \/\/Receive the request itself (might be multi-part but we're ATM not interested in all the header\n        if(unlikely(zmq_msg_recv(&request, httpSocket, 0) == -1)) {\n            logger.error(\"Error while receiving HTTP request: \" + std::string(zmq_strerror(errno)));\n            continue;\n        }\n        \/\/Extract the request type from the request\n        char* requestData = (char*)zmq_msg_data(&request);\n        bool isGETRequest = (memcmp(requestData, \"GET \", 4) == 0);\n        assert(isGETRequest);\n        \/\/Ensure there are no frames left to receive!\n        recvAndIgnore(httpSocket);\n        \/\/Make a NUL-delimited string from the request path\n        char* requestPath = strchr(requestData, ' ') + 1;\n        *(strchr(requestPath, ' ')) = '\\0';\n        \/**\n         * NOTE: Even if the reply adress is non-const data,\n         * it is deallocated by the IO thread when the connection is closed\n         * and certainly won't change, so we can treat it as constant\n         * and therefore zero-copy data while the HTTP connection is open\n         *\/\n        replyAddr = (char*) zmq_msg_data(&replyAddrFrame);\n        replyAddrSize = zmq_msg_size(&replyAddrFrame);\n        \/\/TODO Check routes\n        serveStaticFile(requestPath);\n        \/\/Cleanup\n        closeTCPConnection();\n        zmq_msg_close(&replyAddrFrame);\n    }\n    logger.debug(\"HTTP Server terminating...\");\n    zsocket_destroy(ctx, controlRecvSocket);\n    zsocket_destroy(ctx, httpSocket);\n    httpSocket = nullptr;\n}\n\nvoid YakHTTPServer::closeTCPConnection() {\n    sendReplyIdentity();\n    sendEmptyFrameMessage(httpSocket);\n}\n\nvoid YakHTTPServer::terminate() {\n    if(thread != nullptr) {\n        \/\/Send control msg\n        zmq_send(controlSocket, NULL, 0, 0);\n        zsocket_destroy(ctx, controlSocket);\n        \/\/Wait until the thread exists\n        thread->join();\n        delete thread;\n        thread = nullptr;\n    }\n    logger.terminate();\n}\n\nYakHTTPServer::~YakHTTPServer() {\n    terminate();\n    \/\/munmap all mmapped files\n    for(auto pair : mappedFiles) {\n        delete pair.second;\n    }\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef SIXTRACKLIB_SIXTRACKLIB_HPP__\n#define SIXTRACKLIB_SIXTRACKLIB_HPP__\n\n\/* ------------------------------------------------------------------------- *\/\n\n#include \"sixtracklib\/common\/generated\/namespace.h\"\n#include \"sixtracklib\/common\/generated\/config.h\"\n#include \"sixtracklib\/common\/definitions.h\"\n\n#include \"sixtracklib\/common\/buffer.hpp\"\n#include \"sixtracklib\/common\/be_drift\/be_drift.hpp\"\n#include \"sixtracklib\/common\/particles.hpp\"\n\n#include \"sixtracklib\/sixtracklib.h\"\n\n\/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - *\/\n\n#if defined( SIXTRACKLIB_ENABLE_MODULE_SIMD ) && \\\n           ( SIXTRACKLIB_ENABLE_MODULE_SIMD == 1 )\n\n\/\/     #include \"sixtracklib\/simd\/track.h\"\n\n#endif \/* defined( SIXTRACKLIB_ENABLE_MODULE_SIMD ) *\/\n\n\/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - *\/\n\n#if defined( SIXTRACKLIB_ENABLE_MODULE_OPENCL ) && \\\n           ( SIXTRACKLIB_ENABLE_MODULE_OPENCL == 1 )\n\n\/\/     #include \"sixtracklib\/opencl\/argument.h\"\n\/\/     #include \"sixtracklib\/opencl\/context.h\"\n\n\/\/     #include \"sixtracklib\/opencl\/buffer.h\"\n\/\/     #include \"sixtracklib\/opencl\/ocl_environment.h\"\n\n#endif \/* defined( SIXTRACKLIB_ENABLE_MODULE_OPENCL ) *\/\n\n\/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - *\/\n\n#if defined( SIXTRACKLIB_ENABLE_MODULE_CUDA ) && \\\n           ( SIXTRACKLIB_ENABLE_MODULE_CUDA == 1 )\n\n\/\/     #include \"sixtracklib\/cuda\/buffer.h\"\n\/\/     #include \"sixtracklib\/cuda\/impl\/track_particles_kernel_c_wrapper.h\"\n\n#endif \/* defined( SIXTRACKLIB_ENABLE_MODULE_OPENCL ) *\/\n\n\n\/* ------------------------------------------------------------------------- *\/\n\n#endif \/* SIXTRACKLIB_SIXTRACKLIB_HPP__ *\/\n\n\/* end: sixtracklib\/sixtracklib.hpp *\/\n<commit_msg>common: adds missing header for st::BeamMonitor to convenience header sixtracklib.hpp<commit_after>#ifndef SIXTRACKLIB_SIXTRACKLIB_HPP__\n#define SIXTRACKLIB_SIXTRACKLIB_HPP__\n\n\/* ------------------------------------------------------------------------- *\/\n\n#include \"sixtracklib\/common\/generated\/namespace.h\"\n#include \"sixtracklib\/common\/generated\/config.h\"\n#include \"sixtracklib\/common\/definitions.h\"\n\n#include \"sixtracklib\/common\/buffer.hpp\"\n#include \"sixtracklib\/common\/be_drift\/be_drift.hpp\"\n#include \"sixtracklib\/common\/be_monitor\/be_monitor.hpp\"\n#include \"sixtracklib\/common\/particles.hpp\"\n\n#include \"sixtracklib\/sixtracklib.h\"\n\n\/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - *\/\n\n#if defined( SIXTRACKLIB_ENABLE_MODULE_SIMD ) && \\\n           ( SIXTRACKLIB_ENABLE_MODULE_SIMD == 1 )\n\n\/\/     #include \"sixtracklib\/simd\/track.h\"\n\n#endif \/* defined( SIXTRACKLIB_ENABLE_MODULE_SIMD ) *\/\n\n\/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - *\/\n\n#if defined( SIXTRACKLIB_ENABLE_MODULE_OPENCL ) && \\\n           ( SIXTRACKLIB_ENABLE_MODULE_OPENCL == 1 )\n\n\/\/     #include \"sixtracklib\/opencl\/argument.h\"\n\/\/     #include \"sixtracklib\/opencl\/context.h\"\n\n\/\/     #include \"sixtracklib\/opencl\/buffer.h\"\n\/\/     #include \"sixtracklib\/opencl\/ocl_environment.h\"\n\n#endif \/* defined( SIXTRACKLIB_ENABLE_MODULE_OPENCL ) *\/\n\n\/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - *\/\n\n#if defined( SIXTRACKLIB_ENABLE_MODULE_CUDA ) && \\\n           ( SIXTRACKLIB_ENABLE_MODULE_CUDA == 1 )\n\n\/\/     #include \"sixtracklib\/cuda\/buffer.h\"\n\/\/     #include \"sixtracklib\/cuda\/impl\/track_particles_kernel_c_wrapper.h\"\n\n#endif \/* defined( SIXTRACKLIB_ENABLE_MODULE_OPENCL ) *\/\n\n\n\/* ------------------------------------------------------------------------- *\/\n\n#endif \/* SIXTRACKLIB_SIXTRACKLIB_HPP__ *\/\n\n\/* end: sixtracklib\/sixtracklib.hpp *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Phusion Passenger - https:\/\/www.phusionpassenger.com\/\n *  Copyright (c) 2010 Phusion\n *\n *  \"Phusion Passenger\" is a trademark of Hongli Lai & Ninh Bui.\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 <iomanip>\n#include <cstdlib>\n#include <fcntl.h>\n#include <unistd.h>\n#include <Logging.h>\n\nnamespace Passenger {\n\nint _logLevel = 0;\nint _logOutput = STDERR_FILENO;\n\nint\ngetLogLevel() {\n\treturn _logLevel;\n}\n\nvoid\nsetLogLevel(int value) {\n\t_logLevel = value;\n}\n\nbool\nsetDebugFile(const char *logFile) {\n\tint fd = open(logFile, O_WRONLY | O_CREAT | O_APPEND, 0644);\n\tif (fd != -1) {\n\t\t_logOutput = fd;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\nvoid\n_prepareLogEntry(std::stringstream &sstream, const char *file, unsigned int line) {\n\ttime_t the_time;\n\tstruct tm the_tm;\n\tchar datetime_buf[60];\n\tstruct timeval tv;\n\t\n\tthe_time = time(NULL);\n\tlocaltime_r(&the_time, &the_tm);\n\tstrftime(datetime_buf, sizeof(datetime_buf) - 1, \"%F %H:%M:%S\", &the_tm);\n\tgettimeofday(&tv, NULL);\n\tsstream <<\n\t\t\"[ pid=\" << std::dec << getpid() <<\n\t\t\" thr=\" << std::hex << pthread_self() << std::dec <<\n\t\t\" time=\" << datetime_buf << \".\" << std::setfill('0') << std::setw(4) <<\n\t\t\t(unsigned long) (tv.tv_usec \/ 100) <<\n\t\t\" file=\" << file << \":\" << line <<\n\t\t\" ]: \";\n}\n\nvoid\n_writeLogEntry(const std::string &str) {\n\tsize_t written = 0;\n\tdo {\n\t\tssize_t ret = write(_logOutput, str.data() + written, str.size() - written);\n\t\tif (ret != -1) {\n\t\t\twritten += ret;\n\t\t}\n\t} while (written < str.size());\n}\n\n} \/\/ namespace Passenger\n\n<commit_msg>Make log output more compact.<commit_after>\/*\n *  Phusion Passenger - https:\/\/www.phusionpassenger.com\/\n *  Copyright (c) 2010 Phusion\n *\n *  \"Phusion Passenger\" is a trademark of Hongli Lai & Ninh Bui.\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 <iomanip>\n#include <cstdlib>\n#include <fcntl.h>\n#include <unistd.h>\n#include <Logging.h>\n#include <Utils\/StrIntUtils.h>\n\nnamespace Passenger {\n\nint _logLevel = 0;\nint _logOutput = STDERR_FILENO;\n\nint\ngetLogLevel() {\n\treturn _logLevel;\n}\n\nvoid\nsetLogLevel(int value) {\n\t_logLevel = value;\n}\n\nbool\nsetDebugFile(const char *logFile) {\n\tint fd = open(logFile, O_WRONLY | O_CREAT | O_APPEND, 0644);\n\tif (fd != -1) {\n\t\t_logOutput = fd;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\nvoid\n_prepareLogEntry(std::stringstream &sstream, const char *file, unsigned int line) {\n\ttime_t the_time;\n\tstruct tm the_tm;\n\tchar datetime_buf[60];\n\tstruct timeval tv;\n\n\tif (startsWith(file, \"ext\/\")) {\n\t\tfile += sizeof(\"ext\/\") - 1;\n\t\tif (startsWith(file, \"common\/\")) {\n\t\t\tfile += sizeof(\"common\/\") - 1;\n\t\t}\n\t}\n\t\n\tthe_time = time(NULL);\n\tlocaltime_r(&the_time, &the_tm);\n\tstrftime(datetime_buf, sizeof(datetime_buf) - 1, \"%F %H:%M:%S\", &the_tm);\n\tgettimeofday(&tv, NULL);\n\tsstream <<\n\t\t\"[ \" << std::dec << getpid() <<\n\t\t\"\/\" << std::hex << pthread_self() << std::dec <<\n\t\t\" \" << datetime_buf << \".\" << std::setfill('0') << std::setw(4) <<\n\t\t\t(unsigned long) (tv.tv_usec \/ 100) <<\n\t\t\" \" << file << \":\" << line <<\n\t\t\" ]: \";\n}\n\nvoid\n_writeLogEntry(const std::string &str) {\n\tsize_t written = 0;\n\tdo {\n\t\tssize_t ret = write(_logOutput, str.data() + written, str.size() - written);\n\t\tif (ret != -1) {\n\t\t\twritten += ret;\n\t\t}\n\t} while (written < str.size());\n}\n\n} \/\/ namespace Passenger\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *  @file\n *  @author     2012 Stefan Radomski (stefan.radomski@cs.tu-darmstadt.de)\n *  @copyright  Simplified BSD\n *\n *  @cond\n *  This program is free software: you can redistribute it and\/or modify\n *  it under the terms of the FreeBSD license as published by the FreeBSD\n *  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.\n *\n *  You should have received a copy of the FreeBSD license along with this\n *  program. If not, see <http:\/\/www.opensource.org\/licenses\/bsd-license>.\n *  @endcond\n *\/\n\n#include \"umundo\/protoc-rpc\/ServiceGeneratorCPP.h\"\n\n#include <set>\n#include <iostream>\n\n#include <google\/protobuf\/compiler\/plugin.h>\n#include <google\/protobuf\/compiler\/cpp\/cpp_file.h>\n#include <google\/protobuf\/compiler\/cpp\/cpp_helpers.h>\n#include <google\/protobuf\/io\/zero_copy_stream.h>\n#include <google\/protobuf\/descriptor.pb.h>\n\nnamespace umundo {\n\nusing namespace google::protobuf::compiler::cpp;\n\nbool ServiceGeneratorCPP::Generate(const FileDescriptor* file,\n                                   const string& parameter,\n                                   GeneratorContext* generator_context,\n                                   string* error) const {\n\tvector<pair<string, string> > options;\n\tParseGeneratorParameter(parameter, &options);\n\n\tstring dllexport_decl;\n\tfor (size_t i = 0; i < options.size(); i++) {\n\t\tif (options[i].first == \"dllexport_decl\") {\n\t\t\tdllexport_decl = options[i].second;\n\t\t} else {\n\t\t\t*error = \"Unknown generator option: \" + options[i].first;\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tstring basename = StripProto(file->name());\n\tstring filenameID = FilenameIdentifier(file->name());\n\n\t\/\/ Generate header.\n\t{\n\t\tscoped_ptr<io::ZeroCopyOutputStream> output(generator_context->Open(basename + \".rpc.pb.h\"));\n\t\tio::Printer printer(output.get(), '$');\n\n\t\t\/\/ header prolog\n\t\tprinter.Print(\n\t\t    \"\/\/ Generated by the umundo protocol buffer compiler. DO NOT EDIT!\\n\"\n\t\t    \"\/\/ source: $filename$\\n\\n\"\n\t\t    \"#ifndef __PROTOBUF_$filename_identifier$\\n\"\n\t\t    \"#define __PROTOBUF_$filename_identifier$\\n\\n\"\n\t\t    \"#include <umundo\/rpc.h>\\n\"\n\t\t    \"#include \\\"$basename$.pb.h\\\" \/\/ generated by protoc\\n\"\n\t\t    \"#include \\\"$basename$.rpc.pb.h\\\" \/\/ generated by protoc\\n\",\n\n\t\t    \"basename\", basename,\n\t\t    \"filename\", file->name(),\n\t\t    \"filename_identifier\", filenameID);\n\n\t\tif (file->dependency_count() > 0) {\n\t\t\tfor (int i = 0; i < file->dependency_count(); i++) {\n\t\t\t\tconst FileDescriptor* fileDesc = file->dependency(i);\n\t\t\t\tprinter.Print(\"#include \\\"$dependency$.pb.h\\\" \/\/ generated by protoc\\n\", \"dependency\", StripProto(fileDesc->name()));\n\t\t\t}\n\t\t}\n\n\t\tprinter.Print(\"\\n\\nnamespace umundo {\\n\\n\");\n\n\t\tif (file->service_count() > 0) {\n\t\t\tfor (int i = 0; i < file->service_count(); i++) {\n\t\t\t\tconst ServiceDescriptor* svcDesc = file->service(i);\n\t\t\t\twriteServiceStubHeader(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\");\n\t\t\t\twriteServiceHeader(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\\n\");\n\t\t\t}\n\t\t}\n\n\t\t\/\/ header epilog\n\t\tprinter.Print(\n\t\t    \"\\n}\\n\"\n\t\t    \"#endif\\n\");\n\t}\n\n\t\/\/ Generate cc file.\n\t{\n\t\tscoped_ptr<io::ZeroCopyOutputStream> output(generator_context->Open(basename + \".rpc.pb.cc\"));\n\t\tio::Printer printer(output.get(), '$');\n\n\t\tif (file->service_count() > 0) {\n\t\t\t\/\/ implementation prolog\n\t\t\tprinter.Print(\n\t\t\t    \"#include \\\"umundo\/rpc\/Service.h\\\"\\n\"\n\t\t\t    \"#include \\\"umundo\/rpc\/ServiceManager.h\\\"\\n\"\n\t\t\t    \"#include \\\"$basename$.rpc.pb.h\\\"\\n\\n\"\n\t\t\t    \"namespace umundo {\\n\\n\",\n\t\t\t    \"basename\", basename\n\t\t\t);\n\n\t\t\tfor (int i = 0; i < file->service_count(); i++) {\n\t\t\t\tconst ServiceDescriptor* svcDesc = file->service(i);\n\t\t\t\twriteServiceImplConstructor(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\");\n\t\t\t\twriteServiceImplDispatcher(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\");\n\t\t\t\twriteServiceImplCleanUp(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\");\n\t\t\t\twriteServiceStubImpl(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\\n\");\n\t\t\t}\n\t\t}\n\n\t\tif (file->service_count() > 0) {\n\t\t\t\/\/ implementation epilog\n\t\t\tprinter.Print(\"\\n}\\n\");\n\t\t}\n\t}\n\n\treturn true;\n\n}\n\nvoid ServiceGeneratorCPP::writeServiceStubHeader(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\tprinter.Print(\n\t    \"class $svcName$Stub : public ServiceStub {\\n\"\n\t    \"public:\\n\"\n\t    \"\\t$svcName$Stub(ServiceDescription*);\\n\",\n\t    \"svcName\", svcDesc->name()\n\t);\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\"\\t$outType$* $methodName$($inType$*);\\n\",\n\t\t\t              \"inType\", container(methodDesc->input_type())->name(),\n\t\t\t              \"methodName\", methodDesc->name(),\n\t\t\t              \"outType\", container(methodDesc->output_type())->name()\n\t\t\t             );\n\t\t}\n\t}\n\tprinter.Print(\"};\\n\");\n}\n\nvoid ServiceGeneratorCPP::writeServiceHeader(io::Printer &printer, const ServiceDescriptor* svcDesc) const {\n\tprinter.Print(\n\t    \"class $svcName$Base : public Service {\\n\"\n\t    \"public:\\n\"\n\t    \"\\t$svcName$Base();\\n\",\n\t    \"svcName\", svcDesc->name()\n\t);\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\"\\tvirtual $outType$* $methodName$($inType$*) = 0;\\n\",\n\t\t\t              \"inType\", container(methodDesc->input_type())->name(),\n\t\t\t              \"methodName\", methodDesc->name(),\n\t\t\t              \"outType\", container(methodDesc->output_type())->name()\n\t\t\t             );\n\t\t}\n\n\t\tprinter.Print(\n\t\t    \"protected:\\n\"\n\t\t    \"\\tvoid callMethod(string&, void*, const string&, void*&, const string&);\\n\"\n\t\t    \"\\tvoid cleanUpObjects(string&, void*, void*);\\n\"\n\t\t);\n\t}\n\tprinter.Print(\"};\\n\");\n}\n\nconst Descriptor* ServiceGeneratorCPP::container(const Descriptor* desc) {\n\/\/\tfprintf(stderr, \"checking %s\\n\", desc->name().c_str());\n\twhile(desc->containing_type() != NULL) {\n\t\tdesc = desc->containing_type();\n\/\/\t\tfprintf(stderr, \"\\t-> %s\\n\", desc->name().c_str());\n\t}\n\treturn desc;\n}\n\nvoid ServiceGeneratorCPP::writeServiceImplConstructor(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\n\tstd::set<string> inTypes;\n\tstd::set<string> outTypes;\n\tstd::set<string>::iterator inTypeIter;\n\tstd::set<string>::iterator outTypeIter;\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tinTypes.insert(methodDesc->input_type()->name());\n\t\t\toutTypes.insert(methodDesc->output_type()->name());\n\t\t}\n\t}\n\n\tprinter.Print(\n\t    \"$className$Stub::$className$Stub(ServiceDescription* svcDesc) : ServiceStub(svcDesc)  {\\n\"\n\t    \"\\t_serviceName = \\\"$className$\\\";\\n\",\n\t    \"className\", svcDesc->name()\n\t);\n\n\t\/\/ register intypes at publisher for stub, outtypes at subscriber\n\tfor (inTypeIter = inTypes.begin(); inTypeIter != inTypes.end(); inTypeIter++) {\n\t\tprinter.Print(\n\t\t    \"\\t_rpcPub->registerType(\\\"$inType$\\\", new $inType$());\\n\",\n\t\t    \"inType\", (*inTypeIter)\n\t\t);\n\t}\n\tfor (outTypeIter = outTypes.begin(); outTypeIter != outTypes.end(); outTypeIter++) {\n\t\tprinter.Print(\n\t\t    \"\\t_rpcSub->registerType(\\\"$outType$\\\", new $outType$());\\n\",\n\t\t    \"outType\", (*outTypeIter)\n\t\t);\n\t}\n\n\tprinter.Print(\"}\\n\\n\");\n\n\tprinter.Print(\n\t    \"$className$Base::$className$Base() {\\n\"\n\t    \"\\t_serviceName = \\\"$className$\\\";\\n\",\n\t    \"className\", svcDesc->name()\n\t);\n\n\t\/\/ register intypes at sublisher for impl, outtypes at publisher\n\tfor (inTypeIter = inTypes.begin(); inTypeIter != inTypes.end(); inTypeIter++) {\n\t\tprinter.Print(\n\t\t    \"\\t_rpcSub->registerType(\\\"$inType$\\\", new $inType$());\\n\",\n\t\t    \"inType\", (*inTypeIter)\n\t\t);\n\t}\n\tfor (outTypeIter = outTypes.begin(); outTypeIter != outTypes.end(); outTypeIter++) {\n\t\tprinter.Print(\n\t\t    \"\\t_rpcPub->registerType(\\\"$outType$\\\", new $outType$());\\n\",\n\t\t    \"outType\", (*outTypeIter)\n\t\t);\n\t}\n\n\tprinter.Print(\"}\\n\");\n\n}\n\nvoid ServiceGeneratorCPP::writeServiceImplDispatcher(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\n\tprinter.Print(\n\t    \"void $className$Base::callMethod(string& methodName, void* in, const string& inType, void* &out, const string& outType) {\\n\"\n\t    \"\\tif (false) {\\n\",\n\t    \"className\", svcDesc->name()\n\t);\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\n\t\t\t    \"\\t} else if (methodName.compare(\\\"$methodName$\\\") == 0) {\\n\"\n\t\t\t    \"\\t\\tout = (void*)$methodName$(($inType$*)in);\\n\",\n\t\t\t    \"inType\", methodDesc->input_type()->name(),\n\t\t\t    \"methodName\", methodDesc->name()\n\t\t\t);\n\t\t}\n\t}\n\tprinter.Print(\"\\t}\\n}\\n\");\n}\n\nvoid ServiceGeneratorCPP::writeServiceImplCleanUp(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\tprinter.Print(\n\t    \"void $className$Base::cleanUpObjects(string& methodName, void* in, void* out) {\\n\"\n\t    \"\\tif (false) {\\n\",\n\t    \"className\", svcDesc->name()\n\t);\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\n\t\t\t    \"\\t} else if (methodName.compare(\\\"$methodName$\\\") == 0) {\\n\"\n\t\t\t    \"\\t\\tif (in != NULL) delete(($inType$*)in);\\n\"\n\t\t\t    \"\\t\\tif (out != NULL) delete(($outType$*)out);\\n\",\n\t\t\t    \"inType\", methodDesc->input_type()->name(),\n\t\t\t    \"outType\", methodDesc->output_type()->name(),\n\t\t\t    \"methodName\", methodDesc->name()\n\t\t\t);\n\t\t}\n\t}\n\tprinter.Print(\"\\t}\\n}\\n\");\n}\n\nvoid ServiceGeneratorCPP::writeServiceStubImpl(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\n\t\t\t    \"$outType$* $className$Stub\",\n\t\t\t    \"className\", svcDesc->name(),\n\t\t\t    \"outType\", methodDesc->output_type()->name());\n\n\t\t\tprinter.Print(\n\t\t\t    \"::$methodName$($inType$* in) {\\n\"\n\t\t\t    \"\\tvoid* out = NULL;\\n\"\n\t\t\t    \"\\tcallStubMethod(\\\"$methodName$\\\", in, \\\"$inType$\\\", out, \\\"$outType$\\\");\\n\"\n\t\t\t    \"\\treturn ($outType$*)out;\\n\"\n\t\t\t    \"}\\n\",\n\t\t\t    \"inType\", methodDesc->input_type()->name(),\n\t\t\t    \"methodName\", methodDesc->name(),\n\t\t\t    \"outType\", methodDesc->output_type()->name()\n\t\t\t);\n\t\t}\n\t}\n}\n\n}\n\nint main(int argc, char* argv[]) {\n\tumundo::ServiceGeneratorCPP generator;\n\treturn google::protobuf::compiler::PluginMain(argc, argv, &generator);\n}\n<commit_msg>Support for light-weight reflection with services<commit_after>\/**\n *  @file\n *  @author     2012 Stefan Radomski (stefan.radomski@cs.tu-darmstadt.de)\n *  @copyright  Simplified BSD\n *\n *  @cond\n *  This program is free software: you can redistribute it and\/or modify\n *  it under the terms of the FreeBSD license as published by the FreeBSD\n *  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.\n *\n *  You should have received a copy of the FreeBSD license along with this\n *  program. If not, see <http:\/\/www.opensource.org\/licenses\/bsd-license>.\n *  @endcond\n *\/\n\n#include \"umundo\/protoc-rpc\/ServiceGeneratorCPP.h\"\n\n#include <set>\n#include <iostream>\n\n#include <google\/protobuf\/compiler\/plugin.h>\n#include <google\/protobuf\/compiler\/cpp\/cpp_file.h>\n#include <google\/protobuf\/compiler\/cpp\/cpp_helpers.h>\n#include <google\/protobuf\/io\/zero_copy_stream.h>\n#include <google\/protobuf\/descriptor.pb.h>\n\nnamespace umundo {\n\nusing namespace google::protobuf::compiler::cpp;\n\nbool ServiceGeneratorCPP::Generate(const FileDescriptor* file,\n                                   const string& parameter,\n                                   GeneratorContext* generator_context,\n                                   string* error) const {\n\tvector<pair<string, string> > options;\n\tParseGeneratorParameter(parameter, &options);\n\n\tstring dllexport_decl;\n\tfor (size_t i = 0; i < options.size(); i++) {\n\t\tif (options[i].first == \"dllexport_decl\") {\n\t\t\tdllexport_decl = options[i].second;\n\t\t} else {\n\t\t\t*error = \"Unknown generator option: \" + options[i].first;\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tstring basename = StripProto(file->name());\n\tstring filenameID = FilenameIdentifier(file->name());\n\n\t\/\/ Generate header.\n\t{\n\t\tscoped_ptr<io::ZeroCopyOutputStream> output(generator_context->Open(basename + \".rpc.pb.h\"));\n\t\tio::Printer printer(output.get(), '$');\n\n\t\t\/\/ header prolog\n\t\tprinter.Print(\n\t\t    \"\/\/ Generated by the umundo protocol buffer compiler. DO NOT EDIT!\\n\"\n\t\t    \"\/\/ source: $filename$\\n\\n\"\n\t\t    \"#ifndef __PROTOBUF_$filename_identifier$\\n\"\n\t\t    \"#define __PROTOBUF_$filename_identifier$\\n\\n\"\n\t\t    \"#include <umundo\/rpc.h>\\n\"\n\t\t    \"#include \\\"$basename$.pb.h\\\" \/\/ generated by protoc\\n\"\n\t\t    \"#include \\\"$basename$.rpc.pb.h\\\" \/\/ generated by protoc\\n\",\n\n\t\t    \"basename\", basename,\n\t\t    \"filename\", file->name(),\n\t\t    \"filename_identifier\", filenameID);\n\n\t\tif (file->dependency_count() > 0) {\n\t\t\tfor (int i = 0; i < file->dependency_count(); i++) {\n\t\t\t\tconst FileDescriptor* fileDesc = file->dependency(i);\n\t\t\t\tprinter.Print(\"#include \\\"$dependency$.pb.h\\\" \/\/ generated by protoc\\n\", \"dependency\", StripProto(fileDesc->name()));\n\t\t\t}\n\t\t}\n\n\t\tprinter.Print(\"\\n\\nnamespace umundo {\\n\\n\");\n\n\t\tif (file->service_count() > 0) {\n\t\t\tfor (int i = 0; i < file->service_count(); i++) {\n\t\t\t\tconst ServiceDescriptor* svcDesc = file->service(i);\n\t\t\t\twriteServiceStubHeader(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\");\n\t\t\t\twriteServiceHeader(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\\n\");\n\t\t\t}\n\t\t}\n\n\t\t\/\/ header epilog\n\t\tprinter.Print(\n\t\t    \"\\n}\\n\"\n\t\t    \"#endif\\n\");\n\t}\n\n\t\/\/ Generate cc file.\n\t{\n\t\tscoped_ptr<io::ZeroCopyOutputStream> output(generator_context->Open(basename + \".rpc.pb.cc\"));\n\t\tio::Printer printer(output.get(), '$');\n\n\t\tif (file->service_count() > 0) {\n\t\t\t\/\/ implementation prolog\n\t\t\tprinter.Print(\n\t\t\t    \"#include \\\"umundo\/rpc\/Service.h\\\"\\n\"\n\t\t\t    \"#include \\\"umundo\/rpc\/ServiceManager.h\\\"\\n\"\n\t\t\t    \"#include \\\"$basename$.rpc.pb.h\\\"\\n\\n\"\n\t\t\t    \"namespace umundo {\\n\\n\",\n\t\t\t    \"basename\", basename\n\t\t\t);\n\n\t\t\tfor (int i = 0; i < file->service_count(); i++) {\n\t\t\t\tconst ServiceDescriptor* svcDesc = file->service(i);\n\t\t\t\twriteServiceImplConstructor(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\");\n\t\t\t\twriteServiceImplDispatcher(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\");\n\t\t\t\twriteServiceImplCleanUp(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\");\n\t\t\t\twriteServiceStubImpl(printer, svcDesc);\n\t\t\t\tprinter.Print(\"\\n\\n\");\n\t\t\t}\n\t\t}\n\n\t\tif (file->service_count() > 0) {\n\t\t\t\/\/ implementation epilog\n\t\t\tprinter.Print(\"\\n}\\n\");\n\t\t}\n\t}\n\n\treturn true;\n\n}\n\nvoid ServiceGeneratorCPP::writeServiceStubHeader(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\tprinter.Print(\n\t    \"class $svcName$Stub : public ServiceStub {\\n\"\n\t    \"public:\\n\"\n\t    \"\\t$svcName$Stub(ServiceDescription*);\\n\",\n\t    \"svcName\", svcDesc->name()\n\t);\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\"\\t$outType$* $methodName$($inType$*);\\n\",\n\t\t\t              \"inType\", container(methodDesc->input_type())->name(),\n\t\t\t              \"methodName\", methodDesc->name(),\n\t\t\t              \"outType\", container(methodDesc->output_type())->name()\n\t\t\t             );\n\t\t}\n\t}\n\tprinter.Print(\"};\\n\");\n}\n\nvoid ServiceGeneratorCPP::writeServiceHeader(io::Printer &printer, const ServiceDescriptor* svcDesc) const {\n\tprinter.Print(\n\t    \"class $svcName$Base : public Service {\\n\"\n\t    \"public:\\n\"\n\t    \"\\t$svcName$Base();\\n\",\n\t    \"svcName\", svcDesc->name()\n\t);\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\"\\tvirtual $outType$* $methodName$($inType$*) = 0;\\n\",\n\t\t\t              \"inType\", container(methodDesc->input_type())->name(),\n\t\t\t              \"methodName\", methodDesc->name(),\n\t\t\t              \"outType\", container(methodDesc->output_type())->name()\n\t\t\t             );\n\t\t}\n\n\t\tprinter.Print(\n\t\t    \"protected:\\n\"\n\t\t    \"\\tvoid callMethod(string&, void*, string&, void*&, string&);\\n\"\n\t\t    \"\\tvoid cleanUpObjects(string&, void*, void*);\\n\"\n\t\t);\n\t}\n\tprinter.Print(\"};\\n\");\n}\n\nconst Descriptor* ServiceGeneratorCPP::container(const Descriptor* desc) {\n\/\/\tfprintf(stderr, \"checking %s\\n\", desc->name().c_str());\n\twhile(desc->containing_type() != NULL) {\n\t\tdesc = desc->containing_type();\n\/\/\t\tfprintf(stderr, \"\\t-> %s\\n\", desc->name().c_str());\n\t}\n\treturn desc;\n}\n\nvoid ServiceGeneratorCPP::writeServiceImplConstructor(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\n\tstd::set<string> inTypes;\n\tstd::set<string> outTypes;\n\tstd::set<string>::iterator inTypeIter;\n\tstd::set<string>::iterator outTypeIter;\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tinTypes.insert(methodDesc->input_type()->name());\n\t\t\toutTypes.insert(methodDesc->output_type()->name());\n\t\t}\n\t}\n\n\tprinter.Print(\n\t    \"$className$Stub::$className$Stub(ServiceDescription* svcDesc) : ServiceStub(svcDesc)  {\\n\"\n\t    \"\\t_serviceName = \\\"$className$\\\";\\n\",\n\t    \"className\", svcDesc->name()\n\t);\n\n\t\/\/ register intypes at publisher for stub, outtypes at subscriber\n\tfor (inTypeIter = inTypes.begin(); inTypeIter != inTypes.end(); inTypeIter++) {\n\t\tprinter.Print(\n\t\t    \"\\t_rpcPub->registerType(\\\"$inType$\\\", new $inType$());\\n\",\n\t\t    \"inType\", (*inTypeIter)\n\t\t);\n\t}\n\tfor (outTypeIter = outTypes.begin(); outTypeIter != outTypes.end(); outTypeIter++) {\n\t\tprinter.Print(\n\t\t    \"\\t_rpcSub->registerType(\\\"$outType$\\\", new $outType$());\\n\",\n\t\t    \"outType\", (*outTypeIter)\n\t\t);\n\t}\n\n\tprinter.Print(\"}\\n\\n\");\n\n\tprinter.Print(\n\t    \"$className$Base::$className$Base() {\\n\"\n\t    \"\\t_serviceName = \\\"$className$\\\";\\n\",\n\t    \"className\", svcDesc->name()\n\t);\n\n\t\/\/ register intypes at sublisher for impl, outtypes at publisher\n\tfor (inTypeIter = inTypes.begin(); inTypeIter != inTypes.end(); inTypeIter++) {\n\t\tprinter.Print(\n\t\t    \"\\t_rpcSub->registerType(\\\"$inType$\\\", new $inType$());\\n\",\n\t\t    \"inType\", (*inTypeIter)\n\t\t);\n\t}\n\tfor (outTypeIter = outTypes.begin(); outTypeIter != outTypes.end(); outTypeIter++) {\n\t\tprinter.Print(\n\t\t    \"\\t_rpcPub->registerType(\\\"$outType$\\\", new $outType$());\\n\",\n\t\t    \"outType\", (*outTypeIter)\n\t\t);\n\t}\n\n\tprinter.Print(\"}\\n\");\n\n}\n\nvoid ServiceGeneratorCPP::writeServiceImplDispatcher(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\n\tprinter.Print(\n\t    \"void $className$Base::callMethod(string& methodName, void* in, string& inType, void* &out, string& outType) {\\n\"\n\t    \"\\tif (false) {\\n\",\n\t    \"className\", svcDesc->name()\n\t);\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\n\t\t\t    \"\\t} else if (methodName.compare(\\\"$methodName$\\\") == 0) {\\n\"\n\t\t\t    \"\\t\\tif (outType.length() == 0) { outType = \\\"$outType$\\\"; }\\n\"\n\t\t\t    \"\\t\\tif (inType.length() == 0) { inType = \\\"$inType$\\\"; }\\n\"\n\t\t\t    \"\\t\\tout = (void*)$methodName$(($inType$*)in);\\n\",\n\t\t\t    \"outType\", methodDesc->output_type()->name(),\n\t\t\t    \"inType\", methodDesc->input_type()->name(),\n\t\t\t    \"methodName\", methodDesc->name()\n\t\t\t);\n\t\t}\n\t}\n\tprinter.Print(\"\\t}\\n}\\n\");\n}\n\nvoid ServiceGeneratorCPP::writeServiceImplCleanUp(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\tprinter.Print(\n\t    \"void $className$Base::cleanUpObjects(string& methodName, void* in, void* out) {\\n\"\n\t    \"\\tif (false) {\\n\",\n\t    \"className\", svcDesc->name()\n\t);\n\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\n\t\t\t    \"\\t} else if (methodName.compare(\\\"$methodName$\\\") == 0) {\\n\"\n\t\t\t    \"\\t\\tif (in != NULL) delete(($inType$*)in);\\n\"\n\t\t\t    \"\\t\\tif (out != NULL) delete(($outType$*)out);\\n\",\n\t\t\t    \"inType\", methodDesc->input_type()->name(),\n\t\t\t    \"outType\", methodDesc->output_type()->name(),\n\t\t\t    \"methodName\", methodDesc->name()\n\t\t\t);\n\t\t}\n\t}\n\tprinter.Print(\"\\t}\\n}\\n\");\n}\n\nvoid ServiceGeneratorCPP::writeServiceStubImpl(io::Printer& printer, const ServiceDescriptor* svcDesc) const {\n\tif (svcDesc->method_count() > 0) {\n\t\tfor (int i = 0; i < svcDesc->method_count(); i++) {\n\n\t\t\tconst MethodDescriptor* methodDesc = svcDesc->method(i);\n\t\t\tprinter.Print(\n\t\t\t    \"$outType$* $className$Stub\",\n\t\t\t    \"className\", svcDesc->name(),\n\t\t\t    \"outType\", methodDesc->output_type()->name());\n\n\t\t\tprinter.Print(\n\t\t\t    \"::$methodName$($inType$* in) {\\n\"\n\t\t\t    \"\\tvoid* out = NULL;\\n\"\n\t\t\t    \"\\tcallStubMethod(\\\"$methodName$\\\", in, \\\"$inType$\\\", out, \\\"$outType$\\\");\\n\"\n\t\t\t    \"\\treturn ($outType$*)out;\\n\"\n\t\t\t    \"}\\n\",\n\t\t\t    \"inType\", methodDesc->input_type()->name(),\n\t\t\t    \"methodName\", methodDesc->name(),\n\t\t\t    \"outType\", methodDesc->output_type()->name()\n\t\t\t);\n\t\t}\n\t}\n}\n\n}\n\nint main(int argc, char* argv[]) {\n\tumundo::ServiceGeneratorCPP generator;\n\treturn google::protobuf::compiler::PluginMain(argc, argv, &generator);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: colorcfg.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 13:44: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#ifndef INCLUDED_SVTOOLS_COLORCFG_HXX\n#define INCLUDED_SVTOOLS_COLORCFG_HXX\n\n#ifndef INCLUDED_SVTDLLAPI_H\n#include \"svtools\/svtdllapi.h\"\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n#ifndef _SFXBRDCST_HXX\n#include <svtools\/brdcst.hxx>\n#endif\n#ifndef _SFXLSTNER_HXX\n#include <svtools\/lstner.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_OPTIONS_HXX\n#include <svtools\/options.hxx>\n#endif\n\n\/\/-----------------------------------------------------------------------------\nnamespace svtools{\nenum ColorConfigEntry\n{\n    DOCCOLOR            ,\n    DOCBOUNDARIES       ,\n    APPBACKGROUND       ,\n    OBJECTBOUNDARIES    ,\n    TABLEBOUNDARIES     ,\n    FONTCOLOR           ,\n    LINKS               ,\n    LINKSVISITED        ,\n    ANCHOR              ,\n    SPELL         ,\n    SMARTTAGS     ,\n    WRITERTEXTGRID      ,\n    WRITERFIELDSHADINGS ,\n    WRITERIDXSHADINGS         ,\n    WRITERDIRECTCURSOR        ,\n    WRITERNOTESINDICATOR,\n    WRITERSCRIPTINDICATOR,\n    WRITERSECTIONBOUNDARIES,\n    WRITERPAGEBREAKS,\n    HTMLSGML            ,\n    HTMLCOMMENT         ,\n    HTMLKEYWORD         ,\n    HTMLUNKNOWN         ,\n    CALCGRID            ,\n    CALCPAGEBREAK       ,\n    CALCPAGEBREAKMANUAL,\n    CALCPAGEBREAKAUTOMATIC,\n    CALCDETECTIVE       ,\n    CALCDETECTIVEERROR       ,\n    CALCREFERENCE       ,\n    CALCNOTESBACKGROUND     ,\n    DRAWGRID            ,\n    DRAWDRAWING         ,\n    DRAWFILL            ,\n    BASICIDENTIFIER,\n    BASICCOMMENT   ,\n    BASICNUMBER    ,\n    BASICSTRING    ,\n    BASICOPERATOR  ,\n    BASICKEYWORD   ,\n    BASICERROR   ,\n    ColorConfigEntryCount\n};\n\/* -----------------------------22.03.2002 15:36------------------------------\n\n ---------------------------------------------------------------------------*\/\nclass ColorConfig_Impl;\nstruct ColorConfigValue\n{\n\n    sal_Bool    bIsVisible; \/\/validity depends on the element type\n    sal_Int32   nColor;\n    ColorConfigValue() : bIsVisible(sal_False), nColor(0) {}\n    sal_Bool operator !=(const ColorConfigValue& rCmp) const\n        { return nColor != rCmp.nColor || bIsVisible != rCmp.bIsVisible;}\n};\n\/* -----------------------------22.03.2002 15:36------------------------------\n\n ---------------------------------------------------------------------------*\/\nclass SVT_DLLPUBLIC ColorConfig:\n    public svt::detail::Options, public SfxBroadcaster, public SfxListener\n{\n    friend class ColorConfig_Impl;\nprivate:\n    static ColorConfig_Impl* m_pImpl;\npublic:\n    ColorConfig();\n    virtual ~ColorConfig();\n\n    virtual void        Notify( SfxBroadcaster& rBC, const SfxHint& rHint );\n\n    \/\/ get the configured value - if bSmart is set the default color setting is provided\n    \/\/ instead of the automatic color\n    ColorConfigValue        GetColorValue(ColorConfigEntry eEntry, sal_Bool bSmart = sal_True)const;\n\n    static Color            GetDefaultColor(ColorConfigEntry eEntry);\n};\n\/* -----------------------------22.03.2002 15:31------------------------------\n\n ---------------------------------------------------------------------------*\/\nclass SVT_DLLPUBLIC EditableColorConfig\n{\n    ColorConfig_Impl*   m_pImpl;\n    sal_Bool            m_bModified;\npublic:\n    EditableColorConfig();\n    ~EditableColorConfig();\n\n    ::com::sun::star::uno::Sequence< ::rtl::OUString >  GetSchemeNames() const;\n    void                                                DeleteScheme(const ::rtl::OUString& rScheme );\n    void                                                AddScheme(const ::rtl::OUString& rScheme );\n    sal_Bool                                            LoadScheme(const ::rtl::OUString& rScheme );\n    const ::rtl::OUString&                              GetCurrentSchemeName()const;\n    void                        SetCurrentSchemeName(const ::rtl::OUString& rScheme);\n\n    const ColorConfigValue&     GetColorValue(ColorConfigEntry eEntry)const;\n    void                        SetColorValue(ColorConfigEntry eEntry, const ColorConfigValue& rValue);\n    void                        SetModified();\n    void                        ClearModified(){m_bModified = sal_False;}\n    sal_Bool                    IsModified()const{return m_bModified;}\n    void                        Commit();\n\n    void                        DisableBroadcast();\n    void                        EnableBroadcast();\n};\n}\/\/namespace svtools\n#endif\n\n<commit_msg>INTEGRATION: CWS swnotescolor (1.3.154); FILE MERGED 2007\/12\/02 20:54:44 mod 1.3.154.1: remove note color indicator from Options - Appearance<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: colorcfg.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: vg $ $Date: 2008-03-18 16:43: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 INCLUDED_SVTOOLS_COLORCFG_HXX\n#define INCLUDED_SVTOOLS_COLORCFG_HXX\n\n#ifndef INCLUDED_SVTDLLAPI_H\n#include \"svtools\/svtdllapi.h\"\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n#ifndef _SFXBRDCST_HXX\n#include <svtools\/brdcst.hxx>\n#endif\n#ifndef _SFXLSTNER_HXX\n#include <svtools\/lstner.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_OPTIONS_HXX\n#include <svtools\/options.hxx>\n#endif\n\n\/\/-----------------------------------------------------------------------------\nnamespace svtools{\nenum ColorConfigEntry\n{\n    DOCCOLOR            ,\n    DOCBOUNDARIES       ,\n    APPBACKGROUND       ,\n    OBJECTBOUNDARIES    ,\n    TABLEBOUNDARIES     ,\n    FONTCOLOR           ,\n    LINKS               ,\n    LINKSVISITED        ,\n    ANCHOR              ,\n    SPELL         ,\n    SMARTTAGS     ,\n    WRITERTEXTGRID      ,\n    WRITERFIELDSHADINGS ,\n    WRITERIDXSHADINGS         ,\n    WRITERDIRECTCURSOR        ,\n    WRITERSCRIPTINDICATOR,\n    WRITERSECTIONBOUNDARIES,\n    WRITERPAGEBREAKS,\n    HTMLSGML            ,\n    HTMLCOMMENT         ,\n    HTMLKEYWORD         ,\n    HTMLUNKNOWN         ,\n    CALCGRID            ,\n    CALCPAGEBREAK       ,\n    CALCPAGEBREAKMANUAL,\n    CALCPAGEBREAKAUTOMATIC,\n    CALCDETECTIVE       ,\n    CALCDETECTIVEERROR       ,\n    CALCREFERENCE       ,\n    CALCNOTESBACKGROUND     ,\n    DRAWGRID            ,\n    DRAWDRAWING         ,\n    DRAWFILL            ,\n    BASICIDENTIFIER,\n    BASICCOMMENT   ,\n    BASICNUMBER    ,\n    BASICSTRING    ,\n    BASICOPERATOR  ,\n    BASICKEYWORD   ,\n    BASICERROR   ,\n    ColorConfigEntryCount\n};\n\/* -----------------------------22.03.2002 15:36------------------------------\n\n ---------------------------------------------------------------------------*\/\nclass ColorConfig_Impl;\nstruct ColorConfigValue\n{\n\n    sal_Bool    bIsVisible; \/\/validity depends on the element type\n    sal_Int32   nColor;\n    ColorConfigValue() : bIsVisible(sal_False), nColor(0) {}\n    sal_Bool operator !=(const ColorConfigValue& rCmp) const\n        { return nColor != rCmp.nColor || bIsVisible != rCmp.bIsVisible;}\n};\n\/* -----------------------------22.03.2002 15:36------------------------------\n\n ---------------------------------------------------------------------------*\/\nclass SVT_DLLPUBLIC ColorConfig:\n    public svt::detail::Options, public SfxBroadcaster, public SfxListener\n{\n    friend class ColorConfig_Impl;\nprivate:\n    static ColorConfig_Impl* m_pImpl;\npublic:\n    ColorConfig();\n    virtual ~ColorConfig();\n\n    virtual void        Notify( SfxBroadcaster& rBC, const SfxHint& rHint );\n\n    \/\/ get the configured value - if bSmart is set the default color setting is provided\n    \/\/ instead of the automatic color\n    ColorConfigValue        GetColorValue(ColorConfigEntry eEntry, sal_Bool bSmart = sal_True)const;\n\n    static Color            GetDefaultColor(ColorConfigEntry eEntry);\n};\n\/* -----------------------------22.03.2002 15:31------------------------------\n\n ---------------------------------------------------------------------------*\/\nclass SVT_DLLPUBLIC EditableColorConfig\n{\n    ColorConfig_Impl*   m_pImpl;\n    sal_Bool            m_bModified;\npublic:\n    EditableColorConfig();\n    ~EditableColorConfig();\n\n    ::com::sun::star::uno::Sequence< ::rtl::OUString >  GetSchemeNames() const;\n    void                                                DeleteScheme(const ::rtl::OUString& rScheme );\n    void                                                AddScheme(const ::rtl::OUString& rScheme );\n    sal_Bool                                            LoadScheme(const ::rtl::OUString& rScheme );\n    const ::rtl::OUString&                              GetCurrentSchemeName()const;\n    void                        SetCurrentSchemeName(const ::rtl::OUString& rScheme);\n\n    const ColorConfigValue&     GetColorValue(ColorConfigEntry eEntry)const;\n    void                        SetColorValue(ColorConfigEntry eEntry, const ColorConfigValue& rValue);\n    void                        SetModified();\n    void                        ClearModified(){m_bModified = sal_False;}\n    sal_Bool                    IsModified()const{return m_bModified;}\n    void                        Commit();\n\n    void                        DisableBroadcast();\n    void                        EnableBroadcast();\n};\n}\/\/namespace svtools\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>WaE: compare unsigned values.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#50139 do not cut first character of field text<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fedesc.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2006-08-14 16:15:01 $\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#pragma hdrstop\n\n#ifndef _HINTIDS_HXX\n#include <hintids.hxx>\n#endif\n\n#ifndef _REF_HXX\n#include <tools\/ref.hxx>\n#endif\n\n#ifndef _FESH_HXX\n#include <fesh.hxx>\n#endif\n#ifndef _DOC_HXX\n#include <doc.hxx>\n#endif\n#ifndef _PAGEFRM_HXX\n#include <pagefrm.hxx>\n#endif\n#ifndef _ROOTFRM_HXX\n#include <rootfrm.hxx>\n#endif\n#ifndef _CNTFRM_HXX\n#include <cntfrm.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n#ifndef _FMTPDSC_HXX \/\/autogen\n#include <fmtpdsc.hxx>\n#endif\n#ifndef _PAGEDESC_HXX\n#include <pagedesc.hxx>\n#endif\n#ifndef _TABFRM_HXX\n#include <tabfrm.hxx>\n#endif\n#ifndef _EDIMP_HXX\n#include <edimp.hxx>\n#endif\n#ifndef _SWSTYLENAMEMAPPER_HXX\n#include <SwStyleNameMapper.hxx>\n#endif\n\/*************************************************************************\n|*\n|*  SwFEShell::GetPageDescCnt()\n|*\n|*  Ersterstellung      MA 25. Jan. 93\n|*  Letzte Aenderung    MA 25. Jan. 93\n|*\n|*************************************************************************\/\n\nUSHORT SwFEShell::GetPageDescCnt() const\n{\n    return GetDoc()->GetPageDescCnt();\n}\n\n\/*************************************************************************\n|*\n|*  SwFEShell::ChgCurPageDesc()\n|*\n|*  Ersterstellung      ST ??\n|*  Letzte Aenderung    MA 01. Aug. 94\n|*\n|*************************************************************************\/\n\nvoid SwFEShell::ChgCurPageDesc( const SwPageDesc& rDesc )\n{\n#ifndef PRODUCT\n    \/\/Die SS veraendert keinen PageDesc, sondern setzt nur das Attribut.\n    \/\/Der Pagedesc muss im Dokument vorhanden sein!\n    BOOL bFound = FALSE;\n    for ( USHORT nTst = 0; nTst < GetPageDescCnt(); ++nTst )\n        if ( &rDesc == &GetPageDesc( nTst ) )\n            bFound = TRUE;\n    ASSERT( bFound, \"ChgCurPageDesc mit ungueltigem Descriptor.\" );\n#endif\n\n    StartAllAction();\n\n    SwPageFrm *pPage = GetCurrFrm()->FindPageFrm();\n    const SwFrm *pFlow;\n    USHORT nPageNmOffset = 0;\n\n    ASSERT( !GetCrsr()->HasMark(), \"ChgCurPageDesc nur ohne Selektion!\");\n\n    SET_CURR_SHELL( this );\n    while ( pPage )\n    {\n        pFlow = pPage->FindFirstBodyCntnt();\n        if ( pFlow )\n        {\n            if ( pFlow->IsInTab() )\n                pFlow = pFlow->FindTabFrm();\n            const SwFmtPageDesc& rPgDesc = pFlow->GetAttrSet()->GetPageDesc();\n            if( rPgDesc.GetPageDesc() )\n            {\n                \/\/ wir haben ihn den Schlingel\n                nPageNmOffset = rPgDesc.GetNumOffset();\n                break;\n            }\n        }\n        pPage = (SwPageFrm*) pPage->GetPrev();\n    }\n    if ( !pPage )\n    {\n        pPage = (SwPageFrm*) (GetLayout()->Lower());\n        pFlow = pPage->FindFirstBodyCntnt();\n        if ( !pFlow )\n        {\n            pPage   = (SwPageFrm*)pPage->GetNext();\n            pFlow = pPage->FindFirstBodyCntnt();\n            ASSERT( pFlow, \"Dokuemnt ohne Inhalt?!?\" );\n        }\n    }\n\n    \/\/ Seitennummer mitnehmen\n    SwFmtPageDesc aNew( &rDesc );\n    aNew.SetNumOffset( nPageNmOffset );\n\n    if ( pFlow->IsInTab() )\n        GetDoc()->SetAttr( aNew, *(SwFmt*)pFlow->FindTabFrm()->GetFmt() );\n    else\n    {\n        SwPaM aPaM( *((SwCntntFrm*)pFlow)->GetNode() );\n        GetDoc()->Insert( aPaM, aNew, 0 );\n    }\n    EndAllActionAndCall();\n}\n\n\/*************************************************************************\n|*\n|*  SwFEShell::ChgPageDesc()\n|*\n|*  Ersterstellung      MA 25. Jan. 93\n|*  Letzte Aenderung    MA 24. Jan. 95\n|*\n|*************************************************************************\/\n\nvoid SwFEShell::ChgPageDesc( USHORT i, const SwPageDesc &rChged )\n{\n    StartAllAction();\n    SET_CURR_SHELL( this );\n    \/\/Fix i64842: because Undo has a very special way to handle header\/footer content\n    \/\/ we have to copy the page descriptor before calling ChgPageDesc.\n    const sal_Bool bDoesUndo( GetDoc()->DoesUndo() );\n    SwPageDesc aDesc( rChged );\n    GetDoc()->DoUndo( sal_False );\n    GetDoc()->CopyPageDesc(rChged, aDesc);\n    GetDoc()->DoUndo( bDoesUndo );\n    GetDoc()->ChgPageDesc( i, aDesc );\n    EndAllActionAndCall();\n}\n\n\/*************************************************************************\n|*\n|*  SwFEShell::GetPageDesc(), GetCurPageDesc()\n|*\n|*  Ersterstellung      MA 25. Jan. 93\n|*  Letzte Aenderung    MA 23. Apr. 93\n|\n|*************************************************************************\/\n\nconst SwPageDesc& SwFEShell::GetPageDesc( USHORT i ) const\n{\n    return const_cast<const SwDoc *>(GetDoc())->GetPageDesc( i );\n}\n\nSwPageDesc* SwFEShell::FindPageDescByName( const String& rName,\n                                            BOOL bGetFromPool,\n                                            USHORT* pPos )\n{\n    SwPageDesc* pDesc = GetDoc()->FindPageDescByName( rName, pPos );\n    if( !pDesc && bGetFromPool )\n    {\n        USHORT nPoolId = SwStyleNameMapper::GetPoolIdFromUIName( rName, GET_POOLID_PAGEDESC );\n        if( USHRT_MAX != nPoolId &&\n            0 != (pDesc = GetDoc()->GetPageDescFromPool( nPoolId ))\n            && pPos )\n                \/\/ werden immer hinten angehaengt\n            *pPos = GetDoc()->GetPageDescCnt() - 1 ;\n    }\n    return pDesc;\n}\n\nUSHORT SwFEShell::GetMousePageDesc( const Point &rPt ) const\n{\n    if( GetLayout() )\n    {\n        const SwPageFrm* pPage =\n            static_cast<const SwPageFrm*>( GetLayout()->Lower() );\n        if( pPage )\n        {\n            while( pPage->GetNext() && rPt.Y() > pPage->Frm().Bottom() )\n                pPage = static_cast<const SwPageFrm*>( pPage->GetNext() );\n            SwDoc *pDoc = GetDoc();\n            for ( USHORT i = 0; i < GetDoc()->GetPageDescCnt(); ++i )\n            {\n                if ( pPage->GetPageDesc() == &const_cast<const SwDoc *>(pDoc)\n                     ->GetPageDesc(i) )\n                    return i;\n            }\n        }\n    }\n    return 0;\n}\n\nUSHORT SwFEShell::GetCurPageDesc( const BOOL bCalcFrm ) const\n{\n    const SwFrm *pFrm = GetCurrFrm( bCalcFrm );\n    if ( pFrm )\n    {\n        const SwPageFrm *pPage = pFrm->FindPageFrm();\n        if ( pPage )\n        {\n            SwDoc *pDoc = GetDoc();\n            for ( USHORT i = 0; i < GetDoc()->GetPageDescCnt(); ++i )\n            {\n                if ( pPage->GetPageDesc() == &const_cast<const SwDoc *>(pDoc)\n                     ->GetPageDesc(i) )\n                    return i;\n            }\n        }\n    }\n    return 0;\n}\n\n\/\/ if inside all selection only one PageDesc, return this.\n\/\/ Otherwise return 0 pointer\nconst SwPageDesc* SwFEShell::GetSelectedPageDescs() const\n{\n    const SwCntntNode* pCNd;\n    const SwFrm* pMkFrm, *pPtFrm;\n    const SwPageDesc* pFnd, *pRetDesc = (SwPageDesc*)0xffffffff;\n    const Point aNulPt;\n\n    FOREACHPAM_START(this)\n\n        if( 0 != (pCNd = PCURCRSR->GetCntntNode() ) &&\n            0 != ( pPtFrm = pCNd->GetFrm( &aNulPt, 0, FALSE )) )\n            pPtFrm = pPtFrm->FindPageFrm();\n        else\n            pPtFrm = 0;\n\n        if( PCURCRSR->HasMark() &&\n            0 != (pCNd = PCURCRSR->GetCntntNode( FALSE ) ) &&\n            0 != ( pMkFrm = pCNd->GetFrm( &aNulPt, 0, FALSE )) )\n            pMkFrm = pMkFrm->FindPageFrm();\n        else\n            pMkFrm = pPtFrm;\n\n\n        if( !pMkFrm || !pPtFrm )\n            pFnd = 0;\n        else if( pMkFrm == pPtFrm )\n            pFnd = ((SwPageFrm*)pMkFrm)->GetPageDesc();\n        else\n        {\n            \/\/ swap pointer if PtFrm before MkFrm\n            if( ((SwPageFrm*)pMkFrm)->GetPhyPageNum() >\n                ((SwPageFrm*)pPtFrm)->GetPhyPageNum() )\n            {\n                const SwFrm* pTmp = pMkFrm; pMkFrm = pPtFrm; pPtFrm = pTmp;\n            }\n\n            \/\/ now check from MkFrm to PtFrm for equal PageDescs\n            pFnd = ((SwPageFrm*)pMkFrm)->GetPageDesc();\n            while( pFnd && pMkFrm != pPtFrm )\n            {\n                pMkFrm = pMkFrm->GetNext();\n                if( !pMkFrm || pFnd != ((SwPageFrm*)pMkFrm)->GetPageDesc() )\n                    pFnd = 0;\n            }\n        }\n\n        if( (SwPageDesc*)0xffffffff == pRetDesc )\n            pRetDesc = pFnd;\n        else if( pFnd != pRetDesc )\n        {\n            pRetDesc = 0;\n            break;\n        }\n\n    FOREACHPAM_END()\n\n    return pRetDesc;\n}\n\n\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.8.2); FILE MERGED 2006\/09\/01 17:51:43 kaib 1.8.2.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fedesc.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 21:13: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_sw.hxx\"\n\n\n#ifndef _HINTIDS_HXX\n#include <hintids.hxx>\n#endif\n\n#ifndef _REF_HXX\n#include <tools\/ref.hxx>\n#endif\n\n#ifndef _FESH_HXX\n#include <fesh.hxx>\n#endif\n#ifndef _DOC_HXX\n#include <doc.hxx>\n#endif\n#ifndef _PAGEFRM_HXX\n#include <pagefrm.hxx>\n#endif\n#ifndef _ROOTFRM_HXX\n#include <rootfrm.hxx>\n#endif\n#ifndef _CNTFRM_HXX\n#include <cntfrm.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n#ifndef _FMTPDSC_HXX \/\/autogen\n#include <fmtpdsc.hxx>\n#endif\n#ifndef _PAGEDESC_HXX\n#include <pagedesc.hxx>\n#endif\n#ifndef _TABFRM_HXX\n#include <tabfrm.hxx>\n#endif\n#ifndef _EDIMP_HXX\n#include <edimp.hxx>\n#endif\n#ifndef _SWSTYLENAMEMAPPER_HXX\n#include <SwStyleNameMapper.hxx>\n#endif\n\/*************************************************************************\n|*\n|*  SwFEShell::GetPageDescCnt()\n|*\n|*  Ersterstellung      MA 25. Jan. 93\n|*  Letzte Aenderung    MA 25. Jan. 93\n|*\n|*************************************************************************\/\n\nUSHORT SwFEShell::GetPageDescCnt() const\n{\n    return GetDoc()->GetPageDescCnt();\n}\n\n\/*************************************************************************\n|*\n|*  SwFEShell::ChgCurPageDesc()\n|*\n|*  Ersterstellung      ST ??\n|*  Letzte Aenderung    MA 01. Aug. 94\n|*\n|*************************************************************************\/\n\nvoid SwFEShell::ChgCurPageDesc( const SwPageDesc& rDesc )\n{\n#ifndef PRODUCT\n    \/\/Die SS veraendert keinen PageDesc, sondern setzt nur das Attribut.\n    \/\/Der Pagedesc muss im Dokument vorhanden sein!\n    BOOL bFound = FALSE;\n    for ( USHORT nTst = 0; nTst < GetPageDescCnt(); ++nTst )\n        if ( &rDesc == &GetPageDesc( nTst ) )\n            bFound = TRUE;\n    ASSERT( bFound, \"ChgCurPageDesc mit ungueltigem Descriptor.\" );\n#endif\n\n    StartAllAction();\n\n    SwPageFrm *pPage = GetCurrFrm()->FindPageFrm();\n    const SwFrm *pFlow;\n    USHORT nPageNmOffset = 0;\n\n    ASSERT( !GetCrsr()->HasMark(), \"ChgCurPageDesc nur ohne Selektion!\");\n\n    SET_CURR_SHELL( this );\n    while ( pPage )\n    {\n        pFlow = pPage->FindFirstBodyCntnt();\n        if ( pFlow )\n        {\n            if ( pFlow->IsInTab() )\n                pFlow = pFlow->FindTabFrm();\n            const SwFmtPageDesc& rPgDesc = pFlow->GetAttrSet()->GetPageDesc();\n            if( rPgDesc.GetPageDesc() )\n            {\n                \/\/ wir haben ihn den Schlingel\n                nPageNmOffset = rPgDesc.GetNumOffset();\n                break;\n            }\n        }\n        pPage = (SwPageFrm*) pPage->GetPrev();\n    }\n    if ( !pPage )\n    {\n        pPage = (SwPageFrm*) (GetLayout()->Lower());\n        pFlow = pPage->FindFirstBodyCntnt();\n        if ( !pFlow )\n        {\n            pPage   = (SwPageFrm*)pPage->GetNext();\n            pFlow = pPage->FindFirstBodyCntnt();\n            ASSERT( pFlow, \"Dokuemnt ohne Inhalt?!?\" );\n        }\n    }\n\n    \/\/ Seitennummer mitnehmen\n    SwFmtPageDesc aNew( &rDesc );\n    aNew.SetNumOffset( nPageNmOffset );\n\n    if ( pFlow->IsInTab() )\n        GetDoc()->SetAttr( aNew, *(SwFmt*)pFlow->FindTabFrm()->GetFmt() );\n    else\n    {\n        SwPaM aPaM( *((SwCntntFrm*)pFlow)->GetNode() );\n        GetDoc()->Insert( aPaM, aNew, 0 );\n    }\n    EndAllActionAndCall();\n}\n\n\/*************************************************************************\n|*\n|*  SwFEShell::ChgPageDesc()\n|*\n|*  Ersterstellung      MA 25. Jan. 93\n|*  Letzte Aenderung    MA 24. Jan. 95\n|*\n|*************************************************************************\/\n\nvoid SwFEShell::ChgPageDesc( USHORT i, const SwPageDesc &rChged )\n{\n    StartAllAction();\n    SET_CURR_SHELL( this );\n    \/\/Fix i64842: because Undo has a very special way to handle header\/footer content\n    \/\/ we have to copy the page descriptor before calling ChgPageDesc.\n    const sal_Bool bDoesUndo( GetDoc()->DoesUndo() );\n    SwPageDesc aDesc( rChged );\n    GetDoc()->DoUndo( sal_False );\n    GetDoc()->CopyPageDesc(rChged, aDesc);\n    GetDoc()->DoUndo( bDoesUndo );\n    GetDoc()->ChgPageDesc( i, aDesc );\n    EndAllActionAndCall();\n}\n\n\/*************************************************************************\n|*\n|*  SwFEShell::GetPageDesc(), GetCurPageDesc()\n|*\n|*  Ersterstellung      MA 25. Jan. 93\n|*  Letzte Aenderung    MA 23. Apr. 93\n|\n|*************************************************************************\/\n\nconst SwPageDesc& SwFEShell::GetPageDesc( USHORT i ) const\n{\n    return const_cast<const SwDoc *>(GetDoc())->GetPageDesc( i );\n}\n\nSwPageDesc* SwFEShell::FindPageDescByName( const String& rName,\n                                            BOOL bGetFromPool,\n                                            USHORT* pPos )\n{\n    SwPageDesc* pDesc = GetDoc()->FindPageDescByName( rName, pPos );\n    if( !pDesc && bGetFromPool )\n    {\n        USHORT nPoolId = SwStyleNameMapper::GetPoolIdFromUIName( rName, GET_POOLID_PAGEDESC );\n        if( USHRT_MAX != nPoolId &&\n            0 != (pDesc = GetDoc()->GetPageDescFromPool( nPoolId ))\n            && pPos )\n                \/\/ werden immer hinten angehaengt\n            *pPos = GetDoc()->GetPageDescCnt() - 1 ;\n    }\n    return pDesc;\n}\n\nUSHORT SwFEShell::GetMousePageDesc( const Point &rPt ) const\n{\n    if( GetLayout() )\n    {\n        const SwPageFrm* pPage =\n            static_cast<const SwPageFrm*>( GetLayout()->Lower() );\n        if( pPage )\n        {\n            while( pPage->GetNext() && rPt.Y() > pPage->Frm().Bottom() )\n                pPage = static_cast<const SwPageFrm*>( pPage->GetNext() );\n            SwDoc *pDoc = GetDoc();\n            for ( USHORT i = 0; i < GetDoc()->GetPageDescCnt(); ++i )\n            {\n                if ( pPage->GetPageDesc() == &const_cast<const SwDoc *>(pDoc)\n                     ->GetPageDesc(i) )\n                    return i;\n            }\n        }\n    }\n    return 0;\n}\n\nUSHORT SwFEShell::GetCurPageDesc( const BOOL bCalcFrm ) const\n{\n    const SwFrm *pFrm = GetCurrFrm( bCalcFrm );\n    if ( pFrm )\n    {\n        const SwPageFrm *pPage = pFrm->FindPageFrm();\n        if ( pPage )\n        {\n            SwDoc *pDoc = GetDoc();\n            for ( USHORT i = 0; i < GetDoc()->GetPageDescCnt(); ++i )\n            {\n                if ( pPage->GetPageDesc() == &const_cast<const SwDoc *>(pDoc)\n                     ->GetPageDesc(i) )\n                    return i;\n            }\n        }\n    }\n    return 0;\n}\n\n\/\/ if inside all selection only one PageDesc, return this.\n\/\/ Otherwise return 0 pointer\nconst SwPageDesc* SwFEShell::GetSelectedPageDescs() const\n{\n    const SwCntntNode* pCNd;\n    const SwFrm* pMkFrm, *pPtFrm;\n    const SwPageDesc* pFnd, *pRetDesc = (SwPageDesc*)0xffffffff;\n    const Point aNulPt;\n\n    FOREACHPAM_START(this)\n\n        if( 0 != (pCNd = PCURCRSR->GetCntntNode() ) &&\n            0 != ( pPtFrm = pCNd->GetFrm( &aNulPt, 0, FALSE )) )\n            pPtFrm = pPtFrm->FindPageFrm();\n        else\n            pPtFrm = 0;\n\n        if( PCURCRSR->HasMark() &&\n            0 != (pCNd = PCURCRSR->GetCntntNode( FALSE ) ) &&\n            0 != ( pMkFrm = pCNd->GetFrm( &aNulPt, 0, FALSE )) )\n            pMkFrm = pMkFrm->FindPageFrm();\n        else\n            pMkFrm = pPtFrm;\n\n\n        if( !pMkFrm || !pPtFrm )\n            pFnd = 0;\n        else if( pMkFrm == pPtFrm )\n            pFnd = ((SwPageFrm*)pMkFrm)->GetPageDesc();\n        else\n        {\n            \/\/ swap pointer if PtFrm before MkFrm\n            if( ((SwPageFrm*)pMkFrm)->GetPhyPageNum() >\n                ((SwPageFrm*)pPtFrm)->GetPhyPageNum() )\n            {\n                const SwFrm* pTmp = pMkFrm; pMkFrm = pPtFrm; pPtFrm = pTmp;\n            }\n\n            \/\/ now check from MkFrm to PtFrm for equal PageDescs\n            pFnd = ((SwPageFrm*)pMkFrm)->GetPageDesc();\n            while( pFnd && pMkFrm != pPtFrm )\n            {\n                pMkFrm = pMkFrm->GetNext();\n                if( !pMkFrm || pFnd != ((SwPageFrm*)pMkFrm)->GetPageDesc() )\n                    pFnd = 0;\n            }\n        }\n\n        if( (SwPageDesc*)0xffffffff == pRetDesc )\n            pRetDesc = pFnd;\n        else if( pFnd != pRetDesc )\n        {\n            pRetDesc = 0;\n            break;\n        }\n\n    FOREACHPAM_END()\n\n    return pRetDesc;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>tdf#89007: Fix ShouldRowKeepWithNext condition<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity#708516 Uninitialized scalar field<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>these SwScrollbar::IsVisible(false) calls does not make sense to me...<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef VIENNAGRID_TOPOLOGIC_DOMAIN_HPP\n#define VIENNAGRID_TOPOLOGIC_DOMAIN_HPP\n\n\/* =======================================================================\n   Copyright (c) 2011-2012, Institute for Microelectronics,\n                            Institute for Analysis and Scientific Computing,\n                            TU Wien.\n\n                            -----------------\n                     ViennaGrid - The Vienna Grid Library\n                            -----------------\n\n   Authors:      Karl Rupp                           rupp@iue.tuwien.ac.at\n                 Josef Weinbub                    weinbub@iue.tuwien.ac.at\n               \n   (A list of additional contributors can be found in the PDF manual)\n\n   License:      MIT (X11), see file LICENSE in the base directory\n======================================================================= *\/\n\n\nnamespace viennagrid\n{\n    namespace result_of\n    {\n        template<typename topologic_domain_config, typename typemap>\n        struct continuous_id_generator_config_from_domain_config_helper;\n        \n        \n        template<typename topologic_domain_config, typename element_tag, typename element_config, typename tail>\n        struct continuous_id_generator_config_from_domain_config_helper< topologic_domain_config, viennameta::typelist_t<viennameta::static_pair<element_tag, element_config>, tail> >\n        {\n            typedef typename viennameta::typemap::result_of::insert<\n                typename continuous_id_generator_config_from_domain_config_helper<topologic_domain_config, tail>::type,\n                viennameta::static_pair<\n                    typename viennagrid::result_of::element<topologic_domain_config, element_tag>::type,\n                    typename viennagrid::result_of::element_id_tag<topologic_domain_config, element_tag>::type\n                >\n            >::type type;\n        };\n        \n        template<typename topologic_domain_config>\n        struct continuous_id_generator_config_from_domain_config_helper<topologic_domain_config, viennameta::null_type>\n        {\n            typedef viennameta::null_type type;\n        };\n        \n        \n        template<typename topologic_domain_config>\n        struct continuous_id_generator_config_from_domain_config\n        {\n            typedef typename continuous_id_generator_config_from_domain_config_helper<topologic_domain_config, topologic_domain_config>::type type;\n        };\n    }\n}\n\n\nnamespace viennagrid\n{\n\n    template<typename topologic_domain_config_>\n    class topologic_domain_t\n    {\n    public:\n        typedef topologic_domain_config_ topologic_domain_config;\n        typedef typename viennagrid::result_of::element_container_typemap<topologic_domain_config>::type element_container_typelist;\n        typedef typename viennagrid::storage::result_of::collection< element_container_typelist >::type domain_container_collection_type;\n        \n        typedef typename viennagrid::result_of::continuous_id_generator_config_from_domain_config<topologic_domain_config>::type id_generator_config;\n        typedef typename viennagrid::storage::result_of::continuous_id_generator< id_generator_config >::type id_generator_type;\n        typedef typename viennagrid::storage::result_of::physical_inserter<domain_container_collection_type, id_generator_type&>::type inserter_type;\n        \n        \n        topologic_domain_t() : id_generator(), container_collection(), inserter(container_collection, id_generator) {}\n        \n        \n        \n        \n        domain_container_collection_type & get_container_collection() { return container_collection; }\n        const domain_container_collection_type & get_container_collection() const { return container_collection; }\n        \n        inserter_type & get_inserter() { return inserter; }\n        \n    protected:\n        id_generator_type id_generator;\n        domain_container_collection_type container_collection;\n        inserter_type inserter;\n    };\n}\n\n\nnamespace viennagrid\n{\n    \n    namespace result_of\n    {\n        template<typename something>\n        struct topologic_domain;\n        \n        \n        \/\/ topologic domain type from config\n        \n        template<typename key_type, typename value_type, typename tail>\n        struct topologic_domain< viennameta::typelist_t< viennameta::static_pair<key_type, value_type>, tail > >\n        {\n            typedef topologic_domain_t< viennameta::typelist_t< viennameta::static_pair<key_type, value_type>, tail > > type;\n        };\n        \n        \/\/ identity meta functor\n        \n        template<typename topologic_domain_config>\n        struct topologic_domain< topologic_domain_t<topologic_domain_config> >\n        {\n            typedef topologic_domain_t<topologic_domain_config> type;\n        };\n        \n        \n        \n        template<typename something>\n        struct container_collection;\n        \n        template<typename typemap>\n        struct container_collection< storage::collection_t<typemap> >\n        {\n            typedef storage::collection_t<typemap> type;\n        };\n        \n        \n        template<typename topologic_domain_config>\n        struct container_collection< topologic_domain_t<topologic_domain_config> >\n        {\n            typedef typename topologic_domain_t<topologic_domain_config>::domain_container_collection_type type;\n        };\n    }\n    \n    \n    \n    template<typename topologic_domain_config>\n    topologic_domain_t<topologic_domain_config> & topologic_domain( topologic_domain_t<topologic_domain_config> & domain) { return domain; }\n    \n    template<typename topologic_domain_config>\n    const topologic_domain_t<topologic_domain_config> & topologic_domain( const topologic_domain_t<topologic_domain_config> & domain) { return domain; }\n    \n    template<typename domain_type>\n    typename result_of::container_collection< domain_type >::type & container_collection( domain_type & domain)\n    { return topologic_domain(domain).get_container_collection(); }\n\n    template<typename domain_type>\n    const typename result_of::container_collection< domain_type >::type & container_collection( const domain_type & domain)\n    { return topologic_domain(domain).get_container_collection(); }\n\n\n    template<typename domain_type>\n    typename result_of::topologic_domain<domain_type>::type::inserter_type & inserter(domain_type & domain)\n    { return topologic_domain(domain).get_inserter(); }\n    \n    \n    template<typename domain_type, typename hook_type>\n    typename storage::hook::value_type<hook_type>::type & dereference_hook( domain_type & domain, const hook_type & hook)\n    {\n        typedef typename storage::hook::value_type<hook_type>::type value_type;\n        return storage::collection::get<value_type>(container_collection(domain)).dereference_hook( hook );\n    }\n    \n    template<typename domain_type, typename hook_type>\n    const typename storage::hook::value_type<hook_type>::type & dereference_hook( const domain_type & domain, const hook_type & hook)\n    {\n        typedef typename storage::hook::value_type<hook_type>::type value_type;\n        return storage::collection::get<value_type>(container_collection(domain)).dereference_hook( hook );\n    }\n}\n\n\n\nnamespace viennagrid\n{\n    \n    namespace result_of\n    {\n        \n        template<typename domain_config, typename element_tag>\n        struct element< topologic_domain_t<domain_config>, element_tag >\n        {\n            typedef typename element<domain_config, element_tag>::type type;\n        };\n        \n        template<typename domain_config, typename element_tag>\n        struct element_hook<topologic_domain_t<domain_config>, element_tag>\n        {\n            typedef typename element_container<domain_config, element_tag>::type::hook_type type;\n        };\n        \n        template<typename domain_config, long dim>\n        struct ncell< topologic_domain_t<domain_config>, dim >\n        {\n            typedef typename ncell<domain_config, dim>::type type;\n        };\n        \n        template<typename domain_config, long dim>\n        struct ncell_hook< topologic_domain_t<domain_config>, dim >\n        {\n            typedef typename ncell<domain_config, dim>::type element_type;\n            typedef typename element_container<domain_config, typename element_type::tag>::type::hook_type type;\n        };\n        \n        template<typename domain_config, long dim>\n        struct ncell_range< topologic_domain_t<domain_config>, dim >\n        {\n            typedef viennagrid::storage::container_range_wrapper<\n                typename viennagrid::storage::result_of::container_of<\n                    typename topologic_domain_t<domain_config>::domain_container_collection_type,\n                    typename ncell<topologic_domain_t<domain_config>, dim>::type\n                >::type\n            > type;\n        };\n        \n        template<typename domain_config, long dim>\n        struct const_ncell_range< topologic_domain_t<domain_config>, dim >\n        {\n            typedef viennagrid::storage::container_range_wrapper<\n                const typename viennagrid::storage::result_of::container_of<\n                    typename topologic_domain_t<domain_config>::domain_container_collection_type,\n                    typename ncell<topologic_domain_t<domain_config>, dim>::type\n                >::type\n            > type;\n        };\n    }\n    \n    template<long dim, typename domain_config>\n    typename result_of::ncell_range<topologic_domain_t<domain_config>, dim>::type ncells(topologic_domain_t<domain_config> & domain)\n    {\n        typedef typename result_of::ncell<topologic_domain_t<domain_config>, dim>::type element_type;\n        return typename result_of::ncell_range<topologic_domain_t<domain_config>, dim>::type(\n            viennagrid::storage::collection::get<element_type>(domain.get_container_collection()) );\n    }\n    \n    template<long dim, typename domain_config>\n    typename result_of::const_ncell_range<topologic_domain_t<domain_config>, dim>::type ncells(const topologic_domain_t<domain_config> & domain)\n    {\n        typedef const typename result_of::ncell<topologic_domain_t<domain_config>, dim>::type element_type;\n        return typename result_of::const_ncell_range<topologic_domain_t<domain_config>, dim>::type(\n            viennagrid::storage::collection::get<element_type>(domain.get_container_collection()) );\n    }\n    \n    \n    \n    \n\n    \n\n    \n\n    \n    \n    template<typename domain_type, typename element_tag, typename boundary_cell_container_typelist, typename id_type>\n    std::pair<\n                typename viennagrid::storage::result_of::container_of<\n                    typename result_of::container_collection<domain_type>::type,\n                    viennagrid::element_t<element_tag, boundary_cell_container_typelist, id_type>\n                >::type::hook_type,\n                bool\n            >\n        push_element( domain_type & domain, const viennagrid::element_t<element_tag, boundary_cell_container_typelist, id_type> & element)\n    {\n        return inserter(domain)(element);\n    }\n    \n    \n\n    \n\n    \n        \n    \n    template<typename element_tag, typename boundary_cell_container_typelist, typename id_type>\n    void set_vertex(\n            viennagrid::element_t<element_tag, boundary_cell_container_typelist, id_type> & element,\n            typename viennagrid::result_of::ncell_hook< viennagrid::element_t<element_tag, boundary_cell_container_typelist, id_type>, 0 >::type vertex_hook,\n            unsigned int pos\n        )\n    {\n        element.container( viennagrid::dimension_tag<0>() ).set_hook( vertex_hook, pos );\n    }\n    \n    template<typename domain_type>\n    typename result_of::element_hook<domain_type, viennagrid::vertex_tag>::type get_vertex_hook( domain_type & domain, unsigned int pos )\n    {\n        typedef typename result_of::element<domain_type, viennagrid::vertex_tag>::type vertex_type;\n        return viennagrid::storage::collection::get<vertex_type>( container_collection(domain) ).hook_at(pos);\n    }\n    \n    \n    \n    \n       \n    template<typename element_type, typename domain_type>\n    typename result_of::element_hook<domain_type, viennagrid::vertex_tag>::type create_element( domain_type & domain )\n    {\n        typedef typename result_of::element<domain_type, viennagrid::vertex_tag>::type vertex_type;\n        return push_element(domain, vertex_type() ).first;\n    }\n    \n    \n    template<typename element_type, typename domain_type, typename hook_array_type>\n    element_type & create_element( domain_type & domain, const hook_array_type & array )\n    {\n        element_type element = element_type( container_collection(domain) );\n        \n        size_t element_index = 0;\n        for (typename hook_array_type::const_iterator it = array.begin(); it != array.end(); ++it, ++element_index)\n            viennagrid::set_vertex( element, *it, element_index );\n                \n        return dereference_hook(domain, push_element(domain, element ).first);\n    }    \n}\n\n\n\n#endif\n<commit_msg>create_element now returns a hook instead of the element itself<commit_after>#ifndef VIENNAGRID_TOPOLOGIC_DOMAIN_HPP\n#define VIENNAGRID_TOPOLOGIC_DOMAIN_HPP\n\n\/* =======================================================================\n   Copyright (c) 2011-2012, Institute for Microelectronics,\n                            Institute for Analysis and Scientific Computing,\n                            TU Wien.\n\n                            -----------------\n                     ViennaGrid - The Vienna Grid Library\n                            -----------------\n\n   Authors:      Karl Rupp                           rupp@iue.tuwien.ac.at\n                 Josef Weinbub                    weinbub@iue.tuwien.ac.at\n               \n   (A list of additional contributors can be found in the PDF manual)\n\n   License:      MIT (X11), see file LICENSE in the base directory\n======================================================================= *\/\n\n\nnamespace viennagrid\n{\n    namespace result_of\n    {\n        template<typename topologic_domain_config, typename typemap>\n        struct continuous_id_generator_config_from_domain_config_helper;\n        \n        \n        template<typename topologic_domain_config, typename element_tag, typename element_config, typename tail>\n        struct continuous_id_generator_config_from_domain_config_helper< topologic_domain_config, viennameta::typelist_t<viennameta::static_pair<element_tag, element_config>, tail> >\n        {\n            typedef typename viennameta::typemap::result_of::insert<\n                typename continuous_id_generator_config_from_domain_config_helper<topologic_domain_config, tail>::type,\n                viennameta::static_pair<\n                    typename viennagrid::result_of::element<topologic_domain_config, element_tag>::type,\n                    typename viennagrid::result_of::element_id_tag<topologic_domain_config, element_tag>::type\n                >\n            >::type type;\n        };\n        \n        template<typename topologic_domain_config>\n        struct continuous_id_generator_config_from_domain_config_helper<topologic_domain_config, viennameta::null_type>\n        {\n            typedef viennameta::null_type type;\n        };\n        \n        \n        template<typename topologic_domain_config>\n        struct continuous_id_generator_config_from_domain_config\n        {\n            typedef typename continuous_id_generator_config_from_domain_config_helper<topologic_domain_config, topologic_domain_config>::type type;\n        };\n    }\n}\n\n\nnamespace viennagrid\n{\n\n    template<typename topologic_domain_config_>\n    class topologic_domain_t\n    {\n    public:\n        typedef topologic_domain_config_ topologic_domain_config;\n        typedef typename viennagrid::result_of::element_container_typemap<topologic_domain_config>::type element_container_typelist;\n        typedef typename viennagrid::storage::result_of::collection< element_container_typelist >::type domain_container_collection_type;\n        \n        typedef typename viennagrid::result_of::continuous_id_generator_config_from_domain_config<topologic_domain_config>::type id_generator_config;\n        typedef typename viennagrid::storage::result_of::continuous_id_generator< id_generator_config >::type id_generator_type;\n        typedef typename viennagrid::storage::result_of::physical_inserter<domain_container_collection_type, id_generator_type&>::type inserter_type;\n        \n        \n        topologic_domain_t() : id_generator(), container_collection(), inserter(container_collection, id_generator) {}\n        \n        \n        \n        \n        domain_container_collection_type & get_container_collection() { return container_collection; }\n        const domain_container_collection_type & get_container_collection() const { return container_collection; }\n        \n        inserter_type & get_inserter() { return inserter; }\n        \n    protected:\n        id_generator_type id_generator;\n        domain_container_collection_type container_collection;\n        inserter_type inserter;\n    };\n}\n\n\nnamespace viennagrid\n{\n    \n    namespace result_of\n    {\n        template<typename something>\n        struct topologic_domain;\n        \n        \n        \/\/ topologic domain type from config\n        \n        template<typename key_type, typename value_type, typename tail>\n        struct topologic_domain< viennameta::typelist_t< viennameta::static_pair<key_type, value_type>, tail > >\n        {\n            typedef topologic_domain_t< viennameta::typelist_t< viennameta::static_pair<key_type, value_type>, tail > > type;\n        };\n        \n        \/\/ identity meta functor\n        \n        template<typename topologic_domain_config>\n        struct topologic_domain< topologic_domain_t<topologic_domain_config> >\n        {\n            typedef topologic_domain_t<topologic_domain_config> type;\n        };\n        \n        \n        \n        template<typename something>\n        struct container_collection;\n        \n        template<typename typemap>\n        struct container_collection< storage::collection_t<typemap> >\n        {\n            typedef storage::collection_t<typemap> type;\n        };\n        \n        \n        template<typename topologic_domain_config>\n        struct container_collection< topologic_domain_t<topologic_domain_config> >\n        {\n            typedef typename topologic_domain_t<topologic_domain_config>::domain_container_collection_type type;\n        };\n    }\n    \n    \n    \n    template<typename topologic_domain_config>\n    topologic_domain_t<topologic_domain_config> & topologic_domain( topologic_domain_t<topologic_domain_config> & domain) { return domain; }\n    \n    template<typename topologic_domain_config>\n    const topologic_domain_t<topologic_domain_config> & topologic_domain( const topologic_domain_t<topologic_domain_config> & domain) { return domain; }\n    \n    template<typename domain_type>\n    typename result_of::container_collection< domain_type >::type & container_collection( domain_type & domain)\n    { return topologic_domain(domain).get_container_collection(); }\n\n    template<typename domain_type>\n    const typename result_of::container_collection< domain_type >::type & container_collection( const domain_type & domain)\n    { return topologic_domain(domain).get_container_collection(); }\n\n\n    template<typename domain_type>\n    typename result_of::topologic_domain<domain_type>::type::inserter_type & inserter(domain_type & domain)\n    { return topologic_domain(domain).get_inserter(); }\n    \n    \n    template<typename domain_type, typename hook_type>\n    typename storage::hook::value_type<hook_type>::type & dereference_hook( domain_type & domain, const hook_type & hook)\n    {\n        typedef typename storage::hook::value_type<hook_type>::type value_type;\n        return storage::collection::get<value_type>(container_collection(domain)).dereference_hook( hook );\n    }\n    \n    template<typename domain_type, typename hook_type>\n    const typename storage::hook::value_type<hook_type>::type & dereference_hook( const domain_type & domain, const hook_type & hook)\n    {\n        typedef typename storage::hook::value_type<hook_type>::type value_type;\n        return storage::collection::get<value_type>(container_collection(domain)).dereference_hook( hook );\n    }\n}\n\n\n\nnamespace viennagrid\n{\n    \n    namespace result_of\n    {\n        \n        template<typename domain_config, typename element_tag>\n        struct element< topologic_domain_t<domain_config>, element_tag >\n        {\n            typedef typename element<domain_config, element_tag>::type type;\n        };\n        \n        template<typename domain_config, typename element_tag>\n        struct element_hook<topologic_domain_t<domain_config>, element_tag>\n        {\n            typedef typename element_container<domain_config, element_tag>::type::hook_type type;\n        };\n        \n        template<typename domain_config, long dim>\n        struct ncell< topologic_domain_t<domain_config>, dim >\n        {\n            typedef typename ncell<domain_config, dim>::type type;\n        };\n        \n        template<typename domain_config, long dim>\n        struct ncell_hook< topologic_domain_t<domain_config>, dim >\n        {\n            typedef typename ncell<domain_config, dim>::type element_type;\n            typedef typename element_container<domain_config, typename element_type::tag>::type::hook_type type;\n        };\n        \n        template<typename domain_config, long dim>\n        struct ncell_range< topologic_domain_t<domain_config>, dim >\n        {\n            typedef viennagrid::storage::container_range_wrapper<\n                typename viennagrid::storage::result_of::container_of<\n                    typename topologic_domain_t<domain_config>::domain_container_collection_type,\n                    typename ncell<topologic_domain_t<domain_config>, dim>::type\n                >::type\n            > type;\n        };\n        \n        template<typename domain_config, long dim>\n        struct const_ncell_range< topologic_domain_t<domain_config>, dim >\n        {\n            typedef viennagrid::storage::container_range_wrapper<\n                const typename viennagrid::storage::result_of::container_of<\n                    typename topologic_domain_t<domain_config>::domain_container_collection_type,\n                    typename ncell<topologic_domain_t<domain_config>, dim>::type\n                >::type\n            > type;\n        };\n    }\n    \n    template<long dim, typename domain_config>\n    typename result_of::ncell_range<topologic_domain_t<domain_config>, dim>::type ncells(topologic_domain_t<domain_config> & domain)\n    {\n        typedef typename result_of::ncell<topologic_domain_t<domain_config>, dim>::type element_type;\n        return typename result_of::ncell_range<topologic_domain_t<domain_config>, dim>::type(\n            viennagrid::storage::collection::get<element_type>(domain.get_container_collection()) );\n    }\n    \n    template<long dim, typename domain_config>\n    typename result_of::const_ncell_range<topologic_domain_t<domain_config>, dim>::type ncells(const topologic_domain_t<domain_config> & domain)\n    {\n        typedef const typename result_of::ncell<topologic_domain_t<domain_config>, dim>::type element_type;\n        return typename result_of::const_ncell_range<topologic_domain_t<domain_config>, dim>::type(\n            viennagrid::storage::collection::get<element_type>(domain.get_container_collection()) );\n    }\n    \n    \n    \n    \n\n    \n\n    \n\n    \n    \n    template<typename domain_type, typename element_tag, typename boundary_cell_container_typelist, typename id_type>\n    std::pair<\n                typename viennagrid::storage::result_of::container_of<\n                    typename result_of::container_collection<domain_type>::type,\n                    viennagrid::element_t<element_tag, boundary_cell_container_typelist, id_type>\n                >::type::hook_type,\n                bool\n            >\n        push_element( domain_type & domain, const viennagrid::element_t<element_tag, boundary_cell_container_typelist, id_type> & element)\n    {\n        return inserter(domain)(element);\n    }\n    \n    \n\n    \n\n    \n        \n    \n    template<typename element_tag, typename boundary_cell_container_typelist, typename id_type>\n    void set_vertex(\n            viennagrid::element_t<element_tag, boundary_cell_container_typelist, id_type> & element,\n            typename viennagrid::result_of::ncell_hook< viennagrid::element_t<element_tag, boundary_cell_container_typelist, id_type>, 0 >::type vertex_hook,\n            unsigned int pos\n        )\n    {\n        element.container( viennagrid::dimension_tag<0>() ).set_hook( vertex_hook, pos );\n    }\n    \n    template<typename domain_type>\n    typename result_of::element_hook<domain_type, viennagrid::vertex_tag>::type get_vertex_hook( domain_type & domain, unsigned int pos )\n    {\n        typedef typename result_of::element<domain_type, viennagrid::vertex_tag>::type vertex_type;\n        return viennagrid::storage::collection::get<vertex_type>( container_collection(domain) ).hook_at(pos);\n    }\n    \n    \n    \n    \n       \n    template<typename element_type, typename domain_type>\n    typename result_of::element_hook<domain_type, viennagrid::vertex_tag>::type create_element( domain_type & domain )\n    {\n        typedef typename result_of::element<domain_type, viennagrid::vertex_tag>::type vertex_type;\n        return push_element(domain, vertex_type() ).first;\n    }\n    \n    \n    template<typename element_type, typename domain_type, typename hook_array_type>\n    typename result_of::element_hook<domain_type, typename element_type::tag>::type create_element( domain_type & domain, const hook_array_type & array )\n    {\n        element_type element = element_type( container_collection(domain) );\n        \n        size_t element_index = 0;\n        for (typename hook_array_type::const_iterator it = array.begin(); it != array.end(); ++it, ++element_index)\n            viennagrid::set_vertex( element, *it, element_index );\n                \n        return push_element(domain, element ).first;\n    }    \n}\n\n\n\n#endif\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 \"chrome\/common\/notification_registrar.h\"\n\n#include <algorithm>\n\n#include \"base\/logging.h\"\n#include \"chrome\/common\/notification_service.h\"\n\nstruct NotificationRegistrar::Record {\n  bool operator==(const Record& other) const;\n\n  NotificationObserver* observer;\n  NotificationType type;\n  NotificationSource source;\n};\n\nbool NotificationRegistrar::Record::operator==(const Record& other) const {\n  return observer == other.observer &&\n         type == other.type &&\n         source == other.source;\n}\n\nNotificationRegistrar::NotificationRegistrar() {\n}\n\nNotificationRegistrar::~NotificationRegistrar() {\n  RemoveAll();\n}\n\nvoid NotificationRegistrar::Add(NotificationObserver* observer,\n                                NotificationType type,\n                                const NotificationSource& source) {\n  Record record = { observer, type, source };\n  DCHECK(std::find(registered_.begin(), registered_.end(), record) ==\n         registered_.end()) << \"Duplicate registration.\";\n  registered_.push_back(record);\n\n  NotificationService::current()->AddObserver(observer, type, source);\n}\n\nvoid NotificationRegistrar::Remove(NotificationObserver* observer,\n                                   NotificationType type,\n                                   const NotificationSource& source) {\n  Record record = { observer, type, source };\n  RecordVector::iterator found = std::find(\n      registered_.begin(), registered_.end(), record);\n  if (found != registered_.end()) {\n    registered_.erase(found);\n  } else {\n    \/\/ Fall through to passing the removal through to the notification service.\n    \/\/ If it really isn't registered, it will also assert and do nothing, but\n    \/\/ we might as well catch the case where the class is trying to unregister\n    \/\/ for something they registered without going through us.\n    NOTREACHED();\n  }\n\n  \/\/ This can be NULL if our owner outlives the NotificationService, e.g. if our\n  \/\/ owner is a Singleton.\n  NotificationService* service = NotificationService::current();\n  if (service)\n    service->RemoveObserver(observer, type, source);\n}\n\nvoid NotificationRegistrar::RemoveAll() {\n  \/\/ This can be NULL if our owner outlives the NotificationService, e.g. if our\n  \/\/ owner is a Singleton.\n  NotificationService* service = NotificationService::current();\n  if (service) {\n    for (size_t i = 0; i < registered_.size(); i++) {\n      service->RemoveObserver(registered_[i].observer,\n                              registered_[i].type,\n                              registered_[i].source);\n    }\n  }\n  registered_.clear();\n}\n\nbool NotificationRegistrar::IsEmpty() const {\n  return registered_.empty();\n}\n<commit_msg>Avoid calling NotificationService::current() unless we have to, to prevent problems during shutdown in atypical cases.We can now be more stringent with the Remove() check that was already in place, since now users _must_ go through NotificationRegistrar to register an observer.<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 \"chrome\/common\/notification_registrar.h\"\n\n#include <algorithm>\n\n#include \"base\/logging.h\"\n#include \"chrome\/common\/notification_service.h\"\n\nstruct NotificationRegistrar::Record {\n  bool operator==(const Record& other) const;\n\n  NotificationObserver* observer;\n  NotificationType type;\n  NotificationSource source;\n};\n\nbool NotificationRegistrar::Record::operator==(const Record& other) const {\n  return observer == other.observer &&\n         type == other.type &&\n         source == other.source;\n}\n\nNotificationRegistrar::NotificationRegistrar() {\n}\n\nNotificationRegistrar::~NotificationRegistrar() {\n  RemoveAll();\n}\n\nvoid NotificationRegistrar::Add(NotificationObserver* observer,\n                                NotificationType type,\n                                const NotificationSource& source) {\n  Record record = { observer, type, source };\n  DCHECK(std::find(registered_.begin(), registered_.end(), record) ==\n         registered_.end()) << \"Duplicate registration.\";\n  registered_.push_back(record);\n\n  NotificationService::current()->AddObserver(observer, type, source);\n}\n\nvoid NotificationRegistrar::Remove(NotificationObserver* observer,\n                                   NotificationType type,\n                                   const NotificationSource& source) {\n  Record record = { observer, type, source };\n  RecordVector::iterator found = std::find(\n      registered_.begin(), registered_.end(), record);\n  if (found == registered_.end()) {\n    NOTREACHED();\n    return;\n  }\n  registered_.erase(found);\n\n  \/\/ This can be NULL if our owner outlives the NotificationService, e.g. if our\n  \/\/ owner is a Singleton.\n  NotificationService* service = NotificationService::current();\n  if (service)\n    service->RemoveObserver(observer, type, source);\n}\n\nvoid NotificationRegistrar::RemoveAll() {\n  \/\/ Early-exit if no registrations, to avoid calling\n  \/\/ NotificationService::current.  If we've constructed an object with a\n  \/\/ NotificationRegistrar member, but haven't actually used the notification\n  \/\/ service, and we reach prgram exit, then calling current() below could try\n  \/\/ to initialize the service's lazy TLS pointer during exit, which throws\n  \/\/ wrenches at things.\n  if (registered_.empty())\n    return;\n\n  \/\/ This can be NULL if our owner outlives the NotificationService, e.g. if our\n  \/\/ owner is a Singleton.\n  NotificationService* service = NotificationService::current();\n  if (service) {\n    for (size_t i = 0; i < registered_.size(); i++) {\n      service->RemoveObserver(registered_[i].observer,\n                              registered_[i].type,\n                              registered_[i].source);\n    }\n  }\n  registered_.clear();\n}\n\nbool NotificationRegistrar::IsEmpty() const {\n  return registered_.empty();\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\/common\/pepper_plugin_registry.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/native_library.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"remoting\/client\/plugin\/pepper_entrypoints.h\"\n\nPepperPluginInfo::PepperPluginInfo() : is_internal(false) {\n}\n\n\/\/ static\nPepperPluginRegistry* PepperPluginRegistry::GetInstance() {\n  static PepperPluginRegistry registry;\n  return &registry;\n}\n\n\/\/ static\nvoid PepperPluginRegistry::GetList(std::vector<PepperPluginInfo>* plugins) {\n  InternalPluginInfoList internal_plugin_info;\n  GetInternalPluginInfo(&internal_plugin_info);\n  for (InternalPluginInfoList::const_iterator it =\n         internal_plugin_info.begin();\n       it != internal_plugin_info.end();\n       ++it) {\n    plugins->push_back(*it);\n  }\n\n  GetPluginInfoFromSwitch(plugins);\n  GetExtraPlugins(plugins);\n}\n\n\/\/ static\nvoid PepperPluginRegistry::PreloadModules() {\n  std::vector<PepperPluginInfo> plugins;\n  GetList(&plugins);\n  for (size_t i = 0; i < plugins.size(); ++i) {\n    if (!plugins[i].is_internal) {\n      base::NativeLibrary library = base::LoadNativeLibrary(plugins[i].path);\n      LOG_IF(WARNING, !library) << \"Unable to load plugin \"\n                                << plugins[i].path.value();\n    }\n  }\n}\n\n\/\/ static\nvoid PepperPluginRegistry::GetPluginInfoFromSwitch(\n    std::vector<PepperPluginInfo>* plugins) {\n  const std::wstring& value = CommandLine::ForCurrentProcess()->GetSwitchValue(\n      switches::kRegisterPepperPlugins);\n  if (value.empty())\n    return;\n\n  \/\/ FORMAT:\n  \/\/ command-line = <plugin-entry> + *( LWS + \",\" + LWS + <plugin-entry> )\n  \/\/ plugin-entry = <file-path> + [\"#\" + <name> + [\"#\" + <description>]] +\n  \/\/                *1( LWS + \";\" + LWS + <mime-type> )\n\n  std::vector<std::wstring> modules;\n  SplitString(value, ',', &modules);\n  for (size_t i = 0; i < modules.size(); ++i) {\n    std::vector<std::wstring> parts;\n    SplitString(modules[i], ';', &parts);\n    if (parts.size() < 2) {\n      DLOG(ERROR) << \"Required mime-type not found\";\n      continue;\n    }\n\n    std::vector<std::wstring> name_parts;\n    SplitString(parts[0], '#', &name_parts);\n\n    PepperPluginInfo plugin;\n    plugin.path = FilePath::FromWStringHack(name_parts[0]);\n    if (name_parts.size() > 1)\n      plugin.name = WideToUTF8(name_parts[1]);\n    if (name_parts.size() > 2)\n      plugin.type_descriptions = WideToUTF8(name_parts[2]);\n    for (size_t j = 1; j < parts.size(); ++j)\n      plugin.mime_types.push_back(WideToASCII(parts[j]));\n\n    plugins->push_back(plugin);\n  }\n}\n\n\/\/ static\nvoid PepperPluginRegistry::GetExtraPlugins(\n    std::vector<PepperPluginInfo>* plugins) {\n  FilePath path;\n  if (PathService::Get(chrome::FILE_PDF_PLUGIN, &path) &&\n      file_util::PathExists(path)) {\n    PepperPluginInfo pdf;\n    pdf.path = path;\n    pdf.name = \"Chrome PDF Viewer\";\n    pdf.mime_types.push_back(\"application\/pdf\");\n    pdf.file_extensions = \"pdf\";\n    pdf.type_descriptions = \"Portable Document Format\";\n    plugins->push_back(pdf);\n  }\n}\n\nPepperPluginRegistry::InternalPluginInfo::InternalPluginInfo() {\n  is_internal = true;\n}\n\n\/\/ static\nvoid PepperPluginRegistry::GetInternalPluginInfo(\n    InternalPluginInfoList* plugin_info) {\n  \/\/ Currently, to centralize the internal plugin registration logic, we\n  \/\/ hardcode the list of plugins, mimetypes, and registration information\n  \/\/ in this function.  This is gross, but because the GetList() function is\n  \/\/ called from both the renderer and browser the other option is to force a\n  \/\/ special register function for each plugin to be called by both\n  \/\/ RendererMain() and BrowserMain().  This seemed like the better tradeoff.\n  \/\/\n  \/\/ TODO(ajwong): Think up a better way to maintain the plugin registration\n  \/\/ information. Pehraps by construction of a singly linked list of\n  \/\/ plugin initializers that is built with static initializers?\n\n#if defined(ENABLE_REMOTING)\n  if (CommandLine::ForCurrentProcess()->HasSwitch(\n      switches::kEnableChromoting)) {\n    InternalPluginInfo info;\n    \/\/ Add the chromoting plugin.\n    DCHECK(info.is_internal);\n    info.path =\n        FilePath(FILE_PATH_LITERAL(\"internal-chromoting\"));\n    info.mime_types.push_back(\"pepper-application\/x-chromoting\");\n    info.entry_points.get_interface = remoting::PPP_GetInterface;\n    info.entry_points.initialize_module = remoting::PPP_InitializeModule;\n    info.entry_points.shutdown_module = remoting::PPP_ShutdownModule;\n\n    plugin_info->push_back(info);\n  }\n#endif\n}\n\npepper::PluginModule* PepperPluginRegistry::GetModule(\n    const FilePath& path) const {\n  ModuleMap::const_iterator it = modules_.find(path);\n  if (it == modules_.end())\n    return NULL;\n  return it->second;\n}\n\nPepperPluginRegistry::PepperPluginRegistry() {\n  InternalPluginInfoList internal_plugin_info;\n  GetInternalPluginInfo(&internal_plugin_info);\n  \/\/ Register modules for these suckers.\n  for (InternalPluginInfoList::const_iterator it =\n         internal_plugin_info.begin();\n       it != internal_plugin_info.end();\n       ++it) {\n    const FilePath& path = it->path;\n    ModuleHandle module =\n        pepper::PluginModule::CreateInternalModule(it->entry_points);\n    if (!module) {\n      DLOG(ERROR) << \"Failed to load pepper module: \" << path.value();\n      continue;\n    }\n    modules_[path] = module;\n  }\n\n  \/\/ Add the modules specified on the command line last so that they can\n  \/\/ override the internal plugins.\n  std::vector<PepperPluginInfo> plugins;\n  GetPluginInfoFromSwitch(&plugins);\n  GetExtraPlugins(&plugins);\n  for (size_t i = 0; i < plugins.size(); ++i) {\n    const FilePath& path = plugins[i].path;\n    ModuleHandle module = pepper::PluginModule::CreateModule(path);\n    if (!module) {\n      DLOG(ERROR) << \"Failed to load pepper module: \" << path.value();\n      continue;\n    }\n    modules_[path] = module;\n  }\n}\n<commit_msg>Fix for pdf plugin not loaded in the linux sandbox.<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\/common\/pepper_plugin_registry.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/native_library.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"remoting\/client\/plugin\/pepper_entrypoints.h\"\n\nPepperPluginInfo::PepperPluginInfo() : is_internal(false) {\n}\n\n\/\/ static\nPepperPluginRegistry* PepperPluginRegistry::GetInstance() {\n  static PepperPluginRegistry registry;\n  return &registry;\n}\n\n\/\/ static\nvoid PepperPluginRegistry::GetList(std::vector<PepperPluginInfo>* plugins) {\n  InternalPluginInfoList internal_plugin_info;\n  GetInternalPluginInfo(&internal_plugin_info);\n  for (InternalPluginInfoList::const_iterator it =\n         internal_plugin_info.begin();\n       it != internal_plugin_info.end();\n       ++it) {\n    plugins->push_back(*it);\n  }\n\n  GetPluginInfoFromSwitch(plugins);\n  GetExtraPlugins(plugins);\n}\n\n\/\/ static\nvoid PepperPluginRegistry::PreloadModules() {\n  std::vector<PepperPluginInfo> plugins;\n  GetList(&plugins);\n  for (size_t i = 0; i < plugins.size(); ++i) {\n    if (!plugins[i].is_internal) {\n      base::NativeLibrary library = base::LoadNativeLibrary(plugins[i].path);\n      LOG_IF(WARNING, !library) << \"Unable to load plugin \"\n                                << plugins[i].path.value();\n    }\n  }\n}\n\n\/\/ static\nvoid PepperPluginRegistry::GetPluginInfoFromSwitch(\n    std::vector<PepperPluginInfo>* plugins) {\n  const std::wstring& value = CommandLine::ForCurrentProcess()->GetSwitchValue(\n      switches::kRegisterPepperPlugins);\n  if (value.empty())\n    return;\n\n  \/\/ FORMAT:\n  \/\/ command-line = <plugin-entry> + *( LWS + \",\" + LWS + <plugin-entry> )\n  \/\/ plugin-entry = <file-path> + [\"#\" + <name> + [\"#\" + <description>]] +\n  \/\/                *1( LWS + \";\" + LWS + <mime-type> )\n\n  std::vector<std::wstring> modules;\n  SplitString(value, ',', &modules);\n  for (size_t i = 0; i < modules.size(); ++i) {\n    std::vector<std::wstring> parts;\n    SplitString(modules[i], ';', &parts);\n    if (parts.size() < 2) {\n      DLOG(ERROR) << \"Required mime-type not found\";\n      continue;\n    }\n\n    std::vector<std::wstring> name_parts;\n    SplitString(parts[0], '#', &name_parts);\n\n    PepperPluginInfo plugin;\n    plugin.path = FilePath::FromWStringHack(name_parts[0]);\n    if (name_parts.size() > 1)\n      plugin.name = WideToUTF8(name_parts[1]);\n    if (name_parts.size() > 2)\n      plugin.type_descriptions = WideToUTF8(name_parts[2]);\n    for (size_t j = 1; j < parts.size(); ++j)\n      plugin.mime_types.push_back(WideToASCII(parts[j]));\n\n    plugins->push_back(plugin);\n  }\n}\n\n\/\/ static\nvoid PepperPluginRegistry::GetExtraPlugins(\n    std::vector<PepperPluginInfo>* plugins) {\n  FilePath path;\n  \/\/ We can't check for path existance here, since we are in the sandbox.\n  \/\/ If plugin is missing, it will later fail to\n  \/\/ load the library and the missing plugin message will be displayed.\n  if (PathService::Get(chrome::FILE_PDF_PLUGIN, &path)) {\n    PepperPluginInfo pdf;\n    pdf.path = path;\n    pdf.name = \"Chrome PDF Viewer\";\n    pdf.mime_types.push_back(\"application\/pdf\");\n    pdf.file_extensions = \"pdf\";\n    pdf.type_descriptions = \"Portable Document Format\";\n    plugins->push_back(pdf);\n  }\n}\n\nPepperPluginRegistry::InternalPluginInfo::InternalPluginInfo() {\n  is_internal = true;\n}\n\n\/\/ static\nvoid PepperPluginRegistry::GetInternalPluginInfo(\n    InternalPluginInfoList* plugin_info) {\n  \/\/ Currently, to centralize the internal plugin registration logic, we\n  \/\/ hardcode the list of plugins, mimetypes, and registration information\n  \/\/ in this function.  This is gross, but because the GetList() function is\n  \/\/ called from both the renderer and browser the other option is to force a\n  \/\/ special register function for each plugin to be called by both\n  \/\/ RendererMain() and BrowserMain().  This seemed like the better tradeoff.\n  \/\/\n  \/\/ TODO(ajwong): Think up a better way to maintain the plugin registration\n  \/\/ information. Pehraps by construction of a singly linked list of\n  \/\/ plugin initializers that is built with static initializers?\n\n#if defined(ENABLE_REMOTING)\n  if (CommandLine::ForCurrentProcess()->HasSwitch(\n      switches::kEnableChromoting)) {\n    InternalPluginInfo info;\n    \/\/ Add the chromoting plugin.\n    DCHECK(info.is_internal);\n    info.path =\n        FilePath(FILE_PATH_LITERAL(\"internal-chromoting\"));\n    info.mime_types.push_back(\"pepper-application\/x-chromoting\");\n    info.entry_points.get_interface = remoting::PPP_GetInterface;\n    info.entry_points.initialize_module = remoting::PPP_InitializeModule;\n    info.entry_points.shutdown_module = remoting::PPP_ShutdownModule;\n\n    plugin_info->push_back(info);\n  }\n#endif\n}\n\npepper::PluginModule* PepperPluginRegistry::GetModule(\n    const FilePath& path) const {\n  ModuleMap::const_iterator it = modules_.find(path);\n  if (it == modules_.end())\n    return NULL;\n  return it->second;\n}\n\nPepperPluginRegistry::PepperPluginRegistry() {\n  InternalPluginInfoList internal_plugin_info;\n  GetInternalPluginInfo(&internal_plugin_info);\n  \/\/ Register modules for these suckers.\n  for (InternalPluginInfoList::const_iterator it =\n         internal_plugin_info.begin();\n       it != internal_plugin_info.end();\n       ++it) {\n    const FilePath& path = it->path;\n    ModuleHandle module =\n        pepper::PluginModule::CreateInternalModule(it->entry_points);\n    if (!module) {\n      DLOG(ERROR) << \"Failed to load pepper module: \" << path.value();\n      continue;\n    }\n    modules_[path] = module;\n  }\n\n  \/\/ Add the modules specified on the command line last so that they can\n  \/\/ override the internal plugins.\n  std::vector<PepperPluginInfo> plugins;\n  GetPluginInfoFromSwitch(&plugins);\n  GetExtraPlugins(&plugins);\n  for (size_t i = 0; i < plugins.size(); ++i) {\n    const FilePath& path = plugins[i].path;\n    ModuleHandle module = pepper::PluginModule::CreateModule(path);\n    if (!module) {\n      DLOG(ERROR) << \"Failed to load pepper module: \" << path.value();\n      continue;\n    }\n    modules_[path] = module;\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 \"temp_scaffolding_stubs.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/thread.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_piece.h\"\n#include \"base\/singleton.h\"\n#include \"base\/task.h\"\n#include \"build\/build_config.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete.h\"\n#include \"chrome\/browser\/autocomplete\/history_url_provider.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_shutdown.h\"\n#include \"chrome\/browser\/cache_manager_host.h\"\n#include \"chrome\/browser\/debugger\/debugger_shell.h\"\n#include \"chrome\/browser\/first_run.h\"\n#include \"chrome\/browser\/history\/in_memory_history_backend.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_helper.h\"\n#include \"chrome\/browser\/renderer_host\/resource_message_filter.h\"\n#include \"chrome\/browser\/rlz\/rlz.h\"\n#include \"chrome\/browser\/search_engines\/template_url_prepopulate_data.h\"\n#include \"chrome\/browser\/shell_integration.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_plugin_util.h\"\n#include \"chrome\/common\/gfx\/chrome_font.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"chrome\/common\/resource_bundle.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"webkit\/glue\/webcursor.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n\n\/\/ static\nsize_t SessionRestore::num_tabs_to_load_ = 0;\n\n\/\/--------------------------------------------------------------------------\n\n\/\/ static\nsize_t AutocompleteProvider::max_matches_;\n\n\/\/ static\nsize_t AutocompleteResult::max_matches_;\n\n\/\/static\nstd::string AutocompleteInput::TypeToString(AutocompleteInput::Type type) {\n  NOTIMPLEMENTED();\n  return \"\";\n}\n\n\/\/static\nstd::string AutocompleteMatch::TypeToString(AutocompleteMatch::Type type) {\n  NOTIMPLEMENTED();\n  return \"\";\n}\n\n\/\/--------------------------------------------------------------------------\n\nUserDataManager* UserDataManager::instance_ = NULL;\n\nUserDataManager* UserDataManager::Create() {\n  DCHECK(!instance_);\n  std::wstring user_data;\n  PathService::Get(chrome::DIR_USER_DATA, &user_data);\n  instance_ = new UserDataManager(user_data);\n  return instance_;\n}\n\nUserDataManager* UserDataManager::Get() {\n  DCHECK(instance_);\n  return instance_;\n}\n\nbool ShellIntegration::SetAsDefaultBrowser() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\nbool ShellIntegration::IsDefaultBrowser() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\n\/\/--------------------------------------------------------------------------\n\nnamespace browser_shutdown {\nbool delete_resources_on_shutdown = true;\nvoid ReadLastShutdownInfo()  { NOTIMPLEMENTED(); }\nvoid Shutdown() { NOTIMPLEMENTED(); }\nvoid OnShutdownStarting(ShutdownType type) { NOTIMPLEMENTED(); }\n}\n\n\/\/ static\nbool FirstRun::IsChromeFirstRun() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool FirstRun::ProcessMasterPreferences(const FilePath& user_data_dir,\n                                        const FilePath& master_prefs_path,\n                                        int* preference_details) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nint FirstRun::ImportNow(Profile* profile, const CommandLine& cmdline) {\n  NOTIMPLEMENTED();\n  return 0;\n}\n\n\/\/ static\nbool Upgrade::IsBrowserAlreadyRunning() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool Upgrade::RelaunchChromeBrowser(const CommandLine& command_line) {\n  NOTIMPLEMENTED();\n  return true;\n}\n\n\/\/ static\nbool Upgrade::SwapNewChromeExeIfPresent() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\nvoid OpenFirstRunDialog(Profile* profile) { NOTIMPLEMENTED(); }\n\nGURL NewTabUIURL() {\n  NOTIMPLEMENTED();\n  return GURL();\n}\n\n\/\/--------------------------------------------------------------------------\n\nPluginService* PluginService::GetInstance() {\n  return Singleton<PluginService>::get();\n}\n\nPluginService::PluginService()\n    : main_message_loop_(MessageLoop::current()),\n      resource_dispatcher_host_(NULL),\n      ui_locale_(g_browser_process->GetApplicationLocale()),\n      plugin_shutdown_handler_(NULL) {\n}\n\nPluginService::~PluginService() {\n}\n\nvoid PluginService::SetChromePluginDataDir(const FilePath& data_dir) {\n  AutoLock lock(lock_);\n  chrome_plugin_data_dir_ = data_dir;\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid InstallJankometer(const CommandLine&) {\n  NOTIMPLEMENTED();\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid Browser::Observe(NotificationType type,\n                      const NotificationSource& source,\n                      const NotificationDetails& details) {\n  NOTIMPLEMENTED();\n}\n\nGURL Browser::GetHomePage() {\n  NOTIMPLEMENTED();\n  return GURL(\"http:\/\/dev.chromium.org\");\n}\n\nvoid Browser::LoadingStateChanged(TabContents* source) {\n  NOTIMPLEMENTED();\n}\n\n\/\/--------------------------------------------------------------------------\n\nTabContents* TabContents::CreateWithType(TabContentsType type,\n                                         Profile* profile,\n                                         SiteInstance* instance) {\n  TabContents* contents;\n\n  switch (type) {\n    case TAB_CONTENTS_WEB:\n      contents = new WebContents(profile, instance, NULL, MSG_ROUTING_NONE,\n                                 NULL);\n      break;\n    default:\n      NOTREACHED() << \"Don't know how to create tab contents of type \" << type;\n      contents = NULL;\n  }\n\n  if (contents)\n    contents->CreateView();\n\n  return contents;\n}\n\nvoid TabContents::SetupController(Profile* profile) {\n  DCHECK(!controller_);\n  controller_ = new NavigationController(this, profile);\n}\n\nProfile* TabContents::profile() const {\n  return controller_ ? controller_->profile() : NULL;\n}\n\nvoid TabContents::CloseContents() {\n  \/\/ Destroy our NavigationController, which will Destroy all tabs it owns.\n  controller_->Destroy();\n  \/\/ Note that the controller may have deleted us at this point,\n  \/\/ so don't touch any member variables here.\n}\n\nvoid TabContents::Destroy() {\n  \/\/ TODO(pinkerton): this isn't the real version of Destroy(), just enough to\n  \/\/ get the scaffolding working.\n\n  \/\/ Notify any observer that have a reference on this tab contents.\n  NotificationService::current()->Notify(\n      NotificationType::TAB_CONTENTS_DESTROYED,\n      Source<TabContents>(this),\n      NotificationService::NoDetails());\n\n  \/\/ Notify our NavigationController.  Make sure we are deleted first, so\n  \/\/ that the controller is the last to die.\n  NavigationController* controller = controller_;\n  TabContentsType type = this->type();\n\n  delete this;\n\n  controller->TabContentsWasDestroyed(type);\n}\n\nconst GURL& TabContents::GetURL() const {\n  \/\/ We may not have a navigation entry yet\n  NavigationEntry* entry = controller_->GetActiveEntry();\n  return entry ? entry->display_url() : GURL::EmptyGURL();\n}\n\nconst std::wstring& TabContents::GetTitle() const {\n  \/\/ We use the title for the last committed entry rather than a pending\n  \/\/ navigation entry. For example, when the user types in a URL, we want to\n  \/\/ keep the old page's title until the new load has committed and we get a new\n  \/\/ title.\n  \/\/ The exception is with transient pages, for which we really want to use\n  \/\/ their title, as they are not committed.\n  NavigationEntry* entry = controller_->GetTransientEntry();\n  if (entry)\n    return entry->GetTitleForDisplay();\n  \n  entry = controller_->GetLastCommittedEntry();\n  if (entry)\n    return entry->GetTitleForDisplay();\n  else if (controller_->LoadingURLLazily())\n    return controller_->GetLazyTitle();\n  return EmptyWString();\n}\n\nvoid TabContents::NotifyNavigationStateChanged(unsigned changed_flags) {\n  if (delegate_)\n    delegate_->NavigationStateChanged(this, changed_flags);\n}\n\nvoid TabContents::OpenURL(const GURL& url, const GURL& referrer,\n                          WindowOpenDisposition disposition,\n                          PageTransition::Type transition) {\n  if (delegate_)\n    delegate_->OpenURLFromTab(this, url, referrer, disposition, transition);\n}\n\nvoid TabContents::SetIsLoading(bool is_loading,\n                               LoadNotificationDetails* details) {\n  \/\/ TODO(port): this is a subset of SetIsLoading() as a stub\n  is_loading_ = is_loading;\n}\n\n\/\/--------------------------------------------------------------------------\n\nbool RLZTracker::GetAccessPointRlz(AccessPoint point, std::wstring* rlz) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nbool RLZTracker::RecordProductEvent(Product product, AccessPoint point,\n                                    Event event) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ This depends on porting all the plugin IPC messages.\nbool IsPluginProcess() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/--------------------------------------------------------------------------\n\nnamespace chrome_browser_net {\n\nvoid EnableDnsPrefetch(bool) { NOTIMPLEMENTED(); }\n\nvoid DnsPrefetchList(const std::vector<std::string>& hostnames) { NOTIMPLEMENTED(); }\n\n}  \/\/ namespace chrome_browser_net\n\n\/\/--------------------------------------------------------------------------\n\n\/\/ This is from chrome_plugin_util.cc.\nvoid CPB_Free(void* memory) { NOTIMPLEMENTED(); }\n\n\/\/--------------------------------------------------------------------------\n\nvoid RunJavascriptMessageBox(WebContents* web_contents,\n                             int dialog_flags,\n                             const std::wstring& message_text,\n                             const std::wstring& default_prompt_text,\n                             bool display_suppress_checkbox,\n                             IPC::Message* reply_msg) {\n  NOTIMPLEMENTED();\n}\n\nvoid RunBeforeUnloadDialog(WebContents* web_contents,\n                           const std::wstring& message_text,\n                           IPC::Message* reply_msg) {\n  NOTIMPLEMENTED();\n}\n\nbool SSLManager::DeserializeSecurityInfo(const std::string&, int*, int*, int*) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nvoid SSLManager::OnSSLCertificateError(\n    ResourceDispatcherHost* resource_dispatcher,\n    URLRequest* request,\n    int cert_error,\n    net::X509Certificate* cert,\n    MessageLoop* ui_loop) {\n  NOTIMPLEMENTED();\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid RunRepostFormWarningDialog(NavigationController*) {\n}\n\n#if defined(OS_MACOSX)\nResourceBundle* ResourceBundle::g_shared_instance_ = NULL;\n\n\/\/ GetBitmapNamed() will leak, but there's no way around it for stubs.\nSkBitmap* ResourceBundle::GetBitmapNamed(int) {\n  NOTIMPLEMENTED();\n  return new SkBitmap();\n}\nResourceBundle::ResourceBundle() { }\nResourceBundle& ResourceBundle::GetSharedInstance() {\n  NOTIMPLEMENTED();\n  if (!g_shared_instance_)\n    g_shared_instance_ = new ResourceBundle;\n  return *g_shared_instance_;\n}\n\nStringPiece ResourceBundle::GetRawDataResource(int resource_id) {\n  NOTIMPLEMENTED();\n  return StringPiece();\n}\n\nstd::string ResourceBundle::GetDataResource(int resource_id) {\n  NOTIMPLEMENTED();\n  return \"\";\n}\n\n#endif\n\nLoginHandler* CreateLoginPrompt(net::AuthChallengeInfo* auth_info,\n                                URLRequest* request,\n                                MessageLoop* ui_loop) {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nvoid ProcessWatcher::EnsureProcessTerminated(int) {\n  NOTIMPLEMENTED();\n}\n\n\n\/\/--------------------------------------------------------------------------\nnamespace webkit_glue {\n\nbool IsDefaultPluginEnabled() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n#if defined(OS_MACOSX)\nbool ClipboardIsFormatAvailable(Clipboard::FormatType format) {\n  NOTIMPLEMENTED();\n  return false;\n}\n#endif\n\n}  \/\/ webkit_glue\n\n#ifndef CHROME_DEBUGGER_DISABLED\nDebuggerShell::DebuggerShell(DebuggerInputOutput *io) { }\nDebuggerShell::~DebuggerShell() { }\nvoid DebuggerShell::Start() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::Debug(TabContents* tab) { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DebugMessage(const std::wstring& msg) { NOTIMPLEMENTED(); }\nvoid DebuggerShell::OnDebugAttach() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::OnDebugDisconnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DidConnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DidDisconnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::ProcessCommand(const std::wstring& data) {\n  NOTIMPLEMENTED();\n}\n#endif  \/\/ !CHROME_DEBUGGER_DISABLED\n\nvoid HistoryURLProvider::ExecuteWithDB(history::HistoryBackend*,\n                                       history::URLDatabase*,\n                                       HistoryURLProviderParams*) {\n  NOTIMPLEMENTED();\n}\n\nnamespace bookmark_utils {\n\nbool MoreRecentlyAdded(BookmarkNode* n1, BookmarkNode* n2) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nstd::vector<BookmarkNode*> GetMostRecentlyModifiedGroups(BookmarkModel* model,\n                                                         size_t max_count) {\n  NOTIMPLEMENTED();\n  return std::vector<BookmarkNode*>();\n}\n\n}\n\nScopableCPRequest::~ScopableCPRequest() {\n  NOTIMPLEMENTED();\n}\n<commit_msg>Step one on fixing the dynamic run.<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 \"temp_scaffolding_stubs.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/thread.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_piece.h\"\n#include \"base\/singleton.h\"\n#include \"base\/task.h\"\n#include \"build\/build_config.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete.h\"\n#include \"chrome\/browser\/autocomplete\/history_url_provider.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_shutdown.h\"\n#include \"chrome\/browser\/cache_manager_host.h\"\n#include \"chrome\/browser\/debugger\/debugger_shell.h\"\n#include \"chrome\/browser\/first_run.h\"\n#include \"chrome\/browser\/history\/in_memory_history_backend.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_helper.h\"\n#include \"chrome\/browser\/renderer_host\/resource_message_filter.h\"\n#include \"chrome\/browser\/rlz\/rlz.h\"\n#include \"chrome\/browser\/search_engines\/template_url_prepopulate_data.h\"\n#include \"chrome\/browser\/shell_integration.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_plugin_util.h\"\n#include \"chrome\/common\/gfx\/chrome_font.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"chrome\/common\/resource_bundle.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"webkit\/glue\/webcursor.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n\n\/\/ static\nsize_t SessionRestore::num_tabs_to_load_ = 0;\n\n\/\/--------------------------------------------------------------------------\n\n\/\/ static\nsize_t AutocompleteProvider::max_matches_;\n\nAutocompleteProvider::~AutocompleteProvider() {\n  \/\/ Though nothing needs this function yet, we want to get the C++ metadata\n  \/\/ for this class grounded in this file.\n  NOTIMPLEMENTED();\n}\n\n\/\/ static\nsize_t AutocompleteResult::max_matches_;\n\n\/\/static\nstd::string AutocompleteInput::TypeToString(AutocompleteInput::Type type) {\n  NOTIMPLEMENTED();\n  return \"\";\n}\n\n\/\/static\nstd::string AutocompleteMatch::TypeToString(AutocompleteMatch::Type type) {\n  NOTIMPLEMENTED();\n  return \"\";\n}\n\n\/\/--------------------------------------------------------------------------\n\nUserDataManager* UserDataManager::instance_ = NULL;\n\nUserDataManager* UserDataManager::Create() {\n  DCHECK(!instance_);\n  std::wstring user_data;\n  PathService::Get(chrome::DIR_USER_DATA, &user_data);\n  instance_ = new UserDataManager(user_data);\n  return instance_;\n}\n\nUserDataManager* UserDataManager::Get() {\n  DCHECK(instance_);\n  return instance_;\n}\n\nbool ShellIntegration::SetAsDefaultBrowser() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\nbool ShellIntegration::IsDefaultBrowser() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\n\/\/--------------------------------------------------------------------------\n\nnamespace browser_shutdown {\nbool delete_resources_on_shutdown = true;\nvoid ReadLastShutdownInfo()  { NOTIMPLEMENTED(); }\nvoid Shutdown() { NOTIMPLEMENTED(); }\nvoid OnShutdownStarting(ShutdownType type) { NOTIMPLEMENTED(); }\n}\n\n\/\/ static\nbool FirstRun::IsChromeFirstRun() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool FirstRun::ProcessMasterPreferences(const FilePath& user_data_dir,\n                                        const FilePath& master_prefs_path,\n                                        int* preference_details) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nint FirstRun::ImportNow(Profile* profile, const CommandLine& cmdline) {\n  NOTIMPLEMENTED();\n  return 0;\n}\n\n\/\/ static\nbool Upgrade::IsBrowserAlreadyRunning() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool Upgrade::RelaunchChromeBrowser(const CommandLine& command_line) {\n  NOTIMPLEMENTED();\n  return true;\n}\n\n\/\/ static\nbool Upgrade::SwapNewChromeExeIfPresent() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\nvoid OpenFirstRunDialog(Profile* profile) { NOTIMPLEMENTED(); }\n\nGURL NewTabUIURL() {\n  NOTIMPLEMENTED();\n  return GURL();\n}\n\n\/\/--------------------------------------------------------------------------\n\nPluginService* PluginService::GetInstance() {\n  return Singleton<PluginService>::get();\n}\n\nPluginService::PluginService()\n    : main_message_loop_(MessageLoop::current()),\n      resource_dispatcher_host_(NULL),\n      ui_locale_(g_browser_process->GetApplicationLocale()),\n      plugin_shutdown_handler_(NULL) {\n}\n\nPluginService::~PluginService() {\n}\n\nvoid PluginService::SetChromePluginDataDir(const FilePath& data_dir) {\n  AutoLock lock(lock_);\n  chrome_plugin_data_dir_ = data_dir;\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid InstallJankometer(const CommandLine&) {\n  NOTIMPLEMENTED();\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid Browser::Observe(NotificationType type,\n                      const NotificationSource& source,\n                      const NotificationDetails& details) {\n  NOTIMPLEMENTED();\n}\n\nGURL Browser::GetHomePage() {\n  NOTIMPLEMENTED();\n  return GURL(\"http:\/\/dev.chromium.org\");\n}\n\nvoid Browser::LoadingStateChanged(TabContents* source) {\n  NOTIMPLEMENTED();\n}\n\n\/\/--------------------------------------------------------------------------\n\nTabContents* TabContents::CreateWithType(TabContentsType type,\n                                         Profile* profile,\n                                         SiteInstance* instance) {\n  TabContents* contents;\n\n  switch (type) {\n    case TAB_CONTENTS_WEB:\n      contents = new WebContents(profile, instance, NULL, MSG_ROUTING_NONE,\n                                 NULL);\n      break;\n    default:\n      NOTREACHED() << \"Don't know how to create tab contents of type \" << type;\n      contents = NULL;\n  }\n\n  if (contents)\n    contents->CreateView();\n\n  return contents;\n}\n\nvoid TabContents::SetupController(Profile* profile) {\n  DCHECK(!controller_);\n  controller_ = new NavigationController(this, profile);\n}\n\nProfile* TabContents::profile() const {\n  return controller_ ? controller_->profile() : NULL;\n}\n\nvoid TabContents::CloseContents() {\n  \/\/ Destroy our NavigationController, which will Destroy all tabs it owns.\n  controller_->Destroy();\n  \/\/ Note that the controller may have deleted us at this point,\n  \/\/ so don't touch any member variables here.\n}\n\nvoid TabContents::Destroy() {\n  \/\/ TODO(pinkerton): this isn't the real version of Destroy(), just enough to\n  \/\/ get the scaffolding working.\n\n  \/\/ Notify any observer that have a reference on this tab contents.\n  NotificationService::current()->Notify(\n      NotificationType::TAB_CONTENTS_DESTROYED,\n      Source<TabContents>(this),\n      NotificationService::NoDetails());\n\n  \/\/ Notify our NavigationController.  Make sure we are deleted first, so\n  \/\/ that the controller is the last to die.\n  NavigationController* controller = controller_;\n  TabContentsType type = this->type();\n\n  delete this;\n\n  controller->TabContentsWasDestroyed(type);\n}\n\nconst GURL& TabContents::GetURL() const {\n  \/\/ We may not have a navigation entry yet\n  NavigationEntry* entry = controller_->GetActiveEntry();\n  return entry ? entry->display_url() : GURL::EmptyGURL();\n}\n\nconst std::wstring& TabContents::GetTitle() const {\n  \/\/ We use the title for the last committed entry rather than a pending\n  \/\/ navigation entry. For example, when the user types in a URL, we want to\n  \/\/ keep the old page's title until the new load has committed and we get a new\n  \/\/ title.\n  \/\/ The exception is with transient pages, for which we really want to use\n  \/\/ their title, as they are not committed.\n  NavigationEntry* entry = controller_->GetTransientEntry();\n  if (entry)\n    return entry->GetTitleForDisplay();\n  \n  entry = controller_->GetLastCommittedEntry();\n  if (entry)\n    return entry->GetTitleForDisplay();\n  else if (controller_->LoadingURLLazily())\n    return controller_->GetLazyTitle();\n  return EmptyWString();\n}\n\nvoid TabContents::NotifyNavigationStateChanged(unsigned changed_flags) {\n  if (delegate_)\n    delegate_->NavigationStateChanged(this, changed_flags);\n}\n\nvoid TabContents::OpenURL(const GURL& url, const GURL& referrer,\n                          WindowOpenDisposition disposition,\n                          PageTransition::Type transition) {\n  if (delegate_)\n    delegate_->OpenURLFromTab(this, url, referrer, disposition, transition);\n}\n\nvoid TabContents::SetIsLoading(bool is_loading,\n                               LoadNotificationDetails* details) {\n  \/\/ TODO(port): this is a subset of SetIsLoading() as a stub\n  is_loading_ = is_loading;\n}\n\n\/\/--------------------------------------------------------------------------\n\nbool RLZTracker::GetAccessPointRlz(AccessPoint point, std::wstring* rlz) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nbool RLZTracker::RecordProductEvent(Product product, AccessPoint point,\n                                    Event event) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ This depends on porting all the plugin IPC messages.\nbool IsPluginProcess() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/--------------------------------------------------------------------------\n\nnamespace chrome_browser_net {\n\nvoid EnableDnsPrefetch(bool) { NOTIMPLEMENTED(); }\n\nvoid DnsPrefetchList(const std::vector<std::string>& hostnames) { NOTIMPLEMENTED(); }\n\n}  \/\/ namespace chrome_browser_net\n\n\/\/--------------------------------------------------------------------------\n\n\/\/ This is from chrome_plugin_util.cc.\nvoid CPB_Free(void* memory) { NOTIMPLEMENTED(); }\n\n\/\/--------------------------------------------------------------------------\n\nvoid RunJavascriptMessageBox(WebContents* web_contents,\n                             int dialog_flags,\n                             const std::wstring& message_text,\n                             const std::wstring& default_prompt_text,\n                             bool display_suppress_checkbox,\n                             IPC::Message* reply_msg) {\n  NOTIMPLEMENTED();\n}\n\nvoid RunBeforeUnloadDialog(WebContents* web_contents,\n                           const std::wstring& message_text,\n                           IPC::Message* reply_msg) {\n  NOTIMPLEMENTED();\n}\n\nbool SSLManager::DeserializeSecurityInfo(const std::string&, int*, int*, int*) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nvoid SSLManager::OnSSLCertificateError(\n    ResourceDispatcherHost* resource_dispatcher,\n    URLRequest* request,\n    int cert_error,\n    net::X509Certificate* cert,\n    MessageLoop* ui_loop) {\n  NOTIMPLEMENTED();\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid RunRepostFormWarningDialog(NavigationController*) {\n}\n\n#if defined(OS_MACOSX)\nResourceBundle* ResourceBundle::g_shared_instance_ = NULL;\n\n\/\/ GetBitmapNamed() will leak, but there's no way around it for stubs.\nSkBitmap* ResourceBundle::GetBitmapNamed(int) {\n  NOTIMPLEMENTED();\n  return new SkBitmap();\n}\nResourceBundle::ResourceBundle() { }\nResourceBundle& ResourceBundle::GetSharedInstance() {\n  NOTIMPLEMENTED();\n  if (!g_shared_instance_)\n    g_shared_instance_ = new ResourceBundle;\n  return *g_shared_instance_;\n}\n\nStringPiece ResourceBundle::GetRawDataResource(int resource_id) {\n  NOTIMPLEMENTED();\n  return StringPiece();\n}\n\nstd::string ResourceBundle::GetDataResource(int resource_id) {\n  NOTIMPLEMENTED();\n  return \"\";\n}\n\n#endif\n\nLoginHandler* CreateLoginPrompt(net::AuthChallengeInfo* auth_info,\n                                URLRequest* request,\n                                MessageLoop* ui_loop) {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nvoid ProcessWatcher::EnsureProcessTerminated(int) {\n  NOTIMPLEMENTED();\n}\n\n\n\/\/--------------------------------------------------------------------------\nnamespace webkit_glue {\n\nbool IsDefaultPluginEnabled() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n#if defined(OS_MACOSX)\nbool ClipboardIsFormatAvailable(Clipboard::FormatType format) {\n  NOTIMPLEMENTED();\n  return false;\n}\n#endif\n\n}  \/\/ webkit_glue\n\n#ifndef CHROME_DEBUGGER_DISABLED\nDebuggerShell::DebuggerShell(DebuggerInputOutput *io) { }\nDebuggerShell::~DebuggerShell() { }\nvoid DebuggerShell::Start() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::Debug(TabContents* tab) { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DebugMessage(const std::wstring& msg) { NOTIMPLEMENTED(); }\nvoid DebuggerShell::OnDebugAttach() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::OnDebugDisconnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DidConnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DidDisconnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::ProcessCommand(const std::wstring& data) {\n  NOTIMPLEMENTED();\n}\n#endif  \/\/ !CHROME_DEBUGGER_DISABLED\n\nvoid HistoryURLProvider::ExecuteWithDB(history::HistoryBackend*,\n                                       history::URLDatabase*,\n                                       HistoryURLProviderParams*) {\n  NOTIMPLEMENTED();\n}\n\nnamespace bookmark_utils {\n\nbool MoreRecentlyAdded(BookmarkNode* n1, BookmarkNode* n2) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nstd::vector<BookmarkNode*> GetMostRecentlyModifiedGroups(BookmarkModel* model,\n                                                         size_t max_count) {\n  NOTIMPLEMENTED();\n  return std::vector<BookmarkNode*>();\n}\n\n}\n\nScopableCPRequest::~ScopableCPRequest() {\n  NOTIMPLEMENTED();\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\/common\/temp_scaffolding_stubs.h\"\n\n#include <vector>\n\n#include \"base\/gfx\/rect.h\"\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/first_run.h\"\n#include \"chrome\/browser\/rlz\/rlz.h\"\n\n#if defined(OS_LINUX)\n#include \"chrome\/browser\/dock_info.h\"\n#include \"chrome\/common\/render_messages.h\"\n#endif\n\n#if defined(OS_MACOSX)\n#include \"chrome\/browser\/automation\/automation_provider.h\"\n#include \"chrome\/browser\/fonts_languages_window.h\"\n#include \"chrome\/browser\/memory_details.h\"\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n#include \"chrome\/browser\/bookmarks\/bookmark_editor.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_manager.h\"\n#include \"chrome\/browser\/download\/download_request_dialog_delegate.h\"\n#include \"chrome\/browser\/download\/download_request_manager.h\"\n#include \"chrome\/browser\/tab_contents\/constrained_window.h\"\n#endif\n\nclass TabContents;\n\n\/\/--------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nvoid AutomationProvider::GetAutocompleteEditForBrowser(\n    int browser_handle,\n    bool* success,\n    int* autocomplete_edit_handle) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::GetAutocompleteEditText(int autocomplete_edit_handle,\n                                                 bool* success,\n                                                 std::wstring* text) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::SetAutocompleteEditText(int autocomplete_edit_handle,\n                                                 const std::wstring& text,\n                                                 bool* success) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::AutocompleteEditGetMatches(\n    int autocomplete_edit_handle,\n    bool* success,\n    std::vector<AutocompleteMatchData>* matches) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::AutocompleteEditIsQueryInProgress(\n    int autocomplete_edit_handle,\n    bool* success,\n    bool* query_in_progress) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::OnMessageFromExternalHost(\n    int handle, const std::string& message, const std::string& origin,\n    const std::string& target) {\n  NOTIMPLEMENTED();\n}\n\n#endif  \/\/ defined(OS_MACOSX)\n\n\/\/--------------------------------------------------------------------------\n\n\n\/\/ static\nbool FirstRun::ProcessMasterPreferences(const FilePath& user_data_dir,\n                                        const FilePath& master_prefs_path,\n                                        std::vector<std::wstring>* new_tabs,\n                                        int* ping_delay,\n                                        bool* homepage_defined) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=11971\n  \/\/ Pretend we processed them correctly.\n  return true;\n}\n\n\/\/ static\nint FirstRun::ImportNow(Profile* profile, const CommandLine& cmdline) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=11971\n  return 0;\n}\n\nbool FirstRun::CreateChromeDesktopShortcut() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nbool FirstRun::CreateChromeQuickLaunchShortcut() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool Upgrade::IsBrowserAlreadyRunning() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=9295\n  return false;\n}\n\n\/\/ static\nbool Upgrade::RelaunchChromeBrowser(const CommandLine& command_line) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=9295\n  return true;\n}\n\n\/\/ static\nbool Upgrade::SwapNewChromeExeIfPresent() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=9295\n  return true;\n}\n\n\/\/ static\nUpgrade::TryResult ShowTryChromeDialog(size_t version) {\n  return Upgrade::TD_NOT_NOW;\n}\n\n\/\/--------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nvoid InstallJankometer(const CommandLine&) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8077\n}\n\nvoid UninstallJankometer() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8077\n}\n#endif\n\n\/\/--------------------------------------------------------------------------\n\nvoid RLZTracker::CleanupRlz() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n}\n\nbool RLZTracker::GetAccessPointRlz(AccessPoint point, std::wstring* rlz) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n  return false;\n}\n\nbool RLZTracker::RecordProductEvent(Product product, AccessPoint point,\n                                    Event event) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n  return false;\n}\n\n\/\/--------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nMemoryDetails::MemoryDetails() {\n  NOTIMPLEMENTED();\n}\n\nvoid MemoryDetails::StartFetch() {\n  NOTIMPLEMENTED();\n  OnDetailsAvailable();\n\n  \/\/ When we get the real implementation this can be removed. The Release that\n  \/\/ ends up deleting this object is done as the result of the PostTask in\n  \/\/ CollectProcessData.\n  Release();\n}\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n\/\/ This should prompt the user if she wants to allow more than one concurrent\n\/\/ download per tab. Until this is in place, always allow multiple downloads.\nclass DownloadRequestDialogDelegateStub\n    : public DownloadRequestDialogDelegate {\n public:\n  explicit DownloadRequestDialogDelegateStub(\n    DownloadRequestManager::TabDownloadState* host)\n      : DownloadRequestDialogDelegate(host) { DoCancel(); }\n\n  virtual void CloseWindow() {}\n};\n\nDownloadRequestDialogDelegate* DownloadRequestDialogDelegate::Create(\n    TabContents* tab,\n    DownloadRequestManager::TabDownloadState* host) {\n  NOTIMPLEMENTED();\n  return new DownloadRequestDialogDelegateStub(host);\n}\n#endif\n\n#if !defined(TOOLKIT_VIEWS) && !defined(OS_MACOSX)\nnamespace download_util {\n\nvoid DragDownload(const DownloadItem* download,\n                  SkBitmap* icon,\n                  gfx::NativeView view) {\n  NOTIMPLEMENTED();\n}\n\n}  \/\/ namespace download_util\n#endif\n\n#if !defined(TOOLKIT_VIEWS)\nvoid BrowserList::AllBrowsersClosed() {\n  \/\/ TODO(port): Close any dependent windows if necessary when the last browser\n  \/\/             window is closed.\n}\n#endif\n\n\/\/--------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nbool DockInfo::GetNewWindowBounds(gfx::Rect* new_window_bounds,\n                                  bool* maximize_new_window) const {\n  \/\/ TODO(pinkerton): Implement on Mac.\n  \/\/ http:\/\/crbug.com\/9274\n  return true;\n}\n\nvoid DockInfo::AdjustOtherWindowBounds() const {\n  \/\/ TODO(pinkerton): Implement on Mac.\n  \/\/ http:\/\/crbug.com\/9274\n}\n#endif\n\n\/\/------------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nvoid ShowFontsLanguagesWindow(gfx::NativeWindow window,\n                              FontsLanguagesPage page,\n                              Profile* profile) {\n  NOTIMPLEMENTED();\n}\n#endif\n\n\/\/------------------------------------------------------------------------------\n\n#if defined(TOOLKIT_VIEWS)\n\nConstrainedWindow* ConstrainedWindow::CreateConstrainedDialog(\n    TabContents* owner,\n    ConstrainedWindowDelegate* delegate) {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nvoid BookmarkEditor::Show(gfx::NativeView parent_window,\n                          Profile* profile,\n                          const BookmarkNode* parent,\n                          const BookmarkNode* node,\n                          Configuration configuration,\n                          Handler* handler) {\n  NOTIMPLEMENTED();\n}\n\nvoid BookmarkManager::SelectInTree(Profile* profile, const BookmarkNode* node) {\n}\nvoid BookmarkManager::Show(Profile* profile) {\n}\n\n#endif\n\n<commit_msg>[Mac] Make about:memory not crash.<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\/common\/temp_scaffolding_stubs.h\"\n\n#include <vector>\n\n#include \"base\/gfx\/rect.h\"\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/first_run.h\"\n#include \"chrome\/browser\/rlz\/rlz.h\"\n\n#if defined(OS_LINUX)\n#include \"chrome\/browser\/dock_info.h\"\n#include \"chrome\/common\/render_messages.h\"\n#endif\n\n#if defined(OS_MACOSX)\n#include \"chrome\/browser\/automation\/automation_provider.h\"\n#include \"chrome\/browser\/fonts_languages_window.h\"\n#include \"chrome\/browser\/memory_details.h\"\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n#include \"chrome\/browser\/bookmarks\/bookmark_editor.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_manager.h\"\n#include \"chrome\/browser\/download\/download_request_dialog_delegate.h\"\n#include \"chrome\/browser\/download\/download_request_manager.h\"\n#include \"chrome\/browser\/tab_contents\/constrained_window.h\"\n#endif\n\nclass TabContents;\n\n\/\/--------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nvoid AutomationProvider::GetAutocompleteEditForBrowser(\n    int browser_handle,\n    bool* success,\n    int* autocomplete_edit_handle) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::GetAutocompleteEditText(int autocomplete_edit_handle,\n                                                 bool* success,\n                                                 std::wstring* text) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::SetAutocompleteEditText(int autocomplete_edit_handle,\n                                                 const std::wstring& text,\n                                                 bool* success) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::AutocompleteEditGetMatches(\n    int autocomplete_edit_handle,\n    bool* success,\n    std::vector<AutocompleteMatchData>* matches) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::AutocompleteEditIsQueryInProgress(\n    int autocomplete_edit_handle,\n    bool* success,\n    bool* query_in_progress) {\n  *success = false;\n  NOTIMPLEMENTED();\n}\n\nvoid AutomationProvider::OnMessageFromExternalHost(\n    int handle, const std::string& message, const std::string& origin,\n    const std::string& target) {\n  NOTIMPLEMENTED();\n}\n\n#endif  \/\/ defined(OS_MACOSX)\n\n\/\/--------------------------------------------------------------------------\n\n\n\/\/ static\nbool FirstRun::ProcessMasterPreferences(const FilePath& user_data_dir,\n                                        const FilePath& master_prefs_path,\n                                        std::vector<std::wstring>* new_tabs,\n                                        int* ping_delay,\n                                        bool* homepage_defined) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=11971\n  \/\/ Pretend we processed them correctly.\n  return true;\n}\n\n\/\/ static\nint FirstRun::ImportNow(Profile* profile, const CommandLine& cmdline) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=11971\n  return 0;\n}\n\nbool FirstRun::CreateChromeDesktopShortcut() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nbool FirstRun::CreateChromeQuickLaunchShortcut() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool Upgrade::IsBrowserAlreadyRunning() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=9295\n  return false;\n}\n\n\/\/ static\nbool Upgrade::RelaunchChromeBrowser(const CommandLine& command_line) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=9295\n  return true;\n}\n\n\/\/ static\nbool Upgrade::SwapNewChromeExeIfPresent() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=9295\n  return true;\n}\n\n\/\/ static\nUpgrade::TryResult ShowTryChromeDialog(size_t version) {\n  return Upgrade::TD_NOT_NOW;\n}\n\n\/\/--------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nvoid InstallJankometer(const CommandLine&) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8077\n}\n\nvoid UninstallJankometer() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8077\n}\n#endif\n\n\/\/--------------------------------------------------------------------------\n\nvoid RLZTracker::CleanupRlz() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n}\n\nbool RLZTracker::GetAccessPointRlz(AccessPoint point, std::wstring* rlz) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n  return false;\n}\n\nbool RLZTracker::RecordProductEvent(Product product, AccessPoint point,\n                                    Event event) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n  return false;\n}\n\n\/\/--------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nMemoryDetails::MemoryDetails() {\n  NOTIMPLEMENTED();\n  process_data_.push_back(ProcessData());\n}\n\nvoid MemoryDetails::StartFetch() {\n  NOTIMPLEMENTED();\n  OnDetailsAvailable();\n\n  \/\/ When we get the real implementation this can be removed. The Release that\n  \/\/ ends up deleting this object is done as the result of the PostTask in\n  \/\/ CollectProcessData.\n  Release();\n}\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n\/\/ This should prompt the user if she wants to allow more than one concurrent\n\/\/ download per tab. Until this is in place, always allow multiple downloads.\nclass DownloadRequestDialogDelegateStub\n    : public DownloadRequestDialogDelegate {\n public:\n  explicit DownloadRequestDialogDelegateStub(\n    DownloadRequestManager::TabDownloadState* host)\n      : DownloadRequestDialogDelegate(host) { DoCancel(); }\n\n  virtual void CloseWindow() {}\n};\n\nDownloadRequestDialogDelegate* DownloadRequestDialogDelegate::Create(\n    TabContents* tab,\n    DownloadRequestManager::TabDownloadState* host) {\n  NOTIMPLEMENTED();\n  return new DownloadRequestDialogDelegateStub(host);\n}\n#endif\n\n#if !defined(TOOLKIT_VIEWS) && !defined(OS_MACOSX)\nnamespace download_util {\n\nvoid DragDownload(const DownloadItem* download,\n                  SkBitmap* icon,\n                  gfx::NativeView view) {\n  NOTIMPLEMENTED();\n}\n\n}  \/\/ namespace download_util\n#endif\n\n#if !defined(TOOLKIT_VIEWS)\nvoid BrowserList::AllBrowsersClosed() {\n  \/\/ TODO(port): Close any dependent windows if necessary when the last browser\n  \/\/             window is closed.\n}\n#endif\n\n\/\/--------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nbool DockInfo::GetNewWindowBounds(gfx::Rect* new_window_bounds,\n                                  bool* maximize_new_window) const {\n  \/\/ TODO(pinkerton): Implement on Mac.\n  \/\/ http:\/\/crbug.com\/9274\n  return true;\n}\n\nvoid DockInfo::AdjustOtherWindowBounds() const {\n  \/\/ TODO(pinkerton): Implement on Mac.\n  \/\/ http:\/\/crbug.com\/9274\n}\n#endif\n\n\/\/------------------------------------------------------------------------------\n\n#if defined(OS_MACOSX)\nvoid ShowFontsLanguagesWindow(gfx::NativeWindow window,\n                              FontsLanguagesPage page,\n                              Profile* profile) {\n  NOTIMPLEMENTED();\n}\n#endif\n\n\/\/------------------------------------------------------------------------------\n\n#if defined(TOOLKIT_VIEWS)\n\nConstrainedWindow* ConstrainedWindow::CreateConstrainedDialog(\n    TabContents* owner,\n    ConstrainedWindowDelegate* delegate) {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nvoid BookmarkEditor::Show(gfx::NativeView parent_window,\n                          Profile* profile,\n                          const BookmarkNode* parent,\n                          const BookmarkNode* node,\n                          Configuration configuration,\n                          Handler* handler) {\n  NOTIMPLEMENTED();\n}\n\nvoid BookmarkManager::SelectInTree(Profile* profile, const BookmarkNode* node) {\n}\nvoid BookmarkManager::Show(Profile* profile) {\n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"vtrc-endpoint-win-pipe.h\"\n\n#ifdef _WIN32\n\n#include \"boost\/asio.hpp\"\n#include \"boost\/asio\/windows\/stream_handle.hpp\"\n\n#include \"vtrc-application.h\"\n#include \"vtrc-common\/vtrc-enviroment.h\"\n#include \"vtrc-common\/vtrc-transport-win-pipe.h\"\n#include \"vtrc-common\/vtrc-connection-list.h\"\n\n#include \"vtrc-endpoint-iface.h\"\n#include \"vtrc-connection-impl.h\"\n\nnamespace vtrc { namespace server { namespace endpoints {\n\nnamespace {\n\n    namespace basio = boost::asio;\n    typedef basio::windows::stream_handle    socket_type;\n    typedef common::transport_win_pipe       connection_type;\n    typedef connection_impl<connection_type> connection_impl_type;\n\n    struct commection_pipe_impl: public connection_impl_type {\n\n        typedef commection_pipe_impl this_type;\n\n        commection_pipe_impl( endpoint_iface &endpoint,\n                            vtrc::shared_ptr<socket_type> sock )\n            :connection_impl_type(endpoint, sock)\n        { }\n\n        bool impersonate( )\n        {\n\/\/            BOOL imp = ImpersonateNamedPipeClient(\n\/\/                                    get_socket( ).native_handle( ) );\n\/\/            if( imp ) {\n\/\/                common::call_context *c\n\/\/                                    (get_protocol(  ).get_top_call_context( ));\n\/\/                if( c ) c->set_impersonated( true );\n\/\/            }\n\/\/            return !!imp;\n            return false;\n        }\n\n        void revert( )\n        {\n\/\/            common::call_context *c\n\/\/                                (get_protocol( ).get_top_call_context( ));\n\/\/            if( c && c->get_impersonated( ) ) RevertToSelf( );\n        }\n\n        static vtrc::shared_ptr<this_type> create(endpoint_iface &endpoint,\n                                         vtrc::shared_ptr<socket_type> sock )\n        {\n            vtrc::shared_ptr<this_type> new_inst\n                    (vtrc::make_shared<this_type>(vtrc::ref(endpoint), sock));\n\n            new_inst->init( );\n            return new_inst;\n        }\n    };\n\n    typedef commection_pipe_impl transport_type;\n\n    struct pipe_ep_impl: public endpoint_iface {\n\n        typedef pipe_ep_impl this_type;\n\n        application             &app_;\n        basio::io_service       &ios_;\n        common::enviroment       env_;\n\n        endpoint_options         opts_;\n        std::string              endpoint_;\n        size_t                   pipe_max_inst_;\n        size_t                   in_buf_size_;\n        size_t                   out_buf_size_;\n\n        basio::windows::overlapped_ptr overlapped_;\n\n        pipe_ep_impl( application &app,\n                const endpoint_options &opts, const std::string pipe_name,\n                size_t max_inst, size_t out_buf_size, size_t in_buf_size)\n            :app_(app)\n            ,ios_(app_.get_io_service( ))\n            ,env_(app.get_enviroment( ))\n            ,opts_(opts)\n            ,endpoint_(pipe_name)\n            ,pipe_max_inst_(max_inst)\n            ,in_buf_size_(in_buf_size)\n            ,out_buf_size_(out_buf_size)\n        {}\n\n        virtual ~pipe_ep_impl( ) { }\n\n        application &get_application( )\n        {\n            return app_;\n        }\n\n        common::enviroment &get_enviroment( )\n        {\n            return env_;\n        }\n\n        std::string string( ) const\n        {\n            return std::string(\"pipe:\/\/\") + endpoint_;\n        }\n\n        void start_accept(  )\n        {\n            SECURITY_DESCRIPTOR secdesc;\n            SECURITY_ATTRIBUTES secarttr;\n            InitializeSecurityDescriptor(&secdesc,\n                                         SECURITY_DESCRIPTOR_REVISION);\n\n            SetSecurityDescriptorDacl(&secdesc, TRUE,\n                                      static_cast<PACL>(NULL), FALSE);\n\n            secarttr.nLength              = sizeof(SECURITY_ATTRIBUTES);\n            secarttr.bInheritHandle       = FALSE;\n            secarttr.lpSecurityDescriptor = &secdesc;\n\n            HANDLE pipe_hdl = CreateNamedPipeA( endpoint_.c_str( ),\n                PIPE_ACCESS_DUPLEX | FILE_FLAG_OVERLAPPED,\n                PIPE_TYPE_BYTE     | PIPE_READMODE_BYTE,\n                pipe_max_inst_,\n                out_buf_size_, in_buf_size_,\n                0, &secarttr );\n\n            if( INVALID_HANDLE_VALUE != pipe_hdl ) {\n\n                vtrc::shared_ptr<socket_type> new_sock\n                        (vtrc::make_shared<socket_type>(vtrc::ref(ios_)));\n                new_sock->assign( pipe_hdl );\n\n                overlapped_.reset( ios_,\n                        vtrc::bind( &this_type::on_accept, this,\n                            basio::placeholders::error, new_sock) );\n\n                BOOL res = ConnectNamedPipe( pipe_hdl, overlapped_.get( ) );\n\n                DWORD last_error(GetLastError());\n                if( res || ( last_error ==  ERROR_IO_PENDING ) ) {\n                    overlapped_.release();\n\n                } else if( last_error == ERROR_PIPE_CONNECTED ) {\n                    bsys::error_code ec( 0,\n                            basio::error::get_system_category( ));\n                    overlapped_.complete( ec, 0 );\n\n                } else {\n                    bsys::error_code ec(last_error,\n                                basio::error::get_system_category( ));\n                    overlapped_.complete( ec, 0 );\n\n                }\n            } else {\n                bsys::error_code ec(GetLastError( ),\n                            basio::error::get_system_category( ));\n                overlapped_.complete( ec, 0 );\n            }\n        }\n\n        void start( )\n        {\n            start_accept( );\n            app_.on_endpoint_started( this );\n        }\n\n        void stop ( )\n        {\n            app_.on_endpoint_stopped( this );\n        }\n\n        virtual const endpoint_options &get_options( ) const\n        {\n            return opts_;\n        }\n\n        void on_accept( const bsys::error_code &error,\n                        vtrc::shared_ptr<socket_type> sock )\n        {\n            if( !error ) {\n                try {\n                    vtrc::shared_ptr<transport_type> new_conn\n                             (transport_type::create( *this, sock ));\n                    app_.get_clients( )->store( new_conn );\n                } catch( ... ) {\n                    ;;;\n                }\n                start_accept( );\n            } else {\n                \/\/ delete sock;\n            }\n        }\n\n    };\n}\n\n    namespace win_pipe {\n\n        endpoint_iface *create( application &app, const std::string &name )\n        {\n            endpoint_options def_opts(default_options( ));\n            return new pipe_ep_impl( app, default_options( ), name,\n                                     PIPE_UNLIMITED_INSTANCES,\n                                     def_opts.read_buffer_size,\n                                     def_opts.read_buffer_size );\n        }\n\n        \/\/endpoint_iface *create( application &app, const std::wstring &name )\n        \/\/{\n        \/\/\n        \/\/}\n\n        endpoint_iface *create( application &app, const endpoint_options &opts,\n                                const std::string &name )\n        {\n            return new pipe_ep_impl( app, opts, name,\n                                     PIPE_UNLIMITED_INSTANCES,\n                                     opts.read_buffer_size,\n                                     opts.read_buffer_size );\n        }\n    }\n\n}}}\n\n#endif\n<commit_msg>fix winpipe<commit_after>#include \"vtrc-endpoint-win-pipe.h\"\n\n#ifdef _WIN32\n\n#include \"boost\/asio.hpp\"\n#include \"boost\/asio\/windows\/stream_handle.hpp\"\n\n#include \"vtrc-application.h\"\n#include \"vtrc-common\/vtrc-enviroment.h\"\n#include \"vtrc-common\/vtrc-transport-win-pipe.h\"\n#include \"vtrc-common\/vtrc-connection-list.h\"\n\n#include \"vtrc-endpoint-iface.h\"\n#include \"vtrc-connection-impl.h\"\n\n#include \"vtrc-atomic.h\"\n#include \"vtrc-common\/vtrc-closure.h\"\n\nnamespace vtrc { namespace server { namespace endpoints {\n\nnamespace {\n\n    namespace basio = boost::asio;\n    typedef basio::windows::stream_handle    socket_type;\n    typedef common::transport_win_pipe       connection_type;\n    typedef connection_impl<connection_type> connection_impl_type;\n\n    struct commection_pipe_impl: public connection_impl_type {\n\n        typedef commection_pipe_impl this_type;\n\n        commection_pipe_impl( endpoint_iface &endpoint,\n                              vtrc::shared_ptr<socket_type> sock,\n                              const common::empty_closure_type &on_destroy)\n            :connection_impl_type(endpoint, sock, on_destroy)\n        { }\n\n        bool impersonate( )\n        {\n\/\/            BOOL imp = ImpersonateNamedPipeClient(\n\/\/                                    get_socket( ).native_handle( ) );\n\/\/            if( imp ) {\n\/\/                common::call_context *c\n\/\/                                    (get_protocol(  ).get_top_call_context( ));\n\/\/                if( c ) c->set_impersonated( true );\n\/\/            }\n\/\/            return !!imp;\n            return false;\n        }\n\n        void revert( )\n        {\n\/\/            common::call_context *c\n\/\/                                (get_protocol( ).get_top_call_context( ));\n\/\/            if( c && c->get_impersonated( ) ) RevertToSelf( );\n        }\n\n        static vtrc::shared_ptr<this_type> create(endpoint_iface &endpoint,\n                                 vtrc::shared_ptr<socket_type> sock,\n                                 const common::empty_closure_type &on_destroy)\n        {\n            vtrc::shared_ptr<this_type> new_inst\n                    (vtrc::make_shared<this_type>(vtrc::ref(endpoint), \n                                                   sock, on_destroy));\n\n            new_inst->init( );\n            return new_inst;\n        }\n    };\n\n    typedef commection_pipe_impl transport_type;\n\n    struct pipe_ep_impl: public endpoint_iface {\n\n        typedef pipe_ep_impl this_type;\n        typedef vtrc::shared_ptr< vtrc::atomic<size_t> > shared_counter_type;\n\n        application             &app_;\n        basio::io_service       &ios_;\n        common::enviroment       env_;\n\n        endpoint_options         opts_;\n        std::string              endpoint_;\n        size_t                   pipe_max_inst_;\n        size_t                   in_buf_size_;\n        size_t                   out_buf_size_;\n        shared_counter_type      client_count_;\n        \n        basio::windows::overlapped_ptr overlapped_;\n\n        pipe_ep_impl( application &app,\n                const endpoint_options &opts, const std::string pipe_name,\n                size_t max_inst, size_t out_buf_size, size_t in_buf_size)\n            :app_(app)\n            ,ios_(app_.get_io_service( ))\n            ,env_(app.get_enviroment( ))\n            ,opts_(opts)\n            ,endpoint_(pipe_name)\n            ,pipe_max_inst_(max_inst)\n            ,in_buf_size_(in_buf_size)\n            ,out_buf_size_(out_buf_size)\n            ,client_count_(vtrc::make_shared<vtrc::atomic<size_t> >(0))\n        { }\n\n        virtual ~pipe_ep_impl( ) { }\n\n        static void on_client_destroy( shared_counter_type count )\n        {\n            --(*count);\n        }\n\n        common::empty_closure_type get_on_destroy( )\n        {\n            return vtrc::bind( &this_type::on_client_destroy, client_count_ );\n        }\n\n        application &get_application( )\n        {\n            return app_;\n        }\n\n        common::enviroment &get_enviroment( )\n        {\n            return env_;\n        }\n\n        std::string string( ) const\n        {\n            return std::string(\"pipe:\/\/\") + endpoint_;\n        }\n\n        void start_accept(  )\n        {\n            SECURITY_DESCRIPTOR secdesc;\n            SECURITY_ATTRIBUTES secarttr;\n            InitializeSecurityDescriptor(&secdesc,\n                                         SECURITY_DESCRIPTOR_REVISION);\n\n            SetSecurityDescriptorDacl(&secdesc, TRUE,\n                                      static_cast<PACL>(NULL), FALSE);\n\n            secarttr.nLength              = sizeof(SECURITY_ATTRIBUTES);\n            secarttr.bInheritHandle       = FALSE;\n            secarttr.lpSecurityDescriptor = &secdesc;\n\n            HANDLE pipe_hdl = CreateNamedPipeA( endpoint_.c_str( ),\n                PIPE_ACCESS_DUPLEX | FILE_FLAG_OVERLAPPED,\n                PIPE_TYPE_BYTE     | PIPE_READMODE_BYTE,\n                pipe_max_inst_,\n                out_buf_size_, in_buf_size_,\n                0, &secarttr );\n\n            if( INVALID_HANDLE_VALUE != pipe_hdl ) {\n\n                vtrc::shared_ptr<socket_type> new_sock\n                        (vtrc::make_shared<socket_type>(vtrc::ref(ios_)));\n                new_sock->assign( pipe_hdl );\n\n                overlapped_.reset( ios_,\n                        vtrc::bind( &this_type::on_accept, this,\n                            basio::placeholders::error, new_sock) );\n\n                BOOL res = ConnectNamedPipe( pipe_hdl, overlapped_.get( ) );\n\n                DWORD last_error(GetLastError());\n                if( res || ( last_error ==  ERROR_IO_PENDING ) ) {\n                    overlapped_.release();\n\n                } else if( last_error == ERROR_PIPE_CONNECTED ) {\n                    bsys::error_code ec( 0,\n                            basio::error::get_system_category( ));\n                    overlapped_.complete( ec, 0 );\n\n                } else {\n                    bsys::error_code ec(last_error,\n                                basio::error::get_system_category( ));\n                    overlapped_.complete( ec, 0 );\n\n                }\n            } else {\n                bsys::error_code ec(GetLastError( ),\n                            basio::error::get_system_category( ));\n                overlapped_.complete( ec, 0 );\n            }\n        }\n\n        void start( )\n        {\n            start_accept( );\n            app_.on_endpoint_started( this );\n        }\n\n        void stop ( )\n        {\n            app_.on_endpoint_stopped( this );\n        }\n\n        virtual const endpoint_options &get_options( ) const\n        {\n            return opts_;\n        }\n\n        void on_accept( const bsys::error_code &error,\n                        vtrc::shared_ptr<socket_type> sock )\n        {\n            if( !error ) {\n                try {\n                    vtrc::shared_ptr<transport_type> new_conn\n                             (transport_type::create( \n                                *this, sock, get_on_destroy( )));\n                    app_.get_clients( )->store( new_conn );\n                    ++(*client_count_);\n                } catch( ... ) {\n                    ;;;\n                }\n                start_accept( );\n            } else {\n                \/\/ delete sock;\n            }\n        }\n\n    };\n}\n\n    namespace win_pipe {\n\n        endpoint_iface *create( application &app, const std::string &name )\n        {\n            endpoint_options def_opts(default_options( ));\n            return new pipe_ep_impl( app, default_options( ), name,\n                                     PIPE_UNLIMITED_INSTANCES,\n                                     def_opts.read_buffer_size,\n                                     def_opts.read_buffer_size );\n        }\n\n        \/\/endpoint_iface *create( application &app, const std::wstring &name )\n        \/\/{\n        \/\/\n        \/\/}\n\n        endpoint_iface *create( application &app, const endpoint_options &opts,\n                                const std::string &name )\n        {\n            return new pipe_ep_impl( app, opts, name,\n                                     PIPE_UNLIMITED_INSTANCES,\n                                     opts.read_buffer_size,\n                                     opts.read_buffer_size );\n        }\n    }\n\n}}}\n\n#endif\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 \"temp_scaffolding_stubs.h\"\n\n#include \"build\/build_config.h\"\n\n#include <vector>\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/thread.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_piece.h\"\n#include \"base\/singleton.h\"\n#include \"base\/task.h\"\n#include \"chrome\/browser\/autocomplete\/history_url_provider.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_shutdown.h\"\n#include \"chrome\/browser\/cache_manager_host.h\"\n#include \"chrome\/browser\/debugger\/debugger_shell.h\"\n#include \"chrome\/browser\/dom_ui\/dom_ui.h\"\n#include \"chrome\/browser\/download\/download_request_dialog_delegate.h\"\n#include \"chrome\/browser\/download\/download_request_manager.h\"\n#include \"chrome\/browser\/first_run.h\"\n#include \"chrome\/browser\/history\/in_memory_history_backend.h\"\n#include \"chrome\/browser\/memory_details.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_helper.h\"\n#include \"chrome\/browser\/renderer_host\/resource_message_filter.h\"\n#include \"chrome\/browser\/rlz\/rlz.h\"\n#include \"chrome\/browser\/search_engines\/template_url_prepopulate_data.h\"\n#include \"chrome\/browser\/shell_integration.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_plugin_util.h\"\n#include \"chrome\/common\/gfx\/chrome_font.h\"\n#include \"chrome\/common\/gfx\/text_elider.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"webkit\/glue\/webcursor.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n\n\/\/--------------------------------------------------------------------------\n\nbool ShellIntegration::SetAsDefaultBrowser() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\nbool ShellIntegration::IsDefaultBrowser() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\n\/\/--------------------------------------------------------------------------\n\n\/\/ static\nbool FirstRun::IsChromeFirstRun() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool FirstRun::ProcessMasterPreferences(const FilePath& user_data_dir,\n                                        const FilePath& master_prefs_path,\n                                        int* preference_details) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nint FirstRun::ImportNow(Profile* profile, const CommandLine& cmdline) {\n  NOTIMPLEMENTED();\n  return 0;\n}\n\n\/\/ static\nbool Upgrade::IsBrowserAlreadyRunning() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool Upgrade::RelaunchChromeBrowser(const CommandLine& command_line) {\n  NOTIMPLEMENTED();\n  return true;\n}\n\n\/\/ static\nbool Upgrade::SwapNewChromeExeIfPresent() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\nvoid OpenFirstRunDialog(Profile* profile) { NOTIMPLEMENTED(); }\n\n\/\/--------------------------------------------------------------------------\n\nvoid InstallJankometer(const CommandLine&) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8077\n}\n\nvoid UninstallJankometer() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8077\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid TabContents::SetupController(Profile* profile) {\n  DCHECK(!controller_);\n  controller_ = new NavigationController(this, profile);\n}\n\nProfile* TabContents::profile() const {\n  return controller_ ? controller_->profile() : NULL;\n}\n\nvoid TabContents::CloseContents() {\n  \/\/ Destroy our NavigationController, which will Destroy all tabs it owns.\n  controller_->Destroy();\n  \/\/ Note that the controller may have deleted us at this point,\n  \/\/ so don't touch any member variables here.\n}\n\nvoid TabContents::Destroy() {\n  \/\/ TODO(pinkerton): this isn't the real version of Destroy(), just enough to\n  \/\/ get the scaffolding working.\n\n  is_being_destroyed_ = true;\n\n  \/\/ Notify any observer that have a reference on this tab contents.\n  NotificationService::current()->Notify(\n      NotificationType::TAB_CONTENTS_DESTROYED,\n      Source<TabContents>(this),\n      NotificationService::NoDetails());\n\n  \/\/ Notify our NavigationController.  Make sure we are deleted first, so\n  \/\/ that the controller is the last to die.\n  NavigationController* controller = controller_;\n  TabContentsType type = this->type();\n\n  delete this;\n\n  controller->TabContentsWasDestroyed(type);\n}\n\nconst GURL& TabContents::GetURL() const {\n  \/\/ We may not have a navigation entry yet\n  NavigationEntry* entry = controller_->GetActiveEntry();\n  return entry ? entry->display_url() : GURL::EmptyGURL();\n}\n\nconst std::wstring& TabContents::GetTitle() const {\n  \/\/ We use the title for the last committed entry rather than a pending\n  \/\/ navigation entry. For example, when the user types in a URL, we want to\n  \/\/ keep the old page's title until the new load has committed and we get a new\n  \/\/ title.\n  \/\/ The exception is with transient pages, for which we really want to use\n  \/\/ their title, as they are not committed.\n  NavigationEntry* entry = controller_->GetTransientEntry();\n  if (entry)\n    return entry->GetTitleForDisplay();\n\n  entry = controller_->GetLastCommittedEntry();\n  if (entry)\n    return entry->GetTitleForDisplay();\n  else if (controller_->LoadingURLLazily())\n    return controller_->GetLazyTitle();\n  return EmptyWString();\n}\n\nvoid TabContents::NotifyNavigationStateChanged(unsigned changed_flags) {\n  if (delegate_)\n    delegate_->NavigationStateChanged(this, changed_flags);\n}\n\nvoid TabContents::OpenURL(const GURL& url, const GURL& referrer,\n                          WindowOpenDisposition disposition,\n                          PageTransition::Type transition) {\n  if (delegate_)\n    delegate_->OpenURLFromTab(this, url, referrer, disposition, transition);\n}\n\nvoid TabContents::SetIsLoading(bool is_loading,\n                               LoadNotificationDetails* details) {\n  \/\/ TODO(port): this is a subset of SetIsLoading() as a stub\n  is_loading_ = is_loading;\n}\n\nbool TabContents::SupportsURL(GURL* url) {\n  GURL u(*url);\n  if (TabContents::TypeForURL(&u) == type()) {\n    *url = u;\n    return true;\n  }\n  return false;\n}\n\nint32 TabContents::GetMaxPageID() {\n  if (GetSiteInstance())\n    return GetSiteInstance()->max_page_id();\n  else\n    return max_page_id_;\n}\n\nvoid TabContents::UpdateMaxPageID(int32 page_id) {\n  \/\/ Ensure both the SiteInstance and RenderProcessHost update their max page\n  \/\/ IDs in sync. Only WebContents will also have site instances, except during\n  \/\/ testing.\n  if (GetSiteInstance())\n    GetSiteInstance()->UpdateMaxPageID(page_id);\n\n  if (AsWebContents())\n    AsWebContents()->process()->UpdateMaxPageID(page_id);\n  else\n    max_page_id_ = std::max(max_page_id_, page_id);\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid RLZTracker::CleanupRlz() {\n  NOTIMPLEMENTED();\n}\n\nbool RLZTracker::GetAccessPointRlz(AccessPoint point, std::wstring* rlz) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nbool RLZTracker::RecordProductEvent(Product product, AccessPoint point,\n                                    Event event) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ This depends on porting all the plugin IPC messages.\nbool IsPluginProcess() {\n  return false;\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid RunJavascriptMessageBox(WebContents* web_contents,\n                             int dialog_flags,\n                             const std::wstring& message_text,\n                             const std::wstring& default_prompt_text,\n                             bool display_suppress_checkbox,\n                             IPC::Message* reply_msg) {\n  NOTIMPLEMENTED();\n}\n\nvoid RunBeforeUnloadDialog(WebContents* web_contents,\n                           const std::wstring& message_text,\n                           IPC::Message* reply_msg) {\n  NOTIMPLEMENTED();\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid RunRepostFormWarningDialog(NavigationController*) {\n}\n\nLoginHandler* CreateLoginPrompt(net::AuthChallengeInfo* auth_info,\n                                URLRequest* request,\n                                MessageLoop* ui_loop) {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nvoid ProcessWatcher::EnsureProcessTerminated(int) {\n  NOTIMPLEMENTED();\n}\n\n\n\/\/--------------------------------------------------------------------------\nnamespace webkit_glue {\n\nbool IsDefaultPluginEnabled() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n#if defined(OS_MACOSX)\nbool ClipboardIsFormatAvailable(Clipboard::FormatType format) {\n  NOTIMPLEMENTED();\n  return false;\n}\n#endif\n\n}  \/\/ webkit_glue\n\n#ifndef CHROME_DEBUGGER_DISABLED\nDebuggerShell::DebuggerShell(DebuggerInputOutput *io) { }\nDebuggerShell::~DebuggerShell() { }\nvoid DebuggerShell::Start() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::Debug(TabContents* tab) { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DebugMessage(const std::wstring& msg) { NOTIMPLEMENTED(); }\nvoid DebuggerShell::OnDebugAttach() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::OnDebugDisconnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DidConnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DidDisconnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::ProcessCommand(const std::wstring& data) {\n  NOTIMPLEMENTED();\n}\n#endif  \/\/ !CHROME_DEBUGGER_DISABLED\n\nMemoryDetails::MemoryDetails() {\n  NOTIMPLEMENTED();\n}\n\nvoid MemoryDetails::StartFetch() {\n  NOTIMPLEMENTED();\n}\n\nInfoBar* ConfirmInfoBarDelegate::CreateInfoBar() {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nInfoBar* AlertInfoBarDelegate::CreateInfoBar() {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nInfoBar* LinkInfoBarDelegate::CreateInfoBar() {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nbool CanImportURL(const GURL& url) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nDownloadRequestDialogDelegate* DownloadRequestDialogDelegate::Create(\n    TabContents* tab,\n    DownloadRequestManager::TabDownloadState* host) {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nviews::Window* CreateInputWindow(gfx::NativeWindow parent_hwnd,\n                                 InputWindowDelegate* delegate) {\n  NOTIMPLEMENTED();\n  return new views::Window();\n}\n\n<commit_msg>RLZ NOTIMPLEMENTEDs -> bug.<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 \"temp_scaffolding_stubs.h\"\n\n#include \"build\/build_config.h\"\n\n#include <vector>\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/thread.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_piece.h\"\n#include \"base\/singleton.h\"\n#include \"base\/task.h\"\n#include \"chrome\/browser\/autocomplete\/history_url_provider.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_shutdown.h\"\n#include \"chrome\/browser\/cache_manager_host.h\"\n#include \"chrome\/browser\/debugger\/debugger_shell.h\"\n#include \"chrome\/browser\/dom_ui\/dom_ui.h\"\n#include \"chrome\/browser\/download\/download_request_dialog_delegate.h\"\n#include \"chrome\/browser\/download\/download_request_manager.h\"\n#include \"chrome\/browser\/first_run.h\"\n#include \"chrome\/browser\/history\/in_memory_history_backend.h\"\n#include \"chrome\/browser\/memory_details.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_helper.h\"\n#include \"chrome\/browser\/renderer_host\/resource_message_filter.h\"\n#include \"chrome\/browser\/rlz\/rlz.h\"\n#include \"chrome\/browser\/search_engines\/template_url_prepopulate_data.h\"\n#include \"chrome\/browser\/shell_integration.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_plugin_util.h\"\n#include \"chrome\/common\/gfx\/chrome_font.h\"\n#include \"chrome\/common\/gfx\/text_elider.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"webkit\/glue\/webcursor.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n\n\/\/--------------------------------------------------------------------------\n\nbool ShellIntegration::SetAsDefaultBrowser() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\nbool ShellIntegration::IsDefaultBrowser() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\n\/\/--------------------------------------------------------------------------\n\n\/\/ static\nbool FirstRun::IsChromeFirstRun() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool FirstRun::ProcessMasterPreferences(const FilePath& user_data_dir,\n                                        const FilePath& master_prefs_path,\n                                        int* preference_details) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nint FirstRun::ImportNow(Profile* profile, const CommandLine& cmdline) {\n  NOTIMPLEMENTED();\n  return 0;\n}\n\n\/\/ static\nbool Upgrade::IsBrowserAlreadyRunning() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n\/\/ static\nbool Upgrade::RelaunchChromeBrowser(const CommandLine& command_line) {\n  NOTIMPLEMENTED();\n  return true;\n}\n\n\/\/ static\nbool Upgrade::SwapNewChromeExeIfPresent() {\n  NOTIMPLEMENTED();\n  return true;\n}\n\nvoid OpenFirstRunDialog(Profile* profile) { NOTIMPLEMENTED(); }\n\n\/\/--------------------------------------------------------------------------\n\nvoid InstallJankometer(const CommandLine&) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8077\n}\n\nvoid UninstallJankometer() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8077\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid TabContents::SetupController(Profile* profile) {\n  DCHECK(!controller_);\n  controller_ = new NavigationController(this, profile);\n}\n\nProfile* TabContents::profile() const {\n  return controller_ ? controller_->profile() : NULL;\n}\n\nvoid TabContents::CloseContents() {\n  \/\/ Destroy our NavigationController, which will Destroy all tabs it owns.\n  controller_->Destroy();\n  \/\/ Note that the controller may have deleted us at this point,\n  \/\/ so don't touch any member variables here.\n}\n\nvoid TabContents::Destroy() {\n  \/\/ TODO(pinkerton): this isn't the real version of Destroy(), just enough to\n  \/\/ get the scaffolding working.\n\n  is_being_destroyed_ = true;\n\n  \/\/ Notify any observer that have a reference on this tab contents.\n  NotificationService::current()->Notify(\n      NotificationType::TAB_CONTENTS_DESTROYED,\n      Source<TabContents>(this),\n      NotificationService::NoDetails());\n\n  \/\/ Notify our NavigationController.  Make sure we are deleted first, so\n  \/\/ that the controller is the last to die.\n  NavigationController* controller = controller_;\n  TabContentsType type = this->type();\n\n  delete this;\n\n  controller->TabContentsWasDestroyed(type);\n}\n\nconst GURL& TabContents::GetURL() const {\n  \/\/ We may not have a navigation entry yet\n  NavigationEntry* entry = controller_->GetActiveEntry();\n  return entry ? entry->display_url() : GURL::EmptyGURL();\n}\n\nconst std::wstring& TabContents::GetTitle() const {\n  \/\/ We use the title for the last committed entry rather than a pending\n  \/\/ navigation entry. For example, when the user types in a URL, we want to\n  \/\/ keep the old page's title until the new load has committed and we get a new\n  \/\/ title.\n  \/\/ The exception is with transient pages, for which we really want to use\n  \/\/ their title, as they are not committed.\n  NavigationEntry* entry = controller_->GetTransientEntry();\n  if (entry)\n    return entry->GetTitleForDisplay();\n\n  entry = controller_->GetLastCommittedEntry();\n  if (entry)\n    return entry->GetTitleForDisplay();\n  else if (controller_->LoadingURLLazily())\n    return controller_->GetLazyTitle();\n  return EmptyWString();\n}\n\nvoid TabContents::NotifyNavigationStateChanged(unsigned changed_flags) {\n  if (delegate_)\n    delegate_->NavigationStateChanged(this, changed_flags);\n}\n\nvoid TabContents::OpenURL(const GURL& url, const GURL& referrer,\n                          WindowOpenDisposition disposition,\n                          PageTransition::Type transition) {\n  if (delegate_)\n    delegate_->OpenURLFromTab(this, url, referrer, disposition, transition);\n}\n\nvoid TabContents::SetIsLoading(bool is_loading,\n                               LoadNotificationDetails* details) {\n  \/\/ TODO(port): this is a subset of SetIsLoading() as a stub\n  is_loading_ = is_loading;\n}\n\nbool TabContents::SupportsURL(GURL* url) {\n  GURL u(*url);\n  if (TabContents::TypeForURL(&u) == type()) {\n    *url = u;\n    return true;\n  }\n  return false;\n}\n\nint32 TabContents::GetMaxPageID() {\n  if (GetSiteInstance())\n    return GetSiteInstance()->max_page_id();\n  else\n    return max_page_id_;\n}\n\nvoid TabContents::UpdateMaxPageID(int32 page_id) {\n  \/\/ Ensure both the SiteInstance and RenderProcessHost update their max page\n  \/\/ IDs in sync. Only WebContents will also have site instances, except during\n  \/\/ testing.\n  if (GetSiteInstance())\n    GetSiteInstance()->UpdateMaxPageID(page_id);\n\n  if (AsWebContents())\n    AsWebContents()->process()->UpdateMaxPageID(page_id);\n  else\n    max_page_id_ = std::max(max_page_id_, page_id);\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid RLZTracker::CleanupRlz() {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n}\n\nbool RLZTracker::GetAccessPointRlz(AccessPoint point, std::wstring* rlz) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n  return false;\n}\n\nbool RLZTracker::RecordProductEvent(Product product, AccessPoint point,\n                                    Event event) {\n  \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=8152\n  return false;\n}\n\n\/\/ This depends on porting all the plugin IPC messages.\nbool IsPluginProcess() {\n  return false;\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid RunJavascriptMessageBox(WebContents* web_contents,\n                             int dialog_flags,\n                             const std::wstring& message_text,\n                             const std::wstring& default_prompt_text,\n                             bool display_suppress_checkbox,\n                             IPC::Message* reply_msg) {\n  NOTIMPLEMENTED();\n}\n\nvoid RunBeforeUnloadDialog(WebContents* web_contents,\n                           const std::wstring& message_text,\n                           IPC::Message* reply_msg) {\n  NOTIMPLEMENTED();\n}\n\n\/\/--------------------------------------------------------------------------\n\nvoid RunRepostFormWarningDialog(NavigationController*) {\n}\n\nLoginHandler* CreateLoginPrompt(net::AuthChallengeInfo* auth_info,\n                                URLRequest* request,\n                                MessageLoop* ui_loop) {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nvoid ProcessWatcher::EnsureProcessTerminated(int) {\n  NOTIMPLEMENTED();\n}\n\n\n\/\/--------------------------------------------------------------------------\nnamespace webkit_glue {\n\nbool IsDefaultPluginEnabled() {\n  NOTIMPLEMENTED();\n  return false;\n}\n\n#if defined(OS_MACOSX)\nbool ClipboardIsFormatAvailable(Clipboard::FormatType format) {\n  NOTIMPLEMENTED();\n  return false;\n}\n#endif\n\n}  \/\/ webkit_glue\n\n#ifndef CHROME_DEBUGGER_DISABLED\nDebuggerShell::DebuggerShell(DebuggerInputOutput *io) { }\nDebuggerShell::~DebuggerShell() { }\nvoid DebuggerShell::Start() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::Debug(TabContents* tab) { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DebugMessage(const std::wstring& msg) { NOTIMPLEMENTED(); }\nvoid DebuggerShell::OnDebugAttach() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::OnDebugDisconnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DidConnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::DidDisconnect() { NOTIMPLEMENTED(); }\nvoid DebuggerShell::ProcessCommand(const std::wstring& data) {\n  NOTIMPLEMENTED();\n}\n#endif  \/\/ !CHROME_DEBUGGER_DISABLED\n\nMemoryDetails::MemoryDetails() {\n  NOTIMPLEMENTED();\n}\n\nvoid MemoryDetails::StartFetch() {\n  NOTIMPLEMENTED();\n}\n\nInfoBar* ConfirmInfoBarDelegate::CreateInfoBar() {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nInfoBar* AlertInfoBarDelegate::CreateInfoBar() {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nInfoBar* LinkInfoBarDelegate::CreateInfoBar() {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nbool CanImportURL(const GURL& url) {\n  NOTIMPLEMENTED();\n  return false;\n}\n\nDownloadRequestDialogDelegate* DownloadRequestDialogDelegate::Create(\n    TabContents* tab,\n    DownloadRequestManager::TabDownloadState* host) {\n  NOTIMPLEMENTED();\n  return NULL;\n}\n\nviews::Window* CreateInputWindow(gfx::NativeWindow parent_hwnd,\n                                 InputWindowDelegate* delegate) {\n  NOTIMPLEMENTED();\n  return new views::Window();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n  Copyright 1995 The University of Rhode Island and The Massachusetts\n  Institute of Technology\n\n  Portions of this software were developed by the Graduate School of\n  Oceanography (GSO) at the University of Rhode Island (URI) in collaboration\n  with The Massachusetts Institute of Technology (MIT).\n\n  Access and use of this software shall impose the following obligations and\n  understandings on the user. The user is granted the right, without any fee\n  or cost, to use, copy, modify, alter, enhance and distribute this software,\n  and any derivative works thereof, and its supporting documentation for any\n  purpose whatsoever, provided that this entire notice appears in all copies\n  of the software, derivative works and supporting documentation.  Further,\n  the user agrees to credit URI\/MIT in any publications that result from the\n  use of this software or in any product that includes this software. The\n  names URI, MIT and\/or GSO, however, may not be used in any advertising or\n  publicity to endorse or promote any products or commercial entity unless\n  specific written permission is obtained from URI\/MIT. The user also\n  understands that URI\/MIT is not obligated to provide the user with any\n  support, consulting, training or assistance of any kind with regard to the\n  use, operation and performance of this software nor to provide the user\n  with any updates, revisions, new versions or \"bug fixes\".\n\n  THIS SOFTWARE IS PROVIDED BY URI\/MIT \"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 URI\/MIT BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL\n  DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\n  PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTUOUS\n  ACTION, ARISING OUT OF OR IN CONNECTION WITH THE ACCESS, USE OR PERFORMANCE\n  OF THIS SOFTWARE.\n*\/\n\n\/\/ Implementation for TestArray. See TestByte.cc\n\/\/\n\/\/ jhrg 1\/12\/95\n\n\/\/ $Log: TestArray.cc,v $\n\/\/ Revision 1.7  1995\/07\/09 21:29:07  jimg\n\/\/ Added copyright notice.\n\/\/\n\/\/ Revision 1.6  1995\/05\/10  13:45:34  jimg\n\/\/ Changed the name of the configuration header file from `config.h' to\n\/\/ `config_dap.h' so that other libraries could have header files which were\n\/\/ installed in the DODS include directory without overwriting this one. Each\n\/\/ config header should follow the convention config_<name>.h.\n\/\/\n\/\/ Revision 1.5  1995\/03\/16  17:32:27  jimg\n\/\/ Fixed bugs with read()s new & delete calls.\n\/\/\n\/\/ Revision 1.4  1995\/03\/04  14:38:00  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:37  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:58:50  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:34  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 \"config_dap.h\"\n\n#include <assert.h>\n\n#include \"TestArray.h\"\n\n#ifdef TRACE_NEW\n#include \"trace_new.h\"\n#endif\n\nArray *\nNewArray(const String &n, BaseType *v)\n{\n    return new TestArray(n, v);\n}\n\nBaseType *\nTestArray::ptr_duplicate()\n{\n    return new TestArray(*this);\n}\n\nTestArray::TestArray(const String &n, BaseType *v) : Array(n, v)\n{\n}\n\nTestArray::~TestArray()\n{\n}\n\nbool\nTestArray::read(String dataset, String var_name, String constraint)\n{\n    unsigned int wid = var()->width(); \/\/ size of the contained variable\n\n    \/\/ run read() on the contained variable to get, via the read() mfuncs\n    \/\/ defined in the other Test classes, a value in the *contained* object.\n    var()->read(dataset, var_name, constraint);\n\n    \/\/ OK, now make an array of those things, and copy the value length()\n    \/\/ times. \n    unsigned int len = length();\n    char *tmp = new char[width()];\n    void *elem_val = 0;\t\t\/\/ the null forces a new object to be\n\t\t\t\t\/\/ allocated \n\n    var()->read_val(&elem_val);\t\/\/ read_val() allocates space as an array...\n\n    for (int i = 0; i < len; ++i)\n\tmemcpy(tmp + i * wid, elem_val, wid);\n\n    store_val(tmp);\n\n    delete[] elem_val;\n    delete[] tmp;\n}\n<commit_msg>Fixed the read() member function so that it works correctly for arrays\/lists of Structure, ... types.<commit_after>\n\/*\n  Copyright 1995 The University of Rhode Island and The Massachusetts\n  Institute of Technology\n\n  Portions of this software were developed by the Graduate School of\n  Oceanography (GSO) at the University of Rhode Island (URI) in collaboration\n  with The Massachusetts Institute of Technology (MIT).\n\n  Access and use of this software shall impose the following obligations and\n  understandings on the user. The user is granted the right, without any fee\n  or cost, to use, copy, modify, alter, enhance and distribute this software,\n  and any derivative works thereof, and its supporting documentation for any\n  purpose whatsoever, provided that this entire notice appears in all copies\n  of the software, derivative works and supporting documentation.  Further,\n  the user agrees to credit URI\/MIT in any publications that result from the\n  use of this software or in any product that includes this software. The\n  names URI, MIT and\/or GSO, however, may not be used in any advertising or\n  publicity to endorse or promote any products or commercial entity unless\n  specific written permission is obtained from URI\/MIT. The user also\n  understands that URI\/MIT is not obligated to provide the user with any\n  support, consulting, training or assistance of any kind with regard to the\n  use, operation and performance of this software nor to provide the user\n  with any updates, revisions, new versions or \"bug fixes\".\n\n  THIS SOFTWARE IS PROVIDED BY URI\/MIT \"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 URI\/MIT BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL\n  DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\n  PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTUOUS\n  ACTION, ARISING OUT OF OR IN CONNECTION WITH THE ACCESS, USE OR PERFORMANCE\n  OF THIS SOFTWARE.\n*\/\n\n\/\/ Implementation for TestArray. See TestByte.cc\n\/\/\n\/\/ jhrg 1\/12\/95\n\n\/\/ $Log: TestArray.cc,v $\n\/\/ Revision 1.8  1995\/08\/23 00:50:01  jimg\n\/\/ Fixed the read() member function so that it works correctly for arrays\/lists\n\/\/ of Structure, ... types.\n\/\/\n\/\/ Revision 1.7  1995\/07\/09  21:29:07  jimg\n\/\/ Added copyright notice.\n\/\/\n\/\/ Revision 1.6  1995\/05\/10  13:45:34  jimg\n\/\/ Changed the name of the configuration header file from `config.h' to\n\/\/ `config_dap.h' so that other libraries could have header files which were\n\/\/ installed in the DODS include directory without overwriting this one. Each\n\/\/ config header should follow the convention config_<name>.h.\n\/\/\n\/\/ Revision 1.5  1995\/03\/16  17:32:27  jimg\n\/\/ Fixed bugs with read()s new & delete calls.\n\/\/\n\/\/ Revision 1.4  1995\/03\/04  14:38:00  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:37  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:58:50  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:34  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 \"config_dap.h\"\n\n#include <assert.h>\n\n#include \"TestArray.h\"\n\n#ifdef TRACE_NEW\n#include \"trace_new.h\"\n#endif\n\nArray *\nNewArray(const String &n, BaseType *v)\n{\n    return new TestArray(n, v);\n}\n\nBaseType *\nTestArray::ptr_duplicate()\n{\n    return new TestArray(*this);\n}\n\nTestArray::TestArray(const String &n, BaseType *v) : Array(n, v)\n{\n}\n\nTestArray::~TestArray()\n{\n}\n\n\/\/ This read mfunc does some strange things to get a value - a real program\n\/\/ would never get values this way. For testing this is OK.\n\nbool\nTestArray::read(String dataset, String var_name, String constraint)\n{\n    int i;\n\n    \/\/ run read() on the contained variable to get, via the read() mfuncs\n    \/\/ defined in the other Test classes, a value in the *contained* object.\n    var()->read(dataset, var_name, constraint);\n\n    unsigned int array_len = length(); \/\/ elements in the array\n\n    switch (var()->type()) {\n      case byte_t:\n      case int32_t:\n      case float64_t:\n      case str_t:\n      case url_t:\n\n\t\/\/ String and Url are grouped with byte, ... because val2buf works\n\t\/\/ for these types.\n\n\tunsigned int elem_wid = var()->width(); \/\/ size of an element\n\n\tchar *tmp = new char[width()];\n\tvoid *elem_val = 0;\t\/\/ NULL init gets read_val() to alloc space\n\n\tvar()->buf2val(&elem_val); \/\/ internal buffer to ELEM_VAL\n\n\tfor (i = 0; i < array_len; ++i)\n\t    memcpy(tmp + i * elem_wid, elem_val, elem_wid);\n\n\n\tval2buf(tmp);\n\n\tdelete[] elem_val;\t\/\/ alloced in read_val()\n\tdelete[] tmp;\t\t\/\/ alloced above\n\n\tbreak;\n\n      case list_t:\n      case structure_t:\n      case sequence_t:\n      case function_t:\n      case grid_t:\n\t\n\t\/\/ Arrays of Structure, ... must load each element into the array \n\t\/\/ manually. Because these are stored as C++\/DODS objects, there is\n\t\/\/ no need to manipulate blocks of memory by hand as in the above\n\t\/\/ case. \n        \/\/ NB: Strings are handled like Byte, etc. because, even though they\n\t\/\/ are represented using C++ objects they are *not* represented using\n\t\/\/ objects defined by DODS, while Structure, etc. are.\n\n\tfor (i = 0; i < array_len; ++i) {\n\n\t    \/\/ Create a new object that is a copy of `var()' (whatever that\n\t    \/\/ is. The copy will have the value rad in by the read() mfunc\n\t    \/\/ executed before this switch stmt.\n\n\t    BaseType *elem = var()->ptr_duplicate(); \n\n\t    \/\/ now load the new instance in the array.\n\n\t    set_vec(i, elem);\n\t}\n\n\tbreak;\n\n    }\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/  File: linuxHostsupport.cpp\r\n\/\/      John Manferdelli\r\n\/\/  Description:  Support for Linux host as trusted OS\r\n\/\/\r\n\/\/  Copyright (c) 2012, John Manferdelli\r\n\/\/  Some contributions copyright (c) 2012, Intel Corporation\r\n\/\/\r\n\/\/ Use, duplication and disclosure of this file and derived works of\r\n\/\/ this file are subject to and licensed under the Apache License dated\r\n\/\/ January, 2004, (the \"License\").  This License is contained in the\r\n\/\/ top level directory originally provided with the CloudProxy Project.\r\n\/\/ Your right to use or distribute this file, or derived works thereof,\r\n\/\/ is subject to your being bound by those terms and your use indicates\r\n\/\/ consent to those terms.\r\n\/\/\r\n\/\/ If you distribute this file (or portions derived therefrom), you must\r\n\/\/ include License in or with the file and, in the event you do not include\r\n\/\/ the entire License in the file, the file must contain a reference\r\n\/\/ to the location of the License.\r\n\r\n#include \"jlmTypes.h\"\r\n#include \"logging.h\"\r\n#include \"jlmcrypto.h\"\r\n#include \"jlmUtility.h\"\r\n#include \"modesandpadding.h\"\r\n#include \"sha256.h\"\r\n#include \"tao.h\"\r\n#include \"bignum.h\"\r\n#include \"mpFunctions.h\"\r\n#include \"cryptoHelper.h\"\r\n#include \"trustedKeyNego.h\"\r\n#include \"tcIO.h\"\r\n#include \"buffercoding.h\"\r\n#include \"tcService.h\"\r\n#include <string.h>\r\n#include <time.h>\r\n\r\n\r\n\/\/ -------------------------------------------------------------------------\r\n\r\n\r\n\/\/\r\n\/\/   Service support from LINUX\r\n\/\/\r\n\r\n\r\n\/\/ request channel to device driver\r\ntcChannel   g_reqChannel;\r\nint         g_myPid= -1;\r\n\r\n\r\nbool initLinuxService(const char* name)\r\n{\r\n#ifdef TCTEST\r\n    if(name!=NULL)\r\n        fprintf(g_logFile, \"initLinuxService started %s\\n\", name);\r\n    else\r\n        fprintf(g_logFile, \"initLinuxService started no childname\\n\");\r\n#endif\r\n\r\n    g_myPid= getpid();\r\n    if(!g_reqChannel.OpenBuf(TCDEVICEDRIVER, 0, name ,0)) {\r\n        fprintf(g_logFile, \"initLinuxService: OpenBuf returned false \\n\");\r\n        return false;\r\n    }\r\n\r\n#ifdef TCTEST\r\n    fprintf(g_logFile, \"initLinuxService returns true\\n\");\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool closeLinuxService()\r\n{\r\n    g_reqChannel.CloseBuf();\r\n    return true;\r\n}\r\n\r\n\r\nbool getEntropyfromDeviceDriver(int size, byte* pKey)\r\n{\r\n    return false;\r\n}\r\n\r\n\r\nbool getprogramNamefromDeviceDriver(int* pSize, const char* szName)\r\n{\r\n    \/\/ this is done elsewhere\r\n    return true;\r\n}\r\n\r\n\r\nbool getpolicykeyfromDeviceDriver(u32* pkeyType, int* pSize, byte* pKey)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= PARAMSIZE;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICEGETPOLICYKEYFROMAPP, 0, \r\n                               g_myPid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"getpolicykeyfromDeviceDriver: sendtcBuf for encodeTCSERVICEPOLICYKEYFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"getpolicykeyfromDeviceDriver: gettcBuf for encodeTCSERVICEPOLICYKEYFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICEGETPOLICYKEYFROMOS(pkeyType, pSize, pKey, rgBuf)) {\r\n        fprintf(g_logFile, \"getpolicykeyfromDeviceDriver: gettcBuf for decodeTCSERVICEPOLICYKEYFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST1\r\n    PrintBytes(\"Policy key: \", pKey, *pSize);\r\n#endif\r\n    fprintf(g_logFile, \"getpolicykeyfromDeviceDriverOS parent returns true\\n\");\r\n    return true;\r\n}\r\n\r\n\r\nbool getOSMeasurementfromDeviceDriver(u32* phashType, int* pSize, byte* pHash)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= 0;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver\\n\");\r\n#endif\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICEGETOSHASHFROMAPP, 0, \r\n                               g_myPid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver: sendtcBuf for encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver: gettcBuf for encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICEGETOSHASHFROMTCSERVICE(phashType, pSize, pHash, rgBuf)) {\r\n        fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver: gettcBuf for decodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST\r\n    PrintBytes(\"OS hash: \", pHash, *pSize);\r\n#endif\r\n    fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver OS parent returns true\\n\");\r\n    return true;\r\n}\r\n\r\n\r\nbool getHostedMeasurementfromDeviceDriver(int childproc, u32* phashType, \r\n                                          int* pSize, byte* pHash)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= PARAMSIZE;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"getHostedMeasurementfromDeviceDriver\\n\");\r\n#endif\r\n    \/\/ Does my pid have valid hash?\r\n    size= encodeTCSERVICEGETPROGHASHFROMAPP(childproc, 1024, rgBuf);\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICEGETPROGHASHFROMAPP,\r\n                        0, g_myPid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"getHostedMeasurementfromDeviceDriver: sendtcBuf for TCSERVICEGETPROGHASHFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"getHostedMeasurementfromDeviceDriver: gettcBuf for TCSERVICEGETPROGHASHFROMAPP failed\\n\");\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!decodeTCSERVICEGETPROGHASHFROMSERVICE(phashType, pSize, pHash, 1024, rgBuf)) {\r\n        fprintf(g_logFile, \"getHostedMeasurementfromDeviceDriver: cant decode os hash\\n\");\r\n        return false;\r\n    }\r\n\r\n#ifdef TEST\r\n    PrintBytes(\"getHostedMeasurementfromDeviceDriver prog hash: \", pHash, *pSize);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool startAppfromDeviceDriver(const char* szexecFile, int* ppid,\r\n    int argc, char **argv)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= PARAMSIZE;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n    size= encodeTCSERVICESTARTAPPFROMAPP(szexecFile, argc, argv, PARAMSIZE, rgBuf);\r\n    if(size<0) {\r\n        fprintf(g_logFile, \"startProcessLinuxService: encodeTCSERVICESTARTAPPFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICESTARTAPPFROMAPP, 0, g_myPid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"startProcessLinuxService: sendtcBuf for TCSERVICESTARTAPPFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"startProcessLinuxService: gettcBuf for TCSERVICESTARTAPPFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICESTARTAPPFROMTCSERVICE(ppid, rgBuf)) {\r\n        fprintf(g_logFile, \"startProcessLinuxService: cant decode childproc\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"startProcessLinuxService: Process created: %d by servicepid %d\\n\", \r\n            *ppid, g_myPid);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool sealfromDeviceDriver(int inSize, byte* inData, int* poutSize, byte* outData)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= 0;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"sealwithLinuxService(%d)\\n\", inSize);\r\n#endif\r\n    memset(outData, 0, *poutSize);\r\n    size= encodeTCSERVICESEALFORFROMAPP(inSize, inData, PARAMSIZE, rgBuf);\r\n    if(size<0) {\r\n        fprintf(g_logFile, \"sealwithLinuxService: encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!g_reqChannel.sendtcBuf(getpid(), TCSERVICESEALFORFROMAPP, 0, \r\n                               getpid(), size, rgBuf)) {\r\n        fprintf(g_logFile, \"sealwithLinuxService: sendtcBuf for encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"sealwithLinuxService: gettcBuf for encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICESEALFORFROMTCSERVICE(poutSize, outData, rgBuf)) {\r\n        fprintf(g_logFile, \"sealwithLinuxService: gettcBuf for decodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TCTEST1\r\n    PrintBytes(\"To seal: \", inData, inSize);\r\n    PrintBytes(\"Sealed :\", outData, *poutSize);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool unsealfromDeviceDriver(int inSize, byte* inData, int* poutSize, byte* outData)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= 0;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"unsealwithLinuxService(%d)\\n\", inSize);\r\n#endif\r\n    memset(outData, 0, *poutSize);\r\n    size= encodeTCSERVICEUNSEALFORFROMAPP(inSize, inData, PARAMSIZE, rgBuf);\r\n    if(size<0) {\r\n        fprintf(g_logFile, \"unsealwithLinuxService: encodeTCSERVICEUNSEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!g_reqChannel.sendtcBuf(getpid(), TCSERVICEUNSEALFORFROMAPP, 0, getpid(), size, rgBuf)) {\r\n        fprintf(g_logFile, \"unsealwithLinuxService: sendtcBuf for TCSERVICEUNSEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"unsealwithLinuxService: gettcBuf for TCSERVICEUNSEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICEUNSEALFORFROMTCSERVICE(poutSize, outData, rgBuf)) {\r\n        fprintf(g_logFile, \"unsealwithLinuxService: gettcBuf for decodeTCSERVICESEALFORFROMTCSERVICE failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TCTEST1\r\n    PrintBytes(\"To unseal: \", inData, inSize);\r\n    PrintBytes(\"Unsealed : \", outData, *poutSize);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool quotefromDeviceDriver(int inSize, byte* inData, int* poutSize, byte* outData)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= 0;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"quotewithLinuxService(%d, %d)\\n\", inSize, *poutSize);\r\n#endif\r\n    memset(outData, 0, *poutSize);\r\n    size= encodeTCSERVICEATTESTFORFROMAPP(inSize, inData, PARAMSIZE, rgBuf);\r\n    if(size<0) {\r\n        fprintf(g_logFile, \"quotewithLinuxService: encodeTCSERVICEATTESTFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST1\r\n    fprintf(g_logFile, \"quotewithLinuxService: sending %d\\n\", inSize);\r\n    PrintBytes(\" req buffer: \", inData, inSize); \r\n    fflush(g_logFile);\r\n#endif\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICEATTESTFORFROMAPP, 0, procid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"quotewithLinuxService: sendtcBuf for TCSERVICEATTESTFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"quotewithLinuxService: gettcBuf for TCSERVICEATTESTFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST1\r\n    fprintf(g_logFile, \"quotewithLinuxService: rgBufsize is %d, status: %d\\n\", \r\n            size, ustatus);\r\n#endif\r\n    if(!decodeTCSERVICEATTESTFORFROMTCSERVICE(poutSize, outData, rgBuf)) {\r\n        fprintf(g_logFile, \"quotewithLinuxService: gettcBuf for decodeTCSERVICEATTESTFORFROMTCSERVICEfailed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST1\r\n    fprintf(g_logFile, \"quotewithLinuxService: outsize is %d\\n\", *poutSize);\r\n    PrintBytes(\"To quote: \", inData, inSize);\r\n    PrintBytes(\"Quoted : \", outData, *poutSize);\r\n    fflush(g_logFile);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\n\/\/ -------------------------------------------------------------------------\r\n\r\n\r\n<commit_msg>turned on a debug in initLinuxservice<commit_after>\/\/  File: linuxHostsupport.cpp\r\n\/\/      John Manferdelli\r\n\/\/  Description:  Support for Linux host as trusted OS\r\n\/\/\r\n\/\/  Copyright (c) 2012, John Manferdelli\r\n\/\/  Some contributions copyright (c) 2012, Intel Corporation\r\n\/\/\r\n\/\/ Use, duplication and disclosure of this file and derived works of\r\n\/\/ this file are subject to and licensed under the Apache License dated\r\n\/\/ January, 2004, (the \"License\").  This License is contained in the\r\n\/\/ top level directory originally provided with the CloudProxy Project.\r\n\/\/ Your right to use or distribute this file, or derived works thereof,\r\n\/\/ is subject to your being bound by those terms and your use indicates\r\n\/\/ consent to those terms.\r\n\/\/\r\n\/\/ If you distribute this file (or portions derived therefrom), you must\r\n\/\/ include License in or with the file and, in the event you do not include\r\n\/\/ the entire License in the file, the file must contain a reference\r\n\/\/ to the location of the License.\r\n\r\n#include \"jlmTypes.h\"\r\n#include \"logging.h\"\r\n#include \"jlmcrypto.h\"\r\n#include \"jlmUtility.h\"\r\n#include \"modesandpadding.h\"\r\n#include \"sha256.h\"\r\n#include \"tao.h\"\r\n#include \"bignum.h\"\r\n#include \"mpFunctions.h\"\r\n#include \"cryptoHelper.h\"\r\n#include \"trustedKeyNego.h\"\r\n#include \"tcIO.h\"\r\n#include \"buffercoding.h\"\r\n#include \"tcService.h\"\r\n#include <string.h>\r\n#include <time.h>\r\n\r\n\r\n\/\/ -------------------------------------------------------------------------\r\n\r\n\r\n\/\/\r\n\/\/   Service support from LINUX\r\n\/\/\r\n\r\n\r\n\/\/ request channel to device driver\r\ntcChannel   g_reqChannel;\r\nint         g_myPid= -1;\r\n\r\n\r\nbool initLinuxService(const char* name)\r\n{\r\n#ifdef TEST\r\n    if(name!=NULL)\r\n        fprintf(g_logFile, \"initLinuxService started %s\\n\", name);\r\n    else\r\n        fprintf(g_logFile, \"initLinuxService started no childname\\n\");\r\n#endif\r\n\r\n    g_myPid= getpid();\r\n    if(!g_reqChannel.OpenBuf(TCDEVICEDRIVER, 0, name ,0)) {\r\n        fprintf(g_logFile, \"initLinuxService: OpenBuf returned false \\n\");\r\n        return false;\r\n    }\r\n\r\n#ifdef TCTEST\r\n    fprintf(g_logFile, \"initLinuxService returns true\\n\");\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool closeLinuxService()\r\n{\r\n    g_reqChannel.CloseBuf();\r\n    return true;\r\n}\r\n\r\n\r\nbool getEntropyfromDeviceDriver(int size, byte* pKey)\r\n{\r\n    return false;\r\n}\r\n\r\n\r\nbool getprogramNamefromDeviceDriver(int* pSize, const char* szName)\r\n{\r\n    \/\/ this is done elsewhere\r\n    return true;\r\n}\r\n\r\n\r\nbool getpolicykeyfromDeviceDriver(u32* pkeyType, int* pSize, byte* pKey)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= PARAMSIZE;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICEGETPOLICYKEYFROMAPP, 0, \r\n                               g_myPid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"getpolicykeyfromDeviceDriver: sendtcBuf for encodeTCSERVICEPOLICYKEYFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"getpolicykeyfromDeviceDriver: gettcBuf for encodeTCSERVICEPOLICYKEYFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICEGETPOLICYKEYFROMOS(pkeyType, pSize, pKey, rgBuf)) {\r\n        fprintf(g_logFile, \"getpolicykeyfromDeviceDriver: gettcBuf for decodeTCSERVICEPOLICYKEYFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST1\r\n    PrintBytes(\"Policy key: \", pKey, *pSize);\r\n#endif\r\n    fprintf(g_logFile, \"getpolicykeyfromDeviceDriverOS parent returns true\\n\");\r\n    return true;\r\n}\r\n\r\n\r\nbool getOSMeasurementfromDeviceDriver(u32* phashType, int* pSize, byte* pHash)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= 0;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver\\n\");\r\n#endif\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICEGETOSHASHFROMAPP, 0, \r\n                               g_myPid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver: sendtcBuf for encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver: gettcBuf for encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICEGETOSHASHFROMTCSERVICE(phashType, pSize, pHash, rgBuf)) {\r\n        fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver: gettcBuf for decodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST\r\n    PrintBytes(\"OS hash: \", pHash, *pSize);\r\n#endif\r\n    fprintf(g_logFile, \"getOSMeasurementfromDeviceDriver OS parent returns true\\n\");\r\n    return true;\r\n}\r\n\r\n\r\nbool getHostedMeasurementfromDeviceDriver(int childproc, u32* phashType, \r\n                                          int* pSize, byte* pHash)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= PARAMSIZE;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"getHostedMeasurementfromDeviceDriver\\n\");\r\n#endif\r\n    \/\/ Does my pid have valid hash?\r\n    size= encodeTCSERVICEGETPROGHASHFROMAPP(childproc, 1024, rgBuf);\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICEGETPROGHASHFROMAPP,\r\n                        0, g_myPid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"getHostedMeasurementfromDeviceDriver: sendtcBuf for TCSERVICEGETPROGHASHFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"getHostedMeasurementfromDeviceDriver: gettcBuf for TCSERVICEGETPROGHASHFROMAPP failed\\n\");\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!decodeTCSERVICEGETPROGHASHFROMSERVICE(phashType, pSize, pHash, 1024, rgBuf)) {\r\n        fprintf(g_logFile, \"getHostedMeasurementfromDeviceDriver: cant decode os hash\\n\");\r\n        return false;\r\n    }\r\n\r\n#ifdef TEST\r\n    PrintBytes(\"getHostedMeasurementfromDeviceDriver prog hash: \", pHash, *pSize);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool startAppfromDeviceDriver(const char* szexecFile, int* ppid,\r\n    int argc, char **argv)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= PARAMSIZE;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n    size= encodeTCSERVICESTARTAPPFROMAPP(szexecFile, argc, argv, PARAMSIZE, rgBuf);\r\n    if(size<0) {\r\n        fprintf(g_logFile, \"startProcessLinuxService: encodeTCSERVICESTARTAPPFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICESTARTAPPFROMAPP, 0, g_myPid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"startProcessLinuxService: sendtcBuf for TCSERVICESTARTAPPFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"startProcessLinuxService: gettcBuf for TCSERVICESTARTAPPFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICESTARTAPPFROMTCSERVICE(ppid, rgBuf)) {\r\n        fprintf(g_logFile, \"startProcessLinuxService: cant decode childproc\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"startProcessLinuxService: Process created: %d by servicepid %d\\n\", \r\n            *ppid, g_myPid);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool sealfromDeviceDriver(int inSize, byte* inData, int* poutSize, byte* outData)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= 0;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"sealwithLinuxService(%d)\\n\", inSize);\r\n#endif\r\n    memset(outData, 0, *poutSize);\r\n    size= encodeTCSERVICESEALFORFROMAPP(inSize, inData, PARAMSIZE, rgBuf);\r\n    if(size<0) {\r\n        fprintf(g_logFile, \"sealwithLinuxService: encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!g_reqChannel.sendtcBuf(getpid(), TCSERVICESEALFORFROMAPP, 0, \r\n                               getpid(), size, rgBuf)) {\r\n        fprintf(g_logFile, \"sealwithLinuxService: sendtcBuf for encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"sealwithLinuxService: gettcBuf for encodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICESEALFORFROMTCSERVICE(poutSize, outData, rgBuf)) {\r\n        fprintf(g_logFile, \"sealwithLinuxService: gettcBuf for decodeTCSERVICESEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TCTEST1\r\n    PrintBytes(\"To seal: \", inData, inSize);\r\n    PrintBytes(\"Sealed :\", outData, *poutSize);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool unsealfromDeviceDriver(int inSize, byte* inData, int* poutSize, byte* outData)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= 0;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"unsealwithLinuxService(%d)\\n\", inSize);\r\n#endif\r\n    memset(outData, 0, *poutSize);\r\n    size= encodeTCSERVICEUNSEALFORFROMAPP(inSize, inData, PARAMSIZE, rgBuf);\r\n    if(size<0) {\r\n        fprintf(g_logFile, \"unsealwithLinuxService: encodeTCSERVICEUNSEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!g_reqChannel.sendtcBuf(getpid(), TCSERVICEUNSEALFORFROMAPP, 0, getpid(), size, rgBuf)) {\r\n        fprintf(g_logFile, \"unsealwithLinuxService: sendtcBuf for TCSERVICEUNSEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"unsealwithLinuxService: gettcBuf for TCSERVICEUNSEALFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    if(!decodeTCSERVICEUNSEALFORFROMTCSERVICE(poutSize, outData, rgBuf)) {\r\n        fprintf(g_logFile, \"unsealwithLinuxService: gettcBuf for decodeTCSERVICESEALFORFROMTCSERVICE failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TCTEST1\r\n    PrintBytes(\"To unseal: \", inData, inSize);\r\n    PrintBytes(\"Unsealed : \", outData, *poutSize);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\nbool quotefromDeviceDriver(int inSize, byte* inData, int* poutSize, byte* outData)\r\n{\r\n    u32         ustatus;\r\n    u32         ureq;\r\n    int         procid;\r\n    int         origprocid;\r\n    int         size= 0;\r\n    byte        rgBuf[PARAMSIZE];\r\n\r\n#ifdef TEST\r\n    fprintf(g_logFile, \"quotewithLinuxService(%d, %d)\\n\", inSize, *poutSize);\r\n#endif\r\n    memset(outData, 0, *poutSize);\r\n    size= encodeTCSERVICEATTESTFORFROMAPP(inSize, inData, PARAMSIZE, rgBuf);\r\n    if(size<0) {\r\n        fprintf(g_logFile, \"quotewithLinuxService: encodeTCSERVICEATTESTFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST1\r\n    fprintf(g_logFile, \"quotewithLinuxService: sending %d\\n\", inSize);\r\n    PrintBytes(\" req buffer: \", inData, inSize); \r\n    fflush(g_logFile);\r\n#endif\r\n    if(!g_reqChannel.sendtcBuf(g_myPid, TCSERVICEATTESTFORFROMAPP, 0, procid, size, rgBuf)) {\r\n        fprintf(g_logFile, \"quotewithLinuxService: sendtcBuf for TCSERVICEATTESTFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n    size= PARAMSIZE;\r\n    if(!g_reqChannel.gettcBuf(&procid, &ureq, &ustatus, &origprocid, &size, rgBuf)) {\r\n        fprintf(g_logFile, \"quotewithLinuxService: gettcBuf for TCSERVICEATTESTFORFROMAPP failed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST1\r\n    fprintf(g_logFile, \"quotewithLinuxService: rgBufsize is %d, status: %d\\n\", \r\n            size, ustatus);\r\n#endif\r\n    if(!decodeTCSERVICEATTESTFORFROMTCSERVICE(poutSize, outData, rgBuf)) {\r\n        fprintf(g_logFile, \"quotewithLinuxService: gettcBuf for decodeTCSERVICEATTESTFORFROMTCSERVICEfailed\\n\");\r\n        return false;\r\n    }\r\n#ifdef TEST1\r\n    fprintf(g_logFile, \"quotewithLinuxService: outsize is %d\\n\", *poutSize);\r\n    PrintBytes(\"To quote: \", inData, inSize);\r\n    PrintBytes(\"Quoted : \", outData, *poutSize);\r\n    fflush(g_logFile);\r\n#endif\r\n    return true;\r\n}\r\n\r\n\r\n\/\/ -------------------------------------------------------------------------\r\n\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: mediacontrol.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 19:34: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 _AVMEDIA_MEDIACONTROL_HXX\n#define _AVMEDIA_MEDIACONTROL_HXX\n\n#include \"mediaitem.hxx\"\n\n#include <vcl\/timer.hxx>\n#include <vcl\/slider.hxx>\n#include <vcl\/toolbox.hxx>\n#include <vcl\/edit.hxx>\n#include <vcl\/image.hxx>\n\n#define AVMEDIA_CONTROLOFFSET 6\n\nclass ListBox;\n\nnamespace avmedia\n{\n\n\/\/ ---------------------\n\/\/ - MediaControlStyle -\n\/\/ ---------------------\n\nenum MediaControlStyle\n{\n    MEDIACONTROLSTYLE_SINGLELINE = 0,\n    MEDIACONTROLSTYLE_MULTILINE = 1\n};\n\n\/\/ ----------------\n\/\/ - MediaControl -\n\/\/ ---------------\n\nclass MediaItem;\n\nclass MediaControl : public Control\n{\npublic:\n\n                        MediaControl( Window* pParent, MediaControlStyle eControlStyle );\n                        ~MediaControl();\n\n    const Size&         getMinSizePixel() const;\n\n    void                setState( const MediaItem& rItem );\n    void                getState( MediaItem& rItem ) const;\n\nprotected:\n\n    virtual void        update() = 0;\n    virtual void        execute( const MediaItem& rItem ) = 0;\n\n    virtual void        Resize();\n\nprivate:\n\n    void                implUpdateToolboxes();\n    void                implUpdateTimeSlider();\n    void                implUpdateVolumeSlider();\n    void                implUpdateTimeField( double fCurTime );\n    Image               implGetImage( sal_Int32 nImageId ) const;\n\n                        DECL_LINK( implTimeHdl, Slider* );\n                        DECL_LINK( implTimeEndHdl, Slider* );\n                        DECL_LINK( implVolumeHdl, Slider* );\n                        DECL_LINK( implVolumeEndHdl, Slider* );\n                        DECL_LINK( implSelectHdl, ToolBox* );\n                        DECL_LINK( implZoomSelectHdl, ListBox* );\n                        DECL_LINK( implTimeoutHdl, Timer* );\n\n    ImageList           maImageList;\n    Timer               maTimer;\n    MediaItem           maItem;\n    ToolBox             maPlayToolBox;\n    Slider              maTimeSlider;;\n    ToolBox             maMuteToolBox;\n    Slider              maVolumeSlider;\n    ToolBox             maZoomToolBox;\n    ListBox*            mpZoomListBox;\n    Edit                maTimeEdit;\n    Size                maMinSize;\n    MediaControlStyle   meControlStyle;\n    bool                mbLocked;\n};\n\n}\n\n#endif\n<commit_msg>INTEGRATION: CWS warnings01 (1.3.24); FILE MERGED 2006\/02\/14 10:53:42 cl 1.3.24.2: removed extra ';' 2005\/11\/28 12:46:24 cl 1.3.24.1: warning free code fixes<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: mediacontrol.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 13:57: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 _AVMEDIA_MEDIACONTROL_HXX\n#define _AVMEDIA_MEDIACONTROL_HXX\n\n#include \"mediaitem.hxx\"\n\n#include <vcl\/timer.hxx>\n#include <vcl\/slider.hxx>\n#include <vcl\/toolbox.hxx>\n#include <vcl\/edit.hxx>\n#include <vcl\/image.hxx>\n\n#define AVMEDIA_CONTROLOFFSET 6\n\nclass ListBox;\n\nnamespace avmedia\n{\n\n\/\/ ---------------------\n\/\/ - MediaControlStyle -\n\/\/ ---------------------\n\nenum MediaControlStyle\n{\n    MEDIACONTROLSTYLE_SINGLELINE = 0,\n    MEDIACONTROLSTYLE_MULTILINE = 1\n};\n\n\/\/ ----------------\n\/\/ - MediaControl -\n\/\/ ---------------\n\nclass MediaItem;\n\nclass MediaControl : public Control\n{\npublic:\n\n                        MediaControl( Window* pParent, MediaControlStyle eControlStyle );\n    virtual             ~MediaControl();\n\n    const Size&         getMinSizePixel() const;\n\n    void                setState( const MediaItem& rItem );\n    void                getState( MediaItem& rItem ) const;\n\nprotected:\n\n    virtual void        update() = 0;\n    virtual void        execute( const MediaItem& rItem ) = 0;\n\n    virtual void        Resize();\n\nprivate:\n\n    void                implUpdateToolboxes();\n    void                implUpdateTimeSlider();\n    void                implUpdateVolumeSlider();\n    void                implUpdateTimeField( double fCurTime );\n    Image               implGetImage( sal_Int32 nImageId ) const;\n\n                        DECL_LINK( implTimeHdl, Slider* );\n                        DECL_LINK( implTimeEndHdl, Slider* );\n                        DECL_LINK( implVolumeHdl, Slider* );\n                        DECL_LINK( implVolumeEndHdl, Slider* );\n                        DECL_LINK( implSelectHdl, ToolBox* );\n                        DECL_LINK( implZoomSelectHdl, ListBox* );\n                        DECL_LINK( implTimeoutHdl, Timer* );\n\n    ImageList           maImageList;\n    Timer               maTimer;\n    MediaItem           maItem;\n    ToolBox             maPlayToolBox;\n    Slider              maTimeSlider;\n    ToolBox             maMuteToolBox;\n    Slider              maVolumeSlider;\n    ToolBox             maZoomToolBox;\n    ListBox*            mpZoomListBox;\n    Edit                maTimeEdit;\n    Size                maMinSize;\n    MediaControlStyle   meControlStyle;\n    bool                mbLocked;\n};\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"x11api.h\"\n\n#ifdef __LINUX__\n#include <X11\/X.h>\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/Xos.h>\n#include <X11\/keysymdef.h>\n#include <X11\/Xutil.h>\n\/\/#include <GL\/glx.h> \/\/FIXME\n\n#include <Tempest\/Event>\n#include <Tempest\/TextCodec>\n#include <Tempest\/Window>\n\n#include <atomic>\n#include <stdexcept>\n#include <cstring>\n#include <thread>\n#include <unordered_map>\n\nstruct HWND final {\n  ::Window wnd;\n  HWND()=default;\n  HWND(::Window w):wnd(w) {\n    }\n  HWND(Tempest::SystemApi::Window* p) {\n    std::memcpy(&wnd,&p,sizeof(wnd));\n    }\n\n  HWND& operator = (::Window w) { wnd = w; return *this; }\n\n  operator ::Window() { return wnd; }\n\n  Tempest::SystemApi::Window* ptr() {\n    static_assert (sizeof(::Window)<=sizeof(void*),\"cannot map X11 window handle to pointer\");\n    Tempest::SystemApi::Window* ret=nullptr;\n    std::memcpy(&ret,&wnd,sizeof(wnd));\n    return ret;\n    }\n  };\n\nusing namespace Tempest;\n\nstatic const char*      wndClassName=\"Tempest.Window\";\nstatic Display*         dpy  = nullptr;\nstatic ::Window         root = {};\nstatic std::atomic_bool isExit{0};\nstatic int              activeCursorChange = 0;\n\nstatic std::unordered_map<SystemApi::Window*,Tempest::Window*> windows;\n\nstatic Atom& wmDeleteMessage(){\n  static Atom w  = XInternAtom( dpy, \"WM_DELETE_WINDOW\", 0);\n  return w;\n  }\n\nstatic Atom& _NET_WM_STATE(){\n  static Atom w  = XInternAtom( dpy, \"_NET_WM_STATE\", 0);\n  return w;\n  }\n\nstatic Atom& _NET_WM_STATE_MAXIMIZED_HORZ(){\n  static Atom w  = XInternAtom( dpy, \"_NET_WM_STATE_MAXIMIZED_HORZ\", 0);\n  return w;\n  }\n\nstatic Atom& _NET_WM_STATE_MAXIMIZED_VERT(){\n  static Atom w  = XInternAtom( dpy, \"_NET_WM_STATE_MAXIMIZED_VERT\", 0);\n  return w;\n  }\n\nstatic Atom& _NET_WM_STATE_FULLSCREEN(){\n  static Atom w  = XInternAtom( dpy, \"_NET_WM_STATE_FULLSCREEN\", 0);\n  return w;\n  }\n\nstatic Event::MouseButton toButton( XButtonEvent& msg ){\n  if( msg.button==Button1 )\n    return Event::ButtonLeft;\n\n  if( msg.button==Button3 )\n    return Event::ButtonRight;\n\n  if( msg.button==Button2 )\n    return Event::ButtonMid;\n\n  return Event::ButtonNone;\n  }\n\nstatic void maximizeWindow(HWND& w) {\n  Atom a[2];\n  a[0] = _NET_WM_STATE_MAXIMIZED_HORZ();\n  a[1] = _NET_WM_STATE_MAXIMIZED_VERT();\n\n  XChangeProperty ( dpy, w, _NET_WM_STATE(),\n    XA_ATOM, 32, PropModeReplace, (unsigned char*)a, 2);\n  XSync(dpy,False);\n  }\n\nX11Api::X11Api() {\n  dpy = XOpenDisplay(nullptr);\n\n  if(dpy == nullptr)\n    throw std::runtime_error(\"cannot connect to X server!\");\n\n  root = DefaultRootWindow(dpy);\n\n  static const TranslateKeyPair k[] = {\n    { XK_Control_L, Event::K_LControl },\n    { XK_Control_R, Event::K_RControl },\n\n    { XK_Shift_L,   Event::K_LShift   },\n    { XK_Shift_R,   Event::K_RShift   },\n\n    { XK_Alt_L,     Event::K_LAlt     },\n\n    { XK_Left,      Event::K_Left     },\n    { XK_Right,     Event::K_Right    },\n    { XK_Up,        Event::K_Up       },\n    { XK_Down,      Event::K_Down     },\n\n    { XK_Escape,    Event::K_ESCAPE   },\n    { XK_Tab,       Event::K_Tab      },\n    { XK_BackSpace, Event::K_Back     },\n    { XK_Delete,    Event::K_Delete   },\n    { XK_Insert,    Event::K_Insert   },\n    { XK_Home,      Event::K_Home     },\n    { XK_End,       Event::K_End      },\n    { XK_Pause,     Event::K_Pause    },\n    { XK_Return,    Event::K_Return   },\n    { XK_space,     Event::K_Space    },\n    { XK_Caps_Lock, Event::K_CapsLock },\n\n    { XK_F1,        Event::K_F1       },\n    {   48,         Event::K_0        },\n    {   97,         Event::K_A        },\n\n    { 0,            Event::K_NoKey    }\n    };\n\n  setupKeyTranslate(k,24);\n  }\n\nvoid *X11Api::display() {\n  return dpy;\n  }\n\nvoid X11Api::alignGeometry(SystemApi::Window *w, Tempest::Window& owner) {\n  XWindowAttributes xwa={};\n  if(XGetWindowAttributes(dpy, HWND(w), &xwa)){\n    Tempest::SizeEvent e(xwa.width, xwa.height);\n    SystemApi::dispatchResize(owner,e);\n    }\n  }\n\nSystemApi::Window *X11Api::implCreateWindow(Tempest::Window *owner, uint32_t w, uint32_t h) {\n  \/\/GLint att[] = { GLX_RGBA, GLX_DEPTH_SIZE, 24, GLX_DOUBLEBUFFER, None };\n  \/\/XVisualInfo * vi = glXChooseVisual(dpy, 0, att);\n\n  long visualMask = VisualScreenMask;\n  int numberOfVisuals;\n  XVisualInfo vInfoTemplate = {};\n  vInfoTemplate.screen = DefaultScreen(dpy);\n  XVisualInfo * vi = XGetVisualInfo(dpy, visualMask, &vInfoTemplate, &numberOfVisuals);\n\n  Colormap cmap;\n  cmap = XCreateColormap(dpy, root, vi->visual, AllocNone);\n\n  XSetWindowAttributes swa={};\n  swa.colormap   = cmap;\n  swa.event_mask = PointerMotionMask | ExposureMask |\n                   ButtonPressMask | ButtonReleaseMask |\n                   KeyPressMask | KeyReleaseMask;\n\n  HWND win = XCreateWindow( dpy, root, 0, 0, w, h,\n                            0, vi->depth, InputOutput, vi->visual,\n                            CWColormap | CWEventMask, &swa );\n  XSetWMProtocols(dpy, win, &wmDeleteMessage(), 1);\n  XStoreName(dpy, win, wndClassName);\n\n  XFreeColormap( dpy, cmap );\n  XFree(vi);\n\n  auto ret = reinterpret_cast<SystemApi::Window*>(win.ptr());\n  windows[ret] = owner;\n  XMapWindow(dpy, win);\n  XSync(dpy,False);\n  if(owner!=nullptr)\n    alignGeometry(win.ptr(),*owner);\n  return ret;\n  }\n\nSystemApi::Window *X11Api::implCreateWindow(Tempest::Window *owner, SystemApi::ShowMode sm) {\n  Screen* s = DefaultScreenOfDisplay(dpy);\n  int width = s->width;\n  int height = s->height;\n  \n  SystemApi::Window* hwnd = nullptr;\n\n  switch(sm) {\n    case Hidden:\n      hwnd = implCreateWindow(owner,1, 1);\n      \/\/ TODO: make window invisible\n      break;\n    case Normal:\n      hwnd = implCreateWindow(owner,800, 600);\n      break;\n    case Minimized:\n    case Maximized:\n      \/\/ TODO\n      hwnd = implCreateWindow(owner,width, height);\n      break;\n    case FullScreen:\n      hwnd = implCreateWindow(owner,width, height);\n      implSetAsFullscreen(hwnd,true);\n      break;\n    }\n  \n  return hwnd;\n  }\n\nvoid X11Api::implDestroyWindow(SystemApi::Window *w) {\n  windows.erase(w); \/\/NOTE: X11 can send events to ded window\n  XDestroyWindow(dpy, HWND(w));\n  }\n\nbool X11Api::implSetAsFullscreen(SystemApi::Window *w, bool fullScreen) {\n  XEvent e = {};\n  e.xclient.type         = ClientMessage;\n  e.xclient.window       = HWND(w);\n  e.xclient.message_type = _NET_WM_STATE();\n  e.xclient.format       = 32;\n  e.xclient.data.l[0]    = 2;    \/\/ _NET_WM_STATE_TOGGLE\n  e.xclient.data.l[1]    = _NET_WM_STATE_FULLSCREEN();\n  e.xclient.data.l[2]    = 0;    \/\/ no second property to toggle\n  \n  if(fullScreen)\n    e.xclient.data.l[3]  = 1;\n  else\n    e.xclient.data.l[3]  = 0;\n\n  XSendEvent(dpy, DefaultRootWindow(dpy), False, SubstructureRedirectMask | SubstructureNotifyMask, &e);\n  return true;\n  }\n\nbool X11Api::implIsFullscreen(SystemApi::Window *w) {\n  Atom actualType;\n  int actualFormat;\n  unsigned long i, numItems, bytesAfter;\n  unsigned char *propertyValue = NULL;\n  long maxLength = 1024;\n  \n  if (XGetWindowProperty(dpy, HWND(w), _NET_WM_STATE(),\n                           0l, maxLength, False, XA_ATOM, &actualType,\n                           &actualFormat, &numItems, &bytesAfter,\n                           &propertyValue) == Success) {\n        int fullscreen = 0;\n        Atom *atoms = (Atom *) propertyValue;\n\n        for (i = 0; i < numItems; ++i) {\n            if (atoms[i] == _NET_WM_STATE_FULLSCREEN()) {\n                fullscreen = 1;\n            }\n        }\n        \n        if(fullscreen) {\n          return true;\n        }\n  }\n  return false;\n  }\n\nvoid X11Api::implSetCursorPosition(int x, int y) {\n  activeCursorChange = 1;\n  XWarpPointer(dpy, None, root, 0, 0, 0, 0, x, y);\n  XFlush(dpy);\n  }\n\nvoid X11Api::implShowCursor(bool show) {\n  if(windows.size()==0)\n    return;\n  if(show) {\n    XUndefineCursor(dpy, HWND(windows.begin()->first));\n    } else {\n    Cursor invisibleCursor;\n    Pixmap bitmapNoData;\n    XColor black;\n    static char noData[] = { 0,0,0,0,0,0,0,0 };\n    black.red = black.green = black.blue = 0;\n\n    bitmapNoData = XCreateBitmapFromData(dpy, HWND(windows.begin()->first), noData, 8, 8);\n    invisibleCursor = XCreatePixmapCursor(dpy, bitmapNoData, bitmapNoData, \n                                      &black, &black, 0, 0);\n    XDefineCursor(dpy, HWND(windows.begin()->first), invisibleCursor);\n    XFreeCursor(dpy, invisibleCursor);\n    XFreePixmap(dpy, bitmapNoData);\n    }\n\n  XSync(dpy, False);\n  }\n\nRect X11Api::implWindowClientRect(SystemApi::Window *w) {\n  XWindowAttributes xwa;\n  XGetWindowAttributes(dpy, HWND(w), &xwa);\n\n  return Rect( xwa.x, xwa.y, xwa.width, xwa.height );\n  }\n\nvoid X11Api::implExit() {\n  isExit.store(true);\n  }\n\nbool X11Api::implIsRunning() {\n  return !isExit.load();\n  }\n\nint X11Api::implExec(SystemApi::AppCallBack &cb) {\n  \/\/ main message loop\n  while (!isExit.load()) {\n    implProcessEvents(cb);\n    }\n  return 0;\n  }\n\nvoid X11Api::implProcessEvents(SystemApi::AppCallBack &cb) {\n  \/\/ main message loop\n  if(XPending(dpy)>0) {\n    XEvent xev={};\n    XNextEvent(dpy, &xev);\n\n    HWND hWnd = xev.xclient.window;\n    auto it = windows.find(hWnd.ptr());\n    if(it==windows.end() || it->second==nullptr)\n      return;\n    Tempest::Window& cb = *it->second; \/\/TODO: validation\n    switch( xev.type ) {\n      case ClientMessage: {\n        if( xev.xclient.data.l[0] == long(wmDeleteMessage()) ){\n          SystemApi::exit();\n          }\n        break;\n        }\n      case ButtonPress:\n      case ButtonRelease: {\n        bool isWheel = false;\n        if( xev.type==ButtonPress && XPending(dpy) &&\n            (xev.xbutton.button == Button4 || xev.xbutton.button == Button5) ){\n          XEvent ev;\n          XNextEvent(dpy, &ev);\n          isWheel = (ev.type==ButtonRelease);\n          }\n\n        if( isWheel ){\n          int ticks = 0;\n          if( xev.xbutton.button == Button4 ) {\n            ticks = 100;\n            }\n          else if ( xev.xbutton.button == Button5 ) {\n            ticks = -100;\n            }\n          Tempest::MouseEvent e( xev.xbutton.x,\n                                 xev.xbutton.y,\n                                 Tempest::Event::ButtonNone,\n                                 ticks,\n                                 0,\n                                 Event::MouseWheel );\n          SystemApi::dispatchMouseWheel(cb, e);\n          } else {\n          MouseEvent e( xev.xbutton.x,\n                        xev.xbutton.y,\n                        toButton( xev.xbutton ),\n                        0,\n                        0,\n                        xev.type==ButtonPress ? Event::MouseDown : Event::MouseUp );\n          if(xev.type==ButtonPress)\n            SystemApi::dispatchMouseDown(cb, e); else\n            SystemApi::dispatchMouseUp(cb, e);\n          }\n        break;\n        }\n      case MotionNotify: {\n        if(activeCursorChange == 1) {\n          \/\/ FIXME: mouse behave crazy in OpenGothic\n          activeCursorChange = 0;\n          break;\n        }\n        MouseEvent e( xev.xmotion.x,\n                      xev.xmotion.y,\n                      Event::ButtonNone,\n                      0,\n                      0,\n                      Event::MouseMove  );\n        SystemApi::dispatchMouseMove(cb, e);\n        break;\n        }\n      case KeyPress:\n      case KeyRelease: {\n        int keysyms_per_keycode_return = 0;\n        KeySym *ksym = XGetKeyboardMapping( dpy, KeyCode(xev.xkey.keycode),\n                                            1,\n                                            &keysyms_per_keycode_return );\n\n        char txt[10]={};\n        XLookupString(&xev.xkey, txt, sizeof(txt)-1, ksym, nullptr );\n\n        auto u16 = TextCodec::toUtf16(txt); \/\/ TODO: remove dynamic allocation\n        auto key = SystemApi::translateKey(XLookupKeysym(&xev.xkey,0));\n\n        uint32_t scan = xev.xkey.keycode;\n\n        Tempest::KeyEvent e(Event::KeyType(key),uint32_t(u16.size()>0 ? u16[0] : 0),Event::M_NoModifier,(xev.type==KeyPress) ? Event::KeyDown : Event::KeyUp);\n        if(xev.type==KeyPress)\n          SystemApi::dispatchKeyDown(cb,e,scan); else\n          SystemApi::dispatchKeyUp  (cb,e,scan);\n        break;\n        }\n      }\n\n    std::this_thread::yield();\n    } else {\n    if(cb.onTimer()==0)\n      std::this_thread::yield();\n    for(auto& i:windows) {\n      if(i.second==nullptr)\n        continue;\n      \/\/ artificial move\/resize event\n      alignGeometry(i.first,*i.second);\n      SystemApi::dispatchRender(*i.second);\n      }\n    }\n  }\n\n#endif\n<commit_msg>x11 name collision<commit_after>#include \"x11api.h\"\n\n#ifdef __LINUX__\n#include <X11\/X.h>\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/Xos.h>\n#include <X11\/keysymdef.h>\n#include <X11\/Xutil.h>\n\/\/#include <GL\/glx.h> \/\/FIXME\n\n#include <Tempest\/Event>\n#include <Tempest\/TextCodec>\n#include <Tempest\/Window>\n\n#include <atomic>\n#include <stdexcept>\n#include <cstring>\n#include <thread>\n#include <unordered_map>\n\nstruct HWND final {\n  ::Window wnd;\n  HWND()=default;\n  HWND(::Window w):wnd(w) {\n    }\n  HWND(Tempest::SystemApi::Window* p) {\n    std::memcpy(&wnd,&p,sizeof(wnd));\n    }\n\n  HWND& operator = (::Window w) { wnd = w; return *this; }\n\n  operator ::Window() { return wnd; }\n\n  Tempest::SystemApi::Window* ptr() {\n    static_assert (sizeof(::Window)<=sizeof(void*),\"cannot map X11 window handle to pointer\");\n    Tempest::SystemApi::Window* ret=nullptr;\n    std::memcpy(&ret,&wnd,sizeof(wnd));\n    return ret;\n    }\n  };\n\nusing namespace Tempest;\n\nstatic const char*      wndClassName=\"Tempest.Window\";\nstatic Display*         dpy  = nullptr;\nstatic ::Window         root = {};\nstatic std::atomic_bool isExit{0};\nstatic int              activeCursorChange = 0;\n\nstatic std::unordered_map<SystemApi::Window*,Tempest::Window*> windows;\n\nstatic Atom& wmDeleteMessage(){\n  static Atom w  = XInternAtom( dpy, \"WM_DELETE_WINDOW\", 0);\n  return w;\n  }\n\nstatic Atom& _NET_WM_STATE(){\n  static Atom w  = XInternAtom( dpy, \"_NET_WM_STATE\", 0);\n  return w;\n  }\n\nstatic Atom& _NET_WM_STATE_MAXIMIZED_HORZ(){\n  static Atom w  = XInternAtom( dpy, \"_NET_WM_STATE_MAXIMIZED_HORZ\", 0);\n  return w;\n  }\n\nstatic Atom& _NET_WM_STATE_MAXIMIZED_VERT(){\n  static Atom w  = XInternAtom( dpy, \"_NET_WM_STATE_MAXIMIZED_VERT\", 0);\n  return w;\n  }\n\nstatic Atom& _NET_WM_STATE_FULLSCREEN(){\n  static Atom w  = XInternAtom( dpy, \"_NET_WM_STATE_FULLSCREEN\", 0);\n  return w;\n  }\n\nstatic Event::MouseButton toButton( XButtonEvent& msg ){\n  if( msg.button==Button1 )\n    return Event::ButtonLeft;\n\n  if( msg.button==Button3 )\n    return Event::ButtonRight;\n\n  if( msg.button==Button2 )\n    return Event::ButtonMid;\n\n  return Event::ButtonNone;\n  }\n\nstatic void maximizeWindow(HWND& w) {\n  Atom a[2];\n  a[0] = _NET_WM_STATE_MAXIMIZED_HORZ();\n  a[1] = _NET_WM_STATE_MAXIMIZED_VERT();\n\n  XChangeProperty ( dpy, w, _NET_WM_STATE(),\n    XA_ATOM, 32, PropModeReplace, (unsigned char*)a, 2);\n  XSync(dpy,False);\n  }\n\nX11Api::X11Api() {\n  dpy = XOpenDisplay(nullptr);\n\n  if(dpy == nullptr)\n    throw std::runtime_error(\"cannot connect to X server!\");\n\n  root = DefaultRootWindow(dpy);\n\n  static const TranslateKeyPair k[] = {\n    { XK_Control_L, Event::K_LControl },\n    { XK_Control_R, Event::K_RControl },\n\n    { XK_Shift_L,   Event::K_LShift   },\n    { XK_Shift_R,   Event::K_RShift   },\n\n    { XK_Alt_L,     Event::K_LAlt     },\n\n    { XK_Left,      Event::K_Left     },\n    { XK_Right,     Event::K_Right    },\n    { XK_Up,        Event::K_Up       },\n    { XK_Down,      Event::K_Down     },\n\n    { XK_Escape,    Event::K_ESCAPE   },\n    { XK_Tab,       Event::K_Tab      },\n    { XK_BackSpace, Event::K_Back     },\n    { XK_Delete,    Event::K_Delete   },\n    { XK_Insert,    Event::K_Insert   },\n    { XK_Home,      Event::K_Home     },\n    { XK_End,       Event::K_End      },\n    { XK_Pause,     Event::K_Pause    },\n    { XK_Return,    Event::K_Return   },\n    { XK_space,     Event::K_Space    },\n    { XK_Caps_Lock, Event::K_CapsLock },\n\n    { XK_F1,        Event::K_F1       },\n    {   48,         Event::K_0        },\n    {   97,         Event::K_A        },\n\n    { 0,            Event::K_NoKey    }\n    };\n\n  setupKeyTranslate(k,24);\n  }\n\nvoid *X11Api::display() {\n  return dpy;\n  }\n\nvoid X11Api::alignGeometry(SystemApi::Window *w, Tempest::Window& owner) {\n  XWindowAttributes xwa={};\n  if(XGetWindowAttributes(dpy, HWND(w), &xwa)){\n    Tempest::SizeEvent e(xwa.width, xwa.height);\n    SystemApi::dispatchResize(owner,e);\n    }\n  }\n\nSystemApi::Window *X11Api::implCreateWindow(Tempest::Window *owner, uint32_t w, uint32_t h) {\n  \/\/GLint att[] = { GLX_RGBA, GLX_DEPTH_SIZE, 24, GLX_DOUBLEBUFFER, None };\n  \/\/XVisualInfo * vi = glXChooseVisual(dpy, 0, att);\n\n  long visualMask = VisualScreenMask;\n  int numberOfVisuals;\n  XVisualInfo vInfoTemplate = {};\n  vInfoTemplate.screen = DefaultScreen(dpy);\n  XVisualInfo * vi = XGetVisualInfo(dpy, visualMask, &vInfoTemplate, &numberOfVisuals);\n\n  Colormap cmap;\n  cmap = XCreateColormap(dpy, root, vi->visual, AllocNone);\n\n  XSetWindowAttributes swa={};\n  swa.colormap   = cmap;\n  swa.event_mask = PointerMotionMask | ExposureMask |\n                   ButtonPressMask | ButtonReleaseMask |\n                   KeyPressMask | KeyReleaseMask;\n\n  HWND win = XCreateWindow( dpy, root, 0, 0, w, h,\n                            0, vi->depth, InputOutput, vi->visual,\n                            CWColormap | CWEventMask, &swa );\n  XSetWMProtocols(dpy, win, &wmDeleteMessage(), 1);\n  XStoreName(dpy, win, wndClassName);\n\n  XFreeColormap( dpy, cmap );\n  XFree(vi);\n\n  auto ret = reinterpret_cast<SystemApi::Window*>(win.ptr());\n  windows[ret] = owner;\n  XMapWindow(dpy, win);\n  XSync(dpy,False);\n  if(owner!=nullptr)\n    alignGeometry(win.ptr(),*owner);\n  return ret;\n  }\n\nSystemApi::Window *X11Api::implCreateWindow(Tempest::Window *owner, SystemApi::ShowMode sm) {\n  Screen* s = DefaultScreenOfDisplay(dpy);\n  int width = s->width;\n  int height = s->height;\n  \n  SystemApi::Window* hwnd = nullptr;\n\n  switch(sm) {\n    case Hidden:\n      hwnd = implCreateWindow(owner,1, 1);\n      \/\/ TODO: make window invisible\n      break;\n    case Normal:\n      hwnd = implCreateWindow(owner,800, 600);\n      break;\n    case Minimized:\n    case Maximized:\n      \/\/ TODO\n      hwnd = implCreateWindow(owner,width, height);\n      break;\n    case FullScreen:\n      hwnd = implCreateWindow(owner,width, height);\n      implSetAsFullscreen(hwnd,true);\n      break;\n    }\n  \n  return hwnd;\n  }\n\nvoid X11Api::implDestroyWindow(SystemApi::Window *w) {\n  windows.erase(w); \/\/NOTE: X11 can send events to ded window\n  XDestroyWindow(dpy, HWND(w));\n  }\n\nbool X11Api::implSetAsFullscreen(SystemApi::Window *w, bool fullScreen) {\n  XEvent e = {};\n  e.xclient.type         = ClientMessage;\n  e.xclient.window       = HWND(w);\n  e.xclient.message_type = _NET_WM_STATE();\n  e.xclient.format       = 32;\n  e.xclient.data.l[0]    = 2;    \/\/ _NET_WM_STATE_TOGGLE\n  e.xclient.data.l[1]    = _NET_WM_STATE_FULLSCREEN();\n  e.xclient.data.l[2]    = 0;    \/\/ no second property to toggle\n  \n  if(fullScreen)\n    e.xclient.data.l[3]  = 1;\n  else\n    e.xclient.data.l[3]  = 0;\n\n  XSendEvent(dpy, DefaultRootWindow(dpy), False, SubstructureRedirectMask | SubstructureNotifyMask, &e);\n  return true;\n  }\n\nbool X11Api::implIsFullscreen(SystemApi::Window *w) {\n  Atom actualType;\n  int actualFormat;\n  unsigned long i, numItems, bytesAfter;\n  unsigned char *propertyValue = NULL;\n  long maxLength = 1024;\n  \n  if (XGetWindowProperty(dpy, HWND(w), _NET_WM_STATE(),\n                           0l, maxLength, False, XA_ATOM, &actualType,\n                           &actualFormat, &numItems, &bytesAfter,\n                           &propertyValue) == Success) {\n        int fullscreen = 0;\n        Atom *atoms = (Atom *) propertyValue;\n\n        for (i = 0; i < numItems; ++i) {\n            if (atoms[i] == _NET_WM_STATE_FULLSCREEN()) {\n                fullscreen = 1;\n            }\n        }\n        \n        if(fullscreen) {\n          return true;\n        }\n  }\n  return false;\n  }\n\nvoid X11Api::implSetCursorPosition(int x, int y) {\n  activeCursorChange = 1;\n  XWarpPointer(dpy, None, root, 0, 0, 0, 0, x, y);\n  XFlush(dpy);\n  }\n\nvoid X11Api::implShowCursor(bool show) {\n  if(windows.size()==0)\n    return;\n  if(show) {\n    XUndefineCursor(dpy, HWND(windows.begin()->first));\n    } else {\n    Cursor invisibleCursor;\n    ::Pixmap bitmapNoData;\n    XColor black;\n    static char noData[] = { 0,0,0,0,0,0,0,0 };\n    black.red = black.green = black.blue = 0;\n\n    bitmapNoData = XCreateBitmapFromData(dpy, HWND(windows.begin()->first), noData, 8, 8);\n    invisibleCursor = XCreatePixmapCursor(dpy, bitmapNoData, bitmapNoData, \n                                      &black, &black, 0, 0);\n    XDefineCursor(dpy, HWND(windows.begin()->first), invisibleCursor);\n    XFreeCursor(dpy, invisibleCursor);\n    XFreePixmap(dpy, bitmapNoData);\n    }\n\n  XSync(dpy, False);\n  }\n\nRect X11Api::implWindowClientRect(SystemApi::Window *w) {\n  XWindowAttributes xwa;\n  XGetWindowAttributes(dpy, HWND(w), &xwa);\n\n  return Rect( xwa.x, xwa.y, xwa.width, xwa.height );\n  }\n\nvoid X11Api::implExit() {\n  isExit.store(true);\n  }\n\nbool X11Api::implIsRunning() {\n  return !isExit.load();\n  }\n\nint X11Api::implExec(SystemApi::AppCallBack &cb) {\n  \/\/ main message loop\n  while (!isExit.load()) {\n    implProcessEvents(cb);\n    }\n  return 0;\n  }\n\nvoid X11Api::implProcessEvents(SystemApi::AppCallBack &cb) {\n  \/\/ main message loop\n  if(XPending(dpy)>0) {\n    XEvent xev={};\n    XNextEvent(dpy, &xev);\n\n    HWND hWnd = xev.xclient.window;\n    auto it = windows.find(hWnd.ptr());\n    if(it==windows.end() || it->second==nullptr)\n      return;\n    Tempest::Window& cb = *it->second; \/\/TODO: validation\n    switch( xev.type ) {\n      case ClientMessage: {\n        if( xev.xclient.data.l[0] == long(wmDeleteMessage()) ){\n          SystemApi::exit();\n          }\n        break;\n        }\n      case ButtonPress:\n      case ButtonRelease: {\n        bool isWheel = false;\n        if( xev.type==ButtonPress && XPending(dpy) &&\n            (xev.xbutton.button == Button4 || xev.xbutton.button == Button5) ){\n          XEvent ev;\n          XNextEvent(dpy, &ev);\n          isWheel = (ev.type==ButtonRelease);\n          }\n\n        if( isWheel ){\n          int ticks = 0;\n          if( xev.xbutton.button == Button4 ) {\n            ticks = 100;\n            }\n          else if ( xev.xbutton.button == Button5 ) {\n            ticks = -100;\n            }\n          Tempest::MouseEvent e( xev.xbutton.x,\n                                 xev.xbutton.y,\n                                 Tempest::Event::ButtonNone,\n                                 ticks,\n                                 0,\n                                 Event::MouseWheel );\n          SystemApi::dispatchMouseWheel(cb, e);\n          } else {\n          MouseEvent e( xev.xbutton.x,\n                        xev.xbutton.y,\n                        toButton( xev.xbutton ),\n                        0,\n                        0,\n                        xev.type==ButtonPress ? Event::MouseDown : Event::MouseUp );\n          if(xev.type==ButtonPress)\n            SystemApi::dispatchMouseDown(cb, e); else\n            SystemApi::dispatchMouseUp(cb, e);\n          }\n        break;\n        }\n      case MotionNotify: {\n        if(activeCursorChange == 1) {\n          \/\/ FIXME: mouse behave crazy in OpenGothic\n          activeCursorChange = 0;\n          break;\n        }\n        MouseEvent e( xev.xmotion.x,\n                      xev.xmotion.y,\n                      Event::ButtonNone,\n                      0,\n                      0,\n                      Event::MouseMove  );\n        SystemApi::dispatchMouseMove(cb, e);\n        break;\n        }\n      case KeyPress:\n      case KeyRelease: {\n        int keysyms_per_keycode_return = 0;\n        KeySym *ksym = XGetKeyboardMapping( dpy, KeyCode(xev.xkey.keycode),\n                                            1,\n                                            &keysyms_per_keycode_return );\n\n        char txt[10]={};\n        XLookupString(&xev.xkey, txt, sizeof(txt)-1, ksym, nullptr );\n\n        auto u16 = TextCodec::toUtf16(txt); \/\/ TODO: remove dynamic allocation\n        auto key = SystemApi::translateKey(XLookupKeysym(&xev.xkey,0));\n\n        uint32_t scan = xev.xkey.keycode;\n\n        Tempest::KeyEvent e(Event::KeyType(key),uint32_t(u16.size()>0 ? u16[0] : 0),Event::M_NoModifier,(xev.type==KeyPress) ? Event::KeyDown : Event::KeyUp);\n        if(xev.type==KeyPress)\n          SystemApi::dispatchKeyDown(cb,e,scan); else\n          SystemApi::dispatchKeyUp  (cb,e,scan);\n        break;\n        }\n      }\n\n    std::this_thread::yield();\n    } else {\n    if(cb.onTimer()==0)\n      std::this_thread::yield();\n    for(auto& i:windows) {\n      if(i.second==nullptr)\n        continue;\n      \/\/ artificial move\/resize event\n      alignGeometry(i.first,*i.second);\n      SystemApi::dispatchRender(*i.second);\n      }\n    }\n  }\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    TestParallelRandomStatistics.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, there is a non-exclusive\n * license for use of this work by or on behalf of the\n * U.S. Government. Redistribution and use in source and binary forms, with\n * or without modification, are permitted provided that this Notice and any\n * statement of authorship are reproduced on all copies.\n *\/\n\/\/ .SECTION Thanks\n\/\/ Thanks to Philippe Pebay and David Thompson from Sandia National Laboratories \n\/\/ for implementing this test.\n\n#include <mpi.h>\n#include <time.h>\n\n#include \"vtkDescriptiveStatistics.h\"\n#include \"vtkPDescriptiveStatistics.h\"\n#include \"vtkCorrelativeStatistics.h\"\n#include \"vtkPCorrelativeStatistics.h\"\n\n#include \"vtkDoubleArray.h\"\n#include \"vtkMath.h\"\n#include \"vtkMPIController.h\"\n#include \"vtkStdString.h\"\n#include \"vtkTable.h\"\n#include \"vtkVariantArray.h\"\n\n\/\/ For debugging purposes, serial engines can be run on each slice of the distributed data set\n#define DEBUG_WITH_SERIAL_STATS 0 \n\nint nVals = 1000000;\n\n\/\/ This will be called by all processes\nvoid RandomSampleStatistics( vtkMultiProcessController* controller, void* vtkNotUsed(arg) )\n{\n  \/\/ Get local rank\n  int myRank = controller->GetLocalProcessId();\n\n  \/\/ Seed random number generator\n  vtkMath::RandomSeed( static_cast<int>( time( NULL ) ) * ( myRank + 1 ) );\n\n  \/\/ Generate an input table that contains samples of mutually independent random variables over [0, 1]\n  int nUniform = 2;\n  int nNormal  = 2;\n  int nVariables = nUniform + nNormal;\n\n  vtkTable* inputData = vtkTable::New();\n  vtkDoubleArray* doubleArray[4];\n  vtkStdString columnNames[] = { \"Standard Uniform 0\", \n                                 \"Standard Uniform 1\",\n                                 \"Standard Normal 0\",\n                                 \"Standard Normal 1\" };\n  \n  \/\/ Standard uniform samples\n  for ( int c = 0; c < nUniform; ++ c )\n    {\n    doubleArray[c] = vtkDoubleArray::New();\n    doubleArray[c]->SetNumberOfComponents( 1 );\n    doubleArray[c]->SetName( columnNames[c] );\n\n    double x;\n    for ( int r = 0; r < nVals; ++ r )\n      {\n      x = vtkMath::Random();\n      doubleArray[c]->InsertNextValue( x );\n      }\n    \n    inputData->AddColumn( doubleArray[c] );\n    doubleArray[c]->Delete();\n    }\n\n  \/\/ Standard normal samples\n  for ( int c = nUniform; c < nVariables; ++ c )\n    {\n    doubleArray[c] = vtkDoubleArray::New();\n    doubleArray[c]->SetNumberOfComponents( 1 );\n    doubleArray[c]->SetName( columnNames[c] );\n\n    double x;\n    for ( int r = 0; r < nVals; ++ r )\n      {\n      x = vtkMath::Gaussian();\n      doubleArray[c]->InsertNextValue( x );\n      }\n    \n    inputData->AddColumn( doubleArray[c] );\n    doubleArray[c]->Delete();\n    }\n\n#if DEBUG_WITH_SERIAL_STATS\n  \/\/ Instantiate a (serial) descriptive statistics engine and set its ports\n  vtkDescriptiveStatistics* ds = vtkDescriptiveStatistics::New();\n  ds->SetInput( 0, inputData );\n\n  \/\/ Select all columns\n  for ( int c = 0; c < nVariables; ++ c )\n    {\n    ds->AddColumn( columnNames[c] );\n    }\n\n  \/\/ Test (serially) with Learn and Derive options only\n  ds->SetLearn( true );\n  ds->SetDerive( true );\n  ds->SetAssess( true );\n  ds->Update();\n\n  cout << \"\\n## Proc \"\n       << myRank\n       << \" calculated the following statistics ( \"\n       << ds->GetSampleSize()\n       << \" entries per column ):\\n\";\n  for ( vtkIdType r = 0; r < ds->GetOutput( 1 )->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < ds->GetOutput( 1 )->GetNumberOfColumns(); ++ i )\n      {\n      cout << ds->GetOutput( 1 )->GetColumnName( i )\n           << \"=\"\n           << ds->GetOutput( 1 )->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n    cout << \"\\n\";\n    }\n  \n  \/\/ Clean up\n  ds->Delete();\n#endif \/\/DEBUG_WITH_SERIAL_STATS\n\n  \/\/ Synchronize and start clock\n  controller->Barrier();\n  time_t t0;\n  time ( &t0 );\n  \n  \/\/ Instantiate a parallel descriptive statistics engine and set its ports\n  vtkPDescriptiveStatistics* pds = vtkPDescriptiveStatistics::New();\n  pds->SetInput( 0, inputData );\n  vtkTable* outputData = pds->GetOutput( 0 );\n  vtkTable* outputMeta = pds->GetOutput( 1 );\n\n  \/\/ Select all columns\n  for ( int c = 0; c < nVariables; ++ c )\n    {\n    pds->AddColumn( columnNames[c] );\n    }\n\n  \/\/ Test (in parallel) with Learn, Derive, and Assess options turned on\n  pds->SetLearn( true );\n  pds->SetDerive( true );\n  pds->SetAssess( true );\n  pds->SignedDeviationsOff(); \/\/ Use unsigned deviations\n  pds->Update();\n\n  \/\/ Synchronize and stop clock\n  controller->Barrier();\n  time_t t1;\n  time ( &t1 );\n\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Completed parallel calculation of descriptive statistics (with assessment):\\n\"\n         << \"   Total sample size: \"\n         << pds->GetSampleSize()\n         << \" \\n\"\n         << \"   Wall time: \"\n         << difftime( t1, t0 )\n         << \" sec.\\n\";\n\n   for ( vtkIdType r = 0; r < outputMeta->GetNumberOfRows(); ++ r )\n      {\n      cout << \"   \";\n      for ( int c = 0; c < outputMeta->GetNumberOfColumns(); ++ c )\n        {\n        cout << outputMeta->GetColumnName( c )\n             << \"=\"\n             << outputMeta->GetValue( r, c ).ToString()\n             << \"  \";\n        }\n      cout << \"\\n\";\n      }\n    }\n  \n  \/\/ Verify that the DISTRIBUTED standard normal samples indeed statisfy the 68-95-99.7 rule\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Verifying whether the distributed standard normal samples satisfy the 68-95-99.7 rule:\\n\";\n    }\n  \n  vtkVariantArray* relDev[2];\n  relDev[0] = vtkVariantArray::SafeDownCast(\n    outputData->GetColumnByName( \"Relative Deviation(Standard Normal 0)\" ) );\n  relDev[1] = vtkVariantArray::SafeDownCast(\n    outputData->GetColumnByName( \"Relative Deviation(Standard Normal 1)\" ) );\n\n  if ( !relDev[0] || ! relDev[1] )\n    {\n    cout << \"*** Error: \"\n         << \"Empty output column(s) on process \"\n         << controller->GetLocalProcessId()\n         << \".\\n\";\n    }\n\n  for ( int c = 0; c < nNormal; ++ c )\n    {\n    int outsideStdv_l[] = { 0, 0, 0 };\n    double dev;\n    int n = outputData->GetNumberOfRows();\n    for ( vtkIdType r = 0; r < n; ++ r )\n      {\n      dev = relDev[c]->GetValue( r ).ToDouble();\n      if ( dev >= 1. )\n        {\n        ++ outsideStdv_l[0];\n        if ( dev >= 2. )\n          {\n          ++ outsideStdv_l[1];\n          if ( dev >= 3. )\n            {\n            ++ outsideStdv_l[2];\n            }\n          }\n        }\n      }\n\n    \/\/ Sum all local counters\n    int outsideStdv_g[3];\n    controller->AllReduce( outsideStdv_l, \n                           outsideStdv_g, \n                           3, \n                           vtkCommunicator::SUM_OP );\n\n    \/\/ Print out percentages of sample points within 1, 2, and 3 standard deviations of the mean.\n    if ( ! controller->GetLocalProcessId() )\n      {\n      cout << \"   \"\n           << outputData->GetColumnName( nUniform + c )\n           << \":\\n\";\n      for ( int i = 0; i < 3; ++ i )\n        {\n        cout << \"      \" \n             << ( 1. - outsideStdv_g[i] \/ static_cast<double>( pds->GetSampleSize() ) ) * 100.\n             << \"\\% within \"\n             << i + 1\n             << \" standard deviation(s) from the mean.\\n\";\n        }\n      }\n    }\n\n  \/\/ Clean up\n  pds->Delete();\n\n  \/\/ Synchronize and start clock\n  controller->Barrier();\n  time_t t2;\n  time ( &t2 );\n\n  \/\/ Instantiate a parallel correlative statistics engine and set its ports\n  vtkPCorrelativeStatistics* pcs = vtkPCorrelativeStatistics::New();\n  pcs->SetInput( 0, inputData );\n  outputData = pcs->GetOutput( 0 );\n  outputMeta = pcs->GetOutput( 1 );\n\n  \/\/ Select column pairs (uniform vs. uniform, normal vs. normal)\n  pcs->AddColumnPair( columnNames[0], columnNames[1] );\n  pcs->AddColumnPair( columnNames[2], columnNames[3] );\n\n  \/\/ Test (in parallel) with Learn, Derive, and Assess options turned on\n  pcs->SetLearn( true );\n  pcs->SetDerive( true );\n  pcs->SetAssess( true );\n  pcs->Update();\n\n    \/\/ Synchronize and stop clock\n  controller->Barrier();\n  time_t t3;\n  time ( &t3 );\n\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Completed parallel calculation of correlative statistics (with assessment):\\n\"\n         << \"   Total sample size: \"\n         << pcs->GetSampleSize()\n         << \" \\n\"\n         << \"   Wall time: \"\n         << difftime( t3, t2 )\n         << \" sec.\\n\";\n\n    for ( vtkIdType r = 0; r < outputMeta->GetNumberOfRows(); ++ r )\n      {\n      cout << \"   \";\n      for ( int c = 0; c < outputMeta->GetNumberOfColumns(); ++ c )\n        {\n        cout << outputMeta->GetColumnName( c )\n             << \"=\"\n             << outputMeta->GetValue( r, c ).ToString()\n             << \"  \";\n        }\n      cout << \"\\n\";\n      }\n    }\n\n  \/\/ Clean up\n  pcs->Delete();\n  inputData->Delete();\n}\n\n\/\/----------------------------------------------------------------------------\nint main( int argc, char** argv )\n{\n  int testValue = 0;\n\n  \/\/ Note that this will create a vtkMPIController if MPI\n  \/\/ is configured, vtkThreadedController otherwise.\n  vtkMPIController* controller = vtkMPIController::New();\n  controller->Initialize( &argc, &argv );\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 ( controller->IsA( \"vtkThreadedController\" ) )\n    {\n    \/\/ Set the number of processes to 2 for this example.\n    controller->SetNumberOfProcesses( 2 );\n    } \n\n  \/\/ Check how many processes have been made available\n  int numProcs = controller->GetNumberOfProcesses();\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"# Running test with \"\n         << numProcs\n         << \" processes...\\n\";\n    }\n\n  \/\/ Execute the function named \"process\" on both processes\n  controller->SetSingleMethod( RandomSampleStatistics, 0 );\n  controller->SingleMethodExecute();\n  \n  \/\/ Clean up and exit\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n# Test completed.\\n\\n\";\n    }\n\n  controller->Finalize();\n  controller->Delete();\n  \n  return testValue;\n}\n<commit_msg>ENH: time the parallel correlative engine, too ENH: report only human-understandable parts of the statistical model<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    TestParallelRandomStatistics.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, there is a non-exclusive\n * license for use of this work by or on behalf of the\n * U.S. Government. Redistribution and use in source and binary forms, with\n * or without modification, are permitted provided that this Notice and any\n * statement of authorship are reproduced on all copies.\n *\/\n\/\/ .SECTION Thanks\n\/\/ Thanks to Philippe Pebay and David Thompson from Sandia National Laboratories \n\/\/ for implementing this test.\n\n#include <mpi.h>\n#include <time.h>\n\n#include \"vtkDescriptiveStatistics.h\"\n#include \"vtkPDescriptiveStatistics.h\"\n#include \"vtkCorrelativeStatistics.h\"\n#include \"vtkPCorrelativeStatistics.h\"\n\n#include \"vtkDoubleArray.h\"\n#include \"vtkMath.h\"\n#include \"vtkMPIController.h\"\n#include \"vtkStdString.h\"\n#include \"vtkTable.h\"\n#include \"vtkVariantArray.h\"\n\n\/\/ For debugging purposes, serial engines can be run on each slice of the distributed data set\n#define DEBUG_WITH_SERIAL_STATS 0 \n\nint nVals = 1000000;\n\n\/\/ This will be called by all processes\nvoid RandomSampleStatistics( vtkMultiProcessController* controller, void* vtkNotUsed(arg) )\n{\n  \/\/ Get local rank\n  int myRank = controller->GetLocalProcessId();\n\n  \/\/ Seed random number generator\n  vtkMath::RandomSeed( static_cast<int>( time( NULL ) ) * ( myRank + 1 ) );\n\n  \/\/ Generate an input table that contains samples of mutually independent random variables over [0, 1]\n  int nUniform = 2;\n  int nNormal  = 2;\n  int nVariables = nUniform + nNormal;\n\n  vtkTable* inputData = vtkTable::New();\n  vtkDoubleArray* doubleArray[4];\n  vtkStdString columnNames[] = { \"Standard Uniform 0\", \n                                 \"Standard Uniform 1\",\n                                 \"Standard Normal 0\",\n                                 \"Standard Normal 1\" };\n  \n  \/\/ Standard uniform samples\n  for ( int c = 0; c < nUniform; ++ c )\n    {\n    doubleArray[c] = vtkDoubleArray::New();\n    doubleArray[c]->SetNumberOfComponents( 1 );\n    doubleArray[c]->SetName( columnNames[c] );\n\n    double x;\n    for ( int r = 0; r < nVals; ++ r )\n      {\n      x = vtkMath::Random();\n      doubleArray[c]->InsertNextValue( x );\n      }\n    \n    inputData->AddColumn( doubleArray[c] );\n    doubleArray[c]->Delete();\n    }\n\n  \/\/ Standard normal samples\n  for ( int c = nUniform; c < nVariables; ++ c )\n    {\n    doubleArray[c] = vtkDoubleArray::New();\n    doubleArray[c]->SetNumberOfComponents( 1 );\n    doubleArray[c]->SetName( columnNames[c] );\n\n    double x;\n    for ( int r = 0; r < nVals; ++ r )\n      {\n      x = vtkMath::Gaussian();\n      doubleArray[c]->InsertNextValue( x );\n      }\n    \n    inputData->AddColumn( doubleArray[c] );\n    doubleArray[c]->Delete();\n    }\n\n#if DEBUG_WITH_SERIAL_STATS\n  \/\/ Instantiate a (serial) descriptive statistics engine and set its ports\n  vtkDescriptiveStatistics* ds = vtkDescriptiveStatistics::New();\n  ds->SetInput( 0, inputData );\n\n  \/\/ Select all columns\n  for ( int c = 0; c < nVariables; ++ c )\n    {\n    ds->AddColumn( columnNames[c] );\n    }\n\n  \/\/ Test (serially) with Learn and Derive options only\n  ds->SetLearn( true );\n  ds->SetDerive( true );\n  ds->SetAssess( true );\n  ds->Update();\n\n  cout << \"\\n## Proc \"\n       << myRank\n       << \" calculated the following statistics ( \"\n       << ds->GetSampleSize()\n       << \" entries per column ):\\n\";\n  for ( vtkIdType r = 0; r < ds->GetOutput( 1 )->GetNumberOfRows(); ++ r )\n    {\n    cout << \"   \";\n    for ( int i = 0; i < ds->GetOutput( 1 )->GetNumberOfColumns(); ++ i )\n      {\n      cout << ds->GetOutput( 1 )->GetColumnName( i )\n           << \"=\"\n           << ds->GetOutput( 1 )->GetValue( r, i ).ToString()\n           << \"  \";\n      }\n    cout << \"\\n\";\n    }\n  \n  \/\/ Clean up\n  ds->Delete();\n#endif \/\/DEBUG_WITH_SERIAL_STATS\n\n  \/\/ Synchronize and start clock\n  controller->Barrier();\n  time_t t0;\n  time ( &t0 );\n  \n  \/\/ Instantiate a parallel descriptive statistics engine and set its ports\n  vtkPDescriptiveStatistics* pds = vtkPDescriptiveStatistics::New();\n  pds->SetInput( 0, inputData );\n  vtkTable* outputData = pds->GetOutput( 0 );\n  vtkTable* outputMeta = pds->GetOutput( 1 );\n\n  \/\/ Select all columns\n  for ( int c = 0; c < nVariables; ++ c )\n    {\n    pds->AddColumn( columnNames[c] );\n    }\n\n  \/\/ Test (in parallel) with Learn, Derive, and Assess options turned on\n  pds->SetLearn( true );\n  pds->SetDerive( true );\n  pds->SetAssess( true );\n  pds->SignedDeviationsOff(); \/\/ Use unsigned deviations\n  pds->Update();\n\n  \/\/ Synchronize and stop clock\n  controller->Barrier();\n  time_t t1;\n  time ( &t1 );\n\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Completed parallel calculation of descriptive statistics (with assessment):\\n\"\n         << \"   Total sample size: \"\n         << pds->GetSampleSize()\n         << \" \\n\"\n         << \"   Wall time: \"\n         << difftime( t1, t0 )\n         << \" sec.\\n\";\n\n   for ( vtkIdType r = 0; r < outputMeta->GetNumberOfRows(); ++ r )\n      {\n      cout << \"   \";\n      for ( int c = 0; c < outputMeta->GetNumberOfColumns(); ++ c )\n        {\n        vtkStdString colName = outputMeta->GetColumnName( c );\n\n        \/\/ Do not report M aggregates\n        if ( colName[0] == 'M' && colName[1] != 'e' )\n          {\n          continue;\n          }\n\n        cout << colName\n             << \"=\"\n             << outputMeta->GetValue( r, c ).ToString()\n             << \"  \";\n        }\n      cout << \"\\n\";\n      }\n    }\n  \n  \/\/ Verify that the DISTRIBUTED standard normal samples indeed statisfy the 68-95-99.7 rule\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Verifying whether the distributed standard normal samples satisfy the 68-95-99.7 rule:\\n\";\n    }\n  \n  vtkVariantArray* relDev[2];\n  relDev[0] = vtkVariantArray::SafeDownCast(\n    outputData->GetColumnByName( \"Relative Deviation(Standard Normal 0)\" ) );\n  relDev[1] = vtkVariantArray::SafeDownCast(\n    outputData->GetColumnByName( \"Relative Deviation(Standard Normal 1)\" ) );\n\n  if ( !relDev[0] || ! relDev[1] )\n    {\n    cout << \"*** Error: \"\n         << \"Empty output column(s) on process \"\n         << controller->GetLocalProcessId()\n         << \".\\n\";\n    }\n\n  for ( int c = 0; c < nNormal; ++ c )\n    {\n    int outsideStdv_l[] = { 0, 0, 0 };\n    double dev;\n    int n = outputData->GetNumberOfRows();\n    for ( vtkIdType r = 0; r < n; ++ r )\n      {\n      dev = relDev[c]->GetValue( r ).ToDouble();\n      if ( dev >= 1. )\n        {\n        ++ outsideStdv_l[0];\n        if ( dev >= 2. )\n          {\n          ++ outsideStdv_l[1];\n          if ( dev >= 3. )\n            {\n            ++ outsideStdv_l[2];\n            }\n          }\n        }\n      }\n\n    \/\/ Sum all local counters\n    int outsideStdv_g[3];\n    controller->AllReduce( outsideStdv_l, \n                           outsideStdv_g, \n                           3, \n                           vtkCommunicator::SUM_OP );\n\n    \/\/ Print out percentages of sample points within 1, 2, and 3 standard deviations of the mean.\n    if ( ! controller->GetLocalProcessId() )\n      {\n      cout << \"   \"\n           << outputData->GetColumnName( nUniform + c )\n           << \":\\n\";\n      for ( int i = 0; i < 3; ++ i )\n        {\n        cout << \"      \" \n             << ( 1. - outsideStdv_g[i] \/ static_cast<double>( pds->GetSampleSize() ) ) * 100.\n             << \"\\% within \"\n             << i + 1\n             << \" standard deviation(s) from the mean.\\n\";\n        }\n      }\n    }\n\n  \/\/ Clean up\n  pds->Delete();\n\n  \/\/ Synchronize and start clock\n  controller->Barrier();\n  time_t t2;\n  time ( &t2 );\n\n  \/\/ Instantiate a parallel correlative statistics engine and set its ports\n  vtkPCorrelativeStatistics* pcs = vtkPCorrelativeStatistics::New();\n  pcs->SetInput( 0, inputData );\n  outputData = pcs->GetOutput( 0 );\n  outputMeta = pcs->GetOutput( 1 );\n\n  \/\/ Select column pairs (uniform vs. uniform, normal vs. normal)\n  pcs->AddColumnPair( columnNames[0], columnNames[1] );\n  pcs->AddColumnPair( columnNames[2], columnNames[3] );\n\n  \/\/ Test (in parallel) with Learn, Derive, and Assess options turned on\n  pcs->SetLearn( true );\n  pcs->SetDerive( true );\n  pcs->SetAssess( true );\n  pcs->Update();\n\n    \/\/ Synchronize and stop clock\n  controller->Barrier();\n  time_t t3;\n  time ( &t3 );\n\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n## Completed parallel calculation of correlative statistics (with assessment):\\n\"\n         << \"   Total sample size: \"\n         << pcs->GetSampleSize()\n         << \" \\n\"\n         << \"   Wall time: \"\n         << difftime( t3, t2 )\n         << \" sec.\\n\";\n\n    for ( vtkIdType r = 0; r < outputMeta->GetNumberOfRows(); ++ r )\n      {\n      cout << \"   \";\n      for ( int c = 0; c < outputMeta->GetNumberOfColumns(); ++ c )\n        {\n        vtkStdString colName = outputMeta->GetColumnName( c );\n\n        \/\/ Do not report M aggregates\n        if ( colName[0] == 'M' && colName[1] != 'e' )\n          {\n          continue;\n          }\n\n        cout << colName\n             << \"=\"\n             << outputMeta->GetValue( r, c ).ToString()\n             << \"  \";\n        }\n      cout << \"\\n\";\n      }\n    }\n\n  \/\/ Clean up\n  pcs->Delete();\n  inputData->Delete();\n}\n\n\/\/----------------------------------------------------------------------------\nint main( int argc, char** argv )\n{\n  int testValue = 0;\n\n  \/\/ Note that this will create a vtkMPIController if MPI\n  \/\/ is configured, vtkThreadedController otherwise.\n  vtkMPIController* controller = vtkMPIController::New();\n  controller->Initialize( &argc, &argv );\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 ( controller->IsA( \"vtkThreadedController\" ) )\n    {\n    \/\/ Set the number of processes to 2 for this example.\n    controller->SetNumberOfProcesses( 2 );\n    } \n\n  \/\/ Check how many processes have been made available\n  int numProcs = controller->GetNumberOfProcesses();\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"# Running test with \"\n         << numProcs\n         << \" processes...\\n\";\n    }\n\n  \/\/ Execute the function named \"process\" on both processes\n  controller->SetSingleMethod( RandomSampleStatistics, 0 );\n  controller->SingleMethodExecute();\n  \n  \/\/ Clean up and exit\n  if ( ! controller->GetLocalProcessId() )\n    {\n    cout << \"\\n# Test completed.\\n\\n\";\n    }\n\n  controller->Finalize();\n  controller->Delete();\n  \n  return testValue;\n}\n<|endoftext|>"}
{"text":"<commit_before>%%\r\n%% Qt5xHb - Bindings libraries for Harbour\/xHarbour and Qt Framework 5\r\n%%\r\n%% Copyright (C) 2018 Marcos Antonio Gambeta <marcosgambeta AT outlook DOT com>\r\n%%\r\n\r\n$header\r\n\r\n#include <Qt>\r\n\r\n#ifndef __XHARBOUR__\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,8,0))\r\n#include <QtSerialBusVersion>\r\n#endif\r\n#endif\r\n\r\n#include \"qt5xhb_common.h\"\r\n#include \"qt5xhb_macros.h\"\r\n#include \"qt5xhb_utils.h\"\r\n\r\n#ifdef __XHARBOUR__\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,8,0))\r\n#include <QtSerialBusVersion>\r\n#endif\r\n#endif\r\n\r\nHB_FUNC( QTVIRTUALKEYBOARD_VERSION_STR )\r\n{\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,8,0))\r\n  hb_retc( (const char *) QTVIRTUALKEYBOARD_VERSION_STR );\r\n#else\r\n  hb_retc( (const char *) \"\" );\r\n#endif\r\n}\r\n\r\nHB_FUNC( QTVIRTUALKEYBOARD_VERSION )\r\n{\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,8,0))\r\n  hb_retni( QTVIRTUALKEYBOARD_VERSION );\r\n#else\r\n  hb_retni( 0 );\r\n#endif\r\n}\r\n<commit_msg>codegen\/QtVirtualKeyboard\/QtVirtualKeyboardVersion.cpp: fixed<commit_after>%%\r\n%% Qt5xHb - Bindings libraries for Harbour\/xHarbour and Qt Framework 5\r\n%%\r\n%% Copyright (C) 2018 Marcos Antonio Gambeta <marcosgambeta AT outlook DOT com>\r\n%%\r\n\r\n$header\r\n\r\n#include <Qt>\r\n\r\n#ifndef __XHARBOUR__\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,8,0))\r\n#include <QtVirtualKeyboardVersion>\r\n#endif\r\n#endif\r\n\r\n#include \"qt5xhb_common.h\"\r\n#include \"qt5xhb_macros.h\"\r\n#include \"qt5xhb_utils.h\"\r\n\r\n#ifdef __XHARBOUR__\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,8,0))\r\n#include <QtVirtualKeyboardVersion>\r\n#endif\r\n#endif\r\n\r\nHB_FUNC( QTVIRTUALKEYBOARD_VERSION_STR )\r\n{\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,8,0))\r\n  hb_retc( (const char *) QTVIRTUALKEYBOARD_VERSION_STR );\r\n#else\r\n  hb_retc( (const char *) \"\" );\r\n#endif\r\n}\r\n\r\nHB_FUNC( QTVIRTUALKEYBOARD_VERSION )\r\n{\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,8,0))\r\n  hb_retni( QTVIRTUALKEYBOARD_VERSION );\r\n#else\r\n  hb_retni( 0 );\r\n#endif\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Filename: bulletRigidBodyNode.cxx\n\/\/ Created by:  enn0x (19Nov10)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) Carnegie Mellon University.  All rights reserved.\n\/\/\n\/\/ All use of this software is subject to the terms of the revised BSD\n\/\/ license.  You should have received a copy of this license along\n\/\/ with this source code in a file named \"LICENSE.\"\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"bulletRigidBodyNode.h\"\n#include \"bulletShape.h\"\n\nTypeHandle BulletRigidBodyNode::_type_handle;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::Constructor\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nBulletRigidBodyNode::\nBulletRigidBodyNode(const char *name) : BulletBodyNode(name) {\n\n  \/\/ Synchronised transform\n  _sync = TransformState::make_identity();\n  _sync_disable = false;\n\n  \/\/ Mass properties\n  btScalar mass(0.0);\n  btVector3 inertia(0, 0, 0);\n\n  \/\/ Motion state and construction info\n  MotionState *motion = new MotionState(_sync);\n  btRigidBody::btRigidBodyConstructionInfo ci(mass, motion, _shape, inertia);\n\n  \/\/ Additional damping\n  if (bullet_additional_damping) {\n    ci.m_additionalDamping = true;\n    ci.m_additionalDampingFactor = bullet_additional_damping_linear_factor;\n    ci.m_additionalLinearDampingThresholdSqr = bullet_additional_damping_linear_threshold;\n    ci.m_additionalAngularDampingFactor = bullet_additional_damping_angular_factor;\n    ci.m_additionalAngularDampingThresholdSqr = bullet_additional_damping_angular_threshold;\n  }\n\n  \/\/ Rigid body\n  _rigid = new btRigidBody(ci);\n  _rigid->setUserPointer(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::output\n\/\/       Access: Public, Virtual\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\noutput(ostream &out) const {\n\n  BulletBodyNode::output(out);\n\n  out << \" mass=\" << get_mass();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_object\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbtCollisionObject *BulletRigidBodyNode::\nget_object() const {\n\n  return _rigid;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::shape_changed\n\/\/       Access: Published\n\/\/  Description: Hook which will be called whenever the total shape\n\/\/               of a body changed. Used for example to update\n\/\/               the mass properties (inertia) of a rigid body.\n\/\/               The default implementation does nothing.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nshape_changed() {\n\n  set_mass(get_mass());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_mass\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_mass(float mass) {\n\n  btScalar bt_mass = mass;\n  btVector3 bt_inertia(0.0, 0.0, 0.0);\n\n  if (bt_mass > 0.0) {\n    _rigid->getCollisionShape()->calculateLocalInertia(bt_mass, bt_inertia);\n  }\n\n  _rigid->setMassProps(bt_mass, bt_inertia);\n  _rigid->updateInertiaTensor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_mass\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nfloat BulletRigidBodyNode::\nget_mass() const {\n\n  btScalar inv_mass = _rigid->getInvMass();\n  btScalar mass = inv_mass == btScalar(0.0) ? btScalar(0.0) : btScalar(1.0) \/ inv_mass;\n\n  return mass;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_inertia\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_inertia(const LVecBase3f &inertia) {\n\n  btVector3 inv_inertia(\n    inertia.get_x() == 0.0 ? btScalar(0.0) : btScalar(1.0 \/ inertia.get_x()),\n    inertia.get_y() == 0.0 ? btScalar(0.0) : btScalar(1.0 \/ inertia.get_y()),\n    inertia.get_z() == 0.0 ? btScalar(0.0) : btScalar(1.0 \/ inertia.get_z())\n    );\n\n  _rigid->setInvInertiaDiagLocal(inv_inertia);\n  _rigid->updateInertiaTensor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_inertia\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLVector3f BulletRigidBodyNode::\nget_inertia() const {\n\n  btVector3 inv_inertia = _rigid->getInvInertiaDiagLocal();\n  LVector3f inertia(\n    inv_inertia.x() == btScalar(0.0) ? 0.0 : 1.0 \/ inv_inertia.x(),\n    inv_inertia.y() == btScalar(0.0) ? 0.0 : 1.0 \/ inv_inertia.y(),\n    inv_inertia.z() == btScalar(0.0) ? 0.0 : 1.0 \/ inv_inertia.z()\n    );\n\n  return inertia;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_force\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_force(const LVector3f &force, const LPoint3f &pos) {\n\n  nassertv_always(!force.is_nan());\n  nassertv_always(!pos.is_nan());\n\n  _rigid->applyForce(LVecBase3f_to_btVector3(force),\n                     LVecBase3f_to_btVector3(pos));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_central_force\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_central_force(const LVector3f &force) {\n\n  nassertv_always(!force.is_nan());\n\n  _rigid->applyCentralForce(LVecBase3f_to_btVector3(force));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_torque\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_torque(const LVector3f &torque) {\n\n  nassertv_always(!torque.is_nan());\n\n  _rigid->applyTorque(LVecBase3f_to_btVector3(torque));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_torque_impulse\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_torque_impulse(const LVector3f &torque) {\n\n  nassertv_always(!torque.is_nan());\n\n  _rigid->applyTorqueImpulse(LVecBase3f_to_btVector3(torque));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_impulse\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_impulse(const LVector3f &impulse, const LPoint3f &pos) {\n\n  nassertv_always(!impulse.is_nan());\n  nassertv_always(!pos.is_nan());\n\n  _rigid->applyImpulse(LVecBase3f_to_btVector3(impulse),\n                       LVecBase3f_to_btVector3(pos));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_central_impulse\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_central_impulse(const LVector3f &impulse) {\n\n  nassertv_always(!impulse.is_nan());\n\n  _rigid->applyCentralImpulse(LVecBase3f_to_btVector3(impulse));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::transform_changed\n\/\/       Access: Protected\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\ntransform_changed() {\n\n  if (_sync_disable) return;\n\n  NodePath np = NodePath::any_path((PandaNode *)this);\n  CPT(TransformState) ts = np.get_net_transform();\n\n  LMatrix4f m_sync = _sync->get_mat();\n  LMatrix4f m_ts = ts->get_mat();\n\n  if (!m_sync.almost_equal(m_ts)) {\n    _sync = ts;\n\n    btTransform trans = TransformState_to_btTrans(ts);\n    _rigid->setCenterOfMassTransform(trans);\n\n    if (ts->has_scale()) {\n      LVecBase3f scale = ts->get_scale();\n      if (!scale.almost_equal(LVecBase3f(1.0f, 1.0f, 1.0f))) {\n        for (int i=0; i<get_num_shapes(); i++) {\n          PT(BulletShape) shape = _shapes[i];\n          shape->set_local_scale(scale);\n        }\n\n        shape_changed();\n      }\n    }\n\n    \/\/ Activate the body if it has been sleeping\n    if (!_rigid->isActive()) {\n      _rigid->activate(true);\n    }\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::sync_p2b\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nsync_p2b() {\n\n  transform_changed();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::sync_b2p\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nsync_b2p() {\n\n  NodePath np = NodePath::any_path((PandaNode *)this);\n  LVecBase3f scale = np.get_net_transform()->get_scale();\n\n  btTransform trans = _rigid->getWorldTransform();\n  CPT(TransformState) ts = btTrans_to_TransformState(trans, scale);\n\n  LMatrix4f m_sync = _sync->get_mat();\n  LMatrix4f m_ts = ts->get_mat();\n\n  if (!m_sync.almost_equal(m_ts)) {\n    _sync = ts;\n    _sync_disable = true;\n    np.set_transform(NodePath(), ts);\n    _sync_disable = false;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_linear_velocity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLVector3f BulletRigidBodyNode::\nget_linear_velocity() const {\n\n  return btVector3_to_LVector3f(_rigid->getLinearVelocity());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_angular_velocity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLVector3f BulletRigidBodyNode::\nget_angular_velocity() const {\n\n  return btVector3_to_LVector3f(_rigid->getAngularVelocity());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_linear_velocity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_linear_velocity(const LVector3f &velocity) {\n\n  nassertv_always(!velocity.is_nan());\n\n  _rigid->setLinearVelocity(LVecBase3f_to_btVector3(velocity));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_angular_velocity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_angular_velocity(const LVector3f &velocity) {\n\n  nassertv_always(!velocity.is_nan());\n\n  _rigid->setAngularVelocity(LVecBase3f_to_btVector3(velocity));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::clear_forces\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nclear_forces() {\n\n  _rigid->clearForces();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_linear_sleep_threshold\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nfloat BulletRigidBodyNode::\nget_linear_sleep_threshold() const {\n\n  return _rigid->getLinearSleepingThreshold();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_angular_sleep_threshold\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nfloat BulletRigidBodyNode::\nget_angular_sleep_threshold() const {\n\n  return _rigid->getAngularSleepingThreshold();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_linear_sleep_threshold\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_linear_sleep_threshold(float threshold) {\n\n  _rigid->setSleepingThresholds(_rigid->getLinearSleepingThreshold(), threshold);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_angular_sleep_threshold\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_angular_sleep_threshold(float threshold) {\n\n  _rigid->setSleepingThresholds(threshold, _rigid->getAngularSleepingThreshold());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_gravity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_gravity(const LVector3f &gravity) {\n\n  nassertv_always(!gravity.is_nan());\n\n  _rigid->setGravity(LVecBase3f_to_btVector3(gravity));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_gravity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLVector3f BulletRigidBodyNode::\nget_gravity() const {\n\n  return btVector3_to_LVector3f(_rigid->getGravity());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_linear_factor\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_linear_factor(const LVector3f &factor) {\n\n  _rigid->setLinearFactor(LVecBase3f_to_btVector3(factor));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_angular_factor\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_angular_factor(const LVector3f &factor) {\n\n  _rigid->setAngularFactor(LVecBase3f_to_btVector3(factor));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::MotionState::getWorldTransform\n\/\/       Access: Public\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::MotionState::\ngetWorldTransform(btTransform &trans) const {\n\n  trans = TransformState_to_btTrans(_sync);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::MotionState::setWorldTransform\n\/\/       Access: Public\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::MotionState::\nsetWorldTransform(const btTransform &trans) {\n\n}\n\n<commit_msg>Added some documentation.<commit_after>\/\/ Filename: bulletRigidBodyNode.cxx\n\/\/ Created by:  enn0x (19Nov10)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) Carnegie Mellon University.  All rights reserved.\n\/\/\n\/\/ All use of this software is subject to the terms of the revised BSD\n\/\/ license.  You should have received a copy of this license along\n\/\/ with this source code in a file named \"LICENSE.\"\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"bulletRigidBodyNode.h\"\n#include \"bulletShape.h\"\n\nTypeHandle BulletRigidBodyNode::_type_handle;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::Constructor\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nBulletRigidBodyNode::\nBulletRigidBodyNode(const char *name) : BulletBodyNode(name) {\n\n  \/\/ Synchronised transform\n  _sync = TransformState::make_identity();\n  _sync_disable = false;\n\n  \/\/ Mass properties\n  btScalar mass(0.0);\n  btVector3 inertia(0, 0, 0);\n\n  \/\/ Motion state and construction info\n  MotionState *motion = new MotionState(_sync);\n  btRigidBody::btRigidBodyConstructionInfo ci(mass, motion, _shape, inertia);\n\n  \/\/ Additional damping\n  if (bullet_additional_damping) {\n    ci.m_additionalDamping = true;\n    ci.m_additionalDampingFactor = bullet_additional_damping_linear_factor;\n    ci.m_additionalLinearDampingThresholdSqr = bullet_additional_damping_linear_threshold;\n    ci.m_additionalAngularDampingFactor = bullet_additional_damping_angular_factor;\n    ci.m_additionalAngularDampingThresholdSqr = bullet_additional_damping_angular_threshold;\n  }\n\n  \/\/ Rigid body\n  _rigid = new btRigidBody(ci);\n  _rigid->setUserPointer(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::output\n\/\/       Access: Public, Virtual\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\noutput(ostream &out) const {\n\n  BulletBodyNode::output(out);\n\n  out << \" mass=\" << get_mass();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_object\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbtCollisionObject *BulletRigidBodyNode::\nget_object() const {\n\n  return _rigid;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::shape_changed\n\/\/       Access: Published\n\/\/  Description: Hook which should be called whenever the total\n\/\/               shape of a body changed. Used for example to update\n\/\/               the mass properties (inertia) of a rigid body.\n\/\/               The default implementation does nothing.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nshape_changed() {\n\n  set_mass(get_mass());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_mass\n\/\/       Access: Published\n\/\/  Description: Sets the mass of a rigid body. This also modifies\n\/\/               the inertia, which is automatically computed from\n\/\/               the shape of the body. Setting a value of zero\n\/\/               for mass will make the body static. A value of\n\/\/               zero can be considered an infinite mass.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_mass(float mass) {\n\n  btScalar bt_mass = mass;\n  btVector3 bt_inertia(0.0, 0.0, 0.0);\n\n  if (bt_mass > 0.0) {\n    _rigid->getCollisionShape()->calculateLocalInertia(bt_mass, bt_inertia);\n  }\n\n  _rigid->setMassProps(bt_mass, bt_inertia);\n  _rigid->updateInertiaTensor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_mass\n\/\/       Access: Published\n\/\/  Description: Returns the total mass of a rigid body.\n\/\/               A value of zero means that the body is staic, i.e.\n\/\/               has an infinite mass.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nfloat BulletRigidBodyNode::\nget_mass() const {\n\n  btScalar inv_mass = _rigid->getInvMass();\n  btScalar mass = inv_mass == btScalar(0.0) ? btScalar(0.0) : btScalar(1.0) \/ inv_mass;\n\n  return mass;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_inertia\n\/\/       Access: Published\n\/\/  Description: Sets the inertia of a rigid body. Inertia is given\n\/\/               as a three-component vector. A component value of\n\/\/               zero means infinite inertia along this direction.\n\/\/               Setting the intertia will override the value which\n\/\/               is automatically calculated from the rigid bodies\n\/\/               shape. However, it is possible that automatic\n\/\/               calculation of intertia is trigger after calling\n\/\/               this method, and thus overwriting the explicitly\n\/\/               set value again. This happens when:\n\/\/               (a) the mass is set after the inertia.\n\/\/               (b) a shape is added or removed from the body.\n\/\/               (c) the scale of the body changed.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_inertia(const LVecBase3f &inertia) {\n\n  btVector3 inv_inertia(\n    inertia.get_x() == 0.0 ? btScalar(0.0) : btScalar(1.0 \/ inertia.get_x()),\n    inertia.get_y() == 0.0 ? btScalar(0.0) : btScalar(1.0 \/ inertia.get_y()),\n    inertia.get_z() == 0.0 ? btScalar(0.0) : btScalar(1.0 \/ inertia.get_z())\n    );\n\n  _rigid->setInvInertiaDiagLocal(inv_inertia);\n  _rigid->updateInertiaTensor();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_inertia\n\/\/       Access: Published\n\/\/  Description: Returns the inertia of the rigid body. Inertia is\n\/\/               given as a three component vector. A component\n\/\/               value of zero means infinite inertia along this\n\/\/               direction.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLVector3f BulletRigidBodyNode::\nget_inertia() const {\n\n  btVector3 inv_inertia = _rigid->getInvInertiaDiagLocal();\n  LVector3f inertia(\n    inv_inertia.x() == btScalar(0.0) ? 0.0 : 1.0 \/ inv_inertia.x(),\n    inv_inertia.y() == btScalar(0.0) ? 0.0 : 1.0 \/ inv_inertia.y(),\n    inv_inertia.z() == btScalar(0.0) ? 0.0 : 1.0 \/ inv_inertia.z()\n    );\n\n  return inertia;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_force\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_force(const LVector3f &force, const LPoint3f &pos) {\n\n  nassertv_always(!force.is_nan());\n  nassertv_always(!pos.is_nan());\n\n  _rigid->applyForce(LVecBase3f_to_btVector3(force),\n                     LVecBase3f_to_btVector3(pos));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_central_force\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_central_force(const LVector3f &force) {\n\n  nassertv_always(!force.is_nan());\n\n  _rigid->applyCentralForce(LVecBase3f_to_btVector3(force));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_torque\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_torque(const LVector3f &torque) {\n\n  nassertv_always(!torque.is_nan());\n\n  _rigid->applyTorque(LVecBase3f_to_btVector3(torque));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_torque_impulse\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_torque_impulse(const LVector3f &torque) {\n\n  nassertv_always(!torque.is_nan());\n\n  _rigid->applyTorqueImpulse(LVecBase3f_to_btVector3(torque));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_impulse\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_impulse(const LVector3f &impulse, const LPoint3f &pos) {\n\n  nassertv_always(!impulse.is_nan());\n  nassertv_always(!pos.is_nan());\n\n  _rigid->applyImpulse(LVecBase3f_to_btVector3(impulse),\n                       LVecBase3f_to_btVector3(pos));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::apply_central_impulse\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\napply_central_impulse(const LVector3f &impulse) {\n\n  nassertv_always(!impulse.is_nan());\n\n  _rigid->applyCentralImpulse(LVecBase3f_to_btVector3(impulse));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::transform_changed\n\/\/       Access: Protected\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\ntransform_changed() {\n\n  if (_sync_disable) return;\n\n  NodePath np = NodePath::any_path((PandaNode *)this);\n  CPT(TransformState) ts = np.get_net_transform();\n\n  LMatrix4f m_sync = _sync->get_mat();\n  LMatrix4f m_ts = ts->get_mat();\n\n  if (!m_sync.almost_equal(m_ts)) {\n    _sync = ts;\n\n    btTransform trans = TransformState_to_btTrans(ts);\n    _rigid->setCenterOfMassTransform(trans);\n\n    if (ts->has_scale()) {\n      LVecBase3f scale = ts->get_scale();\n      if (!scale.almost_equal(LVecBase3f(1.0f, 1.0f, 1.0f))) {\n        for (int i=0; i<get_num_shapes(); i++) {\n          PT(BulletShape) shape = _shapes[i];\n          shape->set_local_scale(scale);\n        }\n\n        shape_changed();\n      }\n    }\n\n    \/\/ Activate the body if it has been sleeping\n    if (!_rigid->isActive()) {\n      _rigid->activate(true);\n    }\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::sync_p2b\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nsync_p2b() {\n\n  transform_changed();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::sync_b2p\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nsync_b2p() {\n\n  NodePath np = NodePath::any_path((PandaNode *)this);\n  LVecBase3f scale = np.get_net_transform()->get_scale();\n\n  btTransform trans = _rigid->getWorldTransform();\n  CPT(TransformState) ts = btTrans_to_TransformState(trans, scale);\n\n  LMatrix4f m_sync = _sync->get_mat();\n  LMatrix4f m_ts = ts->get_mat();\n\n  if (!m_sync.almost_equal(m_ts)) {\n    _sync = ts;\n    _sync_disable = true;\n    np.set_transform(NodePath(), ts);\n    _sync_disable = false;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_linear_velocity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLVector3f BulletRigidBodyNode::\nget_linear_velocity() const {\n\n  return btVector3_to_LVector3f(_rigid->getLinearVelocity());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_angular_velocity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLVector3f BulletRigidBodyNode::\nget_angular_velocity() const {\n\n  return btVector3_to_LVector3f(_rigid->getAngularVelocity());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_linear_velocity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_linear_velocity(const LVector3f &velocity) {\n\n  nassertv_always(!velocity.is_nan());\n\n  _rigid->setLinearVelocity(LVecBase3f_to_btVector3(velocity));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_angular_velocity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_angular_velocity(const LVector3f &velocity) {\n\n  nassertv_always(!velocity.is_nan());\n\n  _rigid->setAngularVelocity(LVecBase3f_to_btVector3(velocity));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::clear_forces\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nclear_forces() {\n\n  _rigid->clearForces();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_linear_sleep_threshold\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nfloat BulletRigidBodyNode::\nget_linear_sleep_threshold() const {\n\n  return _rigid->getLinearSleepingThreshold();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_angular_sleep_threshold\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nfloat BulletRigidBodyNode::\nget_angular_sleep_threshold() const {\n\n  return _rigid->getAngularSleepingThreshold();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_linear_sleep_threshold\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_linear_sleep_threshold(float threshold) {\n\n  _rigid->setSleepingThresholds(_rigid->getLinearSleepingThreshold(), threshold);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_angular_sleep_threshold\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_angular_sleep_threshold(float threshold) {\n\n  _rigid->setSleepingThresholds(threshold, _rigid->getAngularSleepingThreshold());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_gravity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_gravity(const LVector3f &gravity) {\n\n  nassertv_always(!gravity.is_nan());\n\n  _rigid->setGravity(LVecBase3f_to_btVector3(gravity));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::get_gravity\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLVector3f BulletRigidBodyNode::\nget_gravity() const {\n\n  return btVector3_to_LVector3f(_rigid->getGravity());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_linear_factor\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_linear_factor(const LVector3f &factor) {\n\n  _rigid->setLinearFactor(LVecBase3f_to_btVector3(factor));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::set_angular_factor\n\/\/       Access: Published\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::\nset_angular_factor(const LVector3f &factor) {\n\n  _rigid->setAngularFactor(LVecBase3f_to_btVector3(factor));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::MotionState::getWorldTransform\n\/\/       Access: Public\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::MotionState::\ngetWorldTransform(btTransform &trans) const {\n\n  trans = TransformState_to_btTrans(_sync);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BulletRigidBodyNode::MotionState::setWorldTransform\n\/\/       Access: Public\n\/\/  Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BulletRigidBodyNode::MotionState::\nsetWorldTransform(const btTransform &trans) {\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * $Id: field.cc,v 2.7 2005\/10\/20 11:24:12 martin Exp $\n * Copyright (c) 2004, 2005, Voidsoft AB\n *\/\n\n#include <iostream>\n#include \"field.hh\"\n#include \"tdspp.hh\" \/\/ for TDSPP::Exception\n\n\/** Class Field *\/\n\/** Constructor *\/\nField::Field()\n    : data(NULL) {\n}\n\nField::Field(string name, int size) {\n    colname = name;\n    data = new char[size] = {0};\n}\n\n\/** Destructor *\/\nField::~Field() {\n    delete [] data; \n}\n\nstring Field::tostr() {\n    if (!data) throw TDSPP::Exception(\"Field::tostr: Data not initialized\");\n    return data;\n}\n\n\/* Not implemented *\/\nlong Field::toint() {\n    if (!data) throw TDSPP::Exception(\"Field::toint: Data not initialized\");\n    return 0;\n}\n\n\/** Class Rows *\/\n\/** Constructor *\/\nRows::Rows()\n    : currentrow(0) {\n}\n\n\/** Destructor *\/\nRows::~Rows() {\n    clear();\n}\n\nvoid Rows::clear(void) {\n    while (rows.size()) {\n        while (rows[rows.size()-1].size()) {\n            delete rows[rows.size()-1].back();\n            rows[rows.size()-1].pop_back();\n        }\n        rows.pop_back();\n    }\n}\n\nvoid Rows::printheader(void) {\n    cout << \"| \";\n    for (unsigned int i=0; i < rows[currentrow].size(); i++) {\n        cout << rows[currentrow][i]->colname << \" | \";\n    }\n    cout << endl;\n}\n\nvoid Rows::print(void) {\n    for (unsigned int i=0; i < rows[currentrow].size(); i++) {\n        cout << rows[currentrow][i]->colname << \n            \"=\" << rows[currentrow][i]->tostr() << endl;\n    }\n}\n<commit_msg>More portable initialitation mode Extended initializer lists only available with -std=c++0x or -std=gnu++0x<commit_after>\/*\n * $Id: field.cc,v 2.7 2005\/10\/20 11:24:12 martin Exp $\n * Copyright (c) 2004, 2005, Voidsoft AB\n *\/\n\n#include <iostream>\n#include \"field.hh\"\n#include \"tdspp.hh\" \/\/ for TDSPP::Exception\n\n\/** Class Field *\/\n\/** Constructor *\/\nField::Field()\n    : data(NULL) {\n}\n\nField::Field(string name, int size) {\n    colname = name;\n    data = new char[size];\n    data[0] = 0;\n}\n\n\/** Destructor *\/\nField::~Field() {\n    delete [] data; \n}\n\nstring Field::tostr() {\n    if (!data) throw TDSPP::Exception(\"Field::tostr: Data not initialized\");\n    return data;\n}\n\n\/* Not implemented *\/\nlong Field::toint() {\n    if (!data) throw TDSPP::Exception(\"Field::toint: Data not initialized\");\n    return 0;\n}\n\n\/** Class Rows *\/\n\/** Constructor *\/\nRows::Rows()\n    : currentrow(0) {\n}\n\n\/** Destructor *\/\nRows::~Rows() {\n    clear();\n}\n\nvoid Rows::clear(void) {\n    while (rows.size()) {\n        while (rows[rows.size()-1].size()) {\n            delete rows[rows.size()-1].back();\n            rows[rows.size()-1].pop_back();\n        }\n        rows.pop_back();\n    }\n}\n\nvoid Rows::printheader(void) {\n    cout << \"| \";\n    for (unsigned int i=0; i < rows[currentrow].size(); i++) {\n        cout << rows[currentrow][i]->colname << \" | \";\n    }\n    cout << endl;\n}\n\nvoid Rows::print(void) {\n    for (unsigned int i=0; i < rows[currentrow].size(); i++) {\n        cout << rows[currentrow][i]->colname << \n            \"=\" << rows[currentrow][i]->tostr() << endl;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 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 \"cc\/layer_tree_host.h\"\n\n#include \"cc\/animation_curve.h\"\n#include \"cc\/layer.h\"\n#include \"cc\/layer_animation_controller.h\"\n#include \"cc\/layer_impl.h\"\n#include \"cc\/test\/fake_content_layer.h\"\n#include \"cc\/test\/fake_content_layer_client.h\"\n#include \"cc\/test\/layer_tree_test_common.h\"\n#include \"cc\/timing_function.h\"\n\nnamespace cc {\nnamespace {\n\nclass LayerTreeHostAnimationTest : public ThreadedTest {\n public:\n  virtual void setupTree() OVERRIDE {\n    ThreadedTest::setupTree();\n    m_layerTreeHost->rootLayer()->setLayerAnimationDelegate(this);\n  }\n};\n\n\/\/ Makes sure that setNeedsAnimate does not cause the commitRequested() state to\n\/\/ be set.\nclass LayerTreeHostAnimationTestSetNeedsAnimateShouldNotSetCommitRequested :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestSetNeedsAnimateShouldNotSetCommitRequested()\n      : num_commits_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void animate(base::TimeTicks monotonicTime) OVERRIDE {\n    \/\/ We skip the first commit becasue its the commit that populates the\n    \/\/ impl thread with a tree. After the second commit, the test is done.\n    if (num_commits_ != 1)\n      return;\n\n    m_layerTreeHost->setNeedsAnimate();\n    \/\/ Right now, commitRequested is going to be true, because during\n    \/\/ beginFrame, we force commitRequested to true to prevent requests from\n    \/\/ hitting the impl thread. But, when the next didCommit happens, we should\n    \/\/ verify that commitRequested has gone back to false.\n  }\n\n  virtual void didCommit() OVERRIDE {\n    if (!num_commits_) {\n      EXPECT_FALSE(m_layerTreeHost->commitRequested());\n      m_layerTreeHost->setNeedsAnimate();\n      EXPECT_FALSE(m_layerTreeHost->commitRequested());\n    }\n\n    \/\/ Verifies that the setNeedsAnimate we made in ::animate did not\n    \/\/ trigger commitRequested.\n    EXPECT_FALSE(m_layerTreeHost->commitRequested());\n    endTest();\n    num_commits_++;\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\n private:\n  int num_commits_;\n};\n\nMULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestSetNeedsAnimateShouldNotSetCommitRequested)\n\n\/\/ Trigger a frame with setNeedsCommit. Then, inside the resulting animate\n\/\/ callback, requet another frame using setNeedsAnimate. End the test when\n\/\/ animate gets called yet-again, indicating that the proxy is correctly\n\/\/ handling the case where setNeedsAnimate() is called inside the begin frame\n\/\/ flow.\nclass LayerTreeHostAnimationTestSetNeedsAnimateInsideAnimationCallback :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestSetNeedsAnimateInsideAnimationCallback()\n      : num_animates_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void animate(base::TimeTicks) OVERRIDE {\n    if (!num_animates_) {\n      m_layerTreeHost->setNeedsAnimate();\n      num_animates_++;\n      return;\n    }\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\n private:\n  int num_animates_;\n};\n\nMULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestSetNeedsAnimateInsideAnimationCallback)\n\n\/\/ Add a layer animation and confirm that\n\/\/ LayerTreeHostImpl::updateAnimationState does get called and continues to\n\/\/ get called.\nclass LayerTreeHostAnimationTestAddAnimation :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestAddAnimation()\n      : num_animates_(0)\n      , received_animation_started_notification_(false)\n      , start_time_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddInstantAnimationToMainThread();\n  }\n\n  virtual void updateAnimationState(\n      LayerTreeHostImpl* impl_host,\n      bool hasUnfinishedAnimation) OVERRIDE {\n    if (!num_animates_) {\n      \/\/ The animation had zero duration so layerTreeHostImpl should no\n      \/\/ longer need to animate its layers.\n      EXPECT_FALSE(hasUnfinishedAnimation);\n      num_animates_++;\n      return;\n    }\n    EXPECT_LT(0, start_time_);\n    EXPECT_TRUE(received_animation_started_notification_);\n    endTest();\n  }\n\n  virtual void notifyAnimationStarted(double wall_clock_time) OVERRIDE {\n    received_animation_started_notification_ = true;\n    start_time_ = wall_clock_time;\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\nprivate:\n  int num_animates_;\n  bool received_animation_started_notification_;\n  double start_time_;\n};\n\nMULTI_THREAD_TEST_F(LayerTreeHostAnimationTestAddAnimation)\n\n\/\/ Add a layer animation to a layer, but continually fail to draw. Confirm that\n\/\/ after a while, we do eventually force a draw.\nclass LayerTreeHostAnimationTestCheckerboardDoesNotStarveDraws :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestCheckerboardDoesNotStarveDraws()\n      : started_animating_(false) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(m_layerTreeHost->rootLayer());\n  }\n\n  virtual void animateLayers(\n      LayerTreeHostImpl* host_impl,\n      base::TimeTicks monotonicTime) OVERRIDE {\n    started_animating_ = true;\n  }\n\n  virtual void drawLayersOnThread(LayerTreeHostImpl*) OVERRIDE {\n    if (started_animating_)\n      endTest();\n  }\n\n  virtual bool prepareToDrawOnThread(\n      LayerTreeHostImpl* host_impl,\n      LayerTreeHostImpl::FrameData& frame,\n      bool result) OVERRIDE {\n    return false;\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\n private:\n  bool started_animating_;\n};\n\n\/\/ Starvation can only be an issue with the MT compositor.\nMULTI_THREAD_TEST_F(LayerTreeHostAnimationTestCheckerboardDoesNotStarveDraws)\n\n\/\/ Ensures that animations continue to be ticked when we are backgrounded.\nclass LayerTreeHostAnimationTestTickAnimationWhileBackgrounded :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestTickAnimationWhileBackgrounded()\n      : num_animates_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(m_layerTreeHost->rootLayer());\n  }\n\n  \/\/ Use willAnimateLayers to set visible false before the animation runs and\n  \/\/ causes a commit, so we block the second visible animate in single-thread\n  \/\/ mode.\n  virtual void willAnimateLayers(\n      LayerTreeHostImpl* host_impl,\n      base::TimeTicks monotonicTime) OVERRIDE {\n    if (num_animates_ < 2) {\n      if (!num_animates_) {\n        \/\/ We have a long animation running. It should continue to tick even\n        \/\/ if we are not visible.\n        postSetVisibleToMainThread(false);\n      }\n      num_animates_++;\n      return;\n    }\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\n private:\n  int num_animates_;\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestTickAnimationWhileBackgrounded)\n\n\/\/ Ensures that animations continue to be ticked when we are backgrounded.\nclass LayerTreeHostAnimationTestAddAnimationWithTimingFunction :\n    public LayerTreeHostAnimationTest {\npublic:\n  LayerTreeHostAnimationTestAddAnimationWithTimingFunction() {}\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(m_layerTreeHost->rootLayer());\n  }\n\n  virtual void animateLayers(\n      LayerTreeHostImpl* host_impl,\n      base::TimeTicks monotonicTime) OVERRIDE {\n    LayerAnimationController* controller =\n        m_layerTreeHost->rootLayer()->layerAnimationController();\n    Animation* animation =\n        controller->getAnimation(0, Animation::Opacity);\n    if (!animation)\n      return;\n\n    const FloatAnimationCurve* curve =\n        animation->curve()->toFloatAnimationCurve();\n    float startOpacity = curve->getValue(0);\n    float endOpacity = curve->getValue(curve->duration());\n    float linearly_interpolated_opacity =\n        0.25 * endOpacity + 0.75 * startOpacity;\n    double time = curve->duration() * 0.25;\n    \/\/ If the linear timing function associated with this animation was not\n    \/\/ picked up, then the linearly interpolated opacity would be different\n    \/\/ because of the default ease timing function.\n    EXPECT_FLOAT_EQ(linearly_interpolated_opacity, curve->getValue(time));\n\n    LayerAnimationController* controller_impl =\n        host_impl->rootLayer()->layerAnimationController();\n    Animation* animation_impl =\n        controller_impl->getAnimation(0, Animation::Opacity);\n\n    controller->removeAnimation(animation->id());\n    controller_impl->removeAnimation(animation_impl->id());\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestAddAnimationWithTimingFunction)\n\n\/\/ Ensures that main thread animations have their start times synchronized with\n\/\/ impl thread animations.\nclass LayerTreeHostAnimationTestSynchronizeAnimationStartTimes :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestSynchronizeAnimationStartTimes()\n      : main_start_time_(-1),\n        impl_start_time_(-1) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(m_layerTreeHost->rootLayer());\n  }\n\n  virtual void notifyAnimationStarted(double time) OVERRIDE {\n    LayerAnimationController* controller =\n        m_layerTreeHost->rootLayer()->layerAnimationController();\n    Animation* animation =\n        controller->getAnimation(0, Animation::Opacity);\n    main_start_time_ = animation->startTime();\n    controller->removeAnimation(animation->id());\n\n    if (impl_start_time_ > 0)\n      endTest();\n  }\n\n  virtual void updateAnimationState(\n      LayerTreeHostImpl* impl_host,\n      bool hasUnfinishedAnimation) OVERRIDE {\n    LayerAnimationController* controller =\n        impl_host->rootLayer()->layerAnimationController();\n    Animation* animation =\n        controller->getAnimation(0, Animation::Opacity);\n    if (!animation)\n      return;\n\n    impl_start_time_ = animation->startTime();\n    controller->removeAnimation(animation->id());\n\n    if (main_start_time_ > 0)\n      endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {\n    EXPECT_FLOAT_EQ(impl_start_time_, main_start_time_);\n  }\n\n private:\n  double main_start_time_;\n  double impl_start_time_;\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(LayerTreeHostAnimationTestSynchronizeAnimationStartTimes)\n\n\/\/ Ensures that notifyAnimationFinished is called.\nclass LayerTreeHostAnimationTestAnimationFinishedEvents :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestAnimationFinishedEvents() {}\n\n  virtual void beginTest() OVERRIDE {\n    postAddInstantAnimationToMainThread();\n  }\n\n  virtual void notifyAnimationFinished(double time) OVERRIDE {\n    LayerAnimationController* controller =\n        m_layerTreeHost->rootLayer()->layerAnimationController();\n    Animation* animation =\n        controller->getAnimation(0, Animation::Opacity);\n    controller->removeAnimation(animation->id());\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestAnimationFinishedEvents)\n\n\/\/ Ensures that when opacity is being animated, this value does not cause the\n\/\/ subtree to be skipped.\nclass LayerTreeHostAnimationTestDoNotSkipLayersWithAnimatedOpacity :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestDoNotSkipLayersWithAnimatedOpacity()\n      : update_check_layer_(FakeContentLayer::Create(&client_)) {\n  }\n\n  virtual void setupTree() OVERRIDE {\n    update_check_layer_->setOpacity(0);\n    m_layerTreeHost->setRootLayer(update_check_layer_);\n    LayerTreeHostAnimationTest::setupTree();\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(update_check_layer_.get());\n  }\n\n  virtual void commitCompleteOnThread(LayerTreeHostImpl*) OVERRIDE {\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {\n    \/\/ update() should have been called once, proving that the layer was not\n    \/\/ skipped.\n    EXPECT_EQ(1, update_check_layer_->update_count());\n\n    \/\/ clear update_check_layer_ so LayerTreeHost dies.\n    update_check_layer_ = NULL;\n  }\n\n private:\n  FakeContentLayerClient client_;\n  scoped_refptr<FakeContentLayer> update_check_layer_;\n};\n\nMULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestDoNotSkipLayersWithAnimatedOpacity)\n\n\/\/ Layers added to tree with existing active animations should have the\n\/\/ animation correctly recognized.\nclass LayerTreeHostAnimationTestLayerAddedWithAnimation :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestLayerAddedWithAnimation() { }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void didCommit() OVERRIDE {\n    if (m_layerTreeHost->commitNumber() == 1) {\n      scoped_refptr<Layer> layer = Layer::create();\n      layer->setLayerAnimationDelegate(this);\n\n      \/\/ Any valid AnimationCurve will do here.\n      scoped_ptr<AnimationCurve> curve(EaseTimingFunction::create());\n      scoped_ptr<Animation> animation(\n          Animation::create(curve.Pass(), 1, 1,\n                                  Animation::Opacity));\n      layer->layerAnimationController()->addAnimation(animation.Pass());\n\n      \/\/ We add the animation *before* attaching the layer to the tree.\n      m_layerTreeHost->rootLayer()->addChild(layer);\n    }\n  }\n\n  virtual void animateLayers(\n      LayerTreeHostImpl* impl_host,\n      base::TimeTicks monotonic_time) OVERRIDE {\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestLayerAddedWithAnimation)\n\nclass LayerTreeHostAnimationTestCompositeAndReadbackAnimateCount :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestCompositeAndReadbackAnimateCount()\n      : animated_commit_(-1) {\n  }\n\n  virtual void animate(base::TimeTicks) OVERRIDE {\n    \/\/ We shouldn't animate on the compositeAndReadback-forced commit, but we\n    \/\/ should for the setNeedsCommit-triggered commit.\n    animated_commit_ = m_layerTreeHost->commitNumber();\n    EXPECT_NE(2, animated_commit_);\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void didCommit() OVERRIDE {\n    switch (m_layerTreeHost->commitNumber()) {\n      case 1:\n        m_layerTreeHost->setNeedsCommit();\n        break;\n      case 2: {\n        char pixels[4];\n        m_layerTreeHost->compositeAndReadback(&pixels, gfx::Rect(0, 0, 1, 1));\n        break;\n      }\n      case 3:\n        \/\/ This is finishing the readback's commit.\n        break;\n      case 4:\n        \/\/ This is finishing the followup commit.\n        endTest();\n        break;\n      default:\n        NOTREACHED();\n    }\n  }\n\n  virtual void afterTest() OVERRIDE {\n    EXPECT_EQ(3, animated_commit_);\n  }\n\n private:\n  int animated_commit_;\n};\n\nMULTI_THREAD_TEST_F(LayerTreeHostAnimationTestCompositeAndReadbackAnimateCount)\n\nclass LayerTreeHostAnimationTestContinuousAnimate :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestContinuousAnimate()\n      : num_commit_complete_(0),\n        num_draw_layers_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void animate(base::TimeTicks) OVERRIDE {\n    if (num_draw_layers_ == 2)\n      return;\n    m_layerTreeHost->setNeedsAnimate();\n  }\n\n  virtual void layout() OVERRIDE {\n    m_layerTreeHost->rootLayer()->setNeedsDisplay();\n  }\n\n  virtual void commitCompleteOnThread(LayerTreeHostImpl*) OVERRIDE {\n    if (num_draw_layers_ == 1)\n      num_commit_complete_++;\n  }\n\n  virtual void drawLayersOnThread(LayerTreeHostImpl* impl) OVERRIDE {\n    num_draw_layers_++;\n    if (num_draw_layers_ == 2)\n      endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {\n    \/\/ Check that we didn't commit twice between first and second draw.\n    EXPECT_EQ(1, num_commit_complete_);\n  }\n\n private:\n  int num_commit_complete_;\n  int num_draw_layers_;\n};\n\nMULTI_THREAD_TEST_F(LayerTreeHostAnimationTestContinuousAnimate)\n\n}  \/\/ namespace\n}  \/\/ namespace cc\n<commit_msg>Add missing nullity check to LayerTreeHostAnimationTestAnimationFinishedEvents<commit_after>\/\/ Copyright 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 \"cc\/layer_tree_host.h\"\n\n#include \"cc\/animation_curve.h\"\n#include \"cc\/layer.h\"\n#include \"cc\/layer_animation_controller.h\"\n#include \"cc\/layer_impl.h\"\n#include \"cc\/test\/fake_content_layer.h\"\n#include \"cc\/test\/fake_content_layer_client.h\"\n#include \"cc\/test\/layer_tree_test_common.h\"\n#include \"cc\/timing_function.h\"\n\nnamespace cc {\nnamespace {\n\nclass LayerTreeHostAnimationTest : public ThreadedTest {\n public:\n  virtual void setupTree() OVERRIDE {\n    ThreadedTest::setupTree();\n    m_layerTreeHost->rootLayer()->setLayerAnimationDelegate(this);\n  }\n};\n\n\/\/ Makes sure that setNeedsAnimate does not cause the commitRequested() state to\n\/\/ be set.\nclass LayerTreeHostAnimationTestSetNeedsAnimateShouldNotSetCommitRequested :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestSetNeedsAnimateShouldNotSetCommitRequested()\n      : num_commits_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void animate(base::TimeTicks monotonicTime) OVERRIDE {\n    \/\/ We skip the first commit becasue its the commit that populates the\n    \/\/ impl thread with a tree. After the second commit, the test is done.\n    if (num_commits_ != 1)\n      return;\n\n    m_layerTreeHost->setNeedsAnimate();\n    \/\/ Right now, commitRequested is going to be true, because during\n    \/\/ beginFrame, we force commitRequested to true to prevent requests from\n    \/\/ hitting the impl thread. But, when the next didCommit happens, we should\n    \/\/ verify that commitRequested has gone back to false.\n  }\n\n  virtual void didCommit() OVERRIDE {\n    if (!num_commits_) {\n      EXPECT_FALSE(m_layerTreeHost->commitRequested());\n      m_layerTreeHost->setNeedsAnimate();\n      EXPECT_FALSE(m_layerTreeHost->commitRequested());\n    }\n\n    \/\/ Verifies that the setNeedsAnimate we made in ::animate did not\n    \/\/ trigger commitRequested.\n    EXPECT_FALSE(m_layerTreeHost->commitRequested());\n    endTest();\n    num_commits_++;\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\n private:\n  int num_commits_;\n};\n\nMULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestSetNeedsAnimateShouldNotSetCommitRequested)\n\n\/\/ Trigger a frame with setNeedsCommit. Then, inside the resulting animate\n\/\/ callback, requet another frame using setNeedsAnimate. End the test when\n\/\/ animate gets called yet-again, indicating that the proxy is correctly\n\/\/ handling the case where setNeedsAnimate() is called inside the begin frame\n\/\/ flow.\nclass LayerTreeHostAnimationTestSetNeedsAnimateInsideAnimationCallback :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestSetNeedsAnimateInsideAnimationCallback()\n      : num_animates_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void animate(base::TimeTicks) OVERRIDE {\n    if (!num_animates_) {\n      m_layerTreeHost->setNeedsAnimate();\n      num_animates_++;\n      return;\n    }\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\n private:\n  int num_animates_;\n};\n\nMULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestSetNeedsAnimateInsideAnimationCallback)\n\n\/\/ Add a layer animation and confirm that\n\/\/ LayerTreeHostImpl::updateAnimationState does get called and continues to\n\/\/ get called.\nclass LayerTreeHostAnimationTestAddAnimation :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestAddAnimation()\n      : num_animates_(0)\n      , received_animation_started_notification_(false)\n      , start_time_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddInstantAnimationToMainThread();\n  }\n\n  virtual void updateAnimationState(\n      LayerTreeHostImpl* impl_host,\n      bool hasUnfinishedAnimation) OVERRIDE {\n    if (!num_animates_) {\n      \/\/ The animation had zero duration so layerTreeHostImpl should no\n      \/\/ longer need to animate its layers.\n      EXPECT_FALSE(hasUnfinishedAnimation);\n      num_animates_++;\n      return;\n    }\n\n    if (received_animation_started_notification_) {\n      EXPECT_LT(0, start_time_);\n      endTest();\n    }\n  }\n\n  virtual void notifyAnimationStarted(double wall_clock_time) OVERRIDE {\n    received_animation_started_notification_ = true;\n    start_time_ = wall_clock_time;\n    if (num_animates_) {\n      EXPECT_LT(0, start_time_);\n      endTest();\n    }\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\nprivate:\n  int num_animates_;\n  bool received_animation_started_notification_;\n  double start_time_;\n};\n\nMULTI_THREAD_TEST_F(LayerTreeHostAnimationTestAddAnimation)\n\n\/\/ Add a layer animation to a layer, but continually fail to draw. Confirm that\n\/\/ after a while, we do eventually force a draw.\nclass LayerTreeHostAnimationTestCheckerboardDoesNotStarveDraws :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestCheckerboardDoesNotStarveDraws()\n      : started_animating_(false) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(m_layerTreeHost->rootLayer());\n  }\n\n  virtual void animateLayers(\n      LayerTreeHostImpl* host_impl,\n      base::TimeTicks monotonicTime) OVERRIDE {\n    started_animating_ = true;\n  }\n\n  virtual void drawLayersOnThread(LayerTreeHostImpl*) OVERRIDE {\n    if (started_animating_)\n      endTest();\n  }\n\n  virtual bool prepareToDrawOnThread(\n      LayerTreeHostImpl* host_impl,\n      LayerTreeHostImpl::FrameData& frame,\n      bool result) OVERRIDE {\n    return false;\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\n private:\n  bool started_animating_;\n};\n\n\/\/ Starvation can only be an issue with the MT compositor.\nMULTI_THREAD_TEST_F(LayerTreeHostAnimationTestCheckerboardDoesNotStarveDraws)\n\n\/\/ Ensures that animations continue to be ticked when we are backgrounded.\nclass LayerTreeHostAnimationTestTickAnimationWhileBackgrounded :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestTickAnimationWhileBackgrounded()\n      : num_animates_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(m_layerTreeHost->rootLayer());\n  }\n\n  \/\/ Use willAnimateLayers to set visible false before the animation runs and\n  \/\/ causes a commit, so we block the second visible animate in single-thread\n  \/\/ mode.\n  virtual void willAnimateLayers(\n      LayerTreeHostImpl* host_impl,\n      base::TimeTicks monotonicTime) OVERRIDE {\n    if (num_animates_ < 2) {\n      if (!num_animates_) {\n        \/\/ We have a long animation running. It should continue to tick even\n        \/\/ if we are not visible.\n        postSetVisibleToMainThread(false);\n      }\n      num_animates_++;\n      return;\n    }\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n\n private:\n  int num_animates_;\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestTickAnimationWhileBackgrounded)\n\n\/\/ Ensures that animations continue to be ticked when we are backgrounded.\nclass LayerTreeHostAnimationTestAddAnimationWithTimingFunction :\n    public LayerTreeHostAnimationTest {\npublic:\n  LayerTreeHostAnimationTestAddAnimationWithTimingFunction() {}\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(m_layerTreeHost->rootLayer());\n  }\n\n  virtual void animateLayers(\n      LayerTreeHostImpl* host_impl,\n      base::TimeTicks monotonicTime) OVERRIDE {\n    LayerAnimationController* controller =\n        m_layerTreeHost->rootLayer()->layerAnimationController();\n    Animation* animation =\n        controller->getAnimation(0, Animation::Opacity);\n    if (!animation)\n      return;\n\n    const FloatAnimationCurve* curve =\n        animation->curve()->toFloatAnimationCurve();\n    float startOpacity = curve->getValue(0);\n    float endOpacity = curve->getValue(curve->duration());\n    float linearly_interpolated_opacity =\n        0.25 * endOpacity + 0.75 * startOpacity;\n    double time = curve->duration() * 0.25;\n    \/\/ If the linear timing function associated with this animation was not\n    \/\/ picked up, then the linearly interpolated opacity would be different\n    \/\/ because of the default ease timing function.\n    EXPECT_FLOAT_EQ(linearly_interpolated_opacity, curve->getValue(time));\n\n    LayerAnimationController* controller_impl =\n        host_impl->rootLayer()->layerAnimationController();\n    Animation* animation_impl =\n        controller_impl->getAnimation(0, Animation::Opacity);\n\n    controller->removeAnimation(animation->id());\n    controller_impl->removeAnimation(animation_impl->id());\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestAddAnimationWithTimingFunction)\n\n\/\/ Ensures that main thread animations have their start times synchronized with\n\/\/ impl thread animations.\nclass LayerTreeHostAnimationTestSynchronizeAnimationStartTimes :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestSynchronizeAnimationStartTimes()\n      : main_start_time_(-1),\n        impl_start_time_(-1) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(m_layerTreeHost->rootLayer());\n  }\n\n  virtual void notifyAnimationStarted(double time) OVERRIDE {\n    LayerAnimationController* controller =\n        m_layerTreeHost->rootLayer()->layerAnimationController();\n    Animation* animation =\n        controller->getAnimation(0, Animation::Opacity);\n    main_start_time_ = animation->startTime();\n    controller->removeAnimation(animation->id());\n\n    if (impl_start_time_ > 0)\n      endTest();\n  }\n\n  virtual void updateAnimationState(\n      LayerTreeHostImpl* impl_host,\n      bool hasUnfinishedAnimation) OVERRIDE {\n    LayerAnimationController* controller =\n        impl_host->rootLayer()->layerAnimationController();\n    Animation* animation =\n        controller->getAnimation(0, Animation::Opacity);\n    if (!animation)\n      return;\n\n    impl_start_time_ = animation->startTime();\n    controller->removeAnimation(animation->id());\n\n    if (main_start_time_ > 0)\n      endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {\n    EXPECT_FLOAT_EQ(impl_start_time_, main_start_time_);\n  }\n\n private:\n  double main_start_time_;\n  double impl_start_time_;\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(LayerTreeHostAnimationTestSynchronizeAnimationStartTimes)\n\n\/\/ Ensures that notifyAnimationFinished is called.\nclass LayerTreeHostAnimationTestAnimationFinishedEvents :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestAnimationFinishedEvents() {}\n\n  virtual void beginTest() OVERRIDE {\n    postAddInstantAnimationToMainThread();\n  }\n\n  virtual void notifyAnimationFinished(double time) OVERRIDE {\n    LayerAnimationController* controller =\n        m_layerTreeHost->rootLayer()->layerAnimationController();\n    Animation* animation =\n        controller->getAnimation(0, Animation::Opacity);\n    if (animation)\n      controller->removeAnimation(animation->id());\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestAnimationFinishedEvents)\n\n\/\/ Ensures that when opacity is being animated, this value does not cause the\n\/\/ subtree to be skipped.\nclass LayerTreeHostAnimationTestDoNotSkipLayersWithAnimatedOpacity :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestDoNotSkipLayersWithAnimatedOpacity()\n      : update_check_layer_(FakeContentLayer::Create(&client_)) {\n  }\n\n  virtual void setupTree() OVERRIDE {\n    update_check_layer_->setOpacity(0);\n    m_layerTreeHost->setRootLayer(update_check_layer_);\n    LayerTreeHostAnimationTest::setupTree();\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postAddAnimationToMainThread(update_check_layer_.get());\n  }\n\n  virtual void commitCompleteOnThread(LayerTreeHostImpl*) OVERRIDE {\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {\n    \/\/ update() should have been called once, proving that the layer was not\n    \/\/ skipped.\n    EXPECT_EQ(1, update_check_layer_->update_count());\n\n    \/\/ clear update_check_layer_ so LayerTreeHost dies.\n    update_check_layer_ = NULL;\n  }\n\n private:\n  FakeContentLayerClient client_;\n  scoped_refptr<FakeContentLayer> update_check_layer_;\n};\n\nMULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestDoNotSkipLayersWithAnimatedOpacity)\n\n\/\/ Layers added to tree with existing active animations should have the\n\/\/ animation correctly recognized.\nclass LayerTreeHostAnimationTestLayerAddedWithAnimation :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestLayerAddedWithAnimation() { }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void didCommit() OVERRIDE {\n    if (m_layerTreeHost->commitNumber() == 1) {\n      scoped_refptr<Layer> layer = Layer::create();\n      layer->setLayerAnimationDelegate(this);\n\n      \/\/ Any valid AnimationCurve will do here.\n      scoped_ptr<AnimationCurve> curve(EaseTimingFunction::create());\n      scoped_ptr<Animation> animation(\n          Animation::create(curve.Pass(), 1, 1,\n                                  Animation::Opacity));\n      layer->layerAnimationController()->addAnimation(animation.Pass());\n\n      \/\/ We add the animation *before* attaching the layer to the tree.\n      m_layerTreeHost->rootLayer()->addChild(layer);\n    }\n  }\n\n  virtual void animateLayers(\n      LayerTreeHostImpl* impl_host,\n      base::TimeTicks monotonic_time) OVERRIDE {\n    endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {}\n};\n\nSINGLE_AND_MULTI_THREAD_TEST_F(\n    LayerTreeHostAnimationTestLayerAddedWithAnimation)\n\nclass LayerTreeHostAnimationTestCompositeAndReadbackAnimateCount :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestCompositeAndReadbackAnimateCount()\n      : animated_commit_(-1) {\n  }\n\n  virtual void animate(base::TimeTicks) OVERRIDE {\n    \/\/ We shouldn't animate on the compositeAndReadback-forced commit, but we\n    \/\/ should for the setNeedsCommit-triggered commit.\n    animated_commit_ = m_layerTreeHost->commitNumber();\n    EXPECT_NE(2, animated_commit_);\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void didCommit() OVERRIDE {\n    switch (m_layerTreeHost->commitNumber()) {\n      case 1:\n        m_layerTreeHost->setNeedsCommit();\n        break;\n      case 2: {\n        char pixels[4];\n        m_layerTreeHost->compositeAndReadback(&pixels, gfx::Rect(0, 0, 1, 1));\n        break;\n      }\n      case 3:\n        \/\/ This is finishing the readback's commit.\n        break;\n      case 4:\n        \/\/ This is finishing the followup commit.\n        endTest();\n        break;\n      default:\n        NOTREACHED();\n    }\n  }\n\n  virtual void afterTest() OVERRIDE {\n    EXPECT_EQ(3, animated_commit_);\n  }\n\n private:\n  int animated_commit_;\n};\n\nMULTI_THREAD_TEST_F(LayerTreeHostAnimationTestCompositeAndReadbackAnimateCount)\n\nclass LayerTreeHostAnimationTestContinuousAnimate :\n    public LayerTreeHostAnimationTest {\n public:\n  LayerTreeHostAnimationTestContinuousAnimate()\n      : num_commit_complete_(0),\n        num_draw_layers_(0) {\n  }\n\n  virtual void beginTest() OVERRIDE {\n    postSetNeedsCommitToMainThread();\n  }\n\n  virtual void animate(base::TimeTicks) OVERRIDE {\n    if (num_draw_layers_ == 2)\n      return;\n    m_layerTreeHost->setNeedsAnimate();\n  }\n\n  virtual void layout() OVERRIDE {\n    m_layerTreeHost->rootLayer()->setNeedsDisplay();\n  }\n\n  virtual void commitCompleteOnThread(LayerTreeHostImpl*) OVERRIDE {\n    if (num_draw_layers_ == 1)\n      num_commit_complete_++;\n  }\n\n  virtual void drawLayersOnThread(LayerTreeHostImpl* impl) OVERRIDE {\n    num_draw_layers_++;\n    if (num_draw_layers_ == 2)\n      endTest();\n  }\n\n  virtual void afterTest() OVERRIDE {\n    \/\/ Check that we didn't commit twice between first and second draw.\n    EXPECT_EQ(1, num_commit_complete_);\n  }\n\n private:\n  int num_commit_complete_;\n  int num_draw_layers_;\n};\n\nMULTI_THREAD_TEST_F(LayerTreeHostAnimationTestContinuousAnimate)\n\n}  \/\/ namespace\n}  \/\/ namespace cc\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  kern_start.cpp\n\/\/  Shiki\n\/\/\n\/\/  Copyright © 2016-2017 vit9696. All rights reserved.\n\/\/\n\n#include <Headers\/plugin_start.hpp>\n#include <Headers\/kern_api.hpp>\n#include <Headers\/kern_file.hpp>\n\n#include \"kern_resources.hpp\"\n\nenum ShikiGVAPatches {\n\tForceOnlineRenderer = 1,\n\tAllowNonBGRA = 2,\n\tForceCompatibleRenderer = 4,\n\tVDAExecutableWhitelist = 8,\n    KillAppleGVA = 16\n};\n\n\/\/ 32 bytes should be reasonable for a safe comparison\nstatic constexpr size_t NVPatchSize {32};\nstatic uint8_t nvPatchFind[NVPatchSize] {};\nstatic uint8_t nvPatchReplace[NVPatchSize] {};\nstatic UserPatcher::BinaryModPatch *nvPatch {nullptr};\n\nstatic void disableSection(uint32_t section) {\n\tfor (size_t i = 0; i < ADDPR(procInfoSize); i++) {\n\t\tif (ADDPR(procInfo)[i].section == section) {\n\t\t\tADDPR(procInfo)[i].section = SectionUnused;\n\t\t}\n\t}\n\t\n\tfor (size_t i = 0; i < ADDPR(binaryModSize); i++) {\n\t\tauto patches = ADDPR(binaryMod)[i].patches;\n\t\tfor (size_t j = 0; j < ADDPR(binaryMod)[i].count; j++) {\n\t\t\tif (patches[j].section == section) {\n\t\t\t\tpatches[j].section = SectionUnused;\n\t\t\t}\n\t\t}\n\t}\n}\n\nstatic void shikiNvidiaPatch(void *, KernelPatcher &) {\n\t\/\/ We need to do magic here and prepare a patch for AppleGVA that would force\n\t\/\/ the assumption that NVIDIA is compatible with SKL\/KBL processors.\n\n\tif (nvPatch) {\n\t\tsize_t gvaSize {0};\n\t\tauto gvaBuf = FileIO::readFileToBuffer(\"\/System\/Library\/PrivateFrameworks\/AppleGVA.framework\/Versions\/A\/AppleGVA\", gvaSize);\n\t\tif (gvaBuf && gvaSize > PAGE_SIZE) {\n\t\t\t\/\/ We perform a two step search, firstly we find the relevant starting point, then we find the patch place\n\t\t\tsize_t currOff {0}, endOff {0};\n\n\t\t\t\/\/ The real patch place should be very close\n\t\t\tstatic constexpr size_t MaxPatchOff {128};\n\n\t\t\t\/\/ 10.12 and newer support many Intel GPUs, which makes the check place very traceable\n\t\t\tif (getKernelVersion() > KernelVersion::ElCapitan) {\n\t\t\t\t\/\/ We need to find the initial check, which we expect to be or with stack var, because of the following:\n\t\t\t\t\/\/ - there are several GPUs that we need to test against (2xSKL, 2xKBL, thus not enough registers)\n\t\t\t\t\/\/ - the check is built as one of Intel and AMD (thus a number of ors in a row)\n\t\t\t\tstatic constexpr uint8_t OrOpcode[] {0xFF, 0xFF, 0x48, 0x0B \/* XX, XX, XX, XX, XX *\/};\n\n\t\t\t\tendOff = gvaSize - sizeof(OrOpcode) + 5;\n\t\t\t\twhile (currOff != endOff && memcmp(&gvaBuf[currOff], OrOpcode, sizeof(OrOpcode)))\n\t\t\t\t\tcurrOff++;\n\n\t\t\t\tif (currOff != endOff && endOff - currOff > MaxPatchOff)\n\t\t\t\t\tDBGLOG(\"shiki\", \"found pre or instructions at %lu (%02X %02X %02X %02X %02X %02X %02X)\", currOff, gvaBuf[currOff+2],\n\t\t\t\t\t       gvaBuf[currOff+3], gvaBuf[currOff+4], gvaBuf[currOff+5], gvaBuf[currOff+6], gvaBuf[currOff+7], gvaBuf[currOff+8]);\n\n\t\t\t\telse\n\t\t\t\t\tcurrOff = endOff = 0;\n\t\t\t} else {\n\t\t\t\t\/\/ 10.11 is much more problematic, but the good thing is it no longer updates, we use an idea of\n\t\t\t\t\/\/ - few Intel GPUs\n\t\t\t\t\/\/ - test and jmp taking 3 and 2 bytes correspondingly\n\t\t\t\tstatic constexpr uint8_t TestOpcode[] {0x74, 0x05, 0x4D, 0x85 \/* XX *\/};\n\n\t\t\t\tendOff = gvaSize - sizeof(TestOpcode) + 1;\n\t\t\t\twhile (currOff != endOff && memcmp(&gvaBuf[currOff], TestOpcode, sizeof(TestOpcode)))\n\t\t\t\t\tcurrOff++;\n\n\t\t\t\tif (currOff != endOff && endOff - currOff > MaxPatchOff)\n\t\t\t\t\tDBGLOG(\"shiki\", \"found pre test instructions at %lu (%02X %02X %02X %02X %02X)\", currOff, gvaBuf[currOff],\n\t\t\t\t\t\t   gvaBuf[currOff+1], gvaBuf[currOff+2], gvaBuf[currOff+3], gvaBuf[currOff+4]);\n\n\t\t\t\telse\n\t\t\t\t\tcurrOff = endOff = 0;\n\t\t\t}\n\n\t\t\tif (currOff && endOff) {\n\t\t\t\t\/\/ Now we need to get to 2 jmps, which we expect to be 0F 84 xx xx xx xx, because of the following:\n\t\t\t\t\/\/ - acceleration availability takes the main branch, and its code is large (thus 4 byte relative jmp)\n\t\t\t\t\/\/ - we have non-zero comparators (thus je will be used)\n\t\t\t\tstatic constexpr size_t JmpOpcodeSize {6};\n\t\t\t\tstatic constexpr size_t JmpOpcodeNum {2};\n\t\t\t\tstatic constexpr uint8_t JmpOpcode[] {0x0F, 0x84 \/* XX, XX, XX, XX *\/};\n\n\t\t\t\tsize_t jmpOffsets[JmpOpcodeNum] {};\n\t\t\t\tbool jmpOffsetsOk {true};\n\n\t\t\t\tendOff = currOff + MaxPatchOff - NVPatchSize;\n\n\t\t\t\tfor (size_t i = 0; i < arrsize(jmpOffsets); i++) {\n\t\t\t\t\twhile (currOff != endOff && memcmp(&gvaBuf[currOff], JmpOpcode, sizeof(JmpOpcode)))\n\t\t\t\t\t\tcurrOff++;\n\n\t\t\t\t\tif (currOff != endOff) {\n\t\t\t\t\t\tDBGLOG(\"shiki\", \"found %lu jmp instruction at %lu (%02X %02X %02X %02X %02X %02X)\", i, currOff, gvaBuf[currOff],\n\t\t\t\t\t\t\t   gvaBuf[currOff+1], gvaBuf[currOff+2], gvaBuf[currOff+3], gvaBuf[currOff+4], gvaBuf[currOff+5]);\n\n\t\t\t\t\t\tif (i == 0 || (jmpOffsets[0] + (NVPatchSize - JmpOpcodeSize) >= jmpOffsets[i])) {\n\t\t\t\t\t\t\tDBGLOG(\"shiki\", \"offset %lu is within the bounds\", i);\n\t\t\t\t\t\t\tjmpOffsets[i] = currOff;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tjmpOffsetsOk = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcurrOff++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tjmpOffsetsOk = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (jmpOffsetsOk && currOff != endOff) {\n\t\t\t\t\tDBGLOG(\"shiki\", \"preparing find & replace nvidia buffers\");\n\t\t\t\t\tlilu_os_memcpy(nvPatchFind, &gvaBuf[jmpOffsets[0]], NVPatchSize);\n\t\t\t\t\tlilu_os_memcpy(nvPatchReplace, &gvaBuf[jmpOffsets[0]], NVPatchSize);\n\n\t\t\t\t\tstatic constexpr uint8_t NopOpcode {0x90};\n\t\t\t\t\tfor (size_t i = 0; i < arrsize(jmpOffsets); i++)\n\t\t\t\t\t\tmemset(&nvPatchReplace[jmpOffsets[i] - jmpOffsets[0]], NopOpcode, JmpOpcodeSize);\n\n\t\t\t\t\tDBGLOG(\"shiki\", \"find %02X %02X %02X %02X %02X %02X %02X %02X %02X %02X\", nvPatchFind[0], nvPatchFind[1], nvPatchFind[2],\n\t\t\t\t\t\t   nvPatchFind[3], nvPatchFind[4], nvPatchFind[5], nvPatchFind[6], nvPatchFind[7], nvPatchFind[8], nvPatchFind[9]);\n\n\t\t\t\t\tDBGLOG(\"shiki\", \"repl %02X %02X %02X %02X %02X %02X %02X %02X %02X %02X\", nvPatchReplace[0], nvPatchReplace[1], nvPatchReplace[2],\n\t\t\t\t\t\t   nvPatchReplace[3], nvPatchReplace[4], nvPatchReplace[5], nvPatchReplace[6], nvPatchReplace[7], nvPatchReplace[8], nvPatchReplace[9]);\n\n\t\t\t\t\t\/\/ Ok, everything looks sane enough\n\t\t\t\t\tnvPatch->section = SectionNVDA;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tSYSLOG(\"shiki\", \"unable to find or instructions\");\n\t\t\t}\n\t\t} else {\n\t\t\tSYSLOG(\"shiki\", \"failed to read AppleGVA framework %lu\", gvaSize);\n\t\t}\n\n\t\tif (gvaBuf) Buffer::deleter(gvaBuf);\n\t} else {\n\t\tSYSLOG(\"shiki\", \"failed to find suitable nvpatch\");\n\t}\n}\n\nstatic void shikiStart() {\n\t\/\/ Attempt to support fps.1_0 in Safari\n\tchar tmp[16];\n\tbool patchStreamVideo = PE_parse_boot_argn(\"-shikifps\", tmp, sizeof(tmp));\n\tbool leaveForceAccelRenderer = true;\n\tbool leaveBGRASupport = true;\n\tbool leaveNvidiaUnlock = true;\n\tbool leaveExecutableWhiteList = true;\n    bool leaveAppleGVAAlone = true;\n\t\n\tif (PE_parse_boot_argn(\"shikigva\", tmp, sizeof(tmp))) {\n\t\tleaveForceAccelRenderer = !(tmp[0] & ForceOnlineRenderer);\n\t\tleaveBGRASupport = !(tmp[0] & AllowNonBGRA);\n\t\tleaveNvidiaUnlock = !(tmp[0] & ForceCompatibleRenderer);\n\t\tleaveExecutableWhiteList = !(tmp[0] & VDAExecutableWhitelist);\n        leaveAppleGVAAlone = !(tmp[0] & KillAppleGVA);\n\t}\n\t\n\tif (PE_parse_boot_argn(\"-shikigva\", tmp, sizeof(tmp))) {\n\t\tSYSLOG(\"shiki\", \"-shikigva is deprecated use shikigva=1 instead\");\n\t\tleaveForceAccelRenderer = false;\n\t}\n\n\tDBGLOG(\"shiki\", \"stream %d accel %d bgra %d nvidia %d\/%d gva %d\", patchStreamVideo, !leaveForceAccelRenderer,\n\t\t   !leaveBGRASupport, !leaveNvidiaUnlock, !leaveExecutableWhiteList, !leaveAppleGVAAlone);\n\n\t\/\/ Disable unused SectionFSTREAM\n\tif (!patchStreamVideo)\n\t\tdisableSection(SectionNSTREAM);\n\t\n\tif (leaveForceAccelRenderer)\n\t\tdisableSection(SectionOFFLINE);\n\t\n\tif (leaveBGRASupport)\n\t\tdisableSection(SectionBGRA);\n    \n    if (leaveAppleGVAAlone)\n        disableSection(SectionKILLGVA);\n\n\tfor (size_t i = 0; i < ADDPR(binaryModSize); i++) {\n\t\tauto patches = ADDPR(binaryMod)[i].patches;\n\t\tfor (size_t j = 0; j < ADDPR(binaryMod)[i].count; j++) {\n\t\t\tif (patches[j].section == SectionNVDA) {\n\t\t\t\tnvPatch = &patches[j];\n\t\t\t\tDBGLOG(\"shiki\", \"found nvidia patch at %lu:%lu with size %lu\", i, j, nvPatch->size);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool nvPatchOk = false;\n\tif (nvPatch && !leaveNvidiaUnlock && getKernelVersion() >= KernelVersion::ElCapitan) {\n\t\t\/\/ Do not enable until we are certain it works\n\t\tnvPatch->section = SectionUnused;\n\t\tnvPatch->find    = nvPatchFind;\n\t\tnvPatch->replace = nvPatchReplace;\n\t\tnvPatch->size    = NVPatchSize;\n\t\tauto err = lilu.onPatcherLoad(shikiNvidiaPatch);\n\t\tif (err == LiluAPI::Error::NoError)\n\t\t\tnvPatchOk = true;\n\t\telse\n\t\t\tSYSLOG(\"shiki\", \"unable to attach to patcher load %d\", err);\n\t}\n\n\tif (leaveExecutableWhiteList || !nvPatchOk)\n\t\tdisableSection(SectionNVDA);\n\n\tauto err = lilu.onProcLoad(ADDPR(procInfo), ADDPR(procInfoSize), nullptr, nullptr, ADDPR(binaryMod), ADDPR(binaryModSize));\n\tif (err != LiluAPI::Error::NoError)\n\t\tSYSLOG(\"shiki\", \"unable to attach to process load %d\", err);\n}\n\nstatic const char *bootargOff[] {\n\t\"-shikioff\"\n};\n\nstatic const char *bootargDebug[] {\n\t\"-shikidbg\"\n};\n\nstatic const char *bootargBeta[] {\n\t\"-shikibeta\"\n};\n\nPluginConfiguration ADDPR(config) {\n\txStringify(PRODUCT_NAME),\n\tparseModuleVersion(xStringify(MODULE_VERSION)),\n\tLiluAPI::AllowNormal,\n\tbootargOff,\n\tarrsize(bootargOff),\n\tbootargDebug,\n\tarrsize(bootargDebug),\n\tbootargBeta,\n\tarrsize(bootargBeta),\n\tKernelVersion::Mavericks,\n\tKernelVersion::HighSierra,\n\tshikiStart\n};\n<commit_msg>Fixed indentation<commit_after>\/\/\n\/\/  kern_start.cpp\n\/\/  Shiki\n\/\/\n\/\/  Copyright © 2016-2017 vit9696. All rights reserved.\n\/\/\n\n#include <Headers\/plugin_start.hpp>\n#include <Headers\/kern_api.hpp>\n#include <Headers\/kern_file.hpp>\n\n#include \"kern_resources.hpp\"\n\nenum ShikiGVAPatches {\n\tForceOnlineRenderer = 1,\n\tAllowNonBGRA = 2,\n\tForceCompatibleRenderer = 4,\n\tVDAExecutableWhitelist = 8,\n\tKillAppleGVA = 16\n};\n\n\/\/ 32 bytes should be reasonable for a safe comparison\nstatic constexpr size_t NVPatchSize {32};\nstatic uint8_t nvPatchFind[NVPatchSize] {};\nstatic uint8_t nvPatchReplace[NVPatchSize] {};\nstatic UserPatcher::BinaryModPatch *nvPatch {nullptr};\n\nstatic void disableSection(uint32_t section) {\n\tfor (size_t i = 0; i < ADDPR(procInfoSize); i++) {\n\t\tif (ADDPR(procInfo)[i].section == section) {\n\t\t\tADDPR(procInfo)[i].section = SectionUnused;\n\t\t}\n\t}\n\t\n\tfor (size_t i = 0; i < ADDPR(binaryModSize); i++) {\n\t\tauto patches = ADDPR(binaryMod)[i].patches;\n\t\tfor (size_t j = 0; j < ADDPR(binaryMod)[i].count; j++) {\n\t\t\tif (patches[j].section == section) {\n\t\t\t\tpatches[j].section = SectionUnused;\n\t\t\t}\n\t\t}\n\t}\n}\n\nstatic void shikiNvidiaPatch(void *, KernelPatcher &) {\n\t\/\/ We need to do magic here and prepare a patch for AppleGVA that would force\n\t\/\/ the assumption that NVIDIA is compatible with SKL\/KBL processors.\n\n\tif (nvPatch) {\n\t\tsize_t gvaSize {0};\n\t\tauto gvaBuf = FileIO::readFileToBuffer(\"\/System\/Library\/PrivateFrameworks\/AppleGVA.framework\/Versions\/A\/AppleGVA\", gvaSize);\n\t\tif (gvaBuf && gvaSize > PAGE_SIZE) {\n\t\t\t\/\/ We perform a two step search, firstly we find the relevant starting point, then we find the patch place\n\t\t\tsize_t currOff {0}, endOff {0};\n\n\t\t\t\/\/ The real patch place should be very close\n\t\t\tstatic constexpr size_t MaxPatchOff {128};\n\n\t\t\t\/\/ 10.12 and newer support many Intel GPUs, which makes the check place very traceable\n\t\t\tif (getKernelVersion() > KernelVersion::ElCapitan) {\n\t\t\t\t\/\/ We need to find the initial check, which we expect to be or with stack var, because of the following:\n\t\t\t\t\/\/ - there are several GPUs that we need to test against (2xSKL, 2xKBL, thus not enough registers)\n\t\t\t\t\/\/ - the check is built as one of Intel and AMD (thus a number of ors in a row)\n\t\t\t\tstatic constexpr uint8_t OrOpcode[] {0xFF, 0xFF, 0x48, 0x0B \/* XX, XX, XX, XX, XX *\/};\n\n\t\t\t\tendOff = gvaSize - sizeof(OrOpcode) + 5;\n\t\t\t\twhile (currOff != endOff && memcmp(&gvaBuf[currOff], OrOpcode, sizeof(OrOpcode)))\n\t\t\t\t\tcurrOff++;\n\n\t\t\t\tif (currOff != endOff && endOff - currOff > MaxPatchOff)\n\t\t\t\t\tDBGLOG(\"shiki\", \"found pre or instructions at %lu (%02X %02X %02X %02X %02X %02X %02X)\", currOff, gvaBuf[currOff+2],\n\t\t\t\t\t\t   gvaBuf[currOff+3], gvaBuf[currOff+4], gvaBuf[currOff+5], gvaBuf[currOff+6], gvaBuf[currOff+7], gvaBuf[currOff+8]);\n\n\t\t\t\telse\n\t\t\t\t\tcurrOff = endOff = 0;\n\t\t\t} else {\n\t\t\t\t\/\/ 10.11 is much more problematic, but the good thing is it no longer updates, we use an idea of\n\t\t\t\t\/\/ - few Intel GPUs\n\t\t\t\t\/\/ - test and jmp taking 3 and 2 bytes correspondingly\n\t\t\t\tstatic constexpr uint8_t TestOpcode[] {0x74, 0x05, 0x4D, 0x85 \/* XX *\/};\n\n\t\t\t\tendOff = gvaSize - sizeof(TestOpcode) + 1;\n\t\t\t\twhile (currOff != endOff && memcmp(&gvaBuf[currOff], TestOpcode, sizeof(TestOpcode)))\n\t\t\t\t\tcurrOff++;\n\n\t\t\t\tif (currOff != endOff && endOff - currOff > MaxPatchOff)\n\t\t\t\t\tDBGLOG(\"shiki\", \"found pre test instructions at %lu (%02X %02X %02X %02X %02X)\", currOff, gvaBuf[currOff],\n\t\t\t\t\t\t   gvaBuf[currOff+1], gvaBuf[currOff+2], gvaBuf[currOff+3], gvaBuf[currOff+4]);\n\n\t\t\t\telse\n\t\t\t\t\tcurrOff = endOff = 0;\n\t\t\t}\n\n\t\t\tif (currOff && endOff) {\n\t\t\t\t\/\/ Now we need to get to 2 jmps, which we expect to be 0F 84 xx xx xx xx, because of the following:\n\t\t\t\t\/\/ - acceleration availability takes the main branch, and its code is large (thus 4 byte relative jmp)\n\t\t\t\t\/\/ - we have non-zero comparators (thus je will be used)\n\t\t\t\tstatic constexpr size_t JmpOpcodeSize {6};\n\t\t\t\tstatic constexpr size_t JmpOpcodeNum {2};\n\t\t\t\tstatic constexpr uint8_t JmpOpcode[] {0x0F, 0x84 \/* XX, XX, XX, XX *\/};\n\n\t\t\t\tsize_t jmpOffsets[JmpOpcodeNum] {};\n\t\t\t\tbool jmpOffsetsOk {true};\n\n\t\t\t\tendOff = currOff + MaxPatchOff - NVPatchSize;\n\n\t\t\t\tfor (size_t i = 0; i < arrsize(jmpOffsets); i++) {\n\t\t\t\t\twhile (currOff != endOff && memcmp(&gvaBuf[currOff], JmpOpcode, sizeof(JmpOpcode)))\n\t\t\t\t\t\tcurrOff++;\n\n\t\t\t\t\tif (currOff != endOff) {\n\t\t\t\t\t\tDBGLOG(\"shiki\", \"found %lu jmp instruction at %lu (%02X %02X %02X %02X %02X %02X)\", i, currOff, gvaBuf[currOff],\n\t\t\t\t\t\t\t   gvaBuf[currOff+1], gvaBuf[currOff+2], gvaBuf[currOff+3], gvaBuf[currOff+4], gvaBuf[currOff+5]);\n\n\t\t\t\t\t\tif (i == 0 || (jmpOffsets[0] + (NVPatchSize - JmpOpcodeSize) >= jmpOffsets[i])) {\n\t\t\t\t\t\t\tDBGLOG(\"shiki\", \"offset %lu is within the bounds\", i);\n\t\t\t\t\t\t\tjmpOffsets[i] = currOff;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tjmpOffsetsOk = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcurrOff++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tjmpOffsetsOk = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (jmpOffsetsOk && currOff != endOff) {\n\t\t\t\t\tDBGLOG(\"shiki\", \"preparing find & replace nvidia buffers\");\n\t\t\t\t\tlilu_os_memcpy(nvPatchFind, &gvaBuf[jmpOffsets[0]], NVPatchSize);\n\t\t\t\t\tlilu_os_memcpy(nvPatchReplace, &gvaBuf[jmpOffsets[0]], NVPatchSize);\n\n\t\t\t\t\tstatic constexpr uint8_t NopOpcode {0x90};\n\t\t\t\t\tfor (size_t i = 0; i < arrsize(jmpOffsets); i++)\n\t\t\t\t\t\tmemset(&nvPatchReplace[jmpOffsets[i] - jmpOffsets[0]], NopOpcode, JmpOpcodeSize);\n\n\t\t\t\t\tDBGLOG(\"shiki\", \"find %02X %02X %02X %02X %02X %02X %02X %02X %02X %02X\", nvPatchFind[0], nvPatchFind[1], nvPatchFind[2],\n\t\t\t\t\t\t   nvPatchFind[3], nvPatchFind[4], nvPatchFind[5], nvPatchFind[6], nvPatchFind[7], nvPatchFind[8], nvPatchFind[9]);\n\n\t\t\t\t\tDBGLOG(\"shiki\", \"repl %02X %02X %02X %02X %02X %02X %02X %02X %02X %02X\", nvPatchReplace[0], nvPatchReplace[1], nvPatchReplace[2],\n\t\t\t\t\t\t   nvPatchReplace[3], nvPatchReplace[4], nvPatchReplace[5], nvPatchReplace[6], nvPatchReplace[7], nvPatchReplace[8], nvPatchReplace[9]);\n\n\t\t\t\t\t\/\/ Ok, everything looks sane enough\n\t\t\t\t\tnvPatch->section = SectionNVDA;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tSYSLOG(\"shiki\", \"unable to find or instructions\");\n\t\t\t}\n\t\t} else {\n\t\t\tSYSLOG(\"shiki\", \"failed to read AppleGVA framework %lu\", gvaSize);\n\t\t}\n\n\t\tif (gvaBuf) Buffer::deleter(gvaBuf);\n\t} else {\n\t\tSYSLOG(\"shiki\", \"failed to find suitable nvpatch\");\n\t}\n}\n\nstatic void shikiStart() {\n\t\/\/ Attempt to support fps.1_0 in Safari\n\tchar tmp[16];\n\tbool patchStreamVideo = PE_parse_boot_argn(\"-shikifps\", tmp, sizeof(tmp));\n\tbool leaveForceAccelRenderer = true;\n\tbool leaveBGRASupport = true;\n\tbool leaveNvidiaUnlock = true;\n\tbool leaveExecutableWhiteList = true;\n\tbool leaveAppleGVAAlone = true;\n\t\n\tif (PE_parse_boot_argn(\"shikigva\", tmp, sizeof(tmp))) {\n\t\tleaveForceAccelRenderer = !(tmp[0] & ForceOnlineRenderer);\n\t\tleaveBGRASupport = !(tmp[0] & AllowNonBGRA);\n\t\tleaveNvidiaUnlock = !(tmp[0] & ForceCompatibleRenderer);\n\t\tleaveExecutableWhiteList = !(tmp[0] & VDAExecutableWhitelist);\n\t\tleaveAppleGVAAlone = !(tmp[0] & KillAppleGVA);\n\t}\n\t\n\tif (PE_parse_boot_argn(\"-shikigva\", tmp, sizeof(tmp))) {\n\t\tSYSLOG(\"shiki\", \"-shikigva is deprecated use shikigva=1 instead\");\n\t\tleaveForceAccelRenderer = false;\n\t}\n\n\tDBGLOG(\"shiki\", \"stream %d accel %d bgra %d nvidia %d\/%d gva %d\", patchStreamVideo, !leaveForceAccelRenderer,\n\t\t   !leaveBGRASupport, !leaveNvidiaUnlock, !leaveExecutableWhiteList, !leaveAppleGVAAlone);\n\n\t\/\/ Disable unused SectionFSTREAM\n\tif (!patchStreamVideo)\n\t\tdisableSection(SectionNSTREAM);\n\t\n\tif (leaveForceAccelRenderer)\n\t\tdisableSection(SectionOFFLINE);\n\t\n\tif (leaveBGRASupport)\n\t\tdisableSection(SectionBGRA);\n\n\tif (leaveAppleGVAAlone)\n\t\tdisableSection(SectionKILLGVA);\n\n\tfor (size_t i = 0; i < ADDPR(binaryModSize); i++) {\n\t\tauto patches = ADDPR(binaryMod)[i].patches;\n\t\tfor (size_t j = 0; j < ADDPR(binaryMod)[i].count; j++) {\n\t\t\tif (patches[j].section == SectionNVDA) {\n\t\t\t\tnvPatch = &patches[j];\n\t\t\t\tDBGLOG(\"shiki\", \"found nvidia patch at %lu:%lu with size %lu\", i, j, nvPatch->size);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool nvPatchOk = false;\n\tif (nvPatch && !leaveNvidiaUnlock && getKernelVersion() >= KernelVersion::ElCapitan) {\n\t\t\/\/ Do not enable until we are certain it works\n\t\tnvPatch->section = SectionUnused;\n\t\tnvPatch->find    = nvPatchFind;\n\t\tnvPatch->replace = nvPatchReplace;\n\t\tnvPatch->size    = NVPatchSize;\n\t\tauto err = lilu.onPatcherLoad(shikiNvidiaPatch);\n\t\tif (err == LiluAPI::Error::NoError)\n\t\t\tnvPatchOk = true;\n\t\telse\n\t\t\tSYSLOG(\"shiki\", \"unable to attach to patcher load %d\", err);\n\t}\n\n\tif (leaveExecutableWhiteList || !nvPatchOk)\n\t\tdisableSection(SectionNVDA);\n\n\tauto err = lilu.onProcLoad(ADDPR(procInfo), ADDPR(procInfoSize), nullptr, nullptr, ADDPR(binaryMod), ADDPR(binaryModSize));\n\tif (err != LiluAPI::Error::NoError)\n\t\tSYSLOG(\"shiki\", \"unable to attach to process load %d\", err);\n}\n\nstatic const char *bootargOff[] {\n\t\"-shikioff\"\n};\n\nstatic const char *bootargDebug[] {\n\t\"-shikidbg\"\n};\n\nstatic const char *bootargBeta[] {\n\t\"-shikibeta\"\n};\n\nPluginConfiguration ADDPR(config) {\n\txStringify(PRODUCT_NAME),\n\tparseModuleVersion(xStringify(MODULE_VERSION)),\n\tLiluAPI::AllowNormal,\n\tbootargOff,\n\tarrsize(bootargOff),\n\tbootargDebug,\n\tarrsize(bootargDebug),\n\tbootargBeta,\n\tarrsize(bootargBeta),\n\tKernelVersion::Mavericks,\n\tKernelVersion::HighSierra,\n\tshikiStart\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"General.h\"\n\n#include <shellapi.h>\n\n#include \"..\/..\/3RVX\/LanguageTranslator.h\"\n#include \"..\/..\/3RVX\/Logger.h\"\n#include \"..\/..\/3RVX\/Settings.h\"\n#include \"..\/..\/3RVX\/SkinInfo.h\"\n\n#include \"..\/resource.h\"\n\nconst wchar_t General::REGKEY_NAME[] = L\"3RVX\";\nconst wchar_t General::REGKEY_RUN[]\n    = L\"Software\\\\Microsoft\\\\Windows\\\\CurrentVersion\\\\Run\";\n\nvoid General::Initialize() {\n    INIT_CONTROL(GRP_BEHAVIOR, GroupBox, _behaviorGroup);\n    INIT_CONTROL(CHK_STARTUP, Checkbox, _startup);\n    INIT_CONTROL(CHK_NOTIFY, Checkbox, _notifyIcon);\n    INIT_CONTROL(CHK_SOUNDS, Checkbox, _sounds);\n\n    INIT_CONTROL(GRP_SKIN, GroupBox, _skinGroup);\n    INIT_CONTROL(CMB_SKIN, ComboBox, _skin);\n    _skin.OnSelectionChange = [this]() {\n        LoadSkinInfo(_skin.Selection());\n        return true;\n    };\n    INIT_CONTROL(LBL_AUTHOR, Label, _author);\n    INIT_CONTROL(BTN_WEBSITE, Button, _website);\n    _website.OnClick = [this]() {\n        if (_url != L\"\") {\n            ShellExecute(NULL, L\"open\", _url.c_str(),\n                NULL, NULL, SW_SHOWNORMAL);\n        }\n        return true;\n    };\n\n    INIT_CONTROL(GRP_LANGUAGE, GroupBox, _languageGroup);\n    INIT_CONTROL(CMB_LANG, ComboBox, _language);\n}\n\nvoid General::LoadSettings() {\n    Settings *settings = Settings::Instance();\n    LanguageTranslator *lt = settings->Translator();\n    _startup.Checked(RunOnStartup());\n    _notifyIcon.Checked(settings->NotifyIconEnabled());\n    _sounds.Checked(settings->SoundEffectsEnabled());\n\n    \/* Determine which skins are available *\/\n    std::list<std::wstring> skins = FindSkins(Settings::SkinDir().c_str());\n    for (std::wstring skin : skins) {\n        _skin.AddItem(skin);\n    }\n\n    \/* Update the combo box with the current skin *\/\n    std::wstring current = settings->CurrentSkin();\n    int idx = _skin.Select(current);\n    if (idx == CB_ERR) {\n        _skin.Select(Settings::DefaultSkin);\n    }\n    LoadSkinInfo(current);\n\n    \/* Populate the language box *\/\n    std::list<std::wstring> languages = FindLanguages(\n        settings->LanguagesDir().c_str());\n    for (std::wstring language : languages) {\n        int ext = language.find(L\".xml\");\n        if (ext == language.npos) {\n            continue;\n        }\n\n        _language.AddItem(language.substr(0, ext));\n    }\n    std::wstring currentLang = settings->LanguageName();\n    _language.Select(currentLang);\n}\n\nvoid General::SaveSettings() {\n    if (_hWnd == NULL) {\n        return;\n    }\n\n    CLOG(L\"Saving: General\");\n    Settings *settings = Settings::Instance();\n\n    RunOnStartup(_startup.Checked());\n    settings->NotifyIconEnabled(_notifyIcon.Checked());\n    settings->SoundEffectsEnabled(_sounds.Checked());\n\n    settings->CurrentSkin(_skin.Selection());\n}\n\nbool General::RunOnStartup() {\n    long res;\n    HKEY key = NULL;\n    bool run = false;\n\n    res = RegOpenKeyEx(HKEY_CURRENT_USER, REGKEY_RUN, NULL, KEY_READ, &key);\n    if (res == ERROR_SUCCESS) {\n        res = RegQueryValueEx(key, REGKEY_NAME, NULL, NULL, NULL, NULL);\n        run = (res == ERROR_SUCCESS);\n        RegCloseKey(key);\n    }\n\n    return run;\n}\n\nbool General::RunOnStartup(bool enable) {\n    long res;\n    HKEY key = NULL;\n    bool ok = false;\n\n    std::wstring path = Settings::AppDir() + L\"\\\\3RVX.exe\";\n\n    res = RegOpenKeyEx(HKEY_CURRENT_USER, REGKEY_RUN,\n        NULL, KEY_ALL_ACCESS, &key);\n    if (res == ERROR_SUCCESS) {\n        if (enable) {\n            res = RegSetValueEx(key, REGKEY_NAME, NULL, REG_SZ,\n                (LPBYTE) path.c_str(), (path.size() + 1) * sizeof(TCHAR));\n            ok = (res == ERROR_SUCCESS);\n        } else {\n            res = RegDeleteValue(key, REGKEY_NAME);\n            ok = (res == ERROR_SUCCESS);\n        }\n        RegCloseKey(key);\n    }\n\n    return ok;\n}\n\nstd::list<std::wstring> General::FindSkins(std::wstring dir) {\n    std::list<std::wstring> skins;\n    WIN32_FIND_DATA ffd;\n    HANDLE hFind;\n\n    CLOG(L\"Finding skins in: %s\", dir.c_str());\n    dir += L\"\\\\*\";\n    hFind = FindFirstFile(dir.c_str(), &ffd);\n    if (hFind == INVALID_HANDLE_VALUE) {\n        CLOG(L\"FindFirstFile() failed\");\n        return skins;\n    }\n\n    do {\n        std::wstring fName(ffd.cFileName);\n        if (fName.at(0) == L'.') {\n            continue;\n        }\n        QCLOG(L\"%s\", fName.c_str());\n        skins.push_back(fName);\n    } while (FindNextFile(hFind, &ffd));\n    FindClose(hFind);\n\n    return skins;\n}\n\nvoid General::LoadSkinInfo(std::wstring skinName) {\n    std::wstring skinXML = Settings::Instance()->SkinXML(skinName);\n    SkinInfo s(skinXML);\n\n    std::wstring transAuthor\n        = Settings::Instance()->Translator()->TranslateAndReplace(\n        L\"Author: {1}\", s.Author());\n    _author.Text(transAuthor);\n\n    std::wstring url = s.URL();\n    if (url == L\"\") {\n        _website.Disable();\n    } else {\n        _url = s.URL();\n        _website.Enable();\n    }\n}\n\nstd::list<std::wstring> General::FindLanguages(std::wstring dir) {\n    std::list<std::wstring> languages;\n    WIN32_FIND_DATA ffd;\n    HANDLE hFind;\n\n    CLOG(L\"Finding language translations in: %s\", dir.c_str());\n    dir += L\"\\\\*.xml\";\n    hFind = FindFirstFile(dir.c_str(), &ffd);\n    if (hFind == INVALID_HANDLE_VALUE) {\n        CLOG(L\"FindFirstFile() failed\");\n        return languages;\n    }\n\n    do {\n        std::wstring fName(ffd.cFileName);\n\n        if (fName.at(0) == L'.') {\n            continue;\n        }\n\n        if (ffd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n            continue;\n        }\n\n        QCLOG(L\"%s\", fName.c_str());\n        languages.push_back(fName);\n    } while (FindNextFile(hFind, &ffd));\n    FindClose(hFind);\n\n    return languages;\n}<commit_msg>Save language selection<commit_after>#include \"General.h\"\n\n#include <shellapi.h>\n\n#include \"..\/..\/3RVX\/LanguageTranslator.h\"\n#include \"..\/..\/3RVX\/Logger.h\"\n#include \"..\/..\/3RVX\/Settings.h\"\n#include \"..\/..\/3RVX\/SkinInfo.h\"\n\n#include \"..\/resource.h\"\n\nconst wchar_t General::REGKEY_NAME[] = L\"3RVX\";\nconst wchar_t General::REGKEY_RUN[]\n    = L\"Software\\\\Microsoft\\\\Windows\\\\CurrentVersion\\\\Run\";\n\nvoid General::Initialize() {\n    INIT_CONTROL(GRP_BEHAVIOR, GroupBox, _behaviorGroup);\n    INIT_CONTROL(CHK_STARTUP, Checkbox, _startup);\n    INIT_CONTROL(CHK_NOTIFY, Checkbox, _notifyIcon);\n    INIT_CONTROL(CHK_SOUNDS, Checkbox, _sounds);\n\n    INIT_CONTROL(GRP_SKIN, GroupBox, _skinGroup);\n    INIT_CONTROL(CMB_SKIN, ComboBox, _skin);\n    _skin.OnSelectionChange = [this]() {\n        LoadSkinInfo(_skin.Selection());\n        return true;\n    };\n    INIT_CONTROL(LBL_AUTHOR, Label, _author);\n    INIT_CONTROL(BTN_WEBSITE, Button, _website);\n    _website.OnClick = [this]() {\n        if (_url != L\"\") {\n            ShellExecute(NULL, L\"open\", _url.c_str(),\n                NULL, NULL, SW_SHOWNORMAL);\n        }\n        return true;\n    };\n\n    INIT_CONTROL(GRP_LANGUAGE, GroupBox, _languageGroup);\n    INIT_CONTROL(CMB_LANG, ComboBox, _language);\n}\n\nvoid General::LoadSettings() {\n    Settings *settings = Settings::Instance();\n    LanguageTranslator *lt = settings->Translator();\n    _startup.Checked(RunOnStartup());\n    _notifyIcon.Checked(settings->NotifyIconEnabled());\n    _sounds.Checked(settings->SoundEffectsEnabled());\n\n    \/* Determine which skins are available *\/\n    std::list<std::wstring> skins = FindSkins(Settings::SkinDir().c_str());\n    for (std::wstring skin : skins) {\n        _skin.AddItem(skin);\n    }\n\n    \/* Update the combo box with the current skin *\/\n    std::wstring current = settings->CurrentSkin();\n    int idx = _skin.Select(current);\n    if (idx == CB_ERR) {\n        _skin.Select(Settings::DefaultSkin);\n    }\n    LoadSkinInfo(current);\n\n    \/* Populate the language box *\/\n    std::list<std::wstring> languages = FindLanguages(\n        settings->LanguagesDir().c_str());\n    for (std::wstring language : languages) {\n        int ext = language.find(L\".xml\");\n        if (ext == language.npos) {\n            continue;\n        }\n\n        _language.AddItem(language.substr(0, ext));\n    }\n    std::wstring currentLang = settings->LanguageName();\n    _language.Select(currentLang);\n}\n\nvoid General::SaveSettings() {\n    if (_hWnd == NULL) {\n        return;\n    }\n\n    CLOG(L\"Saving: General\");\n    Settings *settings = Settings::Instance();\n\n    RunOnStartup(_startup.Checked());\n    settings->NotifyIconEnabled(_notifyIcon.Checked());\n    settings->SoundEffectsEnabled(_sounds.Checked());\n\n    settings->CurrentSkin(_skin.Selection());\n\n    settings->LanguageName(_language.Selection());\n}\n\nbool General::RunOnStartup() {\n    long res;\n    HKEY key = NULL;\n    bool run = false;\n\n    res = RegOpenKeyEx(HKEY_CURRENT_USER, REGKEY_RUN, NULL, KEY_READ, &key);\n    if (res == ERROR_SUCCESS) {\n        res = RegQueryValueEx(key, REGKEY_NAME, NULL, NULL, NULL, NULL);\n        run = (res == ERROR_SUCCESS);\n        RegCloseKey(key);\n    }\n\n    return run;\n}\n\nbool General::RunOnStartup(bool enable) {\n    long res;\n    HKEY key = NULL;\n    bool ok = false;\n\n    std::wstring path = Settings::AppDir() + L\"\\\\3RVX.exe\";\n\n    res = RegOpenKeyEx(HKEY_CURRENT_USER, REGKEY_RUN,\n        NULL, KEY_ALL_ACCESS, &key);\n    if (res == ERROR_SUCCESS) {\n        if (enable) {\n            res = RegSetValueEx(key, REGKEY_NAME, NULL, REG_SZ,\n                (LPBYTE) path.c_str(), (path.size() + 1) * sizeof(TCHAR));\n            ok = (res == ERROR_SUCCESS);\n        } else {\n            res = RegDeleteValue(key, REGKEY_NAME);\n            ok = (res == ERROR_SUCCESS);\n        }\n        RegCloseKey(key);\n    }\n\n    return ok;\n}\n\nstd::list<std::wstring> General::FindSkins(std::wstring dir) {\n    std::list<std::wstring> skins;\n    WIN32_FIND_DATA ffd;\n    HANDLE hFind;\n\n    CLOG(L\"Finding skins in: %s\", dir.c_str());\n    dir += L\"\\\\*\";\n    hFind = FindFirstFile(dir.c_str(), &ffd);\n    if (hFind == INVALID_HANDLE_VALUE) {\n        CLOG(L\"FindFirstFile() failed\");\n        return skins;\n    }\n\n    do {\n        std::wstring fName(ffd.cFileName);\n        if (fName.at(0) == L'.') {\n            continue;\n        }\n        QCLOG(L\"%s\", fName.c_str());\n        skins.push_back(fName);\n    } while (FindNextFile(hFind, &ffd));\n    FindClose(hFind);\n\n    return skins;\n}\n\nvoid General::LoadSkinInfo(std::wstring skinName) {\n    std::wstring skinXML = Settings::Instance()->SkinXML(skinName);\n    SkinInfo s(skinXML);\n\n    std::wstring transAuthor\n        = Settings::Instance()->Translator()->TranslateAndReplace(\n        L\"Author: {1}\", s.Author());\n    _author.Text(transAuthor);\n\n    std::wstring url = s.URL();\n    if (url == L\"\") {\n        _website.Disable();\n    } else {\n        _url = s.URL();\n        _website.Enable();\n    }\n}\n\nstd::list<std::wstring> General::FindLanguages(std::wstring dir) {\n    std::list<std::wstring> languages;\n    WIN32_FIND_DATA ffd;\n    HANDLE hFind;\n\n    CLOG(L\"Finding language translations in: %s\", dir.c_str());\n    dir += L\"\\\\*.xml\";\n    hFind = FindFirstFile(dir.c_str(), &ffd);\n    if (hFind == INVALID_HANDLE_VALUE) {\n        CLOG(L\"FindFirstFile() failed\");\n        return languages;\n    }\n\n    do {\n        std::wstring fName(ffd.cFileName);\n\n        if (fName.at(0) == L'.') {\n            continue;\n        }\n\n        if (ffd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n            continue;\n        }\n\n        QCLOG(L\"%s\", fName.c_str());\n        languages.push_back(fName);\n    } while (FindNextFile(hFind, &ffd));\n    FindClose(hFind);\n\n    return languages;\n}<|endoftext|>"}
{"text":"<commit_before>#include \"KeyGrabber.h\"\n\n#include <string>\n\nKeyGrabber *KeyGrabber::instance = NULL;\n\nKeyGrabber *KeyGrabber::Instance() {\n    if (instance == NULL) {\n        instance = new KeyGrabber();\n    }\n\n    return instance;\n}\n\nbool KeyGrabber::Hook() {\n    _mouseHook = SetWindowsHookEx(WH_MOUSE_LL,\n        LowLevelMouseProc, NULL, NULL);\n\n    _keyHook = SetWindowsHookEx(WH_KEYBOARD_LL,\n        LowLevelKeyboardProc, NULL, NULL);\n\n    return _mouseHook && _keyHook;\n}\n\nbool KeyGrabber::Unhook() {\n    BOOL unMouse = UnhookWindowsHookEx(_mouseHook);\n    BOOL unKey = UnhookWindowsHookEx(_keyHook);\n    return unMouse && unKey;\n}\n\nvoid KeyGrabber::Grab(HWND hwnd) {\n    _updateHwnd = hwnd;\n    Hook();\n}\n\nbool KeyGrabber::IsModifier(DWORD vk) {\n    switch (vk) {\n    case VK_MENU:\n    case VK_LMENU:\n    case VK_RMENU:\n    case VK_CONTROL:\n    case VK_LCONTROL:\n    case VK_RCONTROL:\n    case VK_SHIFT:\n    case VK_LSHIFT:\n    case VK_RSHIFT:\n    case VK_LWIN:\n    case VK_RWIN:\n        return true;\n    }\n    return false;\n}\n\nint KeyGrabber::Modifiers() {\n    int mods = 0;\n    mods += (GetKeyState(VK_MENU) & 0x8000) << 1;\n    mods += (GetKeyState(VK_CONTROL) & 0x8000) << 2;\n    mods += (GetKeyState(VK_SHIFT) & 0x8000) << 3;\n    mods += (GetKeyState(VK_LWIN) & 0x8000) << 4;\n    mods += (GetKeyState(VK_RWIN) & 0x8000) << 4;\n    return mods;\n}\n\nstd::wstring KeyGrabber::ModString(int modifiers) {\n    std::wstring str = L\"\";\n    if (modifiers & HKM_MOD_ALT) {\n        str += VKToString(VK_MENU) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_CTRL) {\n        str += VKToString(VK_CONTROL) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_SHF) {\n        str += VKToString(VK_SHIFT) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_WIN) {\n        str += L\"Win + \";\n    }\n\n    return str;\n}\n\nstd::wstring KeyGrabber::VKToString(\n    unsigned int vk, bool extendedKey, bool distinguishLeftRight) {\n\n    BOOL dontCare = distinguishLeftRight ? FALSE : TRUE;\n    int extended = extendedKey ? 0x1 : 0x0;\n\n    unsigned int scanCode = MapVirtualKey(vk, MAPVK_VK_TO_VSC);\n    scanCode = scanCode << 16;\n    scanCode |= extended << 24;\n    scanCode |= dontCare << 25;\n    wchar_t buf[256] = {};\n    GetKeyNameText(scanCode, buf, 256);\n    return std::wstring(buf);\n}\n\nLRESULT CALLBACK\nKeyGrabber::KeyProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    if (nCode < 0) {\n        return CallNextHookEx(NULL, nCode, wParam, lParam);\n    }\n\n    if (wParam == WM_KEYUP || wParam == WM_SYSKEYUP) {\n        KBDLLHOOKSTRUCT *kbInfo = (KBDLLHOOKSTRUCT*) lParam;\n\n        DWORD vk = kbInfo->vkCode;\n        if (IsModifier(kbInfo->vkCode)) {\n            \/* Ignore modifier keys *\/\n            return CallNextHookEx(NULL, nCode, wParam, lParam);\n        }\n\n        \/* GetKeyNameText expects the following:\n         * 16-23: scan code\n         *    24: extended key flag\n         *    25: 'do not care' bit (don't distinguish between L\/R keys) *\/\n        BOOL dontCare = TRUE;\n        LONG newlParam;\n        newlParam = (kbInfo->scanCode << 16);\n        newlParam |= (kbInfo->flags & 0x1) << 24;\n        newlParam |= dontCare << 25;\n        if (kbInfo->vkCode == VK_RSHIFT) {\n            \/* For some reason, the right shift key ends up having its extended\n             * key flag set and then prints the wrong thing. This doesn't matter\n             * here, but we'll fix it in case we need this info later. *\/\n            newlParam ^= 0x1000000;\n        }\n\n        wchar_t buf[256] = {};\n        GetKeyNameText(newlParam, buf, 256);\n        int mods = Modifiers();\n        std::wstring modStr = ModString(mods) + buf;\n        SetWindowText(_updateHwnd, modStr.c_str());\n\n        \/* Prevent other applications from receiving this event *\/\n        return (LRESULT) 1;\n    }\n\n    return CallNextHookEx(NULL, nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::MouseProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    if (nCode < 0) {\n        return CallNextHookEx(NULL, nCode, wParam, lParam);\n    }\n\n    return CallNextHookEx(NULL, nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::LowLevelMouseProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    return KeyGrabber::instance->MouseProc(nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::LowLevelKeyboardProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    return KeyGrabber::instance->KeyProc(nCode, wParam, lParam);\n}<commit_msg>Respond to key down events instead of up<commit_after>#include \"KeyGrabber.h\"\n\n#include <string>\n\nKeyGrabber *KeyGrabber::instance = NULL;\n\nKeyGrabber *KeyGrabber::Instance() {\n    if (instance == NULL) {\n        instance = new KeyGrabber();\n    }\n\n    return instance;\n}\n\nbool KeyGrabber::Hook() {\n    _mouseHook = SetWindowsHookEx(WH_MOUSE_LL,\n        LowLevelMouseProc, NULL, NULL);\n\n    _keyHook = SetWindowsHookEx(WH_KEYBOARD_LL,\n        LowLevelKeyboardProc, NULL, NULL);\n\n    return _mouseHook && _keyHook;\n}\n\nbool KeyGrabber::Unhook() {\n    BOOL unMouse = UnhookWindowsHookEx(_mouseHook);\n    BOOL unKey = UnhookWindowsHookEx(_keyHook);\n    return unMouse && unKey;\n}\n\nvoid KeyGrabber::Grab(HWND hwnd) {\n    _updateHwnd = hwnd;\n    Hook();\n}\n\nbool KeyGrabber::IsModifier(DWORD vk) {\n    switch (vk) {\n    case VK_MENU:\n    case VK_LMENU:\n    case VK_RMENU:\n    case VK_CONTROL:\n    case VK_LCONTROL:\n    case VK_RCONTROL:\n    case VK_SHIFT:\n    case VK_LSHIFT:\n    case VK_RSHIFT:\n    case VK_LWIN:\n    case VK_RWIN:\n        return true;\n    }\n    return false;\n}\n\nint KeyGrabber::Modifiers() {\n    int mods = 0;\n    mods += (GetKeyState(VK_MENU) & 0x8000) << 1;\n    mods += (GetKeyState(VK_CONTROL) & 0x8000) << 2;\n    mods += (GetKeyState(VK_SHIFT) & 0x8000) << 3;\n    mods += (GetKeyState(VK_LWIN) & 0x8000) << 4;\n    mods += (GetKeyState(VK_RWIN) & 0x8000) << 4;\n    return mods;\n}\n\nstd::wstring KeyGrabber::ModString(int modifiers) {\n    std::wstring str = L\"\";\n    if (modifiers & HKM_MOD_ALT) {\n        str += VKToString(VK_MENU) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_CTRL) {\n        str += VKToString(VK_CONTROL) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_SHF) {\n        str += VKToString(VK_SHIFT) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_WIN) {\n        str += L\"Win + \";\n    }\n\n    return str;\n}\n\nstd::wstring KeyGrabber::VKToString(\n    unsigned int vk, bool extendedKey, bool distinguishLeftRight) {\n\n    BOOL dontCare = distinguishLeftRight ? FALSE : TRUE;\n    int extended = extendedKey ? 0x1 : 0x0;\n\n    unsigned int scanCode = MapVirtualKey(vk, MAPVK_VK_TO_VSC);\n    scanCode = scanCode << 16;\n    scanCode |= extended << 24;\n    scanCode |= dontCare << 25;\n    wchar_t buf[256] = {};\n    GetKeyNameText(scanCode, buf, 256);\n    return std::wstring(buf);\n}\n\nLRESULT CALLBACK\nKeyGrabber::KeyProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    if (nCode < 0) {\n        return CallNextHookEx(NULL, nCode, wParam, lParam);\n    }\n\n    if (wParam == WM_KEYDOWN || wParam == WM_SYSKEYDOWN) {\n        KBDLLHOOKSTRUCT *kbInfo = (KBDLLHOOKSTRUCT*) lParam;\n\n        DWORD vk = kbInfo->vkCode;\n        if (IsModifier(kbInfo->vkCode)) {\n            \/* Ignore modifier keys *\/\n            return CallNextHookEx(NULL, nCode, wParam, lParam);\n        }\n\n        \/* GetKeyNameText expects the following:\n         * 16-23: scan code\n         *    24: extended key flag\n         *    25: 'do not care' bit (don't distinguish between L\/R keys) *\/\n        BOOL dontCare = TRUE;\n        LONG newlParam;\n        newlParam = (kbInfo->scanCode << 16);\n        newlParam |= (kbInfo->flags & 0x1) << 24;\n        newlParam |= dontCare << 25;\n        if (kbInfo->vkCode == VK_RSHIFT) {\n            \/* For some reason, the right shift key ends up having its extended\n             * key flag set and then prints the wrong thing. This doesn't matter\n             * here, but we'll fix it in case we need this info later. *\/\n            newlParam ^= 0x1000000;\n        }\n\n        wchar_t buf[256] = {};\n        GetKeyNameText(newlParam, buf, 256);\n        int mods = Modifiers();\n        std::wstring modStr = ModString(mods) + buf;\n        SetWindowText(_updateHwnd, modStr.c_str());\n\n        \/* Prevent other applications from receiving this event *\/\n        return (LRESULT) 1;\n    }\n\n    return CallNextHookEx(NULL, nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::MouseProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    if (nCode < 0) {\n        return CallNextHookEx(NULL, nCode, wParam, lParam);\n    }\n\n    return CallNextHookEx(NULL, nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::LowLevelMouseProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    return KeyGrabber::instance->MouseProc(nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::LowLevelKeyboardProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    return KeyGrabber::instance->KeyProc(nCode, wParam, lParam);\n}<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: optctl.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 17:25: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_svx.hxx\"\n\n#ifdef SVX_DLLIMPLEMENTATION\n#undef SVX_DLLIMPLEMENTATION\n#endif\n\n#ifndef _SVX_OPTCTL_HXX\n#include \"optctl.hxx\"\n#endif\n#ifndef _SVX_DIALMGR_HXX\n#include <svx\/dialmgr.hxx>\n#endif\n\n#ifndef _SVX_OPTCTL_HRC\n#include \"optctl.hrc\"\n#endif\n#ifndef _SVX_DIALOGS_HRC\n#include <svx\/dialogs.hrc>\n#endif\n\n#ifndef _SVTOOLS_CTLOPTIONS_HXX\n#include <svtools\/ctloptions.hxx>\n#endif\n\n\/\/ class SvxCTLOptionsPage -----------------------------------------------------\n\nIMPL_LINK( SvxCTLOptionsPage, SequenceCheckingCB_Hdl, void*, EMPTYARG )\n{\n    sal_Bool bIsSequenceChecking = m_aSequenceCheckingCB.IsChecked();\n    m_aRestrictedCB.Enable( bIsSequenceChecking );\n    m_aTypeReplaceCB.Enable( bIsSequenceChecking );\n    \/\/ #i48117#: by default restricted and type&replace have to be switched on\n    if(bIsSequenceChecking)\n    {\n        m_aTypeReplaceCB.Check( sal_True );\n        m_aRestrictedCB.Check( sal_True );\n    }\n    return 0;\n}\n\nSvxCTLOptionsPage::SvxCTLOptionsPage( Window* pParent, const SfxItemSet& rSet ) :\n\n    SfxTabPage( pParent, SVX_RES( RID_SVXPAGE_OPTIONS_CTL ), rSet ),\n\n    m_aSequenceCheckingFL   ( this, SVX_RES( FL_SEQUENCECHECKING ) ),\n    m_aSequenceCheckingCB   ( this, SVX_RES( CB_SEQUENCECHECKING ) ),\n    m_aRestrictedCB         ( this, SVX_RES( CB_RESTRICTED ) ),\n    m_aTypeReplaceCB        ( this, SVX_RES( CB_TYPE_REPLACE ) ),\n    m_aCursorControlFL      ( this, SVX_RES( FL_CURSORCONTROL ) ),\n    m_aMovementFT           ( this, SVX_RES( FT_MOVEMENT ) ),\n    m_aMovementLogicalRB    ( this, SVX_RES( RB_MOVEMENT_LOGICAL ) ),\n    m_aMovementVisualRB     ( this, SVX_RES( RB_MOVEMENT_VISUAL ) ),\n    m_aGeneralFL            ( this, SVX_RES( FL_GENERAL ) ),\n    m_aNumeralsFT           ( this, SVX_RES( FT_NUMERALS ) ),\n    m_aNumeralsLB           ( this, SVX_RES( LB_NUMERALS ) )\n\n{\n    FreeResource();\n\n    m_aSequenceCheckingCB.SetClickHdl( LINK( this, SvxCTLOptionsPage, SequenceCheckingCB_Hdl ) );\n\n    m_aNumeralsLB.SetDropDownLineCount( m_aNumeralsLB.GetEntryCount() );\n}\n\/\/ -----------------------------------------------------------------------------\nSvxCTLOptionsPage::~SvxCTLOptionsPage()\n{\n}\n\/\/ -----------------------------------------------------------------------------\nSfxTabPage* SvxCTLOptionsPage::Create( Window* pParent, const SfxItemSet& rAttrSet )\n{\n    return new SvxCTLOptionsPage( pParent, rAttrSet );\n}\n\/\/ -----------------------------------------------------------------------------\nBOOL SvxCTLOptionsPage::FillItemSet( SfxItemSet& )\n{\n    BOOL bModified = FALSE;\n    SvtCTLOptions aCTLOptions;\n\n    \/\/ Sequence checking\n    BOOL bChecked = m_aSequenceCheckingCB.IsChecked();\n    if ( bChecked != m_aSequenceCheckingCB.GetSavedValue() )\n    {\n        aCTLOptions.SetCTLSequenceChecking( bChecked );\n        bModified = TRUE;\n    }\n\n    bChecked = m_aRestrictedCB.IsChecked();\n    if( bChecked != m_aRestrictedCB.GetSavedValue() )\n    {\n        aCTLOptions.SetCTLSequenceCheckingRestricted( bChecked );\n        bModified = TRUE;\n    }\n    bChecked = m_aTypeReplaceCB.IsChecked();\n    if( bChecked != m_aTypeReplaceCB.GetSavedValue())\n    {\n        aCTLOptions.SetCTLSequenceCheckingTypeAndReplace(bChecked);\n        bModified = TRUE;\n    }\n\n    BOOL bLogicalChecked = m_aMovementLogicalRB.IsChecked();\n    BOOL bVisualChecked = m_aMovementVisualRB.IsChecked();\n    if ( bLogicalChecked != m_aMovementLogicalRB.GetSavedValue() ||\n         bVisualChecked != m_aMovementVisualRB.GetSavedValue() )\n    {\n        SvtCTLOptions::CursorMovement eMovement =\n            bLogicalChecked ? SvtCTLOptions::MOVEMENT_LOGICAL : SvtCTLOptions::MOVEMENT_VISUAL;\n        aCTLOptions.SetCTLCursorMovement( eMovement );\n        bModified = TRUE;\n    }\n\n    USHORT nPos = m_aNumeralsLB.GetSelectEntryPos();\n    if ( nPos != m_aNumeralsLB.GetSavedValue() )\n    {\n        aCTLOptions.SetCTLTextNumerals( (SvtCTLOptions::TextNumerals)nPos );\n        bModified = TRUE;\n    }\n\n    return bModified;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SvxCTLOptionsPage::Reset( const SfxItemSet& )\n{\n    SvtCTLOptions aCTLOptions;\n\n    m_aSequenceCheckingCB.Check( aCTLOptions.IsCTLSequenceChecking() );\n    m_aRestrictedCB.Check( aCTLOptions.IsCTLSequenceCheckingRestricted() );\n    m_aTypeReplaceCB.Check( aCTLOptions.IsCTLSequenceCheckingTypeAndReplace() );\n\n    SvtCTLOptions::CursorMovement eMovement = aCTLOptions.GetCTLCursorMovement();\n    switch ( eMovement )\n    {\n        case SvtCTLOptions::MOVEMENT_LOGICAL :\n            m_aMovementLogicalRB.Check();\n            break;\n\n        case SvtCTLOptions::MOVEMENT_VISUAL :\n            m_aMovementVisualRB.Check();\n            break;\n\n        default:\n            DBG_ERRORFILE( \"SvxCTLOptionsPage::Reset(): invalid movement enum\" );\n    }\n\n    USHORT nPos = (USHORT)aCTLOptions.GetCTLTextNumerals();\n    DBG_ASSERT( nPos < m_aNumeralsLB.GetEntryCount(), \"SvxCTLOptionsPage::Reset(): invalid numerals enum\" );\n    m_aNumeralsLB.SelectEntryPos( nPos );\n\n    m_aSequenceCheckingCB.SaveValue();\n    m_aRestrictedCB.SaveValue();\n    m_aTypeReplaceCB.SaveValue();\n    m_aMovementLogicalRB.SaveValue();\n    m_aMovementVisualRB.SaveValue();\n    m_aNumeralsLB.SaveValue();\n\n    sal_Bool bIsSequenceChecking = m_aSequenceCheckingCB.IsChecked();\n    m_aRestrictedCB.Enable( bIsSequenceChecking );\n    m_aTypeReplaceCB.Enable( bIsSequenceChecking );\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.10.368); FILE MERGED 2008\/04\/01 15:50:27 thb 1.10.368.3: #i85898# Stripping all external header guards 2008\/04\/01 12:48:17 thb 1.10.368.2: #i85898# Stripping all external header guards 2008\/03\/31 14:19:57 rt 1.10.368.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: optctl.cxx,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\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#include \"optctl.hxx\"\n#include <svx\/dialmgr.hxx>\n\n#ifndef _SVX_OPTCTL_HRC\n#include \"optctl.hrc\"\n#endif\n#ifndef _SVX_DIALOGS_HRC\n#include <svx\/dialogs.hrc>\n#endif\n#include <svtools\/ctloptions.hxx>\n\n\/\/ class SvxCTLOptionsPage -----------------------------------------------------\n\nIMPL_LINK( SvxCTLOptionsPage, SequenceCheckingCB_Hdl, void*, EMPTYARG )\n{\n    sal_Bool bIsSequenceChecking = m_aSequenceCheckingCB.IsChecked();\n    m_aRestrictedCB.Enable( bIsSequenceChecking );\n    m_aTypeReplaceCB.Enable( bIsSequenceChecking );\n    \/\/ #i48117#: by default restricted and type&replace have to be switched on\n    if(bIsSequenceChecking)\n    {\n        m_aTypeReplaceCB.Check( sal_True );\n        m_aRestrictedCB.Check( sal_True );\n    }\n    return 0;\n}\n\nSvxCTLOptionsPage::SvxCTLOptionsPage( Window* pParent, const SfxItemSet& rSet ) :\n\n    SfxTabPage( pParent, SVX_RES( RID_SVXPAGE_OPTIONS_CTL ), rSet ),\n\n    m_aSequenceCheckingFL   ( this, SVX_RES( FL_SEQUENCECHECKING ) ),\n    m_aSequenceCheckingCB   ( this, SVX_RES( CB_SEQUENCECHECKING ) ),\n    m_aRestrictedCB         ( this, SVX_RES( CB_RESTRICTED ) ),\n    m_aTypeReplaceCB        ( this, SVX_RES( CB_TYPE_REPLACE ) ),\n    m_aCursorControlFL      ( this, SVX_RES( FL_CURSORCONTROL ) ),\n    m_aMovementFT           ( this, SVX_RES( FT_MOVEMENT ) ),\n    m_aMovementLogicalRB    ( this, SVX_RES( RB_MOVEMENT_LOGICAL ) ),\n    m_aMovementVisualRB     ( this, SVX_RES( RB_MOVEMENT_VISUAL ) ),\n    m_aGeneralFL            ( this, SVX_RES( FL_GENERAL ) ),\n    m_aNumeralsFT           ( this, SVX_RES( FT_NUMERALS ) ),\n    m_aNumeralsLB           ( this, SVX_RES( LB_NUMERALS ) )\n\n{\n    FreeResource();\n\n    m_aSequenceCheckingCB.SetClickHdl( LINK( this, SvxCTLOptionsPage, SequenceCheckingCB_Hdl ) );\n\n    m_aNumeralsLB.SetDropDownLineCount( m_aNumeralsLB.GetEntryCount() );\n}\n\/\/ -----------------------------------------------------------------------------\nSvxCTLOptionsPage::~SvxCTLOptionsPage()\n{\n}\n\/\/ -----------------------------------------------------------------------------\nSfxTabPage* SvxCTLOptionsPage::Create( Window* pParent, const SfxItemSet& rAttrSet )\n{\n    return new SvxCTLOptionsPage( pParent, rAttrSet );\n}\n\/\/ -----------------------------------------------------------------------------\nBOOL SvxCTLOptionsPage::FillItemSet( SfxItemSet& )\n{\n    BOOL bModified = FALSE;\n    SvtCTLOptions aCTLOptions;\n\n    \/\/ Sequence checking\n    BOOL bChecked = m_aSequenceCheckingCB.IsChecked();\n    if ( bChecked != m_aSequenceCheckingCB.GetSavedValue() )\n    {\n        aCTLOptions.SetCTLSequenceChecking( bChecked );\n        bModified = TRUE;\n    }\n\n    bChecked = m_aRestrictedCB.IsChecked();\n    if( bChecked != m_aRestrictedCB.GetSavedValue() )\n    {\n        aCTLOptions.SetCTLSequenceCheckingRestricted( bChecked );\n        bModified = TRUE;\n    }\n    bChecked = m_aTypeReplaceCB.IsChecked();\n    if( bChecked != m_aTypeReplaceCB.GetSavedValue())\n    {\n        aCTLOptions.SetCTLSequenceCheckingTypeAndReplace(bChecked);\n        bModified = TRUE;\n    }\n\n    BOOL bLogicalChecked = m_aMovementLogicalRB.IsChecked();\n    BOOL bVisualChecked = m_aMovementVisualRB.IsChecked();\n    if ( bLogicalChecked != m_aMovementLogicalRB.GetSavedValue() ||\n         bVisualChecked != m_aMovementVisualRB.GetSavedValue() )\n    {\n        SvtCTLOptions::CursorMovement eMovement =\n            bLogicalChecked ? SvtCTLOptions::MOVEMENT_LOGICAL : SvtCTLOptions::MOVEMENT_VISUAL;\n        aCTLOptions.SetCTLCursorMovement( eMovement );\n        bModified = TRUE;\n    }\n\n    USHORT nPos = m_aNumeralsLB.GetSelectEntryPos();\n    if ( nPos != m_aNumeralsLB.GetSavedValue() )\n    {\n        aCTLOptions.SetCTLTextNumerals( (SvtCTLOptions::TextNumerals)nPos );\n        bModified = TRUE;\n    }\n\n    return bModified;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SvxCTLOptionsPage::Reset( const SfxItemSet& )\n{\n    SvtCTLOptions aCTLOptions;\n\n    m_aSequenceCheckingCB.Check( aCTLOptions.IsCTLSequenceChecking() );\n    m_aRestrictedCB.Check( aCTLOptions.IsCTLSequenceCheckingRestricted() );\n    m_aTypeReplaceCB.Check( aCTLOptions.IsCTLSequenceCheckingTypeAndReplace() );\n\n    SvtCTLOptions::CursorMovement eMovement = aCTLOptions.GetCTLCursorMovement();\n    switch ( eMovement )\n    {\n        case SvtCTLOptions::MOVEMENT_LOGICAL :\n            m_aMovementLogicalRB.Check();\n            break;\n\n        case SvtCTLOptions::MOVEMENT_VISUAL :\n            m_aMovementVisualRB.Check();\n            break;\n\n        default:\n            DBG_ERRORFILE( \"SvxCTLOptionsPage::Reset(): invalid movement enum\" );\n    }\n\n    USHORT nPos = (USHORT)aCTLOptions.GetCTLTextNumerals();\n    DBG_ASSERT( nPos < m_aNumeralsLB.GetEntryCount(), \"SvxCTLOptionsPage::Reset(): invalid numerals enum\" );\n    m_aNumeralsLB.SelectEntryPos( nPos );\n\n    m_aSequenceCheckingCB.SaveValue();\n    m_aRestrictedCB.SaveValue();\n    m_aTypeReplaceCB.SaveValue();\n    m_aMovementLogicalRB.SaveValue();\n    m_aMovementVisualRB.SaveValue();\n    m_aNumeralsLB.SaveValue();\n\n    sal_Bool bIsSequenceChecking = m_aSequenceCheckingCB.IsChecked();\n    m_aRestrictedCB.Enable( bIsSequenceChecking );\n    m_aTypeReplaceCB.Enable( bIsSequenceChecking );\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"KeyGrabber.h\"\n\n#include <string>\n\nKeyGrabber *KeyGrabber::instance = NULL;\n\nKeyGrabber *KeyGrabber::Instance() {\n    if (instance == NULL) {\n        instance = new KeyGrabber();\n    }\n\n    return instance;\n}\n\nbool KeyGrabber::Hook() {\n    _mouseHook = SetWindowsHookEx(WH_MOUSE_LL,\n        LowLevelMouseProc, NULL, NULL);\n\n    _keyHook = SetWindowsHookEx(WH_KEYBOARD_LL,\n        LowLevelKeyboardProc, NULL, NULL);\n\n    return _mouseHook && _keyHook;\n}\n\nbool KeyGrabber::Unhook() {\n    BOOL unMouse = UnhookWindowsHookEx(_mouseHook);\n    BOOL unKey = UnhookWindowsHookEx(_keyHook);\n    return unMouse && unKey;\n}\n\nvoid KeyGrabber::Grab(HWND hwnd) {\n    _updateHwnd = hwnd;\n    Hook();\n}\n\nbool KeyGrabber::IsModifier(DWORD vk) {\n    switch (vk) {\n    case VK_MENU:\n    case VK_LMENU:\n    case VK_RMENU:\n    case VK_CONTROL:\n    case VK_LCONTROL:\n    case VK_RCONTROL:\n    case VK_SHIFT:\n    case VK_LSHIFT:\n    case VK_RSHIFT:\n    case VK_LWIN:\n    case VK_RWIN:\n        return true;\n    }\n    return false;\n}\n\nint KeyGrabber::Modifiers() {\n    int mods = 0;\n    mods += (GetKeyState(VK_MENU) & 0x8000) << 1;\n    mods += (GetKeyState(VK_CONTROL) & 0x8000) << 2;\n    mods += (GetKeyState(VK_SHIFT) & 0x8000) << 3;\n    mods += (GetKeyState(VK_LWIN) & 0x8000) << 4;\n    mods += (GetKeyState(VK_RWIN) & 0x8000) << 4;\n    return mods;\n}\n\nstd::wstring KeyGrabber::ModString(int modifiers) {\n    std::wstring str = L\"\";\n    if (modifiers & HKM_MOD_ALT) {\n        str += VKToString(VK_MENU) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_CTRL) {\n        str += VKToString(VK_CONTROL) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_SHF) {\n        str += VKToString(VK_SHIFT) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_WIN) {\n        str += L\"Win + \";\n    }\n\n    return str;\n}\n\nstd::wstring KeyGrabber::VKToString(\n    unsigned int vk, bool extendedKey, bool distinguishLeftRight) {\n\n    BOOL dontCare = distinguishLeftRight ? FALSE : TRUE;\n    int extended = extendedKey ? 0x1 : 0x0;\n\n    unsigned int scanCode = MapVirtualKey(vk, MAPVK_VK_TO_VSC);\n    scanCode = scanCode << 16;\n    scanCode |= extended << 24;\n    scanCode |= dontCare << 25;\n    wchar_t buf[256] = {};\n    GetKeyNameText(scanCode, buf, 256);\n    return std::wstring(buf);\n}\n\nLRESULT CALLBACK\nKeyGrabber::KeyProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    if (nCode < 0) {\n        return CallNextHookEx(NULL, nCode, wParam, lParam);\n    }\n\n    if (wParam == WM_KEYDOWN || wParam == WM_SYSKEYDOWN) {\n        KBDLLHOOKSTRUCT *kbInfo = (KBDLLHOOKSTRUCT*) lParam;\n\n        DWORD vk = kbInfo->vkCode;\n        if (IsModifier(kbInfo->vkCode)) {\n            \/* Ignore modifier keys *\/\n            return CallNextHookEx(NULL, nCode, wParam, lParam);\n        }\n\n        \/* GetKeyNameText expects the following:\n         * 16-23: scan code\n         *    24: extended key flag\n         *    25: 'do not care' bit (don't distinguish between L\/R keys) *\/\n        BOOL dontCare = TRUE;\n        LONG newlParam;\n        newlParam = (kbInfo->scanCode << 16);\n        newlParam |= (kbInfo->flags & 0x1) << 24;\n        newlParam |= dontCare << 25;\n        if (kbInfo->vkCode == VK_RSHIFT) {\n            \/* For some reason, the right shift key ends up having its extended\n             * key flag set and then prints the wrong thing. This doesn't matter\n             * here, but we'll fix it in case we need this info later. *\/\n            newlParam ^= 0x1000000;\n        }\n\n        wchar_t buf[256] = {};\n        GetKeyNameText(newlParam, buf, 256);\n        int mods = Modifiers();\n        std::wstring modStr = ModString(mods) + buf;\n        SetWindowText(_updateHwnd, modStr.c_str());\n\n        \/* Prevent other applications from receiving this event *\/\n        return (LRESULT) 1;\n    }\n\n    return CallNextHookEx(NULL, nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::MouseProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    if (nCode < 0) {\n        return CallNextHookEx(NULL, nCode, wParam, lParam);\n    }\n\n    return CallNextHookEx(NULL, nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::LowLevelMouseProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    return KeyGrabber::instance->MouseProc(nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::LowLevelKeyboardProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    return KeyGrabber::instance->KeyProc(nCode, wParam, lParam);\n}<commit_msg>Need to use GetAsyncKeyState() since the messages won't be processed when we're handling WM_KEYDOWN et al<commit_after>#include \"KeyGrabber.h\"\n\n#include <string>\n\nKeyGrabber *KeyGrabber::instance = NULL;\n\nKeyGrabber *KeyGrabber::Instance() {\n    if (instance == NULL) {\n        instance = new KeyGrabber();\n    }\n\n    return instance;\n}\n\nbool KeyGrabber::Hook() {\n    _mouseHook = SetWindowsHookEx(WH_MOUSE_LL,\n        LowLevelMouseProc, NULL, NULL);\n\n    _keyHook = SetWindowsHookEx(WH_KEYBOARD_LL,\n        LowLevelKeyboardProc, NULL, NULL);\n\n    return _mouseHook && _keyHook;\n}\n\nbool KeyGrabber::Unhook() {\n    BOOL unMouse = UnhookWindowsHookEx(_mouseHook);\n    BOOL unKey = UnhookWindowsHookEx(_keyHook);\n    return unMouse && unKey;\n}\n\nvoid KeyGrabber::Grab(HWND hwnd) {\n    _updateHwnd = hwnd;\n    Hook();\n}\n\nbool KeyGrabber::IsModifier(DWORD vk) {\n    switch (vk) {\n    case VK_MENU:\n    case VK_LMENU:\n    case VK_RMENU:\n    case VK_CONTROL:\n    case VK_LCONTROL:\n    case VK_RCONTROL:\n    case VK_SHIFT:\n    case VK_LSHIFT:\n    case VK_RSHIFT:\n    case VK_LWIN:\n    case VK_RWIN:\n        return true;\n    }\n    return false;\n}\n\nint KeyGrabber::Modifiers() {\n    int mods = 0;\n    mods += (GetAsyncKeyState(VK_MENU) & 0x8000) << 1;\n    mods += (GetAsyncKeyState(VK_CONTROL) & 0x8000) << 2;\n    mods += (GetAsyncKeyState(VK_SHIFT) & 0x8000) << 3;\n    mods += (GetAsyncKeyState(VK_LWIN) & 0x8000) << 4;\n    mods += (GetAsyncKeyState(VK_RWIN) & 0x8000) << 4;\n    return mods;\n}\n\nstd::wstring KeyGrabber::ModString(int modifiers) {\n    std::wstring str = L\"\";\n    if (modifiers & HKM_MOD_ALT) {\n        str += VKToString(VK_MENU) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_CTRL) {\n        str += VKToString(VK_CONTROL) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_SHF) {\n        str += VKToString(VK_SHIFT) + L\" + \";\n    }\n    if (modifiers & HKM_MOD_WIN) {\n        str += L\"Win + \";\n    }\n\n    return str;\n}\n\nstd::wstring KeyGrabber::VKToString(\n    unsigned int vk, bool extendedKey, bool distinguishLeftRight) {\n\n    BOOL dontCare = distinguishLeftRight ? FALSE : TRUE;\n    int extended = extendedKey ? 0x1 : 0x0;\n\n    unsigned int scanCode = MapVirtualKey(vk, MAPVK_VK_TO_VSC);\n    scanCode = scanCode << 16;\n    scanCode |= extended << 24;\n    scanCode |= dontCare << 25;\n    wchar_t buf[256] = {};\n    GetKeyNameText(scanCode, buf, 256);\n    return std::wstring(buf);\n}\n\nLRESULT CALLBACK\nKeyGrabber::KeyProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    if (nCode < 0) {\n        return CallNextHookEx(NULL, nCode, wParam, lParam);\n    }\n\n    if (wParam == WM_KEYDOWN || wParam == WM_SYSKEYDOWN) {\n        KBDLLHOOKSTRUCT *kbInfo = (KBDLLHOOKSTRUCT*) lParam;\n\n        DWORD vk = kbInfo->vkCode;\n        if (IsModifier(kbInfo->vkCode)) {\n            \/* Ignore modifier keys *\/\n            return CallNextHookEx(NULL, nCode, wParam, lParam);\n        }\n\n        \/* GetKeyNameText expects the following:\n         * 16-23: scan code\n         *    24: extended key flag\n         *    25: 'do not care' bit (don't distinguish between L\/R keys) *\/\n        BOOL dontCare = TRUE;\n        LONG newlParam;\n        newlParam = (kbInfo->scanCode << 16);\n        newlParam |= (kbInfo->flags & 0x1) << 24;\n        newlParam |= dontCare << 25;\n        if (kbInfo->vkCode == VK_RSHIFT) {\n            \/* For some reason, the right shift key ends up having its extended\n             * key flag set and then prints the wrong thing. This doesn't matter\n             * here, but we'll fix it in case we need this info later. *\/\n            newlParam ^= 0x1000000;\n        }\n\n        wchar_t buf[256] = {};\n        GetKeyNameText(newlParam, buf, 256);\n        int mods = Modifiers();\n        std::wstring modStr = ModString(mods) + buf;\n        SetWindowText(_updateHwnd, modStr.c_str());\n\n        \/* Prevent other applications from receiving this event *\/\n        return (LRESULT) 1;\n    }\n\n    return CallNextHookEx(NULL, nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::MouseProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    if (nCode < 0) {\n        return CallNextHookEx(NULL, nCode, wParam, lParam);\n    }\n\n    return CallNextHookEx(NULL, nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::LowLevelMouseProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    return KeyGrabber::instance->MouseProc(nCode, wParam, lParam);\n}\n\nLRESULT CALLBACK\nKeyGrabber::LowLevelKeyboardProc(int nCode, WPARAM wParam, LPARAM lParam) {\n    return KeyGrabber::instance->KeyProc(nCode, wParam, lParam);\n}<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: eeobj.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: mt $ $Date: 2002-01-16 10:40: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\n#include <eeng_pch.hxx>\n\n#pragma hdrstop\n\n#include <eeobj.hxx>\n#include <sot\/exchange.hxx>\n#include <sot\/formats.hxx>\n#include <editeng.hxx>\n#include <svtools\/itempool.hxx>\n#include <vos\/mutex.hxx>\n#include <vcl\/svapp.hxx>\nusing namespace ::com::sun::star;\n\n\nEditDataObject::EditDataObject()\n{\n}\n\nEditDataObject::~EditDataObject()\n{\n}\n\n\/\/ uno::XInterface\nuno::Any EditDataObject::queryInterface( const uno::Type & rType ) throw(uno::RuntimeException)\n{\n    uno::Any aRet = ::cppu::queryInterface( rType, SAL_STATIC_CAST( datatransfer::XTransferable*, this ) );\n    return (aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType ));\n}\n\n\/\/ datatransfer::XTransferable\nuno::Any EditDataObject::getTransferData( const datatransfer::DataFlavor& rFlavor ) throw(datatransfer::UnsupportedFlavorException, io::IOException, uno::RuntimeException)\n{\n    uno::Any aAny;\n\n    ULONG nT = SotExchange::GetFormat( rFlavor );\n    if ( nT == SOT_FORMAT_STRING )\n    {\n        aAny <<= (::rtl::OUString)GetString();\n    }\n    else if ( ( nT == SOT_FORMATSTR_ID_EDITENGINE ) || ( nT == SOT_FORMAT_RTF ) )\n    {\n        \/\/ MT 01\/2002: No RTF on demand any more:\n        \/\/ 1) Was not working, because I had to flush() the clipboard immediately anyway\n        \/\/ 2) Don't have the old pool defaults and the StyleSheetPool here.\n\n        SvMemoryStream* pStream = ( nT == SOT_FORMATSTR_ID_EDITENGINE ) ? &GetStream() : &GetRTFStream();\n        pStream->Seek( STREAM_SEEK_TO_END );\n        ULONG nLen = pStream->Tell();\n        pStream->Seek(0);\n\n        uno::Sequence< sal_Int8 > aSeq( nLen );\n        memcpy( aSeq.getArray(), pStream->GetData(), nLen );\n        aAny <<= aSeq;\n    }\n    else\n    {\n        datatransfer::UnsupportedFlavorException aException;\n        throw( aException );\n    }\n\n    return aAny;\n}\n\nuno::Sequence< datatransfer::DataFlavor > EditDataObject::getTransferDataFlavors(  ) throw(uno::RuntimeException)\n{\n    uno::Sequence< datatransfer::DataFlavor > aDataFlavors(3);\n    SotExchange::GetFormatDataFlavor( SOT_FORMATSTR_ID_EDITENGINE, aDataFlavors.getArray()[0] );\n    SotExchange::GetFormatDataFlavor( SOT_FORMAT_STRING, aDataFlavors.getArray()[1] );\n    SotExchange::GetFormatDataFlavor( SOT_FORMAT_RTF, aDataFlavors.getArray()[2] );\n\n    return aDataFlavors;\n}\n\nsal_Bool EditDataObject::isDataFlavorSupported( const datatransfer::DataFlavor& rFlavor ) throw(uno::RuntimeException)\n{\n    sal_Bool bSupported = sal_False;\n\n    ULONG nT = SotExchange::GetFormat( rFlavor );\n    if ( ( nT == SOT_FORMAT_STRING ) || ( nT == SOT_FORMAT_RTF ) \/* || ( nT == SOT_FORMAT_XML ) *\/ || ( nT == SOT_FORMATSTR_ID_EDITENGINE ) )\n        bSupported = sal_True;\n\n    return bSupported;\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.6.1638); FILE MERGED 2005\/09\/05 14:23:56 rt 1.6.1638.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: eeobj.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 22:31: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\n#include <eeng_pch.hxx>\n\n#pragma hdrstop\n\n#include <eeobj.hxx>\n#include <sot\/exchange.hxx>\n#include <sot\/formats.hxx>\n#include <editeng.hxx>\n#include <svtools\/itempool.hxx>\n#include <vos\/mutex.hxx>\n#include <vcl\/svapp.hxx>\nusing namespace ::com::sun::star;\n\n\nEditDataObject::EditDataObject()\n{\n}\n\nEditDataObject::~EditDataObject()\n{\n}\n\n\/\/ uno::XInterface\nuno::Any EditDataObject::queryInterface( const uno::Type & rType ) throw(uno::RuntimeException)\n{\n    uno::Any aRet = ::cppu::queryInterface( rType, SAL_STATIC_CAST( datatransfer::XTransferable*, this ) );\n    return (aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType ));\n}\n\n\/\/ datatransfer::XTransferable\nuno::Any EditDataObject::getTransferData( const datatransfer::DataFlavor& rFlavor ) throw(datatransfer::UnsupportedFlavorException, io::IOException, uno::RuntimeException)\n{\n    uno::Any aAny;\n\n    ULONG nT = SotExchange::GetFormat( rFlavor );\n    if ( nT == SOT_FORMAT_STRING )\n    {\n        aAny <<= (::rtl::OUString)GetString();\n    }\n    else if ( ( nT == SOT_FORMATSTR_ID_EDITENGINE ) || ( nT == SOT_FORMAT_RTF ) )\n    {\n        \/\/ MT 01\/2002: No RTF on demand any more:\n        \/\/ 1) Was not working, because I had to flush() the clipboard immediately anyway\n        \/\/ 2) Don't have the old pool defaults and the StyleSheetPool here.\n\n        SvMemoryStream* pStream = ( nT == SOT_FORMATSTR_ID_EDITENGINE ) ? &GetStream() : &GetRTFStream();\n        pStream->Seek( STREAM_SEEK_TO_END );\n        ULONG nLen = pStream->Tell();\n        pStream->Seek(0);\n\n        uno::Sequence< sal_Int8 > aSeq( nLen );\n        memcpy( aSeq.getArray(), pStream->GetData(), nLen );\n        aAny <<= aSeq;\n    }\n    else\n    {\n        datatransfer::UnsupportedFlavorException aException;\n        throw( aException );\n    }\n\n    return aAny;\n}\n\nuno::Sequence< datatransfer::DataFlavor > EditDataObject::getTransferDataFlavors(  ) throw(uno::RuntimeException)\n{\n    uno::Sequence< datatransfer::DataFlavor > aDataFlavors(3);\n    SotExchange::GetFormatDataFlavor( SOT_FORMATSTR_ID_EDITENGINE, aDataFlavors.getArray()[0] );\n    SotExchange::GetFormatDataFlavor( SOT_FORMAT_STRING, aDataFlavors.getArray()[1] );\n    SotExchange::GetFormatDataFlavor( SOT_FORMAT_RTF, aDataFlavors.getArray()[2] );\n\n    return aDataFlavors;\n}\n\nsal_Bool EditDataObject::isDataFlavorSupported( const datatransfer::DataFlavor& rFlavor ) throw(uno::RuntimeException)\n{\n    sal_Bool bSupported = sal_False;\n\n    ULONG nT = SotExchange::GetFormat( rFlavor );\n    if ( ( nT == SOT_FORMAT_STRING ) || ( nT == SOT_FORMAT_RTF ) \/* || ( nT == SOT_FORMAT_XML ) *\/ || ( nT == SOT_FORMATSTR_ID_EDITENGINE ) )\n        bSupported = sal_True;\n\n    return bSupported;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: gengal.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 05:17: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_svx.hxx\"\n\n#include <stdio.h>\n#include <unistd.h>\n\n#include <list>\n\n#include <unotools\/streamwrap.hxx>\n#include <unotools\/ucbstreamhelper.hxx>\n\n#include <comphelper\/processfactory.hxx>\n#include <comphelper\/regpathhelper.hxx>\n#include <cppuhelper\/servicefactory.hxx>\n#include <cppuhelper\/bootstrap.hxx>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/registry\/XSimpleRegistry.hpp>\n\n#include <ucbhelper\/contentbroker.hxx>\n#include <ucbhelper\/configurationkeys.hxx>\n\n#include <tools\/urlobj.hxx>\n#include <tools\/fsys.hxx>\n#include <svtools\/filedlg.hxx>\n\n#include <vcl\/window.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/font.hxx>\n#include <vcl\/sound.hxx>\n#include <vcl\/print.hxx>\n#include <vcl\/toolbox.hxx>\n#include <vcl\/help.hxx>\n#include <vcl\/scrbar.hxx>\n#include <vcl\/wrkwin.hxx>\n#include <vcl\/msgbox.hxx>\n\n#include <osl\/file.hxx>\n#include <osl\/process.h>\n#include <rtl\/bootstrap.hxx>\n\n#include <galtheme.hxx>\n#include <gallery1.hxx>\n\nusing namespace ::vos;\nusing namespace ::rtl;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::registry;\nusing namespace ::com::sun::star::lang;\n\ntypedef ::std::list<rtl::OUString> FileNameList;\n\nclass GalApp : public Application\n{\npublic:\n    virtual void Main();\n};\n\nReference< XMultiServiceFactory > createApplicationServiceManager()\n{\n    Reference< XMultiServiceFactory > xMS;\n    try\n    {\n        Reference< XComponentContext > xComponentContext = ::cppu::defaultBootstrap_InitialComponentContext();\n        if ( xComponentContext.is() )\n            xMS = xMS.query( xComponentContext->getServiceManager() );\n    }\n    catch( ::com::sun::star::uno::Exception& )\n    {\n    }\n\n    return xMS;\n}\n\nstatic void createTheme( rtl::OUString aThemeName,\n                         rtl::OUString aGalleryURL,\n                         rtl::OUString aDestDir,\n                         UINT32 nNumFrom,\n                         FileNameList &rFiles )\n{\n    Gallery* pGallery;\n\n    pGallery = Gallery::AcquireGallery( aGalleryURL );\n    if (!pGallery ) {\n            fprintf( stderr, \"Could't acquire '%s'\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( aGalleryURL,\n                                                                RTL_TEXTENCODING_UTF8 ) );\n            exit( 1 );\n    }\n    fprintf( stderr, \"Work on gallery '%s'\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( aGalleryURL, RTL_TEXTENCODING_UTF8 ) );\n\n    fprintf( stderr, \"Existing themes: %d\\n\",\n             pGallery->GetThemeCount() );\n\n    GalleryTheme *pGalTheme;\n    if( !pGallery->HasTheme( aThemeName) ) {\n            if( !pGallery->CreateTheme( aThemeName, nNumFrom ) ) {\n                    fprintf( stderr, \"Failed to create theme\\n\" );\n                    exit( 1 );\n            }\n    }\n\n    fprintf( stderr, \"Existing themes: %d\\n\",\n             pGallery->GetThemeCount() );\n\n    SfxListener aListener;\n\n    if ( !( pGalTheme = pGallery->AcquireTheme( aThemeName, aListener ) ) ) {\n            fprintf( stderr, \"Failed to acquire theme\\n\" );\n            exit( 1 );\n    }\n\n    fprintf( stderr, \"Using DestDir: %s\\n\",\n             (const sal_Char *) rtl::OUStringToOString( aDestDir, RTL_TEXTENCODING_UTF8 ) );\n    pGalTheme->SetDestDir(String(aDestDir));\n\n    FileNameList::const_iterator aIter;\n\n    for( aIter = rFiles.begin(); aIter != rFiles.end(); aIter++ )\n    {\n\/\/  Should\/could use:\n\/\/  if ( ! pGalTheme->InsertFileOrDirURL( aURL ) ) {\n\/\/  Requires a load more components ...\n\n        Graphic aGraphic;\n        String aFormat;\n\n#if 1\n        if ( ! pGalTheme->InsertURL( *aIter ) )\n            fprintf( stderr, \"Failed to import '%s'\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( *aIter, RTL_TEXTENCODING_UTF8 ) );\n        else\n            fprintf( stderr, \"Imported file '%s' (%d)\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( *aIter, RTL_TEXTENCODING_UTF8 ),\n                     pGalTheme->GetObjectCount() );\n\n#else \/\/ only loads BMPs\n        SvStream *pStream = ::utl::UcbStreamHelper::CreateStream( *aIter, STREAM_READ );\n        if (!pStream) {\n            fprintf( stderr, \"Can't find image to import\\n\" );\n            exit (1);\n        }\n        *pStream >> aGraphic;\n        delete pStream;\n        if( aGraphic.GetType() == GRAPHIC_NONE )\n        {\n            fprintf( stderr, \"Failed to load '%s'\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( *aIter, RTL_TEXTENCODING_UTF8 ) );\n            continue;\n        }\n\n        SgaObjectBmp aObject( aGraphic, *aIter, aFormat );\n        if ( ! aObject.IsValid() ) {\n            fprintf( stderr, \"Failed to create thumbnail for image\\n\" );\n            continue;\n        }\n\n        if ( ! pGalTheme->InsertObject( aObject ) ) {\n            fprintf( stderr, \"Failed to insert file or URL\\n\" );\n            continue;\n        }\n#endif\n    }\n\n    pGallery->ReleaseTheme( pGalTheme, aListener );\n\n    Gallery::ReleaseGallery( pGallery );\n}\n\nstatic void PrintHelp()\n{\n    fprintf( stdout, \"Utility to generate OO.o gallery files\\n\\n\" );\n\n    fprintf( stdout, \"using: gengal --name <name> --path <dir> [ --destdir <path> ]\\n\");\n    fprintf( stdout, \"              [ --number-from <num> ] [ files ... ]\\n\\n\" );\n\n    fprintf( stdout, \"options:\\n\");\n    fprintf( stdout, \" --name <theme>\\t\\tdefines a name of the created or updated theme.\\n\");\n    fprintf( stdout, \" --path <dir>\\t\\tdefines directory where the gallery files are created\\n\");\n    fprintf( stdout, \"\\t\\t\\tor updated.\\n\");\n    fprintf( stdout, \" --destdir <dir>\\tdefines a path prefix to be removed from the paths\\n\");\n    fprintf( stdout, \"\\t\\t\\tstored in the gallery files. It is useful to create\\n\");\n    fprintf( stdout, \"\\t\\t\\tRPM packages using the BuildRoot feature.\\n\");\n    fprintf( stdout, \" --number-from <num>\\tdefines minimal number for the newly created gallery\\n\");\n    fprintf( stdout, \"\\t\\t\\ttheme files.\\n\");\n    fprintf( stdout, \" files\\t\\t\\tlists files to be added to the gallery. Absolute paths\\n\");\n    fprintf( stdout, \"\\t\\t\\tare required.\\n\");\n}\n\nstatic OUString Smartify( const OUString &rPath )\n{\n    INetURLObject aURL;\n    aURL.SetSmartURL( rPath );\n    return aURL.GetMainURL( INetURLObject::NO_DECODE );\n}\n\n\/\/ Cut\/paste [ evilness ] from Desktop::CreateApplicationServiceManager()\nReference< XMultiServiceFactory > CreateApplicationServiceManager()\n{\n    try\n    {\n        Reference<XComponentContext> xComponentContext = ::cppu::defaultBootstrap_InitialComponentContext();\n        Reference<XMultiServiceFactory> xMS(xComponentContext->getServiceManager(), UNO_QUERY);\n\n        return xMS;\n    }\n    catch( ::com::sun::star::uno::Exception& )\n    {\n    }\n\n    return Reference< XMultiServiceFactory >();\n}\n\nvoid GalApp::Main()\n{\n    Reference<XComponentContext> xComponentContext = ::cppu::defaultBootstrap_InitialComponentContext();\n    Reference<XMultiServiceFactory> xMSF(xComponentContext->getServiceManager(), UNO_QUERY);\n    if( !xMSF.is() )\n        fprintf( stderr, \"Failed to bootstrap\\n\" );\n    ::comphelper::setProcessServiceFactory( xMSF );\n\n    OUString aEmpty;\n    Sequence< Any > aArgs(6);\n    aArgs[0]\n        <<= rtl::OUString::createFromAscii(UCB_CONFIGURATION_KEY1_LOCAL);\n    aArgs[1]\n        <<= rtl::OUString::createFromAscii(UCB_CONFIGURATION_KEY2_OFFICE);\n    aArgs[2] <<= rtl::OUString::createFromAscii(\"PIPE\");\n    aArgs[3] <<= aEmpty;\n    aArgs[4] <<= rtl::OUString::createFromAscii(\"PORTAL\");\n    aArgs[5] <<= aEmpty;\n\n    if (! ::ucb::ContentBroker::initialize( xMSF, aArgs ) )\n        fprintf( stderr, \"Failed to init content broker\\n\" );\n\n    bool bHelp = false;\n    rtl::OUString aPath, aDestDir;\n    rtl::OUString aName = rtl::OUString::createFromAscii( \"Default name\" );\n    UINT32 nNumFrom = 0;\n    FileNameList aFiles;\n\n    for( USHORT i = 0; i < GetCommandLineParamCount(); i++ )\n    {\n        OUString aParam = GetCommandLineParam( i );\n\n        if( aParam.equalsAscii( \"--help\" ) ||\n            aParam.equalsAscii( \"-h\" ) )\n                bHelp = true;\n\n        else if ( aParam.equalsAscii( \"--name\" ) )\n            aName = GetCommandLineParam( ++i );\n\n        else if ( aParam.equalsAscii( \"--path\" ) )\n            aPath = Smartify( GetCommandLineParam( ++i ) );\n\n        else if ( aParam.equalsAscii( \"--destdir\" ) )\n            aDestDir = GetCommandLineParam( ++i );\n\n        else if ( aParam.equalsAscii( \"--number-from\" ) )\n             nNumFrom = GetCommandLineParam( ++i ).ToInt32();\n\n        else\n            aFiles.push_back( Smartify( aParam ) );\n    }\n\n    if( bHelp )\n    {\n        PrintHelp();\n        return;\n    }\n\n    createTheme( aName, aPath, aDestDir, nNumFrom, aFiles );\n}\n\nGalApp aGalApp;\n<commit_msg>INTEGRATION: CWS sb59 (1.5.80); FILE MERGED 2006\/08\/30 12:20:09 sb 1.5.80.2: #i67535# Made code warning-free (GCC 4.1.1). 2006\/08\/28 12:57:55 sb 1.5.80.1: #i67487# Made code warning-free (wntmsci10).<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: gengal.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2006-10-12 12:49:52 $\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_svx.hxx\"\n\n#include <stdio.h>\n#include <unistd.h>\n\n#include <list>\n\n#include <unotools\/streamwrap.hxx>\n#include <unotools\/ucbstreamhelper.hxx>\n\n#include <comphelper\/processfactory.hxx>\n#include <comphelper\/regpathhelper.hxx>\n#include <cppuhelper\/servicefactory.hxx>\n#include <cppuhelper\/bootstrap.hxx>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/registry\/XSimpleRegistry.hpp>\n\n#include <ucbhelper\/contentbroker.hxx>\n#include <ucbhelper\/configurationkeys.hxx>\n\n#include <tools\/urlobj.hxx>\n#include <tools\/fsys.hxx>\n#include <svtools\/filedlg.hxx>\n\n#include <vcl\/window.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/font.hxx>\n#include <vcl\/sound.hxx>\n#include <vcl\/print.hxx>\n#include <vcl\/toolbox.hxx>\n#include <vcl\/help.hxx>\n#include <vcl\/scrbar.hxx>\n#include <vcl\/wrkwin.hxx>\n#include <vcl\/msgbox.hxx>\n\n#include <osl\/file.hxx>\n#include <osl\/process.h>\n#include <rtl\/bootstrap.hxx>\n\n#include <galtheme.hxx>\n#include <gallery1.hxx>\n\nusing namespace ::vos;\nusing namespace ::rtl;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::registry;\nusing namespace ::com::sun::star::lang;\n\ntypedef ::std::list<rtl::OUString> FileNameList;\n\nclass GalApp : public Application\n{\npublic:\n    virtual void Main();\n};\n\nReference< XMultiServiceFactory > createApplicationServiceManager()\n{\n    Reference< XMultiServiceFactory > xMS;\n    try\n    {\n        Reference< XComponentContext > xComponentContext = ::cppu::defaultBootstrap_InitialComponentContext();\n        if ( xComponentContext.is() )\n            xMS = xMS.query( xComponentContext->getServiceManager() );\n    }\n    catch( ::com::sun::star::uno::Exception& )\n    {\n    }\n\n    return xMS;\n}\n\nstatic void createTheme( rtl::OUString aThemeName,\n                         rtl::OUString aGalleryURL,\n                         rtl::OUString aDestDir,\n                         UINT32 nNumFrom,\n                         FileNameList &rFiles )\n{\n    Gallery* pGallery;\n\n    pGallery = Gallery::AcquireGallery( aGalleryURL );\n    if (!pGallery ) {\n            fprintf( stderr, \"Could't acquire '%s'\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( aGalleryURL,\n                                                                RTL_TEXTENCODING_UTF8 ) );\n            exit( 1 );\n    }\n    fprintf( stderr, \"Work on gallery '%s'\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( aGalleryURL, RTL_TEXTENCODING_UTF8 ) );\n\n    fprintf( stderr, \"Existing themes: %lu\\n\",\n             sal::static_int_cast< unsigned long >(\n                 pGallery->GetThemeCount() ) );\n\n    if( !pGallery->HasTheme( aThemeName) ) {\n            if( !pGallery->CreateTheme( aThemeName, nNumFrom ) ) {\n                    fprintf( stderr, \"Failed to create theme\\n\" );\n                    exit( 1 );\n            }\n    }\n\n    fprintf( stderr, \"Existing themes: %lu\\n\",\n             sal::static_int_cast< unsigned long >(\n                 pGallery->GetThemeCount() ) );\n\n    SfxListener aListener;\n\n    GalleryTheme *pGalTheme = pGallery->AcquireTheme( aThemeName, aListener );\n    if ( pGalTheme == NULL  ) {\n            fprintf( stderr, \"Failed to acquire theme\\n\" );\n            exit( 1 );\n    }\n\n    fprintf( stderr, \"Using DestDir: %s\\n\",\n             (const sal_Char *) rtl::OUStringToOString( aDestDir, RTL_TEXTENCODING_UTF8 ) );\n    pGalTheme->SetDestDir(String(aDestDir));\n\n    FileNameList::const_iterator aIter;\n\n    for( aIter = rFiles.begin(); aIter != rFiles.end(); aIter++ )\n    {\n\/\/  Should\/could use:\n\/\/  if ( ! pGalTheme->InsertFileOrDirURL( aURL ) ) {\n\/\/  Requires a load more components ...\n\n        Graphic aGraphic;\n        String aFormat;\n\n#if 1\n        if ( ! pGalTheme->InsertURL( *aIter ) )\n            fprintf( stderr, \"Failed to import '%s'\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( *aIter, RTL_TEXTENCODING_UTF8 ) );\n        else\n            fprintf( stderr, \"Imported file '%s' (%lu)\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( *aIter, RTL_TEXTENCODING_UTF8 ),\n                     sal::static_int_cast< unsigned long >(\n                         pGalTheme->GetObjectCount() ) );\n\n#else \/\/ only loads BMPs\n        SvStream *pStream = ::utl::UcbStreamHelper::CreateStream( *aIter, STREAM_READ );\n        if (!pStream) {\n            fprintf( stderr, \"Can't find image to import\\n\" );\n            exit (1);\n        }\n        *pStream >> aGraphic;\n        delete pStream;\n        if( aGraphic.GetType() == GRAPHIC_NONE )\n        {\n            fprintf( stderr, \"Failed to load '%s'\\n\",\n                     (const sal_Char *) rtl::OUStringToOString( *aIter, RTL_TEXTENCODING_UTF8 ) );\n            continue;\n        }\n\n        SgaObjectBmp aObject( aGraphic, *aIter, aFormat );\n        if ( ! aObject.IsValid() ) {\n            fprintf( stderr, \"Failed to create thumbnail for image\\n\" );\n            continue;\n        }\n\n        if ( ! pGalTheme->InsertObject( aObject ) ) {\n            fprintf( stderr, \"Failed to insert file or URL\\n\" );\n            continue;\n        }\n#endif\n    }\n\n    pGallery->ReleaseTheme( pGalTheme, aListener );\n\n    Gallery::ReleaseGallery( pGallery );\n}\n\nstatic void PrintHelp()\n{\n    fprintf( stdout, \"Utility to generate OO.o gallery files\\n\\n\" );\n\n    fprintf( stdout, \"using: gengal --name <name> --path <dir> [ --destdir <path> ]\\n\");\n    fprintf( stdout, \"              [ --number-from <num> ] [ files ... ]\\n\\n\" );\n\n    fprintf( stdout, \"options:\\n\");\n    fprintf( stdout, \" --name <theme>\\t\\tdefines a name of the created or updated theme.\\n\");\n    fprintf( stdout, \" --path <dir>\\t\\tdefines directory where the gallery files are created\\n\");\n    fprintf( stdout, \"\\t\\t\\tor updated.\\n\");\n    fprintf( stdout, \" --destdir <dir>\\tdefines a path prefix to be removed from the paths\\n\");\n    fprintf( stdout, \"\\t\\t\\tstored in the gallery files. It is useful to create\\n\");\n    fprintf( stdout, \"\\t\\t\\tRPM packages using the BuildRoot feature.\\n\");\n    fprintf( stdout, \" --number-from <num>\\tdefines minimal number for the newly created gallery\\n\");\n    fprintf( stdout, \"\\t\\t\\ttheme files.\\n\");\n    fprintf( stdout, \" files\\t\\t\\tlists files to be added to the gallery. Absolute paths\\n\");\n    fprintf( stdout, \"\\t\\t\\tare required.\\n\");\n}\n\nstatic OUString Smartify( const OUString &rPath )\n{\n    INetURLObject aURL;\n    aURL.SetSmartURL( rPath );\n    return aURL.GetMainURL( INetURLObject::NO_DECODE );\n}\n\n\/\/ Cut\/paste [ evilness ] from Desktop::CreateApplicationServiceManager()\nReference< XMultiServiceFactory > CreateApplicationServiceManager()\n{\n    try\n    {\n        Reference<XComponentContext> xComponentContext = ::cppu::defaultBootstrap_InitialComponentContext();\n        Reference<XMultiServiceFactory> xMS(xComponentContext->getServiceManager(), UNO_QUERY);\n\n        return xMS;\n    }\n    catch( ::com::sun::star::uno::Exception& )\n    {\n    }\n\n    return Reference< XMultiServiceFactory >();\n}\n\nvoid GalApp::Main()\n{\n    Reference<XComponentContext> xComponentContext = ::cppu::defaultBootstrap_InitialComponentContext();\n    Reference<XMultiServiceFactory> xMSF(xComponentContext->getServiceManager(), UNO_QUERY);\n    if( !xMSF.is() )\n        fprintf( stderr, \"Failed to bootstrap\\n\" );\n    ::comphelper::setProcessServiceFactory( xMSF );\n\n    OUString aEmpty;\n    Sequence< Any > aArgs(6);\n    aArgs[0]\n        <<= rtl::OUString::createFromAscii(UCB_CONFIGURATION_KEY1_LOCAL);\n    aArgs[1]\n        <<= rtl::OUString::createFromAscii(UCB_CONFIGURATION_KEY2_OFFICE);\n    aArgs[2] <<= rtl::OUString::createFromAscii(\"PIPE\");\n    aArgs[3] <<= aEmpty;\n    aArgs[4] <<= rtl::OUString::createFromAscii(\"PORTAL\");\n    aArgs[5] <<= aEmpty;\n\n    if (! ::ucb::ContentBroker::initialize( xMSF, aArgs ) )\n        fprintf( stderr, \"Failed to init content broker\\n\" );\n\n    bool bHelp = false;\n    rtl::OUString aPath, aDestDir;\n    rtl::OUString aName = rtl::OUString::createFromAscii( \"Default name\" );\n    UINT32 nNumFrom = 0;\n    FileNameList aFiles;\n\n    for( USHORT i = 0; i < GetCommandLineParamCount(); i++ )\n    {\n        OUString aParam = GetCommandLineParam( i );\n\n        if( aParam.equalsAscii( \"--help\" ) ||\n            aParam.equalsAscii( \"-h\" ) )\n                bHelp = true;\n\n        else if ( aParam.equalsAscii( \"--name\" ) )\n            aName = GetCommandLineParam( ++i );\n\n        else if ( aParam.equalsAscii( \"--path\" ) )\n            aPath = Smartify( GetCommandLineParam( ++i ) );\n\n        else if ( aParam.equalsAscii( \"--destdir\" ) )\n            aDestDir = GetCommandLineParam( ++i );\n\n        else if ( aParam.equalsAscii( \"--number-from\" ) )\n             nNumFrom = GetCommandLineParam( ++i ).ToInt32();\n\n        else\n            aFiles.push_back( Smartify( aParam ) );\n    }\n\n    if( bHelp )\n    {\n        PrintHelp();\n        return;\n    }\n\n    createTheme( aName, aPath, aDestDir, nNumFrom, aFiles );\n}\n\nGalApp aGalApp;\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: content.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2006-08-14 17:39:30 $\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 _CONTENT_HXX\n#define _CONTENT_HXX\n#include <limits.h>     \/\/ USHRT_MAX\n#ifndef _SWCONT_HXX\n#include \"swcont.hxx\"\n#endif\n\n#ifndef _MENU_HXX \/\/autogen\n#include <vcl\/menu.hxx>\n#endif\n\nclass SwWrtShell;\nclass SwContentArr;\nclass SwContentType;\nclass SwFmtFld;\nclass SwTxtINetFmt;\nclass SwTOXBase;\n\n\/\/----------------------------------------------------------------------------\n\/\/  Hilfsklassen\n\/\/----------------------------------------------------------------------------\n\nclass SwPopup : public PopupMenu\n{\n    USHORT          nCurId;\n    virtual void    Select(){nCurId = GetCurItemId();}\n\npublic:\n    SwPopup() :\n        PopupMenu(),\n        nCurId(USHRT_MAX){}\n\n    USHORT          GetCurId() const { return nCurId; }\n\n};\n\n\/\/----------------------------------------------------------------------------\n\nclass SwOutlineContent : public SwContent\n{\n    USHORT  nOutlinePos;\n    BYTE    nOutlineLevel;\n    BOOL    bIsMoveable;\n    public:\n        SwOutlineContent(   const SwContentType* pCnt,\n                            const String& rName,\n                            USHORT nArrPos,\n                            BYTE nLevel,\n                            BOOL bMove,\n                            long nYPos) :\n            SwContent(pCnt, rName, nYPos), nOutlineLevel(nLevel),\n                        nOutlinePos(nArrPos), bIsMoveable(bMove){}\n\n    USHORT  GetPos(){return nOutlinePos;}\n    BYTE    GetOutlineLevel(){return nOutlineLevel;}\n    BOOL    IsMoveable(){return bIsMoveable;};\n};\n\n\/\/----------------------------------------------------------------------------\nclass SwRegionContent : public SwContent\n{\n\n    BYTE    nRegionLevel;\n\n    public:\n        SwRegionContent(    const SwContentType* pCnt,\n                            const String& rName,\n                            BYTE nLevel,\n                            long nYPos) :\n            SwContent(pCnt, rName, nYPos),\n                        nRegionLevel(nLevel){}\n    BYTE    GetRegionLevel() const {return nRegionLevel;}\n};\n\/\/----------------------------------------------------------------------------\n\nclass SwURLFieldContent : public SwContent\n{\n    const SwTxtINetFmt* pINetAttr;\n    String sURL;\n\npublic:\n    SwURLFieldContent(  const SwContentType* pCnt,\n                            const String& rName,\n                            const String& rURL,\n                            const SwTxtINetFmt* pAttr,\n                            long nYPos )\n        : SwContent( pCnt, rName, nYPos ), sURL( rURL ), pINetAttr( pAttr )\n    {}\n\n    virtual BOOL    IsProtect() const;\n    const String&   GetURL()                { return sURL; }\n    const SwTxtINetFmt* GetINetAttr()       { return pINetAttr; }\n};\n\n\/\/----------------------------------------------------------------------------\n\nclass SwPostItContent : public SwContent\n{\n    const SwFmtFld*     pFld;\npublic:\n    SwPostItContent( const SwContentType* pCnt,\n                            const String& rName,\n                            const SwFmtFld* pField,\n                            long nYPos )\n        : SwContent( pCnt, rName, nYPos ), pFld( pField )\n    {}\n\n    const SwFmtFld* GetPostIt()     { return pFld; }\n    virtual BOOL    IsProtect() const;\n};\n\n\/\/----------------------------------------------------------------------------\n\nclass SwGraphicContent : public SwContent\n{\n    String      sLink;\npublic:\n    SwGraphicContent(const SwContentType* pCnt, const String& rName, const String& rLink, long nYPos)\n        : SwContent( pCnt, rName, nYPos ), sLink( rLink )\n        {}\n    virtual ~SwGraphicContent();\n\n    const String&   GetLink() const {return sLink;}\n};\n\n\/\/----------------------------------------------------------------------------\nclass SwTOXBaseContent : public SwContent\n{\n    const SwTOXBase* pBase;\npublic:\n    SwTOXBaseContent(const SwContentType* pCnt, const String& rName, long nYPos, const SwTOXBase& rBase)\n        : SwContent( pCnt, rName, nYPos ), pBase(&rBase)\n        {}\n    virtual ~SwTOXBaseContent();\n\n    const SwTOXBase* GetTOXBase() const {return pBase;}\n};\n\/*\n    class ContentType enthaelt Informationen zu einer Inhaltsform\n    Das MemberArray wird nur gefuellt, wenn der Inhalt mit GetMember\n    angefordert wird. Es wird nach Invalidate() nur dann neu geladen,\n    wenn der Inhalt erneut ausgelesen werden soll.\n*\/\n\/\/----------------------------------------------------------------------------\n\/\/----------------------------------------------------------------------------\n\nclass SwContentType : public SwTypeNumber\n{\n    SwWrtShell*         pWrtShell;\n    SwContentArr*       pMember;            \/\/ Array fuer Inhalte\n    String              sContentTypeName;   \/\/ Name der Inhaltsform\n    String              sSingleContentTypeName; \/\/ Name der Inhaltsform, Singular\n    String              sTypeToken;         \/\/ Anhaengsel fuer URL\n    USHORT              nMemberCount;       \/\/ Inhaltsanzahl\n    USHORT              nContentType;       \/\/ Id der Inhaltsform\n    BYTE                nOutlineLevel;\n    BOOL                bMemberFilled : 1;  \/\/ wurden die Inhalte bereits eingefuegt?\n    BOOL                bIsInternalDrag:1;  \/\/ koennen die Inhalte verschoben werden?\n    BOOL                bDataValid :    1;  \/\/\n    BOOL                bEdit:          1;  \/\/ kann diese Type bearbeitet werden ?\n    BOOL                bDelete:        1;  \/\/ kann diese Type geloescht werden ?\nprotected:\n        void            RemoveNewline(String&);\npublic:\n        SwContentType(SwWrtShell* pParent, USHORT nType, BYTE nLevel );\n        ~SwContentType();\n\n        void                Init(BOOL* pbInvalidateWindow = 0);\n        void                FillMemberList(BOOL* pbLevelChanged = NULL);\n        USHORT              GetMemberCount() const\n                                {return nMemberCount;};\n        USHORT              GetType() const {return nContentType;}\n        const SwContent*    GetMember(USHORT nIndex);\n        const String&       GetName() {return sContentTypeName;}\n        const String&       GetSingleName() const {return sSingleContentTypeName;}\n        const String&       GetTypeToken() const{return sTypeToken;}\n\n        void                SetOutlineLevel(BYTE nNew)\n                            {\n                                nOutlineLevel = nNew;\n                                Invalidate();\n                            }\n\n        void                Invalidate(); \/\/ nur nMemberCount wird neu gelesen\n\n        BOOL                IsEditable() const {return bEdit;}\n        BOOL                IsDeletable() const {return bDelete;}\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS swwarnings (1.3.242); FILE MERGED 2007\/02\/27 13:07:08 tl 1.3.242.1: #i69287# warning-free code<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: content.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-27 11:56: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 _CONTENT_HXX\n#define _CONTENT_HXX\n#include <limits.h>     \/\/ USHRT_MAX\n#ifndef _SWCONT_HXX\n#include \"swcont.hxx\"\n#endif\n\n#ifndef _MENU_HXX \/\/autogen\n#include <vcl\/menu.hxx>\n#endif\n\nclass SwWrtShell;\nclass SwContentArr;\nclass SwContentType;\nclass SwFmtFld;\nclass SwTxtINetFmt;\nclass SwTOXBase;\n\n\/\/----------------------------------------------------------------------------\n\/\/  Hilfsklassen\n\/\/----------------------------------------------------------------------------\n\nclass SwPopup : public PopupMenu\n{\n    USHORT          nCurId;\n    virtual void    Select(){nCurId = GetCurItemId();}\n\npublic:\n    SwPopup() :\n        PopupMenu(),\n        nCurId(USHRT_MAX){}\n\n    USHORT          GetCurId() const { return nCurId; }\n\n};\n\n\/\/----------------------------------------------------------------------------\n\nclass SwOutlineContent : public SwContent\n{\n    USHORT  nOutlinePos;\n    BYTE    nOutlineLevel;\n    BOOL    bIsMoveable;\n    public:\n        SwOutlineContent(   const SwContentType* pCnt,\n                            const String& rName,\n                            USHORT nArrPos,\n                            BYTE nLevel,\n                            BOOL bMove,\n                            long nYPos) :\n            SwContent(pCnt, rName, nYPos),\n            nOutlinePos(nArrPos), nOutlineLevel(nLevel), bIsMoveable(bMove) {}\n\n    USHORT  GetPos(){return nOutlinePos;}\n    BYTE    GetOutlineLevel(){return nOutlineLevel;}\n    BOOL    IsMoveable(){return bIsMoveable;};\n};\n\n\/\/----------------------------------------------------------------------------\nclass SwRegionContent : public SwContent\n{\n\n    BYTE    nRegionLevel;\n\n    public:\n        SwRegionContent(    const SwContentType* pCnt,\n                            const String& rName,\n                            BYTE nLevel,\n                            long nYPos) :\n            SwContent(pCnt, rName, nYPos),\n                        nRegionLevel(nLevel){}\n    BYTE    GetRegionLevel() const {return nRegionLevel;}\n};\n\/\/----------------------------------------------------------------------------\n\nclass SwURLFieldContent : public SwContent\n{\n    String sURL;\n    const SwTxtINetFmt* pINetAttr;\n\npublic:\n    SwURLFieldContent(  const SwContentType* pCnt,\n                            const String& rName,\n                            const String& rURL,\n                            const SwTxtINetFmt* pAttr,\n                            long nYPos )\n        : SwContent( pCnt, rName, nYPos ), sURL( rURL ), pINetAttr( pAttr )\n    {}\n\n    virtual BOOL    IsProtect() const;\n    const String&   GetURL()                { return sURL; }\n    const SwTxtINetFmt* GetINetAttr()       { return pINetAttr; }\n};\n\n\/\/----------------------------------------------------------------------------\n\nclass SwPostItContent : public SwContent\n{\n    const SwFmtFld*     pFld;\npublic:\n    SwPostItContent( const SwContentType* pCnt,\n                            const String& rName,\n                            const SwFmtFld* pField,\n                            long nYPos )\n        : SwContent( pCnt, rName, nYPos ), pFld( pField )\n    {}\n\n    const SwFmtFld* GetPostIt()     { return pFld; }\n    virtual BOOL    IsProtect() const;\n};\n\n\/\/----------------------------------------------------------------------------\n\nclass SwGraphicContent : public SwContent\n{\n    String      sLink;\npublic:\n    SwGraphicContent(const SwContentType* pCnt, const String& rName, const String& rLink, long nYPos)\n        : SwContent( pCnt, rName, nYPos ), sLink( rLink )\n        {}\n    virtual ~SwGraphicContent();\n\n    const String&   GetLink() const {return sLink;}\n};\n\n\/\/----------------------------------------------------------------------------\nclass SwTOXBaseContent : public SwContent\n{\n    const SwTOXBase* pBase;\npublic:\n    SwTOXBaseContent(const SwContentType* pCnt, const String& rName, long nYPos, const SwTOXBase& rBase)\n        : SwContent( pCnt, rName, nYPos ), pBase(&rBase)\n        {}\n    virtual ~SwTOXBaseContent();\n\n    const SwTOXBase* GetTOXBase() const {return pBase;}\n};\n\/*\n    class ContentType enthaelt Informationen zu einer Inhaltsform\n    Das MemberArray wird nur gefuellt, wenn der Inhalt mit GetMember\n    angefordert wird. Es wird nach Invalidate() nur dann neu geladen,\n    wenn der Inhalt erneut ausgelesen werden soll.\n*\/\n\/\/----------------------------------------------------------------------------\n\/\/----------------------------------------------------------------------------\n\nclass SwContentType : public SwTypeNumber\n{\n    SwWrtShell*         pWrtShell;\n    SwContentArr*       pMember;            \/\/ Array fuer Inhalte\n    String              sContentTypeName;   \/\/ Name der Inhaltsform\n    String              sSingleContentTypeName; \/\/ Name der Inhaltsform, Singular\n    String              sTypeToken;         \/\/ Anhaengsel fuer URL\n    USHORT              nMemberCount;       \/\/ Inhaltsanzahl\n    USHORT              nContentType;       \/\/ Id der Inhaltsform\n    BYTE                nOutlineLevel;\n    BOOL                bMemberFilled : 1;  \/\/ wurden die Inhalte bereits eingefuegt?\n    BOOL                bIsInternalDrag:1;  \/\/ koennen die Inhalte verschoben werden?\n    BOOL                bDataValid :    1;  \/\/\n    BOOL                bEdit:          1;  \/\/ kann diese Type bearbeitet werden ?\n    BOOL                bDelete:        1;  \/\/ kann diese Type geloescht werden ?\nprotected:\n        void            RemoveNewline(String&);\npublic:\n        SwContentType(SwWrtShell* pParent, USHORT nType, BYTE nLevel );\n        ~SwContentType();\n\n        void                Init(BOOL* pbInvalidateWindow = 0);\n        void                FillMemberList(BOOL* pbLevelChanged = NULL);\n        USHORT              GetMemberCount() const\n                                {return nMemberCount;};\n        USHORT              GetType() const {return nContentType;}\n        const SwContent*    GetMember(USHORT nIndex);\n        const String&       GetName() {return sContentTypeName;}\n        const String&       GetSingleName() const {return sSingleContentTypeName;}\n        const String&       GetTypeToken() const{return sTypeToken;}\n\n        void                SetOutlineLevel(BYTE nNew)\n                            {\n                                nOutlineLevel = nNew;\n                                Invalidate();\n                            }\n\n        void                Invalidate(); \/\/ nur nMemberCount wird neu gelesen\n\n        BOOL                IsEditable() const {return bEdit;}\n        BOOL                IsDeletable() const {return bDelete;}\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: numpara.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: os $ $Date: 2002-11-06 10:16: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 _NUMPARA_HXX\n#define _NUMPARA_HXX\n\n\n#ifndef _SFXTABDLG_HXX \/\/autogen\n#include <sfx2\/tabdlg.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n#ifndef _SV_FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_FIELD_HXX \/\/autogen\n#include <vcl\/field.hxx>\n#endif\n#ifndef _SV_BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n\n\n\/* --- class SwParagraphNumTabPage ----------------------------------------\n    Mit dieser TabPage werden Numerierungseinstellungen am Absatz bzw. der\n    Absatzvorlage vorgenommen.\n\n ---------------------------------------------------------------------------*\/\nclass SwParagraphNumTabPage : public SfxTabPage\n{\n    FixedText               aNumberStyleFT;\n    ListBox                 aNumberStyleLB;\n\n    FixedLine               aNewStartFL;\n    TriStateBox             aNewStartCB;\n    TriStateBox             aNewStartNumberCB;\n    NumericField            aNewStartNF;\n\n    FixedLine               aCountParaFL;\n    TriStateBox             aCountParaCB;\n    TriStateBox             aRestartParaCountCB;\n    FixedText               aRestartFT;\n    NumericField            aRestartNF;\n\n    BOOL                    bModified : 1;\n    BOOL                    bCurNumrule : 1;\n\n    DECL_LINK( NewStartHdl_Impl, CheckBox* );\n    DECL_LINK( StyleHdl_Impl, ListBox* );\n    DECL_LINK( LineCountHdl_Impl, CheckBox* );\n\nprotected:\n        SwParagraphNumTabPage(Window* pParent, const SfxItemSet& rSet );\n\npublic:\n        ~SwParagraphNumTabPage();\n\n    static SfxTabPage*  Create( Window* pParent,\n                                const SfxItemSet& rSet );\n    static USHORT*      GetRanges();\n\n    virtual BOOL        FillItemSet( SfxItemSet& rSet );\n    virtual void        Reset( const SfxItemSet& rSet );\n\n    void                EnableNewStart();\n\n    ListBox&            GetStyleBox() {return aNumberStyleLB;};\n\n};\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.1418); FILE MERGED 2005\/09\/05 13:45:29 rt 1.3.1418.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: numpara.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 09:53:42 $\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 _NUMPARA_HXX\n#define _NUMPARA_HXX\n\n\n#ifndef _SFXTABDLG_HXX \/\/autogen\n#include <sfx2\/tabdlg.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n#ifndef _SV_FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_FIELD_HXX \/\/autogen\n#include <vcl\/field.hxx>\n#endif\n#ifndef _SV_BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n\n\n\/* --- class SwParagraphNumTabPage ----------------------------------------\n    Mit dieser TabPage werden Numerierungseinstellungen am Absatz bzw. der\n    Absatzvorlage vorgenommen.\n\n ---------------------------------------------------------------------------*\/\nclass SwParagraphNumTabPage : public SfxTabPage\n{\n    FixedText               aNumberStyleFT;\n    ListBox                 aNumberStyleLB;\n\n    FixedLine               aNewStartFL;\n    TriStateBox             aNewStartCB;\n    TriStateBox             aNewStartNumberCB;\n    NumericField            aNewStartNF;\n\n    FixedLine               aCountParaFL;\n    TriStateBox             aCountParaCB;\n    TriStateBox             aRestartParaCountCB;\n    FixedText               aRestartFT;\n    NumericField            aRestartNF;\n\n    BOOL                    bModified : 1;\n    BOOL                    bCurNumrule : 1;\n\n    DECL_LINK( NewStartHdl_Impl, CheckBox* );\n    DECL_LINK( StyleHdl_Impl, ListBox* );\n    DECL_LINK( LineCountHdl_Impl, CheckBox* );\n\nprotected:\n        SwParagraphNumTabPage(Window* pParent, const SfxItemSet& rSet );\n\npublic:\n        ~SwParagraphNumTabPage();\n\n    static SfxTabPage*  Create( Window* pParent,\n                                const SfxItemSet& rSet );\n    static USHORT*      GetRanges();\n\n    virtual BOOL        FillItemSet( SfxItemSet& rSet );\n    virtual void        Reset( const SfxItemSet& rSet );\n\n    void                EnableNewStart();\n\n    ListBox&            GetStyleBox() {return aNumberStyleLB;};\n\n};\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include \"StringSorter.h\"\n#include \"StringHash.h\"\n#include <fstream>\n#include <vector>\n#include <string>\n#include <math.h>\n\nusing namespace std;\n\nvoid StringHash::print(bool isAcending){\n    vector<string> abcSort;\n    for(int i=0;i<hashSize;i++){\n        hashElm *temp; temp = hashTable[i];\n        if(temp != NULL){\n            abcSort.push_back(temp->title);\n            while(temp->next != NULL){\n                temp = temp->next;\n                abcSort.push_back(temp->title);\n            }\n        }\n    }\n    if(isAcending){\n        StringSorter::sortAlphabetically(abcSort, true);\n    }else{\n        StringSorter::sortAlphabetically(abcSort, false);\n    }\n    for(int j=0;j<abcSort.size();j++){\n        cout<<abcSort[j]<<endl;\n    }\n}\n\nvoid StringHash::print(){\n    for(int i=0;i<hashSize;i++){\n        hashElm *temp; temp = hashTable[i];\n        if(temp != NULL){\n            cout<<temp->title<<endl;\n            while(temp->next != NULL){\n                temp = temp->next;\n                cout<<temp->title<<endl;\n            }\n        }\n    }\n}\nvoid StringHash::pop(string title){\n    int i = StringHash::hashSum(title);\n    if(hashTable[i]->title == title){\n        hashElm *temp; temp = hashTable[i];\n        hashTable[i] = temp->next;\n        delete temp;\n    }else{\n        hashElm *parent; hashElm *child;\n        parent = hashTable[i];\n        if(parent->next != NULL){\n            child = parent->next;\n            while(child != NULL){\n                if(child->title == title){\n                    parent->next = child->next;\n                    delete child;\n                    return;\n                }\n                child = child->next;\n                parent = parent->next;\n            }\n            if(child == NULL){\n                cout<<\"String not found\"<<endl;\n                return;\n            }\n        }\n    }\n}\n\nvoid StringHash::push(string title){\n    int i = StringHash::hashSum(title);\n    hashElm *hashString; hashString = new hashElm(title);\n    if(hashTable[i] == NULL){\n        hashTable[i] = hashString;\n    }else{\n        hashElm *parent; parent = hashTable[i];\n        if(parent->next != NULL){\n            do{\n                parent = parent->next;\n            }while(parent->next != NULL);\n        }\n        parent->next = hashString;\n        hashString->next = NULL;\n    }\n}\n\nStringHash::StringHash(int i){\n    hashTable = new hashElm*[i];\n    hashSize = i;\n}\n\nStringHash::~StringHash(){\n    delete hashTable;\n}\n\nint StringHash::hashSum(string title){\n    int sum = 0;\n    for(int i=0;i<title.length();i++){\n        sum += (int)title[i];\n    }\n    int s = sum % hashSize;\n    s = floor(s);\n    return s;\n}\n<commit_msg>Implimented get string<commit_after>#include <iostream>\n#include \"StringSorter.h\"\n#include \"StringHash.h\"\n#include <fstream>\n#include <vector>\n#include <string>\n#include <math.h>\n\nusing namespace std;\n\nstring StringHash::getString(std::string title){\n    int i = StringHash::hashSum(title);\n    if(hashTable[i] == NULL){\n        cout<<\"String not found\"<<endl;\n    }else{\n        hashElm *temp; temp = hashTable[i];\n        while(temp != NULL){\n            if(temp->title == title){\n                return temp->title;\n            }\n            temp = temp->next;\n        }\n        if(temp == NULL){\n            cout<<\"String not found\"<<endl;\n        }\n    }\n}\n\nvoid StringHash::print(bool isAcending){\n    vector<string> abcSort;\n    for(int i=0;i<hashSize;i++){\n        hashElm *temp; temp = hashTable[i];\n        if(temp != NULL){\n            abcSort.push_back(temp->title);\n            while(temp->next != NULL){\n                temp = temp->next;\n                abcSort.push_back(temp->title);\n            }\n        }\n    }\n    if(isAcending){\n        StringSorter::sortAlphabetically(abcSort, true);\n    }else{\n        StringSorter::sortAlphabetically(abcSort, false);\n    }\n    for(int j=0;j<abcSort.size();j++){\n        cout<<abcSort[j]<<endl;\n    }\n}\n\nvoid StringHash::print(){\n    for(int i=0;i<hashSize;i++){\n        hashElm *temp; temp = hashTable[i];\n        if(temp != NULL){\n            cout<<temp->title<<endl;\n            while(temp->next != NULL){\n                temp = temp->next;\n                cout<<temp->title<<endl;\n            }\n        }\n    }\n}\nvoid StringHash::pop(string title){\n    int i = StringHash::hashSum(title);\n    if(hashTable[i]->title == title){\n        hashElm *temp; temp = hashTable[i];\n        hashTable[i] = temp->next;\n        delete temp;\n    }else{\n        hashElm *parent; hashElm *child;\n        parent = hashTable[i];\n        if(parent->next != NULL){\n            child = parent->next;\n            while(child != NULL){\n                if(child->title == title){\n                    parent->next = child->next;\n                    delete child;\n                    return;\n                }\n                child = child->next;\n                parent = parent->next;\n            }\n            if(child == NULL){\n                cout<<\"String not found\"<<endl;\n                return;\n            }\n        }\n    }\n}\n\nvoid StringHash::push(string title){\n    int i = StringHash::hashSum(title);\n    hashElm *hashString; hashString = new hashElm(title);\n    if(hashTable[i] == NULL){\n        hashTable[i] = hashString;\n    }else{\n        hashElm *parent; parent = hashTable[i];\n        if(parent->next != NULL){\n            do{\n                parent = parent->next;\n            }while(parent->next != NULL);\n        }\n        parent->next = hashString;\n        hashString->next = NULL;\n    }\n}\n\nStringHash::StringHash(int i){\n    hashTable = new hashElm*[i];\n    hashSize = i;\n}\n\nStringHash::~StringHash(){\n    delete hashTable;\n}\n\nint StringHash::hashSum(string title){\n    int sum = 0;\n    for(int i=0;i<title.length();i++){\n        sum += (int)title[i];\n    }\n    int s = sum % hashSize;\n    s = floor(s);\n    return s;\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\/\/ Qmitk\n#include \"QmitkDicomLocalStorageWidget.h\"\n\/\/#include <mitkLogMacros.h>\n\n\/\/ Qt\n#include <QLabel>\n#include <QProgressDialog>\n#include <QVariant>\n#include <QMessageBox>\n\nconst std::string QmitkDicomLocalStorageWidget::Widget_ID = \"org.mitk.Widgets.QmitkDicomLocalStorageWidget\";\n\nQmitkDicomLocalStorageWidget::QmitkDicomLocalStorageWidget(QWidget *parent)\n  : QWidget(parent)\n  , m_Controls(nullptr)\n  , m_LocalIndexer(new ctkDICOMIndexer(parent))\n{\n    CreateQtPartControl(this);\n}\n\nQmitkDicomLocalStorageWidget::~QmitkDicomLocalStorageWidget()\n{\n    m_LocalDatabase->closeDatabase();\n}\n\nvoid QmitkDicomLocalStorageWidget::CreateQtPartControl( QWidget *parent )\n{\n    if ( !m_Controls )\n    {\n        m_Controls = new Ui::QmitkDicomLocalStorageWidgetControls;\n        m_Controls->setupUi( parent );\n\n        this->SetupProgressDialog(this);\n\n        connect(m_Controls->deleteButton,SIGNAL(clicked()),this,SLOT(OnDeleteButtonClicked()));\n        connect(m_Controls->viewInternalDataButton, SIGNAL(clicked()), this , SLOT(OnViewButtonClicked()));\n\n        connect(m_Controls->ctkDicomBrowser, SIGNAL(seriesSelectionChanged(const QStringList&)),\n                this, SLOT(OnSeriesSelectionChanged(const QStringList&)));\n        connect(m_Controls->ctkDicomBrowser, SIGNAL(seriesSelectionChanged(const QStringList&)),\n                this, SLOT(OnSeriesSelectionChanged(const QStringList&)));\n        connect(m_Controls->ctkDicomBrowser, SIGNAL(seriesDoubleClicked(const QModelIndex&)),\n                this, SLOT(OnViewButtonClicked()));\n\n        connect(m_LocalIndexer, SIGNAL(indexingComplete()),this, SLOT(OnFinishedImport()));\n        connect(m_LocalIndexer, SIGNAL(indexingComplete()),this, SIGNAL(SignalFinishedImport()));\n        connect(m_LocalIndexer, SIGNAL(indexingComplete()),this, SLOT(OnFinishedImport()));\n        connect(m_LocalIndexer, SIGNAL(indexingFilePath(const QString&)), m_ProgressDialogLabel, SLOT(setText(const QString&)));\n        connect(m_LocalIndexer, SIGNAL(progress(int)), m_ProgressDialog, SLOT(setValue(int)));\n        connect(m_ProgressDialog, SIGNAL(canceled()), m_LocalIndexer, SLOT(cancel()));\n\n        m_Controls->ctkDicomBrowser->setTableOrientation(Qt::Vertical);\n    }\n}\n\nvoid QmitkDicomLocalStorageWidget::OnStartDicomImport(const QString& dicomData)\n{\n    if(m_LocalDatabase->isOpen())\n    {\n        m_LocalIndexer->addDirectory(*m_LocalDatabase,dicomData,m_LocalDatabase->databaseDirectory());\n    }\n}\n\nvoid QmitkDicomLocalStorageWidget::OnStartDicomImport(const QStringList& dicomData)\n{\n    if(m_LocalDatabase->isOpen())\n    {\n        m_ProgressDialog->show();\n        m_LocalIndexer->addListOfFiles(*m_LocalDatabase,dicomData,m_LocalDatabase->databaseDirectory());\n    }\n}\n\nvoid QmitkDicomLocalStorageWidget::OnFinishedImport()\n{\n    m_ProgressDialog->setValue(m_ProgressDialog->maximum());\n}\n\nvoid QmitkDicomLocalStorageWidget::OnDeleteButtonClicked()\n{\n  if (!this->DeletePatients())\n  {\n    if (!this->DeleteStudies())\n    {\n      this->DeleteSeries();\n    }\n  }\n\n  m_Controls->ctkDicomBrowser->updateTableViews();\n}\n\nbool QmitkDicomLocalStorageWidget::DeletePatients()\n{\n  auto selectedPatientUIDs = m_Controls->ctkDicomBrowser->currentPatientsSelection();\n\n  if (!selectedPatientUIDs.empty())\n  {\n    QStringList studyUIDs;\n\n    for (const auto& patientUID : selectedPatientUIDs)\n      studyUIDs.append(m_LocalDatabase->studiesForPatient(patientUID));\n\n    QStringList seriesUIDs;\n\n    for (const auto& studyUID : studyUIDs)\n      seriesUIDs.append(m_LocalDatabase->seriesForStudy(studyUID));\n\n    auto answer = QMessageBox::question(\n      nullptr,\n      \"Delete Patients\",\n      QString(\"Do you really want to delete %1 %2, containing %3 series in %4 %5?\")\n        .arg(selectedPatientUIDs.count())\n        .arg(selectedPatientUIDs.count() != 1 ? \"patients\" : \"patient\")\n        .arg(seriesUIDs.count())\n        .arg(studyUIDs.count())\n        .arg(studyUIDs.count() != 1 ? \"studies\" : \"study\"),\n      QMessageBox::Yes | QMessageBox::No,\n      QMessageBox::No);\n\n    if (answer == QMessageBox::Yes)\n    {\n      for (const auto& patientUID : selectedPatientUIDs)\n        m_LocalDatabase->removePatient(patientUID);\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\nbool QmitkDicomLocalStorageWidget::DeleteStudies()\n{\n  auto selectedStudyUIDs = m_Controls->ctkDicomBrowser->currentStudiesSelection();\n\n  if (!selectedStudyUIDs.empty())\n  {\n    QStringList seriesUIDs;\n\n    for (const auto& studyUID : selectedStudyUIDs)\n      seriesUIDs.append(m_LocalDatabase->seriesForStudy(studyUID));\n\n    auto answer = QMessageBox::question(\n      nullptr,\n      \"Delete Studies\",\n      QString(\"Do you really want to delete %1 %2, containing %3 series?\")\n        .arg(selectedStudyUIDs.count())\n        .arg(selectedStudyUIDs.count() != 1 ? \"studies\" : \"study\")\n        .arg(seriesUIDs.count()),\n      QMessageBox::Yes | QMessageBox::No,\n      QMessageBox::No);\n\n    if (answer == QMessageBox::Yes)\n    {\n      for (const auto& studyUID : selectedStudyUIDs)\n        m_LocalDatabase->removeStudy(studyUID);\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\nbool QmitkDicomLocalStorageWidget::DeleteSeries()\n{\n  auto selectedSeriesUIDs = m_Controls->ctkDicomBrowser->currentSeriesSelection();\n\n  if (!selectedSeriesUIDs.empty())\n  {\n    auto answer = QMessageBox::question(\n      nullptr,\n      \"Delete Series\",\n      QString(\"Do you really want to delete %1 series?\")\n        .arg(selectedSeriesUIDs.count()),\n      QMessageBox::Yes | QMessageBox::No,\n      QMessageBox::No);\n\n    if (answer == QMessageBox::Yes)\n    {\n      for (const auto& seriesUID : selectedSeriesUIDs)\n        m_LocalDatabase->removeSeries(seriesUID);\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\nvoid QmitkDicomLocalStorageWidget::OnViewButtonClicked()\n{\n  QStringList uids = m_Controls->ctkDicomBrowser->currentSeriesSelection();\n  QString uid;\n  foreach (uid, uids)\n  {\n    QStringList filesForSeries = m_LocalDatabase->filesForSeries(uid);\n    QHash<QString, QVariant> eventProperty;\n    eventProperty.insert(\"FilesForSeries\", filesForSeries);\n    emit SignalDicomToDataManager(eventProperty);\n  }\n}\n\nvoid QmitkDicomLocalStorageWidget::SetDatabaseDirectory(QString newDatatbaseDirectory)\n{\n    QDir databaseDirecory = QDir(newDatatbaseDirectory);\n    if(!databaseDirecory.exists())\n    {\n        databaseDirecory.mkpath(databaseDirecory.absolutePath());\n    }\n    QString newDatatbaseFile = databaseDirecory.absolutePath() + QString(\"\/ctkDICOM.sql\");\n    this->SetDatabase(newDatatbaseFile);\n}\n\nvoid QmitkDicomLocalStorageWidget::SetDatabase(QString databaseFile)\n{\n    m_LocalDatabase = new ctkDICOMDatabase(databaseFile);\n    m_LocalDatabase->setParent(this);\n    m_Controls->ctkDicomBrowser->setDICOMDatabase(m_LocalDatabase);\n}\n\nvoid QmitkDicomLocalStorageWidget::OnSeriesSelectionChanged(const QStringList &s)\n{\n  m_Controls->viewInternalDataButton->setEnabled((s.size() != 0));\n}\n\nvoid QmitkDicomLocalStorageWidget::SetupProgressDialog(QWidget* parent)\n{\n    m_ProgressDialog = new QProgressDialog(\"DICOM Import\", \"Cancel\", 0, 100, parent,Qt::WindowTitleHint | Qt::WindowSystemMenuHint);\n    m_ProgressDialogLabel = new QLabel(\"Initialization...\", m_ProgressDialog);\n    m_ProgressDialog->setLabel(m_ProgressDialogLabel);\n    m_ProgressDialog->setWindowModality(Qt::ApplicationModal);\n    m_ProgressDialog->setMinimumDuration(0);\n}\n<commit_msg>Fixed warning<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\/\/ Qmitk\n#include \"QmitkDicomLocalStorageWidget.h\"\n\/\/#include <mitkLogMacros.h>\n\n\/\/ Qt\n#include <QLabel>\n#include <QProgressDialog>\n#include <QVariant>\n#include <QMessageBox>\n\nconst std::string QmitkDicomLocalStorageWidget::Widget_ID = \"org.mitk.Widgets.QmitkDicomLocalStorageWidget\";\n\nQmitkDicomLocalStorageWidget::QmitkDicomLocalStorageWidget(QWidget *parent)\n  : QWidget(parent)\n  , m_LocalIndexer(new ctkDICOMIndexer(parent))\n  , m_Controls(nullptr)\n{\n    CreateQtPartControl(this);\n}\n\nQmitkDicomLocalStorageWidget::~QmitkDicomLocalStorageWidget()\n{\n    m_LocalDatabase->closeDatabase();\n}\n\nvoid QmitkDicomLocalStorageWidget::CreateQtPartControl( QWidget *parent )\n{\n    if ( !m_Controls )\n    {\n        m_Controls = new Ui::QmitkDicomLocalStorageWidgetControls;\n        m_Controls->setupUi( parent );\n\n        this->SetupProgressDialog(this);\n\n        connect(m_Controls->deleteButton,SIGNAL(clicked()),this,SLOT(OnDeleteButtonClicked()));\n        connect(m_Controls->viewInternalDataButton, SIGNAL(clicked()), this , SLOT(OnViewButtonClicked()));\n\n        connect(m_Controls->ctkDicomBrowser, SIGNAL(seriesSelectionChanged(const QStringList&)),\n                this, SLOT(OnSeriesSelectionChanged(const QStringList&)));\n        connect(m_Controls->ctkDicomBrowser, SIGNAL(seriesSelectionChanged(const QStringList&)),\n                this, SLOT(OnSeriesSelectionChanged(const QStringList&)));\n        connect(m_Controls->ctkDicomBrowser, SIGNAL(seriesDoubleClicked(const QModelIndex&)),\n                this, SLOT(OnViewButtonClicked()));\n\n        connect(m_LocalIndexer, SIGNAL(indexingComplete()),this, SLOT(OnFinishedImport()));\n        connect(m_LocalIndexer, SIGNAL(indexingComplete()),this, SIGNAL(SignalFinishedImport()));\n        connect(m_LocalIndexer, SIGNAL(indexingComplete()),this, SLOT(OnFinishedImport()));\n        connect(m_LocalIndexer, SIGNAL(indexingFilePath(const QString&)), m_ProgressDialogLabel, SLOT(setText(const QString&)));\n        connect(m_LocalIndexer, SIGNAL(progress(int)), m_ProgressDialog, SLOT(setValue(int)));\n        connect(m_ProgressDialog, SIGNAL(canceled()), m_LocalIndexer, SLOT(cancel()));\n\n        m_Controls->ctkDicomBrowser->setTableOrientation(Qt::Vertical);\n    }\n}\n\nvoid QmitkDicomLocalStorageWidget::OnStartDicomImport(const QString& dicomData)\n{\n    if(m_LocalDatabase->isOpen())\n    {\n        m_LocalIndexer->addDirectory(*m_LocalDatabase,dicomData,m_LocalDatabase->databaseDirectory());\n    }\n}\n\nvoid QmitkDicomLocalStorageWidget::OnStartDicomImport(const QStringList& dicomData)\n{\n    if(m_LocalDatabase->isOpen())\n    {\n        m_ProgressDialog->show();\n        m_LocalIndexer->addListOfFiles(*m_LocalDatabase,dicomData,m_LocalDatabase->databaseDirectory());\n    }\n}\n\nvoid QmitkDicomLocalStorageWidget::OnFinishedImport()\n{\n    m_ProgressDialog->setValue(m_ProgressDialog->maximum());\n}\n\nvoid QmitkDicomLocalStorageWidget::OnDeleteButtonClicked()\n{\n  if (!this->DeletePatients())\n  {\n    if (!this->DeleteStudies())\n    {\n      this->DeleteSeries();\n    }\n  }\n\n  m_Controls->ctkDicomBrowser->updateTableViews();\n}\n\nbool QmitkDicomLocalStorageWidget::DeletePatients()\n{\n  auto selectedPatientUIDs = m_Controls->ctkDicomBrowser->currentPatientsSelection();\n\n  if (!selectedPatientUIDs.empty())\n  {\n    QStringList studyUIDs;\n\n    for (const auto& patientUID : selectedPatientUIDs)\n      studyUIDs.append(m_LocalDatabase->studiesForPatient(patientUID));\n\n    QStringList seriesUIDs;\n\n    for (const auto& studyUID : studyUIDs)\n      seriesUIDs.append(m_LocalDatabase->seriesForStudy(studyUID));\n\n    auto answer = QMessageBox::question(\n      nullptr,\n      \"Delete Patients\",\n      QString(\"Do you really want to delete %1 %2, containing %3 series in %4 %5?\")\n        .arg(selectedPatientUIDs.count())\n        .arg(selectedPatientUIDs.count() != 1 ? \"patients\" : \"patient\")\n        .arg(seriesUIDs.count())\n        .arg(studyUIDs.count())\n        .arg(studyUIDs.count() != 1 ? \"studies\" : \"study\"),\n      QMessageBox::Yes | QMessageBox::No,\n      QMessageBox::No);\n\n    if (answer == QMessageBox::Yes)\n    {\n      for (const auto& patientUID : selectedPatientUIDs)\n        m_LocalDatabase->removePatient(patientUID);\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\nbool QmitkDicomLocalStorageWidget::DeleteStudies()\n{\n  auto selectedStudyUIDs = m_Controls->ctkDicomBrowser->currentStudiesSelection();\n\n  if (!selectedStudyUIDs.empty())\n  {\n    QStringList seriesUIDs;\n\n    for (const auto& studyUID : selectedStudyUIDs)\n      seriesUIDs.append(m_LocalDatabase->seriesForStudy(studyUID));\n\n    auto answer = QMessageBox::question(\n      nullptr,\n      \"Delete Studies\",\n      QString(\"Do you really want to delete %1 %2, containing %3 series?\")\n        .arg(selectedStudyUIDs.count())\n        .arg(selectedStudyUIDs.count() != 1 ? \"studies\" : \"study\")\n        .arg(seriesUIDs.count()),\n      QMessageBox::Yes | QMessageBox::No,\n      QMessageBox::No);\n\n    if (answer == QMessageBox::Yes)\n    {\n      for (const auto& studyUID : selectedStudyUIDs)\n        m_LocalDatabase->removeStudy(studyUID);\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\nbool QmitkDicomLocalStorageWidget::DeleteSeries()\n{\n  auto selectedSeriesUIDs = m_Controls->ctkDicomBrowser->currentSeriesSelection();\n\n  if (!selectedSeriesUIDs.empty())\n  {\n    auto answer = QMessageBox::question(\n      nullptr,\n      \"Delete Series\",\n      QString(\"Do you really want to delete %1 series?\")\n        .arg(selectedSeriesUIDs.count()),\n      QMessageBox::Yes | QMessageBox::No,\n      QMessageBox::No);\n\n    if (answer == QMessageBox::Yes)\n    {\n      for (const auto& seriesUID : selectedSeriesUIDs)\n        m_LocalDatabase->removeSeries(seriesUID);\n    }\n\n    return true;\n  }\n\n  return false;\n}\n\nvoid QmitkDicomLocalStorageWidget::OnViewButtonClicked()\n{\n  QStringList uids = m_Controls->ctkDicomBrowser->currentSeriesSelection();\n  QString uid;\n  foreach (uid, uids)\n  {\n    QStringList filesForSeries = m_LocalDatabase->filesForSeries(uid);\n    QHash<QString, QVariant> eventProperty;\n    eventProperty.insert(\"FilesForSeries\", filesForSeries);\n    emit SignalDicomToDataManager(eventProperty);\n  }\n}\n\nvoid QmitkDicomLocalStorageWidget::SetDatabaseDirectory(QString newDatatbaseDirectory)\n{\n    QDir databaseDirecory = QDir(newDatatbaseDirectory);\n    if(!databaseDirecory.exists())\n    {\n        databaseDirecory.mkpath(databaseDirecory.absolutePath());\n    }\n    QString newDatatbaseFile = databaseDirecory.absolutePath() + QString(\"\/ctkDICOM.sql\");\n    this->SetDatabase(newDatatbaseFile);\n}\n\nvoid QmitkDicomLocalStorageWidget::SetDatabase(QString databaseFile)\n{\n    m_LocalDatabase = new ctkDICOMDatabase(databaseFile);\n    m_LocalDatabase->setParent(this);\n    m_Controls->ctkDicomBrowser->setDICOMDatabase(m_LocalDatabase);\n}\n\nvoid QmitkDicomLocalStorageWidget::OnSeriesSelectionChanged(const QStringList &s)\n{\n  m_Controls->viewInternalDataButton->setEnabled((s.size() != 0));\n}\n\nvoid QmitkDicomLocalStorageWidget::SetupProgressDialog(QWidget* parent)\n{\n    m_ProgressDialog = new QProgressDialog(\"DICOM Import\", \"Cancel\", 0, 100, parent,Qt::WindowTitleHint | Qt::WindowSystemMenuHint);\n    m_ProgressDialogLabel = new QLabel(\"Initialization...\", m_ProgressDialog);\n    m_ProgressDialog->setLabel(m_ProgressDialogLabel);\n    m_ProgressDialog->setWindowModality(Qt::ApplicationModal);\n    m_ProgressDialog->setMinimumDuration(0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*============================================================================\n\nThe Medical Imaging Interaction Toolkit (MITK)\n\nCopyright (c) German Cancer Research Center (DKFZ)\nAll rights reserved.\n\nUse of this source code is governed by a 3-clause BSD license that can be\nfound in the LICENSE file.\n\n============================================================================*\/\n\n#include \"mitkSceneReaderV1.h\"\n#include \"Poco\/Path.h\"\n#include \"mitkBaseRenderer.h\"\n#include \"mitkIOUtil.h\"\n#include \"mitkProgressBar.h\"\n#include \"mitkPropertyListDeserializer.h\"\n#include \"mitkSerializerMacros.h\"\n#include <mitkUIDManipulator.h>\n#include <mitkRenderingModeProperty.h>\n#include <tinyxml2.h>\n\n#include <filesystem>\n#include <map>\n\nMITK_REGISTER_SERIALIZER(SceneReaderV1)\n\nnamespace\n{\n  typedef std::pair<mitk::DataNode::Pointer, std::list<std::string>> NodesAndParentsPair;\n\n  bool NodeSortByLayerIsLessThan(const NodesAndParentsPair &left, const NodesAndParentsPair &right)\n  {\n    if (left.first.IsNotNull() && right.first.IsNotNull())\n    {\n      int leftLayer;\n      int rightLayer;\n      if (left.first->GetIntProperty(\"layer\", leftLayer) && right.first->GetIntProperty(\"layer\", rightLayer))\n      {\n        return leftLayer < rightLayer;\n      }\n      else\n      {\n        \/\/ fall back to name sort\n        return left.first->GetName() < right.first->GetName();\n      }\n    }\n\n    \/\/ in all other cases, fall back to stupid pointer comparison\n    \/\/ this is not reasonable but at least answers the sorting\n    \/\/ question clearly\n    return left.first.GetPointer() < right.first.GetPointer();\n  }\n\n  \/\/ This is a workaround until we are able to save time-related information in an\n  \/\/ actual file format of surfaces.\n  void ApplyProportionalTimeGeometryProperties(mitk::BaseData* data)\n  {\n    auto* geometry = dynamic_cast<mitk::ProportionalTimeGeometry*>(data->GetTimeGeometry());\n\n    if (nullptr == geometry)\n      return;\n\n    auto properties = data->GetPropertyList();\n    float value = 0.0f;\n\n    if (properties->GetFloatProperty(\"ProportionalTimeGeometry.FirstTimePoint\", value))\n    {\n      if (value == -std::numeric_limits<float>::infinity())\n        value = std::numeric_limits<float>::lowest();\n\n      geometry->SetFirstTimePoint(value);\n    }\n\n    if (properties->GetFloatProperty(\"ProportionalTimeGeometry.StepDuration\", value))\n      geometry->SetStepDuration(value);\n  }\n\n  mitk::PropertyList::Pointer DeserializeProperties(const tinyxml2::XMLElement *propertiesElement, const std::filesystem::path& basePath)\n  {\n    if (propertiesElement == nullptr)\n      return nullptr;\n\n    std::filesystem::path path(propertiesElement->Attribute(\"file\"));\n\n    if (path.empty())\n      return nullptr;\n\n    if (!basePath.empty())\n      path = basePath \/ path;\n\n    auto deserializer = mitk::PropertyListDeserializer::New();\n    deserializer->SetFilename(path.string());\n    deserializer->Deserialize();\n\n    return deserializer->GetOutput();\n  }\n}\n\nbool mitk::SceneReaderV1::LoadScene(tinyxml2::XMLDocument &document, const std::string &workingDirectory, DataStorage *storage)\n{\n  assert(storage);\n  bool error(false);\n\n  \/\/ TODO prepare to detect errors (such as cycles) from wrongly written or edited xml files\n\n  \/\/ Get number of elements to initialze progress bar\n  \/\/   1. if there is a <data type=\"...\" file=\"...\"> element,\n  \/\/        - construct a name for the appropriate serializer\n  \/\/        - try to instantiate this serializer via itk object factory\n  \/\/        - if serializer could be created, use it to read the file into a BaseData object\n  \/\/        - if successful, call the new node's SetData(..)\n\n  \/\/ create a node for the tag \"data\" and test if node was created\n  typedef std::vector<mitk::DataNode::Pointer> DataNodeVector;\n  DataNodeVector DataNodes;\n  unsigned int listSize = 0;\n  for (auto *element = document.FirstChildElement(\"node\"); element != nullptr;\n       element = element->NextSiblingElement(\"node\"))\n  {\n    ++listSize;\n  }\n\n  ProgressBar::GetInstance()->AddStepsToDo(listSize * 2);\n\n  \/\/ Deserialize base data properties before reading the actual data to be\n  \/\/ able to provide them as read-only meta data to the data reader.\n  std::map<std::string, PropertyList::Pointer> baseDataPropertyLists;\n\n  for (auto *nodeElement = document.FirstChildElement(\"node\"); nodeElement != nullptr;\n       nodeElement = nodeElement->NextSiblingElement(\"node\"))\n  {\n    const auto *uid = nodeElement->Attribute(\"UID\");\n\n    if (uid == nullptr)\n      continue;\n\n    auto *dataElement = nodeElement->FirstChildElement(\"data\");\n\n    if (dataElement != nullptr)\n    {\n      auto properties = DeserializeProperties(dataElement->FirstChildElement(\"properties\"), workingDirectory);\n\n      if (properties.IsNotNull())\n        baseDataPropertyLists[uid] = properties;\n    }\n  }\n\n  for (auto *element = document.FirstChildElement(\"node\"); element != nullptr;\n       element = element->NextSiblingElement(\"node\"))\n  {\n    mitk::PropertyList* properties = nullptr;\n    const auto *uid = element->Attribute(\"UID\");\n\n    if (uid != nullptr)\n    {\n      auto iter = baseDataPropertyLists.find(uid);\n\n      if (iter != baseDataPropertyLists.end())\n        properties = iter->second;\n    }\n\n    const auto *dataElement = element->FirstChildElement(\"data\");\n    auto dataNode = this->LoadBaseDataFromDataTag(dataElement, properties, workingDirectory, error);\n\n    if (dataNode.IsNull())\n      continue;\n\n    auto* baseData = dataNode->GetData();\n\n    if (baseData != nullptr && properties != nullptr)\n    {\n      baseData->SetPropertyList(properties);\n      ApplyProportionalTimeGeometryProperties(baseData);\n    }\n\n    DataNodes.push_back(dataNode);\n\n    ProgressBar::GetInstance()->Progress();\n  }\n\n  \/\/ iterate all nodes\n  \/\/ first level nodes should be <node> elements\n  auto nit = DataNodes.begin();\n  for (auto *element = document.FirstChildElement(\"node\"); element != nullptr || nit != DataNodes.end();\n       element = element->NextSiblingElement(\"node\"), ++nit)\n  {\n    mitk::DataNode::Pointer node = *nit;\n\n    \/\/   1. check child nodes\n    const char *uida = element->Attribute(\"UID\");\n    std::string uid(\"\");\n\n    if (uida)\n    {\n      uid = uida;\n      m_NodeForID[uid] = node.GetPointer();\n      m_IDForNode[node.GetPointer()] = uid;\n    }\n    else\n    {\n      MITK_ERROR << \"No UID found for current node. Node will have no parents.\";\n      error = true;\n    }\n\n    \/\/   2. if there are <properties> nodes,\n    \/\/        - instantiate the appropriate PropertyListDeSerializer\n    \/\/        - use them to construct PropertyList objects\n    \/\/        - add these properties to the node (if necessary, use renderwindow name)\n    bool success = DecorateNodeWithProperties(node, element, workingDirectory);\n    if (!success)\n    {\n      MITK_ERROR << \"Could not load properties for node.\";\n      error = true;\n    }\n\n    \/\/ remember node for later adding to DataStorage\n    m_OrderedNodePairs.push_back(std::make_pair(node, std::list<std::string>()));\n\n    \/\/   3. if there are <source> elements, remember parent objects\n    for (auto *source = element->FirstChildElement(\"source\"); source != nullptr;\n         source = source->NextSiblingElement(\"source\"))\n    {\n      const char *sourceUID = source->Attribute(\"UID\");\n      if (sourceUID)\n      {\n        m_OrderedNodePairs.back().second.push_back(std::string(sourceUID));\n      }\n    }\n\n    ProgressBar::GetInstance()->Progress();\n  } \/\/ end for all <node>\n\n  \/\/ sort our nodes by their \"layer\" property\n  \/\/ (to be inserted in that order)\n  m_OrderedNodePairs.sort(&NodeSortByLayerIsLessThan);\n\n  \/\/ remove all unknown parent UIDs\n  for (auto nodesIter = m_OrderedNodePairs.begin(); nodesIter != m_OrderedNodePairs.end();\n       ++nodesIter)\n  {\n    for (auto parentsIter = nodesIter->second.begin();\n         parentsIter != nodesIter->second.end();)\n    {\n      if (m_NodeForID.find(*parentsIter) == m_NodeForID.end())\n      {\n        parentsIter = nodesIter->second.erase(parentsIter);\n        MITK_WARN << \"Found a DataNode with unknown parents. Will add it to DataStorage without any parent objects.\";\n        error = true;\n      }\n      else\n      {\n        ++parentsIter;\n      }\n    }\n  }\n\n  \/\/ repeat the following loop ...\n  \/\/   ... for all created nodes\n  unsigned int lastMapSize(0);\n  while (lastMapSize !=\n         m_OrderedNodePairs\n           .size()) \/\/ this is to prevent infinite loops; each iteration must at least add one node to DataStorage\n  {\n    lastMapSize = m_OrderedNodePairs.size();\n\n    \/\/ iterate (layer) ordered nodes backwards\n    \/\/ we insert the highest layers first\n    for (auto nodesIter = m_OrderedNodePairs.begin(); nodesIter != m_OrderedNodePairs.end();\n         ++nodesIter)\n    {\n      bool addThisNode(true);\n\n      \/\/ if any parent node is not yet in DataStorage, skip node for now and check later\n      for (auto parentsIter = nodesIter->second.begin();\n           parentsIter != nodesIter->second.end();\n           ++parentsIter)\n      {\n        if (!storage->Exists(m_NodeForID[*parentsIter]))\n        {\n          addThisNode = false;\n          break;\n        }\n      }\n\n      if (addThisNode)\n      {\n        DataStorage::SetOfObjects::Pointer parents = DataStorage::SetOfObjects::New();\n        for (auto parentsIter = nodesIter->second.begin();\n             parentsIter != nodesIter->second.end();\n             ++parentsIter)\n        {\n          parents->push_back(m_NodeForID[*parentsIter]);\n        }\n\n        \/\/ if all parents are found in datastorage (or are unknown), add node to DataStorage\n        storage->Add(nodesIter->first, parents);\n\n        \/\/ remove this node from m_OrderedNodePairs\n        m_OrderedNodePairs.erase(nodesIter);\n\n        \/\/ break this for loop because iterators are probably invalid\n        break;\n      }\n    }\n  }\n\n  \/\/ All nodes that are still in m_OrderedNodePairs at this point are not part of a proper directed graph structure.\n  \/\/ We'll add such nodes without any parent information.\n  for (auto nodesIter = m_OrderedNodePairs.begin(); nodesIter != m_OrderedNodePairs.end();\n       ++nodesIter)\n  {\n    storage->Add(nodesIter->first);\n    MITK_WARN << \"Encountered node that is not part of a directed graph structure. Will be added to DataStorage \"\n                 \"without parents.\";\n    error = true;\n  }\n\n  return !error;\n}\n\nmitk::DataNode::Pointer mitk::SceneReaderV1::LoadBaseDataFromDataTag(const tinyxml2::XMLElement *dataElement,\n                                                                     const PropertyList *properties,\n                                                                     const std::string &workingDirectory,\n                                                                     bool &error)\n{\n  DataNode::Pointer node;\n\n  if (dataElement)\n  {\n    const char *filename = dataElement->Attribute(\"file\");\n    if (filename && strlen(filename) != 0)\n    {\n      try\n      {\n        auto baseData = IOUtil::Load(workingDirectory + Poco::Path::separator() + filename, properties);\n\n        node = DataNode::New();\n        node->SetData(baseData);\n      }\n      catch (std::exception &e)\n      {\n        MITK_ERROR << \"Error during attempt to read '\" << filename << \"'. Exception says: \" << e.what();\n        error = true;\n      }\n\n      if (node.IsNull())\n      {\n        MITK_ERROR << \"Error during attempt to read '\" << filename << \"'. Factory returned nullptr object.\";\n        error = true;\n      }\n    }\n\n    const char* dataUID = dataElement->Attribute(\"UID\");\n    if (!error && dataUID != nullptr)\n    {\n      UIDManipulator manip(node->GetData());\n      manip.SetUID(dataUID);\n    }\n  }\n\n  \/\/ in case there was no <data> element we create a new empty node (for appending a propertylist later)\n  if (node.IsNull())\n  {\n    node = DataNode::New();\n  }\n\n  return node;\n}\n\nvoid mitk::SceneReaderV1::ClearNodePropertyListWithExceptions(DataNode &node, PropertyList &propertyList)\n{\n  \/\/ Basically call propertyList.Clear(), but implement exceptions (see bug 19354)\n  BaseData *data = node.GetData();\n\n  PropertyList::Pointer propertiesToKeep = PropertyList::New();\n\n  if (dynamic_cast<Image *>(data))\n  {\n    \/*\n      Older scene files (before changes of bug 17547) could contain\n      a RenderingMode property with value \"LevelWindow_Color\".\n      Since bug 17547 this value has been removed and replaced by\n      the default value LookupTable_LevelWindow_Color.\n\n      This new default value does only result in \"black-to-white\"\n      CT images (or others) if there is a corresponding lookup\n      table. Such a lookup table is provided as a default value\n      by the Image mapper. Since that value was never present in\n      older scene files, we do well in not removing the new\n      default value here. Otherwise the mapper would fall back\n      to another default which is all the colors of the rainbow :-(\n    *\/\n    BaseProperty::Pointer lutProperty = propertyList.GetProperty(\"LookupTable\");\n    propertiesToKeep->SetProperty(\"LookupTable\", lutProperty);\n\n    \/*\n      Older scene files (before changes of T14807) may contain\n      multi-component images without the \"Image.Displayed Component\"\n      property.\n\n      As the treatment as multi-component image and the corresponding\n      visualization options hinges on that property we should not delete\n      it, if it was added by the mapper.\n\n      This is a fix for the issue reported in T19919.\n    *\/\n    BaseProperty::Pointer compProperty = propertyList.GetProperty(\"Image.Displayed Component\");\n    if (compProperty.IsNotNull())\n    {\n      propertiesToKeep->SetProperty(\"Image.Displayed Component\", compProperty);\n    }\n  }\n\n  propertyList.Clear();\n\n  propertyList.ConcatenatePropertyList(propertiesToKeep);\n}\n\nbool mitk::SceneReaderV1::DecorateNodeWithProperties(DataNode *node,\n                                                     const tinyxml2::XMLElement *nodeElement,\n                                                     const std::string &workingDirectory)\n{\n  assert(node);\n  assert(nodeElement);\n  bool error(false);\n\n  for (auto *properties = nodeElement->FirstChildElement(\"properties\"); properties != nullptr;\n       properties = properties->NextSiblingElement(\"properties\"))\n  {\n    const char *propertiesfilea(properties->Attribute(\"file\"));\n    std::string propertiesfile(propertiesfilea ? propertiesfilea : \"\");\n\n    const char *renderwindowa(properties->Attribute(\"renderwindow\"));\n    std::string renderwindow(renderwindowa ? renderwindowa : \"\");\n\n    PropertyList::Pointer propertyList =\n      node->GetPropertyList(renderwindow); \/\/ DataNode implementation always returns a propertylist\n    ClearNodePropertyListWithExceptions(*node, *propertyList);\n\n    \/\/ use deserializer to construct new properties\n    PropertyListDeserializer::Pointer deserializer = PropertyListDeserializer::New();\n\n    deserializer->SetFilename(workingDirectory + Poco::Path::separator() + propertiesfile);\n    bool success = deserializer->Deserialize();\n    error |= !success;\n    PropertyList::Pointer readProperties = deserializer->GetOutput();\n\n    if (readProperties.IsNotNull())\n    {\n      propertyList->ConcatenatePropertyList(readProperties, true); \/\/ true = replace\n    }\n    else\n    {\n      MITK_ERROR << \"Property list reader did not return a property list. This is an implementation error. Please tell \"\n                    \"your developer.\";\n      error = true;\n    }\n  }\n\n  return !error;\n}\n<commit_msg>Recognize data tag with empty file attribute as error<commit_after>\/*============================================================================\n\nThe Medical Imaging Interaction Toolkit (MITK)\n\nCopyright (c) German Cancer Research Center (DKFZ)\nAll rights reserved.\n\nUse of this source code is governed by a 3-clause BSD license that can be\nfound in the LICENSE file.\n\n============================================================================*\/\n\n#include \"mitkSceneReaderV1.h\"\n#include \"Poco\/Path.h\"\n#include \"mitkBaseRenderer.h\"\n#include \"mitkIOUtil.h\"\n#include \"mitkProgressBar.h\"\n#include \"mitkPropertyListDeserializer.h\"\n#include \"mitkSerializerMacros.h\"\n#include <mitkUIDManipulator.h>\n#include <mitkRenderingModeProperty.h>\n#include <tinyxml2.h>\n\n#include <filesystem>\n#include <map>\n\nMITK_REGISTER_SERIALIZER(SceneReaderV1)\n\nnamespace\n{\n  typedef std::pair<mitk::DataNode::Pointer, std::list<std::string>> NodesAndParentsPair;\n\n  bool NodeSortByLayerIsLessThan(const NodesAndParentsPair &left, const NodesAndParentsPair &right)\n  {\n    if (left.first.IsNotNull() && right.first.IsNotNull())\n    {\n      int leftLayer;\n      int rightLayer;\n      if (left.first->GetIntProperty(\"layer\", leftLayer) && right.first->GetIntProperty(\"layer\", rightLayer))\n      {\n        return leftLayer < rightLayer;\n      }\n      else\n      {\n        \/\/ fall back to name sort\n        return left.first->GetName() < right.first->GetName();\n      }\n    }\n\n    \/\/ in all other cases, fall back to stupid pointer comparison\n    \/\/ this is not reasonable but at least answers the sorting\n    \/\/ question clearly\n    return left.first.GetPointer() < right.first.GetPointer();\n  }\n\n  \/\/ This is a workaround until we are able to save time-related information in an\n  \/\/ actual file format of surfaces.\n  void ApplyProportionalTimeGeometryProperties(mitk::BaseData* data)\n  {\n    auto* geometry = dynamic_cast<mitk::ProportionalTimeGeometry*>(data->GetTimeGeometry());\n\n    if (nullptr == geometry)\n      return;\n\n    auto properties = data->GetPropertyList();\n    float value = 0.0f;\n\n    if (properties->GetFloatProperty(\"ProportionalTimeGeometry.FirstTimePoint\", value))\n    {\n      if (value == -std::numeric_limits<float>::infinity())\n        value = std::numeric_limits<float>::lowest();\n\n      geometry->SetFirstTimePoint(value);\n    }\n\n    if (properties->GetFloatProperty(\"ProportionalTimeGeometry.StepDuration\", value))\n      geometry->SetStepDuration(value);\n  }\n\n  mitk::PropertyList::Pointer DeserializeProperties(const tinyxml2::XMLElement *propertiesElement, const std::filesystem::path& basePath)\n  {\n    if (propertiesElement == nullptr)\n      return nullptr;\n\n    std::filesystem::path path(propertiesElement->Attribute(\"file\"));\n\n    if (path.empty())\n      return nullptr;\n\n    if (!basePath.empty())\n      path = basePath \/ path;\n\n    auto deserializer = mitk::PropertyListDeserializer::New();\n    deserializer->SetFilename(path.string());\n    deserializer->Deserialize();\n\n    return deserializer->GetOutput();\n  }\n}\n\nbool mitk::SceneReaderV1::LoadScene(tinyxml2::XMLDocument &document, const std::string &workingDirectory, DataStorage *storage)\n{\n  assert(storage);\n  bool error(false);\n\n  \/\/ TODO prepare to detect errors (such as cycles) from wrongly written or edited xml files\n\n  \/\/ Get number of elements to initialze progress bar\n  \/\/   1. if there is a <data type=\"...\" file=\"...\"> element,\n  \/\/        - construct a name for the appropriate serializer\n  \/\/        - try to instantiate this serializer via itk object factory\n  \/\/        - if serializer could be created, use it to read the file into a BaseData object\n  \/\/        - if successful, call the new node's SetData(..)\n\n  \/\/ create a node for the tag \"data\" and test if node was created\n  typedef std::vector<mitk::DataNode::Pointer> DataNodeVector;\n  DataNodeVector DataNodes;\n  unsigned int listSize = 0;\n  for (auto *element = document.FirstChildElement(\"node\"); element != nullptr;\n       element = element->NextSiblingElement(\"node\"))\n  {\n    ++listSize;\n  }\n\n  ProgressBar::GetInstance()->AddStepsToDo(listSize * 2);\n\n  \/\/ Deserialize base data properties before reading the actual data to be\n  \/\/ able to provide them as read-only meta data to the data reader.\n  std::map<std::string, PropertyList::Pointer> baseDataPropertyLists;\n\n  for (auto *nodeElement = document.FirstChildElement(\"node\"); nodeElement != nullptr;\n       nodeElement = nodeElement->NextSiblingElement(\"node\"))\n  {\n    const auto *uid = nodeElement->Attribute(\"UID\");\n\n    if (uid == nullptr)\n      continue;\n\n    auto *dataElement = nodeElement->FirstChildElement(\"data\");\n\n    if (dataElement != nullptr)\n    {\n      auto properties = DeserializeProperties(dataElement->FirstChildElement(\"properties\"), workingDirectory);\n\n      if (properties.IsNotNull())\n        baseDataPropertyLists[uid] = properties;\n    }\n  }\n\n  for (auto *element = document.FirstChildElement(\"node\"); element != nullptr;\n       element = element->NextSiblingElement(\"node\"))\n  {\n    mitk::PropertyList* properties = nullptr;\n    const auto *uid = element->Attribute(\"UID\");\n\n    if (uid != nullptr)\n    {\n      auto iter = baseDataPropertyLists.find(uid);\n\n      if (iter != baseDataPropertyLists.end())\n        properties = iter->second;\n    }\n\n    const auto *dataElement = element->FirstChildElement(\"data\");\n    auto dataNode = this->LoadBaseDataFromDataTag(dataElement, properties, workingDirectory, error);\n\n    if (dataNode.IsNull())\n      continue;\n\n    auto* baseData = dataNode->GetData();\n\n    if (baseData != nullptr && properties != nullptr)\n    {\n      baseData->SetPropertyList(properties);\n      ApplyProportionalTimeGeometryProperties(baseData);\n    }\n\n    DataNodes.push_back(dataNode);\n\n    ProgressBar::GetInstance()->Progress();\n  }\n\n  \/\/ iterate all nodes\n  \/\/ first level nodes should be <node> elements\n  auto nit = DataNodes.begin();\n  for (auto *element = document.FirstChildElement(\"node\"); element != nullptr || nit != DataNodes.end();\n       element = element->NextSiblingElement(\"node\"), ++nit)\n  {\n    mitk::DataNode::Pointer node = *nit;\n\n    \/\/   1. check child nodes\n    const char *uida = element->Attribute(\"UID\");\n    std::string uid(\"\");\n\n    if (uida)\n    {\n      uid = uida;\n      m_NodeForID[uid] = node.GetPointer();\n      m_IDForNode[node.GetPointer()] = uid;\n    }\n    else\n    {\n      MITK_ERROR << \"No UID found for current node. Node will have no parents.\";\n      error = true;\n    }\n\n    \/\/   2. if there are <properties> nodes,\n    \/\/        - instantiate the appropriate PropertyListDeSerializer\n    \/\/        - use them to construct PropertyList objects\n    \/\/        - add these properties to the node (if necessary, use renderwindow name)\n    bool success = DecorateNodeWithProperties(node, element, workingDirectory);\n    if (!success)\n    {\n      MITK_ERROR << \"Could not load properties for node.\";\n      error = true;\n    }\n\n    \/\/ remember node for later adding to DataStorage\n    m_OrderedNodePairs.push_back(std::make_pair(node, std::list<std::string>()));\n\n    \/\/   3. if there are <source> elements, remember parent objects\n    for (auto *source = element->FirstChildElement(\"source\"); source != nullptr;\n         source = source->NextSiblingElement(\"source\"))\n    {\n      const char *sourceUID = source->Attribute(\"UID\");\n      if (sourceUID)\n      {\n        m_OrderedNodePairs.back().second.push_back(std::string(sourceUID));\n      }\n    }\n\n    ProgressBar::GetInstance()->Progress();\n  } \/\/ end for all <node>\n\n  \/\/ sort our nodes by their \"layer\" property\n  \/\/ (to be inserted in that order)\n  m_OrderedNodePairs.sort(&NodeSortByLayerIsLessThan);\n\n  \/\/ remove all unknown parent UIDs\n  for (auto nodesIter = m_OrderedNodePairs.begin(); nodesIter != m_OrderedNodePairs.end();\n       ++nodesIter)\n  {\n    for (auto parentsIter = nodesIter->second.begin();\n         parentsIter != nodesIter->second.end();)\n    {\n      if (m_NodeForID.find(*parentsIter) == m_NodeForID.end())\n      {\n        parentsIter = nodesIter->second.erase(parentsIter);\n        MITK_WARN << \"Found a DataNode with unknown parents. Will add it to DataStorage without any parent objects.\";\n        error = true;\n      }\n      else\n      {\n        ++parentsIter;\n      }\n    }\n  }\n\n  \/\/ repeat the following loop ...\n  \/\/   ... for all created nodes\n  unsigned int lastMapSize(0);\n  while (lastMapSize !=\n         m_OrderedNodePairs\n           .size()) \/\/ this is to prevent infinite loops; each iteration must at least add one node to DataStorage\n  {\n    lastMapSize = m_OrderedNodePairs.size();\n\n    \/\/ iterate (layer) ordered nodes backwards\n    \/\/ we insert the highest layers first\n    for (auto nodesIter = m_OrderedNodePairs.begin(); nodesIter != m_OrderedNodePairs.end();\n         ++nodesIter)\n    {\n      bool addThisNode(true);\n\n      \/\/ if any parent node is not yet in DataStorage, skip node for now and check later\n      for (auto parentsIter = nodesIter->second.begin();\n           parentsIter != nodesIter->second.end();\n           ++parentsIter)\n      {\n        if (!storage->Exists(m_NodeForID[*parentsIter]))\n        {\n          addThisNode = false;\n          break;\n        }\n      }\n\n      if (addThisNode)\n      {\n        DataStorage::SetOfObjects::Pointer parents = DataStorage::SetOfObjects::New();\n        for (auto parentsIter = nodesIter->second.begin();\n             parentsIter != nodesIter->second.end();\n             ++parentsIter)\n        {\n          parents->push_back(m_NodeForID[*parentsIter]);\n        }\n\n        \/\/ if all parents are found in datastorage (or are unknown), add node to DataStorage\n        storage->Add(nodesIter->first, parents);\n\n        \/\/ remove this node from m_OrderedNodePairs\n        m_OrderedNodePairs.erase(nodesIter);\n\n        \/\/ break this for loop because iterators are probably invalid\n        break;\n      }\n    }\n  }\n\n  \/\/ All nodes that are still in m_OrderedNodePairs at this point are not part of a proper directed graph structure.\n  \/\/ We'll add such nodes without any parent information.\n  for (auto nodesIter = m_OrderedNodePairs.begin(); nodesIter != m_OrderedNodePairs.end();\n       ++nodesIter)\n  {\n    storage->Add(nodesIter->first);\n    MITK_WARN << \"Encountered node that is not part of a directed graph structure. Will be added to DataStorage \"\n                 \"without parents.\";\n    error = true;\n  }\n\n  return !error;\n}\n\nmitk::DataNode::Pointer mitk::SceneReaderV1::LoadBaseDataFromDataTag(const tinyxml2::XMLElement *dataElement,\n                                                                     const PropertyList *properties,\n                                                                     const std::string &workingDirectory,\n                                                                     bool &error)\n{\n  DataNode::Pointer node;\n\n  if (dataElement)\n  {\n    const char *filename = dataElement->Attribute(\"file\");\n    if (filename && strlen(filename) != 0)\n    {\n      try\n      {\n        auto baseData = IOUtil::Load(workingDirectory + Poco::Path::separator() + filename, properties);\n\n        node = DataNode::New();\n        node->SetData(baseData);\n      }\n      catch (std::exception &e)\n      {\n        MITK_ERROR << \"Error during attempt to read '\" << filename << \"'. Exception says: \" << e.what();\n        error = true;\n      }\n\n      if (node.IsNull())\n      {\n        MITK_ERROR << \"Error during attempt to read '\" << filename << \"'. Factory returned nullptr object.\";\n        error = true;\n      }\n    }\n    else\n    {\n      MITK_ERROR << \"File attribute of data tag is empty!\";\n      error = true;\n    }\n\n    const char* dataUID = dataElement->Attribute(\"UID\");\n    if (!error && dataUID != nullptr)\n    {\n      UIDManipulator manip(node->GetData());\n      manip.SetUID(dataUID);\n    }\n  }\n\n  \/\/ in case there was no <data> element we create a new empty node (for appending a propertylist later)\n  if (node.IsNull())\n  {\n    node = DataNode::New();\n  }\n\n  return node;\n}\n\nvoid mitk::SceneReaderV1::ClearNodePropertyListWithExceptions(DataNode &node, PropertyList &propertyList)\n{\n  \/\/ Basically call propertyList.Clear(), but implement exceptions (see bug 19354)\n  BaseData *data = node.GetData();\n\n  PropertyList::Pointer propertiesToKeep = PropertyList::New();\n\n  if (dynamic_cast<Image *>(data))\n  {\n    \/*\n      Older scene files (before changes of bug 17547) could contain\n      a RenderingMode property with value \"LevelWindow_Color\".\n      Since bug 17547 this value has been removed and replaced by\n      the default value LookupTable_LevelWindow_Color.\n\n      This new default value does only result in \"black-to-white\"\n      CT images (or others) if there is a corresponding lookup\n      table. Such a lookup table is provided as a default value\n      by the Image mapper. Since that value was never present in\n      older scene files, we do well in not removing the new\n      default value here. Otherwise the mapper would fall back\n      to another default which is all the colors of the rainbow :-(\n    *\/\n    BaseProperty::Pointer lutProperty = propertyList.GetProperty(\"LookupTable\");\n    propertiesToKeep->SetProperty(\"LookupTable\", lutProperty);\n\n    \/*\n      Older scene files (before changes of T14807) may contain\n      multi-component images without the \"Image.Displayed Component\"\n      property.\n\n      As the treatment as multi-component image and the corresponding\n      visualization options hinges on that property we should not delete\n      it, if it was added by the mapper.\n\n      This is a fix for the issue reported in T19919.\n    *\/\n    BaseProperty::Pointer compProperty = propertyList.GetProperty(\"Image.Displayed Component\");\n    if (compProperty.IsNotNull())\n    {\n      propertiesToKeep->SetProperty(\"Image.Displayed Component\", compProperty);\n    }\n  }\n\n  propertyList.Clear();\n\n  propertyList.ConcatenatePropertyList(propertiesToKeep);\n}\n\nbool mitk::SceneReaderV1::DecorateNodeWithProperties(DataNode *node,\n                                                     const tinyxml2::XMLElement *nodeElement,\n                                                     const std::string &workingDirectory)\n{\n  assert(node);\n  assert(nodeElement);\n  bool error(false);\n\n  for (auto *properties = nodeElement->FirstChildElement(\"properties\"); properties != nullptr;\n       properties = properties->NextSiblingElement(\"properties\"))\n  {\n    const char *propertiesfilea(properties->Attribute(\"file\"));\n    std::string propertiesfile(propertiesfilea ? propertiesfilea : \"\");\n\n    const char *renderwindowa(properties->Attribute(\"renderwindow\"));\n    std::string renderwindow(renderwindowa ? renderwindowa : \"\");\n\n    PropertyList::Pointer propertyList =\n      node->GetPropertyList(renderwindow); \/\/ DataNode implementation always returns a propertylist\n    ClearNodePropertyListWithExceptions(*node, *propertyList);\n\n    \/\/ use deserializer to construct new properties\n    PropertyListDeserializer::Pointer deserializer = PropertyListDeserializer::New();\n\n    deserializer->SetFilename(workingDirectory + Poco::Path::separator() + propertiesfile);\n    bool success = deserializer->Deserialize();\n    error |= !success;\n    PropertyList::Pointer readProperties = deserializer->GetOutput();\n\n    if (readProperties.IsNotNull())\n    {\n      propertyList->ConcatenatePropertyList(readProperties, true); \/\/ true = replace\n    }\n    else\n    {\n      MITK_ERROR << \"Property list reader did not return a property list. This is an implementation error. Please tell \"\n                    \"your developer.\";\n      error = true;\n    }\n  }\n\n  return !error;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ Copyright 2018 Pinterest 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 bol (bol@pinterest.com)\n\/\/\n\n#include \"rocksdb_admin\/helix_client.h\"\n\n#include \"jni.h\"\n\n#include <chrono>\n#include <thread>\n#include <glog\/logging.h>\n\n#include \"common\/network_util.h\"\n\nDECLARE_int32(port);\n\nnamespace {\n\nJNIEnv* createVM(const std::string& class_path) {\n  JavaVM* jvm;\n  JNIEnv* env;\n  JavaVMInitArgs args;\n  JavaVMOption options[3];\n\n  args.version = JNI_VERSION_1_6;\n  args.nOptions = 2;\n  const std::string env_class_path = std::getenv(\"CLASSPATH\");\n  auto class_opt = \"-Djava.class.path=\" + class_path +\n      \"cluster_management-0.0.1-SNAPSHOT-jar-with-dependencies.jar\" +\n      env_class_path;\n  LOG(INFO) << \"classpath=\" << class_opt;\n  options[0].optionString = const_cast<char*>(class_opt.c_str());\n  options[1].optionString = \"-verbose:jni\";\n  \/\/ use -Xrs to block JVM signal handling, so graceful shutdown still works\n  options[2].optionString = \"-Xrs\";\n\n  args.options = options;\n  args.ignoreUnrecognized = false;\n\n  auto ret = JNI_CreateJavaVM(&jvm, (void **)&env, &args);\n  CHECK(ret == JNI_OK) << \"Failed to create JVM: \" << ret;\n  return env;\n}\n\nvoid invokeClass(JNIEnv* env,\n                 const std::string& zk_connect_str,\n                 const std::string& cluster,\n                 const std::string& state_model_type,\n                 const std::string& domain,\n                 const std::string& config_post_url) {\n  jclass ParticipantClass;\n  jmethodID mainMethod;\n  jobjectArray args;\n\n  ParticipantClass = env->FindClass(\"com\/pinterest\/rocksplicator\/Participant\");\n  if (!ParticipantClass) {\n    env->ExceptionDescribe();\n    CHECK(false);\n  }\n\n  mainMethod = env->GetStaticMethodID(ParticipantClass,\n                                      \"main\",\n                                      \"([Ljava\/lang\/String;)V\");\n\n  args = env->NewObjectArray(14, env->FindClass(\"java\/lang\/String\"), nullptr);\n\n  env->SetObjectArrayElement(args, 0, env->NewStringUTF(\"--zkSvr\"));\n  env->SetObjectArrayElement(\n    args, 1, env->NewStringUTF(zk_connect_str.c_str()));\n  env->SetObjectArrayElement(args, 2, env->NewStringUTF(\"--cluster\"));\n  env->SetObjectArrayElement(args, 3, env->NewStringUTF(cluster.c_str()));\n  env->SetObjectArrayElement(args, 4, env->NewStringUTF(\"--host\"));\n  auto ip = common::getLocalIPAddress();\n  env->SetObjectArrayElement(args, 5, env->NewStringUTF(ip.c_str()));\n  env->SetObjectArrayElement(args, 6, env->NewStringUTF(\"--port\"));\n  auto port = std::to_string(FLAGS_port);\n  env->SetObjectArrayElement(args, 7, env->NewStringUTF(port.c_str()));\n  env->SetObjectArrayElement(args, 8, env->NewStringUTF(\"--stateModelType\"));\n  env->SetObjectArrayElement(\n    args, 9, env->NewStringUTF(state_model_type.c_str()));\n  env->SetObjectArrayElement(args, 10, env->NewStringUTF(\"--domain\"));\n  env->SetObjectArrayElement(args, 11, env->NewStringUTF(domain.c_str()));\n  env->SetObjectArrayElement(args, 12, env->NewStringUTF(\"--configPostUrl\"));\n  env->SetObjectArrayElement(args, 13,\n                             env->NewStringUTF(config_post_url.c_str()));\n\n  env->CallStaticVoidMethod(ParticipantClass, mainMethod, args);\n\n  \/\/ The participant main function should never exit\n  env->ExceptionDescribe();\n  CHECK(false) << \"Participant main() exited\";\n}\n\n}\n\nnamespace admin {\n\nvoid JoinCluster(const std::string& zk_connect_str,\n                 const std::string& cluster,\n                 const std::string& state_model_type,\n                 const std::string& domain,\n                 const std::string& class_path,\n                 const std::string& config_post_url) {\n  std::thread t([zk_connect_str, cluster, state_model_type, domain,\n                 class_path, config_post_url] () {\n      \/\/ FIXME use a more reliable way to ensure the thread calling JoinCluster\n      \/\/ has time to start the thrift server.\n      std::this_thread::sleep_for(std::chrono::seconds(10));\n\n      auto env = createVM(class_path);\n      invokeClass(env, zk_connect_str, cluster, state_model_type, domain,\n                  config_post_url);\n    });\n\n  t.detach();\n\n  LOG(INFO) << \"Launching JVM and starting Helix participant\";\n}\n\n}  \/\/ namespace admin\n<commit_msg>fix nOptions and edit comment<commit_after>\/\/\/ Copyright 2018 Pinterest 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 bol (bol@pinterest.com)\n\/\/\n\n#include \"rocksdb_admin\/helix_client.h\"\n\n#include \"jni.h\"\n\n#include <chrono>\n#include <thread>\n#include <glog\/logging.h>\n\n#include \"common\/network_util.h\"\n\nDECLARE_int32(port);\n\nnamespace {\n\nJNIEnv* createVM(const std::string& class_path) {\n  JavaVM* jvm;\n  JNIEnv* env;\n  JavaVMInitArgs args;\n  JavaVMOption options[3];\n\n  args.version = JNI_VERSION_1_6;\n  args.nOptions = 3;\n  const std::string env_class_path = std::getenv(\"CLASSPATH\");\n  auto class_opt = \"-Djava.class.path=\" + class_path +\n      \"cluster_management-0.0.1-SNAPSHOT-jar-with-dependencies.jar\" +\n      env_class_path;\n  LOG(INFO) << \"classpath=\" << class_opt;\n  options[0].optionString = const_cast<char*>(class_opt.c_str());\n  options[1].optionString = \"-verbose:jni\";\n  \/\/ use -Xrs to block JVM signal handling\n  options[2].optionString = \"-Xrs\";\n\n  args.options = options;\n  args.ignoreUnrecognized = false;\n\n  auto ret = JNI_CreateJavaVM(&jvm, (void **)&env, &args);\n  CHECK(ret == JNI_OK) << \"Failed to create JVM: \" << ret;\n  return env;\n}\n\nvoid invokeClass(JNIEnv* env,\n                 const std::string& zk_connect_str,\n                 const std::string& cluster,\n                 const std::string& state_model_type,\n                 const std::string& domain,\n                 const std::string& config_post_url) {\n  jclass ParticipantClass;\n  jmethodID mainMethod;\n  jobjectArray args;\n\n  ParticipantClass = env->FindClass(\"com\/pinterest\/rocksplicator\/Participant\");\n  if (!ParticipantClass) {\n    env->ExceptionDescribe();\n    CHECK(false);\n  }\n\n  mainMethod = env->GetStaticMethodID(ParticipantClass,\n                                      \"main\",\n                                      \"([Ljava\/lang\/String;)V\");\n\n  args = env->NewObjectArray(14, env->FindClass(\"java\/lang\/String\"), nullptr);\n\n  env->SetObjectArrayElement(args, 0, env->NewStringUTF(\"--zkSvr\"));\n  env->SetObjectArrayElement(\n    args, 1, env->NewStringUTF(zk_connect_str.c_str()));\n  env->SetObjectArrayElement(args, 2, env->NewStringUTF(\"--cluster\"));\n  env->SetObjectArrayElement(args, 3, env->NewStringUTF(cluster.c_str()));\n  env->SetObjectArrayElement(args, 4, env->NewStringUTF(\"--host\"));\n  auto ip = common::getLocalIPAddress();\n  env->SetObjectArrayElement(args, 5, env->NewStringUTF(ip.c_str()));\n  env->SetObjectArrayElement(args, 6, env->NewStringUTF(\"--port\"));\n  auto port = std::to_string(FLAGS_port);\n  env->SetObjectArrayElement(args, 7, env->NewStringUTF(port.c_str()));\n  env->SetObjectArrayElement(args, 8, env->NewStringUTF(\"--stateModelType\"));\n  env->SetObjectArrayElement(\n    args, 9, env->NewStringUTF(state_model_type.c_str()));\n  env->SetObjectArrayElement(args, 10, env->NewStringUTF(\"--domain\"));\n  env->SetObjectArrayElement(args, 11, env->NewStringUTF(domain.c_str()));\n  env->SetObjectArrayElement(args, 12, env->NewStringUTF(\"--configPostUrl\"));\n  env->SetObjectArrayElement(args, 13,\n                             env->NewStringUTF(config_post_url.c_str()));\n\n  env->CallStaticVoidMethod(ParticipantClass, mainMethod, args);\n\n  \/\/ The participant main function should never exit\n  env->ExceptionDescribe();\n  CHECK(false) << \"Participant main() exited\";\n}\n\n}\n\nnamespace admin {\n\nvoid JoinCluster(const std::string& zk_connect_str,\n                 const std::string& cluster,\n                 const std::string& state_model_type,\n                 const std::string& domain,\n                 const std::string& class_path,\n                 const std::string& config_post_url) {\n  std::thread t([zk_connect_str, cluster, state_model_type, domain,\n                 class_path, config_post_url] () {\n      \/\/ FIXME use a more reliable way to ensure the thread calling JoinCluster\n      \/\/ has time to start the thrift server.\n      std::this_thread::sleep_for(std::chrono::seconds(10));\n\n      auto env = createVM(class_path);\n      invokeClass(env, zk_connect_str, cluster, state_model_type, domain,\n                  config_post_url);\n    });\n\n  t.detach();\n\n  LOG(INFO) << \"Launching JVM and starting Helix participant\";\n}\n\n}  \/\/ namespace admin\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"serialization.h\"\n\nusing namespace std;\n\nclass SerializationTest : public ::testing::Test {\n    void SetUp() {\n        game.id = \"ABCD-1234\";\n        game.player1 = \"player1\";\n        game.player2 = \"player2\";\n        game.status = Game::Status::PLAYER1_SETTING_UP;\n    }\nprotected:\n    Serializer serializer;\n    Game game;\n};\n\nTEST_F(SerializationTest, serializes_game_id) {\n    auto serialized = serializer.from(game);\n    auto deserialized = serializer.to_game(serialized);\n\n    ASSERT_EQ(game.id, deserialized.id);\n}\n\nTEST_F(SerializationTest, serializes_player1) {\n    auto serialized = serializer.from(game);\n    auto deserialized = serializer.to_game(serialized);\n\n    ASSERT_EQ(game.player1, deserialized.player1);\n}\n\nTEST_F(SerializationTest, serializes_player2) {\n    auto serialized = serializer.from(game);\n    auto deserialized = serializer.to_game(serialized);\n\n    ASSERT_EQ(game.player2, deserialized.player2);\n}\n\nTEST_F(SerializationTest, serializes_status) {\n    auto serialized = serializer.from(game);\n    auto deserialized = serializer.to_game(serialized);\n\n    ASSERT_EQ(game.status, deserialized.status);\n}\n<commit_msg>Adding Profile tests<commit_after>#include \"gtest\/gtest.h\"\n#include \"serialization.h\"\n\nusing namespace std;\n\nclass SerializationTest : public ::testing::Test {\n    void SetUp() {\n        game.id = \"ABCD-1234\";\n        game.player1 = \"player1\";\n        game.player2 = \"player2\";\n        game.status = Game::Status::PLAYER1_SETTING_UP;\n\n        profile.id = \"BCDE-2345\";\n        profile.name = \"player name\";\n        profile.password = \"plaintext password\";\n    }\nprotected:\n    Serializer serializer;\n    Game game;\n    Profile profile;\n};\n\nTEST_F(SerializationTest, serializes_profile_id) {\n    auto serialized = serializer.from(profile);\n    auto deserialized = serializer.to_profile(serialized);\n\n    ASSERT_EQ(profile.id, deserialized.id);\n}\n\nTEST_F(SerializationTest, serializes_profile_name) {\n    auto serialized = serializer.from(profile);\n    auto deserialized = serializer.to_profile(serialized);\n\n    ASSERT_EQ(profile.name, deserialized.name);\n}\n\nTEST_F(SerializationTest, serializes_profile_password) {\n    auto serialized = serializer.from(profile);\n    auto deserialized = serializer.to_profile(serialized);\n\n    ASSERT_EQ(profile.password, deserialized.password);\n}\n\nTEST_F(SerializationTest, serializes_game_id) {\n    auto serialized = serializer.from(game);\n    auto deserialized = serializer.to_game(serialized);\n\n    ASSERT_EQ(game.id, deserialized.id);\n}\n\nTEST_F(SerializationTest, serializes_player1) {\n    auto serialized = serializer.from(game);\n    auto deserialized = serializer.to_game(serialized);\n\n    ASSERT_EQ(game.player1, deserialized.player1);\n}\n\nTEST_F(SerializationTest, serializes_player2) {\n    auto serialized = serializer.from(game);\n    auto deserialized = serializer.to_game(serialized);\n\n    ASSERT_EQ(game.player2, deserialized.player2);\n}\n\nTEST_F(SerializationTest, serializes_status) {\n    auto serialized = serializer.from(game);\n    auto deserialized = serializer.to_game(serialized);\n\n    ASSERT_EQ(game.status, deserialized.status);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: accessibleselectionhelper.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 17:08: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_comphelper.hxx\"\n\n#ifndef COMPHELPER_ACCESSIBLE_SELECTION_HELPER_HXX\n#include <comphelper\/accessibleselectionhelper.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::awt;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::accessibility;\n\n    \/\/=====================================================================\n    \/\/= OCommonAccessibleSelection\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    OCommonAccessibleSelection::OCommonAccessibleSelection( )\n    {\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OCommonAccessibleSelection::selectAccessibleChild( sal_Int32 nChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        implSelect( nChildIndex, sal_True );\n    }\n\n    \/\/--------------------------------------------------------------------\n    sal_Bool SAL_CALL OCommonAccessibleSelection::isAccessibleChildSelected( sal_Int32 nChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        return( implIsSelected( nChildIndex ) );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OCommonAccessibleSelection::clearAccessibleSelection(  ) throw (RuntimeException)\n    {\n        implSelect( ACCESSIBLE_SELECTION_CHILD_ALL, sal_False );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OCommonAccessibleSelection::selectAllAccessibleChildren(  ) throw (RuntimeException)\n    {\n        implSelect( ACCESSIBLE_SELECTION_CHILD_ALL, sal_True );\n    }\n\n    \/\/--------------------------------------------------------------------\n    sal_Int32 SAL_CALL OCommonAccessibleSelection::getSelectedAccessibleChildCount(  ) throw (RuntimeException)\n    {\n        sal_Int32                       nRet = 0;\n        Reference< XAccessibleContext > xParentContext( implGetAccessibleContext() );\n\n        OSL_ENSURE( xParentContext.is(), \"OCommonAccessibleSelection::getSelectedAccessibleChildCount: no parent context!\" );\n\n        if( xParentContext.is() )\n        {\n            for( sal_Int32 i = 0, nChildCount = xParentContext->getAccessibleChildCount(); i < nChildCount; i++ )\n                if( implIsSelected( i ) )\n                    ++nRet;\n        }\n\n        return( nRet );\n    }\n\n    \/\/--------------------------------------------------------------------\n    Reference< XAccessible > SAL_CALL OCommonAccessibleSelection::getSelectedAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        Reference< XAccessible >        xRet;\n        Reference< XAccessibleContext > xParentContext( implGetAccessibleContext() );\n\n        OSL_ENSURE( xParentContext.is(), \"OCommonAccessibleSelection::getSelectedAccessibleChildCount: no parent context!\" );\n\n        if( xParentContext.is() )\n        {\n            for( sal_Int32 i = 0, nChildCount = xParentContext->getAccessibleChildCount(), nPos = 0; ( i < nChildCount ) && !xRet.is(); i++ )\n                if( implIsSelected( i ) && ( nPos++ == nSelectedChildIndex ) )\n                    xRet = xParentContext->getAccessibleChild( i );\n        }\n\n        return( xRet );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OCommonAccessibleSelection::deselectAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        implSelect( nSelectedChildIndex, sal_False );\n    }\n\n    \/\/=====================================================================\n    \/\/= OAccessibleSelectionHelper\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    OAccessibleSelectionHelper::OAccessibleSelectionHelper( )\n    {\n    }\n\n    \/\/--------------------------------------------------------------------\n    OAccessibleSelectionHelper::OAccessibleSelectionHelper( IMutex* _pExternalLock ) : OAccessibleComponentHelper(_pExternalLock)\n    {\n    }\n\n    \/\/--------------------------------------------------------------------\n    IMPLEMENT_FORWARD_XINTERFACE2( OAccessibleSelectionHelper, OAccessibleComponentHelper, OAccessibleSelectionHelper_Base )\n    IMPLEMENT_FORWARD_XTYPEPROVIDER2( OAccessibleSelectionHelper, OAccessibleComponentHelper, OAccessibleSelectionHelper_Base )\n    \/\/ (order matters: the first is the class name, the second is the class doing the ref counting)\n\n    \/\/--------------------------------------------------------------------\n    Reference< XAccessibleContext > OAccessibleSelectionHelper::implGetAccessibleContext() throw ( RuntimeException )\n    {\n        return( this );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OAccessibleSelectionHelper::selectAccessibleChild( sal_Int32 nChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        OCommonAccessibleSelection::selectAccessibleChild( nChildIndex );\n    }\n\n    \/\/--------------------------------------------------------------------\n    sal_Bool SAL_CALL OAccessibleSelectionHelper::isAccessibleChildSelected( sal_Int32 nChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        return( OCommonAccessibleSelection::isAccessibleChildSelected( nChildIndex ) );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OAccessibleSelectionHelper::clearAccessibleSelection(  ) throw (RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        OCommonAccessibleSelection::clearAccessibleSelection();\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OAccessibleSelectionHelper::selectAllAccessibleChildren(  ) throw (RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        OCommonAccessibleSelection::selectAllAccessibleChildren();\n    }\n\n    \/\/--------------------------------------------------------------------\n    sal_Int32 SAL_CALL OAccessibleSelectionHelper::getSelectedAccessibleChildCount(  ) throw (RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        return( OCommonAccessibleSelection::getSelectedAccessibleChildCount() );\n    }\n\n    \/\/--------------------------------------------------------------------\n    Reference< XAccessible > SAL_CALL OAccessibleSelectionHelper::getSelectedAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        return( OCommonAccessibleSelection::getSelectedAccessibleChild( nSelectedChildIndex ) );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OAccessibleSelectionHelper::deselectAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        OCommonAccessibleSelection::deselectAccessibleChild( nSelectedChildIndex );\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace comphelper\n\/\/.........................................................................\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.7.160); FILE MERGED 2008\/04\/01 12:26:29 thb 1.7.160.2: #i85898# Stripping all external header guards 2008\/03\/31 12:19:32 rt 1.7.160.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: accessibleselectionhelper.cxx,v $\n * $Revision: 1.8 $\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_comphelper.hxx\"\n#include <comphelper\/accessibleselectionhelper.hxx>\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::awt;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::accessibility;\n\n    \/\/=====================================================================\n    \/\/= OCommonAccessibleSelection\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    OCommonAccessibleSelection::OCommonAccessibleSelection( )\n    {\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OCommonAccessibleSelection::selectAccessibleChild( sal_Int32 nChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        implSelect( nChildIndex, sal_True );\n    }\n\n    \/\/--------------------------------------------------------------------\n    sal_Bool SAL_CALL OCommonAccessibleSelection::isAccessibleChildSelected( sal_Int32 nChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        return( implIsSelected( nChildIndex ) );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OCommonAccessibleSelection::clearAccessibleSelection(  ) throw (RuntimeException)\n    {\n        implSelect( ACCESSIBLE_SELECTION_CHILD_ALL, sal_False );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OCommonAccessibleSelection::selectAllAccessibleChildren(  ) throw (RuntimeException)\n    {\n        implSelect( ACCESSIBLE_SELECTION_CHILD_ALL, sal_True );\n    }\n\n    \/\/--------------------------------------------------------------------\n    sal_Int32 SAL_CALL OCommonAccessibleSelection::getSelectedAccessibleChildCount(  ) throw (RuntimeException)\n    {\n        sal_Int32                       nRet = 0;\n        Reference< XAccessibleContext > xParentContext( implGetAccessibleContext() );\n\n        OSL_ENSURE( xParentContext.is(), \"OCommonAccessibleSelection::getSelectedAccessibleChildCount: no parent context!\" );\n\n        if( xParentContext.is() )\n        {\n            for( sal_Int32 i = 0, nChildCount = xParentContext->getAccessibleChildCount(); i < nChildCount; i++ )\n                if( implIsSelected( i ) )\n                    ++nRet;\n        }\n\n        return( nRet );\n    }\n\n    \/\/--------------------------------------------------------------------\n    Reference< XAccessible > SAL_CALL OCommonAccessibleSelection::getSelectedAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        Reference< XAccessible >        xRet;\n        Reference< XAccessibleContext > xParentContext( implGetAccessibleContext() );\n\n        OSL_ENSURE( xParentContext.is(), \"OCommonAccessibleSelection::getSelectedAccessibleChildCount: no parent context!\" );\n\n        if( xParentContext.is() )\n        {\n            for( sal_Int32 i = 0, nChildCount = xParentContext->getAccessibleChildCount(), nPos = 0; ( i < nChildCount ) && !xRet.is(); i++ )\n                if( implIsSelected( i ) && ( nPos++ == nSelectedChildIndex ) )\n                    xRet = xParentContext->getAccessibleChild( i );\n        }\n\n        return( xRet );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OCommonAccessibleSelection::deselectAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        implSelect( nSelectedChildIndex, sal_False );\n    }\n\n    \/\/=====================================================================\n    \/\/= OAccessibleSelectionHelper\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    OAccessibleSelectionHelper::OAccessibleSelectionHelper( )\n    {\n    }\n\n    \/\/--------------------------------------------------------------------\n    OAccessibleSelectionHelper::OAccessibleSelectionHelper( IMutex* _pExternalLock ) : OAccessibleComponentHelper(_pExternalLock)\n    {\n    }\n\n    \/\/--------------------------------------------------------------------\n    IMPLEMENT_FORWARD_XINTERFACE2( OAccessibleSelectionHelper, OAccessibleComponentHelper, OAccessibleSelectionHelper_Base )\n    IMPLEMENT_FORWARD_XTYPEPROVIDER2( OAccessibleSelectionHelper, OAccessibleComponentHelper, OAccessibleSelectionHelper_Base )\n    \/\/ (order matters: the first is the class name, the second is the class doing the ref counting)\n\n    \/\/--------------------------------------------------------------------\n    Reference< XAccessibleContext > OAccessibleSelectionHelper::implGetAccessibleContext() throw ( RuntimeException )\n    {\n        return( this );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OAccessibleSelectionHelper::selectAccessibleChild( sal_Int32 nChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        OCommonAccessibleSelection::selectAccessibleChild( nChildIndex );\n    }\n\n    \/\/--------------------------------------------------------------------\n    sal_Bool SAL_CALL OAccessibleSelectionHelper::isAccessibleChildSelected( sal_Int32 nChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        return( OCommonAccessibleSelection::isAccessibleChildSelected( nChildIndex ) );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OAccessibleSelectionHelper::clearAccessibleSelection(  ) throw (RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        OCommonAccessibleSelection::clearAccessibleSelection();\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OAccessibleSelectionHelper::selectAllAccessibleChildren(  ) throw (RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        OCommonAccessibleSelection::selectAllAccessibleChildren();\n    }\n\n    \/\/--------------------------------------------------------------------\n    sal_Int32 SAL_CALL OAccessibleSelectionHelper::getSelectedAccessibleChildCount(  ) throw (RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        return( OCommonAccessibleSelection::getSelectedAccessibleChildCount() );\n    }\n\n    \/\/--------------------------------------------------------------------\n    Reference< XAccessible > SAL_CALL OAccessibleSelectionHelper::getSelectedAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        return( OCommonAccessibleSelection::getSelectedAccessibleChild( nSelectedChildIndex ) );\n    }\n\n    \/\/--------------------------------------------------------------------\n    void SAL_CALL OAccessibleSelectionHelper::deselectAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (IndexOutOfBoundsException, RuntimeException)\n    {\n        OExternalLockGuard aGuard( this );\n        OCommonAccessibleSelection::deselectAccessibleChild( nSelectedChildIndex );\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace comphelper\n\/\/.........................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: condition.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 17:00: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\n#include <salhelper\/condition.hxx>\n\n#ifndef _OSL_TIME_H_\n#include <osl\/time.h>\n#endif\n\n\nusing namespace salhelper;\n\n\n\/******************************************************************\n *                                                                *\n *                     Condition                                  *\n *                                                                *\n ******************************************************************\/\n\nCondition::Condition(osl::Mutex& aMutex)\n    : m_aMutex(aMutex),\n      m_aCondition(osl_createCondition())\n{\n}\n\n\nCondition::~Condition()\n{\n    osl_destroyCondition(m_aCondition);\n}\n\n\n\/******************************************************************\n *                                                                *\n *              ConditionModifier                                 *\n *                                                                *\n ******************************************************************\/\n\nConditionModifier::ConditionModifier(Condition& aCond)\n    : m_aCond(aCond)\n{\n    m_aCond.m_aMutex.acquire();\n}\n\n\nConditionModifier::~ConditionModifier()\n{\n    if(m_aCond.applies())\n        osl_setCondition(m_aCond.m_aCondition);\n\n    m_aCond.m_aMutex.release();\n}\n\n\n\n\/******************************************************************\n *                                                                *\n *              ConditionWaiter                                   *\n *                                                                *\n ******************************************************************\/\n\nConditionWaiter::timedout::timedout() {}\n\nConditionWaiter::timedout::timedout(timedout const &) {}\n\nConditionWaiter::timedout::~timedout() {}\n\nConditionWaiter::timedout &\nConditionWaiter::timedout::operator =(timedout const &) { return *this; }\n\nConditionWaiter::ConditionWaiter(Condition& aCond)\n    : m_aCond(aCond)\n{\n    while(true) {\n        osl_waitCondition(m_aCond.m_aCondition,0);\n        m_aCond.m_aMutex.acquire();\n\n        if(m_aCond.applies())\n            break;\n        else {\n            osl_resetCondition(m_aCond.m_aCondition);\n            m_aCond.m_aMutex.release();\n        }\n    }\n}\n\n\nConditionWaiter::ConditionWaiter(Condition& aCond,sal_uInt32 milliSec)\n    throw(\n        ConditionWaiter::timedout\n    )\n    : m_aCond(aCond)\n{\n    TimeValue aTime;\n    aTime.Seconds = milliSec \/ 1000;\n    aTime.Nanosec = 1000000 * ( milliSec % 1000 );\n\n    while(true) {\n        if( osl_waitCondition(m_aCond.m_aCondition,&aTime) ==\n            osl_cond_result_timeout )\n            throw timedout();\n\n        m_aCond.m_aMutex.acquire();\n\n        if(m_aCond.applies())\n            break;\n        else {\n            osl_resetCondition(m_aCond.m_aCondition);\n            m_aCond.m_aMutex.release();\n        }\n    }\n}\n\n\nConditionWaiter::~ConditionWaiter()\n{\n    if(! m_aCond.applies())\n        osl_resetCondition(m_aCond.m_aCondition);\n    m_aCond.m_aMutex.release();\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.4.62); FILE MERGED 2008\/04\/01 15:25:19 thb 1.4.62.2: #i85898# Stripping all external header guards 2008\/03\/31 07:25:46 rt 1.4.62.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: condition.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#include <salhelper\/condition.hxx>\n#include <osl\/time.h>\n\n\nusing namespace salhelper;\n\n\n\/******************************************************************\n *                                                                *\n *                     Condition                                  *\n *                                                                *\n ******************************************************************\/\n\nCondition::Condition(osl::Mutex& aMutex)\n    : m_aMutex(aMutex),\n      m_aCondition(osl_createCondition())\n{\n}\n\n\nCondition::~Condition()\n{\n    osl_destroyCondition(m_aCondition);\n}\n\n\n\/******************************************************************\n *                                                                *\n *              ConditionModifier                                 *\n *                                                                *\n ******************************************************************\/\n\nConditionModifier::ConditionModifier(Condition& aCond)\n    : m_aCond(aCond)\n{\n    m_aCond.m_aMutex.acquire();\n}\n\n\nConditionModifier::~ConditionModifier()\n{\n    if(m_aCond.applies())\n        osl_setCondition(m_aCond.m_aCondition);\n\n    m_aCond.m_aMutex.release();\n}\n\n\n\n\/******************************************************************\n *                                                                *\n *              ConditionWaiter                                   *\n *                                                                *\n ******************************************************************\/\n\nConditionWaiter::timedout::timedout() {}\n\nConditionWaiter::timedout::timedout(timedout const &) {}\n\nConditionWaiter::timedout::~timedout() {}\n\nConditionWaiter::timedout &\nConditionWaiter::timedout::operator =(timedout const &) { return *this; }\n\nConditionWaiter::ConditionWaiter(Condition& aCond)\n    : m_aCond(aCond)\n{\n    while(true) {\n        osl_waitCondition(m_aCond.m_aCondition,0);\n        m_aCond.m_aMutex.acquire();\n\n        if(m_aCond.applies())\n            break;\n        else {\n            osl_resetCondition(m_aCond.m_aCondition);\n            m_aCond.m_aMutex.release();\n        }\n    }\n}\n\n\nConditionWaiter::ConditionWaiter(Condition& aCond,sal_uInt32 milliSec)\n    throw(\n        ConditionWaiter::timedout\n    )\n    : m_aCond(aCond)\n{\n    TimeValue aTime;\n    aTime.Seconds = milliSec \/ 1000;\n    aTime.Nanosec = 1000000 * ( milliSec % 1000 );\n\n    while(true) {\n        if( osl_waitCondition(m_aCond.m_aCondition,&aTime) ==\n            osl_cond_result_timeout )\n            throw timedout();\n\n        m_aCond.m_aMutex.acquire();\n\n        if(m_aCond.applies())\n            break;\n        else {\n            osl_resetCondition(m_aCond.m_aCondition);\n            m_aCond.m_aMutex.release();\n        }\n    }\n}\n\n\nConditionWaiter::~ConditionWaiter()\n{\n    if(! m_aCond.applies())\n        osl_resetCondition(m_aCond.m_aCondition);\n    m_aCond.m_aMutex.release();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n *                                                                        *\n * Author: Friederike Bock, Lucia Leardini , A. Marin                     *\n * Version 1.0                                                            *\n *                                                                        *\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\/\/This AddTask is supposed to set up the main task\n\/\/($ALIPHYSICS\/PWGGA\/GammaConv\/AliAnalysisTaskMaterialHistos.cxx) for\n\/\/pp together with all supporting classes\n\/\/***************************************************************************************\n\n\/\/***************************************************************************************\n\/\/CutHandler contains all cuts for a certain analysis and trainconfig,\n\/\/it automatically checks length of cutStrings and takes care of the number of added cuts,\n\/\/no specification of the variable 'numberOfCuts' needed anymore.\n\/\/***************************************************************************************\n\nclass CutHandlerConv{\n  public:\n    CutHandlerConv(Int_t nMax=10){\n      nCuts=0; nMaxCuts=nMax; validCuts = true;\n      eventCutArray = new TString[nMaxCuts]; photonCutArray = new TString[nMaxCuts]; mesonCutArray = new TString[nMaxCuts]; clusterCutArray = new TString[nMaxCuts];\n      for(Int_t i=0; i<nMaxCuts; i++) {eventCutArray[i] = \"\"; photonCutArray[i] = \"\"; mesonCutArray[i] = \"\"; clusterCutArray[i] = \"\";}\n    }\n    void AddCut(TString eventCut, TString photonCut){\n      if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n      if( eventCut.Length()!=8 || photonCut.Length()!=26  ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n      eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=\"\"; clusterCutArray[nCuts]=\"\";\n      nCuts++;\n      return;\n    }\n    void AddCut(TString eventCut, TString photonCut, TString mesonCut){\n      if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n      if( eventCut.Length()!=8 || photonCut.Length()!=26 || mesonCut.Length()!=16 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n      eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=mesonCut; clusterCutArray[nCuts]=\"\";\n      nCuts++;\n      return;\n    }\n    void AddCut(TString eventCut, TString photonCut, TString mesonCut, TString clusterCut){\n      if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n      if( eventCut.Length()!=8 || photonCut.Length()!=26 || mesonCut.Length()!=16 || clusterCut.Length()!=19 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n      eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=mesonCut; clusterCutArray[nCuts]=clusterCut;\n      nCuts++;\n      return;\n    }\n\n    Bool_t AreValid(){return validCuts;}\n    Int_t GetNCuts(){if(validCuts) return nCuts; else return 0;}\n    TString GetEventCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return eventCutArray[i]; else{cout << \"ERROR in CutHandlerConv: GetEventCut wrong index i\" << endl;return \"\";}}\n    TString GetPhotonCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return photonCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetPhotonCut wrong index i\" << endl;return \"\";}}\n    TString GetMesonCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return mesonCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetMesonCut wrong index i\" << endl;return \"\";}}\n    TString GetClusterCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return clusterCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetClusterCut wrong index i\" << endl;return \"\";}}\n  private:\n    Bool_t validCuts;\n    Int_t nCuts; Int_t nMaxCuts;\n    TString* eventCutArray;\n    TString* photonCutArray;\n    TString* mesonCutArray;\n    TString* clusterCutArray;\n};\n\n\n\nvoid AddTask_MaterialHistos_PbPb(\tInt_t   trainConfig                 = 1,                    \/\/ change different set of cuts\n                Int_t \tisMC \t\t\t\t= 0,\n\t\t\t\tTString periodname                      = \"LHC10b\",           \/\/ period name\n\t\t\t\tTString periodNameV0Reader              = \"\",\n\t\t\t\tTString periodNameAnchor                = \"\",\n\t\t\t\tBool_t \tenableV0findingEffi \t\t= kFALSE             \t\/\/ enables V0finding efficiency histograms\n\t\t\t\t){\n  \n  Int_t IsHeavyIon = 1;\n  \/\/ ================== GetAnalysisManager ===============================\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) {\n    Error(Form(\"AddTask_GammaConvV1_%i\",trainConfig), \"No analysis manager found.\");\n    return ;\n  }\n  \n  \/\/ ================== GetInputEventHandler =============================\n  AliVEventHandler *inputHandler=mgr->GetInputEventHandler();\n  Bool_t isMCForOtherSettings = 0;\n  if (isMC > 0) isMCForOtherSettings = 1;\n  \/\/========= Add PID Reponse to ANALYSIS manager ====\n  if(!(AliPIDResponse*)mgr->GetTask(\"PIDResponseTask\")){\n    gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPIDResponse.C\");\n    AddTaskPIDResponse(isMCForOtherSettings);\n  }\n  \n  \/\/=========  Set Cutnumber for V0Reader ================================\n  TString cutnumberPhoton = \"00000000000000000500000000\";\n  TString cutnumberEvent = \"10000003\";\n  AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n\n\n  Bool_t  enableConstructGamma=kFALSE;\n  if (trainConfig>200){\n    enableConstructGamma=kTRUE;\n  }\n  if (trainConfig>100 && trainConfig<200 ){\n    cutnumberPhoton = \"10000000000000000500000000\";\n  }\n\n\n  \n  \/\/========= Add V0 Reader to  ANALYSIS manager if not yet existent =====\n  TString V0ReaderName = Form(\"V0ReaderV1_%s_%s\",cutnumberEvent.Data(),cutnumberPhoton.Data());\n  if( !(AliV0ReaderV1*)mgr->GetTask(V0ReaderName.Data()) ){\n    AliV0ReaderV1 *fV0ReaderV1 = new AliV0ReaderV1(V0ReaderName.Data());\n    if (periodNameV0Reader.CompareTo(\"\") != 0) fV0ReaderV1->SetPeriodName(periodNameV0Reader);\n    fV0ReaderV1->SetUseOwnXYZCalculation(kTRUE);\n    fV0ReaderV1->SetUseConstructGamma(enableConstructGamma);\n    fV0ReaderV1->SetCreateAODs(kFALSE);\/\/ AOD Output\n    fV0ReaderV1->SetUseAODConversionPhoton(kTRUE);\n    fV0ReaderV1->SetProduceV0FindingEfficiency(enableV0findingEffi);\n    if (!mgr) {\n      Error(\"AddTask_V0ReaderV1\", \"No analysis manager found.\");\n      return;\n    }\n    \n    AliConvEventCuts *fEventCuts=NULL;\n    if(cutnumberEvent!=\"\"){\n      fEventCuts= new AliConvEventCuts(cutnumberEvent.Data(),cutnumberEvent.Data());\n      fEventCuts->SetPreSelectionCutFlag(kTRUE);\n      fEventCuts->SetV0ReaderName(V0ReaderName);\n      if(fEventCuts->InitializeCutsFromCutString(cutnumberEvent.Data())){\n        fV0ReaderV1->SetEventCuts(fEventCuts);\n        fEventCuts->SetFillCutHistograms(\"\",kTRUE);\n      }\n    }\n    \n    \/\/ Set AnalysisCut Number\n    AliConversionPhotonCuts *fCuts=NULL;\n    if(cutnumberPhoton!=\"\"){\n      fCuts= new AliConversionPhotonCuts(cutnumberPhoton.Data(),cutnumberPhoton.Data());\n      fCuts->SetPreSelectionCutFlag(kTRUE);\n      fCuts->SetIsHeavyIon(IsHeavyIon);\n      fCuts->SetV0ReaderName(V0ReaderName);\n      if(fCuts->InitializeCutsFromCutString(cutnumberPhoton.Data())){\n        fV0ReaderV1->SetConversionCuts(fCuts);\n        fCuts->SetFillCutHistograms(\"\",kTRUE);\n      }\n    }\n    \n    \n    if(inputHandler->IsA()==AliAODInputHandler::Class()){\n      \/\/ AOD mode\n      fV0ReaderV1->SetDeltaAODBranchName(Form(\"GammaConv_%s_gamma\",cutnumberAODBranch.Data()));\n    }\n    fV0ReaderV1->Init();\n    \n    AliLog::SetGlobalLogLevel(AliLog::kInfo);\n    \n    \/\/connect input V0Reader\n    mgr->AddTask(fV0ReaderV1);\n    mgr->ConnectInput(fV0ReaderV1,0,cinput);\n    \n  } else {\n    Error(\"AddTask_V0ReaderV1\", \"Cannot execute AddTask, V0ReaderV1 already exists.\");\n  }   \n\n  \/\/================================================\n  \/\/========= Add task to the ANALYSIS manager =====\n  \/\/            find input container\n\n\n  AliAnalysisTaskMaterialHistos *fMaterialHistos=NULL;\n  fMaterialHistos= new AliAnalysisTaskMaterialHistos(Form(\"MaterialHistos_%i\",trainConfig));\n  fMaterialHistos->SetIsMC(isMC);\n  fMaterialHistos->SetIsHeavyIon(IsHeavyIon);\n  fMaterialHistos->SetV0ReaderName(V0ReaderName);\n\n  CutHandlerConv cuts;\n   if(trainConfig == 1){\n     cuts.AddCut(\"50000013\", \"00000009247602008250404000\"); \/\/ kMB, V0M, std cuts\n  } else  if(trainConfig == 2){\n     cuts.AddCut(\"50000013\", \"00000070000000000500004000\"); \/\/ kMB, V0M, open cuts\n\n    \/\/ Offline V0Finder is used\n\n  } else  if(trainConfig == 101){\n    cuts.AddCut(\"20010103\", \"10000009247602008250404000\");  \/\/INT7, CL1\n\n  }else {\n    Error(Form(\"GammaConvV1_%i\",trainConfig), \"wrong trainConfig variable no cuts have been specified for the configuration\");\n    return;\n  }\n  \n\tif(!cuts.AreValid()){\n    cout << \"\\n\\n****************************************************\" << endl;\n    cout << \"ERROR: No valid cuts stored in CutHandlerConv! Returning...\" << endl;\n    cout << \"****************************************************\\n\\n\" << endl;\n    return;\n  }\n\n  Int_t numberOfCuts = cuts.GetNCuts(); \n   \n  TList *EventCutList = new TList();\n  TList *ConvCutList = new TList();\n\n \n  EventCutList->SetOwner(kTRUE);\n  AliConvEventCuts **analysisEventCuts        = new AliConvEventCuts*[numberOfCuts];\n  ConvCutList->SetOwner(kTRUE);\n  AliConversionPhotonCuts **analysisCuts      = new AliConversionPhotonCuts*[numberOfCuts];\n  for(Int_t i = 0; i<numberOfCuts; i++){\n    analysisEventCuts[i]          = new AliConvEventCuts();\n    analysisEventCuts[i]->InitializeCutsFromCutString((cuts.GetEventCut(i)).Data());\n    analysisEventCuts[i]->SetV0ReaderName(V0ReaderName);\n    EventCutList->Add(analysisEventCuts[i]);\n    analysisEventCuts[i]->SetFillCutHistograms(\"\",kTRUE);\n\n    analysisCuts[i]               = new AliConversionPhotonCuts();\n    analysisCuts[i]->InitializeCutsFromCutString((cuts.GetPhotonCut(i)).Data());\n    analysisCuts[i]->SetV0ReaderName(V0ReaderName);\n    ConvCutList->Add(analysisCuts[i]);\n    analysisCuts[i]->SetFillCutHistograms(\"\",kTRUE);\n    \n   }\n\n\n\n\n  fMaterialHistos->SetEventCutList(numberOfCuts,EventCutList);   \n  fMaterialHistos->SetConversionCutList(numberOfCuts,ConvCutList);\n  mgr->AddTask(fMaterialHistos);\n\n   \n  AliAnalysisDataContainer *coutput =\n    mgr->CreateContainer(Form(\"GammaConvMaterial_%i\",trainConfig), TList::Class(), \n\t\t\t AliAnalysisManager::kOutputContainer,Form(\"GammaConv_Material_%i.root\",trainConfig ));\n\n  mgr->ConnectInput(fMaterialHistos,  0, cinput );\n  mgr->ConnectOutput(fMaterialHistos,  1, coutput);\n  \/\/connect containers\n\treturn;\n}\n<commit_msg>Added trainconfig for material budget studies in PbPb<commit_after>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n *                                                                        *\n * Author: Friederike Bock, Lucia Leardini , A. Marin                     *\n * Version 1.0                                                            *\n *                                                                        *\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\/\/This AddTask is supposed to set up the main task\n\/\/($ALIPHYSICS\/PWGGA\/GammaConv\/AliAnalysisTaskMaterialHistos.cxx) for\n\/\/pp together with all supporting classes\n\/\/***************************************************************************************\n\n\/\/***************************************************************************************\n\/\/CutHandler contains all cuts for a certain analysis and trainconfig,\n\/\/it automatically checks length of cutStrings and takes care of the number of added cuts,\n\/\/no specification of the variable 'numberOfCuts' needed anymore.\n\/\/***************************************************************************************\n\nclass CutHandlerConv{\n  public:\n    CutHandlerConv(Int_t nMax=10){\n      nCuts=0; nMaxCuts=nMax; validCuts = true;\n      eventCutArray = new TString[nMaxCuts]; photonCutArray = new TString[nMaxCuts]; mesonCutArray = new TString[nMaxCuts]; clusterCutArray = new TString[nMaxCuts];\n      for(Int_t i=0; i<nMaxCuts; i++) {eventCutArray[i] = \"\"; photonCutArray[i] = \"\"; mesonCutArray[i] = \"\"; clusterCutArray[i] = \"\";}\n    }\n    void AddCut(TString eventCut, TString photonCut){\n      if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n      if( eventCut.Length()!=8 || photonCut.Length()!=26  ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n      eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=\"\"; clusterCutArray[nCuts]=\"\";\n      nCuts++;\n      return;\n    }\n    void AddCut(TString eventCut, TString photonCut, TString mesonCut){\n      if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n      if( eventCut.Length()!=8 || photonCut.Length()!=26 || mesonCut.Length()!=16 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n      eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=mesonCut; clusterCutArray[nCuts]=\"\";\n      nCuts++;\n      return;\n    }\n    void AddCut(TString eventCut, TString photonCut, TString mesonCut, TString clusterCut){\n      if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n      if( eventCut.Length()!=8 || photonCut.Length()!=26 || mesonCut.Length()!=16 || clusterCut.Length()!=19 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n      eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=mesonCut; clusterCutArray[nCuts]=clusterCut;\n      nCuts++;\n      return;\n    }\n\n    Bool_t AreValid(){return validCuts;}\n    Int_t GetNCuts(){if(validCuts) return nCuts; else return 0;}\n    TString GetEventCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return eventCutArray[i]; else{cout << \"ERROR in CutHandlerConv: GetEventCut wrong index i\" << endl;return \"\";}}\n    TString GetPhotonCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return photonCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetPhotonCut wrong index i\" << endl;return \"\";}}\n    TString GetMesonCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return mesonCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetMesonCut wrong index i\" << endl;return \"\";}}\n    TString GetClusterCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return clusterCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetClusterCut wrong index i\" << endl;return \"\";}}\n  private:\n    Bool_t validCuts;\n    Int_t nCuts; Int_t nMaxCuts;\n    TString* eventCutArray;\n    TString* photonCutArray;\n    TString* mesonCutArray;\n    TString* clusterCutArray;\n};\n\n\n\/\/***************************************************************************************\n\/\/main function\n\/\/***************************************************************************************\nvoid AddTask_MaterialHistos_PbPb(\tInt_t   trainConfig             = 1,        \/\/ change different set of cuts\n                                    Int_t \tisMC \t\t\t\t    = 0,\n                                    TString periodname              = \"LHC10b\", \/\/ period name\n                                    TString periodNameV0Reader      = \"\",\n                                    TString periodNameAnchor        = \"\",\n                                    Bool_t \tenableV0findingEffi \t= kFALSE    \/\/ enables V0finding efficiency histograms\n                                    TString   additionalTrainConfig = \"0\"       \/\/ additional counter for trainconfig, this has to be always the last parameter\n                                ){\n\n  Int_t IsHeavyIon = 1;\n  if (additionalTrainConfig.Atoi() > 0){\n    trainConfig = trainConfig + additionalTrainConfig.Atoi();\n  }\n\n  \/\/ ================== GetAnalysisManager ===============================\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) {\n    Error(Form(\"AddTask_GammaConvV1_%i\",trainConfig), \"No analysis manager found.\");\n    return ;\n  }\n\n  \/\/ ================== GetInputEventHandler =============================\n  AliVEventHandler *inputHandler=mgr->GetInputEventHandler();\n  Bool_t isMCForOtherSettings = 0;\n  if (isMC > 0) isMCForOtherSettings = 1;\n  \/\/========= Add PID Reponse to ANALYSIS manager ====\n  if(!(AliPIDResponse*)mgr->GetTask(\"PIDResponseTask\")){\n    gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPIDResponse.C\");\n    AddTaskPIDResponse(isMCForOtherSettings);\n  }\n\n  \/\/=========  Set Cutnumber for V0Reader ================================\n  TString cutnumberPhoton = \"00000000000000000500000000\";\n  if (trainConfig>100 && trainConfig<200 ){\n    cutnumberPhoton = \"10000000000000000500000000\";\n  }\n  TString cutnumberEvent = \"10000003\";\n\n  Bool_t  enableConstructGamma=kFALSE;\n\n  AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n  \/\/========= Add V0 Reader to  ANALYSIS manager if not yet existent =====\n  TString V0ReaderName = Form(\"V0ReaderV1_%s_%s\",cutnumberEvent.Data(),cutnumberPhoton.Data());\n  if( !(AliV0ReaderV1*)mgr->GetTask(V0ReaderName.Data()) ){\n    AliV0ReaderV1 *fV0ReaderV1 = new AliV0ReaderV1(V0ReaderName.Data());\n    if (periodNameV0Reader.CompareTo(\"\") != 0) fV0ReaderV1->SetPeriodName(periodNameV0Reader);\n    fV0ReaderV1->SetUseOwnXYZCalculation(kTRUE);\n    fV0ReaderV1->SetUseConstructGamma(enableConstructGamma);\n    fV0ReaderV1->SetCreateAODs(kFALSE);\/\/ AOD Output\n    fV0ReaderV1->SetUseAODConversionPhoton(kTRUE);\n    fV0ReaderV1->SetProduceV0FindingEfficiency(enableV0findingEffi);\n    if (!mgr) {\n      Error(\"AddTask_V0ReaderV1\", \"No analysis manager found.\");\n      return;\n    }\n\n    AliConvEventCuts *fEventCuts=NULL;\n    if(cutnumberEvent!=\"\"){\n      fEventCuts= new AliConvEventCuts(cutnumberEvent.Data(),cutnumberEvent.Data());\n      fEventCuts->SetPreSelectionCutFlag(kTRUE);\n      fEventCuts->SetV0ReaderName(V0ReaderName);\n      if (periodNameV0Reader.CompareTo(\"\") != 0) fEventCuts->SetPeriodEnum(periodNameV0Reader);\n      if(fEventCuts->InitializeCutsFromCutString(cutnumberEvent.Data())){\n        fV0ReaderV1->SetEventCuts(fEventCuts);\n        fEventCuts->SetFillCutHistograms(\"\",kTRUE);\n      }\n    }\n\n    \/\/ Set AnalysisCut Number\n    AliConversionPhotonCuts *fCuts=NULL;\n    if(cutnumberPhoton!=\"\"){\n      fCuts= new AliConversionPhotonCuts(cutnumberPhoton.Data(),cutnumberPhoton.Data());\n      fCuts->SetPreSelectionCutFlag(kTRUE);\n      fCuts->SetIsHeavyIon(IsHeavyIon);\n      fCuts->SetV0ReaderName(V0ReaderName);\n      fCuts->SetProcessAODCheck(processAODcheckForV0s); \/\/ if processAODcheckForV0s is kTRUE, also check for V0s to be contained in AliAODs and AliAODGammaConversion.root\n      if(fCuts->InitializeCutsFromCutString(cutnumberPhoton.Data())){\n        fV0ReaderV1->SetConversionCuts(fCuts);\n        fCuts->SetFillCutHistograms(\"\",kTRUE);\n      }\n    }\n\n\n    if(inputHandler->IsA()==AliAODInputHandler::Class()){\n      \/\/ AOD mode\n      fV0ReaderV1->SetDeltaAODBranchName(Form(\"GammaConv_%s_gamma\",cutnumberAODBranch.Data()));\n    }\n    fV0ReaderV1->Init();\n\n    AliLog::SetGlobalLogLevel(AliLog::kInfo);\n\n    \/\/connect input V0Reader\n    mgr->AddTask(fV0ReaderV1);\n    mgr->ConnectInput(fV0ReaderV1,0,cinput);\n\n  } else {\n    Error(\"AddTask_V0ReaderV1\", \"Cannot execute AddTask, V0ReaderV1 already exists.\");\n  }\n\n  \/\/================================================\n  \/\/========= Add task to the ANALYSIS manager =====\n  \/\/            find input container\n\n  AliAnalysisTaskMaterialHistos *fMaterialHistos=NULL;\n  fMaterialHistos= new AliAnalysisTaskMaterialHistos(Form(\"MaterialHistos_%i\",trainConfig));\n  fMaterialHistos->SetIsMC(isMC);\n  fMaterialHistos->SetIsHeavyIon(IsHeavyIon);\n  fMaterialHistos->SetV0ReaderName(V0ReaderName);\n\n  CutHandlerConv cuts;\n  if( trainConfig == 1){ \/\/ kMB, V0M, std cuts\n    cuts.AddCut(\"50000013\", \"00000009247602008250404000\");\n  } else  if( trainConfig == 2){ \/\/ kMB, V0M, open cuts\n    cuts.AddCut(\"50000013\", \"00000070000000000500004000\");\n  } else if ( trainConfig == 3){ \/\/ selection for 11h meson cut\n    cuts.AddCut(\"50000013\", \"00200009247602008850404000\");\n  } else if ( trainConfig == 4){ \/\/ selection for 11h photon cut\n    cuts.AddCut(\"50000013\", \"00200009247002008850404000\");\n\n    \/\/ Offline V0Finder is used\n  } else  if(trainConfig == 101){ \/\/INT7, CL1\n    cuts.AddCut(\"20010103\", \"10000009247602008250404000\");\n  } else  if( trainConfig == 102){ \/\/ kMB, V0M, open cuts\n    cuts.AddCut(\"50000013\", \"10000070000000000500004000\");\n  } else if ( trainConfig == 103){ \/\/ selection for 11h meson cut\n    cuts.AddCut(\"50000013\", \"10200009247602008850404000\");\n  } else if ( trainConfig == 104){ \/\/ selection for 11h photon cut\n    cuts.AddCut(\"50000013\", \"10200009247002008850404000\");\n\n  } else {\n    Error(Form(\"GammaConvV1_%i\",trainConfig), \"wrong trainConfig variable no cuts have been specified for the configuration\");\n    return;\n  }\n\n\tif(!cuts.AreValid()){\n    cout << \"\\n\\n****************************************************\" << endl;\n    cout << \"ERROR: No valid cuts stored in CutHandlerConv! Returning...\" << endl;\n    cout << \"****************************************************\\n\\n\" << endl;\n    return;\n  }\n\n  Int_t numberOfCuts = cuts.GetNCuts();\n\n  TList *EventCutList = new TList();\n  TList *ConvCutList = new TList();\n\n\n  EventCutList->SetOwner(kTRUE);\n  AliConvEventCuts **analysisEventCuts        = new AliConvEventCuts*[numberOfCuts];\n  ConvCutList->SetOwner(kTRUE);\n  AliConversionPhotonCuts **analysisCuts      = new AliConversionPhotonCuts*[numberOfCuts];\n  for(Int_t i = 0; i<numberOfCuts; i++){\n    analysisEventCuts[i]          = new AliConvEventCuts();\n    analysisEventCuts[i]->InitializeCutsFromCutString((cuts.GetEventCut(i)).Data());\n    analysisEventCuts[i]->SetV0ReaderName(V0ReaderName);\n    EventCutList->Add(analysisEventCuts[i]);\n    analysisEventCuts[i]->SetFillCutHistograms(\"\",kTRUE);\n\n    analysisCuts[i]               = new AliConversionPhotonCuts();\n    analysisCuts[i]->InitializeCutsFromCutString((cuts.GetPhotonCut(i)).Data());\n    analysisCuts[i]->SetV0ReaderName(V0ReaderName);\n    ConvCutList->Add(analysisCuts[i]);\n    analysisCuts[i]->SetFillCutHistograms(\"\",kTRUE);\n\n   }\n\n\n\n\n  fMaterialHistos->SetEventCutList(numberOfCuts,EventCutList);\n  fMaterialHistos->SetConversionCutList(numberOfCuts,ConvCutList);\n  mgr->AddTask(fMaterialHistos);\n\n\n  AliAnalysisDataContainer *coutput =\n    mgr->CreateContainer(Form(\"GammaConvMaterial_%i\",trainConfig), TList::Class(),\n\t\t\t AliAnalysisManager::kOutputContainer,Form(\"GammaConv_Material_%i.root\",trainConfig ));\n\n  mgr->ConnectInput(fMaterialHistos,  0, cinput );\n  mgr->ConnectOutput(fMaterialHistos,  1, coutput);\n  \/\/connect containers\n\treturn;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * DynamicMat.hpp\n *\n *  Created on: Nov 10, 2013\n *      Author: andresf\n *\/\n\n#ifndef DYNAMICMAT_HPP_\n#define DYNAMICMAT_HPP_\n\n#include <map>\n#include <math.h>\n#include <sstream>\n#include <stack>\n#include <stdio.h>\n#include <string>\n#include <vector>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/features2d\/features2d.hpp>\n\n#ifndef MAX_CACHE_SIZE\n#define MAX_CACHE_SIZE 524288000 \/\/ ~500 MB\n#endif\n\n\/\/ Pair holding image index (first) and (inclusive) starting descriptors index (second)\ntypedef int Image;\n\nstatic std::vector<Image> DEFAULT_INDICES;\nstatic std::vector<std::string> DEFAULT_FILENAMES;\n\nnamespace vlr {\n\nclass Mat {\n\npublic:\n\n\tstatic const size_t MAX_MEM = MAX_CACHE_SIZE;\n\nprivate:\n\n\tdouble m_capacity = 0.0;\n\tint m_descriptorType = -1;\n\tsize_t m_elemSize = 0;\n\tstd::vector<Image> m_imagesIndex, m_descriptorsIndex;\n\tstd::vector<std::string> m_descriptorsFilenames;\n\n\t\/** Attributes of the cache **\/\n\tsize_t m_memoryCount = 0;\n\tstd::stack<int> m_cachingOrder;\n\tstd::map<int, cv::Mat>* m_descriptorsCache;\n\npublic:\n\n\tint rows = 0;\n\tint cols = 0;\n\npublic:\n\n\t\/**\n\t * Class empty constructor.\n\t *\/\n\tMat();\n\n\t\/**\n\t * Copy constructor.\n\t *\n\t * @param other - Reference to an instance where to copy properties from\n\t *\/\n\tMat(const Mat& other);\n\n\t\/**\n\t * Class constructor.\n\t *\n\t * @param keysFilenames - Reference to a vector of descriptor filenames\n\t *\/\n\tMat(std::vector<std::string>& keysFilenames);\n\n\t\/**\n\t * Class destroyer.\n\t *\/\n\tvirtual ~Mat();\n\n\t\/**\n\t * Assignment operator.\n\t *\n\t * @param other - Reference to an instance where to copy properties from\n\t * @return reference to the new instance\n\t *\/\n\tMat& operator=(const Mat& other);\n\n\t\/**\n\t * Retrieves the requested descriptor by obtaining it from cache\n\t * and if necessary load the associated descriptor.\n\t *\n\t * @param descriptorIndex - Index of the descriptor to retrieve\n\t * @return requested descriptor\n\t *\/\n\tcv::Mat row(int descriptorIndex);\n\n\t\/**\n\t * Returns type of descriptors held by the virtual big descriptors matrix.\n\t *\n\t * @return descriptors type\n\t *\/\n\tint type() const;\n\n\tsize_t elemSize() const;\n\n\t\/**\n\t * Returns true if the matrix is empty.\n\t *\n\t * @return true if rows counter is zero, false otherwise\n\t *\/\n\tbool empty() const;\n\n\t\/**\n\t * Swaps the cache content by an empty vector of the same size.\n\t *\/\n\tvoid clearCache();\n\n\t\/**\n\t * Returns the maximum number of descriptors that can be stored\n\t * given the maximum size of the cache\n\t *\n\t * @return cache capacity in number of descriptors\n\t *\/\n\tdouble getCapacity() const {\n\t\treturn m_capacity;\n\t}\n\n\t\/** Getters **\/\n\n\t\/**\n\t * Returns a reference to the index descriptors holding the\n\t * index of image it belongs to and the starting index of the\n\t * virtual big descriptors matrix.\n\t *\n\t * @return index of descriptors\n\t *\/\n\tconst std::vector<Image>& getDescriptorsIndex() const {\n\t\treturn m_imagesIndex;\n\t}\n\n\t\/**\n\t * Returns a reference to the vector of descriptors filenames.\n\t *\n\t * @return descriptors filenames\n\t *\/\n\tconst std::vector<std::string>& getDescriptorsFilenames() const {\n\t\treturn m_descriptorsFilenames;\n\t}\n\n\t\/**\n\t * Returns the count of memory used by the matrices loaded in cache.\n\t *\n\t * @return memory count in Bytes\n\t *\/\n\tsize_t getMemoryCount() const {\n\t\treturn m_memoryCount;\n\t}\n\nprivate:\n\n\t\/**\n\t * Computes used memory by the given descriptors matrix\n\t *\n\t * @param descriptors - a reference to a matrix containing descriptors\n\t * @return number of bytes used\n\t *\/\n\tsize_t rowMemorySize() {\n\t\treturn cols * m_elemSize;\n\t}\n\n};\n\nstatic vlr::Mat DEFAULT_INPUTDATA = vlr::Mat();\n\n} \/* namespace vlr *\/\n\n#endif \/* DYNAMICMAT_HPP_ *\/\n<commit_msg>Common\/include\/DynamicMat.hpp * Defined max cach size without condition. * Removed type definition.<commit_after>\/*\n * DynamicMat.hpp\n *\n *  Created on: Nov 10, 2013\n *      Author: andresf\n *\/\n\n#ifndef DYNAMICMAT_HPP_\n#define DYNAMICMAT_HPP_\n\n#include <map>\n#include <math.h>\n#include <sstream>\n#include <stack>\n#include <stdio.h>\n#include <string>\n#include <vector>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/features2d\/features2d.hpp>\n\n#define MAX_CACHE_SIZE 524288000 \/\/ ~500 MB\n\nstatic std::vector<int> DEFAULT_INDICES;\nstatic std::vector<std::string> DEFAULT_FILENAMES;\n\nnamespace vlr {\n\nclass Mat {\n\npublic:\n\n\tstatic const size_t MAX_MEM = MAX_CACHE_SIZE;\n\nprivate:\n\n\tdouble m_capacity = 0.0;\n\tint m_descriptorType = -1;\n\tsize_t m_elemSize = 0;\n\tstd::vector<int> m_imagesIndex, m_descriptorsIndex;\n\tstd::vector<std::string> m_descriptorsFilenames;\n\n\t\/** Attributes of the cache **\/\n\tsize_t m_memoryCount = 0;\n\tstd::stack<int> m_cachingOrder;\n\tstd::map<int, cv::Mat>* m_descriptorsCache;\n\npublic:\n\n\tint rows = 0;\n\tint cols = 0;\n\npublic:\n\n\t\/**\n\t * Class empty constructor.\n\t *\/\n\tMat();\n\n\t\/**\n\t * Copy constructor.\n\t *\n\t * @param other - Reference to an instance where to copy properties from\n\t *\/\n\tMat(const Mat& other);\n\n\t\/**\n\t * Class constructor.\n\t *\n\t * @param keysFilenames - Reference to a vector of descriptor filenames\n\t *\/\n\tMat(std::vector<std::string>& keysFilenames);\n\n\t\/**\n\t * Class destroyer.\n\t *\/\n\tvirtual ~Mat();\n\n\t\/**\n\t * Assignment operator.\n\t *\n\t * @param other - Reference to an instance where to copy properties from\n\t * @return reference to the new instance\n\t *\/\n\tMat& operator=(const Mat& other);\n\n\t\/**\n\t * Retrieves the requested descriptor by obtaining it from cache\n\t * and if necessary load the associated descriptor.\n\t *\n\t * @param descriptorIndex - Index of the descriptor to retrieve\n\t * @return requested descriptor\n\t *\/\n\tcv::Mat row(int descriptorIndex);\n\n\t\/**\n\t * Returns type of descriptors held by the virtual big descriptors matrix.\n\t *\n\t * @return descriptors type\n\t *\/\n\tint type() const;\n\n\tsize_t elemSize() const;\n\n\t\/**\n\t * Returns true if the matrix is empty.\n\t *\n\t * @return true if rows counter is zero, false otherwise\n\t *\/\n\tbool empty() const;\n\n\t\/**\n\t * Swaps the cache content by an empty vector of the same size.\n\t *\/\n\tvoid clearCache();\n\n\t\/**\n\t * Returns the maximum number of descriptors that can be stored\n\t * given the maximum size of the cache\n\t *\n\t * @return cache capacity in number of descriptors\n\t *\/\n\tdouble getCapacity() const {\n\t\treturn m_capacity;\n\t}\n\n\t\/** Getters **\/\n\n\t\/**\n\t * Returns a reference to the index descriptors holding the\n\t * index of image it belongs to and the starting index of the\n\t * virtual big descriptors matrix.\n\t *\n\t * @return index of descriptors\n\t *\/\n\tconst std::vector<int>& getDescriptorsIndex() const {\n\t\treturn m_imagesIndex;\n\t}\n\n\t\/**\n\t * Returns a reference to the vector of descriptors filenames.\n\t *\n\t * @return descriptors filenames\n\t *\/\n\tconst std::vector<std::string>& getDescriptorsFilenames() const {\n\t\treturn m_descriptorsFilenames;\n\t}\n\n\t\/**\n\t * Returns the count of memory used by the matrices loaded in cache.\n\t *\n\t * @return memory count in Bytes\n\t *\/\n\tsize_t getMemoryCount() const {\n\t\treturn m_memoryCount;\n\t}\n\nprivate:\n\n\t\/**\n\t * Computes used memory by the given descriptors matrix\n\t *\n\t * @param descriptors - a reference to a matrix containing descriptors\n\t * @return number of bytes used\n\t *\/\n\tsize_t rowMemorySize() {\n\t\treturn cols * m_elemSize;\n\t}\n\n};\n\nstatic vlr::Mat DEFAULT_INPUTDATA = vlr::Mat();\n\n} \/* namespace vlr *\/\n\n#endif \/* DYNAMICMAT_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/hist:$Id$\n\/\/ Author: Lorenzo Moneta 12\/06\/07\n\n\/**********************************************************************\n *                                                                    *\n * Copyright (c) 2006  LCG ROOT Math Team, CERN\/PH-SFT                *\n *                                                                    *\n *                                                                    *\n **********************************************************************\/\n\n\/\/ helper functions and classes used internally by TF1 \n\n#include \"TF1Helper.h\"\n#include \"TVirtualFitter.h\"\n#include \"TError.h\"\n#include <vector>\n#include <cmath>\n#include <cassert>\n\n#include <iostream>\n\nnamespace ROOT { \n\n\n\n   namespace TF1Helper{ \n\n\n\ndouble IntegralError(TF1 * func, double a, double b, double epsilon) { \n\n   \/\/ calculate the eror on an integral from a to b of a parametetric function f when the parameters \n   \/\/ are estimated from a fit and have an error represented by the covariance matrix of the fit. \n   \/\/ The latest fit result is used \n\n   \/\/ need to create the gradient functions w.r.t to the parameters \n\n   \/\/ loop on all parameters \n   int npar = func->GetNpar();\n   int nfreepar = func->GetNumberFreeParameters();\n\n   double * epar = func->GetParErrors();\n\n   \/\/ get covariance matrix from latest fit \n   TVirtualFitter * fitter = TVirtualFitter::GetFitter();\n   if (fitter == 0) { \n      Error(\"TF1Helper\",\"No existing fitter\");\n      return 0;\n   } \n   double * covMatrix = fitter->GetCovarianceMatrix(); \n   if (covMatrix == 0) { \n      Error(\"TF1Helper\",\"Fitter has no covariance matrix\");\n      return 0;\n   }\n   \/\/ check that fitter and function are in sync\n   if (fitter->GetNumberFreeParameters() != nfreepar) { \n      Error(\"TF1Helper\",\"Wrong Fitter for TF1\");\n      return 0;\n   }\n\n   std::vector<double> ig;\n   ig.reserve(nfreepar);\n   for (int i=0; i < npar; ++i) { \n\n      \/\/ check also the parameter values\n      if (fitter->GetParameter(i) != func->GetParameter(i) ) { \n         Error(\"TF1Helper\",\"Wrong Fitter for TF1\");\n         return 0;\n      }\n      \n      \/\/ check that parameter is not fixed  \n      if (! fitter->IsFixed(i) ) {\n         \/\/ should check the limits \n         double integral  = 0;\n         if (epar[i] > 0 ) {          \n            TF1 gradFunc(\"gradFunc\",TGradientParFunction(i,func),0,0,0);\n            integral = gradFunc.Integral(a,b,(double*)0,epsilon);\n         }\n         ig.push_back(integral);\n      } \n   }\n   \/\/ number of free parameters and size of corr matrix\n   assert( int(ig.size()) == nfreepar); \n\n   double err2 = 0; \n   for (int i = 0; i < nfreepar; ++i) { \n      double s = 0;\n      for (int j =0; j < nfreepar; ++j) {\n         std::cout << i << \"  \" << j << \" ig \" << ig[i] << \"  \" << ig[j] << \"  \" << covMatrix[i*npar + j] << \"  \" << s << std::endl;  \n         s += ig[j] * covMatrix[i*npar + j] ;\n      }\n\n      err2 += ig[i] * s; \n   }\n\n\n   return std::sqrt(err2);\n\n}   \n\n\n} \/\/ end namespace TF1Helper\n\n\n} \/\/ end namespace ROOT\n<commit_msg>remove a left-out debug statement<commit_after>\/\/ @(#)root\/hist:$Id$\n\/\/ Author: Lorenzo Moneta 12\/06\/07\n\n\/**********************************************************************\n *                                                                    *\n * Copyright (c) 2006  LCG ROOT Math Team, CERN\/PH-SFT                *\n *                                                                    *\n *                                                                    *\n **********************************************************************\/\n\n\/\/ helper functions and classes used internally by TF1 \n\n#include \"TF1Helper.h\"\n#include \"TVirtualFitter.h\"\n#include \"TError.h\"\n#include <vector>\n#include <cmath>\n#include <cassert>\n\n\nnamespace ROOT { \n\n\n\n   namespace TF1Helper{ \n\n\n\ndouble IntegralError(TF1 * func, double a, double b, double epsilon) { \n\n   \/\/ calculate the eror on an integral from a to b of a parametetric function f when the parameters \n   \/\/ are estimated from a fit and have an error represented by the covariance matrix of the fit. \n   \/\/ The latest fit result is used \n\n   \/\/ need to create the gradient functions w.r.t to the parameters \n\n   \/\/ loop on all parameters \n   int npar = func->GetNpar();\n   int nfreepar = func->GetNumberFreeParameters();\n\n   double * epar = func->GetParErrors();\n\n   \/\/ get covariance matrix from latest fit \n   TVirtualFitter * fitter = TVirtualFitter::GetFitter();\n   if (fitter == 0) { \n      Error(\"TF1Helper\",\"No existing fitter\");\n      return 0;\n   } \n   double * covMatrix = fitter->GetCovarianceMatrix(); \n   if (covMatrix == 0) { \n      Error(\"TF1Helper\",\"Fitter has no covariance matrix\");\n      return 0;\n   }\n   \/\/ check that fitter and function are in sync\n   if (fitter->GetNumberFreeParameters() != nfreepar) { \n      Error(\"TF1Helper\",\"Wrong Fitter for TF1\");\n      return 0;\n   }\n\n   std::vector<double> ig;\n   ig.reserve(nfreepar);\n   for (int i=0; i < npar; ++i) { \n\n      \/\/ check also the parameter values\n      if (fitter->GetParameter(i) != func->GetParameter(i) ) { \n         Error(\"TF1Helper\",\"Wrong Fitter for TF1\");\n         return 0;\n      }\n      \n      \/\/ check that parameter is not fixed  \n      if (! fitter->IsFixed(i) ) {\n         \/\/ should check the limits \n         double integral  = 0;\n         if (epar[i] > 0 ) {          \n            TF1 gradFunc(\"gradFunc\",TGradientParFunction(i,func),0,0,0);\n            integral = gradFunc.Integral(a,b,(double*)0,epsilon);\n         }\n         ig.push_back(integral);\n      } \n   }\n   \/\/ number of free parameters and size of corr matrix\n   assert( int(ig.size()) == nfreepar); \n\n   double err2 = 0; \n   for (int i = 0; i < nfreepar; ++i) { \n      double s = 0;\n      for (int j =0; j < nfreepar; ++j) \n         s += ig[j] * covMatrix[i*npar + j] ;\n      \n\n      err2 += ig[i] * s; \n   }\n\n\n   return std::sqrt(err2);\n\n}   \n\n\n} \/\/ end namespace TF1Helper\n\n\n} \/\/ end namespace ROOT\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2020 - 2021 Pedro Falcato\n * This file is part of Onyx, and is released under the terms of the MIT License\n * check LICENSE at the root directory for more information\n *\n * SPDX-License-Identifier: MIT\n *\/\n\n#include \"uart8250.h\"\n\n#include <stdint.h>\n\n#include <onyx\/dev.h>\n#include <onyx\/dpc.h>\n#include <onyx\/driver.h>\n#include <onyx\/irq.h>\n#include <onyx\/panic.h>\n#include <onyx\/port_io.h>\n#include <onyx\/serial.h>\n#include <onyx\/tty.h>\n\nstatic driver serial_platform_driver = {.name = \"uart8250-platform\",\n                                        .bus_type_node = {&serial_platform_driver}};\n\ndevice uart8250_platform_device{\"uart8250\", nullptr, nullptr};\n\nirqstatus_t uart8250_port::on_irq()\n{\n    auto st = read<uint8_t>(uart8250_register::interrupt_identification);\n\n    if (st & UART8250_IIR_IRQ_PENDING)\n        return IRQ_UNHANDLED;\n\n    auto reason = UART8250_IIR_REASON(st);\n    if (reason & UART8250_IIR_RX_DATA_AVL)\n    {\n        auto data = read<uint8_t>(uart8250_register::data);\n        receive_byte(data);\n        return IRQ_HANDLED;\n    }\n\n    return IRQ_UNHANDLED;\n}\n\nvoid uart8250_port::set_baud_rate(uint16_t rate)\n{\n    auto div_value = calculate_divisor(rate);\n\n    assert(div_value != 0);\n\n    uint8_t old_val = read<uint8_t>(uart8250_register::line_control);\n    write<uint8_t>(uart8250_register::line_control, old_val | UART8250_LCR_DLAB);\n    write<uint8_t>(uart8250_register::lsb_divisor, div_value & 0xff);\n    write<uint8_t>(uart8250_register::msb_divisor, div_value >> 8);\n\n    write<uint8_t>(uart8250_register::line_control, old_val);\n}\n\nbool uart8250_port::test()\n{\n    write<uint8_t>(uart8250_register::modem_control, UART8250_MCR_LOOPBACK);\n    write<uint8_t>(uart8250_register::data, 0xcd);\n\n    return read<uint8_t>(uart8250_register::data) == 0xcd;\n}\n\nbool uart8250_port::tx_empty()\n{\n    return read<uint8_t>(uart8250_register::line_status) & UART8250_LSR_TX_BUF_EMPTY;\n}\n\nbool uart8250_port::rx_rdy()\n{\n    return read<uint8_t>(uart8250_register::line_status) & UART8250_LSR_DATA_RDY;\n}\n\nvoid uart8250_port::write_byte(uint8_t c)\n{\n    while (!tx_empty())\n        ;\n\n    write<uint8_t>(uart8250_register::data, c);\n}\n\nvoid uart8250_port::write(const char *s, size_t size, bool is_debug_console)\n{\n    scoped_lock g{lock_};\n    for (size_t i = 0; i < size; i++)\n    {\n        auto byte = static_cast<uint8_t>(s[i]);\n\n        \/\/ Needed for basic printing as a debug console\n        if (is_debug_console && byte == '\\n') [[unlikely]]\n            write_byte('\\r');\n        write_byte(static_cast<uint8_t>(*(s + i)));\n    }\n}\n\nalignas(uart8250_port) static char com1_buf[sizeof(uart8250_port)];\nuart8250_port *com1;\n\nbool uart8250_port::present()\n{\n    static constexpr uint8_t test_val = 0xcd;\n    write<uint8_t>(uart8250_register::scratch_register, test_val);\n\n    auto present = read<uint8_t>(uart8250_register::scratch_register);\n\n    return present == test_val;\n}\n\nirqstatus_t uart8250_irq(irq_context *ctx, void *cookie)\n{\n    auto port = reinterpret_cast<uart8250_port *>(cookie);\n\n    return port->on_irq();\n}\n\n\/**\n * @brief Initialises the serial port as a debug console\n *\n * @return True if success, else false.\n *\/\nbool uart8250_port::early_init()\n{\n    \/* Disable interrupts *\/\n    write<uint8_t>(uart8250_register::interrupt_enable, 0);\n\n    \/* Then we set the baud rate of the port *\/\n    set_baud_rate(default_baud_rate);\n\n    \/* Set the word length to 8-bits per word *\/\n    write<uint8_t>(uart8250_register::line_control, UART8250_LCR_WORD_LENGTH(UART8250_LCR_8BIT_WL));\n\n    \/* Set some FIFO settings *\/\n    uint8_t fcr = UART8250_FCR_CLR_TX_FIFO | UART8250_FCR_CLR_RCV_FIFO | UART8250_FCR_FIFO_ENABLE |\n                  UART8250_FCR_INT_TRIGGER_14BYTE;\n\n    write<uint8_t>(uart8250_register::fifo_control, fcr);\n\n    \/* Signal that we're ready to send and ready to receive *\/\n    \/\/ Note: UART8250_MCR_GPO2_ENABLE = Enable interrupts as well. It's weird, but we also need to\n    \/\/ set this.\n    write<uint8_t>(uart8250_register::modem_control, UART8250_MCR_GPO2_ENABLE |\n                                                         UART8250_MCR_DATA_TERMINAL_RDY |\n                                                         UART8250_MCR_REQ_TO_SEND);\n\n    return true;\n}\n\n\/**\n * @brief Write bytes to the serial port\n *\n * @param buffer Buffer\n * @param size Length\n * @return Positive byte count or negative error code\n *\/\nssize_t uart8250_port::write_serial(const void *buffer, size_t size)\n{\n    write((const char *) buffer, size);\n    return size;\n}\n\n\/**\n * @brief Initialises the serial port as a standard serial port\n *\n * @return True if success, else false\n *\/\nbool uart8250_port::init()\n{\n    if (!early_init())\n        return false;\n\n    install_irq(irq_, uart8250_irq, dev_, IRQ_FLAG_REGULAR, this);\n\n    \/* Re-enable interrupts *\/\n    write<uint8_t>(uart8250_register::interrupt_enable, UART8250_IER_DATA_AVAIL);\n\n    return init_tty();\n}\n\nvoid platform_serial_init(void)\n{\n    com1 = new (com1_buf) uart8250_port{0x3f8, 4, &uart8250_platform_device};\n    com1->early_init();\n    uart8250_platform_device.driver_ = &serial_platform_driver;\n}\n\nvoid platform_serial_write(const char *s, size_t size)\n{\n    com1->write(s, size, true);\n}\n<commit_msg>uart8250: Add tx_empty() timeout<commit_after>\/*\n * Copyright (c) 2020 - 2021 Pedro Falcato\n * This file is part of Onyx, and is released under the terms of the MIT License\n * check LICENSE at the root directory for more information\n *\n * SPDX-License-Identifier: MIT\n *\/\n\n#include \"uart8250.h\"\n\n#include <stdint.h>\n\n#include <onyx\/dev.h>\n#include <onyx\/dpc.h>\n#include <onyx\/driver.h>\n#include <onyx\/irq.h>\n#include <onyx\/panic.h>\n#include <onyx\/port_io.h>\n#include <onyx\/serial.h>\n#include <onyx\/tty.h>\n\nstatic driver serial_platform_driver = {.name = \"uart8250-platform\",\n                                        .bus_type_node = {&serial_platform_driver}};\n\ndevice uart8250_platform_device{\"uart8250\", nullptr, nullptr};\n\nirqstatus_t uart8250_port::on_irq()\n{\n    auto st = read<uint8_t>(uart8250_register::interrupt_identification);\n\n    if (st & UART8250_IIR_IRQ_PENDING)\n        return IRQ_UNHANDLED;\n\n    auto reason = UART8250_IIR_REASON(st);\n    if (reason & UART8250_IIR_RX_DATA_AVL)\n    {\n        auto data = read<uint8_t>(uart8250_register::data);\n        receive_byte(data);\n        return IRQ_HANDLED;\n    }\n\n    return IRQ_UNHANDLED;\n}\n\nvoid uart8250_port::set_baud_rate(uint16_t rate)\n{\n    auto div_value = calculate_divisor(rate);\n\n    assert(div_value != 0);\n\n    uint8_t old_val = read<uint8_t>(uart8250_register::line_control);\n    write<uint8_t>(uart8250_register::line_control, old_val | UART8250_LCR_DLAB);\n    write<uint8_t>(uart8250_register::lsb_divisor, div_value & 0xff);\n    write<uint8_t>(uart8250_register::msb_divisor, div_value >> 8);\n\n    write<uint8_t>(uart8250_register::line_control, old_val);\n}\n\nbool uart8250_port::test()\n{\n    write<uint8_t>(uart8250_register::modem_control, UART8250_MCR_LOOPBACK);\n    write<uint8_t>(uart8250_register::data, 0xcd);\n\n    return read<uint8_t>(uart8250_register::data) == 0xcd;\n}\n\nbool uart8250_port::tx_empty()\n{\n    return read<uint8_t>(uart8250_register::line_status) & UART8250_LSR_TX_BUF_EMPTY;\n}\n\nbool uart8250_port::rx_rdy()\n{\n    return read<uint8_t>(uart8250_register::line_status) & UART8250_LSR_DATA_RDY;\n}\n\nvoid uart8250_port::write_byte(uint8_t c)\n{\n    int st = do_with_timeout(\n        [&]() -> expected<int, int> {\n            if (tx_empty())\n                return 0;\n            return 1;\n        },\n        NS_PER_MS);\n\n    if (st < 0)\n        return;\n\n    write<uint8_t>(uart8250_register::data, c);\n}\n\nvoid uart8250_port::write(const char *s, size_t size, bool is_debug_console)\n{\n    scoped_lock g{lock_};\n    for (size_t i = 0; i < size; i++)\n    {\n        auto byte = static_cast<uint8_t>(s[i]);\n\n        \/\/ Needed for basic printing as a debug console\n        if (is_debug_console && byte == '\\n') [[unlikely]]\n            write_byte('\\r');\n        write_byte(static_cast<uint8_t>(*(s + i)));\n    }\n}\n\nalignas(uart8250_port) static char com1_buf[sizeof(uart8250_port)];\nuart8250_port *com1;\n\nbool uart8250_port::present()\n{\n    static constexpr uint8_t test_val = 0xcd;\n    write<uint8_t>(uart8250_register::scratch_register, test_val);\n\n    auto present = read<uint8_t>(uart8250_register::scratch_register);\n\n    return present == test_val;\n}\n\nirqstatus_t uart8250_irq(irq_context *ctx, void *cookie)\n{\n    auto port = reinterpret_cast<uart8250_port *>(cookie);\n\n    return port->on_irq();\n}\n\n\/**\n * @brief Initialises the serial port as a debug console\n *\n * @return True if success, else false.\n *\/\nbool uart8250_port::early_init()\n{\n    \/* Disable interrupts *\/\n    write<uint8_t>(uart8250_register::interrupt_enable, 0);\n\n    \/* Then we set the baud rate of the port *\/\n    set_baud_rate(default_baud_rate);\n\n    \/* Set the word length to 8-bits per word *\/\n    write<uint8_t>(uart8250_register::line_control, UART8250_LCR_WORD_LENGTH(UART8250_LCR_8BIT_WL));\n\n    \/* Set some FIFO settings *\/\n    uint8_t fcr = UART8250_FCR_CLR_TX_FIFO | UART8250_FCR_CLR_RCV_FIFO | UART8250_FCR_FIFO_ENABLE |\n                  UART8250_FCR_INT_TRIGGER_14BYTE;\n\n    write<uint8_t>(uart8250_register::fifo_control, fcr);\n\n    \/* Signal that we're ready to send and ready to receive *\/\n    \/\/ Note: UART8250_MCR_GPO2_ENABLE = Enable interrupts as well. It's weird, but we also need to\n    \/\/ set this.\n    write<uint8_t>(uart8250_register::modem_control, UART8250_MCR_GPO2_ENABLE |\n                                                         UART8250_MCR_DATA_TERMINAL_RDY |\n                                                         UART8250_MCR_REQ_TO_SEND);\n\n    return true;\n}\n\n\/**\n * @brief Write bytes to the serial port\n *\n * @param buffer Buffer\n * @param size Length\n * @return Positive byte count or negative error code\n *\/\nssize_t uart8250_port::write_serial(const void *buffer, size_t size)\n{\n    write((const char *) buffer, size);\n    return size;\n}\n\n\/**\n * @brief Initialises the serial port as a standard serial port\n *\n * @return True if success, else false\n *\/\nbool uart8250_port::init()\n{\n    if (!early_init())\n        return false;\n\n    install_irq(irq_, uart8250_irq, dev_, IRQ_FLAG_REGULAR, this);\n\n    \/* Re-enable interrupts *\/\n    write<uint8_t>(uart8250_register::interrupt_enable, UART8250_IER_DATA_AVAIL);\n\n    return init_tty();\n}\n\nvoid platform_serial_init(void)\n{\n    com1 = new (com1_buf) uart8250_port{0x3f8, 4, &uart8250_platform_device};\n    com1->early_init();\n    uart8250_platform_device.driver_ = &serial_platform_driver;\n}\n\nvoid platform_serial_write(const char *s, size_t size)\n{\n    com1->write(s, size, true);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2007-2022 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 \"AutoPipeIstream.hxx\"\n#include \"PipeLease.hxx\"\n#include \"New.hxx\"\n#include \"UnusedPtr.hxx\"\n#include \"ForwardIstream.hxx\"\n#include \"system\/Error.hxx\"\n#include \"io\/Splice.hxx\"\n#include \"io\/SpliceSupport.hxx\"\n\n#include <assert.h>\n#include <errno.h>\n#include <string.h>\n\nclass AutoPipeIstream final : public ForwardIstream {\n\tPipeLease pipe;\n\tstd::size_t piped = 0;\n\n\tFdTypeMask direct_mask = 0;\n\npublic:\n\tAutoPipeIstream(struct pool &p, UnusedIstreamPtr _input,\n\t\t\tPipeStock *_pipe_stock) noexcept\n\t\t:ForwardIstream(p, std::move(_input)),\n\t\t pipe(_pipe_stock) {}\n\n\t\/* virtual methods from class Istream *\/\n\n\tvoid _SetDirect(FdTypeMask mask) noexcept override;\n\toff_t _GetAvailable(bool partial) noexcept override;\n\tvoid _Read() noexcept override;\n\n\tvoid _FillBucketList(IstreamBucketList &list) override {\n\t\tif (piped > 0)\n\t\t\treturn Istream::_FillBucketList(list);\n\n\t\ttry {\n\t\t\tinput.FillBucketList(list);\n\t\t} catch (...) {\n\t\t\tDestroy();\n\t\t\tthrow;\n\t\t}\n\t}\n\n\tvoid _ConsumeDirect(std::size_t nbytes) noexcept override;\n\n\tint _AsFd() noexcept override;\n\tvoid _Close() noexcept override;\n\n\t\/* handler *\/\n\tstd::size_t OnData(const void *data, std::size_t length) noexcept override;\n\tIstreamDirectResult OnDirect(FdType type, int fd,\n\t\t\t\t     std::size_t max_length) noexcept override;\n\tvoid OnEof() noexcept override;\n\tvoid OnError(std::exception_ptr ep) noexcept override;\n\nprivate:\n\tvoid CloseInternal() noexcept;\n\tvoid Abort(std::exception_ptr ep) noexcept;\n\tIstreamDirectResult Consume() noexcept;\n};\n\nvoid\nAutoPipeIstream::CloseInternal() noexcept\n{\n\t\/* reuse the pipe only if it's empty *\/\n\tpipe.Release(piped == 0);\n}\n\nvoid\nAutoPipeIstream::Abort(std::exception_ptr ep) noexcept\n{\n\tCloseInternal();\n\n\tDestroyError(ep);\n}\n\nIstreamDirectResult\nAutoPipeIstream::Consume() noexcept\n{\n\tassert(pipe.IsDefined());\n\tassert(piped > 0);\n\n\tauto result = InvokeDirect(FdType::FD_PIPE, pipe.GetReadFd().Get(),\n\t\t\t\t   piped);\n\tswitch (result) {\n\tcase IstreamDirectResult::BLOCKING:\n\tcase IstreamDirectResult::CLOSED:\n\t\t\/* handler blocks or pipe was closed *\/\n\t\tbreak;\n\n\tcase IstreamDirectResult::END:\n\t\t\/* must not happen *\/\n\t\tassert(false);\n\t\tgcc_unreachable();\n\n\tcase IstreamDirectResult::ERRNO:\n\t\tif (errno != EAGAIN) {\n\t\t\tAbort(std::make_exception_ptr(MakeErrno(\"read from pipe failed\")));\n\t\t\tresult = IstreamDirectResult::CLOSED;\n\t\t}\n\n\t\tbreak;\n\n\tcase IstreamDirectResult::OK:\n\t\tif (piped == 0 && !input.IsDefined()) {\n\t\t\t\/* our input has already reported EOF, and we have been\n\t\t\t   waiting for the pipe buffer to become empty *\/\n\t\t\tCloseInternal();\n\t\t\tDestroyEof();\n\t\t\tresult = IstreamDirectResult::CLOSED;\n\t\t}\n\n\t\tbreak;\n\t}\n\n\treturn result;\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\ninline std::size_t\nAutoPipeIstream::OnData(const void *data, std::size_t length) noexcept\n{\n\tassert(HasHandler());\n\n\tif (piped > 0) {\n\t\tconst auto result = Consume();\n\t\tif (result != IstreamDirectResult::OK)\n\t\t\treturn 0;\n\n\t\tif (piped > 0 || !HasHandler())\n\t\t\treturn 0;\n\t}\n\n\tassert(piped == 0);\n\n\treturn InvokeData(data, length);\n}\n\ninline IstreamDirectResult\nAutoPipeIstream::OnDirect(FdType type, int fd, std::size_t max_length) noexcept\n{\n\tassert(HasHandler());\n\n\tif (piped > 0) {\n\t\tconst auto result = Consume();\n\t\tif (result != IstreamDirectResult::OK)\n\t\t\treturn result;\n\n\t\tif (piped > 0)\n\t\t\t\/* if the pipe still isn't empty, we can't start reading\n\t\t\t   new input *\/\n\t\t\treturn IstreamDirectResult::BLOCKING;\n\t}\n\n\tif (direct_mask & FdTypeMask(type))\n\t\t\/* already supported by handler (maybe already a pipe) - no\n\t\t   need for wrapping it into a pipe *\/\n\t\treturn InvokeDirect(type, fd, max_length);\n\n\tassert((type & ISTREAM_TO_PIPE) == type);\n\n\tif (!pipe.IsDefined()) {\n\t\ttry {\n\t\t\tpipe.Create();\n\t\t} catch (...) {\n\t\t\tAbort(std::current_exception());\n\t\t\treturn IstreamDirectResult::CLOSED;\n\t\t}\n\t}\n\n\tssize_t nbytes = Splice(fd, pipe.GetWriteFd().Get(), max_length);\n\t\/* don't check EAGAIN here (and don't return -2).  We assume that\n\t   splicing to the pipe cannot possibly block, since we flushed\n\t   the pipe; assume that it can only be the source file which is\n\t   blocking *\/\n\tif (nbytes <= 0)\n\t\treturn nbytes < 0\n\t\t\t? IstreamDirectResult::ERRNO\n\t\t\t: IstreamDirectResult::END;\n\n\tinput.ConsumeDirect(nbytes);\n\n\tassert(piped == 0);\n\tpiped = (std::size_t)nbytes;\n\n\tif (Consume() == IstreamDirectResult::CLOSED)\n\t\treturn IstreamDirectResult::CLOSED;\n\n\treturn IstreamDirectResult::OK;\n}\n\ninline void\nAutoPipeIstream::OnEof() noexcept\n{\n\tinput.Clear();\n\n\tpipe.CloseWriteIfNotStock();\n\n\tif (piped == 0) {\n\t\tCloseInternal();\n\t\tDestroyEof();\n\t}\n}\n\ninline void\nAutoPipeIstream::OnError(std::exception_ptr ep) noexcept\n{\n\tCloseInternal();\n\tinput.Clear();\n\tDestroyError(ep);\n}\n\n\/*\n * istream implementation\n *\n *\/\n\nvoid\nAutoPipeIstream::_SetDirect(FdTypeMask mask) noexcept\n{\n\tdirect_mask = mask;\n\n\tif (mask & FdType::FD_PIPE)\n\t\t\/* if the handler supports the pipe, we offer our\n\t\t   services *\/\n\t\tmask |= ISTREAM_TO_PIPE;\n\n\tinput.SetDirect(mask);\n}\n\noff_t\nAutoPipeIstream::_GetAvailable(bool partial) noexcept\n{\n\tif (gcc_likely(input.IsDefined())) {\n\t\toff_t available = input.GetAvailable(partial);\n\t\tif (piped > 0) {\n\t\t\tif (available != -1)\n\t\t\t\tavailable += piped;\n\t\t\telse if (partial)\n\t\t\t\tavailable = piped;\n\t\t}\n\n\t\treturn available;\n\t} else {\n\t\tassert(piped > 0);\n\n\t\treturn piped;\n\t}\n}\n\nvoid\nAutoPipeIstream::_Read() noexcept\n{\n\tif (piped > 0 && (Consume() != IstreamDirectResult::OK || piped > 0))\n\t\treturn;\n\n\t\/* at this point, the pipe must be flushed - if the pipe is\n\t   flushed, this stream is either closed or there must be an input\n\t   stream *\/\n\tassert(input.IsDefined());\n\n\tinput.Read();\n}\n\nvoid\nAutoPipeIstream::_ConsumeDirect(std::size_t nbytes) noexcept\n{\n\tif (piped > 0) {\n\t\tassert(nbytes <= piped);\n\t\tpiped -= nbytes;\n\t\tConsumed(nbytes);\n\n\t\tif (piped == 0)\n\t\t\t\/* if the pipe was drained, return it to the\n\t\t\t   stock, to make it available to other\n\t\t\t   streams *\/\n\t\t\tpipe.ReleaseIfStock();\n\t} else {\n\t\tForwardIstream::_ConsumeDirect(nbytes);\n\t}\n}\n\nint\nAutoPipeIstream::_AsFd() noexcept\n{\n\tif (piped > 0)\n\t\t\/* need to flush the pipe buffer first *\/\n\t\treturn -1;\n\n\tint fd = input.AsFd();\n\tif (fd >= 0) {\n\t\tCloseInternal();\n\t\tDestroy();\n\t}\n\n\treturn fd;\n}\n\nvoid\nAutoPipeIstream::_Close() noexcept\n{\n\tCloseInternal();\n\n\tDestroy();\n}\n\n\/*\n * constructor\n *\n *\/\n\nUnusedIstreamPtr\nNewAutoPipeIstream(struct pool *pool, UnusedIstreamPtr input,\n\t\t   PipeStock *pipe_stock) noexcept\n{\n\treturn NewIstreamPtr<AutoPipeIstream>(*pool, std::move(input), pipe_stock);\n}\n<commit_msg>Revert \"istream\/AutoPipe: add missing Consumed() call\"<commit_after>\/*\n * Copyright 2007-2022 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 \"AutoPipeIstream.hxx\"\n#include \"PipeLease.hxx\"\n#include \"New.hxx\"\n#include \"UnusedPtr.hxx\"\n#include \"ForwardIstream.hxx\"\n#include \"system\/Error.hxx\"\n#include \"io\/Splice.hxx\"\n#include \"io\/SpliceSupport.hxx\"\n\n#include <assert.h>\n#include <errno.h>\n#include <string.h>\n\nclass AutoPipeIstream final : public ForwardIstream {\n\tPipeLease pipe;\n\tstd::size_t piped = 0;\n\n\tFdTypeMask direct_mask = 0;\n\npublic:\n\tAutoPipeIstream(struct pool &p, UnusedIstreamPtr _input,\n\t\t\tPipeStock *_pipe_stock) noexcept\n\t\t:ForwardIstream(p, std::move(_input)),\n\t\t pipe(_pipe_stock) {}\n\n\t\/* virtual methods from class Istream *\/\n\n\tvoid _SetDirect(FdTypeMask mask) noexcept override;\n\toff_t _GetAvailable(bool partial) noexcept override;\n\tvoid _Read() noexcept override;\n\n\tvoid _FillBucketList(IstreamBucketList &list) override {\n\t\tif (piped > 0)\n\t\t\treturn Istream::_FillBucketList(list);\n\n\t\ttry {\n\t\t\tinput.FillBucketList(list);\n\t\t} catch (...) {\n\t\t\tDestroy();\n\t\t\tthrow;\n\t\t}\n\t}\n\n\tvoid _ConsumeDirect(std::size_t nbytes) noexcept override;\n\n\tint _AsFd() noexcept override;\n\tvoid _Close() noexcept override;\n\n\t\/* handler *\/\n\tstd::size_t OnData(const void *data, std::size_t length) noexcept override;\n\tIstreamDirectResult OnDirect(FdType type, int fd,\n\t\t\t\t     std::size_t max_length) noexcept override;\n\tvoid OnEof() noexcept override;\n\tvoid OnError(std::exception_ptr ep) noexcept override;\n\nprivate:\n\tvoid CloseInternal() noexcept;\n\tvoid Abort(std::exception_ptr ep) noexcept;\n\tIstreamDirectResult Consume() noexcept;\n};\n\nvoid\nAutoPipeIstream::CloseInternal() noexcept\n{\n\t\/* reuse the pipe only if it's empty *\/\n\tpipe.Release(piped == 0);\n}\n\nvoid\nAutoPipeIstream::Abort(std::exception_ptr ep) noexcept\n{\n\tCloseInternal();\n\n\tDestroyError(ep);\n}\n\nIstreamDirectResult\nAutoPipeIstream::Consume() noexcept\n{\n\tassert(pipe.IsDefined());\n\tassert(piped > 0);\n\n\tauto result = InvokeDirect(FdType::FD_PIPE, pipe.GetReadFd().Get(),\n\t\t\t\t   piped);\n\tswitch (result) {\n\tcase IstreamDirectResult::BLOCKING:\n\tcase IstreamDirectResult::CLOSED:\n\t\t\/* handler blocks or pipe was closed *\/\n\t\tbreak;\n\n\tcase IstreamDirectResult::END:\n\t\t\/* must not happen *\/\n\t\tassert(false);\n\t\tgcc_unreachable();\n\n\tcase IstreamDirectResult::ERRNO:\n\t\tif (errno != EAGAIN) {\n\t\t\tAbort(std::make_exception_ptr(MakeErrno(\"read from pipe failed\")));\n\t\t\tresult = IstreamDirectResult::CLOSED;\n\t\t}\n\n\t\tbreak;\n\n\tcase IstreamDirectResult::OK:\n\t\tif (piped == 0 && !input.IsDefined()) {\n\t\t\t\/* our input has already reported EOF, and we have been\n\t\t\t   waiting for the pipe buffer to become empty *\/\n\t\t\tCloseInternal();\n\t\t\tDestroyEof();\n\t\t\tresult = IstreamDirectResult::CLOSED;\n\t\t}\n\n\t\tbreak;\n\t}\n\n\treturn result;\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\ninline std::size_t\nAutoPipeIstream::OnData(const void *data, std::size_t length) noexcept\n{\n\tassert(HasHandler());\n\n\tif (piped > 0) {\n\t\tconst auto result = Consume();\n\t\tif (result != IstreamDirectResult::OK)\n\t\t\treturn 0;\n\n\t\tif (piped > 0 || !HasHandler())\n\t\t\treturn 0;\n\t}\n\n\tassert(piped == 0);\n\n\treturn InvokeData(data, length);\n}\n\ninline IstreamDirectResult\nAutoPipeIstream::OnDirect(FdType type, int fd, std::size_t max_length) noexcept\n{\n\tassert(HasHandler());\n\n\tif (piped > 0) {\n\t\tconst auto result = Consume();\n\t\tif (result != IstreamDirectResult::OK)\n\t\t\treturn result;\n\n\t\tif (piped > 0)\n\t\t\t\/* if the pipe still isn't empty, we can't start reading\n\t\t\t   new input *\/\n\t\t\treturn IstreamDirectResult::BLOCKING;\n\t}\n\n\tif (direct_mask & FdTypeMask(type))\n\t\t\/* already supported by handler (maybe already a pipe) - no\n\t\t   need for wrapping it into a pipe *\/\n\t\treturn InvokeDirect(type, fd, max_length);\n\n\tassert((type & ISTREAM_TO_PIPE) == type);\n\n\tif (!pipe.IsDefined()) {\n\t\ttry {\n\t\t\tpipe.Create();\n\t\t} catch (...) {\n\t\t\tAbort(std::current_exception());\n\t\t\treturn IstreamDirectResult::CLOSED;\n\t\t}\n\t}\n\n\tssize_t nbytes = Splice(fd, pipe.GetWriteFd().Get(), max_length);\n\t\/* don't check EAGAIN here (and don't return -2).  We assume that\n\t   splicing to the pipe cannot possibly block, since we flushed\n\t   the pipe; assume that it can only be the source file which is\n\t   blocking *\/\n\tif (nbytes <= 0)\n\t\treturn nbytes < 0\n\t\t\t? IstreamDirectResult::ERRNO\n\t\t\t: IstreamDirectResult::END;\n\n\tinput.ConsumeDirect(nbytes);\n\n\tassert(piped == 0);\n\tpiped = (std::size_t)nbytes;\n\n\tif (Consume() == IstreamDirectResult::CLOSED)\n\t\treturn IstreamDirectResult::CLOSED;\n\n\treturn IstreamDirectResult::OK;\n}\n\ninline void\nAutoPipeIstream::OnEof() noexcept\n{\n\tinput.Clear();\n\n\tpipe.CloseWriteIfNotStock();\n\n\tif (piped == 0) {\n\t\tCloseInternal();\n\t\tDestroyEof();\n\t}\n}\n\ninline void\nAutoPipeIstream::OnError(std::exception_ptr ep) noexcept\n{\n\tCloseInternal();\n\tinput.Clear();\n\tDestroyError(ep);\n}\n\n\/*\n * istream implementation\n *\n *\/\n\nvoid\nAutoPipeIstream::_SetDirect(FdTypeMask mask) noexcept\n{\n\tdirect_mask = mask;\n\n\tif (mask & FdType::FD_PIPE)\n\t\t\/* if the handler supports the pipe, we offer our\n\t\t   services *\/\n\t\tmask |= ISTREAM_TO_PIPE;\n\n\tinput.SetDirect(mask);\n}\n\noff_t\nAutoPipeIstream::_GetAvailable(bool partial) noexcept\n{\n\tif (gcc_likely(input.IsDefined())) {\n\t\toff_t available = input.GetAvailable(partial);\n\t\tif (piped > 0) {\n\t\t\tif (available != -1)\n\t\t\t\tavailable += piped;\n\t\t\telse if (partial)\n\t\t\t\tavailable = piped;\n\t\t}\n\n\t\treturn available;\n\t} else {\n\t\tassert(piped > 0);\n\n\t\treturn piped;\n\t}\n}\n\nvoid\nAutoPipeIstream::_Read() noexcept\n{\n\tif (piped > 0 && (Consume() != IstreamDirectResult::OK || piped > 0))\n\t\treturn;\n\n\t\/* at this point, the pipe must be flushed - if the pipe is\n\t   flushed, this stream is either closed or there must be an input\n\t   stream *\/\n\tassert(input.IsDefined());\n\n\tinput.Read();\n}\n\nvoid\nAutoPipeIstream::_ConsumeDirect(std::size_t nbytes) noexcept\n{\n\tif (piped > 0) {\n\t\tassert(nbytes <= piped);\n\t\tpiped -= nbytes;\n\n\t\tif (piped == 0)\n\t\t\t\/* if the pipe was drained, return it to the\n\t\t\t   stock, to make it available to other\n\t\t\t   streams *\/\n\t\t\tpipe.ReleaseIfStock();\n\t} else {\n\t\tForwardIstream::_ConsumeDirect(nbytes);\n\t}\n}\n\nint\nAutoPipeIstream::_AsFd() noexcept\n{\n\tif (piped > 0)\n\t\t\/* need to flush the pipe buffer first *\/\n\t\treturn -1;\n\n\tint fd = input.AsFd();\n\tif (fd >= 0) {\n\t\tCloseInternal();\n\t\tDestroy();\n\t}\n\n\treturn fd;\n}\n\nvoid\nAutoPipeIstream::_Close() noexcept\n{\n\tCloseInternal();\n\n\tDestroy();\n}\n\n\/*\n * constructor\n *\n *\/\n\nUnusedIstreamPtr\nNewAutoPipeIstream(struct pool *pool, UnusedIstreamPtr input,\n\t\t   PipeStock *pipe_stock) noexcept\n{\n\treturn NewIstreamPtr<AutoPipeIstream>(*pool, std::move(input), pipe_stock);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This istream filter removes HTTP chunking.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_dechunk.hxx\"\n#include \"FacadeIstream.hxx\"\n#include \"pool.hxx\"\n\n#include <algorithm>\n\n#include <assert.h>\n#include <string.h>\n\nenum istream_dechunk_state {\n    NONE,\n    CLOSED,\n    SIZE,\n    AFTER_SIZE,\n    DATA,\n    AFTER_DATA,\n    TRAILER,\n    TRAILER_DATA,\n    EOF_DETECTED\n};\n\nclass DechunkIstream final : public FacadeIstream {\n    enum istream_dechunk_state state;\n\n    size_t remaining_chunk;\n    bool had_input, had_output;\n\n    \/**\n     * Copy chunked data verbatim to handler?\n     *\n     * @see istream_dechunk_check_verbatim()\n     *\/\n    bool verbatim = false;\n\n    \/**\n     * Was the end-of-file chunk seen at the end of #pending_verbatim?\n     *\/\n    bool eof_verbatim;\n\n    \/**\n     * Number of bytes to be passed to handler verbatim, which have\n     * already been parsed but have not yet been consumed by the\n     * handler.\n     *\/\n    size_t pending_verbatim;\n\n    void (*const eof_callback)(void *ctx);\n    void *const callback_ctx;\n\npublic:\n    DechunkIstream(struct pool &p, struct istream &_input,\n                   void (*_eof_callback)(void *ctx), void *_callback_ctx)\n        :FacadeIstream(p, _input,\n                       MakeIstreamHandler<DechunkIstream>::handler, this),\n         state(NONE),\n         eof_callback(_eof_callback), callback_ctx(_callback_ctx)\n    {\n    }\n\n    static DechunkIstream *CheckCast(Istream *i) {\n        return dynamic_cast<DechunkIstream *>(i);\n    }\n\n    static DechunkIstream *CheckCast(struct istream *i) {\n        if (!Istream::CheckClass(*i))\n            \/* not an Istream (OO) instance *\/\n            return nullptr;\n\n        return CheckCast(&Istream::Cast(*i));\n    }\n\n    void SetVerbatim() {\n        verbatim = true;\n        eof_verbatim = false;\n        pending_verbatim = 0;\n    }\n\n    void Abort(GError *error);\n\n    \/**\n     * @return false if the istream_dechunk has been aborted\n     * indirectly (by a callback)\n     *\/\n    bool EofDetected();\n\n    size_t Feed(const void *data, size_t length);\n\n    \/* virtual methods from class Istream *\/\n\n    off_t GetAvailable(bool partial) override;\n    void Read() override;\n    void Close() override;\n\n    \/* handler *\/\n    size_t OnData(const void *data, size_t length);\n\n    ssize_t OnDirect(gcc_unused FdType type, gcc_unused int fd,\n                     gcc_unused size_t max_length) {\n        gcc_unreachable();\n    }\n\n    void OnEof();\n    void OnError(GError *error);\n};\n\nstatic GQuark\ndechunk_quark(void)\n{\n    return g_quark_from_static_string(\"dechunk\");\n}\n\nvoid\nDechunkIstream::Abort(GError *error)\n{\n    assert(state != EOF_DETECTED && state != CLOSED);\n    assert(input.IsDefined());\n\n    state = CLOSED;\n\n    input.ClearAndClose();\n    DestroyError(error);\n}\n\nbool\nDechunkIstream::EofDetected()\n{\n    assert(input.IsDefined());\n    assert(state == TRAILER);\n    assert(remaining_chunk == 0);\n\n    state = EOF_DETECTED;\n\n    eof_callback(callback_ctx);\n\n    assert(input.IsDefined());\n    assert(state == EOF_DETECTED);\n\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n    DestroyEof();\n\n    if (state == CLOSED) {\n        assert(!input.IsDefined());\n\n        return false;\n    } else {\n        \/* we must deinitialize the \"input\" after emitting \"eof\",\n           because we must give the callback a chance to call\n           dechunk_input_abort() on us; if we'd clear the handler too\n           early, we wouldn't receive that event, and\n           dechunk_input_data() couldn't change its return value to\n           0 *\/\n        assert(input.IsDefined());\n\n        input.ClearHandler();\n        return true;\n    }\n}\n\nsize_t\nDechunkIstream::Feed(const void *data0, size_t length)\n{\n    const char *data = (const char *)data0;\n    size_t position = 0, digit, size, nbytes;\n\n    assert(input.IsDefined());\n    assert(!verbatim || !eof_verbatim);\n\n    if (verbatim)\n        \/* skip the part that has already been parsed in the last\n           invocation, but could not be consumed by the handler *\/\n        position = pending_verbatim;\n\n    had_input = true;\n\n    while (position < length) {\n        switch (state) {\n        case NONE:\n        case SIZE:\n            if (data[position] >= '0' && data[position] <= '9') {\n                digit = data[position] - '0';\n            } else if (data[position] >= 'a' && data[position] <= 'f') {\n                digit = data[position] - 'a' + 0xa;\n            } else if (data[position] >= 'A' && data[position] <= 'F') {\n                digit = data[position] - 'A' + 0xa;\n            } else if (state == SIZE) {\n                state = AFTER_SIZE;\n                ++position;\n                continue;\n            } else {\n                GError *error =\n                    g_error_new_literal(dechunk_quark(), 0,\n                                        \"chunk length expected\");\n                Abort(error);\n                return 0;\n            }\n\n            if (state == NONE) {\n                state = SIZE;\n                remaining_chunk = 0;\n            }\n\n            ++position;\n            remaining_chunk = remaining_chunk * 0x10 + digit;\n            break;\n\n        case CLOSED:\n            assert(0);\n            break;\n\n        case AFTER_SIZE:\n            if (data[position++] == '\\n') {\n                if (remaining_chunk == 0)\n                    state = TRAILER;\n                else\n                    state = DATA;\n            }\n            break;\n\n        case DATA:\n            assert(remaining_chunk > 0);\n\n            size = length - position;\n            if (size > remaining_chunk)\n                size = remaining_chunk;\n\n            if (verbatim) {\n                \/* postpone this data chunk; try to send it all later\n                   in one big block *\/\n                nbytes = size;\n            } else {\n                had_output = true;\n                nbytes = InvokeData(data + position, size);\n                assert(nbytes <= size);\n\n                if (nbytes == 0)\n                    return state == CLOSED ? 0 : position;\n            }\n\n            remaining_chunk -= nbytes;\n            if (remaining_chunk == 0)\n                state = AFTER_DATA;\n\n            position += nbytes;\n            break;\n\n        case AFTER_DATA:\n            if (data[position] == '\\n') {\n                state = NONE;\n            } else if (data[position] != '\\r') {\n                GError *error =\n                    g_error_new_literal(dechunk_quark(), 0,\n                                        \"newline expected\");\n                Abort(error);\n                return 0;\n            }\n            ++position;\n            break;\n\n        case TRAILER:\n            if (data[position] == '\\n') {\n                ++position;\n\n                if (verbatim) {\n                    \/* in \"verbatim\" mode, we need to send all data\n                       before handling the EOF chunk *\/\n                    had_output = true;\n                    nbytes = InvokeData(data, position);\n                    if (state == CLOSED)\n                        return 0;\n\n                    pending_verbatim = position - nbytes;\n                    if (pending_verbatim > 0) {\n                        \/* not everything could be sent; postpone to\n                           next call *\/\n                        eof_verbatim = true;\n                        return nbytes;\n                    }\n                }\n\n                return EofDetected() ? position : 0;\n            } else if (data[position] == '\\r') {\n                ++position;\n            } else {\n                ++position;\n                state = TRAILER_DATA;\n            }\n            break;\n\n        case TRAILER_DATA:\n            if (data[position++] == '\\n')\n                state = TRAILER;\n            break;\n\n        case EOF_DETECTED:\n            assert(0);\n            return 0;\n        }\n    }\n\n    if (verbatim && position > 0) {\n        \/* send all chunks in one big block *\/\n        had_output = true;\n        nbytes = InvokeData(data, position);\n        if (state == CLOSED)\n            return 0;\n\n        \/* postpone the rest that was not handled; it will not be\n           parsed again *\/\n        pending_verbatim = position - nbytes;\n        return nbytes;\n    }\n\n    return position;\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\nsize_t\nDechunkIstream::OnData(const void *data, size_t length)\n{\n    assert(!verbatim || length >= pending_verbatim);\n\n    if (verbatim && eof_verbatim) {\n        \/* during the last call, the EOF chunk was parsed, but we\n           could not handle it yet, because the handler did not\n           consume all data yet; try to send the remaining pre-EOF\n           data again and then handle the EOF chunk *\/\n\n        assert(pending_verbatim > 0);\n\n        assert(length >= pending_verbatim);\n\n        had_output = true;\n        size_t nbytes = InvokeData(data, pending_verbatim);\n        if (nbytes == 0)\n            return 0;\n\n        pending_verbatim -= nbytes;\n        if (pending_verbatim > 0)\n            \/* more data needed *\/\n            return nbytes;\n\n        return EofDetected() ? nbytes : 0;\n    }\n\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n    return Feed(data, length);\n}\n\nvoid\nDechunkIstream::OnEof()\n{\n    assert(state != EOF_DETECTED && state != CLOSED);\n\n    state = CLOSED;\n\n    input.Clear();\n\n    GError *error =\n        g_error_new_literal(dechunk_quark(), 0,\n                            \"premature EOF in dechunker\");\n    DestroyError(error);\n}\n\nvoid\nDechunkIstream::OnError(GError *error)\n{\n    input.Clear();\n\n    if (state != EOF_DETECTED)\n        DestroyError(error);\n    else\n        g_error_free(error);\n\n    state = CLOSED;\n}\n\n\/*\n * istream implementation\n *\n *\/\n\noff_t\nDechunkIstream::GetAvailable(bool partial)\n{\n    if (partial && state == DATA)\n        return (off_t)remaining_chunk;\n\n    return (off_t)-1;\n}\n\nvoid\nDechunkIstream::Read()\n{\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n\n    had_output = false;\n\n    do {\n        had_input = false;\n        input.Read();\n    } while (input.IsDefined() && had_input && !had_output);\n}\n\nvoid\nDechunkIstream::Close()\n{\n    assert(state != EOF_DETECTED);\n\n    state = CLOSED;\n\n    input.ClearHandlerAndClose();\n    Destroy();\n}\n\n\/*\n * constructor\n *\n *\/\n\nstruct istream *\nistream_dechunk_new(struct pool *pool, struct istream *input,\n                    void (*eof_callback)(void *ctx), void *callback_ctx)\n{\n    assert(input != nullptr);\n    assert(!istream_has_handler(input));\n    assert(eof_callback != nullptr);\n\n    return NewIstream<DechunkIstream>(*pool, *input,\n                                      eof_callback, callback_ctx);\n}\n\nbool\nistream_dechunk_check_verbatim(struct istream *i)\n{\n    auto *dechunk = DechunkIstream::CheckCast(i);\n    if (dechunk == nullptr)\n        \/* not a DechunkIstream instance *\/\n        return false;\n\n    dechunk->SetVerbatim();\n    return true;\n}\n<commit_msg>istream\/dechunk: move enum into the struct<commit_after>\/*\n * This istream filter removes HTTP chunking.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_dechunk.hxx\"\n#include \"FacadeIstream.hxx\"\n#include \"pool.hxx\"\n\n#include <algorithm>\n\n#include <assert.h>\n#include <string.h>\n\nclass DechunkIstream final : public FacadeIstream {\n    enum class State {\n        NONE,\n        CLOSED,\n        SIZE,\n        AFTER_SIZE,\n        DATA,\n        AFTER_DATA,\n        TRAILER,\n        TRAILER_DATA,\n        EOF_DETECTED\n    } state = State::NONE;\n\n    size_t remaining_chunk;\n    bool had_input, had_output;\n\n    \/**\n     * Copy chunked data verbatim to handler?\n     *\n     * @see istream_dechunk_check_verbatim()\n     *\/\n    bool verbatim = false;\n\n    \/**\n     * Was the end-of-file chunk seen at the end of #pending_verbatim?\n     *\/\n    bool eof_verbatim;\n\n    \/**\n     * Number of bytes to be passed to handler verbatim, which have\n     * already been parsed but have not yet been consumed by the\n     * handler.\n     *\/\n    size_t pending_verbatim;\n\n    void (*const eof_callback)(void *ctx);\n    void *const callback_ctx;\n\npublic:\n    DechunkIstream(struct pool &p, struct istream &_input,\n                   void (*_eof_callback)(void *ctx), void *_callback_ctx)\n        :FacadeIstream(p, _input,\n                       MakeIstreamHandler<DechunkIstream>::handler, this),\n         eof_callback(_eof_callback), callback_ctx(_callback_ctx)\n    {\n    }\n\n    static DechunkIstream *CheckCast(Istream *i) {\n        return dynamic_cast<DechunkIstream *>(i);\n    }\n\n    static DechunkIstream *CheckCast(struct istream *i) {\n        if (!Istream::CheckClass(*i))\n            \/* not an Istream (OO) instance *\/\n            return nullptr;\n\n        return CheckCast(&Istream::Cast(*i));\n    }\n\n    void SetVerbatim() {\n        verbatim = true;\n        eof_verbatim = false;\n        pending_verbatim = 0;\n    }\n\n    void Abort(GError *error);\n\n    \/**\n     * @return false if the istream_dechunk has been aborted\n     * indirectly (by a callback)\n     *\/\n    bool EofDetected();\n\n    size_t Feed(const void *data, size_t length);\n\n    \/* virtual methods from class Istream *\/\n\n    off_t GetAvailable(bool partial) override;\n    void Read() override;\n    void Close() override;\n\n    \/* handler *\/\n    size_t OnData(const void *data, size_t length);\n\n    ssize_t OnDirect(gcc_unused FdType type, gcc_unused int fd,\n                     gcc_unused size_t max_length) {\n        gcc_unreachable();\n    }\n\n    void OnEof();\n    void OnError(GError *error);\n};\n\nstatic GQuark\ndechunk_quark(void)\n{\n    return g_quark_from_static_string(\"dechunk\");\n}\n\nvoid\nDechunkIstream::Abort(GError *error)\n{\n    assert(state != State::EOF_DETECTED && state != State::CLOSED);\n    assert(input.IsDefined());\n\n    state = State::CLOSED;\n\n    input.ClearAndClose();\n    DestroyError(error);\n}\n\nbool\nDechunkIstream::EofDetected()\n{\n    assert(input.IsDefined());\n    assert(state == State::TRAILER);\n    assert(remaining_chunk == 0);\n\n    state = State::EOF_DETECTED;\n\n    eof_callback(callback_ctx);\n\n    assert(input.IsDefined());\n    assert(state == State::EOF_DETECTED);\n\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n    DestroyEof();\n\n    if (state == State::CLOSED) {\n        assert(!input.IsDefined());\n\n        return false;\n    } else {\n        \/* we must deinitialize the \"input\" after emitting \"eof\",\n           because we must give the callback a chance to call\n           dechunk_input_abort() on us; if we'd clear the handler too\n           early, we wouldn't receive that event, and\n           dechunk_input_data() couldn't change its return value to\n           0 *\/\n        assert(input.IsDefined());\n\n        input.ClearHandler();\n        return true;\n    }\n}\n\nsize_t\nDechunkIstream::Feed(const void *data0, size_t length)\n{\n    const char *data = (const char *)data0;\n    size_t position = 0, digit, size, nbytes;\n\n    assert(input.IsDefined());\n    assert(!verbatim || !eof_verbatim);\n\n    if (verbatim)\n        \/* skip the part that has already been parsed in the last\n           invocation, but could not be consumed by the handler *\/\n        position = pending_verbatim;\n\n    had_input = true;\n\n    while (position < length) {\n        switch (state) {\n        case State::NONE:\n        case State::SIZE:\n            if (data[position] >= '0' && data[position] <= '9') {\n                digit = data[position] - '0';\n            } else if (data[position] >= 'a' && data[position] <= 'f') {\n                digit = data[position] - 'a' + 0xa;\n            } else if (data[position] >= 'A' && data[position] <= 'F') {\n                digit = data[position] - 'A' + 0xa;\n            } else if (state == State::SIZE) {\n                state = State::AFTER_SIZE;\n                ++position;\n                continue;\n            } else {\n                GError *error =\n                    g_error_new_literal(dechunk_quark(), 0,\n                                        \"chunk length expected\");\n                Abort(error);\n                return 0;\n            }\n\n            if (state == State::NONE) {\n                state = State::SIZE;\n                remaining_chunk = 0;\n            }\n\n            ++position;\n            remaining_chunk = remaining_chunk * 0x10 + digit;\n            break;\n\n        case State::CLOSED:\n            assert(0);\n            break;\n\n        case State::AFTER_SIZE:\n            if (data[position++] == '\\n') {\n                if (remaining_chunk == 0)\n                    state = State::TRAILER;\n                else\n                    state = State::DATA;\n            }\n            break;\n\n        case State::DATA:\n            assert(remaining_chunk > 0);\n\n            size = length - position;\n            if (size > remaining_chunk)\n                size = remaining_chunk;\n\n            if (verbatim) {\n                \/* postpone this data chunk; try to send it all later\n                   in one big block *\/\n                nbytes = size;\n            } else {\n                had_output = true;\n                nbytes = InvokeData(data + position, size);\n                assert(nbytes <= size);\n\n                if (nbytes == 0)\n                    return state == State::CLOSED ? 0 : position;\n            }\n\n            remaining_chunk -= nbytes;\n            if (remaining_chunk == 0)\n                state = State::AFTER_DATA;\n\n            position += nbytes;\n            break;\n\n        case State::AFTER_DATA:\n            if (data[position] == '\\n') {\n                state = State::NONE;\n            } else if (data[position] != '\\r') {\n                GError *error =\n                    g_error_new_literal(dechunk_quark(), 0,\n                                        \"newline expected\");\n                Abort(error);\n                return 0;\n            }\n            ++position;\n            break;\n\n        case State::TRAILER:\n            if (data[position] == '\\n') {\n                ++position;\n\n                if (verbatim) {\n                    \/* in \"verbatim\" mode, we need to send all data\n                       before handling the EOF chunk *\/\n                    had_output = true;\n                    nbytes = InvokeData(data, position);\n                    if (state == State::CLOSED)\n                        return 0;\n\n                    pending_verbatim = position - nbytes;\n                    if (pending_verbatim > 0) {\n                        \/* not everything could be sent; postpone to\n                           next call *\/\n                        eof_verbatim = true;\n                        return nbytes;\n                    }\n                }\n\n                return EofDetected() ? position : 0;\n            } else if (data[position] == '\\r') {\n                ++position;\n            } else {\n                ++position;\n                state = State::TRAILER_DATA;\n            }\n            break;\n\n        case State::TRAILER_DATA:\n            if (data[position++] == '\\n')\n                state = State::TRAILER;\n            break;\n\n        case State::EOF_DETECTED:\n            assert(0);\n            return 0;\n        }\n    }\n\n    if (verbatim && position > 0) {\n        \/* send all chunks in one big block *\/\n        had_output = true;\n        nbytes = InvokeData(data, position);\n        if (state == State::CLOSED)\n            return 0;\n\n        \/* postpone the rest that was not handled; it will not be\n           parsed again *\/\n        pending_verbatim = position - nbytes;\n        return nbytes;\n    }\n\n    return position;\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\nsize_t\nDechunkIstream::OnData(const void *data, size_t length)\n{\n    assert(!verbatim || length >= pending_verbatim);\n\n    if (verbatim && eof_verbatim) {\n        \/* during the last call, the EOF chunk was parsed, but we\n           could not handle it yet, because the handler did not\n           consume all data yet; try to send the remaining pre-EOF\n           data again and then handle the EOF chunk *\/\n\n        assert(pending_verbatim > 0);\n\n        assert(length >= pending_verbatim);\n\n        had_output = true;\n        size_t nbytes = InvokeData(data, pending_verbatim);\n        if (nbytes == 0)\n            return 0;\n\n        pending_verbatim -= nbytes;\n        if (pending_verbatim > 0)\n            \/* more data needed *\/\n            return nbytes;\n\n        return EofDetected() ? nbytes : 0;\n    }\n\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n    return Feed(data, length);\n}\n\nvoid\nDechunkIstream::OnEof()\n{\n    assert(state != State::EOF_DETECTED && state != State::CLOSED);\n\n    state = State::CLOSED;\n\n    input.Clear();\n\n    GError *error =\n        g_error_new_literal(dechunk_quark(), 0,\n                            \"premature EOF in dechunker\");\n    DestroyError(error);\n}\n\nvoid\nDechunkIstream::OnError(GError *error)\n{\n    input.Clear();\n\n    if (state != State::EOF_DETECTED)\n        DestroyError(error);\n    else\n        g_error_free(error);\n\n    state = State::CLOSED;\n}\n\n\/*\n * istream implementation\n *\n *\/\n\noff_t\nDechunkIstream::GetAvailable(bool partial)\n{\n    if (partial && state == State::DATA)\n        return (off_t)remaining_chunk;\n\n    return (off_t)-1;\n}\n\nvoid\nDechunkIstream::Read()\n{\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n\n    had_output = false;\n\n    do {\n        had_input = false;\n        input.Read();\n    } while (input.IsDefined() && had_input && !had_output);\n}\n\nvoid\nDechunkIstream::Close()\n{\n    assert(state != State::EOF_DETECTED);\n\n    state = State::CLOSED;\n\n    input.ClearHandlerAndClose();\n    Destroy();\n}\n\n\/*\n * constructor\n *\n *\/\n\nstruct istream *\nistream_dechunk_new(struct pool *pool, struct istream *input,\n                    void (*eof_callback)(void *ctx), void *callback_ctx)\n{\n    assert(input != nullptr);\n    assert(!istream_has_handler(input));\n    assert(eof_callback != nullptr);\n\n    return NewIstream<DechunkIstream>(*pool, *input,\n                                      eof_callback, callback_ctx);\n}\n\nbool\nistream_dechunk_check_verbatim(struct istream *i)\n{\n    auto *dechunk = DechunkIstream::CheckCast(i);\n    if (dechunk == nullptr)\n        \/* not a DechunkIstream instance *\/\n        return false;\n\n    dechunk->SetVerbatim();\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_deflate.hxx\"\n#include \"FacadeIstream.hxx\"\n#include \"pool.hxx\"\n#include \"event\/DeferEvent.hxx\"\n#include \"event\/Callback.hxx\"\n#include \"util\/Cast.hxx\"\n#include \"util\/ConstBuffer.hxx\"\n#include \"util\/WritableBuffer.hxx\"\n#include \"util\/StaticFifoBuffer.hxx\"\n\n#include <daemon\/log.h>\n\n#include <zlib.h>\n\n#include <assert.h>\n\nclass DeflateIstream final : public FacadeIstream {\n    bool z_initialized = false, z_stream_end = false;\n    z_stream z;\n    bool had_input, had_output;\n    bool reading;\n    StaticFifoBuffer<uint8_t, 4096> buffer;\n\n    \/**\n     * This callback is used to request more data from the input if an\n     * OnData() call did not produce any output.  This tries to\n     * prevent stalling the stream.\n     *\/\n    DeferEvent defer;\n\npublic:\n    DeflateIstream(struct pool &pool, struct istream &_input)\n        :FacadeIstream(pool, _input,\n                       MakeIstreamHandler<DeflateIstream>::handler, this),\n         reading(false)\n    {\n        buffer.Clear();\n        defer.Init(MakeSimpleEventCallback(DeflateIstream, OnDeferred), this);\n    }\n\n    ~DeflateIstream() {\n        defer.Deinit();\n    }\n\n    bool InitZlib();\n\n    void DeinitZlib() {\n        if (z_initialized) {\n            z_initialized = false;\n            deflateEnd(&z);\n        }\n    }\n\n    void Abort(GError *error) {\n        DeinitZlib();\n\n        if (HasInput())\n            ClearAndCloseInput();\n\n        DestroyError(error);\n    }\n\n    \/**\n     * Submit data from the buffer to our istream handler.\n     *\n     * @return the number of bytes which were handled, or 0 if the\n     * stream was closed\n     *\/\n    size_t TryWrite();\n\n    \/**\n     * Starts to write to the buffer.\n     *\n     * @return a pointer to the writable buffer, or nullptr if there is no\n     * room (our istream handler blocks) or if the stream was closed\n     *\/\n    WritableBuffer<void> BufferWrite() {\n        auto w = buffer.Write();\n        if (w.IsEmpty() && TryWrite() > 0)\n            w = buffer.Write();\n\n        return w.ToVoid();\n    }\n\n    void TryFlush();\n\n    \/**\n     * Read from our input until we have submitted some bytes to our\n     * istream handler.\n     *\/\n    void ForceRead();\n\n    void TryFinish();\n\n    \/* virtual methods from class Istream *\/\n\n    void Read() override {\n        if (!buffer.IsEmpty())\n            TryWrite();\n        else if (HasInput())\n            ForceRead();\n        else\n            TryFinish();\n    }\n\n    void Close() override {\n        DeinitZlib();\n\n        if (HasInput())\n            input.Close();\n\n        Destroy();\n    }\n\n    \/* handler *\/\n    size_t OnData(const void *data, size_t length);\n\n    ssize_t OnDirect(gcc_unused FdType type, gcc_unused int fd,\n                     gcc_unused size_t max_length) {\n        gcc_unreachable();\n    }\n\n    void OnEof();\n    void OnError(GError *error);\n\nprivate:\n    void OnDeferred() {\n        assert(HasInput());\n\n        ForceRead();\n    }\n};\n\ngcc_const\nstatic GQuark\nzlib_quark(void)\n{\n    return g_quark_from_static_string(\"zlib\");\n}\n\nstatic voidpf z_alloc\n(voidpf opaque, uInt items, uInt size)\n{\n    struct pool *pool = (struct pool *)opaque;\n\n    return p_malloc(pool, items * size);\n}\n\nstatic void\nz_free(voidpf opaque, voidpf address)\n{\n    (void)opaque;\n    (void)address;\n}\n\nbool\nDeflateIstream::InitZlib()\n{\n    if (z_initialized)\n        return true;\n\n    z.zalloc = z_alloc;\n    z.zfree = z_free;\n    z.opaque = &GetPool();\n\n    int err = deflateInit(&z, Z_DEFAULT_COMPRESSION);\n    if (err != Z_OK) {\n        GError *error =\n            g_error_new(zlib_quark(), err,\n                        \"deflateInit(Z_FINISH) failed: %d\", err);\n        Abort(error);\n        return false;\n    }\n\n    z_initialized = true;\n    return true;\n}\n\nsize_t\nDeflateIstream::TryWrite()\n{\n    auto r = buffer.Read();\n    assert(!r.IsEmpty());\n\n    size_t nbytes = InvokeData(r.data, r.size);\n    if (nbytes == 0)\n        return 0;\n\n    buffer.Consume(nbytes);\n\n    if (nbytes == r.size && !HasInput() && z_stream_end) {\n        DeinitZlib();\n        DestroyEof();\n        return 0;\n    }\n\n    return nbytes;\n}\n\ninline void\nDeflateIstream::TryFlush()\n{\n    assert(!z_stream_end);\n\n    auto w = BufferWrite();\n    if (w.IsEmpty())\n        return;\n\n    z.next_out = (Bytef *)w.data;\n    z.avail_out = (uInt)w.size;\n\n    z.next_in = nullptr;\n    z.avail_in = 0;\n\n    int err = deflate(&z, Z_SYNC_FLUSH);\n    if (err != Z_OK) {\n        GError *error =\n            g_error_new(zlib_quark(), err,\n                        \"deflate(Z_SYNC_FLUSH) failed: %d\", err);\n        Abort(error);\n        return;\n    }\n\n    buffer.Append(w.size - (size_t)z.avail_out);\n\n    if (!buffer.IsEmpty())\n        TryWrite();\n}\n\ninline\nvoid\nDeflateIstream::ForceRead()\n{\n    assert(!reading);\n\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n\n    bool had_input2 = false;\n    had_output = false;\n\n    while (1) {\n        had_input = false;\n        reading = true;\n        input.Read();\n        reading = false;\n        if (!HasInput() || had_output)\n            return;\n\n        if (!had_input)\n            break;\n\n        had_input2 = true;\n    }\n\n    if (had_input2)\n        TryFlush();\n}\n\nvoid\nDeflateIstream::TryFinish()\n{\n    assert(!z_stream_end);\n\n    auto w = BufferWrite();\n    if (w.IsEmpty())\n        return;\n\n    z.next_out = (Bytef *)w.data;\n    z.avail_out = (uInt)w.size;\n\n    z.next_in = nullptr;\n    z.avail_in = 0;\n\n    int err = deflate(&z, Z_FINISH);\n    if (err == Z_STREAM_END)\n        z_stream_end = true;\n    else if (err != Z_OK) {\n        GError *error =\n            g_error_new(zlib_quark(), err,\n                        \"deflate(Z_FINISH) failed: %d\", err);\n        Abort(error);\n        return;\n    }\n\n    buffer.Append(w.size - (size_t)z.avail_out);\n\n    if (z_stream_end && buffer.IsEmpty()) {\n        DeinitZlib();\n        DestroyEof();\n    } else\n        TryWrite();\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\nsize_t\nDeflateIstream::OnData(const void *data, size_t length)\n{\n    assert(HasInput());\n\n    auto w = BufferWrite();\n    if (w.size < 64) \/* reserve space for end-of-stream marker *\/\n        return 0;\n\n    if (!InitZlib())\n        return 0;\n\n    had_input = true;\n\n    if (!reading)\n        had_output = false;\n\n    z.next_out = (Bytef *)w.data;\n    z.avail_out = (uInt)w.size;\n\n    z.next_in = (Bytef *)const_cast<void *>(data);\n    z.avail_in = (uInt)length;\n\n    do {\n        auto err = deflate(&z, Z_NO_FLUSH);\n        if (err != Z_OK) {\n            GError *error =\n                g_error_new(zlib_quark(), err,\n                            \"deflate() failed: %d\", err);\n            Abort(error);\n            return 0;\n        }\n\n        size_t nbytes = w.size - (size_t)z.avail_out;\n        if (nbytes > 0) {\n            had_output = true;\n            buffer.Append(nbytes);\n\n            const ScopePoolRef ref(GetPool() TRACE_ARGS);\n            TryWrite();\n\n            if (!z_initialized)\n                return 0;\n        } else\n            break;\n\n        w = BufferWrite();\n        if (w.size < 64) \/* reserve space for end-of-stream marker *\/\n            break;\n\n        z.next_out = (Bytef *)w.data;\n        z.avail_out = (uInt)w.size;\n    } while (z.avail_in > 0);\n\n    if (!reading && !had_output)\n        \/* we received data from our input, but we did not produce any\n           output (and we're not looping inside ForceRead()) - to\n           avoid stalling the stream, trigger the DeferEvent *\/\n        defer.Add();\n\n    return length - (size_t)z.avail_in;\n}\n\nvoid\nDeflateIstream::OnEof()\n{\n    ClearInput();\n    defer.Cancel();\n\n    if (!InitZlib())\n        return;\n\n    TryFinish();\n}\n\nvoid\nDeflateIstream::OnError(GError *error)\n{\n    ClearInput();\n\n    DeinitZlib();\n\n    DestroyError(error);\n}\n\n\/*\n * constructor\n *\n *\/\n\nstruct istream *\nistream_deflate_new(struct pool *pool, struct istream *input)\n{\n    assert(input != nullptr);\n    assert(!istream_has_handler(input));\n\n    return NewIstream<DeflateIstream>(*pool, *input);\n}\n<commit_msg>istream\/deflate: use deflateInit2()<commit_after>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_deflate.hxx\"\n#include \"FacadeIstream.hxx\"\n#include \"pool.hxx\"\n#include \"event\/DeferEvent.hxx\"\n#include \"event\/Callback.hxx\"\n#include \"util\/Cast.hxx\"\n#include \"util\/ConstBuffer.hxx\"\n#include \"util\/WritableBuffer.hxx\"\n#include \"util\/StaticFifoBuffer.hxx\"\n\n#include <daemon\/log.h>\n\n#include <zlib.h>\n\n#include <assert.h>\n\nclass DeflateIstream final : public FacadeIstream {\n    bool z_initialized = false, z_stream_end = false;\n    z_stream z;\n    bool had_input, had_output;\n    bool reading;\n    StaticFifoBuffer<uint8_t, 4096> buffer;\n\n    \/**\n     * This callback is used to request more data from the input if an\n     * OnData() call did not produce any output.  This tries to\n     * prevent stalling the stream.\n     *\/\n    DeferEvent defer;\n\npublic:\n    DeflateIstream(struct pool &pool, struct istream &_input)\n        :FacadeIstream(pool, _input,\n                       MakeIstreamHandler<DeflateIstream>::handler, this),\n         reading(false)\n    {\n        buffer.Clear();\n        defer.Init(MakeSimpleEventCallback(DeflateIstream, OnDeferred), this);\n    }\n\n    ~DeflateIstream() {\n        defer.Deinit();\n    }\n\n    bool InitZlib();\n\n    void DeinitZlib() {\n        if (z_initialized) {\n            z_initialized = false;\n            deflateEnd(&z);\n        }\n    }\n\n    void Abort(GError *error) {\n        DeinitZlib();\n\n        if (HasInput())\n            ClearAndCloseInput();\n\n        DestroyError(error);\n    }\n\n    \/**\n     * Submit data from the buffer to our istream handler.\n     *\n     * @return the number of bytes which were handled, or 0 if the\n     * stream was closed\n     *\/\n    size_t TryWrite();\n\n    \/**\n     * Starts to write to the buffer.\n     *\n     * @return a pointer to the writable buffer, or nullptr if there is no\n     * room (our istream handler blocks) or if the stream was closed\n     *\/\n    WritableBuffer<void> BufferWrite() {\n        auto w = buffer.Write();\n        if (w.IsEmpty() && TryWrite() > 0)\n            w = buffer.Write();\n\n        return w.ToVoid();\n    }\n\n    void TryFlush();\n\n    \/**\n     * Read from our input until we have submitted some bytes to our\n     * istream handler.\n     *\/\n    void ForceRead();\n\n    void TryFinish();\n\n    \/* virtual methods from class Istream *\/\n\n    void Read() override {\n        if (!buffer.IsEmpty())\n            TryWrite();\n        else if (HasInput())\n            ForceRead();\n        else\n            TryFinish();\n    }\n\n    void Close() override {\n        DeinitZlib();\n\n        if (HasInput())\n            input.Close();\n\n        Destroy();\n    }\n\n    \/* handler *\/\n    size_t OnData(const void *data, size_t length);\n\n    ssize_t OnDirect(gcc_unused FdType type, gcc_unused int fd,\n                     gcc_unused size_t max_length) {\n        gcc_unreachable();\n    }\n\n    void OnEof();\n    void OnError(GError *error);\n\nprivate:\n    void OnDeferred() {\n        assert(HasInput());\n\n        ForceRead();\n    }\n};\n\ngcc_const\nstatic GQuark\nzlib_quark(void)\n{\n    return g_quark_from_static_string(\"zlib\");\n}\n\nstatic voidpf z_alloc\n(voidpf opaque, uInt items, uInt size)\n{\n    struct pool *pool = (struct pool *)opaque;\n\n    return p_malloc(pool, items * size);\n}\n\nstatic void\nz_free(voidpf opaque, voidpf address)\n{\n    (void)opaque;\n    (void)address;\n}\n\nbool\nDeflateIstream::InitZlib()\n{\n    if (z_initialized)\n        return true;\n\n    z.zalloc = z_alloc;\n    z.zfree = z_free;\n    z.opaque = &GetPool();\n\n    int err = deflateInit2(&z, Z_DEFAULT_COMPRESSION,\n                           Z_DEFLATED, MAX_WBITS, 8,\n                           Z_DEFAULT_STRATEGY);\n    if (err != Z_OK) {\n        GError *error =\n            g_error_new(zlib_quark(), err,\n                        \"deflateInit(Z_FINISH) failed: %d\", err);\n        Abort(error);\n        return false;\n    }\n\n    z_initialized = true;\n    return true;\n}\n\nsize_t\nDeflateIstream::TryWrite()\n{\n    auto r = buffer.Read();\n    assert(!r.IsEmpty());\n\n    size_t nbytes = InvokeData(r.data, r.size);\n    if (nbytes == 0)\n        return 0;\n\n    buffer.Consume(nbytes);\n\n    if (nbytes == r.size && !HasInput() && z_stream_end) {\n        DeinitZlib();\n        DestroyEof();\n        return 0;\n    }\n\n    return nbytes;\n}\n\ninline void\nDeflateIstream::TryFlush()\n{\n    assert(!z_stream_end);\n\n    auto w = BufferWrite();\n    if (w.IsEmpty())\n        return;\n\n    z.next_out = (Bytef *)w.data;\n    z.avail_out = (uInt)w.size;\n\n    z.next_in = nullptr;\n    z.avail_in = 0;\n\n    int err = deflate(&z, Z_SYNC_FLUSH);\n    if (err != Z_OK) {\n        GError *error =\n            g_error_new(zlib_quark(), err,\n                        \"deflate(Z_SYNC_FLUSH) failed: %d\", err);\n        Abort(error);\n        return;\n    }\n\n    buffer.Append(w.size - (size_t)z.avail_out);\n\n    if (!buffer.IsEmpty())\n        TryWrite();\n}\n\ninline\nvoid\nDeflateIstream::ForceRead()\n{\n    assert(!reading);\n\n    const ScopePoolRef ref(GetPool() TRACE_ARGS);\n\n    bool had_input2 = false;\n    had_output = false;\n\n    while (1) {\n        had_input = false;\n        reading = true;\n        input.Read();\n        reading = false;\n        if (!HasInput() || had_output)\n            return;\n\n        if (!had_input)\n            break;\n\n        had_input2 = true;\n    }\n\n    if (had_input2)\n        TryFlush();\n}\n\nvoid\nDeflateIstream::TryFinish()\n{\n    assert(!z_stream_end);\n\n    auto w = BufferWrite();\n    if (w.IsEmpty())\n        return;\n\n    z.next_out = (Bytef *)w.data;\n    z.avail_out = (uInt)w.size;\n\n    z.next_in = nullptr;\n    z.avail_in = 0;\n\n    int err = deflate(&z, Z_FINISH);\n    if (err == Z_STREAM_END)\n        z_stream_end = true;\n    else if (err != Z_OK) {\n        GError *error =\n            g_error_new(zlib_quark(), err,\n                        \"deflate(Z_FINISH) failed: %d\", err);\n        Abort(error);\n        return;\n    }\n\n    buffer.Append(w.size - (size_t)z.avail_out);\n\n    if (z_stream_end && buffer.IsEmpty()) {\n        DeinitZlib();\n        DestroyEof();\n    } else\n        TryWrite();\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\nsize_t\nDeflateIstream::OnData(const void *data, size_t length)\n{\n    assert(HasInput());\n\n    auto w = BufferWrite();\n    if (w.size < 64) \/* reserve space for end-of-stream marker *\/\n        return 0;\n\n    if (!InitZlib())\n        return 0;\n\n    had_input = true;\n\n    if (!reading)\n        had_output = false;\n\n    z.next_out = (Bytef *)w.data;\n    z.avail_out = (uInt)w.size;\n\n    z.next_in = (Bytef *)const_cast<void *>(data);\n    z.avail_in = (uInt)length;\n\n    do {\n        auto err = deflate(&z, Z_NO_FLUSH);\n        if (err != Z_OK) {\n            GError *error =\n                g_error_new(zlib_quark(), err,\n                            \"deflate() failed: %d\", err);\n            Abort(error);\n            return 0;\n        }\n\n        size_t nbytes = w.size - (size_t)z.avail_out;\n        if (nbytes > 0) {\n            had_output = true;\n            buffer.Append(nbytes);\n\n            const ScopePoolRef ref(GetPool() TRACE_ARGS);\n            TryWrite();\n\n            if (!z_initialized)\n                return 0;\n        } else\n            break;\n\n        w = BufferWrite();\n        if (w.size < 64) \/* reserve space for end-of-stream marker *\/\n            break;\n\n        z.next_out = (Bytef *)w.data;\n        z.avail_out = (uInt)w.size;\n    } while (z.avail_in > 0);\n\n    if (!reading && !had_output)\n        \/* we received data from our input, but we did not produce any\n           output (and we're not looping inside ForceRead()) - to\n           avoid stalling the stream, trigger the DeferEvent *\/\n        defer.Add();\n\n    return length - (size_t)z.avail_in;\n}\n\nvoid\nDeflateIstream::OnEof()\n{\n    ClearInput();\n    defer.Cancel();\n\n    if (!InitZlib())\n        return;\n\n    TryFinish();\n}\n\nvoid\nDeflateIstream::OnError(GError *error)\n{\n    ClearInput();\n\n    DeinitZlib();\n\n    DestroyError(error);\n}\n\n\/*\n * constructor\n *\n *\/\n\nstruct istream *\nistream_deflate_new(struct pool *pool, struct istream *input)\n{\n    assert(input != nullptr);\n    assert(!istream_has_handler(input));\n\n    return NewIstream<DeflateIstream>(*pool, *input);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 %s -I%S -triple=x86_64-apple-darwin10 -emit-llvm -o - | FileCheck %s\n#include <typeinfo>\n\n\/\/ CHECK: _ZTS1B = constant\n\/\/ CHECK: _ZTS1A = weak_odr constant\n\/\/ CHECK: _ZTI1A = weak_odr constant\n\/\/ CHECK: _ZTI1B = constant\n\/\/ CHECK: _ZTSP1C = internal constant\n\/\/ CHECK: _ZTS1C = internal constant\n\/\/ CHECK: _ZTI1C = internal constant\n\/\/ CHECK: _ZTIP1C = internal constant\n\/\/ CHECK: _ZTSPP1C = internal constant\n\/\/ CHECK: _ZTIPP1C = internal constant\n\/\/ CHECK: _ZTSM1Ci = internal constant\n\/\/ CHECK: _ZTIM1Ci = internal constant\n\/\/ CHECK: _ZTSPM1Ci = internal constant\n\/\/ CHECK: _ZTIPM1Ci = internal constant\n\/\/ CHECK: _ZTSM1CS_ = internal constant\n\/\/ CHECK: _ZTIM1CS_ = internal constant\n\/\/ CHECK: _ZTSM1CPS_ = internal constant\n\/\/ CHECK: _ZTIM1CPS_ = internal constant\n\/\/ CHECK: _ZTSM1A1C = internal constant\n\/\/ CHECK: _ZTIM1A1C = internal constant\n\/\/ CHECK: _ZTSM1AP1C = internal constant\n\/\/ CHECK: _ZTIM1AP1C = internal constant\n\n\/\/ A has no key function, so its RTTI data should be weak_odr.\nstruct A { };\n\n\/\/ B has a key function defined in the translation unit, so the RTTI data should\n\/\/ be emitted in this translation unit and have external linkage.\nstruct B : A {\n  virtual void f();\n};\nvoid B::f() { }\n\n\/\/ C is an incomplete class type, so any direct or indirect pointer types should have \n\/\/ internal linkage, as should the type info for C itself (FIXME).\nstruct C;\n\nvoid f() {\n  (void)typeid(C*);\n  (void)typeid(C**);\n  (void)typeid(int C::*);\n  (void)typeid(int C::**);\n  (void)typeid(C C::*);\n  (void)typeid(C *C::*);\n  (void)typeid(C A::*);\n  (void)typeid(C* A::*);\n  \n}\n\n<commit_msg>Add tests for structs inside anonymous namespaces.<commit_after>\/\/ RUN: %clang_cc1 %s -I%S -triple=x86_64-apple-darwin10 -emit-llvm -o - | FileCheck %s\n#include <typeinfo>\n\n\/\/ CHECK: _ZTS1B = constant\n\/\/ CHECK: _ZTS1A = weak_odr constant\n\/\/ CHECK: _ZTI1A = weak_odr constant\n\/\/ CHECK: _ZTI1B = constant\n\/\/ CHECK: _ZTSP1C = internal constant\n\/\/ CHECK: _ZTS1C = internal constant\n\/\/ CHECK: _ZTI1C = internal constant\n\/\/ CHECK: _ZTIP1C = internal constant\n\/\/ CHECK: _ZTSPP1C = internal constant\n\/\/ CHECK: _ZTIPP1C = internal constant\n\/\/ CHECK: _ZTSM1Ci = internal constant\n\/\/ CHECK: _ZTIM1Ci = internal constant\n\/\/ CHECK: _ZTSPM1Ci = internal constant\n\/\/ CHECK: _ZTIPM1Ci = internal constant\n\/\/ CHECK: _ZTSM1CS_ = internal constant\n\/\/ CHECK: _ZTIM1CS_ = internal constant\n\/\/ CHECK: _ZTSM1CPS_ = internal constant\n\/\/ CHECK: _ZTIM1CPS_ = internal constant\n\/\/ CHECK: _ZTSM1A1C = internal constant\n\/\/ CHECK: _ZTIM1A1C = internal constant\n\/\/ CHECK: _ZTSM1AP1C = internal constant\n\/\/ CHECK: _ZTIM1AP1C = internal constant\n\n\/\/ CHECK: _ZTSN12_GLOBAL__N_11DE = internal constant\n\/\/ CHECK: _ZTIN12_GLOBAL__N_11DE = internal constant\n\/\/ CHECK: _ZTSPN12_GLOBAL__N_11DE = internal constant\n\/\/ CHECK: _ZTIPN12_GLOBAL__N_11DE = internal constant\n\n\/\/ A has no key function, so its RTTI data should be weak_odr.\nstruct A { };\n\n\/\/ B has a key function defined in the translation unit, so the RTTI data should\n\/\/ be emitted in this translation unit and have external linkage.\nstruct B : A {\n  virtual void f();\n};\nvoid B::f() { }\n\n\/\/ C is an incomplete class type, so any direct or indirect pointer types should have \n\/\/ internal linkage, as should the type info for C itself (FIXME).\nstruct C;\n\nvoid t1() {\n  (void)typeid(C*);\n  (void)typeid(C**);\n  (void)typeid(int C::*);\n  (void)typeid(int C::**);\n  (void)typeid(C C::*);\n  (void)typeid(C *C::*);\n  (void)typeid(C A::*);\n  (void)typeid(C* A::*);\n}\n\nnamespace {\n  \/\/ D is inside an anonymous namespace, so all type information related to D should have\n  \/\/ internal linkage.\n  struct D { };\n};\n\nvoid t2() {\n  (void)typeid(D);\n  (void)typeid(D *);\n  \n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2014.\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 <print.hpp>\n#include <system.hpp>\n#include <string.hpp>\n\nint main(){\n    char input_buffer[64];\n\n    while(true){\n        print(\"thor> \");\n\n        auto c = read_input(input_buffer, 63);\n\n        if(input_buffer[c-1] == '\\n'){\n            if(c == 1){\n                print_line();\n                continue;\n            }\n\n            input_buffer[c] = '\\0';\n\n            if(str_equals(input_buffer, \"exit\")){\n                exit(0);\n            } else if(str_equals(input_buffer, \"long\")){\n                \/\/TODO Remove this function when exec system is complete\n                exec_and_wait(\"long\");\n            } else if(str_equals(input_buffer, \"sleep\")){\n                \/\/TODO Once better infrastrucure, parse command line and sleep the\n                \/\/correct number of milliseconds\n                sleep_ms(5000);\n            } else {\n                print_line(\"Unknown command\");\n            }\n        } else {\n            \/\/TODO Once in good shape, just append to current input buffer\n        }\n\n    }\n}<commit_msg>Fix parsing<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2014.\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 <print.hpp>\n#include <system.hpp>\n#include <string.hpp>\n\nint main(){\n    char input_buffer[64];\n\n    while(true){\n        print(\"thor> \");\n\n        auto c = read_input(input_buffer, 63);\n\n        if(input_buffer[c-1] == '\\n'){\n            if(c == 1){\n                print_line();\n                continue;\n            }\n\n            input_buffer[c-1] = '\\0';\n\n            if(str_equals(input_buffer, \"exit\")){\n                exit(0);\n            } else if(str_equals(input_buffer, \"long\")){\n                \/\/TODO Remove this function when exec system is complete\n                exec_and_wait(\"long\");\n            } else if(str_equals(input_buffer, \"sleep\")){\n                \/\/TODO Once better infrastrucure, parse command line and sleep the\n                \/\/correct number of milliseconds\n                sleep_ms(5000);\n            } else {\n                print_line(\"Unknown command\");\n            }\n        } else {\n            \/\/TODO Once in good shape, just append to current input buffer\n        }\n\n    }\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n *  niicomplex.cpp\n *\n *  Created by Tobias Wood on 03\/06\/2015.\n *  Copyright (c) 2015 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 <random>\n#include <functional>\n\n#include \"itkImage.h\"\n#include \"itkComplexToPhaseImageFilter.h\"\n#include \"itkComplexToModulusImageFilter.h\"\n#include \"itkComplexToRealImageFilter.h\"\n#include \"itkComplexToImaginaryImageFilter.h\"\n#include \"itkComposeImageFilter.h\"\n#include \"itkMagnitudeAndPhaseToComplexImageFilter.h\"\n\n#include \"Util.h\"\n#include \"Types.h\"\n\nusing namespace std;\n\nconst string usage {\n\"Usage is: qcomplex [input options] [output options] [other options] \\n\\\n\\n\\\nInput is specified with lower case letters. One of the following\\n\\\ncombinations must be specified:\\n\\\n\t-m mag_image -p phase_image\\n\\\n\t-r real_image -i imaginary_image\\n\\\n\t-x complex_image\\n\\\n\\n\\\nOutput is specified with upper case letters. One or more of the\\n\\\nfollowing can be specified:\\n\\\n\t-M : Output a magnitude image\\n\\\n\t-P : Output a phase image\\n\\\n\t-R : Output a real image\\n\\\n\t-I : Output an imaginary image\\n\\\n\t-X : Output a complex image\\n\\\n\\n\\\nOther options:\\n\\\n\t--double : Use double precision instead of float\\n\\\n\t--fixge  : Fix alternate slice problem with GE data.\\n\\\n\\n\\\nExample:\\n\\\n\tqicomplex -m mag.nii -p phase.nii -R real.nii -I imag.nii\\n\"\n};\nint verbose = false, use_double = false, fixge = false;\nconst struct option long_options[] =\n{\n\t{\"help\", no_argument, 0, 'h'},\n\t{\"verbose\", no_argument, 0, 'v'},\n\t{\"double\", no_argument, &use_double, 1},\n\t{\"fixge\", no_argument, &fixge, 1},\n\t{0, 0, 0, 0}\n};\nconst char* short_options = \"hvm:M:p:P:r:R:i:I:x:X:\";\nint c, index_ptr = 0;\n\ntemplate<typename TPixel> void Run(int argc, char **argv) {\n\ttypedef itk::Image<TPixel, 4>          TImage;\n\ttypedef itk::Image<complex<TPixel>, 4> TXImage;\n\ttypedef itk::ImageFileReader<TImage>   TReader;\n\ttypedef itk::ImageFileReader<TXImage>  TXReader;\n\ttypedef itk::ImageFileWriter<TImage>   TWriter;\n\ttypedef itk::ImageFileWriter<TXImage>  TXWriter;\n\n\ttypename TImage::Pointer img1 = ITK_NULLPTR, img2 = ITK_NULLPTR;\n\ttypename TXImage::Pointer imgX = ITK_NULLPTR;\n\n\tif (verbose) cout << \"Reading input files\" << endl;\n\tbool ri = false, x = false;\n\toptind = 1;\n\twhile ((c = getopt(argc, argv, short_options)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'r':\n\t\t\t\tri = true;\n\t\t\tcase 'm': {\n\t\t\t\tauto read = TReader::New();\n\t\t\t\tread->SetFileName(optarg);\n\t\t\t\tread->Update();\n\t\t\t\timg1 = read->GetOutput();\n\t\t\t} break;\n\t\t\tcase 'i':\n\t\t\t\tri = true;\n\t\t\tcase 'p': {\n\t\t\t\tauto read = TReader::New();\n\t\t\t\tread->SetFileName(optarg);\n\t\t\t\tread->Update();\n\t\t\t\timg2 = read->GetOutput();\n\t\t\t} break;\n\t\t\tcase 'x': {\n\t\t\t\tx = true;\n\t\t\t\ttypename TXReader::Pointer readX = TXReader::New();\n\t\t\t\treadX->SetFileName(optarg);\n\t\t\t\treadX->Update();\n\t\t\t\timgX = readX->GetOutput();\n\t\t\t} break;\n\t\t\tdefault: break;\n\t\t}\n\t}\n\n\tif (x) {\n\t\t\/\/ Nothing to see here\n\t} else if (ri) {\n\t\tif (!(img1 && img2)) {\n\t\t\tthrow(runtime_error(\"Must set real and imaginary inputs\"));\n\t\t}\n\t\tif (verbose) cout << \"Combining real and imaginary input\" << endl;\n\t\tauto compose = itk::ComposeImageFilter<TImage, TXImage>::New();\n\t\tcompose->SetInput(0, img1);\n\t\tcompose->SetInput(1, img2);\n\t\tcompose->Update();\n\t\timgX = compose->GetOutput();\n\t} else {\n\t\tif (!(img1 && img2)) {\n\t\t\tthrow(runtime_error(\"Must set magnitude and phase inputs\"));\n\t\t}\n\t\tif (verbose) cout << \"Combining magnitude and phase input\" << endl;\n\t\tauto compose = itk::MagnitudeAndPhaseToComplexImageFilter<TImage, TImage, TXImage>::New();\n\t\tcompose->SetInput(0, img1);\n\t\tcompose->SetInput(1, img2);\n\t\tcompose->Update();\n\t\timgX = compose->GetOutput();\n\t}\n\n\tif (verbose) cout << \"Writing output files\" << endl;\n\ttypename TWriter::Pointer write = TWriter::New();\n\toptind = 1;\n\twhile ((c = getopt(argc, argv, short_options)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'M': {\n\t\t\t\tauto o = itk::ComplexToModulusImageFilter<TXImage, TImage>::New();\n\t\t\t\to->SetInput(imgX);\n\t\t\t\twrite->SetFileName(optarg);\n\t\t\t\twrite->SetInput(o->GetOutput());\n\t\t\t\twrite->Update();\n\t\t\t\tif (verbose) cout << \"Wrote magnitude image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tcase 'P': {\n\t\t\t\tauto o = itk::ComplexToPhaseImageFilter<TXImage, TImage>::New();\n\t\t\t\to->SetInput(imgX);\n\t\t\t\twrite->SetFileName(optarg);\n\t\t\t\twrite->SetInput(o->GetOutput());\n\t\t\t\twrite->Update();\n\t\t\t\tif (verbose) cout << \"Wrote phase image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tcase 'R': {\n\t\t\t\tauto o = itk::ComplexToRealImageFilter<TXImage, TImage>::New();\n\t\t\t\to->SetInput(imgX);\n\t\t\t\twrite->SetFileName(optarg);\n\t\t\t\twrite->SetInput(o->GetOutput());\n\t\t\t\twrite->Update();\n\t\t\t\tif (verbose) cout << \"Wrote real image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tcase 'I': {\n\t\t\t\tauto o = itk::ComplexToImaginaryImageFilter<TXImage, TImage>::New();\n\t\t\t\to->SetInput(imgX);\n\t\t\t\twrite->SetFileName(optarg);\n\t\t\t\twrite->SetInput(o->GetOutput());\n\t\t\t\twrite->Update();\n\t\t\t\tif (verbose) cout << \"Wrote imaginary image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tcase 'X': {\n\t\t\t\tauto writeX = TXWriter::New();\n\t\t\t\twriteX->SetFileName(optarg);\n\t\t\t\twriteX->SetInput(imgX);\n\t\t\t\twriteX->Update();\n\t\t\t\tif (verbose) cout << \"Wrote complex image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tdefault: break;\n\t\t}\n\t}\n}\n\nint main(int argc, char **argv) {\n\t\/\/ Do one pass for the general options\n\tbool have_some_options = false;\n\twhile ((c = getopt_long(argc, argv, short_options, long_options, &index_ptr)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'v': verbose = true; break;\n\t\t\tcase 'h':\n\t\t\t\tcout << usage << endl;\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t\tcase 0: break; \/\/ A flag\n\t\t\tcase 'm': case 'M': case 'p': case 'P':\n\t\t\tcase 'r': case 'R': case 'i': case 'I':\n\t\t\tcase 'x': case 'X':\n\t\t\t\thave_some_options = true;\n\t\t\t\tbreak;\n\t\t\tcase '?': \/\/ getopt will print an error message\n\t\t\t\treturn EXIT_FAILURE;\n\t\t\tdefault:\n\t\t\tcout << \"Unhandled option \" << string(1, c) << endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t}\n\n\tif (!have_some_options) {\n\t\tcout << usage << endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tif (use_double) {\n\t\tif (verbose) cout << \"Using double precision\" << endl;\n\t\tRun<double>(argc, argv);\n\t} else {\n\t\tif (verbose) cout << \"Using float precision\" << endl;\n\t\tRun<float>(argc, argv);\n\t}\n\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>Removed fixge option from the usage string as it is not currently implemented.<commit_after>\/*\n *  niicomplex.cpp\n *\n *  Created by Tobias Wood on 03\/06\/2015.\n *  Copyright (c) 2015 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 <random>\n#include <functional>\n\n#include \"itkImage.h\"\n#include \"itkComplexToPhaseImageFilter.h\"\n#include \"itkComplexToModulusImageFilter.h\"\n#include \"itkComplexToRealImageFilter.h\"\n#include \"itkComplexToImaginaryImageFilter.h\"\n#include \"itkComposeImageFilter.h\"\n#include \"itkMagnitudeAndPhaseToComplexImageFilter.h\"\n\n#include \"Util.h\"\n#include \"Types.h\"\n\nusing namespace std;\n\nconst string usage {\n\"Usage is: qcomplex [input options] [output options] [other options] \\n\\\n\\n\\\nInput is specified with lower case letters. One of the following\\n\\\ncombinations must be specified:\\n\\\n\t-m mag_image -p phase_image\\n\\\n\t-r real_image -i imaginary_image\\n\\\n\t-x complex_image\\n\\\n\\n\\\nOutput is specified with upper case letters. One or more of the\\n\\\nfollowing can be specified:\\n\\\n\t-M : Output a magnitude image\\n\\\n\t-P : Output a phase image\\n\\\n\t-R : Output a real image\\n\\\n\t-I : Output an imaginary image\\n\\\n\t-X : Output a complex image\\n\\\n\\n\\\nOther options:\\n\\\n\t--double : Use double precision instead of float\\n\\\n\\n\\\nExample:\\n\\\n\tqicomplex -m mag.nii -p phase.nii -R real.nii -I imag.nii\\n\"\n};\nint verbose = false, use_double = false, fixge = false;\nconst struct option long_options[] =\n{\n\t{\"help\", no_argument, 0, 'h'},\n\t{\"verbose\", no_argument, 0, 'v'},\n\t{\"double\", no_argument, &use_double, 1},\n\t{\"fixge\", no_argument, &fixge, 1},\n\t{0, 0, 0, 0}\n};\nconst char* short_options = \"hvm:M:p:P:r:R:i:I:x:X:\";\nint c, index_ptr = 0;\n\ntemplate<typename TPixel> void Run(int argc, char **argv) {\n\ttypedef itk::Image<TPixel, 4>          TImage;\n\ttypedef itk::Image<complex<TPixel>, 4> TXImage;\n\ttypedef itk::ImageFileReader<TImage>   TReader;\n\ttypedef itk::ImageFileReader<TXImage>  TXReader;\n\ttypedef itk::ImageFileWriter<TImage>   TWriter;\n\ttypedef itk::ImageFileWriter<TXImage>  TXWriter;\n\n\ttypename TImage::Pointer img1 = ITK_NULLPTR, img2 = ITK_NULLPTR;\n\ttypename TXImage::Pointer imgX = ITK_NULLPTR;\n\n\tif (verbose) cout << \"Reading input files\" << endl;\n\tbool ri = false, x = false;\n\toptind = 1;\n\twhile ((c = getopt(argc, argv, short_options)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'r':\n\t\t\t\tri = true;\n\t\t\tcase 'm': {\n\t\t\t\tauto read = TReader::New();\n\t\t\t\tread->SetFileName(optarg);\n\t\t\t\tread->Update();\n\t\t\t\timg1 = read->GetOutput();\n\t\t\t} break;\n\t\t\tcase 'i':\n\t\t\t\tri = true;\n\t\t\tcase 'p': {\n\t\t\t\tauto read = TReader::New();\n\t\t\t\tread->SetFileName(optarg);\n\t\t\t\tread->Update();\n\t\t\t\timg2 = read->GetOutput();\n\t\t\t} break;\n\t\t\tcase 'x': {\n\t\t\t\tx = true;\n\t\t\t\ttypename TXReader::Pointer readX = TXReader::New();\n\t\t\t\treadX->SetFileName(optarg);\n\t\t\t\treadX->Update();\n\t\t\t\timgX = readX->GetOutput();\n\t\t\t} break;\n\t\t\tdefault: break;\n\t\t}\n\t}\n\n\tif (x) {\n\t\t\/\/ Nothing to see here\n\t} else if (ri) {\n\t\tif (!(img1 && img2)) {\n\t\t\tthrow(runtime_error(\"Must set real and imaginary inputs\"));\n\t\t}\n\t\tif (verbose) cout << \"Combining real and imaginary input\" << endl;\n\t\tauto compose = itk::ComposeImageFilter<TImage, TXImage>::New();\n\t\tcompose->SetInput(0, img1);\n\t\tcompose->SetInput(1, img2);\n\t\tcompose->Update();\n\t\timgX = compose->GetOutput();\n\t} else {\n\t\tif (!(img1 && img2)) {\n\t\t\tthrow(runtime_error(\"Must set magnitude and phase inputs\"));\n\t\t}\n\t\tif (verbose) cout << \"Combining magnitude and phase input\" << endl;\n\t\tauto compose = itk::MagnitudeAndPhaseToComplexImageFilter<TImage, TImage, TXImage>::New();\n\t\tcompose->SetInput(0, img1);\n\t\tcompose->SetInput(1, img2);\n\t\tcompose->Update();\n\t\timgX = compose->GetOutput();\n\t}\n\n\tif (verbose) cout << \"Writing output files\" << endl;\n\ttypename TWriter::Pointer write = TWriter::New();\n\toptind = 1;\n\twhile ((c = getopt(argc, argv, short_options)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'M': {\n\t\t\t\tauto o = itk::ComplexToModulusImageFilter<TXImage, TImage>::New();\n\t\t\t\to->SetInput(imgX);\n\t\t\t\twrite->SetFileName(optarg);\n\t\t\t\twrite->SetInput(o->GetOutput());\n\t\t\t\twrite->Update();\n\t\t\t\tif (verbose) cout << \"Wrote magnitude image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tcase 'P': {\n\t\t\t\tauto o = itk::ComplexToPhaseImageFilter<TXImage, TImage>::New();\n\t\t\t\to->SetInput(imgX);\n\t\t\t\twrite->SetFileName(optarg);\n\t\t\t\twrite->SetInput(o->GetOutput());\n\t\t\t\twrite->Update();\n\t\t\t\tif (verbose) cout << \"Wrote phase image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tcase 'R': {\n\t\t\t\tauto o = itk::ComplexToRealImageFilter<TXImage, TImage>::New();\n\t\t\t\to->SetInput(imgX);\n\t\t\t\twrite->SetFileName(optarg);\n\t\t\t\twrite->SetInput(o->GetOutput());\n\t\t\t\twrite->Update();\n\t\t\t\tif (verbose) cout << \"Wrote real image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tcase 'I': {\n\t\t\t\tauto o = itk::ComplexToImaginaryImageFilter<TXImage, TImage>::New();\n\t\t\t\to->SetInput(imgX);\n\t\t\t\twrite->SetFileName(optarg);\n\t\t\t\twrite->SetInput(o->GetOutput());\n\t\t\t\twrite->Update();\n\t\t\t\tif (verbose) cout << \"Wrote imaginary image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tcase 'X': {\n\t\t\t\tauto writeX = TXWriter::New();\n\t\t\t\twriteX->SetFileName(optarg);\n\t\t\t\twriteX->SetInput(imgX);\n\t\t\t\twriteX->Update();\n\t\t\t\tif (verbose) cout << \"Wrote complex image \" + string(optarg) << endl;\n\t\t\t} break;\n\t\t\tdefault: break;\n\t\t}\n\t}\n}\n\nint main(int argc, char **argv) {\n\t\/\/ Do one pass for the general options\n\tbool have_some_options = false;\n\twhile ((c = getopt_long(argc, argv, short_options, long_options, &index_ptr)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'v': verbose = true; break;\n\t\t\tcase 'h':\n\t\t\t\tcout << usage << endl;\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t\tcase 0: break; \/\/ A flag\n\t\t\tcase 'm': case 'M': case 'p': case 'P':\n\t\t\tcase 'r': case 'R': case 'i': case 'I':\n\t\t\tcase 'x': case 'X':\n\t\t\t\thave_some_options = true;\n\t\t\t\tbreak;\n\t\t\tcase '?': \/\/ getopt will print an error message\n\t\t\t\treturn EXIT_FAILURE;\n\t\t\tdefault:\n\t\t\tcout << \"Unhandled option \" << string(1, c) << endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t}\n\n\tif (!have_some_options) {\n\t\tcout << usage << endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tif (use_double) {\n\t\tif (verbose) cout << \"Using double precision\" << endl;\n\t\tRun<double>(argc, argv);\n\t} else {\n\t\tif (verbose) cout << \"Using float precision\" << endl;\n\t\tRun<float>(argc, argv);\n\t}\n\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: BDatabaseMetaData.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 06:42:39 $\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_ODBC_ODATABASEMETADATA_HXX_\n#include \"odbc\/ODatabaseMetaData.hxx\"\n#endif\n\nnamespace connectivity\n{\n    namespace odbc\n    {\n        class OConnection;\n    }\n    namespace adabas\n    {\n        typedef odbc::ODatabaseMetaData OAdabasDatabaseMetaData_BASE;\n\n        class OAdabasDatabaseMetaData : public OAdabasDatabaseMetaData_BASE\n        {\n        public:\n            OAdabasDatabaseMetaData(const SQLHANDLE _pHandle,odbc::OConnection* _pCon)\n                : ODatabaseMetaData(_pHandle,_pCon)\n            {\n            }\n\n            \/\/ just to return our url\n            virtual ::rtl::OUString SAL_CALL getURL(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            virtual sal_Bool SAL_CALL supportsIntegrityEnhancementFacility(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL getTypeInfo(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        };\n    }\n}\n\n<commit_msg>INTEGRATION: CWS dba24d (1.5.310); FILE MERGED 2007\/11\/21 12:39:23 oj 1.5.310.1: #i68854# impl TypeSettingInfo for Oracle and some clean up<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: BDatabaseMetaData.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2008-01-30 08:00: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#ifndef _CONNECTIVITY_ODBC_ODATABASEMETADATA_HXX_\n#include \"odbc\/ODatabaseMetaData.hxx\"\n#endif\n\nnamespace connectivity\n{\n    namespace odbc\n    {\n        class OConnection;\n    }\n    namespace adabas\n    {\n        typedef odbc::ODatabaseMetaData OAdabasDatabaseMetaData_BASE;\n\n        class OAdabasDatabaseMetaData : public OAdabasDatabaseMetaData_BASE\n        {\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > impl_getTypeInfo_throw();\n        public:\n            OAdabasDatabaseMetaData(const SQLHANDLE _pHandle,odbc::OConnection* _pCon)\n                : ODatabaseMetaData(_pHandle,_pCon)\n            {\n            }\n\n            \/\/ just to return our url\n            virtual ::rtl::OUString SAL_CALL getURL(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            virtual sal_Bool SAL_CALL supportsIntegrityEnhancementFacility(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        };\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    TestGPURayCastAdditive.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\/\/ This test covers cropping on volume datasets.\n\n#include <vtkSphere.h>\n#include <vtkSampleFunction.h>\n\n#include <vtkTestUtilities.h>\n\n#include <vtkActor.h>\n#include <vtkColorTransferFunction.h>\n#include <vtkCommand.h>\n#include <vtkFixedPointVolumeRayCastMapper.h>\n#include <vtkGPUVolumeRayCastMapper.h>\n#include <vtkImageData.h>\n#include <vtkOutlineFilter.h>\n#include <vtkPlane.h>\n#include <vtkPlaneCollection.h>\n#include <vtkPiecewiseFunction.h>\n#include <vtkRenderer.h>\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkRegressionTestImage.h>\n#include <vtkRTAnalyticSource.h>\n#include <vtkNew.h>\n#include <vtkSinglePassVolumeMapper.h>\n#include <vtkSphereSource.h>\n#include <vtkSmartPointer.h>\n#include <vtkTimerLog.h>\n#include <vtkPolyDataMapper.h>\n#include <vtkVolumeProperty.h>\n#include <vtkXMLImageDataReader.h>\n\n#include <vtksys\/SystemTools.hxx>\n\n#include <cstdlib>\n\nint TestGPURayCastClip(int argc, char *argv[])\n{\n  double scalarRange[2];\n\n  vtkNew<vtkActor> outlineActor;\n  vtkNew<vtkPolyDataMapper> outlineMapper;\n  vtkNew<vtkSinglePassVolumeMapper> volumeMapper;\n  volumeMapper->SetSampleDistance(0.05);\n\n  vtkNew<vtkXMLImageDataReader> reader;\n  const char* volumeFile = vtkTestUtilities::ExpandDataFileName(\n                            argc, argv, \"Data\/vase_1comp.vti\");\n  reader->SetFileName(volumeFile);\n  reader->Update();\n  volumeMapper->SetInputConnection(reader->GetOutputPort());\n\n  \/\/ Add outline filter\n  vtkNew<vtkOutlineFilter> outlineFilter;\n  outlineFilter->SetInputConnection(reader->GetOutputPort());\n  outlineMapper->SetInputConnection(outlineFilter->GetOutputPort());\n  outlineActor->SetMapper(outlineMapper.GetPointer());\n\n  volumeMapper->GetInput()->GetScalarRange(scalarRange);\n  volumeMapper->SetBlendModeToComposite();\n\n  \/\/ Testing prefers image comparison with small images\n  vtkNew<vtkRenderWindow> renWin;\n  renWin->SetSize(400, 400);\n\n  \/\/ Intentional odd and NPOT  width\/height\n  vtkNew<vtkRenderer> ren;\n  renWin->AddRenderer(ren.GetPointer());\n\n  vtkNew<vtkRenderWindowInteractor> iren;\n  iren->SetRenderWindow(renWin.GetPointer());\n\n  \/\/ Make sure we have an OpenGL context.\n  renWin->Render();\n\n  vtkNew<vtkPiecewiseFunction> scalarOpacity;\n  scalarOpacity->AddPoint(scalarRange[0], 0.0);\n  scalarOpacity->AddPoint(scalarRange[1], 1.0);\n\n  vtkNew<vtkVolumeProperty> volumeProperty;\n  volumeProperty->ShadeOff();\n  volumeProperty->SetInterpolationType(VTK_LINEAR_INTERPOLATION);\n  volumeProperty->SetScalarOpacity(scalarOpacity.GetPointer());\n\n  vtkSmartPointer<vtkColorTransferFunction> colorTransferFunction =\n    volumeProperty->GetRGBTransferFunction(0);\n  colorTransferFunction->RemoveAllPoints();\n  colorTransferFunction->AddRGBPoint(scalarRange[0], 0.0, 0.0, 0.0);\n  colorTransferFunction->AddRGBPoint(scalarRange[1], 1.0, 1.0, 1.0);\n\n  \/\/ Test cropping now\n\n  double* bounds = reader->GetOutput()->GetBounds();\n  vtkNew<vtkPlane> clipPlane1;\n  clipPlane1->SetOrigin(0.45 * (bounds[0] + bounds[1]), 0.0, 0.0);\n  clipPlane1->SetNormal(1.0, 0.0, 0.0);\n\n  vtkNew<vtkPlane> clipPlane2;\n  clipPlane2->SetOrigin(0.55 * (bounds[0] + bounds[1]), 0.0, 0.0);\n  clipPlane2->SetNormal(-1.0, 0.0, 0.0);\n\n  vtkNew<vtkPlaneCollection> clipPlaneCollection;\n  clipPlaneCollection->AddItem(clipPlane1.GetPointer());\n  clipPlaneCollection->AddItem(clipPlane2.GetPointer());\n  volumeMapper->SetClippingPlanes(clipPlaneCollection.GetPointer());\n\n  \/\/ Setup volume actor\n  vtkNew<vtkVolume> volume;\n  volume->SetMapper(volumeMapper.GetPointer());\n  volume->SetProperty(volumeProperty.GetPointer());\n\n  ren->AddViewProp(volume.GetPointer());\n  ren->AddActor(outlineActor.GetPointer());\n  ren->ResetCamera();\n\n  renWin->Render();\n  iren->Initialize();\n\n  int retVal = vtkRegressionTestImage(renWin.GetPointer());\n  if (retVal == vtkRegressionTester::DO_INTERACTOR)\n    {\n    iren->Start();\n    }\n  return !retVal;\n}\n\n<commit_msg>Removed hard-coded sample distance<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    TestGPURayCastAdditive.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\/\/ This test covers cropping on volume datasets.\n\n#include <vtkSphere.h>\n#include <vtkSampleFunction.h>\n\n#include <vtkTestUtilities.h>\n\n#include <vtkActor.h>\n#include <vtkColorTransferFunction.h>\n#include <vtkCommand.h>\n#include <vtkFixedPointVolumeRayCastMapper.h>\n#include <vtkGPUVolumeRayCastMapper.h>\n#include <vtkImageData.h>\n#include <vtkOutlineFilter.h>\n#include <vtkPlane.h>\n#include <vtkPlaneCollection.h>\n#include <vtkPiecewiseFunction.h>\n#include <vtkRenderer.h>\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkRegressionTestImage.h>\n#include <vtkRTAnalyticSource.h>\n#include <vtkNew.h>\n#include <vtkSinglePassVolumeMapper.h>\n#include <vtkSphereSource.h>\n#include <vtkSmartPointer.h>\n#include <vtkTimerLog.h>\n#include <vtkPolyDataMapper.h>\n#include <vtkVolumeProperty.h>\n#include <vtkXMLImageDataReader.h>\n\n#include <vtksys\/SystemTools.hxx>\n\n#include <cstdlib>\n\nint TestGPURayCastClip(int argc, char *argv[])\n{\n  double scalarRange[2];\n\n  vtkNew<vtkActor> outlineActor;\n  vtkNew<vtkPolyDataMapper> outlineMapper;\n  vtkNew<vtkSinglePassVolumeMapper> volumeMapper;\n\n  vtkNew<vtkXMLImageDataReader> reader;\n  const char* volumeFile = vtkTestUtilities::ExpandDataFileName(\n                            argc, argv, \"Data\/vase_1comp.vti\");\n  reader->SetFileName(volumeFile);\n  reader->Update();\n  volumeMapper->SetInputConnection(reader->GetOutputPort());\n\n  \/\/ Add outline filter\n  vtkNew<vtkOutlineFilter> outlineFilter;\n  outlineFilter->SetInputConnection(reader->GetOutputPort());\n  outlineMapper->SetInputConnection(outlineFilter->GetOutputPort());\n  outlineActor->SetMapper(outlineMapper.GetPointer());\n\n  volumeMapper->GetInput()->GetScalarRange(scalarRange);\n  volumeMapper->SetBlendModeToComposite();\n\n  \/\/ Testing prefers image comparison with small images\n  vtkNew<vtkRenderWindow> renWin;\n  renWin->SetSize(400, 400);\n\n  \/\/ Intentional odd and NPOT  width\/height\n  vtkNew<vtkRenderer> ren;\n  renWin->AddRenderer(ren.GetPointer());\n\n  vtkNew<vtkRenderWindowInteractor> iren;\n  iren->SetRenderWindow(renWin.GetPointer());\n\n  \/\/ Make sure we have an OpenGL context.\n  renWin->Render();\n\n  vtkNew<vtkPiecewiseFunction> scalarOpacity;\n  scalarOpacity->AddPoint(scalarRange[0], 0.0);\n  scalarOpacity->AddPoint(scalarRange[1], 1.0);\n\n  vtkNew<vtkVolumeProperty> volumeProperty;\n  volumeProperty->ShadeOff();\n  volumeProperty->SetInterpolationType(VTK_LINEAR_INTERPOLATION);\n  volumeProperty->SetScalarOpacity(scalarOpacity.GetPointer());\n\n  vtkSmartPointer<vtkColorTransferFunction> colorTransferFunction =\n    volumeProperty->GetRGBTransferFunction(0);\n  colorTransferFunction->RemoveAllPoints();\n  colorTransferFunction->AddRGBPoint(scalarRange[0], 0.0, 0.0, 0.0);\n  colorTransferFunction->AddRGBPoint(scalarRange[1], 1.0, 1.0, 1.0);\n\n  \/\/ Test cropping now\n\n  double* bounds = reader->GetOutput()->GetBounds();\n  vtkNew<vtkPlane> clipPlane1;\n  clipPlane1->SetOrigin(0.45 * (bounds[0] + bounds[1]), 0.0, 0.0);\n  clipPlane1->SetNormal(1.0, 0.0, 0.0);\n\n  vtkNew<vtkPlane> clipPlane2;\n  clipPlane2->SetOrigin(0.55 * (bounds[0] + bounds[1]), 0.0, 0.0);\n  clipPlane2->SetNormal(-1.0, 0.0, 0.0);\n\n  vtkNew<vtkPlaneCollection> clipPlaneCollection;\n  clipPlaneCollection->AddItem(clipPlane1.GetPointer());\n  clipPlaneCollection->AddItem(clipPlane2.GetPointer());\n  volumeMapper->SetClippingPlanes(clipPlaneCollection.GetPointer());\n\n  \/\/ Setup volume actor\n  vtkNew<vtkVolume> volume;\n  volume->SetMapper(volumeMapper.GetPointer());\n  volume->SetProperty(volumeProperty.GetPointer());\n\n  ren->AddViewProp(volume.GetPointer());\n  ren->AddActor(outlineActor.GetPointer());\n  ren->ResetCamera();\n\n  renWin->Render();\n  iren->Initialize();\n\n  int retVal = vtkRegressionTestImage(renWin.GetPointer());\n  if (retVal == vtkRegressionTester::DO_INTERACTOR)\n    {\n    iren->Start();\n    }\n  return !retVal;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <QString>\n#include <QtTest>\n\n#include <libgpsbip\/OptionTypes.h>\n#include <libgpsbip\/OptionsGroupBase.h>\n\nclass MockGroup : public gpsbip::OptionsGroupBase\n{\n    Q_OBJECT\n\npublic:\n    MockGroup() {\n        auto r = new gpsbip::BoolOption();\n        root = addOption(r);\n        opt = addOption<gpsbip::BoolOption>(\"label\");\n        strOpt = addOption<gpsbip::StringOption>(*r, \"label\");\n    }\n\n    gpsbip::BoolOption* getRootOption() { return &get<gpsbip::BoolOption>(root); }\n    gpsbip::BoolOption* getOption() { return &get<gpsbip::BoolOption>(opt); }\n    gpsbip::StringOption* getStrOption() { return &get<gpsbip::StringOption>(strOpt); }\n\nprivate:\n    int root, opt, strOpt;\n};\n\nclass Tst_optionsGroups : public QObject\n{\n    Q_OBJECT\n\npublic:\n    Tst_optionsGroups();\n\nprivate Q_SLOTS:\n    void testOptionGroupMechanic();\n    void testOptionGroupMechanic_optionParenting();\n};\n\nTst_optionsGroups::Tst_optionsGroups()\n{\n}\n\nvoid Tst_optionsGroups::testOptionGroupMechanic()\n{\n    try {\n        \/\/ Validates all 3 addOption variants (by definition, can't really assert that :\/)\n        MockGroup g;\n\n        \/\/ Validates get<>\n        gpsbip::BoolOption *root = g.getRootOption();\n        QVERIFY(root != nullptr);\n        gpsbip::BoolOption *opt = g.getOption();\n        QVERIFY(opt != nullptr);\n        gpsbip::StringOption *str = g.getStrOption();\n        QVERIFY(str != nullptr);\n\n        \/\/ Confirm that the string option is dependant on the root one and that the expected addOption was used\n        QCOMPARE(str->isEnabled(), false);\n        *root = true;\n        QCOMPARE(str->isEnabled(), true);\n    }\n    catch (std::exception &e) {\n        QFAIL(e.what());\n    }\n}\n\nvoid Tst_optionsGroups::testOptionGroupMechanic_optionParenting()\n{\n    try {\n        MockGroup g;\n\n        gpsbip::BoolOption *root = g.getRootOption();\n        gpsbip::BoolOption *opt = g.getOption();\n        gpsbip::StringOption *str = g.getStrOption();\n\n        QCOMPARE(root->parent(), &g);\n        QCOMPARE(opt->parent(), &g);\n        QCOMPARE(str->parent(), &g);\n    }\n    catch (std::exception &e) {\n        QFAIL(e.what());\n    }\n}\n\nQTEST_APPLESS_MAIN(Tst_optionsGroups)\n\n#include \"tst_optionsgroups.moc\"\n<commit_msg>Added validation of gps group definition<commit_after>#include <QString>\n#include <QtTest>\n\n#include <libgpsbip\/OptionTypes.h>\n#include <libgpsbip\/OptionsGroupBase.h>\n#include <libgpsbip\/GpsOptionsGroup.h>\n\nclass MockGroup : public gpsbip::OptionsGroupBase\n{\n    Q_OBJECT\n\npublic:\n    MockGroup() {\n        auto r = new gpsbip::BoolOption();\n        root = addOption(r);\n        opt = addOption<gpsbip::BoolOption>(\"label\");\n        strOpt = addOption<gpsbip::StringOption>(*r, \"label\");\n    }\n\n    gpsbip::BoolOption* getRootOption() { return &get<gpsbip::BoolOption>(root); }\n    gpsbip::BoolOption* getOption() { return &get<gpsbip::BoolOption>(opt); }\n    gpsbip::StringOption* getStrOption() { return &get<gpsbip::StringOption>(strOpt); }\n\nprivate:\n    int root, opt, strOpt;\n};\n\nclass Tst_optionsGroups : public QObject\n{\n    Q_OBJECT\n\npublic:\n    Tst_optionsGroups();\n\nprivate Q_SLOTS:\n    \/\/ Base group validation\n    void testOptionGroupMechanic();\n    void testOptionGroupMechanic_optionParenting();\n\n    \/\/ Real groups validation\n    void validateGpsOptionsGroup();\n};\n\nTst_optionsGroups::Tst_optionsGroups()\n{\n}\n\nvoid Tst_optionsGroups::testOptionGroupMechanic()\n{\n    try {\n        \/\/ Validates all 3 addOption variants (by definition, can't really assert that :\/)\n        MockGroup g;\n\n        \/\/ Validates get<>\n        gpsbip::BoolOption *root = g.getRootOption();\n        QVERIFY(root != nullptr);\n        gpsbip::BoolOption *opt = g.getOption();\n        QVERIFY(opt != nullptr);\n        gpsbip::StringOption *str = g.getStrOption();\n        QVERIFY(str != nullptr);\n\n        \/\/ Confirm that the string option is dependant on the root one and that the expected addOption was used\n        QCOMPARE(str->isEnabled(), false);\n        *root = true;\n        QCOMPARE(str->isEnabled(), true);\n    }\n    catch (std::exception &e) {\n        QFAIL(e.what());\n    }\n}\n\nvoid Tst_optionsGroups::testOptionGroupMechanic_optionParenting()\n{\n    try {\n        MockGroup g;\n\n        gpsbip::BoolOption *root = g.getRootOption();\n        gpsbip::BoolOption *opt = g.getOption();\n        gpsbip::StringOption *str = g.getStrOption();\n\n        QCOMPARE(root->parent(), &g);\n        QCOMPARE(opt->parent(), &g);\n        QCOMPARE(str->parent(), &g);\n    }\n    catch (std::exception &e) {\n        QFAIL(e.what());\n    }\n}\n\nvoid Tst_optionsGroups::validateGpsOptionsGroup()\n{\n    \/\/ Since we validated base mechanics previously, we will only validates that the\n    \/\/ properties are indeed available and the relationships between those is correct.\n\n    try {\n        gpsbip::GpsOptionsGroup gps;\n        gpsbip::BoolOption * const root         = qvariant_cast<gpsbip::BoolOption*>(gps.property(\"gpsEnabled\"));\n        gpsbip::BoolOption * const toDetection  = qvariant_cast<gpsbip::BoolOption*>(gps.property(\"takeOffDetection\"));\n\n        QVERIFY(root != nullptr);\n        QVERIFY(toDetection != nullptr);\n\n        \/\/ Enablement checking\n        QCOMPARE(toDetection->isEnabled(), false);\n\n        *root = true;\n\n        QCOMPARE(toDetection->isEnabled(), true);\n    }\n    catch (std::exception &e) {\n        QFAIL(e.what());\n    }\n}\n\nQTEST_APPLESS_MAIN(Tst_optionsGroups)\n\n#include \"tst_optionsgroups.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2011 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 meegotouch-controlpanelapplets.\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 \"filesystemstub.h\"\n#include \"ut_wallpaperbusinesslogic.h\"\n\/\/#include \"wallpapergconf.h\"\n\n#include \"wallpaperbusinesslogic.h\"\n#include \"wallpaperitrans.h\"\n\/\/#include \"wallpapergconf.h\"\n#include \"wallpaperutils.h\"\n#include \"wallpaperconfiguration.h\"\n\n#include <MApplication>\n#include <MGConfItem>\n\n#define DEBUG\n#include \"..\/..\/src\/debug.h\"\n\nstatic const QString PortraitKey = \n    \"\/desktop\/meego\/background\/portrait\/picture_filename\";\nstatic const QString LandscapeKey = \n    \"\/desktop\/meego\/background\/landscape\/picture_filename\";\n\n\/******************************************************************************\n * GConf stub.\n *\/\n#include <gconf\/gconf-client.h>\n#include <gconf\/gconf-value.h>\n\nstatic QHash<QString, QString> MyGConfDatabase;\n\nGConfValue *\ngconf_client_get (\n        GConfClient* client,\n        const gchar* key,\n        GError** err)\n{\n    Q_UNUSED (client);\n    Q_UNUSED (err);\n    Q_ASSERT (qstrlen (key) >= 10);\n\n    QString myKey = key;\n    GConfValue *retval;\n\n    SYS_WARNING (\"*** key = %s\", SYS_STR(myKey));\n    if (MyGConfDatabase.contains(myKey)) {\n        const char *r = strdup(MyGConfDatabase[myKey].toUtf8().constData());\n\n        retval = gconf_value_new (GCONF_VALUE_STRING);\n        gconf_value_set_string (retval, r);\n        SYS_DEBUG (\"returning '%s'\", r);\n    } else {\n        SYS_DEBUG (\"returning false\");\n        retval = gconf_value_new (GCONF_VALUE_BOOL);\n    }\n\n    return retval;\n}\n\n\/******************************************************************************\n * QImage stub.\n *\/\n#include <QImage>\n\nbool \t\nQImage::load (\n        const QString  &fileName, \n        const char     *format)\n{\n    Q_UNUSED (fileName);\n    Q_UNUSED (format);\n    SYS_DEBUG (\"*** fileName = %s\", SYS_STR(fileName));\n    return true;\n}\n\n#include <QPixmap>\nbool\nQPixmap::load (\n        const QString  &fileName, \n        const char     *format, \n        Qt::ImageConversionFlags flags)\n{\n    Q_UNUSED (fileName);\n    Q_UNUSED (format);\n    Q_UNUSED (flags);\n    SYS_DEBUG (\"*** fileName = %s\", SYS_STR(fileName));\n    return true;\n}\n\n\/******************************************************************************\n * SignalSink implementation.\n *\/\nSignalSink::SignalSink ()\n{\n    reset ();\n}\n\nvoid\nSignalSink::reset ()\n{\n    m_WallpaperChangedCame = false;\n}\n\nvoid\nSignalSink::wallpaperChanged ()\n{\n    SYS_DEBUG (\"\");\n    m_WallpaperChangedCame = true;\n}\n\n\/******************************************************************************\n * Ut_WallpaperBusinessLogic implementation. \n *\/\nvoid \nUt_WallpaperBusinessLogic::init()\n{\n}\n\nvoid \nUt_WallpaperBusinessLogic::cleanup()\n{\n}\n\n\nstatic int argc = 1;\nstatic char* app_name = (char*) \".\/ut_wallpaperbusinesslogic\";\n\nvoid \nUt_WallpaperBusinessLogic::initTestCase()\n{\n    bool connectSuccess;\n\n    MyGConfDatabase[\"\/meegotouch\/theme\/name\"] = \"MyThemeName\";\n    MyGConfDatabase[Wallpaper::CurrentPortraitKey] = \n        \"\/ak\/current.jpg\";\n    MyGConfDatabase[Wallpaper::OriginalPortraitKey] = \"\";\n\n    m_App = new MApplication (argc, &app_name);\n\n\n    m_Api = new WallpaperBusinessLogic;\n    connectSuccess = connect (\n            m_Api, SIGNAL (wallpaperChanged()),\n            &m_SignalSink, SLOT (wallpaperChanged()));\n    QVERIFY (connectSuccess);\n\n\n    \/\/QVERIFY (m_Api->m_EditedImage == 0);\n}\n\nvoid \nUt_WallpaperBusinessLogic::cleanupTestCase()\n{\n    delete m_Api;\n\n    m_App->deleteLater ();\n}\n\n\/*!\n * Checks the low level WallpaperITrans class, its tag methods and overloaded\n * operators.\n *\/\nvoid\nUt_WallpaperBusinessLogic::testITrans ()\n{\n    WallpaperITrans trans1, trans2;\n\n    SYS_DEBUG (\"Checking default values of WallpaperITrans...\");\n    QVERIFY (trans1.x() == 0);\n    QVERIFY (trans1.y() == 0);\n    QVERIFY (trans1.scale() == 1.0);\n    QVERIFY (trans1.orientation() == M::Landscape);\n\n    SYS_DEBUG (\"Checking the set functions...\");\n    trans2.setOffset (QPointF(10, 11));\n    trans2.setScale (2.0);\n    trans2.setOrientation (M::Portrait);\n    trans2.setExpectedSize (QSize(864, 480));\n\n    QVERIFY (trans2.x() == 10);\n    QVERIFY (trans2.y() == 11);\n    QVERIFY (trans2.scale() == 2.0);\n    QVERIFY (trans2.orientation() == M::Portrait);\n    QVERIFY (trans2.expectedWidth() == 864);\n    QVERIFY (trans2.expectedHeight() == 480);\n\n    SYS_DEBUG (\"Testing the copy constructor.\");\n    WallpaperITrans trans3 (trans2);\n    QVERIFY (trans3.x() == 10);\n    QVERIFY (trans3.y() == 11);\n    QVERIFY (trans3.scale() == 2.0);\n    QVERIFY (trans3.orientation() == M::Portrait);\n    QVERIFY (trans3.expectedWidth() == 864);\n    QVERIFY (trans3.expectedHeight() == 480);\n\n    SYS_DEBUG (\"testing operator=...\");\n    trans1 = trans2;\n    QVERIFY (trans1.x() == 10);\n    QVERIFY (trans1.y() == 11);\n    QVERIFY (trans1.scale() == 2.0);\n    QVERIFY (trans1.orientation() == M::Portrait);\n    QVERIFY (trans1.expectedWidth() == 864);\n    QVERIFY (trans1.expectedHeight() == 480);\n\n    SYS_DEBUG (\"Testing operator*...\");\n    SYS_DEBUG (\"*** trans1.scale() = %d\", trans2 * 2);\n    QVERIFY (trans2 * 2 == 4);\n}\n\n\/*!\n * Checks if the GConfItem objects are created with the right keys.\n *\/\nvoid\nUt_WallpaperBusinessLogic::testGConfItems ()\n{\n    QVERIFY (m_Api->m_PPItem != NULL);\n    QVERIFY (m_Api->m_PPItem->key() == Wallpaper::CurrentPortraitKey);\n\n    QVERIFY (m_Api->m_POItem != NULL);\n    QVERIFY (m_Api->m_POItem->key() == Wallpaper::OriginalPortraitKey);\n\n    QVERIFY (m_Api->m_PHItem != NULL);\n    QVERIFY (m_Api->m_PHItem->key() == Wallpaper::PortraitHistoryKey);\n}\n\n\/*!\n *\/\nvoid\nUt_WallpaperBusinessLogic::testCurrentWallpaper ()\n{\n    QString currentFilePath;\n    QString originalFilePath;\n\n\n    m_Api->currentWallpaper (currentFilePath, originalFilePath);\n    QVERIFY (currentFilePath == \"\/ak\/current.jpg\");\n    QVERIFY (originalFilePath.isEmpty());\n\n    SYS_DEBUG (\"*** currentFilePath  = %s\", SYS_STR(currentFilePath));\n    SYS_DEBUG (\"*** originalFilePath = %s\", SYS_STR(originalFilePath));\n}\n\nvoid\nUt_WallpaperBusinessLogic::testSceneSize ()\n{\n    QSize size = m_Api->sceneSize ();\n    QSize expected = QSize (480, 854);\n\n    QVERIFY (size == expected);\n}\n\nvoid\nUt_WallpaperBusinessLogic::testEditedImage ()\n{\n    QVERIFY (!m_Api->hasEditedImage ());\n\n    m_Api->endEdit ();\n    QVERIFY (!m_Api->hasEditedImage ());\n\n}\n\n\/******************************************************************************\n * Private functions.\n *\/\nQTEST_APPLESS_MAIN(Ut_WallpaperBusinessLogic)\n\n\n<commit_msg>New unit test.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2011 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 meegotouch-controlpanelapplets.\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 \"filesystemstub.h\"\n#include \"ut_wallpaperbusinesslogic.h\"\n\/\/#include \"wallpapergconf.h\"\n\n#include \"wallpaperbusinesslogic.h\"\n#include \"wallpaperitrans.h\"\n\/\/#include \"wallpapergconf.h\"\n#include \"wallpaperutils.h\"\n#include \"wallpaperconfiguration.h\"\n\n#include <MApplication>\n#include <MGConfItem>\n\n#define DEBUG\n#include \"..\/..\/src\/debug.h\"\n\nstatic const QString PortraitKey = \n    \"\/desktop\/meego\/background\/portrait\/picture_filename\";\nstatic const QString LandscapeKey = \n    \"\/desktop\/meego\/background\/landscape\/picture_filename\";\n\n\/******************************************************************************\n * GConf stub.\n *\/\n#include <gconf\/gconf-client.h>\n#include <gconf\/gconf-value.h>\n\nstatic QHash<QString, QString> MyGConfDatabase;\n\nGConfValue *\ngconf_client_get (\n        GConfClient* client,\n        const gchar* key,\n        GError** err)\n{\n    Q_UNUSED (client);\n    Q_UNUSED (err);\n    Q_ASSERT (qstrlen (key) >= 10);\n\n    QString myKey = key;\n    GConfValue *retval;\n\n    SYS_WARNING (\"*** key = %s\", SYS_STR(myKey));\n    if (MyGConfDatabase.contains(myKey)) {\n        const char *r = strdup(MyGConfDatabase[myKey].toUtf8().constData());\n\n        retval = gconf_value_new (GCONF_VALUE_STRING);\n        gconf_value_set_string (retval, r);\n        SYS_DEBUG (\"returning '%s'\", r);\n    } else {\n        SYS_DEBUG (\"returning false\");\n        retval = gconf_value_new (GCONF_VALUE_BOOL);\n    }\n\n    return retval;\n}\n\n\/******************************************************************************\n * QImage stub.\n *\/\n#include <QImage>\n\nbool \t\nQImage::load (\n        const QString  &fileName, \n        const char     *format)\n{\n    Q_UNUSED (fileName);\n    Q_UNUSED (format);\n    SYS_DEBUG (\"*** fileName = %s\", SYS_STR(fileName));\n    return true;\n}\n\n#include <QPixmap>\nbool\nQPixmap::load (\n        const QString  &fileName, \n        const char     *format, \n        Qt::ImageConversionFlags flags)\n{\n    Q_UNUSED (fileName);\n    Q_UNUSED (format);\n    Q_UNUSED (flags);\n    SYS_DEBUG (\"*** fileName = %s\", SYS_STR(fileName));\n    return true;\n}\n\n\/******************************************************************************\n * SignalSink implementation.\n *\/\nSignalSink::SignalSink ()\n{\n    reset ();\n}\n\nvoid\nSignalSink::reset ()\n{\n    m_WallpaperChangedCame = false;\n}\n\nvoid\nSignalSink::wallpaperChanged ()\n{\n    SYS_DEBUG (\"\");\n    m_WallpaperChangedCame = true;\n}\n\n\/******************************************************************************\n * Ut_WallpaperBusinessLogic implementation. \n *\/\nvoid \nUt_WallpaperBusinessLogic::init()\n{\n}\n\nvoid \nUt_WallpaperBusinessLogic::cleanup()\n{\n}\n\n\nstatic int argc = 1;\nstatic char* app_name = (char*) \".\/ut_wallpaperbusinesslogic\";\n\nvoid \nUt_WallpaperBusinessLogic::initTestCase()\n{\n    bool connectSuccess;\n\n    MyGConfDatabase[\"\/meegotouch\/theme\/name\"] = \"MyThemeName\";\n    MyGConfDatabase[Wallpaper::CurrentPortraitKey] = \n        \"\/ak\/current.jpg\";\n    MyGConfDatabase[Wallpaper::OriginalPortraitKey] = \"\";\n\n    m_App = new MApplication (argc, &app_name);\n\n\n    m_Api = new WallpaperBusinessLogic;\n    connectSuccess = connect (\n            m_Api, SIGNAL (wallpaperChanged()),\n            &m_SignalSink, SLOT (wallpaperChanged()));\n    QVERIFY (connectSuccess);\n\n\n    \/\/QVERIFY (m_Api->m_EditedImage == 0);\n}\n\nvoid \nUt_WallpaperBusinessLogic::cleanupTestCase()\n{\n    delete m_Api;\n\n    m_App->deleteLater ();\n}\n\n\/*!\n * Checks the low level WallpaperITrans class, its tag methods and overloaded\n * operators.\n *\/\nvoid\nUt_WallpaperBusinessLogic::testITrans ()\n{\n    WallpaperITrans trans1, trans2, trans4, trans5;\n    \n    SYS_DEBUG (\"Checking default values of WallpaperITrans...\");\n    QVERIFY (trans1.x() == 0);\n    QVERIFY (trans1.y() == 0);\n    QVERIFY (trans1.scale() == 1.0);\n    QVERIFY (trans1.orientation() == M::Landscape);\n\n    SYS_DEBUG (\"Checking the set functions...\");\n    trans2.setOffset (QPointF(10, 11));\n    trans2.setScale (2.0);\n    trans2.setOrientation (M::Portrait);\n    trans2.setExpectedSize (QSize(864, 480));\n\n    QVERIFY (trans2.x() == 10);\n    QVERIFY (trans2.y() == 11);\n    QVERIFY (trans2.offset() == QPointF(10, 11));\n    QVERIFY (trans2.scale() == 2.0);\n    QVERIFY (trans2.orientation() == M::Portrait);\n    QVERIFY (trans2.expectedWidth() == 864);\n    QVERIFY (trans2.expectedHeight() == 480);\n\n    trans2 += QPointF(1.0, 1.0);\n    QVERIFY (trans2.offset() == QPointF(11, 12));\n\n    SYS_DEBUG (\"Testing the copy constructor.\");\n    WallpaperITrans trans3 (trans2);\n    QVERIFY (trans3.x() == 11);\n    QVERIFY (trans3.y() == 12);\n    QVERIFY (trans3.scale() == 2.0);\n    QVERIFY (trans3.orientation() == M::Portrait);\n    QVERIFY (trans3.expectedWidth() == 864);\n    QVERIFY (trans3.expectedHeight() == 480);\n\n    SYS_DEBUG (\"testing operator=...\");\n    trans1 = trans2;\n    QVERIFY (trans1.x() == 11);\n    QVERIFY (trans1.y() == 12);\n    QVERIFY (trans1.scale() == 2.0);\n    QVERIFY (trans1.orientation() == M::Portrait);\n    QVERIFY (trans1.expectedWidth() == 864);\n    QVERIFY (trans1.expectedHeight() == 480);\n    QVERIFY (trans1.expectedSize() == QSize(864, 480));\n\n    SYS_DEBUG (\"Testing operator*...\");\n    SYS_DEBUG (\"*** trans1.scale() = %d\", trans2 * 2);\n    QVERIFY (trans2 * 2 == 4);\n\n\n    QVERIFY (trans4.noTransformation ());\n    QVERIFY (trans4.rotation() == 0.0);\n    trans4.setRotation(90.0);\n    QVERIFY (!trans4.noTransformation ());\n    QVERIFY (trans4.rotation() == 90.0);\n    trans4.modRotation(1200.0);\n    QVERIFY (trans4.rotation() > 90.0);\n\n    QVERIFY (trans5.noTransformation ());\n    trans5.modScale(1200);\n    QVERIFY (!trans5.noTransformation ());\n    QVERIFY (trans5.scale() > 1.0);\n\n    trans5.setScale (0.1);\n    trans5.modScale (-1200);\n    trans5.modScale (-1200);\n    trans5.modScale (-1200);\n    QVERIFY (trans5.scale() > 0.0);\n}\n\n\/*!\n * Checks if the GConfItem objects are created with the right keys.\n *\/\nvoid\nUt_WallpaperBusinessLogic::testGConfItems ()\n{\n    QVERIFY (m_Api->m_PPItem != NULL);\n    QVERIFY (m_Api->m_PPItem->key() == Wallpaper::CurrentPortraitKey);\n\n    QVERIFY (m_Api->m_POItem != NULL);\n    QVERIFY (m_Api->m_POItem->key() == Wallpaper::OriginalPortraitKey);\n\n    QVERIFY (m_Api->m_PHItem != NULL);\n    QVERIFY (m_Api->m_PHItem->key() == Wallpaper::PortraitHistoryKey);\n}\n\n\/*!\n *\/\nvoid\nUt_WallpaperBusinessLogic::testCurrentWallpaper ()\n{\n    QString currentFilePath;\n    QString originalFilePath;\n\n\n    m_Api->currentWallpaper (currentFilePath, originalFilePath);\n    QVERIFY (currentFilePath == \"\/ak\/current.jpg\");\n    QVERIFY (originalFilePath.isEmpty());\n\n    SYS_DEBUG (\"*** currentFilePath  = %s\", SYS_STR(currentFilePath));\n    SYS_DEBUG (\"*** originalFilePath = %s\", SYS_STR(originalFilePath));\n}\n\nvoid\nUt_WallpaperBusinessLogic::testSceneSize ()\n{\n    QSize size = m_Api->sceneSize ();\n    QSize expected = QSize (480, 854);\n\n    QVERIFY (size == expected);\n}\n\nvoid\nUt_WallpaperBusinessLogic::testEditedImage ()\n{\n    QVERIFY (!m_Api->hasEditedImage ());\n\n    m_Api->endEdit ();\n    QVERIFY (!m_Api->hasEditedImage ());\n\n}\n\n\/******************************************************************************\n * Private functions.\n *\/\nQTEST_APPLESS_MAIN(Ut_WallpaperBusinessLogic)\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"window-video.h\"\n\nstatic HWND         g_hVideo = NULL;\n\n#define MAX_LOADSTRING 100\n\n\/\/ Video_WndProc\nLRESULT CALLBACK Video_WndProc( HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam )\n{ int wmId, wmEvent;\n\tPAINTSTRUCT ps;\n\tHDC hdc;\n\n\tswitch (message)\n\t{\n\t\tcase WM_PAINT:\n\t\t\thdc = BeginPaint(hWnd, &ps);\n\t\t\tEndPaint(hWnd, &ps);\n\t\t\tbreak;\n\n    case WM_CLOSE:\n      { ShowWindow( hWnd, FALSE );\n      }\n\t    break;\n\t    \n    case WM_DESTROY:\n      { PostQuitMessage(0);\n      }\n\t\t  break;\n\n\t\tdefault:\n\t\t\treturn DefWindowProc(hWnd, message, wParam, lParam);\n\t}\n\n\treturn 0;\n}\n\nATOM Video_RegisterClass ( HINSTANCE hInstance )\n{   \/\/\n    \/\/ Register class\n    \/\/\n    WNDCLASSEX wcex;\n    wcex.cbSize = sizeof(WNDCLASSEX);\n    wcex.style          = CS_HREDRAW | CS_VREDRAW;\n    wcex.lpfnWndProc    = Video_WndProc;\n    wcex.cbClsExtra     = 0;\n    wcex.cbWndExtra     = 0;\n    wcex.hInstance      = hInstance;\n    wcex.hIcon          = LoadIcon(hInstance, (LPCTSTR)IDI_FETCH);\n    wcex.hCursor        = LoadCursor(NULL, IDC_ARROW);\n    wcex.hbrBackground  = (HBRUSH)(COLOR_WINDOW+1);\n    wcex.lpszMenuName   = NULL;\n    wcex.lpszClassName  = VIDEO_CLASS_NAME;\n    wcex.hIconSm        = LoadIcon(wcex.hInstance, (LPCTSTR)IDI_FETCH);\n    if( !RegisterClassEx(&wcex) )\n    return FALSE;\n}\n\nHWND Video_InitInstance ( HINSTANCE hInstance, int nCmdShow)\n{ HWND hWnd;   \n  TCHAR        szTitle[MAX_LOADSTRING] = \"Video:\\0\";  \/\/ The title bar text\n\t \n  LoadString(hInstance, IDS_APP_TITLE, szTitle+6, MAX_LOADSTRING-6);   \n  \/\/\n  \/\/ Create window\n  \/\/  \n  RECT rc = { 0, 0, 640, 480 };\n  AdjustWindowRect( &rc, WS_OVERLAPPEDWINDOW, FALSE );\n  g_hVideo = CreateWindow( VIDEO_CLASS_NAME, \n                           \"Direct3D 10 Tutorial 0: Setting Up Window\",\n                           WS_OVERLAPPEDWINDOW,\n                           CW_USEDEFAULT,\n                           CW_USEDEFAULT, \n                           rc.right - rc.left,\n                           rc.bottom - rc.top, \n                           NULL,\n                           NULL,\n                           hInstance,\n                           NULL);\n\n  if( !g_hVideo )\n      return FALSE;\n\n  ShowWindow( g_hVideo, nCmdShow );\n}\n\nDWORD WINAPI Video_Main_Thread( LPVOID lparam )\n{\tMSG msg = {0};\n\n\t\/\/ Main message loop:\n\twhile (GetMessage(&msg, NULL, 0, 0))\n\t{\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessage(&msg);\n\t}\n\treturn 0;\n}<commit_msg>WIP: Going through DirectX tutorial<commit_after>#include \"stdafx.h\"\n#include <d3d10.h>\n#include <d3dx10.h>\n\n#include \"window-video.h\"\n\nstatic HWND         g_hVideo = NULL;\n\nD3D10_DRIVER_TYPE       g_driverType = D3D10_DRIVER_TYPE_NULL;\nID3D10Device*           g_pd3dDevice = NULL;\nIDXGISwapChain*         g_pSwapChain = NULL;\nID3D10RenderTargetView* g_pRenderTargetView = NULL;\n\n#define MAX_LOADSTRING 100\n\n\/\/ Video_WndProc\nLRESULT CALLBACK Video_WndProc( HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam )\n{ int wmId, wmEvent;\n\tPAINTSTRUCT ps;\n\tHDC hdc;\n\n\tswitch (message)\n\t{\n\t\tcase WM_PAINT:\n\t\t\thdc = BeginPaint(hWnd, &ps);\n\t\t\tEndPaint(hWnd, &ps);\n\t\t\tbreak;\n\n    case WM_CLOSE:\n      { ShowWindow( hWnd, FALSE );\n      }\n\t    break;\n\t    \n    case WM_DESTROY:\n      { PostQuitMessage(0);\n      }\n\t\t  break;\n\n\t\tdefault:\n\t\t\treturn DefWindowProc(hWnd, message, wParam, lParam);\n\t}\n\n\treturn 0;\n}\n\nATOM Video_RegisterClass ( HINSTANCE hInstance )\n{   \/\/\n    \/\/ Register class\n    \/\/\n    WNDCLASSEX wcex;\n    wcex.cbSize = sizeof(WNDCLASSEX);\n    wcex.style          = CS_HREDRAW | CS_VREDRAW;\n    wcex.lpfnWndProc    = Video_WndProc;\n    wcex.cbClsExtra     = 0;\n    wcex.cbWndExtra     = 0;\n    wcex.hInstance      = hInstance;\n    wcex.hIcon          = LoadIcon(hInstance, (LPCTSTR)IDI_FETCH);\n    wcex.hCursor        = LoadCursor(NULL, IDC_ARROW);\n    wcex.hbrBackground  = (HBRUSH)(COLOR_WINDOW+1);\n    wcex.lpszMenuName   = NULL;\n    wcex.lpszClassName  = VIDEO_CLASS_NAME;\n    wcex.hIconSm        = LoadIcon(wcex.hInstance, (LPCTSTR)IDI_FETCH);\n    if( !RegisterClassEx(&wcex) )\n      return E_FAIL;\n    return S_OK;\n}\n\nHWND Video_InitWindow ( HINSTANCE hInstance, int nCmdShow)\n{ HWND hWnd;   \n  TCHAR        szTitle[MAX_LOADSTRING] = \"Video:\\0\";  \/\/ The title bar text\n\t \n  LoadString(hInstance, IDS_APP_TITLE, szTitle+6, MAX_LOADSTRING-6);\n  \n  if( FAILED( Video_RegisterClass(hInistance) ) )\n    return E_FAIL;\n    \n  \/\/\n  \/\/ Create window\n  \/\/  \n  RECT rc = { 0, 0, 640, 480 };\n  AdjustWindowRect( &rc, WS_OVERLAPPEDWINDOW, FALSE );\n  g_hVideo = CreateWindow( VIDEO_CLASS_NAME, \n                           \"Direct3D 10 Tutorial 0: Setting Up Window\",\n                           WS_OVERLAPPEDWINDOW,\n                           CW_USEDEFAULT,\n                           CW_USEDEFAULT, \n                           rc.right - rc.left,\n                           rc.bottom - rc.top, \n                           NULL,\n                           NULL,\n                           hInstance,\n                           NULL);\n\n  if( !g_hVideo )\n      return FALSE;\n\n  ShowWindow( g_hVideo, nCmdShow );\n}\n\n\/\/--------------------------------------------------------------------------------------\n\/\/ Create Direct3D device and swap chain\n\/\/--------------------------------------------------------------------------------------\nHRESULT InitDevice()\n{\n    HRESULT hr = S_OK;;\n\n    RECT rc;\n    GetClientRect( g_hVideo, &rc );\n    UINT width = rc.right - rc.left;\n    UINT height = rc.bottom - rc.top;\n\n    UINT createDeviceFlags = 0;\n#ifdef _DEBUG\n    createDeviceFlags |= D3D10_CREATE_DEVICE_DEBUG;\n#endif\n\n    D3D10_DRIVER_TYPE driverTypes[] =\n    {\n        D3D10_DRIVER_TYPE_HARDWARE,\n        D3D10_DRIVER_TYPE_REFERENCE,\n    };\n    UINT numDriverTypes = sizeof( driverTypes ) \/ sizeof( driverTypes[0] );\n\n    DXGI_SWAP_CHAIN_DESC sd;\n    ZeroMemory( &sd, sizeof( sd ) );\n    sd.BufferCount = 1;\n    sd.BufferDesc.Width = width;\n    sd.BufferDesc.Height = height;\n    sd.BufferDesc.Format = DXGI_FORMAT_R8G8B8A8_UNORM;\n    sd.BufferDesc.RefreshRate.Numerator = 60;\n    sd.BufferDesc.RefreshRate.Denominator = 1;\n    sd.BufferUsage = DXGI_USAGE_RENDER_TARGET_OUTPUT;\n    sd.OutputWindow = g_hVideo;\n    sd.SampleDesc.Count = 1;\n    sd.SampleDesc.Quality = 0;\n    sd.Windowed = TRUE;\n\n    for( UINT driverTypeIndex = 0; driverTypeIndex < numDriverTypes; driverTypeIndex++ )\n    {\n        g_driverType = driverTypes[driverTypeIndex];\n        hr = D3D10CreateDeviceAndSwapChain( NULL,             \/\/adapter\n                                            g_driverType,     \/\/driver type\n                                            NULL,             \/\/software module\n                                            createDeviceFlags,\/\/flags   -  optionally set debug mode\n                                            D3D10_SDK_VERSION,\/\/version\n                                            &sd,              \/\/swap chain desciption\n                                            &g_pSwapChain,    \/\/swap chain\n                                            &g_pd3dDevice );  \/\/device\n        if( SUCCEEDED( hr ) )\n            break;\n    }\n    if( FAILED( hr ) )\n        return hr;\n\n    \/\/ Create a render target view\n    ID3D10Texture2D* pBackBuffer;\n    hr = g_pSwapChain->GetBuffer( 0, __uuidof( ID3D10Texture2D ), ( LPVOID* )&pBackBuffer );\n    if( FAILED( hr ) )\n        return hr;\n\n    hr = g_pd3dDevice->CreateRenderTargetView( pBackBuffer, NULL, &g_pRenderTargetView );    \n    pBackBuffer->Release();\n    if( FAILED( hr ) )\n        return hr;\n\n    g_pd3dDevice->OMSetRenderTargets( 1, &g_pRenderTargetView, NULL );\n\n    \/\/ Setup the viewport\n    D3D10_VIEWPORT vp;\n    vp.Width = width;\n    vp.Height = height;\n    vp.MinDepth = 0.0f;\n    vp.MaxDepth = 1.0f;\n    vp.TopLeftX = 0;\n    vp.TopLeftY = 0;\n    g_pd3dDevice->RSSetViewports( 1, &vp );\n\n    return S_OK;\n}\n\nDWORD WINAPI Video_Main_Thread( LPVOID lparam )\n{\tMSG msg = {0};\n\n  if( FAILED( InitWindow( hInstance, nCmdShow ) ) )\n      return 0;\n\n  if( FAILED( InitDevice() ) )\n  {\n      CleanupDevice();\n      return 0;\n  }\n  \n  \/\/ Main message loop\n  MSG msg = {0};\n  while( WM_QUIT != msg.message )\n  {\n      if( PeekMessage( &msg, NULL, 0, 0, PM_REMOVE ) )\n      {\n          TranslateMessage( &msg );\n          DispatchMessage( &msg );\n      }\n      else\n      {\n          Render();\n      }\n  }\n\n  CleanupDevice();\n\n  return ( int )msg.wParam;\n}<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: stgio.cxx,v $\n *\n *  $Revision: 1.1.1.1 $\n *\n *  last change: $Author: hr $ $Date: 2000-09-18 16: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#include \"stg.hxx\"\n#include \"stgelem.hxx\"\n#include \"stgcache.hxx\"\n#include \"stgstrms.hxx\"\n#include \"stgdir.hxx\"\n#include \"stgio.hxx\"\n#pragma hdrstop\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ class StgIo \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ This class holds the storage header and all internal streams.\n\nStgIo::StgIo() : StgCache()\n{\n    pTOC      = NULL;\n    pDataFAT  = NULL;\n    pDataStrm = NULL;\n    pFAT      = NULL;\n    bCopied   = FALSE;\n}\n\nStgIo::~StgIo()\n{\n    delete pTOC;\n    delete pDataFAT;\n    delete pDataStrm;\n    delete pFAT;\n}\n\n\/\/ Load the header. Do not set an error code if the header is invalid.\n\nBOOL StgIo::Load()\n{\n    if( pStrm )\n    {\n        if( aHdr.Load( *this ) )\n            if( aHdr.Check() )\n                SetupStreams();\n            else\n                return FALSE;\n    }\n    return Good();\n}\n\n\/\/ Set up an initial, empty storage\n\nBOOL StgIo::Init()\n{\n    aHdr.Init();\n    SetupStreams();\n    return CommitAll();\n}\n\nvoid StgIo::SetupStreams()\n{\n    delete pTOC;\n    delete pDataFAT;\n    delete pDataStrm;\n    delete pFAT;\n    pTOC      = NULL;\n    pDataFAT  = NULL;\n    pDataStrm = NULL;\n    pFAT      = NULL;\n    ResetError();\n    SetPhysPageSize( 1 << aHdr.GetPageSize() );\n    pFAT = new StgFATStrm( *this );\n    pTOC = new StgDirStrm( *this );\n    if( !GetError() )\n    {\n        StgDirEntry* pRoot = pTOC->GetRoot();\n        if( pRoot )\n        {\n            pDataFAT = new StgDataStrm( *this, aHdr.GetDataFATStart(), -1 );\n            pDataStrm = new StgDataStrm( *this, pRoot );\n            pDataFAT->SetIncrement( 1 << aHdr.GetPageSize() );\n            pDataStrm->SetIncrement( GetDataPageSize() );\n            pDataStrm->SetEntry( *pRoot );\n        }\n        else\n            SetError( SVSTREAM_FILEFORMAT_ERROR );\n    }\n}\n\n\/\/ get the logical data page size\n\nshort StgIo::GetDataPageSize()\n{\n    return 1 << aHdr.GetDataPageSize();\n}\n\n\/\/ Commit everything\n\nBOOL StgIo::CommitAll()\n{\n    \/\/ Store the data (all streams and the TOC)\n    if( pTOC->Store() )\n    {\n        if( Commit( NULL ) )\n        {\n            aHdr.SetDataFATStart( pDataFAT->GetStart() );\n            aHdr.SetDataFATSize( pDataFAT->GetPages() );\n            aHdr.SetTOCStart( pTOC->GetStart() );\n            if( aHdr.Store( *this ) )\n            {\n                pStrm->Flush();\n                ULONG n = pStrm->GetError();\n                SetError( n );\n#ifdef DBG_UTIL\n                if( n==0 ) ValidateFATs();\n#endif\n                return BOOL( n == 0 );\n            }\n        }\n    }\n    SetError( SVSTREAM_WRITE_ERROR );\n    return FALSE;\n}\n\n\nclass EasyFat\n{\n    INT32 *pFat;\n    BOOL  *pFree;\n    INT32 nPages;\n    INT32 nPageSize;\n\npublic:\n    EasyFat( StgIo & rIo, StgStrm *pFatStream, INT32 nPSize );\n    ~EasyFat() { delete pFat; delete pFree; }\n    INT32 GetPageSize() { return nPageSize; }\n    INT32 Count() { return nPages; }\n    INT32 operator[]( INT32 nOffset ) { return pFat[ nOffset ]; }\n\n    ULONG Mark( INT32 nPage, INT32 nCount, INT32 nExpect );\n    BOOL HasUnrefChains();\n};\n\nEasyFat::EasyFat( StgIo& rIo, StgStrm* pFatStream, INT32 nPSize )\n{\n    nPages = pFatStream->GetSize() >> 2;\n    nPageSize = nPSize;\n    pFat = new INT32[ nPages ];\n    pFree = new BOOL[ nPages ];\n\n    StgPage *pPage;\n    INT32 nFatPageSize = 1 << rIo.aHdr.GetPageSize() - 2;\n\n    for( INT32 nPage = 0; nPage < nPages; nPage++ )\n    {\n        if( ! (nPage % nFatPageSize) )\n        {\n            pFatStream->Pos2Page( nPage << 2 );\n            INT32 nPhysPage = pFatStream->GetPage();\n            pPage = rIo.Get( nPhysPage, TRUE );\n        }\n\n        pFat[ nPage ] = pPage->GetPage( ( nPage % nFatPageSize ) );\n        pFree[ nPage ] = TRUE;\n    }\n}\n\nBOOL EasyFat::HasUnrefChains()\n{\n    for( INT32 nPage = 0; nPage < nPages; nPage++ )\n    {\n        if( pFree[ nPage ] && pFat[ nPage ] != -1 )\n            return TRUE;\n    }\n    return FALSE;\n}\n\nULONG EasyFat::Mark( INT32 nPage, INT32 nCount, INT32 nExpect )\n{\n    if( nCount > 0 )\n        --nCount \/= GetPageSize(), nCount++;\n\n    INT32 nCurPage = nPage;\n    while( nCount != 0 )\n    {\n        pFree[ nCurPage ] = FALSE;\n        nCurPage = pFat[ nCurPage ];\n        \/\/Stream zu lang\n        if( nCurPage != nExpect && nCount == 1 )\n            return FAT_WRONGLENGTH;\n        \/\/Stream zu kurz\n        if( nCurPage == nExpect && nCount != 1 && nCount != -1 )\n            return FAT_WRONGLENGTH;\n        \/\/ letzter Block bei Stream ohne Laenge\n        if( nCurPage == nExpect && nCount == -1 )\n            nCount = 1;\n        if( nCount != -1 )\n            nCount--;\n        \/\/ Naechster Block nicht in der FAT\n        if( nCount && ( nCurPage < 0 || nCurPage >= nPages ) )\n            return FAT_OUTOFBOUNDS;\n    }\n    return FAT_OK;\n}\n\nclass Validator\n{\n    ULONG nError;\n\n    EasyFat aSmallFat;\n    EasyFat aFat;\n\n    StgIo &rIo;\n\n    ULONG ValidateMasterFATs();\n    ULONG ValidateDirectoryEntries();\n    ULONG FindUnrefedChains();\n    ULONG MarkAll( StgDirEntry *pEntry );\n\npublic:\n\n    Validator( StgIo &rIo );\n    BOOL IsError() { return nError != 0; }\n};\n\nValidator::Validator( StgIo &rIoP )\n    : aSmallFat( rIoP, rIoP.pDataFAT, 1 << rIoP.aHdr.GetDataPageSize() ),\n      aFat( rIoP, rIoP.pFAT, 1 << rIoP.aHdr.GetPageSize() ),\n      rIo( rIoP )\n{\n    ULONG nErr = nError = FAT_OK;\n\n    if( ( nErr = ValidateMasterFATs() ) != FAT_OK )\n        nError = nErr;\n    else if(    ( nErr = ValidateDirectoryEntries() ) != FAT_OK )\n        nError = nErr;\n    else if(    ( nErr = FindUnrefedChains()) != FAT_OK )\n        nError = nErr;\n}\n\nULONG Validator::ValidateMasterFATs()\n{\n    INT32 nCount = rIo.aHdr.GetFATSize();\n    ULONG nErr;\n    for( INT32 i = 0; i < nCount; i++ )\n    {\n        if( ( nErr = aFat.Mark(\n            rIo.pFAT->GetPage( i, FALSE ), aFat.GetPageSize(), -3 ))\n            != FAT_OK )\n            return nErr;\n    }\n    if( rIo.aHdr.GetMasters() )\n        if( ( nErr = aFat.Mark(\n            rIo.aHdr.GetFATChain( ), aFat.GetPageSize(), -4 )) != FAT_OK )\n            return nErr;\n    return FAT_OK;\n}\n\nULONG Validator::MarkAll( StgDirEntry *pEntry )\n{\n    StgIterator aIter( *pEntry );\n    ULONG nErr = FAT_OK;\n    for( StgDirEntry* p = aIter.First(); p ; p = aIter.Next() )\n    {\n        if( p->aEntry.GetType() == STG_STORAGE )\n        {\n            nErr = MarkAll( p );\n            if( nErr != FAT_OK )\n                return nErr;\n        }\n        else\n        {\n            INT32 nSize = p->aEntry.GetSize();\n            if( nSize < rIo.aHdr.GetThreshold()  )\n                nErr = aSmallFat.Mark( p->aEntry.GetStartPage(),nSize, -2 );\n            else\n                nErr = aFat.Mark( p->aEntry.GetStartPage(),nSize, -2 );\n            if( nErr != FAT_OK )\n                return nErr;\n        }\n    }\n    return FAT_OK;\n}\n\nULONG Validator::ValidateDirectoryEntries()\n{\n    \/\/ Normale DirEntries\n    ULONG nErr = MarkAll( rIo.pTOC->GetRoot() );\n    if( nErr != FAT_OK )\n        return nErr;\n    \/\/ Small Data\n    nErr = aFat.Mark( rIo.pTOC->GetRoot()->aEntry.GetStartPage(),\n                 rIo.pTOC->GetRoot()->aEntry.GetSize(), -2 );\n    if( nErr != FAT_OK )\n        return nErr;\n    \/\/ Small Data FAT\n    nErr = aFat.Mark(\n        rIo.aHdr.GetDataFATStart(),\n        rIo.aHdr.GetDataFATSize() * aFat.GetPageSize(), -2 );\n    if( nErr != FAT_OK )\n        return nErr;\n    \/\/ TOC\n    nErr = aFat.Mark(\n        rIo.aHdr.GetTOCStart(), -1, -2 );\n    return nErr;\n}\n\nULONG Validator::FindUnrefedChains()\n{\n    if( aSmallFat.HasUnrefChains() ||\n        aFat.HasUnrefChains() )\n        return FAT_UNREFCHAIN;\n    else\n        return FAT_OK;\n}\n\nLink StgIo::aErrorLink;\n\nvoid StgIo::SetErrorLink( const Link& rLink )\n{\n    aErrorLink = rLink;\n}\n\nULONG StgIo::ValidateFATs()\n{\n    if( bFile )\n    {\n        Validator *pV = new Validator( *this );\n        BOOL bRet1 = !pV->IsError(), bRet2 = TRUE ;\n        delete pV;\n        SvFileStream *pFileStrm = ( SvFileStream *) GetStrm();\n        StgIo aIo;\n        if( aIo.Open( pFileStrm->GetFileName(),\n                      STREAM_READ  | STREAM_SHARE_DENYNONE) &&\n            aIo.Load() )\n        {\n            pV = new Validator( aIo );\n            bRet2 = !pV->IsError();\n            delete pV;\n        }\n\n        ULONG nErr;\n        if( bRet1 != bRet2 )\n            nErr = bRet1 ? FAT_ONFILEERROR : FAT_INMEMORYERROR;\n        else nErr = bRet1 ? FAT_OK : FAT_BOTHERROR;\n        if( nErr != FAT_OK && !bCopied )\n        {\n            StgLinkArg aArg;\n            aArg.aFile = pFileStrm->GetFileName();\n            aArg.nErr = nErr;\n            aErrorLink.Call( &aArg );\n            bCopied = TRUE;\n        }\n\/\/      DBG_ASSERT( nErr == FAT_OK ,\"Storage kaputt\");\n        return nErr;\n    }\n\/\/  DBG_ERROR(\"Validiere nicht (kein FileStorage)\");\n    return FAT_OK;\n}\n\n\n<commit_msg>INTEGRATION: CWS ooo20031216 (1.1.1.1.146); FILE MERGED 2003\/12\/24 11:39:09 waratah 1.1.1.1.146.1: #i1858# work around a warning issued by gcc<commit_after>\/*************************************************************************\n *\n *  $RCSfile: stgio.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: hr $ $Date: 2004-02-04 12:31: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#include \"stg.hxx\"\n#include \"stgelem.hxx\"\n#include \"stgcache.hxx\"\n#include \"stgstrms.hxx\"\n#include \"stgdir.hxx\"\n#include \"stgio.hxx\"\n#pragma hdrstop\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ class StgIo \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ This class holds the storage header and all internal streams.\n\nStgIo::StgIo() : StgCache()\n{\n    pTOC      = NULL;\n    pDataFAT  = NULL;\n    pDataStrm = NULL;\n    pFAT      = NULL;\n    bCopied   = FALSE;\n}\n\nStgIo::~StgIo()\n{\n    delete pTOC;\n    delete pDataFAT;\n    delete pDataStrm;\n    delete pFAT;\n}\n\n\/\/ Load the header. Do not set an error code if the header is invalid.\n\nBOOL StgIo::Load()\n{\n    if( pStrm )\n    {\n        if( aHdr.Load( *this ) )\n            if( aHdr.Check() )\n                SetupStreams();\n            else\n                return FALSE;\n    }\n    return Good();\n}\n\n\/\/ Set up an initial, empty storage\n\nBOOL StgIo::Init()\n{\n    aHdr.Init();\n    SetupStreams();\n    return CommitAll();\n}\n\nvoid StgIo::SetupStreams()\n{\n    delete pTOC;\n    delete pDataFAT;\n    delete pDataStrm;\n    delete pFAT;\n    pTOC      = NULL;\n    pDataFAT  = NULL;\n    pDataStrm = NULL;\n    pFAT      = NULL;\n    ResetError();\n    SetPhysPageSize( 1 << aHdr.GetPageSize() );\n    pFAT = new StgFATStrm( *this );\n    pTOC = new StgDirStrm( *this );\n    if( !GetError() )\n    {\n        StgDirEntry* pRoot = pTOC->GetRoot();\n        if( pRoot )\n        {\n            pDataFAT = new StgDataStrm( *this, aHdr.GetDataFATStart(), -1 );\n            pDataStrm = new StgDataStrm( *this, pRoot );\n            pDataFAT->SetIncrement( 1 << aHdr.GetPageSize() );\n            pDataStrm->SetIncrement( GetDataPageSize() );\n            pDataStrm->SetEntry( *pRoot );\n        }\n        else\n            SetError( SVSTREAM_FILEFORMAT_ERROR );\n    }\n}\n\n\/\/ get the logical data page size\n\nshort StgIo::GetDataPageSize()\n{\n    return 1 << aHdr.GetDataPageSize();\n}\n\n\/\/ Commit everything\n\nBOOL StgIo::CommitAll()\n{\n    \/\/ Store the data (all streams and the TOC)\n    if( pTOC->Store() )\n    {\n        if( Commit( NULL ) )\n        {\n            aHdr.SetDataFATStart( pDataFAT->GetStart() );\n            aHdr.SetDataFATSize( pDataFAT->GetPages() );\n            aHdr.SetTOCStart( pTOC->GetStart() );\n            if( aHdr.Store( *this ) )\n            {\n                pStrm->Flush();\n                ULONG n = pStrm->GetError();\n                SetError( n );\n#ifdef DBG_UTIL\n                if( n==0 ) ValidateFATs();\n#endif\n                return BOOL( n == 0 );\n            }\n        }\n    }\n    SetError( SVSTREAM_WRITE_ERROR );\n    return FALSE;\n}\n\n\nclass EasyFat\n{\n    INT32 *pFat;\n    BOOL  *pFree;\n    INT32 nPages;\n    INT32 nPageSize;\n\npublic:\n    EasyFat( StgIo & rIo, StgStrm *pFatStream, INT32 nPSize );\n    ~EasyFat() { delete pFat; delete pFree; }\n    INT32 GetPageSize() { return nPageSize; }\n    INT32 Count() { return nPages; }\n    INT32 operator[]( INT32 nOffset ) { return pFat[ nOffset ]; }\n\n    ULONG Mark( INT32 nPage, INT32 nCount, INT32 nExpect );\n    BOOL HasUnrefChains();\n};\n\nEasyFat::EasyFat( StgIo& rIo, StgStrm* pFatStream, INT32 nPSize )\n{\n    nPages = pFatStream->GetSize() >> 2;\n    nPageSize = nPSize;\n    pFat = new INT32[ nPages ];\n    pFree = new BOOL[ nPages ];\n\n    StgPage *pPage = NULL;\n    INT32 nFatPageSize = 1 << rIo.aHdr.GetPageSize() - 2;\n\n    for( INT32 nPage = 0; nPage < nPages; nPage++ )\n    {\n        if( ! (nPage % nFatPageSize) )\n        {\n            pFatStream->Pos2Page( nPage << 2 );\n            INT32 nPhysPage = pFatStream->GetPage();\n            pPage = rIo.Get( nPhysPage, TRUE );\n        }\n\n        pFat[ nPage ] = pPage->GetPage( ( nPage % nFatPageSize ) );\n        pFree[ nPage ] = TRUE;\n    }\n}\n\nBOOL EasyFat::HasUnrefChains()\n{\n    for( INT32 nPage = 0; nPage < nPages; nPage++ )\n    {\n        if( pFree[ nPage ] && pFat[ nPage ] != -1 )\n            return TRUE;\n    }\n    return FALSE;\n}\n\nULONG EasyFat::Mark( INT32 nPage, INT32 nCount, INT32 nExpect )\n{\n    if( nCount > 0 )\n        --nCount \/= GetPageSize(), nCount++;\n\n    INT32 nCurPage = nPage;\n    while( nCount != 0 )\n    {\n        pFree[ nCurPage ] = FALSE;\n        nCurPage = pFat[ nCurPage ];\n        \/\/Stream zu lang\n        if( nCurPage != nExpect && nCount == 1 )\n            return FAT_WRONGLENGTH;\n        \/\/Stream zu kurz\n        if( nCurPage == nExpect && nCount != 1 && nCount != -1 )\n            return FAT_WRONGLENGTH;\n        \/\/ letzter Block bei Stream ohne Laenge\n        if( nCurPage == nExpect && nCount == -1 )\n            nCount = 1;\n        if( nCount != -1 )\n            nCount--;\n        \/\/ Naechster Block nicht in der FAT\n        if( nCount && ( nCurPage < 0 || nCurPage >= nPages ) )\n            return FAT_OUTOFBOUNDS;\n    }\n    return FAT_OK;\n}\n\nclass Validator\n{\n    ULONG nError;\n\n    EasyFat aSmallFat;\n    EasyFat aFat;\n\n    StgIo &rIo;\n\n    ULONG ValidateMasterFATs();\n    ULONG ValidateDirectoryEntries();\n    ULONG FindUnrefedChains();\n    ULONG MarkAll( StgDirEntry *pEntry );\n\npublic:\n\n    Validator( StgIo &rIo );\n    BOOL IsError() { return nError != 0; }\n};\n\nValidator::Validator( StgIo &rIoP )\n    : aSmallFat( rIoP, rIoP.pDataFAT, 1 << rIoP.aHdr.GetDataPageSize() ),\n      aFat( rIoP, rIoP.pFAT, 1 << rIoP.aHdr.GetPageSize() ),\n      rIo( rIoP )\n{\n    ULONG nErr = nError = FAT_OK;\n\n    if( ( nErr = ValidateMasterFATs() ) != FAT_OK )\n        nError = nErr;\n    else if(    ( nErr = ValidateDirectoryEntries() ) != FAT_OK )\n        nError = nErr;\n    else if(    ( nErr = FindUnrefedChains()) != FAT_OK )\n        nError = nErr;\n}\n\nULONG Validator::ValidateMasterFATs()\n{\n    INT32 nCount = rIo.aHdr.GetFATSize();\n    ULONG nErr;\n    for( INT32 i = 0; i < nCount; i++ )\n    {\n        if( ( nErr = aFat.Mark(\n            rIo.pFAT->GetPage( i, FALSE ), aFat.GetPageSize(), -3 ))\n            != FAT_OK )\n            return nErr;\n    }\n    if( rIo.aHdr.GetMasters() )\n        if( ( nErr = aFat.Mark(\n            rIo.aHdr.GetFATChain( ), aFat.GetPageSize(), -4 )) != FAT_OK )\n            return nErr;\n    return FAT_OK;\n}\n\nULONG Validator::MarkAll( StgDirEntry *pEntry )\n{\n    StgIterator aIter( *pEntry );\n    ULONG nErr = FAT_OK;\n    for( StgDirEntry* p = aIter.First(); p ; p = aIter.Next() )\n    {\n        if( p->aEntry.GetType() == STG_STORAGE )\n        {\n            nErr = MarkAll( p );\n            if( nErr != FAT_OK )\n                return nErr;\n        }\n        else\n        {\n            INT32 nSize = p->aEntry.GetSize();\n            if( nSize < rIo.aHdr.GetThreshold()  )\n                nErr = aSmallFat.Mark( p->aEntry.GetStartPage(),nSize, -2 );\n            else\n                nErr = aFat.Mark( p->aEntry.GetStartPage(),nSize, -2 );\n            if( nErr != FAT_OK )\n                return nErr;\n        }\n    }\n    return FAT_OK;\n}\n\nULONG Validator::ValidateDirectoryEntries()\n{\n    \/\/ Normale DirEntries\n    ULONG nErr = MarkAll( rIo.pTOC->GetRoot() );\n    if( nErr != FAT_OK )\n        return nErr;\n    \/\/ Small Data\n    nErr = aFat.Mark( rIo.pTOC->GetRoot()->aEntry.GetStartPage(),\n                 rIo.pTOC->GetRoot()->aEntry.GetSize(), -2 );\n    if( nErr != FAT_OK )\n        return nErr;\n    \/\/ Small Data FAT\n    nErr = aFat.Mark(\n        rIo.aHdr.GetDataFATStart(),\n        rIo.aHdr.GetDataFATSize() * aFat.GetPageSize(), -2 );\n    if( nErr != FAT_OK )\n        return nErr;\n    \/\/ TOC\n    nErr = aFat.Mark(\n        rIo.aHdr.GetTOCStart(), -1, -2 );\n    return nErr;\n}\n\nULONG Validator::FindUnrefedChains()\n{\n    if( aSmallFat.HasUnrefChains() ||\n        aFat.HasUnrefChains() )\n        return FAT_UNREFCHAIN;\n    else\n        return FAT_OK;\n}\n\nLink StgIo::aErrorLink;\n\nvoid StgIo::SetErrorLink( const Link& rLink )\n{\n    aErrorLink = rLink;\n}\n\nULONG StgIo::ValidateFATs()\n{\n    if( bFile )\n    {\n        Validator *pV = new Validator( *this );\n        BOOL bRet1 = !pV->IsError(), bRet2 = TRUE ;\n        delete pV;\n        SvFileStream *pFileStrm = ( SvFileStream *) GetStrm();\n        StgIo aIo;\n        if( aIo.Open( pFileStrm->GetFileName(),\n                      STREAM_READ  | STREAM_SHARE_DENYNONE) &&\n            aIo.Load() )\n        {\n            pV = new Validator( aIo );\n            bRet2 = !pV->IsError();\n            delete pV;\n        }\n\n        ULONG nErr;\n        if( bRet1 != bRet2 )\n            nErr = bRet1 ? FAT_ONFILEERROR : FAT_INMEMORYERROR;\n        else nErr = bRet1 ? FAT_OK : FAT_BOTHERROR;\n        if( nErr != FAT_OK && !bCopied )\n        {\n            StgLinkArg aArg;\n            aArg.aFile = pFileStrm->GetFileName();\n            aArg.nErr = nErr;\n            aErrorLink.Call( &aArg );\n            bCopied = TRUE;\n        }\n\/\/      DBG_ASSERT( nErr == FAT_OK ,\"Storage kaputt\");\n        return nErr;\n    }\n\/\/  DBG_ERROR(\"Validiere nicht (kein FileStorage)\");\n    return FAT_OK;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: appedit.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: gh $ $Date: 2002-04-11 08:38: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#ifndef _APPEDIT_HXX\n#define _APPEDIT_HXX\n\n#ifndef _SCRBAR_HXX \/\/autogen\n#include <vcl\/scrbar.hxx>\n#endif\n\n#include \"appwin.hxx\"\n#include \"textedit.hxx\"\n\nclass BasicFrame;\n\nclass AppEdit : public AppWin    {  \/\/ Editor-Window:\npublic:\n    ScrollBar *pVScroll;\n    ScrollBar *pHScroll;\n    void SetScrollBarRanges();\n    ULONG nCurTextWidth;\nprivate:\n    void InitScrollBars();\nprotected:\n    DECL_LINK( Scroll, ScrollBar* );\npublic:\n    TYPEINFO();\n    AppEdit( BasicFrame* );\n    ~AppEdit();\n    USHORT GetLineNr();             \/\/ Aktuelle Zeilennummer\n    FileType GetFileType();         \/\/ Liefert den Filetype\n    virtual long InitMenu( Menu* );         \/\/ Initialisierung des Menues\n    virtual long DeInitMenu( Menu* );   \/\/ rcksetzen, so da wieder alle Shortcuts enabled sind\n    virtual void Command( const CommandEvent& rCEvt );  \/\/ Kommando-Handler\n    void Resize();\n    void PostLoad();                \/\/ Nachbearbeiten des geladenen (Source am Modul setzen)\n    void PostSaveAs();              \/\/ Nachbearbeiten des Modils ...\n    void Mark( short, short, short );\/\/ Text markieren\n    void Highlight( USHORT nLine, USHORT nCol1, USHORT nCol2 );\n    virtual BOOL ReloadAllowed(){ return !StarBASIC::IsRunning(); }\n    virtual void LoadIniFile();     \/\/ (re)load ini file after change\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.336); FILE MERGED 2005\/09\/05 14:35:49 rt 1.3.336.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: appedit.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 21:11: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 _APPEDIT_HXX\n#define _APPEDIT_HXX\n\n#ifndef _SCRBAR_HXX \/\/autogen\n#include <vcl\/scrbar.hxx>\n#endif\n\n#include \"appwin.hxx\"\n#include \"textedit.hxx\"\n\nclass BasicFrame;\n\nclass AppEdit : public AppWin    {  \/\/ Editor-Window:\npublic:\n    ScrollBar *pVScroll;\n    ScrollBar *pHScroll;\n    void SetScrollBarRanges();\n    ULONG nCurTextWidth;\nprivate:\n    void InitScrollBars();\nprotected:\n    DECL_LINK( Scroll, ScrollBar* );\npublic:\n    TYPEINFO();\n    AppEdit( BasicFrame* );\n    ~AppEdit();\n    USHORT GetLineNr();             \/\/ Aktuelle Zeilennummer\n    FileType GetFileType();         \/\/ Liefert den Filetype\n    virtual long InitMenu( Menu* );         \/\/ Initialisierung des Menues\n    virtual long DeInitMenu( Menu* );   \/\/ rcksetzen, so da wieder alle Shortcuts enabled sind\n    virtual void Command( const CommandEvent& rCEvt );  \/\/ Kommando-Handler\n    void Resize();\n    void PostLoad();                \/\/ Nachbearbeiten des geladenen (Source am Modul setzen)\n    void PostSaveAs();              \/\/ Nachbearbeiten des Modils ...\n    void Mark( short, short, short );\/\/ Text markieren\n    void Highlight( USHORT nLine, USHORT nCol1, USHORT nCol2 );\n    virtual BOOL ReloadAllowed(){ return !StarBASIC::IsRunning(); }\n    virtual void LoadIniFile();     \/\/ (re)load ini file after change\n};\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 \"content\/browser\/renderer_host\/ime_adapter_android.h\"\n\n#include <android\/input.h>\n\n#include \"base\/android\/jni_android.h\"\n#include \"base\/android\/jni_string.h\"\n#include \"base\/android\/scoped_java_ref.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/time\/time.h\"\n#include \"content\/browser\/renderer_host\/render_widget_host_impl.h\"\n#include \"content\/browser\/renderer_host\/render_widget_host_view_android.h\"\n#include \"content\/common\/view_messages.h\"\n#include \"content\/public\/browser\/native_web_keyboard_event.h\"\n#include \"jni\/ImeAdapter_jni.h\"\n#include \"third_party\/WebKit\/public\/web\/WebCompositionUnderline.h\"\n#include \"third_party\/WebKit\/public\/web\/WebInputEvent.h\"\n\nusing base::android::AttachCurrentThread;\nusing base::android::ConvertJavaStringToUTF16;\n\nnamespace content {\nnamespace {\n\n\/\/ Maps a java KeyEvent into a NativeWebKeyboardEvent.\n\/\/ |java_key_event| is used to maintain a globalref for KeyEvent.\n\/\/ |action| will help determine the WebInputEvent type.\n\/\/ type, |modifiers|, |time_ms|, |key_code|, |unicode_char| is used to create\n\/\/ WebKeyboardEvent. |key_code| is also needed ad need to treat the enter key\n\/\/ as a key press of character \\r.\nNativeWebKeyboardEvent NativeWebKeyboardEventFromKeyEvent(\n    JNIEnv* env,\n    jobject java_key_event,\n    int action,\n    int modifiers,\n    long time_ms,\n    int key_code,\n    bool is_system_key,\n    int unicode_char) {\n  WebKit::WebInputEvent::Type type = WebKit::WebInputEvent::Undefined;\n  if (action == AKEY_EVENT_ACTION_DOWN)\n    type = WebKit::WebInputEvent::RawKeyDown;\n  else if (action == AKEY_EVENT_ACTION_UP)\n    type = WebKit::WebInputEvent::KeyUp;\n  return NativeWebKeyboardEvent(java_key_event, type, modifiers,\n      time_ms, key_code, unicode_char, is_system_key);\n}\n\n}  \/\/ anonymous namespace\n\nbool RegisterImeAdapter(JNIEnv* env) {\n  if (!RegisterNativesImpl(env))\n    return false;\n\n  Java_ImeAdapter_initializeWebInputEvents(env,\n                                           WebKit::WebInputEvent::RawKeyDown,\n                                           WebKit::WebInputEvent::KeyUp,\n                                           WebKit::WebInputEvent::Char,\n                                           WebKit::WebInputEvent::ShiftKey,\n                                           WebKit::WebInputEvent::AltKey,\n                                           WebKit::WebInputEvent::ControlKey,\n                                           WebKit::WebInputEvent::CapsLockOn,\n                                           WebKit::WebInputEvent::NumLockOn);\n  \/\/ TODO(miguelg): remove date time related enums after\n  \/\/ https:\/\/bugs.webkit.org\/show_bug.cgi?id=100935.\n  Java_ImeAdapter_initializeTextInputTypes(\n      env,\n      ui::TEXT_INPUT_TYPE_NONE,\n      ui::TEXT_INPUT_TYPE_TEXT,\n      ui::TEXT_INPUT_TYPE_TEXT_AREA,\n      ui::TEXT_INPUT_TYPE_PASSWORD,\n      ui::TEXT_INPUT_TYPE_SEARCH,\n      ui::TEXT_INPUT_TYPE_URL,\n      ui::TEXT_INPUT_TYPE_EMAIL,\n      ui::TEXT_INPUT_TYPE_TELEPHONE,\n      ui::TEXT_INPUT_TYPE_NUMBER,\n      ui::TEXT_INPUT_TYPE_DATE,\n      ui::TEXT_INPUT_TYPE_DATE_TIME,\n      ui::TEXT_INPUT_TYPE_DATE_TIME_LOCAL,\n      ui::TEXT_INPUT_TYPE_MONTH,\n      ui::TEXT_INPUT_TYPE_TIME,\n      ui::TEXT_INPUT_TYPE_WEEK,\n      ui::TEXT_INPUT_TYPE_CONTENT_EDITABLE);\n  return true;\n}\n\nImeAdapterAndroid::ImeAdapterAndroid(RenderWidgetHostViewAndroid* rwhva)\n    : rwhva_(rwhva) {\n}\n\nImeAdapterAndroid::~ImeAdapterAndroid() {\n  JNIEnv* env = AttachCurrentThread();\n  base::android::ScopedJavaLocalRef<jobject> obj = java_ime_adapter_.get(env);\n  if (!obj.is_null())\n    Java_ImeAdapter_detach(env, obj.obj());\n}\n\nbool ImeAdapterAndroid::SendSyntheticKeyEvent(JNIEnv*,\n                                              jobject,\n                                              int type,\n                                              long time_ms,\n                                              int key_code,\n                                              int text) {\n  NativeWebKeyboardEvent event(static_cast<WebKit::WebInputEvent::Type>(type),\n                               0 \/* modifiers *\/, time_ms \/ 1000.0, key_code,\n                               text, false \/* is_system_key *\/);\n  rwhva_->SendKeyEvent(event);\n  return true;\n}\n\nbool ImeAdapterAndroid::SendKeyEvent(JNIEnv* env, jobject,\n                                     jobject original_key_event,\n                                     int action, int modifiers,\n                                     long time_ms, int key_code,\n                                     bool is_system_key, int unicode_char) {\n  NativeWebKeyboardEvent event = NativeWebKeyboardEventFromKeyEvent(\n          env, original_key_event, action, modifiers,\n          time_ms, key_code, is_system_key, unicode_char);\n  bool key_down_text_insertion =\n      event.type == WebKit::WebInputEvent::RawKeyDown && event.text[0];\n  \/\/ If we are going to follow up with a synthetic Char event, then that's the\n  \/\/ one we expect to test if it's handled or unhandled, so skip handling the\n  \/\/ \"real\" event in the browser.\n  event.skip_in_browser = key_down_text_insertion;\n  rwhva_->SendKeyEvent(event);\n  if (key_down_text_insertion) {\n    \/\/ Send a Char event, but without an os_event since we don't want to\n    \/\/ roundtrip back to java such synthetic event.\n    NativeWebKeyboardEvent char_event(event);\n    char_event.os_event = NULL;\n    char_event.type = WebKit::WebInputEvent::Char;\n    rwhva_->SendKeyEvent(char_event);\n  }\n  return true;\n}\n\nvoid ImeAdapterAndroid::SetComposingText(JNIEnv* env, jobject, jstring text,\n                                         int new_cursor_pos) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  string16 text16 = ConvertJavaStringToUTF16(env, text);\n  std::vector<WebKit::WebCompositionUnderline> underlines;\n  underlines.push_back(\n      WebKit::WebCompositionUnderline(0, text16.length(), SK_ColorBLACK,\n                                      false));\n  \/\/ new_cursor_position is as described in the Android API for\n  \/\/ InputConnection#setComposingText, whereas the parameters for\n  \/\/ ImeSetComposition are relative to the start of the composition.\n  if (new_cursor_pos > 0)\n    new_cursor_pos = text16.length() + new_cursor_pos - 1;\n\n  rwhi->ImeSetComposition(text16, underlines, new_cursor_pos, new_cursor_pos);\n}\n\nvoid ImeAdapterAndroid::ImeBatchStateChanged(JNIEnv* env,\n                                             jobject,\n                                             jboolean is_begin) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Send(new ViewMsg_ImeBatchStateChanged(rwhi->GetRoutingID(), is_begin));\n}\n\nvoid ImeAdapterAndroid::CommitText(JNIEnv* env, jobject, jstring text) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  string16 text16 = ConvertJavaStringToUTF16(env, text);\n  rwhi->ImeConfirmComposition(text16, ui::Range::InvalidRange(), false);\n}\n\nvoid ImeAdapterAndroid::FinishComposingText(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->ImeConfirmComposition(string16(), ui::Range::InvalidRange(), true);\n}\n\nvoid ImeAdapterAndroid::AttachImeAdapter(JNIEnv* env, jobject java_object) {\n  java_ime_adapter_ = JavaObjectWeakGlobalRef(env, java_object);\n}\n\nvoid ImeAdapterAndroid::CancelComposition() {\n  base::android::ScopedJavaLocalRef<jobject> obj =\n      java_ime_adapter_.get(AttachCurrentThread());\n  if (!obj.is_null())\n    Java_ImeAdapter_cancelComposition(AttachCurrentThread(), obj.obj());\n}\n\nvoid ImeAdapterAndroid::SetEditableSelectionOffsets(JNIEnv*, jobject,\n                                                    int start, int end) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Send(new ViewMsg_SetEditableSelectionOffsets(rwhi->GetRoutingID(),\n                                                     start, end));\n}\n\nvoid ImeAdapterAndroid::SetComposingRegion(JNIEnv*, jobject,\n                                           int start, int end) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  std::vector<WebKit::WebCompositionUnderline> underlines;\n  underlines.push_back(\n      WebKit::WebCompositionUnderline(0, end - start, SK_ColorBLACK, false));\n\n  rwhi->Send(new ViewMsg_SetCompositionFromExistingText(\n      rwhi->GetRoutingID(), start, end, underlines));\n}\n\nvoid ImeAdapterAndroid::DeleteSurroundingText(JNIEnv*, jobject,\n                                              int before, int after) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Send(new ViewMsg_ExtendSelectionAndDelete(rwhi->GetRoutingID(),\n                                                  before, after));\n}\n\nvoid ImeAdapterAndroid::Unselect(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Unselect();\n}\n\nvoid ImeAdapterAndroid::SelectAll(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->SelectAll();\n}\n\nvoid ImeAdapterAndroid::Cut(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Cut();\n}\n\nvoid ImeAdapterAndroid::Copy(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Copy();\n}\n\nvoid ImeAdapterAndroid::Paste(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Paste();\n}\n\nvoid ImeAdapterAndroid::ResetImeAdapter(JNIEnv* env, jobject) {\n  java_ime_adapter_.reset();\n}\n\n}  \/\/ namespace content\n<commit_msg>Do not alter NativeWebKeybardEvent::os_event<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 \"content\/browser\/renderer_host\/ime_adapter_android.h\"\n\n#include <android\/input.h>\n\n#include \"base\/android\/jni_android.h\"\n#include \"base\/android\/jni_string.h\"\n#include \"base\/android\/scoped_java_ref.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/time\/time.h\"\n#include \"content\/browser\/renderer_host\/render_widget_host_impl.h\"\n#include \"content\/browser\/renderer_host\/render_widget_host_view_android.h\"\n#include \"content\/common\/view_messages.h\"\n#include \"content\/public\/browser\/native_web_keyboard_event.h\"\n#include \"jni\/ImeAdapter_jni.h\"\n#include \"third_party\/WebKit\/public\/web\/WebCompositionUnderline.h\"\n#include \"third_party\/WebKit\/public\/web\/WebInputEvent.h\"\n\nusing base::android::AttachCurrentThread;\nusing base::android::ConvertJavaStringToUTF16;\n\nnamespace content {\nnamespace {\n\n\/\/ Maps a java KeyEvent into a NativeWebKeyboardEvent.\n\/\/ |java_key_event| is used to maintain a globalref for KeyEvent.\n\/\/ |action| will help determine the WebInputEvent type.\n\/\/ type, |modifiers|, |time_ms|, |key_code|, |unicode_char| is used to create\n\/\/ WebKeyboardEvent. |key_code| is also needed ad need to treat the enter key\n\/\/ as a key press of character \\r.\nNativeWebKeyboardEvent NativeWebKeyboardEventFromKeyEvent(\n    JNIEnv* env,\n    jobject java_key_event,\n    int action,\n    int modifiers,\n    long time_ms,\n    int key_code,\n    bool is_system_key,\n    int unicode_char) {\n  WebKit::WebInputEvent::Type type = WebKit::WebInputEvent::Undefined;\n  if (action == AKEY_EVENT_ACTION_DOWN)\n    type = WebKit::WebInputEvent::RawKeyDown;\n  else if (action == AKEY_EVENT_ACTION_UP)\n    type = WebKit::WebInputEvent::KeyUp;\n  return NativeWebKeyboardEvent(java_key_event, type, modifiers,\n      time_ms, key_code, unicode_char, is_system_key);\n}\n\n}  \/\/ anonymous namespace\n\nbool RegisterImeAdapter(JNIEnv* env) {\n  if (!RegisterNativesImpl(env))\n    return false;\n\n  Java_ImeAdapter_initializeWebInputEvents(env,\n                                           WebKit::WebInputEvent::RawKeyDown,\n                                           WebKit::WebInputEvent::KeyUp,\n                                           WebKit::WebInputEvent::Char,\n                                           WebKit::WebInputEvent::ShiftKey,\n                                           WebKit::WebInputEvent::AltKey,\n                                           WebKit::WebInputEvent::ControlKey,\n                                           WebKit::WebInputEvent::CapsLockOn,\n                                           WebKit::WebInputEvent::NumLockOn);\n  \/\/ TODO(miguelg): remove date time related enums after\n  \/\/ https:\/\/bugs.webkit.org\/show_bug.cgi?id=100935.\n  Java_ImeAdapter_initializeTextInputTypes(\n      env,\n      ui::TEXT_INPUT_TYPE_NONE,\n      ui::TEXT_INPUT_TYPE_TEXT,\n      ui::TEXT_INPUT_TYPE_TEXT_AREA,\n      ui::TEXT_INPUT_TYPE_PASSWORD,\n      ui::TEXT_INPUT_TYPE_SEARCH,\n      ui::TEXT_INPUT_TYPE_URL,\n      ui::TEXT_INPUT_TYPE_EMAIL,\n      ui::TEXT_INPUT_TYPE_TELEPHONE,\n      ui::TEXT_INPUT_TYPE_NUMBER,\n      ui::TEXT_INPUT_TYPE_DATE,\n      ui::TEXT_INPUT_TYPE_DATE_TIME,\n      ui::TEXT_INPUT_TYPE_DATE_TIME_LOCAL,\n      ui::TEXT_INPUT_TYPE_MONTH,\n      ui::TEXT_INPUT_TYPE_TIME,\n      ui::TEXT_INPUT_TYPE_WEEK,\n      ui::TEXT_INPUT_TYPE_CONTENT_EDITABLE);\n  return true;\n}\n\nImeAdapterAndroid::ImeAdapterAndroid(RenderWidgetHostViewAndroid* rwhva)\n    : rwhva_(rwhva) {\n}\n\nImeAdapterAndroid::~ImeAdapterAndroid() {\n  JNIEnv* env = AttachCurrentThread();\n  base::android::ScopedJavaLocalRef<jobject> obj = java_ime_adapter_.get(env);\n  if (!obj.is_null())\n    Java_ImeAdapter_detach(env, obj.obj());\n}\n\nbool ImeAdapterAndroid::SendSyntheticKeyEvent(JNIEnv*,\n                                              jobject,\n                                              int type,\n                                              long time_ms,\n                                              int key_code,\n                                              int text) {\n  NativeWebKeyboardEvent event(static_cast<WebKit::WebInputEvent::Type>(type),\n                               0 \/* modifiers *\/, time_ms \/ 1000.0, key_code,\n                               text, false \/* is_system_key *\/);\n  rwhva_->SendKeyEvent(event);\n  return true;\n}\n\nbool ImeAdapterAndroid::SendKeyEvent(JNIEnv* env, jobject,\n                                     jobject original_key_event,\n                                     int action, int modifiers,\n                                     long time_ms, int key_code,\n                                     bool is_system_key, int unicode_char) {\n  NativeWebKeyboardEvent event = NativeWebKeyboardEventFromKeyEvent(\n          env, original_key_event, action, modifiers,\n          time_ms, key_code, is_system_key, unicode_char);\n  bool key_down_text_insertion =\n      event.type == WebKit::WebInputEvent::RawKeyDown && event.text[0];\n  \/\/ If we are going to follow up with a synthetic Char event, then that's the\n  \/\/ one we expect to test if it's handled or unhandled, so skip handling the\n  \/\/ \"real\" event in the browser.\n  event.skip_in_browser = key_down_text_insertion;\n  rwhva_->SendKeyEvent(event);\n  if (key_down_text_insertion) {\n    \/\/ Send a Char event, but without an os_event since we don't want to\n    \/\/ roundtrip back to java such synthetic event.\n    NativeWebKeyboardEvent char_event(WebKit::WebInputEvent::Char, modifiers,\n                                      time_ms, key_code, unicode_char,\n                                      is_system_key);\n    char_event.skip_in_browser = key_down_text_insertion;\n    rwhva_->SendKeyEvent(char_event);\n  }\n  return true;\n}\n\nvoid ImeAdapterAndroid::SetComposingText(JNIEnv* env, jobject, jstring text,\n                                         int new_cursor_pos) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  string16 text16 = ConvertJavaStringToUTF16(env, text);\n  std::vector<WebKit::WebCompositionUnderline> underlines;\n  underlines.push_back(\n      WebKit::WebCompositionUnderline(0, text16.length(), SK_ColorBLACK,\n                                      false));\n  \/\/ new_cursor_position is as described in the Android API for\n  \/\/ InputConnection#setComposingText, whereas the parameters for\n  \/\/ ImeSetComposition are relative to the start of the composition.\n  if (new_cursor_pos > 0)\n    new_cursor_pos = text16.length() + new_cursor_pos - 1;\n\n  rwhi->ImeSetComposition(text16, underlines, new_cursor_pos, new_cursor_pos);\n}\n\nvoid ImeAdapterAndroid::ImeBatchStateChanged(JNIEnv* env,\n                                             jobject,\n                                             jboolean is_begin) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Send(new ViewMsg_ImeBatchStateChanged(rwhi->GetRoutingID(), is_begin));\n}\n\nvoid ImeAdapterAndroid::CommitText(JNIEnv* env, jobject, jstring text) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  string16 text16 = ConvertJavaStringToUTF16(env, text);\n  rwhi->ImeConfirmComposition(text16, ui::Range::InvalidRange(), false);\n}\n\nvoid ImeAdapterAndroid::FinishComposingText(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->ImeConfirmComposition(string16(), ui::Range::InvalidRange(), true);\n}\n\nvoid ImeAdapterAndroid::AttachImeAdapter(JNIEnv* env, jobject java_object) {\n  java_ime_adapter_ = JavaObjectWeakGlobalRef(env, java_object);\n}\n\nvoid ImeAdapterAndroid::CancelComposition() {\n  base::android::ScopedJavaLocalRef<jobject> obj =\n      java_ime_adapter_.get(AttachCurrentThread());\n  if (!obj.is_null())\n    Java_ImeAdapter_cancelComposition(AttachCurrentThread(), obj.obj());\n}\n\nvoid ImeAdapterAndroid::SetEditableSelectionOffsets(JNIEnv*, jobject,\n                                                    int start, int end) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Send(new ViewMsg_SetEditableSelectionOffsets(rwhi->GetRoutingID(),\n                                                     start, end));\n}\n\nvoid ImeAdapterAndroid::SetComposingRegion(JNIEnv*, jobject,\n                                           int start, int end) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  std::vector<WebKit::WebCompositionUnderline> underlines;\n  underlines.push_back(\n      WebKit::WebCompositionUnderline(0, end - start, SK_ColorBLACK, false));\n\n  rwhi->Send(new ViewMsg_SetCompositionFromExistingText(\n      rwhi->GetRoutingID(), start, end, underlines));\n}\n\nvoid ImeAdapterAndroid::DeleteSurroundingText(JNIEnv*, jobject,\n                                              int before, int after) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Send(new ViewMsg_ExtendSelectionAndDelete(rwhi->GetRoutingID(),\n                                                  before, after));\n}\n\nvoid ImeAdapterAndroid::Unselect(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Unselect();\n}\n\nvoid ImeAdapterAndroid::SelectAll(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->SelectAll();\n}\n\nvoid ImeAdapterAndroid::Cut(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Cut();\n}\n\nvoid ImeAdapterAndroid::Copy(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Copy();\n}\n\nvoid ImeAdapterAndroid::Paste(JNIEnv* env, jobject) {\n  RenderWidgetHostImpl* rwhi = RenderWidgetHostImpl::From(\n      rwhva_->GetRenderWidgetHost());\n  if (!rwhi)\n    return;\n\n  rwhi->Paste();\n}\n\nvoid ImeAdapterAndroid::ResetImeAdapter(JNIEnv* env, jobject) {\n  java_ime_adapter_.reset();\n}\n\n}  \/\/ namespace content\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 \"content\/common\/indexed_db\/proxy_webidbcursor_impl.h\"\n\n#include \"content\/common\/child_thread.h\"\n#include \"content\/common\/indexed_db\/indexed_db_messages.h\"\n#include \"content\/common\/indexed_db\/indexed_db_dispatcher.h\"\n\nusing WebKit::WebExceptionCode;\nusing WebKit::WebIDBCallbacks;\nusing WebKit::WebIDBKey;\nusing WebKit::WebSerializedScriptValue;\n\nRendererWebIDBCursorImpl::RendererWebIDBCursorImpl(int32 idb_cursor_id)\n    : idb_cursor_id_(idb_cursor_id),\n      continue_count_(0),\n      used_prefetches_(0),\n      pending_onsuccess_callbacks_(0),\n      prefetch_amount_(kMinPrefetchAmount) {\n}\n\nRendererWebIDBCursorImpl::~RendererWebIDBCursorImpl() {\n  \/\/ It's not possible for there to be pending callbacks that address this\n  \/\/ object since inside WebKit, they hold a reference to the object wich owns\n  \/\/ this object. But, if that ever changed, then we'd need to invalidate\n  \/\/ any such pointers.\n  IndexedDBDispatcher::Send(new IndexedDBHostMsg_CursorDestroyed(\n      idb_cursor_id_));\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  dispatcher->CursorDestroyed(idb_cursor_id_);\n}\n\nunsigned short RendererWebIDBCursorImpl::direction() const {\n  int direction;\n  IndexedDBDispatcher::Send(\n      new IndexedDBHostMsg_CursorDirection(idb_cursor_id_, &direction));\n  return direction;\n}\n\nWebIDBKey RendererWebIDBCursorImpl::key() const {\n  return key_;\n}\n\nWebIDBKey RendererWebIDBCursorImpl::primaryKey() const {\n  return primary_key_;\n}\n\nWebSerializedScriptValue RendererWebIDBCursorImpl::value() const {\n  return value_;\n}\n\nvoid RendererWebIDBCursorImpl::update(const WebSerializedScriptValue& value,\n                                      WebIDBCallbacks* callbacks,\n                                      WebExceptionCode& ec) {\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  dispatcher->RequestIDBCursorUpdate(\n      content::SerializedScriptValue(value), callbacks, idb_cursor_id_, &ec);\n}\n\nvoid RendererWebIDBCursorImpl::continueFunction(const WebIDBKey& key,\n                                                WebIDBCallbacks* callbacks,\n                                                WebExceptionCode& ec) {\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n\n  if (key.type() == WebIDBKey::InvalidType) {\n    \/\/ No key, so this would qualify for a prefetch.\n    ++continue_count_;\n\n    if (!prefetch_keys_.empty()) {\n      \/\/ We have a prefetch cache, so serve the result from that.\n      CachedContinue(callbacks);\n      return;\n    }\n\n    if (continue_count_ > kPrefetchContinueThreshold) {\n      \/\/ Request pre-fetch.\n      dispatcher->RequestIDBCursorPrefetch(prefetch_amount_, callbacks,\n                                           idb_cursor_id_, &ec);\n\n      \/\/ Increase prefetch_amount_ exponentially.\n      prefetch_amount_ *= 2;\n      if (prefetch_amount_ > kMaxPrefetchAmount)\n        prefetch_amount_ = kMaxPrefetchAmount;\n\n      return;\n    }\n  } else {\n    \/\/ Key argument supplied. We couldn't prefetch this.\n    ResetPrefetchCache();\n  }\n\n  dispatcher->RequestIDBCursorContinue(IndexedDBKey(key), callbacks,\n                                       idb_cursor_id_, &ec);\n}\n\nvoid RendererWebIDBCursorImpl::deleteFunction(WebIDBCallbacks* callbacks,\n                                              WebExceptionCode& ec) {\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  dispatcher->RequestIDBCursorDelete(callbacks, idb_cursor_id_, &ec);\n}\n\nvoid RendererWebIDBCursorImpl::postSuccessHandlerCallback()\n{\n  pending_onsuccess_callbacks_--;\n\n  \/\/ If the onsuccess callback called continue() on the cursor again,\n  \/\/ and that continue was served by the prefetch cache, then\n  \/\/ pending_onsuccess_callbacks_ would be incremented.\n  \/\/ If not, it means the callback did something else, or nothing at all,\n  \/\/ in which case we need to reset the cache.\n\n  if (pending_onsuccess_callbacks_ == 0)\n    ResetPrefetchCache();\n}\n\nvoid RendererWebIDBCursorImpl::SetKeyAndValue(\n    const IndexedDBKey& key,\n    const IndexedDBKey& primary_key,\n    const content::SerializedScriptValue& value) {\n  key_ = key;\n  primary_key_ = primary_key;\n  value_ = value;\n}\n\nvoid RendererWebIDBCursorImpl::SetPrefetchData(\n    const std::vector<IndexedDBKey>& keys,\n    const std::vector<IndexedDBKey>& primary_keys,\n    const std::vector<content::SerializedScriptValue>& values) {\n  prefetch_keys_.assign(keys.begin(), keys.end());\n  prefetch_primary_keys_.assign(primary_keys.begin(), primary_keys.end());\n  prefetch_values_.assign(values.begin(), values.end());\n\n  used_prefetches_ = 0;\n  pending_onsuccess_callbacks_ = 0;\n}\n\nvoid RendererWebIDBCursorImpl::CachedContinue(\n    WebKit::WebIDBCallbacks* callbacks) {\n  DCHECK(prefetch_keys_.size() > 0);\n  DCHECK(prefetch_primary_keys_.size() == prefetch_keys_.size());\n  DCHECK(prefetch_values_.size() == prefetch_keys_.size());\n\n  key_ = prefetch_keys_.front();\n  primary_key_ = prefetch_primary_keys_.front();\n  value_ = prefetch_values_.front();\n\n  prefetch_keys_.pop_front();\n  prefetch_primary_keys_.pop_front();\n  prefetch_values_.pop_front();\n  used_prefetches_++;\n\n  pending_onsuccess_callbacks_++;\n  callbacks->onSuccessWithContinuation();\n}\n\nvoid RendererWebIDBCursorImpl::ResetPrefetchCache() {\n  continue_count_ = 0;\n  prefetch_amount_ = kMinPrefetchAmount;\n\n  if (!prefetch_keys_.size()) {\n    \/\/ No prefetch cache, so no need to reset the cursor in the back-end.\n    return;\n  }\n\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  dispatcher->RequestIDBCursorPrefetchReset(used_prefetches_,\n                                            prefetch_keys_.size(),\n                                            idb_cursor_id_);\n  prefetch_keys_.clear();\n  prefetch_primary_keys_.clear();\n  prefetch_values_.clear();\n\n  pending_onsuccess_callbacks_ = 0;\n}\n<commit_msg>IndexedDB: Fix prefetching; cache was always being bypassed.<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 \"content\/common\/indexed_db\/proxy_webidbcursor_impl.h\"\n\n#include \"content\/common\/child_thread.h\"\n#include \"content\/common\/indexed_db\/indexed_db_messages.h\"\n#include \"content\/common\/indexed_db\/indexed_db_dispatcher.h\"\n\nusing WebKit::WebExceptionCode;\nusing WebKit::WebIDBCallbacks;\nusing WebKit::WebIDBKey;\nusing WebKit::WebSerializedScriptValue;\n\nRendererWebIDBCursorImpl::RendererWebIDBCursorImpl(int32 idb_cursor_id)\n    : idb_cursor_id_(idb_cursor_id),\n      continue_count_(0),\n      used_prefetches_(0),\n      pending_onsuccess_callbacks_(0),\n      prefetch_amount_(kMinPrefetchAmount) {\n}\n\nRendererWebIDBCursorImpl::~RendererWebIDBCursorImpl() {\n  \/\/ It's not possible for there to be pending callbacks that address this\n  \/\/ object since inside WebKit, they hold a reference to the object wich owns\n  \/\/ this object. But, if that ever changed, then we'd need to invalidate\n  \/\/ any such pointers.\n  IndexedDBDispatcher::Send(new IndexedDBHostMsg_CursorDestroyed(\n      idb_cursor_id_));\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  dispatcher->CursorDestroyed(idb_cursor_id_);\n}\n\nunsigned short RendererWebIDBCursorImpl::direction() const {\n  int direction;\n  IndexedDBDispatcher::Send(\n      new IndexedDBHostMsg_CursorDirection(idb_cursor_id_, &direction));\n  return direction;\n}\n\nWebIDBKey RendererWebIDBCursorImpl::key() const {\n  return key_;\n}\n\nWebIDBKey RendererWebIDBCursorImpl::primaryKey() const {\n  return primary_key_;\n}\n\nWebSerializedScriptValue RendererWebIDBCursorImpl::value() const {\n  return value_;\n}\n\nvoid RendererWebIDBCursorImpl::update(const WebSerializedScriptValue& value,\n                                      WebIDBCallbacks* callbacks,\n                                      WebExceptionCode& ec) {\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  dispatcher->RequestIDBCursorUpdate(\n      content::SerializedScriptValue(value), callbacks, idb_cursor_id_, &ec);\n}\n\nvoid RendererWebIDBCursorImpl::continueFunction(const WebIDBKey& key,\n                                                WebIDBCallbacks* callbacks_ptr,\n                                                WebExceptionCode& ec) {\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  scoped_ptr<WebIDBCallbacks> callbacks(callbacks_ptr);\n\n  if (key.type() == WebIDBKey::NullType) {\n    \/\/ No key, so this would qualify for a prefetch.\n    ++continue_count_;\n\n    if (!prefetch_keys_.empty()) {\n      \/\/ We have a prefetch cache, so serve the result from that.\n      CachedContinue(callbacks.get());\n      return;\n    }\n\n    if (continue_count_ > kPrefetchContinueThreshold) {\n      \/\/ Request pre-fetch.\n      dispatcher->RequestIDBCursorPrefetch(prefetch_amount_,\n                                           callbacks.release(),\n                                           idb_cursor_id_, &ec);\n\n      \/\/ Increase prefetch_amount_ exponentially.\n      prefetch_amount_ *= 2;\n      if (prefetch_amount_ > kMaxPrefetchAmount)\n        prefetch_amount_ = kMaxPrefetchAmount;\n\n      return;\n    }\n  } else {\n    \/\/ Key argument supplied. We couldn't prefetch this.\n    ResetPrefetchCache();\n  }\n\n  dispatcher->RequestIDBCursorContinue(IndexedDBKey(key), callbacks.release(),\n                                       idb_cursor_id_, &ec);\n}\n\nvoid RendererWebIDBCursorImpl::deleteFunction(WebIDBCallbacks* callbacks,\n                                              WebExceptionCode& ec) {\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  dispatcher->RequestIDBCursorDelete(callbacks, idb_cursor_id_, &ec);\n}\n\nvoid RendererWebIDBCursorImpl::postSuccessHandlerCallback()\n{\n  pending_onsuccess_callbacks_--;\n\n  \/\/ If the onsuccess callback called continue() on the cursor again,\n  \/\/ and that continue was served by the prefetch cache, then\n  \/\/ pending_onsuccess_callbacks_ would be incremented.\n  \/\/ If not, it means the callback did something else, or nothing at all,\n  \/\/ in which case we need to reset the cache.\n\n  if (pending_onsuccess_callbacks_ == 0)\n    ResetPrefetchCache();\n}\n\nvoid RendererWebIDBCursorImpl::SetKeyAndValue(\n    const IndexedDBKey& key,\n    const IndexedDBKey& primary_key,\n    const content::SerializedScriptValue& value) {\n  key_ = key;\n  primary_key_ = primary_key;\n  value_ = value;\n}\n\nvoid RendererWebIDBCursorImpl::SetPrefetchData(\n    const std::vector<IndexedDBKey>& keys,\n    const std::vector<IndexedDBKey>& primary_keys,\n    const std::vector<content::SerializedScriptValue>& values) {\n  prefetch_keys_.assign(keys.begin(), keys.end());\n  prefetch_primary_keys_.assign(primary_keys.begin(), primary_keys.end());\n  prefetch_values_.assign(values.begin(), values.end());\n\n  used_prefetches_ = 0;\n  pending_onsuccess_callbacks_ = 0;\n}\n\nvoid RendererWebIDBCursorImpl::CachedContinue(\n    WebKit::WebIDBCallbacks* callbacks) {\n  DCHECK(prefetch_keys_.size() > 0);\n  DCHECK(prefetch_primary_keys_.size() == prefetch_keys_.size());\n  DCHECK(prefetch_values_.size() == prefetch_keys_.size());\n\n  key_ = prefetch_keys_.front();\n  primary_key_ = prefetch_primary_keys_.front();\n  value_ = prefetch_values_.front();\n\n  prefetch_keys_.pop_front();\n  prefetch_primary_keys_.pop_front();\n  prefetch_values_.pop_front();\n  used_prefetches_++;\n\n  pending_onsuccess_callbacks_++;\n  callbacks->onSuccessWithContinuation();\n}\n\nvoid RendererWebIDBCursorImpl::ResetPrefetchCache() {\n  continue_count_ = 0;\n  prefetch_amount_ = kMinPrefetchAmount;\n\n  if (!prefetch_keys_.size()) {\n    \/\/ No prefetch cache, so no need to reset the cursor in the back-end.\n    return;\n  }\n\n  IndexedDBDispatcher* dispatcher =\n      IndexedDBDispatcher::ThreadSpecificInstance();\n  dispatcher->RequestIDBCursorPrefetchReset(used_prefetches_,\n                                            prefetch_keys_.size(),\n                                            idb_cursor_id_);\n  prefetch_keys_.clear();\n  prefetch_primary_keys_.clear();\n  prefetch_values_.clear();\n\n  pending_onsuccess_callbacks_ = 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"TextTestResult.h\"\n#include \"Exception.h\"\n#include \"estring.h\"\n#include \"Test.h\"\n\nusing namespace std;\nusing namespace CppUnit;\n\n\n\nstd::ostream& \nCppUnit::operator<< (std::ostream& stream, TextTestResult& result)\n{ \n  result.print (stream); return stream; \n}\n\nvoid \nTextTestResult::addError (Test *test, Exception *e)\n{\n    TestResult::addError (test, e);\n    cerr << \"E\\n\";\n\n}\n\nvoid \nTextTestResult::addFailure (Test *test, Exception *e)\n{\n    TestResult::addFailure (test, e);\n    cerr << \"F\\n\";\n\n}\n\nvoid \nTextTestResult::startTest (Test *test)\n{\n\n  cerr << \"Running \" << test->getName() << \" \";\n  TestResult::startTest (test);\n  cerr << \".\\n\";\n\n}\n\n\nvoid \nTextTestResult::printErrors (ostream& stream)\n{\n    if (testErrors () != 0) {\n\n        if (testErrors () == 1)\n            stream << \"There was \" << testErrors () << \" error: \" << endl;\n        else\n            stream << \"There were \" << testErrors () << \" errors: \" << endl;\n\n        int i = 1;\n\n        for (vector<TestFailure *>::iterator it = errors ().begin (); it != errors ().end (); ++it) {\n            TestFailure             *failure    = *it;\n            Exception        *e          = failure->thrownException ();\n\n            stream << i \n                   << \") \"\n                   << \"line: \" << (e ? estring (e->lineNumber ()) : \"\") << \" \"\n                   << (e ? e->fileName () : \"\") << \" \"\n                   << \"\\\"\" << failure->thrownException ()->what () << \"\\\"\"\n                   << endl;\n            i++;\n        }\n    }\n\n}\n\nvoid \nTextTestResult::printFailures (ostream& stream) \n{\n    if (testFailures () != 0) {\n        if (testFailures () == 1)\n            stream << \"There was \" << testFailures () << \" failure: \" << endl;\n        else\n            stream << \"There were \" << testFailures () << \" failures: \" << endl;\n\n        int i = 1;\n\n        for (vector<TestFailure *>::iterator it = failures ().begin (); it != failures ().end (); ++it) {\n            TestFailure             *failure    = *it;\n            Exception        *e          = failure->thrownException ();\n\n            stream << i \n                   << \") \"\n                   << \"line: \" << (e ? estring (e->lineNumber ()) : \"\") << \" \"\n                   << (e ? e->fileName () : \"\") << \" \"\n                   << \"\\\"\" << failure->thrownException ()->what () << \"\\\"\"\n                   << endl;\n            i++;\n        }\n    }\n\n}\n\n\nvoid \nTextTestResult::print (ostream& stream) \n{\n    printHeader (stream);\n    printErrors (stream);\n    printFailures (stream);\n\n}\n\n\nvoid \nTextTestResult::printHeader (ostream& stream)\n{\n    if (wasSuccessful ())\n        cout << endl << \"OK (\" << runTests () << \" tests)\" << endl;\n    else\n        cout << endl\n             << \"!!!FAILURES!!!\" << endl\n             << \"Test Results:\" << endl\n             << \"Run:  \"\n             << runTests ()\n             << \"   Failures: \"\n             << testFailures ()\n             << \"   Errors: \"\n             << testErrors ()\n             << endl;\n\n}\n<commit_msg>Fix bug #232636: TextTestResult::printHeader(ostream& stream) outputs to cout.<commit_after>#include \"TextTestResult.h\"\n#include \"Exception.h\"\n#include \"estring.h\"\n#include \"Test.h\"\n\nusing namespace std;\nusing namespace CppUnit;\n\n\n\nstd::ostream& \nCppUnit::operator<< (std::ostream& stream, TextTestResult& result)\n{ \n  result.print (stream); return stream; \n}\n\nvoid \nTextTestResult::addError (Test *test, Exception *e)\n{\n    TestResult::addError (test, e);\n    cerr << \"E\\n\";\n\n}\n\nvoid \nTextTestResult::addFailure (Test *test, Exception *e)\n{\n    TestResult::addFailure (test, e);\n    cerr << \"F\\n\";\n\n}\n\nvoid \nTextTestResult::startTest (Test *test)\n{\n\n  cerr << \"Running \" << test->getName() << \" \";\n  TestResult::startTest (test);\n  cerr << \".\\n\";\n\n}\n\n\nvoid \nTextTestResult::printErrors (ostream& stream)\n{\n    if (testErrors () != 0) {\n\n        if (testErrors () == 1)\n            stream << \"There was \" << testErrors () << \" error: \" << endl;\n        else\n            stream << \"There were \" << testErrors () << \" errors: \" << endl;\n\n        int i = 1;\n\n        for (vector<TestFailure *>::iterator it = errors ().begin (); it != errors ().end (); ++it) {\n            TestFailure             *failure    = *it;\n            Exception        *e          = failure->thrownException ();\n\n            stream << i \n                   << \") \"\n                   << \"line: \" << (e ? estring (e->lineNumber ()) : \"\") << \" \"\n                   << (e ? e->fileName () : \"\") << \" \"\n                   << \"\\\"\" << failure->thrownException ()->what () << \"\\\"\"\n                   << endl;\n            i++;\n        }\n    }\n\n}\n\nvoid \nTextTestResult::printFailures (ostream& stream) \n{\n    if (testFailures () != 0) {\n        if (testFailures () == 1)\n            stream << \"There was \" << testFailures () << \" failure: \" << endl;\n        else\n            stream << \"There were \" << testFailures () << \" failures: \" << endl;\n\n        int i = 1;\n\n        for (vector<TestFailure *>::iterator it = failures ().begin (); it != failures ().end (); ++it) {\n            TestFailure             *failure    = *it;\n            Exception        *e          = failure->thrownException ();\n\n            stream << i \n                   << \") \"\n                   << \"line: \" << (e ? estring (e->lineNumber ()) : \"\") << \" \"\n                   << (e ? e->fileName () : \"\") << \" \"\n                   << \"\\\"\" << failure->thrownException ()->what () << \"\\\"\"\n                   << endl;\n            i++;\n        }\n    }\n\n}\n\n\nvoid \nTextTestResult::print (ostream& stream) \n{\n    printHeader (stream);\n    printErrors (stream);\n    printFailures (stream);\n\n}\n\n\nvoid \nTextTestResult::printHeader (ostream& stream)\n{\n    if (wasSuccessful ())\n        stream << endl << \"OK (\" << runTests () << \" tests)\" << endl;\n    else\n        stream << endl\n             << \"!!!FAILURES!!!\" << endl\n             << \"Test Results:\" << endl\n             << \"Run:  \"\n             << runTests ()\n             << \"   Failures: \"\n             << testFailures ()\n             << \"   Errors: \"\n             << testErrors ()\n             << endl;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n\/\/#include <iomanip>\n#include <vector>\n#include \"itkSTAPLEImageFilter.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n\nclass StaplerBase\n{\npublic:\n  StaplerBase()  {}\n  virtual ~StaplerBase() {}\n\n  void SetOutputFileName( const char *s )\n  { m_OutputFile = s; }\n\n  const std::string &GetOutputFileName() const\n  { return m_OutputFile; }\n  \n  void AddFileName( const char *s )\n  {\n    std::string tmp(s);\n    m_Files.push_back(tmp);\n  }\n  \n  const std::string &GetFileName( unsigned int i ) const\n  { return m_Files[i]; }\n  \n  void ClearFileNames()\n  { m_Files.clear(); }\n\n  unsigned int GetNumberOfFiles() const\n  { return m_Files.size(); }\n  \n  virtual double GetSensitivity( unsigned int ) = 0;\n  virtual double GetSpecificity( unsigned int ) = 0;\n  virtual unsigned short GetForeground() const  = 0;\n  virtual void SetForeground( unsigned short )  = 0;  \n  virtual void SetConfidenceWeight( double ) = 0;\n  virtual double GetConfidenceWeight() const = 0;\n\n\n  virtual int Execute() = 0;\n  virtual unsigned int GetElapsedIterations() = 0;\n\nprotected:\n  std::vector< std::string > m_Files;\n  std::string m_OutputFile;\n};\n\ntemplate< unsigned int VDimension>\nclass Stapler : public StaplerBase\n{\npublic:\n  typedef itk::Image< double, VDimension > OutputImageType;\n  typedef itk::Image< unsigned short, VDimension > InputImageType;\n  typedef itk::STAPLEImageFilter<InputImageType, OutputImageType> StapleFilterType;\n\n  Stapler()\n  {\n    m_Stapler = StapleFilterType::New();\n    this->SetForeground(1);\n  }\n  virtual ~Stapler() {}\n\n  virtual double GetConfidenceWeight( ) const\n  { return m_Stapler->GetConfidenceWeight(); }\n  virtual void SetConfidenceWeight( double w )\n  { m_Stapler->SetConfidenceWeight( w); }\n  \n  virtual double GetSensitivity( unsigned int i )\n  { return m_Stapler->GetSensitivity(i); }\n  virtual double GetSpecificity( unsigned int i )\n  { return m_Stapler->GetSpecificity(i); }\n\n  virtual unsigned short GetForeground() const\n  { return m_Stapler->GetForegroundValue(); }\n  virtual void SetForeground( unsigned short l )\n  { m_Stapler->SetForegroundValue( l ); }\n\n  virtual unsigned int GetElapsedIterations()\n  { return m_Stapler->GetElapsedIterations(); }\n  \n  virtual int Execute();\n\nprivate:\n  typename StapleFilterType::Pointer m_Stapler;\n};\n\n\ntemplate< unsigned int VDimension >\nint Stapler<VDimension>::Execute()\n{\n  int i;\n\n  typename itk::ImageFileReader<InputImageType>::Pointer  reader;\n  typename itk::ImageFileWriter<OutputImageType>::Pointer writer\n    = itk::ImageFileWriter<OutputImageType>::New();\n\n  int number_of_files = m_Files.size();\n  \n  \/\/ Set the inputs\n  for (i = 0; i < number_of_files; i++)\n    {\n    try\n      {\n      reader = itk::ImageFileReader<InputImageType>::New();\n      reader->SetFileName( m_Files[i].c_str() );\n      reader->Update();\n      m_Stapler->SetInput(i, reader->GetOutput());\n      }\n    catch (itk::ExceptionObject &e)\n      {\n      std::cerr << e << std::endl;\n      return -1;\n      }\n    }\n  \n  try\n    {\n    writer->SetFileName( m_OutputFile.c_str() );\n    writer->SetInput(m_Stapler->GetOutput());\n    writer->Update();\n    }\n  catch( itk::ExceptionObject &e )\n    {\n    std::cerr << e << std::endl;\n    return -2;\n    }\n  \n  return 0;\n}\n\n\nint itkSTAPLEImageFilterTest( int argc, char * argv[])\n{\n  unsigned int i;\n  StaplerBase *stapler;\n\n  if (argc < 5)\n    {\n    std::cerr << \"Use: \" << argv[0] << \" file_dimensionality output.mhd foreground_value confidence_weight file1 file2 ... fileN\" << std::endl;\n    return -1;\n    }\n\n  if ( ::atoi(argv[1]) == 2 )\n    {\n    stapler = new Stapler<2>;\n    }\n  else if ( ::atoi(argv[1]) == 3 )\n    {\n    stapler = new Stapler<3>;\n    }\n  else\n    {\n    std::cerr << \"Only 2D and 3D data is currently supported\" << std::endl;\n    return -2;\n    }\n\n  for (i = 0; i < argc - 5; i++)\n    {\n    stapler->AddFileName( argv[i+5] );\n    }\n\n  stapler->SetConfidenceWeight( static_cast<double>( atof(argv[4]) ));\n  stapler->SetOutputFileName( argv[2] );\n  stapler->SetForeground( static_cast<unsigned short>( atoi(argv[3])) );\n\n  \/\/ Execute the stapler\n  int ret = stapler->Execute();\n  if ( ret != 0 )\n    {\n    std::cerr << \"Stapler failed!  Returned error code \" << ret << \".\" << std::endl;\n    return -3;\n    }\n\n  double avg_p = 0.0;\n  double avg_q = 0.0;\n  \/\/ Print out the specificities\n  std::cout << \"Number of elapsed iterations = \"\n            << stapler->GetElapsedIterations() << std::endl;\n\n  \/\/  std::cout.precision(5);\n  \/\/  std::cout.setf(ios::fixed, ios::floatfield);\n\n  std::cout << \"File \" << \"\\t\\tSensitivity(p) \" <<  \"\\tSpecificity(q)\" << std::endl;\n  std::cout << \"-----\" << \"\\t\\t-------------- \" <<  \"\\t--------------\" << std::endl;\n  for (i = 0; i < stapler->GetNumberOfFiles(); i++)\n    {\n    avg_q += stapler->GetSpecificity(i);\n    avg_p += stapler->GetSensitivity(i);\n    std::cout << i << \": \" << stapler->GetFileName(i) << \"\\t\" << stapler->GetSensitivity(i) << \"\\t\\t\"\n              << stapler->GetSpecificity(i) << std::endl;\n    }\n  avg_p \/= static_cast<double>( stapler->GetNumberOfFiles() );\n  avg_q \/= static_cast<double>( stapler->GetNumberOfFiles() );\n\n  std::cout << \"Mean:\\t\\t\" << avg_p << \"\\t\\t\" << avg_q << std::endl;\n  \n  delete stapler;\n  \n  return 0;\n}\n\n<commit_msg>ERR: change meta output from double to float since meta is currently broken for byte swapping double.<commit_after>#include <iostream>\n#include <string>\n\/\/#include <iomanip>\n#include <vector>\n#include \"itkSTAPLEImageFilter.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n\nclass StaplerBase\n{\npublic:\n  StaplerBase()  {}\n  virtual ~StaplerBase() {}\n\n  void SetOutputFileName( const char *s )\n  { m_OutputFile = s; }\n\n  const std::string &GetOutputFileName() const\n  { return m_OutputFile; }\n  \n  void AddFileName( const char *s )\n  {\n    std::string tmp(s);\n    m_Files.push_back(tmp);\n  }\n  \n  const std::string &GetFileName( unsigned int i ) const\n  { return m_Files[i]; }\n  \n  void ClearFileNames()\n  { m_Files.clear(); }\n\n  unsigned int GetNumberOfFiles() const\n  { return m_Files.size(); }\n  \n  virtual double GetSensitivity( unsigned int ) = 0;\n  virtual double GetSpecificity( unsigned int ) = 0;\n  virtual unsigned short GetForeground() const  = 0;\n  virtual void SetForeground( unsigned short )  = 0;  \n  virtual void SetConfidenceWeight( double ) = 0;\n  virtual double GetConfidenceWeight() const = 0;\n\n\n  virtual int Execute() = 0;\n  virtual unsigned int GetElapsedIterations() = 0;\n\nprotected:\n  std::vector< std::string > m_Files;\n  std::string m_OutputFile;\n};\n\ntemplate< unsigned int VDimension>\nclass Stapler : public StaplerBase\n{\npublic:\n  typedef itk::Image< float, VDimension > OutputImageType;\n  typedef itk::Image< unsigned short, VDimension > InputImageType;\n  typedef itk::STAPLEImageFilter<InputImageType, OutputImageType> StapleFilterType;\n\n  Stapler()\n  {\n    m_Stapler = StapleFilterType::New();\n    this->SetForeground(1);\n  }\n  virtual ~Stapler() {}\n\n  virtual double GetConfidenceWeight( ) const\n  { return m_Stapler->GetConfidenceWeight(); }\n  virtual void SetConfidenceWeight( double w )\n  { m_Stapler->SetConfidenceWeight( w); }\n  \n  virtual double GetSensitivity( unsigned int i )\n  { return m_Stapler->GetSensitivity(i); }\n  virtual double GetSpecificity( unsigned int i )\n  { return m_Stapler->GetSpecificity(i); }\n\n  virtual unsigned short GetForeground() const\n  { return m_Stapler->GetForegroundValue(); }\n  virtual void SetForeground( unsigned short l )\n  { m_Stapler->SetForegroundValue( l ); }\n\n  virtual unsigned int GetElapsedIterations()\n  { return m_Stapler->GetElapsedIterations(); }\n  \n  virtual int Execute();\n\nprivate:\n  typename StapleFilterType::Pointer m_Stapler;\n};\n\n\ntemplate< unsigned int VDimension >\nint Stapler<VDimension>::Execute()\n{\n  int i;\n\n  typename itk::ImageFileReader<InputImageType>::Pointer  reader;\n  typename itk::ImageFileWriter<OutputImageType>::Pointer writer\n    = itk::ImageFileWriter<OutputImageType>::New();\n\n  int number_of_files = m_Files.size();\n  \n  \/\/ Set the inputs\n  for (i = 0; i < number_of_files; i++)\n    {\n    try\n      {\n      reader = itk::ImageFileReader<InputImageType>::New();\n      reader->SetFileName( m_Files[i].c_str() );\n      reader->Update();\n      m_Stapler->SetInput(i, reader->GetOutput());\n      }\n    catch (itk::ExceptionObject &e)\n      {\n      std::cerr << e << std::endl;\n      return -1;\n      }\n    }\n  \n  try\n    {\n    writer->SetFileName( m_OutputFile.c_str() );\n    writer->SetInput(m_Stapler->GetOutput());\n    writer->Update();\n    }\n  catch( itk::ExceptionObject &e )\n    {\n    std::cerr << e << std::endl;\n    return -2;\n    }\n  \n  return 0;\n}\n\n\nint itkSTAPLEImageFilterTest( int argc, char * argv[])\n{\n  unsigned int i;\n  StaplerBase *stapler;\n\n  if (argc < 5)\n    {\n    std::cerr << \"Use: \" << argv[0] << \" file_dimensionality output.mhd foreground_value confidence_weight file1 file2 ... fileN\" << std::endl;\n    return -1;\n    }\n\n  if ( ::atoi(argv[1]) == 2 )\n    {\n    stapler = new Stapler<2>;\n    }\n  else if ( ::atoi(argv[1]) == 3 )\n    {\n    stapler = new Stapler<3>;\n    }\n  else\n    {\n    std::cerr << \"Only 2D and 3D data is currently supported\" << std::endl;\n    return -2;\n    }\n\n  for (i = 0; i < argc - 5; i++)\n    {\n    stapler->AddFileName( argv[i+5] );\n    }\n\n  stapler->SetConfidenceWeight( static_cast<double>( atof(argv[4]) ));\n  stapler->SetOutputFileName( argv[2] );\n  stapler->SetForeground( static_cast<unsigned short>( atoi(argv[3])) );\n\n  \/\/ Execute the stapler\n  int ret = stapler->Execute();\n  if ( ret != 0 )\n    {\n    std::cerr << \"Stapler failed!  Returned error code \" << ret << \".\" << std::endl;\n    return -3;\n    }\n\n  double avg_p = 0.0;\n  double avg_q = 0.0;\n  \/\/ Print out the specificities\n  std::cout << \"Number of elapsed iterations = \"\n            << stapler->GetElapsedIterations() << std::endl;\n\n  \/\/  std::cout.precision(5);\n  \/\/  std::cout.setf(ios::fixed, ios::floatfield);\n\n  std::cout << \"File \" << \"\\t\\tSensitivity(p) \" <<  \"\\tSpecificity(q)\" << std::endl;\n  std::cout << \"-----\" << \"\\t\\t-------------- \" <<  \"\\t--------------\" << std::endl;\n  for (i = 0; i < stapler->GetNumberOfFiles(); i++)\n    {\n    avg_q += stapler->GetSpecificity(i);\n    avg_p += stapler->GetSensitivity(i);\n    std::cout << i << \": \" << stapler->GetFileName(i) << \"\\t\" << stapler->GetSensitivity(i) << \"\\t\\t\"\n              << stapler->GetSpecificity(i) << std::endl;\n    }\n  avg_p \/= static_cast<double>( stapler->GetNumberOfFiles() );\n  avg_q \/= static_cast<double>( stapler->GetNumberOfFiles() );\n\n  std::cout << \"Mean:\\t\\t\" << avg_p << \"\\t\\t\" << avg_q << std::endl;\n  \n  delete stapler;\n  \n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- SIAnnotateControlFlow.cpp ------------------------------------------===\/\/\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\/\/\/ \\file\n\/\/\/ Annotates the control flow with hardware specific intrinsics.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"AMDGPU.h\"\n#include \"llvm\/ADT\/DepthFirstIterator.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Analysis\/LegacyDivergenceAnalysis.h\"\n#include \"llvm\/Analysis\/LoopInfo.h\"\n#include \"llvm\/Transforms\/Utils\/Local.h\"\n#include \"llvm\/IR\/BasicBlock.h\"\n#include \"llvm\/IR\/CFG.h\"\n#include \"llvm\/IR\/Constant.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/DerivedTypes.h\"\n#include \"llvm\/IR\/Dominators.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Instruction.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Intrinsics.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Type.h\"\n#include \"llvm\/IR\/ValueHandle.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Transforms\/Utils\/BasicBlockUtils.h\"\n#include <cassert>\n#include <utility>\n\nusing namespace llvm;\n\n#define DEBUG_TYPE \"si-annotate-control-flow\"\n\nnamespace {\n\n\/\/ Complex types used in this pass\nusing StackEntry = std::pair<BasicBlock *, Value *>;\nusing StackVector = SmallVector<StackEntry, 16>;\n\nclass SIAnnotateControlFlow : public FunctionPass {\n  LegacyDivergenceAnalysis *DA;\n\n  Type *Boolean;\n  Type *Void;\n  Type *Int64;\n  Type *ReturnStruct;\n\n  ConstantInt *BoolTrue;\n  ConstantInt *BoolFalse;\n  UndefValue *BoolUndef;\n  Constant *Int64Zero;\n\n  Function *If;\n  Function *Else;\n  Function *IfBreak;\n  Function *Loop;\n  Function *EndCf;\n\n  DominatorTree *DT;\n  StackVector Stack;\n\n  LoopInfo *LI;\n\n  bool isUniform(BranchInst *T);\n\n  bool isTopOfStack(BasicBlock *BB);\n\n  Value *popSaved();\n\n  void push(BasicBlock *BB, Value *Saved);\n\n  bool isElse(PHINode *Phi);\n\n  void eraseIfUnused(PHINode *Phi);\n\n  void openIf(BranchInst *Term);\n\n  void insertElse(BranchInst *Term);\n\n  Value *\n  handleLoopCondition(Value *Cond, PHINode *Broken, llvm::Loop *L,\n                      BranchInst *Term);\n\n  void handleLoop(BranchInst *Term);\n\n  void closeControlFlow(BasicBlock *BB);\n\npublic:\n  static char ID;\n\n  SIAnnotateControlFlow() : FunctionPass(ID) {}\n\n  bool doInitialization(Module &M) override;\n\n  bool runOnFunction(Function &F) override;\n\n  StringRef getPassName() const override { return \"SI annotate control flow\"; }\n\n  void getAnalysisUsage(AnalysisUsage &AU) const override {\n    AU.addRequired<LoopInfoWrapperPass>();\n    AU.addRequired<DominatorTreeWrapperPass>();\n    AU.addRequired<LegacyDivergenceAnalysis>();\n    AU.addPreserved<DominatorTreeWrapperPass>();\n    FunctionPass::getAnalysisUsage(AU);\n  }\n};\n\n} \/\/ end anonymous namespace\n\nINITIALIZE_PASS_BEGIN(SIAnnotateControlFlow, DEBUG_TYPE,\n                      \"Annotate SI Control Flow\", false, false)\nINITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)\nINITIALIZE_PASS_DEPENDENCY(LegacyDivergenceAnalysis)\nINITIALIZE_PASS_END(SIAnnotateControlFlow, DEBUG_TYPE,\n                    \"Annotate SI Control Flow\", false, false)\n\nchar SIAnnotateControlFlow::ID = 0;\n\n\/\/\/ Initialize all the types and constants used in the pass\nbool SIAnnotateControlFlow::doInitialization(Module &M) {\n  LLVMContext &Context = M.getContext();\n\n  Void = Type::getVoidTy(Context);\n  Boolean = Type::getInt1Ty(Context);\n  Int64 = Type::getInt64Ty(Context);\n  ReturnStruct = StructType::get(Boolean, Int64);\n\n  BoolTrue = ConstantInt::getTrue(Context);\n  BoolFalse = ConstantInt::getFalse(Context);\n  BoolUndef = UndefValue::get(Boolean);\n  Int64Zero = ConstantInt::get(Int64, 0);\n\n  If = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_if);\n  Else = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_else);\n  IfBreak = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_if_break);\n  Loop = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_loop);\n  EndCf = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_end_cf);\n  return false;\n}\n\n\/\/\/ Is the branch condition uniform or did the StructurizeCFG pass\n\/\/\/ consider it as such?\nbool SIAnnotateControlFlow::isUniform(BranchInst *T) {\n  return DA->isUniform(T) ||\n         T->getMetadata(\"structurizecfg.uniform\") != nullptr;\n}\n\n\/\/\/ Is BB the last block saved on the stack ?\nbool SIAnnotateControlFlow::isTopOfStack(BasicBlock *BB) {\n  return !Stack.empty() && Stack.back().first == BB;\n}\n\n\/\/\/ Pop the last saved value from the control flow stack\nValue *SIAnnotateControlFlow::popSaved() {\n  return Stack.pop_back_val().second;\n}\n\n\/\/\/ Push a BB and saved value to the control flow stack\nvoid SIAnnotateControlFlow::push(BasicBlock *BB, Value *Saved) {\n  Stack.push_back(std::make_pair(BB, Saved));\n}\n\n\/\/\/ Can the condition represented by this PHI node treated like\n\/\/\/ an \"Else\" block?\nbool SIAnnotateControlFlow::isElse(PHINode *Phi) {\n  BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();\n  for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {\n    if (Phi->getIncomingBlock(i) == IDom) {\n\n      if (Phi->getIncomingValue(i) != BoolTrue)\n        return false;\n\n    } else {\n      if (Phi->getIncomingValue(i) != BoolFalse)\n        return false;\n\n    }\n  }\n  return true;\n}\n\n\/\/ Erase \"Phi\" if it is not used any more\nvoid SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) {\n  if (RecursivelyDeleteDeadPHINode(Phi)) {\n    LLVM_DEBUG(dbgs() << \"Erased unused condition phi\\n\");\n  }\n}\n\n\/\/\/ Open a new \"If\" block\nvoid SIAnnotateControlFlow::openIf(BranchInst *Term) {\n  if (isUniform(Term))\n    return;\n\n  Value *Ret = CallInst::Create(If, Term->getCondition(), \"\", Term);\n  Term->setCondition(ExtractValueInst::Create(Ret, 0, \"\", Term));\n  push(Term->getSuccessor(1), ExtractValueInst::Create(Ret, 1, \"\", Term));\n}\n\n\/\/\/ Close the last \"If\" block and open a new \"Else\" block\nvoid SIAnnotateControlFlow::insertElse(BranchInst *Term) {\n  if (isUniform(Term)) {\n    return;\n  }\n  Value *Ret = CallInst::Create(Else, popSaved(), \"\", Term);\n  Term->setCondition(ExtractValueInst::Create(Ret, 0, \"\", Term));\n  push(Term->getSuccessor(1), ExtractValueInst::Create(Ret, 1, \"\", Term));\n}\n\n\/\/\/ Recursively handle the condition leading to a loop\nValue *SIAnnotateControlFlow::handleLoopCondition(\n    Value *Cond, PHINode *Broken, llvm::Loop *L, BranchInst *Term) {\n  if (Instruction *Inst = dyn_cast<Instruction>(Cond)) {\n    BasicBlock *Parent = Inst->getParent();\n    Instruction *Insert;\n    if (L->contains(Inst)) {\n      Insert = Parent->getTerminator();\n    } else {\n      Insert = L->getHeader()->getFirstNonPHIOrDbgOrLifetime();\n    }\n\n    Value *Args[] = { Cond, Broken };\n    return CallInst::Create(IfBreak, Args, \"\", Insert);\n  }\n\n  \/\/ Insert IfBreak in the loop header TERM for constant COND other than true.\n  if (isa<Constant>(Cond)) {\n    Instruction *Insert = Cond == BoolTrue ?\n      Term : L->getHeader()->getTerminator();\n\n    Value *Args[] = { Cond, Broken };\n    return CallInst::Create(IfBreak, Args, \"\", Insert);\n  }\n\n  llvm_unreachable(\"Unhandled loop condition!\");\n}\n\n\/\/\/ Handle a back edge (loop)\nvoid SIAnnotateControlFlow::handleLoop(BranchInst *Term) {\n  if (isUniform(Term))\n    return;\n\n  BasicBlock *BB = Term->getParent();\n  llvm::Loop *L = LI->getLoopFor(BB);\n  if (!L)\n    return;\n\n  BasicBlock *Target = Term->getSuccessor(1);\n  PHINode *Broken = PHINode::Create(Int64, 0, \"phi.broken\", &Target->front());\n\n  Value *Cond = Term->getCondition();\n  Term->setCondition(BoolTrue);\n  Value *Arg = handleLoopCondition(Cond, Broken, L, Term);\n\n  for (BasicBlock *Pred : predecessors(Target)) {\n    Value *PHIValue = Int64Zero;\n    if (Pred == BB) \/\/ Remember the value of the previous iteration.\n      PHIValue = Arg;\n    \/\/ If the backedge from Pred to Target could be executed before the exit\n    \/\/ of the loop at BB, it should not reset or change \"Broken\", which keeps\n    \/\/ track of the number of threads exited the loop at BB.\n    else if (L->contains(Pred) && DT->dominates(Pred, BB))\n      PHIValue = Broken;\n    Broken->addIncoming(PHIValue, Pred);\n  }\n\n  Term->setCondition(CallInst::Create(Loop, Arg, \"\", Term));\n\n  push(Term->getSuccessor(0), Arg);\n}\n\n\/\/\/ Close the last opened control flow\nvoid SIAnnotateControlFlow::closeControlFlow(BasicBlock *BB) {\n  llvm::Loop *L = LI->getLoopFor(BB);\n\n  assert(Stack.back().first == BB);\n\n  if (L && L->getHeader() == BB) {\n    \/\/ We can't insert an EndCF call into a loop header, because it will\n    \/\/ get executed on every iteration of the loop, when it should be\n    \/\/ executed only once before the loop.\n    SmallVector <BasicBlock *, 8> Latches;\n    L->getLoopLatches(Latches);\n\n    SmallVector<BasicBlock *, 2> Preds;\n    for (BasicBlock *Pred : predecessors(BB)) {\n      if (!is_contained(Latches, Pred))\n        Preds.push_back(Pred);\n    }\n\n    BB = SplitBlockPredecessors(BB, Preds, \"endcf.split\", DT, LI, nullptr,\n                                false);\n  }\n\n  Value *Exec = popSaved();\n  Instruction *FirstInsertionPt = &*BB->getFirstInsertionPt();\n  if (!isa<UndefValue>(Exec) && !isa<UnreachableInst>(FirstInsertionPt))\n    CallInst::Create(EndCf, Exec, \"\", FirstInsertionPt);\n}\n\n\/\/\/ Annotate the control flow with intrinsics so the backend can\n\/\/\/ recognize if\/then\/else and loops.\nbool SIAnnotateControlFlow::runOnFunction(Function &F) {\n  DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();\n  LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();\n  DA = &getAnalysis<LegacyDivergenceAnalysis>();\n\n  for (df_iterator<BasicBlock *> I = df_begin(&F.getEntryBlock()),\n       E = df_end(&F.getEntryBlock()); I != E; ++I) {\n    BasicBlock *BB = *I;\n    BranchInst *Term = dyn_cast<BranchInst>(BB->getTerminator());\n\n    if (!Term || Term->isUnconditional()) {\n      if (isTopOfStack(BB))\n        closeControlFlow(BB);\n\n      continue;\n    }\n\n    if (I.nodeVisited(Term->getSuccessor(1))) {\n      if (isTopOfStack(BB))\n        closeControlFlow(BB);\n\n      handleLoop(Term);\n      continue;\n    }\n\n    if (isTopOfStack(BB)) {\n      PHINode *Phi = dyn_cast<PHINode>(Term->getCondition());\n      if (Phi && Phi->getParent() == BB && isElse(Phi)) {\n        insertElse(Term);\n        eraseIfUnused(Phi);\n        continue;\n      }\n\n      closeControlFlow(BB);\n    }\n\n    openIf(Term);\n  }\n\n  if (!Stack.empty()) {\n    \/\/ CFG was probably not structured.\n    report_fatal_error(\"failed to annotate CFG\");\n  }\n\n  return true;\n}\n\n\/\/\/ Create the annotation pass\nFunctionPass *llvm::createSIAnnotateControlFlowPass() {\n  return new SIAnnotateControlFlow();\n}\n<commit_msg>[AMDGPU] Reorder includes per coding standard. NFC.<commit_after>\/\/===- SIAnnotateControlFlow.cpp ------------------------------------------===\/\/\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\/\/\/ \\file\n\/\/\/ Annotates the control flow with hardware specific intrinsics.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"AMDGPU.h\"\n#include \"llvm\/ADT\/DepthFirstIterator.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Analysis\/LegacyDivergenceAnalysis.h\"\n#include \"llvm\/Analysis\/LoopInfo.h\"\n#include \"llvm\/IR\/BasicBlock.h\"\n#include \"llvm\/IR\/CFG.h\"\n#include \"llvm\/IR\/Constant.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/DerivedTypes.h\"\n#include \"llvm\/IR\/Dominators.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Instruction.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Intrinsics.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Type.h\"\n#include \"llvm\/IR\/ValueHandle.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Transforms\/Utils\/BasicBlockUtils.h\"\n#include \"llvm\/Transforms\/Utils\/Local.h\"\n#include <cassert>\n#include <utility>\n\nusing namespace llvm;\n\n#define DEBUG_TYPE \"si-annotate-control-flow\"\n\nnamespace {\n\n\/\/ Complex types used in this pass\nusing StackEntry = std::pair<BasicBlock *, Value *>;\nusing StackVector = SmallVector<StackEntry, 16>;\n\nclass SIAnnotateControlFlow : public FunctionPass {\n  LegacyDivergenceAnalysis *DA;\n\n  Type *Boolean;\n  Type *Void;\n  Type *Int64;\n  Type *ReturnStruct;\n\n  ConstantInt *BoolTrue;\n  ConstantInt *BoolFalse;\n  UndefValue *BoolUndef;\n  Constant *Int64Zero;\n\n  Function *If;\n  Function *Else;\n  Function *IfBreak;\n  Function *Loop;\n  Function *EndCf;\n\n  DominatorTree *DT;\n  StackVector Stack;\n\n  LoopInfo *LI;\n\n  bool isUniform(BranchInst *T);\n\n  bool isTopOfStack(BasicBlock *BB);\n\n  Value *popSaved();\n\n  void push(BasicBlock *BB, Value *Saved);\n\n  bool isElse(PHINode *Phi);\n\n  void eraseIfUnused(PHINode *Phi);\n\n  void openIf(BranchInst *Term);\n\n  void insertElse(BranchInst *Term);\n\n  Value *\n  handleLoopCondition(Value *Cond, PHINode *Broken, llvm::Loop *L,\n                      BranchInst *Term);\n\n  void handleLoop(BranchInst *Term);\n\n  void closeControlFlow(BasicBlock *BB);\n\npublic:\n  static char ID;\n\n  SIAnnotateControlFlow() : FunctionPass(ID) {}\n\n  bool doInitialization(Module &M) override;\n\n  bool runOnFunction(Function &F) override;\n\n  StringRef getPassName() const override { return \"SI annotate control flow\"; }\n\n  void getAnalysisUsage(AnalysisUsage &AU) const override {\n    AU.addRequired<LoopInfoWrapperPass>();\n    AU.addRequired<DominatorTreeWrapperPass>();\n    AU.addRequired<LegacyDivergenceAnalysis>();\n    AU.addPreserved<DominatorTreeWrapperPass>();\n    FunctionPass::getAnalysisUsage(AU);\n  }\n};\n\n} \/\/ end anonymous namespace\n\nINITIALIZE_PASS_BEGIN(SIAnnotateControlFlow, DEBUG_TYPE,\n                      \"Annotate SI Control Flow\", false, false)\nINITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)\nINITIALIZE_PASS_DEPENDENCY(LegacyDivergenceAnalysis)\nINITIALIZE_PASS_END(SIAnnotateControlFlow, DEBUG_TYPE,\n                    \"Annotate SI Control Flow\", false, false)\n\nchar SIAnnotateControlFlow::ID = 0;\n\n\/\/\/ Initialize all the types and constants used in the pass\nbool SIAnnotateControlFlow::doInitialization(Module &M) {\n  LLVMContext &Context = M.getContext();\n\n  Void = Type::getVoidTy(Context);\n  Boolean = Type::getInt1Ty(Context);\n  Int64 = Type::getInt64Ty(Context);\n  ReturnStruct = StructType::get(Boolean, Int64);\n\n  BoolTrue = ConstantInt::getTrue(Context);\n  BoolFalse = ConstantInt::getFalse(Context);\n  BoolUndef = UndefValue::get(Boolean);\n  Int64Zero = ConstantInt::get(Int64, 0);\n\n  If = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_if);\n  Else = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_else);\n  IfBreak = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_if_break);\n  Loop = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_loop);\n  EndCf = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_end_cf);\n  return false;\n}\n\n\/\/\/ Is the branch condition uniform or did the StructurizeCFG pass\n\/\/\/ consider it as such?\nbool SIAnnotateControlFlow::isUniform(BranchInst *T) {\n  return DA->isUniform(T) ||\n         T->getMetadata(\"structurizecfg.uniform\") != nullptr;\n}\n\n\/\/\/ Is BB the last block saved on the stack ?\nbool SIAnnotateControlFlow::isTopOfStack(BasicBlock *BB) {\n  return !Stack.empty() && Stack.back().first == BB;\n}\n\n\/\/\/ Pop the last saved value from the control flow stack\nValue *SIAnnotateControlFlow::popSaved() {\n  return Stack.pop_back_val().second;\n}\n\n\/\/\/ Push a BB and saved value to the control flow stack\nvoid SIAnnotateControlFlow::push(BasicBlock *BB, Value *Saved) {\n  Stack.push_back(std::make_pair(BB, Saved));\n}\n\n\/\/\/ Can the condition represented by this PHI node treated like\n\/\/\/ an \"Else\" block?\nbool SIAnnotateControlFlow::isElse(PHINode *Phi) {\n  BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();\n  for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {\n    if (Phi->getIncomingBlock(i) == IDom) {\n\n      if (Phi->getIncomingValue(i) != BoolTrue)\n        return false;\n\n    } else {\n      if (Phi->getIncomingValue(i) != BoolFalse)\n        return false;\n\n    }\n  }\n  return true;\n}\n\n\/\/ Erase \"Phi\" if it is not used any more\nvoid SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) {\n  if (RecursivelyDeleteDeadPHINode(Phi)) {\n    LLVM_DEBUG(dbgs() << \"Erased unused condition phi\\n\");\n  }\n}\n\n\/\/\/ Open a new \"If\" block\nvoid SIAnnotateControlFlow::openIf(BranchInst *Term) {\n  if (isUniform(Term))\n    return;\n\n  Value *Ret = CallInst::Create(If, Term->getCondition(), \"\", Term);\n  Term->setCondition(ExtractValueInst::Create(Ret, 0, \"\", Term));\n  push(Term->getSuccessor(1), ExtractValueInst::Create(Ret, 1, \"\", Term));\n}\n\n\/\/\/ Close the last \"If\" block and open a new \"Else\" block\nvoid SIAnnotateControlFlow::insertElse(BranchInst *Term) {\n  if (isUniform(Term)) {\n    return;\n  }\n  Value *Ret = CallInst::Create(Else, popSaved(), \"\", Term);\n  Term->setCondition(ExtractValueInst::Create(Ret, 0, \"\", Term));\n  push(Term->getSuccessor(1), ExtractValueInst::Create(Ret, 1, \"\", Term));\n}\n\n\/\/\/ Recursively handle the condition leading to a loop\nValue *SIAnnotateControlFlow::handleLoopCondition(\n    Value *Cond, PHINode *Broken, llvm::Loop *L, BranchInst *Term) {\n  if (Instruction *Inst = dyn_cast<Instruction>(Cond)) {\n    BasicBlock *Parent = Inst->getParent();\n    Instruction *Insert;\n    if (L->contains(Inst)) {\n      Insert = Parent->getTerminator();\n    } else {\n      Insert = L->getHeader()->getFirstNonPHIOrDbgOrLifetime();\n    }\n\n    Value *Args[] = { Cond, Broken };\n    return CallInst::Create(IfBreak, Args, \"\", Insert);\n  }\n\n  \/\/ Insert IfBreak in the loop header TERM for constant COND other than true.\n  if (isa<Constant>(Cond)) {\n    Instruction *Insert = Cond == BoolTrue ?\n      Term : L->getHeader()->getTerminator();\n\n    Value *Args[] = { Cond, Broken };\n    return CallInst::Create(IfBreak, Args, \"\", Insert);\n  }\n\n  llvm_unreachable(\"Unhandled loop condition!\");\n}\n\n\/\/\/ Handle a back edge (loop)\nvoid SIAnnotateControlFlow::handleLoop(BranchInst *Term) {\n  if (isUniform(Term))\n    return;\n\n  BasicBlock *BB = Term->getParent();\n  llvm::Loop *L = LI->getLoopFor(BB);\n  if (!L)\n    return;\n\n  BasicBlock *Target = Term->getSuccessor(1);\n  PHINode *Broken = PHINode::Create(Int64, 0, \"phi.broken\", &Target->front());\n\n  Value *Cond = Term->getCondition();\n  Term->setCondition(BoolTrue);\n  Value *Arg = handleLoopCondition(Cond, Broken, L, Term);\n\n  for (BasicBlock *Pred : predecessors(Target)) {\n    Value *PHIValue = Int64Zero;\n    if (Pred == BB) \/\/ Remember the value of the previous iteration.\n      PHIValue = Arg;\n    \/\/ If the backedge from Pred to Target could be executed before the exit\n    \/\/ of the loop at BB, it should not reset or change \"Broken\", which keeps\n    \/\/ track of the number of threads exited the loop at BB.\n    else if (L->contains(Pred) && DT->dominates(Pred, BB))\n      PHIValue = Broken;\n    Broken->addIncoming(PHIValue, Pred);\n  }\n\n  Term->setCondition(CallInst::Create(Loop, Arg, \"\", Term));\n\n  push(Term->getSuccessor(0), Arg);\n}\n\n\/\/\/ Close the last opened control flow\nvoid SIAnnotateControlFlow::closeControlFlow(BasicBlock *BB) {\n  llvm::Loop *L = LI->getLoopFor(BB);\n\n  assert(Stack.back().first == BB);\n\n  if (L && L->getHeader() == BB) {\n    \/\/ We can't insert an EndCF call into a loop header, because it will\n    \/\/ get executed on every iteration of the loop, when it should be\n    \/\/ executed only once before the loop.\n    SmallVector <BasicBlock *, 8> Latches;\n    L->getLoopLatches(Latches);\n\n    SmallVector<BasicBlock *, 2> Preds;\n    for (BasicBlock *Pred : predecessors(BB)) {\n      if (!is_contained(Latches, Pred))\n        Preds.push_back(Pred);\n    }\n\n    BB = SplitBlockPredecessors(BB, Preds, \"endcf.split\", DT, LI, nullptr,\n                                false);\n  }\n\n  Value *Exec = popSaved();\n  Instruction *FirstInsertionPt = &*BB->getFirstInsertionPt();\n  if (!isa<UndefValue>(Exec) && !isa<UnreachableInst>(FirstInsertionPt))\n    CallInst::Create(EndCf, Exec, \"\", FirstInsertionPt);\n}\n\n\/\/\/ Annotate the control flow with intrinsics so the backend can\n\/\/\/ recognize if\/then\/else and loops.\nbool SIAnnotateControlFlow::runOnFunction(Function &F) {\n  DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();\n  LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();\n  DA = &getAnalysis<LegacyDivergenceAnalysis>();\n\n  for (df_iterator<BasicBlock *> I = df_begin(&F.getEntryBlock()),\n       E = df_end(&F.getEntryBlock()); I != E; ++I) {\n    BasicBlock *BB = *I;\n    BranchInst *Term = dyn_cast<BranchInst>(BB->getTerminator());\n\n    if (!Term || Term->isUnconditional()) {\n      if (isTopOfStack(BB))\n        closeControlFlow(BB);\n\n      continue;\n    }\n\n    if (I.nodeVisited(Term->getSuccessor(1))) {\n      if (isTopOfStack(BB))\n        closeControlFlow(BB);\n\n      handleLoop(Term);\n      continue;\n    }\n\n    if (isTopOfStack(BB)) {\n      PHINode *Phi = dyn_cast<PHINode>(Term->getCondition());\n      if (Phi && Phi->getParent() == BB && isElse(Phi)) {\n        insertElse(Term);\n        eraseIfUnused(Phi);\n        continue;\n      }\n\n      closeControlFlow(BB);\n    }\n\n    openIf(Term);\n  }\n\n  if (!Stack.empty()) {\n    \/\/ CFG was probably not structured.\n    report_fatal_error(\"failed to annotate CFG\");\n  }\n\n  return true;\n}\n\n\/\/\/ Create the annotation pass\nFunctionPass *llvm::createSIAnnotateControlFlowPass() {\n  return new SIAnnotateControlFlow();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  despot_hifi.cpp\n *\n *  Created by Tobias Wood on 17\/10\/2011.\n *  Copyright (c) 2011-2013 Tobias Wood.\n *\n *  Based on code by Sean Deoni\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 <time.h>\n#include <getopt.h>\n#include <iostream>\n#include <atomic>\n#include <Eigen\/Dense>\n\n#include \"NiftiImage.h\"\n#include \"DESPOT.h\"\n\n#ifdef HAVE_NRECON\n#include \"procpar.h\"\nusing namespace Recon;\n#endif\n\nusing namespace std;\nusing namespace Eigen;\n\n\/\/******************************************************************************\n\/\/ Arguments \/ Usage\n\/\/******************************************************************************\nconst string credit {\n\"despot-hifi - Written by tobias.wood@kcl.ac.uk, based on work by Sean Deoni. \\n\\\nAcknowledgements greatfully received, grant discussions welcome.\"\n};\n\nconst string usage {\n\"Usage is: despot-hifi [options] spgr_input ir-spgr_input\\n\\\n\\\nOptions:\\n\\\n\t-m, --mask file  : Mask input with specified file.\\n\\\n\t--out, -o path    : Add a prefix to the output filenames.\\n\\\n\t-v, --verbose    : Print out more messages.\\n\\\n\t-i, --inv 0-3    : Specify the scanner Inversion mode:\\n\\\n\t                   0 = Use raw segment TR from input file\\n\\\n\t\t\t           1 = 1.5T scanner, readout pulses div 2 + 2\\n\\\n\t                   2 (Default) = 3T, scale TI by 0.9, readout pulses div 2 + 2\\n\\\n\t                   3 = 3T, scale TI by 0.84, readout pulses + 2)\\n\\\n\"\n};\n\nstatic int verbose = false, inversionMode = 2, peReadout = 0;\nstatic string outPrefix;\nstatic double inversionEfficiency = 0.;\nstatic struct option long_options[] =\n{\n\t{\"mask\", required_argument, 0, 'm'},\n\t{\"out\", required_argument, 0, 'o'},\n\t{\"verbose\", no_argument, 0, 'v'},\n\t{\"inv\", required_argument, 0, 'i'},\n\t{0, 0, 0, 0}\n};\n\n\/\/******************************************************************************\n\/\/ Main\n\/\/******************************************************************************\nint main(int argc, char **argv) {\n\t\/\/**************************************************************************\n\t\/\/ Argument Processing\n\t\/\/**************************************************************************\n\tcout << credit << endl;\n\tint nSPGR = 0, nIR = 0;\n\tNiftiImage inFile, spgrFile, irFile;\n\tdouble *maskData = NULL;\n\t\n\tint indexptr = 0, c;\n\twhile ((c = getopt_long(argc, argv, \"i:m:o:vp:\", long_options, &indexptr)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'i':\n\t\t\t\tinversionMode = atoi(optarg);\n\t\t\t\tif ((inversionMode < 0) || (inversionMode > 3)) {\n\t\t\t\t\tcout << \"Bad inversion mode (\" << inversionMode << \"). Must be 0-3\" << endl;\n\t\t\t\t\texit(EXIT_FAILURE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'm':\n\t\t\t\tcout << \"Opening mask file: \" << optarg << endl;\n\t\t\t\tif (!inFile.open(optarg, 'r')) {\n\t\t\t\t\texit(EXIT_FAILURE);\n\t\t\t\t}\n\t\t\t\tmaskData = inFile.readVolume<double>(0);\n\t\t\t\tinFile.close();\n\t\t\t\tbreak;\n\t\t\tcase 'o':\n\t\t\t\toutPrefix = optarg;\n\t\t\t\tcout << \"Output prefix will be: \" << outPrefix << endl;\n\t\t\t\tbreak;\n\t\t\tcase 'v': verbose = true; break;\n\t\t\tcase '?': \/\/ getopt will print an error message\n\t\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t}\n\tif ((argc - optind) != 2) {\n\t\tcout << \"Incorrect number of arguments.\" << endl << usage << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\t\n\t\/\/**************************************************************************\n\t#pragma mark Gather SPGR data\n\t\/\/**************************************************************************\n\tcout << \"Opening SPGR file: \" << argv[optind] << endl;\n\tif (!spgrFile.open(argv[optind], 'r')) {\n\t\texit(EXIT_FAILURE);\n\t}\n\tnSPGR = spgrFile.dim(4);\n\tVectorXd spgrAngles(nSPGR);\n\tdouble spgrTR;\n\t\n\t#ifdef HAVE_NRECON\n\tParameterList pars;\n\tif (ReadProcpar(spgrFile.basename() + \".procpar\", pars)) {\n\t\tspgrTR = RealValue(pars, \"tr\");\n\t\tfor (int i = 0; i < nSPGR; i++) spgrAngles[i] = RealValue(pars, \"flip1\", i);\n\t} else\n\t#endif\n\t{\n\t\tcout << \"Enter SPGR TR (seconds):\"; cin >> spgrTR;\n\t\tcout << \"Enter \" << nSPGR << \" Flip Angles (degrees):\";\n\t\tfor (int i = 0; i < nSPGR; i++) cin >> spgrAngles[i];\n\t}\n\tspgrAngles *= M_PI \/ 180.;\n\t\n\t\/\/**************************************************************************\n\t#pragma mark Gather IR-SPGR data\n\t\/\/**************************************************************************\t\n\tcout << \"Opening IR-SPGR file: \" << argv[++optind] << endl;\n\tif (!irFile.open(argv[optind], 'r')) {\n\t\texit(EXIT_FAILURE);\n\t}\n\tirFile.checkVoxelsCompatible(spgrFile);\n\tnIR = irFile.dim(4);\n\tVectorXd irTI(nIR);\n\tdouble irAngle, irTR;\n\t\n\t#ifdef HAVE_NRECON\n\tif (ReadProcpar(irFile.basename() + \".procpar\", pars)) {\n\t\tirAngle = RealValue(pars, \"flip1\") * M_PI \/ 180.;\n\t\tfor (int i = 0; i < nIR; i++) irTI[i] = RealValue(pars, \"ti\", i);\n\t\tirTR = RealValue(pars, \"trseg\") - irTI[0];\n\t} else\n\t#endif\n\t{\n\t\tcout << \"Enter IR-SPGR Flip Angle (degrees):\"; cin >> irAngle; irAngle *= M_PI \/ 180.;\n\t\tif (inversionMode > 0) {\n\t\t\tcout << \"Enter IR-SPGR TR (seconds):\"; cin >> irTR;\n\t\t\tcout << \"Enter original number of slices (PE2):\"; cin >> peReadout;\n\t\t\tdouble TIScale = 0.;\n\t\t\tswitch (inversionMode) {\n\t\t\t\tcase 1:\n\t\t\t\t\tTIScale = 1.0;\n\t\t\t\t\tpeReadout = (peReadout \/ 2) + 2;\n\t\t\t\t\tinversionEfficiency = 0.97;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tTIScale = 0.9; \/\/ From Sean's code\n\t\t\t\t\tpeReadout = (peReadout \/ 2) + 2;\n\t\t\t\t\tinversionEfficiency = 0.97;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tTIScale = 0.84; \/\/ From Sean's code\n\t\t\t\t\tpeReadout = peReadout + 2;\n\t\t\t\t\tinversionEfficiency = 0.97;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tirTR = irTR * peReadout;\n\t\t\tcout << \"Enter \" << nIR << \" IR-SPGR TI times (seconds):\";\n\t\t\tfor (int i = 0; i < nIR; i++) {\n\t\t\t\tcin >> irTI[i];\n\t\t\t\tirTI[i] *= TIScale;\n\t\t\t}\n\t\t} else {\n\t\t\tcout << \"Enter \" << nIR << \" IR-SPGR TI times (seconds):\";\n\t\t\tfor (int i = 0; i < nIR; i++) cin >> irTI[i];\n\t\t\tfprintf(stdout, \"Enter first scan Segment TR (seconds):\"); cin >> irTR;\n\t\t\tirTR -= irTI[0]; \/\/ Subtract off TI to get \n\t\t}\n\t}\n\tif (verbose) {\n\t\tcout << \"Found \" << nIR << \" SPGR-IR images with flip angle \" << irAngle * 180. \/ M_PI << \" degrees.\" << endl;\n\t\tcout << \"Segment TR is \" << irTR << \" seconds.\" << endl;\n\t\tcout << \"Inversion time(s) are \";\n\t\tfor (int i = 0; i < nIR; i++) cout << irTI[i] << \" \";\n\t\tcout << \"seconds.\" << endl;\n\t}\n\t\/\/**************************************************************************\n\t\/\/ Allocate memory for slices\n\t\/\/**************************************************************************\t\n\tint voxelsPerSlice = spgrFile.voxelsPerSlice();\n\tint voxelsPerVolume = spgrFile.voxelsPerVolume();\n\t\n\tcout << \"Reading image data...\" << flush;\n\tdouble *SPGR = spgrFile.readAllVolumes<double>();\n\tdouble *IR   = irFile.readAllVolumes<double>();\n\tspgrFile.close();\n\tirFile.close();\n\tcout << \"done.\" << endl;\n\t\/\/**************************************************************************\n\t\/\/ Create results data storage\n\t\/\/**************************************************************************\n\t#define NR 4\n\tdouble **resultsData   = new double*[NR];\n\tfor (int i = 0; i < NR; i++)\n\t\tresultsData[i] = new double[voxelsPerVolume];\n\tconst string names[NR] = { \"HIFI_M0\", \"HIFI_T1\", \"HIFI_B1\", \"HIFI_residual\" };\n\t\n\t\/\/**************************************************************************\n\t\/\/ Do the fitting\n\t\/\/**************************************************************************\n\tfor (int slice = 0; slice < spgrFile.dim(3); slice++)\n\t{\n\t\tclock_t loopStart;\n\t\t\/\/ Read in data\n\t\tif (verbose)\n\t\t\tcout << \"Starting slice \" << slice << \"...\" << flush;\n\t\tloopStart = clock();\n\t\tatomic<int> voxCount{0};\n\t\tint sliceOffset = slice * voxelsPerSlice;\n\t\t\n\t\tfunction<void (const int&)> processVox = [&] (const int &vox) {\n\t\t\tdouble T1 = 0., M0 = 0., B1 = 1., res = 0.; \/\/ Assume B1 field is uniform for classic DESPOT\n\t\t\tif ((!maskData) || (maskData[sliceOffset + vox] > 0.))\n\t\t\t{\n\t\t\t\tvoxCount++;\n\t\t\t\tArrayXd spgrs(nSPGR), irs(nIR);\n\t\t\t\tint vol = 0;\n\t\t\t\tfor (int img = 0; img < nSPGR; img++)\n\t\t\t\t\t\tspgrs[vol++] = SPGR[img * voxelsPerVolume + sliceOffset + vox];\n\t\t\t\tfor (int img = 0; img < nIR; img++)\n\t\t\t\t\t\tirs[img] = IR[img * voxelsPerVolume + sliceOffset + vox];\n\t\t\t\tres = calcHIFI(spgrAngles, spgrs, spgrTR,\n\t\t\t\t               irTI, irs, irAngle, irTR, peReadout, inversionEfficiency,\n\t\t\t\t\t\t\t   M0, T1, B1);\n\t\t\t\t\/\/ Sanity check\n\t\t\t\tM0 = clamp(M0, 0., 1.e7);\n\t\t\t\tT1 = clamp(T1, 0., 15.);\n\t\t\t\tB1 = clamp(B1, 0., 2.);\n\t\t\t}\n\t\t\tresultsData[0][sliceOffset + vox] = M0;\n\t\t\tresultsData[1][sliceOffset + vox] = T1;\n\t\t\tresultsData[2][sliceOffset + vox] = B1;\n\t\t\tresultsData[3][sliceOffset + vox] = res;\n\t\t};\n\t\tapply_for(voxelsPerSlice, processVox);\n\t\t\n\t\tif (verbose) {\n\t\t\tclock_t loopEnd = clock();\n\t\t\tif (voxCount > 0)\n\t\t\t\tcout << voxCount << \" unmasked voxels, CPU time per voxel was \"\n\t\t\t\t          << ((loopEnd - loopStart) \/ ((float)voxCount * CLOCKS_PER_SEC)) << \" s, \";\n\t\t\tcout << \"finished.\" << endl;\n\t\t}\n\t}\n\t\n\t\/\/**************************************************************************\n\t#pragma mark Write out data\n\t\/\/**************************************************************************\n\tNiftiImage outFile(spgrFile);\n\toutFile.setDatatype(DT_FLOAT32);\n\toutFile.setDim(4, 1);\n\tfor (int r = 0; r < NR; r++)\n\t{\n\t\tstring outName = outPrefix + names[r] + \".nii.gz\";\n\t\tif (verbose)\n\t\t\tcout << \"Writing result header: \" << outName << endl;\n\t\toutFile.open(outName, 'w');\n\t\toutFile.writeVolume<double>(0, resultsData[r]);\n\t\toutFile.close();\n\t\tdelete[] resultsData[r];\n\t}\n\t\/\/ Clean up memory\n\tdelete[] resultsData;\n\tdelete[] SPGR;\n\tdelete[] IR;\n\tdelete[] maskData;\n\tcout << \"All done.\" << endl;\n\texit(EXIT_SUCCESS);\n}\n<commit_msg>Forgot to change despot_hifi to use new voxel\/space checking function on NiftiImage.<commit_after>\/*\n *  despot_hifi.cpp\n *\n *  Created by Tobias Wood on 17\/10\/2011.\n *  Copyright (c) 2011-2013 Tobias Wood.\n *\n *  Based on code by Sean Deoni\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 <time.h>\n#include <getopt.h>\n#include <iostream>\n#include <atomic>\n#include <Eigen\/Dense>\n\n#include \"NiftiImage.h\"\n#include \"DESPOT.h\"\n\n#ifdef HAVE_NRECON\n#include \"procpar.h\"\nusing namespace Recon;\n#endif\n\nusing namespace std;\nusing namespace Eigen;\n\n\/\/******************************************************************************\n\/\/ Arguments \/ Usage\n\/\/******************************************************************************\nconst string credit {\n\"despot-hifi - Written by tobias.wood@kcl.ac.uk, based on work by Sean Deoni. \\n\\\nAcknowledgements greatfully received, grant discussions welcome.\"\n};\n\nconst string usage {\n\"Usage is: despot-hifi [options] spgr_input ir-spgr_input\\n\\\n\\\nOptions:\\n\\\n\t-m, --mask file  : Mask input with specified file.\\n\\\n\t--out, -o path    : Add a prefix to the output filenames.\\n\\\n\t-v, --verbose    : Print out more messages.\\n\\\n\t-i, --inv 0-3    : Specify the scanner Inversion mode:\\n\\\n\t                   0 = Use raw segment TR from input file\\n\\\n\t\t\t           1 = 1.5T scanner, readout pulses div 2 + 2\\n\\\n\t                   2 (Default) = 3T, scale TI by 0.9, readout pulses div 2 + 2\\n\\\n\t                   3 = 3T, scale TI by 0.84, readout pulses + 2)\\n\\\n\"\n};\n\nstatic int verbose = false, inversionMode = 2, peReadout = 0;\nstatic string outPrefix;\nstatic double inversionEfficiency = 0.;\nstatic struct option long_options[] =\n{\n\t{\"mask\", required_argument, 0, 'm'},\n\t{\"out\", required_argument, 0, 'o'},\n\t{\"verbose\", no_argument, 0, 'v'},\n\t{\"inv\", required_argument, 0, 'i'},\n\t{0, 0, 0, 0}\n};\n\n\/\/******************************************************************************\n\/\/ Main\n\/\/******************************************************************************\nint main(int argc, char **argv) {\n\t\/\/**************************************************************************\n\t\/\/ Argument Processing\n\t\/\/**************************************************************************\n\tcout << credit << endl;\n\tint nSPGR = 0, nIR = 0;\n\tNiftiImage inFile, spgrFile, irFile;\n\tdouble *maskData = NULL;\n\t\n\tint indexptr = 0, c;\n\twhile ((c = getopt_long(argc, argv, \"i:m:o:vp:\", long_options, &indexptr)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'i':\n\t\t\t\tinversionMode = atoi(optarg);\n\t\t\t\tif ((inversionMode < 0) || (inversionMode > 3)) {\n\t\t\t\t\tcout << \"Bad inversion mode (\" << inversionMode << \"). Must be 0-3\" << endl;\n\t\t\t\t\texit(EXIT_FAILURE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'm':\n\t\t\t\tcout << \"Opening mask file: \" << optarg << endl;\n\t\t\t\tif (!inFile.open(optarg, 'r')) {\n\t\t\t\t\texit(EXIT_FAILURE);\n\t\t\t\t}\n\t\t\t\tmaskData = inFile.readVolume<double>(0);\n\t\t\t\tinFile.close();\n\t\t\t\tbreak;\n\t\t\tcase 'o':\n\t\t\t\toutPrefix = optarg;\n\t\t\t\tcout << \"Output prefix will be: \" << outPrefix << endl;\n\t\t\t\tbreak;\n\t\t\tcase 'v': verbose = true; break;\n\t\t\tcase '?': \/\/ getopt will print an error message\n\t\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t}\n\tif ((argc - optind) != 2) {\n\t\tcout << \"Incorrect number of arguments.\" << endl << usage << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\t\n\t\/\/**************************************************************************\n\t#pragma mark Gather SPGR data\n\t\/\/**************************************************************************\n\tcout << \"Opening SPGR file: \" << argv[optind] << endl;\n\tif (!spgrFile.open(argv[optind], 'r')) {\n\t\texit(EXIT_FAILURE);\n\t}\n\tnSPGR = spgrFile.dim(4);\n\tVectorXd spgrAngles(nSPGR);\n\tdouble spgrTR;\n\t\n\t#ifdef HAVE_NRECON\n\tParameterList pars;\n\tif (ReadProcpar(spgrFile.basename() + \".procpar\", pars)) {\n\t\tspgrTR = RealValue(pars, \"tr\");\n\t\tfor (int i = 0; i < nSPGR; i++) spgrAngles[i] = RealValue(pars, \"flip1\", i);\n\t} else\n\t#endif\n\t{\n\t\tcout << \"Enter SPGR TR (seconds):\"; cin >> spgrTR;\n\t\tcout << \"Enter \" << nSPGR << \" Flip Angles (degrees):\";\n\t\tfor (int i = 0; i < nSPGR; i++) cin >> spgrAngles[i];\n\t}\n\tspgrAngles *= M_PI \/ 180.;\n\t\n\t\/\/**************************************************************************\n\t#pragma mark Gather IR-SPGR data\n\t\/\/**************************************************************************\t\n\tcout << \"Opening IR-SPGR file: \" << argv[++optind] << endl;\n\tif (!irFile.open(argv[optind], 'r')) {\n\t\texit(EXIT_FAILURE);\n\t}\n\tif (!irFile.matchesSpace(spgrFile)) {\n\t\tcout << irFile.warningSpace(spgrFile) << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\tnIR = irFile.dim(4);\n\tVectorXd irTI(nIR);\n\tdouble irAngle, irTR;\n\t\n\t#ifdef HAVE_NRECON\n\tif (ReadProcpar(irFile.basename() + \".procpar\", pars)) {\n\t\tirAngle = RealValue(pars, \"flip1\") * M_PI \/ 180.;\n\t\tfor (int i = 0; i < nIR; i++) irTI[i] = RealValue(pars, \"ti\", i);\n\t\tirTR = RealValue(pars, \"trseg\") - irTI[0];\n\t} else\n\t#endif\n\t{\n\t\tcout << \"Enter IR-SPGR Flip Angle (degrees):\"; cin >> irAngle; irAngle *= M_PI \/ 180.;\n\t\tif (inversionMode > 0) {\n\t\t\tcout << \"Enter IR-SPGR TR (seconds):\"; cin >> irTR;\n\t\t\tcout << \"Enter original number of slices (PE2):\"; cin >> peReadout;\n\t\t\tdouble TIScale = 0.;\n\t\t\tswitch (inversionMode) {\n\t\t\t\tcase 1:\n\t\t\t\t\tTIScale = 1.0;\n\t\t\t\t\tpeReadout = (peReadout \/ 2) + 2;\n\t\t\t\t\tinversionEfficiency = 0.97;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tTIScale = 0.9; \/\/ From Sean's code\n\t\t\t\t\tpeReadout = (peReadout \/ 2) + 2;\n\t\t\t\t\tinversionEfficiency = 0.97;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tTIScale = 0.84; \/\/ From Sean's code\n\t\t\t\t\tpeReadout = peReadout + 2;\n\t\t\t\t\tinversionEfficiency = 0.97;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tirTR = irTR * peReadout;\n\t\t\tcout << \"Enter \" << nIR << \" IR-SPGR TI times (seconds):\";\n\t\t\tfor (int i = 0; i < nIR; i++) {\n\t\t\t\tcin >> irTI[i];\n\t\t\t\tirTI[i] *= TIScale;\n\t\t\t}\n\t\t} else {\n\t\t\tcout << \"Enter \" << nIR << \" IR-SPGR TI times (seconds):\";\n\t\t\tfor (int i = 0; i < nIR; i++) cin >> irTI[i];\n\t\t\tfprintf(stdout, \"Enter first scan Segment TR (seconds):\"); cin >> irTR;\n\t\t\tirTR -= irTI[0]; \/\/ Subtract off TI to get \n\t\t}\n\t}\n\tif (verbose) {\n\t\tcout << \"Found \" << nIR << \" SPGR-IR images with flip angle \" << irAngle * 180. \/ M_PI << \" degrees.\" << endl;\n\t\tcout << \"Segment TR is \" << irTR << \" seconds.\" << endl;\n\t\tcout << \"Inversion time(s) are \";\n\t\tfor (int i = 0; i < nIR; i++) cout << irTI[i] << \" \";\n\t\tcout << \"seconds.\" << endl;\n\t}\n\t\/\/**************************************************************************\n\t\/\/ Allocate memory for slices\n\t\/\/**************************************************************************\t\n\tint voxelsPerSlice = spgrFile.voxelsPerSlice();\n\tint voxelsPerVolume = spgrFile.voxelsPerVolume();\n\t\n\tcout << \"Reading image data...\" << flush;\n\tdouble *SPGR = spgrFile.readAllVolumes<double>();\n\tdouble *IR   = irFile.readAllVolumes<double>();\n\tspgrFile.close();\n\tirFile.close();\n\tcout << \"done.\" << endl;\n\t\/\/**************************************************************************\n\t\/\/ Create results data storage\n\t\/\/**************************************************************************\n\t#define NR 4\n\tdouble **resultsData   = new double*[NR];\n\tfor (int i = 0; i < NR; i++)\n\t\tresultsData[i] = new double[voxelsPerVolume];\n\tconst string names[NR] = { \"HIFI_M0\", \"HIFI_T1\", \"HIFI_B1\", \"HIFI_residual\" };\n\t\n\t\/\/**************************************************************************\n\t\/\/ Do the fitting\n\t\/\/**************************************************************************\n\tfor (int slice = 0; slice < spgrFile.dim(3); slice++)\n\t{\n\t\tclock_t loopStart;\n\t\t\/\/ Read in data\n\t\tif (verbose)\n\t\t\tcout << \"Starting slice \" << slice << \"...\" << flush;\n\t\tloopStart = clock();\n\t\tatomic<int> voxCount{0};\n\t\tint sliceOffset = slice * voxelsPerSlice;\n\t\t\n\t\tfunction<void (const int&)> processVox = [&] (const int &vox) {\n\t\t\tdouble T1 = 0., M0 = 0., B1 = 1., res = 0.; \/\/ Assume B1 field is uniform for classic DESPOT\n\t\t\tif ((!maskData) || (maskData[sliceOffset + vox] > 0.))\n\t\t\t{\n\t\t\t\tvoxCount++;\n\t\t\t\tArrayXd spgrs(nSPGR), irs(nIR);\n\t\t\t\tint vol = 0;\n\t\t\t\tfor (int img = 0; img < nSPGR; img++)\n\t\t\t\t\t\tspgrs[vol++] = SPGR[img * voxelsPerVolume + sliceOffset + vox];\n\t\t\t\tfor (int img = 0; img < nIR; img++)\n\t\t\t\t\t\tirs[img] = IR[img * voxelsPerVolume + sliceOffset + vox];\n\t\t\t\tres = calcHIFI(spgrAngles, spgrs, spgrTR,\n\t\t\t\t               irTI, irs, irAngle, irTR, peReadout, inversionEfficiency,\n\t\t\t\t\t\t\t   M0, T1, B1);\n\t\t\t\t\/\/ Sanity check\n\t\t\t\tM0 = clamp(M0, 0., 1.e7);\n\t\t\t\tT1 = clamp(T1, 0., 15.);\n\t\t\t\tB1 = clamp(B1, 0., 2.);\n\t\t\t}\n\t\t\tresultsData[0][sliceOffset + vox] = M0;\n\t\t\tresultsData[1][sliceOffset + vox] = T1;\n\t\t\tresultsData[2][sliceOffset + vox] = B1;\n\t\t\tresultsData[3][sliceOffset + vox] = res;\n\t\t};\n\t\tapply_for(voxelsPerSlice, processVox);\n\t\t\n\t\tif (verbose) {\n\t\t\tclock_t loopEnd = clock();\n\t\t\tif (voxCount > 0)\n\t\t\t\tcout << voxCount << \" unmasked voxels, CPU time per voxel was \"\n\t\t\t\t          << ((loopEnd - loopStart) \/ ((float)voxCount * CLOCKS_PER_SEC)) << \" s, \";\n\t\t\tcout << \"finished.\" << endl;\n\t\t}\n\t}\n\t\n\t\/\/**************************************************************************\n\t#pragma mark Write out data\n\t\/\/**************************************************************************\n\tNiftiImage outFile(spgrFile);\n\toutFile.setDatatype(DT_FLOAT32);\n\toutFile.setDim(4, 1);\n\tfor (int r = 0; r < NR; r++)\n\t{\n\t\tstring outName = outPrefix + names[r] + \".nii.gz\";\n\t\tif (verbose)\n\t\t\tcout << \"Writing result header: \" << outName << endl;\n\t\toutFile.open(outName, 'w');\n\t\toutFile.writeVolume<double>(0, resultsData[r]);\n\t\toutFile.close();\n\t\tdelete[] resultsData[r];\n\t}\n\t\/\/ Clean up memory\n\tdelete[] resultsData;\n\tdelete[] SPGR;\n\tdelete[] IR;\n\tdelete[] maskData;\n\tcout << \"All done.\" << endl;\n\texit(EXIT_SUCCESS);\n}\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 <inviwo\/core\/util\/filesystem.h>\n#include <inviwo\/core\/util\/formats.h>\n#include <warn\/push>\n#include <warn\/ignore\/all>\n#include <gtest\/gtest.h>\n#include <warn\/pop>\n\nnamespace inviwo{\n\nTEST(filesystemTest, fileExistsTest) {\n\/* This will not work with ccache.\n#ifdef __FILE__\n    EXPECT_TRUE(filesystem::fileExists(__FILE__));\n#endif\n*\/\n}\n\nTEST(filesystemTest, fileExtensionTest) {\n    EXPECT_STREQ(\"\", filesystem::getFileExtension(\"\").c_str());\n    EXPECT_STREQ(\"txt\", filesystem::getFileExtension(\"test.txt\").c_str());\n    EXPECT_STREQ(\"txt\", filesystem::getFileExtension(\"test.dobule.txt\").c_str());\n    EXPECT_STREQ(\"\", filesystem::getFileExtension(\"noExtensions\").c_str());\n    EXPECT_STREQ(\"\", filesystem::getFileExtension(\"C:\/a\/directory\/for\/test\/noExtensions\").c_str());\n    EXPECT_STREQ(\"\",\n                 filesystem::getFileExtension(\"C:\/a\/directory\/for\/test.test\/noExtensions\").c_str());\n#ifdef __FILE__\n    EXPECT_STREQ(\"cpp\", filesystem::getFileExtension(__FILE__).c_str());\n#endif\n}\n\nTEST(filesystemTest, fileNameWithExtension) {\n    EXPECT_STREQ(\"file.txt\",\n                 filesystem::getFileNameWithExtension(\"C:\/a\/directory\/for\/test\/file.txt\").c_str());\n    EXPECT_STREQ(\n        \"file.txt\",\n        filesystem::getFileNameWithExtension(\"C:\\\\a\\\\directory\\\\for\\\\test\\\\file.txt\").c_str());\n    EXPECT_STREQ(\"justafile.txt\", filesystem::getFileNameWithExtension(\"justafile.txt\").c_str());\n}\n\nTEST(filesystemTest, fileDirectoryTest) {\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\",\n                 filesystem::getFileDirectory(\"C:\/a\/directory\/for\/test\/file.txt\").c_str());\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\",\n                 filesystem::getFileDirectory(\"C:\\\\a\\\\directory\\\\for\\\\test\\\\file.txt\").c_str());\n    EXPECT_STREQ(\"\", filesystem::getFileDirectory(\"justafile.txt\").c_str());\n}\n\nTEST(filesystemTest, relativePathTest) {\n\n    const std::string a = \"\/a\/b\/c\/d\";\n    const std::string b = \"\/a\/b\/c\/d\/e\/f\";\n    const std::string c = \"\/a\/b\";\n    const std::string d = \"\/a\/b\/c\/d\/p\/q\";\n\n\n    auto AB = filesystem::getRelativePath(a, b);\n    EXPECT_STREQ(\"e\/f\", AB.c_str());\n\n    auto AC = filesystem::getRelativePath(a, c);\n    EXPECT_STREQ(\"..\/..\/..\/b\", AC.c_str());\n\n    auto BA = filesystem::getRelativePath(b, a);\n    EXPECT_STREQ(\"..\/..\/..\/d\", BA.c_str());\n\n    auto BC = filesystem::getRelativePath(b, c);\n    EXPECT_STREQ(\"..\/..\/..\/..\/..\/b\", BC.c_str());\n\n    auto CA = filesystem::getRelativePath(c, a);\n    EXPECT_STREQ(\"c\/d\", CA.c_str());\n\n    auto CB = filesystem::getRelativePath(c, b);\n    EXPECT_STREQ(\"c\/d\/e\/f\", CB.c_str());\n\n    auto DA = filesystem::getRelativePath(d, a);\n    EXPECT_STREQ(\"..\/..\/..\/d\", DA.c_str());\n\n    auto AD = filesystem::getRelativePath(a, d);\n    EXPECT_STREQ(\"p\/q\", AD.c_str());\n\n    EXPECT_STREQ(\"..\/test\/file.txt\",\n                 filesystem::getRelativePath(\"C:\/foo\/bar\", \"C:\/foo\/test\/file.txt\").c_str());\n}\n\nTEST(filesystemTest, pathCleanupTest) {\n    \/\/ cleanupPath should replace all '\\' with '\/'\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\/file.txt\",\n                 filesystem::cleanupPath(\"C:\\\\a\\\\directory\/for\/test\\\\file.txt\").c_str());\n    \/\/ cleanupPath should remove surrounding double quotes '\"'\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\/file.txt\",\n                 filesystem::cleanupPath(\"\\\"C:\/a\/directory\/for\/test\/file.txt\\\"\").c_str());\n    \/\/ remove quotes and backslashes\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\/file.txt\",\n                 filesystem::cleanupPath(\"\\\"C:\\\\a\\\\directory\\\\for\\\\test\/file.txt\\\"\").c_str());\n\n    \/\/ unmatched quote\n    EXPECT_STREQ(\"\\\"C:\/test\/file.txt\",\n                 filesystem::cleanupPath(\"\\\"C:\\\\test\/file.txt\").c_str());\n}\n\n\n}\n<commit_msg>Jenkins: ccache, disable __FILE__ test until we figure out a better solution<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 <inviwo\/core\/util\/filesystem.h>\n#include <inviwo\/core\/util\/formats.h>\n#include <warn\/push>\n#include <warn\/ignore\/all>\n#include <gtest\/gtest.h>\n#include <warn\/pop>\n\nnamespace inviwo{\n\n\/* This will not work with ccache.\nTEST(filesystemTest, fileExistsTest) {\n#ifdef __FILE__\n    EXPECT_TRUE(filesystem::fileExists(__FILE__));\n#endif\n}\n*\/\n\nTEST(filesystemTest, fileExtensionTest) {\n    EXPECT_STREQ(\"\", filesystem::getFileExtension(\"\").c_str());\n    EXPECT_STREQ(\"txt\", filesystem::getFileExtension(\"test.txt\").c_str());\n    EXPECT_STREQ(\"txt\", filesystem::getFileExtension(\"test.dobule.txt\").c_str());\n    EXPECT_STREQ(\"\", filesystem::getFileExtension(\"noExtensions\").c_str());\n    EXPECT_STREQ(\"\", filesystem::getFileExtension(\"C:\/a\/directory\/for\/test\/noExtensions\").c_str());\n    EXPECT_STREQ(\"\",\n                 filesystem::getFileExtension(\"C:\/a\/directory\/for\/test.test\/noExtensions\").c_str());\n#ifdef __FILE__\n    EXPECT_STREQ(\"cpp\", filesystem::getFileExtension(__FILE__).c_str());\n#endif\n}\n\nTEST(filesystemTest, fileNameWithExtension) {\n    EXPECT_STREQ(\"file.txt\",\n                 filesystem::getFileNameWithExtension(\"C:\/a\/directory\/for\/test\/file.txt\").c_str());\n    EXPECT_STREQ(\n        \"file.txt\",\n        filesystem::getFileNameWithExtension(\"C:\\\\a\\\\directory\\\\for\\\\test\\\\file.txt\").c_str());\n    EXPECT_STREQ(\"justafile.txt\", filesystem::getFileNameWithExtension(\"justafile.txt\").c_str());\n}\n\nTEST(filesystemTest, fileDirectoryTest) {\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\",\n                 filesystem::getFileDirectory(\"C:\/a\/directory\/for\/test\/file.txt\").c_str());\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\",\n                 filesystem::getFileDirectory(\"C:\\\\a\\\\directory\\\\for\\\\test\\\\file.txt\").c_str());\n    EXPECT_STREQ(\"\", filesystem::getFileDirectory(\"justafile.txt\").c_str());\n}\n\nTEST(filesystemTest, relativePathTest) {\n\n    const std::string a = \"\/a\/b\/c\/d\";\n    const std::string b = \"\/a\/b\/c\/d\/e\/f\";\n    const std::string c = \"\/a\/b\";\n    const std::string d = \"\/a\/b\/c\/d\/p\/q\";\n\n\n    auto AB = filesystem::getRelativePath(a, b);\n    EXPECT_STREQ(\"e\/f\", AB.c_str());\n\n    auto AC = filesystem::getRelativePath(a, c);\n    EXPECT_STREQ(\"..\/..\/..\/b\", AC.c_str());\n\n    auto BA = filesystem::getRelativePath(b, a);\n    EXPECT_STREQ(\"..\/..\/..\/d\", BA.c_str());\n\n    auto BC = filesystem::getRelativePath(b, c);\n    EXPECT_STREQ(\"..\/..\/..\/..\/..\/b\", BC.c_str());\n\n    auto CA = filesystem::getRelativePath(c, a);\n    EXPECT_STREQ(\"c\/d\", CA.c_str());\n\n    auto CB = filesystem::getRelativePath(c, b);\n    EXPECT_STREQ(\"c\/d\/e\/f\", CB.c_str());\n\n    auto DA = filesystem::getRelativePath(d, a);\n    EXPECT_STREQ(\"..\/..\/..\/d\", DA.c_str());\n\n    auto AD = filesystem::getRelativePath(a, d);\n    EXPECT_STREQ(\"p\/q\", AD.c_str());\n\n    EXPECT_STREQ(\"..\/test\/file.txt\",\n                 filesystem::getRelativePath(\"C:\/foo\/bar\", \"C:\/foo\/test\/file.txt\").c_str());\n}\n\nTEST(filesystemTest, pathCleanupTest) {\n    \/\/ cleanupPath should replace all '\\' with '\/'\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\/file.txt\",\n                 filesystem::cleanupPath(\"C:\\\\a\\\\directory\/for\/test\\\\file.txt\").c_str());\n    \/\/ cleanupPath should remove surrounding double quotes '\"'\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\/file.txt\",\n                 filesystem::cleanupPath(\"\\\"C:\/a\/directory\/for\/test\/file.txt\\\"\").c_str());\n    \/\/ remove quotes and backslashes\n    EXPECT_STREQ(\"C:\/a\/directory\/for\/test\/file.txt\",\n                 filesystem::cleanupPath(\"\\\"C:\\\\a\\\\directory\\\\for\\\\test\/file.txt\\\"\").c_str());\n\n    \/\/ unmatched quote\n    EXPECT_STREQ(\"\\\"C:\/test\/file.txt\",\n                 filesystem::cleanupPath(\"\\\"C:\\\\test\/file.txt\").c_str());\n}\n\n\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 <gael.guennebaud@inria.fr>\n\/\/ Copyright (C) 2010 Jitse Niesen <jitse@maths.leeds.ac.uk>\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#include \"svd_fill.h\"\n#include <limits>\n#include <Eigen\/Eigenvalues>\n\n\n\ntemplate<typename MatrixType> void selfadjointeigensolver(const MatrixType& m)\n{\n  typedef typename MatrixType::Index Index;\n  \/* this test covers the following files:\n     EigenSolver.h, SelfAdjointEigenSolver.h (and indirectly: Tridiagonalization.h)\n  *\/\n  Index rows = m.rows();\n  Index cols = m.cols();\n\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename NumTraits<Scalar>::Real RealScalar;\n\n  RealScalar largerEps = 10*test_precision<RealScalar>();\n\n  MatrixType a = MatrixType::Random(rows,cols);\n  MatrixType a1 = MatrixType::Random(rows,cols);\n  MatrixType symmA =  a.adjoint() * a + a1.adjoint() * a1;\n  MatrixType symmC = symmA;\n  \n  svd_fill_random(symmA,Symmetric);\n\n  symmA.template triangularView<StrictlyUpper>().setZero();\n  symmC.template triangularView<StrictlyUpper>().setZero();\n\n  MatrixType b = MatrixType::Random(rows,cols);\n  MatrixType b1 = MatrixType::Random(rows,cols);\n  MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1;\n  symmB.template triangularView<StrictlyUpper>().setZero();\n\n  SelfAdjointEigenSolver<MatrixType> eiSymm(symmA);\n  SelfAdjointEigenSolver<MatrixType> eiDirect;\n  eiDirect.computeDirect(symmA);\n  \/\/ generalized eigen pb\n  GeneralizedSelfAdjointEigenSolver<MatrixType> eiSymmGen(symmC, symmB);\n\n  VERIFY_IS_EQUAL(eiSymm.info(), Success);\n  VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(\n          eiSymm.eigenvectors() * eiSymm.eigenvalues().asDiagonal(), largerEps));\n  VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());\n  \n  VERIFY_IS_EQUAL(eiDirect.info(), Success);\n  VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(\n          eiDirect.eigenvectors() * eiDirect.eigenvalues().asDiagonal(), largerEps));\n  VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues());\n\n  SelfAdjointEigenSolver<MatrixType> eiSymmNoEivecs(symmA, false);\n  VERIFY_IS_EQUAL(eiSymmNoEivecs.info(), Success);\n  VERIFY_IS_APPROX(eiSymm.eigenvalues(), eiSymmNoEivecs.eigenvalues());\n  \n  \/\/ generalized eigen problem Ax = lBx\n  eiSymmGen.compute(symmC, symmB,Ax_lBx);\n  VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n  VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(\n          symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n  \/\/ generalized eigen problem BAx = lx\n  eiSymmGen.compute(symmC, symmB,BAx_lx);\n  VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n  VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(\n         (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n  \/\/ generalized eigen problem ABx = lx\n  eiSymmGen.compute(symmC, symmB,ABx_lx);\n  VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n  VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(\n         (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n\n  eiSymm.compute(symmC);\n  MatrixType sqrtSymmA = eiSymm.operatorSqrt();\n  VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), sqrtSymmA*sqrtSymmA);\n  VERIFY_IS_APPROX(sqrtSymmA, symmC.template selfadjointView<Lower>()*eiSymm.operatorInverseSqrt());\n\n  MatrixType id = MatrixType::Identity(rows, cols);\n  VERIFY_IS_APPROX(id.template selfadjointView<Lower>().operatorNorm(), RealScalar(1));\n\n  SelfAdjointEigenSolver<MatrixType> eiSymmUninitialized;\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.info());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvalues());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvectors());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorSqrt());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorInverseSqrt());\n\n  eiSymmUninitialized.compute(symmA, false);\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvectors());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorSqrt());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorInverseSqrt());\n\n  \/\/ test Tridiagonalization's methods\n  Tridiagonalization<MatrixType> tridiag(symmC);\n  VERIFY_IS_APPROX(tridiag.diagonal(), tridiag.matrixT().diagonal());\n  VERIFY_IS_APPROX(tridiag.subDiagonal(), tridiag.matrixT().template diagonal<-1>());\n  MatrixType T = tridiag.matrixT();\n  if(rows>1 && cols>1) {\n    \/\/ FIXME check that upper and lower part are 0:\n    \/\/VERIFY(T.topRightCorner(rows-2, cols-2).template triangularView<Upper>().isZero());\n  }\n  VERIFY_IS_APPROX(tridiag.diagonal(), T.diagonal().real());\n  VERIFY_IS_APPROX(tridiag.subDiagonal(), T.template diagonal<1>().real());\n  VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(tridiag.matrixQ()).adjoint());\n  VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT() * tridiag.matrixQ().adjoint());\n  \n  \/\/ Test computation of eigenvalues from tridiagonal matrix\n  if(rows > 1)\n  {\n    SelfAdjointEigenSolver<MatrixType> eiSymmTridiag;\n    eiSymmTridiag.computeFromTridiagonal(tridiag.matrixT().diagonal(), tridiag.matrixT().diagonal(-1), ComputeEigenvectors);\n    VERIFY_IS_APPROX(eiSymm.eigenvalues(), eiSymmTridiag.eigenvalues());\n    VERIFY_IS_APPROX(tridiag.matrixT(), eiSymmTridiag.eigenvectors().real() * eiSymmTridiag.eigenvalues().asDiagonal() * eiSymmTridiag.eigenvectors().real().transpose());\n  }\n\n  if (rows > 1)\n  {\n    \/\/ Test matrix with NaN\n    symmC(0,0) = std::numeric_limits<typename MatrixType::RealScalar>::quiet_NaN();\n    SelfAdjointEigenSolver<MatrixType> eiSymmNaN(symmC);\n    VERIFY_IS_EQUAL(eiSymmNaN.info(), NoConvergence);\n  }\n}\n\nvoid test_eigensolver_selfadjoint()\n{\n  int s = 0;\n  for(int i = 0; i < g_repeat; i++) {\n    \/\/ trivial test for 1x1 matrices:\n    CALL_SUBTEST_1( selfadjointeigensolver(Matrix<float, 1, 1>()));\n    CALL_SUBTEST_1( selfadjointeigensolver(Matrix<double, 1, 1>()));\n    \/\/ very important to test 3x3 and 2x2 matrices since we provide special paths for them\n    CALL_SUBTEST_12( selfadjointeigensolver(Matrix2f()) );\n    CALL_SUBTEST_12( selfadjointeigensolver(Matrix2d()) );\n    CALL_SUBTEST_13( selfadjointeigensolver(Matrix3f()) );\n    CALL_SUBTEST_13( selfadjointeigensolver(Matrix3d()) );\n    CALL_SUBTEST_2( selfadjointeigensolver(Matrix4d()) );\n    \n    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n    CALL_SUBTEST_3( selfadjointeigensolver(MatrixXf(s,s)) );\n    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(s,s)) );\n    CALL_SUBTEST_5( selfadjointeigensolver(MatrixXcd(s,s)) );\n    CALL_SUBTEST_9( selfadjointeigensolver(Matrix<std::complex<double>,Dynamic,Dynamic,RowMajor>(s,s)) );\n    TEST_SET_BUT_UNUSED_VARIABLE(s)\n\n    \/\/ some trivial but implementation-wise tricky cases\n    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(1,1)) );\n    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(2,2)) );\n    CALL_SUBTEST_6( selfadjointeigensolver(Matrix<double,1,1>()) );\n    CALL_SUBTEST_7( selfadjointeigensolver(Matrix<double,2,2>()) );\n  }\n\n  \/\/ Test problem size constructors\n  s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n  CALL_SUBTEST_8(SelfAdjointEigenSolver<MatrixXf> tmp1(s));\n  CALL_SUBTEST_8(Tridiagonalization<MatrixXf> tmp2(s));\n  \n  TEST_SET_BUT_UNUSED_VARIABLE(s)\n}\n\n<commit_msg>Add regression test for bugs 854 and 1014, and check that the eigenvector matrix is unitary.<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>\n\/\/ Copyright (C) 2010 Jitse Niesen <jitse@maths.leeds.ac.uk>\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#include \"svd_fill.h\"\n#include <limits>\n#include <Eigen\/Eigenvalues>\n\n\ntemplate<typename MatrixType> void selfadjointeigensolver_essential_check(const MatrixType& m)\n{\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename NumTraits<Scalar>::Real RealScalar;\n  RealScalar largerEps = 10*test_precision<RealScalar>();\n  \n  SelfAdjointEigenSolver<MatrixType> eiSymm(m);\n  VERIFY_IS_EQUAL(eiSymm.info(), Success);\n  VERIFY((m.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(\n          eiSymm.eigenvectors() * eiSymm.eigenvalues().asDiagonal(), largerEps));\n  VERIFY_IS_APPROX(m.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());\n  VERIFY_IS_UNITARY(eiSymm.eigenvectors());\n\n  SelfAdjointEigenSolver<MatrixType> eiDirect;\n  eiDirect.computeDirect(m);  \n  VERIFY_IS_EQUAL(eiDirect.info(), Success);\n  VERIFY((m.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(\n          eiDirect.eigenvectors() * eiDirect.eigenvalues().asDiagonal(), largerEps));\n  VERIFY_IS_APPROX(m.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues());\n  VERIFY_IS_UNITARY(eiDirect.eigenvectors());\n}\n\ntemplate<typename MatrixType> void selfadjointeigensolver(const MatrixType& m)\n{\n  typedef typename MatrixType::Index Index;\n  \/* this test covers the following files:\n     EigenSolver.h, SelfAdjointEigenSolver.h (and indirectly: Tridiagonalization.h)\n  *\/\n  Index rows = m.rows();\n  Index cols = m.cols();\n\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename NumTraits<Scalar>::Real RealScalar;\n\n  RealScalar largerEps = 10*test_precision<RealScalar>();\n\n  MatrixType a = MatrixType::Random(rows,cols);\n  MatrixType a1 = MatrixType::Random(rows,cols);\n  MatrixType symmA =  a.adjoint() * a + a1.adjoint() * a1;\n  MatrixType symmC = symmA;\n  \n  svd_fill_random(symmA,Symmetric);\n\n  symmA.template triangularView<StrictlyUpper>().setZero();\n  symmC.template triangularView<StrictlyUpper>().setZero();\n\n  MatrixType b = MatrixType::Random(rows,cols);\n  MatrixType b1 = MatrixType::Random(rows,cols);\n  MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1;\n  symmB.template triangularView<StrictlyUpper>().setZero();\n  \n  CALL_SUBTEST( selfadjointeigensolver_essential_check(symmA) );\n\n  SelfAdjointEigenSolver<MatrixType> eiSymm(symmA);\n  \/\/ generalized eigen pb\n  GeneralizedSelfAdjointEigenSolver<MatrixType> eiSymmGen(symmC, symmB);\n\n  SelfAdjointEigenSolver<MatrixType> eiSymmNoEivecs(symmA, false);\n  VERIFY_IS_EQUAL(eiSymmNoEivecs.info(), Success);\n  VERIFY_IS_APPROX(eiSymm.eigenvalues(), eiSymmNoEivecs.eigenvalues());\n  \n  \/\/ generalized eigen problem Ax = lBx\n  eiSymmGen.compute(symmC, symmB,Ax_lBx);\n  VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n  VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(\n          symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n  \/\/ generalized eigen problem BAx = lx\n  eiSymmGen.compute(symmC, symmB,BAx_lx);\n  VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n  VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(\n         (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n  \/\/ generalized eigen problem ABx = lx\n  eiSymmGen.compute(symmC, symmB,ABx_lx);\n  VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n  VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(\n         (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n\n  eiSymm.compute(symmC);\n  MatrixType sqrtSymmA = eiSymm.operatorSqrt();\n  VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), sqrtSymmA*sqrtSymmA);\n  VERIFY_IS_APPROX(sqrtSymmA, symmC.template selfadjointView<Lower>()*eiSymm.operatorInverseSqrt());\n\n  MatrixType id = MatrixType::Identity(rows, cols);\n  VERIFY_IS_APPROX(id.template selfadjointView<Lower>().operatorNorm(), RealScalar(1));\n\n  SelfAdjointEigenSolver<MatrixType> eiSymmUninitialized;\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.info());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvalues());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvectors());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorSqrt());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorInverseSqrt());\n\n  eiSymmUninitialized.compute(symmA, false);\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvectors());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorSqrt());\n  VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorInverseSqrt());\n\n  \/\/ test Tridiagonalization's methods\n  Tridiagonalization<MatrixType> tridiag(symmC);\n  VERIFY_IS_APPROX(tridiag.diagonal(), tridiag.matrixT().diagonal());\n  VERIFY_IS_APPROX(tridiag.subDiagonal(), tridiag.matrixT().template diagonal<-1>());\n  MatrixType T = tridiag.matrixT();\n  if(rows>1 && cols>1) {\n    \/\/ FIXME check that upper and lower part are 0:\n    \/\/VERIFY(T.topRightCorner(rows-2, cols-2).template triangularView<Upper>().isZero());\n  }\n  VERIFY_IS_APPROX(tridiag.diagonal(), T.diagonal().real());\n  VERIFY_IS_APPROX(tridiag.subDiagonal(), T.template diagonal<1>().real());\n  VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(tridiag.matrixQ()).adjoint());\n  VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT() * tridiag.matrixQ().adjoint());\n  \n  \/\/ Test computation of eigenvalues from tridiagonal matrix\n  if(rows > 1)\n  {\n    SelfAdjointEigenSolver<MatrixType> eiSymmTridiag;\n    eiSymmTridiag.computeFromTridiagonal(tridiag.matrixT().diagonal(), tridiag.matrixT().diagonal(-1), ComputeEigenvectors);\n    VERIFY_IS_APPROX(eiSymm.eigenvalues(), eiSymmTridiag.eigenvalues());\n    VERIFY_IS_APPROX(tridiag.matrixT(), eiSymmTridiag.eigenvectors().real() * eiSymmTridiag.eigenvalues().asDiagonal() * eiSymmTridiag.eigenvectors().real().transpose());\n  }\n\n  if (rows > 1)\n  {\n    \/\/ Test matrix with NaN\n    symmC(0,0) = std::numeric_limits<typename MatrixType::RealScalar>::quiet_NaN();\n    SelfAdjointEigenSolver<MatrixType> eiSymmNaN(symmC);\n    VERIFY_IS_EQUAL(eiSymmNaN.info(), NoConvergence);\n  }\n}\n\nvoid bug_854()\n{\n  Matrix3d m;\n  m << 850.961, 51.966, 0,\n       51.966, 254.841, 0,\n            0,       0, 0;\n  selfadjointeigensolver_essential_check(m);\n}\n\nvoid bug_1014()\n{\n  Matrix3d m;\n  m <<        0.11111111111111114658, 0, 0,\n       0,     0.11111111111111109107, 0,\n       0, 0,  0.11111111111111107719;\n  selfadjointeigensolver_essential_check(m);\n}\n\nvoid test_eigensolver_selfadjoint()\n{\n  int s = 0;\n  for(int i = 0; i < g_repeat; i++) {\n    \/\/ trivial test for 1x1 matrices:\n    CALL_SUBTEST_1( selfadjointeigensolver(Matrix<float, 1, 1>()));\n    CALL_SUBTEST_1( selfadjointeigensolver(Matrix<double, 1, 1>()));\n    \/\/ very important to test 3x3 and 2x2 matrices since we provide special paths for them\n    CALL_SUBTEST_12( selfadjointeigensolver(Matrix2f()) );\n    CALL_SUBTEST_12( selfadjointeigensolver(Matrix2d()) );\n    CALL_SUBTEST_13( selfadjointeigensolver(Matrix3f()) );\n    CALL_SUBTEST_13( selfadjointeigensolver(Matrix3d()) );\n    CALL_SUBTEST_2( selfadjointeigensolver(Matrix4d()) );\n    \n    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n    CALL_SUBTEST_3( selfadjointeigensolver(MatrixXf(s,s)) );\n    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(s,s)) );\n    CALL_SUBTEST_5( selfadjointeigensolver(MatrixXcd(s,s)) );\n    CALL_SUBTEST_9( selfadjointeigensolver(Matrix<std::complex<double>,Dynamic,Dynamic,RowMajor>(s,s)) );\n    TEST_SET_BUT_UNUSED_VARIABLE(s)\n\n    \/\/ some trivial but implementation-wise tricky cases\n    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(1,1)) );\n    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(2,2)) );\n    CALL_SUBTEST_6( selfadjointeigensolver(Matrix<double,1,1>()) );\n    CALL_SUBTEST_7( selfadjointeigensolver(Matrix<double,2,2>()) );\n  }\n  \n  CALL_SUBTEST_13( bug_854() );\n  CALL_SUBTEST_13( bug_1014() );\n\n  \/\/ Test problem size constructors\n  s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n  CALL_SUBTEST_8(SelfAdjointEigenSolver<MatrixXf> tmp1(s));\n  CALL_SUBTEST_8(Tridiagonalization<MatrixXf> tmp2(s));\n  \n  TEST_SET_BUT_UNUSED_VARIABLE(s)\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2004-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\/** @file\n * Device model for an IDE disk\n *\/\n\n#ifndef __IDE_DISK_HH__\n#define __IDE_DISK_HH__\n\n#include \"base\/statistics.hh\"\n#include \"dev\/disk_image.hh\"\n#include \"dev\/ide_atareg.h\"\n#include \"dev\/ide_ctrl.hh\"\n#include \"dev\/ide_wdcreg.h\"\n#include \"dev\/io_device.hh\"\n#include \"sim\/eventq.hh\"\n\n#define DMA_BACKOFF_PERIOD 200\n\n#define MAX_DMA_SIZE    (65536)  \/\/ 64K\n#define MAX_MULTSECT    (128)\n\n#define PRD_BASE_MASK  0xfffffffe\n#define PRD_COUNT_MASK 0xfffe\n#define PRD_EOT_MASK   0x8000\n\ntypedef struct PrdEntry {\n    uint32_t baseAddr;\n    uint16_t byteCount;\n    uint16_t endOfTable;\n} PrdEntry_t;\n\nclass PrdTableEntry {\n  public:\n    PrdEntry_t entry;\n\n    uint32_t getBaseAddr()\n    {\n        return (entry.baseAddr & PRD_BASE_MASK);\n    }\n\n    uint32_t getByteCount()\n    {\n        return ((entry.byteCount == 0) ? MAX_DMA_SIZE :\n                (entry.byteCount & PRD_COUNT_MASK));\n    }\n\n    uint16_t getEOT()\n    {\n        return (entry.endOfTable & PRD_EOT_MASK);\n    }\n};\n\n#define DATA_OFFSET     (0)\n#define ERROR_OFFSET    (1)\n#define FEATURES_OFFSET (1)\n#define NSECTOR_OFFSET  (2)\n#define SECTOR_OFFSET   (3)\n#define LCYL_OFFSET     (4)\n#define HCYL_OFFSET     (5)\n#define SELECT_OFFSET   (6)\n#define DRIVE_OFFSET    (6)\n#define STATUS_OFFSET   (7)\n#define COMMAND_OFFSET  (7)\n\n#define CONTROL_OFFSET  (2)\n#define ALTSTAT_OFFSET  (2)\n\n#define SELECT_DEV_BIT  0x10\n#define CONTROL_RST_BIT 0x04\n#define CONTROL_IEN_BIT 0x02\n#define STATUS_BSY_BIT  0x80\n#define STATUS_DRDY_BIT 0x40\n#define STATUS_DRQ_BIT  0x08\n#define STATUS_SEEK_BIT 0x10\n#define STATUS_DF_BIT   0x20\n#define DRIVE_LBA_BIT   0x40\n\n#define DEV0 (0)\n#define DEV1 (1)\n\ntypedef struct CommandReg {\n    uint16_t data;\n    uint8_t error;\n    uint8_t sec_count;\n    uint8_t sec_num;\n    uint8_t cyl_low;\n    uint8_t cyl_high;\n    union {\n        uint8_t drive;\n        uint8_t head;\n    };\n    uint8_t command;\n} CommandReg_t;\n\ntypedef enum Events {\n    None = 0,\n    Transfer,\n    ReadWait,\n    WriteWait,\n    PrdRead,\n    DmaRead,\n    DmaWrite\n} Events_t;\n\ntypedef enum DevAction {\n    ACT_NONE = 0,\n    ACT_CMD_WRITE,\n    ACT_CMD_COMPLETE,\n    ACT_CMD_ERROR,\n    ACT_SELECT_WRITE,\n    ACT_STAT_READ,\n    ACT_DATA_READY,\n    ACT_DATA_READ_BYTE,\n    ACT_DATA_READ_SHORT,\n    ACT_DATA_WRITE_BYTE,\n    ACT_DATA_WRITE_SHORT,\n    ACT_DMA_READY,\n    ACT_DMA_DONE,\n    ACT_SRST_SET,\n    ACT_SRST_CLEAR\n} DevAction_t;\n\ntypedef enum DevState {\n    \/\/ Device idle\n    Device_Idle_S = 0,\n    Device_Idle_SI,\n    Device_Idle_NS,\n\n    \/\/ Software reset\n    Device_Srst,\n\n    \/\/ Non-data commands\n    Command_Execution,\n\n    \/\/ PIO data-in (data to host)\n    Prepare_Data_In,\n    Data_Ready_INTRQ_In,\n    Transfer_Data_In,\n\n    \/\/ PIO data-out (data from host)\n    Prepare_Data_Out,\n    Data_Ready_INTRQ_Out,\n    Transfer_Data_Out,\n\n    \/\/ DMA protocol\n    Prepare_Data_Dma,\n    Transfer_Data_Dma\n} DevState_t;\n\ntypedef enum DmaState {\n    Dma_Idle = 0,\n    Dma_Start,\n    Dma_Transfer\n} DmaState_t;\n\nclass PhysicalMemory;\nclass IdeController;\n\n\/**\n * IDE Disk device model\n *\/\nclass IdeDisk : public SimObject\n{\n  protected:\n    \/** The IDE controller for this disk. *\/\n    IdeController *ctrl;\n    \/** The DMA interface to use for transfers *\/\n    DMAInterface<Bus> *dmaInterface;\n    \/** The image that contains the data of this disk. *\/\n    DiskImage *image;\n    \/** Pointer to physical memory for DMA transfers *\/\n    PhysicalMemory *physmem;\n\n  protected:\n    \/** The disk delay in microseconds. *\/\n    int diskDelay;\n\n  private:\n    \/** Drive identification structure for this disk *\/\n    struct ataparams driveID;\n    \/** Data buffer for transfers *\/\n    uint8_t *dataBuffer;\n    \/** Number of bytes in command data transfer *\/\n    uint32_t cmdBytes;\n    \/** Number of bytes left in command data transfer *\/\n    uint32_t cmdBytesLeft;\n    \/** Number of bytes left in DRQ block *\/\n    uint32_t drqBytesLeft;\n    \/** Current sector in access *\/\n    uint32_t curSector;\n    \/** Command block registers *\/\n    CommandReg_t cmdReg;\n    \/** Status register *\/\n    uint8_t status;\n    \/** Interrupt enable bit *\/\n    bool nIENBit;\n    \/** Device state *\/\n    DevState_t devState;\n    \/** Dma state *\/\n    DmaState_t dmaState;\n    \/** Dma transaction is a read *\/\n    bool dmaRead;\n    \/** PRD table base address *\/\n    uint32_t curPrdAddr;\n    \/** PRD entry *\/\n    PrdTableEntry curPrd;\n    \/** Number of bytes transfered by DMA interface for current transfer *\/\n    uint32_t dmaInterfaceBytes;\n    \/** Device ID (master=0\/slave=1) *\/\n    int devID;\n    \/** Interrupt pending *\/\n    bool intrPending;\n\n    Stats::Scalar<> dmaReadFullPages;\n    Stats::Scalar<> dmaReadBytes;\n    Stats::Scalar<> dmaReadTxs;\n    Stats::Scalar<> dmaWriteFullPages;\n    Stats::Scalar<> dmaWriteBytes;\n    Stats::Scalar<> dmaWriteTxs;\n\n  public:\n    \/**\n     * Create and initialize this Disk.\n     * @param name The name of this disk.\n     * @param img The disk image of this disk.\n     * @param phys Pointer to physical memory\n     * @param id The disk ID (master=0\/slave=1)\n     * @param disk_delay The disk delay in milliseconds\n     *\/\n    IdeDisk(const std::string &name, DiskImage *img, PhysicalMemory *phys,\n            int id, Tick disk_delay);\n\n    \/**\n     * Delete the data buffer.\n     *\/\n    ~IdeDisk();\n\n    \/**\n     * Reset the device state\n     *\/\n    void reset(int id);\n\n    \/**\n     * Register statistics.\n     *\/\n    void regStats();\n\n\n    \/**\n     * Set the controller for this device\n     * @param c The IDE controller\n     *\/\n    void setController(IdeController *c, DMAInterface<Bus> *dmaIntr) {\n        if (ctrl) panic(\"Cannot change the controller once set!\\n\");\n        ctrl = c;\n        dmaInterface = dmaIntr;\n    }\n\n    \/\/ Device register read\/write\n    void read(const Addr &offset, IdeRegType regtype, uint8_t *data);\n    void write(const Addr &offset, IdeRegType regtype, const uint8_t *data);\n\n    \/\/ Start\/abort functions\n    void startDma(const uint32_t &prdTableBase);\n    void abortDma();\n\n  private:\n    void startCommand();\n\n    \/\/ Interrupt management\n    void intrPost();\n    void intrClear();\n\n    \/\/ DMA stuff\n    void doDmaTransfer();\n    friend class EventWrapper<IdeDisk, &IdeDisk::doDmaTransfer>;\n    EventWrapper<IdeDisk, &IdeDisk::doDmaTransfer> dmaTransferEvent;\n\n    void doDmaRead();\n    friend class EventWrapper<IdeDisk, &IdeDisk::doDmaRead>;\n    EventWrapper<IdeDisk, &IdeDisk::doDmaRead> dmaReadWaitEvent;\n\n    void doDmaWrite();\n    friend class EventWrapper<IdeDisk, &IdeDisk::doDmaWrite>;\n    EventWrapper<IdeDisk, &IdeDisk::doDmaWrite> dmaWriteWaitEvent;\n\n    void dmaPrdReadDone();\n    friend class EventWrapper<IdeDisk, &IdeDisk::dmaPrdReadDone>;\n    EventWrapper<IdeDisk, &IdeDisk::dmaPrdReadDone> dmaPrdReadEvent;\n\n    void dmaReadDone();\n    friend class EventWrapper<IdeDisk, &IdeDisk::dmaReadDone>;\n    EventWrapper<IdeDisk, &IdeDisk::dmaReadDone> dmaReadEvent;\n\n    void dmaWriteDone();\n    friend class EventWrapper<IdeDisk, &IdeDisk::dmaWriteDone>;\n    EventWrapper<IdeDisk, &IdeDisk::dmaWriteDone> dmaWriteEvent;\n\n    \/\/ Disk image read\/write\n    void readDisk(uint32_t sector, uint8_t *data);\n    void writeDisk(uint32_t sector, uint8_t *data);\n\n    \/\/ State machine management\n    void updateState(DevAction_t action);\n\n    \/\/ Utility functions\n    bool isBSYSet() { return (status & STATUS_BSY_BIT); }\n    bool isIENSet() { return nIENBit; }\n    bool isDEVSelect();\n\n    void setComplete()\n    {\n        \/\/ clear out the status byte\n        status = 0;\n        \/\/ set the DRDY bit\n        status |= STATUS_DRDY_BIT;\n        \/\/ set the SEEK bit\n        status |= STATUS_SEEK_BIT;\n    }\n\n    uint32_t getLBABase()\n    {\n        return  (Addr)(((cmdReg.head & 0xf) << 24) | (cmdReg.cyl_high << 16) |\n                       (cmdReg.cyl_low << 8) | (cmdReg.sec_num));\n    }\n\n    inline Addr pciToDma(Addr pciAddr);\n\n    uint32_t bytesInDmaPage(Addr curAddr, uint32_t bytesLeft);\n\n    \/**\n     * Serialize this object to the given output stream.\n     * @param os The stream to serialize to.\n     *\/\n    void serialize(std::ostream &os);\n\n    \/**\n     * Reconstruct the state of this object from a checkpoint.\n     * @param cp The checkpoint to use.\n     * @param section The section name describing this object.\n     *\/\n    void unserialize(Checkpoint *cp, const std::string &section);\n};\n\n\n#endif \/\/ __IDE_DISK_HH__\n<commit_msg>make the dma buffer equal to the max  dma size<commit_after>\/*\n * Copyright (c) 2004-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\/** @file\n * Device model for an IDE disk\n *\/\n\n#ifndef __IDE_DISK_HH__\n#define __IDE_DISK_HH__\n\n#include \"base\/statistics.hh\"\n#include \"dev\/disk_image.hh\"\n#include \"dev\/ide_atareg.h\"\n#include \"dev\/ide_ctrl.hh\"\n#include \"dev\/ide_wdcreg.h\"\n#include \"dev\/io_device.hh\"\n#include \"sim\/eventq.hh\"\n\n#define DMA_BACKOFF_PERIOD 200\n\n#define MAX_DMA_SIZE    (131072)  \/\/ 128K\n#define MAX_MULTSECT    (128)\n\n#define PRD_BASE_MASK  0xfffffffe\n#define PRD_COUNT_MASK 0xfffe\n#define PRD_EOT_MASK   0x8000\n\ntypedef struct PrdEntry {\n    uint32_t baseAddr;\n    uint16_t byteCount;\n    uint16_t endOfTable;\n} PrdEntry_t;\n\nclass PrdTableEntry {\n  public:\n    PrdEntry_t entry;\n\n    uint32_t getBaseAddr()\n    {\n        return (entry.baseAddr & PRD_BASE_MASK);\n    }\n\n    uint32_t getByteCount()\n    {\n        return ((entry.byteCount == 0) ? MAX_DMA_SIZE :\n                (entry.byteCount & PRD_COUNT_MASK));\n    }\n\n    uint16_t getEOT()\n    {\n        return (entry.endOfTable & PRD_EOT_MASK);\n    }\n};\n\n#define DATA_OFFSET     (0)\n#define ERROR_OFFSET    (1)\n#define FEATURES_OFFSET (1)\n#define NSECTOR_OFFSET  (2)\n#define SECTOR_OFFSET   (3)\n#define LCYL_OFFSET     (4)\n#define HCYL_OFFSET     (5)\n#define SELECT_OFFSET   (6)\n#define DRIVE_OFFSET    (6)\n#define STATUS_OFFSET   (7)\n#define COMMAND_OFFSET  (7)\n\n#define CONTROL_OFFSET  (2)\n#define ALTSTAT_OFFSET  (2)\n\n#define SELECT_DEV_BIT  0x10\n#define CONTROL_RST_BIT 0x04\n#define CONTROL_IEN_BIT 0x02\n#define STATUS_BSY_BIT  0x80\n#define STATUS_DRDY_BIT 0x40\n#define STATUS_DRQ_BIT  0x08\n#define STATUS_SEEK_BIT 0x10\n#define STATUS_DF_BIT   0x20\n#define DRIVE_LBA_BIT   0x40\n\n#define DEV0 (0)\n#define DEV1 (1)\n\ntypedef struct CommandReg {\n    uint16_t data;\n    uint8_t error;\n    uint8_t sec_count;\n    uint8_t sec_num;\n    uint8_t cyl_low;\n    uint8_t cyl_high;\n    union {\n        uint8_t drive;\n        uint8_t head;\n    };\n    uint8_t command;\n} CommandReg_t;\n\ntypedef enum Events {\n    None = 0,\n    Transfer,\n    ReadWait,\n    WriteWait,\n    PrdRead,\n    DmaRead,\n    DmaWrite\n} Events_t;\n\ntypedef enum DevAction {\n    ACT_NONE = 0,\n    ACT_CMD_WRITE,\n    ACT_CMD_COMPLETE,\n    ACT_CMD_ERROR,\n    ACT_SELECT_WRITE,\n    ACT_STAT_READ,\n    ACT_DATA_READY,\n    ACT_DATA_READ_BYTE,\n    ACT_DATA_READ_SHORT,\n    ACT_DATA_WRITE_BYTE,\n    ACT_DATA_WRITE_SHORT,\n    ACT_DMA_READY,\n    ACT_DMA_DONE,\n    ACT_SRST_SET,\n    ACT_SRST_CLEAR\n} DevAction_t;\n\ntypedef enum DevState {\n    \/\/ Device idle\n    Device_Idle_S = 0,\n    Device_Idle_SI,\n    Device_Idle_NS,\n\n    \/\/ Software reset\n    Device_Srst,\n\n    \/\/ Non-data commands\n    Command_Execution,\n\n    \/\/ PIO data-in (data to host)\n    Prepare_Data_In,\n    Data_Ready_INTRQ_In,\n    Transfer_Data_In,\n\n    \/\/ PIO data-out (data from host)\n    Prepare_Data_Out,\n    Data_Ready_INTRQ_Out,\n    Transfer_Data_Out,\n\n    \/\/ DMA protocol\n    Prepare_Data_Dma,\n    Transfer_Data_Dma\n} DevState_t;\n\ntypedef enum DmaState {\n    Dma_Idle = 0,\n    Dma_Start,\n    Dma_Transfer\n} DmaState_t;\n\nclass PhysicalMemory;\nclass IdeController;\n\n\/**\n * IDE Disk device model\n *\/\nclass IdeDisk : public SimObject\n{\n  protected:\n    \/** The IDE controller for this disk. *\/\n    IdeController *ctrl;\n    \/** The DMA interface to use for transfers *\/\n    DMAInterface<Bus> *dmaInterface;\n    \/** The image that contains the data of this disk. *\/\n    DiskImage *image;\n    \/** Pointer to physical memory for DMA transfers *\/\n    PhysicalMemory *physmem;\n\n  protected:\n    \/** The disk delay in microseconds. *\/\n    int diskDelay;\n\n  private:\n    \/** Drive identification structure for this disk *\/\n    struct ataparams driveID;\n    \/** Data buffer for transfers *\/\n    uint8_t *dataBuffer;\n    \/** Number of bytes in command data transfer *\/\n    uint32_t cmdBytes;\n    \/** Number of bytes left in command data transfer *\/\n    uint32_t cmdBytesLeft;\n    \/** Number of bytes left in DRQ block *\/\n    uint32_t drqBytesLeft;\n    \/** Current sector in access *\/\n    uint32_t curSector;\n    \/** Command block registers *\/\n    CommandReg_t cmdReg;\n    \/** Status register *\/\n    uint8_t status;\n    \/** Interrupt enable bit *\/\n    bool nIENBit;\n    \/** Device state *\/\n    DevState_t devState;\n    \/** Dma state *\/\n    DmaState_t dmaState;\n    \/** Dma transaction is a read *\/\n    bool dmaRead;\n    \/** PRD table base address *\/\n    uint32_t curPrdAddr;\n    \/** PRD entry *\/\n    PrdTableEntry curPrd;\n    \/** Number of bytes transfered by DMA interface for current transfer *\/\n    uint32_t dmaInterfaceBytes;\n    \/** Device ID (master=0\/slave=1) *\/\n    int devID;\n    \/** Interrupt pending *\/\n    bool intrPending;\n\n    Stats::Scalar<> dmaReadFullPages;\n    Stats::Scalar<> dmaReadBytes;\n    Stats::Scalar<> dmaReadTxs;\n    Stats::Scalar<> dmaWriteFullPages;\n    Stats::Scalar<> dmaWriteBytes;\n    Stats::Scalar<> dmaWriteTxs;\n\n  public:\n    \/**\n     * Create and initialize this Disk.\n     * @param name The name of this disk.\n     * @param img The disk image of this disk.\n     * @param phys Pointer to physical memory\n     * @param id The disk ID (master=0\/slave=1)\n     * @param disk_delay The disk delay in milliseconds\n     *\/\n    IdeDisk(const std::string &name, DiskImage *img, PhysicalMemory *phys,\n            int id, Tick disk_delay);\n\n    \/**\n     * Delete the data buffer.\n     *\/\n    ~IdeDisk();\n\n    \/**\n     * Reset the device state\n     *\/\n    void reset(int id);\n\n    \/**\n     * Register statistics.\n     *\/\n    void regStats();\n\n\n    \/**\n     * Set the controller for this device\n     * @param c The IDE controller\n     *\/\n    void setController(IdeController *c, DMAInterface<Bus> *dmaIntr) {\n        if (ctrl) panic(\"Cannot change the controller once set!\\n\");\n        ctrl = c;\n        dmaInterface = dmaIntr;\n    }\n\n    \/\/ Device register read\/write\n    void read(const Addr &offset, IdeRegType regtype, uint8_t *data);\n    void write(const Addr &offset, IdeRegType regtype, const uint8_t *data);\n\n    \/\/ Start\/abort functions\n    void startDma(const uint32_t &prdTableBase);\n    void abortDma();\n\n  private:\n    void startCommand();\n\n    \/\/ Interrupt management\n    void intrPost();\n    void intrClear();\n\n    \/\/ DMA stuff\n    void doDmaTransfer();\n    friend class EventWrapper<IdeDisk, &IdeDisk::doDmaTransfer>;\n    EventWrapper<IdeDisk, &IdeDisk::doDmaTransfer> dmaTransferEvent;\n\n    void doDmaRead();\n    friend class EventWrapper<IdeDisk, &IdeDisk::doDmaRead>;\n    EventWrapper<IdeDisk, &IdeDisk::doDmaRead> dmaReadWaitEvent;\n\n    void doDmaWrite();\n    friend class EventWrapper<IdeDisk, &IdeDisk::doDmaWrite>;\n    EventWrapper<IdeDisk, &IdeDisk::doDmaWrite> dmaWriteWaitEvent;\n\n    void dmaPrdReadDone();\n    friend class EventWrapper<IdeDisk, &IdeDisk::dmaPrdReadDone>;\n    EventWrapper<IdeDisk, &IdeDisk::dmaPrdReadDone> dmaPrdReadEvent;\n\n    void dmaReadDone();\n    friend class EventWrapper<IdeDisk, &IdeDisk::dmaReadDone>;\n    EventWrapper<IdeDisk, &IdeDisk::dmaReadDone> dmaReadEvent;\n\n    void dmaWriteDone();\n    friend class EventWrapper<IdeDisk, &IdeDisk::dmaWriteDone>;\n    EventWrapper<IdeDisk, &IdeDisk::dmaWriteDone> dmaWriteEvent;\n\n    \/\/ Disk image read\/write\n    void readDisk(uint32_t sector, uint8_t *data);\n    void writeDisk(uint32_t sector, uint8_t *data);\n\n    \/\/ State machine management\n    void updateState(DevAction_t action);\n\n    \/\/ Utility functions\n    bool isBSYSet() { return (status & STATUS_BSY_BIT); }\n    bool isIENSet() { return nIENBit; }\n    bool isDEVSelect();\n\n    void setComplete()\n    {\n        \/\/ clear out the status byte\n        status = 0;\n        \/\/ set the DRDY bit\n        status |= STATUS_DRDY_BIT;\n        \/\/ set the SEEK bit\n        status |= STATUS_SEEK_BIT;\n    }\n\n    uint32_t getLBABase()\n    {\n        return  (Addr)(((cmdReg.head & 0xf) << 24) | (cmdReg.cyl_high << 16) |\n                       (cmdReg.cyl_low << 8) | (cmdReg.sec_num));\n    }\n\n    inline Addr pciToDma(Addr pciAddr);\n\n    uint32_t bytesInDmaPage(Addr curAddr, uint32_t bytesLeft);\n\n    \/**\n     * Serialize this object to the given output stream.\n     * @param os The stream to serialize to.\n     *\/\n    void serialize(std::ostream &os);\n\n    \/**\n     * Reconstruct the state of this object from a checkpoint.\n     * @param cp The checkpoint to use.\n     * @param section The section name describing this object.\n     *\/\n    void unserialize(Checkpoint *cp, const std::string &section);\n};\n\n\n#endif \/\/ __IDE_DISK_HH__\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of the Polkit-qt project\n * Copyright (C) 2009 Jaroslav Reznik <jreznik@redhat.com>\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 \"subject.h\"\n\n#include <polkit\/polkit.h>\n\nusing namespace PolkitQt;\n\nclass Subject::Private\n{\n    public:\n        Private(PolkitSubject *s) :subject(s) {}\n\n        PolkitSubject *subject;\n};\n\nSubject::Subject()\n        : d(new Private(0))\n{\n    g_type_init();\n}\n\nSubject::Subject(PolkitSubject *subject)\n        : d(new Private(subject))\n{\n    g_type_init();\n}\n\nSubject::~Subject()\n{\n    g_object_unref(d->subject);\n}\n\nPolkitSubject * Subject::subject() const\n{\n    return d->subject;\n}\n\nQString Subject::toString() const\n{\n    Q_ASSERT(d->subject);\n    return QString::fromUtf8(polkit_subject_to_string(d->subject));\n}\n\nSubject * Subject::fromString(const QString & string)\n{\n   \/\/ should be in polkit library!!! but for strange reason it's neccessary to have it here\n    g_type_init();\n\n    Subject *subject = new Subject();\n    GError *error = NULL;\n    subject->d->subject = polkit_subject_from_string(string.toUtf8().data(), &error);\n    if (error != NULL)\n    {\n        return NULL;\n    }\n    return subject;\n}\n\nUnixProcess::UnixProcess(qint64 pid)\n        : Subject()\n{\n    setSubject(polkit_unix_process_new(pid));\n}\n\nUnixProcess::UnixProcess(qint64 pid, quint64 startTime)\n        : Subject()\n{\n    setSubject(polkit_unix_process_new_full(pid, startTime));\n}\n\nUnixProcess::UnixProcess(PolkitUnixProcess *pkUnixProcess)\n        : Subject((PolkitSubject *)pkUnixProcess)\n{\n\n}\n\nqint64 UnixProcess::pid() const\n{\n    return polkit_unix_process_get_pid((PolkitUnixProcess *) subject());\n}\n\nqint64 UnixProcess::startTime() const\n{\n    return polkit_unix_process_get_start_time((PolkitUnixProcess *) subject());\n}\n\nvoid UnixProcess::setPid(qint64 pid)\n{\n    polkit_unix_process_set_pid((PolkitUnixProcess *) subject(), pid);\n}\n\n\/\/ ----- SystemBusName\nSystemBusName::SystemBusName(const QString &name)\n        : Subject()\n{\n    setSubject(polkit_system_bus_name_new(name.toUtf8().data()));\n}\n\nSystemBusName::SystemBusName(PolkitSystemBusName *pkSystemBusName)\n        : Subject((PolkitSubject *) pkSystemBusName)\n{\n\n}\n\nQString SystemBusName::name() const\n{\n    return QString::fromUtf8(polkit_system_bus_name_get_name((PolkitSystemBusName *) subject()));\n}\n\nvoid SystemBusName::setName(const QString &name)\n{\n    polkit_system_bus_name_set_name((PolkitSystemBusName *) subject(), name.toUtf8().data());\n}\n\n\/\/ ----- SystemSession\nUnixSession::UnixSession(const QString &sessionId)\n        : Subject()\n{\n    setSubject(polkit_unix_session_new(sessionId.toUtf8().data()));\n}\n\nUnixSession::UnixSession(qint64 pid)\n        : Subject()\n{\n    \/\/ TODO: error handling\n    setSubject(polkit_unix_session_new_for_process_sync(pid, NULL, NULL));\n}\n\nUnixSession::UnixSession(PolkitSystemBusName *pkUnixSession)\n        : Subject((PolkitSubject *) pkUnixSession)\n{\n\n}\n\nQString UnixSession::sessionId() const\n{\n    return QString::fromUtf8(polkit_unix_session_get_session_id((PolkitUnixSession *) subject()));\n}\n\nvoid UnixSession::setSessionId(const QString &sessionId)\n{\n    polkit_unix_session_set_session_id((PolkitUnixSession *) subject(), sessionId.toUtf8().data());\n}\n<commit_msg>Implement missing function<commit_after>\/*\n * This file is part of the Polkit-qt project\n * Copyright (C) 2009 Jaroslav Reznik <jreznik@redhat.com>\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 \"subject.h\"\n\n#include <polkit\/polkit.h>\n\nusing namespace PolkitQt;\n\nclass Subject::Private\n{\n    public:\n        Private(PolkitSubject *s) :subject(s) {}\n\n        PolkitSubject *subject;\n};\n\nSubject::Subject()\n        : d(new Private(0))\n{\n    g_type_init();\n}\n\nSubject::Subject(PolkitSubject *subject)\n        : d(new Private(subject))\n{\n    g_type_init();\n}\n\nSubject::~Subject()\n{\n    g_object_unref(d->subject);\n}\n\nPolkitSubject * Subject::subject() const\n{\n    return d->subject;\n}\n\nvoid Subject::setSubject(PolkitSubject* subject)\n{\n    d->subject = subject;\n}\n\nQString Subject::toString() const\n{\n    Q_ASSERT(d->subject);\n    return QString::fromUtf8(polkit_subject_to_string(d->subject));\n}\n\nSubject * Subject::fromString(const QString & string)\n{\n   \/\/ should be in polkit library!!! but for strange reason it's neccessary to have it here\n    g_type_init();\n\n    Subject *subject = new Subject();\n    GError *error = NULL;\n    subject->d->subject = polkit_subject_from_string(string.toUtf8().data(), &error);\n    if (error != NULL)\n    {\n        return NULL;\n    }\n    return subject;\n}\n\nUnixProcess::UnixProcess(qint64 pid)\n        : Subject()\n{\n    setSubject(polkit_unix_process_new(pid));\n}\n\nUnixProcess::UnixProcess(qint64 pid, quint64 startTime)\n        : Subject()\n{\n    setSubject(polkit_unix_process_new_full(pid, startTime));\n}\n\nUnixProcess::UnixProcess(PolkitUnixProcess *pkUnixProcess)\n        : Subject((PolkitSubject *)pkUnixProcess)\n{\n\n}\n\nqint64 UnixProcess::pid() const\n{\n    return polkit_unix_process_get_pid((PolkitUnixProcess *) subject());\n}\n\nqint64 UnixProcess::startTime() const\n{\n    return polkit_unix_process_get_start_time((PolkitUnixProcess *) subject());\n}\n\nvoid UnixProcess::setPid(qint64 pid)\n{\n    polkit_unix_process_set_pid((PolkitUnixProcess *) subject(), pid);\n}\n\n\/\/ ----- SystemBusName\nSystemBusName::SystemBusName(const QString &name)\n        : Subject()\n{\n    setSubject(polkit_system_bus_name_new(name.toUtf8().data()));\n}\n\nSystemBusName::SystemBusName(PolkitSystemBusName *pkSystemBusName)\n        : Subject((PolkitSubject *) pkSystemBusName)\n{\n\n}\n\nQString SystemBusName::name() const\n{\n    return QString::fromUtf8(polkit_system_bus_name_get_name((PolkitSystemBusName *) subject()));\n}\n\nvoid SystemBusName::setName(const QString &name)\n{\n    polkit_system_bus_name_set_name((PolkitSystemBusName *) subject(), name.toUtf8().data());\n}\n\n\/\/ ----- SystemSession\nUnixSession::UnixSession(const QString &sessionId)\n        : Subject()\n{\n    setSubject(polkit_unix_session_new(sessionId.toUtf8().data()));\n}\n\nUnixSession::UnixSession(qint64 pid)\n        : Subject()\n{\n    \/\/ TODO: error handling\n    setSubject(polkit_unix_session_new_for_process_sync(pid, NULL, NULL));\n}\n\nUnixSession::UnixSession(PolkitSystemBusName *pkUnixSession)\n        : Subject((PolkitSubject *) pkUnixSession)\n{\n\n}\n\nQString UnixSession::sessionId() const\n{\n    return QString::fromUtf8(polkit_unix_session_get_session_id((PolkitUnixSession *) subject()));\n}\n\nvoid UnixSession::setSessionId(const QString &sessionId)\n{\n    polkit_unix_session_set_session_id((PolkitUnixSession *) subject(), sessionId.toUtf8().data());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of the OfiLabs X2 project.\n\n    Copyright (C) 2010 Helder Correia <helder.pereira.correia@gmail.com>\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\n    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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <QtGui>\n#include <cmath>\n\nclass PlasmaEffect : public QWidget\n{\n    Q_OBJECT\n\npublic:\n    typedef double (*transformation)(double);\n    PlasmaEffect(int width, int height, QWidget *parent = 0);\n    int interval() const;\n\npublic slots:\n    void setRedAsBase();\n    void setGreenAsBase();\n    void setBlueAsBase();\n    void setParameters(qreal alpha, qreal alphaAdjust, qreal beta, qreal betaAdjust);\n    void setBaseFunction(transformation function);\n    void start();\n    void stop();\n    void setInterval(int msec);\n\nprotected:\n    virtual void keyPressEvent(QKeyEvent *event);\n    virtual void paintEvent(QPaintEvent *);\n    virtual void resizeEvent(QResizeEvent *event);\n    virtual void timerEvent(QTimerEvent *event);\n\nprivate:\n    int m_plasmaWidth;\n    int m_plasmaHeight;\n    bool m_fullScreen;\n\n    QImage m_image;\n    int *m_pattern;\n    QVector<QRgb> m_palette;\n    int m_timerInterval;\n    QBasicTimer m_animationTimer;\n    transformation m_baseFunction;\n\n    qreal m_alpha;\n    qreal m_alphaAdjust;\n    qreal m_beta;\n    qreal m_betaAdjust;\n\n    int m_redComponent;\n    int m_greenComponent;\n    int m_blueComponent;\n\n    int m_redComponentChangeFactor;\n    int m_greenComponentChangeFactor;\n    int m_blueComponentChangeFactor;\n\n    void paintNextFrame();\n    void setUp();\n};\n\nPlasmaEffect::PlasmaEffect(int width, int height, QWidget *parent) : QWidget(parent),\n    m_fullScreen(false),\n    m_pattern(0), m_palette(256),\n    m_timerInterval(40),\n    m_baseFunction(sin),\n    m_alpha(20), m_alphaAdjust(0.15), m_beta(100), m_betaAdjust(0.015),\n    m_redComponent(0), m_greenComponent(255), m_blueComponent(0),\n    m_redComponentChangeFactor(2), m_greenComponentChangeFactor(-2),\n    m_blueComponentChangeFactor(2)\n{\n    setAttribute(Qt::WA_StaticContents, true);\n    setAttribute(Qt::WA_OpaquePaintEvent, true);\n    setAttribute(Qt::WA_NoSystemBackground, true);\n\n    resize(width, height);\n    start();\n}\n\nint PlasmaEffect::interval() const\n{\n    return m_timerInterval;\n}\n\nvoid PlasmaEffect::setRedAsBase()\n{\n    m_redComponent = 255; m_redComponentChangeFactor = -2;\n    m_greenComponent = 0; m_greenComponentChangeFactor = 2;\n    m_blueComponent = 0; m_blueComponentChangeFactor = 2;\n    setUp();\n}\n\nvoid PlasmaEffect::setGreenAsBase()\n{\n    m_redComponent = 0; m_redComponentChangeFactor = 2;\n    m_greenComponent = 255; m_greenComponentChangeFactor = -2;\n    m_blueComponent = 0; m_blueComponentChangeFactor = 2;\n    setUp();\n}\n\nvoid PlasmaEffect::setBlueAsBase()\n{\n    m_redComponent = 0; m_redComponentChangeFactor = 2;\n    m_greenComponent = 0; m_greenComponentChangeFactor = 2;\n    m_blueComponent = 255; m_blueComponentChangeFactor = -2;\n    setUp();\n}\n\nvoid PlasmaEffect::setParameters(qreal alpha, qreal alphaAdjust, qreal beta, qreal betaAdjust)\n{\n    m_alpha = alpha; m_alphaAdjust = alphaAdjust;\n    m_beta = beta; m_betaAdjust = betaAdjust;\n    setUp();\n}\n\nvoid PlasmaEffect::setBaseFunction(transformation function)\n{\n    m_baseFunction = function;\n    setUp();\n}\n\nvoid PlasmaEffect::start()\n{\n    m_animationTimer.start(m_timerInterval, this);\n}\n\nvoid PlasmaEffect::stop()\n{\n    m_animationTimer.stop();\n}\n\nvoid PlasmaEffect::setInterval(int msec)\n{\n    m_animationTimer.stop();\n    m_timerInterval = msec;\n    m_animationTimer.start(msec, this);\n}\n\nvoid PlasmaEffect::keyPressEvent(QKeyEvent *event)\n{\n    switch (event->key()) {\n\n    case Qt::Key_Left:\n        if (event->modifiers() & Qt::ShiftModifier)\n            m_betaAdjust -= 0.0008;\n        else\n            m_alphaAdjust -= 0.002;\n        setUp();\n        break;\n    case Qt::Key_Right:\n        if (event->modifiers() & Qt::ShiftModifier)\n            m_betaAdjust += 0.0008;\n        else\n            m_alphaAdjust += 0.002;\n        setUp();\n        break;\n\n    case Qt::Key_Up:\n        if (event->modifiers() & Qt::ShiftModifier)\n            m_beta += 8;\n        else\n            m_alpha += 2;\n        setUp();\n        break;\n    case Qt::Key_Down:\n        if (event->modifiers() & Qt::ShiftModifier)\n            m_beta -= 8;\n        else\n            m_alpha -= 2;\n        setUp();\n        break;\n\n    case Qt::Key_R: setRedAsBase(); break;\n    case Qt::Key_G: setGreenAsBase(); break;\n    case Qt::Key_B: setBlueAsBase(); break;\n\n    case Qt::Key_S: setBaseFunction(sin); break;\n    case Qt::Key_T: setBaseFunction(tan); break;\n\n    case Qt::Key_F:\n        if (m_fullScreen) {\n            showNormal();\n            m_fullScreen = false;\n        } else {\n            showFullScreen();\n            m_fullScreen = true;\n        }\n        break;\n\n    case Qt::Key_Space:\n        if (m_animationTimer.isActive())\n            stop();\n        else\n            start();\n        break;\n    case Qt::Key_O:\n        if (!(m_timerInterval > 250))\n            setInterval(interval() + 5);\n        break;\n    case Qt::Key_P:\n        if (!(m_timerInterval < 10))\n            setInterval(interval() - 5);\n        break;\n\n    case Qt::Key_1: setParameters(0, -0.046, -4, 0.0086); break;\n    case Qt::Key_2: setParameters(-16, -0.012, 4, -0.0266); break;\n    case Qt::Key_3: setParameters(-58, -0.002, 4, -0.1146); break;\n    case Qt::Key_4: setParameters(-58, -0.002, -4, -0.0138); break;\n    case Qt::Key_5: setParameters(4, 0.102, 12, -0.0686); break;\n    case Qt::Key_6: setParameters(-2, 0.244, 1780, -0.0007); break;\n    case Qt::Key_7: setParameters(-34, 0.092, 1780, -0.0007); break;\n    case Qt::Key_8: setParameters(-130, 0.008, -12, -0.043); break;\n    case Qt::Key_9: setParameters(-38, 0.002, 12, -0.0662); break;\n    case Qt::Key_0: setParameters(20, 0.15, 100, 0.015); break;\n\n    case Qt::Key_Escape:\n        QApplication::quit();\n        break;\n\n    default:\n        QWidget::keyPressEvent(event);\n    }\n}\n\nvoid PlasmaEffect::paintEvent(QPaintEvent *)\n{\n    QPainter painter(this);\n    painter.drawImage(QPoint(0, 0), m_image);\n}\n\nvoid PlasmaEffect::resizeEvent(QResizeEvent *event)\n{\n    m_plasmaWidth = event->size().width();\n    m_plasmaHeight = event->size().height();\n    m_image = QImage(m_plasmaWidth, m_plasmaHeight, QImage::Format_Indexed8);\n    m_image.setColorTable(m_palette);\n    if (m_pattern)\n        delete m_pattern;\n    m_pattern = new int[m_plasmaWidth*m_plasmaHeight];\n\n    setUp();\n\n    if (!m_animationTimer.isActive())\n        paintNextFrame();\n}\n\nvoid PlasmaEffect::timerEvent(QTimerEvent *)\n{\n    paintNextFrame();\n}\n\nvoid PlasmaEffect::paintNextFrame()\n{\n    for (int i = 0; i < 255; ++i)\n        m_palette[i] = m_palette[i + 1];\n    m_palette[255] = m_palette[0];\n\n    uchar *scanLine;\n    for (int line = 0; line < m_plasmaHeight; ++line) {\n        scanLine = m_image.scanLine(line);\n        for (int offset = 0; offset < m_plasmaWidth; ++offset)\n    \tscanLine[offset] = m_palette[m_pattern[line * m_plasmaWidth + offset]];\n    }\n\n    m_image.setColorTable(m_palette);\n    update();\n}\n\nvoid PlasmaEffect::setUp()\n{\n    int maxDimension = qMax(m_plasmaWidth, m_plasmaHeight);\n    int *f = new int[maxDimension];\n\n    for (int x = 0; x < maxDimension; ++x)\n        f[x] = qRound(m_alpha * m_baseFunction(x * m_alphaAdjust) + m_beta * cos(x * m_betaAdjust));\n\n    QRgb rgb;\n    int r = m_redComponent, g = m_greenComponent, b = m_blueComponent;\n    for (int i = 0; i < 128; ++i) {\n        rgb = QColor(r, g, b).rgb();\n        m_palette[i] = m_palette[255-i] = rgb;\n        r += m_redComponentChangeFactor;\n        g += m_greenComponentChangeFactor;\n        b += m_blueComponentChangeFactor;\n    }\n\n    for (int y = 0; y < m_plasmaHeight; ++y)\n        for (int x = 0; x < m_plasmaWidth; ++x)\n            m_pattern[y * m_plasmaWidth + x] = abs(f[x] + f[y]) % (255);\n\n    delete[] f;\n}\n\nint main(int argc, char *argv[])\n{\n    QApplication application(argc, argv);\n    PlasmaEffect plasma(640, 360);\n    plasma.setInterval(35);\n    plasma.start();\n#ifdef Q_OS_SYMBIAN\n    plasma.showMaximized(); \/\/ http:\/\/bugreports.qt.nokia.com\/browse\/QTBUG-8190\n#else\n    plasma.show();\n#endif\n\n    return application.exec();\n}\n\n#include \"plasmaeffect.moc\"\n\n<commit_msg>Use qRgb() instead of QColor().rgb().<commit_after>\/*\n    This file is part of the OfiLabs X2 project.\n\n    Copyright (C) 2010 Helder Correia <helder.pereira.correia@gmail.com>\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\n    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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <QtGui>\n#include <cmath>\n\nclass PlasmaEffect : public QWidget\n{\n    Q_OBJECT\n\npublic:\n    typedef double (*transformation)(double);\n    PlasmaEffect(int width, int height, QWidget *parent = 0);\n    int interval() const;\n\npublic slots:\n    void setRedAsBase();\n    void setGreenAsBase();\n    void setBlueAsBase();\n    void setParameters(qreal alpha, qreal alphaAdjust, qreal beta, qreal betaAdjust);\n    void setBaseFunction(transformation function);\n    void start();\n    void stop();\n    void setInterval(int msec);\n\nprotected:\n    virtual void keyPressEvent(QKeyEvent *event);\n    virtual void paintEvent(QPaintEvent *);\n    virtual void resizeEvent(QResizeEvent *event);\n    virtual void timerEvent(QTimerEvent *event);\n\nprivate:\n    int m_plasmaWidth;\n    int m_plasmaHeight;\n    bool m_fullScreen;\n\n    QImage m_image;\n    int *m_pattern;\n    QVector<QRgb> m_palette;\n    int m_timerInterval;\n    QBasicTimer m_animationTimer;\n    transformation m_baseFunction;\n\n    qreal m_alpha;\n    qreal m_alphaAdjust;\n    qreal m_beta;\n    qreal m_betaAdjust;\n\n    int m_redComponent;\n    int m_greenComponent;\n    int m_blueComponent;\n\n    int m_redComponentChangeFactor;\n    int m_greenComponentChangeFactor;\n    int m_blueComponentChangeFactor;\n\n    void paintNextFrame();\n    void setUp();\n};\n\nPlasmaEffect::PlasmaEffect(int width, int height, QWidget *parent) : QWidget(parent),\n    m_fullScreen(false),\n    m_pattern(0), m_palette(256),\n    m_timerInterval(40),\n    m_baseFunction(sin),\n    m_alpha(20), m_alphaAdjust(0.15), m_beta(100), m_betaAdjust(0.015),\n    m_redComponent(0), m_greenComponent(255), m_blueComponent(0),\n    m_redComponentChangeFactor(2), m_greenComponentChangeFactor(-2),\n    m_blueComponentChangeFactor(2)\n{\n    setAttribute(Qt::WA_StaticContents, true);\n    setAttribute(Qt::WA_OpaquePaintEvent, true);\n    setAttribute(Qt::WA_NoSystemBackground, true);\n\n    resize(width, height);\n    start();\n}\n\nint PlasmaEffect::interval() const\n{\n    return m_timerInterval;\n}\n\nvoid PlasmaEffect::setRedAsBase()\n{\n    m_redComponent = 255; m_redComponentChangeFactor = -2;\n    m_greenComponent = 0; m_greenComponentChangeFactor = 2;\n    m_blueComponent = 0; m_blueComponentChangeFactor = 2;\n    setUp();\n}\n\nvoid PlasmaEffect::setGreenAsBase()\n{\n    m_redComponent = 0; m_redComponentChangeFactor = 2;\n    m_greenComponent = 255; m_greenComponentChangeFactor = -2;\n    m_blueComponent = 0; m_blueComponentChangeFactor = 2;\n    setUp();\n}\n\nvoid PlasmaEffect::setBlueAsBase()\n{\n    m_redComponent = 0; m_redComponentChangeFactor = 2;\n    m_greenComponent = 0; m_greenComponentChangeFactor = 2;\n    m_blueComponent = 255; m_blueComponentChangeFactor = -2;\n    setUp();\n}\n\nvoid PlasmaEffect::setParameters(qreal alpha, qreal alphaAdjust, qreal beta, qreal betaAdjust)\n{\n    m_alpha = alpha; m_alphaAdjust = alphaAdjust;\n    m_beta = beta; m_betaAdjust = betaAdjust;\n    setUp();\n}\n\nvoid PlasmaEffect::setBaseFunction(transformation function)\n{\n    m_baseFunction = function;\n    setUp();\n}\n\nvoid PlasmaEffect::start()\n{\n    m_animationTimer.start(m_timerInterval, this);\n}\n\nvoid PlasmaEffect::stop()\n{\n    m_animationTimer.stop();\n}\n\nvoid PlasmaEffect::setInterval(int msec)\n{\n    m_animationTimer.stop();\n    m_timerInterval = msec;\n    m_animationTimer.start(msec, this);\n}\n\nvoid PlasmaEffect::keyPressEvent(QKeyEvent *event)\n{\n    switch (event->key()) {\n\n    case Qt::Key_Left:\n        if (event->modifiers() & Qt::ShiftModifier)\n            m_betaAdjust -= 0.0008;\n        else\n            m_alphaAdjust -= 0.002;\n        setUp();\n        break;\n    case Qt::Key_Right:\n        if (event->modifiers() & Qt::ShiftModifier)\n            m_betaAdjust += 0.0008;\n        else\n            m_alphaAdjust += 0.002;\n        setUp();\n        break;\n\n    case Qt::Key_Up:\n        if (event->modifiers() & Qt::ShiftModifier)\n            m_beta += 8;\n        else\n            m_alpha += 2;\n        setUp();\n        break;\n    case Qt::Key_Down:\n        if (event->modifiers() & Qt::ShiftModifier)\n            m_beta -= 8;\n        else\n            m_alpha -= 2;\n        setUp();\n        break;\n\n    case Qt::Key_R: setRedAsBase(); break;\n    case Qt::Key_G: setGreenAsBase(); break;\n    case Qt::Key_B: setBlueAsBase(); break;\n\n    case Qt::Key_S: setBaseFunction(sin); break;\n    case Qt::Key_T: setBaseFunction(tan); break;\n\n    case Qt::Key_F:\n        if (m_fullScreen) {\n            showNormal();\n            m_fullScreen = false;\n        } else {\n            showFullScreen();\n            m_fullScreen = true;\n        }\n        break;\n\n    case Qt::Key_Space:\n        if (m_animationTimer.isActive())\n            stop();\n        else\n            start();\n        break;\n    case Qt::Key_O:\n        if (!(m_timerInterval > 250))\n            setInterval(interval() + 5);\n        break;\n    case Qt::Key_P:\n        if (!(m_timerInterval < 10))\n            setInterval(interval() - 5);\n        break;\n\n    case Qt::Key_1: setParameters(0, -0.046, -4, 0.0086); break;\n    case Qt::Key_2: setParameters(-16, -0.012, 4, -0.0266); break;\n    case Qt::Key_3: setParameters(-58, -0.002, 4, -0.1146); break;\n    case Qt::Key_4: setParameters(-58, -0.002, -4, -0.0138); break;\n    case Qt::Key_5: setParameters(4, 0.102, 12, -0.0686); break;\n    case Qt::Key_6: setParameters(-2, 0.244, 1780, -0.0007); break;\n    case Qt::Key_7: setParameters(-34, 0.092, 1780, -0.0007); break;\n    case Qt::Key_8: setParameters(-130, 0.008, -12, -0.043); break;\n    case Qt::Key_9: setParameters(-38, 0.002, 12, -0.0662); break;\n    case Qt::Key_0: setParameters(20, 0.15, 100, 0.015); break;\n\n    case Qt::Key_Escape:\n        QApplication::quit();\n        break;\n\n    default:\n        QWidget::keyPressEvent(event);\n    }\n}\n\nvoid PlasmaEffect::paintEvent(QPaintEvent *)\n{\n    QPainter painter(this);\n    painter.drawImage(QPoint(0, 0), m_image);\n}\n\nvoid PlasmaEffect::resizeEvent(QResizeEvent *event)\n{\n    m_plasmaWidth = event->size().width();\n    m_plasmaHeight = event->size().height();\n    m_image = QImage(m_plasmaWidth, m_plasmaHeight, QImage::Format_Indexed8);\n    m_image.setColorTable(m_palette);\n    if (m_pattern)\n        delete m_pattern;\n    m_pattern = new int[m_plasmaWidth*m_plasmaHeight];\n\n    setUp();\n\n    if (!m_animationTimer.isActive())\n        paintNextFrame();\n}\n\nvoid PlasmaEffect::timerEvent(QTimerEvent *)\n{\n    paintNextFrame();\n}\n\nvoid PlasmaEffect::paintNextFrame()\n{\n    for (int i = 0; i < 255; ++i)\n        m_palette[i] = m_palette[i + 1];\n    m_palette[255] = m_palette[0];\n\n    uchar *scanLine;\n    for (int line = 0; line < m_plasmaHeight; ++line) {\n        scanLine = m_image.scanLine(line);\n        for (int offset = 0; offset < m_plasmaWidth; ++offset)\n    \tscanLine[offset] = m_palette[m_pattern[line * m_plasmaWidth + offset]];\n    }\n\n    m_image.setColorTable(m_palette);\n    update();\n}\n\nvoid PlasmaEffect::setUp()\n{\n    int maxDimension = qMax(m_plasmaWidth, m_plasmaHeight);\n    int *f = new int[maxDimension];\n\n    for (int x = 0; x < maxDimension; ++x)\n        f[x] = qRound(m_alpha * m_baseFunction(x * m_alphaAdjust) + m_beta * cos(x * m_betaAdjust));\n\n    int r = m_redComponent, g = m_greenComponent, b = m_blueComponent;\n    for (int i = 0; i < 128; ++i) {\n        m_palette[i] = m_palette[255-i] = qRgb(r, g, b);\n        r += m_redComponentChangeFactor;\n        g += m_greenComponentChangeFactor;\n        b += m_blueComponentChangeFactor;\n    }\n\n    for (int y = 0; y < m_plasmaHeight; ++y)\n        for (int x = 0; x < m_plasmaWidth; ++x)\n            m_pattern[y * m_plasmaWidth + x] = abs(f[x] + f[y]) % (255);\n\n    delete[] f;\n}\n\nint main(int argc, char *argv[])\n{\n    QApplication application(argc, argv);\n    PlasmaEffect plasma(640, 360);\n    plasma.setInterval(35);\n    plasma.start();\n#ifdef Q_OS_SYMBIAN\n    plasma.showMaximized(); \/\/ http:\/\/bugreports.qt.nokia.com\/browse\/QTBUG-8190\n#else\n    plasma.show();\n#endif\n\n    return application.exec();\n}\n\n#include \"plasmaeffect.moc\"\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: Molecule_test.C,v 1.14 2002\/12\/12 11:34:42 oliver Exp $\n\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <BALL\/KERNEL\/atom.h>\n#include <BALL\/CONCEPT\/textPersistenceManager.h>\n#include <BALL\/KERNEL\/molecule.h>\n#include <BALL\/KERNEL\/system.h>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSTART_TEST(Molecule, \"$Id: Molecule_test.C,v 1.14 2002\/12\/12 11:34:42 oliver Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\nString filename;\nusing std::ofstream;\nusing std::ios;\n\nMolecule* b;\n\nCHECK(Molecule())\n\tb = new Molecule;\n\tTEST_NOT_EQUAL(b, 0)\nRESULT\t\t\t\t\t\t\t\t\t\t\t\n\nCHECK(~Molecule())\n\tdelete b;\nRESULT\n\nCHECK(Molecule(const Molecule& molecule, bool deep = true))\n\tAtom a1;\n\tMolecule m(\"a\"), m2;\n\tm.append(a1);\n\tm2 = Molecule(m);\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 1)\nRESULT\n\nCHECK(Molecule(const String& name))\n\tMolecule m(\"a\");\n\tTEST_EQUAL(m.getName(), \"a\")\n\tMolecule m2(\"\");\n\tTEST_EQUAL(m2.getName(), \"\")\nRESULT\n\nCHECK(clear())\n\tSystem s;\n\tMolecule m(\"a\");\n\tAtom a1;\n\tm.append(a1);\n\ts.append(m);\n\tm.clear();\n\tTEST_EQUAL(m.getName(), \"\")\n\tTEST_EQUAL(s.countAtoms(), 0)\nRESULT\n\nCHECK(destroy())\n\tSystem s;\n\tMolecule m(\"a\");\n\tAtom a1;\n\tm.append(a1);\n\ts.append(m);\n\tm.destroy();\n\tTEST_EQUAL(m.getName(), \"\")\n\tTEST_EQUAL(s.countAtoms(), 0)\nRESULT\n\nCHECK(Molecule::set(const Molecule& molecule, bool deep = true))\n\tMolecule m(\"a\"), m2;\n\tAtom a1;\n\tm.append(a1);\n\tm2.set(m);\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 1)\nRESULT\n\nCHECK(Molecule::Molecule& operator = (const Molecule& molecule))\n\tMolecule m(\"a\"), m2;\n\tAtom a1;\n\tm.append(a1);\n\tm2 = m;\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 1)\nRESULT\n\nCHECK(Molecule::get(Molecule& molecule, bool deep = true) const )\n\tMolecule m(\"a\"), m2;\n\tAtom a1;\n\tm.append(a1);\n\tm.get(m2);\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 1)\nRESULT\n\nCHECK(Molecule::swap(Molecule& molecule))\n\tMolecule m(\"a\");\n\tMolecule m2(\"b\");\n\tAtom a1, a2, a3;\n\tm.append(a1);\n\tm.append(a2);\n\tm2.append(a3);\n\tm.swap(m2);\n\tTEST_EQUAL(m.getName(), \"b\")\n\tTEST_EQUAL(m.countAtoms(), 1)\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 2)\nRESULT\n\nCHECK(Molecule::getSystem())\n\tSystem s;\n\tMolecule m(\"a\");\n\ts.append(m);\n\tm.getSystem()->setName(\"b\");\n\tTEST_EQUAL(s.getName(), \"b\")\nRESULT\n\nCHECK(Molecule::getSystem() const )\n\tSystem s1(\"aya\");\n\tMolecule m(\"a\");\n\ts1.append(m);\n\tconst System s(s1);\n\tTEST_EQUAL(m.getSystem()->getName(), \"aya\")\nRESULT\n\nCHECK(Molecule::prepend(Atom& atom))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tm.insert(a1);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tm.prepend(a2);\n\tTEST_EQUAL(m.getAtom(0), &a2)\n\tTEST_EQUAL(m.getAtom(1), &a1)\nRESULT\n\nCHECK(Molecule::append(Atom& atom))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tm.insert(a1);\n\tm.append(a2);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tTEST_EQUAL(m.getAtom(1), &a2)\nRESULT\n\nCHECK(Molecule::insert(Atom& atom))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tm.insert(a1);\n\tm.insert(a2);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tTEST_EQUAL(m.getAtom(1), &a2)\nRESULT\n\nCHECK(Molecule::insertBefore(Atom& atom, Composite& before))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tAtom a3;\n\tm.insert(a1);\n\tm.append(a2);\n\tm.insertBefore(a3, a2);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tTEST_EQUAL(m.getAtom(1), &a3)\n\tTEST_EQUAL(m.getAtom(2), &a2)\nRESULT\n\nCHECK(Molecule::insertAfter(Atom& atom, Composite& after))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tAtom a3;\n\tm.insert(a1);\n\tm.append(a2);\n\tm.insertAfter(a3, a1);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tTEST_EQUAL(m.getAtom(1), &a3)\n\tTEST_EQUAL(m.getAtom(2), &a2)\nRESULT\n\nCHECK(Molecule::remove(Atom& atom))\n\tMolecule m(\"a\");\n\tAtom a1;\n\tAtom a2;\n\tm.append(a1);\n\tm.append(a2);\n\tm.remove(a1);\n\tTEST_EQUAL(m.countAtoms(), 1)\n\tTEST_EQUAL(m.getAtom(0), &a2)\nRESULT\n\nCHECK(Molecule::prepend(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tm.prepend(bf2);\n\tm.prepend(bf3);\n\tTEST_EQUAL(m.getAtomContainer(1), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(0), &bf3)\nRESULT\n\nCHECK(Molecule::append(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tm.append(bf2);\n\tm.append(bf3);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf3)\nRESULT\n\nCHECK(Molecule::insert(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tm.insert(bf2);\n\tm.insert(bf3);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf3)\nRESULT\n\nCHECK(Molecule::insertBefore(AtomContainer& atom_container, Composite& before))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tm.append(bf2);\n\tm.append(bf3);\n\tm.insertBefore(bf4, bf3);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf4)\n\tTEST_EQUAL(m.getAtomContainer(2), &bf3)\nRESULT\n\nCHECK(Molecule::insertAfter(AtomContainer& atom_container, Composite& after))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tm.append(bf2);\n\tm.append(bf3);\n\tm.insertAfter(bf4, bf2);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf4)\n\tTEST_EQUAL(m.getAtomContainer(2), &bf3)\nRESULT\n\nCHECK(Molecule::spliceBefore(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tm.append(bf2);\n\tbf4.append(bf3);\n\tbf4.spliceBefore(m);\n\tTEST_EQUAL(m.getAtomContainer(0), 0)\n\tTEST_EQUAL(bf4.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(bf4.getAtomContainer(1), &bf3)\n\tbf4.spliceBefore(bf4);\n\tTEST_EQUAL(bf4.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(bf4.getAtomContainer(1), &bf3)\nRESULT\n\nCHECK(Molecule::spliceAfter(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tm.append(bf2);\n\tbf4.append(bf3);\n\tbf4.spliceAfter(m);\n\tTEST_EQUAL(m.getAtomContainer(0), 0)\n\tTEST_EQUAL(bf4.getAtomContainer(1), &bf2)\n\tTEST_EQUAL(bf4.getAtomContainer(0), &bf3)\n\tbf4.spliceBefore(bf4);\n\tTEST_EQUAL(bf4.getAtomContainer(1), &bf2)\n\tTEST_EQUAL(bf4.getAtomContainer(0), &bf3)\nRESULT\n\nCHECK(Molecule::splice(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tAtomContainer bf5;\n\tAtomContainer bfx;\n\tAtomContainer bfy;\n\tm.append(bf2);\n\tm.append(bfx);\n\tm.append(bf3);\n\tbfx.append(bfy);\n\tbf4.append(bf5);\n\tm.splice(bfx);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bfy)\n\tTEST_EQUAL(m.getAtomContainer(2), &bf3)\n\tm.splice(bf4);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf5)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf2)\nRESULT\n\nCHECK(Molecule::remove(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tm.append(bf2);\n\tm.append(bf3);\n\tm.remove(bf2);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf3)\nRESULT\n\nCHECK(Molecule::isValid() const )\n\tMolecule m(\"a\");\n\tAtom a1;\n\tm.append(a1);\n\tTEST_EQUAL(m.isValid(), true)\nRESULT\n\nCHECK(Molecule::dump(std::ostream& s = std::cout, Size depth = 0) const )\n\tMolecule m(\"molecule1\");\n\tAtom a1, a2;\n\ta1.setName(\"atom1\");\n\ta2.setName(\"atom2\");\n\tm.append(a1);\n\tm.append(a2);\n\tNEW_TMP_FILE(filename)\n\tstd::ofstream outfile(filename.c_str(), std::ios::out);\n\tm.dump(outfile);\n\toutfile.close();\n\tTEST_FILE_REGEXP(filename.c_str(), \"data\/Molecule_test.txt\")\nRESULT\n\nTextPersistenceManager pm;\nusing namespace RTTI;\npm.registerClass(getStreamName<Atom>(), Atom::createDefault);\npm.registerClass(getStreamName<Molecule>(), Molecule::createDefault);\nNEW_TMP_FILE(filename)\nCHECK(persistentWrite(PersistenceManager&, String, bool))\n\tstd::ofstream\tofile(filename.c_str(), std::ios::out);\n\tAtom* f2= new Atom();\n\tf2->setName(\"name2\");\n\tAtom* f3= new Atom();\n\tf3->setName(\"name3\");\n\tMolecule* f1 = new Molecule(\"name1\");\n\tf1->insert(*f2);\n\tf1->insert(*f3);\n\tpm.setOstream(ofile);\n\t*f1 >> pm;\n\tofile.close();\n\tdelete f1;\nRESULT\n\nCHECK(persistentRead(PersistenceManager&))\n\tstd::ifstream\tifile(filename.c_str());\n\tpm.setIstream(ifile);\n\tPersistentObject*\tptr = pm.readObject();\n\tTEST_NOT_EQUAL(ptr, 0)\n\tif (ptr != 0)\n\t{\n\t\tTEST_EQUAL(isKindOf<Molecule>(*ptr), true)\n\t\tMolecule*\tf1 = castTo<Molecule>(*ptr);\n\t\tTEST_EQUAL(f1->getName(), \"name1\")\n\t\tTEST_EQUAL(f1->countAtoms(), 2)\n\t\tTEST_EQUAL(f1->getAtom(0)->getName(), \"name2\")\n\t\tTEST_EQUAL(f1->getAtom(1)->getName(), \"name3\")\n\t\tdelete f1;\n\t} \n\telse \n\t{\n\t\tthrow Exception::NullPointer(__FILE__, __LINE__);\n\t}\nRESULT\n\nCHECK(operator ==)\n\tMolecule b1;\n\tMolecule b2;\n\tTEST_EQUAL(b1 == b2, false)\n\tb1 = b2;\n\tTEST_EQUAL(b1 == b1, true)\nRESULT\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<commit_msg>changed: adapted to changes in AtomContainer::dump<commit_after>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: Molecule_test.C,v 1.15 2003\/02\/10 16:42:42 oliver Exp $\n\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <BALL\/KERNEL\/atom.h>\n#include <BALL\/CONCEPT\/textPersistenceManager.h>\n#include <BALL\/KERNEL\/molecule.h>\n#include <BALL\/KERNEL\/system.h>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSTART_TEST(Molecule, \"$Id: Molecule_test.C,v 1.15 2003\/02\/10 16:42:42 oliver Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\n\nString filename;\nusing std::ofstream;\nusing std::ios;\n\nMolecule* b;\n\nCHECK(Molecule())\n\tb = new Molecule;\n\tTEST_NOT_EQUAL(b, 0)\nRESULT\t\t\t\t\t\t\t\t\t\t\t\n\nCHECK(~Molecule())\n\tdelete b;\nRESULT\n\nCHECK(Molecule(const Molecule& molecule, bool deep = true))\n\tAtom a1;\n\tMolecule m(\"a\"), m2;\n\tm.append(a1);\n\tm2 = Molecule(m);\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 1)\nRESULT\n\nCHECK(Molecule(const String& name))\n\tMolecule m(\"a\");\n\tTEST_EQUAL(m.getName(), \"a\")\n\tMolecule m2(\"\");\n\tTEST_EQUAL(m2.getName(), \"\")\nRESULT\n\nCHECK(clear())\n\tSystem s;\n\tMolecule m(\"a\");\n\tAtom a1;\n\tm.append(a1);\n\ts.append(m);\n\tm.clear();\n\tTEST_EQUAL(m.getName(), \"\")\n\tTEST_EQUAL(s.countAtoms(), 0)\nRESULT\n\nCHECK(destroy())\n\tSystem s;\n\tMolecule m(\"a\");\n\tAtom a1;\n\tm.append(a1);\n\ts.append(m);\n\tm.destroy();\n\tTEST_EQUAL(m.getName(), \"\")\n\tTEST_EQUAL(s.countAtoms(), 0)\nRESULT\n\nCHECK(Molecule::set(const Molecule& molecule, bool deep = true))\n\tMolecule m(\"a\"), m2;\n\tAtom a1;\n\tm.append(a1);\n\tm2.set(m);\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 1)\nRESULT\n\nCHECK(Molecule::Molecule& operator = (const Molecule& molecule))\n\tMolecule m(\"a\"), m2;\n\tAtom a1;\n\tm.append(a1);\n\tm2 = m;\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 1)\nRESULT\n\nCHECK(Molecule::get(Molecule& molecule, bool deep = true) const )\n\tMolecule m(\"a\"), m2;\n\tAtom a1;\n\tm.append(a1);\n\tm.get(m2);\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 1)\nRESULT\n\nCHECK(Molecule::swap(Molecule& molecule))\n\tMolecule m(\"a\");\n\tMolecule m2(\"b\");\n\tAtom a1, a2, a3;\n\tm.append(a1);\n\tm.append(a2);\n\tm2.append(a3);\n\tm.swap(m2);\n\tTEST_EQUAL(m.getName(), \"b\")\n\tTEST_EQUAL(m.countAtoms(), 1)\n\tTEST_EQUAL(m2.getName(), \"a\")\n\tTEST_EQUAL(m2.countAtoms(), 2)\nRESULT\n\nCHECK(Molecule::getSystem())\n\tSystem s;\n\tMolecule m(\"a\");\n\ts.append(m);\n\tm.getSystem()->setName(\"b\");\n\tTEST_EQUAL(s.getName(), \"b\")\nRESULT\n\nCHECK(Molecule::getSystem() const )\n\tSystem s1(\"aya\");\n\tMolecule m(\"a\");\n\ts1.append(m);\n\tconst System s(s1);\n\tTEST_EQUAL(m.getSystem()->getName(), \"aya\")\nRESULT\n\nCHECK(Molecule::prepend(Atom& atom))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tm.insert(a1);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tm.prepend(a2);\n\tTEST_EQUAL(m.getAtom(0), &a2)\n\tTEST_EQUAL(m.getAtom(1), &a1)\nRESULT\n\nCHECK(Molecule::append(Atom& atom))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tm.insert(a1);\n\tm.append(a2);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tTEST_EQUAL(m.getAtom(1), &a2)\nRESULT\n\nCHECK(Molecule::insert(Atom& atom))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tm.insert(a1);\n\tm.insert(a2);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tTEST_EQUAL(m.getAtom(1), &a2)\nRESULT\n\nCHECK(Molecule::insertBefore(Atom& atom, Composite& before))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tAtom a3;\n\tm.insert(a1);\n\tm.append(a2);\n\tm.insertBefore(a3, a2);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tTEST_EQUAL(m.getAtom(1), &a3)\n\tTEST_EQUAL(m.getAtom(2), &a2)\nRESULT\n\nCHECK(Molecule::insertAfter(Atom& atom, Composite& after))\n\tMolecule m;\n\tAtom a1;\n\tAtom a2;\n\tAtom a3;\n\tm.insert(a1);\n\tm.append(a2);\n\tm.insertAfter(a3, a1);\n\tTEST_EQUAL(m.getAtom(0), &a1)\n\tTEST_EQUAL(m.getAtom(1), &a3)\n\tTEST_EQUAL(m.getAtom(2), &a2)\nRESULT\n\nCHECK(Molecule::remove(Atom& atom))\n\tMolecule m(\"a\");\n\tAtom a1;\n\tAtom a2;\n\tm.append(a1);\n\tm.append(a2);\n\tm.remove(a1);\n\tTEST_EQUAL(m.countAtoms(), 1)\n\tTEST_EQUAL(m.getAtom(0), &a2)\nRESULT\n\nCHECK(Molecule::prepend(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tm.prepend(bf2);\n\tm.prepend(bf3);\n\tTEST_EQUAL(m.getAtomContainer(1), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(0), &bf3)\nRESULT\n\nCHECK(Molecule::append(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tm.append(bf2);\n\tm.append(bf3);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf3)\nRESULT\n\nCHECK(Molecule::insert(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tm.insert(bf2);\n\tm.insert(bf3);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf3)\nRESULT\n\nCHECK(Molecule::insertBefore(AtomContainer& atom_container, Composite& before))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tm.append(bf2);\n\tm.append(bf3);\n\tm.insertBefore(bf4, bf3);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf4)\n\tTEST_EQUAL(m.getAtomContainer(2), &bf3)\nRESULT\n\nCHECK(Molecule::insertAfter(AtomContainer& atom_container, Composite& after))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tm.append(bf2);\n\tm.append(bf3);\n\tm.insertAfter(bf4, bf2);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf4)\n\tTEST_EQUAL(m.getAtomContainer(2), &bf3)\nRESULT\n\nCHECK(Molecule::spliceBefore(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tm.append(bf2);\n\tbf4.append(bf3);\n\tbf4.spliceBefore(m);\n\tTEST_EQUAL(m.getAtomContainer(0), 0)\n\tTEST_EQUAL(bf4.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(bf4.getAtomContainer(1), &bf3)\n\tbf4.spliceBefore(bf4);\n\tTEST_EQUAL(bf4.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(bf4.getAtomContainer(1), &bf3)\nRESULT\n\nCHECK(Molecule::spliceAfter(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tm.append(bf2);\n\tbf4.append(bf3);\n\tbf4.spliceAfter(m);\n\tTEST_EQUAL(m.getAtomContainer(0), 0)\n\tTEST_EQUAL(bf4.getAtomContainer(1), &bf2)\n\tTEST_EQUAL(bf4.getAtomContainer(0), &bf3)\n\tbf4.spliceBefore(bf4);\n\tTEST_EQUAL(bf4.getAtomContainer(1), &bf2)\n\tTEST_EQUAL(bf4.getAtomContainer(0), &bf3)\nRESULT\n\nCHECK(Molecule::splice(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tAtomContainer bf4;\n\tAtomContainer bf5;\n\tAtomContainer bfx;\n\tAtomContainer bfy;\n\tm.append(bf2);\n\tm.append(bfx);\n\tm.append(bf3);\n\tbfx.append(bfy);\n\tbf4.append(bf5);\n\tm.splice(bfx);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf2)\n\tTEST_EQUAL(m.getAtomContainer(1), &bfy)\n\tTEST_EQUAL(m.getAtomContainer(2), &bf3)\n\tm.splice(bf4);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf5)\n\tTEST_EQUAL(m.getAtomContainer(1), &bf2)\nRESULT\n\nCHECK(Molecule::remove(AtomContainer& atom_container))\n\tMolecule m;\n\tAtomContainer bf2;\n\tAtomContainer bf3;\n\tm.append(bf2);\n\tm.append(bf3);\n\tm.remove(bf2);\n\tTEST_EQUAL(m.getAtomContainer(0), &bf3)\nRESULT\n\nCHECK(Molecule::isValid() const )\n\tMolecule m(\"a\");\n\tAtom a1;\n\tm.append(a1);\n\tTEST_EQUAL(m.isValid(), true)\nRESULT\n\nCHECK(Molecule::dump(std::ostream& s = std::cout, Size depth = 0) const )\n\tMolecule m(\"molecule1\");\n\tAtom a1, a2;\n\ta1.setName(\"atom1\");\n\ta2.setName(\"atom2\");\n\tm.append(a1);\n\tm.append(a2);\n\tNEW_TMP_FILE(filename)\n\tstd::ofstream outfile(filename.c_str(), std::ios::out);\n\tm.dump(outfile);\n\toutfile.close();\n\tTEST_FILE_REGEXP(filename.c_str(), \"data\/Molecule_test.txt\")\nRESULT\n\nTextPersistenceManager pm;\nusing namespace RTTI;\npm.registerClass(getStreamName<Atom>(), Atom::createDefault);\npm.registerClass(getStreamName<Molecule>(), Molecule::createDefault);\nNEW_TMP_FILE(filename)\nCHECK(persistentWrite(PersistenceManager&, String, bool))\n\tstd::ofstream\tofile(filename.c_str(), std::ios::out);\n\tAtom* f2= new Atom();\n\tf2->setName(\"name2\");\n\tAtom* f3= new Atom();\n\tf3->setName(\"name3\");\n\tMolecule* f1 = new Molecule(\"name1\");\n\tf1->insert(*f2);\n\tf1->insert(*f3);\n\tpm.setOstream(ofile);\n\t*f1 >> pm;\n\tofile.close();\n\tdelete f1;\nRESULT\n\nCHECK(persistentRead(PersistenceManager&))\n\tstd::ifstream\tifile(filename.c_str());\n\tpm.setIstream(ifile);\n\tPersistentObject*\tptr = pm.readObject();\n\tTEST_NOT_EQUAL(ptr, 0)\n\tif (ptr != 0)\n\t{\n\t\tTEST_EQUAL(isKindOf<Molecule>(*ptr), true)\n\t\tMolecule*\tf1 = castTo<Molecule>(*ptr);\n\t\tTEST_EQUAL(f1->getName(), \"name1\")\n\t\tTEST_EQUAL(f1->countAtoms(), 2)\n\t\tTEST_EQUAL(f1->getAtom(0)->getName(), \"name2\")\n\t\tTEST_EQUAL(f1->getAtom(1)->getName(), \"name3\")\n\t\tdelete f1;\n\t} \n\telse \n\t{\n\t\tthrow Exception::NullPointer(__FILE__, __LINE__);\n\t}\nRESULT\n\nCHECK(operator ==)\n\tMolecule b1;\n\tMolecule b2;\n\tTEST_EQUAL(b1 == b2, false)\n\tb1 = b2;\n\tTEST_EQUAL(b1 == b1, true)\nRESULT\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2007-2010 Digital Bazaar, Inc. All rights reserved.\n *\/\n#include \"monarch\/modest\/ModuleLoader.h\"\n\n#include \"monarch\/rt\/DynamicLibrary.h\"\n\n#include <cstring>\n\nusing namespace monarch::modest;\nusing namespace monarch::rt;\n\nModuleLoader::ModuleLoader()\n{\n}\n\nModuleLoader::~ModuleLoader()\n{\n}\n\nModuleInfo* ModuleLoader::loadModule(const char* filename)\n{\n   ModuleInfo* rval = NULL;\n\n   \/\/ open library\n   void* handle = dlopen(filename, RTLD_NOW | RTLD_GLOBAL);\n   if(handle != NULL)\n   {\n      CreateModestModuleFn create;\n      FreeModestModuleFn free;\n\n      \/\/ clear error\n      char* error = dlerror();\n\n      \/\/ try to get create module function\n      create = (CreateModestModuleFn)dlsym(handle, \"createModestModule\");\n      if((error = dlerror()) == NULL)\n      {\n         \/\/ clear error\n         error = dlerror();\n\n         \/\/ try to get free module function\n         free = (FreeModestModuleFn)dlsym(handle, \"freeModestModule\");\n         error = dlerror();\n      }\n\n      if(error == NULL)\n      {\n         rval = loadModule(create, free);\n         rval->handle = handle;\n      }\n      else\n      {\n         \/\/ could not load create or free functions\n         ExceptionRef e = new Exception(\n            \"Could not load module.\", \"monarch.modest.BadModule\");\n         e->getDetails()[\"filename\"] = filename;\n         e->getDetails()[\"error\"] = error;\n         Exception::set(e);\n      }\n   }\n   else\n   {\n      \/\/ failed to open module\n      char* error = dlerror();\n      ExceptionRef e = new Exception(\n         \"Could not open module file.\", \"monarch.modest.BadModuleFile\");\n      e->getDetails()[\"filename\"] = filename;\n      e->getDetails()[\"error\"] = error;\n      Exception::set(e);\n   }\n\n   return rval;\n}\n\nModuleInfo* ModuleLoader::loadModule(\n   CreateModestModuleFn cm, FreeModestModuleFn fm)\n{\n   ModuleInfo* rval = NULL;\n\n   \/\/ create ModuleInfo\n   rval = new ModuleInfo();\n   rval->handle = NULL;\n   rval->module = cm();\n   rval->freeModule = fm;\n\n   return rval;\n}\n\nvoid ModuleLoader::unloadModule(ModuleInfo* mi)\n{\n   \/\/ free module\n   mi->freeModule(mi->module);\n\n   if(mi->handle != NULL)\n   {\n      \/\/ close handle\n      dlclose(mi->handle);\n   }\n\n   \/\/ delete module info\n   delete mi;\n}\n<commit_msg>Added exceptions for more error cases.<commit_after>\/*\n * Copyright (c) 2007-2010 Digital Bazaar, Inc. All rights reserved.\n *\/\n#include \"monarch\/modest\/ModuleLoader.h\"\n\n#include \"monarch\/rt\/DynamicLibrary.h\"\n\n#include <cstring>\n\nusing namespace monarch::modest;\nusing namespace monarch::rt;\n\nModuleLoader::ModuleLoader()\n{\n}\n\nModuleLoader::~ModuleLoader()\n{\n}\n\nModuleInfo* ModuleLoader::loadModule(const char* filename)\n{\n   ModuleInfo* rval = NULL;\n\n   \/\/ open library\n   void* handle = dlopen(filename, RTLD_NOW | RTLD_GLOBAL);\n   if(handle != NULL)\n   {\n      CreateModestModuleFn create;\n      FreeModestModuleFn free;\n\n      \/\/ clear error\n      char* error = dlerror();\n\n      \/\/ try to get create module function\n      create = (CreateModestModuleFn)dlsym(handle, \"createModestModule\");\n      if((error = dlerror()) == NULL)\n      {\n         \/\/ clear error\n         error = dlerror();\n\n         \/\/ try to get free module function\n         free = (FreeModestModuleFn)dlsym(handle, \"freeModestModule\");\n         error = dlerror();\n      }\n\n      if(error == NULL)\n      {\n         rval = loadModule(create, free);\n         if(rval != NULL)\n         {\n            rval->handle = handle;\n         }\n         else\n         {\n            \/\/ could not load module due to loadModule(c,f) exception\n            ExceptionRef e = new Exception(\n               \"Could not load module.\", \"monarch.modest.BadModule\");\n            e->getDetails()[\"filename\"] = filename;\n            Exception::push(e);\n         }\n      }\n      else\n      {\n         \/\/ could not load create or free functions\n         ExceptionRef e = new Exception(\n            \"Could not load module.\", \"monarch.modest.BadModule\");\n         e->getDetails()[\"filename\"] = filename;\n         e->getDetails()[\"error\"] = error;\n         Exception::set(e);\n      }\n   }\n   else\n   {\n      \/\/ failed to open module\n      char* error = dlerror();\n      ExceptionRef e = new Exception(\n         \"Could not open module file.\", \"monarch.modest.BadModuleFile\");\n      e->getDetails()[\"filename\"] = filename;\n      e->getDetails()[\"error\"] = error;\n      Exception::set(e);\n   }\n\n   return rval;\n}\n\nModuleInfo* ModuleLoader::loadModule(\n   CreateModestModuleFn cm, FreeModestModuleFn fm)\n{\n   ModuleInfo* rval = NULL;\n\n   Module* module = cm();\n\n   if(module != NULL)\n   {\n      \/\/ create ModuleInfo\n      rval = new ModuleInfo();\n      rval->handle = NULL;\n      rval->module = module;\n      rval->freeModule = fm;\n   }\n   else\n   {\n      \/\/ create returned NULL\n      ExceptionRef e = new Exception(\n         \"Failed to create module.\", \"monarch.modest.ModuleCreationFailure\");\n      Exception::push(e);\n   }\n\n   return rval;\n}\n\nvoid ModuleLoader::unloadModule(ModuleInfo* mi)\n{\n   \/\/ free module\n   mi->freeModule(mi->module);\n\n   if(mi->handle != NULL)\n   {\n      \/\/ close handle\n      dlclose(mi->handle);\n   }\n\n   \/\/ delete module info\n   delete mi;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\n#include \"SDL\/SDL.h\"\n#include \"SDL_image.h\"\n#include \"SDL_gfxPrimitives.h\"\n#include \"map.h\"\n#include \"game.h\"\n#include \"surface.h\"\n\nusing namespace std;\n\nGame::Game() {\n  playing=true;\n  screen=NULL;\n  tileset=NULL;\n  map_camera=NULL;\n  unit=NULL;\n  devastator=NULL;\n}\n\nint Game::execute() {\n  init();\n\n  SDL_Event event;\n\n  while(playing) {\n    while(SDL_PollEvent(&event)) {\n      onEvent(&event);\n    }\n\n    updateState();\n    render();\n    \/\/ SDL rest?\n  }\n\n  return cleanup();\n}\n\nint Game::init() {\n  if(SDL_Init(SDL_INIT_EVERYTHING) < 0) {\n    return false;\n  }\n\n  screen = SDL_SetVideoMode(800, 600, 16, SDL_HWSURFACE | SDL_DOUBLEBUF);\n  if(screen == NULL) {\n     return false;\n  }\n\n  int flags = IMG_INIT_JPG | IMG_INIT_PNG;\n  int initted=IMG_Init(flags);\n  if( initted & flags != flags) {\n    cout << \"could not init SDL_Image\" << endl;\n    cout << \"Reason: \" << IMG_GetError() << endl;\n    return false;\n  }\n\n  tileset = Surface::load(\"tileset.png\");\n\n  if (tileset == NULL) {\n    cout << \"Failed to read tileset data\" << endl;\n    return false;\n  }\n\n  map.setBoundaries(128,128);\n  map_camera = new MapCamera(0, 0, screen, &map);\n\n  unitRepository = new UnitRepository();\n\n  unit = unitRepository->create(UNIT_FRIGATE, HOUSE_SARDAUKAR, 64, 64);\n  devastator = unitRepository->create(UNIT_TRIKE, HOUSE_ATREIDES, 128, 128);\n\n  return true;\n}\n\nvoid Game::onEvent(SDL_Event* event) {\n  if(event->type == SDL_QUIT) {\n    playing = false;\n  }\n\n  keyboard.onEvent(event);\n\n}\n\nvoid Game::render() {\n  SDL_FillRect(screen, NULL, SDL_MapRGB(screen->format, 0, 0, 0));\n  map_camera->draw(&map, tileset, screen);\n\n \/\/ todo draw with camera\n  map_camera->draw(unit, screen);\n  map_camera->draw(devastator, screen);\n\n  if (mouse.left_button_held()) {\n    rectangleRGBA(screen, mouse.getRectX(), mouse.getRectY(), mouse.x(), mouse.y(), 255, 255, 255, 255);\n  }\n\n\n  SDL_Flip(screen);\n}\n\nvoid Game::updateState() {\n  SDL_PumpEvents();\n  if (keyboard.isUpPressed()) map_camera->moveUp();\n  if (keyboard.isDownPressed()) map_camera->moveDown();\n  if (keyboard.isLeftPressed()) map_camera->moveLeft();\n  if (keyboard.isRightPressed()) map_camera->moveRight();\n\n  if (keyboard.isQPressed()) playing = false;\n\n  mouse.update_state();\n\n  if (mouse.x() <= 1) map_camera->moveLeft();\n  if (mouse.x() >= (screen->w - 1)) map_camera->moveRight();\n  if (mouse.y() <= 1) map_camera->moveUp();\n  if (mouse.y() >= (screen->h - 1)) map_camera->moveDown();\n\n  if (isInRect(devastator->getDrawX(), devastator->getDrawY(), devastator->width(), devastator->height())) {\n    if(mouse.left_button_pressed() && !mouse.left_button_held()) {\n      devastator->select();\n    }\n  }\n\n  if (isInRect(unit->getDrawX(), unit->getDrawY(), unit->width(), unit->height())) {\n    if(mouse.left_button_pressed() && !mouse.left_button_held()) {\n      unit->select();\n    }\n  }\n\n  if(mouse.right_button_pressed()) {\n    devastator->unselect();\n    unit->unselect();\n  }\n\n  if (mouse.dragged_rectangle()) {\n    int rectX = map_camera->worldCoordinateX(mouse.getRectX());\n    int rectY = map_camera->worldCoordinateY(mouse.getRectY());\n    int endX = map_camera->worldCoordinateX(mouse.x());\n    int endY = map_camera->worldCoordinateY(mouse.y());\n\n    if (endX < rectX) swap(endX, rectX);\n    if (endY < rectY) swap(endY, rectY);\n\n    \/\/ bug: when user 'clicks' it deselects always now... \n\n    unit->unselect();\n    devastator->unselect();\n\n    if (isUnitInRect(devastator, rectX, rectY, endX, endY)) {\n        devastator->select();\n    }\n\n    if (isUnitInRect(unit, rectX, rectY, endX, endY)) {\n        unit->select();\n    }\n  }\n\n}\n\nint Game::cleanup() {\n  delete map_camera;\n  delete unitRepository;\n  delete unit;\n  delete devastator;\n  SDL_FreeSurface(screen);\n  SDL_FreeSurface(tileset);\n  SDL_Quit();\n  return 0;\n}\n\nbool Game::isUnitInRect(Unit* unit, int x, int y, int end_x, int end_y) {\n  \/\/ this checks the up-left position of a unit: TODO: do rectangle intersection\n  int unit_x = unit->getDrawX();\n  int unit_y = unit->getDrawY();\n  return (unit_x >= x && unit_x < end_x) && (unit_y >= y && unit_y < end_y);\n}\n\nbool Game::isInRect(int x, int y, int width, int height) {\n  int mouse_x = mouse.x();\n  int mouse_y = mouse.y();\n  return (mouse_x >= x && mouse_x < (x + width)) && (mouse_y >= y && mouse_y < (y + height));\n}\n<commit_msg>bug is fixed, remove comment<commit_after>#include <iostream>\n\n#include \"SDL\/SDL.h\"\n#include \"SDL_image.h\"\n#include \"SDL_gfxPrimitives.h\"\n#include \"map.h\"\n#include \"game.h\"\n#include \"surface.h\"\n\nusing namespace std;\n\nGame::Game() {\n  playing=true;\n  screen=NULL;\n  tileset=NULL;\n  map_camera=NULL;\n  unit=NULL;\n  devastator=NULL;\n}\n\nint Game::execute() {\n  init();\n\n  SDL_Event event;\n\n  while(playing) {\n    while(SDL_PollEvent(&event)) {\n      onEvent(&event);\n    }\n\n    updateState();\n    render();\n    \/\/ SDL rest?\n  }\n\n  return cleanup();\n}\n\nint Game::init() {\n  if(SDL_Init(SDL_INIT_EVERYTHING) < 0) {\n    return false;\n  }\n\n  screen = SDL_SetVideoMode(800, 600, 16, SDL_HWSURFACE | SDL_DOUBLEBUF);\n  if(screen == NULL) {\n     return false;\n  }\n\n  int flags = IMG_INIT_JPG | IMG_INIT_PNG;\n  int initted=IMG_Init(flags);\n  if( initted & flags != flags) {\n    cout << \"could not init SDL_Image\" << endl;\n    cout << \"Reason: \" << IMG_GetError() << endl;\n    return false;\n  }\n\n  tileset = Surface::load(\"tileset.png\");\n\n  if (tileset == NULL) {\n    cout << \"Failed to read tileset data\" << endl;\n    return false;\n  }\n\n  map.setBoundaries(128,128);\n  map_camera = new MapCamera(0, 0, screen, &map);\n\n  unitRepository = new UnitRepository();\n\n  unit = unitRepository->create(UNIT_FRIGATE, HOUSE_SARDAUKAR, 64, 64);\n  devastator = unitRepository->create(UNIT_TRIKE, HOUSE_ATREIDES, 128, 128);\n\n  return true;\n}\n\nvoid Game::onEvent(SDL_Event* event) {\n  if(event->type == SDL_QUIT) {\n    playing = false;\n  }\n\n  keyboard.onEvent(event);\n\n}\n\nvoid Game::render() {\n  SDL_FillRect(screen, NULL, SDL_MapRGB(screen->format, 0, 0, 0));\n  map_camera->draw(&map, tileset, screen);\n\n \/\/ todo draw with camera\n  map_camera->draw(unit, screen);\n  map_camera->draw(devastator, screen);\n\n  if (mouse.left_button_held()) {\n    rectangleRGBA(screen, mouse.getRectX(), mouse.getRectY(), mouse.x(), mouse.y(), 255, 255, 255, 255);\n  }\n\n\n  SDL_Flip(screen);\n}\n\nvoid Game::updateState() {\n  SDL_PumpEvents();\n  if (keyboard.isUpPressed()) map_camera->moveUp();\n  if (keyboard.isDownPressed()) map_camera->moveDown();\n  if (keyboard.isLeftPressed()) map_camera->moveLeft();\n  if (keyboard.isRightPressed()) map_camera->moveRight();\n\n  if (keyboard.isQPressed()) playing = false;\n\n  mouse.update_state();\n\n  if (mouse.x() <= 1) map_camera->moveLeft();\n  if (mouse.x() >= (screen->w - 1)) map_camera->moveRight();\n  if (mouse.y() <= 1) map_camera->moveUp();\n  if (mouse.y() >= (screen->h - 1)) map_camera->moveDown();\n\n  if (isInRect(devastator->getDrawX(), devastator->getDrawY(), devastator->width(), devastator->height())) {\n    if(mouse.left_button_pressed() && !mouse.left_button_held()) {\n      devastator->select();\n    }\n  }\n\n  if (isInRect(unit->getDrawX(), unit->getDrawY(), unit->width(), unit->height())) {\n    if(mouse.left_button_pressed() && !mouse.left_button_held()) {\n      unit->select();\n    }\n  }\n\n  if(mouse.right_button_pressed()) {\n    devastator->unselect();\n    unit->unselect();\n  }\n\n  if (mouse.dragged_rectangle()) {\n    int rectX = map_camera->worldCoordinateX(mouse.getRectX());\n    int rectY = map_camera->worldCoordinateY(mouse.getRectY());\n    int endX = map_camera->worldCoordinateX(mouse.x());\n    int endY = map_camera->worldCoordinateY(mouse.y());\n\n    if (endX < rectX) swap(endX, rectX);\n    if (endY < rectY) swap(endY, rectY);\n\n    unit->unselect();\n    devastator->unselect();\n\n    if (isUnitInRect(devastator, rectX, rectY, endX, endY)) {\n        devastator->select();\n    }\n\n    if (isUnitInRect(unit, rectX, rectY, endX, endY)) {\n        unit->select();\n    }\n  }\n\n}\n\nint Game::cleanup() {\n  delete map_camera;\n  delete unitRepository;\n  delete unit;\n  delete devastator;\n  SDL_FreeSurface(screen);\n  SDL_FreeSurface(tileset);\n  SDL_Quit();\n  return 0;\n}\n\nbool Game::isUnitInRect(Unit* unit, int x, int y, int end_x, int end_y) {\n  \/\/ this checks the up-left position of a unit: TODO: do rectangle intersection\n  int unit_x = unit->getDrawX();\n  int unit_y = unit->getDrawY();\n  return (unit_x >= x && unit_x < end_x) && (unit_y >= y && unit_y < end_y);\n}\n\nbool Game::isInRect(int x, int y, int width, int height) {\n  int mouse_x = mouse.x();\n  int mouse_y = mouse.y();\n  return (mouse_x >= x && mouse_x < (x + width)) && (mouse_y >= y && mouse_y < (y + height));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n *           ___        __                                                    *\n *          \/\\_ \\    __\/\\ \\                                                   *\n *          \\\/\/\\ \\  \/\\_\\ \\ \\____    ___   _____   _____      __               *\n *            \\ \\ \\ \\\/\\ \\ \\ '__`\\  \/'___\\\/\\ '__`\\\/\\ '__`\\  \/'__`\\             *\n *             \\_\\ \\_\\ \\ \\ \\ \\L\\ \\\/\\ \\__\/\\ \\ \\L\\ \\ \\ \\L\\ \\\/\\ \\L\\.\\_           *\n *             \/\\____\\\\ \\_\\ \\_,__\/\\ \\____\\\\ \\ ,__\/\\ \\ ,__\/\\ \\__\/.\\_\\          *\n *             \\\/____\/ \\\/_\/\\\/___\/  \\\/____\/ \\ \\ \\\/  \\ \\ \\\/  \\\/__\/\\\/_\/          *\n *                                          \\ \\_\\   \\ \\_\\                     *\n *                                           \\\/_\/    \\\/_\/                     *\n *                                                                            *\n * Copyright (C) 2011, 2012                                                   *\n * Dominik Charousset <dominik.charousset@haw-hamburg.de>                     *\n *                                                                            *\n * This file is part of libcppa.                                              *\n * libcppa is free software: you can redistribute it and\/or modify it under   *\n * the terms of the GNU Lesser General Public License as published by the     *\n * Free Software Foundation, either version 3 of the License                  *\n * or (at your option) any later version.                                     *\n *                                                                            *\n * libcppa is distributed in the hope 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 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 libcppa. If not, see <http:\/\/www.gnu.org\/licenses\/>.            *\n\\******************************************************************************\/\n\n\n#ifndef VALUE_GUARD_HPP\n#define VALUE_GUARD_HPP\n\n#include \"cppa\/util\/rm_ref.hpp\"\n#include \"cppa\/util\/void_type.hpp\"\n#include \"cppa\/util\/type_list.hpp\"\n#include \"cppa\/util\/callable_trait.hpp\"\n\n#include \"cppa\/detail\/tdata.hpp\"\n\nnamespace cppa { namespace detail {\n\ntemplate<bool IsFun, typename T>\nstruct vg_fwd_\n{\n    static inline T const& _(T const& arg) { return arg; }\n    static inline T&& _(T&& arg) { return std::move(arg); }\n    static inline T& _(T& arg) { return arg; }\n};\n\ntemplate<typename T>\nstruct vg_fwd_<true, T>\n{\n    template<typename Arg>\n    static inline util::void_type _(Arg&&) { return {}; }\n};\n\n\/\/ absorbs callables\ntemplate<typename T>\nstruct vg_fwd\n        : vg_fwd_<util::is_callable<typename util::rm_ref<T>::type>::value,\n                  typename util::rm_ref<T>::type>\n{\n};\n\ntemplate<typename FilteredPattern>\nclass value_guard\n{\n    typename tdata_from_type_list<FilteredPattern>::type m_args;\n\n    template<typename... Args>\n    inline bool _eval(util::void_type const&, tdata<> const&, Args&&...) const\n    {\n        return true;\n    }\n\n    template<class Tail, typename Arg0, typename... Args>\n    inline bool _eval(util::void_type const&, Tail const& tail,\n                      Arg0 const&, Args const&... args         ) const\n    {\n        return _eval(tail.head, tail.tail(), args...);\n    }\n\n    template<typename Head, class Tail, typename Arg0, typename... Args>\n    inline bool _eval(Head const& head, Tail const& tail,\n                      Arg0 const& arg0, Args const&... args) const\n    {\n        return head == arg0 && _eval(tail.head, tail.tail(), args...);\n    }\n\n public:\n\n    value_guard() = default;\n    value_guard(value_guard const&) = default;\n\n    template<typename... Args>\n    value_guard(Args const&... args) : m_args(vg_fwd<Args>::_(args)...)\n    {\n    }\n\n    template<typename... Args>\n    inline bool operator()(Args const&... args) const\n    {\n        return _eval(m_args.head, m_args.tail(), args...);\n    }\n};\n\n} } \/\/ namespace cppa::detail\n\n#endif \/\/ VALUE_GUARD_HPP\n<commit_msg>fixed reference_wrapper handling<commit_after>\/******************************************************************************\\\n *           ___        __                                                    *\n *          \/\\_ \\    __\/\\ \\                                                   *\n *          \\\/\/\\ \\  \/\\_\\ \\ \\____    ___   _____   _____      __               *\n *            \\ \\ \\ \\\/\\ \\ \\ '__`\\  \/'___\\\/\\ '__`\\\/\\ '__`\\  \/'__`\\             *\n *             \\_\\ \\_\\ \\ \\ \\ \\L\\ \\\/\\ \\__\/\\ \\ \\L\\ \\ \\ \\L\\ \\\/\\ \\L\\.\\_           *\n *             \/\\____\\\\ \\_\\ \\_,__\/\\ \\____\\\\ \\ ,__\/\\ \\ ,__\/\\ \\__\/.\\_\\          *\n *             \\\/____\/ \\\/_\/\\\/___\/  \\\/____\/ \\ \\ \\\/  \\ \\ \\\/  \\\/__\/\\\/_\/          *\n *                                          \\ \\_\\   \\ \\_\\                     *\n *                                           \\\/_\/    \\\/_\/                     *\n *                                                                            *\n * Copyright (C) 2011, 2012                                                   *\n * Dominik Charousset <dominik.charousset@haw-hamburg.de>                     *\n *                                                                            *\n * This file is part of libcppa.                                              *\n * libcppa is free software: you can redistribute it and\/or modify it under   *\n * the terms of the GNU Lesser General Public License as published by the     *\n * Free Software Foundation, either version 3 of the License                  *\n * or (at your option) any later version.                                     *\n *                                                                            *\n * libcppa is distributed in the hope 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 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 libcppa. If not, see <http:\/\/www.gnu.org\/licenses\/>.            *\n\\******************************************************************************\/\n\n\n#ifndef VALUE_GUARD_HPP\n#define VALUE_GUARD_HPP\n\n#include \"cppa\/util\/rm_ref.hpp\"\n#include \"cppa\/util\/void_type.hpp\"\n#include \"cppa\/util\/type_list.hpp\"\n#include \"cppa\/util\/callable_trait.hpp\"\n\n#include \"cppa\/detail\/tdata.hpp\"\n\nnamespace cppa { namespace detail {\n\ntemplate<bool IsFun, typename T>\nstruct vg_fwd_\n{\n    static inline T const& _(T const& arg) { return arg; }\n    static inline T&& _(T&& arg) { return std::move(arg); }\n    static inline T& _(T& arg) { return arg; }\n};\n\ntemplate<typename T>\nstruct vg_fwd_<true, T>\n{\n    template<typename Arg>\n    static inline util::void_type _(Arg&&) { return {}; }\n};\n\n\/\/ absorbs callables\ntemplate<typename T>\nstruct vg_fwd\n        : vg_fwd_<util::is_callable<typename util::rm_ref<T>::type>::value,\n                  typename util::rm_ref<T>::type>\n{\n};\n\ntemplate<typename FilteredPattern>\nclass value_guard\n{\n    typename tdata_from_type_list<FilteredPattern>::type m_args;\n\n    template<typename... Args>\n    static inline bool _eval(util::void_type const&, tdata<> const&,\n                             Args const&...)\n    {\n        return true;\n    }\n\n    template<class Tail, typename Arg0, typename... Args>\n    static inline bool _eval(util::void_type const&, Tail const& tail,\n                             Arg0 const&, Args const&... args         )\n    {\n        return _eval(tail.head, tail.tail(), args...);\n    }\n\n    template<typename T0, typename T1>\n    static inline bool cmp(T0 const& lhs, T1 const& rhs)\n    {\n        return lhs == rhs;\n    }\n\n    template<typename T0, typename T1>\n    static inline bool cmp(T0 const& lhs, std::reference_wrapper<T1> const& rhs)\n    {\n        return lhs == rhs.get();\n    }\n\n    template<typename Head, class Tail, typename Arg0, typename... Args>\n    static inline bool _eval(Head const& head, Tail const& tail,\n                             Arg0 const& arg0, Args const&... args)\n    {\n        return cmp(head, arg0) && _eval(tail.head, tail.tail(), args...);\n    }\n\n public:\n\n    value_guard() = default;\n    value_guard(value_guard const&) = default;\n\n    template<typename... Args>\n    value_guard(Args const&... args) : m_args(vg_fwd<Args>::_(args)...)\n    {\n    }\n\n    template<typename... Args>\n    inline bool operator()(Args const&... args) const\n    {\n        return _eval(m_args.head, m_args.tail(), args...);\n    }\n};\n\n} } \/\/ namespace cppa::detail\n\n#endif \/\/ VALUE_GUARD_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/==============================================================================\n\n#include <game.hpp>\n#include <engine.hpp>\n#include <entity.hpp>\n#include <entity_manager.hpp>\n#include <clump_manager.hpp>\n#include <viewport.hpp>\n#include <fujin.hpp>\n#include <cloud.hpp>\n#include <girder.hpp>\n#include <score.hpp>\n\n#include <hgeresource.h>\n\n#include <algorithm>\n\nnamespace\n{\n    const float ZOOM[5] = { 1.0f, 1.8f, 3.2f, 5.8f, 10.5f };\n\n    bool\n    lessThan( const Entity * left, const Entity * right )\n    {\n        if ( left->getScale() < right->getScale() * 0.99f )\n        {\n            return true;\n        }\n        if ( left->getScale() * 0.99f > right->getScale() )\n        {\n            return false;\n        }\n        if ( left->getType() < right->getType() )\n        {\n            return true;\n        }\n        return false;\n    }\n}\n\n\/\/==============================================================================\nGame::Game()\n    :\n    Context(),\n    m_last_zoom( 1.0f ),\n    m_zoom( 0 ),\n    m_fujin( 0 )\n{\n}\n\n\/\/------------------------------------------------------------------------------\nGame::~Game()\n{\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ public:\n\/\/------------------------------------------------------------------------------\nvoid\nGame::init()\n{\n    HGE * hge( Engine::hge() );\n    b2World * b2d( Engine::b2d() );\n    hgeResourceManager * rm( Engine::rm() );\n    ViewPort * vp( Engine::vp() );\n\n    notifyOnCollision( true );\n\n    Fujin::registerEntity();\n    Cloud::registerEntity();\n    Girder::registerEntity();\n\n    m_zoom = 0;\n\n\tm_timeRemaining = 300;\n\tm_score = 0;\n    Engine::em()->init();\n\tEngine::cm()->init();\n\n    vp->offset().x = 0.0f;\n    vp->offset().y = 0.0f;\n    vp->bounds().x = 800.0f;\n    vp->bounds().y = 600.0f;\n    vp->setAngle( 0.0f );\n    vp->setScale( ZOOM[m_zoom] );\n\n    m_fujin = static_cast< Fujin * >( Engine::em()->factory( Fujin::TYPE ) );\n    b2Vec2 position( 0.0f, 0.0f );\n    float angle( 0.0f );\n    m_fujin->setSprite( \"fujin\" );\n    m_fujin->setScale( 1.0f \/ ZOOM[m_zoom] );\n    m_fujin->init();\n    m_fujin->getBody()->SetXForm( position, angle );\n\n    for ( int zoom = 0; zoom < 5; ++ zoom )\n    {\n\tfor (int i = 0; i < 8; ++i)\n\t{\n\t\tEntity* entity = Engine::em()->factory( Cloud::TYPE );\n\t\tb2Vec2 position( Engine::hge()->Random_Float( -400.0f, 400.0f),\n                         Engine::hge()->Random_Float( -300.0f, 300.0f) );\n\t\tfloat angle( 0.f );\n\t\tentity->setSprite( \"cloud\" );\n\t\tentity->setScale( 1.0f \/ ZOOM[zoom] );\n\t\tentity->init();\n\t\tentity->getBody()->SetXForm( position, angle );\n        static_cast< Cloud * >( entity )->setZoom( zoom );\n\t}\n    }\n\n    _initArena();\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nGame::fini()\n{\n    notifyOnCollision( false );\n\n    Engine::cm()->fini();\n\tEngine::em()->fini();\n}\n\n\/\/------------------------------------------------------------------------------\nbool\nGame::update( float dt )\n{\n\tm_timeRemaining -= dt;\n    const Controller & pad( Engine::instance()->getController() );\n    HGE * hge( Engine::hge() );\n    ViewPort * vp( Engine::vp() );\n\n    if ( pad.buttonDown( XPAD_BUTTON_BUTTON_Y ) )\n    {\n        Engine::instance()->switchContext( STATE_SCORE );\n        Context * context( Engine::instance()->getContext() );\n        static_cast< Score * >( context )->setValue( 13 );\n        return false;\n    }\n\n\tEngine::cm()->update( dt );\n    Engine::em()->update( dt );\n\n    if ( Engine::instance()->isPaused() )\n    {\n        return false;\n    }\n\n    if ( pad.isConnected() )\n    {\n        if ( pad.buttonDown( XPAD_BUTTON_LEFT_SHOULDER ) && m_zoom > 0 )\n        {\n            --m_zoom;\n        }\n        else if ( pad.buttonDown( XPAD_BUTTON_RIGHT_SHOULDER ) && m_zoom < 4 )\n        {\n            ++m_zoom;\n        }\n    }\n    else\n    {\n        if ( ( Engine::hge()->Input_KeyDown( HGEK_Q ) ||\n               hge->Input_GetMouseWheel() < 0 ) && m_zoom > 0 )\n        {\n            --m_zoom;\n        }\n        else if ( ( Engine::hge()->Input_KeyDown( HGEK_E ) ||\n                    hge->Input_GetMouseWheel() > 0 ) && m_zoom < 4 )\n        {\n            ++m_zoom;\n        }\n    }\n\n    if ( ZOOM[m_zoom] > m_last_zoom )\n    {\n        m_last_zoom += ( ZOOM[m_zoom] - m_last_zoom ) * dt * 10.0f;\n        vp->setScale( m_last_zoom );\n        m_fujin->setScale( 1.0f \/ m_last_zoom );\n    }\n    else if ( ZOOM[m_zoom] < m_last_zoom )\n    {\n        m_last_zoom += ( ZOOM[m_zoom] - m_last_zoom ) * dt * 10.0f;\n        vp->setScale( m_last_zoom );\n        m_fujin->setScale( 1.0f \/ m_last_zoom );\n    }\n\n    vp->offset() = m_fujin->getBody()->GetPosition();\n\n    return false;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nGame::render()\n{\n\thgeResourceManager * rm( Engine::rm() );\n\thgeFont* font = Engine::rm()->GetFont(\"menu\");\n\tb2Vec2 timeTextLocation (700,10);\n\tb2Vec2 scoreTextLocation(0,10);\n\tchar timeRemainingText[10];\n\tsprintf_s(timeRemainingText,\"%d:%d\",(int)m_timeRemaining\/60,(int)(m_timeRemaining)%60);\n\n\tchar scoreText[15];\n\tsprintf_s(scoreText,\"Score: %5d\",m_score);\n\n\n    ViewPort * vp( Engine::vp() );\n\t\n\n    vp->setTransform();\n\n\t\/\/ render time remaining\n    rm->GetSprite( \"polluted\" )->RenderEx( 0.0f, 0.0f, 0.0f, 2.0f );\n\t\n\t\n\/\/\tscoreTextLocation.x =m_zoom-1 * vp->offset().x; \n\t\/\/scoreTextLocation.y=m_zoom-1 * vp->offset().y;\n\t\n\t\n    std::vector< Entity * > entities;\n    for ( b2Body * body( Engine::b2d()->GetBodyList() ); body != NULL;\n          body = body->GetNext() )\n    {\n        Entity * entity( static_cast< Entity * >( body->GetUserData() ) );\n        if ( entity )\n        {\n            entities.push_back( entity );\n        }\n    }\n\n    std::sort( entities.begin(), entities.end(), lessThan );\n\n    std::vector< Entity * >::iterator i;\n    float scale( 1.0f \/ static_cast< float >( ZOOM[m_zoom] ) );\n    for ( i = entities.begin(); i != entities.end(); ++i )\n    {\n        Entity * entity( * i );\n        entity->render( scale );\n    }\n\n\tEngine::hge()->Gfx_SetTransform();\n\tfont->SetColor(0xFFFFFFFF);\n\tfont->Render( timeTextLocation.x, timeTextLocation.y, HGETEXT_LEFT, timeRemainingText );\n\tfont->Render( scoreTextLocation.x, scoreTextLocation.y, HGETEXT_LEFT, scoreText );\n\n\t\n\t\n\t\n}\n\n\/\/------------------------------------------------------------------------------\nbool\nGame::shouldCollide( Entity * left, Entity * right )\n{\n    if ( left->getType() == Girder::TYPE ||\n         right->getType() == Girder::TYPE )\n    {\n        return true;\n    }\n\n    if ( left->getScale() > right->getScale() * 0.99f &&\n         left->getScale() * 0.99f < right->getScale() )\n    {\n        return left->getType() == right->getType();\n    }\n\n    return false;\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ private:\n\/\/------------------------------------------------------------------------------\nvoid\nGame::_initArena()\n{\n    b2Vec2 position( 0.0f, 0.0f );\n    b2Vec2 dimensions( 0.0f, 0.0f );\n    Entity * entity( 0 );\n\n    for ( int i = 0; i < 4; ++i )\n    {\n        switch( i )\n        {\n            case 0:\n            {\n                dimensions.x = 800.0f;\n                dimensions.y = 1.0f;\n                position.x = 0.0f;\n                position.y = -300.0f;\n                break;\n            }\n            case 1:\n            {\n                dimensions.x = 1.0f;\n                dimensions.y = 600.0f;\n                position.x = 400.0f;\n                position.y = 0.0f;\n                break;\n            }\n            case 2:\n            {\n                dimensions.x = 800.0f;\n                dimensions.y = 1.0f;\n                position.x = 0.0f;\n                position.y = 300.0f;\n                break;\n            }\n            case 3:\n            {\n                dimensions.x = 1.0f;\n                dimensions.y = 600.0f;\n                position.x = -400.0f;\n                position.y = 0.0f;\n                break;\n            }\n        }\n        Girder * girder( static_cast< Girder * >(\n            Engine::em()->factory( Girder::TYPE ) ) );\n        girder->setScale( 1.0f );\n        girder->setDimensions( dimensions );\n        girder->init();\n        girder->getBody()->SetXForm( position, 0.0f );\n    }\n}\n<commit_msg>set the timer so it will run out<commit_after>\/\/==============================================================================\n\n#include <game.hpp>\n#include <engine.hpp>\n#include <entity.hpp>\n#include <entity_manager.hpp>\n#include <clump_manager.hpp>\n#include <viewport.hpp>\n#include <fujin.hpp>\n#include <cloud.hpp>\n#include <girder.hpp>\n#include <score.hpp>\n\n#include <hgeresource.h>\n\n#include <algorithm>\n\nnamespace\n{\n    const float ZOOM[5] = { 1.0f, 1.8f, 3.2f, 5.8f, 10.5f };\n\n    bool\n    lessThan( const Entity * left, const Entity * right )\n    {\n        if ( left->getScale() < right->getScale() * 0.99f )\n        {\n            return true;\n        }\n        if ( left->getScale() * 0.99f > right->getScale() )\n        {\n            return false;\n        }\n        if ( left->getType() < right->getType() )\n        {\n            return true;\n        }\n        return false;\n    }\n}\n\n\/\/==============================================================================\nGame::Game()\n    :\n    Context(),\n    m_last_zoom( 1.0f ),\n    m_zoom( 0 ),\n    m_fujin( 0 )\n{\n}\n\n\/\/------------------------------------------------------------------------------\nGame::~Game()\n{\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ public:\n\/\/------------------------------------------------------------------------------\nvoid\nGame::init()\n{\n    HGE * hge( Engine::hge() );\n    b2World * b2d( Engine::b2d() );\n    hgeResourceManager * rm( Engine::rm() );\n    ViewPort * vp( Engine::vp() );\n\n    notifyOnCollision( true );\n\n    Fujin::registerEntity();\n    Cloud::registerEntity();\n    Girder::registerEntity();\n\n    m_zoom = 0;\n\n\tm_timeRemaining = 300;\n\tm_score = 0;\n    Engine::em()->init();\n\tEngine::cm()->init();\n\n    vp->offset().x = 0.0f;\n    vp->offset().y = 0.0f;\n    vp->bounds().x = 800.0f;\n    vp->bounds().y = 600.0f;\n    vp->setAngle( 0.0f );\n    vp->setScale( ZOOM[m_zoom] );\n\n    m_fujin = static_cast< Fujin * >( Engine::em()->factory( Fujin::TYPE ) );\n    b2Vec2 position( 0.0f, 0.0f );\n    float angle( 0.0f );\n    m_fujin->setSprite( \"fujin\" );\n    m_fujin->setScale( 1.0f \/ ZOOM[m_zoom] );\n    m_fujin->init();\n    m_fujin->getBody()->SetXForm( position, angle );\n\n    for ( int zoom = 0; zoom < 5; ++ zoom )\n    {\n\tfor (int i = 0; i < 8; ++i)\n\t{\n\t\tEntity* entity = Engine::em()->factory( Cloud::TYPE );\n\t\tb2Vec2 position( Engine::hge()->Random_Float( -400.0f, 400.0f),\n                         Engine::hge()->Random_Float( -300.0f, 300.0f) );\n\t\tfloat angle( 0.f );\n\t\tentity->setSprite( \"cloud\" );\n\t\tentity->setScale( 1.0f \/ ZOOM[zoom] );\n\t\tentity->init();\n\t\tentity->getBody()->SetXForm( position, angle );\n        static_cast< Cloud * >( entity )->setZoom( zoom );\n\t}\n    }\n\n    _initArena();\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nGame::fini()\n{\n    notifyOnCollision( false );\n\n    Engine::cm()->fini();\n\tEngine::em()->fini();\n}\n\n\/\/------------------------------------------------------------------------------\nbool\nGame::update( float dt )\n{\n\tm_timeRemaining -= dt;\n    const Controller & pad( Engine::instance()->getController() );\n    HGE * hge( Engine::hge() );\n    ViewPort * vp( Engine::vp() );\n\t\n    if ( m_timeRemaining <= 0)\n    {\n        Engine::instance()->switchContext( STATE_SCORE );\n        Context * context( Engine::instance()->getContext() );\n        static_cast< Score * >( context )->setValue( 13 );\n        return false;\n    }\n\n\tEngine::cm()->update( dt );\n    Engine::em()->update( dt );\n\n    if ( Engine::instance()->isPaused() )\n    {\n        return false;\n    }\n\n    if ( pad.isConnected() )\n    {\n        if ( pad.buttonDown( XPAD_BUTTON_LEFT_SHOULDER ) && m_zoom > 0 )\n        {\n            --m_zoom;\n        }\n        else if ( pad.buttonDown( XPAD_BUTTON_RIGHT_SHOULDER ) && m_zoom < 4 )\n        {\n            ++m_zoom;\n        }\n    }\n    else\n    {\n        if ( ( Engine::hge()->Input_KeyDown( HGEK_Q ) ||\n               hge->Input_GetMouseWheel() < 0 ) && m_zoom > 0 )\n        {\n            --m_zoom;\n        }\n        else if ( ( Engine::hge()->Input_KeyDown( HGEK_E ) ||\n                    hge->Input_GetMouseWheel() > 0 ) && m_zoom < 4 )\n        {\n            ++m_zoom;\n        }\n    }\n\n    if ( ZOOM[m_zoom] > m_last_zoom )\n    {\n        m_last_zoom += ( ZOOM[m_zoom] - m_last_zoom ) * dt * 10.0f;\n        vp->setScale( m_last_zoom );\n        m_fujin->setScale( 1.0f \/ m_last_zoom );\n    }\n    else if ( ZOOM[m_zoom] < m_last_zoom )\n    {\n        m_last_zoom += ( ZOOM[m_zoom] - m_last_zoom ) * dt * 10.0f;\n        vp->setScale( m_last_zoom );\n        m_fujin->setScale( 1.0f \/ m_last_zoom );\n    }\n\n    vp->offset() = m_fujin->getBody()->GetPosition();\n\n    return false;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nGame::render()\n{\n\thgeResourceManager * rm( Engine::rm() );\n\thgeFont* font = Engine::rm()->GetFont(\"menu\");\n\tb2Vec2 timeTextLocation (700,10);\n\tb2Vec2 scoreTextLocation(0,10);\n\tchar timeRemainingText[10];\n\tsprintf_s(timeRemainingText,\"%d:%d\",(int)m_timeRemaining\/60,(int)(m_timeRemaining)%60);\n\n\tchar scoreText[15];\n\tsprintf_s(scoreText,\"Score: %5d\",m_score);\n\n\n    ViewPort * vp( Engine::vp() );\n\t\n\n    vp->setTransform();\n\n\n    rm->GetSprite( \"polluted\" )->RenderEx( 0.0f, 0.0f, 0.0f, 2.0f );\n\t\n\t\n\n\t\n    std::vector< Entity * > entities;\n    for ( b2Body * body( Engine::b2d()->GetBodyList() ); body != NULL;\n          body = body->GetNext() )\n    {\n        Entity * entity( static_cast< Entity * >( body->GetUserData() ) );\n        if ( entity )\n        {\n            entities.push_back( entity );\n        }\n    }\n\n    std::sort( entities.begin(), entities.end(), lessThan );\n\n    std::vector< Entity * >::iterator i;\n    float scale( 1.0f \/ static_cast< float >( ZOOM[m_zoom] ) );\n    for ( i = entities.begin(); i != entities.end(); ++i )\n    {\n        Entity * entity( * i );\n        entity->render( scale );\n    }\n\t\/\/ render time remaining\n\tEngine::hge()->Gfx_SetTransform();\n\tfont->SetColor(0xFFFFFFFF);\n\tfont->Render( timeTextLocation.x, timeTextLocation.y, HGETEXT_LEFT, timeRemainingText );\n\tfont->Render( scoreTextLocation.x, scoreTextLocation.y, HGETEXT_LEFT, scoreText );\n\n\t\n\t\n\t\n}\n\n\/\/------------------------------------------------------------------------------\nbool\nGame::shouldCollide( Entity * left, Entity * right )\n{\n    if ( left->getType() == Girder::TYPE ||\n         right->getType() == Girder::TYPE )\n    {\n        return true;\n    }\n\n    if ( left->getScale() > right->getScale() * 0.99f &&\n         left->getScale() * 0.99f < right->getScale() )\n    {\n        return left->getType() == right->getType();\n    }\n\n    return false;\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ private:\n\/\/------------------------------------------------------------------------------\nvoid\nGame::_initArena()\n{\n    b2Vec2 position( 0.0f, 0.0f );\n    b2Vec2 dimensions( 0.0f, 0.0f );\n    Entity * entity( 0 );\n\n    for ( int i = 0; i < 4; ++i )\n    {\n        switch( i )\n        {\n            case 0:\n            {\n                dimensions.x = 800.0f;\n                dimensions.y = 1.0f;\n                position.x = 0.0f;\n                position.y = -300.0f;\n                break;\n            }\n            case 1:\n            {\n                dimensions.x = 1.0f;\n                dimensions.y = 600.0f;\n                position.x = 400.0f;\n                position.y = 0.0f;\n                break;\n            }\n            case 2:\n            {\n                dimensions.x = 800.0f;\n                dimensions.y = 1.0f;\n                position.x = 0.0f;\n                position.y = 300.0f;\n                break;\n            }\n            case 3:\n            {\n                dimensions.x = 1.0f;\n                dimensions.y = 600.0f;\n                position.x = -400.0f;\n                position.y = 0.0f;\n                break;\n            }\n        }\n        Girder * girder( static_cast< Girder * >(\n            Engine::em()->factory( Girder::TYPE ) ) );\n        girder->setScale( 1.0f );\n        girder->setDimensions( dimensions );\n        girder->init();\n        girder->getBody()->SetXForm( position, 0.0f );\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>second attempt to blind fix MSVC werror C4701,C4703<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <limits.h>\n#include <stdlib.h>\n#include <process.h>\n\n#include \"PwsPlatform.h\"\n#include \"PWSrand.h\"\n\n\/\/ See the MSDN documentation for RtlGenRandom. We will try to load it\n\/\/ and if that fails, use our own random number generator. The function\n\/\/ call is indirected through a function pointer\n\nstatic BOOLEAN (APIENTRY *pfnGetRandomData)(void*, ULONG) = NULL;\n\nstatic bool __stdcall LoadRandomDataFunction();\n\nPWSrand *PWSrand::self = NULL;\n\nPWSrand *PWSrand::GetInstance()\n{\n  if (self == NULL) {\n    self = new PWSrand;\n  }\n  return self;\n}\n\nvoid PWSrand::DeleteInstance()\n{\n  delete self;\n  self = NULL;\n}\n\nPWSrand::PWSrand()\n  : ibRandomData(SHA256::HASHLEN)\n{\n  m_IsInternalPRNG = !LoadRandomDataFunction();\n\n  SHA256 s;\n  time_t t = time(NULL);\n  int pid = _getpid();\n  DWORD ticks = GetTickCount();\n\n  s.Update((const unsigned char *)&t, sizeof(t));\n  s.Update((const unsigned char *)&pid, sizeof(pid));\n  s.Update((const unsigned char *)&ticks, sizeof(ticks));\n\n  s.Final(K);\n}\n\nPWSrand::~PWSrand()\n{\n}\n\nvoid PWSrand::AddEntropy(unsigned char *bytes, unsigned int numBytes)\n{\n  ASSERT(bytes != NULL);\n\n  SHA256 s;\n\n  s.Update(K, sizeof(K));\n  s.Update(bytes, numBytes);\n  s.Final(K);\n  \/\/  TRACE1(_T(\"PWSrand::AddEntropy! %x\\n\"), bytes[0]);\n}\n\nvoid PWSrand::NextRandBlock()\n{\n  SHA256 s;\n  s.Update(K, sizeof(K));\n  s.Final(R);\n  unsigned int *Kp = (unsigned int *)K;\n  unsigned int *Rp = (unsigned int *)R;\n  const int N = SHA256::HASHLEN\/sizeof(unsigned int);\n  \n  Kp[0]++;\n\n  for (int i = 0; i < N; i++)\n    Kp[i] += Rp[i];\n}\n\nvoid PWSrand::GetRandomData( void * const buffer, unsigned long length )\n{\n  if (!m_IsInternalPRNG) {\n    ASSERT(pfnGetRandomData != NULL);\n    (void)(*pfnGetRandomData)(buffer, length);\n  } else {\n    unsigned char *pb = (unsigned char *)buffer;\n    while (length > SHA256::HASHLEN) {\n      NextRandBlock();\n      for (int j = 0; j < SHA256::HASHLEN; j++)\n        pb[j] = R[j];\n      length -= SHA256::HASHLEN;\n      pb += SHA256::HASHLEN;\n    }\n    ASSERT(length <= SHA256::HASHLEN);\n    if (length > 0) {\n      unsigned long i = 0;\n      NextRandBlock();\n      while (i < length) {\n        pb[i] = R[i];\n        i++;\n      }\n    }\n  }\n}\n\n\/\/ generate random numbers from a buffer filled in by GetRandomData()\nunsigned int PWSrand::RandUInt()\n{\n  \/\/ we don't want to keep filling the random buffer for each number we\n  \/\/ want, so fill the buffer with random data and use it up\n\n  if( ibRandomData > ( SHA256::HASHLEN - sizeof( unsigned int ) ) ) {\n    \/\/ no data left, refill the buffer\n    GetRandomData(rgbRandomData, SHA256::HASHLEN);\n    ibRandomData = 0;\n  }\n\n  const unsigned int u = \n    *(reinterpret_cast<unsigned int *>(rgbRandomData + ibRandomData));\n  ibRandomData += sizeof(unsigned int);\n  return u;\n}\n\n\/* \n *  RangeRand(len)\n *\n *  Returns a random number in the range 0 to (len-1).\n *  For example, RangeRand(256) returns a value from 0 to 255.\n *\/\nunsigned int PWSrand::RangeRand(size_t len)\n{\n  unsigned int      r;\n  const unsigned int ceil = UINT_MAX - (UINT_MAX % len) - 1;\n  while ((r = RandUInt()) > ceil)\n    ;\n  return(r%len);\n}\n\n\n\nstatic bool __stdcall LoadRandomDataFunction()\n{\n  HMODULE hLib = LoadLibrary(_T(\"ADVAPI32.DLL\"));\n  if (hLib != NULL) {\n    BOOLEAN (APIENTRY *pfnGetRandomDataT)(void*, ULONG);\n    pfnGetRandomDataT = (BOOLEAN (APIENTRY *)(void*,ULONG))GetProcAddress(hLib,\"SystemFunction036\");\n    if (pfnGetRandomDataT) {\n      pfnGetRandomData = pfnGetRandomDataT;\n    }\n  }\n  return (hLib != NULL);\n}\n \n<commit_msg>Fixed assert under win2k (thanks to DK!)<commit_after>#include <limits.h>\n#include <stdlib.h>\n#include <process.h>\n\n#include \"PwsPlatform.h\"\n#include \"PWSrand.h\"\n\n\/\/ See the MSDN documentation for RtlGenRandom. We will try to load it\n\/\/ and if that fails, use our own random number generator. The function\n\/\/ call is indirected through a function pointer\n\nstatic BOOLEAN (APIENTRY *pfnGetRandomData)(void*, ULONG) = NULL;\n\nstatic bool __stdcall LoadRandomDataFunction();\n\nPWSrand *PWSrand::self = NULL;\n\nPWSrand *PWSrand::GetInstance()\n{\n  if (self == NULL) {\n    self = new PWSrand;\n  }\n  return self;\n}\n\nvoid PWSrand::DeleteInstance()\n{\n  delete self;\n  self = NULL;\n}\n\nPWSrand::PWSrand()\n  : ibRandomData(SHA256::HASHLEN)\n{\n  m_IsInternalPRNG = !LoadRandomDataFunction();\n\n  SHA256 s;\n  time_t t = time(NULL);\n  int pid = _getpid();\n  DWORD ticks = GetTickCount();\n\n  s.Update((const unsigned char *)&t, sizeof(t));\n  s.Update((const unsigned char *)&pid, sizeof(pid));\n  s.Update((const unsigned char *)&ticks, sizeof(ticks));\n\n  s.Final(K);\n}\n\nPWSrand::~PWSrand()\n{\n}\n\nvoid PWSrand::AddEntropy(unsigned char *bytes, unsigned int numBytes)\n{\n  ASSERT(bytes != NULL);\n\n  SHA256 s;\n\n  s.Update(K, sizeof(K));\n  s.Update(bytes, numBytes);\n  s.Final(K);\n  \/\/  TRACE1(_T(\"PWSrand::AddEntropy! %x\\n\"), bytes[0]);\n}\n\nvoid PWSrand::NextRandBlock()\n{\n  SHA256 s;\n  s.Update(K, sizeof(K));\n  s.Final(R);\n  unsigned int *Kp = (unsigned int *)K;\n  unsigned int *Rp = (unsigned int *)R;\n  const int N = SHA256::HASHLEN\/sizeof(unsigned int);\n  \n  Kp[0]++;\n\n  for (int i = 0; i < N; i++)\n    Kp[i] += Rp[i];\n}\n\nvoid PWSrand::GetRandomData( void * const buffer, unsigned long length )\n{\n  if (!m_IsInternalPRNG) {\n    ASSERT(pfnGetRandomData != NULL);\n    (void)(*pfnGetRandomData)(buffer, length);\n  } else {\n    unsigned char *pb = (unsigned char *)buffer;\n    while (length > SHA256::HASHLEN) {\n      NextRandBlock();\n      for (int j = 0; j < SHA256::HASHLEN; j++)\n        pb[j] = R[j];\n      length -= SHA256::HASHLEN;\n      pb += SHA256::HASHLEN;\n    }\n    ASSERT(length <= SHA256::HASHLEN);\n    if (length > 0) {\n      unsigned long i = 0;\n      NextRandBlock();\n      while (i < length) {\n        pb[i] = R[i];\n        i++;\n      }\n    }\n  }\n}\n\n\/\/ generate random numbers from a buffer filled in by GetRandomData()\nunsigned int PWSrand::RandUInt()\n{\n  \/\/ we don't want to keep filling the random buffer for each number we\n  \/\/ want, so fill the buffer with random data and use it up\n\n  if( ibRandomData > ( SHA256::HASHLEN - sizeof( unsigned int ) ) ) {\n    \/\/ no data left, refill the buffer\n    GetRandomData(rgbRandomData, SHA256::HASHLEN);\n    ibRandomData = 0;\n  }\n\n  const unsigned int u = \n    *(reinterpret_cast<unsigned int *>(rgbRandomData + ibRandomData));\n  ibRandomData += sizeof(unsigned int);\n  return u;\n}\n\n\/* \n *  RangeRand(len)\n *\n *  Returns a random number in the range 0 to (len-1).\n *  For example, RangeRand(256) returns a value from 0 to 255.\n *\/\nunsigned int PWSrand::RangeRand(size_t len)\n{\n  unsigned int      r;\n  const unsigned int ceil = UINT_MAX - (UINT_MAX % len) - 1;\n  while ((r = RandUInt()) > ceil)\n    ;\n  return(r%len);\n}\n\n\n\nstatic bool __stdcall LoadRandomDataFunction()\n{\n  HMODULE hLib = LoadLibrary(_T(\"ADVAPI32.DLL\"));\n  BOOLEAN (APIENTRY *pfnGetRandomDataT)(void*, ULONG) = NULL;\n  if (hLib != NULL) {\n    pfnGetRandomDataT = (BOOLEAN (APIENTRY *)(void*,ULONG))GetProcAddress(hLib,\"SystemFunction036\");\n    if (pfnGetRandomDataT) {\n      pfnGetRandomData = pfnGetRandomDataT;\n    }\n  }\n  return (hLib != NULL && pfnGetRandomDataT != NULL);\n}\n \n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#75970: Let's do it in a straightforward fashion.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"RDom.h\"\n#include \"Util.h\"\n#include \"IROperator.h\"\n#include \"Scope.h\"\n\nnamespace Halide {\n\nusing std::string;\nusing std::vector;\n\nRVar::operator Expr() const {\n    return new Internal::Variable(Int(32), name(), domain);\n}\n\nInternal::ReductionDomain build_domain(string name0, Expr min0, Expr extent0, \n                                       string name1, Expr min1, Expr extent1, \n                                       string name2, Expr min2, Expr extent2, \n                                       string name3, Expr min3, Expr extent3) {\n    vector<Internal::ReductionVariable> d;\n    if (min0.defined()) {\n        Internal::ReductionVariable v = {name0, min0, extent0};\n        d.push_back(v);\n    }\n    if (min1.defined()) {\n        Internal::ReductionVariable v = {name1, min1, extent1};\n        d.push_back(v);\n    }\n    if (min2.defined()) {\n        Internal::ReductionVariable v = {name2, min2, extent2};\n        d.push_back(v);\n    }\n    if (min3.defined()) {\n        Internal::ReductionVariable v = {name3, min3, extent3};\n        d.push_back(v);\n    }\n\n    Internal::ReductionDomain dom(d);\n    \n    return dom;\n}\n\n\/\/ We suffix all RVars with $r to prevent unintentional name matches with pure vars called x, y, z, w.\nRDom::RDom(Expr min, Expr extent, string name) {\n    min = cast<int>(min);\n    extent = cast<int>(extent);\n    if (name == \"\") name = Internal::unique_name('r');\n    domain = build_domain(name + \".x$r\", min, extent, \n                          \"\", Expr(), Expr(), \n                          \"\", Expr(), Expr(), \n                          \"\", Expr(), Expr());\n    x = RVar(name + \".x$r\", min, extent, domain);\n}\n\nRDom::RDom(Expr min0, Expr extent0, Expr min1, Expr extent1, string name) {\n    min0 = cast<int>(min0);\n    extent0 = cast<int>(extent0);\n    min1 = cast<int>(min1);\n    extent1 = cast<int>(extent1);\n    if (name == \"\") name = Internal::unique_name('r');\n    domain = build_domain(name + \".x$r\", min0, extent0, \n                          name + \".y$r\", min1, extent1,\n                          \"\", Expr(), Expr(), \n                          \"\", Expr(), Expr());\n    x = RVar(name + \".x$r\", min0, extent0, domain);\n    y = RVar(name + \".y$r\", min1, extent1, domain);\n}\n\nRDom::RDom(Expr min0, Expr extent0, Expr min1, Expr extent1, Expr min2, Expr extent2, string name) {\n    min0 = cast<int>(min0);\n    extent0 = cast<int>(extent0);\n    min1 = cast<int>(min1);\n    extent1 = cast<int>(extent1);\n    min2 = cast<int>(min2);\n    extent2 = cast<int>(extent2);\n    if (name == \"\") name = Internal::unique_name('r');\n    domain = build_domain(name + \".x$r\", min0, extent0, \n                          name + \".y$r\", min1, extent1,\n                          name + \".z$r\", min2, extent2,\n                          \"\", Expr(), Expr());\n    x = RVar(name + \".x$r\", min0, extent1, domain);\n    y = RVar(name + \".y$r\", min1, extent1, domain);\n    z = RVar(name + \".z$r\", min2, extent2, domain);\n}\n\nRDom::RDom(Expr min0, Expr extent0, Expr min1, Expr extent1, Expr min2, Expr extent2, Expr min3, Expr extent3, string name) {\n    min0 = cast<int>(min0);\n    extent0 = cast<int>(extent0);\n    min1 = cast<int>(min1);\n    extent1 = cast<int>(extent1);\n    min2 = cast<int>(min2);\n    extent2 = cast<int>(extent2);\n    min3 = cast<int>(min3);\n    extent3 = cast<int>(extent3);\n    if (name == \"\") name = Internal::unique_name('r');\n    domain = build_domain(name + \".x$r\", min0, extent0, \n                          name + \".y$r\", min1, extent1, \n                          name + \".z$r\", min2, extent2, \n                          name + \".w$r\", min3, extent3);\n    x = RVar(name + \".x$r\", min0, extent1, domain);\n    y = RVar(name + \".y$r\", min1, extent1, domain);\n    z = RVar(name + \".z$r\", min2, extent2, domain);\n    w = RVar(name + \".w$r\", min3, extent3, domain);\n}\n\nRDom::RDom(Buffer b) {   \n    Expr min[4], extent[4];\n    for (int i = 0; i < 4; i++) {\n        if (b.dimensions() > i) {\n            min[i] = b.min(i);\n            extent[i] = b.extent(i);\n        }    \n    }\n    string names[] = {b.name() + \".x$r\", b.name() + \".y$r\", b.name() + \".z$r\", b.name() + \".w$r\"};\n    domain = build_domain(names[0], min[0], extent[0],\n                          names[1], min[1], extent[1],\n                          names[2], min[2], extent[2],\n                          names[3], min[3], extent[3]);    \n    RVar *vars[] = {&x, &y, &z, &w};\n    for (int i = 0; i < 4; i++) {\n        if (b.dimensions() > i) {\n            *(vars[i]) = RVar(names[i], min[i], extent[i], domain);\n        }\n    }\n}\n\nRDom::RDom(ImageParam p) {\n    Expr min[4], extent[4];\n    for (int i = 0; i < 4; i++) {\n        if (p.dimensions() > i) {\n            min[i] = 0;\n            extent[i] = p.extent(i);\n        }    \n    }\n    string names[] = {p.name() + \".x$r\", p.name() + \".y$r\", p.name() + \".z$r\", p.name() + \".w$r\"};\n    domain = build_domain(names[0], min[0], extent[0],\n                          names[1], min[1], extent[1],\n                          names[2], min[2], extent[2],\n                          names[3], min[3], extent[3]);    \n    RVar *vars[] = {&x, &y, &z, &w};\n    for (int i = 0; i < 4; i++) {\n        if (p.dimensions() > i) {\n            *(vars[i]) = RVar(names[i], min[i], extent[i], domain);\n        }\n    }\n}\n\n\nint RDom::dimensions() const {\n    return (int)domain.domain().size();\n}\n\nRVar RDom::operator[](int i) {\n    if (i == 0) return x;\n    if (i == 1) return y;\n    if (i == 2) return z;\n    if (i == 3) return w;\n    assert(false && \"Reduction domain index out of bounds\");\n\treturn x; \/\/ Keep the compiler happy\n}\n\nRDom::operator Expr() const {\n    assert(dimensions() == 1 && \"Can only treat single-dimensional RDoms as expressions\");\n    return Expr(x);\n}\n\nRDom::operator RVar() const {\n    assert(dimensions() == 1 && \"Can only treat single-dimensional RDoms as RVars\");\n    return x;\n}\n\n}\n<commit_msg>Correct copy-paste error affecting RDom of 3 and 4 dimensions.<commit_after>#include \"RDom.h\"\n#include \"Util.h\"\n#include \"IROperator.h\"\n#include \"Scope.h\"\n\nnamespace Halide {\n\nusing std::string;\nusing std::vector;\n\nRVar::operator Expr() const {\n    return new Internal::Variable(Int(32), name(), domain);\n}\n\nInternal::ReductionDomain build_domain(string name0, Expr min0, Expr extent0, \n                                       string name1, Expr min1, Expr extent1, \n                                       string name2, Expr min2, Expr extent2, \n                                       string name3, Expr min3, Expr extent3) {\n    vector<Internal::ReductionVariable> d;\n    if (min0.defined()) {\n        Internal::ReductionVariable v = {name0, min0, extent0};\n        d.push_back(v);\n    }\n    if (min1.defined()) {\n        Internal::ReductionVariable v = {name1, min1, extent1};\n        d.push_back(v);\n    }\n    if (min2.defined()) {\n        Internal::ReductionVariable v = {name2, min2, extent2};\n        d.push_back(v);\n    }\n    if (min3.defined()) {\n        Internal::ReductionVariable v = {name3, min3, extent3};\n        d.push_back(v);\n    }\n\n    Internal::ReductionDomain dom(d);\n    \n    return dom;\n}\n\n\/\/ We suffix all RVars with $r to prevent unintentional name matches with pure vars called x, y, z, w.\nRDom::RDom(Expr min, Expr extent, string name) {\n    min = cast<int>(min);\n    extent = cast<int>(extent);\n    if (name == \"\") name = Internal::unique_name('r');\n    domain = build_domain(name + \".x$r\", min, extent, \n                          \"\", Expr(), Expr(), \n                          \"\", Expr(), Expr(), \n                          \"\", Expr(), Expr());\n    x = RVar(name + \".x$r\", min, extent, domain);\n}\n\nRDom::RDom(Expr min0, Expr extent0, Expr min1, Expr extent1, string name) {\n    min0 = cast<int>(min0);\n    extent0 = cast<int>(extent0);\n    min1 = cast<int>(min1);\n    extent1 = cast<int>(extent1);\n    if (name == \"\") name = Internal::unique_name('r');\n    domain = build_domain(name + \".x$r\", min0, extent0, \n                          name + \".y$r\", min1, extent1,\n                          \"\", Expr(), Expr(), \n                          \"\", Expr(), Expr());\n    x = RVar(name + \".x$r\", min0, extent0, domain);\n    y = RVar(name + \".y$r\", min1, extent1, domain);\n}\n\nRDom::RDom(Expr min0, Expr extent0, Expr min1, Expr extent1, Expr min2, Expr extent2, string name) {\n    min0 = cast<int>(min0);\n    extent0 = cast<int>(extent0);\n    min1 = cast<int>(min1);\n    extent1 = cast<int>(extent1);\n    min2 = cast<int>(min2);\n    extent2 = cast<int>(extent2);\n    if (name == \"\") name = Internal::unique_name('r');\n    domain = build_domain(name + \".x$r\", min0, extent0, \n                          name + \".y$r\", min1, extent1,\n                          name + \".z$r\", min2, extent2,\n                          \"\", Expr(), Expr());\n    x = RVar(name + \".x$r\", min0, extent0, domain);\n    y = RVar(name + \".y$r\", min1, extent1, domain);\n    z = RVar(name + \".z$r\", min2, extent2, domain);\n}\n\nRDom::RDom(Expr min0, Expr extent0, Expr min1, Expr extent1, Expr min2, Expr extent2, Expr min3, Expr extent3, string name) {\n    min0 = cast<int>(min0);\n    extent0 = cast<int>(extent0);\n    min1 = cast<int>(min1);\n    extent1 = cast<int>(extent1);\n    min2 = cast<int>(min2);\n    extent2 = cast<int>(extent2);\n    min3 = cast<int>(min3);\n    extent3 = cast<int>(extent3);\n    if (name == \"\") name = Internal::unique_name('r');\n    domain = build_domain(name + \".x$r\", min0, extent0, \n                          name + \".y$r\", min1, extent1, \n                          name + \".z$r\", min2, extent2, \n                          name + \".w$r\", min3, extent3);\n    x = RVar(name + \".x$r\", min0, extent0, domain);\n    y = RVar(name + \".y$r\", min1, extent1, domain);\n    z = RVar(name + \".z$r\", min2, extent2, domain);\n    w = RVar(name + \".w$r\", min3, extent3, domain);\n}\n\nRDom::RDom(Buffer b) {   \n    Expr min[4], extent[4];\n    for (int i = 0; i < 4; i++) {\n        if (b.dimensions() > i) {\n            min[i] = b.min(i);\n            extent[i] = b.extent(i);\n        }    \n    }\n    string names[] = {b.name() + \".x$r\", b.name() + \".y$r\", b.name() + \".z$r\", b.name() + \".w$r\"};\n    domain = build_domain(names[0], min[0], extent[0],\n                          names[1], min[1], extent[1],\n                          names[2], min[2], extent[2],\n                          names[3], min[3], extent[3]);    \n    RVar *vars[] = {&x, &y, &z, &w};\n    for (int i = 0; i < 4; i++) {\n        if (b.dimensions() > i) {\n            *(vars[i]) = RVar(names[i], min[i], extent[i], domain);\n        }\n    }\n}\n\nRDom::RDom(ImageParam p) {\n    Expr min[4], extent[4];\n    for (int i = 0; i < 4; i++) {\n        if (p.dimensions() > i) {\n            min[i] = 0;\n            extent[i] = p.extent(i);\n        }    \n    }\n    string names[] = {p.name() + \".x$r\", p.name() + \".y$r\", p.name() + \".z$r\", p.name() + \".w$r\"};\n    domain = build_domain(names[0], min[0], extent[0],\n                          names[1], min[1], extent[1],\n                          names[2], min[2], extent[2],\n                          names[3], min[3], extent[3]);    \n    RVar *vars[] = {&x, &y, &z, &w};\n    for (int i = 0; i < 4; i++) {\n        if (p.dimensions() > i) {\n            *(vars[i]) = RVar(names[i], min[i], extent[i], domain);\n        }\n    }\n}\n\n\nint RDom::dimensions() const {\n    return (int)domain.domain().size();\n}\n\nRVar RDom::operator[](int i) {\n    if (i == 0) return x;\n    if (i == 1) return y;\n    if (i == 2) return z;\n    if (i == 3) return w;\n    assert(false && \"Reduction domain index out of bounds\");\n\treturn x; \/\/ Keep the compiler happy\n}\n\nRDom::operator Expr() const {\n    assert(dimensions() == 1 && \"Can only treat single-dimensional RDoms as expressions\");\n    return Expr(x);\n}\n\nRDom::operator RVar() const {\n    assert(dimensions() == 1 && \"Can only treat single-dimensional RDoms as RVars\");\n    return x;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#39468 translated german comments<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"tangram.h\"\n\n#include \"platform.h\"\n#include \"scene\/scene.h\"\n#include \"scene\/sceneLoader.h\"\n#include \"scene\/skybox.h\"\n#include \"style\/material.h\"\n#include \"style\/style.h\"\n#include \"labels\/labels.h\"\n#include \"tile\/tileManager.h\"\n#include \"tile\/tile.h\"\n#include \"gl\/error.h\"\n#include \"gl\/shaderProgram.h\"\n#include \"gl\/renderState.h\"\n#include \"gl\/primitives.h\"\n#include \"util\/inputHandler.h\"\n#include \"view\/view.h\"\n#include \"data\/clientGeoJsonSource.h\"\n#include \"text\/fontContext.h\"\n#include \"gl.h\"\n#include \"gl\/extension.h\"\n#include \"util\/ease.h\"\n#include <memory>\n#include <cmath>\n#include <bitset>\n#include <mutex>\n\nnamespace Tangram {\n\nstd::unique_ptr<TileManager> m_tileManager;\nstd::shared_ptr<Scene> m_scene;\nstd::shared_ptr<View> m_view;\nstd::unique_ptr<Labels> m_labels;\nstd::unique_ptr<Skybox> m_skybox;\nstd::unique_ptr<InputHandler> m_inputHandler;\nstd::mutex m_tilesMutex;\nstd::vector<Ease> m_eases;\n\nstatic float g_time = 0.0;\nstatic std::bitset<8> g_flags = 0;\nint log_level = 2;\n\nvoid initialize(const char* _scenePath) {\n\n    if (m_tileManager) {\n        LOG(\"Notice: Already initialized\");\n        return;\n    }\n\n    LOG(\"initialize\");\n\n    \/\/ Create view\n    m_view = std::make_shared<View>();\n\n    \/\/ Create a scene object\n    m_scene = std::make_shared<Scene>();\n\n    \/\/ Input handler\n    m_inputHandler = std::unique_ptr<InputHandler>(new InputHandler(m_view));\n\n    \/\/ Create a tileManager\n    m_tileManager = TileManager::GetInstance();\n\n    \/\/ Pass references to the view and scene into the tile manager\n    m_tileManager->setView(m_view);\n\n    \/\/ label setup\n    m_labels = std::unique_ptr<Labels>(new Labels());\n\n    loadScene(_scenePath, true);\n\n    glm::dvec2 projPos = m_view->getMapProjection().LonLatToMeters(m_scene->startPosition);\n    m_view->setPosition(projPos.x, projPos.y);\n    m_view->setZoom(m_scene->startZoom);\n\n    LOG(\"finish initialize\");\n\n}\n\nvoid loadScene(const char* _scenePath, bool _setPositionFromScene) {\n    LOG(\"Loading scene file: %s\", _scenePath);\n\n    auto sceneString = stringFromFile(setResourceRoot(_scenePath).c_str(), PathType::resource);\n\n    bool setPositionFromCurrentView = bool(m_scene);\n\n    auto scene = std::make_shared<Scene>();\n    if (SceneLoader::loadScene(sceneString, *scene)) {\n        m_scene = scene;\n        m_scene->fontContext()->addFont(\"FiraSans\", \"Medium\", \"\");\n        if (setPositionFromCurrentView && !_setPositionFromScene) {\n            m_scene->view()->setPosition(m_view->getPosition());\n            m_scene->view()->setZoom(m_view->getZoom());\n        }\n        m_view = m_scene->view();\n        m_inputHandler->setView(m_view);\n        m_tileManager->setView(m_view);\n        m_tileManager->setScene(scene);\n\n    }\n}\n\nvoid resize(int _newWidth, int _newHeight) {\n\n    LOG(\"resize: %d x %d\", _newWidth, _newHeight);\n\n    glViewport(0, 0, _newWidth, _newHeight);\n\n    if (m_view) {\n        m_view->setSize(_newWidth, _newHeight);\n    }\n\n    for (auto& style : m_scene->styles()) {\n        style->viewportHasChanged();\n    }\n\n    Primitives::setResolution(_newWidth, _newHeight);\n\n    while (Error::hadGlError(\"Tangram::resize()\")) {}\n\n}\n\nvoid update(float _dt) {\n\n    g_time += _dt;\n\n    for (auto& ease : m_eases) {\n        ease.update(_dt);\n    }\n    std::remove_if(m_eases.begin(), m_eases.end(), [](Ease& e) { return e.finished(); });\n\n    m_inputHandler->update(_dt);\n\n    m_view->update();\n\n    {\n        std::lock_guard<std::mutex> lock(m_tilesMutex);\n\n        m_tileManager->updateTileSets();\n\n        if (m_view->changedOnLastUpdate() || m_tileManager->hasTileSetChanged() || m_labels->needUpdate()) {\n\n            auto& tiles = m_tileManager->getVisibleTiles();\n\n            for (const auto& tile : tiles) {\n                tile->update(_dt, *m_view);\n            }\n\n            m_labels->update(*m_view, _dt, m_scene->styles(), tiles);\n        }\n\n        bool animated = false;\n        for (const auto& style : m_scene->styles()) {\n            if (style->isAnimated()) {\n                animated = true;\n                break;\n            }\n        }\n        if (animated != isContinuousRendering()) {\n            setContinuousRendering(animated);\n        }\n    }\n}\n\nvoid render() {\n\n    \/\/ Set up openGL for new frame\n    RenderState::depthWrite(GL_TRUE);\n    auto& color = m_scene->background();\n    RenderState::clearColor(color.r \/ 255.f, color.g \/ 255.f, color.b \/ 255.f, color.a \/ 255.f);\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n    {\n        std::lock_guard<std::mutex> lock(m_tilesMutex);\n\n        \/\/ Loop over all styles\n        for (const auto& style : m_scene->styles()) {\n\n            \/\/ Set time uniforms style's shader programs\n            style->getShaderProgram()->setUniformf(\"u_time\", g_time);\n\n            style->onBeginDrawFrame(*m_view, *m_scene);\n\n            \/\/ Loop over all tiles in m_tileSet\n            for (const auto& tile : m_tileManager->getVisibleTiles()) {\n                tile->draw(*style, *m_view);\n            }\n\n            style->onEndDrawFrame();\n        }\n    }\n\n    m_labels->drawDebug(*m_view);\n\n    while (Error::hadGlError(\"Tangram::render()\")) {}\n}\n\nvoid setPosition(double _lon, double _lat) {\n\n    glm::dvec2 meters = m_view->getMapProjection().LonLatToMeters({ _lon, _lat});\n    m_view->setPosition(meters.x, meters.y);\n    requestRender();\n\n}\n\nvoid setPosition(double _lon, double _lat, float _duration) {\n\n    double lon_start, lat_start;\n    getPosition(lon_start, lat_start);\n    auto cb = [=](float t) { setPosition(ease(lon_start, _lon, t), ease(lat_start, _lat, t)); };\n    m_eases.push_back({ _duration, cb });\n\n}\n\nvoid getPosition(double& _lon, double& _lat) {\n\n    glm::dvec2 meters(m_view->getPosition().x, m_view->getPosition().y);\n    glm::dvec2 degrees = m_view->getMapProjection().MetersToLonLat(meters);\n    _lon = degrees.x;\n    _lat = degrees.y;\n\n}\n\nvoid setZoom(float _z) {\n\n    m_view->setZoom(_z);\n    requestRender();\n\n}\n\nvoid setZoom(float _z, float _duration) {\n\n    float z_start = getZoom();\n    auto cb = [=](float t) { setZoom(ease(z_start, _z, t)); };\n    m_eases.push_back({ _duration, cb });\n\n}\n\nfloat getZoom() {\n\n    return m_view->getZoom();\n\n}\n\nvoid setRotation(float _radians) {\n\n    m_view->setRoll(_radians);\n    requestRender();\n\n}\n\nvoid setRotation(float _radians, float _duration) {\n\n    float radians_start = getRotation();\n    auto cb = [=](float t) { setRotation(ease(radians_start, _radians, t)); };\n    m_eases.push_back({ _duration, cb });\n\n}\n\nfloat getRotation() {\n\n    return m_view->getRoll();\n\n}\n\n\nvoid setTilt(float _radians) {\n\n    m_view->setPitch(_radians);\n    requestRender();\n\n}\n\nvoid setTilt(float _radians, float _duration) {\n\n    float tilt_start = getTilt();\n    auto cb = [=](float t) { setTilt(ease(tilt_start, _radians, t)); };\n    m_eases.push_back({ _duration, cb });\n\n}\n\nfloat getTilt() {\n\n    return m_view->getPitch();\n\n}\n\nvoid screenToWorldCoordinates(double& _x, double& _y) {\n\n    m_view->screenToGroundPlane(_x, _y);\n    glm::dvec2 meters(_x + m_view->getPosition().x, _y + m_view->getPosition().y);\n    glm::dvec2 lonLat = m_view->getMapProjection().MetersToLonLat(meters);\n    _x = lonLat.x;\n    _y = lonLat.y;\n\n}\n\nvoid setPixelScale(float _pixelsPerPoint) {\n\n    if (m_view) {\n        m_view->setPixelScale(_pixelsPerPoint);\n    }\n\n    for (auto& style : m_scene->styles()) {\n        style->setPixelScale(_pixelsPerPoint);\n    }\n}\n\nvoid addDataSource(std::shared_ptr<DataSource> _source) {\n    if (!m_tileManager) { return; }\n    std::lock_guard<std::mutex> lock(m_tilesMutex);\n\n    m_tileManager->addDataSource(_source);\n}\n\nvoid clearDataSource(DataSource& _source, bool _data, bool _tiles) {\n    if (!m_tileManager) { return; }\n    std::lock_guard<std::mutex> lock(m_tilesMutex);\n\n    if (_tiles) { m_tileManager->clearTileSet(_source.id()); }\n    if (_data) { _source.clearData(); }\n\n    requestRender();\n}\n\nvoid handleTapGesture(float _posX, float _posY) {\n\n    m_inputHandler->handleTapGesture(_posX, _posY);\n\n}\n\nvoid handleDoubleTapGesture(float _posX, float _posY) {\n\n    m_inputHandler->handleDoubleTapGesture(_posX, _posY);\n\n}\n\nvoid handlePanGesture(float _startX, float _startY, float _endX, float _endY) {\n\n    m_inputHandler->handlePanGesture(_startX, _startY, _endX, _endY);\n\n}\n\nvoid handlePinchGesture(float _posX, float _posY, float _scale, float _velocity) {\n\n    m_inputHandler->handlePinchGesture(_posX, _posY, _scale, _velocity);\n\n}\n\nvoid handleRotateGesture(float _posX, float _posY, float _radians) {\n\n    m_inputHandler->handleRotateGesture(_posX, _posY, _radians);\n\n}\n\nvoid handleShoveGesture(float _distance) {\n\n    m_inputHandler->handleShoveGesture(_distance);\n\n}\n\nvoid setDebugFlag(DebugFlags _flag, bool _on) {\n\n    g_flags.set(_flag, _on);\n    m_view->setZoom(m_view->getZoom()); \/\/ Force the view to refresh\n\n}\n\nbool getDebugFlag(DebugFlags _flag) {\n\n    return g_flags.test(_flag);\n\n}\n\nvoid toggleDebugFlag(DebugFlags _flag) {\n\n    g_flags.flip(_flag);\n    m_view->setZoom(m_view->getZoom()); \/\/ Force the view to refresh\n\n}\n\nconst std::vector<TouchItem>& pickFeaturesAt(float _x, float _y) {\n    return m_labels->getFeaturesAtPoint(*m_view, 0, m_scene->styles(),\n                                        m_tileManager->getVisibleTiles(),\n                                        _x, _y);\n}\n\n\n\nvoid setupGL() {\n\n    LOG(\"setup GL\");\n\n    if (m_tileManager) {\n        m_tileManager->clearTileSets();\n\n        for (auto& style : m_scene->styles()) {\n           style->notifyGLContextLost();\n        }\n    }\n\n    \/\/ The OpenGL context has been destroyed since the last time resources were created,\n    \/\/ so we invalidate all data that depends on OpenGL object handles.\n\n    \/\/ ShaderPrograms are invalidated and immediately rebuilt\n    ShaderProgram::invalidateAllPrograms();\n\n    \/\/ Buffer objects are invalidated and re-uploaded the next time they are used\n    VboMesh::invalidateAllVBOs();\n\n    \/\/ Texture objects are invalidated and re-uploaded the next time they are updated\n    Texture::invalidateAllTextures();\n\n    \/\/ Reconfigure the render states\n    RenderState::configure();\n\n    \/\/ Set default primitive render color\n    Primitives::setColor(0xffffff);\n\n    \/\/ Load GL extensions\n    GLExtensions::load();\n\n    GLExtensions::printAvailableExtensions();\n\n    while (Error::hadGlError(\"Tangram::setupGL()\")) {}\n}\n\n}\n<commit_msg>Fix removal of completed eases<commit_after>#include \"tangram.h\"\n\n#include \"platform.h\"\n#include \"scene\/scene.h\"\n#include \"scene\/sceneLoader.h\"\n#include \"scene\/skybox.h\"\n#include \"style\/material.h\"\n#include \"style\/style.h\"\n#include \"labels\/labels.h\"\n#include \"tile\/tileManager.h\"\n#include \"tile\/tile.h\"\n#include \"gl\/error.h\"\n#include \"gl\/shaderProgram.h\"\n#include \"gl\/renderState.h\"\n#include \"gl\/primitives.h\"\n#include \"util\/inputHandler.h\"\n#include \"view\/view.h\"\n#include \"data\/clientGeoJsonSource.h\"\n#include \"text\/fontContext.h\"\n#include \"gl.h\"\n#include \"gl\/extension.h\"\n#include \"util\/ease.h\"\n#include <memory>\n#include <cmath>\n#include <bitset>\n#include <mutex>\n\nnamespace Tangram {\n\nstd::unique_ptr<TileManager> m_tileManager;\nstd::shared_ptr<Scene> m_scene;\nstd::shared_ptr<View> m_view;\nstd::unique_ptr<Labels> m_labels;\nstd::unique_ptr<Skybox> m_skybox;\nstd::unique_ptr<InputHandler> m_inputHandler;\nstd::mutex m_tilesMutex;\nstd::vector<Ease> m_eases;\n\nstatic float g_time = 0.0;\nstatic std::bitset<8> g_flags = 0;\nint log_level = 2;\n\nvoid initialize(const char* _scenePath) {\n\n    if (m_tileManager) {\n        LOG(\"Notice: Already initialized\");\n        return;\n    }\n\n    LOG(\"initialize\");\n\n    \/\/ Create view\n    m_view = std::make_shared<View>();\n\n    \/\/ Create a scene object\n    m_scene = std::make_shared<Scene>();\n\n    \/\/ Input handler\n    m_inputHandler = std::unique_ptr<InputHandler>(new InputHandler(m_view));\n\n    \/\/ Create a tileManager\n    m_tileManager = TileManager::GetInstance();\n\n    \/\/ Pass references to the view and scene into the tile manager\n    m_tileManager->setView(m_view);\n\n    \/\/ label setup\n    m_labels = std::unique_ptr<Labels>(new Labels());\n\n    loadScene(_scenePath, true);\n\n    glm::dvec2 projPos = m_view->getMapProjection().LonLatToMeters(m_scene->startPosition);\n    m_view->setPosition(projPos.x, projPos.y);\n    m_view->setZoom(m_scene->startZoom);\n\n    LOG(\"finish initialize\");\n\n}\n\nvoid loadScene(const char* _scenePath, bool _setPositionFromScene) {\n    LOG(\"Loading scene file: %s\", _scenePath);\n\n    auto sceneString = stringFromFile(setResourceRoot(_scenePath).c_str(), PathType::resource);\n\n    bool setPositionFromCurrentView = bool(m_scene);\n\n    auto scene = std::make_shared<Scene>();\n    if (SceneLoader::loadScene(sceneString, *scene)) {\n        m_scene = scene;\n        m_scene->fontContext()->addFont(\"FiraSans\", \"Medium\", \"\");\n        if (setPositionFromCurrentView && !_setPositionFromScene) {\n            m_scene->view()->setPosition(m_view->getPosition());\n            m_scene->view()->setZoom(m_view->getZoom());\n        }\n        m_view = m_scene->view();\n        m_inputHandler->setView(m_view);\n        m_tileManager->setView(m_view);\n        m_tileManager->setScene(scene);\n\n    }\n}\n\nvoid resize(int _newWidth, int _newHeight) {\n\n    LOG(\"resize: %d x %d\", _newWidth, _newHeight);\n\n    glViewport(0, 0, _newWidth, _newHeight);\n\n    if (m_view) {\n        m_view->setSize(_newWidth, _newHeight);\n    }\n\n    for (auto& style : m_scene->styles()) {\n        style->viewportHasChanged();\n    }\n\n    Primitives::setResolution(_newWidth, _newHeight);\n\n    while (Error::hadGlError(\"Tangram::resize()\")) {}\n\n}\n\nvoid update(float _dt) {\n\n    g_time += _dt;\n\n    for (auto it = m_eases.begin(); it < m_eases.end(); it++) {\n        it->update(_dt);\n        if (it->finished()) { m_eases.erase(it); }\n    }\n\n    m_inputHandler->update(_dt);\n\n    m_view->update();\n\n    {\n        std::lock_guard<std::mutex> lock(m_tilesMutex);\n\n        m_tileManager->updateTileSets();\n\n        if (m_view->changedOnLastUpdate() || m_tileManager->hasTileSetChanged() || m_labels->needUpdate()) {\n\n            auto& tiles = m_tileManager->getVisibleTiles();\n\n            for (const auto& tile : tiles) {\n                tile->update(_dt, *m_view);\n            }\n\n            m_labels->update(*m_view, _dt, m_scene->styles(), tiles);\n        }\n\n        bool animated = false;\n        for (const auto& style : m_scene->styles()) {\n            if (style->isAnimated()) {\n                animated = true;\n                break;\n            }\n        }\n        if (animated != isContinuousRendering()) {\n            setContinuousRendering(animated);\n        }\n    }\n}\n\nvoid render() {\n\n    \/\/ Set up openGL for new frame\n    RenderState::depthWrite(GL_TRUE);\n    auto& color = m_scene->background();\n    RenderState::clearColor(color.r \/ 255.f, color.g \/ 255.f, color.b \/ 255.f, color.a \/ 255.f);\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n    {\n        std::lock_guard<std::mutex> lock(m_tilesMutex);\n\n        \/\/ Loop over all styles\n        for (const auto& style : m_scene->styles()) {\n\n            \/\/ Set time uniforms style's shader programs\n            style->getShaderProgram()->setUniformf(\"u_time\", g_time);\n\n            style->onBeginDrawFrame(*m_view, *m_scene);\n\n            \/\/ Loop over all tiles in m_tileSet\n            for (const auto& tile : m_tileManager->getVisibleTiles()) {\n                tile->draw(*style, *m_view);\n            }\n\n            style->onEndDrawFrame();\n        }\n    }\n\n    m_labels->drawDebug(*m_view);\n\n    while (Error::hadGlError(\"Tangram::render()\")) {}\n}\n\nvoid setPosition(double _lon, double _lat) {\n\n    glm::dvec2 meters = m_view->getMapProjection().LonLatToMeters({ _lon, _lat});\n    m_view->setPosition(meters.x, meters.y);\n    requestRender();\n\n}\n\nvoid setPosition(double _lon, double _lat, float _duration) {\n\n    double lon_start, lat_start;\n    getPosition(lon_start, lat_start);\n    auto cb = [=](float t) { setPosition(ease(lon_start, _lon, t), ease(lat_start, _lat, t)); };\n    m_eases.push_back({ _duration, cb });\n\n}\n\nvoid getPosition(double& _lon, double& _lat) {\n\n    glm::dvec2 meters(m_view->getPosition().x, m_view->getPosition().y);\n    glm::dvec2 degrees = m_view->getMapProjection().MetersToLonLat(meters);\n    _lon = degrees.x;\n    _lat = degrees.y;\n\n}\n\nvoid setZoom(float _z) {\n\n    m_view->setZoom(_z);\n    requestRender();\n\n}\n\nvoid setZoom(float _z, float _duration) {\n\n    float z_start = getZoom();\n    auto cb = [=](float t) { setZoom(ease(z_start, _z, t)); };\n    m_eases.push_back({ _duration, cb });\n\n}\n\nfloat getZoom() {\n\n    return m_view->getZoom();\n\n}\n\nvoid setRotation(float _radians) {\n\n    m_view->setRoll(_radians);\n    requestRender();\n\n}\n\nvoid setRotation(float _radians, float _duration) {\n\n    float radians_start = getRotation();\n    auto cb = [=](float t) { setRotation(ease(radians_start, _radians, t)); };\n    m_eases.push_back({ _duration, cb });\n\n}\n\nfloat getRotation() {\n\n    return m_view->getRoll();\n\n}\n\n\nvoid setTilt(float _radians) {\n\n    m_view->setPitch(_radians);\n    requestRender();\n\n}\n\nvoid setTilt(float _radians, float _duration) {\n\n    float tilt_start = getTilt();\n    auto cb = [=](float t) { setTilt(ease(tilt_start, _radians, t)); };\n    m_eases.push_back({ _duration, cb });\n\n}\n\nfloat getTilt() {\n\n    return m_view->getPitch();\n\n}\n\nvoid screenToWorldCoordinates(double& _x, double& _y) {\n\n    m_view->screenToGroundPlane(_x, _y);\n    glm::dvec2 meters(_x + m_view->getPosition().x, _y + m_view->getPosition().y);\n    glm::dvec2 lonLat = m_view->getMapProjection().MetersToLonLat(meters);\n    _x = lonLat.x;\n    _y = lonLat.y;\n\n}\n\nvoid setPixelScale(float _pixelsPerPoint) {\n\n    if (m_view) {\n        m_view->setPixelScale(_pixelsPerPoint);\n    }\n\n    for (auto& style : m_scene->styles()) {\n        style->setPixelScale(_pixelsPerPoint);\n    }\n}\n\nvoid addDataSource(std::shared_ptr<DataSource> _source) {\n    if (!m_tileManager) { return; }\n    std::lock_guard<std::mutex> lock(m_tilesMutex);\n\n    m_tileManager->addDataSource(_source);\n}\n\nvoid clearDataSource(DataSource& _source, bool _data, bool _tiles) {\n    if (!m_tileManager) { return; }\n    std::lock_guard<std::mutex> lock(m_tilesMutex);\n\n    if (_tiles) { m_tileManager->clearTileSet(_source.id()); }\n    if (_data) { _source.clearData(); }\n\n    requestRender();\n}\n\nvoid handleTapGesture(float _posX, float _posY) {\n\n    m_inputHandler->handleTapGesture(_posX, _posY);\n\n}\n\nvoid handleDoubleTapGesture(float _posX, float _posY) {\n\n    m_inputHandler->handleDoubleTapGesture(_posX, _posY);\n\n}\n\nvoid handlePanGesture(float _startX, float _startY, float _endX, float _endY) {\n\n    m_inputHandler->handlePanGesture(_startX, _startY, _endX, _endY);\n\n}\n\nvoid handlePinchGesture(float _posX, float _posY, float _scale, float _velocity) {\n\n    m_inputHandler->handlePinchGesture(_posX, _posY, _scale, _velocity);\n\n}\n\nvoid handleRotateGesture(float _posX, float _posY, float _radians) {\n\n    m_inputHandler->handleRotateGesture(_posX, _posY, _radians);\n\n}\n\nvoid handleShoveGesture(float _distance) {\n\n    m_inputHandler->handleShoveGesture(_distance);\n\n}\n\nvoid setDebugFlag(DebugFlags _flag, bool _on) {\n\n    g_flags.set(_flag, _on);\n    m_view->setZoom(m_view->getZoom()); \/\/ Force the view to refresh\n\n}\n\nbool getDebugFlag(DebugFlags _flag) {\n\n    return g_flags.test(_flag);\n\n}\n\nvoid toggleDebugFlag(DebugFlags _flag) {\n\n    g_flags.flip(_flag);\n    m_view->setZoom(m_view->getZoom()); \/\/ Force the view to refresh\n\n}\n\nconst std::vector<TouchItem>& pickFeaturesAt(float _x, float _y) {\n    return m_labels->getFeaturesAtPoint(*m_view, 0, m_scene->styles(),\n                                        m_tileManager->getVisibleTiles(),\n                                        _x, _y);\n}\n\n\n\nvoid setupGL() {\n\n    LOG(\"setup GL\");\n\n    if (m_tileManager) {\n        m_tileManager->clearTileSets();\n\n        for (auto& style : m_scene->styles()) {\n           style->notifyGLContextLost();\n        }\n    }\n\n    \/\/ The OpenGL context has been destroyed since the last time resources were created,\n    \/\/ so we invalidate all data that depends on OpenGL object handles.\n\n    \/\/ ShaderPrograms are invalidated and immediately rebuilt\n    ShaderProgram::invalidateAllPrograms();\n\n    \/\/ Buffer objects are invalidated and re-uploaded the next time they are used\n    VboMesh::invalidateAllVBOs();\n\n    \/\/ Texture objects are invalidated and re-uploaded the next time they are updated\n    Texture::invalidateAllTextures();\n\n    \/\/ Reconfigure the render states\n    RenderState::configure();\n\n    \/\/ Set default primitive render color\n    Primitives::setColor(0xffffff);\n\n    \/\/ Load GL extensions\n    GLExtensions::load();\n\n    GLExtensions::printAvailableExtensions();\n\n    while (Error::hadGlError(\"Tangram::setupGL()\")) {}\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2014 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 \"kernel\/expr_eq_fn.h\"\n\n#ifndef LEAN_EQ_CACHE_THRESHOLD\n#define LEAN_EQ_CACHE_THRESHOLD 4\n#endif\n\nnamespace lean {\nbool expr_eq_fn::apply(expr const & a, expr const & b) {\n    if (is_eqp(a, b))          return true;\n    if (a.hash() != b.hash())  return false;\n    if (a.kind() != b.kind())  return false;\n    if (is_var(a))             return var_idx(a) == var_idx(b);\n    if (m_counter >= LEAN_EQ_CACHE_THRESHOLD && is_shared(a) && is_shared(b)) {\n        auto p = std::make_pair(a.raw(), b.raw());\n        if (!m_eq_visited)\n            m_eq_visited.reset(new expr_cell_pair_set);\n        if (m_eq_visited->find(p) != m_eq_visited->end())\n            return true;\n        m_eq_visited->insert(p);\n    }\n    check_system(\"expression equality test\");\n    switch (a.kind()) {\n    case expr_kind::Var:\n        lean_unreachable(); \/\/ LCOV_EXCL_LINE\n    case expr_kind::Constant:\n        return\n            const_name(a) == const_name(b) &&\n            compare(const_levels(a), const_levels(b), [](level const & l1, level const & l2) { return l1 == l2; });\n    case expr_kind::Meta:\n        return\n            mlocal_name(a) == mlocal_name(b) &&\n            apply(mlocal_type(a), mlocal_type(b));\n    case expr_kind::Local:\n        return\n            mlocal_name(a) == mlocal_name(b) &&\n            apply(mlocal_type(a), mlocal_type(b)) &&\n            (!m_compare_binder_info || local_info(a) == local_info(b));\n    case expr_kind::App:\n        m_counter++;\n        return\n            apply(app_fn(a), app_fn(b)) &&\n            apply(app_arg(a), app_arg(b));\n    case expr_kind::Lambda: case expr_kind::Pi:\n        m_counter++;\n        return\n            apply(binding_domain(a), binding_domain(b)) &&\n            apply(binding_body(a), binding_body(b)) &&\n            (!m_compare_binder_info || binding_info(a) == binding_info(b));\n    case expr_kind::Sort:\n        return sort_level(a) == sort_level(b);\n    case expr_kind::Macro:\n        m_counter++;\n        if (macro_def(a) != macro_def(b) || macro_num_args(a) != macro_num_args(b))\n            return false;\n        for (unsigned i = 0; i < macro_num_args(a); i++) {\n            if (!apply(macro_arg(a, i), macro_arg(b, i)))\n                return false;\n        }\n        return true;\n    }\n    lean_unreachable(); \/\/ LCOV_EXCL_LINE\n}\n}\n<commit_msg>fix(kernel\/expr_eq_fn): take local pp name into account when annotations are considered in the equality test<commit_after>\/*\nCopyright (c) 2014 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 \"kernel\/expr_eq_fn.h\"\n\n#ifndef LEAN_EQ_CACHE_THRESHOLD\n#define LEAN_EQ_CACHE_THRESHOLD 4\n#endif\n\nnamespace lean {\nbool expr_eq_fn::apply(expr const & a, expr const & b) {\n    if (is_eqp(a, b))          return true;\n    if (a.hash() != b.hash())  return false;\n    if (a.kind() != b.kind())  return false;\n    if (is_var(a))             return var_idx(a) == var_idx(b);\n    if (m_counter >= LEAN_EQ_CACHE_THRESHOLD && is_shared(a) && is_shared(b)) {\n        auto p = std::make_pair(a.raw(), b.raw());\n        if (!m_eq_visited)\n            m_eq_visited.reset(new expr_cell_pair_set);\n        if (m_eq_visited->find(p) != m_eq_visited->end())\n            return true;\n        m_eq_visited->insert(p);\n    }\n    check_system(\"expression equality test\");\n    switch (a.kind()) {\n    case expr_kind::Var:\n        lean_unreachable(); \/\/ LCOV_EXCL_LINE\n    case expr_kind::Constant:\n        return\n            const_name(a) == const_name(b) &&\n            compare(const_levels(a), const_levels(b), [](level const & l1, level const & l2) { return l1 == l2; });\n    case expr_kind::Meta:\n        return\n            mlocal_name(a) == mlocal_name(b) &&\n            apply(mlocal_type(a), mlocal_type(b));\n    case expr_kind::Local:\n        return\n            mlocal_name(a) == mlocal_name(b) &&\n            apply(mlocal_type(a), mlocal_type(b)) &&\n            (!m_compare_binder_info || local_pp_name(a) == local_pp_name(b));\n            (!m_compare_binder_info || local_info(a) == local_info(b));\n    case expr_kind::App:\n        m_counter++;\n        return\n            apply(app_fn(a), app_fn(b)) &&\n            apply(app_arg(a), app_arg(b));\n    case expr_kind::Lambda: case expr_kind::Pi:\n        m_counter++;\n        return\n            apply(binding_domain(a), binding_domain(b)) &&\n            apply(binding_body(a), binding_body(b)) &&\n            (!m_compare_binder_info || binding_info(a) == binding_info(b));\n    case expr_kind::Sort:\n        return sort_level(a) == sort_level(b);\n    case expr_kind::Macro:\n        m_counter++;\n        if (macro_def(a) != macro_def(b) || macro_num_args(a) != macro_num_args(b))\n            return false;\n        for (unsigned i = 0; i < macro_num_args(a); i++) {\n            if (!apply(macro_arg(a, i), macro_arg(b, i)))\n                return false;\n        }\n        return true;\n    }\n    lean_unreachable(); \/\/ LCOV_EXCL_LINE\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#\/** \\ingroup kernel\n* \\{\n*\n* \\file kernel\/memory_map.hpp\n* \\brief This file defines the memory map used by the\n*        kernel as well as some auxilliary types.\n*\/\n\n#ifndef H_kernel_memory\n#define H_kernel_memory\n\n#include <common\/types.hpp>\n\n#include \"dynarray.hpp\"\n#include \"debug.hpp\"\n#include \"constants.hpp\"\n\n#include <memory_resource>\n#include <algorithm>\n#include <limits>\n\nnamespace UtopiaOS\n{\n    namespace kernel\n    {\n        \/** \\enum memory_type\n         * \\brief Analogous to the UEFI memory type\n         *        but contains only types the kernel\n         *        actually knows about.\n         *\/\n        enum class memory_type : common::uint32\n        {\n            general_purpose,\n            unusable,\n            invalid\n        };\n        \n        \/** \\struct memory_request\n         * \\brief Encapsulates a memory requirement\n         * \\tparam ALIGN Specifies the alignment\n         *\/\n        template<std::size_t ALIGN>\n        struct memory_request\n        {\n            std::size_t size;\n            static constexpr std::size_t alignment = ALIGN;\n        };\n        \n        \/** \\brief Aligns a pointer to a given alignment.\n         * \\param[in] ptr The pointer to align\n         * \\param[in] alignment The alignment to meet\n         * \\returns An aligned pointer or 0 if the pointer\n         *          could not be aligned.\n         *\n         * The aligned pointer is guaranteed to point to\n         * an address not smaller than the original pointer.\n         * It is guaranteed that there is no other aligned\n         * address in the range [\\a ptr, \\a return-value].\n         * If the pointer cannot be aligned, i.e it points\n         * to an address so large that the next aligned\n         * address would not fit into the data type,\n         * 0 is returned.\n         *\n         * \\warning If \\a alignment is not a power of two,\n         *          the behaviour is undefined!\n         *\/\n        static inline common::uintptr align( common::uintptr ptr, std::size_t alignment )\n        {\n            static_assert( std::numeric_limits<common::uintptr>::max() >=\n                          std::numeric_limits<std::size_t>::max(),\n                          \"This implementation cannot guarantee to work.\" );\n            debug_assert( (alignment % 2) == 0, \"alignment has to be a power of two\" );\n            \n            common::un mask = alignment - 1; \/\/ ...0000011111...\n            common::un diff = (ptr & mask);\n            \n            if( diff == 0 )\n                return ptr;\n            \n            return (ptr + alignment - diff);\n        }\n        \n        \/** \\struct memory_descriptor\n         * \\brief Analogous to a UEFI memory descriptor,\n         *        but usable by the kernel. It also has\n         *        a well-defined size.\n         *\n         * It is guaranteed that\n         * (\\a start + \\a number_of_pages * \\a pagesize)\n         * does not overflow, where \\a start is either\n         * \\a physical_start or \\a virtual_start.\n         * For memory_descriptor with its type set to\n         * \\a memory_type::invalid the contents of the\n         * other fields are undefined.\n         *\/\n        struct memory_descriptor\n        {\n            memory_type type;\n            common::uint64 physical_start;\n            common::uint64 virtual_start;\n            common::uint64 number_of_pages;\n            \n            \/** \\brief Construct a kernel-usable memory\n             *         descriptor from a UEFI one.\n             *\n             * \\warning If there is an overflow in\n             *          (\\a start + \\a number_of_pages * \\a UEFI::pagesize)\n             *          where \\a start is either\n             *          \\a physical_start or \\a virtual_start\n             *          the memory_type will be set to unusable.\n             * \\warning If the total memory block is smaller than\n             *          the kernel pagesize the type will be set\n             *          to invalid and the other fields are undefined.\n             * \\warning If the kernel pagesize cannot be used to fully\n             *          cover the memory region, the memory region\n             *          will be truncated accordingly.\n             *\/\n            memory_descriptor( const UEFI::memory_descriptor_v1 &uefi_desc )\n            : type( uefi_desc.type == UEFI::memory_type::EfiConventionalMemory ?\n                   memory_type::general_purpose : memory_type::unusable ),\n            physical_start( uefi_desc.physical_start ),\n            virtual_start( uefi_desc.virtual_start ),\n            number_of_pages( (uefi_desc.number_of_pages * UEFI::pagesize) \/ pagesize )\n            {\n                if( number_of_pages == 0 )\n                    type = memory_type::invalid;\n            }\n            \n            \/** \\brief Checks whether the memory described by\n             *         the memory descriptor can be used to\n             *         fulfil a memory request.\n             * \\tparam ALIGN Specifies the alignment\n             * \\returns \\a true if the request can be fulfilled\n             *          and \\a false otherwise.\n             *\/\n            template<std::size_t ALIGN>\n            bool can_meet_request( const memory_request<ALIGN> &request ) const\n            {\n                static_assert( std::numeric_limits<common::uintptr>::max() >=\n                              std::numeric_limits<std::size_t>::max(),\n                              \"This implementation cannot guarantee to work.\" );\n                if( type != memory_type::general_purpose )\n                    return false;\n                \n                auto aligned_address = align( virtual_start, request.alignment );\n                common::uintptr request_end = aligned_address + request.size;\n                \n                if( (request_end - virtual_start) \/ pagesize <= number_of_pages )\n                    return true;\n                \n                return false;\n            }\n        };\n        \n        \/** \\class memory_map\n         * \\brief The memory map used by the kernel\n         * \\tparam Allocator The type of allocator to use\n         *\n         * It has some sanity guarantees that UEFI lacks, like:\n         * - fixed size of descriptors that is known compile-time\n         * - no overlaps\n         * - The memory descriptors always describe regions that\n         *   are as large as possible, with lower ones always being\n         *   full in a case of ambiguity.\n         *\/\n        template<class Allocator>\n        class memory_map\n        {\n        public:\n            using allocator_type = Allocator;\n        private:\n            using desc_array = dynarray<memory_descriptor, allocator_type>;\n            desc_array descriptors;\n            \n            \/** \\brief Convert a uefi memory map to a\n             *         kernel-usable one.\n             * \\param[in] uefi_map The UEFI memory map\n             * \\param[in] The allocator to use\n             * \\returns An array of descriptors with the guarantee\n             *          that they do not overlap.\n             *\/\n            static desc_array\n            convert_from_uefi( const UEFI::memory_map &uefi_map, allocator_type &&alloc )\n            {\n                desc_array stage1_descriptors( uefi_map.cbegin_v1(),\n                                              uefi_map.cend_v1(),\n                                              std::forward<allocator_type>( alloc ) );\n                \n                \/** \\todo Now remedy all possible overlaps and\n                 *        any unnecessary fragmentation\n                 *\/\n            }\n        public:\n            \/** \\brief Returns a memory_request that when fulfilled\n             *         will suffice to convert a UEFI memory map\n             *         to a kernel-usable one.\n             * \\param[in] uefi_map The UEFI memory map\n             * \\returns The memory_request\n             *\/\n            static memory_request<alignof(memory_descriptor)>\n            maximum_conversion_requirement( const UEFI::memory_map &uefi_map )\n            {\n                return { uefi_map.number_of_descriptors * sizeof(memory_descriptor) };\n            }\n            \n            \/** \\brief Returns a memory_request that when fulfilled\n             *         will suffice to copy the memory map.\n             * \\returns The memory_request\n             *\/\n            memory_request<alignof(memory_descriptor)> copy_requirement( void ) const\n            {\n                return { descriptors.size() * sizeof(memory_descriptor) };\n            }\n            \n            \/** \\brief Constructs a kernel-usable memory map\n             *         from a UEFI memory map.\n             * \\param[in] uefi_map The UEFI memory map\n             * \\param[in] alloc The allocator used to copy the\n             *                  memory map. It has to be able to\n             *                  allocate at least what is returned\n             *                  by \\a maximum_conversion_requirement.\n             *\/\n            memory_map( const UEFI::memory_map &uefi_map, allocator_type &&alloc )\n            : descriptors( convert_from_uefi( uefi_map,\n                                             std::forward<allocator_type>( alloc ) ) )\n            {}\n            \n            \/** \\brief Returns a const iterator to the begin of\n             *         the memory descriptor range.\n             * \\returns A const iterator to the begin of\n             *          the memory descriptor range\n             *\/\n            typename desc_array::const_iterator cbegin( void ) const\n            { return descriptors.cbegin(); }\n            \n            \/** \\brief Returns a const iterator to the end of\n             *         the memory descriptor range.\n             * \\returns A const iterator to the end of\n             *          the memory descriptor range\n             *\/\n            typename desc_array::const_iterator cend( void ) const\n            { return descriptors.cend(); }\n        };\n    }\n}\n\n#endif\n\n\/** \\} *\/\n<commit_msg>Implemented UEFI memory map to kernel memory map conversion.<commit_after>#\/** \\ingroup kernel\n* \\{\n*\n* \\file kernel\/memory_map.hpp\n* \\brief This file defines the memory map used by the\n*        kernel as well as some auxilliary types.\n*\/\n\n#ifndef H_kernel_memory\n#define H_kernel_memory\n\n#include <common\/types.hpp>\n\n#include \"dynarray.hpp\"\n#include \"debug.hpp\"\n#include \"constants.hpp\"\n\n#include <memory_resource>\n#include <algorithm>\n#include <limits>\n#include <functional>\n\nnamespace UtopiaOS\n{\n    namespace kernel\n    {\n        \/** \\enum memory_type\n         * \\brief Analogous to the UEFI memory type\n         *        but contains only types the kernel\n         *        actually knows about.\n         *\/\n        enum class memory_type : common::uint32\n        {\n            general_purpose,\n            unusable,\n            invalid\n        };\n        \n        \/** \\struct memory_request\n         * \\brief Encapsulates a memory requirement\n         * \\tparam ALIGN Specifies the alignment\n         *\/\n        template<std::size_t ALIGN>\n        struct memory_request\n        {\n            std::size_t size;\n            static constexpr std::size_t alignment = ALIGN;\n        };\n        \n        \/** \\brief Aligns a pointer to a given alignment.\n         * \\param[in] ptr The pointer to align\n         * \\param[in] alignment The alignment to meet\n         * \\returns An aligned pointer or 0 if the pointer\n         *          could not be aligned.\n         *\n         * The aligned pointer is guaranteed to point to\n         * an address not smaller than the original pointer.\n         * It is guaranteed that there is no other aligned\n         * address in the range [\\a ptr, \\a return-value].\n         * If the pointer cannot be aligned, i.e it points\n         * to an address so large that the next aligned\n         * address would not fit into the data type,\n         * 0 is returned.\n         *\n         * \\warning If \\a alignment is not a power of two,\n         *          the behaviour is undefined!\n         *\/\n        static inline common::uintptr align( common::uintptr ptr, std::size_t alignment )\n        {\n            static_assert( std::numeric_limits<common::uintptr>::max() >=\n                          std::numeric_limits<std::size_t>::max(),\n                          \"This implementation cannot guarantee to work.\" );\n            debug_assert( (alignment % 2) == 0, \"alignment has to be a power of two\" );\n            \n            common::un mask = alignment - 1; \/\/ ...0000011111...\n            common::un diff = (ptr & mask);\n            \n            if( diff == 0 )\n                return ptr;\n            \n            return (ptr + alignment - diff);\n        }\n        \n        \/** \\struct memory_descriptor\n         * \\brief Analogous to a UEFI memory descriptor,\n         *        but usable by the kernel. It also has\n         *        a well-defined size.\n         *\n         * It is guaranteed that for a valid memory descriptor:\n         * - (\\a start + \\a number_of_pages * \\a pagesize)\n         *   does not overflow, where \\a start is either\n         *   \\a physical_start or \\a virtual_start.\n         * - \\a number_of_pages is non-zero\n         * For a memory_descriptor with its type set to\n         * \\a memory_type::invalid the contents of the\n         * other fields are undefined.\n         *\/\n        struct memory_descriptor\n        {\n            memory_type type;\n            common::uint64 physical_start;\n            common::uint64 virtual_start;\n            common::uint64 number_of_pages;\n            \n            \/** \\brief Returns an invalid memory descriptor.\n             * \\returns An invalid memory descriptor\n             *\/\n            static memory_descriptor invalid_memory_descriptor( void )\n            {\n                return memory_descriptor{ memory_type::invalid,\n                    0, 0, 0 };\n            }\n            \n            \/** \\brief Constructs a memory descriptor from\n             *         properties describing a memory region.\n             * \\param[in] t The type of the memory region\n             * \\param[in] ps The physical start of the memory region\n             * \\param[in] vs The virtual start of the memory region\n             * \\param[in] np The number of pages of the memory region\n             *\n             * If the parameters do not fulfil the guarantees\n             * required of a memory_descriptor object, a\n             * std::invalid_argument exception is thrown.\n             *\/\n            memory_descriptor( memory_type t, common::uint64 ps,\n                              common::uint64 vs, common::uint64 np )\n            : type( t ), physical_start( ps ), virtual_start( vs ),\n            number_of_pages( np )\n            {\n                if( validate( *this ) == false )\n                {\n                    type = memory_type::invalid;\n                    throw std::invalid_argument( \"Cannot construct a \\\nvalid memory descriptor with the specified arguments\" );\n                }\n            }\n            \n            \/** \\brief Construct a kernel-usable memory\n             *         descriptor from a UEFI one.\n             *\n             * \\warning If there is an overflow in\n             *          (\\a start + \\a number_of_pages * \\a UEFI::pagesize)\n             *          where \\a start is either\n             *          \\a physical_start or \\a virtual_start\n             *          the memory_type will be set to unusable.\n             * \\warning If the total memory block is smaller than\n             *          the kernel pagesize the type will be set\n             *          to invalid and the other fields are undefined.\n             * \\warning If the kernel pagesize cannot be used to fully\n             *          cover the memory region, the memory region\n             *          will be truncated accordingly.\n             *\/\n            memory_descriptor( const UEFI::memory_descriptor_v1 &uefi_desc )\n            : type( uefi_desc.type == UEFI::memory_type::EfiConventionalMemory ?\n                   memory_type::general_purpose : memory_type::unusable ),\n            physical_start( uefi_desc.physical_start ),\n            virtual_start( uefi_desc.virtual_start )\n            {\n                \/\/ Check if memory block size already overflows\n                if( (std::numeric_limits<common::uint64>::max() \/\n                     UEFI::pagesize ) > uefi_desc.number_of_pages )\n                    type = memory_type::invalid;\n                \/\/ Check if the block starting at physical_address\n                \/\/ overflows\n                else if( (std::numeric_limits<common::uint64>::max() -\n                          UEFI::pagesize * uefi_desc.number_of_pages) <\n                        physical_start )\n                    type = memory_type::invalid;\n                \/\/ Check if the block starting at virtual_address\n                \/\/ overflows\n                else if( (std::numeric_limits<common::uint64>::max() -\n                          UEFI::pagesize * uefi_desc.number_of_pages) <\n                        virtual_start )\n                    type = memory_type::invalid;\n                else\n                {\n                    \/\/ Truncate the memory block as needed by pagesize\n                    \/\/ limitations.\n                    number_of_pages = ((uefi_desc.number_of_pages * UEFI::pagesize) \/\n                                       pagesize );\n                    \n                    \/\/ Don't retain zero-sized memory blocks\n                    if( number_of_pages == 0 )\n                        type = memory_type::invalid;\n                }\n            }\n            \n            \/** \\brief Checks whether the memory described by\n             *         the memory descriptor can be used to\n             *         fulfil a memory request.\n             * \\tparam ALIGN Specifies the alignment\n             * \\returns \\a true if the request can be fulfilled\n             *          and \\a false otherwise.\n             *\/\n            template<std::size_t ALIGN>\n            bool can_meet_request( const memory_request<ALIGN> &request ) const\n            {\n                static_assert( std::numeric_limits<common::uintptr>::max() >=\n                              std::numeric_limits<std::size_t>::max(),\n                              \"This implementation cannot guarantee to work.\" );\n                if( type != memory_type::general_purpose )\n                    return false;\n                \n                auto aligned_address = align( virtual_start, request.alignment );\n                common::uintptr request_end = aligned_address + request.size;\n                \n                if( (request_end - virtual_start) \/ pagesize <= number_of_pages )\n                    return true;\n                \n                return false;\n            }\n            \n            \/** \\brief Checks whether the memory descriptor\n             *         is valid.\n             * \\returns \\a false if type is memory_type::invalid,\n             *          true otherwise.\n             *\/\n            bool is_valid( void ) const { return (type != memory_type::invalid); }\n        private:\n            \/** \\brief Checks whether a memory descriptor does\n             *         not fulfil the required guarantees.\n             * \\param[in] md The memory descriptor to validate\n             * \\returns \\a true if the memory descriptor fulfils\n             *          the guarantees and \\a false otherwise.\n             *\/\n            static bool validate( const memory_descriptor &md )\n            {\n                \/\/ Check if memory block size already overflows\n                if( (std::numeric_limits<common::uint64>::max() \/\n                     pagesize ) > md.number_of_pages )\n                    return false;\n                \/\/ Check if the block starting at physical_address\n                \/\/ overflows\n                if( (std::numeric_limits<common::uint64>::max() -\n                    pagesize * md.number_of_pages) < md.physical_start )\n                    return false;\n                \/\/ Check if the block starting at virtual_address\n                \/\/ overflows\n                if( (std::numeric_limits<common::uint64>::max() -\n                    pagesize * md.number_of_pages) < md.virtual_start )\n                    return false;\n                \/\/ Do not retain zero sized memory regions\n                if( md.number_of_pages == 0 )\n                    return false;\n            }\n        };\n        \n        \/** \\class memory_map\n         * \\brief The memory map used by the kernel\n         * \\tparam Allocator The type of allocator to use\n         *\n         * It has some sanity guarantees that UEFI lacks, like:\n         * - fixed size of descriptors that is known compile-time\n         * - overlapping ranges are merged if possible\n         *   and removed otherwise\n         *\/\n        template<class Allocator>\n        class memory_map\n        {\n        public:\n            using allocator_type = Allocator;\n        private:\n            using desc_array = dynarray<memory_descriptor, allocator_type>;\n            desc_array descriptors;\n            \n            \/** \\brief Checks whether the memory regions\n             *         described by two memory descriptors\n             *         overlap.\n             * \\param[in] md1 The first memory descriptor\n             * \\param[in] md2 The second memory descriptor\n             * \\returns \\a true if there is an overlap\n             * \\warning The virtual start of \\a md1 has to\n             *          preceede that of \\a md2, otherwise\n             *          the behaviour is undefined.\n             *\/\n            static bool have_overlap( const memory_descriptor &md1,\n                        const memory_descriptor &md2 )\n            {\n                debug_assert( md1.virtual_start <= md2.virtual_start,\n                             \"md1 does not preceede md2!\" );\n                \n                auto end1 = md1.virtual_start + pagesize * md1.number_of_pages;\n                return (end1 > md2.virtual_start);\n            };\n            \n            \/** \\brief Merges the memory regions described\n             *         by two overlapping memory descriptors.\n             * \\param[in] md1 The first memory descriptor\n             * \\param[in] md2 The second memory descriptor\n             * \\returns The merged memory descriptor describing\n             *          both memory regions. If the regions\n             *          are incompatible or either is invalid\n             *          the returned descriptor will also be invalid.\n             * \\warning The virtual start of \\a md1 has to\n             *          preceede that of \\a md2, otherwise\n             *          the behaviour is undefined.\n             * \\warning The memory regions described by \\a md1\n             *          and \\a md2 have to overlap, otherwise\n             *          the behaviour is undefined.\n             *\/\n            static memory_descriptor merge_with_overlap( const memory_descriptor &md1,\n                                                       const memory_descriptor &md2 )\n            {\n                debug_assert( md1.virtual_start <= md2.virtual_start,\n                             \"md1 does not preceede md2!\" );\n                debug_assert( have_overlap( md1, md2 ),\n                             \"md1 and md2 do not overlap\" );\n                \n                if( md1.type != md2.type )\n                {\n                    \/\/ Different memory descriptor types\n                    \/\/ for overlapping ranges... Corrupt!\n                    return memory_descriptor::invalid_memory_descriptor();\n                }\n                \n                auto size_before_overlap = md2.virtual_start - md1.virtual_start;\n                auto physical_start2 = md1.physical_start + size_before_overlap;\n                \n                if( md2.physical_start != physical_start2 )\n                {\n                    \/\/ Same virtual address is mapped to multiple\n                    \/\/ physical addresses... corrupt!\n                    return memory_descriptor::invalid_memory_descriptor();\n                }\n                \n                \/\/ Legal overlap\n                auto end1 = (md1.virtual_start +\n                             pagesize * md1.number_of_pages);\n                auto end2 = (md2.virtual_start +\n                             pagesize * md2.number_of_pages);\n                auto end = std::max( end1, end2 );\n                \n                return memory_descriptor{ md1.type, md1.physical_start,\n                    md1.virtual_start, (end - md1.virtual_start) \/ pagesize };\n            }\n            \n            \/** \\brief Checks whether the memory regions described\n             *         by two memory descriptors are adjacent\n             *         and if they are mergable.\n             * \\param[in] md1 The first memory descriptor\n             * \\param[in] md2 The second memory descriptor\n             * \\returns \\a true if the ranges are adjacent\n             * \\warning The virtual start of \\a md1 has to\n             *          preceede that of \\a md2, otherwise\n             *          the behaviour is undefined.\n             *\n             * Two memory ranges are mergable if they share the\n             * same type and their physical addresses line up.\n             *\/\n            static bool are_adjacent_and_mergable( const memory_descriptor &md1,\n                                                  const memory_descriptor &md2 )\n            {\n                debug_assert( md1.virtual_start <= md2.virtual_start,\n                             \"md1 does not preceede md2!\" );\n                \n                if( md1.type != md2.type )\n                    return false;\n                \n                auto end1 = md1.virtual_start + pagesize * md1.number_of_pages;\n                \n                if( md1.physical_start + (end1 - md1.virtual_start) != md2.physical_start )\n                    return false;\n                \n                return (end1 == md2.virtual_start);\n            };\n            \n            \/** \\brief Merges the memory regions described\n             *         by two adjacent memory descriptors.\n             * \\param[in] md1 The first memory descriptor\n             * \\param[in] md2 The second memory descriptor\n             * \\returns The merged memory descriptor describing\n             *          both memory regions.\n             * \\warning The virtual start of \\a md1 has to\n             *          preceede that of \\a md2, otherwise\n             *          the behaviour is undefined.\n             * \\warning The memory regions described by \\a md1\n             *          and \\a md2 have to be adjacent and mergable,\n             *          otherwise the behaviour is undefined.\n             *\/\n            static memory_descriptor merge_adjacent( const memory_descriptor &md1,\n                                                    const memory_descriptor &md2 )\n            {\n                debug_assert( md1.virtual_start <= md2.virtual_start,\n                             \"md1 does not preceede md2!\" );\n                debug_assert( are_adjacent_and_mergable( md1, md2 ),\n                             \"md1 and md2 are not adjacent!\" );\n                \n                auto end = (md2.virtual_start +\n                            pagesize * md2.number_of_pages);\n                \n                return memory_descriptor{ md1.type, md1.physical_start,\n                    md1.virtual_start, (end - md1.virtual_start) \/ pagesize };\n            }\n            \n            \/** \\brief Convert a uefi memory map to a\n             *         kernel-usable one.\n             * \\param[in] uefi_map The UEFI memory map\n             * \\param[in] The allocator to use\n             * \\returns An array of descriptors with the guarantee\n             *          that they do not overlap.\n             *\/\n            static desc_array\n            convert_from_uefi( const UEFI::memory_map &uefi_map,\n                              allocator_type &&alloc )\n            {\n                desc_array stage1_descriptors( uefi_map.cbegin_v1(),\n                                              uefi_map.cend_v1(),\n                                              std::forward<allocator_type>( alloc ) );\n                \n                auto endValid = std::partition( stage1_descriptors.begin(),\n                                               stage1_descriptors.end(),\n                                               std::mem_fn( &memory_descriptor::is_valid ) );\n                \n                std::sort( stage1_descriptors.begin(), stage1_descriptors.end(),\n                          [] ( const memory_descriptor &md1, const memory_descriptor &md2 ) {\n                              return (md1.virtual_start < md2.virtual_start);\n                          } );\n                \n                for( auto lower = stage1_descriptors.begin();\n                    lower != endValid; ++lower )\n                {\n                    auto &md1 = *lower;\n                    auto upper = lower + 1;\n                    \n                    if( upper == endValid )\n                        break;\n                    auto &md2 = *upper;\n                    \n                    if( have_overlap( md1, md2 ) )\n                    {\n                        md2 = merge_with_overlap( md1, md2 );\n                        if( md2.type == memory_type::invalid )\n                            md1.type = memory_type::invalid;\n                        ++lower;\n                    } else if( are_adjacent_and_mergable( md1, md2 ) )\n                    {\n                        md2 = merge_adjacent( md1, md2 );\n                        ++lower;\n                    }\n                }\n                \n                endValid = std::partition( stage1_descriptors.begin(),\n                                          stage1_descriptors.end(),\n                                          std::mem_fn( &memory_descriptor::is_valid ) );\n                \n                return desc_array( std::move( stage1_descriptors ),\n                                  endValid - stage1_descriptors.begin() );\n            }\n        public:\n            \/** \\brief Returns a memory_request that when fulfilled\n             *         will suffice to convert a UEFI memory map\n             *         to a kernel-usable one.\n             * \\param[in] uefi_map The UEFI memory map\n             * \\returns The memory_request\n             *\/\n            static memory_request<alignof(memory_descriptor)>\n            maximum_conversion_requirement( const UEFI::memory_map &uefi_map )\n            {\n                return { uefi_map.number_of_descriptors * sizeof(memory_descriptor) };\n            }\n            \n            \/** \\brief Returns a memory_request that when fulfilled\n             *         will suffice to copy the memory map.\n             * \\returns The memory_request\n             *\/\n            memory_request<alignof(memory_descriptor)> copy_requirement( void ) const\n            {\n                return { descriptors.size() * sizeof(memory_descriptor) };\n            }\n            \n            \/** \\brief Constructs a kernel-usable memory map\n             *         from a UEFI memory map.\n             * \\param[in] uefi_map The UEFI memory map\n             * \\param[in] alloc The allocator used to copy the\n             *                  memory map. It has to be able to\n             *                  allocate at least what is returned\n             *                  by \\a maximum_conversion_requirement.\n             *\/\n            memory_map( const UEFI::memory_map &uefi_map, allocator_type &&alloc )\n            : descriptors( convert_from_uefi( uefi_map,\n                                             std::forward<allocator_type>( alloc ) ) )\n            {}\n            \n            \/** \\brief Returns a const iterator to the begin of\n             *         the memory descriptor range.\n             * \\returns A const iterator to the begin of\n             *          the memory descriptor range\n             *\/\n            typename desc_array::const_iterator cbegin( void ) const\n            { return descriptors.cbegin(); }\n            \n            \/** \\brief Returns a const iterator to the end of\n             *         the memory descriptor range.\n             * \\returns A const iterator to the end of\n             *          the memory descriptor range\n             *\/\n            typename desc_array::const_iterator cend( void ) const\n            { return descriptors.cend(); }\n        };\n    }\n}\n\n#endif\n\n\/** \\} *\/\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __MAPNIK_COMPARE_IMAGES_HPP__\n#define __MAPNIK_COMPARE_IMAGES_HPP__\n\n#include <mapnik\/image.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/image_reader.hpp>\n\nusing namespace mapnik;\n\nnamespace benchmark {\n\n    bool compare_images(std::string const& src_fn,std::string const& dest_fn)\n    {\n        std::unique_ptr<mapnik::image_reader> reader1(mapnik::get_image_reader(dest_fn,\"png\"));\n        if (!reader1.get())\n        {\n            throw mapnik::image_reader_exception(\"Failed to load: \" + dest_fn);\n        }\n\n        std::unique_ptr<mapnik::image_reader> reader2(mapnik::get_image_reader(src_fn,\"png\"));\n        if (!reader2.get())\n        {\n            throw mapnik::image_reader_exception(\"Failed to load: \" + src_fn);\n        }\n\n        image_rgba8 const& dest = util::get<image_rgba8>(reader1->read(0,0,reader1->width(), reader1->height()));\n        image_rgba8 const& src = util::get<image_rgba8>(reader1->read(0,0,reader1->width(), reader1->height()));\n\n        unsigned int width = src.width();\n        unsigned int height = src.height();\n        if ((width != dest.width()) || height != dest.height()) return false;\n        for (unsigned int y = 0; y < height; ++y)\n        {\n            const unsigned int* row_from = src.getRow(y);\n            const unsigned int* row_to = dest.getRow(y);\n            for (unsigned int x = 0; x < width; ++x)\n            {\n               if (row_from[x] != row_to[x]) return false;\n            }\n        }\n        return true;\n    }\n\n}\n\n#endif \/\/ __MAPNIK_COMPARE_IMAGES_HPP__\n<commit_msg>benchmark: fix image loading<commit_after>#ifndef __MAPNIK_COMPARE_IMAGES_HPP__\n#define __MAPNIK_COMPARE_IMAGES_HPP__\n\n#include <mapnik\/image.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/image_reader.hpp>\n\nusing namespace mapnik;\n\nnamespace benchmark {\n\n    bool compare_images(std::string const& src_fn,std::string const& dest_fn)\n    {\n        std::unique_ptr<mapnik::image_reader> reader1(mapnik::get_image_reader(dest_fn,\"png\"));\n        if (!reader1.get())\n        {\n            throw mapnik::image_reader_exception(\"Failed to load: \" + dest_fn);\n        }\n\n        std::unique_ptr<mapnik::image_reader> reader2(mapnik::get_image_reader(src_fn,\"png\"));\n        if (!reader2.get())\n        {\n            throw mapnik::image_reader_exception(\"Failed to load: \" + src_fn);\n        }\n\n        image_rgba8 const& dest = util::get<image_rgba8>(reader1->read(0,0,reader1->width(), reader1->height()));\n        image_rgba8 const& src = util::get<image_rgba8>(reader2->read(0,0,reader2->width(), reader2->height()));\n\n        unsigned int width = src.width();\n        unsigned int height = src.height();\n        if ((width != dest.width()) || height != dest.height()) return false;\n        for (unsigned int y = 0; y < height; ++y)\n        {\n            const unsigned int* row_from = src.getRow(y);\n            const unsigned int* row_to = dest.getRow(y);\n            for (unsigned int x = 0; x < width; ++x)\n            {\n               if (row_from[x] != row_to[x]) return false;\n            }\n        }\n        return true;\n    }\n\n}\n\n#endif \/\/ __MAPNIK_COMPARE_IMAGES_HPP__\n<|endoftext|>"}
{"text":"<commit_before>\n#include <cppfs\/Url.h>\n\n#include <algorithm>\n\n\nnamespace cppfs\n{\n\n\nUrl::Url()\n: m_url(\"\")\n, m_analyzed(false)\n, m_protocol(\"\")\n, m_location(\"\")\n, m_address(\"\")\n, m_path(\"\")\n, m_login(\"\")\n, m_host(\"\")\n, m_username(\"\")\n, m_password(\"\")\n{\n}\n\nUrl::Url(const Url & url)\n: m_url(url.m_url)\n, m_analyzed(url.m_analyzed)\n, m_protocol(url.m_protocol)\n, m_location(url.m_location)\n, m_address(url.m_address)\n, m_path(url.m_path)\n, m_login(url.m_login)\n, m_host(url.m_host)\n, m_username(url.m_username)\n, m_password(url.m_password)\n{\n}\n\nUrl::Url(const Url && url)\n: m_url(url.m_url)\n, m_analyzed(url.m_analyzed)\n, m_protocol(url.m_protocol)\n, m_location(url.m_location)\n, m_address(url.m_address)\n, m_path(url.m_path)\n, m_login(url.m_login)\n, m_host(url.m_host)\n, m_username(url.m_username)\n, m_password(url.m_password)\n{\n}\n\nUrl::Url(const std::string & url)\n: m_url(url)\n, m_analyzed(false)\n, m_protocol(\"\")\n, m_location(\"\")\n, m_address(\"\")\n, m_path(\"\")\n, m_login(\"\")\n, m_host(\"\")\n, m_username(\"\")\n, m_password(\"\")\n{\n}\n\nUrl::Url(const std::string && url)\n: m_url(url)\n, m_analyzed(false)\n, m_protocol(\"\")\n, m_location(\"\")\n, m_address(\"\")\n, m_path(\"\")\n, m_login(\"\")\n, m_host(\"\")\n, m_username(\"\")\n, m_password(\"\")\n{\n}\n\nUrl::Url(const char * url)\n: m_url(url)\n, m_analyzed(false)\n, m_protocol(\"\")\n, m_location(\"\")\n, m_address(\"\")\n, m_path(\"\")\n, m_login(\"\")\n, m_host(\"\")\n, m_username(\"\")\n, m_password(\"\")\n{\n}\n\nUrl::~Url()\n{\n}\n\nUrl & Url::operator=(const Url & url)\n{\n    m_url      = url.m_url;\n    m_analyzed = url.m_analyzed;\n    m_protocol = url.m_protocol;\n    m_location = url.m_location;\n    m_address  = url.m_address;\n    m_path     = url.m_path;\n    m_login    = url.m_login;\n    m_host     = url.m_host;\n    m_username = url.m_username;\n    m_password = url.m_password;\n\n    return *this;\n}\n\nUrl & Url::operator=(const Url && url)\n{\n    m_url      = std::move(url.m_url);\n    m_analyzed = std::move(url.m_analyzed);\n    m_protocol = std::move(url.m_protocol);\n    m_location = std::move(url.m_location);\n    m_address  = std::move(url.m_address);\n    m_path     = std::move(url.m_path);\n    m_login    = std::move(url.m_login);\n    m_host     = std::move(url.m_host);\n    m_username = std::move(url.m_username);\n    m_password = std::move(url.m_password);\n\n    return *this;\n}\n\nconst std::string & Url::toString() const\n{\n    return m_url;\n}\n\nstd::string Url::protocol() const\n{\n    analyze();\n    return m_protocol;\n}\n\nstd::string Url::location() const\n{\n    analyze();\n    return m_location;\n}\n\nstd::string Url::address() const\n{\n    analyze();\n    return m_address;\n}\n\nstd::string Url::path() const\n{\n    analyze();\n    return m_path;\n}\n\nstd::string Url::login() const\n{\n    analyze();\n    return m_login;\n}\n\nstd::string Url::host() const\n{\n    analyze();\n    return m_host;\n}\n\nstd::string Url::username() const\n{\n    analyze();\n    return m_username;\n}\n\nstd::string Url::password() const\n{\n    analyze();\n    return m_password;\n}\n\nvoid Url::analyze() const\n{\n    \/\/ Abort if already analyzed\n    if (m_analyzed) return;\n\n    \/\/ Reset information\n    m_protocol = \"\";\n    m_location = \"\";\n    m_address  = \"\";\n    m_path     = \"\";\n    m_login    = \"\";\n    m_host     = \"\";\n    m_username = \"\";\n    m_password = \"\";\n\n    \/\/ Get protocol and location\n    std::size_t pos = m_url.find(\":\/\/\");\n\n    if (pos != std::string::npos)\n    {\n        m_protocol = m_url.substr(0, pos + 3);\n        m_location = m_url.substr(pos+3);\n    }\n    else\n    {\n        m_location = m_url;\n    }\n\n    \/\/ Get address and path\n    pos = m_location.find(\"\/\");\n\n    if (pos != std::string::npos)\n    {\n        m_address = m_location.substr(0, pos);\n        m_path    = m_location.substr(pos);\n    }\n    else\n    {\n        m_path = m_location;\n    }\n\n    \/\/ Get login and host\n    pos = m_address.find(\"@\");\n\n    if (pos != std::string::npos)\n    {\n        m_login = m_address.substr(0, pos);\n        m_host  = m_address.substr(pos+1);\n    }\n    else\n    {\n        m_login = \"\";\n        m_host  = m_address;\n    }\n\n    \/\/ Get username and password\n    pos = m_login.find(\":\");\n\n    if (pos != std::string::npos)\n    {\n        m_username = m_login.substr(0, pos);\n        m_password = m_login.substr(pos+1);\n    }\n    else\n    {\n        m_username = m_login;\n    }\n\n    \/\/ Set status\n    m_analyzed = true;\n}\n\n\n} \/\/ namespace cppfs\n<commit_msg>Workaround for Url bugs<commit_after>\n#include <cppfs\/Url.h>\n\n#include <algorithm>\n\n\nnamespace cppfs\n{\n\n\nUrl::Url()\n: m_url(\"\")\n, m_analyzed(false)\n, m_protocol(\"\")\n, m_location(\"\")\n, m_address(\"\")\n, m_path(\"\")\n, m_login(\"\")\n, m_host(\"\")\n, m_username(\"\")\n, m_password(\"\")\n{\n}\n\nUrl::Url(const Url & url)\n: m_url(url.m_url)\n, m_analyzed(url.m_analyzed)\n, m_protocol(url.m_protocol)\n, m_location(url.m_location)\n, m_address(url.m_address)\n, m_path(url.m_path)\n, m_login(url.m_login)\n, m_host(url.m_host)\n, m_username(url.m_username)\n, m_password(url.m_password)\n{\n}\n\nUrl::Url(const Url && url)\n: m_url(url.m_url)\n, m_analyzed(url.m_analyzed)\n, m_protocol(url.m_protocol)\n, m_location(url.m_location)\n, m_address(url.m_address)\n, m_path(url.m_path)\n, m_login(url.m_login)\n, m_host(url.m_host)\n, m_username(url.m_username)\n, m_password(url.m_password)\n{\n}\n\nUrl::Url(const std::string & url)\n: m_url(url)\n, m_analyzed(false)\n, m_protocol(\"\")\n, m_location(\"\")\n, m_address(\"\")\n, m_path(\"\")\n, m_login(\"\")\n, m_host(\"\")\n, m_username(\"\")\n, m_password(\"\")\n{\n}\n\nUrl::Url(const std::string && url)\n: m_url(url)\n, m_analyzed(false)\n, m_protocol(\"\")\n, m_location(\"\")\n, m_address(\"\")\n, m_path(\"\")\n, m_login(\"\")\n, m_host(\"\")\n, m_username(\"\")\n, m_password(\"\")\n{\n}\n\nUrl::Url(const char * url)\n: m_url(url)\n, m_analyzed(false)\n, m_protocol(\"\")\n, m_location(\"\")\n, m_address(\"\")\n, m_path(\"\")\n, m_login(\"\")\n, m_host(\"\")\n, m_username(\"\")\n, m_password(\"\")\n{\n}\n\nUrl::~Url()\n{\n}\n\nUrl & Url::operator=(const Url & url)\n{\n    m_url      = url.m_url;\n    m_analyzed = url.m_analyzed;\n    m_protocol = url.m_protocol;\n    m_location = url.m_location;\n    m_address  = url.m_address;\n    m_path     = url.m_path;\n    m_login    = url.m_login;\n    m_host     = url.m_host;\n    m_username = url.m_username;\n    m_password = url.m_password;\n\n    return *this;\n}\n\nUrl & Url::operator=(const Url && url)\n{\n    m_url      = std::move(url.m_url);\n    m_analyzed = std::move(url.m_analyzed);\n    m_protocol = std::move(url.m_protocol);\n    m_location = std::move(url.m_location);\n    m_address  = std::move(url.m_address);\n    m_path     = std::move(url.m_path);\n    m_login    = std::move(url.m_login);\n    m_host     = std::move(url.m_host);\n    m_username = std::move(url.m_username);\n    m_password = std::move(url.m_password);\n\n    return *this;\n}\n\nconst std::string & Url::toString() const\n{\n    return m_url;\n}\n\nstd::string Url::protocol() const\n{\n    analyze();\n    return m_protocol;\n}\n\nstd::string Url::location() const\n{\n    analyze();\n    return m_location;\n}\n\nstd::string Url::address() const\n{\n    analyze();\n    return m_address;\n}\n\nstd::string Url::path() const\n{\n    analyze();\n    return m_path;\n}\n\nstd::string Url::login() const\n{\n    analyze();\n    return m_login;\n}\n\nstd::string Url::host() const\n{\n    analyze();\n    return m_host;\n}\n\nstd::string Url::username() const\n{\n    analyze();\n    return m_username;\n}\n\nstd::string Url::password() const\n{\n    analyze();\n    return m_password;\n}\n\nvoid Url::analyze() const\n{\n    \/\/ Abort if already analyzed\n    if (m_analyzed) return;\n\n    \/\/ Reset information\n    m_protocol = \"\";\n    m_location = \"\";\n    m_address  = \"\";\n    m_path     = \"\";\n    m_login    = \"\";\n    m_host     = \"\";\n    m_username = \"\";\n    m_password = \"\";\n\n    \/\/ Get protocol and location\n    std::size_t pos = m_url.find(\":\/\/\");\n\n    if (pos != std::string::npos)\n    {\n        m_protocol = m_url.substr(0, pos + 3);\n        m_location = m_url.substr(pos+3);\n    }\n    else\n    {\n        m_location = m_url;\n    }\n\n    \/\/ Get address and path\n    pos = m_location.find(\"\/\");\n\n    \/\/ [TODO] Find a better solution, e.g., a real regex to deal with different paths\/urls\n    if (m_protocol != \"\" && m_protocol != \"file:\/\/\" && pos != std::string::npos)\n    {\n        m_address = m_location.substr(0, pos);\n        m_path    = m_location.substr(pos);\n    }\n    else\n    {\n        m_path = m_location;\n    }\n\n    \/\/ Get login and host\n    pos = m_address.find(\"@\");\n\n    if (pos != std::string::npos)\n    {\n        m_login = m_address.substr(0, pos);\n        m_host  = m_address.substr(pos+1);\n    }\n    else\n    {\n        m_login = \"\";\n        m_host  = m_address;\n    }\n\n    \/\/ Get username and password\n    pos = m_login.find(\":\");\n\n    if (pos != std::string::npos)\n    {\n        m_username = m_login.substr(0, pos);\n        m_password = m_login.substr(pos+1);\n    }\n    else\n    {\n        m_username = m_login;\n    }\n\n    \/\/ Set status\n    m_analyzed = true;\n}\n\n\n} \/\/ namespace cppfs\n<|endoftext|>"}
{"text":"<commit_before>#include \"ofApp.h\"\n\nvoid ofApp::swapPlayer() {\n    currentPlayer ++;\n    currentPlayer %= 2;\n}\n\nvoid stopAndLoadNewVid(ofVideoPlayer* vidPlayer, string vidToLoad) {\n    vidPlayer->stop();\n    vidPlayer->close();\n    vidPlayer->loadMovie(vidToLoad);\n}\n\n\/\/--------------------------------------------------------------\nvoid ofApp::setup(){\n    ofBackground(30, 30, 30);\n    \n    vision.setupCamera(0, 320, 240);\n    \n    ttf.loadFont(\"Helvetica.ttf\", 48);\n    ttfSmall.loadFont(\"Helvetica.ttf\", 14);\n    \n    img.allocate(320, 240, OF_IMAGE_GRAYSCALE);\n    smiley.loadImage(\"Smiley.png\");\n    \n    lastTime = ofGetElapsedTimef() - 10.0;\n    \n    ofDirectory moviesDir(\"movies\");\n    moviesDir.allowExt(\"mp4\");\n    moviesDir.allowExt(\"mov\");\n    moviesDir.listDir();\n    for(int i=0; i < moviesDir.numFiles(); i++) {\n        string path = moviesDir.getPath(i);\n        movies.push_back(path);\n    }\n    \n    smilePct = 0.0;\n    smoothPct = 0.0;\n    \n    for(int i=0; i<2; i++) {\n        players[i] = new ofVideoPlayer();\n        \/\/players[i] = new ofVideoPlayer();\n        players[i]->setLoopState(OF_LOOP_NORMAL);\n        players[i]->setPixelFormat(OF_PIXELS_RGB);\n        players[i]->loadMovie(movies[i]);\n    }\n    currentMovie = 0;\n    players[currentPlayer]->setPaused(false);\n    players[currentPlayer]->play();\n}\n\n\/\/--------------------------------------------------------------\nvoid ofApp::update(){\n    vision.update();\n    img.setFromPixels(vision.gray.getPixels(), vision.gray.width, vision.gray.height, OF_IMAGE_GRAYSCALE);\n    \n    smiles = ofxSmile::getSmile(img);\n    smilePct = 0.0;\n    for(pair<ofVec4f, float> smile : smiles) {\n        if(smile.second > smilePct) smilePct = smile.second;\n    }\n    \n    smoothPct *= 0.8;\n    smoothPct += MAX(0, smilePct) * 0.2;\n    \n    if(ofGetElapsedTimef() - lastTime > 2.0) {\n        if(smoothPct > 0.50) {\n            smileDetected = true;\n            ++currentMovie;\n            currentMovie %= movies.size();\n            stopAndLoadNewVid(players[currentPlayer], movies[currentMovie]);\n            swapPlayer();\n            players[currentPlayer]->play();\n            players[currentPlayer]->setPaused(false);\n            lastTime = ofGetElapsedTimef();\n        } else {\n            smileDetected = false;\n        }\n    }\n    players[currentPlayer]->update();\n}\n\n\/\/--------------------------------------------------------------\nvoid ofApp::draw(){\n    ofSetColor(255);\n    players[currentPlayer]->draw(0, 0, ofGetWidth(), ofGetHeight());\n    vision.color.draw(ofGetWidth() - 320, 0);\n    unsigned long long now = ofGetElapsedTimef();\n    ofDrawBitmapString(\"smile        = \" + ofToString(smilePct, 2), 20, 20);\n    ofDrawBitmapString(\"smile smooth = \" + ofToString(smoothPct, 2), 20, 36);\n    \n    if(smileDetected) {\n        ofSetColor(255);\n        for(auto smile : smiles) {\n            float faceX = smile.first.x;\n            float faceY = smile.first.y;\n            float faceWidth = smile.first.z;\n            float faceHeight = smile.first.w;\n            if(smile.second > 0.50) smiley.draw(ofGetWidth() - vision.color.width + faceX, faceY, faceWidth, faceHeight);\n        }\n        ofSetColor(255, 255, 255, 255);\n    }\n}\n\n\/\/--------------------------------------------------------------\nvoid ofApp::keyPressed(int key){\n    if(key == ' ')\n    {\n        vision.togglePlayback();\n    }\n    \n    \/\/ if you need to adjust the camera properties\n    if(key == 's')\n    {\n        vision.camera.videoSettings();\n    }\n}<commit_msg>got rid of range based loops for linux<commit_after>#include \"ofApp.h\"\n\nvoid ofApp::swapPlayer() {\n    currentPlayer ++;\n    currentPlayer %= 2;\n}\n\nvoid stopAndLoadNewVid(ofVideoPlayer* vidPlayer, string vidToLoad) {\n    vidPlayer->stop();\n    vidPlayer->close();\n    vidPlayer->loadMovie(vidToLoad);\n}\n\n\/\/--------------------------------------------------------------\nvoid ofApp::setup(){\n    ofBackground(30, 30, 30);\n    \n    vision.setupCamera(0, 320, 240);\n    \n    ttf.loadFont(\"Helvetica.ttf\", 48);\n    ttfSmall.loadFont(\"Helvetica.ttf\", 14);\n    \n    img.allocate(320, 240, OF_IMAGE_GRAYSCALE);\n    smiley.loadImage(\"Smiley.png\");\n    \n    lastTime = ofGetElapsedTimef() - 10.0;\n    \n    ofDirectory moviesDir(\"movies\");\n    moviesDir.allowExt(\"mp4\");\n    moviesDir.allowExt(\"mov\");\n    moviesDir.listDir();\n    for(int i=0; i < moviesDir.numFiles(); i++) {\n        string path = moviesDir.getPath(i);\n        movies.push_back(path);\n    }\n    \n    smilePct = 0.0;\n    smoothPct = 0.0;\n    \n    for(int i=0; i<2; i++) {\n        players[i] = new ofVideoPlayer();\n        \/\/players[i] = new ofVideoPlayer();\n        players[i]->setLoopState(OF_LOOP_NORMAL);\n        players[i]->setPixelFormat(OF_PIXELS_RGB);\n        players[i]->loadMovie(movies[i]);\n    }\n    currentMovie = 0;\n    players[currentPlayer]->setPaused(false);\n    players[currentPlayer]->play();\n}\n\n\/\/--------------------------------------------------------------\nvoid ofApp::update(){\n    vision.update();\n    img.setFromPixels(vision.gray.getPixels(), vision.gray.width, vision.gray.height, OF_IMAGE_GRAYSCALE);\n    \n    smiles = ofxSmile::getSmile(img);\n    smilePct = 0.0;\n    for(int i=0; i < smiles.size(); i++) {\n        if(smiles[i].second > smilePct) smilePct = smiles[i].second;\n    }\n    \n    smoothPct *= 0.8;\n    smoothPct += MAX(0, smilePct) * 0.2;\n    \n    if(ofGetElapsedTimef() - lastTime > 2.0) {\n        if(smoothPct > 0.50) {\n            smileDetected = true;\n            ++currentMovie;\n            currentMovie %= movies.size();\n            stopAndLoadNewVid(players[currentPlayer], movies[currentMovie]);\n            swapPlayer();\n            players[currentPlayer]->play();\n            players[currentPlayer]->setPaused(false);\n            lastTime = ofGetElapsedTimef();\n        } else {\n            smileDetected = false;\n        }\n    }\n    players[currentPlayer]->update();\n}\n\n\/\/--------------------------------------------------------------\nvoid ofApp::draw(){\n    ofSetColor(255);\n    players[currentPlayer]->draw(0, 0, ofGetWidth(), ofGetHeight());\n    vision.color.draw(ofGetWidth() - 320, 0);\n    unsigned long long now = ofGetElapsedTimef();\n    ofDrawBitmapString(\"smile        = \" + ofToString(smilePct, 2), 20, 20);\n    ofDrawBitmapString(\"smile smooth = \" + ofToString(smoothPct, 2), 20, 36);\n    \n    if(smileDetected) {\n        ofSetColor(255);\n        for(int i=0; i < smiles.size() ; i++) {\n            float faceX = smiles[i].first.x;\n            float faceY = smiles[i].first.y;\n            float faceWidth = smiles[i].first.z;\n            float faceHeight = smiles[i].first.w;\n            if(smiles[i].second > 0.50) smiley.draw(ofGetWidth() - vision.color.width + faceX, faceY, faceWidth, faceHeight);\n        }\n        ofSetColor(255, 255, 255, 255);\n    }\n}\n\n\/\/--------------------------------------------------------------\nvoid ofApp::keyPressed(int key){\n    if(key == ' ')\n    {\n        vision.togglePlayback();\n    }\n    \n    \/\/ if you need to adjust the camera properties\n    if(key == 's')\n    {\n        vision.camera.videoSettings();\n    }\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2020 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Vulkan Renderer\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/VulkanRenderer\/Wrapper\/DeviceObject.hpp>\n#include <Nazara\/Core\/Error.hpp>\n#include <Nazara\/VulkanRenderer\/Utils.hpp>\n#include <Nazara\/VulkanRenderer\/Debug.hpp>\n\nnamespace Nz\n{\n\tnamespace Vk\n\t{\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDeviceObject<C, VkType, CreateInfo, ObjectType>::DeviceObject() :\n\t\tm_handle(VK_NULL_HANDLE)\n\t\t{\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDeviceObject<C, VkType, CreateInfo, ObjectType>::DeviceObject(DeviceObject&& object) noexcept :\n\t\tm_device(std::move(object.m_device)),\n\t\tm_allocator(object.m_allocator),\n\t\tm_handle(object.m_handle),\n\t\tm_lastErrorCode(object.m_lastErrorCode)\n\t\t{\n\t\t\tobject.m_handle = VK_NULL_HANDLE;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDeviceObject<C, VkType, CreateInfo, ObjectType>::~DeviceObject()\n\t\t{\n\t\t\tDestroy();\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tbool DeviceObject<C, VkType, CreateInfo, ObjectType>::Create(Device& device, const CreateInfo& createInfo, const VkAllocationCallbacks* allocator)\n\t\t{\n\t\t\tDestroy();\n\n\t\t\tm_device = &device;\n\t\t\tm_lastErrorCode = C::CreateHelper(*m_device, &createInfo, allocator, &m_handle);\n\t\t\tif (m_lastErrorCode != VkResult::VK_SUCCESS)\n\t\t\t{\n\t\t\t\tNazaraError(\"Failed to create Vulkan object: \" + TranslateVulkanError(m_lastErrorCode));\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ Store the allocator to access them when needed\n\t\t\tif (allocator)\n\t\t\t\tm_allocator = *allocator;\n\t\t\telse\n\t\t\t\tm_allocator.pfnAllocation = nullptr;\n\n\t\t\treturn true;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tvoid DeviceObject<C, VkType, CreateInfo, ObjectType>::Destroy()\n\t\t{\n\t\t\tif (IsValid())\n\t\t\t{\n\t\t\t\tC::DestroyHelper(*m_device, m_handle, (m_allocator.pfnAllocation) ? &m_allocator : nullptr);\n\t\t\t\tm_handle = VK_NULL_HANDLE;\n\t\t\t}\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tbool DeviceObject<C, VkType, CreateInfo, ObjectType>::IsValid() const\n\t\t{\n\t\t\treturn m_handle != VK_NULL_HANDLE;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDevice* DeviceObject<C, VkType, CreateInfo, ObjectType>::GetDevice() const\n\t\t{\n\t\t\treturn m_device;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tVkResult DeviceObject<C, VkType, CreateInfo, ObjectType>::GetLastErrorCode() const\n\t\t{\n\t\t\treturn m_lastErrorCode;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tvoid DeviceObject<C, VkType, CreateInfo, ObjectType>::SetDebugName(const char* name)\n\t\t{\n\t\t\tif (m_device->vkSetDebugUtilsObjectNameEXT)\n\t\t\t{\n\t\t\t\tVkDebugUtilsObjectNameInfoEXT debugName = { VK_STRUCTURE_TYPE_DEBUG_UTILS_OBJECT_NAME_INFO_EXT };\n\t\t\t\tdebugName.objectType = ObjectType;\n\t\t\t\tdebugName.objectHandle = static_cast<UInt64>(reinterpret_cast<std::uintptr_t>(m_handle));\n\t\t\t\tdebugName.pObjectName = name;\n\n\t\t\t\tm_device->vkSetDebugUtilsObjectNameEXT(*m_device, &debugName);\n\t\t\t}\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tvoid DeviceObject<C, VkType, CreateInfo, ObjectType>::SetDebugName(const std::string& name)\n\t\t{\n\t\t\treturn SetDebugName(name.data());\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tauto DeviceObject<C, VkType, CreateInfo, ObjectType>::operator=(DeviceObject&& object) noexcept -> DeviceObject&\n\t\t{\n\t\t\tstd::swap(m_allocator, object.m_allocator);\n\t\t\tstd::swap(m_device, object.m_device);\n\t\t\tstd::swap(m_handle, object.m_handle);\n\t\t\tstd::swap(m_lastErrorCode, object.m_lastErrorCode);\n\n\t\t\treturn *this;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDeviceObject<C, VkType, CreateInfo, ObjectType>::operator VkType() const\n\t\t{\n\t\t\treturn m_handle;\n\t\t}\n\t}\n}\n\n#include <Nazara\/VulkanRenderer\/DebugOff.hpp>\n<commit_msg>Fix 32bits compilation<commit_after>\/\/ Copyright (C) 2020 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Vulkan Renderer\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/VulkanRenderer\/Wrapper\/DeviceObject.hpp>\n#include <Nazara\/Core\/Error.hpp>\n#include <Nazara\/VulkanRenderer\/Utils.hpp>\n#include <type_traits>\n#include <Nazara\/VulkanRenderer\/Debug.hpp>\n\nnamespace Nz\n{\n\tnamespace Vk\n\t{\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDeviceObject<C, VkType, CreateInfo, ObjectType>::DeviceObject() :\n\t\tm_handle(VK_NULL_HANDLE)\n\t\t{\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDeviceObject<C, VkType, CreateInfo, ObjectType>::DeviceObject(DeviceObject&& object) noexcept :\n\t\tm_device(std::move(object.m_device)),\n\t\tm_allocator(object.m_allocator),\n\t\tm_handle(object.m_handle),\n\t\tm_lastErrorCode(object.m_lastErrorCode)\n\t\t{\n\t\t\tobject.m_handle = VK_NULL_HANDLE;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDeviceObject<C, VkType, CreateInfo, ObjectType>::~DeviceObject()\n\t\t{\n\t\t\tDestroy();\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tbool DeviceObject<C, VkType, CreateInfo, ObjectType>::Create(Device& device, const CreateInfo& createInfo, const VkAllocationCallbacks* allocator)\n\t\t{\n\t\t\tDestroy();\n\n\t\t\tm_device = &device;\n\t\t\tm_lastErrorCode = C::CreateHelper(*m_device, &createInfo, allocator, &m_handle);\n\t\t\tif (m_lastErrorCode != VkResult::VK_SUCCESS)\n\t\t\t{\n\t\t\t\tNazaraError(\"Failed to create Vulkan object: \" + TranslateVulkanError(m_lastErrorCode));\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ Store the allocator to access them when needed\n\t\t\tif (allocator)\n\t\t\t\tm_allocator = *allocator;\n\t\t\telse\n\t\t\t\tm_allocator.pfnAllocation = nullptr;\n\n\t\t\treturn true;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tvoid DeviceObject<C, VkType, CreateInfo, ObjectType>::Destroy()\n\t\t{\n\t\t\tif (IsValid())\n\t\t\t{\n\t\t\t\tC::DestroyHelper(*m_device, m_handle, (m_allocator.pfnAllocation) ? &m_allocator : nullptr);\n\t\t\t\tm_handle = VK_NULL_HANDLE;\n\t\t\t}\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tbool DeviceObject<C, VkType, CreateInfo, ObjectType>::IsValid() const\n\t\t{\n\t\t\treturn m_handle != VK_NULL_HANDLE;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDevice* DeviceObject<C, VkType, CreateInfo, ObjectType>::GetDevice() const\n\t\t{\n\t\t\treturn m_device;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tVkResult DeviceObject<C, VkType, CreateInfo, ObjectType>::GetLastErrorCode() const\n\t\t{\n\t\t\treturn m_lastErrorCode;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tvoid DeviceObject<C, VkType, CreateInfo, ObjectType>::SetDebugName(const char* name)\n\t\t{\n\t\t\tif (m_device->vkSetDebugUtilsObjectNameEXT)\n\t\t\t{\n\t\t\t\tVkDebugUtilsObjectNameInfoEXT debugName = { VK_STRUCTURE_TYPE_DEBUG_UTILS_OBJECT_NAME_INFO_EXT };\n\t\t\t\tdebugName.objectType = ObjectType;\n\t\t\t\tdebugName.pObjectName = name;\n\n\t\t\t\tif constexpr (std::is_pointer_v<VkType>)\n\t\t\t\t\tdebugName.objectHandle = static_cast<UInt64>(reinterpret_cast<std::uintptr_t>(m_handle));\n\t\t\t\telse\n\t\t\t\t\tdebugName.objectHandle = static_cast<UInt64>(m_handle);\n\n\t\t\t\tm_device->vkSetDebugUtilsObjectNameEXT(*m_device, &debugName);\n\t\t\t}\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tvoid DeviceObject<C, VkType, CreateInfo, ObjectType>::SetDebugName(const std::string& name)\n\t\t{\n\t\t\treturn SetDebugName(name.data());\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tauto DeviceObject<C, VkType, CreateInfo, ObjectType>::operator=(DeviceObject&& object) noexcept -> DeviceObject&\n\t\t{\n\t\t\tstd::swap(m_allocator, object.m_allocator);\n\t\t\tstd::swap(m_device, object.m_device);\n\t\t\tstd::swap(m_handle, object.m_handle);\n\t\t\tstd::swap(m_lastErrorCode, object.m_lastErrorCode);\n\n\t\t\treturn *this;\n\t\t}\n\n\t\ttemplate<typename C, typename VkType, typename CreateInfo, VkObjectType ObjectType>\n\t\tDeviceObject<C, VkType, CreateInfo, ObjectType>::operator VkType() const\n\t\t{\n\t\t\treturn m_handle;\n\t\t}\n\t}\n}\n\n#include <Nazara\/VulkanRenderer\/DebugOff.hpp>\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * VocabMatch.cpp\n *\n *  Created on: Oct 11, 2013\n *      Author: andresf\n *\/\n\n#include <fstream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string>\n#include <vector>\n#include <sys\/stat.h>\n\n#include <boost\/regex.hpp>\n\n#include <opencv2\/core\/core.hpp>\n\n#include <VocabTree.h>\n\n#include <FileUtils.hpp>\n\n#include <FunctionUtils.hpp>\n#include <HtmlResultsWriter.hpp>\n\ndouble mytime;\n\nint main(int argc, char **argv) {\n\n\tif (argc < 6 || argc > 10) {\n\t\tprintf(\n\t\t\t\t\"\\nUsage:\\n\"\n\t\t\t\t\t\t\"\\t%s <in.db> <in.db.gt.list> <in.query.list> <out.ranked.files.folder>\"\n\t\t\t\t\t\t\" <in.num.neighbors> [in.type.binary:1] [out.matches:matches.txt]\"\n\t\t\t\t\t\t\" [out.results:results.html] [out.candidates:candidates.txt]\\n\\n\",\n\t\t\t\targv[0]);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tchar *tree_in = argv[1];\n\tchar *db_list_in = argv[2];\n\tchar *query_list_in = argv[3];\n\tchar *ranked_files_folder = argv[4];\n\tuint num_nbrs = atoi(argv[5]);\n\tbool isDescriptorBinary = true;\n\tchar *matches_out = const_cast<char*>(\"matches.txt\");\n\tconst char *output_html = const_cast<char*>(\"results.html\");\n\tconst char *candidates_out = const_cast<char*>(\"candidates.txt\");\n\n\tif (argc >= 7) {\n\t\tisDescriptorBinary = atoi(argv[6]);\n\t}\n\n\tif (argc >= 8) {\n\t\tmatches_out = argv[7];\n\t}\n\n\tif (argc >= 9) {\n\t\toutput_html = argv[8];\n\t}\n\n\tif (argc >= 10) {\n\t\tcandidates_out = argv[9];\n\t}\n\n\t\/\/ Verifying input parameters\n\tboost::regex expression(\"^(.+)(\\\\.)(yaml|xml)(\\\\.)(gz)$\");\n\n\tif (boost::regex_match(std::string(tree_in), expression) == false) {\n\t\tfprintf(stderr,\n\t\t\t\t\"Input tree file must have the extension .yaml.gz or .xml.gz\\n\");\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/ Step 1\/4: load tree\n\tcv::Ptr<cvflann::VocabTreeBase> tree;\n\n\tif (isDescriptorBinary == true) {\n\t\ttree = new cvflann::VocabTree<uchar, cv::Hamming>();\n\t} else {\n\t\ttree = new cvflann::VocabTree<float, cvflann::L2<float> >();\n\t}\n\n\tprintf(\"-- Reading tree from [%s]\\n\", tree_in);\n\n\tmytime = cv::getTickCount();\n\ttree->load(std::string(tree_in));\n\tmytime = ((double) cv::getTickCount() - mytime) \/ cv::getTickFrequency()\n\t\t\t* 1000;\n\tprintf(\"   Tree loaded in [%lf] ms, got [%lu] words \\n\", mytime,\n\t\t\ttree->size());\n\n\t\/\/ Step 2\/4: read the database keyfiles\n\tprintf(\"-- Loading file of DB images ground truth\\n\");\n\tstd::vector<std::string> db_filenames;\n\tstd::vector<int> db_landmarks;\n\tstd::ifstream keysList(db_list_in, std::fstream::in);\n\n\tif (keysList.is_open() == false) {\n\t\tfprintf(stderr, \"Error opening file [%s] for reading\\n\", db_list_in);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/ Loading db keypoint filename and landmark id into a set\n\tstd::string line;\n\twhile (getline(keysList, line)) {\n\n\t\t\/\/ Verifying line format\n\t\tif (boost::regex_match(line, boost::regex(\"^(.+)\\\\s(.+)$\")) == false) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Line [%s] should be formatted as: <key.file> <landmark.id>\\n\",\n\t\t\t\t\tline.c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\t\/\/ Extracting filename and landmark from line\n\t\tchar filename[256];\n\t\tint landmark;\n\t\tsscanf(line.c_str(), \"%s %d\", filename, &landmark);\n\n\t\t\/\/ Checking that filename refers to a compressed yaml or xml file\n\t\tif (boost::regex_match(std::string(filename), expression) == false) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Keypoints file [%s] must have the extension .yaml.gz or .xml.gz\\n\",\n\t\t\t\t\tfilename);\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\t\/\/ Check that landmark id is valid\n\t\tif (landmark < 0) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Landmark id [%d] extracted from line [%s] should be greater than or equal to zero\\n\",\n\t\t\t\t\tlandmark, line.c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\tdb_filenames.push_back(std::string(filename));\n\t\tdb_landmarks.push_back(landmark);\n\t}\n\t\/\/ Close file\n\tkeysList.close();\n\n\t\/\/ Step 3\/4: read the query keyfiles\n\tprintf(\"-- Loading query keyfiles names\\n\");\n\tstd::vector<std::string> query_filenames;\n\tkeysList.open(query_list_in, std::fstream::in);\n\n\tif (keysList.is_open() == false) {\n\t\tfprintf(stderr, \"Error opening file [%s] for reading\\n\", db_list_in);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/ Loading file names in list into a vector\n\twhile (getline(keysList, line)) {\n\n\t\t\/\/ Checking that file exists, if not print error and exit\n\t\tstruct stat buffer;\n\t\tif (stat(line.c_str(), &buffer) != 0) {\n\t\t\tfprintf(stderr, \"Keypoints file [%s] doesn't exist\\n\",\n\t\t\t\t\tline.c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\t\/\/ Checking that line refers to a compressed yaml or xml file\n\t\tif (boost::regex_match(line, expression) == false) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Keypoints file [%s] must have the extension .yaml.gz or .xml.gz\\n\",\n\t\t\t\t\tline.c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\tquery_filenames.push_back(line);\n\t}\n\t\/\/ Close file\n\tkeysList.close();\n\n\t\/\/ Step 4\/4: score each query keyfile\n\tint normType = cv::NORM_L1;\n\n\tprintf(\"-- Scoring [%lu] query images against [%lu] DB images using [%s]\\n\",\n\t\t\tquery_filenames.size(), db_filenames.size(),\n\t\t\tnormType == cv::NORM_L1 ? \"L1-norm\" :\n\t\t\tnormType == cv::NORM_L2 ? \"L2-norm\" : \"UNKNOWN-norm\");\n\n\tstd::vector<cv::KeyPoint> imgKeypoints;\n\tcv::Mat imgDescriptors;\n\tcv::Mat scores;\n\n\tint max_ld = *std::max_element(db_landmarks.begin(), db_landmarks.end());\n\t\/\/ Compute the number of candidates\n\tint top = MIN (num_nbrs, db_filenames.size());\n\n\tFILE *f_match = fopen(matches_out, \"w\");\n\tif (f_match == NULL) {\n\t\tfprintf(stderr, \"Error opening file [%s] for writing\\n\",\n\t\t\t\tcandidates_out);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tFILE *f_candidates = fopen(candidates_out, \"w\");\n\tif (f_candidates == NULL) {\n\t\tfprintf(stderr, \"Error opening file [%s] for writing\\n\",\n\t\t\t\tcandidates_out);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tFILE *f_html = fopen(output_html, \"w\");\n\tHtmlResultsWriter::getInstance().writeHeader(f_html, top);\n\tif (f_html == NULL) {\n\t\tfprintf(stderr, \"Error opening file [%s] for writing\\n\",\n\t\t\t\tcandidates_out);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tfor (size_t i = 0; i < query_filenames.size(); i++) {\n\t\t\/\/ Initialize keypoints and descriptors\n\t\tstd::vector<cv::KeyPoint>().swap(imgKeypoints);\n\t\timgDescriptors = cv::Mat();\n\n\t\t\/\/ Load query keypoints and descriptors\n\t\tFileUtils::loadFeatures(query_filenames[i], imgKeypoints,\n\t\t\t\timgDescriptors);\n\n\t\t\/\/ Check type of descriptors\n\t\tif ((imgDescriptors.type() == CV_8U) != isDescriptorBinary) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Descriptor type doesn't coincide, it is said to be [%s] while it is [%s]\\n\",\n\t\t\t\t\tisDescriptorBinary == true ? \"binary\" : \"non-binary\",\n\t\t\t\t\timgDescriptors.type() == CV_8U ? \"binary\" : \"real\");\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\t\/\/ Score query bow vector against DB images bow vectors\n\t\tmytime = cv::getTickCount();\n\t\ttry {\n\t\t\ttree->scoreQuery(imgDescriptors, scores, cv::NORM_L1);\n\t\t} catch (const std::runtime_error& error) {\n\t\t\tfprintf(stderr, \"%s\\n\", error.what());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\tmytime = ((double) cv::getTickCount() - mytime) \/ cv::getTickFrequency()\n\t\t\t\t* 1000;\n\t\timgDescriptors.release();\n\n\t\t\/\/ Print to standard output the matching scores between\n\t\t\/\/ the query bow vector and the DB images bow vectors\n\t\tfor (size_t j = 0; (int) j < scores.cols; j++) {\n\/\/\t\t\tcv::Mat dbBowVector;\n\/\/\t\t\ttree->getDbBowVector(j, dbBowVector);\n\/\/\t\t\tstd::cout << j << \") DB BoW vector:\\n\" << dbBowVector << std::endl;\n\/\/\t\t\tprintf(\n\/\/\t\t\t\t\t\"   Match score between [%s] query image and [%lu] DB image: %f\\n\",\n\/\/\t\t\t\t\tquery_filenames[i].c_str(), j, scores.at<float>(0, j));\n\/\/\t\t\tgetchar();\n\t\t\tprintf(\n\t\t\t\t\t\"   Match score between [%lu] query image and [%lu] DB image: %f\\n\",\n\t\t\t\t\ti, j, scores.at<float>(0, j));\n\t\t}\n\n\t\t\/\/ Obtain indices of ordered scores\n\t\tcv::Mat perm;\n\t\t\/\/ Note: recall that the index of the images in the inverted file corresponds\n\t\t\/\/ to the zero-based line number in the file used to build the DB.\n\t\t\/\/ Hence scores matrix and db_landmarks and db_filenames vectors.\n\t\t\/\/ are equally ordered.\n\t\t\/\/ Also the images in list_db and list_db_ld must be equally ordered,\n\t\t\/\/ that implies same number of elements.\n\t\t\/\/\n\t\t\/\/ list_db      list_db_ld\n\t\t\/\/   img1  --->  img1 ld1\n\t\t\/\/   img2  --->  img2 ld1\n\t\t\/\/   img3  --->  img3 ld1\n\t\t\/\/   img4  --->  img4 ld2\n\t\t\/\/   img5  --->  img5 ld2\n\t\t\/\/   img6  --->  img6 ld2\n\t\tcv::sortIdx(scores, perm, cv::SORT_EVERY_ROW + cv::SORT_DESCENDING);\n\n\t\t\/\/ Initialize votes vector\n\t\t\/\/ Note: size is maximum landmark id plus one because landmark index is zero-based\n\t\tstd::vector<int> votes(max_ld + 1, 0);\n\n\t\t\/\/ Accumulating landmark votes for the top scored images\n\t\t\/\/ Note: recall that images might refer to the same landmark\n\t\tfor (size_t j = 0; (int) j < top; j++) {\n\t\t\tvotes[db_landmarks[perm.at<int>(0, j)]]++;\n\t\t}\n\n\t\t\/\/ Finding max voted landmark and the number of votes it got\n\t\tint max_votes = 0;\n\t\tint max_landmark = -1;\n\t\tfor (int j = 0; j < max_ld + 1; j++) {\n\t\t\tif (votes[j] > max_votes) {\n\t\t\t\tmax_votes = votes[j];\n\t\t\t\tmax_landmark = j;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Print to a file the ranked list of candidates ordered by score\n\t\tfprintf(f_candidates, \"%s\", query_filenames[i].c_str());\n\t\tfor (int j = 0; j < top; j++) {\n\t\t\tstd::string d_base = db_filenames[perm.at<int>(0, j)];\n\t\t\tfprintf(f_candidates, \" %s\", d_base.c_str());\n\t\t}\n\t\tfprintf(f_candidates, \"\\n\");\n\t\tfflush(f_candidates);\n\n\t\tstd::stringstream ranked_list_fname;\n\t\tprintf(\"%lu) %s\\n\", i, query_filenames[i].c_str());\n\t\tranked_list_fname << ranked_files_folder << \"\/query_\" << i\n\t\t\t\t<< \"_ranked.txt\";\n\n\t\tFILE *f_ranked_list = fopen(ranked_list_fname.str().c_str(), \"w\");\n\t\tif (f_ranked_list == NULL) {\n\t\t\tfprintf(stderr, \"Error opening file [%s] for writing\\n\",\n\t\t\t\t\tranked_list_fname.str().c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\tfor (int j = 0; j < top; j++) {\n\t\t\tstd::string d_base = db_filenames[perm.at<int>(0, j)];\n\t\t\tfprintf(f_ranked_list, \"%s\\n\",\n\t\t\t\t\td_base.substr(0, d_base.size() - 8).substr(3).c_str());\n\t\t}\n\t\tfclose(f_ranked_list);\n\n\t\t\/\/ Print to a file the max voted landmark information\n\t\tfprintf(f_match, \"%lu %d %d\\n\", i, max_landmark, max_votes);\n\t\tfflush(f_match);\n\t\tfflush(stdout);\n\n\t\t\/\/ Print to a file the ranked list of candidates ordered by score in HTML format\n\t\tHtmlResultsWriter::getInstance().writeRow(f_html, query_filenames[i],\n\t\t\t\tscores, perm, top, db_filenames);\n\t\tscores.release();\n\t\tperm.release();\n\t}\n\n\tfclose(f_candidates);\n\tfclose(f_match);\n\tHtmlResultsWriter::getInstance().writeFooter(f_html);\n\tfclose(f_html);\n\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>VocabMatch\/VocabMatch.cpp * Changed some variable names and fixed input to the output message on error of opening queries list file.<commit_after>\/*\n * VocabMatch.cpp\n *\n *  Created on: Oct 11, 2013\n *      Author: andresf\n *\/\n\n#include <fstream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string>\n#include <vector>\n#include <sys\/stat.h>\n\n#include <boost\/regex.hpp>\n\n#include <opencv2\/core\/core.hpp>\n\n#include <VocabTree.h>\n\n#include <FileUtils.hpp>\n\n#include <FunctionUtils.hpp>\n#include <HtmlResultsWriter.hpp>\n\ndouble mytime;\n\nint main(int argc, char **argv) {\n\n\tif (argc < 6 || argc > 10) {\n\t\tprintf(\n\t\t\t\t\"\\nUsage:\\n\"\n\t\t\t\t\t\t\"\\t%s <in.db> <in.db.gt.list> <in.query.list> <out.ranked.files.folder>\"\n\t\t\t\t\t\t\" <in.num.neighbors> [in.type.binary:1] [out.matches:matches.txt]\"\n\t\t\t\t\t\t\" [out.results:results.html] [out.candidates:candidates.txt]\\n\\n\",\n\t\t\t\targv[0]);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tchar *db_filepath = argv[1];\n\tchar *db_gt_list_filepath = argv[2];\n\tchar *query_list_filepath = argv[3];\n\tchar *ranked_files_folderpath = argv[4];\n\tuint num_nbrs = atoi(argv[5]);\n\tbool is_binary = true;\n\tchar *matches_out = const_cast<char*>(\"matches.txt\");\n\tconst char *output_html = const_cast<char*>(\"results.html\");\n\tconst char *candidates_out = const_cast<char*>(\"candidates.txt\");\n\n\tif (argc >= 7) {\n\t\tis_binary = atoi(argv[6]);\n\t}\n\n\tif (argc >= 8) {\n\t\tmatches_out = argv[7];\n\t}\n\n\tif (argc >= 9) {\n\t\toutput_html = argv[8];\n\t}\n\n\tif (argc >= 10) {\n\t\tcandidates_out = argv[9];\n\t}\n\n\t\/\/ Verifying input parameters\n\tboost::regex expression(\"^(.+)(\\\\.)(yaml|xml)(\\\\.)(gz)$\");\n\n\tif (boost::regex_match(std::string(db_filepath), expression) == false) {\n\t\tfprintf(stderr,\n\t\t\t\t\"Input tree file must have the extension .yaml.gz or .xml.gz\\n\");\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/ Step 1\/4: load tree\n\tcv::Ptr<cvflann::VocabTreeBase> tree;\n\n\tif (is_binary == true) {\n\t\ttree = new cvflann::VocabTree<uchar, cv::Hamming>();\n\t} else {\n\t\ttree = new cvflann::VocabTree<float, cvflann::L2<float> >();\n\t}\n\n\tprintf(\"-- Reading tree from [%s]\\n\", db_filepath);\n\n\tmytime = cv::getTickCount();\n\ttree->load(std::string(db_filepath));\n\tmytime = ((double) cv::getTickCount() - mytime) \/ cv::getTickFrequency()\n\t\t\t* 1000;\n\tprintf(\"   Tree loaded in [%lf] ms, got [%lu] words \\n\", mytime,\n\t\t\ttree->size());\n\n\t\/\/ Step 2\/4: read the database keyfiles\n\tprintf(\"-- Loading file of DB images ground truth\\n\");\n\tstd::vector<std::string> db_filenames;\n\tstd::vector<int> db_landmarks;\n\tstd::ifstream keys_list(db_gt_list_filepath, std::fstream::in);\n\n\tif (keys_list.is_open() == false) {\n\t\tfprintf(stderr, \"Error opening file [%s] for reading\\n\",\n\t\t\t\tdb_gt_list_filepath);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/ Loading db keypoint filename and landmark id into a set\n\tstd::string line;\n\twhile (getline(keys_list, line)) {\n\n\t\t\/\/ Verifying line format\n\t\tif (boost::regex_match(line, boost::regex(\"^(.+)\\\\s(.+)$\")) == false) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Line [%s] should be formatted as: <key.file> <landmark.id>\\n\",\n\t\t\t\t\tline.c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\t\/\/ Extracting filename and landmark from line\n\t\tchar filename[256];\n\t\tint landmark;\n\t\tsscanf(line.c_str(), \"%s %d\", filename, &landmark);\n\n\t\t\/\/ Checking that filename refers to a compressed yaml or xml file\n\t\tif (boost::regex_match(std::string(filename), expression) == false) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Keypoints file [%s] must have the extension .yaml.gz or .xml.gz\\n\",\n\t\t\t\t\tfilename);\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\t\/\/ Check that landmark id is valid\n\t\tif (landmark < 0) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Landmark id [%d] extracted from line [%s] should be greater than or equal to zero\\n\",\n\t\t\t\t\tlandmark, line.c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\tdb_filenames.push_back(std::string(filename));\n\t\tdb_landmarks.push_back(landmark);\n\t}\n\t\/\/ Close file\n\tkeys_list.close();\n\n\t\/\/ Step 3\/4: read the query keyfiles\n\tprintf(\"-- Loading query keyfiles names\\n\");\n\tstd::vector<std::string> query_filenames;\n\tkeys_list.open(query_list_filepath, std::fstream::in);\n\n\tif (keys_list.is_open() == false) {\n\t\tfprintf(stderr, \"Error opening file [%s] for reading\\n\",\n\t\t\t\tquery_list_filepath);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/ Loading file names in list into a vector\n\twhile (getline(keys_list, line)) {\n\n\t\t\/\/ Checking that file exists, if not print error and exit\n\t\tstruct stat buffer;\n\t\tif (stat(line.c_str(), &buffer) != 0) {\n\t\t\tfprintf(stderr, \"Keypoints file [%s] doesn't exist\\n\",\n\t\t\t\t\tline.c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\t\/\/ Checking that line refers to a compressed yaml or xml file\n\t\tif (boost::regex_match(line, expression) == false) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Keypoints file [%s] must have the extension .yaml.gz or .xml.gz\\n\",\n\t\t\t\t\tline.c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\tquery_filenames.push_back(line);\n\t}\n\t\/\/ Close file\n\tkeys_list.close();\n\n\t\/\/ Step 4\/4: score each query keyfile\n\tint normType = cv::NORM_L1;\n\n\tprintf(\"-- Scoring [%lu] query images against [%lu] DB images using [%s]\\n\",\n\t\t\tquery_filenames.size(), db_filenames.size(),\n\t\t\tnormType == cv::NORM_L1 ? \"L1-norm\" :\n\t\t\tnormType == cv::NORM_L2 ? \"L2-norm\" : \"UNKNOWN-norm\");\n\n\tstd::vector<cv::KeyPoint> imgKeypoints;\n\tcv::Mat imgDescriptors;\n\tcv::Mat scores;\n\n\tint max_ld = *std::max_element(db_landmarks.begin(), db_landmarks.end());\n\t\/\/ Compute the number of candidates\n\tint top = MIN (num_nbrs, db_filenames.size());\n\n\tFILE *f_match = fopen(matches_out, \"w\");\n\tif (f_match == NULL) {\n\t\tfprintf(stderr, \"Error opening file [%s] for writing\\n\",\n\t\t\t\tcandidates_out);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tFILE *f_candidates = fopen(candidates_out, \"w\");\n\tif (f_candidates == NULL) {\n\t\tfprintf(stderr, \"Error opening file [%s] for writing\\n\",\n\t\t\t\tcandidates_out);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tFILE *f_html = fopen(output_html, \"w\");\n\tHtmlResultsWriter::getInstance().writeHeader(f_html, top);\n\tif (f_html == NULL) {\n\t\tfprintf(stderr, \"Error opening file [%s] for writing\\n\",\n\t\t\t\tcandidates_out);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tfor (size_t i = 0; i < query_filenames.size(); i++) {\n\t\t\/\/ Initialize keypoints and descriptors\n\t\tstd::vector<cv::KeyPoint>().swap(imgKeypoints);\n\t\timgDescriptors = cv::Mat();\n\n\t\t\/\/ Load query keypoints and descriptors\n\t\tFileUtils::loadFeatures(query_filenames[i], imgKeypoints,\n\t\t\t\timgDescriptors);\n\n\t\t\/\/ Check type of descriptors\n\t\tif ((imgDescriptors.type() == CV_8U) != is_binary) {\n\t\t\tfprintf(stderr,\n\t\t\t\t\t\"Descriptor type doesn't coincide, it is said to be [%s] while it is [%s]\\n\",\n\t\t\t\t\tis_binary == true ? \"binary\" : \"non-binary\",\n\t\t\t\t\timgDescriptors.type() == CV_8U ? \"binary\" : \"real\");\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\n\t\t\/\/ Score query bow vector against DB images bow vectors\n\t\tmytime = cv::getTickCount();\n\t\ttry {\n\t\t\ttree->scoreQuery(imgDescriptors, scores, cv::NORM_L1);\n\t\t} catch (const std::runtime_error& error) {\n\t\t\tfprintf(stderr, \"%s\\n\", error.what());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\tmytime = ((double) cv::getTickCount() - mytime) \/ cv::getTickFrequency()\n\t\t\t\t* 1000;\n\t\timgDescriptors.release();\n\n\t\t\/\/ Print to standard output the matching scores between\n\t\t\/\/ the query bow vector and the DB images bow vectors\n\t\tfor (size_t j = 0; (int) j < scores.cols; j++) {\n\/\/\t\t\tcv::Mat dbBowVector;\n\/\/\t\t\ttree->getDbBowVector(j, dbBowVector);\n\/\/\t\t\tstd::cout << j << \") DB BoW vector:\\n\" << dbBowVector << std::endl;\n\/\/\t\t\tprintf(\n\/\/\t\t\t\t\t\"   Match score between [%s] query image and [%lu] DB image: %f\\n\",\n\/\/\t\t\t\t\tquery_filenames[i].c_str(), j, scores.at<float>(0, j));\n\/\/\t\t\tgetchar();\n\t\t\tprintf(\n\t\t\t\t\t\"   Match score between [%lu] query image and [%lu] DB image: %f\\n\",\n\t\t\t\t\ti, j, scores.at<float>(0, j));\n\t\t}\n\n\t\t\/\/ Obtain indices of ordered scores\n\t\tcv::Mat perm;\n\t\t\/\/ Note: recall that the index of the images in the inverted file corresponds\n\t\t\/\/ to the zero-based line number in the file used to build the DB.\n\t\t\/\/ Hence scores matrix and db_landmarks and db_filenames vectors.\n\t\t\/\/ are equally ordered.\n\t\t\/\/ Also the images in list_db and list_db_ld must be equally ordered,\n\t\t\/\/ that implies same number of elements.\n\t\t\/\/\n\t\t\/\/ list_db      list_db_ld\n\t\t\/\/   img1  --->  img1 ld1\n\t\t\/\/   img2  --->  img2 ld1\n\t\t\/\/   img3  --->  img3 ld1\n\t\t\/\/   img4  --->  img4 ld2\n\t\t\/\/   img5  --->  img5 ld2\n\t\t\/\/   img6  --->  img6 ld2\n\t\tcv::sortIdx(scores, perm, cv::SORT_EVERY_ROW + cv::SORT_DESCENDING);\n\n\t\t\/\/ Initialize votes vector\n\t\t\/\/ Note: size is maximum landmark id plus one because landmark index is zero-based\n\t\tstd::vector<int> votes(max_ld + 1, 0);\n\n\t\t\/\/ Accumulating landmark votes for the top scored images\n\t\t\/\/ Note: recall that images might refer to the same landmark\n\t\tfor (size_t j = 0; (int) j < top; j++) {\n\t\t\tvotes[db_landmarks[perm.at<int>(0, j)]]++;\n\t\t}\n\n\t\t\/\/ Finding max voted landmark and the number of votes it got\n\t\tint max_votes = 0;\n\t\tint max_landmark = -1;\n\t\tfor (int j = 0; j < max_ld + 1; j++) {\n\t\t\tif (votes[j] > max_votes) {\n\t\t\t\tmax_votes = votes[j];\n\t\t\t\tmax_landmark = j;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Print to a file the ranked list of candidates ordered by score\n\t\tfprintf(f_candidates, \"%s\", query_filenames[i].c_str());\n\t\tfor (int j = 0; j < top; j++) {\n\t\t\tstd::string d_base = db_filenames[perm.at<int>(0, j)];\n\t\t\tfprintf(f_candidates, \" %s\", d_base.c_str());\n\t\t}\n\t\tfprintf(f_candidates, \"\\n\");\n\t\tfflush(f_candidates);\n\n\t\tstd::stringstream ranked_list_fname;\n\t\tprintf(\"%lu) %s\\n\", i, query_filenames[i].c_str());\n\t\tranked_list_fname << ranked_files_folderpath << \"\/query_\" << i\n\t\t\t\t<< \"_ranked.txt\";\n\n\t\tFILE *f_ranked_list = fopen(ranked_list_fname.str().c_str(), \"w\");\n\t\tif (f_ranked_list == NULL) {\n\t\t\tfprintf(stderr, \"Error opening file [%s] for writing\\n\",\n\t\t\t\t\tranked_list_fname.str().c_str());\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\tfor (int j = 0; j < top; j++) {\n\t\t\tstd::string d_base = db_filenames[perm.at<int>(0, j)];\n\t\t\tfprintf(f_ranked_list, \"%s\\n\",\n\t\t\t\t\td_base.substr(0, d_base.size() - 8).substr(3).c_str());\n\t\t}\n\t\tfclose(f_ranked_list);\n\n\t\t\/\/ Print to a file the max voted landmark information\n\t\tfprintf(f_match, \"%lu %d %d\\n\", i, max_landmark, max_votes);\n\t\tfflush(f_match);\n\t\tfflush(stdout);\n\n\t\t\/\/ Print to a file the ranked list of candidates ordered by score in HTML format\n\t\tHtmlResultsWriter::getInstance().writeRow(f_html, query_filenames[i],\n\t\t\t\tscores, perm, top, db_filenames);\n\t\tscores.release();\n\t\tperm.release();\n\t}\n\n\tfclose(f_candidates);\n\tfclose(f_match);\n\tHtmlResultsWriter::getInstance().writeFooter(f_html);\n\tfclose(f_html);\n\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nctrlobj.cpp\n\n  ,     \n\n*\/\n\n\/* Revision: 1.29 23.06.2001 $ *\/\n\n\/*\nModify:\n  23.06.2001 OT\n    - far -r\n  30.05.2001 OT\n    !      \n  16.05.2001 DJ\n    ! proof-of-concept\n  15.05.2001 OT\n    ! NWZ -> NFZ\n  12.05.2001 DJ\n    ! FrameManager   CtrlObject\n    !    CtrlObject  \n  11.05.2001 OT\n    !  Background\n  07.05.2001 SVS\n    ! SysLog(); -> _D(SysLog());\n  06.05.2001 DJ\n    !  #include\n  06.05.2001 \n    !  Window  Frame :)\n  05.05.2001 DJ\n    +  NWZ\n  29.04.2001 \n    +  NWZ  \n  28.04.2001 VVM\n    + KeyBar    .\n  22.04.2001 SVS\n    !   -     \n  02.04.2001 VVM\n    +  Opt.FlagPosixSemantics\n  28.02.2001 IS\n    ! .. CmdLine  ,   \n      \"CmdLine.\"  \"CmdLine->\"   \/   \n        CtrlObject.\n  09.02.2001 IS\n    +    \" \"\n  09.01.2001 SVS\n    +   Opt.ShiftsKeyRules (WaitInFastFind)\n  29.12.2000 IS\n    +   ,     .  , \n         .\n  15.12.2000 SVS\n    !  ShowCopyright - public static &  Flags.\n       Flags&1,   printf   \n  25.11.2000 SVS\n    ! Copyright  2 \n  27.09.2000 SVS\n    ! Ctrl-Alt-Shift - ,  .\n  19.09.2000 IS\n    !    ctrl-l|q|t    \n  19.09.2000 SVS\n    + Opt.PanelCtrlAltShiftRule   Ctrl-Alt-Shift  .\n  19.09.2000 SVS\n    +        CtrlAltShift\n  07.09.2000 tran 1.05\n    + Current File\n  15.07.2000 tran\n    +     :)    Redraw\n  13.07.2000 SVS\n    !      ;-)\n  11.07.2000 SVS\n    !      BC & VC\n  29.06.2000 tran\n    !      copyright.inc\n  25.06.2000 SVS\n    !  Master Copy\n    !     \n*\/\n\n#include \"headers.hpp\"\n#pragma hdrstop\n\n#include \"ctrlobj.hpp\"\n#include \"global.hpp\"\n#include \"fn.hpp\"\n#include \"lang.hpp\"\n#include \"manager.hpp\"\n#include \"cmdline.hpp\"\n#include \"hilight.hpp\"\n#include \"grpsort.hpp\"\n#include \"poscache.hpp\"\n#include \"history.hpp\"\n#include \"treelist.hpp\"\n#include \"filter.hpp\"\n#include \"filepanels.hpp\"\n\nControlObject *CtrlObject;\n\nControlObject::ControlObject()\n{\n  _OT(SysLog(\"[%p] ControlObject::ControlObject()\", this));\n  FPanels=0;\n  CtrlObject=this;\n  \/* $ 06.05.2001 DJ\n       (  dependencies)\n  *\/\n  HiFiles = new HighlightFiles;\n  GrpSort = new GroupSort;\n  ViewerPosCache = new FilePositionCache;\n  EditorPosCache = new FilePositionCache;\n  FrameManager = new Manager;\n  \/* DJ $ *\/\n  ReadConfig();\n  \/* $ 28.02.2001 IS\n           ,   \n  *\/\n  CmdLine=new CommandLine;\n  \/* IS $ *\/\n  CmdHistory=new History(\"SavedHistory\",&Opt.SaveHistory,FALSE,FALSE);\n  FolderHistory=new History(\"SavedFolderHistory\",&Opt.SaveFoldersHistory,FALSE,TRUE);\n  ViewHistory=new History(\"SavedViewHistory\",&Opt.SaveViewHistory,TRUE,TRUE);\n  FolderHistory->SetAddMode(TRUE,2,TRUE);\n  ViewHistory->SetAddMode(TRUE,Opt.FlagPosixSemantics?1:2,TRUE);\n  if (Opt.SaveHistory)\n    CmdHistory->ReadHistory();\n  if (Opt.SaveFoldersHistory)\n    FolderHistory->ReadHistory();\n  if (Opt.SaveViewHistory)\n    ViewHistory->ReadHistory();\n  RegVer=-1;\n}\n\n\nvoid ControlObject::Init()\n{\n  TreeList::ClearCache(0);\n  PanelFilter::InitFilter();\n\n  SetColor(F_LIGHTGRAY|B_BLACK);\n  GotoXY(0,ScrY-3);\n  while (RegVer==-1)\n    Sleep(0);\n  ShowCopyright();\n  GotoXY(0,ScrY-2);\n\n  char TruncRegName[512];\n  strcpy(TruncRegName,RegName);\n  char *CountPtr=strstr(TruncRegName,\" - (\");\n  if (CountPtr!=NULL && isdigit(CountPtr[4]) && strchr(CountPtr+5,'\/')!=NULL &&\n      strchr(CountPtr+6,')')!=NULL)\n    *CountPtr=0;\n  if (RegVer)\n    mprintf(\"%s: %s\",MSG(MRegistered),TruncRegName);\n  else\n    Text(MShareware);\n\n  CmdLine->SaveBackground(0,0,ScrX,ScrY);\n\n  FPanels=new FilePanels();\n  FPanels->Init();\n  this->MainKeyBar=&(FPanels->MainKeyBar);\n  this->TopMenuBar=&(FPanels->TopMenuBar);\n  FPanels->SetScreenPosition();\n\n  _beginthread(CheckVersion,0x10000,NULL);\n  Cp()->LeftPanel->Update(0);\n  Cp()->RightPanel->Update(0);\n\n  \/* $ 07.09.2000 tran\n    + Config\/\/Current File *\/\n  if (Opt.AutoSaveSetup)\n  {\n      Cp()->LeftPanel->GoToFile(Opt.LeftCurFile);\n      Cp()->RightPanel->GoToFile(Opt.RightCurFile);\n  }\n  \/* tran 07.09.2000 $ *\/\n  FrameManager->InsertFrame(FPanels);\n  Plugins.LoadPlugins();\n}\n\nvoid ControlObject::CreateFilePanels()\n{\n  FPanels=new FilePanels();\n}\n\nControlObject::~ControlObject()\n{\n  _OT(SysLog(\"[%p] ControlObject::~ControlObject()\", this));\n  if (Cp()&&Cp()->ActivePanel!=NULL)\n  {\n    if (Opt.AutoSaveSetup)\n      SaveConfig(0);\n    if (Cp()->ActivePanel->GetMode()!=PLUGIN_PANEL)\n    {\n      char CurDir[NM];\n      Cp()->ActivePanel->GetCurDir(CurDir);\n      FolderHistory->AddToHistory(CurDir,NULL,0);\n    }\n  }\n  if (Opt.SaveEditorPos)\n    EditorPosCache->Save(\"Editor\\\\LastPositions\");\n  if (Opt.SaveViewerPos)\n    ViewerPosCache->Save(\"Viewer\\\\LastPositions\");\n\n  FrameManager->CloseAll();\n  FPanels=NULL;\n\n  Plugins.SendExit();\n  PanelFilter::CloseFilter();\n  delete CmdHistory;\n  delete FolderHistory;\n  delete ViewHistory;\n  delete CmdLine;\n  \/* $ 06.05.2001 DJ\n      ,   \n  *\/\n  delete HiFiles;\n  delete GrpSort;\n  delete ViewerPosCache;\n  delete EditorPosCache;\n  delete FrameManager;\n  \/* DJ $ *\/\n  Lang.Close();\n  CtrlObject=NULL;\n}\n\n\n\/* $ 25.11.2000 SVS\n   Copyright  2 \n*\/\n\/* $ 15.12.2000 SVS\n  ShowCopyright - public static &  Flags.\n*\/\nvoid ControlObject::ShowCopyright(DWORD Flags)\n{\n\/* $ 29.06.2000 tran\n   char *CopyRight  inc  *\/\n#include \"copyright.inc\"\n\/* tran $ *\/\n  char Str[256];\n  char *Line2=NULL;\n  strcpy(Str,Copyright);\n  char Xor=17;\n  for (int I=0;Str[I];I++)\n  {\n    Str[I]=(Str[I]&0x7f)^Xor;\n    Xor^=Str[I];\n    if(Str[I] == '\\n')\n    {\n      Line2=&Str[I+1];\n      Str[I]='\\0';\n    }\n  }\n  if(Flags&1)\n  {\n    fprintf(stderr,\"%s\\n%s\\n\",Str,Line2);\n  }\n  else\n  {\n#ifdef BETA\n    mprintf(\"Beta version %d.%02d.%d\",BETA\/1000,(BETA%1000)\/10,BETA%10);\n#else\n    if(Line2)\n    {\n      GotoXY(0,ScrY-4);\n      Text(Str);\n      GotoXY(0,ScrY-3);\n      Text(Line2);\n    }\n    else\n      Text(Str);\n#endif\n  }\n}\n\/* SVS $ *\/\n\/* SVS $ *\/\n\n\nFilePanels* ControlObject::Cp()\n{\n  return FPanels;\n}\n<commit_msg>FAR patch 00804.ctrlobj.cpp Дата              : 06.07.2001 Сделал            : Oleg Taranenko Описание          : баг с зацикливанием при выдаче сообщения о                     неправильной загрузки плагина Измененные файлы  : ctrlobj.cpp Новые файлы       : Удаленные файлы   : Состав            : 00804.ctrlobj.cpp.txt                     ctrlobj.cpp.804.diff Основан на патче  : 803 Дополнение        :<commit_after>\/*\nctrlobj.cpp\n\n  ,     \n\n*\/\n\n\/* Revision: 1.30 06.07.2001 $ *\/\n\n\/*\nModify:\n  06.07.2001 OT\n    -           \n  23.06.2001 OT\n    - far -r\n  30.05.2001 OT\n    !      \n  16.05.2001 DJ\n    ! proof-of-concept\n  15.05.2001 OT\n    ! NWZ -> NFZ\n  12.05.2001 DJ\n    ! FrameManager   CtrlObject\n    !    CtrlObject  \n  11.05.2001 OT\n    !  Background\n  07.05.2001 SVS\n    ! SysLog(); -> _D(SysLog());\n  06.05.2001 DJ\n    !  #include\n  06.05.2001 \n    !  Window  Frame :)\n  05.05.2001 DJ\n    +  NWZ\n  29.04.2001 \n    +  NWZ  \n  28.04.2001 VVM\n    + KeyBar    .\n  22.04.2001 SVS\n    !   -     \n  02.04.2001 VVM\n    +  Opt.FlagPosixSemantics\n  28.02.2001 IS\n    ! .. CmdLine  ,   \n      \"CmdLine.\"  \"CmdLine->\"   \/   \n        CtrlObject.\n  09.02.2001 IS\n    +    \" \"\n  09.01.2001 SVS\n    +   Opt.ShiftsKeyRules (WaitInFastFind)\n  29.12.2000 IS\n    +   ,     .  , \n         .\n  15.12.2000 SVS\n    !  ShowCopyright - public static &  Flags.\n       Flags&1,   printf   \n  25.11.2000 SVS\n    ! Copyright  2 \n  27.09.2000 SVS\n    ! Ctrl-Alt-Shift - ,  .\n  19.09.2000 IS\n    !    ctrl-l|q|t    \n  19.09.2000 SVS\n    + Opt.PanelCtrlAltShiftRule   Ctrl-Alt-Shift  .\n  19.09.2000 SVS\n    +        CtrlAltShift\n  07.09.2000 tran 1.05\n    + Current File\n  15.07.2000 tran\n    +     :)    Redraw\n  13.07.2000 SVS\n    !      ;-)\n  11.07.2000 SVS\n    !      BC & VC\n  29.06.2000 tran\n    !      copyright.inc\n  25.06.2000 SVS\n    !  Master Copy\n    !     \n*\/\n\n#include \"headers.hpp\"\n#pragma hdrstop\n\n#include \"ctrlobj.hpp\"\n#include \"global.hpp\"\n#include \"fn.hpp\"\n#include \"lang.hpp\"\n#include \"manager.hpp\"\n#include \"cmdline.hpp\"\n#include \"hilight.hpp\"\n#include \"grpsort.hpp\"\n#include \"poscache.hpp\"\n#include \"history.hpp\"\n#include \"treelist.hpp\"\n#include \"filter.hpp\"\n#include \"filepanels.hpp\"\n\nControlObject *CtrlObject;\n\nControlObject::ControlObject()\n{\n  _OT(SysLog(\"[%p] ControlObject::ControlObject()\", this));\n  FPanels=0;\n  CtrlObject=this;\n  \/* $ 06.05.2001 DJ\n       (  dependencies)\n  *\/\n  HiFiles = new HighlightFiles;\n  GrpSort = new GroupSort;\n  ViewerPosCache = new FilePositionCache;\n  EditorPosCache = new FilePositionCache;\n  FrameManager = new Manager;\n  \/* DJ $ *\/\n  ReadConfig();\n  \/* $ 28.02.2001 IS\n           ,   \n  *\/\n  CmdLine=new CommandLine;\n  \/* IS $ *\/\n  CmdHistory=new History(\"SavedHistory\",&Opt.SaveHistory,FALSE,FALSE);\n  FolderHistory=new History(\"SavedFolderHistory\",&Opt.SaveFoldersHistory,FALSE,TRUE);\n  ViewHistory=new History(\"SavedViewHistory\",&Opt.SaveViewHistory,TRUE,TRUE);\n  FolderHistory->SetAddMode(TRUE,2,TRUE);\n  ViewHistory->SetAddMode(TRUE,Opt.FlagPosixSemantics?1:2,TRUE);\n  if (Opt.SaveHistory)\n    CmdHistory->ReadHistory();\n  if (Opt.SaveFoldersHistory)\n    FolderHistory->ReadHistory();\n  if (Opt.SaveViewHistory)\n    ViewHistory->ReadHistory();\n  RegVer=-1;\n}\n\n\nvoid ControlObject::Init()\n{\n  TreeList::ClearCache(0);\n  PanelFilter::InitFilter();\n\n  SetColor(F_LIGHTGRAY|B_BLACK);\n  GotoXY(0,ScrY-3);\n  while (RegVer==-1)\n    Sleep(0);\n  ShowCopyright();\n  GotoXY(0,ScrY-2);\n\n  char TruncRegName[512];\n  strcpy(TruncRegName,RegName);\n  char *CountPtr=strstr(TruncRegName,\" - (\");\n  if (CountPtr!=NULL && isdigit(CountPtr[4]) && strchr(CountPtr+5,'\/')!=NULL &&\n      strchr(CountPtr+6,')')!=NULL)\n    *CountPtr=0;\n  if (RegVer)\n    mprintf(\"%s: %s\",MSG(MRegistered),TruncRegName);\n  else\n    Text(MShareware);\n\n  CmdLine->SaveBackground(0,0,ScrX,ScrY);\n\n  FPanels=new FilePanels();\n  FPanels->Init();\n  this->MainKeyBar=&(FPanels->MainKeyBar);\n  this->TopMenuBar=&(FPanels->TopMenuBar);\n  FPanels->SetScreenPosition();\n\n  _beginthread(CheckVersion,0x10000,NULL);\n  Cp()->LeftPanel->Update(0);\n  Cp()->RightPanel->Update(0);\n\n  \/* $ 07.09.2000 tran\n    + Config\/\/Current File *\/\n  if (Opt.AutoSaveSetup)\n  {\n      Cp()->LeftPanel->GoToFile(Opt.LeftCurFile);\n      Cp()->RightPanel->GoToFile(Opt.RightCurFile);\n  }\n  \/* tran 07.09.2000 $ *\/\n  Plugins.LoadPlugins();\n  FrameManager->InsertFrame(FPanels);\n}\n\nvoid ControlObject::CreateFilePanels()\n{\n  FPanels=new FilePanels();\n}\n\nControlObject::~ControlObject()\n{\n  _OT(SysLog(\"[%p] ControlObject::~ControlObject()\", this));\n  if (Cp()&&Cp()->ActivePanel!=NULL)\n  {\n    if (Opt.AutoSaveSetup)\n      SaveConfig(0);\n    if (Cp()->ActivePanel->GetMode()!=PLUGIN_PANEL)\n    {\n      char CurDir[NM];\n      Cp()->ActivePanel->GetCurDir(CurDir);\n      FolderHistory->AddToHistory(CurDir,NULL,0);\n    }\n  }\n  if (Opt.SaveEditorPos)\n    EditorPosCache->Save(\"Editor\\\\LastPositions\");\n  if (Opt.SaveViewerPos)\n    ViewerPosCache->Save(\"Viewer\\\\LastPositions\");\n\n  FrameManager->CloseAll();\n  FPanels=NULL;\n\n  Plugins.SendExit();\n  PanelFilter::CloseFilter();\n  delete CmdHistory;\n  delete FolderHistory;\n  delete ViewHistory;\n  delete CmdLine;\n  \/* $ 06.05.2001 DJ\n      ,   \n  *\/\n  delete HiFiles;\n  delete GrpSort;\n  delete ViewerPosCache;\n  delete EditorPosCache;\n  delete FrameManager;\n  \/* DJ $ *\/\n  Lang.Close();\n  CtrlObject=NULL;\n}\n\n\n\/* $ 25.11.2000 SVS\n   Copyright  2 \n*\/\n\/* $ 15.12.2000 SVS\n  ShowCopyright - public static &  Flags.\n*\/\nvoid ControlObject::ShowCopyright(DWORD Flags)\n{\n\/* $ 29.06.2000 tran\n   char *CopyRight  inc  *\/\n#include \"copyright.inc\"\n\/* tran $ *\/\n  char Str[256];\n  char *Line2=NULL;\n  strcpy(Str,Copyright);\n  char Xor=17;\n  for (int I=0;Str[I];I++)\n  {\n    Str[I]=(Str[I]&0x7f)^Xor;\n    Xor^=Str[I];\n    if(Str[I] == '\\n')\n    {\n      Line2=&Str[I+1];\n      Str[I]='\\0';\n    }\n  }\n  if(Flags&1)\n  {\n    fprintf(stderr,\"%s\\n%s\\n\",Str,Line2);\n  }\n  else\n  {\n#ifdef BETA\n    mprintf(\"Beta version %d.%02d.%d\",BETA\/1000,(BETA%1000)\/10,BETA%10);\n#else\n    if(Line2)\n    {\n      GotoXY(0,ScrY-4);\n      Text(Str);\n      GotoXY(0,ScrY-3);\n      Text(Line2);\n    }\n    else\n      Text(Str);\n#endif\n  }\n}\n\/* SVS $ *\/\n\/* SVS $ *\/\n\n\nFilePanels* ControlObject::Cp()\n{\n  return FPanels;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 2007, 2008 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 <QtCore\/QCoreApplication>\n#include <QtCore\/QDebug>\n#include <QtCore\/QFile>\n#include <QtCore\/QStringList>\n\n#include \"GeoDataFolder.h\"\n\n#include \"GeoDataParser.h\"\n#include \"GeoDataDocument.h\"\n\n#include \"GeoSceneDocument.h\"\n#include \"GeoSceneHead.h\"\n#include \"GeoSceneIcon.h\"\n#include \"GeoSceneParser.h\"\n#include \"GeoSceneProperty.h\"\n#include \"GeoSceneSettings.h\"\n#include \"GeoSceneZoom.h\"\n\n#ifdef Q_OS_WIN\n#include <stdio.h>\n#include <stdlib.h>\n\nvoid myMessageOutput(QtMsgType type, const char *msg)\n{\n    switch (type) {\n        case QtDebugMsg:\n            fprintf(stdout, \"Debug: %s\\n\", msg);\n            break;\n        case QtWarningMsg:\n            fprintf(stdout, \"Warning: %s\\n\", msg);\n            break;\n        case QtCriticalMsg:\n            fprintf(stdout, \"Critical: %s\\n\", msg);\n            break;\n        case QtFatalMsg:\n            fprintf(stdout, \"Fatal: %s\\n\", msg);\n            abort();\n    }\n}\n#endif\n\nusing namespace Marble;\n\nvoid dumpGeoDataDocument(GeoDataDocument*);\nvoid dumpGeoSceneDocument(GeoSceneDocument*);\n\nint main(int argc, char** argv)\n{\n#ifdef Q_OS_WIN\n    qInstallMsgHandler(myMessageOutput);\n#endif\n    QCoreApplication app(argc, argv);\n\n    \/\/ Expect document as first command line argument\n    if (app.arguments().size() <= 1) {\n        qWarning(\"Pass file name as first argument!\");\n        return -1;\n    }\n\n    \/\/ Check whether file exists\n    QFile file(app.arguments().at(1));\n    if (!file.exists()) {\n        qWarning(\"File does not exist!\");\n        return -1;\n    }\n\n    \/\/ Open file in right mode\n    file.open(QIODevice::ReadOnly);\n\n    GeoParser* parser = 0;\n    const QString& fileName = file.fileName().toLower();\n\n    \/\/ A real application, would use other heuristics to determine the source type!\n    if (fileName.endsWith(\".dgml\"))\n        parser = new GeoSceneParser(GeoScene_DGML);\n    else if (fileName.endsWith(\".kml\"))\n        parser = new GeoDataParser(GeoData_KML);\n    else if (fileName.endsWith(\".gpx\"))\n        parser = new GeoDataParser(GeoData_GPX);\n\n    if (!parser) {\n        qWarning(\"Could not determine file format!\");\n        return -1;\n    }\n\n    if (!parser->read(&file)) {\n        qWarning(\"Could not parse file!\");\n        return -1;\n    }\n\n    \/\/ Get result document\n    GeoDocument* document = parser->releaseDocument();\n    Q_ASSERT(document);\n\n    if (document->isGeoDataDocument()) {\n        GeoDataDocument *dataDocument = static_cast<GeoDataDocument*>(document);\n        QVector<GeoDataFeature*>::const_iterator it = dataDocument->features().constBegin();\n        QVector<GeoDataFeature*>::const_iterator end = dataDocument->features().constEnd();\n        qDebug() << \"---------------------------------------------------------\";\n        for (; it != end; ++it) {\n            GeoDataFeature* feature = *it;\n            qDebug() << \"Name: \" << feature->name();\n        }\n        dumpGeoDataDocument(static_cast<GeoDataDocument*>(document));\n    } else if (document->isGeoSceneDocument()) {\n        GeoSceneDocument *sceneDocument = static_cast<GeoSceneDocument*>(document);\n        qDebug() << \"Name: \" << sceneDocument->head()->name(); \n        qDebug() << \"Target: \" << sceneDocument->head()->target(); \n        qDebug() << \"Theme: \" << sceneDocument->head()->theme(); \n        qDebug() << \"Icon (pixmap): \" << sceneDocument->head()->icon()->pixmap(); \n        qDebug() << \"Icon (color) : \" << sceneDocument->head()->icon()->color(); \n        qDebug() << \"Description: \" << sceneDocument->head()->description(); \n        qDebug() << \"Visible: \" << sceneDocument->head()->visible(); \n        qDebug() << \"Discrete: \" << sceneDocument->head()->zoom()->discrete(); \n        qDebug() << \"Minimum: \" << sceneDocument->head()->zoom()->minimum(); \n        qDebug() << \"Maximum: \" << sceneDocument->head()->zoom()->maximum(); \n        qDebug() << \"Name: \" << sceneDocument->settings()->property( \"cities\" )->name(); \n        qDebug() << \"Available: \" << sceneDocument->settings()->property( \"cities\" )->available(); \n        qDebug() << \"Value: \" << sceneDocument->settings()->property( \"cities\" )->value(); \n        qDebug() << \"Name: \" << sceneDocument->settings()->property( \"relief\" )->name(); \n        qDebug() << \"Available: \" << sceneDocument->settings()->property( \"relief\" )->available(); \n        qDebug() << \"Value: \" << sceneDocument->settings()->property( \"relief\" )->value(); \n        qDebug() << \"Test query a nonexistent property: \" << sceneDocument->settings()->property( \"nonexistent\" )->name();\n        dumpGeoSceneDocument(static_cast<GeoSceneDocument*>(document));\n    }\n    else {\n        \/\/ A parsed document should either be a GeoDataDocument or a GeoSceneDocument!\n        Q_ASSERT(false);\n    }\n\n    qDebug() << \"\\nSuccesfully parsed file!\";\n    delete document;\n\n    return 0;\n}\n\nQString formatOutput(int depth)\n{\n    QString result;\n    for (int i = 0; i < depth; ++i)\n        result += \"  \";\n\n    return result;\n}\n\nvoid dumpFoldersRecursively(const GeoDataContainer* container, int depth)\n{\n    QVector<GeoDataFolder*> folders = container->folders();\n    QString format = formatOutput(depth);\n\n    fprintf(stderr, \"%s\", qPrintable(format + QString(\"Dumping container with %1 child folders!\\n\").arg(folders.size())));\n\n    QVector<GeoDataFolder*>::const_iterator it = folders.constBegin();\n    const QVector<GeoDataFolder*>::const_iterator end = folders.constEnd();\n\n    for (; it != end; ++it) {\n        fprintf(stderr, \"%s\", qPrintable(format + QString(\"Dumping child %1\\n\").arg(it - folders.constBegin() + 1)));\n        dumpFoldersRecursively(*it, ++depth);\n    }\n}\n\nvoid dumpGeoDataDocument(GeoDataDocument* document)\n{\n    dumpFoldersRecursively(document, 0);\n    \/\/ TODO: Dump all features!\n} \n\nvoid dumpGeoSceneDocument(GeoSceneDocument* document)\n{\n    \/\/ TODO: Maybe dump parsed datastructures here!\n}\n<commit_msg>adjust geodatatest to new geodatascene class<commit_after>\/*\n    Copyright (C) 2007, 2008 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 <QtCore\/QCoreApplication>\n#include <QtCore\/QDebug>\n#include <QtCore\/QFile>\n#include <QtCore\/QStringList>\n\n#include \"GeoDataFolder.h\"\n\n#include \"GeoDataParser.h\"\n#include \"GeoDataDocument.h\"\n\n#include \"GeoSceneDocument.h\"\n#include \"GeoSceneHead.h\"\n#include \"GeoSceneIcon.h\"\n#include \"GeoSceneLayer.h\"\n#include \"GeoSceneMap.h\"\n#include \"GeoSceneParser.h\"\n#include \"GeoSceneProperty.h\"\n#include \"GeoSceneSettings.h\"\n#include \"GeoSceneZoom.h\"\n\n#ifdef Q_OS_WIN\n#include <stdio.h>\n#include <stdlib.h>\n\nvoid myMessageOutput(QtMsgType type, const char *msg)\n{\n    switch (type) {\n        case QtDebugMsg:\n            fprintf(stdout, \"Debug: %s\\n\", msg);\n            break;\n        case QtWarningMsg:\n            fprintf(stdout, \"Warning: %s\\n\", msg);\n            break;\n        case QtCriticalMsg:\n            fprintf(stdout, \"Critical: %s\\n\", msg);\n            break;\n        case QtFatalMsg:\n            fprintf(stdout, \"Fatal: %s\\n\", msg);\n            abort();\n    }\n}\n#endif\n\nusing namespace Marble;\n\nvoid dumpGeoDataDocument(GeoDataDocument*);\nvoid dumpGeoSceneDocument(GeoSceneDocument*);\n\nint main(int argc, char** argv)\n{\n#ifdef Q_OS_WIN\n    qInstallMsgHandler(myMessageOutput);\n#endif\n    QCoreApplication app(argc, argv);\n\n    \/\/ Expect document as first command line argument\n    if (app.arguments().size() <= 1) {\n        qWarning(\"Pass file name as first argument!\");\n        return -1;\n    }\n\n    \/\/ Check whether file exists\n    QFile file(app.arguments().at(1));\n    if (!file.exists()) {\n        qWarning(\"File does not exist!\");\n        return -1;\n    }\n\n    \/\/ Open file in right mode\n    file.open(QIODevice::ReadOnly);\n\n    GeoParser* parser = 0;\n    const QString& fileName = file.fileName().toLower();\n\n    \/\/ A real application, would use other heuristics to determine the source type!\n    if (fileName.endsWith(\".dgml\"))\n        parser = new GeoSceneParser(GeoScene_DGML);\n    else if (fileName.endsWith(\".kml\"))\n        parser = new GeoDataParser(GeoData_KML);\n    else if (fileName.endsWith(\".gpx\"))\n        parser = new GeoDataParser(GeoData_GPX);\n\n    if (!parser) {\n        qWarning(\"Could not determine file format!\");\n        return -1;\n    }\n\n    if (!parser->read(&file)) {\n        qWarning(\"Could not parse file!\");\n        return -1;\n    }\n\n    \/\/ Get result document\n    GeoDocument* document = parser->releaseDocument();\n    Q_ASSERT(document);\n\n    if (document->isGeoDataDocument()) {\n        GeoDataDocument *dataDocument = static_cast<GeoDataDocument*>(document);\n        QVector<GeoDataFeature*>::const_iterator it = dataDocument->features().constBegin();\n        QVector<GeoDataFeature*>::const_iterator end = dataDocument->features().constEnd();\n        qDebug() << \"---------------------------------------------------------\";\n        for (; it != end; ++it) {\n            GeoDataFeature* feature = *it;\n            qDebug() << \"Name: \" << feature->name();\n        }\n        dumpGeoDataDocument(static_cast<GeoDataDocument*>(document));\n    } else if (document->isGeoSceneDocument()) {\n        GeoSceneDocument *sceneDocument = static_cast<GeoSceneDocument*>(document);\n        qDebug() << \"Name: \" << sceneDocument->head()->name(); \n        qDebug() << \"Target: \" << sceneDocument->head()->target(); \n        qDebug() << \"Theme: \" << sceneDocument->head()->theme(); \n        qDebug() << \"Icon (pixmap): \" << sceneDocument->head()->icon()->pixmap(); \n        qDebug() << \"Icon (color) : \" << sceneDocument->head()->icon()->color(); \n        qDebug() << \"Description: \" << sceneDocument->head()->description(); \n        qDebug() << \"Visible: \" << sceneDocument->head()->visible(); \n        qDebug() << \"Discrete: \" << sceneDocument->head()->zoom()->discrete(); \n        qDebug() << \"Minimum: \" << sceneDocument->head()->zoom()->minimum(); \n        qDebug() << \"Maximum: \" << sceneDocument->head()->zoom()->maximum(); \n        if(sceneDocument->settings() && \n           sceneDocument->settings()->property( \"cities\" ) && \n           sceneDocument->settings()->property( \"relief\" )) {\n            qDebug() << \"CitiesName: \" << sceneDocument->settings()->property( \"cities\" )->name(); \n            qDebug() << \"Available: \" << sceneDocument->settings()->property( \"cities\" )->available(); \n            qDebug() << \"Value: \" << sceneDocument->settings()->property( \"cities\" )->value(); \n            qDebug() << \"ReliefName: \" << sceneDocument->settings()->property( \"relief\" )->name(); \n            qDebug() << \"Available: \" << sceneDocument->settings()->property( \"relief\" )->available(); \n            qDebug() << \"Value: \" << sceneDocument->settings()->property( \"relief\" )->value(); \n            qDebug() << \"Test query a nonexistent property: \" << sceneDocument->settings()->property( \"nonexistent\" )->name();\n        }\n        if(sceneDocument->map()) {\n            qDebug() << \"layers:\" << sceneDocument->map()->layers().size();\n            QVector<GeoSceneLayer*>::const_iterator it = sceneDocument->map()->layers().constBegin();\n            QVector<GeoSceneLayer*>::const_iterator end = sceneDocument->map()->layers().constEnd();\n            for (; it != end; it++) {\n                GeoSceneLayer* layer = *it;\n                qDebug() << \"\\t---------------------------------------------------------\";\n                qDebug() << \"\\tLayerName: \" << layer->name();\n                qDebug() << \"\\tBackend: \" << layer->backend();\n                QVector<GeoSceneAbstractDataset*>::const_iterator it = layer->datasets().constBegin();\n                QVector<GeoSceneAbstractDataset*>::const_iterator end = layer->datasets().constEnd();\n                for (; it != end; ++it) {\n                    GeoSceneAbstractDataset* dataset = *it;\n                    qDebug() << \"\\t\\tDatasetName: \" << dataset->name();\n                    qDebug() << \"\\t\\tFileformat: \" << dataset->fileFormat();\n                    qDebug() << \"\\t\\tType: \" << dataset->type();\n                }\n            }\n        }\n        dumpGeoSceneDocument(static_cast<GeoSceneDocument*>(document));\n    }\n    else {\n        \/\/ A parsed document should either be a GeoDataDocument or a GeoSceneDocument!\n        Q_ASSERT(false);\n    }\n\n    qDebug() << \"\\nSuccessfully parsed file!\";\n    delete document;\n    qDebug() << \"\\nSuccessfully deleted file!\";\n    return 0;\n}\n\nQString formatOutput(int depth)\n{\n    QString result;\n    for (int i = 0; i < depth; ++i)\n        result += \"  \";\n\n    return result;\n}\n\nvoid dumpFoldersRecursively(const GeoDataContainer* container, int depth)\n{\n    QVector<GeoDataFolder*> folders = container->folders();\n    QString format = formatOutput(depth);\n\n    fprintf(stderr, \"%s\", qPrintable(format + QString(\"Dumping container with %1 child folders!\\n\").arg(folders.size())));\n\n    QVector<GeoDataFolder*>::const_iterator it = folders.constBegin();\n    const QVector<GeoDataFolder*>::const_iterator end = folders.constEnd();\n\n    for (; it != end; ++it) {\n        fprintf(stderr, \"%s\", qPrintable(format + QString(\"Dumping child %1\\n\").arg(it - folders.constBegin() + 1)));\n        dumpFoldersRecursively(*it, ++depth);\n    }\n}\n\nvoid dumpGeoDataDocument(GeoDataDocument* document)\n{\n    dumpFoldersRecursively(document, 0);\n    \/\/ TODO: Dump all features!\n} \n\nvoid dumpGeoSceneDocument(GeoSceneDocument* document)\n{\n    \/\/ TODO: Maybe dump parsed datastructures here!\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2004 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 \"cxxtools\/utf8codec.h\"\n#include <cxxtools\/conversionerror.h>\n\n#define halfShift uint32_t(10)\n#define halfBase cxxtools::Char(0x0010000)\n#define halfMask cxxtools::Char(0x3FF)\n#define byteMask cxxtools::Char(0xBF)\n#define byteMark cxxtools::Char(0x80)\n\nnamespace cxxtools {\n\nconst cxxtools::Char ReplacementChar = 0x0000FFFD;\nconst cxxtools::Char MaxBmp = 0x0000FFFF;\nconst cxxtools::Char MaxUtf16 = 0x0010FFFF;\nconst cxxtools::Char MaxUtf32 = 0x7FFFFFFF;\nconst cxxtools::Char MaxLegalUtf32 = 0x0010FFFF;\nconst cxxtools::Char SurHighStart = 0xD800;\nconst cxxtools::Char SurHighEnd = 0xDBFF;\nconst cxxtools::Char SurLowStart = 0xDC00;\nconst cxxtools::Char SurLowEnd = 0xDFFF;\nconst cxxtools::Char ByteOrderMark = 0xFEFF;\nconst cxxtools::Char ByteOrderSwapped = 0xFFFE;\n\n\/*\n * Index into the table below with the first byte of a UTF-8 sequence to\n * get the number of trailing bytes that are supposed to follow it.\n * Note that *legal* UTF-8 values can't have 4 or 5-bytes. The table is\n * left as-is for anyone who may want to do such conversion, which was\n * allowed in earlier algorithms.\n *\/\nconst char 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\n\n\/*\n * Magic values subtracted from a buffer value during UTF8 conversion.\n * This table contains as many values as there might be trailing bytes\n * in a UTF-8 sequence.\n *\/\nconst Char offsetsFromUTF8[6] = {\n    0x00000000UL,\n    0x00003080UL,\n    0x000E2080UL,\n    0x03C82080UL,\n    0xFA082080UL,\n    0x82082080UL\n};\n\n\n\/*\n * Once the bits are split out into bytes of UTF-8, this is a mask OR-ed\n * into the first byte, depending on how many bytes follow.  There are\n * as many entries in this table as there are UTF-8 sequence types.\n * (I.e., one byte sequence, two byte... etc.). Remember that sequencs\n * for *legal* UTF-8 will be 4 or fewer bytes total.\n *\/\nconst uint8_t firstByteMark[7] = {\n    0x00, 0x00, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC\n};\n\n\n\/**\n * @brief Checks if the given character sequence is a valid UTF-8 character.\n *\n * The given array 8-bit-values is \"parsed\" and tried to be converted into a\n * Unicode-character using UTF-decoding. If this is not possible $false$ is returned\n * as the 8-bit-sequence is not a valid UTF-8 character. Otherwise $true$ is\n * returned. Only the first number of characters as specified in 'length' is\n * tried to converted.\n *\n * @param source An array of 8-bit values containing raw UTF-8 character data.\n * @param length Number of characters of source which are checked if they are\n * a valid UTF-8 character.\n * @return $true$ if the given sequence is a UTF-8-encoded character, $false$\n * otherwise.\n *\/\ninline bool isLegalUTF8(const uint8_t *source, int length)\n{\n    uint8_t a;\n    const uint8_t *srcptr = source + length;\n\n    switch (length)\n    {\n        default:\n            return false;\n\n        \/\/ Everything else falls through when \"true\"...\n        case 4: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return false;\n        case 3: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return false;\n        case 2: if ((a = (*--srcptr)) > 0xBF) return false;\n            switch (*source) {\n                \/\/ no fall-through in this inner switch\n                case 0xE0: if (a < 0xA0) return false; break;\n                case 0xED: if (a > 0x9F) return false; break;\n                case 0xF0: if (a < 0x90) return false; break;\n                case 0xF4: if (a > 0x8F) return false; break;\n                default:   if (a < 0x80) return false;\n            }\n        case 1: if (*source >= 0x80 && *source < 0xC2) return false;\n    }\n\n    if (*source > 0xF4)\n        return false;\n\n    return true;\n}\n\n\nUtf8Codec::Utf8Codec(size_t ref)\n: cxxtools::TextCodec<Char, char>(ref)\n{}\n\n\nUtf8Codec::result Utf8Codec::do_in(MBState& s, const char* fromBegin, const char* fromEnd, const char*& fromNext,\n                                   cxxtools::Char* toBegin, cxxtools::Char* toEnd, cxxtools::Char*& toNext) const\n{\n    Utf8Codec::result retstat = ok;\n    fromNext = fromBegin;\n    toNext = toBegin;\n\n    while(fromNext < fromEnd) {\n        uint8_t* fnext = (uint8_t *)(fromNext);\n\n        if(toNext >= toEnd) {\n            retstat = partial;\n            break;\n        }\n\n        const size_t extraBytesToRead = trailingBytesForUTF8[*fnext];\n        if(fromNext + extraBytesToRead >= fromEnd) {\n            retstat = partial;\n            break;\n        }\n\n        if( !isLegalUTF8( (const uint8_t*)fnext, extraBytesToRead + 1 ) ) {\n            retstat = error;\n            break;\n        }\n\n        *toNext = 0;\n        switch (extraBytesToRead) {\n            case 5: *toNext += *fnext++; *toNext <<= 6; \/\/ We should never get this for legal UTF-8\n            case 4: *toNext += *fnext++; *toNext <<= 6; \/\/ We should never get this for legal UTF-8\n            case 3: *toNext += *fnext++; *toNext <<= 6;\n            case 2: *toNext += *fnext++; *toNext <<= 6;\n            case 1: *toNext += *fnext++; *toNext <<= 6;\n            case 0: *toNext += *fnext++;\n        }\n        *toNext -= offsetsFromUTF8[extraBytesToRead];\n\n        \/\/ UTF-16 surrogate values are illegal in UTF-32, and anything\n        \/\/ over Plane 17 (> 0x10FFFF) is illegal.\n        if(*toNext > MaxLegalUtf32) {\n            *toNext = ReplacementChar;\n        }\n        else if(*toNext >= SurHighStart && *toNext <= SurLowEnd) {\n            *toNext = ReplacementChar;\n        }\n\n        ++toNext;\n        fromNext += (extraBytesToRead + 1);\n    }\n\n    return retstat;\n}\n\n\nUtf8Codec::result Utf8Codec::do_out(MBState& s, const cxxtools::Char* fromBegin, const cxxtools::Char* fromEnd, const cxxtools::Char*& fromNext,\n                                                  char* toBegin, char* toEnd, char*& toNext) const\n{\n    result retstat = ok;\n    fromNext  = fromBegin;\n    toNext = toBegin;\n    cxxtools::Char ch;\n\n    size_t bytesToWrite;\n\n    while(fromNext < fromEnd) {\n        ch = *fromNext;\n        if (ch >= SurHighStart && ch <= SurLowEnd) {\n            retstat = error;\n            break;\n        }\n\n        \/\/ Figure out how many bytes the result will require. Turn any\n        \/\/ illegally large UTF32 things (> Plane 17) into replacement chars.\n        if (ch < cxxtools::Char(0x80)) {\n            bytesToWrite = 1;\n        }\n        else if (ch < cxxtools::Char(0x800)) {\n            bytesToWrite = 2;\n        }\n        else if (ch < cxxtools::Char(0x10000)) {\n            bytesToWrite = 3;\n        }\n        else if (ch <= MaxLegalUtf32) {\n            bytesToWrite = 4;\n        }\n        else {\n            bytesToWrite = 3;\n            ch = ReplacementChar;\n        }\n\n        uint8_t* current = (uint8_t*)(toNext + bytesToWrite);\n        if( current >= (uint8_t*)(toEnd) ) {\n            retstat = partial;\n            break;\n        }\n\n        switch(bytesToWrite) { \/\/ note: everything falls through...\n            case 4: *--current = (uint8_t)((ch | byteMark) & byteMask).value(); ch >>= 6;\n            case 3: *--current = (uint8_t)((ch | byteMark) & byteMask).value(); ch >>= 6;\n            case 2: *--current = (uint8_t)((ch | byteMark) & byteMask).value(); ch >>= 6;\n            case 1: *--current = (uint8_t) (ch.value() | firstByteMark[bytesToWrite]);\n        }\n\n        toNext += bytesToWrite;\n        ++fromNext;\n    }\n\n    return retstat;\n}\n\n\nint Utf8Codec::do_length(MBState& s, const char* fromBegin, const char* fromEnd, size_t max) const\n{\n    const char* fromNext = fromBegin;\n    size_t counter = 0;\n\n    while(fromNext < fromEnd && counter <= max) {\n        int extraBytesToRead = trailingBytesForUTF8[ (unsigned char)*fromNext ]; \/\/ NOTE: check again...\n\n        if(fromNext + extraBytesToRead >= fromEnd) {\n            break;\n        }\n\n        if(!isLegalUTF8( (const uint8_t*) fromNext, extraBytesToRead + 1 ) ) {\n            break;\n        }\n\n        fromNext += extraBytesToRead + 1;\n        counter += extraBytesToRead + 1;\n    }\n\n    return fromNext - fromBegin;\n}\n\n\nint Utf8Codec::do_max_length() const throw()\n{\n    return 4;\n}\n\n\nbool Utf8Codec::do_always_noconv() const throw()\n{\n    return false;\n}\n\nString Utf8Codec::decode(const char* data, unsigned size)\n{\n    Utf8Codec codec;\n\n    Char to[16];\n    MBState state;\n    String ret;\n    const char* from = data;\n\n    result r;\n    do\n    {\n        Char* to_next = to;\n\n        const char* from_next = from;\n        r = codec.in(state, from, from + size, from_next, to, &to[sizeof(to) \/ sizeof(Char)], to_next);\n\n        if (r == error)\n            throw ConversionError(\"character conversion failed\");\n\n        ret.append(to, to_next);\n\n        size -= (from_next - from);\n        from = from_next;\n\n    } while (r == partial);\n\n    return ret;\n}\n\nstd::string Utf8Codec::encode(const Char* data, unsigned size)\n{\n    Utf8Codec codec;\n    char to[16];\n    MBState state;\n    \n    result r;\n    const Char* from = data;\n    std::string ret;\n\n    do{\n        const Char* from_next;\n\n        char* to_next = to;\n        r = codec.out(state, from, from + size, from_next, to, to + sizeof(to), to_next);\n\n        if (r == error)\n            throw ConversionError(\"character conversion failed\");\n\n        ret.append(to, to_next);\n\n        size -= (from_next - from);\n        from = from_next;\n\n    } while (r == partial);\n\n    return ret;\n}\n\n} \/\/ namespace cxxtools\n<commit_msg>add error check in Utf8Codec::decode<commit_after>\/*\n * Copyright (C) 2004 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 \"cxxtools\/utf8codec.h\"\n#include <cxxtools\/conversionerror.h>\n\n#define halfShift uint32_t(10)\n#define halfBase cxxtools::Char(0x0010000)\n#define halfMask cxxtools::Char(0x3FF)\n#define byteMask cxxtools::Char(0xBF)\n#define byteMark cxxtools::Char(0x80)\n\nnamespace cxxtools {\n\nconst cxxtools::Char ReplacementChar = 0x0000FFFD;\nconst cxxtools::Char MaxBmp = 0x0000FFFF;\nconst cxxtools::Char MaxUtf16 = 0x0010FFFF;\nconst cxxtools::Char MaxUtf32 = 0x7FFFFFFF;\nconst cxxtools::Char MaxLegalUtf32 = 0x0010FFFF;\nconst cxxtools::Char SurHighStart = 0xD800;\nconst cxxtools::Char SurHighEnd = 0xDBFF;\nconst cxxtools::Char SurLowStart = 0xDC00;\nconst cxxtools::Char SurLowEnd = 0xDFFF;\nconst cxxtools::Char ByteOrderMark = 0xFEFF;\nconst cxxtools::Char ByteOrderSwapped = 0xFFFE;\n\n\/*\n * Index into the table below with the first byte of a UTF-8 sequence to\n * get the number of trailing bytes that are supposed to follow it.\n * Note that *legal* UTF-8 values can't have 4 or 5-bytes. The table is\n * left as-is for anyone who may want to do such conversion, which was\n * allowed in earlier algorithms.\n *\/\nconst char 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\n\n\/*\n * Magic values subtracted from a buffer value during UTF8 conversion.\n * This table contains as many values as there might be trailing bytes\n * in a UTF-8 sequence.\n *\/\nconst Char offsetsFromUTF8[6] = {\n    0x00000000UL,\n    0x00003080UL,\n    0x000E2080UL,\n    0x03C82080UL,\n    0xFA082080UL,\n    0x82082080UL\n};\n\n\n\/*\n * Once the bits are split out into bytes of UTF-8, this is a mask OR-ed\n * into the first byte, depending on how many bytes follow.  There are\n * as many entries in this table as there are UTF-8 sequence types.\n * (I.e., one byte sequence, two byte... etc.). Remember that sequencs\n * for *legal* UTF-8 will be 4 or fewer bytes total.\n *\/\nconst uint8_t firstByteMark[7] = {\n    0x00, 0x00, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC\n};\n\n\n\/**\n * @brief Checks if the given character sequence is a valid UTF-8 character.\n *\n * The given array 8-bit-values is \"parsed\" and tried to be converted into a\n * Unicode-character using UTF-decoding. If this is not possible $false$ is returned\n * as the 8-bit-sequence is not a valid UTF-8 character. Otherwise $true$ is\n * returned. Only the first number of characters as specified in 'length' is\n * tried to converted.\n *\n * @param source An array of 8-bit values containing raw UTF-8 character data.\n * @param length Number of characters of source which are checked if they are\n * a valid UTF-8 character.\n * @return $true$ if the given sequence is a UTF-8-encoded character, $false$\n * otherwise.\n *\/\ninline bool isLegalUTF8(const uint8_t *source, int length)\n{\n    uint8_t a;\n    const uint8_t *srcptr = source + length;\n\n    switch (length)\n    {\n        default:\n            return false;\n\n        \/\/ Everything else falls through when \"true\"...\n        case 4: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return false;\n        case 3: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return false;\n        case 2: if ((a = (*--srcptr)) > 0xBF) return false;\n            switch (*source) {\n                \/\/ no fall-through in this inner switch\n                case 0xE0: if (a < 0xA0) return false; break;\n                case 0xED: if (a > 0x9F) return false; break;\n                case 0xF0: if (a < 0x90) return false; break;\n                case 0xF4: if (a > 0x8F) return false; break;\n                default:   if (a < 0x80) return false;\n            }\n        case 1: if (*source >= 0x80 && *source < 0xC2) return false;\n    }\n\n    if (*source > 0xF4)\n        return false;\n\n    return true;\n}\n\n\nUtf8Codec::Utf8Codec(size_t ref)\n: cxxtools::TextCodec<Char, char>(ref)\n{}\n\n\nUtf8Codec::result Utf8Codec::do_in(MBState& s, const char* fromBegin, const char* fromEnd, const char*& fromNext,\n                                   cxxtools::Char* toBegin, cxxtools::Char* toEnd, cxxtools::Char*& toNext) const\n{\n    Utf8Codec::result retstat = ok;\n    fromNext = fromBegin;\n    toNext = toBegin;\n\n    while(fromNext < fromEnd) {\n        uint8_t* fnext = (uint8_t *)(fromNext);\n\n        if(toNext >= toEnd) {\n            retstat = partial;\n            break;\n        }\n\n        const size_t extraBytesToRead = trailingBytesForUTF8[*fnext];\n        if(fromNext + extraBytesToRead >= fromEnd) {\n            retstat = partial;\n            break;\n        }\n\n        if( !isLegalUTF8( (const uint8_t*)fnext, extraBytesToRead + 1 ) ) {\n            retstat = error;\n            break;\n        }\n\n        *toNext = 0;\n        switch (extraBytesToRead) {\n            case 5: *toNext += *fnext++; *toNext <<= 6; \/\/ We should never get this for legal UTF-8\n            case 4: *toNext += *fnext++; *toNext <<= 6; \/\/ We should never get this for legal UTF-8\n            case 3: *toNext += *fnext++; *toNext <<= 6;\n            case 2: *toNext += *fnext++; *toNext <<= 6;\n            case 1: *toNext += *fnext++; *toNext <<= 6;\n            case 0: *toNext += *fnext++;\n        }\n        *toNext -= offsetsFromUTF8[extraBytesToRead];\n\n        \/\/ UTF-16 surrogate values are illegal in UTF-32, and anything\n        \/\/ over Plane 17 (> 0x10FFFF) is illegal.\n        if(*toNext > MaxLegalUtf32) {\n            *toNext = ReplacementChar;\n        }\n        else if(*toNext >= SurHighStart && *toNext <= SurLowEnd) {\n            *toNext = ReplacementChar;\n        }\n\n        ++toNext;\n        fromNext += (extraBytesToRead + 1);\n    }\n\n    return retstat;\n}\n\n\nUtf8Codec::result Utf8Codec::do_out(MBState& s, const cxxtools::Char* fromBegin, const cxxtools::Char* fromEnd, const cxxtools::Char*& fromNext,\n                                                  char* toBegin, char* toEnd, char*& toNext) const\n{\n    result retstat = ok;\n    fromNext  = fromBegin;\n    toNext = toBegin;\n    cxxtools::Char ch;\n\n    size_t bytesToWrite;\n\n    while(fromNext < fromEnd) {\n        ch = *fromNext;\n        if (ch >= SurHighStart && ch <= SurLowEnd) {\n            retstat = error;\n            break;\n        }\n\n        \/\/ Figure out how many bytes the result will require. Turn any\n        \/\/ illegally large UTF32 things (> Plane 17) into replacement chars.\n        if (ch < cxxtools::Char(0x80)) {\n            bytesToWrite = 1;\n        }\n        else if (ch < cxxtools::Char(0x800)) {\n            bytesToWrite = 2;\n        }\n        else if (ch < cxxtools::Char(0x10000)) {\n            bytesToWrite = 3;\n        }\n        else if (ch <= MaxLegalUtf32) {\n            bytesToWrite = 4;\n        }\n        else {\n            bytesToWrite = 3;\n            ch = ReplacementChar;\n        }\n\n        uint8_t* current = (uint8_t*)(toNext + bytesToWrite);\n        if( current >= (uint8_t*)(toEnd) ) {\n            retstat = partial;\n            break;\n        }\n\n        switch(bytesToWrite) { \/\/ note: everything falls through...\n            case 4: *--current = (uint8_t)((ch | byteMark) & byteMask).value(); ch >>= 6;\n            case 3: *--current = (uint8_t)((ch | byteMark) & byteMask).value(); ch >>= 6;\n            case 2: *--current = (uint8_t)((ch | byteMark) & byteMask).value(); ch >>= 6;\n            case 1: *--current = (uint8_t) (ch.value() | firstByteMark[bytesToWrite]);\n        }\n\n        toNext += bytesToWrite;\n        ++fromNext;\n    }\n\n    return retstat;\n}\n\n\nint Utf8Codec::do_length(MBState& s, const char* fromBegin, const char* fromEnd, size_t max) const\n{\n    const char* fromNext = fromBegin;\n    size_t counter = 0;\n\n    while(fromNext < fromEnd && counter <= max) {\n        int extraBytesToRead = trailingBytesForUTF8[ (unsigned char)*fromNext ]; \/\/ NOTE: check again...\n\n        if(fromNext + extraBytesToRead >= fromEnd) {\n            break;\n        }\n\n        if(!isLegalUTF8( (const uint8_t*) fromNext, extraBytesToRead + 1 ) ) {\n            break;\n        }\n\n        fromNext += extraBytesToRead + 1;\n        counter += extraBytesToRead + 1;\n    }\n\n    return fromNext - fromBegin;\n}\n\n\nint Utf8Codec::do_max_length() const throw()\n{\n    return 4;\n}\n\n\nbool Utf8Codec::do_always_noconv() const throw()\n{\n    return false;\n}\n\nString Utf8Codec::decode(const char* data, unsigned size)\n{\n    Utf8Codec codec;\n\n    Char to[64];\n    MBState state;\n    String ret;\n    const char* from = data;\n\n    result r;\n    do\n    {\n        Char* to_next = to;\n\n        const char* from_next = from;\n        r = codec.in(state, from, from + size, from_next, to, &to[sizeof(to) \/ sizeof(Char)], to_next);\n\n        if (r == error)\n            throw ConversionError(\"character conversion failed\");\n\n        if (r == partial && from_next == from)\n            throw ConversionError(\"character conversion failed - unexpected end of utf8 sequence\");\n\n        ret.append(to, to_next);\n\n        size -= (from_next - from);\n        from = from_next;\n\n    } while (r == partial);\n\n    return ret;\n}\n\nstd::string Utf8Codec::encode(const Char* data, unsigned size)\n{\n    Utf8Codec codec;\n    char to[64];\n    MBState state;\n    \n    result r;\n    const Char* from = data;\n    std::string ret;\n\n    do{\n        const Char* from_next;\n\n        char* to_next = to;\n        r = codec.out(state, from, from + size, from_next, to, to + sizeof(to), to_next);\n\n        if (r == error)\n            throw ConversionError(\"character conversion failed\");\n\n        ret.append(to, to_next);\n\n        size -= (from_next - from);\n        from = from_next;\n\n    } while (r == partial);\n\n    return ret;\n}\n\n} \/\/ namespace cxxtools\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Chemharp, an efficient IO library for chemistry file formats\n * Copyright (C) 2015 Guillaume Fraux\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 \"chemharp-python.hpp\"\n\nvoid register_frame() {\n    \/* Trajectory class *******************************************************\/\n    py::class_<Trajectory, boost::noncopyable>(\"Trajectory\",\n            py::init<string, py::optional<string, string>>())\n        .def(\"read_next_step\", &Trajectory::read_next_step)\n        .def(\"read_at_step\", &Trajectory::read_at_step)\n        .def(\"write_step\", &Trajectory::write_step)\n        .def(\"done\", &Trajectory::done)\n        .def(\"close\", &Trajectory::close)\n        .def(\"nsteps\", &Trajectory::nsteps)\n        .def(\"topology\",\n            static_cast<void (Trajectory::*)(const Topology&)>(&Trajectory::topology))\n        .def(\"topology\",\n            static_cast<void (Trajectory::*)(const string&)>(&Trajectory::topology))\n    ;\n}\n<commit_msg>Wrap the good class to Python<commit_after>\/*\n * Chemharp, an efficient IO library for chemistry file formats\n * Copyright (C) 2015 Guillaume Fraux\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 \"chemharp-python.hpp\"\n\nvoid register_frame() {\n    \/* Frame class ************************************************************\/\n    py::class_<Frame>(\"Frame\")\n        .add_property(\"positions\",\n            py::make_function(\n                static_cast<const Array3D& (Frame::*)(void) const>(&Frame::positions),\n                py::return_value_policy<Array3D_convertor>()),\n            static_cast<void (Frame::*)(const Array3D&)>(&Frame::positions)\n            )\n        .add_property(\"velocities\",\n            py::make_function(\n                static_cast<const Array3D& (Frame::*)(void) const>(&Frame::velocities),\n                py::return_value_policy<Array3D_convertor>()),\n            static_cast<void (Frame::*)(const Array3D&)>(&Frame::positions)\n            )\n        .add_property(\"has_velocities\", &Frame::has_velocities)\n        .def(\"__len__\", &Frame::natoms)\n        .add_property(\"natoms\", &Frame::natoms)\n        .add_property(\"topology\",\n            py::make_function(\n                static_cast<const Topology& (Frame::*)(void) const>(&Frame::topology),\n                py::return_value_policy<py::copy_const_reference>()),\n            static_cast<void (Frame::*)(const Topology&)>(&Frame::topology))\n        .add_property(\"cell\",\n            py::make_function(\n                static_cast<const UnitCell& (Frame::*)(void) const>(&Frame::cell),\n                py::return_value_policy<py::copy_const_reference>()),\n            static_cast<void (Frame::*)(const UnitCell&)>(&Frame::cell))\n        .add_property(\"step\",\n            static_cast<size_t (Frame::*)(void) const>(&Frame::step),\n            static_cast<void (Frame::*)(size_t)>(&Frame::step))\n    ;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ How to steer the TRD loaders from a macro\n\/\/ For the usage of only the TRD data containers and \n\/\/ AliEve event loop check the macro \"trd_detectors.C\"\n\/\/ \n\/\/ Usage:\n\/\/ .L trd_loader.C\n\/\/ AliEveTRDLoader *loader = trd_loader();\n\/\/ loader->NextEvent();\n\/\/ \n\/\/ Caution:\n\/\/ In order to update the screen one has to go to GLViewer \n\/\/ and click the UpdateScene button after each NextEvent().\n\/\/ \n\/\/ Author:\n\/\/ Alex Bercuci (A.Bercuci@gsi.de)\n\/\/\nAliEveTRDLoader* trd_loader()\n{\n  \/\/ init MC loader\n  AliEveTRDLoader *loader = new AliEveTRDLoaderSim(\"MC\");\n  \n  \/\/ init single file loader\n  \/\/ AliEveTRDLoader *loader = new AliEveTRDLoader(\"Digits\");\n\n  \/\/ link the run loader and define the chamber setting and data type\n  loader->Open(\"galice.root\");\n  loader->AddChambers(3, 3);\n  loader->SetDataType(AliEveTRDLoader::kTRDHits | AliEveTRDLoader::kTRDDigits | AliEveTRDLoader::kTRDClusters);\n\n  \/\/ load first event\n  loader->GoToEvent(0);\n  \n  \/\/ register loader with alieve\n  gEve->AddElement(loader);\n  loader->SpawnEditor();\n  gEve->Redraw3D();\n\n  return loader;\n}\n<commit_msg>introduce event browsing function.<commit_after>\/\/\n\/\/ How to steer the TRD loaders from a macro\n\/\/ For the usage of only the TRD data containers and \n\/\/ AliEve event loop check the macro \"trd_detectors.C\"\n\/\/ \n\/\/ Usage:\n\/\/ .L trd_loader.C\n\/\/ AliEveTRDLoader *loader = trd_loader();\n\/\/ loader->NextEvent();\n\/\/ loop(loader)\n\/\/ \n\/\/ Author:\n\/\/ Alex Bercuci (A.Bercuci@gsi.de)\n\/\/\nAliEveTRDLoader* trd_loader(Int_t event=70)\n{\n  \/\/ init single file loader\n  AliEveTRDLoader *loader = new AliEveTRDLoader(\"Clusters\");\n\n  \/\/ link the run loader and define the chamber setting and data type\n  loader->Open(\"TRD.RecPoints.root\");\n  loader->AddChambers(0);\n  loader->AddChambers(8);\n  loader->AddChambers(9);\n  loader->AddChambers(17);\n  loader->SetDataType(AliEveTRDLoader::kTRDClusters);\n\n  \/\/ load first event\n  loader->GoToEvent(event);\n  \n  \/\/ register loader with alieve\n  gEve->AddElement(loader);\n  loader->SpawnEditor();\n  gEve->Redraw3D();\n\n  return loader;\n}\n\n\nvoid loop(AliEveTRDLoader *loader)\n{\n  while(loader->NextEvent()){ \n    printf(\"Event[%d]\\n\", loader->GetEvent());\n    gEve->Redraw3D();\n    gSystem->ProcessEvents();\n    gSystem->Sleep(2000);\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 the Qt Build Suite.\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#include \"profile.h\"\n\n#include \"settings.h\"\n\n#include <logging\/translator.h>\n#include <tools\/error.h>\n\nnamespace qbs {\n\n\/*!\n * \\class Profile\n * \\brief The \\c Profile class gives access to the settings of a given profile.\n *\/\n\n \/*!\n * \\enum Profile::KeySelection\n * This enum type specifies whether to enumerate keys recursively.\n * \\value KeySelectionRecursive Indicates that key enumeration should happen recursively, i.e.\n *        it should go up the base profile chain.\n * \\value KeySelectionNonRecursive Indicates that only keys directly attached to a profile\n *        should be listed.\n *\/\n\n\/*!\n * \\brief Creates an object giving access to the settings for profile \\c name.\n *\/\nProfile::Profile(const QString &name, Settings *settings) : m_name(name), m_settings(settings)\n{\n}\n\n\/*!\n * \\brief Returns the value for property \\c key in this profile.\n *\/\nQVariant Profile::value(const QString &key, const QVariant &defaultValue) const\n{\n    return possiblyInheritedValue(key, defaultValue, QStringList());\n}\n\n\/*!\n * \\brief Gives value \\c value to the property \\c key in this profile.\n *\/\nvoid Profile::setValue(const QString &key, const QVariant &value)\n{\n    m_settings->setValue(fullyQualifiedKey(key), value);\n}\n\n\/*!\n * \\brief Removes a key and the associated value from this profile.\n *\/\nvoid Profile::remove(const QString &key)\n{\n    m_settings->remove(fullyQualifiedKey(key));\n}\n\n\/*!\n * \\brief Returns the name of this profile.\n *\/\nQString Profile::name() const\n{\n    return m_name;\n}\n\n\/*!\n * \\brief Returns all property keys in this profile.\n * If and only if selection is Profile::KeySelectionRecursive, this will also list keys defined\n * in base profiles.\n *\/\nQStringList Profile::allKeys(KeySelection selection) const\n{\n    return allKeysInternal(selection, QStringList());\n}\n\n\/*!\n * \\brief Returns the name of this profile's base profile.\n * The returned value is empty if the profile does not have a base profile.\n *\/\nQString Profile::baseProfile() const\n{\n    return localValue(baseProfileKey()).toString();\n}\n\n\/*!\n * \\brief Sets a new base profile for this profile.\n *\/\nvoid Profile::setBaseProfile(const QString &baseProfile)\n{\n    setValue(baseProfileKey(), baseProfile);\n}\n\n\/*!\n * \\brief Removes this profile's base profile setting.\n *\/\nvoid Profile::removeBaseProfile()\n{\n    remove(baseProfileKey());\n}\n\n\/*!\n * \\brief Removes this profile from the settings.\n *\/\nvoid Profile::removeProfile()\n{\n    remove(profileKey());\n}\n\nQString Profile::profileKey() const\n{\n    return QLatin1String(\"profiles.\") + m_name;\n}\n\nQString Profile::baseProfileKey()\n{\n    return QLatin1String(\"baseProfile\");\n}\n\nQVariant Profile::localValue(const QString &key) const\n{\n    return m_settings->value(fullyQualifiedKey(key));\n}\n\nQString Profile::fullyQualifiedKey(const QString &key) const\n{\n    return profileKey() + QLatin1Char('.') + key;\n}\n\nQVariant Profile::possiblyInheritedValue(const QString &key, const QVariant &defaultValue,\n                                         QStringList profileChain) const\n{\n    extendAndCheckProfileChain(profileChain);\n    const QVariant v = localValue(key);\n    if (v.isValid())\n        return v;\n    const QString baseProfileName = baseProfile();\n    if (baseProfileName.isEmpty())\n        return defaultValue;\n    Profile parentProfile(baseProfileName, m_settings);\n    return parentProfile.possiblyInheritedValue(key, defaultValue, profileChain);\n}\n\nQStringList Profile::allKeysInternal(Profile::KeySelection selection,\n                                     QStringList profileChain) const\n{\n    extendAndCheckProfileChain(profileChain);\n    QStringList keys = m_settings->allKeysWithPrefix(profileKey());\n    if (selection == KeySelectionNonRecursive)\n        return keys;\n    const QString baseProfileName = baseProfile();\n    if (baseProfileName.isEmpty())\n        return keys;\n    Profile parentProfile(baseProfileName, m_settings);\n    keys += parentProfile.allKeysInternal(KeySelectionRecursive, profileChain);\n    keys.removeDuplicates();\n    keys.removeOne(baseProfileKey());\n    keys.sort();\n    return keys;\n}\n\nvoid Profile::extendAndCheckProfileChain(QStringList &chain) const\n{\n    chain << m_name;\n    if (chain.count(m_name) > 1) {\n        throw Error(Internal::Tr::tr(\"Circular profile inheritance. Cycle is '%1'.\")\n                    .arg(chain.join(QLatin1String(\" -> \"))));\n    }\n}\n\n} \/\/ namespace qbs\n<commit_msg>fix Profile::removeProfile<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 Build Suite.\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#include \"profile.h\"\n\n#include \"settings.h\"\n\n#include <logging\/translator.h>\n#include <tools\/error.h>\n\nnamespace qbs {\n\n\/*!\n * \\class Profile\n * \\brief The \\c Profile class gives access to the settings of a given profile.\n *\/\n\n \/*!\n * \\enum Profile::KeySelection\n * This enum type specifies whether to enumerate keys recursively.\n * \\value KeySelectionRecursive Indicates that key enumeration should happen recursively, i.e.\n *        it should go up the base profile chain.\n * \\value KeySelectionNonRecursive Indicates that only keys directly attached to a profile\n *        should be listed.\n *\/\n\n\/*!\n * \\brief Creates an object giving access to the settings for profile \\c name.\n *\/\nProfile::Profile(const QString &name, Settings *settings) : m_name(name), m_settings(settings)\n{\n}\n\n\/*!\n * \\brief Returns the value for property \\c key in this profile.\n *\/\nQVariant Profile::value(const QString &key, const QVariant &defaultValue) const\n{\n    return possiblyInheritedValue(key, defaultValue, QStringList());\n}\n\n\/*!\n * \\brief Gives value \\c value to the property \\c key in this profile.\n *\/\nvoid Profile::setValue(const QString &key, const QVariant &value)\n{\n    m_settings->setValue(fullyQualifiedKey(key), value);\n}\n\n\/*!\n * \\brief Removes a key and the associated value from this profile.\n *\/\nvoid Profile::remove(const QString &key)\n{\n    m_settings->remove(fullyQualifiedKey(key));\n}\n\n\/*!\n * \\brief Returns the name of this profile.\n *\/\nQString Profile::name() const\n{\n    return m_name;\n}\n\n\/*!\n * \\brief Returns all property keys in this profile.\n * If and only if selection is Profile::KeySelectionRecursive, this will also list keys defined\n * in base profiles.\n *\/\nQStringList Profile::allKeys(KeySelection selection) const\n{\n    return allKeysInternal(selection, QStringList());\n}\n\n\/*!\n * \\brief Returns the name of this profile's base profile.\n * The returned value is empty if the profile does not have a base profile.\n *\/\nQString Profile::baseProfile() const\n{\n    return localValue(baseProfileKey()).toString();\n}\n\n\/*!\n * \\brief Sets a new base profile for this profile.\n *\/\nvoid Profile::setBaseProfile(const QString &baseProfile)\n{\n    setValue(baseProfileKey(), baseProfile);\n}\n\n\/*!\n * \\brief Removes this profile's base profile setting.\n *\/\nvoid Profile::removeBaseProfile()\n{\n    remove(baseProfileKey());\n}\n\n\/*!\n * \\brief Removes this profile from the settings.\n *\/\nvoid Profile::removeProfile()\n{\n    m_settings->remove(profileKey());\n}\n\nQString Profile::profileKey() const\n{\n    return QLatin1String(\"profiles.\") + m_name;\n}\n\nQString Profile::baseProfileKey()\n{\n    return QLatin1String(\"baseProfile\");\n}\n\nQVariant Profile::localValue(const QString &key) const\n{\n    return m_settings->value(fullyQualifiedKey(key));\n}\n\nQString Profile::fullyQualifiedKey(const QString &key) const\n{\n    return profileKey() + QLatin1Char('.') + key;\n}\n\nQVariant Profile::possiblyInheritedValue(const QString &key, const QVariant &defaultValue,\n                                         QStringList profileChain) const\n{\n    extendAndCheckProfileChain(profileChain);\n    const QVariant v = localValue(key);\n    if (v.isValid())\n        return v;\n    const QString baseProfileName = baseProfile();\n    if (baseProfileName.isEmpty())\n        return defaultValue;\n    Profile parentProfile(baseProfileName, m_settings);\n    return parentProfile.possiblyInheritedValue(key, defaultValue, profileChain);\n}\n\nQStringList Profile::allKeysInternal(Profile::KeySelection selection,\n                                     QStringList profileChain) const\n{\n    extendAndCheckProfileChain(profileChain);\n    QStringList keys = m_settings->allKeysWithPrefix(profileKey());\n    if (selection == KeySelectionNonRecursive)\n        return keys;\n    const QString baseProfileName = baseProfile();\n    if (baseProfileName.isEmpty())\n        return keys;\n    Profile parentProfile(baseProfileName, m_settings);\n    keys += parentProfile.allKeysInternal(KeySelectionRecursive, profileChain);\n    keys.removeDuplicates();\n    keys.removeOne(baseProfileKey());\n    keys.sort();\n    return keys;\n}\n\nvoid Profile::extendAndCheckProfileChain(QStringList &chain) const\n{\n    chain << m_name;\n    if (chain.count(m_name) > 1) {\n        throw Error(Internal::Tr::tr(\"Circular profile inheritance. Cycle is '%1'.\")\n                    .arg(chain.join(QLatin1String(\" -> \"))));\n    }\n}\n\n} \/\/ namespace qbs\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _WIN32\n\n\/\/===--- TerminalDisplayUnix.cpp - Output To UNIX Terminal ------*- 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 interface for writing to a UNIX terminal. It tries to\n\/\/  support all \"common\" terminal types.\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"textinput\/TerminalDisplayUnix.h\"\n\n#include <fcntl.h>\n#include <stdio.h>\n\/\/ putenv not in cstdlib on Solaris\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/ioctl.h>\n#include <termios.h>\n#include <csignal>\n#include <cstring>\n#include <sstream>\n#include <string>\n\n#include \"textinput\/Color.h\"\n#include \"textinput\/Display.h\"\n#include \"textinput\/TerminalConfigUnix.h\"\n\nusing std::signal;\nusing std::strstr;\n\nnamespace {\n  textinput::TerminalDisplayUnix*& gTerminalDisplayUnix() {\n    static textinput::TerminalDisplayUnix* S = 0;\n    return S;\n  }\n\n  void InitRGB256(unsigned char rgb256[][3]) {\n    \/\/ initialize the array with the expected standard colors:\n    \/\/ (from http:\/\/frexx.de\/xterm-256-notes)\n\n    \/\/ this is not what I see, though it's supposedly the default:\n    \/\/   rgb[0][0] =   0; rgb[0][1] =   0; rgb[0][1] =   0;\n    \/\/ use this instead, just to be on the safe side:\n    rgb256[0][0] =  46; rgb256[0][1] =  52; rgb256[0][2] =  64;\n    rgb256[1][0] = 205; rgb256[1][1] =   0; rgb256[1][2] =   0;\n    rgb256[2][0] =   0; rgb256[2][1] = 205; rgb256[2][2] =   0;\n    rgb256[3][0] = 205; rgb256[3][1] = 205; rgb256[3][2] =   0;\n    rgb256[4][0] =   0; rgb256[4][1] =   0; rgb256[4][2] = 238;\n    rgb256[5][0] = 205; rgb256[5][1] =   0; rgb256[5][2] = 205;\n    rgb256[6][0] =   0; rgb256[6][1] = 205; rgb256[6][2] = 205;\n    rgb256[7][0] = 229; rgb256[7][1] = 229; rgb256[7][2] = 229;\n\n    \/\/ this is not what I see, though it's supposedly the default:\n    \/\/   rgb256[ 8][0] = 127; rgb256[ 8][1] = 127; rgb256[ 8][1] = 127;\n    \/\/ use this instead, just to be on the safe side:\n    rgb256[ 8][0] =   0; rgb256[ 8][1] =   0; rgb256[ 8][2] =   0;\n    rgb256[ 9][0] = 255; rgb256[ 9][1] =   0; rgb256[ 9][2] =   0;\n    rgb256[10][0] =   0; rgb256[10][1] = 255; rgb256[10][2] =   0;\n    rgb256[11][0] = 255; rgb256[11][1] = 255; rgb256[11][2] =   0;\n    rgb256[12][0] =  92; rgb256[12][1] =  92; rgb256[12][2] = 255;\n    rgb256[13][0] = 255; rgb256[13][1] =   0; rgb256[13][2] = 255;\n    rgb256[14][0] =   0; rgb256[14][1] = 255; rgb256[14][2] = 255;\n    rgb256[15][0] = 255; rgb256[15][1] = 255; rgb256[15][2] = 255;\n\n    \/\/ 6 intensity RGB\n    static const int intensities[] = {0, 0x5f, 0x87, 0xaf, 0xd7, 0xff};\n    int idx = 16;\n    for (int r = 0; r < 6; ++r) {\n      for (int g = 0; g < 6; ++g) {\n        for (int b = 0; b < 6; ++b) {\n          rgb256[idx][0] = intensities[r];\n          rgb256[idx][1] = intensities[g];\n          rgb256[idx][2] = intensities[b];\n          ++idx;\n        }\n      }\n    }\n\n    \/\/ colors 232-255 are a grayscale ramp, intentionally leaving out\n    \/\/ black and white\n    for (unsigned char gray = 0; gray < 24; ++gray) {\n      unsigned char level = (gray * 10) + 8;\n      rgb256[232 + gray][0] = level;\n      rgb256[232 + gray][1] = level;\n      rgb256[232 + gray][2] = level;\n    }\n  }\n} \/\/ unnamed namespace\n\nextern \"C\" void TerminalDisplayUnix__handleResizeSignal(int) {\n  gTerminalDisplayUnix()->HandleResizeSignal();\n}\n\nnamespace textinput {\n  \/\/ If input is not a tty don't write in tty-mode either.\n  TerminalDisplayUnix::TerminalDisplayUnix():\n    TerminalDisplay(TerminalConfigUnix::Get().IsInteractive()),\n    fIsAttached(false), fNColors(16), fOutputID(STDOUT_FILENO)\n  {\n    if (::isatty(::fileno(stdin)) && !::isatty(fOutputID)) {\n      \/\/ Display prompt, even if stdout is going somewhere else\n      fOutputID = ::open(\"\/dev\/tty\", O_WRONLY);\n      SetIsTTY(true);\n    }\n\n    HandleResizeSignal(); \/\/ needs fOutputID\n    gTerminalDisplayUnix() = this;\n    signal(SIGWINCH, TerminalDisplayUnix__handleResizeSignal);\n#ifdef TCSANOW\n    TerminalConfigUnix::Get().TIOS()->c_lflag &= ~(ECHO);\n    TerminalConfigUnix::Get().TIOS()->c_lflag |= ECHOCTL|ECHOKE|ECHOE;\n#endif\n    const char* TERM = getenv(\"TERM\");\n    if (TERM &&  strstr(TERM, \"256\")) {\n      fNColors = 256;\n    }\n  }\n\n  static void syncOut(int fd) {\n    ::fflush(stdout);\n  }\n\n  TerminalDisplayUnix::~TerminalDisplayUnix() {\n    Detach();\n    if (fOutputID != STDOUT_FILENO) {\n      syncOut(fOutputID);\n      ::close(fOutputID);\n    }\n  }\n\n  void\n  TerminalDisplayUnix::HandleResizeSignal() {\n#ifdef TIOCGWINSZ\n    struct winsize sz;\n    int ret = ioctl(fOutputID, TIOCGWINSZ, (char*)&sz);\n    if (!ret && sz.ws_col) {\n      SetWidth(sz.ws_col);\n\n      \/\/ Export what we found.\n      std::stringstream s;\n      s << sz.ws_col;\n      setenv(\"COLUMS\", s.str().c_str(), 1 \/*overwrite*\/);\n      s.clear();\n      s << sz.ws_row;\n      setenv(\"LINES\", s.str().c_str(), 1 \/*overwrite*\/);\n    }\n#else\n    \/\/ try $COLUMNS\n    const char* COLUMNS = getenv(\"COLUMNS\");\n    if (COLUMNS) {\n      long width = atol(COLUMNS);\n      if (width > 4 && width < 1024*16) {\n        SetWidth(width);\n      }\n    }\n#endif\n  }\n\n  void\n  TerminalDisplayUnix::SetColor(char CIdx, const Color& C) {\n    if (!IsTTY()) return;\n\n    \/\/ Default color, reset previous bold etc.\n    static const char text[] = {(char)0x1b, '[', '0', 'm'};\n    WriteRawString(text, sizeof(text));\n\n    if (CIdx == 0) return;\n\n    if (fNColors == 256) {\n      int ANSIIdx = GetClosestColorIdx256(C);\n      static const char preamble[] = {'\\x1b', '[', '3', '8', ';', '5', ';', 0};\n      std::string buf(preamble);\n      if (ANSIIdx > 100) {\n        buf += '0' + (ANSIIdx \/ 100);\n      }\n      if (ANSIIdx > 10) {\n        buf += '0' + ((ANSIIdx \/ 10) % 10);\n      }\n      buf += '0' + (ANSIIdx % 10);\n      buf +=  \"m\";\n      WriteRawString(buf.c_str(), buf.length());\n    } else {\n      int ANSIIdx = GetClosestColorIdx16(C);\n      char buf[] = {'\\x1b', '[', '3', static_cast<char>('0' + (ANSIIdx % 8)), 'm', 0};\n      if (ANSIIdx > 7) buf[2] += 6;\n      WriteRawString(buf, 5);\n    }\n\n    if (C.fModifiers & Color::kModUnderline) {\n      WriteRawString(\"\\033[4m\", 4);\n    }\n    if (C.fModifiers & Color::kModBold) {\n      WriteRawString(\"\\033[1m\", 4);\n    }\n    if (C.fModifiers & Color::kModInverse) {\n      WriteRawString(\"\\033[7m\", 4);\n    }\n\n  }\n\n  void\n  TerminalDisplayUnix::MoveFront() {\n    static const char text[] = {(char)0x1b, '[', '1', 'G'};\n    if (!IsTTY()) return;\n    WriteRawString(text, sizeof(text));\n  }\n\n  void\n  TerminalDisplayUnix::MoveInternal(char What, size_t n) {\n    static const char cmd[] = \"\\x1b[\";\n    if (!IsTTY()) return;\n    std::string text;\n    for (size_t i = 0; i < n; ++i) {\n      text += cmd;\n      text += What;\n    }\n    WriteRawString(text.c_str(), text.length());\n  }\n\n  void\n  TerminalDisplayUnix::MoveUp(size_t nLines \/* = 1 *\/) {\n    MoveInternal('A', nLines);\n  }\n\n  void\n  TerminalDisplayUnix::MoveDown(size_t nLines \/* = 1 *\/) {\n    MoveInternal('B', nLines);\n  }\n\n  void\n  TerminalDisplayUnix::MoveRight(size_t nCols \/* = 1 *\/) {\n    MoveInternal('C', nCols);\n  }\n\n  void\n  TerminalDisplayUnix::MoveLeft(size_t nCols \/* = 1 *\/) {\n    MoveInternal('D', nCols);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ Erases the input to the right of the cursor.\n  void\n  TerminalDisplayUnix::EraseToRight() {\n    static const char text[] = {(char)0x1b, '[', 'K'}; \/\/ ESC[K\n    if (!IsTTY()) return;\n    WriteRawString(text, sizeof(text));\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ Writes out a raw string to stdout.\n  \/\/\/\n  \/\/\/ \\param[in] text raw string to be written out\n  \/\/\/ \\param[in] len length of the raw string\n  void\n  TerminalDisplayUnix::WriteRawString(const char *text, size_t len) {\n    if (write(fOutputID, text, len) == -1) {\n      \/\/ Silence Ubuntu's \"unused result\". We don't care if it fails.\n    }\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ Invoke this on EOL. Writes out space backspace, to wrap to the next line.\n  \/\/\/ Otherwise, we stay on the same line and the input gets pushed upwards.\n  void\n  TerminalDisplayUnix::ActOnEOL() {\n    if (!IsTTY()) return;\n    WriteRawString(\" \\b\", 2);\n    \/\/MoveUp();\n  }\n\n  void\n  TerminalDisplayUnix::Attach() {\n    \/\/ set to noecho\n    if (fIsAttached) return;\n    syncOut(fOutputID);\n    TerminalConfigUnix::Get().Attach();\n    fWritePos = Pos();\n    fWriteLen = 0;\n    fIsAttached = true;\n  }\n\n  void\n  TerminalDisplayUnix::Detach() {\n    if (!fIsAttached) return;\n    syncOut(fOutputID);\n    TerminalConfigUnix::Get().Detach();\n    TerminalDisplay::Detach();\n    fIsAttached = false;\n  }\n\n  int\n  TerminalDisplayUnix::GetClosestColorIdx16(const Color& C) {\n    int r = C.fR;\n    int g = C.fG;\n    int b = C.fB;\n    int sum = r + g + b;\n    r = r > sum \/ 4;\n    g = g > sum \/ 4;\n    b = b > sum \/ 4;\n\n    \/\/ ANSI:\n    return r + (g * 2) + (b * 4);\n    \/\/ ! ANSI:\n    \/\/ return (r * 4) + (g * 2) + b;\n  }\n\n  int\n  TerminalDisplayUnix::GetClosestColorIdx256(const Color& C) {\n    static unsigned char rgb256[256][3] = {{0}};\n    if (rgb256[0][0] == 0) {\n      InitRGB256(rgb256);\n    }\n\n    \/\/ Find the closest index.\n    \/\/ A: the closest color match (square of geometric distance in RGB)\n    \/\/ B: the closest brightness match\n    \/\/ Treat them equally, which suppresses differences\n    \/\/ in color due to squared distance.\n\n    \/\/ start with black:\n    int idx = 0;\n    unsigned int r = C.fR;\n    unsigned int g = C.fG;\n    unsigned int b = C.fB;\n    unsigned int graylvl = (r + g + b)\/3;\n    long mindelta = (r*r + g*g + b*b) + graylvl;\n    if (mindelta) {\n      for (unsigned int i = 0; i < 256; ++i) {\n        long delta = (rgb256[i][0] + rgb256[i][1] + rgb256[i][2])\/3 - graylvl;\n        if (delta < 0) delta = -delta;\n        delta += (r-rgb256[i][0])*(r-rgb256[i][0]) +\n        (g-rgb256[i][1])*(g-rgb256[i][1]) +\n        (b-rgb256[i][2])*(b-rgb256[i][2]);\n\n        if (delta < mindelta) {\n          mindelta = delta;\n          idx = i;\n          if (mindelta == 0) break;\n        }\n      }\n    }\n    return idx;\n  }\n\n}\n\n#endif \/\/ #ifndef _WIN32\n<commit_msg>Silence unused param warning, if this is what this should do?<commit_after>#ifndef _WIN32\n\n\/\/===--- TerminalDisplayUnix.cpp - Output To UNIX Terminal ------*- 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 interface for writing to a UNIX terminal. It tries to\n\/\/  support all \"common\" terminal types.\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"textinput\/TerminalDisplayUnix.h\"\n\n#include <fcntl.h>\n#include <stdio.h>\n\/\/ putenv not in cstdlib on Solaris\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/ioctl.h>\n#include <termios.h>\n#include <csignal>\n#include <cstring>\n#include <sstream>\n#include <string>\n\n#include \"textinput\/Color.h\"\n#include \"textinput\/Display.h\"\n#include \"textinput\/TerminalConfigUnix.h\"\n\nusing std::signal;\nusing std::strstr;\n\nnamespace {\n  textinput::TerminalDisplayUnix*& gTerminalDisplayUnix() {\n    static textinput::TerminalDisplayUnix* S = 0;\n    return S;\n  }\n\n  void InitRGB256(unsigned char rgb256[][3]) {\n    \/\/ initialize the array with the expected standard colors:\n    \/\/ (from http:\/\/frexx.de\/xterm-256-notes)\n\n    \/\/ this is not what I see, though it's supposedly the default:\n    \/\/   rgb[0][0] =   0; rgb[0][1] =   0; rgb[0][1] =   0;\n    \/\/ use this instead, just to be on the safe side:\n    rgb256[0][0] =  46; rgb256[0][1] =  52; rgb256[0][2] =  64;\n    rgb256[1][0] = 205; rgb256[1][1] =   0; rgb256[1][2] =   0;\n    rgb256[2][0] =   0; rgb256[2][1] = 205; rgb256[2][2] =   0;\n    rgb256[3][0] = 205; rgb256[3][1] = 205; rgb256[3][2] =   0;\n    rgb256[4][0] =   0; rgb256[4][1] =   0; rgb256[4][2] = 238;\n    rgb256[5][0] = 205; rgb256[5][1] =   0; rgb256[5][2] = 205;\n    rgb256[6][0] =   0; rgb256[6][1] = 205; rgb256[6][2] = 205;\n    rgb256[7][0] = 229; rgb256[7][1] = 229; rgb256[7][2] = 229;\n\n    \/\/ this is not what I see, though it's supposedly the default:\n    \/\/   rgb256[ 8][0] = 127; rgb256[ 8][1] = 127; rgb256[ 8][1] = 127;\n    \/\/ use this instead, just to be on the safe side:\n    rgb256[ 8][0] =   0; rgb256[ 8][1] =   0; rgb256[ 8][2] =   0;\n    rgb256[ 9][0] = 255; rgb256[ 9][1] =   0; rgb256[ 9][2] =   0;\n    rgb256[10][0] =   0; rgb256[10][1] = 255; rgb256[10][2] =   0;\n    rgb256[11][0] = 255; rgb256[11][1] = 255; rgb256[11][2] =   0;\n    rgb256[12][0] =  92; rgb256[12][1] =  92; rgb256[12][2] = 255;\n    rgb256[13][0] = 255; rgb256[13][1] =   0; rgb256[13][2] = 255;\n    rgb256[14][0] =   0; rgb256[14][1] = 255; rgb256[14][2] = 255;\n    rgb256[15][0] = 255; rgb256[15][1] = 255; rgb256[15][2] = 255;\n\n    \/\/ 6 intensity RGB\n    static const int intensities[] = {0, 0x5f, 0x87, 0xaf, 0xd7, 0xff};\n    int idx = 16;\n    for (int r = 0; r < 6; ++r) {\n      for (int g = 0; g < 6; ++g) {\n        for (int b = 0; b < 6; ++b) {\n          rgb256[idx][0] = intensities[r];\n          rgb256[idx][1] = intensities[g];\n          rgb256[idx][2] = intensities[b];\n          ++idx;\n        }\n      }\n    }\n\n    \/\/ colors 232-255 are a grayscale ramp, intentionally leaving out\n    \/\/ black and white\n    for (unsigned char gray = 0; gray < 24; ++gray) {\n      unsigned char level = (gray * 10) + 8;\n      rgb256[232 + gray][0] = level;\n      rgb256[232 + gray][1] = level;\n      rgb256[232 + gray][2] = level;\n    }\n  }\n} \/\/ unnamed namespace\n\nextern \"C\" void TerminalDisplayUnix__handleResizeSignal(int) {\n  gTerminalDisplayUnix()->HandleResizeSignal();\n}\n\nnamespace textinput {\n  \/\/ If input is not a tty don't write in tty-mode either.\n  TerminalDisplayUnix::TerminalDisplayUnix():\n    TerminalDisplay(TerminalConfigUnix::Get().IsInteractive()),\n    fIsAttached(false), fNColors(16), fOutputID(STDOUT_FILENO)\n  {\n    if (::isatty(::fileno(stdin)) && !::isatty(fOutputID)) {\n      \/\/ Display prompt, even if stdout is going somewhere else\n      fOutputID = ::open(\"\/dev\/tty\", O_WRONLY);\n      SetIsTTY(true);\n    }\n\n    HandleResizeSignal(); \/\/ needs fOutputID\n    gTerminalDisplayUnix() = this;\n    signal(SIGWINCH, TerminalDisplayUnix__handleResizeSignal);\n#ifdef TCSANOW\n    TerminalConfigUnix::Get().TIOS()->c_lflag &= ~(ECHO);\n    TerminalConfigUnix::Get().TIOS()->c_lflag |= ECHOCTL|ECHOKE|ECHOE;\n#endif\n    const char* TERM = getenv(\"TERM\");\n    if (TERM &&  strstr(TERM, \"256\")) {\n      fNColors = 256;\n    }\n  }\n\n  static void syncOut(int \/*fd*\/) {\n    ::fflush(stdout);\n  }\n\n  TerminalDisplayUnix::~TerminalDisplayUnix() {\n    Detach();\n    if (fOutputID != STDOUT_FILENO) {\n      syncOut(fOutputID);\n      ::close(fOutputID);\n    }\n  }\n\n  void\n  TerminalDisplayUnix::HandleResizeSignal() {\n#ifdef TIOCGWINSZ\n    struct winsize sz;\n    int ret = ioctl(fOutputID, TIOCGWINSZ, (char*)&sz);\n    if (!ret && sz.ws_col) {\n      SetWidth(sz.ws_col);\n\n      \/\/ Export what we found.\n      std::stringstream s;\n      s << sz.ws_col;\n      setenv(\"COLUMS\", s.str().c_str(), 1 \/*overwrite*\/);\n      s.clear();\n      s << sz.ws_row;\n      setenv(\"LINES\", s.str().c_str(), 1 \/*overwrite*\/);\n    }\n#else\n    \/\/ try $COLUMNS\n    const char* COLUMNS = getenv(\"COLUMNS\");\n    if (COLUMNS) {\n      long width = atol(COLUMNS);\n      if (width > 4 && width < 1024*16) {\n        SetWidth(width);\n      }\n    }\n#endif\n  }\n\n  void\n  TerminalDisplayUnix::SetColor(char CIdx, const Color& C) {\n    if (!IsTTY()) return;\n\n    \/\/ Default color, reset previous bold etc.\n    static const char text[] = {(char)0x1b, '[', '0', 'm'};\n    WriteRawString(text, sizeof(text));\n\n    if (CIdx == 0) return;\n\n    if (fNColors == 256) {\n      int ANSIIdx = GetClosestColorIdx256(C);\n      static const char preamble[] = {'\\x1b', '[', '3', '8', ';', '5', ';', 0};\n      std::string buf(preamble);\n      if (ANSIIdx > 100) {\n        buf += '0' + (ANSIIdx \/ 100);\n      }\n      if (ANSIIdx > 10) {\n        buf += '0' + ((ANSIIdx \/ 10) % 10);\n      }\n      buf += '0' + (ANSIIdx % 10);\n      buf +=  \"m\";\n      WriteRawString(buf.c_str(), buf.length());\n    } else {\n      int ANSIIdx = GetClosestColorIdx16(C);\n      char buf[] = {'\\x1b', '[', '3', static_cast<char>('0' + (ANSIIdx % 8)), 'm', 0};\n      if (ANSIIdx > 7) buf[2] += 6;\n      WriteRawString(buf, 5);\n    }\n\n    if (C.fModifiers & Color::kModUnderline) {\n      WriteRawString(\"\\033[4m\", 4);\n    }\n    if (C.fModifiers & Color::kModBold) {\n      WriteRawString(\"\\033[1m\", 4);\n    }\n    if (C.fModifiers & Color::kModInverse) {\n      WriteRawString(\"\\033[7m\", 4);\n    }\n\n  }\n\n  void\n  TerminalDisplayUnix::MoveFront() {\n    static const char text[] = {(char)0x1b, '[', '1', 'G'};\n    if (!IsTTY()) return;\n    WriteRawString(text, sizeof(text));\n  }\n\n  void\n  TerminalDisplayUnix::MoveInternal(char What, size_t n) {\n    static const char cmd[] = \"\\x1b[\";\n    if (!IsTTY()) return;\n    std::string text;\n    for (size_t i = 0; i < n; ++i) {\n      text += cmd;\n      text += What;\n    }\n    WriteRawString(text.c_str(), text.length());\n  }\n\n  void\n  TerminalDisplayUnix::MoveUp(size_t nLines \/* = 1 *\/) {\n    MoveInternal('A', nLines);\n  }\n\n  void\n  TerminalDisplayUnix::MoveDown(size_t nLines \/* = 1 *\/) {\n    MoveInternal('B', nLines);\n  }\n\n  void\n  TerminalDisplayUnix::MoveRight(size_t nCols \/* = 1 *\/) {\n    MoveInternal('C', nCols);\n  }\n\n  void\n  TerminalDisplayUnix::MoveLeft(size_t nCols \/* = 1 *\/) {\n    MoveInternal('D', nCols);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ Erases the input to the right of the cursor.\n  void\n  TerminalDisplayUnix::EraseToRight() {\n    static const char text[] = {(char)0x1b, '[', 'K'}; \/\/ ESC[K\n    if (!IsTTY()) return;\n    WriteRawString(text, sizeof(text));\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ Writes out a raw string to stdout.\n  \/\/\/\n  \/\/\/ \\param[in] text raw string to be written out\n  \/\/\/ \\param[in] len length of the raw string\n  void\n  TerminalDisplayUnix::WriteRawString(const char *text, size_t len) {\n    if (write(fOutputID, text, len) == -1) {\n      \/\/ Silence Ubuntu's \"unused result\". We don't care if it fails.\n    }\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/\/ Invoke this on EOL. Writes out space backspace, to wrap to the next line.\n  \/\/\/ Otherwise, we stay on the same line and the input gets pushed upwards.\n  void\n  TerminalDisplayUnix::ActOnEOL() {\n    if (!IsTTY()) return;\n    WriteRawString(\" \\b\", 2);\n    \/\/MoveUp();\n  }\n\n  void\n  TerminalDisplayUnix::Attach() {\n    \/\/ set to noecho\n    if (fIsAttached) return;\n    syncOut(fOutputID);\n    TerminalConfigUnix::Get().Attach();\n    fWritePos = Pos();\n    fWriteLen = 0;\n    fIsAttached = true;\n  }\n\n  void\n  TerminalDisplayUnix::Detach() {\n    if (!fIsAttached) return;\n    syncOut(fOutputID);\n    TerminalConfigUnix::Get().Detach();\n    TerminalDisplay::Detach();\n    fIsAttached = false;\n  }\n\n  int\n  TerminalDisplayUnix::GetClosestColorIdx16(const Color& C) {\n    int r = C.fR;\n    int g = C.fG;\n    int b = C.fB;\n    int sum = r + g + b;\n    r = r > sum \/ 4;\n    g = g > sum \/ 4;\n    b = b > sum \/ 4;\n\n    \/\/ ANSI:\n    return r + (g * 2) + (b * 4);\n    \/\/ ! ANSI:\n    \/\/ return (r * 4) + (g * 2) + b;\n  }\n\n  int\n  TerminalDisplayUnix::GetClosestColorIdx256(const Color& C) {\n    static unsigned char rgb256[256][3] = {{0}};\n    if (rgb256[0][0] == 0) {\n      InitRGB256(rgb256);\n    }\n\n    \/\/ Find the closest index.\n    \/\/ A: the closest color match (square of geometric distance in RGB)\n    \/\/ B: the closest brightness match\n    \/\/ Treat them equally, which suppresses differences\n    \/\/ in color due to squared distance.\n\n    \/\/ start with black:\n    int idx = 0;\n    unsigned int r = C.fR;\n    unsigned int g = C.fG;\n    unsigned int b = C.fB;\n    unsigned int graylvl = (r + g + b)\/3;\n    long mindelta = (r*r + g*g + b*b) + graylvl;\n    if (mindelta) {\n      for (unsigned int i = 0; i < 256; ++i) {\n        long delta = (rgb256[i][0] + rgb256[i][1] + rgb256[i][2])\/3 - graylvl;\n        if (delta < 0) delta = -delta;\n        delta += (r-rgb256[i][0])*(r-rgb256[i][0]) +\n        (g-rgb256[i][1])*(g-rgb256[i][1]) +\n        (b-rgb256[i][2])*(b-rgb256[i][2]);\n\n        if (delta < mindelta) {\n          mindelta = delta;\n          idx = i;\n          if (mindelta == 0) break;\n        }\n      }\n    }\n    return idx;\n  }\n\n}\n\n#endif \/\/ #ifndef _WIN32\n<|endoftext|>"}
{"text":"<commit_before>\/\/ CommonFunc.cpp -- source file\n\/*\n * Author: Ivan Chapkailo (septimomend)\n * Date:   02.07.2017\n *\n * © 2017 Ivan Chapkailo. All rights reserved\n * e-mail: chapkailo.ivan@gmail.com\n *\/\n\n#include \"stdafx.h\"\n#include \"CommonFunc.h\"\n\nCommon::Common()\n{\n  m_All = tml.getAllControllerObj();\n  m_pCnfg = m_All->getConfigObj();\n}\n\nCommon::Common(AllControllers* all) : m_pCnfg(all->getConfigObj())\n{\n}\n\nvoid Common::openFile(char *filename)\n{\n  \/\/ TODO\n}\n\nvoid Common::save()\n{\n  \/\/ TODO\n}\n\nvoid Common::find()\n{\n  \/\/ TODO\n}\n\nvoid Common::drawRows(Adbfr* abfr);\n{\n  \/\/ TODO\n}\n\nvoid Common::drawStatusBar(Adbfr* abfr)\n{\n  \/\/ TODO\n}\n\nvoid Common::drawMessageBar(Adbfr* abfr)\n{\n  \/\/ TODO\n}\n\nvoid Common::scrolling()\n{\n  \/\/ TODO\n}\n\nvoid Common::statusMsg(const char *fmt, ...)\n{\n  va_list arg;         \/\/ for unknown number of parameters\n  va_start(arg, fmt);  \/\/ initialize arg\n  vsnprintf(cnfg.statusMessage, sizeof(cnfg.statusMessage), fmt, arg); \/\/ output parameters to statusMessage\n  va_end(arg); \/\/ end\n  cnfg.statusMessageTime = time(NULL); \/\/ gets time\n}\n\nvoid Common::updateScreen()\n{\n  scrolling();\n\n  m_abfr = ADBFR_IMPL; \/\/ implement to NULL\n\n  m_abfr.reallocateBfr(\"\\x1b[?25l\", 6); \/\/ reallocate data\n  m_abfr.reallocateBfr(\"\\x1b[H\", 3);    \/\/ reallocate data\n\n  \/*\n   * draw rows, message bar and status bar\n   *\/\n  drawRows(&m_abfr);\n  drawStatusBar(&m_abfr);\n  drawMessageBar(&m_abfr);\n\n  \/*\n   * write to buff cursor | position\n   *\/\n  char buff[32];\n  snprintf(buff, sizeof(buff), \"\\x1b[%d;%dH\", (m_pCnfg->configY - m_pCnfg->disableRow) + 1, (m_pCnfg->rowX - m_pCnfg->disableClr) + 1);\n  m_abfr.reallocateBfr(buff, strlen(buff));\n\n  m_abfr.reallocateBfr(\"\\x1b[?25h\", 6);\n\n  \/*\n   * update screen\n   *\/\n  write(STDOUT_FILENO, ab.b, ab.len);\n  m_abfr.freeBfr(); \/\/ free memory\n}\n\nchar* Common::callPrompt(char *prompt, void (*callback)(char*, int))\n{\n  size_t buffsize = 128;\n  char* bfr = malloc(buffsize); \/\/ allocate memory\n\n  size_t bufflen = 0;           \/\/ lenght\n  bfr[0] = '\\0';\n\n  while (1)\n  {\n    statusMsg(prompt, bfr); \/\/ set prompt\n    updateScreen();         \/\/ and update screen\n\n    int key = tml.whatKey();  \/\/ read key\n\n    if (key == DELETE_KEY || key == CTRL_KEY('h') || key == BACKSPACE)\n    {\n      if (bufflen != 0)         \/\/ if buffer is not empty\n        bfr[--bufflen] = '\\0';  \/\/ set end of row\n    }\n    else if (key == '\\x1b')     \/\/ if this is ESC\n    {\n      statusMsg(\"\");          \/\/ erase\n      if (callback)           \/\/ if callback is not NULL\n        callback(bfr, key);   \/\/ call func for callback which pointed by callback()\n      free(bfr);              \/\/ free memory\n      return NULL;            \/\/ and cancel\n    }\n    else if (key == '\\r')     \/\/ if carriage return (move the cursor at the start of the line)\n    {\n      if (bufflen != 0)       \/\/ and bufflen is not empty\n      {\n        statusMsg(\"\");        \/\/ clean message\n        if (callback)\n          callback(bfr, key); \/\/ and get callback\n        return bfr;           \/\/ returning of buffer\n      }\n    }\n    else if (!iscntrl(key) && key < 128) \/\/ checks, whether the argument, transmitted via the parameter сharacter, control character\n    {\n      \/*\n       * reallocation of buffer if needs\n       *\/\n      if (bufflen == buffsize - 1)\n      {\n        buffsize *= 2;\n        bfr = realloc(bfr, buffsize);\n      }\n      bfr[bufflen++] = key; \/\/ write this key to buffer\n      bfr[bufflen] = '\\0';  \/\/ and end of row\n    }\n\n    if (callback)\n      callback(bfr, key);   \/\/ call of callback\n  }\n}\n\nvoid Common::moveCursor(int key)\n{\n  \/\/ instancing RowController\n  \/\/ if empty - to zero position, else to the end of row\n  \/\/\n  RowController* pRowctrl = (m_pCnfg->configY >= m_pCnfg->rowCount) ? NULL : &m_pCnfg->pRowObj[m_pCnfg->configY];\n\n  switch (key)\n  {\n    case ARROW_LEFT:\n      if (m_pCnfg->configX != 0)                                    \/\/ if horizontal position isn't zero\n      {\n        m_pCnfg->configX--;                                         \/\/ move left\n      }\n      else if (m_pCnfg->configY > 0)                                \/\/ else if there is at least 1 row\n      {\n        m_pCnfg->configY--;                                         \/\/ move to that row\n        m_pCnfg->configX = m_pCnfg->pRowObj[m_pCnfg->configY].size; \/\/ and to the end of that row\n      }\n      break;\n    case ARROW_RIGHT:\n      if (pRowctrl && m_pCnfg->configX < pRowctrl->size)            \/\/ if there is row and if cursor is not in the end of row\n      {\n        m_pCnfg->configX++;                                         \/\/ move cursor right along of row\n      }\n      else if (pRowctrl && m_pCnfg->configX == pRowctrl->size)      \/\/ if there is row and cursor in the end of this row\n      {\n        m_pCnfg->configY++;                                         \/\/ move to next row\n        E.cx = 0;                                                   \/\/ on zero position\n      }\n      break;\n    case ARROW_UP:\n      if (m_pCnfg->configY != 0)                                    \/\/ if there is at least 1 row\n      {\n        m_pCnfg->configY--;                                         \/\/ move up\n      }\n      break;\n    case ARROW_DOWN:\n      if (m_pCnfg->configY < m_pCnfg->rowCount)                     \/\/ if cursor is not on last row\n      {\n        m_pCnfg->configY++;                                         \/\/ move down\n      }\n      break;\n  }\n}\n\nvoid Common::processingKeypress()\n{\n  static int sQuitCounter = EDITORRMEND_QUIT_COUNTER;                \/\/ counter clicking for exit\n\n  int key = whatKey();                                               \/\/ read key\n\n  switch (key)\n  {\n    case '\\r':                                                       \/\/ if carriage return (Enter key)\n      setNewline();                                                   \/\/ set newline\n      break;\n\n    case CTRL_KEY('q'):\n      if (m_pCnfg->smear && sQuitCounter > 0)                        \/\/ if there is any changes and counter > 0\n      {\n        statusMsg(\"! File was changed and unsaved and data can be lost after exiting. \"\n                  \"Press Ctrl-Q %d more times to exit.\", sQuitCounter);\n        sQuitCounter--;                                              \/\/ counter decrement\n        return;\n      }\n      write(STDOUT_FILENO, \"\\x1b[2J\", 4);\n      write(STDOUT_FILENO, \"\\x1b[H\", 3);\n      exit(0);\n      break;\n\n    case CTRL_KEY('s'):\n      save();                                                       \/\/ TODO: save changes\n      break;\n\n    case HOME_KEY:\n    m_pCnfg->configX = 0;                                           \/\/ to the row beginning\n      break;\n\n    case END_KEY:\n      if (m_pCnfg->configY < m_pCnfg->rowCount)                     \/\/ if not last row\n        m_pCnfg->configX = m_pCnfg->pRowObj[m_pCnfg->configY].size; \/\/ to the end of row\n      break;\n\n    case CTRL_KEY('f'):\n      find();                                                       \/\/ find func\n      break;\n\n    case BACKSPACE:\n    case CTRL_KEY('h'):\n    case DELETE_KEY:\n      if (key == DELETE_KEY)\n        moveCursor(ARROW_RIGHT);                                    \/\/ move cursor right\n      deleteChar();                                                 \/\/ delete char\n      break;\n\n    \/\/ page up\/down\n    \/\/\n    case PAGE_UP:\n    case PAGE_DOWN:\n      {\n        if (key == PAGE_UP)\n        {\n          m_pCnfg->configY = m_pCnfg->disableRow;                    \/\/ move page up\n        }\n        else if (key == PAGE_DOWN)\n        {\n          m_pCnfg->configY = m_pCnfg->disableRow + m_pCnfg->enableRow - 1; \/\/ move page down\n          if (m_pCnfg->configY > m_pCnfg->rowCount)\n            m_pCnfg->configY = m_pCnfg->rowCount;\n        }\n\n        int times = m_pCnfg->enableRow;\n        while (times--)\n          moveCursor(key == PAGE_UP ? ARROW_UP : ARROW_DOWN);\n      }\n      break;\n\n    case ARROW_UP:\n    case ARROW_DOWN:\n    case ARROW_LEFT:\n    case ARROW_RIGHT:\n      moveCursor(key);\n      break;\n\n    case CTRL_KEY('l'):\n    case '\\x1b':\n      break;\n\n    default:\n      setChar(key);   \/\/ just write chars\n      break;\n  }\n\n  sQuitCounter = EDITORRMEND_QUIT_COUNTER;\n}\n<commit_msg>openFile() function is defined<commit_after>\/\/ CommonFunc.cpp -- source file\n\/*\n * Author: Ivan Chapkailo (septimomend)\n * Date:   02.07.2017\n *\n * © 2017 Ivan Chapkailo. All rights reserved\n * e-mail: chapkailo.ivan@gmail.com\n *\/\n\n#include \"stdafx.h\"\n#include \"CommonFunc.h\"\n\nCommon::Common()\n{\n  m_All = tml.getAllControllerObj();\n  m_pCnfg = m_All->getConfigObj();\n}\n\nCommon::Common(AllControllers* all) : m_pCnfg(all->getConfigObj())\n{\n}\n\nvoid Common::openFile(char *filename)\n{\n  free(m_pCnfg->pFilename);                                                       \/\/ free pFilename becouse strdup uses malloc and in next func\n                                                                                  \/\/ call need to free memory\n  m_pCnfg->pFilename = strdup(filename);                                          \/\/ duplicate filename to pFilename\n\n  m_All->pickSyntaxClr();\n\n  FILE* fln = fopen(filename, \"r\");                                                \/\/ open file foe reading\n  if (!fln)                                                                        \/\/ if can't to open file\n    tml.emergencyDestruction(\"fopen\");                                            \/\/ forced closure\n\n  char* pStr = NULL;\n  size_t strUSZ = 0;                                                              \/\/ size\n  ssize_t strSSZ;                                                                 \/\/ signed size\n  while ((strSSZ = getline(&pStr, &strUSZ, fln)) != -1)                            \/\/ while strUSZ size of pStr that reads from file fp\n  {\n    while (strSSZ > 0 && (pStr[strSSZ - 1] == '\\n' || pStr[strSSZ - 1] == '\\r'))  \/\/ if this is end of line\n      strSSZ--;                                                                   \/\/ decrease line size\n    m_pCnfg->setRow(m_pCnfg->rowCount, pStr, strSSZ);                             \/\/ set rows from file\n  }\n  free(pStr);\n  fclose(fln);                                                                    \/\/ close file\n  m_pCnfg->smear = 0;                                                             \/\/ no changes in now opened file\n}\n\nvoid Common::save()\n{\n  \/\/ TODO\n}\n\nvoid Common::find()\n{\n  \/\/ TODO\n}\n\nvoid Common::drawRows(Adbfr* abfr);\n{\n  \/\/ TODO\n}\n\nvoid Common::drawStatusBar(Adbfr* abfr)\n{\n  \/\/ TODO\n}\n\nvoid Common::drawMessageBar(Adbfr* abfr)\n{\n  \/\/ TODO\n}\n\nvoid Common::scrolling()\n{\n  \/\/ TODO\n}\n\nvoid Common::statusMsg(const char *fmt, ...)\n{\n  va_list arg;         \/\/ for unknown number of parameters\n  va_start(arg, fmt);  \/\/ initialize arg\n  vsnprintf(cnfg.statusMessage, sizeof(cnfg.statusMessage), fmt, arg); \/\/ output parameters to statusMessage\n  va_end(arg); \/\/ end\n  cnfg.statusMessageTime = time(NULL); \/\/ gets time\n}\n\nvoid Common::updateScreen()\n{\n  scrolling();\n\n  m_abfr = ADBFR_IMPL; \/\/ implement to NULL\n\n  m_abfr.reallocateBfr(\"\\x1b[?25l\", 6); \/\/ reallocate data\n  m_abfr.reallocateBfr(\"\\x1b[H\", 3);    \/\/ reallocate data\n\n  \/*\n   * draw rows, message bar and status bar\n   *\/\n  drawRows(&m_abfr);\n  drawStatusBar(&m_abfr);\n  drawMessageBar(&m_abfr);\n\n  \/*\n   * write to buff cursor | position\n   *\/\n  char buff[32];\n  snprintf(buff, sizeof(buff), \"\\x1b[%d;%dH\", (m_pCnfg->configY - m_pCnfg->disableRow) + 1, (m_pCnfg->rowX - m_pCnfg->disableClr) + 1);\n  m_abfr.reallocateBfr(buff, strlen(buff));\n\n  m_abfr.reallocateBfr(\"\\x1b[?25h\", 6);\n\n  \/*\n   * update screen\n   *\/\n  write(STDOUT_FILENO, ab.b, ab.len);\n  m_abfr.freeBfr(); \/\/ free memory\n}\n\nchar* Common::callPrompt(char *prompt, void (*callback)(char*, int))\n{\n  size_t buffsize = 128;\n  char* bfr = malloc(buffsize); \/\/ allocate memory\n\n  size_t bufflen = 0;           \/\/ lenght\n  bfr[0] = '\\0';\n\n  while (1)\n  {\n    statusMsg(prompt, bfr); \/\/ set prompt\n    updateScreen();         \/\/ and update screen\n\n    int key = tml.whatKey();  \/\/ read key\n\n    if (key == DELETE_KEY || key == CTRL_KEY('h') || key == BACKSPACE)\n    {\n      if (bufflen != 0)         \/\/ if buffer is not empty\n        bfr[--bufflen] = '\\0';  \/\/ set end of row\n    }\n    else if (key == '\\x1b')     \/\/ if this is ESC\n    {\n      statusMsg(\"\");          \/\/ erase\n      if (callback)           \/\/ if callback is not NULL\n        callback(bfr, key);   \/\/ call func for callback which pointed by callback()\n      free(bfr);              \/\/ free memory\n      return NULL;            \/\/ and cancel\n    }\n    else if (key == '\\r')     \/\/ if carriage return (move the cursor at the start of the line)\n    {\n      if (bufflen != 0)       \/\/ and bufflen is not empty\n      {\n        statusMsg(\"\");        \/\/ clean message\n        if (callback)\n          callback(bfr, key); \/\/ and get callback\n        return bfr;           \/\/ returning of buffer\n      }\n    }\n    else if (!iscntrl(key) && key < 128) \/\/ checks, whether the argument, transmitted via the parameter сharacter, control character\n    {\n      \/*\n       * reallocation of buffer if needs\n       *\/\n      if (bufflen == buffsize - 1)\n      {\n        buffsize *= 2;\n        bfr = realloc(bfr, buffsize);\n      }\n      bfr[bufflen++] = key; \/\/ write this key to buffer\n      bfr[bufflen] = '\\0';  \/\/ and end of row\n    }\n\n    if (callback)\n      callback(bfr, key);   \/\/ call of callback\n  }\n}\n\nvoid Common::moveCursor(int key)\n{\n  \/\/ instancing RowController\n  \/\/ if empty - to zero position, else to the end of row\n  \/\/\n  RowController* pRowctrl = (m_pCnfg->configY >= m_pCnfg->rowCount) ? NULL : &m_pCnfg->pRowObj[m_pCnfg->configY];\n\n  switch (key)\n  {\n    case ARROW_LEFT:\n      if (m_pCnfg->configX != 0)                                    \/\/ if horizontal position isn't zero\n      {\n        m_pCnfg->configX--;                                         \/\/ move left\n      }\n      else if (m_pCnfg->configY > 0)                                \/\/ else if there is at least 1 row\n      {\n        m_pCnfg->configY--;                                         \/\/ move to that row\n        m_pCnfg->configX = m_pCnfg->pRowObj[m_pCnfg->configY].size; \/\/ and to the end of that row\n      }\n      break;\n    case ARROW_RIGHT:\n      if (pRowctrl && m_pCnfg->configX < pRowctrl->size)            \/\/ if there is row and if cursor is not in the end of row\n      {\n        m_pCnfg->configX++;                                         \/\/ move cursor right along of row\n      }\n      else if (pRowctrl && m_pCnfg->configX == pRowctrl->size)      \/\/ if there is row and cursor in the end of this row\n      {\n        m_pCnfg->configY++;                                         \/\/ move to next row\n        E.cx = 0;                                                   \/\/ on zero position\n      }\n      break;\n    case ARROW_UP:\n      if (m_pCnfg->configY != 0)                                    \/\/ if there is at least 1 row\n      {\n        m_pCnfg->configY--;                                         \/\/ move up\n      }\n      break;\n    case ARROW_DOWN:\n      if (m_pCnfg->configY < m_pCnfg->rowCount)                     \/\/ if cursor is not on last row\n      {\n        m_pCnfg->configY++;                                         \/\/ move down\n      }\n      break;\n  }\n}\n\nvoid Common::processingKeypress()\n{\n  static int sQuitCounter = EDITORRMEND_QUIT_COUNTER;                \/\/ counter clicking for exit\n\n  int key = whatKey();                                               \/\/ read key\n\n  switch (key)\n  {\n    case '\\r':                                                       \/\/ if carriage return (Enter key)\n      setNewline();                                                   \/\/ set newline\n      break;\n\n    case CTRL_KEY('q'):\n      if (m_pCnfg->smear && sQuitCounter > 0)                        \/\/ if there is any changes and counter > 0\n      {\n        statusMsg(\"! File was changed and unsaved and data can be lost after exiting. \"\n                  \"Press Ctrl-Q %d more times to exit.\", sQuitCounter);\n        sQuitCounter--;                                              \/\/ counter decrement\n        return;\n      }\n      write(STDOUT_FILENO, \"\\x1b[2J\", 4);\n      write(STDOUT_FILENO, \"\\x1b[H\", 3);\n      exit(0);\n      break;\n\n    case CTRL_KEY('s'):\n      save();                                                       \/\/ TODO: save changes\n      break;\n\n    case HOME_KEY:\n    m_pCnfg->configX = 0;                                           \/\/ to the row beginning\n      break;\n\n    case END_KEY:\n      if (m_pCnfg->configY < m_pCnfg->rowCount)                     \/\/ if not last row\n        m_pCnfg->configX = m_pCnfg->pRowObj[m_pCnfg->configY].size; \/\/ to the end of row\n      break;\n\n    case CTRL_KEY('f'):\n      find();                                                       \/\/ find func\n      break;\n\n    case BACKSPACE:\n    case CTRL_KEY('h'):\n    case DELETE_KEY:\n      if (key == DELETE_KEY)\n        moveCursor(ARROW_RIGHT);                                    \/\/ move cursor right\n      deleteChar();                                                 \/\/ delete char\n      break;\n\n    \/\/ page up\/down\n    \/\/\n    case PAGE_UP:\n    case PAGE_DOWN:\n      {\n        if (key == PAGE_UP)\n        {\n          m_pCnfg->configY = m_pCnfg->disableRow;                    \/\/ move page up\n        }\n        else if (key == PAGE_DOWN)\n        {\n          m_pCnfg->configY = m_pCnfg->disableRow + m_pCnfg->enableRow - 1; \/\/ move page down\n          if (m_pCnfg->configY > m_pCnfg->rowCount)\n            m_pCnfg->configY = m_pCnfg->rowCount;\n        }\n\n        int times = m_pCnfg->enableRow;\n        while (times--)\n          moveCursor(key == PAGE_UP ? ARROW_UP : ARROW_DOWN);\n      }\n      break;\n\n    case ARROW_UP:\n    case ARROW_DOWN:\n    case ARROW_LEFT:\n    case ARROW_RIGHT:\n      moveCursor(key);\n      break;\n\n    case CTRL_KEY('l'):\n    case '\\x1b':\n      break;\n\n    default:\n      setChar(key);   \/\/ just write chars\n      break;\n  }\n\n  sQuitCounter = EDITORRMEND_QUIT_COUNTER;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2016 DeepCortex GmbH <legal@eventql.io>\n * Authors:\n *   - Paul Asmuth <paul@eventql.io>\n *   - Laura Schlimmer <laura@eventql.io>\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 (\"the license\") as\n * published by the Free Software Foundation, either version 3 of the License,\n * or any later version.\n *\n * In accordance with Section 7(e) of the license, the licensing of the Program\n * under the license does not imply a trademark license. Therefore any rights,\n * title and interest in our trademarks remain entirely with us.\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 license for more details.\n *\n * You can be released from the requirements of the license by purchasing a\n * commercial license. Buying such a license is mandatory as soon as you develop\n * commercial activities involving this program without disclosing the source\n * code of your own applications\n *\/\n#include <algorithm>\n#include <eventql\/sql\/statements\/select\/orderby.h>\n#include <eventql\/sql\/expressions\/boolean.h>\n#include <eventql\/sql\/runtime\/runtime.h>\n#include <eventql\/util\/inspect.h>\n\nnamespace csql {\n\nOrderByExpression::OrderByExpression(\n    Transaction* txn,\n    ExecutionContext* execution_context,\n    Vector<SortExpr> sort_specs,\n    ScopedPtr<TableExpression> input) :\n    txn_(txn),\n    execution_context_(execution_context),\n    sort_specs_(std::move(sort_specs)),\n    input_(std::move(input)),\n    num_rows_(0),\n    pos_(0),\n    cnt_(0) {\n  if (sort_specs_.size() == 0) {\n    RAISE(kIllegalArgumentError, \"can't execute ORDER BY: no sort specs\");\n  }\n\n  execution_context_->incrementNumTasks();\n}\n\nReturnCode OrderByExpression::execute() {\n  auto rc = input_->execute();\n  if (!rc.isSuccess()) {\n    return rc;\n  }\n\n  execution_context_->incrementNumTasksRunning();\n\n  Vector<SVector> input_cols;\n  for (size_t i = 0; i < input_->getColumnCount(); ++i) {\n    input_cols.emplace_back(input_->getColumnType(i));\n  }\n\n  for (;;) {\n    for (auto& c : input_cols) {\n      c.clear();\n    }\n\n    size_t nrecords = 0;\n    {\n      auto rc = input_->nextBatch(input_cols.data(), &nrecords);\n      if (!rc.isSuccess()) {\n        RAISE(kRuntimeError, rc.getMessage());\n      }\n    }\n\n    if (nrecords == 0) {\n      break;\n    }\n\n    {\n      auto rc = txn_->triggerHeartbeat();\n      if (!rc.isSuccess()) {\n        RAISE(kRuntimeError, rc.getMessage());\n      }\n    }\n\n    Vector<void*> input_col_cursor;\n    for (const auto& c : input_cols) {\n      input_col_cursor.emplace_back((void*) c.getData());\n    }\n\n\n    for (size_t n = 0; n < nrecords; n++) {\n      rows_.emplace_back();\n      auto& row = rows_.back();\n\n      for (size_t i = 0; i < input_->getColumnCount(); ++i) {\n        row.emplace_back(input_->getColumnType(i));\n        row[i].copyFrom(input_col_cursor[i]);\n      }\n    }\n  }\n\n  num_rows_ = rows_.size();\n\n  std::sort(\n      rows_.begin(),\n      rows_.end(),\n      [this] (const Vector<SValue>& left, const Vector<SValue>& right) -> bool {\n    if (++cnt_ % 4096 == 0) {\n      auto rc = txn_->triggerHeartbeat();\n      if (!rc.isSuccess()) {\n        RAISE(kRuntimeError, rc.getMessage());\n      }\n    }\n\n    for (const auto& sort : sort_specs_) {\n      VM::evaluateBoxed(\n          txn_,\n          sort.expr.program(),\n          sort.expr.program()->method_call,\n          &vm_stack_,\n          nullptr,\n          left.size(),\n          left.data());\n\n      VM::evaluateBoxed(\n          txn_,\n          sort.expr.program(),\n          sort.expr.program()->method_call,\n          &vm_stack_,\n          nullptr,\n          right.size(),\n          right.data());\n\n      std::array<SValue, 2> args = {\n          sort.expr.program()->return_type,\n          sort.expr.program()->return_type };\n\n      popBoxed(&vm_stack_, &args[0]);\n      popBoxed(&vm_stack_, &args[1]);\n\n      SValue res(false);\n      expressions::eqExpr(Transaction::get(txn_), 2, args.data(), &res);\n      if (res.getBool()) {\n        continue;\n      }\n\n      if (sort.descending) {\n        expressions::gtExpr(Transaction::get(txn_), 2, args.data(), &res);\n      } else {\n        expressions::ltExpr(Transaction::get(txn_), 2, args.data(), &res);\n      }\n\n      return res.getBool();\n    }\n\n    \/* all dimensions equal *\/\n    return false;\n  });\n\n  return ReturnCode::success();\n}\n\nReturnCode OrderByExpression::nextBatch(\n    SVector* output,\n    size_t* nrecords) {\n  *nrecords = 0;\n\n  if (pos_ < num_rows_) {\n    auto batch_len = std::min(num_rows_ - pos_, kOutputBatchSize);\n    auto ncols = input_->getColumnCount();\n\n    for (size_t n = 0; n < batch_len; ++n) {\n      for (size_t i = 0; i < ncols; ++i) {\n        output[i].append(\n            rows_[pos_][i].getData(),\n            rows_[pos_][i].getSize());\n      }\n    }\n\n    *nrecords += batch_len;\n    pos_ += batch_len;\n    if (pos_ == num_rows_) {\n      execution_context_->incrementNumTasksCompleted();\n    }\n  }\n\n  return ReturnCode::success();\n}\n\nsize_t OrderByExpression::getColumnCount() const {\n  return input_->getColumnCount();\n}\n\nSType OrderByExpression::getColumnType(size_t idx) const {\n  return input_->getColumnType(idx);\n}\n\n} \/\/ namespace csql\n<commit_msg>fixed include<commit_after>\/**\n * Copyright (c) 2016 DeepCortex GmbH <legal@eventql.io>\n * Authors:\n *   - Paul Asmuth <paul@eventql.io>\n *   - Laura Schlimmer <laura@eventql.io>\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 (\"the license\") as\n * published by the Free Software Foundation, either version 3 of the License,\n * or any later version.\n *\n * In accordance with Section 7(e) of the license, the licensing of the Program\n * under the license does not imply a trademark license. Therefore any rights,\n * title and interest in our trademarks remain entirely with us.\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 license for more details.\n *\n * You can be released from the requirements of the license by purchasing a\n * commercial license. Buying such a license is mandatory as soon as you develop\n * commercial activities involving this program without disclosing the source\n * code of your own applications\n *\/\n#include <algorithm>\n#include <array>\n#include <eventql\/sql\/statements\/select\/orderby.h>\n#include <eventql\/sql\/expressions\/boolean.h>\n#include <eventql\/sql\/runtime\/runtime.h>\n#include <eventql\/util\/inspect.h>\n\nnamespace csql {\n\nOrderByExpression::OrderByExpression(\n    Transaction* txn,\n    ExecutionContext* execution_context,\n    Vector<SortExpr> sort_specs,\n    ScopedPtr<TableExpression> input) :\n    txn_(txn),\n    execution_context_(execution_context),\n    sort_specs_(std::move(sort_specs)),\n    input_(std::move(input)),\n    num_rows_(0),\n    pos_(0),\n    cnt_(0) {\n  if (sort_specs_.size() == 0) {\n    RAISE(kIllegalArgumentError, \"can't execute ORDER BY: no sort specs\");\n  }\n\n  execution_context_->incrementNumTasks();\n}\n\nReturnCode OrderByExpression::execute() {\n  auto rc = input_->execute();\n  if (!rc.isSuccess()) {\n    return rc;\n  }\n\n  execution_context_->incrementNumTasksRunning();\n\n  Vector<SVector> input_cols;\n  for (size_t i = 0; i < input_->getColumnCount(); ++i) {\n    input_cols.emplace_back(input_->getColumnType(i));\n  }\n\n  for (;;) {\n    for (auto& c : input_cols) {\n      c.clear();\n    }\n\n    size_t nrecords = 0;\n    {\n      auto rc = input_->nextBatch(input_cols.data(), &nrecords);\n      if (!rc.isSuccess()) {\n        RAISE(kRuntimeError, rc.getMessage());\n      }\n    }\n\n    if (nrecords == 0) {\n      break;\n    }\n\n    {\n      auto rc = txn_->triggerHeartbeat();\n      if (!rc.isSuccess()) {\n        RAISE(kRuntimeError, rc.getMessage());\n      }\n    }\n\n    Vector<void*> input_col_cursor;\n    for (const auto& c : input_cols) {\n      input_col_cursor.emplace_back((void*) c.getData());\n    }\n\n\n    for (size_t n = 0; n < nrecords; n++) {\n      rows_.emplace_back();\n      auto& row = rows_.back();\n\n      for (size_t i = 0; i < input_->getColumnCount(); ++i) {\n        row.emplace_back(input_->getColumnType(i));\n        row[i].copyFrom(input_col_cursor[i]);\n      }\n    }\n  }\n\n  num_rows_ = rows_.size();\n\n  std::sort(\n      rows_.begin(),\n      rows_.end(),\n      [this] (const Vector<SValue>& left, const Vector<SValue>& right) -> bool {\n    if (++cnt_ % 4096 == 0) {\n      auto rc = txn_->triggerHeartbeat();\n      if (!rc.isSuccess()) {\n        RAISE(kRuntimeError, rc.getMessage());\n      }\n    }\n\n    for (const auto& sort : sort_specs_) {\n      VM::evaluateBoxed(\n          txn_,\n          sort.expr.program(),\n          sort.expr.program()->method_call,\n          &vm_stack_,\n          nullptr,\n          left.size(),\n          left.data());\n\n      VM::evaluateBoxed(\n          txn_,\n          sort.expr.program(),\n          sort.expr.program()->method_call,\n          &vm_stack_,\n          nullptr,\n          right.size(),\n          right.data());\n\n      std::array<SValue, 2> args = {\n          sort.expr.program()->return_type,\n          sort.expr.program()->return_type };\n\n      popBoxed(&vm_stack_, &args[0]);\n      popBoxed(&vm_stack_, &args[1]);\n\n      SValue res(false);\n      expressions::eqExpr(Transaction::get(txn_), 2, args.data(), &res);\n      if (res.getBool()) {\n        continue;\n      }\n\n      if (sort.descending) {\n        expressions::gtExpr(Transaction::get(txn_), 2, args.data(), &res);\n      } else {\n        expressions::ltExpr(Transaction::get(txn_), 2, args.data(), &res);\n      }\n\n      return res.getBool();\n    }\n\n    \/* all dimensions equal *\/\n    return false;\n  });\n\n  return ReturnCode::success();\n}\n\nReturnCode OrderByExpression::nextBatch(\n    SVector* output,\n    size_t* nrecords) {\n  *nrecords = 0;\n\n  if (pos_ < num_rows_) {\n    auto batch_len = std::min(num_rows_ - pos_, kOutputBatchSize);\n    auto ncols = input_->getColumnCount();\n\n    for (size_t n = 0; n < batch_len; ++n) {\n      for (size_t i = 0; i < ncols; ++i) {\n        output[i].append(\n            rows_[pos_][i].getData(),\n            rows_[pos_][i].getSize());\n      }\n    }\n\n    *nrecords += batch_len;\n    pos_ += batch_len;\n    if (pos_ == num_rows_) {\n      execution_context_->incrementNumTasksCompleted();\n    }\n  }\n\n  return ReturnCode::success();\n}\n\nsize_t OrderByExpression::getColumnCount() const {\n  return input_->getColumnCount();\n}\n\nSType OrderByExpression::getColumnType(size_t idx) const {\n  return input_->getColumnType(idx);\n}\n\n} \/\/ namespace csql\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThis file is picked from project testa [https:\/\/github.com\/TimeExceed\/testa.git]\nCopyright (c) 2017, Taoda (tyf00@aliyun.com)\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, this\n  list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\n  list of conditions and the following disclaimer in the documentation and\/or\n  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\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\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 ON\nANY 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 \"metaprogramming.hpp\"\n#include <string>\n#include <deque>\n#include <cstdlib>\n    \n#if __cplusplus < 201103L\n#include <tr1\/tuple>\n#include <stdint.h>\n#else\n#include <tuple>\n#include <cstdint>\n#endif\n\nnamespace pp {\nnamespace impl {\n\ntemplate<class T, void (T::*)(std::string&) const>\nstruct IsPrettyPrintable\n{\n    typedef void Type;\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename IsPrettyPrintable<T, &T::prettyPrint>::Type>\n{\n    void operator()(std::string& out, const T& x) const\n    {\n        x.prettyPrint(out);\n    }\n};\n\ntemplate<>\nstruct PrettyPrinter<bool, void>\n{\n    void operator()(std::string& out, bool x) const\n    {\n        static const char kTrue[] = \"true\";\n        static const char kFalse[] = \"false\";\n        if (x) {\n            out.append(kTrue, sizeof(kTrue) - 1);\n        } else {\n            out.append(kFalse, sizeof(kFalse) - 1);\n        }\n    };\n};\n\ninline void toHex(std::string& out, uint8_t x)\n{\n    static const char kAlphabet[] = \"0123456789ABCDEF\";\n    if (x > 15) {\n        ::abort();\n    }\n    out.push_back(kAlphabet[x]);\n}\n\nstruct Char\n{\n    static void p(std::string& out, char x)\n    {\n        uint8_t xx = x;\n        if (xx >= 32 && xx <= 127) {\n            if (x == '\\'') {\n                out.push_back('\\\\');\n                out.push_back('\\'');\n            } else if (x == '\"') {\n                out.push_back('\\\\');\n                out.push_back('\"');\n            } else {\n                out.push_back(x);\n            }\n        } else {\n            out.push_back('\\\\');\n            out.push_back('x');\n            toHex(out, xx >> 4);\n            toHex(out, xx & 0xF);\n        }\n    };\n};\n\ntemplate<>\nstruct PrettyPrinter<char, void>\n{\n    void operator()(std::string& out, char x) const\n    {\n        out.push_back('\\'');\n        Char::p(out, x);\n        out.push_back('\\'');\n    };\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsInteger<T>::value && mp::IsUnsigned<T>::value>::Type>\n{\n    void operator()(std::string& out, T x) const\n    {\n        if (x == 0) {\n            out.push_back('0');\n        } else {\n            std::deque<uint8_t> xs;\n            for(; x > 0; x \/= 10) {\n                xs.push_back(x % 10);\n            }\n            for(; !xs.empty(); xs.pop_back()) {\n                out.push_back('0' + xs.back());\n            }\n        }\n    };\n};\n\ntemplate<>\nstruct PrettyPrinter<std::string, void>\n{\n    void operator()(std::string& out, const std::string& x) const\n    {\n        out.push_back('\\\"');\n        for(std::string::const_iterator i = x.begin(); i != x.end(); ++i) {\n            Char::p(out, *i);\n        }\n        out.push_back('\\\"');\n    }\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsInteger<T>::value && mp::IsSigned<T>::value>::Type>\n{\n    void operator()(std::string& out, T x) const\n    {\n        typename mp::MakeUnsigned<T>::Type y = x >= 0 ? x : -x;\n        if (x < 0) {\n            out.push_back('-');\n        }\n        pp::prettyPrint(out, y);\n    };\n};\n\nstruct Floating\n{\n    static void p(std::string&, double);\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsFloatingPoint<T>::value>::Type>\n{\n    void operator()(std::string& out, T x) const\n    {\n        Floating::p(out, x);\n    }\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<\n        mp::IsSeq<T>::value\n        && !mp::IsAssociative<T>::value\n        && !mp::IsSame<T, std::string>::value>::Type>\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        if (xs.empty()) {\n            out.append(\"[]\");\n            return;\n        }\n        out.push_back('[');\n        typename T::const_iterator it = xs.begin();\n        prettyPrint(out, *it);\n        for(++it; it != xs.end(); ++it) {\n            out.push_back(',');\n            prettyPrint(out, *it);\n        }\n        out.push_back(']');\n    }\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsAssociative<T>::value>::Type>\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        if (xs.empty()) {\n            out.append(\"{}\");\n            return;\n        }\n        out.push_back('{');\n        typename T::const_iterator it = xs.begin();\n        prettyPrint(out, it->first);\n        out.push_back(':');\n        prettyPrint(out, it->second);\n        for(++it; it != xs.end(); ++it) {\n            out.push_back(',');\n            prettyPrint(out, it->first);\n            out.push_back(':');\n            prettyPrint(out, it->second);\n        }\n        out.push_back('}');\n    }\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsSmartPtr<T>::value>::Type>\n{\n    void operator()(std::string& out, const T& ptr) const\n    {\n        if (ptr.get() == NULL) {\n            out.append(\"null\");\n        } else {\n            pp::prettyPrint(out, *ptr);\n        }\n    }\n};\n\n\n#if __cplusplus < 201103L\ntemplate<class T>\nstruct _TupleSize\n{\n    static const std::size_t value = std::tr1::tuple_size<T>::value;\n};\ntemplate<class T, std::size_t n>\nconst typename std::tr1::tuple_element<n, T>::type& _getTuple(const T& xs)\n{\n    return std::tr1::get<n>(xs);\n}\n#else\ntemplate<class T>\nstruct _TupleSize\n{\n    static const std::size_t value = std::tuple_size<T>::value;\n};\ntemplate<class T, std::size_t n>\nconst typename std::tuple_element<n, T>::type& _getTuple(const T& xs)\n{\n    return std::get<n>(xs);\n}\n#endif\n\ntemplate<class T, std::size_t idx, bool end>\nstruct _TuplePrettyPrint\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        pp::prettyPrint(out, _getTuple<T, idx>(xs));\n        if (idx + 1 == _TupleSize<T>::value) {\n            return;\n        }\n        out.push_back(',');\n        _TuplePrettyPrint<\n            T,\n            idx + 1,\n            idx + 1 == _TupleSize<T>::value> p;\n        p(out, xs);\n    }\n};\n\ntemplate<class T, std::size_t idx>\nstruct _TuplePrettyPrint<T, idx, true>\n{\n    void operator()(std::string& out, const T& xs) const\n    {}\n};\n\n#if __cplusplus < 201103L\ntemplate<std::size_t n>\nstruct __TupleSize\n{\n    static const bool value = (n >= 0);\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<__TupleSize<std::tr1::tuple_size<T>::value>::value>::Type>\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        out.push_back('(');\n        _TuplePrettyPrint<T, 0, std::tr1::tuple_size<T>::value == 0> p;\n        p(out, xs);\n        out.push_back(')');\n    }\n\n};\n#else\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIfExists<typename std::tuple_size<T>::value_type>::Type>\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        out.push_back('(');\n        _TuplePrettyPrint<T, 0, std::tuple_size<T>::value == 0> p;\n        p(out, xs);\n        out.push_back(')');\n    }\n\n};\n#endif\n\ntemplate<int n>\nstruct PrettyPrinter<const char[n], void>\n{\n    void operator()(std::string& out, const char* cs) const\n    {\n        out.append(cs, n);\n    }\n};\n\ntemplate<>\nstruct PrettyPrinter<const char*, void>\n{\n    void operator()(std::string& out, const char* cs) const\n    {\n        out.append(cs);\n    }\n};\n\n} \/\/ namespace impl\n} \/\/ namespace pp\n<commit_msg>fix a bug on handling c++ string literals<commit_after>\/*\nThis file is picked from project testa [https:\/\/github.com\/TimeExceed\/testa.git]\nCopyright (c) 2017, Taoda (tyf00@aliyun.com)\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, this\n  list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\n  list of conditions and the following disclaimer in the documentation and\/or\n  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\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\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 ON\nANY 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 \"metaprogramming.hpp\"\n#include <string>\n#include <deque>\n#include <cstdlib>\n\n#if __cplusplus < 201103L\n#include <tr1\/tuple>\n#include <stdint.h>\n#else\n#include <tuple>\n#include <cstdint>\n#endif\n\nnamespace pp {\nnamespace impl {\n\ntemplate<class T, void (T::*)(std::string&) const>\nstruct IsPrettyPrintable\n{\n    typedef void Type;\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename IsPrettyPrintable<T, &T::prettyPrint>::Type>\n{\n    void operator()(std::string& out, const T& x) const\n    {\n        x.prettyPrint(out);\n    }\n};\n\ntemplate<>\nstruct PrettyPrinter<bool, void>\n{\n    void operator()(std::string& out, bool x) const\n    {\n        static const char kTrue[] = \"true\";\n        static const char kFalse[] = \"false\";\n        if (x) {\n            out.append(kTrue, sizeof(kTrue) - 1);\n        } else {\n            out.append(kFalse, sizeof(kFalse) - 1);\n        }\n    };\n};\n\ninline void toHex(std::string& out, uint8_t x)\n{\n    static const char kAlphabet[] = \"0123456789ABCDEF\";\n    if (x > 15) {\n        ::abort();\n    }\n    out.push_back(kAlphabet[x]);\n}\n\nstruct Char\n{\n    static void p(std::string& out, char x)\n    {\n        uint8_t xx = x;\n        if (xx >= 32 && xx <= 127) {\n            if (x == '\\'') {\n                out.push_back('\\\\');\n                out.push_back('\\'');\n            } else if (x == '\"') {\n                out.push_back('\\\\');\n                out.push_back('\"');\n            } else {\n                out.push_back(x);\n            }\n        } else {\n            out.push_back('\\\\');\n            out.push_back('x');\n            toHex(out, xx >> 4);\n            toHex(out, xx & 0xF);\n        }\n    };\n};\n\ntemplate<>\nstruct PrettyPrinter<char, void>\n{\n    void operator()(std::string& out, char x) const\n    {\n        out.push_back('\\'');\n        Char::p(out, x);\n        out.push_back('\\'');\n    };\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsInteger<T>::value && mp::IsUnsigned<T>::value>::Type>\n{\n    void operator()(std::string& out, T x) const\n    {\n        if (x == 0) {\n            out.push_back('0');\n        } else {\n            std::deque<uint8_t> xs;\n            for(; x > 0; x \/= 10) {\n                xs.push_back(x % 10);\n            }\n            for(; !xs.empty(); xs.pop_back()) {\n                out.push_back('0' + xs.back());\n            }\n        }\n    };\n};\n\ntemplate<>\nstruct PrettyPrinter<std::string, void>\n{\n    void operator()(std::string& out, const std::string& x) const\n    {\n        out.push_back('\\\"');\n        for(std::string::const_iterator i = x.begin(); i != x.end(); ++i) {\n            Char::p(out, *i);\n        }\n        out.push_back('\\\"');\n    }\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsInteger<T>::value && mp::IsSigned<T>::value>::Type>\n{\n    void operator()(std::string& out, T x) const\n    {\n        typename mp::MakeUnsigned<T>::Type y = x >= 0 ? x : -x;\n        if (x < 0) {\n            out.push_back('-');\n        }\n        pp::prettyPrint(out, y);\n    };\n};\n\nstruct Floating\n{\n    static void p(std::string&, double);\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsFloatingPoint<T>::value>::Type>\n{\n    void operator()(std::string& out, T x) const\n    {\n        Floating::p(out, x);\n    }\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<\n        mp::IsSeq<T>::value\n        && !mp::IsAssociative<T>::value\n        && !mp::IsSame<T, std::string>::value>::Type>\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        if (xs.empty()) {\n            out.append(\"[]\");\n            return;\n        }\n        out.push_back('[');\n        typename T::const_iterator it = xs.begin();\n        prettyPrint(out, *it);\n        for(++it; it != xs.end(); ++it) {\n            out.push_back(',');\n            prettyPrint(out, *it);\n        }\n        out.push_back(']');\n    }\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsAssociative<T>::value>::Type>\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        if (xs.empty()) {\n            out.append(\"{}\");\n            return;\n        }\n        out.push_back('{');\n        typename T::const_iterator it = xs.begin();\n        prettyPrint(out, it->first);\n        out.push_back(':');\n        prettyPrint(out, it->second);\n        for(++it; it != xs.end(); ++it) {\n            out.push_back(',');\n            prettyPrint(out, it->first);\n            out.push_back(':');\n            prettyPrint(out, it->second);\n        }\n        out.push_back('}');\n    }\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<mp::IsSmartPtr<T>::value>::Type>\n{\n    void operator()(std::string& out, const T& ptr) const\n    {\n        if (ptr.get() == NULL) {\n            out.append(\"null\");\n        } else {\n            pp::prettyPrint(out, *ptr);\n        }\n    }\n};\n\n\n#if __cplusplus < 201103L\ntemplate<class T>\nstruct _TupleSize\n{\n    static const std::size_t value = std::tr1::tuple_size<T>::value;\n};\ntemplate<class T, std::size_t n>\nconst typename std::tr1::tuple_element<n, T>::type& _getTuple(const T& xs)\n{\n    return std::tr1::get<n>(xs);\n}\n#else\ntemplate<class T>\nstruct _TupleSize\n{\n    static const std::size_t value = std::tuple_size<T>::value;\n};\ntemplate<class T, std::size_t n>\nconst typename std::tuple_element<n, T>::type& _getTuple(const T& xs)\n{\n    return std::get<n>(xs);\n}\n#endif\n\ntemplate<class T, std::size_t idx, bool end>\nstruct _TuplePrettyPrint\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        pp::prettyPrint(out, _getTuple<T, idx>(xs));\n        if (idx + 1 == _TupleSize<T>::value) {\n            return;\n        }\n        out.push_back(',');\n        _TuplePrettyPrint<\n            T,\n            idx + 1,\n            idx + 1 == _TupleSize<T>::value> p;\n        p(out, xs);\n    }\n};\n\ntemplate<class T, std::size_t idx>\nstruct _TuplePrettyPrint<T, idx, true>\n{\n    void operator()(std::string& out, const T& xs) const\n    {}\n};\n\n#if __cplusplus < 201103L\ntemplate<std::size_t n>\nstruct __TupleSize\n{\n    static const bool value = (n >= 0);\n};\n\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIf<__TupleSize<std::tr1::tuple_size<T>::value>::value>::Type>\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        out.push_back('(');\n        _TuplePrettyPrint<T, 0, std::tr1::tuple_size<T>::value == 0> p;\n        p(out, xs);\n        out.push_back(')');\n    }\n\n};\n#else\ntemplate<class T>\nstruct PrettyPrinter<\n    T,\n    typename mp::VoidIfExists<typename std::tuple_size<T>::value_type>::Type>\n{\n    void operator()(std::string& out, const T& xs) const\n    {\n        out.push_back('(');\n        _TuplePrettyPrint<T, 0, std::tuple_size<T>::value == 0> p;\n        p(out, xs);\n        out.push_back(')');\n    }\n\n};\n#endif\n\ntemplate<int n>\nstruct PrettyPrinter<const char[n], void>\n{\n    void operator()(std::string& out, const char* cs) const\n    {\n        out.append(cs, n - 1);\n    }\n};\n\ntemplate<int n>\nstruct PrettyPrinter<char[n], void>\n{\n    void operator()(std::string& out, const char* cs) const\n    {\n        out.append(cs, n - 1);\n    }\n};\n\ntemplate<>\nstruct PrettyPrinter<const char*, void>\n{\n    void operator()(std::string& out, const char* cs) const\n    {\n        out.append(cs);\n    }\n};\n\n} \/\/ namespace impl\n} \/\/ namespace pp\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2003 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 __EXEC_CONTEXT_HH__\n#define __EXEC_CONTEXT_HH__\n\n#include \"sim\/host.hh\"\n#include \"mem\/mem_req.hh\"\n#include \"sim\/serialize.hh\"\n\n\/\/ forward declaration: see functional_memory.hh\nclass FunctionalMemory;\nclass PhysicalMemory;\nclass BaseCPU;\n\n#ifdef FULL_SYSTEM\n\n#include \"targetarch\/alpha_memory.hh\"\nclass MemoryController;\n\n#include \"kern\/tru64\/kernel_stats.hh\"\n#include \"sim\/system.hh\"\n\n#else \/\/ !FULL_SYSTEM\n\n#include \"sim\/prog.hh\"\n\n#endif \/\/ FULL_SYSTEM\n\n\/\/\n\/\/ The ExecContext object represents a functional context for\n\/\/ instruction execution.  It incorporates everything required for\n\/\/ architecture-level functional simulation of a single thread.\n\/\/\n\nclass ExecContext\n{\n  public:\n    enum Status { Unallocated, Active, Suspended, Halted };\n\n  private:\n    Status _status;\n\n  public:\n    Status status() const { return _status; }\n\n    void setStatus(Status new_status);\n\n#ifdef FULL_SYSTEM\n  public:\n    KernelStats kernelStats;\n#endif\n\n  public:\n    RegFile regs;\t\/\/ correct-path register context\n\n    \/\/ pointer to CPU associated with this context\n    BaseCPU *cpu;\n\n    \/\/ Index of hardware thread context on the CPU that this represents.\n    int thread_num;\n\n    \/\/ ID of this context w.r.t. the System or Process object to which\n    \/\/ it belongs.  For full-system mode, this is the system CPU ID.\n    int cpu_id;\n\n#ifdef FULL_SYSTEM\n\n    FunctionalMemory *mem;\n    AlphaItb *itb;\n    AlphaDtb *dtb;\n    System *system;\n\n    \/\/ the following two fields are redundant, since we can always\n    \/\/ look them up through the system pointer, but we'll leave them\n    \/\/ here for now for convenience\n    MemoryController *memCtrl;\n    PhysicalMemory *physmem;\n\n#else\n    Process *process;\n\n    FunctionalMemory *mem;\t\/\/ functional storage for process address space\n\n    \/\/ Address space ID.  Note that this is used for TIMING cache\n    \/\/ simulation only; all functional memory accesses should use\n    \/\/ one of the FunctionalMemory pointers above.\n    short asid;\n\n#endif\n\n\n    \/*\n     * number of executed instructions, for matching with syscall trace\n     * points in EIO files.\n     *\/\n    Counter func_exe_insn;\n\n    \/\/\n    \/\/ Count failed store conditionals so we can warn of apparent\n    \/\/ application deadlock situations.\n    unsigned storeCondFailures;\n\n    \/\/ constructor: initialize context from given process structure\n#ifdef FULL_SYSTEM\n    ExecContext(BaseCPU *_cpu, int _thread_num, System *_system,\n                AlphaItb *_itb, AlphaDtb *_dtb, FunctionalMemory *_dem);\n#else\n    ExecContext(BaseCPU *_cpu, int _thread_num, Process *_process, int _asid);\n    ExecContext(BaseCPU *_cpu, int _thread_num, FunctionalMemory *_mem,\n                int _asid);\n#endif\n    virtual ~ExecContext() {}\n\n    virtual void takeOverFrom(ExecContext *oldContext);\n\n    void regStats(const std::string &name);\n\n    void serialize(std::ostream &os);\n    void unserialize(Checkpoint *cp, const std::string &section);\n\n#ifdef FULL_SYSTEM\n    bool validInstAddr(Addr addr) { return true; }\n    bool validDataAddr(Addr addr) { return true; }\n    int getInstAsid() { return ITB_ASN_ASN(regs.ipr[TheISA::IPR_ITB_ASN]); }\n    int getDataAsid() { return DTB_ASN_ASN(regs.ipr[TheISA::IPR_DTB_ASN]); }\n\n    Fault translateInstReq(MemReqPtr req)\n    {\n        return itb->translate(req);\n    }\n\n    Fault translateDataReadReq(MemReqPtr req)\n    {\n        return dtb->translate(req, false);\n    }\n\n    Fault translateDataWriteReq(MemReqPtr req)\n    {\n        return dtb->translate(req, true);\n    }\n\n#else\n    bool validInstAddr(Addr addr)\n    { return process->validInstAddr(addr); }\n\n    bool validDataAddr(Addr addr)\n    { return process->validDataAddr(addr); }\n\n    int getInstAsid() { return asid; }\n    int getDataAsid() { return asid; }\n\n    Fault dummyTranslation(MemReqPtr req)\n    {\n#if 0\n        assert((req->vaddr >> 48 & 0xffff) == 0);\n#endif\n\n        \/\/ put the asid in the upper 16 bits of the paddr\n        req->paddr = req->vaddr & ~((Addr)0xffff << sizeof(Addr) * 8 - 16);\n        req->paddr = req->paddr | (Addr)req->asid << sizeof(Addr) * 8 - 16;\n        return No_Fault;\n    }\n    Fault translateInstReq(MemReqPtr req)\n    {\n        return dummyTranslation(req);\n    }\n    Fault translateDataReadReq(MemReqPtr req)\n    {\n        return dummyTranslation(req);\n    }\n    Fault translateDataWriteReq(MemReqPtr req)\n    {\n        return dummyTranslation(req);\n    }\n\n#endif\n\n    template <class T>\n    Fault read(MemReqPtr req, T& data)\n    {\n#if defined(TARGET_ALPHA) && defined(FULL_SYSTEM)\n        if (req->flags & LOCKED) {\n            MiscRegFile *cregs = &req->xc->regs.miscRegs;\n            cregs->lock_addr = req->paddr;\n            cregs->lock_flag = true;\n        }\n#endif\n        return mem->read(req, data);\n    }\n\n    template <class T>\n    Fault write(MemReqPtr req, T& data)\n    {\n#if defined(TARGET_ALPHA) && defined(FULL_SYSTEM)\n\n        MiscRegFile *cregs;\n\n        \/\/ If this is a store conditional, act appropriately\n        if (req->flags & LOCKED) {\n            cregs = &req->xc->regs.miscRegs;\n\n            if (req->flags & UNCACHEABLE) {\n                \/\/ Don't update result register (see stq_c in isa_desc)\n                req->result = 2;\n                req->xc->storeCondFailures = 0;\/\/Needed? [RGD]\n            } else {\n                req->result = cregs->lock_flag;\n                if (!cregs->lock_flag ||\n                    ((cregs->lock_addr & ~0xf) != (req->paddr & ~0xf))) {\n                    cregs->lock_flag = false;\n                    if (((++req->xc->storeCondFailures) % 100000) == 0) {\n                        std::cerr << \"Warning: \"\n                                  << req->xc->storeCondFailures\n                                  << \" consecutive store conditional failures \"\n                                  << \"on cpu \" << req->xc->cpu_id\n                                  << std::endl;\n                    }\n                    return No_Fault;\n                }\n                else req->xc->storeCondFailures = 0;\n            }\n        }\n\n        \/\/ Need to clear any locked flags on other proccessors for\n        \/\/ this address.  Only do this for succsful Store Conditionals\n        \/\/ and all other stores (WH64?).  Unsuccessful Store\n        \/\/ Conditionals would have returned above, and wouldn't fall\n        \/\/ through.\n        for (int i = 0; i < system->execContexts.size(); i++){\n            cregs = &system->execContexts[i]->regs.miscRegs;\n            if ((cregs->lock_addr & ~0xf) == (req->paddr & ~0xf)) {\n                cregs->lock_flag = false;\n            }\n        }\n\n#endif\n        return mem->write(req, data);\n    }\n\n    virtual bool misspeculating();\n\n\n    \/\/\n    \/\/ New accessors for new decoder.\n    \/\/\n    uint64_t readIntReg(int reg_idx)\n    {\n        return regs.intRegFile[reg_idx];\n    }\n\n    float readFloatRegSingle(int reg_idx)\n    {\n        return (float)regs.floatRegFile.d[reg_idx];\n    }\n\n    double readFloatRegDouble(int reg_idx)\n    {\n        return regs.floatRegFile.d[reg_idx];\n    }\n\n    uint64_t readFloatRegInt(int reg_idx)\n    {\n        return regs.floatRegFile.q[reg_idx];\n    }\n\n    void setIntReg(int reg_idx, uint64_t val)\n    {\n        regs.intRegFile[reg_idx] = val;\n    }\n\n    void setFloatRegSingle(int reg_idx, float val)\n    {\n        regs.floatRegFile.d[reg_idx] = (double)val;\n    }\n\n    void setFloatRegDouble(int reg_idx, double val)\n    {\n        regs.floatRegFile.d[reg_idx] = val;\n    }\n\n    void setFloatRegInt(int reg_idx, uint64_t val)\n    {\n        regs.floatRegFile.q[reg_idx] = val;\n    }\n\n    uint64_t readPC()\n    {\n        return regs.pc;\n    }\n\n    void setNextPC(uint64_t val)\n    {\n        regs.npc = val;\n    }\n\n    uint64_t readUniq()\n    {\n        return regs.miscRegs.uniq;\n    }\n\n    void setUniq(uint64_t val)\n    {\n        regs.miscRegs.uniq = val;\n    }\n\n    uint64_t readFpcr()\n    {\n        return regs.miscRegs.fpcr;\n    }\n\n    void setFpcr(uint64_t val)\n    {\n        regs.miscRegs.fpcr = val;\n    }\n\n#ifdef FULL_SYSTEM\n    uint64_t readIpr(int idx, Fault &fault);\n    Fault setIpr(int idx, uint64_t val);\n    Fault hwrei();\n    void ev5_trap(Fault fault);\n    bool simPalCheck(int palFunc);\n#endif\n\n#ifndef FULL_SYSTEM\n    void syscall()\n    {\n        process->syscall(this);\n    }\n#endif\n};\n\n\n\/\/ for non-speculative execution context, spec_mode is always false\ninline bool\nExecContext::misspeculating()\n{\n    return false;\n}\n\n#endif \/\/ __EXEC_CONTEXT_HH__\n<commit_msg>Add some comments explaining ExecContext::Status enum.<commit_after>\/*\n * Copyright (c) 2003 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 __EXEC_CONTEXT_HH__\n#define __EXEC_CONTEXT_HH__\n\n#include \"sim\/host.hh\"\n#include \"mem\/mem_req.hh\"\n#include \"sim\/serialize.hh\"\n\n\/\/ forward declaration: see functional_memory.hh\nclass FunctionalMemory;\nclass PhysicalMemory;\nclass BaseCPU;\n\n#ifdef FULL_SYSTEM\n\n#include \"targetarch\/alpha_memory.hh\"\nclass MemoryController;\n\n#include \"kern\/tru64\/kernel_stats.hh\"\n#include \"sim\/system.hh\"\n\n#else \/\/ !FULL_SYSTEM\n\n#include \"sim\/prog.hh\"\n\n#endif \/\/ FULL_SYSTEM\n\n\/\/\n\/\/ The ExecContext object represents a functional context for\n\/\/ instruction execution.  It incorporates everything required for\n\/\/ architecture-level functional simulation of a single thread.\n\/\/\n\nclass ExecContext\n{\n  public:\n    enum Status\n    {\n        \/\/\/ Initialized but not running yet.  All CPUs start in\n        \/\/\/ this state, but most transition to Active on cycle 1.\n        \/\/\/ In MP or SMT systems, non-primary contexts will stay\n        \/\/\/ in this state until a thread is assigned to them.\n        Unallocated,\n\n        \/\/\/ Running.  Instructions should be executed only when\n        \/\/\/ the context is in this state.\n        Active,\n\n        \/\/\/ Temporarily inactive.  Entered while waiting for\n        \/\/\/ synchronization, etc.\n        Suspended,\n\n        \/\/\/ Permanently shut down.  Entered when target executes\n        \/\/\/ m5exit pseudo-instruction.  When all contexts enter\n        \/\/\/ this state, the simulation will terminate.\n        Halted\n    };\n\n  private:\n    Status _status;\n\n  public:\n    Status status() const { return _status; }\n\n    void setStatus(Status new_status);\n\n#ifdef FULL_SYSTEM\n  public:\n    KernelStats kernelStats;\n#endif\n\n  public:\n    RegFile regs;\t\/\/ correct-path register context\n\n    \/\/ pointer to CPU associated with this context\n    BaseCPU *cpu;\n\n    \/\/ Index of hardware thread context on the CPU that this represents.\n    int thread_num;\n\n    \/\/ ID of this context w.r.t. the System or Process object to which\n    \/\/ it belongs.  For full-system mode, this is the system CPU ID.\n    int cpu_id;\n\n#ifdef FULL_SYSTEM\n\n    FunctionalMemory *mem;\n    AlphaItb *itb;\n    AlphaDtb *dtb;\n    System *system;\n\n    \/\/ the following two fields are redundant, since we can always\n    \/\/ look them up through the system pointer, but we'll leave them\n    \/\/ here for now for convenience\n    MemoryController *memCtrl;\n    PhysicalMemory *physmem;\n\n#else\n    Process *process;\n\n    FunctionalMemory *mem;\t\/\/ functional storage for process address space\n\n    \/\/ Address space ID.  Note that this is used for TIMING cache\n    \/\/ simulation only; all functional memory accesses should use\n    \/\/ one of the FunctionalMemory pointers above.\n    short asid;\n\n#endif\n\n\n    \/*\n     * number of executed instructions, for matching with syscall trace\n     * points in EIO files.\n     *\/\n    Counter func_exe_insn;\n\n    \/\/\n    \/\/ Count failed store conditionals so we can warn of apparent\n    \/\/ application deadlock situations.\n    unsigned storeCondFailures;\n\n    \/\/ constructor: initialize context from given process structure\n#ifdef FULL_SYSTEM\n    ExecContext(BaseCPU *_cpu, int _thread_num, System *_system,\n                AlphaItb *_itb, AlphaDtb *_dtb, FunctionalMemory *_dem);\n#else\n    ExecContext(BaseCPU *_cpu, int _thread_num, Process *_process, int _asid);\n    ExecContext(BaseCPU *_cpu, int _thread_num, FunctionalMemory *_mem,\n                int _asid);\n#endif\n    virtual ~ExecContext() {}\n\n    virtual void takeOverFrom(ExecContext *oldContext);\n\n    void regStats(const std::string &name);\n\n    void serialize(std::ostream &os);\n    void unserialize(Checkpoint *cp, const std::string &section);\n\n#ifdef FULL_SYSTEM\n    bool validInstAddr(Addr addr) { return true; }\n    bool validDataAddr(Addr addr) { return true; }\n    int getInstAsid() { return ITB_ASN_ASN(regs.ipr[TheISA::IPR_ITB_ASN]); }\n    int getDataAsid() { return DTB_ASN_ASN(regs.ipr[TheISA::IPR_DTB_ASN]); }\n\n    Fault translateInstReq(MemReqPtr req)\n    {\n        return itb->translate(req);\n    }\n\n    Fault translateDataReadReq(MemReqPtr req)\n    {\n        return dtb->translate(req, false);\n    }\n\n    Fault translateDataWriteReq(MemReqPtr req)\n    {\n        return dtb->translate(req, true);\n    }\n\n#else\n    bool validInstAddr(Addr addr)\n    { return process->validInstAddr(addr); }\n\n    bool validDataAddr(Addr addr)\n    { return process->validDataAddr(addr); }\n\n    int getInstAsid() { return asid; }\n    int getDataAsid() { return asid; }\n\n    Fault dummyTranslation(MemReqPtr req)\n    {\n#if 0\n        assert((req->vaddr >> 48 & 0xffff) == 0);\n#endif\n\n        \/\/ put the asid in the upper 16 bits of the paddr\n        req->paddr = req->vaddr & ~((Addr)0xffff << sizeof(Addr) * 8 - 16);\n        req->paddr = req->paddr | (Addr)req->asid << sizeof(Addr) * 8 - 16;\n        return No_Fault;\n    }\n    Fault translateInstReq(MemReqPtr req)\n    {\n        return dummyTranslation(req);\n    }\n    Fault translateDataReadReq(MemReqPtr req)\n    {\n        return dummyTranslation(req);\n    }\n    Fault translateDataWriteReq(MemReqPtr req)\n    {\n        return dummyTranslation(req);\n    }\n\n#endif\n\n    template <class T>\n    Fault read(MemReqPtr req, T& data)\n    {\n#if defined(TARGET_ALPHA) && defined(FULL_SYSTEM)\n        if (req->flags & LOCKED) {\n            MiscRegFile *cregs = &req->xc->regs.miscRegs;\n            cregs->lock_addr = req->paddr;\n            cregs->lock_flag = true;\n        }\n#endif\n        return mem->read(req, data);\n    }\n\n    template <class T>\n    Fault write(MemReqPtr req, T& data)\n    {\n#if defined(TARGET_ALPHA) && defined(FULL_SYSTEM)\n\n        MiscRegFile *cregs;\n\n        \/\/ If this is a store conditional, act appropriately\n        if (req->flags & LOCKED) {\n            cregs = &req->xc->regs.miscRegs;\n\n            if (req->flags & UNCACHEABLE) {\n                \/\/ Don't update result register (see stq_c in isa_desc)\n                req->result = 2;\n                req->xc->storeCondFailures = 0;\/\/Needed? [RGD]\n            } else {\n                req->result = cregs->lock_flag;\n                if (!cregs->lock_flag ||\n                    ((cregs->lock_addr & ~0xf) != (req->paddr & ~0xf))) {\n                    cregs->lock_flag = false;\n                    if (((++req->xc->storeCondFailures) % 100000) == 0) {\n                        std::cerr << \"Warning: \"\n                                  << req->xc->storeCondFailures\n                                  << \" consecutive store conditional failures \"\n                                  << \"on cpu \" << req->xc->cpu_id\n                                  << std::endl;\n                    }\n                    return No_Fault;\n                }\n                else req->xc->storeCondFailures = 0;\n            }\n        }\n\n        \/\/ Need to clear any locked flags on other proccessors for\n        \/\/ this address.  Only do this for succsful Store Conditionals\n        \/\/ and all other stores (WH64?).  Unsuccessful Store\n        \/\/ Conditionals would have returned above, and wouldn't fall\n        \/\/ through.\n        for (int i = 0; i < system->execContexts.size(); i++){\n            cregs = &system->execContexts[i]->regs.miscRegs;\n            if ((cregs->lock_addr & ~0xf) == (req->paddr & ~0xf)) {\n                cregs->lock_flag = false;\n            }\n        }\n\n#endif\n        return mem->write(req, data);\n    }\n\n    virtual bool misspeculating();\n\n\n    \/\/\n    \/\/ New accessors for new decoder.\n    \/\/\n    uint64_t readIntReg(int reg_idx)\n    {\n        return regs.intRegFile[reg_idx];\n    }\n\n    float readFloatRegSingle(int reg_idx)\n    {\n        return (float)regs.floatRegFile.d[reg_idx];\n    }\n\n    double readFloatRegDouble(int reg_idx)\n    {\n        return regs.floatRegFile.d[reg_idx];\n    }\n\n    uint64_t readFloatRegInt(int reg_idx)\n    {\n        return regs.floatRegFile.q[reg_idx];\n    }\n\n    void setIntReg(int reg_idx, uint64_t val)\n    {\n        regs.intRegFile[reg_idx] = val;\n    }\n\n    void setFloatRegSingle(int reg_idx, float val)\n    {\n        regs.floatRegFile.d[reg_idx] = (double)val;\n    }\n\n    void setFloatRegDouble(int reg_idx, double val)\n    {\n        regs.floatRegFile.d[reg_idx] = val;\n    }\n\n    void setFloatRegInt(int reg_idx, uint64_t val)\n    {\n        regs.floatRegFile.q[reg_idx] = val;\n    }\n\n    uint64_t readPC()\n    {\n        return regs.pc;\n    }\n\n    void setNextPC(uint64_t val)\n    {\n        regs.npc = val;\n    }\n\n    uint64_t readUniq()\n    {\n        return regs.miscRegs.uniq;\n    }\n\n    void setUniq(uint64_t val)\n    {\n        regs.miscRegs.uniq = val;\n    }\n\n    uint64_t readFpcr()\n    {\n        return regs.miscRegs.fpcr;\n    }\n\n    void setFpcr(uint64_t val)\n    {\n        regs.miscRegs.fpcr = val;\n    }\n\n#ifdef FULL_SYSTEM\n    uint64_t readIpr(int idx, Fault &fault);\n    Fault setIpr(int idx, uint64_t val);\n    Fault hwrei();\n    void ev5_trap(Fault fault);\n    bool simPalCheck(int palFunc);\n#endif\n\n#ifndef FULL_SYSTEM\n    void syscall()\n    {\n        process->syscall(this);\n    }\n#endif\n};\n\n\n\/\/ for non-speculative execution context, spec_mode is always false\ninline bool\nExecContext::misspeculating()\n{\n    return false;\n}\n\n#endif \/\/ __EXEC_CONTEXT_HH__\n<|endoftext|>"}
{"text":"<commit_before>#include \"Window.h\"\n#include <iostream>\n#include \"Constant.h\"\n#include \"RenderTree\/Node\/RenderTree.h\"\n#include \"Water\/WaveParticleManager.h\"\n#include \"RenderTree\/Scene.h\"\n\n#ifndef M_PI\n#define M_PI 3.1415926535897932385\n#endif\n#define DEG2RAD(a) (a \/ 180.0f) * (M_PI);\n\nScene* Window::scene_ = NULL;\n\nWindow::Window(std::string name, unsigned int width, unsigned int height, bool isFullscreen, bool isVSync)\n\t: name_(name)\n\t, width_(width)\n\t, height_(height)\n\t, isFullscreen_(isFullscreen)\n\t, isVSync_(isVSync)\n\t, monitor_(NULL)\n\t, window_(NULL)\n{\n    CreateWindow();\n}\n\nWindow::~Window()\n{\n}\n\nvoid Window::SwapBuffer()\n{\n    glfwSwapBuffers(window_);\n}\n\nvoid Window::PollEvent()\n{\n    glfwPollEvents();\n}\n\nGLFWwindow* Window::GetWindow()\n{\n    return window_;\n}\n\nstd::string Window::Name()\n{\n    return name_;\n}\n\nunsigned int Window::Width()\n{\n    return width_;\n}\n\nunsigned int Window::Height()\n{\n    return height_;\n}\n\nbool Window::IsFullscreen()\n{\n    return isFullscreen_;\n}\n\nbool Window::IsVSync()\n{\n    return isVSync_;\n}\n\nbool Window::ShouldClose()\n{\n    return glfwWindowShouldClose(window_) != 0;\n}\n\nvoid Window::Name(const std::string & name)\n{\n    name_ = name;\n}\n\nvoid Window::Width(unsigned int width)\n{\n    width_ = width;\n}\n\nvoid Window::Height(unsigned int height)\n{\n    height_ = height;\n}\n\nvoid Window::IsFullScreen(bool isFullscreen)\n{\n    if (isFullscreen_ != isFullscreen)\n    {\n        monitor_ = NULL;\n        isFullscreen_ = isFullscreen;\n        glfwDestroyWindow(window_);\n        CreateWindow();\n    }\n}\n\nvoid Window::IsVSync(bool isVSync)\n{\n    if (isVSync_ != isVSync)\n    {\n        isVSync_ = isVSync;\n        if (isVSync_)\n        {\n            glfwSwapInterval(1);\n        }\n        else\n        {\n            glfwSwapInterval(0);\n        }\n    }\n    \n}\n\nvoid Window::Resize_CallBack(GLFWwindow* window, int width, int height)\n{\n    Constant::ViewportWidth = width;\n    Constant::ViewPortHeight = height;\n}\n\nvoid Window::Keyboard_Callback(GLFWwindow* window, int key, int scancode, int action, int mods)\n{\n    if (action == GLFW_REPEAT || action == GLFW_PRESS)\n    {\n        switch (key)\n        {\n        case GLFW_KEY_RIGHT:\n            Constant::theta -= DEG2RAD(2.0f);\n            break;\n        case GLFW_KEY_LEFT:\n            Constant::theta += DEG2RAD(2.0f);\n            break;\n        case GLFW_KEY_UP:\n            Constant::phi -= DEG2RAD(2.0f);\n            break;\n        case GLFW_KEY_DOWN:\n            Constant::phi += DEG2RAD(2.0f);\n            break;\n        case GLFW_KEY_EQUAL:\n            Constant::rho -= 0.5;\n            break;\n        case GLFW_KEY_MINUS:\n            Constant::rho += 0.5;\n            break;\n        case GLFW_KEY_P:\n\t\t\tRenderTree::pause_ = !RenderTree::pause_;\n            break;\n        }\n    }\n}\n\nvoid Window::Mouse_Callback(GLFWwindow* window, int button, int action, int mods)\n{\n\tif (action == GLFW_PRESS)\n\t{\n        switch (button)\n        {\n        case GLFW_MOUSE_BUTTON_1:\n\t\t\tdouble xpos;\n\t\t\tdouble ypos;\n\n\t\t\tglfwGetCursorPos(window, &xpos, &ypos);\n\t\t\tglm::vec4 position(xpos, ypos, 0, 1);\n\n\t\t\tCamera* camera = scene_->GetCamera();\n\t\t\tglm::mat4 view(1);\n\t\t\tglm::mat4 projection(1);\n\n\t\t\tcamera->Apply(view, projection);\n\n\t\t\tglm::mat4 transformationMatrix = glm::inverse(projection * view);\n\t\t\tposition = transformationMatrix * position;\n\n\t\t\tglm::vec2 worldPosition(position.x \/ Constant::ViewportWidth, position.y \/ Constant::ViewPortHeight);\n\t\t\tWaveParticleManager::Instance()->SpawnCircularWave(10, worldPosition, 5.f, 0.1, 0.05);\n\t\t\tWaveParticleManager::Instance()->SpawnCircularWave(10, worldPosition, 5.f, 0.1, 0.4);\n            break;;\n        }\n\t}\n}\n\nvoid Window::CreateWindow()\n{\n    if (isFullscreen_)\n    {\n        monitor_ = glfwGetPrimaryMonitor();\n    }\n   \n    glfwWindowHint(GLFW_SAMPLES, 8);\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 4);\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 4);\n    glfwWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE);\n    glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);\n\n    window_ = glfwCreateWindow(width_, height_, name_.c_str(), monitor_, NULL);\n    glfwMakeContextCurrent(window_);\n    \n    glewExperimental = GL_TRUE;\n    glewInit();\n    glGetError();\n    if (isVSync_)\n    {\n        glfwSwapInterval(1);\n    }\n\n    glfwSetWindowSizeCallback(window_, Resize_CallBack);\n    glfwSetKeyCallback(window_, Keyboard_Callback);\n    glfwSetMouseButtonCallback(window_, Mouse_Callback);\n}\n<commit_msg>Bon paramètre de vague<commit_after>#include \"Window.h\"\n#include <iostream>\n#include \"Constant.h\"\n#include \"RenderTree\/Node\/RenderTree.h\"\n#include \"Water\/WaveParticleManager.h\"\n#include \"RenderTree\/Scene.h\"\n\n#ifndef M_PI\n#define M_PI 3.1415926535897932385\n#endif\n#define DEG2RAD(a) (a \/ 180.0f) * (M_PI);\n\nScene* Window::scene_ = NULL;\n\nWindow::Window(std::string name, unsigned int width, unsigned int height, bool isFullscreen, bool isVSync)\n\t: name_(name)\n\t, width_(width)\n\t, height_(height)\n\t, isFullscreen_(isFullscreen)\n\t, isVSync_(isVSync)\n\t, monitor_(NULL)\n\t, window_(NULL)\n{\n    CreateWindow();\n}\n\nWindow::~Window()\n{\n}\n\nvoid Window::SwapBuffer()\n{\n    glfwSwapBuffers(window_);\n}\n\nvoid Window::PollEvent()\n{\n    glfwPollEvents();\n}\n\nGLFWwindow* Window::GetWindow()\n{\n    return window_;\n}\n\nstd::string Window::Name()\n{\n    return name_;\n}\n\nunsigned int Window::Width()\n{\n    return width_;\n}\n\nunsigned int Window::Height()\n{\n    return height_;\n}\n\nbool Window::IsFullscreen()\n{\n    return isFullscreen_;\n}\n\nbool Window::IsVSync()\n{\n    return isVSync_;\n}\n\nbool Window::ShouldClose()\n{\n    return glfwWindowShouldClose(window_) != 0;\n}\n\nvoid Window::Name(const std::string & name)\n{\n    name_ = name;\n}\n\nvoid Window::Width(unsigned int width)\n{\n    width_ = width;\n}\n\nvoid Window::Height(unsigned int height)\n{\n    height_ = height;\n}\n\nvoid Window::IsFullScreen(bool isFullscreen)\n{\n    if (isFullscreen_ != isFullscreen)\n    {\n        monitor_ = NULL;\n        isFullscreen_ = isFullscreen;\n        glfwDestroyWindow(window_);\n        CreateWindow();\n    }\n}\n\nvoid Window::IsVSync(bool isVSync)\n{\n    if (isVSync_ != isVSync)\n    {\n        isVSync_ = isVSync;\n        if (isVSync_)\n        {\n            glfwSwapInterval(1);\n        }\n        else\n        {\n            glfwSwapInterval(0);\n        }\n    }\n    \n}\n\nvoid Window::Resize_CallBack(GLFWwindow* window, int width, int height)\n{\n    Constant::ViewportWidth = width;\n    Constant::ViewPortHeight = height;\n}\n\nvoid Window::Keyboard_Callback(GLFWwindow* window, int key, int scancode, int action, int mods)\n{\n    if (action == GLFW_REPEAT || action == GLFW_PRESS)\n    {\n        switch (key)\n        {\n        case GLFW_KEY_RIGHT:\n            Constant::theta -= DEG2RAD(2.0f);\n            break;\n        case GLFW_KEY_LEFT:\n            Constant::theta += DEG2RAD(2.0f);\n            break;\n        case GLFW_KEY_UP:\n            Constant::phi -= DEG2RAD(2.0f);\n            break;\n        case GLFW_KEY_DOWN:\n            Constant::phi += DEG2RAD(2.0f);\n            break;\n        case GLFW_KEY_EQUAL:\n            Constant::rho -= 0.5;\n            break;\n        case GLFW_KEY_MINUS:\n            Constant::rho += 0.5;\n            break;\n        case GLFW_KEY_P:\n\t\t\tRenderTree::pause_ = !RenderTree::pause_;\n            break;\n        }\n    }\n}\n\nvoid Window::Mouse_Callback(GLFWwindow* window, int button, int action, int mods)\n{\n\tif (action == GLFW_PRESS)\n\t{\n        switch (button)\n        {\n        case GLFW_MOUSE_BUTTON_1:\n\t\t\tdouble xpos;\n\t\t\tdouble ypos;\n\n\t\t\tglfwGetCursorPos(window, &xpos, &ypos);\n\t\t\tglm::vec4 position(xpos, ypos, 0, 1);\n\n\t\t\tCamera* camera = scene_->GetCamera();\n\t\t\tglm::mat4 view(1);\n\t\t\tglm::mat4 projection(1);\n\n\t\t\tcamera->Apply(view, projection);\n\n\t\t\tglm::mat4 transformationMatrix = glm::inverse(projection * view);\n\t\t\tposition = transformationMatrix * position;\n\n\t\t\tglm::vec2 worldPosition(position.x \/ Constant::ViewportWidth, position.y \/ Constant::ViewPortHeight);\n\t\t\t\/\/WaveParticleManager::Instance()->SpawnCircularWave(10, worldPosition, 5.f, 0.1, 0.05);\n\t\t\tWaveParticleManager::Instance()->SpawnCircularWave(10, worldPosition, 5.f, 0.1, 0.1);\n            break;;\n        }\n\t}\n}\n\nvoid Window::CreateWindow()\n{\n    if (isFullscreen_)\n    {\n        monitor_ = glfwGetPrimaryMonitor();\n    }\n   \n    glfwWindowHint(GLFW_SAMPLES, 8);\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 4);\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 4);\n    glfwWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE);\n    glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);\n\n    window_ = glfwCreateWindow(width_, height_, name_.c_str(), monitor_, NULL);\n    glfwMakeContextCurrent(window_);\n    \n    glewExperimental = GL_TRUE;\n    glewInit();\n    glGetError();\n    if (isVSync_)\n    {\n        glfwSwapInterval(1);\n    }\n\n    glfwSetWindowSizeCallback(window_, Resize_CallBack);\n    glfwSetKeyCallback(window_, Keyboard_Callback);\n    glfwSetMouseButtonCallback(window_, Mouse_Callback);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"ShapeDemo.h\"\n\n#include <glbinding\/gl\/enum.h>\n\n#include <gloperate\/gloperate.h>\n\n#include <gloperate\/stages\/base\/TextureLoadStage.h>\n#include <gloperate\/stages\/base\/BasicFramebufferStage.h>\n#include <gloperate\/stages\/base\/FramebufferStage.h>\n#include <gloperate\/stages\/base\/TextureStage.h>\n#include <gloperate\/stages\/base\/ProgramStage.h>\n#include <gloperate\/stages\/base\/RenderPassStage.h>\n#include <gloperate\/stages\/base\/RasterizationStage.h>\n#include <gloperate\/stages\/base\/ClearStage.h>\n#include <gloperate\/stages\/base\/ShapeStage.h>\n#include <gloperate\/stages\/base\/TimerStage.h>\n#include <gloperate\/stages\/base\/TransformStage.h>\n#include <gloperate\/stages\/navigation\/TrackballStage.h>\n#include <gloperate\/rendering\/Shape.h>\n#include <gloperate\/rendering\/Quad.h>\n\n\nCPPEXPOSE_COMPONENT(ShapeDemo, gloperate::Stage)\n\n\nusing namespace cppexpose;\nusing namespace gloperate;\n\n\nShapeDemo::ShapeDemo(Environment * environment, const std::string & name)\n: Pipeline(environment, \"ShapeDemo\", name)\n, renderInterface(this)\n, shape(\"shape\", this, ShapeType::Box)\n, texture(\"texture\", this)\n, angle(\"angle\", this, 0.0f)\n, rotate(\"rotate\", this, false)\n, color(\"color\", this, Color(255, 255, 255, 255))\n, m_timer(cppassist::make_unique<TimerStage>(environment, \"Timer\"))\n, m_trackball(cppassist::make_unique<TrackballStage>(environment, \"Trackball\"))\n, m_shape(cppassist::make_unique<ShapeStage>(environment, \"Shape\"))\n, m_texture(cppassist::make_unique<TextureLoadStage>(environment, \"Texture\"))\n, m_framebuffer(cppassist::make_unique<BasicFramebufferStage>(environment, \"Framebuffer\"))\n, m_clear(cppassist::make_unique<ClearStage>(environment, \"Clear\"))\n, m_shapeTransform(cppassist::make_unique<TransformStage>(environment, \"ShapeTransform\"))\n, m_shapeProgram(cppassist::make_unique<ProgramStage>(environment, \"ShapeProgram\"))\n, m_shapeRenderPass(cppassist::make_unique<RenderPassStage>(environment, \"ShapeRenderPass\"))\n, m_shapeRasterization(cppassist::make_unique<RasterizationStage>(environment, \"ShapeRasterization\"))\n, m_colorizeProgram(cppassist::make_unique<ProgramStage>(environment, \"ColorizeProgram\"))\n, m_colorizeRenderPass(cppassist::make_unique<RenderPassStage>(environment, \"ColorizeRenderPass\"))\n, m_colorizeRasterization(cppassist::make_unique<RasterizationStage>(environment, \"ColorizeRasterization\"))\n{\n    \/\/ Get data path\n    std::string dataPath = gloperate::dataPath();\n\n    \/\/ Setup parameters\n    texture = dataPath + \"\/gloperate\/textures\/gloperate-logo.glraw\";\n\n    angle.setOption(\"minimumValue\", 0.0f);\n    angle.setOption(\"maximumValue\", 2.0f * glm::pi<float>());\n    angle.setOption(\"updateOnDrag\", true);\n\n    rotate.valueChanged.connect(this, &ShapeDemo::onRotateChanged);\n\n    \/\/ Timer stage\n    addStage(m_timer.get());\n    m_timer->interval = 2.0f * glm::pi<float>();\n\n    \/\/ Trackball stage\n    addStage(m_trackball.get());\n    m_trackball->viewport << renderInterface.deviceViewport;\n\n    \/\/ Shape stage\n    addStage(m_shape.get());\n    m_shape->shapeType << this->shape;\n    m_shape->width     = 1.0f;\n    m_shape->height    = 1.0f;\n    m_shape->depth     = 1.0f;\n    m_shape->radius    = 1.0f;\n    m_shape->texCoords = true;\n\n    \/\/ Texture loader stage\n    addStage(m_texture.get());\n    m_texture->filename << texture;\n\n    \/\/ Framebuffer stage\n    addStage(m_framebuffer.get());\n    m_framebuffer->viewport << renderInterface.deviceViewport;\n\n    \/\/ Clear stage\n    addStage(m_clear.get());\n    m_clear->renderInterface.targetFBO << m_framebuffer->fbo;\n    m_clear->renderInterface.deviceViewport << renderInterface.deviceViewport;\n    m_clear->renderInterface.backgroundColor = Color(0.0f, 0.0f, 0.0f, 1.0f);\n    m_clear->colorTexture << m_framebuffer->colorTexture;\n    m_clear->createInput(\"renderPass\") << m_shapeRenderPass->renderPass;\n\n    \/\/ Transform stage for shape\n    addStage(m_shapeTransform.get());\n    m_shapeTransform->rotationAngle << angle;\n\n    \/\/ Program stage for shape\n    addStage(m_shapeProgram.get());\n    *m_shapeProgram->createInput<cppassist::FilePath>(\"vertexShader\")   = dataPath + \"\/gloperate\/shaders\/geometry\/geometry.vert\";\n    *m_shapeProgram->createInput<cppassist::FilePath>(\"fragmentShader\") = dataPath + \"\/gloperate\/shaders\/geometry\/geometry.frag\";\n\n    \/\/ Render pass stage for shape\n    addStage(m_shapeRenderPass.get());\n    m_shapeRenderPass->culling = false;\n    m_shapeRenderPass->drawable << m_shape->drawable;\n    m_shapeRenderPass->program << m_shapeProgram->program;\n    m_shapeRenderPass->camera << m_trackball->camera;\n    m_shapeRenderPass->modelMatrix << m_shapeTransform->modelMatrix;\n    m_shapeRenderPass->createInput(\"color\") << this->color;\n    m_shapeRenderPass->createInput(\"tex0\") << m_texture->texture;\n\n    \/\/ Rasterization stage for shape\n    addStage(m_shapeRasterization.get());\n    m_shapeRasterization->renderInterface.targetFBO << m_clear->fboOut;\n    m_shapeRasterization->renderInterface.deviceViewport << renderInterface.deviceViewport;\n    m_shapeRasterization->drawable << m_shapeRenderPass->renderPass;\n    m_shapeRasterization->colorTexture << m_clear->colorTextureOut;\n\n    \/\/ Colorize program stage\n    addStage(m_colorizeProgram.get());\n    *m_colorizeProgram->createInput<cppassist::FilePath>(\"shader1\") = dataPath + \"\/gloperate\/shaders\/geometry\/screenaligned.vert\";\n    *m_colorizeProgram->createInput<cppassist::FilePath>(\"shader2\") = dataPath + \"\/gloperate\/shaders\/demo\/colorize.frag\";\n\n    \/\/ Colorize render pass stage\n    addStage(m_colorizeRenderPass.get());\n    \/\/ m_colorizeRenderPass->drawable is set in onContextInit()\n    m_colorizeRenderPass->program << m_colorizeProgram->program;\n    m_colorizeRenderPass->culling = false;\n    m_colorizeRenderPass->createInput(\"color\") << this->color;\n    m_colorizeRenderPass->createInput(\"source\") << m_shapeRasterization->colorTextureOut;\n\n    \/\/ Colorize rasterization stage\n    addStage(m_colorizeRasterization.get());\n    m_colorizeRasterization->renderInterface.targetFBO << renderInterface.targetFBO;\n    m_colorizeRasterization->renderInterface.deviceViewport << renderInterface.deviceViewport;\n    m_colorizeRasterization->drawable << m_colorizeRenderPass->renderPass;\n\n    \/\/ Outputs\n    renderInterface.rendered << m_colorizeRasterization->renderInterface.rendered;\n\n    \/\/ Start rotation\n    rotate = true;\n}\n\nShapeDemo::~ShapeDemo()\n{\n}\n\nvoid ShapeDemo::onContextInit(AbstractGLContext * context)\n{\n    Pipeline::onContextInit(context);\n\n    m_quad = cppassist::make_unique<Quad>(2.0f);\n\n    m_colorizeRenderPass->drawable = m_quad.get();\n}\n\nvoid ShapeDemo::onContextDeinit(AbstractGLContext * context)\n{\n    Pipeline::onContextDeinit(context);\n\n    m_quad = nullptr;\n}\n\nvoid ShapeDemo::onRotateChanged(const bool & rotate)\n{\n    \/\/ Switch rotation on\n    if (rotate)\n    {\n        \/\/ Set timer to current rotation value\n        m_timer->virtualTime = *angle;\n\n        \/\/ Connect angle to timer and resume timer\n        angle << m_timer->virtualTime;\n        m_timer->timeDelta << renderInterface.timeDelta;\n    }\n\n    \/\/ Switch rotation off\n    else\n    {\n        \/\/ Set angle to current timer value\n        angle.disconnect();\n        angle = *m_timer->virtualTime;\n\n        \/\/ Stop time\n        m_timer->timeDelta.disconnect();\n    }\n}\n<commit_msg>Fix shape demo rendering<commit_after>\n#include \"ShapeDemo.h\"\n\n#include <glbinding\/gl\/enum.h>\n\n#include <gloperate\/gloperate.h>\n\n#include <gloperate\/stages\/base\/TextureLoadStage.h>\n#include <gloperate\/stages\/base\/BasicFramebufferStage.h>\n#include <gloperate\/stages\/base\/FramebufferStage.h>\n#include <gloperate\/stages\/base\/TextureStage.h>\n#include <gloperate\/stages\/base\/ProgramStage.h>\n#include <gloperate\/stages\/base\/RenderPassStage.h>\n#include <gloperate\/stages\/base\/RasterizationStage.h>\n#include <gloperate\/stages\/base\/ClearStage.h>\n#include <gloperate\/stages\/base\/ShapeStage.h>\n#include <gloperate\/stages\/base\/TimerStage.h>\n#include <gloperate\/stages\/base\/TransformStage.h>\n#include <gloperate\/stages\/navigation\/TrackballStage.h>\n#include <gloperate\/rendering\/Shape.h>\n#include <gloperate\/rendering\/Quad.h>\n\n\nCPPEXPOSE_COMPONENT(ShapeDemo, gloperate::Stage)\n\n\nusing namespace cppexpose;\nusing namespace gloperate;\n\n\nShapeDemo::ShapeDemo(Environment * environment, const std::string & name)\n: Pipeline(environment, \"ShapeDemo\", name)\n, renderInterface(this)\n, shape(\"shape\", this, ShapeType::Box)\n, texture(\"texture\", this)\n, angle(\"angle\", this, 0.0f)\n, rotate(\"rotate\", this, false)\n, color(\"color\", this, Color(255, 255, 255, 255))\n, m_timer(cppassist::make_unique<TimerStage>(environment, \"Timer\"))\n, m_trackball(cppassist::make_unique<TrackballStage>(environment, \"Trackball\"))\n, m_shape(cppassist::make_unique<ShapeStage>(environment, \"Shape\"))\n, m_texture(cppassist::make_unique<TextureLoadStage>(environment, \"Texture\"))\n, m_framebuffer(cppassist::make_unique<BasicFramebufferStage>(environment, \"Framebuffer\"))\n, m_clear(cppassist::make_unique<ClearStage>(environment, \"Clear\"))\n, m_shapeTransform(cppassist::make_unique<TransformStage>(environment, \"ShapeTransform\"))\n, m_shapeProgram(cppassist::make_unique<ProgramStage>(environment, \"ShapeProgram\"))\n, m_shapeRenderPass(cppassist::make_unique<RenderPassStage>(environment, \"ShapeRenderPass\"))\n, m_shapeRasterization(cppassist::make_unique<RasterizationStage>(environment, \"ShapeRasterization\"))\n, m_colorizeProgram(cppassist::make_unique<ProgramStage>(environment, \"ColorizeProgram\"))\n, m_colorizeRenderPass(cppassist::make_unique<RenderPassStage>(environment, \"ColorizeRenderPass\"))\n, m_colorizeRasterization(cppassist::make_unique<RasterizationStage>(environment, \"ColorizeRasterization\"))\n{\n    \/\/ Get data path\n    std::string dataPath = gloperate::dataPath();\n\n    \/\/ Setup parameters\n    texture = dataPath + \"\/gloperate\/textures\/gloperate-logo.glraw\";\n\n    angle.setOption(\"minimumValue\", 0.0f);\n    angle.setOption(\"maximumValue\", 2.0f * glm::pi<float>());\n    angle.setOption(\"updateOnDrag\", true);\n\n    rotate.valueChanged.connect(this, &ShapeDemo::onRotateChanged);\n\n    \/\/ Timer stage\n    addStage(m_timer.get());\n    m_timer->interval = 2.0f * glm::pi<float>();\n\n    \/\/ Trackball stage\n    addStage(m_trackball.get());\n    m_trackball->viewport << renderInterface.deviceViewport;\n\n    \/\/ Shape stage\n    addStage(m_shape.get());\n    m_shape->shapeType << this->shape;\n    m_shape->width     = 1.0f;\n    m_shape->height    = 1.0f;\n    m_shape->depth     = 1.0f;\n    m_shape->radius    = 1.0f;\n    m_shape->texCoords = true;\n\n    \/\/ Texture loader stage\n    addStage(m_texture.get());\n    m_texture->filename << texture;\n\n    \/\/ Framebuffer stage\n    addStage(m_framebuffer.get());\n    m_framebuffer->viewport << renderInterface.deviceViewport;\n\n    \/\/ Clear stage\n    addStage(m_clear.get());\n    m_clear->renderInterface.targetFBO << m_framebuffer->fbo;\n    m_clear->renderInterface.deviceViewport << renderInterface.deviceViewport;\n    m_clear->renderInterface.backgroundColor = Color(0.0f, 0.0f, 0.0f, 1.0f);\n    m_clear->colorTexture << m_framebuffer->colorTexture;\n    m_clear->createInput(\"renderPass\") << m_shapeRenderPass->renderPass;\n\n    \/\/ Transform stage for shape\n    addStage(m_shapeTransform.get());\n    m_shapeTransform->rotationAngle << angle;\n\n    \/\/ Program stage for shape\n    addStage(m_shapeProgram.get());\n    *m_shapeProgram->createInput<cppassist::FilePath>(\"vertexShader\")   = dataPath + \"\/gloperate\/shaders\/geometry\/geometry.vert\";\n    *m_shapeProgram->createInput<cppassist::FilePath>(\"fragmentShader\") = dataPath + \"\/gloperate\/shaders\/geometry\/geometry.frag\";\n\n    \/\/ Render pass stage for shape\n    addStage(m_shapeRenderPass.get());\n    m_shapeRenderPass->culling = false;\n    m_shapeRenderPass->drawable << m_shape->drawable;\n    m_shapeRenderPass->program << m_shapeProgram->program;\n    m_shapeRenderPass->camera << m_trackball->camera;\n    m_shapeRenderPass->modelMatrix << m_shapeTransform->modelMatrix;\n    m_shapeRenderPass->createInput(\"color\") << this->color;\n    m_shapeRenderPass->createInput(\"tex0\") << m_texture->texture;\n\n    \/\/ Rasterization stage for shape\n    addStage(m_shapeRasterization.get());\n    m_shapeRasterization->renderInterface.targetFBO << m_clear->fboOut;\n    m_shapeRasterization->renderInterface.deviceViewport << renderInterface.deviceViewport;\n    m_shapeRasterization->drawable << m_shapeRenderPass->renderPass;\n    m_shapeRasterization->colorTexture << m_clear->colorTextureOut;\n\n    \/\/ Colorize program stage\n    addStage(m_colorizeProgram.get());\n    *m_colorizeProgram->createInput<cppassist::FilePath>(\"shader1\") = dataPath + \"\/gloperate\/shaders\/geometry\/screenaligned.vert\";\n    *m_colorizeProgram->createInput<cppassist::FilePath>(\"shader2\") = dataPath + \"\/gloperate\/shaders\/demo\/colorize.frag\";\n\n    \/\/ Colorize render pass stage\n    addStage(m_colorizeRenderPass.get());\n    \/\/ m_colorizeRenderPass->drawable is set in onContextInit()\n    m_colorizeRenderPass->program << m_colorizeProgram->program;\n    m_colorizeRenderPass->culling = false;\n    m_colorizeRenderPass->depthTest = false;\n    m_colorizeRenderPass->createInput(\"color\") << this->color;\n    m_colorizeRenderPass->createInput(\"source\") << m_shapeRasterization->colorTextureOut;\n\n    \/\/ Colorize rasterization stage\n    addStage(m_colorizeRasterization.get());\n    m_colorizeRasterization->renderInterface.targetFBO << renderInterface.targetFBO;\n    m_colorizeRasterization->renderInterface.deviceViewport << renderInterface.deviceViewport;\n    m_colorizeRasterization->drawable << m_colorizeRenderPass->renderPass;\n\n    \/\/ Outputs\n    renderInterface.rendered << m_colorizeRasterization->renderInterface.rendered;\n\n    \/\/ Start rotation\n    rotate = true;\n}\n\nShapeDemo::~ShapeDemo()\n{\n}\n\nvoid ShapeDemo::onContextInit(AbstractGLContext * context)\n{\n    Pipeline::onContextInit(context);\n\n    m_quad = cppassist::make_unique<Quad>(2.0f);\n\n    m_colorizeRenderPass->drawable = m_quad.get();\n}\n\nvoid ShapeDemo::onContextDeinit(AbstractGLContext * context)\n{\n    Pipeline::onContextDeinit(context);\n\n    m_quad = nullptr;\n}\n\nvoid ShapeDemo::onRotateChanged(const bool & rotate)\n{\n    \/\/ Switch rotation on\n    if (rotate)\n    {\n        \/\/ Set timer to current rotation value\n        m_timer->virtualTime = *angle;\n\n        \/\/ Connect angle to timer and resume timer\n        angle << m_timer->virtualTime;\n        m_timer->timeDelta << renderInterface.timeDelta;\n    }\n\n    \/\/ Switch rotation off\n    else\n    {\n        \/\/ Set angle to current timer value\n        angle.disconnect();\n        angle = *m_timer->virtualTime;\n\n        \/\/ Stop time\n        m_timer->timeDelta.disconnect();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: RTableConnection.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: kz $ $Date: 2007-05-10 10:40: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_dbaccess.hxx\"\n#ifndef DBAUI_RTABLECONNECTION_HXX\n#include \"RTableConnection.hxx\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef DBAUI_RELATION_TABLEVIEW_HXX\n#include \"RelationTableView.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef DBAUI_CONNECTIONLINE_HXX\n#include \"ConnectionLine.hxx\"\n#endif\n\nusing namespace dbaui;\n\/\/========================================================================\n\/\/ class ORelationTableConnection\n\/\/========================================================================\nDBG_NAME(ORelationTableConnection)\n\/\/------------------------------------------------------------------------\nORelationTableConnection::ORelationTableConnection( ORelationTableView* pContainer,\n                                                   ORelationTableConnectionData* pTabConnData )\n    :OTableConnection( pContainer, pTabConnData )\n{\n    DBG_CTOR(ORelationTableConnection,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nORelationTableConnection::ORelationTableConnection( const ORelationTableConnection& rConn )\n    : OTableConnection( rConn )\n{\n    DBG_CTOR(ORelationTableConnection,NULL);\n    \/\/ keine eigenen Members, also reicht die Basisklassenfunktionalitaet\n}\n\n\/\/------------------------------------------------------------------------\nORelationTableConnection::~ORelationTableConnection()\n{\n    DBG_DTOR(ORelationTableConnection,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nORelationTableConnection& ORelationTableConnection::operator=( const ORelationTableConnection& rConn )\n{\n    DBG_CHKTHIS(ORelationTableConnection,NULL);\n    \/\/ nicht dass es was aendern wuerde, da die Basisklasse das auch testet und ich keine eigenen Members zu kopieren habe\n    if (&rConn == this)\n        return *this;\n\n    OTableConnection::operator=( rConn );\n    return *this;\n}\n\n\n\/\/------------------------------------------------------------------------\nvoid ORelationTableConnection::Draw( const Rectangle& rRect )\n{\n    DBG_CHKTHIS(ORelationTableConnection,NULL);\n    OTableConnection::Draw( rRect );\n    ORelationTableConnectionData* pData =\n        static_cast< ORelationTableConnectionData* >(GetData());\n    if ( pData && (pData->GetCardinality() == CARDINAL_UNDEFINED) )\n        return;\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Linien nach oberster Linie durchsuchen\n    Rectangle aBoundingRect;\n    long nTop = GetBoundingRect().Bottom();\n    long nTemp;\n\n    const OConnectionLine* pTopLine = NULL;\n    const ::std::vector<OConnectionLine*>* pConnLineList = GetConnLineList();\n    ::std::vector<OConnectionLine*>::const_iterator aIter = pConnLineList->begin();\n    for(;aIter != pConnLineList->end();++aIter)\n    {\n        if( (*aIter)->IsValid() )\n        {\n            aBoundingRect = (*aIter)->GetBoundingRect();\n            nTemp = aBoundingRect.Top();\n            if( nTemp<nTop )\n            {\n                nTop = nTemp;\n                pTopLine = (*aIter);\n            }\n        }\n    }\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Kardinalitaet antragen\n    if( !pTopLine )\n        return;\n\n    Rectangle aSourcePos = pTopLine->GetSourceTextPos();\n    Rectangle aDestPos = pTopLine->GetDestTextPos();\n\n    String aSourceText;\n    String aDestText;\n\n    switch( ((ORelationTableConnectionData*)GetData())->GetCardinality() )\n    {\n    case CARDINAL_ONE_MANY:\n        aSourceText  ='1';\n        aDestText  ='n';\n        break;\n\n    case CARDINAL_MANY_ONE:\n        aSourceText  ='n';\n        aDestText  ='1';\n        break;\n\n    case CARDINAL_ONE_ONE:\n        aSourceText  ='1';\n        aDestText  ='1';\n        break;\n    }\n\n    if (IsSelected())\n        GetParent()->SetTextColor(Application::GetSettings().GetStyleSettings().GetHighlightColor());\n    else\n        GetParent()->SetTextColor(Application::GetSettings().GetStyleSettings().GetWindowTextColor());\n\n\n    GetParent()->DrawText( aSourcePos, aSourceText, TEXT_DRAW_CLIP | TEXT_DRAW_CENTER | TEXT_DRAW_BOTTOM);\n    GetParent()->DrawText( aDestPos, aDestText, TEXT_DRAW_CLIP | TEXT_DRAW_CENTER | TEXT_DRAW_BOTTOM);\n}\n\/\/ -----------------------------------------------------------------------------\n\n\n\n<commit_msg>INTEGRATION: CWS dba24b (1.8.46); FILE MERGED 2007\/08\/16 06:14:44 oj 1.8.46.1: #i56898# clean up of the class structure<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: RTableConnection.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-01 15:36: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_dbaccess.hxx\"\n#ifndef DBAUI_RTABLECONNECTION_HXX\n#include \"RTableConnection.hxx\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef DBAUI_RELATION_TABLEVIEW_HXX\n#include \"RelationTableView.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef DBAUI_CONNECTIONLINE_HXX\n#include \"ConnectionLine.hxx\"\n#endif\n\nusing namespace dbaui;\n\/\/========================================================================\n\/\/ class ORelationTableConnection\n\/\/========================================================================\nDBG_NAME(ORelationTableConnection)\n\/\/------------------------------------------------------------------------\nORelationTableConnection::ORelationTableConnection( ORelationTableView* pContainer,\n                                                   const TTableConnectionData::value_type& pTabConnData )\n    :OTableConnection( pContainer, pTabConnData )\n{\n    DBG_CTOR(ORelationTableConnection,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nORelationTableConnection::ORelationTableConnection( const ORelationTableConnection& rConn )\n    : OTableConnection( rConn )\n{\n    DBG_CTOR(ORelationTableConnection,NULL);\n    \/\/ keine eigenen Members, also reicht die Basisklassenfunktionalitaet\n}\n\n\/\/------------------------------------------------------------------------\nORelationTableConnection::~ORelationTableConnection()\n{\n    DBG_DTOR(ORelationTableConnection,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nORelationTableConnection& ORelationTableConnection::operator=( const ORelationTableConnection& rConn )\n{\n    DBG_CHKTHIS(ORelationTableConnection,NULL);\n    \/\/ nicht dass es was aendern wuerde, da die Basisklasse das auch testet und ich keine eigenen Members zu kopieren habe\n    if (&rConn == this)\n        return *this;\n\n    OTableConnection::operator=( rConn );\n    return *this;\n}\n\n\n\/\/------------------------------------------------------------------------\nvoid ORelationTableConnection::Draw( const Rectangle& rRect )\n{\n    DBG_CHKTHIS(ORelationTableConnection,NULL);\n    OTableConnection::Draw( rRect );\n    ORelationTableConnectionData* pData =\n        static_cast< ORelationTableConnectionData* >(GetData().get());\n    if ( pData && (pData->GetCardinality() == CARDINAL_UNDEFINED) )\n        return;\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Linien nach oberster Linie durchsuchen\n    Rectangle aBoundingRect;\n    long nTop = GetBoundingRect().Bottom();\n    long nTemp;\n\n    const OConnectionLine* pTopLine = NULL;\n    const ::std::vector<OConnectionLine*>* pConnLineList = GetConnLineList();\n    ::std::vector<OConnectionLine*>::const_iterator aIter = pConnLineList->begin();\n    for(;aIter != pConnLineList->end();++aIter)\n    {\n        if( (*aIter)->IsValid() )\n        {\n            aBoundingRect = (*aIter)->GetBoundingRect();\n            nTemp = aBoundingRect.Top();\n            if( nTemp<nTop )\n            {\n                nTop = nTemp;\n                pTopLine = (*aIter);\n            }\n        }\n    }\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Kardinalitaet antragen\n    if( !pTopLine )\n        return;\n\n    Rectangle aSourcePos = pTopLine->GetSourceTextPos();\n    Rectangle aDestPos = pTopLine->GetDestTextPos();\n\n    String aSourceText;\n    String aDestText;\n\n    switch( pData->GetCardinality() )\n    {\n    case CARDINAL_ONE_MANY:\n        aSourceText  ='1';\n        aDestText  ='n';\n        break;\n\n    case CARDINAL_MANY_ONE:\n        aSourceText  ='n';\n        aDestText  ='1';\n        break;\n\n    case CARDINAL_ONE_ONE:\n        aSourceText  ='1';\n        aDestText  ='1';\n        break;\n    }\n\n    if (IsSelected())\n        GetParent()->SetTextColor(Application::GetSettings().GetStyleSettings().GetHighlightColor());\n    else\n        GetParent()->SetTextColor(Application::GetSettings().GetStyleSettings().GetWindowTextColor());\n\n\n    GetParent()->DrawText( aSourcePos, aSourceText, TEXT_DRAW_CLIP | TEXT_DRAW_CENTER | TEXT_DRAW_BOTTOM);\n    GetParent()->DrawText( aDestPos, aDestText, TEXT_DRAW_CLIP | TEXT_DRAW_CENTER | TEXT_DRAW_BOTTOM);\n}\n\/\/ -----------------------------------------------------------------------------\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the CernVM File System\n *\/\n\n#define __STDC_FORMAT_MACROS\n\n#include \"sync_union_tarball.h\"\n\n#include <pthread.h>\n\n#include <cassert>\n#include <cstdio>\n#include <list>\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"duplex_libarchive.h\"\n#include \"fs_traversal.h\"\n#include \"smalloc.h\"\n#include \"sync_item.h\"\n#include \"sync_item_dummy.h\"\n#include \"sync_item_tar.h\"\n#include \"sync_mediator.h\"\n#include \"sync_union.h\"\n#include \"util\/posix.h\"\n#include \"util_concurrency.h\"\n\nnamespace publish {\n\nSyncUnionTarball::SyncUnionTarball(AbstractSyncMediator *mediator,\n                                   const std::string &rdonly_path,\n                                   const std::string &tarball_path,\n                                   const std::string &base_directory,\n                                   const std::string &to_delete,\n                                   const bool create_catalog_on_root)\n    : SyncUnion(mediator, rdonly_path, \"\", \"\"),\n      src(NULL),\n      tarball_path_(tarball_path),\n      base_directory_(base_directory),\n      to_delete_(to_delete),\n      create_catalog_on_root_(create_catalog_on_root),\n      read_archive_signal_(new Signal) {}\n\nSyncUnionTarball::~SyncUnionTarball() { delete read_archive_signal_; }\n\nbool SyncUnionTarball::Initialize() {\n  bool result;\n\n  \/\/ We are just deleting entity from the repo\n  if (tarball_path_ == \"\") {\n    assert(NULL == src);\n    return SyncUnion::Initialize();\n  }\n\n  src = archive_read_new();\n  assert(ARCHIVE_OK == archive_read_support_format_tar(src));\n  assert(ARCHIVE_OK == archive_read_support_format_empty(src));\n\n  if (tarball_path_ == \"-\") {\n    result = archive_read_open_filename(src, NULL, kBlockSize);\n  } else {\n    std::string tarball_absolute_path = GetAbsolutePath(tarball_path_);\n    result = archive_read_open_filename(src, tarball_absolute_path.c_str(),\n                                        kBlockSize);\n  }\n\n  if (result != ARCHIVE_OK) {\n    LogCvmfs(kLogUnionFs, kLogStderr, \"Impossible to open the archive.\");\n    return false;\n  }\n\n  return SyncUnion::Initialize();\n}\n\n\/*\n * Libarchive is not thread aware, so we need to make sure that before\n * to read\/\"open\" the next header in the archive the content of the\n *\n * present header is been consumed completely.\n * Different thread read\/\"open\" the header from the one that consumes\n * it so we opted for a Signal that is backed by a conditional variable.\n * We wait for the signal just before to read the header.\n * Then when we have done with the header the Signal is fired.\n * The Signal can be fired inside the main loop if we don't need to read\n * data, or when the IngestionSource get closed, which means that we are\n * not reading data anymore from there.\n * This whole process is not necessary for directories since we don't\n * actually need to read data from them.\n *\n * It may be needed to add a catalog as a root of the archive.\n * A possible way to do it is by creating an virtual `.cvmfscatalog` file and\n * push it into the usual pipeline.\n * This operation must be done only once, and it seems like a good idea to do\n * it at the first iteration of the loop, hence this logic is managed by the\n * `first_iteration` boolean flag.\n *\/\nvoid SyncUnionTarball::Traverse() {\n  read_archive_signal_->Wakeup();\n  assert(this->IsInitialized());\n\n  \/*\n   * As first step we eliminate the requested directories.\n   *\/\n  if (to_delete_ != \"\") {\n    vector<std::string> to_eliminate_vec = SplitString(to_delete_, ':');\n\n    for (vector<string>::iterator s = to_eliminate_vec.begin();\n         s != to_eliminate_vec.end(); ++s) {\n      std::string parent_path;\n      std::string filename;\n      SplitPath(*s, &parent_path, &filename);\n      if (parent_path == \".\") parent_path = \"\";\n      SharedPtr<SyncItem> sync_entry =\n          CreateSyncItem(parent_path, filename, kItemDir);\n      mediator_->Remove(sync_entry);\n    }\n  }\n\n  \/\/ we are simplying deleting entity from  the repo\n  if (NULL == src) return;\n\n  bool first_iteration = true;\n  struct archive_entry *entry = archive_entry_new();\n  while (true) {\n    \/\/ Get the lock, wait if lock is not available yet\n    read_archive_signal_->Wait();\n\n    int result = archive_read_next_header2(src, entry);\n\n    switch (result) {\n      case ARCHIVE_FATAL: {\n        LogCvmfs(kLogUnionFs, kLogStderr,\n                 \"Fatal error in reading the archive.\\n%s\\n\",\n                 archive_error_string(src));\n        abort();\n        break;  \/\/ Only exit point with error\n      }\n\n      case ARCHIVE_RETRY: {\n        LogCvmfs(kLogUnionFs, kLogStdout,\n                 \"Error in reading the header, retrying.\\n%s\\n\",\n                 archive_error_string(src));\n        continue;\n        break;\n      }\n\n      case ARCHIVE_EOF: {\n        for (set<string>::iterator dir = to_create_catalog_dirs_.begin();\n             dir != to_create_catalog_dirs_.end(); ++dir) {\n          assert(dirs_.find(*dir) != dirs_.end());\n          SharedPtr<SyncItem> to_mark = dirs_[*dir];\n          assert(to_mark->IsDirectory());\n          to_mark->SetCatalogMarker();\n          to_mark->IsPlaceholderDirectory();\n          ProcessDirectory(to_mark);\n        }\n        return;  \/\/ Only successful exit point\n        break;\n      }\n\n      case ARCHIVE_WARN: {\n        LogCvmfs(kLogUnionFs, kLogStderr,\n                 \"Warning in uncompression reading, going on.\\n %s\",\n                 archive_error_string(src));\n        \/\/ We actually want this to enter the ARCHIVE_OK case\n      }\n\n      case ARCHIVE_OK: {\n        if (first_iteration && create_catalog_on_root_) {\n          std::string root =\n              GetRoot(std::string(archive_entry_pathname(entry)));\n          root = root + \"\/.cvmfscatalog\";\n          struct archive_entry *catalog = archive_entry_clone(entry);\n          archive_entry_set_pathname(catalog, root.c_str());\n          archive_entry_set_filetype(catalog, AE_IFREG);\n          ProcessArchiveEntry(catalog);\n          \/\/ The ProcessArchiveEntry does call Wakeup on the signal, in this\n          \/\/ particular corner case we need to re-wait for it.\n          read_archive_signal_->Wait();\n        }\n        first_iteration = false;\n\n        ProcessArchiveEntry(entry);\n        break;\n      }\n\n      default: {\n        \/\/ We should never enter in this branch, but just for safeness we prefer\n        \/\/ to abort in case we hit a case we don't how to manage.\n        LogCvmfs(kLogUnionFs, kLogStderr,\n                 \"Enter in unknow state. Aborting.\\nError: %s\\n\", result,\n                 archive_error_string(src));\n\n        abort();\n      }\n    }\n  }\n}\n\nvoid SyncUnionTarball::ProcessArchiveEntry(struct archive_entry *entry) {\n  std::string archive_file_path(archive_entry_pathname(entry));\n  archive_file_path = SanitizePath(archive_file_path);\n\n  std::string complete_path =\n      MakeCanonicalPath(base_directory_ + \"\/\" + archive_file_path);\n\n  std::string parent_path;\n  std::string filename;\n  SplitPath(complete_path, &parent_path, &filename);\n\n  CreateDirectories(parent_path);\n\n  SharedPtr<SyncItem> sync_entry = SharedPtr<SyncItem>(new SyncItemTar(\n      parent_path, filename, src, entry, read_archive_signal_, this));\n\n  if (NULL != archive_entry_hardlink(entry)) {\n    const std::string hardlink =\n        base_directory_ + \"\/\" + std::string(archive_entry_hardlink(entry));\n\n    if (hardlinks_.find(hardlink) != hardlinks_.end()) {\n      hardlinks_.find(hardlink)->second.push_back(complete_path);\n    } else {\n      std::list<std::string> to_hardlink;\n      to_hardlink.push_back(complete_path);\n      hardlinks_[hardlink] = to_hardlink;\n    }\n    read_archive_signal_->Wakeup();\n    return;\n  }\n\n  if (sync_entry->IsDirectory()) {\n    if (know_directories_.find(complete_path) != know_directories_.end()) {\n      sync_entry->IsPlaceholderDirectory();\n    }\n    ProcessUnmaterializedDirectory(sync_entry);\n    dirs_[complete_path] = sync_entry;\n    know_directories_.insert(complete_path);\n\n    read_archive_signal_->Wakeup();  \/\/ We don't need to read data and we\n                                     \/\/ can read the next header\n\n  } else if (sync_entry->IsRegularFile()) {\n    \/\/ inside the process pipeline we will wake up the signal\n    ProcessFile(sync_entry);\n    if (filename == \".cvmfscatalog\") {\n      to_create_catalog_dirs_.insert(parent_path);\n    }\n\n  } else if (sync_entry->IsSymlink() || sync_entry->IsFifo() ||\n             sync_entry->IsSocket() || sync_entry->IsCharacterDevice() ||\n             sync_entry->IsBlockDevice()) {\n    \/\/ we avoid to add an entity called as a catalog marker if it is not a\n    \/\/ regular file\n    if (filename != \".cvmfscatalog\") {\n      ProcessFile(sync_entry);\n    } else {\n      LogCvmfs(kLogUnionFs, kLogStderr,\n               \"Found entity called as a catalog marker '%s' that however is \"\n               \"not a regular file, abort\",\n               complete_path.c_str());\n      abort();\n    }\n\n    \/\/ here we don't need to read data from the tar file so we can wake up\n    \/\/ immediately the signal\n    read_archive_signal_->Wakeup();\n\n  } else {\n    LogCvmfs(kLogUnionFs, kLogStderr,\n             \"Fatal error found unexpected file: \\n%s\\n\", filename.c_str());\n    \/\/ if for any reason this code path change and we don't abort anymore,\n    \/\/ remember to wakeup the signal, otherwise we will be stuck in a deadlock\n    \/\/\n    \/\/ read_archive_signal_->Wakeup();\n    abort();\n  }\n}\n\nstd::string SyncUnionTarball::SanitizePath(const std::string &path) {\n  if (path.length() >= 2) {\n    if (path[0] == '.' && path[1] == '\/') {\n      std::string to_return(path);\n      to_return.erase(0, 2);\n      return to_return;\n    }\n  }\n  return path;\n}\n\nstd::string SyncUnionTarball::GetRoot(const std::string &path) {\n  assert(\"\" != path);\n  \/\/ it is called iterator since it \"iterate\" from directory to direrctory\n  std::string path_iterator = path;\n  std::string dir;\n  std::string filename;\n  do {\n    SplitPath(path_iterator, &dir, &filename);\n    path_iterator = dir;\n  } while (\".\" != dir);\n\n  return filename;\n}\n\nvoid SyncUnionTarball::PostUpload() {\n  std::map<const std::string, std::list<std::string> >::iterator hardlink;\n  for (hardlink = hardlinks_.begin(); hardlink != hardlinks_.end();\n       ++hardlink) {\n    std::list<std::string>::iterator entry;\n    for (entry = hardlink->second.begin(); entry != hardlink->second.end();\n         ++entry) {\n      mediator_->Clone(*entry, hardlink->first);\n    }\n  }\n}\n\nstd::string SyncUnionTarball::UnwindWhiteoutFilename(\n    SharedPtr<SyncItem> entry) const {\n  return entry->filename();\n}\n\nbool SyncUnionTarball::IsOpaqueDirectory(SharedPtr<SyncItem> directory) const {\n  return false;\n}\n\nbool SyncUnionTarball::IsWhiteoutEntry(SharedPtr<SyncItem> entry) const {\n  return false;\n}\n\n\/* Tar files are not necessarly traversed in order from root to leave.\n * So it may happens that we are expanding the file `\/a\/b\/c.txt` without\n * having created yet the directory `\/a\/b\/`.\n * In order to overcome this limitation the following function create dummy\n * directories that can be used as placeholder and that they will be overwritten\n * as soon as the real directory is found in the tarball\n *\/\nvoid SyncUnionTarball::CreateDirectories(const std::string &target) {\n  if (know_directories_.find(target) != know_directories_.end()) return;\n  if (target == \".\") return;\n\n  std::string dirname = \"\";\n  std::string filename = \"\";\n  SplitPath(target, &dirname, &filename);\n  CreateDirectories(dirname);\n\n  if (dirname == \".\") dirname = \"\";\n  SharedPtr<SyncItem> dummy = SharedPtr<SyncItem>(\n      new SyncItemDummyDir(dirname, filename, this, kItemDir));\n\n  ProcessUnmaterializedDirectory(dummy);\n  know_directories_.insert(target);\n}\n\n}  \/\/ namespace publish\n<commit_msg>free catalog entry<commit_after>\/**\n * This file is part of the CernVM File System\n *\/\n\n#define __STDC_FORMAT_MACROS\n\n#include \"sync_union_tarball.h\"\n\n#include <pthread.h>\n\n#include <cassert>\n#include <cstdio>\n#include <list>\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"duplex_libarchive.h\"\n#include \"fs_traversal.h\"\n#include \"smalloc.h\"\n#include \"sync_item.h\"\n#include \"sync_item_dummy.h\"\n#include \"sync_item_tar.h\"\n#include \"sync_mediator.h\"\n#include \"sync_union.h\"\n#include \"util\/posix.h\"\n#include \"util_concurrency.h\"\n\nnamespace publish {\n\nSyncUnionTarball::SyncUnionTarball(AbstractSyncMediator *mediator,\n                                   const std::string &rdonly_path,\n                                   const std::string &tarball_path,\n                                   const std::string &base_directory,\n                                   const std::string &to_delete,\n                                   const bool create_catalog_on_root)\n    : SyncUnion(mediator, rdonly_path, \"\", \"\"),\n      src(NULL),\n      tarball_path_(tarball_path),\n      base_directory_(base_directory),\n      to_delete_(to_delete),\n      create_catalog_on_root_(create_catalog_on_root),\n      read_archive_signal_(new Signal) {}\n\nSyncUnionTarball::~SyncUnionTarball() { delete read_archive_signal_; }\n\nbool SyncUnionTarball::Initialize() {\n  bool result;\n\n  \/\/ We are just deleting entity from the repo\n  if (tarball_path_ == \"\") {\n    assert(NULL == src);\n    return SyncUnion::Initialize();\n  }\n\n  src = archive_read_new();\n  assert(ARCHIVE_OK == archive_read_support_format_tar(src));\n  assert(ARCHIVE_OK == archive_read_support_format_empty(src));\n\n  if (tarball_path_ == \"-\") {\n    result = archive_read_open_filename(src, NULL, kBlockSize);\n  } else {\n    std::string tarball_absolute_path = GetAbsolutePath(tarball_path_);\n    result = archive_read_open_filename(src, tarball_absolute_path.c_str(),\n                                        kBlockSize);\n  }\n\n  if (result != ARCHIVE_OK) {\n    LogCvmfs(kLogUnionFs, kLogStderr, \"Impossible to open the archive.\");\n    return false;\n  }\n\n  return SyncUnion::Initialize();\n}\n\n\/*\n * Libarchive is not thread aware, so we need to make sure that before\n * to read\/\"open\" the next header in the archive the content of the\n *\n * present header is been consumed completely.\n * Different thread read\/\"open\" the header from the one that consumes\n * it so we opted for a Signal that is backed by a conditional variable.\n * We wait for the signal just before to read the header.\n * Then when we have done with the header the Signal is fired.\n * The Signal can be fired inside the main loop if we don't need to read\n * data, or when the IngestionSource get closed, which means that we are\n * not reading data anymore from there.\n * This whole process is not necessary for directories since we don't\n * actually need to read data from them.\n *\n * It may be needed to add a catalog as a root of the archive.\n * A possible way to do it is by creating an virtual `.cvmfscatalog` file and\n * push it into the usual pipeline.\n * This operation must be done only once, and it seems like a good idea to do\n * it at the first iteration of the loop, hence this logic is managed by the\n * `first_iteration` boolean flag.\n *\/\nvoid SyncUnionTarball::Traverse() {\n  read_archive_signal_->Wakeup();\n  assert(this->IsInitialized());\n\n  \/*\n   * As first step we eliminate the requested directories.\n   *\/\n  if (to_delete_ != \"\") {\n    vector<std::string> to_eliminate_vec = SplitString(to_delete_, ':');\n\n    for (vector<string>::iterator s = to_eliminate_vec.begin();\n         s != to_eliminate_vec.end(); ++s) {\n      std::string parent_path;\n      std::string filename;\n      SplitPath(*s, &parent_path, &filename);\n      if (parent_path == \".\") parent_path = \"\";\n      SharedPtr<SyncItem> sync_entry =\n          CreateSyncItem(parent_path, filename, kItemDir);\n      mediator_->Remove(sync_entry);\n    }\n  }\n\n  \/\/ we are simplying deleting entity from  the repo\n  if (NULL == src) return;\n\n  bool first_iteration = true;\n  struct archive_entry *entry = archive_entry_new();\n  while (true) {\n    \/\/ Get the lock, wait if lock is not available yet\n    read_archive_signal_->Wait();\n\n    int result = archive_read_next_header2(src, entry);\n\n    switch (result) {\n      case ARCHIVE_FATAL: {\n        LogCvmfs(kLogUnionFs, kLogStderr,\n                 \"Fatal error in reading the archive.\\n%s\\n\",\n                 archive_error_string(src));\n        abort();\n        break;  \/\/ Only exit point with error\n      }\n\n      case ARCHIVE_RETRY: {\n        LogCvmfs(kLogUnionFs, kLogStdout,\n                 \"Error in reading the header, retrying.\\n%s\\n\",\n                 archive_error_string(src));\n        continue;\n        break;\n      }\n\n      case ARCHIVE_EOF: {\n        for (set<string>::iterator dir = to_create_catalog_dirs_.begin();\n             dir != to_create_catalog_dirs_.end(); ++dir) {\n          assert(dirs_.find(*dir) != dirs_.end());\n          SharedPtr<SyncItem> to_mark = dirs_[*dir];\n          assert(to_mark->IsDirectory());\n          to_mark->SetCatalogMarker();\n          to_mark->IsPlaceholderDirectory();\n          ProcessDirectory(to_mark);\n        }\n        return;  \/\/ Only successful exit point\n        break;\n      }\n\n      case ARCHIVE_WARN: {\n        LogCvmfs(kLogUnionFs, kLogStderr,\n                 \"Warning in uncompression reading, going on.\\n %s\",\n                 archive_error_string(src));\n        \/\/ We actually want this to enter the ARCHIVE_OK case\n      }\n\n      case ARCHIVE_OK: {\n        if (first_iteration && create_catalog_on_root_) {\n          std::string root =\n              GetRoot(std::string(archive_entry_pathname(entry)));\n          root = root + \"\/.cvmfscatalog\";\n          struct archive_entry *catalog = archive_entry_clone(entry);\n          archive_entry_set_pathname(catalog, root.c_str());\n          archive_entry_set_filetype(catalog, AE_IFREG);\n          ProcessArchiveEntry(catalog);\n          archive_entry_free(catalog);\n          \/\/ The ProcessArchiveEntry does call Wakeup on the signal, in this\n          \/\/ particular corner case we need to re-wait for it.\n          read_archive_signal_->Wait();\n        }\n        first_iteration = false;\n\n        ProcessArchiveEntry(entry);\n        break;\n      }\n\n      default: {\n        \/\/ We should never enter in this branch, but just for safeness we prefer\n        \/\/ to abort in case we hit a case we don't how to manage.\n        LogCvmfs(kLogUnionFs, kLogStderr,\n                 \"Enter in unknow state. Aborting.\\nError: %s\\n\", result,\n                 archive_error_string(src));\n\n        abort();\n      }\n    }\n  }\n}\n\nvoid SyncUnionTarball::ProcessArchiveEntry(struct archive_entry *entry) {\n  std::string archive_file_path(archive_entry_pathname(entry));\n  archive_file_path = SanitizePath(archive_file_path);\n\n  std::string complete_path =\n      MakeCanonicalPath(base_directory_ + \"\/\" + archive_file_path);\n\n  std::string parent_path;\n  std::string filename;\n  SplitPath(complete_path, &parent_path, &filename);\n\n  CreateDirectories(parent_path);\n\n  SharedPtr<SyncItem> sync_entry = SharedPtr<SyncItem>(new SyncItemTar(\n      parent_path, filename, src, entry, read_archive_signal_, this));\n\n  if (NULL != archive_entry_hardlink(entry)) {\n    const std::string hardlink =\n        base_directory_ + \"\/\" + std::string(archive_entry_hardlink(entry));\n\n    if (hardlinks_.find(hardlink) != hardlinks_.end()) {\n      hardlinks_.find(hardlink)->second.push_back(complete_path);\n    } else {\n      std::list<std::string> to_hardlink;\n      to_hardlink.push_back(complete_path);\n      hardlinks_[hardlink] = to_hardlink;\n    }\n    read_archive_signal_->Wakeup();\n    return;\n  }\n\n  if (sync_entry->IsDirectory()) {\n    if (know_directories_.find(complete_path) != know_directories_.end()) {\n      sync_entry->IsPlaceholderDirectory();\n    }\n    ProcessUnmaterializedDirectory(sync_entry);\n    dirs_[complete_path] = sync_entry;\n    know_directories_.insert(complete_path);\n\n    read_archive_signal_->Wakeup();  \/\/ We don't need to read data and we\n                                     \/\/ can read the next header\n\n  } else if (sync_entry->IsRegularFile()) {\n    \/\/ inside the process pipeline we will wake up the signal\n    ProcessFile(sync_entry);\n    if (filename == \".cvmfscatalog\") {\n      to_create_catalog_dirs_.insert(parent_path);\n    }\n\n  } else if (sync_entry->IsSymlink() || sync_entry->IsFifo() ||\n             sync_entry->IsSocket() || sync_entry->IsCharacterDevice() ||\n             sync_entry->IsBlockDevice()) {\n    \/\/ we avoid to add an entity called as a catalog marker if it is not a\n    \/\/ regular file\n    if (filename != \".cvmfscatalog\") {\n      ProcessFile(sync_entry);\n    } else {\n      LogCvmfs(kLogUnionFs, kLogStderr,\n               \"Found entity called as a catalog marker '%s' that however is \"\n               \"not a regular file, abort\",\n               complete_path.c_str());\n      abort();\n    }\n\n    \/\/ here we don't need to read data from the tar file so we can wake up\n    \/\/ immediately the signal\n    read_archive_signal_->Wakeup();\n\n  } else {\n    LogCvmfs(kLogUnionFs, kLogStderr,\n             \"Fatal error found unexpected file: \\n%s\\n\", filename.c_str());\n    \/\/ if for any reason this code path change and we don't abort anymore,\n    \/\/ remember to wakeup the signal, otherwise we will be stuck in a deadlock\n    \/\/\n    \/\/ read_archive_signal_->Wakeup();\n    abort();\n  }\n}\n\nstd::string SyncUnionTarball::SanitizePath(const std::string &path) {\n  if (path.length() >= 2) {\n    if (path[0] == '.' && path[1] == '\/') {\n      std::string to_return(path);\n      to_return.erase(0, 2);\n      return to_return;\n    }\n  }\n  return path;\n}\n\nstd::string SyncUnionTarball::GetRoot(const std::string &path) {\n  assert(\"\" != path);\n  \/\/ it is called iterator since it \"iterate\" from directory to direrctory\n  std::string path_iterator = path;\n  std::string dir;\n  std::string filename;\n  do {\n    SplitPath(path_iterator, &dir, &filename);\n    path_iterator = dir;\n  } while (\".\" != dir);\n\n  return filename;\n}\n\nvoid SyncUnionTarball::PostUpload() {\n  std::map<const std::string, std::list<std::string> >::iterator hardlink;\n  for (hardlink = hardlinks_.begin(); hardlink != hardlinks_.end();\n       ++hardlink) {\n    std::list<std::string>::iterator entry;\n    for (entry = hardlink->second.begin(); entry != hardlink->second.end();\n         ++entry) {\n      mediator_->Clone(*entry, hardlink->first);\n    }\n  }\n}\n\nstd::string SyncUnionTarball::UnwindWhiteoutFilename(\n    SharedPtr<SyncItem> entry) const {\n  return entry->filename();\n}\n\nbool SyncUnionTarball::IsOpaqueDirectory(SharedPtr<SyncItem> directory) const {\n  return false;\n}\n\nbool SyncUnionTarball::IsWhiteoutEntry(SharedPtr<SyncItem> entry) const {\n  return false;\n}\n\n\/* Tar files are not necessarly traversed in order from root to leave.\n * So it may happens that we are expanding the file `\/a\/b\/c.txt` without\n * having created yet the directory `\/a\/b\/`.\n * In order to overcome this limitation the following function create dummy\n * directories that can be used as placeholder and that they will be overwritten\n * as soon as the real directory is found in the tarball\n *\/\nvoid SyncUnionTarball::CreateDirectories(const std::string &target) {\n  if (know_directories_.find(target) != know_directories_.end()) return;\n  if (target == \".\") return;\n\n  std::string dirname = \"\";\n  std::string filename = \"\";\n  SplitPath(target, &dirname, &filename);\n  CreateDirectories(dirname);\n\n  if (dirname == \".\") dirname = \"\";\n  SharedPtr<SyncItem> dummy = SharedPtr<SyncItem>(\n      new SyncItemDummyDir(dirname, filename, this, kItemDir));\n\n  ProcessUnmaterializedDirectory(dummy);\n  know_directories_.insert(target);\n}\n\n}  \/\/ namespace publish\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#include \"DataFile.hh\"\n#include \"Compiler.hh\"\n#include \"Exception.hh\"\n\n#include <sstream>\n\n#include <boost\/random\/mersenne_twister.hpp>\n\nnamespace avro {\nusing std::auto_ptr;\nusing std::ostringstream;\nusing std::istringstream;\nusing std::vector;\nusing std::copy;\nusing std::string;\n\nusing boost::array;\n\nconst string AVRO_SCHEMA_KEY(\"avro.schema\");\nconst string AVRO_CODEC_KEY(\"avro.codec\");\nconst string AVRO_NULL_CODEC(\"null\");\n\nconst size_t minSyncInterval = 32;\nconst size_t maxSyncInterval = 1u << 30;\nconst size_t defaultSyncInterval = 16 * 1024;\n\nstatic string toString(const ValidSchema& schema)\n{\n    ostringstream oss;\n    schema.toJson(oss);\n    return oss.str();\n}\n\nDataFileWriterBase::DataFileWriterBase(const char* filename,\n    const ValidSchema& schema, size_t syncInterval) :\n    filename_(filename), schema_(schema), encoderPtr_(binaryEncoder()),\n    syncInterval_(syncInterval),\n    stream_(fileOutputStream(filename)),\n    buffer_(memoryOutputStream()),\n    sync_(makeSync()), objectCount_(0)\n{\n    if (syncInterval < minSyncInterval || syncInterval > maxSyncInterval) {\n        throw Exception(boost::format(\"Invalid sync interval: %1%. \"\n            \"Should be between %2% and %3%\") % syncInterval %\n            minSyncInterval % maxSyncInterval);\n    }\n    setMetadata(AVRO_CODEC_KEY, AVRO_NULL_CODEC);\n\n    setMetadata(AVRO_SCHEMA_KEY, toString(schema));\n\n    writeHeader();\n    encoderPtr_->init(*buffer_);\n}\n\nDataFileWriterBase::~DataFileWriterBase()\n{\n    if (stream_.get()) {\n        close();\n    }\n}\n\nvoid DataFileWriterBase::close()\n{\n    flush();\n    stream_.reset();\n}\n\nvoid DataFileWriterBase::sync()\n{\n    encoderPtr_->flush();\n\n    encoderPtr_->init(*stream_);\n    avro::encode(*encoderPtr_, objectCount_);\n    int64_t byteCount = buffer_->byteCount();\n    avro::encode(*encoderPtr_, byteCount);\n    encoderPtr_->flush();\n\n    auto_ptr<InputStream> in = memoryInputStream(*buffer_);\n    copy(*in, *stream_);\n\n    encoderPtr_->init(*stream_);\n    avro::encode(*encoderPtr_, sync_);\n    encoderPtr_->flush();\n\n\n    buffer_ = memoryOutputStream();\n    encoderPtr_->init(*buffer_);\n    objectCount_ = 0;\n}\n\nvoid DataFileWriterBase::syncIfNeeded()\n{\n    encoderPtr_->flush();\n    if (buffer_->byteCount() >= syncInterval_) {\n        sync();\n    }\n}\n\nvoid DataFileWriterBase::flush()\n{\n    sync();\n}\n\nboost::mt19937 random(static_cast<uint32_t>(time(0)));\n\nDataFileSync DataFileWriterBase::makeSync()\n{\n    DataFileSync sync;\n    for (size_t i = 0; i < sync.size(); ++i) {\n        sync[i] = random();\n    }\n    return sync;\n}\n\ntypedef array<uint8_t, 4> Magic;\nstatic Magic magic = { { 'O', 'b', 'j', '\\x01' } };\n\nvoid DataFileWriterBase::writeHeader()\n{\n    encoderPtr_->init(*stream_);\n    avro::encode(*encoderPtr_, magic);\n    avro::encode(*encoderPtr_, metadata_);\n    avro::encode(*encoderPtr_, sync_);\n    encoderPtr_->flush();\n}\n\nvoid DataFileWriterBase::setMetadata(const string& key, const string& value)\n{\n    vector<uint8_t> v(value.size());\n    copy(value.begin(), value.end(), v.begin());\n    metadata_[key] = v;\n}\n\nDataFileReaderBase::DataFileReaderBase(const char* filename) :\n    filename_(filename), stream_(fileInputStream(filename)),\n    decoder_(binaryDecoder()), objectCount_(0), eof_(false),\n    block_offset_(0)\n{\n    readHeader();\n}\n\nvoid DataFileReaderBase::init()\n{\n    readerSchema_ = dataSchema_;\n    dataDecoder_  = binaryDecoder();\n    readDataBlock();\n}\n\nvoid DataFileReaderBase::init(const ValidSchema& readerSchema)\n{\n    readerSchema_ = readerSchema;\n    dataDecoder_  = (toString(readerSchema_) != toString(dataSchema_)) ?\n        resolvingDecoder(dataSchema_, readerSchema_, binaryDecoder()) :\n        binaryDecoder();\n    readDataBlock();\n}\n\nstatic void drain(InputStream& in)\n{\n    const uint8_t *p = 0;\n    size_t n = 0;\n    while (in.next(&p, &n));\n}\n\nchar hex(unsigned int x)\n{\n    return x + (x < 10 ? '0' :  ('a' - 10));\n}\n\nstd::ostream& operator << (std::ostream& os, const DataFileSync& s)\n{\n    for (size_t i = 0; i < s.size(); ++i) {\n        os << hex(s[i] \/ 16)  << hex(s[i] % 16) << ' ';\n    }\n    os << std::endl;\n    return os;\n}\n\nnamespace {\n  bool sync_match(const uint8_t *a, const DataFileSync &b) {\n      for (int i=0; i < 16; ++i) {\n        if (a[i] != b[i]) {\n          return false;\n        }\n      }\n      return true;\n  }\n}\n\nbool DataFileReaderBase::hasMore()\n{\n    if (eof_) {\n        return false;\n    } else if (objectCount_ != 0) {\n        return true;\n    }\n\n    dataDecoder_->init(*dataStream_);\n    drain(*dataStream_);\n\n    DataFileSync s;\n    decoder_->init(*stream_);\n\n    block_offset_ = stream_->byteCount();\n\n    if (0) {\n      \/\/ test\n      const uint8_t* p = 0;\n      size_t n = 0;\n      stream_->next(&p, &n);\n      if (!sync_match(p, sync_)) {\n        std::cerr << \"Huh, not a sync?\" << std::endl;\n      }\n      stream_->backup(n);\n    }\n\n    avro::decode(*decoder_, s);\n    if (s != sync_) {\n        throw Exception(\"Sync mismatch\");\n    }\n    return readDataBlock();\n}\n\nclass BoundedInputStream : public InputStream {\n    InputStream& in_;\n    size_t limit_;\n\n    bool next(const uint8_t** data, size_t* len) {\n        if (limit_ != 0 && in_.next(data, len)) {\n            if (*len > limit_) {\n                in_.backup(*len - limit_);\n                *len = limit_;\n            }\n            limit_ -= *len;\n            return true;\n        }\n        return false;\n    }\n\n    void backup(size_t len) {\n        in_.backup(len);\n        limit_ += len;\n    }\n\n    void skip(size_t len) {\n        if (len > limit_) {\n            len = limit_;\n        }\n        in_.skip(len);\n        limit_ -= len;\n    }\n\n    size_t byteCount() const {\n        return in_.byteCount();\n    }\n\n    int64_t remainingBytes() const {\n      return limit_ - in_.byteCount();\n    }\n\npublic:\n    BoundedInputStream(InputStream& in, size_t limit) :\n        in_(in), limit_(limit) { }\n};\n\nauto_ptr<InputStream> boundedInputStream(InputStream& in, size_t limit)\n{\n    return auto_ptr<InputStream>(new BoundedInputStream(in, limit));\n}\n\nbool DataFileReaderBase::readDataBlock()\n{\n    decoder_->init(*stream_);\n    const uint8_t* p = 0;\n    size_t n = 0;\n    if (! stream_->next(&p, &n)) {\n        eof_ = true;\n        return false;\n    }\n    stream_->backup(n);\n    avro::decode(*decoder_, objectCount_);\n    int64_t byteCount;\n    avro::decode(*decoder_, byteCount);\n    decoder_->init(*stream_);\n\n    auto_ptr<InputStream> st = boundedInputStream(*stream_, static_cast<size_t>(byteCount));\n    dataDecoder_->init(*st);\n    dataStream_ = st;\n\n    return true;\n}\n\nint64_t DataFileReaderBase::sizeBytes() const {\n  int64_t rem= stream_->remainingBytes();\n  if (rem == -1) return -1;\n  else {\n    \/\/ force decoder to empty its buffer\n    decoder_->init(*stream_);\n    return rem + stream_->byteCount();\n  }\n}\n\nint64_t DataFileReaderBase::blockOffsetBytes() const {\n  return block_offset_;\n}\n\nnamespace {\n  const uint8_t* find_sync_candidate(const uint8_t* begin,\n                                     const uint8_t* end,\n                                     const DataFileSync &sync) {\n    return std::find(begin, end, sync[0]);\n  }\n}\n\nvoid DataFileReaderBase::seekBlockBytes(size_t offset) {\n  \/\/ force decoder to dump its buffers\n  decoder_->init(*stream_);\n\n  if (offset == block_offset_) {\n    return;\n\n  } else if (offset >= stream_->byteCount()) {\n    dataDecoder_->init(*dataStream_);\n    drain(*dataStream_);\n\n    stream_->skip(offset - stream_->byteCount());\n    objectCount_=0;\n    while (true) {\n      int current_count= stream_->byteCount();\n      const uint8_t* p = 0;\n      size_t n = 0;\n      if (! stream_->next(&p, &n)) {\n        eof_ = true;\n        return;\n      }\n      const uint8_t *pos= find_sync_candidate(p, p+n, sync_);\n      \/\/ it isn't obvious that we can count on streams to give us a reasonable\n      \/\/ amount of data, if they don't, dealing with it could be annoying.\n      if (n < 16) {\n        throw Exception(\"Out of data looking for sync\");\n      }\n      if (pos == p + n) {\n        continue;\n      }\n      if (pos != p) {\n        stream_->backup(p+n-pos);\n        continue;\n      }\n\n      if (!sync_match(p, sync_)) {\n        \/\/ advance one byte\n        stream_->backup(n-1);\n      } else {\n        \/\/ we found it\n        stream_->backup(n);\n        hasMore();\n        break;\n      }\n    }\n  } else {\n    throw Exception(\"Cannot seek backwards in streams. This might be made to work in some cases.\");\n  }\n}\n\n\nvoid DataFileReaderBase::close()\n{\n}\n\nstatic string toString(const vector<uint8_t>& v)\n{\n    string result;\n    result.resize(v.size());\n    copy(v.begin(), v.end(), result.begin());\n    return result;\n}\n\nstatic ValidSchema makeSchema(const vector<uint8_t>& v)\n{\n    istringstream iss(toString(v));\n    ValidSchema vs;\n    compileJsonSchema(iss, vs);\n    return ValidSchema(vs);\n}\n\nvoid DataFileReaderBase::readHeader()\n{\n    decoder_->init(*stream_);\n    Magic m;\n    avro::decode(*decoder_, m);\n    if (magic != m) {\n        throw Exception(\"Invalid data file. Magic does not match: \"\n            + filename_);\n    }\n    avro::decode(*decoder_, metadata_);\n    Metadata::const_iterator it = metadata_.find(AVRO_SCHEMA_KEY);\n    if (it == metadata_.end()) {\n        throw Exception(\"No schema in metadata\");\n    }\n\n    dataSchema_ = makeSchema(it->second);\n    if (! readerSchema_.root()) {\n        readerSchema_ = dataSchema();\n    }\n\n    it = metadata_.find(AVRO_CODEC_KEY);\n    if (it != metadata_.end() && toString(it->second) != AVRO_NULL_CODEC) {\n        throw Exception(\"Unknown codec in data file: \" + toString(it->second));\n    }\n\n    \/\/ force the decoder to empty its buffer\n    decoder_->init(*stream_);\n    block_offset_ = stream_->byteCount();\n\n    avro::decode(*decoder_, sync_);\n}\n\n}   \/\/ namespace avro\n<commit_msg>pull logic out of hasMore into seek method<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#include \"DataFile.hh\"\n#include \"Compiler.hh\"\n#include \"Exception.hh\"\n\n#include <sstream>\n\n#include <boost\/random\/mersenne_twister.hpp>\n\nnamespace avro {\nusing std::auto_ptr;\nusing std::ostringstream;\nusing std::istringstream;\nusing std::vector;\nusing std::copy;\nusing std::string;\n\nusing boost::array;\n\nconst string AVRO_SCHEMA_KEY(\"avro.schema\");\nconst string AVRO_CODEC_KEY(\"avro.codec\");\nconst string AVRO_NULL_CODEC(\"null\");\n\nconst size_t minSyncInterval = 32;\nconst size_t maxSyncInterval = 1u << 30;\nconst size_t defaultSyncInterval = 16 * 1024;\n\nstatic string toString(const ValidSchema& schema)\n{\n    ostringstream oss;\n    schema.toJson(oss);\n    return oss.str();\n}\n\nDataFileWriterBase::DataFileWriterBase(const char* filename,\n    const ValidSchema& schema, size_t syncInterval) :\n    filename_(filename), schema_(schema), encoderPtr_(binaryEncoder()),\n    syncInterval_(syncInterval),\n    stream_(fileOutputStream(filename)),\n    buffer_(memoryOutputStream()),\n    sync_(makeSync()), objectCount_(0)\n{\n    if (syncInterval < minSyncInterval || syncInterval > maxSyncInterval) {\n        throw Exception(boost::format(\"Invalid sync interval: %1%. \"\n            \"Should be between %2% and %3%\") % syncInterval %\n            minSyncInterval % maxSyncInterval);\n    }\n    setMetadata(AVRO_CODEC_KEY, AVRO_NULL_CODEC);\n\n    setMetadata(AVRO_SCHEMA_KEY, toString(schema));\n\n    writeHeader();\n    encoderPtr_->init(*buffer_);\n}\n\nDataFileWriterBase::~DataFileWriterBase()\n{\n    if (stream_.get()) {\n        close();\n    }\n}\n\nvoid DataFileWriterBase::close()\n{\n    flush();\n    stream_.reset();\n}\n\nvoid DataFileWriterBase::sync()\n{\n    encoderPtr_->flush();\n\n    encoderPtr_->init(*stream_);\n    avro::encode(*encoderPtr_, objectCount_);\n    int64_t byteCount = buffer_->byteCount();\n    avro::encode(*encoderPtr_, byteCount);\n    encoderPtr_->flush();\n\n    auto_ptr<InputStream> in = memoryInputStream(*buffer_);\n    copy(*in, *stream_);\n\n    encoderPtr_->init(*stream_);\n    avro::encode(*encoderPtr_, sync_);\n    encoderPtr_->flush();\n\n\n    buffer_ = memoryOutputStream();\n    encoderPtr_->init(*buffer_);\n    objectCount_ = 0;\n}\n\nvoid DataFileWriterBase::syncIfNeeded()\n{\n    encoderPtr_->flush();\n    if (buffer_->byteCount() >= syncInterval_) {\n        sync();\n    }\n}\n\nvoid DataFileWriterBase::flush()\n{\n    sync();\n}\n\nboost::mt19937 random(static_cast<uint32_t>(time(0)));\n\nDataFileSync DataFileWriterBase::makeSync()\n{\n    DataFileSync sync;\n    for (size_t i = 0; i < sync.size(); ++i) {\n        sync[i] = random();\n    }\n    return sync;\n}\n\ntypedef array<uint8_t, 4> Magic;\nstatic Magic magic = { { 'O', 'b', 'j', '\\x01' } };\n\nvoid DataFileWriterBase::writeHeader()\n{\n    encoderPtr_->init(*stream_);\n    avro::encode(*encoderPtr_, magic);\n    avro::encode(*encoderPtr_, metadata_);\n    avro::encode(*encoderPtr_, sync_);\n    encoderPtr_->flush();\n}\n\nvoid DataFileWriterBase::setMetadata(const string& key, const string& value)\n{\n    vector<uint8_t> v(value.size());\n    copy(value.begin(), value.end(), v.begin());\n    metadata_[key] = v;\n}\n\nDataFileReaderBase::DataFileReaderBase(const char* filename) :\n    filename_(filename), stream_(fileInputStream(filename)),\n    decoder_(binaryDecoder()), objectCount_(0), eof_(false),\n    block_offset_(0)\n{\n    readHeader();\n}\n\nvoid DataFileReaderBase::init()\n{\n    readerSchema_ = dataSchema_;\n    dataDecoder_  = binaryDecoder();\n    readDataBlock();\n}\n\nvoid DataFileReaderBase::init(const ValidSchema& readerSchema)\n{\n    readerSchema_ = readerSchema;\n    dataDecoder_  = (toString(readerSchema_) != toString(dataSchema_)) ?\n        resolvingDecoder(dataSchema_, readerSchema_, binaryDecoder()) :\n        binaryDecoder();\n    readDataBlock();\n}\n\nstatic void drain(InputStream& in)\n{\n    const uint8_t *p = 0;\n    size_t n = 0;\n    while (in.next(&p, &n));\n}\n\nchar hex(unsigned int x)\n{\n    return x + (x < 10 ? '0' :  ('a' - 10));\n}\n\nstd::ostream& operator << (std::ostream& os, const DataFileSync& s)\n{\n    for (size_t i = 0; i < s.size(); ++i) {\n        os << hex(s[i] \/ 16)  << hex(s[i] % 16) << ' ';\n    }\n    os << std::endl;\n    return os;\n}\n\nbool DataFileReaderBase::hasMore()\n{\n    if (eof_) {\n        return false;\n    } else if (objectCount_ != 0) {\n        return true;\n    }\n\n    dataDecoder_->init(*dataStream_);\n    drain(*dataStream_);\n\n    DataFileSync s;\n    decoder_->init(*stream_);\n\n    block_offset_ = stream_->byteCount();\n\n    avro::decode(*decoder_, s);\n    if (s != sync_) {\n        throw Exception(\"Sync mismatch\");\n    }\n    return readDataBlock();\n}\n\nclass BoundedInputStream : public InputStream {\n    InputStream& in_;\n    size_t limit_;\n\n    bool next(const uint8_t** data, size_t* len) {\n        if (limit_ != 0 && in_.next(data, len)) {\n            if (*len > limit_) {\n                in_.backup(*len - limit_);\n                *len = limit_;\n            }\n            limit_ -= *len;\n            return true;\n        }\n        return false;\n    }\n\n    void backup(size_t len) {\n        in_.backup(len);\n        limit_ += len;\n    }\n\n    void skip(size_t len) {\n        if (len > limit_) {\n            len = limit_;\n        }\n        in_.skip(len);\n        limit_ -= len;\n    }\n\n    size_t byteCount() const {\n        return in_.byteCount();\n    }\n\n    int64_t remainingBytes() const {\n      return limit_ - in_.byteCount();\n    }\n\npublic:\n    BoundedInputStream(InputStream& in, size_t limit) :\n        in_(in), limit_(limit) { }\n};\n\nauto_ptr<InputStream> boundedInputStream(InputStream& in, size_t limit)\n{\n    return auto_ptr<InputStream>(new BoundedInputStream(in, limit));\n}\n\nbool DataFileReaderBase::readDataBlock()\n{\n    decoder_->init(*stream_);\n    const uint8_t* p = 0;\n    size_t n = 0;\n    if (! stream_->next(&p, &n)) {\n        eof_ = true;\n        return false;\n    }\n    stream_->backup(n);\n    avro::decode(*decoder_, objectCount_);\n    int64_t byteCount;\n    avro::decode(*decoder_, byteCount);\n    decoder_->init(*stream_);\n\n    auto_ptr<InputStream> st = boundedInputStream(*stream_, static_cast<size_t>(byteCount));\n    dataDecoder_->init(*st);\n    dataStream_ = st;\n\n    return true;\n}\n\nint64_t DataFileReaderBase::sizeBytes() const {\n  int64_t rem= stream_->remainingBytes();\n  if (rem == -1) return -1;\n  else {\n    \/\/ force decoder to empty its buffer\n    decoder_->init(*stream_);\n    return rem + stream_->byteCount();\n  }\n}\n\nint64_t DataFileReaderBase::blockOffsetBytes() const {\n  return block_offset_;\n}\n\nnamespace {\n  bool sync_match(const uint8_t *begin, const uint8_t *end,\n                  const DataFileSync &b) {\n      for (int i=0; i < 16; ++i) {\n        if (begin+i == end) return true;\n        if (begin[i] != b[i]) {\n          return false;\n        }\n      }\n      return true;\n  }\n}\n\nvoid DataFileReaderBase::seekBlockBytes(size_t offset) {\n  \/\/ force decoder to dump its buffers\n  decoder_->init(*stream_);\n\n  if (offset == block_offset_) {\n    return;\n\n  } else if (offset >= stream_->byteCount()) {\n    dataDecoder_->init(*dataStream_);\n    drain(*dataStream_);\n\n    stream_->skip(offset - stream_->byteCount());\n    objectCount_=0;\n    while (true) {\n      int current_count= stream_->byteCount();\n      const uint8_t* p = 0;\n      size_t n = 0;\n      if (! stream_->next(&p, &n)) {\n        eof_ = true;\n        return;\n      }\n      const uint8_t *pos= std::find(p, p+n, sync_[0]);\n      \/\/ it isn't obvious that we can count on streams to give us a reasonable\n      \/\/ amount of data, if they don't, dealing with it could be annoying.\n      if (n < 16) {\n        throw Exception(\"Out of data looking for sync\");\n      }\n      if (pos == p + n) {\n        continue;\n      }\n      if (pos != p) {\n        stream_->backup(p+n-pos);\n        continue;\n      }\n\n      if (!sync_match(p, p+n, sync_)) {\n        \/\/ advance one byte\n        stream_->backup(n-1);\n      } else {\n        \/\/ we found it\n        stream_->backup(n-16);\n        block_offset_= stream_->byteCount() - 16;\n        readDataBlock();\n        break;\n      }\n    }\n  } else {\n    throw Exception(\"Cannot seek backwards in streams. This might be made to work in some cases.\");\n  }\n}\n\n\nvoid DataFileReaderBase::close()\n{\n}\n\nstatic string toString(const vector<uint8_t>& v)\n{\n    string result;\n    result.resize(v.size());\n    copy(v.begin(), v.end(), result.begin());\n    return result;\n}\n\nstatic ValidSchema makeSchema(const vector<uint8_t>& v)\n{\n    istringstream iss(toString(v));\n    ValidSchema vs;\n    compileJsonSchema(iss, vs);\n    return ValidSchema(vs);\n}\n\nvoid DataFileReaderBase::readHeader()\n{\n    decoder_->init(*stream_);\n    Magic m;\n    avro::decode(*decoder_, m);\n    if (magic != m) {\n        throw Exception(\"Invalid data file. Magic does not match: \"\n            + filename_);\n    }\n    avro::decode(*decoder_, metadata_);\n    Metadata::const_iterator it = metadata_.find(AVRO_SCHEMA_KEY);\n    if (it == metadata_.end()) {\n        throw Exception(\"No schema in metadata\");\n    }\n\n    dataSchema_ = makeSchema(it->second);\n    if (! readerSchema_.root()) {\n        readerSchema_ = dataSchema();\n    }\n\n    it = metadata_.find(AVRO_CODEC_KEY);\n    if (it != metadata_.end() && toString(it->second) != AVRO_NULL_CODEC) {\n        throw Exception(\"Unknown codec in data file: \" + toString(it->second));\n    }\n\n    \/\/ force the decoder to empty its buffer\n    decoder_->init(*stream_);\n    block_offset_ = stream_->byteCount();\n\n    avro::decode(*decoder_, sync_);\n}\n\n}   \/\/ namespace avro\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\/*! \\file arch.inl\n *  \\brief Inline file for arch.h.\n *\/\n\n#include <string>\n#include <algorithm>\n\n#include <thrust\/detail\/util\/blocking.h>\n\n\/\/ #include this for make_uint3\n#include <vector_functions.h>\n\n\/\/ #include this for runtime_error\n#include <stdexcept>\n\nnamespace thrust\n{\nnamespace experimental\n{\nnamespace arch\n{\nnamespace detail\n{\n\ninline void checked_get_current_device_properties(cudaDeviceProp &props)\n{\n  int current_device = -1;\n\n  cudaError_t error = cudaGetDevice(&current_device);\n\n  if(error)\n    throw std::runtime_error(std::string(\"CUDA error: \") + std::string(cudaGetErrorString(error)));\n\n  if(current_device < 0)\n    throw std::runtime_error(std::string(\"No CUDA device found.\"));\n  \n  error = cudaGetDeviceProperties(&props, current_device);\n\n  if(error != cudaSuccess)\n    throw std::runtime_error(std::string(\"CUDA error: \") + std::string(cudaGetErrorString(error)));\n} \/\/ end checked_get_current_device_properties()\n\ntemplate <typename KernelFunction>\nvoid checked_get_function_attributes(cudaFuncAttributes& attributes, KernelFunction kernel)\n{\n  cudaError_t error = cudaFuncGetAttributes(&attributes, kernel);\n\n  if(error != cudaSuccess)\n    throw std::runtime_error(std::string(\"CUDA error: \") + std::string(cudaGetErrorString(error)));\n} \/\/ end checked_get_function_attributes()\n\n} \/\/ end detail\n\n\nsize_t num_multiprocessors(const cudaDeviceProp& properties)\n{\n    return properties.multiProcessorCount;\n} \/\/ end num_multiprocessors()\n\n\nsize_t max_active_threads_per_multiprocessor(const cudaDeviceProp& properties)\n{\n    \/\/ index this array by [major, minor] revision\n    \/\/ \\see NVIDIA_CUDA_Programming_Guide_2.1.pdf pp 82--83\n    static const size_t max_active_threads_by_compute_capability[2][4] = \\\n        {{     0,    0,    0,    0},\n         {   768,  768, 1024, 1024}};\n\n    \/\/ produce valid results for new, unknown devices\n    if (properties.major > 1 || properties.minor > 3)\n        return max_active_threads_by_compute_capability[1][3];\n    else\n        return max_active_threads_by_compute_capability[properties.major][properties.minor];\n} \/\/ end max_active_threads_per_multiprocessor()\n\n\nsize_t max_active_threads(const cudaDeviceProp& properties)\n{\n    return num_multiprocessors(properties) * max_active_threads_per_multiprocessor(properties);\n} \/\/ end max_active_threads()\n\n\ndim3 max_grid_dimensions(const cudaDeviceProp& properties)\n{\n    return make_uint3(properties.maxGridSize[0], properties.maxGridSize[1], properties.maxGridSize[2]);\n} \/\/ end max_grid_dimensions()\n  \n\nsize_t max_active_blocks_per_multiprocessor(const cudaDeviceProp& properties,\n                                            const cudaFuncAttributes& attributes,\n                                            size_t CTA_SIZE,\n                                            size_t dynamic_smem_bytes)\n{\n    \/\/ Determine the maximum number of CTAs that can be run simultaneously per SM\n    \/\/ This is equivalent to the calculation done in the CUDA Occupancy Calculator spreadsheet\n    const size_t regAllocationUnit = (properties.major < 2 && properties.minor < 2) ? 256 : 512; \/\/ in registers\n    const size_t warpAllocationMultiple = 2;\n    const size_t smemAllocationUnit = 512;                                                 \/\/ in bytes\n    const size_t maxThreadsPerSM = max_active_threads_per_multiprocessor(properties);      \/\/ 768, 1024, etc.\n    const size_t maxBlocksPerSM = 8;\n\n    \/\/ Number of warps (round up to nearest whole multiple of warp size & warp allocation multiple)\n    const size_t numWarps = thrust::detail::util::round_i(thrust::detail::util::divide_ri(CTA_SIZE, properties.warpSize), warpAllocationMultiple);\n\n    \/\/ Number of regs is regs per thread times number of warps times warp size\n    const size_t regsPerCTA = thrust::detail::util::round_i(attributes.numRegs * properties.warpSize * numWarps, regAllocationUnit);\n\n    const size_t smemBytes  = attributes.sharedSizeBytes + dynamic_smem_bytes;\n    const size_t smemPerCTA = thrust::detail::util::round_i(smemBytes, smemAllocationUnit);\n\n    const size_t ctaLimitRegs    = regsPerCTA > 0 ? properties.regsPerBlock \/ regsPerCTA : maxBlocksPerSM;\n    const size_t ctaLimitSMem    = smemPerCTA > 0 ? properties.sharedMemPerBlock   \/ smemPerCTA : maxBlocksPerSM;\n    const size_t ctaLimitThreads =                  maxThreadsPerSM                \/ CTA_SIZE;\n\n    return std::min<size_t>(ctaLimitRegs, std::min<size_t>(ctaLimitSMem, std::min<size_t>(ctaLimitThreads, maxBlocksPerSM)));\n}\n\n\n\n\/\/ Functions that query the runtime for device properties\n\nsize_t num_multiprocessors(void)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n    return num_multiprocessors(properties);\n} \/\/ end num_multiprocessors()\n\nsize_t max_active_threads_per_multiprocessor(void)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n    return max_active_threads_per_multiprocessor(properties);\n}\n\nsize_t max_active_threads(void)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n    return max_active_threads(properties);\n}\n\ndim3 max_grid_dimensions(void)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n    return max_grid_dimensions(properties);\n}\n\ntemplate <typename KernelFunction>\nsize_t max_active_blocks(KernelFunction kernel, const size_t CTA_SIZE, const size_t dynamic_smem_bytes)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n\n    cudaFuncAttributes attributes;\n    detail::checked_get_function_attributes(attributes, kernel);\n\n    return num_multiprocessors(properties) * max_active_blocks_per_multiprocessor(properties, attributes, CTA_SIZE, dynamic_smem_bytes);\n}\n\nsize_t max_blocksize_with_highest_occupancy(const cudaDeviceProp& properties,\n                                            const cudaFuncAttributes& attributes,\n                                            size_t dynamic_smem_bytes_per_thread)\n{\n    size_t max_occupancy = max_active_threads_per_multiprocessor(properties);\n\n    size_t largest_blocksize  = std::min(properties.maxThreadsPerBlock, attributes.maxThreadsPerBlock);\n    size_t granularity        = 32;\n\n    size_t max_blocksize     = 0;\n    size_t highest_occupancy = 0;\n\n    for(size_t blocksize = largest_blocksize; blocksize != 0; blocksize -= granularity)\n    {\n        size_t occupancy = blocksize * max_active_blocks_per_multiprocessor(properties, attributes, blocksize, dynamic_smem_bytes_per_thread * blocksize);\n\n        if (occupancy > highest_occupancy)\n        {\n            max_blocksize = blocksize;\n            highest_occupancy = occupancy;\n        }\n\n        \/\/ early out, can't do better\n        if (highest_occupancy == max_occupancy)\n            return max_blocksize;\n    }\n\n    return max_blocksize;\n}\n\ntemplate <typename KernelFunction>\nsize_t max_blocksize_with_highest_occupancy(KernelFunction kernel, size_t dynamic_smem_bytes_per_thread)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n\n    cudaFuncAttributes attributes;\n    detail::checked_get_function_attributes(attributes, kernel);\n\n    return max_blocksize_with_highest_occupancy(properties, attributes, dynamic_smem_bytes_per_thread);\n}\n\n\n\/\/ TODO unify this with max_blocksize_with_highest_occupancy\nsize_t max_blocksize(const cudaDeviceProp& properties,\n                     const cudaFuncAttributes& attributes,\n                     size_t dynamic_smem_bytes_per_thread)\n{\n    size_t max_occupancy = max_active_threads_per_multiprocessor(properties);\n\n    size_t largest_blocksize  = std::min(properties.maxThreadsPerBlock, attributes.maxThreadsPerBlock);\n    size_t granularity        = 32;\n\n    for(size_t blocksize = largest_blocksize; blocksize != 0; blocksize -= granularity)\n    {\n        if(0 < max_active_blocks_per_multiprocessor(properties, attributes, blocksize, dynamic_smem_bytes_per_thread * blocksize))\n            return blocksize;\n    }\n\n    return 0;\n}\n\ntemplate <typename KernelFunction>\nsize_t max_blocksize(KernelFunction kernel, size_t dynamic_smem_bytes_per_thread)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n\n    cudaFuncAttributes attributes;\n    detail::checked_get_function_attributes(attributes, kernel);\n\n    return max_blocksize(properties, attributes, dynamic_smem_bytes_per_thread);\n}\n\n} \/\/ end namespace arch\n} \/\/ end namespace experimental\n} \/\/ end namespace thrust\n\n<commit_msg>Eliminate unused variable from arch::max_blocksize<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\/*! \\file arch.inl\n *  \\brief Inline file for arch.h.\n *\/\n\n#include <string>\n#include <algorithm>\n\n#include <thrust\/detail\/util\/blocking.h>\n\n\/\/ #include this for make_uint3\n#include <vector_functions.h>\n\n\/\/ #include this for runtime_error\n#include <stdexcept>\n\nnamespace thrust\n{\nnamespace experimental\n{\nnamespace arch\n{\nnamespace detail\n{\n\ninline void checked_get_current_device_properties(cudaDeviceProp &props)\n{\n  int current_device = -1;\n\n  cudaError_t error = cudaGetDevice(&current_device);\n\n  if(error)\n    throw std::runtime_error(std::string(\"CUDA error: \") + std::string(cudaGetErrorString(error)));\n\n  if(current_device < 0)\n    throw std::runtime_error(std::string(\"No CUDA device found.\"));\n  \n  error = cudaGetDeviceProperties(&props, current_device);\n\n  if(error != cudaSuccess)\n    throw std::runtime_error(std::string(\"CUDA error: \") + std::string(cudaGetErrorString(error)));\n} \/\/ end checked_get_current_device_properties()\n\ntemplate <typename KernelFunction>\nvoid checked_get_function_attributes(cudaFuncAttributes& attributes, KernelFunction kernel)\n{\n  cudaError_t error = cudaFuncGetAttributes(&attributes, kernel);\n\n  if(error != cudaSuccess)\n    throw std::runtime_error(std::string(\"CUDA error: \") + std::string(cudaGetErrorString(error)));\n} \/\/ end checked_get_function_attributes()\n\n} \/\/ end detail\n\n\nsize_t num_multiprocessors(const cudaDeviceProp& properties)\n{\n    return properties.multiProcessorCount;\n} \/\/ end num_multiprocessors()\n\n\nsize_t max_active_threads_per_multiprocessor(const cudaDeviceProp& properties)\n{\n    \/\/ index this array by [major, minor] revision\n    \/\/ \\see NVIDIA_CUDA_Programming_Guide_2.1.pdf pp 82--83\n    static const size_t max_active_threads_by_compute_capability[2][4] = \\\n        {{     0,    0,    0,    0},\n         {   768,  768, 1024, 1024}};\n\n    \/\/ produce valid results for new, unknown devices\n    if (properties.major > 1 || properties.minor > 3)\n        return max_active_threads_by_compute_capability[1][3];\n    else\n        return max_active_threads_by_compute_capability[properties.major][properties.minor];\n} \/\/ end max_active_threads_per_multiprocessor()\n\n\nsize_t max_active_threads(const cudaDeviceProp& properties)\n{\n    return num_multiprocessors(properties) * max_active_threads_per_multiprocessor(properties);\n} \/\/ end max_active_threads()\n\n\ndim3 max_grid_dimensions(const cudaDeviceProp& properties)\n{\n    return make_uint3(properties.maxGridSize[0], properties.maxGridSize[1], properties.maxGridSize[2]);\n} \/\/ end max_grid_dimensions()\n  \n\nsize_t max_active_blocks_per_multiprocessor(const cudaDeviceProp& properties,\n                                            const cudaFuncAttributes& attributes,\n                                            size_t CTA_SIZE,\n                                            size_t dynamic_smem_bytes)\n{\n    \/\/ Determine the maximum number of CTAs that can be run simultaneously per SM\n    \/\/ This is equivalent to the calculation done in the CUDA Occupancy Calculator spreadsheet\n    const size_t regAllocationUnit = (properties.major < 2 && properties.minor < 2) ? 256 : 512; \/\/ in registers\n    const size_t warpAllocationMultiple = 2;\n    const size_t smemAllocationUnit = 512;                                                 \/\/ in bytes\n    const size_t maxThreadsPerSM = max_active_threads_per_multiprocessor(properties);      \/\/ 768, 1024, etc.\n    const size_t maxBlocksPerSM = 8;\n\n    \/\/ Number of warps (round up to nearest whole multiple of warp size & warp allocation multiple)\n    const size_t numWarps = thrust::detail::util::round_i(thrust::detail::util::divide_ri(CTA_SIZE, properties.warpSize), warpAllocationMultiple);\n\n    \/\/ Number of regs is regs per thread times number of warps times warp size\n    const size_t regsPerCTA = thrust::detail::util::round_i(attributes.numRegs * properties.warpSize * numWarps, regAllocationUnit);\n\n    const size_t smemBytes  = attributes.sharedSizeBytes + dynamic_smem_bytes;\n    const size_t smemPerCTA = thrust::detail::util::round_i(smemBytes, smemAllocationUnit);\n\n    const size_t ctaLimitRegs    = regsPerCTA > 0 ? properties.regsPerBlock \/ regsPerCTA : maxBlocksPerSM;\n    const size_t ctaLimitSMem    = smemPerCTA > 0 ? properties.sharedMemPerBlock   \/ smemPerCTA : maxBlocksPerSM;\n    const size_t ctaLimitThreads =                  maxThreadsPerSM                \/ CTA_SIZE;\n\n    return std::min<size_t>(ctaLimitRegs, std::min<size_t>(ctaLimitSMem, std::min<size_t>(ctaLimitThreads, maxBlocksPerSM)));\n}\n\n\n\n\/\/ Functions that query the runtime for device properties\n\nsize_t num_multiprocessors(void)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n    return num_multiprocessors(properties);\n} \/\/ end num_multiprocessors()\n\nsize_t max_active_threads_per_multiprocessor(void)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n    return max_active_threads_per_multiprocessor(properties);\n}\n\nsize_t max_active_threads(void)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n    return max_active_threads(properties);\n}\n\ndim3 max_grid_dimensions(void)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n    return max_grid_dimensions(properties);\n}\n\ntemplate <typename KernelFunction>\nsize_t max_active_blocks(KernelFunction kernel, const size_t CTA_SIZE, const size_t dynamic_smem_bytes)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n\n    cudaFuncAttributes attributes;\n    detail::checked_get_function_attributes(attributes, kernel);\n\n    return num_multiprocessors(properties) * max_active_blocks_per_multiprocessor(properties, attributes, CTA_SIZE, dynamic_smem_bytes);\n}\n\nsize_t max_blocksize_with_highest_occupancy(const cudaDeviceProp& properties,\n                                            const cudaFuncAttributes& attributes,\n                                            size_t dynamic_smem_bytes_per_thread)\n{\n    size_t max_occupancy = max_active_threads_per_multiprocessor(properties);\n\n    size_t largest_blocksize  = std::min(properties.maxThreadsPerBlock, attributes.maxThreadsPerBlock);\n    size_t granularity        = 32;\n\n    size_t max_blocksize     = 0;\n    size_t highest_occupancy = 0;\n\n    for(size_t blocksize = largest_blocksize; blocksize != 0; blocksize -= granularity)\n    {\n        size_t occupancy = blocksize * max_active_blocks_per_multiprocessor(properties, attributes, blocksize, dynamic_smem_bytes_per_thread * blocksize);\n\n        if (occupancy > highest_occupancy)\n        {\n            max_blocksize = blocksize;\n            highest_occupancy = occupancy;\n        }\n\n        \/\/ early out, can't do better\n        if (highest_occupancy == max_occupancy)\n            return max_blocksize;\n    }\n\n    return max_blocksize;\n}\n\ntemplate <typename KernelFunction>\nsize_t max_blocksize_with_highest_occupancy(KernelFunction kernel, size_t dynamic_smem_bytes_per_thread)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n\n    cudaFuncAttributes attributes;\n    detail::checked_get_function_attributes(attributes, kernel);\n\n    return max_blocksize_with_highest_occupancy(properties, attributes, dynamic_smem_bytes_per_thread);\n}\n\n\n\/\/ TODO unify this with max_blocksize_with_highest_occupancy\nsize_t max_blocksize(const cudaDeviceProp& properties,\n                     const cudaFuncAttributes& attributes,\n                     size_t dynamic_smem_bytes_per_thread)\n{\n    size_t largest_blocksize  = std::min(properties.maxThreadsPerBlock, attributes.maxThreadsPerBlock);\n    size_t granularity        = 32;\n\n    for(size_t blocksize = largest_blocksize; blocksize != 0; blocksize -= granularity)\n    {\n        if(0 < max_active_blocks_per_multiprocessor(properties, attributes, blocksize, dynamic_smem_bytes_per_thread * blocksize))\n            return blocksize;\n    }\n\n    return 0;\n}\n\ntemplate <typename KernelFunction>\nsize_t max_blocksize(KernelFunction kernel, size_t dynamic_smem_bytes_per_thread)\n{\n    cudaDeviceProp properties;  \n    detail::checked_get_current_device_properties(properties);\n\n    cudaFuncAttributes attributes;\n    detail::checked_get_function_attributes(attributes, kernel);\n\n    return max_blocksize(properties, attributes, dynamic_smem_bytes_per_thread);\n}\n\n} \/\/ end namespace arch\n} \/\/ end namespace experimental\n} \/\/ end namespace thrust\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/-----------------------------------------------------------------------------\n\/\/ All code is property of Matthew Loesby\n\/\/ Contact at Loesby.dev@gmail.com for permission to use\n\/\/ Or to discuss ideas\n\/\/ (c) 2017\n\n\/\/ Systems\/WorldTile.cpp\n\/\/ Creates and updates all tiles in the world\n\/\/ When interactions extend to a new set of tiles, creates those and starts updating them\n\n#include \"..\/Core\/typedef.h\"\n\n#include \"Systems.h\"\n\n#include \"..\/ECS\/System.h\"\n#include \"..\/ECS\/ECS.h\"\n\n#include \"..\/Util\/Pathing.h\"\n\n\/\/ Terms:\n\/\/ * Tile: Unit of the world terrain\n\/\/         It has a position in a sector\n\/\/         At standard zoom, it's 5px square\n\/\/ * Sector: A 20 x 20 grid of Tiles.\n\/\/ * Quadrant: A 2x2 Grid of Sectors\n\/\/ A world position is a combination of Quadrant X, Y\n\/\/    Sector X, Y\n\/\/    Tile X, Y\n\/\/  Printed as QX.QY:SX.SY:TX.TY\n\/\/ The world starts with 1 quadrant, player spawns in the center of it\n\/\/    So spawn position is 0.0:1.1:0.0\n\/\/ When a position beyond the current spawned quadrants becomes relevant,\n\/\/ new quadrants are spawned from the current world out to that quadrant\n\/\/ A thickness of up to 3 quadrants may be spawned to try to create pathing \n\/\/ to the target quadrant\n\nnamespace TileConstants\n{\n\tconstexpr int TILE_SIDE_LENGTH = 5;\n\tconstexpr int SECTOR_SIDE_LENGTH = 100;\n\tconstexpr int QUADRANT_SIDE_LENGTH = 4;\n\n\tconstexpr int BASE_QUADRANT_ORIGIN_COORDINATE =\n\t\t-TILE_SIDE_LENGTH *\n\t\tSECTOR_SIDE_LENGTH *\n\t\tQUADRANT_SIDE_LENGTH \/ 2;\n\n\t\/\/ Will later be configuration data\n\tconstexpr int TILE_TYPE_COUNT = 8;\n}\n\n\/\/ Non-entity data the tile system needs.\nnamespace TileNED\n{\n\tusing QuadrantId = std::pair<int, int>;\n\tusing namespace TileConstants;\n\n\tstruct Tile\n\t{\n\t\tint m_tileType;\n\t\tstd::optional<int> m_movementCost; \/\/ If notset, unpathable\n\n\t\t\/\/ Each 1 pixel is 4 components: RGBA\n\t\tsf::Uint32 m_tilePixels[TILE_SIDE_LENGTH * TILE_SIDE_LENGTH];\n\t};\n\n\tusing Pathability = bool[Pathing::PathingSide::_COUNT][Pathing::PathingSide::_COUNT];\n\n\tstruct Sector\n\t{\n\t\tPathability m_pathability;\n\t\tTile m_tiles \n\t\t\t[TileConstants::SECTOR_SIDE_LENGTH]\n\t\t\t[TileConstants::SECTOR_SIDE_LENGTH];\n\n\t};\n\tstruct Quadrant\n\t{\n\t\tPathability m_pathability;\n\t\tSector m_sectors\n\t\t\t[TileConstants::QUADRANT_SIDE_LENGTH]\n\t\t\t[TileConstants::QUADRANT_SIDE_LENGTH];\n\n\t\tsf::Texture m_texture;\n\t};\n\tusing SpawnedQuadrantMap = std::map<QuadrantId, Quadrant>;\n\tSpawnedQuadrantMap s_spawnedQuadrants;\n\tbool baseQuadrantSpawned{ false };\n\n\tstruct WorldCoordinates\n\t{\n\t\tWorldCoordinates() { }\n\t\tWorldCoordinates(CartesianVector2&& quad, CartesianVector2&& sec, CartesianVector2&& tile)\n\t\t\t: m_quadrant(quad)\n\t\t\t, m_sector(sec)\n\t\t\t, m_tile(tile)\n\t\t{}\n\t\tCartesianVector2 m_quadrant;\n\t\tCartesianVector2 m_sector;\n\t\tCartesianVector2 m_tile;\n\t};\n}\n\nvoid SpawnQuadrant(int X, int Y, ECS_Core::Manager& manager)\n{\n\tusing namespace TileConstants;\n\tif (TileNED::s_spawnedQuadrants.find({ X,Y }) \n\t\t!= TileNED::s_spawnedQuadrants.end())\n\t{\n\t\t\/\/ Quadrant is already here\n\t\treturn;\n\t}\n\tauto index = manager.createIndex();\n\tauto quadrantSideLength = QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH;\n\tmanager.addComponent<ECS_Core::Components::C_QuadrantPosition>(\n\t\tindex,\n\t\tX, Y);\n\tmanager.addComponent<ECS_Core::Components::C_PositionCartesian>(\n\t\tindex,\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE +\n\t\t(quadrantSideLength * X),\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE +\n\t\t(quadrantSideLength * Y),\n\t\t0);\n\n\tauto rect = std::make_unique<sf::RectangleShape>(sf::Vector2f(\n\t\tstatic_cast<float>(quadrantSideLength),\n\t\tstatic_cast<float>(quadrantSideLength)));\n\tauto& quadrant = TileNED::s_spawnedQuadrants[{X, Y}];\n\tquadrant.m_texture.create(quadrantSideLength, quadrantSideLength);\n\tfor (auto secX = 0; secX < TileConstants::QUADRANT_SIDE_LENGTH; ++secX)\n\t{\n\t\tfor (auto secY = 0; secY < TileConstants::QUADRANT_SIDE_LENGTH; ++secY)\n\t\t{\n\t\t\tauto& sector = quadrant.m_sectors[secX][secY];\n\t\t\tfor (auto tileX = 0; tileX < TileConstants::SECTOR_SIDE_LENGTH; ++tileX)\n\t\t\t{\n\t\t\t\tfor (auto tileY = 0; tileY < TileConstants::SECTOR_SIDE_LENGTH; ++tileY)\n\t\t\t\t{\n\t\t\t\t\tauto& tile = sector.m_tiles[tileX][tileY];\n\t\t\t\t\t\/\/ Later this will be based on all sorts of fun terrain generation\n\t\t\t\t\t\/\/ But that's later\n\t\t\t\t\ttile.m_tileType = rand() % TileConstants::TILE_TYPE_COUNT;\n\t\t\t\t\tif (tile.m_tileType) \/\/ Make type 0 unpathable for testing\n\t\t\t\t\t\ttile.m_movementCost = rand() % 6;\n\t\t\t\t\tfor (auto& pixel : tile.m_tilePixels)\n\t\t\t\t\t{\n\t\t\t\t\t\tpixel = \n\t\t\t\t\t\t\t(((tile.m_tileType & 1) ? 255 : 0) << 0) + \/\/ R\n\t\t\t\t\t\t\t(((tile.m_tileType & 2) ? 255 : 0) << 8) + \/\/ G\n\t\t\t\t\t\t\t(((tile.m_tileType & 4) ? 255 : 0) << 16)  + \/\/ B\n\t\t\t\t\t\t\t+ (0xFF << 24); \/\/ A\n\t\t\t\t\t}\n\t\t\t\t\tquadrant.m_texture.update(\n\t\t\t\t\t\treinterpret_cast<const sf::Uint8*>(tile.m_tilePixels),\n\t\t\t\t\t\tTILE_SIDE_LENGTH,\n\t\t\t\t\t\tTILE_SIDE_LENGTH,\n\t\t\t\t\t\t((secX * SECTOR_SIDE_LENGTH) + tileX) * TILE_SIDE_LENGTH,\n\t\t\t\t\t\t((secY * SECTOR_SIDE_LENGTH) + tileY) * TILE_SIDE_LENGTH);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tusing namespace Pathing::PathingSide;\n\t\t\tbool nwPathable = false;\n\t\t\tif (sector.m_tiles[0][0].m_movementCost)\n\t\t\t{\n\t\t\t\tnwPathable = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/  Start at top and left edge, other than corner, start trying to find paths\n\t\t\t\tauto isPathable = [](const TileNED::Tile& tile) -> bool {\n\t\t\t\t\treturn (bool)tile.m_movementCost;\n\t\t\t\t};\n\t\t\t\tfor (auto&& tileRow : sector.m_tiles)\n\t\t\t\t{\n\t\t\t\t\tfor (auto&& tile : tileRow)\n\t\t\t\t\t{\n\t\t\t\t\t\tbool pathable = isPathable(tile);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tsector.m_pathability[NORTH][WEST] = nwPathable;\n\t\t\tsector.m_pathability[WEST][NORTH] = nwPathable;\n\t\t\t\n\t\t\tbool nePathable = false;\n\t\t\tif (sector.m_tiles[TILE_SIDE_LENGTH - 1][0].m_movementCost)\n\t\t\t{\n\t\t\t\tnePathable = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t}\n\t\t\tsector.m_pathability[NORTH][EAST] = nePathable;\n\t\t\tsector.m_pathability[EAST][NORTH] = nePathable;\n\n\t\t\tbool sePathable = false;\n\t\t\tif (sector.m_tiles[TILE_SIDE_LENGTH - 1][TILE_SIDE_LENGTH - 1].m_movementCost)\n\t\t\t{\n\t\t\t\tsePathable = true;\n\t\t\t\tsector.m_pathability[SOUTH][EAST] = true;\n\t\t\t\tsector.m_pathability[EAST][SOUTH] = true;\n\t\t\t}\n\n\t\t\tbool swPathable = false;\n\t\t\tif (sector.m_tiles[0][TILE_SIDE_LENGTH - 1].m_movementCost)\n\t\t\t{\n\t\t\t\tswPathable = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\n\t\t\t}\n\t\t\tsector.m_pathability[SOUTH][WEST] = swPathable;\n\t\t\tsector.m_pathability[WEST][SOUTH] = swPathable;\n\t\t}\n\t}\n\trect->setTexture(&quadrant.m_texture);\n\tmanager.addComponent<ECS_Core::Components::C_SFMLDrawable>(\n\t\tindex,\n\t\tstd::move(rect),\n\t\tECS_Core::Components::DrawLayer::TERRAIN,\n\t\t0);\n}\n\ntemplate<class T>\nint sign(T x)\n{\n\treturn x < 0 ? -1 : 1;\n}\n\ntemplate<class T, class U>\nint min(T&& a, U&& b)\n{\n\treturn a < b ? a : b;\n}\n\n\nTileNED::WorldCoordinates WorldPositionToCoordinates(const CartesianVector2& worldPos)\n{\n\tusing namespace TileConstants;\n\tauto offsetFromQuadrantOrigin = worldPos - CartesianVector2(\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE,\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE);\n\treturn {\n\t\t{ min(0, sign(offsetFromQuadrantOrigin.m_x)) + sign(offsetFromQuadrantOrigin.m_x) * (int)(abs(offsetFromQuadrantOrigin.m_x) \/ (QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)),\n\t\t  min(0, sign(offsetFromQuadrantOrigin.m_y)) + sign(offsetFromQuadrantOrigin.m_y) * (int)(abs(offsetFromQuadrantOrigin.m_y) \/ (QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH))},\n\n\t\t{ min(0, sign(offsetFromQuadrantOrigin.m_x)) + sign(offsetFromQuadrantOrigin.m_x) * ((int)abs(offsetFromQuadrantOrigin.m_x) % (QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)) \/ (SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH),\n\t\t  min(0, sign(offsetFromQuadrantOrigin.m_y)) + sign(offsetFromQuadrantOrigin.m_y) * ((int)abs(offsetFromQuadrantOrigin.m_x) % (QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)) \/ (SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)},\n\n\t\t{ min(0, sign(offsetFromQuadrantOrigin.m_x)) + sign(offsetFromQuadrantOrigin.m_x) * ((int)abs(offsetFromQuadrantOrigin.m_x) % (SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)) \/ TILE_SIDE_LENGTH,\n\t\t  min(0, sign(offsetFromQuadrantOrigin.m_y)) + sign(offsetFromQuadrantOrigin.m_y) * ((int)abs(offsetFromQuadrantOrigin.m_x) % (SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)) \/ TILE_SIDE_LENGTH}\n\t};\n}\n\nCartesianVector2 CoordinatesToWorldPosition(const TileNED::WorldCoordinates& worldCoords)\n{\n\tusing namespace TileConstants;\n\treturn {\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE +\n\t\t(((((QUADRANT_SIDE_LENGTH * worldCoords.m_quadrant.m_x)\n\t\t\t+ worldCoords.m_sector.m_x) * SECTOR_SIDE_LENGTH)\n\t\t\t+ worldCoords.m_tile.m_x) * TILE_SIDE_LENGTH),\n\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE +\n\t\t(((((QUADRANT_SIDE_LENGTH * worldCoords.m_quadrant.m_y)\n\t\t\t+ worldCoords.m_sector.m_y) * SECTOR_SIDE_LENGTH)\n\t\t\t+ worldCoords.m_tile.m_y) * TILE_SIDE_LENGTH)\n\t};\n}\n\n\nvoid CheckWorldClick(ECS_Core::Manager& manager)\n{\n\tauto inputEntities = manager.entitiesMatching<ECS_Core::Signatures::S_Input>();\n\tif (inputEntities.size() == 0) return;\n\tECS_Core::Components::C_UserInputs& inputComponent = manager.getComponent<ECS_Core::Components::C_UserInputs>(inputEntities.front());\n\tif (inputComponent.m_unprocessedThisFrameDownMouseButtonFlags & (u8)ECS_Core::Components::MouseButtons::LEFT)\n\t{\n\t\tauto mouseWorldCoords = WorldPositionToCoordinates(inputComponent.m_currentMousePosition.m_worldPosition);\n\t\t\n\t\tif (TileNED::s_spawnedQuadrants.find({ (int)mouseWorldCoords.m_quadrant.m_x, (int)mouseWorldCoords.m_quadrant.m_y }) == TileNED::s_spawnedQuadrants.end())\n\t\t{\n\t\t\tSpawnQuadrant((int)mouseWorldCoords.m_quadrant.m_x, (int)mouseWorldCoords.m_quadrant.m_y, manager);\n\t\t}\n\n\t\tinputComponent.ProcessMouseDown(ECS_Core::Components::MouseButtons::LEFT);\n\t}\n}\n\nvoid WorldTile::Operate(GameLoopPhase phase, const timeuS& frameDuration)\n{\n\tswitch (phase)\n\t{\n\tcase GameLoopPhase::PREPARATION:\n\t\tif (!TileNED::baseQuadrantSpawned)\n\t\t{\n\t\t\tSpawnQuadrant(0, 0, m_managerRef);\n\t\t\tTileNED::baseQuadrantSpawned = true;\n\t\t}\n\t\tbreak;\n\tcase GameLoopPhase::ACTION:\n\t\tCheckWorldClick(m_managerRef);\n\t\tbreak;\n\n\tcase GameLoopPhase::INPUT:\n\tcase GameLoopPhase::ACTION_RESPONSE:\n\tcase GameLoopPhase::RENDER:\n\tcase GameLoopPhase::CLEANUP:\n\t\treturn;\n\t}\n}\n\nbool WorldTile::ShouldExit()\n{\n\treturn false;\n}\n\nDEFINE_SYSTEM_INSTANTIATION(WorldTile);<commit_msg>Spawning tiles between origin and relevant tile<commit_after>\/\/-----------------------------------------------------------------------------\n\/\/ All code is property of Matthew Loesby\n\/\/ Contact at Loesby.dev@gmail.com for permission to use\n\/\/ Or to discuss ideas\n\/\/ (c) 2017\n\n\/\/ Systems\/WorldTile.cpp\n\/\/ Creates and updates all tiles in the world\n\/\/ When interactions extend to a new set of tiles, creates those and starts updating them\n\n#include \"..\/Core\/typedef.h\"\n\n#include \"Systems.h\"\n\n#include \"..\/ECS\/System.h\"\n#include \"..\/ECS\/ECS.h\"\n\n#include \"..\/Util\/Pathing.h\"\n\n#include <limits>\n\n\/\/ Terms:\n\/\/ * Tile: Unit of the world terrain\n\/\/         It has a position in a sector\n\/\/         At standard zoom, it's 5px square\n\/\/ * Sector: A 20 x 20 grid of Tiles.\n\/\/ * Quadrant: A 2x2 Grid of Sectors\n\/\/ A world position is a combination of Quadrant X, Y\n\/\/    Sector X, Y\n\/\/    Tile X, Y\n\/\/  Printed as QX.QY:SX.SY:TX.TY\n\/\/ The world starts with 1 quadrant, player spawns in the center of it\n\/\/    So spawn position is 0.0:1.1:0.0\n\/\/ When a position beyond the current spawned quadrants becomes relevant,\n\/\/ new quadrants are spawned from the current world out to that quadrant\n\/\/ A thickness of up to 3 quadrants may be spawned to try to create pathing \n\/\/ to the target quadrant\n\nnamespace TileConstants\n{\n\tconstexpr int TILE_SIDE_LENGTH = 5;\n\tconstexpr int SECTOR_SIDE_LENGTH = 100;\n\tconstexpr int QUADRANT_SIDE_LENGTH = 4;\n\n\tconstexpr int BASE_QUADRANT_ORIGIN_COORDINATE =\n\t\t-TILE_SIDE_LENGTH *\n\t\tSECTOR_SIDE_LENGTH *\n\t\tQUADRANT_SIDE_LENGTH \/ 2;\n\n\t\/\/ Will later be configuration data\n\tconstexpr int TILE_TYPE_COUNT = 8;\n}\n\n\/\/ Non-entity data the tile system needs.\nnamespace TileNED\n{\n\tusing QuadrantId = std::pair<int, int>;\n\tusing namespace TileConstants;\n\n\tstruct Tile\n\t{\n\t\tint m_tileType;\n\t\tstd::optional<int> m_movementCost; \/\/ If notset, unpathable\n\n\t\t\/\/ Each 1 pixel is 4 components: RGBA\n\t\tsf::Uint32 m_tilePixels[TILE_SIDE_LENGTH * TILE_SIDE_LENGTH];\n\t};\n\n\tusing Pathability = bool[Pathing::PathingSide::_COUNT][Pathing::PathingSide::_COUNT];\n\n\tstruct Sector\n\t{\n\t\tPathability m_pathability;\n\t\tTile m_tiles \n\t\t\t[TileConstants::SECTOR_SIDE_LENGTH]\n\t\t\t[TileConstants::SECTOR_SIDE_LENGTH];\n\n\t};\n\tstruct Quadrant\n\t{\n\t\tPathability m_pathability;\n\t\tSector m_sectors\n\t\t\t[TileConstants::QUADRANT_SIDE_LENGTH]\n\t\t\t[TileConstants::QUADRANT_SIDE_LENGTH];\n\n\t\tsf::Texture m_texture;\n\t};\n\tusing SpawnedQuadrantMap = std::map<QuadrantId, Quadrant>;\n\tSpawnedQuadrantMap s_spawnedQuadrants;\n\tbool baseQuadrantSpawned{ false };\n\n\tstruct WorldCoordinates\n\t{\n\t\tWorldCoordinates() { }\n\t\tWorldCoordinates(CartesianVector2&& quad, CartesianVector2&& sec, CartesianVector2&& tile)\n\t\t\t: m_quadrant(quad)\n\t\t\t, m_sector(sec)\n\t\t\t, m_tile(tile)\n\t\t{}\n\t\tCartesianVector2 m_quadrant;\n\t\tCartesianVector2 m_sector;\n\t\tCartesianVector2 m_tile;\n\t};\n\n\tvoid CheckWorldClick(ECS_Core::Manager& manager);\n\tvoid SpawnBetween(\n\t\tint originX,\n\t\tint originY,\n\t\tint targetX,\n\t\tint targetY,\n\t\tECS_Core::Manager& manager);\n}\n\nvoid SpawnQuadrant(int X, int Y, ECS_Core::Manager& manager)\n{\n\tusing namespace TileConstants;\n\tif (TileNED::s_spawnedQuadrants.find({ X,Y }) \n\t\t!= TileNED::s_spawnedQuadrants.end())\n\t{\n\t\t\/\/ Quadrant is already here\n\t\treturn;\n\t}\n\tauto index = manager.createIndex();\n\tauto quadrantSideLength = QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH;\n\tmanager.addComponent<ECS_Core::Components::C_QuadrantPosition>(\n\t\tindex,\n\t\tX, Y);\n\tmanager.addComponent<ECS_Core::Components::C_PositionCartesian>(\n\t\tindex,\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE +\n\t\t(quadrantSideLength * X),\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE +\n\t\t(quadrantSideLength * Y),\n\t\t0);\n\n\tauto rect = std::make_unique<sf::RectangleShape>(sf::Vector2f(\n\t\tstatic_cast<float>(quadrantSideLength),\n\t\tstatic_cast<float>(quadrantSideLength)));\n\tauto& quadrant = TileNED::s_spawnedQuadrants[{X, Y}];\n\tquadrant.m_texture.create(quadrantSideLength, quadrantSideLength);\n\tfor (auto secX = 0; secX < TileConstants::QUADRANT_SIDE_LENGTH; ++secX)\n\t{\n\t\tfor (auto secY = 0; secY < TileConstants::QUADRANT_SIDE_LENGTH; ++secY)\n\t\t{\n\t\t\tauto& sector = quadrant.m_sectors[secX][secY];\n\t\t\tfor (auto tileX = 0; tileX < TileConstants::SECTOR_SIDE_LENGTH; ++tileX)\n\t\t\t{\n\t\t\t\tfor (auto tileY = 0; tileY < TileConstants::SECTOR_SIDE_LENGTH; ++tileY)\n\t\t\t\t{\n\t\t\t\t\tauto& tile = sector.m_tiles[tileX][tileY];\n\t\t\t\t\t\/\/ Later this will be based on all sorts of fun terrain generation\n\t\t\t\t\t\/\/ But that's later\n\t\t\t\t\ttile.m_tileType = rand() % TileConstants::TILE_TYPE_COUNT;\n\t\t\t\t\tif (tile.m_tileType) \/\/ Make type 0 unpathable for testing\n\t\t\t\t\t\ttile.m_movementCost = rand() % 6;\n\t\t\t\t\tfor (auto& pixel : tile.m_tilePixels)\n\t\t\t\t\t{\n\t\t\t\t\t\tpixel = \n\t\t\t\t\t\t\t(((tile.m_tileType & 1) ? 255 : 0) << 0) + \/\/ R\n\t\t\t\t\t\t\t(((tile.m_tileType & 2) ? 255 : 0) << 8) + \/\/ G\n\t\t\t\t\t\t\t(((tile.m_tileType & 4) ? 255 : 0) << 16)  + \/\/ B\n\t\t\t\t\t\t\t+ (0xFF << 24); \/\/ A\n\t\t\t\t\t}\n\t\t\t\t\tquadrant.m_texture.update(\n\t\t\t\t\t\treinterpret_cast<const sf::Uint8*>(tile.m_tilePixels),\n\t\t\t\t\t\tTILE_SIDE_LENGTH,\n\t\t\t\t\t\tTILE_SIDE_LENGTH,\n\t\t\t\t\t\t((secX * SECTOR_SIDE_LENGTH) + tileX) * TILE_SIDE_LENGTH,\n\t\t\t\t\t\t((secY * SECTOR_SIDE_LENGTH) + tileY) * TILE_SIDE_LENGTH);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tusing namespace Pathing::PathingSide;\n\t\t\tbool nwPathable = false;\n\t\t\tif (sector.m_tiles[0][0].m_movementCost)\n\t\t\t{\n\t\t\t\tnwPathable = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/  Start at top and left edge, other than corner, start trying to find paths\n\t\t\t\tauto isPathable = [](const TileNED::Tile& tile) -> bool {\n\t\t\t\t\treturn (bool)tile.m_movementCost;\n\t\t\t\t};\n\t\t\t\tfor (auto&& tileRow : sector.m_tiles)\n\t\t\t\t{\n\t\t\t\t\tfor (auto&& tile : tileRow)\n\t\t\t\t\t{\n\t\t\t\t\t\tbool pathable = isPathable(tile);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tsector.m_pathability[NORTH][WEST] = nwPathable;\n\t\t\tsector.m_pathability[WEST][NORTH] = nwPathable;\n\t\t\t\n\t\t\tbool nePathable = false;\n\t\t\tif (sector.m_tiles[TILE_SIDE_LENGTH - 1][0].m_movementCost)\n\t\t\t{\n\t\t\t\tnePathable = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t}\n\t\t\tsector.m_pathability[NORTH][EAST] = nePathable;\n\t\t\tsector.m_pathability[EAST][NORTH] = nePathable;\n\n\t\t\tbool sePathable = false;\n\t\t\tif (sector.m_tiles[TILE_SIDE_LENGTH - 1][TILE_SIDE_LENGTH - 1].m_movementCost)\n\t\t\t{\n\t\t\t\tsePathable = true;\n\t\t\t\tsector.m_pathability[SOUTH][EAST] = true;\n\t\t\t\tsector.m_pathability[EAST][SOUTH] = true;\n\t\t\t}\n\n\t\t\tbool swPathable = false;\n\t\t\tif (sector.m_tiles[0][TILE_SIDE_LENGTH - 1].m_movementCost)\n\t\t\t{\n\t\t\t\tswPathable = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\n\t\t\t}\n\t\t\tsector.m_pathability[SOUTH][WEST] = swPathable;\n\t\t\tsector.m_pathability[WEST][SOUTH] = swPathable;\n\t\t}\n\t}\n\trect->setTexture(&quadrant.m_texture);\n\tmanager.addComponent<ECS_Core::Components::C_SFMLDrawable>(\n\t\tindex,\n\t\tstd::move(rect),\n\t\tECS_Core::Components::DrawLayer::TERRAIN,\n\t\t0);\n}\n\ntemplate<class T>\ninline int sign(T x)\n{\n\treturn (x < 0) ? -1 : ((x > 0) ? 1 : 0);\n}\n\ntemplate<class T, class U>\nint min(T&& a, U&& b)\n{\n\treturn a < b ? a : b;\n}\n\n\nTileNED::WorldCoordinates WorldPositionToCoordinates(const CartesianVector2& worldPos)\n{\n\tusing namespace TileConstants;\n\tauto offsetFromQuadrantOrigin = worldPos - CartesianVector2(\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE,\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE);\n\treturn {\n\t\t{ min(0, sign(offsetFromQuadrantOrigin.m_x)) + sign(offsetFromQuadrantOrigin.m_x) * (int)(abs(offsetFromQuadrantOrigin.m_x) \/ (QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)),\n\t\t  min(0, sign(offsetFromQuadrantOrigin.m_y)) + sign(offsetFromQuadrantOrigin.m_y) * (int)(abs(offsetFromQuadrantOrigin.m_y) \/ (QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH))},\n\n\t\t{ min(0, sign(offsetFromQuadrantOrigin.m_x)) + sign(offsetFromQuadrantOrigin.m_x) * ((int)abs(offsetFromQuadrantOrigin.m_x) % (QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)) \/ (SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH),\n\t\t  min(0, sign(offsetFromQuadrantOrigin.m_y)) + sign(offsetFromQuadrantOrigin.m_y) * ((int)abs(offsetFromQuadrantOrigin.m_x) % (QUADRANT_SIDE_LENGTH * SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)) \/ (SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)},\n\n\t\t{ min(0, sign(offsetFromQuadrantOrigin.m_x)) + sign(offsetFromQuadrantOrigin.m_x) * ((int)abs(offsetFromQuadrantOrigin.m_x) % (SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)) \/ TILE_SIDE_LENGTH,\n\t\t  min(0, sign(offsetFromQuadrantOrigin.m_y)) + sign(offsetFromQuadrantOrigin.m_y) * ((int)abs(offsetFromQuadrantOrigin.m_x) % (SECTOR_SIDE_LENGTH * TILE_SIDE_LENGTH)) \/ TILE_SIDE_LENGTH}\n\t};\n}\n\nCartesianVector2 CoordinatesToWorldPosition(const TileNED::WorldCoordinates& worldCoords)\n{\n\tusing namespace TileConstants;\n\treturn {\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE +\n\t\t(((((QUADRANT_SIDE_LENGTH * worldCoords.m_quadrant.m_x)\n\t\t\t+ worldCoords.m_sector.m_x) * SECTOR_SIDE_LENGTH)\n\t\t\t+ worldCoords.m_tile.m_x) * TILE_SIDE_LENGTH),\n\n\t\tBASE_QUADRANT_ORIGIN_COORDINATE +\n\t\t(((((QUADRANT_SIDE_LENGTH * worldCoords.m_quadrant.m_y)\n\t\t\t+ worldCoords.m_sector.m_y) * SECTOR_SIDE_LENGTH)\n\t\t\t+ worldCoords.m_tile.m_y) * TILE_SIDE_LENGTH)\n\t};\n}\n\nvoid TileNED::SpawnBetween(\n\tint originX,\n\tint originY,\n\tint targetX,\n\tint targetY,\n\tECS_Core::Manager& manager)\n{\n\t\/\/ Base case: Spawn between a place and itself\n\tif (targetX == originX && targetY == originY)\n\t{\n\t\t\/\/ Spawn just in case, will return immediately in most cases.\n\t\tSpawnQuadrant(targetX, targetY, manager);\n\t\treturn;\n\t}\n\n\tSpawnQuadrant(targetX, targetY, manager);\n\tSpawnQuadrant(originX, originY, manager);\n\n\tauto midX = (targetX + originX) \/ 2;\n\tauto midY = (targetY + originY) \/ 2;\n\tSpawnQuadrant(midX, midY, manager);\n\n\tif ((midX == targetX && midY == targetY)\n\t\t|| midX == originX && midY == originY)\n\t{\n\t\t\/\/ We're all filled in on this segment.\n\t\treturn;\n\t}\n\n\tSpawnBetween(originX, originY, midX, midY, manager);\n\tSpawnBetween(midX + sign(targetX - originX), midY + sign(targetY - originY), targetX, targetY, manager);\n}\n\nvoid TileNED::CheckWorldClick(ECS_Core::Manager& manager)\n{\n\tauto inputEntities = manager.entitiesMatching<ECS_Core::Signatures::S_Input>();\n\tif (inputEntities.size() == 0) return;\n\tECS_Core::Components::C_UserInputs& inputComponent = manager.getComponent<ECS_Core::Components::C_UserInputs>(inputEntities.front());\n\tif (inputComponent.m_unprocessedThisFrameDownMouseButtonFlags & (u8)ECS_Core::Components::MouseButtons::LEFT)\n\t{\n\t\tauto mouseWorldCoords = WorldPositionToCoordinates(inputComponent.m_currentMousePosition.m_worldPosition);\n\t\tauto&& quadrantCoords = mouseWorldCoords.m_quadrant;\n\t\t\n\t\tif (TileNED::s_spawnedQuadrants.find({ (int)quadrantCoords.m_x, (int)quadrantCoords.m_y }) == TileNED::s_spawnedQuadrants.end())\n\t\t{\n\t\t\t\/\/ We're going to need to spawn world up to that point.\n\t\t\t\/\/ first: find the closest available world tile\n\t\t\tint closestX = 0;\n\t\t\tint closestY = 0;\n\t\t\tint smallestDistance = std::numeric_limits<int>::max();\n\t\t\t\/\/ Assume the initial tile is the closest for a start\n\t\t\tfor (auto&& quadrant : s_spawnedQuadrants)\n\t\t\t{\n\t\t\t\tauto&& quadX = quadrant.first.first;\n\t\t\t\tauto&& quadY = quadrant.first.second;\n\t\t\t\tauto&& distX = quadX - static_cast<int>(quadrantCoords.m_x);\n\t\t\t\tauto&& distY = quadY - static_cast<int>(quadrantCoords.m_y);\n\t\t\t\tauto&& distanceSq = distX * distX + distY * distY;\n\t\t\t\tif (distanceSq < smallestDistance)\n\t\t\t\t{\n\t\t\t\t\tclosestX = quadX;\n\t\t\t\t\tclosestY = quadY;\n\t\t\t\t\tsmallestDistance = distanceSq;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSpawnBetween(\n\t\t\t\tclosestX,\n\t\t\t\tclosestY, \n\t\t\t\tstatic_cast<int>(quadrantCoords.m_x),\n\t\t\t\tstatic_cast<int>(quadrantCoords.m_y),\n\t\t\t\tmanager);\n\t\t}\n\n\t\tinputComponent.ProcessMouseDown(ECS_Core::Components::MouseButtons::LEFT);\n\t}\n}\n\nvoid WorldTile::Operate(GameLoopPhase phase, const timeuS& frameDuration)\n{\n\tswitch (phase)\n\t{\n\tcase GameLoopPhase::PREPARATION:\n\t\tif (!TileNED::baseQuadrantSpawned)\n\t\t{\n\t\t\tSpawnQuadrant(0, 0, m_managerRef);\n\t\t\tTileNED::baseQuadrantSpawned = true;\n\t\t}\n\t\tbreak;\n\tcase GameLoopPhase::ACTION:\n\t\tTileNED::CheckWorldClick(m_managerRef);\n\t\tbreak;\n\n\tcase GameLoopPhase::INPUT:\n\tcase GameLoopPhase::ACTION_RESPONSE:\n\tcase GameLoopPhase::RENDER:\n\tcase GameLoopPhase::CLEANUP:\n\t\treturn;\n\t}\n}\n\nbool WorldTile::ShouldExit()\n{\n\treturn false;\n}\n\nDEFINE_SYSTEM_INSTANTIATION(WorldTile);<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/  emscURLLoader.cc\n\/\/------------------------------------------------------------------------------\n#include \"Pre.h\"\n#include \"emscURLLoader.h\"\n#include <emscripten\/emscripten.h>\n\nnamespace Oryol {\nnamespace _priv {\n\n\/\/------------------------------------------------------------------------------\nbool\nemscURLLoader::doRequest(const Ptr<IORead>& req) {\n    if (baseURLLoader::doRequest(req)) {\n        this->startRequest(req);\n        return true;\n    }\n    else {\n        \/\/ request was cancelled\n        return false;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nemscURLLoader::startRequest(const Ptr<IORead>& req) {\n    o_assert(req.isValid() && !req->Handled());\n\n    \/\/ bump the requests refcount and get a raw pointer\n    IORead* reqPtr = req.get();\n    reqPtr->addRef();\n\n    \/\/ start the asynchronous XHR\n    \/\/ NOTE: we can only load from our own HTTP server, so the host part of \n    \/\/ the URL is completely irrelevant...\n    String urlPath = req->Url.PathToEnd();\n    emscripten_async_wget_data(urlPath.AsCStr(), (void*) reqPtr, emscURLLoader::onLoaded, emscURLLoader::onFailed);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nemscURLLoader::onLoaded(void* userData, void* buffer, int size) {\n    o_assert(0 != userData);\n    o_assert(0 != buffer);\n    o_assert(size > 0);\n\n    Ptr<IORead> req = userData;\n    req->release();\n    req->Status = IOStatus::OK;\n    req->Data.Add((const uint8_t*)buffer, size);\n    req->Handled = true;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nemscURLLoader::onFailed(void* userData) {\n    o_assert(0 != userData);\n\n    \/\/ user data is a HTTPRequest ptr, put it back into a smart pointer\n    Ptr<IORead> req = userData;\n    req->release();\n    Log::Dbg(\"emscURLLoader::onFailed(url=%s)\\n\", req->Url.AsCStr());\n\n    \/\/ hmm we don't know why it failed, so make something up, we should definitely\n    \/\/ fix this somehow (looks like the wget2 functions also pass a HTTP status code)\n    const IOStatus::Code ioStatus = IOStatus::NotFound;\n    req->Status = ioStatus;\n    req->Handled = true;\n}\n\n} \/\/ namespace _priv\n} \/\/ naespace Oryol\n\n<commit_msg>Fixed debug compile bug in emscURLLoader<commit_after>\/\/------------------------------------------------------------------------------\n\/\/  emscURLLoader.cc\n\/\/------------------------------------------------------------------------------\n#include \"Pre.h\"\n#include \"emscURLLoader.h\"\n#include <emscripten\/emscripten.h>\n\nnamespace Oryol {\nnamespace _priv {\n\n\/\/------------------------------------------------------------------------------\nbool\nemscURLLoader::doRequest(const Ptr<IORead>& req) {\n    if (baseURLLoader::doRequest(req)) {\n        this->startRequest(req);\n        return true;\n    }\n    else {\n        \/\/ request was cancelled\n        return false;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nemscURLLoader::startRequest(const Ptr<IORead>& req) {\n    o_assert(req.isValid() && !req->Handled);\n\n    \/\/ bump the requests refcount and get a raw pointer\n    IORead* reqPtr = req.get();\n    reqPtr->addRef();\n\n    \/\/ start the asynchronous XHR\n    \/\/ NOTE: we can only load from our own HTTP server, so the host part of \n    \/\/ the URL is completely irrelevant...\n    String urlPath = req->Url.PathToEnd();\n    emscripten_async_wget_data(urlPath.AsCStr(), (void*) reqPtr, emscURLLoader::onLoaded, emscURLLoader::onFailed);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nemscURLLoader::onLoaded(void* userData, void* buffer, int size) {\n    o_assert(0 != userData);\n    o_assert(0 != buffer);\n    o_assert(size > 0);\n\n    Ptr<IORead> req = userData;\n    req->release();\n    req->Status = IOStatus::OK;\n    req->Data.Add((const uint8_t*)buffer, size);\n    req->Handled = true;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nemscURLLoader::onFailed(void* userData) {\n    o_assert(0 != userData);\n\n    \/\/ user data is a HTTPRequest ptr, put it back into a smart pointer\n    Ptr<IORead> req = userData;\n    req->release();\n    Log::Dbg(\"emscURLLoader::onFailed(url=%s)\\n\", req->Url.AsCStr());\n\n    \/\/ hmm we don't know why it failed, so make something up, we should definitely\n    \/\/ fix this somehow (looks like the wget2 functions also pass a HTTP status code)\n    const IOStatus::Code ioStatus = IOStatus::NotFound;\n    req->Status = ioStatus;\n    req->Handled = true;\n}\n\n} \/\/ namespace _priv\n} \/\/ naespace Oryol\n\n<|endoftext|>"}
{"text":"<commit_before>#ifdef _WIN32\n\n#include \"native.h\"\n#include \"generic.h\"\n#include \"win.h\"\n#include <vector>\n\nusing namespace std;\n\n\/\/ TODO Find the right size for this\n#define EVENT_BUFFER_SIZE (16*1024)\n\n#define CREATE_SHARE (FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE)\n#define CREATE_FLAGS (FILE_FLAG_BACKUP_SEMANTICS | FILE_FLAG_OVERLAPPED)\n#define EVENT_MASK (FILE_NOTIFY_CHANGE_FILE_NAME | FILE_NOTIFY_CHANGE_DIR_NAME | \\\n                    FILE_NOTIFY_CHANGE_ATTRIBUTES | FILE_NOTIFY_CHANGE_SIZE | FILE_NOTIFY_CHANGE_LAST_WRITE)\n\nclass WatchPoint {\npublic:\n    WatchPoint(wchar_t *path) {\n        this->path = _wcsdup(path);\n    }\n\n    ~WatchPoint() {\n        free(this->path);\n    }\n\n    bool isAncestorOf(wchar_t *candidate) {\n        wprintf(L\"~~~~ Checking if '%ls' starts with '%ls'\\n\", candidate, path);\n        return wcsncmp(path, candidate, wcslen(path)) == 0;\n    }\nprivate:\n    wchar_t *path;\n};\n\nclass Server {\npublic:\n    Server(\n        JavaVM *jvm,\n        JNIEnv *env,\n        jobject watcherCallback,\n        wchar_t drivePath[4],\n        vector<WatchPoint>* watchPoints\n    ) {\n        this->jvm = jvm;\n        this->watcherCallback = env->NewGlobalRef(watcherCallback);\n        this->stopEventHandle = CreateEvent(NULL, FALSE, FALSE, NULL);\n        this->watchPoints = watchPoints;\n        wcscpy_s(this->drivePath, 4, drivePath);\n\n        this->threadHandle = CreateThread(\n            NULL,                   \/\/ default security attributes\n            0,                      \/\/ use default stack size\n            EventProcessingThread,  \/\/ thread function name\n            this,                   \/\/ argument to thread function\n            0,                      \/\/ use default creation flags\n            NULL                    \/\/ the thread identifier\n        );\n        SetThreadPriority(this->threadHandle, THREAD_PRIORITY_ABOVE_NORMAL);\n    }\n\n    void close(JNIEnv *env) {\n        SetEvent(this->stopEventHandle);\n        WaitForSingleObject(this->threadHandle, INFINITE);\n        CloseHandle(this->threadHandle);\n        CloseHandle(this->stopEventHandle);\n        delete watchPoints;\n        env->DeleteGlobalRef(this->watcherCallback);\n    }\n\n    static DWORD WINAPI EventProcessingThread(LPVOID data) {\n        Server *server = (Server*) data;\n        server->run();\n        return 0;\n    }\n\nprivate:\n    JavaVM *jvm;\n    wchar_t drivePath[4];\n    vector<WatchPoint>* watchPoints;\n    jobject watcherCallback;\n\n    HANDLE stopEventHandle;\n    HANDLE threadHandle;\n\n    void run() {\n        printf(\"~~~~ Starting thread\\n\");\n\n        \/\/ TODO Extract this logic to some shared function\n        JNIEnv *env;\n        jint statAttach = jvm->AttachCurrentThreadAsDaemon((void **) &(env), NULL);\n        if (statAttach != JNI_OK) {\n            printf(\"Failed to attach JNI to current thread: %d\\n\", statAttach);\n            return;\n        }\n\n        OVERLAPPED overlapped;\n        memset(&overlapped, 0, sizeof(overlapped));\n        overlapped.hEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n\n        HANDLE hDrive = CreateFileW(drivePath, GENERIC_READ, CREATE_SHARE, NULL, OPEN_EXISTING, CREATE_FLAGS, NULL);\n\n        char buffer[EVENT_BUFFER_SIZE];\n        HANDLE handles[2] = {stopEventHandle, overlapped.hEvent};\n        while (true) {\n            int rcDrive = ReadDirectoryChangesW(\n                hDrive,\n                buffer,\n                sizeof(buffer),\n                TRUE,\n                EVENT_MASK,\n                NULL,\n                &overlapped,\n                NULL\n            );\n            if (rcDrive == 0) {\n                \/\/ TODO Error handling\n                printf(\"~~~~ Couldn't read directory: %d - %d\\n\", rcDrive, GetLastError());\n                break;\n            }\n\n            DWORD rc = WaitForMultipleObjects(2, handles, FALSE, INFINITE);\n            if (rc == WAIT_OBJECT_0) {\n                break;\n            }\n            if (rc == WAIT_OBJECT_0 + 1) {\n                DWORD dwBytesReturned;\n                if (!GetOverlappedResult(hDrive, &overlapped, &dwBytesReturned, FALSE)) {\n                    \/\/ TODO Error handling\n                    printf(\"~~~~ Failed to wait\\n\");\n                    break;\n                }\n\n                if (dwBytesReturned == 0) {\n                    \/\/ don't send dirty too much, everything is changed anyway\n                    \/\/ TODO Understand what this does\n                    if (WaitForSingleObject(stopEventHandle, 500) == WAIT_OBJECT_0)\n                        break;\n\n                    \/\/ Got a buffer overflow => current changes lost => send INVALIDATE on root\n                    reportEvent(env, FILE_EVENT_INVALIDATE, drivePath, 3);\n                } else {\n                    FILE_NOTIFY_INFORMATION *info = (FILE_NOTIFY_INFORMATION *)buffer;\n                    do {\n                        handlePathChanged(env, info);\n                        info = (FILE_NOTIFY_INFORMATION *)((char *)info + info->NextEntryOffset);\n                    } while (info->NextEntryOffset != 0);\n                }\n            }\n        }\n\n        printf(\"~~~~ Stopping thread\\n\");\n\n        CloseHandle(overlapped.hEvent);\n        CloseHandle(hDrive);\n\n        \/\/ TODO Extract this logic to some shared function\n        jint statDetach = jvm->DetachCurrentThread();\n        if (statDetach != JNI_OK) {\n            printf(\"Failed to detach JNI from current thread: %d\\n\", statAttach);\n            return;\n        }\n\n        return;\n    }\n\n    void reportEvent(JNIEnv *env, jint type, wchar_t *changedPath, int changedPathLen) {\n        jstring changedPathJava = wchar_to_java(env, changedPath, changedPathLen, NULL);\n        jclass callback_class = env->GetObjectClass(watcherCallback);\n        jmethodID methodCallback = env->GetMethodID(callback_class, \"pathChanged\", \"(ILjava\/lang\/String;)V\");\n        \/\/ TODO Do we need to add a global reference to the string here?\n        env->CallVoidMethod(watcherCallback, methodCallback, type, changedPathJava);\n    }\n\n    void handlePathChanged(JNIEnv *env, FILE_NOTIFY_INFORMATION *info) {\n        int pathLen = info->FileNameLength \/ sizeof(wchar_t);\n        wchar_t *changedPath = add_prefix(info->FileName, pathLen, drivePath);\n        int changedPathLen = pathLen + 3;\n\n        wprintf(L\"~~~~ Changed: 0x%x %ls\\n\", info->Action, changedPath);\n\n        jint type;\n        if (info->Action == FILE_ACTION_ADDED || info->Action == FILE_ACTION_RENAMED_NEW_NAME) {\n            type = FILE_EVENT_CREATED;\n        } else if (info->Action == FILE_ACTION_REMOVED || info->Action == FILE_ACTION_RENAMED_OLD_NAME) {\n            type = FILE_EVENT_REMOVED;\n        } else if (info->Action == FILE_ACTION_MODIFIED) {\n            type = FILE_EVENT_MODIFIED;\n        } else {\n            wprintf(L\"~~~~ Unknown event 0x%x for %ls\\n\", info->Action, changedPath);\n            type = FILE_EVENT_UNKNOWN;\n        }\n\n        bool watching = false;\n        for (auto watchPoint : *watchPoints) {\n            if (watchPoint.isAncestorOf(changedPath)) {\n                watching = true;\n                break;\n            }\n        }\n        if (!watching) {\n            wprintf(L\"~~~~ Ignoring %ls (root is not watched)\\n\", changedPath);\n            return;\n        }\n\n        reportEvent(env, type, changedPath, changedPathLen);\n        free(changedPath);\n    }\n};\n\nJNIEXPORT jobject JNICALL\nJava_net_rubygrapefruit_platform_internal_jni_WindowsFileEventFunctions_startWatching(JNIEnv *env, jclass target, jobjectArray paths, jobject javaCallback, jobject result) {\n\n    printf(\"\\n~~~~ Configuring...\\n\");\n\n    JavaVM* jvm;\n    int jvmStatus = env->GetJavaVM(&jvm);\n    if (jvmStatus != JNI_OK) {\n        mark_failed_with_errno(env, \"Could not store jvm instance.\", result);\n        return NULL;\n    }\n\n    int watchPointCount = env->GetArrayLength(paths);\n    if (watchPointCount == 0) {\n        mark_failed_with_errno(env, \"No paths given to watch.\", result);\n        return NULL;\n    }\n\n    vector<WatchPoint>* watchPoints = new vector<WatchPoint>();\n\n    wchar_t driveLetter = L'\\0';\n    for (int i = 0; i < watchPointCount; i++) {\n        jstring path = (jstring) env->GetObjectArrayElement(paths, i);\n        wchar_t* watchPoint = java_to_wchar_path(env, path, result);\n        int watchPointLen = wcslen(watchPoint);\n        if (watchPointLen > 240 || watchPoint[0] == L'\\\\') {\n            mark_failed_with_errno(env, \"Cannot watch long paths for now.\", result);\n            return NULL;\n        }\n        if (driveLetter == L'\\0') {\n            driveLetter = watchPoint[0];\n        } else if (driveLetter != watchPoint[0]) {\n            mark_failed_with_errno(env, \"Cannot watch multiple drives for now.\", result);\n            return NULL;\n        }\n        if (watchPoint[watchPointLen - 1] != L'\\\\') {\n            wchar_t* oldwatchPoint = watchPoint;\n            watchPoint = add_suffix(watchPoint, watchPointLen, L\"\\\\\");\n            free(oldwatchPoint);\n        }\n        wprintf(L\"~~~~ Watching %ls\\n\", watchPoint);\n        watchPoints->push_back(WatchPoint(watchPoint));\n        free(watchPoint);\n    }\n    wchar_t drivePath[4] = {towupper(driveLetter), L':', L'\\\\', L'\\0'};\n\n    Server* server = new Server(\n        jvm,\n        env,\n        javaCallback,\n        drivePath,\n        watchPoints\n    );\n\n    jclass clsWatch = env->FindClass(\"net\/rubygrapefruit\/platform\/internal\/jni\/WindowsFileEventFunctions$WatcherImpl\");\n    jmethodID constructor = env->GetMethodID(clsWatch, \"<init>\", \"(Ljava\/lang\/Object;)V\");\n    return env->NewObject(clsWatch, constructor, env->NewDirectByteBuffer(server, sizeof(server)));\n}\n\nJNIEXPORT void JNICALL\nJava_net_rubygrapefruit_platform_internal_jni_WindowsFileEventFunctions_stopWatching(JNIEnv *env, jclass target, jobject detailsObj, jobject result) {\n    Server* server = (Server*)env->GetDirectBufferAddress(detailsObj);\n    server->close(env);\n    delete server;\n}\n\n#endif\n<commit_msg>Somewhat better memory management of WatchPoints<commit_after>#ifdef _WIN32\n\n#include \"native.h\"\n#include \"generic.h\"\n#include \"win.h\"\n#include <vector>\n\nusing namespace std;\n\n\/\/ TODO Find the right size for this\n#define EVENT_BUFFER_SIZE (16*1024)\n\n#define CREATE_SHARE (FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE)\n#define CREATE_FLAGS (FILE_FLAG_BACKUP_SEMANTICS | FILE_FLAG_OVERLAPPED)\n#define EVENT_MASK (FILE_NOTIFY_CHANGE_FILE_NAME | FILE_NOTIFY_CHANGE_DIR_NAME | \\\n                    FILE_NOTIFY_CHANGE_ATTRIBUTES | FILE_NOTIFY_CHANGE_SIZE | FILE_NOTIFY_CHANGE_LAST_WRITE)\n\nclass WatchPoint {\npublic:\n    WatchPoint(wchar_t *path) {\n        this->path = _wcsdup(path);\n    }\n\n    WatchPoint(const WatchPoint &orig) : WatchPoint(orig.path) {}\n\n    ~WatchPoint() {\n        free(this->path);\n    }\n\n    bool isAncestorOf(wchar_t *candidate) {\n        wprintf(L\"~~~~ Checking if '%ls' starts with '%ls'\\n\", candidate, path);\n        return wcsncmp(path, candidate, wcslen(path)) == 0;\n    }\nprivate:\n    wchar_t *path;\n};\n\nclass Server {\npublic:\n    Server(\n        JavaVM *jvm,\n        JNIEnv *env,\n        jobject watcherCallback,\n        wchar_t drivePath[4],\n        vector<WatchPoint>* watchPoints\n    ) {\n        this->jvm = jvm;\n        this->watcherCallback = env->NewGlobalRef(watcherCallback);\n        this->stopEventHandle = CreateEvent(NULL, FALSE, FALSE, NULL);\n        this->watchPoints = watchPoints;\n        wcscpy_s(this->drivePath, 4, drivePath);\n\n        this->threadHandle = CreateThread(\n            NULL,                   \/\/ default security attributes\n            0,                      \/\/ use default stack size\n            EventProcessingThread,  \/\/ thread function name\n            this,                   \/\/ argument to thread function\n            0,                      \/\/ use default creation flags\n            NULL                    \/\/ the thread identifier\n        );\n        SetThreadPriority(this->threadHandle, THREAD_PRIORITY_ABOVE_NORMAL);\n    }\n\n    void close(JNIEnv *env) {\n        SetEvent(this->stopEventHandle);\n        WaitForSingleObject(this->threadHandle, INFINITE);\n        CloseHandle(this->threadHandle);\n        CloseHandle(this->stopEventHandle);\n        delete watchPoints;\n        env->DeleteGlobalRef(this->watcherCallback);\n    }\n\n    static DWORD WINAPI EventProcessingThread(LPVOID data) {\n        Server *server = (Server*) data;\n        server->run();\n        return 0;\n    }\n\nprivate:\n    JavaVM *jvm;\n    wchar_t drivePath[4];\n    vector<WatchPoint>* watchPoints;\n    jobject watcherCallback;\n\n    HANDLE stopEventHandle;\n    HANDLE threadHandle;\n\n    void run() {\n        printf(\"~~~~ Starting thread\\n\");\n\n        \/\/ TODO Extract this logic to some shared function\n        JNIEnv *env;\n        jint statAttach = jvm->AttachCurrentThreadAsDaemon((void **) &(env), NULL);\n        if (statAttach != JNI_OK) {\n            printf(\"Failed to attach JNI to current thread: %d\\n\", statAttach);\n            return;\n        }\n\n        OVERLAPPED overlapped;\n        memset(&overlapped, 0, sizeof(overlapped));\n        overlapped.hEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n\n        HANDLE hDrive = CreateFileW(drivePath, GENERIC_READ, CREATE_SHARE, NULL, OPEN_EXISTING, CREATE_FLAGS, NULL);\n\n        char buffer[EVENT_BUFFER_SIZE];\n        HANDLE handles[2] = {stopEventHandle, overlapped.hEvent};\n        while (true) {\n            int rcDrive = ReadDirectoryChangesW(\n                hDrive,\n                buffer,\n                sizeof(buffer),\n                TRUE,\n                EVENT_MASK,\n                NULL,\n                &overlapped,\n                NULL\n            );\n            if (rcDrive == 0) {\n                \/\/ TODO Error handling\n                printf(\"~~~~ Couldn't read directory: %d - %d\\n\", rcDrive, GetLastError());\n                break;\n            }\n\n            DWORD rc = WaitForMultipleObjects(2, handles, FALSE, INFINITE);\n            if (rc == WAIT_OBJECT_0) {\n                break;\n            }\n            if (rc == WAIT_OBJECT_0 + 1) {\n                DWORD dwBytesReturned;\n                if (!GetOverlappedResult(hDrive, &overlapped, &dwBytesReturned, FALSE)) {\n                    \/\/ TODO Error handling\n                    printf(\"~~~~ Failed to wait\\n\");\n                    break;\n                }\n\n                if (dwBytesReturned == 0) {\n                    \/\/ don't send dirty too much, everything is changed anyway\n                    \/\/ TODO Understand what this does\n                    if (WaitForSingleObject(stopEventHandle, 500) == WAIT_OBJECT_0)\n                        break;\n\n                    \/\/ Got a buffer overflow => current changes lost => send INVALIDATE on root\n                    reportEvent(env, FILE_EVENT_INVALIDATE, drivePath, 3);\n                } else {\n                    FILE_NOTIFY_INFORMATION *info = (FILE_NOTIFY_INFORMATION *)buffer;\n                    do {\n                        handlePathChanged(env, info);\n                        info = (FILE_NOTIFY_INFORMATION *)((char *)info + info->NextEntryOffset);\n                    } while (info->NextEntryOffset != 0);\n                }\n            }\n        }\n\n        printf(\"~~~~ Stopping thread\\n\");\n\n        CloseHandle(overlapped.hEvent);\n        CloseHandle(hDrive);\n\n        \/\/ TODO Extract this logic to some shared function\n        jint statDetach = jvm->DetachCurrentThread();\n        if (statDetach != JNI_OK) {\n            printf(\"Failed to detach JNI from current thread: %d\\n\", statAttach);\n            return;\n        }\n\n        return;\n    }\n\n    void reportEvent(JNIEnv *env, jint type, wchar_t *changedPath, int changedPathLen) {\n        jstring changedPathJava = wchar_to_java(env, changedPath, changedPathLen, NULL);\n        jclass callback_class = env->GetObjectClass(watcherCallback);\n        jmethodID methodCallback = env->GetMethodID(callback_class, \"pathChanged\", \"(ILjava\/lang\/String;)V\");\n        \/\/ TODO Do we need to add a global reference to the string here?\n        env->CallVoidMethod(watcherCallback, methodCallback, type, changedPathJava);\n    }\n\n    void handlePathChanged(JNIEnv *env, FILE_NOTIFY_INFORMATION *info) {\n        int pathLen = info->FileNameLength \/ sizeof(wchar_t);\n        wchar_t *changedPath = add_prefix(info->FileName, pathLen, drivePath);\n        int changedPathLen = pathLen + 3;\n\n        wprintf(L\"~~~~ Changed: 0x%x %ls\\n\", info->Action, changedPath);\n\n        jint type;\n        if (info->Action == FILE_ACTION_ADDED || info->Action == FILE_ACTION_RENAMED_NEW_NAME) {\n            type = FILE_EVENT_CREATED;\n        } else if (info->Action == FILE_ACTION_REMOVED || info->Action == FILE_ACTION_RENAMED_OLD_NAME) {\n            type = FILE_EVENT_REMOVED;\n        } else if (info->Action == FILE_ACTION_MODIFIED) {\n            type = FILE_EVENT_MODIFIED;\n        } else {\n            wprintf(L\"~~~~ Unknown event 0x%x for %ls\\n\", info->Action, changedPath);\n            type = FILE_EVENT_UNKNOWN;\n        }\n\n        bool watching = false;\n        for (auto &watchPoint : *watchPoints) {\n            if (watchPoint.isAncestorOf(changedPath)) {\n                watching = true;\n                break;\n            }\n        }\n        if (!watching) {\n            wprintf(L\"~~~~ Ignoring %ls (root is not watched)\\n\", changedPath);\n            return;\n        }\n\n        reportEvent(env, type, changedPath, changedPathLen);\n        free(changedPath);\n    }\n};\n\nJNIEXPORT jobject JNICALL\nJava_net_rubygrapefruit_platform_internal_jni_WindowsFileEventFunctions_startWatching(JNIEnv *env, jclass target, jobjectArray paths, jobject javaCallback, jobject result) {\n\n    printf(\"\\n~~~~ Configuring...\\n\");\n\n    JavaVM* jvm;\n    int jvmStatus = env->GetJavaVM(&jvm);\n    if (jvmStatus != JNI_OK) {\n        mark_failed_with_errno(env, \"Could not store jvm instance.\", result);\n        return NULL;\n    }\n\n    int watchPointCount = env->GetArrayLength(paths);\n    if (watchPointCount == 0) {\n        mark_failed_with_errno(env, \"No paths given to watch.\", result);\n        return NULL;\n    }\n\n    vector<WatchPoint>* watchPoints = new vector<WatchPoint>();\n\n    wchar_t driveLetter = L'\\0';\n    for (int i = 0; i < watchPointCount; i++) {\n        jstring path = (jstring) env->GetObjectArrayElement(paths, i);\n        wchar_t* watchPoint = java_to_wchar_path(env, path, result);\n        int watchPointLen = wcslen(watchPoint);\n        if (watchPointLen > 240 || watchPoint[0] == L'\\\\') {\n            mark_failed_with_errno(env, \"Cannot watch long paths for now.\", result);\n            return NULL;\n        }\n        if (driveLetter == L'\\0') {\n            driveLetter = watchPoint[0];\n        } else if (driveLetter != watchPoint[0]) {\n            mark_failed_with_errno(env, \"Cannot watch multiple drives for now.\", result);\n            return NULL;\n        }\n        if (watchPoint[watchPointLen - 1] != L'\\\\') {\n            wchar_t* oldwatchPoint = watchPoint;\n            watchPoint = add_suffix(watchPoint, watchPointLen, L\"\\\\\");\n            free(oldwatchPoint);\n        }\n        wprintf(L\"~~~~ Watching %ls\\n\", watchPoint);\n        watchPoints->emplace_back(watchPoint);\n        free(watchPoint);\n    }\n    wchar_t drivePath[4] = {towupper(driveLetter), L':', L'\\\\', L'\\0'};\n\n    Server* server = new Server(\n        jvm,\n        env,\n        javaCallback,\n        drivePath,\n        watchPoints\n    );\n\n    jclass clsWatch = env->FindClass(\"net\/rubygrapefruit\/platform\/internal\/jni\/WindowsFileEventFunctions$WatcherImpl\");\n    jmethodID constructor = env->GetMethodID(clsWatch, \"<init>\", \"(Ljava\/lang\/Object;)V\");\n    return env->NewObject(clsWatch, constructor, env->NewDirectByteBuffer(server, sizeof(server)));\n}\n\nJNIEXPORT void JNICALL\nJava_net_rubygrapefruit_platform_internal_jni_WindowsFileEventFunctions_stopWatching(JNIEnv *env, jclass target, jobject detailsObj, jobject result) {\n    Server* server = (Server*)env->GetDirectBufferAddress(detailsObj);\n    server->close(env);\n    delete server;\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"chainerx\/cuda\/cuda_device.h\"\n\n#include <cstddef>\n#include <cstring>\n#include <memory>\n\n#include <cuda_runtime.h>\n\n#include \"chainerx\/cuda\/cuda_runtime.h\"\n#include \"chainerx\/device.h\"\n#include \"chainerx\/error.h\"\n#include \"chainerx\/macro.h\"\n#include \"chainerx\/native\/native_device.h\"\n\nnamespace chainerx {\nnamespace cuda {\n\nstd::shared_ptr<void> CudaDevice::Allocate(size_t bytesize) {\n    void* ptr = memory_pool_.Malloc(bytesize);\n    return std::shared_ptr<void>{ptr, [this](void* ptr) { memory_pool_.Free(ptr); }};\n}\n\nstd::shared_ptr<void> CudaDevice::AllocatePinnedMemory(size_t bytesize) {\n    void* ptr = pinned_memory_pool_.Malloc(bytesize);\n    return std::shared_ptr<void>{ptr, [this](void* ptr) { pinned_memory_pool_.Free(ptr); }};\n}\n\nstd::shared_ptr<void> CudaDevice::MakeDataFromForeignPointer(const std::shared_ptr<void>& data) {\n    if (data == nullptr) {\n        return data;\n    }\n\n    \/\/ check memory validity\n    void* ptr = data.get();\n    cudaPointerAttributes attr{};\n    cudaError_t status = cudaPointerGetAttributes(&attr, ptr);\n    switch (status) {\n        case cudaSuccess:\n            if (attr.device != index()) {\n                throw ChainerxError{\"CUDA memory: \", ptr, \" must reside on the device: \", index()};\n            }\n            break;\n        case cudaErrorInvalidValue:\n            throw ChainerxError{\"Memory: \", ptr, \" is not a CUDA memory\"};\n        default:\n            Throw(status);\n    }\n    return data;\n}\n\nvoid CudaDevice::MemoryCopyFrom(void* dst, const void* src, size_t bytesize, Device& src_device) {\n    CHAINERX_ASSERT(bytesize == 0 || IsPointerCudaMemory(dst));\n    if (bytesize == 0) {\n        return;\n    }\n    \/\/ TODO(niboshi): Do device management with RAII\n    int old_device{};\n    CheckCudaError(cudaGetDevice(&old_device));\n    CheckCudaError(cudaSetDevice(index()));\n    if (&src_device == this || nullptr != dynamic_cast<CudaDevice*>(&src_device)) {\n        \/\/ Copy between CUDA devices\n        CheckCudaError(cudaMemcpy(dst, src, bytesize, cudaMemcpyDeviceToDevice));\n    } else {\n        CHAINERX_ASSERT(\n                nullptr != dynamic_cast<native::NativeDevice*>(&src_device) &&\n                \"CudaDevice only supports copy between cuda or native devices.\");\n        \/\/ Copy from native device\n        CheckCudaError(cudaMemcpy(dst, src, bytesize, cudaMemcpyHostToDevice));\n    }\n    CheckCudaError(cudaSetDevice(old_device));\n}\n\nvoid CudaDevice::MemoryCopyTo(void* dst, const void* src, size_t bytesize, Device& dst_device) {\n    CHAINERX_ASSERT(bytesize == 0 || src == nullptr || IsPointerCudaMemory(src));\n    if (bytesize == 0) {\n        return;\n    }\n    \/\/ TODO(niboshi): Do device management with RAII\n    int old_device{};\n    CheckCudaError(cudaGetDevice(&old_device));\n    CheckCudaError(cudaSetDevice(index()));\n    if (&dst_device == this || nullptr != dynamic_cast<CudaDevice*>(&dst_device)) {\n        \/\/ Copy between CUDA devices\n        CheckCudaError(cudaMemcpy(dst, src, bytesize, cudaMemcpyDeviceToDevice));\n    } else {\n        CHAINERX_ASSERT(\n                nullptr != dynamic_cast<native::NativeDevice*>(&dst_device) &&\n                \"CudaDevice only supports copy between cuda or native devices.\");\n        \/\/ Copy to native device\n        CheckCudaError(cudaMemcpy(dst, src, bytesize, cudaMemcpyDeviceToHost));\n    }\n    CheckCudaError(cudaSetDevice(old_device));\n}\n\nstd::shared_ptr<void> CudaDevice::TransferDataFrom(\n        Device& src_device, const std::shared_ptr<void>& src_ptr, size_t offset, size_t bytesize) {\n    std::shared_ptr<void> dst_ptr = Allocate(bytesize);\n    MemoryCopyFrom(dst_ptr.get(), &(static_cast<int8_t*>(src_ptr.get())[offset]), bytesize, src_device);\n    return dst_ptr;\n}\n\nstd::shared_ptr<void> CudaDevice::TransferDataTo(Device& dst_device, const std::shared_ptr<void>& src_ptr, size_t offset, size_t bytesize) {\n    std::shared_ptr<void> dst_ptr = dst_device.Allocate(bytesize);\n    MemoryCopyTo(dst_ptr.get(), &(static_cast<int8_t*>(src_ptr.get())[offset]), bytesize, dst_device);\n    return dst_ptr;\n}\n\nstd::shared_ptr<void> CudaDevice::FromHostMemory(const std::shared_ptr<void>& src_ptr, size_t bytesize) {\n    std::shared_ptr<void> dst_ptr = Allocate(bytesize);\n    std::shared_ptr<void> pinned_src_ptr = AllocatePinnedMemory(bytesize);\n    std::memcpy(pinned_src_ptr.get(), src_ptr.get(), bytesize);\n    CheckCudaError(cudaMemcpyAsync(dst_ptr.get(), pinned_src_ptr.get(), bytesize, cudaMemcpyHostToDevice));\n    return dst_ptr;\n}\n\n}  \/\/ namespace cuda\n}  \/\/ namespace chainerx\n<commit_msg>Use cudaMemcpy instead of memcpy<commit_after>#include \"chainerx\/cuda\/cuda_device.h\"\n\n#include <cstddef>\n#include <memory>\n\n#include <cuda_runtime.h>\n\n#include \"chainerx\/cuda\/cuda_runtime.h\"\n#include \"chainerx\/device.h\"\n#include \"chainerx\/error.h\"\n#include \"chainerx\/macro.h\"\n#include \"chainerx\/native\/native_device.h\"\n\nnamespace chainerx {\nnamespace cuda {\n\nstd::shared_ptr<void> CudaDevice::Allocate(size_t bytesize) {\n    void* ptr = memory_pool_.Malloc(bytesize);\n    return std::shared_ptr<void>{ptr, [this](void* ptr) { memory_pool_.Free(ptr); }};\n}\n\nstd::shared_ptr<void> CudaDevice::AllocatePinnedMemory(size_t bytesize) {\n    void* ptr = pinned_memory_pool_.Malloc(bytesize);\n    return std::shared_ptr<void>{ptr, [this](void* ptr) { pinned_memory_pool_.Free(ptr); }};\n}\n\nstd::shared_ptr<void> CudaDevice::MakeDataFromForeignPointer(const std::shared_ptr<void>& data) {\n    if (data == nullptr) {\n        return data;\n    }\n\n    \/\/ check memory validity\n    void* ptr = data.get();\n    cudaPointerAttributes attr{};\n    cudaError_t status = cudaPointerGetAttributes(&attr, ptr);\n    switch (status) {\n        case cudaSuccess:\n            if (attr.device != index()) {\n                throw ChainerxError{\"CUDA memory: \", ptr, \" must reside on the device: \", index()};\n            }\n            break;\n        case cudaErrorInvalidValue:\n            throw ChainerxError{\"Memory: \", ptr, \" is not a CUDA memory\"};\n        default:\n            Throw(status);\n    }\n    return data;\n}\n\nvoid CudaDevice::MemoryCopyFrom(void* dst, const void* src, size_t bytesize, Device& src_device) {\n    CHAINERX_ASSERT(bytesize == 0 || IsPointerCudaMemory(dst));\n    if (bytesize == 0) {\n        return;\n    }\n    \/\/ TODO(niboshi): Do device management with RAII\n    int old_device{};\n    CheckCudaError(cudaGetDevice(&old_device));\n    CheckCudaError(cudaSetDevice(index()));\n    if (&src_device == this || nullptr != dynamic_cast<CudaDevice*>(&src_device)) {\n        \/\/ Copy between CUDA devices\n        CheckCudaError(cudaMemcpy(dst, src, bytesize, cudaMemcpyDeviceToDevice));\n    } else {\n        CHAINERX_ASSERT(\n                nullptr != dynamic_cast<native::NativeDevice*>(&src_device) &&\n                \"CudaDevice only supports copy between cuda or native devices.\");\n        \/\/ Copy from native device\n        CheckCudaError(cudaMemcpy(dst, src, bytesize, cudaMemcpyHostToDevice));\n    }\n    CheckCudaError(cudaSetDevice(old_device));\n}\n\nvoid CudaDevice::MemoryCopyTo(void* dst, const void* src, size_t bytesize, Device& dst_device) {\n    CHAINERX_ASSERT(bytesize == 0 || src == nullptr || IsPointerCudaMemory(src));\n    if (bytesize == 0) {\n        return;\n    }\n    \/\/ TODO(niboshi): Do device management with RAII\n    int old_device{};\n    CheckCudaError(cudaGetDevice(&old_device));\n    CheckCudaError(cudaSetDevice(index()));\n    if (&dst_device == this || nullptr != dynamic_cast<CudaDevice*>(&dst_device)) {\n        \/\/ Copy between CUDA devices\n        CheckCudaError(cudaMemcpy(dst, src, bytesize, cudaMemcpyDeviceToDevice));\n    } else {\n        CHAINERX_ASSERT(\n                nullptr != dynamic_cast<native::NativeDevice*>(&dst_device) &&\n                \"CudaDevice only supports copy between cuda or native devices.\");\n        \/\/ Copy to native device\n        CheckCudaError(cudaMemcpy(dst, src, bytesize, cudaMemcpyDeviceToHost));\n    }\n    CheckCudaError(cudaSetDevice(old_device));\n}\n\nstd::shared_ptr<void> CudaDevice::TransferDataFrom(\n        Device& src_device, const std::shared_ptr<void>& src_ptr, size_t offset, size_t bytesize) {\n    std::shared_ptr<void> dst_ptr = Allocate(bytesize);\n    MemoryCopyFrom(dst_ptr.get(), &(static_cast<int8_t*>(src_ptr.get())[offset]), bytesize, src_device);\n    return dst_ptr;\n}\n\nstd::shared_ptr<void> CudaDevice::TransferDataTo(Device& dst_device, const std::shared_ptr<void>& src_ptr, size_t offset, size_t bytesize) {\n    std::shared_ptr<void> dst_ptr = dst_device.Allocate(bytesize);\n    MemoryCopyTo(dst_ptr.get(), &(static_cast<int8_t*>(src_ptr.get())[offset]), bytesize, dst_device);\n    return dst_ptr;\n}\n\nstd::shared_ptr<void> CudaDevice::FromHostMemory(const std::shared_ptr<void>& src_ptr, size_t bytesize) {\n    std::shared_ptr<void> dst_ptr = Allocate(bytesize);\n    std::shared_ptr<void> pinned_src_ptr = AllocatePinnedMemory(bytesize);\n    CheckCudaError(cudaMemcpy(pinned_src_ptr.get(), src_ptr.get(), bytesize, cudaMemcpyHostToHost));\n    CheckCudaError(cudaMemcpyAsync(dst_ptr.get(), pinned_src_ptr.get(), bytesize, cudaMemcpyHostToDevice));\n    return dst_ptr;\n}\n\n}  \/\/ namespace cuda\n}  \/\/ namespace chainerx\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Clean up iterating code.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <stdarg.h>\n#include \"StackInterpreter.hpp\"\n#include \"PreprocessorHacks.hpp\"\n#include \"BytecodeSets.hpp\"\n#include \"Common.hpp\"\n\nnamespace Lodtalk\n{\n\n\/**\n * The stack interpreter.\n * This stack interpreter is based in the arquitecture of squeak.\n *\/ \nclass StackInterpreter\n{\npublic:\n\tStackInterpreter();\n\t~StackInterpreter();\n\t\n\tOop interpretMethod(CompiledMethod *method, Oop receiver, int argumentCount, Oop *arguments);\n\t\nprivate:\n\tvoid error(const char *message)\n\t{\n\t\tfprintf(stdout, \"Interpreter error: %s\\n\", message);\n\t\tabort();\n\t}\n\n\tvoid errorFormat(const char *format, ...)\n\t{\n\t\tchar buffer[1024];\n\t\tva_list args;\n\t\tva_start(args, format);\n\t\tvsnprintf(buffer, 1024, format, args);\n\t\terror(buffer);\n\t\tabort();\n\t}\n\t\n\tvoid fetchMethodData(CompiledMethod *newMethod)\n\t{\n\t\tmethod = newMethod;\n\t\tliteralCount = method->getLiteralCount();\n\t\targumentCount = method->getArgumentCount();\n\t\ttemporalCount = method->getTemporalCount();\n\t\tfirstInstructionPointer = method->getFirstBCPointer();\n\t\tliteralArray = method->getFirstLiteralPointer();\n\t}\n\t\n\tint fetchByte()\n\t{\n\t\treturn *instructionPointer++;\n\t}\n\n\tint fetchSByte()\n\t{\n\t\tauto sbyte = *reinterpret_cast<int8_t*> (instructionPointer);\n\t\tinstructionPointer++;\n\t\treturn sbyte;\n\t}\n\t\n\tvoid fetchNextInstructionOpcode()\n\t{\n\t\tnextOpcode = fetchByte();\n\t}\n\n\tvoid push(Oop object)\n\t{\n\t\tstackMemory.push_back(object);\n\t}\n\t\n\tsize_t getCurrentStackSize() const\n\t{\n\t\treturn stackMemory.size();\n\t}\n\t\n\tOop pop()\n\t{\n\t\tif(!getCurrentStackSize())\n\t\t\terror(\"Stack underflow\");\n\t\t\t\n\t\tauto result = stackMemory.back();\n\t\tstackMemory.pop_back();\n\t\treturn result;\n\t}\n\t\n\tOop stackTop()\n\t{\n\t\tif(!getCurrentStackSize())\n\t\t\terror(\"Stack underflow\");\n\n\t\treturn stackMemory.back();\n\t}\n\t\n\tbool condJumpOnNotBoolean(bool jumpType)\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\nprivate:\n\t\/\/ TODO: Use a proper downward growing stack\n\tstd::vector<Oop> stackMemory;\n \n\t\/\/ Interpreter data\n\tCompiledMethod *method;\n\tuint8_t *firstInstructionPointer;\n\tuint8_t *instructionPointer;\n\tint nextOpcode;\n\tint currentOpcode;\n\t\n\tsize_t argumentCount;\n\tsize_t literalCount;\n\tsize_t temporalCount;\n\t\n\tuint64_t extendA;\n\tint64_t extendB;\n\t\n\tOop receiver;\n\tOop *arguments;\n\tOop *literalArray;\n\t\n\tbool isReturning;\n\tOop methodReturnValue;\n\nprivate:\n\tvoid pushLiteralVariable(int literalVarIndex)\n\t{\n\t\tauto literal = literalArray[literalVarIndex];\n\t\t\n\t\t\/\/ Cast the literal variable and push the value\n\t\tauto literalVar = reinterpret_cast<LiteralVariable*> (literal.pointer);\n\t\tpush(literalVar->value);\n\t}\n\n\tvoid pushLiteral(int literalIndex)\n\t{\n\t\tauto literal = literalArray[literalIndex];\n\t\t\n\t\t\/\/ Cast the literal variable and push the value\n\t\tpush(literal);\n\t}\n\t\n\tvoid sendLiteralIndexArgumentCount(int literalIndex, int argumentCount)\n\t{\n\t\tauto selector = literalArray[literalIndex];\n\t\t\n\t\t\/\/ TODO: Make this more efficient.\n\t\tOop arguments[argumentCount];\n\t\tfor(int i = 0; i < argumentCount; ++i)\n\t\t\targuments[argumentCount - i - 1] = pop();\n\n\t\t\/\/ Get the receiver.\n\t\tOop newReceiver = pop();\n\t\t\n\t\t\/\/ Perform the message send.\n\t\tOop result = sendMessage(newReceiver, selector, argumentCount, arguments);\n\t\tpush(result);\n\t}\n\t\n\t\/\/ Bytecode instructions\n\tvoid interpretPushReceiverVariableShort()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushLiteralVariableShort()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal inde \n\t\tauto literalVarIndex = currentOpcode & 0xF;\n\t\tpushLiteralVariable(literalVarIndex);\n\t}\n\t\n\tvoid interpretPushLiteralShort()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal inded\n\t\tauto literalIndex = currentOpcode & 0x1F; \n\t\tpushLiteral(literalIndex);\n\t}\n\t\n\tvoid interpretPushTempShort()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretSendShortArgs0()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal index\n\t\tauto literalIndex = currentOpcode & 0x0F;\n\t\tsendLiteralIndexArgumentCount(literalIndex, 0);\n\t}\n\t\n\tvoid interpretSendShortArgs1()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal index\n\t\tauto literalIndex = currentOpcode & 0x0F;\n\t\tsendLiteralIndexArgumentCount(literalIndex, 1);\n\t}\n\t\n\tvoid interpretSendShortArgs2()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal index\n\t\tauto literalIndex = currentOpcode & 0x0F;\n\t\tsendLiteralIndexArgumentCount(literalIndex, 2);\n\t}\n\t\n\tvoid interpretJumpShort()\n\t{\n\t\tauto delta = (currentOpcode & 7) + 1;\n\t\tinstructionPointer += delta;\n\t}\n\t\n\tvoid interpretJumpOnTrueShort()\n\t{\n\t\t\/\/ Fetch the condition and the next instruction opcode\n\t\tfetchNextInstructionOpcode();\n\t\tauto condition = pop();\n\t\t\n\t\t\/\/ Perform the branch when requested.\n\t\tif(condition == trueOop())\n\t\t{\n\t\t\tauto delta = (currentOpcode & 7);\n\t\t\tinstructionPointer += delta;\n\t\t\tfetchNextInstructionOpcode();\n\t\t}\n\t\telse if(condition != falseOop())\n\t\t{\n\t\t\t\/\/ If the condition is not a boolean, trap\n\t\t\tcondJumpOnNotBoolean(true);\n\t\t}\n\t}\n\t\n\tvoid interpretJumpOnFalseShort()\n\t{\n\t\t\/\/ Fetch the condition and the next instruction opcode\n\t\tfetchNextInstructionOpcode();\n\t\tauto condition = pop();\n\t\t\n\t\t\/\/ Perform the branch when requested.\n\t\tif(condition == falseOop())\n\t\t{\n\t\t\tauto delta = (currentOpcode & 7);\n\t\t\tinstructionPointer += delta;\n\t\t\tfetchNextInstructionOpcode();\n\t\t}\n\t\telse if(condition != trueOop())\n\t\t{\n\t\t\t\/\/ If the condition is not a boolean, trap\n\t\t\tcondJumpOnNotBoolean(false);\n\t\t}\n\t}\n\t\n\tvoid interpretPopStoreReceiverVariableShort()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPopStoreTemporalVariableShort()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushReceiver()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushTrue()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushFalse()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushNil()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushZero()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushOne()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushThisContext()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretDuplicateStackTop()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretReturnReceiver()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = receiver;\n\t}\n\n\tvoid interpretReturnTrue()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = trueOop();\n\t}\n\t\n\tvoid interpretReturnFalse()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = falseOop();\n\t}\n\t\n\tvoid interpretReturnNil()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = nilOop();\n\t}\n\n\tvoid interpretReturnTop()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = pop();\n\t}\n\n\tvoid interpretBlockReturnNil()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretBlockReturnTop()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretNop()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Do nothing\n\t}\n\n\tvoid interpretPopStackTop()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Pop the element from the stack.\n\t\tpop();\n\t}\n\n\tvoid interpretExtendA()\n\t{\n\t\textendA = extendA*256 + fetchByte();\n\t\tfetchNextInstructionOpcode();\n\t}\n\n\tvoid interpretExtendB()\n\t{\n\t\textendB = extendB*256 + fetchSByte();\n\t\tfetchNextInstructionOpcode();\n\t}\n\n\tvoid interpretPushReceiverVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushLiteralVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushLiteral()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushTemporary()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushNTemps()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushInteger()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushCharacter()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushArrayWithElements()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretSend()\n\t{\n\t\t\/\/ Fetch the data.\n\t\tint data = fetchByte();\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Decode the literal index and argument index\n\t\tauto argumentCount = (data & BytecodeSet::Send_ArgumentCountMask) + extendB * BytecodeSet::Send_ArgumentCountCount;\n\t\tauto literalIndex = ((data >> BytecodeSet::Send_LiteralIndexShift) & BytecodeSet::Send_LiteralIndexMask) + extendA * BytecodeSet::Send_LiteralIndexCount;\n\t\t\n\t\t\/\/ Clear the extension values.\n\t\textendA = 0;\n\t\textendB = 0;\n\t\t\n\t\t\/\/ Send the message\n\t\tsendLiteralIndexArgumentCount(literalIndex, argumentCount);\n\t}\n\n\tvoid interpretSuperSend()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretTrapOnBehavior()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretJump()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretJumpOnTrue()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretJumpOnFalse()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPopStoreReceiverVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPopStoreLiteralVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPopStoreTemporalVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretStoreReceiverVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretStoreLiteralVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretStoreTemporalVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n};\n\nStackInterpreter::StackInterpreter()\n{\n}\n\nStackInterpreter::~StackInterpreter()\n{\n}\n\t\nOop StackInterpreter::interpretMethod(CompiledMethod *newMethod, Oop receiver, int argumentCount, Oop *arguments)\n{\n\t\/\/ Check the argument count\n\tif(argumentCount != (int)newMethod->getArgumentCount())\n\t\terror(\"invalid suplied argument count.\");\n\n\tisReturning = false;\n\t\n\t\/\/ Store the receiver and the argument data\n\tthis->receiver = receiver;\n\tthis->arguments = arguments;\n\t\n\t\/\/ Fetch the method data\n\tfetchMethodData(newMethod);\n\tinstructionPointer = firstInstructionPointer;\n\t\n\t\/\/ Fetch the first instruction opcode\n\tfetchNextInstructionOpcode();\n\t\n\t\/\/ Reset the extensions values\n\textendA = 0;\n\textendB = 0;\n\t\n\twhile(!isReturning)\n\t{\n\t\tcurrentOpcode = nextOpcode;\n\t\t\n\t\tswitch(currentOpcode)\n\t\t{\n#define MAKE_RANGE_CASE(i, from, to, name) \\\ncase i + from:\\\n\tinterpret ## name(); \\\n\tbreak;\n\n#define SISTAV1_INSTRUCTION_RANGE(name, rangeFirst, rangeLast) \\\n\tLODTALK_EVAL(LODTALK_FROM_TO_INCLUSIVE(rangeFirst, rangeLast, MAKE_RANGE_CASE, name))\n\n#define SISTAV1_INSTRUCTION(name, opcode) \\\ncase opcode:\\\n\tinterpret ## name(); \\\n\tbreak;\n#include \"SistaV1BytecodeSet.inc\"\n#undef SISTAV1_INSTRUCTION_RANGE\n#undef SISTAV1_INSTRUCTION\n#undef MAKE_RANGE_CASE\n\n\t\tdefault:\n\t\t\terrorFormat(\"unsupported bytecode %d\", currentOpcode);\n\t\t}\n\t}\n\t\n\treturn methodReturnValue;\n}\n\t\nOop interpretCompiledMethod(CompiledMethod *method, Oop receiver, int argumentCount, Oop *arguments)\n{\n\tStackInterpreter interpreter;\n\treturn interpreter.interpretMethod(method, receiver, argumentCount, arguments);\n}\n\n} \/\/ End of namespace Lodtalk\n<commit_msg>I did more work in the interpreter.<commit_after>#include <stdarg.h>\n#include \"StackInterpreter.hpp\"\n#include \"PreprocessorHacks.hpp\"\n#include \"BytecodeSets.hpp\"\n#include \"Common.hpp\"\n\nnamespace Lodtalk\n{\n\n\/**\n * The stack interpreter.\n * This stack interpreter is based in the arquitecture of squeak.\n *\/ \nclass StackInterpreter\n{\npublic:\n\tStackInterpreter();\n\t~StackInterpreter();\n\t\n\tOop interpretMethod(CompiledMethod *method, Oop receiver, int argumentCount, Oop *arguments);\n\t\nprivate:\n\tvoid error(const char *message)\n\t{\n\t\tfprintf(stdout, \"Interpreter error: %s\\n\", message);\n\t\tabort();\n\t}\n\n\tvoid errorFormat(const char *format, ...)\n\t{\n\t\tchar buffer[1024];\n\t\tva_list args;\n\t\tva_start(args, format);\n\t\tvsnprintf(buffer, 1024, format, args);\n\t\terror(buffer);\n\t\tabort();\n\t}\n\t\n\tvoid fetchMethodData(CompiledMethod *newMethod)\n\t{\n\t\tmethod = newMethod;\n\t\tliteralCount = method->getLiteralCount();\n\t\targumentCount = method->getArgumentCount();\n\t\ttemporalCount = method->getTemporalCount();\n\t\tfirstInstructionPointer = method->getFirstBCPointer();\n\t\tliteralArray = method->getFirstLiteralPointer();\n\t}\n\t\n\tint fetchByte()\n\t{\n\t\treturn *instructionPointer++;\n\t}\n\n\tint fetchSByte()\n\t{\n\t\tauto sbyte = *reinterpret_cast<int8_t*> (instructionPointer);\n\t\tinstructionPointer++;\n\t\treturn sbyte;\n\t}\n\t\n\tvoid fetchNextInstructionOpcode()\n\t{\n\t\tnextOpcode = fetchByte();\n\t}\n\n\tvoid push(Oop object)\n\t{\n\t\tstackMemory.push_back(object);\n\t}\n\t\n\tsize_t getCurrentStackSize() const\n\t{\n\t\treturn stackMemory.size();\n\t}\n\t\n\tOop currentReceiver() const\n\t{\n\t\treturn methodReceiver;\n\t}\n\t\n\tOop pop()\n\t{\n\t\tif(!getCurrentStackSize())\n\t\t\terror(\"Stack underflow\");\n\t\t\t\n\t\tauto result = stackMemory.back();\n\t\tstackMemory.pop_back();\n\t\treturn result;\n\t}\n\t\n\tOop stackTop()\n\t{\n\t\tif(!getCurrentStackSize())\n\t\t\terror(\"Stack underflow\");\n\n\t\treturn stackMemory.back();\n\t}\n\t\n\tbool condJumpOnNotBoolean(bool jumpType)\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\nprivate:\n\t\/\/ TODO: Use a proper downward growing stack\n\tstd::vector<Oop> stackMemory;\n \n\t\/\/ Interpreter data\n\tCompiledMethod *method;\n\tuint8_t *firstInstructionPointer;\n\tuint8_t *instructionPointer;\n\tint nextOpcode;\n\tint currentOpcode;\n\t\n\tsize_t argumentCount;\n\tsize_t literalCount;\n\tsize_t temporalCount;\n\t\n\tuint64_t extendA;\n\tint64_t extendB;\n\t\n\tOop methodReceiver;\n\tOop *arguments;\n\tOop *literalArray;\n\t\n\tbool isReturning;\n\tOop methodReturnValue;\n\nprivate:\n\tvoid pushLiteralVariable(int literalVarIndex)\n\t{\n\t\tauto literal = literalArray[literalVarIndex];\n\t\t\n\t\t\/\/ Cast the literal variable and push the value\n\t\tauto literalVar = reinterpret_cast<LiteralVariable*> (literal.pointer);\n\t\tpush(literalVar->value);\n\t}\n\n\tvoid pushLiteral(int literalIndex)\n\t{\n\t\tauto literal = literalArray[literalIndex];\n\t\t\n\t\t\/\/ Cast the literal variable and push the value\n\t\tpush(literal);\n\t}\n\t\n\tvoid sendLiteralIndexArgumentCount(int literalIndex, int argumentCount)\n\t{\n\t\tauto selector = literalArray[literalIndex];\n\t\t\n\t\t\/\/ TODO: Make this more efficient.\n\t\tOop arguments[argumentCount];\n\t\tfor(int i = 0; i < argumentCount; ++i)\n\t\t\targuments[argumentCount - i - 1] = pop();\n\n\t\t\/\/ Get the receiver.\n\t\tOop newReceiver = pop();\n\t\t\n\t\t\/\/ Perform the message send.\n\t\tOop result = sendMessage(newReceiver, selector, argumentCount, arguments);\n\t\tpush(result);\n\t}\n\t\n\t\/\/ Bytecode instructions\n\tvoid interpretPushReceiverVariableShort()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushLiteralVariableShort()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal inde \n\t\tauto literalVarIndex = currentOpcode & 0xF;\n\t\tpushLiteralVariable(literalVarIndex);\n\t}\n\t\n\tvoid interpretPushLiteralShort()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal inded\n\t\tauto literalIndex = currentOpcode & 0x1F; \n\t\tpushLiteral(literalIndex);\n\t}\n\t\n\tvoid interpretPushTempShort()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretSendShortArgs0()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal index\n\t\tauto literalIndex = currentOpcode & 0x0F;\n\t\tsendLiteralIndexArgumentCount(literalIndex, 0);\n\t}\n\t\n\tvoid interpretSendShortArgs1()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal index\n\t\tauto literalIndex = currentOpcode & 0x0F;\n\t\tsendLiteralIndexArgumentCount(literalIndex, 1);\n\t}\n\t\n\tvoid interpretSendShortArgs2()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Fetch the literal index\n\t\tauto literalIndex = currentOpcode & 0x0F;\n\t\tsendLiteralIndexArgumentCount(literalIndex, 2);\n\t}\n\t\n\tvoid interpretJumpShort()\n\t{\n\t\tauto delta = (currentOpcode & 7) + 1;\n\t\tinstructionPointer += delta;\n\t}\n\t\n\tvoid interpretJumpOnTrueShort()\n\t{\n\t\t\/\/ Fetch the condition and the next instruction opcode\n\t\tfetchNextInstructionOpcode();\n\t\tauto condition = pop();\n\t\t\n\t\t\/\/ Perform the branch when requested.\n\t\tif(condition == trueOop())\n\t\t{\n\t\t\tauto delta = (currentOpcode & 7);\n\t\t\tinstructionPointer += delta;\n\t\t\tfetchNextInstructionOpcode();\n\t\t}\n\t\telse if(condition != falseOop())\n\t\t{\n\t\t\t\/\/ If the condition is not a boolean, trap\n\t\t\tcondJumpOnNotBoolean(true);\n\t\t}\n\t}\n\t\n\tvoid interpretJumpOnFalseShort()\n\t{\n\t\t\/\/ Fetch the condition and the next instruction opcode\n\t\tfetchNextInstructionOpcode();\n\t\tauto condition = pop();\n\t\t\n\t\t\/\/ Perform the branch when requested.\n\t\tif(condition == falseOop())\n\t\t{\n\t\t\tauto delta = (currentOpcode & 7);\n\t\t\tinstructionPointer += delta;\n\t\t\tfetchNextInstructionOpcode();\n\t\t}\n\t\telse if(condition != trueOop())\n\t\t{\n\t\t\t\/\/ If the condition is not a boolean, trap\n\t\t\tcondJumpOnNotBoolean(false);\n\t\t}\n\t}\n\t\n\tvoid interpretPopStoreReceiverVariableShort()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPopStoreTemporalVariableShort()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushReceiver()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\tpush(currentReceiver());\n\t}\n\n\tvoid interpretPushTrue()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\tpush(trueOop());\n\t}\n\n\tvoid interpretPushFalse()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\tpush(falseOop());\n\t}\n\t\n\tvoid interpretPushNil()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\tpush(nilOop());\n\t}\n\t\n\tvoid interpretPushZero()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\tpush(Oop::encodeSmallInteger(0));\n\t}\n\t\n\tvoid interpretPushOne()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\tpush(Oop::encodeSmallInteger(1));\n\t}\n\n\tvoid interpretPushThisContext()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretDuplicateStackTop()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\tpush(stackTop());\n\t}\n\n\tvoid interpretReturnReceiver()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = currentReceiver();\n\t}\n\n\tvoid interpretReturnTrue()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = trueOop();\n\t}\n\t\n\tvoid interpretReturnFalse()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = falseOop();\n\t}\n\t\n\tvoid interpretReturnNil()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = nilOop();\n\t}\n\n\tvoid interpretReturnTop()\n\t{\n\t\tisReturning = true;\n\t\tmethodReturnValue = pop();\n\t}\n\n\tvoid interpretBlockReturnNil()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretBlockReturnTop()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretNop()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Do nothing\n\t}\n\n\tvoid interpretPopStackTop()\n\t{\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Pop the element from the stack.\n\t\tpop();\n\t}\n\n\tvoid interpretExtendA()\n\t{\n\t\textendA = extendA*256 + fetchByte();\n\t\tfetchNextInstructionOpcode();\n\t}\n\n\tvoid interpretExtendB()\n\t{\n\t\textendB = extendB*256 + fetchSByte();\n\t\tfetchNextInstructionOpcode();\n\t}\n\n\tvoid interpretPushReceiverVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushLiteralVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushLiteral()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushTemporary()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushNTemps()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushInteger()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPushCharacter()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPushArrayWithElements()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretSend()\n\t{\n\t\t\/\/ Fetch the data.\n\t\tint data = fetchByte();\n\t\tfetchNextInstructionOpcode();\n\t\t\n\t\t\/\/ Decode the literal index and argument index\n\t\tauto argumentCount = (data & BytecodeSet::Send_ArgumentCountMask) + extendB * BytecodeSet::Send_ArgumentCountCount;\n\t\tauto literalIndex = ((data >> BytecodeSet::Send_LiteralIndexShift) & BytecodeSet::Send_LiteralIndexMask) + extendA * BytecodeSet::Send_LiteralIndexCount;\n\t\t\n\t\t\/\/ Clear the extension values.\n\t\textendA = 0;\n\t\textendB = 0;\n\t\t\n\t\t\/\/ Send the message\n\t\tsendLiteralIndexArgumentCount(literalIndex, argumentCount);\n\t}\n\n\tvoid interpretSuperSend()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretTrapOnBehavior()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretJump()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretJumpOnTrue()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretJumpOnFalse()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\t\n\tvoid interpretPopStoreReceiverVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPopStoreLiteralVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretPopStoreTemporalVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretStoreReceiverVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretStoreLiteralVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n\tvoid interpretStoreTemporalVariable()\n\t{\n\t\tLODTALK_UNIMPLEMENTED();\n\t}\n\n};\n\nStackInterpreter::StackInterpreter()\n{\n}\n\nStackInterpreter::~StackInterpreter()\n{\n}\n\t\nOop StackInterpreter::interpretMethod(CompiledMethod *newMethod, Oop receiver, int argumentCount, Oop *arguments)\n{\n\t\/\/ Check the argument count\n\tif(argumentCount != (int)newMethod->getArgumentCount())\n\t\terror(\"invalid suplied argument count.\");\n\n\tisReturning = false;\n\t\n\t\/\/ Store the receiver and the argument data\n\tthis->methodReceiver = receiver;\n\tthis->arguments = arguments;\n\t\n\t\/\/ Fetch the method data\n\tfetchMethodData(newMethod);\n\tinstructionPointer = firstInstructionPointer;\n\t\n\t\/\/ Fetch the first instruction opcode\n\tfetchNextInstructionOpcode();\n\t\n\t\/\/ Reset the extensions values\n\textendA = 0;\n\textendB = 0;\n\t\n\twhile(!isReturning)\n\t{\n\t\tcurrentOpcode = nextOpcode;\n\t\t\n\t\tswitch(currentOpcode)\n\t\t{\n#define MAKE_RANGE_CASE(i, from, to, name) \\\ncase i + from:\\\n\tinterpret ## name(); \\\n\tbreak;\n\n#define SISTAV1_INSTRUCTION_RANGE(name, rangeFirst, rangeLast) \\\n\tLODTALK_EVAL(LODTALK_FROM_TO_INCLUSIVE(rangeFirst, rangeLast, MAKE_RANGE_CASE, name))\n\n#define SISTAV1_INSTRUCTION(name, opcode) \\\ncase opcode:\\\n\tinterpret ## name(); \\\n\tbreak;\n#include \"SistaV1BytecodeSet.inc\"\n#undef SISTAV1_INSTRUCTION_RANGE\n#undef SISTAV1_INSTRUCTION\n#undef MAKE_RANGE_CASE\n\n\t\tdefault:\n\t\t\terrorFormat(\"unsupported bytecode %d\", currentOpcode);\n\t\t}\n\t}\n\t\n\treturn methodReturnValue;\n}\n\t\nOop interpretCompiledMethod(CompiledMethod *method, Oop receiver, int argumentCount, Oop *arguments)\n{\n\tStackInterpreter interpreter;\n\treturn interpreter.interpretMethod(method, receiver, argumentCount, arguments);\n}\n\n} \/\/ End of namespace Lodtalk\n<|endoftext|>"}
{"text":"<commit_before>\/* Siconos-Kernel, Copyright INRIA 2005-2010.\n * Siconos is a program dedicated to modeling, simulation and control\n * of non smooth dynamical systems.\n * Siconos is a 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 * Siconos is distributed in the hope that it 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 Siconos; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n * Contact: Vincent ACARY, siconos-team@lists.gforge.inria.fr\n*\/\n\n#include \"BulletDS.hpp\"\n\n#include <BulletCollision\/CollisionDispatch\/btCollisionObject.h>\n#include <BulletCollision\/CollisionShapes\/btBoxShape.h>\n#include <BulletCollision\/CollisionShapes\/btCylinderShape.h>\n#include <LinearMath\/btVector3.h>\n\nBulletDS::BulletDS(const BroadphaseNativeTypes& shape_type,\n                   const SP::SimpleVector& shapeParams,\n                   SP::SiconosVector position,\n                   SP::SiconosVector velocity,\n                   const double& mass) : NewtonEulerDS()\n{\n  _mass = mass;\n\n  btVector3 inertia;\n\n  SP::SimpleMatrix inertiaMatrix(new SimpleMatrix(3, 3));\n  inertiaMatrix->eye();\n\n  internalInit(position, velocity, mass, inertiaMatrix);\n\n  _collisionObject.reset(new btCollisionObject());\n  btMatrix3x3 basis;\n  basis.setIdentity();\n  _collisionObject->getWorldTransform().setBasis(basis);\n\n  _collisionObject->setUserPointer(this);\n  _collisionObject->setCollisionFlags(_collisionObject->getCollisionFlags() | btCollisionObject::CF_KINEMATIC_OBJECT);\n\n\n  switch (shape_type)\n  {\n  case BOX_SHAPE_PROXYTYPE :\n  {\n    btVector3 params;\n    params[0] = (*shapeParams)(0);\n    params[1] = (*shapeParams)(1);\n    params[2] = (*shapeParams)(2);\n    _collisionShape.reset(new btBoxShape(params));\n    _collisionShape->calculateLocalInertia(mass, inertia);\n    (*_I)(0, 0) = inertia[0];\n    (*_I)(1, 1) = inertia[1];\n    (*_I)(2, 2) = inertia[2];\n\n    _collisionObject->setCollisionShape(&*_collisionShape);\n\n    break;\n  };\n  case CYLINDER_SHAPE_PROXYTYPE :\n  {\n    btVector3 params;\n    params[0] = (*shapeParams)(0);\n    params[1] = (*shapeParams)(1);\n    params[2] = (*shapeParams)(2);\n    _collisionShape.reset(new btCylinderShape(params));\n    _collisionShape->calculateLocalInertia(mass, inertia);\n    (*_I)(0, 0) = inertia[0];\n    (*_I)(1, 1) = inertia[1];\n    (*_I)(2, 2) = inertia[2];\n\n    _collisionObject->setCollisionShape(&*_collisionShape);\n\n    break;\n  };\n  \/\/ ...\n\n  }\n}\n\n<commit_msg>capsule shape<commit_after>\/* Siconos-Kernel, Copyright INRIA 2005-2010.\n * Siconos is a program dedicated to modeling, simulation and control\n * of non smooth dynamical systems.\n * Siconos is a 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 * Siconos is distributed in the hope that it 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 Siconos; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n * Contact: Vincent ACARY, siconos-team@lists.gforge.inria.fr\n*\/\n\n#include \"BulletDS.hpp\"\n\n#include <BulletCollision\/CollisionDispatch\/btCollisionObject.h>\n#include <BulletCollision\/CollisionShapes\/btBoxShape.h>\n#include <BulletCollision\/CollisionShapes\/btCylinderShape.h>\n#include <BulletCollision\/CollisionShapes\/btCapsuleShape.h>\n#include <LinearMath\/btVector3.h>\n\nBulletDS::BulletDS(const BroadphaseNativeTypes& shape_type,\n                   const SP::SimpleVector& shapeParams,\n                   SP::SiconosVector position,\n                   SP::SiconosVector velocity,\n                   const double& mass) : NewtonEulerDS()\n{\n  _mass = mass;\n\n  btVector3 inertia;\n\n  SP::SimpleMatrix inertiaMatrix(new SimpleMatrix(3, 3));\n  inertiaMatrix->eye();\n\n  internalInit(position, velocity, mass, inertiaMatrix);\n\n  _collisionObject.reset(new btCollisionObject());\n  btMatrix3x3 basis;\n  basis.setIdentity();\n  _collisionObject->getWorldTransform().setBasis(basis);\n\n  _collisionObject->setUserPointer(this);\n  _collisionObject->setCollisionFlags(_collisionObject->getCollisionFlags() | btCollisionObject::CF_KINEMATIC_OBJECT);\n\n\n  switch (shape_type)\n  {\n  case BOX_SHAPE_PROXYTYPE :\n  {\n    btVector3 params;\n    params[0] = (*shapeParams)(0);\n    params[1] = (*shapeParams)(1);\n    params[2] = (*shapeParams)(2);\n    _collisionShape.reset(new btBoxShape(params));\n    _collisionShape->calculateLocalInertia(mass, inertia);\n    (*_I)(0, 0) = inertia[0];\n    (*_I)(1, 1) = inertia[1];\n    (*_I)(2, 2) = inertia[2];\n\n    _collisionObject->setCollisionShape(&*_collisionShape);\n\n    break;\n  };\n  case CYLINDER_SHAPE_PROXYTYPE :\n  {\n    btVector3 params;\n    params[0] = (*shapeParams)(0);\n    params[1] = (*shapeParams)(1);\n    params[2] = (*shapeParams)(2);\n    _collisionShape.reset(new btCylinderShape(params));\n    _collisionShape->calculateLocalInertia(mass, inertia);\n    (*_I)(0, 0) = inertia[0];\n    (*_I)(1, 1) = inertia[1];\n    (*_I)(2, 2) = inertia[2];\n\n    _collisionObject->setCollisionShape(&*_collisionShape);\n\n    break;\n  };\n\n  case CAPSULE_SHAPE_PROXYTYPE :\n  {\n    btScalar radius;\n    btScalar height;\n    radius = (*shapeParams)(0);\n    height = (*shapeParams)(1);\n    _collisionShape.reset(new btCapsuleShape(radius, height));\n    _collisionShape->calculateLocalInertia(mass, inertia);\n    (*_I)(0, 0) = inertia[0];\n    (*_I)(1, 1) = inertia[1];\n    (*_I)(2, 2) = inertia[2];\n\n    _collisionObject->setCollisionShape(&*_collisionShape);\n\n    break;\n  };\n  \/\/ ...\n\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************************************************************\n* ALMA - Atacama Large Millimiter Array\n* (c) European Southern Observatory, 2011\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: bulkDataNTConfiguration.cpp,v 1.29 2012\/10\/12 13:57:22 bjeram Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* bjeram  2011-04-19  created\n*\/\n\n#include \"bulkDataNTConfiguration.h\"\n#include <ndds_config_cpp.h>\n#include <logging.h>\n\nusing namespace AcsBulkdata;\n\nconst char* const DDSConfiguration::DEFAULT_LIBRARY = \"BulkDataQoSLibrary\";\nconst char* const DDSConfiguration::DEFAULT_SENDER_STREAM_PROFILE = \"SenderStreamDefaultQosProfile\";\nconst char* const DDSConfiguration::DEFAULT_SENDER_FLOW_PROFILE= \"SenderFlowDefaultQosProfile\";\nconst char* const DDSConfiguration::DEFAULT_RECEIVER_STREAM_PROFILE = \"ReceiverStreamDefaultQosProfile\";\nconst char* const DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE = \"ReceiverFlowDefaultQosProfile\";\nconst char* const DDSConfiguration::DEFAULT_API_CREATE_PROFILE = \"APICreateProfile\";\n\nshort DDSConfiguration::debugLevel = -1;\nunsigned int DDSConfiguration::DDSLogVerbosity = (unsigned int)(NDDS_CONFIG_LOG_VERBOSITY_WARNING);\n\nbool StreamConfiguration::DEFAULT_PARTICIPANT_PER_STREAM=false;\n\ndouble SenderFlowConfiguration::DEFAULT_SENDFRAME_TIMEOUT=5.0;  \/\/secs\ndouble SenderFlowConfiguration::DEFAULT_ACKs_TIMEOUT=2.0; \/\/secs\n\nunsigned short ReceiverStreamConfiguration::DEFAULT_BASE_UNICAST_PORT=48000;\nbool ReceiverStreamConfiguration::DEFAULT_USE_INCREMENT_UNICAST_PORT=true;\n\nconst char* const ReceiverFlowConfiguration::DEFAULT_MULTICAST_ADDRESS=\"225.3.2.1\";\ndouble ReceiverFlowConfiguration::DEFAULT_CBRECEIVE_PROCESS_TIMEOUT=0.01; \/\/sec => 6.4 MB\/sec\ndouble ReceiverFlowConfiguration::DEFAULT_CBRECEIVE_AVG_PROCESS_TIMEOUT=0.005; \/\/sec => ~ 12MB\/sec\nbool ReceiverFlowConfiguration::DEFAULT_ENABLE_MULTICAST=true;\nunsigned short ReceiverFlowConfiguration::DEFAULT_UNICAST_PORT=0; \/\/\/0 means that DDS will choose the port\n\nbool DDSConfiguration::ignoreUserProfileQoS = true;\nbool DDSConfiguration::ignoreEnvironmentProfileQoS = true;\n\nstd::string DDSConfiguration::urlProfileQoS=\"\";\nconst char* const DDSConfiguration::DEFAULT_QoS_FILE=\"\/config\/bulkDataNTDefaultQosProfiles.xml\";\n\nbool AcsBulkdata::isBulkDataNTEnabled()\n{\n\tconst char *enableBulkDataNT = getenv(\"ENABLE_BULKDATA_NT\");\n\n\treturn ( enableBulkDataNT != 0 &&\n\t\t\t(strcmp(enableBulkDataNT, \"1\")==0 ||\n\t\t\t strcasecmp(enableBulkDataNT, \"true\")==0 ||\n\t\t\t strcasecmp(enableBulkDataNT, \"y\")==0\n\t\t\t)\n\t\t);\n}\n\/**************************************************************************************\n * \t\t\tStreamConfiguration\n **************************************************************************************\/\nDDSConfiguration::DDSConfiguration()\n{\n\tlibraryQos=DDSConfiguration::DEFAULT_LIBRARY;\n\tDDSConfiguration::setDebugLevelFromEnvVar();\n\n\tif (urlProfileQoS.empty())\n\t{\n\t\turlProfileQoS = \"[\";\n\t\tfillUrlProfileQoS(\"ACSDATA\");\n\t\turlProfileQoS+=\"]\";\n\t\t\/\/ here we are sure that this is executed just once\n\t\tchar *envVar = getenv(\"NDDS_DISCOVERY_PEERS\");\n\t\tif (envVar && *envVar)\n\t\t{\n\t\t\tACS_SHORT_LOG((LM_WARNING, \"Env. variable NDDS_DISCOVERY_PEERS has been set to: %s, what could cause a problem to connect sender and receivers if it is not proprly used.\", envVar));\n\t\t}\/\/if\n\t}\/\/if\n}\/\/DDSConfiguration\n\nvoid DDSConfiguration::setDebugLevelFromEnvVar()\n{\n\tif (debugLevel<0) \/\/we read and set debug level jsut once\n\t{\n\t\tchar *bulkDataNtDebug = getenv(\"BULKDATA_NT_DEBUG\");\n\t\tif (bulkDataNtDebug && *bulkDataNtDebug)\n\t\t{\n\t\t\tdebugLevel = atoi(bulkDataNtDebug);\n\t\t\tDDSConfiguration::setDDSLogVerbosity();\n\t\t\tACS_SHORT_LOG((LM_INFO, \"BulkDataNT debug level read from env. var. BULKDATA_NT_DEBUG and set to %d\", debugLevel));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdebugLevel=0;\n\t\t}\n\t}\n}\/\/setDebugLevelFromEnvVar\n\nvoid DDSConfiguration::fillUrlProfileQoS(const char* envVar, const char *dilim)\n{\n\tchar *envVarValue = getenv(envVar);\n\tif (envVarValue != NULL)\n\t{\n\t\turlProfileQoS += \"file:\/\/\";\n\t\turlProfileQoS += envVarValue;\n\t\turlProfileQoS += DEFAULT_QoS_FILE;\n\t\turlProfileQoS += dilim;\n\t}\n}\/\/fillUrlProfileQoS\n\nvoid DDSConfiguration::setDDSLogVerbosity()\n{\n\t\/\/RTI logging\n\tswitch (DDSConfiguration::debugLevel)\n\t{\n\tcase 2:\n\t\tDDSConfiguration::DDSLogVerbosity = NDDS_CONFIG_LOG_VERBOSITY_STATUS_LOCAL;\n\t\tbreak;\n\tcase 3:\n\t\tDDSConfiguration::DDSLogVerbosity = NDDS_CONFIG_LOG_VERBOSITY_STATUS_REMOTE;\n\t\tbreak;\n\tcase 4:\n\t\tDDSConfiguration::DDSLogVerbosity = NDDS_CONFIG_LOG_VERBOSITY_STATUS_ALL;\n\t\tbreak;\n\t}\n\tNDDSConfigLogger::get_instance()->set_verbosity_by_category(\n\t\t\tNDDS_CONFIG_LOG_CATEGORY_API,  (NDDS_Config_LogVerbosity)(DDSConfiguration::DDSLogVerbosity));\n\t\/*\n\tNDDSConfigLogger::get_instance()->set_verbosity_by_category(\n\t\t\t\tNDDS_CONFIG_LOG_CATEGORY_COMMUNICATION,  (NDDS_Config_LogVerbosity)(DDSConfiguration::DDSLogVerbosity));\n\tNDDSConfigLogger::get_instance()->set_verbosity_by_category(\n\t\t\t\t\tNDDS_CONFIG_LOG_CATEGORY_ENTITIES,  (NDDS_Config_LogVerbosity)(DDSConfiguration::DDSLogVerbosity));\n*\/\n}\/\/setDDSLogVerbosity\n\nvoid DDSConfiguration::setStringProfileQoS(char *cfg, const char *defaultProfile)\n{\n\tprofileQos=DEFAULT_API_CREATE_PROFILE;\n\n\tstringProfileQoS=\"<qos_profile name=\\\"\";\n\tstringProfileQoS+=profileQos;\n\tstringProfileQoS+=\"\\\" base_name=\\\"\";\n\tstringProfileQoS+=DDSConfiguration::DEFAULT_LIBRARY;\n\tstringProfileQoS+=\"::\";\n\tstringProfileQoS+=defaultProfile;\n\tstringProfileQoS+=\"\\\">\";\n\tstringProfileQoS+=cfg;\n\tstringProfileQoS+=\"<\/qos_profile>\";\n}\/\/setStringProfileQoS\n\nvoid DDSConfiguration::setStringProfileQoS(char*  profileName, char* cfg, const char *defaultProfile)\n{\n\tprofileQos=profileName;\n\tstringProfileQoS=\"<qos_profile name=\\\"\";\n\tstringProfileQoS+=profileQos;\n\tstringProfileQoS+=\"\\\" base_name=\\\"\";\n\tstringProfileQoS+=DDSConfiguration::DEFAULT_LIBRARY;\n\tstringProfileQoS+=\"::\";\n\tstringProfileQoS+=defaultProfile;\n\tstringProfileQoS+=\"\\\">\";\n\tstringProfileQoS+=cfg;\n\tstringProfileQoS+=\"<\/qos_profile>\";\n}\/\/setStringProfileQoS\n\n\/**************************************************************************************\n * \t\t\tStreamConfiguration\n **************************************************************************************\/\nStreamConfiguration::StreamConfiguration()\n{\n\n\tparticipantPerStream = DEFAULT_PARTICIPANT_PER_STREAM;\n}\/\/StreamConfiguration\n\n\n\/**************************************************************************************\n * \t\t\tSenderStreamConfiguration\n **************************************************************************************\/\nSenderStreamConfiguration::SenderStreamConfiguration()\n{\n\tprofileQos=DEFAULT_SENDER_STREAM_PROFILE;\n}\/\/StreamConfiguration\n\n\/**************************************************************************************\n * \t\t\tReceiverStreamConfiguration\n **************************************************************************************\/\nReceiverStreamConfiguration::ReceiverStreamConfiguration()\n{\n\tprofileQos=DEFAULT_RECEIVER_STREAM_PROFILE;\n}\/\/ReceiverStreamConfiguration\n\nvoid ReceiverStreamConfiguration::setDDSReceiverStreamQoS(char *cfg)\n{\n\tsetStringProfileQoS(cfg, DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE);\n}\/\/setDDSReceiverStreamQoS\n\nvoid ReceiverStreamConfiguration::setDDSReceiverStreamQoS(char *profileName, char* cfg)\n{\n\tsetStringProfileQoS(profileName, cfg, DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE);\n}\/\/setDDSReceiverStreamQoS\n\n\/**************************************************************************************\n * \t\t\tReceiverFlowConfiguration\n **************************************************************************************\/\nReceiverFlowConfiguration::ReceiverFlowConfiguration()\n{\n\tprofileQos=DEFAULT_RECEIVER_FLOW_PROFILE;\n\tcbReceiveProcessTimeout =DEFAULT_CBRECEIVE_PROCESS_TIMEOUT;\n\tcbReceiveAvgProcessTimeout =DEFAULT_CBRECEIVE_AVG_PROCESS_TIMEOUT;\n\tenableMulticast = DEFAULT_ENABLE_MULTICAST;\n\tmulticastAddress = DEFAULT_MULTICAST_ADDRESS;\n}\/\/ReceiverFlowConfiguration\n\n\ndouble ReceiverFlowConfiguration::getCbReceiveProcessTimeout() const\n{\n    return cbReceiveProcessTimeout;\n}\n\nvoid ReceiverFlowConfiguration::setCbReceiveProcessTimeout(double cbReceiveProcessTimeout)\n{\n    this->cbReceiveProcessTimeout = cbReceiveProcessTimeout;\n}\n\n\ndouble ReceiverFlowConfiguration::getCbReceiveAvgProcessTimeout() const\n{\n    return cbReceiveAvgProcessTimeout;\n}\n\nvoid ReceiverFlowConfiguration::setCbReceiveAvgProcessTimeout(double cbReceiveAvgProcessTimeout)\n{\n    this->cbReceiveAvgProcessTimeout = cbReceiveAvgProcessTimeout;\n}\n\nstd::string ReceiverFlowConfiguration::getMulticastAddress() const\n{\n    return multicastAddress;\n}\n\nbool ReceiverFlowConfiguration::isEnableMulticast() const\n{\n    return enableMulticast;\n}\n\nvoid ReceiverFlowConfiguration::setEnableMulticast(bool enableMulticast)\n{\n    this->enableMulticast = enableMulticast;\n}\n\nvoid ReceiverFlowConfiguration::setMulticastAddress(std::string multicastAddress)\n{\n    this->multicastAddress = multicastAddress;\n}\n\nunsigned short ReceiverFlowConfiguration::getUnicastPort() const\n{\n\treturn this->unicastPort;\n}\n\nvoid ReceiverFlowConfiguration::setUnicastPort(\tunsigned short port)\n{\n\tthis->unicastPort = port;\n}\n\nvoid ReceiverFlowConfiguration::setDDSReceiverFlowQoS(char* cfg)\n{\n\tsetStringProfileQoS(cfg, DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE);\n}\/\/setDDSReceiverFlowQoS\n\nvoid ReceiverFlowConfiguration::setDDSReceiverFlowQoS(char* profileName, char* cfg)\n{\n\tsetStringProfileQoS(profileName, cfg, DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE);\n}\/\/setDDSReceiverFlowQoS\n\n\/**************************************************************************************\n * \t\t\tSenderFlowConfiguration\n **************************************************************************************\/\nSenderFlowConfiguration::SenderFlowConfiguration()\n{\n\tprofileQos=DEFAULT_SENDER_FLOW_PROFILE;\n\tsendFrameTimeout = DEFAULT_SENDFRAME_TIMEOUT;\n\tACKsTimeout = DEFAULT_ACKs_TIMEOUT;\n}\n\ndouble SenderFlowConfiguration::getACKsTimeout() const\n{\n    return ACKsTimeout;\n}\n\ndouble SenderFlowConfiguration::getSendFrameTimeout() const\n{\n    return sendFrameTimeout;\n}\n\nvoid SenderFlowConfiguration::setACKsTimeout(double acKsTimeout)\n{\n    ACKsTimeout = acKsTimeout;\n}\n\nvoid SenderFlowConfiguration::setSendFrameTimeout(double frameTimeout)\n{\n    this->sendFrameTimeout = frameTimeout;\n}\n\nvoid SenderFlowConfiguration::setDDSSenderFlowQoS(char* cfg)\n{\n\tsetStringProfileQoS(cfg, DDSConfiguration::DEFAULT_SENDER_FLOW_PROFILE);\n}\/\/setDDSReceiverFlowQoS\n\nvoid SenderFlowConfiguration::setDDSSenderFlowQoS(char* profileName, char* cfg)\n{\n\tsetStringProfileQoS(profileName, cfg, DDSConfiguration::DEFAULT_SENDER_FLOW_PROFILE);\n}\n\n\n\n\n\n\n\n<commit_msg>- in ReceiverFlowConfiguration set unicastPort tod efautl value - in SenderFlowConfiguration set baseUnicastPort and useIncrementUnicastPort to default vlaues<commit_after>\/**************************************************************************************************************************\n* ALMA - Atacama Large Millimiter Array\n* (c) European Southern Observatory, 2011\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: bulkDataNTConfiguration.cpp,v 1.30 2012\/10\/15 09:37:32 bjeram Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* bjeram  2011-04-19  created\n*\/\n\n#include \"bulkDataNTConfiguration.h\"\n#include <ndds_config_cpp.h>\n#include <logging.h>\n\nusing namespace AcsBulkdata;\n\nconst char* const DDSConfiguration::DEFAULT_LIBRARY = \"BulkDataQoSLibrary\";\nconst char* const DDSConfiguration::DEFAULT_SENDER_STREAM_PROFILE = \"SenderStreamDefaultQosProfile\";\nconst char* const DDSConfiguration::DEFAULT_SENDER_FLOW_PROFILE= \"SenderFlowDefaultQosProfile\";\nconst char* const DDSConfiguration::DEFAULT_RECEIVER_STREAM_PROFILE = \"ReceiverStreamDefaultQosProfile\";\nconst char* const DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE = \"ReceiverFlowDefaultQosProfile\";\nconst char* const DDSConfiguration::DEFAULT_API_CREATE_PROFILE = \"APICreateProfile\";\n\nshort DDSConfiguration::debugLevel = -1;\nunsigned int DDSConfiguration::DDSLogVerbosity = (unsigned int)(NDDS_CONFIG_LOG_VERBOSITY_WARNING);\n\nbool StreamConfiguration::DEFAULT_PARTICIPANT_PER_STREAM=false;\n\ndouble SenderFlowConfiguration::DEFAULT_SENDFRAME_TIMEOUT=5.0;  \/\/secs\ndouble SenderFlowConfiguration::DEFAULT_ACKs_TIMEOUT=2.0; \/\/secs\n\nunsigned short ReceiverStreamConfiguration::DEFAULT_BASE_UNICAST_PORT=48000;\nbool ReceiverStreamConfiguration::DEFAULT_USE_INCREMENT_UNICAST_PORT=true;\n\nconst char* const ReceiverFlowConfiguration::DEFAULT_MULTICAST_ADDRESS=\"225.3.2.1\";\ndouble ReceiverFlowConfiguration::DEFAULT_CBRECEIVE_PROCESS_TIMEOUT=0.01; \/\/sec => 6.4 MB\/sec\ndouble ReceiverFlowConfiguration::DEFAULT_CBRECEIVE_AVG_PROCESS_TIMEOUT=0.005; \/\/sec => ~ 12MB\/sec\nbool ReceiverFlowConfiguration::DEFAULT_ENABLE_MULTICAST=true;\nunsigned short ReceiverFlowConfiguration::DEFAULT_UNICAST_PORT=0; \/\/\/0 means that DDS will choose the port\n\nbool DDSConfiguration::ignoreUserProfileQoS = true;\nbool DDSConfiguration::ignoreEnvironmentProfileQoS = true;\n\nstd::string DDSConfiguration::urlProfileQoS=\"\";\nconst char* const DDSConfiguration::DEFAULT_QoS_FILE=\"\/config\/bulkDataNTDefaultQosProfiles.xml\";\n\nbool AcsBulkdata::isBulkDataNTEnabled()\n{\n\tconst char *enableBulkDataNT = getenv(\"ENABLE_BULKDATA_NT\");\n\n\treturn ( enableBulkDataNT != 0 &&\n\t\t\t(strcmp(enableBulkDataNT, \"1\")==0 ||\n\t\t\t strcasecmp(enableBulkDataNT, \"true\")==0 ||\n\t\t\t strcasecmp(enableBulkDataNT, \"y\")==0\n\t\t\t)\n\t\t);\n}\n\/**************************************************************************************\n * \t\t\tStreamConfiguration\n **************************************************************************************\/\nDDSConfiguration::DDSConfiguration()\n{\n\tlibraryQos=DDSConfiguration::DEFAULT_LIBRARY;\n\tDDSConfiguration::setDebugLevelFromEnvVar();\n\n\tif (urlProfileQoS.empty())\n\t{\n\t\turlProfileQoS = \"[\";\n\t\tfillUrlProfileQoS(\"ACSDATA\");\n\t\turlProfileQoS+=\"]\";\n\t\t\/\/ here we are sure that this is executed just once\n\t\tchar *envVar = getenv(\"NDDS_DISCOVERY_PEERS\");\n\t\tif (envVar && *envVar)\n\t\t{\n\t\t\tACS_SHORT_LOG((LM_WARNING, \"Env. variable NDDS_DISCOVERY_PEERS has been set to: %s, what could cause a problem to connect sender and receivers if it is not proprly used.\", envVar));\n\t\t}\/\/if\n\t}\/\/if\n}\/\/DDSConfiguration\n\nvoid DDSConfiguration::setDebugLevelFromEnvVar()\n{\n\tif (debugLevel<0) \/\/we read and set debug level jsut once\n\t{\n\t\tchar *bulkDataNtDebug = getenv(\"BULKDATA_NT_DEBUG\");\n\t\tif (bulkDataNtDebug && *bulkDataNtDebug)\n\t\t{\n\t\t\tdebugLevel = atoi(bulkDataNtDebug);\n\t\t\tDDSConfiguration::setDDSLogVerbosity();\n\t\t\tACS_SHORT_LOG((LM_INFO, \"BulkDataNT debug level read from env. var. BULKDATA_NT_DEBUG and set to %d\", debugLevel));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdebugLevel=0;\n\t\t}\n\t}\n}\/\/setDebugLevelFromEnvVar\n\nvoid DDSConfiguration::fillUrlProfileQoS(const char* envVar, const char *dilim)\n{\n\tchar *envVarValue = getenv(envVar);\n\tif (envVarValue != NULL)\n\t{\n\t\turlProfileQoS += \"file:\/\/\";\n\t\turlProfileQoS += envVarValue;\n\t\turlProfileQoS += DEFAULT_QoS_FILE;\n\t\turlProfileQoS += dilim;\n\t}\n}\/\/fillUrlProfileQoS\n\nvoid DDSConfiguration::setDDSLogVerbosity()\n{\n\t\/\/RTI logging\n\tswitch (DDSConfiguration::debugLevel)\n\t{\n\tcase 2:\n\t\tDDSConfiguration::DDSLogVerbosity = NDDS_CONFIG_LOG_VERBOSITY_STATUS_LOCAL;\n\t\tbreak;\n\tcase 3:\n\t\tDDSConfiguration::DDSLogVerbosity = NDDS_CONFIG_LOG_VERBOSITY_STATUS_REMOTE;\n\t\tbreak;\n\tcase 4:\n\t\tDDSConfiguration::DDSLogVerbosity = NDDS_CONFIG_LOG_VERBOSITY_STATUS_ALL;\n\t\tbreak;\n\t}\n\tNDDSConfigLogger::get_instance()->set_verbosity_by_category(\n\t\t\tNDDS_CONFIG_LOG_CATEGORY_API,  (NDDS_Config_LogVerbosity)(DDSConfiguration::DDSLogVerbosity));\n\t\/*\n\tNDDSConfigLogger::get_instance()->set_verbosity_by_category(\n\t\t\t\tNDDS_CONFIG_LOG_CATEGORY_COMMUNICATION,  (NDDS_Config_LogVerbosity)(DDSConfiguration::DDSLogVerbosity));\n\tNDDSConfigLogger::get_instance()->set_verbosity_by_category(\n\t\t\t\t\tNDDS_CONFIG_LOG_CATEGORY_ENTITIES,  (NDDS_Config_LogVerbosity)(DDSConfiguration::DDSLogVerbosity));\n*\/\n}\/\/setDDSLogVerbosity\n\nvoid DDSConfiguration::setStringProfileQoS(char *cfg, const char *defaultProfile)\n{\n\tprofileQos=DEFAULT_API_CREATE_PROFILE;\n\n\tstringProfileQoS=\"<qos_profile name=\\\"\";\n\tstringProfileQoS+=profileQos;\n\tstringProfileQoS+=\"\\\" base_name=\\\"\";\n\tstringProfileQoS+=DDSConfiguration::DEFAULT_LIBRARY;\n\tstringProfileQoS+=\"::\";\n\tstringProfileQoS+=defaultProfile;\n\tstringProfileQoS+=\"\\\">\";\n\tstringProfileQoS+=cfg;\n\tstringProfileQoS+=\"<\/qos_profile>\";\n}\/\/setStringProfileQoS\n\nvoid DDSConfiguration::setStringProfileQoS(char*  profileName, char* cfg, const char *defaultProfile)\n{\n\tprofileQos=profileName;\n\tstringProfileQoS=\"<qos_profile name=\\\"\";\n\tstringProfileQoS+=profileQos;\n\tstringProfileQoS+=\"\\\" base_name=\\\"\";\n\tstringProfileQoS+=DDSConfiguration::DEFAULT_LIBRARY;\n\tstringProfileQoS+=\"::\";\n\tstringProfileQoS+=defaultProfile;\n\tstringProfileQoS+=\"\\\">\";\n\tstringProfileQoS+=cfg;\n\tstringProfileQoS+=\"<\/qos_profile>\";\n}\/\/setStringProfileQoS\n\n\/**************************************************************************************\n * \t\t\tStreamConfiguration\n **************************************************************************************\/\nStreamConfiguration::StreamConfiguration()\n{\n\n\tparticipantPerStream = DEFAULT_PARTICIPANT_PER_STREAM;\n}\/\/StreamConfiguration\n\n\n\/**************************************************************************************\n * \t\t\tSenderStreamConfiguration\n **************************************************************************************\/\nSenderStreamConfiguration::SenderStreamConfiguration()\n{\n\tprofileQos=DEFAULT_SENDER_STREAM_PROFILE;\n}\/\/StreamConfiguration\n\n\/**************************************************************************************\n * \t\t\tReceiverStreamConfiguration\n **************************************************************************************\/\nReceiverStreamConfiguration::ReceiverStreamConfiguration()\n{\n\tprofileQos=DEFAULT_RECEIVER_STREAM_PROFILE;\n\tuseIncrementUnicastPort = DEFAULT_USE_INCREMENT_UNICAST_PORT;\n\tbaseUnicastPort = DEFAULT_BASE_UNICAST_PORT;\n}\/\/ReceiverStreamConfiguration\n\nvoid ReceiverStreamConfiguration::setDDSReceiverStreamQoS(char *cfg)\n{\n\tsetStringProfileQoS(cfg, DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE);\n}\/\/setDDSReceiverStreamQoS\n\nvoid ReceiverStreamConfiguration::setDDSReceiverStreamQoS(char *profileName, char* cfg)\n{\n\tsetStringProfileQoS(profileName, cfg, DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE);\n}\/\/setDDSReceiverStreamQoS\n\n\/**************************************************************************************\n * \t\t\tReceiverFlowConfiguration\n **************************************************************************************\/\nReceiverFlowConfiguration::ReceiverFlowConfiguration()\n{\n\tprofileQos=DEFAULT_RECEIVER_FLOW_PROFILE;\n\tcbReceiveProcessTimeout =DEFAULT_CBRECEIVE_PROCESS_TIMEOUT;\n\tcbReceiveAvgProcessTimeout =DEFAULT_CBRECEIVE_AVG_PROCESS_TIMEOUT;\n\tenableMulticast = DEFAULT_ENABLE_MULTICAST;\n\tmulticastAddress = DEFAULT_MULTICAST_ADDRESS;\n\tunicastPort = DEFAULT_UNICAST_PORT;\n}\/\/ReceiverFlowConfiguration\n\n\ndouble ReceiverFlowConfiguration::getCbReceiveProcessTimeout() const\n{\n    return cbReceiveProcessTimeout;\n}\n\nvoid ReceiverFlowConfiguration::setCbReceiveProcessTimeout(double cbReceiveProcessTimeout)\n{\n    this->cbReceiveProcessTimeout = cbReceiveProcessTimeout;\n}\n\n\ndouble ReceiverFlowConfiguration::getCbReceiveAvgProcessTimeout() const\n{\n    return cbReceiveAvgProcessTimeout;\n}\n\nvoid ReceiverFlowConfiguration::setCbReceiveAvgProcessTimeout(double cbReceiveAvgProcessTimeout)\n{\n    this->cbReceiveAvgProcessTimeout = cbReceiveAvgProcessTimeout;\n}\n\nstd::string ReceiverFlowConfiguration::getMulticastAddress() const\n{\n    return multicastAddress;\n}\n\nbool ReceiverFlowConfiguration::isEnableMulticast() const\n{\n    return enableMulticast;\n}\n\nvoid ReceiverFlowConfiguration::setEnableMulticast(bool enableMulticast)\n{\n    this->enableMulticast = enableMulticast;\n}\n\nvoid ReceiverFlowConfiguration::setMulticastAddress(std::string multicastAddress)\n{\n    this->multicastAddress = multicastAddress;\n}\n\nunsigned short ReceiverFlowConfiguration::getUnicastPort() const\n{\n\treturn this->unicastPort;\n}\n\nvoid ReceiverFlowConfiguration::setUnicastPort(\tunsigned short port)\n{\n\tthis->unicastPort = port;\n}\n\nvoid ReceiverFlowConfiguration::setDDSReceiverFlowQoS(char* cfg)\n{\n\tsetStringProfileQoS(cfg, DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE);\n}\/\/setDDSReceiverFlowQoS\n\nvoid ReceiverFlowConfiguration::setDDSReceiverFlowQoS(char* profileName, char* cfg)\n{\n\tsetStringProfileQoS(profileName, cfg, DDSConfiguration::DEFAULT_RECEIVER_FLOW_PROFILE);\n}\/\/setDDSReceiverFlowQoS\n\n\/**************************************************************************************\n * \t\t\tSenderFlowConfiguration\n **************************************************************************************\/\nSenderFlowConfiguration::SenderFlowConfiguration()\n{\n\tprofileQos=DEFAULT_SENDER_FLOW_PROFILE;\n\tsendFrameTimeout = DEFAULT_SENDFRAME_TIMEOUT;\n\tACKsTimeout = DEFAULT_ACKs_TIMEOUT;\n}\n\ndouble SenderFlowConfiguration::getACKsTimeout() const\n{\n    return ACKsTimeout;\n}\n\ndouble SenderFlowConfiguration::getSendFrameTimeout() const\n{\n    return sendFrameTimeout;\n}\n\nvoid SenderFlowConfiguration::setACKsTimeout(double acKsTimeout)\n{\n    ACKsTimeout = acKsTimeout;\n}\n\nvoid SenderFlowConfiguration::setSendFrameTimeout(double frameTimeout)\n{\n    this->sendFrameTimeout = frameTimeout;\n}\n\nvoid SenderFlowConfiguration::setDDSSenderFlowQoS(char* cfg)\n{\n\tsetStringProfileQoS(cfg, DDSConfiguration::DEFAULT_SENDER_FLOW_PROFILE);\n}\/\/setDDSReceiverFlowQoS\n\nvoid SenderFlowConfiguration::setDDSSenderFlowQoS(char* profileName, char* cfg)\n{\n\tsetStringProfileQoS(profileName, cfg, DDSConfiguration::DEFAULT_SENDER_FLOW_PROFILE);\n}\n\n\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream> \n#include <string> \n#include <fstream> \n#include <cstdint>\n\nusing namespace std;\n\ntemplate <class T>\nstruct Node\n{\n\tT data;\n\tNode<T>* left;\n\tNode<T>* right;\n};\n\ntemplate <class T>\nclass BinaryTree\n{\nprivate:\n\tNode<T> *root;\n\tuint16_t CountElements = 0;\npublic:\n\tBinaryTree();\n\t~BinaryTree();\n\tvoid deleteNode(Node<T>* temp);\n\tvoid insert_node(const T&);\n\tvoid print()const;\n\tNode<T>*root_();\n\tNode<T> *find_node(const T&, Node<T>*)const;\n\tvoid output(ostream&, Node<T>*)const;\n\tvoid reading(const std::string&);\n\tvoid writing(const std::string&)const;\n\tbool search_result(const T& value)const;\n\tNode<T>* get_pointer(const T& value, Node<T>* temp)const;\n\tostream& show(std::ostream&, const Node<T>*, unsigned int);\n\tfriend std::ostream& operator<< <> (std::ostream&, BinaryTree<T>&);\n\n};\n\ntemplate<typename T>\nBinaryTree<T>::BinaryTree()\n{\n\troot = nullptr;\n}\n\ntemplate<typename T>\nBinaryTree<T>::~BinaryTree()\n{\n\tdeleteNode(root);\n}\n\ntemplate<typename T>\nNode<T> *BinaryTree<T>::get_pointer(const T& value, Node<T>* temp)const\n{\n\tif (temp == 0 || value == temp->data)\n\t\treturn temp;\n\tif (value > temp->data)\n\t\treturn get_pointer(value, temp->right);\n\telse return get_pointer(value, temp->left);\n}\n\ntemplate<typename T>\nbool BinaryTree<T>::search_result(const T& value)const\n{\n\treturn get_pointer(value, root);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::deleteNode(Node<T>* temp)\n{\n\tif (!temp)\n\t\treturn;\n\tif (temp->left)\n\t{\n\t\tdeleteNode(temp->left);\n\t\ttemp->left = nullptr;\n\t}\n\n\tif (temp->right)\n\t{\n\t\tdeleteNode(temp->right);\n\t\ttemp->right = nullptr;\n\t}\n\tdelete temp;\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::insert_node(const T&x)\n{\n\tif (find_node(x, root_())) return;\n\tNode<T>* MyTree = new Node<T>;\n\tMyTree->data = x;\n\tMyTree->left = MyTree->right = 0;\n\tNode<T>* buff = root;\n\tNode<T>* temp = root;\n\twhile (temp)\n\t{\n\t\tbuff = temp;\n\t\tif (x < temp->data)\n\t\t\ttemp = temp->left;\n\t\telse\n\t\t\ttemp = temp->right;\n\t}\n\tif (!buff)\n\t\troot = MyTree;\n\telse\n\t{\n\t\tif (x < buff->data)\n\t\t\tbuff->left = MyTree;\n\t\telse\n\t\t\tbuff->right = MyTree;\n\t}\n\t++CountElements;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::find_node(const T& value, Node<T>* temp) const\n{\n\tif (temp == 0 || value == temp->data)\n\t\treturn temp;\n\tif (value > temp->data)\n\t\treturn find_node(value, temp->right);\n\telse\n\t\treturn find_node(value, temp->left);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::reading(const std::string& filename)\n{\n\tifstream fin(filename);\n\tif (root != nullptr)\n\t\tdeleteNode(root);\n\n\tint k;\n\tfin >> k;\n\tT temp;\n\tfor (int i = 0; i < k; ++i)\n\t{\n\t\tfin >> temp;\n\t\tinsert_node(temp);\n\t}\n\tfin.close();\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::writing(const std::string& filename)const\n{\n\tofstream file_1(filename);\n\tfile_1 << CountElements << \"\\t\";\n\toutput(file_1, root);\n\tfile_1.close();\n}\n\ntemplate <typename T>\nstd::ostream& show(std::ostream& ost, const Node<T>* temp, unsigned int level)\n{\n\tshow(ost, temp->right, level + 1);\n\tfor (unsigned int i = 0; i < level; i++)\n\t\tost << \"\\t\";\n\tost << temp->data << std::endl;\n\tshow(ost, temp->left, level + 1);\n\treturn ost;\n}\n\ntemplate <typename T>\nostream& operator<<(std::ostream& ost, BinaryTree<T>& temp)\n{\t\n\tshow(ost, temp.root, 0);\n\treturn ost;\n}\n<commit_msg>Update BinaryTree.hpp<commit_after>#include <iostream> \n#include <string> \n#include <fstream> \n#include <cstdint>\n\nusing namespace std;\n\ntemplate <class T>\nstruct Node\n{\n\tT data;\n\tNode<T>* left;\n\tNode<T>* right;\n};\n\ntemplate <class T>\nclass BinaryTree\n{\nprivate:\n\tNode<T> *root;\n\tuint16_t CountElements = 0;\npublic:\n\tBinaryTree();\n\t~BinaryTree();\n\tvoid deleteNode(Node<T>* temp);\n\tvoid insert_node(const T&);\n\tvoid print()const;\n\tNode<T>*root_();\n\tNode<T> *find_node(const T&, Node<T>*)const;\n\tvoid output(ostream&, Node<T>*)const;\n\tvoid reading(const std::string&);\n\tvoid writing(const std::string&)const;\n\tbool search_result(const T& value)const;\n\tNode<T>* get_pointer(const T& value, Node<T>* temp)const;\n\tstd::ostream& show(std::ostream&, const Node<T>*, unsigned int);\n\tfriend std::ostream& operator<< <> (std::ostream&, BinaryTree<T>&);\n\n};\n\ntemplate<typename T>\nBinaryTree<T>::BinaryTree()\n{\n\troot = nullptr;\n}\n\ntemplate<typename T>\nBinaryTree<T>::~BinaryTree()\n{\n\tdeleteNode(root);\n}\n\ntemplate<typename T>\nNode<T> *BinaryTree<T>::get_pointer(const T& value, Node<T>* temp)const\n{\n\tif (temp == 0 || value == temp->data)\n\t\treturn temp;\n\tif (value > temp->data)\n\t\treturn get_pointer(value, temp->right);\n\telse return get_pointer(value, temp->left);\n}\n\ntemplate<typename T>\nbool BinaryTree<T>::search_result(const T& value)const\n{\n\treturn get_pointer(value, root);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::deleteNode(Node<T>* temp)\n{\n\tif (!temp)\n\t\treturn;\n\tif (temp->left)\n\t{\n\t\tdeleteNode(temp->left);\n\t\ttemp->left = nullptr;\n\t}\n\n\tif (temp->right)\n\t{\n\t\tdeleteNode(temp->right);\n\t\ttemp->right = nullptr;\n\t}\n\tdelete temp;\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::insert_node(const T&x)\n{\n\tif (find_node(x, root_())) return;\n\tNode<T>* MyTree = new Node<T>;\n\tMyTree->data = x;\n\tMyTree->left = MyTree->right = 0;\n\tNode<T>* buff = root;\n\tNode<T>* temp = root;\n\twhile (temp)\n\t{\n\t\tbuff = temp;\n\t\tif (x < temp->data)\n\t\t\ttemp = temp->left;\n\t\telse\n\t\t\ttemp = temp->right;\n\t}\n\tif (!buff)\n\t\troot = MyTree;\n\telse\n\t{\n\t\tif (x < buff->data)\n\t\t\tbuff->left = MyTree;\n\t\telse\n\t\t\tbuff->right = MyTree;\n\t}\n\t++CountElements;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::find_node(const T& value, Node<T>* temp) const\n{\n\tif (temp == 0 || value == temp->data)\n\t\treturn temp;\n\tif (value > temp->data)\n\t\treturn find_node(value, temp->right);\n\telse\n\t\treturn find_node(value, temp->left);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::reading(const std::string& filename)\n{\n\tifstream fin(filename);\n\tif (root != nullptr)\n\t\tdeleteNode(root);\n\n\tint k;\n\tfin >> k;\n\tT temp;\n\tfor (int i = 0; i < k; ++i)\n\t{\n\t\tfin >> temp;\n\t\tinsert_node(temp);\n\t}\n\tfin.close();\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::writing(const std::string& filename)const\n{\n\tofstream file_1(filename);\n\tfile_1 << CountElements << \"\\t\";\n\toutput(file_1, root);\n\tfile_1.close();\n}\n\ntemplate <typename T>\nstd::ostream& show(std::ostream& ost, const Node<T>* temp, unsigned int level)\n{\n\tshow(ost, temp->right, level + 1);\n\tfor (unsigned int i = 0; i < level; i++)\n\t\tost << \"\\t\";\n\tost << temp->data << std::endl;\n\tshow(ost, temp->left, level + 1);\n\treturn ost;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& ost, BinaryTree<T>& temp)\n{\t\n\tshow(ost, temp.root, 0);\n\treturn ost;\n}\n<|endoftext|>"}
{"text":"<commit_before>GenerateDocumentation01() {\n    \/\/This macro auto-generates documentation (twiki-style)\n    \/\/based on all OADBs currently deployed in the AliPhysics\n    \/\/directory specified here:\n\n    TString lPathToOADBs = \"$ALICE_PHYSICS\/..\/src\/OADB\/COMMON\/MULTIPLICITY\/data\/\";\n    cout<<\"Expanding path name...\"<<endl;\n    gSystem->ExpandPathName( lPathToOADBs );\n    cout<< \"Expanded to: \"<<lPathToOADBs.Data()<<endl;\n\n    \/\/Start: determine list of available OADBs\n    TSystemDirectory dir(lPathToOADBs.Data(), lPathToOADBs.Data());\n    TList *files = dir.GetListOfFiles();\n\n    \/\/sorting...\n    files->Sort();\n\n    \/\/Number of automatically found OADB files\n    Long_t lNOADBs = 0;\n\n    \/\/Output text file\n    TString lOutputDoc = \"doc.txt\";\n    ofstream lDocs;\n    lDocs.open ( lOutputDoc.Data() );\n\n    if (files) {\n        TSystemFile *file;\n        TString fname;\n        TIter next(files);\n        while ((file=(TSystemFile*)next())) {\n            fname = file->GetName();\n            TString lProdName = fname;\n            TString lCalibRuns = \"\";\n            TString lTime = \"\";\n            TString lEvSels = \"\";\n            TString lEstims = \"\"; \n\t    TString lEstimPerRun = \"\"; \n            lProdName.ReplaceAll(\"OADB-\",\"\");\n            lProdName.ReplaceAll(\".root\",\"\");\n            if (!file->IsDirectory() && fname.EndsWith(\".root\")) {\n                cout<<\"======================================================\"<<endl;\n                cout<<\" OADB entry for period [\"<<lProdName.Data() <<\"] found!\"<<endl;\n                cout<<\" -> Opening OADB and checking for information ... \"<<endl;\n\n                \/\/Mod time\n                Long_t id,size,flags,mt;\n                gSystem->GetPathInfo(Form(\"%s%s\",lPathToOADBs.Data(),fname.Data()),&id,&size,&flags,&mt);\n                TTimeStamp st(mt);\n                cout<<\"Date : \"<<st.GetDate()<<endl;\n                lTime.Append(Form(\"%i\",st.GetDate()));\n\n                TFile * f = new TFile (Form(\"%s%s\",lPathToOADBs.Data(),fname.Data()));\n                AliOADBContainer * oadbContMS = (AliOADBContainer*) f->Get(\"MultSel\");\n                cout<<\" ---> contains this many runs: \"<<oadbContMS->GetNumberOfEntries()<<endl;\n                AliOADBMultSelection * oadbMultSelection = 0x0;\n                for(Long_t ir=0; ir<oadbContMS->GetNumberOfEntries(); ir++) {\n\n                    \/\/Acquire the MultSelection Object for this run and get the specific\n                    \/\/calibration information (Anchor point and anchor percentile) for each estimator\n                    oadbMultSelection = (AliOADBMultSelection* )oadbContMS->GetObjectByIndex(ir);\n\n                    \/\/Get estimator info\n                    lCalibRuns.Append(\"<element title=\\\"\");\n                    for(Int_t iEst = 0; iEst<oadbMultSelection->GetMultSelection()->GetNEstimators(); iEst++) {\n                        TString def     = oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetName();\n                        Float_t lAP     = oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetAnchorPoint();\n                        Float_t lAPPerc = oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetAnchorPercentile();\n\n                        lCalibRuns.Append(Form(\"%s\",def.Data())); \/\/Name\n\t\t\tif(oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetUseAnchor()) { \n                        lCalibRuns.Append(Form(\": Raw Val %.3f, Percentile: %.3f\",lAP,lAPPerc)); \/\/Characteristics\n\t\t\t} else { \n\t\t\t  lCalibRuns.Append(\": Unanchored\"); \/\/Characteristics\n\t\t\t}\n                        if ( iEst != oadbMultSelection->GetMultSelection()->GetNEstimators()-1 )\n                            lCalibRuns.Append(\"&#10;\"); \/\/Name\n                    }\n                    lCalibRuns.Append(Form(\"\\\"> %i<\/element>\",oadbContMS->LowerLimit(ir)));\n                    if( ir != oadbContMS->GetNumberOfEntries()-1 ) lCalibRuns.Append(\", \");\n                }\n                cout<<\" ---> Detected calibrated runs: \"<<endl;\n                cout<<lCalibRuns.Data()<<endl;\n                cout<<\" ---> Acquiring example object by index... \"<<endl;\n                oadbMultSelection = (AliOADBMultSelection* )oadbContMS->GetObjectByIndex(0);\n                cout<<\" -> Adding: Event selection information ...\"<<endl;\n                if( oadbMultSelection ) {\n                    lEvSels.Append(Form(\"Vertex position &#124;z&#124; < %.1f cm\",oadbMultSelection->GetEventCuts()->GetVzCut() ) );\n                    if( oadbMultSelection->GetEventCuts()->GetTriggerCut() ) lEvSels.Append(\" + Physics selected (Minimum Bias: kMB\/kINT7)\");\n                    if( oadbMultSelection->GetEventCuts()->GetINELgtZEROCut() ) lEvSels.Append(\" + INEL&gt;0 with SPD tracklets\");\n                    if( oadbMultSelection->GetEventCuts()->GetTrackletsVsClustersCut() ) lEvSels.Append(\" + tracklets versus clusters cut\");\n                    if( oadbMultSelection->GetEventCuts()->GetRejectPileupInMultBinsCut() ) lEvSels.Append(\" + Pileup in Mult bins rejection\");\n                    if( oadbMultSelection->GetEventCuts()->GetVertexConsistencyCut() ) lEvSels.Append(\" + SPD and Track Vertex Consistency OK\");\n                    if( oadbMultSelection->GetEventCuts()->GetNonZeroNContribs() ) lEvSels.Append(\" + At least 1 contributor to PV\");\n                    oadbMultSelection->GetMultSelection()->PrintInfo();\n                    for(Int_t iEst = 0; iEst<oadbMultSelection->GetMultSelection()->GetNEstimators(); iEst++) {\n                        \/\/syntax = <element title=\"test test test mom mom mom\"> %ICONURL{help}% <\/div>\n                        TString def = oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetDefinition();\n                        cout<<\"Def = \"<<def.Data()<<endl;\n\t\t\t\/\/Replace &gt; and &lt;s for html code\n\t\t\tdef.ReplaceAll(\"<\",\"&lt;\");\n\t\t\tdef.ReplaceAll(\">\",\"&gt;\");\n                        lEstims.Append(\"<element title=\\\"\");\n                        lEstims.Append(Form(\"%s\",def.Data()));\n                        lEstims.Append(Form(\"\\\"> !%s<\/element>\",oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetName()));\n                        if(iEst!=oadbMultSelection->GetMultSelection()->GetNEstimators()-1) lEstims.Append(\", \");\n                    }\n                }\n                cout<<\" ---> Event Selection: \"<<lEvSels.Data()<<endl;\n                \/\/Appending event selection as a tooltip next to the dataset name\n                lProdName.Prepend(\"*\");\n                lProdName.Append(\"*\");\n                lProdName.Append(Form(\" <element title=\\\"Event Selection: %s\\\"\",lEvSels.Data() ));\n                lProdName.Append(\"> %ICONURL{help}% <\/element>\");\n\n                cout<<\" ---> Estimator string: \"<<lEstims.Data()<<endl;\n                cout<<\" -> Adding: estimator definition information ...\"<<endl;\n                cout<<\"======================================================\"<<endl;\n                \/\/Print this in this format:\n                \/\/| LHCxxx   |   RUNLIST   |   xx\/xx\/xxx   |   ESTIMATORS   |\n                lDocs<<\"| \"<<lProdName.Data()<<\" | \"<<lCalibRuns.Data()<<\" |   \"<<lTime.Data()<<\"   | \"<<lEstims.Data()<<\" |\"<<endl;\n\n            }\n        }\n    }\n\n}\n<commit_msg>Updating script to generate AliMultSelectionCalibStatus Twiki page (for bookkeeping purposes)<commit_after>GenerateDocumentation01() {\n    \/\/This macro auto-generates documentation (twiki-style)\n    \/\/based on all OADBs currently deployed in the AliPhysics\n    \/\/directory specified here:\n\n    TString lPathToOADBs = \"$HOME\/alice\/ali-master\/AliPhysics\/OADB\/COMMON\/MULTIPLICITY\/data\/\";\n    cout<<\"Expanding path name...\"<<endl;\n    gSystem->ExpandPathName( lPathToOADBs );\n    cout<< \"Expanded to: \"<<lPathToOADBs.Data()<<endl;\n\n    \/\/Start: determine list of available OADBs\n    TSystemDirectory dir(lPathToOADBs.Data(), lPathToOADBs.Data());\n    TList *files = dir.GetListOfFiles();\n\n    \/\/sorting...\n    files->Sort();\n\n    \/\/Number of automatically found OADB files\n    Long_t lNOADBs = 0;\n\n    \/\/Output text file\n    TString lOutputDoc = \"doc.txt\";\n    ofstream lDocs;\n    lDocs.open ( lOutputDoc.Data() );\n\n    if (files) {\n        TSystemFile *file;\n        TString fname;\n        TIter next(files);\n        while ((file=(TSystemFile*)next())) {\n            fname = file->GetName();\n            TString lProdName = fname;\n            TString lCalibRuns = \"\";\n            TString lTime = \"\";\n            TString lEvSels = \"\";\n            TString lEstims = \"\"; \n\t    TString lEstimPerRun = \"\"; \n            lProdName.ReplaceAll(\"OADB-\",\"\");\n            lProdName.ReplaceAll(\".root\",\"\");\n            if (!file->IsDirectory() && fname.EndsWith(\".root\")) {\n                cout<<\"======================================================\"<<endl;\n                cout<<\" OADB entry for period [\"<<lProdName.Data() <<\"] found!\"<<endl;\n                cout<<\" -> Opening OADB and checking for information ... \"<<endl;\n\n                \/\/Mod time\n                \/\/Long_t id,size,flags,mt;\n                \/\/gSystem->GetPathInfo(Form(\"%s%s\",lPathToOADBs.Data(),fname.Data()),&id,&size,&flags,&mt);\n                \/\/TTimeStamp st(mt);\n                \/\/cout<<\"Date : \"<<st.GetDate()<<endl;\n                \/\/lTime.Append(Form(\"%i\",st.GetDate()));\n                \n                \/\/Modification time, as per git command:\n                \/\/ git log -1 --format=\"%ai\" -- OADB-blablabla.root\n                lTime = gSystem->GetFromPipe(Form(\"cd %s; git log -1 --format=\\\"%%ai\\\" -- OADB-%s.root\", lPathToOADBs.Data(), lProdName.Data()));\n            \n                cout<<\"======================================================\"<<endl;\n                cout<<lTime.Data()<<endl;\n                cout<<\"======================================================\"<<endl;\n                \n                TFile * f = new TFile (Form(\"%s%s\",lPathToOADBs.Data(),fname.Data()));\n                AliOADBContainer * oadbContMS = (AliOADBContainer*) f->Get(\"MultSel\");\n                cout<<\" ---> contains this many runs: \"<<oadbContMS->GetNumberOfEntries()<<endl;\n                AliOADBMultSelection * oadbMultSelection = 0x0;\n                for(Long_t ir=0; ir<oadbContMS->GetNumberOfEntries(); ir++) {\n\n                    \/\/Acquire the MultSelection Object for this run and get the specific\n                    \/\/calibration information (Anchor point and anchor percentile) for each estimator\n                    oadbMultSelection = (AliOADBMultSelection* )oadbContMS->GetObjectByIndex(ir);\n\n                    \/\/Get estimator info\n                    lCalibRuns.Append(\"<element title=\\\"\");\n                    for(Int_t iEst = 0; iEst<oadbMultSelection->GetMultSelection()->GetNEstimators(); iEst++) {\n                        TString def     = oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetName();\n                        Float_t lAP     = oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetAnchorPoint();\n                        Float_t lAPPerc = oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetAnchorPercentile();\n\n                        lCalibRuns.Append(Form(\"%s\",def.Data())); \/\/Name\n\t\t\tif(oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetUseAnchor()) { \n                        lCalibRuns.Append(Form(\": Raw Val %.3f, Percentile: %.3f\",lAP,lAPPerc)); \/\/Characteristics\n\t\t\t} else { \n\t\t\t  lCalibRuns.Append(\": Unanchored\"); \/\/Characteristics\n\t\t\t}\n                        if ( iEst != oadbMultSelection->GetMultSelection()->GetNEstimators()-1 )\n                            lCalibRuns.Append(\"&#10;\"); \/\/Name\n                    }\n                    lCalibRuns.Append(Form(\"\\\"> %i<\/element>\",oadbContMS->LowerLimit(ir)));\n                    if( ir != oadbContMS->GetNumberOfEntries()-1 ) lCalibRuns.Append(\", \");\n                }\n                cout<<\" ---> Detected calibrated runs: \"<<endl;\n                cout<<lCalibRuns.Data()<<endl;\n                cout<<\" ---> Acquiring example object by index... \"<<endl;\n                oadbMultSelection = (AliOADBMultSelection* )oadbContMS->GetObjectByIndex(0);\n                cout<<\" -> Adding: Event selection information ...\"<<endl;\n                if( oadbMultSelection ) {\n                    lEvSels.Append(Form(\"Vertex position &#124;z&#124; < %.1f cm\",oadbMultSelection->GetEventCuts()->GetVzCut() ) );\n                    if( oadbMultSelection->GetEventCuts()->GetTriggerCut() ) lEvSels.Append(\" + Physics selected (Minimum Bias: kMB\/kINT7)\");\n                    if( oadbMultSelection->GetEventCuts()->GetINELgtZEROCut() ) lEvSels.Append(\" + INEL&gt;0 with SPD tracklets\");\n                    if( oadbMultSelection->GetEventCuts()->GetTrackletsVsClustersCut() ) lEvSels.Append(\" + tracklets versus clusters cut\");\n                    if( oadbMultSelection->GetEventCuts()->GetRejectPileupInMultBinsCut() ) lEvSels.Append(\" + Pileup in Mult bins rejection\");\n                    if( oadbMultSelection->GetEventCuts()->GetVertexConsistencyCut() ) lEvSels.Append(\" + SPD and Track Vertex Consistency OK\");\n                    if( oadbMultSelection->GetEventCuts()->GetNonZeroNContribs() ) lEvSels.Append(\" + At least 1 contributor to PV\");\n                    oadbMultSelection->GetMultSelection()->PrintInfo();\n                    for(Int_t iEst = 0; iEst<oadbMultSelection->GetMultSelection()->GetNEstimators(); iEst++) {\n                        \/\/syntax = <element title=\"test test test mom mom mom\"> %ICONURL{help}% <\/div>\n                        TString def = oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetDefinition();\n                        cout<<\"Def = \"<<def.Data()<<endl;\n\t\t\t\/\/Replace &gt; and &lt;s for html code\n\t\t\tdef.ReplaceAll(\"<\",\"&lt;\");\n\t\t\tdef.ReplaceAll(\">\",\"&gt;\");\n                        lEstims.Append(\"<element title=\\\"\");\n                        lEstims.Append(Form(\"%s\",def.Data()));\n                        lEstims.Append(Form(\"\\\"> !%s<\/element>\",oadbMultSelection->GetMultSelection()->GetEstimator(iEst)->GetName()));\n                        if(iEst!=oadbMultSelection->GetMultSelection()->GetNEstimators()-1) lEstims.Append(\", \");\n                    }\n                }\n                cout<<\" ---> Event Selection: \"<<lEvSels.Data()<<endl;\n                \/\/Appending event selection as a tooltip next to the dataset name\n                lProdName.Prepend(\"*\");\n                lProdName.Append(\"*\");\n                lProdName.Append(Form(\" <element title=\\\"Event Selection: %s\\\"\",lEvSels.Data() ));\n                lProdName.Append(\"> %ICONURL{help}% <\/element>\");\n\n                cout<<\" ---> Estimator string: \"<<lEstims.Data()<<endl;\n                cout<<\" -> Adding: estimator definition information ...\"<<endl;\n                cout<<\"======================================================\"<<endl;\n                \/\/Print this in this format:\n                \/\/| LHCxxx   |   RUNLIST   |   xx\/xx\/xxx   |   ESTIMATORS   |\n                lDocs<<\"| \"<<lProdName.Data()<<\" | \"<<lCalibRuns.Data()<<\" |   \"<<lTime.Data()<<\"   | \"<<lEstims.Data()<<\" |\"<<endl;\n\n            }\n        }\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream> \n#include <string> \n#include <fstream> \n#include <cstdint>\n\nusing namespace std;\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream&, const BinaryTree<T>&);\n\ntemplate <class T>\nstruct Node\n{\n\tT data;\n\tNode<T>* left;\n\tNode<T>* right;\n};\n\ntemplate <class T>\nclass BinaryTree\n{\nprivate:\n\tNode<T> *root;\n\tuint16_t CountElements = 0;\npublic:\n\tBinaryTree();\n\t~BinaryTree();\n\tvoid deleteNode(Node<T>* temp);\n\tvoid insert_node(const T&);\n\tvoid print()const;\n\tNode<T>*root_();\n\tNode<T> *find_node(const T&, Node<T>*)const;\n\tvoid output(ostream&, Node<T>*)const;\n\tvoid reading(const std::string&);\n\tvoid writing(const std::string&)const;\n\tbool search_result(const T& value)const;\n\tNode<T>* get_pointer(const T& value, Node<T>* temp)const;\n\tostream& show(std::ostream&, const Node<T>*, unsigned int);\n\tfriend std::ostream& operator<< <> (std::ostream&, BinaryTree<T>*);\n\n};\n\ntemplate<typename T>\nBinaryTree<T>::BinaryTree()\n{\n\troot = nullptr;\n}\n\ntemplate<typename T>\nBinaryTree<T>::~BinaryTree()\n{\n\tdeleteNode(root);\n}\n\ntemplate<typename T>\nNode<T> *BinaryTree<T>::get_pointer(const T& value, Node<T>* temp)const\n{\n\tif (temp == 0 || value == temp->data)\n\t\treturn temp;\n\tif (value > temp->data)\n\t\treturn get_pointer(value, temp->right);\n\telse return get_pointer(value, temp->left);\n}\n\ntemplate<typename T>\nbool BinaryTree<T>::search_result(const T& value)const\n{\n\treturn get_pointer(value, root);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::deleteNode(Node<T>* temp)\n{\n\tif (!temp)\n\t\treturn;\n\tif (temp->left)\n\t{\n\t\tdeleteNode(temp->left);\n\t\ttemp->left = nullptr;\n\t}\n\n\tif (temp->right)\n\t{\n\t\tdeleteNode(temp->right);\n\t\ttemp->right = nullptr;\n\t}\n\tdelete temp;\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::insert_node(const T&x)\n{\n\tif (find_node(x, root_())) return;\n\tNode<T>* MyTree = new Node<T>;\n\tMyTree->data = x;\n\tMyTree->left = MyTree->right = 0;\n\tNode<T>* buff = root;\n\tNode<T>* temp = root;\n\twhile (temp)\n\t{\n\t\tbuff = temp;\n\t\tif (x < temp->data)\n\t\t\ttemp = temp->left;\n\t\telse\n\t\t\ttemp = temp->right;\n\t}\n\tif (!buff)\n\t\troot = MyTree;\n\telse\n\t{\n\t\tif (x < buff->data)\n\t\t\tbuff->left = MyTree;\n\t\telse\n\t\t\tbuff->right = MyTree;\n\t}\n\t++CountElements;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::find_node(const T& value, Node<T>* temp) const\n{\n\tif (temp == 0 || value == temp->data)\n\t\treturn temp;\n\tif (value > temp->data)\n\t\treturn find_node(value, temp->right);\n\telse\n\t\treturn find_node(value, temp->left);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::reading(const std::string& filename)\n{\n\tifstream fin(filename);\n\tif (root != nullptr)\n\t\tdeleteNode(root);\n\n\tint k;\n\tfin >> k;\n\tT temp;\n\tfor (int i = 0; i < k; ++i)\n\t{\n\t\tfin >> temp;\n\t\tinsert_node(temp);\n\t}\n\tfin.close();\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::writing(const std::string& filename)const\n{\n\tofstream file_1(filename);\n\tfile_1 << CountElements << \"\\t\";\n\toutput(file_1, root);\n\tfile_1.close();\n}\n\ntemplate <typename T>\nstd::ostream& show(std::ostream& ost, const Node<T>* temp, unsigned int level)\n{\n\tshow(ost, temp->right, level + 1);\n\tfor (unsigned int i = 0; i < level; i++)\n\t\tost << \"\\t\";\n\tost << temp->data << std::endl;\n\tshow(ost, temp->left, level + 1);\n\treturn ost;\n}\n\ntemplate <typename T>\nostream& operator<<(std::ostream& ost, BinaryTree<T>& temp)\n{\t\n\tshow(ost, temp.root, 0);\n\treturn ost;\n}\n<commit_msg>Update BinaryTree.hpp<commit_after>#include <iostream> \n#include <string> \n#include <fstream> \n#include <cstdint>\n\nusing namespace std;\n\ntemplate <typename T>\nstd::ostream& operator<< <> (std::ostream&, BinaryTree<T>&);\n\ntemplate <class T>\nstruct Node\n{\n\tT data;\n\tNode<T>* left;\n\tNode<T>* right;\n};\n\ntemplate <class T>\nclass BinaryTree\n{\nprivate:\n\tNode<T> *root;\n\tuint16_t CountElements = 0;\npublic:\n\tBinaryTree();\n\t~BinaryTree();\n\tvoid deleteNode(Node<T>* temp);\n\tvoid insert_node(const T&);\n\tvoid print()const;\n\tNode<T>*root_();\n\tNode<T> *find_node(const T&, Node<T>*)const;\n\tvoid output(ostream&, Node<T>*)const;\n\tvoid reading(const std::string&);\n\tvoid writing(const std::string&)const;\n\tbool search_result(const T& value)const;\n\tNode<T>* get_pointer(const T& value, Node<T>* temp)const;\n\tostream& show(std::ostream&, const Node<T>*, unsigned int);\n\tfriend std::ostream& operator<< <> (std::ostream&, BinaryTree<T>*);\n\n};\n\ntemplate<typename T>\nBinaryTree<T>::BinaryTree()\n{\n\troot = nullptr;\n}\n\ntemplate<typename T>\nBinaryTree<T>::~BinaryTree()\n{\n\tdeleteNode(root);\n}\n\ntemplate<typename T>\nNode<T> *BinaryTree<T>::get_pointer(const T& value, Node<T>* temp)const\n{\n\tif (temp == 0 || value == temp->data)\n\t\treturn temp;\n\tif (value > temp->data)\n\t\treturn get_pointer(value, temp->right);\n\telse return get_pointer(value, temp->left);\n}\n\ntemplate<typename T>\nbool BinaryTree<T>::search_result(const T& value)const\n{\n\treturn get_pointer(value, root);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::deleteNode(Node<T>* temp)\n{\n\tif (!temp)\n\t\treturn;\n\tif (temp->left)\n\t{\n\t\tdeleteNode(temp->left);\n\t\ttemp->left = nullptr;\n\t}\n\n\tif (temp->right)\n\t{\n\t\tdeleteNode(temp->right);\n\t\ttemp->right = nullptr;\n\t}\n\tdelete temp;\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::insert_node(const T&x)\n{\n\tif (find_node(x, root_())) return;\n\tNode<T>* MyTree = new Node<T>;\n\tMyTree->data = x;\n\tMyTree->left = MyTree->right = 0;\n\tNode<T>* buff = root;\n\tNode<T>* temp = root;\n\twhile (temp)\n\t{\n\t\tbuff = temp;\n\t\tif (x < temp->data)\n\t\t\ttemp = temp->left;\n\t\telse\n\t\t\ttemp = temp->right;\n\t}\n\tif (!buff)\n\t\troot = MyTree;\n\telse\n\t{\n\t\tif (x < buff->data)\n\t\t\tbuff->left = MyTree;\n\t\telse\n\t\t\tbuff->right = MyTree;\n\t}\n\t++CountElements;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::find_node(const T& value, Node<T>* temp) const\n{\n\tif (temp == 0 || value == temp->data)\n\t\treturn temp;\n\tif (value > temp->data)\n\t\treturn find_node(value, temp->right);\n\telse\n\t\treturn find_node(value, temp->left);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::reading(const std::string& filename)\n{\n\tifstream fin(filename);\n\tif (root != nullptr)\n\t\tdeleteNode(root);\n\n\tint k;\n\tfin >> k;\n\tT temp;\n\tfor (int i = 0; i < k; ++i)\n\t{\n\t\tfin >> temp;\n\t\tinsert_node(temp);\n\t}\n\tfin.close();\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::writing(const std::string& filename)const\n{\n\tofstream file_1(filename);\n\tfile_1 << CountElements << \"\\t\";\n\toutput(file_1, root);\n\tfile_1.close();\n}\n\ntemplate <typename T>\nstd::ostream& show(std::ostream& ost, const Node<T>* temp, unsigned int level)\n{\n\tshow(ost, temp->right, level + 1);\n\tfor (unsigned int i = 0; i < level; i++)\n\t\tost << \"\\t\";\n\tost << temp->data << std::endl;\n\tshow(ost, temp->left, level + 1);\n\treturn ost;\n}\n\ntemplate <typename T>\nostream& operator<<(std::ostream& ost, BinaryTree<T>& temp)\n{\t\n\tshow(ost, temp.root, 0);\n\treturn ost;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef slic3r_SupportMaterial_hpp_\n#define slic3r_SupportMaterial_hpp_\n\n#include \"Flow.hpp\"\n\nnamespace Slic3r {\n\nclass PrintObject;\nclass PrintConfig;\nclass PrintObjectConfig;\n\n\/\/ how much we extend support around the actual contact area\n#define SUPPORT_MATERIAL_MARGIN 1.5\t\n\n\/\/ Instantiated by Slic3r::Print::Object->_support_material()\nclass PrintSupportMaterial\n{\npublic:\n\tenum SupporLayerType {\n\t\tsltUnknown = 0,\n\t\tsltRaft,\n\t\tstlFirstLayer,\n\t\tsltBottomContact,\n\t\tsltBottomInterface,\n\t\tsltBase,\n\t\tsltTopInterface,\n\t\tsltTopContact,\n\t\t\/\/ Some undecided type yet. It will turn into stlBase first, then it may turn into stlBottomInterface or stlTopInterface.\n\t\tstlIntermediate,\n\t};\n\n\tclass MyLayer\n\t{\n\tpublic:\n\t\tMyLayer() :\n\t\t\tlayer_type(sltUnknown),\n\t\t\tprint_z(0.),\n\t\t\tbottom_z(0.),\n\t\t\theight(0.),\n\t\t\tidx_object_layer_above(size_t(-1)),\n\t\t\tidx_object_layer_below(size_t(-1)),\n\t\t\tbridging(false)\n\t\t\t{}\n\n\t\t~MyLayer() \n\t\t{\n\t\t\tdelete aux_polygons;\n\t\t\taux_polygons = NULL;\n\t\t}\n\n\t\tbool operator==(const MyLayer &layer2) const {\n\t\t\treturn print_z == layer2.print_z && height == layer2.height && bridging == layer2.bridging;\n\t\t}\n\n\t\tbool operator<(const MyLayer &layer2) const {\n\t\t\tif (print_z < layer2.print_z) {\n\t\t\t\treturn true;\n\t\t\t} else if (print_z == layer2.print_z) {\n\t\t\t \tif (height > layer2.height)\n\t\t\t \t\treturn true;\n\t\t\t \telse if (height == layer2.height) {\n\t\t\t \t \treturn bridging < layer2.bridging;\n\t\t\t \t} else\n\t\t\t \t\treturn false;\n\t\t\t} else\n\t\t\t\treturn false;\n\t\t}\n\n\t\tSupporLayerType layer_type;\n\t\t\/\/ Z used for printing in unscaled coordinates\n\t\tcoordf_t print_z;\n\t\t\/\/ Bottom height of this layer. For soluble layers, bottom_z + height = print_z,\n\t\t\/\/ otherwise bottom_z + gap + height = print_z.\n\t\tcoordf_t bottom_z;\n\t\t\/\/ layer height in unscaled coordinates\n    \tcoordf_t height;\n    \t\/\/ Index of a PrintObject layer_id supported by this layer. This will be set for top contact layers.\n    \t\/\/ If this is not a contact layer, it will be set to size_t(-1).\n    \tsize_t \t idx_object_layer_above;\n    \t\/\/ Index of a PrintObject layer_id, which supports this layer. This will be set for bottom contact layers.\n    \t\/\/ If this is not a contact layer, it will be set to size_t(-1).\n    \tsize_t \t idx_object_layer_below;\n    \t\/\/ Use a bridging flow when printing this support layer.\n    \tbool \t bridging;\n\n    \t\/\/ Polygons to be filled by the support pattern.\n    \tPolygons polygons;\n    \t\/\/ Currently for the contact layers only: Overhangs are stored here.\n    \tPolygons *aux_polygons;\n\t};\n\n\tstruct LayerExtreme\n\t{\n\t\tLayerExtreme(MyLayer *alayer, bool ais_top) : layer(alayer), is_top(ais_top) {}\n\t\tMyLayer \t*layer;\n\t\t\/\/ top or bottom extreme\n\t\tbool   \t\t is_top;\n\n\t\tcoordf_t\tz() const { return is_top ? layer->print_z : layer->print_z - layer->height; }\n\n\t\tbool operator<(const LayerExtreme &other) const { return z() < other.z(); }\n\t};\n\n\tstruct LayerPrintZ_Hash {\n\t\tsize_t operator()(const MyLayer &layer) const { \n\t\t\treturn std::hash<double>()(layer.print_z)^std::hash<double>()(layer.height)^size_t(layer.bridging);\n\t\t}\n\t};\n\n\ttypedef std::vector<MyLayer*> \t\t\t\tMyLayersPtr;\n\ttypedef std::deque<MyLayer> \t\t\t\tMyLayerStorage;\n\npublic:\n\tPrintSupportMaterial(\n\t\tconst PrintConfig \t\t*print_config,\n\t\tconst PrintObjectConfig\t*object_config,\n\t\tconst Flow \t\t\t \t&flow,\n\t\tconst Flow \t\t\t \t&first_layer_flow,\n\t\tconst Flow \t\t\t \t&interface_flow,\n\t\tbool \t\t\t \t \t soluble_interface) :\n\t\tm_print_config(print_config),\n\t\tm_object_config(object_config),\n\t\tm_flow(flow),\n\t\tm_first_layer_flow(first_layer_flow),\n\t\tm_interface_flow(interface_flow),\n\t\tm_soluble_interface(soluble_interface),\n\t\tm_support_layer_height_max(0.),\n\t\tm_support_interface_layer_height_max(0.)\n\t{}\n\n\tPrintSupportMaterial(\n\t\tPrintConfig \t\t*print_config,\n\t\tPrintObjectConfig\t*object_config,\n\t\tFlow \t\t\t \t*flow,\n\t\tFlow \t\t\t \t*first_layer_flow,\n\t\tFlow \t\t\t \t*interface_flow,\n\t\tbool \t\t\t \t soluble_interface) :\n\t\tm_print_config(print_config),\n\t\tm_object_config(object_config),\n\t\tm_flow(*flow),\n\t\tm_first_layer_flow(*first_layer_flow),\n\t\tm_interface_flow(*interface_flow),\n\t\tm_soluble_interface(soluble_interface),\n\t\tm_support_layer_height_max(0.),\n\t\tm_support_interface_layer_height_max(0.)\n\t{}\n\n\t\/\/ Generate support material for the object.\n\t\/\/ New support layers will be added to the object,\n\t\/\/ with extrusion paths and islands filled in for each support layer.\n\tvoid generate(PrintObject &object);\n\nprivate:\n\t\/\/ Generate top contact layers supporting overhangs.\n\t\/\/ For a soluble interface material synchronize the layer heights with the object, otherwise leave the layer height undefined.\n\t\/\/ If supports over bed surface only are requested, don't generate contact layers over an object.\n\tMyLayersPtr top_contact_layers(const PrintObject &object, MyLayerStorage &layer_storage) const;\n\n\t\/\/ Generate bottom contact layers supporting the top contact layers.\n\t\/\/ For a soluble interface material synchronize the layer heights with the object, \n\t\/\/ otherwise set the layer height to a bridging flow of a support interface nozzle.\n\tMyLayersPtr bottom_contact_layers(const PrintObject &object, const MyLayersPtr &top_contacts, MyLayerStorage &layer_storage) const;\n\n\t\/\/ Trim the top_contacts layers with the bottom_contacts layers if they overlap, so there would not be enough vertical space for both of them.\n\tvoid trim_top_contacts_by_bottom_contacts(const PrintObject &object, const MyLayersPtr &bottom_contacts, MyLayersPtr &top_contacts) const;\n\n\t\/\/ Generate raft layers and the intermediate support layers between the bottom contact and top contact surfaces.\n\tMyLayersPtr raft_and_intermediate_support_layers(\n\t    const PrintObject   &object,\n\t    const MyLayersPtr   &bottom_contacts,\n\t    const MyLayersPtr   &top_contacts,\n\t    MyLayerStorage\t \t&layer_storage,\n\t    const coordf_t       max_object_layer_height) const;\n\n\tvoid generate_base_layers(\n\t    const PrintObject   &object,\n\t    const MyLayersPtr   &bottom_contacts,\n\t    const MyLayersPtr   &top_contacts,\n\t    MyLayersPtr         &intermediate_layers) const;\n\n\tMyLayersPtr generate_interface_layers(\n\t    const PrintObject   &object,\n\t    const MyLayersPtr   &bottom_contacts,\n\t    const MyLayersPtr   &top_contacts,\n\t    MyLayersPtr         &intermediate_layers,\n\t    MyLayerStorage      &layer_storage) const;\n\n\/*\n\tvoid generate_pillars_shape();\n\tvoid clip_with_shape();\n*\/\n\n\t\/\/ Produce the actual G-code.\n\tvoid generate_toolpaths(\n        const PrintObject   &object,\n        const MyLayersPtr   &bottom_contacts,\n        const MyLayersPtr   &top_contacts,\n        const MyLayersPtr   &intermediate_layers,\n        const MyLayersPtr   &interface_layers) const;\n\n\tconst PrintConfig \t\t*m_print_config;\n\tconst PrintObjectConfig *m_object_config;\n\tFlow \t\t\t \t m_flow;\n\tFlow \t\t\t \t m_first_layer_flow;\n\tFlow \t\t\t \t m_interface_flow;\n\tbool \t\t\t \t m_soluble_interface;\n\n\tcoordf_t\t\t \t m_support_layer_height_max;\n\tcoordf_t\t\t \t m_support_interface_layer_height_max;\n\tbool \t\t\t\t m_synchronize_support_layers_with_object;\n};\n\n} \/\/ namespace Slic3r\n\n#endif \/* slic3r_SupportMaterial_hpp_ *\/\n<commit_msg>Disable C++11 hash feature in C++ Supports to compile on Strawberry.<commit_after>#ifndef slic3r_SupportMaterial_hpp_\n#define slic3r_SupportMaterial_hpp_\n\n#include \"Flow.hpp\"\n\nnamespace Slic3r {\n\nclass PrintObject;\nclass PrintConfig;\nclass PrintObjectConfig;\n\n\/\/ how much we extend support around the actual contact area\n#define SUPPORT_MATERIAL_MARGIN 1.5\t\n\n\/\/ Instantiated by Slic3r::Print::Object->_support_material()\nclass PrintSupportMaterial\n{\npublic:\n\tenum SupporLayerType {\n\t\tsltUnknown = 0,\n\t\tsltRaft,\n\t\tstlFirstLayer,\n\t\tsltBottomContact,\n\t\tsltBottomInterface,\n\t\tsltBase,\n\t\tsltTopInterface,\n\t\tsltTopContact,\n\t\t\/\/ Some undecided type yet. It will turn into stlBase first, then it may turn into stlBottomInterface or stlTopInterface.\n\t\tstlIntermediate,\n\t};\n\n\tclass MyLayer\n\t{\n\tpublic:\n\t\tMyLayer() :\n\t\t\tlayer_type(sltUnknown),\n\t\t\tprint_z(0.),\n\t\t\tbottom_z(0.),\n\t\t\theight(0.),\n\t\t\tidx_object_layer_above(size_t(-1)),\n\t\t\tidx_object_layer_below(size_t(-1)),\n\t\t\tbridging(false)\n\t\t\t{}\n\n\t\t~MyLayer() \n\t\t{\n\t\t\tdelete aux_polygons;\n\t\t\taux_polygons = NULL;\n\t\t}\n\n\t\tbool operator==(const MyLayer &layer2) const {\n\t\t\treturn print_z == layer2.print_z && height == layer2.height && bridging == layer2.bridging;\n\t\t}\n\n\t\tbool operator<(const MyLayer &layer2) const {\n\t\t\tif (print_z < layer2.print_z) {\n\t\t\t\treturn true;\n\t\t\t} else if (print_z == layer2.print_z) {\n\t\t\t \tif (height > layer2.height)\n\t\t\t \t\treturn true;\n\t\t\t \telse if (height == layer2.height) {\n\t\t\t \t \treturn bridging < layer2.bridging;\n\t\t\t \t} else\n\t\t\t \t\treturn false;\n\t\t\t} else\n\t\t\t\treturn false;\n\t\t}\n\n\t\tSupporLayerType layer_type;\n\t\t\/\/ Z used for printing in unscaled coordinates\n\t\tcoordf_t print_z;\n\t\t\/\/ Bottom height of this layer. For soluble layers, bottom_z + height = print_z,\n\t\t\/\/ otherwise bottom_z + gap + height = print_z.\n\t\tcoordf_t bottom_z;\n\t\t\/\/ layer height in unscaled coordinates\n    \tcoordf_t height;\n    \t\/\/ Index of a PrintObject layer_id supported by this layer. This will be set for top contact layers.\n    \t\/\/ If this is not a contact layer, it will be set to size_t(-1).\n    \tsize_t \t idx_object_layer_above;\n    \t\/\/ Index of a PrintObject layer_id, which supports this layer. This will be set for bottom contact layers.\n    \t\/\/ If this is not a contact layer, it will be set to size_t(-1).\n    \tsize_t \t idx_object_layer_below;\n    \t\/\/ Use a bridging flow when printing this support layer.\n    \tbool \t bridging;\n\n    \t\/\/ Polygons to be filled by the support pattern.\n    \tPolygons polygons;\n    \t\/\/ Currently for the contact layers only: Overhangs are stored here.\n    \tPolygons *aux_polygons;\n\t};\n\n\tstruct LayerExtreme\n\t{\n\t\tLayerExtreme(MyLayer *alayer, bool ais_top) : layer(alayer), is_top(ais_top) {}\n\t\tMyLayer \t*layer;\n\t\t\/\/ top or bottom extreme\n\t\tbool   \t\t is_top;\n\n\t\tcoordf_t\tz() const { return is_top ? layer->print_z : layer->print_z - layer->height; }\n\n\t\tbool operator<(const LayerExtreme &other) const { return z() < other.z(); }\n\t};\n\n\/*\n\tstruct LayerPrintZ_Hash {\n\t\tsize_t operator()(const MyLayer &layer) const { \n\t\t\treturn std::hash<double>()(layer.print_z)^std::hash<double>()(layer.height)^size_t(layer.bridging);\n\t\t}\n\t};\n*\/\n\n\ttypedef std::vector<MyLayer*> \t\t\t\tMyLayersPtr;\n\ttypedef std::deque<MyLayer> \t\t\t\tMyLayerStorage;\n\npublic:\n\tPrintSupportMaterial(\n\t\tconst PrintConfig \t\t*print_config,\n\t\tconst PrintObjectConfig\t*object_config,\n\t\tconst Flow \t\t\t \t&flow,\n\t\tconst Flow \t\t\t \t&first_layer_flow,\n\t\tconst Flow \t\t\t \t&interface_flow,\n\t\tbool \t\t\t \t \t soluble_interface) :\n\t\tm_print_config(print_config),\n\t\tm_object_config(object_config),\n\t\tm_flow(flow),\n\t\tm_first_layer_flow(first_layer_flow),\n\t\tm_interface_flow(interface_flow),\n\t\tm_soluble_interface(soluble_interface),\n\t\tm_support_layer_height_max(0.),\n\t\tm_support_interface_layer_height_max(0.)\n\t{}\n\n\tPrintSupportMaterial(\n\t\tPrintConfig \t\t*print_config,\n\t\tPrintObjectConfig\t*object_config,\n\t\tFlow \t\t\t \t*flow,\n\t\tFlow \t\t\t \t*first_layer_flow,\n\t\tFlow \t\t\t \t*interface_flow,\n\t\tbool \t\t\t \t soluble_interface) :\n\t\tm_print_config(print_config),\n\t\tm_object_config(object_config),\n\t\tm_flow(*flow),\n\t\tm_first_layer_flow(*first_layer_flow),\n\t\tm_interface_flow(*interface_flow),\n\t\tm_soluble_interface(soluble_interface),\n\t\tm_support_layer_height_max(0.),\n\t\tm_support_interface_layer_height_max(0.)\n\t{}\n\n\t\/\/ Generate support material for the object.\n\t\/\/ New support layers will be added to the object,\n\t\/\/ with extrusion paths and islands filled in for each support layer.\n\tvoid generate(PrintObject &object);\n\nprivate:\n\t\/\/ Generate top contact layers supporting overhangs.\n\t\/\/ For a soluble interface material synchronize the layer heights with the object, otherwise leave the layer height undefined.\n\t\/\/ If supports over bed surface only are requested, don't generate contact layers over an object.\n\tMyLayersPtr top_contact_layers(const PrintObject &object, MyLayerStorage &layer_storage) const;\n\n\t\/\/ Generate bottom contact layers supporting the top contact layers.\n\t\/\/ For a soluble interface material synchronize the layer heights with the object, \n\t\/\/ otherwise set the layer height to a bridging flow of a support interface nozzle.\n\tMyLayersPtr bottom_contact_layers(const PrintObject &object, const MyLayersPtr &top_contacts, MyLayerStorage &layer_storage) const;\n\n\t\/\/ Trim the top_contacts layers with the bottom_contacts layers if they overlap, so there would not be enough vertical space for both of them.\n\tvoid trim_top_contacts_by_bottom_contacts(const PrintObject &object, const MyLayersPtr &bottom_contacts, MyLayersPtr &top_contacts) const;\n\n\t\/\/ Generate raft layers and the intermediate support layers between the bottom contact and top contact surfaces.\n\tMyLayersPtr raft_and_intermediate_support_layers(\n\t    const PrintObject   &object,\n\t    const MyLayersPtr   &bottom_contacts,\n\t    const MyLayersPtr   &top_contacts,\n\t    MyLayerStorage\t \t&layer_storage,\n\t    const coordf_t       max_object_layer_height) const;\n\n\tvoid generate_base_layers(\n\t    const PrintObject   &object,\n\t    const MyLayersPtr   &bottom_contacts,\n\t    const MyLayersPtr   &top_contacts,\n\t    MyLayersPtr         &intermediate_layers) const;\n\n\tMyLayersPtr generate_interface_layers(\n\t    const PrintObject   &object,\n\t    const MyLayersPtr   &bottom_contacts,\n\t    const MyLayersPtr   &top_contacts,\n\t    MyLayersPtr         &intermediate_layers,\n\t    MyLayerStorage      &layer_storage) const;\n\n\/*\n\tvoid generate_pillars_shape();\n\tvoid clip_with_shape();\n*\/\n\n\t\/\/ Produce the actual G-code.\n\tvoid generate_toolpaths(\n        const PrintObject   &object,\n        const MyLayersPtr   &bottom_contacts,\n        const MyLayersPtr   &top_contacts,\n        const MyLayersPtr   &intermediate_layers,\n        const MyLayersPtr   &interface_layers) const;\n\n\tconst PrintConfig \t\t*m_print_config;\n\tconst PrintObjectConfig *m_object_config;\n\tFlow \t\t\t \t m_flow;\n\tFlow \t\t\t \t m_first_layer_flow;\n\tFlow \t\t\t \t m_interface_flow;\n\tbool \t\t\t \t m_soluble_interface;\n\n\tcoordf_t\t\t \t m_support_layer_height_max;\n\tcoordf_t\t\t \t m_support_interface_layer_height_max;\n\tbool \t\t\t\t m_synchronize_support_layers_with_object;\n};\n\n} \/\/ namespace Slic3r\n\n#endif \/* slic3r_SupportMaterial_hpp_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"control.h\"\n\nint main()\n{\n\tControl C;\n\tC.inicializador();\n\treturn 0;\n}<commit_msg>un pause en el main<commit_after>#include \"control.h\"\n\nint main()\n{\n\tControl C;\n\tC.inicializador();\n\tsystem(\"pause\");\n\treturn 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/#####################################################################\n\/\/ Class Nested\n\/\/#####################################################################\n#include <geode\/array\/Nested.h>\n#include <geode\/array\/convert.h>\n#include <geode\/python\/Class.h>\nnamespace geode {\n\nArray<int> nested_array_offsets(RawArray<const int> lengths) {\n  Array<int> offsets(lengths.size()+1,false);\n  offsets[0] = 0;\n  for (int i=0;i<lengths.size();i++) {\n    GEODE_ASSERT(lengths[i]>=0);\n    offsets[i+1] = offsets[i]+lengths[i];\n  }\n  return offsets;\n}\n\n#ifdef GEODE_PYTHON\n\nstatic PyTypeObject* nested_array_type;\nstatic PyObject* offsets_string;\nstatic PyObject* flat_string;\nstatic PyObject* empty_tuple;\n\nstatic void _set_nested_array(PyObject* nested_array) {\n  GEODE_ASSERT(PyObject_IsInstance(nested_array,(PyObject*)&PyType_Type));\n  nested_array_type = (PyTypeObject*)nested_array;\n}\n\nPyObject* nested_array_to_python_helper(PyObject* offsets, PyObject* flat) {\n  PyObject* object = 0;\n  if (!nested_array_type) {\n    PyErr_SetString(PyExc_RuntimeError,\"_set_nested_array must be called before calling to_python\");\n    goto fail;\n  }\n  object = nested_array_type->tp_new(nested_array_type,empty_tuple,0);\n  if (!object)\n    goto fail;\n  if (PyObject_GenericSetAttr(object,&*offsets_string,offsets))\n    goto fail;\n  Py_DECREF(offsets);\n  offsets = 0;\n  if (PyObject_GenericSetAttr(object,&*flat_string,flat))\n    goto fail;\n  Py_DECREF(flat);\n  flat = 0;\n  return object;\nfail:\n  Py_XDECREF(offsets);\n  Py_XDECREF(flat);\n  Py_XDECREF(object);\n  return 0;\n}\n\nbool is_nested_array(PyObject* object) {\n  GEODE_ASSERT(nested_array_type);\n  return PyObject_IsInstance(object,(PyObject*)nested_array_type)!=0;\n}\n\nVector<Ref<>,2> nested_array_from_python_helper(PyObject* object) {\n  return vec(steal_ref_check(PyObject_GetAttr(object,&*offsets_string)),\n             steal_ref_check(PyObject_GetAttr(object,&*flat_string)));\n}\n\nNESTED_CONVERSIONS(int)\nNESTED_CONVERSIONS(float)\nNESTED_CONVERSIONS(double)\nNESTED_CONVERSIONS(Vector<float,2>)\nNESTED_CONVERSIONS(Vector<double,2>)\n\n#endif\n}\n\nvoid wrap_nested_array() {\n  using namespace geode;\n\n#ifdef GEODE_PYTHON\n  GEODE_FUNCTION(_set_nested_array)\n\n  offsets_string = PyString_FromString(\"offsets\");\n  if (!offsets_string) throw_python_error();\n  flat_string = PyString_FromString(\"flat\");\n  if (!flat_string) throw_python_error();\n  empty_tuple = PyTuple_New(0);\n  if (!empty_tuple) throw_python_error();\n#endif\n}\n<commit_msg>Add python conversion for Nested<Vec3><commit_after>\/\/#####################################################################\n\/\/ Class Nested\n\/\/#####################################################################\n#include <geode\/array\/Nested.h>\n#include <geode\/array\/convert.h>\n#include <geode\/python\/Class.h>\nnamespace geode {\n\nArray<int> nested_array_offsets(RawArray<const int> lengths) {\n  Array<int> offsets(lengths.size()+1,false);\n  offsets[0] = 0;\n  for (int i=0;i<lengths.size();i++) {\n    GEODE_ASSERT(lengths[i]>=0);\n    offsets[i+1] = offsets[i]+lengths[i];\n  }\n  return offsets;\n}\n\n#ifdef GEODE_PYTHON\n\nstatic PyTypeObject* nested_array_type;\nstatic PyObject* offsets_string;\nstatic PyObject* flat_string;\nstatic PyObject* empty_tuple;\n\nstatic void _set_nested_array(PyObject* nested_array) {\n  GEODE_ASSERT(PyObject_IsInstance(nested_array,(PyObject*)&PyType_Type));\n  nested_array_type = (PyTypeObject*)nested_array;\n}\n\nPyObject* nested_array_to_python_helper(PyObject* offsets, PyObject* flat) {\n  PyObject* object = 0;\n  if (!nested_array_type) {\n    PyErr_SetString(PyExc_RuntimeError,\"_set_nested_array must be called before calling to_python\");\n    goto fail;\n  }\n  object = nested_array_type->tp_new(nested_array_type,empty_tuple,0);\n  if (!object)\n    goto fail;\n  if (PyObject_GenericSetAttr(object,&*offsets_string,offsets))\n    goto fail;\n  Py_DECREF(offsets);\n  offsets = 0;\n  if (PyObject_GenericSetAttr(object,&*flat_string,flat))\n    goto fail;\n  Py_DECREF(flat);\n  flat = 0;\n  return object;\nfail:\n  Py_XDECREF(offsets);\n  Py_XDECREF(flat);\n  Py_XDECREF(object);\n  return 0;\n}\n\nbool is_nested_array(PyObject* object) {\n  GEODE_ASSERT(nested_array_type);\n  return PyObject_IsInstance(object,(PyObject*)nested_array_type)!=0;\n}\n\nVector<Ref<>,2> nested_array_from_python_helper(PyObject* object) {\n  return vec(steal_ref_check(PyObject_GetAttr(object,&*offsets_string)),\n             steal_ref_check(PyObject_GetAttr(object,&*flat_string)));\n}\n\nNESTED_CONVERSIONS(int)\nNESTED_CONVERSIONS(float)\nNESTED_CONVERSIONS(double)\nNESTED_CONVERSIONS(Vector<float,2>)\nNESTED_CONVERSIONS(Vector<float,3>)\nNESTED_CONVERSIONS(Vector<double,2>)\nNESTED_CONVERSIONS(Vector<double,3>)\n\n#endif\n}\n\nvoid wrap_nested_array() {\n  using namespace geode;\n\n#ifdef GEODE_PYTHON\n  GEODE_FUNCTION(_set_nested_array)\n\n  offsets_string = PyString_FromString(\"offsets\");\n  if (!offsets_string) throw_python_error();\n  flat_string = PyString_FromString(\"flat\");\n  if (!flat_string) throw_python_error();\n  empty_tuple = PyTuple_New(0);\n  if (!empty_tuple) throw_python_error();\n#endif\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#ifndef MTAC_UTILS_H\n#define MTAC_UTILS_H\n\n#include <memory>\n#include <utility>\n#include <unordered_set>\n#include <unordered_map>\n\n#include \"variant.hpp\"\n#include \"Type.hpp\"\n#include \"VisitorUtils.hpp\"\n\n#include \"mtac\/Program.hpp\"\n#include \"mtac\/Operator.hpp\"\n#include \"mtac\/forward.hpp\"\n\nnamespace eddic {\n\nclass Variable;\nstruct GlobalContext;\n\nnamespace mtac {\n\ntemplate<typename V, typename T>\ninline bool equals(T& variant, V value){\n    return boost::get<V>(&variant) && value == boost::get<V>(variant);\n}\n\ntemplate<typename V, typename T>\ninline bool is(T& variant){\n    return boost::get<V>(&variant);\n}\n\ntemplate<typename V, typename T>\ninline bool optional_is(T& variant){\n    return variant && boost::get<V>(&*variant);\n}\n\ntemplate<typename T>\ninline bool isInt(T variant){\n    return boost::get<int>(&variant);\n}\n\ntemplate<typename T>\ninline bool isFloat(T& variant){\n    return boost::get<double>(&variant);\n}\n\ntemplate<typename T>\ninline bool isVariable(T& variant){\n    return boost::get<std::shared_ptr<Variable>>(&variant);\n}\n\ntemplate<typename T>\ninline void assertIntOrVariable(T& variant){\n    assert(isInt(variant) || isVariable(variant));\n}\n\ntemplate<typename Visitor>\nvoid visit_all_statements(Visitor& visitor, mtac::Function& function){\n    for(auto& block : function){\n        visit_each(visitor, block->statements);\n    }\n}\n\ntemplate<typename T, typename OptVariant, typename Functor>\nvoid if_init(OptVariant& opt_variant, Functor functor){\n    if(opt_variant){\n        if(auto* ptr = boost::get<T>(&*opt_variant)){\n            functor(*ptr);\n        }\n    }\n}\n\ntemplate<typename T, typename OptVariant, typename Functor>\nvoid if_init_equals(OptVariant& opt_variant, T& cmp, Functor functor){\n    if(opt_variant){\n        if(auto* ptr = boost::get<T>(&*opt_variant)){\n            if(*ptr == cmp){\n                functor();\n            }\n        }\n    }\n}\n\ntemplate<typename T, typename OptVariant, typename Functor>\nvoid if_init_not_equals(OptVariant& opt_variant, T& cmp, Functor functor){\n    if(opt_variant){\n        if(auto* ptr = boost::get<T>(&*opt_variant)){\n            if(*ptr != cmp){\n                functor(*ptr);\n            }\n        }\n    }\n}\n\nbool is_single_int_register(std::shared_ptr<const Type> type);\nbool is_single_float_register(std::shared_ptr<const Type> type);\n\nunsigned int compute_member_offset(std::shared_ptr<const GlobalContext> context, std::shared_ptr<const Type> typer, const std::string& member);\nstd::pair<unsigned int, std::shared_ptr<const Type>> compute_member(std::shared_ptr<const GlobalContext> context, std::shared_ptr<const Type> type, const std::string& member);\n\nvoid computeBlockUsage(mtac::Function& function, std::unordered_set<mtac::basic_block_p>& usage);\n\nbool is_recursive(mtac::Function& function);\n\nbool safe(const std::string& call);\nbool erase_result(mtac::Operator op);\n\nmtac::Quadruple copy(const mtac::Quadruple& statement);\n\n} \/\/end of mtac\n\n} \/\/end of eddic\n\n#endif\n<commit_msg>Document utility<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#ifndef MTAC_UTILS_H\n#define MTAC_UTILS_H\n\n#include <memory>\n#include <utility>\n#include <unordered_set>\n#include <unordered_map>\n\n#include \"variant.hpp\"\n#include \"Type.hpp\"\n#include \"VisitorUtils.hpp\"\n\n#include \"mtac\/Program.hpp\"\n#include \"mtac\/Operator.hpp\"\n#include \"mtac\/forward.hpp\"\n\nnamespace eddic {\n\nclass Variable;\nstruct GlobalContext;\n\nnamespace mtac {\n\ntemplate<typename V, typename T>\ninline bool equals(T& variant, V value){\n    return boost::get<V>(&variant) && value == boost::get<V>(variant);\n}\n\ntemplate<typename V, typename T>\ninline bool is(T& variant){\n    return boost::get<V>(&variant);\n}\n\ntemplate<typename V, typename T>\ninline bool optional_is(T& variant){\n    return variant && boost::get<V>(&*variant);\n}\n\ntemplate<typename T>\ninline bool isInt(T variant){\n    return boost::get<int>(&variant);\n}\n\ntemplate<typename T>\ninline bool isFloat(T& variant){\n    return boost::get<double>(&variant);\n}\n\ntemplate<typename T>\ninline bool isVariable(T& variant){\n    return boost::get<std::shared_ptr<Variable>>(&variant);\n}\n\ntemplate<typename T>\ninline void assertIntOrVariable(T& variant){\n    assert(isInt(variant) || isVariable(variant));\n}\n\ntemplate<typename Visitor>\nvoid visit_all_statements(Visitor& visitor, mtac::Function& function){\n    for(auto& block : function){\n        visit_each(visitor, block->statements);\n    }\n}\n\n\/*!\n * \\brief Execute the given functor if the given optional variant is initialized and of the given template type. \n * \\param opt_variant The optional variant. \n * \\param functor The functor to execute. Must have an operator()(T).\n * \\tparam T The type that must be contained in the variant. \n * \\tparam OptVariant The optional variant type. \n * \\tparam Functor the type of the functor. \n *\/\ntemplate<typename T, typename OptVariant, typename Functor>\nvoid if_init(OptVariant& opt_variant, Functor functor){\n    if(opt_variant){\n        if(auto* ptr = boost::get<T>(&*opt_variant)){\n            functor(*ptr);\n        }\n    }\n}\n\n\/*!\n * \\brief Execute the given functor if the given optional variant is initialized and is equals to the given value. \n * \\param opt_variant The optional variant. \n * \\param cmp The object the variant must be equals to. \n * \\param functor The functor to execute. Must have an operator()().\n * \\tparam T The type that must be contained in the variant. \n * \\tparam OptVariant The optional variant type. \n * \\tparam Functor the type of the functor. \n *\/\ntemplate<typename T, typename OptVariant, typename Functor>\nvoid if_init_equals(OptVariant& opt_variant, T& cmp, Functor functor){\n    if(opt_variant){\n        if(auto* ptr = boost::get<T>(&*opt_variant)){\n            if(*ptr == cmp){\n                functor();\n            }\n        }\n    }\n}\n\n\/*!\n * \\brief Execute the given functor if the given optional variant is initialized and is not equals to the given value. \n * \\param opt_variant The optional variant. \n * \\param cmp The object the variant must be not equals to. \n * \\param functor The functor to execute. Must have an operator()(T).\n * \\tparam T The type that must be contained in the variant. \n * \\tparam OptVariant The optional variant type. \n * \\tparam Functor the type of the functor. \n *\/\ntemplate<typename T, typename OptVariant, typename Functor>\nvoid if_init_not_equals(OptVariant& opt_variant, T& cmp, Functor functor){\n    if(opt_variant){\n        if(auto* ptr = boost::get<T>(&*opt_variant)){\n            if(*ptr != cmp){\n                functor(*ptr);\n            }\n        }\n    }\n}\n\nbool is_single_int_register(std::shared_ptr<const Type> type);\nbool is_single_float_register(std::shared_ptr<const Type> type);\n\nunsigned int compute_member_offset(std::shared_ptr<const GlobalContext> context, std::shared_ptr<const Type> typer, const std::string& member);\nstd::pair<unsigned int, std::shared_ptr<const Type>> compute_member(std::shared_ptr<const GlobalContext> context, std::shared_ptr<const Type> type, const std::string& member);\n\nvoid computeBlockUsage(mtac::Function& function, std::unordered_set<mtac::basic_block_p>& usage);\n\nbool is_recursive(mtac::Function& function);\n\nbool safe(const std::string& call);\nbool erase_result(mtac::Operator op);\n\nmtac::Quadruple copy(const mtac::Quadruple& statement);\n\n} \/\/end of mtac\n\n} \/\/end of eddic\n\n#endif\n<|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#ifndef INCLUDED_UTILS_HPP\n#define INCLUDED_UTILS_HPP\n\n#include <pdal\/pdal_internal.hpp>\n\n#include <string>\n#include <cassert>\n#include <stdexcept>\n#include <cmath>\n#include <ostream>\n#include <istream>\n#include <limits>\n#include <cstring>\n#include <sstream>\n#include <vector>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string\/erase.hpp>\n#include <boost\/numeric\/conversion\/cast.hpp>\n\nnamespace pdal\n{\n\nclass PDAL_DLL Utils\n{\npublic:\n    static void random_seed(unsigned int seed);\n    static double random(double minimum, double maximum);\n\n    \/\/ compares two values to within the datatype's epsilon\n    template<class T>\n    static bool compare_distance(const T& actual, const T& expected)\n    {\n        const T epsilon = std::numeric_limits<T>::epsilon();\n        return compare_approx<T>(actual, expected, epsilon);\n    }\n\n    \/\/ compares two values to within a given tolerance\n    \/\/ the value |tolerance| is compared to |actual - expected|\n    template<class T>\n    static bool compare_approx(const T& actual, const T& expected, const T& tolerance)\n    {\n        const double diff = std::abs((double)actual - (double)expected);\n        const double delta = std::abs((double)tolerance);\n\n        if (diff > delta)\n        {\n            return false;\n        }\n        return true;\n    }\n\n    template<class T>\n    static inline void write_field(boost::uint8_t*& dest, T v)\n    {\n        *(T*)(void*)dest = v;\n        dest += sizeof(T);\n        return;\n    }\n\n    template<class T>\n    static inline T read_field(boost::uint8_t*& src)\n    {\n        T tmp = *(T*)(void*)src;\n        src += sizeof(T);\n        return tmp;\n    }\n\n    template<class T>\n    static inline void read_array_field(boost::uint8_t*& src, T* dest, std::size_t count)\n    {\n        memcpy((boost::uint8_t*)dest, (boost::uint8_t*)(T*)src, sizeof(T)*count);\n        src += sizeof(T) * count;\n        return;\n    }\n\n    template <typename T>\n    static inline void read_n(T& dest, std::istream& src, std::streamsize const& num)\n    {\n        if (!src.good())\n            throw std::runtime_error(\"pdal::Utils::read_n<T> input stream is not readable\");\n\n        char* p = as_buffer(dest);\n        src.read(p, num);\n\n        assert(check_stream_state(src));\n    }\n\n    template <typename T>\n    static inline void write_n(std::ostream& dest, T const& src, std::streamsize const& num)\n    {\n        if (!dest.good())\n            throw std::runtime_error(\"pdal::Utils::write_n<T>: output stream is not writable\");\n\n        T& tmp = const_cast<T&>(src);\n\n        char const* p = as_bytes(tmp);\n        dest.rdbuf()->sputn(p, num);\n\n        assert(check_stream_state(dest));\n    }\n\n    \/\/ From http:\/\/stackoverflow.com\/questions\/485525\/round-for-float-in-c\n    static inline double sround(double r)\n    {\n        return (r > 0.0) ? floor(r + 0.5) : ceil(r - 0.5);\n    }\n    \n    static inline std::vector<boost::uint8_t> hex_string_to_binary(std::string const& source)\n    {\n        \/\/ Stolen from http:\/\/stackoverflow.com\/questions\/7363774\/c-converting-binary-data-to-a-hex-string-and-back\n        static int nibbles[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 10, 11, 12, 13, 14, 15 };\n        std::vector<unsigned char> retval;\n        for (std::string::const_iterator it = source.begin(); it < source.end(); it += 2) {\n            unsigned char v = 0;\n            if (::isxdigit(*it))\n                v = nibbles[::toupper(*it) - '0'] << 4;\n            if (it + 1 < source.end() && ::isxdigit(*(it + 1)))\n                v += nibbles[::toupper(*(it + 1)) - '0'];\n            retval.push_back(v);\n        }\n        return retval;\n    }\n\n    static inline std::string binary_to_hex_string(const std::vector<unsigned char>& source)\n    {\n        static char syms[] = \"0123456789ABCDEF\";\n        std::stringstream ss;\n        for (std::vector<unsigned char>::const_iterator it = source.begin(); it != source.end(); it++)\n            ss << syms[((*it >> 4) & 0xf)] << syms[*it & 0xf];\n\n        return ss.str();\n    }\n\n    template<typename Target, typename Source>\n    static inline Target saturation_cast(Source const& src)\n    {\n\n        try\n        {\n            return boost::numeric_cast<Target>(src);\n        }\n        catch (boost::numeric::negative_overflow const&)\n        {\n            return std::numeric_limits<Target>::min();\n        }\n        catch (boost::numeric::positive_overflow const&)\n        {\n            return std::numeric_limits<Target>::max();\n        }\n\n    }\n    \n    static void registerPlugin(void* stageFactoryPtr, std::string const& filename, std::string const& method);\n\n    static char* getenv(const char* env);\n    static std::string getenv(std::string const& name);\n    static int putenv(const char* env);\n\n    \/\/ aid to operator>> parsers\n    static void eatwhitespace(std::istream& s);\n\n    \/\/ aid to operator>> parsers\n    \/\/ if char found, eats it and returns true; otherwise, don't eat it and then return false\n    static bool eatcharacter(std::istream& s, char x);\n\n    static boost::uint32_t getStreamPrecision(double scale);\n\n    static boost::uint32_t safeconvert64to32(boost::uint64_t x64);\n\n    \/\/ Generates a random temporary filename\n    static std::string generate_filename();\n    static std::string generate_tempfile();\n\n    static void* getDLLSymbol(std::string const& library, std::string const& name);\n    static std::string base64_encode(std::vector<boost::uint8_t> const& bytes);\n    static std::vector<boost::uint8_t> base64_decode(std::string const& input);\n    \n    static FILE* portable_popen(const std::string& command, const std::string& mode);\n    static int portable_pclose(FILE* fp);\n    static int run_shell_command(const std::string& cmd, std::string& output);\n   \n    static std::string replaceAll(std::string result, \n                                  const std::string& replaceWhat, \n                                  const std::string& replaceWithWhat);\n\n \nprivate:\n    template<typename T>\n    static inline char* as_buffer(T& data)\n    {\n        return static_cast<char*>(static_cast<void*>(&data));\n    }\n\n    template<typename T>\n    static inline char* as_buffer(T* data)\n    {\n        return static_cast<char*>(static_cast<void*>(data));\n    }\n\n    template<typename T>\n    static inline char const* as_bytes(T const& data)\n    {\n        return static_cast<char const*>(static_cast<void const*>(&data));\n    }\n\n    template<typename T>\n    static inline char const* as_bytes(T const* data)\n    {\n        return static_cast<char const*>(static_cast<void const*>(data));\n    }\n\n\n    template <typename C, typename T>\n    static inline bool check_stream_state(std::basic_ios<C, T>& srtm)\n    {\n        \/\/ Test stream state bits\n        if (srtm.eof())\n            throw std::out_of_range(\"end of file encountered\");\n        else if (srtm.fail())\n            throw std::runtime_error(\"non-fatal I\/O error occured\");\n        else if (srtm.bad())\n            throw std::runtime_error(\"fatal I\/O error occured\");\n        return true;\n    }\n\n\n};\n\n\n} \/\/ namespace pdal\n\n#endif\n<commit_msg>add a binary_to_hex_stream method<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#ifndef INCLUDED_UTILS_HPP\n#define INCLUDED_UTILS_HPP\n\n#include <pdal\/pdal_internal.hpp>\n\n#include <string>\n#include <cassert>\n#include <stdexcept>\n#include <cmath>\n#include <ostream>\n#include <istream>\n#include <limits>\n#include <cstring>\n#include <sstream>\n#include <vector>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string\/erase.hpp>\n#include <boost\/numeric\/conversion\/cast.hpp>\n\nnamespace pdal\n{\n\nclass PDAL_DLL Utils\n{\npublic:\n    static void random_seed(unsigned int seed);\n    static double random(double minimum, double maximum);\n\n    \/\/ compares two values to within the datatype's epsilon\n    template<class T>\n    static bool compare_distance(const T& actual, const T& expected)\n    {\n        const T epsilon = std::numeric_limits<T>::epsilon();\n        return compare_approx<T>(actual, expected, epsilon);\n    }\n\n    \/\/ compares two values to within a given tolerance\n    \/\/ the value |tolerance| is compared to |actual - expected|\n    template<class T>\n    static bool compare_approx(const T& actual, const T& expected, const T& tolerance)\n    {\n        const double diff = std::abs((double)actual - (double)expected);\n        const double delta = std::abs((double)tolerance);\n\n        if (diff > delta)\n        {\n            return false;\n        }\n        return true;\n    }\n\n    template<class T>\n    static inline void write_field(boost::uint8_t*& dest, T v)\n    {\n        *(T*)(void*)dest = v;\n        dest += sizeof(T);\n        return;\n    }\n\n    template<class T>\n    static inline T read_field(boost::uint8_t*& src)\n    {\n        T tmp = *(T*)(void*)src;\n        src += sizeof(T);\n        return tmp;\n    }\n\n    template<class T>\n    static inline void read_array_field(boost::uint8_t*& src, T* dest, std::size_t count)\n    {\n        memcpy((boost::uint8_t*)dest, (boost::uint8_t*)(T*)src, sizeof(T)*count);\n        src += sizeof(T) * count;\n        return;\n    }\n\n    template <typename T>\n    static inline void read_n(T& dest, std::istream& src, std::streamsize const& num)\n    {\n        if (!src.good())\n            throw std::runtime_error(\"pdal::Utils::read_n<T> input stream is not readable\");\n\n        char* p = as_buffer(dest);\n        src.read(p, num);\n\n        assert(check_stream_state(src));\n    }\n\n    template <typename T>\n    static inline void write_n(std::ostream& dest, T const& src, std::streamsize const& num)\n    {\n        if (!dest.good())\n            throw std::runtime_error(\"pdal::Utils::write_n<T>: output stream is not writable\");\n\n        T& tmp = const_cast<T&>(src);\n\n        char const* p = as_bytes(tmp);\n        dest.rdbuf()->sputn(p, num);\n\n        assert(check_stream_state(dest));\n    }\n\n    \/\/ From http:\/\/stackoverflow.com\/questions\/485525\/round-for-float-in-c\n    static inline double sround(double r)\n    {\n        return (r > 0.0) ? floor(r + 0.5) : ceil(r - 0.5);\n    }\n    \n    static inline std::vector<boost::uint8_t> hex_string_to_binary(std::string const& source)\n    {\n        \/\/ Stolen from http:\/\/stackoverflow.com\/questions\/7363774\/c-converting-binary-data-to-a-hex-string-and-back\n        static int nibbles[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 10, 11, 12, 13, 14, 15 };\n        std::vector<unsigned char> retval;\n        for (std::string::const_iterator it = source.begin(); it < source.end(); it += 2) {\n            unsigned char v = 0;\n            if (::isxdigit(*it))\n                v = nibbles[::toupper(*it) - '0'] << 4;\n            if (it + 1 < source.end() && ::isxdigit(*(it + 1)))\n                v += nibbles[::toupper(*(it + 1)) - '0'];\n            retval.push_back(v);\n        }\n        return retval;\n    }\n\n    static inline void binary_to_hex_stream(unsigned char* source, std::ostream& destination, int start, int end )\n    {\n        static char syms[] = \"0123456789ABCDEF\";\n        for (int i = start; i != end; i++)\n            destination << syms[((source[i] >> 4) & 0xf)] << syms[source[i] & 0xf];\n\n    }\n\n    static inline std::string binary_to_hex_string(const std::vector<unsigned char>& source)\n    {\n        static char syms[] = \"0123456789ABCDEF\";\n        std::stringstream ss;\n        for (std::vector<unsigned char>::const_iterator it = source.begin(); it != source.end(); it++)\n            ss << syms[((*it >> 4) & 0xf)] << syms[*it & 0xf];\n\n        return ss.str();\n    }\n\n    template<typename Target, typename Source>\n    static inline Target saturation_cast(Source const& src)\n    {\n\n        try\n        {\n            return boost::numeric_cast<Target>(src);\n        }\n        catch (boost::numeric::negative_overflow const&)\n        {\n            return std::numeric_limits<Target>::min();\n        }\n        catch (boost::numeric::positive_overflow const&)\n        {\n            return std::numeric_limits<Target>::max();\n        }\n\n    }\n    \n    static void registerPlugin(void* stageFactoryPtr, std::string const& filename, std::string const& method);\n\n    static char* getenv(const char* env);\n    static std::string getenv(std::string const& name);\n    static int putenv(const char* env);\n\n    \/\/ aid to operator>> parsers\n    static void eatwhitespace(std::istream& s);\n\n    \/\/ aid to operator>> parsers\n    \/\/ if char found, eats it and returns true; otherwise, don't eat it and then return false\n    static bool eatcharacter(std::istream& s, char x);\n\n    static boost::uint32_t getStreamPrecision(double scale);\n\n    static boost::uint32_t safeconvert64to32(boost::uint64_t x64);\n\n    \/\/ Generates a random temporary filename\n    static std::string generate_filename();\n    static std::string generate_tempfile();\n\n    static void* getDLLSymbol(std::string const& library, std::string const& name);\n    static std::string base64_encode(std::vector<boost::uint8_t> const& bytes);\n    static std::vector<boost::uint8_t> base64_decode(std::string const& input);\n    \n    static FILE* portable_popen(const std::string& command, const std::string& mode);\n    static int portable_pclose(FILE* fp);\n    static int run_shell_command(const std::string& cmd, std::string& output);\n   \n    static std::string replaceAll(std::string result, \n                                  const std::string& replaceWhat, \n                                  const std::string& replaceWithWhat);\n\n \nprivate:\n    template<typename T>\n    static inline char* as_buffer(T& data)\n    {\n        return static_cast<char*>(static_cast<void*>(&data));\n    }\n\n    template<typename T>\n    static inline char* as_buffer(T* data)\n    {\n        return static_cast<char*>(static_cast<void*>(data));\n    }\n\n    template<typename T>\n    static inline char const* as_bytes(T const& data)\n    {\n        return static_cast<char const*>(static_cast<void const*>(&data));\n    }\n\n    template<typename T>\n    static inline char const* as_bytes(T const* data)\n    {\n        return static_cast<char const*>(static_cast<void const*>(data));\n    }\n\n\n    template <typename C, typename T>\n    static inline bool check_stream_state(std::basic_ios<C, T>& srtm)\n    {\n        \/\/ Test stream state bits\n        if (srtm.eof())\n            throw std::out_of_range(\"end of file encountered\");\n        else if (srtm.fail())\n            throw std::runtime_error(\"non-fatal I\/O error occured\");\n        else if (srtm.bad())\n            throw std::runtime_error(\"fatal I\/O error occured\");\n        return true;\n    }\n\n\n};\n\n\n} \/\/ namespace pdal\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"platform.hpp\"\n\n#include <exception>\n#include <string>\n\n\n#define xfatal(MSG)                                                     \\\n\tdo {                                                                \\\n\t\tfputs((std::string(__FILE__) + \":\" + std::to_string(__LINE__) + \\\n\t\t       \" in \" + STX_FUNCTION + \" : \" + MSG)                     \\\n\t\t          .c_str(),                                             \\\n\t\t      stderr);                                                  \\\n\t\tstd::terminate();                                               \\\n\t} while(false)\n\n#define xfail(MSG)                                                   \\\n\tdo {                                                             \\\n\t\tthrow std::runtime_error(std::string(__FILE__) + \":\" +       \\\n\t\t                         std::to_string(__LINE__) + \" in \" + \\\n\t\t                         STX_FUNCTION + \" : \" + MSG);        \\\n\t} while(false)\n\n#ifdef STX_DEBUG_TOOLS\n\n#define xassert(TEST)                  \\\n\tdo {                               \\\n\t\tif(!(TEST)) { xfatal(#TEST); } \\\n\t} while(false)\n\n#define xassertmsg(TEST, MSG)                \\\n\tdo {                                     \\\n\t\tif(!(TEST)) { xfatal(#TEST + MSG); } \\\n\t} while(false)\n\n\/\/ These are intentionally not defined when the debug tools are off:\n\/\/ they are only for debugging and should NEVER be in production code build\n#define xhere() printf(\"%s:%i:\\n\", STX_FUNCTION, __LINE__)\n#define xhere_class() printf(\"%s:%i: (%p)\\n\", STX_FUNCTION, __LINE__, this)\n\n#else \/\/ defined(STX_DEBUG_TOOLS)\n\n#define xassert(TEST) \\\n\tdo {              \\\n\t\tif(TEST) {}   \\\n\t} while(false) \/\/ The if is necessary to supress warnings\n#define xassertmsg(TEST, MSG) \\\n\tdo {                      \\\n\t\tif(TEST) {}           \\\n\t} while(false)\n\n#endif \/\/ defined(STX_DEBUG_TOOLS)\n\n#if STX_DEBUG_TOOLS > 0\n\n#include \"logging.hpp\"\n\nnamespace stx {\n\n\/\/\/ A class used for debugging which checks whether a returned value was\n\/\/\/ handled\ntemplate <typename T>\nclass important {\n\tT            m_value;\n\tmutable bool m_handled;\n\npublic:\n\ttemplate <typename Tx>\n\tconstexpr important(Tx&& val) : m_value(val), m_handled(false) {}\n\n\t~important() noexcept {\n\t\tif(!m_handled) {\n\t\t\tstx::warn(\n\t\t\t    \"Unhandled important value! (important function result not \"\n\t\t\t    \"handled)\");\n\t\t}\n\t}\n\n\tconstexpr inline operator T() const noexcept {\n\t\tm_handled = true;\n\t\treturn std::move(m_value);\n\t}\n};\n\n\/\/\/ A class used for debugging which checks whether a returned value was\n\/\/\/ handled\ntemplate <typename T>\nclass asserted {\n\tT            m_value;\n\tmutable bool m_handled;\n\npublic:\n\ttemplate <typename Tx>\n\tconstexpr asserted(Tx&& val) : m_value(val), m_handled(false) {}\n\n\t~asserted() {\n\t\tif(!m_handled) {\n\t\t\tif(!m_value) {\n\t\t\t\txfatal(\n\t\t\t\t    \"Asserted return value was not handled and evaluates \"\n\t\t\t\t    \"to \"\n\t\t\t\t    \"false\");\n\t\t\t} else {\n\t\t\t\tstx::warn(\n\t\t\t\t    \"Unhandled important value! (important function result \"\n\t\t\t\t    \"not \"\n\t\t\t\t    \"handled)\");\n\t\t\t}\n\t\t}\n\t}\n\n\tconstexpr inline operator T() const noexcept {\n\t\tm_handled = true;\n\t\treturn std::move(m_value);\n\t}\n};\n\n} \/\/ namespace stx\n\n#define STX_RESULT_HANDLED(X) \\\n\t{                         \\\n\t\tif(X) {}              \\\n\t}\n\n#else \/\/ STX_DEBUG_TOOLS > 0\n\nnamespace stx {\n\ntemplate <typename T>\nusing important = T;\n\ntemplate <typename T>\nusing asserted = T;\n\n} \/\/ namespace stx\n\n#define STX_RESULT_HANDLED(X) \\\n\t{ X }\n\n#endif \/\/ STX_DEBUG_TOOLS > 0\n<commit_msg>Fixed asserts in release mode<commit_after>#pragma once\n\n#include \"platform.hpp\"\n\n#include <exception>\n#include <string>\n\n\n#define xfatal(MSG)                                                     \\\n\tdo {                                                                \\\n\t\tfputs((std::string(__FILE__) + \":\" + std::to_string(__LINE__) + \\\n\t\t       \" in \" + STX_FUNCTION + \" : \" + MSG)                     \\\n\t\t          .c_str(),                                             \\\n\t\t      stderr);                                                  \\\n\t\tstd::terminate();                                               \\\n\t} while(false)\n\n#define xfail(MSG)                                                   \\\n\tdo {                                                             \\\n\t\tthrow std::runtime_error(std::string(__FILE__) + \":\" +       \\\n\t\t                         std::to_string(__LINE__) + \" in \" + \\\n\t\t                         STX_FUNCTION + \" : \" + MSG);        \\\n\t} while(false)\n\n#ifdef STX_DEBUG_TOOLS\n\n#define xassert(TEST)                  \\\n\tdo {                               \\\n\t\tif(!(TEST)) { xfatal(#TEST); } \\\n\t} while(false)\n\n#define xassertmsg(TEST, MSG)                \\\n\tdo {                                     \\\n\t\tif(!(TEST)) { xfatal(#TEST + MSG); } \\\n\t} while(false)\n\n\/\/ These are intentionally not defined when the debug tools are off:\n\/\/ they are only for debugging and should NEVER be in production code build\n#define xhere() printf(\"%s:%i:\\n\", STX_FUNCTION, __LINE__)\n#define xhere_class() printf(\"%s:%i: (%p)\\n\", STX_FUNCTION, __LINE__, this)\n\n#else \/\/ defined(STX_DEBUG_TOOLS)\n\n#define xassert(TEST) \\\n\tdo {              \\\n\t\tif(TEST) {}   \\\n\t} while(false) \/\/ The if is necessary to supress warnings\n#define xassertmsg(TEST, MSG) \\\n\tdo {                      \\\n\t\tif(TEST) {}           \\\n\t} while(false)\n\n#endif \/\/ defined(STX_DEBUG_TOOLS)\n\n#if STX_DEBUG_TOOLS > 0\n\n#include \"logging.hpp\"\n\nnamespace stx {\n\n\/\/\/ A class used for debugging which checks whether a returned value was\n\/\/\/ handled\ntemplate <typename T>\nclass important {\n\tT            m_value;\n\tmutable bool m_handled;\n\npublic:\n\ttemplate <typename Tx>\n\tconstexpr important(Tx&& val) : m_value(val), m_handled(false) {}\n\n\t~important() noexcept {\n\t\tif(!m_handled) {\n\t\t\tstx::warn(\n\t\t\t    \"Unhandled important value! (important function result not \"\n\t\t\t    \"handled)\");\n\t\t}\n\t}\n\n\tconstexpr inline operator T() const noexcept {\n\t\tm_handled = true;\n\t\treturn std::move(m_value);\n\t}\n};\n\n\/\/\/ A class used for debugging which checks whether a returned value was\n\/\/\/ handled\ntemplate <typename T>\nclass asserted {\n\tT            m_value;\n\tmutable bool m_handled;\n\npublic:\n\ttemplate <typename Tx>\n\tconstexpr asserted(Tx&& val) : m_value(val), m_handled(false) {}\n\n\t~asserted() {\n\t\tif(!m_handled) {\n\t\t\tif(!m_value) {\n\t\t\t\txfatal(\n\t\t\t\t    \"Asserted return value was not handled and evaluates \"\n\t\t\t\t    \"to \"\n\t\t\t\t    \"false\");\n\t\t\t} else {\n\t\t\t\tstx::warn(\n\t\t\t\t    \"Unhandled important value! (important function result \"\n\t\t\t\t    \"not \"\n\t\t\t\t    \"handled)\");\n\t\t\t}\n\t\t}\n\t}\n\n\tconstexpr inline operator T() const noexcept {\n\t\tm_handled = true;\n\t\treturn std::move(m_value);\n\t}\n};\n\n} \/\/ namespace stx\n\n#define STX_RESULT_HANDLED(X) \\\n\t{                         \\\n\t\tif(X) {}              \\\n\t}\n\n#else \/\/ STX_DEBUG_TOOLS > 0\n\nnamespace stx {\n\ntemplate <typename T>\nusing important = T;\n\ntemplate <typename T>\nusing asserted = T;\n\n} \/\/ namespace stx\n\n#define STX_RESULT_HANDLED(X) \\\n\t{ X; }\n\n#endif \/\/ STX_DEBUG_TOOLS > 0\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#ifndef INCLUDED_SVL_LSTNER_HXX\n#define INCLUDED_SVL_LSTNER_HXX\n\n#include <svl\/svldllapi.h>\n#include <tools\/rtti.hxx>\n#include <deque>\n\nclass SfxBroadcaster;\nclass SfxHint;\n\ntypedef std::deque<SfxBroadcaster*> SfxBroadcasterArr_Impl;\n\n#define SFX_NOTIFY( rBC, rBCT, rHint, rHintT ) \\\n        Notify( rBC, rHint )\n\n\n\nclass SVL_DLLPUBLIC SfxListener\n{\n    SfxBroadcasterArr_Impl aBCs;\n\nprivate:\n    const SfxListener&  operator=(const SfxListener &); \/\/ n.i., ist verboten\n\npublic:\n    TYPEINFO();\n\n                        SfxListener();\n                        SfxListener( const SfxListener &rCopy );\n    virtual             ~SfxListener();\n\n    void                StartListening( SfxBroadcaster& rBroadcaster, bool bPreventDups = false );\n    void                EndListening( SfxBroadcaster& rBroadcaster, bool bAllDups = false );\n    void                EndListeningAll();\n    bool                IsListening( SfxBroadcaster& rBroadcaster ) const;\n\n    sal_uInt16              GetBroadcasterCount() const\n                        { return aBCs.size(); }\n    SfxBroadcaster*     GetBroadcasterJOE( sal_uInt16 nNo ) const\n                        { return aBCs[nNo]; }\n\n    virtual void        Notify( SfxBroadcaster& rBC, const SfxHint& rHint );\n\n#ifndef _NOTIFY_HXX\n    void RemoveBroadcaster_Impl( SfxBroadcaster& rBC );\n#endif\n};\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Bin crack, _NOTIFY_HXX is not defined anywhere anyway<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#ifndef INCLUDED_SVL_LSTNER_HXX\n#define INCLUDED_SVL_LSTNER_HXX\n\n#include <svl\/svldllapi.h>\n#include <tools\/rtti.hxx>\n#include <deque>\n\nclass SfxBroadcaster;\nclass SfxHint;\n\ntypedef std::deque<SfxBroadcaster*> SfxBroadcasterArr_Impl;\n\n#define SFX_NOTIFY( rBC, rBCT, rHint, rHintT ) \\\n        Notify( rBC, rHint )\n\n\n\nclass SVL_DLLPUBLIC SfxListener\n{\n    SfxBroadcasterArr_Impl aBCs;\n\nprivate:\n    const SfxListener&  operator=(const SfxListener &); \/\/ n.i., ist verboten\n\npublic:\n    TYPEINFO();\n\n                        SfxListener();\n                        SfxListener( const SfxListener &rCopy );\n    virtual             ~SfxListener();\n\n    void                StartListening( SfxBroadcaster& rBroadcaster, bool bPreventDups = false );\n    void                EndListening( SfxBroadcaster& rBroadcaster, bool bAllDups = false );\n    void                EndListeningAll();\n    bool                IsListening( SfxBroadcaster& rBroadcaster ) const;\n\n    sal_uInt16              GetBroadcasterCount() const\n                        { return aBCs.size(); }\n    SfxBroadcaster*     GetBroadcasterJOE( sal_uInt16 nNo ) const\n                        { return aBCs[nNo]; }\n\n    virtual void        Notify( SfxBroadcaster& rBC, const SfxHint& rHint );\n\n    void RemoveBroadcaster_Impl( SfxBroadcaster& rBC );\n};\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"Polygon3DDrawData.h\"\n#include \"core\/MapPos.h\"\n#include \"geometry\/PolygonGeometry.h\"\n#include \"graphics\/utils\/GLContext.h\"\n#include \"projections\/Projection.h\"\n#include \"projections\/ProjectionSurface.h\"\n#include \"styles\/Polygon3DStyle.h\"\n#include \"utils\/Const.h\"\n#include \"utils\/GeomUtils.h\"\n#include \"utils\/Log.h\"\n#include \"vectorelements\/Polygon3D.h\"\n\n#include <cmath>\n#include <cstdlib>\n#include <numeric>\n\n#include <tesselator.h>\n\nnamespace carto {\n\n    Polygon3DDrawData::Polygon3DDrawData(const Polygon3D& polygon3D, const Polygon3DStyle& style, const Projection& projection, const ProjectionSurface& projectionSurface) :\n        VectorElementDrawData(style.getColor()),\n        _sideColor(GetPremultipliedColor(style.getSideColor())),\n        _boundingBox(cglib::bbox3<double>::smallest()),\n        _coords(),\n        _normals(),\n        _attribs()\n    {\n        const std::vector<MapPos>& poses = polygon3D.getGeometry()->getPoses();\n        const std::vector<std::vector<MapPos> >& holes = polygon3D.getGeometry()->getHoles();\n        float height = polygon3D.getHeight();\n        \n        \/\/ Create tesselator\n        TESSalloc ma;\n        ma.memalloc = [](void* userData, unsigned int size) { return malloc(size); };\n        ma.memfree = [](void* userData, void* ptr) { free(ptr); };\n        ma.extraVertices = 256;\n        TESStesselator* tessPtr = tessNewTess(&ma);\n        if (!tessPtr) {\n            Log::Error(\"Polygon3DDrawData::Polygon3DDrawData: Failed to created tesselator!\");\n            return;\n        }\n        std::shared_ptr<TESStesselator> tess(tessPtr, tessDeleteTess);\n    \n        \/\/ Prepare polygon exterior\n        std::vector<std::vector<MapPos> > ringsInternalPoses(1 + holes.size());\n        ringsInternalPoses[0].reserve(poses.size());\n        \n        std::vector<double> posesArray(poses.size() * 3);\n        for (std::size_t i = 0; i < poses.size(); i++) {\n            MapPos pos = poses[i];\n            pos.setZ(height);\n            MapPos internalPos = projection.toInternal(pos);\n            posesArray[i * 3 + 0] = internalPos.getX();\n            posesArray[i * 3 + 1] = internalPos.getY();\n            posesArray[i * 3 + 2] = internalPos.getZ();\n            ringsInternalPoses[0].push_back(internalPos);\n        }\n        tessAddContour(tess.get(), 3, posesArray.data(), sizeof(double) * 3, static_cast<unsigned int>(poses.size()));\n    \n        \/\/ Prepare polygon holes\n        std::vector<std::vector<double> > holesArray(holes.size());\n        for (std::size_t n = 0; n < holes.size(); n++) {\n            const std::vector<MapPos>& hole = holes[n];\n            std::vector<double>& holeArray = holesArray[n];\n            holeArray.resize(hole.size() * 3);\n            for (std::size_t i = 0; i < hole.size(); i++) {\n                MapPos pos = hole[i];\n                pos.setZ(height);\n                MapPos internalPos = projection.toInternal(pos);\n                holeArray[i * 3 + 0] = internalPos.getX();\n                holeArray[i * 3 + 1] = internalPos.getY();\n                holeArray[i * 3 + 2] = internalPos.getZ();\n                ringsInternalPoses[n + 1].push_back(internalPos);\n            }\n            tessAddContour(tess.get(), 3, holeArray.data(), sizeof(double) * 3, static_cast<unsigned int>(hole.size()));\n        }\n    \n        \/\/ Triangulate\n        double normal[3] = { 0, 0, 1 };\n        if (!tessTesselate(tess.get(), TESS_WINDING_ODD, TESS_POLYGONS, 3, 3, normal)) {\n            Log::Error(\"Polygon3DDrawData::Polygon3DDrawData: Failed to triangulate 3d polygon!\");\n            return;\n        }\n        const double* roofCoords = tessGetVertices(tess.get());\n        const int* roofElements = tessGetElements(tess.get());\n        std::size_t roofVertexCount = tessGetVertexCount(tess.get());\n        std::size_t roofElementCount = tessGetElementCount(tess.get());\n    \n        \/\/ Do projection-surface based tesselation\n        std::vector<MapPos> roofInternalPoses;\n        roofInternalPoses.reserve(roofVertexCount);\n        for (std::size_t i = 0; i < roofVertexCount; i++) {\n            roofInternalPoses.emplace_back(roofCoords[i * 3 + 0], roofCoords[i * 3 + 1], roofCoords[i * 3 + 2]);\n        }\n        std::vector<unsigned int> roofIndices;\n        roofIndices.reserve(roofElementCount * 3);\n        for (std::size_t i = 0; i < roofElementCount * 3; i += 3) {\n            unsigned int i0 = roofElements[i + 0];\n            unsigned int i1 = roofElements[i + 1];\n            unsigned int i2 = roofElements[i + 2];\n            if (i0 != TESS_UNDEF && i1 != TESS_UNDEF && i2 != TESS_UNDEF) {\n                projectionSurface.tesselateTriangle(i0, i1, i2, roofIndices, roofInternalPoses);\n            }\n        }\n\n        \/\/ Tesselate rings\n        for (std::vector<MapPos>& ringInternalPoses : ringsInternalPoses) {\n            std::vector<MapPos> tesselatedPoses;\n            tesselatedPoses.reserve(ringInternalPoses.size());\n            for (std::size_t i = 0; i < ringInternalPoses.size(); i++) {\n                if (!tesselatedPoses.empty()) {\n                    tesselatedPoses.pop_back();\n                }\n                projectionSurface.tesselateSegment(ringInternalPoses[i], ringInternalPoses[(i + 1) % ringInternalPoses.size()], tesselatedPoses);\n            }\n            std::swap(ringInternalPoses, tesselatedPoses);\n        }\n        \n        \/\/ Reserve space for roof and sides\n        std::size_t edgeVertexCount = std::accumulate(ringsInternalPoses.begin(), ringsInternalPoses.end(), std::size_t(0), [](std::size_t count, const std::vector<MapPos>& ringInternalPoses) { return count + ringInternalPoses.size(); });\n        _coords.reserve(roofIndices.size() + edgeVertexCount * 6);\n        _normals.reserve(roofIndices.size() + edgeVertexCount * 6);\n        \n        \/\/ Convert triangulator output to coord array\n        for (std::size_t i = 0; i < roofIndices.size(); i++) {\n            std::size_t index = roofIndices[i];\n            _coords.push_back(projectionSurface.calculatePosition(roofInternalPoses[index]));\n            _normals.push_back(cglib::vec3<float>::convert(projectionSurface.calculateNormal(roofInternalPoses[index])));\n            _attribs.push_back(1);\n        }\n        \n        \/\/ Calculate sides\n        for (std::size_t n = 0; n < ringsInternalPoses.size(); n++) {\n            const std::vector<MapPos>& ringInternalPoses = ringsInternalPoses[n];\n\n            \/\/ Calculate vertex orientation of the polygon\n            bool clockWise = GeomUtils::IsConcavePolygonClockwise(ringInternalPoses);\n            \/\/ If calculating a whole, reverse the direction\n            bool flipOrder = (n > 0 ? !clockWise : clockWise);\n            \n            for (std::size_t j = 1; j < ringInternalPoses.size(); j++) {\n                const MapPos& internalPos0 = ringInternalPoses[(flipOrder ? j : j - 1)];\n                const MapPos& internalPos1 = ringInternalPoses[(flipOrder ? j - 1 : j)];\n                cglib::vec3<double> p0r = projectionSurface.calculatePosition(internalPos0);\n                cglib::vec3<double> p1r = projectionSurface.calculatePosition(internalPos1);\n                cglib::vec3<double> p0b = projectionSurface.calculatePosition(MapPos(internalPos0.getX(), internalPos0.getY(), 0));\n                cglib::vec3<double> p1b = projectionSurface.calculatePosition(MapPos(internalPos1.getX(), internalPos1.getY(), 0));\n\n                \/\/ Add coordinates for 2 triangles\n                _coords.push_back(p0r);\n                _coords.push_back(p0b);\n                _coords.push_back(p1r);\n                _coords.push_back(p0b);\n                _coords.push_back(p1b);\n                _coords.push_back(p1r);\n\n                \/\/ Calculate side normal\n                cglib::vec3<double> normal = projectionSurface.calculateNormal(internalPos0);\n                cglib::vec3<double> sideVec = projectionSurface.calculateVector(internalPos0, internalPos1 - internalPos0);\n                cglib::vec3<float> sideNormal = cglib::vec3<float>::convert(cglib::unit(cglib::vector_product(sideVec, normal)));\n\n                \/\/ Add normal for each vertex\n                for (int k = 0; k < 6; k++) {\n                    _normals.push_back(sideNormal);\n                    _attribs.push_back(0);\n                }\n            }\n        }\n\n        \/\/ Update bounding box based on calculated coordinates\n        _boundingBox.add(_coords.begin(), _coords.end());\n        \n        \/\/ Do sanity check on the size\n        if (_coords.size() > GLContext::MAX_VERTEXBUFFER_SIZE) {\n            Log::Error(\"Polygon3DDrawData::Polygon3DDrawData: Maximum buffer size exceeded, 3d polygon can't be drawn\");\n        }\n    }\n    \n    Polygon3DDrawData::~Polygon3DDrawData() {\n    }\n\n    const Color& Polygon3DDrawData::getSideColor() const {\n        return _sideColor;\n    }\n    \n    const cglib::bbox3<double>& Polygon3DDrawData::getBoundingBox() const {\n        return _boundingBox;\n    }\n\n    const std::vector<cglib::vec3<double> >& Polygon3DDrawData::getCoords() const {\n        return _coords;\n    }\n    \n    const std::vector<cglib::vec3<float> >& Polygon3DDrawData::getNormals() const {\n        return _normals;\n    }\n    \n    const std::vector<unsigned char>& Polygon3DDrawData::getAttribs() const {\n        return _attribs;\n    }\n    \n    void Polygon3DDrawData::offsetHorizontally(double offset) {\n        for (cglib::vec3<double>& pos : _coords) {\n            pos(0) += offset;\n        }\n        setIsOffset(true);\n    }\n    \n}\n<commit_msg>Missing reserve<commit_after>#include \"Polygon3DDrawData.h\"\n#include \"core\/MapPos.h\"\n#include \"geometry\/PolygonGeometry.h\"\n#include \"graphics\/utils\/GLContext.h\"\n#include \"projections\/Projection.h\"\n#include \"projections\/ProjectionSurface.h\"\n#include \"styles\/Polygon3DStyle.h\"\n#include \"utils\/Const.h\"\n#include \"utils\/GeomUtils.h\"\n#include \"utils\/Log.h\"\n#include \"vectorelements\/Polygon3D.h\"\n\n#include <cmath>\n#include <cstdlib>\n#include <numeric>\n\n#include <tesselator.h>\n\nnamespace carto {\n\n    Polygon3DDrawData::Polygon3DDrawData(const Polygon3D& polygon3D, const Polygon3DStyle& style, const Projection& projection, const ProjectionSurface& projectionSurface) :\n        VectorElementDrawData(style.getColor()),\n        _sideColor(GetPremultipliedColor(style.getSideColor())),\n        _boundingBox(cglib::bbox3<double>::smallest()),\n        _coords(),\n        _normals(),\n        _attribs()\n    {\n        const std::vector<MapPos>& poses = polygon3D.getGeometry()->getPoses();\n        const std::vector<std::vector<MapPos> >& holes = polygon3D.getGeometry()->getHoles();\n        float height = polygon3D.getHeight();\n        \n        \/\/ Create tesselator\n        TESSalloc ma;\n        ma.memalloc = [](void* userData, unsigned int size) { return malloc(size); };\n        ma.memfree = [](void* userData, void* ptr) { free(ptr); };\n        ma.extraVertices = 256;\n        TESStesselator* tessPtr = tessNewTess(&ma);\n        if (!tessPtr) {\n            Log::Error(\"Polygon3DDrawData::Polygon3DDrawData: Failed to created tesselator!\");\n            return;\n        }\n        std::shared_ptr<TESStesselator> tess(tessPtr, tessDeleteTess);\n    \n        \/\/ Prepare polygon exterior\n        std::vector<std::vector<MapPos> > ringsInternalPoses(1 + holes.size());\n        ringsInternalPoses[0].reserve(poses.size());\n        \n        std::vector<double> posesArray(poses.size() * 3);\n        for (std::size_t i = 0; i < poses.size(); i++) {\n            MapPos pos = poses[i];\n            pos.setZ(height);\n            MapPos internalPos = projection.toInternal(pos);\n            posesArray[i * 3 + 0] = internalPos.getX();\n            posesArray[i * 3 + 1] = internalPos.getY();\n            posesArray[i * 3 + 2] = internalPos.getZ();\n            ringsInternalPoses[0].push_back(internalPos);\n        }\n        tessAddContour(tess.get(), 3, posesArray.data(), sizeof(double) * 3, static_cast<unsigned int>(poses.size()));\n    \n        \/\/ Prepare polygon holes\n        std::vector<std::vector<double> > holesArray(holes.size());\n        for (std::size_t n = 0; n < holes.size(); n++) {\n            const std::vector<MapPos>& hole = holes[n];\n            std::vector<double>& holeArray = holesArray[n];\n            holeArray.resize(hole.size() * 3);\n            for (std::size_t i = 0; i < hole.size(); i++) {\n                MapPos pos = hole[i];\n                pos.setZ(height);\n                MapPos internalPos = projection.toInternal(pos);\n                holeArray[i * 3 + 0] = internalPos.getX();\n                holeArray[i * 3 + 1] = internalPos.getY();\n                holeArray[i * 3 + 2] = internalPos.getZ();\n                ringsInternalPoses[n + 1].push_back(internalPos);\n            }\n            tessAddContour(tess.get(), 3, holeArray.data(), sizeof(double) * 3, static_cast<unsigned int>(hole.size()));\n        }\n    \n        \/\/ Triangulate\n        double normal[3] = { 0, 0, 1 };\n        if (!tessTesselate(tess.get(), TESS_WINDING_ODD, TESS_POLYGONS, 3, 3, normal)) {\n            Log::Error(\"Polygon3DDrawData::Polygon3DDrawData: Failed to triangulate 3d polygon!\");\n            return;\n        }\n        const double* roofCoords = tessGetVertices(tess.get());\n        const int* roofElements = tessGetElements(tess.get());\n        std::size_t roofVertexCount = tessGetVertexCount(tess.get());\n        std::size_t roofElementCount = tessGetElementCount(tess.get());\n    \n        \/\/ Do projection-surface based tesselation\n        std::vector<MapPos> roofInternalPoses;\n        roofInternalPoses.reserve(roofVertexCount);\n        for (std::size_t i = 0; i < roofVertexCount; i++) {\n            roofInternalPoses.emplace_back(roofCoords[i * 3 + 0], roofCoords[i * 3 + 1], roofCoords[i * 3 + 2]);\n        }\n        std::vector<unsigned int> roofIndices;\n        roofIndices.reserve(roofElementCount * 3);\n        for (std::size_t i = 0; i < roofElementCount * 3; i += 3) {\n            unsigned int i0 = roofElements[i + 0];\n            unsigned int i1 = roofElements[i + 1];\n            unsigned int i2 = roofElements[i + 2];\n            if (i0 != TESS_UNDEF && i1 != TESS_UNDEF && i2 != TESS_UNDEF) {\n                projectionSurface.tesselateTriangle(i0, i1, i2, roofIndices, roofInternalPoses);\n            }\n        }\n\n        \/\/ Tesselate rings\n        for (std::vector<MapPos>& ringInternalPoses : ringsInternalPoses) {\n            std::vector<MapPos> tesselatedPoses;\n            tesselatedPoses.reserve(ringInternalPoses.size());\n            for (std::size_t i = 0; i < ringInternalPoses.size(); i++) {\n                if (!tesselatedPoses.empty()) {\n                    tesselatedPoses.pop_back();\n                }\n                projectionSurface.tesselateSegment(ringInternalPoses[i], ringInternalPoses[(i + 1) % ringInternalPoses.size()], tesselatedPoses);\n            }\n            std::swap(ringInternalPoses, tesselatedPoses);\n        }\n        \n        \/\/ Reserve space for roof and sides\n        std::size_t edgeVertexCount = std::accumulate(ringsInternalPoses.begin(), ringsInternalPoses.end(), std::size_t(0), [](std::size_t count, const std::vector<MapPos>& ringInternalPoses) { return count + ringInternalPoses.size(); });\n        _coords.reserve(roofIndices.size() + edgeVertexCount * 6);\n        _normals.reserve(roofIndices.size() + edgeVertexCount * 6);\n        _attribs.reserve(roofIndices.size() + edgeVertexCount * 6);\n        \n        \/\/ Convert triangulator output to coord array\n        for (std::size_t i = 0; i < roofIndices.size(); i++) {\n            std::size_t index = roofIndices[i];\n            _coords.push_back(projectionSurface.calculatePosition(roofInternalPoses[index]));\n            _normals.push_back(cglib::vec3<float>::convert(projectionSurface.calculateNormal(roofInternalPoses[index])));\n            _attribs.push_back(1);\n        }\n        \n        \/\/ Calculate sides\n        for (std::size_t n = 0; n < ringsInternalPoses.size(); n++) {\n            const std::vector<MapPos>& ringInternalPoses = ringsInternalPoses[n];\n\n            \/\/ Calculate vertex orientation of the polygon\n            bool clockWise = GeomUtils::IsConcavePolygonClockwise(ringInternalPoses);\n            \/\/ If calculating a whole, reverse the direction\n            bool flipOrder = (n > 0 ? !clockWise : clockWise);\n            \n            for (std::size_t j = 1; j < ringInternalPoses.size(); j++) {\n                const MapPos& internalPos0 = ringInternalPoses[(flipOrder ? j : j - 1)];\n                const MapPos& internalPos1 = ringInternalPoses[(flipOrder ? j - 1 : j)];\n                cglib::vec3<double> p0r = projectionSurface.calculatePosition(internalPos0);\n                cglib::vec3<double> p1r = projectionSurface.calculatePosition(internalPos1);\n                cglib::vec3<double> p0b = projectionSurface.calculatePosition(MapPos(internalPos0.getX(), internalPos0.getY(), 0));\n                cglib::vec3<double> p1b = projectionSurface.calculatePosition(MapPos(internalPos1.getX(), internalPos1.getY(), 0));\n\n                \/\/ Add coordinates for 2 triangles\n                _coords.push_back(p0r);\n                _coords.push_back(p0b);\n                _coords.push_back(p1r);\n                _coords.push_back(p0b);\n                _coords.push_back(p1b);\n                _coords.push_back(p1r);\n\n                \/\/ Calculate side normal\n                cglib::vec3<double> normal = projectionSurface.calculateNormal(internalPos0);\n                cglib::vec3<double> sideVec = projectionSurface.calculateVector(internalPos0, internalPos1 - internalPos0);\n                cglib::vec3<float> sideNormal = cglib::vec3<float>::convert(cglib::unit(cglib::vector_product(sideVec, normal)));\n\n                \/\/ Add normal for each vertex\n                for (int k = 0; k < 6; k++) {\n                    _normals.push_back(sideNormal);\n                    _attribs.push_back(0);\n                }\n            }\n        }\n\n        \/\/ Update bounding box based on calculated coordinates\n        _boundingBox.add(_coords.begin(), _coords.end());\n        \n        \/\/ Do sanity check on the size\n        if (_coords.size() > GLContext::MAX_VERTEXBUFFER_SIZE) {\n            Log::Error(\"Polygon3DDrawData::Polygon3DDrawData: Maximum buffer size exceeded, 3d polygon can't be drawn\");\n        }\n    }\n    \n    Polygon3DDrawData::~Polygon3DDrawData() {\n    }\n\n    const Color& Polygon3DDrawData::getSideColor() const {\n        return _sideColor;\n    }\n    \n    const cglib::bbox3<double>& Polygon3DDrawData::getBoundingBox() const {\n        return _boundingBox;\n    }\n\n    const std::vector<cglib::vec3<double> >& Polygon3DDrawData::getCoords() const {\n        return _coords;\n    }\n    \n    const std::vector<cglib::vec3<float> >& Polygon3DDrawData::getNormals() const {\n        return _normals;\n    }\n    \n    const std::vector<unsigned char>& Polygon3DDrawData::getAttribs() const {\n        return _attribs;\n    }\n    \n    void Polygon3DDrawData::offsetHorizontally(double offset) {\n        for (cglib::vec3<double>& pos : _coords) {\n            pos(0) += offset;\n        }\n        setIsOffset(true);\n    }\n    \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2015 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#if defined(GRID_RENDERER)\n\n\/\/ mapnik\n#include <mapnik\/debug.hpp>\n#include <mapnik\/feature.hpp>\n#include <mapnik\/grid\/grid_rasterizer.hpp>\n#include <mapnik\/grid\/grid_renderer.hpp>\n#include <mapnik\/grid\/grid_renderer_base.hpp>\n#include <mapnik\/grid\/grid.hpp>\n#include <mapnik\/marker.hpp>\n#include <mapnik\/marker_cache.hpp>\n#include <mapnik\/vertex_converters.hpp>\n#include <mapnik\/vertex_processor.hpp>\n#include <mapnik\/parse_path.hpp>\n#include <mapnik\/renderer_common\/apply_vertex_converter.hpp>\n\n#pragma GCC diagnostic push\n#include <mapnik\/warning_ignore_agg.hpp>\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_scanline_bin.h\"\n#include \"agg_conv_stroke.h\"\n#include \"agg_conv_dash.h\"\n#pragma GCC diagnostic pop\n\n\/\/ stl\n#include <string>\n\nnamespace mapnik {\n\ntemplate <typename T>\nvoid grid_renderer<T>::process(line_pattern_symbolizer const& sym,\n                               mapnik::feature_impl & feature,\n                               proj_transform const& prj_trans)\n{\n    std::string filename = get<std::string, keys::file>(sym, feature, common_.vars_);\n    if (filename.empty()) return;\n    std::shared_ptr<mapnik::marker const> mark = marker_cache::instance().find(filename, true);\n    if (mark->is<mapnik::marker_null>()) return;\n\n    if (!mark->is<mapnik::marker_rgba8>())\n    {\n        MAPNIK_LOG_DEBUG(agg_renderer) << \"agg_renderer: Only images (not '\" << filename << \"') are supported in the line_pattern_symbolizer\";\n        return;\n    }\n\n    value_bool clip = get<value_bool, keys::clip>(sym, feature, common_.vars_);\n    value_double offset = get<value_double, keys::offset>(sym, feature, common_.vars_);\n    value_double simplify_tolerance = get<value_double, keys::simplify_tolerance>(sym, feature, common_.vars_);\n    value_double smooth = get<value_double, keys::smooth>(sym, feature, common_.vars_);\n\n    using pixfmt_type = typename grid_renderer_base_type::pixfmt_type;\n    using color_type = typename grid_renderer_base_type::pixfmt_type::color_type;\n    using renderer_type = agg::renderer_scanline_bin_solid<grid_renderer_base_type>;\n\n    agg::scanline_bin sl;\n\n    grid_rendering_buffer buf(pixmap_.raw_data(), common_.width_, common_.height_, common_.width_);\n    pixfmt_type pixf(buf);\n\n    grid_renderer_base_type renb(pixf);\n    renderer_type ren(renb);\n\n    ras_ptr->reset();\n\n    std::size_t stroke_width = mark->width();\n\n    agg::trans_affine tr;\n    auto transform = get_optional<transform_type>(sym, keys::geometry_transform);\n    if (transform)\n    {\n        evaluate_transform(tr, feature, common_.vars_, *transform, common_.scale_factor_);\n    }\n\n    box2d<double> clipping_extent = common_.query_extent_;\n    if (clip)\n    {\n        double pad_per_pixel = static_cast<double>(common_.query_extent_.width()\/common_.width_);\n        double pixels = std::ceil(std::max(stroke_width \/ 2.0 + std::fabs(offset),\n                                          (std::fabs(offset) * offset_converter_default_threshold)));\n        double padding = pad_per_pixel * pixels * common_.scale_factor_;\n\n        clipping_extent.pad(padding);\n    }\n\n    \/\/ to avoid the complexity of using an agg pattern filter instead\n    \/\/ we create a line_symbolizer in order to fake the pattern\n    line_symbolizer line;\n    put<value_double>(line, keys::stroke_width, value_double(stroke_width));\n    \/\/ TODO: really should pass the offset to the fake line too, but\n    \/\/ this wasn't present in the previous version and makes the test\n    \/\/ fail - in this case, probably the test should be updated.\n    \/\/put<value_double>(line, keys::offset, value_double(offset));\n    put<value_double>(line, keys::simplify_tolerance, value_double(simplify_tolerance));\n    put<value_double>(line, keys::smooth, value_double(smooth));\n\n    using vertex_converter_type = vertex_converter<clip_line_tag, transform_tag,\n                                                   affine_transform_tag,\n                                                   simplify_tag,smooth_tag,\n                                                   offset_transform_tag,stroke_tag>;\n    vertex_converter_type converter(clipping_extent,line,common_.t_,prj_trans,tr,feature,common_.vars_,common_.scale_factor_);\n    if (clip) converter.set<clip_line_tag>();\n    converter.set<transform_tag>(); \/\/ always transform\n    if (std::fabs(offset) > 0.0) converter.set<offset_transform_tag>(); \/\/ parallel offset\n    converter.set<affine_transform_tag>(); \/\/ optional affine transform\n    if (simplify_tolerance > 0.0) converter.set<simplify_tag>(); \/\/ optional simplify converter\n    if (smooth > 0.0) converter.set<smooth_tag>(); \/\/ optional smooth converter\n    converter.set<stroke_tag>(); \/\/always stroke\n    using apply_vertex_converter_type = detail::apply_vertex_converter<vertex_converter_type,grid_rasterizer>;\n    using vertex_processor_type = geometry::vertex_processor<apply_vertex_converter_type>;\n    apply_vertex_converter_type apply(converter, *ras_ptr);\n    mapnik::util::apply_visitor(vertex_processor_type(apply),feature.get_geometry());\n\n    \/\/ render id\n    ren.color(color_type(feature.id()));\n    agg::render_scanlines(*ras_ptr, sl, ren);\n\n    \/\/ add feature properties to grid cache\n    pixmap_.add_feature(feature);\n\n}\n\n\ntemplate void grid_renderer<grid>::process(line_pattern_symbolizer const&,\n                                           mapnik::feature_impl &,\n                                           proj_transform const&);\n\n}\n\n#endif\n<commit_msg>Polygon pattern on line geometries for Grid backend<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2015 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#if defined(GRID_RENDERER)\n\n\/\/ mapnik\n#include <mapnik\/debug.hpp>\n#include <mapnik\/feature.hpp>\n#include <mapnik\/grid\/grid_rasterizer.hpp>\n#include <mapnik\/grid\/grid_renderer.hpp>\n#include <mapnik\/grid\/grid_renderer_base.hpp>\n#include <mapnik\/grid\/grid.hpp>\n#include <mapnik\/marker.hpp>\n#include <mapnik\/marker_cache.hpp>\n#include <mapnik\/vertex_converters.hpp>\n#include <mapnik\/vertex_processor.hpp>\n#include <mapnik\/parse_path.hpp>\n#include <mapnik\/renderer_common\/apply_vertex_converter.hpp>\n\n#pragma GCC diagnostic push\n#include <mapnik\/warning_ignore_agg.hpp>\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_scanline_bin.h\"\n#include \"agg_conv_stroke.h\"\n#include \"agg_conv_dash.h\"\n#pragma GCC diagnostic pop\n\n\/\/ stl\n#include <string>\n\nnamespace mapnik {\n\ntemplate <typename T>\nvoid grid_renderer<T>::process(line_pattern_symbolizer const& sym,\n                               mapnik::feature_impl & feature,\n                               proj_transform const& prj_trans)\n{\n    std::string filename = get<std::string, keys::file>(sym, feature, common_.vars_);\n    if (filename.empty()) return;\n    std::shared_ptr<mapnik::marker const> mark = marker_cache::instance().find(filename, true);\n    if (mark->is<mapnik::marker_null>()) return;\n\n    if (!mark->is<mapnik::marker_rgba8>())\n    {\n        MAPNIK_LOG_DEBUG(agg_renderer) << \"agg_renderer: Only images (not '\" << filename << \"') are supported in the line_pattern_symbolizer\";\n        return;\n    }\n\n    value_bool clip = get<value_bool, keys::clip>(sym, feature, common_.vars_);\n    value_double offset = get<value_double, keys::offset>(sym, feature, common_.vars_);\n    value_double simplify_tolerance = get<value_double, keys::simplify_tolerance>(sym, feature, common_.vars_);\n    value_double smooth = get<value_double, keys::smooth>(sym, feature, common_.vars_);\n\n    using pixfmt_type = typename grid_renderer_base_type::pixfmt_type;\n    using color_type = typename grid_renderer_base_type::pixfmt_type::color_type;\n    using renderer_type = agg::renderer_scanline_bin_solid<grid_renderer_base_type>;\n\n    agg::scanline_bin sl;\n\n    grid_rendering_buffer buf(pixmap_.raw_data(), common_.width_, common_.height_, common_.width_);\n    pixfmt_type pixf(buf);\n\n    grid_renderer_base_type renb(pixf);\n    renderer_type ren(renb);\n\n    ras_ptr->reset();\n\n    line_pattern_enum pattern = get<line_pattern_enum, keys::line_pattern>(sym, feature, common_.vars_);\n    std::size_t stroke_width = (pattern == LINE_PATTERN_WARP) ? mark->width() :\n        get<value_double, keys::stroke_width>(sym, feature, common_.vars_);\n\n    agg::trans_affine tr;\n    auto transform = get_optional<transform_type>(sym, keys::geometry_transform);\n    if (transform)\n    {\n        evaluate_transform(tr, feature, common_.vars_, *transform, common_.scale_factor_);\n    }\n\n    box2d<double> clipping_extent = common_.query_extent_;\n    if (clip)\n    {\n        double pad_per_pixel = static_cast<double>(common_.query_extent_.width()\/common_.width_);\n        double pixels = std::ceil(std::max(stroke_width \/ 2.0 + std::fabs(offset),\n                                          (std::fabs(offset) * offset_converter_default_threshold)));\n        double padding = pad_per_pixel * pixels * common_.scale_factor_;\n\n        clipping_extent.pad(padding);\n    }\n\n    \/\/ to avoid the complexity of using an agg pattern filter instead\n    \/\/ we create a line_symbolizer in order to fake the pattern\n    line_symbolizer line;\n    put<value_double>(line, keys::stroke_width, value_double(stroke_width));\n    \/\/ TODO: really should pass the offset to the fake line too, but\n    \/\/ this wasn't present in the previous version and makes the test\n    \/\/ fail - in this case, probably the test should be updated.\n    \/\/put<value_double>(line, keys::offset, value_double(offset));\n    put<value_double>(line, keys::simplify_tolerance, value_double(simplify_tolerance));\n    put<value_double>(line, keys::smooth, value_double(smooth));\n\n    using vertex_converter_type = vertex_converter<clip_line_tag, transform_tag,\n                                                   affine_transform_tag,\n                                                   simplify_tag,smooth_tag,\n                                                   offset_transform_tag,stroke_tag>;\n    vertex_converter_type converter(clipping_extent,line,common_.t_,prj_trans,tr,feature,common_.vars_,common_.scale_factor_);\n    if (clip) converter.set<clip_line_tag>();\n    converter.set<transform_tag>(); \/\/ always transform\n    if (std::fabs(offset) > 0.0) converter.set<offset_transform_tag>(); \/\/ parallel offset\n    converter.set<affine_transform_tag>(); \/\/ optional affine transform\n    if (simplify_tolerance > 0.0) converter.set<simplify_tag>(); \/\/ optional simplify converter\n    if (smooth > 0.0) converter.set<smooth_tag>(); \/\/ optional smooth converter\n    converter.set<stroke_tag>(); \/\/always stroke\n    using apply_vertex_converter_type = detail::apply_vertex_converter<vertex_converter_type,grid_rasterizer>;\n    using vertex_processor_type = geometry::vertex_processor<apply_vertex_converter_type>;\n    apply_vertex_converter_type apply(converter, *ras_ptr);\n    mapnik::util::apply_visitor(vertex_processor_type(apply),feature.get_geometry());\n\n    \/\/ render id\n    ren.color(color_type(feature.id()));\n    agg::render_scanlines(*ras_ptr, sl, ren);\n\n    \/\/ add feature properties to grid cache\n    pixmap_.add_feature(feature);\n\n}\n\n\ntemplate void grid_renderer<grid>::process(line_pattern_symbolizer const&,\n                                           mapnik::feature_impl &,\n                                           proj_transform const&);\n\n}\n\n#endif\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\n#include <QtGui>\n#include \"mediaplayer.h\"\n\nint main (int argc, char *argv[])\n{\n    Q_INIT_RESOURCE(mediaplayer);\n    QApplication app(argc, argv);\n    app.setApplicationName(\"Media Player\");\n    app.setOrganizationName(\"Qt\");\n    app.setQuitOnLastWindowClosed(true);\n\n    QString fileString = app.arguments().value(1);\n\n    bool hasSmallScreen =\n#ifdef Q_OS_SYMBIAN\n        \/* On Symbian, we always want fullscreen. One reason is that it's not\n         * possible to launch any demos from the fluidlauncher due to a\n         * limitation in the emulator. *\/\n        true\n#else\n        false\n#endif\n    ;\n\n    const QStringList args(app.arguments());\n    for (int i = 0; i < args.count(); ++i) {\n        if (args.at(i) == QLatin1String(\"-small-screen\"))\n            hasSmallScreen = true;\n    }\n\n    MediaPlayer player(fileString, hasSmallScreen);\n\n    if (hasSmallScreen)\n        player.showMaximized();\n    else\n        player.show();\n\n    return app.exec();\n}\n\n<commit_msg>Ensure we can handle file names on the cmdline too.<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\n#include <QtGui>\n#include \"mediaplayer.h\"\n\nint main (int argc, char *argv[])\n{\n    Q_INIT_RESOURCE(mediaplayer);\n    QApplication app(argc, argv);\n    app.setApplicationName(\"Media Player\");\n    app.setOrganizationName(\"Qt\");\n    app.setQuitOnLastWindowClosed(true);\n\n    bool hasSmallScreen =\n#ifdef Q_OS_SYMBIAN\n        \/* On Symbian, we always want fullscreen. One reason is that it's not\n         * possible to launch any demos from the fluidlauncher due to a\n         * limitation in the emulator. *\/\n        true\n#else\n        false\n#endif\n    ;\n\n    QString fileString;\n    const QStringList args(app.arguments());\n    \/* We have a minor problem here, we accept two arguments, both are\n     * optional:\n     * - A file name\n     * - the option \"-small-screen\", so let's try to cope with that.\n     *\/\n    for (int i = 0; i < args.count(); ++i) {\n        const QString &at = args.at(i);\n\n        if (at == QLatin1String(\"-small-screen\"))\n            hasSmallScreen = true;\n        else if (i > 0) \/\/ We don't want the app name.\n            fileString = at;\n    }\n\n    MediaPlayer player(fileString, hasSmallScreen);\n\n    if (hasSmallScreen)\n        player.showMaximized();\n    else\n        player.show();\n\n    return app.exec();\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\/target_types.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 target_types.H\n * @brief definitions for fapi2 target types\n *\/\n\n#ifndef __FAPI2_TARGET_TYPES__\n#define __FAPI2_TARGET_TYPES__\n#include <stdint.h>\n\n\/\/\/ FAPI namespace\nnamespace fapi2\n{\n\/\/\/\n\/\/\/ @enum fapi::TargetType\n\/\/\/ @brief Types, kinds, of targets\n\/\/\/ @note TYPE_NONE is used to represent empty\/NULL targets in lists\n\/\/\/ or tables. TYPE_ALL is used to pass targets to methods which\n\/\/\/ can act generally on any type of target\n\/\/\/\n\n\/\/\/ Target Kind\nenum TargetType : uint64_t\n{\n    TARGET_TYPE_NONE          = 0x0000000000000000, \/\/\/< No type\n    TARGET_TYPE_SYSTEM        = 0x0000000000000001, \/\/\/< System type\n    TARGET_TYPE_DIMM          = 0x0000000000000002, \/\/\/< DIMM type\n    TARGET_TYPE_PROC_CHIP     = 0x0000000000000004, \/\/\/< Processor type\n    TARGET_TYPE_MEMBUF_CHIP   = 0x0000000000000008, \/\/\/< Membuf type\n    TARGET_TYPE_EX            = 0x0000000000000010, \/\/\/< EX - 2x Core, L2, L3 - can be deconfigured\n    TARGET_TYPE_MBA           = 0x0000000000000020, \/\/\/< MBA type\n    TARGET_TYPE_MCS           = 0x0000000000000040, \/\/\/< MCS type\n    TARGET_TYPE_XBUS          = 0x0000000000000080, \/\/\/< XBUS type\n    TARGET_TYPE_ABUS          = 0x0000000000000100, \/\/\/< ABUS type\n    TARGET_TYPE_L4            = 0x0000000000000200, \/\/\/< L4 type\n    TARGET_TYPE_CORE          = 0x0000000000000400, \/\/\/< Core\n    TARGET_TYPE_EQ            = 0x0000000000000800, \/\/\/< EQ - 4x core, 2x L2, 2x L3 - can be deconfigured\n    TARGET_TYPE_MCA           = 0x0000000000001000, \/\/\/< MCA type\n    TARGET_TYPE_MCBIST        = 0x0000000000002000, \/\/\/< MCBIST type\n    TARGET_TYPE_MI            = 0x0000000000004000, \/\/\/< MI Memory Interface (Cumulus)\n    TARGET_TYPE_CAPP          = 0x0000000000008000, \/\/\/< CAPP target\n    TARGET_TYPE_DMI           = 0x0000000000010000, \/\/\/< DMI type\n    TARGET_TYPE_OBUS          = 0x0000000000020000, \/\/\/< OBUS type\n    TARGET_TYPE_OBUS_BRICK    = 0x0000000000040000, \/\/\/< OBUS BRICK type\n    TARGET_TYPE_SBE           = 0x0000000000080000, \/\/\/< SBE type\n    TARGET_TYPE_PPE           = 0x0000000000100000, \/\/\/< PPE type\n    TARGET_TYPE_PERV          = 0x0000000000200000, \/\/\/< Pervasive type\n    TARGET_TYPE_PEC           = 0x0000000000400000, \/\/\/< PEC type\n    TARGET_TYPE_PHB           = 0x0000000000800000, \/\/\/< PHB type\n    TARGET_TYPE_MC            = 0x0000000001000000, \/\/\/< MC type\n    TARGET_TYPE_OMI           = 0x0000000002000000, \/\/\/< OMI type\n    TARGET_TYPE_OMIC          = 0x0000000004000000, \/\/\/< OMIC type\n    TARGET_TYPE_MCC           = 0x0000000008000000, \/\/\/< MCC type\n    TARGET_TYPE_OCMB_CHIP     = 0x0000000010000000, \/\/\/< OCMB type\n    TARGET_TYPE_MEM_PORT      = 0x0000000020000000, \/\/\/< MEM_PORT type\n    TARGET_TYPE_NMMU          = 0x0000000040000000, \/\/\/< NEST MMU type\n    TARGET_TYPE_RESERVED      = 0x0000000080000000, \/\/\/< Reserved for Cronus (Z)\n    TARGET_TYPE_PAU           = 0x0000000100000000, \/\/\/< PAU type\n    TARGET_TYPE_IOHS          = 0x0000000200000000, \/\/\/< IOHS type\n    TARGET_TYPE_FC            = 0x0000000400000000, \/\/\/< Fused Core type\n    TARGET_TYPE_PMIC          = 0x0000000800000000, \/\/\/< PMIC type\n    TARGET_TYPE_PAUC          = 0x0000001000000000, \/\/\/< PAUC type\n    TARGET_TYPE_MULTICAST     = 0x8000000000000000, \/\/\/< MULTICAST type\n    TARGET_TYPE_ALL           = 0x7FFFFFFFFFFFFFFF, \/\/\/< Any\/All types\n    TARGET_TYPE_ALL_MC        = 0xFFFFFFFFFFFFFFFF, \/\/\/< Any\/All types + Multicast\n\n    \/\/ Compound target types\n    TARGET_TYPE_CHIPS         = TARGET_TYPE_PROC_CHIP |\n                                TARGET_TYPE_MEMBUF_CHIP |\n                                TARGET_TYPE_OCMB_CHIP,\n\n    TARGET_TYPE_CHIPLETS      = TARGET_TYPE_EX            |\n                                TARGET_TYPE_MBA           |\n                                TARGET_TYPE_MCS           |\n                                TARGET_TYPE_XBUS          |\n                                TARGET_TYPE_ABUS          |\n                                TARGET_TYPE_L4            |\n                                TARGET_TYPE_CORE          |\n                                TARGET_TYPE_EQ            |\n                                TARGET_TYPE_MCA           |\n                                TARGET_TYPE_MCBIST        |\n                                TARGET_TYPE_MI            |\n                                TARGET_TYPE_DMI           |\n                                TARGET_TYPE_OBUS          |\n                                TARGET_TYPE_OBUS_BRICK    |\n                                TARGET_TYPE_SBE           |\n                                TARGET_TYPE_PPE           |\n                                TARGET_TYPE_PERV          |\n                                TARGET_TYPE_PEC           |\n                                TARGET_TYPE_PHB           |\n                                TARGET_TYPE_MC            |\n                                TARGET_TYPE_OMI           |\n                                TARGET_TYPE_OMIC          |\n                                TARGET_TYPE_MCC           |\n                                TARGET_TYPE_MEM_PORT      |\n                                TARGET_TYPE_NMMU          |\n                                TARGET_TYPE_PAU           |\n                                TARGET_TYPE_IOHS          |\n                                TARGET_TYPE_FC            |\n                                TARGET_TYPE_PAUC,\n\n    TARGET_TYPE_MULTICASTABLE = TARGET_TYPE_CORE   |\n                                TARGET_TYPE_EQ     |\n                                TARGET_TYPE_MCBIST |\n                                TARGET_TYPE_OBUS   |\n                                TARGET_TYPE_PERV   |\n                                TARGET_TYPE_PEC,\n\n    \/\/ Mappings to target types found in the error xml files\n    TARGET_TYPE_EX_CHIPLET    = TARGET_TYPE_EX,\n    TARGET_TYPE_MBA_CHIPLET   = TARGET_TYPE_MBA,\n    TARGET_TYPE_MCS_CHIPLET   = TARGET_TYPE_MCS,\n    TARGET_TYPE_XBUS_ENDPOINT = TARGET_TYPE_XBUS,\n    TARGET_TYPE_ABUS_ENDPOINT = TARGET_TYPE_ABUS,\n};\n\n\/\/\/\n\/\/\/ Target filter 64-bit\n\/\/\/ Declare the enumeration size so that target.H will compile without chip specific filter.\n\/\/\/ When users want to use an enumeration value then they can include the chip specific\n\/\/\/ target_filters.H, which would have the enumerator list of values.\n\/\/\/\nenum TargetFilter : uint64_t;\n\n\/\/ attributeOverride tool requires x86.nfp compile\n#ifndef CONTEXT_x86_nfp\n\/\/\/ @cond\n    constexpr TargetType operator|(TargetType x, TargetType y)\n{\n    return static_cast<TargetType>(static_cast<uint64_t>(x) |\n                                   static_cast<uint64_t>(y));\n}\n#endif\n\ntemplate<uint64_t V>\nclass bitCount\n{\n    public:\n        \/\/ Don't use enums, too hard to compare\n        static const uint8_t count = bitCount < (V >> 1) >::count + (V & 1);\n};\n\ntemplate<>\nclass bitCount<0>\n{\n    public:\n        static const uint8_t count = 0;\n};\n\/\/\/ @endcond\n\n}\n\n#endif\n<commit_msg>update TARGET_TYPE_MULTICASTABLE<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/hwpf\/fapi2\/include\/target_types.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 target_types.H\n * @brief definitions for fapi2 target types\n *\/\n\n#ifndef __FAPI2_TARGET_TYPES__\n#define __FAPI2_TARGET_TYPES__\n#include <stdint.h>\n\n\/\/\/ FAPI namespace\nnamespace fapi2\n{\n\/\/\/\n\/\/\/ @enum fapi::TargetType\n\/\/\/ @brief Types, kinds, of targets\n\/\/\/ @note TYPE_NONE is used to represent empty\/NULL targets in lists\n\/\/\/ or tables. TYPE_ALL is used to pass targets to methods which\n\/\/\/ can act generally on any type of target\n\/\/\/\n\n\/\/\/ Target Kind\nenum TargetType : uint64_t\n{\n    TARGET_TYPE_NONE          = 0x0000000000000000, \/\/\/< No type\n    TARGET_TYPE_SYSTEM        = 0x0000000000000001, \/\/\/< System type\n    TARGET_TYPE_DIMM          = 0x0000000000000002, \/\/\/< DIMM type\n    TARGET_TYPE_PROC_CHIP     = 0x0000000000000004, \/\/\/< Processor type\n    TARGET_TYPE_MEMBUF_CHIP   = 0x0000000000000008, \/\/\/< Membuf type\n    TARGET_TYPE_EX            = 0x0000000000000010, \/\/\/< EX - 2x Core, L2, L3 - can be deconfigured\n    TARGET_TYPE_MBA           = 0x0000000000000020, \/\/\/< MBA type\n    TARGET_TYPE_MCS           = 0x0000000000000040, \/\/\/< MCS type\n    TARGET_TYPE_XBUS          = 0x0000000000000080, \/\/\/< XBUS type\n    TARGET_TYPE_ABUS          = 0x0000000000000100, \/\/\/< ABUS type\n    TARGET_TYPE_L4            = 0x0000000000000200, \/\/\/< L4 type\n    TARGET_TYPE_CORE          = 0x0000000000000400, \/\/\/< Core\n    TARGET_TYPE_EQ            = 0x0000000000000800, \/\/\/< EQ - 4x core, 2x L2, 2x L3 - can be deconfigured\n    TARGET_TYPE_MCA           = 0x0000000000001000, \/\/\/< MCA type\n    TARGET_TYPE_MCBIST        = 0x0000000000002000, \/\/\/< MCBIST type\n    TARGET_TYPE_MI            = 0x0000000000004000, \/\/\/< MI Memory Interface (Cumulus)\n    TARGET_TYPE_CAPP          = 0x0000000000008000, \/\/\/< CAPP target\n    TARGET_TYPE_DMI           = 0x0000000000010000, \/\/\/< DMI type\n    TARGET_TYPE_OBUS          = 0x0000000000020000, \/\/\/< OBUS type\n    TARGET_TYPE_OBUS_BRICK    = 0x0000000000040000, \/\/\/< OBUS BRICK type\n    TARGET_TYPE_SBE           = 0x0000000000080000, \/\/\/< SBE type\n    TARGET_TYPE_PPE           = 0x0000000000100000, \/\/\/< PPE type\n    TARGET_TYPE_PERV          = 0x0000000000200000, \/\/\/< Pervasive type\n    TARGET_TYPE_PEC           = 0x0000000000400000, \/\/\/< PEC type\n    TARGET_TYPE_PHB           = 0x0000000000800000, \/\/\/< PHB type\n    TARGET_TYPE_MC            = 0x0000000001000000, \/\/\/< MC type\n    TARGET_TYPE_OMI           = 0x0000000002000000, \/\/\/< OMI type\n    TARGET_TYPE_OMIC          = 0x0000000004000000, \/\/\/< OMIC type\n    TARGET_TYPE_MCC           = 0x0000000008000000, \/\/\/< MCC type\n    TARGET_TYPE_OCMB_CHIP     = 0x0000000010000000, \/\/\/< OCMB type\n    TARGET_TYPE_MEM_PORT      = 0x0000000020000000, \/\/\/< MEM_PORT type\n    TARGET_TYPE_NMMU          = 0x0000000040000000, \/\/\/< NEST MMU type\n    TARGET_TYPE_RESERVED      = 0x0000000080000000, \/\/\/< Reserved for Cronus (Z)\n    TARGET_TYPE_PAU           = 0x0000000100000000, \/\/\/< PAU type\n    TARGET_TYPE_IOHS          = 0x0000000200000000, \/\/\/< IOHS type\n    TARGET_TYPE_FC            = 0x0000000400000000, \/\/\/< Fused Core type\n    TARGET_TYPE_PMIC          = 0x0000000800000000, \/\/\/< PMIC type\n    TARGET_TYPE_PAUC          = 0x0000001000000000, \/\/\/< PAUC type\n    TARGET_TYPE_MULTICAST     = 0x8000000000000000, \/\/\/< MULTICAST type\n    TARGET_TYPE_ALL           = 0x7FFFFFFFFFFFFFFF, \/\/\/< Any\/All types\n    TARGET_TYPE_ALL_MC        = 0xFFFFFFFFFFFFFFFF, \/\/\/< Any\/All types + Multicast\n\n    \/\/ Compound target types\n    TARGET_TYPE_CHIPS         = TARGET_TYPE_PROC_CHIP |\n                                TARGET_TYPE_MEMBUF_CHIP |\n                                TARGET_TYPE_OCMB_CHIP,\n\n    TARGET_TYPE_CHIPLETS      = TARGET_TYPE_EX            |\n                                TARGET_TYPE_MBA           |\n                                TARGET_TYPE_MCS           |\n                                TARGET_TYPE_XBUS          |\n                                TARGET_TYPE_ABUS          |\n                                TARGET_TYPE_L4            |\n                                TARGET_TYPE_CORE          |\n                                TARGET_TYPE_EQ            |\n                                TARGET_TYPE_MCA           |\n                                TARGET_TYPE_MCBIST        |\n                                TARGET_TYPE_MI            |\n                                TARGET_TYPE_DMI           |\n                                TARGET_TYPE_OBUS          |\n                                TARGET_TYPE_OBUS_BRICK    |\n                                TARGET_TYPE_SBE           |\n                                TARGET_TYPE_PPE           |\n                                TARGET_TYPE_PERV          |\n                                TARGET_TYPE_PEC           |\n                                TARGET_TYPE_PHB           |\n                                TARGET_TYPE_MC            |\n                                TARGET_TYPE_OMI           |\n                                TARGET_TYPE_OMIC          |\n                                TARGET_TYPE_MCC           |\n                                TARGET_TYPE_MEM_PORT      |\n                                TARGET_TYPE_NMMU          |\n                                TARGET_TYPE_PAU           |\n                                TARGET_TYPE_IOHS          |\n                                TARGET_TYPE_FC            |\n                                TARGET_TYPE_PAUC,\n\n    TARGET_TYPE_MULTICASTABLE = TARGET_TYPE_CORE   |\n                                TARGET_TYPE_EQ     |\n                                TARGET_TYPE_IOHS   |\n                                TARGET_TYPE_MC     |\n                                TARGET_TYPE_PAUC   |\n                                TARGET_TYPE_PEC    |\n                                TARGET_TYPE_PERV,\n\n    \/\/ Mappings to target types found in the error xml files\n    TARGET_TYPE_EX_CHIPLET    = TARGET_TYPE_EX,\n    TARGET_TYPE_MBA_CHIPLET   = TARGET_TYPE_MBA,\n    TARGET_TYPE_MCS_CHIPLET   = TARGET_TYPE_MCS,\n    TARGET_TYPE_XBUS_ENDPOINT = TARGET_TYPE_XBUS,\n    TARGET_TYPE_ABUS_ENDPOINT = TARGET_TYPE_ABUS,\n};\n\n\/\/\/\n\/\/\/ Target filter 64-bit\n\/\/\/ Declare the enumeration size so that target.H will compile without chip specific filter.\n\/\/\/ When users want to use an enumeration value then they can include the chip specific\n\/\/\/ target_filters.H, which would have the enumerator list of values.\n\/\/\/\nenum TargetFilter : uint64_t;\n\n\/\/ attributeOverride tool requires x86.nfp compile\n#ifndef CONTEXT_x86_nfp\n\/\/\/ @cond\n    constexpr TargetType operator|(TargetType x, TargetType y)\n{\n    return static_cast<TargetType>(static_cast<uint64_t>(x) |\n                                   static_cast<uint64_t>(y));\n}\n#endif\n\ntemplate<uint64_t V>\nclass bitCount\n{\n    public:\n        \/\/ Don't use enums, too hard to compare\n        static const uint8_t count = bitCount < (V >> 1) >::count + (V & 1);\n};\n\ntemplate<>\nclass bitCount<0>\n{\n    public:\n        static const uint8_t count = 0;\n};\n\/\/\/ @endcond\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2019 The Pigweed Authors\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); you may not\n\/\/ use this file except in compliance with the License. You may obtain a copy of\n\/\/ 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, WITHOUT\n\/\/ WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n\/\/ License for the specific language governing permissions and limitations under\n\/\/ the License.\n\n#include \"pw_unit_test\/framework.h\"\n\n#include <cstring>\n\nnamespace pw::unit_test {\n\nvoid RegisterEventHandler(EventHandler* event_handler) {\n  internal::Framework::Get().RegisterEventHandler(event_handler);\n}\n\nnamespace internal {\n\n\/\/ Singleton instance of the unit test framework class.\nFramework Framework::framework_;\n\n\/\/ Linked list of all test cases in the test executable. This is static as it is\n\/\/ populated using static initialization.\nTestInfo* Framework::tests_ = nullptr;\n\nvoid Framework::RegisterTest(TestInfo* new_test) {\n  \/\/ If the test list is empty, set new_test as the first test.\n  if (tests_ == nullptr) {\n    tests_ = new_test;\n    return;\n  }\n\n  \/\/ Append the test case to the end of the test list.\n  TestInfo* info = tests_;\n  for (; info->next() != nullptr; info = info->next()) {\n  }\n  info->set_next(new_test);\n}\n\nint Framework::RunAllTests() {\n  run_tests_summary_.passed_tests = 0;\n  run_tests_summary_.failed_tests = 0;\n\n  if (event_handler_ != nullptr) {\n    event_handler_->RunAllTestsStart();\n  }\n  for (const TestInfo* test = tests_; test != nullptr; test = test->next()) {\n    if (test->enabled()) {\n      test->run();\n    } else {\n      event_handler_->TestCaseDisabled(test->test_case());\n    }\n  }\n  if (event_handler_ != nullptr) {\n    event_handler_->RunAllTestsEnd(run_tests_summary_);\n  }\n  return exit_status_;\n}\n\nvoid Framework::StartTest(const TestInfo& test) {\n  current_test_ = &test;\n  current_result_ = TestResult::kSuccess;\n\n  if (event_handler_ != nullptr) {\n    event_handler_->TestCaseStart(test.test_case());\n  }\n}\n\nvoid Framework::EndCurrentTest() {\n  switch (current_result_) {\n    case TestResult::kSuccess:\n      run_tests_summary_.passed_tests++;\n      break;\n    case TestResult::kFailure:\n      run_tests_summary_.failed_tests++;\n      break;\n  }\n\n  if (event_handler_ != nullptr) {\n    event_handler_->TestCaseEnd(current_test_->test_case(), current_result_);\n  }\n\n  current_test_ = nullptr;\n}\n\nvoid Framework::ExpectationResult(const char* expression,\n                                  const char* evaluated_expression,\n                                  int line,\n                                  bool success) {\n  if (!success) {\n    current_result_ = TestResult::kFailure;\n    exit_status_ = 1;\n  }\n\n  if (event_handler_ == nullptr) {\n    return;\n  }\n\n  TestExpectation expectation = {\n      .expression = expression,\n      .evaluated_expression = evaluated_expression,\n      .line_number = line,\n      .success = success,\n  };\n\n  event_handler_->TestCaseExpect(current_test_->test_case(), expectation);\n}\n\nbool TestInfo::enabled() const {\n  constexpr size_t kStringSize = sizeof(\"DISABLED_\") - 1;\n  return std::strncmp(\"DISABLED_\", test_case().test_name, kStringSize) != 0 &&\n         std::strncmp(\"DISABLED_\", test_case().suite_name, kStringSize) != 0;\n}\n\n}  \/\/ namespace internal\n}  \/\/ namespace pw::unit_test\n<commit_msg>Remove nested namespace in pw_unit_test<commit_after>\/\/ Copyright 2019 The Pigweed Authors\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); you may not\n\/\/ use this file except in compliance with the License. You may obtain a copy of\n\/\/ 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, WITHOUT\n\/\/ WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n\/\/ License for the specific language governing permissions and limitations under\n\/\/ the License.\n\n#include \"pw_unit_test\/framework.h\"\n\n#include <cstring>\n\nnamespace pw {\nnamespace unit_test {\n\nvoid RegisterEventHandler(EventHandler* event_handler) {\n  internal::Framework::Get().RegisterEventHandler(event_handler);\n}\n\nnamespace internal {\n\n\/\/ Singleton instance of the unit test framework class.\nFramework Framework::framework_;\n\n\/\/ Linked list of all test cases in the test executable. This is static as it is\n\/\/ populated using static initialization.\nTestInfo* Framework::tests_ = nullptr;\n\nvoid Framework::RegisterTest(TestInfo* new_test) {\n  \/\/ If the test list is empty, set new_test as the first test.\n  if (tests_ == nullptr) {\n    tests_ = new_test;\n    return;\n  }\n\n  \/\/ Append the test case to the end of the test list.\n  TestInfo* info = tests_;\n  for (; info->next() != nullptr; info = info->next()) {\n  }\n  info->set_next(new_test);\n}\n\nint Framework::RunAllTests() {\n  run_tests_summary_.passed_tests = 0;\n  run_tests_summary_.failed_tests = 0;\n\n  if (event_handler_ != nullptr) {\n    event_handler_->RunAllTestsStart();\n  }\n  for (const TestInfo* test = tests_; test != nullptr; test = test->next()) {\n    if (test->enabled()) {\n      test->run();\n    } else {\n      event_handler_->TestCaseDisabled(test->test_case());\n    }\n  }\n  if (event_handler_ != nullptr) {\n    event_handler_->RunAllTestsEnd(run_tests_summary_);\n  }\n  return exit_status_;\n}\n\nvoid Framework::StartTest(const TestInfo& test) {\n  current_test_ = &test;\n  current_result_ = TestResult::kSuccess;\n\n  if (event_handler_ != nullptr) {\n    event_handler_->TestCaseStart(test.test_case());\n  }\n}\n\nvoid Framework::EndCurrentTest() {\n  switch (current_result_) {\n    case TestResult::kSuccess:\n      run_tests_summary_.passed_tests++;\n      break;\n    case TestResult::kFailure:\n      run_tests_summary_.failed_tests++;\n      break;\n  }\n\n  if (event_handler_ != nullptr) {\n    event_handler_->TestCaseEnd(current_test_->test_case(), current_result_);\n  }\n\n  current_test_ = nullptr;\n}\n\nvoid Framework::ExpectationResult(const char* expression,\n                                  const char* evaluated_expression,\n                                  int line,\n                                  bool success) {\n  if (!success) {\n    current_result_ = TestResult::kFailure;\n    exit_status_ = 1;\n  }\n\n  if (event_handler_ == nullptr) {\n    return;\n  }\n\n  TestExpectation expectation = {\n      .expression = expression,\n      .evaluated_expression = evaluated_expression,\n      .line_number = line,\n      .success = success,\n  };\n\n  event_handler_->TestCaseExpect(current_test_->test_case(), expectation);\n}\n\nbool TestInfo::enabled() const {\n  constexpr size_t kStringSize = sizeof(\"DISABLED_\") - 1;\n  return std::strncmp(\"DISABLED_\", test_case().test_name, kStringSize) != 0 &&\n         std::strncmp(\"DISABLED_\", test_case().suite_name, kStringSize) != 0;\n}\n\n}  \/\/ namespace internal\n}  \/\/ namespace unit_test\n}  \/\/ namespace pw\n<|endoftext|>"}
{"text":"<commit_before>\/* $Id$ *\/\n\n\/**************************************************************************\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 * >> Flat structure representing a TPC seed <<\n *\n * To be used in the online and offline calibration schema.\n *\n *\n * Primary Authors : Sergey Gorbunov, Jochen Thaeder, Chiara Zampolli\n *\n **************************************************************************\/\n\n#include \"AliFlatTPCseed.h\"\n#include \"AliTPCseed.h\"\n#include \"AliHLTTPCTransform.h\"\n#include \"Riostream.h\"\n\n\nvoid AliFlatTPCseed::SetFromTPCseed( const AliTPCseed *p )\n{\n  \/\/ initialise from AliTPCseed\n\n  Reset();\n  if( !p ) return;\n  fParam.SetExternalTrackParam(  p );\n  fLabel = p->GetLabel();  \n  for( Int_t irow=159; irow>=0; irow-- ){\n    if( p->GetClusterPointer(irow) ) AddCluster( p->GetClusterPointer(irow), p->GetTrackPointConst(irow) );\n  }\n}\n\nvoid AliFlatTPCseed::GetTPCseed( AliTPCseed *p ) const\n{\n   \/\/ write to AliTPCseed\n  if( !p ) return;\n  p->Reset();\n\n  AliTPCseed seed;\n\n  fParam.GetExternalTrackParam( seed );\n  seed.SetLabel(fLabel);  \n  seed.SetNumberOfClusters(fNTPCClusters);\n\n  AliTPCclusterMI * clusters = new AliTPCclusterMI[fNTPCClusters];\n\n  const AliFlatTPCCluster *flatClusters = reinterpret_cast< const AliFlatTPCCluster* >( fContent );\n\n  for( Int_t ic=0; ic<fNTPCClusters; ic++){\n    const AliFlatTPCCluster &flatCluster = flatClusters[ic];\n    int sec = flatCluster.GetSector();\n    int row = flatCluster.GetPadRow();\n    if(sec >= 36) row = row + AliHLTTPCTransform::GetNRowLow();\n    if( row<160 ){\n      flatCluster.GetTPCCluster( &(clusters[ic]), seed.GetTrackPoint(row) );\n      seed.SetClusterPointer( row , &(clusters[ic]) );\n    }\n  }\n  new (p) AliTPCseed( seed, kTRUE ); \/\/ true means that p creates its own cluster objects\n  delete [] clusters;\n}\n<commit_msg>fix bug in setting of TPC clusters in flatTPCseed convertor<commit_after>\/* $Id$ *\/\n\n\/**************************************************************************\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 * >> Flat structure representing a TPC seed <<\n *\n * To be used in the online and offline calibration schema.\n *\n *\n * Primary Authors : Sergey Gorbunov, Jochen Thaeder, Chiara Zampolli\n *\n **************************************************************************\/\n\n#include \"AliFlatTPCseed.h\"\n#include \"AliTPCseed.h\"\n#include \"AliHLTTPCTransform.h\"\n#include \"Riostream.h\"\n\n\nvoid AliFlatTPCseed::SetFromTPCseed( const AliTPCseed *p )\n{\n  \/\/ initialise from AliTPCseed\n\n  Reset();\n  if( !p ) return;\n  fParam.SetExternalTrackParam(  p );\n  fLabel = p->GetLabel();  \n  for( Int_t irow=0; irow<160; irow++ ){\n    if( p->GetClusterPointer(irow) ) AddCluster( p->GetClusterPointer(irow), p->GetTrackPointConst(irow) );\n  }\n}\n\nvoid AliFlatTPCseed::GetTPCseed( AliTPCseed *p ) const\n{\n   \/\/ write to AliTPCseed\n  if( !p ) return;\n  p->Reset();\n\n  AliTPCseed seed;\n\n  fParam.GetExternalTrackParam( seed );\n  seed.SetLabel(fLabel);  \n  seed.SetNumberOfClusters(fNTPCClusters);\n\n  AliTPCclusterMI * clusters = new AliTPCclusterMI[fNTPCClusters];\n\n  const AliFlatTPCCluster *flatClusters = reinterpret_cast< const AliFlatTPCCluster* >( fContent );\n\n  for( Int_t ic=0; ic<fNTPCClusters; ic++){\n    const AliFlatTPCCluster &flatCluster = flatClusters[ic];\n    int sec = flatCluster.GetSector();\n    int row = flatCluster.GetPadRow();\n    if(sec >= 36) row = row + AliHLTTPCTransform::GetNRowLow();\n    if( row<160 ){\n      flatCluster.GetTPCCluster( &(clusters[ic]), seed.GetTrackPoint(row) );\n      seed.SetClusterPointer( row , &(clusters[ic]) );\n    }\n  }\n  new (p) AliTPCseed( seed, kTRUE ); \/\/ true means that p creates its own cluster objects\n  delete [] clusters;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: wldcrd.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 14:18:53 $\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 _WLDCRD_HXX\n#include <wldcrd.hxx>\n#endif\n\n\/*************************************************************************\n|*\n|*    WildCard::Match()\n|*\n|*    Beschreibung      WLDCRD.SDW\n|*    Ersterstellung    MA 19.06.91\n|*    Letzte Aenderung  MA 03.07.91\n|*\n*************************************************************************\/\n\n\/* Diese Methode ueberprueft, ob die Wilde Karte in pWild mit dem String\n * in pStr matscht.\n * Vertragen sich die beiden, so wird 1 zurueckgegeben, sonst 0.\n *\n * ein '*' in pWild bedeutet n beliebige Zeichen, mit n>=0\n * ein '?' in pWild bedeutet genau ein beliebiges Zeichen\n *\n *\/\n\nUSHORT WildCard::ImpMatch( const char *pWild, const char *pStr ) const\n{\n    int    pos=0;\n    int    flag=0;\n\n    while ( *pWild || flag )\n    {\n        switch (*pWild)\n        {\n            case '?':\n                if ( *pStr == '\\0' )\n                    return 0;\n                break;\n\n            default:\n                if ( (*pWild == '\\\\') && ((*(pWild+1)=='?') || (*(pWild+1) == '*')) )\n                    pWild++;\n                if ( *pWild != *pStr )\n                    if ( !pos )\n                        return 0;\n                    else\n                        pWild += pos;\n                else\n                    break;          \/\/ ACHTUNG laeuft unter bestimmten\n                                    \/\/ Umstaenden in den nachsten case rein!!\n            case '*':\n                while ( *pWild == '*' )\n                    pWild++;\n                if ( *pWild == '\\0' )\n                    return 1;\n                flag = 1;\n                pos  = 0;\n                if ( *pStr == '\\0' )\n                    return ( *pWild == '\\0' );\n                while ( *pStr && *pStr != *pWild )\n                {\n                    if ( *pWild == '?' ) {\n                        pWild++;\n                        while ( *pWild == '*' )\n                            pWild++;\n                    }\n                    pStr++;\n                    if ( *pStr == '\\0' )\n                        return ( *pWild == '\\0' );\n                }\n                break;\n        }\n        if ( *pWild != '\\0' )\n            pWild++;\n        if ( *pStr != '\\0' )\n            pStr++;\n        else\n            flag = 0;\n        if ( flag )\n            pos--;\n    }\n    return ( *pStr == '\\0' ) && ( *pWild == '\\0' );\n}\n\n\/*************************************************************************\n|*\n|*    WildCard::Matches()\n|*\n|*    Beschreibung      WLDCRD.SDW\n|*    Ersterstellung    MA 19.06.91\n|*    Letzte Aenderung  TH 02.02.96\n|*\n*************************************************************************\/\n\nBOOL WildCard::Matches( const String& rString ) const\n{\n    ByteString aTmpWild = aWildString;\n    ByteString aString(rString, osl_getThreadTextEncoding());\n\n    USHORT  nSepPos;\n\n    if ( cSepSymbol != '\\0' )\n    {\n        while ( (nSepPos = aTmpWild.Search( cSepSymbol )) != STRING_NOTFOUND )\n        {\n            \/\/ alle getrennten WildCard's pruefen\n            if ( ImpMatch( aTmpWild.Copy( 0, nSepPos ).GetBuffer(), aString.GetBuffer() ) )\n                return TRUE;\n            aTmpWild.Erase( 0, nSepPos + 1 ); \/\/ Trennsymbol entfernen\n        }\n        \/\/ und noch den hinter dem letzen Trennsymbol bzw. den einzigen\n    }\n\n    if ( ImpMatch( aTmpWild.GetBuffer(), aString.GetBuffer() ) )\n        return TRUE;\n    else\n        return FALSE;\n}\n<commit_msg>INTEGRATION: CWS pchfix02 (1.2.120); FILE MERGED 2006\/09\/01 17:54:51 kaib 1.2.120.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: wldcrd.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 00:54:37 $\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#ifndef _WLDCRD_HXX\n#include <wldcrd.hxx>\n#endif\n\n\/*************************************************************************\n|*\n|*    WildCard::Match()\n|*\n|*    Beschreibung      WLDCRD.SDW\n|*    Ersterstellung    MA 19.06.91\n|*    Letzte Aenderung  MA 03.07.91\n|*\n*************************************************************************\/\n\n\/* Diese Methode ueberprueft, ob die Wilde Karte in pWild mit dem String\n * in pStr matscht.\n * Vertragen sich die beiden, so wird 1 zurueckgegeben, sonst 0.\n *\n * ein '*' in pWild bedeutet n beliebige Zeichen, mit n>=0\n * ein '?' in pWild bedeutet genau ein beliebiges Zeichen\n *\n *\/\n\nUSHORT WildCard::ImpMatch( const char *pWild, const char *pStr ) const\n{\n    int    pos=0;\n    int    flag=0;\n\n    while ( *pWild || flag )\n    {\n        switch (*pWild)\n        {\n            case '?':\n                if ( *pStr == '\\0' )\n                    return 0;\n                break;\n\n            default:\n                if ( (*pWild == '\\\\') && ((*(pWild+1)=='?') || (*(pWild+1) == '*')) )\n                    pWild++;\n                if ( *pWild != *pStr )\n                    if ( !pos )\n                        return 0;\n                    else\n                        pWild += pos;\n                else\n                    break;          \/\/ ACHTUNG laeuft unter bestimmten\n                                    \/\/ Umstaenden in den nachsten case rein!!\n            case '*':\n                while ( *pWild == '*' )\n                    pWild++;\n                if ( *pWild == '\\0' )\n                    return 1;\n                flag = 1;\n                pos  = 0;\n                if ( *pStr == '\\0' )\n                    return ( *pWild == '\\0' );\n                while ( *pStr && *pStr != *pWild )\n                {\n                    if ( *pWild == '?' ) {\n                        pWild++;\n                        while ( *pWild == '*' )\n                            pWild++;\n                    }\n                    pStr++;\n                    if ( *pStr == '\\0' )\n                        return ( *pWild == '\\0' );\n                }\n                break;\n        }\n        if ( *pWild != '\\0' )\n            pWild++;\n        if ( *pStr != '\\0' )\n            pStr++;\n        else\n            flag = 0;\n        if ( flag )\n            pos--;\n    }\n    return ( *pStr == '\\0' ) && ( *pWild == '\\0' );\n}\n\n\/*************************************************************************\n|*\n|*    WildCard::Matches()\n|*\n|*    Beschreibung      WLDCRD.SDW\n|*    Ersterstellung    MA 19.06.91\n|*    Letzte Aenderung  TH 02.02.96\n|*\n*************************************************************************\/\n\nBOOL WildCard::Matches( const String& rString ) const\n{\n    ByteString aTmpWild = aWildString;\n    ByteString aString(rString, osl_getThreadTextEncoding());\n\n    USHORT  nSepPos;\n\n    if ( cSepSymbol != '\\0' )\n    {\n        while ( (nSepPos = aTmpWild.Search( cSepSymbol )) != STRING_NOTFOUND )\n        {\n            \/\/ alle getrennten WildCard's pruefen\n            if ( ImpMatch( aTmpWild.Copy( 0, nSepPos ).GetBuffer(), aString.GetBuffer() ) )\n                return TRUE;\n            aTmpWild.Erase( 0, nSepPos + 1 ); \/\/ Trennsymbol entfernen\n        }\n        \/\/ und noch den hinter dem letzen Trennsymbol bzw. den einzigen\n    }\n\n    if ( ImpMatch( aTmpWild.GetBuffer(), aString.GetBuffer() ) )\n        return TRUE;\n    else\n        return FALSE;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2010-2013, AOYAMA Kazuharu\n * All rights reserved.\n *\n * This software may be used and distributed according to the terms of\n * the New BSD License, which is incorporated herein by reference.\n *\/\n\n#include <QtCore>\n#include <QtSql>\n#include \"tableschema.h\"\n#include \"global.h\"\n\nQSettings *dbSettings = 0;\n\n\nTableSchema::TableSchema(const QString &table, const QString &env)\n    : tablename(table)\n{\n    if (!dbSettings) {\n        QString path = QLatin1String(\"config\") + QDir::separator() + \"database.ini\";\n        if (!QFile::exists(path)) {\n            qCritical(\"not found, %s\", qPrintable(path));\n        }\n        dbSettings = new QSettings(path, QSettings::IniFormat);\n    }\n\n    if (openDatabase(env)) {\n        if (!tablename.isEmpty()) {\n            QSqlTableModel model;\n            model.setTable(tablename);\n            tableFields = model.record();\n            \/\/ QPSQLResult doesn't call QSqlField::setAutoValue(), fix it\n            for (int i = 0; i < tableFields.count(); ++i) {\n                QSqlField f = tableFields.field(i);\n                if (f.defaultValue().toString().startsWith(QStringLiteral(\"nextval\"))) {\n                    f.setAutoValue(true);\n                    tableFields.replace(i, f);\n                }\n            }\n        } else {\n            qCritical(\"Empty table name\");\n        }\n    }\n}\n\n\nbool TableSchema::exists() const\n{\n    return (tableFields.count() > 0);\n}\n\n\nQList<QPair<QString, QString> > TableSchema::getFieldList() const\n{\n    QList<QPair<QString, QString> > fieldList;\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        fieldList << QPair<QString, QString>(f.name(), QString(QVariant::typeToName(f.type())));\n    }\n    return fieldList;\n}\n\n\nQList<QPair<QString, QVariant::Type> > TableSchema::getFieldTypeList() const\n{\n    QList<QPair<QString, QVariant::Type> > fieldList;\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        fieldList << QPair<QString, QVariant::Type>(f.name(), f.type());\n    }\n    return fieldList;\n}\n\n\nint TableSchema::primaryKeyIndex() const\n{\n    QSqlTableModel model;\n    model.setTable(tablename);\n    QSqlIndex index = model.primaryKey();\n    if (index.isEmpty()) {\n        return -1;\n    }\n\n    QSqlField fi = index.field(0);\n    return model.record().indexOf(fi.name());\n}\n\n\nQString TableSchema::primaryKeyFieldName() const\n{\n    QSqlTableModel model;\n    model.setTable(tablename);\n    QSqlIndex index = model.primaryKey();\n    if (index.isEmpty()) {\n        return QString();\n    }\n\n    QSqlField fi = index.field(0);\n    return fi.name();\n}\n\n\nint TableSchema::autoValueIndex() const\n{\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        if (f.isAutoValue())\n            return i;\n    }\n    return -1;\n}\n\n\nQString TableSchema::autoValueFieldName() const\n{\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        if (f.isAutoValue())\n            return f.name();\n    }\n    return QString();\n}\n\n\nQPair<QString, QString> TableSchema::getPrimaryKeyField() const\n{\n    QPair<QString, QString> pair;\n    int index = primaryKeyIndex();\n    if (index >= 0) {\n        QSqlField f = tableFields.field(index);\n        pair = QPair<QString, QString>(f.name(), QString(QVariant::typeToName(f.type())));\n    }\n    return pair;\n}\n\n\nQPair<QString, QVariant::Type> TableSchema::getPrimaryKeyFieldType() const\n{\n    QPair<QString, QVariant::Type> pair;\n    int index = primaryKeyIndex();\n    if (index >= 0) {\n        QSqlField f = tableFields.field(index);\n        pair = QPair<QString, QVariant::Type>(f.name(), f.type());\n    }\n    return pair;\n}\n\n\nint TableSchema::lockRevisionIndex() const\n{\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        if (fieldNameToVariableName(f.name()) == \"lockRevision\") {\n            return i;\n        }\n    }\n    return -1;\n}\n\n\nbool TableSchema::hasLockRevisionField() const\n{\n    return lockRevisionIndex() >= 0;\n}\n\n\nbool TableSchema::openDatabase(const QString &env) const\n{\n    if (isOpen())\n        return true;\n\n    if (!dbSettings->childGroups().contains(env)) {\n        qCritical(\"invalid environment: %s\", qPrintable(env));\n        return false;\n    }\n\n    dbSettings->beginGroup(env);\n\n    QString driverType = dbSettings->value(\"DriverType\").toString().trimmed();\n    if (driverType.isEmpty()) {\n        qWarning(\"Parameter 'DriverType' is empty\");\n    }\n    qDebug(\"DriverType:   %s\", qPrintable(driverType));\n\n    QSqlDatabase db = QSqlDatabase::addDatabase(driverType);\n    if (!db.isValid()) {\n        qWarning(\"Parameter 'DriverType' is invalid or RDB client library not available.\");\n        return false;\n    }\n\n    QString databaseName = dbSettings->value(\"DatabaseName\").toString().trimmed();\n    qDebug(\"DatabaseName: %s\", qPrintable(databaseName));\n    if (!databaseName.isEmpty())\n        db.setDatabaseName(databaseName);\n\n    QString hostName = dbSettings->value(\"HostName\").toString().trimmed();\n    qDebug(\"HostName:     %s\", qPrintable(hostName));\n    if (!hostName.isEmpty())\n        db.setHostName(hostName);\n\n    int port = dbSettings->value(\"Port\").toInt();\n    if (port > 0)\n        db.setPort(port);\n\n    QString userName = dbSettings->value(\"UserName\").toString().trimmed();\n    if (!userName.isEmpty())\n        db.setUserName(userName);\n\n    QString password = dbSettings->value(\"Password\").toString().trimmed();\n    if (!password.isEmpty())\n        db.setPassword(password);\n\n    QString connectOptions = dbSettings->value(\"ConnectOptions\").toString().trimmed();\n    if (!connectOptions.isEmpty())\n        db.setConnectOptions(connectOptions);\n\n    dbSettings->endGroup();\n\n    if (!db.open()) {\n        qWarning(\"Database open error\");\n        return false;\n    }\n\n    qDebug(\"Database opened successfully\");\n    return true;\n}\n\n\nbool TableSchema::isOpen() const\n{\n    return QSqlDatabase::database().isOpen();\n}\n\n\nQStringList TableSchema::databaseDrivers()\n{\n    return QSqlDatabase::drivers();\n}\n\n\nQStringList TableSchema::tables(const QString &env)\n{\n    QSet<QString> set;\n    TableSchema dummy(\"dummy\", env);  \/\/ to open database\n\n    if (QSqlDatabase::database().isOpen()) {\n        for (QStringListIterator i(QSqlDatabase::database().tables(QSql::Tables)); i.hasNext(); ) {\n            TableSchema t(i.next());\n            if (t.exists())\n                set << t.tableName(); \/\/ If value already exists, the set is left unchanged\n        }\n    }\n\n    QStringList ret = set.toList();\n    qSort(ret);\n    return ret;\n}\n<commit_msg>added if-check for the driver name.<commit_after>\/* Copyright (c) 2010-2013, AOYAMA Kazuharu\n * All rights reserved.\n *\n * This software may be used and distributed according to the terms of\n * the New BSD License, which is incorporated herein by reference.\n *\/\n\n#include <QtCore>\n#include <QtSql>\n#include \"tableschema.h\"\n#include \"global.h\"\n\nQSettings *dbSettings = 0;\n\n\nTableSchema::TableSchema(const QString &table, const QString &env)\n    : tablename(table)\n{\n    if (!dbSettings) {\n        QString path = QLatin1String(\"config\") + QDir::separator() + \"database.ini\";\n        if (!QFile::exists(path)) {\n            qCritical(\"not found, %s\", qPrintable(path));\n        }\n        dbSettings = new QSettings(path, QSettings::IniFormat);\n    }\n\n    if (openDatabase(env)) {\n        if (!tablename.isEmpty()) {\n            QSqlTableModel model;\n            model.setTable(tablename);\n            tableFields = model.record();\n\n            if (model.database().driverName().toUpper() == \"QPSQL\") {\n                \/\/ QPSQLResult doesn't call QSqlField::setAutoValue(), fix it\n                for (int i = 0; i < tableFields.count(); ++i) {\n                    QSqlField f = tableFields.field(i);\n                    if (f.defaultValue().toString().startsWith(QLatin1String(\"nextval\"))) {\n                        f.setAutoValue(true);\n                        tableFields.replace(i, f);\n                    }\n                }\n            }\n        } else {\n            qCritical(\"Empty table name\");\n        }\n    }\n}\n\n\nbool TableSchema::exists() const\n{\n    return (tableFields.count() > 0);\n}\n\n\nQList<QPair<QString, QString> > TableSchema::getFieldList() const\n{\n    QList<QPair<QString, QString> > fieldList;\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        fieldList << QPair<QString, QString>(f.name(), QString(QVariant::typeToName(f.type())));\n    }\n    return fieldList;\n}\n\n\nQList<QPair<QString, QVariant::Type> > TableSchema::getFieldTypeList() const\n{\n    QList<QPair<QString, QVariant::Type> > fieldList;\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        fieldList << QPair<QString, QVariant::Type>(f.name(), f.type());\n    }\n    return fieldList;\n}\n\n\nint TableSchema::primaryKeyIndex() const\n{\n    QSqlTableModel model;\n    model.setTable(tablename);\n    QSqlIndex index = model.primaryKey();\n    if (index.isEmpty()) {\n        return -1;\n    }\n\n    QSqlField fi = index.field(0);\n    return model.record().indexOf(fi.name());\n}\n\n\nQString TableSchema::primaryKeyFieldName() const\n{\n    QSqlTableModel model;\n    model.setTable(tablename);\n    QSqlIndex index = model.primaryKey();\n    if (index.isEmpty()) {\n        return QString();\n    }\n\n    QSqlField fi = index.field(0);\n    return fi.name();\n}\n\n\nint TableSchema::autoValueIndex() const\n{\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        if (f.isAutoValue())\n            return i;\n    }\n    return -1;\n}\n\n\nQString TableSchema::autoValueFieldName() const\n{\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        if (f.isAutoValue())\n            return f.name();\n    }\n    return QString();\n}\n\n\nQPair<QString, QString> TableSchema::getPrimaryKeyField() const\n{\n    QPair<QString, QString> pair;\n    int index = primaryKeyIndex();\n    if (index >= 0) {\n        QSqlField f = tableFields.field(index);\n        pair = QPair<QString, QString>(f.name(), QString(QVariant::typeToName(f.type())));\n    }\n    return pair;\n}\n\n\nQPair<QString, QVariant::Type> TableSchema::getPrimaryKeyFieldType() const\n{\n    QPair<QString, QVariant::Type> pair;\n    int index = primaryKeyIndex();\n    if (index >= 0) {\n        QSqlField f = tableFields.field(index);\n        pair = QPair<QString, QVariant::Type>(f.name(), f.type());\n    }\n    return pair;\n}\n\n\nint TableSchema::lockRevisionIndex() const\n{\n    for (int i = 0; i < tableFields.count(); ++i) {\n        QSqlField f = tableFields.field(i);\n        if (fieldNameToVariableName(f.name()) == \"lockRevision\") {\n            return i;\n        }\n    }\n    return -1;\n}\n\n\nbool TableSchema::hasLockRevisionField() const\n{\n    return lockRevisionIndex() >= 0;\n}\n\n\nbool TableSchema::openDatabase(const QString &env) const\n{\n    if (isOpen())\n        return true;\n\n    if (!dbSettings->childGroups().contains(env)) {\n        qCritical(\"invalid environment: %s\", qPrintable(env));\n        return false;\n    }\n\n    dbSettings->beginGroup(env);\n\n    QString driverType = dbSettings->value(\"DriverType\").toString().trimmed();\n    if (driverType.isEmpty()) {\n        qWarning(\"Parameter 'DriverType' is empty\");\n    }\n    qDebug(\"DriverType:   %s\", qPrintable(driverType));\n\n    QSqlDatabase db = QSqlDatabase::addDatabase(driverType);\n    if (!db.isValid()) {\n        qWarning(\"Parameter 'DriverType' is invalid or RDB client library not available.\");\n        return false;\n    }\n\n    QString databaseName = dbSettings->value(\"DatabaseName\").toString().trimmed();\n    qDebug(\"DatabaseName: %s\", qPrintable(databaseName));\n    if (!databaseName.isEmpty())\n        db.setDatabaseName(databaseName);\n\n    QString hostName = dbSettings->value(\"HostName\").toString().trimmed();\n    qDebug(\"HostName:     %s\", qPrintable(hostName));\n    if (!hostName.isEmpty())\n        db.setHostName(hostName);\n\n    int port = dbSettings->value(\"Port\").toInt();\n    if (port > 0)\n        db.setPort(port);\n\n    QString userName = dbSettings->value(\"UserName\").toString().trimmed();\n    if (!userName.isEmpty())\n        db.setUserName(userName);\n\n    QString password = dbSettings->value(\"Password\").toString().trimmed();\n    if (!password.isEmpty())\n        db.setPassword(password);\n\n    QString connectOptions = dbSettings->value(\"ConnectOptions\").toString().trimmed();\n    if (!connectOptions.isEmpty())\n        db.setConnectOptions(connectOptions);\n\n    dbSettings->endGroup();\n\n    if (!db.open()) {\n        qWarning(\"Database open error\");\n        return false;\n    }\n\n    qDebug(\"Database opened successfully\");\n    return true;\n}\n\n\nbool TableSchema::isOpen() const\n{\n    return QSqlDatabase::database().isOpen();\n}\n\n\nQStringList TableSchema::databaseDrivers()\n{\n    return QSqlDatabase::drivers();\n}\n\n\nQStringList TableSchema::tables(const QString &env)\n{\n    QSet<QString> set;\n    TableSchema dummy(\"dummy\", env);  \/\/ to open database\n\n    if (QSqlDatabase::database().isOpen()) {\n        for (QStringListIterator i(QSqlDatabase::database().tables(QSql::Tables)); i.hasNext(); ) {\n            TableSchema t(i.next());\n            if (t.exists())\n                set << t.tableName(); \/\/ If value already exists, the set is left unchanged\n        }\n    }\n\n    QStringList ret = set.toList();\n    qSort(ret);\n    return ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Remote control for the Fadecandy firmware, using the ARM debug interface.\n * \n * Copyright (c) 2013 Micah Elizabeth Scott\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#include <Arduino.h>\n#include \"fc_remote.h\"\n#include \"testjig.h\"\n#include \"firmware_data.h\"\n\n\nbool FcRemote::installFirmware()\n{\n    \/\/ Install firmware, blinking both target and local LEDs in unison.\n\n    bool blink = false;\n    ARMKinetisDebug::FlashProgrammer programmer(target, fw_data, fw_sectorCount);\n\n    if (!programmer.begin())\n        return false;\n\n    while (!programmer.isComplete()) {\n        blink = !blink;\n        if (!programmer.next()) return false;\n        if (!setLED(blink)) return false;\n        digitalWrite(ledPin, blink);\n    }\n\n    return true;\n}\n\nbool FcRemote::boot()\n{\n    \/\/ Run the new firmware, and let it boot\n    if (!target.reset())\n        return false;\n    delay(50);\n    return true;\n}\n\nbool FcRemote::setLED(bool on)\n{\n    const unsigned pin = target.PTC5;\n    return\n        target.pinMode(pin, OUTPUT) &&\n        target.digitalWrite(pin, on);\n}\n\nbool FcRemote::setFlags(uint8_t cflag)\n{\n    \/\/ Set control flags\n    return target.memStoreByte(fw_pFlags, cflag);\n}\n\nbool FcRemote::initLUT()\n{\n    \/\/ Install a trivial identity-mapping LUT, writing directly to the firmware's LUT buffer.\n    for (unsigned channel = 0; channel < 3; channel++) {\n        for (unsigned index = 0; index < LUT_CH_SIZE; index++) {\n            if (!setLUT(channel, index, index << 8))\n                return false;\n        }\n    }\n    return true;\n}\n\nbool FcRemote::setLUT(unsigned channel, unsigned index, int value)\n{\n    return target.memStoreHalf(fw_pLUT + 2*(index + channel*LUT_CH_SIZE), constrain(value, 0, 0xFFFF));\n}\n\nbool FcRemote::setPixel(unsigned index, int red, int green, int blue)\n{\n    \/\/ Write one pixel directly into the fbNext framebuffer on the target.\n\n    uint32_t idPacket = index \/ PIXELS_PER_PACKET;\n    uint32_t idOffset = fw_usbPacketBufOffset + 1 + (index % PIXELS_PER_PACKET) * 3;\n\n    uint32_t fb;        \/\/ Address of the current fcFramebuffer bound to fbNext\n    uint32_t packet;    \/\/ Pointer to usb_packet in question\n\n    return\n        target.memLoad(fw_pFbNext, fb) &&\n        target.memLoad(fb + idPacket*4, packet) &&\n        target.memStoreByte(packet + idOffset + 0, constrain(red, 0, 255)) &&\n        target.memStoreByte(packet + idOffset + 1, constrain(green, 0, 255)) &&\n        target.memStoreByte(packet + idOffset + 2, constrain(blue, 0, 255));\n}\n\nfloat FcRemote::measureFrameRate(float minDuration)\n{\n    \/\/ Use the end-to-end LED data signal to measure the overall system frame rate.\n    \/\/ Gaps of >50us indicate frame boundaries\n\n    pinMode(dataFeedbackPin, INPUT);\n\n    uint32_t minMicros = minDuration * 1000000;\n    uint32_t startTime = micros();\n    uint32_t gapStart = 0;\n    bool inGap = false;\n    uint32_t frames = 0;\n    uint32_t duration;\n\n    while (1) {\n        long now = micros();\n        duration = now - startTime;\n        if (duration >= minMicros)\n            break;\n\n        if (digitalRead(dataFeedbackPin)) {\n            \/\/ Definitely not in a gap, found some data\n            inGap = false;\n            gapStart = now;\n\n        } else if (inGap) {\n            \/\/ Already in a gap, wait for some data.\n\n        } else if (uint32_t(now - gapStart) >= 50) {\n            \/\/ We just found an inter-frame gap\n\n            inGap = true;\n            frames++;\n        }\n    }\n\n    return frames \/ (duration * 1e-6);\n}\n\nbool FcRemote::testFrameRate()\n{\n    const float goalFPS = 390;\n    const float maxFPS = 450;\n\n    target.log(target.LOG_NORMAL, \"FPS: Measuring frame rate...\");\n    float fps = measureFrameRate();\n    target.log(target.LOG_NORMAL, \"FPS: Measured %.2f frames\/sec\", fps);\n\n    if (fps > maxFPS) {\n        target.log(target.LOG_ERROR, \"FPS: ERROR, frame rate of %.2f frames\/sec is unrealistically high!\", fps);\n        return false;\n    }\n\n    if (fps < goalFPS) {\n        target.log(target.LOG_ERROR, \"FPS: ERROR, frame rate of %.2f frames\/sec is below goal of %.2f!\",\n            fps, goalFPS);\n        return false;\n    }\n\n    return true;\n}\n<commit_msg>Ugh, lower the goal FPS to 375<commit_after>\/*\n * Remote control for the Fadecandy firmware, using the ARM debug interface.\n * \n * Copyright (c) 2013 Micah Elizabeth Scott\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#include <Arduino.h>\n#include \"fc_remote.h\"\n#include \"testjig.h\"\n#include \"firmware_data.h\"\n\n\nbool FcRemote::installFirmware()\n{\n    \/\/ Install firmware, blinking both target and local LEDs in unison.\n\n    bool blink = false;\n    ARMKinetisDebug::FlashProgrammer programmer(target, fw_data, fw_sectorCount);\n\n    if (!programmer.begin())\n        return false;\n\n    while (!programmer.isComplete()) {\n        blink = !blink;\n        if (!programmer.next()) return false;\n        if (!setLED(blink)) return false;\n        digitalWrite(ledPin, blink);\n    }\n\n    return true;\n}\n\nbool FcRemote::boot()\n{\n    \/\/ Run the new firmware, and let it boot\n    if (!target.reset())\n        return false;\n    delay(50);\n    return true;\n}\n\nbool FcRemote::setLED(bool on)\n{\n    const unsigned pin = target.PTC5;\n    return\n        target.pinMode(pin, OUTPUT) &&\n        target.digitalWrite(pin, on);\n}\n\nbool FcRemote::setFlags(uint8_t cflag)\n{\n    \/\/ Set control flags\n    return target.memStoreByte(fw_pFlags, cflag);\n}\n\nbool FcRemote::initLUT()\n{\n    \/\/ Install a trivial identity-mapping LUT, writing directly to the firmware's LUT buffer.\n    for (unsigned channel = 0; channel < 3; channel++) {\n        for (unsigned index = 0; index < LUT_CH_SIZE; index++) {\n            if (!setLUT(channel, index, index << 8))\n                return false;\n        }\n    }\n    return true;\n}\n\nbool FcRemote::setLUT(unsigned channel, unsigned index, int value)\n{\n    return target.memStoreHalf(fw_pLUT + 2*(index + channel*LUT_CH_SIZE), constrain(value, 0, 0xFFFF));\n}\n\nbool FcRemote::setPixel(unsigned index, int red, int green, int blue)\n{\n    \/\/ Write one pixel directly into the fbNext framebuffer on the target.\n\n    uint32_t idPacket = index \/ PIXELS_PER_PACKET;\n    uint32_t idOffset = fw_usbPacketBufOffset + 1 + (index % PIXELS_PER_PACKET) * 3;\n\n    uint32_t fb;        \/\/ Address of the current fcFramebuffer bound to fbNext\n    uint32_t packet;    \/\/ Pointer to usb_packet in question\n\n    return\n        target.memLoad(fw_pFbNext, fb) &&\n        target.memLoad(fb + idPacket*4, packet) &&\n        target.memStoreByte(packet + idOffset + 0, constrain(red, 0, 255)) &&\n        target.memStoreByte(packet + idOffset + 1, constrain(green, 0, 255)) &&\n        target.memStoreByte(packet + idOffset + 2, constrain(blue, 0, 255));\n}\n\nfloat FcRemote::measureFrameRate(float minDuration)\n{\n    \/\/ Use the end-to-end LED data signal to measure the overall system frame rate.\n    \/\/ Gaps of >50us indicate frame boundaries\n\n    pinMode(dataFeedbackPin, INPUT);\n\n    uint32_t minMicros = minDuration * 1000000;\n    uint32_t startTime = micros();\n    uint32_t gapStart = 0;\n    bool inGap = false;\n    uint32_t frames = 0;\n    uint32_t duration;\n\n    while (1) {\n        long now = micros();\n        duration = now - startTime;\n        if (duration >= minMicros)\n            break;\n\n        if (digitalRead(dataFeedbackPin)) {\n            \/\/ Definitely not in a gap, found some data\n            inGap = false;\n            gapStart = now;\n\n        } else if (inGap) {\n            \/\/ Already in a gap, wait for some data.\n\n        } else if (uint32_t(now - gapStart) >= 50) {\n            \/\/ We just found an inter-frame gap\n\n            inGap = true;\n            frames++;\n        }\n    }\n\n    return frames \/ (duration * 1e-6);\n}\n\nbool FcRemote::testFrameRate()\n{\n    const float goalFPS = 375;\n    const float maxFPS = 450;\n\n    target.log(target.LOG_NORMAL, \"FPS: Measuring frame rate...\");\n    float fps = measureFrameRate();\n    target.log(target.LOG_NORMAL, \"FPS: Measured %.2f frames\/sec\", fps);\n\n    if (fps > maxFPS) {\n        target.log(target.LOG_ERROR, \"FPS: ERROR, frame rate of %.2f frames\/sec is unrealistically high!\", fps);\n        return false;\n    }\n\n    if (fps < goalFPS) {\n        target.log(target.LOG_ERROR, \"FPS: ERROR, frame rate of %.2f frames\/sec is below goal of %.2f!\",\n            fps, goalFPS);\n        return false;\n    }\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Kopete , The KDE Instant Messenger\n    Copyright (c) 2001-2002 by Duncan Mac-Vicar Prett <duncan@kde.org>\n\n    Viva Chile Mierda!\n    Started at Wed Dec 26 03:12:10 CLST 2001, Santiago de Chile\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 <kcmdlineargs.h>\n#include <kaboutdata.h>\n#include \"kopeteapplication.h\"\n\n#include <dcopclient.h>\n#include \"kopeteiface.h\"\n#include \"kimifaceimpl.h\"\n\n#define KOPETE_VERSION \"0.8.90 (CVS >= 20040424)\"\n\nstatic const char description[] =\n\tI18N_NOOP( \"Kopete, the KDE Instant Messenger\" );\n\nstatic KCmdLineOptions options[] =\n{\n\t{ \"noplugins\",              I18N_NOOP( \"Do not load plugins. This option overrides all other options.\" ), 0 },\n\t{ \"noconnect\",              I18N_NOOP( \"Disable auto-connection.\" ), 0 },\n\t{ \"autoconnect <accounts>\", I18N_NOOP( \"Auto-connect the specified accounts. Use a comma-separated list\\n\"\n\t\t\"to auto-connect multiple accounts.\" ), 0 },\n\t{ \"disable <plugins>\",      I18N_NOOP( \"Do not load the specified plugin. Use a comma-separated list\\n\"\n\t\t\"to disable multiple plugins.\" ), 0 },\n\t{ \"load-plugins <plugins>\", I18N_NOOP( \"Load only the specified plugins. Use a comma-separated list\\n\"\n\t\t\"to load multiple plugins. This option has no effect when\\n\"\n\t\t\"--noplugins is set and overrides all other plugin related\\n\"\n\t\t\"command line options.\" ), 0 },\n\/\/\t{ \"url <url>\",              I18N_NOOP( \"Load the given Kopete URL\" ), 0 },\n\/\/\t{ \"!+[plugin]\",            I18N_NOOP( \"Load specified plugins\" ), 0 },\n\t{ \"!+[URL]\",                 I18N_NOOP(\"URLs to pass to kopete \/ emoticon themes to install\"), 0},\n\tKCmdLineLastOption\n};\n\nint main( int argc, char *argv[] )\n{\n\tKAboutData aboutData( \"kopete\", I18N_NOOP(\"Kopete\"),\n\t\tKOPETE_VERSION, description, KAboutData::License_GPL,\n\t\tI18N_NOOP(\"(c) 2001-2004, Duncan Mac-Vicar Prett\\n(c) 2002-2004, Kopete Development Team\"), \"kopete-devel@kde.org\", \"http:\/\/kopete.kde.org\");\n\n\taboutData.addAuthor ( \"Duncan Mac-Vicar Prett\", I18N_NOOP(\"Original author, Developer\"), \"duncan@kde.org\", \"http:\/\/www.mac-vicar.org\/~duncan\" );\n\taboutData.addAuthor ( \"Stefan Gehn\", I18N_NOOP(\"Developer, Oscar plugin\"), \"metz@gehn.net\", \"http:\/\/metz.gehn.net\" );\n\taboutData.addAuthor ( \"Till Gerken\", I18N_NOOP(\"Developer, Jabber plugin maintainer\"), \"till@tantalo.net\");\n\taboutData.addAuthor ( \"Olivier Goffart\", I18N_NOOP(\"Developer, MSN plugin maintainer\"), \"ogoffart@tiscalinet.be\");\n\taboutData.addAuthor ( \"Andy Goossens\", I18N_NOOP(\"Developer\"), \"andygoossens@telenet.be\" );\n\taboutData.addAuthor ( \"Chris Howells\", I18N_NOOP(\"Developer, Connection status plugin author\"), \"howells@kde.org\", \"http:\/\/chrishowells.co.uk\");\n\taboutData.addAuthor ( \"Grzegorz Jaskiewicz\", I18N_NOOP(\"Developer, Gadu plugin maintainer\"), \"gj@pointblue.com.pl\" );\n\taboutData.addAuthor ( \"Jason Keirstead\", I18N_NOOP(\"Developer, IRC maintainer\"), \"jason@keirstead.org\", \"http:\/\/www.keirstead.org\");\n\taboutData.addAuthor ( \"Martijn Klingens\", I18N_NOOP(\"Developer\"), \"klingens@kde.org\" );\n\taboutData.addAuthor ( \"Matt Rogers\", I18N_NOOP(\"Developer, Yahoo plugin and Oscar plugin maintainer\"), \"mattrogers@sbcglobal.net\" );\n\taboutData.addAuthor ( \"Zack Rusin\", I18N_NOOP(\"Developer, original Gadu plugin author\"), \"zack@kde.org\" );\n\taboutData.addAuthor ( \"Richard Smith\", I18N_NOOP(\"Developer, Password handling\"), \"kde@metafoo.co.uk\" );\n\taboutData.addAuthor ( \"Will Stephenson\", I18N_NOOP(\"Developer, icons, various plugins\"), \"lists@stevello.free-online.co.uk\" );\n\taboutData.addAuthor ( \"Gav Wood\", I18N_NOOP(\"Developer, WinPopup plugin maintainer\"), \"gjw102@york.ac.uk\" );\n\n\taboutData.addCredit ( \"Luciash d' Being\", I18N_NOOP(\"Kopete's icon author\") );\n\taboutData.addCredit ( \"Steve Cable\", I18N_NOOP(\"Sounds\") );\n\taboutData.addCredit ( \"Justin Karneges\", I18N_NOOP(\"Iris Jabber Backend Library\") );\n\taboutData.addCredit ( \"Tom Linsky\", I18N_NOOP(\"OscarSocket author\"), \"twl6@po.cwru.edu\" );\n\taboutData.addCredit ( \"Olaf Lueg\", I18N_NOOP(\"Kmerlin MSN code\") );\n\t\n\taboutData.addCredit ( \"Nick Betcher\", I18N_NOOP(\"Former developer, project co-founder\"), \"nbetcher@kde.org\");\n\taboutData.addCredit ( \"Ryan Cumming\", I18N_NOOP(\"Former developer\"), \"ryan@kde.org\" );\n\taboutData.addCredit ( \"Andres Krapf\", I18N_NOOP(\"Former developer\"), \"dae@chez.com\" );\n\taboutData.addCredit ( \"Carsten Pfeiffer\", I18N_NOOP(\"Misc bugfixes and enhancements\"), \"pfeiffer@kde.org\" );\n\taboutData.addCredit ( \"Richard Stellingwerff\", I18N_NOOP(\"Former developer\"), \"remenic@linuxfromscratch.org\");\n\taboutData.addCredit ( \"Daniel Stone\", I18N_NOOP(\"Former developer, Jabber plugin author\"), \"daniel@fooishbar.org\", \"http:\/\/fooishbar.org\");\n\taboutData.addCredit ( \"Chris TenHarmsel\", I18N_NOOP(\"Former developer, Oscar plugin\"), \"tenharmsel@users.sourceforge.net\");\n\taboutData.addCredit ( \"Hendrik vom Lehn\", I18N_NOOP(\"Former developer\"), \"hennevl@hennevl.de\", \"http:\/\/www.hennevl.de\");\n\t\t\n\n\taboutData.setTranslator( I18N_NOOP(\"_: NAME OF TRANSLATORS\\nYour names\"),\n\t\tI18N_NOOP(\"_: EMAIL OF TRANSLATORS\\nYour emails\") );\n\n\tKCmdLineArgs::init( argc, argv, &aboutData );\n\tKCmdLineArgs::addCmdLineOptions( options ); \/\/ Add our own options.\n\tKUniqueApplication::addCmdLineOptions();\n\n\tKopeteApplication kopete;\n\tnew KIMIfaceImpl();\n\tkapp->dcopClient()->registerAs( \"kopete\", false );\n\tkapp->dcopClient()->setDefaultObject( (new KopeteIface())->objId() ); \/\/ Has to be called before exec\n\t\n\tkopete.exec();\n}\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n<commit_msg>CVS_SILENT version bump<commit_after>\/*\n    Kopete , The KDE Instant Messenger\n    Copyright (c) 2001-2002 by Duncan Mac-Vicar Prett <duncan@kde.org>\n\n    Viva Chile Mierda!\n    Started at Wed Dec 26 03:12:10 CLST 2001, Santiago de Chile\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 <kcmdlineargs.h>\n#include <kaboutdata.h>\n#include \"kopeteapplication.h\"\n\n#include <dcopclient.h>\n#include \"kopeteiface.h\"\n#include \"kimifaceimpl.h\"\n\n#define KOPETE_VERSION \"0.8.90 (CVS >= 20040616)\"\n\nstatic const char description[] =\n\tI18N_NOOP( \"Kopete, the KDE Instant Messenger\" );\n\nstatic KCmdLineOptions options[] =\n{\n\t{ \"noplugins\",              I18N_NOOP( \"Do not load plugins. This option overrides all other options.\" ), 0 },\n\t{ \"noconnect\",              I18N_NOOP( \"Disable auto-connection.\" ), 0 },\n\t{ \"autoconnect <accounts>\", I18N_NOOP( \"Auto-connect the specified accounts. Use a comma-separated list\\n\"\n\t\t\"to auto-connect multiple accounts.\" ), 0 },\n\t{ \"disable <plugins>\",      I18N_NOOP( \"Do not load the specified plugin. Use a comma-separated list\\n\"\n\t\t\"to disable multiple plugins.\" ), 0 },\n\t{ \"load-plugins <plugins>\", I18N_NOOP( \"Load only the specified plugins. Use a comma-separated list\\n\"\n\t\t\"to load multiple plugins. This option has no effect when\\n\"\n\t\t\"--noplugins is set and overrides all other plugin related\\n\"\n\t\t\"command line options.\" ), 0 },\n\/\/\t{ \"url <url>\",              I18N_NOOP( \"Load the given Kopete URL\" ), 0 },\n\/\/\t{ \"!+[plugin]\",            I18N_NOOP( \"Load specified plugins\" ), 0 },\n\t{ \"!+[URL]\",                 I18N_NOOP(\"URLs to pass to kopete \/ emoticon themes to install\"), 0},\n\tKCmdLineLastOption\n};\n\nint main( int argc, char *argv[] )\n{\n\tKAboutData aboutData( \"kopete\", I18N_NOOP(\"Kopete\"),\n\t\tKOPETE_VERSION, description, KAboutData::License_GPL,\n\t\tI18N_NOOP(\"(c) 2001-2004, Duncan Mac-Vicar Prett\\n(c) 2002-2004, Kopete Development Team\"), \"kopete-devel@kde.org\", \"http:\/\/kopete.kde.org\");\n\n\taboutData.addAuthor ( \"Duncan Mac-Vicar Prett\", I18N_NOOP(\"Original author, Developer\"), \"duncan@kde.org\", \"http:\/\/www.mac-vicar.org\/~duncan\" );\n\taboutData.addAuthor ( \"Stefan Gehn\", I18N_NOOP(\"Developer, Oscar plugin\"), \"metz@gehn.net\", \"http:\/\/metz.gehn.net\" );\n\taboutData.addAuthor ( \"Till Gerken\", I18N_NOOP(\"Developer, Jabber plugin maintainer\"), \"till@tantalo.net\");\n\taboutData.addAuthor ( \"Olivier Goffart\", I18N_NOOP(\"Developer, MSN plugin maintainer\"), \"ogoffart@tiscalinet.be\");\n\taboutData.addAuthor ( \"Andy Goossens\", I18N_NOOP(\"Developer\"), \"andygoossens@telenet.be\" );\n\taboutData.addAuthor ( \"Chris Howells\", I18N_NOOP(\"Developer, Connection status plugin author\"), \"howells@kde.org\", \"http:\/\/chrishowells.co.uk\");\n\taboutData.addAuthor ( \"Grzegorz Jaskiewicz\", I18N_NOOP(\"Developer, Gadu plugin maintainer\"), \"gj@pointblue.com.pl\" );\n\taboutData.addAuthor ( \"Jason Keirstead\", I18N_NOOP(\"Developer, IRC maintainer\"), \"jason@keirstead.org\", \"http:\/\/www.keirstead.org\");\n\taboutData.addAuthor ( \"Martijn Klingens\", I18N_NOOP(\"Developer\"), \"klingens@kde.org\" );\n\taboutData.addAuthor ( \"Matt Rogers\", I18N_NOOP(\"Developer, Yahoo plugin and Oscar plugin maintainer\"), \"mattrogers@sbcglobal.net\" );\n\taboutData.addAuthor ( \"Zack Rusin\", I18N_NOOP(\"Developer, original Gadu plugin author\"), \"zack@kde.org\" );\n\taboutData.addAuthor ( \"Richard Smith\", I18N_NOOP(\"Developer, Password handling\"), \"kde@metafoo.co.uk\" );\n\taboutData.addAuthor ( \"Will Stephenson\", I18N_NOOP(\"Developer, icons, various plugins\"), \"lists@stevello.free-online.co.uk\" );\n\taboutData.addAuthor ( \"Gav Wood\", I18N_NOOP(\"Developer, WinPopup plugin maintainer\"), \"gjw102@york.ac.uk\" );\n\n\taboutData.addCredit ( \"Luciash d' Being\", I18N_NOOP(\"Kopete's icon author\") );\n\taboutData.addCredit ( \"Steve Cable\", I18N_NOOP(\"Sounds\") );\n\taboutData.addCredit ( \"Justin Karneges\", I18N_NOOP(\"Iris Jabber Backend Library\") );\n\taboutData.addCredit ( \"Tom Linsky\", I18N_NOOP(\"OscarSocket author\"), \"twl6@po.cwru.edu\" );\n\taboutData.addCredit ( \"Olaf Lueg\", I18N_NOOP(\"Kmerlin MSN code\") );\n\t\n\taboutData.addCredit ( \"Nick Betcher\", I18N_NOOP(\"Former developer, project co-founder\"), \"nbetcher@kde.org\");\n\taboutData.addCredit ( \"Ryan Cumming\", I18N_NOOP(\"Former developer\"), \"ryan@kde.org\" );\n\taboutData.addCredit ( \"Andres Krapf\", I18N_NOOP(\"Former developer\"), \"dae@chez.com\" );\n\taboutData.addCredit ( \"Carsten Pfeiffer\", I18N_NOOP(\"Misc bugfixes and enhancements\"), \"pfeiffer@kde.org\" );\n\taboutData.addCredit ( \"Richard Stellingwerff\", I18N_NOOP(\"Former developer\"), \"remenic@linuxfromscratch.org\");\n\taboutData.addCredit ( \"Daniel Stone\", I18N_NOOP(\"Former developer, Jabber plugin author\"), \"daniel@fooishbar.org\", \"http:\/\/fooishbar.org\");\n\taboutData.addCredit ( \"Chris TenHarmsel\", I18N_NOOP(\"Former developer, Oscar plugin\"), \"tenharmsel@users.sourceforge.net\");\n\taboutData.addCredit ( \"Hendrik vom Lehn\", I18N_NOOP(\"Former developer\"), \"hennevl@hennevl.de\", \"http:\/\/www.hennevl.de\");\n\t\t\n\n\taboutData.setTranslator( I18N_NOOP(\"_: NAME OF TRANSLATORS\\nYour names\"),\n\t\tI18N_NOOP(\"_: EMAIL OF TRANSLATORS\\nYour emails\") );\n\n\tKCmdLineArgs::init( argc, argv, &aboutData );\n\tKCmdLineArgs::addCmdLineOptions( options ); \/\/ Add our own options.\n\tKUniqueApplication::addCmdLineOptions();\n\n\tKopeteApplication kopete;\n\tnew KIMIfaceImpl();\n\tkapp->dcopClient()->registerAs( \"kopete\", false );\n\tkapp->dcopClient()->setDefaultObject( (new KopeteIface())->objId() ); \/\/ Has to be called before exec\n\t\n\tkopete.exec();\n}\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n<|endoftext|>"}
{"text":"<commit_before>#include <babylon\/rendering\/outline_renderer.h>\r\n\r\n#include <babylon\/bones\/skeleton.h>\r\n#include <babylon\/cameras\/camera.h>\r\n#include <babylon\/engines\/constants.h>\r\n#include <babylon\/engines\/engine.h>\r\n#include <babylon\/engines\/scene.h>\r\n#include <babylon\/materials\/effect.h>\r\n#include <babylon\/materials\/effect_fallbacks.h>\r\n#include <babylon\/materials\/ieffect_creation_options.h>\r\n#include <babylon\/materials\/material.h>\r\n#include <babylon\/materials\/material_helper.h>\r\n#include <babylon\/materials\/textures\/base_texture.h>\r\n#include <babylon\/meshes\/_instances_batch.h>\r\n#include <babylon\/meshes\/sub_mesh.h>\r\n#include <babylon\/meshes\/vertex_buffer.h>\r\n#include <babylon\/misc\/string_tools.h>\r\n#include <babylon\/morph\/morph_target_manager.h>\r\n#include <babylon\/states\/alpha_state.h>\r\n\r\nnamespace BABYLON {\r\n\r\nOutlineRenderer::OutlineRenderer(Scene* iScene) : zOffset{1.f}\r\n{\r\n  ISceneComponent::name = OutlineRenderer::name;\r\n  scene                 = iScene;\r\n  _engine               = scene->getEngine();\r\n}\r\n\r\nOutlineRenderer::~OutlineRenderer() = default;\r\n\r\nvoid OutlineRenderer::addToScene(const OutlineRendererPtr& outlineRenderer)\r\n{\r\n  scene->_addComponent(outlineRenderer);\r\n}\r\n\r\nvoid OutlineRenderer::_register()\r\n{\r\n  scene->_beforeRenderingMeshStage.registerStep(\r\n    SceneComponentConstants::STEP_BEFORERENDERINGMESH_OUTLINE, this,\r\n    [this](Mesh* mesh, SubMesh* subMesh, const _InstancesBatchPtr& batch) {\r\n      _beforeRenderingMesh(mesh, subMesh, batch);\r\n    });\r\n  scene->_afterRenderingMeshStage.registerStep(\r\n    SceneComponentConstants::STEP_AFTERRENDERINGMESH_OUTLINE, this,\r\n    [this](Mesh* mesh, SubMesh* subMesh, const _InstancesBatchPtr& batch) {\r\n      _afterRenderingMesh(mesh, subMesh, batch);\r\n    });\r\n}\r\n\r\nvoid OutlineRenderer::rebuild()\r\n{\r\n  \/\/ Nothing to do here.\r\n}\r\n\r\nvoid OutlineRenderer::dispose()\r\n{\r\n  \/\/ Nothing to do here.\r\n}\r\n\r\nvoid OutlineRenderer::render(SubMesh* subMesh, const _InstancesBatchPtr& batch, bool useOverlay)\r\n{\r\n  auto engine = scene->getEngine();\r\n\r\n  bool hardwareInstancedRendering\r\n    = engine->getCaps().instancedArrays\r\n      && (batch->visibleInstances.find(subMesh->_id) != batch->visibleInstances.end())\r\n      && (!batch->visibleInstances[subMesh->_id].empty());\r\n\r\n  if (!isReady(subMesh, hardwareInstancedRendering)) {\r\n    return;\r\n  }\r\n\r\n  auto mesh     = subMesh->getRenderingMesh();\r\n  auto material = subMesh->getMaterial();\r\n\r\n  if (!material || !scene->activeCamera()) {\r\n    return;\r\n  }\r\n\r\n  engine->enableEffect(_effect);\r\n\r\n  \/\/ Logarithmic depth\r\n  if (material->useLogarithmicDepth()) {\r\n    _effect->setFloat(\"logarithmicDepthConstant\",\r\n                      2.f \/ (std::log(scene->activeCamera()->maxZ + 1.f) \/ Math::LN2));\r\n  }\r\n\r\n  _effect->setFloat(\"offset\", useOverlay ? 0 : mesh->outlineWidth);\r\n  _effect->setColor4(\"color\", useOverlay ? mesh->overlayColor : mesh->outlineColor,\r\n                     useOverlay ? mesh->overlayAlpha : material->alpha());\r\n  _effect->setMatrix(\"viewProjection\", scene->getTransformMatrix());\r\n\r\n  \/\/ Bones\r\n  if (mesh->useBones() && mesh->computeBonesUsingShaders() && mesh->skeleton()) {\r\n    _effect->setMatrices(\"mBones\", mesh->skeleton()->getTransformMatrices(mesh.get()));\r\n  }\r\n\r\n  \/\/ Morph targets\r\n  MaterialHelper::BindMorphTargetParameters(mesh.get(), _effect);\r\n\r\n  mesh->_bind(subMesh, _effect, Material::TriangleFillMode);\r\n\r\n  \/\/ Alpha test\r\n  if (material && material->needAlphaTesting()) {\r\n    auto alphaTexture = material->getAlphaTestTexture();\r\n    if (alphaTexture) {\r\n      _effect->setTexture(\"diffuseSampler\", alphaTexture);\r\n      _effect->setMatrix(\"diffuseMatrix\", *alphaTexture->getTextureMatrix());\r\n    }\r\n  }\r\n\r\n  engine->setZOffset(-zOffset);\r\n\r\n  mesh->_processRendering(\r\n    subMesh, _effect, Material::TriangleFillMode, batch, hardwareInstancedRendering,\r\n    [this](bool, const Matrix& world, Material*) { _effect->setMatrix(\"world\", world); });\r\n\r\n  engine->setZOffset(0.f);\r\n}\r\n\r\nbool OutlineRenderer::isReady(SubMesh* subMesh, bool useInstances)\r\n{\r\n  std::vector<std::string> defines;\r\n  std::vector<std::string> attribs{VertexBuffer::PositionKind, VertexBuffer::NormalKind};\r\n\r\n  auto mesh     = subMesh->getMesh();\r\n  auto material = subMesh->getMaterial();\r\n\r\n  if (material) {\r\n    \/\/ Alpha test\r\n    if (material->needAlphaTesting()) {\r\n      defines.emplace_back(\"#define ALPHATEST\");\r\n      if (mesh->isVerticesDataPresent(VertexBuffer::UVKind)) {\r\n        attribs.emplace_back(VertexBuffer::UVKind);\r\n        defines.emplace_back(\"#define UV1\");\r\n      }\r\n      if (mesh->isVerticesDataPresent(VertexBuffer::UV2Kind)) {\r\n        attribs.emplace_back(VertexBuffer::UV2Kind);\r\n        defines.emplace_back(\"#define UV2\");\r\n      }\r\n    }\r\n\r\n    \/\/ Logarithmic depth\r\n    if (material->useLogarithmicDepth()) {\r\n      defines.emplace_back(\"#define LOGARITHMICDEPTH\");\r\n    }\r\n  }\r\n\r\n  \/\/ Bones\r\n  if (mesh->useBones() && mesh->computeBonesUsingShaders()) {\r\n    attribs.emplace_back(VertexBuffer::MatricesIndicesKind);\r\n    attribs.emplace_back(VertexBuffer::MatricesWeightsKind);\r\n    if (mesh->numBoneInfluencers() > 4) {\r\n      attribs.emplace_back(VertexBuffer::MatricesIndicesExtraKind);\r\n      attribs.emplace_back(VertexBuffer::MatricesWeightsExtraKind);\r\n    }\r\n    defines.emplace_back(\"#define NUM_BONE_INFLUENCERS \"\r\n                         + std::to_string(mesh->numBoneInfluencers()));\r\n    defines.emplace_back(\r\n      \"#define BonesPerMesh \"\r\n      + std::to_string((mesh->skeleton() ? mesh->skeleton()->bones.size() + 1 : 0)));\r\n  }\r\n  else {\r\n    defines.emplace_back(\"#define NUM_BONE_INFLUENCERS 0\");\r\n  }\r\n\r\n  \/\/ Morph targets\r\n  auto morphTargetManager  = std::static_pointer_cast<Mesh>(mesh)->morphTargetManager();\r\n  auto numMorphInfluencers = 0ull;\r\n  if (morphTargetManager) {\r\n    if (morphTargetManager->numInfluencers() > 0) {\r\n      numMorphInfluencers = morphTargetManager->numInfluencers();\r\n\r\n      defines.emplace_back(\"#define MORPHTARGETS\");\r\n      defines.emplace_back(\"#define NUM_MORPH_INFLUENCERS \" + std::to_string(numMorphInfluencers));\r\n\r\n      MaterialHelper::PrepareAttributesForMorphTargetsInfluencers(\r\n        attribs, mesh.get(), static_cast<unsigned int>(numMorphInfluencers));\r\n    }\r\n  }\r\n\r\n  \/\/ Instances\r\n  if (useInstances) {\r\n    defines.emplace_back(\"#define INSTANCES\");\r\n    MaterialHelper::PushAttributesForInstances(attribs);\r\n  }\r\n\r\n  \/\/ Get correct effect\r\n  auto join = StringTools::join(defines, '\\n');\r\n  if (_cachedDefines != join) {\r\n    _cachedDefines = join;\r\n\r\n    IEffectCreationOptions options;\r\n    options.attributes = std::move(attribs);\r\n    options.uniformsNames\r\n      = {\"world\",  \"mBones\", \"viewProjection\",           \"diffuseMatrix\",\r\n         \"offset\", \"color\",  \"logarithmicDepthConstant\", \"morphTargetInfluences\"};\r\n    options.samplers = {\"diffuseSampler\"};\r\n    options.defines  = std::move(join);\r\n    options.indexParameters\r\n      = {{\"maxSimultaneousMorphTargets\", static_cast<unsigned>(numMorphInfluencers)}};\r\n\r\n    _effect = scene->getEngine()->createEffect(\"outline\", options, scene->getEngine());\r\n  }\r\n\r\n  return _effect->isReady();\r\n}\r\n\r\nvoid OutlineRenderer::_beforeRenderingMesh(Mesh* mesh, SubMesh* subMesh,\r\n                                           const _InstancesBatchPtr& batch)\r\n{\r\n  \/\/ Outline - step 1\r\n  _savedDepthWrite = _engine->getDepthWrite();\r\n  if (mesh->renderOutline) {\r\n    auto material = subMesh->getMaterial();\r\n    if (material && material->needAlphaBlending()) {\r\n      _engine->cacheStencilState();\r\n      \/\/ Draw only to stencil buffer for the original mesh\r\n      \/\/ The resulting stencil buffer will be used so the outline is not visible inside the mesh\r\n      \/\/ when the mesh is transparent\r\n      _engine->setDepthWrite(false);\r\n      _engine->setColorWrite(false);\r\n      _engine->setStencilBuffer(true);\r\n      _engine->setStencilOperationPass(Constants::REPLACE);\r\n      _engine->setStencilFunction(Constants::ALWAYS);\r\n      _engine->setStencilMask(OutlineRenderer::_StencilReference);\r\n      _engine->setStencilFunctionReference(OutlineRenderer::_StencilReference);\r\n      render(subMesh, batch, \/* This sets offset to 0 *\/ true);\r\n\r\n      _engine->setColorWrite(true);\r\n      _engine->setStencilFunction(Constants::NOTEQUAL);\r\n    }\r\n\r\n    \/\/ Draw the outline using the above stencil if needed to avoid drawing within the mesh\r\n    _engine->setDepthWrite(false);\r\n    render(subMesh, batch);\r\n    _engine->setDepthWrite(_savedDepthWrite);\r\n\r\n    if (material && material->needAlphaBlending()) {\r\n      _engine->restoreStencilState();\r\n    }\r\n  }\r\n}\r\n\r\nvoid OutlineRenderer::_afterRenderingMesh(Mesh* mesh, SubMesh* subMesh,\r\n                                          const _InstancesBatchPtr& batch)\r\n{\r\n  \/\/ Overlay\r\n  if (mesh->renderOverlay) {\r\n    auto currentMode     = _engine->getAlphaMode();\r\n    auto alphaBlendState = _engine->alphaState()->alphaBlend();\r\n    _engine->setAlphaMode(Constants::ALPHA_COMBINE);\r\n    render(subMesh, batch, true);\r\n    _engine->setAlphaMode(currentMode);\r\n    _engine->setDepthWrite(_savedDepthWrite);\r\n    _engine->alphaState()->alphaBlend = alphaBlendState;\r\n  }\r\n\r\n  \/\/ Outline - step 2\r\n  if (mesh->renderOutline && _savedDepthWrite) {\r\n    _engine->setDepthWrite(true);\r\n    _engine->setColorWrite(false);\r\n    render(subMesh, batch);\r\n    _engine->setColorWrite(true);\r\n  }\r\n}\r\n\r\n} \/\/ end of namespace BABYLON\r\n<commit_msg>Updated OutlineRenderer class to v4.1.0-beta.23<commit_after>#include <babylon\/rendering\/outline_renderer.h>\r\n\r\n#include <babylon\/bones\/skeleton.h>\r\n#include <babylon\/cameras\/camera.h>\r\n#include <babylon\/engines\/constants.h>\r\n#include <babylon\/engines\/engine.h>\r\n#include <babylon\/engines\/scene.h>\r\n#include <babylon\/materials\/effect.h>\r\n#include <babylon\/materials\/effect_fallbacks.h>\r\n#include <babylon\/materials\/ieffect_creation_options.h>\r\n#include <babylon\/materials\/material.h>\r\n#include <babylon\/materials\/material_helper.h>\r\n#include <babylon\/materials\/textures\/base_texture.h>\r\n#include <babylon\/meshes\/_instances_batch.h>\r\n#include <babylon\/meshes\/sub_mesh.h>\r\n#include <babylon\/meshes\/vertex_buffer.h>\r\n#include <babylon\/misc\/string_tools.h>\r\n#include <babylon\/morph\/morph_target_manager.h>\r\n#include <babylon\/states\/alpha_state.h>\r\n\r\nnamespace BABYLON {\r\n\r\nOutlineRenderer::OutlineRenderer(Scene* iScene) : zOffset{1.f}\r\n{\r\n  ISceneComponent::name = OutlineRenderer::name;\r\n  scene                 = iScene;\r\n  _engine               = scene->getEngine();\r\n}\r\n\r\nOutlineRenderer::~OutlineRenderer() = default;\r\n\r\nvoid OutlineRenderer::addToScene(const OutlineRendererPtr& outlineRenderer)\r\n{\r\n  scene->_addComponent(outlineRenderer);\r\n}\r\n\r\nvoid OutlineRenderer::_register()\r\n{\r\n  scene->_beforeRenderingMeshStage.registerStep(\r\n    SceneComponentConstants::STEP_BEFORERENDERINGMESH_OUTLINE, this,\r\n    [this](Mesh* mesh, SubMesh* subMesh, const _InstancesBatchPtr& batch) {\r\n      _beforeRenderingMesh(mesh, subMesh, batch);\r\n    });\r\n  scene->_afterRenderingMeshStage.registerStep(\r\n    SceneComponentConstants::STEP_AFTERRENDERINGMESH_OUTLINE, this,\r\n    [this](Mesh* mesh, SubMesh* subMesh, const _InstancesBatchPtr& batch) {\r\n      _afterRenderingMesh(mesh, subMesh, batch);\r\n    });\r\n}\r\n\r\nvoid OutlineRenderer::rebuild()\r\n{\r\n  \/\/ Nothing to do here.\r\n}\r\n\r\nvoid OutlineRenderer::dispose()\r\n{\r\n  \/\/ Nothing to do here.\r\n}\r\n\r\nvoid OutlineRenderer::render(SubMesh* subMesh, const _InstancesBatchPtr& batch, bool useOverlay)\r\n{\r\n  auto engine = scene->getEngine();\r\n\r\n  bool hardwareInstancedRendering\r\n    = engine->getCaps().instancedArrays\r\n      && (batch->visibleInstances.find(subMesh->_id) != batch->visibleInstances.end())\r\n      && (!batch->visibleInstances[subMesh->_id].empty());\r\n\r\n  if (!isReady(subMesh, hardwareInstancedRendering)) {\r\n    return;\r\n  }\r\n\r\n  auto mesh     = subMesh->getRenderingMesh();\r\n  auto material = subMesh->getMaterial();\r\n\r\n  if (!material || !scene->activeCamera()) {\r\n    return;\r\n  }\r\n\r\n  engine->enableEffect(_effect);\r\n\r\n  \/\/ Logarithmic depth\r\n  if (material->useLogarithmicDepth()) {\r\n    _effect->setFloat(\"logarithmicDepthConstant\",\r\n                      2.f \/ (std::log(scene->activeCamera()->maxZ + 1.f) \/ Math::LN2));\r\n  }\r\n\r\n  _effect->setFloat(\"offset\", useOverlay ? 0 : mesh->outlineWidth);\r\n  _effect->setColor4(\"color\", useOverlay ? mesh->overlayColor : mesh->outlineColor,\r\n                     useOverlay ? mesh->overlayAlpha : material->alpha());\r\n  _effect->setMatrix(\"viewProjection\", scene->getTransformMatrix());\r\n\r\n  \/\/ Bones\r\n  if (mesh->useBones() && mesh->computeBonesUsingShaders() && mesh->skeleton()) {\r\n    _effect->setMatrices(\"mBones\", mesh->skeleton()->getTransformMatrices(mesh.get()));\r\n  }\r\n\r\n  \/\/ Morph targets\r\n  MaterialHelper::BindMorphTargetParameters(mesh.get(), _effect);\r\n\r\n  mesh->_bind(subMesh, _effect, material->fillMode());\r\n\r\n  \/\/ Alpha test\r\n  if (material && material->needAlphaTesting()) {\r\n    auto alphaTexture = material->getAlphaTestTexture();\r\n    if (alphaTexture) {\r\n      _effect->setTexture(\"diffuseSampler\", alphaTexture);\r\n      _effect->setMatrix(\"diffuseMatrix\", *alphaTexture->getTextureMatrix());\r\n    }\r\n  }\r\n\r\n  engine->setZOffset(-zOffset);\r\n\r\n  mesh->_processRendering(\r\n    subMesh, _effect, static_cast<int>(material->fillMode()), batch, hardwareInstancedRendering,\r\n    [this](bool, const Matrix& world, Material*) { _effect->setMatrix(\"world\", world); });\r\n\r\n  engine->setZOffset(0.f);\r\n}\r\n\r\nbool OutlineRenderer::isReady(SubMesh* subMesh, bool useInstances)\r\n{\r\n  std::vector<std::string> defines;\r\n  std::vector<std::string> attribs{VertexBuffer::PositionKind, VertexBuffer::NormalKind};\r\n\r\n  auto mesh     = subMesh->getMesh();\r\n  auto material = subMesh->getMaterial();\r\n\r\n  if (material) {\r\n    \/\/ Alpha test\r\n    if (material->needAlphaTesting()) {\r\n      defines.emplace_back(\"#define ALPHATEST\");\r\n      if (mesh->isVerticesDataPresent(VertexBuffer::UVKind)) {\r\n        attribs.emplace_back(VertexBuffer::UVKind);\r\n        defines.emplace_back(\"#define UV1\");\r\n      }\r\n      if (mesh->isVerticesDataPresent(VertexBuffer::UV2Kind)) {\r\n        attribs.emplace_back(VertexBuffer::UV2Kind);\r\n        defines.emplace_back(\"#define UV2\");\r\n      }\r\n    }\r\n\r\n    \/\/ Logarithmic depth\r\n    if (material->useLogarithmicDepth()) {\r\n      defines.emplace_back(\"#define LOGARITHMICDEPTH\");\r\n    }\r\n  }\r\n\r\n  \/\/ Bones\r\n  if (mesh->useBones() && mesh->computeBonesUsingShaders()) {\r\n    attribs.emplace_back(VertexBuffer::MatricesIndicesKind);\r\n    attribs.emplace_back(VertexBuffer::MatricesWeightsKind);\r\n    if (mesh->numBoneInfluencers() > 4) {\r\n      attribs.emplace_back(VertexBuffer::MatricesIndicesExtraKind);\r\n      attribs.emplace_back(VertexBuffer::MatricesWeightsExtraKind);\r\n    }\r\n    defines.emplace_back(\"#define NUM_BONE_INFLUENCERS \"\r\n                         + std::to_string(mesh->numBoneInfluencers()));\r\n    defines.emplace_back(\r\n      \"#define BonesPerMesh \"\r\n      + std::to_string((mesh->skeleton() ? mesh->skeleton()->bones.size() + 1 : 0)));\r\n  }\r\n  else {\r\n    defines.emplace_back(\"#define NUM_BONE_INFLUENCERS 0\");\r\n  }\r\n\r\n  \/\/ Morph targets\r\n  auto morphTargetManager  = std::static_pointer_cast<Mesh>(mesh)->morphTargetManager();\r\n  auto numMorphInfluencers = 0ull;\r\n  if (morphTargetManager) {\r\n    if (morphTargetManager->numInfluencers() > 0) {\r\n      numMorphInfluencers = morphTargetManager->numInfluencers();\r\n\r\n      defines.emplace_back(\"#define MORPHTARGETS\");\r\n      defines.emplace_back(\"#define NUM_MORPH_INFLUENCERS \" + std::to_string(numMorphInfluencers));\r\n\r\n      MaterialHelper::PrepareAttributesForMorphTargetsInfluencers(\r\n        attribs, mesh.get(), static_cast<unsigned int>(numMorphInfluencers));\r\n    }\r\n  }\r\n\r\n  \/\/ Instances\r\n  if (useInstances) {\r\n    defines.emplace_back(\"#define INSTANCES\");\r\n    MaterialHelper::PushAttributesForInstances(attribs);\r\n  }\r\n\r\n  \/\/ Get correct effect\r\n  auto join = StringTools::join(defines, '\\n');\r\n  if (_cachedDefines != join) {\r\n    _cachedDefines = join;\r\n\r\n    IEffectCreationOptions options;\r\n    options.attributes = std::move(attribs);\r\n    options.uniformsNames\r\n      = {\"world\",  \"mBones\", \"viewProjection\",           \"diffuseMatrix\",\r\n         \"offset\", \"color\",  \"logarithmicDepthConstant\", \"morphTargetInfluences\"};\r\n    options.samplers = {\"diffuseSampler\"};\r\n    options.defines  = std::move(join);\r\n    options.indexParameters\r\n      = {{\"maxSimultaneousMorphTargets\", static_cast<unsigned>(numMorphInfluencers)}};\r\n\r\n    _effect = scene->getEngine()->createEffect(\"outline\", options, scene->getEngine());\r\n  }\r\n\r\n  return _effect->isReady();\r\n}\r\n\r\nvoid OutlineRenderer::_beforeRenderingMesh(Mesh* mesh, SubMesh* subMesh,\r\n                                           const _InstancesBatchPtr& batch)\r\n{\r\n  \/\/ Outline - step 1\r\n  _savedDepthWrite = _engine->getDepthWrite();\r\n  if (mesh->renderOutline) {\r\n    auto material = subMesh->getMaterial();\r\n    if (material && material->needAlphaBlending()) {\r\n      _engine->cacheStencilState();\r\n      \/\/ Draw only to stencil buffer for the original mesh\r\n      \/\/ The resulting stencil buffer will be used so the outline is not visible inside the mesh\r\n      \/\/ when the mesh is transparent\r\n      _engine->setDepthWrite(false);\r\n      _engine->setColorWrite(false);\r\n      _engine->setStencilBuffer(true);\r\n      _engine->setStencilOperationPass(Constants::REPLACE);\r\n      _engine->setStencilFunction(Constants::ALWAYS);\r\n      _engine->setStencilMask(OutlineRenderer::_StencilReference);\r\n      _engine->setStencilFunctionReference(OutlineRenderer::_StencilReference);\r\n      render(subMesh, batch, \/* This sets offset to 0 *\/ true);\r\n\r\n      _engine->setColorWrite(true);\r\n      _engine->setStencilFunction(Constants::NOTEQUAL);\r\n    }\r\n\r\n    \/\/ Draw the outline using the above stencil if needed to avoid drawing within the mesh\r\n    _engine->setDepthWrite(false);\r\n    render(subMesh, batch);\r\n    _engine->setDepthWrite(_savedDepthWrite);\r\n\r\n    if (material && material->needAlphaBlending()) {\r\n      _engine->restoreStencilState();\r\n    }\r\n  }\r\n}\r\n\r\nvoid OutlineRenderer::_afterRenderingMesh(Mesh* mesh, SubMesh* subMesh,\r\n                                          const _InstancesBatchPtr& batch)\r\n{\r\n  \/\/ Overlay\r\n  if (mesh->renderOverlay) {\r\n    auto currentMode     = _engine->getAlphaMode();\r\n    auto alphaBlendState = _engine->alphaState()->alphaBlend();\r\n    _engine->setAlphaMode(Constants::ALPHA_COMBINE);\r\n    render(subMesh, batch, true);\r\n    _engine->setAlphaMode(currentMode);\r\n    _engine->setDepthWrite(_savedDepthWrite);\r\n    _engine->alphaState()->alphaBlend = alphaBlendState;\r\n  }\r\n\r\n  \/\/ Outline - step 2\r\n  if (mesh->renderOutline && _savedDepthWrite) {\r\n    _engine->setDepthWrite(true);\r\n    _engine->setColorWrite(false);\r\n    render(subMesh, batch);\r\n    _engine->setColorWrite(true);\r\n  }\r\n}\r\n\r\n} \/\/ end of namespace BABYLON\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2014-2019 Real Logic 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#define DISABLE_BOUNDS_CHECKS 1\n\n#include <string>\n#include <benchmark\/benchmark.h>\n#include <thread>\n#include <atomic>\n\n#include \"concurrent\/Atomic64.h\"\n\nextern \"C\"\n{\n#include \"concurrent\/aeron_spsc_concurrent_array_queue.h\"\n#include \"util\/aeron_error.h\"\n}\n\nstatic void BM_C_SpscQueueLatency(benchmark::State &state)\n{\n    int* i = new int{42};\n    aeron_spsc_concurrent_array_queue_t q_in;\n    aeron_spsc_concurrent_array_queue_t q_out;\n\n    if (aeron_spsc_concurrent_array_queue_init(&q_in, 1024) < 0)\n    {\n        throw std::runtime_error(\"could not init q_in: \" + std::string(aeron_errmsg()));\n    }\n\n    if (aeron_spsc_concurrent_array_queue_init(&q_out, 1024) < 0)\n    {\n        throw std::runtime_error(\"could not init q_out: \" + std::string(aeron_errmsg()));\n    }\n\n    std::atomic<bool> start{false};\n    std::atomic<bool> running{true};\n\n    std::thread t(\n        [&]()\n        {\n            start.store(true);\n\n            while (running)\n            {\n                int* p = (int *)aeron_spsc_concurrent_array_queue_poll(&q_in);\n                if (p != nullptr)\n                {\n                    aeron_spsc_concurrent_array_queue_offer(&q_out, p);\n                }\n                else\n                {\n                    \/\/aeron::concurrent::atomic::cpu_pause();\n                }\n            }\n        });\n\n    while (!start)\n    {\n        ; \/\/ Spin\n    }\n\n    while (state.KeepRunning())\n    {\n        aeron_spsc_concurrent_array_queue_offer(&q_in, i);\n        while (aeron_spsc_concurrent_array_queue_poll(&q_out) == nullptr)\n        {\n            ; \/\/ spin\n        }\n    }\n\n    state.SetItemsProcessed(state.iterations());\n    state.SetBytesProcessed(state.iterations() * sizeof(int));\n\n    running.store(false);\n\n    t.join();\n}\n\nBENCHMARK(BM_C_SpscQueueLatency)->UseRealTime();\n\nstatic void BM_C_SpscQueueThroughput(benchmark::State &state)\n{\n    int* i = new int{42};\n    aeron_spsc_concurrent_array_queue_t q;\n\n    if (aeron_spsc_concurrent_array_queue_init(&q, state.range(0)) < 0)\n    {\n        throw std::runtime_error(\"could not init q: \" + std::string(aeron_errmsg()));\n    }\n\n    std::atomic<bool> start{false};\n    std::atomic<bool> running{true};\n    std::int64_t totalMsgs = 0;\n\n    std::thread t(\n        [&]()\n        {\n            start.store(true);\n\n            while (running)\n            {\n                if (nullptr == aeron_spsc_concurrent_array_queue_poll(&q))\n                {\n                    aeron::concurrent::atomic::cpu_pause();\n                }\n            }\n        });\n\n    while (!start)\n    {\n        ; \/\/ Spin\n    }\n\n    while (state.KeepRunning())\n    {\n        while (aeron_spsc_concurrent_array_queue_offer(&q, i) != AERON_OFFER_SUCCESS)\n        {\n            aeron::concurrent::atomic::cpu_pause();\n        }\n        totalMsgs++;\n    }\n\n    state.SetItemsProcessed(totalMsgs);\n    state.SetBytesProcessed(totalMsgs * sizeof(int));\n\n    running.store(false);\n\n    t.join();\n}\n\nBENCHMARK(BM_C_SpscQueueThroughput)\n    ->Arg(1024)\n    ->Arg(64 * 1024)\n    ->Arg(128 * 1024)\n    ->Arg(256 * 1024)\n    ->UseRealTime();\n\nBENCHMARK_MAIN();\n<commit_msg>[C++]: make baseline SPSC latency have bursts.<commit_after>\/*\n * Copyright 2014-2019 Real Logic 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#define DISABLE_BOUNDS_CHECKS 1\n\n#include <string>\n#include <benchmark\/benchmark.h>\n#include <thread>\n#include <atomic>\n\n#include \"concurrent\/Atomic64.h\"\n#include \"concurrent\/BusySpinIdleStrategy.h\"\n\nextern \"C\"\n{\n#include \"concurrent\/aeron_spsc_concurrent_array_queue.h\"\n#include \"util\/aeron_error.h\"\n}\n\nusing namespace aeron::concurrent;\n\nint SENTINEL = 1000;\n\nstatic void BM_C_SpscQueueLatency(benchmark::State &state)\n{\n    const std::size_t burstLength = state.range(0);\n    aeron_spsc_concurrent_array_queue_t q_in;\n    aeron_spsc_concurrent_array_queue_t q_out;\n\n    if (aeron_spsc_concurrent_array_queue_init(&q_in, 64 * 1024) < 0)\n    {\n        throw std::runtime_error(\"could not init q_in: \" + std::string(aeron_errmsg()));\n    }\n\n    if (aeron_spsc_concurrent_array_queue_init(&q_out, 128) < 0)\n    {\n        throw std::runtime_error(\"could not init q_out: \" + std::string(aeron_errmsg()));\n    }\n\n    std::int32_t *values = new std::int32_t[burstLength];\n    for (std::size_t i = 0; i < burstLength; i++)\n    {\n        values[i] = -(burstLength - i);\n    }\n\n    values[burstLength - 1] = 0;\n\n    std::atomic<bool> start{false};\n    std::atomic<bool> running{true};\n\n    std::thread t(\n        [&]()\n        {\n            BusySpinIdleStrategy idle;\n            start.store(true);\n\n            while (running)\n            {\n                int* p = (int *)aeron_spsc_concurrent_array_queue_poll(&q_in);\n                if (p != nullptr)\n                {\n                    if (*p >= 0)\n                    {\n                        while (aeron_spsc_concurrent_array_queue_offer(&q_out, &SENTINEL) != AERON_OFFER_SUCCESS)\n                        {\n                            idle.idle();\n                        }\n                    }\n                }\n                else\n                {\n                    idle.idle();\n                }\n            }\n        });\n\n    while (!start)\n    {\n        std::this_thread::yield();\n    }\n\n    BusySpinIdleStrategy burstIdle;\n\n    while (state.KeepRunning())\n    {\n        for (std::size_t i = 0; i < burstLength; i++)\n        {\n            while (aeron_spsc_concurrent_array_queue_offer(&q_in, &values[i]) != AERON_OFFER_SUCCESS)\n            {\n                burstIdle.idle();\n            }\n        }\n\n        while (aeron_spsc_concurrent_array_queue_poll(&q_out) == nullptr)\n        {\n            burstIdle.idle();\n        }\n\n    }\n\n    state.SetItemsProcessed(state.iterations());\n    state.SetBytesProcessed(state.iterations() * sizeof(int));\n\n    running.store(false);\n\n    t.join();\n\n    delete [] values;\n\n    aeron_spsc_concurrent_array_queue_close(&q_in);\n    aeron_spsc_concurrent_array_queue_close(&q_out);\n}\n\nBENCHMARK(BM_C_SpscQueueLatency)\n    ->RangeMultiplier(4)\n    ->Range(1,100)\n    ->UseRealTime();\n\nstatic void BM_C_SpscQueueThroughput(benchmark::State &state)\n{\n    int* i = new int{42};\n    aeron_spsc_concurrent_array_queue_t q;\n\n    if (aeron_spsc_concurrent_array_queue_init(&q, state.range(0)) < 0)\n    {\n        throw std::runtime_error(\"could not init q: \" + std::string(aeron_errmsg()));\n    }\n\n    std::atomic<bool> start{false};\n    std::atomic<bool> running{true};\n    std::int64_t totalMsgs = 0;\n\n    std::thread t(\n        [&]()\n        {\n            start.store(true);\n\n            while (running)\n            {\n                if (nullptr == aeron_spsc_concurrent_array_queue_poll(&q))\n                {\n                    aeron::concurrent::atomic::cpu_pause();\n                }\n            }\n        });\n\n    while (!start)\n    {\n        ; \/\/ Spin\n    }\n\n    while (state.KeepRunning())\n    {\n        while (aeron_spsc_concurrent_array_queue_offer(&q, i) != AERON_OFFER_SUCCESS)\n        {\n            aeron::concurrent::atomic::cpu_pause();\n        }\n        totalMsgs++;\n    }\n\n    state.SetItemsProcessed(totalMsgs);\n    state.SetBytesProcessed(totalMsgs * sizeof(int));\n\n    running.store(false);\n\n    t.join();\n}\n\nBENCHMARK(BM_C_SpscQueueThroughput)\n    ->Arg(1024)\n    ->Arg(64 * 1024)\n    ->Arg(128 * 1024)\n    ->Arg(256 * 1024)\n    ->UseRealTime();\n\nBENCHMARK_MAIN();\n<|endoftext|>"}
{"text":"<commit_before>\/*\n*\n* Copyright 2013 Telefonica Investigacion y Desarrollo, S.A.U\n*\n* This file is part of Orion Context Broker.\n*\n* Orion Context Broker is free software: you can redistribute it and\/or\n* modify 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* Orion Context 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 Affero\n* General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with Orion Context Broker. If not, see http:\/\/www.gnu.org\/licenses\/.\n*\n* For those usages not covered by this license please contact with\n* iot_support at tid dot es\n*\n* Author: Ken Zangelin\n*\/\n#include <string>\n#include <vector>\n\n#include \"common\/string.h\"\n#include \"mongoBackend\/mongoQueryContext.h\"\n#include \"ngsi\/ParseData.h\"\n#include \"ngsi10\/QueryContextRequest.h\"\n#include \"ngsi10\/QueryContextResponse.h\"\n#include \"orionTypes\/QueryContextRequestVector.h\"\n#include \"orionTypes\/QueryContextResponseVector.h\"\n#include \"rest\/ConnectionInfo.h\"\n#include \"rest\/clientSocketHttp.h\"\n#include \"serviceRoutines\/postQueryContext.h\"\n#include \"xmlParse\/xmlRequest.h\"\n\n\n\n\/* ****************************************************************************\n*\n* xmlPayloadClean -\n*\/\nstatic char* xmlPayloadClean(const char*  payload, const char* payloadWord)\n{\n  return (char*) strstr(payload, payloadWord);\n}\n\n\n\n\/* ****************************************************************************\n*\n* queryForward - \n*\n* An entity\/attribute has been found on some context provider.\n* We need to forward the query request to the context provider, indicated in qcrsP->contextProvider\n*\n* 1. Parse the providing application to extract IP, port and URI-path\n* 2. Render an XML-string of the request we want to forward\n* 3. Send the request to the providing application (and await the response)\n* 4. Parse the XML response and fill in a binary QueryContextResponse\n* 5. Render QueryContextResponse from the providing application\n*\n*\/\nstatic void queryForward(ConnectionInfo* ciP, QueryContextRequest* qcrP, QueryContextResponse* qcrsP)\n{\n  std::string     ip;\n  std::string     protocol;\n  int             port;\n  std::string     prefix;\n  std::string     answer;\n\n\n  \/\/\n  \/\/ 1. Parse the providing application to extract IP, port and URI-path\n  \/\/\n  if (parseUrl(qcrP->contextProvider, ip, port, prefix, protocol) == false)\n  {\n    LM_W((\"Bad Input (invalid providing application '%s')\", qcrP->contextProvider.c_str()));\n    \/\/  Somehow, if we accepted this providing application, it is the brokers fault ...\n    \/\/  SccBadRequest should have been returned before, when it was registered!\n\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"\");\n    return;\n  }\n\n\n  \/\/\n  \/\/ 2. Render an XML-string of the request we want to forward\n  \/\/\n  std::string  payload = qcrP->render(QueryContext, XML, \"\");\n  char*        cleanPayload;\n\n  if ((cleanPayload = xmlPayloadClean(payload.c_str(), \"<queryContextRequest>\")) == NULL)\n  {\n    LM_E((\"Runtime Error (error rendering forward-request)\"));\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"\");\n    return;\n  }\n\n\n  \/\/\n  \/\/ 3. Send the request to the Context Provider (and await the reply)\n  \/\/ FIXME P7: Should Rush be used?\n  \/\/\n  std::string     out;\n  std::string     verb         = \"POST\";\n  std::string     resource     = prefix + \"\/queryContext\";\n  std::string     tenant       = ciP->tenant;\n  std::string     servicePath  = (ciP->httpHeaders.servicePathReceived == true)? ciP->httpHeaders.servicePath : \"\";\n\n  out = sendHttpSocket(ip,\n                       port,\n                       protocol,\n                       verb,\n                       tenant,\n                       servicePath,\n                       ciP->httpHeaders.xauthToken,\n                       resource,\n                       \"application\/xml\",\n                       payload,\n                       false,\n                       true);\n\n  if ((out == \"error\") || (out == \"\"))\n  {\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"\");\n    LM_E((\"Runtime Error (error forwarding 'Query' to providing application)\"));\n    return;\n  }\n\n\n  \/\/\n  \/\/ 5. Parse the XML response and fill in a binary QueryContextResponse\n  \/\/\n  std::string  s;\n  std::string  errorMsg;\n\n  cleanPayload = xmlPayloadClean(out.c_str(), \"<queryContextResponse>\");\n\n  if ((cleanPayload == NULL) || (cleanPayload[0] == 0))\n  {\n    \/\/\n    \/\/ This is really an internal error in the Context Provider\n    \/\/ It is not in the orion broker though, so 404 is returned\n    \/\/\n    LM_W((\"Other Error (context provider response to QueryContext is empty)\"));\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"invalid context provider response\");\n    return;\n  }\n\n  \/\/\n  \/\/ NOTE\n  \/\/ When coming from a convenience operation, such as GET \/v1\/contextEntities\/EID\/attributes\/attrName,\n  \/\/ the verb\/method in ciP is GET. However, the parsing function expects a POST, as if it came from a \n  \/\/ POST \/v1\/queryContext. \n  \/\/ So, here we change the verb\/method for POST.\n  \/\/\n  ParseData parseData;\n\n  ciP->verb   = POST;\n  ciP->method = \"POST\";\n\n  s = xmlTreat(cleanPayload, ciP, &parseData, RtQueryContextResponse, \"queryContextResponse\", NULL, &errorMsg);\n  if (s != \"OK\")\n  {\n    LM_W((\"Internal Error (error parsing reply from prov app: %s)\", errorMsg.c_str()));\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"\");\n    return;\n  }\n\n\n  \/\/\n  \/\/ 6. Render QueryContextResponse from the providing application\n  \/\/\n  char portV[16];\n  snprintf(portV, sizeof(portV), \"%d\", port);\n\n  \/\/ Fill in the response from the redirection into the response\n  qcrsP->fill(&parseData.qcrs.res);\n\n  \/\/\n  \/\/ 'Fixing' StatusCode\n  \/\/\n  if (qcrsP->errorCode.code == SccNone)\n  {\n    qcrsP->errorCode.fill(SccOk);\n  }\n\n  if ((qcrsP->contextElementResponseVector.size() == 1) && (qcrsP->contextElementResponseVector[0]->statusCode.code == SccContextElementNotFound))\n  {\n    qcrsP->errorCode.fill(SccContextElementNotFound);\n  }\n}\n\n\n\n\/* ****************************************************************************\n*\n* postQueryContext -\n*\/\nstd::string postQueryContext\n(\n  ConnectionInfo*            ciP,\n  int                        components,\n  std::vector<std::string>&  compV,\n  ParseData*                 parseDataP\n)\n{\n  \/\/\n  \/\/ Convops calling this routine may need the response in digital\n  \/\/ So, the digital response is passed back in parseDataP->qcrs.res\n  \/\/\n  QueryContextResponse*       qcrsP = &parseDataP->qcrs.res;\n  std::string                 answer;\n  QueryContextRequestVector   requestV;\n  QueryContextResponseVector  responseV;\n\n  qcrsP->errorCode.fill(SccOk);\n  ciP->httpStatusCode = mongoQueryContext(&parseDataP->qcr.res, qcrsP, ciP->tenant, ciP->servicePathV, ciP->uriParam);\n\n  \/\/\n  \/\/ In this loop the output from mongoQueryContext is examines and the attributes are sorted\n  \/\/ by their providing application, in requestV, later to be used to forward the queries to their\n  \/\/ respective Context Providers.\n  \/\/\n  \/\/ The local part of the query is already tken care of by mongoQueryContext and the result must be moved\n  \/\/ to the response vector.\n  \/\/ All the local response will be gathered in one single instance of QueryContextResponse.\n  \/\/ As a \"QueryContextResponse::ContextElementResponse::ContextElement\" can contain only ONE entity,\n  \/\/ we will need a separate ContextElementResponse for each distinct EntityId in the local response.\n  \/\/ All attributes that belong to the same EntityId will be gathered in one unique instance of\n  \/\/ ContextElementResponse - so, the correct ContextElementResponse must be looked up and if not found,\n  \/\/ it must be created and added to the QueryContextResponse of the local response\n  \/\/\n  QueryContextResponse* localQcrsP = new QueryContextResponse();\n\n  for (unsigned int ix = 0 ; ix < qcrsP->contextElementResponseVector.size(); ++ix)\n  {\n    ContextElementResponse* cerP  = qcrsP->contextElementResponseVector[ix]->clone();\n\n    for (unsigned int aIx = 0 ; aIx < cerP->contextElement.contextAttributeVector.size(); ++aIx)\n    {\n      EntityId*            eP  = &cerP->contextElement.entityId;\n      ContextAttribute*    aP  = cerP->contextElement.contextAttributeVector[aIx];\n      \n      \/\/\n      \/\/ An empty providingApplication means the attribute is local\n      \/\/ In such a case, the response is already in our hand, we just need to copy it to responseV\n      \/\/\n      if (aP->providingApplication == \"\")\n      {\n        if (aP->found == false)\n        {\n          continue;  \/\/ Non-found pairs of entity\/attribute are thrown away\n        }\n\n        \n        \/\/\n        \/\/ So, where can we put this attribute?\n        \/\/ If we find a suitable existing contextElementResponse, we put it there,\n        \/\/ otherwise, we have to create a new contextElementResponse.\n        \/\/\n        ContextElementResponse* cerP = localQcrsP->contextElementResponseVector.lookup(eP);\n\n        if (cerP == NULL)\n        {\n          cerP = new ContextElementResponse(eP, aP);\n          localQcrsP->contextElementResponseVector.push_back(cerP);\n        }\n        else\n        {\n          cerP->contextElement.contextAttributeVector.push_back(aP);\n        }\n\n        continue;\n      }\n\n      QueryContextRequest* requestP = requestV.lookup(aP->providingApplication, eP);\n\n      if (requestP == NULL)\n      {\n        requestP = new QueryContextRequest(aP->providingApplication, eP, aP->name);\n        requestV.push_back(requestP);\n      }\n      else\n      {\n        requestP->attributeList.push_back_if_absent(aP->name);\n        requestP->entityIdVector.push_back_if_absent(eP);\n      }\n    }\n  }\n\n\n  \/\/\n  \/\/ Any local results in localQcrsP?\n  \/\/\n  \/\/ If so, localQcrsP must be pushed to the response vector 'responseV'.\n  \/\/\n  if (localQcrsP->contextElementResponseVector.size() != 0)\n  {\n    responseV.push_back(localQcrsP);\n  }\n  else\n  {\n    delete localQcrsP;\n  }\n\n\n  \/\/\n  \/\/ If no redirectioning is necessary, just return the result\n  \/\/\n  if (requestV.size() == 0)\n  {\n    \/\/\n    \/\/ In case the response is empty, fill response with the entity we looked for\n    \/\/\n    if (qcrsP->contextElementResponseVector.size() == 0)\n    {\n      \/\/\n      \/\/ FIXME P6: What do we do if we have more than one entity in incoming entityIdVector?\n      \/\/           Push each entityId in a separate contextElementResponse?\n      \/\/           Also, perhaps mongoQueryContext should implement this and not postQueryContext\n      \/\/           This FIXME is related to github issue #588 and (probably) #650.\n      \/\/           Also, optimizing this would be part of issue #768\n      \/\/\n\n\n      \/\/\n      \/\/ It's better not to give any details here as we'd have to choose ONE of the entities in the vector ...\n      \/\/ std::string details = \"Entity id: \/\" + parseDataP->qcr.res.entityIdVector[0]->id + \"\/\";\n      \/\/\n      qcrsP->errorCode.fill(SccContextElementNotFound);\n    }\n\n    answer = qcrsP->render(ciP, QueryContext, \"\");\n    return answer;\n  }\n\n\n  \/\/\n  \/\/ Now, forward the Query requests, each in a separate thread (to be implemented) and\n  \/\/ await all the responses.\n  \/\/ Actually, if there is only ONE forward to be done then there is no reason to\n  \/\/ do the forward in a separate shell. Better to do it inside the current thread.\n  \/\/\n  \/\/ If providingApplication is empty then that part of the query has been performed already, locally.\n  \/\/ \n  \/\/\n  for (unsigned int fIx = 0; fIx < requestV.size(); ++fIx)\n  {\n    if (requestV[fIx]->contextProvider == \"\")\n    {\n      LM_E((\"Internal Error (empty context provider string)\"));\n      continue;\n    }\n\n    QueryContextResponse* qP = new QueryContextResponse();\n    qP->errorCode.fill(SccOk);\n    queryForward(ciP, requestV[fIx], qP);\n\n    \/\/\n    \/\/ Now, each ContextElementResponse of qP should be tested to see whether there\n    \/\/ is already an existing ContextElementResponse in responseV\n    responseV.push_back(qP);\n  }\n\n  answer = responseV.render(ciP, \"\");\n\n  \/\/ requestV.release();\n\n  return answer;\n}\n<commit_msg>PR rwview fixes<commit_after>\/*\n*\n* Copyright 2013 Telefonica Investigacion y Desarrollo, S.A.U\n*\n* This file is part of Orion Context Broker.\n*\n* Orion Context Broker is free software: you can redistribute it and\/or\n* modify 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* Orion Context 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 Affero\n* General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with Orion Context Broker. If not, see http:\/\/www.gnu.org\/licenses\/.\n*\n* For those usages not covered by this license please contact with\n* iot_support at tid dot es\n*\n* Author: Ken Zangelin\n*\/\n#include <string>\n#include <vector>\n\n#include \"common\/string.h\"\n#include \"mongoBackend\/mongoQueryContext.h\"\n#include \"ngsi\/ParseData.h\"\n#include \"ngsi10\/QueryContextRequest.h\"\n#include \"ngsi10\/QueryContextResponse.h\"\n#include \"orionTypes\/QueryContextRequestVector.h\"\n#include \"orionTypes\/QueryContextResponseVector.h\"\n#include \"rest\/ConnectionInfo.h\"\n#include \"rest\/clientSocketHttp.h\"\n#include \"serviceRoutines\/postQueryContext.h\"\n#include \"xmlParse\/xmlRequest.h\"\n\n\n\n\/* ****************************************************************************\n*\n* xmlPayloadClean -\n*\/\nstatic char* xmlPayloadClean(const char*  payload, const char* payloadWord)\n{\n  return (char*) strstr(payload, payloadWord);\n}\n\n\n\n\/* ****************************************************************************\n*\n* queryForward - \n*\n* An entity\/attribute has been found on some context provider.\n* We need to forward the query request to the context provider, indicated in qcrsP->contextProvider\n*\n* 1. Parse the providing application to extract IP, port and URI-path\n* 2. Render an XML-string of the request we want to forward\n* 3. Send the request to the providing application (and await the response)\n* 4. Parse the XML response and fill in a binary QueryContextResponse\n* 5. Render QueryContextResponse from the providing application\n*\n*\/\nstatic void queryForward(ConnectionInfo* ciP, QueryContextRequest* qcrP, QueryContextResponse* qcrsP)\n{\n  std::string     ip;\n  std::string     protocol;\n  int             port;\n  std::string     prefix;\n  std::string     answer;\n\n\n  \/\/\n  \/\/ 1. Parse the providing application to extract IP, port and URI-path\n  \/\/\n  if (parseUrl(qcrP->contextProvider, ip, port, prefix, protocol) == false)\n  {\n    LM_W((\"Bad Input (invalid providing application '%s')\", qcrP->contextProvider.c_str()));\n    \/\/  Somehow, if we accepted this providing application, it is the brokers fault ...\n    \/\/  SccBadRequest should have been returned before, when it was registered!\n\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"\");\n    return;\n  }\n\n\n  \/\/\n  \/\/ 2. Render an XML-string of the request we want to forward\n  \/\/\n  std::string  payload = qcrP->render(QueryContext, XML, \"\");\n  char*        cleanPayload;\n\n  if ((cleanPayload = xmlPayloadClean(payload.c_str(), \"<queryContextRequest>\")) == NULL)\n  {\n    LM_E((\"Runtime Error (error rendering forward-request)\"));\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"\");\n    return;\n  }\n\n\n  \/\/\n  \/\/ 3. Send the request to the Context Provider (and await the reply)\n  \/\/ FIXME P7: Should Rush be used?\n  \/\/\n  std::string     out;\n  std::string     verb         = \"POST\";\n  std::string     resource     = prefix + \"\/queryContext\";\n  std::string     tenant       = ciP->tenant;\n  std::string     servicePath  = (ciP->httpHeaders.servicePathReceived == true)? ciP->httpHeaders.servicePath : \"\";\n\n  out = sendHttpSocket(ip,\n                       port,\n                       protocol,\n                       verb,\n                       tenant,\n                       servicePath,\n                       ciP->httpHeaders.xauthToken,\n                       resource,\n                       \"application\/xml\",\n                       payload,\n                       false,\n                       true);\n\n  if ((out == \"error\") || (out == \"\"))\n  {\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"\");\n    LM_E((\"Runtime Error (error forwarding 'Query' to providing application)\"));\n    return;\n  }\n\n\n  \/\/\n  \/\/ 5. Parse the XML response and fill in a binary QueryContextResponse\n  \/\/\n  std::string  s;\n  std::string  errorMsg;\n\n  cleanPayload = xmlPayloadClean(out.c_str(), \"<queryContextResponse>\");\n\n  if ((cleanPayload == NULL) || (cleanPayload[0] == 0))\n  {\n    \/\/\n    \/\/ This is really an internal error in the Context Provider\n    \/\/ It is not in the orion broker though, so 404 is returned\n    \/\/\n    LM_W((\"Other Error (context provider response to QueryContext is empty)\"));\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"invalid context provider response\");\n    return;\n  }\n\n  \/\/\n  \/\/ NOTE\n  \/\/ When coming from a convenience operation, such as GET \/v1\/contextEntities\/EID\/attributes\/attrName,\n  \/\/ the verb\/method in ciP is GET. However, the parsing function expects a POST, as if it came from a \n  \/\/ POST \/v1\/queryContext. \n  \/\/ So, here we change the verb\/method for POST.\n  \/\/\n  ParseData parseData;\n\n  ciP->verb   = POST;\n  ciP->method = \"POST\";\n\n  s = xmlTreat(cleanPayload, ciP, &parseData, RtQueryContextResponse, \"queryContextResponse\", NULL, &errorMsg);\n  if (s != \"OK\")\n  {\n    LM_W((\"Internal Error (error parsing reply from prov app: %s)\", errorMsg.c_str()));\n    qcrsP->errorCode.fill(SccContextElementNotFound, \"\");\n    return;\n  }\n\n\n  \/\/\n  \/\/ 6. Render QueryContextResponse from the providing application\n  \/\/\n  char portV[16];\n  snprintf(portV, sizeof(portV), \"%d\", port);\n\n  \/\/ Fill in the response from the redirection into the response\n  qcrsP->fill(&parseData.qcrs.res);\n\n  \/\/\n  \/\/ 'Fixing' StatusCode\n  \/\/\n  if (qcrsP->errorCode.code == SccNone)\n  {\n    qcrsP->errorCode.fill(SccOk);\n  }\n\n  if ((qcrsP->contextElementResponseVector.size() == 1) && (qcrsP->contextElementResponseVector[0]->statusCode.code == SccContextElementNotFound))\n  {\n    qcrsP->errorCode.fill(SccContextElementNotFound);\n  }\n}\n\n\n\n\/* ****************************************************************************\n*\n* postQueryContext -\n*\/\nstd::string postQueryContext\n(\n  ConnectionInfo*            ciP,\n  int                        components,\n  std::vector<std::string>&  compV,\n  ParseData*                 parseDataP\n)\n{\n  \/\/\n  \/\/ Convops calling this routine may need the response in digital\n  \/\/ So, the digital response is passed back in parseDataP->qcrs.res\n  \/\/\n  QueryContextResponse*       qcrsP = &parseDataP->qcrs.res;\n  std::string                 answer;\n  QueryContextRequestVector   requestV;\n  QueryContextResponseVector  responseV;\n\n  qcrsP->errorCode.fill(SccOk);\n  ciP->httpStatusCode = mongoQueryContext(&parseDataP->qcr.res, qcrsP, ciP->tenant, ciP->servicePathV, ciP->uriParam);\n\n  \/\/\n  \/\/ In this loop the output from mongoQueryContext is examines and the attributes are sorted\n  \/\/ by their providing application, in requestV, later to be used to forward the queries to their\n  \/\/ respective Context Providers.\n  \/\/\n  \/\/ The local part of the query is already taken care of by mongoQueryContext and the result must be moved\n  \/\/ to the response vector.\n  \/\/ All the local response will be gathered in one single instance of QueryContextResponse.\n  \/\/ As a \"QueryContextResponse::ContextElementResponse::ContextElement\" can contain only ONE entity,\n  \/\/ we will need a separate ContextElementResponse for each distinct EntityId in the local response.\n  \/\/ All attributes that belong to the same EntityId will be gathered in one unique instance of\n  \/\/ ContextElementResponse - so, the correct ContextElementResponse must be looked up and if not found,\n  \/\/ it must be created and added to the QueryContextResponse of the local response\n  \/\/\n  QueryContextResponse* localQcrsP = new QueryContextResponse();\n\n  for (unsigned int ix = 0 ; ix < qcrsP->contextElementResponseVector.size(); ++ix)\n  {\n    ContextElementResponse* cerP  = qcrsP->contextElementResponseVector[ix]->clone();\n\n    for (unsigned int aIx = 0 ; aIx < cerP->contextElement.contextAttributeVector.size(); ++aIx)\n    {\n      EntityId*            eP  = &cerP->contextElement.entityId;\n      ContextAttribute*    aP  = cerP->contextElement.contextAttributeVector[aIx];\n      \n      \/\/\n      \/\/ An empty providingApplication means the attribute is local\n      \/\/ In such a case, the response is already in our hand, we just need to copy it to responseV\n      \/\/\n      if (aP->providingApplication == \"\")\n      {\n        if (aP->found == false)\n        {\n          continue;  \/\/ Non-found pairs of entity\/attribute are thrown away\n        }\n\n        \n        \/\/\n        \/\/ So, where can we put this attribute?\n        \/\/ If we find a suitable existing contextElementResponse, we put it there,\n        \/\/ otherwise, we have to create a new contextElementResponse.\n        \/\/\n        ContextElementResponse* cerP = localQcrsP->contextElementResponseVector.lookup(eP);\n\n        if (cerP == NULL)\n        {\n          cerP = new ContextElementResponse(eP, aP);\n          localQcrsP->contextElementResponseVector.push_back(cerP);\n        }\n        else\n        {\n          cerP->contextElement.contextAttributeVector.push_back(aP);\n        }\n\n        continue;\n      }\n\n      QueryContextRequest* requestP = requestV.lookup(aP->providingApplication, eP);\n\n      if (requestP == NULL)\n      {\n        requestP = new QueryContextRequest(aP->providingApplication, eP, aP->name);\n        requestV.push_back(requestP);\n      }\n      else\n      {\n        requestP->attributeList.push_back_if_absent(aP->name);\n        requestP->entityIdVector.push_back_if_absent(eP);\n      }\n    }\n  }\n\n\n  \/\/\n  \/\/ Any local results in localQcrsP?\n  \/\/\n  \/\/ If so, localQcrsP must be pushed to the response vector 'responseV'.\n  \/\/\n  if (localQcrsP->contextElementResponseVector.size() != 0)\n  {\n    responseV.push_back(localQcrsP);\n  }\n  else\n  {\n    delete localQcrsP;\n  }\n\n\n  \/\/\n  \/\/ If no redirectioning is necessary, just return the result\n  \/\/\n  if (requestV.size() == 0)\n  {\n    \/\/\n    \/\/ In case the response is empty, fill response with the entity we looked for\n    \/\/\n    if (qcrsP->contextElementResponseVector.size() == 0)\n    {\n      \/\/\n      \/\/ FIXME P6: What do we do if we have more than one entity in incoming entityIdVector?\n      \/\/           Push each entityId in a separate contextElementResponse?\n      \/\/           Also, perhaps mongoQueryContext should implement this and not postQueryContext\n      \/\/           This FIXME is related to github issue #588 and (probably) #650.\n      \/\/           Also, optimizing this would be part of issue #768\n      \/\/\n\n\n      \/\/\n      \/\/ It's better not to give any details here as we'd have to choose ONE of the entities in the vector ...\n      \/\/ std::string details = \"Entity id: \/\" + parseDataP->qcr.res.entityIdVector[0]->id + \"\/\";\n      \/\/\n      qcrsP->errorCode.fill(SccContextElementNotFound);\n    }\n\n    answer = qcrsP->render(ciP, QueryContext, \"\");\n    return answer;\n  }\n\n\n  \/\/\n  \/\/ Now, forward the Query requests, each in a separate thread (to be implemented) and\n  \/\/ await all the responses.\n  \/\/ Actually, if there is only ONE forward to be done then there is no reason to\n  \/\/ do the forward in a separate shell. Better to do it inside the current thread.\n  \/\/\n  \/\/ If providingApplication is empty then that part of the query has been performed already, locally.\n  \/\/ \n  \/\/\n  for (unsigned int fIx = 0; fIx < requestV.size(); ++fIx)\n  {\n    if (requestV[fIx]->contextProvider == \"\")\n    {\n      LM_E((\"Internal Error (empty context provider string)\"));\n      continue;\n    }\n\n    QueryContextResponse* qP = new QueryContextResponse();\n    qP->errorCode.fill(SccOk);\n    queryForward(ciP, requestV[fIx], qP);\n\n    \/\/\n    \/\/ Now, each ContextElementResponse of qP should be tested to see whether there\n    \/\/ is already an existing ContextElementResponse in responseV\n    responseV.push_back(qP);\n  }\n\n  answer = responseV.render(ciP, \"\");\n\n  requestV.release();\n\n  return answer;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Jett\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#ifndef HCKT_TREE_H\n#define HCKT_TREE_H\n\n#include <cassert>\n#include <vector>\n#include <bitset>\n#include \"lmemvector.hpp\"\n\nnamespace hckt\n{\n\ntemplate <typename ValueType>\nclass tree\n{\nprotected:\n    std::bitset<64>                    bitset;\n    std::bitset<64>                    leaf;\n    hckt::lmemvector<ValueType>        values;\n    hckt::lmemvector<tree<ValueType>*> children;\n\npublic:\n    tree() : bitset { 0 }, leaf { 0 }, values { }, children { }\n    {\n    }\n\n    ~tree()\n    {\n        collapse();\n    }\n\n    \/\/counts number of set bits\n    static inline unsigned popcount(std::uint64_t x)\n    {\n#ifdef __SSE4_2__\n        return _popcnt64(x);\n#else\n        constexpr std::uint64_t m1  { 0x5555555555555555 };\n        constexpr std::uint64_t m2  { 0x3333333333333333 };\n        constexpr std::uint64_t m4  { 0x0f0f0f0f0f0f0f0f };\n        constexpr std::uint64_t h01 { 0x0101010101010101 };\n\n        x -= (x >> 1) & m1;\n        x  = (x & m2) + ((x >> 2) & m2);\n        x  = (x + (x >> 4)) & m4;\n     \n        return (x * h01) >> 56;\n#endif\n    }\n    \n    unsigned get_children_position(const unsigned position) const\n    {\n        assert(position < 64);\n\n        \/\/we know it will be 0\n        \/\/plus - we cant shift by 64 without ub\n        if(position == 0) {\n            return 0;\n        }\n\n        return popcount(bitset.to_ullong() << (64 - position));\n    }\n    \n    std::size_t calculate_memory_size() const\n    {\n        std::size_t size { \n              sizeof(bitset)\n            + sizeof(leaf)\n            + sizeof(values)   + (values.capacity()   * sizeof(ValueType))\n            + sizeof(children) + (children.capacity() * sizeof(tree<ValueType>*))\n        };\n\n        for(auto child : children) {\n            size += child->calculate_memory_size();\n        }\n        \n        return size;\n    }\n\n    std::size_t calculate_children_amount() const\n    {\n        std::size_t amount { popcount(bitset.to_ullong()) };\n\n        for(auto child : children) {\n            amount += child->calculate_children_amount();\n        }\n        \n        return amount;\n    }\n\n    void mem_usage_info()\n    {\n        auto memsize = calculate_memory_size();\n        auto camnt = calculate_children_amount();\n        std::cout << \"total:     \" << memsize << std::endl;\n        std::cout << \"tree-size: \" << sizeof(tree<ValueType>) << std::endl;\n        std::cout << \"children:  \" << camnt << std::endl;\n        std::cout << \"per-child: \" << (static_cast<float>(memsize) \/ camnt) << std::endl;\n        std::cout << \"val-size:  \" << sizeof(ValueType) << std::endl;\n        std::cout << \"overhead:  \" << (static_cast<float>(memsize - (camnt * sizeof(ValueType))) \/ camnt) << std::endl;\n    }\n\n\n    \/*\n     * 2d get position\n     * convert three part positions to memory location\n     * as input: (left = 0 | right = 1) + (top = 0 | bottom = 2)\n     *\n     * result will be:\n     * y1:x1:y2:x2:y3:x3\n     *\n     *\/\n    static unsigned get_position_2d(const unsigned d1, const unsigned d2, const unsigned d3)\n    {\n        assert(d1 < 4);\n        assert(d2 < 4);\n        assert(d3 < 4);\n\n        return ((1 << 0) * ((d1 & 2) >> 1))\n             + ((1 << 1) *  (d1 & 1))\n             + ((1 << 2) * ((d2 & 2) >> 1))\n             + ((1 << 3) *  (d2 & 1))\n             + ((1 << 4) * ((d3 & 2) >> 1))\n             + ((1 << 5) *  (d3 & 1));\n    }\n\n    static unsigned get_x_2d(const unsigned d1, const unsigned d2, const unsigned d3)\n    {\n        assert(d1 < 4);\n        assert(d2 < 4);\n        assert(d3 < 4);\n\n        return ((d1 & 1) << 0)\n             + ((d2 & 1) << 1)\n             + ((d3 & 1) << 2);\n    }\n\n    static unsigned get_y_2d(const unsigned d1, const unsigned d2, const unsigned d3)\n    {\n        assert(d1 < 4);\n        assert(d2 < 4);\n        assert(d3 < 4);\n\n        return ((d1 & 2) >> 1 << 0)\n             + ((d2 & 2) >> 1 << 1)\n             + ((d3 & 2) >> 1 << 2);\n    }\n\n    \/*\n     * 3d get position\n     * convert two part positions to memory location\n     * as input: (left = 0 | right = 1) + (top = 0 | bottom = 2) + (in = 0 | out = 4)\n     *\n     * result will be:\n     * z1:y1:x1:z2:y2:x2\n     *\n     *\/\n    static unsigned get_position_3d(const unsigned d1, const unsigned d2)\n    {\n        assert(d1 < 8);\n        assert(d2 < 8);\n\n        return ((1 << 0) * ((d1 & 4) >> 2))\n             + ((1 << 1) * ((d1 & 2) >> 1))\n             + ((1 << 2) *  (d1 & 1))\n             + ((1 << 3) * ((d2 & 4) >> 2))\n             + ((1 << 4) * ((d2 & 2) >> 1))\n             + ((1 << 5) *  (d2 & 1));\n    }\n\n    static unsigned get_x_3d(const unsigned d1, const unsigned d2)\n    {\n        assert(d1 < 8);\n        assert(d2 < 8);\n\n        return ((d1 & 1) << 0)\n             + ((d2 & 1) << 1);\n    }\n\n    static unsigned get_y_3d(const unsigned d1, const unsigned d2)\n    {\n        assert(d1 < 8);\n        assert(d2 < 8);\n\n        return ((d1 & 2) >> 1 << 0)\n             + ((d2 & 2) >> 1 << 1);\n    }\n\n    static unsigned get_z_3d(const unsigned d1, const unsigned d2)\n    {\n        assert(d1 < 8);\n        assert(d2 < 8);\n\n        return ((d1 & 4) >> 2 << 0)\n             + ((d2 & 4) >> 2 << 1);\n    }\n\n\n    \/*\n     * check if we have any children\n     *\/\n    bool empty() const\n    {\n        return bitset.none();\n    }\n\n    bool is_set(const unsigned position) const\n    {\n        assert(position < 64);\n        return bitset[position];\n    }\n\n    bool is_leaf(const unsigned position) const\n    {\n        assert(position < 64);\n        return leaf[position];\n    }\n\n    \/*\n     * destroy children\n     *\/\n    void collapse()\n    {\n        for(auto child : children) {\n            child->collapse();\n        }\n\n        children.clear();\n        values.clear();\n        bitset.reset();\n    }\n\n    \/*\n     * insert an item into position of tree\n     * position should be result of get_position\n     *\/\n    void insert(const unsigned position, const ValueType value)\n    {\n        assert(position < 64);\n        assert(! is_set(position));\n\n        const unsigned cpos { get_children_position(position) };\n\n        children.insert(cpos, new tree<ValueType>());\n        values.insert(cpos, value);\n        bitset.set(position);\n    }\n\n    void insert_direct(const unsigned position, const unsigned cpos, const ValueType value)\n    {\n        assert(position < 64);\n        assert(! isset(position));\n        assert(cpos     < 64);\n\n        children.insert(cpos, new tree<ValueType>());\n        values.insert(cpos, value);\n        bitset.set(position);\n    }\n\n    \/*\n     * removes an item from tree\n     * position should be result of get_position\n     *\/\n    void remove(const unsigned position)\n    {\n        assert(position < 64);\n        assert(is_set(position));\n\n        const unsigned cpos { get_children_position(position) };\n\n        children[cpos]->collapse();\n        children.erase(cpos);\n        values.erase(cpos);\n        bitset.reset(position);\n    }\n\n    void remove_direct(const unsigned position, const unsigned cpos)\n    {\n        assert(position < 64);\n        assert(isset(position));\n        assert(cpos     < 64);\n\n        children[cpos]->collapse();\n        children.erase(cpos);\n        values.erase(cpos);\n        bitset.reset(position);\n    }\n\n    \/*\n     * get child node \n     * position should be result of get_position\n     *\/\n    tree<ValueType> * child(const unsigned position) const\n    {\n        assert(position < 64);\n        assert(is_set(position));\n   \n        return child_direct(get_children_position(position));\n    }\n\n    tree<ValueType> * child_direct(const unsigned cpos) const\n    {\n        assert(cpos < 64);\n\n        return children[cpos];\n    }\n\n\n    \/*\n     * sets node to specific value\n     * note: this does not check whether a value has been inserted here yet\n     * position should be result of get_position\n     *\/\n    void set_value(const unsigned position, const ValueType value)\n    {\n        assert(position < 64);\n        assert(is_set(position));\n\n        set_value_direct(get_children_position(position));\n    }\n\n    void set_value_direct(const unsigned cpos, const ValueType value)\n    {\n        assert(cpos < 64);\n\n        values[cpos] = value;\n    }\n\n    \/*\n     * gets value from specific position\n     * note: this does not check whether a value has been inserted here yet\n     * position should be result of get_position\n     *\/\n    ValueType get_value(const unsigned position) const\n    {\n        assert(position < 64);\n\n        return get_value_direct(get_children_position(position));\n    }\n\n    ValueType get_value_direct(const unsigned cpos) const\n    {\n        assert(cpos < 64);\n        assert(isset(cpos));\n\n        return values[cpos];\n    }\n};\n\n};\n\n#endif\n<commit_msg>revert direct calls<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Jett\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#ifndef HCKT_TREE_H\n#define HCKT_TREE_H\n\n#include <cassert>\n#include <vector>\n#include <bitset>\n#include \"lmemvector.hpp\"\n\nnamespace hckt\n{\n\ntemplate <typename ValueType>\nclass tree\n{\nprotected:\n    std::bitset<64>                    bitset;\n    std::bitset<64>                    leaf;\n    hckt::lmemvector<ValueType>        values;\n    hckt::lmemvector<tree<ValueType>*> children;\n\npublic:\n    tree() : bitset { 0 }, leaf { 0 }, values { }, children { }\n    {\n    }\n\n    ~tree()\n    {\n        collapse();\n    }\n\n    \/\/counts number of set bits\n    static inline unsigned popcount(std::uint64_t x)\n    {\n#ifdef __SSE4_2__\n        return _popcnt64(x);\n#else\n        constexpr std::uint64_t m1  { 0x5555555555555555 };\n        constexpr std::uint64_t m2  { 0x3333333333333333 };\n        constexpr std::uint64_t m4  { 0x0f0f0f0f0f0f0f0f };\n        constexpr std::uint64_t h01 { 0x0101010101010101 };\n\n        x -= (x >> 1) & m1;\n        x  = (x & m2) + ((x >> 2) & m2);\n        x  = (x + (x >> 4)) & m4;\n     \n        return (x * h01) >> 56;\n#endif\n    }\n    \n    unsigned get_children_position(const unsigned position) const\n    {\n        assert(position < 64);\n\n        \/\/we know it will be 0\n        \/\/plus - we cant shift by 64 without ub\n        if(position == 0) {\n            return 0;\n        }\n\n        return popcount(bitset.to_ullong() << (64 - position));\n    }\n    \n    std::size_t calculate_memory_size() const\n    {\n        std::size_t size { \n              sizeof(bitset)\n            + sizeof(leaf)\n            + sizeof(values)   + (values.capacity()   * sizeof(ValueType))\n            + sizeof(children) + (children.capacity() * sizeof(tree<ValueType>*))\n        };\n\n        for(auto child : children) {\n            size += child->calculate_memory_size();\n        }\n        \n        return size;\n    }\n\n    std::size_t calculate_children_amount() const\n    {\n        std::size_t amount { popcount(bitset.to_ullong()) };\n\n        for(auto child : children) {\n            amount += child->calculate_children_amount();\n        }\n        \n        return amount;\n    }\n\n    void mem_usage_info()\n    {\n        auto memsize = calculate_memory_size();\n        auto camnt = calculate_children_amount();\n        std::cout << \"total:     \" << memsize << std::endl;\n        std::cout << \"tree-size: \" << sizeof(tree<ValueType>) << std::endl;\n        std::cout << \"children:  \" << camnt << std::endl;\n        std::cout << \"per-child: \" << (static_cast<float>(memsize) \/ camnt) << std::endl;\n        std::cout << \"val-size:  \" << sizeof(ValueType) << std::endl;\n        std::cout << \"overhead:  \" << (static_cast<float>(memsize - (camnt * sizeof(ValueType))) \/ camnt) << std::endl;\n    }\n\n\n    \/*\n     * 2d get position\n     * convert three part positions to memory location\n     * as input: (left = 0 | right = 1) + (top = 0 | bottom = 2)\n     *\n     * result will be:\n     * y1:x1:y2:x2:y3:x3\n     *\n     *\/\n    static unsigned get_position_2d(const unsigned d1, const unsigned d2, const unsigned d3)\n    {\n        assert(d1 < 4);\n        assert(d2 < 4);\n        assert(d3 < 4);\n\n        return ((1 << 0) * ((d1 & 2) >> 1))\n             + ((1 << 1) *  (d1 & 1))\n             + ((1 << 2) * ((d2 & 2) >> 1))\n             + ((1 << 3) *  (d2 & 1))\n             + ((1 << 4) * ((d3 & 2) >> 1))\n             + ((1 << 5) *  (d3 & 1));\n    }\n\n    static unsigned get_x_2d(const unsigned d1, const unsigned d2, const unsigned d3)\n    {\n        assert(d1 < 4);\n        assert(d2 < 4);\n        assert(d3 < 4);\n\n        return ((d1 & 1) << 0)\n             + ((d2 & 1) << 1)\n             + ((d3 & 1) << 2);\n    }\n\n    static unsigned get_y_2d(const unsigned d1, const unsigned d2, const unsigned d3)\n    {\n        assert(d1 < 4);\n        assert(d2 < 4);\n        assert(d3 < 4);\n\n        return ((d1 & 2) >> 1 << 0)\n             + ((d2 & 2) >> 1 << 1)\n             + ((d3 & 2) >> 1 << 2);\n    }\n\n    \/*\n     * 3d get position\n     * convert two part positions to memory location\n     * as input: (left = 0 | right = 1) + (top = 0 | bottom = 2) + (in = 0 | out = 4)\n     *\n     * result will be:\n     * z1:y1:x1:z2:y2:x2\n     *\n     *\/\n    static unsigned get_position_3d(const unsigned d1, const unsigned d2)\n    {\n        assert(d1 < 8);\n        assert(d2 < 8);\n\n        return ((1 << 0) * ((d1 & 4) >> 2))\n             + ((1 << 1) * ((d1 & 2) >> 1))\n             + ((1 << 2) *  (d1 & 1))\n             + ((1 << 3) * ((d2 & 4) >> 2))\n             + ((1 << 4) * ((d2 & 2) >> 1))\n             + ((1 << 5) *  (d2 & 1));\n    }\n\n    static unsigned get_x_3d(const unsigned d1, const unsigned d2)\n    {\n        assert(d1 < 8);\n        assert(d2 < 8);\n\n        return ((d1 & 1) << 0)\n             + ((d2 & 1) << 1);\n    }\n\n    static unsigned get_y_3d(const unsigned d1, const unsigned d2)\n    {\n        assert(d1 < 8);\n        assert(d2 < 8);\n\n        return ((d1 & 2) >> 1 << 0)\n             + ((d2 & 2) >> 1 << 1);\n    }\n\n    static unsigned get_z_3d(const unsigned d1, const unsigned d2)\n    {\n        assert(d1 < 8);\n        assert(d2 < 8);\n\n        return ((d1 & 4) >> 2 << 0)\n             + ((d2 & 4) >> 2 << 1);\n    }\n\n\n    \/*\n     * check if we have any children\n     *\/\n    bool empty() const\n    {\n        return bitset.none();\n    }\n\n    bool is_set(const unsigned position) const\n    {\n        assert(position < 64);\n        return bitset[position];\n    }\n\n    bool is_leaf(const unsigned position) const\n    {\n        assert(position < 64);\n        return leaf[position];\n    }\n\n    \/*\n     * destroy children\n     *\/\n    void collapse()\n    {\n        for(auto child : children) {\n            child->collapse();\n        }\n\n        children.clear();\n        values.clear();\n        bitset.reset();\n    }\n\n    \/*\n     * insert an item into position of tree\n     * position should be result of get_position\n     *\/\n    void insert(const unsigned position, const ValueType value)\n    {\n        assert(position < 64);\n        assert(! is_set(position));\n\n        const unsigned cpos { get_children_position(position) };\n\n        children.insert(cpos, new tree<ValueType>());\n        values.insert(cpos, value);\n        bitset.set(position);\n    }\n\n    \/*\n     * removes an item from tree\n     * position should be result of get_position\n     *\/\n    void remove(const unsigned position)\n    {\n        assert(position < 64);\n        assert(is_set(position));\n\n        const unsigned cpos { get_children_position(position) };\n\n        children[cpos]->collapse();\n        children.erase(cpos);\n        values.erase(cpos);\n        bitset.reset(position);\n    }\n\n    \/*\n     * get child node \n     * position should be result of get_position\n     *\/\n    tree<ValueType> * child(const unsigned position) const\n    {\n        assert(position < 64);\n        assert(is_set(position));\n   \n        const unsigned cpos { get_children_position(position) };\n\n        return children[cpos];\n    }\n\n    \/*\n     * sets node to specific value\n     * note: this does not check whether a value has been inserted here yet\n     * position should be result of get_position\n     *\/\n    void set_value(const unsigned position, const ValueType value)\n    {\n        assert(position < 64);\n        assert(is_set(position));\n\n        const unsigned cpos { get_children_position(position) };\n\n        values[cpos] = value;\n    }\n\n    \/*\n     * gets value from specific position\n     * note: this does not check whether a value has been inserted here yet\n     * position should be result of get_position\n     *\/\n    ValueType get_value(const unsigned position) const\n    {\n        assert(position < 64);\n\n        const unsigned cpos { get_children_position(position) };\n\n        return values[cpos];\n    }\n};\n\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of Ingen.\n * Copyright (C) 2007 Dave 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 <sstream>\n#include <lv2ext\/lv2_event.h>\n#include \"Responder.hpp\"\n#include \"SetPortValueEvent.hpp\"\n#include \"Engine.hpp\"\n#include \"PortImpl.hpp\"\n#include \"ClientBroadcaster.hpp\"\n#include \"NodeImpl.hpp\"\n#include \"ObjectStore.hpp\"\n#include \"AudioBuffer.hpp\"\n#include \"EventBuffer.hpp\"\n#include \"ProcessContext.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\n\n\n\/** Omni (all voices) control setting *\/\nSetPortValueEvent::SetPortValueEvent(Engine&              engine,\n                                     SharedPtr<Responder> responder,\n                                     bool                 queued,\n                                     SampleCount          timestamp,\n                                     const string&        port_path,\n                                     const string&        data_type,\n                                     uint32_t             data_size,\n                                     const void*          data)\n\t: QueuedEvent(engine, responder, timestamp)\n\t, _queued(queued)\n\t, _omni(true)\n\t, _voice_num(0)\n\t, _port_path(port_path)\n\t, _data_type(data_type)\n\t, _data_size(data_size)\n\t, _data(malloc(data_size))\n\t, _port(NULL)\n\t, _error(NO_ERROR)\n{\n\tif (_queued)\n\t\tpre_process();\n\n\tmemcpy(_data, data, data_size);\n}\n\n\n\/** Voice-specific control setting *\/\nSetPortValueEvent::SetPortValueEvent(Engine&              engine,\n                                     SharedPtr<Responder> responder,\n                                     bool                 queued,\n                                     SampleCount          timestamp,\n                                     uint32_t             voice_num,\n                                     const string&        port_path,\n                                     const string&        data_type,\n                                     uint32_t             data_size,\n                                     const void*          data)\n\t: QueuedEvent(engine, responder, timestamp)\n\t, _queued(queued)\n\t, _omni(false)\n\t, _voice_num(voice_num)\n\t, _data_type(data_type)\n\t, _data_size(data_size)\n\t, _data(malloc(data_size))\n\t, _port(NULL)\n\t, _error(NO_ERROR)\n{\n\tif (_queued)\n\t\tpre_process();\n\n\tmemcpy(_data, data, data_size);\n}\n\n\nSetPortValueEvent::~SetPortValueEvent()\n{\n\tfree(_data);\n}\n\n\t\nvoid\nSetPortValueEvent::pre_process()\n{\n\tif (_queued) {\n\t\tif (_port == NULL)\n\t\t\t_port = _engine.object_store()->find_port(_port_path);\n\n\t\tif (_port == NULL)\n\t\t\t_error = PORT_NOT_FOUND;\n\t}\n\t\n\tQueuedEvent::pre_process();\n}\n\n\nvoid\nSetPortValueEvent::execute(ProcessContext& context)\n{\n\tEvent::execute(context);\n\tassert(_time >= context.start() && _time <= context.end());\n\n\tif (_port == NULL)\n\t\t_port = _engine.object_store()->find_port(_port_path);\n\n\tif (_port == NULL) {\n\t\t_error = PORT_NOT_FOUND;\n\t\/*} else if (_port->buffer(0)->capacity() < _data_size) {\n\t\t_error = NO_SPACE;*\/\n\t} else {\n\t\tBuffer* const buf = _port->buffer(0);\n\t\tAudioBuffer* const abuf = dynamic_cast<AudioBuffer*>(buf);\n\t\tif (abuf) {\n\t\t\tconst uint32_t offset = (buf->size() == 1) ? 0 : _time - context.start();\n\n\t\t\tif (_omni)\n\t\t\t\tfor (uint32_t i=0; i < _port->poly(); ++i)\n\t\t\t\t\t((AudioBuffer*)_port->buffer(i))->set(*(float*)_data, offset);\n\t\t\telse\n\t\t\t\t((AudioBuffer*)_port->buffer(_voice_num))->set(*(float*)_data, offset);\n\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tEventBuffer* const ebuf = dynamic_cast<EventBuffer*>(buf);\n\t\t\/\/ FIXME: eliminate string comparisons\n\t\tif (ebuf && _data_type == \"lv2_midi:MidiEvent\") {\n\t\t\tconst LV2Features::Feature* f = _engine.world()->lv2_features->feature(LV2_URI_MAP_URI);\n\t\t\tLV2URIMap* map = (LV2URIMap*)f->controller;\n\t\t\tconst uint32_t type_id = map->uri_to_id(NULL, \"http:\/\/lv2plug.in\/ns\/ext\/midi#MidiEvent\");\n\t\t\tconst uint32_t frames = std::max((uint32_t)(_time - context.start()), ebuf->latest_frames());\n\t\t\tebuf->prepare_write(context.nframes());\n\t\t\t\/\/ FIXME: how should this work? binary over OSC, ick\n\t\t\t\/\/ Message is an event:\n\t\t\tebuf->append(frames, 0, type_id, _data_size, (const unsigned char*)_data);\n\t\t\t\/\/ Message is an event buffer:\n\t\t\t\/\/ebuf->append((LV2_Event_Buffer*)_data);\n\t\t\t_port->raise_set_by_user_flag();\n\t\t\treturn;\n\t\t}\n\n\t\tcerr << \"WARNING: Unknown value type \" << _data_type << \", ignoring\" << endl;\n\t}\n}\n\n\nvoid\nSetPortValueEvent::post_process()\n{\n\tif (_error == NO_ERROR) {\n\t\tassert(_port != NULL);\n\t\t\n\t\t_responder->respond_ok();\n\t\t_engine.broadcaster()->send_control_change(_port_path, *(float*)_data);\n\t\t\n\t} else if (_error == PORT_NOT_FOUND) {\n\t\tstring msg = \"Unable to find port \";\n\t\tmsg.append(_port_path).append(\" for set_port_value\");\n\t\t_responder->respond_error(msg);\n\t\n\t} else if (_error == NO_SPACE) {\n\t\tstd::ostringstream msg(\"Attempt to write \");\n\t\tmsg << _data_size << \" bytes to \" << _port_path << \", with capacity \"\n\t\t\t<< _port->buffer_size() << endl;\n\t\t_responder->respond_error(msg.str());\n\t}\n}\n\n\n} \/\/ namespace Ingen\n\n<commit_msg>Fix crash on patch loading.<commit_after>\/* This file is part of Ingen.\n * Copyright (C) 2007 Dave 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 <sstream>\n#include <lv2ext\/lv2_event.h>\n#include \"Responder.hpp\"\n#include \"SetPortValueEvent.hpp\"\n#include \"Engine.hpp\"\n#include \"PortImpl.hpp\"\n#include \"ClientBroadcaster.hpp\"\n#include \"NodeImpl.hpp\"\n#include \"ObjectStore.hpp\"\n#include \"AudioBuffer.hpp\"\n#include \"EventBuffer.hpp\"\n#include \"ProcessContext.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\n\n\n\/** Omni (all voices) control setting *\/\nSetPortValueEvent::SetPortValueEvent(Engine&              engine,\n                                     SharedPtr<Responder> responder,\n                                     bool                 queued,\n                                     SampleCount          timestamp,\n                                     const string&        port_path,\n                                     const string&        data_type,\n                                     uint32_t             data_size,\n                                     const void*          data)\n\t: QueuedEvent(engine, responder, timestamp)\n\t, _queued(queued)\n\t, _omni(true)\n\t, _voice_num(0)\n\t, _port_path(port_path)\n\t, _data_type(data_type)\n\t, _data_size(data_size)\n\t, _data(malloc(data_size))\n\t, _port(NULL)\n\t, _error(NO_ERROR)\n{\n\tif (!_queued)\n\t\tpre_process();\n\n\tmemcpy(_data, data, data_size);\n}\n\n\n\/** Voice-specific control setting *\/\nSetPortValueEvent::SetPortValueEvent(Engine&              engine,\n                                     SharedPtr<Responder> responder,\n                                     bool                 queued,\n                                     SampleCount          timestamp,\n                                     uint32_t             voice_num,\n                                     const string&        port_path,\n                                     const string&        data_type,\n                                     uint32_t             data_size,\n                                     const void*          data)\n\t: QueuedEvent(engine, responder, timestamp)\n\t, _queued(queued)\n\t, _omni(false)\n\t, _voice_num(voice_num)\n\t, _data_type(data_type)\n\t, _data_size(data_size)\n\t, _data(malloc(data_size))\n\t, _port(NULL)\n\t, _error(NO_ERROR)\n{\n\tif (!_queued)\n\t\tpre_process();\n\n\tmemcpy(_data, data, data_size);\n}\n\n\nSetPortValueEvent::~SetPortValueEvent()\n{\n\tfree(_data);\n}\n\n\t\nvoid\nSetPortValueEvent::pre_process()\n{\n\tif (_queued) {\n\t\tif (_port == NULL)\n\t\t\t_port = _engine.object_store()->find_port(_port_path);\n\n\t\tif (_port == NULL)\n\t\t\t_error = PORT_NOT_FOUND;\n\t}\n\t\n\tQueuedEvent::pre_process();\n}\n\n\nvoid\nSetPortValueEvent::execute(ProcessContext& context)\n{\n\tEvent::execute(context);\n\tassert(_time >= context.start() && _time <= context.end());\n\n\tif (_port == NULL)\n\t\t_port = _engine.object_store()->find_port(_port_path);\n\n\tif (_port == NULL) {\n\t\t_error = PORT_NOT_FOUND;\n\t\/*} else if (_port->buffer(0)->capacity() < _data_size) {\n\t\t_error = NO_SPACE;*\/\n\t} else {\n\t\tBuffer* const buf = _port->buffer(0);\n\t\tAudioBuffer* const abuf = dynamic_cast<AudioBuffer*>(buf);\n\t\tif (abuf) {\n\t\t\tconst uint32_t offset = (buf->size() == 1) ? 0 : _time - context.start();\n\n\t\t\tif (_omni)\n\t\t\t\tfor (uint32_t i=0; i < _port->poly(); ++i)\n\t\t\t\t\t((AudioBuffer*)_port->buffer(i))->set(*(float*)_data, offset);\n\t\t\telse\n\t\t\t\t((AudioBuffer*)_port->buffer(_voice_num))->set(*(float*)_data, offset);\n\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tEventBuffer* const ebuf = dynamic_cast<EventBuffer*>(buf);\n\t\t\/\/ FIXME: eliminate string comparisons\n\t\tif (ebuf && _data_type == \"lv2_midi:MidiEvent\") {\n\t\t\tconst LV2Features::Feature* f = _engine.world()->lv2_features->feature(LV2_URI_MAP_URI);\n\t\t\tLV2URIMap* map = (LV2URIMap*)f->controller;\n\t\t\tconst uint32_t type_id = map->uri_to_id(NULL, \"http:\/\/lv2plug.in\/ns\/ext\/midi#MidiEvent\");\n\t\t\tconst uint32_t frames = std::max((uint32_t)(_time - context.start()), ebuf->latest_frames());\n\t\t\tebuf->prepare_write(context.nframes());\n\t\t\t\/\/ FIXME: how should this work? binary over OSC, ick\n\t\t\t\/\/ Message is an event:\n\t\t\tebuf->append(frames, 0, type_id, _data_size, (const unsigned char*)_data);\n\t\t\t\/\/ Message is an event buffer:\n\t\t\t\/\/ebuf->append((LV2_Event_Buffer*)_data);\n\t\t\t_port->raise_set_by_user_flag();\n\t\t\treturn;\n\t\t}\n\n\t\tcerr << \"WARNING: Unknown value type \" << _data_type << \", ignoring\" << endl;\n\t}\n}\n\n\nvoid\nSetPortValueEvent::post_process()\n{\n\tif (_error == NO_ERROR) {\n\t\tassert(_port != NULL);\n\t\t\n\t\t_responder->respond_ok();\n\t\t_engine.broadcaster()->send_control_change(_port_path, *(float*)_data);\n\t\t\n\t} else if (_error == PORT_NOT_FOUND) {\n\t\tstring msg = \"Unable to find port \";\n\t\tmsg.append(_port_path).append(\" for set_port_value\");\n\t\t_responder->respond_error(msg);\n\t\n\t} else if (_error == NO_SPACE) {\n\t\tstd::ostringstream msg(\"Attempt to write \");\n\t\tmsg << _data_size << \" bytes to \" << _port_path << \", with capacity \"\n\t\t\t<< _port->buffer_size() << endl;\n\t\t_responder->respond_error(msg.str());\n\t}\n}\n\n\n} \/\/ namespace Ingen\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: drviewsi.cxx,v $\n *\n *  $Revision: 1.19 $\n *\n *  last change: $Author: vg $ $Date: 2006-11-01 14:18: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n#include \"DrawViewShell.hxx\"\n\n#define ITEMID_COLOR            ATTR_ANIMATION_COLOR\n#ifndef _XTABLE_HXX\n#include <svx\/xtable.hxx>\n#endif\n#include \"sdattr.hxx\"\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n#ifndef _EEITEM_HXX \/\/autogen\n#include <svx\/eeitem.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SVDITER_HXX \/\/autogen\n#include <svx\/svditer.hxx>\n#endif\n#ifndef _SVX_COLRITEM_HXX \/\/autogen\n#include <svx\/colritem.hxx>\n#endif\n#ifndef _SFXVIEWFRM_HXX \/\/autogen\n#include <sfx2\/viewfrm.hxx>\n#endif\n#ifndef _SVXIDS_HRC\n#include <svx\/svxids.hrc>\n#endif\n#ifndef _SVDUNDO_HXX \/\/autogen\n#include <svx\/svdundo.hxx>\n#endif\n#ifndef _E3D_VIEW3D_HXX \/\/autogen\n#include <svx\/view3d.hxx>\n#endif\n\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n\n#ifndef _SVX_FLOAT3D_HXX\n#include <svx\/float3d.hxx>\n#endif\n#ifndef _SVX_F3DCHILD_HXX\n#include <svx\/f3dchild.hxx>\n#endif\n#ifndef _SVX_DIALOGS_HRC \/\/autogen\n#include <svx\/dialogs.hrc>\n#endif\n\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n\n\n#include \"app.hrc\"\n#include \"strings.hrc\"\n\n#include \"drawdoc.hxx\"\n#include \"DrawDocShell.hxx\"\n#include \"anminfo.hxx\"\n#include \"unoaprms.hxx\"                 \/\/ Undo-Action\n#include \"sdundogr.hxx\"                 \/\/ Undo Gruppe\n#ifndef SD_DRAW_VIEW_HXX\n#include \"drawview.hxx\"\n#endif\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n#include \"sdresid.hxx\"\n\nusing namespace ::com::sun::star;\n\nnamespace sd {\n\n#define ATTR_MISSING    0       \/\/ Attribut nicht verfuegbar\n#define ATTR_MIXED      1       \/\/ Attribut uneindeutig (bei Mehrfachselektion)\n#define ATTR_SET        2       \/\/ Attribut eindeutig\n\n#define ITEMVALUE(ItemSet,Id,Cast)  ((const Cast&)(ItemSet).Get(Id)).GetValue()\n\n\/*************************************************************************\n|*\n|* SfxRequests fuer EffekteWindow bearbeiten\n|*\n\\************************************************************************\/\n\nvoid DrawViewShell::ExecEffectWin( SfxRequest& rReq )\n{\n    CheckLineTo (rReq);\n\n    USHORT nSId = rReq.GetSlot();\n\n    switch( nSId )\n    {\n        case SID_3D_INIT:\n        {\n            USHORT nId = Svx3DChildWindow::GetChildWindowId();\n            SfxChildWindow* pWindow = GetViewFrame()->GetChildWindow( nId );\n            if( pWindow )\n            {\n                Svx3DWin* p3DWin = (Svx3DWin*)( pWindow->GetWindow() );\n                if( p3DWin )\n                    p3DWin->InitColorLB( GetDoc() );\n            }\n        }\n        break;\n\n        case SID_3D_STATE:\n        {\n            Update3DWindow();\n        }\n        break;\n\n        case SID_3D_ASSIGN:\n        {\n            AssignFrom3DWindow();\n        }\n        break;\n\n    }\n}\n\n\/*************************************************************************\n|*\n|* 3D - Assign \/ Update\n|*\n\\************************************************************************\/\nvoid DrawViewShell::Update3DWindow()\n{\n    USHORT nId = Svx3DChildWindow::GetChildWindowId();\n    SfxChildWindow* pWindow = GetViewFrame()->GetChildWindow( nId );\n    if( pWindow )\n    {\n        Svx3DWin* p3DWin = (Svx3DWin*) pWindow->GetWindow();\n        if( p3DWin && p3DWin->IsUpdateMode() )\n        {\n            SfxItemSet aTmpItemSet = GetView()->Get3DAttributes();\n            p3DWin->Update( aTmpItemSet );\n        }\n    }\n}\n\n\/*----------------------------------------------------------------------------*\/\n\n#pragma optimize ( \"\", off )\n\nvoid DrawViewShell::AssignFrom3DWindow()\n{\n    USHORT nId = Svx3DChildWindow::GetChildWindowId();\n    SfxChildWindow* pWin = GetViewFrame()->GetChildWindow( nId );\n    if( pWin )\n    {\n        Svx3DWin* p3DWin = (Svx3DWin*) pWin->GetWindow();\n        if( p3DWin && GetView() )\n        {\n            if(!GetView()->IsPresObjSelected())\n            {\n                SfxItemSet aSet( GetDoc()->GetPool(),\n                    SDRATTR_START,  SDRATTR_END,\n                    0, 0);\n                p3DWin->GetAttr( aSet );\n\n                \/\/ Eigene UNDO-Klammerung auch um die Wandlung in 3D\n                GetView()->BegUndo(String(SdResId(STR_UNDO_APPLY_3D_FAVOURITE)));\n\n                if(GetView()->IsConvertTo3DObjPossible())\n                {\n                    \/\/ Nur TextAttribute zuweisen\n                    SfxItemSet aTextSet( GetDoc()->GetPool(),\n                        EE_ITEMS_START, EE_ITEMS_END, 0 );\n                    aTextSet.Put( aSet, FALSE );\n                    GetView()->SetAttributes( aTextSet );\n\n                    \/\/ Text in 3D umwandeln\n                    USHORT nSId = SID_CONVERT_TO_3D;\n                    SfxBoolItem aItem( nSId, TRUE );\n                    GetViewFrame()->GetDispatcher()->Execute(\n                        nSId, SFX_CALLMODE_SYNCHRON | SFX_CALLMODE_RECORD, &aItem, 0L );\n\n                    \/\/ Feststellen, ob ein FILL_Attribut gesetzt ist.\n                    \/\/ Falls nicht, Fuellattribut hart setzen\n                    XFillStyle eFillStyle = ITEMVALUE( aSet, XATTR_FILLSTYLE, XFillStyleItem );\n                    if(eFillStyle == XFILL_NONE)\n                        aSet.Put(XFillStyleItem (XFILL_SOLID));\n\n                    \/\/ remove some 3DSCENE attributes since these were\n                    \/\/ created by convert to 3D and may not be changed\n                    \/\/ to the defaults again.\n                    aSet.ClearItem(SDRATTR_3DSCENE_DISTANCE);\n                    aSet.ClearItem(SDRATTR_3DSCENE_FOCAL_LENGTH);\n                    aSet.ClearItem(SDRATTR_3DOBJ_DEPTH);\n                }\n\n                \/\/ Attribute zuweisen\n                GetView()->Set3DAttributes( aSet );\n\n                \/\/ Ende UNDO\n                GetView()->EndUndo();\n            }\n            else\n            {\n                InfoBox aInfoBox (\n                    GetActiveWindow(),\n                    String(SdResId(STR_ACTION_NOTPOSSIBLE)));\n                aInfoBox.Execute();\n            }\n\n            \/\/ Focus zurueckholen\n            GetActiveWindow()->GrabFocus();\n        }\n    }\n}\n\n#pragma optimize ( \"\", on )\n\n}\n<commit_msg>INTEGRATION: CWS sdwarningsbegone (1.18.38); FILE MERGED 2006\/11\/22 15:15:34 cl 1.18.38.2: RESYNC: (1.18-1.19); FILE MERGED 2006\/11\/22 12:42:28 cl 1.18.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: drviewsi.cxx,v $\n *\n *  $Revision: 1.20 $\n *\n *  last change: $Author: kz $ $Date: 2006-12-12 19:17: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n#include \"DrawViewShell.hxx\"\n\n#define ITEMID_COLOR            ATTR_ANIMATION_COLOR\n#ifndef _XTABLE_HXX\n#include <svx\/xtable.hxx>\n#endif\n#include \"sdattr.hxx\"\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n#ifndef _EEITEM_HXX \/\/autogen\n#include <svx\/eeitem.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SVDITER_HXX \/\/autogen\n#include <svx\/svditer.hxx>\n#endif\n#ifndef _SVX_COLRITEM_HXX \/\/autogen\n#include <svx\/colritem.hxx>\n#endif\n#ifndef _SFXVIEWFRM_HXX \/\/autogen\n#include <sfx2\/viewfrm.hxx>\n#endif\n#ifndef _SVXIDS_HRC\n#include <svx\/svxids.hrc>\n#endif\n#ifndef _SVDUNDO_HXX \/\/autogen\n#include <svx\/svdundo.hxx>\n#endif\n#ifndef _E3D_VIEW3D_HXX \/\/autogen\n#include <svx\/view3d.hxx>\n#endif\n\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n\n#ifndef _SVX_FLOAT3D_HXX\n#include <svx\/float3d.hxx>\n#endif\n#ifndef _SVX_F3DCHILD_HXX\n#include <svx\/f3dchild.hxx>\n#endif\n#ifndef _SVX_DIALOGS_HRC \/\/autogen\n#include <svx\/dialogs.hrc>\n#endif\n\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n\n\n#include \"app.hrc\"\n#include \"strings.hrc\"\n\n#include \"drawdoc.hxx\"\n#include \"DrawDocShell.hxx\"\n#include \"anminfo.hxx\"\n#include \"unoaprms.hxx\"                 \/\/ Undo-Action\n#include \"sdundogr.hxx\"                 \/\/ Undo Gruppe\n#ifndef SD_DRAW_VIEW_HXX\n#include \"drawview.hxx\"\n#endif\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n#include \"sdresid.hxx\"\n\nusing namespace ::com::sun::star;\n\nnamespace sd {\n\n#define ATTR_MISSING    0       \/\/ Attribut nicht verfuegbar\n#define ATTR_MIXED      1       \/\/ Attribut uneindeutig (bei Mehrfachselektion)\n#define ATTR_SET        2       \/\/ Attribut eindeutig\n\n#define ITEMVALUE(ItemSet,Id,Cast)  ((const Cast&)(ItemSet).Get(Id)).GetValue()\n\n\/*************************************************************************\n|*\n|* SfxRequests fuer EffekteWindow bearbeiten\n|*\n\\************************************************************************\/\n\nvoid DrawViewShell::ExecEffectWin( SfxRequest& rReq )\n{\n    CheckLineTo (rReq);\n\n    USHORT nSId = rReq.GetSlot();\n\n    switch( nSId )\n    {\n        case SID_3D_INIT:\n        {\n            USHORT nId = Svx3DChildWindow::GetChildWindowId();\n            SfxChildWindow* pWindow = GetViewFrame()->GetChildWindow( nId );\n            if( pWindow )\n            {\n                Svx3DWin* p3DWin = (Svx3DWin*)( pWindow->GetWindow() );\n                if( p3DWin )\n                    p3DWin->InitColorLB( GetDoc() );\n            }\n        }\n        break;\n\n        case SID_3D_STATE:\n        {\n            Update3DWindow();\n        }\n        break;\n\n        case SID_3D_ASSIGN:\n        {\n            AssignFrom3DWindow();\n        }\n        break;\n\n    }\n}\n\n\/*************************************************************************\n|*\n|* 3D - Assign \/ Update\n|*\n\\************************************************************************\/\nvoid DrawViewShell::Update3DWindow()\n{\n    USHORT nId = Svx3DChildWindow::GetChildWindowId();\n    SfxChildWindow* pWindow = GetViewFrame()->GetChildWindow( nId );\n    if( pWindow )\n    {\n        Svx3DWin* p3DWin = (Svx3DWin*) pWindow->GetWindow();\n        if( p3DWin && p3DWin->IsUpdateMode() )\n        {\n            SfxItemSet aTmpItemSet = GetView()->Get3DAttributes();\n            p3DWin->Update( aTmpItemSet );\n        }\n    }\n}\n\n\/*----------------------------------------------------------------------------*\/\n\nvoid DrawViewShell::AssignFrom3DWindow()\n{\n    USHORT nId = Svx3DChildWindow::GetChildWindowId();\n    SfxChildWindow* pWin = GetViewFrame()->GetChildWindow( nId );\n    if( pWin )\n    {\n        Svx3DWin* p3DWin = (Svx3DWin*) pWin->GetWindow();\n        if( p3DWin && GetView() )\n        {\n            if(!GetView()->IsPresObjSelected())\n            {\n                SfxItemSet aSet( GetDoc()->GetPool(),\n                    SDRATTR_START,  SDRATTR_END,\n                    0, 0);\n                p3DWin->GetAttr( aSet );\n\n                \/\/ Eigene UNDO-Klammerung auch um die Wandlung in 3D\n                GetView()->BegUndo(String(SdResId(STR_UNDO_APPLY_3D_FAVOURITE)));\n\n                if(GetView()->IsConvertTo3DObjPossible())\n                {\n                    \/\/ Nur TextAttribute zuweisen\n                    SfxItemSet aTextSet( GetDoc()->GetPool(),\n                        EE_ITEMS_START, EE_ITEMS_END, 0 );\n                    aTextSet.Put( aSet, FALSE );\n                    GetView()->SetAttributes( aTextSet );\n\n                    \/\/ Text in 3D umwandeln\n                    USHORT nSId = SID_CONVERT_TO_3D;\n                    SfxBoolItem aItem( nSId, TRUE );\n                    GetViewFrame()->GetDispatcher()->Execute(\n                        nSId, SFX_CALLMODE_SYNCHRON | SFX_CALLMODE_RECORD, &aItem, 0L );\n\n                    \/\/ Feststellen, ob ein FILL_Attribut gesetzt ist.\n                    \/\/ Falls nicht, Fuellattribut hart setzen\n                    XFillStyle eFillStyle = ITEMVALUE( aSet, XATTR_FILLSTYLE, XFillStyleItem );\n                    if(eFillStyle == XFILL_NONE)\n                        aSet.Put(XFillStyleItem (XFILL_SOLID));\n\n                    \/\/ remove some 3DSCENE attributes since these were\n                    \/\/ created by convert to 3D and may not be changed\n                    \/\/ to the defaults again.\n                    aSet.ClearItem(SDRATTR_3DSCENE_DISTANCE);\n                    aSet.ClearItem(SDRATTR_3DSCENE_FOCAL_LENGTH);\n                    aSet.ClearItem(SDRATTR_3DOBJ_DEPTH);\n                }\n\n                \/\/ Attribute zuweisen\n                GetView()->Set3DAttributes( aSet );\n\n                \/\/ Ende UNDO\n                GetView()->EndUndo();\n            }\n            else\n            {\n                InfoBox aInfoBox (\n                    GetActiveWindow(),\n                    String(SdResId(STR_ACTION_NOTPOSSIBLE)));\n                aInfoBox.Execute();\n            }\n\n            \/\/ Focus zurueckholen\n            GetActiveWindow()->GrabFocus();\n        }\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: tabcontr.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: bm $ $Date: 2002-11-04 17:42:55 $\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 _SVDLAYER_HXX\n#include <svx\/svdlayer.hxx>\n#endif\n#ifndef _SVDPAGV_HXX \/\/autogen\n#include <svx\/svdpagv.hxx>\n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n\n#pragma hdrstop\n\n#include \"sdattr.hxx\"\n#include \"app.hxx\"\n#include \"tabcontr.hxx\"\n#include \"app.hrc\"\n#include \"glob.hrc\"\n#include \"res_bmp.hrc\"\n#include \"drviewsh.hxx\"\n#include \"grviewsh.hxx\"\n#include \"helpids.h\"\n#include \"sdview.hxx\"\n#include \"sdpage.hxx\"\n#include \"drawdoc.hxx\"\n#include \"sdwindow.hxx\"\n#include \"unmodpg.hxx\"\n#include \"docshell.hxx\"\n#include \"sdresid.hxx\"\n\n\n#define SWITCH_TIMEOUT  20\n\n\/\/ -----------------------------------------\n\/\/ - SdTabControl::SdPageObjsTransferable -\n\/\/ -----------------------------------------\n\nSdTabControl::SdTabControlTransferable::~SdTabControlTransferable()\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid SdTabControl::SdTabControlTransferable::AddSupportedFormats()\n{\n    AddFormat( SOT_FORMATSTR_ID_STARDRAW_TABBAR );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nsal_Bool SdTabControl::SdTabControlTransferable::GetData( const ::com::sun::star::datatransfer::DataFlavor& rFlavor )\n{\n    return sal_False;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid SdTabControl::SdTabControlTransferable::DragFinished( sal_Int8 nDropAction )\n{\n    mrParent.DragFinished( nDropAction );\n}\n\n\/*************************************************************************\n|*\n|* Standard-Konstruktor\n|*\n\\************************************************************************\/\n\nSdTabControl::SdTabControl(SdDrawViewShell* pViewSh, Window* pParent) :\n    TabBar( pParent, WinBits( WB_BORDER | WB_3DLOOK | WB_SCROLL | WB_SIZEABLE | WB_DRAG) ),\n    DragSourceHelper( this ),\n    DropTargetHelper( this ),\n    pDrViewSh(pViewSh),\n    bInternalMove(FALSE)\n{\n    EnableEditMode();\n    SetSizePixel(Size(0, 0));\n    SetMaxPageWidth( 150 );\n    SetHelpId( HID_SD_TABBAR_PAGES );\n}\n\n\/*************************************************************************\n|*\n|* Destruktor\n|*\n\\************************************************************************\/\n\nSdTabControl::~SdTabControl()\n{\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid SdTabControl::Select()\n{\n    SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n    pDispatcher->Execute(SID_SWITCHPAGE, SFX_CALLMODE_ASYNCHRON |\n                            SFX_CALLMODE_RECORD);\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid  SdTabControl::MouseButtonDown(const MouseEvent& rMEvt)\n{\n    \/\/ eine saubere linke Maustaste ohne verwaessernde Modifier (damit koennte\n    \/\/ja das Kontextmenue gemeint sein)\n    if ( rMEvt.IsLeft() && !rMEvt.IsMod1() && !rMEvt.IsMod2() && !rMEvt.IsShift())\n    {\n        Point aPos = PixelToLogic( rMEvt.GetPosPixel() );\n        USHORT aPageId = GetPageId(aPos);\n\n        if (aPageId == 0)\n        {\n            SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n\n            pDispatcher->Execute(SID_INSERTPAGE_QUICK,\n                                SFX_CALLMODE_SYNCHRON | SFX_CALLMODE_RECORD);\n        }\n    }\n\n    \/\/ A single left click with pressed control key on a tab page first\n    \/\/ switches to that page before the usual handling (copying with drag\n    \/\/ and drop) takes place.\n    else if (rMEvt.IsLeft() && rMEvt.IsMod1() && !rMEvt.IsMod2() && !rMEvt.IsShift())\n    {\n        pDrViewSh->SwitchPage (GetPageId (rMEvt.GetPosPixel()) - 1);\n    }\n\n\n    TabBar::MouseButtonDown(rMEvt);\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid SdTabControl::DoubleClick()\n{\n    if (GetCurPageId() != 0)\n    {\n        SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n        pDispatcher->Execute( SID_MODIFYPAGE,\n                        SFX_CALLMODE_SYNCHRON | SFX_CALLMODE_RECORD );\n    }\n}\n\n\/*************************************************************************\n|*\n|* StartDrag-Request\n|*\n\\************************************************************************\/\n\nvoid SdTabControl::StartDrag( sal_Int8 nAction, const Point& rPosPixel )\n{\n    bInternalMove = TRUE;\n\n    \/\/ object is delete by reference mechanismn\n    ( new SdTabControl::SdTabControlTransferable( *this ) )->StartDrag( this, DND_ACTION_COPYMOVE );\n}\n\n\/*************************************************************************\n|*\n|* DragFinished\n|*\n\\************************************************************************\/\n\nvoid SdTabControl::DragFinished( sal_Int8 nDropAction )\n{\n    bInternalMove = FALSE;\n}\n\n\/*************************************************************************\n|*\n|* AcceptDrop-Event\n|*\n\\************************************************************************\/\n\nsal_Int8 SdTabControl::AcceptDrop( const AcceptDropEvent& rEvt )\n{\n    sal_Int8 nRet = DND_ACTION_NONE;\n\n    if( rEvt.mbLeaving )\n        EndSwitchPage();\n\n    if( !pDrViewSh->GetDocSh()->IsReadOnly() )\n    {\n        SdDrawDocument* pDoc = pDrViewSh->GetDoc();\n        Point           aPos( rEvt.maPosPixel );\n\n        if( bInternalMove )\n        {\n            if( rEvt.mbLeaving || ( pDrViewSh->GetEditMode() == EM_MASTERPAGE ) )\n                HideDropPos();\n            else\n            {\n                ShowDropPos( aPos );\n                nRet = rEvt.mnAction;\n            }\n        }\n        else\n        {\n            HideDropPos();\n\n            USHORT nPageId = GetPageId( aPos ) - 1;\n\n            if( ( nPageId >= 0 ) && pDoc->GetPage( nPageId ) )\n            {\n                SdWindow* pWindow = NULL;\n\n                nRet = pDrViewSh->AcceptDrop( rEvt, *this, NULL, nPageId, SDRLAYER_NOTFOUND );\n                SwitchPage( aPos );\n            }\n        }\n    }\n\n    return nRet;\n}\n\n\/*************************************************************************\n|*\n|* ExecuteDrop-Event\n|*\n\\************************************************************************\/\n\nsal_Int8 SdTabControl::ExecuteDrop( const ExecuteDropEvent& rEvt )\n{\n    SdDrawDocument* pDoc = pDrViewSh->GetDoc();\n    Point           aPos( rEvt.maPosPixel );\n    sal_Int8        nRet = DND_ACTION_NONE;\n\n    if( bInternalMove )\n    {\n        USHORT nPageId = ShowDropPos( aPos ) - 1;\n\n        switch (rEvt.mnAction)\n        {\n            case DND_ACTION_MOVE:\n                if( pDrViewSh->IsSwitchPageAllowed() && pDoc->MovePages( nPageId ) )\n                {\n                    SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n                    pDispatcher->Execute(SID_SWITCHPAGE, SFX_CALLMODE_ASYNCHRON | SFX_CALLMODE_RECORD);\n                }\n                break;\n\n            case DND_ACTION_COPY:\n            {\n                \/\/ Copying the selected page to the place that rEvt points\n                \/\/ takes place in three steps:\n                \/\/ 1. Create a copy of the selected page.  This copy will\n                \/\/ lie directly behind the selected page.\n                \/\/ 2. Move the copy to the desired place.\n                \/\/ 3. Select the copy.\n                if (pDrViewSh->IsSwitchPageAllowed())\n                {\n                    \/\/ 1. Create a copy.\n                    USHORT nPageNumOfCopy = pDoc->DuplicatePage (GetCurPageId() - 1);\n                    \/\/ 2. Move page.  For this first switch to the copy:\n                    \/\/ MovePages operates on the currently selected page(s).\n                    pDrViewSh->SwitchPage (nPageNumOfCopy);\n                    \/\/ Adapt target page id when necessary, i.e. page copy\n                    \/\/ has been inserted in front of the target page.\n                    USHORT nPageNum = nPageId;\n                    if ((nPageNumOfCopy <= nPageNum) && (nPageNum != (USHORT)-1))\n                        nPageNum += 1;\n                    if (pDoc->MovePages(nPageNum))\n                    {\n                        \/\/ 3. Switch to the copy that has been moved to its\n                        \/\/ final destination.  Use an asynchron slot call to\n                        \/\/ be executed after the still pending ones.\n                        if (nPageNumOfCopy >= nPageNum || (nPageNum == (USHORT)-1))\n                            nPageNum += 1;\n                        SetCurPageId (GetPageId(nPageNum));\n                        SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n                        pDispatcher->Execute(SID_SWITCHPAGE,\n                            SFX_CALLMODE_ASYNCHRON | SFX_CALLMODE_RECORD);\n                    }\n                }\n\n                break;\n            }\n        }\n\n        nRet = rEvt.mnAction;\n    }\n    else\n    {\n        USHORT nPageId = GetPageId( aPos ) - 1;\n\n        if( ( nPageId >= 0 ) && pDoc->GetPage( nPageId ) )\n        {\n            nRet = pDrViewSh->ExecuteDrop( rEvt, *this, NULL, nPageId, SDRLAYER_NOTFOUND );\n        }\n    }\n\n    HideDropPos();\n    EndSwitchPage();\n\n    return nRet;\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid SdTabControl::Command(const CommandEvent& rCEvt)\n{\n    USHORT nCmd = rCEvt.GetCommand();\n\n    if ( nCmd == COMMAND_CONTEXTMENU )\n    {\n        BOOL bGraphicShell = pDrViewSh->ISA( SdGraphicViewShell );\n        USHORT nResId = bGraphicShell ? RID_GRAPHIC_PAGETAB_POPUP :\n                                        RID_DRAW_PAGETAB_POPUP;\n        SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n        pDispatcher->ExecutePopup( SdResId( nResId ) );\n    }\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nlong SdTabControl::StartRenaming()\n{\n    BOOL bOK = FALSE;\n\n    if (pDrViewSh->GetPageKind() == PK_STANDARD)\n    {\n        bOK = TRUE;\n\n        SdView* pView = pDrViewSh->GetView();\n\n        if ( pView->IsTextEdit() )\n            pView->EndTextEdit();\n    }\n\n    return( bOK );\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nlong SdTabControl::AllowRenaming()\n{\n    BOOL bOK = TRUE;\n\n    String aNewName( GetEditText() );\n    String aCompareName( GetPageText( GetEditPageId() ) );\n\n    if( aCompareName != aNewName )\n    {\n        \/\/ Seite umbenennen\n        if( pDrViewSh->GetDocSh()->CheckPageName( this, aNewName ) )\n        {\n            SetEditText( aNewName );\n            EndRenaming();\n        }\n        else\n        {\n            bOK = FALSE;\n        }\n    }\n    return( bOK );\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid SdTabControl::EndRenaming()\n{\n    if( !IsEditModeCanceled() )\n        pDrViewSh->RenameSlide( GetEditPageId(), GetEditText() );\n}\n\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid SdTabControl::ActivatePage()\n{\n    if ( \/*IsInSwitching && *\/ pDrViewSh->IsSwitchPageAllowed() )\n    {\n        SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n        pDispatcher->Execute(SID_SWITCHPAGE,\n                             SFX_CALLMODE_ASYNCHRON | SFX_CALLMODE_RECORD);\n    }\n}\n\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nlong SdTabControl::DeactivatePage()\n{\n    return pDrViewSh->IsSwitchPageAllowed();\n}\n\n\n\n\nvoid SdTabControl::SendActivatePageEvent (void)\n{\n    CallEventListeners (VCLEVENT_TABBAR_PAGEACTIVATED,\n        reinterpret_cast<void*>(GetCurPageId()));\n}\n\n\n\n\nvoid SdTabControl::SendDeactivatePageEvent (void)\n{\n    CallEventListeners (VCLEVENT_TABBAR_PAGEDEACTIVATED,\n        reinterpret_cast<void*>(GetCurPageId()));\n}\n<commit_msg>INTEGRATION: CWS impress1 (1.12.218); FILE MERGED 2003\/09\/17 08:22:35 af 1.12.218.1: #111996# Transition to stacked sub-shells. Introduction of namespace sd.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: tabcontr.cxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: obo $ $Date: 2004-01-20 12:56: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 \"TabControl.hxx\"\n\n#ifndef _SVDLAYER_HXX\n#include <svx\/svdlayer.hxx>\n#endif\n#ifndef _SVDPAGV_HXX \/\/autogen\n#include <svx\/svdpagv.hxx>\n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n\n#pragma hdrstop\n\n#include \"sdattr.hxx\"\n#include \"app.hxx\"\n#include \"app.hrc\"\n#include \"glob.hrc\"\n#include \"res_bmp.hrc\"\n#ifndef SD_DRAW_VIEW_SHELL_HXX\n#include \"DrawViewShell.hxx\"\n#endif\n#ifndef SD_GRAPHIC_VIEW_SHELL_HXX\n#include \"GraphicViewShell.hxx\"\n#endif\n#include \"helpids.h\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#include \"sdpage.hxx\"\n#include \"drawdoc.hxx\"\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n#include \"unmodpg.hxx\"\n#include \"DrawDocShell.hxx\"\n#include \"sdresid.hxx\"\n\n\nnamespace sd {\n\n#define SWITCH_TIMEOUT  20\n\n\/\/ -----------------------------------------\n\/\/ - SdTabControl::SdPageObjsTransferable -\n\/\/ -----------------------------------------\n\nTabControl::TabControlTransferable::~TabControlTransferable()\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid TabControl::TabControlTransferable::AddSupportedFormats()\n{\n    AddFormat( SOT_FORMATSTR_ID_STARDRAW_TABBAR );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nsal_Bool TabControl::TabControlTransferable::GetData( const ::com::sun::star::datatransfer::DataFlavor& rFlavor )\n{\n    return sal_False;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid TabControl::TabControlTransferable::DragFinished( sal_Int8 nDropAction )\n{\n    mrParent.DragFinished( nDropAction );\n}\n\n\/*************************************************************************\n|*\n|* Standard-Konstruktor\n|*\n\\************************************************************************\/\n\nTabControl::TabControl(DrawViewShell* pViewSh, Window* pParent) :\n    TabBar( pParent, WinBits( WB_BORDER | WB_3DLOOK | WB_SCROLL | WB_SIZEABLE | WB_DRAG) ),\n    DragSourceHelper( this ),\n    DropTargetHelper( this ),\n    pDrViewSh(pViewSh),\n    bInternalMove(FALSE)\n{\n    EnableEditMode();\n    SetSizePixel(Size(0, 0));\n    SetMaxPageWidth( 150 );\n    SetHelpId( HID_SD_TABBAR_PAGES );\n}\n\n\/*************************************************************************\n|*\n|* Destruktor\n|*\n\\************************************************************************\/\n\nTabControl::~TabControl()\n{\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid TabControl::Select()\n{\n    SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n    pDispatcher->Execute(SID_SWITCHPAGE, SFX_CALLMODE_ASYNCHRON |\n                            SFX_CALLMODE_RECORD);\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid  TabControl::MouseButtonDown(const MouseEvent& rMEvt)\n{\n    \/\/ eine saubere linke Maustaste ohne verwaessernde Modifier (damit koennte\n    \/\/ja das Kontextmenue gemeint sein)\n    if ( rMEvt.IsLeft() && !rMEvt.IsMod1() && !rMEvt.IsMod2() && !rMEvt.IsShift())\n    {\n        Point aPos = PixelToLogic( rMEvt.GetPosPixel() );\n        USHORT aPageId = GetPageId(aPos);\n\n        if (aPageId == 0)\n        {\n            SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n\n            pDispatcher->Execute(SID_INSERTPAGE_QUICK,\n                                SFX_CALLMODE_SYNCHRON | SFX_CALLMODE_RECORD);\n        }\n    }\n\n    \/\/ A single left click with pressed control key on a tab page first\n    \/\/ switches to that page before the usual handling (copying with drag\n    \/\/ and drop) takes place.\n    else if (rMEvt.IsLeft() && rMEvt.IsMod1() && !rMEvt.IsMod2() && !rMEvt.IsShift())\n    {\n        pDrViewSh->SwitchPage (GetPageId (rMEvt.GetPosPixel()) - 1);\n    }\n\n\n    TabBar::MouseButtonDown(rMEvt);\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid TabControl::DoubleClick()\n{\n    if (GetCurPageId() != 0)\n    {\n        SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n        pDispatcher->Execute( SID_MODIFYPAGE,\n                        SFX_CALLMODE_SYNCHRON | SFX_CALLMODE_RECORD );\n    }\n}\n\n\/*************************************************************************\n|*\n|* StartDrag-Request\n|*\n\\************************************************************************\/\n\nvoid TabControl::StartDrag( sal_Int8 nAction, const Point& rPosPixel )\n{\n    bInternalMove = TRUE;\n\n    \/\/ object is delete by reference mechanismn\n    ( new TabControl::TabControlTransferable( *this ) )->StartDrag( this, DND_ACTION_COPYMOVE );\n}\n\n\/*************************************************************************\n|*\n|* DragFinished\n|*\n\\************************************************************************\/\n\nvoid TabControl::DragFinished( sal_Int8 nDropAction )\n{\n    bInternalMove = FALSE;\n}\n\n\/*************************************************************************\n|*\n|* AcceptDrop-Event\n|*\n\\************************************************************************\/\n\nsal_Int8 TabControl::AcceptDrop( const AcceptDropEvent& rEvt )\n{\n    sal_Int8 nRet = DND_ACTION_NONE;\n\n    if( rEvt.mbLeaving )\n        EndSwitchPage();\n\n    if( !pDrViewSh->GetDocSh()->IsReadOnly() )\n    {\n        SdDrawDocument* pDoc = pDrViewSh->GetDoc();\n        Point           aPos( rEvt.maPosPixel );\n\n        if( bInternalMove )\n        {\n            if( rEvt.mbLeaving || ( pDrViewSh->GetEditMode() == EM_MASTERPAGE ) )\n                HideDropPos();\n            else\n            {\n                ShowDropPos( aPos );\n                nRet = rEvt.mnAction;\n            }\n        }\n        else\n        {\n            HideDropPos();\n\n            USHORT nPageId = GetPageId( aPos ) - 1;\n\n            if( ( nPageId >= 0 ) && pDoc->GetPage( nPageId ) )\n            {\n                ::sd::Window* pWindow = NULL;\n\n                nRet = pDrViewSh->AcceptDrop( rEvt, *this, NULL, nPageId, SDRLAYER_NOTFOUND );\n                SwitchPage( aPos );\n            }\n        }\n    }\n\n    return nRet;\n}\n\n\/*************************************************************************\n|*\n|* ExecuteDrop-Event\n|*\n\\************************************************************************\/\n\nsal_Int8 TabControl::ExecuteDrop( const ExecuteDropEvent& rEvt )\n{\n    SdDrawDocument* pDoc = pDrViewSh->GetDoc();\n    Point           aPos( rEvt.maPosPixel );\n    sal_Int8        nRet = DND_ACTION_NONE;\n\n    if( bInternalMove )\n    {\n        USHORT nPageId = ShowDropPos( aPos ) - 1;\n\n        switch (rEvt.mnAction)\n        {\n            case DND_ACTION_MOVE:\n                if( pDrViewSh->IsSwitchPageAllowed() && pDoc->MovePages( nPageId ) )\n                {\n                    SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n                    pDispatcher->Execute(SID_SWITCHPAGE, SFX_CALLMODE_ASYNCHRON | SFX_CALLMODE_RECORD);\n                }\n                break;\n\n            case DND_ACTION_COPY:\n            {\n                \/\/ Copying the selected page to the place that rEvt points\n                \/\/ takes place in three steps:\n                \/\/ 1. Create a copy of the selected page.  This copy will\n                \/\/ lie directly behind the selected page.\n                \/\/ 2. Move the copy to the desired place.\n                \/\/ 3. Select the copy.\n                if (pDrViewSh->IsSwitchPageAllowed())\n                {\n                    \/\/ 1. Create a copy.\n                    USHORT nPageNumOfCopy = pDoc->DuplicatePage (GetCurPageId() - 1);\n                    \/\/ 2. Move page.  For this first switch to the copy:\n                    \/\/ MovePages operates on the currently selected page(s).\n                    pDrViewSh->SwitchPage (nPageNumOfCopy);\n                    \/\/ Adapt target page id when necessary, i.e. page copy\n                    \/\/ has been inserted in front of the target page.\n                    USHORT nPageNum = nPageId;\n                    if ((nPageNumOfCopy <= nPageNum) && (nPageNum != (USHORT)-1))\n                        nPageNum += 1;\n                    if (pDoc->MovePages(nPageNum))\n                    {\n                        \/\/ 3. Switch to the copy that has been moved to its\n                        \/\/ final destination.  Use an asynchron slot call to\n                        \/\/ be executed after the still pending ones.\n                        if (nPageNumOfCopy >= nPageNum || (nPageNum == (USHORT)-1))\n                            nPageNum += 1;\n                        SetCurPageId (GetPageId(nPageNum));\n                        SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n                        pDispatcher->Execute(SID_SWITCHPAGE,\n                            SFX_CALLMODE_ASYNCHRON | SFX_CALLMODE_RECORD);\n                    }\n                }\n\n                break;\n            }\n        }\n\n        nRet = rEvt.mnAction;\n    }\n    else\n    {\n        USHORT nPageId = GetPageId( aPos ) - 1;\n\n        if( ( nPageId >= 0 ) && pDoc->GetPage( nPageId ) )\n        {\n            nRet = pDrViewSh->ExecuteDrop( rEvt, *this, NULL, nPageId, SDRLAYER_NOTFOUND );\n        }\n    }\n\n    HideDropPos();\n    EndSwitchPage();\n\n    return nRet;\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid TabControl::Command(const CommandEvent& rCEvt)\n{\n    USHORT nCmd = rCEvt.GetCommand();\n\n    if ( nCmd == COMMAND_CONTEXTMENU )\n    {\n        BOOL bGraphicShell = pDrViewSh->ISA(GraphicViewShell);\n        USHORT nResId = bGraphicShell ? RID_GRAPHIC_PAGETAB_POPUP :\n                                        RID_DRAW_PAGETAB_POPUP;\n        SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n        pDispatcher->ExecutePopup( SdResId( nResId ) );\n    }\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nlong TabControl::StartRenaming()\n{\n    BOOL bOK = FALSE;\n\n    if (pDrViewSh->GetPageKind() == PK_STANDARD)\n    {\n        bOK = TRUE;\n\n        ::sd::View* pView = pDrViewSh->GetView();\n\n        if ( pView->IsTextEdit() )\n            pView->EndTextEdit();\n    }\n\n    return( bOK );\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nlong TabControl::AllowRenaming()\n{\n    BOOL bOK = TRUE;\n\n    String aNewName( GetEditText() );\n    String aCompareName( GetPageText( GetEditPageId() ) );\n\n    if( aCompareName != aNewName )\n    {\n        \/\/ Seite umbenennen\n        if( pDrViewSh->GetDocSh()->CheckPageName( this, aNewName ) )\n        {\n            SetEditText( aNewName );\n            EndRenaming();\n        }\n        else\n        {\n            bOK = FALSE;\n        }\n    }\n    return( bOK );\n}\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid TabControl::EndRenaming()\n{\n    if( !IsEditModeCanceled() )\n        pDrViewSh->RenameSlide( GetEditPageId(), GetEditText() );\n}\n\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nvoid TabControl::ActivatePage()\n{\n    if ( \/*IsInSwitching && *\/ pDrViewSh->IsSwitchPageAllowed() )\n    {\n        SfxDispatcher* pDispatcher = pDrViewSh->GetViewFrame()->GetDispatcher();\n        pDispatcher->Execute(SID_SWITCHPAGE,\n                             SFX_CALLMODE_ASYNCHRON | SFX_CALLMODE_RECORD);\n    }\n}\n\n\n\/*************************************************************************\n|*\n\\************************************************************************\/\n\nlong TabControl::DeactivatePage()\n{\n    return pDrViewSh->IsSwitchPageAllowed();\n}\n\n\n\n\nvoid TabControl::SendActivatePageEvent (void)\n{\n    CallEventListeners (VCLEVENT_TABBAR_PAGEACTIVATED,\n        reinterpret_cast<void*>(GetCurPageId()));\n}\n\n\n\n\nvoid TabControl::SendDeactivatePageEvent (void)\n{\n    CallEventListeners (VCLEVENT_TABBAR_PAGEDEACTIVATED,\n        reinterpret_cast<void*>(GetCurPageId()));\n}\n\n} \/\/ end of namespace sd\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    \/\/ 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    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>Undef min and max for MSVC<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 <cstdlib>\n#include <string>\n#include <vector>\n\n#ifndef NTA_RANDOM_HPP\n#define NTA_RANDOM_HPP\n\n#if defined(NTA_COMPILER_MSVC)\n    \/\/ max and min are macros for MSVC, will confuse Random::max() and Random::min()\n    #undef min\n    #undef max\n#endif\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    \/\/ 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 * 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 \"XalanDefaultParsedSource.hpp\"\n\n\n\n#include <XalanDOM\/XalanDocument.hpp>\n\n\n\n#include <PlatformSupport\/URISupport.hpp>\n\n\n\n#include <XalanSourceTree\/XalanSourceTreeDocument.hpp>\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n\n\n\nXalanDefaultParsedSourceDOMSupport::XalanDefaultParsedSourceDOMSupport(const XalanSourceTreeDOMSupport&\t\ttheDOMSupport) :\n\tXalanSourceTreeDOMSupport(),\n\tm_domSupport(theDOMSupport)\n{\n}\n\n\n\nXalanDefaultParsedSourceDOMSupport::~XalanDefaultParsedSourceDOMSupport()\n{\n}\n\n\n\nvoid\nXalanDefaultParsedSourceDOMSupport::reset()\n{\n}\n\n\n\nconst XalanDOMString*\nXalanDefaultParsedSourceDOMSupport::getNamespaceForPrefix(\n\t\t\tconst XalanDOMString&\tprefix, \n\t\t\tconst XalanElement&\t\tnamespaceContext) const\n{\n\treturn m_domSupport.getNamespaceForPrefix(\n\t\t\t\t\tprefix, \n\t\t\t\t\tnamespaceContext);\n}\n\n\n\nconst XalanDOMString&\nXalanDefaultParsedSourceDOMSupport::getUnparsedEntityURI(\n\t\t\tconst XalanDOMString&\ttheName,\n\t\t\tconst XalanDocument&\ttheDocument) const\n{\n\tconst XalanDOMString&\ttheURI =\n\t\t\tm_domSupport.getUnparsedEntityURI(\n\t\t\t\t\ttheName,\n\t\t\t\t\ttheDocument);\n\n\tif (length(theURI) != 0)\n\t{\n\t\treturn theURI;\n\t}\n\telse\n\t{\n\t\treturn XalanSourceTreeDOMSupport::getUnparsedEntityURI(\n\t\t\t\t\ttheName,\n\t\t\t\t\ttheDocument);\n\t}\n}\n\n\n\nbool\nXalanDefaultParsedSourceDOMSupport::isNodeAfter(\n\t\t\tconst XalanNode&\tnode1,\n\t\t\tconst XalanNode&\tnode2) const\n{\n\treturn m_domSupport.isNodeAfter(\n\t\t\t\t\tnode1, \n\t\t\t\t\tnode2);\n}\n\n\n\nXalanDefaultParsedSourceHelper::XalanDefaultParsedSourceHelper(\n\t\t\tconst XalanSourceTreeDOMSupport&\t\ttheSourceDOMSupport,\n\t\t\tconst XalanSourceTreeParserLiaison&\t\ttheSourceParserLiaison) :\n\tm_domSupport(theSourceDOMSupport),\n\tm_parserLiaison(theSourceParserLiaison.getDocumentNumber())\n{\n\tm_domSupport.setParserLiaison(&m_parserLiaison);\n}\n\n\n\nDOMSupport&\nXalanDefaultParsedSourceHelper::getDOMSupport()\n{\n\treturn m_domSupport;\n}\n\n\n\nXMLParserLiaison&\nXalanDefaultParsedSourceHelper::getParserLiaison()\n{\n\treturn m_parserLiaison;\n}\n\n\n\nXalanDefaultParsedSource::XalanDefaultParsedSource(\n\t\t\tconst XSLTInputSource&\ttheInputSource,\n\t\t\tbool\t\t\t\t\tfValidate,\n\t\t\tErrorHandler*\t\t\ttheErrorHandler,\n\t\t\tEntityResolver*\t\t\ttheEntityResolver) :\n\tXalanParsedSource(),\n\tm_domSupport(),\n\tm_parserLiaison(m_domSupport),\n\tm_parsedSource(0)\n{\n\tm_parserLiaison.setUseValidation(fValidate);\n\tm_parserLiaison.setEntityResolver(theEntityResolver);\n\tm_parserLiaison.setErrorHandler(theErrorHandler);\n\n\tm_parsedSource = m_parserLiaison.mapDocument(m_parserLiaison.parseXMLStream(theInputSource));\n\tassert(m_parsedSource != 0);\n\n\tm_domSupport.setParserLiaison(&m_parserLiaison);\n\n\tconst XalanDOMChar* const\ttheSystemID = theInputSource.getSystemId();\n\n\tif (theSystemID != 0)\n\t{\n\t\ttry\n\t\t{\n\t\t\tm_uri = URISupport::getURLStringFromString(theSystemID);\n\t\t}\n\t\tcatch(const XMLException&)\n\t\t{\n\t\t\t\/\/ Assume that any exception here relates to get the url from\n\t\t\t\/\/ the system ID.  We'll assume that it's just a fake base identifier\n\t\t\t\/\/ since the parser would have thrown an error if the system ID\n\t\t\t\/\/ wasn't resolved.\n\t\t\tm_uri = theSystemID;\n\t\t}\n\t}\n}\n\n\n\nXalanDefaultParsedSource::~XalanDefaultParsedSource()\n{\n}\n\n\n\nXalanDocument*\t\nXalanDefaultParsedSource::getDocument() const\n{\n\treturn m_parsedSource;\n}\n\n\n\nXalanParsedSourceHelper*\nXalanDefaultParsedSource::createHelper() const\n{\n\treturn new XalanDefaultParsedSourceHelper(m_domSupport, m_parserLiaison);\n}\n\n\n\nconst XalanDOMString&\nXalanDefaultParsedSource::getURI() const\n{\n\treturn m_uri;\n}\n<commit_msg>Changed obsolete DOMSupport call .<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 \"XalanDefaultParsedSource.hpp\"\n\n\n\n#include <XalanDOM\/XalanDocument.hpp>\n\n\n\n#include <PlatformSupport\/URISupport.hpp>\n\n\n\n#include <DOMSupport\/DOMServices.hpp>\n\n\n\n#include <XalanSourceTree\/XalanSourceTreeDocument.hpp>\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n\n\n\nXalanDefaultParsedSourceDOMSupport::XalanDefaultParsedSourceDOMSupport(const XalanSourceTreeDOMSupport&\t\ttheDOMSupport) :\n\tXalanSourceTreeDOMSupport(),\n\tm_domSupport(theDOMSupport)\n{\n}\n\n\n\nXalanDefaultParsedSourceDOMSupport::~XalanDefaultParsedSourceDOMSupport()\n{\n}\n\n\n\nvoid\nXalanDefaultParsedSourceDOMSupport::reset()\n{\n}\n\n\n\nconst XalanDOMString*\nXalanDefaultParsedSourceDOMSupport::getNamespaceForPrefix(\n\t\t\tconst XalanDOMString&\tprefix, \n\t\t\tconst XalanElement&\t\tnamespaceContext) const\n{\n\treturn DOMServices::getNamespaceForPrefix(\n\t\t\t\t\tprefix, \n\t\t\t\t\tnamespaceContext);\n}\n\n\n\nconst XalanDOMString&\nXalanDefaultParsedSourceDOMSupport::getUnparsedEntityURI(\n\t\t\tconst XalanDOMString&\ttheName,\n\t\t\tconst XalanDocument&\ttheDocument) const\n{\n\tconst XalanDOMString&\ttheURI =\n\t\t\tm_domSupport.getUnparsedEntityURI(\n\t\t\t\t\ttheName,\n\t\t\t\t\ttheDocument);\n\n\tif (length(theURI) != 0)\n\t{\n\t\treturn theURI;\n\t}\n\telse\n\t{\n\t\treturn XalanSourceTreeDOMSupport::getUnparsedEntityURI(\n\t\t\t\t\ttheName,\n\t\t\t\t\ttheDocument);\n\t}\n}\n\n\n\nbool\nXalanDefaultParsedSourceDOMSupport::isNodeAfter(\n\t\t\tconst XalanNode&\tnode1,\n\t\t\tconst XalanNode&\tnode2) const\n{\n\treturn m_domSupport.isNodeAfter(\n\t\t\t\t\tnode1, \n\t\t\t\t\tnode2);\n}\n\n\n\nXalanDefaultParsedSourceHelper::XalanDefaultParsedSourceHelper(\n\t\t\tconst XalanSourceTreeDOMSupport&\t\ttheSourceDOMSupport,\n\t\t\tconst XalanSourceTreeParserLiaison&\t\ttheSourceParserLiaison) :\n\tm_domSupport(theSourceDOMSupport),\n\tm_parserLiaison(theSourceParserLiaison.getDocumentNumber())\n{\n\tm_domSupport.setParserLiaison(&m_parserLiaison);\n}\n\n\n\nDOMSupport&\nXalanDefaultParsedSourceHelper::getDOMSupport()\n{\n\treturn m_domSupport;\n}\n\n\n\nXMLParserLiaison&\nXalanDefaultParsedSourceHelper::getParserLiaison()\n{\n\treturn m_parserLiaison;\n}\n\n\n\nXalanDefaultParsedSource::XalanDefaultParsedSource(\n\t\t\tconst XSLTInputSource&\ttheInputSource,\n\t\t\tbool\t\t\t\t\tfValidate,\n\t\t\tErrorHandler*\t\t\ttheErrorHandler,\n\t\t\tEntityResolver*\t\t\ttheEntityResolver) :\n\tXalanParsedSource(),\n\tm_domSupport(),\n\tm_parserLiaison(m_domSupport),\n\tm_parsedSource(0)\n{\n\tm_parserLiaison.setUseValidation(fValidate);\n\tm_parserLiaison.setEntityResolver(theEntityResolver);\n\tm_parserLiaison.setErrorHandler(theErrorHandler);\n\n\tm_parsedSource = m_parserLiaison.mapDocument(m_parserLiaison.parseXMLStream(theInputSource));\n\tassert(m_parsedSource != 0);\n\n\tm_domSupport.setParserLiaison(&m_parserLiaison);\n\n\tconst XalanDOMChar* const\ttheSystemID = theInputSource.getSystemId();\n\n\tif (theSystemID != 0)\n\t{\n\t\ttry\n\t\t{\n\t\t\tm_uri = URISupport::getURLStringFromString(theSystemID);\n\t\t}\n\t\tcatch(const XMLException&)\n\t\t{\n\t\t\t\/\/ Assume that any exception here relates to get the url from\n\t\t\t\/\/ the system ID.  We'll assume that it's just a fake base identifier\n\t\t\t\/\/ since the parser would have thrown an error if the system ID\n\t\t\t\/\/ wasn't resolved.\n\t\t\tm_uri = theSystemID;\n\t\t}\n\t}\n}\n\n\n\nXalanDefaultParsedSource::~XalanDefaultParsedSource()\n{\n}\n\n\n\nXalanDocument*\t\nXalanDefaultParsedSource::getDocument() const\n{\n\treturn m_parsedSource;\n}\n\n\n\nXalanParsedSourceHelper*\nXalanDefaultParsedSource::createHelper() const\n{\n\treturn new XalanDefaultParsedSourceHelper(m_domSupport, m_parserLiaison);\n}\n\n\n\nconst XalanDOMString&\nXalanDefaultParsedSource::getURI() const\n{\n\treturn m_uri;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#pragma once\n\n#include <iostream>\n#include <thread>\n#include <chrono>\n#include <boost\/asio.hpp>\n\n#include \"common.h\"\n\n#define MAX_PACKET_SIZE\t65536\n\nusing namespace boost::asio;\nusing namespace std::chrono;\n\nclass test_latency_client\n{\nprivate:\n    enum { PACKET_SIZE = MAX_PACKET_SIZE };\n    \n    boost::asio::io_service & io_service_;\n    ip::tcp::socket socket_;\n    std::uint32_t packet_size_;\n\n    uint64_t last_query_count_;\n    uint64_t total_query_count_;\n    double last_total_latency_;   \n    double total_latency_;\n\n    duration<double> elapsed_time_;\n    time_point<high_resolution_clock> send_time_;\n    time_point<high_resolution_clock> recieve_time_;\n    time_point<high_resolution_clock> last_time_;\n\n    char data_[PACKET_SIZE];\n\npublic:\n    test_latency_client(boost::asio::io_service & io_service,\n        ip::tcp::resolver::iterator endpoint_iterator, std::uint32_t packet_size)\n        : io_service_(io_service),\n          socket_(io_service), packet_size_(packet_size),\n          last_query_count_(0), total_query_count_(0), last_total_latency_(0.0), total_latency_(0.0)\n    {\n        ::memset(data_, 'h', sizeof(data_));\n        last_time_ = high_resolution_clock::now();\n        do_connect(endpoint_iterator);\n    }\n\n    ~test_latency_client()\n    {\n        time_point<high_resolution_clock> startime = high_resolution_clock::now();\n\n        time_point<high_resolution_clock> endtime = high_resolution_clock::now();\n        duration<double> elapsed_time = duration_cast< duration<double> >(endtime - startime);\n    }\n\nprivate:\n    void display_counters()\n    {\n        elapsed_time_ = duration_cast< duration<double> >(recieve_time_ - send_time_);\n        last_query_count_++;\n        total_query_count_++;\n        last_total_latency_ += elapsed_time_.count();\n        total_latency_ += elapsed_time_.count();\n        time_point<high_resolution_clock> now_time = high_resolution_clock::now();\n        duration<double> interval_time = duration_cast< duration<double> >(now_time - last_time_);\n        double avg_latency, avg_total_latency;\n        if (interval_time.count() > 1.0) {\n            std::cout << \"packet_size =\" << packet_size_ << \" B, latency total = \" << last_total_latency_ << \" ms\" <<  std::endl;\n            \/\/ average latency (one second interval)\n            if (last_query_count_ != 0)\n                avg_latency = (last_total_latency_ * 1000.0) \/ (double)last_query_count_;\n            else\n                avg_latency = 0.0;\n            std::cout << \"average latency       = \" << avg_latency\n                      << \" ms, query count       = \" << last_query_count_ << std::endl;\n\n            \/\/ average latency total\n            if (total_query_count_ != 0)\n                avg_total_latency = (total_latency_ * 1000.0) \/ (double)total_query_count_;\n            else\n                avg_total_latency = 0.0;\n            std::cout << \"average latency total = \" << avg_total_latency\n                      << \" ms, query count total = \" << total_query_count_ << std::endl;\n            std::cout << std::endl;\n\n            \/\/ Reset the counters\n            last_time_ = high_resolution_clock::now();\n            last_query_count_ = 0;\n            last_total_latency_ = 0.0;\n        }\n    }\n\n    void do_connect(ip::tcp::resolver::iterator endpoint_iterator)\n    {\n        boost::asio::async_connect(socket_, endpoint_iterator,\n            [this](boost::system::error_code ec, ip::tcp::resolver::iterator)\n            {\n                if (!ec)\n                {\n                    \/\/do_read();\n                    do_write();\n                }\n            });\n    }\n\n    void do_read()\n    {\n        boost::asio::async_read(socket_,\n            boost::asio::buffer(data_, packet_size_),\n            [this](boost::system::error_code ec, std::size_t bytes_transferred)\n            {\n                if ((uint32_t)bytes_transferred != packet_size_) {\n                    std::cout << \"test_latency_client::do_read(): async_read(), bytes_transferred = \"\n                              << bytes_transferred << \" bytes.\" << std::endl;\n                }\n                if (!ec)\n                {\n                    \/\/ Have recieved the response message\n                    recieve_time_ = high_resolution_clock::now();\n                    display_counters();\n                    do_write();\n                }\n            });\n    }\n\n    void do_write()\n    {\n        \/\/ Prepare to send the request message\n        send_time_ = high_resolution_clock::now();\n        boost::asio::async_write(socket_,\n            boost::asio::buffer(data_, packet_size_),\n            [this](boost::system::error_code ec, std::size_t bytes_transferred)\n            {\n                if ((uint32_t)bytes_transferred != packet_size_) {\n                    std::cout << \"test_latency_client::do_write(): async_write(), bytes_transferred = \"\n                              << bytes_transferred << \" bytes.\" << std::endl;\n                }\n                if (!ec)\n                {\n                    do_read();\n                }\n            });\n    }\n};\n<commit_msg>小改动.<commit_after>\n#pragma once\n\n#include <iostream>\n#include <thread>\n#include <chrono>\n#include <boost\/asio.hpp>\n\n#include \"common.h\"\n\n#define MAX_PACKET_SIZE\t65536\n\nusing namespace boost::asio;\nusing namespace std::chrono;\n\nclass test_latency_client\n{\nprivate:\n    enum { PACKET_SIZE = MAX_PACKET_SIZE };\n    \n    boost::asio::io_service & io_service_;\n    ip::tcp::socket socket_;\n    std::uint32_t packet_size_;\n\n    uint64_t last_query_count_;\n    uint64_t total_query_count_;\n    double last_total_latency_;   \n    double total_latency_;\n\n    duration<double> elapsed_time_;\n    time_point<high_resolution_clock> send_time_;\n    time_point<high_resolution_clock> recieve_time_;\n    time_point<high_resolution_clock> last_time_;\n\n    char data_[PACKET_SIZE];\n\npublic:\n    test_latency_client(boost::asio::io_service & io_service,\n        ip::tcp::resolver::iterator endpoint_iterator, std::uint32_t packet_size)\n        : io_service_(io_service),\n          socket_(io_service), packet_size_(packet_size),\n          last_query_count_(0), total_query_count_(0), last_total_latency_(0.0), total_latency_(0.0)\n    {\n        ::memset(data_, 'h', sizeof(data_));\n        last_time_ = high_resolution_clock::now();\n        do_connect(endpoint_iterator);\n    }\n\n    ~test_latency_client()\n    {\n        time_point<high_resolution_clock> startime = high_resolution_clock::now();\n\n        time_point<high_resolution_clock> endtime = high_resolution_clock::now();\n        duration<double> elapsed_time = duration_cast< duration<double> >(endtime - startime);\n    }\n\nprivate:\n    void display_counters()\n    {\n        elapsed_time_ = duration_cast< duration<double> >(recieve_time_ - send_time_);\n        last_query_count_++;\n        total_query_count_++;\n        last_total_latency_ += elapsed_time_.count();\n        total_latency_ += elapsed_time_.count();\n        time_point<high_resolution_clock> now_time = high_resolution_clock::now();\n        duration<double> interval_time = duration_cast< duration<double> >(now_time - last_time_);\n        double avg_latency, avg_total_latency;\n        if (interval_time.count() > 1.0) {\n            std::cout << \"packet_size = \" << packet_size_ << \" B,                 latency total = \"\n                      << last_total_latency_ << \" ms\" <<  std::endl;\n            \/\/ average latency (one second interval)\n            if (last_query_count_ != 0)\n                avg_latency = (last_total_latency_ * 1000.0) \/ (double)last_query_count_;\n            else\n                avg_latency = 0.0;\n            std::cout << \"average latency       = \" << avg_latency\n                      << \" ms, query count       = \" << last_query_count_ << std::endl;\n\n            \/\/ average latency total\n            if (total_query_count_ != 0)\n                avg_total_latency = (total_latency_ * 1000.0) \/ (double)total_query_count_;\n            else\n                avg_total_latency = 0.0;\n            std::cout << \"average latency total = \" << avg_total_latency\n                      << \" ms, query count total = \" << total_query_count_ << std::endl;\n            std::cout << std::endl;\n\n            \/\/ Reset the counters\n            last_time_ = high_resolution_clock::now();\n            last_query_count_ = 0;\n            last_total_latency_ = 0.0;\n        }\n    }\n\n    void do_connect(ip::tcp::resolver::iterator endpoint_iterator)\n    {\n        boost::asio::async_connect(socket_, endpoint_iterator,\n            [this](boost::system::error_code ec, ip::tcp::resolver::iterator)\n            {\n                if (!ec)\n                {\n                    \/\/do_read();\n                    do_write();\n                }\n            });\n    }\n\n    void do_read()\n    {\n        boost::asio::async_read(socket_,\n            boost::asio::buffer(data_, packet_size_),\n            [this](boost::system::error_code ec, std::size_t bytes_transferred)\n            {\n                if ((uint32_t)bytes_transferred != packet_size_) {\n                    std::cout << \"test_latency_client::do_read(): async_read(), bytes_transferred = \"\n                              << bytes_transferred << \" bytes.\" << std::endl;\n                }\n                if (!ec)\n                {\n                    \/\/ Have recieved the response message\n                    recieve_time_ = high_resolution_clock::now();\n                    display_counters();\n                    do_write();\n                }\n            });\n    }\n\n    void do_write()\n    {\n        \/\/ Prepare to send the request message\n        send_time_ = high_resolution_clock::now();\n        boost::asio::async_write(socket_,\n            boost::asio::buffer(data_, packet_size_),\n            [this](boost::system::error_code ec, std::size_t bytes_transferred)\n            {\n                if ((uint32_t)bytes_transferred != packet_size_) {\n                    std::cout << \"test_latency_client::do_write(): async_write(), bytes_transferred = \"\n                              << bytes_transferred << \" bytes.\" << std::endl;\n                }\n                if (!ec)\n                {\n                    do_read();\n                }\n            });\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MJOLNIR_CORE_ENERGY_CALCULATION_SIMULATOR_HPP\n#define MJOLNIR_CORE_ENERGY_CALCULATION_SIMULATOR_HPP\n#include <mjolnir\/core\/SimulatorBase.hpp>\n#include <mjolnir\/core\/ObserverContainer.hpp>\n#include <mjolnir\/core\/System.hpp>\n#include <mjolnir\/core\/ForceFieldBase.hpp>\n#include <mjolnir\/core\/LoaderBase.hpp>\n#include <mjolnir\/core\/XYZLoader.hpp>\n#include <mjolnir\/core\/DCDLoader.hpp>\n#include <mjolnir\/core\/TRRLoader.hpp>\n\nnamespace mjolnir\n{\n\ntemplate<typename traitsT>\nclass EnergyCalculationSimulator final : public SimulatorBase\n{\n  public:\n    using traits_type      = traitsT;\n    using real_type        = typename traits_type::real_type;\n    using coordinate_type  = typename traits_type::coordinate_type;\n    using system_type      = System<traits_type>;\n    using forcefield_type  = std::unique_ptr<ForceFieldBase<traits_type>>;\n    using observer_type    = ObserverContainer<traits_type>;\n    using loader_base_type = LoaderBase<traits_type>;\n    using loader_type      = std::unique_ptr<loader_base_type>;\n\n  public:\n\n    EnergyCalculationSimulator(const std::size_t total_step, loader_type&& ld,\n            system_type&& sys, forcefield_type&& ff, observer_type&& obs)\n        : step_count_(0),     total_step_(total_step),\n          ld_(std::move(ld)), sys_(std::move(sys)),\n          ff_(std::move(ff)), obs_(std::move(obs)),\n          old_position_(sys_.size())\n    {}\n    ~EnergyCalculationSimulator() override {}\n\n    void initialize() override;\n    bool step()       override;\n    void run()        override;\n    void finalize()   override;\n\n    system_type&       system()       noexcept {return sys_;}\n    system_type const& system() const noexcept {return sys_;}\n\n    forcefield_type&       forcefields()       noexcept {return ff_;}\n    forcefield_type const& forcefields() const noexcept {return ff_;}\n\n    loader_type&       loader()       noexcept {return ld_;}\n    loader_type const& loader() const noexcept {return ld_;}\n\n  protected:\n\n    std::size_t     step_count_, total_step_;\n    loader_type     ld_;\n    system_type     sys_;\n    forcefield_type ff_;\n    observer_type   obs_;\n    std::vector<coordinate_type> old_position_;\n};\n\ntemplate<typename traitsT>\ninline void EnergyCalculationSimulator<traitsT>::initialize()\n{\n    \/\/ instead of initializing simulator (it generate velocities), read the\n    \/\/ current state from the loader.\n    \/\/\n    \/\/ To obtain the total number of snapshots, the loader is already initialized.\n    ld_->load_next(this->sys_);\n\n    \/\/ sys.initialize() generates the initial velocity, so here it is not needed\n\n    this->ff_->initialize(this->sys_);\n\n    \/\/ Since neither save_step nor delta_t are not saved, we add some dummy value.\n    this->obs_.initialize(this->total_step_, 1, 1.0, this->sys_, this->ff_);\n    return;\n}\n\ntemplate<typename traitsT>\ninline bool EnergyCalculationSimulator<traitsT>::step()\n{\n    \/\/ this calculates the energy.\n    obs_.output(this->step_count_, 0.0, this->sys_, this->ff_);\n\n    \/\/ backup current configuration to calculate displacement to determine\n    \/\/ whether we need to update the neighboring list or not\n    for(std::size_t i=0; i<sys_.size(); ++i)\n    {\n        old_position_[i] = sys_.position(i);\n    }\n\n    if(!ld_->load_next(sys_))\n    {\n        \/\/ if loader returns false, it means it fails to read the next traj.\n        return false;\n    }\n\n    \/\/ Here, calling forcefield.update() is not a good idea. It outputs logs\n    \/\/ because it considers all the state including both system and forcefield\n    \/\/ has been changed. But, in this simulator, forcefield does not change.\n    real_type max_displacement_sq = 0.0;\n    for(std::size_t i=0; i<sys_.size(); ++i)\n    {\n        max_displacement_sq = std::max(max_displacement_sq, math::length_sq(\n                    sys_.adjust_direction(sys_.position(i), old_position_[i])));\n    }\n    \/\/ update neighboring list if needed\n    ff_->reduce_margin(2 * std::sqrt(max_displacement_sq), sys_);\n\n    ++step_count_;\n\n    return step_count_ < total_step_;\n}\n\ntemplate<typename traitsT>\ninline void EnergyCalculationSimulator<traitsT>::run()\n{\n    while(this->step()) {};\n    return;\n}\n\ntemplate<typename traitsT>\ninline void EnergyCalculationSimulator<traitsT>::finalize()\n{\n    obs_.finalize(this->total_step_, 0.0, this->sys_, this->ff_);\n    return;\n}\n\n} \/\/ mjolnir\n#endif\/\/ MJOLNIR_CORE_ENERGY_CALCULATION_SIMULATOR_HPP\n<commit_msg>feat: calc pressure in EnergyCalculationSimulator<commit_after>#ifndef MJOLNIR_CORE_ENERGY_CALCULATION_SIMULATOR_HPP\n#define MJOLNIR_CORE_ENERGY_CALCULATION_SIMULATOR_HPP\n#include <mjolnir\/core\/SimulatorBase.hpp>\n#include <mjolnir\/core\/ObserverContainer.hpp>\n#include <mjolnir\/core\/System.hpp>\n#include <mjolnir\/core\/ForceFieldBase.hpp>\n#include <mjolnir\/core\/LoaderBase.hpp>\n#include <mjolnir\/core\/XYZLoader.hpp>\n#include <mjolnir\/core\/DCDLoader.hpp>\n#include <mjolnir\/core\/TRRLoader.hpp>\n\nnamespace mjolnir\n{\n\ntemplate<typename traitsT>\nclass EnergyCalculationSimulator final : public SimulatorBase\n{\n  public:\n    using traits_type      = traitsT;\n    using real_type        = typename traits_type::real_type;\n    using coordinate_type  = typename traits_type::coordinate_type;\n    using system_type      = System<traits_type>;\n    using forcefield_type  = std::unique_ptr<ForceFieldBase<traits_type>>;\n    using observer_type    = ObserverContainer<traits_type>;\n    using loader_base_type = LoaderBase<traits_type>;\n    using loader_type      = std::unique_ptr<loader_base_type>;\n\n  public:\n\n    EnergyCalculationSimulator(const std::size_t total_step, loader_type&& ld,\n            system_type&& sys, forcefield_type&& ff, observer_type&& obs)\n        : step_count_(0),     total_step_(total_step),\n          ld_(std::move(ld)), sys_(std::move(sys)),\n          ff_(std::move(ff)), obs_(std::move(obs)),\n          old_position_(sys_.size())\n    {}\n    ~EnergyCalculationSimulator() override {}\n\n    void initialize() override;\n    bool step()       override;\n    void run()        override;\n    void finalize()   override;\n\n    system_type&       system()       noexcept {return sys_;}\n    system_type const& system() const noexcept {return sys_;}\n\n    forcefield_type&       forcefields()       noexcept {return ff_;}\n    forcefield_type const& forcefields() const noexcept {return ff_;}\n\n    loader_type&       loader()       noexcept {return ld_;}\n    loader_type const& loader() const noexcept {return ld_;}\n\n  protected:\n\n    std::size_t     step_count_, total_step_;\n    loader_type     ld_;\n    system_type     sys_;\n    forcefield_type ff_;\n    observer_type   obs_;\n    std::vector<coordinate_type> old_position_;\n};\n\ntemplate<typename traitsT>\ninline void EnergyCalculationSimulator<traitsT>::initialize()\n{\n    \/\/ instead of initializing simulator (it generate velocities), read the\n    \/\/ current state from the loader.\n    \/\/\n    \/\/ To obtain the total number of snapshots, the loader is already initialized.\n    ld_->load_next(this->sys_);\n\n    \/\/ sys.initialize() generates the initial velocity, so here it is not needed\n\n    this->ff_->initialize(this->sys_);\n\n    this->ff_->calc_force_and_virial(this->sys_);\n\n    auto Pins = this->sys_.virial();\n    for(std::size_t i=0; i<sys_.size(); ++i)\n    {\n        const auto m = sys_.mass(i);\n        const auto v = sys_.velocity(i);\n        Pins += m * math::tensor_product(v, v);\n    }\n\n    sys_.attribute(\"pressure_xx\") = Pins(0, 0);\n    sys_.attribute(\"pressure_yy\") = Pins(1, 1);\n    sys_.attribute(\"pressure_zz\") = Pins(2, 2);\n    sys_.attribute(\"pressure_xy\") = Pins(0, 1);\n    sys_.attribute(\"pressure_yz\") = Pins(1, 2);\n    sys_.attribute(\"pressure_zx\") = Pins(2, 0);\n\n    \/\/ Since neither save_step nor delta_t are not saved, we add some dummy value.\n    this->obs_.initialize(this->total_step_, 1, 1.0, this->sys_, this->ff_);\n    return;\n}\n\ntemplate<typename traitsT>\ninline bool EnergyCalculationSimulator<traitsT>::step()\n{\n    this->ff_->calc_force_and_virial(this->sys_);\n\n    auto Pins = this->sys_.virial();\n    for(std::size_t i=0; i<sys_.size(); ++i)\n    {\n        const auto m = sys_.mass(i);\n        const auto v = sys_.velocity(i);\n        Pins += m * math::tensor_product(v, v);\n    }\n\n    sys_.attribute(\"pressure_xx\") = Pins(0, 0);\n    sys_.attribute(\"pressure_yy\") = Pins(1, 1);\n    sys_.attribute(\"pressure_zz\") = Pins(2, 2);\n    sys_.attribute(\"pressure_xy\") = Pins(0, 1);\n    sys_.attribute(\"pressure_yz\") = Pins(1, 2);\n    sys_.attribute(\"pressure_zx\") = Pins(2, 0);\n\n    \/\/ this calculates the energy.\n    obs_.output(this->step_count_, 0.0, this->sys_, this->ff_);\n\n    \/\/ backup current configuration to calculate displacement to determine\n    \/\/ whether we need to update the neighboring list or not\n    for(std::size_t i=0; i<sys_.size(); ++i)\n    {\n        old_position_[i] = sys_.position(i);\n    }\n\n    if(!ld_->load_next(sys_))\n    {\n        \/\/ if loader returns false, it means it fails to read the next traj.\n        return false;\n    }\n\n    \/\/ Here, calling forcefield.update() is not a good idea. It outputs logs\n    \/\/ because it considers all the state including both system and forcefield\n    \/\/ has been changed. But, in this simulator, forcefield does not change.\n    real_type max_displacement_sq = 0.0;\n    for(std::size_t i=0; i<sys_.size(); ++i)\n    {\n        max_displacement_sq = std::max(max_displacement_sq, math::length_sq(\n                    sys_.adjust_direction(sys_.position(i), old_position_[i])));\n    }\n    \/\/ update neighboring list if needed\n    ff_->reduce_margin(2 * std::sqrt(max_displacement_sq), sys_);\n\n    ++step_count_;\n\n    return step_count_ < total_step_;\n}\n\ntemplate<typename traitsT>\ninline void EnergyCalculationSimulator<traitsT>::run()\n{\n    while(this->step()) {};\n    return;\n}\n\ntemplate<typename traitsT>\ninline void EnergyCalculationSimulator<traitsT>::finalize()\n{\n    obs_.finalize(this->total_step_, 0.0, this->sys_, this->ff_);\n    return;\n}\n\n} \/\/ mjolnir\n#endif\/\/ MJOLNIR_CORE_ENERGY_CALCULATION_SIMULATOR_HPP\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 TaskC.cpp\n *\/\n\n#include <iostream>\n#include <JPetWriter\/JPetWriter.h>\n#include <JPetAnalysisTools\/JPetAnalysisTools.h>\n#include \"TaskC.h\"\n#include <algorithm>\n\nusing namespace std;\n\n\nTaskC::TaskC(const char* name, const char* description): JPetTask(name, description) {}\nTaskC::~TaskC() {}\n\nvoid TaskC::init(const JPetTaskInterface::Options& opts)\n{\n}\n\n\nvoid TaskC::exec()\n{\n  \/\/getting the data from event in propriate format\n  if (auto currSignal = dynamic_cast<const JPetRawSignal* const>(getEvent())) {\n    getStatistics().getCounter(\"No. initial signals\")++;\n    if (fSignals.empty()) {\n      fSignals.push_back(*currSignal);\n    } else {\n      if (fSignals[0].getTimeWindowIndex() == currSignal->getTimeWindowIndex()) {\n        fSignals.push_back(*currSignal);\n      } else {\n\n        vector<JPetHit> hits = createHits(fSignals);\n        hits = JPetAnalysisTools::getHitsOrderedByTime(hits);\n        \/\/ uncomment this in order to fill histograms\n        \/\/ of time differences for subsequent hist\n        studyTimeWindow(hits);\n        saveHits(hits);\n\n        fSignals.clear();\n        fSignals.push_back(*currSignal);\n      }\n    }\n  }\n}\n\nvoid TaskC::exec()\n{\n  \/\/getting the data from event in propriate format\n  if (auto currSignal = dynamic_cast<const JPetRawSignal* const>(getEvent())) {\n    getStatistics().getCounter(\"No. initial signals\")++;\n    if (fSignals.empty()) {\n      fSignals.push_back(*currSignal);\n    } else {\n      if (fSignals[0].getTimeWindowIndex() == currSignal->getTimeWindowIndex()) {\n        fSignals.push_back(*currSignal);\n      } else {\n\n        vector<JPetHit> hits = createHits(fSignals);\n        hits = JPetAnalysisTools::getHitsOrderedByTime(hits);\n        \/\/ uncomment this in order to fill histograms\n        \/\/ of time differences for subsequent hist\n        studyTimeWindow(hits);\n\n        saveHits(hits);\n\n        fSignals.clear();\n        fSignals.push_back(*currSignal);\n      }\n    }\n  }\n}\nvector<JPetHit> TaskC::createHits(const vector<JPetRawSignal>& signals)\n{\n  vector<JPetHit> hits;\n  for (auto i = signals.begin(); i != signals.end(); ++i) {\n    for (auto j = i; ++j != signals.end();) {\n      if (i->getPM().getScin() == j->getPM().getScin()) {\n        \/\/ found 2 signals from the same scintillator\n        \/\/ wrap the RawSignal objects into RecoSignal and PhysSignal\n        \/\/ for now this is just wrapping opne object into another\n        \/\/ in the future analyses it will involve more logic like\n        \/\/ reconstructing the signal's shape, charge, amplitude etc.\n        JPetRecoSignal recoSignalA;\n        JPetRecoSignal recoSignalB;\n        JPetPhysSignal physSignalA;\n        JPetPhysSignal physSignalB;\n        \/\/ assign sides A and B properly\n        if (\n          (i->getPM().getSide() == JPetPM::SideA)\n          && (j->getPM().getSide() == JPetPM::SideB)\n        ) {\n          recoSignalA.setRawSignal(*i);\n          recoSignalB.setRawSignal(*j);\n        } else if (\n          (j->getPM().getSide() == JPetPM::SideA)\n          && (i->getPM().getSide() == JPetPM::SideB)\n        ) {\n          recoSignalA.setRawSignal(*j);\n          recoSignalB.setRawSignal(*i);\n        } else {\n          \/\/ if two hits on the same side, ignore\n          WARNING(\"TWO hits on the same scintillator side we ignore it\");\n          continue;\n        }\n\n        if ( recoSignalA.getRawSignal().getNumberOfPoints(JPetSigCh::Leading) < 4 ) continue;\n        if ( recoSignalB.getRawSignal().getNumberOfPoints(JPetSigCh::Leading) < 4 ) continue;\n\n        bool thresholds_ok = true;\n        for (int i = 1; i <= 4; ++i) {\n          if ( recoSignalA.getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).count(i) < 1 ) {\n            thresholds_ok = false;\n          }\n          if ( recoSignalB.getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).count(i) < 1 ) {\n            thresholds_ok = false;\n          }\n        }\n        if (thresholds_ok == false) {\n          continue;\n        }\n\n        physSignalA.setRecoSignal(recoSignalA);\n        physSignalB.setRecoSignal(recoSignalB);\n        auto leading_points_a = physSignalA.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n        auto leading_points_b = physSignalB.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n\n        \/\/skip signals with no information on 1st threshold\n        \/\/ if(leading_points_a.count(1) == 0) continue;\n        \/\/ if(leading_points_b.count(1) == 0) continue;\n\n        physSignalA.setTime(leading_points_a.at(1));\n        physSignalB.setTime(leading_points_b.at(1));\n\n\n        JPetHit hit;\n        hit.setSignalA(physSignalA);\n        hit.setSignalB(physSignalB);\n        hit.setScintillator(i->getPM().getScin());\n        hit.setBarrelSlot(i->getPM().getScin().getBarrelSlot());\n\n        physSignalA.setTime(physSignalA.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(1));\n        physSignalB.setTime(physSignalB.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(1));\n\n        hit.setTime( 0.5 * ( hit.getSignalA().getTime() + hit.getSignalB().getTime()) );\n\n        hits.push_back(hit);\n        getStatistics().getCounter(\"No. found hits\")++;\n      }\n    }\n  }\n  return hits;\n}\n\nvoid TaskC::terminate()\n{\n  \/\/\tsaveHits(createHits(fSignals)); \/\/if there is something left\n  INFO( Form(\"From %d initial signals %d hits were paired.\",\n             static_cast<int>(getStatistics().getCounter(\"No. initial signals\")),\n             static_cast<int>(getStatistics().getCounter(\"No. found hits\")) )\n      );\n}\n\n\n\nvoid TaskC::studyTimeWindow(const vector<JPetHit>& hits)\n{\n\n  \/\/ plot time differences for subsequent hits at each threshold separately\n  for (int i = 1; i < hits.size(); ++i) {\n    >>> >>> > Use hit sorting from framework library\n    for (int k = 1; k <= 4; ++k) {\n      double t2 = 0.5 * (hits.at(i).getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(k) + hits.at(i).getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(k));\n      double t1 = 0.5 * (hits.at(i - 1).getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(k) + hits.at(i - 1).getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(k));\n      double dt = t2 - t1;\n      getStatistics().getHisto1D(Form(\"timeSepSmall_thr_%d\", k)).Fill(dt \/ 1000.); \/\/ we fill the histo in [ns]\n      getStatistics().getHisto1D(Form(\"timeSepLarge_thr_%d\", k)).Fill(dt \/ 1000.); \/\/ we fill the histo in [ns]\n    }\n  }\n}\n\nvoid TaskC::saveHits(const vector<JPetHit>& hits)\n{\n  assert(fWriter);\n  for (auto hit : hits) {\n    \/\/ here one can impose any conditions on hits that should be\n    \/\/ saved or skipped\n    \/\/ for now, all hits are written to the output file\n    \/\/ without checking anything\n    fWriter->write(hit);\n  }\n}\n<commit_msg>Added setWriter method which was removed by mistake<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 TaskC.cpp\n *\/\n\n#include <iostream>\n#include <JPetWriter\/JPetWriter.h>\n#include <JPetAnalysisTools\/JPetAnalysisTools.h>\n#include \"TaskC.h\"\n#include <algorithm>\n\nusing namespace std;\n\n\nTaskC::TaskC(const char* name, const char* description): JPetTask(name, description) {}\nTaskC::~TaskC() {}\n\nvoid TaskC::init(const JPetTaskInterface::Options& opts)\n{\n}\n\nvoid TaskC::exec()\n{\n  \/\/getting the data from event in propriate format\n  if (auto currSignal = dynamic_cast<const JPetRawSignal* const>(getEvent())) {\n    getStatistics().getCounter(\"No. initial signals\")++;\n    if (fSignals.empty()) {\n      fSignals.push_back(*currSignal);\n    } else {\n      if (fSignals[0].getTimeWindowIndex() == currSignal->getTimeWindowIndex()) {\n        fSignals.push_back(*currSignal);\n      } else {\n\n        vector<JPetHit> hits = createHits(fSignals);\n        hits = JPetAnalysisTools::getHitsOrderedByTime(hits);\n        \/\/ uncomment this in order to fill histograms\n        \/\/ of time differences for subsequent hist\n        studyTimeWindow(hits);\n\n        saveHits(hits);\n\n        fSignals.clear();\n        fSignals.push_back(*currSignal);\n      }\n    }\n  }\n}\nvector<JPetHit> TaskC::createHits(const vector<JPetRawSignal>& signals)\n{\n  vector<JPetHit> hits;\n  for (auto i = signals.begin(); i != signals.end(); ++i) {\n    for (auto j = i; ++j != signals.end();) {\n      if (i->getPM().getScin() == j->getPM().getScin()) {\n        \/\/ found 2 signals from the same scintillator\n        \/\/ wrap the RawSignal objects into RecoSignal and PhysSignal\n        \/\/ for now this is just wrapping opne object into another\n        \/\/ in the future analyses it will involve more logic like\n        \/\/ reconstructing the signal's shape, charge, amplitude etc.\n        JPetRecoSignal recoSignalA;\n        JPetRecoSignal recoSignalB;\n        JPetPhysSignal physSignalA;\n        JPetPhysSignal physSignalB;\n        \/\/ assign sides A and B properly\n        if (\n          (i->getPM().getSide() == JPetPM::SideA)\n          && (j->getPM().getSide() == JPetPM::SideB)\n        ) {\n          recoSignalA.setRawSignal(*i);\n          recoSignalB.setRawSignal(*j);\n        } else if (\n          (j->getPM().getSide() == JPetPM::SideA)\n          && (i->getPM().getSide() == JPetPM::SideB)\n        ) {\n          recoSignalA.setRawSignal(*j);\n          recoSignalB.setRawSignal(*i);\n        } else {\n          \/\/ if two hits on the same side, ignore\n          WARNING(\"TWO hits on the same scintillator side we ignore it\");\n          continue;\n        }\n\n        if ( recoSignalA.getRawSignal().getNumberOfPoints(JPetSigCh::Leading) < 4 ) continue;\n        if ( recoSignalB.getRawSignal().getNumberOfPoints(JPetSigCh::Leading) < 4 ) continue;\n\n        bool thresholds_ok = true;\n        for (int i = 1; i <= 4; ++i) {\n          if ( recoSignalA.getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).count(i) < 1 ) {\n            thresholds_ok = false;\n          }\n          if ( recoSignalB.getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).count(i) < 1 ) {\n            thresholds_ok = false;\n          }\n        }\n        if (thresholds_ok == false) {\n          continue;\n        }\n\n        physSignalA.setRecoSignal(recoSignalA);\n        physSignalB.setRecoSignal(recoSignalB);\n        auto leading_points_a = physSignalA.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n        auto leading_points_b = physSignalB.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n\n        \/\/skip signals with no information on 1st threshold\n        \/\/ if(leading_points_a.count(1) == 0) continue;\n        \/\/ if(leading_points_b.count(1) == 0) continue;\n\n        physSignalA.setTime(leading_points_a.at(1));\n        physSignalB.setTime(leading_points_b.at(1));\n\n\n        JPetHit hit;\n        hit.setSignalA(physSignalA);\n        hit.setSignalB(physSignalB);\n        hit.setScintillator(i->getPM().getScin());\n        hit.setBarrelSlot(i->getPM().getScin().getBarrelSlot());\n\n        physSignalA.setTime(physSignalA.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(1));\n        physSignalB.setTime(physSignalB.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(1));\n\n        hit.setTime( 0.5 * ( hit.getSignalA().getTime() + hit.getSignalB().getTime()) );\n\n        hits.push_back(hit);\n        getStatistics().getCounter(\"No. found hits\")++;\n      }\n    }\n  }\n  return hits;\n}\n\nvoid TaskC::terminate()\n{\n  \/\/\tsaveHits(createHits(fSignals)); \/\/if there is something left\n  INFO( Form(\"From %d initial signals %d hits were paired.\",\n             static_cast<int>(getStatistics().getCounter(\"No. initial signals\")),\n             static_cast<int>(getStatistics().getCounter(\"No. found hits\")) )\n      );\n}\n\n\n\nvoid TaskC::studyTimeWindow(const vector<JPetHit>& hits)\n{\n\n  \/\/ plot time differences for subsequent hits at each threshold separately\n  for (int i = 1; i < hits.size(); ++i) {\n    for (int k = 1; k <= 4; ++k) {\n      double t2 = 0.5 * (hits.at(i).getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(k) + hits.at(i).getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(k));\n      double t1 = 0.5 * (hits.at(i - 1).getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(k) + hits.at(i - 1).getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading).at(k));\n      double dt = t2 - t1;\n      getStatistics().getHisto1D(Form(\"timeSepSmall_thr_%d\", k)).Fill(dt \/ 1000.); \/\/ we fill the histo in [ns]\n      getStatistics().getHisto1D(Form(\"timeSepLarge_thr_%d\", k)).Fill(dt \/ 1000.); \/\/ we fill the histo in [ns]\n    }\n  }\n}\n\nvoid TaskC::saveHits(const vector<JPetHit>& hits)\n{\n  assert(fWriter);\n  for (auto hit : hits) {\n    \/\/ here one can impose any conditions on hits that should be\n    \/\/ saved or skipped\n    \/\/ for now, all hits are written to the output file\n    \/\/ without checking anything\n    fWriter->write(hit);\n  }\n}\n\nvoid TaskC::setWriter(JPetWriter* writer)\n{\n  fWriter = writer;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"drape\/overlay_tree.hpp\"\n\n#include \"drape\/constants.hpp\"\n#include \"drape\/debug_rect_renderer.hpp\"\n\n#include <algorithm>\n\nnamespace dp\n{\nint const kMinFrameUpdatePeriod = 5;\nint const kAvgFrameUpdatePeriod = 10;\nint const kMaxFrameUpdatePeriod = 15;\nuint32_t const kMinHandlesCount = 100;\nuint32_t const kMaxHandlesCount = 1000;\n\nsize_t const kAverageHandlesCount[dp::OverlayRanksCount] = { 300, 200, 50 };\nint const kInvalidFrame = -1;\n\nnamespace\n{\nclass HandleComparator\n{\npublic:\n  explicit HandleComparator(bool enableMask)\n    : m_enableMask(enableMask)\n  {}\n\n  bool operator()(ref_ptr<OverlayHandle> const & l, ref_ptr<OverlayHandle> const & r) const\n  {\n    return IsGreater(l, r);\n  }\n\n  bool IsGreater(ref_ptr<OverlayHandle> const & l, ref_ptr<OverlayHandle> const & r) const\n  {\n    bool const displayFlagLeft = ((!m_enableMask || l->IsUserMarkOverlay()) ? true : l->GetDisplayFlag());\n    bool const displayFlagRight = ((!m_enableMask || r->IsUserMarkOverlay()) ? true : r->GetDisplayFlag());\n    if (displayFlagLeft > displayFlagRight)\n      return true;\n\n    if (displayFlagLeft == displayFlagRight)\n    {\n      uint64_t const mask = m_enableMask ? l->GetPriorityMask() & r->GetPriorityMask() :\n                            dp::kPriorityMaskAll;\n      uint64_t const priorityLeft = l->GetPriority() & mask;\n      uint64_t const priorityRight = r->GetPriority() & mask;\n      if (priorityLeft > priorityRight)\n        return true;\n\n      if (priorityLeft == priorityRight)\n      {\n        auto const & hashLeft = l->GetOverlayID();\n        auto const & hashRight = r->GetOverlayID();\n\n        if (hashLeft > hashRight)\n          return true;\n\n        if (hashLeft == hashRight)\n          return l.get() > r.get();\n      }\n    }\n    return false;\n  }\n\nprivate:\n  bool m_enableMask;\n};\n}  \/\/ namespace\n\nOverlayTree::OverlayTree(double visualScale)\n  : m_frameCounter(kInvalidFrame)\n  , m_isDisplacementEnabled(true)\n  , m_frameUpdatePeriod(kMinFrameUpdatePeriod)\n{\n  m_traits.SetVisualScale(visualScale);\n  for (size_t i = 0; i < m_handles.size(); i++)\n    m_handles[i].reserve(kAverageHandlesCount[i]);\n}\n\nvoid OverlayTree::Clear()\n{\n  m_frameCounter = kInvalidFrame;\n  TBase::Clear();\n  m_handlesCache.clear();\n  for (auto & handles : m_handles)\n    handles.clear();\n  m_displacers.clear();\n}\n\nbool OverlayTree::Frame()\n{\n  if (IsNeedUpdate())\n    return true;\n\n  \/\/ Choose optimal frame update period.\n  if (m_frameCounter == 0)\n  {\n    auto const handlesCount = m_handlesCache.size();\n    if (handlesCount > kMaxHandlesCount)\n      m_frameUpdatePeriod = kMaxFrameUpdatePeriod;\n    else if (handlesCount < kMinHandlesCount)\n      m_frameUpdatePeriod = kMinFrameUpdatePeriod;\n    else\n      m_frameUpdatePeriod = kAvgFrameUpdatePeriod;\n  }\n\n  m_frameCounter++;\n  if (m_frameCounter >= m_frameUpdatePeriod)\n    m_frameCounter = kInvalidFrame;\n\n  return IsNeedUpdate();\n}\n\nbool OverlayTree::IsNeedUpdate() const\n{\n  return m_frameCounter == kInvalidFrame;\n}\n\nvoid OverlayTree::StartOverlayPlacing(ScreenBase const & screen)\n{\n  ASSERT(IsNeedUpdate(), ());\n  TBase::Clear();\n  m_handlesCache.clear();\n  m_traits.SetModelView(screen);\n  m_displacementInfo.clear();\n}\n\nvoid OverlayTree::Remove(ref_ptr<OverlayHandle> handle)\n{\n  if (m_frameCounter == kInvalidFrame)\n    return;\n\n  if (m_handlesCache.find(handle) != m_handlesCache.end())\n    m_frameCounter = kInvalidFrame;\n}\n\nvoid OverlayTree::Add(ref_ptr<OverlayHandle> handle)\n{\n  ASSERT(IsNeedUpdate(), ());\n\n  ScreenBase const & modelView = GetModelView();\n\n  handle->SetIsVisible(false);\n  handle->SetCachingEnable(true);\n\n  \/\/ Skip duplicates.\n  if (m_handlesCache.find(handle) != m_handlesCache.end())\n    return;\n\n  \/\/ Skip not-ready handles.\n  if (!handle->Update(modelView))\n  {\n    m_frameCounter == kInvalidFrame;\n    handle->SetReady(false);\n    return;\n  }\n  else\n  {\n    handle->SetReady(true);\n  }\n\n  \/\/ Clip handles which are out of screen if these handles were not displacers\n  \/\/ last time. Also clip all handles in reverse projection.\n  m2::RectD const pixelRect = handle->GetExtendedPixelRect(modelView);\n  if (modelView.IsReverseProjection3d(pixelRect.Center()) ||\n      (m_displacers.find(handle) == m_displacers.end() &&\n       !m_traits.GetExtendedScreenRect().IsIntersect(pixelRect)))\n  {\n    handle->SetIsVisible(false);\n    return;\n  }\n\n  ASSERT_GREATER_OR_EQUAL(handle->GetOverlayRank(), 0, ());\n  size_t const rank = static_cast<size_t>(handle->GetOverlayRank());\n  ASSERT_LESS(rank, m_handles.size(), ());\n  m_handles[rank].emplace_back(handle);\n}\n\nvoid OverlayTree::InsertHandle(ref_ptr<OverlayHandle> handle, int currentRank,\n                               ref_ptr<OverlayHandle> const & parentOverlay)\n{\n  ASSERT(IsNeedUpdate(), ());\n\n#ifdef DEBUG_OVERLAYS_OUTPUT\n  string str = handle->GetOverlayDebugInfo();\n  if (!str.empty())\n    LOG(LINFO, (str));\n#endif\n\n  ScreenBase const & modelView = GetModelView();\n  m2::RectD const pixelRect = handle->GetExtendedPixelRect(modelView);\n  if (!m_isDisplacementEnabled)\n  {\n    m_handlesCache.insert(handle);\n    TBase::Add(handle, pixelRect);\n    return;\n  }\n\n  TOverlayContainer rivals;\n  HandleComparator comparator(true \/* enableMask *\/);\n\n  \/\/ Find elements that already on OverlayTree and it's pixel rect\n  \/\/ intersect with handle pixel rect (\"Intersected elements\").\n  ForEachInRect(pixelRect, [&] (ref_ptr<OverlayHandle> const & h)\n  {\n    bool const isParent = (h == parentOverlay) ||\n                          (h->GetOverlayID() == handle->GetOverlayID() &&\n                           h->GetOverlayRank() < handle->GetOverlayRank());\n    if (!isParent && handle->IsIntersect(modelView, h))\n      rivals.push_back(h);\n  });\n\n  \/\/ If handle is bound to its parent, parent's handle will be used.\n  ref_ptr<OverlayHandle> handleToCompare = handle;\n  bool const boundToParent = (parentOverlay != nullptr && handle->IsBound());\n  if (boundToParent)\n    handleToCompare = parentOverlay;\n\n  bool const selected = m_selectedFeatureID.IsValid() &&\n                        handleToCompare->GetOverlayID().m_featureId == m_selectedFeatureID;\n\n  if (!selected)\n  {\n    \/\/ In this loop we decide which element must be visible.\n    \/\/ If input element \"handle\" has more priority than all \"Intersected elements\",\n    \/\/ then we remove all \"Intersected elements\" and insert input element \"handle\".\n    \/\/ But if some of already inserted elements have more priority, then we don't insert \"handle\".\n    for (auto const & rivalHandle : rivals)\n    {\n      bool const rejectBySelected = m_selectedFeatureID.IsValid() &&\n                                    rivalHandle->GetOverlayID().m_featureId == m_selectedFeatureID;\n\n      bool rejectByDepth = false;\n      if (!rejectBySelected && modelView.isPerspective())\n      {\n        bool const pathTextComparation = handle->HasLinearFeatureShape() || rivalHandle->HasLinearFeatureShape();\n        rejectByDepth = !pathTextComparation &&\n                        handleToCompare->GetPivot(modelView, true).y > rivalHandle->GetPivot(modelView, true).y;\n      }\n\n      if (rejectBySelected || rejectByDepth || comparator.IsGreater(rivalHandle, handleToCompare))\n      {\n        \/\/ Handle is displaced and bound to its parent, parent will be displaced too.\n        if (boundToParent)\n        {\n          DeleteHandleWithParents(parentOverlay, currentRank - 1);\n          StoreDisplacementInfo(0 \/* case index *\/, handle, parentOverlay);\n        }\n        StoreDisplacementInfo(1 \/* case index *\/, rivalHandle, handle);\n        return;\n      }\n    }\n  }\n\n  \/\/ Current overlay displaces other overlay, delete them.\n  for (auto const & rivalHandle : rivals)\n  {\n    if (rivalHandle->IsBound())\n    {\n      \/\/ Delete rival handle and all handles bound to it.\n      for (auto it = m_handlesCache.begin(); it != m_handlesCache.end();)\n      {\n        if ((*it)->GetOverlayID() == rivalHandle->GetOverlayID())\n        {\n          Erase(*it);\n          StoreDisplacementInfo(2 \/* case index *\/, handle, *it);\n          it = m_handlesCache.erase(it);\n        }\n        else\n        {\n          ++it;\n        }\n      }\n    }\n    else\n    {\n      DeleteHandle(rivalHandle);\n      StoreDisplacementInfo(3 \/* case index *\/, handle, rivalHandle);\n    }\n  }\n\n  m_handlesCache.insert(handle);\n  TBase::Add(handle, pixelRect);\n}\n\nvoid OverlayTree::EndOverlayPlacing()\n{\n  ASSERT(IsNeedUpdate(), ());\n\n  m_displacers.clear();\n\n#ifdef DEBUG_OVERLAYS_OUTPUT\n  LOG(LINFO, (\"- BEGIN OVERLAYS PLACING\"));\n#endif\n\n  HandleComparator comparator(false \/* enableMask *\/);\n\n  for (int rank = 0; rank < dp::OverlayRanksCount; rank++)\n  {\n    std::sort(m_handles[rank].begin(), m_handles[rank].end(), comparator);\n    for (auto const & handle : m_handles[rank])\n    {\n      ref_ptr<OverlayHandle> parentOverlay;\n      if (!CheckHandle(handle, rank, parentOverlay))\n        continue;\n\n      InsertHandle(handle, rank, parentOverlay);\n    }\n  }\n  \n  for (int rank = 0; rank < dp::OverlayRanksCount; rank++)\n  {\n    for (auto const & handle : m_handles[rank])\n      handle->SetDisplayFlag(false);\n    m_handles[rank].clear();\n  }\n\n  for (auto const & handle : m_handlesCache)\n  {\n    handle->SetDisplayFlag(true);\n    handle->SetIsVisible(true);\n    handle->SetCachingEnable(false);\n  }\n\n  m_frameCounter = 0;\n\n#ifdef DEBUG_OVERLAYS_OUTPUT\n  LOG(LINFO, (\"- END OVERLAYS PLACING\"));\n#endif\n}\n\nbool OverlayTree::CheckHandle(ref_ptr<OverlayHandle> handle, int currentRank,\n                              ref_ptr<OverlayHandle> & parentOverlay) const\n{\n  if (currentRank == dp::OverlayRank0)\n    return true;\n\n  parentOverlay = FindParent(handle, currentRank - 1);\n  return parentOverlay != nullptr;\n}\n\nref_ptr<OverlayHandle> OverlayTree::FindParent(ref_ptr<OverlayHandle> handle, int searchingRank) const\n{\n  ASSERT_GREATER_OR_EQUAL(searchingRank, 0, ());\n  ASSERT_LESS(searchingRank, static_cast<int>(m_handles.size()), ());\n  for (auto const & h : m_handles[searchingRank])\n  {\n    if (h->GetOverlayID() == handle->GetOverlayID() && m_handlesCache.find(h) != m_handlesCache.end())\n      return h;\n  }\n  return nullptr;\n}\n\nvoid OverlayTree::DeleteHandle(ref_ptr<OverlayHandle> const & handle)\n{\n  size_t const deletedCount = m_handlesCache.erase(handle);\n  if (deletedCount != 0)\n    Erase(handle);\n}\n\nvoid OverlayTree::DeleteHandleWithParents(ref_ptr<OverlayHandle> handle, int currentRank)\n{\n  currentRank--;\n  while (currentRank >= dp::OverlayRank0)\n  {\n    auto parent = FindParent(handle, currentRank);\n    if (parent != nullptr && parent->IsBound())\n      DeleteHandle(parent);\n    currentRank--;\n  }\n  DeleteHandle(handle);\n}\n\nbool OverlayTree::GetSelectedFeatureRect(ScreenBase const & screen, m2::RectD & featureRect)\n{\n  if (!m_selectedFeatureID.IsValid())\n    return false;\n\n  featureRect.MakeEmpty();\n  for (auto const & handle : m_handlesCache)\n  {\n    if (handle->IsVisible() && handle->GetOverlayID().m_featureId == m_selectedFeatureID)\n    {\n      m2::RectD rect = handle->GetPixelRect(screen, screen.isPerspective());\n      featureRect.Add(rect);\n    }\n  }\n  return true;\n}\n\nvoid OverlayTree::Select(m2::PointD const & glbPoint, TOverlayContainer & result) const\n{\n  ScreenBase const & screen = GetModelView();\n  m2::PointD const pxPoint = screen.GtoP(glbPoint);\n\n  double const kSearchRectHalfSize = 10.0;\n  m2::RectD rect(pxPoint, pxPoint);\n  rect.Inflate(kSearchRectHalfSize, kSearchRectHalfSize);\n\n  for (auto const & handle : m_handlesCache)\n  {\n    if (!handle->HasLinearFeatureShape() && rect.IsPointInside(handle->GetPivot(screen, false)))\n      result.push_back(handle);\n  }\n}\n\nvoid OverlayTree::Select(m2::RectD const & rect, TOverlayContainer & result) const\n{\n  ScreenBase screen = GetModelView();\n  ForEachInRect(rect, [&](ref_ptr<OverlayHandle> const & h)\n  {\n    if (!h->HasLinearFeatureShape() && h->IsVisible() && h->GetOverlayID().m_featureId.IsValid())\n    {\n      OverlayHandle::Rects shape;\n      h->GetPixelShape(screen, screen.isPerspective(), shape);\n      for (m2::RectF const & rShape : shape)\n      {\n        if (rShape.IsIntersect(m2::RectF(rect)))\n        {\n          result.push_back(h);\n          break;\n        }\n      }\n    }\n  });\n}\n\nvoid OverlayTree::SetDisplacementEnabled(bool enabled)\n{\n  if (m_isDisplacementEnabled == enabled)\n    return;\n  m_isDisplacementEnabled = enabled;\n  m_frameCounter = kInvalidFrame;\n}\n\nvoid OverlayTree::SetSelectedFeature(FeatureID const & featureID)\n{\n  m_selectedFeatureID = featureID;\n}\n\nOverlayTree::TDisplacementInfo const & OverlayTree::GetDisplacementInfo() const\n{\n  return m_displacementInfo;\n}\n\nvoid OverlayTree::StoreDisplacementInfo(int caseIndex, ref_ptr<OverlayHandle> displacerHandle,\n                                        ref_ptr<OverlayHandle> displacedHandle)\n{\n  ScreenBase const & modelView = GetModelView();\n  m2::RectD const pixelRect = displacerHandle->GetExtendedPixelRect(modelView);\n  if (!m_traits.GetDisplacersFreeRect().IsRectInside(pixelRect))\n    m_displacers.insert(displacerHandle);\n\n#ifdef DEBUG_OVERLAYS_OUTPUT\n    LOG(LINFO, (\"Displace (\", caseIndex, \"):\", displacerHandle->GetOverlayDebugInfo(),\n                \"->\", displacedHandle->GetOverlayDebugInfo()));\n#else\n  UNUSED_VALUE(caseIndex);\n#endif\n\n  if (!dp::DebugRectRenderer::Instance().IsEnabled())\n    return;\n  m_displacementInfo.emplace_back(displacerHandle->GetExtendedPixelRect(modelView).Center(),\n                                  displacedHandle->GetExtendedPixelRect(modelView).Center(),\n                                  dp::Color(0, 0, 255, 255));\n}\n\nvoid detail::OverlayTraits::SetVisualScale(double visualScale)\n{\n  m_visualScale = visualScale;\n}\n\nvoid detail::OverlayTraits::SetModelView(ScreenBase const & modelView)\n{\n  m_modelView = modelView;\n\n  double const extension = m_visualScale * kScreenPixelRectExtension;\n  double const doubleExtension = 2.0 * extension;\n  m_extendedScreenRect = modelView.PixelRectIn3d();\n  m_extendedScreenRect.Inflate(extension, extension);\n\n  m_displacersFreeRect = modelView.PixelRectIn3d();\n  if (m_displacersFreeRect.SizeX() > doubleExtension && m_displacersFreeRect.SizeY() > doubleExtension)\n    m_displacersFreeRect.Inflate(-extension, -extension);\n  else\n    m_displacersFreeRect.SetSizes(1e-7, 1e-7);\n}\n}  \/\/ namespace dp\n<commit_msg>Drape warning fix.<commit_after>#include \"drape\/overlay_tree.hpp\"\n\n#include \"drape\/constants.hpp\"\n#include \"drape\/debug_rect_renderer.hpp\"\n\n#include <algorithm>\n\nnamespace dp\n{\nint const kMinFrameUpdatePeriod = 5;\nint const kAvgFrameUpdatePeriod = 10;\nint const kMaxFrameUpdatePeriod = 15;\nuint32_t const kMinHandlesCount = 100;\nuint32_t const kMaxHandlesCount = 1000;\n\nsize_t const kAverageHandlesCount[dp::OverlayRanksCount] = { 300, 200, 50 };\nint const kInvalidFrame = -1;\n\nnamespace\n{\nclass HandleComparator\n{\npublic:\n  explicit HandleComparator(bool enableMask)\n    : m_enableMask(enableMask)\n  {}\n\n  bool operator()(ref_ptr<OverlayHandle> const & l, ref_ptr<OverlayHandle> const & r) const\n  {\n    return IsGreater(l, r);\n  }\n\n  bool IsGreater(ref_ptr<OverlayHandle> const & l, ref_ptr<OverlayHandle> const & r) const\n  {\n    bool const displayFlagLeft = ((!m_enableMask || l->IsUserMarkOverlay()) ? true : l->GetDisplayFlag());\n    bool const displayFlagRight = ((!m_enableMask || r->IsUserMarkOverlay()) ? true : r->GetDisplayFlag());\n    if (displayFlagLeft > displayFlagRight)\n      return true;\n\n    if (displayFlagLeft == displayFlagRight)\n    {\n      uint64_t const mask = m_enableMask ? l->GetPriorityMask() & r->GetPriorityMask() :\n                            dp::kPriorityMaskAll;\n      uint64_t const priorityLeft = l->GetPriority() & mask;\n      uint64_t const priorityRight = r->GetPriority() & mask;\n      if (priorityLeft > priorityRight)\n        return true;\n\n      if (priorityLeft == priorityRight)\n      {\n        auto const & hashLeft = l->GetOverlayID();\n        auto const & hashRight = r->GetOverlayID();\n\n        if (hashLeft > hashRight)\n          return true;\n\n        if (hashLeft == hashRight)\n          return l.get() > r.get();\n      }\n    }\n    return false;\n  }\n\nprivate:\n  bool m_enableMask;\n};\n}  \/\/ namespace\n\nOverlayTree::OverlayTree(double visualScale)\n  : m_frameCounter(kInvalidFrame)\n  , m_isDisplacementEnabled(true)\n  , m_frameUpdatePeriod(kMinFrameUpdatePeriod)\n{\n  m_traits.SetVisualScale(visualScale);\n  for (size_t i = 0; i < m_handles.size(); i++)\n    m_handles[i].reserve(kAverageHandlesCount[i]);\n}\n\nvoid OverlayTree::Clear()\n{\n  m_frameCounter = kInvalidFrame;\n  TBase::Clear();\n  m_handlesCache.clear();\n  for (auto & handles : m_handles)\n    handles.clear();\n  m_displacers.clear();\n}\n\nbool OverlayTree::Frame()\n{\n  if (IsNeedUpdate())\n    return true;\n\n  \/\/ Choose optimal frame update period.\n  if (m_frameCounter == 0)\n  {\n    auto const handlesCount = m_handlesCache.size();\n    if (handlesCount > kMaxHandlesCount)\n      m_frameUpdatePeriod = kMaxFrameUpdatePeriod;\n    else if (handlesCount < kMinHandlesCount)\n      m_frameUpdatePeriod = kMinFrameUpdatePeriod;\n    else\n      m_frameUpdatePeriod = kAvgFrameUpdatePeriod;\n  }\n\n  m_frameCounter++;\n  if (m_frameCounter >= m_frameUpdatePeriod)\n    m_frameCounter = kInvalidFrame;\n\n  return IsNeedUpdate();\n}\n\nbool OverlayTree::IsNeedUpdate() const\n{\n  return m_frameCounter == kInvalidFrame;\n}\n\nvoid OverlayTree::StartOverlayPlacing(ScreenBase const & screen)\n{\n  ASSERT(IsNeedUpdate(), ());\n  TBase::Clear();\n  m_handlesCache.clear();\n  m_traits.SetModelView(screen);\n  m_displacementInfo.clear();\n}\n\nvoid OverlayTree::Remove(ref_ptr<OverlayHandle> handle)\n{\n  if (m_frameCounter == kInvalidFrame)\n    return;\n\n  if (m_handlesCache.find(handle) != m_handlesCache.end())\n    m_frameCounter = kInvalidFrame;\n}\n\nvoid OverlayTree::Add(ref_ptr<OverlayHandle> handle)\n{\n  ASSERT(IsNeedUpdate(), ());\n\n  ScreenBase const & modelView = GetModelView();\n\n  handle->SetIsVisible(false);\n  handle->SetCachingEnable(true);\n\n  \/\/ Skip duplicates.\n  if (m_handlesCache.find(handle) != m_handlesCache.end())\n    return;\n\n  \/\/ Skip not-ready handles.\n  if (!handle->Update(modelView))\n  {\n    m_frameCounter = kInvalidFrame;\n    handle->SetReady(false);\n    return;\n  }\n  else\n  {\n    handle->SetReady(true);\n  }\n\n  \/\/ Clip handles which are out of screen if these handles were not displacers\n  \/\/ last time. Also clip all handles in reverse projection.\n  m2::RectD const pixelRect = handle->GetExtendedPixelRect(modelView);\n  if (modelView.IsReverseProjection3d(pixelRect.Center()) ||\n      (m_displacers.find(handle) == m_displacers.end() &&\n       !m_traits.GetExtendedScreenRect().IsIntersect(pixelRect)))\n  {\n    handle->SetIsVisible(false);\n    return;\n  }\n\n  ASSERT_GREATER_OR_EQUAL(handle->GetOverlayRank(), 0, ());\n  size_t const rank = static_cast<size_t>(handle->GetOverlayRank());\n  ASSERT_LESS(rank, m_handles.size(), ());\n  m_handles[rank].emplace_back(handle);\n}\n\nvoid OverlayTree::InsertHandle(ref_ptr<OverlayHandle> handle, int currentRank,\n                               ref_ptr<OverlayHandle> const & parentOverlay)\n{\n  ASSERT(IsNeedUpdate(), ());\n\n#ifdef DEBUG_OVERLAYS_OUTPUT\n  string str = handle->GetOverlayDebugInfo();\n  if (!str.empty())\n    LOG(LINFO, (str));\n#endif\n\n  ScreenBase const & modelView = GetModelView();\n  m2::RectD const pixelRect = handle->GetExtendedPixelRect(modelView);\n  if (!m_isDisplacementEnabled)\n  {\n    m_handlesCache.insert(handle);\n    TBase::Add(handle, pixelRect);\n    return;\n  }\n\n  TOverlayContainer rivals;\n  HandleComparator comparator(true \/* enableMask *\/);\n\n  \/\/ Find elements that already on OverlayTree and it's pixel rect\n  \/\/ intersect with handle pixel rect (\"Intersected elements\").\n  ForEachInRect(pixelRect, [&] (ref_ptr<OverlayHandle> const & h)\n  {\n    bool const isParent = (h == parentOverlay) ||\n                          (h->GetOverlayID() == handle->GetOverlayID() &&\n                           h->GetOverlayRank() < handle->GetOverlayRank());\n    if (!isParent && handle->IsIntersect(modelView, h))\n      rivals.push_back(h);\n  });\n\n  \/\/ If handle is bound to its parent, parent's handle will be used.\n  ref_ptr<OverlayHandle> handleToCompare = handle;\n  bool const boundToParent = (parentOverlay != nullptr && handle->IsBound());\n  if (boundToParent)\n    handleToCompare = parentOverlay;\n\n  bool const selected = m_selectedFeatureID.IsValid() &&\n                        handleToCompare->GetOverlayID().m_featureId == m_selectedFeatureID;\n\n  if (!selected)\n  {\n    \/\/ In this loop we decide which element must be visible.\n    \/\/ If input element \"handle\" has more priority than all \"Intersected elements\",\n    \/\/ then we remove all \"Intersected elements\" and insert input element \"handle\".\n    \/\/ But if some of already inserted elements have more priority, then we don't insert \"handle\".\n    for (auto const & rivalHandle : rivals)\n    {\n      bool const rejectBySelected = m_selectedFeatureID.IsValid() &&\n                                    rivalHandle->GetOverlayID().m_featureId == m_selectedFeatureID;\n\n      bool rejectByDepth = false;\n      if (!rejectBySelected && modelView.isPerspective())\n      {\n        bool const pathTextComparation = handle->HasLinearFeatureShape() || rivalHandle->HasLinearFeatureShape();\n        rejectByDepth = !pathTextComparation &&\n                        handleToCompare->GetPivot(modelView, true).y > rivalHandle->GetPivot(modelView, true).y;\n      }\n\n      if (rejectBySelected || rejectByDepth || comparator.IsGreater(rivalHandle, handleToCompare))\n      {\n        \/\/ Handle is displaced and bound to its parent, parent will be displaced too.\n        if (boundToParent)\n        {\n          DeleteHandleWithParents(parentOverlay, currentRank - 1);\n          StoreDisplacementInfo(0 \/* case index *\/, handle, parentOverlay);\n        }\n        StoreDisplacementInfo(1 \/* case index *\/, rivalHandle, handle);\n        return;\n      }\n    }\n  }\n\n  \/\/ Current overlay displaces other overlay, delete them.\n  for (auto const & rivalHandle : rivals)\n  {\n    if (rivalHandle->IsBound())\n    {\n      \/\/ Delete rival handle and all handles bound to it.\n      for (auto it = m_handlesCache.begin(); it != m_handlesCache.end();)\n      {\n        if ((*it)->GetOverlayID() == rivalHandle->GetOverlayID())\n        {\n          Erase(*it);\n          StoreDisplacementInfo(2 \/* case index *\/, handle, *it);\n          it = m_handlesCache.erase(it);\n        }\n        else\n        {\n          ++it;\n        }\n      }\n    }\n    else\n    {\n      DeleteHandle(rivalHandle);\n      StoreDisplacementInfo(3 \/* case index *\/, handle, rivalHandle);\n    }\n  }\n\n  m_handlesCache.insert(handle);\n  TBase::Add(handle, pixelRect);\n}\n\nvoid OverlayTree::EndOverlayPlacing()\n{\n  ASSERT(IsNeedUpdate(), ());\n\n  m_displacers.clear();\n\n#ifdef DEBUG_OVERLAYS_OUTPUT\n  LOG(LINFO, (\"- BEGIN OVERLAYS PLACING\"));\n#endif\n\n  HandleComparator comparator(false \/* enableMask *\/);\n\n  for (int rank = 0; rank < dp::OverlayRanksCount; rank++)\n  {\n    std::sort(m_handles[rank].begin(), m_handles[rank].end(), comparator);\n    for (auto const & handle : m_handles[rank])\n    {\n      ref_ptr<OverlayHandle> parentOverlay;\n      if (!CheckHandle(handle, rank, parentOverlay))\n        continue;\n\n      InsertHandle(handle, rank, parentOverlay);\n    }\n  }\n  \n  for (int rank = 0; rank < dp::OverlayRanksCount; rank++)\n  {\n    for (auto const & handle : m_handles[rank])\n      handle->SetDisplayFlag(false);\n    m_handles[rank].clear();\n  }\n\n  for (auto const & handle : m_handlesCache)\n  {\n    handle->SetDisplayFlag(true);\n    handle->SetIsVisible(true);\n    handle->SetCachingEnable(false);\n  }\n\n  m_frameCounter = 0;\n\n#ifdef DEBUG_OVERLAYS_OUTPUT\n  LOG(LINFO, (\"- END OVERLAYS PLACING\"));\n#endif\n}\n\nbool OverlayTree::CheckHandle(ref_ptr<OverlayHandle> handle, int currentRank,\n                              ref_ptr<OverlayHandle> & parentOverlay) const\n{\n  if (currentRank == dp::OverlayRank0)\n    return true;\n\n  parentOverlay = FindParent(handle, currentRank - 1);\n  return parentOverlay != nullptr;\n}\n\nref_ptr<OverlayHandle> OverlayTree::FindParent(ref_ptr<OverlayHandle> handle, int searchingRank) const\n{\n  ASSERT_GREATER_OR_EQUAL(searchingRank, 0, ());\n  ASSERT_LESS(searchingRank, static_cast<int>(m_handles.size()), ());\n  for (auto const & h : m_handles[searchingRank])\n  {\n    if (h->GetOverlayID() == handle->GetOverlayID() && m_handlesCache.find(h) != m_handlesCache.end())\n      return h;\n  }\n  return nullptr;\n}\n\nvoid OverlayTree::DeleteHandle(ref_ptr<OverlayHandle> const & handle)\n{\n  size_t const deletedCount = m_handlesCache.erase(handle);\n  if (deletedCount != 0)\n    Erase(handle);\n}\n\nvoid OverlayTree::DeleteHandleWithParents(ref_ptr<OverlayHandle> handle, int currentRank)\n{\n  currentRank--;\n  while (currentRank >= dp::OverlayRank0)\n  {\n    auto parent = FindParent(handle, currentRank);\n    if (parent != nullptr && parent->IsBound())\n      DeleteHandle(parent);\n    currentRank--;\n  }\n  DeleteHandle(handle);\n}\n\nbool OverlayTree::GetSelectedFeatureRect(ScreenBase const & screen, m2::RectD & featureRect)\n{\n  if (!m_selectedFeatureID.IsValid())\n    return false;\n\n  featureRect.MakeEmpty();\n  for (auto const & handle : m_handlesCache)\n  {\n    if (handle->IsVisible() && handle->GetOverlayID().m_featureId == m_selectedFeatureID)\n    {\n      m2::RectD rect = handle->GetPixelRect(screen, screen.isPerspective());\n      featureRect.Add(rect);\n    }\n  }\n  return true;\n}\n\nvoid OverlayTree::Select(m2::PointD const & glbPoint, TOverlayContainer & result) const\n{\n  ScreenBase const & screen = GetModelView();\n  m2::PointD const pxPoint = screen.GtoP(glbPoint);\n\n  double const kSearchRectHalfSize = 10.0;\n  m2::RectD rect(pxPoint, pxPoint);\n  rect.Inflate(kSearchRectHalfSize, kSearchRectHalfSize);\n\n  for (auto const & handle : m_handlesCache)\n  {\n    if (!handle->HasLinearFeatureShape() && rect.IsPointInside(handle->GetPivot(screen, false)))\n      result.push_back(handle);\n  }\n}\n\nvoid OverlayTree::Select(m2::RectD const & rect, TOverlayContainer & result) const\n{\n  ScreenBase screen = GetModelView();\n  ForEachInRect(rect, [&](ref_ptr<OverlayHandle> const & h)\n  {\n    if (!h->HasLinearFeatureShape() && h->IsVisible() && h->GetOverlayID().m_featureId.IsValid())\n    {\n      OverlayHandle::Rects shape;\n      h->GetPixelShape(screen, screen.isPerspective(), shape);\n      for (m2::RectF const & rShape : shape)\n      {\n        if (rShape.IsIntersect(m2::RectF(rect)))\n        {\n          result.push_back(h);\n          break;\n        }\n      }\n    }\n  });\n}\n\nvoid OverlayTree::SetDisplacementEnabled(bool enabled)\n{\n  if (m_isDisplacementEnabled == enabled)\n    return;\n  m_isDisplacementEnabled = enabled;\n  m_frameCounter = kInvalidFrame;\n}\n\nvoid OverlayTree::SetSelectedFeature(FeatureID const & featureID)\n{\n  m_selectedFeatureID = featureID;\n}\n\nOverlayTree::TDisplacementInfo const & OverlayTree::GetDisplacementInfo() const\n{\n  return m_displacementInfo;\n}\n\nvoid OverlayTree::StoreDisplacementInfo(int caseIndex, ref_ptr<OverlayHandle> displacerHandle,\n                                        ref_ptr<OverlayHandle> displacedHandle)\n{\n  ScreenBase const & modelView = GetModelView();\n  m2::RectD const pixelRect = displacerHandle->GetExtendedPixelRect(modelView);\n  if (!m_traits.GetDisplacersFreeRect().IsRectInside(pixelRect))\n    m_displacers.insert(displacerHandle);\n\n#ifdef DEBUG_OVERLAYS_OUTPUT\n    LOG(LINFO, (\"Displace (\", caseIndex, \"):\", displacerHandle->GetOverlayDebugInfo(),\n                \"->\", displacedHandle->GetOverlayDebugInfo()));\n#else\n  UNUSED_VALUE(caseIndex);\n#endif\n\n  if (!dp::DebugRectRenderer::Instance().IsEnabled())\n    return;\n  m_displacementInfo.emplace_back(displacerHandle->GetExtendedPixelRect(modelView).Center(),\n                                  displacedHandle->GetExtendedPixelRect(modelView).Center(),\n                                  dp::Color(0, 0, 255, 255));\n}\n\nvoid detail::OverlayTraits::SetVisualScale(double visualScale)\n{\n  m_visualScale = visualScale;\n}\n\nvoid detail::OverlayTraits::SetModelView(ScreenBase const & modelView)\n{\n  m_modelView = modelView;\n\n  double const extension = m_visualScale * kScreenPixelRectExtension;\n  double const doubleExtension = 2.0 * extension;\n  m_extendedScreenRect = modelView.PixelRectIn3d();\n  m_extendedScreenRect.Inflate(extension, extension);\n\n  m_displacersFreeRect = modelView.PixelRectIn3d();\n  if (m_displacersFreeRect.SizeX() > doubleExtension && m_displacersFreeRect.SizeY() > doubleExtension)\n    m_displacersFreeRect.Inflate(-extension, -extension);\n  else\n    m_displacersFreeRect.SetSizes(1e-7, 1e-7);\n}\n}  \/\/ namespace dp\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"console_user_server_client.hpp\"\n#include \"constants.hpp\"\n#include \"local_datagram_server.hpp\"\n#include \"types.hpp\"\n#include <vector>\n\nnamespace krbn {\nclass receiver final {\npublic:\n  receiver(const receiver&) = delete;\n\n  receiver(void) : exit_loop_(false) {\n    const size_t buffer_length = 32 * 1024;\n    buffer_.resize(buffer_length);\n\n    auto socket_file_path = console_user_server_client::make_console_user_server_socket_file_path(getuid());\n\n    auto path = socket_file_path.c_str();\n    unlink(path);\n    server_ = std::make_unique<local_datagram_server>(path);\n\n    chmod(path, 0600);\n\n    shell_command_execution_queue_ = dispatch_queue_create(\"console_user_server_receiver\", nullptr);\n\n    exit_loop_ = false;\n    thread_ = std::thread([this] { this->worker(); });\n  }\n\n  ~receiver(void) {\n    dispatch_sync(shell_command_execution_queue_, ^{\n      dispatch_release(shell_command_execution_queue_);\n      shell_command_execution_queue_ = nullptr;\n    });\n\n    unlink(socket_path_.c_str());\n\n    exit_loop_ = true;\n    if (thread_.joinable()) {\n      thread_.join();\n    }\n\n    server_ = nullptr;\n  }\n\nprivate:\n  void worker(void) {\n    if (!server_) {\n      return;\n    }\n\n    while (!exit_loop_) {\n      boost::system::error_code ec;\n      std::size_t n = server_->receive(boost::asio::buffer(buffer_), boost::posix_time::seconds(1), ec);\n\n      if (!ec && n > 0) {\n        switch (operation_type(buffer_[0])) {\n          case operation_type::shell_command_execution:\n            if (n != 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 shell_command = p->shell_command;\n              dispatch_async(shell_command_execution_queue_, ^{\n                system(shell_command.c_str());\n              });\n            }\n            break;\n\n          default:\n            break;\n        }\n      }\n    }\n  }\n\n  std::string socket_path_;\n  std::vector<uint8_t> buffer_;\n  std::unique_ptr<local_datagram_server> server_;\n  std::thread thread_;\n  std::atomic<bool> exit_loop_;\n\n  dispatch_queue_t shell_command_execution_queue_;\n};\n} \/\/ namespace krbn\n<commit_msg>fix shell_command_execution_queue_ handling<commit_after>#pragma once\n\n#include \"console_user_server_client.hpp\"\n#include \"constants.hpp\"\n#include \"local_datagram_server.hpp\"\n#include \"types.hpp\"\n#include <vector>\n\nnamespace krbn {\nclass receiver final {\npublic:\n  receiver(const receiver&) = delete;\n\n  receiver(void) : exit_loop_(false),\n                   shell_command_execution_queue_(nullptr) {\n    const size_t buffer_length = 32 * 1024;\n    buffer_.resize(buffer_length);\n\n    auto socket_file_path = console_user_server_client::make_console_user_server_socket_file_path(getuid());\n\n    auto path = socket_file_path.c_str();\n    unlink(path);\n    server_ = std::make_unique<local_datagram_server>(path);\n\n    chmod(path, 0600);\n\n    shell_command_execution_queue_ = dispatch_queue_create(\"console_user_server_receiver\", nullptr);\n\n    exit_loop_ = false;\n    thread_ = std::thread([this] { this->worker(); });\n\n    logger::get_logger().info(\"receiver is initialized\");\n  }\n\n  ~receiver(void) {\n    dispatch_release(shell_command_execution_queue_);\n    shell_command_execution_queue_ = nullptr;\n\n    unlink(socket_path_.c_str());\n\n    exit_loop_ = true;\n    if (thread_.joinable()) {\n      thread_.join();\n    }\n\n    server_ = nullptr;\n\n    logger::get_logger().info(\"receiver is terminated\");\n  }\n\nprivate:\n  void worker(void) {\n    if (!server_) {\n      return;\n    }\n\n    while (!exit_loop_) {\n      boost::system::error_code ec;\n      std::size_t n = server_->receive(boost::asio::buffer(buffer_), boost::posix_time::seconds(1), ec);\n\n      if (!ec && n > 0) {\n        switch (operation_type(buffer_[0])) {\n          case operation_type::shell_command_execution:\n            if (n != 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 shell_command = p->shell_command;\n              if (shell_command_execution_queue_) {\n                dispatch_async(shell_command_execution_queue_, ^{\n                  system(shell_command.c_str());\n                });\n              }\n            }\n            break;\n\n          default:\n            break;\n        }\n      }\n    }\n  }\n\n  std::string socket_path_;\n  std::vector<uint8_t> buffer_;\n  std::unique_ptr<local_datagram_server> server_;\n  std::thread thread_;\n  std::atomic<bool> exit_loop_;\n\n  dispatch_queue_t shell_command_execution_queue_;\n};\n} \/\/ namespace krbn\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _PYUNO_PYUNO_HXX_\n#define _PYUNO_PYUNO_HXX_\n\n#ifndef Py_PYTHON_H\n\n#ifdef _DEBUG\n#undef _DEBUG\n#include <Python.h>\n#define _DEBUG\n#else\n#include <Python.h>\n#endif \/\/ #ifdef _DEBUG\n#endif \/\/ #ifdef Py_PYTHON_H\n\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_SCRIPT_CANNOTCONVERTEXCEPTION_HPP_\n#include <com\/sun\/star\/script\/CannotConvertException.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_ILLEGALARGUMENTEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/IllegalArgumentException.hpp>\n#endif\n\n\/**\n   External interface of the Python UNO bridge.\n\n   This is a C++ interface, because the core UNO components\n   invocation and proxyfactory are used to implement the bridge.\n\n   This interface is somewhat private and my change in future.\n\n   A scripting framework implementation may use this interface\n   to do the necessary conversions.\n*\/\n\n#ifdef WIN32\n#define PY_DLLEXPORT __declspec(dllexport)\n#else\n#define PY_DLLEXPORT\n#endif\n\n\/** function called by the python runtime to initialize the\n    pyuno module.\n\n    preconditions: python has been initialized before and\n                   the global interpreter lock is held\n*\/\nextern \"C\" PY_DLLEXPORT void SAL_CALL initpyuno();\n\n\nnamespace pyuno\n{\n\n\/** Helper class for keeping references to python objects.\n    BEWARE: Look up every python function you use to check\n    wether you get an acquired or not acquired object pointer\n    (python terminus for a not acquired object pointer\n    is 'borrowed reference'). Use in the acquired pointer cases the\n    PyRef( pointer, SAL_NO_ACQUIRE) ctor.\n\n    precondition: python has been initialized before and\n    the global interpreter lock is held\n\n*\/\nclass PyRef\n{\n    PyObject *m;\npublic:\n    PyRef () : m(0) {}\n    PyRef( PyObject * p ) : m( p ) { Py_XINCREF( m ); }\n\n    PyRef( PyObject * p, __sal_NoAcquire ) : m( p ) {}\n\n    PyRef( const PyRef &r ) : m( r.get() ) { Py_XINCREF( m ); }\n\n    ~PyRef() { Py_XDECREF( m ); }\n\n    PyObject *get() const { return m; }\n\n    PyObject * getAcquired() const\n    {\n        Py_XINCREF( const_cast< PyObject*> (m) );\n        return m;\n    }\n\n    PyRef & operator = (  const PyRef & r )\n    {\n        PyObject *tmp = m;\n        m = r.getAcquired();\n        Py_XDECREF( tmp );\n        return *this;\n    }\n\n    bool operator == (  const PyRef & r ) const\n    {\n        return r.get() == m;\n    }\n\n    \/** clears the reference without decreasing the reference count\n        only seldomly needed ! *\/\n    void scratch()\n    {\n        m = 0;\n    }\n\n    \/** clears the reference decreasing the refcount of the holded object.\n     *\/\n    void clear()\n    {\n        Py_XDECREF( m );\n        m = 0;\n    }\n\n    \/** returns 1 when the reference points to a python object python object,\n        otherwise 0.\n    *\/\n    sal_Bool is() const\n    {\n        return m != 0;\n    }\n\n    struct Hash\n    {\n        int operator () ( const PyRef &r) const { return (int) r.get(); }\n    };\n};\n\nstruct stRuntimeImpl;\ntypedef struct stRuntimeImpl RuntimeImpl;\n\nenum ConversionMode { ACCEPT_UNO_ANY, REJECT_UNO_ANY };\n\n\n\/** The pyuno::Runtime class keeps the internal state of the python UNO bridge\n    for the currently in use python interpreter.\n\n    You may keep a Runtime instance, use it from a different thread, etc. But you must\n    make sure to fulfill all preconditions mentioned for the specific methods.\n*\/\n\nclass PY_DLLEXPORT Runtime\n{\n    RuntimeImpl *impl;\npublic:\n    ~Runtime( );\n\n    \/**\n        preconditions: python has been initialized before,\n        the global interpreter lock is held and pyuno\n        has been initialized for the currently used interpreter.\n\n        Note: This method exists for efficiency reasons to save\n        lookup costs for any2PyObject and pyObject2Any\n\n        @throw RuntimeException in case the runtime has not been\n               initialized before\n     *\/\n    Runtime() throw( com::sun::star::uno::RuntimeException );\n\n    Runtime( const Runtime & );\n    Runtime & operator = ( const Runtime & );\n\n    \/** Initializes the python-UNO bridge. May be called only once per python interpreter.\n\n        @param ctx the component context is used to instantiate bridge services needed\n        for bridging such as invocation, typeconverter, invocationadapterfactory, etc.\n\n        preconditions: python has been initialized before and\n        the global interpreter lock is held and pyuno is not\n        initialized (see isInitialized() ).\n\n        @throw RuntimeException in case the thread is not attached or the runtime\n                                has not been initialized.\n    *\/\n    static void SAL_CALL initialize(\n        const com::sun::star::uno::Reference< com::sun::star::uno::XComponentContext > & ctx )\n        throw ( com::sun::star::uno::RuntimeException );\n\n\n    \/** Checks, whether the uno runtime is already initialized in the current python interpreter.\n     *\/\n    static bool SAL_CALL isInitialized() throw (com::sun::star::uno::RuntimeException);\n\n\n    \/** disposes the UNO bridge in this interpreter. All existing stubs\/proxies\n        become non-functional, using these proxies\/stubs leads to runtime errors.\n\n        preconditions: python has been initialized before and\n        the global interpreter lock is held and pyuno was\n        initialized before for the currently in use interpreter.\n    *\/\n    static void SAL_CALL finalize() throw(com::sun::star::uno::RuntimeException );\n\n    \/** converts something contained in an UNO Any to a Python object\n\n        preconditions: python has been initialized before,\n        the global interpreter lock is held and pyuno::Runtime\n        has been initialized.\n    *\/\n    PyRef any2PyObject (const com::sun::star::uno::Any &source ) const\n        throw ( com::sun::star::script::CannotConvertException,\n                com::sun::star::lang::IllegalArgumentException,\n                com::sun::star::uno::RuntimeException );\n\n    \/** converts a Python object to a UNO any\n\n        preconditions: python has been initialized before,\n        the global interpreter lock is held and pyuno\n        has been initialized\n    *\/\n    com::sun::star::uno::Any pyObject2Any (\n        const PyRef & source , enum ConversionMode mode = REJECT_UNO_ANY ) const\n        throw ( com::sun::star::uno::RuntimeException);\n\n\n    \/** Returns the internal handle. Should only be used by the module implementation\n     *\/\n    RuntimeImpl *getImpl() const { return impl; }\n};\n\n\n\/** helper class for attaching the current thread to the python runtime.\n\n    Attaching is done creating a new threadstate for the given interpreter\n    and acquiring the global interpreter lock.\n\n    Usage:\n\n    ... don't use python here\n    {\n        PyThreadAttach guard( PyInterpreterState_Head() );\n        {\n            ... do whatever python code you want\n            {\n               PyThreadDetach antiguard;\n               ... don't use python here\n            }\n            ... do whatever python code you want\n        }\n    }\n    ... don't use python here\n\n    Note: The additional scope brackets after the PyThreadAttach are needed,\n          e.g. when you would leave them away, dtors of potential pyrefs\n          may be called after the thread has detached again.\n *\/\nclass PY_DLLEXPORT PyThreadAttach\n{\n    PyThreadState *tstate;\n    PyThreadAttach ( const PyThreadAttach & ); \/\/ not implemented\n    PyThreadAttach & operator = ( const PyThreadAttach & );\npublic:\n\n    \/** Creates a new python threadstate and acquires the global interpreter lock.\n        precondition: The current thread MUST NOT hold the global interpreter lock.\n        postcondition: The global interpreter lock is acquired\n\n        @raises com::sun::star::uno::RuntimeException\n             in case no pythread state could be created\n     *\/\n    PyThreadAttach( PyInterpreterState *interp) throw ( com::sun::star::uno::RuntimeException );\n\n\n    \/** Releases the global interpreter lock and destroys the thread state.\n     *\/\n    ~PyThreadAttach();\n};\n\n\/** helper class for detaching the current thread from the python runtime\n    to do some blocking, non-python related operation.\n\n    @see PyThreadAttach\n*\/\nclass PY_DLLEXPORT PyThreadDetach\n{\n    PyThreadState *tstate;\n    PyThreadDetach ( const PyThreadDetach & ); \/\/ not implemented\n    PyThreadDetach & operator = ( const PyThreadDetach & ); \/\/ not implemented\n\npublic:\n    \/** Releases the global interpreter lock.\n\n       precondition: The current thread MUST hold the global interpreter lock.\n       postcondition: The current thread does not hold the global interpreter lock anymore.\n    *\/\n    PyThreadDetach() throw ( com::sun::star::uno::RuntimeException );\n    \/** Acquires the global interpreter lock again\n    *\/\n    ~PyThreadDetach();\n};\n\n}\n#endif\n<commit_msg>INTEGRATION: CWS geordi2q11 (1.2.30); FILE MERGED 2003\/12\/16 14:04:26 hr 1.2.30.1: #111934#: join CWS ooo111fix1<commit_after>#ifndef _PYUNO_PYUNO_HXX_\n#define _PYUNO_PYUNO_HXX_\n\n#ifndef Py_PYTHON_H\n\n#ifdef _DEBUG\n#undef _DEBUG\n#include <Python.h>\n#define _DEBUG\n#else\n#include <Python.h>\n#endif \/\/ #ifdef _DEBUG\n#endif \/\/ #ifdef Py_PYTHON_H\n\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_SCRIPT_CANNOTCONVERTEXCEPTION_HPP_\n#include <com\/sun\/star\/script\/CannotConvertException.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_ILLEGALARGUMENTEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/IllegalArgumentException.hpp>\n#endif\n\n\/**\n   External interface of the Python UNO bridge.\n\n   This is a C++ interface, because the core UNO components\n   invocation and proxyfactory are used to implement the bridge.\n\n   This interface is somewhat private and my change in future.\n\n   A scripting framework implementation may use this interface\n   to do the necessary conversions.\n*\/\n\n#ifdef WIN32\n#define PY_DLLEXPORT __declspec(dllexport)\n#else\n#define PY_DLLEXPORT\n#endif\n\n\/** function called by the python runtime to initialize the\n    pyuno module.\n\n    preconditions: python has been initialized before and\n                   the global interpreter lock is held\n*\/\nextern \"C\" PY_DLLEXPORT void SAL_CALL initpyuno();\n\n\nnamespace pyuno\n{\n\n\/** Helper class for keeping references to python objects.\n    BEWARE: Look up every python function you use to check\n    wether you get an acquired or not acquired object pointer\n    (python terminus for a not acquired object pointer\n    is 'borrowed reference'). Use in the acquired pointer cases the\n    PyRef( pointer, SAL_NO_ACQUIRE) ctor.\n\n    precondition: python has been initialized before and\n    the global interpreter lock is held\n\n*\/\nclass PyRef\n{\n    PyObject *m;\npublic:\n    PyRef () : m(0) {}\n    PyRef( PyObject * p ) : m( p ) { Py_XINCREF( m ); }\n\n    PyRef( PyObject * p, __sal_NoAcquire ) : m( p ) {}\n\n    PyRef( const PyRef &r ) : m( r.get() ) { Py_XINCREF( m ); }\n\n    ~PyRef() { Py_XDECREF( m ); }\n\n    PyObject *get() const { return m; }\n\n    PyObject * getAcquired() const\n    {\n        Py_XINCREF( const_cast< PyObject*> (m) );\n        return m;\n    }\n\n    PyRef & operator = (  const PyRef & r )\n    {\n        PyObject *tmp = m;\n        m = r.getAcquired();\n        Py_XDECREF( tmp );\n        return *this;\n    }\n\n    bool operator == (  const PyRef & r ) const\n    {\n        return r.get() == m;\n    }\n\n    \/** clears the reference without decreasing the reference count\n        only seldomly needed ! *\/\n    void scratch()\n    {\n        m = 0;\n    }\n\n    \/** clears the reference decreasing the refcount of the holded object.\n     *\/\n    void clear()\n    {\n        Py_XDECREF( m );\n        m = 0;\n    }\n\n    \/** returns 1 when the reference points to a python object python object,\n        otherwise 0.\n    *\/\n    sal_Bool is() const\n    {\n        return m != 0;\n    }\n\n    struct Hash\n    {\n        int operator () ( const PyRef &r) const { return (int) r.get(); }\n    };\n};\n\nstruct stRuntimeImpl;\ntypedef struct stRuntimeImpl RuntimeImpl;\n\nenum ConversionMode { ACCEPT_UNO_ANY, REJECT_UNO_ANY };\n\n\n\/** The pyuno::Runtime class keeps the internal state of the python UNO bridge\n    for the currently in use python interpreter.\n\n    You may keep a Runtime instance, use it from a different thread, etc. But you must\n    make sure to fulfill all preconditions mentioned for the specific methods.\n*\/\n\nclass PY_DLLEXPORT Runtime\n{\n    RuntimeImpl *impl;\npublic:\n    ~Runtime( );\n\n    \/**\n        preconditions: python has been initialized before,\n        the global interpreter lock is held and pyuno\n        has been initialized for the currently used interpreter.\n\n        Note: This method exists for efficiency reasons to save\n        lookup costs for any2PyObject and pyObject2Any\n\n        @throw RuntimeException in case the runtime has not been\n               initialized before\n     *\/\n    Runtime() throw( com::sun::star::uno::RuntimeException );\n\n    Runtime( const Runtime & );\n    Runtime & operator = ( const Runtime & );\n\n    \/** Initializes the python-UNO bridge. May be called only once per python interpreter.\n\n        @param ctx the component context is used to instantiate bridge services needed\n        for bridging such as invocation, typeconverter, invocationadapterfactory, etc.\n\n        preconditions: python has been initialized before and\n        the global interpreter lock is held and pyuno is not\n        initialized (see isInitialized() ).\n\n        @throw RuntimeException in case the thread is not attached or the runtime\n                                has not been initialized.\n    *\/\n    static void SAL_CALL initialize(\n        const com::sun::star::uno::Reference< com::sun::star::uno::XComponentContext > & ctx )\n        throw ( com::sun::star::uno::RuntimeException );\n\n\n    \/** Checks, whether the uno runtime is already initialized in the current python interpreter.\n     *\/\n    static bool SAL_CALL isInitialized() throw (com::sun::star::uno::RuntimeException);\n\n\n    \/** disposes the UNO bridge in this interpreter. All existing stubs\/proxies\n        become non-functional, using these proxies\/stubs leads to runtime errors.\n\n        preconditions: python has been initialized before and\n        the global interpreter lock is held and pyuno was\n        initialized before for the currently in use interpreter.\n    *\/\n    static void SAL_CALL finalize() throw(com::sun::star::uno::RuntimeException );\n\n    \/** converts something contained in an UNO Any to a Python object\n\n        preconditions: python has been initialized before,\n        the global interpreter lock is held and pyuno::Runtime\n        has been initialized.\n    *\/\n    PyRef any2PyObject (const com::sun::star::uno::Any &source ) const\n        throw ( com::sun::star::script::CannotConvertException,\n                com::sun::star::lang::IllegalArgumentException,\n                com::sun::star::uno::RuntimeException );\n\n    \/** converts a Python object to a UNO any\n\n        preconditions: python has been initialized before,\n        the global interpreter lock is held and pyuno\n        has been initialized\n    *\/\n    com::sun::star::uno::Any pyObject2Any (\n        const PyRef & source , enum ConversionMode mode = REJECT_UNO_ANY ) const\n        throw ( com::sun::star::uno::RuntimeException);\n\n    \/** extracts a proper uno exception from a given python exception\n     *\/\n    com::sun::star::uno::Any extractUnoException(\n        const PyRef & excType, const PyRef & excValue, const PyRef & excTraceback) const;\n\n    \/** Returns the internal handle. Should only be used by the module implementation\n     *\/\n    RuntimeImpl *getImpl() const { return impl; }\n};\n\n\n\/** helper class for attaching the current thread to the python runtime.\n\n    Attaching is done creating a new threadstate for the given interpreter\n    and acquiring the global interpreter lock.\n\n    Usage:\n\n    ... don't use python here\n    {\n        PyThreadAttach guard( PyInterpreterState_Head() );\n        {\n            ... do whatever python code you want\n            {\n               PyThreadDetach antiguard;\n               ... don't use python here\n            }\n            ... do whatever python code you want\n        }\n    }\n    ... don't use python here\n\n    Note: The additional scope brackets after the PyThreadAttach are needed,\n          e.g. when you would leave them away, dtors of potential pyrefs\n          may be called after the thread has detached again.\n *\/\nclass PY_DLLEXPORT PyThreadAttach\n{\n    PyThreadState *tstate;\n    PyThreadAttach ( const PyThreadAttach & ); \/\/ not implemented\n    PyThreadAttach & operator = ( const PyThreadAttach & );\npublic:\n\n    \/** Creates a new python threadstate and acquires the global interpreter lock.\n        precondition: The current thread MUST NOT hold the global interpreter lock.\n        postcondition: The global interpreter lock is acquired\n\n        @raises com::sun::star::uno::RuntimeException\n             in case no pythread state could be created\n     *\/\n    PyThreadAttach( PyInterpreterState *interp) throw ( com::sun::star::uno::RuntimeException );\n\n\n    \/** Releases the global interpreter lock and destroys the thread state.\n     *\/\n    ~PyThreadAttach();\n};\n\n\/** helper class for detaching the current thread from the python runtime\n    to do some blocking, non-python related operation.\n\n    @see PyThreadAttach\n*\/\nclass PY_DLLEXPORT PyThreadDetach\n{\n    PyThreadState *tstate;\n    PyThreadDetach ( const PyThreadDetach & ); \/\/ not implemented\n    PyThreadDetach & operator = ( const PyThreadDetach & ); \/\/ not implemented\n\npublic:\n    \/** Releases the global interpreter lock.\n\n       precondition: The current thread MUST hold the global interpreter lock.\n       postcondition: The current thread does not hold the global interpreter lock anymore.\n    *\/\n    PyThreadDetach() throw ( com::sun::star::uno::RuntimeException );\n    \/** Acquires the global interpreter lock again\n    *\/\n    ~PyThreadDetach();\n};\n\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <IOKit\/IOLib.h>\n\n#include \"Config.hpp\"\n#include \"IOLogWrapper.hpp\"\n#include \"PointingRelativeToKey.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n  namespace RemapFunc {\n    PointingRelativeToKey::PointingRelativeToKey(void) :\n      current_keytokey_(NULL)\n    {\n      keyrepeat_ic_.begin();\n    }\n\n    PointingRelativeToKey::~PointingRelativeToKey(void)\n    {}\n\n    void\n    PointingRelativeToKey::add(unsigned int datatype, unsigned int newval)\n    {\n      switch (datatype) {\n        case BRIDGE_DATATYPE_POINTINGRELATIVE:\n        {\n          PointingRelative val(newval);\n          if (val == PointingRelative::UP)    { current_keytokey_ = &(keytokey_[KEYTOKEY_UP]);    }\n          if (val == PointingRelative::DOWN)  { current_keytokey_ = &(keytokey_[KEYTOKEY_DOWN]);  }\n          if (val == PointingRelative::LEFT)  { current_keytokey_ = &(keytokey_[KEYTOKEY_LEFT]);  }\n          if (val == PointingRelative::RIGHT) { current_keytokey_ = &(keytokey_[KEYTOKEY_RIGHT]); }\n          break;\n        }\n\n        case BRIDGE_DATATYPE_KEYCODE:\n        case BRIDGE_DATATYPE_CONSUMERKEYCODE:\n        case BRIDGE_DATATYPE_POINTINGBUTTON:\n        case BRIDGE_DATATYPE_OPTION:\n        {\n          if (! current_keytokey_) {\n            IOLOG_ERROR(\"Invalid PointingRelativeToKey::add\\n\");\n          } else {\n            if (current_keytokey_->toKeysSize() == 0) {\n              current_keytokey_->add(KeyCode::VK_PSEUDO_KEY);\n              current_keytokey_->add(fromFlags_);\n            }\n            current_keytokey_->add(datatype, newval);\n          }\n\n          break;\n        }\n\n        case BRIDGE_DATATYPE_FLAGS:\n        {\n          if (! current_keytokey_) {\n            fromFlags_ = Flags(newval);\n          } else {\n            current_keytokey_->add(datatype, newval);\n          }\n          break;\n        }\n\n        default:\n          IOLOG_ERROR(\"PointingRelativeToKey::add invalid datatype:%d\\n\", datatype);\n          break;\n      }\n    }\n\n    bool\n    PointingRelativeToKey::remap(RemapParams& remapParams)\n    {\n      Params_RelativePointerEventCallback* params = remapParams.paramsUnion.get_Params_RelativePointerEventCallback();\n      if (! params) return false;\n\n      \/\/ ------------------------------------------------------------\n      if (remapParams.isremapped) return false;\n      if (! FlagStatus::makeFlags().isOn(fromFlags_)) return false;\n      \/\/ skip button press\/release events.\n      if (params->ex_button != PointingButton::NONE) return false;\n\n      remapParams.isremapped = true;\n\n      \/\/ ------------------------------------------------------------\n      uint32_t detection_interval = static_cast<uint32_t>(Config::get_essential_config(BRIDGE_ESSENTIAL_CONFIG_INDEX_parameter_pointingrelativetokey_detection_interval));\n      if (keyrepeat_ic_.getmillisec() > detection_interval) {\n        deltaBuffer_dx_.push(params->dx);\n        deltaBuffer_dy_.push(params->dy);\n      }\n\n      if (deltaBuffer_dx_.isFull() || deltaBuffer_dy_.isFull()) {\n        int dx = deltaBuffer_dx_.sum();\n        int dy = deltaBuffer_dy_.sum();\n\n        size_t keytokey_index = KEYTOKEY__END__;\n        PointingRelative pr = PointingRelative::getPointingRelativeFromDelta(dx, dy);\n        if (pr == PointingRelative::UP)    { keytokey_index = KEYTOKEY_UP;    }\n        if (pr == PointingRelative::DOWN)  { keytokey_index = KEYTOKEY_DOWN;  }\n        if (pr == PointingRelative::LEFT)  { keytokey_index = KEYTOKEY_LEFT;  }\n        if (pr == PointingRelative::RIGHT) { keytokey_index = KEYTOKEY_RIGHT; }\n\n        if (keytokey_index != KEYTOKEY__END__) {\n          keytokey_[keytokey_index].call_remap_with_VK_PSEUDO_KEY(EventType::DOWN);\n          keytokey_[keytokey_index].call_remap_with_VK_PSEUDO_KEY(EventType::UP);\n          \/\/ clear temporary flags.\n          FlagStatus::set();\n\n          deltaBuffer_dx_.clear();\n          deltaBuffer_dy_.clear();\n          keyrepeat_ic_.begin();\n        }\n      }\n\n      return true;\n    }\n  }\n}\n<commit_msg>Call EventWatcher::on at PointingRelativeToKey<commit_after>#include <IOKit\/IOLib.h>\n\n#include \"Config.hpp\"\n#include \"EventWatcher.hpp\"\n#include \"IOLogWrapper.hpp\"\n#include \"PointingRelativeToKey.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n  namespace RemapFunc {\n    PointingRelativeToKey::PointingRelativeToKey(void) :\n      current_keytokey_(NULL)\n    {\n      keyrepeat_ic_.begin();\n    }\n\n    PointingRelativeToKey::~PointingRelativeToKey(void)\n    {}\n\n    void\n    PointingRelativeToKey::add(unsigned int datatype, unsigned int newval)\n    {\n      switch (datatype) {\n        case BRIDGE_DATATYPE_POINTINGRELATIVE:\n        {\n          PointingRelative val(newval);\n          if (val == PointingRelative::UP)    { current_keytokey_ = &(keytokey_[KEYTOKEY_UP]);    }\n          if (val == PointingRelative::DOWN)  { current_keytokey_ = &(keytokey_[KEYTOKEY_DOWN]);  }\n          if (val == PointingRelative::LEFT)  { current_keytokey_ = &(keytokey_[KEYTOKEY_LEFT]);  }\n          if (val == PointingRelative::RIGHT) { current_keytokey_ = &(keytokey_[KEYTOKEY_RIGHT]); }\n          break;\n        }\n\n        case BRIDGE_DATATYPE_KEYCODE:\n        case BRIDGE_DATATYPE_CONSUMERKEYCODE:\n        case BRIDGE_DATATYPE_POINTINGBUTTON:\n        case BRIDGE_DATATYPE_OPTION:\n        {\n          if (! current_keytokey_) {\n            IOLOG_ERROR(\"Invalid PointingRelativeToKey::add\\n\");\n          } else {\n            if (current_keytokey_->toKeysSize() == 0) {\n              current_keytokey_->add(KeyCode::VK_PSEUDO_KEY);\n              current_keytokey_->add(fromFlags_);\n            }\n            current_keytokey_->add(datatype, newval);\n          }\n\n          break;\n        }\n\n        case BRIDGE_DATATYPE_FLAGS:\n        {\n          if (! current_keytokey_) {\n            fromFlags_ = Flags(newval);\n          } else {\n            current_keytokey_->add(datatype, newval);\n          }\n          break;\n        }\n\n        default:\n          IOLOG_ERROR(\"PointingRelativeToKey::add invalid datatype:%d\\n\", datatype);\n          break;\n      }\n    }\n\n    bool\n    PointingRelativeToKey::remap(RemapParams& remapParams)\n    {\n      Params_RelativePointerEventCallback* params = remapParams.paramsUnion.get_Params_RelativePointerEventCallback();\n      if (! params) return false;\n\n      \/\/ ------------------------------------------------------------\n      if (remapParams.isremapped) return false;\n      if (! FlagStatus::makeFlags().isOn(fromFlags_)) return false;\n      \/\/ skip button press\/release events.\n      if (params->ex_button != PointingButton::NONE) return false;\n\n      remapParams.isremapped = true;\n\n      \/\/ ------------------------------------------------------------\n      uint32_t detection_interval = static_cast<uint32_t>(Config::get_essential_config(BRIDGE_ESSENTIAL_CONFIG_INDEX_parameter_pointingrelativetokey_detection_interval));\n      if (keyrepeat_ic_.getmillisec() > detection_interval) {\n        deltaBuffer_dx_.push(params->dx);\n        deltaBuffer_dy_.push(params->dy);\n      }\n\n      if (deltaBuffer_dx_.isFull() || deltaBuffer_dy_.isFull()) {\n        int dx = deltaBuffer_dx_.sum();\n        int dy = deltaBuffer_dy_.sum();\n\n        size_t keytokey_index = KEYTOKEY__END__;\n        PointingRelative pr = PointingRelative::getPointingRelativeFromDelta(dx, dy);\n        if (pr == PointingRelative::UP)    { keytokey_index = KEYTOKEY_UP;    }\n        if (pr == PointingRelative::DOWN)  { keytokey_index = KEYTOKEY_DOWN;  }\n        if (pr == PointingRelative::LEFT)  { keytokey_index = KEYTOKEY_LEFT;  }\n        if (pr == PointingRelative::RIGHT) { keytokey_index = KEYTOKEY_RIGHT; }\n\n        if (keytokey_index != KEYTOKEY__END__) {\n          keytokey_[keytokey_index].call_remap_with_VK_PSEUDO_KEY(EventType::DOWN);\n          keytokey_[keytokey_index].call_remap_with_VK_PSEUDO_KEY(EventType::UP);\n          \/\/ clear temporary flags.\n          FlagStatus::set();\n\n          \/\/ We need to call EventWatcher::on here.\n          \/\/ See the comments in EventInputQueue::fire_timer_callback.\n          EventWatcher::on();\n\n          deltaBuffer_dx_.clear();\n          deltaBuffer_dy_.clear();\n          keyrepeat_ic_.begin();\n        }\n      }\n\n      return true;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"VLCThumbnailer.h\"\n\n#include <cstring>\n#include <jpeglib.h>\n#include <setjmp.h>\n\n#include \"IFile.h\"\n#include \"logging\/Logger.h\"\n\nVLCThumbnailer::VLCThumbnailer(const VLC::Instance &vlc)\n    : m_instance( vlc )\n    , m_snapshotRequired( false )\n    , m_height( 0 )\n{\n}\n\nbool VLCThumbnailer::initialize(IMetadataServiceCb *callback, IMediaLibrary *ml)\n{\n    m_cb = callback;\n    m_ml = ml;\n    return true;\n}\n\nunsigned int VLCThumbnailer::priority() const\n{\n    \/\/ This needs to be lower than the VLCMetadataService, since we want to know the file type.\n    return 50;\n}\n\nbool VLCThumbnailer::run( FilePtr file, void *data )\n{\n    if ( file->type() == IFile::Type::UnknownType )\n    {\n        \/\/ If we don't know the file type yet, it actually looks more like a bug\n        \/\/ since this should run after file type deduction, and not run in case\n        \/\/ that step fails.\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n    else if ( file->type() != IFile::Type::VideoType )\n    {\n        \/\/ There's no point in generating a thumbnail for a non-video file.\n        m_cb->done( file, StatusSuccess, data );\n        return true;\n    }\n\n    VLC::Media media( m_instance, file->mrl(), VLC::Media::FromPath );\n    media.addOption( \":no-audio\" );\n    VLC::MediaPlayer mp( media );\n\n    setupVout( mp );\n\n    if ( startPlayback( file, mp, data ) == false )\n        return false;\n\n    \/\/ Seek ahead to have a significant preview\n    if ( seekAhead( file, mp, data ) == false )\n        return false;\n\n    if ( takeSnapshot( file, mp, data ) == false )\n        return false;\n    return true;\n}\n\nbool VLCThumbnailer::startPlayback( FilePtr file, VLC::MediaPlayer &mp, void* data )\n{\n    bool failed = true;\n\n    std::unique_lock<std::mutex> lock( m_mutex );\n\n    mp.eventManager().onPlaying([this, &failed]() {\n        std::unique_lock<std::mutex> lock( m_mutex );\n        failed = false;\n        m_cond.notify_all();\n    });\n    mp.eventManager().onEncounteredError([this]() {\n        std::unique_lock<std::mutex> lock( m_mutex );\n        m_cond.notify_all();\n    });\n    mp.play();\n    bool success = m_cond.wait_for( lock, std::chrono::seconds( 3 ), [&mp]() {\n        return mp.state() == libvlc_Playing || mp.state() == libvlc_Error;\n    });\n    if ( success == false || failed == true )\n    {\n        \/\/ In case of timeout or error, don't go any further\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n    return true;\n}\n\nbool VLCThumbnailer::seekAhead( FilePtr file, VLC::MediaPlayer& mp, void* data )\n{\n    std::unique_lock<std::mutex> lock( m_mutex );\n    float pos = .0f;\n    auto event = mp.eventManager().onPositionChanged([this, &pos](float p) {\n        std::unique_lock<std::mutex> lock( m_mutex );\n        pos = p;\n        m_cond.notify_all();\n    });\n    mp.setPosition( .4f );\n    bool success = m_cond.wait_for( lock, std::chrono::seconds( 3 ), [&pos]() {\n        return pos >= .1f;\n    });\n    \/\/ Since we're locking a mutex for each position changed, let's unregister ASAP\n    event->unregister();\n    if ( success == false )\n    {\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n    return true;\n}\n\nvoid VLCThumbnailer::setupVout( VLC::MediaPlayer& mp )\n{\n    mp.setVideoFormatCallbacks(\n        \/\/ Setup\n        [this, &mp](char* chroma, unsigned int* width, unsigned int *height, unsigned int *pitches, unsigned int *lines) {\n            strcpy( chroma, \"RV24\" );\n\n            const float inputAR = (float)*width \/ *height;\n\n            *width = Width;\n            auto prevHeight = m_height;\n            m_height = (float)Width \/ inputAR + 1;\n            \/\/ If our buffer isn't enough anymore, reallocate a new one.\n            if ( m_height > prevHeight )\n                m_buff.reset( new uint8_t[Width * m_height * Bpp] );\n            *height = m_height;\n            *pitches = Width * Bpp;\n            *lines = m_height;\n            return 1;\n        },\n        \/\/ Cleanup\n        nullptr);\n    mp.setVideoCallbacks(\n        \/\/ Lock\n        [this](void** pp_buff) {\n            *pp_buff = m_buff.get();\n            return nullptr;\n        },\n        \/\/unlock\n        [this](void*, void*const*) {\n            std::unique_lock<std::mutex> lock(m_mutex);\n            if ( m_snapshotRequired == true )\n            {\n                m_snapshotRequired = false;\n                m_cond.notify_all();\n            }\n        }\n        ,\n        \/\/display\n        nullptr\n    );\n}\n\nbool VLCThumbnailer::takeSnapshot(FilePtr file, VLC::MediaPlayer &mp, void *data)\n{\n    std::unique_ptr<uint8_t[]> buff;\n    \/\/ lock, signal that we want a snapshot, and wait.\n    {\n        std::unique_lock<std::mutex> lock( m_mutex );\n        m_snapshotRequired = true;\n        bool success = m_cond.wait_for( lock, std::chrono::seconds( 3 ), [this]() {\n            \/\/ Keep waiting if the vmem thread hasn't restored m_snapshotRequired to false\n            return m_snapshotRequired == true;\n        });\n        if ( success == false )\n        {\n            m_cb->done( file, StatusError, data );\n            return false;\n        }\n        \/\/ Prevent the vmem from screwing our snapshot over.\n        buff = std::move( m_buff );\n        \/\/ set a new buffer for next snapshot, and to avoid crashing while we stop the media player\n        m_buff.reset( new uint8_t[Width * m_height * Bpp] );\n    }\n    mp.stop();\n    return compress( buff.get(), file, data );\n}\n\n#ifdef WITH_JPEG\n\nstruct jpegError : public jpeg_error_mgr\n{\n    jmp_buf buff;\n    char message[JMSG_LENGTH_MAX];\n\n    static void jpegErrorHandler(j_common_ptr common)\n    {\n        auto error = reinterpret_cast<jpegError*>(common->err);\n        (*error->format_message)( common, error->message );\n        longjmp(error->buff, 1);\n    }\n};\n\n#endif\n\nbool VLCThumbnailer::compress(uint8_t* buff, FilePtr file, void *data)\n{\n    auto path = m_ml->snapshotPath();\n    path += \"\/\";\n    path += std::to_string( file->id() ) + \".jpg\";\n\n    \/\/FIXME: Abstract this away, though libjpeg requires a FILE*...\n    auto fOut = fopen(path.c_str(), \"wb\");\n    \/\/ ensure we always close the file.\n    auto fOutPtr = std::unique_ptr<FILE, int(*)(FILE*)>( fOut, &fclose );\n    if ( fOut == nullptr )\n    {\n        LOG_ERROR(\"Failed to open snapshot file \", path);\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n\n#ifdef WITH_JPEG\n    jpeg_compress_struct compInfo;\n    JSAMPROW row_pointer[1];\n\n    \/\/libjpeg's default error handling is to call exit(), which would\n    \/\/be slightly problematic...\n    jpegError err;\n    compInfo.err = jpeg_std_error(&err);\n    err.error_exit = jpegError::jpegErrorHandler;\n\n    if ( setjmp( err.buff ) )\n    {\n        LOG_ERROR(\"JPEG failure: \", err.message);\n        jpeg_destroy_compress(&compInfo);\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n\n    jpeg_create_compress(&compInfo);\n    jpeg_stdio_dest(&compInfo, fOut);\n\n    compInfo.image_width = Width;\n    compInfo.image_height = m_height;\n    compInfo.input_components = Bpp;\n#if JPEG_LIB_VERSION <= 80\n    compInfo.in_color_space = JCS_EXT_BGRX;\n#else\n    compInfo.in_color_space = JCS_RGB;\n#endif\n    jpeg_set_defaults( &compInfo );\n    jpeg_set_quality( &compInfo, 85, TRUE );\n\n    jpeg_start_compress( &compInfo, TRUE );\n\n    auto stride = compInfo.image_width * Bpp;\n\n    while (compInfo.next_scanline < compInfo.image_height) {\n      row_pointer[0] = &buff[compInfo.next_scanline * stride];\n      jpeg_write_scanlines(&compInfo, row_pointer, 1);\n    }\n    jpeg_finish_compress(&compInfo);\n    jpeg_destroy_compress(&compInfo);\n#else\n#error FIXME\n#endif\n\n    m_cb->done( file, StatusSuccess, data );\n    file->setSnapshot( path );\n    return true;\n}\n<commit_msg>Update the file before signaling it as updated<commit_after>#include \"VLCThumbnailer.h\"\n\n#include <cstring>\n#include <jpeglib.h>\n#include <setjmp.h>\n\n#include \"IFile.h\"\n#include \"logging\/Logger.h\"\n\nVLCThumbnailer::VLCThumbnailer(const VLC::Instance &vlc)\n    : m_instance( vlc )\n    , m_snapshotRequired( false )\n    , m_height( 0 )\n{\n}\n\nbool VLCThumbnailer::initialize(IMetadataServiceCb *callback, IMediaLibrary *ml)\n{\n    m_cb = callback;\n    m_ml = ml;\n    return true;\n}\n\nunsigned int VLCThumbnailer::priority() const\n{\n    \/\/ This needs to be lower than the VLCMetadataService, since we want to know the file type.\n    return 50;\n}\n\nbool VLCThumbnailer::run( FilePtr file, void *data )\n{\n    if ( file->type() == IFile::Type::UnknownType )\n    {\n        \/\/ If we don't know the file type yet, it actually looks more like a bug\n        \/\/ since this should run after file type deduction, and not run in case\n        \/\/ that step fails.\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n    else if ( file->type() != IFile::Type::VideoType )\n    {\n        \/\/ There's no point in generating a thumbnail for a non-video file.\n        m_cb->done( file, StatusSuccess, data );\n        return true;\n    }\n\n    VLC::Media media( m_instance, file->mrl(), VLC::Media::FromPath );\n    media.addOption( \":no-audio\" );\n    VLC::MediaPlayer mp( media );\n\n    setupVout( mp );\n\n    if ( startPlayback( file, mp, data ) == false )\n        return false;\n\n    \/\/ Seek ahead to have a significant preview\n    if ( seekAhead( file, mp, data ) == false )\n        return false;\n\n    if ( takeSnapshot( file, mp, data ) == false )\n        return false;\n    return true;\n}\n\nbool VLCThumbnailer::startPlayback( FilePtr file, VLC::MediaPlayer &mp, void* data )\n{\n    bool failed = true;\n\n    std::unique_lock<std::mutex> lock( m_mutex );\n\n    mp.eventManager().onPlaying([this, &failed]() {\n        std::unique_lock<std::mutex> lock( m_mutex );\n        failed = false;\n        m_cond.notify_all();\n    });\n    mp.eventManager().onEncounteredError([this]() {\n        std::unique_lock<std::mutex> lock( m_mutex );\n        m_cond.notify_all();\n    });\n    mp.play();\n    bool success = m_cond.wait_for( lock, std::chrono::seconds( 3 ), [&mp]() {\n        return mp.state() == libvlc_Playing || mp.state() == libvlc_Error;\n    });\n    if ( success == false || failed == true )\n    {\n        \/\/ In case of timeout or error, don't go any further\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n    return true;\n}\n\nbool VLCThumbnailer::seekAhead( FilePtr file, VLC::MediaPlayer& mp, void* data )\n{\n    std::unique_lock<std::mutex> lock( m_mutex );\n    float pos = .0f;\n    auto event = mp.eventManager().onPositionChanged([this, &pos](float p) {\n        std::unique_lock<std::mutex> lock( m_mutex );\n        pos = p;\n        m_cond.notify_all();\n    });\n    mp.setPosition( .4f );\n    bool success = m_cond.wait_for( lock, std::chrono::seconds( 3 ), [&pos]() {\n        return pos >= .1f;\n    });\n    \/\/ Since we're locking a mutex for each position changed, let's unregister ASAP\n    event->unregister();\n    if ( success == false )\n    {\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n    return true;\n}\n\nvoid VLCThumbnailer::setupVout( VLC::MediaPlayer& mp )\n{\n    mp.setVideoFormatCallbacks(\n        \/\/ Setup\n        [this, &mp](char* chroma, unsigned int* width, unsigned int *height, unsigned int *pitches, unsigned int *lines) {\n            strcpy( chroma, \"RV24\" );\n\n            const float inputAR = (float)*width \/ *height;\n\n            *width = Width;\n            auto prevHeight = m_height;\n            m_height = (float)Width \/ inputAR + 1;\n            \/\/ If our buffer isn't enough anymore, reallocate a new one.\n            if ( m_height > prevHeight )\n                m_buff.reset( new uint8_t[Width * m_height * Bpp] );\n            *height = m_height;\n            *pitches = Width * Bpp;\n            *lines = m_height;\n            return 1;\n        },\n        \/\/ Cleanup\n        nullptr);\n    mp.setVideoCallbacks(\n        \/\/ Lock\n        [this](void** pp_buff) {\n            *pp_buff = m_buff.get();\n            return nullptr;\n        },\n        \/\/unlock\n        [this](void*, void*const*) {\n            std::unique_lock<std::mutex> lock(m_mutex);\n            if ( m_snapshotRequired == true )\n            {\n                m_snapshotRequired = false;\n                m_cond.notify_all();\n            }\n        }\n        ,\n        \/\/display\n        nullptr\n    );\n}\n\nbool VLCThumbnailer::takeSnapshot(FilePtr file, VLC::MediaPlayer &mp, void *data)\n{\n    std::unique_ptr<uint8_t[]> buff;\n    \/\/ lock, signal that we want a snapshot, and wait.\n    {\n        std::unique_lock<std::mutex> lock( m_mutex );\n        m_snapshotRequired = true;\n        bool success = m_cond.wait_for( lock, std::chrono::seconds( 3 ), [this]() {\n            \/\/ Keep waiting if the vmem thread hasn't restored m_snapshotRequired to false\n            return m_snapshotRequired == true;\n        });\n        if ( success == false )\n        {\n            m_cb->done( file, StatusError, data );\n            return false;\n        }\n        \/\/ Prevent the vmem from screwing our snapshot over.\n        buff = std::move( m_buff );\n        \/\/ set a new buffer for next snapshot, and to avoid crashing while we stop the media player\n        m_buff.reset( new uint8_t[Width * m_height * Bpp] );\n    }\n    mp.stop();\n    return compress( buff.get(), file, data );\n}\n\n#ifdef WITH_JPEG\n\nstruct jpegError : public jpeg_error_mgr\n{\n    jmp_buf buff;\n    char message[JMSG_LENGTH_MAX];\n\n    static void jpegErrorHandler(j_common_ptr common)\n    {\n        auto error = reinterpret_cast<jpegError*>(common->err);\n        (*error->format_message)( common, error->message );\n        longjmp(error->buff, 1);\n    }\n};\n\n#endif\n\nbool VLCThumbnailer::compress(uint8_t* buff, FilePtr file, void *data)\n{\n    auto path = m_ml->snapshotPath();\n    path += \"\/\";\n    path += std::to_string( file->id() ) + \".jpg\";\n\n    \/\/FIXME: Abstract this away, though libjpeg requires a FILE*...\n    auto fOut = fopen(path.c_str(), \"wb\");\n    \/\/ ensure we always close the file.\n    auto fOutPtr = std::unique_ptr<FILE, int(*)(FILE*)>( fOut, &fclose );\n    if ( fOut == nullptr )\n    {\n        LOG_ERROR(\"Failed to open snapshot file \", path);\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n\n#ifdef WITH_JPEG\n    jpeg_compress_struct compInfo;\n    JSAMPROW row_pointer[1];\n\n    \/\/libjpeg's default error handling is to call exit(), which would\n    \/\/be slightly problematic...\n    jpegError err;\n    compInfo.err = jpeg_std_error(&err);\n    err.error_exit = jpegError::jpegErrorHandler;\n\n    if ( setjmp( err.buff ) )\n    {\n        LOG_ERROR(\"JPEG failure: \", err.message);\n        jpeg_destroy_compress(&compInfo);\n        m_cb->done( file, StatusError, data );\n        return false;\n    }\n\n    jpeg_create_compress(&compInfo);\n    jpeg_stdio_dest(&compInfo, fOut);\n\n    compInfo.image_width = Width;\n    compInfo.image_height = m_height;\n    compInfo.input_components = Bpp;\n#if JPEG_LIB_VERSION <= 80\n    compInfo.in_color_space = JCS_EXT_BGRX;\n#else\n    compInfo.in_color_space = JCS_RGB;\n#endif\n    jpeg_set_defaults( &compInfo );\n    jpeg_set_quality( &compInfo, 85, TRUE );\n\n    jpeg_start_compress( &compInfo, TRUE );\n\n    auto stride = compInfo.image_width * Bpp;\n\n    while (compInfo.next_scanline < compInfo.image_height) {\n      row_pointer[0] = &buff[compInfo.next_scanline * stride];\n      jpeg_write_scanlines(&compInfo, row_pointer, 1);\n    }\n    jpeg_finish_compress(&compInfo);\n    jpeg_destroy_compress(&compInfo);\n#else\n#error FIXME\n#endif\n\n    file->setSnapshot( path );\n    m_cb->done( file, StatusSuccess, data );\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2021 dresden elektronik ingenieurtechnik gmbh.\n * All rights reserved.\n *\n * The software in this package is published under the terms of the BSD\n * style license a copy of which has been included with this distribution in\n * the LICENSE.txt file.\n *\n *\/\n\n#include <QElapsedTimer>\n#include <QTimer>\n#include <deconz\/dbg_trace.h>\n#include \"event.h\"\n#include \"resource.h\"\n#include \"device_tick.h\"\n\n#define DEV_TICK_BOOT_TIME 8000\n#define TICK_INTERVAL_JOIN 500\n#define TICK_INTERVAL_IDLE 1000\n#define TICK_INTERVAL_IDLE_OTAU 6000\n\nextern int DEV_ApsQueueSize();\nextern bool DEV_OtauBusy();\n\nstruct JoinDevice\n{\n    DeviceKey deviceKey;\n    quint8 macCapabilities;\n};\n\nstatic const char *RLocal = nullptr;\n\ntypedef void (*DT_StateHandler)(DeviceTickPrivate *d, const Event &event);\n\nstatic void DT_StateInit(DeviceTickPrivate *d, const Event &event);\nstatic void DT_StateJoin(DeviceTickPrivate *d, const Event &event);\nstatic void DT_StateIdle(DeviceTickPrivate *d, const Event &event);\n\nclass DeviceTickPrivate\n{\npublic:\n    DT_StateHandler stateHandler = DT_StateInit;\n    std::vector<JoinDevice> joinDevices;\n    DeviceTick *q = nullptr;\n    QTimer *timer = nullptr;\n    size_t devIter = 0;\n    const DeviceContainer *devices = nullptr;\n};\n\n\/*! Constructor.\n *\/\nDeviceTick::DeviceTick(const DeviceContainer &devices, QObject *parent) :\n    QObject(parent),\n    d(new DeviceTickPrivate)\n{\n    d->devices = &devices;\n    d->q = this;\n    d->timer = new QTimer(this);\n    d->timer->setSingleShot(true);\n    connect(d->timer, &QTimer::timeout, this, &DeviceTick::timoutFired);\n    d->timer->start(DEV_TICK_BOOT_TIME);\n}\n\n\/*! Destructor.\n *\/\nDeviceTick::~DeviceTick()\n{\n    Q_ASSERT(d);\n    delete d;\n    d = nullptr;\n}\n\n\/*! Public event entry.\n *\/\nvoid DeviceTick::handleEvent(const Event &event)\n{\n    d->stateHandler(d, event);\n}\n\n\/*! State timer callback.\n *\/\nvoid DeviceTick::timoutFired()\n{\n    d->stateHandler(d, Event(RLocal, REventStateTimeout, 0));\n}\n\n\/*! Sets a new DeviceTick state.\n    The events REventStateLeave and REventStateEnter will be triggered accordingly.\n *\/\nstatic void DT_SetState(DeviceTickPrivate *d, DT_StateHandler state)\n{\n    if (d->stateHandler != state)\n    {\n        d->stateHandler(d, Event(RLocal, REventStateLeave, 0));\n        d->stateHandler = state;\n        d->stateHandler(d, Event(RLocal, REventStateEnter, 0));\n    }\n}\n\n\/*! Starts the state timer. Free function to be mocked by test code.\n *\/\nstatic void DT_StartTimer(DeviceTickPrivate *d, int timeoutMs)\n{\n    d->timer->start(timeoutMs);\n}\n\n\/*! Stops the state timer. Free function to be mocked by test code.\n *\/\nstatic void DT_StopTimer(DeviceTickPrivate *d)\n{\n    d->timer->stop();\n}\n\n\/*! Initial state to wait DEV_TICK_BOOT_TIME seconds before starting normal operation.\n *\/\nstatic void DT_StateInit(DeviceTickPrivate *d, const Event &event)\n{\n    if (event.resource() == RLocal && event.what() == REventStateTimeout)\n    {\n        DBG_Printf(DBG_INFO, \"DEV Tick.Init: booted after %lld seconds\\n\", DEV_TICK_BOOT_TIME);\n        DT_SetState(d, DT_StateIdle);\n    }\n}\n\n\/*! Emits REventPoll to the next device in DT_StateIdle.\n *\/\nstatic void DT_PollNextIdleDevice(DeviceTickPrivate *d)\n{\n    const auto devCount = d->devices->size();\n\n    if (devCount == 0)\n    {\n        return;\n    }\n\n    d->devIter %= devCount;\n\n    const auto &device = d->devices->at(d->devIter);\n    Q_ASSERT(device);\n    if (device->reachable())\n    {\n        emit d->q->eventNotify(Event(device->prefix(), REventPoll, 0, device->key()));\n    }\n    d->devIter++;\n}\n\n\/*! This state is active while Permit Join is disabled for normal idle operation.\n\n    It walks over all Devices in TICK_INTERVAL_IDLE spacing.\n    The state transitions to DT_StateJoin when REventPermitjoinEnabled is received.\n *\/\nstatic void DT_StateIdle(DeviceTickPrivate *d, const Event &event)\n{\n    if (event.what() == REventPermitjoinEnabled)\n    {\n        DT_SetState(d, DT_StateJoin);\n    }\n    else if (event.resource() == RLocal)\n    {\n        if (event.what() == REventStateTimeout)\n        {\n            int timeout = DEV_OtauBusy() ? TICK_INTERVAL_IDLE_OTAU : TICK_INTERVAL_IDLE;\n            if (DEV_ApsQueueSize() < 4)\n            {\n                DT_PollNextIdleDevice(d);\n            }\n            DT_StartTimer(d, timeout);\n        }\n        else if (event.what() == REventStateEnter)\n        {\n            DT_StartTimer(d, TICK_INTERVAL_IDLE);\n        }\n        else if (event.what() == REventStateLeave)\n        {\n            DT_StopTimer(d);\n        }\n    }\n}\n\n\/*! Adds a joining device entry to the queue if not already present.\n *\/\nstatic void DT_RegisterJoiningDevice(DeviceTickPrivate *d, DeviceKey deviceKey, quint8 macCapabilities)\n{\n    Q_ASSERT(deviceKey != 0); \/\/ if this triggers we have problems elsewhere\n\n    auto i = std::find_if(d->joinDevices.cbegin(), d->joinDevices.cend(), [&deviceKey](const JoinDevice &dev)\n    {\n        return deviceKey == dev.deviceKey;\n    });\n\n    if (i == d->joinDevices.cend())\n    {\n        JoinDevice dev;\n        dev.deviceKey = deviceKey;\n        dev.macCapabilities = macCapabilities;\n        d->joinDevices.push_back(dev);\n        DBG_Printf(DBG_INFO, \"DEV Tick: fast poll 0x%016llX, mac capabilities: 0x%02X\\n\", deviceKey, macCapabilities);\n    }\n}\n\n\/*! Emits REventPoll to the next device in DT_StateJoin.\n *\/\nstatic void DT_PollNextJoiningDevice(DeviceTickPrivate *d)\n{\n    if (d->joinDevices.empty())\n    {\n        return;\n    }\n\n    d->devIter %= d->joinDevices.size();\n    Q_ASSERT(d->devIter < d->joinDevices.size());\n\n    const JoinDevice &device = d->joinDevices.at(d->devIter);\n    emit d->q->eventNotify(Event(RDevices, REventAwake, 0, device.deviceKey));\n    d->devIter++;\n}\n\n\/*! This state is active while Permit Join is enabled.\n\n    When a REventDeviceAnnounce event is received, the device is added to a joining\n    queue and processed exclusivly and quickly.\n\n    The state transitions to DT_StateIdle when Permit Join is disabled.\n *\/\nstatic void DT_StateJoin(DeviceTickPrivate *d, const Event &event)\n{\n    if (event.what() == REventPermitjoinDisabled)\n    {\n        DT_SetState(d, DT_StateIdle);\n    }\n    else if (event.what() == REventDeviceAnnounce)\n    {\n        DBG_Printf(DBG_INFO, \"DEV Tick.Join: %s\\n\", event.what());\n        DT_RegisterJoiningDevice(d, event.deviceKey(), static_cast<quint8>(event.num()));\n    }\n    else if (event.resource() == RLocal)\n    {\n        if (event.what() == REventStateTimeout)\n        {\n            DT_PollNextJoiningDevice(d);\n            DT_StartTimer(d, TICK_INTERVAL_JOIN);\n        }\n        else if (event.what() == REventStateEnter)\n        {\n            DT_StartTimer(d, TICK_INTERVAL_JOIN);\n        }\n        else if (event.what() == REventStateLeave)\n        {\n            DT_StopTimer(d);\n            d->joinDevices.clear();\n        }\n    }\n}\n<commit_msg>Let device fast polling continue a few secs after permit join disabled<commit_after>\/*\n * Copyright (c) 2021 dresden elektronik ingenieurtechnik gmbh.\n * All rights reserved.\n *\n * The software in this package is published under the terms of the BSD\n * style license a copy of which has been included with this distribution in\n * the LICENSE.txt file.\n *\n *\/\n\n#include <QElapsedTimer>\n#include <QTimer>\n#include <deconz\/dbg_trace.h>\n#include <deconz\/timeref.h>\n#include \"event.h\"\n#include \"resource.h\"\n#include \"device_tick.h\"\n\n#define DEV_TICK_BOOT_TIME 8000\n#define TICK_INTERVAL_JOIN 500\n#define TICK_INTERVAL_IDLE 1000\n#define TICK_INTERVAL_IDLE_OTAU 6000\n\nextern int DEV_ApsQueueSize();\nextern bool DEV_OtauBusy();\n\nstruct JoinDevice\n{\n    DeviceKey deviceKey;\n    quint8 macCapabilities;\n};\n\nstatic const char *RLocal = nullptr;\n\ntypedef void (*DT_StateHandler)(DeviceTickPrivate *d, const Event &event);\n\nstatic void DT_StateInit(DeviceTickPrivate *d, const Event &event);\nstatic void DT_StateJoin(DeviceTickPrivate *d, const Event &event);\nstatic void DT_StateIdle(DeviceTickPrivate *d, const Event &event);\n\nclass DeviceTickPrivate\n{\npublic:\n    DT_StateHandler stateHandler = DT_StateInit;\n    std::vector<JoinDevice> joinDevices;\n    deCONZ::SteadyTimeRef joinDisabledTime;\n    DeviceTick *q = nullptr;\n    QTimer *timer = nullptr;\n    size_t devIter = 0;\n    const DeviceContainer *devices = nullptr;\n};\n\n\/*! Constructor.\n *\/\nDeviceTick::DeviceTick(const DeviceContainer &devices, QObject *parent) :\n    QObject(parent),\n    d(new DeviceTickPrivate)\n{\n    d->devices = &devices;\n    d->q = this;\n    d->timer = new QTimer(this);\n    d->timer->setSingleShot(true);\n    connect(d->timer, &QTimer::timeout, this, &DeviceTick::timoutFired);\n    d->timer->start(DEV_TICK_BOOT_TIME);\n}\n\n\/*! Destructor.\n *\/\nDeviceTick::~DeviceTick()\n{\n    Q_ASSERT(d);\n    delete d;\n    d = nullptr;\n}\n\n\/*! Public event entry.\n *\/\nvoid DeviceTick::handleEvent(const Event &event)\n{\n    d->stateHandler(d, event);\n}\n\n\/*! State timer callback.\n *\/\nvoid DeviceTick::timoutFired()\n{\n    d->stateHandler(d, Event(RLocal, REventStateTimeout, 0));\n}\n\n\/*! Sets a new DeviceTick state.\n    The events REventStateLeave and REventStateEnter will be triggered accordingly.\n *\/\nstatic void DT_SetState(DeviceTickPrivate *d, DT_StateHandler state)\n{\n    if (d->stateHandler != state)\n    {\n        d->stateHandler(d, Event(RLocal, REventStateLeave, 0));\n        d->stateHandler = state;\n        d->stateHandler(d, Event(RLocal, REventStateEnter, 0));\n    }\n}\n\n\/*! Starts the state timer. Free function to be mocked by test code.\n *\/\nstatic void DT_StartTimer(DeviceTickPrivate *d, int timeoutMs)\n{\n    d->timer->start(timeoutMs);\n}\n\n\/*! Stops the state timer. Free function to be mocked by test code.\n *\/\nstatic void DT_StopTimer(DeviceTickPrivate *d)\n{\n    d->timer->stop();\n}\n\n\/*! Initial state to wait DEV_TICK_BOOT_TIME seconds before starting normal operation.\n *\/\nstatic void DT_StateInit(DeviceTickPrivate *d, const Event &event)\n{\n    if (event.resource() == RLocal && event.what() == REventStateTimeout)\n    {\n        DBG_Printf(DBG_INFO, \"DEV Tick.Init: booted after %lld seconds\\n\", DEV_TICK_BOOT_TIME);\n        DT_SetState(d, DT_StateIdle);\n    }\n}\n\n\/*! Emits REventPoll to the next device in DT_StateIdle.\n *\/\nstatic void DT_PollNextIdleDevice(DeviceTickPrivate *d)\n{\n    const auto devCount = d->devices->size();\n\n    if (devCount == 0)\n    {\n        return;\n    }\n\n    d->devIter %= devCount;\n\n    const auto &device = d->devices->at(d->devIter);\n    Q_ASSERT(device);\n    if (device->reachable())\n    {\n        emit d->q->eventNotify(Event(device->prefix(), REventPoll, 0, device->key()));\n    }\n    d->devIter++;\n}\n\n\/*! This state is active while Permit Join is disabled for normal idle operation.\n\n    It walks over all Devices in TICK_INTERVAL_IDLE spacing.\n    The state transitions to DT_StateJoin when REventPermitjoinEnabled is received.\n *\/\nstatic void DT_StateIdle(DeviceTickPrivate *d, const Event &event)\n{\n    if (event.what() == REventPermitjoinEnabled)\n    {\n        DT_SetState(d, DT_StateJoin);\n    }\n    else if (event.resource() == RLocal)\n    {\n        if (event.what() == REventStateTimeout)\n        {\n            int timeout = DEV_OtauBusy() ? TICK_INTERVAL_IDLE_OTAU : TICK_INTERVAL_IDLE;\n            if (DEV_ApsQueueSize() < 4)\n            {\n                DT_PollNextIdleDevice(d);\n            }\n            DT_StartTimer(d, timeout);\n        }\n        else if (event.what() == REventStateEnter)\n        {\n            DT_StartTimer(d, TICK_INTERVAL_IDLE);\n        }\n        else if (event.what() == REventStateLeave)\n        {\n            DT_StopTimer(d);\n        }\n    }\n}\n\n\/*! Adds a joining device entry to the queue if not already present.\n *\/\nstatic void DT_RegisterJoiningDevice(DeviceTickPrivate *d, DeviceKey deviceKey, quint8 macCapabilities)\n{\n    Q_ASSERT(deviceKey != 0); \/\/ if this triggers we have problems elsewhere\n\n    auto i = std::find_if(d->joinDevices.cbegin(), d->joinDevices.cend(), [&deviceKey](const JoinDevice &dev)\n    {\n        return deviceKey == dev.deviceKey;\n    });\n\n    if (i == d->joinDevices.cend())\n    {\n        JoinDevice dev;\n        dev.deviceKey = deviceKey;\n        dev.macCapabilities = macCapabilities;\n        d->joinDevices.push_back(dev);\n        DBG_Printf(DBG_INFO, \"DEV Tick: fast poll 0x%016llX, mac capabilities: 0x%02X\\n\", deviceKey, macCapabilities);\n    }\n}\n\n\/*! Emits REventPoll to the next device in DT_StateJoin.\n *\/\nstatic void DT_PollNextJoiningDevice(DeviceTickPrivate *d)\n{\n    if (d->joinDevices.empty())\n    {\n        return;\n    }\n\n    d->devIter %= d->joinDevices.size();\n    Q_ASSERT(d->devIter < d->joinDevices.size());\n\n    const JoinDevice &device = d->joinDevices.at(d->devIter);\n    emit d->q->eventNotify(Event(RDevices, REventAwake, 0, device.deviceKey));\n    d->devIter++;\n}\n\n\/*! This state is active while Permit Join is enabled.\n\n    When a REventDeviceAnnounce event is received, the device is added to a joining\n    queue and processed exclusivly and quickly.\n\n    The state transitions to DT_StateIdle when Permit Join is disabled.\n *\/\nstatic void DT_StateJoin(DeviceTickPrivate *d, const Event &event)\n{\n    if (event.what() == REventPermitjoinDisabled)\n    {\n        d->joinDisabledTime = deCONZ::steadyTimeRef();\n    }\n    else if (event.what() == REventDeviceAnnounce)\n    {\n        DBG_Printf(DBG_INFO, \"DEV Tick.Join: %s\\n\", event.what());\n        DT_RegisterJoiningDevice(d, event.deviceKey(), static_cast<quint8>(event.num()));\n    }\n    else if (event.resource() == RLocal)\n    {\n        if (event.what() == REventStateTimeout)\n        {\n            if (deCONZ::isValid(d->joinDisabledTime) &&\n                deCONZ::TimeSeconds{20} < (deCONZ::steadyTimeRef() - d->joinDisabledTime))\n            {\n                \/\/ leave state after delay to let fast polling finish even then permit join is disabled again\n                DT_SetState(d, DT_StateIdle);\n                return;\n            }\n\n            DT_PollNextJoiningDevice(d);\n            DT_StartTimer(d, TICK_INTERVAL_JOIN);\n        }\n        else if (event.what() == REventStateEnter)\n        {\n            d->joinDisabledTime = {};\n            DT_StartTimer(d, TICK_INTERVAL_JOIN);\n        }\n        else if (event.what() == REventStateLeave)\n        {\n            DT_StopTimer(d);\n            d->joinDevices.clear();\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2004-2019 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 <stdafx.h>\n\n#include \"TrackRowRenderers.h\"\n#include <cursespp\/Colors.h>\n#include <cursespp\/SingleLineEntry.h>\n#include <cursespp\/Text.h>\n#include <core\/support\/PreferenceKeys.h>\n#include <core\/library\/LocalLibraryConstants.h>\n#include <core\/support\/Duration.h>\n#include <app\/util\/Rating.h>\n#include <app\/util\/PreferenceKeys.h>\n#include <math.h>\n\nusing namespace musik::core;\nusing namespace musik::core::library;\nusing namespace musik::cube;\nusing namespace musik::cube::TrackRowRenderers;\nusing namespace cursespp;\n\n#define DIGITS(x) (x > 9 ? (int) log10((double) x) + 1 : 1)\n\nstatic const int kDurationColWidth = 5; \/* 00:00 *\/\nstatic const int kRatingBreakpointWidth = 90;\n\nstatic auto preferences = Preferences::ForComponent(musik::core::prefs::components::Settings);\n\nstatic inline std::string getRatingForTrack(TrackPtr track, size_t width) {\n    if (preferences->GetBool(musik::cube::prefs::keys::DisableRatingColumn, false)) {\n        return \"\";\n    }\n    int rating = std::max(0, std::min(5, track->GetInt32(\"rating\", 0)));\n    return (width > kRatingBreakpointWidth) ? \"   \" + getRatingString(rating) : \"\";\n}\n\nnamespace AlbumSort {\n    static const int kTrackColWidth = 3;\n    static const int kArtistColWidth = 17;\n    static const int kRatingColumnWidth = 5;\n\n    static Renderer renderer = [](TrackPtr track, size_t index, size_t width, TrackNumType type) -> std::string {\n        std::string trackNum;\n\n        std::string rating = getRatingForTrack(track, width);\n\n        int trackColWidth = kTrackColWidth;\n        if (type == TrackNumType::Metadata) {\n            trackNum = text::Align(\n                track->GetString(constants::Track::TRACK_NUM),\n                text::AlignRight,\n                kTrackColWidth);\n        }\n        else {\n            trackColWidth = std::max(kTrackColWidth, DIGITS(index + 1));\n            trackNum = text::Align(std::to_string(index + 1), text::AlignRight, trackColWidth);\n        }\n\n        std::string duration = text::Align(\n            musik::core::duration::Duration(track->GetString(constants::Track::DURATION)),\n            text::AlignRight,\n            kDurationColWidth);\n\n        std::string artist = text::Align(\n            track->GetString(constants::Track::ARTIST),\n            text::AlignLeft,\n            kArtistColWidth);\n\n        int titleWidth = 0;\n\n        titleWidth =\n            (int) width -\n            (int) trackColWidth -\n            kDurationColWidth -\n            kArtistColWidth -\n            u8len(rating) -\n            (3 * 3); \/* 3 = spacing *\/\n\n        titleWidth = std::max(0, titleWidth);\n\n        std::string title = text::Align(\n            track->GetString(constants::Track::TITLE),\n            text::AlignLeft,\n            (int) titleWidth);\n\n        return u8fmt(\n            \"%s   %s%s   %s   %s\",\n            trackNum.c_str(),\n            title.c_str(),\n            rating.c_str(),\n            duration.c_str(),\n            artist.c_str());\n    };\n}\n\nnamespace NowPlaying {\n    static const int kTrackColWidth = 3;\n    static const int kArtistColWidth = 14;\n    static const int kAlbumColWidth = 14;\n\n    static Renderer renderer = [](TrackPtr track, size_t index, size_t width, TrackNumType type) -> std::string {\n        size_t trackColWidth = std::max(kTrackColWidth, DIGITS(index + 1));\n        std::string trackNum = text::Align(std::to_string(index + 1), text::AlignRight, trackColWidth);\n        std::string rating = getRatingForTrack(track, width);\n\n        std::string duration = text::Align(\n            duration::Duration(track->GetString(constants::Track::DURATION)),\n            text::AlignRight,\n            kDurationColWidth);\n\n        std::string album = text::Align(\n            track->GetString(constants::Track::ALBUM),\n            text::AlignLeft,\n            kAlbumColWidth);\n\n        std::string artist = text::Align(\n            track->GetString(constants::Track::ARTIST),\n            text::AlignLeft,\n            kArtistColWidth);\n\n        int titleWidth =\n            (int) width -\n            (int) trackColWidth -\n            kDurationColWidth -\n            kAlbumColWidth -\n            kArtistColWidth -\n            u8cols(rating) -\n            (4 * 3); \/* 3 = spacing *\/\n\n        titleWidth = std::max(0, titleWidth);\n\n        std::string title = text::Align(\n            track->GetString(constants::Track::TITLE),\n            text::AlignLeft,\n            (int) titleWidth);\n\n        return u8fmt(\n            \"%s   %s%s   %s   %s   %s\",\n            trackNum.c_str(),\n            title.c_str(),\n            rating.c_str(),\n            duration.c_str(),\n            album.c_str(),\n            artist.c_str());\n    };\n}\n\nnamespace musik {\n    namespace cube {\n        namespace TrackRowRenderers {\n            const Renderer Get(Type type) {\n                switch (type) {\n                    case Type::AlbumSort: return AlbumSort::renderer;\n                    case Type::NowPlaying: return NowPlaying::renderer;\n                }\n                throw std::runtime_error(\"invalid type specified to TrackRowRenderers::Get\");\n            }\n        }\n    }\n}\n<commit_msg>Minor rating column cleanups.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2004-2019 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 <stdafx.h>\n\n#include \"TrackRowRenderers.h\"\n#include <cursespp\/Colors.h>\n#include <cursespp\/SingleLineEntry.h>\n#include <cursespp\/Text.h>\n#include <core\/support\/PreferenceKeys.h>\n#include <core\/library\/LocalLibraryConstants.h>\n#include <core\/support\/Duration.h>\n#include <app\/util\/Rating.h>\n#include <app\/util\/PreferenceKeys.h>\n#include <math.h>\n\nusing namespace musik::core;\nusing namespace musik::core::library;\nusing namespace musik::cube;\nusing namespace musik::cube::TrackRowRenderers;\nusing namespace cursespp;\n\n#define DIGITS(x) (x > 9 ? (int) log10((double) x) + 1 : 1)\n\nstatic const int kDurationColWidth = 5; \/* 00:00 *\/\nstatic const int kRatingBreakpointWidth = 90;\n\n\/* this method does a couple things slower than it probably should, but it\nshouldn't cause any issues. TODO: make this better? does it matter? *\/\nstatic inline std::string getRatingForTrack(TrackPtr track, size_t width) {\n    if (width <= kRatingBreakpointWidth) {\n        return \"\";\n    }\n    auto p = Preferences::ForComponent(musik::core::prefs::components::Settings);\n    if (p->GetBool(musik::cube::prefs::keys::DisableRatingColumn, false)) {\n        return \"\";\n    }\n    int rating = std::max(0, std::min(5, track->GetInt32(\"rating\", 0)));\n    return \"   \" + getRatingString(rating);\n}\n\nnamespace AlbumSort {\n    static const int kTrackColWidth = 3;\n    static const int kArtistColWidth = 17;\n    static const int kRatingColumnWidth = 5;\n\n    static Renderer renderer = [](TrackPtr track, size_t index, size_t width, TrackNumType type) -> std::string {\n        std::string trackNum;\n\n        std::string rating = getRatingForTrack(track, width);\n\n        int trackColWidth = kTrackColWidth;\n        if (type == TrackNumType::Metadata) {\n            trackNum = text::Align(\n                track->GetString(constants::Track::TRACK_NUM),\n                text::AlignRight,\n                kTrackColWidth);\n        }\n        else {\n            trackColWidth = std::max(kTrackColWidth, DIGITS(index + 1));\n            trackNum = text::Align(std::to_string(index + 1), text::AlignRight, trackColWidth);\n        }\n\n        std::string duration = text::Align(\n            musik::core::duration::Duration(track->GetString(constants::Track::DURATION)),\n            text::AlignRight,\n            kDurationColWidth);\n\n        std::string artist = text::Align(\n            track->GetString(constants::Track::ARTIST),\n            text::AlignLeft,\n            kArtistColWidth);\n\n        int titleWidth = 0;\n\n        titleWidth =\n            (int) width -\n            (int) trackColWidth -\n            kDurationColWidth -\n            kArtistColWidth -\n            (int) u8len(rating) -\n            (3 * 3); \/* 3 = spacing *\/\n\n        titleWidth = std::max(0, titleWidth);\n\n        std::string title = text::Align(\n            track->GetString(constants::Track::TITLE),\n            text::AlignLeft,\n            (int) titleWidth);\n\n        return u8fmt(\n            \"%s   %s%s   %s   %s\",\n            trackNum.c_str(),\n            title.c_str(),\n            rating.c_str(),\n            duration.c_str(),\n            artist.c_str());\n    };\n}\n\nnamespace NowPlaying {\n    static const int kTrackColWidth = 3;\n    static const int kArtistColWidth = 14;\n    static const int kAlbumColWidth = 14;\n\n    static Renderer renderer = [](TrackPtr track, size_t index, size_t width, TrackNumType type) -> std::string {\n        size_t trackColWidth = std::max(kTrackColWidth, DIGITS(index + 1));\n        std::string trackNum = text::Align(std::to_string(index + 1), text::AlignRight, trackColWidth);\n        std::string rating = getRatingForTrack(track, width);\n\n        std::string duration = text::Align(\n            duration::Duration(track->GetString(constants::Track::DURATION)),\n            text::AlignRight,\n            kDurationColWidth);\n\n        std::string album = text::Align(\n            track->GetString(constants::Track::ALBUM),\n            text::AlignLeft,\n            kAlbumColWidth);\n\n        std::string artist = text::Align(\n            track->GetString(constants::Track::ARTIST),\n            text::AlignLeft,\n            kArtistColWidth);\n\n        int titleWidth =\n            (int) width -\n            (int) trackColWidth -\n            kDurationColWidth -\n            kAlbumColWidth -\n            kArtistColWidth -\n            (int) u8cols(rating) -\n            (4 * 3); \/* 3 = spacing *\/\n\n        titleWidth = std::max(0, titleWidth);\n\n        std::string title = text::Align(\n            track->GetString(constants::Track::TITLE),\n            text::AlignLeft,\n            (int) titleWidth);\n\n        return u8fmt(\n            \"%s   %s%s   %s   %s   %s\",\n            trackNum.c_str(),\n            title.c_str(),\n            rating.c_str(),\n            duration.c_str(),\n            album.c_str(),\n            artist.c_str());\n    };\n}\n\nnamespace musik {\n    namespace cube {\n        namespace TrackRowRenderers {\n            const Renderer Get(Type type) {\n                switch (type) {\n                    case Type::AlbumSort: return AlbumSort::renderer;\n                    case Type::NowPlaying: return NowPlaying::renderer;\n                }\n                throw std::runtime_error(\"invalid type specified to TrackRowRenderers::Get\");\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThe MIT License\n\nCopyright (c) 2011 by Jorrit Tyberghein\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 <crystalspace.h>\n\n#include \"meshfactmodel.h\"\n#include \"edcommon\/tools.h\"\n#include \"propclass\/dynworld.h\"\n\nusing namespace Ares;\n\nvoid MeshCollectionValue::UpdateChildren ()\n{\n  if (!dirty) return;\n  dirty = false;\n  ReleaseChildren ();\n  iMeshFactoryList* list = engine->GetMeshFactories ();\n  for (size_t i = 0 ; i < size_t (list->GetCount ()) ; i++)\n  {\n    iMeshFactoryWrapper* fact = list->Get (i);\n    const char* name = fact->QueryObject ()->GetName ();\n    if (!dynworld->FindFactory (name))\n      NewCompositeChild (VALUE_STRING, \"name\", name, VALUE_NONE);\n  }\n}\n\n<commit_msg>The list of factories in the dynamic factory editor is now sorted for easier finding of new factories.<commit_after>\/*\nThe MIT License\n\nCopyright (c) 2011 by Jorrit Tyberghein\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 <crystalspace.h>\n\n#include \"meshfactmodel.h\"\n#include \"edcommon\/tools.h\"\n#include \"propclass\/dynworld.h\"\n\nusing namespace Ares;\n\n\nvoid MeshCollectionValue::UpdateChildren ()\n{\n  if (!dirty) return;\n  dirty = false;\n  ReleaseChildren ();\n  iMeshFactoryList* list = engine->GetMeshFactories ();\n  csStringArray names;\n  for (size_t i = 0 ; i < size_t (list->GetCount ()) ; i++)\n  {\n    iMeshFactoryWrapper* fact = list->Get (i);\n    const char* name = fact->QueryObject ()->GetName ();\n    if (!dynworld->FindFactory (name))\n      names.Push (name);\n  }\n  names.Sort ();\n\n  for (size_t i = 0 ; i < names.GetSize () ; i++)\n  {\n    NewCompositeChild (VALUE_STRING, \"name\", names[i], VALUE_NONE);\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2012 Carsten Burstedde, Donna Calhoun\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, this\nlist of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice,\nthis list of conditions and the following disclaimer in the documentation\nand\/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 HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY 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 \"filament_user.h\"\n\n#include <fclaw2d_forestclaw.h>\n#include <fclaw2d_clawpatch.h>\n\n#if 0\nstatic fclaw2d_vtable_t fclaw2d_vt;\n\nstatic fc2d_clawpack46_vtable_t classic_claw46;\nstatic fc2d_clawpack5_vtable_t classic_claw5;\n#endif \n\nvoid filament_link_solvers(fclaw2d_domain_t *domain)\n{\n    const user_options_t* user = filament_user_get_options(domain);\n    const amr_options_t* gparms = fclaw2d_forestclaw_get_options(domain);\n\n    \/\/ fclaw2d_init_vtable();\n\n    if (user->claw_version == 4)\n    {\n        \/\/ fc2d_clawpack46_set_vtable_defaults(&fclaw2d_vt, &classic_claw46);\n        \/\/ fc2d_clawpack46_set_vtable_defaults();\n        \n        fc2d_clawpack46_vt()->setprob   = &SETPROB;\n        fc2d_clawpack46_vt()->qinit     = &CLAWPACK46_QINIT;\n        if (gparms->manifold)\n        {\n            fclaw2d_patch_vt()->patch_setup   = &filament_patch_setup_manifold;\n\n            fc2d_clawpack46_vt()->rpn2      = &CLAWPACK46_RPN2ADV_MANIFOLD;\n            fc2d_clawpack46_vt()->rpt2      = &CLAWPACK46_RPT2ADV_MANIFOLD;\n\n            if (user->example == 2)\n            {\n                \/* Avoid tagging block corners in 5 patch example*\/\n                fclaw2d_clawpatch_vt()->fort_tag4refinement = &CLAWPACK46_TAG4REFINEMENT;\n                fclaw2d_clawpatch_vt()->fort_tag4coarsening = &CLAWPACK46_TAG4COARSENING;\n            }\n        }\n        else\n        {\n            fc2d_clawpack46_vt()->setaux    = &CLAWPACK46_SETAUX;  \/* Used in non-manifold case *\/\n            fc2d_clawpack46_vt()->rpn2      = &CLAWPACK46_RPN2ADV;\n            fc2d_clawpack46_vt()->rpt2      = &CLAWPACK46_RPT2ADV;\n        }\n\n        \/\/ fc2d_clawpack46_set_vtable(classic_claw46);\n    }\n    else if (user->claw_version == 5)\n    {\n        \/\/ fc2d_clawpack5_set_vtable_defaults(&fclaw2d_vt, &classic_claw5);\n        \/\/ fc2d_clawpack5_set_vtable_defaults();\n\n        fc2d_clawpack5_vt()->setprob   = &SETPROB;\n        fc2d_clawpack5_vt()->qinit     = &CLAWPACK5_QINIT;\n        if (gparms->manifold)\n        {\n            fclaw2d_patch_vt()->patch_setup  = &filament_patch_setup_manifold;\n            fc2d_clawpack5_vt()->rpn2      = &CLAWPACK5_RPN2ADV_MANIFOLD;\n            fc2d_clawpack5_vt()->rpt2      = &CLAWPACK5_RPT2ADV_MANIFOLD;\n\n            if (user->example == 2)\n            {\n                \/* Avoid tagging block corners in 5 patch example*\/\n                fclaw2d_clawpatch_vt()->fort_tag4refinement = &CLAWPACK5_TAG4REFINEMENT;\n                fclaw2d_clawpatch_vt()->fort_tag4coarsening = &CLAWPACK5_TAG4COARSENING;\n            }\n        }\n        else\n        {\n            fc2d_clawpack5_vt()->setaux    = &CLAWPACK5_SETAUX;   \/* Used in non-manifold case *\/\n            fc2d_clawpack5_vt()->rpn2      = &CLAWPACK5_RPN2ADV;\n            fc2d_clawpack5_vt()->rpt2      = &CLAWPACK5_RPT2ADV;\n        }\n\n        \/\/ fc2d_clawpack5_set_vtable(classic_claw5);\n    }\n    fclaw2d_set_vtable();\n}\n\nvoid filament_patch_setup_manifold(fclaw2d_domain_t *domain,\n                                   fclaw2d_patch_t *this_patch,\n                                   int this_block_idx,\n                                   int this_patch_idx)\n{\n    const user_options_t* user = filament_user_get_options(domain);\n\n    int mx,my,mbc,maux;\n    double xlower,ylower,dx,dy;\n    double *aux,*xd,*yd,*zd,*area;\n    double *xp,*yp,*zp;\n\n    fclaw2d_clawpatch_grid_data(domain,this_patch,&mx,&my,&mbc,\n                                &xlower,&ylower,&dx,&dy);\n\n    fclaw2d_clawpatch_metric_data(domain,this_patch,&xp,&yp,&zp,\n                                  &xd,&yd,&zd,&area);\n\n    if (user->claw_version == 4)\n    {\n        fc2d_clawpack46_define_auxarray(domain,this_patch);\n        fc2d_clawpack46_aux_data(domain,this_patch,&aux,&maux);\n        USER46_SETAUX_MANIFOLD(&mbc,&mx,&my,&xlower,&ylower,\n                               &dx,&dy,&maux,aux,&this_block_idx,\n                               xd,yd,zd,area);\n    }\n    else if (user->claw_version == 5)\n    {\n        fc2d_clawpack5_define_auxarray(domain,this_patch);\n        fc2d_clawpack5_aux_data(domain,this_patch,&aux,&maux);\n        USER5_SETAUX_MANIFOLD(&mbc,&mx,&my,&xlower,&ylower,\n                              &dx,&dy,&maux,aux,&this_block_idx,\n                              xd,yd,zd,area);\n    }\n}\n<commit_msg>(filament) No longer necessary to call init routines in vtable setup<commit_after>\/*\nCopyright (c) 2012 Carsten Burstedde, Donna Calhoun\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, this\nlist of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice,\nthis list of conditions and the following disclaimer in the documentation\nand\/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 HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY 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 \"filament_user.h\"\n\n#include <fclaw2d_forestclaw.h>\n#include <fclaw2d_clawpatch.h>\n\nvoid filament_link_solvers(fclaw2d_domain_t *domain)\n{\n    const user_options_t* user = filament_user_get_options(domain);\n    const amr_options_t* gparms = fclaw2d_forestclaw_get_options(domain);\n\n    \/\/ fclaw2d_init_vtable();\n\n    if (user->claw_version == 4)\n    {\n        fc2d_clawpack46_vt()->setprob   = &SETPROB;\n        fc2d_clawpack46_vt()->qinit     = &CLAWPACK46_QINIT;\n        if (gparms->manifold)\n        {\n            fclaw2d_patch_vt()->patch_setup   = &filament_patch_setup_manifold;\n\n            fc2d_clawpack46_vt()->rpn2      = &CLAWPACK46_RPN2ADV_MANIFOLD;\n            fc2d_clawpack46_vt()->rpt2      = &CLAWPACK46_RPT2ADV_MANIFOLD;\n\n            if (user->example == 2)\n            {\n                \/* Avoid tagging block corners in 5 patch example*\/\n                fclaw2d_clawpatch_vt()->fort_tag4refinement = &CLAWPACK46_TAG4REFINEMENT;\n                fclaw2d_clawpatch_vt()->fort_tag4coarsening = &CLAWPACK46_TAG4COARSENING;\n            }\n        }\n        else\n        {\n            fc2d_clawpack46_vt()->setaux    = &CLAWPACK46_SETAUX;  \/* Used in non-manifold case *\/\n            fc2d_clawpack46_vt()->rpn2      = &CLAWPACK46_RPN2ADV;\n            fc2d_clawpack46_vt()->rpt2      = &CLAWPACK46_RPT2ADV;\n        }\n\n    }\n    else if (user->claw_version == 5)\n    {\n        fc2d_clawpack5_vt()->setprob   = &SETPROB;\n        fc2d_clawpack5_vt()->qinit     = &CLAWPACK5_QINIT;\n        if (gparms->manifold)\n        {\n            fclaw2d_patch_vt()->patch_setup  = &filament_patch_setup_manifold;\n            fc2d_clawpack5_vt()->rpn2      = &CLAWPACK5_RPN2ADV_MANIFOLD;\n            fc2d_clawpack5_vt()->rpt2      = &CLAWPACK5_RPT2ADV_MANIFOLD;\n\n            if (user->example == 2)\n            {\n                \/* Avoid tagging block corners in 5 patch example*\/\n                fclaw2d_clawpatch_vt()->fort_tag4refinement = &CLAWPACK5_TAG4REFINEMENT;\n                fclaw2d_clawpatch_vt()->fort_tag4coarsening = &CLAWPACK5_TAG4COARSENING;\n            }\n        }\n        else\n        {\n            fc2d_clawpack5_vt()->setaux    = &CLAWPACK5_SETAUX;   \/* Used in non-manifold case *\/\n            fc2d_clawpack5_vt()->rpn2      = &CLAWPACK5_RPN2ADV;\n            fc2d_clawpack5_vt()->rpt2      = &CLAWPACK5_RPT2ADV;\n        }\n    }\n}\n\nvoid filament_patch_setup_manifold(fclaw2d_domain_t *domain,\n                                   fclaw2d_patch_t *this_patch,\n                                   int this_block_idx,\n                                   int this_patch_idx)\n{\n    const user_options_t* user = filament_user_get_options(domain);\n\n    int mx,my,mbc,maux;\n    double xlower,ylower,dx,dy;\n    double *aux,*xd,*yd,*zd,*area;\n    double *xp,*yp,*zp;\n\n    fclaw2d_clawpatch_grid_data(domain,this_patch,&mx,&my,&mbc,\n                                &xlower,&ylower,&dx,&dy);\n\n    fclaw2d_clawpatch_metric_data(domain,this_patch,&xp,&yp,&zp,\n                                  &xd,&yd,&zd,&area);\n\n    if (user->claw_version == 4)\n    {\n        fc2d_clawpack46_define_auxarray(domain,this_patch);\n        fc2d_clawpack46_aux_data(domain,this_patch,&aux,&maux);\n        USER46_SETAUX_MANIFOLD(&mbc,&mx,&my,&xlower,&ylower,\n                               &dx,&dy,&maux,aux,&this_block_idx,\n                               xd,yd,zd,area);\n    }\n    else if (user->claw_version == 5)\n    {\n        fc2d_clawpack5_define_auxarray(domain,this_patch);\n        fc2d_clawpack5_aux_data(domain,this_patch,&aux,&maux);\n        USER5_SETAUX_MANIFOLD(&mbc,&mx,&my,&xlower,&ylower,\n                              &dx,&dy,&maux,aux,&this_block_idx,\n                              xd,yd,zd,area);\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\n#include <plugins\/SceneCreator\/SceneCreator.h>\n\n#include <sofa\/helper\/ArgumentParser.h>\n#include <sofa\/core\/ExecParams.h>\n#include <sofa\/simulation\/tree\/TreeSimulation.h>\n#include <sofa\/simulation\/common\/Node.h>\n#include <sofa\/simulation\/common\/DeleteVisitor.h>\n\n\n#include <sofa\/gui\/GUIManager.h>\n#include <sofa\/gui\/Main.h>\n#include <sofa\/helper\/system\/FileRepository.h>\n\n#include <sofa\/component\/collision\/MinProximityIntersection.h>\n#include <sofa\/component\/constraintset\/LMConstraintSolver.h>\n#include <sofa\/component\/odesolver\/EulerImplicitSolver.h>\n#include <sofa\/component\/linearsolver\/CGLinearSolver.h>\n#include <sofa\/core\/CollisionModel.h>\n\n\/\/Using double by default, if you have SOFA_FLOAT in use in you sofa-default.cfg, then it will be FLOAT.\n#include <sofa\/component\/typedef\/Sofa_typedef.h>\n\/\/ ---------------------------------------------------------------------\n\/\/ ---\n\/\/ ---------------------------------------------------------------------\nusing namespace sofa::simulation;\nusing namespace sofa::component::container;\nusing namespace sofa::component::topology;\ntypedef sofa::component::linearsolver::CGLinearSolver< sofa::component::linearsolver::GraphScatteredMatrix, sofa::component::linearsolver::GraphScatteredVector> CGLinearSolverGraph;\n\nconst std::string colors[7]= {\"red\",\"green\",\"blue\",\"cyan\",\"magenta\",\"yellow\",\"white\"};\n\nSReal convertDegreeToRadian(const SReal& angle)\n{\n    const SReal pi=3.14159265;\n    return angle*pi\/180.0;\n}\n\nNode::SPtr createCard(Node::SPtr  parent, const Coord3& position, const Coord3& rotation)\n{\n    const std::string visualModel=\"mesh\/card.obj\";\n    const std::string collisionModel=\"mesh\/cardCollision.obj\";\n    const std::string inertiaMatrix=\"BehaviorModels\/card.rigid\";\n    static int colorIdx=0;\n\n    std::vector<std::string> modelTypes;\n    modelTypes.push_back(\"Triangle\");\n    modelTypes.push_back(\"Line\");\n    modelTypes.push_back(\"Point\");\n\n    Node::SPtr  card = sofa::modeling::CreateEulerSolverNode(parent,\"Rigid\",\"Implicit\");\n\n    sofa::component::odesolver::EulerImplicitSolver *odeSolver; card->get(odeSolver);\n    odeSolver->f_rayleighStiffness.setValue(0.1);\n    odeSolver->f_rayleighMass.setValue(0.1);\n\n    CGLinearSolverGraph *cgLinearSolver; card->get(cgLinearSolver);\n    cgLinearSolver->f_maxIter.setValue(15);\n    cgLinearSolver->f_tolerance.setValue(1e-5);\n    cgLinearSolver->f_smallDenominatorThreshold.setValue(1e-5);\n\n\n    sofa::component::constraintset::LMConstraintSolver::SPtr constraintSolver = sofa::core::objectmodel::New<sofa::component::constraintset::LMConstraintSolver>();\n    constraintSolver->constraintVel.setValue(true);\n    constraintSolver->constraintPos.setValue(true);\n    constraintSolver->numIterations.setValue(25);\n\n    card->addObject(constraintSolver);\n\n    MechanicalObjectRigid3::SPtr dofRigid = sofa::core::objectmodel::New<MechanicalObjectRigid3>(); dofRigid->setName(\"Rigid Object\");\n    dofRigid->setTranslation(position[0],position[1],position[2]);\n    dofRigid->setRotation(rotation[0],rotation[1],rotation[2]);\n    card->addObject(dofRigid);\n\n    UniformMassRigid3::SPtr uniMassRigid = sofa::core::objectmodel::New<UniformMassRigid3>();\n    uniMassRigid->setTotalMass(0.5);\n    uniMassRigid->setFileMass(inertiaMatrix);\n    card->addObject(uniMassRigid);\n\n    \/\/Node VISUAL\n    Node::SPtr  RigidVisualNode = sofa::modeling::CreateVisualNodeRigid(card, dofRigid.get(), visualModel,colors[(colorIdx++)%7]);\n\n    \/\/Node COLLISION\n    Node::SPtr  RigidCollisionNode = sofa::modeling::CreateCollisionNodeRigid(card, dofRigid.get(),collisionModel,modelTypes);\n\n    return card;\n}\n\nstd::pair<Node::SPtr , Node::SPtr  > create2Cards(Node::SPtr  parent, const Coord3& globalPosition, SReal distanceInBetween=SReal(0.1), SReal angle=SReal(15.0))\n{\n    \/\/We assume the card has a 2 unit length, centered in (0,0,0)\n    const SReal displacement=sin(convertDegreeToRadian(angle));\n    const Coord3 separation=Coord3(displacement+distanceInBetween,0,0);\n\n    \/\/************************************\n    \/\/Left Rigid Card\n    const Coord3 positionLeft=globalPosition + separation;\n    const Coord3 rotationLeft(0,0,angle);\n    Node::SPtr  leftCard = createCard(parent, positionLeft, rotationLeft);\n\n    \/\/************************************\n    \/\/Right Rigid Card\n    const Coord3 positionRight=globalPosition - separation;\n    const Coord3 rotationRight(0,0,-angle);\n    Node::SPtr  rightCard = createCard(parent, positionRight, rotationRight);\n\n    return std::make_pair(leftCard, rightCard);\n}\n\nNode::SPtr createHouseOfCards(Node::SPtr root,  unsigned int size, SReal distanceInBetween=SReal(0.1), SReal angle=SReal(15.0))\n{\n\n    \/\/Elements of the scene\n    \/\/------------------------------------\n    Node::SPtr  houseOfCards = root;\n\n\n    \/\/Space between two levels of the house of cards\n    const SReal space=0.75;\n    \/\/Size of a card\n    const SReal sizeCard=2;\n    \/\/overlap of the cards\n    const SReal factor=0.95;\n    const SReal distanceH=sizeCard*factor;\n    const SReal distanceV=sizeCard*cos(convertDegreeToRadian(angle))+space;\n\n    for (unsigned int i=0; i<size; ++i)\n    {\n\n        \/\/Create the 2Cards\n        for (unsigned int j=0; j<=i; ++j)\n        {\n            Coord3 position=Coord3((i+j)*(distanceH)*0.5,\n                    (i-j)*(distanceV),\n                    0);\n            const std::pair<Node::SPtr , Node::SPtr > &cards=create2Cards(houseOfCards, position,distanceInBetween, angle);\n            std::ostringstream out;\n            out << \"Card[\"<< i << \"|\" << j << \"]\";\n            cards.first->setName(\"Left\"+out.str());\n            cards.second->setName(\"Right\"+out.str());\n        }\n\n        \/\/Create the support for the cards\n        const Coord3 initPosition(0,sizeCard*0.5,0);\n        const Coord3 supportRotation(0,0,90);\n        for (unsigned int j=0; j<i; ++j)\n        {\n            Coord3 position((i+j)*distanceH*0.5,\n                    (i-j)*distanceV-space*0.5+distanceInBetween*(j%2),\n                    0);\n            Node::SPtr supportCard=createCard(houseOfCards, position-initPosition, supportRotation);\n            std::ostringstream out;\n            out << \"SupportCard[\"<< i << \"|\" << j << \"]\";\n            supportCard->setName(out.str());\n        }\n    }\n\n\n\n    return root;\n}\n\n\n\nint main(int argc, char** argv)\n{\n#ifndef WIN32\n    \/\/ Reset local settings to make sure that floating-point values are interpreted correctly\n    setlocale(LC_ALL,\"C\");\n    setlocale(LC_NUMERIC,\"C\");\n#endif\n\n    glutInit(&argc,argv);\n\n    sofa::gui::initMain();\n\n    unsigned int sizeHouseOfCards=4;\n    SReal angle=20.0;\n    SReal distanceInBetween=0.1;\n    SReal friction=0.8;\n    SReal contactDistance=0.03;\n    std::string gui = \"\";\n\n\n    std::string gui_help = \"choose the UI (\";\n    gui_help += sofa::gui::GUIManager::ListSupportedGUI('|');\n    gui_help += \")\";\n\n    sofa::helper::parse(\"This is a SOFA application. Here are the command line arguments\")\n    .option(&sizeHouseOfCards,'l',\"level\",\"number of level of the house of cards\")\n    .option(&angle,'a',\"angle\",\"angle formed by two cards\")\n    .option(&distanceInBetween,'d',\"distance\",\"distance between two cards\")\n    .option(&friction,'f',\"friction\",\"friction coeff\")\n    .option(&contactDistance,'c',\"contactDistance\",\"contact distance\")\n    .option(&gui,'g',\"gui\",gui_help.c_str())\n    (argc,argv);\n\n\n    sofa::simulation::setSimulation(new sofa::simulation::tree::TreeSimulation());\n\n    \/\/ The graph root node\n    Node::SPtr root = sofa::modeling::CreateRootWithCollisionPipeline(\"distanceLMConstraint\");\n    root->setGravity( Coord3(0,-10,0) );\n    root->setDt(0.001);\n\n    sofa::component::collision::MinProximityIntersection *intersection;\n    root->get(intersection, sofa::core::objectmodel::BaseContext::SearchDown);\n    intersection->alarmDistance.setValue(contactDistance);\n    intersection->contactDistance.setValue(contactDistance*0.5);\n\n    \/\/************************************\n    \/\/Floor\n    Node::SPtr  torusFixed = sofa::modeling::CreateObstacle(root.get(),\"mesh\/floor.obj\", \"mesh\/floor.obj\", \"gray\");\n\n    \/\/Add the objects\n    createHouseOfCards(root.get(),sizeHouseOfCards,distanceInBetween, angle);\n\n\n    const SReal contactFriction=sqrt(friction);\n    sofa::helper::vector< sofa::core::CollisionModel* > listCollisionModels;\n    root->getTreeObjects<sofa::core::CollisionModel>(&listCollisionModels);\n    for (unsigned int i=0; i<listCollisionModels.size(); ++i) listCollisionModels[i]->setContactFriction(contactFriction);\n    root->setAnimate(false);\n\n    \/\/=======================================\n    \/\/ Export the scene to file\n    const std::string fileName=\"HouseOfCards.xml\";\n    sofa::simulation::getSimulation()->exportXML(root.get(),fileName.c_str());\n\n    \/\/=======================================\n    \/\/ Destroy created scene: step needed, as I can't get rid of the locales (the mass can't init correctly as 0.1 is not considered as a floating point).\n    sofa::simulation::DeleteVisitor deleteScene(sofa::core::ExecParams::defaultInstance() );\n    root->execute(deleteScene);\n    root.reset();\n\n    \/\/=======================================\n    \/\/ Create the GUI\n    if (int err=sofa::gui::GUIManager::Init(argv[0],gui.c_str()))\n        return err;\n\n    if (int err=sofa::gui::GUIManager::createGUI(NULL))\n        return err;\n\n    sofa::gui::GUIManager::SetDimension(800,600);\n    \/\/=======================================\n    \/\/ Load the Scene\n\n    sofa::simulation::Node::SPtr groot = sofa::core::objectmodel::SPtr_dynamic_cast<sofa::simulation::Node>( sofa::simulation::getSimulation()->load(fileName.c_str()));\n    if (groot==NULL)\n    {\n        groot = sofa::simulation::getSimulation()->createNewGraph(\"\");\n    }\n\n    sofa::simulation::getSimulation()->init(groot.get());\n    sofa::gui::GUIManager::SetScene(groot,fileName.c_str());\n\n\n    \/\/=======================================\n    \/\/ Run the main loop\n    if (int err=sofa::gui::GUIManager::MainLoop(groot,fileName.c_str()))\n        return err;\n    Node* ggroot =  sofa::gui::GUIManager::CurrentSimulation();\n\n\n    if (ggroot!=NULL) sofa::simulation::getSimulation()->unload(groot);\n    return 0;\n}\n<commit_msg>r11131\/sofa : push bc3ccbf..209ea8f<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\n#include <plugins\/SceneCreator\/SceneCreator.h>\n\n#include <sofa\/helper\/ArgumentParser.h>\n#include <sofa\/core\/ExecParams.h>\n#include <sofa\/simulation\/tree\/TreeSimulation.h>\n#include <sofa\/simulation\/common\/Node.h>\n#include <sofa\/simulation\/common\/DeleteVisitor.h>\n\n\n#include <sofa\/gui\/GUIManager.h>\n#include <sofa\/gui\/Main.h>\n#include <sofa\/helper\/system\/FileRepository.h>\n\n#include <sofa\/component\/collision\/MinProximityIntersection.h>\n#include <sofa\/component\/constraintset\/LMConstraintSolver.h>\n#include <sofa\/component\/odesolver\/EulerImplicitSolver.h>\n#include <sofa\/component\/linearsolver\/CGLinearSolver.h>\n#include <sofa\/core\/CollisionModel.h>\n\n\/\/Using double by default, if you have SOFA_FLOAT in use in you sofa-default.cfg, then it will be FLOAT.\n#include <sofa\/component\/typedef\/Sofa_typedef.h>\n\/\/ ---------------------------------------------------------------------\n\/\/ ---\n\/\/ ---------------------------------------------------------------------\nusing namespace sofa::simulation;\nusing namespace sofa::component::container;\nusing namespace sofa::component::topology;\ntypedef sofa::component::linearsolver::CGLinearSolver< sofa::component::linearsolver::GraphScatteredMatrix, sofa::component::linearsolver::GraphScatteredVector> CGLinearSolverGraph;\n\nconst std::string colors[7]= {\"red\",\"green\",\"blue\",\"cyan\",\"magenta\",\"yellow\",\"white\"};\n\nSReal convertDegreeToRadian(const SReal& angle)\n{\n    const SReal pi=3.14159265;\n    return angle*pi\/180.0;\n}\n\nNode::SPtr createCard(Node::SPtr  parent, const Coord3& position, const Coord3& rotation)\n{\n    const std::string visualModel=\"mesh\/card.obj\";\n    const std::string collisionModel=\"mesh\/cardCollision.obj\";\n    const std::string inertiaMatrix=\"BehaviorModels\/card.rigid\";\n    static int colorIdx=0;\n\n    std::vector<std::string> modelTypes;\n    modelTypes.push_back(\"Triangle\");\n    modelTypes.push_back(\"Line\");\n    modelTypes.push_back(\"Point\");\n\n    Node::SPtr  card = sofa::modeling::createEulerSolverNode(parent,\"Rigid\",\"Implicit\");\n\n    sofa::component::odesolver::EulerImplicitSolver *odeSolver; card->get(odeSolver);\n    odeSolver->f_rayleighStiffness.setValue(0.1);\n    odeSolver->f_rayleighMass.setValue(0.1);\n\n    CGLinearSolverGraph *cgLinearSolver; card->get(cgLinearSolver);\n    cgLinearSolver->f_maxIter.setValue(15);\n    cgLinearSolver->f_tolerance.setValue(1e-5);\n    cgLinearSolver->f_smallDenominatorThreshold.setValue(1e-5);\n\n\n    sofa::component::constraintset::LMConstraintSolver::SPtr constraintSolver = sofa::core::objectmodel::New<sofa::component::constraintset::LMConstraintSolver>();\n    constraintSolver->constraintVel.setValue(true);\n    constraintSolver->constraintPos.setValue(true);\n    constraintSolver->numIterations.setValue(25);\n\n    card->addObject(constraintSolver);\n\n    MechanicalObjectRigid3::SPtr dofRigid = sofa::core::objectmodel::New<MechanicalObjectRigid3>(); dofRigid->setName(\"Rigid Object\");\n    dofRigid->setTranslation(position[0],position[1],position[2]);\n    dofRigid->setRotation(rotation[0],rotation[1],rotation[2]);\n    card->addObject(dofRigid);\n\n    UniformMassRigid3::SPtr uniMassRigid = sofa::core::objectmodel::New<UniformMassRigid3>();\n    uniMassRigid->setTotalMass(0.5);\n    uniMassRigid->setFileMass(inertiaMatrix);\n    card->addObject(uniMassRigid);\n\n    \/\/Node VISUAL\n    Node::SPtr  RigidVisualNode = sofa::modeling::createVisualNodeRigid(card, dofRigid.get(), visualModel,colors[(colorIdx++)%7]);\n\n    \/\/Node COLLISION\n    Node::SPtr  RigidCollisionNode = sofa::modeling::createCollisionNodeRigid(card, dofRigid.get(),collisionModel,modelTypes);\n\n    return card;\n}\n\nstd::pair<Node::SPtr , Node::SPtr  > create2Cards(Node::SPtr  parent, const Coord3& globalPosition, SReal distanceInBetween=SReal(0.1), SReal angle=SReal(15.0))\n{\n    \/\/We assume the card has a 2 unit length, centered in (0,0,0)\n    const SReal displacement=sin(convertDegreeToRadian(angle));\n    const Coord3 separation=Coord3(displacement+distanceInBetween,0,0);\n\n    \/\/************************************\n    \/\/Left Rigid Card\n    const Coord3 positionLeft=globalPosition + separation;\n    const Coord3 rotationLeft(0,0,angle);\n    Node::SPtr  leftCard = createCard(parent, positionLeft, rotationLeft);\n\n    \/\/************************************\n    \/\/Right Rigid Card\n    const Coord3 positionRight=globalPosition - separation;\n    const Coord3 rotationRight(0,0,-angle);\n    Node::SPtr  rightCard = createCard(parent, positionRight, rotationRight);\n\n    return std::make_pair(leftCard, rightCard);\n}\n\nNode::SPtr createHouseOfCards(Node::SPtr root,  unsigned int size, SReal distanceInBetween=SReal(0.1), SReal angle=SReal(15.0))\n{\n\n    \/\/Elements of the scene\n    \/\/------------------------------------\n    Node::SPtr  houseOfCards = root;\n\n\n    \/\/Space between two levels of the house of cards\n    const SReal space=0.75;\n    \/\/Size of a card\n    const SReal sizeCard=2;\n    \/\/overlap of the cards\n    const SReal factor=0.95;\n    const SReal distanceH=sizeCard*factor;\n    const SReal distanceV=sizeCard*cos(convertDegreeToRadian(angle))+space;\n\n    for (unsigned int i=0; i<size; ++i)\n    {\n\n        \/\/Create the 2Cards\n        for (unsigned int j=0; j<=i; ++j)\n        {\n            Coord3 position=Coord3((i+j)*(distanceH)*0.5,\n                    (i-j)*(distanceV),\n                    0);\n            const std::pair<Node::SPtr , Node::SPtr > &cards=create2Cards(houseOfCards, position,distanceInBetween, angle);\n            std::ostringstream out;\n            out << \"Card[\"<< i << \"|\" << j << \"]\";\n            cards.first->setName(\"Left\"+out.str());\n            cards.second->setName(\"Right\"+out.str());\n        }\n\n        \/\/Create the support for the cards\n        const Coord3 initPosition(0,sizeCard*0.5,0);\n        const Coord3 supportRotation(0,0,90);\n        for (unsigned int j=0; j<i; ++j)\n        {\n            Coord3 position((i+j)*distanceH*0.5,\n                    (i-j)*distanceV-space*0.5+distanceInBetween*(j%2),\n                    0);\n            Node::SPtr supportCard=createCard(houseOfCards, position-initPosition, supportRotation);\n            std::ostringstream out;\n            out << \"SupportCard[\"<< i << \"|\" << j << \"]\";\n            supportCard->setName(out.str());\n        }\n    }\n\n\n\n    return root;\n}\n\n\n\nint main(int argc, char** argv)\n{\n#ifndef WIN32\n    \/\/ Reset local settings to make sure that floating-point values are interpreted correctly\n    setlocale(LC_ALL,\"C\");\n    setlocale(LC_NUMERIC,\"C\");\n#endif\n\n    glutInit(&argc,argv);\n\n    sofa::gui::initMain();\n\n    unsigned int sizeHouseOfCards=4;\n    SReal angle=20.0;\n    SReal distanceInBetween=0.1;\n    SReal friction=0.8;\n    SReal contactDistance=0.03;\n    std::string gui = \"\";\n\n\n    std::string gui_help = \"choose the UI (\";\n    gui_help += sofa::gui::GUIManager::ListSupportedGUI('|');\n    gui_help += \")\";\n\n    sofa::helper::parse(\"This is a SOFA application. Here are the command line arguments\")\n    .option(&sizeHouseOfCards,'l',\"level\",\"number of level of the house of cards\")\n    .option(&angle,'a',\"angle\",\"angle formed by two cards\")\n    .option(&distanceInBetween,'d',\"distance\",\"distance between two cards\")\n    .option(&friction,'f',\"friction\",\"friction coeff\")\n    .option(&contactDistance,'c',\"contactDistance\",\"contact distance\")\n    .option(&gui,'g',\"gui\",gui_help.c_str())\n    (argc,argv);\n\n\n    sofa::simulation::setSimulation(new sofa::simulation::tree::TreeSimulation());\n\n    \/\/ The graph root node\n    Node::SPtr root = sofa::modeling::createRootWithCollisionPipeline(\"distanceLMConstraint\");\n    root->setGravity( Coord3(0,-10,0) );\n    root->setDt(0.001);\n\n    sofa::component::collision::MinProximityIntersection *intersection;\n    root->get(intersection, sofa::core::objectmodel::BaseContext::SearchDown);\n    intersection->alarmDistance.setValue(contactDistance);\n    intersection->contactDistance.setValue(contactDistance*0.5);\n\n    \/\/************************************\n    \/\/Floor\n    Node::SPtr  torusFixed = sofa::modeling::createObstacle(root.get(),\"mesh\/floor.obj\", \"mesh\/floor.obj\", \"gray\");\n\n    \/\/Add the objects\n    createHouseOfCards(root.get(),sizeHouseOfCards,distanceInBetween, angle);\n\n\n    const SReal contactFriction=sqrt(friction);\n    sofa::helper::vector< sofa::core::CollisionModel* > listCollisionModels;\n    root->getTreeObjects<sofa::core::CollisionModel>(&listCollisionModels);\n    for (unsigned int i=0; i<listCollisionModels.size(); ++i) listCollisionModels[i]->setContactFriction(contactFriction);\n    root->setAnimate(false);\n\n    \/\/=======================================\n    \/\/ Export the scene to file\n    const std::string fileName=\"HouseOfCards.xml\";\n    sofa::simulation::getSimulation()->exportXML(root.get(),fileName.c_str());\n\n    \/\/=======================================\n    \/\/ Destroy created scene: step needed, as I can't get rid of the locales (the mass can't init correctly as 0.1 is not considered as a floating point).\n    sofa::simulation::DeleteVisitor deleteScene(sofa::core::ExecParams::defaultInstance() );\n    root->execute(deleteScene);\n    root.reset();\n\n    \/\/=======================================\n    \/\/ Create the GUI\n    if (int err=sofa::gui::GUIManager::Init(argv[0],gui.c_str()))\n        return err;\n\n    if (int err=sofa::gui::GUIManager::createGUI(NULL))\n        return err;\n\n    sofa::gui::GUIManager::SetDimension(800,600);\n    \/\/=======================================\n    \/\/ Load the Scene\n\n    sofa::simulation::Node::SPtr groot = sofa::core::objectmodel::SPtr_dynamic_cast<sofa::simulation::Node>( sofa::simulation::getSimulation()->load(fileName.c_str()));\n    if (groot==NULL)\n    {\n        groot = sofa::simulation::getSimulation()->createNewGraph(\"\");\n    }\n\n    sofa::simulation::getSimulation()->init(groot.get());\n    sofa::gui::GUIManager::SetScene(groot,fileName.c_str());\n\n\n    \/\/=======================================\n    \/\/ Run the main loop\n    if (int err=sofa::gui::GUIManager::MainLoop(groot,fileName.c_str()))\n        return err;\n    Node* ggroot =  sofa::gui::GUIManager::CurrentSimulation();\n\n\n    if (ggroot!=NULL) sofa::simulation::getSimulation()->unload(groot);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ #include <possumwood_sdk\/node_implementation.h>\n\n\/\/ #include \"possumwood_sdk\/datatypes\/enum.h\"\n\n\/\/ #include \"datatypes\/meshes.h\"\n\n\/\/ #include <CGAL\/Polygon_mesh_processing\/compute_normal.h>\n\n\/\/ namespace {\n\n\/\/ using possumwood::Meshes;\n\/\/ using possumwood::CGALPolyhedron;\n\n\/\/ dependency_graph::InAttr<possumwood::Enum> a_mode;\n\/\/ dependency_graph::InAttr<Meshes> a_inMeshes;\n\/\/ dependency_graph::OutAttr<Meshes> a_outMesh;\n\n\/\/ \/\/ typename CGAL::Kernel_traits<\n\/\/ \/\/   typename boost::property_traits<\n\/\/ \/\/     typename boost::property_map<Mesh, CGAL::vertex_point_t>::type>::value_type>::Kernel Kernel;\n\n\/\/ namespace {\n\/\/ \tstruct FakeKernel {\n\/\/ \t\ttypedef float FT;\n\n\/\/ \t\ttypedef possumwood::CGALKernel::Point_3 Point_3;\n\n\/\/ \t\tstruct Vector_3 {\n\/\/ \t\t\tVector_3(float x, float y, float z) : data{{x,y,z}} {\n\/\/ \t\t\t}\n\n\/\/ \t\t\tVector_3(const std::array<float, 3>& arr) : data(arr) {\n\/\/ \t\t\t}\n\n\/\/ \t\t\tVector_3(CGAL::Null_vector) : data{{0,0,0}} {\n\/\/ \t\t\t}\n\n\/\/ \t\t\tfloat& operator[](std::size_t index) {\n\/\/ \t\t\t\treturn data[index];\n\/\/ \t\t\t}\n\n\/\/ \t\t\tconst float& operator[](std::size_t index) const {\n\/\/ \t\t\t\treturn data[index];\n\/\/ \t\t\t}\n\n\/\/ \t\t\toperator const std::array<float, 3>& () const {\n\/\/ \t\t\t\treturn data;\n\/\/ \t\t\t}\n\n\/\/ \t\t\tstd::array<float, 3> data;\n\/\/ \t\t};\n\n\/\/ \t\tstruct Equal_3 {\n\/\/ \t\t\tbool operator()(const Vector_3& p, CGAL::Null_vector) {\n\/\/ \t\t\t\treturn p[0] == 0 && p[1] == 0 && p[2] == 0;\n\/\/ \t\t\t}\n\/\/ \t\t};\n\n\/\/ \t\tauto construct_vector_3_object() const {\n\/\/ \t\t\tstruct Result {\n\/\/ \t\t\t\tVector_3 operator() (CGAL::Null_vector) {\n\/\/ \t\t\t\t\treturn Vector_3(CGAL::Null_vector());\n\/\/ \t\t\t\t}\n\n\/\/ \t\t\t\tVector_3 operator() (const Vector_3& val) {\n\/\/ \t\t\t\t\treturn val;\n\/\/ \t\t\t\t}\n\n\/\/ \t\t\t\tVector_3 operator() (const Point_3& p1, const Point_3& p2) {\n\/\/ \t\t\t\t\treturn Vector_3(p1[0]-p2[0], p1[1]-p2[1], p1[2]-p2[2]);\n\/\/ \t\t\t\t}\n\/\/ \t\t\t};\n\n\/\/ \t\t\treturn Result();\n\/\/ \t\t}\n\n\/\/ \t\tauto construct_sum_of_vectors_3_object() const {\n\/\/ \t\t\treturn [](const Vector_3& p1, const Vector_3& p2) {\n\/\/ \t\t\t\treturn std::array<float, 3>{{p1[0]+p2[0], p1[1]+p2[1], p1[2]+p2[2]}};\n\/\/ \t\t\t};\n\/\/ \t\t}\n\n\/\/ \t\tauto construct_divided_vector_3_object() const {\n\/\/ \t\t\treturn [](const Vector_3& p1, float v) {\n\/\/ \t\t\t\treturn std::array<float, 3>{{p1[0]\/v, p1[1]\/v, p1[2]\/v}};\n\/\/ \t\t\t};\n\/\/ \t\t}\n\n\/\/ \t\tauto construct_scaled_vector_3_object() const {\n\/\/ \t\t\treturn [](const Vector_3& p1, float s) {\n\/\/ \t\t\t\treturn std::array<float, 3>{{p1[0]*s, p1[1]*s, p1[2]*s}};\n\/\/ \t\t\t};\n\/\/ \t\t}\n\n\/\/ \t\tauto compute_squared_length_3_object() const {\n\/\/ \t\t\treturn [](const Vector_3& v1) {\n\/\/ \t\t\t\treturn v1[0]*v1[0] + v1[1]*v1[1] + v1[2]*v1[2];\n\/\/ \t\t\t};\n\/\/ \t\t}\n\n\/\/ \t\tauto construct_cross_product_vector_3_object() const {\n\/\/ \t\t\treturn [](const Vector_3& p1, const Vector_3& p2) {\n\/\/ \t\t\t\treturn std::array<float, 3>{{\n\/\/ \t\t\t\t\tp1[1]*p2[2] - p1[2]*p2[1],\n\/\/ \t\t\t\t\tp1[2]*p2[0] - p1[0]*p2[2],\n\/\/ \t\t\t\t\tp1[0]*p2[1] - p1[1]*p2[0]\n\/\/ \t\t\t\t}};\n\/\/ \t\t\t};\n\/\/ \t\t}\n\/\/ \t};\n\/\/ }\n\n\/\/ dependency_graph::State compute(dependency_graph::Values& data) {\n\/\/ \tconst possumwood::Enum mode = data.get(a_mode);\n\/\/ \tconst Meshes& inMeshes = data.get(a_inMeshes);\n\n\/\/ \tMeshes result;\n\/\/ \tfor(auto& inMesh : inMeshes) {\n\/\/ \t\tstd::unique_ptr<CGALPolyhedron> mesh(new CGALPolyhedron(inMesh.mesh()));\n\n\/\/ \t\t\/\/ remove any existing normals\n\/\/ \t\t{\n\/\/ \t\t\tauto vertNormals = mesh->property_map<CGALPolyhedron::Vertex_index, std::array<float, 3>>(\"vec3:normals\");\n\/\/ \t\t\tif(vertNormals.second)\n\/\/ \t\t\t\tmesh->remove_property_map(vertNormals.first);\n\n\/\/ \t\t\tauto faceNormals = mesh->property_map<CGALPolyhedron::Face_index, std::array<float, 3>>(\"vec3:normals\");\n\/\/ \t\t\tif(faceNormals.second)\n\/\/ \t\t\t\tmesh->remove_property_map(faceNormals.first);\n\/\/ \t\t}\n\n\/\/ \t\t\/\/ request for vertex normals\n\/\/ \t\tif(mode.value() == \"Per-vertex normals\") {\n\/\/ \t\t\tauto vertNormals = mesh->add_property_map<CGALPolyhedron::Vertex_index, std::array<float, 3>>(\"vec3:normals\");\n\/\/ \t\t\tCGAL::Polygon_mesh_processing::compute_vertex_normals(*mesh, vertNormals.first,\n\/\/ \t\t\t\tCGAL::Polygon_mesh_processing::parameters::geom_traits(FakeKernel()));\n\/\/ \t\t}\n\n\/\/ \t\t\/\/ request for half-edge (polygon-vertex) normals\n\/\/ \t\telse if(mode.value() == \"Per-face normals\") {\n\/\/ \t\t\tauto faceNormals = mesh->add_property_map<CGALPolyhedron::Face_index, std::array<float, 3>>(\"vec3:normals\");\n\/\/ \t\t\tCGAL::Polygon_mesh_processing::compute_face_normals(*mesh, faceNormals.first,\n\/\/ \t\t\t\tCGAL::Polygon_mesh_processing::parameters::geom_traits(FakeKernel()));\n\/\/ \t\t}\n\n\/\/ \t\tresult.addMesh(inMesh.name(), std::move(mesh));\n\/\/ \t}\n\n\/\/ \tdata.set(a_outMesh, result);\n\n\/\/ \treturn dependency_graph::State();\n\/\/ }\n\n\/\/ void init(possumwood::Metadata& meta) {\n\/\/ \tmeta.addAttribute(a_mode, \"mode\",\n\/\/ \t                  possumwood::Enum({\"Per-face normals\", \"Per-vertex normals\"}));\n\/\/ \tmeta.addAttribute(a_inMeshes, \"input\");\n\/\/ \tmeta.addAttribute(a_outMesh, \"output\");\n\n\/\/ \tmeta.addInfluence(a_mode, a_outMesh);\n\/\/ \tmeta.addInfluence(a_inMeshes, a_outMesh);\n\n\/\/ \tmeta.setCompute(compute);\n\/\/ }\n\n\/\/ possumwood::NodeImplementation s_impl(\"cgal\/normals_generator\", init);\n\/\/ }\n<commit_msg>Changed the normals generator to work correctly with Properties<commit_after>#include <possumwood_sdk\/node_implementation.h>\n\n#include \"possumwood_sdk\/datatypes\/enum.h\"\n\n#include \"datatypes\/meshes.h\"\n\n#include <CGAL\/Polygon_mesh_processing\/compute_normal.h>\n\nnamespace {\n\nusing possumwood::Meshes;\nusing possumwood::CGALPolyhedron;\n\ndependency_graph::InAttr<possumwood::Enum> a_mode;\ndependency_graph::InAttr<Meshes> a_inMeshes;\ndependency_graph::OutAttr<Meshes> a_outMesh;\n\nnamespace {\n\tstruct FakeKernel {\n\t\ttypedef float FT;\n\n\t\ttypedef possumwood::CGALKernel::Point_3 Point_3;\n\n\t\tstruct Vector_3 {\n\t\t\tVector_3(float x, float y, float z) : data{{x,y,z}} {\n\t\t\t}\n\n\t\t\tVector_3(const std::array<float, 3>& arr) : data(arr) {\n\t\t\t}\n\n\t\t\tVector_3(CGAL::Null_vector) : data{{0,0,0}} {\n\t\t\t}\n\n\t\t\tfloat& operator[](std::size_t index) {\n\t\t\t\treturn data[index];\n\t\t\t}\n\n\t\t\tconst float& operator[](std::size_t index) const {\n\t\t\t\treturn data[index];\n\t\t\t}\n\n\t\t\toperator const std::array<float, 3>& () const {\n\t\t\t\treturn data;\n\t\t\t}\n\n\t\t\tstd::array<float, 3> data;\n\t\t};\n\n\t\tstruct Equal_3 {\n\t\t\tbool operator()(const Vector_3& p, CGAL::Null_vector) {\n\t\t\t\treturn p[0] == 0 && p[1] == 0 && p[2] == 0;\n\t\t\t}\n\t\t};\n\n\t\tauto construct_vector_3_object() const {\n\t\t\tstruct Result {\n\t\t\t\tVector_3 operator() (CGAL::Null_vector) {\n\t\t\t\t\treturn Vector_3(CGAL::Null_vector());\n\t\t\t\t}\n\n\t\t\t\tVector_3 operator() (const Vector_3& val) {\n\t\t\t\t\treturn val;\n\t\t\t\t}\n\n\t\t\t\tVector_3 operator() (const Point_3& p1, const Point_3& p2) {\n\t\t\t\t\treturn Vector_3(p1[0]-p2[0], p1[1]-p2[1], p1[2]-p2[2]);\n\t\t\t\t}\n\t\t\t};\n\n\t\t\treturn Result();\n\t\t}\n\n\t\tauto construct_sum_of_vectors_3_object() const {\n\t\t\treturn [](const Vector_3& p1, const Vector_3& p2) {\n\t\t\t\treturn std::array<float, 3>{{p1[0]+p2[0], p1[1]+p2[1], p1[2]+p2[2]}};\n\t\t\t};\n\t\t}\n\n\t\tauto construct_divided_vector_3_object() const {\n\t\t\treturn [](const Vector_3& p1, float v) {\n\t\t\t\treturn std::array<float, 3>{{p1[0]\/v, p1[1]\/v, p1[2]\/v}};\n\t\t\t};\n\t\t}\n\n\t\tauto construct_scaled_vector_3_object() const {\n\t\t\treturn [](const Vector_3& p1, float s) {\n\t\t\t\treturn std::array<float, 3>{{p1[0]*s, p1[1]*s, p1[2]*s}};\n\t\t\t};\n\t\t}\n\n\t\tauto compute_squared_length_3_object() const {\n\t\t\treturn [](const Vector_3& v1) {\n\t\t\t\treturn v1[0]*v1[0] + v1[1]*v1[1] + v1[2]*v1[2];\n\t\t\t};\n\t\t}\n\n\t\tauto construct_cross_product_vector_3_object() const {\n\t\t\treturn [](const Vector_3& p1, const Vector_3& p2) {\n\t\t\t\treturn std::array<float, 3>{{\n\t\t\t\t\tp1[1]*p2[2] - p1[2]*p2[1],\n\t\t\t\t\tp1[2]*p2[0] - p1[0]*p2[2],\n\t\t\t\t\tp1[0]*p2[1] - p1[1]*p2[0]\n\t\t\t\t}};\n\t\t\t};\n\t\t}\n\t};\n\n\ttemplate<typename PROPERTY, typename ITERATOR>\n\tvoid put(PROPERTY& prop, const ITERATOR& target, const FakeKernel::Vector_3& norm) {\n\t\tprop.set(target->property_key(), norm);\n\t}\n}\n\ndependency_graph::State compute(dependency_graph::Values& data) {\n\tconst possumwood::Enum mode = data.get(a_mode);\n\n\tMeshes result = data.get(a_inMeshes);\n\tfor(auto& mesh : result) {\n\t\t\/\/ request for vertex normals\n\t\tif(mode.value() == \"Per-vertex normals\") {\n\t\t\t\/\/ remove face normals, if they exist\n\t\t\tif(mesh.faceProperties().hasProperty(\"vec3:normals\"))\n\t\t\t\tmesh.faceProperties().removeProperty(\"vec3:normals\");\n\n\t\t\tauto& normals = mesh.vertexProperties().addProperty(\"vec3:normals\", std::array<float, 3>{{0,0,0}});\n\n\t\t\tCGAL::Polygon_mesh_processing::compute_vertex_normals(mesh.polyhedron(), normals,\n\t\t\t\tCGAL::Polygon_mesh_processing::parameters::geom_traits(FakeKernel()));\n\t\t}\n\n\t\t\/\/ request for face normals\n\t\telse if(mode.value() == \"Per-face normals\") {\n\t\t\t\/\/ remove vertex normals, if they exist\n\t\t\tif(mesh.vertexProperties().hasProperty(\"vec3:normals\"))\n\t\t\t\tmesh.vertexProperties().removeProperty(\"vec3:normals\");\n\n\t\t\tauto& normals = mesh.faceProperties().addProperty(\"vec3:normals\", std::array<float, 3>{{0,0,0}});\n\n\t\t\tCGAL::Polygon_mesh_processing::compute_face_normals(mesh.polyhedron(), normals,\n\t\t\t\tCGAL::Polygon_mesh_processing::parameters::geom_traits(FakeKernel()));\n\t\t}\n\t}\n\n\tdata.set(a_outMesh, result);\n\n\treturn dependency_graph::State();\n}\n\nvoid init(possumwood::Metadata& meta) {\n\tmeta.addAttribute(a_mode, \"mode\",\n\t                  possumwood::Enum({\"Per-face normals\", \"Per-vertex normals\"}));\n\tmeta.addAttribute(a_inMeshes, \"input\");\n\tmeta.addAttribute(a_outMesh, \"output\");\n\n\tmeta.addInfluence(a_mode, a_outMesh);\n\tmeta.addInfluence(a_inMeshes, a_outMesh);\n\n\tmeta.setCompute(compute);\n}\n\npossumwood::NodeImplementation s_impl(\"cgal\/normals_generator\", init);\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 \"gtest\/gtest.h\"\n\n#include <libcellml>\n\nTEST(ModelFlattening, importedUnits)\n{\n}\n<commit_msg>Add basic tests for flattening a model with a units import and a component import.<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 \"gtest\/gtest.h\"\n\n#include <libcellml>\n\n#include \"test_utils.h\"\n\nTEST(ModelFlattening, importedUnits)\n{\n    const std::string unitsDefiniitonModel =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\" xmlns:cellml=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\" xmlns:xlink=\\\"http:\/\/www.w3.org\/1999\/xlink\\\" name=\\\"units\\\">\\n\"\n        \"  <units name=\\\"ms\\\">\\n\"\n        \"    <unit units=\\\"second\\\" prefix=\\\"milli\\\"\/>\\n\"\n        \"  <\/units>\\n\"\n        \"<\/model>\\n\";\n\n    const std::string modelImportingUnits =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model name=\\\"importer_of_units\\\" xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\">\\n\"\n        \"  <import xlink:href=\\\"unitsdefinitions.xml\\\" xmlns:xlink=\\\"http:\/\/www.w3.org\/1999\/xlink\\\">\\n\"\n        \"    <units units_ref=\\\"ms\\\" name=\\\"my_ms\\\"\/>\\n\"\n        \"  <\/import>\\n\"\n        \"<\/model>\\n\";\n\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\" name=\\\"importer_of_units\\\">\\n\"\n        \"  <units name=\\\"my_ms\\\">\\n\"\n        \"    <unit prefix=\\\"milli\\\" units=\\\"second\\\"\/>\\n\"\n        \"  <\/units>\\n\"\n        \"<\/model>\\n\";\n\n    auto parser = libcellml::Parser::create();\n\n    auto modelWithUnitsImports = parser->parseModel(modelImportingUnits);\n    auto modelUnitsDefinitions = parser->parseModel(unitsDefiniitonModel);\n\n    EXPECT_TRUE(modelWithUnitsImports->hasUnresolvedImports());\n\n    auto units = modelWithUnitsImports->units(0);\n    auto importSource = units->importSource();\n    importSource->setModel(modelUnitsDefinitions);\n\n    EXPECT_FALSE(modelWithUnitsImports->hasUnresolvedImports());\n\n    modelWithUnitsImports->flatten();\n\n    auto printer = libcellml::Printer::create();\n\n    auto a = printer->printModel(modelWithUnitsImports);\n    EXPECT_EQ(e, a);\n}\n\nTEST(ModelFlattening, importedComponent)\n{\n    const std::string sineDefinitionModel =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?><model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\" xmlns:cellml=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\" xmlns:xlink=\\\"http:\/\/www.w3.org\/1999\/xlink\\\" name=\\\"sin\\\" id=\\\"sin\\\">\\n\"\n        \"  <component name=\\\"sin\\\" id=\\\"sin\\\">\\n\"\n        \"    <variable name=\\\"x\\\" units=\\\"dimensionless\\\" interface=\\\"public_and_private\\\"\/>\\n\"\n        \"    <variable id=\\\"sin\\\" units=\\\"dimensionless\\\" name=\\\"sin\\\" interface=\\\"public_and_private\\\"\/>\\n\"\n        \"    <math xmlns=\\\"http:\/\/www.w3.org\/1998\/Math\/MathML\\\">\\n\"\n        \"      <apply id=\\\"actual_sin\\\"><eq\/>\\n\"\n        \"        <ci>sin<\/ci>\\n\"\n        \"        <apply><sin\/>\\n\"\n        \"          <ci>x<\/ci>\\n\"\n        \"        <\/apply>\\n\"\n        \"      <\/apply>\\n\"\n        \"    <\/math>\\n\"\n        \"  <\/component>\\n\"\n        \"<\/model>\\n\";\n\n    const std::string modelImportingComponent =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\" xmlns:cellml=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\" xmlns:xlink=\\\"http:\/\/www.w3.org\/1999\/xlink\\\" name=\\\"sin_approximations_import\\\" id=\\\"sin_approximations_import\\\">\\n\"\n        \"  <import xlink:href=\\\"sin.xml\\\">\\n\"\n        \"    <component name=\\\"actual_sin\\\" component_ref=\\\"sin\\\"\/>\\n\"\n        \"  <\/import>\\n\"\n        \"  <component name=\\\"main\\\" id=\\\"main\\\"\/>\\n\"\n        \"  <encapsulation>\\n\"\n        \"    <component_ref component=\\\"main\\\">\\n\"\n        \"      <component_ref component=\\\"actual_sin\\\"\/>\\n\"\n        \"    <\/component_ref>\\n\"\n        \"  <\/encapsulation>\\n\"\n        \"<\/model>\\n\";\n\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\" name=\\\"sin_approximations_import\\\" id=\\\"sin_approximations_import\\\">\\n\"\n        \"  <component name=\\\"main\\\" id=\\\"main\\\"\/>\\n\"\n        \"  <component name=\\\"actual_sin\\\" id=\\\"sin\\\">\\n\"\n        \"    <variable name=\\\"x\\\" units=\\\"dimensionless\\\" interface=\\\"public_and_private\\\"\/>\\n\"\n        \"    <variable name=\\\"sin\\\" units=\\\"dimensionless\\\" interface=\\\"public_and_private\\\" id=\\\"sin\\\"\/>\\n\"\n        \"    <math xmlns=\\\"http:\/\/www.w3.org\/1998\/Math\/MathML\\\">\\n\"\n        \"      <apply id=\\\"actual_sin\\\"><eq\/>\\n\"\n        \"        <ci>sin<\/ci>\\n\"\n        \"        <apply><sin\/>\\n\"\n        \"          <ci>x<\/ci>\\n\"\n        \"        <\/apply>\\n\"\n        \"      <\/apply>\\n\"\n        \"    <\/math>\\n\"\n        \"  <\/component>\\n\"\n        \"  <encapsulation>\\n\"\n        \"    <component_ref component=\\\"main\\\">\\n\"\n        \"      <component_ref component=\\\"actual_sin\\\"\/>\\n\"\n        \"    <\/component_ref>\\n\"\n        \"  <\/encapsulation>\\n\"\n        \"<\/model>\\n\";\n\n    auto parser = libcellml::Parser::create();\n\n    auto modelWithComponentImport = parser->parseModel(modelImportingComponent);\n    auto modelSineDefinition = parser->parseModel(sineDefinitionModel);\n\n    EXPECT_TRUE(modelWithComponentImport->hasUnresolvedImports());\n\n    auto component = modelWithComponentImport->component(0)->component(0);\n    auto importSource = component->importSource();\n    importSource->setModel(modelSineDefinition);\n\n    EXPECT_TRUE(component->isImport());\n    EXPECT_FALSE(modelWithComponentImport->hasUnresolvedImports());\n\n    modelWithComponentImport->flatten();\n\n    auto printer = libcellml::Printer::create();\n\n    auto a = printer->printModel(modelWithComponentImport);\n    EXPECT_EQ(e, a);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *   Copyright (C) 2006 by FThauer FHammer   *\n *   f.thauer@web.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 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#include \"startsplash.h\"\n\n#include \"configfile.h\"\n#include \"mainwindowimpl.h\"\n\nStartSplash::StartSplash(mainWindowImpl *parent, ConfigFile *c)\n : QSplashScreen(parent), myW(parent), myConfig(c)\n{\n\t\n\tmyAppDataPath = QString::fromUtf8(myConfig->readConfigString(\"AppDataDir\").c_str());\n\n\tQFontDatabase::addApplicationFont (myAppDataPath +\"fonts\/c059013l.pfb\");\n\tQFontDatabase::addApplicationFont (myAppDataPath +\"fonts\/andybold.ttf\");\t\n\n\tlogo = myAppDataPath+\"gfx\/gui\/misc\/logoChip3D.png\";\n\n\n\tframeNo = 52;\n\topacityCounter = 13;\n\topacity = 1.0;\n\n\tQTimer *timer = new QTimer;\n\tconnect(timer, SIGNAL(timeout()), this, SLOT(nextAnimationFrame()));\n\ttimer->start(40);\n}\n\n\nStartSplash::~StartSplash()\n{\n}\n\nvoid StartSplash::nextAnimationFrame() {\n     \n\t++frameNo;\n     \tupdate();\n }\n\nvoid StartSplash::paintEvent(QPaintEvent * \/*event*\/) {\n\n\tQPainter painter(this);\n\n#ifdef _WIN32\n        QFont welcomeFont;\n        welcomeFont.setFamily(\"Times New Roman\");\n        welcomeFont.setPixelSize(42);        \n#else\n#ifdef __APPLE__ \n        QFont welcomeFont;\n        welcomeFont.setFamily(\"Andy MT Bold\");\n        welcomeFont.setPixelSize(42);\n#else\n        QFont welcomeFont;\n        welcomeFont.setFamily(\"Century Schoolbook L\");\n        welcomeFont.setPixelSize(35);\n#endif        \n#endif\n#ifdef __APPLE__\n        QFont haveFont;\n        haveFont.setFamily(\"Andy MT Bold\");\n        haveFont.setPixelSize(36);\n#else\n        QFont haveFont;\n        haveFont.setFamily(\"Andy MT\");\n        haveFont.setPixelSize(36);\n#endif\n\t\n\tQFont versionFont;\n\tversionFont.setFamily(\"Nimbus Sans L\");\n\tversionFont.setPixelSize(12);\n\n\tif(frameNo >= 52 && frameNo < 55) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t}\n\n\tif(frameNo >= 55 && frameNo < 57) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"W\");\n\t\t\n\t}\n\n\tif(frameNo >= 57 && frameNo < 59) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"We\");\n\t\t\n\t}\n\n\tif(frameNo >= 59 && frameNo < 61) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Wel\");\n\t\t\n\t}\n\n\tif(frameNo >= 61 && frameNo < 63) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welc\");\n\t\t\n\t}\n\n\tif(frameNo >= 63 && frameNo < 65) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welco\");\n\t\t\n\t}\n\n\tif(frameNo >= 65 && frameNo < 67) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcom\");\n\t\t\n\t}\n\n\tif(frameNo >= 67 && frameNo < 72) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome\");\n\t\t\n\t}\n\n\tif(frameNo >= 72 && frameNo < 74) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome t\");\n\t\t\n\t}\n\n\tif(frameNo >= 74 && frameNo < 79 ) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\t\t\n\t}\n\n\tif(frameNo >= 79 && frameNo < 91) {\n\/\/ \t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\n\t\t--opacityCounter;\n\/\/ \t\t\tstd::cout << opacity << \" \" << opacityCounter << \"\\n\";\n\t\topacity = 1.0\/opacityCounter;\n\/\/ \t\tstd::cout << opacity << \"\\n\";\n\t\tpainter.setOpacity(opacity);\n\t\tpainter.drawPixmap(150,85,100,100,logo);\n\t\t\n\t}\n\n\tif(frameNo >= 91 && frameNo < 106) {\n\/\/ \t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\n\t\tpainter.drawPixmap(150,85,100,100,logo);\n\t\t\n\t}\n\n\tif(frameNo >= 106 && frameNo < 136) {\n\/\/ \t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\t\n\t\tpainter.drawPixmap(150,85,100,100,logo);\n\t\t\n\t\tpainter.setFont(haveFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(3,190,390,40,4,\"Have a lot of fun!\");\n\n\t}\n\n\tif(frameNo >= 136 && frameNo < 190) {\n\/\/ \t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\n\t\tpainter.drawPixmap(150,85,100,100,logo);\n\t\t\n\t\tpainter.setFont(haveFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(3,190,390,40,4,\"Have a lot of fun! ;-)\");\n\n\t}\n\n\t\/\/even draw version number\n\tpainter.setOpacity(1.0);\n\tpainter.setFont(versionFont);\n\tpainter.setPen(QColor(102,153,0));\n\tpainter.drawText(295,230,100,20,4,\"Version 0.6-beta\");\n\tpainter.setOpacity(opacity);\n\n\tif(frameNo >=190) { \n\t\tthis->close();\n\/\/ \t\tmyW->label_logo->show(); \n\n\t}\n}\n\n<commit_msg>font fixes<commit_after>\/***************************************************************************\n *   Copyright (C) 2006 by FThauer FHammer   *\n *   f.thauer@web.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 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#include \"startsplash.h\"\n\n#include \"configfile.h\"\n#include \"mainwindowimpl.h\"\n\nStartSplash::StartSplash(mainWindowImpl *parent, ConfigFile *c)\n : QSplashScreen(parent), myW(parent), myConfig(c)\n{\n\t\n\tmyAppDataPath = QString::fromUtf8(myConfig->readConfigString(\"AppDataDir\").c_str());\n\n\tQFontDatabase::addApplicationFont (myAppDataPath +\"fonts\/c059013l.pfb\");\n\n\tlogo = myAppDataPath+\"gfx\/gui\/misc\/logoChip3D.png\";\n\n\n\tframeNo = 52;\n\topacityCounter = 13;\n\topacity = 1.0;\n\n\tQTimer *timer = new QTimer;\n\tconnect(timer, SIGNAL(timeout()), this, SLOT(nextAnimationFrame()));\n\ttimer->start(40);\n}\n\n\nStartSplash::~StartSplash()\n{\n}\n\nvoid StartSplash::nextAnimationFrame() {\n     \n\t++frameNo;\n     \tupdate();\n }\n\nvoid StartSplash::paintEvent(QPaintEvent * \/*event*\/) {\n\n\tQPainter painter(this);\n\n#ifdef _WIN32\n        QFont welcomeFont;\n        welcomeFont.setFamily(\"Times New Roman\");\n        welcomeFont.setPixelSize(42);        \n#else\n#ifdef __APPLE__ \n        QFont welcomeFont;\n        welcomeFont.setFamily(\"Century Schoolbook L\");\n        welcomeFont.setPixelSize(42);\n#else\n        QFont welcomeFont;\n        welcomeFont.setFamily(\"Century Schoolbook L\");\n        welcomeFont.setPixelSize(35);\n#endif        \n#endif\n#ifdef __APPLE__\n        QFont haveFont;\n        haveFont.setFamily(\"Century Schoolbook L\");\n        haveFont.setPixelSize(24);\n#else\n        QFont haveFont;\n        haveFont.setFamily(\"Century Schoolbook L\");\n        haveFont.setPixelSize(24);\n#endif\n\t\n\tQFont versionFont;\n\tversionFont.setFamily(\"Nimbus Sans L\");\n\tversionFont.setPixelSize(12);\n\n\tif(frameNo >= 52 && frameNo < 55) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t}\n\n\tif(frameNo >= 55 && frameNo < 57) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"W\");\n\t\t\n\t}\n\n\tif(frameNo >= 57 && frameNo < 59) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"We\");\n\t\t\n\t}\n\n\tif(frameNo >= 59 && frameNo < 61) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Wel\");\n\t\t\n\t}\n\n\tif(frameNo >= 61 && frameNo < 63) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welc\");\n\t\t\n\t}\n\n\tif(frameNo >= 63 && frameNo < 65) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welco\");\n\t\t\n\t}\n\n\tif(frameNo >= 65 && frameNo < 67) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcom\");\n\t\t\n\t}\n\n\tif(frameNo >= 67 && frameNo < 72) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome\");\n\t\t\n\t}\n\n\tif(frameNo >= 72 && frameNo < 74) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome t\");\n\t\t\n\t}\n\n\tif(frameNo >= 74 && frameNo < 79 ) {\n\t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\t\t\n\t}\n\n\tif(frameNo >= 79 && frameNo < 91) {\n\/\/ \t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\n\t\t--opacityCounter;\n\/\/ \t\t\tstd::cout << opacity << \" \" << opacityCounter << \"\\n\";\n\t\topacity = 1.0\/opacityCounter;\n\/\/ \t\tstd::cout << opacity << \"\\n\";\n\t\tpainter.setOpacity(opacity);\n\t\tpainter.drawPixmap(150,85,100,100,logo);\n\t\t\n\t}\n\n\tif(frameNo >= 91 && frameNo < 106) {\n\/\/ \t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\n\t\tpainter.drawPixmap(150,85,100,100,logo);\n\t\t\n\t}\n\n\tif(frameNo >= 106 && frameNo < 136) {\n\/\/ \t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\t\n\t\tpainter.drawPixmap(150,85,100,100,logo);\n\t\t\n\t\tpainter.setFont(haveFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(3,190,390,40,4,\"Have a lot of fun!\");\n\n\t}\n\n\tif(frameNo >= 136 && frameNo < 190) {\n\/\/ \t\n\t\tpainter.setBrush(QColor(35,71,0));\n\t\tpainter.drawRect(0,0,399,249);\n\t\t\n\t\tpainter.setRenderHint(QPainter::Antialiasing, TRUE);\n\t\tpainter.setFont(welcomeFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(48,27,300,45,4,\"Welcome to\");\n\n\t\tpainter.drawPixmap(150,85,100,100,logo);\n\t\t\n\t\tpainter.setFont(haveFont);\n\t\tpainter.setPen(QColor(255,255,255));\n\t\tpainter.drawText(3,190,390,40,4,\"Have a lot of fun! ;-)\");\n\n\t}\n\n\t\/\/even draw version number\n\tpainter.setOpacity(1.0);\n\tpainter.setFont(versionFont);\n\tpainter.setPen(QColor(102,153,0));\n\tpainter.drawText(295,230,100,20,4,\"Version 0.6-beta\");\n\tpainter.setOpacity(opacity);\n\n\tif(frameNo >=190) { \n\t\tthis->close();\n\/\/ \t\tmyW->label_logo->show(); \n\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <ros\/ros.h>\n#include <rosbag\/bag.h>\n#include <rosbag\/view.h>\n#include <iostream>\n#include <boost\/foreach.hpp>\n#include <boost\/program_options.hpp>\n#include <message_filters\/subscriber.h>\n#include <message_filters\/synchronizer.h>\n#include <message_filters\/sync_policies\/exact_time.h>\n#include <message_filters\/sync_policies\/approximate_time.h>\n#include <message_filters\/time_synchronizer.h>\n#include <sensor_msgs\/Imu.h>\n#include <sensor_msgs\/MagneticField.h>\n\n#include \"imu_filter_madgwick\/imu_filter.h\"\n#include \"imu_filter_madgwick\/stateless_orientation.h\"\n#include \"imu_filter_madgwick\/ImuFilterMadgwickConfig.h\"\n#include \"geometry_msgs\/TransformStamped.h\"\n#include <tf\/transform_broadcaster.h>\n#include <tf\/transform_datatypes.h>\n#include <tf2_msgs\/TFMessage.h>\n\nusing namespace std;\n\n\/\/ NOTE: adapted from http:\/\/wiki.ros.org\/rosbag\/Cookbook\n\n\/**\n * Inherits from message_filters::SimpleFilter<M>\n * to use protected signalMessage function\n *\/\ntemplate <class M>\nclass BagSubscriber : public message_filters::SimpleFilter<M>\n{\npublic:\n  void newMessage(const boost::shared_ptr<M const> &msg)\n  {\n\t  message_filters::SimpleFilter<M>::signalMessage(msg);\n  }\n};\n\n\nclass ImuFilterRosbag\n{\n  typedef sensor_msgs::Imu              ImuMsg;\n  typedef sensor_msgs::MagneticField    MagMsg;\n  typedef BagSubscriber<ImuMsg> \t\tImuSubscriber;\n  typedef BagSubscriber<MagMsg> \t\tMagSubscriber;\n  typedef message_filters::sync_policies::ApproximateTime<ImuMsg, MagMsg> SyncPolicy;\n  typedef message_filters::Synchronizer<SyncPolicy> Synchronizer;\n  typedef imu_filter_madgwick::ImuFilterMadgwickConfig   FilterConfig;\n\n  public:\n\n  ImuFilterRosbag(rosbag::Bag* bag, const std::string& output_imu_topic, const std::string& world_frame,\n\t\t  \t      const bool& stateless = false, const bool& publish_tf = false, const bool& reverse_tf = false,\n\t\t\t\t  const std::string& imu_frame = \"imu_link\", const std::string& fixed_frame = \"base_link\"){\n\n\t  \tbag_ = bag;\n\t  \tnb_msg_generated_ = 0;\n\t  \tnb_tf_msg_generated_ = 0;\n\t  \tstateless_ = stateless;\n\t  \toutput_imu_topic_ = output_imu_topic;\n\t  \tpublish_tf_ = publish_tf;\n\t  \treverse_tf_ = reverse_tf;\n\t  \timu_frame_ = imu_frame;\n\t  \tfixed_frame_ = fixed_frame;\n\n\t\t\/\/ Set up fake subscribers to capture Imu and MagneticField messages\n\t  \timu_sub_.reset(new ImuSubscriber());\n\t  \tmag_sub_.reset(new MagSubscriber());\n\n\t  \tsync_.reset(new Synchronizer(\n\t\t  SyncPolicy(50), *imu_sub_, *mag_sub_));\n\t\tsync_->registerCallback(boost::bind(&ImuFilterRosbag::imuMagCallback, this, _1, _2));\n\n\t\t if (world_frame == \"ned\") {\n\t\t\tworld_frame_ = WorldFrame::NED;\n\t\t  } else if (world_frame == \"nwu\"){\n\t\t\tworld_frame_ = WorldFrame::NWU;\n\t\t  } else if (world_frame == \"enu\"){\n\t\t\tworld_frame_ = WorldFrame::ENU;\n\t\t  } else {\n\t\t\t\/\/ROS_ERROR(\"The parameter world_frame was set to invalid value '%s'.\", world_frame.c_str());\n\t\t\t\/\/ROS_ERROR(\"Valid values are 'enu', 'ned' and 'nwu'. Setting to 'enu'.\");\n\t\t\tworld_frame_ = WorldFrame::ENU;\n\t\t  }\n\t\t  filter_.setWorldFrame(world_frame_);\n    }\n\n    virtual ~ImuFilterRosbag(){\n    \t\/\/ TODO: fix the following error at termination:\n    \t\/\/ terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::lock_error> >'\n    \t\/\/  what():  boost: mutex lock failed in pthread_mutex_lock: Invalid argument\n    \t\/\/ Aborted\n    \t\/\/\n    \t\/\/ see: https:\/\/github.com\/ros\/ros_comm\/issues\/318\n    \t\/\/      http:\/\/answers.ros.org\/question\/143756\/rostimer-leads-to-boostlock_error-at-process-cleanup\/\n    \timu_sub_.reset();\n    \tmag_sub_.reset();\n    \tsync_.reset();\n    }\n\n    void addImuMessage(sensor_msgs::Imu::ConstPtr imu){\n\t\timu_sub_->newMessage(imu);\n\t}\n\n\tvoid addMagMessage(sensor_msgs::MagneticField::ConstPtr mag){\n\t\tmag_sub_->newMessage(mag);\n\t}\n\n\n  private:\n\n    rosbag::Bag* bag_;\n    std::string output_imu_topic_;\n\n\tboost::shared_ptr<Synchronizer> sync_;\n\tboost::shared_ptr<ImuSubscriber> imu_sub_;\n\tboost::shared_ptr<MagSubscriber> mag_sub_;\n\n    \/\/ **** paramaters\n    WorldFrame::WorldFrame world_frame_;\n    bool stateless_;\n    geometry_msgs::Vector3 mag_bias_;\n    double orientation_variance_;\n\n    \/\/ **** state variables\n    bool initialized_;\n    ros::Time last_time_;\n    int nb_msg_generated_;\n    int nb_tf_msg_generated_;\n    bool publish_tf_;\n    bool reverse_tf_;\n    std::string imu_frame_;\n    std::string fixed_frame_;\n\n    \/\/ **** filter implementation\n    ImuFilter filter_;\n\n    void reconfigure(FilterConfig& config){\n      double gain, zeta;\n      gain = config.gain;\n      zeta = config.zeta;\n      filter_.setAlgorithmGain(gain);\n      filter_.setDriftBiasGain(zeta);\n      printf(\"Imu filter gain set to %f\", gain);\n      printf(\"Gyro drift bias set to %f\", zeta);\n      mag_bias_.x = config.mag_bias_x;\n      mag_bias_.y = config.mag_bias_y;\n      mag_bias_.z = config.mag_bias_z;\n      orientation_variance_ = config.orientation_stddev * config.orientation_stddev;\n      printf(\"Magnetometer bias values: %f %f %f\", mag_bias_.x, mag_bias_.y, mag_bias_.z);\n    }\n\n    \/\/ **** member functions\n    void imuMagCallback(const ImuMsg::ConstPtr& imu_msg_raw,\n                        const MagMsg::ConstPtr& mag_msg){\n\n\t  const geometry_msgs::Vector3& ang_vel = imu_msg_raw->angular_velocity;\n\t  const geometry_msgs::Vector3& lin_acc = imu_msg_raw->linear_acceleration;\n\t  const geometry_msgs::Vector3& mag_fld = mag_msg->magnetic_field;\n\n\t  ros::Time time = imu_msg_raw->header.stamp;\n\n\t  \/*** Compensate for hard iron ***\/\n\t  geometry_msgs::Vector3 mag_compensated;\n\t  mag_compensated.x = mag_fld.x - mag_bias_.x;\n\t  mag_compensated.y = mag_fld.y - mag_bias_.y;\n\t  mag_compensated.z = mag_fld.z - mag_bias_.z;\n\n\t  double roll = 0.0;\n\t  double pitch = 0.0;\n\t  double yaw = 0.0;\n\n\t  if (!initialized_ || stateless_)\n\t  {\n\t\t\/\/ wait for mag message without NaN \/ inf\n\t\tif(!std::isfinite(mag_fld.x) || !std::isfinite(mag_fld.y) || !std::isfinite(mag_fld.z))\n\t\t{\n\t\t  return;\n\t\t}\n\n\t\tgeometry_msgs::Quaternion init_q;\n\t\tStatelessOrientation::computeOrientation(world_frame_, lin_acc, mag_compensated, init_q);\n\t\tfilter_.setOrientation(init_q.w, init_q.x, init_q.y, init_q.z);\n\n\t\tlast_time_ = time;\n\t\tinitialized_ = true;\n\t  }\n\n\t  float dt = (time - last_time_).toSec();\n\n\t  last_time_ = time;\n\n\t  if (!stateless_)\n\t\tfilter_.madgwickAHRSupdate(\n\t\t  ang_vel.x, ang_vel.y, ang_vel.z,\n\t\t  lin_acc.x, lin_acc.y, lin_acc.z,\n\t\t  mag_compensated.x, mag_compensated.y, mag_compensated.z,\n\t\t  dt);\n\n\t  publishFilteredMsg(imu_msg_raw);\n\t  if (publish_tf_)\n\t      publishTransform(imu_msg_raw);\n    }\n\n    void publishFilteredMsg(const ImuMsg::ConstPtr& imu_msg_raw){\n\n    \t  double q0,q1,q2,q3;\n    \t  filter_.getOrientation(q0,q1,q2,q3);\n\n    \t  \/\/ create and publish filtered IMU message\n    \t  boost::shared_ptr<ImuMsg> imu_msg =\n    \t    boost::make_shared<ImuMsg>(*imu_msg_raw);\n\n    \t  imu_msg->orientation.w = q0;\n    \t  imu_msg->orientation.x = q1;\n    \t  imu_msg->orientation.y = q2;\n    \t  imu_msg->orientation.z = q3;\n\n    \t  imu_msg->orientation_covariance[0] = orientation_variance_;\n    \t  imu_msg->orientation_covariance[1] = 0.0;\n    \t  imu_msg->orientation_covariance[2] = 0.0;\n    \t  imu_msg->orientation_covariance[3] = 0.0;\n    \t  imu_msg->orientation_covariance[4] = orientation_variance_;\n    \t  imu_msg->orientation_covariance[5] = 0.0;\n    \t  imu_msg->orientation_covariance[6] = 0.0;\n    \t  imu_msg->orientation_covariance[7] = 0.0;\n    \t  imu_msg->orientation_covariance[8] = orientation_variance_;\n\n    \t  \/\/ Write msg in rosbag here\n    \t  bag_->write(output_imu_topic_, imu_msg->header.stamp, imu_msg);\n    \t  nb_msg_generated_++;\n\n    \t  if (nb_msg_generated_ % 1000 == 0){\n    \t\t  printf(\"Number of filtered imu messages generated: %d \\n\", nb_msg_generated_);\n    \t  }\n    }\n\n    void publishTransform(const ImuMsg::ConstPtr& imu_msg_raw){\n\n      double q0,q1,q2,q3;\n      filter_.getOrientation(q0,q1,q2,q3);\n      geometry_msgs::TransformStamped transform;\n      transform.header.stamp = imu_msg_raw->header.stamp;\n      if (reverse_tf_)\n      {\n        transform.header.frame_id = imu_frame_;\n        transform.child_frame_id = fixed_frame_;\n        transform.transform.rotation.w = q0;\n        transform.transform.rotation.x = -q1;\n        transform.transform.rotation.y = -q2;\n        transform.transform.rotation.z = -q3;\n      }\n      else {\n        transform.header.frame_id = fixed_frame_;\n        transform.child_frame_id = imu_frame_;\n        transform.transform.rotation.w = q0;\n        transform.transform.rotation.x = q1;\n        transform.transform.rotation.y = q2;\n        transform.transform.rotation.z = q3;\n      }\n\n\t\t\/\/ Write tf message to rosbag\n\t\t\/\/tf::tfMessage tf_msg;\n        tf2_msgs::TFMessage tf_msg;\n      \ttf_msg.transforms.push_back(transform);\n\t\tbag_->write(\"\/tf\", transform.header.stamp, tf_msg);\n\t\tnb_tf_msg_generated_++;\n\n\t\tif (nb_tf_msg_generated_ % 1000 == 0){\n\t\t\t  printf(\"Number of tf messages generated: %d \\n\", nb_tf_msg_generated_);\n\t\t}\n    }\n\n};\n\nint main(int argc, char **argv){\n\n\tros::Time::init();\n\n\tstd::string input_rosbag = \"input.bag\";\n\tstd::string output_rosbag = \"output.bag\";\n\tstd::string output_imu_topic = \"\/imu\/data\";\n\tstd::string input_imu_topic = \"\/imu\/data_raw\";\n\tstd::string input_mag_topic = \"\/imu\/mag\";\n\tstd::string world_frame = \"nwu\";\n\tstd::string imu_frame = \"imu_link\";\n\tstd::string fixed_frame = \"base_link\";\n\tbool stateless = false;\n\tbool publish_tf = false;\n\tbool reverse_tf = false;\n\n\tnamespace po = boost::program_options;\n\tpo::options_description desc(\"Allowed options\");\n\tdesc.add_options()\n\t(\"help,h\", \"describe arguments\")\n\t(\"output,o\", po::value(&output_rosbag), \"set output rosbag file\")\n\t(\"input,i\", po::value(&input_rosbag), \"set input rosbag file\")\n\t(\"output-imu-topic,d\", po::value(&output_imu_topic), \"set topic of the output Imu messages\")\n\t(\"input-imu-topic,m\", po::value(&input_imu_topic), \"set topic of the input Imu messages\")\n\t(\"input-mag-topic,g\", po::value(&input_mag_topic), \"set topic of the input MagneticField messages\")\n\t(\"world-frame,w\", po::value(&world_frame), \"set the world frame\")\n\t(\"stateless,s\", po::bool_switch(&stateless), \"set topic of the input Imu messages\")\n\t(\"publish-tf,t\", po::bool_switch(&publish_tf), \"set to publish tf messages\")\n\t(\"reverse-tf,r\", po::bool_switch(&reverse_tf), \"set to reverse tf messages\")\n\t(\"imu-frame,f\", po::value(&imu_frame), \"set the name of the imu frame\")\n\t(\"fixed-frame,x\", po::value(&fixed_frame), \"set the name of the fixed frame\");\n\n\tpo::variables_map vm;\n\tpo::store(po::parse_command_line(argc, argv, desc), vm);\n\tpo::notify(vm);\n\n\tif (vm.count(\"help\")) {\n\t\tcout << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\trosbag::Bag output(output_rosbag, rosbag::bagmode::Write);\n\trosbag::Bag input(input_rosbag, rosbag::bagmode::Read);\n\n\tImuFilterRosbag filter(&output, output_imu_topic, world_frame, stateless, publish_tf, reverse_tf, imu_frame, fixed_frame);\n\n\tint nb_imu_msg_processed = 0;\n\tint nb_mag_msg_processed = 0;\n\tint nb_total_msg_processed = 0;\n\trosbag::View view(input);\n\tBOOST_FOREACH(rosbag::MessageInstance const m, view)\n\t{\n\t\t\/\/ Detect Imu messages from the given topic\n\t\tif (m.getTopic() == input_imu_topic || (\"\/\" + m.getTopic() == input_imu_topic))\n\t\t{\n\t\t  sensor_msgs::Imu::ConstPtr imu = m.instantiate<sensor_msgs::Imu>();\n\t\t  if (imu != NULL){\n\t\t\t  filter.addImuMessage(imu);\n\t\t\t  nb_imu_msg_processed++;\n\t\t  }\n\t\t}\n\n\t\t\/\/ Detect MagneticField messages from the given topic\n\t\tif (m.getTopic() == input_mag_topic || (\"\/\" + m.getTopic() == input_mag_topic))\n\t\t{\n\t\t  sensor_msgs::MagneticField::ConstPtr mag = m.instantiate<sensor_msgs::MagneticField>();\n\t\t  if (mag != NULL){\n\t\t\t  filter.addMagMessage(mag);\n\t\t\t  nb_mag_msg_processed++;\n\t\t  }\n\t\t}\n\n\t\tif (m.getTopic() != output_imu_topic){\n\t\t\t\/\/ Write every message to output bag\n\t\t\toutput.write(m.getTopic(), m.getTime(), m, m.getConnectionHeader());\n\t\t\tnb_total_msg_processed++;\n\t\t}\n\n\t\tif (nb_total_msg_processed % 1000 == 0){\n\t\t\tprintf(\"Number of imu messages processed: %d (total %d)\\n\", nb_imu_msg_processed, nb_total_msg_processed);\n\t\t\tprintf(\"Number of mag messages processed: %d (total %d)\\n\", nb_mag_msg_processed, nb_total_msg_processed);\n\t\t}\n\t}\n\n\toutput.close();\n\tinput.close();\n\n\treturn 0;\n}\n<commit_msg>Increased gain from 0 to 0.1 in offline mode<commit_after>#include <ros\/ros.h>\n#include <rosbag\/bag.h>\n#include <rosbag\/view.h>\n#include <iostream>\n#include <boost\/foreach.hpp>\n#include <boost\/program_options.hpp>\n#include <message_filters\/subscriber.h>\n#include <message_filters\/synchronizer.h>\n#include <message_filters\/sync_policies\/exact_time.h>\n#include <message_filters\/sync_policies\/approximate_time.h>\n#include <message_filters\/time_synchronizer.h>\n#include <sensor_msgs\/Imu.h>\n#include <sensor_msgs\/MagneticField.h>\n\n#include \"imu_filter_madgwick\/imu_filter.h\"\n#include \"imu_filter_madgwick\/stateless_orientation.h\"\n#include \"imu_filter_madgwick\/ImuFilterMadgwickConfig.h\"\n#include \"geometry_msgs\/TransformStamped.h\"\n#include <tf\/transform_broadcaster.h>\n#include <tf\/transform_datatypes.h>\n#include <tf2_msgs\/TFMessage.h>\n\nusing namespace std;\n\n\/\/ NOTE: adapted from http:\/\/wiki.ros.org\/rosbag\/Cookbook\n\n\/**\n * Inherits from message_filters::SimpleFilter<M>\n * to use protected signalMessage function\n *\/\ntemplate <class M>\nclass BagSubscriber : public message_filters::SimpleFilter<M>\n{\npublic:\n  void newMessage(const boost::shared_ptr<M const> &msg)\n  {\n\t  message_filters::SimpleFilter<M>::signalMessage(msg);\n  }\n};\n\n\nclass ImuFilterRosbag\n{\n  typedef sensor_msgs::Imu              ImuMsg;\n  typedef sensor_msgs::MagneticField    MagMsg;\n  typedef BagSubscriber<ImuMsg> \t\tImuSubscriber;\n  typedef BagSubscriber<MagMsg> \t\tMagSubscriber;\n  typedef message_filters::sync_policies::ApproximateTime<ImuMsg, MagMsg> SyncPolicy;\n  typedef message_filters::Synchronizer<SyncPolicy> Synchronizer;\n  typedef imu_filter_madgwick::ImuFilterMadgwickConfig   FilterConfig;\n\n  public:\n\n  ImuFilterRosbag(rosbag::Bag* bag, const std::string& output_imu_topic, const std::string& world_frame,\n\t\t  \t      const bool& stateless = false, const bool& publish_tf = false, const bool& reverse_tf = false,\n\t\t\t\t  const std::string& imu_frame = \"imu_link\", const std::string& fixed_frame = \"base_link\"){\n\n\t  \tbag_ = bag;\n\t  \tnb_msg_generated_ = 0;\n\t  \tnb_tf_msg_generated_ = 0;\n\t  \tstateless_ = stateless;\n\t  \toutput_imu_topic_ = output_imu_topic;\n\t  \tpublish_tf_ = publish_tf;\n\t  \treverse_tf_ = reverse_tf;\n\t  \timu_frame_ = imu_frame;\n\t  \tfixed_frame_ = fixed_frame;\n\n\t\t\/\/ Set up fake subscribers to capture Imu and MagneticField messages\n\t  \timu_sub_.reset(new ImuSubscriber());\n\t  \tmag_sub_.reset(new MagSubscriber());\n\n\t  \tsync_.reset(new Synchronizer(\n\t\t  SyncPolicy(50), *imu_sub_, *mag_sub_));\n\t\tsync_->registerCallback(boost::bind(&ImuFilterRosbag::imuMagCallback, this, _1, _2));\n\n\t\t if (world_frame == \"ned\") {\n\t\t\tworld_frame_ = WorldFrame::NED;\n\t\t  } else if (world_frame == \"nwu\"){\n\t\t\tworld_frame_ = WorldFrame::NWU;\n\t\t  } else if (world_frame == \"enu\"){\n\t\t\tworld_frame_ = WorldFrame::ENU;\n\t\t  } else {\n\t\t\t\/\/ROS_ERROR(\"The parameter world_frame was set to invalid value '%s'.\", world_frame.c_str());\n\t\t\t\/\/ROS_ERROR(\"Valid values are 'enu', 'ned' and 'nwu'. Setting to 'enu'.\");\n\t\t\tworld_frame_ = WorldFrame::ENU;\n\t\t  }\n\t\t  filter_.setWorldFrame(world_frame_);\n\n      filter_.setAlgorithmGain(0.1);\n    }\n\n    virtual ~ImuFilterRosbag(){\n    \t\/\/ TODO: fix the following error at termination:\n    \t\/\/ terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::lock_error> >'\n    \t\/\/  what():  boost: mutex lock failed in pthread_mutex_lock: Invalid argument\n    \t\/\/ Aborted\n    \t\/\/\n    \t\/\/ see: https:\/\/github.com\/ros\/ros_comm\/issues\/318\n    \t\/\/      http:\/\/answers.ros.org\/question\/143756\/rostimer-leads-to-boostlock_error-at-process-cleanup\/\n    \timu_sub_.reset();\n    \tmag_sub_.reset();\n    \tsync_.reset();\n    }\n\n    void addImuMessage(sensor_msgs::Imu::ConstPtr imu){\n\t\timu_sub_->newMessage(imu);\n\t}\n\n\tvoid addMagMessage(sensor_msgs::MagneticField::ConstPtr mag){\n\t\tmag_sub_->newMessage(mag);\n\t}\n\n\n  private:\n\n    rosbag::Bag* bag_;\n    std::string output_imu_topic_;\n\n\tboost::shared_ptr<Synchronizer> sync_;\n\tboost::shared_ptr<ImuSubscriber> imu_sub_;\n\tboost::shared_ptr<MagSubscriber> mag_sub_;\n\n    \/\/ **** paramaters\n    WorldFrame::WorldFrame world_frame_;\n    bool stateless_;\n    geometry_msgs::Vector3 mag_bias_;\n    double orientation_variance_;\n\n    \/\/ **** state variables\n    bool initialized_;\n    ros::Time last_time_;\n    int nb_msg_generated_;\n    int nb_tf_msg_generated_;\n    bool publish_tf_;\n    bool reverse_tf_;\n    std::string imu_frame_;\n    std::string fixed_frame_;\n\n    \/\/ **** filter implementation\n    ImuFilter filter_;\n\n    void reconfigure(FilterConfig& config){\n      double gain, zeta;\n      gain = config.gain;\n      zeta = config.zeta;\n      filter_.setAlgorithmGain(gain);\n      filter_.setDriftBiasGain(zeta);\n      printf(\"Imu filter gain set to %f\", gain);\n      printf(\"Gyro drift bias set to %f\", zeta);\n      mag_bias_.x = config.mag_bias_x;\n      mag_bias_.y = config.mag_bias_y;\n      mag_bias_.z = config.mag_bias_z;\n      orientation_variance_ = config.orientation_stddev * config.orientation_stddev;\n      printf(\"Magnetometer bias values: %f %f %f\", mag_bias_.x, mag_bias_.y, mag_bias_.z);\n    }\n\n    \/\/ **** member functions\n    void imuMagCallback(const ImuMsg::ConstPtr& imu_msg_raw,\n                        const MagMsg::ConstPtr& mag_msg){\n\n\t  const geometry_msgs::Vector3& ang_vel = imu_msg_raw->angular_velocity;\n\t  const geometry_msgs::Vector3& lin_acc = imu_msg_raw->linear_acceleration;\n\t  const geometry_msgs::Vector3& mag_fld = mag_msg->magnetic_field;\n\n\t  ros::Time time = imu_msg_raw->header.stamp;\n\n\t  \/*** Compensate for hard iron ***\/\n\t  geometry_msgs::Vector3 mag_compensated;\n\t  mag_compensated.x = mag_fld.x - mag_bias_.x;\n\t  mag_compensated.y = mag_fld.y - mag_bias_.y;\n\t  mag_compensated.z = mag_fld.z - mag_bias_.z;\n\n\t  double roll = 0.0;\n\t  double pitch = 0.0;\n\t  double yaw = 0.0;\n\n\t  if (!initialized_ || stateless_)\n\t  {\n\t\t\/\/ wait for mag message without NaN \/ inf\n\t\tif(!std::isfinite(mag_fld.x) || !std::isfinite(mag_fld.y) || !std::isfinite(mag_fld.z))\n\t\t{\n\t\t  return;\n\t\t}\n\n\t\tgeometry_msgs::Quaternion init_q;\n\t\tStatelessOrientation::computeOrientation(world_frame_, lin_acc, mag_compensated, init_q);\n\t\tfilter_.setOrientation(init_q.w, init_q.x, init_q.y, init_q.z);\n\n\t\tlast_time_ = time;\n\t\tinitialized_ = true;\n\t  }\n\n\t  float dt = (time - last_time_).toSec();\n\n\t  last_time_ = time;\n\n\t  if (!stateless_)\n\t\tfilter_.madgwickAHRSupdate(\n\t\t  ang_vel.x, ang_vel.y, ang_vel.z,\n\t\t  lin_acc.x, lin_acc.y, lin_acc.z,\n\t\t  mag_compensated.x, mag_compensated.y, mag_compensated.z,\n\t\t  dt);\n\n\t  publishFilteredMsg(imu_msg_raw);\n\t  if (publish_tf_)\n\t      publishTransform(imu_msg_raw);\n    }\n\n    void publishFilteredMsg(const ImuMsg::ConstPtr& imu_msg_raw){\n\n    \t  double q0,q1,q2,q3;\n    \t  filter_.getOrientation(q0,q1,q2,q3);\n\n    \t  \/\/ create and publish filtered IMU message\n    \t  boost::shared_ptr<ImuMsg> imu_msg =\n    \t    boost::make_shared<ImuMsg>(*imu_msg_raw);\n\n    \t  imu_msg->orientation.w = q0;\n    \t  imu_msg->orientation.x = q1;\n    \t  imu_msg->orientation.y = q2;\n    \t  imu_msg->orientation.z = q3;\n\n    \t  imu_msg->orientation_covariance[0] = orientation_variance_;\n    \t  imu_msg->orientation_covariance[1] = 0.0;\n    \t  imu_msg->orientation_covariance[2] = 0.0;\n    \t  imu_msg->orientation_covariance[3] = 0.0;\n    \t  imu_msg->orientation_covariance[4] = orientation_variance_;\n    \t  imu_msg->orientation_covariance[5] = 0.0;\n    \t  imu_msg->orientation_covariance[6] = 0.0;\n    \t  imu_msg->orientation_covariance[7] = 0.0;\n    \t  imu_msg->orientation_covariance[8] = orientation_variance_;\n\n    \t  \/\/ Write msg in rosbag here\n    \t  bag_->write(output_imu_topic_, imu_msg->header.stamp, imu_msg);\n    \t  nb_msg_generated_++;\n\n    \t  if (nb_msg_generated_ % 1000 == 0){\n    \t\t  printf(\"Number of filtered imu messages generated: %d \\n\", nb_msg_generated_);\n    \t  }\n    }\n\n    void publishTransform(const ImuMsg::ConstPtr& imu_msg_raw){\n\n      double q0,q1,q2,q3;\n      filter_.getOrientation(q0,q1,q2,q3);\n      geometry_msgs::TransformStamped transform;\n      transform.header.stamp = imu_msg_raw->header.stamp;\n      if (reverse_tf_)\n      {\n        transform.header.frame_id = imu_frame_;\n        transform.child_frame_id = fixed_frame_;\n        transform.transform.rotation.w = q0;\n        transform.transform.rotation.x = -q1;\n        transform.transform.rotation.y = -q2;\n        transform.transform.rotation.z = -q3;\n      }\n      else {\n        transform.header.frame_id = fixed_frame_;\n        transform.child_frame_id = imu_frame_;\n        transform.transform.rotation.w = q0;\n        transform.transform.rotation.x = q1;\n        transform.transform.rotation.y = q2;\n        transform.transform.rotation.z = q3;\n      }\n\n\t\t\/\/ Write tf message to rosbag\n\t\t\/\/tf::tfMessage tf_msg;\n        tf2_msgs::TFMessage tf_msg;\n      \ttf_msg.transforms.push_back(transform);\n\t\tbag_->write(\"\/tf\", transform.header.stamp, tf_msg);\n\t\tnb_tf_msg_generated_++;\n\n\t\tif (nb_tf_msg_generated_ % 1000 == 0){\n\t\t\t  printf(\"Number of tf messages generated: %d \\n\", nb_tf_msg_generated_);\n\t\t}\n    }\n\n};\n\nint main(int argc, char **argv){\n\n\tros::Time::init();\n\n\tstd::string input_rosbag = \"input.bag\";\n\tstd::string output_rosbag = \"output.bag\";\n\tstd::string output_imu_topic = \"\/imu\/data\";\n\tstd::string input_imu_topic = \"\/imu\/data_raw\";\n\tstd::string input_mag_topic = \"\/imu\/mag\";\n\tstd::string world_frame = \"nwu\";\n\tstd::string imu_frame = \"imu_link\";\n\tstd::string fixed_frame = \"base_link\";\n\tbool stateless = false;\n\tbool publish_tf = false;\n\tbool reverse_tf = false;\n\n\tnamespace po = boost::program_options;\n\tpo::options_description desc(\"Allowed options\");\n\tdesc.add_options()\n\t(\"help,h\", \"describe arguments\")\n\t(\"output,o\", po::value(&output_rosbag), \"set output rosbag file\")\n\t(\"input,i\", po::value(&input_rosbag), \"set input rosbag file\")\n\t(\"output-imu-topic,d\", po::value(&output_imu_topic), \"set topic of the output Imu messages\")\n\t(\"input-imu-topic,m\", po::value(&input_imu_topic), \"set topic of the input Imu messages\")\n\t(\"input-mag-topic,g\", po::value(&input_mag_topic), \"set topic of the input MagneticField messages\")\n\t(\"world-frame,w\", po::value(&world_frame), \"set the world frame\")\n\t(\"stateless,s\", po::bool_switch(&stateless), \"set topic of the input Imu messages\")\n\t(\"publish-tf,t\", po::bool_switch(&publish_tf), \"set to publish tf messages\")\n\t(\"reverse-tf,r\", po::bool_switch(&reverse_tf), \"set to reverse tf messages\")\n\t(\"imu-frame,f\", po::value(&imu_frame), \"set the name of the imu frame\")\n\t(\"fixed-frame,x\", po::value(&fixed_frame), \"set the name of the fixed frame\");\n\n\tpo::variables_map vm;\n\tpo::store(po::parse_command_line(argc, argv, desc), vm);\n\tpo::notify(vm);\n\n\tif (vm.count(\"help\")) {\n\t\tcout << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\trosbag::Bag output(output_rosbag, rosbag::bagmode::Write);\n\trosbag::Bag input(input_rosbag, rosbag::bagmode::Read);\n\n\tImuFilterRosbag filter(&output, output_imu_topic, world_frame, stateless, publish_tf, reverse_tf, imu_frame, fixed_frame);\n\n\tint nb_imu_msg_processed = 0;\n\tint nb_mag_msg_processed = 0;\n\tint nb_total_msg_processed = 0;\n\trosbag::View view(input);\n\tBOOST_FOREACH(rosbag::MessageInstance const m, view)\n\t{\n\t\t\/\/ Detect Imu messages from the given topic\n\t\tif (m.getTopic() == input_imu_topic || (\"\/\" + m.getTopic() == input_imu_topic))\n\t\t{\n\t\t  sensor_msgs::Imu::ConstPtr imu = m.instantiate<sensor_msgs::Imu>();\n\t\t  if (imu != NULL){\n\t\t\t  filter.addImuMessage(imu);\n\t\t\t  nb_imu_msg_processed++;\n\t\t  }\n\t\t}\n\n\t\t\/\/ Detect MagneticField messages from the given topic\n\t\tif (m.getTopic() == input_mag_topic || (\"\/\" + m.getTopic() == input_mag_topic))\n\t\t{\n\t\t  sensor_msgs::MagneticField::ConstPtr mag = m.instantiate<sensor_msgs::MagneticField>();\n\t\t  if (mag != NULL){\n\t\t\t  filter.addMagMessage(mag);\n\t\t\t  nb_mag_msg_processed++;\n\t\t  }\n\t\t}\n\n\t\tif (m.getTopic() != output_imu_topic){\n\t\t\t\/\/ Write every message to output bag\n\t\t\toutput.write(m.getTopic(), m.getTime(), m, m.getConnectionHeader());\n\t\t\tnb_total_msg_processed++;\n\t\t}\n\n\t\tif (nb_total_msg_processed % 1000 == 0){\n\t\t\tprintf(\"Number of imu messages processed: %d (total %d)\\n\", nb_imu_msg_processed, nb_total_msg_processed);\n\t\t\tprintf(\"Number of mag messages processed: %d (total %d)\\n\", nb_mag_msg_processed, nb_total_msg_processed);\n\t\t}\n\t}\n\n\toutput.close();\n\tinput.close();\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: MasterDetailLinkDialog.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: kz $ $Date: 2008-03-05 17:09: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 #include \"precompiled_extensions.hxx\"\n #include \"MasterDetailLinkDialog.hxx\"\n #include \"formlinkdialog.hxx\"\n\n extern \"C\" void SAL_CALL createRegistryInfo_MasterDetailLinkDialog()\n{\n    ::pcr::OAutoRegistration< ::pcr::MasterDetailLinkDialog > aAutoRegistration;\n}\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::beans;\n\n    \/\/====================================================================\n    \/\/= MasterDetailLinkDialog\n    \/\/====================================================================\n    \/\/---------------------------------------------------------------------\n    MasterDetailLinkDialog::MasterDetailLinkDialog(const Reference< XComponentContext >& _rxContext )\n        :OGenericUnoDialog( _rxContext )\n    {\n    }\n\/\/---------------------------------------------------------------------\n    Sequence<sal_Int8> SAL_CALL MasterDetailLinkDialog::getImplementationId(  ) throw(RuntimeException)\n    {\n        static ::cppu::OImplementationId aId;\n        return aId.getImplementationId();\n    }\n\n    \/\/---------------------------------------------------------------------\n    Reference< XInterface > SAL_CALL MasterDetailLinkDialog::Create( const Reference< XComponentContext >& _rxContext )\n    {\n        return *( new MasterDetailLinkDialog( _rxContext ) );\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::rtl::OUString SAL_CALL MasterDetailLinkDialog::getImplementationName() throw(RuntimeException)\n    {\n        return getImplementationName_static();\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::rtl::OUString MasterDetailLinkDialog::getImplementationName_static() throw(RuntimeException)\n    {\n        return ::rtl::OUString::createFromAscii(\"org.openoffice.comp.form.ui.MasterDetailLinkDialog\");\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::comphelper::StringSequence SAL_CALL MasterDetailLinkDialog::getSupportedServiceNames() throw(RuntimeException)\n    {\n        return getSupportedServiceNames_static();\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::comphelper::StringSequence MasterDetailLinkDialog::getSupportedServiceNames_static() throw(RuntimeException)\n    {\n        ::comphelper::StringSequence aSupported(1);\n        aSupported.getArray()[0] = ::rtl::OUString::createFromAscii(\"com.sun.star.form.MasterDetailLinkDialog\");\n        return aSupported;\n    }\n\n    \/\/---------------------------------------------------------------------\n    Reference<XPropertySetInfo>  SAL_CALL MasterDetailLinkDialog::getPropertySetInfo() throw(RuntimeException)\n    {\n        Reference<XPropertySetInfo>  xInfo( createPropertySetInfo( getInfoHelper() ) );\n        return xInfo;\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::cppu::IPropertyArrayHelper& MasterDetailLinkDialog::getInfoHelper()\n    {\n        return *const_cast<MasterDetailLinkDialog*>(this)->getArrayHelper();\n    }\n\n    \/\/--------------------------------------------------------------------------\n    ::cppu::IPropertyArrayHelper* MasterDetailLinkDialog::createArrayHelper( ) const\n    {\n        Sequence< Property > aProps;\n        describeProperties(aProps);\n        return new ::cppu::OPropertyArrayHelper(aProps);\n    }\n\n    \/\/--------------------------------------------------------------------------\n    Dialog* MasterDetailLinkDialog::createDialog(Window* _pParent)\n    {\n        return new FormLinkDialog(_pParent,m_xDetail,m_xMaster,Reference< XMultiServiceFactory >( m_xContext->getServiceManager(),UNO_QUERY)\n            ,m_sExplanation,m_sDetailLabel,m_sMasterLabel);\n    }\n    \/\/---------------------------------------------------------------------\n    void MasterDetailLinkDialog::implInitialize(const Any& _rValue)\n    {\n        PropertyValue aProperty;\n        if (_rValue >>= aProperty)\n        {\n            if (0 == aProperty.Name.compareToAscii(\"Detail\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_xDetail );\n                return;\n            }\n            else if (0 == aProperty.Name.compareToAscii(\"Master\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_xMaster );\n                return;\n            }\n            else if (0 == aProperty.Name.compareToAscii(\"Explanation\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_sExplanation );\n                return;\n            }\n            else if (0 == aProperty.Name.compareToAscii(\"DetailLabel\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_sDetailLabel );\n                return;\n            }\n            else if (0 == aProperty.Name.compareToAscii(\"MasterLabel\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_sMasterLabel );\n                return;\n            }\n        }\n        MasterDetailLinkDialog_DBase::implInitialize(_rValue);\n    }\n\n\/\/............................................................................\n}   \/\/ namespace pcr\n\/\/............................................................................\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.14); FILE MERGED 2008\/03\/31 12:31:39 rt 1.2.14.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: MasterDetailLinkDialog.cxx,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 #include \"precompiled_extensions.hxx\"\n #include \"MasterDetailLinkDialog.hxx\"\n #include \"formlinkdialog.hxx\"\n\n extern \"C\" void SAL_CALL createRegistryInfo_MasterDetailLinkDialog()\n{\n    ::pcr::OAutoRegistration< ::pcr::MasterDetailLinkDialog > aAutoRegistration;\n}\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::beans;\n\n    \/\/====================================================================\n    \/\/= MasterDetailLinkDialog\n    \/\/====================================================================\n    \/\/---------------------------------------------------------------------\n    MasterDetailLinkDialog::MasterDetailLinkDialog(const Reference< XComponentContext >& _rxContext )\n        :OGenericUnoDialog( _rxContext )\n    {\n    }\n\/\/---------------------------------------------------------------------\n    Sequence<sal_Int8> SAL_CALL MasterDetailLinkDialog::getImplementationId(  ) throw(RuntimeException)\n    {\n        static ::cppu::OImplementationId aId;\n        return aId.getImplementationId();\n    }\n\n    \/\/---------------------------------------------------------------------\n    Reference< XInterface > SAL_CALL MasterDetailLinkDialog::Create( const Reference< XComponentContext >& _rxContext )\n    {\n        return *( new MasterDetailLinkDialog( _rxContext ) );\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::rtl::OUString SAL_CALL MasterDetailLinkDialog::getImplementationName() throw(RuntimeException)\n    {\n        return getImplementationName_static();\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::rtl::OUString MasterDetailLinkDialog::getImplementationName_static() throw(RuntimeException)\n    {\n        return ::rtl::OUString::createFromAscii(\"org.openoffice.comp.form.ui.MasterDetailLinkDialog\");\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::comphelper::StringSequence SAL_CALL MasterDetailLinkDialog::getSupportedServiceNames() throw(RuntimeException)\n    {\n        return getSupportedServiceNames_static();\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::comphelper::StringSequence MasterDetailLinkDialog::getSupportedServiceNames_static() throw(RuntimeException)\n    {\n        ::comphelper::StringSequence aSupported(1);\n        aSupported.getArray()[0] = ::rtl::OUString::createFromAscii(\"com.sun.star.form.MasterDetailLinkDialog\");\n        return aSupported;\n    }\n\n    \/\/---------------------------------------------------------------------\n    Reference<XPropertySetInfo>  SAL_CALL MasterDetailLinkDialog::getPropertySetInfo() throw(RuntimeException)\n    {\n        Reference<XPropertySetInfo>  xInfo( createPropertySetInfo( getInfoHelper() ) );\n        return xInfo;\n    }\n\n    \/\/---------------------------------------------------------------------\n    ::cppu::IPropertyArrayHelper& MasterDetailLinkDialog::getInfoHelper()\n    {\n        return *const_cast<MasterDetailLinkDialog*>(this)->getArrayHelper();\n    }\n\n    \/\/--------------------------------------------------------------------------\n    ::cppu::IPropertyArrayHelper* MasterDetailLinkDialog::createArrayHelper( ) const\n    {\n        Sequence< Property > aProps;\n        describeProperties(aProps);\n        return new ::cppu::OPropertyArrayHelper(aProps);\n    }\n\n    \/\/--------------------------------------------------------------------------\n    Dialog* MasterDetailLinkDialog::createDialog(Window* _pParent)\n    {\n        return new FormLinkDialog(_pParent,m_xDetail,m_xMaster,Reference< XMultiServiceFactory >( m_xContext->getServiceManager(),UNO_QUERY)\n            ,m_sExplanation,m_sDetailLabel,m_sMasterLabel);\n    }\n    \/\/---------------------------------------------------------------------\n    void MasterDetailLinkDialog::implInitialize(const Any& _rValue)\n    {\n        PropertyValue aProperty;\n        if (_rValue >>= aProperty)\n        {\n            if (0 == aProperty.Name.compareToAscii(\"Detail\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_xDetail );\n                return;\n            }\n            else if (0 == aProperty.Name.compareToAscii(\"Master\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_xMaster );\n                return;\n            }\n            else if (0 == aProperty.Name.compareToAscii(\"Explanation\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_sExplanation );\n                return;\n            }\n            else if (0 == aProperty.Name.compareToAscii(\"DetailLabel\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_sDetailLabel );\n                return;\n            }\n            else if (0 == aProperty.Name.compareToAscii(\"MasterLabel\"))\n            {\n                OSL_VERIFY( aProperty.Value >>= m_sMasterLabel );\n                return;\n            }\n        }\n        MasterDetailLinkDialog_DBase::implInitialize(_rValue);\n    }\n\n\/\/............................................................................\n}   \/\/ namespace pcr\n\/\/............................................................................\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 Cloudius Systems, Ltd.\n *\/\n\n#include \"murmur3_partitioner.hh\"\n#include \"utils\/murmur_hash.hh\"\n#include \"sstables\/key.hh\"\n#include \"utils\/class_registrator.hh\"\n\nnamespace dht {\n\ninline\nint64_t\nmurmur3_partitioner::normalize(int64_t in) {\n    return in == std::numeric_limits<int64_t>::lowest()\n            ? std::numeric_limits<int64_t>::max()\n            : in;\n}\n\ntoken\nmurmur3_partitioner::get_token(bytes_view key) {\n    if (key.empty()) {\n        return minimum_token();\n    }\n    std::array<uint64_t, 2> hash;\n    utils::murmur_hash::hash3_x64_128(key, 0, hash);\n    return get_token(hash[0]);\n}\n\ntoken\nmurmur3_partitioner::get_token(uint64_t value) const {\n    \/\/ We don't normalize() the value, since token includes an is-before-everything\n    \/\/ indicator.\n    \/\/ FIXME: will this require a repair when importing a database?\n    auto t = net::hton(normalize(value));\n    bytes b(bytes::initialized_later(), 8);\n    std::copy_n(reinterpret_cast<int8_t*>(&t), 8, b.begin());\n    return token{token::kind::key, std::move(b)};\n}\n\ntoken\nmurmur3_partitioner::get_token(const sstables::key_view& key) {\n    return get_token(bytes_view(key));\n}\n\ntoken\nmurmur3_partitioner::get_token(const schema& s, partition_key_view key) {\n    std::array<uint64_t, 2> hash;\n    auto&& legacy = key.legacy_form(s);\n    utils::murmur_hash::hash3_x64_128(legacy.begin(), legacy.size(), 0, hash);\n    return get_token(hash[0]);\n}\n\ntoken murmur3_partitioner::get_random_token() {\n    auto rand = dht::get_random_number<uint64_t>();\n    return get_token(rand);\n}\n\ninline long long_token(const token& t) {\n\n    if (t._data.size() != sizeof(long)) {\n        throw runtime_exception(sprint(\"Invalid token. Should have size %ld, has size %ld\\n\", sizeof(long), t._data.size()));\n    }\n\n    auto ptr = t._data.begin();\n    auto lp = reinterpret_cast<const long *>(ptr);\n    return net::ntoh(*lp);\n}\n\nsstring murmur3_partitioner::to_sstring(const token& t) const {\n    return ::to_sstring(long_token(t));\n}\n\nbool murmur3_partitioner::is_equal(const token& t1, const token& t2) {\n\n    auto l1 = long_token(t1);\n    auto l2 = long_token(t2);\n\n    return l1 == l2;\n}\n\nbool murmur3_partitioner::is_less(const token& t1, const token& t2) {\n\n    auto l1 = long_token(t1);\n    auto l2 = long_token(t2);\n\n    return l1 < l2;\n}\n\ntoken murmur3_partitioner::midpoint(const token& t1, const token& t2) const {\n    auto l1 = long_token(t1);\n    auto l2 = long_token(t2);\n    \/\/ long_token is defined as signed, but the arithmetic works out the same\n    \/\/ without invoking undefined behavior with a signed type.\n    auto delta = (uint64_t(l2) - uint64_t(l1)) \/ 2;\n    if (l1 > l2) {\n        \/\/ wraparound\n        delta += 0x8000'0000'0000'0000;\n    }\n    auto mid = uint64_t(l1) + delta;\n    return get_token(mid);\n}\n\nstd::map<token, float>\nmurmur3_partitioner::describe_ownership(const std::vector<token>& sorted_tokens) {\n    abort();\n}\n\ndata_type\nmurmur3_partitioner::get_token_validator() {\n    abort();\n}\n\nunsigned\nmurmur3_partitioner::shard_of(const token& t) const {\n    int64_t l = long_token(t);\n    \/\/ treat l as a fraction between 0 and 1 and use 128-bit arithmetic to\n    \/\/ divide that range evenly among shards:\n    uint64_t adjusted = uint64_t(l) + uint64_t(std::numeric_limits<int64_t>::min());\n    return (__int128(adjusted) * smp::count) >> 64;\n}\n\nusing registry = class_registrator<i_partitioner, murmur3_partitioner>;\nstatic registry registrator(\"org.apache.cassandra.dht.Murmur3Partitioner\");\nstatic registry registrator_short_name(\"Murmur3Partitioner\");\n\n}\n\n\n<commit_msg>dht: fix load of misaligned address<commit_after>\/*\n * Copyright (C) 2015 Cloudius Systems, Ltd.\n *\/\n\n#include \"murmur3_partitioner.hh\"\n#include \"utils\/murmur_hash.hh\"\n#include \"sstables\/key.hh\"\n#include \"utils\/class_registrator.hh\"\n\nnamespace dht {\n\ninline\nint64_t\nmurmur3_partitioner::normalize(int64_t in) {\n    return in == std::numeric_limits<int64_t>::lowest()\n            ? std::numeric_limits<int64_t>::max()\n            : in;\n}\n\ntoken\nmurmur3_partitioner::get_token(bytes_view key) {\n    if (key.empty()) {\n        return minimum_token();\n    }\n    std::array<uint64_t, 2> hash;\n    utils::murmur_hash::hash3_x64_128(key, 0, hash);\n    return get_token(hash[0]);\n}\n\ntoken\nmurmur3_partitioner::get_token(uint64_t value) const {\n    \/\/ We don't normalize() the value, since token includes an is-before-everything\n    \/\/ indicator.\n    \/\/ FIXME: will this require a repair when importing a database?\n    auto t = net::hton(normalize(value));\n    bytes b(bytes::initialized_later(), 8);\n    std::copy_n(reinterpret_cast<int8_t*>(&t), 8, b.begin());\n    return token{token::kind::key, std::move(b)};\n}\n\ntoken\nmurmur3_partitioner::get_token(const sstables::key_view& key) {\n    return get_token(bytes_view(key));\n}\n\ntoken\nmurmur3_partitioner::get_token(const schema& s, partition_key_view key) {\n    std::array<uint64_t, 2> hash;\n    auto&& legacy = key.legacy_form(s);\n    utils::murmur_hash::hash3_x64_128(legacy.begin(), legacy.size(), 0, hash);\n    return get_token(hash[0]);\n}\n\ntoken murmur3_partitioner::get_random_token() {\n    auto rand = dht::get_random_number<uint64_t>();\n    return get_token(rand);\n}\n\ninline long long_token(const token& t) {\n\n    if (t._data.size() != sizeof(long)) {\n        throw runtime_exception(sprint(\"Invalid token. Should have size %ld, has size %ld\\n\", sizeof(long), t._data.size()));\n    }\n\n    auto ptr = t._data.begin();\n    auto lp = unaligned_cast<const long *>(ptr);\n    return net::ntoh(*lp);\n}\n\nsstring murmur3_partitioner::to_sstring(const token& t) const {\n    return ::to_sstring(long_token(t));\n}\n\nbool murmur3_partitioner::is_equal(const token& t1, const token& t2) {\n\n    auto l1 = long_token(t1);\n    auto l2 = long_token(t2);\n\n    return l1 == l2;\n}\n\nbool murmur3_partitioner::is_less(const token& t1, const token& t2) {\n\n    auto l1 = long_token(t1);\n    auto l2 = long_token(t2);\n\n    return l1 < l2;\n}\n\ntoken murmur3_partitioner::midpoint(const token& t1, const token& t2) const {\n    auto l1 = long_token(t1);\n    auto l2 = long_token(t2);\n    \/\/ long_token is defined as signed, but the arithmetic works out the same\n    \/\/ without invoking undefined behavior with a signed type.\n    auto delta = (uint64_t(l2) - uint64_t(l1)) \/ 2;\n    if (l1 > l2) {\n        \/\/ wraparound\n        delta += 0x8000'0000'0000'0000;\n    }\n    auto mid = uint64_t(l1) + delta;\n    return get_token(mid);\n}\n\nstd::map<token, float>\nmurmur3_partitioner::describe_ownership(const std::vector<token>& sorted_tokens) {\n    abort();\n}\n\ndata_type\nmurmur3_partitioner::get_token_validator() {\n    abort();\n}\n\nunsigned\nmurmur3_partitioner::shard_of(const token& t) const {\n    int64_t l = long_token(t);\n    \/\/ treat l as a fraction between 0 and 1 and use 128-bit arithmetic to\n    \/\/ divide that range evenly among shards:\n    uint64_t adjusted = uint64_t(l) + uint64_t(std::numeric_limits<int64_t>::min());\n    return (__int128(adjusted) * smp::count) >> 64;\n}\n\nusing registry = class_registrator<i_partitioner, murmur3_partitioner>;\nstatic registry registrator(\"org.apache.cassandra.dht.Murmur3Partitioner\");\nstatic registry registrator_short_name(\"Murmur3Partitioner\");\n\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/* mbed Microcontroller Library\n * Copyright (c) 2006-2013 ARM Limited\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"drivers\/SPI.h\"\n#include \"platform\/mbed_critical.h\"\n\n#if DEVICE_SPI\n\nnamespace mbed {\n\n#if DEVICE_SPI_ASYNCH && TRANSACTION_QUEUE_SIZE_SPI\nCircularBuffer<Transaction<SPI>, TRANSACTION_QUEUE_SIZE_SPI> SPI::_transaction_buffer;\n#endif\n\nSPI::SPI(PinName mosi, PinName miso, PinName sclk, PinName ssel) :\n        _spi(),\n#if DEVICE_SPI_ASYNCH\n        _irq(this),\n        _usage(DMA_USAGE_NEVER),\n#endif\n        _bits(8),\n        _mode(0),\n        _hz(1000000) {\n    \/\/ No lock needed in the constructor\n\n    spi_init(&_spi, mosi, miso, sclk, ssel);\n    _acquire();\n}\n\nvoid SPI::format(int bits, int mode) {\n    lock();\n    _bits = bits;\n    _mode = mode;\n    spi_format(&_spi, _bits, _mode, 0);\n    _owner = this;\n    unlock();\n}\n\nvoid SPI::frequency(int hz) {\n    lock();\n    _hz = hz;\n    spi_frequency(&_spi, _hz);\n    _owner = this;\n    unlock();\n}\n\nSPI* SPI::_owner = NULL;\nSingletonPtr<PlatformMutex> SPI::_mutex;\n\n\/\/ ignore the fact there are multiple physical spis, and always update if it wasnt us last\nvoid SPI::aquire() {\n    lock();\n     if (_owner != this) {\n        spi_format(&_spi, _bits, _mode, 0);\n        spi_frequency(&_spi, _hz);\n        _owner = this;\n    }\n    unlock();\n}\n\n\/\/ Note: Private function with no locking\nvoid SPI::_acquire() {\n     if (_owner != this) {\n        spi_format(&_spi, _bits, _mode, 0);\n        spi_frequency(&_spi, _hz);\n        _owner = this;\n    }\n}\n\nint SPI::write(int value) {\n    lock();\n    _acquire();\n    int ret = spi_master_write(&_spi, value);\n    unlock();\n    return ret;\n}\n\nint SPI::write(const char *tx_buffer, int tx_length, char *rx_buffer, int rx_length) {\n    lock();\n    _acquire();\n    int ret = spi_master_block_write(&_spi, tx_buffer, tx_length, rx_buffer, rx_length);\n    unlock();\n    return ret;\n}\n\nvoid SPI::lock() {\n    _mutex->lock();\n}\n\nvoid SPI::unlock() {\n    _mutex->unlock();\n}\n\n#if DEVICE_SPI_ASYNCH\n\nint SPI::transfer(const void *tx_buffer, int tx_length, void *rx_buffer, int rx_length, unsigned char bit_width, const event_callback_t& callback, int event)\n{\n    if (spi_active(&_spi)) {\n        return queue_transfer(tx_buffer, tx_length, rx_buffer, rx_length, bit_width, callback, event);\n    }\n    start_transfer(tx_buffer, tx_length, rx_buffer, rx_length, bit_width, callback, event);\n    return 0;\n}\n\nvoid SPI::abort_transfer()\n{\n    spi_abort_asynch(&_spi);\n#if TRANSACTION_QUEUE_SIZE_SPI\n    dequeue_transaction();\n#endif\n}\n\n\nvoid SPI::clear_transfer_buffer()\n{\n#if TRANSACTION_QUEUE_SIZE_SPI\n    _transaction_buffer.reset();\n#endif\n}\n\nvoid SPI::abort_all_transfers()\n{\n    clear_transfer_buffer();\n    abort_transfer();\n}\n\nint SPI::set_dma_usage(DMAUsage usage)\n{\n    if (spi_active(&_spi)) {\n        return -1;\n    }\n    _usage = usage;\n    return  0;\n}\n\nint SPI::queue_transfer(const void *tx_buffer, int tx_length, void *rx_buffer, int rx_length, unsigned char bit_width, const event_callback_t& callback, int event)\n{\n#if TRANSACTION_QUEUE_SIZE_SPI\n    transaction_t t;\n\n    t.tx_buffer = const_cast<void *>(tx_buffer);\n    t.tx_length = tx_length;\n    t.rx_buffer = rx_buffer;\n    t.rx_length = rx_length;\n    t.event = event;\n    t.callback = callback;\n    t.width = bit_width;\n    Transaction<SPI> transaction(this, t);\n    if (_transaction_buffer.full()) {\n        return -1; \/\/ the buffer is full\n    } else {\n        core_util_critical_section_enter();\n        _transaction_buffer.push(transaction);\n        if (!spi_active(&_spi)) {\n            dequeue_transaction();\n        }\n        core_util_critical_section_exit();\n        return 0;\n    }\n#else\n    return -1;\n#endif\n}\n\nvoid SPI::start_transfer(const void *tx_buffer, int tx_length, void *rx_buffer, int rx_length, unsigned char bit_width, const event_callback_t& callback, int event)\n{\n    _acquire();\n    _callback = callback;\n    _irq.callback(&SPI::irq_handler_asynch);\n    spi_master_transfer(&_spi, tx_buffer, tx_length, rx_buffer, rx_length, bit_width, _irq.entry(), event , _usage);\n}\n\n#if TRANSACTION_QUEUE_SIZE_SPI\n\nvoid SPI::start_transaction(transaction_t *data)\n{\n    start_transfer(data->tx_buffer, data->tx_length, data->rx_buffer, data->rx_length, data->width, data->callback, data->event);\n}\n\nvoid SPI::dequeue_transaction()\n{\n    Transaction<SPI> t;\n    if (_transaction_buffer.pop(t)) {\n        SPI* obj = t.get_object();\n        transaction_t* data = t.get_transaction();\n        obj->start_transaction(data);\n    }\n}\n\n#endif\n\nvoid SPI::irq_handler_asynch(void)\n{\n    int event = spi_irq_handler_asynch(&_spi);\n    if (_callback && (event & SPI_EVENT_ALL)) {\n        _callback.call(event & SPI_EVENT_ALL);\n    }\n#if TRANSACTION_QUEUE_SIZE_SPI\n    if (event & (SPI_EVENT_ALL | SPI_EVENT_INTERNAL_TRANSFER_COMPLETE)) {\n        \/\/ SPI peripheral is free (event happend), dequeue transaction\n        dequeue_transaction();\n    }\n#endif\n}\n\n#endif\n\n} \/\/ namespace mbed\n\n#endif\n<commit_msg>Corrected handling of format\/frequency<commit_after>\/* mbed Microcontroller Library\n * Copyright (c) 2006-2013 ARM Limited\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"drivers\/SPI.h\"\n#include \"platform\/mbed_critical.h\"\n\n#if DEVICE_SPI\n\nnamespace mbed {\n\n#if DEVICE_SPI_ASYNCH && TRANSACTION_QUEUE_SIZE_SPI\nCircularBuffer<Transaction<SPI>, TRANSACTION_QUEUE_SIZE_SPI> SPI::_transaction_buffer;\n#endif\n\nSPI::SPI(PinName mosi, PinName miso, PinName sclk, PinName ssel) :\n        _spi(),\n#if DEVICE_SPI_ASYNCH\n        _irq(this),\n        _usage(DMA_USAGE_NEVER),\n#endif\n        _bits(8),\n        _mode(0),\n        _hz(1000000) {\n    \/\/ No lock needed in the constructor\n\n    spi_init(&_spi, mosi, miso, sclk, ssel);\n    _acquire();\n}\n\nvoid SPI::format(int bits, int mode) {\n    lock();\n    _bits = bits;\n    _mode = mode;\n    \/\/ If changing format while you are the owner than just\n    \/\/ update format, but if owner is changed than even frequency should be\n    \/\/ updated which is done by acquire.\n    if (_owner == this) {\n        spi_format(&_spi, _bits, _mode, 0);\n    } else {\n        _acquire();\n    }\n    unlock();\n}\n\nvoid SPI::frequency(int hz) {\n    lock();\n    _hz = hz;\n    \/\/ If changing format while you are the owner than just\n    \/\/ update frequency, but if owner is changed than even frequency should be\n    \/\/ updated which is done by acquire.\n    if (_owner == this) {\n        spi_frequency(&_spi, _hz);\n    } else {\n        _acquire();\n    }\n    unlock();\n}\n\nSPI* SPI::_owner = NULL;\nSingletonPtr<PlatformMutex> SPI::_mutex;\n\n\/\/ ignore the fact there are multiple physical spis, and always update if it wasnt us last\nvoid SPI::aquire() {\n    lock();\n     if (_owner != this) {\n        spi_format(&_spi, _bits, _mode, 0);\n        spi_frequency(&_spi, _hz);\n        _owner = this;\n    }\n    unlock();\n}\n\n\/\/ Note: Private function with no locking\nvoid SPI::_acquire() {\n     if (_owner != this) {\n        spi_format(&_spi, _bits, _mode, 0);\n        spi_frequency(&_spi, _hz);\n        _owner = this;\n    }\n}\n\nint SPI::write(int value) {\n    lock();\n    _acquire();\n    int ret = spi_master_write(&_spi, value);\n    unlock();\n    return ret;\n}\n\nint SPI::write(const char *tx_buffer, int tx_length, char *rx_buffer, int rx_length) {\n    lock();\n    _acquire();\n    int ret = spi_master_block_write(&_spi, tx_buffer, tx_length, rx_buffer, rx_length);\n    unlock();\n    return ret;\n}\n\nvoid SPI::lock() {\n    _mutex->lock();\n}\n\nvoid SPI::unlock() {\n    _mutex->unlock();\n}\n\n#if DEVICE_SPI_ASYNCH\n\nint SPI::transfer(const void *tx_buffer, int tx_length, void *rx_buffer, int rx_length, unsigned char bit_width, const event_callback_t& callback, int event)\n{\n    if (spi_active(&_spi)) {\n        return queue_transfer(tx_buffer, tx_length, rx_buffer, rx_length, bit_width, callback, event);\n    }\n    start_transfer(tx_buffer, tx_length, rx_buffer, rx_length, bit_width, callback, event);\n    return 0;\n}\n\nvoid SPI::abort_transfer()\n{\n    spi_abort_asynch(&_spi);\n#if TRANSACTION_QUEUE_SIZE_SPI\n    dequeue_transaction();\n#endif\n}\n\n\nvoid SPI::clear_transfer_buffer()\n{\n#if TRANSACTION_QUEUE_SIZE_SPI\n    _transaction_buffer.reset();\n#endif\n}\n\nvoid SPI::abort_all_transfers()\n{\n    clear_transfer_buffer();\n    abort_transfer();\n}\n\nint SPI::set_dma_usage(DMAUsage usage)\n{\n    if (spi_active(&_spi)) {\n        return -1;\n    }\n    _usage = usage;\n    return  0;\n}\n\nint SPI::queue_transfer(const void *tx_buffer, int tx_length, void *rx_buffer, int rx_length, unsigned char bit_width, const event_callback_t& callback, int event)\n{\n#if TRANSACTION_QUEUE_SIZE_SPI\n    transaction_t t;\n\n    t.tx_buffer = const_cast<void *>(tx_buffer);\n    t.tx_length = tx_length;\n    t.rx_buffer = rx_buffer;\n    t.rx_length = rx_length;\n    t.event = event;\n    t.callback = callback;\n    t.width = bit_width;\n    Transaction<SPI> transaction(this, t);\n    if (_transaction_buffer.full()) {\n        return -1; \/\/ the buffer is full\n    } else {\n        core_util_critical_section_enter();\n        _transaction_buffer.push(transaction);\n        if (!spi_active(&_spi)) {\n            dequeue_transaction();\n        }\n        core_util_critical_section_exit();\n        return 0;\n    }\n#else\n    return -1;\n#endif\n}\n\nvoid SPI::start_transfer(const void *tx_buffer, int tx_length, void *rx_buffer, int rx_length, unsigned char bit_width, const event_callback_t& callback, int event)\n{\n    _acquire();\n    _callback = callback;\n    _irq.callback(&SPI::irq_handler_asynch);\n    spi_master_transfer(&_spi, tx_buffer, tx_length, rx_buffer, rx_length, bit_width, _irq.entry(), event , _usage);\n}\n\n#if TRANSACTION_QUEUE_SIZE_SPI\n\nvoid SPI::start_transaction(transaction_t *data)\n{\n    start_transfer(data->tx_buffer, data->tx_length, data->rx_buffer, data->rx_length, data->width, data->callback, data->event);\n}\n\nvoid SPI::dequeue_transaction()\n{\n    Transaction<SPI> t;\n    if (_transaction_buffer.pop(t)) {\n        SPI* obj = t.get_object();\n        transaction_t* data = t.get_transaction();\n        obj->start_transaction(data);\n    }\n}\n\n#endif\n\nvoid SPI::irq_handler_asynch(void)\n{\n    int event = spi_irq_handler_asynch(&_spi);\n    if (_callback && (event & SPI_EVENT_ALL)) {\n        _callback.call(event & SPI_EVENT_ALL);\n    }\n#if TRANSACTION_QUEUE_SIZE_SPI\n    if (event & (SPI_EVENT_ALL | SPI_EVENT_INTERNAL_TRANSFER_COMPLETE)) {\n        \/\/ SPI peripheral is free (event happend), dequeue transaction\n        dequeue_transaction();\n    }\n#endif\n}\n\n#endif\n\n} \/\/ namespace mbed\n\n#endif\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 examples 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:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"customshadereffect.h\"\n#include <QGLShaderProgram>\n\nstatic char const colorizeShaderCode[] =\n    \"uniform lowp vec4 effectColor;\\n\"\n    \"mediump vec4 customShader(lowp sampler2D imageTexture, highp vec2 textureCoords) {\\n\"\n    \"    vec4 src = texture2D(imageTexture, textureCoords);\\n\"\n    \"    float gray = dot(src.rgb, vec3(0.212671, 0.715160, 0.072169));\\n\"\n    \"    vec4 colorize = 1.0-((1.0-gray)*(1.0-effectColor));\\n\"\n    \"    return vec4(colorize.rgb, src.a);\\n\"\n    \"}\";\n\nCustomShaderEffect::CustomShaderEffect()\n    : QGraphicsShaderEffect(),\n      color(Qt::red)\n{\n    setPixelShaderFragment(colorizeShaderCode);\n}\n\nvoid CustomShaderEffect::setEffectColor(const QColor& c)\n{\n    color = c;\n    setUniformsDirty();\n}\n\nvoid CustomShaderEffect::setUniforms(QGLShaderProgram *program)\n{\n    program->setUniformValue(\"effectColor\", color);\n}\n<commit_msg>Fixed custom shader example to correctly use premultiplied colors.<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 examples 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:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"customshadereffect.h\"\n#include <QGLShaderProgram>\n\nstatic char const colorizeShaderCode[] =\n    \"uniform lowp vec4 effectColor;\\n\"\n    \"mediump vec4 customShader(lowp sampler2D imageTexture, highp vec2 textureCoords) {\\n\"\n    \"    vec4 src = texture2D(imageTexture, textureCoords);\\n\"\n    \"    float gray = dot(src.rgb, vec3(0.212671, 0.715160, 0.072169));\\n\"\n    \"    vec4 colorize = 1.0-((1.0-gray)*(1.0-effectColor));\\n\"\n    \"    return vec4(colorize.rgb * src.a, src.a);\\n\"\n    \"}\";\n\nCustomShaderEffect::CustomShaderEffect()\n    : QGraphicsShaderEffect(),\n      color(Qt::red)\n{\n    setPixelShaderFragment(colorizeShaderCode);\n}\n\nvoid CustomShaderEffect::setEffectColor(const QColor& c)\n{\n    color = c;\n    setUniformsDirty();\n}\n\nvoid CustomShaderEffect::setUniforms(QGLShaderProgram *program)\n{\n    program->setUniformValue(\"effectColor\", color);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/point_types.h>\n#include <pcl\/features\/pfh.h>\n#include <pcl\/features\/normal_3d.h>\n\nint\nmain (int argc, char** argv)\n{\n  std::string fileName = argv[1];\n  std::cout << \"Reading \" << fileName << std::endl;\n\n  pcl::PointCloud<pcl::PointXYZ>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZ>);\n\n  if (pcl::io::loadPCDFile<pcl::PointXYZ> (fileName, *cloud) == -1) \/\/* load the file\n  {\n    PCL_ERROR (\"Couldn't read file\");\n    return (-1);\n  }\n\n  std::cout << \"Loaded \" << cloud->points.size() << \" points.\" << std::endl;\n\n  \/\/ Compute the normals\n  pcl::NormalEstimation<pcl::PointXYZ, pcl::Normal> normalEstimation;\n  normalEstimation.setInputCloud (cloud);\n\n  pcl::search::KdTree<pcl::PointXYZ>::Ptr tree (new pcl::search::KdTree<pcl::PointXYZ>);\n  normalEstimation.setSearchMethod (tree);\n\n  pcl::PointCloud<pcl::Normal>::Ptr cloudWithNormals (new pcl::PointCloud<pcl::Normal>);\n\n  normalEstimation.setRadiusSearch (0.03);\n\n  normalEstimation.compute (*cloudWithNormals);\n\n  \/\/ Setup the feature computation\n\n  pcl::PFHEstimation<pcl::PointXYZ, pcl::Normal, pcl::PFHSignature125> pfhEstimation;\n  \/\/ Provide the original point cloud (without normals)\n  pfhEstimation.setInputCloud (cloud);\n  \/\/ Provide the point cloud with normals\n  pfhEstimation.setInputNormals(cloudWithNormals);\n\n  \/\/ pfhEstimation.setInputWithNormals(cloud, cloudWithNormals); PFHEstimation does not have this function\n  \/\/ Use the same KdTree from the normal estimation\n  pfhEstimation.setSearchMethod (tree);\n\n  pcl::PointCloud<pcl::PFHSignature125>::Ptr pfhFeatures(new pcl::PointCloud<pcl::PFHSignature125>);\n\n  pfhEstimation.setRadiusSearch (0.2);\n\n  \/\/ Actually compute the spin images\n  pfhEstimation.compute (*pfhFeatures);\n\n  std::cout << \"output points.size (): \" << pfhFeatures->points.size () << std::endl;\n\n  \/\/ Display and retrieve the shape context descriptor vector for the 0th point.\n  pcl::PFHSignature125 descriptor = pfhFeatures->points[0];\n  std::cout << descriptor << std::endl;\n\n  return 0;\n}\n<commit_msg>examples\/ added another license<commit_after>\/*\n * Software License Agreement (BSD License)\n *\n * Point Cloud Library (PCL) - www.pointclouds.org\n * Copyright (c) 2009-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\n#include <iostream>\n#include <vector>\n\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/point_types.h>\n#include <pcl\/features\/pfh.h>\n#include <pcl\/features\/normal_3d.h>\n\n\nint\nmain (int argc, char** argv)\n{\n  std::string fileName = argv[1];\n  std::cout << \"Reading \" << fileName << std::endl;\n\n  pcl::PointCloud<pcl::PointXYZ>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZ>);\n\n  if (pcl::io::loadPCDFile<pcl::PointXYZ> (fileName, *cloud) == -1) \/\/* load the file\n  {\n    PCL_ERROR (\"Couldn't read file\");\n    return (-1);\n  }\n\n  std::cout << \"Loaded \" << cloud->points.size () << \" points.\" << std::endl;\n\n  \/\/ Compute the normals\n  pcl::NormalEstimation<pcl::PointXYZ, pcl::Normal> normalEstimation;\n  normalEstimation.setInputCloud (cloud);\n\n  pcl::search::KdTree<pcl::PointXYZ>::Ptr tree (new pcl::search::KdTree<pcl::PointXYZ>);\n  normalEstimation.setSearchMethod (tree);\n\n  pcl::PointCloud<pcl::Normal>::Ptr cloudWithNormals (new pcl::PointCloud<pcl::Normal>);\n\n  normalEstimation.setRadiusSearch (0.03);\n\n  normalEstimation.compute (*cloudWithNormals);\n\n  \/\/ Setup the feature computation\n\n  pcl::PFHEstimation<pcl::PointXYZ, pcl::Normal, pcl::PFHSignature125> pfhEstimation;\n  \/\/ Provide the original point cloud (without normals)\n  pfhEstimation.setInputCloud (cloud);\n  \/\/ Provide the point cloud with normals\n  pfhEstimation.setInputNormals (cloudWithNormals);\n\n  \/\/ pfhEstimation.setInputWithNormals (cloud, cloudWithNormals); PFHEstimation does not have this function\n  \/\/ Use the same KdTree from the normal estimation\n  pfhEstimation.setSearchMethod (tree);\n\n  pcl::PointCloud<pcl::PFHSignature125>::Ptr pfhFeatures (new pcl::PointCloud<pcl::PFHSignature125>);\n\n  pfhEstimation.setRadiusSearch (0.2);\n\n  \/\/ Actually compute the spin images\n  pfhEstimation.compute (*pfhFeatures);\n\n  std::cout << \"output points.size (): \" << pfhFeatures->points.size () << std::endl;\n\n  \/\/ Display and retrieve the shape context descriptor vector for the 0th point.\n  pcl::PFHSignature125 descriptor = pfhFeatures->points[0];\n  std::cout << descriptor << std::endl;\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <igl\/viewer\/Viewer.h>\r\n#include <igl\/tetgen\/tetrahedralize.h>\r\n#include <igl\/readOFF.h>\r\n\r\n\/\/ Input polygon\r\nEigen::MatrixXd V;\r\nEigen::MatrixXi F;\r\n\r\n\/\/ Tetrahedralized interior\r\nEigen::MatrixXd TV;\r\nEigen::MatrixXi TT;\r\nEigen::MatrixXi TF;\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n  using namespace Eigen;\r\n  using namespace std;\r\n\r\n  \/\/ Load a surface mesh\r\n  igl::readOFF(\"..\/shared\/fertility.off\",V,F);\r\n  \r\n  \/\/ Tetrahedralize the interior\r\n  igl::tetrahedralize(V,F,\"pq1.414\", TV,TT,TF);\r\n\r\n  \/\/ Compute berycenters\r\n  \r\n  \/\/ Plot the generated mesh\r\n  igl::Viewer viewer;\r\n  viewer.set_mesh(V,F);\r\n  viewer.launch();\r\n}\r\n<commit_msg>* finished tutorial example for tetgen<commit_after>#include <igl\/viewer\/Viewer.h>\r\n#include <igl\/tetgen\/tetrahedralize.h>\r\n#include <igl\/readOFF.h>\r\n#include <igl\/barycenter.h>\r\n\r\n\/\/ Input polygon\r\nEigen::MatrixXd V;\r\nEigen::MatrixXi F;\r\nEigen::MatrixXd B;\r\n\r\n\/\/ Tetrahedralized interior\r\nEigen::MatrixXd TV;\r\nEigen::MatrixXi TT;\r\nEigen::MatrixXi TF;\r\n\r\n\/\/ This function is called every time a keyboard button is pressed\r\nbool key_down(igl::Viewer& viewer, unsigned char key, int modifier)\r\n{\r\n  using namespace std;\r\n  using namespace Eigen;\r\n\r\n  if (key >= '1' && key <= '9')\r\n  {\r\n    double t = double((key - '1')+1) \/ 9.0;\r\n\r\n    VectorXd v = B.col(2).array() - B.col(2).minCoeff();\r\n    v \/= v.col(0).maxCoeff();\r\n\r\n    vector<int> s;\r\n\r\n    for (unsigned i=0; i<v.size();++i)\r\n      if (v(i) < t)\r\n        s.push_back(i);\r\n\r\n    MatrixXd V_temp(s.size()*4,3);\r\n    MatrixXi F_temp(s.size()*4,3);\r\n\r\n    for (unsigned i=0; i<s.size();++i)\r\n    {\r\n      V_temp.row(i*4+0) = TV.row(TT(s[i],0));\r\n      V_temp.row(i*4+1) = TV.row(TT(s[i],1));\r\n      V_temp.row(i*4+2) = TV.row(TT(s[i],2));\r\n      V_temp.row(i*4+3) = TV.row(TT(s[i],3));\r\n      F_temp.row(i*4+0) << (i*4)+0, (i*4)+1, (i*4)+3;\r\n      F_temp.row(i*4+1) << (i*4)+0, (i*4)+2, (i*4)+1;\r\n      F_temp.row(i*4+2) << (i*4)+3, (i*4)+2, (i*4)+0;\r\n      F_temp.row(i*4+3) << (i*4)+1, (i*4)+2, (i*4)+3;\r\n    }\r\n\r\n    viewer.clear_mesh();\r\n    viewer.set_mesh(V_temp,F_temp);\r\n    viewer.options.face_based = true;\r\n  }\r\n\r\n\r\n  return false;\r\n}\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n  using namespace Eigen;\r\n  using namespace std;\r\n\r\n  \/\/ Load a surface mesh\r\n  igl::readOFF(\"..\/shared\/fertility.off\",V,F);\r\n\r\n  \/\/ Tetrahedralize the interior\r\n  igl::tetrahedralize(V,F,\"pq1.414\", TV,TT,TF);\r\n\r\n  \/\/ Compute barycenters\r\n  igl::barycenter(TV,TT,B);\r\n\r\n  \/\/ Plot the generated mesh\r\n  igl::Viewer viewer;\r\n  viewer.callback_key_down = &key_down;\r\n  key_down(viewer,'5',0);\r\n  viewer.launch();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <thread>\n#include <chrono>\n#include <random>\n#include <time.h>\n#include <assert.h>\n#include \"IntervalTree.h\"\n#define CATCH_CONFIG_RUNNER \/\/ Mark this as file as the test-runner for catch\n#include \"catch.hpp\"        \/\/ Include the catch unit test framework\n\nusing namespace std;\n\ntypedef Interval<bool> interval;\ntypedef vector<interval> intervalVector;\ntypedef IntervalTree<bool> intervalTree;\n\nTEST_CASE( \"Empty tree\" ) {\n    IntervalTree<int> t;\n    REQUIRE( t.findOverlapping(-1,1).size() == 0 );\n}\n\nTEST_CASE( \"Singleton tree\" ) {\n    vector<Interval<double>> values{{1,3,5.5}};\n    IntervalTree<double> t{values};\n\n    SECTION (\"Point query on left\") {\n\tauto v = t.findOverlapping(1,1);\n\tREQUIRE( v.size() == 1);\n\tREQUIRE( v.front().start == 1 );\n\tREQUIRE( v.front().stop == 3 );\n\tREQUIRE( v.front().value == 5.5 );\n    }\n}\n\ntemplate<typename K>\nK randKey(K floor, K ceiling) {\n    K range = ceiling - floor;\n    return floor + range * ((double) rand() \/ (double) (RAND_MAX + 1.0));\n}\n\ntemplate<class T, typename K>\nInterval<T,K> randomInterval(K maxStart, K maxLength, K maxStop, const T& value) {\n    K start = randKey<K>(0, maxStart);\n    K stop = min<K>(randKey<K>(start, start + maxLength), maxStop);\n    return Interval<T,K>(start, stop, value);\n}\n\nint main(int argc, char**argv) {\n    typedef vector<std::size_t> countsVector;\n\n    \/\/ a simple sanity check\n    intervalVector sanityIntervals;\n    sanityIntervals.push_back(interval(60, 80, true));\n    sanityIntervals.push_back(interval(20, 40, true));\n    intervalTree sanityTree(sanityIntervals);\n\n    intervalVector sanityResults;\n    sanityTree.findOverlapping(30, 50, sanityResults);\n    assert(sanityResults.size() == 1);\n    sanityResults.clear();\n    sanityTree.findContained(15, 45, sanityResults);\n    assert(sanityResults.size() == 1);\n\n\n    srand((unsigned)time(NULL));\n\n    intervalVector intervals;\n    intervalVector queries;\n\n    \/\/ generate a test set of target intervals\n    for (int i = 0; i < 10000; ++i) {\n        intervals.push_back(randomInterval<bool, unsigned long>(100000, 1000, 100000 + 1, true));\n    }\n    \/\/ and queries\n    for (int i = 0; i < 5000; ++i) {\n        queries.push_back(randomInterval<bool, unsigned long>(100000, 1000, 100000 + 1, true));\n    }\n\n    typedef chrono::high_resolution_clock Clock;\n    typedef chrono::milliseconds milliseconds;\n\n    \/\/ using brute-force search\n    countsVector bruteforcecounts;\n    Clock::time_point t0 = Clock::now();\n    for (intervalVector::iterator q = queries.begin(); q != queries.end(); ++q) {\n        intervalVector results;\n        for (intervalVector::iterator i = intervals.begin(); i != intervals.end(); ++i) {\n            if (i->start >= q->start && i->stop <= q->stop) {\n                results.push_back(*i);\n            }\n        }\n        bruteforcecounts.push_back(results.size());\n    }\n    Clock::time_point t1 = Clock::now();\n    milliseconds ms = chrono::duration_cast<milliseconds>(t1 - t0);\n    cout << \"brute force:\\t\" << ms.count() << \"ms\" << endl;\n\n    \/\/ using the interval tree\n    intervalTree tree = intervalTree(intervals);\n    countsVector treecounts;\n    t0 = Clock::now();\n    for (intervalVector::iterator q = queries.begin(); q != queries.end(); ++q) {\n        intervalVector results;\n        tree.findContained(q->start, q->stop, results);\n        treecounts.push_back(results.size());\n    }\n    t1 = Clock::now();\n    ms = std::chrono::duration_cast<milliseconds>(t1 - t0);\n    cout << \"interval tree:\\t\" << ms.count() << \"ms\" << endl;\n\n    \/\/ check that the same number of results are returned\n    countsVector::iterator b = bruteforcecounts.begin();\n    for (countsVector::iterator t = treecounts.begin(); t != treecounts.end(); ++t, ++b) {\n        assert(*b == *t);\n    }\n\n    return Catch::Session().run( argc, argv );\n}\n<commit_msg>Check that identical intervals are both stored<commit_after>#include <iostream>\n#include <thread>\n#include <chrono>\n#include <random>\n#include <time.h>\n#include <assert.h>\n#include \"IntervalTree.h\"\n#define CATCH_CONFIG_RUNNER \/\/ Mark this as file as the test-runner for catch\n#include \"catch.hpp\"        \/\/ Include the catch unit test framework\n\nusing namespace std;\n\ntypedef Interval<bool> interval;\ntypedef vector<interval> intervalVector;\ntypedef IntervalTree<bool> intervalTree;\n\nTEST_CASE( \"Empty tree\" ) {\n    IntervalTree<int> t;\n    REQUIRE( t.findOverlapping(-1,1).size() == 0 );\n}\n\nTEST_CASE( \"Singleton tree\" ) {\n    vector<Interval<double>> values{{1,3,5.5}};\n    IntervalTree<double> t{values};\n\n    SECTION (\"Point query on left\") {\n\tauto v = t.findOverlapping(1,1);\n\tREQUIRE( v.size() == 1);\n\tREQUIRE( v.front().start == 1 );\n\tREQUIRE( v.front().stop == 3 );\n\tREQUIRE( v.front().value == 5.5 );\n    }\n\n    SECTION (\"Point query in middle\") {\n\tauto v = t.findOverlapping(2,2);\n\tREQUIRE( v.size() == 1);\n\tREQUIRE( v.front().start == 1 );\n\tREQUIRE( v.front().stop == 3 );\n\tREQUIRE( v.front().value == 5.5 );\n    }\n\n    SECTION (\"Point query on right\") {\n\tauto v = t.findOverlapping(3,3);\n\tREQUIRE( v.size() == 1);\n\tREQUIRE( v.front().start == 1 );\n\tREQUIRE( v.front().stop == 3 );\n\tREQUIRE( v.front().value == 5.5 );\n    }\n\n    SECTION (\"Non-overlapping queries\") {\n\tREQUIRE( t.findOverlapping(4,4).size() == 0);\n\tREQUIRE( t.findOverlapping(0,0).size() == 0);\n    }\n}\n\nTEST_CASE( \"Two identical intervals with different contents\" ) {\n    vector<Interval<double>> values{{5,10,10.5},{5,10,5.5}};\n    IntervalTree<double> t{values};\n\n    auto v = t.findOverlapping(6,6);\n    REQUIRE( v.size() == 2);\n    REQUIRE( v.front().start == 5 );\n    REQUIRE( v.front().stop == 10 );\n    REQUIRE( v.back().start == 5 );\n    REQUIRE( v.back().stop == 10 );\n    set<double> expected{5.5, 10.5};\n    set<double> actual{v.front().value, v.back().value};\n    REQUIRE( actual == expected);\n}\n\ntemplate<typename K>\nK randKey(K floor, K ceiling) {\n    K range = ceiling - floor;\n    return floor + range * ((double) rand() \/ (double) (RAND_MAX + 1.0));\n}\n\ntemplate<class T, typename K>\nInterval<T,K> randomInterval(K maxStart, K maxLength, K maxStop, const T& value) {\n    K start = randKey<K>(0, maxStart);\n    K stop = min<K>(randKey<K>(start, start + maxLength), maxStop);\n    return Interval<T,K>(start, stop, value);\n}\n\nint main(int argc, char**argv) {\n    typedef vector<std::size_t> countsVector;\n\n    \/\/ a simple sanity check\n    intervalVector sanityIntervals;\n    sanityIntervals.push_back(interval(60, 80, true));\n    sanityIntervals.push_back(interval(20, 40, true));\n    intervalTree sanityTree(sanityIntervals);\n\n    intervalVector sanityResults;\n    sanityTree.findOverlapping(30, 50, sanityResults);\n    assert(sanityResults.size() == 1);\n    sanityResults.clear();\n    sanityTree.findContained(15, 45, sanityResults);\n    assert(sanityResults.size() == 1);\n\n\n    srand((unsigned)time(NULL));\n\n    intervalVector intervals;\n    intervalVector queries;\n\n    \/\/ generate a test set of target intervals\n    for (int i = 0; i < 10000; ++i) {\n        intervals.push_back(randomInterval<bool, unsigned long>(100000, 1000, 100000 + 1, true));\n    }\n    \/\/ and queries\n    for (int i = 0; i < 5000; ++i) {\n        queries.push_back(randomInterval<bool, unsigned long>(100000, 1000, 100000 + 1, true));\n    }\n\n    typedef chrono::high_resolution_clock Clock;\n    typedef chrono::milliseconds milliseconds;\n\n    \/\/ using brute-force search\n    countsVector bruteforcecounts;\n    Clock::time_point t0 = Clock::now();\n    for (intervalVector::iterator q = queries.begin(); q != queries.end(); ++q) {\n        intervalVector results;\n        for (intervalVector::iterator i = intervals.begin(); i != intervals.end(); ++i) {\n            if (i->start >= q->start && i->stop <= q->stop) {\n                results.push_back(*i);\n            }\n        }\n        bruteforcecounts.push_back(results.size());\n    }\n    Clock::time_point t1 = Clock::now();\n    milliseconds ms = chrono::duration_cast<milliseconds>(t1 - t0);\n    cout << \"brute force:\\t\" << ms.count() << \"ms\" << endl;\n\n    \/\/ using the interval tree\n    intervalTree tree = intervalTree(intervals);\n    countsVector treecounts;\n    t0 = Clock::now();\n    for (intervalVector::iterator q = queries.begin(); q != queries.end(); ++q) {\n        intervalVector results;\n        tree.findContained(q->start, q->stop, results);\n        treecounts.push_back(results.size());\n    }\n    t1 = Clock::now();\n    ms = std::chrono::duration_cast<milliseconds>(t1 - t0);\n    cout << \"interval tree:\\t\" << ms.count() << \"ms\" << endl;\n\n    \/\/ check that the same number of results are returned\n    countsVector::iterator b = bruteforcecounts.begin();\n    for (countsVector::iterator t = treecounts.begin(); t != treecounts.end(); ++t, ++b) {\n        assert(*b == *t);\n    }\n\n    return Catch::Session().run( argc, argv );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Author: Scott Ware <scott.r.ware@intel.com>\n * Copyright (c) 2014 Intel Corporation.\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#include <iostream>\n#include <unistd.h>\n#include <stdlib.h>\n#include <math.h>\n\n#include \"max44009.h\"\n\nusing namespace upm;\n\nMAX44009::MAX44009 (int bus, int devAddr) {\n    m_name = \"MAX44009\";\n\n    m_maxControlAddr = devAddr;\n    m_bus = bus;\n\n    m_i2cMaxControlCtx = mraa_i2c_init(m_bus);\n\n    mraa_result_t ret = mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    if (ret != MRAA_SUCCESS) {\n        fprintf(stderr, \"Messed up i2c bus\\n\");\n    }\n}\n\nMAX44009::~MAX44009() {\n    mraa_i2c_stop(m_i2cMaxControlCtx);\n}\n\nmraa_result_t\nMAX44009::getLuxValue (uint16_t* value) {\n    uint8_t data = 0;\n    uint8_t exponent = 0;\n    uint8_t mantissa = 0;\n    mraa_result_t status = MRAA_SUCCESS;\n\n    status = i2cReadReg_8 (LUXDATA_HIGH, &data);\n    if(status != MRAA_SUCCESS) { return status; }\n\n    exponent = data >> 4;\n    mantissa = data & 0xF;\n\n    \/\/ Check for overrange condition\n    if(exponent == 0x457) { return MRAA_ERROR_INVALID_RESOURCE; }\n\n    *value = pow(2, exponent) * mantissa * 0.72;\n\n    return status;\n}\n\n\/*\n * **************\n *  private area\n * **************\n *\/\nmraa_result_t\nMAX44009::i2cReadReg_8 (int reg, uint8_t* data) {\n    mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    mraa_i2c_write_byte(m_i2cMaxControlCtx, reg);\n    mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    mraa_i2c_read(m_i2cMaxControlCtx, data, 0x1);\n\n    if(*data == -1) {return MRAA_ERROR_INVALID_RESOURCE; }\n\n    return MRAA_SUCCESS;\n}\n\nmraa_result_t\nMAX44009::i2cReadReg_16 (int reg, uint16_t* data) {\n    mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    mraa_i2c_write_byte(m_i2cMaxControlCtx, reg);\n\n    mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    mraa_i2c_read(m_i2cMaxControlCtx, (uint8_t *)data, 0x2);\n\n    if(*data == -1) {return MRAA_ERROR_INVALID_RESOURCE; }\n\n    return MRAA_SUCCESS;\n}\n\nmraa_result_t\nMAX44009::i2cWriteReg (uint8_t reg, uint8_t value) {\n    uint8_t data[2] = { reg, value };\n    mraa_i2c_address (m_i2cMaxControlCtx, m_maxControlAddr);\n    return mraa_i2c_write (m_i2cMaxControlCtx, data, 2);\n}\n<commit_msg>max44009: Forgot to delete variable.<commit_after>\/*\n * Author: Scott Ware <scott.r.ware@intel.com>\n * Copyright (c) 2014 Intel Corporation.\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#include <iostream>\n#include <unistd.h>\n#include <stdlib.h>\n#include <math.h>\n\n#include \"max44009.h\"\n\nusing namespace upm;\n\nMAX44009::MAX44009 (int bus, int devAddr) {\n\n    m_maxControlAddr = devAddr;\n    m_bus = bus;\n\n    m_i2cMaxControlCtx = mraa_i2c_init(m_bus);\n\n    mraa_result_t ret = mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    if (ret != MRAA_SUCCESS) {\n        fprintf(stderr, \"Messed up i2c bus\\n\");\n    }\n}\n\nMAX44009::~MAX44009() {\n    mraa_i2c_stop(m_i2cMaxControlCtx);\n}\n\nmraa_result_t\nMAX44009::getLuxValue (uint16_t* value) {\n    uint8_t data = 0;\n    uint8_t exponent = 0;\n    uint8_t mantissa = 0;\n    mraa_result_t status = MRAA_SUCCESS;\n\n    status = i2cReadReg_8 (LUXDATA_HIGH, &data);\n    if(status != MRAA_SUCCESS) { return status; }\n\n    exponent = data >> 4;\n    mantissa = data & 0xF;\n\n    \/\/ Check for overrange condition\n    if(exponent == 0x457) { return MRAA_ERROR_INVALID_RESOURCE; }\n\n    *value = pow(2, exponent) * mantissa * 0.72;\n\n    return status;\n}\n\n\/*\n * **************\n *  private area\n * **************\n *\/\nmraa_result_t\nMAX44009::i2cReadReg_8 (int reg, uint8_t* data) {\n    mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    mraa_i2c_write_byte(m_i2cMaxControlCtx, reg);\n    mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    mraa_i2c_read(m_i2cMaxControlCtx, data, 0x1);\n\n    if(*data == -1) {return MRAA_ERROR_INVALID_RESOURCE; }\n\n    return MRAA_SUCCESS;\n}\n\nmraa_result_t\nMAX44009::i2cReadReg_16 (int reg, uint16_t* data) {\n    mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    mraa_i2c_write_byte(m_i2cMaxControlCtx, reg);\n\n    mraa_i2c_address(m_i2cMaxControlCtx, m_maxControlAddr);\n    mraa_i2c_read(m_i2cMaxControlCtx, (uint8_t *)data, 0x2);\n\n    if(*data == -1) {return MRAA_ERROR_INVALID_RESOURCE; }\n\n    return MRAA_SUCCESS;\n}\n\nmraa_result_t\nMAX44009::i2cWriteReg (uint8_t reg, uint8_t value) {\n    uint8_t data[2] = { reg, value };\n    mraa_i2c_address (m_i2cMaxControlCtx, m_maxControlAddr);\n    return mraa_i2c_write (m_i2cMaxControlCtx, data, 2);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*-c++-*-\n\n\/*\n * demonstrates usage of osg::TextureRectangle.\n *\n * Actually there isn't much difference to the rest of the osg::Texture*\n * bunch only this:\n * - texture coordinates for texture rectangles must be in image\n *   coordinates instead of normalized coordinates (0-1). So for a 500x250\n *   image the coordinates for the entire image would be\n *   0,250 0,0 500,0 500,250 instead of 0,1 0,0 1,0 1,1\n * - only the following wrap modes are supported (but not enforced)\n *   CLAMP, CLAMP_TO_EDGE, CLAMP_TO_BORDER\n * - a border is not supported\n * - mipmap is not supported\n *\/\n\n#include <osg\/Notify>\n#include <osg\/TextureRectangle>\n#include <osg\/Geometry>\n#include <osg\/Geode>\n\n#include <osg\/Group>\n#include <osg\/Projection>\n#include <osg\/MatrixTransform>\n#include <osgText\/Text>\n\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n\n#include <osgProducer\/Viewer>\n\n\n\/**********************************************************************\n *\n * Texture pan animation callback\n *\n **********************************************************************\/\n\nclass TexturePanCallback : public osg::NodeCallback\n{\npublic:\n    TexturePanCallback(osg::Geometry* geom, osg::Image* img,\n                       double delay = 0.05) :\n        _geom(geom),\n        _img(img),\n        _phaseS(35.0f),\n        _phaseT(18.0f),\n        _phaseScale(5.0f),\n        _delay(delay),\n        _prevTime(0.0)\n    {\n    }\n\n    virtual void operator()(osg::Node*, osg::NodeVisitor* nv)\n    {\n        if (!_geom || !_img)\n            return;\n\n        if (nv->getFrameStamp()) {\n            double currTime = nv->getFrameStamp()->getReferenceTime();\n            if (currTime - _prevTime > _delay) {\n\n                float rad = osg::DegreesToRadians(currTime);\n\n                \/\/ zoom scale (0.2 - 1.0)\n                float scale = sin(rad * _phaseScale) * 0.4f + 0.6f;\n                float scaleR = 1.0f - scale;\n\n                \/\/ calculate new texture coordinates\n                float s, t;\n                s = ((sin(rad * _phaseS) + 1) * 0.5f) * (_img->s() * scaleR);\n                t = ((sin(rad * _phaseT) + 1) * 0.5f) * (_img->t() * scaleR);\n\n                \/\/ set new texture coordinate array\n                osg::Vec2Array* texcoords = (osg::Vec2Array*) _geom->getTexCoordArray(0);\n                float w = _img->s() * scale, h = _img->t() * scale;\n                (*texcoords)[0].set(s, t+h);\n                (*texcoords)[1].set(s, t);\n                (*texcoords)[2].set(s+w, t);\n                (*texcoords)[3].set(s+w, t+h);\n\n                \/\/ record time\n                _prevTime = currTime;\n            }\n        }\n    }\n\nprivate:\n    osg::Geometry* _geom;\n    osg::Image* _img;\n\n    float _phaseS, _phaseT, _phaseScale;\n\n    double _delay;\n    double _prevTime;\n};\n\n\nosg::Node* createRectangle(osg::BoundingBox& bb,\n                           const std::string& filename)\n{\n    osg::Vec3 top_left(bb.xMin(),bb.yMax(),bb.zMax());\n    osg::Vec3 bottom_left(bb.xMin(),bb.yMax(),bb.zMin());\n    osg::Vec3 bottom_right(bb.xMax(),bb.yMax(),bb.zMin());\n    osg::Vec3 top_right(bb.xMax(),bb.yMax(),bb.zMax());\n    \n    \/\/ create geometry\n    osg::Geometry* geom = new osg::Geometry;\n\n    osg::Vec3Array* vertices = new osg::Vec3Array(4);\n    (*vertices)[0] = top_left;\n    (*vertices)[1] = bottom_left;\n    (*vertices)[2] = bottom_right;\n    (*vertices)[3] = top_right;\n    geom->setVertexArray(vertices);\n    \n    osg::Vec2Array* texcoords = new osg::Vec2Array(4);\n    (*texcoords)[0].set(0.0f, 0.0f);\n    (*texcoords)[1].set(1.0f, 0.0f);\n    (*texcoords)[2].set(1.0f, 1.0f);\n    (*texcoords)[3].set(0.0f, 1.0f);\n    geom->setTexCoordArray(0,texcoords);\n\n    osg::Vec3Array* normals = new osg::Vec3Array(1);\n    (*normals)[0].set(-1.0f,0.0f,0.0f);\n    geom->setNormalArray(normals);\n    geom->setNormalBinding(osg::Geometry::BIND_OVERALL);\n\n    osg::Vec4Array* colors = new osg::Vec4Array(1);\n    (*colors)[0].set(1.0f,1.0f,1.0f,1.0f);\n    geom->setColorArray(colors);\n    geom->setColorBinding(osg::Geometry::BIND_OVERALL);\n\n    geom->addPrimitiveSet(new osg::DrawArrays(GL_QUADS, 0, 4));\n\n    \/\/ disable display list so our modified tex coordinates show up\n    geom->setUseDisplayList(false);\n\n    \/\/ setup texture\n    osg::TextureRectangle* texture = new osg::TextureRectangle;\n\n    \/\/ load image\n    osg::Image* img = osgDB::readImageFile(filename);\n    texture->setImage(img);\n\n    \/\/ setup state\n    osg::StateSet* state = geom->getOrCreateStateSet();\n    state->setTextureAttributeAndModes(0, texture, osg::StateAttribute::ON);\n\n    \/\/ turn off lighting \n    state->setMode(GL_LIGHTING, osg::StateAttribute::OFF);\n\n    \/\/ install 'update' callback\n    osg::Geode* geode = new osg::Geode;\n    geode->addDrawable(geom);\n    geode->setUpdateCallback(new TexturePanCallback(geom, img));\n    \n    return geode;\n}\n\n\nosg::Geode* createText(const std::string& str,\n                       const osg::Vec3& pos)\n{\n    static std::string font(\"fonts\/arial.ttf\");\n\n    osg::Geode* geode = new osg::Geode;\n\n    osgText::Text* text = new osgText::Text;\n    geode->addDrawable(text);\n\n    text->setFont(font);\n    text->setPosition(pos);\n    text->setText(str);\n\n    return geode;\n}\n\n\nosg::Node* createHUD()\n{\n    osg::Group* group = new osg::Group;\n\n    \/\/ turn off lighting and depth test\n    osg::StateSet* state = group->getOrCreateStateSet();\n    state->setMode(GL_LIGHTING, osg::StateAttribute::OFF);\n    state->setMode(GL_DEPTH_TEST, osg::StateAttribute::OFF);\n\n    \/\/ add text\n    osg::Vec3 pos(120.0f, 800.0f, 0.0f);\n    const osg::Vec3 delta(0.0f, -80.0f, 0.0f);\n\n    const char* text[] = {\n        \"TextureRectangle Mini-HOWTO\",\n        \"- essentially behaves like Texture2D, *except* that:\",\n        \"- tex coords must be non-normalized (0..pixel) instead of (0..1)\",\n        \"- wrap modes must be CLAMP, CLAMP_TO_EDGE, or CLAMP_TO_BORDER\\n  repeating wrap modes are not supported\",\n        \"- filter modes must be NEAREST or LINEAR since\\n  mipmaps are not supported\",\n        \"- texture borders are not supported\",\n        \"- defaults should be fine\",\n        NULL\n    };\n    const char** t = text;\n    while (*t) {\n        group->addChild(createText(*t++, pos));\n        pos += delta;\n    }\n\n    \/\/ create HUD\n    osg::MatrixTransform* modelview_abs = new osg::MatrixTransform;\n    modelview_abs->setReferenceFrame(osg::Transform::RELATIVE_TO_ABSOLUTE);\n    modelview_abs->setMatrix(osg::Matrix::identity());\n    modelview_abs->addChild(group);\n\n    osg::Projection* projection = new osg::Projection;\n    projection->setMatrix(osg::Matrix::ortho2D(0,1280,0,1024));\n    projection->addChild(modelview_abs);\n\n    return projection;\n}\n\n\nosg::Node* createModel(const std::string& filename)\n{\n    osg::Group* root = new osg::Group;\n\n    if (filename != \"X\") {\n        osg::BoundingBox bb(0.0f,0.0f,0.0f,1.0f,1.0f,1.0f);\n        root->addChild(createRectangle(bb, filename)); \/\/ XXX\n    }\n\n    root->addChild(createHUD());\n\n    return root;\n}\n\n\nint main(int argc, char** argv)\n{\n    \/\/ use an ArgumentParser object to manage the program arguments.\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 a demo which demonstrates use of osg::TextureRectangle.\");\n    arguments.getApplicationUsage()->setCommandLineUsage(arguments.getApplicationName()+\" [options] <image> ...\");\n    arguments.getApplicationUsage()->addCommandLineOption(\"-h or --help\",\"Display this information\");\n   \n    \/\/ construct the viewer.\n    osgProducer::Viewer viewer(arguments);\n\n    \/\/ set up the value with sensible default event handlers.\n    viewer.setUpViewer(osgProducer::Viewer::STANDARD_SETTINGS);\n\n    \/\/ get details on keyboard and mouse bindings used by the viewer.\n    viewer.getUsage(*arguments.getApplicationUsage());\n\n    \/\/ if user request help write it out to cout.\n    if (arguments.read(\"-h\") || arguments.read(\"--help\"))\n    {\n        arguments.getApplicationUsage()->write(std::cout);\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    \/\/ create a model from the images.\n    osg::Node* rootNode = createModel((arguments.argc() > 1 ? arguments[1] : \"Images\/lz.rgb\"));\n\n    \/\/ add model to viewer.\n    viewer.setSceneData(rootNode);\n\n    \/\/ create the windows and run the threads.\n    viewer.realize();\n\n    while (!viewer.done())\n    {\n        \/\/ wait for all cull and draw threads to complete.\n        viewer.sync();\n\n        \/\/ update the scene by traversing it with the the update visitor which will\n        \/\/ call all node update callbacks and animations.\n        viewer.update();\n\n        \/\/ fire off the cull and draw traversals of the scene.\n        viewer.frame();\n    }\n\n    \/\/ wait for all cull and draw threads to complete before exit.\n    viewer.sync();\n    \n    return 0;\n}\n<commit_msg>Fixed normal orientation<commit_after>\/\/ -*-c++-*-\n\n\/*\n * demonstrates usage of osg::TextureRectangle.\n *\n * Actually there isn't much difference to the rest of the osg::Texture*\n * bunch only this:\n * - texture coordinates for texture rectangles must be in image\n *   coordinates instead of normalized coordinates (0-1). So for a 500x250\n *   image the coordinates for the entire image would be\n *   0,250 0,0 500,0 500,250 instead of 0,1 0,0 1,0 1,1\n * - only the following wrap modes are supported (but not enforced)\n *   CLAMP, CLAMP_TO_EDGE, CLAMP_TO_BORDER\n * - a border is not supported\n * - mipmap is not supported\n *\/\n\n#include <osg\/Notify>\n#include <osg\/TextureRectangle>\n#include <osg\/Geometry>\n#include <osg\/Geode>\n\n#include <osg\/Group>\n#include <osg\/Projection>\n#include <osg\/MatrixTransform>\n#include <osgText\/Text>\n\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n\n#include <osgProducer\/Viewer>\n\n\n\/**********************************************************************\n *\n * Texture pan animation callback\n *\n **********************************************************************\/\n\nclass TexturePanCallback : public osg::NodeCallback\n{\npublic:\n    TexturePanCallback(osg::Geometry* geom, osg::Image* img,\n                       double delay = 0.05) :\n        _geom(geom),\n        _img(img),\n        _phaseS(35.0f),\n        _phaseT(18.0f),\n        _phaseScale(5.0f),\n        _delay(delay),\n        _prevTime(0.0)\n    {\n    }\n\n    virtual void operator()(osg::Node*, osg::NodeVisitor* nv)\n    {\n        if (!_geom || !_img)\n            return;\n\n        if (nv->getFrameStamp()) {\n            double currTime = nv->getFrameStamp()->getReferenceTime();\n            if (currTime - _prevTime > _delay) {\n\n                float rad = osg::DegreesToRadians(currTime);\n\n                \/\/ zoom scale (0.2 - 1.0)\n                float scale = sin(rad * _phaseScale) * 0.4f + 0.6f;\n                float scaleR = 1.0f - scale;\n\n                \/\/ calculate new texture coordinates\n                float s, t;\n                s = ((sin(rad * _phaseS) + 1) * 0.5f) * (_img->s() * scaleR);\n                t = ((sin(rad * _phaseT) + 1) * 0.5f) * (_img->t() * scaleR);\n\n                \/\/ set new texture coordinate array\n                osg::Vec2Array* texcoords = (osg::Vec2Array*) _geom->getTexCoordArray(0);\n                float w = _img->s() * scale, h = _img->t() * scale;\n                (*texcoords)[0].set(s, t+h);\n                (*texcoords)[1].set(s, t);\n                (*texcoords)[2].set(s+w, t);\n                (*texcoords)[3].set(s+w, t+h);\n\n                \/\/ record time\n                _prevTime = currTime;\n            }\n        }\n    }\n\nprivate:\n    osg::Geometry* _geom;\n    osg::Image* _img;\n\n    float _phaseS, _phaseT, _phaseScale;\n\n    double _delay;\n    double _prevTime;\n};\n\n\nosg::Node* createRectangle(osg::BoundingBox& bb,\n                           const std::string& filename)\n{\n    osg::Vec3 top_left(bb.xMin(),bb.yMax(),bb.zMax());\n    osg::Vec3 bottom_left(bb.xMin(),bb.yMax(),bb.zMin());\n    osg::Vec3 bottom_right(bb.xMax(),bb.yMax(),bb.zMin());\n    osg::Vec3 top_right(bb.xMax(),bb.yMax(),bb.zMax());\n    \n    \/\/ create geometry\n    osg::Geometry* geom = new osg::Geometry;\n\n    osg::Vec3Array* vertices = new osg::Vec3Array(4);\n    (*vertices)[0] = top_left;\n    (*vertices)[1] = bottom_left;\n    (*vertices)[2] = bottom_right;\n    (*vertices)[3] = top_right;\n    geom->setVertexArray(vertices);\n    \n    osg::Vec2Array* texcoords = new osg::Vec2Array(4);\n    (*texcoords)[0].set(0.0f, 0.0f);\n    (*texcoords)[1].set(1.0f, 0.0f);\n    (*texcoords)[2].set(1.0f, 1.0f);\n    (*texcoords)[3].set(0.0f, 1.0f);\n    geom->setTexCoordArray(0,texcoords);\n\n    osg::Vec3Array* normals = new osg::Vec3Array(1);\n    (*normals)[0].set(0.0f,-1.0f,0.0f);\n    geom->setNormalArray(normals);\n    geom->setNormalBinding(osg::Geometry::BIND_OVERALL);\n\n    osg::Vec4Array* colors = new osg::Vec4Array(1);\n    (*colors)[0].set(1.0f,1.0f,1.0f,1.0f);\n    geom->setColorArray(colors);\n    geom->setColorBinding(osg::Geometry::BIND_OVERALL);\n\n    geom->addPrimitiveSet(new osg::DrawArrays(GL_QUADS, 0, 4));\n\n    \/\/ disable display list so our modified tex coordinates show up\n    geom->setUseDisplayList(false);\n\n    \/\/ setup texture\n    osg::TextureRectangle* texture = new osg::TextureRectangle;\n\n    \/\/ load image\n    osg::Image* img = osgDB::readImageFile(filename);\n    texture->setImage(img);\n\n    \/\/ setup state\n    osg::StateSet* state = geom->getOrCreateStateSet();\n    state->setTextureAttributeAndModes(0, texture, osg::StateAttribute::ON);\n\n    \/\/ turn off lighting \n    state->setMode(GL_LIGHTING, osg::StateAttribute::OFF);\n\n    \/\/ install 'update' callback\n    osg::Geode* geode = new osg::Geode;\n    geode->addDrawable(geom);\n    geode->setUpdateCallback(new TexturePanCallback(geom, img));\n    \n    return geode;\n}\n\n\nosg::Geode* createText(const std::string& str,\n                       const osg::Vec3& pos)\n{\n    static std::string font(\"fonts\/arial.ttf\");\n\n    osg::Geode* geode = new osg::Geode;\n\n    osgText::Text* text = new osgText::Text;\n    geode->addDrawable(text);\n\n    text->setFont(font);\n    text->setPosition(pos);\n    text->setText(str);\n\n    return geode;\n}\n\n\nosg::Node* createHUD()\n{\n    osg::Group* group = new osg::Group;\n\n    \/\/ turn off lighting and depth test\n    osg::StateSet* state = group->getOrCreateStateSet();\n    state->setMode(GL_LIGHTING, osg::StateAttribute::OFF);\n    state->setMode(GL_DEPTH_TEST, osg::StateAttribute::OFF);\n\n    \/\/ add text\n    osg::Vec3 pos(120.0f, 800.0f, 0.0f);\n    const osg::Vec3 delta(0.0f, -80.0f, 0.0f);\n\n    const char* text[] = {\n        \"TextureRectangle Mini-HOWTO\",\n        \"- essentially behaves like Texture2D, *except* that:\",\n        \"- tex coords must be non-normalized (0..pixel) instead of (0..1)\",\n        \"- wrap modes must be CLAMP, CLAMP_TO_EDGE, or CLAMP_TO_BORDER\\n  repeating wrap modes are not supported\",\n        \"- filter modes must be NEAREST or LINEAR since\\n  mipmaps are not supported\",\n        \"- texture borders are not supported\",\n        \"- defaults should be fine\",\n        NULL\n    };\n    const char** t = text;\n    while (*t) {\n        group->addChild(createText(*t++, pos));\n        pos += delta;\n    }\n\n    \/\/ create HUD\n    osg::MatrixTransform* modelview_abs = new osg::MatrixTransform;\n    modelview_abs->setReferenceFrame(osg::Transform::RELATIVE_TO_ABSOLUTE);\n    modelview_abs->setMatrix(osg::Matrix::identity());\n    modelview_abs->addChild(group);\n\n    osg::Projection* projection = new osg::Projection;\n    projection->setMatrix(osg::Matrix::ortho2D(0,1280,0,1024));\n    projection->addChild(modelview_abs);\n\n    return projection;\n}\n\n\nosg::Node* createModel(const std::string& filename)\n{\n    osg::Group* root = new osg::Group;\n\n    if (filename != \"X\") {\n        osg::BoundingBox bb(0.0f,0.0f,0.0f,1.0f,1.0f,1.0f);\n        root->addChild(createRectangle(bb, filename)); \/\/ XXX\n    }\n\n    root->addChild(createHUD());\n\n    return root;\n}\n\n\nint main(int argc, char** argv)\n{\n    \/\/ use an ArgumentParser object to manage the program arguments.\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 a demo which demonstrates use of osg::TextureRectangle.\");\n    arguments.getApplicationUsage()->setCommandLineUsage(arguments.getApplicationName()+\" [options] <image> ...\");\n    arguments.getApplicationUsage()->addCommandLineOption(\"-h or --help\",\"Display this information\");\n   \n    \/\/ construct the viewer.\n    osgProducer::Viewer viewer(arguments);\n\n    \/\/ set up the value with sensible default event handlers.\n    viewer.setUpViewer(osgProducer::Viewer::STANDARD_SETTINGS);\n\n    \/\/ get details on keyboard and mouse bindings used by the viewer.\n    viewer.getUsage(*arguments.getApplicationUsage());\n\n    \/\/ if user request help write it out to cout.\n    if (arguments.read(\"-h\") || arguments.read(\"--help\"))\n    {\n        arguments.getApplicationUsage()->write(std::cout);\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    \/\/ create a model from the images.\n    osg::Node* rootNode = createModel((arguments.argc() > 1 ? arguments[1] : \"Images\/lz.rgb\"));\n\n    \/\/ add model to viewer.\n    viewer.setSceneData(rootNode);\n\n    \/\/ create the windows and run the threads.\n    viewer.realize();\n\n    while (!viewer.done())\n    {\n        \/\/ wait for all cull and draw threads to complete.\n        viewer.sync();\n\n        \/\/ update the scene by traversing it with the the update visitor which will\n        \/\/ call all node update callbacks and animations.\n        viewer.update();\n\n        \/\/ fire off the cull and draw traversals of the scene.\n        viewer.frame();\n    }\n\n    \/\/ wait for all cull and draw threads to complete before exit.\n    viewer.sync();\n    \n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Created on: 15 Jul 2014\n *      Author: Yiming Yang\n * \n * Copyright (c) 2016, University Of Edinburgh \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  nor the names of its contributors may be used to \n *    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\" \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 <exotica\/Problems\/UnconstrainedEndPoseProblem.h>\n#include <exotica\/Setup.h>\n\nREGISTER_PROBLEM_TYPE(\"UnconstrainedEndPoseProblem\", exotica::UnconstrainedEndPoseProblem)\n\n#define XML_CHECK(x) {xmltmp=handle.FirstChildElement(x).ToElement();if (!xmltmp) throw_named(\"XML element '\"<<x<<\"' does not exist!\");}\n\nnamespace exotica\n{\n    UnconstrainedEndPoseProblem::UnconstrainedEndPoseProblem()\n    {\n        Flags = KIN_FK | KIN_J;\n    }\n\n    UnconstrainedEndPoseProblem::~UnconstrainedEndPoseProblem()\n    {\n    }\n\n    void UnconstrainedEndPoseProblem::Instantiate(UnconstrainedEndPoseProblemInitializer& init)\n    {\n        W = Eigen::MatrixXd::Identity(init.W.rows(), init.W.rows());\n        W.diagonal() = init.W;\n\n        Tasks = MapToVec(TaskMaps);\n        NumTasks = Tasks.size();\n        Mapping.resize(NumTasks, 2);\n        int id=0;\n        for(int i=0;i<NumTasks;i++)\n        {\n            Mapping(i,0) = id;\n            Mapping(i,1) = Tasks[i]->taskSpaceDim();\n            id += Mapping(i,1);\n        }\n        PhiN = Mapping.col(1).sum();\n\n        N = scene_->getNumJoints();\n\n        Rho = Eigen::VectorXd::Ones(NumTasks);\n        y = Eigen::VectorXd::Zero(PhiN);\n        W = Eigen::MatrixXd::Identity(PhiN, PhiN);\n        Phi = Eigen::VectorXd::Zero(PhiN);\n        J = Eigen::MatrixXd(PhiN, N);\n    }\n\n    void UnconstrainedEndPoseProblem::Update(Eigen::VectorXdRefConst x)\n    {\n        scene_->Update(x);\n        for(int i=0;i<NumTasks;i++)\n        {\n            Tasks[i]->update(x, Phi.segment(Mapping(i, 0), Mapping(i, 1)), J.middleRows(Mapping(i, 0), Mapping(i, 1)));\n        }\n    }\n}\n\n<commit_msg>Fixed end pose W<commit_after>\/*\n *  Created on: 15 Jul 2014\n *      Author: Yiming Yang\n * \n * Copyright (c) 2016, University Of Edinburgh \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  nor the names of its contributors may be used to \n *    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\" \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 <exotica\/Problems\/UnconstrainedEndPoseProblem.h>\n#include <exotica\/Setup.h>\n\nREGISTER_PROBLEM_TYPE(\"UnconstrainedEndPoseProblem\", exotica::UnconstrainedEndPoseProblem)\n\n#define XML_CHECK(x) {xmltmp=handle.FirstChildElement(x).ToElement();if (!xmltmp) throw_named(\"XML element '\"<<x<<\"' does not exist!\");}\n\nnamespace exotica\n{\n    UnconstrainedEndPoseProblem::UnconstrainedEndPoseProblem()\n    {\n        Flags = KIN_FK | KIN_J;\n    }\n\n    UnconstrainedEndPoseProblem::~UnconstrainedEndPoseProblem()\n    {\n    }\n\n    void UnconstrainedEndPoseProblem::Instantiate(UnconstrainedEndPoseProblemInitializer& init)\n    {\n        Tasks = MapToVec(TaskMaps);\n        NumTasks = Tasks.size();\n        Mapping.resize(NumTasks, 2);\n        int id=0;\n        for(int i=0;i<NumTasks;i++)\n        {\n            Mapping(i,0) = id;\n            Mapping(i,1) = Tasks[i]->taskSpaceDim();\n            id += Mapping(i,1);\n        }\n        PhiN = Mapping.col(1).sum();\n\n        N = scene_->getNumJoints();\n\n        if(init.W.rows()!=N) throw_named(\"W dimension mismatch! Expected \"<<N<<\", got \"<<init.W.rows());\n\n        Rho = Eigen::VectorXd::Ones(NumTasks);\n        y = Eigen::VectorXd::Zero(PhiN);\n        W = Eigen::MatrixXd::Identity(N, N);\n        W.diagonal() = init.W;\n        Phi = Eigen::VectorXd::Zero(PhiN);\n        J = Eigen::MatrixXd(PhiN, N);\n    }\n\n    void UnconstrainedEndPoseProblem::Update(Eigen::VectorXdRefConst x)\n    {\n        scene_->Update(x);\n        for(int i=0;i<NumTasks;i++)\n        {\n            Tasks[i]->update(x, Phi.segment(Mapping(i, 0), Mapping(i, 1)), J.middleRows(Mapping(i, 0), Mapping(i, 1)));\n        }\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright 2014 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\n\/\/ Framebuffer11.cpp: Implements the Framebuffer11 class.\n\n#include \"libANGLE\/renderer\/d3d\/d3d11\/Framebuffer11.h\"\n\n#include \"common\/debug.h\"\n#include \"common\/BitSetIterator.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/Buffer11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/Clear11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/TextureStorage11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/Renderer11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/renderer11_utils.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/RenderTarget11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/formatutils11.h\"\n#include \"libANGLE\/renderer\/d3d\/TextureD3D.h\"\n#include \"libANGLE\/Framebuffer.h\"\n#include \"libANGLE\/FramebufferAttachment.h\"\n#include \"libANGLE\/Texture.h\"\n\nusing namespace angle;\n\nnamespace rx\n{\n\nnamespace\n{\ngl::Error MarkAttachmentsDirty(const gl::FramebufferAttachment *attachment)\n{\n    if (attachment && attachment->type() == GL_TEXTURE)\n    {\n        gl::Texture *texture = attachment->getTexture();\n\n        TextureD3D *textureD3D = GetImplAs<TextureD3D>(texture);\n\n        TextureStorage *texStorage = nullptr;\n        ANGLE_TRY(textureD3D->getNativeTexture(&texStorage));\n\n        if (texStorage)\n        {\n            TextureStorage11 *texStorage11 = GetAs<TextureStorage11>(texStorage);\n            ASSERT(texStorage11);\n\n            texStorage11->markLevelDirty(attachment->mipLevel());\n        }\n    }\n\n    return gl::NoError();\n}\n\nvoid UpdateCachedRenderTarget(const gl::FramebufferAttachment *attachment,\n                              RenderTarget11 *&cachedRenderTarget,\n                              ChannelBinding *channelBinding)\n{\n    RenderTarget11 *newRenderTarget = nullptr;\n    if (attachment)\n    {\n        attachment->getRenderTarget(&newRenderTarget);\n    }\n    if (newRenderTarget != cachedRenderTarget)\n    {\n        auto channel = (newRenderTarget ? newRenderTarget->getBroadcastChannel() : nullptr);\n        channelBinding->bind(channel);\n        cachedRenderTarget = newRenderTarget;\n    }\n}\n}  \/\/ anonymous namespace\n\nFramebuffer11::Framebuffer11(const gl::FramebufferState &data, Renderer11 *renderer)\n    : FramebufferD3D(data, renderer),\n      mRenderer(renderer),\n      mCachedDepthStencilRenderTarget(nullptr),\n      mDepthStencilRenderTargetDirty(this, gl::IMPLEMENTATION_MAX_FRAMEBUFFER_ATTACHMENTS)\n{\n    ASSERT(mRenderer != nullptr);\n    mCachedColorRenderTargets.fill(nullptr);\n    for (size_t colorIndex = 0; colorIndex < data.getColorAttachments().size(); ++colorIndex)\n    {\n        mColorRenderTargetsDirty.push_back(\n            ChannelBinding(this, static_cast<SignalToken>(colorIndex)));\n    }\n}\n\nFramebuffer11::~Framebuffer11()\n{\n}\n\ngl::Error Framebuffer11::markAttachmentsDirty() const\n{\n    for (const auto &colorAttachment : mState.getColorAttachments())\n    {\n        if (colorAttachment.isAttached())\n        {\n            ANGLE_TRY(MarkAttachmentsDirty(&colorAttachment));\n        }\n    }\n\n    ANGLE_TRY(MarkAttachmentsDirty(mState.getDepthAttachment()));\n    ANGLE_TRY(MarkAttachmentsDirty(mState.getStencilAttachment()));\n\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::clearImpl(ContextImpl *context, const ClearParameters &clearParams)\n{\n    Clear11 *clearer = mRenderer->getClearer();\n\n    const gl::FramebufferAttachment *colorAttachment = mState.getFirstColorAttachment();\n    if (clearParams.scissorEnabled == true && colorAttachment != nullptr &&\n        UsePresentPathFast(mRenderer, colorAttachment))\n    {\n        \/\/ If the current framebuffer is using the default colorbuffer, and present path fast is\n        \/\/ active, and the scissor rect is enabled, then we should invert the scissor rect\n        \/\/ vertically\n        ClearParameters presentPathFastClearParams = clearParams;\n        gl::Extents framebufferSize                = colorAttachment->getSize();\n        presentPathFastClearParams.scissor.y       = framebufferSize.height -\n                                               presentPathFastClearParams.scissor.y -\n                                               presentPathFastClearParams.scissor.height;\n        ANGLE_TRY(clearer->clearFramebuffer(presentPathFastClearParams, mState));\n    }\n    else\n    {\n        ANGLE_TRY(clearer->clearFramebuffer(clearParams, mState));\n    }\n\n    ANGLE_TRY(markAttachmentsDirty());\n\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::invalidate(size_t count, const GLenum *attachments)\n{\n    return invalidateBase(count, attachments, false);\n}\n\ngl::Error Framebuffer11::discard(size_t count, const GLenum *attachments)\n{\n    return invalidateBase(count, attachments, true);\n}\n\ngl::Error Framebuffer11::invalidateBase(size_t count, const GLenum *attachments, bool useEXTBehavior) const\n{\n    ID3D11DeviceContext1 *deviceContext1 = mRenderer->getDeviceContext1IfSupported();\n\n    if (!deviceContext1)\n    {\n        \/\/ DiscardView() is only supported on ID3D11DeviceContext1\n        return gl::NoError();\n    }\n\n    bool foundDepth = false;\n    bool foundStencil = false;\n\n    for (size_t i = 0; i < count; ++i)\n    {\n        switch (attachments[i])\n        {\n          \/\/ Handle depth and stencil attachments. Defer discarding until later.\n          case GL_DEPTH_STENCIL_ATTACHMENT:\n            foundDepth = true;\n            foundStencil = true;\n            break;\n          case GL_DEPTH_EXT:\n          case GL_DEPTH_ATTACHMENT:\n            foundDepth = true;\n            break;\n          case GL_STENCIL_EXT:\n          case GL_STENCIL_ATTACHMENT:\n            foundStencil = true;\n            break;\n          default:\n            {\n                \/\/ Handle color attachments\n                ASSERT((attachments[i] >= GL_COLOR_ATTACHMENT0 && attachments[i] <= GL_COLOR_ATTACHMENT15) ||\n                       (attachments[i] == GL_COLOR));\n\n                size_t colorIndex =\n                    (attachments[i] == GL_COLOR ? 0u : (attachments[i] - GL_COLOR_ATTACHMENT0));\n                auto colorAttachment = mState.getColorAttachment(colorIndex);\n                ANGLE_TRY(invalidateAttachment(colorAttachment));\n                break;\n            }\n        }\n    }\n\n    bool discardDepth = false;\n    bool discardStencil = false;\n\n    \/\/ The D3D11 renderer uses the same view for depth and stencil buffers, so we must be careful.\n    if (useEXTBehavior)\n    {\n        \/\/ In the extension, if the app discards only one of the depth and stencil attachments, but\n        \/\/ those are backed by the same packed_depth_stencil buffer, then both images become undefined.\n        discardDepth = foundDepth;\n\n        \/\/ Don't bother discarding the stencil buffer if the depth buffer will already do it\n        discardStencil = foundStencil && (!discardDepth || mState.getDepthAttachment() == nullptr);\n    }\n    else\n    {\n        \/\/ In ES 3.0.4, if a specified attachment has base internal format DEPTH_STENCIL but the\n        \/\/ attachments list does not include DEPTH_STENCIL_ATTACHMENT or both DEPTH_ATTACHMENT and\n        \/\/ STENCIL_ATTACHMENT, then only the specified portion of every pixel in the subregion of pixels\n        \/\/ of the DEPTH_STENCIL buffer may be invalidated, and the other portion must be preserved.\n        discardDepth = (foundDepth && foundStencil) ||\n                       (foundDepth && (mState.getStencilAttachment() == nullptr));\n        discardStencil = (foundStencil && (mState.getDepthAttachment() == nullptr));\n    }\n\n    if (discardDepth && mState.getDepthAttachment())\n    {\n        ANGLE_TRY(invalidateAttachment(mState.getDepthAttachment()));\n    }\n\n    if (discardStencil && mState.getStencilAttachment())\n    {\n        ANGLE_TRY(invalidateAttachment(mState.getStencilAttachment()));\n    }\n\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::invalidateSub(size_t, const GLenum *, const gl::Rectangle &)\n{\n    \/\/ A no-op implementation conforms to the spec, so don't call UNIMPLEMENTED()\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::invalidateAttachment(const gl::FramebufferAttachment *attachment) const\n{\n    ID3D11DeviceContext1 *deviceContext1 = mRenderer->getDeviceContext1IfSupported();\n    ASSERT(deviceContext1);\n    ASSERT(attachment && attachment->isAttached());\n\n    RenderTarget11 *renderTarget = nullptr;\n    ANGLE_TRY(attachment->getRenderTarget(&renderTarget));\n    ID3D11View *view = renderTarget->getRenderTargetView();\n\n    if (view != nullptr)\n    {\n        deviceContext1->DiscardView(view);\n    }\n\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::readPixelsImpl(const gl::Rectangle &area,\n                                        GLenum format,\n                                        GLenum type,\n                                        size_t outputPitch,\n                                        const gl::PixelPackState &pack,\n                                        uint8_t *pixels) const\n{\n    const gl::FramebufferAttachment *readAttachment = mState.getReadAttachment();\n    ASSERT(readAttachment);\n\n    gl::Buffer *packBuffer = pack.pixelBuffer.get();\n    if (packBuffer != nullptr)\n    {\n        Buffer11 *packBufferStorage = GetImplAs<Buffer11>(packBuffer);\n        PackPixelsParams packParams(area, format, type, static_cast<GLuint>(outputPitch), pack,\n                                    reinterpret_cast<ptrdiff_t>(pixels));\n\n        return packBufferStorage->packPixels(*readAttachment, packParams);\n    }\n\n    return mRenderer->readFromAttachment(*readAttachment, area, format, type,\n                                         static_cast<GLuint>(outputPitch), pack, pixels);\n}\n\ngl::Error Framebuffer11::blitImpl(const gl::Rectangle &sourceArea,\n                                  const gl::Rectangle &destArea,\n                                  const gl::Rectangle *scissor,\n                                  bool blitRenderTarget,\n                                  bool blitDepth,\n                                  bool blitStencil,\n                                  GLenum filter,\n                                  const gl::Framebuffer *sourceFramebuffer)\n{\n    if (blitRenderTarget)\n    {\n        const gl::FramebufferAttachment *readBuffer = sourceFramebuffer->getReadColorbuffer();\n        ASSERT(readBuffer);\n\n        RenderTargetD3D *readRenderTarget = nullptr;\n        ANGLE_TRY(readBuffer->getRenderTarget(&readRenderTarget));\n        ASSERT(readRenderTarget);\n\n        const auto &colorAttachments = mState.getColorAttachments();\n        const auto &drawBufferStates = mState.getDrawBufferStates();\n\n        for (size_t colorAttachment = 0; colorAttachment < colorAttachments.size(); colorAttachment++)\n        {\n            const gl::FramebufferAttachment &drawBuffer = colorAttachments[colorAttachment];\n\n            if (drawBuffer.isAttached() &&\n                drawBufferStates[colorAttachment] != GL_NONE)\n            {\n                RenderTargetD3D *drawRenderTarget = nullptr;\n                ANGLE_TRY(drawBuffer.getRenderTarget(&drawRenderTarget));\n                ASSERT(drawRenderTarget);\n\n                const bool invertColorSource   = UsePresentPathFast(mRenderer, readBuffer);\n                gl::Rectangle actualSourceArea = sourceArea;\n                if (invertColorSource)\n                {\n                    RenderTarget11 *readRenderTarget11 = GetAs<RenderTarget11>(readRenderTarget);\n                    actualSourceArea.y                 = readRenderTarget11->getHeight() - sourceArea.y;\n                    actualSourceArea.height            = -sourceArea.height;\n                }\n\n                const bool invertColorDest   = UsePresentPathFast(mRenderer, &drawBuffer);\n                gl::Rectangle actualDestArea = destArea;\n                if (invertColorDest)\n                {\n                    RenderTarget11 *drawRenderTarget11 = GetAs<RenderTarget11>(drawRenderTarget);\n                    actualDestArea.y                   = drawRenderTarget11->getHeight() - destArea.y;\n                    actualDestArea.height              = -destArea.height;\n                }\n\n                ANGLE_TRY(mRenderer->blitRenderbufferRect(\n                    actualSourceArea, actualDestArea, readRenderTarget, drawRenderTarget, filter,\n                    scissor, blitRenderTarget, false, false));\n            }\n        }\n    }\n\n    if (blitDepth || blitStencil)\n    {\n        const gl::FramebufferAttachment *readBuffer = sourceFramebuffer->getDepthOrStencilbuffer();\n        ASSERT(readBuffer);\n\n        RenderTargetD3D *readRenderTarget = nullptr;\n        ANGLE_TRY(readBuffer->getRenderTarget(&readRenderTarget));\n        ASSERT(readRenderTarget);\n\n        const gl::FramebufferAttachment *drawBuffer = mState.getDepthOrStencilAttachment();\n        ASSERT(drawBuffer);\n\n        RenderTargetD3D *drawRenderTarget = nullptr;\n        ANGLE_TRY(drawBuffer->getRenderTarget(&drawRenderTarget));\n        ASSERT(drawRenderTarget);\n\n        ANGLE_TRY(mRenderer->blitRenderbufferRect(sourceArea, destArea, readRenderTarget,\n                                                  drawRenderTarget, filter, scissor, false,\n                                                  blitDepth, blitStencil));\n    }\n\n    ANGLE_TRY(markAttachmentsDirty());\n    return gl::NoError();\n}\n\nGLenum Framebuffer11::getRenderTargetImplementationFormat(RenderTargetD3D *renderTarget) const\n{\n    RenderTarget11 *renderTarget11 = GetAs<RenderTarget11>(renderTarget);\n    return renderTarget11->getFormatSet().format().fboImplementationInternalFormat;\n}\n\nvoid Framebuffer11::updateColorRenderTarget(size_t colorIndex)\n{\n    UpdateCachedRenderTarget(mState.getColorAttachment(colorIndex),\n                             mCachedColorRenderTargets[colorIndex],\n                             &mColorRenderTargetsDirty[colorIndex]);\n}\n\nvoid Framebuffer11::updateDepthStencilRenderTarget()\n{\n    UpdateCachedRenderTarget(mState.getDepthOrStencilAttachment(), mCachedDepthStencilRenderTarget,\n                             &mDepthStencilRenderTargetDirty);\n}\n\nvoid Framebuffer11::syncState(const gl::Framebuffer::DirtyBits &dirtyBits)\n{\n    mRenderer->getStateManager()->invalidateRenderTarget();\n\n    const auto &mergedDirtyBits = dirtyBits | mInternalDirtyBits;\n    mInternalDirtyBits.reset();\n\n    for (auto dirtyBit : IterateBitSet(mergedDirtyBits))\n    {\n        switch (dirtyBit)\n        {\n            case gl::Framebuffer::DIRTY_BIT_DEPTH_ATTACHMENT:\n            case gl::Framebuffer::DIRTY_BIT_STENCIL_ATTACHMENT:\n                updateDepthStencilRenderTarget();\n                break;\n            case gl::Framebuffer::DIRTY_BIT_DRAW_BUFFERS:\n            case gl::Framebuffer::DIRTY_BIT_READ_BUFFER:\n                break;\n            default:\n            {\n                ASSERT(gl::Framebuffer::DIRTY_BIT_COLOR_ATTACHMENT_0 == 0 &&\n                       dirtyBit < gl::Framebuffer::DIRTY_BIT_COLOR_ATTACHMENT_MAX);\n                size_t colorIndex =\n                    static_cast<size_t>(dirtyBit - gl::Framebuffer::DIRTY_BIT_COLOR_ATTACHMENT_0);\n                updateColorRenderTarget(colorIndex);\n                break;\n            }\n        }\n    }\n\n    \/\/ We should not have dirtied any additional state during our sync.\n    ASSERT(!mInternalDirtyBits.any());\n\n    FramebufferD3D::syncState(dirtyBits);\n}\n\nvoid Framebuffer11::signal(SignalToken token)\n{\n    if (token == gl::IMPLEMENTATION_MAX_FRAMEBUFFER_ATTACHMENTS)\n    {\n        \/\/ Stencil is redundant in this case.\n        mInternalDirtyBits.set(gl::Framebuffer::DIRTY_BIT_DEPTH_ATTACHMENT);\n        mCachedDepthStencilRenderTarget = nullptr;\n    }\n    else\n    {\n        mInternalDirtyBits.set(gl::Framebuffer::DIRTY_BIT_COLOR_ATTACHMENT_0 + token);\n        mCachedColorRenderTargets[token] = nullptr;\n    }\n}\n\ngl::Error Framebuffer11::getSamplePosition(size_t index, GLfloat *xy) const\n{\n    UNIMPLEMENTED();\n    return gl::InternalError() << \"getSamplePosition is unimplemented.\";\n}\n\nbool Framebuffer11::hasAnyInternalDirtyBit() const\n{\n    return mInternalDirtyBits.any();\n}\n\nvoid Framebuffer11::syncInternalState()\n{\n    syncState(gl::Framebuffer::DirtyBits());\n}\n\n}  \/\/ namespace rx\n<commit_msg>Check for getColorAttachment returning null before using it.<commit_after>\/\/\n\/\/ Copyright 2014 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\n\/\/ Framebuffer11.cpp: Implements the Framebuffer11 class.\n\n#include \"libANGLE\/renderer\/d3d\/d3d11\/Framebuffer11.h\"\n\n#include \"common\/debug.h\"\n#include \"common\/BitSetIterator.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/Buffer11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/Clear11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/TextureStorage11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/Renderer11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/renderer11_utils.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/RenderTarget11.h\"\n#include \"libANGLE\/renderer\/d3d\/d3d11\/formatutils11.h\"\n#include \"libANGLE\/renderer\/d3d\/TextureD3D.h\"\n#include \"libANGLE\/Framebuffer.h\"\n#include \"libANGLE\/FramebufferAttachment.h\"\n#include \"libANGLE\/Texture.h\"\n\nusing namespace angle;\n\nnamespace rx\n{\n\nnamespace\n{\ngl::Error MarkAttachmentsDirty(const gl::FramebufferAttachment *attachment)\n{\n    if (attachment && attachment->type() == GL_TEXTURE)\n    {\n        gl::Texture *texture = attachment->getTexture();\n\n        TextureD3D *textureD3D = GetImplAs<TextureD3D>(texture);\n\n        TextureStorage *texStorage = nullptr;\n        ANGLE_TRY(textureD3D->getNativeTexture(&texStorage));\n\n        if (texStorage)\n        {\n            TextureStorage11 *texStorage11 = GetAs<TextureStorage11>(texStorage);\n            ASSERT(texStorage11);\n\n            texStorage11->markLevelDirty(attachment->mipLevel());\n        }\n    }\n\n    return gl::NoError();\n}\n\nvoid UpdateCachedRenderTarget(const gl::FramebufferAttachment *attachment,\n                              RenderTarget11 *&cachedRenderTarget,\n                              ChannelBinding *channelBinding)\n{\n    RenderTarget11 *newRenderTarget = nullptr;\n    if (attachment)\n    {\n        attachment->getRenderTarget(&newRenderTarget);\n    }\n    if (newRenderTarget != cachedRenderTarget)\n    {\n        auto channel = (newRenderTarget ? newRenderTarget->getBroadcastChannel() : nullptr);\n        channelBinding->bind(channel);\n        cachedRenderTarget = newRenderTarget;\n    }\n}\n}  \/\/ anonymous namespace\n\nFramebuffer11::Framebuffer11(const gl::FramebufferState &data, Renderer11 *renderer)\n    : FramebufferD3D(data, renderer),\n      mRenderer(renderer),\n      mCachedDepthStencilRenderTarget(nullptr),\n      mDepthStencilRenderTargetDirty(this, gl::IMPLEMENTATION_MAX_FRAMEBUFFER_ATTACHMENTS)\n{\n    ASSERT(mRenderer != nullptr);\n    mCachedColorRenderTargets.fill(nullptr);\n    for (size_t colorIndex = 0; colorIndex < data.getColorAttachments().size(); ++colorIndex)\n    {\n        mColorRenderTargetsDirty.push_back(\n            ChannelBinding(this, static_cast<SignalToken>(colorIndex)));\n    }\n}\n\nFramebuffer11::~Framebuffer11()\n{\n}\n\ngl::Error Framebuffer11::markAttachmentsDirty() const\n{\n    for (const auto &colorAttachment : mState.getColorAttachments())\n    {\n        if (colorAttachment.isAttached())\n        {\n            ANGLE_TRY(MarkAttachmentsDirty(&colorAttachment));\n        }\n    }\n\n    ANGLE_TRY(MarkAttachmentsDirty(mState.getDepthAttachment()));\n    ANGLE_TRY(MarkAttachmentsDirty(mState.getStencilAttachment()));\n\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::clearImpl(ContextImpl *context, const ClearParameters &clearParams)\n{\n    Clear11 *clearer = mRenderer->getClearer();\n\n    const gl::FramebufferAttachment *colorAttachment = mState.getFirstColorAttachment();\n    if (clearParams.scissorEnabled == true && colorAttachment != nullptr &&\n        UsePresentPathFast(mRenderer, colorAttachment))\n    {\n        \/\/ If the current framebuffer is using the default colorbuffer, and present path fast is\n        \/\/ active, and the scissor rect is enabled, then we should invert the scissor rect\n        \/\/ vertically\n        ClearParameters presentPathFastClearParams = clearParams;\n        gl::Extents framebufferSize                = colorAttachment->getSize();\n        presentPathFastClearParams.scissor.y       = framebufferSize.height -\n                                               presentPathFastClearParams.scissor.y -\n                                               presentPathFastClearParams.scissor.height;\n        ANGLE_TRY(clearer->clearFramebuffer(presentPathFastClearParams, mState));\n    }\n    else\n    {\n        ANGLE_TRY(clearer->clearFramebuffer(clearParams, mState));\n    }\n\n    ANGLE_TRY(markAttachmentsDirty());\n\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::invalidate(size_t count, const GLenum *attachments)\n{\n    return invalidateBase(count, attachments, false);\n}\n\ngl::Error Framebuffer11::discard(size_t count, const GLenum *attachments)\n{\n    return invalidateBase(count, attachments, true);\n}\n\ngl::Error Framebuffer11::invalidateBase(size_t count, const GLenum *attachments, bool useEXTBehavior) const\n{\n    ID3D11DeviceContext1 *deviceContext1 = mRenderer->getDeviceContext1IfSupported();\n\n    if (!deviceContext1)\n    {\n        \/\/ DiscardView() is only supported on ID3D11DeviceContext1\n        return gl::NoError();\n    }\n\n    bool foundDepth = false;\n    bool foundStencil = false;\n\n    for (size_t i = 0; i < count; ++i)\n    {\n        switch (attachments[i])\n        {\n          \/\/ Handle depth and stencil attachments. Defer discarding until later.\n          case GL_DEPTH_STENCIL_ATTACHMENT:\n            foundDepth = true;\n            foundStencil = true;\n            break;\n          case GL_DEPTH_EXT:\n          case GL_DEPTH_ATTACHMENT:\n            foundDepth = true;\n            break;\n          case GL_STENCIL_EXT:\n          case GL_STENCIL_ATTACHMENT:\n            foundStencil = true;\n            break;\n          default:\n            {\n                \/\/ Handle color attachments\n                ASSERT((attachments[i] >= GL_COLOR_ATTACHMENT0 && attachments[i] <= GL_COLOR_ATTACHMENT15) ||\n                       (attachments[i] == GL_COLOR));\n\n                size_t colorIndex =\n                    (attachments[i] == GL_COLOR ? 0u : (attachments[i] - GL_COLOR_ATTACHMENT0));\n                auto colorAttachment = mState.getColorAttachment(colorIndex);\n                if (colorAttachment)\n                {\n                    ANGLE_TRY(invalidateAttachment(colorAttachment));\n                }\n                break;\n            }\n        }\n    }\n\n    bool discardDepth = false;\n    bool discardStencil = false;\n\n    \/\/ The D3D11 renderer uses the same view for depth and stencil buffers, so we must be careful.\n    if (useEXTBehavior)\n    {\n        \/\/ In the extension, if the app discards only one of the depth and stencil attachments, but\n        \/\/ those are backed by the same packed_depth_stencil buffer, then both images become undefined.\n        discardDepth = foundDepth;\n\n        \/\/ Don't bother discarding the stencil buffer if the depth buffer will already do it\n        discardStencil = foundStencil && (!discardDepth || mState.getDepthAttachment() == nullptr);\n    }\n    else\n    {\n        \/\/ In ES 3.0.4, if a specified attachment has base internal format DEPTH_STENCIL but the\n        \/\/ attachments list does not include DEPTH_STENCIL_ATTACHMENT or both DEPTH_ATTACHMENT and\n        \/\/ STENCIL_ATTACHMENT, then only the specified portion of every pixel in the subregion of pixels\n        \/\/ of the DEPTH_STENCIL buffer may be invalidated, and the other portion must be preserved.\n        discardDepth = (foundDepth && foundStencil) ||\n                       (foundDepth && (mState.getStencilAttachment() == nullptr));\n        discardStencil = (foundStencil && (mState.getDepthAttachment() == nullptr));\n    }\n\n    if (discardDepth && mState.getDepthAttachment())\n    {\n        ANGLE_TRY(invalidateAttachment(mState.getDepthAttachment()));\n    }\n\n    if (discardStencil && mState.getStencilAttachment())\n    {\n        ANGLE_TRY(invalidateAttachment(mState.getStencilAttachment()));\n    }\n\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::invalidateSub(size_t, const GLenum *, const gl::Rectangle &)\n{\n    \/\/ A no-op implementation conforms to the spec, so don't call UNIMPLEMENTED()\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::invalidateAttachment(const gl::FramebufferAttachment *attachment) const\n{\n    ID3D11DeviceContext1 *deviceContext1 = mRenderer->getDeviceContext1IfSupported();\n    ASSERT(deviceContext1);\n    ASSERT(attachment && attachment->isAttached());\n\n    RenderTarget11 *renderTarget = nullptr;\n    ANGLE_TRY(attachment->getRenderTarget(&renderTarget));\n    ID3D11View *view = renderTarget->getRenderTargetView();\n\n    if (view != nullptr)\n    {\n        deviceContext1->DiscardView(view);\n    }\n\n    return gl::NoError();\n}\n\ngl::Error Framebuffer11::readPixelsImpl(const gl::Rectangle &area,\n                                        GLenum format,\n                                        GLenum type,\n                                        size_t outputPitch,\n                                        const gl::PixelPackState &pack,\n                                        uint8_t *pixels) const\n{\n    const gl::FramebufferAttachment *readAttachment = mState.getReadAttachment();\n    ASSERT(readAttachment);\n\n    gl::Buffer *packBuffer = pack.pixelBuffer.get();\n    if (packBuffer != nullptr)\n    {\n        Buffer11 *packBufferStorage = GetImplAs<Buffer11>(packBuffer);\n        PackPixelsParams packParams(area, format, type, static_cast<GLuint>(outputPitch), pack,\n                                    reinterpret_cast<ptrdiff_t>(pixels));\n\n        return packBufferStorage->packPixels(*readAttachment, packParams);\n    }\n\n    return mRenderer->readFromAttachment(*readAttachment, area, format, type,\n                                         static_cast<GLuint>(outputPitch), pack, pixels);\n}\n\ngl::Error Framebuffer11::blitImpl(const gl::Rectangle &sourceArea,\n                                  const gl::Rectangle &destArea,\n                                  const gl::Rectangle *scissor,\n                                  bool blitRenderTarget,\n                                  bool blitDepth,\n                                  bool blitStencil,\n                                  GLenum filter,\n                                  const gl::Framebuffer *sourceFramebuffer)\n{\n    if (blitRenderTarget)\n    {\n        const gl::FramebufferAttachment *readBuffer = sourceFramebuffer->getReadColorbuffer();\n        ASSERT(readBuffer);\n\n        RenderTargetD3D *readRenderTarget = nullptr;\n        ANGLE_TRY(readBuffer->getRenderTarget(&readRenderTarget));\n        ASSERT(readRenderTarget);\n\n        const auto &colorAttachments = mState.getColorAttachments();\n        const auto &drawBufferStates = mState.getDrawBufferStates();\n\n        for (size_t colorAttachment = 0; colorAttachment < colorAttachments.size(); colorAttachment++)\n        {\n            const gl::FramebufferAttachment &drawBuffer = colorAttachments[colorAttachment];\n\n            if (drawBuffer.isAttached() &&\n                drawBufferStates[colorAttachment] != GL_NONE)\n            {\n                RenderTargetD3D *drawRenderTarget = nullptr;\n                ANGLE_TRY(drawBuffer.getRenderTarget(&drawRenderTarget));\n                ASSERT(drawRenderTarget);\n\n                const bool invertColorSource   = UsePresentPathFast(mRenderer, readBuffer);\n                gl::Rectangle actualSourceArea = sourceArea;\n                if (invertColorSource)\n                {\n                    RenderTarget11 *readRenderTarget11 = GetAs<RenderTarget11>(readRenderTarget);\n                    actualSourceArea.y                 = readRenderTarget11->getHeight() - sourceArea.y;\n                    actualSourceArea.height            = -sourceArea.height;\n                }\n\n                const bool invertColorDest   = UsePresentPathFast(mRenderer, &drawBuffer);\n                gl::Rectangle actualDestArea = destArea;\n                if (invertColorDest)\n                {\n                    RenderTarget11 *drawRenderTarget11 = GetAs<RenderTarget11>(drawRenderTarget);\n                    actualDestArea.y                   = drawRenderTarget11->getHeight() - destArea.y;\n                    actualDestArea.height              = -destArea.height;\n                }\n\n                ANGLE_TRY(mRenderer->blitRenderbufferRect(\n                    actualSourceArea, actualDestArea, readRenderTarget, drawRenderTarget, filter,\n                    scissor, blitRenderTarget, false, false));\n            }\n        }\n    }\n\n    if (blitDepth || blitStencil)\n    {\n        const gl::FramebufferAttachment *readBuffer = sourceFramebuffer->getDepthOrStencilbuffer();\n        ASSERT(readBuffer);\n\n        RenderTargetD3D *readRenderTarget = nullptr;\n        ANGLE_TRY(readBuffer->getRenderTarget(&readRenderTarget));\n        ASSERT(readRenderTarget);\n\n        const gl::FramebufferAttachment *drawBuffer = mState.getDepthOrStencilAttachment();\n        ASSERT(drawBuffer);\n\n        RenderTargetD3D *drawRenderTarget = nullptr;\n        ANGLE_TRY(drawBuffer->getRenderTarget(&drawRenderTarget));\n        ASSERT(drawRenderTarget);\n\n        ANGLE_TRY(mRenderer->blitRenderbufferRect(sourceArea, destArea, readRenderTarget,\n                                                  drawRenderTarget, filter, scissor, false,\n                                                  blitDepth, blitStencil));\n    }\n\n    ANGLE_TRY(markAttachmentsDirty());\n    return gl::NoError();\n}\n\nGLenum Framebuffer11::getRenderTargetImplementationFormat(RenderTargetD3D *renderTarget) const\n{\n    RenderTarget11 *renderTarget11 = GetAs<RenderTarget11>(renderTarget);\n    return renderTarget11->getFormatSet().format().fboImplementationInternalFormat;\n}\n\nvoid Framebuffer11::updateColorRenderTarget(size_t colorIndex)\n{\n    UpdateCachedRenderTarget(mState.getColorAttachment(colorIndex),\n                             mCachedColorRenderTargets[colorIndex],\n                             &mColorRenderTargetsDirty[colorIndex]);\n}\n\nvoid Framebuffer11::updateDepthStencilRenderTarget()\n{\n    UpdateCachedRenderTarget(mState.getDepthOrStencilAttachment(), mCachedDepthStencilRenderTarget,\n                             &mDepthStencilRenderTargetDirty);\n}\n\nvoid Framebuffer11::syncState(const gl::Framebuffer::DirtyBits &dirtyBits)\n{\n    mRenderer->getStateManager()->invalidateRenderTarget();\n\n    const auto &mergedDirtyBits = dirtyBits | mInternalDirtyBits;\n    mInternalDirtyBits.reset();\n\n    for (auto dirtyBit : IterateBitSet(mergedDirtyBits))\n    {\n        switch (dirtyBit)\n        {\n            case gl::Framebuffer::DIRTY_BIT_DEPTH_ATTACHMENT:\n            case gl::Framebuffer::DIRTY_BIT_STENCIL_ATTACHMENT:\n                updateDepthStencilRenderTarget();\n                break;\n            case gl::Framebuffer::DIRTY_BIT_DRAW_BUFFERS:\n            case gl::Framebuffer::DIRTY_BIT_READ_BUFFER:\n                break;\n            default:\n            {\n                ASSERT(gl::Framebuffer::DIRTY_BIT_COLOR_ATTACHMENT_0 == 0 &&\n                       dirtyBit < gl::Framebuffer::DIRTY_BIT_COLOR_ATTACHMENT_MAX);\n                size_t colorIndex =\n                    static_cast<size_t>(dirtyBit - gl::Framebuffer::DIRTY_BIT_COLOR_ATTACHMENT_0);\n                updateColorRenderTarget(colorIndex);\n                break;\n            }\n        }\n    }\n\n    \/\/ We should not have dirtied any additional state during our sync.\n    ASSERT(!mInternalDirtyBits.any());\n\n    FramebufferD3D::syncState(dirtyBits);\n}\n\nvoid Framebuffer11::signal(SignalToken token)\n{\n    if (token == gl::IMPLEMENTATION_MAX_FRAMEBUFFER_ATTACHMENTS)\n    {\n        \/\/ Stencil is redundant in this case.\n        mInternalDirtyBits.set(gl::Framebuffer::DIRTY_BIT_DEPTH_ATTACHMENT);\n        mCachedDepthStencilRenderTarget = nullptr;\n    }\n    else\n    {\n        mInternalDirtyBits.set(gl::Framebuffer::DIRTY_BIT_COLOR_ATTACHMENT_0 + token);\n        mCachedColorRenderTargets[token] = nullptr;\n    }\n}\n\ngl::Error Framebuffer11::getSamplePosition(size_t index, GLfloat *xy) const\n{\n    UNIMPLEMENTED();\n    return gl::InternalError() << \"getSamplePosition is unimplemented.\";\n}\n\nbool Framebuffer11::hasAnyInternalDirtyBit() const\n{\n    return mInternalDirtyBits.any();\n}\n\nvoid Framebuffer11::syncInternalState()\n{\n    syncState(gl::Framebuffer::DirtyBits());\n}\n\n}  \/\/ namespace rx\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sysplug.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: vg $ $Date: 2007-12-07 11:53: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#ifndef __PLUGIN_INC_MACPLUG_HXX\n#define __PLUGIN_INC_MACPLUG_HXX\n\n#include <unistd.h>\n\n#include <list>\n#include <map>\n#include <algorithm>\n#include <premac.h>\n#include <Carbon\/Carbon.h>\n#include <Security\/cssmconfig.h>\n#include <postmac.h>\n#undef uint32\n#include <npsdk\/npapi.h>\n\n#define GENERATINGCFM 0\n#include <npsdk\/npupp.h>\n\n#include <plugin\/plcom.hxx>\n#include <premac.h>\n#include <Cocoa\/Cocoa.h>\n#include <postmac.h>\n\n#include <vcl\/sysdata.hxx>\n\n\n\/\/==================================================================================================\nclass MacPluginComm : public PluginComm\n{\nprivate:\n    static int  nConnCounter;\n\n    pid_t       m_nCommPID;\npublic:\n        MacPluginComm( const String& mimetype,\n                       const String& library,\n                       NSView* pParent,\n                       int nDescriptor1,\n                       int nDescriptor2\n                       );\n    virtual ~MacPluginComm();\n\n    virtual NPError NPP_Destroy( NPP instance, NPSavedData** save );\n    virtual NPError NPP_DestroyStream( NPP instance, NPStream* stream,\n                                       NPError reason );\n    virtual void* NPP_GetJavaClass();\n    virtual NPError NPP_Initialize();\n    virtual NPError NPP_New( NPMIMEType pluginType, NPP instance,\n                             uint16 mode, int16 argc,\n                             char* argn[], char* argv[], NPSavedData *saved );\n    virtual NPError NPP_NewStream( NPP instance, NPMIMEType type,\n                                   NPStream* stream,\n                                   NPBool seekable, uint16* stype );\n    virtual void NPP_Print( NPP instance, NPPrint* platformPrint );\n    virtual NPError NPP_SetWindow( NPP instance, NPWindow* window );\n    virtual void NPP_Shutdown();\n    virtual void NPP_StreamAsFile( NPP instance, NPStream* stream,\n                                   const char* fname );\n    virtual void NPP_URLNotify( NPP instance, const char* url, NPReason reason,\n                                void* notifyData );\n    virtual int32 NPP_Write( NPP instance, NPStream* stream, int32 offset,\n                             int32 len, void* buffer );\n    virtual int32 NPP_WriteReady( NPP instance, NPStream* stream );\n    virtual char* NPP_GetMIMEDescription();\n    virtual NPError NPP_GetValue( NPP instance, NPPVariable variable, void* value );\n    virtual NPError NPP_SetValue( NPP instance, NPNVariable variable,\n                                  void *value);\n};\n\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS wae4extensions (1.2.44); FILE MERGED 2008\/01\/10 10:21:57 ericb 1.2.44.6: #i81612# fix forgotten warning in aqua build 2008\/01\/09 13:06:33 ericb 1.2.44.5: #i81612# solve conflicts ( m242 resync) 2007\/11\/16 13:17:13 ericb 1.2.44.4: #i81612# cosmetic change in sysplug.hxx 2007\/11\/16 13:08:47 ericb 1.2.44.3: #i81612# solve conflict 2007\/11\/16 12:41:12 ericb 1.2.44.2: #i81612# a fix for conflict ( due to macleopardbuild integration) 2007\/10\/03 12:47:21 ericb 1.2.44.1: #i81612# fix warning because of bad type in aqua mozilla plugin<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sysplug.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: ihi $ $Date: 2008-01-14 14:52: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 __PLUGIN_INC_MACPLUG_HXX\n#define __PLUGIN_INC_MACPLUG_HXX\n\n#include <unistd.h>\n\n#include <list>\n#include <map>\n#include <algorithm>\n#include <premac.h>\n#include <Carbon\/Carbon.h>\n#include <Security\/cssmconfig.h>\n#include <postmac.h>\n#undef uint32\n#include <npsdk\/npapi.h>\n#include <npsdk\/npupp.h>\n\n#include <plugin\/plcom.hxx>\n#include <premac.h>\n#include <Cocoa\/Cocoa.h>\n#include <postmac.h>\n\n#include <vcl\/sysdata.hxx>\n\n\n\/\/==================================================================================================\nclass MacPluginComm : public PluginComm\n{\nprivate:\n    static int  nConnCounter;\n\n    pid_t       m_nCommPID;\npublic:\n        MacPluginComm( const String& mimetype,\n                       const String& library,\n                       NSView* pParent,\n                       int nDescriptor1,\n                       int nDescriptor2\n                       );\n    virtual ~MacPluginComm();\n\n    virtual NPError NPP_Destroy( NPP instance, NPSavedData** save );\n    virtual NPError NPP_DestroyStream( NPP instance, NPStream* stream,\n                                       NPError reason );\n    virtual void* NPP_GetJavaClass();\n    virtual NPError NPP_Initialize();\n    virtual NPError NPP_New( NPMIMEType pluginType, NPP instance,\n                             uint16 mode, int16 argc,\n                             char* argn[], char* argv[], NPSavedData *saved );\n    virtual NPError NPP_NewStream( NPP instance, NPMIMEType type,\n                                   NPStream* stream,\n                                   NPBool seekable, uint16* stype );\n    virtual void NPP_Print( NPP instance, NPPrint* platformPrint );\n    virtual NPError NPP_SetWindow( NPP instance, NPWindow* window );\n    virtual void NPP_Shutdown();\n    virtual void NPP_StreamAsFile( NPP instance, NPStream* stream,\n                                   const char* fname );\n    virtual void NPP_URLNotify( NPP instance, const char* url, NPReason reason,\n                                void* notifyData );\n    virtual int32 NPP_Write( NPP instance, NPStream* stream, int32 offset,\n                             int32 len, void* buffer );\n    virtual int32 NPP_WriteReady( NPP instance, NPStream* stream );\n    virtual char* NPP_GetMIMEDescription();\n    virtual NPError NPP_GetValue( NPP instance, NPPVariable variable, void* value );\n    virtual NPError NPP_SetValue( NPP instance, NPNVariable variable,\n                                  void *value);\n};\n\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This File is part of Davix, The IO library for HTTP based protocols\n * Copyright (C) CERN 2013\n * Author: Adrien Devresse <adrien.devresse@cern.ch>\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 <cstdio>\n#include <cstring>\n#include <davix.hpp>\n#include <sstream>\n#include <unistd.h>\n#include \"copy_internal.hpp\"\n#include \"delegation\/delegation.hpp\"\n#include <utils\/davix_logger_internal.hpp>\n#include <utils\/davix_gcloud_utils.hpp>\n\nusing namespace Davix;\n\nconst std::string COPY_SCOPE = \"Davix::HttpThirdPartyCopy\";\n\n\/\/ Gets the real location of uri respect to ref\n\/\/ uri can be absolute or relative to ref\nstatic std::string _full_url(const std::string ref,\n        const std::string& uri)\n{\n    std::string final;\n\n    if (uri.find(\":\/\/\") != std::string::npos) {\n        final = uri;\n    }\n    else if (uri[0] == '\/') {\n        size_t colon = ref.find(':');\n        size_t slash = std::string::npos;\n        if (colon != std::string::npos)\n            slash = ref.find('\/', colon + 3);\n        if (slash != std::string::npos) {\n            std::string base = ref.substr(0, slash);\n            final = base + uri;\n        }\n    }\n    else {\n        final = ref + uri;\n    }\n\n    return final;\n}\n\n\n\n\/\/ Same as _full_url, but it makes sure\n\/\/ that the destination is https\nstatic std::string _full_delegation_endpoint(const std::string& ref,\n        const std::string& uri, DavixError** err)\n{\n    std::string final = _full_url(ref, uri);\n    if (final.substr(7).compare(\"http:\/\/\") == 0) {\n        DavixError::setupError(err, COPY_SCOPE, StatusCode::OperationNonSupported,\n                               std::string(\"Plain http can not be used for delegation: \") + uri);\n        final.clear();\n    }\n    return final;\n}\n\n\n\nDavixCopy::DavixCopy(Context &c, const RequestParams *params): d_ptr(NULL)\n{\n    d_ptr = new DavixCopyInternal(c, params);\n}\n\n\n\nDavixCopy::~DavixCopy()\n{\n    delete d_ptr;\n}\n\n\n\nvoid DavixCopy::copy(const Uri &source, const Uri &destination,\n        unsigned nstreams, DavixError **error)\n{\n    d_ptr->copy(source, destination, nstreams, error);\n}\n\n\n\nvoid DavixCopy::setPerformanceCallback(PerformanceCallback callback, void *udata)\n{\n    d_ptr->setPerformanceCallback(callback, udata);\n}\n\n\n\nvoid DavixCopyInternal::setPerformanceCallback(DavixCopy::PerformanceCallback callback,\n        void *udata)\n{\n    perfCallback = callback;\n    perfCallbackUdata = udata;\n}\n\n\n\nvoid DavixCopyInternal::copy(const Uri &src, const Uri &dst,\n        unsigned nstreams, DavixError **error)\n{\n    \/\/std::string nextSrc(src.getString()), prevSrc(src.getString());\n    \/\/std::string destination(dst.getString());\n    std::string nextSrc, prevSrc, destination;\n    std::string delegationEndpoint;\n    DavixError *internalError = NULL;\n    bool suppressFinalHead = false;\n\n    \/\/ set source and destination according to copy method\n    if(parameters->getCopyMode() == CopyMode::Push){\n        nextSrc = src.getString();\n        prevSrc = src.getString();\n        destination = dst.getString();\n    }else if(parameters->getCopyMode() == CopyMode::Pull){\n        nextSrc = dst.getString();\n        prevSrc = dst.getString();\n        destination = src.getString();\n    }\n\n\n    \/\/ nstreams as string\n    char nstreamsStr[16];\n    snprintf(nstreamsStr, sizeof(nstreamsStr), \"%u\", nstreams);\n\n    \/\/ Need a copy so we can modify it\n    Davix::RequestParams requestParams(parameters);\n    requestParams.setTransparentRedirectionSupport(false);\n\n    size_t start_pos;\n\n    \/\/ if destination is s3 endpoint, change prefix to http(s) and pre-sign the request as a PUT\n    if(destination.compare(0,2,\"s3\") == 0){\n        destination.replace(0, 2, \"http\");\n        time_t expiration_time = time(NULL) +3600;\n        Davix::HeaderVec vec;\n        Uri tmp;\n        if (parameters->getCopyMode() == CopyMode::Pull)\n            tmp = Davix::S3::tokenizeRequest(requestParams, \"GET\", destination, vec, expiration_time);\n        else\n            tmp = Davix::S3::tokenizeRequest(requestParams, \"PUT\", destination, vec, expiration_time);\n        destination = tmp.getString();\n        suppressFinalHead = true;\n    }\n\n    \/\/ handle gcloud endpoint as a destination\n    if(destination.compare(0,6,\"gcloud\") == 0){\n        destination.replace(0, 6, \"http\");\n\n        Davix::HeaderVec vec;\n        Uri tmp;\n        if (parameters->getCopyMode() == CopyMode::Pull)\n            tmp = Davix::gcloud::signURI(requestParams.getGcloudCredentials(), \"GET\", destination, vec, 3600);\n        else\n            tmp = Davix::gcloud::signURI(requestParams.getGcloudCredentials(), \"PUT\", destination, vec, 3600);\n        destination = tmp.getString();\n        suppressFinalHead = true;\n    }\n\n    \/\/ Perform COPY hopping through redirections\n    HttpRequest* request = NULL;\n    do {\n        nextSrc = _full_url(prevSrc, nextSrc);\n        prevSrc = nextSrc;\n        if (request) {\n            request->discardBody(&internalError);\n            if (!internalError)\n                request->endRequest(&internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n        }\n        delete request;\n\n        DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Hop: {}\",\n                     nextSrc);\n\n        request = context.createRequest(nextSrc, &internalError);\n        if (internalError) {\n            DavixError::propagatePrefixedError(error, internalError, __func__);\n            break;\n        }\n\n        request->setRequestMethod(\"COPY\");\n        if(parameters->getCopyMode() == CopyMode::Push){\n            request->addHeaderField(\"Destination\", destination);\n        }else if(parameters->getCopyMode() == CopyMode::Pull){\n            request->addHeaderField(\"Source\", destination);\n        }\n        request->addHeaderField(\"X-Number-Of-Streams\", nstreamsStr);\n\n        \/\/ for lcgdm-dav, ask for secure redirection in all cases for COPY\n        request->addHeaderField(\"Secure-Redirection\", \"1\");\n\n        \/\/ for lcgdm-dav -> S3, add NoHead flag to suppress final head-to-close request\n        if(suppressFinalHead)\n            request->addHeaderField(\"Copy-Flags\", \"NoHead\");\n        request->setParameters(requestParams);\n        request->beginRequest(&internalError);\n        if (internalError) {\n            DavixError::propagatePrefixedError(error, internalError, __func__);\n            break;\n        }\n\n        \/\/ If we get a X-Delegate-To, before continuing, delegate\n        if (request->getAnswerHeader(\"X-Delegate-To\", delegationEndpoint)) {\n            delegationEndpoint = _full_delegation_endpoint(nextSrc,\n                                                           delegationEndpoint,\n                                                           &internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Got delegation endpoint: {}\",\n                         delegationEndpoint.c_str());\n\n            std::string dlg_id = DavixDelegation::delegate(context, delegationEndpoint,\n                    parameters, &internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Got delegation ID {}\",\n                         dlg_id.c_str());\n\n            dlg_id.clear();\n        }\n\n    } while (request->getAnswerHeader(\"Location\", nextSrc) && request->getRequestCode() >= 300 && request->getRequestCode() < 400);\n\n    if (!*error) {\n        int responseStatus = request->getRequestCode();\n        if (responseStatus == 404) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::FileNotFound,\n                                   \"Could not COPY. File not found\");\n        }\n        else if (responseStatus == 403) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::PermissionRefused,\n                                   \"Could not COPY. Permission denied.\");\n        }\n        else if (responseStatus == 501) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::OperationNonSupported,\n                                   \"Could not COPY. The source service does not support it\");\n        }\n        else if (responseStatus >= 405) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::OperationNonSupported,\n                                   \"Could not COPY. The source service does not allow it\");\n        }\n        else if (responseStatus == 400) {\n            std::string err_msg(request->getAnswerContentVec().begin(), request->getAnswerContentVec().end());\n        \tDavixError::setupError(error, COPY_SCOPE, StatusCode::InvalidArgument,\n                                   fmt::format(\"Could not COPY. The server rejected the request: {}\", err_msg));\n        }\n        else if (responseStatus >= 300) {\n            std::ostringstream msg;\n            msg << \"Could not COPY. Unknown error code: \" << responseStatus;\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::UnknowError,\n                                   msg.str());\n        }\n    }\n\n    \/\/ Did we fail?\n    if (*error)\n        return;\n\n    \/\/ Finished hopping\n    std::string finalSource = nextSrc;\n\n    \/\/ Just wait for it to finish\n    monitorPerformanceMarkers(request, error);\n    request->endRequest(error);\n    delete request;\n}\n\n\n\nvoid DavixCopyInternal::monitorPerformanceMarkers(Davix::HttpRequest *request,\n        Davix::DavixError **error)\n{\n    Davix::DavixError* daverr = NULL;\n    char buffer[1024], *p;\n    dav_ssize_t line_len;\n\n    PerformanceMarker holder;\n    PerformanceData performance;\n    time_t lastPerfCallback = time(NULL);\n\n    while ((line_len = request->readLine(buffer, sizeof(buffer), &daverr)) >= 0 && !daverr)\n    {\n        buffer[line_len] = '\\0';\n\n        if (line_len > 0)\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Received: {}\", buffer);\n\n        \/\/ Skip heading whitespaces\n        p = buffer;\n        while (*p && p < buffer + sizeof(buffer) && isspace(*p))\n            ++p;\n\n        if (strncasecmp(\"Perf Marker\", p, 11) == 0)\n        {\n            memset(&holder, 0, sizeof(holder));\n        }\n        else if (strncasecmp(\"Timestamp:\", p, 10) == 0)\n        {\n            holder.latest = atol(p + 10);\n        }\n        else if (strncasecmp(\"Stripe Index:\", p, 13) == 0)\n        {\n            holder.index = atoi(p + 13);\n        }\n        else if (strncasecmp(\"Stripe Bytes Transferred:\", p, 25) == 0)\n        {\n            holder.transferred = atol(p + 26);\n        }\n        else if (strncasecmp(\"Total Stripe Count:\", p, 19) == 0)\n        {\n            holder.count = atoi(p + 20);\n        }\n        else if (strncasecmp(\"End\", p, 3) == 0)\n        {\n            performance.update(holder);\n            time_t now = time(NULL);\n            if (now - lastPerfCallback >= 1)\n            {\n                if (this->perfCallback)\n                    this->perfCallback(performance, this->perfCallbackUdata);\n                lastPerfCallback = now;\n            }\n        }\n        else if (strncasecmp(\"success\", p, 7) == 0)\n        {\n            request->discardBody(&daverr);\n            break;\n        }\n        else if (strncasecmp(\"aborted\", p, 7) == 0)\n        {\n            Davix::DavixError::setupError(error, COPY_SCOPE, StatusCode::Canceled,\n                    \"Transfer aborted in the remote end\");\n            break;\n        }\n        else if (strncasecmp(\"failed\", p, 6) == 0 || strncasecmp(\"failure\", p, 7) == 0)\n        {\n            Davix::DavixError::setupError(error, COPY_SCOPE, StatusCode::RemoteError,\n                    std::string(\"Transfer failed: \") + p);\n            break;\n        }\n        else if(line_len> 0)\n        {\n            DAVIX_SLOG(DAVIX_LOG_WARNING, DAVIX_LOG_GRID, \"Unknown performance marker, ignoring: {}\", buffer);\n        }\n    }\n}\n<commit_msg>DMC-1078 Replace TPC dav:\/\/ destinations with http:\/\/<commit_after>\/*\n * This File is part of Davix, The IO library for HTTP based protocols\n * Copyright (C) CERN 2013\n * Author: Adrien Devresse <adrien.devresse@cern.ch>\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 <cstdio>\n#include <cstring>\n#include <davix.hpp>\n#include <sstream>\n#include <unistd.h>\n#include \"copy_internal.hpp\"\n#include \"delegation\/delegation.hpp\"\n#include <utils\/davix_logger_internal.hpp>\n#include <utils\/davix_gcloud_utils.hpp>\n\nusing namespace Davix;\n\nconst std::string COPY_SCOPE = \"Davix::HttpThirdPartyCopy\";\n\n\/\/ Gets the real location of uri respect to ref\n\/\/ uri can be absolute or relative to ref\nstatic std::string _full_url(const std::string ref,\n        const std::string& uri)\n{\n    std::string final;\n\n    if (uri.find(\":\/\/\") != std::string::npos) {\n        final = uri;\n    }\n    else if (uri[0] == '\/') {\n        size_t colon = ref.find(':');\n        size_t slash = std::string::npos;\n        if (colon != std::string::npos)\n            slash = ref.find('\/', colon + 3);\n        if (slash != std::string::npos) {\n            std::string base = ref.substr(0, slash);\n            final = base + uri;\n        }\n    }\n    else {\n        final = ref + uri;\n    }\n\n    return final;\n}\n\n\n\n\/\/ Same as _full_url, but it makes sure\n\/\/ that the destination is https\nstatic std::string _full_delegation_endpoint(const std::string& ref,\n        const std::string& uri, DavixError** err)\n{\n    std::string final = _full_url(ref, uri);\n    if (final.substr(7).compare(\"http:\/\/\") == 0) {\n        DavixError::setupError(err, COPY_SCOPE, StatusCode::OperationNonSupported,\n                               std::string(\"Plain http can not be used for delegation: \") + uri);\n        final.clear();\n    }\n    return final;\n}\n\n\n\nDavixCopy::DavixCopy(Context &c, const RequestParams *params): d_ptr(NULL)\n{\n    d_ptr = new DavixCopyInternal(c, params);\n}\n\n\n\nDavixCopy::~DavixCopy()\n{\n    delete d_ptr;\n}\n\n\n\nvoid DavixCopy::copy(const Uri &source, const Uri &destination,\n        unsigned nstreams, DavixError **error)\n{\n    d_ptr->copy(source, destination, nstreams, error);\n}\n\n\n\nvoid DavixCopy::setPerformanceCallback(PerformanceCallback callback, void *udata)\n{\n    d_ptr->setPerformanceCallback(callback, udata);\n}\n\n\n\nvoid DavixCopyInternal::setPerformanceCallback(DavixCopy::PerformanceCallback callback,\n        void *udata)\n{\n    perfCallback = callback;\n    perfCallbackUdata = udata;\n}\n\n\n\nvoid DavixCopyInternal::copy(const Uri &src, const Uri &dst,\n        unsigned nstreams, DavixError **error)\n{\n    \/\/std::string nextSrc(src.getString()), prevSrc(src.getString());\n    \/\/std::string destination(dst.getString());\n    std::string nextSrc, prevSrc, destination;\n    std::string delegationEndpoint;\n    DavixError *internalError = NULL;\n    bool suppressFinalHead = false;\n\n    \/\/ set source and destination according to copy method\n    if(parameters->getCopyMode() == CopyMode::Push){\n        nextSrc = src.getString();\n        prevSrc = src.getString();\n        destination = dst.getString();\n    }else if(parameters->getCopyMode() == CopyMode::Pull){\n        nextSrc = dst.getString();\n        prevSrc = dst.getString();\n        destination = src.getString();\n    }\n\n\n    \/\/ nstreams as string\n    char nstreamsStr[16];\n    snprintf(nstreamsStr, sizeof(nstreamsStr), \"%u\", nstreams);\n\n    \/\/ Need a copy so we can modify it\n    Davix::RequestParams requestParams(parameters);\n    requestParams.setTransparentRedirectionSupport(false);\n\n    size_t start_pos;\n\n    \/\/ if destination is s3 endpoint, change prefix to http(s) and pre-sign the request as a PUT\n    if(destination.compare(0,2,\"s3\") == 0){\n        destination.replace(0, 2, \"http\");\n        time_t expiration_time = time(NULL) +3600;\n        Davix::HeaderVec vec;\n        Uri tmp;\n        if (parameters->getCopyMode() == CopyMode::Pull)\n            tmp = Davix::S3::tokenizeRequest(requestParams, \"GET\", destination, vec, expiration_time);\n        else\n            tmp = Davix::S3::tokenizeRequest(requestParams, \"PUT\", destination, vec, expiration_time);\n        destination = tmp.getString();\n        suppressFinalHead = true;\n    }\n\n    \/\/ handle gcloud endpoint as a destination\n    if(destination.compare(0,6,\"gcloud\") == 0){\n        destination.replace(0, 6, \"http\");\n\n        Davix::HeaderVec vec;\n        Uri tmp;\n        if (parameters->getCopyMode() == CopyMode::Pull)\n            tmp = Davix::gcloud::signURI(requestParams.getGcloudCredentials(), \"GET\", destination, vec, 3600);\n        else\n            tmp = Davix::gcloud::signURI(requestParams.getGcloudCredentials(), \"PUT\", destination, vec, 3600);\n        destination = tmp.getString();\n        suppressFinalHead = true;\n    }\n\n    if(destination.compare(0, 3, \"dav\")) {\n        destination.replace(0, 3, \"http\");\n    }\n\n    \/\/ Perform COPY hopping through redirections\n    HttpRequest* request = NULL;\n    do {\n        nextSrc = _full_url(prevSrc, nextSrc);\n        prevSrc = nextSrc;\n        if (request) {\n            request->discardBody(&internalError);\n            if (!internalError)\n                request->endRequest(&internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n        }\n        delete request;\n\n        DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Hop: {}\",\n                     nextSrc);\n\n        request = context.createRequest(nextSrc, &internalError);\n        if (internalError) {\n            DavixError::propagatePrefixedError(error, internalError, __func__);\n            break;\n        }\n\n        request->setRequestMethod(\"COPY\");\n        if(parameters->getCopyMode() == CopyMode::Push){\n            request->addHeaderField(\"Destination\", destination);\n        }else if(parameters->getCopyMode() == CopyMode::Pull){\n            request->addHeaderField(\"Source\", destination);\n        }\n        request->addHeaderField(\"X-Number-Of-Streams\", nstreamsStr);\n\n        \/\/ for lcgdm-dav, ask for secure redirection in all cases for COPY\n        request->addHeaderField(\"Secure-Redirection\", \"1\");\n\n        \/\/ for lcgdm-dav -> S3, add NoHead flag to suppress final head-to-close request\n        if(suppressFinalHead)\n            request->addHeaderField(\"Copy-Flags\", \"NoHead\");\n        request->setParameters(requestParams);\n        request->beginRequest(&internalError);\n        if (internalError) {\n            DavixError::propagatePrefixedError(error, internalError, __func__);\n            break;\n        }\n\n        \/\/ If we get a X-Delegate-To, before continuing, delegate\n        if (request->getAnswerHeader(\"X-Delegate-To\", delegationEndpoint)) {\n            delegationEndpoint = _full_delegation_endpoint(nextSrc,\n                                                           delegationEndpoint,\n                                                           &internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Got delegation endpoint: {}\",\n                         delegationEndpoint.c_str());\n\n            std::string dlg_id = DavixDelegation::delegate(context, delegationEndpoint,\n                    parameters, &internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Got delegation ID {}\",\n                         dlg_id.c_str());\n\n            dlg_id.clear();\n        }\n\n    } while (request->getAnswerHeader(\"Location\", nextSrc) && request->getRequestCode() >= 300 && request->getRequestCode() < 400);\n\n    if (!*error) {\n        int responseStatus = request->getRequestCode();\n        if (responseStatus == 404) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::FileNotFound,\n                                   \"Could not COPY. File not found\");\n        }\n        else if (responseStatus == 403) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::PermissionRefused,\n                                   \"Could not COPY. Permission denied.\");\n        }\n        else if (responseStatus == 501) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::OperationNonSupported,\n                                   \"Could not COPY. The source service does not support it\");\n        }\n        else if (responseStatus >= 405) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::OperationNonSupported,\n                                   \"Could not COPY. The source service does not allow it\");\n        }\n        else if (responseStatus == 400) {\n            std::string err_msg(request->getAnswerContentVec().begin(), request->getAnswerContentVec().end());\n        \tDavixError::setupError(error, COPY_SCOPE, StatusCode::InvalidArgument,\n                                   fmt::format(\"Could not COPY. The server rejected the request: {}\", err_msg));\n        }\n        else if (responseStatus >= 300) {\n            std::ostringstream msg;\n            msg << \"Could not COPY. Unknown error code: \" << responseStatus;\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::UnknowError,\n                                   msg.str());\n        }\n    }\n\n    \/\/ Did we fail?\n    if (*error)\n        return;\n\n    \/\/ Finished hopping\n    std::string finalSource = nextSrc;\n\n    \/\/ Just wait for it to finish\n    monitorPerformanceMarkers(request, error);\n    request->endRequest(error);\n    delete request;\n}\n\n\n\nvoid DavixCopyInternal::monitorPerformanceMarkers(Davix::HttpRequest *request,\n        Davix::DavixError **error)\n{\n    Davix::DavixError* daverr = NULL;\n    char buffer[1024], *p;\n    dav_ssize_t line_len;\n\n    PerformanceMarker holder;\n    PerformanceData performance;\n    time_t lastPerfCallback = time(NULL);\n\n    while ((line_len = request->readLine(buffer, sizeof(buffer), &daverr)) >= 0 && !daverr)\n    {\n        buffer[line_len] = '\\0';\n\n        if (line_len > 0)\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Received: {}\", buffer);\n\n        \/\/ Skip heading whitespaces\n        p = buffer;\n        while (*p && p < buffer + sizeof(buffer) && isspace(*p))\n            ++p;\n\n        if (strncasecmp(\"Perf Marker\", p, 11) == 0)\n        {\n            memset(&holder, 0, sizeof(holder));\n        }\n        else if (strncasecmp(\"Timestamp:\", p, 10) == 0)\n        {\n            holder.latest = atol(p + 10);\n        }\n        else if (strncasecmp(\"Stripe Index:\", p, 13) == 0)\n        {\n            holder.index = atoi(p + 13);\n        }\n        else if (strncasecmp(\"Stripe Bytes Transferred:\", p, 25) == 0)\n        {\n            holder.transferred = atol(p + 26);\n        }\n        else if (strncasecmp(\"Total Stripe Count:\", p, 19) == 0)\n        {\n            holder.count = atoi(p + 20);\n        }\n        else if (strncasecmp(\"End\", p, 3) == 0)\n        {\n            performance.update(holder);\n            time_t now = time(NULL);\n            if (now - lastPerfCallback >= 1)\n            {\n                if (this->perfCallback)\n                    this->perfCallback(performance, this->perfCallbackUdata);\n                lastPerfCallback = now;\n            }\n        }\n        else if (strncasecmp(\"success\", p, 7) == 0)\n        {\n            request->discardBody(&daverr);\n            break;\n        }\n        else if (strncasecmp(\"aborted\", p, 7) == 0)\n        {\n            Davix::DavixError::setupError(error, COPY_SCOPE, StatusCode::Canceled,\n                    \"Transfer aborted in the remote end\");\n            break;\n        }\n        else if (strncasecmp(\"failed\", p, 6) == 0 || strncasecmp(\"failure\", p, 7) == 0)\n        {\n            Davix::DavixError::setupError(error, COPY_SCOPE, StatusCode::RemoteError,\n                    std::string(\"Transfer failed: \") + p);\n            break;\n        }\n        else if(line_len> 0)\n        {\n            DAVIX_SLOG(DAVIX_LOG_WARNING, DAVIX_LOG_GRID, \"Unknown performance marker, ignoring: {}\", buffer);\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n#include <cstring>\n#include <davix.hpp>\n#include <sstream>\n#include <unistd.h>\n#include \"copy_internal.hpp\"\n#include \"delegation\/delegation.hpp\"\n#include <utils\/davix_logger_internal.hpp>\n\nusing namespace Davix;\n\nconst std::string COPY_SCOPE = \"Davix::HttpThirdPartyCopy\";\n\n\/\/ Gets the real location of uri respect to ref\n\/\/ uri can be absolute or relative to ref\nstatic std::string _full_url(const std::string ref,\n        const std::string& uri)\n{\n    std::string final;\n\n    if (uri.find(\":\/\/\") != std::string::npos) {\n        final = uri;\n    }\n    else if (uri[0] == '\/') {\n        size_t colon = ref.find(':');\n        size_t slash = std::string::npos;\n        if (colon != std::string::npos)\n            slash = ref.find('\/', colon + 3);\n        if (slash != std::string::npos) {\n            std::string base = ref.substr(0, slash);\n            final = base + uri;\n        }\n    }\n    else {\n        final = ref + uri;\n    }\n\n    return final;\n}\n\n\n\n\/\/ Same as _full_url, but it makes sure\n\/\/ that the destination is https\nstatic std::string _full_delegation_endpoint(const std::string& ref,\n        const std::string& uri, DavixError** err)\n{\n    std::string final = _full_url(ref, uri);\n    if (final.substr(7).compare(\"http:\/\/\") == 0) {\n        DavixError::setupError(err, COPY_SCOPE, StatusCode::OperationNonSupported,\n                               std::string(\"Plain http can not be used for delegation: \") + uri);\n        final.clear();\n    }\n    return final;\n}\n\n\n\nDavixCopy::DavixCopy(Context &c, const RequestParams *params): d_ptr(NULL)\n{\n    d_ptr = new DavixCopyInternal(c, params);\n}\n\n\n\nDavixCopy::~DavixCopy()\n{\n    delete d_ptr;\n}\n\n\n\nvoid DavixCopy::copy(const Uri &source, const Uri &destination,\n        unsigned nstreams, DavixError **error)\n{\n    d_ptr->copy(source, destination, nstreams, error);\n}\n\n\n\nvoid DavixCopy::setPerformanceCallback(PerformanceCallback callback, void *udata)\n{\n    d_ptr->setPerformanceCallback(callback, udata);\n}\n\n\n\nvoid DavixCopyInternal::setPerformanceCallback(DavixCopy::PerformanceCallback callback,\n        void *udata)\n{\n    perfCallback = callback;\n    perfCallbackUdata = udata;\n}\n\n\n\nvoid DavixCopyInternal::copy(const Uri &src, const Uri &dst,\n        unsigned nstreams, DavixError **error)\n{\n    std::string nextSrc(src.getString()), prevSrc(src.getString());\n    std::string destination(dst.getString());\n    std::string delegationEndpoint;\n    DavixError *internalError = NULL;\n\n    \/\/ nstreams as string\n    char nstreamsStr[16];\n    snprintf(nstreamsStr, sizeof(nstreamsStr), \"%u\", nstreams);\n\n    \/\/ Need a copy so we can modify it\n    Davix::RequestParams requestParams(parameters);\n    requestParams.setTransparentRedirectionSupport(false);\n\n    \/\/ Perform COPY hopping through redirections\n    HttpRequest* request = NULL;\n    do {\n        nextSrc = _full_url(prevSrc, nextSrc);\n        prevSrc = nextSrc;\n        if (request) {\n            request->discardBody(&internalError);\n            if (!internalError)\n                request->endRequest(&internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n        }\n        delete request;\n\n        DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Hop: {}\",\n                     nextSrc);\n\n        request = context.createRequest(nextSrc, &internalError);\n        if (internalError) {\n            DavixError::propagatePrefixedError(error, internalError, __func__);\n            break;\n        }\n\n        request->setRequestMethod(\"COPY\");\n        request->addHeaderField(\"Destination\", destination);\n        request->addHeaderField(\"X-Number-Of-Streams\", nstreamsStr);\n        request->setParameters(requestParams);\n        request->beginRequest(&internalError);\n        if (internalError) {\n            DavixError::propagatePrefixedError(error, internalError, __func__);\n            break;\n        }\n\n        \/\/ If we get a X-Delegate-To, before continuing, delegate\n        if (request->getAnswerHeader(\"X-Delegate-To\", delegationEndpoint)) {\n            delegationEndpoint = _full_delegation_endpoint(nextSrc,\n                                                           delegationEndpoint,\n                                                           &internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Got delegation endpoint: {}\",\n                         delegationEndpoint.c_str());\n\n            std::string dlg_id = DavixDelegation::delegate(context, delegationEndpoint,\n                    parameters, &internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Got delegation ID {}\",\n                         dlg_id.c_str());\n\n            dlg_id.clear();\n        }\n\n\n    } while (request->getAnswerHeader(\"Location\", nextSrc));\n\n    if (!*error) {\n        int responseStatus = request->getRequestCode();\n        if (responseStatus == 404) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::FileNotFound,\n                                   \"Could not COPY. File not found\");\n        }\n        else if (responseStatus == 403) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::PermissionRefused,\n                                   \"Could not COPY. Permission denied.\");\n        }\n        else if (responseStatus == 501) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::OperationNonSupported,\n                                   \"Could not COPY. The source service does not support it\");\n        }\n        else if (responseStatus >= 405) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::OperationNonSupported,\n                                   \"Could not COPY. The source service does not allow it\");\n        }\n        else if (responseStatus == 400) {\n            std::string err_msg(request->getAnswerContentVec().begin(), request->getAnswerContentVec().end());\n        \tDavixError::setupError(error, COPY_SCOPE, StatusCode::InvalidArgument,\n                                   fmt::format(\"Could not COPY. The server rejected the request: {}\", err_msg));\n        }\n        else if (responseStatus >= 300) {\n            std::ostringstream msg;\n            msg << \"Could not COPY. Unknown error code: \" << responseStatus;\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::UnknowError,\n                                   msg.str());\n        }\n    }\n\n    \/\/ Did we fail?\n    if (*error)\n        return;\n\n    \/\/ Finished hopping\n    std::string finalSource = nextSrc;\n\n    \/\/ Just wait for it to finish\n    monitorPerformanceMarkers(request, error);\n    request->endRequest(error);\n    delete request;\n}\n\n\n\nvoid DavixCopyInternal::monitorPerformanceMarkers(Davix::HttpRequest *request,\n        Davix::DavixError **error)\n{\n    Davix::DavixError* daverr = NULL;\n    char buffer[1024], *p;\n    dav_ssize_t line_len;\n\n    PerformanceMarker holder;\n    PerformanceData performance;\n    time_t lastPerfCallback = time(NULL);\n\n    while ((line_len = request->readLine(buffer, sizeof(buffer), &daverr)) >= 0 && !daverr)\n    {\n        buffer[line_len] = '\\0';\n\n        if (line_len > 0)\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Received: {}\", buffer);\n\n        \/\/ Skip heading whitespaces\n        p = buffer;\n        while (*p && p < buffer + sizeof(buffer) && isspace(*p))\n            ++p;\n\n        if (strncasecmp(\"Perf Marker\", p, 11) == 0)\n        {\n            memset(&holder, 0, sizeof(holder));\n        }\n        else if (strncasecmp(\"Timestamp:\", p, 10) == 0)\n        {\n            holder.latest = atol(p + 10);\n        }\n        else if (strncasecmp(\"Stripe Index:\", p, 13) == 0)\n        {\n            holder.index = atoi(p + 13);\n        }\n        else if (strncasecmp(\"Stripe Bytes Transferred:\", p, 25) == 0)\n        {\n            holder.transferred = atol(p + 26);\n        }\n        else if (strncasecmp(\"Total Stripe Count:\", p, 19) == 0)\n        {\n            holder.count = atoi(p + 20);\n        }\n        else if (strncasecmp(\"End\", p, 3) == 0)\n        {\n            performance.update(holder);\n            time_t now = time(NULL);\n            if (now - lastPerfCallback >= 1)\n            {\n                if (this->perfCallback)\n                    this->perfCallback(performance, this->perfCallbackUdata);\n                lastPerfCallback = now;\n            }\n        }\n        else if (strncasecmp(\"success\", p, 7) == 0)\n        {\n            break;\n        }\n        else if (strncasecmp(\"aborted\", p, 7) == 0)\n        {\n            Davix::DavixError::setupError(error, COPY_SCOPE, StatusCode::Canceled,\n                    \"Transfer aborted in the remote end\");\n            break;\n        }\n        else if (strncasecmp(\"failed\", p, 6) == 0 || strncasecmp(\"failure\", p, 7) == 0)\n        {\n            Davix::DavixError::setupError(error, COPY_SCOPE, StatusCode::RemoteError,\n                    std::string(\"Transfer failed: \") + p);\n            break;\n        }\n        else if(line_len> 0)\n        {\n            DAVIX_SLOG(DAVIX_LOG_WARNING, DAVIX_LOG_GRID, \"Unknown performance marker, ignoring: {}\", buffer);\n        }\n    }\n}\n\n\n\n\n<commit_msg>DMC-665 - Add support for 3rd party copy from dav to s3 storage<commit_after>#include <cstdio>\n#include <cstring>\n#include <davix.hpp>\n#include <sstream>\n#include <unistd.h>\n#include \"copy_internal.hpp\"\n#include \"delegation\/delegation.hpp\"\n#include <utils\/davix_logger_internal.hpp>\n\nusing namespace Davix;\n\nconst std::string COPY_SCOPE = \"Davix::HttpThirdPartyCopy\";\n\n\/\/ Gets the real location of uri respect to ref\n\/\/ uri can be absolute or relative to ref\nstatic std::string _full_url(const std::string ref,\n        const std::string& uri)\n{\n    std::string final;\n\n    if (uri.find(\":\/\/\") != std::string::npos) {\n        final = uri;\n    }\n    else if (uri[0] == '\/') {\n        size_t colon = ref.find(':');\n        size_t slash = std::string::npos;\n        if (colon != std::string::npos)\n            slash = ref.find('\/', colon + 3);\n        if (slash != std::string::npos) {\n            std::string base = ref.substr(0, slash);\n            final = base + uri;\n        }\n    }\n    else {\n        final = ref + uri;\n    }\n\n    return final;\n}\n\n\n\n\/\/ Same as _full_url, but it makes sure\n\/\/ that the destination is https\nstatic std::string _full_delegation_endpoint(const std::string& ref,\n        const std::string& uri, DavixError** err)\n{\n    std::string final = _full_url(ref, uri);\n    if (final.substr(7).compare(\"http:\/\/\") == 0) {\n        DavixError::setupError(err, COPY_SCOPE, StatusCode::OperationNonSupported,\n                               std::string(\"Plain http can not be used for delegation: \") + uri);\n        final.clear();\n    }\n    return final;\n}\n\n\n\nDavixCopy::DavixCopy(Context &c, const RequestParams *params): d_ptr(NULL)\n{\n    d_ptr = new DavixCopyInternal(c, params);\n}\n\n\n\nDavixCopy::~DavixCopy()\n{\n    delete d_ptr;\n}\n\n\n\nvoid DavixCopy::copy(const Uri &source, const Uri &destination,\n        unsigned nstreams, DavixError **error)\n{\n    d_ptr->copy(source, destination, nstreams, error);\n}\n\n\n\nvoid DavixCopy::setPerformanceCallback(PerformanceCallback callback, void *udata)\n{\n    d_ptr->setPerformanceCallback(callback, udata);\n}\n\n\n\nvoid DavixCopyInternal::setPerformanceCallback(DavixCopy::PerformanceCallback callback,\n        void *udata)\n{\n    perfCallback = callback;\n    perfCallbackUdata = udata;\n}\n\n\n\nvoid DavixCopyInternal::copy(const Uri &src, const Uri &dst,\n        unsigned nstreams, DavixError **error)\n{\n    std::string nextSrc(src.getString()), prevSrc(src.getString());\n    std::string destination(dst.getString());\n    std::string delegationEndpoint;\n    DavixError *internalError = NULL;\n    bool isS3endpoint = false;\n\n    \/\/ nstreams as string\n    char nstreamsStr[16];\n    snprintf(nstreamsStr, sizeof(nstreamsStr), \"%u\", nstreams);\n\n    \/\/ Need a copy so we can modify it\n    Davix::RequestParams requestParams(parameters);\n    requestParams.setTransparentRedirectionSupport(false);\n\n    size_t start_pos;\n\n    \/\/ if destination is s3 endpoint, change prefix to http(s) and pre-sign the request as a PUT\n    if(destination.compare(0,2,\"s3\") == 0){ \n        destination.replace(0, 2, \"http\");\n        time_t expiration_time = time(NULL) +3600;\n        Davix::HeaderVec vec;\n        Uri tmp = Davix::S3::tokenizeRequest(requestParams, \"PUT\", destination, vec, expiration_time);\n        destination = tmp.getString();\n        isS3endpoint = true;\n    }\n\n    \/\/ Perform COPY hopping through redirections\n    HttpRequest* request = NULL;\n    do {\n        nextSrc = _full_url(prevSrc, nextSrc);\n        prevSrc = nextSrc;\n        if (request) {\n            request->discardBody(&internalError);\n            if (!internalError)\n                request->endRequest(&internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n        }\n        delete request;\n\n        DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Hop: {}\",\n                     nextSrc);\n\n        request = context.createRequest(nextSrc, &internalError);\n        if (internalError) {\n            DavixError::propagatePrefixedError(error, internalError, __func__);\n            break;\n        }\n\n        request->setRequestMethod(\"COPY\");\n        request->addHeaderField(\"Destination\", destination);\n        request->addHeaderField(\"X-Number-Of-Streams\", nstreamsStr);\n        \/\/ for lcgdm-dav -> S3, add NoHead flag to suppress final head-to-close request\n        if(isS3endpoint)\n            request->addHeaderField(\"Copy-Flags\", \"NoHead\");\n        request->setParameters(requestParams);\n        request->beginRequest(&internalError);\n        if (internalError) {\n            DavixError::propagatePrefixedError(error, internalError, __func__);\n            break;\n        }\n\n        \/\/ If we get a X-Delegate-To, before continuing, delegate\n        if (request->getAnswerHeader(\"X-Delegate-To\", delegationEndpoint)) {\n            delegationEndpoint = _full_delegation_endpoint(nextSrc,\n                                                           delegationEndpoint,\n                                                           &internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Got delegation endpoint: {}\",\n                         delegationEndpoint.c_str());\n\n            std::string dlg_id = DavixDelegation::delegate(context, delegationEndpoint,\n                    parameters, &internalError);\n            if (internalError) {\n                DavixError::propagatePrefixedError(error, internalError, __func__);\n                break;\n            }\n\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Got delegation ID {}\",\n                         dlg_id.c_str());\n\n            dlg_id.clear();\n        }\n\n\n    } while (request->getAnswerHeader(\"Location\", nextSrc));\n\n    if (!*error) {\n        int responseStatus = request->getRequestCode();\n        if (responseStatus == 404) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::FileNotFound,\n                                   \"Could not COPY. File not found\");\n        }\n        else if (responseStatus == 403) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::PermissionRefused,\n                                   \"Could not COPY. Permission denied.\");\n        }\n        else if (responseStatus == 501) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::OperationNonSupported,\n                                   \"Could not COPY. The source service does not support it\");\n        }\n        else if (responseStatus >= 405) {\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::OperationNonSupported,\n                                   \"Could not COPY. The source service does not allow it\");\n        }\n        else if (responseStatus == 400) {\n            std::string err_msg(request->getAnswerContentVec().begin(), request->getAnswerContentVec().end());\n        \tDavixError::setupError(error, COPY_SCOPE, StatusCode::InvalidArgument,\n                                   fmt::format(\"Could not COPY. The server rejected the request: {}\", err_msg));\n        }\n        else if (responseStatus >= 300) {\n            std::ostringstream msg;\n            msg << \"Could not COPY. Unknown error code: \" << responseStatus;\n            DavixError::setupError(error, COPY_SCOPE, StatusCode::UnknowError,\n                                   msg.str());\n        }\n    }\n\n    \/\/ Did we fail?\n    if (*error)\n        return;\n\n    \/\/ Finished hopping\n    std::string finalSource = nextSrc;\n\n    \/\/ Just wait for it to finish\n    monitorPerformanceMarkers(request, error);\n    request->endRequest(error);\n    delete request;\n}\n\n\n\nvoid DavixCopyInternal::monitorPerformanceMarkers(Davix::HttpRequest *request,\n        Davix::DavixError **error)\n{\n    Davix::DavixError* daverr = NULL;\n    char buffer[1024], *p;\n    dav_ssize_t line_len;\n\n    PerformanceMarker holder;\n    PerformanceData performance;\n    time_t lastPerfCallback = time(NULL);\n\n    while ((line_len = request->readLine(buffer, sizeof(buffer), &daverr)) >= 0 && !daverr)\n    {\n        buffer[line_len] = '\\0';\n\n        if (line_len > 0)\n            DAVIX_SLOG(DAVIX_LOG_VERBOSE, DAVIX_LOG_GRID, \"Received: {}\", buffer);\n\n        \/\/ Skip heading whitespaces\n        p = buffer;\n        while (*p && p < buffer + sizeof(buffer) && isspace(*p))\n            ++p;\n\n        if (strncasecmp(\"Perf Marker\", p, 11) == 0)\n        {\n            memset(&holder, 0, sizeof(holder));\n        }\n        else if (strncasecmp(\"Timestamp:\", p, 10) == 0)\n        {\n            holder.latest = atol(p + 10);\n        }\n        else if (strncasecmp(\"Stripe Index:\", p, 13) == 0)\n        {\n            holder.index = atoi(p + 13);\n        }\n        else if (strncasecmp(\"Stripe Bytes Transferred:\", p, 25) == 0)\n        {\n            holder.transferred = atol(p + 26);\n        }\n        else if (strncasecmp(\"Total Stripe Count:\", p, 19) == 0)\n        {\n            holder.count = atoi(p + 20);\n        }\n        else if (strncasecmp(\"End\", p, 3) == 0)\n        {\n            performance.update(holder);\n            time_t now = time(NULL);\n            if (now - lastPerfCallback >= 1)\n            {\n                if (this->perfCallback)\n                    this->perfCallback(performance, this->perfCallbackUdata);\n                lastPerfCallback = now;\n            }\n        }\n        else if (strncasecmp(\"success\", p, 7) == 0)\n        {\n            break;\n        }\n        else if (strncasecmp(\"aborted\", p, 7) == 0)\n        {\n            Davix::DavixError::setupError(error, COPY_SCOPE, StatusCode::Canceled,\n                    \"Transfer aborted in the remote end\");\n            break;\n        }\n        else if (strncasecmp(\"failed\", p, 6) == 0 || strncasecmp(\"failure\", p, 7) == 0)\n        {\n            Davix::DavixError::setupError(error, COPY_SCOPE, StatusCode::RemoteError,\n                    std::string(\"Transfer failed: \") + p);\n            break;\n        }\n        else if(line_len> 0)\n        {\n            DAVIX_SLOG(DAVIX_LOG_WARNING, DAVIX_LOG_GRID, \"Unknown performance marker, ignoring: {}\", buffer);\n        }\n    }\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"crange_arch.hh\"\n#include \"radix.hh\"\n\nenum { crange_debug = 0 };\n\n#define dprintf(...) do { if (crange_debug) cprintf(__VA_ARGS__); } while(0)\n\n\/\/ Returns the index needed to reach |level| from |level+1|.\nstatic u32\nindex(u64 key, u32 level)\n{\n  u64 idx = key >> (bits_per_level * level);\n  idx &= (1 << bits_per_level) - 1;\n  return idx;\n}\n\n\/\/ Returns the level we stopped at.\ntemplate<class CB>\nu32\ndescend(u64 key, markptr<void> *n, u32 level, CB cb, bool create)\n{\n  static_assert(key_bits == bits_per_level * radix_levels,\n                \"for now, we only support exact multiples of bits_per_level\");\n  assert(n);\n\n  void *v = n->ptr();\n  if (v == 0 && create) {\n    radix_node *new_rn = new radix_node();\n    if (n->ptr().cmpxch_update(&v, (void*) new_rn))\n      v = new_rn;\n    else\n      delete new_rn;\n  }\n  \/\/ Node isn't there. Just return.\n  if (v == 0) {\n    return level+1;\n  }\n\n  radix_node *rn = (radix_node*) v;\n\n  markptr<void> *vptr = &rn->ptr[index(key, level)];\n  if (level == 0) {\n    cb(vptr);\n    return level;\n  } else {\n    return descend(key, vptr, level-1, cb, create);\n  }\n}\n\nradix_elem*\nradix::search(u64 key)\n{\n  radix_elem *result = 0;\n  descend(key >> shift_, &root_, radix_levels-1, [&result](markptr<void> *v) {\n      result = (radix_elem*) v->ptr().load();\n    }, false);\n  dprintf(\"%p: search(%lu) -> %p\\n\", this, key >> shift_, result);\n  return result;\n}\n\nradix_range\nradix::search_lock(u64 start, u64 size)\n{\n  return radix_range(this, start >> shift_, size >> shift_);\n}\n\nu64\nradix::skip_empty(u64 k) const\n{\n  u64 next_k = k;\n  while (next_k < (1UL<<key_bits)) {\n    \/\/ Does next_k exist?\n    \/\/ FIXME: evil evil const_cast\n    u32 level = descend(next_k, const_cast<markptr<void>*>(&root_),\n                        radix_levels-1, [](markptr<void> *v){}, false);\n    if (level == 0) {\n      return next_k;\n    }\n    u64 mask = 1UL<<(bits_per_level * level);\n    \/\/ Skip past everything we know is missing.\n    next_k = (next_k & ~(mask-1)) + mask;\n  }\n  \/\/ Nope, no successor.\n  return ~0ULL;\n}\n\nradix_range::radix_range(radix *r, u64 start, u64 size)\n  : r_(r), start_(start), size_(size)\n{\n  for (u64 k = start_; k != start_ + size_; k++) {\n    if (descend(k, &r_->root_, radix_levels-1, [](markptr<void> *v) {\n          while (!v->mark().xchg(true))\n            ; \/\/ spin\n        }, true) != 0) {\n      panic(\"radix_range\");\n    }\n  }\n}\n\nradix_range::~radix_range()\n{\n  if (!r_)\n    return;\n\n  for (u64 k = start_; k != start_ + size_; k++) {\n    if (descend(k, &r_->root_, radix_levels-1, [](markptr<void> *v) {\n          v->mark() = false;\n        }, true) != 0) {\n      panic(\"~radix_range\");\n    }\n  }\n}\n\nvoid\nradix_range::replace(u64 start, u64 size, radix_elem *val)\n{\n  start = start >> r_->shift_;\n  size = size >> r_->shift_;\n  dprintf(\"%p: replace: [%lu, %lu) with %p\\n\", r_, start, start + size, val);\n\n  assert(start >= start_);\n  assert(start + size <= start_ + size_);\n\n  for (u64 k = start; k != start + size; k++) {\n    if (descend(k, &r_->root_, radix_levels-1, [val](markptr<void> *v) {\n          void* cur = v->ptr().load();\n          while (!v->ptr().cmpxch_update(&cur, val))\n            ; \/\/ spin\n          if (val)\n            val->incref();\n          if (cur)\n            ((radix_elem*) cur)->decref();\n        }, true)) {\n      panic(\"radix_range::replace\");\n    }\n  }\n}\n\nradix_elem*\nradix_iterator::operator*()\n{\n  radix_elem *result = 0;\n  descend(k_, (markptr<void>*) &r_->root_, radix_levels-1, [&result](markptr<void> *v) {\n      result = (radix_elem*) v->ptr().load();\n    }, false);\n  return result;\n}\n\nradix_iterator2::radix_iterator2(const radix* r, u64 k)\n  : r_(r), k_(k) {\n  dprintf(\"%p: Made iterator with k = %lu\\n\", r_, k_);\n  if (k_ != ~0ULL) {\n    path_[radix_levels] = r_->root_.ptr().load();\n    if (!find_first_leaf(radix_levels - 1))\n      k_ = ~0ULL;\n  }\n  dprintf(\"%p: Adjusted: k = %lu\\n\", r_, k_);\n}\n\nbool\nradix_iterator2::advance(u32 level)\n{\n  \/\/ First, see if we can advance a lower level.\n  if (level > 0 && advance(level-1)) {\n    \/\/ Nothing more to do.\n    return true;\n  }\n\n  \/\/ Try to advance this level.\n  for (u32 idx = index(k_, level) + 1;\n       idx < (1<<bits_per_level);\n       idx++) {\n    void *next = node(level+1)->ptr[idx].ptr().load();\n    if (next != nullptr) {\n      \/\/ Clear everything this level and under and set this one.\n      k_ &= ~((1ULL<<((level+1) * bits_per_level)) - 1);\n      k_ |= (u64(idx) << (level * bits_per_level));\n      path_[level] = next;\n\n      \/\/ Try to find a leaf.\n      if (level == 0 || find_first_leaf(level-1))\n        return true;\n    }\n  }\n  \/\/ Failed to advance. Abort.\n  return false;\n}\n\nbool\nradix_iterator2::find_first_leaf(u32 level)\n{\n  \/\/ Find the first non-empty node after k_ on this level.\n  for (u32 idx = index(k_, level); idx < (1<<bits_per_level); idx++) {\n    void *next = node(level+1)->ptr[idx].ptr().load();\n    if (next != nullptr) {\n      if (index(k_, level) != idx) {\n        \/\/ We had to advance; clear everything this level and under\n        \/\/ and set this one.\n        k_ &= ~((1ULL<<((level+1) * bits_per_level)) - 1);\n        k_ |= (u64(idx) << (level * bits_per_level));\n      }\n      path_[level] = next;\n\n      if (level == 0 || find_first_leaf(level-1))\n        return true;\n    }\n  }\n\n  \/\/ Failed to find a leaf. Abort.\n  return false;\n}\n<commit_msg>Simplify advance a bit<commit_after>#include \"crange_arch.hh\"\n#include \"radix.hh\"\n\nenum { crange_debug = 0 };\n\n#define dprintf(...) do { if (crange_debug) cprintf(__VA_ARGS__); } while(0)\n\n\/\/ Returns the index needed to reach |level| from |level+1|.\nstatic u32\nindex(u64 key, u32 level)\n{\n  u64 idx = key >> (bits_per_level * level);\n  idx &= (1 << bits_per_level) - 1;\n  return idx;\n}\n\n\/\/ Returns the level we stopped at.\ntemplate<class CB>\nu32\ndescend(u64 key, markptr<void> *n, u32 level, CB cb, bool create)\n{\n  static_assert(key_bits == bits_per_level * radix_levels,\n                \"for now, we only support exact multiples of bits_per_level\");\n  assert(n);\n\n  void *v = n->ptr();\n  if (v == 0 && create) {\n    radix_node *new_rn = new radix_node();\n    if (n->ptr().cmpxch_update(&v, (void*) new_rn))\n      v = new_rn;\n    else\n      delete new_rn;\n  }\n  \/\/ Node isn't there. Just return.\n  if (v == 0) {\n    return level+1;\n  }\n\n  radix_node *rn = (radix_node*) v;\n\n  markptr<void> *vptr = &rn->ptr[index(key, level)];\n  if (level == 0) {\n    cb(vptr);\n    return level;\n  } else {\n    return descend(key, vptr, level-1, cb, create);\n  }\n}\n\nradix_elem*\nradix::search(u64 key)\n{\n  radix_elem *result = 0;\n  descend(key >> shift_, &root_, radix_levels-1, [&result](markptr<void> *v) {\n      result = (radix_elem*) v->ptr().load();\n    }, false);\n  dprintf(\"%p: search(%lu) -> %p\\n\", this, key >> shift_, result);\n  return result;\n}\n\nradix_range\nradix::search_lock(u64 start, u64 size)\n{\n  return radix_range(this, start >> shift_, size >> shift_);\n}\n\nu64\nradix::skip_empty(u64 k) const\n{\n  u64 next_k = k;\n  while (next_k < (1UL<<key_bits)) {\n    \/\/ Does next_k exist?\n    \/\/ FIXME: evil evil const_cast\n    u32 level = descend(next_k, const_cast<markptr<void>*>(&root_),\n                        radix_levels-1, [](markptr<void> *v){}, false);\n    if (level == 0) {\n      return next_k;\n    }\n    u64 mask = 1UL<<(bits_per_level * level);\n    \/\/ Skip past everything we know is missing.\n    next_k = (next_k & ~(mask-1)) + mask;\n  }\n  \/\/ Nope, no successor.\n  return ~0ULL;\n}\n\nradix_range::radix_range(radix *r, u64 start, u64 size)\n  : r_(r), start_(start), size_(size)\n{\n  for (u64 k = start_; k != start_ + size_; k++) {\n    if (descend(k, &r_->root_, radix_levels-1, [](markptr<void> *v) {\n          while (!v->mark().xchg(true))\n            ; \/\/ spin\n        }, true) != 0) {\n      panic(\"radix_range\");\n    }\n  }\n}\n\nradix_range::~radix_range()\n{\n  if (!r_)\n    return;\n\n  for (u64 k = start_; k != start_ + size_; k++) {\n    if (descend(k, &r_->root_, radix_levels-1, [](markptr<void> *v) {\n          v->mark() = false;\n        }, true) != 0) {\n      panic(\"~radix_range\");\n    }\n  }\n}\n\nvoid\nradix_range::replace(u64 start, u64 size, radix_elem *val)\n{\n  start = start >> r_->shift_;\n  size = size >> r_->shift_;\n  dprintf(\"%p: replace: [%lu, %lu) with %p\\n\", r_, start, start + size, val);\n\n  assert(start >= start_);\n  assert(start + size <= start_ + size_);\n\n  for (u64 k = start; k != start + size; k++) {\n    if (descend(k, &r_->root_, radix_levels-1, [val](markptr<void> *v) {\n          void* cur = v->ptr().load();\n          while (!v->ptr().cmpxch_update(&cur, val))\n            ; \/\/ spin\n          if (val)\n            val->incref();\n          if (cur)\n            ((radix_elem*) cur)->decref();\n        }, true)) {\n      panic(\"radix_range::replace\");\n    }\n  }\n}\n\nradix_elem*\nradix_iterator::operator*()\n{\n  radix_elem *result = 0;\n  descend(k_, (markptr<void>*) &r_->root_, radix_levels-1, [&result](markptr<void> *v) {\n      result = (radix_elem*) v->ptr().load();\n    }, false);\n  return result;\n}\n\nradix_iterator2::radix_iterator2(const radix* r, u64 k)\n  : r_(r), k_(k) {\n  dprintf(\"%p: Made iterator with k = %lu\\n\", r_, k_);\n  if (k_ != ~0ULL) {\n    path_[radix_levels] = r_->root_.ptr().load();\n    if (!find_first_leaf(radix_levels - 1))\n      k_ = ~0ULL;\n  }\n  dprintf(\"%p: Adjusted: k = %lu\\n\", r_, k_);\n}\n\nbool\nradix_iterator2::advance(u32 level)\n{\n  \/\/ First, see if we can advance a lower level.\n  if (level > 0 && advance(level-1)) {\n    \/\/ Nothing more to do.\n    return true;\n  }\n\n  \/\/ Try to advance this level, if we can.\n  u32 start_idx = index(k_, level)+1;\n  if (start_idx < (1<<bits_per_level)) {\n    \/\/ Find the first leaf starting at our sibling node.\n    k_ &= ~((1ULL<<((level+1) * bits_per_level)) - 1);\n    k_ |= (u64(start_idx) << (level * bits_per_level));\n    return find_first_leaf(level);\n  } else {\n    return false;\n  }\n}\n\nbool\nradix_iterator2::find_first_leaf(u32 level)\n{\n  \/\/ Find the first non-empty node after k_ on this level.\n  for (u32 idx = index(k_, level); idx < (1<<bits_per_level); idx++) {\n    void *next = node(level+1)->ptr[idx].ptr().load();\n    if (next != nullptr) {\n      if (index(k_, level) != idx) {\n        \/\/ We had to advance; clear everything this level and under\n        \/\/ and set this one.\n        k_ &= ~((1ULL<<((level+1) * bits_per_level)) - 1);\n        k_ |= (u64(idx) << (level * bits_per_level));\n      }\n      path_[level] = next;\n\n      if (level == 0 || find_first_leaf(level-1))\n        return true;\n    }\n  }\n\n  \/\/ Failed to find a leaf. Abort.\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The local APIC manages internal (non-I\/O) interrupts.\n\/\/ See Chapter 8 & Appendix C of Intel processor manual volume 3.\n\n#include \"types.h\"\n#include \"amd64.h\"\n#include \"kernel.hh\"\n#include \"traps.h\"\n#include \"bits.hh\"\n#include \"cpu.hh\"\n#include \"apic.hh\"\n\n\/\/ Local APIC registers, divided by 4 for use as uint[] indices.\n#define ID      (0x0020\/4)   \/\/ ID\n#define VER     (0x0030\/4)   \/\/ Version\n#define TPR     (0x0080\/4)   \/\/ Task Priority\n#define EOI     (0x00B0\/4)   \/\/ EOI\n#define SVR     (0x00F0\/4)   \/\/ Spurious Interrupt Vector\n  #define ENABLE     0x00000100   \/\/ Unit Enable\n#define ESR     (0x0280\/4)   \/\/ Error Status\n#define ICRLO   (0x0300\/4)   \/\/ Interrupt Command\n  #define INIT       0x00000500   \/\/ INIT\/RESET\n  #define STARTUP    0x00000600   \/\/ Startup IPI\n  #define DELIVS     0x00001000   \/\/ Delivery status\n  #define ASSERT     0x00004000   \/\/ Assert interrupt (vs deassert)\n  #define DEASSERT   0x00000000\n  #define LEVEL      0x00008000   \/\/ Level triggered\n  #define BCAST      0x00080000   \/\/ Send to all APICs, including self.\n  #define FIXED      0x00000000\n#define ICRHI   (0x0310\/4)   \/\/ Interrupt Command [63:32]\n#define TIMER   (0x0320\/4)   \/\/ Local Vector Table 0 (TIMER)\n  #define X1         0x0000000B   \/\/ divide counts by 1\n  #define PERIODIC   0x00020000   \/\/ Periodic\n#define PCINT   (0x0340\/4)   \/\/ Performance Counter LVT\n#define LINT0   (0x0350\/4)   \/\/ Local Vector Table 1 (LINT0)\n#define LINT1   (0x0360\/4)   \/\/ Local Vector Table 2 (LINT1)\n#define ERROR   (0x0370\/4)   \/\/ Local Vector Table 3 (ERROR)\n  #define MASKED     0x00010000   \/\/ Interrupt masked\n  #define MT_NMI     0x00000400   \/\/ NMI message type\n  #define MT_FIX     0x00000000   \/\/ Fixed message type\n#define TICR    (0x0380\/4)   \/\/ Timer Initial Count\n#define TCCR    (0x0390\/4)   \/\/ Timer Current Count\n#define TDCR    (0x03E0\/4)   \/\/ Timer Divide Configuration\n\n#define IO_RTC  0x70\n\nstatic volatile u32 *xapic = (u32 *)(KBASE + 0xfee00000);\nstatic u64 xapichz;\n\nstatic void\nxapicw(int index, int value)\n{\n  xapic[index] = value;\n  xapic[ID];  \/\/ wait for write to finish, by reading\n}\n\nstatic u32\nxapicr(u32 off)\n{\n  return xapic[off];\n}\n\nstatic int\nxapicwait()\n{\n  int i = 100000;\n  while ((xapicr(ICRLO) & DELIVS) != 0) {\n    nop_pause();\n    i--;\n    if (i == 0) {\n      cprintf(\"xapicwait: wedged?\\n\");\n      return -1;\n    }\n  }\n  return 0;\n}\n\nvoid\ninitxapic(void)\n{\n  u64 count;\n\n  u32 edx;\n  cpuid(CPUID_FEATURES, nullptr, nullptr, nullptr, &edx);\n  if (!(edx & FEATURE_EDX_APIC))\n    panic(\"No LAPIC\");\n\n  \/\/ Enable local APIC; set spurious interrupt vector.\n  xapicw(SVR, ENABLE | (T_IRQ0 + IRQ_SPURIOUS));\n\n  if (xapichz == 0) {\n    \/\/ Measure the TICR frequency\n    xapicw(TDCR, X1);    \n    xapicw(TICR, 0xffffffff); \n    u64 ccr0 = xapicr(TCCR);\n    microdelay(10 * 1000);    \/\/ 1\/100th of a second\n    u64 ccr1 = xapicr(TCCR);\n    xapichz = 100 * (ccr0 - ccr1);\n  }\n\n  count = (QUANTUM*xapichz) \/ 1000;\n  if (count > 0xffffffff)\n    panic(\"initxapic: QUANTUM too large\");\n\n  \/\/ The timer repeatedly counts down at bus frequency\n  \/\/ from xapic[TICR] and then issues an interrupt.  \n  xapicw(TDCR, X1);\n  xapicw(TIMER, PERIODIC | (T_IRQ0 + IRQ_TIMER));\n  xapicw(TICR, count); \n\n  \/\/ Disable logical interrupt lines.\n  xapicw(LINT0, MASKED);\n  xapicw(LINT1, MASKED);\n\n  \/\/ Disable performance counter overflow interrupts\n  \/\/ on machines that provide that interrupt entry.\n  if(((xapic[VER]>>16) & 0xFF) >= 4)\n    xapicpc(0);\n\n  \/\/ Map error interrupt to IRQ_ERROR.\n  xapicw(ERROR, T_IRQ0 + IRQ_ERROR);\n\n  \/\/ Clear error status register (requires back-to-back writes).\n  xapicw(ESR, 0);\n  xapicw(ESR, 0);\n\n  \/\/ Ack any outstanding interrupts.\n  xapicw(EOI, 0);\n\n  \/\/ Send an Init Level De-Assert to synchronise arbitration ID's.\n  xapicw(ICRHI, 0);\n  xapicw(ICRLO, BCAST | INIT | LEVEL);\n  while(xapic[ICRLO] & DELIVS)\n    ;\n\n  \/\/ Enable interrupts on the APIC (but not on the processor).\n  xapicw(TPR, 0);\n}\n\nvoid\nxapicpc(char mask)\n{\n  xapicw(PCINT, mask ? MASKED : MT_NMI);\n}\n\nhwid_t\nxapicid(void)\n{\n  if (readrflags() & FL_IF) {\n    cli();\n    panic(\"cpunum() called from %p with interrupts enabled\\n\",\n      __builtin_return_address(0));\n  }\n\n  if (xapic == nullptr)\n    panic(\"xapicid\");\n  return HWID(xapic[ID]>>24);\n}\n\n\/\/ Acknowledge interrupt.\nvoid\nxapiceoi(void)\n{\n  if(xapic)\n    xapicw(EOI, 0);\n}\n\n\/\/ Send IPI\nvoid\nxapic_ipi(hwid_t hwid, int ino)\n{\n  xapicw(ICRHI, hwid.num << 24);\n  xapicw(ICRLO, FIXED | DEASSERT | ino);\n  if (xapicwait() < 0)\n    panic(\"xapic_ipi: xapicwait failure\");\n}\n\nvoid\nxapic_tlbflush(hwid_t hwid)\n{\n  xapic_ipi(hwid, T_TLBFLUSH);\n}\n\nvoid\nxapic_sampconf(hwid_t hwid)\n{\n  xapic_ipi(hwid, T_SAMPCONF);\n}\n\n\/\/ Start additional processor running bootstrap code at addr.\n\/\/ See Appendix B of MultiProcessor Specification.\nvoid\nxapicstartap(hwid hwid, u32 addr)\n{\n  int i;\n\n  \/\/ \"Universal startup algorithm.\"\n  \/\/ Send INIT (level-triggered) interrupt to reset other CPU.\n  \n\n  xapicw(ICRHI, hwid.num<<24);\n  xapicw(ICRLO, INIT | LEVEL | ASSERT);\n  xapicwait();\n  microdelay(10000);\n  xapicw(ICRLO, INIT | LEVEL);\n  xapicwait();\n  microdelay(10000);    \/\/ should be 10ms, but too slow in Bochs!\n  \n  \/\/ Send startup IPI (twice!) to enter bootstrap code.\n  \/\/ Regular hardware is supposed to only accept a STARTUP\n  \/\/ when it is in the halted state due to an INIT.  So the second\n  \/\/ should be ignored, but it is part of the official Intel algorithm.\n  \/\/ Bochs complains about the second one.  Too bad for Bochs.\n  for(i = 0; i < 2; i++){\n    xapicw(ICRHI, hwid.num<<24);\n    xapicw(ICRLO, STARTUP | (addr>>12));\n    microdelay(200);\n  }\n}\n<commit_msg>xapic: More detailed init comment<commit_after>\/\/ The local APIC manages internal (non-I\/O) interrupts.\n\/\/ See Chapter 8 & Appendix C of Intel processor manual volume 3.\n\n#include \"types.h\"\n#include \"amd64.h\"\n#include \"kernel.hh\"\n#include \"traps.h\"\n#include \"bits.hh\"\n#include \"cpu.hh\"\n#include \"apic.hh\"\n\n\/\/ Local APIC registers, divided by 4 for use as uint[] indices.\n#define ID      (0x0020\/4)   \/\/ ID\n#define VER     (0x0030\/4)   \/\/ Version\n#define TPR     (0x0080\/4)   \/\/ Task Priority\n#define EOI     (0x00B0\/4)   \/\/ EOI\n#define SVR     (0x00F0\/4)   \/\/ Spurious Interrupt Vector\n  #define ENABLE     0x00000100   \/\/ Unit Enable\n#define ESR     (0x0280\/4)   \/\/ Error Status\n#define ICRLO   (0x0300\/4)   \/\/ Interrupt Command\n  #define INIT       0x00000500   \/\/ INIT\/RESET\n  #define STARTUP    0x00000600   \/\/ Startup IPI\n  #define DELIVS     0x00001000   \/\/ Delivery status\n  #define ASSERT     0x00004000   \/\/ Assert interrupt (vs deassert)\n  #define DEASSERT   0x00000000\n  #define LEVEL      0x00008000   \/\/ Level triggered\n  #define BCAST      0x00080000   \/\/ Send to all APICs, including self.\n  #define FIXED      0x00000000\n#define ICRHI   (0x0310\/4)   \/\/ Interrupt Command [63:32]\n#define TIMER   (0x0320\/4)   \/\/ Local Vector Table 0 (TIMER)\n  #define X1         0x0000000B   \/\/ divide counts by 1\n  #define PERIODIC   0x00020000   \/\/ Periodic\n#define PCINT   (0x0340\/4)   \/\/ Performance Counter LVT\n#define LINT0   (0x0350\/4)   \/\/ Local Vector Table 1 (LINT0)\n#define LINT1   (0x0360\/4)   \/\/ Local Vector Table 2 (LINT1)\n#define ERROR   (0x0370\/4)   \/\/ Local Vector Table 3 (ERROR)\n  #define MASKED     0x00010000   \/\/ Interrupt masked\n  #define MT_NMI     0x00000400   \/\/ NMI message type\n  #define MT_FIX     0x00000000   \/\/ Fixed message type\n#define TICR    (0x0380\/4)   \/\/ Timer Initial Count\n#define TCCR    (0x0390\/4)   \/\/ Timer Current Count\n#define TDCR    (0x03E0\/4)   \/\/ Timer Divide Configuration\n\n#define IO_RTC  0x70\n\nstatic volatile u32 *xapic = (u32 *)(KBASE + 0xfee00000);\nstatic u64 xapichz;\n\nstatic void\nxapicw(int index, int value)\n{\n  xapic[index] = value;\n  xapic[ID];  \/\/ wait for write to finish, by reading\n}\n\nstatic u32\nxapicr(u32 off)\n{\n  return xapic[off];\n}\n\nstatic int\nxapicwait()\n{\n  int i = 100000;\n  while ((xapicr(ICRLO) & DELIVS) != 0) {\n    nop_pause();\n    i--;\n    if (i == 0) {\n      cprintf(\"xapicwait: wedged?\\n\");\n      return -1;\n    }\n  }\n  return 0;\n}\n\nvoid\ninitxapic(void)\n{\n  u64 count;\n\n  u32 edx;\n  cpuid(CPUID_FEATURES, nullptr, nullptr, nullptr, &edx);\n  if (!(edx & FEATURE_EDX_APIC))\n    panic(\"No LAPIC\");\n\n  \/\/ Enable local APIC, do not suppress EOI broadcast, set spurious\n  \/\/ interrupt vector.\n  xapicw(SVR, ENABLE | (T_IRQ0 + IRQ_SPURIOUS));\n\n  if (xapichz == 0) {\n    \/\/ Measure the TICR frequency\n    xapicw(TDCR, X1);    \n    xapicw(TICR, 0xffffffff); \n    u64 ccr0 = xapicr(TCCR);\n    microdelay(10 * 1000);    \/\/ 1\/100th of a second\n    u64 ccr1 = xapicr(TCCR);\n    xapichz = 100 * (ccr0 - ccr1);\n  }\n\n  count = (QUANTUM*xapichz) \/ 1000;\n  if (count > 0xffffffff)\n    panic(\"initxapic: QUANTUM too large\");\n\n  \/\/ The timer repeatedly counts down at bus frequency\n  \/\/ from xapic[TICR] and then issues an interrupt.  \n  xapicw(TDCR, X1);\n  xapicw(TIMER, PERIODIC | (T_IRQ0 + IRQ_TIMER));\n  xapicw(TICR, count); \n\n  \/\/ Disable logical interrupt lines.\n  xapicw(LINT0, MASKED);\n  xapicw(LINT1, MASKED);\n\n  \/\/ Disable performance counter overflow interrupts\n  \/\/ on machines that provide that interrupt entry.\n  if(((xapic[VER]>>16) & 0xFF) >= 4)\n    xapicpc(0);\n\n  \/\/ Map error interrupt to IRQ_ERROR.\n  xapicw(ERROR, T_IRQ0 + IRQ_ERROR);\n\n  \/\/ Clear error status register (requires back-to-back writes).\n  xapicw(ESR, 0);\n  xapicw(ESR, 0);\n\n  \/\/ Ack any outstanding interrupts.\n  xapicw(EOI, 0);\n\n  \/\/ Send an Init Level De-Assert to synchronise arbitration ID's.\n  xapicw(ICRHI, 0);\n  xapicw(ICRLO, BCAST | INIT | LEVEL);\n  while(xapic[ICRLO] & DELIVS)\n    ;\n\n  \/\/ Enable interrupts on the APIC (but not on the processor).\n  xapicw(TPR, 0);\n}\n\nvoid\nxapicpc(char mask)\n{\n  xapicw(PCINT, mask ? MASKED : MT_NMI);\n}\n\nhwid_t\nxapicid(void)\n{\n  if (readrflags() & FL_IF) {\n    cli();\n    panic(\"cpunum() called from %p with interrupts enabled\\n\",\n      __builtin_return_address(0));\n  }\n\n  if (xapic == nullptr)\n    panic(\"xapicid\");\n  return HWID(xapic[ID]>>24);\n}\n\n\/\/ Acknowledge interrupt.\nvoid\nxapiceoi(void)\n{\n  if(xapic)\n    xapicw(EOI, 0);\n}\n\n\/\/ Send IPI\nvoid\nxapic_ipi(hwid_t hwid, int ino)\n{\n  xapicw(ICRHI, hwid.num << 24);\n  xapicw(ICRLO, FIXED | DEASSERT | ino);\n  if (xapicwait() < 0)\n    panic(\"xapic_ipi: xapicwait failure\");\n}\n\nvoid\nxapic_tlbflush(hwid_t hwid)\n{\n  xapic_ipi(hwid, T_TLBFLUSH);\n}\n\nvoid\nxapic_sampconf(hwid_t hwid)\n{\n  xapic_ipi(hwid, T_SAMPCONF);\n}\n\n\/\/ Start additional processor running bootstrap code at addr.\n\/\/ See Appendix B of MultiProcessor Specification.\nvoid\nxapicstartap(hwid hwid, u32 addr)\n{\n  int i;\n\n  \/\/ \"Universal startup algorithm.\"\n  \/\/ Send INIT (level-triggered) interrupt to reset other CPU.\n  \n\n  xapicw(ICRHI, hwid.num<<24);\n  xapicw(ICRLO, INIT | LEVEL | ASSERT);\n  xapicwait();\n  microdelay(10000);\n  xapicw(ICRLO, INIT | LEVEL);\n  xapicwait();\n  microdelay(10000);    \/\/ should be 10ms, but too slow in Bochs!\n  \n  \/\/ Send startup IPI (twice!) to enter bootstrap code.\n  \/\/ Regular hardware is supposed to only accept a STARTUP\n  \/\/ when it is in the halted state due to an INIT.  So the second\n  \/\/ should be ignored, but it is part of the official Intel algorithm.\n  \/\/ Bochs complains about the second one.  Too bad for Bochs.\n  for(i = 0; i < 2; i++){\n    xapicw(ICRHI, hwid.num<<24);\n    xapicw(ICRLO, STARTUP | (addr>>12));\n    microdelay(200);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\tsrc\/DemoModuleForwarder.cpp\n * @date\tMar 2016\n * @author\tPhRG - opticalp.fr\n *\/\n\n\/*\n Copyright (c) 2016 Ph. Renaud-Goud \/ Opticalp\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 \"DemoModuleForwarder.h\"\n\n#include \"DataAttributeIn.h\"\n#include \"DataAttribute.h\"\n\n#include \"InDataPort.h\"\n#include \"OutPort.h\"\n\n#include \"Poco\/NumberFormatter.h\"\n\nsize_t DemoModuleForwarder::refCount = 0;\n\nDemoModuleForwarder::DemoModuleForwarder(ModuleFactory* parent, std::string customName):\n        Module(parent, customName)\n{\n    \/\/ poco_information(logger(),\"Creating a new DemoModuleForwarder\");\n\n    setInternalName(\"DemoModuleForwarder\" + Poco::NumberFormatter::format(refCount));\n    setCustomName(customName);\n    setLogger(\"module.\" + name());\n\n    \/\/ ports\n    setInPortCount(inPortCnt);\n    setOutPortCount(outPortCnt);\n\n    addInPort(\"inPortA\", \"data in\", DataItem::typeInteger, inPortA);\n\n    addOutPort(\"outPortA\", \"forwarded data as is\", DataItem::typeInteger, outPortA);\n\n    notifyCreation();\n\n    \/\/ if nothing failed\n    refCount++;\n}\n\nvoid DemoModuleForwarder::process(int startCond)\n{\n\tif (startCond != allDataStartState)\n\t{\n\t\tpoco_information(logger(), name() + \": no input data. Exiting. \");\n\t\treturn;\n\t}\n\telse\n\t{\n\t\tpoco_information(logger(),\"Input data locked\");\n\t}\n\n    DataAttributeIn attr;\n    int* pData;\n\n\treadLockInPort(inPortA);\n    readInPortData<int>(inPortA, pData);\n    readInPortDataAttribute(inPortA, &attr);\n\n    DataAttributeOut outAttr = attr;\n\n    int tmpData;\n\n\/\/    \/\/ buffered mode\n\/\/    tmpData = *pData;\n\/\/    releaseInPort(inPortA);\n\n    reserveOutPort(outPortA);\n\n    int* pOutData;\n    getDataToWrite<int>(outPortA, pOutData);\n\n\/\/    \/\/ buffered mode\n\/\/  \t*pOutData = tmpData;\n\/\/    else\n\n    *pOutData = *pData;\n\n    \/\/ not mandatory\n    releaseInPort(inPortA);\n\n    notifyOutPortReady(outPortA, outAttr);\n\n    poco_information(logger(), \"DemoModuleForwarder::runTask(): \"\n            + Poco::NumberFormatter::format(tmpData) + \" was forwarded.\");\n}\n<commit_msg>Remove un-initialized variable<commit_after>\/**\n * @file\tsrc\/DemoModuleForwarder.cpp\n * @date\tMar 2016\n * @author\tPhRG - opticalp.fr\n *\/\n\n\/*\n Copyright (c) 2016 Ph. Renaud-Goud \/ Opticalp\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 \"DemoModuleForwarder.h\"\n\n#include \"DataAttributeIn.h\"\n#include \"DataAttribute.h\"\n\n#include \"InDataPort.h\"\n#include \"OutPort.h\"\n\n#include \"Poco\/NumberFormatter.h\"\n\nsize_t DemoModuleForwarder::refCount = 0;\n\nDemoModuleForwarder::DemoModuleForwarder(ModuleFactory* parent, std::string customName):\n        Module(parent, customName)\n{\n    \/\/ poco_information(logger(),\"Creating a new DemoModuleForwarder\");\n\n    setInternalName(\"DemoModuleForwarder\" + Poco::NumberFormatter::format(refCount));\n    setCustomName(customName);\n    setLogger(\"module.\" + name());\n\n    \/\/ ports\n    setInPortCount(inPortCnt);\n    setOutPortCount(outPortCnt);\n\n    addInPort(\"inPortA\", \"data in\", DataItem::typeInteger, inPortA);\n\n    addOutPort(\"outPortA\", \"forwarded data as is\", DataItem::typeInteger, outPortA);\n\n    notifyCreation();\n\n    \/\/ if nothing failed\n    refCount++;\n}\n\nvoid DemoModuleForwarder::process(int startCond)\n{\n\tif (startCond != allDataStartState)\n\t{\n\t\tpoco_information(logger(), name() + \": no input data. Exiting. \");\n\t\treturn;\n\t}\n\telse\n\t{\n\t\tpoco_information(logger(),\"Input data locked\");\n\t}\n\n    DataAttributeIn attr;\n    int* pData;\n\n\treadLockInPort(inPortA);\n    readInPortData<int>(inPortA, pData);\n    readInPortDataAttribute(inPortA, &attr);\n\n    DataAttributeOut outAttr = attr;\n\n    int tmpData; \/\/ for verbosity purpose\n\n\/\/    \/\/ buffered mode\n    tmpData = *pData;\n\/\/    releaseInPort(inPortA);\n\n    reserveOutPort(outPortA);\n\n    int* pOutData;\n    getDataToWrite<int>(outPortA, pOutData);\n\n\/\/    \/\/ buffered mode\n\/\/  \t*pOutData = tmpData;\n\/\/    else\n\n    *pOutData = *pData;\n\n    \/\/ not mandatory\n    releaseInPort(inPortA);\n\n    notifyOutPortReady(outPortA, outAttr);\n\n    poco_information(logger(), \"DemoModuleForwarder::runTask(): \"\n            + Poco::NumberFormatter::format(tmpData) + \" was forwarded.\");\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <X11\/Xlib.h>\n#include <X11\/keysym.h>\n#include <irrlicht\/Keycodes.h>\n#include <stdio.h>\n#include <unistd.h>\n\n#define RETURN 13\n#define BS 8\n#define SPACE 32\n\nXKeyEvent createKeyEvent(Display *display,\n                         Window &win,\n                         Window &winRoot,\n                         bool press,\n                         int keycode,\n                         int modifiers)\n{\n  \/\/ Largely lifted from\n  \/\/ http:\/\/www.doctort.org\/adam\/nerd-notes\/x11-fake-keypress-event.html\n  XKeyEvent event;\n  event.display = display;\n  event.window = win;\n  event.root = winRoot;\n  event.subwindow = None;\n  event.time = CurrentTime;\n  event.x = 1;\n  event.y = 1;\n  event.x_root = 1;\n  event.y_root = 1;\n  event.same_screen = True;\n  event.keycode = XKeysymToKeycode(display, keycode);\n  event.state = modifiers;\n\n  if(press)\n    event.type = KeyPress;\n  else\n    event.type = KeyRelease;\n\n  return event;\n}\n\nclass X11Display {\n  public:\n    Display *display;\n    X11Display(const char* dispName);\n    ~X11Display();\n};\n\nX11Display::X11Display(const char* dispName) :\n  display(XOpenDisplay(dispName)){}\n\nX11Display::~X11Display() { XCloseDisplay(display); }\n\nint mapKeyCode(int irrcode){\n  switch(irrcode){\n    \/\/FIXME: only to get rid of arrow spam\n    case 37 ... 40:\n      return -1;\n    case irr::KEY_BACK :\n      return XK_BackSpace;\n    case irr::KEY_TAB :\n      return XK_Tab;\n    case irr::KEY_RETURN :\n      return XK_Return;\n    case irr::KEY_MINUS :\n      return XK_minus;\n    case irr::KEY_OEM_7 :\n      return XK_apostrophe;\n    default:\n      return irrcode;\n  }\n}\n\nint sendKeyEvent(const char* disp, int keycode)\n{\n  if(-1==keycode)\n    return 0;\n  printf(\"sendKeyEvent keycode: %d\\n\", keycode);\n  Window winFocus;\n  int revert;\n\n  X11Display X11Display(disp);\n\n  Display *display = XOpenDisplay(disp);\n  if(NULL == display)\n    return -1;\n  Window winRoot = XDefaultRootWindow(display);\n  \/\/XSetInputFocus(display, 1, revert, CurrentTime);\n  XGetInputFocus(display, &winFocus, &revert);\n  XKeyEvent event = createKeyEvent(display, winFocus, winRoot, true, keycode, 0);\n  XSendEvent(event.display, event.window, True, KeyPressMask, (XEvent*)&event);\n  event = createKeyEvent(display, winFocus, winRoot, false, keycode, 0);\n  XSendEvent(event.display, event.window, True, KeyPressMask, (XEvent*)&event);\n  XCloseDisplay(display);\n  return 0;\n}\n<commit_msg>Works using object<commit_after>#include <X11\/Xlib.h>\n#include <X11\/keysym.h>\n#include <irrlicht\/Keycodes.h>\n#include <stdio.h>\n#include <unistd.h>\n\n#define RETURN 13\n#define BS 8\n#define SPACE 32\n\nXKeyEvent createKeyEvent(Display *display,\n                         Window &win,\n                         Window &winRoot,\n                         bool press,\n                         int keycode,\n                         int modifiers)\n{\n  \/\/ Largely lifted from\n  \/\/ http:\/\/www.doctort.org\/adam\/nerd-notes\/x11-fake-keypress-event.html\n  XKeyEvent event;\n  event.display = display;\n  event.window = win;\n  event.root = winRoot;\n  event.subwindow = None;\n  event.time = CurrentTime;\n  event.x = 1;\n  event.y = 1;\n  event.x_root = 1;\n  event.y_root = 1;\n  event.same_screen = True;\n  event.keycode = XKeysymToKeycode(display, keycode);\n  event.state = modifiers;\n\n  if(press)\n    event.type = KeyPress;\n  else\n    event.type = KeyRelease;\n\n  return event;\n}\n\nclass X11Display {\n  public:\n    Display *display;\n    X11Display(const char* dispName);\n    ~X11Display();\n};\n\nX11Display::X11Display(const char* dispName) :\n  display(XOpenDisplay(dispName)){}\n\nX11Display::~X11Display() { XCloseDisplay(display); }\n\nint mapKeyCode(int irrcode){\n  switch(irrcode){\n    \/\/FIXME: only to get rid of arrow spam\n    case 37 ... 40:\n      return -1;\n    case irr::KEY_BACK :\n      return XK_BackSpace;\n    case irr::KEY_TAB :\n      return XK_Tab;\n    case irr::KEY_RETURN :\n      return XK_Return;\n    case irr::KEY_MINUS :\n      return XK_minus;\n    case irr::KEY_OEM_7 :\n      return XK_apostrophe;\n    default:\n      return irrcode;\n  }\n}\n\nint sendKeyEvent(const char* disp, int keycode)\n{\n  if(-1==keycode)\n    return 0;\n  printf(\"sendKeyEvent keycode: %d\\n\", keycode);\n  Window winFocus;\n  int revert;\n\n  X11Display xdisp(disp);\n\n  \/\/Display *display = XOpenDisplay(disp);\n  \/\/if(NULL == display)\n  \/\/  return -1;\n  Window winRoot = XDefaultRootWindow(xdisp.display);\n  \/\/XSetInputFocus(display, 1, revert, CurrentTime);\n  XGetInputFocus(xdisp.display, &winFocus, &revert);\n  XKeyEvent event = createKeyEvent(xdisp.display, winFocus, winRoot, true, keycode, 0);\n  XSendEvent(event.display, event.window, True, KeyPressMask, (XEvent*)&event);\n  event = createKeyEvent(xdisp.display, winFocus, winRoot, false, keycode, 0);\n  XSendEvent(event.display, event.window, True, KeyPressMask, (XEvent*)&event);\n  \/\/XCloseDisplay(display);\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Website:\n *      https:\/\/github.com\/wo3kie\/dojo\n *\n * Author:\n *      Lukasz Czerwinski\n *\n * Compilation:\n *      g++ --std=c++11 generateAllSubsets.cpp -o generateAllSubsets\n *\n * Usage:\n *      $ .\/generateAllSubsets\n *\/\n\n#include <cassert>\n#include <iostream>\n#include <set>\n#include <vector>\n\nstd::set<std::set<int>> getAllSubsetsImpl(\n    std::set<std::set<int>> & sets1,\n    std::set<int> set\n){\n    if(set.empty()){\n        return sets1;\n    }\n\n    int item = * set.begin();\n    set.erase(set.begin());\n\n    std::set<std::set<int>> sets2;\n\n    for(std::set<int> s : sets1){\n        s.insert(item);\n        sets2.insert(s);\n    }\n\n    std::set<std::set<int>> subsets1 = getAllSubsetsImpl(sets1, set);\n    std::set<std::set<int>> subsets2 = getAllSubsetsImpl(sets2, set);\n\n    subsets1.insert(\n        subsets2.begin(),\n        subsets2.end()\n    );\n\n    return subsets1;\n}\n\nstd::set<std::set<int>> getAllSubsets(std::set<int> const & set){\n    std::set<std::set<int>> sets;\n    sets.insert(std::set<int>());\n    return getAllSubsetsImpl(sets, set);\n}\n\nint main()\n{\n    std::set<std::set<int>> actual = getAllSubsets(std::set<int>{ 1, 2, 3 });\n\n    std::set<std::set<int>> expected = std::set<std::set<int>>{\n        std::set<int>(), \n        {1}, {2}, {3}, \n        {1, 2}, {1, 3}, {2, 3}, \n        {1, 2, 3}\n    };\n\n    assert(actual == expected);\n}\n\n<commit_msg>generateAllSubsets<commit_after>\/*\n * Website:\n *      https:\/\/github.com\/wo3kie\/dojo\n *\n * Author:\n *      Lukasz Czerwinski\n *\n * Compilation:\n *      g++ --std=c++11 generateAllSubsets.cpp -o generateAllSubsets\n *\n * Usage:\n *      $ .\/generateAllSubsets\n *\/\n\n#include <cassert>\n#include <iostream>\n#include <set>\n#include <vector>\n\n#include \".\/output.hpp\"\n\nstd::set<std::set<int>> getAllSubsets(\n    std::set<int> set\n){\n    std::set<std::set<int>> result;\n    result.insert(std::set<int>());\n\n    if(set.size() == 0){\n        return result;\n    }\n\n    int item = * set.begin();\n    set.erase(set.begin());\n    std::set<std::set<int>> subsets = getAllSubsets(set);\n\n    for(std::set<int> subset : subsets){\n        result.insert(subset);\n        subset.insert(item);\n        result.insert(subset);\n    }\n\n    return result;\n}\n\nint main()\n{\n    std::set<std::set<int>> actual = getAllSubsets(std::set<int>{ 1, 2, 3 });\n\n    std::set<std::set<int>> expected = std::set<std::set<int>>{\n        std::set<int>(), \n        {1}, {2}, {3}, \n        {1, 2}, {1, 3}, {2, 3}, \n        {1, 2, 3}\n    };\n\n    assert(actual == expected);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014, Yahoo! Inc.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ Some portions of this file:\n\/\/ 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 \"base\/metrics\/statistics_recorder.h\"\n#include \"base\/run_loop.h\"\n#include \"base\/test\/launcher\/unit_test_launcher.h\"\n#include \"net\/http\/http_response_headers.h\"\n#include \"net\/socket\/client_socket_pool_base.h\"\n#include \"net\/socket\/ssl_server_socket.h\"\n#include \"net\/test\/net_test_suite.h\"\n#include \"net\/test\/spawned_test_server\/spawned_test_server.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"testing\/platform_test.h\"\n#include \"yahoo\/cnet\/cnet.h\"\n#include \"yahoo\/cnet\/cnet_fetcher.h\"\n#include \"yahoo\/cnet\/cnet_pool.h\"\n#include \"yahoo\/cnet\/cnet_response.h\"\n\nusing net::internal::ClientSocketPoolBaseHelper;\n\n\/\/ Copied from url_request_unittest.cc\nclass LocalHttpTestServer : public net::SpawnedTestServer {\n public:\n  explicit LocalHttpTestServer(const base::FilePath& document_root)\n      : net::SpawnedTestServer(net::SpawnedTestServer::TYPE_HTTPS,\n            \"127.0.0.1\", document_root) {}\n  LocalHttpTestServer()\n      : net::SpawnedTestServer(net::SpawnedTestServer::TYPE_HTTPS,\n            \"127.0.0.1\", base::FilePath()) {}\n};\n\nclass PoolTest : public PlatformTest {\n public:\n  PoolTest()\n      : quit_event_(false, false) {\n    base::Thread::Options options;\n    options.message_loop_type = base::MessageLoop::TYPE_UI;\n    ui_thread_ = new base::Thread(\"cnet-ui\");\n    ui_thread_->StartWithOptions(options);\n\n    cnet::Pool::Config config;\n    config.user_agent = \"cnet-unittest\";\n    pool_ = new cnet::Pool(ui_thread_->task_runner(), config);\n  }\n\n  virtual ~PoolTest() { }\n\n  virtual void TearDown() override {\n    StartDelete();\n    quit_event_.Wait();\n    ui_thread_->Stop();\n  }\n\n protected:\n  void StartDelete() {\n    if (!pool_->GetNetworkTaskRunner()->RunsTasksOnCurrentThread()) {\n      pool_->GetNetworkTaskRunner()->PostTask(FROM_HERE,\n         base::Bind(&PoolTest::StartDelete, base::Unretained(this)));\n      return;\n    }\n\n    \/\/ This should post a task to the UI thread to delete the pool's threads.\n    \/\/ We want to do this from the network thread so that we know that\n    \/\/ it will post a task to the UI thread before us.\n    \/\/ This works only if the retain count is currently 1.\n    pool_ = NULL;\n\n    \/\/ Now we post a task to the UI thread to follow the cleanup of the pool.\n    ui_thread_->message_loop()->PostTask(FROM_HERE,\n        base::Bind(&PoolTest::OnPoolDeleted, base::Unretained(this)));\n  }\n\n  void OnPoolDeleted() {\n    ASSERT_TRUE(ui_thread_->task_runner()->RunsTasksOnCurrentThread());\n    quit_event_.Signal();\n  }\n\n  base::Thread* ui_thread_;\n  base::WaitableEvent quit_event_;\n  scoped_refptr<cnet::Pool> pool_;\n};\n\nTEST_F(PoolTest, InitShutdown) {\n}\n\n\nclass FetcherTest : public PoolTest {\n public:\n  FetcherTest()\n      : completed_event_(false, false),\n        test_server_(base::FilePath(FILE_PATH_LITERAL(\n            \"yahoo\/cnet\/data\/cnet_unittest\"))),\n        download_progress_(0), upload_progress_(0) {\n  }\n \n  void OnFetcherCompleted(scoped_refptr<cnet::Fetcher> fetcher,\n      scoped_refptr<cnet::Response> response) {\n    \/\/ On work thread.\n    response_ = response;\n    completed_event_.Signal();\n  }\n\n  void OnFetcherDownloadProgress(scoped_refptr<cnet::Fetcher> fetcher,\n      int64_t current, int64_t total) {\n    \/\/ On work thread.\n    download_progress_ = current;\n  }\n  \n  void OnFetcherUploadProgress(scoped_refptr<cnet::Fetcher> fetcher,\n      int64_t current, int64_t total) {\n    \/\/ On work thread.\n    upload_progress_ = current;\n  }\n\n protected:\n  scoped_refptr<cnet::Response> WaitForCompletion() {\n    completed_event_.Wait();\n    return response_;\n  }\n\n  base::WaitableEvent completed_event_;\n  LocalHttpTestServer test_server_;\n  scoped_refptr<cnet::Response> response_;\n  int64 download_progress_;\n  int64 upload_progress_;\n};\n\nTEST_F(FetcherTest, SimpleFetch) {\n  ASSERT_TRUE(test_server_.Start());\n\n  std::string url(test_server_.GetURL(\"files\/hello.html\").spec());\n  scoped_refptr<cnet::Fetcher> fetcher(new cnet::Fetcher(\n      pool_, url, \"GET\",\n      base::Bind(&FetcherTest::OnFetcherCompleted, base::Unretained(this)),\n      base::Bind(&FetcherTest::OnFetcherDownloadProgress,\n          base::Unretained(this)),\n      base::Bind(&FetcherTest::OnFetcherUploadProgress,\n          base::Unretained(this))));\n  fetcher->Start();\n\n  scoped_refptr<cnet::Response> response = WaitForCompletion();\n  ASSERT_EQ(response->status().status(), net::URLRequestStatus::SUCCESS);\n  ASSERT_EQ(response->http_response_code(), 200);\n  EXPECT_EQ(response->initial_url(), url);\n  EXPECT_EQ(response->original_url(), GURL(url));\n  EXPECT_EQ(response->final_url(), GURL(url));\n\n  scoped_refptr<net::HttpResponseHeaders> response_headers(\n      response->response_headers());\n  EXPECT_TRUE(response_headers->HasHeaderValue(\"Content-Type\", \"text\/html\"));\n\n  std::string expected_body(\"Hello!\\n\\n\");\n  ASSERT_EQ((int)expected_body.length(), response->response_length());\n  std::string response_body(response->response_body(),\n      response->response_length());\n  ASSERT_EQ(expected_body, response_body);\n\n  EXPECT_EQ(upload_progress_, 0);\n  EXPECT_EQ(download_progress_, response->response_length());\n}\n\nTEST_F(FetcherTest, FetchError) {\n  ASSERT_TRUE(test_server_.Start());\n\n  std::string url(test_server_.GetURL(\"close-socket\").spec());\n  scoped_refptr<cnet::Fetcher> fetcher(new cnet::Fetcher(\n      pool_, url, \"GET\",\n      base::Bind(&FetcherTest::OnFetcherCompleted, base::Unretained(this)),\n      base::Bind(&FetcherTest::OnFetcherDownloadProgress,\n          base::Unretained(this)),\n      base::Bind(&FetcherTest::OnFetcherUploadProgress,\n          base::Unretained(this))));\n  fetcher->Start();\n\n  scoped_refptr<cnet::Response> response = WaitForCompletion();\n  ASSERT_NE(response->status().status(), net::URLRequestStatus::SUCCESS);\n  ASSERT_EQ(response->status().status(), net::URLRequestStatus::FAILED);\n  ASSERT_EQ(response->http_response_code(), -1);\n}\n\nint main(int argc, char** argv) {\n  base::StatisticsRecorder::Initialize();\n\n  NetTestSuite test_suite(argc, argv);\n  ClientSocketPoolBaseHelper::set_connect_backup_jobs_enabled(false);\n\n#if defined(OS_WIN)\n  \/\/ We want to be sure to init NSPR on the main thread.\n  crypto::EnsureNSPRInit();\n#endif\n\n  \/\/ Enable support for SSL server sockets, which must be done while\n  \/\/ single-threaded.\n  net::EnableSSLServerSockets();\n\n  return base::LaunchUnitTests(argc, argv,\n      base::Bind(&NetTestSuite::Run, base::Unretained(&test_suite)));\n}\n<commit_msg>Added links to test documentation.<commit_after>\/\/ Copyright 2014, Yahoo! Inc.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ Some portions of this file:\n\/\/ 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\/\/ Testing documentation:\n\/\/   https:\/\/code.google.com\/p\/googletest\/wiki\/Primer\n\/\/   https:\/\/www.chromium.org\/developers\/testing\n\n#include \"base\/metrics\/statistics_recorder.h\"\n#include \"base\/run_loop.h\"\n#include \"base\/test\/launcher\/unit_test_launcher.h\"\n#include \"net\/http\/http_response_headers.h\"\n#include \"net\/socket\/client_socket_pool_base.h\"\n#include \"net\/socket\/ssl_server_socket.h\"\n#include \"net\/test\/net_test_suite.h\"\n#include \"net\/test\/spawned_test_server\/spawned_test_server.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"testing\/platform_test.h\"\n#include \"yahoo\/cnet\/cnet.h\"\n#include \"yahoo\/cnet\/cnet_fetcher.h\"\n#include \"yahoo\/cnet\/cnet_pool.h\"\n#include \"yahoo\/cnet\/cnet_response.h\"\n\nusing net::internal::ClientSocketPoolBaseHelper;\n\n\/\/ Copied from url_request_unittest.cc\nclass LocalHttpTestServer : public net::SpawnedTestServer {\n public:\n  explicit LocalHttpTestServer(const base::FilePath& document_root)\n      : net::SpawnedTestServer(net::SpawnedTestServer::TYPE_HTTPS,\n            \"127.0.0.1\", document_root) {}\n  LocalHttpTestServer()\n      : net::SpawnedTestServer(net::SpawnedTestServer::TYPE_HTTPS,\n            \"127.0.0.1\", base::FilePath()) {}\n};\n\nclass PoolTest : public PlatformTest {\n public:\n  PoolTest()\n      : quit_event_(false, false) {\n    base::Thread::Options options;\n    options.message_loop_type = base::MessageLoop::TYPE_UI;\n    ui_thread_ = new base::Thread(\"cnet-ui\");\n    ui_thread_->StartWithOptions(options);\n\n    cnet::Pool::Config config;\n    config.user_agent = \"cnet-unittest\";\n    pool_ = new cnet::Pool(ui_thread_->task_runner(), config);\n  }\n\n  virtual ~PoolTest() { }\n\n  virtual void TearDown() override {\n    StartDelete();\n    quit_event_.Wait();\n    ui_thread_->Stop();\n  }\n\n protected:\n  void StartDelete() {\n    if (!pool_->GetNetworkTaskRunner()->RunsTasksOnCurrentThread()) {\n      pool_->GetNetworkTaskRunner()->PostTask(FROM_HERE,\n         base::Bind(&PoolTest::StartDelete, base::Unretained(this)));\n      return;\n    }\n\n    \/\/ This should post a task to the UI thread to delete the pool's threads.\n    \/\/ We want to do this from the network thread so that we know that\n    \/\/ it will post a task to the UI thread before us.\n    \/\/ This works only if the retain count is currently 1.\n    pool_ = NULL;\n\n    \/\/ Now we post a task to the UI thread to follow the cleanup of the pool.\n    ui_thread_->message_loop()->PostTask(FROM_HERE,\n        base::Bind(&PoolTest::OnPoolDeleted, base::Unretained(this)));\n  }\n\n  void OnPoolDeleted() {\n    ASSERT_TRUE(ui_thread_->task_runner()->RunsTasksOnCurrentThread());\n    quit_event_.Signal();\n  }\n\n  base::Thread* ui_thread_;\n  base::WaitableEvent quit_event_;\n  scoped_refptr<cnet::Pool> pool_;\n};\n\nTEST_F(PoolTest, InitShutdown) {\n}\n\n\nclass FetcherTest : public PoolTest {\n public:\n  FetcherTest()\n      : completed_event_(false, false),\n        test_server_(base::FilePath(FILE_PATH_LITERAL(\n            \"yahoo\/cnet\/data\/cnet_unittest\"))),\n        download_progress_(0), upload_progress_(0) {\n  }\n \n  void OnFetcherCompleted(scoped_refptr<cnet::Fetcher> fetcher,\n      scoped_refptr<cnet::Response> response) {\n    \/\/ On work thread.\n    response_ = response;\n    completed_event_.Signal();\n  }\n\n  void OnFetcherDownloadProgress(scoped_refptr<cnet::Fetcher> fetcher,\n      int64_t current, int64_t total) {\n    \/\/ On work thread.\n    download_progress_ = current;\n  }\n  \n  void OnFetcherUploadProgress(scoped_refptr<cnet::Fetcher> fetcher,\n      int64_t current, int64_t total) {\n    \/\/ On work thread.\n    upload_progress_ = current;\n  }\n\n protected:\n  scoped_refptr<cnet::Response> WaitForCompletion() {\n    completed_event_.Wait();\n    return response_;\n  }\n\n  base::WaitableEvent completed_event_;\n  LocalHttpTestServer test_server_;\n  scoped_refptr<cnet::Response> response_;\n  int64 download_progress_;\n  int64 upload_progress_;\n};\n\nTEST_F(FetcherTest, SimpleFetch) {\n  ASSERT_TRUE(test_server_.Start());\n\n  std::string url(test_server_.GetURL(\"files\/hello.html\").spec());\n  scoped_refptr<cnet::Fetcher> fetcher(new cnet::Fetcher(\n      pool_, url, \"GET\",\n      base::Bind(&FetcherTest::OnFetcherCompleted, base::Unretained(this)),\n      base::Bind(&FetcherTest::OnFetcherDownloadProgress,\n          base::Unretained(this)),\n      base::Bind(&FetcherTest::OnFetcherUploadProgress,\n          base::Unretained(this))));\n  fetcher->Start();\n\n  scoped_refptr<cnet::Response> response = WaitForCompletion();\n  ASSERT_EQ(response->status().status(), net::URLRequestStatus::SUCCESS);\n  ASSERT_EQ(response->http_response_code(), 200);\n  EXPECT_EQ(response->initial_url(), url);\n  EXPECT_EQ(response->original_url(), GURL(url));\n  EXPECT_EQ(response->final_url(), GURL(url));\n\n  scoped_refptr<net::HttpResponseHeaders> response_headers(\n      response->response_headers());\n  EXPECT_TRUE(response_headers->HasHeaderValue(\"Content-Type\", \"text\/html\"));\n\n  std::string expected_body(\"Hello!\\n\\n\");\n  ASSERT_EQ((int)expected_body.length(), response->response_length());\n  std::string response_body(response->response_body(),\n      response->response_length());\n  ASSERT_EQ(expected_body, response_body);\n\n  EXPECT_EQ(upload_progress_, 0);\n  EXPECT_EQ(download_progress_, response->response_length());\n}\n\nTEST_F(FetcherTest, FetchError) {\n  ASSERT_TRUE(test_server_.Start());\n\n  std::string url(test_server_.GetURL(\"close-socket\").spec());\n  scoped_refptr<cnet::Fetcher> fetcher(new cnet::Fetcher(\n      pool_, url, \"GET\",\n      base::Bind(&FetcherTest::OnFetcherCompleted, base::Unretained(this)),\n      base::Bind(&FetcherTest::OnFetcherDownloadProgress,\n          base::Unretained(this)),\n      base::Bind(&FetcherTest::OnFetcherUploadProgress,\n          base::Unretained(this))));\n  fetcher->Start();\n\n  scoped_refptr<cnet::Response> response = WaitForCompletion();\n  ASSERT_NE(response->status().status(), net::URLRequestStatus::SUCCESS);\n  ASSERT_EQ(response->status().status(), net::URLRequestStatus::FAILED);\n  ASSERT_EQ(response->http_response_code(), -1);\n}\n\nint main(int argc, char** argv) {\n  base::StatisticsRecorder::Initialize();\n\n  NetTestSuite test_suite(argc, argv);\n  ClientSocketPoolBaseHelper::set_connect_backup_jobs_enabled(false);\n\n#if defined(OS_WIN)\n  \/\/ We want to be sure to init NSPR on the main thread.\n  crypto::EnsureNSPRInit();\n#endif\n\n  \/\/ Enable support for SSL server sockets, which must be done while\n  \/\/ single-threaded.\n  net::EnableSSLServerSockets();\n\n  return base::LaunchUnitTests(argc, argv,\n      base::Bind(&NetTestSuite::Run, base::Unretained(&test_suite)));\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CWRAPPER_HPP_INCLUDED\n#define CWRAPPER_HPP_INCLUDED\n\n\n#define HAS_STATIC_MEMBER_DETECTOR(member)                                  \\\ntemplate<typename T>                                                        \\\nclass HAS_STATIC_MEMBER_DETECTOR_CLASS_ ## member                           \\\n{                                                                           \\\n    struct two_ints_type { int two_ints_1, two_ints_2; };                   \\\n    template<typename U>                                                    \\\n    static two_ints_type has_func_helper(...) { }                           \\\n    template<typename U>                                                    \\\n    static int has_func_helper(int, decltype(U::member)* func = nullptr)    \\\n    { return 0; }                                                           \\\npublic:                                                                     \\\n    static constexpr bool value =                                           \\\n        sizeof(decltype(has_func_helper<T>(0))) == sizeof(int);             \\\n}\n\n#define HAS_STATIC_MEMBER(type, member)                                     \\\n    (HAS_STATIC_MEMBER_DETECTOR_CLASS_ ## member<type>::value)\n\n#define HAS_NESTED_TYPE_DETECTOR(member)                                    \\\ntemplate<typename T>                                                        \\\nclass HAS_NESTED_TYPE_DETECTOR_CLASS_ ## member                             \\\n{                                                                           \\\n    struct two_ints_type { int two_ints_1, two_ints_2; };                   \\\n    template<typename U>                                                    \\\n    static two_ints_type has_func_helper(...) { }                           \\\n    template<typename U>                                                    \\\n    static int has_func_helper(int, typename U::member* ty = nullptr)       \\\n    { return 0; }                                                           \\\npublic:                                                                     \\\n    static constexpr bool value =                                           \\\n        sizeof(decltype(has_func_helper<T>(0))) == sizeof(int);             \\\n}\n\n#define HAS_NESTED_TYPE(type, member)                                       \\\n    (HAS_NESTED_TYPE_DETECTOR_CLASS_ ## member<type>::value)\n\n\nenum class CWrapperType\n{\n    Implicit,\n    Explicit,\n    Get,\n};\n\ntemplate<\n    typename H,\n    typename F,\n    CWrapperType TY,\n    bool C>\nclass __CWrapperHelper__\n{\n\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    bool CONSTSAFE>\nstruct ArrowHandler\n{ };\n\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ArrowHandler<PTR_T*, BASE, false>\n{\n    PTR_T* operator->() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\n\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ArrowHandler<PTR_T*, BASE, true>\n{\n    PTR_T* operator->()\n    {   return static_cast<BASE*>(this)->ptr; }\n    PTR_T const* operator->() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\n\n\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    CWrapperType TYPE,\n    bool CONSTSAFE>\nstruct ConversionHandler : public ArrowHandler<HANDLE_T, BASE, CONSTSAFE>\n{ };\n\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    bool CONSTSAFE>\nstruct ConversionHandler<HANDLE_T, BASE, CWrapperType::Implicit, CONSTSAFE>\n    : public ArrowHandler<HANDLE_T, BASE, CONSTSAFE>\n{\n    operator HANDLE_T() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    bool CONSTSAFE>\nstruct ConversionHandler<HANDLE_T, BASE, CWrapperType::Explicit, CONSTSAFE>\n    : public ArrowHandler<HANDLE_T, BASE, CONSTSAFE>\n{\n    explicit operator HANDLE_T() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    bool CONSTSAFE>\nstruct ConversionHandler<HANDLE_T, BASE, CWrapperType::Get, CONSTSAFE>\n    : public ArrowHandler<HANDLE_T, BASE, CONSTSAFE>\n{\n    HANDLE_T get() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\n\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ConversionHandler<PTR_T*, BASE, CWrapperType::Implicit, true>\n    : public ArrowHandler<PTR_T*, BASE, true>\n{\n    operator PTR_T*()\n    {   return static_cast<BASE*>(this)->ptr; }\n    operator PTR_T const*() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ConversionHandler<PTR_T*, BASE, CWrapperType::Explicit, true>\n    : public ArrowHandler<PTR_T*, BASE, true>\n{\n    explicit operator PTR_T*()\n    {   return static_cast<BASE*>(this)->ptr; }\n    explicit operator PTR_T const*() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ConversionHandler<PTR_T*, BASE, CWrapperType::Get, true>\n    : public ArrowHandler<PTR_T*, BASE, true>\n{\n    PTR_T* get()\n    {   return static_cast<BASE*>(this)->ptr; }\n    PTR_T const* get() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\n\ntemplate<\n    typename HANDLE_T,\n    typename FUNCTIONS,\n    CWrapperType TYPE,\n    bool CONSTSAFE,\n    typename EXCEPTION_T,\n    typename INVALID_T>\nclass CWrapperBase\n    : public ConversionHandler<\n        HANDLE_T,\n        CWrapperBase<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE, EXCEPTION_T, INVALID_T>,\n        TYPE,\n        CONSTSAFE>\n{\n    friend class ConversionHandler<\n        HANDLE_T,\n        CWrapperBase<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE, EXCEPTION_T, INVALID_T>,\n        TYPE,\n        CONSTSAFE>;\nprotected:\n    HANDLE_T ptr;\n\npublic:\n\n    explicit CWrapperBase(HANDLE_T ptr) :\n        ptr{ptr}\n    {\n        if(ptr == INVALID_T::invalid_value)\n            throw EXCEPTION_T{};\n    }\n\n    CWrapperBase(CWrapperBase const& other) :\n        CWrapperBase{FUNCTIONS::copy_func(other.ptr)}\n    { }\n\n    \/\/ This one is needed to prevent variadic ctor to be called\n    \/\/ when you want to copy a non-const object.\n    CWrapperBase(CWrapperBase& other) :\n        CWrapperBase{FUNCTIONS::copy_func(other.ptr)}\n    { }\n\n    template<typename... ARGS>\n    explicit CWrapperBase(ARGS&&... args) :\n        CWrapperBase{FUNCTIONS::ctor_func(std::forward<ARGS>(args)...)}\n    { }\n\n    CWrapperBase(CWrapperBase&& old) :\n        CWrapperBase{old.ptr}\n    {\n        old.ptr = INVALID_T::invalid_value;\n    }\n\n    CWrapperBase& operator=(CWrapperBase&& old)\n    {\n        if(this != &old)\n        {\n            FUNCTIONS::dtor_func(ptr);\n            ptr = old.ptr;\n            old.ptr = INVALID_T::invalid_value;\n        }\n        return *this;\n    }\n\n    ~CWrapperBase()\n    {\n        FUNCTIONS::dtor_func(ptr);\n    }\n\n    CWrapperBase& operator=(CWrapperBase const& other)\n    {\n        if(this != &other)\n        {\n            HANDLE_T new_ptr = FUNCTIONS::copy_func(other.ptr);\n            if(new_ptr == INVALID_T::invalid_value)\n                throw EXCEPTION_T{};\n\n            FUNCTIONS::dtor_func(ptr);\n            ptr = new_ptr;\n        }\n        return *this;\n    }\n};\n\ntemplate<\n    typename HANDLE_T,\n    typename FUNCTIONS,\n    CWrapperType TYPE,\n    bool CONSTSAFE,\n    typename EXCEPTION_T,\n    typename INVALID_T>\nclass CWrapperNonCopiable\n    : public ConversionHandler<\n        HANDLE_T,\n        CWrapperNonCopiable<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE, EXCEPTION_T, INVALID_T>,\n        TYPE,\n        CONSTSAFE>\n{\n    friend class ConversionHandler<\n        HANDLE_T,\n        CWrapperNonCopiable<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE, EXCEPTION_T, INVALID_T>,\n        TYPE,\n        CONSTSAFE>;\n\nprotected:\n    HANDLE_T ptr;\n\npublic:\n\n    explicit CWrapperNonCopiable(HANDLE_T ptr) :\n        ptr{ptr}\n    {\n        if(ptr == INVALID_T::invalid_value)\n            throw EXCEPTION_T{};\n    }\n\n    template<typename... ARGS>\n    explicit CWrapperNonCopiable(ARGS&&... args) :\n        CWrapperNonCopiable{FUNCTIONS::ctor_func(std::forward<ARGS>(args)...)}\n    { }\n\n    CWrapperNonCopiable(CWrapperNonCopiable&& old) :\n        CWrapperNonCopiable{old.ptr}\n    {\n        old.ptr = INVALID_T::invalid_value;\n    }\n\n    CWrapperNonCopiable& operator=(CWrapperNonCopiable&& old)\n    {\n        if(this != &old)\n        {\n            FUNCTIONS::dtor_func(ptr);\n            ptr = old.ptr;\n            old.ptr = INVALID_T::invalid_value;\n        }\n        return *this;\n    }\n\n    ~CWrapperNonCopiable()\n    {\n        FUNCTIONS::dtor_func(ptr);\n    }\n\n    \/\/ This one is needed to prevent variadic ctor to be called\n    \/\/ when you want to copy a non-const object.\n    CWrapperNonCopiable(CWrapperNonCopiable& other) = delete;\n    CWrapperNonCopiable(CWrapperNonCopiable const& other) = delete;\n    CWrapperNonCopiable& operator=(CWrapperNonCopiable const& other) = delete;\n};\n\ntemplate<bool condition, typename TRUE_TYPE, typename FALSE_TYPE>\nstruct COND\n{\n    using type = TRUE_TYPE;\n};\n\ntemplate<typename TRUE_TYPE, typename FALSE_TYPE>\nstruct COND<false, TRUE_TYPE, FALSE_TYPE>\n{\n    using type = FALSE_TYPE;\n};\n\nHAS_NESTED_TYPE_DETECTOR(exception);\nHAS_STATIC_MEMBER_DETECTOR(copy_func);\nHAS_STATIC_MEMBER_DETECTOR(invalid_value);\n\ntemplate<typename TYPE, typename DEFTYPE, bool>\nstruct default_exception_type\n{\n    using type = DEFTYPE;\n};\n\ntemplate<typename TYPE, typename DEFTYPE>\nstruct default_exception_type<TYPE, DEFTYPE, true>\n{\n    using type = typename TYPE::exception;\n};\n\ntemplate<typename T>\nstruct default_invalid_value\n{\n    static constexpr T invalid_value = 0;\n};\ntemplate<typename T>\nstruct default_invalid_value<T*>\n{\n    static constexpr T* invalid_value = nullptr;\n};\n\n\nusing E = typename default_exception_type<F, std::bad_alloc, HAS_NESTED_TYPE(F, exception)>::type;\nusing D = typename COND< HAS_STATIC_MEMBER(F, invalid_value),\n    F, default_invalid_value<H>>::type;\n\npublic:\n\n    using type = typename COND< HAS_STATIC_MEMBER(F, copy_func),\n        CWrapperBase<H, F, TY, C, E, D>,\n        CWrapperNonCopiable<H, F, TY, C, E, D>>::type;\n};\n\n\n\ntemplate<\n    typename HANDLE_T,\n    typename FUNCTIONS,\n    CWrapperType TYPE = CWrapperType::Get,\n    bool CONSTSAFE = true>\nusing CWrapper = typename __CWrapperHelper__<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE>::type;\n\n#endif \/\/ CWRAPPER_HPP_INCLUDED\n<commit_msg>Validating added<commit_after>#ifndef CWRAPPER_HPP_INCLUDED\n#define CWRAPPER_HPP_INCLUDED\n\n\n#define HAS_STATIC_MEMBER_DETECTOR(member)                                  \\\ntemplate<typename T>                                                        \\\nclass HAS_STATIC_MEMBER_DETECTOR_CLASS_ ## member                           \\\n{                                                                           \\\n    struct two_ints_type { int two_ints_1, two_ints_2; };                   \\\n    template<typename U>                                                    \\\n    static two_ints_type has_func_helper(...) { }                           \\\n    template<typename U>                                                    \\\n    static int has_func_helper(int, decltype(U::member)* func = nullptr)    \\\n    { return 0; }                                                           \\\npublic:                                                                     \\\n    static constexpr bool value =                                           \\\n        sizeof(decltype(has_func_helper<T>(0))) == sizeof(int);             \\\n}\n\n#define HAS_STATIC_MEMBER(type, member)                                     \\\n    (HAS_STATIC_MEMBER_DETECTOR_CLASS_ ## member<type>::value)\n\n#define HAS_NESTED_TYPE_DETECTOR(member)                                    \\\ntemplate<typename T>                                                        \\\nclass HAS_NESTED_TYPE_DETECTOR_CLASS_ ## member                             \\\n{                                                                           \\\n    struct two_ints_type { int two_ints_1, two_ints_2; };                   \\\n    template<typename U>                                                    \\\n    static two_ints_type has_func_helper(...) { }                           \\\n    template<typename U>                                                    \\\n    static int has_func_helper(int, typename U::member* ty = nullptr)       \\\n    { return 0; }                                                           \\\npublic:                                                                     \\\n    static constexpr bool value =                                           \\\n        sizeof(decltype(has_func_helper<T>(0))) == sizeof(int);             \\\n}\n\n#define HAS_NESTED_TYPE(type, member)                                       \\\n    (HAS_NESTED_TYPE_DETECTOR_CLASS_ ## member<type>::value)\n\n\nenum class CWrapperType\n{\n    Implicit,\n    Explicit,\n    Get,\n};\n\ntemplate<\n    typename H,\n    typename F,\n    CWrapperType TY,\n    bool C>\nclass __CWrapperHelper__\n{\n\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    bool CONSTSAFE>\nstruct ArrowHandler\n{ };\n\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ArrowHandler<PTR_T*, BASE, false>\n{\n    PTR_T* operator->() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\n\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ArrowHandler<PTR_T*, BASE, true>\n{\n    PTR_T* operator->()\n    {   return static_cast<BASE*>(this)->ptr; }\n    PTR_T const* operator->() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\n\n\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    CWrapperType TYPE,\n    bool CONSTSAFE>\nstruct ConversionHandler : public ArrowHandler<HANDLE_T, BASE, CONSTSAFE>\n{ };\n\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    bool CONSTSAFE>\nstruct ConversionHandler<HANDLE_T, BASE, CWrapperType::Implicit, CONSTSAFE>\n    : public ArrowHandler<HANDLE_T, BASE, CONSTSAFE>\n{\n    operator HANDLE_T() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    bool CONSTSAFE>\nstruct ConversionHandler<HANDLE_T, BASE, CWrapperType::Explicit, CONSTSAFE>\n    : public ArrowHandler<HANDLE_T, BASE, CONSTSAFE>\n{\n    explicit operator HANDLE_T() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\ntemplate<\n    typename HANDLE_T,\n    typename BASE,\n    bool CONSTSAFE>\nstruct ConversionHandler<HANDLE_T, BASE, CWrapperType::Get, CONSTSAFE>\n    : public ArrowHandler<HANDLE_T, BASE, CONSTSAFE>\n{\n    HANDLE_T get() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\n\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ConversionHandler<PTR_T*, BASE, CWrapperType::Implicit, true>\n    : public ArrowHandler<PTR_T*, BASE, true>\n{\n    operator PTR_T*()\n    {   return static_cast<BASE*>(this)->ptr; }\n    operator PTR_T const*() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ConversionHandler<PTR_T*, BASE, CWrapperType::Explicit, true>\n    : public ArrowHandler<PTR_T*, BASE, true>\n{\n    explicit operator PTR_T*()\n    {   return static_cast<BASE*>(this)->ptr; }\n    explicit operator PTR_T const*() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\ntemplate<\n    typename PTR_T,\n    typename BASE>\nstruct ConversionHandler<PTR_T*, BASE, CWrapperType::Get, true>\n    : public ArrowHandler<PTR_T*, BASE, true>\n{\n    PTR_T* get()\n    {   return static_cast<BASE*>(this)->ptr; }\n    PTR_T const* get() const\n    {   return static_cast<BASE*>(this)->ptr; }\n};\n\ntemplate<\n    typename HANDLE_T,\n    typename FUNCTIONS,\n    CWrapperType TYPE,\n    bool CONSTSAFE,\n    typename EXCEPTION_T,\n    typename INVALID_T,\n    typename VALIDATE_T>\nclass CWrapperBase\n    : public ConversionHandler<\n        HANDLE_T,\n        CWrapperBase<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE, EXCEPTION_T, INVALID_T, VALIDATE_T>,\n        TYPE,\n        CONSTSAFE>\n{\n    friend class ConversionHandler<\n        HANDLE_T,\n        CWrapperBase<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE, EXCEPTION_T, INVALID_T, VALIDATE_T>,\n        TYPE,\n        CONSTSAFE>;\nprotected:\n    HANDLE_T ptr;\n\npublic:\n\n    explicit CWrapperBase(HANDLE_T ptr) :\n        ptr{ptr}\n    {\n        if(!VALIDATE_T::validate_func(ptr))\n            throw EXCEPTION_T{};\n    }\n\n    CWrapperBase(CWrapperBase const& other) :\n        CWrapperBase{FUNCTIONS::copy_func(other.ptr)}\n    { }\n\n    \/\/ This one is needed to prevent variadic ctor to be called\n    \/\/ when you want to copy a non-const object.\n    CWrapperBase(CWrapperBase& other) :\n        CWrapperBase{FUNCTIONS::copy_func(other.ptr)}\n    { }\n\n    template<typename... ARGS>\n    explicit CWrapperBase(ARGS&&... args) :\n        CWrapperBase{FUNCTIONS::ctor_func(std::forward<ARGS>(args)...)}\n    { }\n\n    CWrapperBase(CWrapperBase&& old) :\n        CWrapperBase{old.ptr}\n    {\n        old.ptr = INVALID_T::invalid_value;\n    }\n\n    CWrapperBase& operator=(CWrapperBase&& old)\n    {\n        if(this != &old)\n        {\n            FUNCTIONS::dtor_func(ptr);\n            ptr = old.ptr;\n            old.ptr = INVALID_T::invalid_value;\n        }\n        return *this;\n    }\n\n    ~CWrapperBase()\n    {\n        FUNCTIONS::dtor_func(ptr);\n    }\n\n    CWrapperBase& operator=(CWrapperBase const& other)\n    {\n        if(this != &other)\n        {\n            HANDLE_T new_ptr = FUNCTIONS::copy_func(other.ptr);\n            if(!VALIDATE_T::validate_func(new_ptr))\n                throw EXCEPTION_T{};\n\n            FUNCTIONS::dtor_func(ptr);\n            ptr = new_ptr;\n        }\n        return *this;\n    }\n};\n\ntemplate<\n    typename HANDLE_T,\n    typename FUNCTIONS,\n    CWrapperType TYPE,\n    bool CONSTSAFE,\n    typename EXCEPTION_T,\n    typename INVALID_T,\n    typename VALIDATE_T>\nclass CWrapperNonCopiable\n    : public ConversionHandler<\n        HANDLE_T,\n        CWrapperNonCopiable<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE, EXCEPTION_T, INVALID_T, VALIDATE_T>,\n        TYPE,\n        CONSTSAFE>\n{\n    friend class ConversionHandler<\n        HANDLE_T,\n        CWrapperNonCopiable<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE, EXCEPTION_T, INVALID_T, VALIDATE_T>,\n        TYPE,\n        CONSTSAFE>;\n\nprotected:\n    HANDLE_T ptr;\n\npublic:\n\n    explicit CWrapperNonCopiable(HANDLE_T ptr) :\n        ptr{ptr}\n    {\n        if(!VALIDATE_T::validate_func(ptr))\n            throw EXCEPTION_T{};\n    }\n\n    template<typename... ARGS>\n    explicit CWrapperNonCopiable(ARGS&&... args) :\n        CWrapperNonCopiable{FUNCTIONS::ctor_func(std::forward<ARGS>(args)...)}\n    { }\n\n    CWrapperNonCopiable(CWrapperNonCopiable&& old) :\n        CWrapperNonCopiable{old.ptr}\n    {\n        old.ptr = INVALID_T::invalid_value;\n    }\n\n    CWrapperNonCopiable& operator=(CWrapperNonCopiable&& old)\n    {\n        if(this != &old)\n        {\n            FUNCTIONS::dtor_func(ptr);\n            ptr = old.ptr;\n            old.ptr = INVALID_T::invalid_value;\n        }\n        return *this;\n    }\n\n    ~CWrapperNonCopiable()\n    {\n        FUNCTIONS::dtor_func(ptr);\n    }\n\n    \/\/ This one is needed to prevent variadic ctor to be called\n    \/\/ when you want to copy a non-const object.\n    CWrapperNonCopiable(CWrapperNonCopiable& other) = delete;\n    CWrapperNonCopiable(CWrapperNonCopiable const& other) = delete;\n    CWrapperNonCopiable& operator=(CWrapperNonCopiable const& other) = delete;\n};\n\ntemplate<bool condition, typename TRUE_TYPE, typename FALSE_TYPE>\nstruct COND\n{\n    using type = TRUE_TYPE;\n};\n\ntemplate<typename TRUE_TYPE, typename FALSE_TYPE>\nstruct COND<false, TRUE_TYPE, FALSE_TYPE>\n{\n    using type = FALSE_TYPE;\n};\n\nHAS_NESTED_TYPE_DETECTOR(exception);\nHAS_STATIC_MEMBER_DETECTOR(copy_func);\nHAS_STATIC_MEMBER_DETECTOR(invalid_value);\nHAS_STATIC_MEMBER_DETECTOR(validate_func);\n\ntemplate<typename TYPE, typename DEFTYPE, bool>\nstruct default_exception_type\n{\n    using type = DEFTYPE;\n};\n\ntemplate<typename TYPE, typename DEFTYPE>\nstruct default_exception_type<TYPE, DEFTYPE, true>\n{\n    using type = typename TYPE::exception;\n};\n\ntemplate<typename T>\nstruct default_invalid_value\n{\n    static constexpr T invalid_value = 0;\n};\ntemplate<typename T>\nstruct default_invalid_value<T*>\n{\n    static constexpr T* invalid_value = nullptr;\n};\n\ntemplate<typename T, typename INVALID_T>\nstruct default_validate_func\n{\n    static constexpr bool validate_func(T ptr)\n    {\n        return ptr != INVALID_T::invalid_value;\n    }\n};\n\nusing E = typename default_exception_type<F, std::bad_alloc, HAS_NESTED_TYPE(F, exception)>::type;\nusing D = typename COND< HAS_STATIC_MEMBER(F, invalid_value),\n    F, default_invalid_value<H>>::type;\nusing V = typename COND< HAS_STATIC_MEMBER(F, validate_func),\n    F, default_validate_func<H, D>>::type;\n\npublic:\n\n    using type = typename COND< HAS_STATIC_MEMBER(F, copy_func),\n        CWrapperBase<H, F, TY, C, E, D, V>,\n        CWrapperNonCopiable<H, F, TY, C, E, D, V>>::type;\n};\n\n\n\ntemplate<\n    typename HANDLE_T,\n    typename FUNCTIONS,\n    CWrapperType TYPE = CWrapperType::Get,\n    bool CONSTSAFE = true>\nusing CWrapper = typename __CWrapperHelper__<HANDLE_T, FUNCTIONS, TYPE, CONSTSAFE>::type;\n\n#endif \/\/ CWRAPPER_HPP_INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>#include <lightstep\/tracer.h>\n#include <algorithm>\n#include \"..\/src\/auto_recorder.h\"\n#include \"..\/src\/lightstep_tracer_impl.h\"\n#include \"..\/src\/manual_recorder.h\"\n#include \"counting_metrics_observer.h\"\n#include \"in_memory_transporter.h\"\n#include \"testing_condition_variable_wrapper.h\"\n\n#define CATCH_CONFIG_MAIN\n#include <lightstep\/catch\/catch.hpp>\n\nusing namespace lightstep;\nusing namespace opentracing;\n\nstatic int LookupSpansDropped(const collector::ReportRequest& report) {\n  if (!report.has_internal_metrics()) {\n    return 0;\n  }\n  auto& counts = report.internal_metrics().counts();\n  auto iter = std::find_if(counts.begin(), counts.end(),\n                           [](const collector::MetricsSample& sample) {\n                             return sample.name() == \"spans.dropped\";\n                           });\n  if (iter == counts.end()) {\n    return 0;\n  }\n  if (iter->value_case() != collector::MetricsSample::kIntValue) {\n    std::cerr << \"spans.dropped not of type int\\n\";\n    std::terminate();\n  }\n  return static_cast<int>(iter->int_value());\n}\n\nTEST_CASE(\"auto_recorder\") {\n  Logger logger{};\n  auto metrics_observer = new CountingMetricsObserver{};\n  LightStepTracerOptions options;\n  options.reporting_period = std::chrono::milliseconds{2};\n  options.max_buffered_spans = 5;\n  options.metrics_observer.reset(metrics_observer);\n  auto in_memory_transporter = new InMemorySyncTransporter{};\n  auto condition_variable = new TestingConditionVariableWrapper{};\n  auto recorder = new AutoRecorder{\n      logger, std::move(options),\n      std::unique_ptr<SyncTransporter>{in_memory_transporter},\n      std::unique_ptr<ConditionVariableWrapper>{condition_variable}};\n  auto tracer = std::shared_ptr<opentracing::Tracer>{\n      new LightStepTracerImpl{std::unique_ptr<Recorder>{recorder}}};\n  CHECK(tracer);\n\n  SECTION(\n      \"The writer thread waits until `now() + options.reporting_period` to \"\n      \"send a report\") {\n    auto now = condition_variable->Now();\n    condition_variable->WaitTillNextEvent();\n    auto event = condition_variable->next_event();\n    CHECK(dynamic_cast<const TestingConditionVariableWrapper::WaitEvent*>(\n              event) != nullptr);\n    CHECK(event->timeout() == now + options.reporting_period);\n  }\n\n  SECTION(\n      \"If the writer thread takes longer than `options.reporting_period` to \"\n      \"run, then it runs again immediately upon finishing.\") {\n    auto now = condition_variable->Now() + 2 * options.reporting_period;\n    condition_variable->WaitTillNextEvent();\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    condition_variable->set_now(now);\n    condition_variable->Step();\n    condition_variable->WaitTillNextEvent();\n    auto event = condition_variable->next_event();\n    CHECK(dynamic_cast<const TestingConditionVariableWrapper::WaitEvent*>(\n              event) != nullptr);\n    CHECK(condition_variable->Now() == now);\n    CHECK(event->timeout() == now);\n  }\n\n  SECTION(\n      \"If the writer thread takes time between 0 and \"\n      \"`options.reporting_period` to run, then it subtracts the elapse time \"\n      \"from the next timeout\") {\n    auto now = condition_variable->Now() + 3 * options.reporting_period \/ 2;\n    condition_variable->WaitTillNextEvent();\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    condition_variable->set_now(now);\n    condition_variable->Step();\n    condition_variable->WaitTillNextEvent();\n    auto event = condition_variable->next_event();\n    CHECK(dynamic_cast<const TestingConditionVariableWrapper::WaitEvent*>(\n              event) != nullptr);\n    CHECK(condition_variable->Now() == now);\n    CHECK(event->timeout() == now + options.reporting_period \/ 2);\n  }\n\n  SECTION(\n      \"If the transporter's SendReport function throws, we drop all subsequent \"\n      \"spans.\") {\n    logger.set_level(LogLevel::off);\n    in_memory_transporter->set_should_throw(true);\n\n    \/\/ Wait until the writer thread is ready to run.\n    condition_variable->WaitTillNextEvent();\n\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    condition_variable->Step();\n\n    \/\/ Create another span\n    span = tracer->StartSpan(\"abc\");\n    span->Finish();\n\n    tracer->Close();\n\n    \/\/ Verify no spans were transported.\n    CHECK(in_memory_transporter->spans().size() == 0);\n  }\n\n  SECTION(\n      \"Dropped spans counts get sent in the next ReportRequest, and cleared in \"\n      \"the following ReportRequest.\") {\n    condition_variable->set_block_notify_all(true);\n    for (size_t i = 0; i < options.max_buffered_spans.value() + 1; ++i) {\n      auto span = tracer->StartSpan(\"abc\");\n      CHECK(span);\n      span->Finish();\n    }\n    \/\/ Check that a NotifyAllEvent gets added when the buffer overflows\n    CHECK(dynamic_cast<const TestingConditionVariableWrapper::NotifyAllEvent*>(\n              condition_variable->next_event()) != nullptr);\n\n    \/\/ Wait until the first report gets sent\n    condition_variable->Step();\n    condition_variable->Step();\n    condition_variable->set_block_notify_all(false);\n\n    auto span = tracer->StartSpan(\"xyz\");\n    CHECK(span);\n    span->Finish();\n    \/\/ Ensure that the second report gets sent.\n    condition_variable->Step();\n    condition_variable->Step();\n\n    auto reports = in_memory_transporter->reports();\n    CHECK(reports.size() == 2);\n    CHECK(LookupSpansDropped(reports.at(0)) == 1);\n    CHECK(reports.at(0).spans_size() == options.max_buffered_spans.value());\n    CHECK(LookupSpansDropped(reports.at(1)) == 0);\n    CHECK(reports.at(1).spans_size() == 1);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnFlush gets called whenever the recorder is \"\n      \"successfully flushed.\") {\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    condition_variable->Step();\n    tracer->Close();\n    CHECK(metrics_observer->num_flushes == 1);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnSpansSent gets called with the number of spans \"\n      \"successfully transported\") {\n    auto span1 = tracer->StartSpan(\"abc\");\n    span1->Finish();\n    auto span2 = tracer->StartSpan(\"abc\");\n    span2->Finish();\n    condition_variable->Step();\n    tracer->Close();\n    CHECK(metrics_observer->num_spans_sent == 2);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnSpansDropped gets called when spans are dropped.\") {\n    condition_variable->set_block_notify_all(true);\n    for (size_t i = 0; i < options.max_buffered_spans.value() + 1; ++i) {\n      auto span = tracer->StartSpan(\"abc\");\n      CHECK(span);\n      span->Finish();\n    }\n    condition_variable->set_block_notify_all(false);\n    condition_variable->Step();\n    tracer->Close();\n    CHECK(metrics_observer->num_spans_dropped == 1);\n  }\n}\n\nTEST_CASE(\"manual_recorder\") {\n  Logger logger{};\n  auto metrics_observer = new CountingMetricsObserver{};\n  LightStepTracerOptions options;\n  options.max_buffered_spans = 5;\n  options.metrics_observer.reset(metrics_observer);\n  auto in_memory_transporter = new InMemoryAsyncTransporter{};\n  auto recorder = new ManualRecorder{\n      logger, std::move(options),\n      std::unique_ptr<AsyncTransporter>{in_memory_transporter}};\n  auto tracer = std::shared_ptr<LightStepTracer>{\n      new LightStepTracerImpl{std::unique_ptr<Recorder>{recorder}}};\n  CHECK(tracer);\n\n  SECTION(\"Buffered spans get transported after Flush is manually called.\") {\n    auto span = tracer->StartSpan(\"abc\");\n    CHECK(span);\n    span->Finish();\n    CHECK(in_memory_transporter->reports().size() == 0);\n    CHECK(tracer->Flush());\n    in_memory_transporter->Write();\n    CHECK(in_memory_transporter->reports().size() == 1);\n  }\n\n  SECTION(\"Flush fails if a report is already being sent.\") {\n    auto span1 = tracer->StartSpan(\"abc\");\n    CHECK(span1);\n    span1->Finish();\n    CHECK(tracer->Flush());\n    auto span2 = tracer->StartSpan(\"xyz\");\n    CHECK(span2);\n    span2->Finish();\n    CHECK(!tracer->Flush());\n  }\n\n  SECTION(\n      \"If the tranporter fails, it's spans are reported as dropped in the \"\n      \"following report.\") {\n    logger.set_level(LogLevel::off);\n    auto span1 = tracer->StartSpan(\"abc\");\n    CHECK(span1);\n    span1->Finish();\n    CHECK(tracer->Flush());\n    in_memory_transporter->Fail(\n        std::make_error_code(std::errc::network_unreachable));\n\n    auto span2 = tracer->StartSpan(\"xyz\");\n    CHECK(span2);\n    span2->Finish();\n    CHECK(tracer->Flush());\n    in_memory_transporter->Write();\n    CHECK(LookupSpansDropped(in_memory_transporter->reports().at(0)) == 1);\n  }\n\n  SECTION(\"Flush is called when the tracer's buffer is filled.\") {\n    for (size_t i = 0; i < options.max_buffered_spans.value(); ++i) {\n      auto span = tracer->StartSpan(\"abc\");\n      CHECK(span);\n      span->Finish();\n    }\n    in_memory_transporter->Write();\n    CHECK(in_memory_transporter->reports().size() == 1);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnFlush gets called whenever the recorder is \"\n      \"successfully flushed.\") {\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    tracer->Flush();\n    in_memory_transporter->Write();\n    CHECK(metrics_observer->num_flushes == 1);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnSpansSent gets called with the number of spans \"\n      \"successfully transported\") {\n    auto span1 = tracer->StartSpan(\"abc\");\n    span1->Finish();\n    auto span2 = tracer->StartSpan(\"abc\");\n    span2->Finish();\n    tracer->Flush();\n    in_memory_transporter->Write();\n    CHECK(metrics_observer->num_spans_sent == 2);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnSpansDropped gets called when spans are dropped.\") {\n    logger.set_level(LogLevel::off);\n    auto span1 = tracer->StartSpan(\"abc\");\n    span1->Finish();\n    auto span2 = tracer->StartSpan(\"abc\");\n    span2->Finish();\n    tracer->Flush();\n    in_memory_transporter->Fail(\n        std::make_error_code(std::errc::network_unreachable));\n    CHECK(metrics_observer->num_spans_dropped == 2);\n  }\n}\n<commit_msg>Fix testing bug.<commit_after>#include <lightstep\/tracer.h>\n#include <algorithm>\n#include \"..\/src\/auto_recorder.h\"\n#include \"..\/src\/lightstep_tracer_impl.h\"\n#include \"..\/src\/manual_recorder.h\"\n#include \"counting_metrics_observer.h\"\n#include \"in_memory_transporter.h\"\n#include \"testing_condition_variable_wrapper.h\"\n\n#define CATCH_CONFIG_MAIN\n#include <lightstep\/catch\/catch.hpp>\n\nusing namespace lightstep;\nusing namespace opentracing;\n\nstatic int LookupSpansDropped(const collector::ReportRequest& report) {\n  if (!report.has_internal_metrics()) {\n    return 0;\n  }\n  auto& counts = report.internal_metrics().counts();\n  auto iter = std::find_if(counts.begin(), counts.end(),\n                           [](const collector::MetricsSample& sample) {\n                             return sample.name() == \"spans.dropped\";\n                           });\n  if (iter == counts.end()) {\n    return 0;\n  }\n  if (iter->value_case() != collector::MetricsSample::kIntValue) {\n    std::cerr << \"spans.dropped not of type int\\n\";\n    std::terminate();\n  }\n  return static_cast<int>(iter->int_value());\n}\n\nTEST_CASE(\"auto_recorder\") {\n  Logger logger{};\n  auto metrics_observer = new CountingMetricsObserver{};\n  LightStepTracerOptions options;\n  const auto reporting_period = std::chrono::milliseconds{2};\n  const auto max_buffered_spans = 5;\n  options.reporting_period = reporting_period;\n  options.max_buffered_spans = max_buffered_spans;\n  options.metrics_observer.reset(metrics_observer);\n  auto in_memory_transporter = new InMemorySyncTransporter{};\n  auto condition_variable = new TestingConditionVariableWrapper{};\n  auto recorder = new AutoRecorder{\n      logger, std::move(options),\n      std::unique_ptr<SyncTransporter>{in_memory_transporter},\n      std::unique_ptr<ConditionVariableWrapper>{condition_variable}};\n  auto tracer = std::shared_ptr<opentracing::Tracer>{\n      new LightStepTracerImpl{std::unique_ptr<Recorder>{recorder}}};\n  CHECK(tracer);\n\n  SECTION(\n      \"The writer thread waits until `now() + reporting_period` to \"\n      \"send a report\") {\n    auto now = condition_variable->Now();\n    condition_variable->WaitTillNextEvent();\n    auto event = condition_variable->next_event();\n    CHECK(dynamic_cast<const TestingConditionVariableWrapper::WaitEvent*>(\n              event) != nullptr);\n    CHECK(event->timeout() == now + reporting_period);\n  }\n\n  SECTION(\n      \"If the writer thread takes longer than `reporting_period` to run, then \"\n      \"it runs again immediately upon finishing.\") {\n    auto now = condition_variable->Now() + 2 * reporting_period;\n    condition_variable->WaitTillNextEvent();\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    condition_variable->set_now(now);\n    condition_variable->Step();\n    condition_variable->WaitTillNextEvent();\n    auto event = condition_variable->next_event();\n    CHECK(dynamic_cast<const TestingConditionVariableWrapper::WaitEvent*>(\n              event) != nullptr);\n    CHECK(condition_variable->Now() == now);\n    CHECK(event->timeout() == now);\n  }\n\n  SECTION(\n      \"If the writer thread takes time between 0 and `reporting_period` to \"\n      \"run, then it subtracts the elapse time from the next timeout\") {\n    auto now = condition_variable->Now() + 3 * reporting_period \/ 2;\n    condition_variable->WaitTillNextEvent();\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    condition_variable->set_now(now);\n    condition_variable->Step();\n    condition_variable->WaitTillNextEvent();\n    auto event = condition_variable->next_event();\n    CHECK(dynamic_cast<const TestingConditionVariableWrapper::WaitEvent*>(\n              event) != nullptr);\n    CHECK(condition_variable->Now() == now);\n    CHECK(event->timeout() == now + reporting_period \/ 2);\n  }\n\n  SECTION(\n      \"If the transporter's SendReport function throws, we drop all subsequent \"\n      \"spans.\") {\n    logger.set_level(LogLevel::off);\n    in_memory_transporter->set_should_throw(true);\n\n    \/\/ Wait until the writer thread is ready to run.\n    condition_variable->WaitTillNextEvent();\n\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    condition_variable->Step();\n\n    \/\/ Create another span\n    span = tracer->StartSpan(\"abc\");\n    span->Finish();\n\n    tracer->Close();\n\n    \/\/ Verify no spans were transported.\n    CHECK(in_memory_transporter->spans().size() == 0);\n  }\n\n  SECTION(\n      \"Dropped spans counts get sent in the next ReportRequest, and cleared in \"\n      \"the following ReportRequest.\") {\n    condition_variable->set_block_notify_all(true);\n    for (size_t i = 0; i < max_buffered_spans + 1; ++i) {\n      auto span = tracer->StartSpan(\"abc\");\n      CHECK(span);\n      span->Finish();\n    }\n    \/\/ Check that a NotifyAllEvent gets added when the buffer overflows\n    CHECK(dynamic_cast<const TestingConditionVariableWrapper::NotifyAllEvent*>(\n              condition_variable->next_event()) != nullptr);\n\n    \/\/ Wait until the first report gets sent\n    condition_variable->Step();\n    condition_variable->Step();\n    condition_variable->set_block_notify_all(false);\n\n    auto span = tracer->StartSpan(\"xyz\");\n    CHECK(span);\n    span->Finish();\n    \/\/ Ensure that the second report gets sent.\n    condition_variable->Step();\n    condition_variable->Step();\n\n    auto reports = in_memory_transporter->reports();\n    CHECK(reports.size() == 2);\n    CHECK(LookupSpansDropped(reports.at(0)) == 1);\n    CHECK(reports.at(0).spans_size() == max_buffered_spans);\n    CHECK(LookupSpansDropped(reports.at(1)) == 0);\n    CHECK(reports.at(1).spans_size() == 1);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnFlush gets called whenever the recorder is \"\n      \"successfully flushed.\") {\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    condition_variable->Step();\n    tracer->Close();\n    CHECK(metrics_observer->num_flushes == 1);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnSpansSent gets called with the number of spans \"\n      \"successfully transported\") {\n    auto span1 = tracer->StartSpan(\"abc\");\n    span1->Finish();\n    auto span2 = tracer->StartSpan(\"abc\");\n    span2->Finish();\n    condition_variable->Step();\n    tracer->Close();\n    CHECK(metrics_observer->num_spans_sent == 2);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnSpansDropped gets called when spans are dropped.\") {\n    condition_variable->set_block_notify_all(true);\n    for (size_t i = 0; i < max_buffered_spans + 1; ++i) {\n      auto span = tracer->StartSpan(\"abc\");\n      CHECK(span);\n      span->Finish();\n    }\n    condition_variable->set_block_notify_all(false);\n    condition_variable->Step();\n    tracer->Close();\n    CHECK(metrics_observer->num_spans_dropped == 1);\n  }\n}\n\nTEST_CASE(\"manual_recorder\") {\n  Logger logger{};\n  auto metrics_observer = new CountingMetricsObserver{};\n  LightStepTracerOptions options;\n  const auto max_buffered_spans = 5;\n  options.max_buffered_spans = max_buffered_spans;\n  options.metrics_observer.reset(metrics_observer);\n  auto in_memory_transporter = new InMemoryAsyncTransporter{};\n  auto recorder = new ManualRecorder{\n      logger, std::move(options),\n      std::unique_ptr<AsyncTransporter>{in_memory_transporter}};\n  auto tracer = std::shared_ptr<LightStepTracer>{\n      new LightStepTracerImpl{std::unique_ptr<Recorder>{recorder}}};\n  CHECK(tracer);\n\n  SECTION(\"Buffered spans get transported after Flush is manually called.\") {\n    auto span = tracer->StartSpan(\"abc\");\n    CHECK(span);\n    span->Finish();\n    CHECK(in_memory_transporter->reports().size() == 0);\n    CHECK(tracer->Flush());\n    in_memory_transporter->Write();\n    CHECK(in_memory_transporter->reports().size() == 1);\n  }\n\n  SECTION(\"Flush fails if a report is already being sent.\") {\n    auto span1 = tracer->StartSpan(\"abc\");\n    CHECK(span1);\n    span1->Finish();\n    CHECK(tracer->Flush());\n    auto span2 = tracer->StartSpan(\"xyz\");\n    CHECK(span2);\n    span2->Finish();\n    CHECK(!tracer->Flush());\n  }\n\n  SECTION(\n      \"If the tranporter fails, it's spans are reported as dropped in the \"\n      \"following report.\") {\n    logger.set_level(LogLevel::off);\n    auto span1 = tracer->StartSpan(\"abc\");\n    CHECK(span1);\n    span1->Finish();\n    CHECK(tracer->Flush());\n    in_memory_transporter->Fail(\n        std::make_error_code(std::errc::network_unreachable));\n\n    auto span2 = tracer->StartSpan(\"xyz\");\n    CHECK(span2);\n    span2->Finish();\n    CHECK(tracer->Flush());\n    in_memory_transporter->Write();\n    CHECK(LookupSpansDropped(in_memory_transporter->reports().at(0)) == 1);\n  }\n\n  SECTION(\"Flush is called when the tracer's buffer is filled.\") {\n    for (size_t i = 0; i < max_buffered_spans; ++i) {\n      auto span = tracer->StartSpan(\"abc\");\n      CHECK(span);\n      span->Finish();\n    }\n    in_memory_transporter->Write();\n    CHECK(in_memory_transporter->reports().size() == 1);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnFlush gets called whenever the recorder is \"\n      \"successfully flushed.\") {\n    auto span = tracer->StartSpan(\"abc\");\n    span->Finish();\n    tracer->Flush();\n    in_memory_transporter->Write();\n    CHECK(metrics_observer->num_flushes == 1);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnSpansSent gets called with the number of spans \"\n      \"successfully transported\") {\n    auto span1 = tracer->StartSpan(\"abc\");\n    span1->Finish();\n    auto span2 = tracer->StartSpan(\"abc\");\n    span2->Finish();\n    tracer->Flush();\n    in_memory_transporter->Write();\n    CHECK(metrics_observer->num_spans_sent == 2);\n  }\n\n  SECTION(\n      \"MetricsObserver::OnSpansDropped gets called when spans are dropped.\") {\n    logger.set_level(LogLevel::off);\n    auto span1 = tracer->StartSpan(\"abc\");\n    span1->Finish();\n    auto span2 = tracer->StartSpan(\"abc\");\n    span2->Finish();\n    tracer->Flush();\n    in_memory_transporter->Fail(\n        std::make_error_code(std::errc::network_unreachable));\n    CHECK(metrics_observer->num_spans_dropped == 2);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id: eth_tap.cc,v 1.2 2002\/03\/09 01:04:49 bdenney Exp $\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (C) 2001  MandrakeSoft S.A.\n\/\/\n\/\/    MandrakeSoft S.A.\n\/\/    43, rue d'Aboukir\n\/\/    75002 Paris - France\n\/\/    http:\/\/www.linux-mandrake.com\/\n\/\/    http:\/\/www.mandrakesoft.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 Software\n\/\/  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\n\/\/ eth_tap.cc  - TAP interface\n\/\/\n\/\/ Example configuration:\n\/\/   ifconfig tap0 10.0.0.123 up\n\/\/   route add -host 10.0.0.124 gw 10.0.0.123\n\/\/ Testing:\n\/\/   in one window, cat \/dev\/tap0\n\/\/   in another window, ping 10.0.0.124\n\/\/   you should see data coming out of \/dev\/tap0 with each ping.\n\n#include \"bochs.h\"\n#define LOG_THIS bx_ne2k.\n\n#include <signal.h>\n#include <sys\/param.h>\n#include <sys\/ioctl.h>\n#include <sys\/poll.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <asm\/types.h>\n#include <sys\/socket.h>\n#include <sys\/uio.h>\n#include <sys\/wait.h>\n#include <linux\/netlink.h>\n#include <linux\/if.h>\n#include <assert.h>\n#include <fcntl.h>\n#include <errno.h>\n\n#define TAP_VIRTUAL_HW_ADDR             0xDEADBEEF\n#define BX_ETH_TAP_LOGGING 1\n#define BX_PACKET_BUFSIZ 2048\t\/\/ Enough for an ether frame\n\n\/\/\n\/\/  Define the class. This is private to this module\n\/\/\nclass bx_tap_pktmover_c : public eth_pktmover_c {\npublic:\n  bx_tap_pktmover_c(const char *netif, const char *macaddr,\n\t\t     eth_rx_handler_t rxh,\n\t\t     void *rxarg);\n  void sendpkt(void *buf, unsigned io_len);\nprivate:\n  int fd;\n  int rx_timer_index;\n  static void rx_timer_handler(void *);\n  void rx_timer ();\n  FILE *txlog, *txlog_txt, *rxlog, *rxlog_txt;\n};\n\n\n\/\/\n\/\/  Define the static class that registers the derived pktmover class,\n\/\/ and allocates one on request.\n\/\/\nclass bx_tap_locator_c : public eth_locator_c {\npublic:\n  bx_tap_locator_c(void) : eth_locator_c(\"tap\") {}\nprotected:\n  eth_pktmover_c *allocate(const char *netif, const char *macaddr,\n\t\t\t   eth_rx_handler_t rxh,\n\t\t\t   void *rxarg) {\n    return (new bx_tap_pktmover_c(netif, macaddr, rxh, rxarg));\n  }\n} bx_tap_match;\n\n\n\/\/\n\/\/ Define the methods for the bx_tap_pktmover derived class\n\/\/\n\n\/\/ the constructor\nbx_tap_pktmover_c::bx_tap_pktmover_c(const char *netif, \n\t\t\t\t       const char *macaddr,\n\t\t\t\t       eth_rx_handler_t rxh,\n\t\t\t\t       void *rxarg)\n{\n  int flags;\n  char filename[BX_PATHNAME_LEN];\n  if (strncmp (netif, \"tap\", 3) != 0) {\n    BX_PANIC ((\"eth_tap: interface name (%s) must be tap0..tap15\", netif));\n  }\n  sprintf (filename, \"\/dev\/%s\", netif);\n\n  \/\/ check if the TAP devices is running, and turn on ARP.  This is based\n  \/\/ on code from the Mac-On-Linux project. http:\/\/http:\/\/www.maconlinux.org\/\n  int sock = socket( AF_INET, SOCK_DGRAM, 0 );\n  if (sock < 0) {\n    BX_PANIC ((\"socket creation: %s\", strerror(errno)));\n    return;\n  }\n  struct ifreq ifr;\n  memset( &ifr, 0, sizeof(ifr) );\n  strncpy( ifr.ifr_name, netif, sizeof(ifr.ifr_name) );\n  if( ioctl( sock, SIOCGIFFLAGS, &ifr ) < 0 ){\n    BX_PANIC ((\"SIOCGIFFLAGS: %s\", strerror (errno)));\n    close(sock);\n    return;\n  }\n  if( !(ifr.ifr_flags & IFF_RUNNING ) ){\n    BX_PANIC ((\"%s device is not running\", netif));\n    close(sock);\n    return;\n  }\n  if( (ifr.ifr_flags & IFF_NOARP ) ){\n    BX_INFO ((\"turn on ARP for %s device\", netif));\n    ifr.ifr_flags &= ~IFF_NOARP;\n    if( ioctl( sock, SIOCSIFFLAGS, &ifr ) < 0 ) {\n      BX_PANIC ((\"SIOCSIFFLAGS: %s\", strerror(errno)));\n      close(sock);\n      return;\n    }\n  }\n  close(sock);\n\n  fd = open (filename, O_RDWR);\n  if (fd < 0) {\n    BX_PANIC ((\"open failed on %s: %s\", netif, strerror (errno)));\n    return;\n  }\n\n  \/* set O_ASYNC flag so that we can poll with read() *\/\n  if ((flags = fcntl( fd, F_GETFL)) < 0) {\n    BX_PANIC ((\"getflags on tap device: %s\", strerror (errno)));\n  }\n  flags |= O_NONBLOCK;\n  if (fcntl( fd, F_SETFL, flags ) < 0) {\n    BX_PANIC ((\"set tap device flags: %s\", strerror (errno)));\n  }\n\n  BX_INFO ((\"eth_tap: opened %s device\", netif));\n\n#if BX_ETH_TAP_LOGGING\n  \/\/ Start the rx poll \n  this->rx_timer_index = \n    bx_pc_system.register_timer(this, this->rx_timer_handler, 1000,\n\t\t\t\t1, 1); \/\/ continuous, active\n  this->rxh   = rxh;\n  this->rxarg = rxarg;\n  \/\/ eventually Bryce wants txlog to dump in pcap format so that\n  \/\/ tcpdump -r FILE can read it and interpret packets.\n  txlog = fopen (\"ne2k-tx.log\", \"wb\");\n  if (!txlog) BX_PANIC ((\"open ne2k-tx.log failed\"));\n  txlog_txt = fopen (\"ne2k-txdump.txt\", \"wb\");\n  if (!txlog_txt) BX_PANIC ((\"open ne2k-txdump.txt failed\"));\n  fprintf (txlog_txt, \"tap packetmover readable log file\\n\");\n  fprintf (txlog_txt, \"net IF = %s\\n\", netif);\n  fprintf (txlog_txt, \"MAC address = \");\n  for (int i=0; i<6; i++) \n    fprintf (txlog_txt, \"%02x%s\", 0xff & macaddr[i], i<5?\":\" : \"\");\n  fprintf (txlog_txt, \"\\n--\\n\");\n  fflush (txlog_txt);\n\n  rxlog = fopen (\"ne2k-rx.log\", \"wb\");\n  if (!rxlog) BX_PANIC ((\"open ne2k-rx.log failed\"));\n  rxlog_txt = fopen (\"ne2k-rxdump.txt\", \"wb\");\n  if (!rxlog_txt) BX_PANIC ((\"open ne2k-rxdump.txt failed\"));\n  fprintf (rxlog_txt, \"tap packetmover readable log file\\n\");\n  fprintf (rxlog_txt, \"net IF = %s\\n\", netif);\n  fprintf (rxlog_txt, \"MAC address = \");\n  for (int i=0; i<6; i++) \n    fprintf (rxlog_txt, \"%02x%s\", 0xff & macaddr[i], i<5?\":\" : \"\");\n  fprintf (rxlog_txt, \"\\n--\\n\");\n  fflush (rxlog_txt);\n\n#endif\n}\n\nvoid\nbx_tap_pktmover_c::sendpkt(void *buf, unsigned io_len)\n{\n  Bit8u txbuf[BX_PACKET_BUFSIZ];\n  txbuf[0] = 0;\n  txbuf[1] = 0;\n  memcpy (txbuf+2, buf, io_len);\n  unsigned int size = write (fd, txbuf, io_len+2);\n  if (size != io_len+2) {\n    BX_PANIC ((\"write on tap device: %s\", strerror (errno)));\n  } else {\n    BX_INFO ((\"wrote %d bytes + 2 byte pad on tap\", io_len));\n  }\n#if BX_ETH_TAP_LOGGING\n  BX_DEBUG ((\"sendpkt length %u\", io_len));\n  \/\/ dump raw bytes to a file, eventually dump in pcap format so that\n  \/\/ tcpdump -r FILE can interpret them for us.\n  int n = fwrite (buf, io_len, 1, txlog);\n  if (n != 1) BX_ERROR ((\"fwrite to txlog failed\", io_len));\n  \/\/ dump packet in hex into an ascii log file\n  fprintf (txlog_txt, \"NE2K transmitting a packet, length %u\\n\", io_len);\n  Bit8u *charbuf = (Bit8u *)buf;\n  for (n=0; n<io_len; n++) {\n    if (((n % 16) == 0) && n>0)\n      fprintf (txlog_txt, \"\\n\");\n    fprintf (txlog_txt, \"%02x \", charbuf[n]);\n  }\n  fprintf (txlog_txt, \"\\n--\\n\");\n  \/\/ flush log so that we see the packets as they arrive w\/o buffering\n  fflush (txlog);\n  fflush (txlog_txt);\n#endif\n}\n\nvoid bx_tap_pktmover_c::rx_timer_handler (void *this_ptr)\n{\n  bx_tap_pktmover_c *class_ptr = (bx_tap_pktmover_c *) this_ptr;\n  class_ptr->rx_timer();\n}\n\nvoid bx_tap_pktmover_c::rx_timer ()\n{\n  int nbytes;\n  Bit8u buf[BX_PACKET_BUFSIZ];\n  Bit8u *rxbuf;\n  if (fd<0) return;\n  nbytes = read (fd, buf, sizeof(buf));\n\n  \/\/ hack: discard first two bytes\n  rxbuf = buf+2;\n  nbytes-=2;\n  \n  \/\/ hack: TAP device likes to create an ethernet header which has\n  \/\/ the same source and destination address FE:FD:00:00:00:00.\n  \/\/ Change the dest address to FE:FD:00:00:00:01.\n  rxbuf[5] = 1;\n\n  if (nbytes>0)\n    BX_INFO ((\"tap read returned %d bytes\", nbytes));\n  if (nbytes<0) {\n    if (errno != EAGAIN)\n      BX_ERROR ((\"tap read error: %s\", strerror(errno)));\n    return;\n  }\n#if BX_ETH_TAP_LOGGING\n  if (nbytes > 0) {\n    BX_DEBUG ((\"receive packet length %u\", nbytes));\n    \/\/ dump raw bytes to a file, eventually dump in pcap format so that\n    \/\/ tcpdump -r FILE can interpret them for us.\n    int n = fwrite (rxbuf, nbytes, 1, rxlog);\n    if (n != 1) BX_ERROR ((\"fwrite to rxlog failed\", nbytes));\n    \/\/ dump packet in hex into an ascii log file\n    fprintf (rxlog_txt, \"NE2K received a packet, length %u\\n\", nbytes);\n    for (n=0; n<nbytes; n++) {\n      if (((n % 16) == 0) && n>0)\n\tfprintf (rxlog_txt, \"\\n\");\n      fprintf (rxlog_txt, \"%02x \", rxbuf[n]);\n    }\n    fprintf (rxlog_txt, \"\\n--\\n\");\n    \/\/ flush log so that we see the packets as they arrive w\/o buffering\n    fflush (rxlog);\n    fflush (rxlog_txt);\n  }\n#endif\n  BX_DEBUG((\"eth_tap: got packet: %d bytes, dst=%x:%x:%x:%x:%x:%x, src=%x:%x:%x:%x:%x:%x\\n\", nbytes, rxbuf[0], rxbuf[1], rxbuf[2], rxbuf[3], rxbuf[4], rxbuf[5], rxbuf[6], rxbuf[7], rxbuf[8], rxbuf[9], rxbuf[10], rxbuf[11]));\n  if (nbytes < 60) {\n    BX_INFO ((\"packet too short (%d), padding to 60\", nbytes));\n    nbytes = 60;\n  }\n  (*rxh)(rxarg, rxbuf, nbytes);\n}\n<commit_msg>- add instructions for setting it TAP<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id: eth_tap.cc,v 1.3 2002\/03\/09 01:23:21 bdenney Exp $\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (C) 2001  MandrakeSoft S.A.\n\/\/\n\/\/    MandrakeSoft S.A.\n\/\/    43, rue d'Aboukir\n\/\/    75002 Paris - France\n\/\/    http:\/\/www.linux-mandrake.com\/\n\/\/    http:\/\/www.mandrakesoft.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 Software\n\/\/  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\n\/\/ eth_tap.cc  - TAP interface by Bryce Denney\n\/\/\n\/\/ Here's how to get this working.  On the host machine:\n\/\/    $ su root\n\/\/    # \/sbin\/insmod ethertap\n\/\/    Using \/lib\/modules\/2.2.14-5.0\/net\/ethertap.o\n\/\/    # mknod \/dev\/tap0 c 36 16          # if not already there\n\/\/    # \/sbin\/ifconfig tap0 10.0.0.1\n\/\/    # \/sbin\/route add -host 10.0.0.2 gw 10.0.0.1\n\/\/\n\/\/ Now you have a tap0 device which you can on the ifconfig output.  The\n\/\/ tap0 interface has the IP address of 10.0.0.1.  The bochs machine will have\n\/\/ the IP address 10.0.0.2.\n\/\/\n\/\/ Compile a bochs version from March 8, 2002 or later with --enable-ne2000.\n\/\/ Add this ne2k line to your .bochsrc to activate the tap device.\n\/\/   ne2k: ioaddr=0x280, irq=9, mac=fe:fd:00:00:00:01, ethmod=tap, ethdev=tap0\n\/\/ Don't change the mac or ethmod!\n\/\/\n\/\/ Boot up DLX Linux in Bochs.  Log in as root and then type the following\n\/\/ commands to set up networking:\n\/\/   # ifconfig eth0 10.0.0.2\n\/\/   # route add -net 10.0.0.0\n\/\/   # route add default gw 10.0.0.1\n\/\/ Now you should be able to ping from guest OS to your host machine, if\n\/\/ you give its IP number.  I'm still having trouble with pings from the\n\/\/ host machine to the guest, so something is still not right.  But it's\n\/\/ really close to working!\n\/\/\n\/\/ By setting up packet forwarding (with masquerading) on the host, you should\n\/\/ be able to get Bochs talking to anyone on the internet.\n\/\/ \n\n#include \"bochs.h\"\n#define LOG_THIS bx_ne2k.\n\n#include <signal.h>\n#include <sys\/param.h>\n#include <sys\/ioctl.h>\n#include <sys\/poll.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <asm\/types.h>\n#include <sys\/socket.h>\n#include <sys\/uio.h>\n#include <sys\/wait.h>\n#include <linux\/netlink.h>\n#include <linux\/if.h>\n#include <assert.h>\n#include <fcntl.h>\n#include <errno.h>\n\n#define TAP_VIRTUAL_HW_ADDR             0xDEADBEEF\n#define BX_ETH_TAP_LOGGING 1\n#define BX_PACKET_BUFSIZ 2048\t\/\/ Enough for an ether frame\n\n\/\/\n\/\/  Define the class. This is private to this module\n\/\/\nclass bx_tap_pktmover_c : public eth_pktmover_c {\npublic:\n  bx_tap_pktmover_c(const char *netif, const char *macaddr,\n\t\t     eth_rx_handler_t rxh,\n\t\t     void *rxarg);\n  void sendpkt(void *buf, unsigned io_len);\nprivate:\n  int fd;\n  int rx_timer_index;\n  static void rx_timer_handler(void *);\n  void rx_timer ();\n  FILE *txlog, *txlog_txt, *rxlog, *rxlog_txt;\n};\n\n\n\/\/\n\/\/  Define the static class that registers the derived pktmover class,\n\/\/ and allocates one on request.\n\/\/\nclass bx_tap_locator_c : public eth_locator_c {\npublic:\n  bx_tap_locator_c(void) : eth_locator_c(\"tap\") {}\nprotected:\n  eth_pktmover_c *allocate(const char *netif, const char *macaddr,\n\t\t\t   eth_rx_handler_t rxh,\n\t\t\t   void *rxarg) {\n    return (new bx_tap_pktmover_c(netif, macaddr, rxh, rxarg));\n  }\n} bx_tap_match;\n\n\n\/\/\n\/\/ Define the methods for the bx_tap_pktmover derived class\n\/\/\n\n\/\/ the constructor\nbx_tap_pktmover_c::bx_tap_pktmover_c(const char *netif, \n\t\t\t\t       const char *macaddr,\n\t\t\t\t       eth_rx_handler_t rxh,\n\t\t\t\t       void *rxarg)\n{\n  int flags;\n  char filename[BX_PATHNAME_LEN];\n  if (strncmp (netif, \"tap\", 3) != 0) {\n    BX_PANIC ((\"eth_tap: interface name (%s) must be tap0..tap15\", netif));\n  }\n  sprintf (filename, \"\/dev\/%s\", netif);\n\n  \/\/ check if the TAP devices is running, and turn on ARP.  This is based\n  \/\/ on code from the Mac-On-Linux project. http:\/\/http:\/\/www.maconlinux.org\/\n  int sock = socket( AF_INET, SOCK_DGRAM, 0 );\n  if (sock < 0) {\n    BX_PANIC ((\"socket creation: %s\", strerror(errno)));\n    return;\n  }\n  struct ifreq ifr;\n  memset( &ifr, 0, sizeof(ifr) );\n  strncpy( ifr.ifr_name, netif, sizeof(ifr.ifr_name) );\n  if( ioctl( sock, SIOCGIFFLAGS, &ifr ) < 0 ){\n    BX_PANIC ((\"SIOCGIFFLAGS: %s\", strerror (errno)));\n    close(sock);\n    return;\n  }\n  if( !(ifr.ifr_flags & IFF_RUNNING ) ){\n    BX_PANIC ((\"%s device is not running\", netif));\n    close(sock);\n    return;\n  }\n  if( (ifr.ifr_flags & IFF_NOARP ) ){\n    BX_INFO ((\"turn on ARP for %s device\", netif));\n    ifr.ifr_flags &= ~IFF_NOARP;\n    if( ioctl( sock, SIOCSIFFLAGS, &ifr ) < 0 ) {\n      BX_PANIC ((\"SIOCSIFFLAGS: %s\", strerror(errno)));\n      close(sock);\n      return;\n    }\n  }\n  close(sock);\n\n  fd = open (filename, O_RDWR);\n  if (fd < 0) {\n    BX_PANIC ((\"open failed on %s: %s\", netif, strerror (errno)));\n    return;\n  }\n\n  \/* set O_ASYNC flag so that we can poll with read() *\/\n  if ((flags = fcntl( fd, F_GETFL)) < 0) {\n    BX_PANIC ((\"getflags on tap device: %s\", strerror (errno)));\n  }\n  flags |= O_NONBLOCK;\n  if (fcntl( fd, F_SETFL, flags ) < 0) {\n    BX_PANIC ((\"set tap device flags: %s\", strerror (errno)));\n  }\n\n  BX_INFO ((\"eth_tap: opened %s device\", netif));\n\n#if BX_ETH_TAP_LOGGING\n  \/\/ Start the rx poll \n  this->rx_timer_index = \n    bx_pc_system.register_timer(this, this->rx_timer_handler, 1000,\n\t\t\t\t1, 1); \/\/ continuous, active\n  this->rxh   = rxh;\n  this->rxarg = rxarg;\n  \/\/ eventually Bryce wants txlog to dump in pcap format so that\n  \/\/ tcpdump -r FILE can read it and interpret packets.\n  txlog = fopen (\"ne2k-tx.log\", \"wb\");\n  if (!txlog) BX_PANIC ((\"open ne2k-tx.log failed\"));\n  txlog_txt = fopen (\"ne2k-txdump.txt\", \"wb\");\n  if (!txlog_txt) BX_PANIC ((\"open ne2k-txdump.txt failed\"));\n  fprintf (txlog_txt, \"tap packetmover readable log file\\n\");\n  fprintf (txlog_txt, \"net IF = %s\\n\", netif);\n  fprintf (txlog_txt, \"MAC address = \");\n  for (int i=0; i<6; i++) \n    fprintf (txlog_txt, \"%02x%s\", 0xff & macaddr[i], i<5?\":\" : \"\");\n  fprintf (txlog_txt, \"\\n--\\n\");\n  fflush (txlog_txt);\n\n  rxlog = fopen (\"ne2k-rx.log\", \"wb\");\n  if (!rxlog) BX_PANIC ((\"open ne2k-rx.log failed\"));\n  rxlog_txt = fopen (\"ne2k-rxdump.txt\", \"wb\");\n  if (!rxlog_txt) BX_PANIC ((\"open ne2k-rxdump.txt failed\"));\n  fprintf (rxlog_txt, \"tap packetmover readable log file\\n\");\n  fprintf (rxlog_txt, \"net IF = %s\\n\", netif);\n  fprintf (rxlog_txt, \"MAC address = \");\n  for (int i=0; i<6; i++) \n    fprintf (rxlog_txt, \"%02x%s\", 0xff & macaddr[i], i<5?\":\" : \"\");\n  fprintf (rxlog_txt, \"\\n--\\n\");\n  fflush (rxlog_txt);\n\n#endif\n}\n\nvoid\nbx_tap_pktmover_c::sendpkt(void *buf, unsigned io_len)\n{\n  Bit8u txbuf[BX_PACKET_BUFSIZ];\n  txbuf[0] = 0;\n  txbuf[1] = 0;\n  memcpy (txbuf+2, buf, io_len);\n  unsigned int size = write (fd, txbuf, io_len+2);\n  if (size != io_len+2) {\n    BX_PANIC ((\"write on tap device: %s\", strerror (errno)));\n  } else {\n    BX_INFO ((\"wrote %d bytes + 2 byte pad on tap\", io_len));\n  }\n#if BX_ETH_TAP_LOGGING\n  BX_DEBUG ((\"sendpkt length %u\", io_len));\n  \/\/ dump raw bytes to a file, eventually dump in pcap format so that\n  \/\/ tcpdump -r FILE can interpret them for us.\n  int n = fwrite (buf, io_len, 1, txlog);\n  if (n != 1) BX_ERROR ((\"fwrite to txlog failed\", io_len));\n  \/\/ dump packet in hex into an ascii log file\n  fprintf (txlog_txt, \"NE2K transmitting a packet, length %u\\n\", io_len);\n  Bit8u *charbuf = (Bit8u *)buf;\n  for (n=0; n<io_len; n++) {\n    if (((n % 16) == 0) && n>0)\n      fprintf (txlog_txt, \"\\n\");\n    fprintf (txlog_txt, \"%02x \", charbuf[n]);\n  }\n  fprintf (txlog_txt, \"\\n--\\n\");\n  \/\/ flush log so that we see the packets as they arrive w\/o buffering\n  fflush (txlog);\n  fflush (txlog_txt);\n#endif\n}\n\nvoid bx_tap_pktmover_c::rx_timer_handler (void *this_ptr)\n{\n  bx_tap_pktmover_c *class_ptr = (bx_tap_pktmover_c *) this_ptr;\n  class_ptr->rx_timer();\n}\n\nvoid bx_tap_pktmover_c::rx_timer ()\n{\n  int nbytes;\n  Bit8u buf[BX_PACKET_BUFSIZ];\n  Bit8u *rxbuf;\n  if (fd<0) return;\n  nbytes = read (fd, buf, sizeof(buf));\n\n  \/\/ hack: discard first two bytes\n  rxbuf = buf+2;\n  nbytes-=2;\n  \n  \/\/ hack: TAP device likes to create an ethernet header which has\n  \/\/ the same source and destination address FE:FD:00:00:00:00.\n  \/\/ Change the dest address to FE:FD:00:00:00:01.\n  rxbuf[5] = 1;\n\n  if (nbytes>0)\n    BX_INFO ((\"tap read returned %d bytes\", nbytes));\n  if (nbytes<0) {\n    if (errno != EAGAIN)\n      BX_ERROR ((\"tap read error: %s\", strerror(errno)));\n    return;\n  }\n#if BX_ETH_TAP_LOGGING\n  if (nbytes > 0) {\n    BX_DEBUG ((\"receive packet length %u\", nbytes));\n    \/\/ dump raw bytes to a file, eventually dump in pcap format so that\n    \/\/ tcpdump -r FILE can interpret them for us.\n    int n = fwrite (rxbuf, nbytes, 1, rxlog);\n    if (n != 1) BX_ERROR ((\"fwrite to rxlog failed\", nbytes));\n    \/\/ dump packet in hex into an ascii log file\n    fprintf (rxlog_txt, \"NE2K received a packet, length %u\\n\", nbytes);\n    for (n=0; n<nbytes; n++) {\n      if (((n % 16) == 0) && n>0)\n\tfprintf (rxlog_txt, \"\\n\");\n      fprintf (rxlog_txt, \"%02x \", rxbuf[n]);\n    }\n    fprintf (rxlog_txt, \"\\n--\\n\");\n    \/\/ flush log so that we see the packets as they arrive w\/o buffering\n    fflush (rxlog);\n    fflush (rxlog_txt);\n  }\n#endif\n  BX_DEBUG((\"eth_tap: got packet: %d bytes, dst=%x:%x:%x:%x:%x:%x, src=%x:%x:%x:%x:%x:%x\\n\", nbytes, rxbuf[0], rxbuf[1], rxbuf[2], rxbuf[3], rxbuf[4], rxbuf[5], rxbuf[6], rxbuf[7], rxbuf[8], rxbuf[9], rxbuf[10], rxbuf[11]));\n  if (nbytes < 60) {\n    BX_INFO ((\"packet too short (%d), padding to 60\", nbytes));\n    nbytes = 60;\n  }\n  (*rxh)(rxarg, rxbuf, nbytes);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\r\n#include <vector>\r\n#include <cmath>\r\n#include <cstdio>\r\n\r\n#include \"..\/include\/RRR.h\"\r\n\r\nusing namespace std;\r\n\r\n\/\/ calculates number of ones or zeros depending on type\r\nint RRR::calcForType(int total, int ones, bool type) {\r\n  return type ? ones : total-ones;\r\n}\r\n\r\n\/\/ finds index of superblock containing i-th one\/zero (type)\r\nint RRR::findSuperblock(int i, bool type) {\r\n  int lo = 0;\r\n  int hi = numSuperblocks;\r\n  while(lo < hi) {\r\n    int mid = (lo+hi)\/2;\r\n    int cumsum = calcForType(b*f*(mid+1), superblockCumSum[mid], type);\r\n    if (cumsum < i) {\r\n      lo = mid+1;\r\n    } else {\r\n      hi = mid;\r\n    }\r\n  }\r\n  return lo;\r\n}\r\n\r\n\/\/ finds index in indBlock containing i-th one\/zero (x)\r\nint RRR::findIndexInBlock(int indBlock, int i, bool type) {\r\n  int lo = 0;\r\n  int hi = b;\r\n  while (lo < hi) {\r\n    int mid = (lo+hi)\/2;\r\n    int cumsum = \\\r\n      calcForType(mid+1, cumSumInBlock[blockClass[indBlock]][blockOffset[indBlock]][mid], type);\r\n    if (cumsum < i) {\r\n      lo = mid+1;\r\n    } else {\r\n      hi = mid;\r\n    }\r\n  }\r\n  return lo;\r\n}\r\n\r\nint RRR::getIndBlock(int ind) {\r\n  return ind\/b;\r\n}\r\n\r\nint RRR::getIndSuperblock(int indBlock) {\r\n  return indBlock\/(b*f);\r\n}\r\n\r\nint RRR::getCumSumToSuperblock(int indSuperblock, bool type) {\r\n  return (indSuperblock < 0) ? 0 : calcForType((indSuperblock+1)*b*f, superblockCumSum[indSuperblock], type);\r\n}\r\n\r\nbool RRR::isBlockStart(int ind) {\r\n  return getIndBlock(ind) != getIndBlock(ind-1);\r\n}\r\n\r\nint RRR::nChoosek(int n, int k) {\r\n  if (k > n) return 0;\r\n  if (k*2 > n) k = n-k;\r\n  if (k == 0) return 1;\r\n\r\n  int res = n;\r\n  for (int i = 2; i <= k; ++i) {\r\n    res *= (n-i+1);\r\n    res \/= i;\r\n  }\r\n  return res;\r\n}\r\n\r\nint RRR::select(int i, bool type) {\r\n  \/\/ index of superblock containing i-th one\/zero\r\n  int indSuperblock = findSuperblock(i, type);\r\n\r\n  \/\/ cumulative sum of ones\/zeros up to previous superblock\r\n  int counter = getCumSumToSuperblock(indSuperblock-1, type);\r\n\r\n  int indBlock = indSuperblock*f; \/\/ current block index\r\n  \/\/ loop through blocks until the sum of i is reached\r\n  while (counter < i) {\r\n    counter += calcForType(b, blockClass[indBlock], type);\r\n    ++indBlock;\r\n  }\r\n\r\n  \/\/ return to previous block\r\n  --indBlock;\r\n  counter -= calcForType(b, blockClass[indBlock], type);\r\n\r\n  \/\/ index in indBlock containing (i-counter)-th one\r\n  int indInBlock = findIndexInBlock(indBlock, i-counter, type);\r\n\r\n  return indBlock*b + indInBlock;\r\n}\r\n\r\nvoid RRR::construct(vector<bool> bits, int _b, int _f) {\r\n  b = _b;\r\n  f = _f;\r\n\r\n  \/\/ preprocessing - O(b*2^b) time and memory\r\n  vector<int> blockValToOffset;\r\n  blockValToOffset.resize(1<<b);\r\n  vector<int> indInClass; \/\/ index in class\r\n  indInClass.resize(b+1, 0); \/\/ b+1 different classes in total (0 ones, .., b ones)\r\n  cumSumInBlock.resize(b+1); \/\/ b+1 different classes in total\r\n  for (int i = 0; i < (1<<b); ++i) {\r\n    int classType = __builtin_popcount(i);\r\n    blockValToOffset[i] = indInClass[classType];\r\n    ++indInClass[classType];\r\n\r\n    \/\/ calculate cumSumInBlock\r\n    cumSumInBlock[classType].resize(nChoosek(b, classType));\r\n    cumSumInBlock[classType][blockValToOffset[i]].resize(b);\r\n    int cumsum = 0;\r\n    for (int j = 0; j < b; ++j) {\r\n      cumsum += !!(i&(1<<(b-j-1)));\r\n      cumSumInBlock[classType][blockValToOffset[i]][j] = cumsum;\r\n    }\r\n  }\r\n  \/\/ preprocessing finished\r\n\r\n  int n = bits.size();\r\n  numBlocks = (n-1)\/b+1;\r\n  numSuperblocks = (n-1)\/(b*f)+1;\r\n  blockClass.resize(numBlocks, 0);\r\n  blockOffset.resize(numBlocks);\r\n  superblockCumSum.resize(numSuperblocks);\r\n\r\n  int cumsum = 0;\r\n  int blockVal = 0;\r\n  for (int i = 0; i < numBlocks*b; ++i) {\r\n    if (isBlockStart(i)) {\r\n      blockVal = 0; \/\/ when new block starts reset block value to zero\r\n    }\r\n    \/\/ update block class and offset\r\n    int indBlock = getIndBlock(i);\r\n    blockVal = (blockVal*2) + bits[i]; \/\/ TODO: don't limit b to 32\r\n    blockOffset[indBlock] = blockValToOffset[blockVal];\r\n    blockClass[indBlock] += bits[i];\r\n\r\n    \/\/ update superblockCumSum\r\n    cumsum += bits[i];\r\n    superblockCumSum[getIndSuperblock(i)] = cumsum;\r\n  }\r\n}\r\n\r\n\/\/ time-complexity - O(b*2^b) for preprocessing\r\nRRR::RRR(vector<bool> bits) {\r\n  int b = max((int)(log2(bits.size()) \/ 2), 1);\r\n  int f = max((int)pow(log2(bits.size()), 2), 1);\r\n  construct(bits, b, f);\r\n}\r\n\r\n\/\/ time-complexity - O(b*2^b) for preprocessing\r\nRRR::RRR(vector<bool> bits, int _b, int _f) {\r\n  construct(bits, _b, _f);\r\n}\r\n\r\n\/\/ number of zeros to position i, inclusive\r\n\/\/ time-complexity - same as rank1()\r\nint RRR::rank0(int i) {\r\n  \/\/ calculate using number of ones\r\n  return i+1-rank1(i);\r\n}\r\n\r\n\/\/ number of ones to position i, inclusive\r\n\/\/ time-complexity - O(f)\r\n\/\/ TODO: convert to O(1), hint: remove looping through each block in superblock and\r\n\/\/ use cumulative sum of blocks in superblock instead\r\nint RRR::rank1(int ind) {\r\n  int indBlock = getIndBlock(ind); \/\/ block index\r\n  int indSuperblock = getIndSuperblock(ind); \/\/ superblock index\r\n\r\n  \/\/ cumulative sum of ones up to previous superblock\r\n  int counter = getCumSumToSuperblock(indSuperblock-1, true);\r\n\r\n  \/\/ add sum of ones in all blocks of current superblock up to previous block\r\n  for (int i = indSuperblock*f; i < indBlock; ++i) {\r\n    counter += blockClass[i];\r\n  }\r\n  \/\/ add number of ones in current block up to i-th position\r\n  counter += cumSumInBlock[blockClass[indBlock]][blockOffset[indBlock]][ind-indBlock*b];\r\n  return counter;\r\n}\r\n\r\n\/\/ index of the i-th zero (0-indexed)\r\n\/\/ time-complexity - same as select1()\r\nint RRR::select0(int i) {\r\n  return select(i, false);\r\n}\r\n\r\n\/\/ index of the i-th one (0-indexed)\r\n\/\/ time-complexity - O(log(n\/(b*f))+f+log(b))\r\nint RRR::select1(int i) {\r\n  return select(i, true);\r\n}\r\n\r\n\/\/ bit on given index\r\n\/\/ time-complexity - same as rank1()\r\nint RRR::access(int ind) {\r\n  return (ind > 0) ? rank1(ind)-rank1(ind-1) : rank1(ind);\r\n}\r\n<commit_msg>Changed parameter in RRR.<commit_after>#include <algorithm>\r\n#include <vector>\r\n#include <cmath>\r\n#include <cstdio>\r\n\r\n#include \"..\/include\/RRR.h\"\r\n\r\nusing namespace std;\r\n\r\n\/\/ calculates number of ones or zeros depending on type\r\nint RRR::calcForType(int total, int ones, bool type) {\r\n  return type ? ones : total-ones;\r\n}\r\n\r\n\/\/ finds index of superblock containing i-th one\/zero (type)\r\nint RRR::findSuperblock(int i, bool type) {\r\n  int lo = 0;\r\n  int hi = numSuperblocks;\r\n  while(lo < hi) {\r\n    int mid = (lo+hi)\/2;\r\n    int cumsum = calcForType(b*f*(mid+1), superblockCumSum[mid], type);\r\n    if (cumsum < i) {\r\n      lo = mid+1;\r\n    } else {\r\n      hi = mid;\r\n    }\r\n  }\r\n  return lo;\r\n}\r\n\r\n\/\/ finds index in indBlock containing i-th one\/zero (x)\r\nint RRR::findIndexInBlock(int indBlock, int i, bool type) {\r\n  int lo = 0;\r\n  int hi = b;\r\n  while (lo < hi) {\r\n    int mid = (lo+hi)\/2;\r\n    int cumsum = \\\r\n      calcForType(mid+1, cumSumInBlock[blockClass[indBlock]][blockOffset[indBlock]][mid], type);\r\n    if (cumsum < i) {\r\n      lo = mid+1;\r\n    } else {\r\n      hi = mid;\r\n    }\r\n  }\r\n  return lo;\r\n}\r\n\r\nint RRR::getIndBlock(int ind) {\r\n  return ind\/b;\r\n}\r\n\r\nint RRR::getIndSuperblock(int indBlock) {\r\n  return indBlock\/(b*f);\r\n}\r\n\r\nint RRR::getCumSumToSuperblock(int indSuperblock, bool type) {\r\n  return (indSuperblock < 0) ? 0 : calcForType((indSuperblock+1)*b*f, superblockCumSum[indSuperblock], type);\r\n}\r\n\r\nbool RRR::isBlockStart(int ind) {\r\n  return getIndBlock(ind) != getIndBlock(ind-1);\r\n}\r\n\r\nint RRR::nChoosek(int n, int k) {\r\n  if (k > n) return 0;\r\n  if (k*2 > n) k = n-k;\r\n  if (k == 0) return 1;\r\n\r\n  int res = n;\r\n  for (int i = 2; i <= k; ++i) {\r\n    res *= (n-i+1);\r\n    res \/= i;\r\n  }\r\n  return res;\r\n}\r\n\r\nint RRR::select(int i, bool type) {\r\n  \/\/ index of superblock containing i-th one\/zero\r\n  int indSuperblock = findSuperblock(i, type);\r\n\r\n  \/\/ cumulative sum of ones\/zeros up to previous superblock\r\n  int counter = getCumSumToSuperblock(indSuperblock-1, type);\r\n\r\n  int indBlock = indSuperblock*f; \/\/ current block index\r\n  \/\/ loop through blocks until the sum of i is reached\r\n  while (counter < i) {\r\n    counter += calcForType(b, blockClass[indBlock], type);\r\n    ++indBlock;\r\n  }\r\n\r\n  \/\/ return to previous block\r\n  --indBlock;\r\n  counter -= calcForType(b, blockClass[indBlock], type);\r\n\r\n  \/\/ index in indBlock containing (i-counter)-th one\r\n  int indInBlock = findIndexInBlock(indBlock, i-counter, type);\r\n\r\n  return indBlock*b + indInBlock;\r\n}\r\n\r\nvoid RRR::construct(vector<bool> bits, int _b, int _f) {\r\n  b = _b;\r\n  f = _f;\r\n\r\n  \/\/ preprocessing - O(b*2^b) time and memory\r\n  vector<int> blockValToOffset;\r\n  blockValToOffset.resize(1<<b);\r\n  vector<int> indInClass; \/\/ index in class\r\n  indInClass.resize(b+1, 0); \/\/ b+1 different classes in total (0 ones, .., b ones)\r\n  cumSumInBlock.resize(b+1); \/\/ b+1 different classes in total\r\n  for (int i = 0; i < (1<<b); ++i) {\r\n    int classType = __builtin_popcount(i);\r\n    blockValToOffset[i] = indInClass[classType];\r\n    ++indInClass[classType];\r\n\r\n    \/\/ calculate cumSumInBlock\r\n    cumSumInBlock[classType].resize(nChoosek(b, classType));\r\n    cumSumInBlock[classType][blockValToOffset[i]].resize(b);\r\n    int cumsum = 0;\r\n    for (int j = 0; j < b; ++j) {\r\n      cumsum += !!(i&(1<<(b-j-1)));\r\n      cumSumInBlock[classType][blockValToOffset[i]][j] = cumsum;\r\n    }\r\n  }\r\n  \/\/ preprocessing finished\r\n\r\n  int n = bits.size();\r\n  numBlocks = (n-1)\/b+1;\r\n  numSuperblocks = (n-1)\/(b*f)+1;\r\n  blockClass.resize(numBlocks, 0);\r\n  blockOffset.resize(numBlocks);\r\n  superblockCumSum.resize(numSuperblocks);\r\n\r\n  int cumsum = 0;\r\n  int blockVal = 0;\r\n  for (int i = 0; i < numBlocks*b; ++i) {\r\n    if (isBlockStart(i)) {\r\n      blockVal = 0; \/\/ when new block starts reset block value to zero\r\n    }\r\n    \/\/ update block class and offset\r\n    int indBlock = getIndBlock(i);\r\n    blockVal = (blockVal*2) + bits[i]; \/\/ TODO: don't limit b to 32\r\n    blockOffset[indBlock] = blockValToOffset[blockVal];\r\n    blockClass[indBlock] += bits[i];\r\n\r\n    \/\/ update superblockCumSum\r\n    cumsum += bits[i];\r\n    superblockCumSum[getIndSuperblock(i)] = cumsum;\r\n  }\r\n}\r\n\r\n\/\/ time-complexity - O(b*2^b) for preprocessing\r\nRRR::RRR(vector<bool> bits) {\r\n  int b = max((int)(floor(log2(bits.size())) \/ 2), 1);\r\n  int f = max((int)(pow(floor(log2(bits.size())), 2) \/ b), 1);\r\n  construct(bits, b, f);\r\n}\r\n\r\n\/\/ time-complexity - O(b*2^b) for preprocessing\r\nRRR::RRR(vector<bool> bits, int _b, int _f) {\r\n  construct(bits, _b, _f);\r\n}\r\n\r\n\/\/ number of zeros to position i, inclusive\r\n\/\/ time-complexity - same as rank1()\r\nint RRR::rank0(int i) {\r\n  \/\/ calculate using number of ones\r\n  return i+1-rank1(i);\r\n}\r\n\r\n\/\/ number of ones to position i, inclusive\r\n\/\/ time-complexity - O(f)\r\n\/\/ TODO: convert to O(1), hint: remove looping through each block in superblock and\r\n\/\/ use cumulative sum of blocks in superblock instead\r\nint RRR::rank1(int ind) {\r\n  int indBlock = getIndBlock(ind); \/\/ block index\r\n  int indSuperblock = getIndSuperblock(ind); \/\/ superblock index\r\n\r\n  \/\/ cumulative sum of ones up to previous superblock\r\n  int counter = getCumSumToSuperblock(indSuperblock-1, true);\r\n\r\n  \/\/ add sum of ones in all blocks of current superblock up to previous block\r\n  for (int i = indSuperblock*f; i < indBlock; ++i) {\r\n    counter += blockClass[i];\r\n  }\r\n  \/\/ add number of ones in current block up to i-th position\r\n  counter += cumSumInBlock[blockClass[indBlock]][blockOffset[indBlock]][ind-indBlock*b];\r\n  return counter;\r\n}\r\n\r\n\/\/ index of the i-th zero (0-indexed)\r\n\/\/ time-complexity - same as select1()\r\nint RRR::select0(int i) {\r\n  return select(i, false);\r\n}\r\n\r\n\/\/ index of the i-th one (0-indexed)\r\n\/\/ time-complexity - O(log(n\/(b*f))+f+log(b))\r\nint RRR::select1(int i) {\r\n  return select(i, true);\r\n}\r\n\r\n\/\/ bit on given index\r\n\/\/ time-complexity - same as rank1()\r\nint RRR::access(int ind) {\r\n  return (ind > 0) ? rank1(ind)-rank1(ind-1) : rank1(ind);\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id: iodebug.cc,v 1.18 2005\/11\/14 19:03:12 sshwarts Exp $\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#include \"iodev.h\"\n#if BX_SUPPORT_IODEBUG\n\n\n\nbx_iodebug_c bx_iodebug;\nbx_iodebug_c *bx_iodebug_ptr;\n\n  struct bx_iodebug_s_type {\n    bx_bool enabled;\n    unsigned int register_select;\n    Bit32u registers[2];\n    Bit32u monitored_mem_areas_start[BX_IODEBUG_MAX_AREAS];\n    Bit32u monitored_mem_areas_end[BX_IODEBUG_MAX_AREAS];\n  } bx_iodebug_s;\n\n\n\/\/ Constructor\nbx_iodebug_c::bx_iodebug_c( void )\n{\n  put(\"IODEBUG\");\n  settype(IODEBUGLOG);\n\n}\n\n\/\/ Destructor\nbx_iodebug_c::~bx_iodebug_c( void )\n{\n}\n\nvoid bx_iodebug_c::init(void)\n{\n  int i;\n\n  DEV_register_ioread_handler(this, read_handler, 0x8A00,\"BOCHS IODEBUG\", 7);\n  DEV_register_iowrite_handler(this, write_handler, 0x8A00,\"BOCHS IODEBUG\", 7);\n  DEV_register_iowrite_handler(this, write_handler, 0x8A01,\"BOCHS IODEBUG\", 7);\n\/\/  fprintf( stderr, \"IODEBUG initialized\\n\");\n\n  bx_iodebug_s.enabled = 0;\n  bx_iodebug_s.register_select = 0;\n  for(i=0;i<BX_IODEBUG_MAX_AREAS;i++) {\n    bx_iodebug_s.monitored_mem_areas_start[i] = 0;\n    bx_iodebug_s.monitored_mem_areas_end[i] = 0;\n  }\n}\n\nvoid bx_iodebug_c::reset(unsigned type)\n{\n}\n\nBit32u bx_iodebug_c::read_handler(void *this_ptr, Bit32u addr, unsigned io_len)\n{\n  bx_iodebug_ptr = (bx_iodebug_c *) this_ptr;\n  return( bx_iodebug_ptr->read(addr, io_len) );\n}\n\nBit32u bx_iodebug_c::read( Bit32u addr, unsigned io_len )\n{\n  if(bx_iodebug_s.enabled) return(0x8A00);\n  return(0);\n}\n\n\nvoid bx_iodebug_c::write_handler(void *this_ptr, Bit32u addr, Bit32u dvalue, unsigned io_len)\n{\n  bx_iodebug_c *class_ptr = (bx_iodebug_c *) this_ptr;\n  class_ptr->write( addr, dvalue, io_len );\n}\n\n\nvoid bx_iodebug_c::write( Bit32u addr, Bit32u dvalue, unsigned int io_len )\n{\n\/\/  fprintf(stderr, \"IODEBUG addr: %4x\\tdvalue: %8x\\tio_len: %8x\\n\", (unsigned int)addr, (unsigned int)dvalue, io_len);\n\n  if( addr == 0x8A01 && io_len == 2 )\n  {\n      bx_iodebug_s.registers[bx_iodebug_s.register_select] =\n        (bx_iodebug_s.registers[bx_iodebug_s.register_select] << 16) +\n\t(dvalue & 0x0000FFFF );\n  }\n\n  if( (addr != 0x8A00) || (io_len != 2) ) return;\n\n  if( !bx_iodebug_s.enabled )\n  {\n    if( dvalue == 0x8A00 )\n    {\n      bx_iodebug_s.enabled = 1;\n\/\/      fprintf(stderr, \"IODEBUG enabled\\n\");\n      bx_iodebug_s.registers[0] = 0;\n      bx_iodebug_s.registers[1] = 0;\n    }\n    return;\n  }\n\n  switch( dvalue )\n  {\n    case( 0x8A01 ):\n      bx_iodebug_s.register_select = 0;\n\/\/      fprintf( stderr, \"IODEBUG register 0 selected\\n\");\n      break;\n\n    case( 0x8A02 ):\n      bx_iodebug_s.register_select = 1;\n\/\/      fprintf( stderr, \"IODEBUG register 1 selected\\n\");\n      break;\n\n    case( 0x8A80 ):\n      bx_iodebug_s.register_select = 0;\n      bx_iodebug_c::add_range(\n          bx_iodebug_s.registers[0],\n\t  bx_iodebug_s.registers[1]);\n      bx_iodebug_s.registers[0] = 0;\n      bx_iodebug_s.registers[1] = 0;\n      break;\n\n#if BX_DEBUGGER\n    case( 0x8AE0 ):\n      fprintf( stderr, \"request return to dbg prompt received, 0x8AE0 command (iodebug)\\n\");\n      bx_guard.interrupt_requested=1;\n      break;\n\n    case( 0x8AE2):\n      fprintf( stderr, \"request made by the guest os to disable tracing, iodebug port 0x8A00->0x8AE2\\n\");\n      BX_CPU(dbg_cpu)->trace = 0;\n      break;\n\n    case( 0x8AE3 ):\n      fprintf( stderr, \"request made by the guest os to enable tracing, iodebug port 0x8A00->0x8AE3\\n\");\n      BX_CPU(dbg_cpu)->trace = 1;\n      break;\n\n    case( 0x8AE4 ):\n      fprintf( stderr, \"request made by the guest os to disable register tracing, iodebug port 0x8A00->0x8AE4\\n\");\n      BX_CPU(dbg_cpu)->trace_reg = 0;\n      break;\n\n    case( 0x8AE5 ):\n      fprintf( stderr, \"request made by the guest os to enable register tracing, iodebug port 0x8A00->0x8AE5\\n\");\n      BX_CPU(dbg_cpu)->trace_reg = 1;\n      break;\n\n#endif\n\n    case( 0x8AFF ):\n      bx_iodebug_s.enabled = 0;\n\/\/      fprintf( stderr, \"IODEBUG device deactivated\\n\");\n\/\/      break;\n\n\/\/    default:\n\/\/      fprintf(stderr,\"IODEBUG unsupported register code\\n\");\n  }\n}\n\n\n\/\/ Static function\nvoid bx_iodebug_c::mem_write( BX_CPU_C *cpu, Bit32u addr, unsigned len, void *data)\n{\n  unsigned int area;\n  if( !bx_iodebug_s.enabled ) return;\n\n  area = bx_iodebug_c::range_test( addr, len );\n  \/\/ Device is enabled, testing address ranges\n  if( area )\n  {\n    area--;\n#if BX_DEBUGGER\n    fprintf( stdout, \"%s @ eip: %08X wrote at monitored memory location %8X\\n\", cpu->name, cpu->get_EIP(), addr);\n    bx_guard.interrupt_requested=1;\n#else\n    fprintf( stderr,\n             \"IODEBUG write to monitored memory area: %2i\\tby EIP:\\t\\t%08X\\n\\trange start: \\t\\t%08X\\trange end:\\t%08X\\n\\taddress accessed:\\t%08X\\tdata written:\\t\",\n\t     area,\n\t     cpu->get_EIP(),\n\t     bx_iodebug_s.monitored_mem_areas_start[area],\n\t     bx_iodebug_s.monitored_mem_areas_end[area],\n\t     (unsigned int)addr);\n\n    Bit32u data32 = * (Bit32u *)data;\n    Bit16u data16 = (Bit16u)data32;\n    Bit8u  data8  = (Bit8u)data32;\n\n    switch(len)\n    {\n      case(1):\n        fprintf(stderr,\"%02X\\n\", (unsigned int)data8);\n\tbreak;\n\n      case(2):\n        fprintf(stderr,\"%04X\\n\", (unsigned int)data16);\n\tbreak;\n\n      case(4):\n        fprintf(stderr,\"%08X\\n\", (unsigned int)data32);\n\tbreak;\n\n      default:\n        fprintf(stderr, \"unsupported write size\\n\");\n    }\n#endif\n  }\n}\n\nvoid bx_iodebug_c::mem_read( BX_CPU_C *cpu, Bit32u addr, unsigned len, void *data)\n{\n  unsigned int area;\n  if( !bx_iodebug_s.enabled ) return;\n\n  area = bx_iodebug_c::range_test( addr, len );\n  \/\/ Device is enabled, testing address ranges\n  if( area )\n  {\n    area--;\n#if BX_DEBUGGER\n    fprintf( stdout, \"%s @ eip: %8X wrote at monitored memory location %8X\\n\", cpu->name, cpu->get_EIP(), addr);\n    bx_guard.interrupt_requested=1;\n#else\n    fprintf( stderr,\n             \"IODEBUG read to monitored memory area: %2i\\tby EIP:\\t\\t%08X\\n\\trange start: \\t\\t%08X\\trange end:\\t%08X\\n\\taddress accessed:\\t%08X\\tdata written:\\t\",\n\t     area,\n\t     cpu->get_EIP(),\n\t     bx_iodebug_s.monitored_mem_areas_start[area],\n\t     bx_iodebug_s.monitored_mem_areas_end[area],\n\t     (unsigned int)addr);\n\n    Bit32u data32 = * (Bit32u *)data;\n    Bit16u data16 = (Bit16u)data32;\n    Bit8u  data8  = (Bit8u)data32;\n\n    switch(len)\n    {\n      case(1):\n        fprintf(stderr,\"%02X\\n\", (unsigned int)data8);\n\tbreak;\n\n      case(2):\n        fprintf(stderr,\"%04X\\n\", (unsigned int)data16);\n\tbreak;\n\n      case(4):\n        fprintf(stderr,\"%08X\\n\", (unsigned int)data32);\n\tbreak;\n\n      default:\n        fprintf(stderr, \"unsupported write size\\n\");\n    }\n#endif\n  }\n}\n\nunsigned int bx_iodebug_c::range_test( Bit32u addr, unsigned int len )\n{\n  unsigned int i;\n\n  for(i=0;i<BX_IODEBUG_MAX_AREAS;i++)\n  {\n    if( (bx_iodebug_s.monitored_mem_areas_start[i]!=0) ||\n        (bx_iodebug_s.monitored_mem_areas_end[i]!=0) )\n    {\n      if( (Bit32u)(addr+len-1) < bx_iodebug_s.monitored_mem_areas_start[i] )\n        continue;\n      if( addr < bx_iodebug_s.monitored_mem_areas_end[i] )\n      {\n        return(++i);\n      }\n    }\t\n  }\n  return(0);\n}\n\n\nvoid bx_iodebug_c::add_range( Bit32u addr_start, Bit32u addr_end )\n{\n  unsigned int i;\n  for(i=0;i<BX_IODEBUG_MAX_AREAS;i++)\n  {\n    if( !bx_iodebug_s.monitored_mem_areas_start[i] &&\n        !bx_iodebug_s.monitored_mem_areas_end[i] )\n    {\n\tbx_iodebug_s.monitored_mem_areas_start[i] = addr_start;\n\tbx_iodebug_s.monitored_mem_areas_end[i] = addr_end;\n\/\/\tfprintf(stderr, \"IODEBUG added range successfully in slot: %i\\n\",i);\n\treturn;\n    }\n  }\n\/\/  fprintf(stderr, \"IODEBUG unable to register memory range, all slots taken\\n\");\n}\n\n#endif \/* if BX_SUPPORT_IODEBUG *\/\n<commit_msg>Fix get_EIP references in iodebug<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id: iodebug.cc,v 1.19 2005\/11\/29 17:38:57 sshwarts Exp $\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#include \"iodev.h\"\n#if BX_SUPPORT_IODEBUG\n\n\n\nbx_iodebug_c bx_iodebug;\nbx_iodebug_c *bx_iodebug_ptr;\n\n  struct bx_iodebug_s_type {\n    bx_bool enabled;\n    unsigned int register_select;\n    Bit32u registers[2];\n    Bit32u monitored_mem_areas_start[BX_IODEBUG_MAX_AREAS];\n    Bit32u monitored_mem_areas_end[BX_IODEBUG_MAX_AREAS];\n  } bx_iodebug_s;\n\n\n\/\/ Constructor\nbx_iodebug_c::bx_iodebug_c( void )\n{\n  put(\"IODEBUG\");\n  settype(IODEBUGLOG);\n\n}\n\n\/\/ Destructor\nbx_iodebug_c::~bx_iodebug_c( void )\n{\n}\n\nvoid bx_iodebug_c::init(void)\n{\n  int i;\n\n  DEV_register_ioread_handler(this, read_handler, 0x8A00,\"BOCHS IODEBUG\", 7);\n  DEV_register_iowrite_handler(this, write_handler, 0x8A00,\"BOCHS IODEBUG\", 7);\n  DEV_register_iowrite_handler(this, write_handler, 0x8A01,\"BOCHS IODEBUG\", 7);\n\/\/  fprintf( stderr, \"IODEBUG initialized\\n\");\n\n  bx_iodebug_s.enabled = 0;\n  bx_iodebug_s.register_select = 0;\n  for(i=0;i<BX_IODEBUG_MAX_AREAS;i++) {\n    bx_iodebug_s.monitored_mem_areas_start[i] = 0;\n    bx_iodebug_s.monitored_mem_areas_end[i] = 0;\n  }\n}\n\nvoid bx_iodebug_c::reset(unsigned type)\n{\n}\n\nBit32u bx_iodebug_c::read_handler(void *this_ptr, Bit32u addr, unsigned io_len)\n{\n  bx_iodebug_ptr = (bx_iodebug_c *) this_ptr;\n  return( bx_iodebug_ptr->read(addr, io_len) );\n}\n\nBit32u bx_iodebug_c::read( Bit32u addr, unsigned io_len )\n{\n  if(bx_iodebug_s.enabled) return(0x8A00);\n  return(0);\n}\n\n\nvoid bx_iodebug_c::write_handler(void *this_ptr, Bit32u addr, Bit32u dvalue, unsigned io_len)\n{\n  bx_iodebug_c *class_ptr = (bx_iodebug_c *) this_ptr;\n  class_ptr->write( addr, dvalue, io_len );\n}\n\n\nvoid bx_iodebug_c::write( Bit32u addr, Bit32u dvalue, unsigned int io_len )\n{\n\/\/  fprintf(stderr, \"IODEBUG addr: %4x\\tdvalue: %8x\\tio_len: %8x\\n\", (unsigned int)addr, (unsigned int)dvalue, io_len);\n\n  if( addr == 0x8A01 && io_len == 2 )\n  {\n      bx_iodebug_s.registers[bx_iodebug_s.register_select] =\n        (bx_iodebug_s.registers[bx_iodebug_s.register_select] << 16) +\n\t(dvalue & 0x0000FFFF );\n  }\n\n  if( (addr != 0x8A00) || (io_len != 2) ) return;\n\n  if( !bx_iodebug_s.enabled )\n  {\n    if( dvalue == 0x8A00 )\n    {\n      bx_iodebug_s.enabled = 1;\n\/\/      fprintf(stderr, \"IODEBUG enabled\\n\");\n      bx_iodebug_s.registers[0] = 0;\n      bx_iodebug_s.registers[1] = 0;\n    }\n    return;\n  }\n\n  switch( dvalue )\n  {\n    case( 0x8A01 ):\n      bx_iodebug_s.register_select = 0;\n\/\/      fprintf( stderr, \"IODEBUG register 0 selected\\n\");\n      break;\n\n    case( 0x8A02 ):\n      bx_iodebug_s.register_select = 1;\n\/\/      fprintf( stderr, \"IODEBUG register 1 selected\\n\");\n      break;\n\n    case( 0x8A80 ):\n      bx_iodebug_s.register_select = 0;\n      bx_iodebug_c::add_range(\n          bx_iodebug_s.registers[0],\n\t  bx_iodebug_s.registers[1]);\n      bx_iodebug_s.registers[0] = 0;\n      bx_iodebug_s.registers[1] = 0;\n      break;\n\n#if BX_DEBUGGER\n    case( 0x8AE0 ):\n      fprintf( stderr, \"request return to dbg prompt received, 0x8AE0 command (iodebug)\\n\");\n      bx_guard.interrupt_requested=1;\n      break;\n\n    case( 0x8AE2):\n      fprintf( stderr, \"request made by the guest os to disable tracing, iodebug port 0x8A00->0x8AE2\\n\");\n      BX_CPU(dbg_cpu)->trace = 0;\n      break;\n\n    case( 0x8AE3 ):\n      fprintf( stderr, \"request made by the guest os to enable tracing, iodebug port 0x8A00->0x8AE3\\n\");\n      BX_CPU(dbg_cpu)->trace = 1;\n      break;\n\n    case( 0x8AE4 ):\n      fprintf( stderr, \"request made by the guest os to disable register tracing, iodebug port 0x8A00->0x8AE4\\n\");\n      BX_CPU(dbg_cpu)->trace_reg = 0;\n      break;\n\n    case( 0x8AE5 ):\n      fprintf( stderr, \"request made by the guest os to enable register tracing, iodebug port 0x8A00->0x8AE5\\n\");\n      BX_CPU(dbg_cpu)->trace_reg = 1;\n      break;\n\n#endif\n\n    case( 0x8AFF ):\n      bx_iodebug_s.enabled = 0;\n\/\/      fprintf( stderr, \"IODEBUG device deactivated\\n\");\n\/\/      break;\n\n\/\/    default:\n\/\/      fprintf(stderr,\"IODEBUG unsupported register code\\n\");\n  }\n}\n\n\n\/\/ Static function\nvoid bx_iodebug_c::mem_write( BX_CPU_C *cpu, Bit32u addr, unsigned len, void *data)\n{\n  unsigned int area;\n  if( !bx_iodebug_s.enabled ) return;\n\n  area = bx_iodebug_c::range_test( addr, len );\n  \/\/ Device is enabled, testing address ranges\n  if( area )\n  {\n    area--;\n#if BX_DEBUGGER\n    fprintf( stdout, \"%s @ eip: \" FMT_ADDRX \" wrote at monitored memory location %8X\\n\", cpu->name, cpu->get_ip(), addr);\n    bx_guard.interrupt_requested=1;\n#else\n    fprintf( stderr,\n             \"IODEBUG write to monitored memory area: %2i\\tby EIP:\\t\\t\" FMT_ADDRX \"\\n\\trange start: \\t\\t%08X\\trange end:\\t%08X\\n\\taddress accessed:\\t%08X\\tdata written:\\t\",\n\t     area,\n\t     cpu->get_ip(),\n\t     bx_iodebug_s.monitored_mem_areas_start[area],\n\t     bx_iodebug_s.monitored_mem_areas_end[area],\n\t     (unsigned int)addr);\n\n    Bit32u data32 = * (Bit32u *)data;\n    Bit16u data16 = (Bit16u)data32;\n    Bit8u  data8  = (Bit8u)data32;\n\n    switch(len)\n    {\n      case(1):\n        fprintf(stderr,\"%02X\\n\", (unsigned int)data8);\n\tbreak;\n\n      case(2):\n        fprintf(stderr,\"%04X\\n\", (unsigned int)data16);\n\tbreak;\n\n      case(4):\n        fprintf(stderr,\"%08X\\n\", (unsigned int)data32);\n\tbreak;\n\n      default:\n        fprintf(stderr, \"unsupported write size\\n\");\n    }\n#endif\n  }\n}\n\nvoid bx_iodebug_c::mem_read( BX_CPU_C *cpu, Bit32u addr, unsigned len, void *data)\n{\n  unsigned int area;\n  if( !bx_iodebug_s.enabled ) return;\n\n  area = bx_iodebug_c::range_test( addr, len );\n  \/\/ Device is enabled, testing address ranges\n  if( area )\n  {\n    area--;\n#if BX_DEBUGGER\n    fprintf( stdout, \"%s @ eip: \" FMT_ADDRX \" wrote at monitored memory location %8X\\n\", cpu->name, cpu->get_ip(), addr);\n    bx_guard.interrupt_requested=1;\n#else\n    fprintf( stderr,\n             \"IODEBUG read to monitored memory area: %2i\\tby EIP:\\t\\t\" FMT_ADDRX \"\\n\\trange start: \\t\\t%08X\\trange end:\\t%08X\\n\\taddress accessed:\\t%08X\\tdata written:\\t\",\n\t     area,\n\t     cpu->get_ip(),\n\t     bx_iodebug_s.monitored_mem_areas_start[area],\n\t     bx_iodebug_s.monitored_mem_areas_end[area],\n\t     (unsigned int)addr);\n\n    Bit32u data32 = * (Bit32u *)data;\n    Bit16u data16 = (Bit16u)data32;\n    Bit8u  data8  = (Bit8u)data32;\n\n    switch(len)\n    {\n      case(1):\n        fprintf(stderr,\"%02X\\n\", (unsigned int)data8);\n\tbreak;\n\n      case(2):\n        fprintf(stderr,\"%04X\\n\", (unsigned int)data16);\n\tbreak;\n\n      case(4):\n        fprintf(stderr,\"%08X\\n\", (unsigned int)data32);\n\tbreak;\n\n      default:\n        fprintf(stderr, \"unsupported write size\\n\");\n    }\n#endif\n  }\n}\n\nunsigned int bx_iodebug_c::range_test( Bit32u addr, unsigned int len )\n{\n  unsigned int i;\n\n  for(i=0;i<BX_IODEBUG_MAX_AREAS;i++)\n  {\n    if( (bx_iodebug_s.monitored_mem_areas_start[i]!=0) ||\n        (bx_iodebug_s.monitored_mem_areas_end[i]!=0) )\n    {\n      if( (Bit32u)(addr+len-1) < bx_iodebug_s.monitored_mem_areas_start[i] )\n        continue;\n      if( addr < bx_iodebug_s.monitored_mem_areas_end[i] )\n      {\n        return(++i);\n      }\n    }\t\n  }\n  return(0);\n}\n\n\nvoid bx_iodebug_c::add_range( Bit32u addr_start, Bit32u addr_end )\n{\n  unsigned int i;\n  for(i=0;i<BX_IODEBUG_MAX_AREAS;i++)\n  {\n    if( !bx_iodebug_s.monitored_mem_areas_start[i] &&\n        !bx_iodebug_s.monitored_mem_areas_end[i] )\n    {\n\tbx_iodebug_s.monitored_mem_areas_start[i] = addr_start;\n\tbx_iodebug_s.monitored_mem_areas_end[i] = addr_end;\n\/\/\tfprintf(stderr, \"IODEBUG added range successfully in slot: %i\\n\",i);\n\treturn;\n    }\n  }\n\/\/  fprintf(stderr, \"IODEBUG unable to register memory range, all slots taken\\n\");\n}\n\n#endif \/* if BX_SUPPORT_IODEBUG *\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity#704703 Dereference after null check<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: textToPronounce_zh.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 04:49:52 $\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\/\/ prevent internal compiler error with MSVC6SP3\n#include <utility>\n\n#include <rtl\/string.hxx>\n#include <rtl\/ustrbuf.hxx>\n#define TRANSLITERATION_ALL\n#include <textToPronounce_zh.hxx>\n\nusing namespace com::sun::star::uno;\nusing namespace rtl;\n\nnamespace com { namespace sun { namespace star { namespace i18n {\n\nsal_Int16 SAL_CALL TextToPronounce_zh::getType() throw (RuntimeException)\n{\n    return TransliterationType::ONE_TO_ONE| TransliterationType::IGNORE;\n}\n\nconst sal_Unicode* SAL_CALL\nTextToPronounce_zh::getPronounce(const sal_Unicode ch)\n{\n    static const sal_Unicode emptyString[]={0};\n    if (idx) {\n        sal_uInt16 address = idx[0][ch>>8];\n        if (address != 0xFFFF)\n            return &idx[2][idx[1][address + (ch & 0xFF)]];\n    }\n    return emptyString;\n}\n\nOUString SAL_CALL\nTextToPronounce_zh::folding(const OUString & inStr, sal_Int32 startPos,\n        sal_Int32 nCount, Sequence< sal_Int32 > & offset) throw (RuntimeException)\n{\n    OUStringBuffer sb;\n    const sal_Unicode * chArr = inStr.getStr() + startPos;\n\n    if (startPos < 0)\n        throw RuntimeException();\n\n    if (startPos + nCount > inStr.getLength())\n        nCount = inStr.getLength() - startPos;\n\n    offset[0] = 0;\n    for (sal_Int32 i = 0; i < nCount; i++) {\n        OUString pron(getPronounce(chArr[i]));\n        sb.append(pron);\n\n        if (useOffset)\n            offset[i + 1] = offset[i] + pron.getLength();\n    }\n    return sb.makeStringAndClear();\n}\n\nOUString SAL_CALL\nTextToPronounce_zh::transliterateChar2String( sal_Unicode inChar) throw(RuntimeException)\n{\n    return OUString(getPronounce(inChar));\n}\n\nsal_Unicode SAL_CALL\nTextToPronounce_zh::transliterateChar2Char( sal_Unicode inChar) throw(RuntimeException, MultipleCharsOutputException)\n{\n    const sal_Unicode* pron=getPronounce(inChar);\n    if (!pron || !pron[0])\n        return 0;\n    if (pron[1])\n        throw MultipleCharsOutputException();\n    return *pron;\n}\n\nsal_Bool SAL_CALL\nTextToPronounce_zh::equals( const OUString & str1, sal_Int32 pos1, sal_Int32 nCount1, sal_Int32 & nMatch1,\n        const OUString & str2, sal_Int32 pos2, sal_Int32 nCount2, sal_Int32 & nMatch2)\n        throw (RuntimeException)\n{\n    sal_Int32 realCount;\n    int i;  \/\/ loop variable\n    const sal_Unicode * s1, * s2;\n    const sal_Unicode *pron1, *pron2;\n\n    if (nCount1 + pos1 > str1.getLength())\n        nCount1 = str1.getLength() - pos1;\n\n    if (nCount2 + pos2 > str2.getLength())\n        nCount2 = str2.getLength() - pos2;\n\n    realCount = ((nCount1 > nCount2) ? nCount2 : nCount1);\n\n    s1 = str1.getStr() + pos1;\n    s2 = str2.getStr() + pos2;\n    for (i = 0; i < realCount; i++) {\n        pron1=getPronounce(*s1++);\n        pron2=getPronounce(*s2++);\n        if (pron1 != pron2) {\n            nMatch1 = nMatch2 = i;\n            return sal_False;\n        }\n    }\n    nMatch1 = nMatch2 = realCount;\n    return (nCount1 == nCount2);\n}\n\nTextToPinyin_zh_CN::TextToPinyin_zh_CN() : TextToPronounce_zh(\"get_zh_pinyin\")\n{\n        transliterationName = \"ChineseCharacterToPinyin\";\n        implementationName = \"com.sun.star.i18n.Transliteration.TextToPinyin_zh_CN\";\n}\n\nTextToChuyin_zh_TW::TextToChuyin_zh_TW() : TextToPronounce_zh(\"get_zh_zhuyin\")\n{\n        transliterationName = \"ChineseCharacterToChuyin\";\n        implementationName = \"com.sun.star.i18n.Transliteration.TextToChuyin_zh_TW\";\n}\n\nTextToPronounce_zh::TextToPronounce_zh(const sal_Char* func_name)\n{\n#ifdef SAL_DLLPREFIX\n    OUString lib=OUString::createFromAscii(SAL_DLLPREFIX\"index_data\"SAL_DLLEXTENSION);\n#else\n    OUString lib=OUString::createFromAscii(\"index_data\"SAL_DLLEXTENSION);\n#endif\n    hModule = osl_loadModule( lib.pData, SAL_LOADMODULE_DEFAULT );\n    idx=NULL;\n    if (hModule) {\n        sal_uInt16** (*function)() = (sal_uInt16** (*)()) osl_getFunctionSymbol(hModule, OUString::createFromAscii(func_name).pData);\n        if (function)\n            idx=function();\n    }\n}\nTextToPronounce_zh::~TextToPronounce_zh()\n{\n    if (hModule) osl_unloadModule(hModule);\n}\n} } } }\n<commit_msg>INTEGRATION: CWS pchfix02 (1.10.16); FILE MERGED 2006\/09\/01 17:30:54 kaib 1.10.16.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: textToPronounce_zh.cxx,v $\n *\n *  $Revision: 1.11 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 09:31: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_i18npool.hxx\"\n\n\/\/ prevent internal compiler error with MSVC6SP3\n#include <utility>\n\n#include <rtl\/string.hxx>\n#include <rtl\/ustrbuf.hxx>\n#define TRANSLITERATION_ALL\n#include <textToPronounce_zh.hxx>\n\nusing namespace com::sun::star::uno;\nusing namespace rtl;\n\nnamespace com { namespace sun { namespace star { namespace i18n {\n\nsal_Int16 SAL_CALL TextToPronounce_zh::getType() throw (RuntimeException)\n{\n    return TransliterationType::ONE_TO_ONE| TransliterationType::IGNORE;\n}\n\nconst sal_Unicode* SAL_CALL\nTextToPronounce_zh::getPronounce(const sal_Unicode ch)\n{\n    static const sal_Unicode emptyString[]={0};\n    if (idx) {\n        sal_uInt16 address = idx[0][ch>>8];\n        if (address != 0xFFFF)\n            return &idx[2][idx[1][address + (ch & 0xFF)]];\n    }\n    return emptyString;\n}\n\nOUString SAL_CALL\nTextToPronounce_zh::folding(const OUString & inStr, sal_Int32 startPos,\n        sal_Int32 nCount, Sequence< sal_Int32 > & offset) throw (RuntimeException)\n{\n    OUStringBuffer sb;\n    const sal_Unicode * chArr = inStr.getStr() + startPos;\n\n    if (startPos < 0)\n        throw RuntimeException();\n\n    if (startPos + nCount > inStr.getLength())\n        nCount = inStr.getLength() - startPos;\n\n    offset[0] = 0;\n    for (sal_Int32 i = 0; i < nCount; i++) {\n        OUString pron(getPronounce(chArr[i]));\n        sb.append(pron);\n\n        if (useOffset)\n            offset[i + 1] = offset[i] + pron.getLength();\n    }\n    return sb.makeStringAndClear();\n}\n\nOUString SAL_CALL\nTextToPronounce_zh::transliterateChar2String( sal_Unicode inChar) throw(RuntimeException)\n{\n    return OUString(getPronounce(inChar));\n}\n\nsal_Unicode SAL_CALL\nTextToPronounce_zh::transliterateChar2Char( sal_Unicode inChar) throw(RuntimeException, MultipleCharsOutputException)\n{\n    const sal_Unicode* pron=getPronounce(inChar);\n    if (!pron || !pron[0])\n        return 0;\n    if (pron[1])\n        throw MultipleCharsOutputException();\n    return *pron;\n}\n\nsal_Bool SAL_CALL\nTextToPronounce_zh::equals( const OUString & str1, sal_Int32 pos1, sal_Int32 nCount1, sal_Int32 & nMatch1,\n        const OUString & str2, sal_Int32 pos2, sal_Int32 nCount2, sal_Int32 & nMatch2)\n        throw (RuntimeException)\n{\n    sal_Int32 realCount;\n    int i;  \/\/ loop variable\n    const sal_Unicode * s1, * s2;\n    const sal_Unicode *pron1, *pron2;\n\n    if (nCount1 + pos1 > str1.getLength())\n        nCount1 = str1.getLength() - pos1;\n\n    if (nCount2 + pos2 > str2.getLength())\n        nCount2 = str2.getLength() - pos2;\n\n    realCount = ((nCount1 > nCount2) ? nCount2 : nCount1);\n\n    s1 = str1.getStr() + pos1;\n    s2 = str2.getStr() + pos2;\n    for (i = 0; i < realCount; i++) {\n        pron1=getPronounce(*s1++);\n        pron2=getPronounce(*s2++);\n        if (pron1 != pron2) {\n            nMatch1 = nMatch2 = i;\n            return sal_False;\n        }\n    }\n    nMatch1 = nMatch2 = realCount;\n    return (nCount1 == nCount2);\n}\n\nTextToPinyin_zh_CN::TextToPinyin_zh_CN() : TextToPronounce_zh(\"get_zh_pinyin\")\n{\n        transliterationName = \"ChineseCharacterToPinyin\";\n        implementationName = \"com.sun.star.i18n.Transliteration.TextToPinyin_zh_CN\";\n}\n\nTextToChuyin_zh_TW::TextToChuyin_zh_TW() : TextToPronounce_zh(\"get_zh_zhuyin\")\n{\n        transliterationName = \"ChineseCharacterToChuyin\";\n        implementationName = \"com.sun.star.i18n.Transliteration.TextToChuyin_zh_TW\";\n}\n\nTextToPronounce_zh::TextToPronounce_zh(const sal_Char* func_name)\n{\n#ifdef SAL_DLLPREFIX\n    OUString lib=OUString::createFromAscii(SAL_DLLPREFIX\"index_data\"SAL_DLLEXTENSION);\n#else\n    OUString lib=OUString::createFromAscii(\"index_data\"SAL_DLLEXTENSION);\n#endif\n    hModule = osl_loadModule( lib.pData, SAL_LOADMODULE_DEFAULT );\n    idx=NULL;\n    if (hModule) {\n        sal_uInt16** (*function)() = (sal_uInt16** (*)()) osl_getFunctionSymbol(hModule, OUString::createFromAscii(func_name).pData);\n        if (function)\n            idx=function();\n    }\n}\nTextToPronounce_zh::~TextToPronounce_zh()\n{\n    if (hModule) osl_unloadModule(hModule);\n}\n} } } }\n<|endoftext|>"}
{"text":"<commit_before>\/\/ HTTP request writing response to a file.\n\/\/\n\/\/ Copyright (C) 2013  Thomas Geymayer <tomgey@gmail.com>\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 Software\n\/\/ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301, USA\n\n#include \"HTTPFileRequest.hxx\"\n#include <simgear\/debug\/logstream.hxx>\n\nnamespace simgear\n{\nnamespace HTTP\n{\n\n  \/\/----------------------------------------------------------------------------\n  FileRequest::FileRequest(const std::string& url, const std::string& path):\n    Request(url, \"GET\"),\n    _filename(path)\n  {\n\n  }\n\n  \/\/----------------------------------------------------------------------------\n  void FileRequest::responseHeadersComplete()\n  {\n    Request::responseHeadersComplete();\n\n    if( !_filename.empty() )\n      \/\/ TODO validate path? (would require to expose fgValidatePath somehow to\n      \/\/      simgear)\n      _file.open(_filename.c_str(), std::ios::binary | std::ios::trunc);\n\n    if( !_file )\n    {\n      SG_LOG\n      (\n        SG_IO,\n        SG_WARN,\n        \"HTTP::FileRequest: failed to open file '\" << _filename << \"'\"\n      );\n\n      abort(\"Failed to open file.\");\n    }\n  }\n\n  \/\/----------------------------------------------------------------------------\n  void FileRequest::gotBodyData(const char* s, int n)\n  {\n    if( !_file )\n    {\n      SG_LOG\n      (\n        SG_IO,\n        SG_WARN,\n        \"HTTP::FileRequest: error writing to '\" << _filename << \"'\"\n      );\n      return;\n    }\n\n    _file.write(s, n);\n  }\n\n  \/\/----------------------------------------------------------------------------\n  void FileRequest::onAlways()\n  {\n    _file.close();\n  }\n\n} \/\/ namespace HTTP\n} \/\/ namespace simgear\n<commit_msg>HTTPFileRequest: create directory if it does not exist<commit_after>\/\/ HTTP request writing response to a file.\n\/\/\n\/\/ Copyright (C) 2013  Thomas Geymayer <tomgey@gmail.com>\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 Software\n\/\/ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301, USA\n\n#include \"HTTPFileRequest.hxx\"\n#include <simgear\/debug\/logstream.hxx>\n#include <simgear\/misc\/sg_path.hxx>\n\nnamespace simgear\n{\nnamespace HTTP\n{\n\n  \/\/----------------------------------------------------------------------------\n  FileRequest::FileRequest(const std::string& url, const std::string& path):\n    Request(url, \"GET\"),\n    _filename(path)\n  {\n\n  }\n\n  \/\/----------------------------------------------------------------------------\n  void FileRequest::responseHeadersComplete()\n  {\n    Request::responseHeadersComplete();\n\n    if( !_filename.empty() )\n    {\n      \/\/ TODO validate path? (would require to expose fgValidatePath somehow to\n      \/\/      simgear)\n      SGPath path(_filename);\n      path.create_dir(0777);\n\n      _file.open(_filename.c_str(), std::ios::binary | std::ios::trunc);\n    }\n\n    if( !_file )\n    {\n      SG_LOG\n      (\n        SG_IO,\n        SG_WARN,\n        \"HTTP::FileRequest: failed to open file '\" << _filename << \"'\"\n      );\n\n      abort(\"Failed to open file.\");\n    }\n  }\n\n  \/\/----------------------------------------------------------------------------\n  void FileRequest::gotBodyData(const char* s, int n)\n  {\n    if( !_file )\n    {\n      SG_LOG\n      (\n        SG_IO,\n        SG_WARN,\n        \"HTTP::FileRequest: error writing to '\" << _filename << \"'\"\n      );\n      return;\n    }\n\n    _file.write(s, n);\n  }\n\n  \/\/----------------------------------------------------------------------------\n  void FileRequest::onAlways()\n  {\n    _file.close();\n  }\n\n} \/\/ namespace HTTP\n} \/\/ namespace simgear\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n    filename:   SimpleTimer.cpp\n    created:    Sat Feb 18 2012\n    author:     Paul D Turner <paul@cegui.org.uk>\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2012 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\/SimpleTimer.h\"\n\n#if (defined(__WIN32__) || defined(_WIN32)) && (not defined __MINGW32__)\n#include <windows.h>\ndouble CEGUI::SimpleTimer::currentTime()\n{\n    return timeGetTime() \/ 1000.0;\n}\n\n#elif defined(__linux__) || defined(__APPLE__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__HAIKU__) || defined(__CYGWIN__) || defined(__MINGW32__)\n#include <sys\/time.h>\ndouble CEGUI::SimpleTimer::currentTime()\n{\n    timeval timeStructure;\n    gettimeofday(&timeStructure, 0);\n    return timeStructure.tv_sec + timeStructure.tv_usec \/ 1000000.0;\n}\n#else\n#error \"SimpleTimer not available for this platform, please implement it\"\n#endif\n<commit_msg>FIX: Fixed directive in merged pull request<commit_after>\/***********************************************************************\n    filename:   SimpleTimer.cpp\n    created:    Sat Feb 18 2012\n    author:     Paul D Turner <paul@cegui.org.uk>\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2012 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\/SimpleTimer.h\"\n\n#if (defined(__WIN32__) || defined(_WIN32) ) && (!defined __MINGW32__)\n#include <windows.h>\ndouble CEGUI::SimpleTimer::currentTime()\n{\n    return timeGetTime() \/ 1000.0;\n}\n\n#elif defined(__linux__) || defined(__APPLE__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__HAIKU__) || defined(__CYGWIN__) || defined(__MINGW32__)\n#include <sys\/time.h>\ndouble CEGUI::SimpleTimer::currentTime()\n{\n    timeval timeStructure;\n    gettimeofday(&timeStructure, 0);\n    return timeStructure.tv_sec + timeStructure.tv_usec \/ 1000000.0;\n}\n#else\n#error \"SimpleTimer not available for this platform, please implement it\"\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n\tfilename: \tUndoHandler.cpp\n\tcreated:\t15\/07\/2013\n\tauthor:\t\tErihel\n\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\/UndoHandler.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Constructor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nUndoHandler::UndoHandler(Window *window) :\n    d_undoLimit(10),\n    d_undoPosition(-1),\n    d_lastUndo(true)\n{\n    d_attachedWindow = window;\n}\n\n\/*************************************************************************\n    Undo\/Redo\n*************************************************************************\/\nbool UndoHandler::undo(size_t &cursor)\n{\n    if (!d_attachedWindow)\n        return false;\n\n    if (canUndo())\n    {\n        if (d_undoPosition < d_undoList.size())\n        {\n            UndoAction &action = d_undoList[d_undoPosition--];\n\n            String newText = d_attachedWindow->getText();\n            if (action.d_type == UAT_INSERT)\n            {\n                newText.erase(action.d_startIdx, action.d_text.length());\n                cursor = action.d_startIdx;\n            }\n            else\n            {\n                newText.insert(action.d_startIdx, action.d_text);\n                cursor = action.d_startIdx + action.d_text.length();\n            }\n            d_attachedWindow->setText(newText);\n            d_lastUndo = true;\n            return true;\n        }\n    }\n    return false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool UndoHandler::redo(size_t &cursor)\n{\n    if (!d_attachedWindow)\n        return false;\n\n    if (canRedo())\n    {\n        UndoAction &action = d_undoList[++d_undoPosition];\n\n        String newText = d_attachedWindow->getText();\n        if (action.d_type == UAT_INSERT)\n        {\n            newText.insert(action.d_startIdx, action.d_text);\n            cursor = action.d_startIdx + action.d_text.length();\n        }\n        else\n        {\n            newText.erase(action.d_startIdx, action.d_text.length());\n            cursor = action.d_startIdx;\n        }\n        d_attachedWindow->setText(newText);\n        d_lastUndo = false;\n        return true;\n    }\n    return false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid UndoHandler::setUndoLimit(int limit)\n{\n    if (limit < 0)\n    {\n        CEGUI_THROW(InvalidRequestException(\"Invalid undo limit. Limit cannot be less then zero.\"));\n    }\n\n    d_undoLimit = limit;\n\n    while (d_undoList.size() > d_undoLimit)\n        d_undoList.pop_front();\n\n    d_undoPosition = d_undoList.size() - 1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid UndoHandler::addUndoHistory(UndoAction &action)\n{\n    \/\/ discard all actions that are after our current position in undo list\n    while (d_undoList.size() > 0 && d_undoPosition < static_cast<int>(d_undoList.size()) - 1)\n        d_undoList.pop_back();\n\n    if (d_undoList.size() > d_undoLimit)\n        d_undoList.pop_front();\n\n    d_undoList.push_back(action);\n    d_undoPosition = d_undoList.size() - 1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid UndoHandler::clearUndoHistory()\n{\n    d_undoList.clear();\n    d_undoPosition = -1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nsize_t UndoHandler::count()\n{\n    return d_undoList.size();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool UndoHandler::canUndo()\n{\n    return (d_undoList.size() > 0 && d_undoPosition >= 0);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool UndoHandler::canRedo()\n{\n    return (d_undoList.size() > 0 && d_undoPosition < static_cast<int>(d_undoList.size()) - 1);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nUndoHandler::UndoAction UndoHandler::getLastAction()\n{\n    UndoAction lastAction;\n\n    if (d_lastUndo)\n    {\n        if (d_undoPosition == d_undoList.size() - 1)\n            lastAction = d_undoList[d_undoPosition];\n        else\n            lastAction = d_undoList[d_undoPosition + 1];\n    }\n    else\n    {\n        if (d_undoPosition <= 0)\n            lastAction = d_undoList[0];\n        else\n            lastAction = d_undoList[d_undoPosition];\n    }\n    return lastAction;\n}\n\n} \/\/ End of  CEGUI namespace section\n\n<commit_msg>MOD: Removed warning<commit_after>\/***********************************************************************\n\tfilename: \tUndoHandler.cpp\n\tcreated:\t15\/07\/2013\n\tauthor:\t\tErihel\n\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\/UndoHandler.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Constructor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nUndoHandler::UndoHandler(Window *window) :\n    d_undoLimit(10),\n    d_undoPosition(-1),\n    d_lastUndo(true)\n{\n    d_attachedWindow = window;\n}\n\n\/*************************************************************************\n    Undo\/Redo\n*************************************************************************\/\nbool UndoHandler::undo(size_t &cursor)\n{\n    if (!d_attachedWindow)\n        return false;\n\n    if (canUndo())\n    {\n        if (static_cast<size_t>(d_undoPosition) < d_undoList.size())\n        {\n            UndoAction &action = d_undoList[d_undoPosition--];\n\n            String newText = d_attachedWindow->getText();\n            if (action.d_type == UAT_INSERT)\n            {\n                newText.erase(action.d_startIdx, action.d_text.length());\n                cursor = action.d_startIdx;\n            }\n            else\n            {\n                newText.insert(action.d_startIdx, action.d_text);\n                cursor = action.d_startIdx + action.d_text.length();\n            }\n            d_attachedWindow->setText(newText);\n            d_lastUndo = true;\n            return true;\n        }\n    }\n    return false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool UndoHandler::redo(size_t &cursor)\n{\n    if (!d_attachedWindow)\n        return false;\n\n    if (canRedo())\n    {\n        UndoAction &action = d_undoList[++d_undoPosition];\n\n        String newText = d_attachedWindow->getText();\n        if (action.d_type == UAT_INSERT)\n        {\n            newText.insert(action.d_startIdx, action.d_text);\n            cursor = action.d_startIdx + action.d_text.length();\n        }\n        else\n        {\n            newText.erase(action.d_startIdx, action.d_text.length());\n            cursor = action.d_startIdx;\n        }\n        d_attachedWindow->setText(newText);\n        d_lastUndo = false;\n        return true;\n    }\n    return false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid UndoHandler::setUndoLimit(int limit)\n{\n    if (limit < 0)\n    {\n        CEGUI_THROW(InvalidRequestException(\"Invalid undo limit. Limit cannot be less then zero.\"));\n    }\n\n    d_undoLimit = limit;\n\n    while (d_undoList.size() > d_undoLimit)\n        d_undoList.pop_front();\n\n    d_undoPosition = d_undoList.size() - 1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid UndoHandler::addUndoHistory(UndoAction &action)\n{\n    \/\/ discard all actions that are after our current position in undo list\n    while (d_undoList.size() > 0 && d_undoPosition < static_cast<int>(d_undoList.size()) - 1)\n        d_undoList.pop_back();\n\n    if (d_undoList.size() > d_undoLimit)\n        d_undoList.pop_front();\n\n    d_undoList.push_back(action);\n    d_undoPosition = d_undoList.size() - 1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid UndoHandler::clearUndoHistory()\n{\n    d_undoList.clear();\n    d_undoPosition = -1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nsize_t UndoHandler::count()\n{\n    return d_undoList.size();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool UndoHandler::canUndo()\n{\n    return (d_undoList.size() > 0 && d_undoPosition >= 0);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool UndoHandler::canRedo()\n{\n    return (d_undoList.size() > 0 && d_undoPosition < static_cast<int>(d_undoList.size()) - 1);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nUndoHandler::UndoAction UndoHandler::getLastAction()\n{\n    UndoAction lastAction;\n\n    if (d_lastUndo)\n    {\n        if (d_undoPosition == d_undoList.size() - 1)\n            lastAction = d_undoList[d_undoPosition];\n        else\n            lastAction = d_undoList[d_undoPosition + 1];\n    }\n    else\n    {\n        if (d_undoPosition <= 0)\n            lastAction = d_undoList[0];\n        else\n            lastAction = d_undoList[d_undoPosition];\n    }\n    return lastAction;\n}\n\n} \/\/ End of  CEGUI namespace section\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\n#include <cppuhelper\/compbase1.hxx>\n#include <cppuhelper\/bootstrap.hxx>\n#include <cppuhelper\/basemutex.hxx>\n#include <com\/sun\/star\/i18n\/XCharacterClassification.hpp>\n#include <unotest\/bootstrapfixturebase.hxx>\n\n#include <rtl\/strbuf.hxx>\n#include <rtl\/ustrbuf.hxx>\n\n#include <string.h>\n\nusing namespace ::com::sun::star;\n\nclass TestCharacterClassification : public test::BootstrapFixtureBase\n{\npublic:\n    virtual void setUp();\n    virtual void tearDown();\n\n    void testTitleCase();\n\n    CPPUNIT_TEST_SUITE(TestCharacterClassification);\n    CPPUNIT_TEST(testTitleCase);\n    CPPUNIT_TEST_SUITE_END();\nprivate:\n    uno::Reference<i18n::XCharacterClassification> m_xCC;\n};\n\n\/\/A test to ensure that our Title Case functionality is working\n\/\/http:\/\/lists.freedesktop.org\/archives\/libreoffice\/2012-June\/032767.html\n\/\/https:\/\/issues.apache.org\/ooo\/show_bug.cgi?id=30863\nvoid TestCharacterClassification::testTitleCase()\n{\n    lang::Locale aLocale;\n    aLocale.Language = OUString(\"en\");\n    aLocale.Country = OUString(\"US\");\n\n    {\n        \/\/basic example\n        OUString sTest(\"Some text\");\n        OUString sTitleCase = m_xCC->toTitle(sTest, 0, sTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be title\", sTitleCase == \"Some Text\");\n        OUString sUpperCase = m_xCC->toUpper(sTest, 0, sTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be upper\", sUpperCase == \"SOME TEXT\");\n        OUString sLowerCase = m_xCC->toLower(sTest, 0, sTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be lower \", sLowerCase == \"some text\");\n    }\n\n    {\n        \/\/tricky one\n        const sal_Unicode LATINSMALLLETTERDZ[] = { 0x01F3 };\n        OUString aTest(LATINSMALLLETTERDZ, SAL_N_ELEMENTS(LATINSMALLLETTERDZ));\n        OUString sTitleCase = m_xCC->toTitle(aTest, 0, aTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be title\", sTitleCase.getLength() == 1 && sTitleCase[0] == 0x01F2);\n        OUString sUpperCase = m_xCC->toUpper(aTest, 0, aTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be upper\", sUpperCase.getLength() == 1 && sUpperCase[0] == 0x01F1);\n        OUString sLowerCase = m_xCC->toLower(aTest, 0, aTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be lower \", sLowerCase.getLength() == 1 && sLowerCase[0] == 0x01F3);\n    }\n}\n\nvoid TestCharacterClassification::setUp()\n{\n    BootstrapFixtureBase::setUp();\n    m_xCC = uno::Reference< i18n::XCharacterClassification >(m_xSFactory->createInstance(\n        \"com.sun.star.i18n.CharacterClassification\"), uno::UNO_QUERY_THROW);\n}\n\nvoid TestCharacterClassification::tearDown()\n{\n    BootstrapFixtureBase::tearDown();\n    m_xCC.clear();\n}\n\nCPPUNIT_TEST_SUITE_REGISTRATION(TestCharacterClassification);\n\nCPPUNIT_PLUGIN_IMPLEMENT();\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Related: fdo#69641 add a regression test<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 <cppuhelper\/compbase1.hxx>\n#include <cppuhelper\/bootstrap.hxx>\n#include <cppuhelper\/basemutex.hxx>\n#include <com\/sun\/star\/i18n\/XCharacterClassification.hpp>\n#include <unotest\/bootstrapfixturebase.hxx>\n\n#include <rtl\/strbuf.hxx>\n#include <rtl\/ustrbuf.hxx>\n\n#include <string.h>\n\nusing namespace ::com::sun::star;\n\nclass TestCharacterClassification : public test::BootstrapFixtureBase\n{\npublic:\n    virtual void setUp();\n    virtual void tearDown();\n\n    void testTitleCase();\n    void testStringType();\n\n    CPPUNIT_TEST_SUITE(TestCharacterClassification);\n    CPPUNIT_TEST(testTitleCase);\n    CPPUNIT_TEST(testStringType);\n    CPPUNIT_TEST_SUITE_END();\nprivate:\n    uno::Reference<i18n::XCharacterClassification> m_xCC;\n};\n\n\/\/A test to ensure that our Title Case functionality is working\n\/\/http:\/\/lists.freedesktop.org\/archives\/libreoffice\/2012-June\/032767.html\n\/\/https:\/\/issues.apache.org\/ooo\/show_bug.cgi?id=30863\nvoid TestCharacterClassification::testTitleCase()\n{\n    lang::Locale aLocale;\n    aLocale.Language = OUString(\"en\");\n    aLocale.Country = OUString(\"US\");\n\n    {\n        \/\/basic example\n        OUString sTest(\"Some text\");\n        OUString sTitleCase = m_xCC->toTitle(sTest, 0, sTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be title\", sTitleCase == \"Some Text\");\n        OUString sUpperCase = m_xCC->toUpper(sTest, 0, sTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be upper\", sUpperCase == \"SOME TEXT\");\n        OUString sLowerCase = m_xCC->toLower(sTest, 0, sTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be lower \", sLowerCase == \"some text\");\n    }\n\n    {\n        \/\/tricky one\n        const sal_Unicode LATINSMALLLETTERDZ[] = { 0x01F3 };\n        OUString aTest(LATINSMALLLETTERDZ, SAL_N_ELEMENTS(LATINSMALLLETTERDZ));\n        OUString sTitleCase = m_xCC->toTitle(aTest, 0, aTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be title\", sTitleCase.getLength() == 1 && sTitleCase[0] == 0x01F2);\n        OUString sUpperCase = m_xCC->toUpper(aTest, 0, aTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be upper\", sUpperCase.getLength() == 1 && sUpperCase[0] == 0x01F1);\n        OUString sLowerCase = m_xCC->toLower(aTest, 0, aTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_MESSAGE(\"Should be lower \", sLowerCase.getLength() == 1 && sLowerCase[0] == 0x01F3);\n    }\n}\n\n\/\/https:\/\/bugs.freedesktop.org\/show_bug.cgi?id=69641\nvoid TestCharacterClassification::testStringType()\n{\n    lang::Locale aLocale;\n    aLocale.Language = OUString(\"en\");\n    aLocale.Country = OUString(\"US\");\n\n    {\n        \/\/simple case\n        OUString sTest(\"Some text\");\n        sal_Int32 nResult = m_xCC->getStringType(sTest, 0, sTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_EQUAL(nResult, sal_Int32(230));\n    }\n\n    {\n        \/\/tricky case\n        const sal_Unicode MATHEMATICAL_ITALIC_SMALL_THETA[] = { 0xD835, 0xDF03 };\n        OUString sTest(MATHEMATICAL_ITALIC_SMALL_THETA, SAL_N_ELEMENTS(MATHEMATICAL_ITALIC_SMALL_THETA));\n        sal_Int32 nResult = m_xCC->getStringType(sTest, 0, sTest.getLength(), aLocale);\n        CPPUNIT_ASSERT_EQUAL(nResult, sal_Int32(228));\n    }\n\n}\n\nvoid TestCharacterClassification::setUp()\n{\n    BootstrapFixtureBase::setUp();\n    m_xCC = uno::Reference< i18n::XCharacterClassification >(m_xSFactory->createInstance(\n        \"com.sun.star.i18n.CharacterClassification\"), uno::UNO_QUERY_THROW);\n}\n\nvoid TestCharacterClassification::tearDown()\n{\n    BootstrapFixtureBase::tearDown();\n    m_xCC.clear();\n}\n\nCPPUNIT_TEST_SUITE_REGISTRATION(TestCharacterClassification);\n\nCPPUNIT_PLUGIN_IMPLEMENT();\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: ignoreSize_ja_JP.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: hr $ $Date: 2003-04-28 16:52:18 $\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\/\/ prevent internal compiler error with MSVC6SP3\n#include <utility>\n\n#define TRANSLITERATION_Size_ja_JP\n#include <transliteration_Ignore.hxx>\n#define TRANSLITERATION_smallToLarge_ja_JP\n#define TRANSLITERATION_largeToSmall_ja_JP\n#include <transliteration_OneToOne.hxx>\n\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace rtl;\n\nnamespace com { namespace sun { namespace star { namespace i18n {\n\nOUString SAL_CALL\nignoreSize_ja_JP::folding( const OUString& inStr, sal_Int32 startPos, sal_Int32 nCount, Sequence< sal_Int32 >& offset )\n  throw(RuntimeException)\n{\n    smallToLarge_ja_JP t1;\n    return t1.transliterate(inStr, startPos, nCount, offset);\n}\n\n\nSequence< OUString > SAL_CALL\nignoreSize_ja_JP::transliterateRange( const OUString& str1, const OUString& str2 )\n  throw(RuntimeException)\n{\n    smallToLarge_ja_JP t1;\n    largeToSmall_ja_JP t2;\n\n    return transliteration_Ignore::transliterateRange(str1, str2, t1, t2);\n}\n\nsal_Unicode SAL_CALL\nignoreSize_ja_JP::transliterateChar2Char( sal_Unicode inChar) throw(RuntimeException, MultipleCharsOutputException)\n{\n    smallToLarge_ja_JP t1;\n    return t1.transliterateChar2Char(inChar);\n}\n\n} } } }\n<commit_msg>INTEGRATION: CWS ooo19126 (1.7.190); FILE MERGED 2005\/09\/05 17:47:57 rt 1.7.190.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ignoreSize_ja_JP.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 17:30: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\/\/ prevent internal compiler error with MSVC6SP3\n#include <utility>\n\n#define TRANSLITERATION_Size_ja_JP\n#include <transliteration_Ignore.hxx>\n#define TRANSLITERATION_smallToLarge_ja_JP\n#define TRANSLITERATION_largeToSmall_ja_JP\n#include <transliteration_OneToOne.hxx>\n\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace rtl;\n\nnamespace com { namespace sun { namespace star { namespace i18n {\n\nOUString SAL_CALL\nignoreSize_ja_JP::folding( const OUString& inStr, sal_Int32 startPos, sal_Int32 nCount, Sequence< sal_Int32 >& offset )\n  throw(RuntimeException)\n{\n    smallToLarge_ja_JP t1;\n    return t1.transliterate(inStr, startPos, nCount, offset);\n}\n\n\nSequence< OUString > SAL_CALL\nignoreSize_ja_JP::transliterateRange( const OUString& str1, const OUString& str2 )\n  throw(RuntimeException)\n{\n    smallToLarge_ja_JP t1;\n    largeToSmall_ja_JP t2;\n\n    return transliteration_Ignore::transliterateRange(str1, str2, t1, t2);\n}\n\nsal_Unicode SAL_CALL\nignoreSize_ja_JP::transliterateChar2Char( sal_Unicode inChar) throw(RuntimeException, MultipleCharsOutputException)\n{\n    smallToLarge_ja_JP t1;\n    return t1.transliterateChar2Char(inChar);\n}\n\n} } } }\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2019, 2020 by Robert Bosch GmbH, 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_utils\/internal\/posix_wrapper\/message_queue.hpp\"\n#include \"iceoryx_utils\/cxx\/smart_c.hpp\"\n#include \"iceoryx_utils\/platform\/fcntl.hpp\"\n#include \"iceoryx_utils\/platform\/platform_correction.hpp\"\n\n#include <chrono>\n#include <cstdlib>\n#include <string>\n\n\nnamespace iox\n{\nnamespace posix\n{\nMessageQueue::MessageQueue()\n{\n    this->m_isInitialized = false;\n    this->m_errorValue = IpcChannelError::NOT_INITIALIZED;\n}\n\nMessageQueue::MessageQueue(const IpcChannelName_t& name,\n                           const IpcChannelMode mode,\n                           const IpcChannelSide channelSide,\n                           const size_t maxMsgSize,\n                           const uint64_t maxMsgNumber)\n    : m_channelSide(channelSide)\n{\n    sanitizeIpcChannelName(name)\n        .and_then([this](IpcChannelName_t& name) { m_name = std::move(name); })\n        .or_else([this](IpcChannelError) {\n            this->m_isInitialized = false;\n            this->m_errorValue = IpcChannelError::INVALID_CHANNEL_NAME;\n        });\n\n    if (maxMsgSize > MAX_MESSAGE_SIZE)\n    {\n        this->m_isInitialized = false;\n        this->m_errorValue = IpcChannelError::MAX_MESSAGE_SIZE_EXCEEDED;\n    }\n    else\n    {\n        if (channelSide == IpcChannelSide::SERVER)\n        {\n            auto mqCall = cxx::makeSmartC(\n                mq_unlink, cxx::ReturnMode::PRE_DEFINED_ERROR_CODE, {ERROR_CODE}, {ENOENT}, m_name.c_str());\n            if (!mqCall.hasErrors())\n            {\n                if (mqCall.getErrNum() != ENOENT)\n                {\n                    std::cout << \"MQ still there, doing an unlink of \" << m_name << std::endl;\n                }\n            }\n        }\n        \/\/ fields have a different order in QNX,\n        \/\/ so we need to initialize by name\n        m_attributes.mq_flags = (mode == IpcChannelMode::NON_BLOCKING) ? O_NONBLOCK : 0;\n        m_attributes.mq_maxmsg = static_cast<long>(maxMsgNumber);\n        m_attributes.mq_msgsize = static_cast<long>(maxMsgSize);\n        m_attributes.mq_curmsgs = 0L;\n#ifdef __QNX__\n        m_attributes.mq_recvwait = 0L;\n        m_attributes.mq_sendwait = 0L;\n#endif\n        auto openResult = open(m_name, mode, channelSide);\n        if (!openResult.has_error())\n        {\n            this->m_isInitialized = true;\n            this->m_errorValue = IpcChannelError::UNDEFINED;\n            this->m_mqDescriptor = openResult.value();\n        }\n        else\n        {\n            this->m_isInitialized = false;\n            this->m_errorValue = openResult.get_error();\n        }\n    }\n}\n\nMessageQueue::MessageQueue(MessageQueue&& other)\n{\n    *this = std::move(other);\n}\n\nMessageQueue::~MessageQueue()\n{\n    if (destroy().has_error())\n    {\n        std::cerr << \"unable to cleanup message queue \\\"\" << m_name << \"\\\" in the destructor\" << std::endl;\n    }\n}\n\nMessageQueue& MessageQueue::operator=(MessageQueue&& other)\n{\n    if (this != &other)\n    {\n        if (destroy().has_error())\n        {\n            std::cerr << \"unable to cleanup message queue \\\"\" << m_name\n                      << \"\\\" during move operation - resource leaks are possible!\" << std::endl;\n        }\n        CreationPattern_t::operator=(std::move(other));\n\n        m_name = std::move(other.m_name);\n        m_attributes = std::move(other.m_attributes);\n        m_mqDescriptor = std::move(other.m_mqDescriptor);\n        m_channelSide = std::move(other.m_channelSide);\n        other.m_mqDescriptor = INVALID_DESCRIPTOR;\n    }\n\n    return *this;\n}\n\ncxx::expected<bool, IpcChannelError> MessageQueue::unlinkIfExists(const IpcChannelName_t& name)\n{\n    IpcChannelName_t l_name;\n    if (sanitizeIpcChannelName(name).and_then([&](IpcChannelName_t& name) { l_name = std::move(name); }).has_error())\n    {\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_CHANNEL_NAME);\n    }\n\n    auto mqCall =\n        cxx::makeSmartC(mq_unlink, cxx::ReturnMode::PRE_DEFINED_ERROR_CODE, {ERROR_CODE}, {ENOENT}, l_name.c_str());\n\n    if (!mqCall.hasErrors())\n    {\n        \/\/ ENOENT is set if the message queue could not be unlinked\n        return cxx::success<bool>(mqCall.getErrNum() != ENOENT);\n    }\n    else\n    {\n        return createErrorFromErrnum(l_name, mqCall.getErrNum());\n    }\n}\n\ncxx::expected<IpcChannelError> MessageQueue::destroy()\n{\n    if (m_mqDescriptor != INVALID_DESCRIPTOR)\n    {\n        auto closeCall = close();\n        if (closeCall.has_error())\n        {\n            m_mqDescriptor = INVALID_DESCRIPTOR;\n            return closeCall;\n        }\n        auto unlinkCall = unlink();\n        if (unlinkCall.has_error())\n        {\n            m_mqDescriptor = INVALID_DESCRIPTOR;\n            return unlinkCall;\n        }\n    }\n\n    m_mqDescriptor = INVALID_DESCRIPTOR;\n    m_isInitialized = false;\n    return cxx::success<void>();\n}\n\ncxx::expected<IpcChannelError> MessageQueue::send(const std::string& msg) const\n{\n    const size_t messageSize = static_cast<size_t>(msg.size()) + NULL_TERMINATOR_SIZE;\n    if (messageSize > static_cast<size_t>(m_attributes.mq_msgsize))\n    {\n        return cxx::error<IpcChannelError>(IpcChannelError::MESSAGE_TOO_LONG);\n    }\n\n    auto mqCall = cxx::makeSmartC(mq_send,\n                                  cxx::ReturnMode::PRE_DEFINED_ERROR_CODE,\n                                  {ERROR_CODE},\n                                  {},\n                                  m_mqDescriptor,\n                                  msg.c_str(),\n                                  messageSize,\n                                  1U);\n\n    if (mqCall.hasErrors())\n    {\n        return createErrorFromErrnum(mqCall.getErrNum());\n    }\n\n    return cxx::success<void>();\n}\n\ncxx::expected<std::string, IpcChannelError> MessageQueue::receive() const\n{\n    char message[MAX_MESSAGE_SIZE];\n    auto mqCall = cxx::makeSmartC(mq_receive,\n                                  cxx::ReturnMode::PRE_DEFINED_ERROR_CODE,\n                                  {static_cast<ssize_t>(ERROR_CODE)},\n                                  {},\n                                  m_mqDescriptor,\n                                  message,\n                                  MAX_MESSAGE_SIZE,\n                                  nullptr);\n\n    if (mqCall.hasErrors())\n    {\n        return createErrorFromErrnum(mqCall.getErrNum());\n    }\n\n    return cxx::success<std::string>(std::string(&(message[0])));\n}\n\ncxx::expected<int32_t, IpcChannelError>\nMessageQueue::open(const IpcChannelName_t& name, const IpcChannelMode mode, const IpcChannelSide channelSide)\n{\n    IpcChannelName_t l_name;\n    if (sanitizeIpcChannelName(name).and_then([&](IpcChannelName_t& name) { l_name = std::move(name); }).has_error())\n    {\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_CHANNEL_NAME);\n    }\n\n\n    int32_t openFlags = O_RDWR;\n    openFlags |= (mode == IpcChannelMode::NON_BLOCKING) ? O_NONBLOCK : 0;\n    if (channelSide == IpcChannelSide::SERVER)\n    {\n        openFlags |= O_CREAT;\n    }\n\n    \/\/ the mask will be applied to the permissions, therefore we need to set it to 0\n    mode_t umaskSaved = umask(0);\n\n    auto mqCall = cxx::makeSmartC(mq_open,\n                                  cxx::ReturnMode::PRE_DEFINED_ERROR_CODE,\n                                  {ERROR_CODE},\n                                  {ENOENT},\n                                  l_name.c_str(),\n                                  openFlags,\n                                  m_filemode,\n                                  &m_attributes);\n\n    umask(umaskSaved);\n\n    if (!mqCall.hasErrors())\n    {\n        if (mqCall.getErrNum() == 0)\n        {\n            return cxx::success<int32_t>(mqCall.getReturnValue());\n        }\n        else if (mqCall.getErrNum() == ENOENT)\n        {\n            return cxx::error<IpcChannelError>(IpcChannelError::NO_SUCH_CHANNEL);\n        }\n        else\n        {\n            return createErrorFromErrnum(mqCall.getErrNum());\n        }\n    }\n    else\n    {\n        return createErrorFromErrnum(mqCall.getErrNum());\n    }\n}\n\ncxx::expected<IpcChannelError> MessageQueue::close()\n{\n    auto mqCall = cxx::makeSmartC(mq_close, cxx::ReturnMode::PRE_DEFINED_ERROR_CODE, {ERROR_CODE}, {}, m_mqDescriptor);\n\n    if (mqCall.hasErrors())\n    {\n        return createErrorFromErrnum(mqCall.getErrNum());\n    }\n\n    return cxx::success<void>();\n}\n\ncxx::expected<IpcChannelError> MessageQueue::unlink()\n{\n    if (m_channelSide == IpcChannelSide::CLIENT)\n    {\n        return cxx::success<void>();\n    }\n    else\n    {\n        auto mqCall =\n            cxx::makeSmartC(mq_unlink, cxx::ReturnMode::PRE_DEFINED_ERROR_CODE, {ERROR_CODE}, {}, m_name.c_str());\n        if (mqCall.hasErrors())\n        {\n            return createErrorFromErrnum(mqCall.getErrNum());\n        }\n\n        return cxx::success<void>();\n    }\n}\n\ncxx::expected<std::string, IpcChannelError> MessageQueue::timedReceive(const units::Duration& timeout) const\n{\n    timespec timeOut = timeout.timespec(units::TimeSpecReference::Epoch);\n    char message[MAX_MESSAGE_SIZE];\n\n    auto mqCall = cxx::makeSmartC(mq_timedreceive,\n                                  cxx::ReturnMode::PRE_DEFINED_ERROR_CODE,\n                                  {static_cast<ssize_t>(ERROR_CODE)},\n                                  {TIMEOUT_ERRNO},\n                                  m_mqDescriptor,\n                                  message,\n                                  MAX_MESSAGE_SIZE,\n                                  nullptr,\n                                  &timeOut);\n\n    if (mqCall.hasErrors())\n    {\n        return createErrorFromErrnum(mqCall.getErrNum());\n    }\n    else if (mqCall.getErrNum() == TIMEOUT_ERRNO)\n    {\n        return createErrorFromErrnum(ETIMEDOUT);\n    }\n\n    return cxx::success<std::string>(std::string(&(message[0])));\n}\n\ncxx::expected<IpcChannelError> MessageQueue::timedSend(const std::string& msg, const units::Duration& timeout) const\n{\n    const size_t messageSize = static_cast<size_t>(msg.size()) + NULL_TERMINATOR_SIZE;\n    if (messageSize > static_cast<size_t>(m_attributes.mq_msgsize))\n    {\n        std::cerr << \"the message \\\"\" << msg << \"\\\" which should be sent to the message queue \\\"\" << m_name\n                  << \"\\\" is too long\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::MESSAGE_TOO_LONG);\n    }\n\n    timespec timeOut = timeout.timespec(units::TimeSpecReference::Epoch);\n\n    auto mqCall = cxx::makeSmartC(mq_timedsend,\n                                  cxx::ReturnMode::PRE_DEFINED_ERROR_CODE,\n                                  {ERROR_CODE},\n                                  {TIMEOUT_ERRNO},\n                                  m_mqDescriptor,\n                                  msg.c_str(),\n                                  messageSize,\n                                  1U,\n                                  &timeOut);\n\n    if (mqCall.hasErrors())\n    {\n        return createErrorFromErrnum(mqCall.getErrNum());\n    }\n    else if (mqCall.getErrNum() == TIMEOUT_ERRNO)\n    {\n        return createErrorFromErrnum(ETIMEDOUT);\n    }\n\n    return cxx::success<void>();\n}\n\ncxx::expected<bool, IpcChannelError> MessageQueue::isOutdated()\n{\n    struct stat sb;\n    auto fstatCall = cxx::makeSmartC(fstat, cxx::ReturnMode::PRE_DEFINED_ERROR_CODE, {-1}, {}, m_mqDescriptor, &sb);\n    if (fstatCall.hasErrors())\n    {\n        return createErrorFromErrnum(fstatCall.getErrNum());\n    }\n    return cxx::success<bool>(sb.st_nlink == 0);\n}\n\ncxx::error<IpcChannelError> MessageQueue::createErrorFromErrnum(const int32_t errnum) const\n{\n    return createErrorFromErrnum(m_name, errnum);\n}\n\ncxx::error<IpcChannelError> MessageQueue::createErrorFromErrnum(const IpcChannelName_t& name, const int32_t errnum)\n{\n    switch (errnum)\n    {\n    case EACCES:\n    {\n        std::cerr << \"access denied to message queue \\\"\" << name << \"\\\"\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::ACCESS_DENIED);\n    }\n    case EAGAIN:\n    {\n        std::cerr << \"the message queue \\\"\" << name << \"\\\" is full\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::CHANNEL_FULL);\n    }\n    case ETIMEDOUT:\n    {\n        \/\/ no error message needed since this is a normal use case\n        return cxx::error<IpcChannelError>(IpcChannelError::TIMEOUT);\n    }\n    case EEXIST:\n    {\n        std::cerr << \"message queue \\\"\" << name << \"\\\" already exists\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::CHANNEL_ALREADY_EXISTS);\n    }\n    case EINVAL:\n    {\n        std::cerr << \"provided invalid arguments for message queue \\\"\" << name << \"\\\"\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_ARGUMENTS);\n    }\n    case ENOENT:\n    {\n        std::cerr << \"message queue \\\"\" << name << \"\\\" does not exist\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::NO_SUCH_CHANNEL);\n    }\n    case ENAMETOOLONG:\n    {\n        std::cerr << \"message queue name \\\"\" << name << \"\\\" is too long\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_CHANNEL_NAME);\n    }\n    default:\n    {\n        std::cerr << \"internal logic error in message queue \\\"\" << name << \"\\\" occurred [errno: \" << errnum << \": \"\n                  << strerror(errnum) << \"]\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::INTERNAL_LOGIC_ERROR);\n    }\n    }\n}\n\ncxx::expected<IpcChannelName_t, IpcChannelError>\nMessageQueue::sanitizeIpcChannelName(const IpcChannelName_t& name) noexcept\n{\n    \/\/\/ @todo the check for the longest valid queue name is missing\n    \/\/\/ the name for the mqeue is limited by MAX_PATH\n    \/\/\/ The mq_open call is wrapped by smartC to throw then an ENAMETOOLONG error\n    \/\/\/ See: https:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/mq_open.html\n    if (name.empty() || name.size() < SHORTEST_VALID_QUEUE_NAME)\n    {\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_CHANNEL_NAME);\n    }\n    else if (name.c_str()[0] != '\/')\n    {\n        return cxx::success<IpcChannelName_t>(IpcChannelName_t(\"\/\").append(iox::cxx::TruncateToCapacity, name));\n    }\n    else\n    {\n        return cxx::success<IpcChannelName_t>(name);\n    }\n}\n\n} \/\/ namespace posix\n} \/\/ namespace iox\n<commit_msg>iox-#418 replaced smart_c with posixCall in message queue<commit_after>\/\/ Copyright (c) 2019, 2020 by Robert Bosch GmbH, 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_utils\/internal\/posix_wrapper\/message_queue.hpp\"\n#include \"iceoryx_utils\/platform\/fcntl.hpp\"\n#include \"iceoryx_utils\/platform\/platform_correction.hpp\"\n#include \"iceoryx_utils\/posix_wrapper\/posix_call.hpp\"\n\n#include <chrono>\n#include <cstdlib>\n#include <string>\n\n\nnamespace iox\n{\nnamespace posix\n{\nMessageQueue::MessageQueue()\n{\n    this->m_isInitialized = false;\n    this->m_errorValue = IpcChannelError::NOT_INITIALIZED;\n}\n\nMessageQueue::MessageQueue(const IpcChannelName_t& name,\n                           const IpcChannelMode mode,\n                           const IpcChannelSide channelSide,\n                           const size_t maxMsgSize,\n                           const uint64_t maxMsgNumber)\n    : m_channelSide(channelSide)\n{\n    sanitizeIpcChannelName(name)\n        .and_then([this](IpcChannelName_t& name) { m_name = std::move(name); })\n        .or_else([this](IpcChannelError) {\n            this->m_isInitialized = false;\n            this->m_errorValue = IpcChannelError::INVALID_CHANNEL_NAME;\n        });\n\n    if (maxMsgSize > MAX_MESSAGE_SIZE)\n    {\n        this->m_isInitialized = false;\n        this->m_errorValue = IpcChannelError::MAX_MESSAGE_SIZE_EXCEEDED;\n    }\n    else\n    {\n        if (channelSide == IpcChannelSide::SERVER)\n        {\n            posixCall(mq_unlink)(m_name.c_str())\n                .failureReturnValue(ERROR_CODE)\n                .evaluateWithIgnoredErrnos(ENOENT)\n                .and_then([this](auto& r) {\n                    if (r.errnum != ENOENT)\n                    {\n                        std::cout << \"MQ still there, doing an unlink of \" << m_name << std::endl;\n                    }\n                });\n        }\n        \/\/ fields have a different order in QNX,\n        \/\/ so we need to initialize by name\n        m_attributes.mq_flags = (mode == IpcChannelMode::NON_BLOCKING) ? O_NONBLOCK : 0;\n        m_attributes.mq_maxmsg = static_cast<long>(maxMsgNumber);\n        m_attributes.mq_msgsize = static_cast<long>(maxMsgSize);\n        m_attributes.mq_curmsgs = 0L;\n#ifdef __QNX__\n        m_attributes.mq_recvwait = 0L;\n        m_attributes.mq_sendwait = 0L;\n#endif\n        auto openResult = open(m_name, mode, channelSide);\n        if (!openResult.has_error())\n        {\n            this->m_isInitialized = true;\n            this->m_errorValue = IpcChannelError::UNDEFINED;\n            this->m_mqDescriptor = openResult.value();\n        }\n        else\n        {\n            this->m_isInitialized = false;\n            this->m_errorValue = openResult.get_error();\n        }\n    }\n}\n\nMessageQueue::MessageQueue(MessageQueue&& other)\n{\n    *this = std::move(other);\n}\n\nMessageQueue::~MessageQueue()\n{\n    if (destroy().has_error())\n    {\n        std::cerr << \"unable to cleanup message queue \\\"\" << m_name << \"\\\" in the destructor\" << std::endl;\n    }\n}\n\nMessageQueue& MessageQueue::operator=(MessageQueue&& other)\n{\n    if (this != &other)\n    {\n        if (destroy().has_error())\n        {\n            std::cerr << \"unable to cleanup message queue \\\"\" << m_name\n                      << \"\\\" during move operation - resource leaks are possible!\" << std::endl;\n        }\n        CreationPattern_t::operator=(std::move(other));\n\n        m_name = std::move(other.m_name);\n        m_attributes = std::move(other.m_attributes);\n        m_mqDescriptor = std::move(other.m_mqDescriptor);\n        m_channelSide = std::move(other.m_channelSide);\n        other.m_mqDescriptor = INVALID_DESCRIPTOR;\n    }\n\n    return *this;\n}\n\ncxx::expected<bool, IpcChannelError> MessageQueue::unlinkIfExists(const IpcChannelName_t& name)\n{\n    IpcChannelName_t l_name;\n    if (sanitizeIpcChannelName(name).and_then([&](IpcChannelName_t& name) { l_name = std::move(name); }).has_error())\n    {\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_CHANNEL_NAME);\n    }\n\n\n    auto mqCall = posixCall(mq_unlink)(l_name.c_str()).failureReturnValue(ERROR_CODE).evaluateWithIgnoredErrnos(ENOENT);\n\n    if (mqCall.has_error())\n    {\n        return createErrorFromErrnum(l_name, mqCall.get_error().errnum);\n    }\n    return cxx::success<bool>(mqCall->errnum != ENOENT);\n}\n\ncxx::expected<IpcChannelError> MessageQueue::destroy()\n{\n    if (m_mqDescriptor != INVALID_DESCRIPTOR)\n    {\n        auto closeCall = close();\n        if (closeCall.has_error())\n        {\n            m_mqDescriptor = INVALID_DESCRIPTOR;\n            return closeCall;\n        }\n        auto unlinkCall = unlink();\n        if (unlinkCall.has_error())\n        {\n            m_mqDescriptor = INVALID_DESCRIPTOR;\n            return unlinkCall;\n        }\n    }\n\n    m_mqDescriptor = INVALID_DESCRIPTOR;\n    m_isInitialized = false;\n    return cxx::success<void>();\n}\n\ncxx::expected<IpcChannelError> MessageQueue::send(const std::string& msg) const\n{\n    const size_t messageSize = static_cast<size_t>(msg.size()) + NULL_TERMINATOR_SIZE;\n    if (messageSize > static_cast<size_t>(m_attributes.mq_msgsize))\n    {\n        return cxx::error<IpcChannelError>(IpcChannelError::MESSAGE_TOO_LONG);\n    }\n\n    auto mqCall =\n        posixCall(mq_send)(m_mqDescriptor, msg.c_str(), messageSize, 1U).failureReturnValue(ERROR_CODE).evaluate();\n\n    if (mqCall.has_error())\n    {\n        return createErrorFromErrnum(mqCall.get_error().errnum);\n    }\n\n    return cxx::success<void>();\n}\n\ncxx::expected<std::string, IpcChannelError> MessageQueue::receive() const\n{\n    char message[MAX_MESSAGE_SIZE];\n\n    auto mqCall = posixCall(mq_receive)(m_mqDescriptor, message, MAX_MESSAGE_SIZE, nullptr)\n                      .failureReturnValue(ERROR_CODE)\n                      .evaluate();\n\n    if (mqCall.has_error())\n    {\n        return createErrorFromErrnum(mqCall.get_error().errnum);\n    }\n\n    return cxx::success<std::string>(std::string(&(message[0])));\n}\n\ncxx::expected<int32_t, IpcChannelError>\nMessageQueue::open(const IpcChannelName_t& name, const IpcChannelMode mode, const IpcChannelSide channelSide)\n{\n    IpcChannelName_t l_name;\n    if (sanitizeIpcChannelName(name).and_then([&](IpcChannelName_t& name) { l_name = std::move(name); }).has_error())\n    {\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_CHANNEL_NAME);\n    }\n\n\n    int32_t openFlags = O_RDWR;\n    openFlags |= (mode == IpcChannelMode::NON_BLOCKING) ? O_NONBLOCK : 0;\n    if (channelSide == IpcChannelSide::SERVER)\n    {\n        openFlags |= O_CREAT;\n    }\n\n    \/\/ the mask will be applied to the permissions, therefore we need to set it to 0\n    mode_t umaskSaved = umask(0);\n\n    \/\/ mq_open uses c variadic arguments therefore we have to use a lambda\n    auto mq_open_lambda = [](const char* name, int oflag, mode_t mode, struct mq_attr* attr) -> mqd_t {\n        return mq_open(name, oflag, mode, attr);\n    };\n    mqd_t (*mq_open_call)(const char*, int, mode_t, struct mq_attr*) = mq_open_lambda;\n\n    auto mqCall = posixCall(mq_open_call)(l_name.c_str(), openFlags, m_filemode, &m_attributes)\n                      .failureReturnValue(ERROR_CODE)\n                      .evaluateWithIgnoredErrnos(ENOENT);\n\n    umask(umaskSaved);\n\n    if (!mqCall.has_error())\n    {\n        if (mqCall->errnum == 0)\n        {\n            return cxx::success<int32_t>(mqCall->value);\n        }\n        else if (mqCall->errnum == ENOENT)\n        {\n            return cxx::error<IpcChannelError>(IpcChannelError::NO_SUCH_CHANNEL);\n        }\n    }\n\n    return createErrorFromErrnum(mqCall.get_error().errnum);\n}\n\ncxx::expected<IpcChannelError> MessageQueue::close()\n{\n    auto mqCall = posixCall(mq_close)(m_mqDescriptor).failureReturnValue(ERROR_CODE).evaluate();\n\n    if (mqCall.has_error())\n    {\n        return createErrorFromErrnum(mqCall.get_error().errnum);\n    }\n\n    return cxx::success<void>();\n}\n\ncxx::expected<IpcChannelError> MessageQueue::unlink()\n{\n    if (m_channelSide == IpcChannelSide::CLIENT)\n    {\n        return cxx::success<void>();\n    }\n    else\n    {\n        auto mqCall = posixCall(mq_unlink)(m_name.c_str()).failureReturnValue(ERROR_CODE).evaluate();\n        if (mqCall.has_error())\n        {\n            return createErrorFromErrnum(mqCall.get_error().errnum);\n        }\n\n        return cxx::success<void>();\n    }\n}\n\ncxx::expected<std::string, IpcChannelError> MessageQueue::timedReceive(const units::Duration& timeout) const\n{\n    timespec timeOut = timeout.timespec(units::TimeSpecReference::Epoch);\n    char message[MAX_MESSAGE_SIZE];\n\n    auto mqCall = posixCall(mq_timedreceive)(m_mqDescriptor, message, MAX_MESSAGE_SIZE, nullptr, &timeOut)\n                      .failureReturnValue(ERROR_CODE)\n                      .evaluateWithIgnoredErrnos(TIMEOUT_ERRNO);\n\n    if (mqCall.has_error())\n    {\n        return createErrorFromErrnum(mqCall.get_error().errnum);\n    }\n    else if (mqCall->errnum == TIMEOUT_ERRNO)\n    {\n        return createErrorFromErrnum(ETIMEDOUT);\n    }\n\n    return cxx::success<std::string>(std::string(&(message[0])));\n}\n\ncxx::expected<IpcChannelError> MessageQueue::timedSend(const std::string& msg, const units::Duration& timeout) const\n{\n    const size_t messageSize = static_cast<size_t>(msg.size()) + NULL_TERMINATOR_SIZE;\n    if (messageSize > static_cast<size_t>(m_attributes.mq_msgsize))\n    {\n        std::cerr << \"the message \\\"\" << msg << \"\\\" which should be sent to the message queue \\\"\" << m_name\n                  << \"\\\" is too long\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::MESSAGE_TOO_LONG);\n    }\n\n    timespec timeOut = timeout.timespec(units::TimeSpecReference::Epoch);\n\n    auto mqCall = posixCall(mq_timedsend)(m_mqDescriptor, msg.c_str(), messageSize, 1U, &timeOut)\n                      .failureReturnValue(ERROR_CODE)\n                      .evaluateWithIgnoredErrnos(TIMEOUT_ERRNO);\n\n    if (mqCall.has_error())\n    {\n        return createErrorFromErrnum(mqCall.get_error().errnum);\n    }\n    else if (mqCall->errnum == TIMEOUT_ERRNO)\n    {\n        return createErrorFromErrnum(ETIMEDOUT);\n    }\n\n    return cxx::success<void>();\n}\n\ncxx::expected<bool, IpcChannelError> MessageQueue::isOutdated()\n{\n    struct stat sb;\n    auto fstatCall = posixCall(fstat)(m_mqDescriptor, &sb).failureReturnValue(-1).evaluate();\n    if (fstatCall.has_error())\n    {\n        return createErrorFromErrnum(fstatCall.get_error().errnum);\n    }\n    return cxx::success<bool>(sb.st_nlink == 0);\n}\n\ncxx::error<IpcChannelError> MessageQueue::createErrorFromErrnum(const int32_t errnum) const\n{\n    return createErrorFromErrnum(m_name, errnum);\n}\n\ncxx::error<IpcChannelError> MessageQueue::createErrorFromErrnum(const IpcChannelName_t& name, const int32_t errnum)\n{\n    switch (errnum)\n    {\n    case EACCES:\n    {\n        std::cerr << \"access denied to message queue \\\"\" << name << \"\\\"\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::ACCESS_DENIED);\n    }\n    case EAGAIN:\n    {\n        std::cerr << \"the message queue \\\"\" << name << \"\\\" is full\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::CHANNEL_FULL);\n    }\n    case ETIMEDOUT:\n    {\n        \/\/ no error message needed since this is a normal use case\n        return cxx::error<IpcChannelError>(IpcChannelError::TIMEOUT);\n    }\n    case EEXIST:\n    {\n        std::cerr << \"message queue \\\"\" << name << \"\\\" already exists\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::CHANNEL_ALREADY_EXISTS);\n    }\n    case EINVAL:\n    {\n        std::cerr << \"provided invalid arguments for message queue \\\"\" << name << \"\\\"\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_ARGUMENTS);\n    }\n    case ENOENT:\n    {\n        std::cerr << \"message queue \\\"\" << name << \"\\\" does not exist\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::NO_SUCH_CHANNEL);\n    }\n    case ENAMETOOLONG:\n    {\n        std::cerr << \"message queue name \\\"\" << name << \"\\\" is too long\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_CHANNEL_NAME);\n    }\n    default:\n    {\n        std::cerr << \"internal logic error in message queue \\\"\" << name << \"\\\" occurred [errno: \" << errnum << \": \"\n                  << strerror(errnum) << \"]\" << std::endl;\n        return cxx::error<IpcChannelError>(IpcChannelError::INTERNAL_LOGIC_ERROR);\n    }\n    }\n}\n\ncxx::expected<IpcChannelName_t, IpcChannelError>\nMessageQueue::sanitizeIpcChannelName(const IpcChannelName_t& name) noexcept\n{\n    \/\/\/ @todo the check for the longest valid queue name is missing\n    \/\/\/ the name for the mqeue is limited by MAX_PATH\n    \/\/\/ The mq_open call is wrapped by smartC to throw then an ENAMETOOLONG error\n    \/\/\/ See: https:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/mq_open.html\n    if (name.empty() || name.size() < SHORTEST_VALID_QUEUE_NAME)\n    {\n        return cxx::error<IpcChannelError>(IpcChannelError::INVALID_CHANNEL_NAME);\n    }\n    else if (name.c_str()[0] != '\/')\n    {\n        return cxx::success<IpcChannelName_t>(IpcChannelName_t(\"\/\").append(iox::cxx::TruncateToCapacity, name));\n    }\n    else\n    {\n        return cxx::success<IpcChannelName_t>(name);\n    }\n}\n\n} \/\/ namespace posix\n} \/\/ namespace iox\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: dtint.cxx,v $\n *\n *  $Revision: 1.22 $\n *\n *  last change: $Author: hr $ $Date: 2004-05-10 15:58: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#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <dlfcn.h>\n\n#include <salunx.h>\n#include <X11\/Xatom.h>\n\n#ifdef USE_CDE\n#include <cdeint.hxx>\n#endif\n#include <kdeint.hxx>\n#include <saldisp.hxx>\n#include <saldata.hxx>\n#include <wmadaptor.hxx>\n\n#include <svapp.hxx>\n#include <dtsetenum.hxx>\n\n#include <osl\/file.h>\n#include <osl\/process.h>\n\n#include <set>\n#include <stdio.h>\n\n\/\/ NETBSD has no RTLD_GLOBAL\n#ifndef RTLD_GLOBAL\n#define DLOPEN_MODE (RTLD_LAZY)\n#else\n#define DLOPEN_MODE (RTLD_GLOBAL | RTLD_LAZY)\n#endif\n\n\nusing namespace rtl;\nusing namespace vcl_sal;\n\nBOOL bSymbolLoadFailed = FALSE;\n\nDtIntegratorList DtIntegrator::aIntegratorList;\nString DtIntegrator::aHomeDir;\n\nDtIntegrator::DtIntegrator() :\n        meType( DtGeneric ),\n        mnRefCount( 0 ),\n        mnSystemLookCommandProcess( -1 )\n{\n    mpSalDisplay = GetSalData()->GetDisplay();\n    mpDisplay = mpSalDisplay->GetDisplay();\n    aIntegratorList.Insert( this, LIST_APPEND );\n    static const char* pHome = getenv( \"HOME\" );\n    aHomeDir = String( pHome, osl_getThreadTextEncoding() );\n}\n\nDtIntegrator::~DtIntegrator()\n{\n}\n\nDtIntegrator* DtIntegrator::CreateDtIntegrator()\n{\n    SalDisplay* pSalDisplay = GetSalData()->GetDisplay();\n    Display* pDisplay = pSalDisplay->GetDisplay();\n\n    for( unsigned int i = 0; i < aIntegratorList.Count(); i++ )\n    {\n        DtIntegrator* pIntegrator = aIntegratorList.GetObject( i );\n        if( pIntegrator->mpDisplay == pDisplay )\n            return pIntegrator;\n    }\n    \/*\n     *  #i22061# override desktop detection\n     *  if environment variable OOO_FORCE_DESKTOP is set\n     *  to one of \"cde\" \"kde\" \"gnome\" then autodetection\n     *  is overridden.\n     *\/\n    static const char* pOverride = getenv( \"OOO_FORCE_DESKTOP\" );\n    if( pOverride && *pOverride )\n    {\n        OString aOver( pOverride );\n#if USE_CDE\n        if( aOver.equalsIgnoreAsciiCase( \"cde\" ) )\n            return new CDEIntegrator();\n#endif\n        if( aOver.equalsIgnoreAsciiCase( \"kde\" ) )\n            return new KDEIntegrator();\n        if( aOver.equalsIgnoreAsciiCase( \"none\" ) )\n            return new DtIntegrator();\n    }\n\n    Atom nDtAtom = None;\n\n#ifdef USE_CDE\n    void* pLibrary = NULL;\n\n    \/\/ check dt type\n    \/\/ CDE\n    nDtAtom = XInternAtom( pDisplay, \"_DT_WM_READY\", True );\n    if( nDtAtom && ( pLibrary = dlopen( \"\/usr\/dt\/lib\/libDtSvc.so\", DLOPEN_MODE ) ) )\n    {\n        dlclose( pLibrary );\n        return new CDEIntegrator();\n    }\n#endif\n\n    if( pSalDisplay->getWMAdaptor()->getWindowManagerName().EqualsAscii( \"KWin\" ) )\n        return new KDEIntegrator();\n\n    \/\/ default: generic implementation\n    return new DtIntegrator();\n}\n\nvoid DtIntegrator::GetSystemLook( AllSettings& rSettings )\n{\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.22.450); FILE MERGED 2005\/09\/05 14:45:42 rt 1.22.450.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: dtint.cxx,v $\n *\n *  $Revision: 1.23 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 13:04: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#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <dlfcn.h>\n\n#include <salunx.h>\n#include <X11\/Xatom.h>\n\n#ifdef USE_CDE\n#include <cdeint.hxx>\n#endif\n#include <kdeint.hxx>\n#include <saldisp.hxx>\n#include <saldata.hxx>\n#include <wmadaptor.hxx>\n\n#include <svapp.hxx>\n#include <dtsetenum.hxx>\n\n#include <osl\/file.h>\n#include <osl\/process.h>\n\n#include <set>\n#include <stdio.h>\n\n\/\/ NETBSD has no RTLD_GLOBAL\n#ifndef RTLD_GLOBAL\n#define DLOPEN_MODE (RTLD_LAZY)\n#else\n#define DLOPEN_MODE (RTLD_GLOBAL | RTLD_LAZY)\n#endif\n\n\nusing namespace rtl;\nusing namespace vcl_sal;\n\nBOOL bSymbolLoadFailed = FALSE;\n\nDtIntegratorList DtIntegrator::aIntegratorList;\nString DtIntegrator::aHomeDir;\n\nDtIntegrator::DtIntegrator() :\n        meType( DtGeneric ),\n        mnRefCount( 0 ),\n        mnSystemLookCommandProcess( -1 )\n{\n    mpSalDisplay = GetSalData()->GetDisplay();\n    mpDisplay = mpSalDisplay->GetDisplay();\n    aIntegratorList.Insert( this, LIST_APPEND );\n    static const char* pHome = getenv( \"HOME\" );\n    aHomeDir = String( pHome, osl_getThreadTextEncoding() );\n}\n\nDtIntegrator::~DtIntegrator()\n{\n}\n\nDtIntegrator* DtIntegrator::CreateDtIntegrator()\n{\n    SalDisplay* pSalDisplay = GetSalData()->GetDisplay();\n    Display* pDisplay = pSalDisplay->GetDisplay();\n\n    for( unsigned int i = 0; i < aIntegratorList.Count(); i++ )\n    {\n        DtIntegrator* pIntegrator = aIntegratorList.GetObject( i );\n        if( pIntegrator->mpDisplay == pDisplay )\n            return pIntegrator;\n    }\n    \/*\n     *  #i22061# override desktop detection\n     *  if environment variable OOO_FORCE_DESKTOP is set\n     *  to one of \"cde\" \"kde\" \"gnome\" then autodetection\n     *  is overridden.\n     *\/\n    static const char* pOverride = getenv( \"OOO_FORCE_DESKTOP\" );\n    if( pOverride && *pOverride )\n    {\n        OString aOver( pOverride );\n#if USE_CDE\n        if( aOver.equalsIgnoreAsciiCase( \"cde\" ) )\n            return new CDEIntegrator();\n#endif\n        if( aOver.equalsIgnoreAsciiCase( \"kde\" ) )\n            return new KDEIntegrator();\n        if( aOver.equalsIgnoreAsciiCase( \"none\" ) )\n            return new DtIntegrator();\n    }\n\n    Atom nDtAtom = None;\n\n#ifdef USE_CDE\n    void* pLibrary = NULL;\n\n    \/\/ check dt type\n    \/\/ CDE\n    nDtAtom = XInternAtom( pDisplay, \"_DT_WM_READY\", True );\n    if( nDtAtom && ( pLibrary = dlopen( \"\/usr\/dt\/lib\/libDtSvc.so\", DLOPEN_MODE ) ) )\n    {\n        dlclose( pLibrary );\n        return new CDEIntegrator();\n    }\n#endif\n\n    if( pSalDisplay->getWMAdaptor()->getWindowManagerName().EqualsAscii( \"KWin\" ) )\n        return new KDEIntegrator();\n\n    \/\/ default: generic implementation\n    return new DtIntegrator();\n}\n\nvoid DtIntegrator::GetSystemLook( AllSettings& rSettings )\n{\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"BlueFilter.h\"\n\nCOMPONENT_ENTRY(BlueFilter)\n\n\nBlueFilter::BlueFilter(AudioUnit component)\n\t: AUEffectBase(component)\n{\t\n\tTTDSPInit();\n\t\n\tCreateElements();\n\tGlobals()->UseIndexedParameters(kNumberOfParameters);\n\n\tSetParameter(kParam_One, kDefaultValue_ParamOne);\n\tSetAFactoryPresetAsCurrent(kPresets[kPreset_Default]);\t\/\/ TODO: for some reason, this doesn't seem to be applied...\n\t\n\t#if AU_DEBUG_DISPATCHER\n\tmDebugDispatcher = new AUDebugDispatcher(this);\n\t#endif\n}\n\n\nOSStatus BlueFilter::GetParameterValueStrings(AudioUnitScope inScope, AudioUnitParameterID inParameterID, CFArrayRef* outStrings)\n{\n    return kAudioUnitErr_InvalidProperty;\n}\n\n\nOSStatus BlueFilter::GetParameterInfo(AudioUnitScope inScope, AudioUnitParameterID inParameterID, AudioUnitParameterInfo &outParameterInfo)\n{\n\tOSStatus result = noErr;\n\n\toutParameterInfo.flags = kAudioUnitParameterFlag_IsWritable\n\t\t\t\t\t\t|\t kAudioUnitParameterFlag_IsReadable;\n    \n    if(inScope == kAudioUnitScope_Global){\n        switch(inParameterID){\n            case kParam_One:\n                AUBase::FillInParameterName(outParameterInfo, kParameterOneName, false);\n                outParameterInfo.unit = kAudioUnitParameterUnit_Hertz;\n                outParameterInfo.minValue = 1.0;\n                outParameterInfo.maxValue = 20000.0;\n                outParameterInfo.defaultValue = kDefaultValue_ParamOne;\n                break;\n            default:\n                result = kAudioUnitErr_InvalidParameter;\n                break;\n\t\t}\n\t} \n\telse\n        result = kAudioUnitErr_InvalidParameter;\n\n\treturn result;\n}\n\n\nOSStatus BlueFilter::GetPropertyInfo(\tAudioUnitPropertyID\tinID,\n\t\t\t\t\t\t\t\t\t\tAudioUnitScope\t\tinScope,\n\t\t\t\t\t\t\t\t\t\tAudioUnitElement\tinElement,\n\t\t\t\t\t\t\t\t\t\tUInt32&\t\t\t\toutDataSize,\n\t\t\t\t\t\t\t\t\t\tBoolean&\t\t\toutWritable)\n{\n\treturn AUEffectBase::GetPropertyInfo (inID, inScope, inElement, outDataSize, outWritable);\n}\n\n\nOSStatus BlueFilter::GetProperty(\tAudioUnitPropertyID inID,\n\t\t\t\t\t\t\t\t\tAudioUnitScope \t\tinScope,\n\t\t\t\t\t\t\t\t\tAudioUnitElement \tinElement,\n\t\t\t\t\t\t\t\t\tvoid*\t\t\t\toutData )\n{\n\treturn AUEffectBase::GetProperty (inID, inScope, inElement, outData);\n}\n\n\nComponentResult BlueFilter::GetPresets(CFArrayRef* outData) const\n{\n    if(outData == NULL) \n\t\treturn noErr;\n\t\n    CFMutableArrayRef presetsArray = CFArrayCreateMutable(NULL, kNumberPresets, NULL);\n\t\n    for(int i=0; i<kNumberPresets; ++i)\n        CFArrayAppendValue(presetsArray, &kPresets [i]);\n\t\n    *outData = (CFArrayRef)presetsArray;\n    return noErr;\n}\n\n\nOSStatus BlueFilter::NewFactoryPresetSet(const AUPreset &inNewFactoryPreset)\n{\n    SInt32 chosenPreset = inNewFactoryPreset.presetNumber;\n\t\n    if(chosenPreset == kPreset_Low || chosenPreset == kPreset_High){\n        for(int i = 0; i < kNumberPresets; ++i){\n            if(chosenPreset == kPresets[i].presetNumber){\n                switch(chosenPreset){\n                    case kPreset_Low:\n                        SetParameter(kParam_One, kParameter_Preset_Low);\n                        break;\n                    case kPreset_High:\n\t\t\t\t\t\tSetParameter(kParam_One, kParameter_Preset_High);\n                        break;\n                }\n                SetAFactoryPresetAsCurrent(kPresets[i]);\n                return noErr;             \n            }\n        }\n    }\n    return kAudioUnitErr_InvalidProperty;\n}\n\n\n#pragma mark -\n#pragma mark BlueFilter Effect Kernel\n\nvoid BlueFilter::BlueFilterKernel::Reset()\n{\n\t;\/\/ do whatever work is necessary to return the audio unit to its pristine, initialized state.\n}\n\n\n\/\/ Process 1 channel of audio, the AU will manage the number of parallel channels by creating multiple kernel instances\nvoid BlueFilter::BlueFilterKernel::Process(\tconst\tFloat32*\tinSourceP,\n\t\t\t\t\t\t\t\t\t\t\t\t\tFloat32*\tinDestP,\n                                                    UInt32 \t\tinFramesToProcess,\n                                                    UInt32\t\tinNumChannels, \/\/ for version 2 AudioUnits inNumChannels is always 1\n                                                    bool\t\t&ioSilence )\n{\n\tmInput->setVector(0, inFramesToProcess, (TTFloat32*)inSourceP);\n\tmOutput->setVectorSizeWithInt(inFramesToProcess);\n\tmOutput->alloc();\n\n\tmButter->setAttributeValue(TT(\"frequency\"),  GetParameter(kParam_One));\n\tmButter->process(mInput, mOutput);\n\t\n\tmOutput->getVector(0, inFramesToProcess, (TTFloat32*)inDestP);\n}\n\n<commit_msg>limiting min. Frequency value to 10 Hz<commit_after>#include \"BlueFilter.h\"\n\nCOMPONENT_ENTRY(BlueFilter)\n\n\nBlueFilter::BlueFilter(AudioUnit component)\n\t: AUEffectBase(component)\n{\t\n\tTTDSPInit();\n\t\n\tCreateElements();\n\tGlobals()->UseIndexedParameters(kNumberOfParameters);\n\n\tSetParameter(kParam_One, kDefaultValue_ParamOne);\n\tSetAFactoryPresetAsCurrent(kPresets[kPreset_Default]);\t\/\/ TODO: for some reason, this doesn't seem to be applied...\n\t\n\t#if AU_DEBUG_DISPATCHER\n\tmDebugDispatcher = new AUDebugDispatcher(this);\n\t#endif\n}\n\n\nOSStatus BlueFilter::GetParameterValueStrings(AudioUnitScope inScope, AudioUnitParameterID inParameterID, CFArrayRef* outStrings)\n{\n    return kAudioUnitErr_InvalidProperty;\n}\n\n\nOSStatus BlueFilter::GetParameterInfo(AudioUnitScope inScope, AudioUnitParameterID inParameterID, AudioUnitParameterInfo &outParameterInfo)\n{\n\tOSStatus result = noErr;\n\n\toutParameterInfo.flags = kAudioUnitParameterFlag_IsWritable\n\t\t\t\t\t\t|\t kAudioUnitParameterFlag_IsReadable;\n    \n    if(inScope == kAudioUnitScope_Global){\n        switch(inParameterID){\n            case kParam_One:\n                AUBase::FillInParameterName(outParameterInfo, kParameterOneName, false);\n                outParameterInfo.unit = kAudioUnitParameterUnit_Hertz;\n                outParameterInfo.minValue = 10.0;\n                outParameterInfo.maxValue = 20000.0;\n                outParameterInfo.defaultValue = kDefaultValue_ParamOne;\n                break;\n            default:\n                result = kAudioUnitErr_InvalidParameter;\n                break;\n\t\t}\n\t} \n\telse\n        result = kAudioUnitErr_InvalidParameter;\n\n\treturn result;\n}\n\n\nOSStatus BlueFilter::GetPropertyInfo(\tAudioUnitPropertyID\tinID,\n\t\t\t\t\t\t\t\t\t\tAudioUnitScope\t\tinScope,\n\t\t\t\t\t\t\t\t\t\tAudioUnitElement\tinElement,\n\t\t\t\t\t\t\t\t\t\tUInt32&\t\t\t\toutDataSize,\n\t\t\t\t\t\t\t\t\t\tBoolean&\t\t\toutWritable)\n{\n\treturn AUEffectBase::GetPropertyInfo (inID, inScope, inElement, outDataSize, outWritable);\n}\n\n\nOSStatus BlueFilter::GetProperty(\tAudioUnitPropertyID inID,\n\t\t\t\t\t\t\t\t\tAudioUnitScope \t\tinScope,\n\t\t\t\t\t\t\t\t\tAudioUnitElement \tinElement,\n\t\t\t\t\t\t\t\t\tvoid*\t\t\t\toutData )\n{\n\treturn AUEffectBase::GetProperty (inID, inScope, inElement, outData);\n}\n\n\nComponentResult BlueFilter::GetPresets(CFArrayRef* outData) const\n{\n    if(outData == NULL) \n\t\treturn noErr;\n\t\n    CFMutableArrayRef presetsArray = CFArrayCreateMutable(NULL, kNumberPresets, NULL);\n\t\n    for(int i=0; i<kNumberPresets; ++i)\n        CFArrayAppendValue(presetsArray, &kPresets [i]);\n\t\n    *outData = (CFArrayRef)presetsArray;\n    return noErr;\n}\n\n\nOSStatus BlueFilter::NewFactoryPresetSet(const AUPreset &inNewFactoryPreset)\n{\n    SInt32 chosenPreset = inNewFactoryPreset.presetNumber;\n\t\n    if(chosenPreset == kPreset_Low || chosenPreset == kPreset_High){\n        for(int i = 0; i < kNumberPresets; ++i){\n            if(chosenPreset == kPresets[i].presetNumber){\n                switch(chosenPreset){\n                    case kPreset_Low:\n                        SetParameter(kParam_One, kParameter_Preset_Low);\n                        break;\n                    case kPreset_High:\n\t\t\t\t\t\tSetParameter(kParam_One, kParameter_Preset_High);\n                        break;\n                }\n                SetAFactoryPresetAsCurrent(kPresets[i]);\n                return noErr;             \n            }\n        }\n    }\n    return kAudioUnitErr_InvalidProperty;\n}\n\n\n#pragma mark -\n#pragma mark BlueFilter Effect Kernel\n\nvoid BlueFilter::BlueFilterKernel::Reset()\n{\n\t;\/\/ do whatever work is necessary to return the audio unit to its pristine, initialized state.\n}\n\n\n\/\/ Process 1 channel of audio, the AU will manage the number of parallel channels by creating multiple kernel instances\nvoid BlueFilter::BlueFilterKernel::Process(\tconst\tFloat32*\tinSourceP,\n\t\t\t\t\t\t\t\t\t\t\t\t\tFloat32*\tinDestP,\n                                                    UInt32 \t\tinFramesToProcess,\n                                                    UInt32\t\tinNumChannels, \/\/ for version 2 AudioUnits inNumChannels is always 1\n                                                    bool\t\t&ioSilence )\n{\n\tmInput->setVector(0, inFramesToProcess, (TTFloat32*)inSourceP);\n\tmOutput->setVectorSizeWithInt(inFramesToProcess);\n\tmOutput->alloc();\n\n\tmButter->setAttributeValue(TT(\"frequency\"),  GetParameter(kParam_One));\n\tmButter->process(mInput, mOutput);\n\t\n\tmOutput->getVector(0, inFramesToProcess, (TTFloat32*)inDestP);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\n* Software License Agreement (BSD License)\n*\n*  Copyright 2016-2017 Davide Faconti\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#ifndef ROS_INTROSPECTION_HPP\n#define ROS_INTROSPECTION_HPP\n\n#include <unordered_set>\n#include \"ros_type_introspection\/stringtree_leaf.hpp\"\n#include \"ros_type_introspection\/substitution_rule.hpp\"\n#include \"absl\/types\/span.h\"\n\nnamespace RosIntrospection{\n\nstruct FlatMessage {\n\n  \/\/\/ Tree that the StringTreeLeaf(s) refer to.\n  const StringTree* tree;\n\n  \/\/\/ List of all those parsed fields that can be represented by a builtin value different from \"string\".\n  \/\/\/ This list will be filled by the funtion buildRosFlatType.\n  std::vector< std::pair<StringTreeLeaf, Variant> > value;\n\n  \/\/\/ List of all those parsed fields that can be represented by a builtin value equal to \"string\".\n  \/\/\/ This list will be filled by the funtion buildRosFlatType.\n  std::vector< std::pair<StringTreeLeaf, std::string> > name;\n\n  \/\/ Not used yet\n  std::vector< std::pair<StringTreeLeaf, std::vector<uint8_t>>> blob;\n};\n\ntypedef std::vector< std::pair<std::string, Variant> > RenamedValues;\n\nclass Parser{\n\npublic:\n  Parser(): _global_warnings(&std::cerr), _rule_cache_dirty(true) {}\n\n  \/**\n   * @brief A single message definition will (most probably) generate myltiple ROSMessage(s).\n   * In fact the \"child\" ROSTypes are parsed as well in a recursive and hierarchical way.\n   * To make an example, given as input the [geometry_msgs\/Pose](http:\/\/docs.ros.org\/kinetic\/api\/geometry_msgs\/html\/msg\/Pose.html)\n   * the result will be a ROSTypeList containing Pose, Point and Quaternion.\n   *\n   * @param msg_identifier name to give to the main type to be extracted.\n   *\n   * @param msg_definition text obtained by either:\n   *                       - topic_tools::ShapeShifter::getMessageDefinition()\n   *                       - rosbag::MessageInstance::getMessageDefinition()\n   *                       - ros::message_traits::Definition< __your_type__ >::value()\n   *\/\n  void registerMessageDefinition(const std::string& message_identifier,\n                                 const ROSType &main_type,\n                                 const std::string& definition);\n\n  \/**\n   * @brief registerRenamingRules is used to register the renaming rules. You MUST use registerMessageDefinition first.\n   *\n   * @param type    The type which must be renamed\n   * @param rules   A list of rules to apply to the type.\n   *\/\n  void registerRenamingRules(const ROSType& type,\n                             const std::vector<SubstitutionRule> &rules );\n\n  \/**\n   * @brief getMessageInfo provides some metadata amout a registered ROSMessage.\n   *\n   * @param msg_identifier String ID to identify the registered message (use registerMessageDefinition first).\n   * @return               Pointer to the instance or nullptr if not registered.\n   *\/\n  const ROSMessageInfo* getMessageInfo(const std::string& msg_identifier) const;\n\n  \/**\n   * @brief getMessageByType provides a pointer to a ROSMessage stored in ROSMessageInfo.\n   *\n   * @param type   ROSType to be found\n   * @param info   Instance or ROSMessageInfo that shall contain the ROSType to be found.\n   * @return       Pointer to the instance or nullptr if not registered.\n   *\/\n  const ROSMessage *getMessageByType(const ROSType& type, const ROSMessageInfo &info) const;\n\n  \/**\n   * @brief deserializeIntoFlatContainer takes a raw buffer of memory and extract information from it.\n   *  This data is stored in two key\/value vectors, FlatMessage::value and FlatMessage::name.\n   * It must be noted that the key type is StringTreeLeaf. this type is not particularly user-friendly,\n   * but allows a much faster post-processing.\n   *\n   * IMPORTANT: this approach is not meant to be used with use arrays such as maps, point clouds and images.\n   * It would require a ridicoulous amount of memory and, franckly, make little sense.\n   * For this reason the argument max_array_size is used.\n   *\n   * This funtion is almost always followed by applyNameTransform, which provide a more human-readable\n   * key-value representation.\n   *\n   * @param msg_identifier   String ID to identify the registered message (use registerMessageDefinition first).\n   * @param buffer           raw memory to be parsed.\n   * @param flat_container_output  output to store the result. It is recommended to reuse the same object multiple times to\n   *                               avoid memory allocations and speed up the parsing.\n   * @param max_array_size   Usually we want to avoid special cases like maps and images, which contain very large arrays.\n   *                         max_array_size is used to skip these arrays that are too large.\n   *\n   * return true if the entire message was parsed or false if parts of the message were\n   * skipped because an array has (size > max_array_size)\n   *\/\n  bool deserializeIntoFlatContainer(const std::string& msg_identifier,\n                                    absl::Span<uint8_t> buffer,\n                                    FlatMessage* flat_container_output,\n                                    const uint32_t max_array_size ) const;\n\n  \/**\n   * @brief applyNameTransform is used to create a vector of type RenamedValues from\n   *        the vector FlatMessage::value. Additionally, it apply the renaming rules previously\n   *        registred using registerRenamingRules.\n   *\n   * For example if you apply this to [geometry_msgs\/Pose](http:\/\/docs.ros.org\/kinetic\/api\/geometry_msgs\/html\/msg\/Pose.html)\n   * the vector renamed_value.value will contain the following pairs (where ... is the number of that field) :\n   *\n   *  - Pose\/Point\/x = ...\n   *  - Pose\/Point\/y = ...\n   *  - Pose\/Point\/z = ...\n   *  - Pose\/Quaternion\/x = ...\n   *  - Pose\/Quaternion\/y = ...\n   *  - Pose\/Quaternion\/z = ...\n   *  - Pose.Quaternion\/w = ...\n   *\n   * @param msg_identifier  String ID to identify the registered message (use registerMessageDefinition first).\n   * @param container       Source. This instance must be created using deserializeIntoFlatContainer.\n   * @param renamed_value   Destination.\n   *\/\n  void applyNameTransform(const std::string& msg_identifier,\n                          const FlatMessage& container,\n                          RenamedValues* renamed_value );\n\n  typedef std::function<void(const ROSType&, absl::Span<uint8_t>&)> VisitingCallback;\n\n  \/**\n   * @brief applyVisitorToBuffer is used to pass a callback that is invoked every time\n   *        a chunk of memory storing an instance of ROSType = monitored_type\n   *        is reached.\n   *        Note that the VisitingCallback can modify the original message, but can NOT\n   *        change its size. This means that strings and vectors can not be change their length.\n   *\n   * @param msg_identifier    String ID to identify the registered message (use registerMessageDefinition first).\n   * @param monitored_type    ROSType that triggers the invokation to the callback\n   * @param buffer            Original buffer, passed as mutable since it might be modified.\n   * @param callback          The callback.\n   *\/\n  void applyVisitorToBuffer(const std::string& msg_identifier, const ROSType &monitored_type,\n                            absl::Span<uint8_t> &buffer,\n                            VisitingCallback callback) const;\n\n  \/\/\/ Change where the warning messages are displayed.\n  void setWarningsStream(std::ostream* output) { _global_warnings = output; }\n\nprivate:\n\n\n  struct RulesCache{\n    RulesCache( const SubstitutionRule& r):\n      rule( &r ), pattern_head(nullptr), alias_head(nullptr)\n    {}\n    const SubstitutionRule* rule;\n    const StringTreeNode* pattern_head;\n    const StringTreeNode* alias_head;\n    bool operator==(const RulesCache& other) { return  this->rule == other.rule; }\n  };\n\n  std::unordered_map<std::string, ROSMessageInfo> _registered_messages;\n  std::unordered_map<ROSType,     std::unordered_set<SubstitutionRule>>   _registered_rules;\n  std::unordered_map<std::string, std::vector<RulesCache>>  _rule_caches;\n\n  void updateRuleCache();\n\n  bool _rule_cache_dirty;\n\n  void createTrees(ROSMessageInfo &info, const std::string &type_name) const;\n\n  std::ostream* _global_warnings;\n\n  std::vector<int> _alias_array_pos;\n  std::vector<std::string> _formatted_string;\n  std::vector<int8_t> _substituted;\n};\n\n}\n\n#endif \/\/ ROS_INTROSPECTION_HPP\n<commit_msg>fixed -Wreorder (#24)<commit_after>\/*********************************************************************\n* Software License Agreement (BSD License)\n*\n*  Copyright 2016-2017 Davide Faconti\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#ifndef ROS_INTROSPECTION_HPP\n#define ROS_INTROSPECTION_HPP\n\n#include <unordered_set>\n#include \"ros_type_introspection\/stringtree_leaf.hpp\"\n#include \"ros_type_introspection\/substitution_rule.hpp\"\n#include \"absl\/types\/span.h\"\n\nnamespace RosIntrospection{\n\nstruct FlatMessage {\n\n  \/\/\/ Tree that the StringTreeLeaf(s) refer to.\n  const StringTree* tree;\n\n  \/\/\/ List of all those parsed fields that can be represented by a builtin value different from \"string\".\n  \/\/\/ This list will be filled by the funtion buildRosFlatType.\n  std::vector< std::pair<StringTreeLeaf, Variant> > value;\n\n  \/\/\/ List of all those parsed fields that can be represented by a builtin value equal to \"string\".\n  \/\/\/ This list will be filled by the funtion buildRosFlatType.\n  std::vector< std::pair<StringTreeLeaf, std::string> > name;\n\n  \/\/ Not used yet\n  std::vector< std::pair<StringTreeLeaf, std::vector<uint8_t>>> blob;\n};\n\ntypedef std::vector< std::pair<std::string, Variant> > RenamedValues;\n\nclass Parser{\n\npublic:\n  Parser(): _rule_cache_dirty(true), _global_warnings(&std::cerr) {}\n\n  \/**\n   * @brief A single message definition will (most probably) generate myltiple ROSMessage(s).\n   * In fact the \"child\" ROSTypes are parsed as well in a recursive and hierarchical way.\n   * To make an example, given as input the [geometry_msgs\/Pose](http:\/\/docs.ros.org\/kinetic\/api\/geometry_msgs\/html\/msg\/Pose.html)\n   * the result will be a ROSTypeList containing Pose, Point and Quaternion.\n   *\n   * @param msg_identifier name to give to the main type to be extracted.\n   *\n   * @param msg_definition text obtained by either:\n   *                       - topic_tools::ShapeShifter::getMessageDefinition()\n   *                       - rosbag::MessageInstance::getMessageDefinition()\n   *                       - ros::message_traits::Definition< __your_type__ >::value()\n   *\/\n  void registerMessageDefinition(const std::string& message_identifier,\n                                 const ROSType &main_type,\n                                 const std::string& definition);\n\n  \/**\n   * @brief registerRenamingRules is used to register the renaming rules. You MUST use registerMessageDefinition first.\n   *\n   * @param type    The type which must be renamed\n   * @param rules   A list of rules to apply to the type.\n   *\/\n  void registerRenamingRules(const ROSType& type,\n                             const std::vector<SubstitutionRule> &rules );\n\n  \/**\n   * @brief getMessageInfo provides some metadata amout a registered ROSMessage.\n   *\n   * @param msg_identifier String ID to identify the registered message (use registerMessageDefinition first).\n   * @return               Pointer to the instance or nullptr if not registered.\n   *\/\n  const ROSMessageInfo* getMessageInfo(const std::string& msg_identifier) const;\n\n  \/**\n   * @brief getMessageByType provides a pointer to a ROSMessage stored in ROSMessageInfo.\n   *\n   * @param type   ROSType to be found\n   * @param info   Instance or ROSMessageInfo that shall contain the ROSType to be found.\n   * @return       Pointer to the instance or nullptr if not registered.\n   *\/\n  const ROSMessage *getMessageByType(const ROSType& type, const ROSMessageInfo &info) const;\n\n  \/**\n   * @brief deserializeIntoFlatContainer takes a raw buffer of memory and extract information from it.\n   *  This data is stored in two key\/value vectors, FlatMessage::value and FlatMessage::name.\n   * It must be noted that the key type is StringTreeLeaf. this type is not particularly user-friendly,\n   * but allows a much faster post-processing.\n   *\n   * IMPORTANT: this approach is not meant to be used with use arrays such as maps, point clouds and images.\n   * It would require a ridicoulous amount of memory and, franckly, make little sense.\n   * For this reason the argument max_array_size is used.\n   *\n   * This funtion is almost always followed by applyNameTransform, which provide a more human-readable\n   * key-value representation.\n   *\n   * @param msg_identifier   String ID to identify the registered message (use registerMessageDefinition first).\n   * @param buffer           raw memory to be parsed.\n   * @param flat_container_output  output to store the result. It is recommended to reuse the same object multiple times to\n   *                               avoid memory allocations and speed up the parsing.\n   * @param max_array_size   Usually we want to avoid special cases like maps and images, which contain very large arrays.\n   *                         max_array_size is used to skip these arrays that are too large.\n   *\n   * return true if the entire message was parsed or false if parts of the message were\n   * skipped because an array has (size > max_array_size)\n   *\/\n  bool deserializeIntoFlatContainer(const std::string& msg_identifier,\n                                    absl::Span<uint8_t> buffer,\n                                    FlatMessage* flat_container_output,\n                                    const uint32_t max_array_size ) const;\n\n  \/**\n   * @brief applyNameTransform is used to create a vector of type RenamedValues from\n   *        the vector FlatMessage::value. Additionally, it apply the renaming rules previously\n   *        registred using registerRenamingRules.\n   *\n   * For example if you apply this to [geometry_msgs\/Pose](http:\/\/docs.ros.org\/kinetic\/api\/geometry_msgs\/html\/msg\/Pose.html)\n   * the vector renamed_value.value will contain the following pairs (where ... is the number of that field) :\n   *\n   *  - Pose\/Point\/x = ...\n   *  - Pose\/Point\/y = ...\n   *  - Pose\/Point\/z = ...\n   *  - Pose\/Quaternion\/x = ...\n   *  - Pose\/Quaternion\/y = ...\n   *  - Pose\/Quaternion\/z = ...\n   *  - Pose.Quaternion\/w = ...\n   *\n   * @param msg_identifier  String ID to identify the registered message (use registerMessageDefinition first).\n   * @param container       Source. This instance must be created using deserializeIntoFlatContainer.\n   * @param renamed_value   Destination.\n   *\/\n  void applyNameTransform(const std::string& msg_identifier,\n                          const FlatMessage& container,\n                          RenamedValues* renamed_value );\n\n  typedef std::function<void(const ROSType&, absl::Span<uint8_t>&)> VisitingCallback;\n\n  \/**\n   * @brief applyVisitorToBuffer is used to pass a callback that is invoked every time\n   *        a chunk of memory storing an instance of ROSType = monitored_type\n   *        is reached.\n   *        Note that the VisitingCallback can modify the original message, but can NOT\n   *        change its size. This means that strings and vectors can not be change their length.\n   *\n   * @param msg_identifier    String ID to identify the registered message (use registerMessageDefinition first).\n   * @param monitored_type    ROSType that triggers the invokation to the callback\n   * @param buffer            Original buffer, passed as mutable since it might be modified.\n   * @param callback          The callback.\n   *\/\n  void applyVisitorToBuffer(const std::string& msg_identifier, const ROSType &monitored_type,\n                            absl::Span<uint8_t> &buffer,\n                            VisitingCallback callback) const;\n\n  \/\/\/ Change where the warning messages are displayed.\n  void setWarningsStream(std::ostream* output) { _global_warnings = output; }\n\nprivate:\n\n\n  struct RulesCache{\n    RulesCache( const SubstitutionRule& r):\n      rule( &r ), pattern_head(nullptr), alias_head(nullptr)\n    {}\n    const SubstitutionRule* rule;\n    const StringTreeNode* pattern_head;\n    const StringTreeNode* alias_head;\n    bool operator==(const RulesCache& other) { return  this->rule == other.rule; }\n  };\n\n  std::unordered_map<std::string, ROSMessageInfo> _registered_messages;\n  std::unordered_map<ROSType,     std::unordered_set<SubstitutionRule>>   _registered_rules;\n  std::unordered_map<std::string, std::vector<RulesCache>>  _rule_caches;\n\n  void updateRuleCache();\n\n  bool _rule_cache_dirty;\n\n  void createTrees(ROSMessageInfo &info, const std::string &type_name) const;\n\n  std::ostream* _global_warnings;\n\n  std::vector<int> _alias_array_pos;\n  std::vector<std::string> _formatted_string;\n  std::vector<int8_t> _substituted;\n};\n\n}\n\n#endif \/\/ ROS_INTROSPECTION_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file   lllogin_test.cpp\n * @author Mark Palange\n * @date   2009-02-26\n * @brief  Tests of lllogin.cpp.\n * \n * $LicenseInfo:firstyear=2009&license=internal$\n * Copyright (c) 2009, Linden Research, Inc.\n * $\/LicenseInfo$\n *\/\n\n\/\/ Precompiled header\n#include \"linden_common.h\"\n\/\/ associated header\n#include \"..\/lllogin.h\"\n\/\/ STL headers\n\/\/ std headers\n#include <iostream>\n\/\/ external library headers\n\/\/ other Linden headers\n#include \"llsd.h\"\n#include \"..\/..\/..\/test\/lltut.h\"\n\/\/#define DEBUG_ON\n#include \"..\/..\/..\/test\/debug.h\"\n#include \"llevents.h\"\n#include \"stringize.h\"\n\n\/*****************************************************************************\n*   Helper classes\n*****************************************************************************\/\n\/\/ This is a listener to receive results from lllogin.\nclass LoginListener: public LLEventTrackable\n{\n\tstd::string mName;\n\tLLSD mLastEvent;\n    Debug mDebug;\npublic:\n\tLoginListener(const std::string& name) : \n\t\tmName(name),\n        mDebug(stringize(*this))\n\t{}\n\n\tbool call(const LLSD& event)\n\t{\n\t\tmDebug(STRINGIZE(\"LoginListener called!: \" << event));\n\t\tmLastEvent = event;\n\t\treturn false;\n\t}\n\n    LLBoundListener listenTo(LLEventPump& pump)\n    {\n        return pump.listen(mName, boost::bind(&LoginListener::call, this, _1));\n\t}\n\n\tLLSD lastEvent() { return mLastEvent; }\n\n    friend std::ostream& operator<<(std::ostream& out, const LoginListener& listener)\n    {\n        return out << \"LoginListener(\" << listener.mName << ')';\n    }\n};\n\nclass LLAresListener: public LLEventTrackable\n{\n\tstd::string mName;\n\tLLSD mEvent;\n\tbool mImmediateResponse;\n\tbool mMultipleURIResponse;\n    Debug mDebug;\n\t\npublic:\n\tLLAresListener(const std::string& name, \n\t\t\t\t   bool i = false,\n\t\t\t\t   bool m = false\n\t\t\t\t   ) : \n\t\tmName(name),\n\t\tmImmediateResponse(i),\n\t\tmMultipleURIResponse(m),\n        mDebug(stringize(*this))\n\t{}\n\n\tbool handle_event(const LLSD& event)\n\t{\n\t\tmDebug(STRINGIZE(\"LLAresListener called!: \" << event));\n\t\tmEvent = event;\n\t\tif(mImmediateResponse)\n\t\t{\n\t\t\tsendReply();\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid sendReply()\n\t{\n\t\tif(mEvent[\"op\"].asString() == \"rewriteURI\")\n\t\t{\n\t\t\tLLSD result;\n\t\t\tif(mMultipleURIResponse)\n\t\t\t{\n\t\t\t\tresult.append(LLSD(\"login.foo.com\"));\n\t\t\t}\n\t\t\tresult.append(mEvent[\"uri\"]);\n\t\t\tLLEventPumps::instance().obtain(mEvent[\"reply\"]).post(result);\n\t\t}\n\t}\n\n\tLLBoundListener listenTo(LLEventPump& pump)\n    {\n        return pump.listen(mName, boost::bind(&LLAresListener::handle_event, this, _1));\n\t}\n\n    friend std::ostream& operator<<(std::ostream& out, const LLAresListener& listener)\n    {\n        return out << \"LLAresListener(\" << listener.mName << ')';\n    }\n};\n\nclass LLXMLRPCListener: public LLEventTrackable\n{\n\tstd::string mName;\n\tLLSD mEvent;\n\tbool mImmediateResponse;\n\tLLSD mResponse;\n    Debug mDebug;\n\npublic:\n\tLLXMLRPCListener(const std::string& name, \n\t\t\t\t\t bool i = false,\n\t\t\t\t\t const LLSD& response = LLSD()\n\t\t\t\t\t ) : \n\t\tmName(name),\n\t\tmImmediateResponse(i),\n\t\tmResponse(response),\n        mDebug(stringize(*this))\n\t{\n\t\tif(mResponse.isUndefined())\n\t\t{\n\t\t\tmResponse[\"status\"] = \"Complete\"; \/\/ StatusComplete\n\t\t\tmResponse[\"errorcode\"] = 0;\n\t\t\tmResponse[\"error\"] = \"dummy response\";\n\t\t\tmResponse[\"transfer_rate\"] = 0;\n\t\t\tmResponse[\"responses\"][\"login\"] = true;\n\t\t}\n\t}\n\n\tvoid setResponse(const LLSD& r) \n\t{ \n\t\tmResponse = r; \n\t}\n\n\tbool handle_event(const LLSD& event)\n\t{\n\t\tmDebug(STRINGIZE(\"LLXMLRPCListener called!: \" << event));\n\t\tmEvent = event;\n\t\tif(mImmediateResponse)\n\t\t{\n\t\t\tsendReply();\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid sendReply()\n\t{\n\t\tLLEventPumps::instance().obtain(mEvent[\"reply\"]).post(mResponse);\n\t}\n\n\tLLBoundListener listenTo(LLEventPump& pump)\n    {\n        return pump.listen(mName, boost::bind(&LLXMLRPCListener::handle_event, this, _1));\n\t}\n\n    friend std::ostream& operator<<(std::ostream& out, const LLXMLRPCListener& listener)\n    {\n        return out << \"LLXMLRPCListener(\" << listener.mName << ')';\n    }\n};\n\n\/*****************************************************************************\n*   TUT\n*****************************************************************************\/\nnamespace tut\n{\n    struct llviewerlogin_data\n    {\n\t\tllviewerlogin_data() :\n            pumps(LLEventPumps::instance())\n\t\t{}\n\t\tLLEventPumps& pumps;\n\t};\n\n    typedef test_group<llviewerlogin_data> llviewerlogin_group;\n    typedef llviewerlogin_group::object llviewerlogin_object;\n    llviewerlogin_group llviewerlogingrp(\"llviewerlogin\");\n\n    template<> template<>\n    void llviewerlogin_object::test<1>()\n    {\n        DEBUG;\n\t\t\/\/ Testing login with immediate repsonses from Ares and XMLPRC\n\t\t\/\/ The response from both requests will come before the post request exits.\n\t\t\/\/ This tests an edge case of the login state handling.\n\t\tLLEventStream llaresPump(\"LLAres\"); \/\/ Dummy LLAres pump.\n\t\tLLEventStream xmlrpcPump(\"LLXMLRPCTransaction\"); \/\/ Dummy XMLRPC pump\n\n\t\tbool respond_immediately = true;\n\t\t\/\/ Have 'dummy ares' repsond immediately. \n\t\tLLAresListener dummyLLAres(\"dummy_llares\", respond_immediately);\n\t\tdummyLLAres.listenTo(llaresPump);\n\n\t\t\/\/ Have dummy XMLRPC respond immediately.\n\t\tLLXMLRPCListener dummyXMLRPC(\"dummy_xmlrpc\", respond_immediately);\n\t\tdummyXMLRPC.listenTo(xmlrpcPump);\n\n\t\tLLLogin login;\n\n\t\tLoginListener listener(\"test_ear\");\n\t\tlistener.listenTo(login.getEventPump());\n\n\t\tLLSD credentials;\n\t\tcredentials[\"first\"] = \"foo\";\n\t\tcredentials[\"last\"] = \"bar\";\n\t\tcredentials[\"passwd\"] = \"secret\";\n\n\t\tlogin.connect(\"login.bar.com\", credentials);\n\n\t\tensure_equals(\"Online state\", listener.lastEvent()[\"state\"].asString(), \"online\");\n\t}\n\n    template<> template<>\n    void llviewerlogin_object::test<2>()\n    {\n        DEBUG;\n\t\t\/\/ Tests a successful login in with delayed responses. \n\t\t\/\/ Also includes 'failure' that cause the login module\n\t\t\/\/ To re-attempt connection, once from a basic failure\n\t\t\/\/ and once from the 'indeterminate' response.\n\n\t\tset_test_name(\"LLLogin multiple srv uris w\/ success\");\n\n\t\t\/\/ Testing normal login procedure.\n\t\tLLEventStream llaresPump(\"LLAres\"); \/\/ Dummy LLAres pump.\n\t\tLLEventStream xmlrpcPump(\"LLXMLRPCTransaction\"); \/\/ Dummy XMLRPC pump\n\n\t\tbool respond_immediately = false;\n\t\tbool multiple_addresses = true;\n\t\tLLAresListener dummyLLAres(\"dummy_llares\", respond_immediately, multiple_addresses);\n\t\tdummyLLAres.listenTo(llaresPump);\n\n\t\tLLXMLRPCListener dummyXMLRPC(\"dummy_xmlrpc\");\n\t\tdummyXMLRPC.listenTo(xmlrpcPump);\n\n\t\tLLLogin login;\n\n\t\tLoginListener listener(\"test_ear\");\n\t\tlistener.listenTo(login.getEventPump());\n\n\t\tLLSD credentials;\n\t\tcredentials[\"first\"] = \"foo\";\n\t\tcredentials[\"last\"] = \"bar\";\n\t\tcredentials[\"passwd\"] = \"secret\";\n\n\t\tlogin.connect(\"login.bar.com\", credentials);\n\n\t\tensure_equals(\"SRV state\", listener.lastEvent()[\"state\"].asString(), \"srvrequest\"); \n\n\t\tdummyLLAres.sendReply();\n\n\t\t\/\/ Test Authenticating State prior to first response.\n\t\tensure_equals(\"Auth state 1\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\t\tensure_equals(\"Attempt 1\", listener.lastEvent()[\"data\"][\"attempt\"].asInteger(), 1); \n\t\tensure_equals(\"URI 1\", listener.lastEvent()[\"data\"][\"request\"][\"uri\"].asString(), \"login.foo.com\"); \n\n\t\t\/\/ First send emulated LLXMLRPCListener failure,\n\t\t\/\/ this should return login to the authenticating step and increase the attempt \n\t\t\/\/ count.\n\t\tLLSD data;\n\t\tdata[\"status\"] = \"OtherError\"; \n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Fail back to authenticate 1\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\t\tensure_equals(\"Attempt 2\", listener.lastEvent()[\"data\"][\"attempt\"].asInteger(), 2); \n\t\tensure_equals(\"URI 2\", listener.lastEvent()[\"data\"][\"request\"][\"uri\"].asString(), \"login.bar.com\"); \n\n\t\t\/\/ Now send the 'indeterminate' response.\n\t\tdata.clear();\n\t\tdata[\"status\"] = \"Complete\"; \/\/ StatusComplete\n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdata[\"responses\"][\"login\"] = \"indeterminate\";\n\t\tdata[\"next_url\"] = \"login.indeterminate.com\";\t\t\t\n\t\tdata[\"next_method\"] = \"test_login_method\"; \t\t\t\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Fail back to authenticate 2\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\t\tensure_equals(\"Attempt 3\", listener.lastEvent()[\"data\"][\"attempt\"].asInteger(), 3); \n\t\tensure_equals(\"URI 3\", listener.lastEvent()[\"data\"][\"request\"][\"uri\"].asString(), \"login.indeterminate.com\"); \n\n\t\t\/\/ Finally let the auth succeed.\n\t\tdata.clear();\n\t\tdata[\"status\"] = \"Complete\"; \/\/ StatusComplete\n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdata[\"responses\"][\"login\"] = \"true\";\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Success state\", listener.lastEvent()[\"state\"].asString(), \"online\");\n\n\t\tlogin.disconnect();\n\n\t\tensure_equals(\"Disconnected state\", listener.lastEvent()[\"state\"].asString(), \"offline\");\n\t}\n\n    template<> template<>\n    void llviewerlogin_object::test<3>()\n    {\n        DEBUG;\n\t\t\/\/ Test completed response, that fails to login.\n\t\tset_test_name(\"LLLogin valid response, failure (eg. bad credentials)\");\n\n\t\t\/\/ Testing normal login procedure.\n\t\tLLEventStream llaresPump(\"LLAres\"); \/\/ Dummy LLAres pump.\n\t\tLLEventStream xmlrpcPump(\"LLXMLRPCTransaction\"); \/\/ Dummy XMLRPC pump\n\n\t\tLLAresListener dummyLLAres(\"dummy_llares\");\n\t\tdummyLLAres.listenTo(llaresPump);\n\n\t\tLLXMLRPCListener dummyXMLRPC(\"dummy_xmlrpc\");\n\t\tdummyXMLRPC.listenTo(xmlrpcPump);\n\n\t\tLLLogin login;\n\t\tLoginListener listener(\"test_ear\");\n\t\tlistener.listenTo(login.getEventPump());\n\n\t\tLLSD credentials;\n\t\tcredentials[\"first\"] = \"who\";\n\t\tcredentials[\"last\"] = \"what\";\n\t\tcredentials[\"passwd\"] = \"badpasswd\";\n\n\t\tlogin.connect(\"login.bar.com\", credentials);\n\n\t\tensure_equals(\"SRV state\", listener.lastEvent()[\"state\"].asString(), \"srvrequest\"); \n\n\t\tdummyLLAres.sendReply();\n\n\t\tensure_equals(\"Auth state\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\n\t\t\/\/ Send the failed auth request reponse\n\t\tLLSD data;\n\t\tdata[\"status\"] = \"Complete\";\n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdata[\"responses\"][\"login\"] = \"false\";\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Failed to offline\", listener.lastEvent()[\"state\"].asString(), \"offline\");\n\t}\n\n    template<> template<>\n    void llviewerlogin_object::test<4>()\n    {\n        DEBUG;\n\t\t\/\/ Test incomplete response, that end the attempt.\n\t\tset_test_name(\"LLLogin valid response, failure (eg. bad credentials)\");\n\n\t\t\/\/ Testing normal login procedure.\n\t\tLLEventStream llaresPump(\"LLAres\"); \/\/ Dummy LLAres pump.\n\t\tLLEventStream xmlrpcPump(\"LLXMLRPCTransaction\"); \/\/ Dummy XMLRPC pump\n\n\t\tLLAresListener dummyLLAres(\"dummy_llares\");\n\t\tdummyLLAres.listenTo(llaresPump);\n\n\t\tLLXMLRPCListener dummyXMLRPC(\"dummy_xmlrpc\");\n\t\tdummyXMLRPC.listenTo(xmlrpcPump);\n\n\t\tLLLogin login;\n\t\tLoginListener listener(\"test_ear\");\n\t\tlistener.listenTo(login.getEventPump());\n\n\t\tLLSD credentials;\n\t\tcredentials[\"first\"] = \"these\";\n\t\tcredentials[\"last\"] = \"don't\";\n\t\tcredentials[\"passwd\"] = \"matter\";\n\n\t\tlogin.connect(\"login.bar.com\", credentials);\n\n\t\tensure_equals(\"SRV state\", listener.lastEvent()[\"state\"].asString(), \"srvrequest\"); \n\n\t\tdummyLLAres.sendReply();\n\n\t\tensure_equals(\"Auth state\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\n\t\t\/\/ Send the failed auth request reponse\n\t\tLLSD data;\n\t\tdata[\"status\"] = \"OtherError\";\n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Failed to offline\", listener.lastEvent()[\"state\"].asString(), \"offline\");\n\t}\n}\n<commit_msg>DEV-32777: tip won't even build on Windows without pacifying MSVC warning<commit_after>\/**\n * @file   lllogin_test.cpp\n * @author Mark Palange\n * @date   2009-02-26\n * @brief  Tests of lllogin.cpp.\n * \n * $LicenseInfo:firstyear=2009&license=internal$\n * Copyright (c) 2009, Linden Research, Inc.\n * $\/LicenseInfo$\n *\/\n\n#if LL_WINDOWS\n#pragma warning (disable : 4355) \/\/ 'this' used in initializer list: yes, intentionally\n#endif\n\n\/\/ Precompiled header\n#include \"linden_common.h\"\n\/\/ associated header\n#include \"..\/lllogin.h\"\n\/\/ STL headers\n\/\/ std headers\n#include <iostream>\n\/\/ external library headers\n\/\/ other Linden headers\n#include \"llsd.h\"\n#include \"..\/..\/..\/test\/lltut.h\"\n\/\/#define DEBUG_ON\n#include \"..\/..\/..\/test\/debug.h\"\n#include \"llevents.h\"\n#include \"stringize.h\"\n\n\/*****************************************************************************\n*   Helper classes\n*****************************************************************************\/\n\/\/ This is a listener to receive results from lllogin.\nclass LoginListener: public LLEventTrackable\n{\n\tstd::string mName;\n\tLLSD mLastEvent;\n    Debug mDebug;\npublic:\n\tLoginListener(const std::string& name) : \n\t\tmName(name),\n        mDebug(stringize(*this))\n\t{}\n\n\tbool call(const LLSD& event)\n\t{\n\t\tmDebug(STRINGIZE(\"LoginListener called!: \" << event));\n\t\tmLastEvent = event;\n\t\treturn false;\n\t}\n\n    LLBoundListener listenTo(LLEventPump& pump)\n    {\n        return pump.listen(mName, boost::bind(&LoginListener::call, this, _1));\n\t}\n\n\tLLSD lastEvent() { return mLastEvent; }\n\n    friend std::ostream& operator<<(std::ostream& out, const LoginListener& listener)\n    {\n        return out << \"LoginListener(\" << listener.mName << ')';\n    }\n};\n\nclass LLAresListener: public LLEventTrackable\n{\n\tstd::string mName;\n\tLLSD mEvent;\n\tbool mImmediateResponse;\n\tbool mMultipleURIResponse;\n    Debug mDebug;\n\t\npublic:\n\tLLAresListener(const std::string& name, \n\t\t\t\t   bool i = false,\n\t\t\t\t   bool m = false\n\t\t\t\t   ) : \n\t\tmName(name),\n\t\tmImmediateResponse(i),\n\t\tmMultipleURIResponse(m),\n        mDebug(stringize(*this))\n\t{}\n\n\tbool handle_event(const LLSD& event)\n\t{\n\t\tmDebug(STRINGIZE(\"LLAresListener called!: \" << event));\n\t\tmEvent = event;\n\t\tif(mImmediateResponse)\n\t\t{\n\t\t\tsendReply();\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid sendReply()\n\t{\n\t\tif(mEvent[\"op\"].asString() == \"rewriteURI\")\n\t\t{\n\t\t\tLLSD result;\n\t\t\tif(mMultipleURIResponse)\n\t\t\t{\n\t\t\t\tresult.append(LLSD(\"login.foo.com\"));\n\t\t\t}\n\t\t\tresult.append(mEvent[\"uri\"]);\n\t\t\tLLEventPumps::instance().obtain(mEvent[\"reply\"]).post(result);\n\t\t}\n\t}\n\n\tLLBoundListener listenTo(LLEventPump& pump)\n    {\n        return pump.listen(mName, boost::bind(&LLAresListener::handle_event, this, _1));\n\t}\n\n    friend std::ostream& operator<<(std::ostream& out, const LLAresListener& listener)\n    {\n        return out << \"LLAresListener(\" << listener.mName << ')';\n    }\n};\n\nclass LLXMLRPCListener: public LLEventTrackable\n{\n\tstd::string mName;\n\tLLSD mEvent;\n\tbool mImmediateResponse;\n\tLLSD mResponse;\n    Debug mDebug;\n\npublic:\n\tLLXMLRPCListener(const std::string& name, \n\t\t\t\t\t bool i = false,\n\t\t\t\t\t const LLSD& response = LLSD()\n\t\t\t\t\t ) : \n\t\tmName(name),\n\t\tmImmediateResponse(i),\n\t\tmResponse(response),\n        mDebug(stringize(*this))\n\t{\n\t\tif(mResponse.isUndefined())\n\t\t{\n\t\t\tmResponse[\"status\"] = \"Complete\"; \/\/ StatusComplete\n\t\t\tmResponse[\"errorcode\"] = 0;\n\t\t\tmResponse[\"error\"] = \"dummy response\";\n\t\t\tmResponse[\"transfer_rate\"] = 0;\n\t\t\tmResponse[\"responses\"][\"login\"] = true;\n\t\t}\n\t}\n\n\tvoid setResponse(const LLSD& r) \n\t{ \n\t\tmResponse = r; \n\t}\n\n\tbool handle_event(const LLSD& event)\n\t{\n\t\tmDebug(STRINGIZE(\"LLXMLRPCListener called!: \" << event));\n\t\tmEvent = event;\n\t\tif(mImmediateResponse)\n\t\t{\n\t\t\tsendReply();\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid sendReply()\n\t{\n\t\tLLEventPumps::instance().obtain(mEvent[\"reply\"]).post(mResponse);\n\t}\n\n\tLLBoundListener listenTo(LLEventPump& pump)\n    {\n        return pump.listen(mName, boost::bind(&LLXMLRPCListener::handle_event, this, _1));\n\t}\n\n    friend std::ostream& operator<<(std::ostream& out, const LLXMLRPCListener& listener)\n    {\n        return out << \"LLXMLRPCListener(\" << listener.mName << ')';\n    }\n};\n\n\/*****************************************************************************\n*   TUT\n*****************************************************************************\/\nnamespace tut\n{\n    struct llviewerlogin_data\n    {\n\t\tllviewerlogin_data() :\n            pumps(LLEventPumps::instance())\n\t\t{}\n\t\tLLEventPumps& pumps;\n\t};\n\n    typedef test_group<llviewerlogin_data> llviewerlogin_group;\n    typedef llviewerlogin_group::object llviewerlogin_object;\n    llviewerlogin_group llviewerlogingrp(\"llviewerlogin\");\n\n    template<> template<>\n    void llviewerlogin_object::test<1>()\n    {\n        DEBUG;\n\t\t\/\/ Testing login with immediate repsonses from Ares and XMLPRC\n\t\t\/\/ The response from both requests will come before the post request exits.\n\t\t\/\/ This tests an edge case of the login state handling.\n\t\tLLEventStream llaresPump(\"LLAres\"); \/\/ Dummy LLAres pump.\n\t\tLLEventStream xmlrpcPump(\"LLXMLRPCTransaction\"); \/\/ Dummy XMLRPC pump\n\n\t\tbool respond_immediately = true;\n\t\t\/\/ Have 'dummy ares' repsond immediately. \n\t\tLLAresListener dummyLLAres(\"dummy_llares\", respond_immediately);\n\t\tdummyLLAres.listenTo(llaresPump);\n\n\t\t\/\/ Have dummy XMLRPC respond immediately.\n\t\tLLXMLRPCListener dummyXMLRPC(\"dummy_xmlrpc\", respond_immediately);\n\t\tdummyXMLRPC.listenTo(xmlrpcPump);\n\n\t\tLLLogin login;\n\n\t\tLoginListener listener(\"test_ear\");\n\t\tlistener.listenTo(login.getEventPump());\n\n\t\tLLSD credentials;\n\t\tcredentials[\"first\"] = \"foo\";\n\t\tcredentials[\"last\"] = \"bar\";\n\t\tcredentials[\"passwd\"] = \"secret\";\n\n\t\tlogin.connect(\"login.bar.com\", credentials);\n\n\t\tensure_equals(\"Online state\", listener.lastEvent()[\"state\"].asString(), \"online\");\n\t}\n\n    template<> template<>\n    void llviewerlogin_object::test<2>()\n    {\n        DEBUG;\n\t\t\/\/ Tests a successful login in with delayed responses. \n\t\t\/\/ Also includes 'failure' that cause the login module\n\t\t\/\/ To re-attempt connection, once from a basic failure\n\t\t\/\/ and once from the 'indeterminate' response.\n\n\t\tset_test_name(\"LLLogin multiple srv uris w\/ success\");\n\n\t\t\/\/ Testing normal login procedure.\n\t\tLLEventStream llaresPump(\"LLAres\"); \/\/ Dummy LLAres pump.\n\t\tLLEventStream xmlrpcPump(\"LLXMLRPCTransaction\"); \/\/ Dummy XMLRPC pump\n\n\t\tbool respond_immediately = false;\n\t\tbool multiple_addresses = true;\n\t\tLLAresListener dummyLLAres(\"dummy_llares\", respond_immediately, multiple_addresses);\n\t\tdummyLLAres.listenTo(llaresPump);\n\n\t\tLLXMLRPCListener dummyXMLRPC(\"dummy_xmlrpc\");\n\t\tdummyXMLRPC.listenTo(xmlrpcPump);\n\n\t\tLLLogin login;\n\n\t\tLoginListener listener(\"test_ear\");\n\t\tlistener.listenTo(login.getEventPump());\n\n\t\tLLSD credentials;\n\t\tcredentials[\"first\"] = \"foo\";\n\t\tcredentials[\"last\"] = \"bar\";\n\t\tcredentials[\"passwd\"] = \"secret\";\n\n\t\tlogin.connect(\"login.bar.com\", credentials);\n\n\t\tensure_equals(\"SRV state\", listener.lastEvent()[\"state\"].asString(), \"srvrequest\"); \n\n\t\tdummyLLAres.sendReply();\n\n\t\t\/\/ Test Authenticating State prior to first response.\n\t\tensure_equals(\"Auth state 1\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\t\tensure_equals(\"Attempt 1\", listener.lastEvent()[\"data\"][\"attempt\"].asInteger(), 1); \n\t\tensure_equals(\"URI 1\", listener.lastEvent()[\"data\"][\"request\"][\"uri\"].asString(), \"login.foo.com\"); \n\n\t\t\/\/ First send emulated LLXMLRPCListener failure,\n\t\t\/\/ this should return login to the authenticating step and increase the attempt \n\t\t\/\/ count.\n\t\tLLSD data;\n\t\tdata[\"status\"] = \"OtherError\"; \n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Fail back to authenticate 1\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\t\tensure_equals(\"Attempt 2\", listener.lastEvent()[\"data\"][\"attempt\"].asInteger(), 2); \n\t\tensure_equals(\"URI 2\", listener.lastEvent()[\"data\"][\"request\"][\"uri\"].asString(), \"login.bar.com\"); \n\n\t\t\/\/ Now send the 'indeterminate' response.\n\t\tdata.clear();\n\t\tdata[\"status\"] = \"Complete\"; \/\/ StatusComplete\n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdata[\"responses\"][\"login\"] = \"indeterminate\";\n\t\tdata[\"next_url\"] = \"login.indeterminate.com\";\t\t\t\n\t\tdata[\"next_method\"] = \"test_login_method\"; \t\t\t\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Fail back to authenticate 2\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\t\tensure_equals(\"Attempt 3\", listener.lastEvent()[\"data\"][\"attempt\"].asInteger(), 3); \n\t\tensure_equals(\"URI 3\", listener.lastEvent()[\"data\"][\"request\"][\"uri\"].asString(), \"login.indeterminate.com\"); \n\n\t\t\/\/ Finally let the auth succeed.\n\t\tdata.clear();\n\t\tdata[\"status\"] = \"Complete\"; \/\/ StatusComplete\n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdata[\"responses\"][\"login\"] = \"true\";\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Success state\", listener.lastEvent()[\"state\"].asString(), \"online\");\n\n\t\tlogin.disconnect();\n\n\t\tensure_equals(\"Disconnected state\", listener.lastEvent()[\"state\"].asString(), \"offline\");\n\t}\n\n    template<> template<>\n    void llviewerlogin_object::test<3>()\n    {\n        DEBUG;\n\t\t\/\/ Test completed response, that fails to login.\n\t\tset_test_name(\"LLLogin valid response, failure (eg. bad credentials)\");\n\n\t\t\/\/ Testing normal login procedure.\n\t\tLLEventStream llaresPump(\"LLAres\"); \/\/ Dummy LLAres pump.\n\t\tLLEventStream xmlrpcPump(\"LLXMLRPCTransaction\"); \/\/ Dummy XMLRPC pump\n\n\t\tLLAresListener dummyLLAres(\"dummy_llares\");\n\t\tdummyLLAres.listenTo(llaresPump);\n\n\t\tLLXMLRPCListener dummyXMLRPC(\"dummy_xmlrpc\");\n\t\tdummyXMLRPC.listenTo(xmlrpcPump);\n\n\t\tLLLogin login;\n\t\tLoginListener listener(\"test_ear\");\n\t\tlistener.listenTo(login.getEventPump());\n\n\t\tLLSD credentials;\n\t\tcredentials[\"first\"] = \"who\";\n\t\tcredentials[\"last\"] = \"what\";\n\t\tcredentials[\"passwd\"] = \"badpasswd\";\n\n\t\tlogin.connect(\"login.bar.com\", credentials);\n\n\t\tensure_equals(\"SRV state\", listener.lastEvent()[\"state\"].asString(), \"srvrequest\"); \n\n\t\tdummyLLAres.sendReply();\n\n\t\tensure_equals(\"Auth state\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\n\t\t\/\/ Send the failed auth request reponse\n\t\tLLSD data;\n\t\tdata[\"status\"] = \"Complete\";\n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdata[\"responses\"][\"login\"] = \"false\";\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Failed to offline\", listener.lastEvent()[\"state\"].asString(), \"offline\");\n\t}\n\n    template<> template<>\n    void llviewerlogin_object::test<4>()\n    {\n        DEBUG;\n\t\t\/\/ Test incomplete response, that end the attempt.\n\t\tset_test_name(\"LLLogin valid response, failure (eg. bad credentials)\");\n\n\t\t\/\/ Testing normal login procedure.\n\t\tLLEventStream llaresPump(\"LLAres\"); \/\/ Dummy LLAres pump.\n\t\tLLEventStream xmlrpcPump(\"LLXMLRPCTransaction\"); \/\/ Dummy XMLRPC pump\n\n\t\tLLAresListener dummyLLAres(\"dummy_llares\");\n\t\tdummyLLAres.listenTo(llaresPump);\n\n\t\tLLXMLRPCListener dummyXMLRPC(\"dummy_xmlrpc\");\n\t\tdummyXMLRPC.listenTo(xmlrpcPump);\n\n\t\tLLLogin login;\n\t\tLoginListener listener(\"test_ear\");\n\t\tlistener.listenTo(login.getEventPump());\n\n\t\tLLSD credentials;\n\t\tcredentials[\"first\"] = \"these\";\n\t\tcredentials[\"last\"] = \"don't\";\n\t\tcredentials[\"passwd\"] = \"matter\";\n\n\t\tlogin.connect(\"login.bar.com\", credentials);\n\n\t\tensure_equals(\"SRV state\", listener.lastEvent()[\"state\"].asString(), \"srvrequest\"); \n\n\t\tdummyLLAres.sendReply();\n\n\t\tensure_equals(\"Auth state\", listener.lastEvent()[\"state\"].asString(), \"authenticating\"); \n\n\t\t\/\/ Send the failed auth request reponse\n\t\tLLSD data;\n\t\tdata[\"status\"] = \"OtherError\";\n\t\tdata[\"errorcode\"] = 0;\n\t\tdata[\"error\"] = \"dummy response\";\n\t\tdata[\"transfer_rate\"] = 0;\n\t\tdummyXMLRPC.setResponse(data);\n\t\tdummyXMLRPC.sendReply();\n\n\t\tensure_equals(\"Failed to offline\", listener.lastEvent()[\"state\"].asString(), \"offline\");\n\t}\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#include \"ui\/ozone\/platform\/egl\/egl_surface_factory.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"third_party\/skia\/include\/core\/SkCanvas.h\"\n#include \"third_party\/skia\/include\/core\/SkSurface.h\"\n#include \"ui\/ozone\/public\/surface_ozone_egl.h\"\n#include \"ui\/ozone\/public\/surface_ozone_canvas.h\"\n#include \"ui\/ozone\/public\/surface_factory_ozone.h\"\n#include \"ui\/gfx\/skia_util.h\"\n#include \"ui\/gfx\/vsync_provider.h\"\n#include \"base\/logging.h\"\n\n#include \"egl_wrapper.h\"\n\n#ifndef GL_BGRA_EXT\n #define GL_BGRA_EXT 0x80E1\n#endif\n\n#include <fcntl.h>    \/* For O_RDWR *\/\n#include <unistd.h>   \/* For open(), creat() *\/\n#include <linux\/fb.h>\n#include <sys\/ioctl.h>\n\n#define OZONE_EGL_WINDOW_WIDTH 1024\n#define OZONE_EGL_WINDOW_HEIGTH 768\n\nnamespace ui {\n\nclass EglOzoneCanvas: public ui::SurfaceOzoneCanvas {\n public:\n  EglOzoneCanvas();\n  virtual ~EglOzoneCanvas();\n  \/\/ SurfaceOzoneCanvas overrides:\n  virtual void ResizeCanvas(const gfx::Size& viewport_size) override;\n  virtual skia::RefPtr<SkCanvas> GetCanvas() override {\n    return skia::SharePtr<SkCanvas>(surface_->getCanvas());\n  }\n  virtual void PresentCanvas(const gfx::Rect& damage) override;\n  \n  virtual scoped_ptr<gfx::VSyncProvider> CreateVSyncProvider() override {\n    return scoped_ptr<gfx::VSyncProvider>();\n  }\n\n private: \n  skia::RefPtr<SkSurface> surface_;\n  ozone_egl_UserData userDate_;\n};\n\nEglOzoneCanvas::EglOzoneCanvas()\n{\n    memset(&userDate_,0,sizeof(userDate_));\n}\nEglOzoneCanvas::~EglOzoneCanvas()\n{\n    ozone_egl_textureShutDown (&userDate_);\n}\n\nvoid EglOzoneCanvas::ResizeCanvas(const gfx::Size& viewport_size)\n{  \n  if(userDate_.width == viewport_size.width() && userDate_.height==viewport_size.height())\n  {\n      return;\n  }\n  else if(userDate_.width != 0 && userDate_.height !=0)\n  {\n      ozone_egl_textureShutDown (&userDate_);\n  }\n  surface_ = skia::AdoptRef(SkSurface::NewRaster(\n        SkImageInfo::Make(viewport_size.width(),\n                                   viewport_size.height(),\n                                   kN32_SkColorType,\n                                   kPremul_SkAlphaType)));\n  userDate_.width = viewport_size.width();\n  userDate_.height = viewport_size.height();\n  userDate_.colorType = GL_BGRA_EXT;\n  ozone_egl_textureInit ( &userDate_);\n}\n\nvoid EglOzoneCanvas::PresentCanvas(const gfx::Rect& damage)\n{ \n    SkImageInfo info;\n    size_t row_bytes;\n    userDate_.data = (char *) surface_->peekPixels(&info, &row_bytes);\n    ozone_egl_textureDraw(&userDate_);\n    ozone_egl_swap();\n}\n\n\nclass OzoneEgl : public ui::SurfaceOzoneEGL {\n public:\n  OzoneEgl(gfx::AcceleratedWidget window_id){\n     native_window_ = window_id;\n  }\n  virtual ~OzoneEgl() {\n     native_window_=0;\n  }\n\n  virtual intptr_t GetNativeWindow() override \n  { \n    return native_window_; \n  }\n\n  virtual bool OnSwapBuffers() override \n  { \n    return true; \n  }\n\n  virtual bool ResizeNativeWindow(const gfx::Size& viewport_size) override {\n    return true;\n  }\n\n\n  virtual scoped_ptr<gfx::VSyncProvider> CreateVSyncProvider() override {\n    return scoped_ptr<gfx::VSyncProvider>();\n  }\n\n private:\n  intptr_t native_window_;\n};\n\n\n\nSurfaceFactoryEgl::SurfaceFactoryEgl():init_(false)\n{\n\n}\n\nSurfaceFactoryEgl::~SurfaceFactoryEgl()\n{ \n    DestroySingleWindow(); \n}\n  \nEGLint g_width;\nEGLint g_height;\nbool SurfaceFactoryEgl::CreateSingleWindow()\n{\n  struct fb_var_screeninfo fb_var;\n\n  int fb_fd =  open(\"\/dev\/fb0\", O_RDWR);\n\n  if(init_)\n  {\n     return true;\n  }\n\n  if (ioctl(fb_fd, FBIOGET_VSCREENINFO, &fb_var)) {\n        LOG(FATAL) << \"failed to get fb var info errno: \" << errno;\n        g_width = 640;\n\tg_height = 480;\n  } else {\n    g_width = fb_var.xres;\n    g_height = fb_var.yres;\n  }\n\n close(fb_fd);\n\n if(!ozone_egl_setup(0, 0, g_width, g_height))\n  {\n      LOG(FATAL) << \"CreateSingleWindow\";\n      return false;\n  }\n  init_ = true;\n  return true;\n}\n\nvoid SurfaceFactoryEgl::DestroySingleWindow() {\n  ozone_egl_destroy();\n  init_ = false;\n}\n\nintptr_t SurfaceFactoryEgl::GetNativeDisplay() {\n  return (intptr_t)ozone_egl_getNativedisp();\n}\n\n\/\/gfx::AcceleratedWidget SurfaceFactoryEgl::GetAcceleratedWidget() {\n\/\/  if (!CreateSingleWindow())\n\/\/    LOG(FATAL) << \"failed to create window\";\n\/\/  return (gfx::AcceleratedWidget)GetNativeDisplay();\n\/\/}\n\nscoped_ptr<ui::SurfaceOzoneEGL>\nSurfaceFactoryEgl::CreateEGLSurfaceForWidget(\n    gfx::AcceleratedWidget widget) {\n  return make_scoped_ptr<ui::SurfaceOzoneEGL>(\n      new OzoneEgl(widget));\n}\n\nbool SurfaceFactoryEgl::LoadEGLGLES2Bindings(\n    AddGLLibraryCallback add_gl_library,\n    SetGLGetProcAddressProcCallback set_gl_get_proc_address) { \n  return false;\n}\n\nconst int32* SurfaceFactoryEgl::GetEGLSurfaceProperties(\n    const int32* desired_list) {\n  return ozone_egl_getConfigAttribs();\n}\n\n\nscoped_ptr<ui::SurfaceOzoneCanvas> SurfaceFactoryEgl::CreateCanvasForWidget(\n      gfx::AcceleratedWidget widget){\n    LOG(ERROR) << \"-CreateCanvasForWidget-\";\n  scoped_ptr<EglOzoneCanvas> canvas(new EglOzoneCanvas());\n  return canvas.PassAs<ui::SurfaceOzoneCanvas>();\n}\n\n}  \/\/ namespace ui\n<commit_msg>commenting out getcanvas<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#include \"ui\/ozone\/platform\/egl\/egl_surface_factory.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"third_party\/skia\/include\/core\/SkCanvas.h\"\n#include \"third_party\/skia\/include\/core\/SkSurface.h\"\n#include \"ui\/ozone\/public\/surface_ozone_egl.h\"\n#include \"ui\/ozone\/public\/surface_ozone_canvas.h\"\n#include \"ui\/ozone\/public\/surface_factory_ozone.h\"\n#include \"ui\/gfx\/skia_util.h\"\n#include \"ui\/gfx\/vsync_provider.h\"\n#include \"base\/logging.h\"\n\n#include \"egl_wrapper.h\"\n\n#ifndef GL_BGRA_EXT\n #define GL_BGRA_EXT 0x80E1\n#endif\n\n#include <fcntl.h>    \/* For O_RDWR *\/\n#include <unistd.h>   \/* For open(), creat() *\/\n#include <linux\/fb.h>\n#include <sys\/ioctl.h>\n\n#define OZONE_EGL_WINDOW_WIDTH 1024\n#define OZONE_EGL_WINDOW_HEIGTH 768\n\nnamespace ui {\n\nclass EglOzoneCanvas: public ui::SurfaceOzoneCanvas {\n public:\n  EglOzoneCanvas();\n  virtual ~EglOzoneCanvas();\n  \/\/ SurfaceOzoneCanvas overrides:\n  virtual void ResizeCanvas(const gfx::Size& viewport_size) override;\n  \/\/virtual skia::RefPtr<SkCanvas> GetCanvas() override {\n  \/\/  return skia::SharePtr<SkCanvas>(surface_->getCanvas());\n  \/\/}\n  virtual void PresentCanvas(const gfx::Rect& damage) override;\n  \n  virtual scoped_ptr<gfx::VSyncProvider> CreateVSyncProvider() override {\n    return scoped_ptr<gfx::VSyncProvider>();\n  }\n\n private: \n  skia::RefPtr<SkSurface> surface_;\n  ozone_egl_UserData userDate_;\n};\n\nEglOzoneCanvas::EglOzoneCanvas()\n{\n    memset(&userDate_,0,sizeof(userDate_));\n}\nEglOzoneCanvas::~EglOzoneCanvas()\n{\n    ozone_egl_textureShutDown (&userDate_);\n}\n\nvoid EglOzoneCanvas::ResizeCanvas(const gfx::Size& viewport_size)\n{  \n  if(userDate_.width == viewport_size.width() && userDate_.height==viewport_size.height())\n  {\n      return;\n  }\n  else if(userDate_.width != 0 && userDate_.height !=0)\n  {\n      ozone_egl_textureShutDown (&userDate_);\n  }\n  surface_ = skia::AdoptRef(SkSurface::NewRaster(\n        SkImageInfo::Make(viewport_size.width(),\n                                   viewport_size.height(),\n                                   kN32_SkColorType,\n                                   kPremul_SkAlphaType)));\n  userDate_.width = viewport_size.width();\n  userDate_.height = viewport_size.height();\n  userDate_.colorType = GL_BGRA_EXT;\n  ozone_egl_textureInit ( &userDate_);\n}\n\nvoid EglOzoneCanvas::PresentCanvas(const gfx::Rect& damage)\n{ \n    SkImageInfo info;\n    size_t row_bytes;\n    userDate_.data = (char *) surface_->peekPixels(&info, &row_bytes);\n    ozone_egl_textureDraw(&userDate_);\n    ozone_egl_swap();\n}\n\n\nclass OzoneEgl : public ui::SurfaceOzoneEGL {\n public:\n  OzoneEgl(gfx::AcceleratedWidget window_id){\n     native_window_ = window_id;\n  }\n  virtual ~OzoneEgl() {\n     native_window_=0;\n  }\n\n  virtual intptr_t GetNativeWindow() override \n  { \n    return native_window_; \n  }\n\n  virtual bool OnSwapBuffers() override \n  { \n    return true; \n  }\n\n  virtual bool ResizeNativeWindow(const gfx::Size& viewport_size) override {\n    return true;\n  }\n\n\n  virtual scoped_ptr<gfx::VSyncProvider> CreateVSyncProvider() override {\n    return scoped_ptr<gfx::VSyncProvider>();\n  }\n\n private:\n  intptr_t native_window_;\n};\n\n\n\nSurfaceFactoryEgl::SurfaceFactoryEgl():init_(false)\n{\n\n}\n\nSurfaceFactoryEgl::~SurfaceFactoryEgl()\n{ \n    DestroySingleWindow(); \n}\n  \nEGLint g_width;\nEGLint g_height;\nbool SurfaceFactoryEgl::CreateSingleWindow()\n{\n  struct fb_var_screeninfo fb_var;\n\n  int fb_fd =  open(\"\/dev\/fb0\", O_RDWR);\n\n  if(init_)\n  {\n     return true;\n  }\n\n  if (ioctl(fb_fd, FBIOGET_VSCREENINFO, &fb_var)) {\n        LOG(FATAL) << \"failed to get fb var info errno: \" << errno;\n        g_width = 640;\n\tg_height = 480;\n  } else {\n    g_width = fb_var.xres;\n    g_height = fb_var.yres;\n  }\n\n close(fb_fd);\n\n if(!ozone_egl_setup(0, 0, g_width, g_height))\n  {\n      LOG(FATAL) << \"CreateSingleWindow\";\n      return false;\n  }\n  init_ = true;\n  return true;\n}\n\nvoid SurfaceFactoryEgl::DestroySingleWindow() {\n  ozone_egl_destroy();\n  init_ = false;\n}\n\nintptr_t SurfaceFactoryEgl::GetNativeDisplay() {\n  return (intptr_t)ozone_egl_getNativedisp();\n}\n\n\/\/gfx::AcceleratedWidget SurfaceFactoryEgl::GetAcceleratedWidget() {\n\/\/  if (!CreateSingleWindow())\n\/\/    LOG(FATAL) << \"failed to create window\";\n\/\/  return (gfx::AcceleratedWidget)GetNativeDisplay();\n\/\/}\n\nscoped_ptr<ui::SurfaceOzoneEGL>\nSurfaceFactoryEgl::CreateEGLSurfaceForWidget(\n    gfx::AcceleratedWidget widget) {\n  return make_scoped_ptr<ui::SurfaceOzoneEGL>(\n      new OzoneEgl(widget));\n}\n\nbool SurfaceFactoryEgl::LoadEGLGLES2Bindings(\n    AddGLLibraryCallback add_gl_library,\n    SetGLGetProcAddressProcCallback set_gl_get_proc_address) { \n  return false;\n}\n\nconst int32* SurfaceFactoryEgl::GetEGLSurfaceProperties(\n    const int32* desired_list) {\n  return ozone_egl_getConfigAttribs();\n}\n\n\nscoped_ptr<ui::SurfaceOzoneCanvas> SurfaceFactoryEgl::CreateCanvasForWidget(\n      gfx::AcceleratedWidget widget){\n    LOG(ERROR) << \"-CreateCanvasForWidget-\";\n  scoped_ptr<EglOzoneCanvas> canvas(new EglOzoneCanvas());\n  return canvas.PassAs<ui::SurfaceOzoneCanvas>();\n}\n\n}  \/\/ namespace ui\n<|endoftext|>"}
{"text":"<commit_before>\/** \\copyright\n * Copyright (c) 2013, Stuart W Baker\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 NMRAnetVelocity.hxx\n * This file provides an implementation of velocity in NMRAnet terms.\n *\n * @author Stuart W. Baker\n * @date 2 August 2013\n *\/\n\n#ifndef _NMRAnetVelocity_hxx_\n#define _NMRAnetVelocity_hxx_\n\n#include <cmath>\n#include <cstdint>\n\n#include \"utils\/macros.h\"\n\nextern \"C\" {\n\/* These come from the ieeehalfprecision.c *\/\nint singles2halfp(void *target, void *source, int numel);\nint halfp2singles(void *target, void *source, int numel);\n}\n\n\/** Conversion factor for MPH. *\/\n#define MPH_FACTOR 0.44704F\n\n\/** This type represents how velocity is seen on the wire (16 bit float).\n *\/\ntypedef uint16_t float16_t;\n\nnamespace NMRAnet\n{\n\n\/** This class provides a mechanism for working with velocity in different\n *  forms.  A single precision floating point value is used internally to store\n *  velocity, but this class provides the ability to easily work with\n *  different velocity formats including DCC 14\/28\/128 speed step formats.\n *  NMRAnet velocity is represented as a floating point meters\/sec.  The sign\n *  represents direction where negative is reverse and positive is forward.\n *  Sign is always preserved even when the result is 0.  For example,\n *  -7.0 + 7.0 = -0.0 and 7.0 - 7.0 = +0.0  Be careful thought, per the C\n *  standards, a negative zero (-.0.0) velocity compared to constant 0.0 will\n *  compare true.  Always use @ref direction() when trying to determine the\n *  sign or direction of travel.\n *\/\nclass Velocity\n{\npublic:\n    \/** define an enumeration for direction\n     *\/\n    enum\n    {\n        FORWARD  = 0, \/**< forward direction *\/\n        POSITIVE = 0, \/**< forward direction *\/\n        REVERSE  = 1, \/**< reverse direction *\/\n        NEGATIVE = 1, \/**< reverse direction *\/\n    };\n\n    \/** Default constructor.\n     *\/\n    Velocity()\n        : velocity(0)\n    {\n    }\n\n    \/** Basic constructor.\n     * @param value starting value for Velocity.\n     *\/\n    Velocity(int value)\n        : velocity(value)\n    {\n    }\n\n    \/** Basic constructor.\n     * @param value starting value for Velocity.\n     *\/\n    Velocity(unsigned int value)\n        : velocity(value)\n    {\n    }\n\n    \/** Basic constructor.\n     * @param value starting value for Velocity.\n     *\/\n    Velocity(float value)\n        : velocity(value)\n    {\n    }\n\n    \/** Basic constructor.\n     * @param value starting value for Velocity.\n     *\/\n    Velocity(double value)\n        : velocity(value)\n    {\n    }\n\n    \/** Constructor that takes the 16 bit wire format\n     * @param value starting value for Velocity as IEEE half precision float.\n     *\/\n    Velocity(float16_t value)\n        : velocity(halfp2singles(&velocity, &value, 1))\n    {\n    }\n\n    \/** Copy constructor. *\/\n    Velocity(const Velocity& old_velocity)\n        : velocity(old_velocity.velocity)\n    {\n    }\n\n    \/** Destructor does nothing. *\/\n    ~Velocity() {}\n\n    \/** Return the speed independent of direction.\n     * @return speed absolute value of velocity\n     *\/\n    float speed()\n    {\n        return fabsf(velocity);\n    }\n\n    \/** Return the direction independent of speed.\n     * @return direction FORWARD or REVERSE\n     *\/\n    int direction()\n    {\n        if (std::signbit(velocity))\n        {\n            return REVERSE;\n        }\n        return FORWARD;\n    }\n    \n    void set_direction(int direction)\n    {\n        switch (direction)\n        {\n        case FORWARD:\n            forward();\n            break;\n        case REVERSE:\n            reverse();\n            break;\n        default:\n            DIE(\"Unexpected direction value\");\n        }\n    }\n\n    \/** Set the direction to forward. *\/\n    void forward()\n    {\n        if (std::signbit(velocity))\n        {\n            velocity = -velocity;\n        }\n    }\n    \n    \/** Set the direction to reverse. *\/\n    void reverse()\n    {\n        if (!std::signbit(velocity))\n        {\n            velocity = -velocity;\n        }\n    }\n    \n    \/** Convert the native meters\/sec representation into mile per hour.\n     * @return velocity represented as miles per hour\n     *\/\n    float mph()\n    {\n        return zero_adjust(velocity * MPH_FACTOR, velocity);\n    }\n    \n    \/** Get the speed in DCC 128 speed step format.\n     *  The mapping from meters\/sec is strait forward.  First convert to\n     *  miles\/hour, then each speed step represents 1 mile\/hour.  Saturate at\n     *  126 miles\/hour.\n     *\n     *  bit 7:  direction\n     *  bits 6..0:  0 = stopped, 1 = estop, 2 - 127 = speed steps 1 - 126\n     *  @return DCC encoded speed steps\n     *\/\n    uint8_t get_dcc_128();\n\n    \/** Set the speed from DCC 128 speed step format.\n     *  The mapping from meters\/sec is strait forward.  First convert to\n     *  miles\/hour, then each speed step represents 1 mile\/hour.  Saturate at\n     *  126 miles\/hour.\n     *\n     *  @param value bit 7:  direction\n     *               bits 6..0:  0 = stopped, 1 = estop, 2 - 127 = speed steps 1 - 126\n     *\/\n    void set_dcc_128(uint8_t value);\n    \n    \/** Get the speed in DCC 28 speed step format.\n     *  This is a decimation of the 128 speed step mode.\n     *\n     *  bit 7..6:  fixed at b'01'\n     *  bit 5:  direction\n     *  bits 4:  speed step least significant bit\n     *  bits 3..0:  speed step significatn bits 4..1\n     *  @return DCC encoded speed steps\n     *\/\n    uint8_t get_dcc_28();\n    \n    \/** Set the speed from DCC 28 speed step format.\n     *  This is a decimation of the 128 speed step mode.\n     *\n     *  @param value bit 7..6:  fixed at b'01'\n     *               bit 5:  direction\n     *               bits 4:  speed step least significant bit\n     *               bits 3..0:  speed step significatn bits 4..1\n     *\/\n    void set_dcc_28(uint8_t value);\n\n    \/** Get the speed in DCC 14 speed step format.\n     *  This is a decimation of the 128 speed step mode.\n     *\n     *  bit 7..6:  fixed at b'01'\n     *  bit 5:  direction\n     *  bits 4:  reserved 0 for headlight\n     *  bits 3..0:  0 = stopped, 4 - 31 = speed steps 1 - 28 \n     *  @return DCC encoded speed steps\n     *\/\n    uint8_t get_dcc_14();\n    \n    \/** Set the speed from DCC 14 speed step format.\n     *  This is a decimation of the 128 speed step mode.\n     *\n     *  @param value bit 7..6:  fixed at b'01'\n     *               bit 5:  direction\n     *               bits 4:  reserved 0 for headlight\n     *               bits 3..0:  0 = stopped, 4 - 31 = speed steps 1 - 28 \n     *\/\n    void set_dcc_14(uint8_t value);\n    \n    \/** Get a wire version of the velocity.\n     * @return IEEE half precision floating point representation of velocity\n     *\/\n    float16_t get_wire()\n    {\n        float16_t result;\n        singles2halfp(&result, &velocity, 1);\n        return result;\n    }\n    \n    \/** Set the value based on the wire version of velocity.\n     * @param value IEEE half precision floating point representation of velocity\n     *\/\n    void set_wire(float16_t value)\n    {\n        halfp2singles(&velocity, &value, 1);\n    }\n\n    \/** Overloaded addition operator. *\/\n    Velocity operator + (const Velocity& v)\n    {\n        return Velocity(zero_adjust(velocity + v.velocity,velocity));\n    }\n\n    \/** Overloaded addition operator. *\/\n    Velocity operator + (const float& v)\n    {\n        return Velocity(zero_adjust(velocity + v,velocity));\n    }\n\n    \/** Overloaded subtraction operator. *\/\n    Velocity operator - (const Velocity& v)\n    {\n        return Velocity(zero_adjust(velocity - v.velocity,velocity));\n    }\n\n    \/** Overloaded subtraction operator. *\/\n    Velocity operator - (const float& v)\n    {\n        return Velocity(zero_adjust(velocity - v,velocity));\n    }\n\n    \/** Overloaded multiplication operator. *\/\n    Velocity operator * (const Velocity& v)\n    {\n        return Velocity(zero_adjust(velocity * v.velocity,velocity));\n    }\n\n    \/** Overloaded multiplication operator. *\/\n    Velocity operator * (const float& v)\n    {\n        return Velocity(zero_adjust(velocity * v,velocity));\n    }\n\n    \/** Overloaded division operator. *\/\n    Velocity operator \/ (const Velocity& v)\n    {\n        return Velocity(zero_adjust(velocity \/ v.velocity,velocity));\n    }\n\n    \/** Overloaded division operator. *\/\n    Velocity operator \/ (const float& v)\n    {\n        return Velocity(zero_adjust(velocity \/ v,velocity));\n    }\n\n    \/** Overloaded pre-increement operator. *\/\n    Velocity& operator ++ ()\n    {\n        velocity = zero_adjust(velocity + 1,velocity);\n        return *this;\n    }\n\n    \/** Overloaded post-increment operator. *\/\n    Velocity operator ++ (int)\n    {\n        Velocity result(*this);\n        velocity = zero_adjust(velocity + 1,velocity);\n        return result;\n    }\n\n    \/** Overloaded pre-decreement operator. *\/\n    Velocity& operator -- ()\n    {\n        velocity = zero_adjust(velocity - 1,velocity);\n        return *this;\n    }\n\n    \/** Overloaded post-decrement operator. *\/\n    Velocity operator -- (int)\n    {\n        Velocity result(*this);\n        velocity = zero_adjust(velocity - 1,velocity);\n        return result;\n    }\n\n    \/** Overloaded addition equals operator. *\/\n    Velocity& operator += (const Velocity& v)\n    {\n        velocity = zero_adjust(velocity + v.velocity,velocity);\n        return *this;\n    }\n\n    \/** Overloaded addition equals operator. *\/\n    Velocity& operator += (const float& v)\n    {\n        velocity = zero_adjust(velocity + v,velocity);\n        return *this;\n    }\n\n    \/** Overloaded subtraction equals operator. *\/\n    Velocity& operator -= (const Velocity& v)\n    {\n        velocity = zero_adjust(velocity - v.velocity,velocity);\n        return *this;\n    }\n\n    \/** Overloaded subtraction equals operator. *\/\n    Velocity& operator -= (const float& v)\n    {\n        velocity = zero_adjust(velocity - v,velocity);\n        return *this;\n    }\n\n    \/** Overloaded multiplication equals operator. *\/\n    Velocity& operator *= (const Velocity& v)\n    {\n        velocity = zero_adjust(velocity * v.velocity,velocity);\n        return *this;\n    }\n\n    \/** Overloaded multiplication equals operator. *\/\n    Velocity& operator *= (const float& v)\n    {\n        velocity = zero_adjust(velocity * v,velocity);\n        return *this;\n    }\n\n    \/** Overloaded division equals operator. *\/\n    Velocity& operator \/= (const Velocity& v)\n    {\n        velocity = zero_adjust(velocity \/ v.velocity,velocity);\n        return *this;\n    }\n\n    \/** Overloaded division equals operator. *\/\n    Velocity& operator \/= (const float& v)\n    {\n        velocity = zero_adjust(velocity \/ v,velocity);\n        return *this;\n    }\n\n    \/** Overloaded equals operator. *\/\n    Velocity& operator = (const Velocity& v)\n    {\n        velocity = v.velocity;\n        return *this;\n    }\n\n    \/** Overloaded equals operator. *\/\n    Velocity& operator = (const float& v)\n    {\n        velocity = v;\n        return *this;\n    }\n\n    \/** Overloaded equals equals operator *\/\n    bool operator == (const Velocity& v)\n    {\n        return (v.velocity == velocity);\n    }\n    \n    \/** Overloaded equals equals operator *\/\n    bool operator == (const float& v)\n    {\n        return (v == velocity);\n    }\n    \n    \/** Overloaded not equals operator *\/\n    bool operator != (const Velocity& v)\n    {\n        return (v.velocity != velocity);\n    }\n    \n    \/** Overloaded not equals operator *\/\n    bool operator != (const float& v)\n    {\n        return (v != velocity);\n    }\n    \nprivate:\n    \/** Floating point representation of velocity. *\/\n    float velocity;\n    \n    \/** Adjust for a math result of negative 0.\n     * @param value value of math result\n     * @param old original value before expression\n     *\/\n    float zero_adjust(float value, float old)\n    {\n        if (value == 0)\n        {\n            return copysign(value, old);\n        }\n        return value;\n    }\n};\n\n\n}; \/* namespace NMRAnet *\/\n\n#endif \/* _NMRAnetVelocity_hxx_ *\/\n<commit_msg>Fixes m\/s to mph conversion in Velocity.<commit_after>\/** \\copyright\n * Copyright (c) 2013, Stuart W Baker\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 NMRAnetVelocity.hxx\n * This file provides an implementation of velocity in NMRAnet terms.\n *\n * @author Stuart W. Baker\n * @date 2 August 2013\n *\/\n\n#ifndef _NMRAnetVelocity_hxx_\n#define _NMRAnetVelocity_hxx_\n\n#include <cmath>\n#include <cstdint>\n\n#include \"utils\/macros.h\"\n\nextern \"C\" {\n\/* These come from the ieeehalfprecision.c *\/\nint singles2halfp(void *target, void *source, int numel);\nint halfp2singles(void *target, void *source, int numel);\n}\n\n\/** Conversion factor for MPH. 1 mph = this many m\/s. *\/\n#define MPH_FACTOR 0.44704f\n\n\/** This type represents how velocity is seen on the wire (16 bit float).\n *\/\ntypedef uint16_t float16_t;\n\nnamespace NMRAnet\n{\n\n\/** This class provides a mechanism for working with velocity in different\n *  forms.  A single precision floating point value is used internally to store\n *  velocity, but this class provides the ability to easily work with\n *  different velocity formats including DCC 14\/28\/128 speed step formats.\n *  NMRAnet velocity is represented as a floating point meters\/sec.  The sign\n *  represents direction where negative is reverse and positive is forward.\n *  Sign is always preserved even when the result is 0.  For example,\n *  -7.0 + 7.0 = -0.0 and 7.0 - 7.0 = +0.0  Be careful thought, per the C\n *  standards, a negative zero (-.0.0) velocity compared to constant 0.0 will\n *  compare true.  Always use @ref direction() when trying to determine the\n *  sign or direction of travel.\n *\/\nclass Velocity\n{\npublic:\n    \/** define an enumeration for direction\n     *\/\n    enum\n    {\n        FORWARD  = 0, \/**< forward direction *\/\n        POSITIVE = 0, \/**< forward direction *\/\n        REVERSE  = 1, \/**< reverse direction *\/\n        NEGATIVE = 1, \/**< reverse direction *\/\n    };\n\n    \/** Default constructor.\n     *\/\n    Velocity()\n        : velocity(0)\n    {\n    }\n\n    \/** Basic constructor.\n     * @param value starting value for Velocity.\n     *\/\n    Velocity(int value)\n        : velocity(value)\n    {\n    }\n\n    \/** Basic constructor.\n     * @param value starting value for Velocity.\n     *\/\n    Velocity(unsigned int value)\n        : velocity(value)\n    {\n    }\n\n    \/** Basic constructor.\n     * @param value starting value for Velocity.\n     *\/\n    Velocity(float value)\n        : velocity(value)\n    {\n    }\n\n    \/** Basic constructor.\n     * @param value starting value for Velocity.\n     *\/\n    Velocity(double value)\n        : velocity(value)\n    {\n    }\n\n    \/** Constructor that takes the 16 bit wire format\n     * @param value starting value for Velocity as IEEE half precision float.\n     *\/\n    Velocity(float16_t value)\n        : velocity(halfp2singles(&velocity, &value, 1))\n    {\n    }\n\n    \/** Copy constructor. *\/\n    Velocity(const Velocity& old_velocity)\n        : velocity(old_velocity.velocity)\n    {\n    }\n\n    \/** Destructor does nothing. *\/\n    ~Velocity() {}\n\n    \/** Return the speed independent of direction.\n     * @return speed absolute value of velocity\n     *\/\n    float speed()\n    {\n        return fabsf(velocity);\n    }\n\n    \/** Return the direction independent of speed.\n     * @return direction FORWARD or REVERSE\n     *\/\n    int direction()\n    {\n        if (std::signbit(velocity))\n        {\n            return REVERSE;\n        }\n        return FORWARD;\n    }\n    \n    void set_direction(int direction)\n    {\n        switch (direction)\n        {\n        case FORWARD:\n            forward();\n            break;\n        case REVERSE:\n            reverse();\n            break;\n        default:\n            DIE(\"Unexpected direction value\");\n        }\n    }\n\n    \/** Set the direction to forward. *\/\n    void forward()\n    {\n        if (std::signbit(velocity))\n        {\n            velocity = -velocity;\n        }\n    }\n    \n    \/** Set the direction to reverse. *\/\n    void reverse()\n    {\n        if (!std::signbit(velocity))\n        {\n            velocity = -velocity;\n        }\n    }\n    \n    \/** Convert the native meters\/sec representation into mile per hour.\n     * @return velocity represented as miles per hour\n     *\/\n    float mph()\n    {\n        return zero_adjust(velocity \/ MPH_FACTOR, velocity);\n    }\n\n    \/** Sets the speed value from a given mph value. The sign of the mph value\n     * is ignored. *\/\n    void set_mph(float mph)\n    {\n        velocity = std::copysign(mph * MPH_FACTOR, velocity);\n    }\n    \n    \/** Get the speed in DCC 128 speed step format.\n     *  The mapping from meters\/sec is strait forward.  First convert to\n     *  miles\/hour, then each speed step represents 1 mile\/hour.  Saturate at\n     *  126 miles\/hour.\n     *\n     *  bit 7:  direction\n     *  bits 6..0:  0 = stopped, 1 = estop, 2 - 127 = speed steps 1 - 126\n     *  @return DCC encoded speed steps\n     *\/\n    uint8_t get_dcc_128();\n\n    \/** Set the speed from DCC 128 speed step format.\n     *  The mapping from meters\/sec is strait forward.  First convert to\n     *  miles\/hour, then each speed step represents 1 mile\/hour.  Saturate at\n     *  126 miles\/hour.\n     *\n     *  @param value bit 7:  direction\n     *               bits 6..0:  0 = stopped, 1 = estop, 2 - 127 = speed steps 1 - 126\n     *\/\n    void set_dcc_128(uint8_t value);\n    \n    \/** Get the speed in DCC 28 speed step format.\n     *  This is a decimation of the 128 speed step mode.\n     *\n     *  bit 7..6:  fixed at b'01'\n     *  bit 5:  direction\n     *  bits 4:  speed step least significant bit\n     *  bits 3..0:  speed step significatn bits 4..1\n     *  @return DCC encoded speed steps\n     *\/\n    uint8_t get_dcc_28();\n    \n    \/** Set the speed from DCC 28 speed step format.\n     *  This is a decimation of the 128 speed step mode.\n     *\n     *  @param value bit 7..6:  fixed at b'01'\n     *               bit 5:  direction\n     *               bits 4:  speed step least significant bit\n     *               bits 3..0:  speed step significatn bits 4..1\n     *\/\n    void set_dcc_28(uint8_t value);\n\n    \/** Get the speed in DCC 14 speed step format.\n     *  This is a decimation of the 128 speed step mode.\n     *\n     *  bit 7..6:  fixed at b'01'\n     *  bit 5:  direction\n     *  bits 4:  reserved 0 for headlight\n     *  bits 3..0:  0 = stopped, 4 - 31 = speed steps 1 - 28 \n     *  @return DCC encoded speed steps\n     *\/\n    uint8_t get_dcc_14();\n    \n    \/** Set the speed from DCC 14 speed step format.\n     *  This is a decimation of the 128 speed step mode.\n     *\n     *  @param value bit 7..6:  fixed at b'01'\n     *               bit 5:  direction\n     *               bits 4:  reserved 0 for headlight\n     *               bits 3..0:  0 = stopped, 4 - 31 = speed steps 1 - 28 \n     *\/\n    void set_dcc_14(uint8_t value);\n    \n    \/** Get a wire version of the velocity.\n     * @return IEEE half precision floating point representation of velocity\n     *\/\n    float16_t get_wire()\n    {\n        float16_t result;\n        singles2halfp(&result, &velocity, 1);\n        return result;\n    }\n    \n    \/** Set the value based on the wire version of velocity.\n     * @param value IEEE half precision floating point representation of velocity\n     *\/\n    void set_wire(float16_t value)\n    {\n        halfp2singles(&velocity, &value, 1);\n    }\n\n    \/** Overloaded addition operator. *\/\n    Velocity operator + (const Velocity& v)\n    {\n        return Velocity(zero_adjust(velocity + v.velocity,velocity));\n    }\n\n    \/** Overloaded addition operator. *\/\n    Velocity operator + (const float& v)\n    {\n        return Velocity(zero_adjust(velocity + v,velocity));\n    }\n\n    \/** Overloaded subtraction operator. *\/\n    Velocity operator - (const Velocity& v)\n    {\n        return Velocity(zero_adjust(velocity - v.velocity,velocity));\n    }\n\n    \/** Overloaded subtraction operator. *\/\n    Velocity operator - (const float& v)\n    {\n        return Velocity(zero_adjust(velocity - v,velocity));\n    }\n\n    \/** Overloaded multiplication operator. *\/\n    Velocity operator * (const Velocity& v)\n    {\n        return Velocity(zero_adjust(velocity * v.velocity,velocity));\n    }\n\n    \/** Overloaded multiplication operator. *\/\n    Velocity operator * (const float& v)\n    {\n        return Velocity(zero_adjust(velocity * v,velocity));\n    }\n\n    \/** Overloaded division operator. *\/\n    Velocity operator \/ (const Velocity& v)\n    {\n        return Velocity(zero_adjust(velocity \/ v.velocity,velocity));\n    }\n\n    \/** Overloaded division operator. *\/\n    Velocity operator \/ (const float& v)\n    {\n        return Velocity(zero_adjust(velocity \/ v,velocity));\n    }\n\n    \/** Overloaded pre-increement operator. *\/\n    Velocity& operator ++ ()\n    {\n        velocity = zero_adjust(velocity + 1,velocity);\n        return *this;\n    }\n\n    \/** Overloaded post-increment operator. *\/\n    Velocity operator ++ (int)\n    {\n        Velocity result(*this);\n        velocity = zero_adjust(velocity + 1,velocity);\n        return result;\n    }\n\n    \/** Overloaded pre-decreement operator. *\/\n    Velocity& operator -- ()\n    {\n        velocity = zero_adjust(velocity - 1,velocity);\n        return *this;\n    }\n\n    \/** Overloaded post-decrement operator. *\/\n    Velocity operator -- (int)\n    {\n        Velocity result(*this);\n        velocity = zero_adjust(velocity - 1,velocity);\n        return result;\n    }\n\n    \/** Overloaded addition equals operator. *\/\n    Velocity& operator += (const Velocity& v)\n    {\n        velocity = zero_adjust(velocity + v.velocity,velocity);\n        return *this;\n    }\n\n    \/** Overloaded addition equals operator. *\/\n    Velocity& operator += (const float& v)\n    {\n        velocity = zero_adjust(velocity + v,velocity);\n        return *this;\n    }\n\n    \/** Overloaded subtraction equals operator. *\/\n    Velocity& operator -= (const Velocity& v)\n    {\n        velocity = zero_adjust(velocity - v.velocity,velocity);\n        return *this;\n    }\n\n    \/** Overloaded subtraction equals operator. *\/\n    Velocity& operator -= (const float& v)\n    {\n        velocity = zero_adjust(velocity - v,velocity);\n        return *this;\n    }\n\n    \/** Overloaded multiplication equals operator. *\/\n    Velocity& operator *= (const Velocity& v)\n    {\n        velocity = zero_adjust(velocity * v.velocity,velocity);\n        return *this;\n    }\n\n    \/** Overloaded multiplication equals operator. *\/\n    Velocity& operator *= (const float& v)\n    {\n        velocity = zero_adjust(velocity * v,velocity);\n        return *this;\n    }\n\n    \/** Overloaded division equals operator. *\/\n    Velocity& operator \/= (const Velocity& v)\n    {\n        velocity = zero_adjust(velocity \/ v.velocity,velocity);\n        return *this;\n    }\n\n    \/** Overloaded division equals operator. *\/\n    Velocity& operator \/= (const float& v)\n    {\n        velocity = zero_adjust(velocity \/ v,velocity);\n        return *this;\n    }\n\n    \/** Overloaded equals operator. *\/\n    Velocity& operator = (const Velocity& v)\n    {\n        velocity = v.velocity;\n        return *this;\n    }\n\n    \/** Overloaded equals operator. *\/\n    Velocity& operator = (const float& v)\n    {\n        velocity = v;\n        return *this;\n    }\n\n    \/** Overloaded equals equals operator *\/\n    bool operator == (const Velocity& v)\n    {\n        return (v.velocity == velocity);\n    }\n    \n    \/** Overloaded equals equals operator *\/\n    bool operator == (const float& v)\n    {\n        return (v == velocity);\n    }\n    \n    \/** Overloaded not equals operator *\/\n    bool operator != (const Velocity& v)\n    {\n        return (v.velocity != velocity);\n    }\n    \n    \/** Overloaded not equals operator *\/\n    bool operator != (const float& v)\n    {\n        return (v != velocity);\n    }\n    \nprivate:\n    \/** Floating point representation of velocity. *\/\n    float velocity;\n    \n    \/** Adjust for a math result of negative 0.\n     * @param value value of math result\n     * @param old original value before expression\n     *\/\n    float zero_adjust(float value, float old)\n    {\n        if (value == 0)\n        {\n            return copysign(value, old);\n        }\n        return value;\n    }\n};\n\n\n}; \/* namespace NMRAnet *\/\n\n#endif \/* _NMRAnetVelocity_hxx_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"SampSharp.h\"\n\n#include <mono\/metadata\/threads.h>\n#include \"PathUtil.h\"\n#include \"Natives.h\"\n\nusing namespace std;\n\nMonoMethod *SampSharp::onTimerTick;\nMonoMethod *SampSharp::onTick;\n\nMonoDomain *SampSharp::rootDomain;\n\nMonoImage *SampSharp::gameModeImage;\nMonoImage *SampSharp::baseModeImage;\n\nMonoClass *SampSharp::gameModeClassType;\nMonoClass *SampSharp::baseModeClassType;\n\nuint32_t SampSharp::gameModeHandle;\n\nEventMap SampSharp::events;\n\nvoid SampSharp::Load(string baseModePath, string gameModePath, string gameModeNamespace, string gameModeClass, bool debug) {\n\n\t#ifdef _WIN32\n\t\/\/On windows, use the embedded mono tools\n\tmono_set_dirs(PathUtil::GetLibDirectory().c_str(), PathUtil::GetConfigDirectory().c_str());\n\t#endif\n\n\tmono_debug_init(MONO_DEBUG_FORMAT_MONO);\n\n\t\/\/Initialize mono runtime\n\trootDomain = mono_jit_init(PathUtil::GetPathInBin(gameModePath).c_str());\n\n\t\/\/Generate symbols if needed\n\t#ifdef _WIN32\n\tif (debug == true) {\n\t\tGenerateSymbols(baseModePath);\n\t\tGenerateSymbols(gameModePath);\n\t}\n\t#endif\n\n\t\/\/Load the gamemode's assembly\n\tgameModeImage = mono_assembly_get_image(mono_domain_assembly_open(mono_domain_get(), (char *)PathUtil::GetPathInBin(gameModePath).c_str()));\n\tbaseModeImage = mono_assembly_get_image(mono_domain_assembly_open(mono_domain_get(), (char *)PathUtil::GetPathInBin(baseModePath).c_str()));\n\n\t\/\/Load all sa-mp natives\n\tLoadNatives(); \n\n\t\/\/Create instance of the gamemode's class\n\tbaseModeClassType = mono_class_from_name(baseModeImage, \"SampSharp.GameMode\", \"BaseMode\");\n\tgameModeClassType = mono_class_from_name(gameModeImage, gameModeNamespace.c_str(), gameModeClass.c_str());\n\n\tMonoObject *gameModeObject = mono_object_new(mono_domain_get(), gameModeClassType);\n\tgameModeHandle = mono_gchandle_new(gameModeObject, true);\n\tmono_runtime_object_init(gameModeObject);\n\n\t\/\/Load tick events\n\tonTimerTick = LoadEvent(gameModeClass.c_str(), \"OnTimerTick\");\n\tonTick = LoadEvent(gameModeClass.c_str(), \"OnTick\");\n}\n\n#ifdef _WIN32\nvoid SampSharp::GenerateSymbols(string path)\n{\n\t\n\tstring mdbpath = PathUtil::GetLibDirectory().append(\"mono\/4.5\/pdb2mdb.exe\");\n\tchar *cmdbpath = new char[mdbpath.size() + 1];\n\tstrcpy(cmdbpath, mdbpath.c_str());\n\t\n\tMonoAssembly *mdbconverter = mono_domain_assembly_open(rootDomain, cmdbpath);\n\tif (mdbconverter) {\n\t\tchar *argv[2];\n\t\targv[0] = cmdbpath;\n\t\targv[1] = (char *) path.c_str();\n\n\t\tsampgdk::logprintf(\"[SampSharp] Generating symbol file for %s.\", argv[1]);\n\t\tmono_jit_exec(rootDomain, mdbconverter, 2, argv);\n\t}\n\n\tdelete cmdbpath;\n}\n#endif\n\nchar *GetTimeStamp() {\n\t\/\/Get current time\n\ttime_t now = time(0);\n\n\t\/\/Format timestamp \n\tchar timestamp[32];\n\t\n\tstrftime(timestamp, sizeof(timestamp), \"[%d\/%m\/%Y %H:%M:%S]\", localtime(&now));\n\n\tchar *timestamp2 = new char[32];\n\tstrcpy(timestamp2, timestamp);\n\treturn  timestamp2;\n}\n\nMonoMethod *SampSharp::LoadEvent(const char *className, const char *name) {\n\tchar *gamemodeBuffer = new char[128];\n\tchar *basemodeBuffer = new char[128];\n\tsprintf(gamemodeBuffer, \"%s:%s\", className, name);\n\tsprintf(basemodeBuffer, \"BaseMode:%s\", name);\n\n\tMonoMethodDesc *methodDescription = mono_method_desc_new(gamemodeBuffer, false);\n\tMonoMethod *method = mono_method_desc_search_in_image(methodDescription, gameModeImage);\n\tmono_method_desc_free(methodDescription);\n\n\tif (!method) {\n\t\tmethodDescription = mono_method_desc_new(basemodeBuffer, false);\n\t\tmethod = mono_method_desc_search_in_image(methodDescription, baseModeImage);\n\t\tmono_method_desc_free(methodDescription);\n\n\t\tif (!method) {\n\t\t\tofstream logfile;\n\t\t\tlogfile.open(\"SampSharp_errors.log\", ios::app);\n\t\t\tcout << \"[SampSharp] ERROR: Method '\" << name << \"' not found in image!\" << endl;\n\t\t\tlogfile << GetTimeStamp() << \"ERROR: Method '\" << name << \"' not found in image!\" << endl;\n\t\t\tlogfile.close();\n\t\t}\n\t}\n\n\treturn method;\n}\n\nbool SampSharp::HandleEvent(AMX *amx, const char *name, cell *params, cell *retval) {\n\tconst int param_count = params[0] \/ sizeof(cell);\n\n\tif (param_count > 16) {\n\t\treturn true;\n\t}\n\n\tmono_thread_attach(SampSharp::rootDomain);\n\n\tif (events.find(name) == events.end())\n\t{\n\t\tMonoMethod *m_method = mono_class_get_method_from_name(gameModeClassType, name, param_count);\n\t\tbool useBaseModeImage = false;\n\t\tif (!m_method) {\n\t\t\tm_method = mono_class_get_method_from_name(baseModeClassType, name, param_count);\n\t\t\tuseBaseModeImage = true;\n\t\t}\n\n\t\tif (!m_method){\n\t\t\tevents[name] = NULL;\n\t\t\treturn true;\n\t\t}\n\n\t\tuint32_t token = mono_method_get_token(m_method);\n\t\tMonoMethodSignature *sig = mono_method_get_signature(m_method, useBaseModeImage ? baseModeImage : gameModeImage, token);\n\t\t\n\t\tvoid *iter = NULL;\n\t\tstring format = \"\";\n\t\tMonoType* type = NULL;\n\t\t\n\t\twhile (type = mono_signature_get_params(sig, &iter)) {\n\t\t\tstring type_name = mono_type_get_name(type);\n\n\t\t\tif (!type_name.compare(\"System.Int32\")) {\n\t\t\t\tformat.append(\"i\");\t\n\t\t\t}\n\t\t\telse if (!type_name.compare(\"System.Single\")) {\n\t\t\t\tformat.append(\"f\");\n\t\t\t}\n\t\t\telse if (!type_name.compare(\"System.String\")) {\n\t\t\t\tformat.append(\"s\");\n\t\t\t}\n\t\t\telse if (!type_name.compare(\"System.Boolean\")) {\n\t\t\t\tformat.append(\"b\");\n\t\t\t}\n\t\t\telse {\n\t\t\t\tevents[name] = NULL;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tevent_t *event_add = new event_t;\n\t\tevent_add->method = m_method;\n\t\tevent_add->format = format;\n\t\tevents[name] = event_add;\n\t}\n\n\tevent_t *event_p = events[name];\n\t\n\tif (event_p)\n\t{\n\t\tif (!param_count) {\n\t\t\tint retint = SampSharp::CallEvent(event_p->method, NULL);\n\t\t\tif (retint != -1) {\n\t\t\t\t*retval = retint;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\telse {\n\t\t\tvoid *args[16];\n\t\t\tfor (int i = 0; i < param_count; i++) {\n\t\t\t\tswitch (event_p->format[i])\n\t\t\t\t{\n\t\t\t\tcase 'i':\n\t\t\t\tcase 'f':\n\t\t\t\tcase 'b':\n\t\t\t\t\targs[i] = &params[i + 1];\n\t\t\t\t\tbreak;\n\t\t\t\tcase 's':\n\t\t\t\t\tint len = NULL;\n\t\t\t\t\tcell *addr = NULL;\n\n\t\t\t\t\tamx_GetAddr(amx, params[i + 1], &addr);\n\t\t\t\t\tamx_StrLen(addr, &len);\n\n\t\t\t\t\tif (len) {\n\t\t\t\t\t\tlen++;\n\n\t\t\t\t\t\tchar* text = new char[len];\n\n\t\t\t\t\t\tamx_GetString(text, addr, 0, len);\n\t\t\t\t\t\targs[i] = mono_string_new(mono_domain_get(), text);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\targs[i] = mono_string_new(mono_domain_get(), \"\");\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\tint retint = SampSharp::CallEvent(event_p->method, args);\n\n\t\t\tif (retint != -1) {\n\t\t\t\t*retval = retint;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nint SampSharp::CallEvent(MonoMethod* method, void **params) {\n\n\tMonoObject *exception = NULL;\n\t\n\tif (!method) {\n\t\tofstream logfile;\n\t\tlogfile.open(\"SampSharp_errors.log\", ios::app);\n\t\tcout << \"[SampSharp] ERROR: No method given in CallEvent!\" << endl;\n\t\tlogfile << GetTimeStamp() << \"ERROR: No method given in CallEvent!\" << endl;\n\t\tlogfile.close();\n\n\t\treturn false;\n\t}\n\n\tMonoObject *response = mono_runtime_invoke(method, mono_gchandle_get_target(gameModeHandle), params, &exception);\n\n\tif (exception) {\n\t\tchar *stacktrace = mono_string_to_utf8(mono_object_to_string(exception, NULL));\n\n\t\tofstream logfile;\n\t\tlogfile.open(\"SampSharp_errors.log\", ios::app | ios::binary);\n\t\tcout << \"[SampSharp] Exception thrown:\" << endl << stacktrace << endl;\n\t\tlogfile << GetTimeStamp() << \" Exception thrown:\" << \"\\r\\n\" << stacktrace << \"\\r\\n\";\n\t\tlogfile.close();\n\n\t\treturn -1;\n\t}\n\n\tif (!response) {\n\t\treturn -1;\n\t}\n\n\treturn *(bool *)mono_object_unbox(response) == true ? 1 : 0;;\n}\n\nvoid SampSharp::Unload() {\n\tmono_jit_cleanup(mono_domain_get());\n}\n<commit_msg>Fixed crash on incompatible callbacks<commit_after>#include \"SampSharp.h\"\n\n#include <mono\/metadata\/threads.h>\n#include \"PathUtil.h\"\n#include \"Natives.h\"\n\nusing namespace std;\n\nMonoMethod *SampSharp::onTimerTick;\nMonoMethod *SampSharp::onTick;\n\nMonoDomain *SampSharp::rootDomain;\n\nMonoImage *SampSharp::gameModeImage;\nMonoImage *SampSharp::baseModeImage;\n\nMonoClass *SampSharp::gameModeClassType;\nMonoClass *SampSharp::baseModeClassType;\n\nuint32_t SampSharp::gameModeHandle;\n\nEventMap SampSharp::events;\n\nvoid SampSharp::Load(string baseModePath, string gameModePath, string gameModeNamespace, string gameModeClass, bool debug) {\n\n\t#ifdef _WIN32\n\t\/\/On windows, use the embedded mono tools\n\tmono_set_dirs(PathUtil::GetLibDirectory().c_str(), PathUtil::GetConfigDirectory().c_str());\n\t#endif\n\n\tmono_debug_init(MONO_DEBUG_FORMAT_MONO);\n\n\t\/\/Initialize mono runtime\n\trootDomain = mono_jit_init(PathUtil::GetPathInBin(gameModePath).c_str());\n\n\t\/\/Generate symbols if needed\n\t#ifdef _WIN32\n\tif (debug == true) {\n\t\tGenerateSymbols(baseModePath);\n\t\tGenerateSymbols(gameModePath);\n\t}\n\t#endif\n\n\t\/\/Load the gamemode's assembly\n\tgameModeImage = mono_assembly_get_image(mono_domain_assembly_open(mono_domain_get(), (char *)PathUtil::GetPathInBin(gameModePath).c_str()));\n\tbaseModeImage = mono_assembly_get_image(mono_domain_assembly_open(mono_domain_get(), (char *)PathUtil::GetPathInBin(baseModePath).c_str()));\n\n\t\/\/Load all sa-mp natives\n\tLoadNatives(); \n\n\t\/\/Create instance of the gamemode's class\n\tbaseModeClassType = mono_class_from_name(baseModeImage, \"SampSharp.GameMode\", \"BaseMode\");\n\tgameModeClassType = mono_class_from_name(gameModeImage, gameModeNamespace.c_str(), gameModeClass.c_str());\n\n\tMonoObject *gameModeObject = mono_object_new(mono_domain_get(), gameModeClassType);\n\tgameModeHandle = mono_gchandle_new(gameModeObject, true);\n\tmono_runtime_object_init(gameModeObject);\n\n\t\/\/Load tick events\n\tonTimerTick = LoadEvent(gameModeClass.c_str(), \"OnTimerTick\");\n\tonTick = LoadEvent(gameModeClass.c_str(), \"OnTick\");\n}\n\n#ifdef _WIN32\nvoid SampSharp::GenerateSymbols(string path)\n{\n\t\n\tstring mdbpath = PathUtil::GetLibDirectory().append(\"mono\/4.5\/pdb2mdb.exe\");\n\tchar *cmdbpath = new char[mdbpath.size() + 1];\n\tstrcpy(cmdbpath, mdbpath.c_str());\n\t\n\tMonoAssembly *mdbconverter = mono_domain_assembly_open(rootDomain, cmdbpath);\n\tif (mdbconverter) {\n\t\tchar *argv[2];\n\t\targv[0] = cmdbpath;\n\t\targv[1] = (char *) path.c_str();\n\n\t\tsampgdk::logprintf(\"[SampSharp] Generating symbol file for %s.\", argv[1]);\n\t\tmono_jit_exec(rootDomain, mdbconverter, 2, argv);\n\t}\n\n\tdelete cmdbpath;\n}\n#endif\n\nchar *GetTimeStamp() {\n\t\/\/Get current time\n\ttime_t now = time(0);\n\n\t\/\/Format timestamp \n\tchar timestamp[32];\n\t\n\tstrftime(timestamp, sizeof(timestamp), \"[%d\/%m\/%Y %H:%M:%S]\", localtime(&now));\n\n\tchar *timestamp2 = new char[32];\n\tstrcpy(timestamp2, timestamp);\n\treturn  timestamp2;\n}\n\nMonoMethod *SampSharp::LoadEvent(const char *className, const char *name) {\n\tchar *gamemodeBuffer = new char[128];\n\tchar *basemodeBuffer = new char[128];\n\tsprintf(gamemodeBuffer, \"%s:%s\", className, name);\n\tsprintf(basemodeBuffer, \"BaseMode:%s\", name);\n\n\tMonoMethodDesc *methodDescription = mono_method_desc_new(gamemodeBuffer, false);\n\tMonoMethod *method = mono_method_desc_search_in_image(methodDescription, gameModeImage);\n\tmono_method_desc_free(methodDescription);\n\n\tif (!method) {\n\t\tmethodDescription = mono_method_desc_new(basemodeBuffer, false);\n\t\tmethod = mono_method_desc_search_in_image(methodDescription, baseModeImage);\n\t\tmono_method_desc_free(methodDescription);\n\n\t\tif (!method) {\n\t\t\tofstream logfile;\n\t\t\tlogfile.open(\"SampSharp_errors.log\", ios::app);\n\t\t\tcout << \"[SampSharp] ERROR: Method '\" << name << \"' not found in image!\" << endl;\n\t\t\tlogfile << GetTimeStamp() << \"ERROR: Method '\" << name << \"' not found in image!\" << endl;\n\t\t\tlogfile.close();\n\t\t}\n\t}\n\n\treturn method;\n}\n\nbool SampSharp::HandleEvent(AMX *amx, const char *name, cell *params, cell *retval) {\n\tconst int param_count = params[0] \/ sizeof(cell);\n\t\n\tif (strlen(name) == 0 || param_count > 16) {\n\t\treturn true;\n\t}\n\n\tmono_thread_attach(SampSharp::rootDomain);\n\n\tif (events.find(name) == events.end())\n\t{\n\t\tMonoMethod *m_method = mono_class_get_method_from_name(gameModeClassType, name, param_count);\n\t\tbool useBaseModeImage = false;\n\t\tif (!m_method) {\n\t\t\tm_method = mono_class_get_method_from_name(baseModeClassType, name, param_count);\n\t\t\tuseBaseModeImage = true;\n\t\t}\n\n\t\tif (!m_method){\n\t\t\tevents[name] = NULL;\n\t\t\treturn true;\n\t\t}\n\n\t\tuint32_t token = mono_method_get_token(m_method);\n\t\tMonoMethodSignature *sig = mono_method_get_signature(m_method, useBaseModeImage ? baseModeImage : gameModeImage, token);\n\t\t\n\t\tvoid *iter = NULL;\n\t\tstring format = \"\";\n\t\tMonoType* type = NULL;\n\t\t\n\t\twhile (type = mono_signature_get_params(sig, &iter)) {\n\t\t\tstring type_name = mono_type_get_name(type);\n\n\t\t\tif (!type_name.compare(\"System.Int32\")) {\n\t\t\t\tformat.append(\"i\");\t\n\t\t\t}\n\t\t\telse if (!type_name.compare(\"System.Single\")) {\n\t\t\t\tformat.append(\"f\");\n\t\t\t}\n\t\t\telse if (!type_name.compare(\"System.String\")) {\n\t\t\t\tformat.append(\"s\");\n\t\t\t}\n\t\t\telse if (!type_name.compare(\"System.Boolean\")) {\n\t\t\t\tformat.append(\"b\");\n\t\t\t}\n\t\t\telse {\n\t\t\t\tevents[name] = NULL;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tevent_t *event_add = new event_t;\n\t\tevent_add->method = m_method;\n\t\tevent_add->format = format;\n\t\tevents[name] = event_add;\n\t}\n\n\tevent_t *event_p = events[name];\n\t\n\tif (event_p)\n\t{\n\t\tif (!param_count) {\n\t\t\tint retint = SampSharp::CallEvent(event_p->method, NULL);\n\t\t\tif (retint != -1) {\n\t\t\t\t*retval = retint;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\telse {\n\t\t\tvoid *args[16];\n\t\t\tfor (int i = 0; i < param_count; i++) {\n\t\t\t\tswitch (event_p->format[i])\n\t\t\t\t{\n\t\t\t\tcase 'i':\n\t\t\t\tcase 'f':\n\t\t\t\tcase 'b':\n\t\t\t\t\targs[i] = &params[i + 1];\n\t\t\t\t\tbreak;\n\t\t\t\tcase 's':\n\t\t\t\t\tint len = NULL;\n\t\t\t\t\tcell *addr = NULL;\n\n\t\t\t\t\tamx_GetAddr(amx, params[i + 1], &addr);\n\t\t\t\t\tamx_StrLen(addr, &len);\n\n\t\t\t\t\tif (len) {\n\t\t\t\t\t\tlen++;\n\n\t\t\t\t\t\tchar* text = new char[len];\n\n\t\t\t\t\t\tamx_GetString(text, addr, 0, len);\n\t\t\t\t\t\targs[i] = mono_string_new(mono_domain_get(), text);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\targs[i] = mono_string_new(mono_domain_get(), \"\");\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\tint retint = SampSharp::CallEvent(event_p->method, args);\n\n\t\t\tif (retint != -1) {\n\t\t\t\t*retval = retint;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nint SampSharp::CallEvent(MonoMethod* method, void **params) {\n\n\tMonoObject *exception = NULL;\n\t\n\tif (!method) {\n\t\tofstream logfile;\n\t\tlogfile.open(\"SampSharp_errors.log\", ios::app);\n\t\tcout << \"[SampSharp] ERROR: No method given in CallEvent!\" << endl;\n\t\tlogfile << GetTimeStamp() << \"ERROR: No method given in CallEvent!\" << endl;\n\t\tlogfile.close();\n\n\t\treturn false;\n\t}\n\n\tMonoObject *response = mono_runtime_invoke(method, mono_gchandle_get_target(gameModeHandle), params, &exception);\n\n\tif (exception) {\n\t\tchar *stacktrace = mono_string_to_utf8(mono_object_to_string(exception, NULL));\n\n\t\tofstream logfile;\n\t\tlogfile.open(\"SampSharp_errors.log\", ios::app | ios::binary);\n\t\tcout << \"[SampSharp] Exception thrown:\" << endl << stacktrace << endl;\n\t\tlogfile << GetTimeStamp() << \" Exception thrown:\" << \"\\r\\n\" << stacktrace << \"\\r\\n\";\n\t\tlogfile.close();\n\n\t\treturn -1;\n\t}\n\n\tif (!response) {\n\t\treturn -1;\n\t}\n\n\treturn *(bool *)mono_object_unbox(response) == true ? 1 : 0;;\n}\n\nvoid SampSharp::Unload() {\n\tmono_jit_cleanup(mono_domain_get());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\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\/\/ RUN: cat %s | %cling -I%p -Xclang -verify 2>&1 | FileCheck %s\n\n\/\/ Test the removal of decls which are stored in vector of redeclarables\n.rawInput 1\nextern int __my_i;\ntemplate<typename T> T TemplatedF(T t);\ntemplate<> double TemplatedF(double); \/\/ forward declare TemplatedF\nint OverloadedF(int i);\nfloat OverloadedF(float f){ return f + 100.111f;}\ndouble OverloadedF(double d){ return d + 10.11f; };\nnamespace test { int y = 0; }\n.rawInput 0\n\n.storeState \"testSubsequentDecls\"\n#include \"SubsequentDecls.h\"\n.compareState \"testSubsequentDecls\"\n\/\/ CHECK-NOT: Differences\n\nTemplatedF((int)2) \/\/ expected-diagnostics{{C++ requires a type specifier for all declarations}} expected-diagnostics{{expected ';' after top level declarator}}\n\n.rawInput 1\ntemplate<> int TemplatedF(int i) { return i + 100; }\nint OverloadedF(int i) { return i + 100;}\n.rawInput 0\n\nint __my_i = 10\n\/\/ CHECK: (int) 10\nOverloadedF(__my_i)\n\/\/ CHECK: (int) 110\nTemplatedF(__my_i)\n\/\/ CHECK: (int) 110\n\nTemplatedF((double)3.14)\n\/\/ CHECK: IncrementalExecutor::executeFunction: symbol '_Z10TemplatedFIdET_S0_' unresolved while linking function\n\n.q\n<commit_msg>Error now comes during reloc (static init).<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\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\/\/ RUN: cat %s | %cling -I%p -Xclang -verify 2>&1 | FileCheck %s\n\n\/\/ Test the removal of decls which are stored in vector of redeclarables\n.rawInput 1\nextern int __my_i;\ntemplate<typename T> T TemplatedF(T t);\ntemplate<> double TemplatedF(double); \/\/ forward declare TemplatedF\nint OverloadedF(int i);\nfloat OverloadedF(float f){ return f + 100.111f;}\ndouble OverloadedF(double d){ return d + 10.11f; };\nnamespace test { int y = 0; }\n.rawInput 0\n\n.storeState \"testSubsequentDecls\"\n#include \"SubsequentDecls.h\"\n.compareState \"testSubsequentDecls\"\n\/\/ CHECK-NOT: Differences\n\nTemplatedF((int)2) \/\/ expected-diagnostics{{C++ requires a type specifier for all declarations}} expected-diagnostics{{expected ';' after top level declarator}}\n\n.rawInput 1\ntemplate<> int TemplatedF(int i) { return i + 100; }\nint OverloadedF(int i) { return i + 100;}\n.rawInput 0\n\nint __my_i = 10\n\/\/ CHECK: (int) 10\nOverloadedF(__my_i)\n\/\/ CHECK: (int) 110\nTemplatedF(__my_i)\n\/\/ CHECK: (int) 110\n\nTemplatedF((double)3.14)\n\/\/ CHECK: IncrementalExecutor::executeFunction: symbol '_Z10TemplatedFIdET_S0_' unresolved while linking\n\n.q\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Aspia Project\n\/\/ Copyright (C) 2018 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 \"client\/file_transfer.h\"\n\n#include <QTimerEvent>\n\n#include \"base\/logging.h\"\n#include \"client\/file_status.h\"\n#include \"client\/file_transfer_queue_builder.h\"\n#include \"common\/file_packet.h\"\n\nnamespace client {\n\nFileTransfer::FileTransfer(Type type, QObject* parent)\n    : QObject(parent),\n      type_(type)\n{\n    actions_.insert(OtherError, QPair<Actions, Action>(Abort, Ask));\n    actions_.insert(DirectoryCreateError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n    actions_.insert(FileCreateError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n    actions_.insert(FileOpenError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n    actions_.insert(FileAlreadyExists,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll | Replace | ReplaceAll, Ask));\n    actions_.insert(FileWriteError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n    actions_.insert(FileReadError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n}\n\nvoid FileTransfer::start(const QString& source_path,\n                         const QString& target_path,\n                         const QList<Item>& items)\n{\n    builder_ = new FileTransferQueueBuilder();\n\n    connect(builder_, &FileTransferQueueBuilder::started, this, &FileTransfer::started);\n    connect(builder_, &FileTransferQueueBuilder::error, this, &FileTransfer::taskQueueError);\n    connect(builder_, &FileTransferQueueBuilder::finished, this, &FileTransfer::taskQueueReady);\n\n    if (type_ == Downloader)\n    {\n        connect(builder_, &FileTransferQueueBuilder::newRequest, this, &FileTransfer::remoteRequest);\n    }\n    else\n    {\n        DCHECK(type_ == Uploader);\n        connect(builder_, &FileTransferQueueBuilder::newRequest, this, &FileTransfer::localRequest);\n    }\n\n    connect(builder_, &FileTransferQueueBuilder::finished,\n            builder_, &FileTransferQueueBuilder::deleteLater);\n\n    builder_->start(source_path, target_path, items);\n}\n\nvoid FileTransfer::stop()\n{\n    cancel_timer_id_ = startTimer(std::chrono::seconds(5));\n    is_canceled_ = true;\n}\n\nFileTransfer::Actions FileTransfer::availableActions(Error error_type) const\n{\n    return actions_[error_type].first;\n}\n\nFileTransfer::Action FileTransfer::defaultAction(Error error_type) const\n{\n    return actions_[error_type].second;\n}\n\nvoid FileTransfer::setDefaultAction(Error error_type, Action action)\n{\n    actions_[error_type].second = action;\n}\n\nFileTransferTask& FileTransfer::currentTask()\n{\n    return tasks_.front();\n}\n\nvoid FileTransfer::targetReply(const proto::file_transfer::Request& request,\n                               const proto::file_transfer::Reply& reply)\n{\n    if (tasks_.isEmpty())\n        return;\n\n    if (request.has_create_directory_request())\n    {\n        if (reply.status() == proto::file_transfer::STATUS_SUCCESS ||\n            reply.status() == proto::file_transfer::STATUS_PATH_ALREADY_EXISTS)\n        {\n            processNextTask();\n            return;\n        }\n\n        processError(DirectoryCreateError,\n                     tr(\"Failed to create directory \\\"%1\\\": %2\")\n                     .arg(currentTask().targetPath())\n                     .arg(fileStatusToString(reply.status())));\n    }\n    else if (request.has_upload_request())\n    {\n        if (reply.status() != proto::file_transfer::STATUS_SUCCESS)\n        {\n            Error error_type = FileCreateError;\n\n            if (reply.status() == proto::file_transfer::STATUS_PATH_ALREADY_EXISTS)\n                error_type = FileAlreadyExists;\n\n            processError(error_type,\n                         tr(\"Failed to create file \\\"%1\\\": %2\")\n                         .arg(currentTask().targetPath())\n                         .arg(fileStatusToString(reply.status())));\n            return;\n        }\n\n        common::FileRequest* file_request =\n            common::FileRequest::packetRequest(proto::file_transfer::PacketRequest::NO_FLAGS);\n        connect(file_request, &common::FileRequest::replyReady, this, &FileTransfer::sourceReply);\n        sourceRequest(file_request);\n    }\n    else if (request.has_packet())\n    {\n        if (reply.status() != proto::file_transfer::STATUS_SUCCESS)\n        {\n            processError(FileWriteError,\n                         tr(\"Failed to write file \\\"%1\\\": %2\")\n                         .arg(currentTask().targetPath())\n                         .arg(fileStatusToString(reply.status())));\n            return;\n        }\n\n        int64_t full_task_size = currentTask().size();\n        if (full_task_size && total_size_)\n        {\n            int64_t packet_size = common::kMaxFilePacketSize;\n\n            task_transfered_size_ += packet_size;\n\n            if (task_transfered_size_ > full_task_size)\n            {\n                packet_size = task_transfered_size_ - full_task_size;\n                task_transfered_size_ = full_task_size;\n            }\n\n            total_transfered_size_ += packet_size;\n\n            int task_percentage = task_transfered_size_ * 100 \/ full_task_size;\n            int total_percentage = total_transfered_size_ * 100 \/ total_size_;\n\n            if (task_percentage != task_percentage_ || total_percentage != total_percentage_)\n            {\n                task_percentage_ = task_percentage;\n                total_percentage_ = total_percentage;\n\n                emit progressChanged(total_percentage_, task_percentage_);\n            }\n        }\n\n        if (request.packet().flags() & proto::file_transfer::Packet::LAST_PACKET)\n        {\n            processNextTask();\n            return;\n        }\n\n        uint32_t flags = proto::file_transfer::PacketRequest::NO_FLAGS;\n        if (is_canceled_)\n            flags = proto::file_transfer::PacketRequest::CANCEL;\n\n        common::FileRequest* file_request = common::FileRequest::packetRequest(flags);\n        connect(file_request, &common::FileRequest::replyReady, this, &FileTransfer::sourceReply);\n        sourceRequest(file_request);\n    }\n    else\n    {\n        emit error(this, OtherError, tr(\"An unexpected response to the request was received\"));\n    }\n}\n\nvoid FileTransfer::sourceReply(const proto::file_transfer::Request& request,\n                               const proto::file_transfer::Reply& reply)\n{\n    if (tasks_.isEmpty())\n        return;\n\n    if (request.has_download_request())\n    {\n        if (reply.status() != proto::file_transfer::STATUS_SUCCESS)\n        {\n            processError(FileOpenError,\n                         tr(\"Failed to open file \\\"%1\\\": %2\")\n                         .arg(currentTask().sourcePath()\n                         .arg(fileStatusToString(reply.status()))));\n            return;\n        }\n\n        common::FileRequest* file_request =\n            common::FileRequest::uploadRequest(currentTask().targetPath(),\n                                               currentTask().overwrite());\n        connect(file_request, &common::FileRequest::replyReady, this, &FileTransfer::targetReply);\n        targetRequest(file_request);\n    }\n    else if (request.has_packet_request())\n    {\n        if (reply.status() != proto::file_transfer::STATUS_SUCCESS)\n        {\n            processError(FileReadError,\n                         tr(\"Failed to read file \\\"%1\\\": %2\")\n                         .arg(currentTask().sourcePath())\n                         .arg(fileStatusToString(reply.status())));\n            return;\n        }\n\n        common::FileRequest* file_request = common::FileRequest::packet(reply.packet());\n        connect(file_request, &common::FileRequest::replyReady, this, &FileTransfer::targetReply);\n        targetRequest(file_request);\n    }\n    else\n    {\n        emit error(this, OtherError, tr(\"An unexpected response to the request was received\"));\n    }\n}\n\nvoid FileTransfer::timerEvent(QTimerEvent* event)\n{\n    if (event->timerId() == cancel_timer_id_)\n    {\n        DCHECK(is_canceled_);\n\n        killTimer(cancel_timer_id_);\n        cancel_timer_id_ = 0;\n\n        tasks_.clear();\n\n        emit finished();\n    }\n}\n\nvoid FileTransfer::taskQueueError(const QString& message)\n{\n    emit error(this, OtherError, message);\n}\n\nvoid FileTransfer::taskQueueReady()\n{\n    DCHECK(builder_ != nullptr);\n\n    tasks_ = builder_->taskQueue();\n\n    for (const auto& task : tasks_)\n        total_size_ += task.size();\n\n    processTask(false);\n}\n\nvoid FileTransfer::applyAction(Error error_type, Action action)\n{\n    switch (action)\n    {\n        case Action::Abort:\n            emit finished();\n            break;\n\n        case Action::Replace:\n        case Action::ReplaceAll:\n        {\n            if (action == Action::ReplaceAll)\n                setDefaultAction(error_type, action);\n\n            processTask(true);\n        }\n        break;\n\n        case Action::Skip:\n        case Action::SkipAll:\n        {\n            if (action == Action::SkipAll)\n                setDefaultAction(error_type, action);\n\n            processNextTask();\n        }\n        break;\n\n        default:\n            LOG(LS_FATAL) << \"Unexpected action\";\n            break;\n    }\n}\n\nvoid FileTransfer::processTask(bool overwrite)\n{\n    task_percentage_ = 0;\n    task_transfered_size_ = 0;\n\n    FileTransferTask& task = currentTask();\n\n    task.setOverwrite(overwrite);\n\n    emit currentItemChanged(task.sourcePath(), task.targetPath());\n\n    if (task.isDirectory())\n    {\n        common::FileRequest* request =\n            common::FileRequest::createDirectoryRequest(task.targetPath());\n        connect(request, &common::FileRequest::replyReady, this, &FileTransfer::targetReply);\n        targetRequest(request);\n    }\n    else\n    {\n        common::FileRequest* request =\n            common::FileRequest::FileRequest::downloadRequest(task.sourcePath());\n        connect(request, &common::FileRequest::replyReady, this, &FileTransfer::sourceReply);\n        sourceRequest(request);\n    }\n}\n\nvoid FileTransfer::processNextTask()\n{\n    if (is_canceled_)\n        tasks_.clear();\n\n    if (!tasks_.isEmpty())\n    {\n        \/\/ Delete the task only after confirmation of its successful execution.\n        tasks_.pop_front();\n    }\n\n    if (tasks_.isEmpty())\n    {\n        if (cancel_timer_id_)\n            killTimer(cancel_timer_id_);\n\n        emit finished();\n        return;\n    }\n\n    processTask(false);\n}\n\nvoid FileTransfer::processError(Error error_type, const QString& message)\n{\n    Action action = defaultAction(error_type);\n    if (action != Ask)\n    {\n        applyAction(error_type, action);\n        return;\n    }\n\n    emit error(this, error_type, message);\n}\n\nvoid FileTransfer::sourceRequest(common::FileRequest* request)\n{\n    if (type_ == Downloader)\n    {\n        emit remoteRequest(request);\n    }\n    else\n    {\n        DCHECK(type_ == Uploader);\n        emit localRequest(request);\n    }\n}\n\nvoid FileTransfer::targetRequest(common::FileRequest* request)\n{\n    if (type_ == Downloader)\n    {\n        emit localRequest(request);\n    }\n    else\n    {\n        DCHECK(type_ == Uploader);\n        emit remoteRequest(request);\n    }\n}\n\n} \/\/ namespace client\n<commit_msg>- Fixed crash when it was impossible to get a list of files to transfer.<commit_after>\/\/\n\/\/ Aspia Project\n\/\/ Copyright (C) 2018 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 \"client\/file_transfer.h\"\n\n#include <QTimerEvent>\n\n#include \"base\/logging.h\"\n#include \"client\/file_status.h\"\n#include \"client\/file_transfer_queue_builder.h\"\n#include \"common\/file_packet.h\"\n\nnamespace client {\n\nFileTransfer::FileTransfer(Type type, QObject* parent)\n    : QObject(parent),\n      type_(type)\n{\n    actions_.insert(OtherError, QPair<Actions, Action>(Abort, Ask));\n    actions_.insert(DirectoryCreateError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n    actions_.insert(FileCreateError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n    actions_.insert(FileOpenError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n    actions_.insert(FileAlreadyExists,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll | Replace | ReplaceAll, Ask));\n    actions_.insert(FileWriteError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n    actions_.insert(FileReadError,\n                    QPair<Actions, Action>(Abort | Skip | SkipAll, Ask));\n}\n\nvoid FileTransfer::start(const QString& source_path,\n                         const QString& target_path,\n                         const QList<Item>& items)\n{\n    builder_ = new FileTransferQueueBuilder();\n\n    connect(builder_, &FileTransferQueueBuilder::started, this, &FileTransfer::started);\n    connect(builder_, &FileTransferQueueBuilder::error, this, &FileTransfer::taskQueueError);\n    connect(builder_, &FileTransferQueueBuilder::finished, this, &FileTransfer::taskQueueReady);\n\n    if (type_ == Downloader)\n    {\n        connect(builder_, &FileTransferQueueBuilder::newRequest, this, &FileTransfer::remoteRequest);\n    }\n    else\n    {\n        DCHECK(type_ == Uploader);\n        connect(builder_, &FileTransferQueueBuilder::newRequest, this, &FileTransfer::localRequest);\n    }\n\n    connect(builder_, &FileTransferQueueBuilder::finished,\n            builder_, &FileTransferQueueBuilder::deleteLater);\n\n    builder_->start(source_path, target_path, items);\n}\n\nvoid FileTransfer::stop()\n{\n    cancel_timer_id_ = startTimer(std::chrono::seconds(5));\n    is_canceled_ = true;\n}\n\nFileTransfer::Actions FileTransfer::availableActions(Error error_type) const\n{\n    return actions_[error_type].first;\n}\n\nFileTransfer::Action FileTransfer::defaultAction(Error error_type) const\n{\n    return actions_[error_type].second;\n}\n\nvoid FileTransfer::setDefaultAction(Error error_type, Action action)\n{\n    actions_[error_type].second = action;\n}\n\nFileTransferTask& FileTransfer::currentTask()\n{\n    return tasks_.front();\n}\n\nvoid FileTransfer::targetReply(const proto::file_transfer::Request& request,\n                               const proto::file_transfer::Reply& reply)\n{\n    if (tasks_.isEmpty())\n        return;\n\n    if (request.has_create_directory_request())\n    {\n        if (reply.status() == proto::file_transfer::STATUS_SUCCESS ||\n            reply.status() == proto::file_transfer::STATUS_PATH_ALREADY_EXISTS)\n        {\n            processNextTask();\n            return;\n        }\n\n        processError(DirectoryCreateError,\n                     tr(\"Failed to create directory \\\"%1\\\": %2\")\n                     .arg(currentTask().targetPath())\n                     .arg(fileStatusToString(reply.status())));\n    }\n    else if (request.has_upload_request())\n    {\n        if (reply.status() != proto::file_transfer::STATUS_SUCCESS)\n        {\n            Error error_type = FileCreateError;\n\n            if (reply.status() == proto::file_transfer::STATUS_PATH_ALREADY_EXISTS)\n                error_type = FileAlreadyExists;\n\n            processError(error_type,\n                         tr(\"Failed to create file \\\"%1\\\": %2\")\n                         .arg(currentTask().targetPath())\n                         .arg(fileStatusToString(reply.status())));\n            return;\n        }\n\n        common::FileRequest* file_request =\n            common::FileRequest::packetRequest(proto::file_transfer::PacketRequest::NO_FLAGS);\n        connect(file_request, &common::FileRequest::replyReady, this, &FileTransfer::sourceReply);\n        sourceRequest(file_request);\n    }\n    else if (request.has_packet())\n    {\n        if (reply.status() != proto::file_transfer::STATUS_SUCCESS)\n        {\n            processError(FileWriteError,\n                         tr(\"Failed to write file \\\"%1\\\": %2\")\n                         .arg(currentTask().targetPath())\n                         .arg(fileStatusToString(reply.status())));\n            return;\n        }\n\n        int64_t full_task_size = currentTask().size();\n        if (full_task_size && total_size_)\n        {\n            int64_t packet_size = common::kMaxFilePacketSize;\n\n            task_transfered_size_ += packet_size;\n\n            if (task_transfered_size_ > full_task_size)\n            {\n                packet_size = task_transfered_size_ - full_task_size;\n                task_transfered_size_ = full_task_size;\n            }\n\n            total_transfered_size_ += packet_size;\n\n            int task_percentage = task_transfered_size_ * 100 \/ full_task_size;\n            int total_percentage = total_transfered_size_ * 100 \/ total_size_;\n\n            if (task_percentage != task_percentage_ || total_percentage != total_percentage_)\n            {\n                task_percentage_ = task_percentage;\n                total_percentage_ = total_percentage;\n\n                emit progressChanged(total_percentage_, task_percentage_);\n            }\n        }\n\n        if (request.packet().flags() & proto::file_transfer::Packet::LAST_PACKET)\n        {\n            processNextTask();\n            return;\n        }\n\n        uint32_t flags = proto::file_transfer::PacketRequest::NO_FLAGS;\n        if (is_canceled_)\n            flags = proto::file_transfer::PacketRequest::CANCEL;\n\n        common::FileRequest* file_request = common::FileRequest::packetRequest(flags);\n        connect(file_request, &common::FileRequest::replyReady, this, &FileTransfer::sourceReply);\n        sourceRequest(file_request);\n    }\n    else\n    {\n        emit error(this, OtherError, tr(\"An unexpected response to the request was received\"));\n    }\n}\n\nvoid FileTransfer::sourceReply(const proto::file_transfer::Request& request,\n                               const proto::file_transfer::Reply& reply)\n{\n    if (tasks_.isEmpty())\n        return;\n\n    if (request.has_download_request())\n    {\n        if (reply.status() != proto::file_transfer::STATUS_SUCCESS)\n        {\n            processError(FileOpenError,\n                         tr(\"Failed to open file \\\"%1\\\": %2\")\n                         .arg(currentTask().sourcePath()\n                         .arg(fileStatusToString(reply.status()))));\n            return;\n        }\n\n        common::FileRequest* file_request =\n            common::FileRequest::uploadRequest(currentTask().targetPath(),\n                                               currentTask().overwrite());\n        connect(file_request, &common::FileRequest::replyReady, this, &FileTransfer::targetReply);\n        targetRequest(file_request);\n    }\n    else if (request.has_packet_request())\n    {\n        if (reply.status() != proto::file_transfer::STATUS_SUCCESS)\n        {\n            processError(FileReadError,\n                         tr(\"Failed to read file \\\"%1\\\": %2\")\n                         .arg(currentTask().sourcePath())\n                         .arg(fileStatusToString(reply.status())));\n            return;\n        }\n\n        common::FileRequest* file_request = common::FileRequest::packet(reply.packet());\n        connect(file_request, &common::FileRequest::replyReady, this, &FileTransfer::targetReply);\n        targetRequest(file_request);\n    }\n    else\n    {\n        emit error(this, OtherError, tr(\"An unexpected response to the request was received\"));\n    }\n}\n\nvoid FileTransfer::timerEvent(QTimerEvent* event)\n{\n    if (event->timerId() == cancel_timer_id_)\n    {\n        DCHECK(is_canceled_);\n\n        killTimer(cancel_timer_id_);\n        cancel_timer_id_ = 0;\n\n        tasks_.clear();\n\n        emit finished();\n    }\n}\n\nvoid FileTransfer::taskQueueError(const QString& message)\n{\n    emit error(this, OtherError, message);\n}\n\nvoid FileTransfer::taskQueueReady()\n{\n    DCHECK(builder_ != nullptr);\n\n    tasks_ = builder_->taskQueue();\n    if (tasks_.isEmpty())\n    {\n        emit finished();\n        return;\n    }\n\n    for (const auto& task : tasks_)\n        total_size_ += task.size();\n\n    processTask(false);\n}\n\nvoid FileTransfer::applyAction(Error error_type, Action action)\n{\n    switch (action)\n    {\n        case Action::Abort:\n            emit finished();\n            break;\n\n        case Action::Replace:\n        case Action::ReplaceAll:\n        {\n            if (action == Action::ReplaceAll)\n                setDefaultAction(error_type, action);\n\n            processTask(true);\n        }\n        break;\n\n        case Action::Skip:\n        case Action::SkipAll:\n        {\n            if (action == Action::SkipAll)\n                setDefaultAction(error_type, action);\n\n            processNextTask();\n        }\n        break;\n\n        default:\n            LOG(LS_FATAL) << \"Unexpected action\";\n            break;\n    }\n}\n\nvoid FileTransfer::processTask(bool overwrite)\n{\n    task_percentage_ = 0;\n    task_transfered_size_ = 0;\n\n    FileTransferTask& task = currentTask();\n\n    task.setOverwrite(overwrite);\n\n    emit currentItemChanged(task.sourcePath(), task.targetPath());\n\n    if (task.isDirectory())\n    {\n        common::FileRequest* request =\n            common::FileRequest::createDirectoryRequest(task.targetPath());\n        connect(request, &common::FileRequest::replyReady, this, &FileTransfer::targetReply);\n        targetRequest(request);\n    }\n    else\n    {\n        common::FileRequest* request =\n            common::FileRequest::FileRequest::downloadRequest(task.sourcePath());\n        connect(request, &common::FileRequest::replyReady, this, &FileTransfer::sourceReply);\n        sourceRequest(request);\n    }\n}\n\nvoid FileTransfer::processNextTask()\n{\n    if (is_canceled_)\n        tasks_.clear();\n\n    if (!tasks_.isEmpty())\n    {\n        \/\/ Delete the task only after confirmation of its successful execution.\n        tasks_.pop_front();\n    }\n\n    if (tasks_.isEmpty())\n    {\n        if (cancel_timer_id_)\n            killTimer(cancel_timer_id_);\n\n        emit finished();\n        return;\n    }\n\n    processTask(false);\n}\n\nvoid FileTransfer::processError(Error error_type, const QString& message)\n{\n    Action action = defaultAction(error_type);\n    if (action != Ask)\n    {\n        applyAction(error_type, action);\n        return;\n    }\n\n    emit error(this, error_type, message);\n}\n\nvoid FileTransfer::sourceRequest(common::FileRequest* request)\n{\n    if (type_ == Downloader)\n    {\n        emit remoteRequest(request);\n    }\n    else\n    {\n        DCHECK(type_ == Uploader);\n        emit localRequest(request);\n    }\n}\n\nvoid FileTransfer::targetRequest(common::FileRequest* request)\n{\n    if (type_ == Downloader)\n    {\n        emit localRequest(request);\n    }\n    else\n    {\n        DCHECK(type_ == Uploader);\n        emit remoteRequest(request);\n    }\n}\n\n} \/\/ namespace client\n<|endoftext|>"}
{"text":"<commit_before>#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n    int n, m, rurka;\n    static int min[300001];\n    \n    scanf(\"%d %d\", &n, &m);\n\n    int ostatni = n+1;\n    scanf(\"%d\", &min[0]); \/\/ min[0] = r[0];\n\n    \/\/minima\n    for(int i=1; i<n; i++)\n    {\n        scanf(\"%d\", &rurka);\n        min[i] = (min[i-1]<rurka ? min[i-1] : rurka);\n    }\n    \n    for(int j=0; j<m; j++) {\n        \n        int a = ostatni-1;\n        scanf(\"%d\", &rurka);\n        \n        if(rurka > min[0]) { ostatni = 0; break; }\n        \n        while(a >= 0 and (rurka > min[a])) a--; \n        ostatni = a;\n        \n        if(ostatni == 0) break;\n    }\n    \n    if(ostatni == 0) printf(\"0\\n\");\n    else printf(\"%d\\n\", ostatni+1);\n    \n    return 0;\n}\n\n\n<commit_msg>oi\/oi15_kra.cpp<commit_after>#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n    int n, m, rurka;\n    static int min[300001];\n    \n    scanf(\"%d %d\", &n, &m);\n\n    int ostatni = n+1;\n    scanf(\"%d\", &min[0]); \/\/ min[0] = r[0];\n\n    \/\/ min array\n    for(int i=1; i<n; i++) {\n        scanf(\"%d\", &rurka);\n        min[i] = (min[i-1]<rurka ? min[i-1] : rurka);\n    }\n    \n    for(int j=0; j<m; j++) {\n        \n        int a = ostatni-1;\n        scanf(\"%d\", &rurka);\n        \n        if(rurka > min[0]) { ostatni = 0; break; }\n        \n        while(a >= 0 and (rurka > min[a])) a--; \n        ostatni = a;\n        \n        if(ostatni == 0) break;\n    }\n    \n    if(ostatni == 0) printf(\"0\\n\");\n    else printf(\"%d\\n\", ostatni+1);\n    \n    return 0;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/--------------------------------------------------------------------*- C++ -*-\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Axel Naumann <axel@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 \"IncrementalJIT.h\"\n\n#include \"IncrementalExecutor.h\"\n\n#include \"llvm\/ExecutionEngine\/Orc\/LambdaResolver.h\"\n#include \"llvm\/Support\/DynamicLibrary.h\"\n\n#ifdef __APPLE__\n\/\/ Apple adds an extra '_'\n# define MANGLE_PREFIX \"_\"\n#else\n# define MANGLE_PREFIX \"\"\n#endif\n\nusing namespace llvm;\n\nnamespace {\n\/\/ Forward cxa_atexit for global d'tors.\nstatic void local_cxa_atexit(void (*func) (void*), void* arg, void* dso) {\n  cling::IncrementalExecutor* exe = (cling::IncrementalExecutor*)dso;\n  exe->AddAtExitFunc(func, arg);\n}\n\n\/\/\/\\brief Memory manager providing the lop-level link to the\n\/\/\/ IncrementalExecutor, handles missing or special \/ replaced symbols.\nclass ClingMemoryManager: public SectionMemoryManager {\n  cling::IncrementalExecutor& m_exe;\n\npublic:\n  ClingMemoryManager(cling::IncrementalExecutor& Exe):\n    m_exe(Exe) {}\n\n  \/\/\/\\brief Simply wraps the base class's function setting AbortOnFailure\n  \/\/\/ to false and instead using the error handling mechanism to report it.\n  void* getPointerToNamedFunction(const std::string &Name,\n                                  bool \/*AbortOnFailure*\/ =true) override {\n    return SectionMemoryManager::getPointerToNamedFunction(Name, false);\n  }\n};\n\n  class NotifyFinalizedT {\n  public:\n    NotifyFinalizedT(cling::IncrementalJIT &jit) : m_JIT(jit) {}\n    void operator()(llvm::orc::ObjectLinkingLayerBase::ObjSetHandleT H) {\n      m_JIT.RemoveUnfinalizedSection(H);\n    }\n\n  private:\n    cling::IncrementalJIT &m_JIT;\n  };\n\n} \/\/ unnamed namespace\n\nnamespace cling {\n\n\/\/\/\\brief Memory manager for the OrcJIT layers to resolve symbols from the\n\/\/\/ common IncrementalJIT. I.e. the master of the Orcs.\n\/\/\/ Each ObjectLayer instance has one Azog object.\nclass Azog: public RTDyldMemoryManager {\n  cling::IncrementalJIT& m_jit;\n\npublic:\n  Azog(cling::IncrementalJIT& Jit): m_jit(Jit) {}\n\n  RTDyldMemoryManager* getExeMM() const { return m_jit.m_ExeMM.get(); }\n\n  uint8_t *allocateCodeSection(uintptr_t Size, unsigned Alignment,\n                               unsigned SectionID,\n                               StringRef SectionName) override {\n    uint8_t *Addr =\n      getExeMM()->allocateCodeSection(Size, Alignment, SectionID, SectionName);\n    m_jit.m_SectionsAllocatedSinceLastLoad.insert(Addr);\n    return Addr;\n  }\n\n  uint8_t *allocateDataSection(uintptr_t Size, unsigned Alignment,\n                               unsigned SectionID, StringRef SectionName,\n                               bool IsReadOnly) override {\n    uint8_t *Addr = getExeMM()->allocateDataSection(Size, Alignment, SectionID,\n                                                    SectionName, IsReadOnly);\n    m_jit.m_SectionsAllocatedSinceLastLoad.insert(Addr);\n    return Addr;\n  }\n\n  void reserveAllocationSpace(uintptr_t CodeSize, uint32_t CodeAlign,\n                              uintptr_t RODataSize, uint32_t RODataAlign,\n                              uintptr_t RWDataSize, uint32_t RWDataAlign) override {\n    return getExeMM()->reserveAllocationSpace(CodeSize, CodeAlign, RODataSize,\n                                              RODataAlign, RWDataSize,\n                                              RWDataAlign);\n  }\n\n  bool needsToReserveAllocationSpace() override {\n    return getExeMM()->needsToReserveAllocationSpace();\n  }\n\n  void registerEHFrames(uint8_t *Addr, uint64_t LoadAddr,\n                        size_t Size) override {\n    return getExeMM()->registerEHFrames(Addr, LoadAddr, Size);\n  }\n\n  void deregisterEHFrames(uint8_t *Addr, uint64_t LoadAddr,\n                          size_t Size) override {\n    return getExeMM()->deregisterEHFrames(Addr, LoadAddr, Size);\n  }\n\n  uint64_t getSymbolAddress(const std::string &Name) override {\n    return m_jit.getSymbolAddressWithoutMangling(Name,\n                                                 true \/*also use dlsym*\/)\n      .getAddress();\n  }\n\n  void *getPointerToNamedFunction(const std::string &Name,\n                                  bool AbortOnFailure = true) override {\n    return getExeMM()->getPointerToNamedFunction(Name, AbortOnFailure);\n  }\n\n  using llvm::RuntimeDyld::MemoryManager::notifyObjectLoaded;\n\n  void notifyObjectLoaded(ExecutionEngine *EE,\n                          const object::ObjectFile &O) override {\n    return getExeMM()->notifyObjectLoaded(EE, O);\n  }\n\n  bool finalizeMemory(std::string *ErrMsg = nullptr) override {\n    \/\/ Each set of objects loaded will be finalized exactly once, but since\n    \/\/ symbol lookup during relocation may recursively trigger the\n    \/\/ loading\/relocation of other modules, and since we're forwarding all\n    \/\/ finalizeMemory calls to a single underlying memory manager, we need to\n    \/\/ defer forwarding the call on until all necessary objects have been\n    \/\/ loaded. Otherwise, during the relocation of a leaf object, we will end\n    \/\/ up finalizing memory, causing a crash further up the stack when we\n    \/\/ attempt to apply relocations to finalized memory.\n    \/\/ To avoid finalizing too early, look at how many objects have been\n    \/\/ loaded but not yet finalized. This is a bit of a hack that relies on\n    \/\/ the fact that we're lazily emitting object files: The only way you can\n    \/\/ get more than one set of objects loaded but not yet finalized is if\n    \/\/ they were loaded during relocation of another set.\n    if (m_jit.m_UnfinalizedSections.size() == 1)\n      return getExeMM()->finalizeMemory(ErrMsg);\n    return false;\n  };\n\n}; \/\/ class Azog\n\nIncrementalJIT::IncrementalJIT(IncrementalExecutor& exe,\n                               std::unique_ptr<TargetMachine> TM):\n  m_Parent(exe),\n  m_TM(std::move(TM)),\n  m_TMDataLayout(m_TM->createDataLayout()),\n  m_ExeMM(llvm::make_unique<ClingMemoryManager>(m_Parent)),\n  m_NotifyObjectLoaded(*this),\n  m_ObjectLayer(m_SymbolMap, m_NotifyObjectLoaded, NotifyFinalizedT(*this)),\n  m_CompileLayer(m_ObjectLayer, llvm::orc::SimpleCompiler(*m_TM)),\n  m_LazyEmitLayer(m_CompileLayer) {\n\n  \/\/ Enable JIT symbol resolution from the binary.\n  llvm::sys::DynamicLibrary::LoadLibraryPermanently(0, 0);\n\n  \/\/ Make debug symbols available.\n  m_GDBListener = 0; \/\/ JITEventListener::createGDBRegistrationListener();\n\n\/\/ #if MCJIT\n\/\/   llvm::EngineBuilder builder(std::move(m));\n\n\/\/   std::string errMsg;\n\/\/   builder.setErrorStr(&errMsg);\n\/\/   builder.setOptLevel(llvm::CodeGenOpt::Less);\n\/\/   builder.setEngineKind(llvm::EngineKind::JIT);\n\/\/   std::unique_ptr<llvm::RTDyldMemoryManager>\n\/\/     MemMan(new ClingMemoryManager(*this));\n\/\/   builder.setMCJITMemoryManager(std::move(MemMan));\n\n\/\/   \/\/ EngineBuilder uses default c'ted TargetOptions, too:\n\/\/   llvm::TargetOptions TargetOpts;\n\/\/   TargetOpts.NoFramePointerElim = 1;\n\/\/   TargetOpts.JITEmitDebugInfo = 1;\n\n\/\/   builder.setTargetOptions(TargetOpts);\n\n\/\/   m_engine.reset(builder.create());\n\/\/   assert(m_engine && \"Cannot create module!\");\n\/\/ #endif\n}\n\n\nllvm::orc::JITSymbol\nIncrementalJIT::getInjectedSymbols(llvm::StringRef Name) const {\n  using JITSymbol = llvm::orc::JITSymbol;\n  if (Name == MANGLE_PREFIX \"__cxa_atexit\") {\n    \/\/ Rewire __cxa_atexit to ~Interpreter(), thus also global destruction\n    \/\/ coming from the JIT.\n    return JITSymbol((uint64_t)&local_cxa_atexit,\n                     llvm::JITSymbolFlags::Exported);\n  } else if (Name == MANGLE_PREFIX \"__dso_handle\") {\n    \/\/ Provide IncrementalExecutor as the third argument to __cxa_atexit.\n    return JITSymbol((uint64_t)&m_Parent,\n                     llvm::JITSymbolFlags::Exported);\n  }\n\n  auto SymMapI = m_SymbolMap.find(Name);\n  if (SymMapI != m_SymbolMap.end())\n    return JITSymbol(SymMapI->second, llvm::JITSymbolFlags::Exported);\n\n  return JITSymbol(nullptr);\n}\n\nllvm::orc::JITSymbol\nIncrementalJIT::getSymbolAddressWithoutMangling(llvm::StringRef Name,\n                                                bool AlsoInProcess) {\n  if (auto Sym = getInjectedSymbols(Name))\n    return Sym;\n\n  if (AlsoInProcess) {\n    if (RuntimeDyld::SymbolInfo SymInfo = m_ExeMM->findSymbol(Name))\n      return llvm::orc::JITSymbol(SymInfo.getAddress(),\n                                  llvm::JITSymbolFlags::Exported);\n  }\n\n  if (auto Sym = m_LazyEmitLayer.findSymbol(Name, false))\n    return Sym;\n\n  return llvm::orc::JITSymbol(nullptr);\n}\n\nsize_t IncrementalJIT::addModules(std::vector<llvm::Module*>&& modules) {\n  \/\/ If this module doesn't have a DataLayout attached then attach the\n  \/\/ default.\n  for (auto&& mod: modules) {\n    mod->setDataLayout(m_TMDataLayout);\n  }\n\n  \/\/ LLVM MERGE FIXME: update this to use new interfaces.\n  auto Resolver = llvm::orc::createLambdaResolver(\n    [&](const std::string &S) {\n      if (auto Sym = getInjectedSymbols(S))\n        return RuntimeDyld::SymbolInfo((uint64_t)Sym.getAddress(),\n                                       Sym.getFlags());\n      return m_ExeMM->findSymbol(S);\n    },\n    [&](const std::string &Name) {\n      if (auto Sym = getSymbolAddressWithoutMangling(Name, true)\n          \/*was: findSymbol(Name)*\/)\n        return RuntimeDyld::SymbolInfo(Sym.getAddress(),\n                                       Sym.getFlags());\n\n\n      \/\/\/ This method returns the address of the specified function or variable\n      \/\/\/ that could not be resolved by getSymbolAddress() or by resolving\n      \/\/\/ possible weak symbols by the ExecutionEngine.\n      \/\/\/ It is used to resolve symbols during module linking.\n\n      std::string NameNoPrefix;\n      if (MANGLE_PREFIX[0]\n          && !Name.compare(0, strlen(MANGLE_PREFIX), MANGLE_PREFIX))\n        NameNoPrefix = Name.substr(strlen(MANGLE_PREFIX), -1);\n      else\n        NameNoPrefix = std::move(Name);\n      uint64_t addr\n        = (uint64_t) getParent().NotifyLazyFunctionCreators(NameNoPrefix);\n      return RuntimeDyld::SymbolInfo(addr, llvm::JITSymbolFlags::Weak);\n    });\n\n  ModuleSetHandleT MSHandle\n    = m_LazyEmitLayer.addModuleSet(std::move(modules),\n                                   llvm::make_unique<Azog>(*this),\n                                   std::move(Resolver));\n  m_UnloadPoints.push_back(MSHandle);\n  return m_UnloadPoints.size() - 1;\n}\n\n\/\/ void* IncrementalJIT::finalizeMemory() {\n\/\/   for (auto &P : UnfinalizedSections)\n\/\/     if (P.second.count(LocalAddress))\n\/\/       ObjectLayer.mapSectionAddress(P.first, LocalAddress, TargetAddress);\n\/\/ }\n\n\nvoid IncrementalJIT::removeModules(size_t handle) {\n  if (handle == (size_t)-1)\n    return;\n  auto objSetHandle = m_UnloadPoints[handle];\n  m_LazyEmitLayer.removeModuleSet(objSetHandle);\n}\n\n}\/\/ end namespace cling\n<commit_msg>Remove m_exe variable from ClingMemoryManager as it's not being used.<commit_after>\/\/--------------------------------------------------------------------*- C++ -*-\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Axel Naumann <axel@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 \"IncrementalJIT.h\"\n\n#include \"IncrementalExecutor.h\"\n\n#include \"llvm\/ExecutionEngine\/Orc\/LambdaResolver.h\"\n#include \"llvm\/Support\/DynamicLibrary.h\"\n\n#ifdef __APPLE__\n\/\/ Apple adds an extra '_'\n# define MANGLE_PREFIX \"_\"\n#else\n# define MANGLE_PREFIX \"\"\n#endif\n\nusing namespace llvm;\n\nnamespace {\n\/\/ Forward cxa_atexit for global d'tors.\nstatic void local_cxa_atexit(void (*func) (void*), void* arg, void* dso) {\n  cling::IncrementalExecutor* exe = (cling::IncrementalExecutor*)dso;\n  exe->AddAtExitFunc(func, arg);\n}\n\n\/\/\/\\brief Memory manager providing the lop-level link to the\n\/\/\/ IncrementalExecutor, handles missing or special \/ replaced symbols.\nclass ClingMemoryManager: public SectionMemoryManager {\npublic:\n  ClingMemoryManager(cling::IncrementalExecutor& Exe) {}\n\n  \/\/\/\\brief Simply wraps the base class's function setting AbortOnFailure\n  \/\/\/ to false and instead using the error handling mechanism to report it.\n  void* getPointerToNamedFunction(const std::string &Name,\n                                  bool \/*AbortOnFailure*\/ =true) override {\n    return SectionMemoryManager::getPointerToNamedFunction(Name, false);\n  }\n};\n\n  class NotifyFinalizedT {\n  public:\n    NotifyFinalizedT(cling::IncrementalJIT &jit) : m_JIT(jit) {}\n    void operator()(llvm::orc::ObjectLinkingLayerBase::ObjSetHandleT H) {\n      m_JIT.RemoveUnfinalizedSection(H);\n    }\n\n  private:\n    cling::IncrementalJIT &m_JIT;\n  };\n\n} \/\/ unnamed namespace\n\nnamespace cling {\n\n\/\/\/\\brief Memory manager for the OrcJIT layers to resolve symbols from the\n\/\/\/ common IncrementalJIT. I.e. the master of the Orcs.\n\/\/\/ Each ObjectLayer instance has one Azog object.\nclass Azog: public RTDyldMemoryManager {\n  cling::IncrementalJIT& m_jit;\n\npublic:\n  Azog(cling::IncrementalJIT& Jit): m_jit(Jit) {}\n\n  RTDyldMemoryManager* getExeMM() const { return m_jit.m_ExeMM.get(); }\n\n  uint8_t *allocateCodeSection(uintptr_t Size, unsigned Alignment,\n                               unsigned SectionID,\n                               StringRef SectionName) override {\n    uint8_t *Addr =\n      getExeMM()->allocateCodeSection(Size, Alignment, SectionID, SectionName);\n    m_jit.m_SectionsAllocatedSinceLastLoad.insert(Addr);\n    return Addr;\n  }\n\n  uint8_t *allocateDataSection(uintptr_t Size, unsigned Alignment,\n                               unsigned SectionID, StringRef SectionName,\n                               bool IsReadOnly) override {\n    uint8_t *Addr = getExeMM()->allocateDataSection(Size, Alignment, SectionID,\n                                                    SectionName, IsReadOnly);\n    m_jit.m_SectionsAllocatedSinceLastLoad.insert(Addr);\n    return Addr;\n  }\n\n  void reserveAllocationSpace(uintptr_t CodeSize, uint32_t CodeAlign,\n                              uintptr_t RODataSize, uint32_t RODataAlign,\n                              uintptr_t RWDataSize, uint32_t RWDataAlign) override {\n    return getExeMM()->reserveAllocationSpace(CodeSize, CodeAlign, RODataSize,\n                                              RODataAlign, RWDataSize,\n                                              RWDataAlign);\n  }\n\n  bool needsToReserveAllocationSpace() override {\n    return getExeMM()->needsToReserveAllocationSpace();\n  }\n\n  void registerEHFrames(uint8_t *Addr, uint64_t LoadAddr,\n                        size_t Size) override {\n    return getExeMM()->registerEHFrames(Addr, LoadAddr, Size);\n  }\n\n  void deregisterEHFrames(uint8_t *Addr, uint64_t LoadAddr,\n                          size_t Size) override {\n    return getExeMM()->deregisterEHFrames(Addr, LoadAddr, Size);\n  }\n\n  uint64_t getSymbolAddress(const std::string &Name) override {\n    return m_jit.getSymbolAddressWithoutMangling(Name,\n                                                 true \/*also use dlsym*\/)\n      .getAddress();\n  }\n\n  void *getPointerToNamedFunction(const std::string &Name,\n                                  bool AbortOnFailure = true) override {\n    return getExeMM()->getPointerToNamedFunction(Name, AbortOnFailure);\n  }\n\n  using llvm::RuntimeDyld::MemoryManager::notifyObjectLoaded;\n\n  void notifyObjectLoaded(ExecutionEngine *EE,\n                          const object::ObjectFile &O) override {\n    return getExeMM()->notifyObjectLoaded(EE, O);\n  }\n\n  bool finalizeMemory(std::string *ErrMsg = nullptr) override {\n    \/\/ Each set of objects loaded will be finalized exactly once, but since\n    \/\/ symbol lookup during relocation may recursively trigger the\n    \/\/ loading\/relocation of other modules, and since we're forwarding all\n    \/\/ finalizeMemory calls to a single underlying memory manager, we need to\n    \/\/ defer forwarding the call on until all necessary objects have been\n    \/\/ loaded. Otherwise, during the relocation of a leaf object, we will end\n    \/\/ up finalizing memory, causing a crash further up the stack when we\n    \/\/ attempt to apply relocations to finalized memory.\n    \/\/ To avoid finalizing too early, look at how many objects have been\n    \/\/ loaded but not yet finalized. This is a bit of a hack that relies on\n    \/\/ the fact that we're lazily emitting object files: The only way you can\n    \/\/ get more than one set of objects loaded but not yet finalized is if\n    \/\/ they were loaded during relocation of another set.\n    if (m_jit.m_UnfinalizedSections.size() == 1)\n      return getExeMM()->finalizeMemory(ErrMsg);\n    return false;\n  };\n\n}; \/\/ class Azog\n\nIncrementalJIT::IncrementalJIT(IncrementalExecutor& exe,\n                               std::unique_ptr<TargetMachine> TM):\n  m_Parent(exe),\n  m_TM(std::move(TM)),\n  m_TMDataLayout(m_TM->createDataLayout()),\n  m_ExeMM(llvm::make_unique<ClingMemoryManager>(m_Parent)),\n  m_NotifyObjectLoaded(*this),\n  m_ObjectLayer(m_SymbolMap, m_NotifyObjectLoaded, NotifyFinalizedT(*this)),\n  m_CompileLayer(m_ObjectLayer, llvm::orc::SimpleCompiler(*m_TM)),\n  m_LazyEmitLayer(m_CompileLayer) {\n\n  \/\/ Enable JIT symbol resolution from the binary.\n  llvm::sys::DynamicLibrary::LoadLibraryPermanently(0, 0);\n\n  \/\/ Make debug symbols available.\n  m_GDBListener = 0; \/\/ JITEventListener::createGDBRegistrationListener();\n\n\/\/ #if MCJIT\n\/\/   llvm::EngineBuilder builder(std::move(m));\n\n\/\/   std::string errMsg;\n\/\/   builder.setErrorStr(&errMsg);\n\/\/   builder.setOptLevel(llvm::CodeGenOpt::Less);\n\/\/   builder.setEngineKind(llvm::EngineKind::JIT);\n\/\/   std::unique_ptr<llvm::RTDyldMemoryManager>\n\/\/     MemMan(new ClingMemoryManager(*this));\n\/\/   builder.setMCJITMemoryManager(std::move(MemMan));\n\n\/\/   \/\/ EngineBuilder uses default c'ted TargetOptions, too:\n\/\/   llvm::TargetOptions TargetOpts;\n\/\/   TargetOpts.NoFramePointerElim = 1;\n\/\/   TargetOpts.JITEmitDebugInfo = 1;\n\n\/\/   builder.setTargetOptions(TargetOpts);\n\n\/\/   m_engine.reset(builder.create());\n\/\/   assert(m_engine && \"Cannot create module!\");\n\/\/ #endif\n}\n\n\nllvm::orc::JITSymbol\nIncrementalJIT::getInjectedSymbols(llvm::StringRef Name) const {\n  using JITSymbol = llvm::orc::JITSymbol;\n  if (Name == MANGLE_PREFIX \"__cxa_atexit\") {\n    \/\/ Rewire __cxa_atexit to ~Interpreter(), thus also global destruction\n    \/\/ coming from the JIT.\n    return JITSymbol((uint64_t)&local_cxa_atexit,\n                     llvm::JITSymbolFlags::Exported);\n  } else if (Name == MANGLE_PREFIX \"__dso_handle\") {\n    \/\/ Provide IncrementalExecutor as the third argument to __cxa_atexit.\n    return JITSymbol((uint64_t)&m_Parent,\n                     llvm::JITSymbolFlags::Exported);\n  }\n\n  auto SymMapI = m_SymbolMap.find(Name);\n  if (SymMapI != m_SymbolMap.end())\n    return JITSymbol(SymMapI->second, llvm::JITSymbolFlags::Exported);\n\n  return JITSymbol(nullptr);\n}\n\nllvm::orc::JITSymbol\nIncrementalJIT::getSymbolAddressWithoutMangling(llvm::StringRef Name,\n                                                bool AlsoInProcess) {\n  if (auto Sym = getInjectedSymbols(Name))\n    return Sym;\n\n  if (AlsoInProcess) {\n    if (RuntimeDyld::SymbolInfo SymInfo = m_ExeMM->findSymbol(Name))\n      return llvm::orc::JITSymbol(SymInfo.getAddress(),\n                                  llvm::JITSymbolFlags::Exported);\n  }\n\n  if (auto Sym = m_LazyEmitLayer.findSymbol(Name, false))\n    return Sym;\n\n  return llvm::orc::JITSymbol(nullptr);\n}\n\nsize_t IncrementalJIT::addModules(std::vector<llvm::Module*>&& modules) {\n  \/\/ If this module doesn't have a DataLayout attached then attach the\n  \/\/ default.\n  for (auto&& mod: modules) {\n    mod->setDataLayout(m_TMDataLayout);\n  }\n\n  \/\/ LLVM MERGE FIXME: update this to use new interfaces.\n  auto Resolver = llvm::orc::createLambdaResolver(\n    [&](const std::string &S) {\n      if (auto Sym = getInjectedSymbols(S))\n        return RuntimeDyld::SymbolInfo((uint64_t)Sym.getAddress(),\n                                       Sym.getFlags());\n      return m_ExeMM->findSymbol(S);\n    },\n    [&](const std::string &Name) {\n      if (auto Sym = getSymbolAddressWithoutMangling(Name, true)\n          \/*was: findSymbol(Name)*\/)\n        return RuntimeDyld::SymbolInfo(Sym.getAddress(),\n                                       Sym.getFlags());\n\n\n      \/\/\/ This method returns the address of the specified function or variable\n      \/\/\/ that could not be resolved by getSymbolAddress() or by resolving\n      \/\/\/ possible weak symbols by the ExecutionEngine.\n      \/\/\/ It is used to resolve symbols during module linking.\n\n      std::string NameNoPrefix;\n      if (MANGLE_PREFIX[0]\n          && !Name.compare(0, strlen(MANGLE_PREFIX), MANGLE_PREFIX))\n        NameNoPrefix = Name.substr(strlen(MANGLE_PREFIX), -1);\n      else\n        NameNoPrefix = std::move(Name);\n      uint64_t addr\n        = (uint64_t) getParent().NotifyLazyFunctionCreators(NameNoPrefix);\n      return RuntimeDyld::SymbolInfo(addr, llvm::JITSymbolFlags::Weak);\n    });\n\n  ModuleSetHandleT MSHandle\n    = m_LazyEmitLayer.addModuleSet(std::move(modules),\n                                   llvm::make_unique<Azog>(*this),\n                                   std::move(Resolver));\n  m_UnloadPoints.push_back(MSHandle);\n  return m_UnloadPoints.size() - 1;\n}\n\n\/\/ void* IncrementalJIT::finalizeMemory() {\n\/\/   for (auto &P : UnfinalizedSections)\n\/\/     if (P.second.count(LocalAddress))\n\/\/       ObjectLayer.mapSectionAddress(P.first, LocalAddress, TargetAddress);\n\/\/ }\n\n\nvoid IncrementalJIT::removeModules(size_t handle) {\n  if (handle == (size_t)-1)\n    return;\n  auto objSetHandle = m_UnloadPoints[handle];\n  m_LazyEmitLayer.removeModuleSet(objSetHandle);\n}\n\n}\/\/ end namespace cling\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2016 PaddlePaddle 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#include \"paddle\/fluid\/framework\/parallel_executor.h\"\n\n#include \"ThreadPool.h\"\n\n#ifdef PADDLE_WITH_CUDA\n#include \"paddle\/fluid\/platform\/nccl_helper.h\"\n#endif\n\n#include \"paddle\/fluid\/framework\/details\/multi_devices_graph_builder.h\"\n#include \"paddle\/fluid\/framework\/details\/threaded_ssa_graph_executor.h\"\n\nnamespace paddle {\nnamespace framework {\n\nclass ParallelExecutorPrivate {\n public:\n  explicit ParallelExecutorPrivate(const std::vector<platform::Place> &places)\n      : places_(places) {}\n\n  std::vector<platform::Place> places_;\n  std::vector<Scope *> local_scopes_;\n  Scope *global_scope_;\n  std::unique_ptr<details::SSAGraphExecutor> executor_;\n\n#ifdef PADDLE_WITH_CUDA\n  std::unique_ptr<platform::NCCLContextMap> nccl_ctxs_;\n#endif\n};\n\nParallelExecutor::ParallelExecutor(\n    size_t num_threads, bool use_event,\n    const std::vector<platform::Place> &places,\n    const std::unordered_set<std::string> &params,\n    const ProgramDesc &startup_program, const ProgramDesc &main_program,\n    const std::string &loss_var_name, Scope *scope)\n    : member_(new ParallelExecutorPrivate(places)) {\n  member_->global_scope_ = scope;\n\n  \/\/ Step 1. RunStartupProgram and Bcast the params to devs.\n  Executor exe(places[0]);\n  exe.Run(startup_program, scope, 0);\n  \/\/ Create local scopes\n  for (size_t i = 0; i < member_->places_.size(); ++i) {\n    member_->local_scopes_.push_back(&scope->NewScope());\n  }\n\n\/\/ Bcast Parameters to all GPUs\n#ifdef PADDLE_WITH_CUDA\n  member_->nccl_ctxs_.reset(new platform::NCCLContextMap(member_->places_));\n#endif\n  if (platform::is_gpu_place(places[0]) &&\n      member_->local_scopes_.size() != 1) {  \/\/ Is CUDA\n    BCastParamsToGPUs(startup_program);\n  }\n\/\/ Startup Program has been run. All local scopes has correct parameters.\n\n\/\/ Step 2. Convert main_program to SSA form and dependency graph. Also, insert\n\/\/ ncclOp\n#ifdef PADDLE_WITH_CUDA\n  details::MultiDevSSAGraphBuilder builder(member_->places_, loss_var_name,\n                                           params, member_->local_scopes_,\n                                           member_->nccl_ctxs_.get());\n#else\n  details::MultiDevSSAGraphBuilder builder(member_->places_, loss_var_name,\n                                           params, member_->local_scopes_);\n#endif\n  auto graph = builder.Build(main_program);\n\n  member_->executor_.reset(new details::ThreadedSSAGraphExecutor(\n      num_threads, use_event, member_->local_scopes_, places,\n      std::move(graph)));\n\n  \/\/ Step 3. Create vars in each scope;\n  for (auto *scope : member_->local_scopes_) {\n    for (auto *var : main_program.Block(0).AllVars()) {\n      if (scope->FindVar(var->Name()) != nullptr) {\n        continue;\n      }\n\n      InitializeVariable(scope->Var(var->Name()), var->GetType());\n    }\n  }\n}\n\nvoid ParallelExecutor::BCastParamsToGPUs(\n    const ProgramDesc &startup_program) const {\n#ifdef PADDLE_WITH_CUDA\n  auto *main_scope = member_->local_scopes_[0];\n\n  for (auto *var_desc : startup_program.Block(0).AllVars()) {\n    if (var_desc->GetType() == proto::VarType::LOD_TENSOR) {\n      auto &main_tensor =\n          main_scope->FindVar(var_desc->Name())->Get<LoDTensor>();\n      ncclDataType_t data_type = platform::ToNCCLDataType(main_tensor.type());\n      auto &dims = main_tensor.dims();\n      size_t numel = main_tensor.numel();\n\n      platform::NCCLGroupGuard guard;\n\n      for (size_t i = 0; i < member_->places_.size(); ++i) {\n        auto place = member_->places_[i];\n        void *buffer;\n        if (i == 0) {\n          buffer = const_cast<void *>(main_tensor.data<void>());\n        } else {\n          auto local_scope = member_->local_scopes_[i];\n          auto *t = local_scope->Var(var_desc->Name())->GetMutable<LoDTensor>();\n          t->Resize(dims);\n          buffer = t->mutable_data(place, main_tensor.type());\n        }\n\n        auto &nccl_ctx = member_->nccl_ctxs_->at(place);\n        platform::dynload::ncclBcast(buffer, numel, data_type, 0,\n                                     nccl_ctx.comm_, nccl_ctx.stream());\n      }\n    }\n    member_->nccl_ctxs_->WaitAll();\n  }\n#else\n  PADDLE_THROW(\"Not compiled with CUDA\");\n#endif\n}\n\nvoid ParallelExecutor::Run(const std::vector<std::string> &fetch_tensors,\n                           const std::string &fetched_var_name) {\n  auto fetch_data = member_->executor_->Run(fetch_tensors);\n  *member_->global_scope_->Var(fetched_var_name)->GetMutable<FeedFetchList>() =\n      fetch_data;\n}\n\n}  \/\/ namespace framework\n}  \/\/ namespace paddle\n<commit_msg>refine parallel<commit_after>\/* Copyright (c) 2016 PaddlePaddle 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#include \"paddle\/fluid\/framework\/parallel_executor.h\"\n#include <string>\n\n#include \"ThreadPool.h\"\n\n#ifdef PADDLE_WITH_CUDA\n#include \"paddle\/fluid\/platform\/nccl_helper.h\"\n#endif\n\n#include \"paddle\/fluid\/framework\/details\/multi_devices_graph_builder.h\"\n#include \"paddle\/fluid\/framework\/details\/threaded_ssa_graph_executor.h\"\n\nnamespace paddle {\nnamespace framework {\n\nclass ParallelExecutorPrivate {\n public:\n  explicit ParallelExecutorPrivate(const std::vector<platform::Place> &places)\n      : places_(places) {}\n\n  std::vector<platform::Place> places_;\n  std::vector<Scope *> local_scopes_;\n  Scope *global_scope_;\n  std::unique_ptr<details::SSAGraphExecutor> executor_;\n\n#ifdef PADDLE_WITH_CUDA\n  std::unique_ptr<platform::NCCLContextMap> nccl_ctxs_;\n#endif\n};\n\nParallelExecutor::ParallelExecutor(\n    size_t num_threads, bool use_event,\n    const std::vector<platform::Place> &places,\n    const std::unordered_set<std::string> &params,\n    const ProgramDesc &startup_program, const ProgramDesc &main_program,\n    const std::string &loss_var_name, Scope *scope)\n    : member_(new ParallelExecutorPrivate(places)) {\n  member_->global_scope_ = scope;\n\n  \/\/ Step 1. RunStartupProgram and Bcast the params to devs.\n  Executor exe(places[0]);\n  exe.Run(startup_program, scope, 0);\n  \/\/ Create local scopes\n  for (size_t i = 0; i < member_->places_.size(); ++i) {\n    member_->local_scopes_.push_back(&scope->NewScope());\n  }\n\n\/\/ Bcast Parameters to all GPUs\n#ifdef PADDLE_WITH_CUDA\n  member_->nccl_ctxs_.reset(new platform::NCCLContextMap(member_->places_));\n#endif\n  if (platform::is_gpu_place(places[0]) &&\n      member_->local_scopes_.size() != 1) {  \/\/ Is CUDA\n    BCastParamsToGPUs(startup_program);\n  }\n\/\/ Startup Program has been run. All local scopes has correct parameters.\n\n\/\/ Step 2. Convert main_program to SSA form and dependency graph. Also, insert\n\/\/ ncclOp\n#ifdef PADDLE_WITH_CUDA\n  details::MultiDevSSAGraphBuilder builder(member_->places_, loss_var_name,\n                                           params, member_->local_scopes_,\n                                           member_->nccl_ctxs_.get());\n#else\n  details::MultiDevSSAGraphBuilder builder(member_->places_, loss_var_name,\n                                           params, member_->local_scopes_);\n#endif\n  auto graph = builder.Build(main_program);\n\n  member_->executor_.reset(new details::ThreadedSSAGraphExecutor(\n      num_threads, use_event, member_->local_scopes_, places,\n      std::move(graph)));\n\n  \/\/ Step 3. Create vars in each scope;\n  for (auto *scope : member_->local_scopes_) {\n    for (auto *var : main_program.Block(0).AllVars()) {\n      if (scope->FindVar(var->Name()) != nullptr) {\n        continue;\n      }\n\n      InitializeVariable(scope->Var(var->Name()), var->GetType());\n    }\n  }\n}\n\nvoid ParallelExecutor::BCastParamsToGPUs(\n    const ProgramDesc &startup_program) const {\n#ifdef PADDLE_WITH_CUDA\n  auto *main_scope = member_->local_scopes_[0];\n\n  for (auto *var_desc : startup_program.Block(0).AllVars()) {\n    size_t idx = var_desc->Name().find(\"@GRAD\");\n    if (idx != std::string::npos) continue;\n    if (var_desc->GetType() == proto::VarType::LOD_TENSOR) {\n      auto &main_tensor =\n          main_scope->FindVar(var_desc->Name())->Get<LoDTensor>();\n\n      auto &dims = main_tensor.dims();\n\n      if (paddle::platform::is_gpu_place(main_tensor.place())) {\n        size_t numel = main_tensor.numel();\n        ncclDataType_t data_type = platform::ToNCCLDataType(main_tensor.type());\n        platform::NCCLGroupGuard guard;\n        for (size_t i = 0; i < member_->places_.size(); ++i) {\n          auto place = member_->places_[i];\n          void *buffer;\n          if (i == 0) {\n            buffer = const_cast<void *>(main_tensor.data<void>());\n          } else {\n            auto local_scope = member_->local_scopes_[i];\n            auto *t =\n                local_scope->Var(var_desc->Name())->GetMutable<LoDTensor>();\n            t->Resize(dims);\n            buffer = t->mutable_data(place, main_tensor.type());\n          }\n          auto &nccl_ctx = member_->nccl_ctxs_->at(place);\n          platform::dynload::ncclBcast(buffer, numel, data_type, 0,\n                                       nccl_ctx.comm_, nccl_ctx.stream());\n        }\n      } else {\n        platform::CPUPlace cpu;\n        for (size_t i = 1; i < member_->places_.size(); ++i) {\n          auto local_scope = member_->local_scopes_[i];\n          auto *t = local_scope->Var(var_desc->Name())->GetMutable<LoDTensor>();\n          t->Resize(dims);\n          t->mutable_data(cpu, main_tensor.type());\n          paddle::framework::TensorCopy(main_tensor, cpu, t);\n        }\n      }\n    }\n    member_->nccl_ctxs_->WaitAll();\n  }\n#else\n  PADDLE_THROW(\"Not compiled with CUDA\");\n#endif\n}\n\nvoid ParallelExecutor::Run(const std::vector<std::string> &fetch_tensors,\n                           const std::string &fetched_var_name) {\n  auto fetch_data = member_->executor_->Run(fetch_tensors);\n  *member_->global_scope_->Var(fetched_var_name)->GetMutable<FeedFetchList>() =\n      fetch_data;\n}\n\n}  \/\/ namespace framework\n}  \/\/ namespace paddle\n<|endoftext|>"}
{"text":"<commit_before>#include <map>\n\n#include \"EventAnalysis.h\"\n\n\/\/================================================================================\n\/\/ MATHEMATICAL AND ADDITIONAL FUNCTIONS\n\/\/================================================================================\n\n\/\/ struct used for sorting vectors of hits (functor)\n\nstruct EntityComp {\n\n  string property;\n  EntityComp(string property) {this->property = property;}\n  bool operator()(const Hit& h1, const Hit& h2) const {\n    bool val = false;\n    if(property == \"TIME\")\n      val = h1.time < h2.time;\n    else if (property == \"EDEP\")\n      val = h1.edep < h2.edep;\n    else if (property == \"EVENTID\")\n      val = h1.eventID < h2.eventID;\n    return val;\n  }\n\n};\n\nvoid sort_hits(vector<Hit> &hits, string key) {\n\n  sort(hits.begin(), hits.end(), EntityComp(key));\n\n}\n\nHit add_hits(Hit &h1, Hit &h2, string winner=\"centroidWinner\") {\n  Hit h;\n  h.eventID = h1.eventID;\n  h.volumeID = h1.volumeID;\n  h.trackID = h1.trackID;\n  h.parentID = h1.parentID;\n  h.primaryID = h1.primaryID;\n  h.time = min(h1.time, h2.time);\n  h.edep = h1.edep + h2.edep;\n  if (winner == \"centroidWinner\") {\n    h.posX = (h1.posX+h2.posX)\/2.;\n    h.posY = (h1.posY+h2.posY)\/2.;\n    h.posZ = (h1.posZ+h2.posZ)\/2.;\n  }\n  else if (winner == \"energyWinner\") {\n    if (h1.edep>=h2.edep) {\n      h.posX = h1.posX;\n      h.posY = h1.posY;\n      h.posZ = h1.posZ;\n    }\n    else {\n      h.posX = h2.posX;\n      h.posY = h2.posY;\n      h.posZ = h2.posZ;\n    }\n  }\n  h.sourcePosX = h1.sourcePosX;\n  h.sourcePosY = h1.sourcePosY;\n  h.sourcePosZ = h1.sourcePosZ;\n  h.nPhantomCompton = h1.nPhantomCompton;\n  h.nCrystalCompton = h1.nCrystalCompton;\n  return h;\n}\n\n\n\/\/================================================================================\n\/\/ DEFINITIONS OF CLASS FUNCTIONS - BASIC ANALYSIS\n\/\/================================================================================\n\nEventAnalysis::EventAnalysis() {\n\n  coincident_hits.clear();\n  N0 = 0;\n  N = 0;\n\n}\n\nvoid EventAnalysis::select_coincident_hits(vector<Hit> &hits) {\n\n  N0 = hits.size();\n  double COMPTON_E_TH = atof(getenv(\"GOJA_COMPTON_E_TH\"))*1e3;\n  for (unsigned int i=0; i<hits.size(); i++) {\n    if (hits[i].edep>COMPTON_E_TH) coincident_hits.push_back(hits[i]);\n  }\n  N = coincident_hits.size();\n\n}\n\nvoid EventAnalysis::select_coincident_singles(vector<Hit> &hits) {\n\n  if (DEBUG) {\n    cout << \"Hits:\" << endl;\n    for (unsigned int i=0; i<hits.size(); i++) {\n      cout << '\\t' << hits[i].volumeID << endl;\n    }\n    cout << '\\t' << \"# hits: \" << hits.size() << endl;\n  }\n\n  map<int, Hit> singles;\n  for (unsigned int i=0; i<hits.size(); i++) {\n    int volumeID = hits[i].volumeID;\n    if (singles.find(volumeID) == singles.end() ) {\n      singles[volumeID] = hits[i];\n    } else {\n      singles[volumeID] = add_hits(singles[volumeID], hits[i]);\n    }\n  }\n  N0 = singles.size();\n\n  if (DEBUG) {\n    cout << \"Singles:\" << endl;\n    map<int, Hit>::iterator it = singles.begin();\n    while(it != singles.end()) {\n      cout << '\\t' << it->first << endl;\n      it++;\n    }\n    cout << '\\t' << \"# singles: \" << singles.size() << endl;\n  }\n\n  double COMPTON_E_TH = atof(getenv(\"GOJA_COMPTON_E_TH\"))*1e3;\n  for (unsigned int i=0; i<singles.size(); i++) {\n    if (singles[i].edep>COMPTON_E_TH) coincident_hits.push_back(singles[i]);\n  }\n  N = coincident_hits.size();\n}\n\nEventType EventAnalysis::verify_type_of_coincidence(Hit &h1, Hit &h2) {\n\n  EventType t = kUnspecified;\n\n  if (h1.eventID==h2.eventID) { \/\/true, phantom-scattered and detector-scattered\n    if (h1.nPhantomCompton==0 and h2.nPhantomCompton==0) {\n      if (h1.nCrystalCompton==1 and h2.nCrystalCompton==1) { \/\/true\n        t = kTrue;\n      }\n      else { \/\/detector-scattered\n        t = kDetectorScattered;\n      }\n    }\n    else { \/\/phantom-scattered\n      t = kPhantomScattered;\n    }\n  }\n  else { \/\/accidental\n    t = kAccidental;\n  }\n\n  return t;\n\n}\n\n\/\/================================================================================\n\/\/ PRINTING\n\/\/================================================================================\n\nvoid EventAnalysis::print_coincidences() {\n\n  cout.setf(ios::fixed);\n\n  Hit h1 = coincident_hits[0];\n  Hit h2 = coincident_hits[1];\n\n  cout.precision(2);\n  cout << h1.posX\/10. << \"\\t\" << h1.posY\/10. << \"\\t\" << h1.posZ\/10. << \"\\t\";\n  cout.precision(1);\n  cout << h1.time << \"\\t\";\n\n  cout.precision(2);\n  cout << h2.posX\/10. << \"\\t\" << h2.posY\/10. << \"\\t\" << h2.posZ\/10. << \"\\t\";\n  cout.precision(1);\n  cout << h2.time << \"\\t\";\n\n  cout << h1.volumeID << \"\\t\";\n  cout << h2.volumeID << \"\\t\";\n\n  cout.precision(2);\n  cout << h1.edep << \"\\t\";\n  cout << h2.edep << \"\\t\";\n\n  cout << verify_type_of_coincidence(h1, h2) << \"\\t\";\n\n  cout.precision(2);\n  cout << h1.sourcePosX\/10. << \"\\t\" << h1.sourcePosY\/10. << \"\\t\" << h1.sourcePosZ\/10. << \"\\t\";\n  cout << h2.sourcePosX\/10. << \"\\t\" << h2.sourcePosY\/10. << \"\\t\" << h2.sourcePosZ\/10. << endl;\n\n}\n\n\/\/================================================================================\n\/\/ MAIN ANALYSIS FUNCTION\n\/\/================================================================================\n\nvoid EventAnalysis::analyze_event(vector<Hit> &hits, bool singles)\n{\n\n  int MAX_N = int(atof(getenv(\"GOJA_MAX_N\")));\n  int MAX_N0 = int(atof(getenv(\"GOJA_MAX_N0\")));\n\n  sort_hits(hits, \"TIME\");\n\n  if (singles) {\n    select_coincident_singles(hits);\n  }\n  else {\n    select_coincident_hits(hits);\n  }\n\n  if (N==MAX_N and N0<=MAX_N0) print_coincidences();\n\n  if (DEBUG) {\n    cout.setf(ios::fixed);\n    cout.precision(1);\n    for (unsigned int i=0; i<hits.size(); i++) {\n      double t = hits[i].time;\n      if (i==0) cout << endl;\n      cout.precision(1);\n      cout << t << \"\\t\";\n      cout.precision(2);\n      cout << hits[i].edep;\n      if (i>0) {\n        cout.precision(1);\n        cout << \"\\t\" << (hits[i].time-hits[i-1].time);\n      }\n      if (i==(hits.size()-1)) {\n        cout.precision(1);\n        cout << \"\\t\" << (hits[i].time-hits[0].time) << endl;\n        cout << N << \"\\t\" << N0 << endl;\n      }\n      cout << endl;\n    }\n  }\n\n}\n<commit_msg>Adjust select_coincident_singles function to cylindricalPET systemType<commit_after>#include <map>\n#include <string>\n#include <sstream>\n\n#include \"EventAnalysis.h\"\n\n\/\/================================================================================\n\/\/ MATHEMATICAL AND ADDITIONAL FUNCTIONS\n\/\/================================================================================\n\n\/\/ struct used for sorting vectors of hits (functor)\n\nstruct EntityComp {\n\n  string property;\n  EntityComp(string property) {this->property = property;}\n  bool operator()(const Hit& h1, const Hit& h2) const {\n    bool val = false;\n    if(property == \"TIME\")\n      val = h1.time < h2.time;\n    else if (property == \"EDEP\")\n      val = h1.edep < h2.edep;\n    else if (property == \"EVENTID\")\n      val = h1.eventID < h2.eventID;\n    return val;\n  }\n\n};\n\nvoid sort_hits(vector<Hit> &hits, string key) {\n\n  sort(hits.begin(), hits.end(), EntityComp(key));\n\n}\n\nHit add_hits(Hit &h1, Hit &h2, string winner=\"centroidWinner\") {\n  Hit h;\n  h.eventID = h1.eventID;\n  h.volumeID = h1.volumeID;\n  h.trackID = h1.trackID;\n  h.parentID = h1.parentID;\n  h.primaryID = h1.primaryID;\n  h.time = min(h1.time, h2.time);\n  h.edep = h1.edep + h2.edep;\n  if (winner == \"centroidWinner\") {\n    h.posX = (h1.posX+h2.posX)\/2.;\n    h.posY = (h1.posY+h2.posY)\/2.;\n    h.posZ = (h1.posZ+h2.posZ)\/2.;\n  }\n  else if (winner == \"energyWinner\") {\n    if (h1.edep>=h2.edep) {\n      h.posX = h1.posX;\n      h.posY = h1.posY;\n      h.posZ = h1.posZ;\n    }\n    else {\n      h.posX = h2.posX;\n      h.posY = h2.posY;\n      h.posZ = h2.posZ;\n    }\n  }\n  h.sourcePosX = h1.sourcePosX;\n  h.sourcePosY = h1.sourcePosY;\n  h.sourcePosZ = h1.sourcePosZ;\n  h.nPhantomCompton = h1.nPhantomCompton;\n  h.nCrystalCompton = h1.nCrystalCompton;\n  return h;\n}\n\n\n\/\/================================================================================\n\/\/ DEFINITIONS OF CLASS FUNCTIONS - BASIC ANALYSIS\n\/\/================================================================================\n\nEventAnalysis::EventAnalysis() {\n\n  coincident_hits.clear();\n  N0 = 0;\n  N = 0;\n\n}\n\nvoid EventAnalysis::select_coincident_hits(vector<Hit> &hits) {\n\n  N0 = hits.size();\n  double COMPTON_E_TH = atof(getenv(\"GOJA_COMPTON_E_TH\"))*1e3;\n  for (unsigned int i=0; i<hits.size(); i++) {\n    if (hits[i].edep>COMPTON_E_TH) coincident_hits.push_back(hits[i]);\n  }\n  N = coincident_hits.size();\n\n}\n\nvoid EventAnalysis::select_coincident_singles(vector<Hit> &hits) {\n\n  map<string, Hit> singles;\n  for (unsigned int i=0; i<hits.size(); i++) {\n    stringstream IDss;\n    string systemType = string(getenv(\"GOJA_SYSTEM_TYPE\"));\n    if (systemType == \"scanner\")\n      IDss << hits[i].volumeID;\n    else if (systemType == \"cylindricalPET\")\n      IDss << hits[i].rsectorID << '_' << hits[i].layerID;\n    string ID = IDss.str();\n    if (singles.find(ID) == singles.end() ) {\n      singles[ID] = hits[i];\n    } else {\n      singles[ID] = add_hits(singles[ID], hits[i]);\n    }\n  }\n  N0 = singles.size();\n\n  double COMPTON_E_TH = atof(getenv(\"GOJA_COMPTON_E_TH\"))*1e3;\n  map<string, Hit>::iterator it = singles.begin();\n  while(it != singles.end()) {\n    if ((it->second).edep>COMPTON_E_TH) coincident_hits.push_back(it->second);\n    it++;\n  }\n  N = coincident_hits.size();\n\n}\n\nEventType EventAnalysis::verify_type_of_coincidence(Hit &h1, Hit &h2) {\n\n  EventType t = kUnspecified;\n\n  if (h1.eventID==h2.eventID) { \/\/true, phantom-scattered and detector-scattered\n    if (h1.nPhantomCompton==0 and h2.nPhantomCompton==0) {\n      if (h1.nCrystalCompton==1 and h2.nCrystalCompton==1) { \/\/true\n        t = kTrue;\n      }\n      else { \/\/detector-scattered\n        t = kDetectorScattered;\n      }\n    }\n    else { \/\/phantom-scattered\n      t = kPhantomScattered;\n    }\n  }\n  else { \/\/accidental\n    t = kAccidental;\n  }\n\n  return t;\n\n}\n\n\/\/================================================================================\n\/\/ PRINTING\n\/\/================================================================================\n\nvoid EventAnalysis::print_coincidences() {\n\n  cout.setf(ios::fixed);\n\n  Hit h1 = coincident_hits[0];\n  Hit h2 = coincident_hits[1];\n\n  cout.precision(2);\n  cout << h1.posX\/10. << \"\\t\" << h1.posY\/10. << \"\\t\" << h1.posZ\/10. << \"\\t\";\n  cout.precision(1);\n  cout << h1.time << \"\\t\";\n\n  cout.precision(2);\n  cout << h2.posX\/10. << \"\\t\" << h2.posY\/10. << \"\\t\" << h2.posZ\/10. << \"\\t\";\n  cout.precision(1);\n  cout << h2.time << \"\\t\";\n\n  cout << h1.volumeID << \"\\t\";\n  cout << h2.volumeID << \"\\t\";\n\n  cout.precision(2);\n  cout << h1.edep << \"\\t\";\n  cout << h2.edep << \"\\t\";\n\n  cout << verify_type_of_coincidence(h1, h2) << \"\\t\";\n\n  cout.precision(2);\n  cout << h1.sourcePosX\/10. << \"\\t\" << h1.sourcePosY\/10. << \"\\t\" << h1.sourcePosZ\/10. << \"\\t\";\n  cout << h2.sourcePosX\/10. << \"\\t\" << h2.sourcePosY\/10. << \"\\t\" << h2.sourcePosZ\/10. << endl;\n\n}\n\n\/\/================================================================================\n\/\/ MAIN ANALYSIS FUNCTION\n\/\/================================================================================\n\nvoid EventAnalysis::analyze_event(vector<Hit> &hits, bool singles)\n{\n\n  int MAX_N = int(atof(getenv(\"GOJA_MAX_N\")));\n  int MAX_N0 = int(atof(getenv(\"GOJA_MAX_N0\")));\n\n  sort_hits(hits, \"TIME\");\n\n  if (singles) {\n    select_coincident_singles(hits);\n  }\n  else {\n    select_coincident_hits(hits);\n  }\n\n  if (N==MAX_N and N0<=MAX_N0) print_coincidences();\n\n  if (DEBUG) {\n    cout.setf(ios::fixed);\n    cout.precision(1);\n    for (unsigned int i=0; i<hits.size(); i++) {\n      double t = hits[i].time;\n      if (i==0) cout << endl;\n      cout.precision(1);\n      cout << t << \"\\t\";\n      cout.precision(2);\n      cout << hits[i].edep;\n      if (i>0) {\n        cout.precision(1);\n        cout << \"\\t\" << (hits[i].time-hits[i-1].time);\n      }\n      if (i==(hits.size()-1)) {\n        cout.precision(1);\n        cout << \"\\t\" << (hits[i].time-hits[0].time) << endl;\n        cout << N << \"\\t\" << N0 << endl;\n      }\n      cout << endl;\n    }\n  }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Ouzel by Elviss Strazdins\n\n#include <algorithm>\n#include <cassert>\n#include \"Actor.hpp\"\n#include \"SceneManager.hpp\"\n#include \"Layer.hpp\"\n#include \"Camera.hpp\"\n#include \"Component.hpp\"\n#include \"..\/math\/Scalar.hpp\"\n\nnamespace ouzel::scene\n{\n    ActorContainer::~ActorContainer()\n    {\n        for (const auto actor : children)\n        {\n            if (entered) actor->leave();\n            actor->parent = nullptr;\n            actor->setLayer(nullptr);\n        }\n    }\n\n    void ActorContainer::addChild(std::unique_ptr<Actor> actor)\n    {\n        assert(actor.get());\n\n        addChild(*actor);\n        ownedChildren.push_back(std::move(actor));\n    }\n\n    void ActorContainer::addChild(Actor& actor)\n    {\n        if (actor.parent)\n            actor.parent->removeChild(actor);\n\n        actor.parent = this;\n        actor.setLayer(layer);\n        if (entered) actor.enter();\n        children.push_back(&actor);\n    }\n\n    bool ActorContainer::removeChild(const Actor& actor)\n    {\n        bool result = false;\n\n        if (const auto childIterator = std::find(children.begin(), children.end(), &actor); childIterator != children.end())\n        {\n            Actor* child = *childIterator;\n\n            if (entered) child->leave();\n            child->parent = nullptr;\n            child->setLayer(nullptr);\n            children.erase(childIterator);\n\n            result = true;\n        }\n\n        const auto ownedChildIterator = std::find_if(ownedChildren.begin(), ownedChildren.end(), [&actor](const auto& ownedChild) noexcept {\n            return ownedChild.get() == &actor;\n        });\n        if (ownedChildIterator != ownedChildren.end())\n            ownedChildren.erase(ownedChildIterator);\n\n        return result;\n    }\n\n    std::unique_ptr<Actor> ActorContainer::releaseChild(const Actor& actor)\n    {\n        std::unique_ptr<Actor> result;\n\n        const auto ownedChildIterator = std::find_if(ownedChildren.begin(), ownedChildren.end(), [&actor](const auto& ownedChild) noexcept {\n            return ownedChild.get() == &actor;\n        });\n\n        if (ownedChildIterator != ownedChildren.end())\n        {\n            result = std::move(*ownedChildIterator);\n            ownedChildren.erase(ownedChildIterator);\n        }\n\n        removeChild(actor);\n\n        return result;\n    }\n\n    bool ActorContainer::moveChildToBack(Actor& actor)\n    {\n        if (const auto i = std::find(children.begin(), children.end(), &actor); i != children.end())\n        {\n            std::rotate(children.begin(), i, i + 1);\n            return true;\n        }\n\n        return false;\n    }\n\n    bool ActorContainer::moveChildToFront(Actor& actor)\n    {\n        if (const auto i = std::find(children.begin(), children.end(), &actor); i != children.end())\n        {\n            std::rotate(i, i + 1, children.end());\n            return true;\n        }\n\n        return false;\n    }\n\n    void ActorContainer::removeAllChildren()\n    {\n        for (const auto actor : children)\n        {\n            if (entered) actor->leave();\n            actor->parent = nullptr;\n        }\n\n        children.clear();\n        ownedChildren.clear();\n    }\n\n    bool ActorContainer::hasChild(const Actor& actor, bool recursive) const\n    {\n        for (auto i = children.cbegin(); i != children.cend(); ++i)\n        {\n            const Actor* child = *i;\n\n            if (child == &actor || (recursive && child->hasChild(actor, true)))\n                return true;\n        }\n\n        return false;\n    }\n\n    void ActorContainer::enter()\n    {\n        entered = true;\n\n        for (const auto actor : children)\n            actor->enter();\n    }\n\n    void ActorContainer::leave()\n    {\n        entered = false;\n\n        for (const auto actor : children)\n            actor->leave();\n    }\n\n    void ActorContainer::setLayer(Layer* newLayer)\n    {\n        layer = newLayer;\n\n        for (const auto actor : children)\n            actor->setLayer(layer);\n    }\n\n    std::vector<std::pair<Actor*, math::Vector<float, 3>>> ActorContainer::findActors(const math::Vector<float, 2>& position) const\n    {\n        std::vector<std::pair<Actor*, math::Vector<float, 3>>> actors;\n\n        std::queue<const ActorContainer*> actorContainers;\n        actorContainers.push(this);\n\n        while (!actorContainers.empty())\n        {\n            const auto actorContainer = actorContainers.front();\n            actorContainers.pop();\n\n            for (auto i = actorContainer->children.rbegin(); i != actorContainer->children.rend(); ++i)\n            {\n                Actor* actor = *i;\n\n                if (!actor->isHidden())\n                {\n                    actorContainers.push(actor);\n\n                    if (actor->isPickable() && actor->pointOn(position))\n                    {\n                        auto result = std::pair(actor, actor->convertWorldToLocal(math::Vector<float, 3>{position}));\n\n                        const auto upperBound = std::upper_bound(actors.begin(), actors.end(), result,\n                                                                 [](const auto& a, const auto& b) noexcept {\n                                                                     return a.first->worldOrder < b.first->worldOrder;\n                                                                 });\n\n                        actors.insert(upperBound, result);\n                    }\n                }\n            }\n        }\n\n        return actors;\n    }\n\n    std::vector<Actor*> ActorContainer::findActors(const std::vector<math::Vector<float, 2>>& edges) const\n    {\n        std::vector<Actor*> actors;\n\n        std::queue<const ActorContainer*> actorContainers;\n        actorContainers.push(this);\n\n        while (!actorContainers.empty())\n        {\n            const auto actorContainer = actorContainers.front();\n            actorContainers.pop();\n\n            for (auto i = actorContainer->children.rbegin(); i != actorContainer->children.rend(); ++i)\n            {\n                Actor* actor = *i;\n\n                if (!actor->isHidden())\n                {\n                    actorContainers.push(actor);\n\n                    if (actor->isPickable() && actor->shapeOverlaps(edges))\n                    {\n                        const auto upperBound = std::upper_bound(actors.begin(), actors.end(), actor,\n                                                                 [](const auto a, const auto b) noexcept {\n                                                                     return a->worldOrder < b->worldOrder;\n                                                                 });\n\n                        actors.insert(upperBound, actor);\n                    }\n                }\n            }\n        }\n\n        return actors;\n    }\n\n    Actor::~Actor()\n    {\n        if (parent) parent->removeChild(*this);\n\n        for (const auto component : components)\n            component->setActor(nullptr);\n    }\n\n    void Actor::visit(std::vector<Actor*>& drawQueue,\n                      const math::Matrix<float, 4>& newParentTransform,\n                      bool parentTransformDirty,\n                      Camera* camera,\n                      Order parentOrder,\n                      bool parentHidden)\n    {\n        worldOrder = parentOrder + order;\n        worldHidden = parentHidden || hidden;\n\n        if (parentTransformDirty) updateTransform(newParentTransform);\n        if (transformDirty) calculateTransform();\n\n        if (!worldHidden)\n        {\n            const auto boundingBox = getBoundingBox();\n\n            if (cullDisabled || (!boundingBox.isEmpty() && camera->checkVisibility(getTransform(), boundingBox)))\n            {\n                const auto upperBound = std::upper_bound(drawQueue.begin(), drawQueue.end(), this,\n                                                         [](const auto a, const auto b) noexcept {\n                                                             return a->worldOrder > b->worldOrder;\n                                                         });\n\n                drawQueue.insert(upperBound, this);\n            }\n        }\n\n        for (const auto actor : children)\n            actor->visit(drawQueue, transform, updateChildrenTransform, camera, worldOrder, worldHidden);\n\n        updateChildrenTransform = false;\n    }\n\n    void Actor::draw(Camera* camera, bool wireframe)\n    {\n        if (transformDirty)\n            calculateTransform();\n\n        for (const auto component : components)\n            if (!component->isHidden())\n                component->draw(transform,\n                                opacity,\n                                camera->getRenderViewProjection(),\n                                wireframe);\n    }\n\n    void Actor::addChild(Actor& actor)\n    {\n        ActorContainer::addChild(actor);\n\n        actor.updateTransform(getTransform());\n    }\n\n    void Actor::setPosition(const math::Vector<float, 2>& newPosition)\n    {\n        position.v[0] = newPosition.v[0];\n        position.v[1] = newPosition.v[1];\n\n        updateLocalTransform();\n    }\n\n    void Actor::setPosition(const math::Vector<float, 3>& newPosition)\n    {\n        position = newPosition;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setRotation(const math::Quaternion<float>& newRotation)\n    {\n        rotation = newRotation;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setRotation(const math::Vector<float, 3>& newRotation)\n    {\n        math::Quaternion<float> roationQuaternion;\n        setEulerAngles(roationQuaternion, newRotation);\n\n        rotation = roationQuaternion;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setRotation(float newRotation)\n    {\n        math::Quaternion<float> roationQuaternion;\n        rotate(roationQuaternion,\n               newRotation,\n               math::Vector<float, 3>{0.0F, 0.0F, 1.0F});\n\n        rotation = roationQuaternion;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setScale(const math::Vector<float, 2>& newScale)\n    {\n        scale.v[0] = newScale.v[0];\n        scale.v[1] = newScale.v[1];\n\n        updateLocalTransform();\n    }\n\n    void Actor::setScale(const math::Vector<float, 3>& newScale)\n    {\n        scale = newScale;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setOpacity(float newOpacity)\n    {\n        opacity = std::clamp(newOpacity, 0.0F, 1.0F);\n    }\n\n    void Actor::setFlipX(bool newFlipX)\n    {\n        flipX = newFlipX;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setFlipY(bool newFlipY)\n    {\n        flipY = newFlipY;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setHidden(bool newHidden)\n    {\n        hidden = newHidden;\n    }\n\n    bool Actor::pointOn(const math::Vector<float, 2>& worldPosition) const\n    {\n        const auto localPosition = math::Vector<float, 2>{convertWorldToLocal(math::Vector<float, 3>{worldPosition})};\n\n        for (const auto component : components)\n            if (component->pointOn(localPosition))\n                return true;\n\n        return false;\n    }\n\n    bool Actor::shapeOverlaps(const std::vector<math::Vector<float, 2>>& edges) const\n    {\n        const auto& inverse = getInverseTransform();\n\n        std::vector<math::Vector<float, 2>> transformedEdges;\n\n        for (const auto& edge : edges)\n        {\n            auto transformedEdge = math::Vector<float, 3>{edge};\n\n            inverse.transformPoint(transformedEdge);\n\n            transformedEdges.emplace_back(transformedEdge.v[0], transformedEdge.v[1]);\n        }\n\n        for (const auto component : components)\n            if (component->shapeOverlaps(transformedEdges))\n                return true;\n\n        return false;\n    }\n\n    void Actor::updateLocalTransform()\n    {\n        localTransformDirty = transformDirty = inverseTransformDirty = true;\n        for (const auto component : components)\n            component->updateTransform();\n    }\n\n    void Actor::updateTransform(const math::Matrix<float, 4>& newParentTransform)\n    {\n        parentTransform = newParentTransform;\n        transformDirty = inverseTransformDirty = true;\n        for (const auto component : components)\n            component->updateTransform();\n    }\n\n    math::Vector<float, 3> Actor::getWorldPosition() const\n    {\n        auto result = position;\n        const auto& currentTransform = getTransform();\n        currentTransform.transformPoint(result);\n\n        return position;\n    }\n\n    math::Vector<float, 3> Actor::convertWorldToLocal(const math::Vector<float, 3>& worldPosition) const\n    {\n        auto localPosition = worldPosition;\n\n        const auto& currentInverseTransform = getInverseTransform();\n        currentInverseTransform.transformPoint(localPosition);\n\n        return localPosition;\n    }\n\n    math::Vector<float, 3> Actor::convertLocalToWorld(const math::Vector<float, 3>& localPosition) const\n    {\n        auto worldPosition = localPosition;\n\n        const auto& currentTransform = getTransform();\n        currentTransform.transformPoint(worldPosition);\n\n        return worldPosition;\n    }\n\n    void Actor::calculateLocalTransform() const\n    {\n        setTranslation(localTransform, position);\n\n        math::Matrix<float, 4> rotationMatrix;\n        math::setRotation(rotationMatrix, rotation);\n\n        localTransform *= rotationMatrix;\n\n        const auto finalScale = math::Vector<float, 3>{\n            scale.v[0] * (flipX ? -1.0F : 1.0F),\n            scale.v[1] * (flipY ? -1.0F : 1.0F),\n            scale.v[2]\n        };\n\n        math::Matrix<float, 4> scaleMatrix;\n        math::setScale(scaleMatrix, finalScale);\n\n        localTransform *= scaleMatrix;\n\n        localTransformDirty = false;\n    }\n\n    void Actor::calculateTransform() const\n    {\n        transform = parentTransform * getLocalTransform();\n        transformDirty = false;\n\n        updateChildrenTransform = true;\n    }\n\n    void Actor::calculateInverseTransform() const\n    {\n        inverseTransform = getTransform();\n        invert(inverseTransform);\n        inverseTransformDirty = false;\n    }\n\n    void Actor::removeFromParent()\n    {\n        if (parent) parent->removeChild(*this);\n    }\n\n    void Actor::addComponent(std::unique_ptr<Component> component)\n    {\n        addComponent(*component);\n        ownedComponents.push_back(std::move(component));\n    }\n\n    void Actor::addComponent(Component& component)\n    {\n        if (component.actor)\n            component.actor->removeComponent(component);\n\n        component.setActor(this);\n        components.push_back(&component);\n    }\n\n    bool Actor::removeComponent(Component& component)\n    {\n        bool result = false;\n\n        const auto componentIterator = std::find(components.begin(), components.end(), &component);\n\n        if (componentIterator != components.end())\n        {\n            component.setActor(nullptr);\n            components.erase(componentIterator);\n            result = true;\n        }\n\n        const auto ownedComponentIterator = std::find_if(ownedComponents.begin(), ownedComponents.end(), [&component](const auto& ownedComponent) noexcept {\n            return ownedComponent.get() == &component;\n        });\n        if (ownedComponentIterator != ownedComponents.end())\n            ownedComponents.erase(ownedComponentIterator);\n\n        return result;\n    }\n\n    void Actor::removeAllComponents()\n    {\n        for (const auto component : components)\n            component->actor = nullptr;\n\n        components.clear();\n        ownedComponents.clear();\n    }\n\n    void Actor::setLayer(Layer* newLayer)\n    {\n        ActorContainer::setLayer(newLayer);\n\n        for (const auto component : components)\n            component->setLayer(newLayer);\n    }\n\n    math::Box<float, 3> Actor::getBoundingBox() const\n    {\n        math::Box<float, 3> boundingBox;\n\n        for (const auto component : components)\n            if (!component->isHidden())\n                boundingBox.merge(component->getBoundingBox());\n\n        return boundingBox;\n    }\n}\n<commit_msg>Fix the isEmpty call<commit_after>\/\/ Ouzel by Elviss Strazdins\n\n#include <algorithm>\n#include <cassert>\n#include \"Actor.hpp\"\n#include \"SceneManager.hpp\"\n#include \"Layer.hpp\"\n#include \"Camera.hpp\"\n#include \"Component.hpp\"\n#include \"..\/math\/Scalar.hpp\"\n\nnamespace ouzel::scene\n{\n    ActorContainer::~ActorContainer()\n    {\n        for (const auto actor : children)\n        {\n            if (entered) actor->leave();\n            actor->parent = nullptr;\n            actor->setLayer(nullptr);\n        }\n    }\n\n    void ActorContainer::addChild(std::unique_ptr<Actor> actor)\n    {\n        assert(actor.get());\n\n        addChild(*actor);\n        ownedChildren.push_back(std::move(actor));\n    }\n\n    void ActorContainer::addChild(Actor& actor)\n    {\n        if (actor.parent)\n            actor.parent->removeChild(actor);\n\n        actor.parent = this;\n        actor.setLayer(layer);\n        if (entered) actor.enter();\n        children.push_back(&actor);\n    }\n\n    bool ActorContainer::removeChild(const Actor& actor)\n    {\n        bool result = false;\n\n        if (const auto childIterator = std::find(children.begin(), children.end(), &actor); childIterator != children.end())\n        {\n            Actor* child = *childIterator;\n\n            if (entered) child->leave();\n            child->parent = nullptr;\n            child->setLayer(nullptr);\n            children.erase(childIterator);\n\n            result = true;\n        }\n\n        const auto ownedChildIterator = std::find_if(ownedChildren.begin(), ownedChildren.end(), [&actor](const auto& ownedChild) noexcept {\n            return ownedChild.get() == &actor;\n        });\n        if (ownedChildIterator != ownedChildren.end())\n            ownedChildren.erase(ownedChildIterator);\n\n        return result;\n    }\n\n    std::unique_ptr<Actor> ActorContainer::releaseChild(const Actor& actor)\n    {\n        std::unique_ptr<Actor> result;\n\n        const auto ownedChildIterator = std::find_if(ownedChildren.begin(), ownedChildren.end(), [&actor](const auto& ownedChild) noexcept {\n            return ownedChild.get() == &actor;\n        });\n\n        if (ownedChildIterator != ownedChildren.end())\n        {\n            result = std::move(*ownedChildIterator);\n            ownedChildren.erase(ownedChildIterator);\n        }\n\n        removeChild(actor);\n\n        return result;\n    }\n\n    bool ActorContainer::moveChildToBack(Actor& actor)\n    {\n        if (const auto i = std::find(children.begin(), children.end(), &actor); i != children.end())\n        {\n            std::rotate(children.begin(), i, i + 1);\n            return true;\n        }\n\n        return false;\n    }\n\n    bool ActorContainer::moveChildToFront(Actor& actor)\n    {\n        if (const auto i = std::find(children.begin(), children.end(), &actor); i != children.end())\n        {\n            std::rotate(i, i + 1, children.end());\n            return true;\n        }\n\n        return false;\n    }\n\n    void ActorContainer::removeAllChildren()\n    {\n        for (const auto actor : children)\n        {\n            if (entered) actor->leave();\n            actor->parent = nullptr;\n        }\n\n        children.clear();\n        ownedChildren.clear();\n    }\n\n    bool ActorContainer::hasChild(const Actor& actor, bool recursive) const\n    {\n        for (auto i = children.cbegin(); i != children.cend(); ++i)\n        {\n            const Actor* child = *i;\n\n            if (child == &actor || (recursive && child->hasChild(actor, true)))\n                return true;\n        }\n\n        return false;\n    }\n\n    void ActorContainer::enter()\n    {\n        entered = true;\n\n        for (const auto actor : children)\n            actor->enter();\n    }\n\n    void ActorContainer::leave()\n    {\n        entered = false;\n\n        for (const auto actor : children)\n            actor->leave();\n    }\n\n    void ActorContainer::setLayer(Layer* newLayer)\n    {\n        layer = newLayer;\n\n        for (const auto actor : children)\n            actor->setLayer(layer);\n    }\n\n    std::vector<std::pair<Actor*, math::Vector<float, 3>>> ActorContainer::findActors(const math::Vector<float, 2>& position) const\n    {\n        std::vector<std::pair<Actor*, math::Vector<float, 3>>> actors;\n\n        std::queue<const ActorContainer*> actorContainers;\n        actorContainers.push(this);\n\n        while (!actorContainers.empty())\n        {\n            const auto actorContainer = actorContainers.front();\n            actorContainers.pop();\n\n            for (auto i = actorContainer->children.rbegin(); i != actorContainer->children.rend(); ++i)\n            {\n                Actor* actor = *i;\n\n                if (!actor->isHidden())\n                {\n                    actorContainers.push(actor);\n\n                    if (actor->isPickable() && actor->pointOn(position))\n                    {\n                        auto result = std::pair(actor, actor->convertWorldToLocal(math::Vector<float, 3>{position}));\n\n                        const auto upperBound = std::upper_bound(actors.begin(), actors.end(), result,\n                                                                 [](const auto& a, const auto& b) noexcept {\n                                                                     return a.first->worldOrder < b.first->worldOrder;\n                                                                 });\n\n                        actors.insert(upperBound, result);\n                    }\n                }\n            }\n        }\n\n        return actors;\n    }\n\n    std::vector<Actor*> ActorContainer::findActors(const std::vector<math::Vector<float, 2>>& edges) const\n    {\n        std::vector<Actor*> actors;\n\n        std::queue<const ActorContainer*> actorContainers;\n        actorContainers.push(this);\n\n        while (!actorContainers.empty())\n        {\n            const auto actorContainer = actorContainers.front();\n            actorContainers.pop();\n\n            for (auto i = actorContainer->children.rbegin(); i != actorContainer->children.rend(); ++i)\n            {\n                Actor* actor = *i;\n\n                if (!actor->isHidden())\n                {\n                    actorContainers.push(actor);\n\n                    if (actor->isPickable() && actor->shapeOverlaps(edges))\n                    {\n                        const auto upperBound = std::upper_bound(actors.begin(), actors.end(), actor,\n                                                                 [](const auto a, const auto b) noexcept {\n                                                                     return a->worldOrder < b->worldOrder;\n                                                                 });\n\n                        actors.insert(upperBound, actor);\n                    }\n                }\n            }\n        }\n\n        return actors;\n    }\n\n    Actor::~Actor()\n    {\n        if (parent) parent->removeChild(*this);\n\n        for (const auto component : components)\n            component->setActor(nullptr);\n    }\n\n    void Actor::visit(std::vector<Actor*>& drawQueue,\n                      const math::Matrix<float, 4>& newParentTransform,\n                      bool parentTransformDirty,\n                      Camera* camera,\n                      Order parentOrder,\n                      bool parentHidden)\n    {\n        worldOrder = parentOrder + order;\n        worldHidden = parentHidden || hidden;\n\n        if (parentTransformDirty) updateTransform(newParentTransform);\n        if (transformDirty) calculateTransform();\n\n        if (!worldHidden)\n        {\n            const auto boundingBox = getBoundingBox();\n\n            if (cullDisabled || (!isEmpty(boundingBox) && camera->checkVisibility(getTransform(), boundingBox)))\n            {\n                const auto upperBound = std::upper_bound(drawQueue.begin(), drawQueue.end(), this,\n                                                         [](const auto a, const auto b) noexcept {\n                                                             return a->worldOrder > b->worldOrder;\n                                                         });\n\n                drawQueue.insert(upperBound, this);\n            }\n        }\n\n        for (const auto actor : children)\n            actor->visit(drawQueue, transform, updateChildrenTransform, camera, worldOrder, worldHidden);\n\n        updateChildrenTransform = false;\n    }\n\n    void Actor::draw(Camera* camera, bool wireframe)\n    {\n        if (transformDirty)\n            calculateTransform();\n\n        for (const auto component : components)\n            if (!component->isHidden())\n                component->draw(transform,\n                                opacity,\n                                camera->getRenderViewProjection(),\n                                wireframe);\n    }\n\n    void Actor::addChild(Actor& actor)\n    {\n        ActorContainer::addChild(actor);\n\n        actor.updateTransform(getTransform());\n    }\n\n    void Actor::setPosition(const math::Vector<float, 2>& newPosition)\n    {\n        position.v[0] = newPosition.v[0];\n        position.v[1] = newPosition.v[1];\n\n        updateLocalTransform();\n    }\n\n    void Actor::setPosition(const math::Vector<float, 3>& newPosition)\n    {\n        position = newPosition;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setRotation(const math::Quaternion<float>& newRotation)\n    {\n        rotation = newRotation;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setRotation(const math::Vector<float, 3>& newRotation)\n    {\n        math::Quaternion<float> roationQuaternion;\n        setEulerAngles(roationQuaternion, newRotation);\n\n        rotation = roationQuaternion;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setRotation(float newRotation)\n    {\n        math::Quaternion<float> roationQuaternion;\n        rotate(roationQuaternion,\n               newRotation,\n               math::Vector<float, 3>{0.0F, 0.0F, 1.0F});\n\n        rotation = roationQuaternion;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setScale(const math::Vector<float, 2>& newScale)\n    {\n        scale.v[0] = newScale.v[0];\n        scale.v[1] = newScale.v[1];\n\n        updateLocalTransform();\n    }\n\n    void Actor::setScale(const math::Vector<float, 3>& newScale)\n    {\n        scale = newScale;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setOpacity(float newOpacity)\n    {\n        opacity = std::clamp(newOpacity, 0.0F, 1.0F);\n    }\n\n    void Actor::setFlipX(bool newFlipX)\n    {\n        flipX = newFlipX;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setFlipY(bool newFlipY)\n    {\n        flipY = newFlipY;\n\n        updateLocalTransform();\n    }\n\n    void Actor::setHidden(bool newHidden)\n    {\n        hidden = newHidden;\n    }\n\n    bool Actor::pointOn(const math::Vector<float, 2>& worldPosition) const\n    {\n        const auto localPosition = math::Vector<float, 2>{convertWorldToLocal(math::Vector<float, 3>{worldPosition})};\n\n        for (const auto component : components)\n            if (component->pointOn(localPosition))\n                return true;\n\n        return false;\n    }\n\n    bool Actor::shapeOverlaps(const std::vector<math::Vector<float, 2>>& edges) const\n    {\n        const auto& inverse = getInverseTransform();\n\n        std::vector<math::Vector<float, 2>> transformedEdges;\n\n        for (const auto& edge : edges)\n        {\n            auto transformedEdge = math::Vector<float, 3>{edge};\n\n            inverse.transformPoint(transformedEdge);\n\n            transformedEdges.emplace_back(transformedEdge.v[0], transformedEdge.v[1]);\n        }\n\n        for (const auto component : components)\n            if (component->shapeOverlaps(transformedEdges))\n                return true;\n\n        return false;\n    }\n\n    void Actor::updateLocalTransform()\n    {\n        localTransformDirty = transformDirty = inverseTransformDirty = true;\n        for (const auto component : components)\n            component->updateTransform();\n    }\n\n    void Actor::updateTransform(const math::Matrix<float, 4>& newParentTransform)\n    {\n        parentTransform = newParentTransform;\n        transformDirty = inverseTransformDirty = true;\n        for (const auto component : components)\n            component->updateTransform();\n    }\n\n    math::Vector<float, 3> Actor::getWorldPosition() const\n    {\n        auto result = position;\n        const auto& currentTransform = getTransform();\n        currentTransform.transformPoint(result);\n\n        return position;\n    }\n\n    math::Vector<float, 3> Actor::convertWorldToLocal(const math::Vector<float, 3>& worldPosition) const\n    {\n        auto localPosition = worldPosition;\n\n        const auto& currentInverseTransform = getInverseTransform();\n        currentInverseTransform.transformPoint(localPosition);\n\n        return localPosition;\n    }\n\n    math::Vector<float, 3> Actor::convertLocalToWorld(const math::Vector<float, 3>& localPosition) const\n    {\n        auto worldPosition = localPosition;\n\n        const auto& currentTransform = getTransform();\n        currentTransform.transformPoint(worldPosition);\n\n        return worldPosition;\n    }\n\n    void Actor::calculateLocalTransform() const\n    {\n        setTranslation(localTransform, position);\n\n        math::Matrix<float, 4> rotationMatrix;\n        math::setRotation(rotationMatrix, rotation);\n\n        localTransform *= rotationMatrix;\n\n        const auto finalScale = math::Vector<float, 3>{\n            scale.v[0] * (flipX ? -1.0F : 1.0F),\n            scale.v[1] * (flipY ? -1.0F : 1.0F),\n            scale.v[2]\n        };\n\n        math::Matrix<float, 4> scaleMatrix;\n        math::setScale(scaleMatrix, finalScale);\n\n        localTransform *= scaleMatrix;\n\n        localTransformDirty = false;\n    }\n\n    void Actor::calculateTransform() const\n    {\n        transform = parentTransform * getLocalTransform();\n        transformDirty = false;\n\n        updateChildrenTransform = true;\n    }\n\n    void Actor::calculateInverseTransform() const\n    {\n        inverseTransform = getTransform();\n        invert(inverseTransform);\n        inverseTransformDirty = false;\n    }\n\n    void Actor::removeFromParent()\n    {\n        if (parent) parent->removeChild(*this);\n    }\n\n    void Actor::addComponent(std::unique_ptr<Component> component)\n    {\n        addComponent(*component);\n        ownedComponents.push_back(std::move(component));\n    }\n\n    void Actor::addComponent(Component& component)\n    {\n        if (component.actor)\n            component.actor->removeComponent(component);\n\n        component.setActor(this);\n        components.push_back(&component);\n    }\n\n    bool Actor::removeComponent(Component& component)\n    {\n        bool result = false;\n\n        const auto componentIterator = std::find(components.begin(), components.end(), &component);\n\n        if (componentIterator != components.end())\n        {\n            component.setActor(nullptr);\n            components.erase(componentIterator);\n            result = true;\n        }\n\n        const auto ownedComponentIterator = std::find_if(ownedComponents.begin(), ownedComponents.end(), [&component](const auto& ownedComponent) noexcept {\n            return ownedComponent.get() == &component;\n        });\n        if (ownedComponentIterator != ownedComponents.end())\n            ownedComponents.erase(ownedComponentIterator);\n\n        return result;\n    }\n\n    void Actor::removeAllComponents()\n    {\n        for (const auto component : components)\n            component->actor = nullptr;\n\n        components.clear();\n        ownedComponents.clear();\n    }\n\n    void Actor::setLayer(Layer* newLayer)\n    {\n        ActorContainer::setLayer(newLayer);\n\n        for (const auto component : components)\n            component->setLayer(newLayer);\n    }\n\n    math::Box<float, 3> Actor::getBoundingBox() const\n    {\n        math::Box<float, 3> boundingBox;\n\n        for (const auto component : components)\n            if (!component->isHidden())\n                boundingBox.merge(component->getBoundingBox());\n\n        return boundingBox;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ TypeSymbols.cpp\n\/\/ Contains type-related symbol definitions.\n\/\/\n\/\/ File is under the MIT license; see LICENSE for details.\n\/\/------------------------------------------------------------------------------\n#include \"TypeSymbols.h\"\n\n#include \"binding\/ConstantValue.h\"\n#include \"compilation\/Compilation.h\"\n\nnamespace {\n\nusing namespace slang;\n\nstring_view getName(BuiltInIntegerType::Kind kind) {\n    switch (kind) {\n        case BuiltInIntegerType::Bit: return \"bit\";\n        case BuiltInIntegerType::Logic: return \"logic\";\n        case BuiltInIntegerType::Reg: return \"reg\";\n        case BuiltInIntegerType::ShortInt: return \"shortint\";\n        case BuiltInIntegerType::Int: return \"int\";\n        case BuiltInIntegerType::LongInt: return \"longint\";\n        case BuiltInIntegerType::Byte: return \"byte\";\n        case BuiltInIntegerType::Integer: return \"integer\";\n        case BuiltInIntegerType::Time: return \"time\";\n        default: THROW_UNREACHABLE;\n    }\n}\n\nuint32_t getWidth(BuiltInIntegerType::Kind kind) {\n    switch (kind) {\n        case BuiltInIntegerType::Bit: return 1;\n        case BuiltInIntegerType::Logic: return 1;\n        case BuiltInIntegerType::Reg: return 1;\n        case BuiltInIntegerType::ShortInt: return 16;\n        case BuiltInIntegerType::Int: return 32;\n        case BuiltInIntegerType::LongInt: return 64;\n        case BuiltInIntegerType::Byte: return 8;\n        case BuiltInIntegerType::Integer: return 32;\n        case BuiltInIntegerType::Time: return 64;\n        default: THROW_UNREACHABLE;\n    }\n}\n\nbool getSigned(BuiltInIntegerType::Kind kind) {\n    switch (kind) {\n        case BuiltInIntegerType::Bit: return false;\n        case BuiltInIntegerType::Logic: return false;\n        case BuiltInIntegerType::Reg: return false;\n        case BuiltInIntegerType::ShortInt: return true;\n        case BuiltInIntegerType::Int: return true;\n        case BuiltInIntegerType::LongInt: return true;\n        case BuiltInIntegerType::Byte: return true;\n        case BuiltInIntegerType::Integer: return true;\n        case BuiltInIntegerType::Time: return false;\n        default: THROW_UNREACHABLE;\n    }\n}\n\nbool getFourState(BuiltInIntegerType::Kind kind) {\n    switch (kind) {\n        case BuiltInIntegerType::Bit: return false;\n        case BuiltInIntegerType::Logic: return true;\n        case BuiltInIntegerType::Reg: return true;\n        case BuiltInIntegerType::ShortInt: return false;\n        case BuiltInIntegerType::Int: return false;\n        case BuiltInIntegerType::LongInt: return false;\n        case BuiltInIntegerType::Byte: return false;\n        case BuiltInIntegerType::Integer: return true;\n        case BuiltInIntegerType::Time: return true;\n        default: THROW_UNREACHABLE;\n    }\n}\n\nuint32_t getWidth(span<ConstantRange const> dims) {\n    uint32_t width = 0;\n    for (const auto& dim : dims)\n        width += dim.width();\n    return width;\n}\n\nstring_view getName(FloatingType::Kind kind) {\n    switch (kind) {\n        case FloatingType::Real: return \"real\";\n        case FloatingType::RealTime: return \"realtime\";\n        case FloatingType::ShortReal: return \"shortreal\";\n        default: THROW_UNREACHABLE;\n    }\n}\n\n}\n\nnamespace slang {\n\nconst ErrorType ErrorType::Instance;\n\nconst Type& Type::getCanonicalType() const {\n    return *this;\n}\n\nuint32_t Type::getBitWidth() const {\n    if (isIntegral())\n        return as<IntegralType>().bitWidth;\n    if (isFloating()) {\n        switch (as<FloatingType>().floatKind) {\n            case FloatingType::Real: return 64;\n            case FloatingType::RealTime: return 64;\n            case FloatingType::ShortReal: return 32;\n            default: THROW_UNREACHABLE;\n        }\n    }\n    return 0;\n}\n\nbool Type::isIntegral() const {\n    switch (kind) {\n        case SymbolKind::BuiltInIntegerType:\n        case SymbolKind::VectorType:\n            return true;\n        default:\n            return false;\n    }\n}\n\nbool Type::isMatching(const Type& rhs) const {\n    const Type* l = &getCanonicalType();\n    const Type* r = &rhs.getCanonicalType();\n\n    \/\/ If the two types have the same address, they are literally the same type.\n    \/\/ This handles all built-in types, which are allocated once and then shared,\n    \/\/ and also handles simple bit vector types that share the same range, signedness,\n    \/\/ and four-stateness because we uniquify them in the compilation cache.\n    if (l == r)\n        return true;\n\n    \/\/ TODO: check array types here\n\n    return false;\n}\n\nbool Type::isEquivalent(const Type& rhs) const {\n    if (isMatching(rhs))\n        return true;\n\n    return true;\n}\n\nbool Type::isAssignmentCompatible(const Type& rhs) const {\n    if (isEquivalent(rhs))\n        return true;\n\n    return true;\n}\n\nbool Type::isCastCompatible(const Type& rhs) const {\n    if (isAssignmentCompatible(rhs))\n        return true;\n\n    return true;\n}\n\nstd::string Type::toString() const {\n    return \"\";\n}\n\nIntegralType::IntegralType(SymbolKind kind, string_view name, uint32_t bitWidth_,\n                           bool isSigned_, bool isFourState_) :\n    Type(kind, name),\n    bitWidth(bitWidth_), isSigned(isSigned_), isFourState(isFourState_)\n{\n}\n\nbool IntegralType::isSimpleBitVector() const {\n    return isBuiltIn() || (kind == SymbolKind::VectorType && as<VectorType>().dimensions.size() == 1);\n}\n\nConstantRange IntegralType::getBitVectorRange() const {\n    if (isBuiltIn())\n        return { (int)bitWidth - 1, 0 };\n\n    ASSERT(kind == SymbolKind::VectorType);\n\n    const auto& vt = as<VectorType>();\n    ASSERT(vt.dimensions.size() == 1);\n    return vt.dimensions[0];\n}\n\nconst Type& IntegralType::fromSyntax(Compilation& compilation, const IntegerTypeSyntax& syntax,\n                                     const Scope& scope) {\n    \/\/ This is a simple integral vector (possibly of just one element).\n    bool isReg = syntax.keyword.kind == TokenKind::RegKeyword;\n    bool isSigned = syntax.signing.kind == TokenKind::SignedKeyword;\n    bool isFourState = syntax.kind != SyntaxKind::BitType;\n\n    SmallVectorSized<ConstantRange, 4> dims;\n    if (!evaluateConstantDims(compilation, syntax.dimensions, dims, scope))\n        return compilation.getErrorType();\n\n    \/\/ TODO: review this whole mess\n\n    if (dims.empty()) {\n        \/\/ TODO: signing\n        return compilation.getType(syntax.kind);\n    }\n    else if (dims.size() == 1 && dims[0].right == 0) {\n        \/\/ if we have the common case of only one dimension and lsb == 0\n        \/\/ then we can use the shared representation\n        int width = dims[0].left + 1;\n        return compilation.getType((uint16_t)width, isSigned, isFourState, isReg);\n    }\n    else {\n        return compilation.getType(isSigned, isFourState, isReg, dims.copy(compilation));\n    }\n}\n\nbool IntegralType::evaluateConstantDims(Compilation&,\n                                        const SyntaxList<VariableDimensionSyntax>& dimensions,\n                                        SmallVector<ConstantRange>& results, const Scope& scope) {\n    for (const VariableDimensionSyntax* dim : dimensions) {\n        const SelectorSyntax* selector;\n        if (!dim->specifier || dim->specifier->kind != SyntaxKind::RangeDimensionSpecifier ||\n            (selector = &dim->specifier->as<RangeDimensionSpecifierSyntax>().selector)->kind != SyntaxKind::SimpleRangeSelect) {\n\n            \/\/ TODO: errors\n            \/\/auto& diag = addError(DiagCode::PackedDimRequiresConstantRange, dim->specifier->getFirstToken().location());\n            \/\/diag << dim->specifier->sourceRange();\n            return false;\n        }\n\n        const RangeSelectSyntax& range = selector->as<RangeSelectSyntax>();\n\n        \/\/ 6.9.1 - Implementations may set a limit on the maximum length of a vector,\n        \/\/ but the limit shall be at least 65536 (2^16) bits.\n        const int MaxRangeBits = 16;\n\n        \/\/ TODO: errors\n        auto left = scope.evaluateConstant(range.left).coerceInteger(MaxRangeBits);\n        auto right = scope.evaluateConstant(range.right).coerceInteger(MaxRangeBits);\n\n        if (!left || !right)\n            return false;\n\n        results.emplace(ConstantRange { *left, *right });\n    }\n    return true;\n}\n\nBuiltInIntegerType::BuiltInIntegerType(Kind builtInKind) :\n    BuiltInIntegerType(builtInKind, getSigned(builtInKind))\n{\n}\n\nBuiltInIntegerType::BuiltInIntegerType(Kind builtInKind, bool isSigned) :\n    IntegralType(SymbolKind::BuiltInIntegerType,\n                 getName(builtInKind),\n                 getWidth(builtInKind),\n                 isSigned,\n                 getFourState(builtInKind)),\n    integerKind(builtInKind)\n{\n}\n\nVectorType::VectorType(ScalarType scalarType_, span<ConstantRange const> dimensions_, bool isSigned) :\n    IntegralType(SymbolKind::VectorType, getName((BuiltInIntegerType::Kind)scalarType_),\n                 getWidth(dimensions_),\n                 isSigned,\n                 getFourState((BuiltInIntegerType::Kind)scalarType_)),\n    scalarType(scalarType_),\n    dimensions(dimensions_)\n{\n}\n\nFloatingType::FloatingType(Kind floatKind_) :\n    Type(SymbolKind::FloatingType, getName(floatKind_)),\n    floatKind(floatKind_)\n{\n}\n\n}\n<commit_msg>Fix the Linux build<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ TypeSymbols.cpp\n\/\/ Contains type-related symbol definitions.\n\/\/\n\/\/ File is under the MIT license; see LICENSE for details.\n\/\/------------------------------------------------------------------------------\n#include \"TypeSymbols.h\"\n\n#include \"binding\/ConstantValue.h\"\n#include \"compilation\/Compilation.h\"\n\nnamespace {\n\nusing namespace slang;\n\nstring_view getName(BuiltInIntegerType::Kind kind) {\n    switch (kind) {\n        case BuiltInIntegerType::Bit: return \"bit\";\n        case BuiltInIntegerType::Logic: return \"logic\";\n        case BuiltInIntegerType::Reg: return \"reg\";\n        case BuiltInIntegerType::ShortInt: return \"shortint\";\n        case BuiltInIntegerType::Int: return \"int\";\n        case BuiltInIntegerType::LongInt: return \"longint\";\n        case BuiltInIntegerType::Byte: return \"byte\";\n        case BuiltInIntegerType::Integer: return \"integer\";\n        case BuiltInIntegerType::Time: return \"time\";\n        default: THROW_UNREACHABLE;\n    }\n}\n\nuint32_t getWidth(BuiltInIntegerType::Kind kind) {\n    switch (kind) {\n        case BuiltInIntegerType::Bit: return 1;\n        case BuiltInIntegerType::Logic: return 1;\n        case BuiltInIntegerType::Reg: return 1;\n        case BuiltInIntegerType::ShortInt: return 16;\n        case BuiltInIntegerType::Int: return 32;\n        case BuiltInIntegerType::LongInt: return 64;\n        case BuiltInIntegerType::Byte: return 8;\n        case BuiltInIntegerType::Integer: return 32;\n        case BuiltInIntegerType::Time: return 64;\n        default: THROW_UNREACHABLE;\n    }\n}\n\nbool getSigned(BuiltInIntegerType::Kind kind) {\n    switch (kind) {\n        case BuiltInIntegerType::Bit: return false;\n        case BuiltInIntegerType::Logic: return false;\n        case BuiltInIntegerType::Reg: return false;\n        case BuiltInIntegerType::ShortInt: return true;\n        case BuiltInIntegerType::Int: return true;\n        case BuiltInIntegerType::LongInt: return true;\n        case BuiltInIntegerType::Byte: return true;\n        case BuiltInIntegerType::Integer: return true;\n        case BuiltInIntegerType::Time: return false;\n        default: THROW_UNREACHABLE;\n    }\n}\n\nbool getFourState(BuiltInIntegerType::Kind kind) {\n    switch (kind) {\n        case BuiltInIntegerType::Bit: return false;\n        case BuiltInIntegerType::Logic: return true;\n        case BuiltInIntegerType::Reg: return true;\n        case BuiltInIntegerType::ShortInt: return false;\n        case BuiltInIntegerType::Int: return false;\n        case BuiltInIntegerType::LongInt: return false;\n        case BuiltInIntegerType::Byte: return false;\n        case BuiltInIntegerType::Integer: return true;\n        case BuiltInIntegerType::Time: return true;\n        default: THROW_UNREACHABLE;\n    }\n}\n\nuint32_t getWidth(span<ConstantRange const> dims) {\n    uint32_t width = 0;\n    for (const auto& dim : dims)\n        width += dim.width();\n    return width;\n}\n\nstring_view getName(FloatingType::Kind kind) {\n    switch (kind) {\n        case FloatingType::Real: return \"real\";\n        case FloatingType::RealTime: return \"realtime\";\n        case FloatingType::ShortReal: return \"shortreal\";\n        default: THROW_UNREACHABLE;\n    }\n}\n\n}\n\nnamespace slang {\n\nconst ErrorType ErrorType::Instance;\n\nconst Type& Type::getCanonicalType() const {\n    return *this;\n}\n\nuint32_t Type::getBitWidth() const {\n    if (isIntegral())\n        return as<IntegralType>().bitWidth;\n    if (isFloating()) {\n        switch (as<FloatingType>().floatKind) {\n            case FloatingType::Real: return 64;\n            case FloatingType::RealTime: return 64;\n            case FloatingType::ShortReal: return 32;\n            default: THROW_UNREACHABLE;\n        }\n    }\n    return 0;\n}\n\nbool Type::isIntegral() const {\n    switch (kind) {\n        case SymbolKind::BuiltInIntegerType:\n        case SymbolKind::VectorType:\n            return true;\n        default:\n            return false;\n    }\n}\n\nbool Type::isMatching(const Type& rhs) const {\n    const Type* l = &getCanonicalType();\n    const Type* r = &rhs.getCanonicalType();\n\n    \/\/ If the two types have the same address, they are literally the same type.\n    \/\/ This handles all built-in types, which are allocated once and then shared,\n    \/\/ and also handles simple bit vector types that share the same range, signedness,\n    \/\/ and four-stateness because we uniquify them in the compilation cache.\n    if (l == r)\n        return true;\n\n    \/\/ TODO: check array types here\n\n    return false;\n}\n\nbool Type::isEquivalent(const Type& rhs) const {\n    if (isMatching(rhs))\n        return true;\n\n    return true;\n}\n\nbool Type::isAssignmentCompatible(const Type& rhs) const {\n    if (isEquivalent(rhs))\n        return true;\n\n    return true;\n}\n\nbool Type::isCastCompatible(const Type& rhs) const {\n    if (isAssignmentCompatible(rhs))\n        return true;\n\n    return true;\n}\n\nstd::string Type::toString() const {\n    return \"\";\n}\n\nIntegralType::IntegralType(SymbolKind kind, string_view name, uint32_t bitWidth_,\n                           bool isSigned_, bool isFourState_) :\n    Type(kind, name),\n    bitWidth(bitWidth_), isSigned(isSigned_), isFourState(isFourState_)\n{\n}\n\nbool IntegralType::isSimpleBitVector() const {\n    return isBuiltIn() || (kind == SymbolKind::VectorType && as<VectorType>().dimensions.size() == 1);\n}\n\nConstantRange IntegralType::getBitVectorRange() const {\n    if (isBuiltIn())\n        return { (int)bitWidth - 1, 0 };\n\n    ASSERT(kind == SymbolKind::VectorType);\n\n    const auto& vt = as<VectorType>();\n    ASSERT(vt.dimensions.size() == 1);\n    return vt.dimensions[0];\n}\n\nconst Type& IntegralType::fromSyntax(Compilation& compilation, const IntegerTypeSyntax& syntax,\n                                     const Scope& scope) {\n    \/\/ This is a simple integral vector (possibly of just one element).\n    bool isReg = syntax.keyword.kind == TokenKind::RegKeyword;\n    bool isSigned = syntax.signing.kind == TokenKind::SignedKeyword;\n    bool isFourState = syntax.kind != SyntaxKind::BitType;\n\n    SmallVectorSized<ConstantRange, 4> dims;\n    if (!evaluateConstantDims(compilation, syntax.dimensions, dims, scope))\n        return compilation.getErrorType();\n\n    \/\/ TODO: review this whole mess\n\n    if (dims.empty()) {\n        \/\/ TODO: signing\n        return compilation.getType(syntax.kind);\n    }\n    else if (dims.size() == 1 && dims[0].right == 0) {\n        \/\/ if we have the common case of only one dimension and lsb == 0\n        \/\/ then we can use the shared representation\n        int width = dims[0].left + 1;\n        return compilation.getType((uint16_t)width, isSigned, isFourState, isReg);\n    }\n    else {\n        return compilation.getType(isSigned, isFourState, isReg, dims.copy(compilation));\n    }\n}\n\nbool IntegralType::evaluateConstantDims(Compilation&,\n                                        const SyntaxList<VariableDimensionSyntax>& dimensions,\n                                        SmallVector<ConstantRange>& results, const Scope& scope) {\n    for (const VariableDimensionSyntax* dim : dimensions) {\n        const SelectorSyntax* selector;\n        if (!dim->specifier || dim->specifier->kind != SyntaxKind::RangeDimensionSpecifier ||\n            (selector = &dim->specifier->as<RangeDimensionSpecifierSyntax>().selector)->kind != SyntaxKind::SimpleRangeSelect) {\n\n            \/\/ TODO: errors\n            \/\/auto& diag = addError(DiagCode::PackedDimRequiresConstantRange, dim->specifier->getFirstToken().location());\n            \/\/diag << dim->specifier->sourceRange();\n            return false;\n        }\n\n        const RangeSelectSyntax& range = selector->as<RangeSelectSyntax>();\n\n        \/\/ 6.9.1 - Implementations may set a limit on the maximum length of a vector,\n        \/\/ but the limit shall be at least 65536 (2^16) bits.\n        const int MaxRangeBits = 16;\n\n        \/\/ TODO: errors\n        auto left = scope.evaluateConstant(range.left).coerceInteger(MaxRangeBits);\n        auto right = scope.evaluateConstant(range.right).coerceInteger(MaxRangeBits);\n\n        if (!left || !right)\n            return false;\n\n        results.emplace(ConstantRange { *left, *right });\n    }\n    return true;\n}\n\nBuiltInIntegerType::BuiltInIntegerType(Kind builtInKind) :\n    BuiltInIntegerType(builtInKind, getSigned(builtInKind))\n{\n}\n\nBuiltInIntegerType::BuiltInIntegerType(Kind builtInKind, bool isSigned) :\n    IntegralType(SymbolKind::BuiltInIntegerType,\n                 getName(builtInKind),\n                 getWidth(builtInKind),\n                 isSigned,\n                 getFourState(builtInKind)),\n    integerKind(builtInKind)\n{\n}\n\nVectorType::VectorType(ScalarType scalarType_, span<ConstantRange const> dimensions_, bool isSigned) :\n    IntegralType(SymbolKind::VectorType, getName((BuiltInIntegerType::Kind)scalarType_),\n                 getWidth(dimensions_),\n                 isSigned,\n                 getFourState((BuiltInIntegerType::Kind)scalarType_)),\n    dimensions(dimensions_),\n    scalarType(scalarType_)\n{\n}\n\nFloatingType::FloatingType(Kind floatKind_) :\n    Type(SymbolKind::FloatingType, getName(floatKind_)),\n    floatKind(floatKind_)\n{\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"tests-base.hpp\"\r\n\r\n#include \"utf8rewind.h\"\r\n\r\n#include \"helpers-strings.hpp\"\r\n\r\nTEST(ToLower, BasicLatin)\r\n{\r\n\tconst char* c = \"Hello World!\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(12, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"hello world!\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinUppercase)\r\n{\r\n\tconst char* c = \"G\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(1, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"g\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinLowercase)\r\n{\r\n\tconst char* c = \"y\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(1, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"y\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinUnaffected)\r\n{\r\n\tconst char* c = \"@\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(1, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"@\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinAmountOfBytes)\r\n{\r\n\tconst char* c = \"Playable\";\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(8, utf8tolower(c, strlen(c), nullptr, 0, &errors));\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinNotEnoughSpace)\r\n{\r\n\tconst char* c = \"VERY important\";\r\n\tconst size_t s = 9;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(8, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"very imp\", b);\r\n\tEXPECT_EQ(UTF8_ERR_NOT_ENOUGH_SPACE, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytes)\r\n{\r\n\tconst char* c = \"Rac\\xC3\\x88r\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(6, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"rac\\xC3\\xA8r\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesUppercase)\r\n{\r\n\tconst char* c = \"\\xC3\\x82\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(2, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xC3\\xA2\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesLowercase)\r\n{\r\n\tconst char* c = \"\\xC3\\xA7\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(2, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xC3\\xA7\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesUnaffected)\r\n{\r\n\tconst char* c = \"\\xC3\\xB7\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(2, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xC3\\xB7\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesAmountOfBytes)\r\n{\r\n\tconst char* c = \"\\xC3\\x8Dnteresting\";\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(12, utf8tolower(c, strlen(c), nullptr, 0, &errors));\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesNotEnoughSpace)\r\n{\r\n\tconst char* c = \"Atl\\xC3\\x84ntis\";\r\n\tconst size_t s = 4;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"atl\", b);\r\n\tEXPECT_EQ(UTF8_ERR_NOT_ENOUGH_SPACE, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytes)\r\n{\r\n\tconst char* c = \"You're number \\xE2\\x85\\xA0\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(17, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"you're number \\xE2\\x85\\xB0\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesUppercase)\r\n{\r\n\tconst char* c = \"\\xE2\\x85\\xAF\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xE2\\x85\\xBF\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesLowercase)\r\n{\r\n\tconst char* c = \"\\xE2\\x85\\xB6\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xE2\\x85\\xB6\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesUnaffected)\r\n{\r\n\tconst char* c = \"\\xE2\\x86\\x89\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xE2\\x86\\x89\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesAmountOfBytes)\r\n{\r\n\tconst char* c = \"That's \\xE2\\x93\\xA9\" \"any\";\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(13, utf8tolower(c, strlen(c), nullptr, 0, &errors));\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesNotEnoughSpace)\r\n{\r\n\tconst char* c = \"Whole Lotta \\xE2\\x93\\xA1osie\";\r\n\tconst size_t s = 14;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(12, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"whole lotta \", b);\r\n\tEXPECT_EQ(UTF8_ERR_NOT_ENOUGH_SPACE, errors);\r\n}\r\n\r\nTEST(ToLower, InvalidData)\r\n{\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(0, utf8tolower(nullptr, 1, nullptr, 0, &errors));\r\n\tEXPECT_EQ(UTF8_ERR_INVALID_DATA, errors);\r\n}<commit_msg>suite-tolower: Added tests for four-byte codepoints.<commit_after>#include \"tests-base.hpp\"\r\n\r\n#include \"utf8rewind.h\"\r\n\r\n#include \"helpers-strings.hpp\"\r\n\r\nTEST(ToLower, BasicLatin)\r\n{\r\n\tconst char* c = \"Hello World!\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(12, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"hello world!\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinUppercase)\r\n{\r\n\tconst char* c = \"G\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(1, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"g\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinLowercase)\r\n{\r\n\tconst char* c = \"y\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(1, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"y\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinUnaffected)\r\n{\r\n\tconst char* c = \"@\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(1, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"@\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinAmountOfBytes)\r\n{\r\n\tconst char* c = \"Playable\";\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(8, utf8tolower(c, strlen(c), nullptr, 0, &errors));\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, BasicLatinNotEnoughSpace)\r\n{\r\n\tconst char* c = \"VERY important\";\r\n\tconst size_t s = 9;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(8, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"very imp\", b);\r\n\tEXPECT_EQ(UTF8_ERR_NOT_ENOUGH_SPACE, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytes)\r\n{\r\n\tconst char* c = \"Rac\\xC3\\x88r\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(6, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"rac\\xC3\\xA8r\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesUppercase)\r\n{\r\n\tconst char* c = \"\\xC3\\x82\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(2, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xC3\\xA2\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesLowercase)\r\n{\r\n\tconst char* c = \"\\xC3\\xA7\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(2, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xC3\\xA7\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesUnaffected)\r\n{\r\n\tconst char* c = \"\\xC3\\xB7\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(2, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xC3\\xB7\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesAmountOfBytes)\r\n{\r\n\tconst char* c = \"\\xC3\\x8Dnteresting\";\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(12, utf8tolower(c, strlen(c), nullptr, 0, &errors));\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, TwoBytesNotEnoughSpace)\r\n{\r\n\tconst char* c = \"Atl\\xC3\\x84ntis\";\r\n\tconst size_t s = 4;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"atl\", b);\r\n\tEXPECT_EQ(UTF8_ERR_NOT_ENOUGH_SPACE, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytes)\r\n{\r\n\tconst char* c = \"You're number \\xE2\\x85\\xA0\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(17, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"you're number \\xE2\\x85\\xB0\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesUppercase)\r\n{\r\n\tconst char* c = \"\\xE2\\x85\\xAF\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xE2\\x85\\xBF\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesLowercase)\r\n{\r\n\tconst char* c = \"\\xE2\\x85\\xB6\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xE2\\x85\\xB6\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesUnaffected)\r\n{\r\n\tconst char* c = \"\\xE2\\x86\\x89\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xE2\\x86\\x89\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesAmountOfBytes)\r\n{\r\n\tconst char* c = \"That's \\xE2\\x93\\xA9\" \"any\";\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(13, utf8tolower(c, strlen(c), nullptr, 0, &errors));\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, ThreeBytesNotEnoughSpace)\r\n{\r\n\tconst char* c = \"Whole Lotta \\xE2\\x93\\xA1osie\";\r\n\tconst size_t s = 14;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(12, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"whole lotta \", b);\r\n\tEXPECT_EQ(UTF8_ERR_NOT_ENOUGH_SPACE, errors);\r\n}\r\n\r\nTEST(ToLower, FourBytes)\r\n{\r\n\tconst char* c = \"Bring a t\\xF0\\x91\\xA2\\xA9wel\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(16, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"bring a t\\xF0\\x91\\xA3\\x89wel\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, FourBytesUppercase)\r\n{\r\n\tconst char* c = \"\\xF0\\x91\\xA2\\xB2\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(4, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xF0\\x91\\xA3\\x92\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, FourBytesLowercase)\r\n{\r\n\tconst char* c = \"\\xF0\\x90\\x90\\xB6\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(4, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xF0\\x90\\x90\\xB6\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, FourBytesUnaffected)\r\n{\r\n\tconst char* c = \"\\xF0\\x91\\xA3\\xA4\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(4, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xF0\\x91\\xA3\\xA4\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, FourBytesAmountOfBytes)\r\n{\r\n\tconst char* c = \"Say \\xF0\\x91\\xA2\\xB9\";\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(8, utf8tolower(c, strlen(c), nullptr, 0, &errors));\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, FourBytesNotEnoughSpace)\r\n{\r\n\tconst char* c = \"My \\xF0\\x91\\xA3\\x8Eurt\";\r\n\tconst size_t s = 5;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"my \", b);\r\n\tEXPECT_EQ(UTF8_ERR_NOT_ENOUGH_SPACE, errors);\r\n}\r\n\r\nTEST(ToLower, InvalidCodepoint)\r\n{\r\n\tconst char* c = \"\\xF0\\x92\";\r\n\tconst size_t s = 256;\r\n\tchar b[s] = { 0 };\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(3, utf8tolower(c, strlen(c), b, s - 1, &errors));\r\n\tEXPECT_UTF8EQ(\"\\xEF\\xBF\\xBD\", b);\r\n\tEXPECT_EQ(0, errors);\r\n}\r\n\r\nTEST(ToLower, InvalidData)\r\n{\r\n\tint32_t errors = 0;\r\n\r\n\tEXPECT_EQ(0, utf8tolower(nullptr, 1, nullptr, 0, &errors));\r\n\tEXPECT_EQ(UTF8_ERR_INVALID_DATA, errors);\r\n}<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode:C++; -*- *\/\n\/* MyThOS: The Many-Threads Operating System\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 * Copyright 2016 Randolf Rotta, Robert Kuban, and contributors, BTU Cottbus-Senftenberg\n *\/\n#pragma once\n\n#include <atomic>\n#include \"async\/Place.hh\"\n#include \"async\/Tasklet.hh\"\n#include \"async\/mlog.hh\"\n\nnamespace mythos {\nnamespace async {\n\nclass DeletionMonitor\n{\npublic:\n  DeletionMonitor() : refcount(0), deleteTask(nullptr) {}\n\n  void acquireRef() { refcount++; }\n\n  void releaseRef() {\n    auto result = refcount.fetch_sub(1);\n    if (result == 0 && deleteTask != nullptr) {\n      MLOG_DETAIL(mlog::async, this, \"schedule delete task\");\n      getLocalPlace().pushShared(deleteTask);\n    }\n  }\n\n  template<class FUNCTOR>\n  void doDelete(Tasklet* msg, FUNCTOR fun) {\n    refcount++;\n    deleteTask = msg->set(fun);\n    if (--refcount == 0) {\n      MLOG_DETAIL(mlog::async, this, \"schedule delete task immediately\");\n      getLocalPlace().pushShared(deleteTask);\n    }\n  }\n\nprotected:\n  std::atomic<size_t> refcount;\n  std::atomic<Tasklet*> deleteTask;\n};\n\n} \/\/ async\n} \/\/mythos\n\n<commit_msg>Fixed off-by-one error in reference counter.<commit_after>\/* -*- mode:C++; -*- *\/\n\/* MyThOS: The Many-Threads Operating System\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 * Copyright 2016 Randolf Rotta, Robert Kuban, and contributors, BTU Cottbus-Senftenberg\n *\/\n#pragma once\n\n#include <atomic>\n#include \"async\/Place.hh\"\n#include \"async\/Tasklet.hh\"\n#include \"async\/mlog.hh\"\n\nnamespace mythos {\nnamespace async {\n\nclass DeletionMonitor\n{\npublic:\n  DeletionMonitor() : refcount(0), deleteTask(nullptr) {}\n\n  void acquireRef() { refcount++; }\n\n  void releaseRef() {\n    auto result = --refcount;\n    if (result == 0 && deleteTask != nullptr) {\n      MLOG_DETAIL(mlog::async, this, \"schedule delete task\");\n      getLocalPlace().pushShared(deleteTask);\n    }\n  }\n\n  template<class FUNCTOR>\n  void doDelete(Tasklet* msg, FUNCTOR fun) {\n    refcount++;\n    deleteTask = msg->set(fun);\n    if (--refcount == 0) {\n      MLOG_DETAIL(mlog::async, this, \"schedule delete task immediately\");\n      getLocalPlace().pushShared(deleteTask);\n    }\n  }\n\nprotected:\n  std::atomic<size_t> refcount;\n  std::atomic<Tasklet*> deleteTask;\n};\n\n} \/\/ async\n} \/\/mythos\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by salmon on 17-1-6.\n\/\/\n\n#include <gtest\/gtest.h>\n#include <complex>\n#include <iostream>\n#include \"simpla\/SIMPLA_config.h\"\n#include \"simpla\/data\/Data.h\"\n#include \"simpla\/utilities\/FancyStream.h\"\n#include \"simpla\/utilities\/SingletonHolder.h\"\n\nusing namespace simpla;\nusing namespace simpla::data;\nTEST(DataTable, memory) {\n    auto db = DataNode::New();\n\n    *(*db)[\"CartesianGeometry\"] = {\"hello world!\"};\n    *(*db)[\"d\"] = {1, 2, 3, 4, 5, 56, 6, 6};\n    (*db)[\"g\"]->SetValue<nTuple<int, 2, 2, 2>>({{{1, 2}, {3, 4}}, {{5, 5}, {6, 6}}});\n    \/\/    *(*db)[\"strlist\"] = {{\"abc\", \"def\"}, {\"abc\", \"def\"}, {\"abc\", \"def\"}, {\"abc\", \"def\"}};\n    *(*db)[\"b\/a\"] = (5);\n\n    *(*db)[\"\/b\/sub\/1\/2\/3\/4\/d\/123456\"] = {1, 2, 3};\n\n    *(*db)[\"\/b\/sub\/c\"] += {5, 6, 7, 8};\n    *(*db)[\"\/b\/sub\/c\"] += {1, 5, 3, 4};\n    *(*db)[\"\/b\/sub\/c\"] += {2, 5, 3, 4};\n    *(*db)[\"\/b\/sub\/c\"] += {3, 5, 3, 4};\n    *(*db)[\"\/b\/sub\/c\"] += {4, 5, 3, 4};\n\n    \/\/    db->AddValue(\"\/b\/sub\/d\", 1);\n    \/\/    db->AddValue(\"\/b\/sub\/d\", 5);\n    \/\/    db->AddValue(\"\/b\/sub\/d\", 5);\n    \/\/    db->AddValue(\"\/b\/sub\/d\", 5);\n    \/\/    \/\/\n    *(*db)[\"\/b\/sub\/d\"] += \"wa wa\";\n    *(*db)[\"\/b\/sub\/d\"] += \"la la\";\n\n    *(*db)[\"\/b\/sub\/a\"] += {3, 5, 3, 4};\n    *(*db)[\"\/b\/sub\/a\"] += {3, 5, 3, 4};\n\n    *(*db)[\"\/b\/sub\/e\"] = {1, 2, 3, 4};\n    *(*db)[\"\/b\/sub\/e\"] += 9;\n\n    *(*db)[\"a\"] += {\"a\"_, \"not_debug\"_ = false, \"g\"_ = {1, 2, 3, 4, 5, 5, 6, 6},\n                    \"c\"_ = {\" world!\", \"hello!\", \"hello !\", \"hello!\", \"hello !\", \"hello !\", \"hello !\", \"hello!\"}};\n    \/\/    *(*db)[\"h\"] = {{\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}};\n    *(*db)[\"i\"] = {\"default\"_, \"abc\"_ = 1, \"abc\"_ = \"def\", \"abc\"_ = 2, \"abc\"_ = \"sadfsdf\"};\n    *(*db)[\"i\"] += {\"abc\"_ = {\"abc1\"_ = {\"def\"_ = {\"abc\"_ = {\"abc\"_ = \"sadfsdf\"}}}}};\n    LOGGER << db->GetNumberOfChildren() << std::endl;\n    LOGGER << \"db: \" << (*db) << std::endl;\n    EXPECT_EQ(db->GetNode(\"b\/a\")->as<int>(), 5);\n\n    EXPECT_EQ((*db)[\"\/CartesianGeometry\"]->as<std::string>(), \"hello world!\");\n}\n\nTEST(DataTable, lua) {\n    auto db = DataNode::New(\"lua:\/\/\");\n    db->Parse(\n        \"PI = 3.141592653589793\\n\"\n        \"Context = {\\n\"\n        \"    c = 299792458.0, -- m\/s\\n\"\n        \"    qe = 1.60217656e-19, -- C\\n\"\n        \"    me = 9.10938291e-31, --kg\\n\"\n        \"    mp = 1.672621777e-27, --kg\\n\"\n        \"    mp_me = 1836.15267245, --\\n\"\n        \"    KeV = 1.1604e7, -- K\\n\"\n        \"    Tesla = 1.0, -- Tesla\\n\"\n        \"    TWOPI = PI * 2,\\n\"\n        \"    k_B = 1.3806488e-23, --Boltzmann_constant\\n\"\n        \"    epsilon0 = 8.8542e-12,\\n\"\n        \"    AAA = { c =  3 , d = { c = \\\"3\\\", e = { 1, 3, 4, 5 } } },\\n\"\n        \"    CCC = { 1, 3, 4, 5 }\\n\"\n        \"}\");\n    LOGGER << \"lua:\/\/ \" << *(*db)[\"\/Context\"] << std::endl;\n    EXPECT_EQ((*db)[\"\/Context\/AAA\/c\"]->as<int>(), 3);\n    \/\/    EXPECT_EQ(((*db)[\"\/Context\/CCC\"]->as<nTuple<int, 4>>()), (nTuple<int, 4>{1, 3, 4, 5}));\n\n    EXPECT_DOUBLE_EQ((*db)[\"\/Context\/c\"]->as<double>(), 299792458);\n\n    \/\/   db->Set(\"box\", {{1, 2, 3}, {4, 5, 6}});\n    \/\/    LOGGER << \"box  = \" <<db->Get<std::tuple<nTuple<int, 3>, nTuple<int, 3>>>(\"box\") << std::endl;\n}\n\/\/\n\/\/ TEST(DataTable, samrai) {\n\/\/    logger::set_stdout_level(1000);\n\/\/\n\/\/    LOGGER << \"Registered DataBase: \" << GLOBAL_DATA_BACKEND_FACTORY.GetBackendList() << std::endl;\n\/\/    DataTable db(\"samrai:\/\/\");\n\/\/    \/\/   db->Set(\"f\", {1, 2, 3, 4, 5, 56, 6, 6});\n\/\/    \/\/   db->Set(\"\/d\/e\/f\", \"Just atest\");\n\/\/    \/\/   db->Set(\"\/d\/e\/g\", {\"a\"_ = \"la la land\", \"b\"_ = 1235.5});\n\/\/    \/\/   db->Set(\"\/d\/e\/e\", 1.23456);\n\/\/   db->Set(\"box\", {{1, 2, 3}, {4, 5, 6}});\n\/\/    LOGGER << *db.database() << std::endl;\n\/\/    LOGGER << \"box  = \" <<db->Get<std::tuple<nTuple<int, 3>, nTuple<int, 3>>>(\"box\") << std::endl;\n\/\/\n\/\/}\n\/\/\n\/\/ TEST(DataTable, hdf5) {\n\/\/    logger::set_stdout_level(1000);\n\/\/\n\/\/    \/\/    LOGGER << \"Registered DataBase: \" << GLOBAL_DATA_BACKEND_FACTORY.GetBackendList() << std::endl;\n\/\/    auto db = DataBase::New(\"test.h5\");\n\/\/    db->Set(\"pi\", 3.1415926);\n\/\/    db->Set(\"a\", \"just a test\");\n\/\/    \/\/   db->Set(\"c\", {1.2346, 4.0, 5.0, 6.0, 6.1});\n\/\/    \/\/   db->Set({\"a\"_, \"not_debug\"_ = false, \"g\"_ = {1, 2, 3, 4, 5, 5, 6, 6},\n\/\/    \/\/                 \"c\"_ = {\" world!\", \"hello!\", \"hello !\", \"hello!\", \"hello !\", \"hello !\", \"hello !\",\n\/\/    \"hello!\"}});\n\/\/    \/\/   db->Set(\"h\", {{\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}});\n\/\/    db->Set(\"i\", {\"abc\"_ = 1, \"abc\"_ = \"def\", \"abc\"_ = 2, \"abc\"_ = \"sadfsdf\"});\n\/\/    db->Set(\"j\", {\"abc\"_ = {\"abc\"_ = {\"def\"_ = {\"abc\"_ = {\"abc\"_ = \"sadfsdf\"}}}}});\n\/\/    \/\/   db->AddValue(\"\/b\/sub\/d\", {1, 2});\n\/\/    \/\/   db->AddValue(\"\/b\/sub\/d\", 5);\n\/\/    \/\/   db->AddValue(\"\/b\/sub\/d\", 5);\n\/\/    \/\/   db->AddValue(\"\/b\/sub\/d\", 5);\n\/\/\n\/\/    \/\/   db->Set(\"\/b\/sub\/a\", {3, 5, 3, 4});\n\/\/    db->Set(\"\/b\/sub\/b\", 9);\n\/\/    LOGGER << \"h5:\/\/ \" << db << std::endl;\n\/\/    db->Set(\"box\", {{1, 2, 3}, {4, 5, 6}});\n\/\/    LOGGER << \"box  = \" << db->Get<std::tuple<nTuple<int, 3>, nTuple<int, 3>>>(\"box\") << std::endl;\n\/\/}<commit_msg> snapshot<commit_after>\/\/\n\/\/ Created by salmon on 17-1-6.\n\/\/\n\n#include <gtest\/gtest.h>\n#include <complex>\n#include <iostream>\n#include \"simpla\/SIMPLA_config.h\"\n#include \"simpla\/data\/Data.h\"\n#include \"simpla\/utilities\/FancyStream.h\"\n#include \"simpla\/utilities\/SingletonHolder.h\"\n\nusing namespace simpla;\nusing namespace simpla::data;\nTEST(DataTable, memory) {\n    auto db = DataNode::New();\n\n    *(*db)[\"CartesianGeometry\"] = {\"hello world!\"};\n    *(*db)[\"d\"] = {1, 2, 3, 4, 5, 56, 6, 6};\n    (*db)[\"g\"]->SetValue<nTuple<int, 2, 2, 2>>({{{1, 2}, {3, 4}}, {{5, 5}, {6, 6}}});\n    \/\/    *(*db)[\"strlist\"] = {{\"abc\", \"def\"}, {\"abc\", \"def\"}, {\"abc\", \"def\"}, {\"abc\", \"def\"}};\n    *(*db)[\"b\/a\"] = (5);\n\n    *(*db)[\"\/b\/sub\/1\/2\/3\/4\/d\/123456\"] = {1, 2, 3};\n\n    *(*db)[\"\/b\/sub\/c\"] += {5, 6, 7, 8};\n    *(*db)[\"\/b\/sub\/c\"] += {1, 5, 3, 4};\n    *(*db)[\"\/b\/sub\/c\"] += {2, 5, 3, 4};\n    *(*db)[\"\/b\/sub\/c\"] += {3, 5, 3, 4};\n    *(*db)[\"\/b\/sub\/c\"] += {4, 5, 3, 4};\n\n    \/\/    db->AddValue(\"\/b\/sub\/d\", 1);\n    \/\/    db->AddValue(\"\/b\/sub\/d\", 5);\n    \/\/    db->AddValue(\"\/b\/sub\/d\", 5);\n    \/\/    db->AddValue(\"\/b\/sub\/d\", 5);\n    \/\/    \/\/\n    *(*db)[\"\/b\/sub\/d\"] += \"wa wa\";\n    *(*db)[\"\/b\/sub\/d\"] += \"la la\";\n\n    *(*db)[\"\/b\/sub\/a\"] += {0, 1, 2, 3};\n    *(*db)[\"\/b\/sub\/a\"] += {3, 5, 3, 4};\n\n    *(*db)[\"\/b\/sub\/e\"] = {1, 2, 3, 4};\n    *(*db)[\"\/b\/sub\/e\"] += 9;\n\n    *(*db)[\"a\"] += {\"a\"_, \"not_debug\"_ = false, \"g\"_ = {1, 2, 3, 4, 5, 5, 6, 6},\n                    \"c\"_ = {\" world!\", \"hello!\", \"hello !\", \"hello!\", \"hello !\", \"hello !\", \"hello !\", \"hello!\"}};\n    \/\/    *(*db)[\"h\"] = {{\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}};\n    *(*db)[\"i\"] = {\"default\"_, \"abc\"_ = 1, \"abc\"_ = \"def\", \"abc\"_ = 2, \"abc\"_ = \"sadfsdf\"};\n    *(*db)[\"i\"] += {\"abc\"_ = {\"abc1\"_ = {\"def\"_ = {\"abc\"_ = {\"abc\"_ = \"sadfsdf\"}}}}};\n    MESSAGE << \"db: \" << (*db) << std::endl;\n    EXPECT_EQ(db->GetNode(\"\/b\/sub\/d\")->GetNumberOfChildren(), 2);\n    EXPECT_EQ(db->GetNode(\"b\/a\")->as<int>(), 5);\n    EXPECT_TRUE(db->Check(\"a\/a\"));\n    EXPECT_FALSE(db->Check(\"a\/not_debug\"));\n\n    EXPECT_EQ((db->GetNode(\"\/b\/sub\/a\/1\")->as<nTuple<int, 4>>()), (nTuple<int, 4>{3, 5, 3, 4}));\n\n    EXPECT_EQ((*db)[\"\/CartesianGeometry\"]->as<std::string>(), \"hello world!\");\n}\n\nTEST(DataTable, lua) {\n    auto db = DataNode::New(\"lua:\/\/\");\n    db->Parse(\n        \"PI = 3.141592653589793\\n\"\n        \"Context = {\\n\"\n        \"    c = 299792458.0, -- m\/s\\n\"\n        \"    qe = 1.60217656e-19, -- C\\n\"\n        \"    me = 9.10938291e-31, --kg\\n\"\n        \"    mp = 1.672621777e-27, --kg\\n\"\n        \"    mp_me = 1836.15267245, --\\n\"\n        \"    KeV = 1.1604e7, -- K\\n\"\n        \"    Tesla = 1.0, -- Tesla\\n\"\n        \"    TWOPI = PI * 2,\\n\"\n        \"    k_B = 1.3806488e-23, --Boltzmann_constant\\n\"\n        \"    epsilon0 = 8.8542e-12,\\n\"\n        \"    AAA = { c =  3 , d = { c = \\\"3\\\", e = { 1, 3, 4, 5 } } },\\n\"\n        \"    CCC = { 1, 3, 4, 5 }\\n\"\n        \"}\");\n    MESSAGE << \"lua:\/\/ \" << *(*db)[\"\/Context\"] << std::endl;\n    EXPECT_EQ((*db)[\"\/Context\/AAA\/c\"]->as<int>(), 3);\n    \/\/    EXPECT_EQ(((*db)[\"\/Context\/CCC\"]->as<nTuple<int, 4>>()), (nTuple<int, 4>{1, 3, 4, 5}));\n\n    EXPECT_DOUBLE_EQ((*db)[\"\/Context\/c\"]->as<double>(), 299792458);\n\n    \/\/   db->Set(\"box\", {{1, 2, 3}, {4, 5, 6}});\n    \/\/    LOGGER << \"box  = \" <<db->Get<std::tuple<nTuple<int, 3>, nTuple<int, 3>>>(\"box\") << std::endl;\n}\n\/\/\n\/\/ TEST(DataTable, samrai) {\n\/\/    logger::set_stdout_level(1000);\n\/\/\n\/\/    LOGGER << \"Registered DataBase: \" << GLOBAL_DATA_BACKEND_FACTORY.GetBackendList() << std::endl;\n\/\/    DataTable db(\"samrai:\/\/\");\n\/\/    \/\/   db->Set(\"f\", {1, 2, 3, 4, 5, 56, 6, 6});\n\/\/    \/\/   db->Set(\"\/d\/e\/f\", \"Just atest\");\n\/\/    \/\/   db->Set(\"\/d\/e\/g\", {\"a\"_ = \"la la land\", \"b\"_ = 1235.5});\n\/\/    \/\/   db->Set(\"\/d\/e\/e\", 1.23456);\n\/\/   db->Set(\"box\", {{1, 2, 3}, {4, 5, 6}});\n\/\/    LOGGER << *db.database() << std::endl;\n\/\/    LOGGER << \"box  = \" <<db->Get<std::tuple<nTuple<int, 3>, nTuple<int, 3>>>(\"box\") << std::endl;\n\/\/\n\/\/}\n\/\/\n\/\/ TEST(DataTable, hdf5) {\n\/\/    logger::set_stdout_level(1000);\n\/\/\n\/\/    \/\/    LOGGER << \"Registered DataBase: \" << GLOBAL_DATA_BACKEND_FACTORY.GetBackendList() << std::endl;\n\/\/    auto db = DataBase::New(\"test.h5\");\n\/\/    db->Set(\"pi\", 3.1415926);\n\/\/    db->Set(\"a\", \"just a test\");\n\/\/    \/\/   db->Set(\"c\", {1.2346, 4.0, 5.0, 6.0, 6.1});\n\/\/    \/\/   db->Set({\"a\"_, \"not_debug\"_ = false, \"g\"_ = {1, 2, 3, 4, 5, 5, 6, 6},\n\/\/    \/\/                 \"c\"_ = {\" world!\", \"hello!\", \"hello !\", \"hello!\", \"hello !\", \"hello !\", \"hello !\",\n\/\/    \"hello!\"}});\n\/\/    \/\/   db->Set(\"h\", {{\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}, {\"abc\"_ = \"def\"}});\n\/\/    db->Set(\"i\", {\"abc\"_ = 1, \"abc\"_ = \"def\", \"abc\"_ = 2, \"abc\"_ = \"sadfsdf\"});\n\/\/    db->Set(\"j\", {\"abc\"_ = {\"abc\"_ = {\"def\"_ = {\"abc\"_ = {\"abc\"_ = \"sadfsdf\"}}}}});\n\/\/    \/\/   db->AddValue(\"\/b\/sub\/d\", {1, 2});\n\/\/    \/\/   db->AddValue(\"\/b\/sub\/d\", 5);\n\/\/    \/\/   db->AddValue(\"\/b\/sub\/d\", 5);\n\/\/    \/\/   db->AddValue(\"\/b\/sub\/d\", 5);\n\/\/\n\/\/    \/\/   db->Set(\"\/b\/sub\/a\", {3, 5, 3, 4});\n\/\/    db->Set(\"\/b\/sub\/b\", 9);\n\/\/    LOGGER << \"h5:\/\/ \" << db << std::endl;\n\/\/    db->Set(\"box\", {{1, 2, 3}, {4, 5, 6}});\n\/\/    LOGGER << \"box  = \" << db->Get<std::tuple<nTuple<int, 3>, nTuple<int, 3>>>(\"box\") << std::endl;\n\/\/}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2016 Andrew Helge Cox\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\/\/ Class include:\n#include \"window-platform.h\"\n\n\/\/ Internal includes:\n#include \"application.h\"\n\n\/\/ External includes:\n#include \"krust\/public-api\/scoped-free.h\"\n#include \"krust\/public-api\/logging.h\"\n#include <string.h>\n\nnamespace Krust {\n\nnamespace IO {\n\n\/**\n * @brief A helper struct to init a values array to be passed to XCB.\n *\/\nstruct XcbValueList\n{\n  XcbValueList()\n  {\n    \/\/ Zero the values array in the absence of documentation for how\n    \/\/ the list must be terminated:\n    memset(values, 0, sizeof(values[0]) * 32);\n  }\n\n  \/\/ Have a nice long list of values in the absence of documentation for how\n  \/\/ long the list must be:\n  uint32_t values[32];\n};\n\nWindowPlatform::WindowPlatform(\n  Krust::IO::Application& application,\n  Krust::IO::Window& container,\n  const char* title) :\n    mApplication(application),\n    mDeleteWindowEventAtom(0)\n{\n  KRUST_LOG_INFO << \"WindowPlatform created.\\n\";\n  suppress_unused(&container, &title); \/\/\/@ToDo: Set the window title through XCB\n\n  \/\/ Create the X11 window:\n  KRUST_ASSERT1(Connection(), \"Null connection.\");\n  if(Connection())\n  {\n    mXcbWindow = xcb_generate_id(Connection());\n    KRUST_ASSERT1(mXcbWindow, \"No window id.\");\n    if(!mXcbWindow)\n    {\n      KRUST_LOG_ERROR << \"Failed to generate window ID.\" << endlog;\n    }\n    else\n    {\n      const uint32_t  mask =\n          \/\/ Not sure having this background is a good idea for Vulkan:\n          XCB_CW_BACK_PIXEL |\n          XCB_CW_EVENT_MASK;\n      XcbValueList values;\n      values.values[0] = Screen()->black_pixel;\n      values.values[1] =\n        XCB_EVENT_MASK_EXPOSURE         |\n        XCB_EVENT_MASK_STRUCTURE_NOTIFY |\n        XCB_EVENT_MASK_FOCUS_CHANGE     |\n        \/\/ The app should control which of these are subscribed to:\n        XCB_EVENT_MASK_BUTTON_PRESS     | XCB_EVENT_MASK_BUTTON_RELEASE |\n        XCB_EVENT_MASK_POINTER_MOTION   |\n        XCB_EVENT_MASK_ENTER_WINDOW     | XCB_EVENT_MASK_LEAVE_WINDOW   |\n        XCB_EVENT_MASK_KEY_PRESS        | XCB_EVENT_MASK_KEY_RELEASE\n      ;\n\n      \/\/ Calculate a reasonable width and height:\n      \/\/ Note in multimonitor setups this screen is likely the whole virtual\n      \/\/ screen encompassing both monitors. We should really figure out the\n      \/\/ primary monitor and size ourself to fit onto that:\n      \/\/ https:\/\/stackoverflow.com\/questions\/36966900\/xcb-get-all-monitors-ands-their-x-y-coordinates\n      const unsigned windowClientWidth  = std::min(1800u, Screen()->width_in_pixels  \/ 4u * 3u);\n      const unsigned windowClientHeight = std::min(windowClientWidth * 100000 \/ 177778,  Screen()->height_in_pixels \/ 4u * 3u);\n      KRUST_LOG_INFO << \"windowClientWidth: \"  << windowClientWidth  << '.' << endlog;\n      KRUST_LOG_INFO << \"windowClientHeight: \" << windowClientHeight << '.' << endlog;\n      mWidth = windowClientWidth;\n      mHeight = windowClientHeight;\n\n      xcb_create_window(Connection(),\n          XCB_COPY_FROM_PARENT, \/\/\/< Depth\n          mXcbWindow,\n          Screen()->root, \/\/\/< Parent to root of screen\n          0, \/\/\/< X\n          0, \/\/\/< Y\n          windowClientWidth, \/\/\/< Width\n          windowClientHeight, \/\/\/< Height\n          0, \/\/\/< Border\n          XCB_WINDOW_CLASS_INPUT_OUTPUT, \/\/\/< Class\n          Screen()->root_visual, \/\/\/> Visual\n          mask, values.values );\n\n      \/\/ Setup the window to receive window close events:\n      \/\/ (see: http:\/\/tronche.com\/gui\/x\/icccm\/sec-4.html#s-4.1.2.7 )\n\n      \/\/ We need to specify window properties using X11 Atoms which are interned\n      \/\/ strings, so lets get the atoms we need (WM_PROTOCOLS, WM_DELETE_WINDOW):\n      const xcb_intern_atom_cookie_t wm_protocols_cookie =\n          xcb_intern_atom(Connection(), 1, sizeof(\"WM_PROTOCOLS\")-1, \"WM_PROTOCOLS\");\n      const xcb_intern_atom_cookie_t wm_delete_window_cookie =\n          xcb_intern_atom(Connection(), 0, sizeof(\"WM_DELETE_WINDOW\")-1, \"WM_DELETE_WINDOW\");\n      xcb_generic_error_t* wm_protocols_error = 0;\n      xcb_intern_atom_reply_t* wm_protocols_reply = xcb_intern_atom_reply(Connection(), wm_protocols_cookie, &wm_protocols_error);\n      ScopedFree free_wm_protocols_reply(wm_protocols_reply);\n      xcb_generic_error_t* wm_delete_window_error = 0;\n      xcb_intern_atom_reply_t* wm_delete_window_reply = xcb_intern_atom_reply(Connection(), wm_delete_window_cookie, &wm_delete_window_error);\n      ScopedFree free_wm_delete_window_reply(wm_delete_window_reply);\n      mDeleteWindowEventAtom = wm_delete_window_reply->atom;\n\n      \/\/ Finally append the WM_DELETE_WINDOW atom to the WM_PROTOCOLS property of the\n      \/\/ window so client message events will be sent:\n      xcb_change_property(\n        Connection(),\n        XCB_PROP_MODE_APPEND, \/\/\/ XCB_PROP_MODE_REPLACE\n        mXcbWindow,\n        wm_protocols_reply->atom,\n        XCB_ATOM_ATOM\/*4*\/, sizeof(mDeleteWindowEventAtom) * 8, 1,\n        &mDeleteWindowEventAtom\n      );\n\n      \/\/ Set the title of the window:\n      if(title && *title)\n      {\n      \/\/xcb_void_cookie_t title_cookie =\n      xcb_change_property(\n        Connection(),\n        XCB_PROP_MODE_REPLACE,\n        mXcbWindow,\n        XCB_ATOM_WM_NAME,\n        XCB_ATOM_STRING,\n        8,\n        strlen(title),\n        title);\n      }\n\n      \/\/ Show the window:\n      xcb_map_window(Connection(), mXcbWindow);\n\n      \/\/ Position the window centred in screen:\n      const uint32_t winXY[] = { (windowClientWidth \/ 3) \/ 2, (windowClientHeight \/ 3) \/ 2 };\n      xcb_configure_window(Connection(), mXcbWindow, XCB_CONFIG_WINDOW_X | XCB_CONFIG_WINDOW_Y, winXY);\n\n      \/\/ Sync:\n      xcb_flush(Connection());\n    }\n  }\n}\n\nWindowPlatform::~WindowPlatform() {\n  KRUST_LOG_INFO << \"WindowPlatform destroyed.\\n\";\n}\n\nxcb_connection_t* WindowPlatform::Connection() const {\n  return mApplication.mPlatformApplication.mXcbConnection;\n}\n\nxcb_screen_t* WindowPlatform::Screen() const {\n  return mApplication.mPlatformApplication.mXcbScreen;\n}\n\n} \/* namespace Krust::IO *\/\n\n} \/* namespace Krust *\/\n<commit_msg>Window 1280x800 or less.<commit_after>\/\/ Copyright (c) 2016 Andrew Helge Cox\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\/\/ Class include:\n#include \"window-platform.h\"\n\n\/\/ Internal includes:\n#include \"application.h\"\n\n\/\/ External includes:\n#include \"krust\/public-api\/scoped-free.h\"\n#include \"krust\/public-api\/logging.h\"\n#include <string.h>\n\nnamespace Krust {\n\nnamespace IO {\n\n\/**\n * @brief A helper struct to init a values array to be passed to XCB.\n *\/\nstruct XcbValueList\n{\n  XcbValueList()\n  {\n    \/\/ Zero the values array in the absence of documentation for how\n    \/\/ the list must be terminated:\n    memset(values, 0, sizeof(values[0]) * 32);\n  }\n\n  \/\/ Have a nice long list of values in the absence of documentation for how\n  \/\/ long the list must be:\n  uint32_t values[32];\n};\n\nWindowPlatform::WindowPlatform(\n  Krust::IO::Application& application,\n  Krust::IO::Window& container,\n  const char* title) :\n    mApplication(application),\n    mDeleteWindowEventAtom(0)\n{\n  KRUST_LOG_INFO << \"WindowPlatform created.\\n\";\n  suppress_unused(&container, &title); \/\/\/@ToDo: Set the window title through XCB\n\n  \/\/ Create the X11 window:\n  KRUST_ASSERT1(Connection(), \"Null connection.\");\n  if(Connection())\n  {\n    mXcbWindow = xcb_generate_id(Connection());\n    KRUST_ASSERT1(mXcbWindow, \"No window id.\");\n    if(!mXcbWindow)\n    {\n      KRUST_LOG_ERROR << \"Failed to generate window ID.\" << endlog;\n    }\n    else\n    {\n      const uint32_t  mask =\n          \/\/ Not sure having this background is a good idea for Vulkan:\n          XCB_CW_BACK_PIXEL |\n          XCB_CW_EVENT_MASK;\n      XcbValueList values;\n      values.values[0] = Screen()->black_pixel;\n      values.values[1] =\n        XCB_EVENT_MASK_EXPOSURE         |\n        XCB_EVENT_MASK_STRUCTURE_NOTIFY |\n        XCB_EVENT_MASK_FOCUS_CHANGE     |\n        \/\/ The app should control which of these are subscribed to:\n        XCB_EVENT_MASK_BUTTON_PRESS     | XCB_EVENT_MASK_BUTTON_RELEASE |\n        XCB_EVENT_MASK_POINTER_MOTION   |\n        XCB_EVENT_MASK_ENTER_WINDOW     | XCB_EVENT_MASK_LEAVE_WINDOW   |\n        XCB_EVENT_MASK_KEY_PRESS        | XCB_EVENT_MASK_KEY_RELEASE\n      ;\n\n      \/\/ Calculate a reasonable width and height:\n      \/\/ Note in multimonitor setups this screen is likely the whole virtual\n      \/\/ screen encompassing both monitors. We should really figure out the\n      \/\/ primary monitor and size ourself to fit onto that:\n      \/\/ https:\/\/stackoverflow.com\/questions\/36966900\/xcb-get-all-monitors-ands-their-x-y-coordinates\n      const unsigned windowClientWidth  = std::min(1280u, unsigned(Screen()->width_in_pixels * 0.75f));\n      const unsigned windowClientHeight = std::min(windowClientWidth * 0.625f,  Screen()->height_in_pixels * 0.75f);\n      KRUST_LOG_INFO << \"windowClientWidth: \"  << windowClientWidth  << '.' << endlog;\n      KRUST_LOG_INFO << \"windowClientHeight: \" << windowClientHeight << '.' << endlog;\n      mWidth = windowClientWidth;\n      mHeight = windowClientHeight;\n\n      xcb_create_window(Connection(),\n          XCB_COPY_FROM_PARENT, \/\/\/< Depth\n          mXcbWindow,\n          Screen()->root, \/\/\/< Parent to root of screen\n          0, \/\/\/< X\n          0, \/\/\/< Y\n          windowClientWidth, \/\/\/< Width\n          windowClientHeight, \/\/\/< Height\n          0, \/\/\/< Border\n          XCB_WINDOW_CLASS_INPUT_OUTPUT, \/\/\/< Class\n          Screen()->root_visual, \/\/\/> Visual\n          mask, values.values );\n\n      \/\/ Setup the window to receive window close events:\n      \/\/ (see: http:\/\/tronche.com\/gui\/x\/icccm\/sec-4.html#s-4.1.2.7 )\n\n      \/\/ We need to specify window properties using X11 Atoms which are interned\n      \/\/ strings, so lets get the atoms we need (WM_PROTOCOLS, WM_DELETE_WINDOW):\n      const xcb_intern_atom_cookie_t wm_protocols_cookie =\n          xcb_intern_atom(Connection(), 1, sizeof(\"WM_PROTOCOLS\")-1, \"WM_PROTOCOLS\");\n      const xcb_intern_atom_cookie_t wm_delete_window_cookie =\n          xcb_intern_atom(Connection(), 0, sizeof(\"WM_DELETE_WINDOW\")-1, \"WM_DELETE_WINDOW\");\n      xcb_generic_error_t* wm_protocols_error = 0;\n      xcb_intern_atom_reply_t* wm_protocols_reply = xcb_intern_atom_reply(Connection(), wm_protocols_cookie, &wm_protocols_error);\n      ScopedFree free_wm_protocols_reply(wm_protocols_reply);\n      xcb_generic_error_t* wm_delete_window_error = 0;\n      xcb_intern_atom_reply_t* wm_delete_window_reply = xcb_intern_atom_reply(Connection(), wm_delete_window_cookie, &wm_delete_window_error);\n      ScopedFree free_wm_delete_window_reply(wm_delete_window_reply);\n      mDeleteWindowEventAtom = wm_delete_window_reply->atom;\n\n      \/\/ Finally append the WM_DELETE_WINDOW atom to the WM_PROTOCOLS property of the\n      \/\/ window so client message events will be sent:\n      xcb_change_property(\n        Connection(),\n        XCB_PROP_MODE_APPEND, \/\/\/ XCB_PROP_MODE_REPLACE\n        mXcbWindow,\n        wm_protocols_reply->atom,\n        XCB_ATOM_ATOM\/*4*\/, sizeof(mDeleteWindowEventAtom) * 8, 1,\n        &mDeleteWindowEventAtom\n      );\n\n      \/\/ Set the title of the window:\n      if(title && *title)\n      {\n      \/\/xcb_void_cookie_t title_cookie =\n      xcb_change_property(\n        Connection(),\n        XCB_PROP_MODE_REPLACE,\n        mXcbWindow,\n        XCB_ATOM_WM_NAME,\n        XCB_ATOM_STRING,\n        8,\n        strlen(title),\n        title);\n      }\n\n      \/\/ Show the window:\n      xcb_map_window(Connection(), mXcbWindow);\n\n      \/\/ Position the window centred in screen:\n      const uint32_t winXY[] = { (windowClientWidth \/ 3) \/ 2, (windowClientHeight \/ 3) \/ 2 };\n      xcb_configure_window(Connection(), mXcbWindow, XCB_CONFIG_WINDOW_X | XCB_CONFIG_WINDOW_Y, winXY);\n\n      \/\/ Sync:\n      xcb_flush(Connection());\n    }\n  }\n}\n\nWindowPlatform::~WindowPlatform() {\n  KRUST_LOG_INFO << \"WindowPlatform destroyed.\\n\";\n}\n\nxcb_connection_t* WindowPlatform::Connection() const {\n  return mApplication.mPlatformApplication.mXcbConnection;\n}\n\nxcb_screen_t* WindowPlatform::Screen() const {\n  return mApplication.mPlatformApplication.mXcbScreen;\n}\n\n} \/* namespace Krust::IO *\/\n\n} \/* namespace Krust *\/\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\/\/\n\/\/  W A R N I N G\n\/\/  -------------\n\/\/\n\/\/ This file is not part of the Qt API.  It exists for the convenience\n\/\/ of other Qt classes.  This header file may change from version to\n\/\/ version without notice, or even be removed.\n\/\/\n\/\/ INTERNAL USE ONLY: Do NOT use for any other purpose.\n\/\/\n\n\n#include <windows.h>\n#include <mmsystem.h>\n#include \"qaudiodeviceinfo_win32_p.h\"\n#include <dshow.h>\n\n#if defined(Q_CC_MINGW)\n\nextern GUID CLSID_AudioInputDeviceCategory;\n\n#ifndef __IErrorLog_INTERFACE_DEFINED__\n#define __IErrorLog_INTERFACE_DEFINED__\n\nDECLARE_INTERFACE_(IErrorLog, IUnknown)\n{\n    STDMETHOD(AddError)(THIS_ LPCOLESTR, EXCEPINFO *) PURE;\n};\n\n#endif \/* __IErrorLog_INTERFACE_DEFINED__ *\/\n\n#ifndef __IPropertyBag_INTERFACE_DEFINED__\n#define __IPropertyBag_INTERFACE_DEFINED__\n\nconst GUID IID_IPropertyBag = {0x55272A00, 0x42CB, 0x11CE, {0x81, 0x35, 0x00, 0xAA, 0x00, 0x4B, 0xB8, 0x51}};\n\nDECLARE_INTERFACE_(IPropertyBag, IUnknown)\n{\n    STDMETHOD(Read)(THIS_ LPCOLESTR, VARIANT *, IErrorLog *) PURE;\n    STDMETHOD(Write)(THIS_ LPCOLESTR, VARIANT *) PURE;\n};\n\n#endif \/* __IPropertyBag_INTERFACE_DEFINED__ *\/\n\n#endif\/\/Q_CC_MINGW\n\nQT_BEGIN_NAMESPACE\n\n\/\/ For mingw toolchain mmsystem.h only defines half the defines, so add if needed.\n#ifndef WAVE_FORMAT_44M08\n#define WAVE_FORMAT_44M08 0x00000100\n#define WAVE_FORMAT_44S08 0x00000200\n#define WAVE_FORMAT_44M16 0x00000400\n#define WAVE_FORMAT_44S16 0x00000800\n#define WAVE_FORMAT_48M08 0x00001000\n#define WAVE_FORMAT_48S08 0x00002000\n#define WAVE_FORMAT_48M16 0x00004000\n#define WAVE_FORMAT_48S16 0x00008000\n#define WAVE_FORMAT_96M08 0x00010000\n#define WAVE_FORMAT_96S08 0x00020000\n#define WAVE_FORMAT_96M16 0x00040000\n#define WAVE_FORMAT_96S16 0x00080000\n#endif\n\n\nQAudioDeviceInfoInternal::QAudioDeviceInfoInternal(QByteArray dev, QAudio::Mode mode)\n{\n    QDataStream ds(&dev, QIODevice::ReadOnly);\n    ds >> devId >> device;\n    this->mode = mode;\n\n    updateLists();\n}\n\nQAudioDeviceInfoInternal::~QAudioDeviceInfoInternal()\n{\n    close();\n}\n\nbool QAudioDeviceInfoInternal::isFormatSupported(const QAudioFormat& format) const\n{\n    return testSettings(format);\n}\n\nQAudioFormat QAudioDeviceInfoInternal::preferredFormat() const\n{\n    QAudioFormat nearest;\n    if(mode == QAudio::AudioOutput) {\n        nearest.setFrequency(44100);\n        nearest.setChannelCount(2);\n        nearest.setByteOrder(QAudioFormat::LittleEndian);\n        nearest.setSampleType(QAudioFormat::SignedInt);\n        nearest.setSampleSize(16);\n        nearest.setCodec(QLatin1String(\"audio\/pcm\"));\n    } else {\n        nearest.setFrequency(11025);\n        nearest.setChannelCount(1);\n        nearest.setByteOrder(QAudioFormat::LittleEndian);\n        nearest.setSampleType(QAudioFormat::SignedInt);\n        nearest.setSampleSize(8);\n        nearest.setCodec(QLatin1String(\"audio\/pcm\"));\n    }\n    return nearest;\n}\n\nQString QAudioDeviceInfoInternal::deviceName() const\n{\n    return device;\n}\n\nQStringList QAudioDeviceInfoInternal::supportedCodecs()\n{\n    updateLists();\n    return codecz;\n}\n\nQList<int> QAudioDeviceInfoInternal::supportedSampleRates()\n{\n    updateLists();\n    return freqz;\n}\n\nQList<int> QAudioDeviceInfoInternal::supportedChannelCounts()\n{\n    updateLists();\n    return channelz;\n}\n\nQList<int> QAudioDeviceInfoInternal::supportedSampleSizes()\n{\n    updateLists();\n    return sizez;\n}\n\nQList<QAudioFormat::Endian> QAudioDeviceInfoInternal::supportedByteOrders()\n{\n    updateLists();\n    return byteOrderz;\n}\n\nQList<QAudioFormat::SampleType> QAudioDeviceInfoInternal::supportedSampleTypes()\n{\n    updateLists();\n    return typez;\n}\n\n\nbool QAudioDeviceInfoInternal::open()\n{\n    return true;\n}\n\nvoid QAudioDeviceInfoInternal::close()\n{\n}\n\nbool QAudioDeviceInfoInternal::testSettings(const QAudioFormat& format) const\n{\n    \/\/ Set nearest to closest settings that do work.\n    \/\/ See if what is in settings will work (return value).\n\n    bool failed = false;\n    bool match = false;\n\n    \/\/ check codec\n    for( int i = 0; i < codecz.count(); i++) {\n        if (format.codec() == codecz.at(i))\n            match = true;\n    }\n    if (!match) failed = true;\n\n    \/\/ check channel\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < channelz.count(); i++) {\n            if (format.channels() == channelz.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    \/\/ check frequency\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < freqz.count(); i++) {\n            if (format.frequency() == freqz.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    \/\/ check sample size\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < sizez.count(); i++) {\n            if (format.sampleSize() == sizez.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    \/\/ check byte order\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < byteOrderz.count(); i++) {\n            if (format.byteOrder() == byteOrderz.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    \/\/ check sample type\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < typez.count(); i++) {\n            if (format.sampleType() == typez.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    if(!failed) {\n        \/\/ settings work\n        return true;\n    }\n    return false;\n}\n\nvoid QAudioDeviceInfoInternal::updateLists()\n{\n    \/\/ redo all lists based on current settings\n    bool match = false;\n    DWORD fmt = NULL;\n\n    if(mode == QAudio::AudioOutput) {\n        WAVEOUTCAPS woc;\n        if (waveOutGetDevCaps(devId, &woc, sizeof(WAVEOUTCAPS)) == MMSYSERR_NOERROR) {\n            match = true;\n            fmt = woc.dwFormats;\n        }\n    } else {\n        WAVEINCAPS woc;\n        if (waveInGetDevCaps(devId, &woc, sizeof(WAVEINCAPS)) == MMSYSERR_NOERROR) {\n            match = true;\n            fmt = woc.dwFormats;\n        }\n    }\n    sizez.clear();\n    freqz.clear();\n    channelz.clear();\n    byteOrderz.clear();\n    typez.clear();\n    codecz.clear();\n\n    if(match) {\n        if((fmt && WAVE_FORMAT_1M08)\n           || (fmt && WAVE_FORMAT_1S08)\n\t   || (fmt && WAVE_FORMAT_2M08)\n\t   || (fmt && WAVE_FORMAT_2S08)\n\t   || (fmt && WAVE_FORMAT_4M08)\n\t   || (fmt && WAVE_FORMAT_4S08)\n#ifndef Q_OS_WINCE\n\t   || (fmt && WAVE_FORMAT_48M08)\n\t   || (fmt && WAVE_FORMAT_48S08)\n\t   || (fmt && WAVE_FORMAT_96M08)\n\t   || (fmt && WAVE_FORMAT_96S08)\n#endif\n       ) {\n            sizez.append(8);\n\t}\n        if((fmt && WAVE_FORMAT_1M16)\n           || (fmt && WAVE_FORMAT_1S16)\n\t   || (fmt && WAVE_FORMAT_2M16)\n\t   || (fmt && WAVE_FORMAT_2S16)\n\t   || (fmt && WAVE_FORMAT_4M16)\n\t   || (fmt && WAVE_FORMAT_4S16)\n#ifndef Q_OS_WINCE\n\t   || (fmt && WAVE_FORMAT_48M16)\n\t   || (fmt && WAVE_FORMAT_48S16)\n\t   || (fmt && WAVE_FORMAT_96M16)\n\t   || (fmt && WAVE_FORMAT_96S16)\n#endif\n       ) {\n            sizez.append(16);\n\t}\n        if((fmt && WAVE_FORMAT_1M08)\n           || (fmt && WAVE_FORMAT_1S08)\n\t   || (fmt && WAVE_FORMAT_1M16)\n\t   || (fmt && WAVE_FORMAT_1S16)) {\n            freqz.append(11025);\n\t}\n        if((fmt && WAVE_FORMAT_2M08)\n           || (fmt && WAVE_FORMAT_2S08)\n\t   || (fmt && WAVE_FORMAT_2M16)\n\t   || (fmt && WAVE_FORMAT_2S16)) {\n            freqz.append(22050);\n\t}\n        if((fmt && WAVE_FORMAT_4M08)\n           || (fmt && WAVE_FORMAT_4S08)\n\t   || (fmt && WAVE_FORMAT_4M16)\n\t   || (fmt && WAVE_FORMAT_4S16)) {\n            freqz.append(44100);\n\t}\n#ifndef Q_OS_WINCE\n        if((fmt && WAVE_FORMAT_48M08)\n           || (fmt && WAVE_FORMAT_48S08)\n\t   || (fmt && WAVE_FORMAT_48M16)\n\t   || (fmt && WAVE_FORMAT_48S16)) {\n            freqz.append(48000);\n\t}\n        if((fmt && WAVE_FORMAT_96M08)\n           || (fmt && WAVE_FORMAT_96S08)\n\t   || (fmt && WAVE_FORMAT_96M16)\n\t   || (fmt && WAVE_FORMAT_96S16)) {\n            freqz.append(96000);\n        }\n#endif\n\tchannelz.append(1);\n\tchannelz.append(2);\n        if (mode == QAudio::AudioOutput) {\n            channelz.append(4);\n            channelz.append(6);\n            channelz.append(8);\n        }\n\n\tbyteOrderz.append(QAudioFormat::LittleEndian);\n\n\ttypez.append(QAudioFormat::SignedInt);\n\ttypez.append(QAudioFormat::UnSignedInt);\n\n\tcodecz.append(QLatin1String(\"audio\/pcm\"));\n    }\n    if (freqz.count() > 0)\n        freqz.prepend(8000);\n}\n\nQList<QByteArray> QAudioDeviceInfoInternal::availableDevices(QAudio::Mode mode)\n{\n    Q_UNUSED(mode)\n\n    QList<QByteArray> devices;\n    \/\/enumerate device fullnames through directshow api\n    CoInitialize(NULL);\n    ICreateDevEnum *pDevEnum = NULL;\n    IEnumMoniker *pEnum = NULL;\n    \/\/ Create the System device enumerator\n    HRESULT hr = CoCreateInstance(CLSID_SystemDeviceEnum, NULL,\n                 CLSCTX_INPROC_SERVER, IID_ICreateDevEnum,\n                 reinterpret_cast<void **>(&pDevEnum));\n\n    unsigned long iNumDevs = mode == QAudio::AudioOutput ? waveOutGetNumDevs() : waveInGetNumDevs();\n    if (SUCCEEDED(hr)) {\n        \/\/ Create the enumerator for the video capture category\n        hr = pDevEnum->CreateClassEnumerator(\n             mode == QAudio::AudioOutput ? CLSID_AudioRendererCategory : CLSID_AudioInputDeviceCategory,\n             &pEnum, 0);\n        pEnum->Reset();\n        \/\/ go through and find all video capture devices\n        IMoniker *pMoniker = NULL;\n        while (pEnum->Next(1, &pMoniker, NULL) == S_OK) {\n            IPropertyBag *pPropBag;\n            hr = pMoniker->BindToStorage(0,0,IID_IPropertyBag,\n                 reinterpret_cast<void **>(&pPropBag));\n            if (FAILED(hr)) {\n                pMoniker->Release();\n                continue; \/\/ skip this one\n            }\n            \/\/ Find if it is a wave device\n            VARIANT var;\n            VariantInit(&var);\n            hr = pPropBag->Read(mode == QAudio::AudioOutput ? L\"WaveOutID\" : L\"WaveInID\", &var, 0);\n            if (SUCCEEDED(hr)) {\n                LONG waveID = var.lVal;\n                if (waveID >= 0 && waveID < LONG(iNumDevs)) {\n                    VariantClear(&var);\n                    \/\/ Find the description\n                    hr = pPropBag->Read(L\"FriendlyName\", &var, 0);\n                    if (SUCCEEDED(hr)) {\n                        QByteArray  device;\n                        QDataStream ds(&device, QIODevice::WriteOnly);\n                        ds << quint32(waveID) << QString::fromWCharArray(var.bstrVal);\n                        devices.append(device);\n                    }\n                }\n            }\n\n            pPropBag->Release();\n            pMoniker->Release();\n        }\n    }\n    CoUninitialize();\n\n    return devices;\n}\n\nQByteArray QAudioDeviceInfoInternal::defaultOutputDevice()\n{\n    QList<QByteArray> list = availableDevices(QAudio::AudioOutput);\n    if (list.size() > 0)\n        return list.at(0);\n    else\n        return QByteArray();\n}\n\nQByteArray QAudioDeviceInfoInternal::defaultInputDevice()\n{\n    QList<QByteArray> list = availableDevices(QAudio::AudioInput);\n    if (list.size() > 0)\n        return list.at(0);\n    else\n        return QByteArray();\n}\n\nQT_END_NAMESPACE\n<commit_msg>Fix a potential crash in audio device enumeration under Windows<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\/\/\n\/\/  W A R N I N G\n\/\/  -------------\n\/\/\n\/\/ This file is not part of the Qt API.  It exists for the convenience\n\/\/ of other Qt classes.  This header file may change from version to\n\/\/ version without notice, or even be removed.\n\/\/\n\/\/ INTERNAL USE ONLY: Do NOT use for any other purpose.\n\/\/\n\n\n#include <windows.h>\n#include <mmsystem.h>\n#include \"qaudiodeviceinfo_win32_p.h\"\n#include <dshow.h>\n\n#if defined(Q_CC_MINGW)\n\nextern GUID CLSID_AudioInputDeviceCategory;\n\n#ifndef __IErrorLog_INTERFACE_DEFINED__\n#define __IErrorLog_INTERFACE_DEFINED__\n\nDECLARE_INTERFACE_(IErrorLog, IUnknown)\n{\n    STDMETHOD(AddError)(THIS_ LPCOLESTR, EXCEPINFO *) PURE;\n};\n\n#endif \/* __IErrorLog_INTERFACE_DEFINED__ *\/\n\n#ifndef __IPropertyBag_INTERFACE_DEFINED__\n#define __IPropertyBag_INTERFACE_DEFINED__\n\nconst GUID IID_IPropertyBag = {0x55272A00, 0x42CB, 0x11CE, {0x81, 0x35, 0x00, 0xAA, 0x00, 0x4B, 0xB8, 0x51}};\n\nDECLARE_INTERFACE_(IPropertyBag, IUnknown)\n{\n    STDMETHOD(Read)(THIS_ LPCOLESTR, VARIANT *, IErrorLog *) PURE;\n    STDMETHOD(Write)(THIS_ LPCOLESTR, VARIANT *) PURE;\n};\n\n#endif \/* __IPropertyBag_INTERFACE_DEFINED__ *\/\n\n#endif\/\/Q_CC_MINGW\n\nQT_BEGIN_NAMESPACE\n\n\/\/ For mingw toolchain mmsystem.h only defines half the defines, so add if needed.\n#ifndef WAVE_FORMAT_44M08\n#define WAVE_FORMAT_44M08 0x00000100\n#define WAVE_FORMAT_44S08 0x00000200\n#define WAVE_FORMAT_44M16 0x00000400\n#define WAVE_FORMAT_44S16 0x00000800\n#define WAVE_FORMAT_48M08 0x00001000\n#define WAVE_FORMAT_48S08 0x00002000\n#define WAVE_FORMAT_48M16 0x00004000\n#define WAVE_FORMAT_48S16 0x00008000\n#define WAVE_FORMAT_96M08 0x00010000\n#define WAVE_FORMAT_96S08 0x00020000\n#define WAVE_FORMAT_96M16 0x00040000\n#define WAVE_FORMAT_96S16 0x00080000\n#endif\n\n\nQAudioDeviceInfoInternal::QAudioDeviceInfoInternal(QByteArray dev, QAudio::Mode mode)\n{\n    QDataStream ds(&dev, QIODevice::ReadOnly);\n    ds >> devId >> device;\n    this->mode = mode;\n\n    updateLists();\n}\n\nQAudioDeviceInfoInternal::~QAudioDeviceInfoInternal()\n{\n    close();\n}\n\nbool QAudioDeviceInfoInternal::isFormatSupported(const QAudioFormat& format) const\n{\n    return testSettings(format);\n}\n\nQAudioFormat QAudioDeviceInfoInternal::preferredFormat() const\n{\n    QAudioFormat nearest;\n    if(mode == QAudio::AudioOutput) {\n        nearest.setFrequency(44100);\n        nearest.setChannelCount(2);\n        nearest.setByteOrder(QAudioFormat::LittleEndian);\n        nearest.setSampleType(QAudioFormat::SignedInt);\n        nearest.setSampleSize(16);\n        nearest.setCodec(QLatin1String(\"audio\/pcm\"));\n    } else {\n        nearest.setFrequency(11025);\n        nearest.setChannelCount(1);\n        nearest.setByteOrder(QAudioFormat::LittleEndian);\n        nearest.setSampleType(QAudioFormat::SignedInt);\n        nearest.setSampleSize(8);\n        nearest.setCodec(QLatin1String(\"audio\/pcm\"));\n    }\n    return nearest;\n}\n\nQString QAudioDeviceInfoInternal::deviceName() const\n{\n    return device;\n}\n\nQStringList QAudioDeviceInfoInternal::supportedCodecs()\n{\n    updateLists();\n    return codecz;\n}\n\nQList<int> QAudioDeviceInfoInternal::supportedSampleRates()\n{\n    updateLists();\n    return freqz;\n}\n\nQList<int> QAudioDeviceInfoInternal::supportedChannelCounts()\n{\n    updateLists();\n    return channelz;\n}\n\nQList<int> QAudioDeviceInfoInternal::supportedSampleSizes()\n{\n    updateLists();\n    return sizez;\n}\n\nQList<QAudioFormat::Endian> QAudioDeviceInfoInternal::supportedByteOrders()\n{\n    updateLists();\n    return byteOrderz;\n}\n\nQList<QAudioFormat::SampleType> QAudioDeviceInfoInternal::supportedSampleTypes()\n{\n    updateLists();\n    return typez;\n}\n\n\nbool QAudioDeviceInfoInternal::open()\n{\n    return true;\n}\n\nvoid QAudioDeviceInfoInternal::close()\n{\n}\n\nbool QAudioDeviceInfoInternal::testSettings(const QAudioFormat& format) const\n{\n    \/\/ Set nearest to closest settings that do work.\n    \/\/ See if what is in settings will work (return value).\n\n    bool failed = false;\n    bool match = false;\n\n    \/\/ check codec\n    for( int i = 0; i < codecz.count(); i++) {\n        if (format.codec() == codecz.at(i))\n            match = true;\n    }\n    if (!match) failed = true;\n\n    \/\/ check channel\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < channelz.count(); i++) {\n            if (format.channels() == channelz.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    \/\/ check frequency\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < freqz.count(); i++) {\n            if (format.frequency() == freqz.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    \/\/ check sample size\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < sizez.count(); i++) {\n            if (format.sampleSize() == sizez.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    \/\/ check byte order\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < byteOrderz.count(); i++) {\n            if (format.byteOrder() == byteOrderz.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    \/\/ check sample type\n    match = false;\n    if (!failed) {\n        for( int i = 0; i < typez.count(); i++) {\n            if (format.sampleType() == typez.at(i)) {\n                match = true;\n                break;\n            }\n        }\n        if (!match)\n            failed = true;\n    }\n\n    if(!failed) {\n        \/\/ settings work\n        return true;\n    }\n    return false;\n}\n\nvoid QAudioDeviceInfoInternal::updateLists()\n{\n    \/\/ redo all lists based on current settings\n    bool match = false;\n    DWORD fmt = NULL;\n\n    if(mode == QAudio::AudioOutput) {\n        WAVEOUTCAPS woc;\n        if (waveOutGetDevCaps(devId, &woc, sizeof(WAVEOUTCAPS)) == MMSYSERR_NOERROR) {\n            match = true;\n            fmt = woc.dwFormats;\n        }\n    } else {\n        WAVEINCAPS woc;\n        if (waveInGetDevCaps(devId, &woc, sizeof(WAVEINCAPS)) == MMSYSERR_NOERROR) {\n            match = true;\n            fmt = woc.dwFormats;\n        }\n    }\n    sizez.clear();\n    freqz.clear();\n    channelz.clear();\n    byteOrderz.clear();\n    typez.clear();\n    codecz.clear();\n\n    if(match) {\n        if((fmt && WAVE_FORMAT_1M08)\n           || (fmt && WAVE_FORMAT_1S08)\n\t   || (fmt && WAVE_FORMAT_2M08)\n\t   || (fmt && WAVE_FORMAT_2S08)\n\t   || (fmt && WAVE_FORMAT_4M08)\n\t   || (fmt && WAVE_FORMAT_4S08)\n#ifndef Q_OS_WINCE\n\t   || (fmt && WAVE_FORMAT_48M08)\n\t   || (fmt && WAVE_FORMAT_48S08)\n\t   || (fmt && WAVE_FORMAT_96M08)\n\t   || (fmt && WAVE_FORMAT_96S08)\n#endif\n       ) {\n            sizez.append(8);\n\t}\n        if((fmt && WAVE_FORMAT_1M16)\n           || (fmt && WAVE_FORMAT_1S16)\n\t   || (fmt && WAVE_FORMAT_2M16)\n\t   || (fmt && WAVE_FORMAT_2S16)\n\t   || (fmt && WAVE_FORMAT_4M16)\n\t   || (fmt && WAVE_FORMAT_4S16)\n#ifndef Q_OS_WINCE\n\t   || (fmt && WAVE_FORMAT_48M16)\n\t   || (fmt && WAVE_FORMAT_48S16)\n\t   || (fmt && WAVE_FORMAT_96M16)\n\t   || (fmt && WAVE_FORMAT_96S16)\n#endif\n       ) {\n            sizez.append(16);\n\t}\n        if((fmt && WAVE_FORMAT_1M08)\n           || (fmt && WAVE_FORMAT_1S08)\n\t   || (fmt && WAVE_FORMAT_1M16)\n\t   || (fmt && WAVE_FORMAT_1S16)) {\n            freqz.append(11025);\n\t}\n        if((fmt && WAVE_FORMAT_2M08)\n           || (fmt && WAVE_FORMAT_2S08)\n\t   || (fmt && WAVE_FORMAT_2M16)\n\t   || (fmt && WAVE_FORMAT_2S16)) {\n            freqz.append(22050);\n\t}\n        if((fmt && WAVE_FORMAT_4M08)\n           || (fmt && WAVE_FORMAT_4S08)\n\t   || (fmt && WAVE_FORMAT_4M16)\n\t   || (fmt && WAVE_FORMAT_4S16)) {\n            freqz.append(44100);\n\t}\n#ifndef Q_OS_WINCE\n        if((fmt && WAVE_FORMAT_48M08)\n           || (fmt && WAVE_FORMAT_48S08)\n\t   || (fmt && WAVE_FORMAT_48M16)\n\t   || (fmt && WAVE_FORMAT_48S16)) {\n            freqz.append(48000);\n\t}\n        if((fmt && WAVE_FORMAT_96M08)\n           || (fmt && WAVE_FORMAT_96S08)\n\t   || (fmt && WAVE_FORMAT_96M16)\n\t   || (fmt && WAVE_FORMAT_96S16)) {\n            freqz.append(96000);\n        }\n#endif\n\tchannelz.append(1);\n\tchannelz.append(2);\n        if (mode == QAudio::AudioOutput) {\n            channelz.append(4);\n            channelz.append(6);\n            channelz.append(8);\n        }\n\n\tbyteOrderz.append(QAudioFormat::LittleEndian);\n\n\ttypez.append(QAudioFormat::SignedInt);\n\ttypez.append(QAudioFormat::UnSignedInt);\n\n\tcodecz.append(QLatin1String(\"audio\/pcm\"));\n    }\n    if (freqz.count() > 0)\n        freqz.prepend(8000);\n}\n\nQList<QByteArray> QAudioDeviceInfoInternal::availableDevices(QAudio::Mode mode)\n{\n    Q_UNUSED(mode)\n\n    QList<QByteArray> devices;\n    \/\/enumerate device fullnames through directshow api\n    CoInitialize(NULL);\n    ICreateDevEnum *pDevEnum = NULL;\n    IEnumMoniker *pEnum = NULL;\n    \/\/ Create the System device enumerator\n    HRESULT hr = CoCreateInstance(CLSID_SystemDeviceEnum, NULL,\n                 CLSCTX_INPROC_SERVER, IID_ICreateDevEnum,\n                 reinterpret_cast<void **>(&pDevEnum));\n\n    unsigned long iNumDevs = mode == QAudio::AudioOutput ? waveOutGetNumDevs() : waveInGetNumDevs();\n    if (SUCCEEDED(hr)) {\n        \/\/ Create the enumerator for the audio input\/output category\n        if (pDevEnum->CreateClassEnumerator(\n             mode == QAudio::AudioOutput ? CLSID_AudioRendererCategory : CLSID_AudioInputDeviceCategory,\n             &pEnum, 0) == S_OK) {\n            pEnum->Reset();\n            \/\/ go through and find all audio devices\n            IMoniker *pMoniker = NULL;\n            while (pEnum->Next(1, &pMoniker, NULL) == S_OK) {\n                IPropertyBag *pPropBag;\n                hr = pMoniker->BindToStorage(0,0,IID_IPropertyBag,\n                     reinterpret_cast<void **>(&pPropBag));\n                if (FAILED(hr)) {\n                    pMoniker->Release();\n                    continue; \/\/ skip this one\n                }\n                \/\/ Find if it is a wave device\n                VARIANT var;\n                VariantInit(&var);\n                hr = pPropBag->Read(mode == QAudio::AudioOutput ? L\"WaveOutID\" : L\"WaveInID\", &var, 0);\n                if (SUCCEEDED(hr)) {\n                    LONG waveID = var.lVal;\n                    if (waveID >= 0 && waveID < LONG(iNumDevs)) {\n                        VariantClear(&var);\n                        \/\/ Find the description\n                        hr = pPropBag->Read(L\"FriendlyName\", &var, 0);\n                        if (SUCCEEDED(hr)) {\n                            QByteArray  device;\n                            QDataStream ds(&device, QIODevice::WriteOnly);\n                            ds << quint32(waveID) << QString::fromWCharArray(var.bstrVal);\n                            devices.append(device);\n                        }\n                    }\n                }\n\n                pPropBag->Release();\n                pMoniker->Release();\n            }\n        }\n    }\n    CoUninitialize();\n\n    return devices;\n}\n\nQByteArray QAudioDeviceInfoInternal::defaultOutputDevice()\n{\n    QList<QByteArray> list = availableDevices(QAudio::AudioOutput);\n    if (list.size() > 0)\n        return list.at(0);\n    else\n        return QByteArray();\n}\n\nQByteArray QAudioDeviceInfoInternal::defaultInputDevice()\n{\n    QList<QByteArray> list = availableDevices(QAudio::AudioInput);\n    if (list.size() > 0)\n        return list.at(0);\n    else\n        return QByteArray();\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ChromeOS: Create new tab after fullscreen is really canceled when search key is pressed.   ToggleFullscreenMode is asynchronous, so we need to wait for   next event cycle before creating new tab and set focus to omni box.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Once again for a mysterious reason all sites are crashing in  the distributed test at this location:<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\/\/ This code glues the RLZ library DLL with Chrome. It allows Chrome to work\n\/\/ with or without the DLL being present. If the DLL is not present the\n\/\/ functions do nothing and just return false.\n\n#include \"chrome\/browser\/rlz\/rlz.h\"\n\n#include <process.h>\n#include <windows.h>\n\n#include <algorithm>\n\n#include \"base\/file_path.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/synchronization\/lock.h\"\n#include \"base\/task.h\"\n#include \"base\/threading\/thread.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/search_engines\/template_url.h\"\n#include \"chrome\/browser\/search_engines\/template_url_model.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/env_vars.h\"\n#include \"chrome\/installer\/util\/google_update_settings.h\"\n#include \"content\/browser\/browser_thread.h\"\n#include \"content\/common\/notification_registrar.h\"\n#include \"content\/common\/notification_service.h\"\n\nnamespace {\n\n\/\/ The maximum length of an access points RLZ in wide chars.\nconst DWORD kMaxRlzLength = 64;\n\nenum {\n  ACCESS_VALUES_STALE,      \/\/ Possibly new values available.\n  ACCESS_VALUES_FRESH       \/\/ The cached values are current.\n};\n\n\/\/ Tracks if we have tried and succeeded sending the ping. This helps us\n\/\/ decide if we need to refresh the some cached strings.\nvolatile int access_values_state = ACCESS_VALUES_STALE;\nbase::Lock rlz_lock;\n\nbool SendFinancialPing(const std::wstring& brand, const std::wstring& lang,\n                       const std::wstring& referral, bool exclude_id) {\n  rlz_lib::AccessPoint points[] = {rlz_lib::CHROME_OMNIBOX,\n                                   rlz_lib::CHROME_HOME_PAGE,\n                                   rlz_lib::NO_ACCESS_POINT};\n  std::string brand_ascii(WideToASCII(brand));\n  std::string lang_ascii(WideToASCII(lang));\n  std::string referral_ascii(WideToASCII(referral));\n\n  return rlz_lib::SendFinancialPing(rlz_lib::CHROME, points, \"chrome\",\n                                    brand_ascii.c_str(), referral_ascii.c_str(),\n                                    lang_ascii.c_str(), exclude_id, NULL, true);\n}\n\n\/\/ This class leverages the AutocompleteEditModel notification to know when\n\/\/ the user first interacted with the omnibox and set a global accordingly.\nclass OmniBoxUsageObserver : public NotificationObserver {\n public:\n  OmniBoxUsageObserver() {\n    registrar_.Add(this, NotificationType::OMNIBOX_OPENED_URL,\n                   NotificationService::AllSources());\n    \/\/ If instant is enabled we'll start searching as soon as the user starts\n    \/\/ typing in the omnibox (which triggers INSTANT_CONTROLLER_UPDATED).\n    registrar_.Add(this, NotificationType::INSTANT_CONTROLLER_UPDATED,\n                   NotificationService::AllSources());\n    omnibox_used_ = false;\n    DCHECK(!instance_);\n    instance_ = this;\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details) {\n    \/\/ Needs to be evaluated. See http:\/\/crbug.com\/62328.\n    base::ThreadRestrictions::ScopedAllowIO allow_io;\n\n    \/\/ Try to record event now, else set the flag to try later when we\n    \/\/ attempt the ping.\n    if (!RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                        rlz_lib::CHROME_OMNIBOX,\n                                        rlz_lib::FIRST_SEARCH))\n      omnibox_used_ = true;\n    delete this;\n  }\n\n  static bool used() {\n    return omnibox_used_;\n  }\n\n  \/\/ Deletes the single instance of OmniBoxUsageObserver.\n  static void DeleteInstance() {\n    delete instance_;\n  }\n\n private:\n  \/\/ Dtor is private so the object cannot be created on the stack.\n  ~OmniBoxUsageObserver() {\n    instance_ = NULL;\n  }\n\n  static bool omnibox_used_;\n\n  \/\/ There should only be one instance created at a time, and instance_ points\n  \/\/ to that instance.\n  \/\/ NOTE: this is only non-null for the amount of time it is needed. Once the\n  \/\/ instance_ is no longer needed (or Chrome is exiting), this is null.\n  static OmniBoxUsageObserver* instance_;\n\n  NotificationRegistrar registrar_;\n};\n\nbool OmniBoxUsageObserver::omnibox_used_ = false;\nOmniBoxUsageObserver* OmniBoxUsageObserver::instance_ = NULL;\n\n\/\/ This task is run in the file thread, so to not block it for a long time\n\/\/ we use a throwaway thread to do the blocking url request.\nclass DailyPingTask : public Task {\n public:\n  virtual ~DailyPingTask() {\n  }\n  virtual void Run() {\n    \/\/ We use a transient thread because we have no guarantees about\n    \/\/ how long the RLZ lib can block us.\n    _beginthread(PingNow, 0, NULL);\n  }\n\n private:\n  \/\/ Causes a ping to the server using WinInet.\n  static void _cdecl PingNow(void*) {\n    \/\/ Needs to be evaluated. See http:\/\/crbug.com\/62328.\n    base::ThreadRestrictions::ScopedAllowIO allow_io;\n\n    std::wstring lang;\n    GoogleUpdateSettings::GetLanguage(&lang);\n    if (lang.empty())\n      lang = L\"en\";\n    std::wstring brand;\n    GoogleUpdateSettings::GetBrand(&brand);\n    std::wstring referral;\n    GoogleUpdateSettings::GetReferral(&referral);\n    if (SendFinancialPing(brand, lang, referral, is_organic(brand))) {\n      base::AutoLock lock(rlz_lock);\n      access_values_state = ACCESS_VALUES_STALE;\n      GoogleUpdateSettings::ClearReferral();\n    }\n  }\n\n  \/\/ Organic brands all start with GG, such as GGCM.\n  static bool is_organic(const std::wstring& brand) {\n    return (brand.size() < 2) ? false : (brand.substr(0, 2) == L\"GG\");\n  }\n};\n\n\/\/ Performs late RLZ initialization and RLZ event recording for chrome.\n\/\/ This task needs to run on the UI thread.\nclass DelayedInitTask : public Task {\n public:\n  explicit DelayedInitTask(bool first_run)\n      : first_run_(first_run) {\n  }\n  virtual ~DelayedInitTask() {\n  }\n  virtual void Run() {\n    \/\/ For non-interactive tests we don't do the rest of the initialization\n    \/\/ because sometimes the very act of loading the dll causes QEMU to crash.\n    if (::GetEnvironmentVariableW(ASCIIToWide(env_vars::kHeadless).c_str(),\n                                  NULL, 0)) {\n      return;\n    }\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      return;\n\n    \/\/ Do the initial event recording if is the first run or if we have an\n    \/\/ empty rlz which means we haven't got a chance to do it.\n    std::wstring omnibox_rlz;\n    RLZTracker::GetAccessPointRlz(rlz_lib::CHROME_OMNIBOX, &omnibox_rlz);\n\n    if (first_run_ || omnibox_rlz.empty()) {\n      \/\/ Record the installation of chrome.\n      RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                     rlz_lib::CHROME_OMNIBOX,\n                                     rlz_lib::INSTALL);\n      RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                     rlz_lib::CHROME_HOME_PAGE,\n                                     rlz_lib::INSTALL);\n      \/\/ Record if google is the initial search provider.\n      if (IsGoogleDefaultSearch()) {\n        RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                       rlz_lib::CHROME_OMNIBOX,\n                                       rlz_lib::SET_TO_GOOGLE);\n      }\n    }\n    \/\/ Record first user interaction with the omnibox. We call this all the\n    \/\/ time but the rlz lib should ingore all but the first one.\n    if (OmniBoxUsageObserver::used()) {\n      RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                     rlz_lib::CHROME_OMNIBOX,\n                                     rlz_lib::FIRST_SEARCH);\n    }\n    \/\/ Schedule the daily RLZ ping.\n    MessageLoop::current()->PostTask(FROM_HERE, new DailyPingTask());\n  }\n\n private:\n  bool IsGoogleDefaultSearch() {\n    if (!g_browser_process)\n      return false;\n    FilePath user_data_dir;\n    if (!PathService::Get(chrome::DIR_USER_DATA, &user_data_dir))\n      return false;\n    ProfileManager* profile_manager = g_browser_process->profile_manager();\n    Profile* profile = profile_manager->GetDefaultProfile(user_data_dir);\n    if (!profile)\n      return false;\n    const TemplateURL* url_template =\n        profile->GetTemplateURLModel()->GetDefaultSearchProvider();\n    if (!url_template)\n      return false;\n    const TemplateURLRef* urlref = url_template->url();\n    if (!urlref)\n      return false;\n    return urlref->HasGoogleBaseURLs();\n  }\n\n  bool first_run_;\n  DISALLOW_IMPLICIT_CONSTRUCTORS(DelayedInitTask);\n};\n\n}  \/\/ namespace\n\nbool RLZTracker::InitRlzDelayed(bool first_run, int delay) {\n  \/\/ Maximum and minimum delay we would allow to be set through master\n  \/\/ preferences. Somewhat arbitrary, may need to be adjusted in future.\n  const int kMaxDelay = 200 * 1000;\n  const int kMinDelay = 20 * 1000;\n\n  delay *= 1000;\n  delay = (delay < kMinDelay) ? kMinDelay : delay;\n  delay = (delay > kMaxDelay) ? kMaxDelay : delay;\n\n  if (!OmniBoxUsageObserver::used())\n    new OmniBoxUsageObserver();\n\n  \/\/ Schedule the delayed init items.\n  BrowserThread::PostDelayedTask(\n      BrowserThread::FILE, FROM_HERE, new DelayedInitTask(first_run), delay);\n  return true;\n}\n\nbool RLZTracker::RecordProductEvent(rlz_lib::Product product,\n                                    rlz_lib::AccessPoint point,\n                                    rlz_lib::Event event_id) {\n  return rlz_lib::RecordProductEvent(product, point, event_id);\n}\n\nbool RLZTracker::ClearAllProductEvents(rlz_lib::Product product) {\n  return rlz_lib::ClearAllProductEvents(product);\n}\n\n\/\/ We implement caching of the answer of get_access_point() if the request\n\/\/ is for CHROME_OMNIBOX. If we had a successful ping, then we update the\n\/\/ cached value.\n\nbool RLZTracker::GetAccessPointRlz(rlz_lib::AccessPoint point,\n                                   std::wstring* rlz) {\n  static std::wstring cached_ommibox_rlz;\n  if (rlz_lib::CHROME_OMNIBOX == point) {\n    base::AutoLock lock(rlz_lock);\n    if (access_values_state == ACCESS_VALUES_FRESH) {\n      *rlz = cached_ommibox_rlz;\n      return true;\n    }\n  }\n\n  \/\/ Make sure we don't access disk outside of the file context.\n  \/\/ In such case we repost the task on the right thread and return error.\n  if (!BrowserThread::CurrentlyOn(BrowserThread::FILE)) {\n    \/\/ Caching of access points is now only implemented for the CHROME_OMNIBOX.\n    \/\/ Thus it is not possible to call this function on another thread for\n    \/\/ other access points until proper caching for these has been implemented\n    \/\/ and the code that calls this function can handle synchronous fetching\n    \/\/ of the access point.\n    DCHECK_EQ(rlz_lib::CHROME_OMNIBOX, point);\n\n    BrowserThread::PostTask(\n        BrowserThread::FILE, FROM_HERE,\n        NewRunnableFunction(&RLZTracker::GetAccessPointRlz,\n                            point, &cached_ommibox_rlz));\n      rlz->erase();\n      return false;\n  }\n\n  char str_rlz[kMaxRlzLength + 1];\n  if (!rlz_lib::GetAccessPointRlz(point, str_rlz, rlz_lib::kMaxRlzLength, NULL))\n    return false;\n  *rlz = ASCIIToWide(std::string(str_rlz));\n  if (rlz_lib::CHROME_OMNIBOX == point) {\n    base::AutoLock lock(rlz_lock);\n    cached_ommibox_rlz.assign(*rlz);\n    access_values_state = ACCESS_VALUES_FRESH;\n  }\n  return true;\n}\n\n\/\/ static\nvoid RLZTracker::CleanupRlz() {\n  OmniBoxUsageObserver::DeleteInstance();\n}\n<commit_msg>Allows distributions to send a finanacial ping immediately after a first search is performed, even if a financial ping has already been sent for the install event.<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 code glues the RLZ library DLL with Chrome. It allows Chrome to work\n\/\/ with or without the DLL being present. If the DLL is not present the\n\/\/ functions do nothing and just return false.\n\n#include \"chrome\/browser\/rlz\/rlz.h\"\n\n#include <process.h>\n#include <windows.h>\n\n#include <algorithm>\n\n#include \"base\/file_path.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/synchronization\/lock.h\"\n#include \"base\/task.h\"\n#include \"base\/threading\/thread.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/search_engines\/template_url.h\"\n#include \"chrome\/browser\/search_engines\/template_url_model.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/env_vars.h\"\n#include \"chrome\/installer\/util\/google_update_settings.h\"\n#include \"content\/browser\/browser_thread.h\"\n#include \"content\/common\/notification_registrar.h\"\n#include \"content\/common\/notification_service.h\"\n\nnamespace {\n\n\/\/ The maximum length of an access points RLZ in wide chars.\nconst DWORD kMaxRlzLength = 64;\n\nenum {\n  ACCESS_VALUES_STALE,      \/\/ Possibly new values available.\n  ACCESS_VALUES_FRESH       \/\/ The cached values are current.\n};\n\n\/\/ Tracks if we have tried and succeeded sending the ping. This helps us\n\/\/ decide if we need to refresh the some cached strings.\nvolatile int access_values_state = ACCESS_VALUES_STALE;\nbase::Lock rlz_lock;\n\nbool SendFinancialPing(const std::wstring& brand, const std::wstring& lang,\n                       const std::wstring& referral, bool exclude_id) {\n  rlz_lib::AccessPoint points[] = {rlz_lib::CHROME_OMNIBOX,\n                                   rlz_lib::CHROME_HOME_PAGE,\n                                   rlz_lib::NO_ACCESS_POINT};\n  std::string brand_ascii(WideToASCII(brand));\n  std::string lang_ascii(WideToASCII(lang));\n  std::string referral_ascii(WideToASCII(referral));\n\n  return rlz_lib::SendFinancialPing(rlz_lib::CHROME, points, \"chrome\",\n                                    brand_ascii.c_str(), referral_ascii.c_str(),\n                                    lang_ascii.c_str(), exclude_id, NULL, true);\n}\n\n\/\/ This class leverages the AutocompleteEditModel notification to know when\n\/\/ the user first interacted with the omnibox and set a global accordingly.\nclass OmniBoxUsageObserver : public NotificationObserver {\n public:\n  OmniBoxUsageObserver(bool first_run, bool send_ping_immediately)\n    : first_run_(first_run),\n      send_ping_immediately_(send_ping_immediately) {\n    registrar_.Add(this, NotificationType::OMNIBOX_OPENED_URL,\n                   NotificationService::AllSources());\n    \/\/ If instant is enabled we'll start searching as soon as the user starts\n    \/\/ typing in the omnibox (which triggers INSTANT_CONTROLLER_UPDATED).\n    registrar_.Add(this, NotificationType::INSTANT_CONTROLLER_UPDATED,\n                   NotificationService::AllSources());\n    omnibox_used_ = false;\n    DCHECK(!instance_);\n    instance_ = this;\n  }\n\n  virtual void Observe(NotificationType type,\n                       const NotificationSource& source,\n                       const NotificationDetails& details);\n\n  static bool used() {\n    return omnibox_used_;\n  }\n\n  \/\/ Deletes the single instance of OmniBoxUsageObserver.\n  static void DeleteInstance() {\n    delete instance_;\n  }\n\n private:\n  \/\/ Dtor is private so the object cannot be created on the stack.\n  ~OmniBoxUsageObserver() {\n    instance_ = NULL;\n  }\n\n  static bool omnibox_used_;\n\n  \/\/ There should only be one instance created at a time, and instance_ points\n  \/\/ to that instance.\n  \/\/ NOTE: this is only non-null for the amount of time it is needed. Once the\n  \/\/ instance_ is no longer needed (or Chrome is exiting), this is null.\n  static OmniBoxUsageObserver* instance_;\n\n  NotificationRegistrar registrar_;\n  bool first_run_;\n  bool send_ping_immediately_;\n};\n\nbool OmniBoxUsageObserver::omnibox_used_ = false;\nOmniBoxUsageObserver* OmniBoxUsageObserver::instance_ = NULL;\n\n\/\/ This task is run in the file thread, so to not block it for a long time\n\/\/ we use a throwaway thread to do the blocking url request.\nclass DailyPingTask : public Task {\n public:\n  virtual ~DailyPingTask() {\n  }\n  virtual void Run() {\n    \/\/ We use a transient thread because we have no guarantees about\n    \/\/ how long the RLZ lib can block us.\n    _beginthread(PingNow, 0, NULL);\n  }\n\n private:\n  \/\/ Causes a ping to the server using WinInet.\n  static void _cdecl PingNow(void*) {\n    \/\/ Needs to be evaluated. See http:\/\/crbug.com\/62328.\n    base::ThreadRestrictions::ScopedAllowIO allow_io;\n\n    std::wstring lang;\n    GoogleUpdateSettings::GetLanguage(&lang);\n    if (lang.empty())\n      lang = L\"en\";\n    std::wstring brand;\n    GoogleUpdateSettings::GetBrand(&brand);\n    std::wstring referral;\n    GoogleUpdateSettings::GetReferral(&referral);\n    if (SendFinancialPing(brand, lang, referral, is_organic(brand))) {\n      base::AutoLock lock(rlz_lock);\n      access_values_state = ACCESS_VALUES_STALE;\n      GoogleUpdateSettings::ClearReferral();\n    }\n  }\n\n  \/\/ Organic brands all start with GG, such as GGCM.\n  static bool is_organic(const std::wstring& brand) {\n    return (brand.size() < 2) ? false : (brand.substr(0, 2) == L\"GG\");\n  }\n};\n\n\/\/ Performs late RLZ initialization and RLZ event recording for chrome.\n\/\/ This task needs to run on the UI thread.\nclass DelayedInitTask : public Task {\n public:\n  explicit DelayedInitTask(bool first_run)\n      : first_run_(first_run) {\n  }\n  virtual ~DelayedInitTask() {\n  }\n  virtual void Run() {\n    \/\/ For non-interactive tests we don't do the rest of the initialization\n    \/\/ because sometimes the very act of loading the dll causes QEMU to crash.\n    if (::GetEnvironmentVariableW(ASCIIToWide(env_vars::kHeadless).c_str(),\n                                  NULL, 0)) {\n      return;\n    }\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      return;\n\n    \/\/ Do the initial event recording if is the first run or if we have an\n    \/\/ empty rlz which means we haven't got a chance to do it.\n    std::wstring omnibox_rlz;\n    RLZTracker::GetAccessPointRlz(rlz_lib::CHROME_OMNIBOX, &omnibox_rlz);\n\n    if ((first_run_ || omnibox_rlz.empty()) && !already_ran_) {\n      already_ran_ = true;\n\n      \/\/ Record the installation of chrome.\n      RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                     rlz_lib::CHROME_OMNIBOX,\n                                     rlz_lib::INSTALL);\n      RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                     rlz_lib::CHROME_HOME_PAGE,\n                                     rlz_lib::INSTALL);\n      \/\/ Record if google is the initial search provider.\n      if (IsGoogleDefaultSearch()) {\n        RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                       rlz_lib::CHROME_OMNIBOX,\n                                       rlz_lib::SET_TO_GOOGLE);\n      }\n    }\n    \/\/ Record first user interaction with the omnibox. We call this all the\n    \/\/ time but the rlz lib should ingore all but the first one.\n    if (OmniBoxUsageObserver::used()) {\n      RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                     rlz_lib::CHROME_OMNIBOX,\n                                     rlz_lib::FIRST_SEARCH);\n    }\n    \/\/ Schedule the daily RLZ ping.\n    MessageLoop::current()->PostTask(FROM_HERE, new DailyPingTask());\n  }\n\n private:\n  bool IsGoogleDefaultSearch() {\n    if (!g_browser_process)\n      return false;\n    FilePath user_data_dir;\n    if (!PathService::Get(chrome::DIR_USER_DATA, &user_data_dir))\n      return false;\n    ProfileManager* profile_manager = g_browser_process->profile_manager();\n    Profile* profile = profile_manager->GetDefaultProfile(user_data_dir);\n    if (!profile)\n      return false;\n    const TemplateURL* url_template =\n        profile->GetTemplateURLModel()->GetDefaultSearchProvider();\n    if (!url_template)\n      return false;\n    const TemplateURLRef* urlref = url_template->url();\n    if (!urlref)\n      return false;\n    return urlref->HasGoogleBaseURLs();\n  }\n\n  \/\/ Flag that remembers if the delayed task already ran or not.  This is\n  \/\/ needed only in the first_run case, since we don't want to record the\n  \/\/ set-to-google event more than once.  We need to worry about this event\n  \/\/ (and not the others) because it is not a stateful RLZ event.\n  static bool already_ran_;\n\n  bool first_run_;\n  DISALLOW_IMPLICIT_CONSTRUCTORS(DelayedInitTask);\n};\n\nbool DelayedInitTask::already_ran_ = false;\n\nvoid OmniBoxUsageObserver::Observe(NotificationType type,\n                                   const NotificationSource& source,\n                                   const NotificationDetails& details) {\n  \/\/ Needs to be evaluated. See http:\/\/crbug.com\/62328.\n  base::ThreadRestrictions::ScopedAllowIO allow_io;\n\n  \/\/ Try to record event now, else set the flag to try later when we\n  \/\/ attempt the ping.\n  if (!RLZTracker::RecordProductEvent(rlz_lib::CHROME,\n                                      rlz_lib::CHROME_OMNIBOX,\n                                      rlz_lib::FIRST_SEARCH))\n    omnibox_used_ = true;\n  else if (send_ping_immediately_) {\n    BrowserThread::PostTask(\n        BrowserThread::FILE, FROM_HERE, new DelayedInitTask(first_run_));\n  }\n\n  delete this;\n}\n\n}  \/\/ namespace\n\nbool RLZTracker::InitRlzDelayed(bool first_run, int delay) {\n  \/\/ A negative delay means that a financial ping should be sent immediately\n  \/\/ after a first search is recorded, without waiting for the next restart\n  \/\/ of chrome.  However, we only want this behaviour on first run.\n  bool send_ping_immediately = false;\n  if (delay < 0) {\n    send_ping_immediately = true;\n    delay = -delay;\n  }\n\n  \/\/ Maximum and minimum delay we would allow to be set through master\n  \/\/ preferences. Somewhat arbitrary, may need to be adjusted in future.\n  const int kMaxDelay = 200 * 1000;\n  const int kMinDelay = 20 * 1000;\n\n  delay *= 1000;\n  delay = (delay < kMinDelay) ? kMinDelay : delay;\n  delay = (delay > kMaxDelay) ? kMaxDelay : delay;\n\n  if (!OmniBoxUsageObserver::used())\n    new OmniBoxUsageObserver(first_run, send_ping_immediately);\n\n  \/\/ Schedule the delayed init items.\n  BrowserThread::PostDelayedTask(\n      BrowserThread::FILE, FROM_HERE, new DelayedInitTask(first_run), delay);\n  return true;\n}\n\nbool RLZTracker::RecordProductEvent(rlz_lib::Product product,\n                                    rlz_lib::AccessPoint point,\n                                    rlz_lib::Event event_id) {\n  return rlz_lib::RecordProductEvent(product, point, event_id);\n}\n\nbool RLZTracker::ClearAllProductEvents(rlz_lib::Product product) {\n  return rlz_lib::ClearAllProductEvents(product);\n}\n\n\/\/ We implement caching of the answer of get_access_point() if the request\n\/\/ is for CHROME_OMNIBOX. If we had a successful ping, then we update the\n\/\/ cached value.\n\nbool RLZTracker::GetAccessPointRlz(rlz_lib::AccessPoint point,\n                                   std::wstring* rlz) {\n  static std::wstring cached_ommibox_rlz;\n  if (rlz_lib::CHROME_OMNIBOX == point) {\n    base::AutoLock lock(rlz_lock);\n    if (access_values_state == ACCESS_VALUES_FRESH) {\n      *rlz = cached_ommibox_rlz;\n      return true;\n    }\n  }\n\n  \/\/ Make sure we don't access disk outside of the file context.\n  \/\/ In such case we repost the task on the right thread and return error.\n  if (!BrowserThread::CurrentlyOn(BrowserThread::FILE)) {\n    \/\/ Caching of access points is now only implemented for the CHROME_OMNIBOX.\n    \/\/ Thus it is not possible to call this function on another thread for\n    \/\/ other access points until proper caching for these has been implemented\n    \/\/ and the code that calls this function can handle synchronous fetching\n    \/\/ of the access point.\n    DCHECK_EQ(rlz_lib::CHROME_OMNIBOX, point);\n\n    BrowserThread::PostTask(\n        BrowserThread::FILE, FROM_HERE,\n        NewRunnableFunction(&RLZTracker::GetAccessPointRlz,\n                            point, &cached_ommibox_rlz));\n      rlz->erase();\n      return false;\n  }\n\n  char str_rlz[kMaxRlzLength + 1];\n  if (!rlz_lib::GetAccessPointRlz(point, str_rlz, rlz_lib::kMaxRlzLength, NULL))\n    return false;\n  *rlz = ASCIIToWide(std::string(str_rlz));\n  if (rlz_lib::CHROME_OMNIBOX == point) {\n    base::AutoLock lock(rlz_lock);\n    cached_ommibox_rlz.assign(*rlz);\n    access_values_state = ACCESS_VALUES_FRESH;\n  }\n  return true;\n}\n\n\/\/ static\nvoid RLZTracker::CleanupRlz() {\n  OmniBoxUsageObserver::DeleteInstance();\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Turn off preconnect for UI tests as well.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * Copyright 2019 MINRES Technologies 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 *******************************************************************************\/\n\n#include \"sysc\/communication\/sc_communication_ids.h\"\n#include \"sysc\/kernel\/sc_wait.h\"\n#include \"scc\/report.h\"\n#include <scc\/ordered_semaphore.h>\n#include <util\/strprintf.h>\n\nnamespace scc {\n\nusing namespace sc_core;\n\n\/\/ ----------------------------------------------------------------------------\n\/\/  CLASS : sc_semaphore\n\/\/\n\/\/  The sc_semaphore primitive channel class.\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ error reporting\nnamespace {\nstd::string gen_unique_event_name(const char* modifier) {\n    auto str = std::string(\"$$$$kernel_event$$$$_\") + \"_\" + modifier;\n    return std::string(sc_core::sc_gen_unique_name(str.c_str(), false));\n}\n} \/\/ namespace\n\nvoid ordered_semaphore::set_capacity(unsigned c) {\n    if(typeid(*this)==typeid(ordered_semaphore)){\n        auto diff = static_cast<int>(capacity) - static_cast<int>(c);\n        capacity=c;\n        value-=diff;\n        if(value>0) free_evt.notify();\n    } else {\n        SCCWARN(SCMOD) << \"cannot resize fixed size ordered semaphore\";\n    }\n}\n\nvoid ordered_semaphore::report_error(const char* id, const char* add_msg) const {\n    auto msg = add_msg? util::strprintf(\"semaphore '%s'\", name()):util::strprintf(\"%s: semaphore '%s'\", add_msg, name());\n    SC_REPORT_ERROR(id, msg.c_str());\n}\n\n\/\/ constructors\n\nordered_semaphore::ordered_semaphore(unsigned init_value_)\n: sc_core::sc_object(sc_core::sc_gen_unique_name(\"semaphore\"))\n, free_evt(gen_unique_event_name(\"free_event\").c_str())\n, value(init_value_)\n, capacity(init_value_) {\n    if(value < 0) {\n        report_error(sc_core::SC_ID_INVALID_SEMAPHORE_VALUE_);\n    }\n}\n\nordered_semaphore::ordered_semaphore(const char* name_, unsigned init_value_)\n: sc_object(name_)\n, free_evt(gen_unique_event_name(\"free_event\").c_str())\n, value(init_value_)\n, capacity(init_value_){\n}\n\n\/\/ interface methods\n\n\/\/ lock (take) the semaphore, block if not available\n\nint ordered_semaphore::wait() {\n    queue.push_back(sc_core::sc_get_current_process_handle());\n    while(in_use()) {\n        sc_core::wait(free_evt);\n    }\n    --value;\n    return 0;\n}\n\n\/\/ lock (take) the semaphore, return -1 if not available\n\nint ordered_semaphore::trywait() {\n    if(in_use()) {\n        return -1;\n    }\n    --value;\n    return 0;\n}\n\n\/\/ unlock (give) the semaphore\n\nint ordered_semaphore::post() {\n    ++value;\n    if(value>0) free_evt.notify();\n    return 0;\n}\n\n} \/\/ namespace scc\n<commit_msg>add semaphore check<commit_after>\/*******************************************************************************\n * Copyright 2019 MINRES Technologies 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 *******************************************************************************\/\n\n#include \"sysc\/communication\/sc_communication_ids.h\"\n#include \"sysc\/kernel\/sc_wait.h\"\n#include \"scc\/report.h\"\n#include <scc\/ordered_semaphore.h>\n#include <util\/strprintf.h>\n\nnamespace scc {\n\nusing namespace sc_core;\n\n\/\/ ----------------------------------------------------------------------------\n\/\/  CLASS : sc_semaphore\n\/\/\n\/\/  The sc_semaphore primitive channel class.\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ error reporting\nnamespace {\nstd::string gen_unique_event_name(const char* modifier) {\n    auto str = std::string(\"$$$$kernel_event$$$$_\") + \"_\" + modifier;\n    return std::string(sc_core::sc_gen_unique_name(str.c_str(), false));\n}\n} \/\/ namespace\n\nvoid ordered_semaphore::set_capacity(unsigned c) {\n    if(typeid(*this)==typeid(ordered_semaphore)){\n        auto diff = static_cast<int>(capacity) - static_cast<int>(c);\n        capacity=c;\n        value-=diff;\n        if(value>0) free_evt.notify();\n    } else {\n        SCCWARN(SCMOD) << \"cannot resize fixed size ordered semaphore\";\n    }\n}\n\nvoid ordered_semaphore::report_error(const char* id, const char* add_msg) const {\n    auto msg = add_msg? util::strprintf(\"semaphore '%s'\", name()):util::strprintf(\"%s: semaphore '%s'\", add_msg, name());\n    SC_REPORT_ERROR(id, msg.c_str());\n}\n\n\/\/ constructors\n\nordered_semaphore::ordered_semaphore(unsigned init_value_)\n: sc_core::sc_object(sc_core::sc_gen_unique_name(\"semaphore\"))\n, free_evt(gen_unique_event_name(\"free_event\").c_str())\n, value(init_value_)\n, capacity(init_value_) {\n    if(value < 0) {\n        report_error(sc_core::SC_ID_INVALID_SEMAPHORE_VALUE_);\n    }\n}\n\nordered_semaphore::ordered_semaphore(const char* name_, unsigned init_value_)\n: sc_object(name_)\n, free_evt(gen_unique_event_name(\"free_event\").c_str())\n, value(init_value_)\n, capacity(init_value_){\n}\n\n\/\/ interface methods\n\n\/\/ lock (take) the semaphore, block if not available\n\nint ordered_semaphore::wait() {\n    queue.push_back(sc_core::sc_get_current_process_handle());\n    while(in_use()) {\n        sc_core::wait(free_evt);\n    }\n    --value;\n    return 0;\n}\n\n\/\/ lock (take) the semaphore, return -1 if not available\n\nint ordered_semaphore::trywait() {\n    if(in_use()) {\n        return -1;\n    }\n    --value;\n    return 0;\n}\n\n\/\/ unlock (give) the semaphore\n\nint ordered_semaphore::post() {\n    if(value==capacity)\n        SCCWARN(SCMOD)<<\"post() called on entirely free semaphore!\";\n    else\n        ++value;\n    if(value>0) free_evt.notify();\n    return 0;\n}\n\n} \/\/ namespace scc\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *  Copyright (C) 2019 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#include <unit_test.h>\n#include <containers\/IntrusiveQueue.hpp>\n#include <float.h>\n#include <math.h>\n\nclass testContainer : public IntrusiveQueueNode<testContainer *>\n{\npublic:\n\tint i{0};\n};\n\nclass IntrusiveQueueTest : public UnitTest\n{\npublic:\n\tvirtual bool run_tests();\n\n\tbool test_push();\n\tbool test_pop();\n\tbool test_push_duplicate();\n\tbool test_remove();\n\n};\n\nbool IntrusiveQueueTest::run_tests()\n{\n\tut_run_test(test_push);\n\tut_run_test(test_pop);\n\tut_run_test(test_push_duplicate);\n\tut_run_test(test_remove);\n\n\treturn (_tests_failed == 0);\n}\n\nbool IntrusiveQueueTest::test_push()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\n\t\tut_compare(\"size increasing with i\", q1.size(), i);\n\t\tq1.push(t);\n\t\tut_compare(\"size increasing with i\", q1.size(), i + 1);\n\n\t\tut_assert_true(!q1.empty());\n\t}\n\n\t\/\/ verify full size (100)\n\tut_compare(\"size 100\", q1.size(), 100);\n\n\t\/\/ pop all elements\n\tfor (int i = 0; i < 100; i++) {\n\t\tauto node = q1.front();\n\t\tq1.pop();\n\t\tdelete node;\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_compare(\"size 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\treturn true;\n}\n\nbool IntrusiveQueueTest::test_pop()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\t\tq1.push(t);\n\t}\n\n\t\/\/ verify full size (100)\n\tut_assert_true(q1.size() == 100);\n\n\tfor (int i = 0; i < 100; i++) {\n\t\tauto node = q1.front();\n\t\tut_compare(\"stored i\", i, node->i);\n\n\t\tut_compare(\"size check\", q1.size(), 100 - i);\n\t\tq1.pop();\n\t\tut_compare(\"size check\", q1.size(), 100 - i - 1);\n\n\t\tdelete node;\n\n\t\tut_compare(\"size check\", q1.size(), 100 - i - 1);\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_assert_true(q1.empty());\n\tut_compare(\"size check\", q1.size(), 0);\n\n\t\/\/ pop an empty queue\n\tauto T = q1.pop();\n\tut_assert_true(T == nullptr);\n\tut_assert_true(q1.empty());\n\tut_compare(\"size check\", q1.size(), 0);\n\n\treturn true;\n}\n\nbool IntrusiveQueueTest::test_push_duplicate()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\n\t\tut_compare(\"size increasing with i\", q1.size(), i);\n\t\tq1.push(t);\n\t\tut_compare(\"size increasing with i\", q1.size(), i + 1);\n\n\t\tut_assert_true(!q1.empty());\n\t}\n\n\t\/\/ verify full size (100)\n\tut_compare(\"size 100\", q1.size(), 100);\n\n\n\t\/\/ attempt to insert front again\n\tconst auto q1_front = q1.front();\n\tconst auto q1_front_i = q1_front->i; \/\/ copy i value\n\n\tconst auto q1_back = q1.back();\n\tconst auto q1_back_i = q1_back->i; \/\/ copy i value\n\n\t\/\/ push front and back aagain\n\tq1.push(q1_front);\n\tq1.push(q1_back);\n\n\t\/\/ verify no change\n\tut_compare(\"size 100\", q1.size(), 100);\n\tut_compare(\"q front not reinserted\", q1.front()->i, q1_front->i);\n\tut_compare(\"q back not reinserted\", q1.back()->i, q1_back->i);\n\n\n\t\/\/ pop the head\n\tconst auto q1_head = q1.pop();\n\n\t\/\/ verfify size should now be 99\n\tut_compare(\"size 99\", q1.size(), 99);\n\n\t\/\/ push back on\n\tq1.push(q1_head);\n\n\t\/\/ verify size now 100 again\n\tut_compare(\"size 100\", q1.size(), 100);\n\n\n\t\/\/ pop all elements\n\tfor (int i = 0; i < 100; i++) {\n\t\tauto node = q1.front();\n\t\tq1.pop();\n\t\tdelete node;\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_compare(\"size 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\treturn true;\n}\n\nbool IntrusiveQueueTest::test_remove()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\t\tq1.push(t);\n\n\t\tut_compare(\"size increasing with i\", q1.size(), i + 1);\n\t\tut_assert_true(!q1.empty());\n\t}\n\n\t\/\/ verify full size (100)\n\tut_assert_true(q1.size() == 100);\n\n\t\/\/ test removing elements\n\tfor (int remove_i = 0; remove_i < 100; remove_i++) {\n\n\t\t\/\/ find node with i == remove_i\n\t\ttestContainer *removed = nullptr;\n\n\t\tfor (auto t : q1) {\n\t\t\tif (t->i == remove_i) {\n\t\t\t\tut_assert_true(q1.remove(t));\n\t\t\t\tremoved = t;\n\t\t\t}\n\t\t}\n\n\t\tdelete removed;\n\n\t\t\/\/ iterate list again to verify removal\n\t\tfor (auto t : q1) {\n\t\t\tut_assert_true(t->i != remove_i);\n\t\t}\n\n\t\tut_assert_true(q1.size() == 100 - remove_i - 1);\n\t}\n\n\t\/\/ list should now be empty\n\tut_assert_true(q1.empty());\n\tut_compare(\"size 0\", q1.size(), 0);\n\n\t\/\/ delete all elements (should be safe on empty list)\n\twhile (!q1.empty()) {\n\t\tq1.pop();\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_assert_true(q1.empty());\n\tut_compare(\"size 0\", q1.size(), 0);\n\n\treturn true;\n}\n\nut_declare_test_c(test_IntrusiveQueue, IntrusiveQueueTest)\n<commit_msg>tests: IntrusiveQueue test re-insert case<commit_after>\/****************************************************************************\n *\n *  Copyright (C) 2019 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#include <unit_test.h>\n#include <containers\/IntrusiveQueue.hpp>\n#include <float.h>\n#include <math.h>\n\nclass testContainer : public IntrusiveQueueNode<testContainer *>\n{\npublic:\n\tint i{0};\n};\n\nclass IntrusiveQueueTest : public UnitTest\n{\npublic:\n\tvirtual bool run_tests();\n\n\tbool test_push();\n\tbool test_pop();\n\tbool test_push_duplicate();\n\tbool test_remove();\n\tbool test_reinsert();\n\n};\n\nbool IntrusiveQueueTest::run_tests()\n{\n\tut_run_test(test_push);\n\tut_run_test(test_pop);\n\tut_run_test(test_push_duplicate);\n\tut_run_test(test_remove);\n\tut_run_test(test_reinsert);\n\n\treturn (_tests_failed == 0);\n}\n\nbool IntrusiveQueueTest::test_push()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\n\t\tut_compare(\"size increasing with i\", q1.size(), i);\n\t\tq1.push(t);\n\t\tut_compare(\"size increasing with i\", q1.size(), i + 1);\n\n\t\tut_assert_false(q1.empty());\n\t}\n\n\t\/\/ verify full size (100)\n\tut_compare(\"size 100\", q1.size(), 100);\n\n\t\/\/ pop all elements\n\tfor (int i = 0; i < 100; i++) {\n\t\tauto node = q1.front();\n\n\n\t\tut_assert_false(q1.empty());\n\n\t\tut_assert_true(q1.pop() == node);\n\t\tdelete node;\n\n\t\tbool expect_empty = (i == 100 - 1);\n\t\tut_compare(\"empty\", q1.empty(), expect_empty);\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_compare(\"size 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\treturn true;\n}\n\nbool IntrusiveQueueTest::test_pop()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\t\tq1.push(t);\n\t}\n\n\t\/\/ verify full size (100)\n\tut_assert_true(q1.size() == 100);\n\tut_assert_false(q1.empty());\n\n\tfor (int i = 0; i < 100; i++) {\n\t\tif (i < 100 - 1) {\n\t\t\tut_assert_false(q1.empty());\n\t\t}\n\n\t\tauto node = q1.front();\n\t\tut_compare(\"stored i\", i, node->i);\n\n\t\tut_compare(\"size check\", q1.size(), 100 - i);\n\t\tq1.pop();\n\n\t\tif (i < 100 - 1) {\n\t\t\tut_assert_false(q1.empty());\n\n\t\t} else {\n\t\t\tut_assert_true(q1.empty());\n\t\t}\n\n\t\tut_compare(\"size check\", q1.size(), 100 - i - 1);\n\n\t\tdelete node;\n\n\t\tut_compare(\"size check\", q1.size(), 100 - i - 1);\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_assert_true(q1.empty());\n\tut_compare(\"size check\", q1.size(), 0);\n\n\t\/\/ pop an empty queue\n\tauto T = q1.pop();\n\tut_assert_true(T == nullptr);\n\tut_assert_true(q1.empty());\n\tut_compare(\"size check\", q1.size(), 0);\n\n\treturn true;\n}\n\nbool IntrusiveQueueTest::test_push_duplicate()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\n\t\tut_compare(\"size increasing with i\", q1.size(), i);\n\t\tq1.push(t);\n\t\tut_compare(\"size increasing with i\", q1.size(), i + 1);\n\n\t\tut_assert_true(!q1.empty());\n\t}\n\n\t\/\/ verify full size (100)\n\tut_compare(\"size 100\", q1.size(), 100);\n\n\n\t\/\/ attempt to insert front again\n\tconst auto q1_front = q1.front();\n\tconst auto q1_front_i = q1_front->i; \/\/ copy i value\n\n\tconst auto q1_back = q1.back();\n\tconst auto q1_back_i = q1_back->i; \/\/ copy i value\n\n\t\/\/ push front and back aagain\n\tq1.push(q1_front);\n\tq1.push(q1_back);\n\n\t\/\/ verify no change\n\tut_compare(\"size 100\", q1.size(), 100);\n\tut_compare(\"q front not reinserted\", q1.front()->i, q1_front->i);\n\tut_compare(\"q back not reinserted\", q1.back()->i, q1_back->i);\n\n\n\t\/\/ pop the head\n\tconst auto q1_head = q1.pop();\n\n\t\/\/ verfify size should now be 99\n\tut_compare(\"size 99\", q1.size(), 99);\n\n\t\/\/ push back on\n\tq1.push(q1_head);\n\n\t\/\/ verify size now 100 again\n\tut_compare(\"size 100\", q1.size(), 100);\n\n\n\t\/\/ pop all elements\n\tfor (int i = 0; i < 100; i++) {\n\t\tauto node = q1.front();\n\t\tq1.pop();\n\t\tdelete node;\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_compare(\"size 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\treturn true;\n}\n\nbool IntrusiveQueueTest::test_remove()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\t\tq1.push(t);\n\n\t\tut_compare(\"size increasing with i\", q1.size(), i + 1);\n\t\tut_assert_true(!q1.empty());\n\t}\n\n\t\/\/ verify full size (100)\n\tut_assert_true(q1.size() == 100);\n\tut_assert_false(q1.empty());\n\n\t\/\/ test removing elements\n\tfor (int remove_i = 0; remove_i < 100; remove_i++) {\n\n\t\tut_assert_false(q1.empty());\n\n\t\t\/\/ find node with i == remove_i\n\t\ttestContainer *removed = nullptr;\n\n\t\tfor (auto t : q1) {\n\t\t\tif (t->i == remove_i) {\n\t\t\t\tut_assert_true(q1.remove(t));\n\t\t\t\tremoved = t;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ q1 shouldn't be empty until the very last iteration\n\t\tif (remove_i < 100 - 1) {\n\t\t\tut_assert_false(q1.empty());\n\n\t\t} else {\n\t\t\tut_assert_true(q1.empty());\n\t\t}\n\n\t\tdelete removed;\n\n\t\t\/\/ iterate list again to verify removal\n\t\tfor (auto t : q1) {\n\t\t\tut_assert_true(t->i != remove_i);\n\t\t}\n\n\t\tut_assert_true(q1.size() == 100 - remove_i - 1);\n\t}\n\n\t\/\/ list should now be empty\n\tut_assert_true(q1.empty());\n\tut_compare(\"size 0\", q1.size(), 0);\n\n\t\/\/ delete all elements (should be safe on empty list)\n\twhile (!q1.empty()) {\n\t\tq1.pop();\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_assert_true(q1.empty());\n\tut_compare(\"size 0\", q1.size(), 0);\n\n\treturn true;\n}\n\nbool IntrusiveQueueTest::test_reinsert()\n{\n\tIntrusiveQueue<testContainer *> q1;\n\n\t\/\/ size should be 0 initially\n\tut_compare(\"size initially 0\", q1.size(), 0);\n\tut_assert_true(q1.empty());\n\n\t\/\/ insert 100\n\tfor (int i = 0; i < 100; i++) {\n\t\ttestContainer *t = new testContainer();\n\t\tt->i = i;\n\t\tq1.push(t);\n\n\t\tut_compare(\"size increasing with i\", q1.size(), i + 1);\n\t\tut_assert_true(!q1.empty());\n\t}\n\n\t\/\/ verify full size (100)\n\tut_assert_true(q1.size() == 100);\n\tut_assert_false(q1.empty());\n\n\t\/\/ test removing elements\n\tfor (int remove_i = 0; remove_i < 100; remove_i++) {\n\n\t\tut_assert_false(q1.empty());\n\n\t\t\/\/ find node with i == remove_i\n\t\ttestContainer *removed = nullptr;\n\n\t\tfor (auto t : q1) {\n\t\t\tif (t->i == remove_i) {\n\t\t\t\tut_assert_true(q1.remove(t));\n\t\t\t\tremoved = t;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ q1 shouldn't be empty until the very last iteration\n\t\tut_assert_false(q1.empty());\n\n\t\t\/\/ iterate list again to verify removal\n\t\tfor (auto t : q1) {\n\t\t\tut_assert_true(t->i != remove_i);\n\t\t}\n\n\t\t\/\/ size temporarily reduced by 1\n\t\tut_assert_true(q1.size() == 100 - 1);\n\n\t\t\/\/ now re-insert the removed node\n\t\tconst size_t sz1 = q1.size();\n\t\tq1.push(removed);\n\t\tconst size_t sz2 = q1.size();\n\n\t\t\/\/ verify the size increase\n\t\tut_assert_true(sz2 > sz1);\n\n\t\t\/\/ size restored to 100\n\t\tut_assert_true(q1.size() == 100);\n\t}\n\n\t\/\/ queue shouldn't be empty\n\tut_assert_false(q1.empty());\n\tut_compare(\"size still 100\", q1.size(), 100);\n\n\t\/\/ delete all elements\n\twhile (!q1.empty()) {\n\t\tauto t = q1.pop();\n\t\tdelete t;\n\t}\n\n\t\/\/ verify list has been cleared\n\tut_assert_true(q1.empty());\n\tut_compare(\"size 0\", q1.size(), 0);\n\n\treturn true;\n}\n\nut_declare_test_c(test_IntrusiveQueue, IntrusiveQueueTest)\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 \"qsystemalignedtimer.h\"\n#include \"qsystemalignedtimer_meego_p.h\"\n#include <QDebug>\n\n#include <errno.h>\n#include <stdio.h>\n\nQTM_BEGIN_NAMESPACE\n\nQSystemAlignedTimerPrivate::QSystemAlignedTimerPrivate(QObject *parent)\n    : QObject(parent)\n    , m_lastError(QSystemAlignedTimer::NoError)\n    , m_minimumInterval(0)\n    , m_maximumInterval(0)\n    , m_running(false)\n    , m_singleShot(false)\n    , m_iphbdHandler(0)\n    , m_notifier(0)\n{\n    m_iphbdHandler = iphb_open(0);\n\n    if (!m_iphbdHandler) {\n        m_lastError = QSystemAlignedTimer::InternalError;\n        qDebug() << \"iphb_open error\" << m_iphbdHandler<< errno <<strerror(errno);\n        return;\n    }\n\n    int sockfd = iphb_get_fd(m_iphbdHandler);\n    if (!(sockfd > -1)) {\n        m_lastError = QSystemAlignedTimer::InternalError;\n        qDebug() << \"socket failure\"<<strerror(errno);\n        return;\n    }\n\n    m_notifier = new QSocketNotifier(sockfd, QSocketNotifier::Read, this);\n    if (!QObject::connect(m_notifier, SIGNAL(activated(int)), this, SLOT(heartbeatReceived(int)))) {\n        delete m_notifier, m_notifier = 0;\n        m_lastError = QSystemAlignedTimer::TimerFailed;\n        qDebug() << \"timer failure\";\n        return;\n    }\n    m_notifier->setEnabled(false);\n}\n\nQSystemAlignedTimerPrivate::~QSystemAlignedTimerPrivate()\n{\n    if (m_iphbdHandler)\n        (void)iphb_close(m_iphbdHandler);\n\n    if (m_notifier)\n        delete m_notifier;\n}\n\nvoid QSystemAlignedTimerPrivate::wokeUp()\n{\n    if (m_singleShot) {\n        stop();\n        return;\n    }\n\n    int st = iphb_I_woke_up(m_iphbdHandler);\n    if (!(st >= 0)) {\n        m_lastError = QSystemAlignedTimer::TimerFailed;\n        emit error(m_lastError);\n        stop();\n    }\n}\n\nint QSystemAlignedTimerPrivate::minimumInterval() const\n{\n    return m_minimumInterval;\n}\n\nvoid QSystemAlignedTimerPrivate::setMinimumInterval(int seconds)\n{\n    m_minimumInterval = seconds;\n}\n\nint QSystemAlignedTimerPrivate::maximumInterval() const\n{\n    return m_maximumInterval;\n}\n\nvoid QSystemAlignedTimerPrivate::setMaximumInterval(int seconds)\n{\n    m_maximumInterval = seconds;\n}\n\nvoid QSystemAlignedTimerPrivate::setSingleShot(bool singleShot)\n{\n    m_singleShot = singleShot;\n}\n\nbool QSystemAlignedTimerPrivate::isSingleShot() const\n{\n    return m_singleShot;\n}\n\nvoid QSystemAlignedTimerPrivate::singleShot(int minimumTime, int maximumTime, QObject *receiver, const char *member)\n{\n    if (receiver && member) {\n        QSystemAlignedTimerPrivate *alignedTimer = new QSystemAlignedTimerPrivate(receiver);\n\n        alignedTimer->m_singleShot = true;\n\n        connect(alignedTimer, SIGNAL(timeout()), receiver, member);\n        alignedTimer->start(minimumTime, maximumTime);\n    }\n}\n\nQSystemAlignedTimer::AlignedTimerError QSystemAlignedTimerPrivate::lastError() const\n{\n    return m_lastError;\n}\n\nvoid QSystemAlignedTimerPrivate::start(int minimumTime, int maximumTime)\n{\n    m_minimumInterval = minimumTime;\n    m_maximumInterval = maximumTime;\n\n    start();\n}\n\nvoid QSystemAlignedTimerPrivate::start()\n{\n    if (m_running)\n        return;\n\n    if (!(m_iphbdHandler && m_notifier)) {\n        m_lastError = QSystemAlignedTimer::InternalError;\n        emit error(m_lastError);\n        return;\n    }\n\n    int mustWait = 0;\n    time_t unixTime = iphb_wait(m_iphbdHandler, m_minimumInterval, m_maximumInterval, mustWait);\n\n    if (unixTime == (time_t)-1) {\n        m_lastError = QSystemAlignedTimer::TimerFailed;\n        emit error(m_lastError);\n        return;\n    }\n\n    m_notifier->setEnabled(true);\n    m_running = true;\n    m_lastError = QSystemAlignedTimer::NoError;\n}\n\nvoid QSystemAlignedTimerPrivate::stop()\n{\n    if (!m_running)\n        return;\n\n    if (!(m_iphbdHandler && m_notifier)) {\n        m_lastError = QSystemAlignedTimer::InternalError;\n        emit error(m_lastError);\n        return;\n    }\n\n    (void)iphb_discard_wakeups(m_iphbdHandler);\n\n    m_notifier->setEnabled(false);\n    m_running = false;\n    m_lastError = QSystemAlignedTimer::NoError;\n}\n\nvoid QSystemAlignedTimerPrivate::heartbeatReceived(int sock) {\n    Q_UNUSED(sock);\n\n    stop();\n    emit timeout();\n\n    if (!m_singleShot)\n        start();\n}\n\nbool QSystemAlignedTimerPrivate::isActive() const\n{\n    return m_running;\n}\n\n#include \"moc_qsystemalignedtimer_meego_p.cpp\"\n\nQTM_END_NAMESPACE\n<commit_msg>Fix a double free in m_notifier<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 \"qsystemalignedtimer.h\"\n#include \"qsystemalignedtimer_meego_p.h\"\n#include <QDebug>\n\n#include <errno.h>\n#include <stdio.h>\n\nQTM_BEGIN_NAMESPACE\n\nQSystemAlignedTimerPrivate::QSystemAlignedTimerPrivate(QObject *parent)\n    : QObject(parent)\n    , m_lastError(QSystemAlignedTimer::NoError)\n    , m_minimumInterval(0)\n    , m_maximumInterval(0)\n    , m_running(false)\n    , m_singleShot(false)\n    , m_iphbdHandler(0)\n    , m_notifier(0)\n{\n    m_iphbdHandler = iphb_open(0);\n\n    if (!m_iphbdHandler) {\n        m_lastError = QSystemAlignedTimer::InternalError;\n        qDebug() << \"iphb_open error\" << m_iphbdHandler<< errno <<strerror(errno);\n        return;\n    }\n\n    int sockfd = iphb_get_fd(m_iphbdHandler);\n    if (!(sockfd > -1)) {\n        m_lastError = QSystemAlignedTimer::InternalError;\n        qDebug() << \"socket failure\"<<strerror(errno);\n        return;\n    }\n\n    m_notifier = new QSocketNotifier(sockfd, QSocketNotifier::Read);\n    if (!QObject::connect(m_notifier, SIGNAL(activated(int)), this, SLOT(heartbeatReceived(int)))) {\n        delete m_notifier, m_notifier = 0;\n        m_lastError = QSystemAlignedTimer::TimerFailed;\n        qDebug() << \"timer failure\";\n        return;\n    }\n    m_notifier->setEnabled(false);\n}\n\nQSystemAlignedTimerPrivate::~QSystemAlignedTimerPrivate()\n{\n    if (m_iphbdHandler)\n        (void)iphb_close(m_iphbdHandler);\n\n    if (m_notifier)\n        delete m_notifier;\n}\n\nvoid QSystemAlignedTimerPrivate::wokeUp()\n{\n    if (m_singleShot) {\n        stop();\n        return;\n    }\n\n    int st = iphb_I_woke_up(m_iphbdHandler);\n    if (!(st >= 0)) {\n        m_lastError = QSystemAlignedTimer::TimerFailed;\n        emit error(m_lastError);\n        stop();\n    }\n}\n\nint QSystemAlignedTimerPrivate::minimumInterval() const\n{\n    return m_minimumInterval;\n}\n\nvoid QSystemAlignedTimerPrivate::setMinimumInterval(int seconds)\n{\n    m_minimumInterval = seconds;\n}\n\nint QSystemAlignedTimerPrivate::maximumInterval() const\n{\n    return m_maximumInterval;\n}\n\nvoid QSystemAlignedTimerPrivate::setMaximumInterval(int seconds)\n{\n    m_maximumInterval = seconds;\n}\n\nvoid QSystemAlignedTimerPrivate::setSingleShot(bool singleShot)\n{\n    m_singleShot = singleShot;\n}\n\nbool QSystemAlignedTimerPrivate::isSingleShot() const\n{\n    return m_singleShot;\n}\n\nvoid QSystemAlignedTimerPrivate::singleShot(int minimumTime, int maximumTime, QObject *receiver, const char *member)\n{\n    if (receiver && member) {\n        QSystemAlignedTimerPrivate *alignedTimer = new QSystemAlignedTimerPrivate(receiver);\n\n        alignedTimer->m_singleShot = true;\n\n        connect(alignedTimer, SIGNAL(timeout()), receiver, member);\n        alignedTimer->start(minimumTime, maximumTime);\n    }\n}\n\nQSystemAlignedTimer::AlignedTimerError QSystemAlignedTimerPrivate::lastError() const\n{\n    return m_lastError;\n}\n\nvoid QSystemAlignedTimerPrivate::start(int minimumTime, int maximumTime)\n{\n    m_minimumInterval = minimumTime;\n    m_maximumInterval = maximumTime;\n\n    start();\n}\n\nvoid QSystemAlignedTimerPrivate::start()\n{\n    if (m_running)\n        return;\n\n    if (!(m_iphbdHandler && m_notifier)) {\n        m_lastError = QSystemAlignedTimer::InternalError;\n        emit error(m_lastError);\n        return;\n    }\n\n    int mustWait = 0;\n    time_t unixTime = iphb_wait(m_iphbdHandler, m_minimumInterval, m_maximumInterval, mustWait);\n\n    if (unixTime == (time_t)-1) {\n        m_lastError = QSystemAlignedTimer::TimerFailed;\n        emit error(m_lastError);\n        return;\n    }\n\n    m_notifier->setEnabled(true);\n    m_running = true;\n    m_lastError = QSystemAlignedTimer::NoError;\n}\n\nvoid QSystemAlignedTimerPrivate::stop()\n{\n    if (!m_running)\n        return;\n\n    if (!(m_iphbdHandler && m_notifier)) {\n        m_lastError = QSystemAlignedTimer::InternalError;\n        emit error(m_lastError);\n        return;\n    }\n\n    (void)iphb_discard_wakeups(m_iphbdHandler);\n\n    m_notifier->setEnabled(false);\n    m_running = false;\n    m_lastError = QSystemAlignedTimer::NoError;\n}\n\nvoid QSystemAlignedTimerPrivate::heartbeatReceived(int sock) {\n    Q_UNUSED(sock);\n\n    stop();\n    emit timeout();\n\n    if (!m_singleShot)\n        start();\n}\n\nbool QSystemAlignedTimerPrivate::isActive() const\n{\n    return m_running;\n}\n\n#include \"moc_qsystemalignedtimer_meego_p.cpp\"\n\nQTM_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of meshoptimizer library; see meshoptimizer.hpp for version\/license details\r\n#include \"meshoptimizer.hpp\"\r\n\r\n#include <algorithm>\r\n#include <cassert>\r\n#include <cmath>\r\n#include <functional>\r\n#include <vector>\r\n\r\n\/\/ This work is based on:\r\n\/\/ Pedro Sander, Diego Nehab and Joshua Barcz. Fast Triangle Reordering for Vertex Locality and Reduced Overdraw. 2007\r\nnamespace meshopt\r\n{\r\n\r\nstruct Vector3\r\n{\r\n\tfloat x, y, z;\r\n};\r\n\r\nstruct ClusterSortData\r\n{\r\n\tunsigned int cluster;\r\n\tfloat dot_product;\r\n\r\n\tbool operator>(const ClusterSortData& other) const\r\n\t{\r\n\t\treturn (dot_product > other.dot_product);\r\n\t}\r\n};\r\n\r\nstatic void calculateSortData(std::vector<ClusterSortData>& sort_data, const unsigned int* indices, size_t index_count, const float* vertex_positions, size_t vertex_positions_stride, const std::vector<unsigned int>& clusters)\r\n{\r\n\tassert(sort_data.size() == clusters.size());\r\n\r\n\tsize_t vertex_stride_float = vertex_positions_stride \/ sizeof(float);\r\n\r\n\tVector3 mesh_centroid = Vector3();\r\n\r\n\tfor (size_t i = 0; i < index_count; ++i)\r\n\t{\r\n\t\tconst Vector3& p = *reinterpret_cast<const Vector3*>(vertex_positions + vertex_stride_float * indices[i]);\r\n\r\n\t\tmesh_centroid.x += p.x;\r\n\t\tmesh_centroid.y += p.y;\r\n\t\tmesh_centroid.z += p.z;\r\n\t}\r\n\r\n\tmesh_centroid.x \/= index_count;\r\n\tmesh_centroid.y \/= index_count;\r\n\tmesh_centroid.z \/= index_count;\r\n\r\n\tfor (size_t cluster = 0; cluster < clusters.size(); ++cluster)\r\n\t{\r\n\t\tsize_t cluster_begin = clusters[cluster] * 3;\r\n\t\tsize_t cluster_end = (clusters.size() > cluster + 1) ? clusters[cluster + 1] * 3 : index_count;\r\n\r\n\t\tfloat cluster_area = 0;\r\n\t\tVector3 cluster_centroid = Vector3();\r\n\t\tVector3 cluster_normal = Vector3();\r\n\r\n\t\tfor (size_t i = cluster_begin; i < cluster_end; i += 3)\r\n\t\t{\r\n\t\t\tconst Vector3& p0 = *reinterpret_cast<const Vector3*>(vertex_positions + vertex_stride_float * indices[i + 0]);\r\n\t\t\tconst Vector3& p1 = *reinterpret_cast<const Vector3*>(vertex_positions + vertex_stride_float * indices[i + 1]);\r\n\t\t\tconst Vector3& p2 = *reinterpret_cast<const Vector3*>(vertex_positions + vertex_stride_float * indices[i + 2]);\r\n\r\n\t\t\tVector3 p10 = {p1.x - p0.x, p1.y - p0.y, p1.z - p0.z};\r\n\t\t\tVector3 p20 = {p2.x - p0.x, p2.y - p0.y, p2.z - p0.z};\r\n\t\t\tVector3 normal = {p10.y * p20.z - p10.z * p20.y, p10.z * p20.x - p10.x * p20.z, p10.x * p20.y - p10.y * p20.x};\r\n\r\n\t\t\tfloat area = sqrtf(normal.x * normal.x + normal.y * normal.y + normal.z * normal.z);\r\n\t\t\tVector3 centroid_area = {(p0.x + p1.x + p2.x) * (area \/ 3), (p0.y + p1.y + p2.y) * (area \/ 3), (p0.z + p1.z + p2.z) * (area \/ 3)};\r\n\r\n\t\t\tcluster_centroid.x += centroid_area.x;\r\n\t\t\tcluster_centroid.y += centroid_area.y;\r\n\t\t\tcluster_centroid.z += centroid_area.z;\r\n\t\t\tcluster_normal.x += normal.x;\r\n\t\t\tcluster_normal.y += normal.y;\r\n\t\t\tcluster_normal.z += normal.z;\r\n\t\t\tcluster_area += area;\r\n\t\t}\r\n\r\n\t\tfloat inv_cluster_area = cluster_area == 0 ? 0 : 1 \/ cluster_area;\r\n\r\n\t\tcluster_centroid.x *= inv_cluster_area;\r\n\t\tcluster_centroid.y *= inv_cluster_area;\r\n\t\tcluster_centroid.z *= inv_cluster_area;\r\n\r\n\t\tfloat cluster_normal_length = sqrtf(cluster_normal.x * cluster_normal.x + cluster_normal.y * cluster_normal.y + cluster_normal.z * cluster_normal.z);\r\n\t\tfloat inv_cluster_normal_length = cluster_normal_length == 0 ? 0 : 1 \/ cluster_normal_length;\r\n\r\n\t\tcluster_normal.x *= inv_cluster_normal_length;\r\n\t\tcluster_normal.y *= inv_cluster_normal_length;\r\n\t\tcluster_normal.z *= inv_cluster_normal_length;\r\n\r\n\t\tVector3 centroid_vector = {cluster_centroid.x - mesh_centroid.x, cluster_centroid.y - mesh_centroid.y, cluster_centroid.z - mesh_centroid.z};\r\n\r\n\t\tsort_data[cluster].cluster = static_cast<unsigned int>(cluster);\r\n\t\tsort_data[cluster].dot_product = centroid_vector.x * cluster_normal.x + centroid_vector.y * cluster_normal.y + centroid_vector.z * cluster_normal.z;\r\n\t}\r\n}\r\n\r\nstatic unsigned int updateCache(unsigned int a, unsigned int b, unsigned int c, unsigned int cache_size, std::vector<unsigned int>& cache_timestamps, unsigned int& timestamp)\r\n{\r\n\tassert(a < cache_timestamps.size());\r\n\tassert(b < cache_timestamps.size());\r\n\tassert(c < cache_timestamps.size());\r\n\r\n\tunsigned int cache_misses = 0;\r\n\r\n\t\/\/ if vertex is not in cache, put it in cache\r\n\tif (timestamp - cache_timestamps[a] > cache_size)\r\n\t{\r\n\t\tcache_timestamps[a] = timestamp++;\r\n\t\tcache_misses++;\r\n\t}\r\n\r\n\tif (timestamp - cache_timestamps[b] > cache_size)\r\n\t{\r\n\t\tcache_timestamps[b] = timestamp++;\r\n\t\tcache_misses++;\r\n\t}\r\n\r\n\tif (timestamp - cache_timestamps[c] > cache_size)\r\n\t{\r\n\t\tcache_timestamps[c] = timestamp++;\r\n\t\tcache_misses++;\r\n\t}\r\n\r\n\treturn cache_misses;\r\n}\r\n\r\nstatic float generateHardBoundaries(std::vector<unsigned int>& destination, const unsigned int* indices, size_t index_count, size_t vertex_count, unsigned int cache_size)\r\n{\r\n\tstd::vector<unsigned int> cache_timestamps(vertex_count, 0);\r\n\tunsigned int timestamp = cache_size + 1;\r\n\r\n\tunsigned int cache_misses = 0;\r\n\r\n\tsize_t face_count = index_count \/ 3;\r\n\r\n\tfor (size_t i = 0; i < face_count; ++i)\r\n\t{\r\n\t\tunsigned int m = updateCache(indices[i * 3 + 0], indices[i * 3 + 1], indices[i * 3 + 2], cache_size, cache_timestamps, timestamp);\r\n\r\n\t\tif (i == 0 || m == 3)\r\n\t\t{\r\n\t\t\tdestination.push_back(unsigned(i));\r\n\t\t}\r\n\r\n\t\tcache_misses += m;\r\n\t}\r\n\r\n\treturn float(cache_misses) \/ float(face_count);\r\n}\r\n\r\nstatic void generateSoftBoundaries(std::vector<unsigned int>& destination, const unsigned int* indices, size_t index_count, size_t vertex_count, const std::vector<unsigned int>& clusters, unsigned int cache_size, float acmr_threshold)\r\n{\r\n\tstd::vector<unsigned int> cache_timestamps(vertex_count, 0);\r\n\tunsigned int timestamp = 0;\r\n\r\n\tfor (size_t it = 0; it < clusters.size(); ++it)\r\n\t{\r\n\t\tsize_t start = clusters[it];\r\n\t\tsize_t end = (it + 1 < clusters.size()) ? clusters[it + 1] : index_count \/ 3;\r\n\t\tassert(start <= end);\r\n\r\n\t\tunsigned int running_misses = 0;\r\n\t\tunsigned int running_faces = 0;\r\n\r\n\t\t\/\/ reset cache\r\n\t\ttimestamp += cache_size + 1;\r\n\r\n\t\tdestination.push_back(unsigned(start));\r\n\r\n\t\tfor (size_t i = start; i < end; ++i)\r\n\t\t{\r\n\t\t\tunsigned int m = updateCache(indices[i * 3 + 0], indices[i * 3 + 1], indices[i * 3 + 2], cache_size, cache_timestamps, timestamp);\r\n\r\n\t\t\trunning_misses += m;\r\n\t\t\trunning_faces += 1;\r\n\r\n\t\t\tif (float(running_misses) \/ float(running_faces) <= acmr_threshold && i != start)\r\n\t\t\t{\r\n\t\t\t\tdestination.push_back(unsigned(i));\r\n\r\n\t\t\t\t\/\/ reset cache\r\n\t\t\t\ttimestamp += cache_size + 1;\r\n\r\n\t\t\t\trunning_misses = 0;\r\n\t\t\t\trunning_faces = 0;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tassert(destination.size() >= clusters.size());\r\n\tassert(destination.size() <= index_count \/ 3);\r\n}\r\n\r\nvoid optimizeOverdraw(unsigned int* destination, const unsigned int* indices, size_t index_count, const float* vertex_positions, size_t vertex_positions_stride, size_t vertex_count, unsigned int cache_size, float threshold)\r\n{\r\n\tassert(index_count % 3 == 0);\r\n\tassert(vertex_positions_stride > 0);\r\n\tassert(vertex_positions_stride % sizeof(float) == 0);\r\n\tassert(cache_size >= 3);\r\n\r\n\t\/\/ guard for empty meshes\r\n\tif (index_count == 0 || vertex_count == 0)\r\n\t{\r\n\t\treturn;\r\n\t}\r\n\r\n\t\/\/ support in-place optimization\r\n\tstd::vector<unsigned int> indices_copy;\r\n\r\n\tif (destination == indices)\r\n\t{\r\n\t\tindices_copy.assign(indices, indices + index_count);\r\n\t\tindices = &indices_copy[0];\r\n\t}\r\n\r\n\t\/\/ generate hard boundaries from full-triangle cache misses\r\n\tstd::vector<unsigned int> hard_clusters;\r\n\tfloat acmr = generateHardBoundaries(hard_clusters, indices, index_count, vertex_count, cache_size);\r\n\r\n\t\/\/ generate soft boundaries\r\n\tstd::vector<unsigned int> soft_clusters;\r\n\tgenerateSoftBoundaries(soft_clusters, indices, index_count, vertex_count, hard_clusters, cache_size, acmr * threshold);\r\n\r\n\tconst std::vector<unsigned int>& clusters = soft_clusters;\r\n\r\n\t\/\/ fill sort data\r\n\tstd::vector<ClusterSortData> sort_data(clusters.size());\r\n\tcalculateSortData(sort_data, indices, index_count, vertex_positions, vertex_positions_stride, clusters);\r\n\r\n\t\/\/ high product = possible occluder, render early\r\n\tstd::sort(sort_data.begin(), sort_data.end(), std::greater<ClusterSortData>());\r\n\r\n\t\/\/ fill output buffer\r\n\tsize_t offset = 0;\r\n\r\n\tfor (size_t i = 0; i < clusters.size(); ++i)\r\n\t{\r\n\t\tunsigned int cluster = sort_data[i].cluster;\r\n\r\n\t\tsize_t cluster_begin = clusters[cluster] * 3;\r\n\t\tsize_t cluster_end = (cluster + 1 < clusters.size()) ? clusters[cluster + 1] * 3 : index_count;\r\n\r\n\t\tfor (size_t j = cluster_begin; j < cluster_end; ++j)\r\n\t\t\tdestination[offset++] = indices[j];\r\n\t}\r\n\r\n\tassert(offset == index_count);\r\n}\r\n\r\n} \/\/ namespace meshopt\r\n<commit_msg>overdraw: Significantly improve overdraw\/vcache balance<commit_after>\/\/ This file is part of meshoptimizer library; see meshoptimizer.hpp for version\/license details\r\n#include \"meshoptimizer.hpp\"\r\n\r\n#include <algorithm>\r\n#include <cassert>\r\n#include <cmath>\r\n#include <functional>\r\n#include <vector>\r\n\r\n\/\/ This work is based on:\r\n\/\/ Pedro Sander, Diego Nehab and Joshua Barcz. Fast Triangle Reordering for Vertex Locality and Reduced Overdraw. 2007\r\nnamespace meshopt\r\n{\r\n\r\nstruct Vector3\r\n{\r\n\tfloat x, y, z;\r\n};\r\n\r\nstruct ClusterSortData\r\n{\r\n\tunsigned int cluster;\r\n\tfloat dot_product;\r\n\r\n\tbool operator>(const ClusterSortData& other) const\r\n\t{\r\n\t\treturn (dot_product > other.dot_product);\r\n\t}\r\n};\r\n\r\nstatic void calculateSortData(std::vector<ClusterSortData>& sort_data, const unsigned int* indices, size_t index_count, const float* vertex_positions, size_t vertex_positions_stride, const std::vector<unsigned int>& clusters)\r\n{\r\n\tassert(sort_data.size() == clusters.size());\r\n\r\n\tsize_t vertex_stride_float = vertex_positions_stride \/ sizeof(float);\r\n\r\n\tVector3 mesh_centroid = Vector3();\r\n\r\n\tfor (size_t i = 0; i < index_count; ++i)\r\n\t{\r\n\t\tconst Vector3& p = *reinterpret_cast<const Vector3*>(vertex_positions + vertex_stride_float * indices[i]);\r\n\r\n\t\tmesh_centroid.x += p.x;\r\n\t\tmesh_centroid.y += p.y;\r\n\t\tmesh_centroid.z += p.z;\r\n\t}\r\n\r\n\tmesh_centroid.x \/= index_count;\r\n\tmesh_centroid.y \/= index_count;\r\n\tmesh_centroid.z \/= index_count;\r\n\r\n\tfor (size_t cluster = 0; cluster < clusters.size(); ++cluster)\r\n\t{\r\n\t\tsize_t cluster_begin = clusters[cluster] * 3;\r\n\t\tsize_t cluster_end = (clusters.size() > cluster + 1) ? clusters[cluster + 1] * 3 : index_count;\r\n\t\tassert(cluster_begin < cluster_end);\r\n\r\n\t\tfloat cluster_area = 0;\r\n\t\tVector3 cluster_centroid = Vector3();\r\n\t\tVector3 cluster_normal = Vector3();\r\n\r\n\t\tfor (size_t i = cluster_begin; i < cluster_end; i += 3)\r\n\t\t{\r\n\t\t\tconst Vector3& p0 = *reinterpret_cast<const Vector3*>(vertex_positions + vertex_stride_float * indices[i + 0]);\r\n\t\t\tconst Vector3& p1 = *reinterpret_cast<const Vector3*>(vertex_positions + vertex_stride_float * indices[i + 1]);\r\n\t\t\tconst Vector3& p2 = *reinterpret_cast<const Vector3*>(vertex_positions + vertex_stride_float * indices[i + 2]);\r\n\r\n\t\t\tVector3 p10 = {p1.x - p0.x, p1.y - p0.y, p1.z - p0.z};\r\n\t\t\tVector3 p20 = {p2.x - p0.x, p2.y - p0.y, p2.z - p0.z};\r\n\t\t\tVector3 normal = {p10.y * p20.z - p10.z * p20.y, p10.z * p20.x - p10.x * p20.z, p10.x * p20.y - p10.y * p20.x};\r\n\r\n\t\t\tfloat area = sqrtf(normal.x * normal.x + normal.y * normal.y + normal.z * normal.z);\r\n\t\t\tVector3 centroid_area = {(p0.x + p1.x + p2.x) * (area \/ 3), (p0.y + p1.y + p2.y) * (area \/ 3), (p0.z + p1.z + p2.z) * (area \/ 3)};\r\n\r\n\t\t\tcluster_centroid.x += centroid_area.x;\r\n\t\t\tcluster_centroid.y += centroid_area.y;\r\n\t\t\tcluster_centroid.z += centroid_area.z;\r\n\t\t\tcluster_normal.x += normal.x;\r\n\t\t\tcluster_normal.y += normal.y;\r\n\t\t\tcluster_normal.z += normal.z;\r\n\t\t\tcluster_area += area;\r\n\t\t}\r\n\r\n\t\tfloat inv_cluster_area = cluster_area == 0 ? 0 : 1 \/ cluster_area;\r\n\r\n\t\tcluster_centroid.x *= inv_cluster_area;\r\n\t\tcluster_centroid.y *= inv_cluster_area;\r\n\t\tcluster_centroid.z *= inv_cluster_area;\r\n\r\n\t\tfloat cluster_normal_length = sqrtf(cluster_normal.x * cluster_normal.x + cluster_normal.y * cluster_normal.y + cluster_normal.z * cluster_normal.z);\r\n\t\tfloat inv_cluster_normal_length = cluster_normal_length == 0 ? 0 : 1 \/ cluster_normal_length;\r\n\r\n\t\tcluster_normal.x *= inv_cluster_normal_length;\r\n\t\tcluster_normal.y *= inv_cluster_normal_length;\r\n\t\tcluster_normal.z *= inv_cluster_normal_length;\r\n\r\n\t\tVector3 centroid_vector = {cluster_centroid.x - mesh_centroid.x, cluster_centroid.y - mesh_centroid.y, cluster_centroid.z - mesh_centroid.z};\r\n\r\n\t\tsort_data[cluster].cluster = static_cast<unsigned int>(cluster);\r\n\t\tsort_data[cluster].dot_product = centroid_vector.x * cluster_normal.x + centroid_vector.y * cluster_normal.y + centroid_vector.z * cluster_normal.z;\r\n\t}\r\n}\r\n\r\nstatic unsigned int updateCache(unsigned int a, unsigned int b, unsigned int c, unsigned int cache_size, std::vector<unsigned int>& cache_timestamps, unsigned int& timestamp)\r\n{\r\n\tassert(a < cache_timestamps.size());\r\n\tassert(b < cache_timestamps.size());\r\n\tassert(c < cache_timestamps.size());\r\n\r\n\tunsigned int cache_misses = 0;\r\n\r\n\t\/\/ if vertex is not in cache, put it in cache\r\n\tif (timestamp - cache_timestamps[a] > cache_size)\r\n\t{\r\n\t\tcache_timestamps[a] = timestamp++;\r\n\t\tcache_misses++;\r\n\t}\r\n\r\n\tif (timestamp - cache_timestamps[b] > cache_size)\r\n\t{\r\n\t\tcache_timestamps[b] = timestamp++;\r\n\t\tcache_misses++;\r\n\t}\r\n\r\n\tif (timestamp - cache_timestamps[c] > cache_size)\r\n\t{\r\n\t\tcache_timestamps[c] = timestamp++;\r\n\t\tcache_misses++;\r\n\t}\r\n\r\n\treturn cache_misses;\r\n}\r\n\r\nstatic void generateHardBoundaries(std::vector<unsigned int>& destination, const unsigned int* indices, size_t index_count, size_t vertex_count, unsigned int cache_size)\r\n{\r\n\tstd::vector<unsigned int> cache_timestamps(vertex_count, 0);\r\n\tunsigned int timestamp = cache_size + 1;\r\n\r\n\tsize_t face_count = index_count \/ 3;\r\n\r\n\tfor (size_t i = 0; i < face_count; ++i)\r\n\t{\r\n\t\tunsigned int m = updateCache(indices[i * 3 + 0], indices[i * 3 + 1], indices[i * 3 + 2], cache_size, cache_timestamps, timestamp);\r\n\r\n\t\t\/\/ when all three vertices are not in the cache it's usually relatively safe to assume that this is a new patch in the mesh\r\n\t\t\/\/ that is disjoint from previous vertices; sometimes it might come back to reference existing vertices but that frequently\r\n\t\t\/\/ suggests an inefficiency in the vertex cache optimization algorithm\r\n\t\t\/\/ usually the first triangle has 3 misses unless it's degenerate - thus we make sure the first cluster always starts with 0\r\n\t\tif (i == 0 || m == 3)\r\n\t\t{\r\n\t\t\tdestination.push_back(unsigned(i));\r\n\t\t}\r\n\t}\r\n}\r\n\r\nstatic void generateSoftBoundaries(std::vector<unsigned int>& destination, const unsigned int* indices, size_t index_count, size_t vertex_count, const std::vector<unsigned int>& clusters, unsigned int cache_size, float threshold)\r\n{\r\n\tstd::vector<unsigned int> cache_timestamps(vertex_count, 0);\r\n\tunsigned int timestamp = 0;\r\n\r\n\tfor (size_t it = 0; it < clusters.size(); ++it)\r\n\t{\r\n\t\tsize_t start = clusters[it];\r\n\t\tsize_t end = (it + 1 < clusters.size()) ? clusters[it + 1] : index_count \/ 3;\r\n\t\tassert(start < end);\r\n\r\n\t\t\/\/ reset cache\r\n\t\ttimestamp += cache_size + 1;\r\n\r\n\t\t\/\/ measure cluster ACMR\r\n\t\tunsigned int cluster_misses = 0;\r\n\r\n\t\tfor (size_t i = start; i < end; ++i)\r\n\t\t{\r\n\t\t\tunsigned int m = updateCache(indices[i * 3 + 0], indices[i * 3 + 1], indices[i * 3 + 2], cache_size, cache_timestamps, timestamp);\r\n\r\n\t\t\tcluster_misses += m;\r\n\t\t}\r\n\r\n\t\tfloat cluster_threshold = threshold * (float(cluster_misses) \/ float(end - start));\r\n\r\n\t\t\/\/ first cluster always starts from the hard cluster boundary\r\n\t\tdestination.push_back(unsigned(start));\r\n\r\n\t\t\/\/ reset cache\r\n\t\ttimestamp += cache_size + 1;\r\n\r\n\t\tunsigned int running_misses = 0;\r\n\t\tunsigned int running_faces = 0;\r\n\r\n\t\tfor (size_t i = start; i < end; ++i)\r\n\t\t{\r\n\t\t\tunsigned int m = updateCache(indices[i * 3 + 0], indices[i * 3 + 1], indices[i * 3 + 2], cache_size, cache_timestamps, timestamp);\r\n\r\n\t\t\trunning_misses += m;\r\n\t\t\trunning_faces += 1;\r\n\r\n\t\t\tif (float(running_misses) \/ float(running_faces) <= cluster_threshold)\r\n\t\t\t{\r\n\t\t\t\t\/\/ we have reached the target ACMR with the current triangle so we need to start a new cluster on the next one\r\n\t\t\t\t\/\/ note that this may mean that we add 'end` to destination for the last triangle, which will imply that the last\r\n\t\t\t\t\/\/ cluster is empty; however, the 'pop_back' after the loop will clean it up\r\n\t\t\t\tdestination.push_back(unsigned(i + 1));\r\n\r\n\t\t\t\t\/\/ reset cache\r\n\t\t\t\ttimestamp += cache_size + 1;\r\n\r\n\t\t\t\trunning_misses = 0;\r\n\t\t\t\trunning_faces = 0;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/ each time we reach the target ACMR we flush the cluster\r\n\t\t\/\/ this means that the last cluster is by definition not very good - there are frequent cases where we are left with a few triangles\r\n\t\t\/\/ in the last cluster, producing a very bad ACMR and significantly penalizing the overall results\r\n\t\t\/\/ thus we remove the last cluster boundary, merging the last complete cluster with the last incomplete one\r\n\t\t\/\/ there are sometimes cases when the last cluster is actually good enough - in which case the code above would have added 'end'\r\n\t\t\/\/ to the cluster boundary array which we need to remove anyway - this code will do that automatically\r\n\t\tif (destination.back() != start)\r\n\t\t{\r\n\t\t\tdestination.pop_back();\r\n\t\t}\r\n\t}\r\n\r\n\tassert(destination.size() >= clusters.size());\r\n\tassert(destination.size() <= index_count \/ 3);\r\n}\r\n\r\nvoid optimizeOverdraw(unsigned int* destination, const unsigned int* indices, size_t index_count, const float* vertex_positions, size_t vertex_positions_stride, size_t vertex_count, unsigned int cache_size, float threshold)\r\n{\r\n\tassert(index_count % 3 == 0);\r\n\tassert(vertex_positions_stride > 0);\r\n\tassert(vertex_positions_stride % sizeof(float) == 0);\r\n\tassert(cache_size >= 3);\r\n\r\n\t\/\/ guard for empty meshes\r\n\tif (index_count == 0 || vertex_count == 0)\r\n\t{\r\n\t\treturn;\r\n\t}\r\n\r\n\t\/\/ support in-place optimization\r\n\tstd::vector<unsigned int> indices_copy;\r\n\r\n\tif (destination == indices)\r\n\t{\r\n\t\tindices_copy.assign(indices, indices + index_count);\r\n\t\tindices = &indices_copy[0];\r\n\t}\r\n\r\n\t\/\/ generate hard boundaries from full-triangle cache misses\r\n\tstd::vector<unsigned int> hard_clusters;\r\n\tgenerateHardBoundaries(hard_clusters, indices, index_count, vertex_count, cache_size);\r\n\r\n\t\/\/ generate soft boundaries\r\n\tstd::vector<unsigned int> soft_clusters;\r\n\tgenerateSoftBoundaries(soft_clusters, indices, index_count, vertex_count, hard_clusters, cache_size, threshold);\r\n\r\n\tconst std::vector<unsigned int>& clusters = soft_clusters;\r\n\r\n\t\/\/ fill sort data\r\n\tstd::vector<ClusterSortData> sort_data(clusters.size());\r\n\tcalculateSortData(sort_data, indices, index_count, vertex_positions, vertex_positions_stride, clusters);\r\n\r\n\t\/\/ high product = possible occluder, render early\r\n\tstd::sort(sort_data.begin(), sort_data.end(), std::greater<ClusterSortData>());\r\n\r\n\t\/\/ fill output buffer\r\n\tsize_t offset = 0;\r\n\r\n\tfor (size_t i = 0; i < clusters.size(); ++i)\r\n\t{\r\n\t\tunsigned int cluster = sort_data[i].cluster;\r\n\t\tassert(cluster < clusters.size());\r\n\r\n\t\tsize_t cluster_begin = clusters[cluster] * 3;\r\n\t\tsize_t cluster_end = (cluster + 1 < clusters.size()) ? clusters[cluster + 1] * 3 : index_count;\r\n\t\tassert(cluster_begin < cluster_end);\r\n\r\n\t\tfor (size_t j = cluster_begin; j < cluster_end; ++j)\r\n\t\t\tdestination[offset++] = indices[j];\r\n\t}\r\n\r\n\tassert(offset == index_count);\r\n}\r\n\r\n} \/\/ namespace meshopt\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 Pavel Dolgov\n *\n * See the LICENSE file for terms of use.\n *\/\n\n\/\/ See snake.txt\n#include <bits\/stdc++.h>\n\ntypedef long long int lint;\n\nint main() {\n    lint N;\n    std::cin >> N;\n    double val = (-1 + std::sqrt(1 + 8 * N)) \/ 2.0;\n    lint row = ((val - (int) val) == 0.0) ? val - 1 : val \/ 1;\n    lint max = ((row + 2) * (row + 1)) \/ 2;\n    lint x = ((row % 2) == 0) ? row - (max - N) : max - N;\n    lint y = row - x;\n    std::cout << x << \" \" << y << std::endl;\n    return 0;\n}\n<commit_msg>Cleanup<commit_after>\/*\n * Copyright (C) 2015 Pavel Dolgov\n *\n * See the LICENSE file for terms of use.\n *\/\n\n\/\/ See snake.txt\n#include <bits\/stdc++.h>\n\ntypedef long long int lint;\n\nint main() {\n    lint N;\n    std::cin >> N;\n    double val = (-1.0 + std::sqrt(1.0 + 8.0 * N)) \/ 2.0;\n    lint diag = ((val - lint(val)) == 0.0) ? val - 1 : val \/ 1;\n    lint max = ((diag + 2) * (diag + 1)) \/ 2;\n    lint x = ((diag % 2) == 0) ? (diag - (max - N)) : (max - N);\n    lint y = diag - x;\n    std::cout << x << \" \" << y << std::endl;\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 \"app\/gfx\/gl\/gl_context_egl.h\"\n\n#include \"build\/build_config.h\"\n#include \"base\/logging.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"third_party\/angle\/include\/EGL\/egl.h\"\n\n\/\/ This header must come after the above third-party include, as\n\/\/ it brings in #defines that cause conflicts.\n#include \"app\/gfx\/gl\/gl_bindings.h\"\n\n#if defined(OS_LINUX)\nextern \"C\" {\n#include <X11\/Xlib.h>\n}\n#define EGL_HAS_PBUFFERS 1\n#endif\n\nnamespace gfx {\n\nnamespace {\n\n\/\/ The EGL configuration to use.\nEGLDisplay g_display;\nEGLConfig g_config;\n\n\/\/ Returns the last EGL error as a string.\nconst char* GetLastEGLErrorString() {\n  EGLint error = eglGetError();\n  switch (error) {\n    case EGL_SUCCESS:\n      return \"EGL_SUCCESS\";\n    case EGL_BAD_ACCESS:\n      return \"EGL_BAD_ACCESS\";\n    case EGL_BAD_ALLOC:\n      return \"EGL_BAD_ALLOC\";\n    case EGL_BAD_ATTRIBUTE:\n      return \"EGL_BAD_ATTRIBUTE\";\n    case EGL_BAD_CONTEXT:\n      return \"EGL_BAD_CONTEXT\";\n    case EGL_BAD_CONFIG:\n      return \"EGL_BAD_CONFIG\";\n    case EGL_BAD_CURRENT_SURFACE:\n      return \"EGL_BAD_CURRENT_SURFACE\";\n    case EGL_BAD_DISPLAY:\n      return \"EGL_BAD_DISPLAY\";\n    case EGL_BAD_SURFACE:\n      return \"EGL_BAD_SURFACE\";\n    case EGL_BAD_MATCH:\n      return \"EGL_BAD_MATCH\";\n    case EGL_BAD_PARAMETER:\n      return \"EGL_BAD_PARAMETER\";\n    case EGL_BAD_NATIVE_PIXMAP:\n      return \"EGL_BAD_NATIVE_PIXMAP\";\n    case EGL_BAD_NATIVE_WINDOW:\n      return \"EGL_BAD_NATIVE_WINDOW\";\n    default:\n      return \"UNKNOWN\";\n  }\n}\n}  \/\/ namespace anonymous\n\nSharedEGLSurface::SharedEGLSurface(EGLSurface surface) : surface_(surface) {\n}\n\nSharedEGLSurface::~SharedEGLSurface() {\n  if (surface_) {\n    if (!eglDestroySurface(g_display, surface_)) {\n      LOG(ERROR) << \"eglDestroySurface failed with error \"\n                 << GetLastEGLErrorString();\n    }\n  }\n}\n\nEGLSurface SharedEGLSurface::egl_surface() const {\n  return surface_;\n}\n\nbool BaseEGLContext::InitializeOneOff() {\n  static bool initialized = false;\n  if (initialized)\n    return true;\n\n#ifdef OS_LINUX\n  EGLNativeDisplayType native_display = XOpenDisplay(NULL);\n#else\n  EGLNativeDisplayType native_display = EGL_DEFAULT_DISPLAY;\n#endif\n  g_display = eglGetDisplay(native_display);\n  if (!g_display) {\n    LOG(ERROR) << \"eglGetDisplay failed with error \" << GetLastEGLErrorString();\n    return false;\n  }\n\n  if (!eglInitialize(g_display, NULL, NULL)) {\n    LOG(ERROR) << \"eglInitialize failed with error \" << GetLastEGLErrorString();\n    return false;\n  }\n\n  \/\/ Choose an EGL configuration.\n  static const EGLint kConfigAttribs[] = {\n    EGL_BUFFER_SIZE, 32,\n    EGL_ALPHA_SIZE, 8,\n    EGL_BLUE_SIZE, 8,\n    EGL_RED_SIZE, 8,\n    EGL_DEPTH_SIZE, 16,\n    EGL_STENCIL_SIZE, 8,\n    EGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n#ifdef EGL_HAS_PBUFFERS\n    EGL_SURFACE_TYPE, EGL_WINDOW_BIT | EGL_PBUFFER_BIT,\n#else\n    EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n#endif\n    EGL_NONE\n  };\n\n  EGLint num_configs;\n  if (!eglChooseConfig(g_display,\n                       kConfigAttribs,\n                       NULL,\n                       0,\n                       &num_configs)) {\n    LOG(ERROR) << \"eglChooseConfig failed failed with error \"\n               << GetLastEGLErrorString();\n    return false;\n  }\n\n  if (num_configs == 0) {\n    LOG(ERROR) << \"No suitable EGL configs found.\";\n    return false;\n  }\n\n  scoped_array<EGLConfig> configs(new EGLConfig[num_configs]);\n  if (!eglChooseConfig(g_display,\n                       kConfigAttribs,\n                       configs.get(),\n                       num_configs,\n                       &num_configs)) {\n    LOG(ERROR) << \"eglChooseConfig failed with error \"\n               << GetLastEGLErrorString();\n    return false;\n  }\n\n  g_config = configs[0];\n\n  initialized = true;\n  return true;\n}\n\nEGLDisplay BaseEGLContext::GetDisplay() {\n  return g_display;\n}\n\nstd::string BaseEGLContext::GetExtensions() {\n  const char* extensions = eglQueryString(g_display, EGL_EXTENSIONS);\n  if (!extensions)\n    return GLContext::GetExtensions();\n\n  return GLContext::GetExtensions() + \" \" + extensions;\n}\n\nNativeViewEGLContext::NativeViewEGLContext(void* window)\n    : window_(window),\n      context_(NULL)\n{\n}\n\nNativeViewEGLContext::~NativeViewEGLContext() {\n}\n\nbool NativeViewEGLContext::Initialize() {\n  DCHECK(!context_);\n\n  \/\/ Create a surface for the native window.\n  EGLNativeWindowType native_window =\n      reinterpret_cast<EGLNativeWindowType>(window_);\n  surface_ = new SharedEGLSurface(eglCreateWindowSurface(g_display,\n                                                         g_config,\n                                                         native_window,\n                                                         NULL));\n\n  if (!surface_->egl_surface()) {\n    LOG(ERROR) << \"eglCreateWindowSurface failed with error \"\n               << GetLastEGLErrorString();\n    Destroy();\n    return false;\n  }\n\n  static const EGLint kContextAttributes[] = {\n    EGL_CONTEXT_CLIENT_VERSION, 2,\n    EGL_NONE\n  };\n\n  context_ = eglCreateContext(g_display, g_config, NULL, kContextAttributes);\n  if (!context_) {\n    LOG(ERROR) << \"eglCreateContext failed with error \"\n               << GetLastEGLErrorString();\n    Destroy();\n    return false;\n  }\n\n  if (!MakeCurrent()) {\n    LOG(ERROR) << \"MakeCurrent failed.\";\n    Destroy();\n    return false;\n  }\n\n  if (!InitializeCommon()) {\n    LOG(ERROR) << \"GLContext::InitializeCommon failed.\";\n    Destroy();\n    return false;\n  }\n\n  return true;\n}\n\nvoid NativeViewEGLContext::Destroy() {\n  if (context_) {\n    if (!eglDestroyContext(g_display, context_)) {\n      LOG(ERROR) << \"eglDestroyContext failed with error \"\n                 << GetLastEGLErrorString();\n    }\n\n    context_ = NULL;\n  }\n\n  surface_ = NULL;\n}\n\nbool NativeViewEGLContext::MakeCurrent() {\n  DCHECK(context_);\n  if (!eglMakeCurrent(g_display,\n                      surface_->egl_surface(),\n                      surface_->egl_surface(),\n                      context_)) {\n    VLOG(1) << \"eglMakeCurrent failed with error \"\n            << GetLastEGLErrorString();\n    return false;\n  }\n\n  return true;\n}\n\nbool NativeViewEGLContext::IsCurrent() {\n  DCHECK(context_);\n  return context_ == eglGetCurrentContext();\n}\n\nbool NativeViewEGLContext::IsOffscreen() {\n  return false;\n}\n\nbool NativeViewEGLContext::SwapBuffers() {\n  if (!eglSwapBuffers(g_display, surface_->egl_surface())) {\n    VLOG(1) << \"eglSwapBuffers failed with error \"\n            << GetLastEGLErrorString();\n    return false;\n  }\n\n  return true;\n}\n\ngfx::Size NativeViewEGLContext::GetSize() {\n#if defined(OS_WIN)\n  RECT rect;\n  if (!GetClientRect(static_cast<HWND>(window_), &rect)) {\n    DCHECK(false) << \"GetClientRect failed.\";\n    return gfx::Size();\n  }\n\n  return gfx::Size(rect.right - rect.left, rect.bottom - rect.top);\n#else\n  \/\/ TODO(piman): This doesn't work correctly on Windows yet, the size doesn't\n  \/\/ get updated on resize. When it does, we can share the code.\n  EGLint width;\n  EGLint height;\n  if (!eglQuerySurface(\n          g_display, surface_->egl_surface(), EGL_WIDTH, &width) ||\n      !eglQuerySurface(\n          g_display, surface_->egl_surface(), EGL_HEIGHT, &height)) {\n    NOTREACHED() << \"eglQuerySurface failed with error \"\n                 << GetLastEGLErrorString();\n    return gfx::Size();\n  }\n\n  return gfx::Size(width, height);\n#endif\n}\n\nvoid* NativeViewEGLContext::GetHandle() {\n  return context_;\n}\n\nvoid NativeViewEGLContext::SetSwapInterval(int interval) {\n  DCHECK(IsCurrent());\n  if (!eglSwapInterval(g_display, interval)) {\n    LOG(ERROR) << \"eglSwapInterval failed with error \"\n               << GetLastEGLErrorString();\n  }\n}\n\nSharedEGLSurface* NativeViewEGLContext::GetSurface() {\n  return surface_;\n}\n\nSecondaryEGLContext::SecondaryEGLContext()\n    : context_(NULL)\n{\n}\n\nSecondaryEGLContext::~SecondaryEGLContext() {\n}\n\nbool SecondaryEGLContext::Initialize(GLContext* shared_context) {\n  DCHECK(!context_);\n\n  static const EGLint kContextAttributes[] = {\n    EGL_CONTEXT_CLIENT_VERSION, 2,\n    EGL_NONE\n  };\n\n  if (shared_context) {\n    surface_ = static_cast<BaseEGLContext*>(shared_context)->GetSurface();\n\n    \/\/ Create a context.\n    context_ = eglCreateContext(g_display,\n                                g_config,\n                                shared_context->GetHandle(),\n                                kContextAttributes);\n  } else {\n#ifdef EGL_HAS_PBUFFERS\n    static const EGLint kPbufferAttribs[] = {\n      EGL_WIDTH, 1,\n      EGL_HEIGHT, 1,\n      EGL_NONE\n    };\n\n    surface_ = new SharedEGLSurface(eglCreatePbufferSurface(g_display,\n                                                            g_config,\n                                                            kPbufferAttribs));\n    if (!surface_->egl_surface()) {\n      LOG(ERROR) << \"eglCreatePbufferSurface failed with error \"\n                 << GetLastEGLErrorString();\n      Destroy();\n      return false;\n    }\n\n    context_ = eglCreateContext(g_display, g_config, NULL, kContextAttributes);\n#else\n    NOTIMPLEMENTED() << \"Offscreen non-shared GLES context\";\n    return false;\n#endif\n  }\n\n  if (!context_) {\n    LOG(ERROR) << \"eglCreateContext failed with error \"\n               << GetLastEGLErrorString();\n    Destroy();\n    return false;\n  }\n\n  return true;\n}\n\nvoid SecondaryEGLContext::Destroy() {\n  if (context_) {\n    if (!eglDestroyContext(g_display, context_)) {\n      LOG(ERROR) << \"eglDestroyContext failed with error \"\n                 << GetLastEGLErrorString();\n    }\n\n    context_ = NULL;\n  }\n\n  surface_ = NULL;\n}\n\nbool SecondaryEGLContext::MakeCurrent() {\n  DCHECK(context_);\n  if (!eglMakeCurrent(g_display,\n                      surface_->egl_surface(),\n                      surface_->egl_surface(),\n                      context_)) {\n    VLOG(1) << \"eglMakeCurrent failed with error \"\n            << GetLastEGLErrorString();\n    return false;\n  }\n\n  return true;\n}\n\nbool SecondaryEGLContext::IsCurrent() {\n  DCHECK(context_);\n  return context_ == eglGetCurrentContext();\n}\n\nbool SecondaryEGLContext::IsOffscreen() {\n  return true;\n}\n\nbool SecondaryEGLContext::SwapBuffers() {\n  NOTREACHED() << \"Attempted to call SwapBuffers on a SecondaryEGLContext.\";\n  return false;\n}\n\ngfx::Size SecondaryEGLContext::GetSize() {\n  NOTREACHED() << \"Should not be requesting size of this SecondaryEGLContext.\";\n  return gfx::Size(1, 1);\n}\n\nvoid* SecondaryEGLContext::GetHandle() {\n  return context_;\n}\n\nvoid SecondaryEGLContext::SetSwapInterval(int interval) {\n  DCHECK(IsCurrent());\n  NOTREACHED() << \"Attempt to call SetSwapInterval on a SecondaryEGLContext.\";\n}\n\nSharedEGLSurface* SecondaryEGLContext::GetSurface() {\n  return surface_;\n}\n\n}  \/\/ namespace gfx\n<commit_msg>Reland 77769<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 \"app\/gfx\/gl\/gl_context_egl.h\"\n\n#include \"base\/file_path.h\"\n#include \"base\/logging.h\"\n#include \"base\/native_library.h\"\n#include \"base\/path_service.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"build\/build_config.h\"\n#include \"third_party\/angle\/include\/EGL\/egl.h\"\n\n\/\/ This header must come after the above third-party include, as\n\/\/ it brings in #defines that cause conflicts.\n#include \"app\/gfx\/gl\/gl_bindings.h\"\n\n#if defined(OS_WIN)\n#include <d3d11.h>\n#include <d3dcompiler.h>\n#endif\n\n#if defined(OS_LINUX)\nextern \"C\" {\n#include <X11\/Xlib.h>\n}\n#define EGL_HAS_PBUFFERS 1\n#endif\n\nnamespace gfx {\n\nnamespace {\n\n\/\/ The EGL configuration to use.\nEGLDisplay g_display;\nEGLConfig g_config;\n\n\/\/ Returns the last EGL error as a string.\nconst char* GetLastEGLErrorString() {\n  EGLint error = eglGetError();\n  switch (error) {\n    case EGL_SUCCESS:\n      return \"EGL_SUCCESS\";\n    case EGL_BAD_ACCESS:\n      return \"EGL_BAD_ACCESS\";\n    case EGL_BAD_ALLOC:\n      return \"EGL_BAD_ALLOC\";\n    case EGL_BAD_ATTRIBUTE:\n      return \"EGL_BAD_ATTRIBUTE\";\n    case EGL_BAD_CONTEXT:\n      return \"EGL_BAD_CONTEXT\";\n    case EGL_BAD_CONFIG:\n      return \"EGL_BAD_CONFIG\";\n    case EGL_BAD_CURRENT_SURFACE:\n      return \"EGL_BAD_CURRENT_SURFACE\";\n    case EGL_BAD_DISPLAY:\n      return \"EGL_BAD_DISPLAY\";\n    case EGL_BAD_SURFACE:\n      return \"EGL_BAD_SURFACE\";\n    case EGL_BAD_MATCH:\n      return \"EGL_BAD_MATCH\";\n    case EGL_BAD_PARAMETER:\n      return \"EGL_BAD_PARAMETER\";\n    case EGL_BAD_NATIVE_PIXMAP:\n      return \"EGL_BAD_NATIVE_PIXMAP\";\n    case EGL_BAD_NATIVE_WINDOW:\n      return \"EGL_BAD_NATIVE_WINDOW\";\n    default:\n      return \"UNKNOWN\";\n  }\n}\n}  \/\/ namespace anonymous\n\nSharedEGLSurface::SharedEGLSurface(EGLSurface surface) : surface_(surface) {\n}\n\nSharedEGLSurface::~SharedEGLSurface() {\n  if (surface_) {\n    if (!eglDestroySurface(g_display, surface_)) {\n      LOG(ERROR) << \"eglDestroySurface failed with error \"\n                 << GetLastEGLErrorString();\n    }\n  }\n}\n\nEGLSurface SharedEGLSurface::egl_surface() const {\n  return surface_;\n}\n\nbool BaseEGLContext::InitializeOneOff() {\n  static bool initialized = false;\n  if (initialized)\n    return true;\n\n#ifdef OS_LINUX\n  EGLNativeDisplayType native_display = XOpenDisplay(NULL);\n#else\n  EGLNativeDisplayType native_display = EGL_DEFAULT_DISPLAY;\n#endif\n\n#if defined(OS_WIN)\n  FilePath module_path;\n  if (!PathService::Get(base::DIR_MODULE, &module_path))\n    return false;\n\n  if (!base::LoadNativeLibrary(module_path.Append(D3DCOMPILER_DLL))) {\n    LOG(ERROR) << \"Could not load \" << D3DCOMPILER_DLL;\n    return false;\n  }\n#endif\n\n  g_display = eglGetDisplay(native_display);\n  if (!g_display) {\n    LOG(ERROR) << \"eglGetDisplay failed with error \" << GetLastEGLErrorString();\n    return false;\n  }\n\n  if (!eglInitialize(g_display, NULL, NULL)) {\n    LOG(ERROR) << \"eglInitialize failed with error \" << GetLastEGLErrorString();\n    return false;\n  }\n\n  \/\/ Choose an EGL configuration.\n  static const EGLint kConfigAttribs[] = {\n    EGL_BUFFER_SIZE, 32,\n    EGL_ALPHA_SIZE, 8,\n    EGL_BLUE_SIZE, 8,\n    EGL_RED_SIZE, 8,\n    EGL_DEPTH_SIZE, 16,\n    EGL_STENCIL_SIZE, 8,\n    EGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n#ifdef EGL_HAS_PBUFFERS\n    EGL_SURFACE_TYPE, EGL_WINDOW_BIT | EGL_PBUFFER_BIT,\n#else\n    EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n#endif\n    EGL_NONE\n  };\n\n  EGLint num_configs;\n  if (!eglChooseConfig(g_display,\n                       kConfigAttribs,\n                       NULL,\n                       0,\n                       &num_configs)) {\n    LOG(ERROR) << \"eglChooseConfig failed failed with error \"\n               << GetLastEGLErrorString();\n    return false;\n  }\n\n  if (num_configs == 0) {\n    LOG(ERROR) << \"No suitable EGL configs found.\";\n    return false;\n  }\n\n  scoped_array<EGLConfig> configs(new EGLConfig[num_configs]);\n  if (!eglChooseConfig(g_display,\n                       kConfigAttribs,\n                       configs.get(),\n                       num_configs,\n                       &num_configs)) {\n    LOG(ERROR) << \"eglChooseConfig failed with error \"\n               << GetLastEGLErrorString();\n    return false;\n  }\n\n  g_config = configs[0];\n\n  initialized = true;\n  return true;\n}\n\nEGLDisplay BaseEGLContext::GetDisplay() {\n  return g_display;\n}\n\nstd::string BaseEGLContext::GetExtensions() {\n  const char* extensions = eglQueryString(g_display, EGL_EXTENSIONS);\n  if (!extensions)\n    return GLContext::GetExtensions();\n\n  return GLContext::GetExtensions() + \" \" + extensions;\n}\n\nNativeViewEGLContext::NativeViewEGLContext(void* window)\n    : window_(window),\n      context_(NULL)\n{\n}\n\nNativeViewEGLContext::~NativeViewEGLContext() {\n}\n\nbool NativeViewEGLContext::Initialize() {\n  DCHECK(!context_);\n\n  \/\/ Create a surface for the native window.\n  EGLNativeWindowType native_window =\n      reinterpret_cast<EGLNativeWindowType>(window_);\n  surface_ = new SharedEGLSurface(eglCreateWindowSurface(g_display,\n                                                         g_config,\n                                                         native_window,\n                                                         NULL));\n\n  if (!surface_->egl_surface()) {\n    LOG(ERROR) << \"eglCreateWindowSurface failed with error \"\n               << GetLastEGLErrorString();\n    Destroy();\n    return false;\n  }\n\n  static const EGLint kContextAttributes[] = {\n    EGL_CONTEXT_CLIENT_VERSION, 2,\n    EGL_NONE\n  };\n\n  context_ = eglCreateContext(g_display, g_config, NULL, kContextAttributes);\n  if (!context_) {\n    LOG(ERROR) << \"eglCreateContext failed with error \"\n               << GetLastEGLErrorString();\n    Destroy();\n    return false;\n  }\n\n  if (!MakeCurrent()) {\n    LOG(ERROR) << \"MakeCurrent failed.\";\n    Destroy();\n    return false;\n  }\n\n  if (!InitializeCommon()) {\n    LOG(ERROR) << \"GLContext::InitializeCommon failed.\";\n    Destroy();\n    return false;\n  }\n\n  return true;\n}\n\nvoid NativeViewEGLContext::Destroy() {\n  if (context_) {\n    if (!eglDestroyContext(g_display, context_)) {\n      LOG(ERROR) << \"eglDestroyContext failed with error \"\n                 << GetLastEGLErrorString();\n    }\n\n    context_ = NULL;\n  }\n\n  surface_ = NULL;\n}\n\nbool NativeViewEGLContext::MakeCurrent() {\n  DCHECK(context_);\n  if (!eglMakeCurrent(g_display,\n                      surface_->egl_surface(),\n                      surface_->egl_surface(),\n                      context_)) {\n    VLOG(1) << \"eglMakeCurrent failed with error \"\n            << GetLastEGLErrorString();\n    return false;\n  }\n\n  return true;\n}\n\nbool NativeViewEGLContext::IsCurrent() {\n  DCHECK(context_);\n  return context_ == eglGetCurrentContext();\n}\n\nbool NativeViewEGLContext::IsOffscreen() {\n  return false;\n}\n\nbool NativeViewEGLContext::SwapBuffers() {\n  if (!eglSwapBuffers(g_display, surface_->egl_surface())) {\n    VLOG(1) << \"eglSwapBuffers failed with error \"\n            << GetLastEGLErrorString();\n    return false;\n  }\n\n  return true;\n}\n\ngfx::Size NativeViewEGLContext::GetSize() {\n#if defined(OS_WIN)\n  RECT rect;\n  if (!GetClientRect(static_cast<HWND>(window_), &rect)) {\n    DCHECK(false) << \"GetClientRect failed.\";\n    return gfx::Size();\n  }\n\n  return gfx::Size(rect.right - rect.left, rect.bottom - rect.top);\n#else\n  \/\/ TODO(piman): This doesn't work correctly on Windows yet, the size doesn't\n  \/\/ get updated on resize. When it does, we can share the code.\n  EGLint width;\n  EGLint height;\n  if (!eglQuerySurface(\n          g_display, surface_->egl_surface(), EGL_WIDTH, &width) ||\n      !eglQuerySurface(\n          g_display, surface_->egl_surface(), EGL_HEIGHT, &height)) {\n    NOTREACHED() << \"eglQuerySurface failed with error \"\n                 << GetLastEGLErrorString();\n    return gfx::Size();\n  }\n\n  return gfx::Size(width, height);\n#endif\n}\n\nvoid* NativeViewEGLContext::GetHandle() {\n  return context_;\n}\n\nvoid NativeViewEGLContext::SetSwapInterval(int interval) {\n  DCHECK(IsCurrent());\n  if (!eglSwapInterval(g_display, interval)) {\n    LOG(ERROR) << \"eglSwapInterval failed with error \"\n               << GetLastEGLErrorString();\n  }\n}\n\nSharedEGLSurface* NativeViewEGLContext::GetSurface() {\n  return surface_;\n}\n\nSecondaryEGLContext::SecondaryEGLContext()\n    : context_(NULL)\n{\n}\n\nSecondaryEGLContext::~SecondaryEGLContext() {\n}\n\nbool SecondaryEGLContext::Initialize(GLContext* shared_context) {\n  DCHECK(!context_);\n\n  static const EGLint kContextAttributes[] = {\n    EGL_CONTEXT_CLIENT_VERSION, 2,\n    EGL_NONE\n  };\n\n  if (shared_context) {\n    surface_ = static_cast<BaseEGLContext*>(shared_context)->GetSurface();\n\n    \/\/ Create a context.\n    context_ = eglCreateContext(g_display,\n                                g_config,\n                                shared_context->GetHandle(),\n                                kContextAttributes);\n  } else {\n#ifdef EGL_HAS_PBUFFERS\n    static const EGLint kPbufferAttribs[] = {\n      EGL_WIDTH, 1,\n      EGL_HEIGHT, 1,\n      EGL_NONE\n    };\n\n    surface_ = new SharedEGLSurface(eglCreatePbufferSurface(g_display,\n                                                            g_config,\n                                                            kPbufferAttribs));\n    if (!surface_->egl_surface()) {\n      LOG(ERROR) << \"eglCreatePbufferSurface failed with error \"\n                 << GetLastEGLErrorString();\n      Destroy();\n      return false;\n    }\n\n    context_ = eglCreateContext(g_display, g_config, NULL, kContextAttributes);\n#else\n    NOTIMPLEMENTED() << \"Offscreen non-shared GLES context\";\n    return false;\n#endif\n  }\n\n  if (!context_) {\n    LOG(ERROR) << \"eglCreateContext failed with error \"\n               << GetLastEGLErrorString();\n    Destroy();\n    return false;\n  }\n\n  return true;\n}\n\nvoid SecondaryEGLContext::Destroy() {\n  if (context_) {\n    if (!eglDestroyContext(g_display, context_)) {\n      LOG(ERROR) << \"eglDestroyContext failed with error \"\n                 << GetLastEGLErrorString();\n    }\n\n    context_ = NULL;\n  }\n\n  surface_ = NULL;\n}\n\nbool SecondaryEGLContext::MakeCurrent() {\n  DCHECK(context_);\n  if (!eglMakeCurrent(g_display,\n                      surface_->egl_surface(),\n                      surface_->egl_surface(),\n                      context_)) {\n    VLOG(1) << \"eglMakeCurrent failed with error \"\n            << GetLastEGLErrorString();\n    return false;\n  }\n\n  return true;\n}\n\nbool SecondaryEGLContext::IsCurrent() {\n  DCHECK(context_);\n  return context_ == eglGetCurrentContext();\n}\n\nbool SecondaryEGLContext::IsOffscreen() {\n  return true;\n}\n\nbool SecondaryEGLContext::SwapBuffers() {\n  NOTREACHED() << \"Attempted to call SwapBuffers on a SecondaryEGLContext.\";\n  return false;\n}\n\ngfx::Size SecondaryEGLContext::GetSize() {\n  NOTREACHED() << \"Should not be requesting size of this SecondaryEGLContext.\";\n  return gfx::Size(1, 1);\n}\n\nvoid* SecondaryEGLContext::GetHandle() {\n  return context_;\n}\n\nvoid SecondaryEGLContext::SetSwapInterval(int interval) {\n  DCHECK(IsCurrent());\n  NOTREACHED() << \"Attempt to call SetSwapInterval on a SecondaryEGLContext.\";\n}\n\nSharedEGLSurface* SecondaryEGLContext::GetSurface() {\n  return surface_;\n}\n\n}  \/\/ namespace gfx\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 <aio.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include <functional>\n\n#include \"perfetto\/base\/build_config.h\"\n#include \"perfetto\/base\/logging.h\"\n#include \"perfetto\/base\/time.h\"\n#include \"src\/trace_processor\/trace_processor.h\"\n\n#include \"perfetto\/trace_processor\/raw_query.pb.h\"\n\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_LINUX) ||   \\\n    PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID) || \\\n    PERFETTO_BUILDFLAG(PERFETTO_OS_MACOSX)\n#define PERFETTO_HAS_SIGNAL_H() 1\n#else\n#define PERFETTO_HAS_SIGNAL_H() 0\n#endif\n\n#if PERFETTO_BUILDFLAG(PERFETTO_STANDALONE_BUILD)\n#include <linenoise.h>\n#endif\n\n#if PERFETTO_HAS_SIGNAL_H()\n#include <signal.h>\n#endif\n\nusing namespace perfetto;\nusing namespace perfetto::trace_processor;\n\nnamespace {\nTraceProcessor* g_tp;\n\n#if PERFETTO_BUILDFLAG(PERFETTO_STANDALONE_BUILD)\n\nvoid SetupLineEditor() {\n  linenoiseSetMultiLine(true);\n  linenoiseHistorySetMaxLen(1000);\n}\n\nvoid FreeLine(char*) {\n  linenoiseHistoryAdd(line);\n  linenoiseFree(line);\n}\n\nchar* GetLine(const char* prompt) {\n  return linenoise(prompt);\n}\n\n#else\n\nvoid SetupLineEditor() {}\n\nvoid FreeLine(char* line) {\n  free(line);\n}\n\nchar* GetLine(const char* prompt) {\n  printf(\"\\r%80s\\r%s\", \"\", prompt);\n  fflush(stdout);\n  char* line = new char[1024];\n  if (!fgets(line, 1024 - 1, stdin)) {\n    FreeLine(line);\n    return nullptr;\n  }\n  if (strlen(line) > 0)\n    line[strlen(line) - 1] = 0;\n  return line;\n}\n\n#endif\n\nvoid OnQueryResult(base::TimeNanos t_start, const protos::RawQueryResult& res) {\n  if (res.has_error()) {\n    PERFETTO_ELOG(\"SQLite error: %s\", res.error().c_str());\n    return;\n  }\n  PERFETTO_CHECK(res.columns_size() == res.column_descriptors_size());\n\n  base::TimeNanos t_end = base::GetWallTimeNs();\n\n  for (int r = 0; r < static_cast<int>(res.num_records()); r++) {\n    if (r % 32 == 0) {\n      if (r > 0) {\n        fprintf(stderr, \"...\\nType 'q' to stop, Enter for more records: \");\n        fflush(stderr);\n        char input[32];\n        if (!fgets(input, sizeof(input) - 1, stdin))\n          exit(0);\n        if (input[0] == 'q')\n          break;\n      }\n      for (const auto& col : res.column_descriptors())\n        printf(\"%20s \", col.name().c_str());\n      printf(\"\\n\");\n\n      for (int i = 0; i < res.columns_size(); i++)\n        printf(\"%20s \", \"--------------------\");\n      printf(\"\\n\");\n    }\n\n    for (int c = 0; c < res.columns_size(); c++) {\n      switch (res.column_descriptors(c).type()) {\n        case protos::RawQueryResult_ColumnDesc_Type_STRING:\n          printf(\"%-20.20s \", res.columns(c).string_values(r).c_str());\n          break;\n        case protos::RawQueryResult_ColumnDesc_Type_DOUBLE:\n          printf(\"%20f \", res.columns(c).double_values(r));\n          break;\n        case protos::RawQueryResult_ColumnDesc_Type_LONG: {\n          auto value = res.columns(c).long_values(r);\n          printf((value < 0xffffffll) ? \"%20lld \" : \"%20llx \", value);\n\n          break;\n        }\n      }\n    }\n    printf(\"\\n\");\n  }\n  printf(\"\\nQuery executed in %.3f ms\\n\\n\", (t_end - t_start).count() \/ 1E6);\n}\n\n}  \/\/ namespace\n\nint main(int argc, char** argv) {\n  if (argc < 2) {\n    PERFETTO_ELOG(\"Usage: %s [-d] trace_file.proto\", argv[0]);\n    return 1;\n  }\n  const char* trace_file_path = nullptr;\n  for (int i = 1; i < argc; i++) {\n    if (strcmp(argv[i], \"-d\") == 0) {\n      EnableSQLiteVtableDebugging();\n      continue;\n    }\n    trace_file_path = argv[i];\n  }\n\n  \/\/ Load the trace file into the trace processor.\n  TraceProcessor::Config config;\n  config.optimization_mode = OptimizationMode::kMaxBandwidth;\n  TraceProcessor tp(config);\n  base::ScopedFile fd;\n  fd.reset(open(trace_file_path, O_RDONLY));\n  PERFETTO_CHECK(fd);\n\n  \/\/ Load the trace in chunks using async IO. We create a simple pipeline where,\n  \/\/ at each iteration, we parse the current chunk and asynchronously start\n  \/\/ reading the next chunk.\n\n  \/\/ 1MB chunk size seems the best tradeoff on a MacBook Pro 2013 - i7 2.8 GHz.\n  constexpr size_t kChunkSize = 1024 * 1024;\n  struct aiocb cb {};\n  cb.aio_nbytes = kChunkSize;\n  cb.aio_fildes = *fd;\n\n  \/\/ The control block has ownership of the buffer while the read is in-flight.\n  cb.aio_buf = new uint8_t[kChunkSize];\n\n  PERFETTO_CHECK(aio_read(&cb) == 0);\n  struct aiocb* aio_list[1] = {&cb};\n\n  uint64_t file_size = 0;\n  auto t_load_start = base::GetWallTimeMs();\n  for (int i = 0;; i++) {\n    if (i % 128 == 0)\n      fprintf(stderr, \"\\rLoading trace: %.2f MB\\r\", file_size \/ 1E6);\n\n    \/\/ Block waiting for the pending read to complete.\n    PERFETTO_CHECK(aio_suspend(aio_list, 1, nullptr) == 0);\n    auto rsize = aio_return(&cb);\n    if (rsize <= 0)\n      break;\n    file_size += static_cast<uint64_t>(rsize);\n\n    \/\/ Take ownership of the completed buffer and enqueue a new async read\n    \/\/ with a fresh buffer.\n    std::unique_ptr<uint8_t[]> buf(\n        reinterpret_cast<uint8_t*>(const_cast<void*>(cb.aio_buf)));\n    cb.aio_buf = new uint8_t[kChunkSize];\n    cb.aio_offset += rsize;\n    PERFETTO_CHECK(aio_read(&cb) == 0);\n\n    \/\/ Parse the completed buffer while the async read is in-flight.\n    tp.Parse(std::move(buf), static_cast<size_t>(rsize));\n  }\n  tp.NotifyEndOfFile();\n  double t_load = (base::GetWallTimeMs() - t_load_start).count() \/ 1E3;\n  double size_mb = file_size \/ 1E6;\n  PERFETTO_ILOG(\"Trace loaded: %.2f MB (%.1f MB\/s)\", size_mb, size_mb \/ t_load);\n  g_tp = &tp;\n\n#if PERFETTO_HAS_SIGNAL_H()\n  signal(SIGINT, [](int) { g_tp->InterruptQuery(); });\n#endif\n\n  SetupLineEditor();\n\n  for (;;) {\n    char* line = GetLine(\"> \");\n    if (!line || strcmp(line, \"q\\n\") == 0)\n      break;\n    if (strcmp(line, \"\") == 0)\n      continue;\n    protos::RawQueryArgs query;\n    query.set_sql_query(line);\n    base::TimeNanos t_start = base::GetWallTimeNs();\n    g_tp->ExecuteQuery(query, [t_start](const protos::RawQueryResult& res) {\n      OnQueryResult(t_start, res);\n    });\n\n    FreeLine(line);\n  }\n\n  return 0;\n}\n<commit_msg>trace_processor_shell: Fix linenoise missing argument am: 6935644405 am: d0f122195a am: cebf64c5d0<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 <aio.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include <functional>\n\n#include \"perfetto\/base\/build_config.h\"\n#include \"perfetto\/base\/logging.h\"\n#include \"perfetto\/base\/time.h\"\n#include \"src\/trace_processor\/trace_processor.h\"\n\n#include \"perfetto\/trace_processor\/raw_query.pb.h\"\n\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_LINUX) ||   \\\n    PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID) || \\\n    PERFETTO_BUILDFLAG(PERFETTO_OS_MACOSX)\n#define PERFETTO_HAS_SIGNAL_H() 1\n#else\n#define PERFETTO_HAS_SIGNAL_H() 0\n#endif\n\n#if PERFETTO_BUILDFLAG(PERFETTO_STANDALONE_BUILD)\n#include <linenoise.h>\n#endif\n\n#if PERFETTO_HAS_SIGNAL_H()\n#include <signal.h>\n#endif\n\nusing namespace perfetto;\nusing namespace perfetto::trace_processor;\n\nnamespace {\nTraceProcessor* g_tp;\n\n#if PERFETTO_BUILDFLAG(PERFETTO_STANDALONE_BUILD)\n\nvoid SetupLineEditor() {\n  linenoiseSetMultiLine(true);\n  linenoiseHistorySetMaxLen(1000);\n}\n\nvoid FreeLine(char* line) {\n  linenoiseHistoryAdd(line);\n  linenoiseFree(line);\n}\n\nchar* GetLine(const char* prompt) {\n  return linenoise(prompt);\n}\n\n#else\n\nvoid SetupLineEditor() {}\n\nvoid FreeLine(char* line) {\n  free(line);\n}\n\nchar* GetLine(const char* prompt) {\n  printf(\"\\r%80s\\r%s\", \"\", prompt);\n  fflush(stdout);\n  char* line = new char[1024];\n  if (!fgets(line, 1024 - 1, stdin)) {\n    FreeLine(line);\n    return nullptr;\n  }\n  if (strlen(line) > 0)\n    line[strlen(line) - 1] = 0;\n  return line;\n}\n\n#endif\n\nvoid OnQueryResult(base::TimeNanos t_start, const protos::RawQueryResult& res) {\n  if (res.has_error()) {\n    PERFETTO_ELOG(\"SQLite error: %s\", res.error().c_str());\n    return;\n  }\n  PERFETTO_CHECK(res.columns_size() == res.column_descriptors_size());\n\n  base::TimeNanos t_end = base::GetWallTimeNs();\n\n  for (int r = 0; r < static_cast<int>(res.num_records()); r++) {\n    if (r % 32 == 0) {\n      if (r > 0) {\n        fprintf(stderr, \"...\\nType 'q' to stop, Enter for more records: \");\n        fflush(stderr);\n        char input[32];\n        if (!fgets(input, sizeof(input) - 1, stdin))\n          exit(0);\n        if (input[0] == 'q')\n          break;\n      }\n      for (const auto& col : res.column_descriptors())\n        printf(\"%20s \", col.name().c_str());\n      printf(\"\\n\");\n\n      for (int i = 0; i < res.columns_size(); i++)\n        printf(\"%20s \", \"--------------------\");\n      printf(\"\\n\");\n    }\n\n    for (int c = 0; c < res.columns_size(); c++) {\n      switch (res.column_descriptors(c).type()) {\n        case protos::RawQueryResult_ColumnDesc_Type_STRING:\n          printf(\"%-20.20s \", res.columns(c).string_values(r).c_str());\n          break;\n        case protos::RawQueryResult_ColumnDesc_Type_DOUBLE:\n          printf(\"%20f \", res.columns(c).double_values(r));\n          break;\n        case protos::RawQueryResult_ColumnDesc_Type_LONG: {\n          auto value = res.columns(c).long_values(r);\n          printf((value < 0xffffffll) ? \"%20lld \" : \"%20llx \", value);\n\n          break;\n        }\n      }\n    }\n    printf(\"\\n\");\n  }\n  printf(\"\\nQuery executed in %.3f ms\\n\\n\", (t_end - t_start).count() \/ 1E6);\n}\n\n}  \/\/ namespace\n\nint main(int argc, char** argv) {\n  if (argc < 2) {\n    PERFETTO_ELOG(\"Usage: %s [-d] trace_file.proto\", argv[0]);\n    return 1;\n  }\n  const char* trace_file_path = nullptr;\n  for (int i = 1; i < argc; i++) {\n    if (strcmp(argv[i], \"-d\") == 0) {\n      EnableSQLiteVtableDebugging();\n      continue;\n    }\n    trace_file_path = argv[i];\n  }\n\n  \/\/ Load the trace file into the trace processor.\n  TraceProcessor::Config config;\n  config.optimization_mode = OptimizationMode::kMaxBandwidth;\n  TraceProcessor tp(config);\n  base::ScopedFile fd;\n  fd.reset(open(trace_file_path, O_RDONLY));\n  PERFETTO_CHECK(fd);\n\n  \/\/ Load the trace in chunks using async IO. We create a simple pipeline where,\n  \/\/ at each iteration, we parse the current chunk and asynchronously start\n  \/\/ reading the next chunk.\n\n  \/\/ 1MB chunk size seems the best tradeoff on a MacBook Pro 2013 - i7 2.8 GHz.\n  constexpr size_t kChunkSize = 1024 * 1024;\n  struct aiocb cb {};\n  cb.aio_nbytes = kChunkSize;\n  cb.aio_fildes = *fd;\n\n  \/\/ The control block has ownership of the buffer while the read is in-flight.\n  cb.aio_buf = new uint8_t[kChunkSize];\n\n  PERFETTO_CHECK(aio_read(&cb) == 0);\n  struct aiocb* aio_list[1] = {&cb};\n\n  uint64_t file_size = 0;\n  auto t_load_start = base::GetWallTimeMs();\n  for (int i = 0;; i++) {\n    if (i % 128 == 0)\n      fprintf(stderr, \"\\rLoading trace: %.2f MB\\r\", file_size \/ 1E6);\n\n    \/\/ Block waiting for the pending read to complete.\n    PERFETTO_CHECK(aio_suspend(aio_list, 1, nullptr) == 0);\n    auto rsize = aio_return(&cb);\n    if (rsize <= 0)\n      break;\n    file_size += static_cast<uint64_t>(rsize);\n\n    \/\/ Take ownership of the completed buffer and enqueue a new async read\n    \/\/ with a fresh buffer.\n    std::unique_ptr<uint8_t[]> buf(\n        reinterpret_cast<uint8_t*>(const_cast<void*>(cb.aio_buf)));\n    cb.aio_buf = new uint8_t[kChunkSize];\n    cb.aio_offset += rsize;\n    PERFETTO_CHECK(aio_read(&cb) == 0);\n\n    \/\/ Parse the completed buffer while the async read is in-flight.\n    tp.Parse(std::move(buf), static_cast<size_t>(rsize));\n  }\n  tp.NotifyEndOfFile();\n  double t_load = (base::GetWallTimeMs() - t_load_start).count() \/ 1E3;\n  double size_mb = file_size \/ 1E6;\n  PERFETTO_ILOG(\"Trace loaded: %.2f MB (%.1f MB\/s)\", size_mb, size_mb \/ t_load);\n  g_tp = &tp;\n\n#if PERFETTO_HAS_SIGNAL_H()\n  signal(SIGINT, [](int) { g_tp->InterruptQuery(); });\n#endif\n\n  SetupLineEditor();\n\n  for (;;) {\n    char* line = GetLine(\"> \");\n    if (!line || strcmp(line, \"q\\n\") == 0)\n      break;\n    if (strcmp(line, \"\") == 0)\n      continue;\n    protos::RawQueryArgs query;\n    query.set_sql_query(line);\n    base::TimeNanos t_start = base::GetWallTimeNs();\n    g_tp->ExecuteQuery(query, [t_start](const protos::RawQueryResult& res) {\n      OnQueryResult(t_start, res);\n    });\n\n    FreeLine(line);\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  Copyright (c) <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  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 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#include \"MainWindow.h\"\n#include \"ui_MainWindow.h\"\n#include \"ItemAdder.h\"\n#include \"TreeItemPathDeriver.h\"\n\n#include \"teasafe\/EntryInfo.hpp\"\n#include \"teasafe\/FileBlockBuilder.hpp\"\n#include \"teasafe\/OpenDisposition.hpp\"\n#include \"teasafe\/TeaSafe.hpp\"\n#include \"teasafe\/TeaSafeFolder.hpp\"\n#include \"utility\/CopyFromPhysical.hpp\"\n#include \"utility\/ExtractToPhysical.hpp\"\n#include \"utility\/RecursiveFolderExtractor.hpp\"\n#include \"utility\/RemoveEntry.hpp\"\n\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n#include <boost\/make_shared.hpp>\n#include <QTreeWidgetItem>\n#include <QDebug>\n#include <QFileDialog>\n#include <QInputDialog>\n\n#include <string>\n#include <fstream>\n#include <vector>\n\nMainWindow::MainWindow(QWidget *parent) :\n    QMainWindow(parent),\n    ui(new Ui::MainWindow),\n    m_loaderThread(this),\n    m_workThread(this),\n    m_populatedSet(),\n    m_itemAdder(boost::make_shared<ItemAdder>())\n{\n    ui->setupUi(this);\n    QObject::connect(ui->loadButton, SIGNAL(clicked()),\n                     this, SLOT(loadFileButtonHandler()));\n    QObject::connect(&m_loaderThread, SIGNAL(finishedLoadingSignal()), this,\n                     SLOT(finishedLoadingSlot()));\n    QObject::connect(this, SIGNAL(updateProgressSignal()), this,\n                     SLOT(updateProgressSlot()));\n    QObject::connect(this, SIGNAL(cipherGeneratedSIgnal()), this,\n                     SLOT(cipherGeneratedSlot()));\n    QObject::connect(this, SIGNAL(setMaximumProgressSignal(long)), this,\n                     SLOT(setMaximumProgressSlot(long)));\n\n    ui->fileTree->setAttribute(Qt::WA_MacShowFocusRect, 0);\n\n    QObject::connect(ui->fileTree, SIGNAL(itemExpanded(QTreeWidgetItem*)),\n                     this, SLOT(itemExpanded(QTreeWidgetItem*)));\n\n    m_contextMenu = boost::make_shared<QMenu>(ui->fileTree);\n    ui->fileTree->setContextMenuPolicy(Qt::ActionsContextMenu);\n    m_extractAction = boost::make_shared<QAction>(\"Extract\", m_contextMenu.get());\n    m_removeAction = boost::make_shared<QAction>(\"Remove\", m_contextMenu.get());\n    m_newFolderAction = boost::make_shared<QAction>(\"Create folder\", m_contextMenu.get());\n    m_addFileAction = boost::make_shared<QAction>(\"Add file\", m_contextMenu.get());\n    m_addFolderAction = boost::make_shared<QAction>(\"Add folder\", m_contextMenu.get());\n    ui->fileTree->addAction(m_extractAction.get());\n    ui->fileTree->addAction(m_removeAction.get());\n    ui->fileTree->addAction(m_newFolderAction.get());\n    ui->fileTree->addAction(m_addFileAction.get());\n    ui->fileTree->addAction(m_addFolderAction.get());\n    QObject::connect(m_extractAction.get(), SIGNAL(triggered()), this, SLOT(extractClickedSlot()));\n    QObject::connect(m_removeAction.get(), SIGNAL(triggered()), this, SLOT(removedClickedSlot()));\n    QObject::connect(m_newFolderAction.get(), SIGNAL(triggered()), this, SLOT(newFolderClickedSlot()));\n    QObject::connect(m_addFileAction.get(), SIGNAL(triggered()), this, SLOT(addFileClickedSlot()));\n    QObject::connect(m_addFolderAction.get(), SIGNAL(triggered()), this, SLOT(addFolderClickedSlot()));\n    QObject::connect(m_itemAdder.get(), SIGNAL(finished()), this, SLOT(itemFinishedExpanding()));\n\n    ui->fileTree->setDragEnabled(true);\n    ui->fileTree->setDropIndicatorShown(true);\n    ui->fileTree->setAcceptDrops(true);\n    ui->fileTree->setDragDropMode(QAbstractItemView::DropOnly);\n    ui->fileTree->viewport()->installEventFilter( this ); \/\/ that's what you need\n\n    \/\/ not sure why I need this, but it prevents errors of the type\n    \/\/ QObject::connect: Cannot queue arguments of type 'QVector<int>'\n    \/\/ (Make sure 'QVector<int>' is registered using qRegisterMetaType().)\n    qRegisterMetaType<QVector<int> >(\"QVector<int>\");\n\n    \/\/ will process any 'jobs' (e.g. extractions, adds, removals etc.)\n    m_workThread.start();\n\n}\n\nMainWindow::~MainWindow()\n{\n    delete ui;\n}\n\nvoid MainWindow::loadFileButtonHandler()\n{\n    teasafe::SharedCoreIO io(boost::make_shared<teasafe::CoreTeaSafeIO>());\n    io->path = QFileDialog::getOpenFileName().toStdString();\n    io->password = QInputDialog::getText(this, tr(\"Password dialog\"),\n                                         tr(\"Password:\"), QLineEdit::NoEcho).toStdString();\n    io->rootBlock = 0;\n\n    \/\/ give the cipher generation process a gui callback\n    long const amount = teasafe::detail::CIPHER_BUFFER_SIZE \/ 100000;\n    boost::function<void(teasafe::EventType)> f(boost::bind(&MainWindow::cipherCallback, this, _1, amount));\n    io->ccb = f;\n\n    \/\/ create a progress dialog to display progress of cipher generation\n    m_sd = boost::make_shared<QProgressDialog>(\"Generating key...\", \"Cancel\", 0, 0, this);\n    m_sd->setWindowModality(Qt::WindowModal);\n\n    \/\/ start loading of TeaSafe image\n    m_loaderThread.setSharedIO(io);\n    m_loaderThread.start();\n    m_sd->exec();\n}\n\nvoid MainWindow::updateProgressSlot()\n{\n    static long value(0);\n    m_sd->setValue(value++);\n}\n\nvoid MainWindow::cipherGeneratedSlot()\n{\n    m_sd->close();\n    m_teaSafe = m_loaderThread.getTeaSafe();\n\n    \/\/ set root '\/' tree item\n    QTreeWidgetItem *parent = new QTreeWidgetItem(ui->fileTree);\n    parent->setChildIndicatorPolicy (QTreeWidgetItem::ShowIndicator);\n    parent->setText(0, QString(\"\/\"));\n}\n\nvoid MainWindow::setMaximumProgressSlot(long value)\n{\n    m_sd->close();\n    m_sd = boost::make_shared<QProgressDialog>(\"Building cipher...\", \"Cancel\", 0, value, this);\n    m_sd->setWindowModality(Qt::WindowModal);\n    m_sd->exec();\n}\n\nvoid MainWindow::extractClickedSlot()\n{\n    this->doWork(WorkType::ExtractItem);\n}\n\nvoid MainWindow::removedClickedSlot()\n{\n    this->doWork(WorkType::RemoveItem);\n}\n\nvoid MainWindow::newFolderClickedSlot()\n{\n    this->doWork(WorkType::CreateFolder);\n}\n\nvoid MainWindow::addFileClickedSlot()\n{\n    this->doWork(WorkType::AddFile);\n}\n\nvoid MainWindow::addFolderClickedSlot()\n{\n    this->doWork(WorkType::AddFolder);\n}\n\nvoid MainWindow::itemExpanded(QTreeWidgetItem *parent)\n{\n    std::string pathOfExpanded(detail::getPathFromCurrentItem(parent));\n\n    if(m_populatedSet.find(pathOfExpanded) == m_populatedSet.end()) {\n        boost::function<void()> f(boost::bind(&ItemAdder::populate, m_itemAdder, parent,\n                                              m_teaSafe, pathOfExpanded));\n        m_workThread.addWorkFunction(f);\n        m_populatedSet.insert(pathOfExpanded);\n    }\n}\n\nvoid MainWindow::itemFinishedExpanding()\n{\n    ui->fileTree->repaint();\n}\n\nbool MainWindow::eventFilter( QObject* o, QEvent* e )\n{\n    if( o == ui->fileTree->viewport() && e->type() == QEvent::Drop )\n    {\n        \/\/ do what you would do in the slot\n        qDebug() << \"drop!\";\n    }\n\n    return false;\n}\n\nvoid MainWindow::doWork(WorkType workType)\n{\n    QList<QTreeWidgetItem*> selectedItems = ui->fileTree->selectedItems();\n    QList<QTreeWidgetItem*>::iterator it = selectedItems.begin();\n    for (; it != selectedItems.end(); ++it) {\n        std::string teaPath(detail::getPathFromCurrentItem(*it));\n        qDebug() << teaPath.c_str();\n        boost::function<void()> f;\n        if(       workType == WorkType::RemoveItem) {\n            qDebug() << \"RemoveItem\";\n            f = boost::bind(teasafe::utility::removeEntry, boost::ref(*m_teaSafe),\n                            teaPath);\n\n            delete *it;\n        } else if(workType == WorkType::ExtractItem) {\n            std::string fsPath = QFileDialog::getExistingDirectory().toStdString();\n            qDebug() << \"ExtractItem\";\n            f = boost::bind(teasafe::utility::extractToPhysical, boost::ref(*m_teaSafe),\n                            teaPath, fsPath);\n\n\n        } else if(workType == WorkType::CreateFolder) {\n            qDebug() << \"CreateFolder\";\n            if(m_teaSafe->folderExists(teaPath)) {\n                std::string folderName = QInputDialog::getText(this, tr(\"New folder name dialog\"),\n                                                               tr(\"Folder name:\"), QLineEdit::Normal).toStdString();\n\n                std::string path((*it)->text(0).toStdString() == \"\/\" ?\n                                 teaPath.append(folderName) :\n                                 teaPath.append(\"\/\").append(folderName));\n\n                f = boost::bind(&teasafe::TeaSafe::addFolder, m_teaSafe, path);\n                QTreeWidgetItem *item = new QTreeWidgetItem(*it);\n                item->setChildIndicatorPolicy (QTreeWidgetItem::ShowIndicator);\n                item->setText(0, QString(folderName.c_str()));\n            }\n        } else if(workType == WorkType::AddFolder) {\n\n            if(m_teaSafe->folderExists(teaPath)) {\n                std::string fsPath = QFileDialog::getExistingDirectory().toStdString();\n                f = boost::bind(&teasafe::utility::copyFromPhysical, boost::ref(*m_teaSafe),\n                                teaPath, fsPath);\n                QTreeWidgetItem *item = new QTreeWidgetItem(*it);\n                item->setChildIndicatorPolicy (QTreeWidgetItem::ShowIndicator);\n                item->setText(0, QString(boost::filesystem::path(fsPath).filename().c_str()));\n            }\n        }  else if(workType == WorkType::AddFile) {\n\n            if(m_teaSafe->folderExists(teaPath)) {\n                std::string fsPath = QFileDialog::getOpenFileName().toStdString();\n                f = boost::bind(&teasafe::utility::copyFromPhysical, boost::ref(*m_teaSafe),\n                                teaPath, fsPath);\n                QTreeWidgetItem *item = new QTreeWidgetItem(*it);\n                item->setText(0, QString(boost::filesystem::path(fsPath).filename().c_str()));\n            }\n        }\n        if(f) {\n            m_workThread.addWorkFunction(f);\n        }\n    }\n}\n\nvoid MainWindow::cipherCallback(teasafe::EventType eventType, long const amount)\n{\n    if (eventType == teasafe::EventType::BigCipherBuildBegin) {\n        qDebug() << \"Got event\";\n        emit setMaximumProgressSignal(amount);\n    }\n    if (eventType == teasafe::EventType::CipherBuildUpdate) {\n        \/\/m_sd->setValue(value++);\n        emit updateProgressSignal();\n    }\n    if (eventType == teasafe::EventType::BigCipherBuildEnd) {\n        emit cipherGeneratedSIgnal();\n    }\n}\n\nvoid MainWindow::finishedLoadingSlot()\n{\n    qDebug() << \"Finished loading!\";\n}\n<commit_msg>tidying up GUI..<commit_after>\/*\n  Copyright (c) <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  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 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#include \"MainWindow.h\"\n#include \"ui_MainWindow.h\"\n#include \"ItemAdder.h\"\n#include \"TreeItemPathDeriver.h\"\n\n#include \"teasafe\/EntryInfo.hpp\"\n#include \"teasafe\/FileBlockBuilder.hpp\"\n#include \"teasafe\/OpenDisposition.hpp\"\n#include \"teasafe\/TeaSafe.hpp\"\n#include \"teasafe\/TeaSafeFolder.hpp\"\n#include \"utility\/CopyFromPhysical.hpp\"\n#include \"utility\/ExtractToPhysical.hpp\"\n#include \"utility\/RecursiveFolderExtractor.hpp\"\n#include \"utility\/RemoveEntry.hpp\"\n\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n#include <boost\/make_shared.hpp>\n#include <QTreeWidgetItem>\n#include <QDebug>\n#include <QFileDialog>\n#include <QInputDialog>\n\n#include <string>\n#include <fstream>\n#include <vector>\n\nMainWindow::MainWindow(QWidget *parent) :\n    QMainWindow(parent),\n    ui(new Ui::MainWindow),\n    m_loaderThread(this),\n    m_workThread(this),\n    m_populatedSet(),\n    m_itemAdder(boost::make_shared<ItemAdder>())\n{\n    ui->setupUi(this);\n    QObject::connect(ui->loadButton, SIGNAL(clicked()),\n                     this, SLOT(loadFileButtonHandler()));\n    QObject::connect(&m_loaderThread, SIGNAL(finishedLoadingSignal()), this,\n                     SLOT(finishedLoadingSlot()));\n    QObject::connect(this, SIGNAL(updateProgressSignal()), this,\n                     SLOT(updateProgressSlot()));\n    QObject::connect(this, SIGNAL(cipherGeneratedSIgnal()), this,\n                     SLOT(cipherGeneratedSlot()));\n    QObject::connect(this, SIGNAL(setMaximumProgressSignal(long)), this,\n                     SLOT(setMaximumProgressSlot(long)));\n\n    ui->fileTree->setAttribute(Qt::WA_MacShowFocusRect, 0);\n\n    QObject::connect(ui->fileTree, SIGNAL(itemExpanded(QTreeWidgetItem*)),\n                     this, SLOT(itemExpanded(QTreeWidgetItem*)));\n\n    m_contextMenu = boost::make_shared<QMenu>(ui->fileTree);\n    ui->fileTree->setContextMenuPolicy(Qt::ActionsContextMenu);\n    m_extractAction = boost::make_shared<QAction>(\"Extract\", m_contextMenu.get());\n    m_removeAction = boost::make_shared<QAction>(\"Remove\", m_contextMenu.get());\n    m_newFolderAction = boost::make_shared<QAction>(\"Create folder\", m_contextMenu.get());\n    m_addFileAction = boost::make_shared<QAction>(\"Add file\", m_contextMenu.get());\n    m_addFolderAction = boost::make_shared<QAction>(\"Add folder\", m_contextMenu.get());\n    ui->fileTree->addAction(m_extractAction.get());\n    ui->fileTree->addAction(m_removeAction.get());\n    ui->fileTree->addAction(m_newFolderAction.get());\n    ui->fileTree->addAction(m_addFileAction.get());\n    ui->fileTree->addAction(m_addFolderAction.get());\n    QObject::connect(m_extractAction.get(), SIGNAL(triggered()), this, SLOT(extractClickedSlot()));\n    QObject::connect(m_removeAction.get(), SIGNAL(triggered()), this, SLOT(removedClickedSlot()));\n    QObject::connect(m_newFolderAction.get(), SIGNAL(triggered()), this, SLOT(newFolderClickedSlot()));\n    QObject::connect(m_addFileAction.get(), SIGNAL(triggered()), this, SLOT(addFileClickedSlot()));\n    QObject::connect(m_addFolderAction.get(), SIGNAL(triggered()), this, SLOT(addFolderClickedSlot()));\n    QObject::connect(m_itemAdder.get(), SIGNAL(finished()), this, SLOT(itemFinishedExpanding()));\n\n    ui->fileTree->setDragEnabled(true);\n    ui->fileTree->setDropIndicatorShown(true);\n    ui->fileTree->setAcceptDrops(true);\n    ui->fileTree->setDragDropMode(QAbstractItemView::DropOnly);\n    ui->fileTree->viewport()->installEventFilter( this ); \/\/ that's what you need\n\n    \/\/ not sure why I need this, but it prevents errors of the type\n    \/\/ QObject::connect: Cannot queue arguments of type 'QVector<int>'\n    \/\/ (Make sure 'QVector<int>' is registered using qRegisterMetaType().)\n    qRegisterMetaType<QVector<int> >(\"QVector<int>\");\n\n    \/\/ will process any 'jobs' (e.g. extractions, adds, removals etc.)\n    m_workThread.start();\n\n}\n\nMainWindow::~MainWindow()\n{\n    delete ui;\n}\n\nvoid MainWindow::loadFileButtonHandler()\n{\n    QFileDialog dlg( NULL, tr(\"Open container\"));\n    dlg.setAcceptMode( QFileDialog::AcceptOpen );\n    dlg.setFileMode(QFileDialog::ExistingFile);\n\n    if (dlg.exec()) {\n\n        ui->fileTree->clear();\n\n        teasafe::SharedCoreIO io(boost::make_shared<teasafe::CoreTeaSafeIO>());\n        io->path = dlg.selectedFiles().at(0).toStdString();\n\n        bool ok;\n        io->password = QInputDialog::getText(this, tr(\"Password dialog\"),\n                                             tr(\"Password:\"), QLineEdit::NoEcho, \"\", &ok).toStdString();\n\n        if((!io->password.empty() && ok)) {\n            io->rootBlock = 0;\n\n            \/\/ give the cipher generation process a gui callback\n            long const amount = teasafe::detail::CIPHER_BUFFER_SIZE \/ 100000;\n            boost::function<void(teasafe::EventType)> f(boost::bind(&MainWindow::cipherCallback, this, _1, amount));\n            io->ccb = f;\n\n            \/\/ create a progress dialog to display progress of cipher generation\n            m_sd = boost::make_shared<QProgressDialog>(\"Generating key...\", \"Cancel\", 0, 0, this);\n            m_sd->setWindowModality(Qt::WindowModal);\n\n            \/\/ start loading of TeaSafe image\n            m_loaderThread.setSharedIO(io);\n            m_loaderThread.start();\n            m_sd->exec();\n        }\n    }\n}\n\nvoid MainWindow::updateProgressSlot()\n{\n    static long value(0);\n    m_sd->setValue(value++);\n}\n\nvoid MainWindow::cipherGeneratedSlot()\n{\n    m_sd->close();\n    m_teaSafe = m_loaderThread.getTeaSafe();\n\n    \/\/ set root '\/' tree item\n    QTreeWidgetItem *parent = new QTreeWidgetItem(ui->fileTree);\n    parent->setChildIndicatorPolicy (QTreeWidgetItem::ShowIndicator);\n    parent->setText(0, QString(\"\/\"));\n}\n\nvoid MainWindow::setMaximumProgressSlot(long value)\n{\n    m_sd->close();\n    m_sd = boost::make_shared<QProgressDialog>(\"Building cipher...\", \"Cancel\", 0, value, this);\n    m_sd->setWindowModality(Qt::WindowModal);\n    m_sd->exec();\n}\n\nvoid MainWindow::extractClickedSlot()\n{\n    this->doWork(WorkType::ExtractItem);\n}\n\nvoid MainWindow::removedClickedSlot()\n{\n    this->doWork(WorkType::RemoveItem);\n}\n\nvoid MainWindow::newFolderClickedSlot()\n{\n    this->doWork(WorkType::CreateFolder);\n}\n\nvoid MainWindow::addFileClickedSlot()\n{\n    this->doWork(WorkType::AddFile);\n}\n\nvoid MainWindow::addFolderClickedSlot()\n{\n    this->doWork(WorkType::AddFolder);\n}\n\nvoid MainWindow::itemExpanded(QTreeWidgetItem *parent)\n{\n    std::string pathOfExpanded(detail::getPathFromCurrentItem(parent));\n\n    if(m_populatedSet.find(pathOfExpanded) == m_populatedSet.end()) {\n        boost::function<void()> f(boost::bind(&ItemAdder::populate, m_itemAdder, parent,\n                                              m_teaSafe, pathOfExpanded));\n        m_workThread.addWorkFunction(f);\n        m_populatedSet.insert(pathOfExpanded);\n    }\n}\n\nvoid MainWindow::itemFinishedExpanding()\n{\n    ui->fileTree->repaint();\n}\n\nbool MainWindow::eventFilter( QObject* o, QEvent* e )\n{\n    if( o == ui->fileTree->viewport() && e->type() == QEvent::Drop )\n    {\n        \/\/ do what you would do in the slot\n        qDebug() << \"drop!\";\n    }\n\n    return false;\n}\n\nvoid MainWindow::doWork(WorkType workType)\n{\n    QList<QTreeWidgetItem*> selectedItems = ui->fileTree->selectedItems();\n    QList<QTreeWidgetItem*>::iterator it = selectedItems.begin();\n    for (; it != selectedItems.end(); ++it) {\n        std::string teaPath(detail::getPathFromCurrentItem(*it));\n        qDebug() << teaPath.c_str();\n        boost::function<void()> f;\n        if(       workType == WorkType::RemoveItem) {\n            qDebug() << \"RemoveItem\";\n            f = boost::bind(teasafe::utility::removeEntry, boost::ref(*m_teaSafe),\n                            teaPath);\n\n            delete *it;\n        } else if(workType == WorkType::ExtractItem) {\n            QFileDialog dlg( NULL, tr(\"Filesystem folder to extract to..\"));\n            dlg.setAcceptMode( QFileDialog::AcceptOpen );\n            dlg.setFileMode(QFileDialog::DirectoryOnly);\n            if(dlg.exec()) {\n                std::string fsPath = dlg.selectedFiles().at(0).toStdString();\n\n                qDebug() << \"ExtractItem\";\n                f = boost::bind(teasafe::utility::extractToPhysical, boost::ref(*m_teaSafe),\n                                teaPath, fsPath);\n            }\n\n        } else if(workType == WorkType::CreateFolder) {\n            qDebug() << \"CreateFolder\";\n            if(m_teaSafe->folderExists(teaPath)) {\n                bool ok;\n                std::string folderName = QInputDialog::getText(this, tr(\"New folder name dialog\"),\n                                                               tr(\"Folder name:\"), QLineEdit::Normal,\"\",&ok).toStdString();\n\n                if((!folderName.empty()) && ok) {\n                    std::string path((*it)->text(0).toStdString() == \"\/\" ?\n                                     teaPath.append(folderName) :\n                                     teaPath.append(\"\/\").append(folderName));\n\n                    f = boost::bind(&teasafe::TeaSafe::addFolder, m_teaSafe, path);\n                    QTreeWidgetItem *item = new QTreeWidgetItem(*it);\n                    item->setChildIndicatorPolicy (QTreeWidgetItem::ShowIndicator);\n                    item->setText(0, QString(folderName.c_str()));\n                }\n            }\n        } else if(workType == WorkType::AddFolder) {\n\n            if(m_teaSafe->folderExists(teaPath)) {\n                QFileDialog dlg( NULL, tr(\"Folder to add..\"));\n                dlg.setAcceptMode( QFileDialog::AcceptOpen );\n                dlg.setFileMode(QFileDialog::DirectoryOnly);\n                if(dlg.exec()) {\n                    std::string fsPath = dlg.selectedFiles().at(0).toStdString();\n                    f = boost::bind(&teasafe::utility::copyFromPhysical, boost::ref(*m_teaSafe),\n                                    teaPath, fsPath);\n                    QTreeWidgetItem *item = new QTreeWidgetItem(*it);\n                    item->setChildIndicatorPolicy (QTreeWidgetItem::ShowIndicator);\n                    item->setText(0, QString(boost::filesystem::path(fsPath).filename().c_str()));\n                }\n            }\n        }  else if(workType == WorkType::AddFile) {\n\n            if(m_teaSafe->folderExists(teaPath)) {\n                QFileDialog dlg( NULL, tr(\"File to add..\"));\n                dlg.setAcceptMode( QFileDialog::AcceptOpen );\n                dlg.setFileMode(QFileDialog::AnyFile);\n                if(dlg.exec()) {\n                    std::string fsPath = dlg.selectedFiles().at(0).toStdString();\n                    f = boost::bind(&teasafe::utility::copyFromPhysical, boost::ref(*m_teaSafe),\n                                    teaPath, fsPath);\n                    QTreeWidgetItem *item = new QTreeWidgetItem(*it);\n                    item->setText(0, QString(boost::filesystem::path(fsPath).filename().c_str()));\n                }\n            }\n        }\n        if(f) {\n            m_workThread.addWorkFunction(f);\n        }\n    }\n}\n\nvoid MainWindow::cipherCallback(teasafe::EventType eventType, long const amount)\n{\n    if (eventType == teasafe::EventType::BigCipherBuildBegin) {\n        qDebug() << \"Got event\";\n        emit setMaximumProgressSignal(amount);\n    }\n    if (eventType == teasafe::EventType::CipherBuildUpdate) {\n        \/\/m_sd->setValue(value++);\n        emit updateProgressSignal();\n    }\n    if (eventType == teasafe::EventType::BigCipherBuildEnd) {\n        emit cipherGeneratedSIgnal();\n    }\n}\n\nvoid MainWindow::finishedLoadingSlot()\n{\n    qDebug() << \"Finished loading!\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2012 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\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/fe_base.h\"\n#include \"libmesh\/fem_context.h\"\n#include \"libmesh\/fem_system.h\"\n#include \"libmesh\/libmesh_logging.h\"\n#include \"libmesh\/mesh_base.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/parallel.h\"\n#include \"libmesh\/quadrature.h\"\n#include \"libmesh\/sparse_matrix.h\"\n#include \"libmesh\/time_solver.h\"\n#include \"libmesh\/unsteady_solver.h\" \/\/ For eulerian_residual\n\n\nnamespace libMesh\n{\n\nbool FEMPhysics::eulerian_residual (bool request_jacobian,\n                                    DiffContext &\/*c*\/)\n{\n  \/\/ Only calculate a mesh movement residual if it's necessary\n  if (!_mesh_sys)\n    return request_jacobian;\n\n  libmesh_not_implemented();\n\n#if 0\n  FEMContext &context = libmesh_cast_ref<FEMContext&>(c);\n\n  \/\/ This function only supports fully coupled mesh motion for now\n  libmesh_assert_equal_to (_mesh_sys, this);\n\n  unsigned int n_qpoints = (context.get_element_qrule())->n_points();\n\n  const unsigned int n_x_dofs = (_mesh_x_var == libMesh::invalid_uint) ?\n                                0 : context.dof_indices_var[_mesh_x_var].size();\n  const unsigned int n_y_dofs = (_mesh_y_var == libMesh::invalid_uint) ?\n                                0 : context.dof_indices_var[_mesh_y_var].size();\n  const unsigned int n_z_dofs = (_mesh_z_var == libMesh::invalid_uint) ?\n                                0 : context.dof_indices_var[_mesh_z_var].size();\n\n  const unsigned int mesh_xyz_var = n_x_dofs ? _mesh_x_var :\n                                   (n_y_dofs ? _mesh_y_var :\n                                   (n_z_dofs ? _mesh_z_var :\n                                    libMesh::invalid_uint));\n\n  \/\/ If we're our own _mesh_sys, we'd better be in charge of\n  \/\/ at least one coordinate, and we'd better have the same\n  \/\/ FE type for all coordinates we are in charge of\n  libmesh_assert_not_equal_to (mesh_xyz_var, libMesh::invalid_uint);\n  libmesh_assert(!n_x_dofs || context.element_fe_var[_mesh_x_var] ==\n                              context.element_fe_var[mesh_xyz_var]);\n  libmesh_assert(!n_y_dofs || context.element_fe_var[_mesh_y_var] ==\n                              context.element_fe_var[mesh_xyz_var]);\n  libmesh_assert(!n_z_dofs || context.element_fe_var[_mesh_z_var] ==\n                              context.element_fe_var[mesh_xyz_var]);\n\n  const std::vector<std::vector<Real> >     &psi =\n    context.element_fe_var[mesh_xyz_var]->get_phi();\n\n  for (unsigned int var = 0; var != context.n_vars(); ++var)\n    {\n      \/\/ Mesh motion only affects time-evolving variables\n      if (this->is_time_evolving(var))\n        continue;\n\n      \/\/ The mesh coordinate variables themselves are Lagrangian,\n      \/\/ not Eulerian, and no convective term is desired.\n      if (\/*_mesh_sys == this && *\/\n          (var == _mesh_x_var ||\n           var == _mesh_y_var ||\n           var == _mesh_z_var))\n        continue;\n\n      \/\/ Some of this code currently relies on the assumption that\n      \/\/ we can pull mesh coordinate data from our own system\n      if (_mesh_sys != this)\n        libmesh_not_implemented();\n\n      \/\/ This residual should only be called by unsteady solvers:\n      \/\/ if the mesh is steady, there's no mesh convection term!\n      UnsteadySolver *unsteady;\n      if (this->time_solver->is_steady())\n        return request_jacobian;\n      else\n\tunsteady = libmesh_cast_ptr<UnsteadySolver*>(this->time_solver.get());\n\n      const std::vector<Real> &JxW =\n        context.element_fe_var[var]->get_JxW();\n\n      const std::vector<std::vector<Real> >     &phi =\n        context.element_fe_var[var]->get_phi();\n\n      const std::vector<std::vector<RealGradient> > &dphi =\n        context.element_fe_var[var]->get_dphi();\n\n      const unsigned int n_u_dofs = context.dof_indices_var[var].size();\n\n      DenseSubVector<Number> &Fu = *context.elem_subresiduals[var];\n      DenseSubMatrix<Number> &Kuu = *context.elem_subjacobians[var][var];\n\n      DenseSubMatrix<Number> *Kux = n_x_dofs ?\n        context.elem_subjacobians[var][_mesh_x_var] : NULL;\n      DenseSubMatrix<Number> *Kuy = n_y_dofs ?\n        context.elem_subjacobians[var][_mesh_y_var] : NULL;\n      DenseSubMatrix<Number> *Kuz = n_z_dofs ?\n        context.elem_subjacobians[var][_mesh_z_var] : NULL;\n\n      std::vector<Real> delta_x(n_x_dofs, 0.);\n      std::vector<Real> delta_y(n_y_dofs, 0.);\n      std::vector<Real> delta_z(n_z_dofs, 0.);\n\n      for (unsigned int i = 0; i != n_x_dofs; ++i)\n        {\n          unsigned int j = context.dof_indices_var[_mesh_x_var][i];\n          delta_x[i] = libmesh_real(this->current_solution(j)) -\n                       libmesh_real(unsteady->old_nonlinear_solution(j));\n        }\n\n      for (unsigned int i = 0; i != n_y_dofs; ++i)\n        {\n          unsigned int j = context.dof_indices_var[_mesh_y_var][i];\n          delta_y[i] = libmesh_real(this->current_solution(j)) -\n                       libmesh_real(unsteady->old_nonlinear_solution(j));\n        }\n\n      for (unsigned int i = 0; i != n_z_dofs; ++i)\n        {\n          unsigned int j = context.dof_indices_var[_mesh_z_var][i];\n          delta_z[i] = libmesh_real(this->current_solution(j)) -\n                       libmesh_real(unsteady->old_nonlinear_solution(j));\n        }\n\n      for (unsigned int qp = 0; qp != n_qpoints; ++qp)\n        {\n          Gradient grad_u = context.interior_gradient(var, qp);\n          RealGradient convection(0.);\n\n          for (unsigned int i = 0; i != n_x_dofs; ++i)\n\t    convection(0) += delta_x[i] * psi[i][qp];\n          for (unsigned int i = 0; i != n_y_dofs; ++i)\n\t    convection(1) += delta_y[i] * psi[i][qp];\n          for (unsigned int i = 0; i != n_z_dofs; ++i)\n\t    convection(2) += delta_z[i] * psi[i][qp];\n\n          for (unsigned int i = 0; i != n_u_dofs; ++i)\n            {\n              Number JxWxPhiI = JxW[qp] * phi[i][qp];\n              Fu(i) += (convection * grad_u) * JxWxPhiI;\n              if (request_jacobian)\n                {\n                  Number JxWxPhiI = JxW[qp] * phi[i][qp];\n                  for (unsigned int j = 0; j != n_u_dofs; ++j)\n                    Kuu(i,j) += JxWxPhiI * (convection * dphi[j][qp]);\n\n                  Number JxWxPhiIoverDT = JxWxPhiI\/this->deltat;\n\n                  Number JxWxPhiIxDUDXoverDT = JxWxPhiIoverDT * grad_u(0);\n                  for (unsigned int j = 0; j != n_x_dofs; ++j)\n                    (*Kux)(i,j) += JxWxPhiIxDUDXoverDT * psi[j][qp];\n\n                  Number JxWxPhiIxDUDYoverDT = JxWxPhiIoverDT * grad_u(1);\n                  for (unsigned int j = 0; j != n_y_dofs; ++j)\n                    (*Kuy)(i,j) += JxWxPhiIxDUDYoverDT * psi[j][qp];\n\n                  Number JxWxPhiIxDUDZoverDT = JxWxPhiIoverDT * grad_u(2);\n                  for (unsigned int j = 0; j != n_z_dofs; ++j)\n                    (*Kuz)(i,j) += JxWxPhiIxDUDZoverDT * psi[j][qp];\n                }\n            }\n        }\n    }\n#endif \/\/ 0\n\n  return request_jacobian;\n}\n\n\n\nbool FEMPhysics::mass_residual (bool request_jacobian,\n                                DiffContext &c)\n{\n  FEMContext &context = libmesh_cast_ref<FEMContext&>(c);\n\n  unsigned int n_qpoints = (context.get_element_qrule())->n_points();\n\n  for (unsigned int var = 0; var != context.n_vars(); ++var)\n    {\n      if (!this->is_time_evolving(var))\n        continue;\n\n      const std::vector<Real> &JxW =\n        context.element_fe_var[var]->get_JxW();\n\n      const std::vector<std::vector<Real> > &phi =\n        context.element_fe_var[var]->get_phi();\n\n      const unsigned int n_dofs = libmesh_cast_int<unsigned int>\n\t(context.dof_indices_var[var].size());\n\n      DenseSubVector<Number> &Fu = *context.elem_subresiduals[var];\n      DenseSubMatrix<Number> &Kuu = *context.elem_subjacobians[var][var];\n\n      for (unsigned int qp = 0; qp != n_qpoints; ++qp)\n        {\n          Number u = context.interior_value(var, qp);\n          Number JxWxU = JxW[qp] * u;\n          for (unsigned int i = 0; i != n_dofs; ++i)\n            {\n              Fu(i) += JxWxU * phi[i][qp];\n              if (request_jacobian && context.elem_solution_derivative)\n                {\n                  libmesh_assert_equal_to (context.elem_solution_derivative, 1.0);\n\n                  Number JxWxPhiI = JxW[qp] * phi[i][qp];\n                  Kuu(i,i) += JxWxPhiI * phi[i][qp];\n                  for (unsigned int j = i+1; j < n_dofs; ++j)\n                    {\n                      Number Kij = JxWxPhiI * phi[j][qp];\n                      Kuu(i,j) += Kij;\n                      Kuu(j,i) += Kij;\n                    }\n                }\n            }\n        }\n    }\n\n  return request_jacobian;\n}\n\n} \/\/ namespace libMesh\n<commit_msg>Use accessor API for FEMContext.<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2012 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\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/fe_base.h\"\n#include \"libmesh\/fem_context.h\"\n#include \"libmesh\/fem_system.h\"\n#include \"libmesh\/libmesh_logging.h\"\n#include \"libmesh\/mesh_base.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/parallel.h\"\n#include \"libmesh\/quadrature.h\"\n#include \"libmesh\/sparse_matrix.h\"\n#include \"libmesh\/time_solver.h\"\n#include \"libmesh\/unsteady_solver.h\" \/\/ For eulerian_residual\n\n\nnamespace libMesh\n{\n\nbool FEMPhysics::eulerian_residual (bool request_jacobian,\n                                    DiffContext &\/*c*\/)\n{\n  \/\/ Only calculate a mesh movement residual if it's necessary\n  if (!_mesh_sys)\n    return request_jacobian;\n\n  libmesh_not_implemented();\n\n#if 0\n  FEMContext &context = libmesh_cast_ref<FEMContext&>(c);\n\n  \/\/ This function only supports fully coupled mesh motion for now\n  libmesh_assert_equal_to (_mesh_sys, this);\n\n  unsigned int n_qpoints = (context.get_element_qrule())->n_points();\n\n  const unsigned int n_x_dofs = (_mesh_x_var == libMesh::invalid_uint) ?\n                                0 : context.dof_indices_var[_mesh_x_var].size();\n  const unsigned int n_y_dofs = (_mesh_y_var == libMesh::invalid_uint) ?\n                                0 : context.dof_indices_var[_mesh_y_var].size();\n  const unsigned int n_z_dofs = (_mesh_z_var == libMesh::invalid_uint) ?\n                                0 : context.dof_indices_var[_mesh_z_var].size();\n\n  const unsigned int mesh_xyz_var = n_x_dofs ? _mesh_x_var :\n                                   (n_y_dofs ? _mesh_y_var :\n                                   (n_z_dofs ? _mesh_z_var :\n                                    libMesh::invalid_uint));\n\n  \/\/ If we're our own _mesh_sys, we'd better be in charge of\n  \/\/ at least one coordinate, and we'd better have the same\n  \/\/ FE type for all coordinates we are in charge of\n  libmesh_assert_not_equal_to (mesh_xyz_var, libMesh::invalid_uint);\n  libmesh_assert(!n_x_dofs || context.element_fe_var[_mesh_x_var] ==\n                              context.element_fe_var[mesh_xyz_var]);\n  libmesh_assert(!n_y_dofs || context.element_fe_var[_mesh_y_var] ==\n                              context.element_fe_var[mesh_xyz_var]);\n  libmesh_assert(!n_z_dofs || context.element_fe_var[_mesh_z_var] ==\n                              context.element_fe_var[mesh_xyz_var]);\n\n  const std::vector<std::vector<Real> >     &psi =\n    context.element_fe_var[mesh_xyz_var]->get_phi();\n\n  for (unsigned int var = 0; var != context.n_vars(); ++var)\n    {\n      \/\/ Mesh motion only affects time-evolving variables\n      if (this->is_time_evolving(var))\n        continue;\n\n      \/\/ The mesh coordinate variables themselves are Lagrangian,\n      \/\/ not Eulerian, and no convective term is desired.\n      if (\/*_mesh_sys == this && *\/\n          (var == _mesh_x_var ||\n           var == _mesh_y_var ||\n           var == _mesh_z_var))\n        continue;\n\n      \/\/ Some of this code currently relies on the assumption that\n      \/\/ we can pull mesh coordinate data from our own system\n      if (_mesh_sys != this)\n        libmesh_not_implemented();\n\n      \/\/ This residual should only be called by unsteady solvers:\n      \/\/ if the mesh is steady, there's no mesh convection term!\n      UnsteadySolver *unsteady;\n      if (this->time_solver->is_steady())\n        return request_jacobian;\n      else\n\tunsteady = libmesh_cast_ptr<UnsteadySolver*>(this->time_solver.get());\n\n      const std::vector<Real> &JxW =\n        context.element_fe_var[var]->get_JxW();\n\n      const std::vector<std::vector<Real> >     &phi =\n        context.element_fe_var[var]->get_phi();\n\n      const std::vector<std::vector<RealGradient> > &dphi =\n        context.element_fe_var[var]->get_dphi();\n\n      const unsigned int n_u_dofs = context.dof_indices_var[var].size();\n\n      DenseSubVector<Number> &Fu = *context.elem_subresiduals[var];\n      DenseSubMatrix<Number> &Kuu = *context.elem_subjacobians[var][var];\n\n      DenseSubMatrix<Number> *Kux = n_x_dofs ?\n        context.elem_subjacobians[var][_mesh_x_var] : NULL;\n      DenseSubMatrix<Number> *Kuy = n_y_dofs ?\n        context.elem_subjacobians[var][_mesh_y_var] : NULL;\n      DenseSubMatrix<Number> *Kuz = n_z_dofs ?\n        context.elem_subjacobians[var][_mesh_z_var] : NULL;\n\n      std::vector<Real> delta_x(n_x_dofs, 0.);\n      std::vector<Real> delta_y(n_y_dofs, 0.);\n      std::vector<Real> delta_z(n_z_dofs, 0.);\n\n      for (unsigned int i = 0; i != n_x_dofs; ++i)\n        {\n          unsigned int j = context.dof_indices_var[_mesh_x_var][i];\n          delta_x[i] = libmesh_real(this->current_solution(j)) -\n                       libmesh_real(unsteady->old_nonlinear_solution(j));\n        }\n\n      for (unsigned int i = 0; i != n_y_dofs; ++i)\n        {\n          unsigned int j = context.dof_indices_var[_mesh_y_var][i];\n          delta_y[i] = libmesh_real(this->current_solution(j)) -\n                       libmesh_real(unsteady->old_nonlinear_solution(j));\n        }\n\n      for (unsigned int i = 0; i != n_z_dofs; ++i)\n        {\n          unsigned int j = context.dof_indices_var[_mesh_z_var][i];\n          delta_z[i] = libmesh_real(this->current_solution(j)) -\n                       libmesh_real(unsteady->old_nonlinear_solution(j));\n        }\n\n      for (unsigned int qp = 0; qp != n_qpoints; ++qp)\n        {\n          Gradient grad_u = context.interior_gradient(var, qp);\n          RealGradient convection(0.);\n\n          for (unsigned int i = 0; i != n_x_dofs; ++i)\n\t    convection(0) += delta_x[i] * psi[i][qp];\n          for (unsigned int i = 0; i != n_y_dofs; ++i)\n\t    convection(1) += delta_y[i] * psi[i][qp];\n          for (unsigned int i = 0; i != n_z_dofs; ++i)\n\t    convection(2) += delta_z[i] * psi[i][qp];\n\n          for (unsigned int i = 0; i != n_u_dofs; ++i)\n            {\n              Number JxWxPhiI = JxW[qp] * phi[i][qp];\n              Fu(i) += (convection * grad_u) * JxWxPhiI;\n              if (request_jacobian)\n                {\n                  Number JxWxPhiI = JxW[qp] * phi[i][qp];\n                  for (unsigned int j = 0; j != n_u_dofs; ++j)\n                    Kuu(i,j) += JxWxPhiI * (convection * dphi[j][qp]);\n\n                  Number JxWxPhiIoverDT = JxWxPhiI\/this->deltat;\n\n                  Number JxWxPhiIxDUDXoverDT = JxWxPhiIoverDT * grad_u(0);\n                  for (unsigned int j = 0; j != n_x_dofs; ++j)\n                    (*Kux)(i,j) += JxWxPhiIxDUDXoverDT * psi[j][qp];\n\n                  Number JxWxPhiIxDUDYoverDT = JxWxPhiIoverDT * grad_u(1);\n                  for (unsigned int j = 0; j != n_y_dofs; ++j)\n                    (*Kuy)(i,j) += JxWxPhiIxDUDYoverDT * psi[j][qp];\n\n                  Number JxWxPhiIxDUDZoverDT = JxWxPhiIoverDT * grad_u(2);\n                  for (unsigned int j = 0; j != n_z_dofs; ++j)\n                    (*Kuz)(i,j) += JxWxPhiIxDUDZoverDT * psi[j][qp];\n                }\n            }\n        }\n    }\n#endif \/\/ 0\n\n  return request_jacobian;\n}\n\n\n\nbool FEMPhysics::mass_residual (bool request_jacobian,\n                                DiffContext &c)\n{\n  FEMContext &context = libmesh_cast_ref<FEMContext&>(c);\n\n  unsigned int n_qpoints = (context.get_element_qrule())->n_points();\n\n  for (unsigned int var = 0; var != context.n_vars(); ++var)\n    {\n      if (!this->is_time_evolving(var))\n        continue;\n\n      FEBase* elem_fe = NULL;\n      context.get_element_fe( var, elem_fe );\n\n      const std::vector<Real> &JxW = elem_fe->get_JxW();\n\n      const std::vector<std::vector<Real> > &phi = elem_fe->get_phi();\n\n      const unsigned int n_dofs = libmesh_cast_int<unsigned int>\n\t(context.get_dof_indices(var).size());\n\n      DenseSubVector<Number> &Fu = context.get_elem_residual(var);\n      DenseSubMatrix<Number> &Kuu = context.get_elem_jacobian( var, var );\n\n      for (unsigned int qp = 0; qp != n_qpoints; ++qp)\n        {\n          Number u = context.interior_value(var, qp);\n          Number JxWxU = JxW[qp] * u;\n          for (unsigned int i = 0; i != n_dofs; ++i)\n            {\n              Fu(i) += JxWxU * phi[i][qp];\n              if (request_jacobian && context.elem_solution_derivative)\n                {\n                  libmesh_assert_equal_to (context.elem_solution_derivative, 1.0);\n\n                  Number JxWxPhiI = JxW[qp] * phi[i][qp];\n                  Kuu(i,i) += JxWxPhiI * phi[i][qp];\n                  for (unsigned int j = i+1; j < n_dofs; ++j)\n                    {\n                      Number Kij = JxWxPhiI * phi[j][qp];\n                      Kuu(i,j) += Kij;\n                      Kuu(j,i) += Kij;\n                    }\n                }\n            }\n        }\n    }\n\n  return request_jacobian;\n}\n\n} \/\/ namespace libMesh\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 \"gtest\/gtest.h\"\n#include \"perfetto\/base\/build_config.h\"\n#include \"src\/base\/test\/test_task_runner.h\"\n#include \"test\/test_helper.h\"\n\n#include \"src\/profiling\/memory\/heapprofd_producer.h\"\n#include \"src\/tracing\/ipc\/default_socket.h\"\n\n#include <sys\/system_properties.h>\n\n\/\/ This test only works when run on Android using an Android Q version of\n\/\/ Bionic.\n#if !PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\n#error \"This test can only be used on Android.\"\n#endif\n\n\/\/ If we're building on Android and starting the daemons ourselves,\n\/\/ create the sockets in a world-writable location.\n#if PERFETTO_BUILDFLAG(PERFETTO_START_DAEMONS)\n#define TEST_PRODUCER_SOCK_NAME \"\/data\/local\/tmp\/traced_producer\"\n#else\n#define TEST_PRODUCER_SOCK_NAME ::perfetto::GetProducerSocket()\n#endif\n\nnamespace perfetto {\nnamespace profiling {\nnamespace {\n\nvoid WaitForHeapprofd(uint64_t timeout_ms) {\n  constexpr uint64_t kSleepMs = 10;\n  std::vector<std::string> cmdlines{\"heapprofd\"};\n  std::set<pid_t> pids;\n  for (size_t i = 0; i < timeout_ms \/ kSleepMs && pids.empty(); ++i) {\n    FindPidsForCmdlines(cmdlines, &pids);\n    usleep(kSleepMs * 1000);\n  }\n}\n\nclass HeapprofdDelegate : public ThreadDelegate {\n public:\n  HeapprofdDelegate(const std::string& producer_socket)\n      : producer_socket_(producer_socket) {}\n  ~HeapprofdDelegate() override = default;\n\n  void Initialize(base::TaskRunner* task_runner) override {\n    producer_.reset(\n        new HeapprofdProducer(HeapprofdMode::kCentral, task_runner));\n    producer_->ConnectWithRetries(producer_socket_.c_str());\n  }\n\n private:\n  std::string producer_socket_;\n  std::unique_ptr<HeapprofdProducer> producer_;\n};\n\nconstexpr const char* kEnableHeapprofdProperty = \"persist.heapprofd.enable\";\n\nint __attribute__((unused)) SetProperty(std::string* value) {\n  if (value) {\n    __system_property_set(kEnableHeapprofdProperty, value->c_str());\n    delete value;\n  }\n  return 0;\n}\n\nbase::ScopedResource<std::string*, SetProperty, nullptr>\nStartSystemHeapprofdIfRequired() {\n  base::ignore_result(TEST_PRODUCER_SOCK_NAME);\n  std::string prev_property_value = \"0\";\n  const prop_info* pi = __system_property_find(kEnableHeapprofdProperty);\n  if (pi) {\n    __system_property_read_callback(\n        pi,\n        [](void* cookie, const char*, const char* value, uint32_t) {\n          *reinterpret_cast<std::string*>(cookie) = value;\n        },\n        &prev_property_value);\n  }\n  __system_property_set(kEnableHeapprofdProperty, \"1\");\n  WaitForHeapprofd(5000);\n  return base::ScopedResource<std::string*, SetProperty, nullptr>(\n      new std::string(prev_property_value));\n}\n\npid_t ForkContinousMalloc(size_t bytes) {\n  pid_t pid = fork();\n  switch (pid) {\n    case -1:\n      PERFETTO_FATAL(\"Failed to fork.\");\n    case 0:\n      for (;;) {\n        \/\/ This volatile is needed to prevent the compiler from trying to be\n        \/\/ helpful and compiling a \"useless\" malloc + free into a noop.\n        volatile char* x = static_cast<char*>(malloc(bytes));\n        if (x) {\n          x[1] = 'x';\n          free(const_cast<char*>(x));\n        }\n      }\n    default:\n      break;\n  }\n  return pid;\n}\n\nclass HeapprofdEndToEnd : public ::testing::Test {\n public:\n  HeapprofdEndToEnd() {\n    \/\/ This is not needed for correctness, but works around a init behavior that\n    \/\/ makes this test take much longer. If persist.heapprofd.enable is set to 0\n    \/\/ and then set to 1 again too quickly, init decides that the service is\n    \/\/ \"restarting\" and waits before restarting it.\n    usleep(50000);\n    helper.StartServiceIfRequired();\n    unset_property = StartSystemHeapprofdIfRequired();\n\n    helper.ConnectConsumer();\n    helper.WaitForConsumerConnect();\n  }\n\n protected:\n  base::TestTaskRunner task_runner;\n  TestHelper helper{&task_runner};\n\n#if PERFETTO_BUILDFLAG(PERFETTO_START_DAEMONS)\n  TaskRunnerThread producer_thread(\"perfetto.prd\");\n  producer_thread.Start(std::unique_ptr<HeapprofdDelegate>(\n      new HeapprofdDelegate(TEST_PRODUCER_SOCK_NAME)));\n#else\n  base::ScopedResource<std::string*, SetProperty, nullptr> unset_property;\n#endif\n};\n\n\/\/ TODO(b\/121352331): deflake and re-enable this test.\nTEST_F(HeapprofdEndToEnd, DISABLED_Smoke) {\n  constexpr size_t kAllocSize = 1024;\n\n  pid_t pid = ForkContinousMalloc(kAllocSize);\n\n  TraceConfig trace_config;\n  trace_config.add_buffers()->set_size_kb(10 * 1024);\n  trace_config.set_duration_ms(1000);\n\n  auto* ds_config = trace_config.add_data_sources()->mutable_config();\n  ds_config->set_name(\"android.heapprofd\");\n  ds_config->set_target_buffer(0);\n\n  auto* heapprofd_config = ds_config->mutable_heapprofd_config();\n  heapprofd_config->set_sampling_interval_bytes(1);\n  *heapprofd_config->add_pid() = static_cast<uint64_t>(pid);\n  heapprofd_config->set_all(false);\n  heapprofd_config->mutable_continuous_dump_config()->set_dump_phase_ms(0);\n  heapprofd_config->mutable_continuous_dump_config()->set_dump_interval_ms(100);\n\n  helper.StartTracing(trace_config);\n  helper.WaitForTracingDisabled(5000);\n\n  helper.ReadData();\n  helper.WaitForReadData();\n\n  PERFETTO_CHECK(kill(pid, SIGKILL) == 0);\n  PERFETTO_CHECK(waitpid(pid, nullptr, 0) == pid);\n\n  const auto& packets = helper.trace();\n  ASSERT_GT(packets.size(), 0u);\n  size_t profile_packets = 0;\n  size_t samples = 0;\n  uint64_t last_allocated = 0;\n  uint64_t last_freed = 0;\n  for (const protos::TracePacket& packet : packets) {\n    if (packet.has_profile_packet() &&\n        packet.profile_packet().process_dumps().size() > 0) {\n      const auto& dumps = packet.profile_packet().process_dumps();\n      ASSERT_EQ(dumps.size(), 1);\n      const protos::ProfilePacket_ProcessHeapSamples& dump = dumps.Get(0);\n      EXPECT_EQ(dump.pid(), pid);\n      EXPECT_EQ(dump.samples().size(), 1);\n      for (const auto& sample : dump.samples()) {\n        samples++;\n        EXPECT_EQ(sample.self_allocated() % kAllocSize, 0);\n        EXPECT_EQ(sample.self_freed() % kAllocSize, 0);\n        last_allocated = sample.self_allocated();\n        last_freed = sample.self_freed();\n      }\n      profile_packets++;\n    }\n  }\n  EXPECT_GT(profile_packets, 0);\n  EXPECT_GT(samples, 0);\n  EXPECT_GT(last_allocated, 0);\n  EXPECT_GT(last_freed, 0);\n}\n\n\/\/ TODO(b\/121352331): deflake and re-enable this test.\nTEST_F(HeapprofdEndToEnd, DISABLED_FinalFlush) {\n  constexpr size_t kAllocSize = 1024;\n\n  pid_t pid = ForkContinousMalloc(kAllocSize);\n\n  TraceConfig trace_config;\n  trace_config.add_buffers()->set_size_kb(10 * 1024);\n  trace_config.set_duration_ms(1000);\n\n  auto* ds_config = trace_config.add_data_sources()->mutable_config();\n  ds_config->set_name(\"android.heapprofd\");\n  ds_config->set_target_buffer(0);\n\n  auto* heapprofd_config = ds_config->mutable_heapprofd_config();\n  heapprofd_config->set_sampling_interval_bytes(1);\n  *heapprofd_config->add_pid() = static_cast<uint64_t>(pid);\n  heapprofd_config->set_all(false);\n\n  helper.StartTracing(trace_config);\n  helper.WaitForTracingDisabled(5000);\n\n  helper.ReadData();\n  helper.WaitForReadData();\n\n  PERFETTO_CHECK(kill(pid, SIGKILL) == 0);\n  PERFETTO_CHECK(waitpid(pid, nullptr, 0) == pid);\n\n  const auto& packets = helper.trace();\n  ASSERT_GT(packets.size(), 0u);\n  size_t profile_packets = 0;\n  size_t samples = 0;\n  uint64_t last_allocated = 0;\n  uint64_t last_freed = 0;\n  for (const protos::TracePacket& packet : packets) {\n    if (packet.has_profile_packet() &&\n        packet.profile_packet().process_dumps().size() > 0) {\n      const auto& dumps = packet.profile_packet().process_dumps();\n      ASSERT_EQ(dumps.size(), 1);\n      const protos::ProfilePacket_ProcessHeapSamples& dump = dumps.Get(0);\n      EXPECT_EQ(dump.pid(), pid);\n      EXPECT_EQ(dump.samples().size(), 1);\n      for (const auto& sample : dump.samples()) {\n        samples++;\n        EXPECT_EQ(sample.self_allocated() % kAllocSize, 0);\n        EXPECT_EQ(sample.self_freed() % kAllocSize, 0);\n        last_allocated = sample.self_allocated();\n        last_freed = sample.self_freed();\n      }\n      profile_packets++;\n    }\n  }\n  EXPECT_EQ(profile_packets, 1);\n  EXPECT_GT(samples, 0);\n  EXPECT_GT(last_allocated, 0);\n  EXPECT_GT(last_freed, 0);\n}\n\n\/\/ TODO(b\/121352331): deflake and re-enable this test.\nTEST_F(HeapprofdEndToEnd, DISABLED_NativeStartup) {\n  TraceConfig trace_config;\n  trace_config.add_buffers()->set_size_kb(10 * 1024);\n  trace_config.set_duration_ms(5000);\n\n  auto* ds_config = trace_config.add_data_sources()->mutable_config();\n  ds_config->set_name(\"android.heapprofd\");\n\n  auto* heapprofd_config = ds_config->mutable_heapprofd_config();\n  heapprofd_config->set_sampling_interval_bytes(1);\n  *heapprofd_config->add_process_cmdline() = \"find\";\n  heapprofd_config->set_all(false);\n\n  helper.StartTracing(trace_config);\n\n  \/\/ Wait to guarantee that the process forked below is hooked by the profiler\n  \/\/ by virtue of the startup check, and not by virtue of being seen as a\n  \/\/ runnning process. This sleep is here to prevent that, accidentally, the\n  \/\/ test gets to the fork()+exec() too soon, before the heap profiling daemon\n  \/\/ has received the trace config.\n  sleep(1);\n\n  pid_t pid = fork();\n  switch (pid) {\n    case -1:\n      PERFETTO_FATAL(\"Failed to fork.\");\n    case 0: {\n      int null = open(\"\/dev\/null\", O_RDWR);\n      dup2(null, STDIN_FILENO);\n      dup2(null, STDOUT_FILENO);\n      dup2(null, STDERR_FILENO);\n      \/\/ TODO(fmayer): Use a dedicated test binary rather than relying on find\n      \/\/ doing allocations.\n      PERFETTO_CHECK(execl(\"\/system\/bin\/find\", \"find\", \"\/\", nullptr) == 0);\n      break;\n    }\n    default:\n      break;\n  }\n\n  helper.WaitForTracingDisabled(10000);\n\n  helper.ReadData();\n  helper.WaitForReadData();\n\n  PERFETTO_CHECK(kill(pid, SIGKILL) == 0);\n  PERFETTO_CHECK(waitpid(pid, nullptr, 0) == pid);\n\n  const auto& packets = helper.trace();\n  ASSERT_GT(packets.size(), 0u);\n  size_t profile_packets = 0;\n  size_t samples = 0;\n  uint64_t total_allocated = 0;\n  uint64_t total_freed = 0;\n  for (const protos::TracePacket& packet : packets) {\n    if (packet.has_profile_packet() &&\n        packet.profile_packet().process_dumps().size() > 0) {\n      const auto& dumps = packet.profile_packet().process_dumps();\n      ASSERT_EQ(dumps.size(), 1);\n      const protos::ProfilePacket_ProcessHeapSamples& dump = dumps.Get(0);\n      EXPECT_EQ(dump.pid(), pid);\n      profile_packets++;\n      for (const auto& sample : dump.samples()) {\n        samples++;\n        total_allocated += sample.self_allocated();\n        total_freed += sample.self_freed();\n      }\n    }\n  }\n  EXPECT_EQ(profile_packets, 1);\n  EXPECT_GT(samples, 0);\n  EXPECT_GT(total_allocated, 0);\n  EXPECT_GT(total_freed, 0);\n}\n\n}  \/\/ namespace\n}  \/\/ namespace profiling\n}  \/\/ namespace perfetto\n<commit_msg>profiling: Re-enable end to end tests. am: b10161389f am: 6d1dea6861 am: 7427a01f21<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 \"gtest\/gtest.h\"\n#include \"perfetto\/base\/build_config.h\"\n#include \"src\/base\/test\/test_task_runner.h\"\n#include \"test\/test_helper.h\"\n\n#include \"src\/profiling\/memory\/heapprofd_producer.h\"\n#include \"src\/tracing\/ipc\/default_socket.h\"\n\n#include <sys\/system_properties.h>\n\n\/\/ This test only works when run on Android using an Android Q version of\n\/\/ Bionic.\n#if !PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\n#error \"This test can only be used on Android.\"\n#endif\n\n\/\/ If we're building on Android and starting the daemons ourselves,\n\/\/ create the sockets in a world-writable location.\n#if PERFETTO_BUILDFLAG(PERFETTO_START_DAEMONS)\n#define TEST_PRODUCER_SOCK_NAME \"\/data\/local\/tmp\/traced_producer\"\n#else\n#define TEST_PRODUCER_SOCK_NAME ::perfetto::GetProducerSocket()\n#endif\n\nnamespace perfetto {\nnamespace profiling {\nnamespace {\n\nvoid WaitForHeapprofd(uint64_t timeout_ms) {\n  constexpr uint64_t kSleepMs = 10;\n  std::vector<std::string> cmdlines{\"heapprofd\"};\n  std::set<pid_t> pids;\n  for (size_t i = 0; i < timeout_ms \/ kSleepMs && pids.empty(); ++i) {\n    FindPidsForCmdlines(cmdlines, &pids);\n    usleep(kSleepMs * 1000);\n  }\n}\n\nclass HeapprofdDelegate : public ThreadDelegate {\n public:\n  HeapprofdDelegate(const std::string& producer_socket)\n      : producer_socket_(producer_socket) {}\n  ~HeapprofdDelegate() override = default;\n\n  void Initialize(base::TaskRunner* task_runner) override {\n    producer_.reset(\n        new HeapprofdProducer(HeapprofdMode::kCentral, task_runner));\n    producer_->ConnectWithRetries(producer_socket_.c_str());\n  }\n\n private:\n  std::string producer_socket_;\n  std::unique_ptr<HeapprofdProducer> producer_;\n};\n\nconstexpr const char* kEnableHeapprofdProperty = \"persist.heapprofd.enable\";\n\nint __attribute__((unused)) SetProperty(std::string* value) {\n  if (value) {\n    __system_property_set(kEnableHeapprofdProperty, value->c_str());\n    delete value;\n  }\n  return 0;\n}\n\nbase::ScopedResource<std::string*, SetProperty, nullptr>\nStartSystemHeapprofdIfRequired() {\n  base::ignore_result(TEST_PRODUCER_SOCK_NAME);\n  std::string prev_property_value = \"0\";\n  const prop_info* pi = __system_property_find(kEnableHeapprofdProperty);\n  if (pi) {\n    __system_property_read_callback(\n        pi,\n        [](void* cookie, const char*, const char* value, uint32_t) {\n          *reinterpret_cast<std::string*>(cookie) = value;\n        },\n        &prev_property_value);\n  }\n  __system_property_set(kEnableHeapprofdProperty, \"1\");\n  WaitForHeapprofd(5000);\n  return base::ScopedResource<std::string*, SetProperty, nullptr>(\n      new std::string(prev_property_value));\n}\n\npid_t ForkContinousMalloc(size_t bytes) {\n  pid_t pid = fork();\n  switch (pid) {\n    case -1:\n      PERFETTO_FATAL(\"Failed to fork.\");\n    case 0:\n      for (;;) {\n        \/\/ This volatile is needed to prevent the compiler from trying to be\n        \/\/ helpful and compiling a \"useless\" malloc + free into a noop.\n        volatile char* x = static_cast<char*>(malloc(bytes));\n        if (x) {\n          x[1] = 'x';\n          free(const_cast<char*>(x));\n        }\n      }\n    default:\n      break;\n  }\n  return pid;\n}\n\nclass HeapprofdEndToEnd : public ::testing::Test {\n public:\n  HeapprofdEndToEnd() {\n    \/\/ This is not needed for correctness, but works around a init behavior that\n    \/\/ makes this test take much longer. If persist.heapprofd.enable is set to 0\n    \/\/ and then set to 1 again too quickly, init decides that the service is\n    \/\/ \"restarting\" and waits before restarting it.\n    usleep(50000);\n    helper.StartServiceIfRequired();\n    unset_property = StartSystemHeapprofdIfRequired();\n\n    helper.ConnectConsumer();\n    helper.WaitForConsumerConnect();\n  }\n\n protected:\n  base::TestTaskRunner task_runner;\n  TestHelper helper{&task_runner};\n\n#if PERFETTO_BUILDFLAG(PERFETTO_START_DAEMONS)\n  TaskRunnerThread producer_thread(\"perfetto.prd\");\n  producer_thread.Start(std::unique_ptr<HeapprofdDelegate>(\n      new HeapprofdDelegate(TEST_PRODUCER_SOCK_NAME)));\n#else\n  base::ScopedResource<std::string*, SetProperty, nullptr> unset_property;\n#endif\n};\n\n\/\/ TODO(b\/121352331): deflake and re-enable this test.\nTEST_F(HeapprofdEndToEnd, Smoke) {\n  constexpr size_t kAllocSize = 1024;\n\n  pid_t pid = ForkContinousMalloc(kAllocSize);\n\n  TraceConfig trace_config;\n  trace_config.add_buffers()->set_size_kb(10 * 1024);\n  trace_config.set_duration_ms(1000);\n\n  auto* ds_config = trace_config.add_data_sources()->mutable_config();\n  ds_config->set_name(\"android.heapprofd\");\n  ds_config->set_target_buffer(0);\n\n  auto* heapprofd_config = ds_config->mutable_heapprofd_config();\n  heapprofd_config->set_sampling_interval_bytes(1);\n  *heapprofd_config->add_pid() = static_cast<uint64_t>(pid);\n  heapprofd_config->set_all(false);\n  heapprofd_config->mutable_continuous_dump_config()->set_dump_phase_ms(0);\n  heapprofd_config->mutable_continuous_dump_config()->set_dump_interval_ms(100);\n\n  helper.StartTracing(trace_config);\n  helper.WaitForTracingDisabled(10000);\n\n  helper.ReadData();\n  helper.WaitForReadData();\n\n  PERFETTO_CHECK(kill(pid, SIGKILL) == 0);\n  PERFETTO_CHECK(waitpid(pid, nullptr, 0) == pid);\n\n  const auto& packets = helper.trace();\n  ASSERT_GT(packets.size(), 0u);\n  size_t profile_packets = 0;\n  size_t samples = 0;\n  uint64_t last_allocated = 0;\n  uint64_t last_freed = 0;\n  for (const protos::TracePacket& packet : packets) {\n    if (packet.has_profile_packet() &&\n        packet.profile_packet().process_dumps().size() > 0) {\n      const auto& dumps = packet.profile_packet().process_dumps();\n      ASSERT_EQ(dumps.size(), 1);\n      const protos::ProfilePacket_ProcessHeapSamples& dump = dumps.Get(0);\n      EXPECT_EQ(dump.pid(), pid);\n      for (const auto& sample : dump.samples()) {\n        samples++;\n        EXPECT_EQ(sample.self_allocated() % kAllocSize, 0);\n        EXPECT_EQ(sample.self_freed() % kAllocSize, 0);\n        last_allocated = sample.self_allocated();\n        last_freed = sample.self_freed();\n      }\n      profile_packets++;\n    }\n  }\n  EXPECT_GT(profile_packets, 0);\n  EXPECT_GT(samples, 0);\n  EXPECT_GT(last_allocated, 0);\n  EXPECT_GT(last_freed, 0);\n}\n\n\/\/ TODO(b\/121352331): deflake and re-enable this test.\nTEST_F(HeapprofdEndToEnd, FinalFlush) {\n  constexpr size_t kAllocSize = 1024;\n\n  pid_t pid = ForkContinousMalloc(kAllocSize);\n\n  TraceConfig trace_config;\n  trace_config.add_buffers()->set_size_kb(10 * 1024);\n  trace_config.set_duration_ms(1000);\n\n  auto* ds_config = trace_config.add_data_sources()->mutable_config();\n  ds_config->set_name(\"android.heapprofd\");\n  ds_config->set_target_buffer(0);\n\n  auto* heapprofd_config = ds_config->mutable_heapprofd_config();\n  heapprofd_config->set_sampling_interval_bytes(1);\n  *heapprofd_config->add_pid() = static_cast<uint64_t>(pid);\n  heapprofd_config->set_all(false);\n\n  helper.StartTracing(trace_config);\n  helper.WaitForTracingDisabled(10000);\n\n  helper.ReadData();\n  helper.WaitForReadData();\n\n  PERFETTO_CHECK(kill(pid, SIGKILL) == 0);\n  PERFETTO_CHECK(waitpid(pid, nullptr, 0) == pid);\n\n  const auto& packets = helper.trace();\n  ASSERT_GT(packets.size(), 0u);\n  size_t profile_packets = 0;\n  size_t samples = 0;\n  uint64_t last_allocated = 0;\n  uint64_t last_freed = 0;\n  for (const protos::TracePacket& packet : packets) {\n    if (packet.has_profile_packet() &&\n        packet.profile_packet().process_dumps().size() > 0) {\n      const auto& dumps = packet.profile_packet().process_dumps();\n      ASSERT_EQ(dumps.size(), 1);\n      const protos::ProfilePacket_ProcessHeapSamples& dump = dumps.Get(0);\n      EXPECT_EQ(dump.pid(), pid);\n      EXPECT_EQ(dump.samples().size(), 1);\n      for (const auto& sample : dump.samples()) {\n        samples++;\n        EXPECT_EQ(sample.self_allocated() % kAllocSize, 0);\n        EXPECT_EQ(sample.self_freed() % kAllocSize, 0);\n        last_allocated = sample.self_allocated();\n        last_freed = sample.self_freed();\n      }\n      profile_packets++;\n    }\n  }\n  EXPECT_EQ(profile_packets, 1);\n  EXPECT_GT(samples, 0);\n  EXPECT_GT(last_allocated, 0);\n  EXPECT_GT(last_freed, 0);\n}\n\n\/\/ TODO(b\/121352331): deflake and re-enable this test.\nTEST_F(HeapprofdEndToEnd, NativeStartup) {\n  TraceConfig trace_config;\n  trace_config.add_buffers()->set_size_kb(10 * 1024);\n  trace_config.set_duration_ms(5000);\n\n  auto* ds_config = trace_config.add_data_sources()->mutable_config();\n  ds_config->set_name(\"android.heapprofd\");\n\n  auto* heapprofd_config = ds_config->mutable_heapprofd_config();\n  heapprofd_config->set_sampling_interval_bytes(1);\n  *heapprofd_config->add_process_cmdline() = \"find\";\n  heapprofd_config->set_all(false);\n\n  helper.StartTracing(trace_config);\n\n  \/\/ Wait to guarantee that the process forked below is hooked by the profiler\n  \/\/ by virtue of the startup check, and not by virtue of being seen as a\n  \/\/ runnning process. This sleep is here to prevent that, accidentally, the\n  \/\/ test gets to the fork()+exec() too soon, before the heap profiling daemon\n  \/\/ has received the trace config.\n  sleep(1);\n\n  pid_t pid = fork();\n  switch (pid) {\n    case -1:\n      PERFETTO_FATAL(\"Failed to fork.\");\n    case 0: {\n      int null = open(\"\/dev\/null\", O_RDWR);\n      dup2(null, STDIN_FILENO);\n      dup2(null, STDOUT_FILENO);\n      dup2(null, STDERR_FILENO);\n      \/\/ TODO(fmayer): Use a dedicated test binary rather than relying on find\n      \/\/ doing allocations.\n      PERFETTO_CHECK(execl(\"\/system\/bin\/find\", \"find\", \"\/\", nullptr) == 0);\n      break;\n    }\n    default:\n      break;\n  }\n\n  helper.WaitForTracingDisabled(10000);\n\n  helper.ReadData();\n  helper.WaitForReadData();\n\n  PERFETTO_CHECK(kill(pid, SIGKILL) == 0);\n  PERFETTO_CHECK(waitpid(pid, nullptr, 0) == pid);\n\n  const auto& packets = helper.trace();\n  ASSERT_GT(packets.size(), 0u);\n  size_t profile_packets = 0;\n  size_t samples = 0;\n  uint64_t total_allocated = 0;\n  uint64_t total_freed = 0;\n  for (const protos::TracePacket& packet : packets) {\n    if (packet.has_profile_packet() &&\n        packet.profile_packet().process_dumps().size() > 0) {\n      const auto& dumps = packet.profile_packet().process_dumps();\n      ASSERT_EQ(dumps.size(), 1);\n      const protos::ProfilePacket_ProcessHeapSamples& dump = dumps.Get(0);\n      EXPECT_EQ(dump.pid(), pid);\n      profile_packets++;\n      for (const auto& sample : dump.samples()) {\n        samples++;\n        total_allocated += sample.self_allocated();\n        total_freed += sample.self_freed();\n      }\n    }\n  }\n  EXPECT_EQ(profile_packets, 1);\n  EXPECT_GT(samples, 0);\n  EXPECT_GT(total_allocated, 0);\n  EXPECT_GT(total_freed, 0);\n}\n\n}  \/\/ namespace\n}  \/\/ namespace profiling\n}  \/\/ namespace perfetto\n<|endoftext|>"}
{"text":"<commit_before>#include <yaml-cpp\/yaml.h>\n\n#include <iostream>\n#include <fstream>\n#include <map>\n\n#include \"Config.hh\"\n#include \"Exception.hh\"\n\nnamespace aegir {\n\n  \/\/ PIN default configuration\n  pinconfig_t g_pinconfig = pinconfig_t{\n    {\"swled\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"swon\",  PinConfig(PinMode::IN, PinPull::DOWN)},\n    {\"swoff\", PinConfig(PinMode::IN, PinPull::DOWN)},\n    {\"cs0\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"cs1\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"cs2\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"cs3\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"rimsheat\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"rimspump\", PinConfig(PinMode::OUT, PinPull::NONE)}\n  };\n\n  static std::set<std::string> g_tcnames{\"RIMS\", \"MashTun\", \"HLT\", \"BK\"};\n\n  \/\/ SPI ChipSelector string translations\n  static std::map<ChipSelectors, std::string> g_spi_cs_to_string{\n    {ChipSelectors::DirectSelect, \"DirectSelect\"}};\n  static std::map<std::string, ChipSelectors> g_spi_string_to_cs{\n    {\"DirectSelect\",ChipSelectors::DirectSelect}};\n  \/\/ ThermoCouple type lookups\n  std::map<std::string, MAX31856::TCType> g_string_to_tctype{\n    {\"B\", MAX31856::TCType::B},\n      {\"E\", MAX31856::TCType::E},\n\t{\"J\", MAX31856::TCType::J},\n\t  {\"K\", MAX31856::TCType::K},\n\t    {\"N\", MAX31856::TCType::N},\n\t      {\"R\", MAX31856::TCType::R},\n\t\t{\"S\", MAX31856::TCType::S},\n\t\t  {\"T\", MAX31856::TCType::T}\n  };\n  std::map<MAX31856::TCType, std::string> g_tctype_to_string{\n    {MAX31856::TCType::B, \"B\"},\n      {MAX31856::TCType::E, \"E\"},\n\t{MAX31856::TCType::J, \"J\"},\n\t  {MAX31856::TCType::K, \"K\"},\n\t    {MAX31856::TCType::N, \"N\"},\n\t      {MAX31856::TCType::R, \"R\"},\n\t\t{MAX31856::TCType::S, \"S\"},\n\t\t  {MAX31856::TCType::T, \"T\"}\n  };\n  \/\/ Noisefilter lookups\n  std::map<std::string, NoiseFilters> g_string_to_noisefilter{\n    {\"50Hz\", NoiseFilters::HZ50},\n    {\"60Hz\", NoiseFilters::HZ60}\n  };\n  std::map<NoiseFilters, std::string> g_noisefilter_to_string{\n    {NoiseFilters::HZ50, \"50Hz\"},\n      {NoiseFilters::HZ60, \"60Hz\"}\n  };\n\n  \/\/ The singleton instance holder\n  Config *Config::c_instance=0;\n\n  Config::Config(const std::string &_cfgfile, bool _noload): c_cfgfile(_cfgfile) {\n    setDefaults();\n    if ( !_noload ) load();\n  }\n\n  Config::~Config() {\n    save();\n  }\n\n  Config *Config::instantiate(const std::string &_cfgfile, bool _noload) {\n    if ( !c_instance ) c_instance = new Config(_cfgfile, _noload);\n    return c_instance;\n  }\n\n  \/\/ TODO: throw exception when !c_instance\n  Config *Config::getInstance() {\n    return c_instance;\n  }\n\n  void Config::setDefaults() {\n    c_device = \"\/dev\/gpioc0\";\n\n    \/\/ PIN layout\n    c_pinlayout.clear();\n    c_pinlayout[\"swled\"] = 16;\n    c_pinlayout[\"swon\"]  = 20;\n    c_pinlayout[\"swoff\"] = 21;\n    c_pinlayout[\"rimsheat\"] = 23;\n    c_pinlayout[\"rimspump\"] = 24;\n\n    \/\/ SPI config\n    c_spidev = \"\/dev\/spigen0\";\n    c_spi_chipselector = ChipSelectors::DirectSelect;\n    c_pinlayout[\"cs0\"] = 8;\n    c_pinlayout[\"cs1\"] = 7;\n    c_pinlayout[\"cs2\"] = 5;\n    c_pinlayout[\"cs3\"] = 6;\n    \/\/ SPI \/ MAX31856\n    c_spi_max31856_tctype = MAX31856::TCType::T;\n    c_spi_max31856_noisefilter = NoiseFilters::HZ50;\n    \/\/ SPI \/ chips\n    c_spi_dschips = {{0, \"cs0\"}, {1, \"cs1\"}, {2, \"cs2\"}, {3, \"cs3\"}};\n\n    \/\/ thermocouples\n    c_thermocouples = {{\"MashTun\", 0}, {\"RIMS\", 1}, {\"HLT\", 2}, {\"BK\", 3}};\n\n    \/\/ thermocouple reading interval\n    c_thermoival = 1;\n\n    \/\/ the PR ZMQ socket\n    c_zmq_pr_port = 42069;\n\n    \/\/ the heating element's power\n    c_hepower = 3500;\n  }\n\n  void Config::load() {\n    YAML::Node config;\n    try {\n      config = YAML::LoadFile(c_cfgfile);\n    }\n    catch (YAML::ParserException &e) {\n      throw Exception(\"YAML::ParseException: %s\", e.what());\n    }\n    catch (std::exception &e) {\n      throw Exception(\"Unknown exception: %s\", e.what());\n    }\n    catch (...) {\n      throw Exception(\"Unknown exception\");\n    }\n\n    \/\/ The config file is loaded into config, now put it into local variables\n    try {\n      \/\/ GPIO\n      if ( config[\"gpio\"] && config[\"gpio\"].IsMap() ) {\n\tYAML::Node gpio = config[\"gpio\"];\n\t\/\/ load the device\n\tif ( gpio[\"device\"] ) c_device = gpio[\"device\"].as<std::string>();\n\n\t\/\/ the PIN configuration\n\tif ( gpio[\"pins\"] && gpio[\"pins\"].IsMap() ) {\n\t  YAML::Node pins = gpio[\"pins\"];\n\t  std::map<std::string, int> pinlayout(c_pinlayout);\n\t  for (const auto &it: g_pinconfig)\n\t    if ( pins[it.first] ) pinlayout[it.first] = pins[it.first].as<int>();\n\n\t  checkPinConfig(pinlayout);\n\t  c_pinlayout = pinlayout;\n\t} \/\/ PIN config\n      } \/\/ GPIO section\n\n      \/\/ SPI\n      if ( config[\"spi\"] && config[\"spi\"].IsMap() ) {\n\tYAML::Node spi = config[\"spi\"];\n\n\t\/\/ load the device\n\tif ( spi[\"device\"] ) c_spidev = spi[\"device\"].as<std::string>();\n\t\/\/ load the selector\n\tif ( spi[\"selector\"] ) {\n\t  std::string csname(spi[\"selector\"].as<std::string>());\n\t  auto it = g_spi_string_to_cs.find(csname);\n\t  if ( it == g_spi_string_to_cs.end() ) {\n\t    throw Exception(\"Unknown SPI chip selector: %s\\n\", csname.c_str());\n\t  }\n\t  c_spi_chipselector = it->second;\n\t}\n\t\/\/ MAX31856 config\n\tif ( spi[\"MAX31856\"] && spi[\"MAX31856\"].IsMap() ) {\n\t  auto max31856 = spi[\"MAX31856\"];\n\t  \/\/ TC type\n\t  if ( max31856[\"tctype\"] ) {\n\t    std::string tctype = max31856[\"tctype\"].as<std::string>();\n\t    auto it = g_string_to_tctype.find(tctype);\n\t    if ( it == g_string_to_tctype.end() ) {\n\t      throw Exception(\"Unknown TC type: %s\\n\", tctype.c_str());\n\t    }\n\t    c_spi_max31856_tctype = it->second;\n\t  }\/\/ TC type\n\t  \/\/ Noise Filter, AKA 50\/60Hz\n\t  if ( max31856[\"noisefilter\"] ) {\n\t    std::string nf = max31856[\"noisefilter\"].as<std::string>();\n\t    auto it = g_string_to_noisefilter.find(nf);\n\t    if ( it == g_string_to_noisefilter.end() ) {\n\t      throw Exception(\"Unknown Noise Filter mode: %s\\n\", nf.c_str());\n\t    }\n\t    c_spi_max31856_noisefilter = it->second;\n\t  }\/\/ Noise Filter\n\t} \/\/ MAX31856 config\n\t\/\/ DirectSelect Chip Selector\n\t\/\/ the PIN configuration\n\tif ( spi[\"DirectSelect\"] && spi[\"DirectSelect\"].IsMap() ) {\n\t  YAML::Node ds = spi[\"DirectSelect\"];\n\n\t  \/\/ we have 3 hardcoded sensors at this level, for now\n\t  for (int i=0; i<3; ++i) {\n\t    if ( !ds[i] ) continue;\n\t    std::string pin = ds[i].as<std::string>();\n\t    auto it = g_pinconfig.find(pin);\n\t    if ( it == g_pinconfig.end() )\n\t      throw Exception(\"Unknown pin: %s\", pin.c_str());\n\t    c_spi_dschips[i] = pin;\n\t  }\n\n\t  \/\/ Now we have to check for dups\n\t  std::set<std::string> tmp;\n\t  for ( auto &it: c_spi_dschips ) {\n\t    auto it2 = tmp.find(it.second);\n\t    if ( it2 != tmp.end() )\n\t      throw Exception(\"Duplicate pin for DirectSelect: %s\", it.second.c_str());\n\t    tmp.insert(it.second);\n\t  }\n\t} \/\/ PIN config\n\n\t\/\/ Thermocouples\n\tif ( spi[\"thermocouples\"] && spi[\"thermocouples\"].IsMap() ) {\n\t  YAML::Node tc = spi[\"thermocouples\"];\n\n\t  \/\/ We are going through only the valid ones, the rest are ignored\n\t  \/\/ also, not emptying the list, because that's how unset values default\n\t  for (auto &it: g_tcnames) {\n\t    if ( tc[it] ) {\n\t      int id = tc[it].as<int>();\n\t      if ( id < 0 || id > 3 )\n\t\tthrow Exception(\"Thermocouple id out of range: %i\", id);\n\t      c_thermocouples[it] = id;\n\t    }\n\t  }\n\t  \/\/ now verify whether any of them is on the same id\n\t  std::set<int> tmp;\n\t  for (auto &it: c_thermocouples) {\n\t    if ( tmp.find(it.second) != tmp.end() )\n\t      throw Exception(\"Duplicate thermocouple id: %i\", it.second);\n\t    tmp.insert(it.second);\n\t  }\n\t} \/\/ thermocouples\n\tif ( spi[\"thermointerval\"] && spi[\"thermointerval\"].IsScalar() ) {\n\t  YAML::Node ti = spi[\"thermointerval\"];\n\t  c_thermoival = ti.as<uint32_t>();\n\tif ( c_thermoival > 60 )\n\t  throw Exception(\"Thermocouple reading interval is too high: %lu\", c_thermoival);\n\t}\n      } \/\/ SPI section\n\n      \/\/ ZMQ PR socket\n      if ( config[\"prport\"] && config[\"prport\"].IsScalar() ) {\n\tYAML::Node prsock = config[\"prport\"];\n\tc_zmq_pr_port = prsock.as<uint16_t>();\n      }\n\n      \/\/ Heating Element's Power\n      if ( config[\"elementpower\"] && config[\"elementpower\"].IsScalar() ) {\n\tYAML::Node hep = config[\"elementpower\"];\n\tc_hepower = hep.as<uint32_t>();\n\tif ( c_hepower < 1000 || c_hepower > 10000 )\n\t  throw Exception(\"Heating element's power is out of range\");\n      }\n\n    }\n    catch (std::exception &e) {\n      throw Exception(\"Error during parsing config: %s\", e.what());\n    }\n  }\n\n  void Config::checkPinConfig(std::map<std::string, int> &_layout) {\n    std::map<int, int> count;\n\n    for ( const auto &it: _layout ) {\n      if ( count.find(it.second) == count.end() ) {\n\tcount[it.second] = 0;\n      } else {\n\tcount[it.second] += 1;\n      }\n    }\n\n    for ( const auto &it: count ) {\n      if ( it.second > 1 ) throw Exception(\"Conflict on Pin %i\\n\", it.first);\n    }\n  }\n\n  Config &Config::save() {\n    YAML::Emitter yout;\n\n    yout << YAML::BeginMap;\n    \/\/ GPIO config\n    yout << YAML::Key << \"gpio\";\n    yout << YAML::Value << YAML::BeginMap;\n    yout << YAML::Key << \"device\" << YAML::Value << c_device;\n    yout << YAML::Key << \"pins\" << YAML::Value << c_pinlayout;\n    yout << YAML::EndMap;\n\n    \/\/ SPI config\n    yout << YAML::Key << \"spi\";\n    yout << YAML::Value << YAML::BeginMap;\n    yout << YAML::Key << \"device\" << YAML::Value << c_spidev;\n    yout << YAML::Key << \"selector\" << YAML::Value << g_spi_cs_to_string[c_spi_chipselector];\n\n    \/\/ SPI \/ MAX31856 config\n    yout << YAML::Key << \"MAX31856\";\n    yout << YAML::Value <<\n      std::map<std::string, std::string>{\n      {\"tctype\", g_tctype_to_string[c_spi_max31856_tctype]},\n\t{\"noisefilter\", g_noisefilter_to_string[c_spi_max31856_noisefilter]}};\n    \/\/ end SPI \/ MAX31856\n\n    \/\/ SPI \/ DirectSelect\n    yout << YAML::Key << \"DirectSelect\";\n    yout << YAML::Value << c_spi_dschips;\n\n    \/\/ Thermocouple layout\n    yout << YAML::Key << \"thermocouples\";\n    yout << YAML::Value << c_thermocouples;\n\n    \/\/ thermocouple reading interval\n    yout << YAML::Key << \"thermointerval\";\n    yout << YAML::Value << c_thermoival;\n\n    yout << YAML::EndMap; \/\/ end of SPI\n\n    \/\/ ZMQ PR port\n    yout << YAML::Key << \"prport\" << YAML::Value << c_zmq_pr_port;\n\n    \/\/ Heating element's power in watts\n    yout << YAML::Key << \"elementpower\" << YAML::Value << c_hepower;\n\n    \/\/ End the config\n    yout << YAML::EndMap;\n\n    std::ofstream outfile;\n\n    outfile.open(c_cfgfile, std::ios::out | std::ios::trunc);\n    outfile << yout.c_str() << std::endl;\n    outfile.close();\n\n    return *this;\n  }\n\n  const std::string &Config::getGPIODevice() const {\n    return c_device;\n  }\n\n  Config &Config::getPinConfig(pinlayout_t &_layout) {\n    _layout = c_pinlayout;\n    return *this;\n  }\n}\n<commit_msg>[brewd] Added the buzzer pin, and adjusted default heating element to 3kW<commit_after>#include <yaml-cpp\/yaml.h>\n\n#include <iostream>\n#include <fstream>\n#include <map>\n\n#include \"Config.hh\"\n#include \"Exception.hh\"\n\nnamespace aegir {\n\n  \/\/ PIN default configuration\n  pinconfig_t g_pinconfig = pinconfig_t{\n    {\"swled\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"swon\",  PinConfig(PinMode::IN, PinPull::DOWN)},\n    {\"swoff\", PinConfig(PinMode::IN, PinPull::DOWN)},\n    {\"cs0\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"cs1\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"cs2\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"cs3\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"rimsheat\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"rimspump\", PinConfig(PinMode::OUT, PinPull::NONE)},\n    {\"buzzer\", PinConfig(PinMode::OUT, PinPull::NONE)}\n  };\n\n  static std::set<std::string> g_tcnames{\"RIMS\", \"MashTun\", \"HLT\", \"BK\"};\n\n  \/\/ SPI ChipSelector string translations\n  static std::map<ChipSelectors, std::string> g_spi_cs_to_string{\n    {ChipSelectors::DirectSelect, \"DirectSelect\"}};\n  static std::map<std::string, ChipSelectors> g_spi_string_to_cs{\n    {\"DirectSelect\",ChipSelectors::DirectSelect}};\n  \/\/ ThermoCouple type lookups\n  std::map<std::string, MAX31856::TCType> g_string_to_tctype{\n    {\"B\", MAX31856::TCType::B},\n      {\"E\", MAX31856::TCType::E},\n\t{\"J\", MAX31856::TCType::J},\n\t  {\"K\", MAX31856::TCType::K},\n\t    {\"N\", MAX31856::TCType::N},\n\t      {\"R\", MAX31856::TCType::R},\n\t\t{\"S\", MAX31856::TCType::S},\n\t\t  {\"T\", MAX31856::TCType::T}\n  };\n  std::map<MAX31856::TCType, std::string> g_tctype_to_string{\n    {MAX31856::TCType::B, \"B\"},\n      {MAX31856::TCType::E, \"E\"},\n\t{MAX31856::TCType::J, \"J\"},\n\t  {MAX31856::TCType::K, \"K\"},\n\t    {MAX31856::TCType::N, \"N\"},\n\t      {MAX31856::TCType::R, \"R\"},\n\t\t{MAX31856::TCType::S, \"S\"},\n\t\t  {MAX31856::TCType::T, \"T\"}\n  };\n  \/\/ Noisefilter lookups\n  std::map<std::string, NoiseFilters> g_string_to_noisefilter{\n    {\"50Hz\", NoiseFilters::HZ50},\n    {\"60Hz\", NoiseFilters::HZ60}\n  };\n  std::map<NoiseFilters, std::string> g_noisefilter_to_string{\n    {NoiseFilters::HZ50, \"50Hz\"},\n      {NoiseFilters::HZ60, \"60Hz\"}\n  };\n\n  \/\/ The singleton instance holder\n  Config *Config::c_instance=0;\n\n  Config::Config(const std::string &_cfgfile, bool _noload): c_cfgfile(_cfgfile) {\n    setDefaults();\n    if ( !_noload ) load();\n  }\n\n  Config::~Config() {\n    save();\n  }\n\n  Config *Config::instantiate(const std::string &_cfgfile, bool _noload) {\n    if ( !c_instance ) c_instance = new Config(_cfgfile, _noload);\n    return c_instance;\n  }\n\n  \/\/ TODO: throw exception when !c_instance\n  Config *Config::getInstance() {\n    return c_instance;\n  }\n\n  void Config::setDefaults() {\n    c_device = \"\/dev\/gpioc0\";\n\n    \/\/ PIN layout\n    c_pinlayout.clear();\n    c_pinlayout[\"swled\"] = 16;\n    c_pinlayout[\"swon\"]  = 20;\n    c_pinlayout[\"swoff\"] = 21;\n    c_pinlayout[\"rimsheat\"] = 23;\n    c_pinlayout[\"rimspump\"] = 24;\n    c_pinlayout[\"buzzer\"] = 26;\n\n    \/\/ SPI config\n    c_spidev = \"\/dev\/spigen0\";\n    c_spi_chipselector = ChipSelectors::DirectSelect;\n    c_pinlayout[\"cs0\"] = 8;\n    c_pinlayout[\"cs1\"] = 7;\n    c_pinlayout[\"cs2\"] = 5;\n    c_pinlayout[\"cs3\"] = 6;\n    \/\/ SPI \/ MAX31856\n    c_spi_max31856_tctype = MAX31856::TCType::T;\n    c_spi_max31856_noisefilter = NoiseFilters::HZ50;\n    \/\/ SPI \/ chips\n    c_spi_dschips = {{0, \"cs0\"}, {1, \"cs1\"}, {2, \"cs2\"}, {3, \"cs3\"}};\n\n    \/\/ thermocouples\n    c_thermocouples = {{\"MashTun\", 0}, {\"RIMS\", 1}, {\"HLT\", 2}, {\"BK\", 3}};\n\n    \/\/ thermocouple reading interval\n    c_thermoival = 1;\n\n    \/\/ the PR ZMQ socket\n    c_zmq_pr_port = 42069;\n\n    \/\/ the heating element's power\n    c_hepower = 3000;\n  }\n\n  void Config::load() {\n    YAML::Node config;\n    try {\n      config = YAML::LoadFile(c_cfgfile);\n    }\n    catch (YAML::ParserException &e) {\n      throw Exception(\"YAML::ParseException: %s\", e.what());\n    }\n    catch (std::exception &e) {\n      throw Exception(\"Unknown exception: %s\", e.what());\n    }\n    catch (...) {\n      throw Exception(\"Unknown exception\");\n    }\n\n    \/\/ The config file is loaded into config, now put it into local variables\n    try {\n      \/\/ GPIO\n      if ( config[\"gpio\"] && config[\"gpio\"].IsMap() ) {\n\tYAML::Node gpio = config[\"gpio\"];\n\t\/\/ load the device\n\tif ( gpio[\"device\"] ) c_device = gpio[\"device\"].as<std::string>();\n\n\t\/\/ the PIN configuration\n\tif ( gpio[\"pins\"] && gpio[\"pins\"].IsMap() ) {\n\t  YAML::Node pins = gpio[\"pins\"];\n\t  std::map<std::string, int> pinlayout(c_pinlayout);\n\t  for (const auto &it: g_pinconfig)\n\t    if ( pins[it.first] ) pinlayout[it.first] = pins[it.first].as<int>();\n\n\t  checkPinConfig(pinlayout);\n\t  c_pinlayout = pinlayout;\n\t} \/\/ PIN config\n      } \/\/ GPIO section\n\n      \/\/ SPI\n      if ( config[\"spi\"] && config[\"spi\"].IsMap() ) {\n\tYAML::Node spi = config[\"spi\"];\n\n\t\/\/ load the device\n\tif ( spi[\"device\"] ) c_spidev = spi[\"device\"].as<std::string>();\n\t\/\/ load the selector\n\tif ( spi[\"selector\"] ) {\n\t  std::string csname(spi[\"selector\"].as<std::string>());\n\t  auto it = g_spi_string_to_cs.find(csname);\n\t  if ( it == g_spi_string_to_cs.end() ) {\n\t    throw Exception(\"Unknown SPI chip selector: %s\\n\", csname.c_str());\n\t  }\n\t  c_spi_chipselector = it->second;\n\t}\n\t\/\/ MAX31856 config\n\tif ( spi[\"MAX31856\"] && spi[\"MAX31856\"].IsMap() ) {\n\t  auto max31856 = spi[\"MAX31856\"];\n\t  \/\/ TC type\n\t  if ( max31856[\"tctype\"] ) {\n\t    std::string tctype = max31856[\"tctype\"].as<std::string>();\n\t    auto it = g_string_to_tctype.find(tctype);\n\t    if ( it == g_string_to_tctype.end() ) {\n\t      throw Exception(\"Unknown TC type: %s\\n\", tctype.c_str());\n\t    }\n\t    c_spi_max31856_tctype = it->second;\n\t  }\/\/ TC type\n\t  \/\/ Noise Filter, AKA 50\/60Hz\n\t  if ( max31856[\"noisefilter\"] ) {\n\t    std::string nf = max31856[\"noisefilter\"].as<std::string>();\n\t    auto it = g_string_to_noisefilter.find(nf);\n\t    if ( it == g_string_to_noisefilter.end() ) {\n\t      throw Exception(\"Unknown Noise Filter mode: %s\\n\", nf.c_str());\n\t    }\n\t    c_spi_max31856_noisefilter = it->second;\n\t  }\/\/ Noise Filter\n\t} \/\/ MAX31856 config\n\t\/\/ DirectSelect Chip Selector\n\t\/\/ the PIN configuration\n\tif ( spi[\"DirectSelect\"] && spi[\"DirectSelect\"].IsMap() ) {\n\t  YAML::Node ds = spi[\"DirectSelect\"];\n\n\t  \/\/ we have 3 hardcoded sensors at this level, for now\n\t  for (int i=0; i<3; ++i) {\n\t    if ( !ds[i] ) continue;\n\t    std::string pin = ds[i].as<std::string>();\n\t    auto it = g_pinconfig.find(pin);\n\t    if ( it == g_pinconfig.end() )\n\t      throw Exception(\"Unknown pin: %s\", pin.c_str());\n\t    c_spi_dschips[i] = pin;\n\t  }\n\n\t  \/\/ Now we have to check for dups\n\t  std::set<std::string> tmp;\n\t  for ( auto &it: c_spi_dschips ) {\n\t    auto it2 = tmp.find(it.second);\n\t    if ( it2 != tmp.end() )\n\t      throw Exception(\"Duplicate pin for DirectSelect: %s\", it.second.c_str());\n\t    tmp.insert(it.second);\n\t  }\n\t} \/\/ PIN config\n\n\t\/\/ Thermocouples\n\tif ( spi[\"thermocouples\"] && spi[\"thermocouples\"].IsMap() ) {\n\t  YAML::Node tc = spi[\"thermocouples\"];\n\n\t  \/\/ We are going through only the valid ones, the rest are ignored\n\t  \/\/ also, not emptying the list, because that's how unset values default\n\t  for (auto &it: g_tcnames) {\n\t    if ( tc[it] ) {\n\t      int id = tc[it].as<int>();\n\t      if ( id < 0 || id > 3 )\n\t\tthrow Exception(\"Thermocouple id out of range: %i\", id);\n\t      c_thermocouples[it] = id;\n\t    }\n\t  }\n\t  \/\/ now verify whether any of them is on the same id\n\t  std::set<int> tmp;\n\t  for (auto &it: c_thermocouples) {\n\t    if ( tmp.find(it.second) != tmp.end() )\n\t      throw Exception(\"Duplicate thermocouple id: %i\", it.second);\n\t    tmp.insert(it.second);\n\t  }\n\t} \/\/ thermocouples\n\tif ( spi[\"thermointerval\"] && spi[\"thermointerval\"].IsScalar() ) {\n\t  YAML::Node ti = spi[\"thermointerval\"];\n\t  c_thermoival = ti.as<uint32_t>();\n\tif ( c_thermoival > 60 )\n\t  throw Exception(\"Thermocouple reading interval is too high: %lu\", c_thermoival);\n\t}\n      } \/\/ SPI section\n\n      \/\/ ZMQ PR socket\n      if ( config[\"prport\"] && config[\"prport\"].IsScalar() ) {\n\tYAML::Node prsock = config[\"prport\"];\n\tc_zmq_pr_port = prsock.as<uint16_t>();\n      }\n\n      \/\/ Heating Element's Power\n      if ( config[\"elementpower\"] && config[\"elementpower\"].IsScalar() ) {\n\tYAML::Node hep = config[\"elementpower\"];\n\tc_hepower = hep.as<uint32_t>();\n\tif ( c_hepower < 1000 || c_hepower > 10000 )\n\t  throw Exception(\"Heating element's power is out of range\");\n      }\n\n    }\n    catch (std::exception &e) {\n      throw Exception(\"Error during parsing config: %s\", e.what());\n    }\n  }\n\n  void Config::checkPinConfig(std::map<std::string, int> &_layout) {\n    std::map<int, int> count;\n\n    for ( const auto &it: _layout ) {\n      if ( count.find(it.second) == count.end() ) {\n\tcount[it.second] = 0;\n      } else {\n\tcount[it.second] += 1;\n      }\n    }\n\n    for ( const auto &it: count ) {\n      if ( it.second > 1 ) throw Exception(\"Conflict on Pin %i\\n\", it.first);\n    }\n  }\n\n  Config &Config::save() {\n    YAML::Emitter yout;\n\n    yout << YAML::BeginMap;\n    \/\/ GPIO config\n    yout << YAML::Key << \"gpio\";\n    yout << YAML::Value << YAML::BeginMap;\n    yout << YAML::Key << \"device\" << YAML::Value << c_device;\n    yout << YAML::Key << \"pins\" << YAML::Value << c_pinlayout;\n    yout << YAML::EndMap;\n\n    \/\/ SPI config\n    yout << YAML::Key << \"spi\";\n    yout << YAML::Value << YAML::BeginMap;\n    yout << YAML::Key << \"device\" << YAML::Value << c_spidev;\n    yout << YAML::Key << \"selector\" << YAML::Value << g_spi_cs_to_string[c_spi_chipselector];\n\n    \/\/ SPI \/ MAX31856 config\n    yout << YAML::Key << \"MAX31856\";\n    yout << YAML::Value <<\n      std::map<std::string, std::string>{\n      {\"tctype\", g_tctype_to_string[c_spi_max31856_tctype]},\n\t{\"noisefilter\", g_noisefilter_to_string[c_spi_max31856_noisefilter]}};\n    \/\/ end SPI \/ MAX31856\n\n    \/\/ SPI \/ DirectSelect\n    yout << YAML::Key << \"DirectSelect\";\n    yout << YAML::Value << c_spi_dschips;\n\n    \/\/ Thermocouple layout\n    yout << YAML::Key << \"thermocouples\";\n    yout << YAML::Value << c_thermocouples;\n\n    \/\/ thermocouple reading interval\n    yout << YAML::Key << \"thermointerval\";\n    yout << YAML::Value << c_thermoival;\n\n    yout << YAML::EndMap; \/\/ end of SPI\n\n    \/\/ ZMQ PR port\n    yout << YAML::Key << \"prport\" << YAML::Value << c_zmq_pr_port;\n\n    \/\/ Heating element's power in watts\n    yout << YAML::Key << \"elementpower\" << YAML::Value << c_hepower;\n\n    \/\/ End the config\n    yout << YAML::EndMap;\n\n    std::ofstream outfile;\n\n    outfile.open(c_cfgfile, std::ios::out | std::ios::trunc);\n    outfile << yout.c_str() << std::endl;\n    outfile.close();\n\n    return *this;\n  }\n\n  const std::string &Config::getGPIODevice() const {\n    return c_device;\n  }\n\n  Config &Config::getPinConfig(pinlayout_t &_layout) {\n    _layout = c_pinlayout;\n    return *this;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-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) 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 * $Id$\n * $Log$\n * Revision 1.3  2002\/11\/21 15:45:34  gareth\n * gcc 3.2 now issues a warning for use of iostream.h. Removed the .h and prefixed cout with std::.\n *\n * Revision 1.2  2002\/11\/04 15:00:21  tng\n * C++ Namespace Support.\n *\n * Revision 1.1  2002\/05\/28 22:40:46  peiyongz\n * DOM3 Save Interface: DOMWriter\/DOMWriterFilter\n *\n *\/\n\n#include <xercesc\/framework\/StdOutFormatTarget.hpp>\n#include <iostream>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nStdOutFormatTarget::StdOutFormatTarget()\n{}\n\nStdOutFormatTarget::~StdOutFormatTarget()\n{}\n\nvoid StdOutFormatTarget::writeChars(const XMLByte* const  toWrite\n                                  , const unsigned int    count\n                                  , XMLFormatter* const   formatter)\n{\n        \/\/ Surprisingly, Solaris was the only platform on which\n        \/\/ required the char* cast to print out the string correctly.\n        \/\/ Without the cast, it was printing the pointer value in hex.\n        \/\/ Quite annoying, considering every other platform printed\n        \/\/ the string with the explicit cast to char* below.\n\tstd::cout.write((char *) toWrite, (int) count);\n\n}\n\nXERCES_CPP_NAMESPACE_END\n\n<commit_msg>Got a number of compilation erros for those non-ANSI C++ compliant compiler like xlC v3. Since the previous fix is just for fixing a \"warning\", I think it doesn't worth to break users who are not ANSI C++ ready yet.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-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) 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 * $Id$\n * $Log$\n * Revision 1.4  2002\/11\/22 14:25:59  tng\n * Got a number of compilation erros for those non-ANSI C++ compliant compiler like xlC v3.\n * Since the previous fix is just for fixing a \"warning\", I think it doesn't worth to break users who\n * are not ANSI C++ ready yet.\n *\n * Revision 1.3  2002\/11\/21 15:45:34  gareth\n * gcc 3.2 now issues a warning for use of iostream.h. Removed the .h and prefixed cout with std::.\n *\n * Revision 1.2  2002\/11\/04 15:00:21  tng\n * C++ Namespace Support.\n *\n * Revision 1.1  2002\/05\/28 22:40:46  peiyongz\n * DOM3 Save Interface: DOMWriter\/DOMWriterFilter\n *\n *\/\n\n#include <xercesc\/framework\/StdOutFormatTarget.hpp>\n#include <iostream.h>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nStdOutFormatTarget::StdOutFormatTarget()\n{}\n\nStdOutFormatTarget::~StdOutFormatTarget()\n{}\n\nvoid StdOutFormatTarget::writeChars(const XMLByte* const  toWrite\n                                  , const unsigned int    count\n                                  , XMLFormatter* const   formatter)\n{\n        \/\/ Surprisingly, Solaris was the only platform on which\n        \/\/ required the char* cast to print out the string correctly.\n        \/\/ Without the cast, it was printing the pointer value in hex.\n        \/\/ Quite annoying, considering every other platform printed\n        \/\/ the string with the explicit cast to char* below.\n    cout.write((char *) toWrite, (int) count);\n\n}\n\nXERCES_CPP_NAMESPACE_END\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_OPENCL_KERNELS_MATRIX_MULTIPLY_HPP\n#define STAN_MATH_OPENCL_KERNELS_MATRIX_MULTIPLY_HPP\n#ifdef STAN_OPENCL\n\n#include <stan\/math\/opencl\/kernel_cl.hpp>\n\nnamespace stan {\nnamespace math {\nnamespace opencl_kernels {\n\/\/ \\cond\nstatic const char* matrix_multiply_kernel_code = STRINGIFY(\n    \/\/ \\endcond\n    \/**\n     * Matrix multiplication on the OpenCL device\n     *\n     * @param[in] A the left matrix in matrix multiplication\n     * @param[in] B the right matrix in matrix multiplication\n     * @param[out] C the output matrix\n     * @param[in] M Number of rows for matrix A\n     * @param[in] N Number of cols for matrix B\n     * @param[in] K Number of cols for matrix A and number of rows for matrix B\n     * @param[in] lower_upper_A the triangularity of A (lower, upper or none)\n     * @param[in] lower_upper_B the triangularity of B (lower, upper or none)\n     *\/\n    __kernel void matrix_multiply(\n        const __global double* A, const __global double* B, __global double* C,\n        const int M, const int N, const int K, unsigned int lower_upper_A,\n        unsigned int lower_upper_B) {\n      \/\/ thread index inside the thread_block\n      const int thread_block_row = get_local_id(0);\n      const int thread_block_col = get_local_id(1);\n      \/\/ global thread index\n      const int i = THREAD_BLOCK_SIZE * get_group_id(0) + thread_block_row;\n      const int j = THREAD_BLOCK_SIZE * get_group_id(1) + thread_block_col;\n\n      \/\/ local memory\n      __local double A_local[THREAD_BLOCK_SIZE][THREAD_BLOCK_SIZE];\n      __local double B_local[THREAD_BLOCK_SIZE][THREAD_BLOCK_SIZE];\n\n      double acc[WORK_PER_THREAD];\n      for (int w = 0; w < WORK_PER_THREAD; w++) {\n        acc[w] = 0.0;\n      }\n\n      const int num_tiles = (K + THREAD_BLOCK_SIZE - 1) \/ THREAD_BLOCK_SIZE;\n\n      \/\/ This kernel is based on the well known\n      \/\/ general matrix multiplication kernels that\n      \/\/ use tiling for shared memory\n      \/\/ In cases where a matrix is lower triangular\n      \/\/ its not necessary to multiply the elements\n      \/\/ over the diagonal, therefore those tiles\n      \/\/ in the matrix multiply can be skipped.\n      \/\/ With upper triangular matrices we dont need\n      \/\/ to multiply the elements under the diagonal,\n      \/\/ so those tiles can be skipped.\n      \/\/ The following code determines the start and\n      \/\/ end tile based on triangularity of the input matrices\n      \/\/ If no matrices are triangular the starting tile\n      \/\/ is 0 and the end tile is num_tiles-1 which\n      \/\/ is then a general matrix multiply\n      const int end_tile_A\n          = lower_upper_A == LOWER ? (i \/ THREAD_BLOCK_SIZE) : (num_tiles - 1);\n      const int end_tile_B\n          = lower_upper_B == UPPER ? (j \/ THREAD_BLOCK_SIZE) : (num_tiles - 1);\n      const int start_tile_A\n          = lower_upper_A == UPPER ? (i \/ THREAD_BLOCK_SIZE) : 0;\n      const int start_tile_B\n          = lower_upper_B == LOWER ? (j \/ THREAD_BLOCK_SIZE) : 0;\n      const int start_tile = max(start_tile_A, start_tile_B);\n      const int end_tile = min(end_tile_A, end_tile_B);  \/\/ NOLINT\n\n      for (int tile_idx = start_tile; tile_idx <= end_tile; tile_idx++) {\n        const int tiled_i = THREAD_BLOCK_SIZE * tile_idx + thread_block_row;\n        const int tiled_j = THREAD_BLOCK_SIZE * tile_idx + thread_block_col;\n        \/\/ each thread copies WORK_PER_THREAD values to the local\n        \/\/ memory\n        for (int w = 0; w < WORK_PER_THREAD; w++) {\n          \/\/ For the tiles on the diagonal we can ignore the values over\n          \/\/ the diagonal if the matrix is lower triangular or under\n          \/\/ the diagonal if the matrix is upper triangular\n          A_local[thread_block_col + w * THREAD_BLOCK_SIZE_COL]\n                 [thread_block_row]\n              = A[(tiled_j + w * THREAD_BLOCK_SIZE_COL) * M + i];\n          B_local[thread_block_col + w * THREAD_BLOCK_SIZE_COL]\n                 [thread_block_row]\n              = B[(j + w * THREAD_BLOCK_SIZE_COL) * K + tiled_i];\n        }\n        barrier(CLK_LOCAL_MEM_FENCE);\n        for (int block_idx = 0; block_idx < THREAD_BLOCK_SIZE; block_idx++) {\n          for (int w = 0; w < WORK_PER_THREAD; w++) {\n            acc[w] += A_local[block_idx][thread_block_row]\n                      * B_local[thread_block_col + w * THREAD_BLOCK_SIZE_COL]\n                               [block_idx];\n          }\n        }\n        barrier(CLK_LOCAL_MEM_FENCE);\n      }\n      \/\/ save the values\n      for (int w = 0; w < WORK_PER_THREAD; w++) {\n        \/\/ each thread saves WORK_PER_THREAD values\n        C[(j + w * THREAD_BLOCK_SIZE_COL) * M + i] = acc[w];\n      }\n    }\n    \/\/ \\cond\n);\n\/\/ \\endcond\n\n\/**\n * See the docs for \\link kernels\/matrix_multiply.hpp matrix_multiply() \\endlink\n *\/\nconst local_range_kernel<cl::Buffer, cl::Buffer, cl::Buffer, int, int, int,\n                         TriangularViewCL, TriangularViewCL>\n    matrix_multiply(\"matrix_multiply\", matrix_multiply_kernel_code,\n                    {{\"THREAD_BLOCK_SIZE\", 32}, {\"WORK_PER_THREAD\", 8}});\n\n\/\/ \\cond\nstatic const char* matrix_vector_multiply_kernel_code = STRINGIFY(\n    \/\/ \\endcond\n    \/**\n     * Matrix-vector multiplication R=A*B on the OpenCL device\n     *\n     * @param[in] A matrix in matrix-vector multiplication\n     * @param[in] B vector in matrix-vector multiplication\n     * @param[out] R the output vector\n     * @param[in] M Number of rows for matrix A\n     * @param[in] N Number of cols for matrix A and number of rows for vector B\n     *\/\n    __kernel void matrix_vector_multiply(\n        const __global double* A, const __global double* B, __global double* R,\n        const int M, const int N) {\n      const int gid = get_global_id(0);\n\n      double acc = 0;\n      for (int i = 0, j = 0; i < N; i++, j += M) {\n        acc += A[j + gid] * B[i];\n      }\n      R[gid] = acc;\n    }\n    \/\/ \\cond\n);\n\/\/ \\endcond\n\n\/**\n * See the docs for \\link kernels\/matrix_multiply.hpp matrix_vector_multiply()\n * \\endlink\n *\/\nconst global_range_kernel<cl::Buffer, cl::Buffer, cl::Buffer, int, int>\n    matrix_vector_multiply(\"matrix_vector_multiply\",\n                           matrix_vector_multiply_kernel_code);\n\n\/\/ \\cond\nstatic const char* row_vector_matrix_multiply_kernel_code = STRINGIFY(\n    \/\/ \\endcond\n    \/**\n     * Row vector-matrix multiplication R=A*B on the OpenCL device\n     *\n     * @param[in] A row vector in row vector-matrix multiplication\n     * @param[in] B matrix in row vector-matrix multiplication\n     * @param[out] R the output vector\n     * @param[in] N Number of cols for vector A and number of rows for matrix B\n     * @param[in] K Number of cols for matrix B\n     *\/\n    __kernel void row_vector_matrix_multiply(\n        const __global double* A, const __global double* B, __global double* R,\n        const int N, const int K) {\n      const int lid = get_local_id(0);\n      const int gid = get_global_id(0);\n      const int wgid = get_group_id(0);\n\n      double acc = 0;\n      for (int i = lid; i < N; i += 64) {\n        acc += A[i] * B[i + wgid * N];\n      }\n      __local double res_loc[64];\n      res_loc[lid] = acc;\n      barrier(CLK_LOCAL_MEM_FENCE);\n      if (lid < 16) {\n        res_loc[lid]\n            += res_loc[lid + 16] + res_loc[lid + 32] + res_loc[lid + 48];\n      }\n      barrier(CLK_LOCAL_MEM_FENCE);\n      if (lid < 4) {\n        res_loc[lid] += res_loc[lid + 4] + res_loc[lid + 8] + res_loc[lid + 12];\n      }\n      barrier(CLK_LOCAL_MEM_FENCE);\n      if (lid == 0) {\n        acc = res_loc[lid] + res_loc[lid + 1] + res_loc[lid + 2]\n              + res_loc[lid + 3];\n        R[wgid] = acc;\n      }\n    }\n    \/\/ \\cond\n);\n\/\/ \\endcond\n\n\/**\n * See the docs for \\link kernels\/matrix_multiply.hpp row_vector_matrix_multiply()\n * \\endlink\n *\/\nconst local_range_kernel<cl::Buffer, cl::Buffer, cl::Buffer, int, int>\n    row_vector_matrix_multiply(\"row_vector_matrix_multiply\",\n                           row_vector_matrix_multiply_kernel_code);\n\n}  \/\/ namespace opencl_kernels\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\n#endif\n<commit_msg>[Jenkins] auto-formatting by clang-format version 5.0.0-3~16.04.1 (tags\/RELEASE_500\/final)<commit_after>#ifndef STAN_MATH_OPENCL_KERNELS_MATRIX_MULTIPLY_HPP\n#define STAN_MATH_OPENCL_KERNELS_MATRIX_MULTIPLY_HPP\n#ifdef STAN_OPENCL\n\n#include <stan\/math\/opencl\/kernel_cl.hpp>\n\nnamespace stan {\nnamespace math {\nnamespace opencl_kernels {\n\/\/ \\cond\nstatic const char* matrix_multiply_kernel_code = STRINGIFY(\n    \/\/ \\endcond\n    \/**\n     * Matrix multiplication on the OpenCL device\n     *\n     * @param[in] A the left matrix in matrix multiplication\n     * @param[in] B the right matrix in matrix multiplication\n     * @param[out] C the output matrix\n     * @param[in] M Number of rows for matrix A\n     * @param[in] N Number of cols for matrix B\n     * @param[in] K Number of cols for matrix A and number of rows for matrix B\n     * @param[in] lower_upper_A the triangularity of A (lower, upper or none)\n     * @param[in] lower_upper_B the triangularity of B (lower, upper or none)\n     *\/\n    __kernel void matrix_multiply(\n        const __global double* A, const __global double* B, __global double* C,\n        const int M, const int N, const int K, unsigned int lower_upper_A,\n        unsigned int lower_upper_B) {\n      \/\/ thread index inside the thread_block\n      const int thread_block_row = get_local_id(0);\n      const int thread_block_col = get_local_id(1);\n      \/\/ global thread index\n      const int i = THREAD_BLOCK_SIZE * get_group_id(0) + thread_block_row;\n      const int j = THREAD_BLOCK_SIZE * get_group_id(1) + thread_block_col;\n\n      \/\/ local memory\n      __local double A_local[THREAD_BLOCK_SIZE][THREAD_BLOCK_SIZE];\n      __local double B_local[THREAD_BLOCK_SIZE][THREAD_BLOCK_SIZE];\n\n      double acc[WORK_PER_THREAD];\n      for (int w = 0; w < WORK_PER_THREAD; w++) {\n        acc[w] = 0.0;\n      }\n\n      const int num_tiles = (K + THREAD_BLOCK_SIZE - 1) \/ THREAD_BLOCK_SIZE;\n\n      \/\/ This kernel is based on the well known\n      \/\/ general matrix multiplication kernels that\n      \/\/ use tiling for shared memory\n      \/\/ In cases where a matrix is lower triangular\n      \/\/ its not necessary to multiply the elements\n      \/\/ over the diagonal, therefore those tiles\n      \/\/ in the matrix multiply can be skipped.\n      \/\/ With upper triangular matrices we dont need\n      \/\/ to multiply the elements under the diagonal,\n      \/\/ so those tiles can be skipped.\n      \/\/ The following code determines the start and\n      \/\/ end tile based on triangularity of the input matrices\n      \/\/ If no matrices are triangular the starting tile\n      \/\/ is 0 and the end tile is num_tiles-1 which\n      \/\/ is then a general matrix multiply\n      const int end_tile_A\n          = lower_upper_A == LOWER ? (i \/ THREAD_BLOCK_SIZE) : (num_tiles - 1);\n      const int end_tile_B\n          = lower_upper_B == UPPER ? (j \/ THREAD_BLOCK_SIZE) : (num_tiles - 1);\n      const int start_tile_A\n          = lower_upper_A == UPPER ? (i \/ THREAD_BLOCK_SIZE) : 0;\n      const int start_tile_B\n          = lower_upper_B == LOWER ? (j \/ THREAD_BLOCK_SIZE) : 0;\n      const int start_tile = max(start_tile_A, start_tile_B);\n      const int end_tile = min(end_tile_A, end_tile_B);  \/\/ NOLINT\n\n      for (int tile_idx = start_tile; tile_idx <= end_tile; tile_idx++) {\n        const int tiled_i = THREAD_BLOCK_SIZE * tile_idx + thread_block_row;\n        const int tiled_j = THREAD_BLOCK_SIZE * tile_idx + thread_block_col;\n        \/\/ each thread copies WORK_PER_THREAD values to the local\n        \/\/ memory\n        for (int w = 0; w < WORK_PER_THREAD; w++) {\n          \/\/ For the tiles on the diagonal we can ignore the values over\n          \/\/ the diagonal if the matrix is lower triangular or under\n          \/\/ the diagonal if the matrix is upper triangular\n          A_local[thread_block_col + w * THREAD_BLOCK_SIZE_COL]\n                 [thread_block_row]\n              = A[(tiled_j + w * THREAD_BLOCK_SIZE_COL) * M + i];\n          B_local[thread_block_col + w * THREAD_BLOCK_SIZE_COL]\n                 [thread_block_row]\n              = B[(j + w * THREAD_BLOCK_SIZE_COL) * K + tiled_i];\n        }\n        barrier(CLK_LOCAL_MEM_FENCE);\n        for (int block_idx = 0; block_idx < THREAD_BLOCK_SIZE; block_idx++) {\n          for (int w = 0; w < WORK_PER_THREAD; w++) {\n            acc[w] += A_local[block_idx][thread_block_row]\n                      * B_local[thread_block_col + w * THREAD_BLOCK_SIZE_COL]\n                               [block_idx];\n          }\n        }\n        barrier(CLK_LOCAL_MEM_FENCE);\n      }\n      \/\/ save the values\n      for (int w = 0; w < WORK_PER_THREAD; w++) {\n        \/\/ each thread saves WORK_PER_THREAD values\n        C[(j + w * THREAD_BLOCK_SIZE_COL) * M + i] = acc[w];\n      }\n    }\n    \/\/ \\cond\n);\n\/\/ \\endcond\n\n\/**\n * See the docs for \\link kernels\/matrix_multiply.hpp matrix_multiply() \\endlink\n *\/\nconst local_range_kernel<cl::Buffer, cl::Buffer, cl::Buffer, int, int, int,\n                         TriangularViewCL, TriangularViewCL>\n    matrix_multiply(\"matrix_multiply\", matrix_multiply_kernel_code,\n                    {{\"THREAD_BLOCK_SIZE\", 32}, {\"WORK_PER_THREAD\", 8}});\n\n\/\/ \\cond\nstatic const char* matrix_vector_multiply_kernel_code = STRINGIFY(\n    \/\/ \\endcond\n    \/**\n     * Matrix-vector multiplication R=A*B on the OpenCL device\n     *\n     * @param[in] A matrix in matrix-vector multiplication\n     * @param[in] B vector in matrix-vector multiplication\n     * @param[out] R the output vector\n     * @param[in] M Number of rows for matrix A\n     * @param[in] N Number of cols for matrix A and number of rows for vector B\n     *\/\n    __kernel void matrix_vector_multiply(\n        const __global double* A, const __global double* B, __global double* R,\n        const int M, const int N) {\n      const int gid = get_global_id(0);\n\n      double acc = 0;\n      for (int i = 0, j = 0; i < N; i++, j += M) {\n        acc += A[j + gid] * B[i];\n      }\n      R[gid] = acc;\n    }\n    \/\/ \\cond\n);\n\/\/ \\endcond\n\n\/**\n * See the docs for \\link kernels\/matrix_multiply.hpp matrix_vector_multiply()\n * \\endlink\n *\/\nconst global_range_kernel<cl::Buffer, cl::Buffer, cl::Buffer, int, int>\n    matrix_vector_multiply(\"matrix_vector_multiply\",\n                           matrix_vector_multiply_kernel_code);\n\n\/\/ \\cond\nstatic const char* row_vector_matrix_multiply_kernel_code = STRINGIFY(\n    \/\/ \\endcond\n    \/**\n     * Row vector-matrix multiplication R=A*B on the OpenCL device\n     *\n     * @param[in] A row vector in row vector-matrix multiplication\n     * @param[in] B matrix in row vector-matrix multiplication\n     * @param[out] R the output vector\n     * @param[in] N Number of cols for vector A and number of rows for matrix B\n     * @param[in] K Number of cols for matrix B\n     *\/\n    __kernel void row_vector_matrix_multiply(\n        const __global double* A, const __global double* B, __global double* R,\n        const int N, const int K) {\n      const int lid = get_local_id(0);\n      const int gid = get_global_id(0);\n      const int wgid = get_group_id(0);\n\n      double acc = 0;\n      for (int i = lid; i < N; i += 64) {\n        acc += A[i] * B[i + wgid * N];\n      }\n      __local double res_loc[64];\n      res_loc[lid] = acc;\n      barrier(CLK_LOCAL_MEM_FENCE);\n      if (lid < 16) {\n        res_loc[lid]\n            += res_loc[lid + 16] + res_loc[lid + 32] + res_loc[lid + 48];\n      }\n      barrier(CLK_LOCAL_MEM_FENCE);\n      if (lid < 4) {\n        res_loc[lid] += res_loc[lid + 4] + res_loc[lid + 8] + res_loc[lid + 12];\n      }\n      barrier(CLK_LOCAL_MEM_FENCE);\n      if (lid == 0) {\n        acc = res_loc[lid] + res_loc[lid + 1] + res_loc[lid + 2]\n              + res_loc[lid + 3];\n        R[wgid] = acc;\n      }\n    }\n    \/\/ \\cond\n);\n\/\/ \\endcond\n\n\/**\n * See the docs for \\link kernels\/matrix_multiply.hpp\n * row_vector_matrix_multiply() \\endlink\n *\/\nconst local_range_kernel<cl::Buffer, cl::Buffer, cl::Buffer, int, int>\n    row_vector_matrix_multiply(\"row_vector_matrix_multiply\",\n                               row_vector_matrix_multiply_kernel_code);\n\n}  \/\/ namespace opencl_kernels\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\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 \"Player.h\"\n\n#include \"..\/base\/TestSuite.h\"\n#include \"..\/base\/Exception.h\"\n#include \"..\/base\/Logger.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string>\n\nusing namespace avg;\nusing namespace std;\n\nclass PlayerTest: public Test {\npublic:\n    PlayerTest()\n        : Test(\"PlayerTest\", 2)\n    {\n    }\n\n    void runTests() \n    {\n        Player player;\n        char * pszDir = getenv(\"srcdir\");\n        string sFName = string(pszDir)+ \"\/..\/test\/empty.avg\";\n        player.loadFile(sFName);\n    }\n};\n\nclass PlayerTestSuite: public TestSuite {\npublic:\n    PlayerTestSuite() \n        : TestSuite(\"PlayerTestSuite\")\n    {\n        addTest(TestPtr(new PlayerTest));\n    }\n};\n\n\nint main(int nargs, char** args)\n{\n    PlayerTestSuite Suite;\n    Suite.runTests();\n    bool bOK = Suite.isOk();\n\n    if (bOK) {\n        return 0;\n    } else {\n        return 1;\n    }\n}\n\n<commit_msg>Fixed testplayer if $srcdir is undefined.<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 \"Player.h\"\n\n#include \"..\/base\/TestSuite.h\"\n#include \"..\/base\/Exception.h\"\n#include \"..\/base\/Logger.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string>\n\nusing namespace avg;\nusing namespace std;\n\nclass PlayerTest: public Test {\npublic:\n    PlayerTest()\n        : Test(\"PlayerTest\", 2)\n    {\n    }\n\n    void runTests() \n    {\n        Player player;\n        char * pszDir = getenv(\"srcdir\");\n        string sFName;\n        if (pszDir) {\n            sFName = string(pszDir)+ \"\/..\/test\/empty.avg\";\n        } else {\n            sFName = \"..\/test\/empty.avg\";\n        }\n        player.loadFile(sFName);\n    }\n};\n\nclass PlayerTestSuite: public TestSuite {\npublic:\n    PlayerTestSuite() \n        : TestSuite(\"PlayerTestSuite\")\n    {\n        addTest(TestPtr(new PlayerTest));\n    }\n};\n\n\nint main(int nargs, char** args)\n{\n    PlayerTestSuite Suite;\n    Suite.runTests();\n    bool bOK = Suite.isOk();\n\n    if (bOK) {\n        return 0;\n    } else {\n        return 1;\n    }\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 *\/\n\n#ifndef PCL_SURFACE_IMPL_POISSON_H_\n#define PCL_SURFACE_IMPL_POISSON_H_\n\n#include \"pcl\/surface\/poisson.h\"\n#include <pcl\/common\/common.h>\n#include <pcl\/common\/vector_average.h>\n#include <pcl\/Vertices.h>\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <float.h>\n#include \"pcl\/surface\/poisson\/octree.h\"\n#include \"pcl\/surface\/poisson\/sparse_matrix.h\"\n#include \"pcl\/surface\/poisson\/function_data.h\"\n#include \"pcl\/surface\/poisson\/ppolynomial.h\"\n#include \"pcl\/surface\/poisson\/multi_grid_octree_data.h\"\n\n#define MEMORY_ALLOCATOR_BLOCK_SIZE 1<<12\n\n#include <stdarg.h>\n#include <string>\n\nusing namespace pcl::surface::poisson;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT>\npcl::surface::Poisson<PointNT>::Poisson ()\n  : no_reset_samples_(false),\n    no_clip_tree_(false),\n    confidence_(false),\n    manifold_(false),\n    depth_(10),\n    solver_divide_(8),\n    iso_divide_(8),\n    refine_(3),\n    kernel_depth_(8),\n    degree_ (2),\n    samples_per_node_(1.0),\n    scale_(1.25)\n{\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT>\npcl::surface::Poisson<PointNT>::~Poisson ()\n{\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT> template <int Degree> void\npcl::surface::Poisson<PointNT>::execute (CoredMeshData &mesh,\n                                         Point3D<float> &center)\n{\n  float scale = 1;\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/ Fix courtesy of David Gallup \/\/\n  \/\/ TreeNodeData::UseIndex = 1;  \/\/\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  Octree<Degree> tree;\n  PPolynomial<Degree> ReconstructionFunction=PPolynomial<Degree>::GaussianApproximation();\n\n  center.coords[0]=center.coords[1]=center.coords[2]=0;\n\n  TreeOctNode::SetAllocator(MEMORY_ALLOCATOR_BLOCK_SIZE);\n\n  int kernel_depth=depth_-2;\n  if(kernel_depth_){kernel_depth=kernel_depth_;}\n\n  tree.setFunctionData(ReconstructionFunction,depth_,0,float(1.0)\/(1<<depth_));\n  if (kernel_depth > depth_)\n  {\n    PCL_ERROR (\"KernelDepth can't be greater than Depth: %d <= %d\\n\",kernel_depth,depth_);\n    return;\n  }\n\n\n  tree.setTree (depth_, kernel_depth, float(samples_per_node_), scale_, center, scale, !no_reset_samples_, confidence_, input_);\n\n  if(!no_clip_tree_)\n    tree.ClipTree();\n\n  tree.finalize1(refine_);\n\n\n  tree.SetLaplacianWeights();\n\n  tree.finalize2(refine_);\n\n  tree.LaplacianMatrixIteration(solver_divide_);\n\n  float isoValue=tree.GetIsoValue();\n\n  if (iso_divide_)\n    tree.GetMCIsoTriangles (isoValue, iso_divide_, &mesh, 0, 1, manifold_);\n  else\n    tree.GetMCIsoTriangles (isoValue, &mesh, 0, 1, manifold_);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT> void\npcl::surface::Poisson<PointNT>::performReconstruction (PolygonMesh &output)\n{\n  CoredVectorMeshData mesh;\n  Point3D<float> center;\n\n  switch(degree_)\n  {\n    case 1:\n      execute<1> (mesh, center);\n      break;\n    case 2:\n      execute<2> (mesh, center);\n      break;\n    case 3:\n      execute<3> (mesh, center);\n      break;\n    case 4:\n      execute<4> (mesh, center);\n      break;\n    case 5:\n      execute<5> (mesh, center);\n      break;\n    default:\n      PCL_ERROR (stderr,\"Degree %d not supported\\n\", degree_);\n  }\n\n  \/\/\/ Write output PolygonMesh\n  float scale = 1;\n   \/\/ write vertices\n   pcl::PointCloud < pcl::PointXYZ > cloud;\n   cloud.points.resize (int (mesh.outOfCorePointCount()+mesh.inCorePoints.size ()) );\n   Point3D<float> p;\n   for (int i = 0; i < int(mesh.inCorePoints.size()); i++)\n   {\n     p = mesh.inCorePoints[i];\n     cloud.points[i].x = p.coords[0]*scale+center.coords[0];\n     cloud.points[i].y = p.coords[1]*scale+center.coords[1];\n     cloud.points[i].z = p.coords[2]*scale+center.coords[2];\n   }\n   for (int i = int(mesh.inCorePoints.size()); i < int (mesh.outOfCorePointCount() + mesh.inCorePoints.size ()); i++)\n   {\n     mesh.nextOutOfCorePoint(p);\n     cloud.points[i].x = p.coords[0]*scale+center.coords[0];\n     cloud.points[i].y = p.coords[1]*scale+center.coords[1];\n     cloud.points[i].z = p.coords[2]*scale+center.coords[2];\n   }\n   pcl::toROSMsg (cloud, output.cloud);\n   output.polygons.resize (mesh.triangleCount ());\n\n   \/\/ write faces\n   TriangleIndex tIndex;\n   int inCoreFlag;\n   for (int i = 0; i < mesh.triangleCount(); i++)\n   {\n     \/\/ create and fill a struct that the ply code can handle\n     pcl::Vertices v;\n     v.vertices.resize (3);\n\n     mesh.nextTriangle(tIndex,inCoreFlag);\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[0])) { tIndex.idx[0] += int(mesh.inCorePoints.size()); }\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[1])) { tIndex.idx[1] += int(mesh.inCorePoints.size()); }\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[2])) { tIndex.idx[2] += int(mesh.inCorePoints.size()); }\n     for (int j = 0; j < 3; j++) {v.vertices[j] = tIndex.idx[j];}\n     output.polygons[i] = v;\n   }  \/\/ for, write faces\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT> void\npcl::surface::Poisson<PointNT>::performReconstruction (pcl::PointCloud<PointNT> &points,\n                                                       std::vector<pcl::Vertices> &polygons)\n{\n  CoredVectorMeshData mesh;\n  Point3D<float> center;\n\n  switch(degree_)\n  {\n    case 1:\n      execute<1> (mesh, center);\n      break;\n    case 2:\n      execute<2> (mesh, center);\n      break;\n    case 3:\n      execute<3> (mesh, center);\n      break;\n    case 4:\n      execute<4> (mesh, center);\n      break;\n    case 5:\n      execute<5> (mesh, center);\n      break;\n    default:\n      PCL_ERROR (stderr,\"Degree %d not supported\\n\", degree_);\n  }\n\n  \/\/\/ Write output PolygonMesh\n  float scale = 1;\n   \/\/ write vertices\n   points.points.resize (int (mesh.outOfCorePointCount()+mesh.inCorePoints.size ()) );\n   Point3D<float> p;\n   for (int i = 0; i < int(mesh.inCorePoints.size()); i++)\n   {\n     p = mesh.inCorePoints[i];\n     points.points[i].x = p.coords[0]*scale+center.coords[0];\n     points.points[i].y = p.coords[1]*scale+center.coords[1];\n     points.points[i].z = p.coords[2]*scale+center.coords[2];\n   }\n   for (int i = int(mesh.inCorePoints.size()); i < int (mesh.outOfCorePointCount() + mesh.inCorePoints.size ()); i++)\n   {\n     mesh.nextOutOfCorePoint(p);\n     points.points[i].x = p.coords[0]*scale+center.coords[0];\n     points.points[i].y = p.coords[1]*scale+center.coords[1];\n     points.points[i].z = p.coords[2]*scale+center.coords[2];\n   }\n\n   polygons.resize (mesh.triangleCount ());\n\n   \/\/ write faces\n   TriangleIndex tIndex;\n   int inCoreFlag;\n   for (int i = 0; i < mesh.triangleCount(); i++)\n   {\n     \/\/ create and fill a struct that the ply code can handle\n     pcl::Vertices v;\n     v.vertices.resize (3);\n\n     mesh.nextTriangle(tIndex,inCoreFlag);\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[0])) { tIndex.idx[0] += int(mesh.inCorePoints.size()); }\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[1])) { tIndex.idx[1] += int(mesh.inCorePoints.size()); }\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[2])) { tIndex.idx[2] += int(mesh.inCorePoints.size()); }\n     for (int j = 0; j < 3; j++) {v.vertices[j] = tIndex.idx[j];}\n     polygons[i] = v;\n   }  \/\/ for, write faces\n\n}\n\n\n#define PCL_INSTANTIATE_Poisson(T) template class PCL_EXPORTS pcl::surface::Poisson<T>;\n\n#endif    \/\/ PCL_SURFACE_IMPL_POISSON_H_\n\n<commit_msg>poisson beautification<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 *\/\n\n#ifndef PCL_SURFACE_IMPL_POISSON_H_\n#define PCL_SURFACE_IMPL_POISSON_H_\n\n#include \"pcl\/surface\/poisson.h\"\n#include <pcl\/common\/common.h>\n#include <pcl\/common\/vector_average.h>\n#include <pcl\/Vertices.h>\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <float.h>\n#include \"pcl\/surface\/poisson\/octree.h\"\n#include \"pcl\/surface\/poisson\/sparse_matrix.h\"\n#include \"pcl\/surface\/poisson\/function_data.h\"\n#include \"pcl\/surface\/poisson\/ppolynomial.h\"\n#include \"pcl\/surface\/poisson\/multi_grid_octree_data.h\"\n\n#define MEMORY_ALLOCATOR_BLOCK_SIZE 1<<12\n\n#include <stdarg.h>\n#include <string>\n\nusing namespace pcl::surface::poisson;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT>\npcl::surface::Poisson<PointNT>::Poisson ()\n  : no_reset_samples_ (false),\n    no_clip_tree_ (false),\n    confidence_ (false),\n    manifold_ (false),\n    depth_ (10),\n    solver_divide_ (8),\n    iso_divide_ (8),\n    refine_ (3),\n    kernel_depth_ (8),\n    degree_ (2),\n    samples_per_node_ (1.0),\n    scale_ (1.25)\n{\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT>\npcl::surface::Poisson<PointNT>::~Poisson ()\n{\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT> template <int Degree> void\npcl::surface::Poisson<PointNT>::execute (CoredMeshData &mesh,\n                                         Point3D<float> &center)\n{\n  float scale = 1;\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  \/\/ Fix courtesy of David Gallup \/\/\n  \/\/ TreeNodeData::UseIndex = 1;  \/\/\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  Octree<Degree> tree;\n  PPolynomial<Degree> ReconstructionFunction = PPolynomial<Degree>::GaussianApproximation ();\n\n  center.coords[0] = center.coords[1] = center.coords[2] = 0;\n\n  TreeOctNode::SetAllocator(MEMORY_ALLOCATOR_BLOCK_SIZE);\n\n  int kernel_depth=depth_-2;\n  if (kernel_depth_)\n    kernel_depth=kernel_depth_;\n\n  tree.setFunctionData (ReconstructionFunction,depth_, 0, float (1.0) \/ (1<<depth_));\n  if (kernel_depth > depth_)\n  {\n    PCL_ERROR (\"KernelDepth can't be greater than Depth: %d <= %d\\n\", kernel_depth, depth_);\n    return;\n  }\n\n\n  tree.setTree (depth_, kernel_depth, float (samples_per_node_), scale_, center, scale, !no_reset_samples_, confidence_, input_);\n\n  if(!no_clip_tree_)\n    tree.ClipTree ();\n\n  tree.finalize1 (refine_);\n  tree.SetLaplacianWeights ();\n  tree.finalize2 (refine_);\n\n  tree.LaplacianMatrixIteration (solver_divide_);\n\n  float isoValue=tree.GetIsoValue ();\n\n  if (iso_divide_)\n    tree.GetMCIsoTriangles (isoValue, iso_divide_, &mesh, 0, 1, manifold_);\n  else\n    tree.GetMCIsoTriangles (isoValue, &mesh, 0, 1, manifold_);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT> void\npcl::surface::Poisson<PointNT>::performReconstruction (PolygonMesh &output)\n{\n  CoredVectorMeshData mesh;\n  Point3D<float> center;\n\n  printf (\"Before execution\\n\");\n  switch (degree_)\n  {\n    case 1:\n      execute<1> (mesh, center);\n      break;\n    case 2:\n      execute<2> (mesh, center);\n      break;\n    case 3:\n      execute<3> (mesh, center);\n      break;\n    case 4:\n      execute<4> (mesh, center);\n      break;\n    case 5:\n      execute<5> (mesh, center);\n      break;\n    default:\n      PCL_ERROR (stderr,\"Degree %d not supported\\n\", degree_);\n  }\n\n  printf (\"Done execution \\n\");\n\n  \/\/\/ Write output PolygonMesh\n  float scale = 1;\n   \/\/ write vertices\n   pcl::PointCloud < pcl::PointXYZ > cloud;\n   cloud.points.resize (int (mesh.outOfCorePointCount()+mesh.inCorePoints.size ()));\n   Point3D<float> p;\n   for (int i = 0; i < int (mesh.inCorePoints.size()); i++)\n   {\n     p = mesh.inCorePoints[i];\n     cloud.points[i].x = p.coords[0]*scale+center.coords[0];\n     cloud.points[i].y = p.coords[1]*scale+center.coords[1];\n     cloud.points[i].z = p.coords[2]*scale+center.coords[2];\n   }\n   for (int i = int (mesh.inCorePoints.size ()); i < int (mesh.outOfCorePointCount () + mesh.inCorePoints.size ()); i++)\n   {\n     mesh.nextOutOfCorePoint (p);\n     cloud.points[i].x = p.coords[0]*scale+center.coords[0];\n     cloud.points[i].y = p.coords[1]*scale+center.coords[1];\n     cloud.points[i].z = p.coords[2]*scale+center.coords[2];\n   }\n   pcl::toROSMsg (cloud, output.cloud);\n   output.polygons.resize (mesh.triangleCount ());\n\n   \/\/ Write faces\n   TriangleIndex tIndex;\n   int inCoreFlag;\n   for (int i = 0; i < mesh.triangleCount(); i++)\n   {\n     \/\/ Create and fill a struct that the ply code can handle\n     pcl::Vertices v;\n     v.vertices.resize (3);\n\n     mesh.nextTriangle(tIndex,inCoreFlag);\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[0]))\n       tIndex.idx[0] += int(mesh.inCorePoints.size());\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[1]))\n       tIndex.idx[1] += int(mesh.inCorePoints.size());\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[2]))\n       tIndex.idx[2] += int(mesh.inCorePoints.size());\n\n     for (int j = 0; j < 3; j++)\n       v.vertices[j] = tIndex.idx[j];\n     output.polygons[i] = v;\n   }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointNT> void\npcl::surface::Poisson<PointNT>::performReconstruction (pcl::PointCloud<PointNT> &points,\n                                                       std::vector<pcl::Vertices> &polygons)\n{\n  CoredVectorMeshData mesh;\n  Point3D<float> center;\n\n  switch(degree_)\n  {\n    case 1:\n      execute<1> (mesh, center);\n      break;\n    case 2:\n      execute<2> (mesh, center);\n      break;\n    case 3:\n      execute<3> (mesh, center);\n      break;\n    case 4:\n      execute<4> (mesh, center);\n      break;\n    case 5:\n      execute<5> (mesh, center);\n      break;\n    default:\n      PCL_ERROR (stderr,\"Degree %d not supported\\n\", degree_);\n  }\n\n  \/\/\/ Write output PolygonMesh\n  float scale = 1;\n   \/\/ write vertices\n   points.points.resize (int (mesh.outOfCorePointCount ()+mesh.inCorePoints.size ()));\n   Point3D<float> p;\n   for (int i = 0; i < int(mesh.inCorePoints.size()); i++)\n   {\n     p = mesh.inCorePoints[i];\n     points.points[i].x = p.coords[0]*scale+center.coords[0];\n     points.points[i].y = p.coords[1]*scale+center.coords[1];\n     points.points[i].z = p.coords[2]*scale+center.coords[2];\n   }\n   for (int i = int(mesh.inCorePoints.size()); i < int (mesh.outOfCorePointCount() + mesh.inCorePoints.size ()); i++)\n   {\n     mesh.nextOutOfCorePoint(p);\n     points.points[i].x = p.coords[0]*scale+center.coords[0];\n     points.points[i].y = p.coords[1]*scale+center.coords[1];\n     points.points[i].z = p.coords[2]*scale+center.coords[2];\n   }\n\n   polygons.resize (mesh.triangleCount ());\n\n   \/\/ write faces\n   TriangleIndex tIndex;\n   int inCoreFlag;\n   for (int i = 0; i < mesh.triangleCount (); i++)\n   {\n     \/\/ create and fill a struct that the ply code can handle\n     pcl::Vertices v;\n     v.vertices.resize (3);\n\n     mesh.nextTriangle(tIndex,inCoreFlag);\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[0]))\n       tIndex.idx[0] += int(mesh.inCorePoints.size());\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[1]))\n       tIndex.idx[1] += int(mesh.inCorePoints.size());\n     if (!(inCoreFlag & CoredMeshData::IN_CORE_FLAG[2]))\n       tIndex.idx[2] += int(mesh.inCorePoints.size());\n     for (int j = 0; j < 3; j++)\n       v.vertices[j] = tIndex.idx[j];\n     polygons[i] = v;\n   }\n}\n\n\n#define PCL_INSTANTIATE_Poisson(T) template class PCL_EXPORTS pcl::surface::Poisson<T>;\n\n#endif    \/\/ PCL_SURFACE_IMPL_POISSON_H_\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ChildrenManager.cxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 16:40:39 $\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_svx.hxx\"\n\n#ifndef _SVX_ACCESSIBILITY_CHILDREN_MANAGER_HXX\n#include <svx\/ChildrenManager.hxx>\n#endif\n#ifndef _SVX_ACCESSIBILITY_CHILDREN_MANAGER_IMPL_HXX\n#include \"ChildrenManagerImpl.hxx\"\n#endif\n#ifndef _SVX_ACCESSIBILITY_ACCESSIBLE_SHAPE_HXX\n#include <svx\/AccessibleShape.hxx>\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::accessibility;\nusing ::com::sun::star::uno::Reference;\n\nnamespace accessibility {\n\n\n\/\/=====  AccessibleChildrenManager  ===========================================\n\nChildrenManager::ChildrenManager (\n    const Reference<XAccessible>& rxParent,\n    const Reference<drawing::XShapes>& rxShapeList,\n    const AccessibleShapeTreeInfo& rShapeTreeInfo,\n    AccessibleContextBase& rContext)\n    : mpImpl (NULL)\n{\n    mpImpl = new ChildrenManagerImpl (rxParent, rxShapeList, rShapeTreeInfo, rContext);\n    if (mpImpl != NULL)\n        mpImpl->Init ();\n    else\n        throw uno::RuntimeException(\n            ::rtl::OUString::createFromAscii(\n                \"ChildrenManager::ChildrenManager can't create implementation object\"), NULL);\n}\n\n\n\n\nChildrenManager::~ChildrenManager (void)\n{\n    if (mpImpl != NULL)\n        mpImpl->dispose();\n\n    \/\/ emtpy\n    OSL_TRACE (\"~ChildrenManager\");\n}\n\n\n\n\nlong ChildrenManager::GetChildCount (void) const throw ()\n{\n    OSL_ASSERT (mpImpl != NULL);\n    return mpImpl->GetChildCount();\n}\n\n\n\n\nReference<XAccessible> ChildrenManager::GetChild (long nIndex)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    return mpImpl->GetChild (nIndex);\n}\n\n\n\n\nvoid ChildrenManager::Update (bool bCreateNewObjectsOnDemand)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->Update (bCreateNewObjectsOnDemand);\n}\n\n\n\n\nvoid ChildrenManager::SetShapeList (const ::com::sun::star::uno::Reference<\n    ::com::sun::star::drawing::XShapes>& xShapeList)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->SetShapeList (xShapeList);\n}\n\n\n\n\nvoid ChildrenManager::AddAccessibleShape (std::auto_ptr<AccessibleShape> pShape)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->AddAccessibleShape (pShape);\n}\n\n\n\n\nvoid ChildrenManager::ClearAccessibleShapeList (void)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->ClearAccessibleShapeList ();\n}\n\n\n\n\nvoid ChildrenManager::SetInfo (AccessibleShapeTreeInfo& rShapeTreeInfo)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->SetInfo (rShapeTreeInfo);\n}\n\n\n\n\nvoid ChildrenManager::UpdateSelection (void)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->UpdateSelection ();\n}\n\n\n\n\nbool ChildrenManager::HasFocus (void)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    return mpImpl->HasFocus ();\n}\n\n\n\n\nvoid ChildrenManager::RemoveFocus (void)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->RemoveFocus ();\n}\n\n\n\n\n\/\/=====  IAccessibleViewForwarderListener  ====================================\nvoid ChildrenManager::ViewForwarderChanged (ChangeType aChangeType,\n        const IAccessibleViewForwarder* pViewForwarder)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->ViewForwarderChanged (aChangeType, pViewForwarder);\n}\n\n\n\n} \/\/ end of namespace accessibility\n<commit_msg>INTEGRATION: CWS atkbridge8_SRC680 (1.15.148); FILE MERGED 2007\/10\/12 11:38:50 obr 1.15.148.1: #b6581554# fixed incorrect exception specification for GetChild<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ChildrenManager.cxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-01 13:01: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_svx.hxx\"\n\n#ifndef _SVX_ACCESSIBILITY_CHILDREN_MANAGER_HXX\n#include <svx\/ChildrenManager.hxx>\n#endif\n#ifndef _SVX_ACCESSIBILITY_CHILDREN_MANAGER_IMPL_HXX\n#include \"ChildrenManagerImpl.hxx\"\n#endif\n#ifndef _SVX_ACCESSIBILITY_ACCESSIBLE_SHAPE_HXX\n#include <svx\/AccessibleShape.hxx>\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::accessibility;\nusing ::com::sun::star::uno::Reference;\n\nnamespace accessibility {\n\n\n\/\/=====  AccessibleChildrenManager  ===========================================\n\nChildrenManager::ChildrenManager (\n    const Reference<XAccessible>& rxParent,\n    const Reference<drawing::XShapes>& rxShapeList,\n    const AccessibleShapeTreeInfo& rShapeTreeInfo,\n    AccessibleContextBase& rContext)\n    : mpImpl (NULL)\n{\n    mpImpl = new ChildrenManagerImpl (rxParent, rxShapeList, rShapeTreeInfo, rContext);\n    if (mpImpl != NULL)\n        mpImpl->Init ();\n    else\n        throw uno::RuntimeException(\n            ::rtl::OUString::createFromAscii(\n                \"ChildrenManager::ChildrenManager can't create implementation object\"), NULL);\n}\n\n\n\n\nChildrenManager::~ChildrenManager (void)\n{\n    if (mpImpl != NULL)\n        mpImpl->dispose();\n\n    \/\/ emtpy\n    OSL_TRACE (\"~ChildrenManager\");\n}\n\n\n\n\nlong ChildrenManager::GetChildCount (void) const throw ()\n{\n    OSL_ASSERT (mpImpl != NULL);\n    return mpImpl->GetChildCount();\n}\n\n\n\n\nReference<XAccessible> ChildrenManager::GetChild (long nIndex)\n    throw (::com::sun::star::uno::RuntimeException,\n           ::com::sun::star::lang::IndexOutOfBoundsException)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    return mpImpl->GetChild (nIndex);\n}\n\n\n\n\nvoid ChildrenManager::Update (bool bCreateNewObjectsOnDemand)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->Update (bCreateNewObjectsOnDemand);\n}\n\n\n\n\nvoid ChildrenManager::SetShapeList (const ::com::sun::star::uno::Reference<\n    ::com::sun::star::drawing::XShapes>& xShapeList)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->SetShapeList (xShapeList);\n}\n\n\n\n\nvoid ChildrenManager::AddAccessibleShape (std::auto_ptr<AccessibleShape> pShape)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->AddAccessibleShape (pShape);\n}\n\n\n\n\nvoid ChildrenManager::ClearAccessibleShapeList (void)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->ClearAccessibleShapeList ();\n}\n\n\n\n\nvoid ChildrenManager::SetInfo (AccessibleShapeTreeInfo& rShapeTreeInfo)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->SetInfo (rShapeTreeInfo);\n}\n\n\n\n\nvoid ChildrenManager::UpdateSelection (void)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->UpdateSelection ();\n}\n\n\n\n\nbool ChildrenManager::HasFocus (void)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    return mpImpl->HasFocus ();\n}\n\n\n\n\nvoid ChildrenManager::RemoveFocus (void)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->RemoveFocus ();\n}\n\n\n\n\n\/\/=====  IAccessibleViewForwarderListener  ====================================\nvoid ChildrenManager::ViewForwarderChanged (ChangeType aChangeType,\n        const IAccessibleViewForwarder* pViewForwarder)\n{\n    OSL_ASSERT (mpImpl != NULL);\n    mpImpl->ViewForwarderChanged (aChangeType, pViewForwarder);\n}\n\n\n\n} \/\/ end of namespace accessibility\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    __ _____ _____ _____\n __|  |   __|     |   | |  JSON for Modern C++ (test suite)\n|  |  |__   |  |  | | | |  version 3.7.3\n|_____|_____|_____|_|___|  https:\/\/github.com\/nlohmann\/json\n\nLicensed under the MIT License <http:\/\/opensource.org\/licenses\/MIT>.\nSPDX-License-Identifier: MIT\nCopyright (c) 2013-2019 Niels Lohmann <http:\/\/nlohmann.me>.\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 \"doctest_compatibility.h\"\n\n#include <nlohmann\/json.hpp>\nusing nlohmann::json;\n\nnamespace\n{\n\/\/ helper function to check std::less<json::value_t>\n\/\/ see https:\/\/en.cppreference.com\/w\/cpp\/utility\/functional\/less\ntemplate <typename A, typename B, typename U = std::less<json::value_t>>\nbool f(A a, B b, U u = U())\n{\n    return u(a, b);\n}\n}\n\nTEST_CASE(\"lexicographical comparison operators\")\n{\n    SECTION(\"types\")\n    {\n        std::vector<json::value_t> j_types =\n        {\n            json::value_t::null,\n            json::value_t::boolean,\n            json::value_t::number_integer,\n            json::value_t::number_unsigned,\n            json::value_t::number_float,\n            json::value_t::object,\n            json::value_t::array,\n            json::value_t::string,\n            json::value_t::binary\n        };\n\n        SECTION(\"comparison: less\")\n        {\n            std::vector<std::vector<bool>> expected =\n            {\n                {false, true, true, true, true, true, true, true, true},\n                {false, false, true, true, true, true, true, true, true},\n                {false, false, false, false, false, true, true, true, true},\n                {false, false, false, false, false, true, true, true, true},\n                {false, false, false, false, false, true, true, true, true},\n                {false, false, false, false, false, false, true, true, true},\n                {false, false, false, false, false, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true},\n                {false, false, false, false, false, false, false, false, false}\n            };\n\n            for (size_t i = 0; i < j_types.size(); ++i)\n            {\n                for (size_t j = 0; j < j_types.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check precomputed values\n                    CHECK(operator<(j_types[i], j_types[j]) == expected[i][j]);\n                    CHECK(f(j_types[i], j_types[j]) == expected[i][j]);\n                }\n            }\n        }\n    }\n\n    SECTION(\"values\")\n    {\n        json j_values =\n        {\n            nullptr, nullptr,\n            -17, 42,\n            8u, 13u,\n            3.14159, 23.42,\n            \"foo\", \"bar\",\n            true, false,\n            {1, 2, 3}, {\"one\", \"two\", \"three\"},\n            {{\"first\", 1}, {\"second\", 2}}, {{\"a\", \"A\"}, {\"b\", {\"B\"}}},\n            json::binary_array({1, 2, 3}), json::binary_array({1, 2, 4})\n        };\n\n        SECTION(\"comparison: equal\")\n        {\n            std::vector<std::vector<bool>> expected =\n            {\n                {true, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {true, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true}\n            };\n\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    CAPTURE(j_values[i])\n                    CAPTURE(j_values[j])\n                    \/\/ check precomputed values\n                    CHECK( (j_values[i] == j_values[j]) == expected[i][j] );\n                }\n            }\n\n            \/\/ comparison with discarded elements\n            json j_discarded(json::value_t::discarded);\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                CHECK( (j_values[i] == j_discarded) == false);\n                CHECK( (j_discarded == j_values[i]) == false);\n                CHECK( (j_discarded == j_discarded) == false);\n            }\n\n            \/\/ compare with null pointer\n            json j_null;\n            CHECK(j_null == nullptr);\n            CHECK(nullptr == j_null);\n        }\n\n        SECTION(\"comparison: not equal\")\n        {\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check definition\n                    CHECK( (j_values[i] != j_values[j]) == not(j_values[i] == j_values[j]) );\n                }\n            }\n\n            \/\/ compare with null pointer\n            json j_null;\n            CHECK( (j_null != nullptr) == false);\n            CHECK( (nullptr != j_null) == false);\n            CHECK( (j_null != nullptr) == not(j_null == nullptr));\n            CHECK( (nullptr != j_null) == not(nullptr == j_null));\n        }\n\n        SECTION(\"comparison: less\")\n        {\n            std::vector<std::vector<bool>> expected =\n            {\n                {false, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true},\n                {false, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true},\n                {false, false, false, true, true, true, true, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, true, false, true, false, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, true, false, false, false, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, true, true, true, false, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, true, false, false, false, false, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, true, true},\n                {false, false, true, true, true, true, true, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, true, true, true, true, true, true, true, true, true, false, true, true, true, true, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, false, true, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, false, false, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, true, true, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, true, true, true, false, true, true},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false}\n            };\n\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    CAPTURE(j_values[i])\n                    CAPTURE(j_values[j])\n                    \/\/ check precomputed values\n                    CHECK( (j_values[i] < j_values[j]) == expected[i][j] );\n                }\n            }\n\n            \/\/ comparison with discarded elements\n            json j_discarded(json::value_t::discarded);\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                CAPTURE(i)\n                CHECK( (j_values[i] < j_discarded) == false);\n                CHECK( (j_discarded < j_values[i]) == false);\n                CHECK( (j_discarded < j_discarded) == false);\n            }\n        }\n\n        SECTION(\"comparison: less than or equal equal\")\n        {\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check definition\n                    CHECK( (j_values[i] <= j_values[j]) == not(j_values[j] < j_values[i]) );\n                }\n            }\n        }\n\n        SECTION(\"comparison: greater than\")\n        {\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check definition\n                    CHECK( (j_values[i] > j_values[j]) == (j_values[j] < j_values[i]) );\n                }\n            }\n        }\n\n        SECTION(\"comparison: greater than or equal\")\n        {\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check definition\n                    CHECK( (j_values[i] >= j_values[j]) == not(j_values[i] < j_values[j]) );\n                }\n            }\n        }\n    }\n}\n<commit_msg>:white_check_mark: fix test cases<commit_after>\/*\n    __ _____ _____ _____\n __|  |   __|     |   | |  JSON for Modern C++ (test suite)\n|  |  |__   |  |  | | | |  version 3.7.3\n|_____|_____|_____|_|___|  https:\/\/github.com\/nlohmann\/json\n\nLicensed under the MIT License <http:\/\/opensource.org\/licenses\/MIT>.\nSPDX-License-Identifier: MIT\nCopyright (c) 2013-2019 Niels Lohmann <http:\/\/nlohmann.me>.\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 \"doctest_compatibility.h\"\n\n#include <nlohmann\/json.hpp>\nusing nlohmann::json;\n\nnamespace\n{\n\/\/ helper function to check std::less<json::value_t>\n\/\/ see https:\/\/en.cppreference.com\/w\/cpp\/utility\/functional\/less\ntemplate <typename A, typename B, typename U = std::less<json::value_t>>\nbool f(A a, B b, U u = U())\n{\n    return u(a, b);\n}\n}\n\nTEST_CASE(\"lexicographical comparison operators\")\n{\n    SECTION(\"types\")\n    {\n        std::vector<json::value_t> j_types =\n        {\n            json::value_t::null,\n            json::value_t::boolean,\n            json::value_t::number_integer,\n            json::value_t::number_unsigned,\n            json::value_t::number_float,\n            json::value_t::object,\n            json::value_t::array,\n            json::value_t::string,\n            json::value_t::binary\n        };\n\n        SECTION(\"comparison: less\")\n        {\n            std::vector<std::vector<bool>> expected =\n            {\n                {false, true, true, true, true, true, true, true, true},\n                {false, false, true, true, true, true, true, true, true},\n                {false, false, false, false, false, true, true, true, true},\n                {false, false, false, false, false, true, true, true, true},\n                {false, false, false, false, false, true, true, true, true},\n                {false, false, false, false, false, false, true, true, true},\n                {false, false, false, false, false, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true},\n                {false, false, false, false, false, false, false, false, false}\n            };\n\n            for (size_t i = 0; i < j_types.size(); ++i)\n            {\n                for (size_t j = 0; j < j_types.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check precomputed values\n                    CHECK(operator<(j_types[i], j_types[j]) == expected[i][j]);\n                    CHECK(f(j_types[i], j_types[j]) == expected[i][j]);\n                }\n            }\n        }\n    }\n\n    SECTION(\"values\")\n    {\n        json j_values =\n        {\n            nullptr, nullptr,\n            -17, 42,\n            8u, 13u,\n            3.14159, 23.42,\n            \"foo\", \"bar\",\n            true, false,\n            {1, 2, 3}, {\"one\", \"two\", \"three\"},\n            {{\"first\", 1}, {\"second\", 2}}, {{\"a\", \"A\"}, {\"b\", {\"B\"}}},\n            json::binary_array({1, 2, 3}), json::binary_array({1, 2, 4})\n        };\n\n        SECTION(\"comparison: equal\")\n        {\n            std::vector<std::vector<bool>> expected =\n            {\n                {true, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {true, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true}\n            };\n\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    CAPTURE(j_values[i])\n                    CAPTURE(j_values[j])\n                    \/\/ check precomputed values\n                    CHECK( (j_values[i] == j_values[j]) == expected[i][j] );\n                }\n            }\n\n            \/\/ comparison with discarded elements\n            json j_discarded(json::value_t::discarded);\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                CHECK( (j_values[i] == j_discarded) == false);\n                CHECK( (j_discarded == j_values[i]) == false);\n                CHECK( (j_discarded == j_discarded) == false);\n            }\n\n            \/\/ compare with null pointer\n            json j_null;\n            CHECK(j_null == nullptr);\n            CHECK(nullptr == j_null);\n        }\n\n        SECTION(\"comparison: not equal\")\n        {\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check definition\n                    CHECK( (j_values[i] != j_values[j]) == not(j_values[i] == j_values[j]) );\n                }\n            }\n\n            \/\/ compare with null pointer\n            json j_null;\n            CHECK( (j_null != nullptr) == false);\n            CHECK( (nullptr != j_null) == false);\n            CHECK( (j_null != nullptr) == not(j_null == nullptr));\n            CHECK( (nullptr != j_null) == not(nullptr == j_null));\n        }\n\n        SECTION(\"comparison: less\")\n        {\n            std::vector<std::vector<bool>> expected =\n            {\n                {false, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true},\n                {false, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true},\n                {false, false, false, true, true, true, true, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, true, false, true, false, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, true, false, false, false, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, true, true, true, false, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, true, false, false, false, false, true, true, false, false, true, true, true, true, true, true},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, true, true},\n                {false, false, true, true, true, true, true, true, true, true, false, false, true, true, true, true, true, true},\n                {false, false, true, true, true, true, true, true, true, true, true, false, true, true, true, true, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, false, true, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, false, false, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, true, true, false, false, true, true},\n                {false, false, false, false, false, false, false, false, true, true, false, false, true, true, true, false, true, true},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true},\n                {false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false}\n            };\n\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    CAPTURE(j_values[i])\n                    CAPTURE(j_values[j])\n                    \/\/ check precomputed values\n                    CHECK( (j_values[i] < j_values[j]) == expected[i][j] );\n                }\n            }\n\n            \/\/ comparison with discarded elements\n            json j_discarded(json::value_t::discarded);\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                CAPTURE(i)\n                CHECK( (j_values[i] < j_discarded) == false);\n                CHECK( (j_discarded < j_values[i]) == false);\n                CHECK( (j_discarded < j_discarded) == false);\n            }\n        }\n\n        SECTION(\"comparison: less than or equal equal\")\n        {\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check definition\n                    CHECK( (j_values[i] <= j_values[j]) == not(j_values[j] < j_values[i]) );\n                }\n            }\n        }\n\n        SECTION(\"comparison: greater than\")\n        {\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check definition\n                    CHECK( (j_values[i] > j_values[j]) == (j_values[j] < j_values[i]) );\n                }\n            }\n        }\n\n        SECTION(\"comparison: greater than or equal\")\n        {\n            for (size_t i = 0; i < j_values.size(); ++i)\n            {\n                for (size_t j = 0; j < j_values.size(); ++j)\n                {\n                    CAPTURE(i)\n                    CAPTURE(j)\n                    \/\/ check definition\n                    CHECK( (j_values[i] >= j_values[j]) == not(j_values[i] < j_values[j]) );\n                }\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#define BOOST_TEST_MODULE TestDischargeCurve\n#define BOOST_TEST_MAIN\n#include <cap\/energy_storage_device.h>\n#include <cap\/utils.h>\n#include <boost\/format.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <iostream>\n#include <fstream>\n#include <iterator>\n#include <algorithm>\n\n\n\nnamespace cap {\n\nvoid print_headers(std::string const & discharge_mode, std::ostream & os)\n{\n    os<<\"# discharge curve (discharge_mode=\"<<discharge_mode<<\")\\n\";\n    os<<boost::format( \"# %22s  %22s  %22s  \\n\")\n        % \"time t [second]\"\n        % \"current I [ampere]\"\n        % \"voltage U [volt]\"\n        ;\n}\n\n\n\nvoid report(double const time, std::shared_ptr<EnergyStorageDevice const> dev, std::ostream & os)\n{\n    double current;\n    dev->get_current(current);\n    double voltage;\n    dev->get_voltage(voltage);\n    os<<boost::format(\"  %22.15e  %22.15e  %22.15e  \\n\")\n        % time\n        % current\n        % voltage\n        ;\n}\n\n\n\nstd::function<void(double const, double const, std::shared_ptr<cap::EnergyStorageDevice>)>\nget_discharge_evolve_one_time_step(std::string const & discharge_mode, std::shared_ptr<boost::property_tree::ptree const> database)\n{\n    if (discharge_mode.compare(\"constant_current\") == 0) {\n        double const discharge_current = database->get<double>(\"discharge_current\");\n        return [discharge_current](double const, double const time_step, std::shared_ptr<cap::EnergyStorageDevice> dev)\n            { dev->evolve_one_time_step_constant_current(time_step, -discharge_current); };\n    } else if (discharge_mode.compare(\"constant_power\") == 0) {\n        double const discharge_power = database->get<double>(\"discharge_power\");\n        return [discharge_power](double const, double const time_step, std::shared_ptr<cap::EnergyStorageDevice> dev)\n            { dev->evolve_one_time_step_constant_power(time_step, -discharge_power); };\n    } else if (discharge_mode.compare(\"constant_load\") == 0) {\n        double const discharge_load = database->get<double>(\"discharge_load\");\n        return [discharge_load](double const, double const time_step, std::shared_ptr<cap::EnergyStorageDevice> dev)\n            { dev->evolve_one_time_step_constant_load(time_step, discharge_load); };\n    } else {\n        throw std::runtime_error(\"invalid discharge mode \"+discharge_mode);\n    }\n}\n\n\n\nstd::function<bool(double const, std::shared_ptr<cap::EnergyStorageDevice>)>\nget_discharge_end_criterion(std::string const & discharge_stop_at, std::shared_ptr<boost::property_tree::ptree const> database)\n{\n    if (discharge_stop_at.compare(\"voltage_less_than\") == 0) {\n        double const discharge_voltage_limit = database->get<double>(\"discharge_voltage_limit\");\n        return [discharge_voltage_limit](double const, std::shared_ptr<cap::EnergyStorageDevice> dev)\n            { double voltage; dev->get_voltage(voltage); return (voltage <= discharge_voltage_limit); };\n    } else if (discharge_stop_at.compare(\"time_greater_than\") == 0) {\n        double const discharge_duration = database->get<double>(\"discharge_duration\");\n        return [discharge_duration](double const time, std::shared_ptr<cap::EnergyStorageDevice>)\n            { return (time >= discharge_duration); };\n    } else {\n        throw std::runtime_error(\"invalid test stop at \"+discharge_stop_at);\n    }\n}\n\n\n\nvoid discharge_curve(std::shared_ptr<cap::EnergyStorageDevice> dev, std::shared_ptr<boost::property_tree::ptree const> database, std::ostream & os = std::cout)\n{\n    std::string const discharge_mode    = database->get<std::string>(\"discharge_mode\"   );\n    auto evolve_one_time_step = get_discharge_evolve_one_time_step(discharge_mode, database);\n    std::string const discharge_stop_at = database->get<std::string>(\"discharge_stop_at\");\n    auto end_criterion = get_discharge_end_criterion(discharge_stop_at, database);\n\n    double const max_discharge_time = database->get<double>(\"max_discharge_time\");\n    double const time_step          = database->get<double>(\"time_step\"         );\n    double const initial_voltage    = database->get<double>(\"initial_voltage\"   );\n    dev->reset_voltage(initial_voltage);\n\n    double time = 0.0;\n    print_headers(discharge_mode, os);\n    report(time, dev, os);\n    while (time < max_discharge_time)\n    {\n        evolve_one_time_step(time, time_step, dev);\n        time += time_step;\n        report(time, dev, os);\n        if (end_criterion(time, dev))\n            break;\n    }\n}\n\n} \/\/ end namespace cap\n\n\n\nBOOST_AUTO_TEST_CASE( test_discharge_curve )\n{\n    \/\/ parse input file\n    std::shared_ptr<boost::property_tree::ptree> input_database =\n        std::make_shared<boost::property_tree::ptree>();\n    read_xml(\"input_discharge_curve\", *input_database);\n\n    \/\/ build an energy storage system\n    std::shared_ptr<boost::property_tree::ptree> device_database =\n        std::make_shared<boost::property_tree::ptree>(input_database->get_child(\"device\"));\n    std::shared_ptr<cap::EnergyStorageDevice> device =\n        cap::buildEnergyStorageDevice(std::make_shared<cap::Parameters>(device_database));\n\n    \/\/ measure discharge curve\n    std::fstream fout;\n    fout.open(\"discharge_curve_data\", std::fstream::out);\n\n    std::shared_ptr<boost::property_tree::ptree> discharge_curve_database =\n        std::make_shared<boost::property_tree::ptree>(input_database->get_child(\"discharge_curve\"));\n    cap::discharge_curve(device, discharge_curve_database, fout);\n\n    fout.close();\n}    \n<commit_msg>remove spaces in headers for charge curve<commit_after>#define BOOST_TEST_MODULE TestDischargeCurve\n#define BOOST_TEST_MAIN\n#include <cap\/energy_storage_device.h>\n#include <cap\/utils.h>\n#include <boost\/format.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <iostream>\n#include <fstream>\n#include <iterator>\n#include <algorithm>\n\n\n\nnamespace cap {\n\nvoid print_headers(std::string const & discharge_mode, std::ostream & os)\n{\n    os<<\"# discharge curve (discharge_mode=\"<<discharge_mode<<\")\\n\";\n    os<<boost::format( \"# %22s  %22s  %22s  \\n\")\n        % \"time_t_[second]\"\n        % \"current_I_[ampere]\"\n        % \"voltage_U_[volt]\"\n        ;\n}\n\n\n\nvoid report(double const time, std::shared_ptr<EnergyStorageDevice const> dev, std::ostream & os)\n{\n    double current;\n    dev->get_current(current);\n    double voltage;\n    dev->get_voltage(voltage);\n    os<<boost::format(\"  %22.15e  %22.15e  %22.15e  \\n\")\n        % time\n        % current\n        % voltage\n        ;\n}\n\n\n\nstd::function<void(double const, double const, std::shared_ptr<cap::EnergyStorageDevice>)>\nget_discharge_evolve_one_time_step(std::string const & discharge_mode, std::shared_ptr<boost::property_tree::ptree const> database)\n{\n    if (discharge_mode.compare(\"constant_current\") == 0) {\n        double const discharge_current = database->get<double>(\"discharge_current\");\n        return [discharge_current](double const, double const time_step, std::shared_ptr<cap::EnergyStorageDevice> dev)\n            { dev->evolve_one_time_step_constant_current(time_step, -discharge_current); };\n    } else if (discharge_mode.compare(\"constant_power\") == 0) {\n        double const discharge_power = database->get<double>(\"discharge_power\");\n        return [discharge_power](double const, double const time_step, std::shared_ptr<cap::EnergyStorageDevice> dev)\n            { dev->evolve_one_time_step_constant_power(time_step, -discharge_power); };\n    } else if (discharge_mode.compare(\"constant_load\") == 0) {\n        double const discharge_load = database->get<double>(\"discharge_load\");\n        return [discharge_load](double const, double const time_step, std::shared_ptr<cap::EnergyStorageDevice> dev)\n            { dev->evolve_one_time_step_constant_load(time_step, discharge_load); };\n    } else {\n        throw std::runtime_error(\"invalid discharge mode \"+discharge_mode);\n    }\n}\n\n\n\nstd::function<bool(double const, std::shared_ptr<cap::EnergyStorageDevice>)>\nget_discharge_end_criterion(std::string const & discharge_stop_at, std::shared_ptr<boost::property_tree::ptree const> database)\n{\n    if (discharge_stop_at.compare(\"voltage_less_than\") == 0) {\n        double const discharge_voltage_limit = database->get<double>(\"discharge_voltage_limit\");\n        return [discharge_voltage_limit](double const, std::shared_ptr<cap::EnergyStorageDevice> dev)\n            { double voltage; dev->get_voltage(voltage); return (voltage <= discharge_voltage_limit); };\n    } else if (discharge_stop_at.compare(\"time_greater_than\") == 0) {\n        double const discharge_duration = database->get<double>(\"discharge_duration\");\n        return [discharge_duration](double const time, std::shared_ptr<cap::EnergyStorageDevice>)\n            { return (time >= discharge_duration); };\n    } else {\n        throw std::runtime_error(\"invalid test stop at \"+discharge_stop_at);\n    }\n}\n\n\n\nvoid discharge_curve(std::shared_ptr<cap::EnergyStorageDevice> dev, std::shared_ptr<boost::property_tree::ptree const> database, std::ostream & os = std::cout)\n{\n    std::string const discharge_mode    = database->get<std::string>(\"discharge_mode\"   );\n    auto evolve_one_time_step = get_discharge_evolve_one_time_step(discharge_mode, database);\n    std::string const discharge_stop_at = database->get<std::string>(\"discharge_stop_at\");\n    auto end_criterion = get_discharge_end_criterion(discharge_stop_at, database);\n\n    double const max_discharge_time = database->get<double>(\"max_discharge_time\");\n    double const time_step          = database->get<double>(\"time_step\"         );\n    double const initial_voltage    = database->get<double>(\"initial_voltage\"   );\n    dev->reset_voltage(initial_voltage);\n\n    double time = 0.0;\n    print_headers(discharge_mode, os);\n    report(time, dev, os);\n    while (time < max_discharge_time)\n    {\n        evolve_one_time_step(time, time_step, dev);\n        time += time_step;\n        report(time, dev, os);\n        if (end_criterion(time, dev))\n            break;\n    }\n}\n\n} \/\/ end namespace cap\n\n\n\nBOOST_AUTO_TEST_CASE( test_discharge_curve )\n{\n    \/\/ parse input file\n    std::shared_ptr<boost::property_tree::ptree> input_database =\n        std::make_shared<boost::property_tree::ptree>();\n    read_xml(\"input_discharge_curve\", *input_database);\n\n    \/\/ build an energy storage system\n    std::shared_ptr<boost::property_tree::ptree> device_database =\n        std::make_shared<boost::property_tree::ptree>(input_database->get_child(\"device\"));\n    std::shared_ptr<cap::EnergyStorageDevice> device =\n        cap::buildEnergyStorageDevice(std::make_shared<cap::Parameters>(device_database));\n\n    \/\/ measure discharge curve\n    std::fstream fout;\n    fout.open(\"discharge_curve_data\", std::fstream::out);\n\n    std::shared_ptr<boost::property_tree::ptree> discharge_curve_database =\n        std::make_shared<boost::property_tree::ptree>(input_database->get_child(\"discharge_curve\"));\n    cap::discharge_curve(device, discharge_curve_database, fout);\n\n    fout.close();\n}    \n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/uuid\/uuid_generators.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/lexical_cast.hpp> \/** to string conversion when using < C++11 *\/\n\n#include <envire_core\/TransformTreeTypes.hpp>\n#include <envire_core\/TransformTree.hpp>\n#include <envire_core\/Item.hpp>\n#include <envire_core\/GraphViz.hpp>\n#include <envire_core\/FrameEventDispatcher.hpp>\n#include <envire_core\/FrameRootAddedEvent.hpp>\n\nusing namespace envire::core;\n\nBOOST_AUTO_TEST_CASE(add_root_Frame_test)\n{\n  TransformTree tree;\n  Frame root(\"Root\");\n  BOOST_CHECK(tree.num_vertices() == 0);\n  BOOST_CHECK(tree.num_edges() == 0);\n  vertex_descriptor v = tree.addRootFrame(root);\n  const Frame& frame2 = tree.getFrame(v);\n  BOOST_CHECK(root.uuid == frame2.uuid);\n  BOOST_CHECK(tree.num_vertices() == 1);\n  BOOST_CHECK(tree.num_edges() == 0);\n}\n\nclass Dispatcher : public FrameEventDispatcher {\npublic:\n    boost::optional<FrameAddedEvent> frameAddedEvent;\n    boost::optional<FrameRootAddedEvent> frameRootAddedEvent;\n    int callCount = 0;\n\n    virtual void frameAdded(const FrameAddedEvent& e)\n    {\n      ++callCount;\n      frameAddedEvent = e;\n    }\n    virtual void frameRootAdded(const FrameRootAddedEvent& e)\n    {\n      ++callCount;\n      frameRootAddedEvent = e;\n    }\n};\n\nBOOST_AUTO_TEST_CASE(root_frame_event_test)\n{\n    Dispatcher d;\n    TransformTree tree;\n    tree.subscribe(&d);\n    Frame root(\"Root\");\n    vertex_descriptor v = tree.addRootFrame(root);\n    BOOST_CHECK(d.frameRootAddedEvent.is_initialized());\/\/i.e. the event handler was called\n    BOOST_CHECK(d.callCount == 1);\n    BOOST_CHECK(d.frameRootAddedEvent->addedVertex == v);\n}\n\nBOOST_AUTO_TEST_CASE(frame_add_event_test)\n{\n    Dispatcher d;\n    TransformTree tree;\n    tree.subscribe(&d);\n    Frame root(\"Root\");\n    vertex_descriptor rootVertex = tree.addRootFrame(root);\n\n    Frame child(\"child\");\n    Frame childchild(\"childchild\");\n\n    Transform tf;\n    tf.transform.translation.x() = 42;\n\n    BOOST_CHECK(!d.frameAddedEvent.is_initialized());\n    BOOST_CHECK(d.callCount == 1);\n    vertex_descriptor childVertex = tree.addFrame(child, rootVertex, tf);\n    BOOST_CHECK(d.frameAddedEvent.is_initialized());\n    BOOST_CHECK(d.callCount == 2);\n    BOOST_CHECK(d.frameAddedEvent->parent == rootVertex);\n    BOOST_CHECK(d.frameAddedEvent->addedVertex == childVertex);\n    BOOST_CHECK(d.frameAddedEvent->transform.transform.translation.x() == 42);\n\n    d.frameAddedEvent.reset();\n    BOOST_CHECK(!d.frameAddedEvent.is_initialized());\n    Transform tf2;\n    tf2.transform.translation.x() = 84;\n    vertex_descriptor childChildVertex = tree.addFrame(childchild, childVertex, tf2);\n    BOOST_CHECK(d.frameAddedEvent.is_initialized());\n    BOOST_CHECK(d.callCount == 3);\n    BOOST_CHECK(d.frameAddedEvent->parent == childVertex);\n    BOOST_CHECK(d.frameAddedEvent->addedVertex == childChildVertex);\n    BOOST_CHECK(d.frameAddedEvent->transform.transform.translation.x() == 84);\n}\n\nBOOST_AUTO_TEST_CASE(add_and_remove_vertex_test)\n{\n    unsigned int max_vertices = 100;\n\n    BOOST_TEST_MESSAGE(\"ADD VERTEX TEST...\");\n    envire::core::TransformTree tree;\n\n    register unsigned int i = 0;\n    for (i = 0; i<max_vertices; ++i)\n    {\n        envire::core::Frame frame(\"frame_\"+boost::lexical_cast<std::string>(i));\n        tree.add_vertex(frame);\n    }\n\n    BOOST_CHECK(tree.num_vertices() == i);\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n\n    BOOST_TEST_MESSAGE(\"REMOVE VERTEX TEST...\");\n    envire::core::vertex_iterator vi, vi_end, next;\n    boost::tie(vi, vi_end) = tree.vertices();\n    for (next = vi; vi != vi_end; vi = next)\n    {\n        ++next;\n        tree.remove_vertex(*vi);\n    }\n\n    BOOST_CHECK(tree.num_vertices() == 0);\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n}\n\nBOOST_AUTO_TEST_CASE(add_and_remove_edge_test)\n{\n\n    unsigned int max_vertices = 100;\n\n    BOOST_TEST_MESSAGE(\"ADD EDGES TEST...\");\n    envire::core::TransformTree tree;\n\n    register unsigned int i = 0;\n    for (i = 0; i<max_vertices; ++i)\n    {\n        envire::core::Frame frame(\"frame_\"+boost::lexical_cast<std::string>(i));\n        envire::core::vertex_descriptor v1 = tree.add_vertex(frame);\n    }\n\n    \/** get root node **\/\n    envire::core::vertex_descriptor root = tree.vertex(0);\n    for (envire::core::vertices_size_type iv = 1; iv < tree.num_vertices(); ++iv)\n    {\n        envire::core::edge_descriptor edge; bool b;\n        envire::core::vertex_descriptor node_to = tree.vertex(iv);\n        try\n        {\n            boost::tie(edge, b) = tree.add_edge(root, node_to);\n            BOOST_CHECK(b == true);\n        }catch (std::logic_error e)\n        {\n            std::cerr<<e.what();\n        }\n    }\n\n    BOOST_CHECK(tree.num_edges() == tree.num_vertices() - 1);\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n\n    BOOST_TEST_MESSAGE(\"REMOVE EDGES TEST...\");\n    envire::core::edge_iterator ei, ei_end, next;\n    boost::tie(ei, ei_end) = tree.edges();\n    for (next = ei; ei != ei_end; ei = next)\n    {\n        ++next;\n        tree.remove_edge(*ei);\n    }\n\n    BOOST_CHECK(tree.num_edges() == 0);\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n}\n\nBOOST_AUTO_TEST_CASE(add_an_item)\n{\n    \/\/ Instantiate a tree and vertex\n    using namespace envire::core;\n    TransformTree tree;\n    Frame frame(\"Example frame\");\n    vertex_descriptor v1 = tree.add_vertex(frame);\n    \/\/ Add an item to the frame of the vertex\n    boost::intrusive_ptr<Item<std::string>> item(new Item<std::string>());\n    item->setData(\"Contents of the Item\");\n    boost::intrusive_ptr<ItemBase> itemB(item);\n\n    \/\/ Include the item in the vector of the frame (with a vector)\n    unsigned int vectorSize = 1;\n    std::vector< boost::intrusive_ptr<ItemBase>> itemPVector(vectorSize);\n    itemPVector[0] = itemB;\n    frame.items = itemPVector;\n    \/\/ Visualize results\n    envire::core::GraphViz gviz;\n    gviz.write(tree, \"graphviz_boost_test_add_an_item.dot\");\n}\n\nclass Vector: public envire::core::Item<Eigen::Vector3d>\n{\n};\n\nBOOST_AUTO_TEST_CASE(property_and_grahviz_test)\n{\n\n    unsigned int max_vertices = 100;\n\n    envire::core::TransformTree tree;\n    unsigned int vector_size = 100;\n    unsigned int magic_number = 42;\n\n    \/** Create a list of items **\/\n    std::vector< boost::intrusive_ptr<envire::core::ItemBase> > items_vector(vector_size);\n    boost::intrusive_ptr<Vector> my_vector(new Vector());\n    my_vector->setData(magic_number * Eigen::Vector3d::Ones());\n\n    for (std::vector<boost::intrusive_ptr<envire::core::ItemBase> >::iterator it = items_vector.begin() ; it != items_vector.end(); ++it)\n    {\n        \/** Pointer to the same object **\/\n        *it = my_vector;\n    }\n\n    for (unsigned int i = 0; i<max_vertices; ++i)\n    {\n        envire::core::Frame frame(\"frame_\"+boost::lexical_cast<std::string>(i));\n        frame.items = items_vector;\n        envire::core::vertex_descriptor v1 = tree.add_vertex(frame);\n    }\n\n    BOOST_TEST_MESSAGE(\"FRAME PROPERTY TEST...\");\n    for (unsigned int i = 0; i < max_vertices; ++i)\n    {\n        envire::core::Frame frame = tree.getFrame(tree.vertex(i));\n        BOOST_CHECK(frame.name == \"frame_\"+boost::lexical_cast<std::string>(i));\n        BOOST_CHECK(frame.items.size() == vector_size);\n        for (std::vector< boost::intrusive_ptr<envire::core::ItemBase> >::const_iterator it = frame.items.begin();\n                it != frame.items.end(); ++it)\n        {\n            BOOST_CHECK(*it == my_vector);\n            Vector* pvector = dynamic_cast< Vector* >(it->get());\n            BOOST_CHECK(pvector->getData() == magic_number * Eigen::Vector3d::Ones());\n        }\n    }\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n\n    \/** get root node and create edges **\/\n    base::Time now = base::Time::now();\n    envire::core::vertex_descriptor root = tree.vertex(0);\n    for (envire::core::vertices_size_type iv = 1; iv < tree.num_vertices(); ++iv)\n    {\n        envire::core::edge_descriptor edge; bool b;\n        envire::core::Transform tf_prop(now);\n        base::TransformWithCovariance tf(Eigen::AngleAxisd::Identity(), static_cast<base::Position>(my_vector->getData()));\n        tf_prop.setTransform(tf);\n        envire::core::vertex_descriptor node_to = tree.vertex(iv);\n        boost::tie(edge, b) = tree.add_edge(root, node_to, tf_prop);\n        BOOST_CHECK(b == true);\n    }\n\n    BOOST_TEST_MESSAGE(\"TRANSFORM PROPERTY TEST...\");\n    envire::core::edge_iterator it, end;\n    for(boost::tie(it, end) = tree.edges(); it != end; ++it)\n    {\n\n        const Transform& transform = tree.getTransform(it);\n        BOOST_CHECK(transform.time == now);\n        BOOST_CHECK(transform.transform.translation == my_vector->getData());\n    }\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n\n    BOOST_TEST_MESSAGE(\"GRAPHVIZ TEST...\");\n    envire::core::GraphViz gviz;\n\n    gviz.write(tree, \"graphviz_boost_test_transform_tree.dot\");\n\n    \/\/tree.clear();\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n}\n\n<commit_msg>test_transform_tree: cleanup. Removed some unused variables and the register keyword.<commit_after>#include <boost\/uuid\/uuid_generators.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/lexical_cast.hpp> \/** to string conversion when using < C++11 *\/\n\n#include <envire_core\/TransformTreeTypes.hpp>\n#include <envire_core\/TransformTree.hpp>\n#include <envire_core\/Item.hpp>\n#include <envire_core\/GraphViz.hpp>\n#include <envire_core\/FrameEventDispatcher.hpp>\n#include <envire_core\/FrameRootAddedEvent.hpp>\n\nusing namespace envire::core;\n\nBOOST_AUTO_TEST_CASE(add_root_Frame_test)\n{\n  TransformTree tree;\n  Frame root(\"Root\");\n  BOOST_CHECK(tree.num_vertices() == 0);\n  BOOST_CHECK(tree.num_edges() == 0);\n  vertex_descriptor v = tree.addRootFrame(root);\n  const Frame& frame2 = tree.getFrame(v);\n  BOOST_CHECK(root.uuid == frame2.uuid);\n  BOOST_CHECK(tree.num_vertices() == 1);\n  BOOST_CHECK(tree.num_edges() == 0);\n}\n\nclass Dispatcher : public FrameEventDispatcher {\npublic:\n    boost::optional<FrameAddedEvent> frameAddedEvent;\n    boost::optional<FrameRootAddedEvent> frameRootAddedEvent;\n    int callCount = 0;\n\n    virtual void frameAdded(const FrameAddedEvent& e)\n    {\n      ++callCount;\n      frameAddedEvent = e;\n    }\n    virtual void frameRootAdded(const FrameRootAddedEvent& e)\n    {\n      ++callCount;\n      frameRootAddedEvent = e;\n    }\n};\n\nBOOST_AUTO_TEST_CASE(root_frame_event_test)\n{\n    Dispatcher d;\n    TransformTree tree;\n    tree.subscribe(&d);\n    Frame root(\"Root\");\n    vertex_descriptor v = tree.addRootFrame(root);\n    BOOST_CHECK(d.frameRootAddedEvent.is_initialized());\/\/i.e. the event handler was called\n    BOOST_CHECK(d.callCount == 1);\n    BOOST_CHECK(d.frameRootAddedEvent->addedVertex == v);\n}\n\nBOOST_AUTO_TEST_CASE(frame_add_event_test)\n{\n    Dispatcher d;\n    TransformTree tree;\n    tree.subscribe(&d);\n    Frame root(\"Root\");\n    vertex_descriptor rootVertex = tree.addRootFrame(root);\n\n    Frame child(\"child\");\n    Frame childchild(\"childchild\");\n\n    Transform tf;\n    tf.transform.translation.x() = 42;\n\n    BOOST_CHECK(!d.frameAddedEvent.is_initialized());\n    BOOST_CHECK(d.callCount == 1);\n    vertex_descriptor childVertex = tree.addFrame(child, rootVertex, tf);\n    BOOST_CHECK(d.frameAddedEvent.is_initialized());\n    BOOST_CHECK(d.callCount == 2);\n    BOOST_CHECK(d.frameAddedEvent->parent == rootVertex);\n    BOOST_CHECK(d.frameAddedEvent->addedVertex == childVertex);\n    BOOST_CHECK(d.frameAddedEvent->transform.transform.translation.x() == 42);\n\n    d.frameAddedEvent.reset();\n    BOOST_CHECK(!d.frameAddedEvent.is_initialized());\n    Transform tf2;\n    tf2.transform.translation.x() = 84;\n    vertex_descriptor childChildVertex = tree.addFrame(childchild, childVertex, tf2);\n    BOOST_CHECK(d.frameAddedEvent.is_initialized());\n    BOOST_CHECK(d.callCount == 3);\n    BOOST_CHECK(d.frameAddedEvent->parent == childVertex);\n    BOOST_CHECK(d.frameAddedEvent->addedVertex == childChildVertex);\n    BOOST_CHECK(d.frameAddedEvent->transform.transform.translation.x() == 84);\n}\n\nBOOST_AUTO_TEST_CASE(add_and_remove_vertex_test)\n{\n    unsigned int max_vertices = 100;\n\n    BOOST_TEST_MESSAGE(\"ADD VERTEX TEST...\");\n    envire::core::TransformTree tree;\n\n    unsigned int i = 0;\n    for (i = 0; i<max_vertices; ++i)\n    {\n        envire::core::Frame frame(\"frame_\"+boost::lexical_cast<std::string>(i));\n        tree.add_vertex(frame);\n    }\n\n    BOOST_CHECK(tree.num_vertices() == i);\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n\n    BOOST_TEST_MESSAGE(\"REMOVE VERTEX TEST...\");\n    envire::core::vertex_iterator vi, vi_end, next;\n    boost::tie(vi, vi_end) = tree.vertices();\n    for (next = vi; vi != vi_end; vi = next)\n    {\n        ++next;\n        tree.remove_vertex(*vi);\n    }\n\n    BOOST_CHECK(tree.num_vertices() == 0);\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n}\n\nBOOST_AUTO_TEST_CASE(add_and_remove_edge_test)\n{\n\n    unsigned int max_vertices = 100;\n\n    BOOST_TEST_MESSAGE(\"ADD EDGES TEST...\");\n    envire::core::TransformTree tree;\n\n    unsigned int i = 0;\n    for (i = 0; i<max_vertices; ++i)\n    {\n        envire::core::Frame frame(\"frame_\"+boost::lexical_cast<std::string>(i));\n        tree.add_vertex(frame);\n    }\n\n    \/** get root node **\/\n    envire::core::vertex_descriptor root = tree.vertex(0);\n    for (envire::core::vertices_size_type iv = 1; iv < tree.num_vertices(); ++iv)\n    {\n        envire::core::edge_descriptor edge; bool b;\n        envire::core::vertex_descriptor node_to = tree.vertex(iv);\n        try\n        {\n            boost::tie(edge, b) = tree.add_edge(root, node_to);\n            BOOST_CHECK(b == true);\n        }catch (std::logic_error e)\n        {\n            std::cerr<<e.what();\n        }\n    }\n\n    BOOST_CHECK(tree.num_edges() == tree.num_vertices() - 1);\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n\n    BOOST_TEST_MESSAGE(\"REMOVE EDGES TEST...\");\n    envire::core::edge_iterator ei, ei_end, next;\n    boost::tie(ei, ei_end) = tree.edges();\n    for (next = ei; ei != ei_end; ei = next)\n    {\n        ++next;\n        tree.remove_edge(*ei);\n    }\n\n    BOOST_CHECK(tree.num_edges() == 0);\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n}\n\nBOOST_AUTO_TEST_CASE(add_an_item)\n{\n    \/\/ Instantiate a tree and vertex\n    using namespace envire::core;\n    TransformTree tree;\n    Frame frame(\"Example frame\");\n    tree.add_vertex(frame);\n    \/\/ Add an item to the frame of the vertex\n    boost::intrusive_ptr<Item<std::string>> item(new Item<std::string>());\n    item->setData(\"Contents of the Item\");\n    boost::intrusive_ptr<ItemBase> itemB(item);\n\n    \/\/ Include the item in the vector of the frame (with a vector)\n    unsigned int vectorSize = 1;\n    std::vector< boost::intrusive_ptr<ItemBase>> itemPVector(vectorSize);\n    itemPVector[0] = itemB;\n    frame.items = itemPVector;\n    \/\/ Visualize results\n    envire::core::GraphViz gviz;\n    gviz.write(tree, \"graphviz_boost_test_add_an_item.dot\");\n}\n\nclass Vector: public envire::core::Item<Eigen::Vector3d>\n{\n};\n\nBOOST_AUTO_TEST_CASE(property_and_grahviz_test)\n{\n\n    unsigned int max_vertices = 100;\n\n    envire::core::TransformTree tree;\n    unsigned int vector_size = 100;\n    unsigned int magic_number = 42;\n\n    \/** Create a list of items **\/\n    std::vector< boost::intrusive_ptr<envire::core::ItemBase> > items_vector(vector_size);\n    boost::intrusive_ptr<Vector> my_vector(new Vector());\n    my_vector->setData(magic_number * Eigen::Vector3d::Ones());\n\n    for (std::vector<boost::intrusive_ptr<envire::core::ItemBase> >::iterator it = items_vector.begin() ; it != items_vector.end(); ++it)\n    {\n        \/** Pointer to the same object **\/\n        *it = my_vector;\n    }\n\n    for (unsigned int i = 0; i<max_vertices; ++i)\n    {\n        envire::core::Frame frame(\"frame_\"+boost::lexical_cast<std::string>(i));\n        frame.items = items_vector;\n        tree.add_vertex(frame);\n    }\n\n    BOOST_TEST_MESSAGE(\"FRAME PROPERTY TEST...\");\n    for (unsigned int i = 0; i < max_vertices; ++i)\n    {\n        envire::core::Frame frame = tree.getFrame(tree.vertex(i));\n        BOOST_CHECK(frame.name == \"frame_\"+boost::lexical_cast<std::string>(i));\n        BOOST_CHECK(frame.items.size() == vector_size);\n        for (std::vector< boost::intrusive_ptr<envire::core::ItemBase> >::const_iterator it = frame.items.begin();\n                it != frame.items.end(); ++it)\n        {\n            BOOST_CHECK(*it == my_vector);\n            Vector* pvector = dynamic_cast< Vector* >(it->get());\n            BOOST_CHECK(pvector->getData() == magic_number * Eigen::Vector3d::Ones());\n        }\n    }\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n\n    \/** get root node and create edges **\/\n    base::Time now = base::Time::now();\n    envire::core::vertex_descriptor root = tree.vertex(0);\n    for (envire::core::vertices_size_type iv = 1; iv < tree.num_vertices(); ++iv)\n    {\n        envire::core::edge_descriptor edge; bool b;\n        envire::core::Transform tf_prop(now);\n        base::TransformWithCovariance tf(Eigen::AngleAxisd::Identity(), static_cast<base::Position>(my_vector->getData()));\n        tf_prop.setTransform(tf);\n        envire::core::vertex_descriptor node_to = tree.vertex(iv);\n        boost::tie(edge, b) = tree.add_edge(root, node_to, tf_prop);\n        BOOST_CHECK(b == true);\n    }\n\n    BOOST_TEST_MESSAGE(\"TRANSFORM PROPERTY TEST...\");\n    envire::core::edge_iterator it, end;\n    for(boost::tie(it, end) = tree.edges(); it != end; ++it)\n    {\n\n        const Transform& transform = tree.getTransform(it);\n        BOOST_CHECK(transform.time == now);\n        BOOST_CHECK(transform.transform.translation == my_vector->getData());\n    }\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n\n    BOOST_TEST_MESSAGE(\"GRAPHVIZ TEST...\");\n    envire::core::GraphViz gviz;\n\n    gviz.write(tree, \"graphviz_boost_test_transform_tree.dot\");\n\n    \/\/tree.clear();\n    BOOST_TEST_MESSAGE(\"DONE\\n\");\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ffmpegdecoder.h\"\n#include \"makeguard.h\"\n#include \"interlockedadd.h\"\n\nextern \"C\"\n{\n#include \"libavutil\/imgutils.h\"\n}\n\n#include <boost\/log\/trivial.hpp>\n#include <tuple>\n\nnamespace {\n\nbool frameToImage(\n    VideoFrame& videoFrameData,\n    AVFramePtr& m_videoFrame,\n    SwsContext*& m_imageCovertContext,\n    AVPixelFormat m_pixelFormat)\n{\n    if (m_videoFrame->format == m_pixelFormat\n        || m_videoFrame->format == AV_PIX_FMT_DXVA2_VLD)\n    {\n        std::swap(m_videoFrame, videoFrameData.m_image);\n    }\n    else\n    {\n        const int width = m_videoFrame->width;\n        const int height = m_videoFrame->height;\n\n        videoFrameData.realloc(m_pixelFormat, width, height);\n\n        \/\/ Prepare image conversion\n        m_imageCovertContext =\n            sws_getCachedContext(m_imageCovertContext, m_videoFrame->width, m_videoFrame->height,\n            static_cast<AVPixelFormat>(m_videoFrame->format), width, height, m_pixelFormat,\n            0, nullptr, nullptr, nullptr);\n\n        assert(m_imageCovertContext != nullptr);\n\n        if (m_imageCovertContext == nullptr)\n        {\n            return false;\n        }\n\n        \/\/ Doing conversion\n        if (sws_scale(m_imageCovertContext, m_videoFrame->data, m_videoFrame->linesize, 0,\n            m_videoFrame->height, videoFrameData.m_image->data, videoFrameData.m_image->linesize) <= 0)\n        {\n            assert(false && \"sws_scale failed\");\n            BOOST_LOG_TRIVIAL(error) << \"sws_scale failed\";\n            return false;\n        }\n\n        videoFrameData.m_image->sample_aspect_ratio = m_videoFrame->sample_aspect_ratio;\n    }\n\n    return true;\n}\n\nauto GetAsyncConversionFunction(AVFramePtr input,\n    std::promise<VideoFrame *> &videoFramePromise,\n    boost::shared_ptr<IFrameDecoder::ImageConversionFunc> imageConversionFunc,\n    AVPixelFormat pixelFormat)\n{\n    return [input = std::move(input),\n        outputFut = videoFramePromise.get_future(),\n        imageConversionFunc = std::move(imageConversionFunc),\n        pixelFormat]() mutable\n    {\n        try {\n            const int stride = (input->width + 1) & ~1;\n\n            std::vector<uint8_t> img(stride * (input->height + (input->height + 1) \/ 2));\n\n            const auto data = img.data();\n\n            if (input->format == AV_PIX_FMT_NV12)\n            {\n                av_image_copy_plane(data, stride, input->data[0], input->linesize[0], input->width, input->height);\n                av_image_copy_plane(data + stride * input->height, stride, input->data[1], input->linesize[1], input->width, input->height \/ 2);\n            }\n            else\n            {\n                auto img_convert_ctx = sws_getContext(\n                    input->width,\n                    input->height,\n                    (AVPixelFormat)input->format,\n                    input->width,\n                    input->height,\n                    AV_PIX_FMT_NV12,\n                    SWS_FAST_BILINEAR, NULL, NULL, NULL);\n\n                uint8_t* const dst[] = { data, data + stride * input->height };\n                const int dstStride[] = { stride, stride };\n\n                sws_scale(img_convert_ctx, input->data, input->linesize, 0, input->height,\n                    dst, dstStride);\n\n                sws_freeContext(img_convert_ctx);\n            }\n\n            std::vector<uint8_t> outputImg;\n\n            int outputHeight{};\n            int outputWidth{};\n\n            (*imageConversionFunc)(data, stride, input->width, input->height, outputImg, outputWidth, outputHeight);\n\n            const int outputStride = outputWidth;\n\n            auto output = outputFut.get();\n            if (!output)\n                return false;\n\n            output->realloc(pixelFormat, outputWidth, outputHeight);\n\n            auto img_convert_ctx = sws_getContext(\n                outputWidth,\n                outputHeight,\n                AV_PIX_FMT_NV12,\n                outputWidth,\n                outputHeight,\n                pixelFormat,\n                SWS_FAST_BILINEAR, NULL, NULL, NULL);\n\n            const auto outputData = outputImg.data();\n\n            uint8_t* const src[] = { outputData, outputData + outputStride * outputHeight };\n            const int srcStride[] = { outputStride, outputStride };\n\n            sws_scale(img_convert_ctx,\n                src, srcStride,\n                0, outputHeight,\n                output->m_image->data,\n                output->m_image->linesize);\n\n            sws_freeContext(img_convert_ctx);\n        }\n        catch (const std::exception& ex) {\n            CHANNEL_LOG(ffmpeg_sync) << \"Exception in async converter: \" << typeid(ex).name() << \": \" << ex.what();\n            return false;\n        }\n\n        return true;\n    };\n}\n\n} \/\/ namespace\n\nstruct FFmpegDecoder::VideoParseContext\n{\n    bool initialized = false;\n    int numSkipped = 0;\n};\n\nvoid FFmpegDecoder::videoParseRunnable()\n{\n    CHANNEL_LOG(ffmpeg_threads) << \"Video thread started\";\n    m_videoStartClock = VIDEO_START_CLOCK_NOT_INITIALIZED;\n    double videoClock = 0; \/\/ pts of last decoded frame \/ predicted pts of next decoded frame\n\n    VideoParseContext context{};\n\n    for (;;)\n    {\n        if (m_isPaused && !m_isVideoSeekingWhilePaused)\n        {\n            boost::unique_lock<boost::mutex> locker(m_isPausedMutex);\n            while (m_isPaused && !m_isVideoSeekingWhilePaused)\n            {\n                m_isPausedCV.wait(locker);\n            }\n        }\n\n        for (;;)\n        {\n            AVPacket packet;\n            if (!m_videoPacketsQueue.pop(packet,\n                [this] { return m_isPaused && !m_isVideoSeekingWhilePaused; }))\n            {\n                break;\n            }\n\n            auto packetGuard = MakeGuard(&packet, av_packet_unref);\n\n            if (!handleVideoPacket(packet, videoClock, context)\n                || m_isPaused && !m_isVideoSeekingWhilePaused)\n            {\n                break;\n            }\n        }\n    }\n}\n\nbool FFmpegDecoder::handleVideoPacket(\n    const AVPacket& packet,\n    double& videoClock,\n    VideoParseContext& context)\n{\n    const int ret = avcodec_send_packet(m_videoCodecContext, &packet);\n    if (ret < 0) {\n        return false;\n    }\n\n    AVFramePtr videoFrame(av_frame_alloc());\n    while (avcodec_receive_frame(m_videoCodecContext, videoFrame.get()) == 0)\n    {\n\t\tconst int64_t duration_stamp = videoFrame->best_effort_timestamp;\n\n        \/\/ compute the exact PTS for the picture if it is omitted in the stream\n        \/\/ pts1 is the dts of the pkt \/ pts of the frame\n        if (duration_stamp != AV_NOPTS_VALUE)\n        {\n            videoClock = duration_stamp * av_q2d(m_videoStream->time_base);\n        }\n        const double pts = videoClock;\n\n        \/\/ update video clock for next frame\n        \/\/ for MPEG2, the frame can be repeated, so we update the clock accordingly\n        const double frameDelay = av_q2d(m_videoCodecContext->time_base) *\n            (1. + videoFrame->repeat_pict * 0.5);\n        videoClock += frameDelay;\n\n        if (!handleVideoFrame(videoFrame, pts, context)) {\n            break;\n        }\n    }\n\n    return true;\n}\n\nbool FFmpegDecoder::handleVideoFrame(\n    AVFramePtr& videoFrame,\n    double pts,\n    VideoParseContext& context)\n{\n    enum { MAX_SKIPPED_TILL_REDRAW = 5 };\n    enum { SKIP_LOOP_FILTER_THRESHOLD = 50 };\n    const double MAX_DELAY = 0.2;\n\n    const int64_t duration_stamp = videoFrame->best_effort_timestamp;\n\n    boost::posix_time::time_duration td(boost::posix_time::pos_infin);\n    bool inNextFrame = false;\n    const bool haveVideoPackets = !m_videoPacketsQueue.empty();\n\n    {\n        boost::lock_guard<boost::mutex> locker(m_isPausedMutex);\n\n        const bool isPaused = m_isPaused;\n        inNextFrame = isPaused && m_isVideoSeekingWhilePaused;\n        if (!context.initialized || inNextFrame)\n        {\n            const auto val = (isPaused ? m_pauseTimer : GetHiResTime()) - pts;\n            m_videoStartClock = val;\n            CHANNEL_LOG(ffmpeg_sync) << \"isPaused = \" << isPaused << \" m_videoStartClock = \" << val;\n        }\n\n        \/\/ Skipping frames\n        if (context.initialized && !inNextFrame && haveVideoPackets)\n        {\n            const double curTime = GetHiResTime();\n            if (m_videoStartClock + pts <= curTime)\n            {\n                if (m_videoStartClock + pts < curTime - MAX_DELAY)\n                {\n                    InterlockedAdd(m_videoStartClock, MAX_DELAY);\n                }\n\n                ++context.numSkipped;\n                if (context.numSkipped == SKIP_LOOP_FILTER_THRESHOLD)\n                {\n                    if (m_videoCodecContext->skip_loop_filter != AVDISCARD_ALL)\n                    {\n                        \/\/ https:\/\/trac.kodi.tv\/ticket\/4943\n                        CHANNEL_LOG(ffmpeg_sync) << \"skip_loop_filter = AVDISCARD_ALL\";\n                        m_videoCodecContext->skip_loop_filter = AVDISCARD_ALL;\n                    }\n                }\n                if ((context.numSkipped % MAX_SKIPPED_TILL_REDRAW) != 0)\n                {\n                    CHANNEL_LOG(ffmpeg_sync) << \"Hard skip frame\";\n\n                    \/\/ pause\n                    return !(isPaused && !m_isVideoSeekingWhilePaused);\n                }\n            }\n            else\n            {\n                const auto speed = getSpeedRational();\n                context.numSkipped = 0;\n                td = boost::posix_time::milliseconds(\n                    int((m_videoStartClock + pts - curTime) * 1000.  * speed.denominator \/ speed.numerator) + 1);\n            }\n        }\n    }\n\n    context.initialized = true;\n\n    boost::shared_ptr<ImageConversionFunc> imageConversionFunc = m_imageConversionFunc;\n    const bool useAsyncConversion = imageConversionFunc != nullptr && (*imageConversionFunc);\n\n    handleDirect3dData(videoFrame.get(), useAsyncConversion);\n\n    std::future<bool> convert;\n    std::promise<VideoFrame*> videoFramePromise;\n\n    auto promGuard = MakeGuard(&videoFramePromise, [](auto promise) { promise->set_value(nullptr); });\n\n    if (useAsyncConversion)\n    {\n        AVFramePtr input(av_frame_alloc());\n\n        std::swap(input, videoFrame);\n\n        auto asyncConversion = GetAsyncConversionFunction(std::move(input),\n            videoFramePromise,\n            std::move(imageConversionFunc),\n            m_pixelFormat);\n\n        convert = std::async(std::launch::async, std::move(asyncConversion));\n    }\n\n    {\n        boost::unique_lock<boost::mutex> locker(m_videoFramesMutex);\n\n        if (!m_videoFramesCV.timed_wait(locker, td, [this]\n        {\n            return m_isPaused && !m_isVideoSeekingWhilePaused ||\n                m_videoFramesQueue.canPush();\n        }))\n        {\n            CHANNEL_LOG(ffmpeg_sync) << \"Frame wait abandoned\";\n            return true;\n        }\n    }\n\n    {\n        boost::lock_guard<boost::mutex> locker(m_isPausedMutex);\n        if (m_isPaused && !m_isVideoSeekingWhilePaused)\n        {\n            return false;\n        }\n\n        m_isVideoSeekingWhilePaused = false;\n    }\n\n    if (inNextFrame)\n    {\n        m_isPausedCV.notify_all();\n    }\n\n    VideoFrame& current_frame = m_videoFramesQueue.back();\n\n    if (!useAsyncConversion && !frameToImage(current_frame, videoFrame, m_imageCovertContext, m_pixelFormat))\n    {\n        return true;\n    }\n\n    current_frame.m_pts = pts;\n    current_frame.m_duration = duration_stamp;\n\n    if (useAsyncConversion)\n    {\n        promGuard.release();\n        videoFramePromise.set_value(&current_frame);\n        current_frame.m_convert = std::move(convert);\n    }\n\n    {\n        boost::lock_guard<boost::mutex> locker(m_videoFramesMutex);\n        m_videoFramesQueue.pushBack();\n    }\n    m_videoFramesCV.notify_all();\n\n    return true;\n}\n<commit_msg>simplified<commit_after>#include \"ffmpegdecoder.h\"\n#include \"makeguard.h\"\n#include \"interlockedadd.h\"\n\nextern \"C\"\n{\n#include \"libavutil\/imgutils.h\"\n}\n\n#include <boost\/log\/trivial.hpp>\n#include <tuple>\n\nnamespace {\n\nbool frameToImage(\n    VideoFrame& videoFrameData,\n    AVFramePtr& m_videoFrame,\n    SwsContext*& m_imageCovertContext,\n    AVPixelFormat m_pixelFormat)\n{\n    if (m_videoFrame->format == m_pixelFormat\n        || m_videoFrame->format == AV_PIX_FMT_DXVA2_VLD)\n    {\n        std::swap(m_videoFrame, videoFrameData.m_image);\n    }\n    else\n    {\n        const int width = m_videoFrame->width;\n        const int height = m_videoFrame->height;\n\n        videoFrameData.realloc(m_pixelFormat, width, height);\n\n        \/\/ Prepare image conversion\n        m_imageCovertContext =\n            sws_getCachedContext(m_imageCovertContext, m_videoFrame->width, m_videoFrame->height,\n            static_cast<AVPixelFormat>(m_videoFrame->format), width, height, m_pixelFormat,\n            0, nullptr, nullptr, nullptr);\n\n        assert(m_imageCovertContext != nullptr);\n\n        if (m_imageCovertContext == nullptr)\n        {\n            return false;\n        }\n\n        \/\/ Doing conversion\n        if (sws_scale(m_imageCovertContext, m_videoFrame->data, m_videoFrame->linesize, 0,\n            m_videoFrame->height, videoFrameData.m_image->data, videoFrameData.m_image->linesize) <= 0)\n        {\n            assert(false && \"sws_scale failed\");\n            BOOST_LOG_TRIVIAL(error) << \"sws_scale failed\";\n            return false;\n        }\n\n        videoFrameData.m_image->sample_aspect_ratio = m_videoFrame->sample_aspect_ratio;\n    }\n\n    return true;\n}\n\nauto GetAsyncConversionFunction(AVFramePtr input,\n    std::promise<VideoFrame *> &videoFramePromise,\n    boost::shared_ptr<IFrameDecoder::ImageConversionFunc> imageConversionFunc,\n    AVPixelFormat pixelFormat)\n{\n    return [input = std::move(input),\n        outputFut = videoFramePromise.get_future(),\n        imageConversionFunc = std::move(imageConversionFunc),\n        pixelFormat]() mutable\n    {\n        try {\n            const int stride = (input->width + 1) & ~1;\n\n            std::vector<uint8_t> img(stride * (input->height + (input->height + 1) \/ 2));\n\n            const auto data = img.data();\n\n            if (input->format == AV_PIX_FMT_NV12)\n            {\n                av_image_copy_plane(data, stride, input->data[0], input->linesize[0], input->width, input->height);\n                av_image_copy_plane(data + stride * input->height, stride, input->data[1], input->linesize[1], input->width, input->height \/ 2);\n            }\n            else\n            {\n                auto img_convert_ctx = sws_getContext(\n                    input->width,\n                    input->height,\n                    (AVPixelFormat)input->format,\n                    input->width,\n                    input->height,\n                    AV_PIX_FMT_NV12,\n                    SWS_FAST_BILINEAR, NULL, NULL, NULL);\n\n                uint8_t* const dst[] = { data, data + stride * input->height };\n                const int dstStride[] = { stride, stride };\n\n                sws_scale(img_convert_ctx, input->data, input->linesize, 0, input->height,\n                    dst, dstStride);\n\n                sws_freeContext(img_convert_ctx);\n            }\n\n            std::vector<uint8_t> outputImg;\n\n            int outputHeight{};\n            int outputWidth{};\n\n            (*imageConversionFunc)(data, stride, input->width, input->height, outputImg, outputWidth, outputHeight);\n\n            const int outputStride = outputWidth;\n\n            auto output = outputFut.get();\n            if (!output)\n                return false;\n\n            output->realloc(pixelFormat, outputWidth, outputHeight);\n\n            auto img_convert_ctx = sws_getContext(\n                outputWidth,\n                outputHeight,\n                AV_PIX_FMT_NV12,\n                outputWidth,\n                outputHeight,\n                pixelFormat,\n                SWS_FAST_BILINEAR, NULL, NULL, NULL);\n\n            const auto outputData = outputImg.data();\n\n            uint8_t* const src[] = { outputData, outputData + outputStride * outputHeight };\n            const int srcStride[] = { outputStride, outputStride };\n\n            sws_scale(img_convert_ctx,\n                src, srcStride,\n                0, outputHeight,\n                output->m_image->data,\n                output->m_image->linesize);\n\n            sws_freeContext(img_convert_ctx);\n        }\n        catch (const std::exception& ex) {\n            CHANNEL_LOG(ffmpeg_sync) << \"Exception in async converter: \" << typeid(ex).name() << \": \" << ex.what();\n            return false;\n        }\n\n        return true;\n    };\n}\n\n} \/\/ namespace\n\nstruct FFmpegDecoder::VideoParseContext\n{\n    bool initialized = false;\n    int numSkipped = 0;\n};\n\nvoid FFmpegDecoder::videoParseRunnable()\n{\n    CHANNEL_LOG(ffmpeg_threads) << \"Video thread started\";\n    m_videoStartClock = VIDEO_START_CLOCK_NOT_INITIALIZED;\n    double videoClock = 0; \/\/ pts of last decoded frame \/ predicted pts of next decoded frame\n\n    VideoParseContext context{};\n\n    for (;;)\n    {\n        AVPacket packet;\n        if (!m_videoPacketsQueue.pop(packet))\n        {\n            break;\n        }\n\n        auto packetGuard = MakeGuard(&packet, av_packet_unref);\n\n        handleVideoPacket(packet, videoClock, context);\n    }\n}\n\nbool FFmpegDecoder::handleVideoPacket(\n    const AVPacket& packet,\n    double& videoClock,\n    VideoParseContext& context)\n{\n    const int ret = avcodec_send_packet(m_videoCodecContext, &packet);\n    if (ret < 0) {\n        return false;\n    }\n\n    AVFramePtr videoFrame(av_frame_alloc());\n    while (avcodec_receive_frame(m_videoCodecContext, videoFrame.get()) == 0)\n    {\n\t\tconst int64_t duration_stamp = videoFrame->best_effort_timestamp;\n\n        \/\/ compute the exact PTS for the picture if it is omitted in the stream\n        \/\/ pts1 is the dts of the pkt \/ pts of the frame\n        if (duration_stamp != AV_NOPTS_VALUE)\n        {\n            videoClock = duration_stamp * av_q2d(m_videoStream->time_base);\n        }\n        const double pts = videoClock;\n\n        \/\/ update video clock for next frame\n        \/\/ for MPEG2, the frame can be repeated, so we update the clock accordingly\n        const double frameDelay = av_q2d(m_videoCodecContext->time_base) *\n            (1. + videoFrame->repeat_pict * 0.5);\n        videoClock += frameDelay;\n\n        if (!handleVideoFrame(videoFrame, pts, context)) {\n            break;\n        }\n    }\n\n    return true;\n}\n\nbool FFmpegDecoder::handleVideoFrame(\n    AVFramePtr& videoFrame,\n    double pts,\n    VideoParseContext& context)\n{\n    enum { MAX_SKIPPED_TILL_REDRAW = 5 };\n    enum { SKIP_LOOP_FILTER_THRESHOLD = 50 };\n    const double MAX_DELAY = 0.2;\n\n    const int64_t duration_stamp = videoFrame->best_effort_timestamp;\n\n    boost::posix_time::time_duration td(boost::posix_time::pos_infin);\n    bool inNextFrame = false;\n\n    {\n        boost::unique_lock<boost::mutex> locker(m_isPausedMutex);\n        while (m_isPaused && !m_isVideoSeekingWhilePaused)\n        {\n            m_isPausedCV.wait(locker);\n        }\n\n        const bool isPaused = m_isPaused;\n        inNextFrame = isPaused && m_isVideoSeekingWhilePaused;\n        if (!context.initialized || inNextFrame)\n        {\n            const auto val = (isPaused ? m_pauseTimer : GetHiResTime()) - pts;\n            m_videoStartClock = val;\n            CHANNEL_LOG(ffmpeg_sync) << \"isPaused = \" << isPaused << \" m_videoStartClock = \" << val;\n        }\n\n        \/\/ Skipping frames\n        if (context.initialized && !inNextFrame && !m_videoPacketsQueue.empty())\n        {\n            const double curTime = GetHiResTime();\n            if (m_videoStartClock + pts <= curTime)\n            {\n                if (m_videoStartClock + pts < curTime - MAX_DELAY)\n                {\n                    InterlockedAdd(m_videoStartClock, MAX_DELAY);\n                }\n\n                ++context.numSkipped;\n                if (context.numSkipped == SKIP_LOOP_FILTER_THRESHOLD)\n                {\n                    if (m_videoCodecContext->skip_loop_filter != AVDISCARD_ALL)\n                    {\n                        \/\/ https:\/\/trac.kodi.tv\/ticket\/4943\n                        CHANNEL_LOG(ffmpeg_sync) << \"skip_loop_filter = AVDISCARD_ALL\";\n                        m_videoCodecContext->skip_loop_filter = AVDISCARD_ALL;\n                    }\n                }\n                if ((context.numSkipped % MAX_SKIPPED_TILL_REDRAW) != 0)\n                {\n                    CHANNEL_LOG(ffmpeg_sync) << \"Hard skip frame\";\n\n                    \/\/ pause\n                    return !(isPaused && !m_isVideoSeekingWhilePaused);\n                }\n            }\n            else\n            {\n                const auto speed = getSpeedRational();\n                context.numSkipped = 0;\n                td = boost::posix_time::milliseconds(\n                    int((m_videoStartClock + pts - curTime) * 1000.  * speed.denominator \/ speed.numerator) + 1);\n            }\n        }\n    }\n\n    context.initialized = true;\n\n    boost::shared_ptr<ImageConversionFunc> imageConversionFunc = m_imageConversionFunc;\n    const bool useAsyncConversion = imageConversionFunc != nullptr && (*imageConversionFunc);\n\n    handleDirect3dData(videoFrame.get(), useAsyncConversion);\n\n    std::future<bool> convert;\n    std::promise<VideoFrame*> videoFramePromise;\n\n    auto promGuard = MakeGuard(&videoFramePromise, [](auto promise) { promise->set_value(nullptr); });\n\n    if (useAsyncConversion)\n    {\n        AVFramePtr input(av_frame_alloc());\n\n        std::swap(input, videoFrame);\n\n        auto asyncConversion = GetAsyncConversionFunction(std::move(input),\n            videoFramePromise,\n            std::move(imageConversionFunc),\n            m_pixelFormat);\n\n        convert = std::async(std::launch::async, std::move(asyncConversion));\n    }\n\n    {\n        boost::unique_lock<boost::mutex> locker(m_videoFramesMutex);\n\n        if (!m_videoFramesCV.timed_wait(locker, td, [this]\n        {\n            return m_isPaused && !m_isVideoSeekingWhilePaused ||\n                m_videoFramesQueue.canPush();\n        }))\n        {\n            CHANNEL_LOG(ffmpeg_sync) << \"Frame wait abandoned\";\n            return true;\n        }\n    }\n\n    {\n        boost::lock_guard<boost::mutex> locker(m_isPausedMutex);\n        if (m_isPaused && !m_isVideoSeekingWhilePaused)\n        {\n            return false;\n        }\n\n        m_isVideoSeekingWhilePaused = false;\n    }\n\n    if (inNextFrame)\n    {\n        m_isPausedCV.notify_all();\n    }\n\n    VideoFrame& current_frame = m_videoFramesQueue.back();\n\n    if (!useAsyncConversion && !frameToImage(current_frame, videoFrame, m_imageCovertContext, m_pixelFormat))\n    {\n        return true;\n    }\n\n    current_frame.m_pts = pts;\n    current_frame.m_duration = duration_stamp;\n\n    if (useAsyncConversion)\n    {\n        promGuard.release();\n        videoFramePromise.set_value(&current_frame);\n        current_frame.m_convert = std::move(convert);\n    }\n\n    {\n        boost::lock_guard<boost::mutex> locker(m_videoFramesMutex);\n        m_videoFramesQueue.pushBack();\n    }\n    m_videoFramesCV.notify_all();\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\ file LMSFilter.cpp\n *\/\n\n#include <array>\n#include <fstream>\n\n#include <ATK\/Adaptive\/LMSFilter.h>\n\n#include <ATK\/Core\/InPointerFilter.h>\n#include <ATK\/Core\/OutPointerFilter.h>\n\n#include <ATK\/Tools\/SumFilter.h>\n\n#include <Eigen\/Core>\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n#include <boost\/math\/constants\/constants.hpp>\n\n#define PROCESSSIZE (1200)\n\nBOOST_AUTO_TEST_CASE(LMSFilter_size_negative_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  BOOST_CHECK_THROW(filter.set_size(0), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE(LMSFilter_size_set_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  filter.set_size(10);\n  BOOST_CHECK_EQUAL(filter.get_size(), 10);\n}\n\nBOOST_AUTO_TEST_CASE(LMSFilter_memory_negative_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  BOOST_CHECK_THROW(filter.set_memory(0), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE(LMSFilter_memory_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  filter.set_memory(0.5);\n  BOOST_CHECK_EQUAL(filter.get_memory(), 0.5);\n}\n\nBOOST_AUTO_TEST_CASE( LMSFilter_memory_positive1_test )\n{\n  ATK::LMSFilter<float> filter(100);\n  BOOST_CHECK_THROW(filter.set_memory(1), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE( LMSFilter_memory_99_test )\n{\n  std::array<double, PROCESSSIZE> data;\n  {\n    std::ifstream input(ATK_SOURCE_TREE \"\/tests\/data\/input_lms.dat\", std::ios::binary);\n    input.read(reinterpret_cast<char*>(data.data()), PROCESSSIZE * sizeof(double));\n  }\n  \n  ATK::InPointerFilter<double> generator(data.data(), 1, PROCESSSIZE, false);\n  generator.set_output_sampling_rate(48000);\n\n  ATK::LMSFilter<double> filter(100);\n  filter.set_input_sampling_rate(48000);\n  filter.set_output_sampling_rate(48000);\n  filter.set_memory(.999);\n  filter.set_mu(.01);\n  \n  filter.set_input_port(0, &generator, 0);\n  filter.set_input_port(1, &generator, 0);\n  \n  filter.process(PROCESSSIZE);\n\n  std::array<double, PROCESSSIZE> outdata;\n  {\n    std::ifstream input(ATK_SOURCE_TREE \"\/tests\/data\/output_lms.dat\", std::ios::binary);\n    input.read(reinterpret_cast<char*>(outdata.data()), PROCESSSIZE * sizeof(double));\n  }\n\n  for (unsigned int i = 0; i < PROCESSSIZE; ++i)\n  {\n    BOOST_CHECK_CLOSE(outdata[i], filter.get_output_array(0)[i], 0.0001);\n  }\n}\n<commit_msg>Adding mu tests<commit_after>\/**\n * \\ file LMSFilter.cpp\n *\/\n\n#include <array>\n#include <fstream>\n\n#include <ATK\/Adaptive\/LMSFilter.h>\n\n#include <ATK\/Core\/InPointerFilter.h>\n#include <ATK\/Core\/OutPointerFilter.h>\n\n#include <ATK\/Tools\/SumFilter.h>\n\n#include <Eigen\/Core>\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n#include <boost\/math\/constants\/constants.hpp>\n\n#define PROCESSSIZE (1200)\n\nBOOST_AUTO_TEST_CASE(LMSFilter_size_negative_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  BOOST_CHECK_THROW(filter.set_size(0), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE(LMSFilter_size_set_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  filter.set_size(10);\n  BOOST_CHECK_EQUAL(filter.get_size(), 10);\n}\n\nBOOST_AUTO_TEST_CASE(LMSFilter_memory_negative_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  BOOST_CHECK_THROW(filter.set_memory(0), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE(LMSFilter_memory_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  filter.set_memory(0.5);\n  BOOST_CHECK_EQUAL(filter.get_memory(), 0.5);\n}\n\nBOOST_AUTO_TEST_CASE( LMSFilter_memory_positive1_test )\n{\n  ATK::LMSFilter<float> filter(100);\n  BOOST_CHECK_THROW(filter.set_memory(1), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE(LMSFilter_mu_negative_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  BOOST_CHECK_THROW(filter.set_mu(0), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE(LMSFilter_mu_test)\n{\n  ATK::LMSFilter<float> filter(100);\n  filter.set_mu(0.5);\n  BOOST_CHECK_EQUAL(filter.get_mu(), 0.5);\n}\n\nBOOST_AUTO_TEST_CASE( LMSFilter_mu_positive1_test )\n{\n  ATK::LMSFilter<float> filter(100);\n  BOOST_CHECK_THROW(filter.set_mu(1), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE( LMSFilter_memory_99_test )\n{\n  std::array<double, PROCESSSIZE> data;\n  {\n    std::ifstream input(ATK_SOURCE_TREE \"\/tests\/data\/input_lms.dat\", std::ios::binary);\n    input.read(reinterpret_cast<char*>(data.data()), PROCESSSIZE * sizeof(double));\n  }\n  \n  ATK::InPointerFilter<double> generator(data.data(), 1, PROCESSSIZE, false);\n  generator.set_output_sampling_rate(48000);\n\n  ATK::LMSFilter<double> filter(100);\n  filter.set_input_sampling_rate(48000);\n  filter.set_output_sampling_rate(48000);\n  filter.set_memory(.999);\n  filter.set_mu(.01);\n  \n  filter.set_input_port(0, &generator, 0);\n  filter.set_input_port(1, &generator, 0);\n  \n  filter.process(PROCESSSIZE);\n\n  std::array<double, PROCESSSIZE> outdata;\n  {\n    std::ifstream input(ATK_SOURCE_TREE \"\/tests\/data\/output_lms.dat\", std::ios::binary);\n    input.read(reinterpret_cast<char*>(outdata.data()), PROCESSSIZE * sizeof(double));\n  }\n\n  for (unsigned int i = 0; i < PROCESSSIZE; ++i)\n  {\n    BOOST_CHECK_CLOSE(outdata[i], filter.get_output_array(0)[i], 0.0001);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- ARMWinCOFFObjectWriter.cpp - ARM Windows COFF Object Writer -- 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 \"MCTargetDesc\/ARMFixupKinds.h\"\n#include \"llvm\/MC\/MCFixup.h\"\n#include \"llvm\/MC\/MCValue.h\"\n#include \"llvm\/MC\/MCWinCOFFObjectWriter.h\"\n#include \"llvm\/Support\/COFF.h\"\n#include \"llvm\/Support\/Debug.h\"\n\nusing namespace llvm;\n\nnamespace {\nclass ARMWinCOFFObjectWriter : public MCWinCOFFObjectTargetWriter {\npublic:\n  ARMWinCOFFObjectWriter(bool Is64Bit)\n    : MCWinCOFFObjectTargetWriter(COFF::IMAGE_FILE_MACHINE_ARMNT) {\n    assert(!Is64Bit && \"AArch64 support not yet implemented\");\n  }\n  virtual ~ARMWinCOFFObjectWriter() = default;\n\n  unsigned getRelocType(const MCValue &Target, const MCFixup &Fixup,\n                        bool IsCrossSection) const override;\n};\n\nunsigned ARMWinCOFFObjectWriter::getRelocType(const MCValue &Target,\n                                              const MCFixup &Fixup,\n                                              bool IsCrossSection) const {\n  assert(getMachine() == COFF::IMAGE_FILE_MACHINE_ARMNT &&\n         \"AArch64 support not yet implemented\");\n\n  MCSymbolRefExpr::VariantKind Modifier =\n    Target.isAbsolute() ? MCSymbolRefExpr::VK_None : Target.getSymA()->getKind();\n\n  switch (static_cast<unsigned>(Fixup.getKind())) {\n  default: llvm_unreachable(\"unsupported relocation type\");\n  case FK_Data_4:\n    switch (Modifier) {\n    case MCSymbolRefExpr::VK_COFF_IMGREL32:\n      return COFF::IMAGE_REL_ARM_ADDR32NB;\n    case MCSymbolRefExpr::VK_SECREL:\n      return COFF::IMAGE_REL_ARM_SECREL;\n    default:\n      return COFF::IMAGE_REL_ARM_ADDR32;\n    }\n  case ARM::fixup_t2_condbranch:\n    return COFF::IMAGE_REL_ARM_BRANCH20T;\n  case ARM::fixup_t2_uncondbranch:\n    return COFF::IMAGE_REL_ARM_BRANCH24T;\n  case ARM::fixup_arm_thumb_bl:\n  case ARM::fixup_arm_thumb_blx:\n    return COFF::IMAGE_REL_ARM_BLX23T;\n  case ARM::fixup_t2_movw_lo16:\n    return COFF::IMAGE_REL_ARM_MOV32T;\n  case ARM::fixup_t2_movt_hi16:\n    llvm_unreachable(\"High-word for pair-wise relocations are contiguously \"\n                     \"addressed as an IMAGE_REL_ARM_MOV32T relocation\");\n  }\n}\n}\n\nnamespace llvm {\nMCObjectWriter *createARMWinCOFFObjectWriter(raw_ostream &OS, bool Is64Bit) {\n  MCWinCOFFObjectTargetWriter *MOTW = new ARMWinCOFFObjectWriter(Is64Bit);\n  return createWinCOFFObjectWriter(MOTW, OS);\n}\n}\n\n<commit_msg>ARM: MSVC does not support = default<commit_after>\/\/===-- ARMWinCOFFObjectWriter.cpp - ARM Windows COFF Object Writer -- 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 \"MCTargetDesc\/ARMFixupKinds.h\"\n#include \"llvm\/MC\/MCFixup.h\"\n#include \"llvm\/MC\/MCValue.h\"\n#include \"llvm\/MC\/MCWinCOFFObjectWriter.h\"\n#include \"llvm\/Support\/COFF.h\"\n#include \"llvm\/Support\/Debug.h\"\n\nusing namespace llvm;\n\nnamespace {\nclass ARMWinCOFFObjectWriter : public MCWinCOFFObjectTargetWriter {\npublic:\n  ARMWinCOFFObjectWriter(bool Is64Bit)\n    : MCWinCOFFObjectTargetWriter(COFF::IMAGE_FILE_MACHINE_ARMNT) {\n    assert(!Is64Bit && \"AArch64 support not yet implemented\");\n  }\n  virtual ~ARMWinCOFFObjectWriter() { }\n\n  unsigned getRelocType(const MCValue &Target, const MCFixup &Fixup,\n                        bool IsCrossSection) const override;\n};\n\nunsigned ARMWinCOFFObjectWriter::getRelocType(const MCValue &Target,\n                                              const MCFixup &Fixup,\n                                              bool IsCrossSection) const {\n  assert(getMachine() == COFF::IMAGE_FILE_MACHINE_ARMNT &&\n         \"AArch64 support not yet implemented\");\n\n  MCSymbolRefExpr::VariantKind Modifier =\n    Target.isAbsolute() ? MCSymbolRefExpr::VK_None : Target.getSymA()->getKind();\n\n  switch (static_cast<unsigned>(Fixup.getKind())) {\n  default: llvm_unreachable(\"unsupported relocation type\");\n  case FK_Data_4:\n    switch (Modifier) {\n    case MCSymbolRefExpr::VK_COFF_IMGREL32:\n      return COFF::IMAGE_REL_ARM_ADDR32NB;\n    case MCSymbolRefExpr::VK_SECREL:\n      return COFF::IMAGE_REL_ARM_SECREL;\n    default:\n      return COFF::IMAGE_REL_ARM_ADDR32;\n    }\n  case ARM::fixup_t2_condbranch:\n    return COFF::IMAGE_REL_ARM_BRANCH20T;\n  case ARM::fixup_t2_uncondbranch:\n    return COFF::IMAGE_REL_ARM_BRANCH24T;\n  case ARM::fixup_arm_thumb_bl:\n  case ARM::fixup_arm_thumb_blx:\n    return COFF::IMAGE_REL_ARM_BLX23T;\n  case ARM::fixup_t2_movw_lo16:\n    return COFF::IMAGE_REL_ARM_MOV32T;\n  case ARM::fixup_t2_movt_hi16:\n    llvm_unreachable(\"High-word for pair-wise relocations are contiguously \"\n                     \"addressed as an IMAGE_REL_ARM_MOV32T relocation\");\n  }\n}\n}\n\nnamespace llvm {\nMCObjectWriter *createARMWinCOFFObjectWriter(raw_ostream &OS, bool Is64Bit) {\n  MCWinCOFFObjectTargetWriter *MOTW = new ARMWinCOFFObjectWriter(Is64Bit);\n  return createWinCOFFObjectWriter(MOTW, OS);\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\ file ToneStackFilter.cpp\n *\/\n\n#include <ATK\/EQ\/ToneStackFilter.h>\n#include <ATK\/EQ\/IIRFilter.h>\n\n#include <ATK\/Mock\/FFTCheckerFilter.h>\n#include <ATK\/Mock\/SinusGeneratorFilter.h>\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n#define PROCESSSIZE (1024*1024)\n#define SAMPLINGRATE (1024*64)\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low0_100_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(100);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(0);\n  \n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0.9813101780535352));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low0_1k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(1000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(0);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0.6236407269569778));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low0_10k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(10000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(0);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0.525581554888129));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low1_100_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(100);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(1);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 1.0106781785286139));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low1_1k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(1000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(1);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 1.3065626075847556));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low1_10k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(10000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(1);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 1.2770732276129428));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low05_100_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(100);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(.5);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0.99588245799196));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low05_1k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(1000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(.5);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0.9164270318538241));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_low05_10k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(10000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(.5);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0.7559110473244306));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n<commit_msg>Tests OK. Strange though as it is a passive filter. Will check the overall behavior later.<commit_after>\/**\n * \\ file ToneStackFilter.cpp\n *\/\n\n#include <ATK\/EQ\/ToneStackFilter.h>\n#include <ATK\/EQ\/IIRFilter.h>\n\n#include <ATK\/Mock\/FFTCheckerFilter.h>\n#include <ATK\/Mock\/SinusGeneratorFilter.h>\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n#define PROCESSSIZE (1024*1024)\n#define SAMPLINGRATE (1024*64)\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low0_100_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(100);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(0);\n  \n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0.539546227384));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low0_1k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(1000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(0);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0.639908258891));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low0_10k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(10000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(0);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0.785483116609));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low1_100_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(100);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(1);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 1.21437059728));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low1_1k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(1000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(1);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0.526240477328));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low1_10k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(10000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(1);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0.778758646157));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low05_100_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(100);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(.5);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 1.27317612576));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low05_1k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(1000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(.5);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0.528928508155));\n  frequency_checks.push_back(std::make_pair(10000, 0));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( IIRFilter_ToneStackFilter_Bassman_low05_10k_test )\n{\n  ATK::SinusGeneratorFilter<double> generator;\n  generator.set_output_sampling_rate(SAMPLINGRATE);\n  generator.set_amplitude(1);\n  generator.set_frequency(10000);\n  \n  std::unique_ptr<ATK::ToneStackFilterCoefficients<double> > filter(ATK::ToneStackFilterCoefficients<double>::buildBassmanStack());\n  filter->set_input_sampling_rate(SAMPLINGRATE);\n  filter->set_output_sampling_rate(SAMPLINGRATE);\n  filter->set_low(.5);\n\n  ATK::FFTCheckerFilter<double> checker;\n  checker.set_input_sampling_rate(SAMPLINGRATE);\n  std::vector<std::pair<int, double> > frequency_checks;\n  frequency_checks.push_back(std::make_pair(100, 0));\n  frequency_checks.push_back(std::make_pair(1000, 0));\n  frequency_checks.push_back(std::make_pair(10000, 0.778820213842));\n  checker.set_checks(frequency_checks);\n  \n  checker.set_input_port(0, filter.get(), 0);\n  filter->set_input_port(0, &generator, 0);\n\n  filter->process(1024*64);\n\n  checker.process(PROCESSSIZE);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file\n * \\brief MutexPriorityProtocolTestCase class implementation\n *\n * \\author Copyright (C) 2014 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 2014-11-07\n *\/\n\n#include \"MutexPriorityProtocolTestCase.hpp\"\n\n#include \"SequenceAsserter.hpp\"\n#include \"wasteTime.hpp\"\n\n#include \"distortos\/StaticThread.hpp\"\n#include \"distortos\/Mutex.hpp\"\n#include \"distortos\/ThisThread.hpp\"\n#include \"distortos\/statistics.hpp\"\n\n#include \"distortos\/estd\/ContiguousRange.hpp\"\n\nnamespace distortos\n{\n\nnamespace test\n{\n\nnamespace\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local types\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ single test step for test thread\nstruct TestStep\n{\n\t\/\/\/ mutex that will be used by function, nullptr to do nothing in this step\n\tMutex* mutex;\n\n\t\/\/\/ function executed on mutex, nullptr to do nothing in this step\n\tint (Mutex::*function)();\n\n\t\/\/\/ sequence point right before calling function\n\tint sequencePointBefore;\n\n\t\/\/\/ sequence point right after return from function\n\tint sequencePointAfter;\n\n\t\/\/\/ duration wasted after executing function\n\tTickClock::duration duration;\n};\n\n\/\/\/ range with test steps\nusing TestStepRange = estd::ContiguousRange<const TestStep>;\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local constants\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ size of stack for test thread, bytes\nconstexpr size_t testThreadStackSize {384};\n\n\/\/\/ total number of test threads\nconstexpr size_t totalThreads {5};\n\n\/\/\/ duration unit used in test\nconstexpr TickClock::duration durationUnit {8};\n\n\/\/ \"12\" is the length (in durationUnit) of the longest test thread\n\/\/\/ \\todo remove when FIFO scheduling for threads is implemented\nstatic_assert((durationUnit * 12).count() < CONFIG_TICK_RATE_HZ \/ CONFIG_ROUND_ROBIN_RATE_HZ,\n\t\t\"Invalid configuration for test case - there may be no preemptions due to round-robin scheduling.\");\n\n\/\/\/ array with delays of test threads (in durationUnit)\nconst std::array<int, totalThreads> threadDelays\n{{\n\t\t0, 3, 6, 10, 11,\n}};\n\n\/\/\/ number of context switches caused by delayed start of test threads\nconstexpr size_t delayedStartContextSwitchesCount {6};\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local functions' declarations\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nvoid thread(TickClock::time_point sleepUntil, SequenceAsserter& sequenceAsserter, const TestStepRange& steps);\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local types\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ type of test thread\nusing TestThread = decltype(makeStaticThread<testThreadStackSize>({}, thread, std::declval<TickClock::time_point>(),\n\t\tstd::ref(std::declval<SequenceAsserter&>()), std::ref(std::declval<const TestStepRange&>())));\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/**\n * \\brief Test thread.\n *\n * First thing done is going to sleep for requested amount of time. Then all steps from provided TestStepRange are\n * executed:\n * - mark \"before\" sequence point,\n * - if provided, execute function on mutex,\n * - mark \"after\" sequence point,\n * - waste time.\n *\n * \\param [in] sleepUntil is the time_point at which test steps will start to be executed\n * \\param [in] sequenceAsserter is a reference to SequenceAsserter shared object\n * \\param [in] steps is a reference to TestStepRange with test steps for this instance\n *\/\n\nvoid thread(const TickClock::time_point sleepUntil, SequenceAsserter& sequenceAsserter, const TestStepRange& steps)\n{\n\tThisThread::sleepUntil(sleepUntil);\n\n\tfor (const auto& step : steps)\n\t{\n\t\tsequenceAsserter.sequencePoint(step.sequencePointBefore);\n\t\tif (step.mutex != nullptr && step.function != nullptr)\n\t\t\t(step.mutex->*step.function)();\n\t\tsequenceAsserter.sequencePoint(step.sequencePointAfter);\n\t\twasteTime(TickClock::now() + step.duration);\n\t}\n}\n\n\/**\n * \\brief Builder of TestThread objects.\n *\n * \\param [in] priority is the priority of thread\n * \\param [in] sleepUntil is the time_point at which test steps will start to be executed by thread\n * \\param [in] sequenceAsserter is a reference to SequenceAsserter shared object\n * \\param [in] steps is a reference to TestStepRange with test steps for this instance\n *\n * \\return constructed TestThread object\n *\/\n\nTestThread makeTestThread(const uint8_t priority, const TickClock::time_point sleepUntil,\n\t\tSequenceAsserter& sequenceAsserter, const TestStepRange& steps)\n{\n\treturn makeStaticThread<testThreadStackSize>(priority, thread, static_cast<TickClock::time_point>(sleepUntil),\n\t\t\tstd::ref(sequenceAsserter), std::ref(steps));\n}\n\n\/**\n * \\brief Common code to run the test\n *\n * \\param [in] delays is an array with delays for each test thread\n * \\param [in] stepsRanges is an array with TestStepRange elements for each test thread\n * \\param [in] expectedContextSwitchesCount is the expected count of context switches for the whole test\n *\n * \\return true if the test case succeeded, false otherwise\n *\/\n\nbool testRunner(const std::array<int, totalThreads>& delays, const std::array<TestStepRange, totalThreads>& stepsRanges,\n\t\tconst size_t expectedContextSwitchesCount)\n{\n\tconst auto contextSwitchCount = statistics::getContextSwitchCount();\n\n\tSequenceAsserter sequenceAsserter;\n\tconst auto now = TickClock::now();\n\n\tstd::array<TestThread, totalThreads> threads\n\t{{\n\t\t\tmakeTestThread(1, now + durationUnit * delays[0], sequenceAsserter, stepsRanges[0]),\n\t\t\tmakeTestThread(2, now + durationUnit * delays[1], sequenceAsserter, stepsRanges[1]),\n\t\t\tmakeTestThread(3, now + durationUnit * delays[2], sequenceAsserter, stepsRanges[2]),\n\t\t\tmakeTestThread(4, now + durationUnit * delays[3], sequenceAsserter, stepsRanges[3]),\n\t\t\tmakeTestThread(5, now + durationUnit * delays[4], sequenceAsserter, stepsRanges[4]),\n\t}};\n\n\tfor (auto& thread : threads)\n\t\tthread.start();\n\n\tfor (auto& thread : threads)\n\t\tthread.join();\n\n\tif (statistics::getContextSwitchCount() - contextSwitchCount != expectedContextSwitchesCount)\n\t\treturn false;\n\n\tconst auto totalSequencePoints = 2 * (stepsRanges[0].size() + stepsRanges[1].size() + stepsRanges[2].size() +\n\t\t\tstepsRanges[3].size() + stepsRanges[4].size());\n\treturn sequenceAsserter.assertSequence(totalSequencePoints);\n}\n\n}\t\/\/ namespace\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| private functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nbool MutexPriorityProtocolTestCase::run_() const\n{\n\tMutex mutex12 {Mutex::Type::Normal, Mutex::Protocol::PriorityProtect, 2};\t\/\/ shared by thread 1 and 2\n\tMutex mutex13 {Mutex::Type::Normal, Mutex::Protocol::PriorityProtect, 3};\t\/\/ shared by thread 1 and 3\n\tMutex mutex23 {Mutex::Type::Normal, Mutex::Protocol::PriorityProtect, 3};\t\/\/ shared by thread 2 and 3\n\tMutex mutex35 {Mutex::Type::Normal, Mutex::Protocol::PriorityProtect, 5};\t\/\/ shared by thread 3 and 5\n\n\tconst TestStep steps1[]\n\t{\n\t\t\t{nullptr, nullptr, 0, 1, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::lock, 2, 3, durationUnit * 1},\n\t\t\t{&mutex12, &Mutex::lock, 4, 5, durationUnit * 5},\n\t\t\t{&mutex13, &Mutex::unlock, 6, 29, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::lock, 30, 31, durationUnit * 2},\n\t\t\t{&mutex12, &Mutex::unlock, 32, 33, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::unlock, 34, 45, durationUnit * 1},\n\t};\n\tconst TestStep steps2[]\n\t{\n\t\t\t{nullptr, nullptr, 35, 36, durationUnit * 1},\n\t\t\t{&mutex23, &Mutex::lock, 37, 38, durationUnit * 1},\n\t\t\t{&mutex12, &Mutex::lock, 39, 40, durationUnit * 2},\n\t\t\t{&mutex23, &Mutex::unlock, 41, 42, durationUnit * 1},\n\t\t\t{&mutex12, &Mutex::unlock, 43, 44, durationUnit * 1},\n\t};\n\tconst TestStep steps3[]\n\t{\n\t\t\t{nullptr, nullptr, 7, 8, durationUnit * 1},\n\t\t\t{&mutex35, &Mutex::lock, 9, 10, durationUnit * 1},\n\t\t\t{&mutex23, &Mutex::lock, 11, 12, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::lock, 13, 14, durationUnit * 2},\n\t\t\t{&mutex35, &Mutex::unlock, 15, 24, durationUnit * 1},\n\t\t\t{&mutex23, &Mutex::unlock, 25, 26, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::unlock, 27, 28, durationUnit * 1},\n\t};\n\tconst TestStep steps4[]\n\t{\n\t\t\t{nullptr, nullptr, 22, 23, durationUnit * 5},\n\t};\n\tconst TestStep steps5[]\n\t{\n\t\t\t{nullptr, nullptr, 16, 17, durationUnit * 1},\n\t\t\t{&mutex35, &Mutex::lock, 18, 19, durationUnit * 2},\n\t\t\t{&mutex35, &Mutex::unlock, 20, 21, durationUnit * 1},\n\t};\n\tconst std::array<TestStepRange, totalThreads> stepsRanges\n\t{{\n\t\t\tTestStepRange{steps1},\n\t\t\tTestStepRange{steps2},\n\t\t\tTestStepRange{steps3},\n\t\t\tTestStepRange{steps4},\n\t\t\tTestStepRange{steps5},\n\t}};\n\n\treturn testRunner(threadDelays, stepsRanges, 9 + delayedStartContextSwitchesCount);\n}\n\n}\t\/\/ namespace test\n\n}\t\/\/ namespace distortos\n<commit_msg>test: move all code with actual test phase from MutexPriorityProtocolTestCase::run_() into new local function priorityProtectPhase()<commit_after>\/**\n * \\file\n * \\brief MutexPriorityProtocolTestCase class implementation\n *\n * \\author Copyright (C) 2014 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 2014-11-07\n *\/\n\n#include \"MutexPriorityProtocolTestCase.hpp\"\n\n#include \"SequenceAsserter.hpp\"\n#include \"wasteTime.hpp\"\n\n#include \"distortos\/StaticThread.hpp\"\n#include \"distortos\/Mutex.hpp\"\n#include \"distortos\/ThisThread.hpp\"\n#include \"distortos\/statistics.hpp\"\n\n#include \"distortos\/estd\/ContiguousRange.hpp\"\n\nnamespace distortos\n{\n\nnamespace test\n{\n\nnamespace\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local types\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ single test step for test thread\nstruct TestStep\n{\n\t\/\/\/ mutex that will be used by function, nullptr to do nothing in this step\n\tMutex* mutex;\n\n\t\/\/\/ function executed on mutex, nullptr to do nothing in this step\n\tint (Mutex::*function)();\n\n\t\/\/\/ sequence point right before calling function\n\tint sequencePointBefore;\n\n\t\/\/\/ sequence point right after return from function\n\tint sequencePointAfter;\n\n\t\/\/\/ duration wasted after executing function\n\tTickClock::duration duration;\n};\n\n\/\/\/ range with test steps\nusing TestStepRange = estd::ContiguousRange<const TestStep>;\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local constants\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ size of stack for test thread, bytes\nconstexpr size_t testThreadStackSize {384};\n\n\/\/\/ total number of test threads\nconstexpr size_t totalThreads {5};\n\n\/\/\/ duration unit used in test\nconstexpr TickClock::duration durationUnit {8};\n\n\/\/ \"12\" is the length (in durationUnit) of the longest test thread\n\/\/\/ \\todo remove when FIFO scheduling for threads is implemented\nstatic_assert((durationUnit * 12).count() < CONFIG_TICK_RATE_HZ \/ CONFIG_ROUND_ROBIN_RATE_HZ,\n\t\t\"Invalid configuration for test case - there may be no preemptions due to round-robin scheduling.\");\n\n\/\/\/ array with delays of test threads (in durationUnit)\nconst std::array<int, totalThreads> threadDelays\n{{\n\t\t0, 3, 6, 10, 11,\n}};\n\n\/\/\/ number of context switches caused by delayed start of test threads\nconstexpr size_t delayedStartContextSwitchesCount {6};\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local functions' declarations\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nvoid thread(TickClock::time_point sleepUntil, SequenceAsserter& sequenceAsserter, const TestStepRange& steps);\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local types\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ type of test thread\nusing TestThread = decltype(makeStaticThread<testThreadStackSize>({}, thread, std::declval<TickClock::time_point>(),\n\t\tstd::ref(std::declval<SequenceAsserter&>()), std::ref(std::declval<const TestStepRange&>())));\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/**\n * \\brief Test thread.\n *\n * First thing done is going to sleep for requested amount of time. Then all steps from provided TestStepRange are\n * executed:\n * - mark \"before\" sequence point,\n * - if provided, execute function on mutex,\n * - mark \"after\" sequence point,\n * - waste time.\n *\n * \\param [in] sleepUntil is the time_point at which test steps will start to be executed\n * \\param [in] sequenceAsserter is a reference to SequenceAsserter shared object\n * \\param [in] steps is a reference to TestStepRange with test steps for this instance\n *\/\n\nvoid thread(const TickClock::time_point sleepUntil, SequenceAsserter& sequenceAsserter, const TestStepRange& steps)\n{\n\tThisThread::sleepUntil(sleepUntil);\n\n\tfor (const auto& step : steps)\n\t{\n\t\tsequenceAsserter.sequencePoint(step.sequencePointBefore);\n\t\tif (step.mutex != nullptr && step.function != nullptr)\n\t\t\t(step.mutex->*step.function)();\n\t\tsequenceAsserter.sequencePoint(step.sequencePointAfter);\n\t\twasteTime(TickClock::now() + step.duration);\n\t}\n}\n\n\/**\n * \\brief Builder of TestThread objects.\n *\n * \\param [in] priority is the priority of thread\n * \\param [in] sleepUntil is the time_point at which test steps will start to be executed by thread\n * \\param [in] sequenceAsserter is a reference to SequenceAsserter shared object\n * \\param [in] steps is a reference to TestStepRange with test steps for this instance\n *\n * \\return constructed TestThread object\n *\/\n\nTestThread makeTestThread(const uint8_t priority, const TickClock::time_point sleepUntil,\n\t\tSequenceAsserter& sequenceAsserter, const TestStepRange& steps)\n{\n\treturn makeStaticThread<testThreadStackSize>(priority, thread, static_cast<TickClock::time_point>(sleepUntil),\n\t\t\tstd::ref(sequenceAsserter), std::ref(steps));\n}\n\n\/**\n * \\brief Common code to run the test\n *\n * \\param [in] delays is an array with delays for each test thread\n * \\param [in] stepsRanges is an array with TestStepRange elements for each test thread\n * \\param [in] expectedContextSwitchesCount is the expected count of context switches for the whole test\n *\n * \\return true if the test case succeeded, false otherwise\n *\/\n\nbool testRunner(const std::array<int, totalThreads>& delays, const std::array<TestStepRange, totalThreads>& stepsRanges,\n\t\tconst size_t expectedContextSwitchesCount)\n{\n\tconst auto contextSwitchCount = statistics::getContextSwitchCount();\n\n\tSequenceAsserter sequenceAsserter;\n\tconst auto now = TickClock::now();\n\n\tstd::array<TestThread, totalThreads> threads\n\t{{\n\t\t\tmakeTestThread(1, now + durationUnit * delays[0], sequenceAsserter, stepsRanges[0]),\n\t\t\tmakeTestThread(2, now + durationUnit * delays[1], sequenceAsserter, stepsRanges[1]),\n\t\t\tmakeTestThread(3, now + durationUnit * delays[2], sequenceAsserter, stepsRanges[2]),\n\t\t\tmakeTestThread(4, now + durationUnit * delays[3], sequenceAsserter, stepsRanges[3]),\n\t\t\tmakeTestThread(5, now + durationUnit * delays[4], sequenceAsserter, stepsRanges[4]),\n\t}};\n\n\tfor (auto& thread : threads)\n\t\tthread.start();\n\n\tfor (auto& thread : threads)\n\t\tthread.join();\n\n\tif (statistics::getContextSwitchCount() - contextSwitchCount != expectedContextSwitchesCount)\n\t\treturn false;\n\n\tconst auto totalSequencePoints = 2 * (stepsRanges[0].size() + stepsRanges[1].size() + stepsRanges[2].size() +\n\t\t\tstepsRanges[3].size() + stepsRanges[4].size());\n\treturn sequenceAsserter.assertSequence(totalSequencePoints);\n}\n\n\/**\n * \\brief Test phase of PriorityProtect protocol.\n *\n * \\return true if the test phase succeeded, false otherwise\n *\/\n\nbool priorityProtectPhase()\n{\n\tMutex mutex12 {Mutex::Type::Normal, Mutex::Protocol::PriorityProtect, 2};\t\/\/ shared by thread 1 and 2\n\tMutex mutex13 {Mutex::Type::Normal, Mutex::Protocol::PriorityProtect, 3};\t\/\/ shared by thread 1 and 3\n\tMutex mutex23 {Mutex::Type::Normal, Mutex::Protocol::PriorityProtect, 3};\t\/\/ shared by thread 2 and 3\n\tMutex mutex35 {Mutex::Type::Normal, Mutex::Protocol::PriorityProtect, 5};\t\/\/ shared by thread 3 and 5\n\n\tconst TestStep steps1[]\n\t{\n\t\t\t{nullptr, nullptr, 0, 1, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::lock, 2, 3, durationUnit * 1},\n\t\t\t{&mutex12, &Mutex::lock, 4, 5, durationUnit * 5},\n\t\t\t{&mutex13, &Mutex::unlock, 6, 29, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::lock, 30, 31, durationUnit * 2},\n\t\t\t{&mutex12, &Mutex::unlock, 32, 33, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::unlock, 34, 45, durationUnit * 1},\n\t};\n\tconst TestStep steps2[]\n\t{\n\t\t\t{nullptr, nullptr, 35, 36, durationUnit * 1},\n\t\t\t{&mutex23, &Mutex::lock, 37, 38, durationUnit * 1},\n\t\t\t{&mutex12, &Mutex::lock, 39, 40, durationUnit * 2},\n\t\t\t{&mutex23, &Mutex::unlock, 41, 42, durationUnit * 1},\n\t\t\t{&mutex12, &Mutex::unlock, 43, 44, durationUnit * 1},\n\t};\n\tconst TestStep steps3[]\n\t{\n\t\t\t{nullptr, nullptr, 7, 8, durationUnit * 1},\n\t\t\t{&mutex35, &Mutex::lock, 9, 10, durationUnit * 1},\n\t\t\t{&mutex23, &Mutex::lock, 11, 12, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::lock, 13, 14, durationUnit * 2},\n\t\t\t{&mutex35, &Mutex::unlock, 15, 24, durationUnit * 1},\n\t\t\t{&mutex23, &Mutex::unlock, 25, 26, durationUnit * 1},\n\t\t\t{&mutex13, &Mutex::unlock, 27, 28, durationUnit * 1},\n\t};\n\tconst TestStep steps4[]\n\t{\n\t\t\t{nullptr, nullptr, 22, 23, durationUnit * 5},\n\t};\n\tconst TestStep steps5[]\n\t{\n\t\t\t{nullptr, nullptr, 16, 17, durationUnit * 1},\n\t\t\t{&mutex35, &Mutex::lock, 18, 19, durationUnit * 2},\n\t\t\t{&mutex35, &Mutex::unlock, 20, 21, durationUnit * 1},\n\t};\n\tconst std::array<TestStepRange, totalThreads> stepsRanges\n\t{{\n\t\t\tTestStepRange{steps1},\n\t\t\tTestStepRange{steps2},\n\t\t\tTestStepRange{steps3},\n\t\t\tTestStepRange{steps4},\n\t\t\tTestStepRange{steps5},\n\t}};\n\n\treturn testRunner(threadDelays, stepsRanges, 9 + delayedStartContextSwitchesCount);\n}\n\n}\t\/\/ namespace\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| private functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nbool MutexPriorityProtocolTestCase::run_() const\n{\n\treturn priorityProtectPhase();\n}\n\n}\t\/\/ namespace test\n\n}\t\/\/ namespace distortos\n<|endoftext|>"}
{"text":"<commit_before>\n#include <chrono>\n#include <gtest\/gtest.h>\n\n#include \"lw\/event.hpp\"\n\nusing namespace std::chrono_literals;\n\nnamespace lw {\nnamespace tests {\n\nstruct TimeoutTests : public testing::Test {\n    typedef std::chrono::high_resolution_clock clock;\n    typedef clock::time_point time_point;\n\n    static const std::chrono::milliseconds short_delay;\n    static const std::chrono::milliseconds repeat_interval;\n    static const std::chrono::milliseconds max_discrepancy;\n\n    event::Loop loop;\n};\n\nconst std::chrono::milliseconds TimeoutTests::short_delay       = 25ms;\nconst std::chrono::milliseconds TimeoutTests::repeat_interval   =  5ms;\nconst std::chrono::milliseconds TimeoutTests::max_discrepancy   =  2ms;\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\nTEST_F( TimeoutTests, NoDelay ){\n    time_point start;\n    bool resolved = false;\n\n    event::Timeout timeout( loop );\n    timeout.start( 0s ).then([&](){\n        EXPECT_LT( clock::now() - start, max_discrepancy );\n\n        resolved = true;\n    });\n    EXPECT_FALSE( resolved );\n\n    start = clock::now();\n    loop.run();\n    EXPECT_TRUE( resolved );\n}\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\nTEST_F( TimeoutTests, ShortDelay ){\n    time_point start;\n    bool resolved = false;\n\n    event::Timeout timeout( loop );\n    timeout.start( short_delay ).then([&](){\n        auto time_passed = clock::now() - start;\n        EXPECT_LT( time_passed, short_delay + max_discrepancy );\n        EXPECT_GT( time_passed, short_delay - max_discrepancy );\n\n        resolved = true;\n    });\n    EXPECT_FALSE( resolved );\n\n    start = clock::now();\n    loop.run();\n    EXPECT_TRUE( resolved );\n}\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\nTEST_F( TimeoutTests, Repeat ){\n    time_point start;\n    time_point previous_call;\n    int call_count = 0;\n    bool resolved = false;\n\n    event::Timeout timeout( loop );\n    timeout.repeat( repeat_interval, [&]( event::Timeout& repeat_timeout ){\n        ++call_count;\n        time_point call_time = clock::now();\n\n        { \/\/ Check the total delay since starting.\n            auto time_passed = call_time - start;\n            EXPECT_LT(\n                time_passed,\n                (repeat_interval + max_discrepancy) * call_count\n            ) << \"call_count: \" << call_count;\n            EXPECT_GT(\n                time_passed,\n                (repeat_interval - max_discrepancy) * call_count\n            ) << \"call_count: \" << call_count;\n        }\n\n        \/\/ Starting with the second call, start comparing the delay.\n        if( call_count > 1 ){\n            auto time_passed = call_time - previous_call;\n            EXPECT_LT(\n                time_passed,\n                repeat_interval + max_discrepancy\n            ) << \"call_count: \" << call_count;\n            EXPECT_GT(\n                time_passed,\n                repeat_interval - max_discrepancy\n            ) << \"call_count: \" << call_count;\n        }\n\n        previous_call = call_time;\n\n        \/\/ Stop repeating after 4 calls.\n        ASSERT_LT( call_count, 5 );\n        if( call_count == 4 ){\n            repeat_timeout.stop();\n        }\n    }).then([&](){\n        EXPECT_FALSE( resolved );\n        resolved = true;\n    });\n    EXPECT_FALSE( resolved );\n    EXPECT_EQ( 0, call_count );\n\n    start = clock::now();\n    loop.run();\n    EXPECT_EQ( 4, call_count );\n    EXPECT_TRUE( resolved );\n}\n\n}\n}\n<commit_msg>Added stop test<commit_after>\n#include <chrono>\n#include <gtest\/gtest.h>\n\n#include \"lw\/event.hpp\"\n\nusing namespace std::chrono_literals;\n\nnamespace lw {\nnamespace tests {\n\nstruct TimeoutTests : public testing::Test {\n    typedef std::chrono::high_resolution_clock clock;\n    typedef clock::time_point time_point;\n\n    static const std::chrono::milliseconds short_delay;\n    static const std::chrono::milliseconds repeat_interval;\n    static const std::chrono::milliseconds max_discrepancy;\n\n    event::Loop loop;\n};\n\nconst std::chrono::milliseconds TimeoutTests::short_delay       = 25ms;\nconst std::chrono::milliseconds TimeoutTests::repeat_interval   =  5ms;\nconst std::chrono::milliseconds TimeoutTests::max_discrepancy   =  2ms;\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\nTEST_F( TimeoutTests, NoDelay ){\n    time_point start;\n    bool resolved = false;\n\n    event::Timeout timeout( loop );\n    timeout.start( 0s ).then([&](){\n        EXPECT_LT( clock::now() - start, max_discrepancy );\n\n        resolved = true;\n    });\n    EXPECT_FALSE( resolved );\n\n    start = clock::now();\n    loop.run();\n    EXPECT_TRUE( resolved );\n}\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\nTEST_F( TimeoutTests, ShortDelay ){\n    time_point start;\n    bool resolved = false;\n\n    event::Timeout timeout( loop );\n    timeout.start( short_delay ).then([&](){\n        auto time_passed = clock::now() - start;\n        EXPECT_LT( time_passed, short_delay + max_discrepancy );\n        EXPECT_GT( time_passed, short_delay - max_discrepancy );\n\n        resolved = true;\n    });\n    EXPECT_FALSE( resolved );\n\n    start = clock::now();\n    loop.run();\n    EXPECT_TRUE( resolved );\n}\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\nTEST_F( TimeoutTests, Repeat ){\n    time_point start;\n    time_point previous_call;\n    int call_count = 0;\n    bool resolved = false;\n\n    event::Timeout timeout( loop );\n    timeout.repeat( repeat_interval, [&]( event::Timeout& repeat_timeout ){\n        ++call_count;\n        time_point call_time = clock::now();\n\n        { \/\/ Check the total delay since starting.\n            auto time_passed = call_time - start;\n            EXPECT_LT(\n                time_passed,\n                (repeat_interval + max_discrepancy) * call_count\n            ) << \"call_count: \" << call_count;\n            EXPECT_GT(\n                time_passed,\n                (repeat_interval - max_discrepancy) * call_count\n            ) << \"call_count: \" << call_count;\n        }\n\n        \/\/ Starting with the second call, start comparing the delay.\n        if( call_count > 1 ){\n            auto time_passed = call_time - previous_call;\n            EXPECT_LT(\n                time_passed,\n                repeat_interval + max_discrepancy\n            ) << \"call_count: \" << call_count;\n            EXPECT_GT(\n                time_passed,\n                repeat_interval - max_discrepancy\n            ) << \"call_count: \" << call_count;\n        }\n\n        previous_call = call_time;\n\n        \/\/ Stop repeating after 4 calls.\n        ASSERT_LT( call_count, 5 );\n        if( call_count == 4 ){\n            repeat_timeout.stop();\n        }\n    }).then([&](){\n        EXPECT_FALSE( resolved );\n        resolved = true;\n    });\n    EXPECT_FALSE( resolved );\n    EXPECT_EQ( 0, call_count );\n\n    start = clock::now();\n    loop.run();\n    EXPECT_EQ( 4, call_count );\n    EXPECT_TRUE( resolved );\n}\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\nTEST_F( TimeoutTests, Stop ){\n    time_point start;\n    bool rejected = false;\n\n    event::Timeout timeout( loop );\n    timeout.start( short_delay * 5 ).then([&](){\n        FAIL() << \"Timeout promise was resolved, not rejected.\";\n    }, [&]( const error::Exception& err ){\n        EXPECT_EQ( 1, err.error_code() );\n        EXPECT_EQ( (std::string)\"Timeout cancelled.\", err.what() );\n\n        rejected = true;\n    });\n    EXPECT_FALSE( rejected );\n\n    event::wait( loop, short_delay ).then([&](){\n        timeout.stop();\n    });\n\n    start = clock::now();\n    loop.run();\n    EXPECT_TRUE( rejected );\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2010-2013 Joshua Boyce.\r\n\/\/ See the file COPYING for copying permission.\r\n\r\n#include <memory>\r\n#include <string>\r\n#include <vector>\r\n#include <sstream>\r\n#include <iostream>\r\n#include <algorithm>\r\n\r\n#include <hadesmem\/detail\/warning_disable_prefix.hpp>\r\n#include <boost\/program_options.hpp>\r\n#include <hadesmem\/detail\/warning_disable_suffix.hpp>\r\n\r\n#include <windows.h>\r\n\r\n#include <hadesmem\/error.hpp>\r\n#include <hadesmem\/module.hpp>\r\n#include <hadesmem\/region.hpp>\r\n#include <hadesmem\/process.hpp>\r\n#include <hadesmem\/module_list.hpp>\r\n#include <hadesmem\/region_list.hpp>\r\n#include <hadesmem\/pelib\/export.hpp>\r\n#include <hadesmem\/process_list.hpp>\r\n#include <hadesmem\/process_entry.hpp>\r\n#include <hadesmem\/pelib\/pe_file.hpp>\r\n#include <hadesmem\/pelib\/import_dir.hpp>\r\n#include <hadesmem\/detail\/initialize.hpp>\r\n#include <hadesmem\/pelib\/export_list.hpp>\r\n#include <hadesmem\/pelib\/import_thunk.hpp>\r\n#include <hadesmem\/pelib\/import_dir_list.hpp>\r\n#include <hadesmem\/pelib\/import_thunk_list.hpp>\r\n\r\nnamespace\r\n{\r\n\r\nstd::wstring PtrToString(void const* const ptr)\r\n{\r\n  std::wostringstream str;\r\n  str.imbue(std::locale::classic());\r\n  str << std::hex << reinterpret_cast<DWORD_PTR>(ptr);\r\n  return str.str();\r\n}\r\n\r\nvoid DumpRegions(hadesmem::Process const& process)\r\n{\r\n  std::wcout << \"\\nRegions:\\n\";\r\n\r\n  hadesmem::RegionList const regions(process);\r\n  for (auto const& region : regions)\r\n  {\r\n    std::wcout << \"\\n\";\r\n    std::wcout << \"\\tBase: \" << PtrToString(region.GetBase()) << \"\\n\";\r\n    std::wcout << \"\\tAllocation Base: \" \r\n      << PtrToString(region.GetAllocBase()) << \"\\n\";\r\n    std::wcout << \"\\tAllocation Protect: \" << std::hex \r\n      << region.GetAllocProtect() << std::dec << \"\\n\";\r\n    std::wcout << \"\\tSize: \" << std::hex << region.GetSize() << std::dec \r\n      << \"\\n\";\r\n    std::wcout << \"\\tState: \" << std::hex << region.GetState() << std::dec \r\n      << \"\\n\";\r\n    std::wcout << \"\\tProtect: \" << std::hex << region.GetProtect() \r\n      << std::dec << \"\\n\";\r\n    std::wcout << \"\\tType: \" << std::hex << region.GetType() << std::dec \r\n      << \"\\n\";\r\n  }\r\n}\r\n\r\nvoid DumpExports(hadesmem::Process const& process, \r\n  hadesmem::Module const& module)\r\n{\r\n  std::wcout << \"\\n\\tExports:\\n\";\r\n\r\n  hadesmem::PeFile pe_file(process, module.GetHandle(), \r\n    hadesmem::PeFileType::Image);\r\n  hadesmem::ExportList exports(process, pe_file);\r\n  for (auto const& e : exports)\r\n  {\r\n    std::wcout << std::boolalpha;\r\n    std::wcout << \"\\n\";\r\n    std::wcout << \"\\t\\tRVA: \" << std::hex << e.GetRva() << std::dec << \"\\n\";\r\n    std::wcout << \"\\t\\tVA: \" << PtrToString(e.GetVa()) << \"\\n\";\r\n    std::wcout << \"\\t\\tName: \" << e.GetName().c_str() << \"\\n\";\r\n    std::wcout << \"\\t\\tOrdinal: \" << e.GetOrdinal() << \"\\n\";\r\n    std::wcout << \"\\t\\tByName: \" << e.ByName() << \"\\n\";\r\n    std::wcout << \"\\t\\tByOrdinal: \" << e.ByOrdinal() << \"\\n\";\r\n    std::wcout << \"\\t\\tIsForwarded: \" << e.IsForwarded() << \"\\n\";\r\n    std::wcout << \"\\t\\tForwarder: \" << e.GetForwarder().c_str() << \"\\n\";\r\n    std::wcout << \"\\t\\tForwarderModule: \" << e.GetForwarderModule().c_str() << \r\n      \"\\n\";\r\n    std::wcout << \"\\t\\tForwarderFunction: \" << \r\n      e.GetForwarderFunction().c_str() << \"\\n\";\r\n    std::wcout << \"\\t\\tIsForwardedByOrdinal: \" << e.IsForwardedByOrdinal() << \r\n      \"\\n\";\r\n    if (e.IsForwardedByOrdinal())\r\n    {\r\n      try\r\n      {\r\n        std::wcout << \"\\t\\tForwarderOrdinal: \" << e.GetForwarderOrdinal() << \r\n          \"\\n\";\r\n      }\r\n      catch (std::exception const& \/*e*\/)\r\n      {\r\n        std::wcout << \"\\t\\tForwarderOrdinal Invalid.\\n\";\r\n      }\r\n    }\r\n    std::wcout << std::noboolalpha;\r\n  }\r\n}\r\n\r\nvoid DumpImports(hadesmem::Process const& process, \r\n  hadesmem::Module const& module)\r\n{\r\n  std::wcout << \"\\n\\tImport Dirs:\\n\";\r\n\r\n  hadesmem::PeFile pe_file(process, module.GetHandle(), \r\n    hadesmem::PeFileType::Image);\r\n  hadesmem::ImportDirList import_dirs(process, pe_file);\r\n  for (auto const& dir : import_dirs)\r\n  {\r\n    std::wcout << std::boolalpha;\r\n\r\n    std::wcout << \"\\n\";\r\n    std::wcout << \"\\t\\tCharacteristics: \" << std::hex << \r\n      dir.GetCharacteristics() << std::dec << \"\\n\";\r\n    std::wcout << \"\\t\\tTimeDateStamp: \" << dir.GetTimeDateStamp() << \"\\n\";\r\n    std::wcout << \"\\t\\tForwarderChain: \" << dir.GetForwarderChain() << \"\\n\";\r\n    std::wcout << \"\\t\\tName (Raw): \" << std::hex << dir.GetNameRaw() << \r\n      std::dec << \"\\n\";\r\n    std::wcout << \"\\t\\tName: \" << dir.GetName().c_str() << \"\\n\";\r\n    std::wcout << \"\\t\\tFirstThunk: \" << std::hex << dir.GetFirstThunk() << \r\n      std::dec << \"\\n\";\r\n\r\n    std::wcout << \"\\n\\t\\tImport Thunks:\\n\";\r\n\r\n    \/\/ Images without an INT are valid, but after an image like this is loaded \r\n    \/\/ it is impossible to recover the name table.\r\n    if (!dir.GetCharacteristics())\r\n    {\r\n      std::wcout << \"\\n\\t\\t\\tWARNING! No INT for this module.\\n\";\r\n      continue;\r\n    }\r\n\r\n    hadesmem::ImportThunkList import_thunks(process, pe_file, \r\n      dir.GetCharacteristics());\r\n    for (auto const& thunk : import_thunks)\r\n    {\r\n      std::wcout << \"\\n\";\r\n      std::wcout << \"\\t\\t\\tAddressOfData: \" << thunk.GetAddressOfData() \r\n        << \"\\n\";\r\n      std::wcout << \"\\t\\t\\tOrdinalRaw: \" << thunk.GetOrdinalRaw() << \"\\n\";\r\n      std::wcout << \"\\t\\t\\tByOrdinal: \" << thunk.ByOrdinal() << \"\\n\";\r\n      if (thunk.ByOrdinal())\r\n      {\r\n        std::wcout << \"\\t\\t\\tOrdinal: \" << thunk.GetOrdinal() << \"\\n\";\r\n      }\r\n      else\r\n      {\r\n        std::wcout << \"\\t\\t\\tHint: \" << thunk.GetHint() << \"\\n\";\r\n        std::wcout << \"\\t\\t\\tName: \" << thunk.GetName().c_str() << \"\\n\";\r\n      }\r\n      std::wcout << \"\\t\\t\\tFunction: \" << std::hex << thunk.GetFunction() << \r\n        std::dec << \"\\n\";\r\n    }\r\n\r\n    std::wcout << std::noboolalpha;\r\n  }\r\n}\r\n\r\nvoid DumpModules(hadesmem::Process const& process)\r\n{\r\n  std::wcout << \"\\nModules:\\n\";\r\n\r\n  hadesmem::ModuleList const modules(process);\r\n  for (auto const& module : modules)\r\n  {\r\n    std::wcout << \"\\n\";\r\n    std::wcout << \"\\tHandle: \" << PtrToString(module.GetHandle()) << \"\\n\";\r\n    std::wcout << \"\\tSize: \" << std::hex << module.GetSize() << std::dec \r\n      << \"\\n\";\r\n    std::wcout << \"\\tName: \" << module.GetName() << \"\\n\";\r\n    std::wcout << \"\\tPath: \" << module.GetPath() << \"\\n\";\r\n\r\n    DumpExports(process, module);\r\n\r\n    DumpImports(process, module);\r\n  }\r\n}\r\n\r\nvoid DumpProcessEntry(hadesmem::ProcessEntry const& process_entry)\r\n{\r\n  std::wcout << \"\\n\";\r\n  std::wcout << \"ID: \" << process_entry.GetId() << \"\\n\";\r\n  std::wcout << \"Threads: \" << process_entry.GetThreads() << \"\\n\";\r\n  std::wcout << \"Parent: \" << process_entry.GetParentId() << \"\\n\";\r\n  std::wcout << \"Priority: \" << process_entry.GetPriority() << \"\\n\";\r\n  std::wcout << \"Name: \" << process_entry.GetName() << \"\\n\";\r\n\r\n  std::unique_ptr<hadesmem::Process> process;\r\n  try\r\n  {\r\n    process.reset(new hadesmem::Process(process_entry.GetId()));\r\n  }\r\n  catch (std::exception const& \/*e*\/)\r\n  {\r\n    std::wcout << \"\\nCould not open process for further inspection.\\n\\n\";\r\n    return;\r\n  }\r\n\r\n  std::wcout << \"Path: \" << hadesmem::GetPath(*process) << \"\\n\";\r\n  std::wcout << \"WoW64: \" << (hadesmem::IsWoW64(*process) ? \"Yes\" : \"No\") \r\n    << \"\\n\";\r\n\r\n  DumpModules(*process);\r\n\r\n  DumpRegions(*process);\r\n}\r\n\r\n}\r\n\r\nint main(int \/*argc*\/, char* \/*argv*\/[]) \r\n{\r\n  try\r\n  {\r\n    hadesmem::detail::DisableUserModeCallbackExceptionFilter();\r\n    hadesmem::detail::EnableCrtDebugFlags();\r\n    hadesmem::detail::EnableTerminationOnHeapCorruption();\r\n    hadesmem::detail::EnableBottomUpRand();\r\n    hadesmem::detail::ImbueAllDefault();\r\n\r\n    std::cout << \"HadesMem Dumper\\n\";\r\n\r\n    boost::program_options::options_description opts_desc(\r\n      \"General options\");\r\n    opts_desc.add_options()\r\n      (\"help\", \"produce help message\")\r\n      (\"pid\", boost::program_options::value<DWORD>(), \"process id\")\r\n      ;\r\n\r\n    std::vector<std::wstring> const args = boost::program_options::\r\n      split_winmain(GetCommandLine());\r\n    boost::program_options::variables_map var_map;\r\n    boost::program_options::store(boost::program_options::wcommand_line_parser(\r\n      args).options(opts_desc).run(), var_map);\r\n    boost::program_options::notify(var_map);\r\n\r\n    if (var_map.count(\"help\"))\r\n    {\r\n      std::cout << '\\n' << opts_desc << '\\n';\r\n      return 1;\r\n    }\r\n\r\n    DWORD pid = 0;\r\n    if (var_map.count(\"pid\"))\r\n    {\r\n      pid = var_map[\"pid\"].as<DWORD>();\r\n    }\r\n\r\n    try\r\n    {\r\n      hadesmem::GetSeDebugPrivilege();\r\n\r\n      std::wcout << \"\\nAcquired SeDebugPrivilege.\\n\";\r\n    }\r\n    catch (std::exception const& \/*e*\/)\r\n    {\r\n      std::wcout << \"\\nFailed to acquire SeDebugPrivilege.\\n\";\r\n    }\r\n\r\n    if (pid)\r\n    {\r\n      hadesmem::ProcessList const processes;\r\n      auto iter = std::find_if(std::begin(processes), std::end(processes), \r\n        [pid] (hadesmem::ProcessEntry const& process_entry)\r\n        {\r\n          return process_entry.GetId() == pid;\r\n        });\r\n      if (iter != std::end(processes))\r\n      {\r\n        DumpProcessEntry(*iter);\r\n      }\r\n      else\r\n      {\r\n        HADESMEM_THROW_EXCEPTION(hadesmem::Error() << \r\n          hadesmem::ErrorString(\"Failed to find requested process.\"));\r\n      }\r\n    }\r\n    else\r\n    {\r\n      std::wcout << \"\\nProcesses:\\n\";\r\n\r\n      hadesmem::ProcessList const processes;\r\n      for (auto const& process_entry : processes)\r\n      {\r\n        DumpProcessEntry(process_entry);\r\n      }\r\n    }\r\n\r\n    return 0;\r\n  }\r\n  catch (std::exception const& e)\r\n  {\r\n    std::cerr << \"\\nError!\\n\";\r\n    std::cerr << boost::diagnostic_information(e) << '\\n';\r\n\r\n    return 1;\r\n  }\r\n}\r\n<commit_msg>* Formatting and output improvement.<commit_after>\/\/ Copyright (C) 2010-2013 Joshua Boyce.\r\n\/\/ See the file COPYING for copying permission.\r\n\r\n#include <memory>\r\n#include <string>\r\n#include <vector>\r\n#include <sstream>\r\n#include <iostream>\r\n#include <algorithm>\r\n\r\n#include <hadesmem\/detail\/warning_disable_prefix.hpp>\r\n#include <boost\/program_options.hpp>\r\n#include <hadesmem\/detail\/warning_disable_suffix.hpp>\r\n\r\n#include <windows.h>\r\n\r\n#include <hadesmem\/error.hpp>\r\n#include <hadesmem\/module.hpp>\r\n#include <hadesmem\/region.hpp>\r\n#include <hadesmem\/process.hpp>\r\n#include <hadesmem\/module_list.hpp>\r\n#include <hadesmem\/region_list.hpp>\r\n#include <hadesmem\/pelib\/export.hpp>\r\n#include <hadesmem\/process_list.hpp>\r\n#include <hadesmem\/process_entry.hpp>\r\n#include <hadesmem\/pelib\/pe_file.hpp>\r\n#include <hadesmem\/pelib\/import_dir.hpp>\r\n#include <hadesmem\/detail\/initialize.hpp>\r\n#include <hadesmem\/pelib\/export_list.hpp>\r\n#include <hadesmem\/pelib\/import_thunk.hpp>\r\n#include <hadesmem\/pelib\/import_dir_list.hpp>\r\n#include <hadesmem\/pelib\/import_thunk_list.hpp>\r\n\r\nnamespace\r\n{\r\n\r\nstd::wstring PtrToString(void const* const ptr)\r\n{\r\n  std::wostringstream str;\r\n  str.imbue(std::locale::classic());\r\n  str << std::hex << reinterpret_cast<DWORD_PTR>(ptr);\r\n  return str.str();\r\n}\r\n\r\nvoid DumpRegions(hadesmem::Process const& process)\r\n{\r\n  std::wcout << \"\\nRegions:\\n\";\r\n\r\n  hadesmem::RegionList const regions(process);\r\n  for (auto const& region : regions)\r\n  {\r\n    std::wcout << \"\\n\";\r\n    std::wcout << \"\\tBase: \" << PtrToString(region.GetBase()) << \"\\n\";\r\n    std::wcout << \"\\tAllocation Base: \" \r\n      << PtrToString(region.GetAllocBase()) << \"\\n\";\r\n    std::wcout << \"\\tAllocation Protect: \" << std::hex \r\n      << region.GetAllocProtect() << std::dec << \"\\n\";\r\n    std::wcout << \"\\tSize: \" << std::hex << region.GetSize() << std::dec \r\n      << \"\\n\";\r\n    std::wcout << \"\\tState: \" << std::hex << region.GetState() << std::dec \r\n      << \"\\n\";\r\n    std::wcout << \"\\tProtect: \" << std::hex << region.GetProtect() \r\n      << std::dec << \"\\n\";\r\n    std::wcout << \"\\tType: \" << std::hex << region.GetType() << std::dec \r\n      << \"\\n\";\r\n  }\r\n}\r\n\r\nvoid DumpExports(hadesmem::Process const& process, \r\n  hadesmem::Module const& module)\r\n{\r\n  std::wcout << \"\\n\\tExports:\\n\";\r\n\r\n  hadesmem::PeFile pe_file(process, module.GetHandle(), \r\n    hadesmem::PeFileType::Image);\r\n  hadesmem::ExportList exports(process, pe_file);\r\n  for (auto const& e : exports)\r\n  {\r\n    std::wcout << std::boolalpha;\r\n    std::wcout << \"\\n\";\r\n    std::wcout << \"\\t\\tRVA: \" << std::hex << e.GetRva() << std::dec << \"\\n\";\r\n    std::wcout << \"\\t\\tVA: \" << PtrToString(e.GetVa()) << \"\\n\";\r\n    std::wcout << \"\\t\\tName: \" << e.GetName().c_str() << \"\\n\";\r\n    std::wcout << \"\\t\\tOrdinal: \" << e.GetOrdinal() << \"\\n\";\r\n    std::wcout << \"\\t\\tByName: \" << e.ByName() << \"\\n\";\r\n    std::wcout << \"\\t\\tByOrdinal: \" << e.ByOrdinal() << \"\\n\";\r\n    std::wcout << \"\\t\\tIsForwarded: \" << e.IsForwarded() << \"\\n\";\r\n    if (e.IsForwarded())\r\n    {\r\n      std::wcout << \"\\t\\tForwarder: \" << e.GetForwarder().c_str() << \"\\n\";\r\n      std::wcout << \"\\t\\tForwarderModule: \" << e.GetForwarderModule().c_str() \r\n        << \"\\n\";\r\n      std::wcout << \"\\t\\tForwarderFunction: \" << \r\n        e.GetForwarderFunction().c_str() << \"\\n\";\r\n      std::wcout << \"\\t\\tIsForwardedByOrdinal: \" << e.IsForwardedByOrdinal() << \r\n        \"\\n\";\r\n      if (e.IsForwardedByOrdinal())\r\n      {\r\n        try\r\n        {\r\n          std::wcout << \"\\t\\tForwarderOrdinal: \" << e.GetForwarderOrdinal() << \r\n            \"\\n\";\r\n        }\r\n        catch (std::exception const& \/*e*\/)\r\n        {\r\n          std::wcout << \"\\t\\tForwarderOrdinal Invalid.\\n\";\r\n        }\r\n      }\r\n    }\r\n    std::wcout << std::noboolalpha;\r\n  }\r\n}\r\n\r\nvoid DumpImports(hadesmem::Process const& process, \r\n  hadesmem::Module const& module)\r\n{\r\n  std::wcout << \"\\n\\tImport Dirs:\\n\";\r\n\r\n  hadesmem::PeFile pe_file(process, module.GetHandle(), \r\n    hadesmem::PeFileType::Image);\r\n  hadesmem::ImportDirList import_dirs(process, pe_file);\r\n  for (auto const& dir : import_dirs)\r\n  {\r\n    std::wcout << std::boolalpha;\r\n\r\n    std::wcout << \"\\n\";\r\n    std::wcout << \"\\t\\tCharacteristics: \" << std::hex << \r\n      dir.GetCharacteristics() << std::dec << \"\\n\";\r\n    std::wcout << \"\\t\\tTimeDateStamp: \" << dir.GetTimeDateStamp() << \"\\n\";\r\n    std::wcout << \"\\t\\tForwarderChain: \" << dir.GetForwarderChain() << \"\\n\";\r\n    std::wcout << \"\\t\\tName (Raw): \" << std::hex << dir.GetNameRaw() << \r\n      std::dec << \"\\n\";\r\n    std::wcout << \"\\t\\tName: \" << dir.GetName().c_str() << \"\\n\";\r\n    std::wcout << \"\\t\\tFirstThunk: \" << std::hex << dir.GetFirstThunk() << \r\n      std::dec << \"\\n\";\r\n\r\n    std::wcout << \"\\n\\t\\tImport Thunks:\\n\";\r\n\r\n    \/\/ Images without an INT are valid, but after an image like this is loaded \r\n    \/\/ it is impossible to recover the name table.\r\n    if (!dir.GetCharacteristics())\r\n    {\r\n      std::wcout << \"\\n\\t\\t\\tWARNING! No INT for this module.\\n\";\r\n      continue;\r\n    }\r\n\r\n    hadesmem::ImportThunkList import_thunks(process, pe_file, \r\n      dir.GetCharacteristics());\r\n    for (auto const& thunk : import_thunks)\r\n    {\r\n      std::wcout << \"\\n\";\r\n      std::wcout << \"\\t\\t\\tAddressOfData: \" << thunk.GetAddressOfData() \r\n        << \"\\n\";\r\n      std::wcout << \"\\t\\t\\tOrdinalRaw: \" << thunk.GetOrdinalRaw() << \"\\n\";\r\n      std::wcout << \"\\t\\t\\tByOrdinal: \" << thunk.ByOrdinal() << \"\\n\";\r\n      if (thunk.ByOrdinal())\r\n      {\r\n        std::wcout << \"\\t\\t\\tOrdinal: \" << thunk.GetOrdinal() << \"\\n\";\r\n      }\r\n      else\r\n      {\r\n        std::wcout << \"\\t\\t\\tHint: \" << thunk.GetHint() << \"\\n\";\r\n        std::wcout << \"\\t\\t\\tName: \" << thunk.GetName().c_str() << \"\\n\";\r\n      }\r\n      std::wcout << \"\\t\\t\\tFunction: \" << std::hex << thunk.GetFunction() << \r\n        std::dec << \"\\n\";\r\n    }\r\n\r\n    std::wcout << std::noboolalpha;\r\n  }\r\n}\r\n\r\nvoid DumpModules(hadesmem::Process const& process)\r\n{\r\n  std::wcout << \"\\nModules:\\n\";\r\n\r\n  hadesmem::ModuleList const modules(process);\r\n  for (auto const& module : modules)\r\n  {\r\n    std::wcout << \"\\n\";\r\n    std::wcout << \"\\tHandle: \" << PtrToString(module.GetHandle()) << \"\\n\";\r\n    std::wcout << \"\\tSize: \" << std::hex << module.GetSize() << std::dec \r\n      << \"\\n\";\r\n    std::wcout << \"\\tName: \" << module.GetName() << \"\\n\";\r\n    std::wcout << \"\\tPath: \" << module.GetPath() << \"\\n\";\r\n\r\n    DumpExports(process, module);\r\n\r\n    DumpImports(process, module);\r\n  }\r\n}\r\n\r\nvoid DumpProcessEntry(hadesmem::ProcessEntry const& process_entry)\r\n{\r\n  std::wcout << \"\\n\";\r\n  std::wcout << \"ID: \" << process_entry.GetId() << \"\\n\";\r\n  std::wcout << \"Threads: \" << process_entry.GetThreads() << \"\\n\";\r\n  std::wcout << \"Parent: \" << process_entry.GetParentId() << \"\\n\";\r\n  std::wcout << \"Priority: \" << process_entry.GetPriority() << \"\\n\";\r\n  std::wcout << \"Name: \" << process_entry.GetName() << \"\\n\";\r\n\r\n  std::unique_ptr<hadesmem::Process> process;\r\n  try\r\n  {\r\n    process.reset(new hadesmem::Process(process_entry.GetId()));\r\n  }\r\n  catch (std::exception const& \/*e*\/)\r\n  {\r\n    std::wcout << \"\\nCould not open process for further inspection.\\n\\n\";\r\n    return;\r\n  }\r\n\r\n  std::wcout << \"Path: \" << hadesmem::GetPath(*process) << \"\\n\";\r\n  std::wcout << \"WoW64: \" << (hadesmem::IsWoW64(*process) ? \"Yes\" : \"No\") \r\n    << \"\\n\";\r\n\r\n  DumpModules(*process);\r\n\r\n  DumpRegions(*process);\r\n}\r\n\r\n}\r\n\r\nint main(int \/*argc*\/, char* \/*argv*\/[]) \r\n{\r\n  try\r\n  {\r\n    hadesmem::detail::DisableUserModeCallbackExceptionFilter();\r\n    hadesmem::detail::EnableCrtDebugFlags();\r\n    hadesmem::detail::EnableTerminationOnHeapCorruption();\r\n    hadesmem::detail::EnableBottomUpRand();\r\n    hadesmem::detail::ImbueAllDefault();\r\n\r\n    std::cout << \"HadesMem Dumper\\n\";\r\n\r\n    boost::program_options::options_description opts_desc(\r\n      \"General options\");\r\n    opts_desc.add_options()\r\n      (\"help\", \"produce help message\")\r\n      (\"pid\", boost::program_options::value<DWORD>(), \"process id\")\r\n      ;\r\n\r\n    std::vector<std::wstring> const args = boost::program_options::\r\n      split_winmain(GetCommandLine());\r\n    boost::program_options::variables_map var_map;\r\n    boost::program_options::store(boost::program_options::wcommand_line_parser(\r\n      args).options(opts_desc).run(), var_map);\r\n    boost::program_options::notify(var_map);\r\n\r\n    if (var_map.count(\"help\"))\r\n    {\r\n      std::cout << '\\n' << opts_desc << '\\n';\r\n      return 1;\r\n    }\r\n\r\n    DWORD pid = 0;\r\n    if (var_map.count(\"pid\"))\r\n    {\r\n      pid = var_map[\"pid\"].as<DWORD>();\r\n    }\r\n\r\n    try\r\n    {\r\n      hadesmem::GetSeDebugPrivilege();\r\n\r\n      std::wcout << \"\\nAcquired SeDebugPrivilege.\\n\";\r\n    }\r\n    catch (std::exception const& \/*e*\/)\r\n    {\r\n      std::wcout << \"\\nFailed to acquire SeDebugPrivilege.\\n\";\r\n    }\r\n\r\n    if (pid)\r\n    {\r\n      hadesmem::ProcessList const processes;\r\n      auto iter = std::find_if(std::begin(processes), std::end(processes), \r\n        [pid] (hadesmem::ProcessEntry const& process_entry)\r\n        {\r\n          return process_entry.GetId() == pid;\r\n        });\r\n      if (iter != std::end(processes))\r\n      {\r\n        DumpProcessEntry(*iter);\r\n      }\r\n      else\r\n      {\r\n        HADESMEM_THROW_EXCEPTION(hadesmem::Error() << \r\n          hadesmem::ErrorString(\"Failed to find requested process.\"));\r\n      }\r\n    }\r\n    else\r\n    {\r\n      std::wcout << \"\\nProcesses:\\n\";\r\n\r\n      hadesmem::ProcessList const processes;\r\n      for (auto const& process_entry : processes)\r\n      {\r\n        DumpProcessEntry(process_entry);\r\n      }\r\n    }\r\n\r\n    return 0;\r\n  }\r\n  catch (std::exception const& e)\r\n  {\r\n    std::cerr << \"\\nError!\\n\";\r\n    std::cerr << boost::diagnostic_information(e) << '\\n';\r\n\r\n    return 1;\r\n  }\r\n}\r\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\/popo\/rpc_header.hpp\"\n\n#include \"iceoryx_posh\/testing\/mocks\/chunk_mock.hpp\"\n#include \"test.hpp\"\n\nnamespace\n{\nusing namespace ::testing;\nusing namespace iox::popo;\n\nclass RpcBaseHeaderAccess : public RpcBaseHeader\n{\n  public:\n    using RpcBaseHeader::m_clientQueueUniquePortId;\n    using RpcBaseHeader::m_lastKnownClientQueueIndex;\n};\n\nclass RpcBaseHeader_test : public Test\n{\n  public:\n    void SetUp() override\n    {\n    }\n\n    void TearDown() override\n    {\n    }\n\n    ChunkMock<bool, RpcBaseHeader> chunk;\n    RpcBaseHeader* sut{new (chunk.userHeader())\n                           RpcBaseHeader(iox::UniquePortId(), 73, 37, RpcBaseHeader::RPC_HEADER_VERSION)};\n};\n\nvoid checkRpcBaseHeader(const RpcBaseHeaderAccess* sut,\n                        const iox::UniquePortId& clientQueueUniquePortId,\n                        const uint32_t lastKnownClientQueueIndex,\n                        const int64_t sequenceId,\n                        const uint8_t rpcHeaderVersion = RpcBaseHeader::RPC_HEADER_VERSION)\n{\n    EXPECT_THAT(sut->getRpcHeaderVersion(), rpcHeaderVersion);\n    EXPECT_THAT(sut->m_clientQueueUniquePortId, Eq(clientQueueUniquePortId));\n    EXPECT_THAT(sut->m_lastKnownClientQueueIndex, lastKnownClientQueueIndex);\n    EXPECT_THAT(sut->getSequenceId(), Eq(sequenceId));\n}\n\nTEST_F(RpcBaseHeader_test, ConstructorWorks)\n{\n    const iox::UniquePortId clientQueueUniquePortId;\n    constexpr uint32_t LAST_KNOWN_CLIENT_QUEUE_INDEX{13};\n    constexpr int64_t SEQUENCE_ID{42};\n    constexpr uint8_t RPC_HEADER_VERSION{222};\n\n    ChunkMock<bool, RpcBaseHeader> chunk;\n    new (chunk.userHeader())\n        RpcBaseHeader(clientQueueUniquePortId, LAST_KNOWN_CLIENT_QUEUE_INDEX, SEQUENCE_ID, RPC_HEADER_VERSION);\n\n    checkRpcBaseHeader(static_cast<RpcBaseHeaderAccess*>(chunk.userHeader()),\n                       clientQueueUniquePortId,\n                       LAST_KNOWN_CLIENT_QUEUE_INDEX,\n                       SEQUENCE_ID,\n                       RPC_HEADER_VERSION);\n}\n\nTEST_F(RpcBaseHeader_test, GetChunkHeaderFunctionFromNonConstContextWorks)\n{\n    EXPECT_THAT(static_cast<RpcBaseHeader*>(sut)->getChunkHeader(), Eq(chunk.chunkHeader()));\n}\n\nTEST_F(RpcBaseHeader_test, GetChunkHeaderFunctionFromConstContextWorks)\n{\n    EXPECT_THAT(static_cast<const RpcBaseHeader*>(sut)->getChunkHeader(), Eq(chunk.chunkHeader()));\n}\n\nTEST_F(RpcBaseHeader_test, GetChunkHeaderFunctionCalledFromNonConstContextReturnsNonConstType)\n{\n    auto isNonConstReturn =\n        std::is_same<decltype(std::declval<RpcBaseHeader>().getChunkHeader()), iox::mepoo::ChunkHeader*>::value;\n    EXPECT_TRUE(isNonConstReturn);\n}\n\nTEST_F(RpcBaseHeader_test, GetChunkHeaderFunctionCalledFromConstContextReturnsConstType)\n{\n    auto isConstReturn = std::is_same<decltype(std::declval<const RpcBaseHeader>().getChunkHeader()),\n                                      const iox::mepoo::ChunkHeader*>::value;\n    EXPECT_TRUE(isConstReturn);\n}\n\nTEST_F(RpcBaseHeader_test, GetUserPayloadFunctionFromNonConstContextWorks)\n{\n    EXPECT_THAT(static_cast<RpcBaseHeader*>(sut)->getUserPayload(), Eq(chunk.chunkHeader()->userPayload()));\n}\n\nTEST_F(RpcBaseHeader_test, GetUserPayloadFunctionFromConstContextWorks)\n{\n    EXPECT_THAT(static_cast<const RpcBaseHeader*>(sut)->getUserPayload(), Eq(chunk.chunkHeader()->userPayload()));\n}\n\nTEST_F(RpcBaseHeader_test, GetUserPayloadFunctionCalledFromNonConstContextReturnsNonConstType)\n{\n    auto isNonConstReturn = std::is_same<decltype(std::declval<RpcBaseHeader>().getUserPayload()), void*>::value;\n    EXPECT_TRUE(isNonConstReturn);\n}\n\nTEST_F(RpcBaseHeader_test, GetUserPayloadFunctionCalledFromConstContextReturnsConstType)\n{\n    auto isConstReturn =\n        std::is_same<decltype(std::declval<const RpcBaseHeader>().getUserPayload()), const void*>::value;\n    EXPECT_TRUE(isConstReturn);\n}\n\nclass RequestHeader_test : public Test\n{\n  public:\n    void SetUp() override\n    {\n    }\n\n    void TearDown() override\n    {\n    }\n\n    ChunkMock<bool, RpcBaseHeader> chunk;\n    RequestHeader* sut{new (chunk.userHeader()) RequestHeader(iox::UniquePortId(), 73)};\n};\n\nTEST_F(RequestHeader_test, ConstructorWorks)\n{\n    const iox::UniquePortId clientQueueUniquePortId;\n    constexpr uint32_t LAST_KNOWN_CLIENT_QUEUE_INDEX{13};\n    constexpr int64_t EXPECTED_SEQUENCE_ID{0};\n    constexpr uint8_t EXPECTED_RPC_HEADER_VERSION{RpcBaseHeader::RPC_HEADER_VERSION};\n\n    ChunkMock<bool, RpcBaseHeader> chunk;\n    auto requestHeader = new (chunk.userHeader()) RequestHeader(clientQueueUniquePortId, LAST_KNOWN_CLIENT_QUEUE_INDEX);\n\n    checkRpcBaseHeader(static_cast<RpcBaseHeaderAccess*>(chunk.userHeader()),\n                       clientQueueUniquePortId,\n                       LAST_KNOWN_CLIENT_QUEUE_INDEX,\n                       EXPECTED_SEQUENCE_ID,\n                       EXPECTED_RPC_HEADER_VERSION);\n\n    EXPECT_THAT(requestHeader->getFireAndForget(), Eq(false));\n}\n\nTEST_F(RequestHeader_test, SetSequenceIdWorks)\n{\n    constexpr int64_t SEQUENCE_ID{666};\n\n    sut->setSequenceId(SEQUENCE_ID);\n\n    EXPECT_THAT(sut->getSequenceId(), Eq(SEQUENCE_ID));\n}\n\nTEST_F(RequestHeader_test, SetFireAndForgetWorks)\n{\n    sut->setFireAndForget();\n\n    EXPECT_THAT(sut->getFireAndForget(), Eq(true));\n}\n\n} \/\/ namespace\n<commit_msg>iox-#27 Add test for ResponseHeader<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\/popo\/rpc_header.hpp\"\n\n#include \"iceoryx_posh\/testing\/mocks\/chunk_mock.hpp\"\n#include \"test.hpp\"\n\nnamespace\n{\nusing namespace ::testing;\nusing namespace iox::popo;\n\nclass RpcBaseHeaderAccess : public RpcBaseHeader\n{\n  public:\n    using RpcBaseHeader::m_clientQueueUniquePortId;\n    using RpcBaseHeader::m_lastKnownClientQueueIndex;\n};\n\nclass RpcBaseHeader_test : public Test\n{\n  public:\n    void SetUp() override\n    {\n    }\n\n    void TearDown() override\n    {\n    }\n\n    ChunkMock<bool, RpcBaseHeader> chunk;\n    RpcBaseHeader* sut{new (chunk.userHeader())\n                           RpcBaseHeader(iox::UniquePortId(), 73, 37, RpcBaseHeader::RPC_HEADER_VERSION)};\n};\n\nvoid checkRpcBaseHeader(const RpcBaseHeaderAccess* sut,\n                        const iox::UniquePortId& clientQueueUniquePortId,\n                        const uint32_t lastKnownClientQueueIndex,\n                        const int64_t sequenceId,\n                        const uint8_t rpcHeaderVersion)\n{\n    EXPECT_THAT(sut->getRpcHeaderVersion(), rpcHeaderVersion);\n    EXPECT_THAT(sut->m_clientQueueUniquePortId, Eq(clientQueueUniquePortId));\n    EXPECT_THAT(sut->m_lastKnownClientQueueIndex, lastKnownClientQueueIndex);\n    EXPECT_THAT(sut->getSequenceId(), Eq(sequenceId));\n}\n\nTEST_F(RpcBaseHeader_test, ConstructorWorks)\n{\n    const iox::UniquePortId clientQueueUniquePortId;\n    constexpr uint32_t LAST_KNOWN_CLIENT_QUEUE_INDEX{13};\n    constexpr int64_t SEQUENCE_ID{42};\n    constexpr uint8_t RPC_HEADER_VERSION{222};\n\n    ChunkMock<bool, RpcBaseHeader> chunk;\n    new (chunk.userHeader())\n        RpcBaseHeader(clientQueueUniquePortId, LAST_KNOWN_CLIENT_QUEUE_INDEX, SEQUENCE_ID, RPC_HEADER_VERSION);\n\n    checkRpcBaseHeader(static_cast<RpcBaseHeaderAccess*>(chunk.userHeader()),\n                       clientQueueUniquePortId,\n                       LAST_KNOWN_CLIENT_QUEUE_INDEX,\n                       SEQUENCE_ID,\n                       RPC_HEADER_VERSION);\n}\n\nTEST_F(RpcBaseHeader_test, GetChunkHeaderFunctionFromNonConstContextWorks)\n{\n    EXPECT_THAT(static_cast<RpcBaseHeader*>(sut)->getChunkHeader(), Eq(chunk.chunkHeader()));\n}\n\nTEST_F(RpcBaseHeader_test, GetChunkHeaderFunctionFromConstContextWorks)\n{\n    EXPECT_THAT(static_cast<const RpcBaseHeader*>(sut)->getChunkHeader(), Eq(chunk.chunkHeader()));\n}\n\nTEST_F(RpcBaseHeader_test, GetChunkHeaderFunctionCalledFromNonConstContextReturnsNonConstType)\n{\n    auto isNonConstReturn =\n        std::is_same<decltype(std::declval<RpcBaseHeader>().getChunkHeader()), iox::mepoo::ChunkHeader*>::value;\n    EXPECT_TRUE(isNonConstReturn);\n}\n\nTEST_F(RpcBaseHeader_test, GetChunkHeaderFunctionCalledFromConstContextReturnsConstType)\n{\n    auto isConstReturn = std::is_same<decltype(std::declval<const RpcBaseHeader>().getChunkHeader()),\n                                      const iox::mepoo::ChunkHeader*>::value;\n    EXPECT_TRUE(isConstReturn);\n}\n\nTEST_F(RpcBaseHeader_test, GetUserPayloadFunctionFromNonConstContextWorks)\n{\n    EXPECT_THAT(static_cast<RpcBaseHeader*>(sut)->getUserPayload(), Eq(chunk.chunkHeader()->userPayload()));\n}\n\nTEST_F(RpcBaseHeader_test, GetUserPayloadFunctionFromConstContextWorks)\n{\n    EXPECT_THAT(static_cast<const RpcBaseHeader*>(sut)->getUserPayload(), Eq(chunk.chunkHeader()->userPayload()));\n}\n\nTEST_F(RpcBaseHeader_test, GetUserPayloadFunctionCalledFromNonConstContextReturnsNonConstType)\n{\n    auto isNonConstReturn = std::is_same<decltype(std::declval<RpcBaseHeader>().getUserPayload()), void*>::value;\n    EXPECT_TRUE(isNonConstReturn);\n}\n\nTEST_F(RpcBaseHeader_test, GetUserPayloadFunctionCalledFromConstContextReturnsConstType)\n{\n    auto isConstReturn =\n        std::is_same<decltype(std::declval<const RpcBaseHeader>().getUserPayload()), const void*>::value;\n    EXPECT_TRUE(isConstReturn);\n}\n\nclass RequestHeader_test : public Test\n{\n  public:\n    void SetUp() override\n    {\n    }\n\n    void TearDown() override\n    {\n    }\n\n    ChunkMock<bool, RequestHeader> chunk;\n    RequestHeader* sut{new (chunk.userHeader()) RequestHeader(iox::UniquePortId(), 7)};\n};\n\nTEST_F(RequestHeader_test, ConstructorWorks)\n{\n    const iox::UniquePortId clientQueueUniquePortId;\n    constexpr uint32_t LAST_KNOWN_CLIENT_QUEUE_INDEX{13};\n    constexpr int64_t EXPECTED_SEQUENCE_ID{0};\n    constexpr uint8_t EXPECTED_RPC_HEADER_VERSION{RpcBaseHeader::RPC_HEADER_VERSION};\n\n    ChunkMock<bool, RequestHeader> chunk;\n    auto requestHeader = new (chunk.userHeader()) RequestHeader(clientQueueUniquePortId, LAST_KNOWN_CLIENT_QUEUE_INDEX);\n\n    checkRpcBaseHeader(reinterpret_cast<RpcBaseHeaderAccess*>(requestHeader),\n                       clientQueueUniquePortId,\n                       LAST_KNOWN_CLIENT_QUEUE_INDEX,\n                       EXPECTED_SEQUENCE_ID,\n                       EXPECTED_RPC_HEADER_VERSION);\n\n    EXPECT_THAT(requestHeader->getFireAndForget(), Eq(false));\n}\n\nTEST_F(RequestHeader_test, SetSequenceIdWorks)\n{\n    constexpr int64_t SEQUENCE_ID{666};\n\n    sut->setSequenceId(SEQUENCE_ID);\n\n    EXPECT_THAT(sut->getSequenceId(), Eq(SEQUENCE_ID));\n}\n\nTEST_F(RequestHeader_test, SetFireAndForgetWorks)\n{\n    sut->setFireAndForget();\n\n    EXPECT_THAT(sut->getFireAndForget(), Eq(true));\n}\n\nclass ResponseHeader_test : public Test\n{\n  public:\n    void SetUp() override\n    {\n    }\n\n    void TearDown() override\n    {\n    }\n\n    ChunkMock<bool, ResponseHeader> chunk;\n    ResponseHeader* sut{new (chunk.userHeader()) ResponseHeader(iox::UniquePortId(), 13, 1111)};\n};\n\nTEST_F(ResponseHeader_test, ConstructorWorks)\n{\n    const iox::UniquePortId clientQueueUniquePortId;\n    constexpr uint32_t LAST_KNOWN_CLIENT_QUEUE_INDEX{17};\n    constexpr int64_t SEQUENCE_ID{555};\n    constexpr uint8_t EXPECTED_RPC_HEADER_VERSION{RpcBaseHeader::RPC_HEADER_VERSION};\n\n    ChunkMock<bool, ResponseHeader> chunk;\n    auto responseHeader =\n        new (chunk.userHeader()) ResponseHeader(clientQueueUniquePortId, LAST_KNOWN_CLIENT_QUEUE_INDEX, SEQUENCE_ID);\n\n    checkRpcBaseHeader(reinterpret_cast<RpcBaseHeaderAccess*>(responseHeader),\n                       clientQueueUniquePortId,\n                       LAST_KNOWN_CLIENT_QUEUE_INDEX,\n                       SEQUENCE_ID,\n                       EXPECTED_RPC_HEADER_VERSION);\n\n    EXPECT_THAT(responseHeader->hasServerError(), Eq(false));\n}\n\nTEST_F(ResponseHeader_test, SetServerErrorWorks)\n{\n    sut->setServerError();\n\n    EXPECT_THAT(sut->hasServerError(), Eq(true));\n}\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>#define BOOST_TEST_MODULE \"test_worm_like_chain_potential\"\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\/potential\/local\/WormLikeChainPotential.hpp>\n\nBOOST_AUTO_TEST_CASE(WormLikeChain_double)\n{\n    mjolnir::LoggerManager::set_default_logger(\"test_worm_like_chain_potential.log\");\n\n    using real_type = double;\n    constexpr std::size_t N = 900;\n    constexpr real_type   h = 1e-6;\n    const real_type       p = 3.9;\n    const real_type      lc = 19.0;\n\n    mjolnir::WormLikeChainPotential<real_type> wormlikechain(p, lc);\n\n    const real_type x_min = lc * 0.0;\n    const real_type x_max = lc * 0.9;\n    const real_type dx = (x_max - x_min) \/ N;\n\n    for(std::size_t i=0; i<N; ++i)\n    {\n        const real_type x = x_min + dx * i;\n        const real_type pot1 = wormlikechain.potential(x + h);\n        const real_type pot2 = wormlikechain.potential(x - h);\n        const real_type dpot = (pot1 - pot2) \/ (2.0 * h);\n        const real_type deri = wormlikechain.derivative(x);\n\n        if(std::abs(dpot) > h && std::abs(deri) > h)\n        {\n            BOOST_TEST(dpot == deri, boost::test_tools::tolerance(h));\n        }\n    }\n}\n\nBOOST_AUTO_TEST_CASE(WormLikeChain_float)\n{\n    using real_type = float;\n    constexpr std::size_t N = 900;\n    constexpr real_type   h = 1e-3;\n    const real_type       p = 3.9;\n    const real_type      lc = 19.0;\n\n    mjolnir::WormLikeChainPotential<real_type> wormlikechain(p, lc);\n\n    const real_type x_min = 0.0;\n    const real_type x_max = lc * 0.9;\n    const real_type dx = (x_max - x_min) \/ N;\n\n    for(std::size_t i=1; i<N; ++i)\n    {\n        const real_type x = x_min + dx * i;\n        const real_type pot1 = wormlikechain.potential(x + h);\n        const real_type pot2 = wormlikechain.potential(x - h);\n        const real_type dpot = (pot1 - pot2) \/ (2.0 * h);\n        const real_type deri = wormlikechain.derivative(x);\n\n        if(std::abs(dpot) > h && std::abs(deri) > h)\n        {\n            BOOST_TEST(dpot == deri, boost::test_tools::tolerance(h));\n        }\n    }\n}\n<commit_msg>fix: meaningless test case in double.<commit_after>#define BOOST_TEST_MODULE \"test_worm_like_chain_potential\"\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\/potential\/local\/WormLikeChainPotential.hpp>\n\nBOOST_AUTO_TEST_CASE(WormLikeChain_double)\n{\n    mjolnir::LoggerManager::set_default_logger(\"test_worm_like_chain_potential.log\");\n\n    using real_type = double;\n    constexpr std::size_t N = 900;\n    constexpr real_type   h = 1e-6;\n    const real_type       p = 3.9;\n    const real_type      lc = 19.0;\n\n    mjolnir::WormLikeChainPotential<real_type> wormlikechain(p, lc);\n\n    const real_type x_min = lc * 0.0;\n    const real_type x_max = lc * 0.9;\n    const real_type dx = (x_max - x_min) \/ N;\n\n    for(std::size_t i=1; i<N; ++i)\n    {\n        const real_type x = x_min + dx * i;\n        const real_type pot1 = wormlikechain.potential(x + h);\n        const real_type pot2 = wormlikechain.potential(x - h);\n        const real_type dpot = (pot1 - pot2) \/ (2.0 * h);\n        const real_type deri = wormlikechain.derivative(x);\n\n        if(std::abs(dpot) > h && std::abs(deri) > h)\n        {\n            BOOST_TEST(dpot == deri, boost::test_tools::tolerance(h));\n        }\n    }\n}\n\nBOOST_AUTO_TEST_CASE(WormLikeChain_float)\n{\n    using real_type = float;\n    constexpr std::size_t N = 900;\n    constexpr real_type   h = 1e-3;\n    const real_type       p = 3.9;\n    const real_type      lc = 19.0;\n\n    mjolnir::WormLikeChainPotential<real_type> wormlikechain(p, lc);\n\n    const real_type x_min = 0.0;\n    const real_type x_max = lc * 0.9;\n    const real_type dx = (x_max - x_min) \/ N;\n\n    for(std::size_t i=1; i<N; ++i)\n    {\n        const real_type x = x_min + dx * i;\n        const real_type pot1 = wormlikechain.potential(x + h);\n        const real_type pot2 = wormlikechain.potential(x - h);\n        const real_type dpot = (pot1 - pot2) \/ (2.0 * h);\n        const real_type deri = wormlikechain.derivative(x);\n\n        if(std::abs(dpot) > h && std::abs(deri) > h)\n        {\n            BOOST_TEST(dpot == deri, boost::test_tools::tolerance(h));\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/\/ C++ Standard Library\n#include <vector>\n\n\/\/ Armadillo\n#include <armadillo>\n\nnamespace hop {\n  namespace robotic {\n    class Model {\n      public:\n        virtual std::vector<arma::Mat<double>> getModelCharacterisation(\n            const arma::Col<double>& endEffectorPose,\n            const arma::Mat<double>& redundantJointActuations) const noexcept = 0;\n\n        virtual arma::Mat<double> getActuation(\n            const arma::Col<double>& endEffectorPose,\n            const arma::Mat<double>& redundantJointActuations) const noexcept = 0;\n\n        virtual double getPositionError(\n            const arma::Col<double>& endEffectorPose,\n            const arma::Mat<double>& redundantJointActuations) const noexcept = 0;\n\n        virtual ~Model() = default;\n    };\n  }\n}\n<commit_msg>Fix: Removed noexpect from robot::model and left it within the more specific classes<commit_after>#pragma once\n\n\/\/ C++ Standard Library\n#include <vector>\n\n\/\/ Armadillo\n#include <armadillo>\n\nnamespace hop {\n  namespace robotic {\n    class Model {\n      public:\n        virtual std::vector<arma::Mat<double>> getModelCharacterisation(\n            const arma::Col<double>& endEffectorPose,\n            const arma::Mat<double>& redundantJointActuations) const = 0;\n\n        virtual arma::Mat<double> getActuation(\n            const arma::Col<double>& endEffectorPose,\n            const arma::Mat<double>& redundantJointActuations) const = 0;\n\n        virtual double getPositionError(\n            const arma::Col<double>& endEffectorPose,\n            const arma::Mat<double>& redundantJointActuations) const = 0;\n\n        virtual ~Model() = default;\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 \"gtest\/gtest.h\"\n\n#include <libcellml>\n\n#include <algorithm>\n#include <string>\n#include <vector>\n\n#include <libxml\/parser.h>\n\nvoid structuredErrorCallback(void *userData, xmlErrorPtr error)\n{\n    if (userData && error) {\n        \/\/ Suppress any error messages raised from using LibXml2.\n    }\n}\n\nTEST(Parser, parseValidXmlDirectlyUsingLibxml)\n{\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\"\/>\\n\";\n\n    \/\/ parse the string using libcellml\n    libcellml::ParserPtr parser = libcellml::Parser::create();\n    libcellml::ModelPtr model = parser->parseModel(e);\n    libcellml::PrinterPtr printer = libcellml::Printer::create();\n    const std::string a = printer->printModel(model);\n    EXPECT_EQ(e, a);\n\n    \/\/ and now parse directly using libxml2\n    xmlInitParser();\n    xmlParserCtxtPtr context = xmlNewParserCtxt();\n    xmlSetStructuredErrorFunc(context, structuredErrorCallback);\n    xmlDocPtr doc = xmlCtxtReadDoc(context, reinterpret_cast<const xmlChar *>(e.c_str()), \"\/\", nullptr, 0);\n    xmlFreeParserCtxt(context);\n    EXPECT_NE(nullptr, doc);\n    xmlFreeDoc(doc);\n    xmlSetStructuredErrorFunc(nullptr, nullptr);\n    xmlCleanupParser();\n    xmlCleanupGlobals();\n}\n\nTEST(Parser, parseInvalidXmlDirectlyUsingLibxml)\n{\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\"><component><\/model>\";\n\n    \/\/ parse the string using libcellml\n    libcellml::ParserPtr parser = libcellml::Parser::create();\n    libcellml::ModelPtr model = parser->parseModel(e);\n    EXPECT_NE(size_t(0), parser->issueCount());\n\n    \/\/ and now parse directly using libxml2\n    xmlInitParser();\n    xmlParserCtxtPtr context = xmlNewParserCtxt();\n    xmlSetStructuredErrorFunc(context, structuredErrorCallback);\n    xmlDocPtr doc = xmlCtxtReadDoc(context, reinterpret_cast<const xmlChar *>(e.c_str()), \"\/\", nullptr, 0);\n    xmlFreeParserCtxt(context);\n    xmlSetStructuredErrorFunc(nullptr, nullptr);\n    xmlCleanupParser();\n    xmlCleanupGlobals();\n\n    EXPECT_EQ(nullptr, doc);\n}\n<commit_msg>Compare pointers against nullptr explicitly in libxml_user.cpp.<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 \"gtest\/gtest.h\"\n\n#include <libcellml>\n\n#include <algorithm>\n#include <string>\n#include <vector>\n\n#include <libxml\/parser.h>\n\nvoid structuredErrorCallback(void *userData, xmlErrorPtr error)\n{\n    if (userData != nullptr && error != nullptr) {\n        \/\/ Suppress any error messages raised from using LibXml2.\n    }\n}\n\nTEST(Parser, parseValidXmlDirectlyUsingLibxml)\n{\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\"\/>\\n\";\n\n    \/\/ parse the string using libcellml\n    libcellml::ParserPtr parser = libcellml::Parser::create();\n    libcellml::ModelPtr model = parser->parseModel(e);\n    libcellml::PrinterPtr printer = libcellml::Printer::create();\n    const std::string a = printer->printModel(model);\n    EXPECT_EQ(e, a);\n\n    \/\/ and now parse directly using libxml2\n    xmlInitParser();\n    xmlParserCtxtPtr context = xmlNewParserCtxt();\n    xmlSetStructuredErrorFunc(context, structuredErrorCallback);\n    xmlDocPtr doc = xmlCtxtReadDoc(context, reinterpret_cast<const xmlChar *>(e.c_str()), \"\/\", nullptr, 0);\n    xmlFreeParserCtxt(context);\n    EXPECT_NE(nullptr, doc);\n    xmlFreeDoc(doc);\n    xmlSetStructuredErrorFunc(nullptr, nullptr);\n    xmlCleanupParser();\n    xmlCleanupGlobals();\n}\n\nTEST(Parser, parseInvalidXmlDirectlyUsingLibxml)\n{\n    const std::string e =\n        \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n\"\n        \"<model xmlns=\\\"http:\/\/www.cellml.org\/cellml\/2.0#\\\"><component><\/model>\";\n\n    \/\/ parse the string using libcellml\n    libcellml::ParserPtr parser = libcellml::Parser::create();\n    libcellml::ModelPtr model = parser->parseModel(e);\n    EXPECT_NE(size_t(0), parser->issueCount());\n\n    \/\/ and now parse directly using libxml2\n    xmlInitParser();\n    xmlParserCtxtPtr context = xmlNewParserCtxt();\n    xmlSetStructuredErrorFunc(context, structuredErrorCallback);\n    xmlDocPtr doc = xmlCtxtReadDoc(context, reinterpret_cast<const xmlChar *>(e.c_str()), \"\/\", nullptr, 0);\n    xmlFreeParserCtxt(context);\n    xmlSetStructuredErrorFunc(nullptr, nullptr);\n    xmlCleanupParser();\n    xmlCleanupGlobals();\n\n    EXPECT_EQ(nullptr, doc);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <stdlib.h>\n#include <log4cxx\/logger.h>\n#include <log4cxx\/consoleappender.h>\n#include <log4cxx\/patternlayout.h>\n#include <log4cxx\/helpers\/exception.h>\n#include <log4cxx\/spi\/loggingevent.h>\n#include <log4cxx\/level.h>\n\nusing namespace log4cxx;\nusing namespace log4cxx::helpers;\nusing namespace log4cxx::spi;\n\nint main()\n{\n\tint ret = EXIT_SUCCESS;\n\t\n\ttry\n\t{\n\t\tPatternLayoutPtr layout = new PatternLayout();\n\t\tlayout->setConversionPattern(_T(\"%-5p [%t]: %m%n\"));\n\t\tLoggingEvent event(\n\t\t\tLogger::getStaticClass().getName(),\n\t\t\tLogger::getRootLogger(),\n\t\t\tLevel::getDebugLevel(),\n\t\t\t_T(\"debug message\"),\n\t\t\t\"file.cpp\", \n\t\t\t12\n\t\t\t);\n\t\t\n\t\ttostringstream result, witness;\n\t\t\n\t\twitness << _T(\"DEBUG [\") << event.getThreadId()\n\t\t\t<< _T(\"]: debug message\") << std::endl;\n\/\/\t\ttcout << witness.str();\n\n\t\tlayout->format(result, event);\n\/\/\t\ttcout << result.str();\n\t\t\n\t\tif (witness.str() != result.str())\n\t\t{\n\t\t\tret = EXIT_FAILURE;\n\t\t}\n\t}\n\tcatch(Exception&)\n\t{\n\t\tret = EXIT_FAILURE;\n\t}\n\t\n\treturn ret;\n}<commit_msg>fixed linux warning<commit_after>#include <stdlib.h>\n#include <log4cxx\/logger.h>\n#include <log4cxx\/consoleappender.h>\n#include <log4cxx\/patternlayout.h>\n#include <log4cxx\/helpers\/exception.h>\n#include <log4cxx\/spi\/loggingevent.h>\n#include <log4cxx\/level.h>\n\nusing namespace log4cxx;\nusing namespace log4cxx::helpers;\nusing namespace log4cxx::spi;\n\nint main()\n{\n\tint ret = EXIT_SUCCESS;\n\t\n\ttry\n\t{\n\t\tPatternLayoutPtr layout = new PatternLayout();\n\t\tlayout->setConversionPattern(_T(\"%-5p [%t]: %m%n\"));\n\t\tLoggingEvent event(\n\t\t\tLogger::getStaticClass().getName(),\n\t\t\tLogger::getRootLogger(),\n\t\t\tLevel::getDebugLevel(),\n\t\t\t_T(\"debug message\"),\n\t\t\t\"file.cpp\", \n\t\t\t12\n\t\t\t);\n\t\t\n\t\ttostringstream result, witness;\n\t\t\n\t\twitness << _T(\"DEBUG [\") << event.getThreadId()\n\t\t\t<< _T(\"]: debug message\") << std::endl;\n\/\/\t\ttcout << witness.str();\n\n\t\tlayout->format(result, event);\n\/\/\t\ttcout << result.str();\n\t\t\n\t\tif (witness.str() != result.str())\n\t\t{\n\t\t\tret = EXIT_FAILURE;\n\t\t}\n\t}\n\tcatch(Exception&)\n\t{\n\t\tret = EXIT_FAILURE;\n\t}\n\t\n\treturn ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/                       PUMI Example 1 - Parallel Version\n\/\/\n\/\/ Compile with: Add pumi_ex1p.cpp in the CMakeLists.txt\n\/\/\n\/\/ Sample runs:  mpirun -np 4 .\/pumi_ex1p -m ..\/data\/pumi\/Kova\/Kova4.smb\n\/\/                    -p ..\/data\/pumi\/Kova\/Kova.x_t -o 1 -go 2\n\/\/\n\/\/ Description:  This example is the counterpart of ex1 in the MFEM examples list\n\/\/               with the difference that pumi Api's are used to load a parallel\n\/\/               pumi mesh classified on a geometric model and then generate the \n\/\/               corresponding parallel  MFEM meshes.\n\/\/               \n\/\/               This example also performs a \"uniform\" refinement, similar to \n\/\/               MFEM examples, for coarse meshes. However, the refinement is \n\/\/               performed using the PUMi Api's and by defning a size field.\n\/\/\n\/\/               The inputs for this example are a Parasolid model, \"*.xmt_txt\" \n\/\/               and SCOREC parallel meshes \"*.smb\". Switch \"-o\" is used for \n\/\/               the Finite Element order and switch \"-go\" for the geometry order.\n\/\/               Note that they can be used independently. i.e. \"-o 8 -go 3\" \n\/\/               solves for 8th order FE on a third order geometry.  \n\n\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n#include <SimUtil.h>\n\nusing namespace std;\nusing namespace mfem;\n\nclass UniformRefinement : public ma::IsotropicFunction\n{\n  public:\n    UniformRefinement(ma::Mesh* m, int level)\n    {\n      mesh = m;\n      fac = ((level > 0) ? level : 1.0);\n      average = ma::getAverageEdgeLength(m);\n    }\n    virtual double getValue(ma::Entity* v)\n    {\n      double invfac = pow(1. \/ double(fac), mesh->getDimension());\n      return average*invfac;\n    }\n  private:\n    ma::Mesh* mesh;\n    double average;\n    double fac;\n};\n\nint main(int argc, char *argv[])\n{\n   \/\/ 1. Initialize MPI.\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   \/\/ 2. Parse command-line options.\n   const char *mesh_file = \"..\/data\/pumi\/parallel\/Kova4\/Kova_4.smb\";\n   const char *model_file = \"..\/data\/pumi\/geom\/Kova.x_t\";\n   int order = 1;\n   bool static_cond = false;\n   bool visualization = 1;\n   int geom_order = 1;   \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                  \"Finite element order (polynomial degree) or -1 for\"\n                  \" isoparametric space.\");\n   args.AddOption(&static_cond, \"-sc\", \"--static-condensation\", \"-no-sc\",\n                  \"--no-static-condensation\", \"Enable static condensation.\");\n   args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n                  \"--no-visualization\",\n                  \"Enable or disable GLVis visualization.\");\n   args.AddOption(&model_file, \"-p\", \"--parasolid\",\n                  \"Parasolid model to use.\");   \n   args.AddOption(&geom_order, \"-go\", \"--geometry_order\",\n                  \"Geometric order of the model\");\n   \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   if (myid == 0)\n   {\n      args.PrintOptions(cout);\n   }   \n   \n   \/\/3. Read the SCOREC Mesh \n   PCU_Comm_Init();\n   SimUtil_start();\n   Sim_readLicenseFile(0);\n\n   gmi_sim_start();\n   gmi_register_mesh();\n   gmi_register_sim();\n   \n   apf::Mesh2* pumi_mesh;\n   pumi_mesh = apf::loadMdsMesh(model_file, mesh_file);\n   \n   \/\/4. Increase the geometry order and refine the mesh if necessary. \n   \/\/   Parallel uniform refinement is performed if the total numebr of \n   \/\/   elements is less than 10000.  \n   int dim = pumi_mesh->getDimension();\n   int nEle = pumi_mesh->count(dim);\n   int ref_levels = (int)floor(log(10000.\/nEle)\/log(2.)\/dim);\n\n   UniformRefinement uniField(pumi_mesh,ref_levels);\n   ma::Input* uniInput = ma::configure(pumi_mesh, &uniField);\n   uniInput->shouldFixShape = true;\n   uniInput->shouldSnap = true;                                                               \n   uniInput->shouldTransferParametric = true;     \n\n   if (geom_order > 1){\n       crv::BezierCurver bc(pumi_mesh, geom_order, 2);\n       bc.run();\n       \n       \/\/Uniform refinement\n       if (ref_levels > 1) crv::adapt(uniInput);          \n   }    \n   else if (ref_levels > 1)\n       ma::adapt(uniInput); \n   \n   pumi_mesh->verify();  \n\n   \/\/ 5. Create the parallel MFEM mesh object from the parallel PUMI mesh. \n   \/\/    We can handle triangular and tetrahedral meshes. Note that the \n   \/\/    mesh resolution is performed on the PUMI mesh.\n   ParMesh *pmesh = new ParMesh(MPI_COMM_WORLD, pumi_mesh);\n\n    \n   \/\/ 6. Define a parallel finite element space on the parallel mesh. Here we\n   \/\/    use continuous Lagrange finite elements of the specified order. If\n   \/\/    order < 1, we instead use an isoparametric\/isogeometric space.\n   FiniteElementCollection *fec;\n   if (order > 0)\n   {\n      fec = new H1_FECollection(order, dim);\n   }\n   else if (pmesh->GetNodes())\n   {\n      fec = pmesh->GetNodes()->OwnFEC();\n      if (myid == 0)\n      {\n         cout << \"Using isoparametric FEs: \" << fec->Name() << endl;\n      }\n   }\n   else\n   {\n      fec = new H1_FECollection(order = 1, dim);\n   }\n   ParFiniteElementSpace *fespace = new ParFiniteElementSpace(pmesh, fec);\n   HYPRE_Int size = fespace->GlobalTrueVSize();\n   if (myid == 0)\n   {\n      cout << \"Number of finite element unknowns: \" << size << endl;\n   }\n\n   \/\/ 7. Determine the list of true (i.e. parallel conforming) essential\n   \/\/    boundary dofs. In this example, the boundary conditions are defined\n   \/\/    by marking all the boundary attributes from the mesh as essential\n   \/\/    (Dirichlet) and converting them to a list of true dofs.\n   Array<int> ess_tdof_list;\n   if (pmesh->bdr_attributes.Size())\n   {\n      Array<int> ess_bdr(pmesh->bdr_attributes.Max());\n      ess_bdr = 1;\n      fespace->GetEssentialTrueDofs(ess_bdr, ess_tdof_list);\n   }\n\n   \/\/ 8. Set up the parallel linear form b(.) which corresponds to the\n   \/\/    right-hand side of the FEM linear system, which in this case is\n   \/\/    (1,phi_i) where phi_i are the basis functions in fespace.\n   ParLinearForm *b = new ParLinearForm(fespace);\n   ConstantCoefficient one(1.0);\n   b->AddDomainIntegrator(new DomainLFIntegrator(one));\n   b->Assemble();\n\n   \/\/ 9. Define the solution vector x as a parallel finite element grid function\n   \/\/    corresponding to fespace. Initialize x with initial guess of zero,\n   \/\/    which satisfies the boundary conditions.\n   ParGridFunction x(fespace);\n   x = 0.0;\n\n   \/\/ 10. Set up the parallel bilinear form a(.,.) on the finite element space\n   \/\/     corresponding to the Laplacian operator -Delta, by adding the Diffusion\n   \/\/     domain integrator.\n   ParBilinearForm *a = new ParBilinearForm(fespace);\n   a->AddDomainIntegrator(new DiffusionIntegrator(one));\n\n   \/\/ 11. Assemble the parallel bilinear form and the corresponding linear\n   \/\/     system, applying any necessary transformations such as: parallel\n   \/\/     assembly, eliminating boundary conditions, applying conforming\n   \/\/     constraints for non-conforming AMR, static condensation, etc.\n   if (static_cond) { a->EnableStaticCondensation(); }\n   a->Assemble();\n\n   HypreParMatrix A;\n   Vector B, X;\n   a->FormLinearSystem(ess_tdof_list, x, *b, A, X, B);\n\n   if (myid == 0)\n   {\n      cout << \"Size of linear system: \" << A.GetGlobalNumRows() << endl;\n   }\n\n   \/\/ 12. Define and apply a parallel PCG solver for AX=B with the BoomerAMG\n   \/\/     preconditioner from hypre.\n   HypreSolver *amg = new HypreBoomerAMG(A);\n   HyprePCG *pcg = new HyprePCG(A);\n   pcg->SetTol(1e-12);\n   pcg->SetMaxIter(200);\n   pcg->SetPrintLevel(2);\n   pcg->SetPreconditioner(*amg);\n   pcg->Mult(B, X);\n\n   \/\/ 13. Recover the parallel grid function corresponding to X. This is the\n   \/\/     local finite element solution on each processor.\n   a->RecoverFEMSolution(X, *b, x);\n\n   \/\/ 14. Save the refined mesh and the solution in parallel. This output can\n   \/\/     be viewed later using GLVis: \"glvis -np <np> -m mesh -g sol\".\n   {\n      ostringstream mesh_name, sol_name;\n      mesh_name << \"mesh.\" << setfill('0') << setw(6) << myid;\n      sol_name << \"sol.\" << setfill('0') << setw(6) << myid;\n\n      ofstream mesh_ofs(mesh_name.str().c_str());\n      mesh_ofs.precision(8);\n      pmesh->Print(mesh_ofs);\n\n      ofstream sol_ofs(sol_name.str().c_str());\n      sol_ofs.precision(8);\n      x.Save(sol_ofs);\n   }\n\n   \/\/ 15. Send the solution by socket to a GLVis server.\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\" << *pmesh << x << flush;\n   }\n\n   \/\/ 16. Free the used memory.\n   delete pcg;\n   delete amg;\n   delete a;\n   delete b;\n   delete fespace;\n   if (order > 0) { delete fec; }\n   delete pmesh;\n\n   pumi_mesh->destroyNative();\n   apf::destroyMesh(pumi_mesh);\n   PCU_Comm_Free();\n   gmi_sim_stop();\n   \n   Sim_unregisterAllKeys();\n   SimUtil_stop();\n\n   MPI_Finalize();\n\n   return 0;\n}\n<commit_msg>Clean unifor refinement (wo size field)<commit_after>\/\/                       PUMI Example 1 - Parallel Version\n\/\/\n\/\/ Compile with: Add pumi_ex1p.cpp in the CMakeLists.txt\n\/\/\n\/\/ Sample runs:  mpirun -np 4 .\/pumi_ex1p -m ..\/data\/pumi\/Kova\/Kova4.smb\n\/\/                    -p ..\/data\/pumi\/Kova\/Kova.x_t -o 1 -go 2\n\/\/\n\/\/ Description:  This example is the counterpart of ex1 in the MFEM examples list\n\/\/               with the difference that pumi Api's are used to load a parallel\n\/\/               pumi mesh classified on a geometric model and then generate the \n\/\/               corresponding parallel  MFEM meshes.\n\/\/               \n\/\/               This example also performs a \"uniform\" refinement, similar to \n\/\/               MFEM examples, for coarse meshes. However, the refinement is \n\/\/               performed using the PUMi Api's.\n\/\/\n\/\/               The inputs for this example are a Parasolid model, \"*.xmt_txt\" \n\/\/               and SCOREC parallel meshes \"*.smb\". Switch \"-o\" is used for \n\/\/               the Finite Element order and switch \"-go\" for the geometry order.\n\/\/               Note that they can be used independently. i.e. \"-o 8 -go 3\" \n\/\/               solves for 8th order FE on a third order geometry.  \n\n\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n#include <SimUtil.h>\n\nusing namespace std;\nusing namespace mfem;\n\n\nint main(int argc, char *argv[])\n{\n   \/\/ 1. Initialize MPI.\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   \/\/ 2. Parse command-line options.\n   const char *mesh_file = \"..\/data\/pumi\/parallel\/Kova4\/Kova_4.smb\";\n   const char *model_file = \"..\/data\/pumi\/geom\/Kova.x_t\";\n   int order = 1;\n   bool static_cond = false;\n   bool visualization = 1;\n   int geom_order = 1;   \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                  \"Finite element order (polynomial degree) or -1 for\"\n                  \" isoparametric space.\");\n   args.AddOption(&static_cond, \"-sc\", \"--static-condensation\", \"-no-sc\",\n                  \"--no-static-condensation\", \"Enable static condensation.\");\n   args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n                  \"--no-visualization\",\n                  \"Enable or disable GLVis visualization.\");\n   args.AddOption(&model_file, \"-p\", \"--parasolid\",\n                  \"Parasolid model to use.\");   \n   args.AddOption(&geom_order, \"-go\", \"--geometry_order\",\n                  \"Geometric order of the model\");\n   \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   if (myid == 0)\n   {\n      args.PrintOptions(cout);\n   }   \n   \n   \/\/3. Read the SCOREC Mesh \n   PCU_Comm_Init();\n   SimUtil_start();\n   Sim_readLicenseFile(0);\n\n   gmi_sim_start();\n   gmi_register_mesh();\n   gmi_register_sim();\n   \n   apf::Mesh2* pumi_mesh;\n   pumi_mesh = apf::loadMdsMesh(model_file, mesh_file);\n   \n   \/\/4. Increase the geometry order and refine the mesh if necessary. \n   \/\/   Parallel uniform refinement is performed if the total numebr of \n   \/\/   elements is less than 10000.  \n   int dim = pumi_mesh->getDimension();\n   int nEle = pumi_mesh->count(dim);\n   int ref_levels = (int)floor(log(10000.\/nEle)\/log(2.)\/dim);\n\n   if (geom_order > 1){\n       crv::BezierCurver bc(pumi_mesh, geom_order, 2);\n       bc.run();        \n   }    \n   \n   \/\/ Perform Uniform refinement\n   if (ref_levels > 1){\n       ma::Input* uniInput = ma::configureUniformRefine(pumi_mesh, ref_levels);\n       \n       if ( geom_order > 1)\n           crv::adapt(uniInput);\n       else\n           ma::adapt(uniInput);\n   }\n   \n   pumi_mesh->verify();  \n\n   \/\/ 5. Create the parallel MFEM mesh object from the parallel PUMI mesh. \n   \/\/    We can handle triangular and tetrahedral meshes. Note that the \n   \/\/    mesh resolution is performed on the PUMI mesh.\n   ParMesh *pmesh = new ParMesh(MPI_COMM_WORLD, pumi_mesh);\n\n    \n   \/\/ 6. Define a parallel finite element space on the parallel mesh. Here we\n   \/\/    use continuous Lagrange finite elements of the specified order. If\n   \/\/    order < 1, we instead use an isoparametric\/isogeometric space.\n   FiniteElementCollection *fec;\n   if (order > 0)\n   {\n      fec = new H1_FECollection(order, dim);\n   }\n   else if (pmesh->GetNodes())\n   {\n      fec = pmesh->GetNodes()->OwnFEC();\n      if (myid == 0)\n      {\n         cout << \"Using isoparametric FEs: \" << fec->Name() << endl;\n      }\n   }\n   else\n   {\n      fec = new H1_FECollection(order = 1, dim);\n   }\n   ParFiniteElementSpace *fespace = new ParFiniteElementSpace(pmesh, fec);\n   HYPRE_Int size = fespace->GlobalTrueVSize();\n   if (myid == 0)\n   {\n      cout << \"Number of finite element unknowns: \" << size << endl;\n   }\n\n   \/\/ 7. Determine the list of true (i.e. parallel conforming) essential\n   \/\/    boundary dofs. In this example, the boundary conditions are defined\n   \/\/    by marking all the boundary attributes from the mesh as essential\n   \/\/    (Dirichlet) and converting them to a list of true dofs.\n   Array<int> ess_tdof_list;\n   if (pmesh->bdr_attributes.Size())\n   {\n      Array<int> ess_bdr(pmesh->bdr_attributes.Max());\n      ess_bdr = 1;\n      fespace->GetEssentialTrueDofs(ess_bdr, ess_tdof_list);\n   }\n\n   \/\/ 8. Set up the parallel linear form b(.) which corresponds to the\n   \/\/    right-hand side of the FEM linear system, which in this case is\n   \/\/    (1,phi_i) where phi_i are the basis functions in fespace.\n   ParLinearForm *b = new ParLinearForm(fespace);\n   ConstantCoefficient one(1.0);\n   b->AddDomainIntegrator(new DomainLFIntegrator(one));\n   b->Assemble();\n\n   \/\/ 9. Define the solution vector x as a parallel finite element grid function\n   \/\/    corresponding to fespace. Initialize x with initial guess of zero,\n   \/\/    which satisfies the boundary conditions.\n   ParGridFunction x(fespace);\n   x = 0.0;\n\n   \/\/ 10. Set up the parallel bilinear form a(.,.) on the finite element space\n   \/\/     corresponding to the Laplacian operator -Delta, by adding the Diffusion\n   \/\/     domain integrator.\n   ParBilinearForm *a = new ParBilinearForm(fespace);\n   a->AddDomainIntegrator(new DiffusionIntegrator(one));\n\n   \/\/ 11. Assemble the parallel bilinear form and the corresponding linear\n   \/\/     system, applying any necessary transformations such as: parallel\n   \/\/     assembly, eliminating boundary conditions, applying conforming\n   \/\/     constraints for non-conforming AMR, static condensation, etc.\n   if (static_cond) { a->EnableStaticCondensation(); }\n   a->Assemble();\n\n   HypreParMatrix A;\n   Vector B, X;\n   a->FormLinearSystem(ess_tdof_list, x, *b, A, X, B);\n\n   if (myid == 0)\n   {\n      cout << \"Size of linear system: \" << A.GetGlobalNumRows() << endl;\n   }\n\n   \/\/ 12. Define and apply a parallel PCG solver for AX=B with the BoomerAMG\n   \/\/     preconditioner from hypre.\n   HypreSolver *amg = new HypreBoomerAMG(A);\n   HyprePCG *pcg = new HyprePCG(A);\n   pcg->SetTol(1e-12);\n   pcg->SetMaxIter(200);\n   pcg->SetPrintLevel(2);\n   pcg->SetPreconditioner(*amg);\n   pcg->Mult(B, X);\n\n   \/\/ 13. Recover the parallel grid function corresponding to X. This is the\n   \/\/     local finite element solution on each processor.\n   a->RecoverFEMSolution(X, *b, x);\n\n   \/\/ 14. Save the refined mesh and the solution in parallel. This output can\n   \/\/     be viewed later using GLVis: \"glvis -np <np> -m mesh -g sol\".\n   {\n      ostringstream mesh_name, sol_name;\n      mesh_name << \"mesh.\" << setfill('0') << setw(6) << myid;\n      sol_name << \"sol.\" << setfill('0') << setw(6) << myid;\n\n      ofstream mesh_ofs(mesh_name.str().c_str());\n      mesh_ofs.precision(8);\n      pmesh->Print(mesh_ofs);\n\n      ofstream sol_ofs(sol_name.str().c_str());\n      sol_ofs.precision(8);\n      x.Save(sol_ofs);\n   }\n\n   \/\/ 15. Send the solution by socket to a GLVis server.\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\" << *pmesh << x << flush;\n   }\n\n   \/\/ 16. Free the used memory.\n   delete pcg;\n   delete amg;\n   delete a;\n   delete b;\n   delete fespace;\n   if (order > 0) { delete fec; }\n   delete pmesh;\n\n   pumi_mesh->destroyNative();\n   apf::destroyMesh(pumi_mesh);\n   PCU_Comm_Free();\n   gmi_sim_stop();\n   \n   Sim_unregisterAllKeys();\n   SimUtil_stop();\n\n   MPI_Finalize();\n\n   return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib 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* Add each element in `X` to a corresponding element in `Y` and assigns the result to an element in `Z`.\n*\/\n#include <stdint.h>\n#include <nan.h>\n#include \"stdlib\/ndarray\/base\/bytes_per_element.h\"\n#include \"stdlib\/ndarray\/dtypes.h\"\n#include \"stdlib\/strided_binary.h\"\n\n\/**\n* Add-on namespace.\n*\/\nnamespace addon_strided_add {\n\n\tusing Nan::FunctionCallbackInfo;\n\tusing Nan::TypedArrayContents;\n\tusing Nan::ThrowTypeError;\n\tusing Nan::ThrowError;\n\tusing v8::Local;\n\tusing v8::Value;\n\n\t\/**\n\t* Adds two doubles.\n\t*\n\t* @private\n\t* @param x  first double\n\t* @param y  second double\n\t* @return   sum\n\t*\/\n\tdouble add( double x, double y ) {\n\t\treturn x + y;\n\t}\n\n\t\/**\n\t* Returns a typed array data type.\n\t*\n\t* @private\n\t* @param x  typed array\n\t* @return   data type\n\t*\/\n\tenum STDLIB_NDARRAY_DTYPE typed_array_data_type( Local<Value> x ) {\n\t\tif ( x->IsFloat64Array() ) {\n\t\t\treturn STDLIB_NDARRAY_FLOAT64;\n\t\t}\n\t\tif ( x->IsFloat32Array() ) {\n\t\t\treturn STDLIB_NDARRAY_FLOAT32;\n\t\t}\n\t\tif ( x->IsInt32Array() ) {\n\t\t\treturn STDLIB_NDARRAY_INT32;\n\t\t}\n\t\tif ( x->IsUint32Array() ) {\n\t\t\treturn STDLIB_NDARRAY_UINT32;\n\t\t}\n\t\tif ( x->IsInt16Array() ) {\n\t\t\treturn STDLIB_NDARRAY_INT16;\n\t\t}\n\t\tif ( x->IsUint16Array() ) {\n\t\t\treturn STDLIB_NDARRAY_UINT16;\n\t\t}\n\t\tif ( x->IsInt8Array() ) {\n\t\t\treturn STDLIB_NDARRAY_INT8;\n\t\t}\n\t\tif ( x->IsUint8Array() ) {\n\t\t\treturn STDLIB_NDARRAY_UINT8;\n\t\t}\n\t\treturn STDLIB_NDARRAY_UINT8; \/\/ Uint8ClampedArray\n\t}\n\n\t\/**\n\t* Adds each element in `X` to a corresponding element in `Y` and assigns the result to an element in `Z`.\n\t*\n\t* When called from JavaScript, the function expects the following arguments:\n\t*\n\t* * __N__: number of elements.\n\t* * __X__: input typed array.\n\t* * __strideX__: `X` stride length.\n\t* * __Y__: input typed array.\n\t* * __strideY__: `Y` typed array stride length.\n\t* * __Z__: destination typed array.\n\t* * __strideZ__: destination typed array stride length.\n\t*\n\t* @param info   arguments\n\t*\/\n\tvoid node_add( const FunctionCallbackInfo<Value>& info ) {\n\t\tenum STDLIB_NDARRAY_DTYPE types[3];\n\t\tuint8_t *arrays[3];\n\t\tint64_t strides[3];\n\t\tint64_t shape[1];\n\t\tint64_t nsargs;\n\t\tint64_t sargs; \/\/ WARNING: we assume no more than 64 input strided array arguments, which seems a reasonable assumption\n\t\tint64_t nargs;\n\t\tint64_t nout;\n\t\tint64_t iout;\n\t\tint64_t nin;\n\t\tint64_t i;\n\t\tint64_t j;\n\n\t\tnargs = 7;\n\n\t\t\/\/ Number of input and output strided array arguments:\n\t\tnin = 2;\n\t\tnout = 1;\n\n\t\t\/\/ Compute the index of the first output strided array argument:\n\t\tiout = ( nin*2 ) + 1;\n\n\t\t\/\/ Initialize variables used to track scalar input arguments:\n\t\tnsargs = 0;\n\t\tsargs = 0;\n\n\t\tif ( info.Length() != nargs ) {\n\t\t\tThrowError( \"invalid invocation. Incorrect number of arguments.\" );\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ The first argument is always the number of elements over which to iterate...\n\t\tif ( !info[ 0 ]->IsNumber() ) {\n\t\t\tThrowTypeError( \"invalid input argument. First argument must be a number.\" );\n\t\t\treturn;\n\t\t} else {\n\t\t\tshape[ 0 ] = static_cast<int64_t>( info[ 0 ]->IntegerValue() );\n\t\t}\n\n\t\t\/\/ Stride arguments for both input and output strided arrays are every other argument beginning from the third argument...\n\t\tfor ( i = 2; i < nargs; i += 2 ) {\n\t\t\tif ( !info[ i ]->IsNumber() ) {\n\t\t\t\tThrowTypeError( \"invalid input argument. Stride argument must be a number.\" );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tj = ( i-2 ) \/ 2;\n\t\t\tstrides[ j ] = static_cast<int64_t>( info[ i ]->IntegerValue() );\n\t\t}\n\n#if defined(V8_MAJOR_VERSION) && ( V8_MAJOR_VERSION > 4 || ( V8_MAJOR_VERSION == 4 && defined(V8_MINOR_VERSION) && V8_MINOR_VERSION >= 3 ) )\n\n\t\t\/\/ Input strided array arguments are every other argument beginning from the second argument...\n\t\tfor ( i = 1; i < iout; i += 2 ) {\n\t\t\tj = ( i-1 ) \/ 2;\n\t\t\tif ( info[ i ]->IsArrayBufferView() ) {\n\t\t\t\tTypedArrayContents<uint8_t> TypedArray( info[ i ] );\n\t\t\t\tarrays[ j ] = *TypedArray;\n\t\t\t\ttypes[ j ] = typed_array_data_type( info[ i ] );\n\t\t\t\tstrides[ j ] *= stdlib_ndarray_bytes_per_element( types[ j ] );\n\t\t\t} else if ( info[ i ]->IsNumber() ) {\n\t\t\t\tsargs |= (1<<j);\n\t\t\t\tnsargs += 1;\n\t\t\t} else {\n\t\t\t\tThrowTypeError( \"invalid input argument. Input strided array argument must be a typed array or scalar.\" );\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Output strided array arguments are every other argument beginning from the argument following the last input strided array stride argument...\n\t\tfor ( i = iout; i < nargs; i += 2 ) {\n\t\t\tj = ( i-1 ) \/ 2;\n\t\t\tif ( !info[ i ]->IsArrayBufferView() ) {\n\t\t\t\tThrowTypeError( \"invalid input argument. Output strided array arguments must be typed arrays.\" );\n\t\t\t\treturn;\n\t\t\t} else {\n\t\t\t\tTypedArrayContents<uint8_t> TypedArray( info[ i ] );\n\t\t\t\tarrays[ j ] = *TypedArray;\n\t\t\t\ttypes[ j ] = typed_array_data_type( info[ i ] );\n\t\t\t\tstrides[ j ] *= stdlib_ndarray_bytes_per_element( types[ j ] );\n\t\t\t}\n\t\t}\n\n#else\n\n\t\t\/\/ TODO: add support for older Node versions (type verification and strides; see https:\/\/github.com\/nodejs\/node\/blob\/v0.10.39-release\/src\/v8_typed_array.cc and https:\/\/github.com\/nodejs\/nan\/blob\/master\/nan_typedarray_contents.h)\n\n\t\t\/\/ Input strided array arguments are every other argument beginning from the second argument...\n\t\tfor ( i = 1; i < iout; i += 2 ) {\n\t\t\tj = ( i-1 ) \/ 2;\n\t\t\tif ( info[ i ]->IsNumber() ) {\n\t\t\t\tsargs |= (1<<j);\n\t\t\t\tnsargs += 1;\n\t\t\t} else if ( info[ i ]->IsObject() && !info[ i ]->IsNull() ) {\n\t\t\t\t\/\/ Assume a typed array:\n\t\t\t\tTypedArrayContents<uint8_t> TypedArray( info[ i ] );\n\t\t\t\tarrays[ j ] = *TypedArray;\n\n\t\t\t\ttypes[ j ] = STDLIB_NDARRAY_FLOAT64; \/\/ TODO: determine data type (will require determining the typed array \"class\"; see https:\/\/github.com\/nodejs\/node\/blob\/v0.10.39-release\/src\/v8_typed_array.cc#L462)\n\t\t\t\tstrides[ j ] *= 8; \/\/ TODO: compute based on data type (or glean directly from the typed array instance)\n\t\t\t} else {\n\t\t\t\tThrowTypeError( \"invalid input argument. Input strided array argument must be a typed array or scalar.\" );\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Output strided array arguments are every other argument beginning from the argument following the last input strided array stride argument...\n\t\tfor ( i = iout; i < nargs; i += 2 ) {\n\t\t\tj = ( i-1 ) \/ 2;\n\t\t\tif ( info[ i ]->IsObject() && !info[ i ]->IsNull() ) {\n\t\t\t\t\/\/ Assume a typed array:\n\t\t\t\tTypedArrayContents<uint8_t> TypedArray( info[ i ] );\n\t\t\t\tarrays[ j ] = *TypedArray;\n\n\t\t\t\ttypes[ j ] = STDLIB_NDARRAY_FLOAT64; \/\/ TODO: determine data type (will require determining the typed array \"class\"; see https:\/\/github.com\/nodejs\/node\/blob\/v0.10.39-release\/src\/v8_typed_array.cc#L462)\n\t\t\t\tstrides[ j ] *= 8; \/\/ TODO: compute based on data type (or glean directly from typed array instance)\n\t\t\t} else {\n\t\t\t\tThrowTypeError( \"invalid input argument. Output strided array arguments must be typed arrays.\" );\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n#endif\n\n\t\t\/\/ Check if we have been provided only scalar input arguments...\n\t\tif ( nsargs == nin ) {\n\t\t\tThrowError( \"invalid input arguments. Must provide at least one input strided array argument.\" );\n\t\t\treturn;\n\t\t}\n\t\t\/\/ Broadcasting...\n\n\t\t\/\/ Create an array having the closest \"compatible\" type...\n\t\t\/\/ arrays[ 0 ] = broadcast( static_cast<double>( info[ 1 ]->NumberValue() ), types[ 0 ] );\n\n\t\t\/\/ Perform addition:\n\t\tstdlib_strided_dd_d( arrays, shape, strides, (void *)add );\n\t}\n\n\tNAN_MODULE_INIT( Init ) {\n\t\tNan::Export( target, \"add\", node_add );\n\t}\n\n\tNODE_MODULE( addon, Init )\n} \/\/ end namespace addon_strided_add\n<commit_msg>Fix check when only output strided array arguments<commit_after>\/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib 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* Add each element in `X` to a corresponding element in `Y` and assigns the result to an element in `Z`.\n*\/\n#include <stdint.h>\n#include <nan.h>\n#include \"stdlib\/ndarray\/base\/bytes_per_element.h\"\n#include \"stdlib\/ndarray\/dtypes.h\"\n#include \"stdlib\/strided_binary.h\"\n\n\/**\n* Add-on namespace.\n*\/\nnamespace addon_strided_add {\n\n\tusing Nan::FunctionCallbackInfo;\n\tusing Nan::TypedArrayContents;\n\tusing Nan::ThrowTypeError;\n\tusing Nan::ThrowError;\n\tusing v8::Local;\n\tusing v8::Value;\n\n\t\/**\n\t* Adds two doubles.\n\t*\n\t* @private\n\t* @param x  first double\n\t* @param y  second double\n\t* @return   sum\n\t*\/\n\tdouble add( double x, double y ) {\n\t\treturn x + y;\n\t}\n\n\t\/**\n\t* Returns a typed array data type.\n\t*\n\t* @private\n\t* @param x  typed array\n\t* @return   data type\n\t*\/\n\tenum STDLIB_NDARRAY_DTYPE typed_array_data_type( Local<Value> x ) {\n\t\tif ( x->IsFloat64Array() ) {\n\t\t\treturn STDLIB_NDARRAY_FLOAT64;\n\t\t}\n\t\tif ( x->IsFloat32Array() ) {\n\t\t\treturn STDLIB_NDARRAY_FLOAT32;\n\t\t}\n\t\tif ( x->IsInt32Array() ) {\n\t\t\treturn STDLIB_NDARRAY_INT32;\n\t\t}\n\t\tif ( x->IsUint32Array() ) {\n\t\t\treturn STDLIB_NDARRAY_UINT32;\n\t\t}\n\t\tif ( x->IsInt16Array() ) {\n\t\t\treturn STDLIB_NDARRAY_INT16;\n\t\t}\n\t\tif ( x->IsUint16Array() ) {\n\t\t\treturn STDLIB_NDARRAY_UINT16;\n\t\t}\n\t\tif ( x->IsInt8Array() ) {\n\t\t\treturn STDLIB_NDARRAY_INT8;\n\t\t}\n\t\tif ( x->IsUint8Array() ) {\n\t\t\treturn STDLIB_NDARRAY_UINT8;\n\t\t}\n\t\treturn STDLIB_NDARRAY_UINT8; \/\/ Uint8ClampedArray\n\t}\n\n\t\/**\n\t* Adds each element in `X` to a corresponding element in `Y` and assigns the result to an element in `Z`.\n\t*\n\t* When called from JavaScript, the function expects the following arguments:\n\t*\n\t* * __N__: number of elements.\n\t* * __X__: input typed array.\n\t* * __strideX__: `X` stride length.\n\t* * __Y__: input typed array.\n\t* * __strideY__: `Y` typed array stride length.\n\t* * __Z__: destination typed array.\n\t* * __strideZ__: destination typed array stride length.\n\t*\n\t* @param info   arguments\n\t*\/\n\tvoid node_add( const FunctionCallbackInfo<Value>& info ) {\n\t\tenum STDLIB_NDARRAY_DTYPE types[3];\n\t\tuint8_t *arrays[3];\n\t\tint64_t strides[3];\n\t\tint64_t shape[1];\n\t\tint64_t nsargs;\n\t\tint64_t sargs; \/\/ WARNING: we assume no more than 64 input strided array arguments, which seems a reasonable assumption\n\t\tint64_t nargs;\n\t\tint64_t nout;\n\t\tint64_t iout;\n\t\tint64_t nin;\n\t\tint64_t i;\n\t\tint64_t j;\n\n\t\t\/\/ Total number of input arguments:\n\t\tnargs = 7;\n\n\t\t\/\/ Number of input and output strided array arguments:\n\t\tnin = 2;\n\t\tnout = 1;\n\n\t\t\/\/ Compute the index of the first output strided array argument:\n\t\tiout = ( nin*2 ) + 1;\n\n\t\t\/\/ Initialize variables used to track scalar input arguments:\n\t\tnsargs = 0;\n\t\tsargs = 0;\n\n\t\tif ( info.Length() != nargs ) {\n\t\t\tThrowError( \"invalid invocation. Incorrect number of arguments.\" );\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ The first argument is always the number of elements over which to iterate...\n\t\tif ( !info[ 0 ]->IsNumber() ) {\n\t\t\tThrowTypeError( \"invalid input argument. First argument must be a number.\" );\n\t\t\treturn;\n\t\t} else {\n\t\t\tshape[ 0 ] = static_cast<int64_t>( info[ 0 ]->IntegerValue() );\n\t\t}\n\n\t\t\/\/ Stride arguments for both input and output strided arrays are every other argument beginning from the third argument...\n\t\tfor ( i = 2; i < nargs; i += 2 ) {\n\t\t\tif ( !info[ i ]->IsNumber() ) {\n\t\t\t\tThrowTypeError( \"invalid input argument. Stride argument must be a number.\" );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tj = ( i-2 ) \/ 2;\n\t\t\tstrides[ j ] = static_cast<int64_t>( info[ i ]->IntegerValue() );\n\t\t}\n\n#if defined(V8_MAJOR_VERSION) && ( V8_MAJOR_VERSION > 4 || ( V8_MAJOR_VERSION == 4 && defined(V8_MINOR_VERSION) && V8_MINOR_VERSION >= 3 ) )\n\n\t\t\/\/ Input strided array arguments are every other argument beginning from the second argument...\n\t\tfor ( i = 1; i < iout; i += 2 ) {\n\t\t\tj = ( i-1 ) \/ 2;\n\t\t\tif ( info[ i ]->IsArrayBufferView() ) {\n\t\t\t\tTypedArrayContents<uint8_t> TypedArray( info[ i ] );\n\t\t\t\tarrays[ j ] = *TypedArray;\n\t\t\t\ttypes[ j ] = typed_array_data_type( info[ i ] );\n\t\t\t\tstrides[ j ] *= stdlib_ndarray_bytes_per_element( types[ j ] );\n\t\t\t} else if ( info[ i ]->IsNumber() ) {\n\t\t\t\tsargs |= (1<<j);\n\t\t\t\tnsargs += 1;\n\t\t\t} else {\n\t\t\t\tThrowTypeError( \"invalid input argument. Input strided array argument must be a typed array or scalar.\" );\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Output strided array arguments are every other argument beginning from the argument following the last input strided array stride argument...\n\t\tfor ( i = iout; i < nargs; i += 2 ) {\n\t\t\tj = ( i-1 ) \/ 2;\n\t\t\tif ( !info[ i ]->IsArrayBufferView() ) {\n\t\t\t\tThrowTypeError( \"invalid input argument. Output strided array arguments must be typed arrays.\" );\n\t\t\t\treturn;\n\t\t\t} else {\n\t\t\t\tTypedArrayContents<uint8_t> TypedArray( info[ i ] );\n\t\t\t\tarrays[ j ] = *TypedArray;\n\t\t\t\ttypes[ j ] = typed_array_data_type( info[ i ] );\n\t\t\t\tstrides[ j ] *= stdlib_ndarray_bytes_per_element( types[ j ] );\n\t\t\t}\n\t\t}\n\n#else\n\n\t\t\/\/ TODO: add support for older Node versions (type verification and strides; see https:\/\/github.com\/nodejs\/node\/blob\/v0.10.39-release\/src\/v8_typed_array.cc and https:\/\/github.com\/nodejs\/nan\/blob\/master\/nan_typedarray_contents.h)\n\n\t\t\/\/ Input strided array arguments are every other argument beginning from the second argument...\n\t\tfor ( i = 1; i < iout; i += 2 ) {\n\t\t\tj = ( i-1 ) \/ 2;\n\t\t\tif ( info[ i ]->IsNumber() ) {\n\t\t\t\tsargs |= (1<<j);\n\t\t\t\tnsargs += 1;\n\t\t\t} else if ( info[ i ]->IsObject() && !info[ i ]->IsNull() ) {\n\t\t\t\t\/\/ Assume a typed array:\n\t\t\t\tTypedArrayContents<uint8_t> TypedArray( info[ i ] );\n\t\t\t\tarrays[ j ] = *TypedArray;\n\n\t\t\t\ttypes[ j ] = STDLIB_NDARRAY_FLOAT64; \/\/ TODO: determine data type (will require determining the typed array \"class\"; see https:\/\/github.com\/nodejs\/node\/blob\/v0.10.39-release\/src\/v8_typed_array.cc#L462)\n\t\t\t\tstrides[ j ] *= 8; \/\/ TODO: compute based on data type (or glean directly from the typed array instance)\n\t\t\t} else {\n\t\t\t\tThrowTypeError( \"invalid input argument. Input strided array argument must be a typed array or scalar.\" );\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Output strided array arguments are every other argument beginning from the argument following the last input strided array stride argument...\n\t\tfor ( i = iout; i < nargs; i += 2 ) {\n\t\t\tj = ( i-1 ) \/ 2;\n\t\t\tif ( info[ i ]->IsObject() && !info[ i ]->IsNull() ) {\n\t\t\t\t\/\/ Assume a typed array:\n\t\t\t\tTypedArrayContents<uint8_t> TypedArray( info[ i ] );\n\t\t\t\tarrays[ j ] = *TypedArray;\n\n\t\t\t\ttypes[ j ] = STDLIB_NDARRAY_FLOAT64; \/\/ TODO: determine data type (will require determining the typed array \"class\"; see https:\/\/github.com\/nodejs\/node\/blob\/v0.10.39-release\/src\/v8_typed_array.cc#L462)\n\t\t\t\tstrides[ j ] *= 8; \/\/ TODO: compute based on data type (or glean directly from typed array instance)\n\t\t\t} else {\n\t\t\t\tThrowTypeError( \"invalid input argument. Output strided array arguments must be typed arrays.\" );\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n#endif\n\n\t\t\/\/ Check if we have been provided only scalar input arguments...\n\t\tif ( nin > 0 && nsargs == nin ) {\n\t\t\tThrowError( \"invalid input arguments. Must provide at least one input strided array argument.\" );\n\t\t\treturn;\n\t\t}\n\t\t\/\/ Broadcasting...\n\n\t\t\/\/ Create an array having the closest \"compatible\" type...\n\t\t\/\/ arrays[ 0 ] = broadcast( static_cast<double>( info[ 1 ]->NumberValue() ), types[ 0 ] );\n\n\t\t\/\/ Perform addition:\n\t\tstdlib_strided_dd_d( arrays, shape, strides, (void *)add );\n\t}\n\n\tNAN_MODULE_INIT( Init ) {\n\t\tNan::Export( target, \"add\", node_add );\n\t}\n\n\tNODE_MODULE( addon, Init )\n} \/\/ end namespace addon_strided_add\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"message.h\"\n#include \"serialization.h\"\n\n#include <boost\/asio.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <sys\/time.h>\n\nnamespace job_stream {\nnamespace message {\n\nuint64_t Location::getCurrentTimeMs() {\n    timeval ts; gettimeofday(&ts, 0);\n    return (uint64_t)(ts.tv_sec * 1000 + ts.tv_usec \/ 1000);\n}\n\n\nWorkRecord::WorkRecord(const std::string& serialized) {\n    serialization::decode(serialized, *this);\n\n    \/\/We were received, so...\n    this->source.tsReceived = Location::getCurrentTimeMs();\n}\n\n\nWorkRecord::WorkRecord(const std::vector<std::string>& target, \n        const std::string& work) : reduceTag(0), reduceHomeRank(0), work(work) {\n    this->source.hostname = boost::asio::ip::host_name();\n    this->source.target = target;\n    this->source.tsSent = Location::getCurrentTimeMs();\n}\n\n\nWorkRecord::WorkRecord(const std::vector<std::string>& target,\n        void* work) : reduceTag(0), reduceHomeRank(0) {\n    this->source.hostname = boost::asio::ip::host_name();\n    this->source.target = target;\n    this->source.tsSent = Location::getCurrentTimeMs();\n    \/\/work will be set in derived constructor\n}\n\n\nvoid WorkRecord::chainFrom(const WorkRecord& wr) {\n    this->route.insert(this->route.end(), wr.route.begin(), wr.route.end());\n    this->route.push_back(wr.source);\n    this->reduceHomeRank = wr.reduceHomeRank;\n    this->reduceTag = wr.reduceTag;\n}\n\n\ntemplate<typename T>\nstd::string getAsString(const std::string& payload) {\n    T decoded;\n    serialization::decode(payload, decoded);\n    return boost::lexical_cast<std::string>(decoded);\n}\n\n\nstd::string WorkRecord::getWorkAsString() const {\n    this->serializeTypedWork();\n\n#define TRY_TYPE(T) \\\n        try { \\\n            return getAsString<T>(this->work); \\\n        } \\\n        catch (const std::exception& e) { \\\n            \/* Do nothing, conversion failed *\/ \\\n        }\n\n    TRY_TYPE(std::string);\n    TRY_TYPE(uint64_t);\n    TRY_TYPE(int64_t);\n    TRY_TYPE(int);\n    TRY_TYPE(unsigned short);\n    TRY_TYPE(short);\n    TRY_TYPE(unsigned char);\n    TRY_TYPE(char);\n    TRY_TYPE(float);\n    TRY_TYPE(double);\n\n    std::ostringstream ss;\n    ss << \"Unrecognized work type for string output: \" << this->work;\n    throw std::runtime_error(ss.str());\n\n#undef TRY_TYPE\n}\n\n} \/\/message\n} \/\/job_stream\n<commit_msg>Missed unsigned int!<commit_after>\n#include \"message.h\"\n#include \"serialization.h\"\n\n#include <boost\/asio.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <sys\/time.h>\n\nnamespace job_stream {\nnamespace message {\n\nuint64_t Location::getCurrentTimeMs() {\n    timeval ts; gettimeofday(&ts, 0);\n    return (uint64_t)(ts.tv_sec * 1000 + ts.tv_usec \/ 1000);\n}\n\n\nWorkRecord::WorkRecord(const std::string& serialized) {\n    serialization::decode(serialized, *this);\n\n    \/\/We were received, so...\n    this->source.tsReceived = Location::getCurrentTimeMs();\n}\n\n\nWorkRecord::WorkRecord(const std::vector<std::string>& target, \n        const std::string& work) : reduceTag(0), reduceHomeRank(0), work(work) {\n    this->source.hostname = boost::asio::ip::host_name();\n    this->source.target = target;\n    this->source.tsSent = Location::getCurrentTimeMs();\n}\n\n\nWorkRecord::WorkRecord(const std::vector<std::string>& target,\n        void* work) : reduceTag(0), reduceHomeRank(0) {\n    this->source.hostname = boost::asio::ip::host_name();\n    this->source.target = target;\n    this->source.tsSent = Location::getCurrentTimeMs();\n    \/\/work will be set in derived constructor\n}\n\n\nvoid WorkRecord::chainFrom(const WorkRecord& wr) {\n    this->route.insert(this->route.end(), wr.route.begin(), wr.route.end());\n    this->route.push_back(wr.source);\n    this->reduceHomeRank = wr.reduceHomeRank;\n    this->reduceTag = wr.reduceTag;\n}\n\n\ntemplate<typename T>\nstd::string getAsString(const std::string& payload) {\n    T decoded;\n    serialization::decode(payload, decoded);\n    return boost::lexical_cast<std::string>(decoded);\n}\n\n\nstd::string WorkRecord::getWorkAsString() const {\n    this->serializeTypedWork();\n\n#define TRY_TYPE(T) \\\n        try { \\\n            return getAsString<T>(this->work); \\\n        } \\\n        catch (const std::exception& e) { \\\n            \/* Do nothing, conversion failed *\/ \\\n        }\n\n    TRY_TYPE(std::string);\n    TRY_TYPE(uint64_t);\n    TRY_TYPE(int64_t);\n    TRY_TYPE(unsigned int);\n    TRY_TYPE(int);\n    TRY_TYPE(unsigned short);\n    TRY_TYPE(short);\n    TRY_TYPE(unsigned char);\n    TRY_TYPE(char);\n    TRY_TYPE(float);\n    TRY_TYPE(double);\n\n    std::ostringstream ss;\n    ss << \"Unrecognized work type for string output: \" << this->work;\n    throw std::runtime_error(ss.str());\n\n#undef TRY_TYPE\n}\n\n} \/\/message\n} \/\/job_stream\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- sanitizer_allocator_test.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 ThreadSanitizer\/AddressSanitizer runtime.\n\/\/ Tests for sanitizer_allocator.h.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"sanitizer_common\/sanitizer_allocator.h\"\n#include \"sanitizer_common\/sanitizer_common.h\"\n\n#include \"gtest\/gtest.h\"\n\n#include <stdlib.h>\n#include <algorithm>\n#include <vector>\n\n#if SANITIZER_WORDSIZE == 64\nstatic const uptr kAllocatorSpace = 0x700000000000ULL;\nstatic const uptr kAllocatorSize  = 0x010000000000ULL;  \/\/ 1T.\nstatic const u64 kAddressSpaceSize = 1ULL << 47;\n\ntypedef SizeClassAllocator64<\n  kAllocatorSpace, kAllocatorSize, 16, DefaultSizeClassMap> Allocator64;\n\ntypedef SizeClassAllocator64<\n  kAllocatorSpace, kAllocatorSize, 16, CompactSizeClassMap> Allocator64Compact;\n#else\nstatic const u64 kAddressSpaceSize = 1ULL << 32;\n#endif\n\ntypedef SizeClassAllocator32<\n  0, kAddressSpaceSize, 16, CompactSizeClassMap> Allocator32Compact;\n\ntemplate <class SizeClassMap>\nvoid TestSizeClassMap() {\n  typedef SizeClassMap SCMap;\n#if 0\n  for (uptr i = 0; i < SCMap::kNumClasses; i++) {\n    printf(\"c%ld => %ld (%lx) cached=%ld(%ld)\\n\",\n        i, SCMap::Size(i), SCMap::Size(i), SCMap::MaxCached(i) * SCMap::Size(i),\n        SCMap::MaxCached(i));\n  }\n#endif\n  for (uptr c = 0; c < SCMap::kNumClasses; c++) {\n    uptr s = SCMap::Size(c);\n    CHECK_EQ(SCMap::ClassID(s), c);\n    if (c != SCMap::kNumClasses - 1)\n      CHECK_EQ(SCMap::ClassID(s + 1), c + 1);\n    CHECK_EQ(SCMap::ClassID(s - 1), c);\n    if (c)\n      CHECK_GT(SCMap::Size(c), SCMap::Size(c-1));\n  }\n  CHECK_EQ(SCMap::ClassID(SCMap::kMaxSize + 1), 0);\n\n  for (uptr s = 1; s <= SCMap::kMaxSize; s++) {\n    uptr c = SCMap::ClassID(s);\n    CHECK_LT(c, SCMap::kNumClasses);\n    CHECK_GE(SCMap::Size(c), s);\n    if (c > 0)\n      CHECK_LT(SCMap::Size(c-1), s);\n  }\n}\n\nTEST(SanitizerCommon, DefaultSizeClassMap) {\n  TestSizeClassMap<DefaultSizeClassMap>();\n}\n\nTEST(SanitizerCommon, CompactSizeClassMap) {\n  TestSizeClassMap<CompactSizeClassMap>();\n}\n\ntemplate <class Allocator>\nvoid TestSizeClassAllocator() {\n  Allocator *a = new Allocator;\n  a->Init();\n\n  static const uptr sizes[] = {1, 16, 30, 40, 100, 1000, 10000,\n    50000, 60000, 100000, 300000, 500000, 1000000, 2000000};\n\n  std::vector<void *> allocated;\n\n  uptr last_total_allocated = 0;\n  for (int i = 0; i < 5; i++) {\n    \/\/ Allocate a bunch of chunks.\n    for (uptr s = 0; s < ARRAY_SIZE(sizes); s++) {\n      uptr size = sizes[s];\n      if (!a->CanAllocate(size, 1)) continue;\n      \/\/ printf(\"s = %ld\\n\", size);\n      uptr n_iter = std::max((uptr)2, 1000000 \/ size);\n      for (uptr i = 0; i < n_iter; i++) {\n        void *x = a->Allocate(size, 1);\n        allocated.push_back(x);\n        CHECK(a->PointerIsMine(x));\n        CHECK_GE(a->GetActuallyAllocatedSize(x), size);\n        uptr class_id = a->GetSizeClass(x);\n        CHECK_EQ(class_id, Allocator::SizeClassMapT::ClassID(size));\n        uptr *metadata = reinterpret_cast<uptr*>(a->GetMetaData(x));\n        metadata[0] = reinterpret_cast<uptr>(x) + 1;\n        metadata[1] = 0xABCD;\n      }\n    }\n    \/\/ Deallocate all.\n    for (uptr i = 0; i < allocated.size(); i++) {\n      void *x = allocated[i];\n      uptr *metadata = reinterpret_cast<uptr*>(a->GetMetaData(x));\n      CHECK_EQ(metadata[0], reinterpret_cast<uptr>(x) + 1);\n      CHECK_EQ(metadata[1], 0xABCD);\n      a->Deallocate(x);\n    }\n    allocated.clear();\n    uptr total_allocated = a->TotalMemoryUsed();\n    if (last_total_allocated == 0)\n      last_total_allocated = total_allocated;\n    CHECK_EQ(last_total_allocated, total_allocated);\n  }\n\n  a->TestOnlyUnmap();\n  delete a;\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, SizeClassAllocator64) {\n  TestSizeClassAllocator<Allocator64>();\n}\n\nTEST(SanitizerCommon, SizeClassAllocator64Compact) {\n  TestSizeClassAllocator<Allocator64Compact>();\n}\n#endif\n\nTEST(SanitizerCommon, SizeClassAllocator32Compact) {\n  TestSizeClassAllocator<Allocator32Compact>();\n}\n\ntemplate <class Allocator>\nvoid SizeClassAllocator64MetadataStress() {\n  Allocator a;\n  a.Init();\n  static volatile void *sink;\n\n  const uptr kNumAllocs = 10000;\n  void *allocated[kNumAllocs];\n  for (uptr i = 0; i < kNumAllocs; i++) {\n    uptr size = (i % 4096) + 1;\n    void *x = a.Allocate(size, 1);\n    allocated[i] = x;\n  }\n  \/\/ Get Metadata kNumAllocs^2 times.\n  for (uptr i = 0; i < kNumAllocs * kNumAllocs; i++) {\n    sink = a.GetMetaData(allocated[i % kNumAllocs]);\n  }\n  for (uptr i = 0; i < kNumAllocs; i++) {\n    a.Deallocate(allocated[i]);\n  }\n\n  a.TestOnlyUnmap();\n  (void)sink;\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, SizeClassAllocator64MetadataStress) {\n  SizeClassAllocator64MetadataStress<Allocator64>();\n}\n\nTEST(SanitizerCommon, SizeClassAllocator64CompactMetadataStress) {\n  SizeClassAllocator64MetadataStress<Allocator64Compact>();\n}\n#endif\n\ntemplate<class Allocator>\nvoid FailInAssertionOnOOM() {\n  Allocator a;\n  a.Init();\n  const uptr size = 1 << 20;\n  for (int i = 0; i < 1000000; i++) {\n    a.Allocate(size, 1);\n  }\n\n  a.TestOnlyUnmap();\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, SizeClassAllocator64Overflow) {\n  EXPECT_DEATH(FailInAssertionOnOOM<Allocator64>(), \"Out of memory\");\n}\n#endif\n\nTEST(SanitizerCommon, LargeMmapAllocator) {\n  LargeMmapAllocator a;\n  a.Init();\n\n  static const int kNumAllocs = 100;\n  void *allocated[kNumAllocs];\n  static const uptr size = 1000;\n  \/\/ Allocate some.\n  for (int i = 0; i < kNumAllocs; i++) {\n    allocated[i] = a.Allocate(size, 1);\n  }\n  \/\/ Deallocate all.\n  CHECK_GT(a.TotalMemoryUsed(), size * kNumAllocs);\n  for (int i = 0; i < kNumAllocs; i++) {\n    void *p = allocated[i];\n    CHECK(a.PointerIsMine(p));\n    a.Deallocate(p);\n  }\n  \/\/ Check that non left.\n  CHECK_EQ(a.TotalMemoryUsed(), 0);\n\n  \/\/ Allocate some more, also add metadata.\n  for (int i = 0; i < kNumAllocs; i++) {\n    void *x = a.Allocate(size, 1);\n    CHECK_GE(a.GetActuallyAllocatedSize(x), size);\n    uptr *meta = reinterpret_cast<uptr*>(a.GetMetaData(x));\n    *meta = i;\n    allocated[i] = x;\n  }\n  CHECK_GT(a.TotalMemoryUsed(), size * kNumAllocs);\n  \/\/ Deallocate all in reverse order.\n  for (int i = 0; i < kNumAllocs; i++) {\n    int idx = kNumAllocs - i - 1;\n    void *p = allocated[idx];\n    uptr *meta = reinterpret_cast<uptr*>(a.GetMetaData(p));\n    CHECK_EQ(*meta, idx);\n    CHECK(a.PointerIsMine(p));\n    a.Deallocate(p);\n  }\n  CHECK_EQ(a.TotalMemoryUsed(), 0);\n  uptr max_alignment = SANITIZER_WORDSIZE == 64 ? (1 << 28) : (1 << 24);\n  for (uptr alignment = 8; alignment <= max_alignment; alignment *= 2) {\n    for (int i = 0; i < kNumAllocs; i++) {\n      uptr size = ((i % 10) + 1) * 4096;\n      allocated[i] = a.Allocate(size, alignment);\n      CHECK_EQ(0, (uptr)allocated[i] % alignment);\n      char *p = (char*)allocated[i];\n      p[0] = p[size - 1] = 0;\n    }\n    for (int i = 0; i < kNumAllocs; i++) {\n      a.Deallocate(allocated[i]);\n    }\n  }\n}\n\ntemplate\n<class PrimaryAllocator, class SecondaryAllocator, class AllocatorCache>\nvoid TestCombinedAllocator() {\n  CombinedAllocator<PrimaryAllocator, AllocatorCache, SecondaryAllocator> a;\n  a.Init();\n\n  AllocatorCache cache;\n  cache.Init();\n\n  EXPECT_EQ(a.Allocate(&cache, -1, 1), (void*)0);\n  EXPECT_EQ(a.Allocate(&cache, -1, 1024), (void*)0);\n  EXPECT_EQ(a.Allocate(&cache, (uptr)-1 - 1024, 1), (void*)0);\n  EXPECT_EQ(a.Allocate(&cache, (uptr)-1 - 1024, 1024), (void*)0);\n  EXPECT_EQ(a.Allocate(&cache, (uptr)-1 - 1023, 1024), (void*)0);\n\n  const uptr kNumAllocs = 100000;\n  const uptr kNumIter = 10;\n  for (uptr iter = 0; iter < kNumIter; iter++) {\n    std::vector<void*> allocated;\n    for (uptr i = 0; i < kNumAllocs; i++) {\n      uptr size = (i % (1 << 14)) + 1;\n      if ((i % 1024) == 0)\n        size = 1 << (10 + (i % 14));\n      void *x = a.Allocate(&cache, size, 1);\n      uptr *meta = reinterpret_cast<uptr*>(a.GetMetaData(x));\n      CHECK_EQ(*meta, 0);\n      *meta = size;\n      allocated.push_back(x);\n    }\n\n    random_shuffle(allocated.begin(), allocated.end());\n\n    for (uptr i = 0; i < kNumAllocs; i++) {\n      void *x = allocated[i];\n      uptr *meta = reinterpret_cast<uptr*>(a.GetMetaData(x));\n      CHECK_NE(*meta, 0);\n      CHECK(a.PointerIsMine(x));\n      *meta = 0;\n      a.Deallocate(&cache, x);\n    }\n    allocated.clear();\n    a.SwallowCache(&cache);\n  }\n  a.TestOnlyUnmap();\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, CombinedAllocator) {\n  TestCombinedAllocator<Allocator64,\n      LargeMmapAllocator,\n      SizeClassAllocatorLocalCache<Allocator64> > ();\n}\n#endif\n\ntemplate <class AllocatorCache>\nvoid TestSizeClassAllocatorLocalCache() {\n  static THREADLOCAL AllocatorCache static_allocator_cache;\n  static_allocator_cache.Init();\n  AllocatorCache cache;\n  typename AllocatorCache::Allocator a;\n\n  a.Init();\n  cache.Init();\n\n  const uptr kNumAllocs = 10000;\n  const int kNumIter = 100;\n  uptr saved_total = 0;\n  for (int i = 0; i < kNumIter; i++) {\n    void *allocated[kNumAllocs];\n    for (uptr i = 0; i < kNumAllocs; i++) {\n      allocated[i] = cache.Allocate(&a, 0);\n    }\n    for (uptr i = 0; i < kNumAllocs; i++) {\n      cache.Deallocate(&a, 0, allocated[i]);\n    }\n    cache.Drain(&a);\n    uptr total_allocated = a.TotalMemoryUsed();\n    if (saved_total)\n      CHECK_EQ(saved_total, total_allocated);\n    saved_total = total_allocated;\n  }\n\n  a.TestOnlyUnmap();\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, SizeClassAllocator64LocalCache) {\n  TestSizeClassAllocatorLocalCache<\n      SizeClassAllocatorLocalCache<Allocator64> >();\n}\n#endif\n\nTEST(Allocator, Basic) {\n  char *p = (char*)InternalAlloc(10);\n  EXPECT_NE(p, (char*)0);\n  char *p2 = (char*)InternalAlloc(20);\n  EXPECT_NE(p2, (char*)0);\n  EXPECT_NE(p2, p);\n  InternalFree(p);\n  InternalFree(p2);\n}\n\nTEST(Allocator, Stress) {\n  const int kCount = 1000;\n  char *ptrs[kCount];\n  unsigned rnd = 42;\n  for (int i = 0; i < kCount; i++) {\n    uptr sz = rand_r(&rnd) % 1000;\n    char *p = (char*)InternalAlloc(sz);\n    EXPECT_NE(p, (char*)0);\n    ptrs[i] = p;\n  }\n  for (int i = 0; i < kCount; i++) {\n    InternalFree(ptrs[i]);\n  }\n}\n\nTEST(Allocator, ScopedBuffer) {\n  const int kSize = 512;\n  {\n    InternalScopedBuffer<int> int_buf(kSize);\n    EXPECT_EQ(sizeof(int) * kSize, int_buf.size());  \/\/ NOLINT\n  }\n  InternalScopedBuffer<char> char_buf(kSize);\n  EXPECT_EQ(sizeof(char) * kSize, char_buf.size());  \/\/ NOLINT\n  memset(char_buf.data(), 'c', kSize);\n  for (int i = 0; i < kSize; i++) {\n    EXPECT_EQ('c', char_buf[i]);\n  }\n}\n<commit_msg>[asan\/msan] one more test for 32-bit allocator<commit_after>\/\/===-- sanitizer_allocator_test.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 ThreadSanitizer\/AddressSanitizer runtime.\n\/\/ Tests for sanitizer_allocator.h.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"sanitizer_common\/sanitizer_allocator.h\"\n#include \"sanitizer_common\/sanitizer_common.h\"\n\n#include \"gtest\/gtest.h\"\n\n#include <stdlib.h>\n#include <algorithm>\n#include <vector>\n\n#if SANITIZER_WORDSIZE == 64\nstatic const uptr kAllocatorSpace = 0x700000000000ULL;\nstatic const uptr kAllocatorSize  = 0x010000000000ULL;  \/\/ 1T.\nstatic const u64 kAddressSpaceSize = 1ULL << 47;\n\ntypedef SizeClassAllocator64<\n  kAllocatorSpace, kAllocatorSize, 16, DefaultSizeClassMap> Allocator64;\n\ntypedef SizeClassAllocator64<\n  kAllocatorSpace, kAllocatorSize, 16, CompactSizeClassMap> Allocator64Compact;\n#else\nstatic const u64 kAddressSpaceSize = 1ULL << 32;\n#endif\n\ntypedef SizeClassAllocator32<\n  0, kAddressSpaceSize, 16, CompactSizeClassMap> Allocator32Compact;\n\ntemplate <class SizeClassMap>\nvoid TestSizeClassMap() {\n  typedef SizeClassMap SCMap;\n#if 0\n  for (uptr i = 0; i < SCMap::kNumClasses; i++) {\n    printf(\"c%ld => %ld (%lx) cached=%ld(%ld)\\n\",\n        i, SCMap::Size(i), SCMap::Size(i), SCMap::MaxCached(i) * SCMap::Size(i),\n        SCMap::MaxCached(i));\n  }\n#endif\n  for (uptr c = 0; c < SCMap::kNumClasses; c++) {\n    uptr s = SCMap::Size(c);\n    CHECK_EQ(SCMap::ClassID(s), c);\n    if (c != SCMap::kNumClasses - 1)\n      CHECK_EQ(SCMap::ClassID(s + 1), c + 1);\n    CHECK_EQ(SCMap::ClassID(s - 1), c);\n    if (c)\n      CHECK_GT(SCMap::Size(c), SCMap::Size(c-1));\n  }\n  CHECK_EQ(SCMap::ClassID(SCMap::kMaxSize + 1), 0);\n\n  for (uptr s = 1; s <= SCMap::kMaxSize; s++) {\n    uptr c = SCMap::ClassID(s);\n    CHECK_LT(c, SCMap::kNumClasses);\n    CHECK_GE(SCMap::Size(c), s);\n    if (c > 0)\n      CHECK_LT(SCMap::Size(c-1), s);\n  }\n}\n\nTEST(SanitizerCommon, DefaultSizeClassMap) {\n  TestSizeClassMap<DefaultSizeClassMap>();\n}\n\nTEST(SanitizerCommon, CompactSizeClassMap) {\n  TestSizeClassMap<CompactSizeClassMap>();\n}\n\ntemplate <class Allocator>\nvoid TestSizeClassAllocator() {\n  Allocator *a = new Allocator;\n  a->Init();\n\n  static const uptr sizes[] = {1, 16, 30, 40, 100, 1000, 10000,\n    50000, 60000, 100000, 300000, 500000, 1000000, 2000000};\n\n  std::vector<void *> allocated;\n\n  uptr last_total_allocated = 0;\n  for (int i = 0; i < 5; i++) {\n    \/\/ Allocate a bunch of chunks.\n    for (uptr s = 0; s < ARRAY_SIZE(sizes); s++) {\n      uptr size = sizes[s];\n      if (!a->CanAllocate(size, 1)) continue;\n      \/\/ printf(\"s = %ld\\n\", size);\n      uptr n_iter = std::max((uptr)2, 1000000 \/ size);\n      for (uptr i = 0; i < n_iter; i++) {\n        void *x = a->Allocate(size, 1);\n        allocated.push_back(x);\n        CHECK(a->PointerIsMine(x));\n        CHECK_GE(a->GetActuallyAllocatedSize(x), size);\n        uptr class_id = a->GetSizeClass(x);\n        CHECK_EQ(class_id, Allocator::SizeClassMapT::ClassID(size));\n        uptr *metadata = reinterpret_cast<uptr*>(a->GetMetaData(x));\n        metadata[0] = reinterpret_cast<uptr>(x) + 1;\n        metadata[1] = 0xABCD;\n      }\n    }\n    \/\/ Deallocate all.\n    for (uptr i = 0; i < allocated.size(); i++) {\n      void *x = allocated[i];\n      uptr *metadata = reinterpret_cast<uptr*>(a->GetMetaData(x));\n      CHECK_EQ(metadata[0], reinterpret_cast<uptr>(x) + 1);\n      CHECK_EQ(metadata[1], 0xABCD);\n      a->Deallocate(x);\n    }\n    allocated.clear();\n    uptr total_allocated = a->TotalMemoryUsed();\n    if (last_total_allocated == 0)\n      last_total_allocated = total_allocated;\n    CHECK_EQ(last_total_allocated, total_allocated);\n  }\n\n  a->TestOnlyUnmap();\n  delete a;\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, SizeClassAllocator64) {\n  TestSizeClassAllocator<Allocator64>();\n}\n\nTEST(SanitizerCommon, SizeClassAllocator64Compact) {\n  TestSizeClassAllocator<Allocator64Compact>();\n}\n#endif\n\nTEST(SanitizerCommon, SizeClassAllocator32Compact) {\n  TestSizeClassAllocator<Allocator32Compact>();\n}\n\ntemplate <class Allocator>\nvoid SizeClassAllocatorMetadataStress() {\n  Allocator *a = new Allocator;\n  a->Init();\n  static volatile void *sink;\n\n  const uptr kNumAllocs = 10000;\n  void *allocated[kNumAllocs];\n  for (uptr i = 0; i < kNumAllocs; i++) {\n    uptr size = (i % 4096) + 1;\n    void *x = a->Allocate(size, 1);\n    allocated[i] = x;\n  }\n  \/\/ Get Metadata kNumAllocs^2 times.\n  for (uptr i = 0; i < kNumAllocs * kNumAllocs; i++) {\n    sink = a->GetMetaData(allocated[i % kNumAllocs]);\n  }\n  for (uptr i = 0; i < kNumAllocs; i++) {\n    a->Deallocate(allocated[i]);\n  }\n\n  a->TestOnlyUnmap();\n  (void)sink;\n  delete a;\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, SizeClassAllocator64MetadataStress) {\n  SizeClassAllocatorMetadataStress<Allocator64>();\n}\n\nTEST(SanitizerCommon, SizeClassAllocator64CompactMetadataStress) {\n  SizeClassAllocatorMetadataStress<Allocator64Compact>();\n}\n#endif\nTEST(SanitizerCommon, SizeClassAllocator32CompactMetadataStress) {\n  SizeClassAllocatorMetadataStress<Allocator32Compact>();\n}\n\ntemplate<class Allocator>\nvoid FailInAssertionOnOOM() {\n  Allocator a;\n  a.Init();\n  const uptr size = 1 << 20;\n  for (int i = 0; i < 1000000; i++) {\n    a.Allocate(size, 1);\n  }\n\n  a.TestOnlyUnmap();\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, SizeClassAllocator64Overflow) {\n  EXPECT_DEATH(FailInAssertionOnOOM<Allocator64>(), \"Out of memory\");\n}\n#endif\n\nTEST(SanitizerCommon, LargeMmapAllocator) {\n  LargeMmapAllocator a;\n  a.Init();\n\n  static const int kNumAllocs = 100;\n  void *allocated[kNumAllocs];\n  static const uptr size = 1000;\n  \/\/ Allocate some.\n  for (int i = 0; i < kNumAllocs; i++) {\n    allocated[i] = a.Allocate(size, 1);\n  }\n  \/\/ Deallocate all.\n  CHECK_GT(a.TotalMemoryUsed(), size * kNumAllocs);\n  for (int i = 0; i < kNumAllocs; i++) {\n    void *p = allocated[i];\n    CHECK(a.PointerIsMine(p));\n    a.Deallocate(p);\n  }\n  \/\/ Check that non left.\n  CHECK_EQ(a.TotalMemoryUsed(), 0);\n\n  \/\/ Allocate some more, also add metadata.\n  for (int i = 0; i < kNumAllocs; i++) {\n    void *x = a.Allocate(size, 1);\n    CHECK_GE(a.GetActuallyAllocatedSize(x), size);\n    uptr *meta = reinterpret_cast<uptr*>(a.GetMetaData(x));\n    *meta = i;\n    allocated[i] = x;\n  }\n  CHECK_GT(a.TotalMemoryUsed(), size * kNumAllocs);\n  \/\/ Deallocate all in reverse order.\n  for (int i = 0; i < kNumAllocs; i++) {\n    int idx = kNumAllocs - i - 1;\n    void *p = allocated[idx];\n    uptr *meta = reinterpret_cast<uptr*>(a.GetMetaData(p));\n    CHECK_EQ(*meta, idx);\n    CHECK(a.PointerIsMine(p));\n    a.Deallocate(p);\n  }\n  CHECK_EQ(a.TotalMemoryUsed(), 0);\n  uptr max_alignment = SANITIZER_WORDSIZE == 64 ? (1 << 28) : (1 << 24);\n  for (uptr alignment = 8; alignment <= max_alignment; alignment *= 2) {\n    for (int i = 0; i < kNumAllocs; i++) {\n      uptr size = ((i % 10) + 1) * 4096;\n      allocated[i] = a.Allocate(size, alignment);\n      CHECK_EQ(0, (uptr)allocated[i] % alignment);\n      char *p = (char*)allocated[i];\n      p[0] = p[size - 1] = 0;\n    }\n    for (int i = 0; i < kNumAllocs; i++) {\n      a.Deallocate(allocated[i]);\n    }\n  }\n}\n\ntemplate\n<class PrimaryAllocator, class SecondaryAllocator, class AllocatorCache>\nvoid TestCombinedAllocator() {\n  CombinedAllocator<PrimaryAllocator, AllocatorCache, SecondaryAllocator> a;\n  a.Init();\n\n  AllocatorCache cache;\n  cache.Init();\n\n  EXPECT_EQ(a.Allocate(&cache, -1, 1), (void*)0);\n  EXPECT_EQ(a.Allocate(&cache, -1, 1024), (void*)0);\n  EXPECT_EQ(a.Allocate(&cache, (uptr)-1 - 1024, 1), (void*)0);\n  EXPECT_EQ(a.Allocate(&cache, (uptr)-1 - 1024, 1024), (void*)0);\n  EXPECT_EQ(a.Allocate(&cache, (uptr)-1 - 1023, 1024), (void*)0);\n\n  const uptr kNumAllocs = 100000;\n  const uptr kNumIter = 10;\n  for (uptr iter = 0; iter < kNumIter; iter++) {\n    std::vector<void*> allocated;\n    for (uptr i = 0; i < kNumAllocs; i++) {\n      uptr size = (i % (1 << 14)) + 1;\n      if ((i % 1024) == 0)\n        size = 1 << (10 + (i % 14));\n      void *x = a.Allocate(&cache, size, 1);\n      uptr *meta = reinterpret_cast<uptr*>(a.GetMetaData(x));\n      CHECK_EQ(*meta, 0);\n      *meta = size;\n      allocated.push_back(x);\n    }\n\n    random_shuffle(allocated.begin(), allocated.end());\n\n    for (uptr i = 0; i < kNumAllocs; i++) {\n      void *x = allocated[i];\n      uptr *meta = reinterpret_cast<uptr*>(a.GetMetaData(x));\n      CHECK_NE(*meta, 0);\n      CHECK(a.PointerIsMine(x));\n      *meta = 0;\n      a.Deallocate(&cache, x);\n    }\n    allocated.clear();\n    a.SwallowCache(&cache);\n  }\n  a.TestOnlyUnmap();\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, CombinedAllocator) {\n  TestCombinedAllocator<Allocator64,\n      LargeMmapAllocator,\n      SizeClassAllocatorLocalCache<Allocator64> > ();\n}\n#endif\n\ntemplate <class AllocatorCache>\nvoid TestSizeClassAllocatorLocalCache() {\n  static THREADLOCAL AllocatorCache static_allocator_cache;\n  static_allocator_cache.Init();\n  AllocatorCache cache;\n  typename AllocatorCache::Allocator a;\n\n  a.Init();\n  cache.Init();\n\n  const uptr kNumAllocs = 10000;\n  const int kNumIter = 100;\n  uptr saved_total = 0;\n  for (int i = 0; i < kNumIter; i++) {\n    void *allocated[kNumAllocs];\n    for (uptr i = 0; i < kNumAllocs; i++) {\n      allocated[i] = cache.Allocate(&a, 0);\n    }\n    for (uptr i = 0; i < kNumAllocs; i++) {\n      cache.Deallocate(&a, 0, allocated[i]);\n    }\n    cache.Drain(&a);\n    uptr total_allocated = a.TotalMemoryUsed();\n    if (saved_total)\n      CHECK_EQ(saved_total, total_allocated);\n    saved_total = total_allocated;\n  }\n\n  a.TestOnlyUnmap();\n}\n\n#if SANITIZER_WORDSIZE == 64\nTEST(SanitizerCommon, SizeClassAllocator64LocalCache) {\n  TestSizeClassAllocatorLocalCache<\n      SizeClassAllocatorLocalCache<Allocator64> >();\n}\n#endif\n\nTEST(Allocator, Basic) {\n  char *p = (char*)InternalAlloc(10);\n  EXPECT_NE(p, (char*)0);\n  char *p2 = (char*)InternalAlloc(20);\n  EXPECT_NE(p2, (char*)0);\n  EXPECT_NE(p2, p);\n  InternalFree(p);\n  InternalFree(p2);\n}\n\nTEST(Allocator, Stress) {\n  const int kCount = 1000;\n  char *ptrs[kCount];\n  unsigned rnd = 42;\n  for (int i = 0; i < kCount; i++) {\n    uptr sz = rand_r(&rnd) % 1000;\n    char *p = (char*)InternalAlloc(sz);\n    EXPECT_NE(p, (char*)0);\n    ptrs[i] = p;\n  }\n  for (int i = 0; i < kCount; i++) {\n    InternalFree(ptrs[i]);\n  }\n}\n\nTEST(Allocator, ScopedBuffer) {\n  const int kSize = 512;\n  {\n    InternalScopedBuffer<int> int_buf(kSize);\n    EXPECT_EQ(sizeof(int) * kSize, int_buf.size());  \/\/ NOLINT\n  }\n  InternalScopedBuffer<char> char_buf(kSize);\n  EXPECT_EQ(sizeof(char) * kSize, char_buf.size());  \/\/ NOLINT\n  memset(char_buf.data(), 'c', kSize);\n  for (int i = 0; i < kSize; i++) {\n    EXPECT_EQ('c', char_buf[i]);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2007-2009, 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 \"IECore\/CompoundData.h\"\n#include \"IECore\/TypedData.inl\"\n\n#include <iostream>\nusing namespace std;\nusing namespace IECore;\n\nnamespace IECore\n{\n\nIECORE_RUNTIMETYPED_DEFINETEMPLATESPECIALISATION( CompoundData, CompoundDataTypeId, Data );\n\ntemplate<>\nvoid CompoundData::memoryUsage( Object::MemoryAccumulator &accumulator ) const\n{\n\tData::memoryUsage( accumulator );\n\tconst CompoundDataMap &data = readable();\n\tCompoundDataMap::const_iterator iter = data.begin();\n\twhile (iter != data.end())\n\t{\n\t\taccumulator.accumulate( iter->second );\n\t\titer++;\n\t}\n}\n\ntemplate<>\nvoid CompoundData::copyFrom( ConstObjectPtr other, CopyContext *context )\n{\n\tData::copyFrom( other, context );\n\tconst CompoundData *tOther = static_cast<const CompoundData *>( other.get() );\n\tCompoundDataMap &data = writable();\n\tdata.clear();\n\tconst CompoundDataMap &otherData = tOther->readable();\n\tfor( CompoundDataMap::const_iterator it = otherData.begin(); it!=otherData.end(); it++ )\n\t{\n\t\tdata[it->first] = context->copy<Data>( it->second );\n\t}\n}\n\ntemplate<>\nbool CompoundData::isEqualTo( ConstObjectPtr other ) const\n{\n\tif( !Data::isEqualTo( other ) )\n\t{\n\t\treturn false;\n\t}\n\tConstCompoundDataPtr tOther = boost::static_pointer_cast<const CompoundData>( other );\n\tconst CompoundDataMap &m1 = readable();\n\tconst CompoundDataMap &m2 = tOther->readable();\n\tif( m1.size()!=m2.size() )\n\t{\n\t\treturn false;\n\t}\n\tCompoundDataMap::const_iterator it1 = m1.begin();\n\tCompoundDataMap::const_iterator it2 = m2.begin();\n\twhile( it1!=m1.end() )\n\t{\n\t\tif( it1->first!=it2->first )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tif( ! it1->second->isEqualTo( it2->second ) )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tit1++;\n\t\tit2++;\n\t}\n\treturn true;\n}\n\ntemplate<>\nvoid CompoundData::save( SaveContext *context ) const\n{\n\tData::save( context );\n\tIndexedIOInterfacePtr container = context->container( staticTypeName(), 0 );\n\tcontainer->mkdir( \"members\" );\n\tcontainer->chdir( \"members\" );\n\t\tconst CompoundDataMap &m = readable();\n\t\tCompoundDataMap::const_iterator it;\n\t\tfor( it=m.begin(); it!=m.end(); it++ )\n\t\t{\n\t\t\tcontext->save( it->second, container, it->first );\n\t\t}\n\tcontainer->chdir( \"..\" );\n}\n\ntemplate<>\nvoid CompoundData::load( LoadContextPtr context )\n{\n\tData::load( context );\n\tunsigned int v = 0;\n\tIndexedIOInterfacePtr container = context->container( staticTypeName(), v );\n\tCompoundDataMap &m = writable();\n\tm.clear();\n\tcontainer->chdir( \"members\" );\n\t\tIndexedIO::EntryList members = container->ls();\n\t\tIndexedIO::EntryList::const_iterator it;\n\t\tfor( it=members.begin(); it!=members.end(); it++ )\n\t\t{\n\t\t\tm[it->id()] = context->load<Data>( container, it->id() );\n\t\t}\n\tcontainer->chdir( \"..\" );\n}\n\nIE_CORE_DEFINETYPEDDATANOBASESIZE( CompoundData )\n\n}\n\n\/\/ Instantiate that bad boy.\ntemplate class TypedData<CompoundDataMap>;\n<commit_msg>Added todo<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2007-2009, 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 \"IECore\/CompoundData.h\"\n#include \"IECore\/TypedData.inl\"\n\n#include <iostream>\nusing namespace std;\nusing namespace IECore;\n\nnamespace IECore\n{\n\nIECORE_RUNTIMETYPED_DEFINETEMPLATESPECIALISATION( CompoundData, CompoundDataTypeId, Data );\n\ntemplate<>\nvoid CompoundData::memoryUsage( Object::MemoryAccumulator &accumulator ) const\n{\n\tData::memoryUsage( accumulator );\n\tconst CompoundDataMap &data = readable();\n\tCompoundDataMap::const_iterator iter = data.begin();\n\twhile (iter != data.end())\n\t{\n\t\t\/\/\/ \\todo Accumulate size of keys, too (iter->first), as this\n\t\t\/\/\/ can be significant\n\t\taccumulator.accumulate( iter->second );\n\t\titer++;\n\t}\n}\n\ntemplate<>\nvoid CompoundData::copyFrom( ConstObjectPtr other, CopyContext *context )\n{\n\tData::copyFrom( other, context );\n\tconst CompoundData *tOther = static_cast<const CompoundData *>( other.get() );\n\tCompoundDataMap &data = writable();\n\tdata.clear();\n\tconst CompoundDataMap &otherData = tOther->readable();\n\tfor( CompoundDataMap::const_iterator it = otherData.begin(); it!=otherData.end(); it++ )\n\t{\n\t\tdata[it->first] = context->copy<Data>( it->second );\n\t}\n}\n\ntemplate<>\nbool CompoundData::isEqualTo( ConstObjectPtr other ) const\n{\n\tif( !Data::isEqualTo( other ) )\n\t{\n\t\treturn false;\n\t}\n\tConstCompoundDataPtr tOther = boost::static_pointer_cast<const CompoundData>( other );\n\tconst CompoundDataMap &m1 = readable();\n\tconst CompoundDataMap &m2 = tOther->readable();\n\tif( m1.size()!=m2.size() )\n\t{\n\t\treturn false;\n\t}\n\tCompoundDataMap::const_iterator it1 = m1.begin();\n\tCompoundDataMap::const_iterator it2 = m2.begin();\n\twhile( it1!=m1.end() )\n\t{\n\t\tif( it1->first!=it2->first )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tif( ! it1->second->isEqualTo( it2->second ) )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tit1++;\n\t\tit2++;\n\t}\n\treturn true;\n}\n\ntemplate<>\nvoid CompoundData::save( SaveContext *context ) const\n{\n\tData::save( context );\n\tIndexedIOInterfacePtr container = context->container( staticTypeName(), 0 );\n\tcontainer->mkdir( \"members\" );\n\tcontainer->chdir( \"members\" );\n\t\tconst CompoundDataMap &m = readable();\n\t\tCompoundDataMap::const_iterator it;\n\t\tfor( it=m.begin(); it!=m.end(); it++ )\n\t\t{\n\t\t\tcontext->save( it->second, container, it->first );\n\t\t}\n\tcontainer->chdir( \"..\" );\n}\n\ntemplate<>\nvoid CompoundData::load( LoadContextPtr context )\n{\n\tData::load( context );\n\tunsigned int v = 0;\n\tIndexedIOInterfacePtr container = context->container( staticTypeName(), v );\n\tCompoundDataMap &m = writable();\n\tm.clear();\n\tcontainer->chdir( \"members\" );\n\t\tIndexedIO::EntryList members = container->ls();\n\t\tIndexedIO::EntryList::const_iterator it;\n\t\tfor( it=members.begin(); it!=members.end(); it++ )\n\t\t{\n\t\t\tm[it->id()] = context->load<Data>( container, it->id() );\n\t\t}\n\tcontainer->chdir( \"..\" );\n}\n\nIE_CORE_DEFINETYPEDDATANOBASESIZE( CompoundData )\n\n}\n\n\/\/ Instantiate that bad boy.\ntemplate class TypedData<CompoundDataMap>;\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\/bookmark_utils_gtk.h\"\n\n#include \"app\/gtk_dnd_util.h\"\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/gfx\/gtk_util.h\"\n#include \"base\/pickle.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_drag_data.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_model.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_utils.h\"\n#include \"chrome\/browser\/gtk\/gtk_chrome_button.h\"\n#include \"chrome\/browser\/gtk\/gtk_theme_provider.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/gtk_util.h\"\n\nnamespace {\n\n\/\/ Used in gtk_selection_data_set(). (I assume from this parameter that gtk has\n\/\/ to some really exotic hardware...)\nconst int kBitsInAByte = 8;\n\n\/\/ Maximum number of characters on a bookmark button.\nconst size_t kMaxCharsOnAButton = 15;\n\n\/\/ Max size of each component of the button tooltips.\nconst size_t kMaxTooltipTitleLength = 100;\nconst size_t kMaxTooltipURLLength = 400;\n\n\/\/ Only used for the background of the drag widget.\nconst GdkColor kBackgroundColor = GDK_COLOR_RGB(0xe6, 0xed, 0xf4);\n\n\/\/ Padding between the chrome button highlight border and the contents (favicon,\n\/\/ text).\n\/\/ TODO(estade): we need to adjust the top and bottom padding, but first we need\n\/\/ to give the bookmark bar more space (at the expense of the toolbar).\nconst int kButtonPaddingTop = 0;\nconst int kButtonPaddingBottom = 0;\nconst int kButtonPaddingLeft = 2;\nconst int kButtonPaddingRight = 0;\n\nvoid* AsVoid(const BookmarkNode* node) {\n  return const_cast<BookmarkNode*>(node);\n}\n\n}  \/\/ namespace\n\nnamespace bookmark_utils {\n\nconst char kBookmarkNode[] = \"bookmark-node\";\n\n\/\/ Spacing between the buttons on the bar.\nconst int kBarButtonPadding = 4;\n\nGdkPixbuf* GetPixbufForNode(const BookmarkNode* node, BookmarkModel* model,\n                            bool native) {\n  GdkPixbuf* pixbuf;\n\n  if (node->is_url()) {\n    if (model->GetFavIcon(node).width() != 0) {\n      pixbuf = gfx::GdkPixbufFromSkBitmap(&model->GetFavIcon(node));\n    } else {\n      pixbuf = GtkThemeProvider::GetDefaultFavicon(native);\n      g_object_ref(pixbuf);\n    }\n  } else {\n    pixbuf = GtkThemeProvider::GetFolderIcon(native);\n    g_object_ref(pixbuf);\n  }\n\n  return pixbuf;\n}\n\nGtkWidget* GetDragRepresentation(const BookmarkNode* node,\n                                 BookmarkModel* model,\n                                 GtkThemeProvider* provider) {\n  \/\/ Build a windowed representation for our button.\n  GtkWidget* window = gtk_window_new(GTK_WINDOW_POPUP);\n  if (!provider->UseGtkTheme()) {\n    \/\/ TODO(erg): Theme wise, which color should I be picking here?\n    \/\/ COLOR_BUTTON_BACKGROUND doesn't match the default theme!\n    gtk_widget_modify_bg(window, GTK_STATE_NORMAL, &kBackgroundColor);\n  }\n  gtk_widget_realize(window);\n\n  GtkWidget* frame = gtk_frame_new(NULL);\n  gtk_frame_set_shadow_type(GTK_FRAME(frame), GTK_SHADOW_OUT);\n  gtk_container_add(GTK_CONTAINER(window), frame);\n  gtk_widget_show(frame);\n\n  GtkWidget* floating_button = provider->BuildChromeButton();\n  bookmark_utils::ConfigureButtonForNode(node, model, floating_button,\n                                         provider);\n  gtk_container_add(GTK_CONTAINER(frame), floating_button);\n  gtk_widget_show(floating_button);\n\n  return window;\n}\n\nvoid ConfigureButtonForNode(const BookmarkNode* node, BookmarkModel* model,\n                            GtkWidget* button, GtkThemeProvider* provider) {\n  GtkWidget* former_child = gtk_bin_get_child(GTK_BIN(button));\n  if (former_child)\n    gtk_container_remove(GTK_CONTAINER(button), former_child);\n\n  std::string tooltip = BuildTooltipFor(node);\n  if (!tooltip.empty())\n    gtk_widget_set_tooltip_markup(button, tooltip.c_str());\n\n  \/\/ We pack the button manually (rather than using gtk_button_set_*) so that\n  \/\/ we can have finer control over its label.\n  GdkPixbuf* pixbuf = bookmark_utils::GetPixbufForNode(node, model,\n                                                       provider->UseGtkTheme());\n  GtkWidget* image = gtk_image_new_from_pixbuf(pixbuf);\n  g_object_unref(pixbuf);\n\n  GtkWidget* box = gtk_hbox_new(FALSE, kBarButtonPadding);\n  gtk_box_pack_start(GTK_BOX(box), image, FALSE, FALSE, 0);\n\n  std::string label_string = WideToUTF8(node->GetTitle());\n  if (!label_string.empty()) {\n    GtkWidget* label = gtk_label_new(label_string.c_str());\n    gtk_label_set_max_width_chars(GTK_LABEL(label), kMaxCharsOnAButton);\n    gtk_label_set_ellipsize(GTK_LABEL(label), PANGO_ELLIPSIZE_END);\n    gtk_box_pack_start(GTK_BOX(box), label, FALSE, FALSE, 0);\n    SetButtonTextColors(label, provider);\n  }\n\n  GtkWidget* alignment = gtk_alignment_new(0.0, 0.0, 1.0, 1.0);\n  \/\/ If we are not showing the label, don't set any padding, so that the icon\n  \/\/ will just be centered.\n  if (label_string.c_str()) {\n    gtk_alignment_set_padding(GTK_ALIGNMENT(alignment),\n        kButtonPaddingTop, kButtonPaddingBottom,\n        kButtonPaddingLeft, kButtonPaddingRight);\n  }\n  gtk_container_add(GTK_CONTAINER(alignment), box);\n  gtk_container_add(GTK_CONTAINER(button), alignment);\n\n  g_object_set_data(G_OBJECT(button), bookmark_utils::kBookmarkNode,\n                    AsVoid(node));\n\n  gtk_widget_show_all(alignment);\n}\n\nstd::string BuildTooltipFor(const BookmarkNode* node) {\n  const std::string& url = node->GetURL().possibly_invalid_spec();\n  const std::string& title = WideToUTF8(node->GetTitle());\n\n  std::string truncated_url = WideToUTF8(l10n_util::TruncateString(\n      UTF8ToWide(url), kMaxTooltipURLLength));\n  gchar* escaped_url_cstr = g_markup_escape_text(truncated_url.c_str(),\n                                                 truncated_url.size());\n  std::string escaped_url(escaped_url_cstr);\n  g_free(escaped_url_cstr);\n\n  std::string tooltip;\n  if (url == title || title.empty()) {\n    return escaped_url;\n  } else {\n    std::string truncated_title = WideToUTF8(l10n_util::TruncateString(\n      node->GetTitle(), kMaxTooltipTitleLength));\n    gchar* escaped_title_cstr = g_markup_escape_text(truncated_title.c_str(),\n                                                     truncated_title.size());\n    std::string escaped_title(escaped_title_cstr);\n    g_free(escaped_title_cstr);\n\n    if (!escaped_url.empty())\n      return std::string(\"<b>\") + escaped_title + \"<\/b>\\n\" + escaped_url;\n    else\n      return std::string(\"<b>\") + escaped_title + \"<\/b>\";\n  }\n}\n\nconst BookmarkNode* BookmarkNodeForWidget(GtkWidget* widget) {\n  return reinterpret_cast<const BookmarkNode*>(\n      g_object_get_data(G_OBJECT(widget), bookmark_utils::kBookmarkNode));\n}\n\nvoid SetButtonTextColors(GtkWidget* label, GtkThemeProvider* provider) {\n  if (provider->UseGtkTheme()) {\n    gtk_util::SetLabelColor(label, NULL);\n  } else {\n    GdkColor color = provider->GetGdkColor(\n        BrowserThemeProvider::COLOR_BOOKMARK_TEXT);\n    gtk_util::SetLabelColor(label, &color);\n  }\n}\n\n\/\/ DnD-related -----------------------------------------------------------------\n\nvoid WriteBookmarkToSelection(const BookmarkNode* node,\n                              GtkSelectionData* selection_data,\n                              guint target_type,\n                              Profile* profile) {\n  DCHECK(node);\n  std::vector<const BookmarkNode*> nodes;\n  nodes.push_back(node);\n  WriteBookmarksToSelection(nodes, selection_data, target_type, profile);\n}\n\nvoid WriteBookmarksToSelection(const std::vector<const BookmarkNode*>& nodes,\n                               GtkSelectionData* selection_data,\n                               guint target_type,\n                               Profile* profile) {\n  switch (target_type) {\n    case GtkDndUtil::CHROME_BOOKMARK_ITEM: {\n      BookmarkDragData data(nodes);\n      Pickle pickle;\n      data.WriteToPickle(profile, &pickle);\n\n      gtk_selection_data_set(selection_data, selection_data->target,\n                             kBitsInAByte,\n                             static_cast<const guchar*>(pickle.data()),\n                             pickle.size());\n      break;\n    }\n    case GtkDndUtil::TEXT_URI_LIST: {\n      gchar** uris = reinterpret_cast<gchar**>(malloc(sizeof(gchar*) *\n                                               (nodes.size() + 1)));\n      for (size_t i = 0; i < nodes.size(); ++i) {\n        \/\/ If the node is a folder, this will be empty. TODO(estade): figure out\n        \/\/ if there are any ramifications to passing an empty URI. After a\n        \/\/ little testing, it seems fine.\n        const GURL& url = nodes[i]->GetURL();\n        \/\/ This const cast should be safe as gtk_selection_data_set_uris()\n        \/\/ makes copies.\n        uris[i] = const_cast<gchar*>(url.spec().c_str());\n      }\n      uris[nodes.size()] = NULL;\n\n      gtk_selection_data_set_uris(selection_data, uris);\n      free(uris);\n      break;\n    }\n    default: {\n      DLOG(ERROR) << \"Unsupported drag get type!\";\n    }\n  }\n}\n\nstd::vector<const BookmarkNode*> GetNodesFromSelection(\n    GdkDragContext* context,\n    GtkSelectionData* selection_data,\n    guint target_type,\n    Profile* profile,\n    gboolean* delete_selection_data,\n    gboolean* dnd_success) {\n  *delete_selection_data = FALSE;\n  *dnd_success = FALSE;\n\n  if ((selection_data != NULL) && (selection_data->length >= 0)) {\n    if (context->action == GDK_ACTION_MOVE) {\n      *delete_selection_data = TRUE;\n    }\n\n    switch (target_type) {\n      case GtkDndUtil::CHROME_BOOKMARK_ITEM: {\n        *dnd_success = TRUE;\n        Pickle pickle(reinterpret_cast<char*>(selection_data->data),\n                      selection_data->length);\n        BookmarkDragData drag_data;\n        drag_data.ReadFromPickle(&pickle);\n        return drag_data.GetNodes(profile);\n      }\n      default: {\n        DLOG(ERROR) << \"Unsupported drag received type: \" << target_type;\n      }\n    }\n  }\n\n  return std::vector<const BookmarkNode*>();\n}\n\nbool CreateNewBookmarkFromNamedUrl(GtkSelectionData* selection_data,\n    BookmarkModel* model, const BookmarkNode* parent, int idx) {\n  GURL url;\n  string16 title;\n  if (!GtkDndUtil::ExtractNamedURL(selection_data, &url, &title))\n    return false;\n\n  model->AddURL(parent, idx, UTF16ToWideHack(title), url);\n  return true;\n}\n\nbool CreateNewBookmarksFromURIList(GtkSelectionData* selection_data,\n    BookmarkModel* model, const BookmarkNode* parent, int idx) {\n  std::vector<GURL> urls;\n  GtkDndUtil::ExtractURIList(selection_data, &urls);\n  for (size_t i = 0; i < urls.size(); ++i) {\n    std::string title = GetNameForURL(urls[i]);\n    model->AddURL(parent, idx++, UTF8ToWide(title), urls[i]);\n  }\n  return true;\n}\n\n}  \/\/ namespace bookmark_utils\n<commit_msg>GTK: Don't ellipsize the Other Bookmarks button.<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\/bookmark_utils_gtk.h\"\n\n#include \"app\/gtk_dnd_util.h\"\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/gfx\/gtk_util.h\"\n#include \"base\/pickle.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_drag_data.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_model.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_utils.h\"\n#include \"chrome\/browser\/gtk\/gtk_chrome_button.h\"\n#include \"chrome\/browser\/gtk\/gtk_theme_provider.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/gtk_util.h\"\n\nnamespace {\n\n\/\/ Used in gtk_selection_data_set(). (I assume from this parameter that gtk has\n\/\/ to some really exotic hardware...)\nconst int kBitsInAByte = 8;\n\n\/\/ Maximum number of characters on a bookmark button.\nconst size_t kMaxCharsOnAButton = 15;\n\n\/\/ Max size of each component of the button tooltips.\nconst size_t kMaxTooltipTitleLength = 100;\nconst size_t kMaxTooltipURLLength = 400;\n\n\/\/ Only used for the background of the drag widget.\nconst GdkColor kBackgroundColor = GDK_COLOR_RGB(0xe6, 0xed, 0xf4);\n\n\/\/ Padding between the chrome button highlight border and the contents (favicon,\n\/\/ text).\n\/\/ TODO(estade): we need to adjust the top and bottom padding, but first we need\n\/\/ to give the bookmark bar more space (at the expense of the toolbar).\nconst int kButtonPaddingTop = 0;\nconst int kButtonPaddingBottom = 0;\nconst int kButtonPaddingLeft = 2;\nconst int kButtonPaddingRight = 0;\n\nvoid* AsVoid(const BookmarkNode* node) {\n  return const_cast<BookmarkNode*>(node);\n}\n\n}  \/\/ namespace\n\nnamespace bookmark_utils {\n\nconst char kBookmarkNode[] = \"bookmark-node\";\n\n\/\/ Spacing between the buttons on the bar.\nconst int kBarButtonPadding = 4;\n\nGdkPixbuf* GetPixbufForNode(const BookmarkNode* node, BookmarkModel* model,\n                            bool native) {\n  GdkPixbuf* pixbuf;\n\n  if (node->is_url()) {\n    if (model->GetFavIcon(node).width() != 0) {\n      pixbuf = gfx::GdkPixbufFromSkBitmap(&model->GetFavIcon(node));\n    } else {\n      pixbuf = GtkThemeProvider::GetDefaultFavicon(native);\n      g_object_ref(pixbuf);\n    }\n  } else {\n    pixbuf = GtkThemeProvider::GetFolderIcon(native);\n    g_object_ref(pixbuf);\n  }\n\n  return pixbuf;\n}\n\nGtkWidget* GetDragRepresentation(const BookmarkNode* node,\n                                 BookmarkModel* model,\n                                 GtkThemeProvider* provider) {\n  \/\/ Build a windowed representation for our button.\n  GtkWidget* window = gtk_window_new(GTK_WINDOW_POPUP);\n  if (!provider->UseGtkTheme()) {\n    \/\/ TODO(erg): Theme wise, which color should I be picking here?\n    \/\/ COLOR_BUTTON_BACKGROUND doesn't match the default theme!\n    gtk_widget_modify_bg(window, GTK_STATE_NORMAL, &kBackgroundColor);\n  }\n  gtk_widget_realize(window);\n\n  GtkWidget* frame = gtk_frame_new(NULL);\n  gtk_frame_set_shadow_type(GTK_FRAME(frame), GTK_SHADOW_OUT);\n  gtk_container_add(GTK_CONTAINER(window), frame);\n  gtk_widget_show(frame);\n\n  GtkWidget* floating_button = provider->BuildChromeButton();\n  bookmark_utils::ConfigureButtonForNode(node, model, floating_button,\n                                         provider);\n  gtk_container_add(GTK_CONTAINER(frame), floating_button);\n  gtk_widget_show(floating_button);\n\n  return window;\n}\n\nvoid ConfigureButtonForNode(const BookmarkNode* node, BookmarkModel* model,\n                            GtkWidget* button, GtkThemeProvider* provider) {\n  GtkWidget* former_child = gtk_bin_get_child(GTK_BIN(button));\n  if (former_child)\n    gtk_container_remove(GTK_CONTAINER(button), former_child);\n\n  std::string tooltip = BuildTooltipFor(node);\n  if (!tooltip.empty())\n    gtk_widget_set_tooltip_markup(button, tooltip.c_str());\n\n  \/\/ We pack the button manually (rather than using gtk_button_set_*) so that\n  \/\/ we can have finer control over its label.\n  GdkPixbuf* pixbuf = bookmark_utils::GetPixbufForNode(node, model,\n                                                       provider->UseGtkTheme());\n  GtkWidget* image = gtk_image_new_from_pixbuf(pixbuf);\n  g_object_unref(pixbuf);\n\n  GtkWidget* box = gtk_hbox_new(FALSE, kBarButtonPadding);\n  gtk_box_pack_start(GTK_BOX(box), image, FALSE, FALSE, 0);\n\n  std::string label_string = WideToUTF8(node->GetTitle());\n  if (!label_string.empty()) {\n    GtkWidget* label = gtk_label_new(label_string.c_str());\n\n    \/\/ Ellipsize long bookmark names.\n    if (node != model->other_node()) {\n      gtk_label_set_max_width_chars(GTK_LABEL(label), kMaxCharsOnAButton);\n      gtk_label_set_ellipsize(GTK_LABEL(label), PANGO_ELLIPSIZE_END);\n    }\n\n    gtk_box_pack_start(GTK_BOX(box), label, FALSE, FALSE, 0);\n    SetButtonTextColors(label, provider);\n  }\n\n  GtkWidget* alignment = gtk_alignment_new(0.0, 0.0, 1.0, 1.0);\n  \/\/ If we are not showing the label, don't set any padding, so that the icon\n  \/\/ will just be centered.\n  if (label_string.c_str()) {\n    gtk_alignment_set_padding(GTK_ALIGNMENT(alignment),\n        kButtonPaddingTop, kButtonPaddingBottom,\n        kButtonPaddingLeft, kButtonPaddingRight);\n  }\n  gtk_container_add(GTK_CONTAINER(alignment), box);\n  gtk_container_add(GTK_CONTAINER(button), alignment);\n\n  g_object_set_data(G_OBJECT(button), bookmark_utils::kBookmarkNode,\n                    AsVoid(node));\n\n  gtk_widget_show_all(alignment);\n}\n\nstd::string BuildTooltipFor(const BookmarkNode* node) {\n  const std::string& url = node->GetURL().possibly_invalid_spec();\n  const std::string& title = WideToUTF8(node->GetTitle());\n\n  std::string truncated_url = WideToUTF8(l10n_util::TruncateString(\n      UTF8ToWide(url), kMaxTooltipURLLength));\n  gchar* escaped_url_cstr = g_markup_escape_text(truncated_url.c_str(),\n                                                 truncated_url.size());\n  std::string escaped_url(escaped_url_cstr);\n  g_free(escaped_url_cstr);\n\n  std::string tooltip;\n  if (url == title || title.empty()) {\n    return escaped_url;\n  } else {\n    std::string truncated_title = WideToUTF8(l10n_util::TruncateString(\n      node->GetTitle(), kMaxTooltipTitleLength));\n    gchar* escaped_title_cstr = g_markup_escape_text(truncated_title.c_str(),\n                                                     truncated_title.size());\n    std::string escaped_title(escaped_title_cstr);\n    g_free(escaped_title_cstr);\n\n    if (!escaped_url.empty())\n      return std::string(\"<b>\") + escaped_title + \"<\/b>\\n\" + escaped_url;\n    else\n      return std::string(\"<b>\") + escaped_title + \"<\/b>\";\n  }\n}\n\nconst BookmarkNode* BookmarkNodeForWidget(GtkWidget* widget) {\n  return reinterpret_cast<const BookmarkNode*>(\n      g_object_get_data(G_OBJECT(widget), bookmark_utils::kBookmarkNode));\n}\n\nvoid SetButtonTextColors(GtkWidget* label, GtkThemeProvider* provider) {\n  if (provider->UseGtkTheme()) {\n    gtk_util::SetLabelColor(label, NULL);\n  } else {\n    GdkColor color = provider->GetGdkColor(\n        BrowserThemeProvider::COLOR_BOOKMARK_TEXT);\n    gtk_util::SetLabelColor(label, &color);\n  }\n}\n\n\/\/ DnD-related -----------------------------------------------------------------\n\nvoid WriteBookmarkToSelection(const BookmarkNode* node,\n                              GtkSelectionData* selection_data,\n                              guint target_type,\n                              Profile* profile) {\n  DCHECK(node);\n  std::vector<const BookmarkNode*> nodes;\n  nodes.push_back(node);\n  WriteBookmarksToSelection(nodes, selection_data, target_type, profile);\n}\n\nvoid WriteBookmarksToSelection(const std::vector<const BookmarkNode*>& nodes,\n                               GtkSelectionData* selection_data,\n                               guint target_type,\n                               Profile* profile) {\n  switch (target_type) {\n    case GtkDndUtil::CHROME_BOOKMARK_ITEM: {\n      BookmarkDragData data(nodes);\n      Pickle pickle;\n      data.WriteToPickle(profile, &pickle);\n\n      gtk_selection_data_set(selection_data, selection_data->target,\n                             kBitsInAByte,\n                             static_cast<const guchar*>(pickle.data()),\n                             pickle.size());\n      break;\n    }\n    case GtkDndUtil::TEXT_URI_LIST: {\n      gchar** uris = reinterpret_cast<gchar**>(malloc(sizeof(gchar*) *\n                                               (nodes.size() + 1)));\n      for (size_t i = 0; i < nodes.size(); ++i) {\n        \/\/ If the node is a folder, this will be empty. TODO(estade): figure out\n        \/\/ if there are any ramifications to passing an empty URI. After a\n        \/\/ little testing, it seems fine.\n        const GURL& url = nodes[i]->GetURL();\n        \/\/ This const cast should be safe as gtk_selection_data_set_uris()\n        \/\/ makes copies.\n        uris[i] = const_cast<gchar*>(url.spec().c_str());\n      }\n      uris[nodes.size()] = NULL;\n\n      gtk_selection_data_set_uris(selection_data, uris);\n      free(uris);\n      break;\n    }\n    default: {\n      DLOG(ERROR) << \"Unsupported drag get type!\";\n    }\n  }\n}\n\nstd::vector<const BookmarkNode*> GetNodesFromSelection(\n    GdkDragContext* context,\n    GtkSelectionData* selection_data,\n    guint target_type,\n    Profile* profile,\n    gboolean* delete_selection_data,\n    gboolean* dnd_success) {\n  *delete_selection_data = FALSE;\n  *dnd_success = FALSE;\n\n  if ((selection_data != NULL) && (selection_data->length >= 0)) {\n    if (context->action == GDK_ACTION_MOVE) {\n      *delete_selection_data = TRUE;\n    }\n\n    switch (target_type) {\n      case GtkDndUtil::CHROME_BOOKMARK_ITEM: {\n        *dnd_success = TRUE;\n        Pickle pickle(reinterpret_cast<char*>(selection_data->data),\n                      selection_data->length);\n        BookmarkDragData drag_data;\n        drag_data.ReadFromPickle(&pickle);\n        return drag_data.GetNodes(profile);\n      }\n      default: {\n        DLOG(ERROR) << \"Unsupported drag received type: \" << target_type;\n      }\n    }\n  }\n\n  return std::vector<const BookmarkNode*>();\n}\n\nbool CreateNewBookmarkFromNamedUrl(GtkSelectionData* selection_data,\n    BookmarkModel* model, const BookmarkNode* parent, int idx) {\n  GURL url;\n  string16 title;\n  if (!GtkDndUtil::ExtractNamedURL(selection_data, &url, &title))\n    return false;\n\n  model->AddURL(parent, idx, UTF16ToWideHack(title), url);\n  return true;\n}\n\nbool CreateNewBookmarksFromURIList(GtkSelectionData* selection_data,\n    BookmarkModel* model, const BookmarkNode* parent, int idx) {\n  std::vector<GURL> urls;\n  GtkDndUtil::ExtractURIList(selection_data, &urls);\n  for (size_t i = 0; i < urls.size(); ++i) {\n    std::string title = GetNameForURL(urls[i]);\n    model->AddURL(parent, idx++, UTF8ToWide(title), urls[i]);\n  }\n  return true;\n}\n\n}  \/\/ namespace bookmark_utils\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Aql item block\n\/\/\/\n\/\/\/ @file \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\/AqlItemBlock.h\"\n\nusing namespace triagens::aql;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                      AqlItemBlock\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                        constructors \/ destructors\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief create the block\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock::AqlItemBlock (size_t nrItems, \n                            RegisterId nrRegs)\n  : _nrItems(nrItems), _nrRegs(nrRegs) {\n\n  TRI_ASSERT(nrItems > 0);  \/\/ no, empty AqlItemBlocks are not allowed!\n\n  if (nrItems > 0 && nrRegs > 0) {\n    _data.reserve(nrItems * nrRegs);\n    for (size_t i = 0; i < nrItems * nrRegs; ++i) {\n      _data.emplace_back();\n    }\n  }\n \n  if (nrRegs > 0) {\n    _docColls.reserve(nrRegs);\n    for (size_t i = 0; i < nrRegs; ++i) {\n      _docColls.push_back(nullptr);\n    }\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief destroy the block\n\/\/\/ TODO: dtor is not exception-safe\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock::~AqlItemBlock () {\n  for (size_t i = 0; i < _nrItems * _nrRegs; i++) {\n    if (! _data[i].isEmpty()) {\n      auto it = _valueCount.find(_data[i]);\n      if (it != _valueCount.end()) { \/\/ if we know it, we are still responsible\n        if (--(it->second) == 0) {\n          _data[i].destroy();\n          try {\n            _valueCount.erase(it);\n          }\n          catch (...) {\n          }\n        }\n      }\n      \/\/ Note that if we do not know it the thing it has been stolen from us!\n    }\n  }\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                    public methods\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief shrink the block to the specified number of rows\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid AqlItemBlock::shrink (size_t nrItems) {\n  TRI_ASSERT(nrItems > 0);\n\n  if (nrItems == _nrItems) {\n    \/\/ nothing to do\n    return;\n  }\n  \n  if (nrItems > _nrItems) {\n    \/\/ cannot use shrink() to increase the size of the block\n    THROW_ARANGO_EXCEPTION(TRI_ERROR_INTERNAL);\n  }\n\n  \/\/ erase all stored values in the region that we freed\n  for (size_t i = nrItems; i < _nrItems; ++i) {\n    for (RegisterId j = 0; j < _nrRegs; ++j) {\n      eraseValue(i, j);\n    }\n  }\n\n  \/\/ adjust the size of the block\n  _nrItems = nrItems;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief clears out some columns (registers), this deletes the values if\n\/\/\/ necessary, using the reference count.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid AqlItemBlock::clearRegisters (std::unordered_set<RegisterId>& toClear) {\n  for (auto reg : toClear) {\n    for (size_t i = 0; i < _nrItems; i++) {\n      AqlValue& a(_data[_nrRegs * i + reg]);\n      if (! a.isEmpty()) {\n        auto it = _valueCount.find(a);\n        if (it != _valueCount.end()) {\n          if (--it->second == 0) {\n            try {\n              _valueCount.erase(it);\n            }\n            catch (...) {\n              it->second++;\n              throw;\n            }\n          }\n        }\n        a.erase();\n      }\n    }\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief slice\/clone, this does a deep copy of all entries\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock* AqlItemBlock::slice (size_t from, \n                                   size_t to) const {\n  TRI_ASSERT(from < to && to <= _nrItems);\n\n  std::unordered_map<AqlValue, AqlValue> cache;\n  \/\/ TODO: should we pre-reserve space for cache to avoid later re-allocations?\n\n  AqlItemBlock* res = nullptr;\n  try {\n    res = new AqlItemBlock(to - from, _nrRegs);\n\n    for (RegisterId col = 0; col < _nrRegs; col++) {\n      res->_docColls[col] = _docColls[col];\n    }\n    for (size_t row = from; row < to; row++) {\n      for (RegisterId col = 0; col < _nrRegs; col++) {\n        AqlValue const& a(_data[row * _nrRegs + col]);\n\n        if (! a.isEmpty()) {\n          auto it = cache.find(a);\n          if (it == cache.end()) {\n            AqlValue b = a.clone();\n            res->_data[(row - from) * _nrRegs + col] = b;\n            \/\/ TODO: can we use emplace() here instead of insert()?\n            cache.insert(make_pair(a, b));\n          }\n          else {\n            res->_data[(row - from) * _nrRegs + col] = it->second;\n          }\n        }\n      }\n    }\n\n    return res;\n  }\n  catch (...) {\n    delete res;\n    throw;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief slice\/clone chosen rows for a subset, this does a deep copy\n\/\/\/ of all entries\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock* AqlItemBlock::slice (std::vector<size_t>& chosen, \n                                   size_t from, \n                                   size_t to) const {\n  TRI_ASSERT(from < to && to <= chosen.size());\n\n  std::unordered_map<AqlValue, AqlValue> cache;\n  \/\/ TODO: should we pre-reserve space for cache to avoid later re-allocations?\n\n  AqlItemBlock* res = nullptr;\n  try {\n    res = new AqlItemBlock(to - from, _nrRegs);\n\n    for (RegisterId col = 0; col < _nrRegs; col++) {\n      res->_docColls[col] = _docColls[col];\n    }\n    for (size_t row = from; row < to; row++) {\n      for (RegisterId col = 0; col < _nrRegs; col++) {\n        AqlValue const& a(_data[chosen[row] * _nrRegs + col]);\n\n        if (! a.isEmpty()) {\n          auto it = cache.find(a);\n          if (it == cache.end()) {\n            AqlValue b = a.clone();\n            res->_data[(row - from) * _nrRegs + col] = b;\n            \/\/ TODO: can we use emplace() here instead of insert()?\n            cache.insert(make_pair(a, b));\n          }\n          else {\n            res->_data[(row - from) * _nrRegs + col] = it->second;\n          }\n        }\n      }\n    }\n\n    return res;\n  }\n  catch (...) {\n    delete res;\n    throw;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief steal for a subset, this does not copy the entries, rather,\n\/\/\/ it remembers which it has taken. This is stored in the\n\/\/\/ this by removing the value counts in _valueCount. \n\/\/\/ It is highly recommended to delete this object right after this\n\/\/\/ operation, because it is unclear, when the values to which our\n\/\/\/ AqlValues point will vanish! In particular, do not use setValue\n\/\/\/ any more.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock* AqlItemBlock::steal (vector<size_t>& chosen, \n                                   size_t from, size_t to) {\n  TRI_ASSERT(from < to && to <= chosen.size());\n\n  AqlItemBlock* res = new AqlItemBlock(to - from, _nrRegs);\n  for (RegisterId col = 0; col < _nrRegs; col++) {\n    res->_docColls[col] = _docColls[col];\n  }\n  try {\n    for (size_t row = from; row < to; row++) {\n      for (RegisterId col = 0; col < _nrRegs; col++) {\n        AqlValue& a(_data[chosen[row] * _nrRegs + col]);\n\n        if (! a.isEmpty()) {\n          steal(a);\n          try {\n            res->setValue(row - from, col, a);\n          }\n          catch (...) {\n            a.destroy();\n          }\n          eraseValue(chosen[row], col);\n        }\n      }\n    }\n  }\n  catch (...) {\n    delete res;\n    throw;\n  }\n  return res;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief concatenate multiple blocks, note that the new block now owns all\n\/\/\/ AqlValue pointers in the old blocks, therefore, the latter are all\n\/\/\/ set to nullptr, just to be sure.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock* AqlItemBlock::concatenate (std::vector<AqlItemBlock*> const& blocks) {\n  TRI_ASSERT(! blocks.empty());\n\n  auto it = blocks.begin();\n  TRI_ASSERT(it != blocks.end());\n  size_t totalSize = (*it)->size();\n  RegisterId nrRegs = (*it)->getNrRegs();\n\n  while (true) {\n    if (++it == blocks.end()) {\n      break;\n    }\n    totalSize += (*it)->size();\n    TRI_ASSERT((*it)->getNrRegs() == nrRegs);\n  }\n\n  TRI_ASSERT(totalSize > 0);\n  TRI_ASSERT(nrRegs > 0);\n\n  auto res = new AqlItemBlock(totalSize, nrRegs);\n  try {\n    size_t pos = 0;\n    for (it = blocks.begin(); it != blocks.end(); ++it) {\n      \/\/ handle collections\n      if (it == blocks.begin()) {\n        \/\/ copy collection info over\n        for (RegisterId col = 0; col < nrRegs; ++col) {\n          res->setDocumentCollection(col, (*it)->getDocumentCollection(col));\n        }\n      }\n      else {\n        for (RegisterId col = 0; col < nrRegs; ++col) {\n          TRI_ASSERT(res->getDocumentCollection(col) ==\n                     (*it)->getDocumentCollection(col));\n        }\n      }\n\n      TRI_ASSERT((*it) != res);\n      size_t const n = (*it)->size();\n      for (size_t row = 0; row < n; ++row) {\n        for (RegisterId col = 0; col < nrRegs; ++col) {\n          \/\/ copy over value\n          if (! (*it)->getValue(row, col).isEmpty()) {\n            res->setValue(pos + row, col, (*it)->getValue(row, col));\n          }\n        }\n      }\n      (*it)->eraseAll();\n      pos += (*it)->size();\n    }\n  }\n  catch (...) {\n    delete res;\n    throw;\n  }\n\n  return res;\n}\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"^\\\\(\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @addtogroup\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\\\\)\"\n\/\/ End:\n\n<commit_msg>Fix a memory leak in deletion of AqlValues that are no longer needed.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Aql item block\n\/\/\/\n\/\/\/ @file \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\/AqlItemBlock.h\"\n\nusing namespace triagens::aql;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                      AqlItemBlock\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                        constructors \/ destructors\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief create the block\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock::AqlItemBlock (size_t nrItems, \n                            RegisterId nrRegs)\n  : _nrItems(nrItems), _nrRegs(nrRegs) {\n\n  TRI_ASSERT(nrItems > 0);  \/\/ no, empty AqlItemBlocks are not allowed!\n\n  if (nrItems > 0 && nrRegs > 0) {\n    _data.reserve(nrItems * nrRegs);\n    for (size_t i = 0; i < nrItems * nrRegs; ++i) {\n      _data.emplace_back();\n    }\n  }\n \n  if (nrRegs > 0) {\n    _docColls.reserve(nrRegs);\n    for (size_t i = 0; i < nrRegs; ++i) {\n      _docColls.push_back(nullptr);\n    }\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief destroy the block\n\/\/\/ TODO: dtor is not exception-safe\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock::~AqlItemBlock () {\n  for (size_t i = 0; i < _nrItems * _nrRegs; i++) {\n    if (! _data[i].isEmpty()) {\n      auto it = _valueCount.find(_data[i]);\n      if (it != _valueCount.end()) { \/\/ if we know it, we are still responsible\n        if (--(it->second) == 0) {\n          _data[i].destroy();\n          try {\n            _valueCount.erase(it);\n          }\n          catch (...) {\n          }\n        }\n      }\n      \/\/ Note that if we do not know it the thing it has been stolen from us!\n    }\n  }\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                    public methods\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief shrink the block to the specified number of rows\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid AqlItemBlock::shrink (size_t nrItems) {\n  TRI_ASSERT(nrItems > 0);\n\n  if (nrItems == _nrItems) {\n    \/\/ nothing to do\n    return;\n  }\n  \n  if (nrItems > _nrItems) {\n    \/\/ cannot use shrink() to increase the size of the block\n    THROW_ARANGO_EXCEPTION(TRI_ERROR_INTERNAL);\n  }\n\n  \/\/ erase all stored values in the region that we freed\n  for (size_t i = nrItems; i < _nrItems; ++i) {\n    for (RegisterId j = 0; j < _nrRegs; ++j) {\n      eraseValue(i, j);\n    }\n  }\n\n  \/\/ adjust the size of the block\n  _nrItems = nrItems;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief clears out some columns (registers), this deletes the values if\n\/\/\/ necessary, using the reference count.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid AqlItemBlock::clearRegisters (std::unordered_set<RegisterId>& toClear) {\n  for (auto reg : toClear) {\n    for (size_t i = 0; i < _nrItems; i++) {\n      AqlValue& a(_data[_nrRegs * i + reg]);\n      if (! a.isEmpty()) {\n        auto it = _valueCount.find(a);\n        if (it != _valueCount.end()) {\n          if (--it->second == 0) {\n            try {\n              _valueCount.erase(it);\n              a.destroy();\n            }\n            catch (...) {\n              it->second++;\n              throw;\n            }\n          }\n        }\n        a.erase();\n      }\n    }\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief slice\/clone, this does a deep copy of all entries\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock* AqlItemBlock::slice (size_t from, \n                                   size_t to) const {\n  TRI_ASSERT(from < to && to <= _nrItems);\n\n  std::unordered_map<AqlValue, AqlValue> cache;\n  \/\/ TODO: should we pre-reserve space for cache to avoid later re-allocations?\n\n  AqlItemBlock* res = nullptr;\n  try {\n    res = new AqlItemBlock(to - from, _nrRegs);\n\n    for (RegisterId col = 0; col < _nrRegs; col++) {\n      res->_docColls[col] = _docColls[col];\n    }\n    for (size_t row = from; row < to; row++) {\n      for (RegisterId col = 0; col < _nrRegs; col++) {\n        AqlValue const& a(_data[row * _nrRegs + col]);\n\n        if (! a.isEmpty()) {\n          auto it = cache.find(a);\n          if (it == cache.end()) {\n            AqlValue b = a.clone();\n            res->_data[(row - from) * _nrRegs + col] = b;\n            \/\/ TODO: can we use emplace() here instead of insert()?\n            cache.insert(make_pair(a, b));\n          }\n          else {\n            res->_data[(row - from) * _nrRegs + col] = it->second;\n          }\n        }\n      }\n    }\n\n    return res;\n  }\n  catch (...) {\n    delete res;\n    throw;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief slice\/clone chosen rows for a subset, this does a deep copy\n\/\/\/ of all entries\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock* AqlItemBlock::slice (std::vector<size_t>& chosen, \n                                   size_t from, \n                                   size_t to) const {\n  TRI_ASSERT(from < to && to <= chosen.size());\n\n  std::unordered_map<AqlValue, AqlValue> cache;\n  \/\/ TODO: should we pre-reserve space for cache to avoid later re-allocations?\n\n  AqlItemBlock* res = nullptr;\n  try {\n    res = new AqlItemBlock(to - from, _nrRegs);\n\n    for (RegisterId col = 0; col < _nrRegs; col++) {\n      res->_docColls[col] = _docColls[col];\n    }\n    for (size_t row = from; row < to; row++) {\n      for (RegisterId col = 0; col < _nrRegs; col++) {\n        AqlValue const& a(_data[chosen[row] * _nrRegs + col]);\n\n        if (! a.isEmpty()) {\n          auto it = cache.find(a);\n          if (it == cache.end()) {\n            AqlValue b = a.clone();\n            res->_data[(row - from) * _nrRegs + col] = b;\n            \/\/ TODO: can we use emplace() here instead of insert()?\n            cache.insert(make_pair(a, b));\n          }\n          else {\n            res->_data[(row - from) * _nrRegs + col] = it->second;\n          }\n        }\n      }\n    }\n\n    return res;\n  }\n  catch (...) {\n    delete res;\n    throw;\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief steal for a subset, this does not copy the entries, rather,\n\/\/\/ it remembers which it has taken. This is stored in the\n\/\/\/ this by removing the value counts in _valueCount. \n\/\/\/ It is highly recommended to delete this object right after this\n\/\/\/ operation, because it is unclear, when the values to which our\n\/\/\/ AqlValues point will vanish! In particular, do not use setValue\n\/\/\/ any more.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock* AqlItemBlock::steal (vector<size_t>& chosen, \n                                   size_t from, size_t to) {\n  TRI_ASSERT(from < to && to <= chosen.size());\n\n  AqlItemBlock* res = new AqlItemBlock(to - from, _nrRegs);\n  for (RegisterId col = 0; col < _nrRegs; col++) {\n    res->_docColls[col] = _docColls[col];\n  }\n  try {\n    for (size_t row = from; row < to; row++) {\n      for (RegisterId col = 0; col < _nrRegs; col++) {\n        AqlValue& a(_data[chosen[row] * _nrRegs + col]);\n\n        if (! a.isEmpty()) {\n          steal(a);\n          try {\n            res->setValue(row - from, col, a);\n          }\n          catch (...) {\n            a.destroy();\n          }\n          eraseValue(chosen[row], col);\n        }\n      }\n    }\n  }\n  catch (...) {\n    delete res;\n    throw;\n  }\n  return res;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief concatenate multiple blocks, note that the new block now owns all\n\/\/\/ AqlValue pointers in the old blocks, therefore, the latter are all\n\/\/\/ set to nullptr, just to be sure.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAqlItemBlock* AqlItemBlock::concatenate (std::vector<AqlItemBlock*> const& blocks) {\n  TRI_ASSERT(! blocks.empty());\n\n  auto it = blocks.begin();\n  TRI_ASSERT(it != blocks.end());\n  size_t totalSize = (*it)->size();\n  RegisterId nrRegs = (*it)->getNrRegs();\n\n  while (true) {\n    if (++it == blocks.end()) {\n      break;\n    }\n    totalSize += (*it)->size();\n    TRI_ASSERT((*it)->getNrRegs() == nrRegs);\n  }\n\n  TRI_ASSERT(totalSize > 0);\n  TRI_ASSERT(nrRegs > 0);\n\n  auto res = new AqlItemBlock(totalSize, nrRegs);\n  try {\n    size_t pos = 0;\n    for (it = blocks.begin(); it != blocks.end(); ++it) {\n      \/\/ handle collections\n      if (it == blocks.begin()) {\n        \/\/ copy collection info over\n        for (RegisterId col = 0; col < nrRegs; ++col) {\n          res->setDocumentCollection(col, (*it)->getDocumentCollection(col));\n        }\n      }\n      else {\n        for (RegisterId col = 0; col < nrRegs; ++col) {\n          TRI_ASSERT(res->getDocumentCollection(col) ==\n                     (*it)->getDocumentCollection(col));\n        }\n      }\n\n      TRI_ASSERT((*it) != res);\n      size_t const n = (*it)->size();\n      for (size_t row = 0; row < n; ++row) {\n        for (RegisterId col = 0; col < nrRegs; ++col) {\n          \/\/ copy over value\n          if (! (*it)->getValue(row, col).isEmpty()) {\n            res->setValue(pos + row, col, (*it)->getValue(row, col));\n          }\n        }\n      }\n      (*it)->eraseAll();\n      pos += (*it)->size();\n    }\n  }\n  catch (...) {\n    delete res;\n    throw;\n  }\n\n  return res;\n}\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"^\\\\(\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @addtogroup\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\\\\)\"\n\/\/ End:\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\/diagnostics\/recon_diagnostics.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/file_version_info.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/browser\/diagnostics\/diagnostics_test.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/platform_util.h\"\n#include \"app\/app_paths.h\"\n\n#if defined(OS_WIN)\n#include \"base\/win_util.h\"\n#include \"chrome\/installer\/util\/install_util.h\"\n#endif\n\n\/\/ Reconnaissance diagnostics. These are the first and most critical\n\/\/ diagnostic tests. Here we check for the existence of critical files.\n\/\/ TODO(cpu): Define if it makes sense to localize strings.\n\nnamespace {\n\nclass InstallTypeTest;\nInstallTypeTest* g_install_type = 0;\n\n\/\/ Check that the flavor of the operating system is supported.\nclass OperatingSystemTest : public DiagnosticTest {\n public:\n  OperatingSystemTest() : DiagnosticTest(ASCIIToUTF16(\"Operating System\")) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n    int version = 0;\n    int major = 0;\n    int minor = 0;\n#if defined(OS_WIN)\n    version = win_util::GetWinVersion();\n    if (version < win_util::WINVERSION_XP) {\n      RecordFailure(ASCIIToUTF16(\"Windows 2000 or earlier\"));\n      return false;\n    }\n    win_util::GetServicePackLevel(&major, &minor);\n    if ((version == win_util::WINVERSION_XP) && (major < 2)) {\n      RecordFailure(ASCIIToUTF16(\"XP Service Pack 1 or earlier\"));\n      return false;\n    }\n#else\n    \/\/ TODO(port): define the OS criteria for linux and mac.\n#endif  \/\/ defined(OS_WIN)\n    RecordSuccess(ASCIIToUTF16(StringPrintf(\"%s %s (%d [%d:%d])\",\n        base::SysInfo::OperatingSystemName().c_str(),\n        base::SysInfo::OperatingSystemVersion().c_str(),\n        version, major, minor)));\n    return true;\n  }\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(OperatingSystemTest);\n};\n\n\/\/ Check if it is system install or per-user install.\nclass InstallTypeTest : public DiagnosticTest {\n public:\n  InstallTypeTest() : DiagnosticTest(ASCIIToUTF16(\"Install Type\")),\n                      user_level_(false) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n#if defined(OS_WIN)\n    FilePath chrome_exe;\n    if (!PathService::Get(base::FILE_EXE, &chrome_exe)) {\n      RecordFailure(ASCIIToUTF16(\"Path provider failure\"));\n      return false;\n    }\n    user_level_ = InstallUtil::IsPerUserInstall(\n        chrome_exe.ToWStringHack().c_str());\n    const char* type = user_level_ ? \"User Level\" : \"System Level\";\n    string16 install_type(ASCIIToUTF16(type));\n#else\n    string16 install_type(ASCIIToUTF16(\"System Level\"));\n#endif  \/\/ defined(OS_WIN)\n    RecordSuccess(install_type);\n    g_install_type = this;\n    return true;\n  }\n\n  bool system_level() const { return !user_level_; }\n\n private:\n  bool user_level_;\n  DISALLOW_COPY_AND_ASSIGN(InstallTypeTest);\n};\n\n\/\/ Check the version of Chrome.\nclass VersionTest : public DiagnosticTest {\n public:\n  VersionTest() : DiagnosticTest(ASCIIToUTF16(\"Browser Version\")) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n    scoped_ptr<FileVersionInfo> version_info(\n        FileVersionInfo::CreateFileVersionInfoForCurrentModule());\n    if (!version_info.get()) {\n      RecordFailure(ASCIIToUTF16(\"No Version\"));\n      return true;\n    }\n    string16 current_version = WideToUTF16(version_info->file_version());\n    if (current_version.empty()) {\n      RecordFailure(ASCIIToUTF16(\"Empty Version\"));\n      return true;\n    }\n    string16 version_modifier = platform_util::GetVersionStringModifier();\n    if (!version_modifier.empty()) {\n      current_version += ASCIIToUTF16(\" \");\n      current_version += version_modifier;\n    }\n#if defined(GOOGLE_CHROME_BUILD)\n    current_version += ASCIIToUTF16(\" GCB\");\n#endif  \/\/ defined(GOOGLE_CHROME_BUILD)\n    RecordSuccess(current_version);\n    return true;\n  }\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(VersionTest);\n};\n\nstruct TestPathInfo {\n  const char* test_name;\n  int dir_id;\n  bool test_writable;\n  int64 max_size;\n};\n\nconst int64 kOneKilo = 1024;\nconst int64 kOneMeg = 1024 * kOneKilo;\n\nconst TestPathInfo kPathsToTest[] = {\n  {\"User data Directory\", chrome::DIR_USER_DATA, true, 250 * kOneMeg},\n  {\"Local state file\", chrome::FILE_LOCAL_STATE, true, 200 * kOneKilo},\n  {\"Dictionaries Directory\", chrome::DIR_APP_DICTIONARIES, false, 0},\n  {\"Inspector Directory\", chrome::DIR_INSPECTOR, false, 0}\n};\n\n\/\/ Check that the user's data directory exists and the paths are writeable.\n\/\/ If it is a systemwide install some paths are not expected to be writeable.\n\/\/ This test depends on |InstallTypeTest| having run succesfuly.\nclass PathTest : public DiagnosticTest {\n public:\n  explicit PathTest(const TestPathInfo& path_info)\n      : DiagnosticTest(ASCIIToUTF16(path_info.test_name)),\n        path_info_(path_info) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n    if (!g_install_type) {\n      RecordStopFailure(ASCIIToUTF16(\"dependency failure\"));\n      return false;\n    }\n    FilePath dir_or_file;\n    if (!PathService::Get(path_info_.dir_id, &dir_or_file)) {\n      RecordStopFailure(ASCIIToUTF16(\"Path provider failure\"));\n      return false;\n    }\n    if (!file_util::PathExists(dir_or_file)) {\n      RecordFailure(ASCIIToUTF16(\"Path not found\"));\n      return true;\n    }\n\n    int64 dir_or_file_size;\n    if (!file_util::GetFileSize(dir_or_file, &dir_or_file_size)) {\n      RecordFailure(ASCIIToUTF16(\"Cannot obtain size\"));\n      return true;\n    }\n    DataUnits units = GetByteDisplayUnits(dir_or_file_size);\n    string16 printable_size =\n        WideToUTF16(FormatBytes(dir_or_file_size, units, true));\n\n    if (path_info_.max_size > 0) {\n      if (dir_or_file_size > path_info_.max_size) {\n        RecordFailure(ASCIIToUTF16(\"Path is too big: \") + printable_size);\n        return true;\n      }\n    }\n    if (g_install_type->system_level() && !path_info_.test_writable) {\n      RecordSuccess(ASCIIToUTF16(\"Path exists\"));\n      return true;\n    }\n    if (!file_util::PathIsWritable(dir_or_file)) {\n      RecordFailure(ASCIIToUTF16(\"Path is not writable\"));\n      return true;\n    }\n    RecordSuccess(ASCIIToUTF16(\"Path exists and is writable: \")\n                  + printable_size);\n    return true;\n  }\n\n private:\n  TestPathInfo path_info_;\n  DISALLOW_COPY_AND_ASSIGN(PathTest);\n};\n\n\/\/ Check that the disk space in the volume where the user data dir normally\n\/\/ lives is not dangerosly low.\nclass DiskSpaceTest : public DiagnosticTest {\n public:\n  DiskSpaceTest() : DiagnosticTest(ASCIIToUTF16(\"Disk Space\")) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n    FilePath data_dir;\n    if (!PathService::Get(chrome::DIR_USER_DATA, &data_dir))\n      return false;\n    int64 disk_space = base::SysInfo::AmountOfFreeDiskSpace(data_dir);\n    if (disk_space < 0) {\n      RecordFailure(ASCIIToUTF16(\"Unable to query free space\"));\n      return true;\n    }\n    DataUnits units = GetByteDisplayUnits(disk_space);\n    string16 printable_size =\n        WideToUTF16(FormatBytes(disk_space, units, true));\n    if (disk_space < 80 * kOneMeg) {\n      RecordFailure(ASCIIToUTF16(\"Low disk space : \") + printable_size);\n      return true;\n    }\n    RecordSuccess(ASCIIToUTF16(\"Free space : \") + printable_size);\n    return true;\n  }\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(DiskSpaceTest);\n};\n\n}  \/\/ namespace\n\nDiagnosticTest* MakeUserDirTest() {\n  return new PathTest(kPathsToTest[0]);\n}\n\nDiagnosticTest* MakeLocalStateFileTest() {\n  return new PathTest(kPathsToTest[1]);\n}\n\nDiagnosticTest* MakeDictonaryDirTest() {\n  return new PathTest(kPathsToTest[2]);\n}\n\nDiagnosticTest* MakeInspectorDirTest() {\n  return new PathTest(kPathsToTest[3]);\n}\n\nDiagnosticTest* MakeVersionTest() {\n  return new VersionTest();\n}\n\nDiagnosticTest* MakeDiskSpaceTest() {\n  return new DiskSpaceTest();\n}\n\nDiagnosticTest* MakeOperatingSystemTest() {\n  return new OperatingSystemTest();\n}\n\nDiagnosticTest* MakeInstallTypeTest() {\n  return new InstallTypeTest();\n}\n\n<commit_msg>Diagnostic mode shows wrong size for certain paths - See the bug, it has a screenshot<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\/diagnostics\/recon_diagnostics.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/file_version_info.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/browser\/diagnostics\/diagnostics_test.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/platform_util.h\"\n#include \"app\/app_paths.h\"\n\n#if defined(OS_WIN)\n#include \"base\/win_util.h\"\n#include \"chrome\/installer\/util\/install_util.h\"\n#endif\n\n\/\/ Reconnaissance diagnostics. These are the first and most critical\n\/\/ diagnostic tests. Here we check for the existence of critical files.\n\/\/ TODO(cpu): Define if it makes sense to localize strings.\n\nnamespace {\n\nclass InstallTypeTest;\nInstallTypeTest* g_install_type = 0;\n\n\/\/ Check that the flavor of the operating system is supported.\nclass OperatingSystemTest : public DiagnosticTest {\n public:\n  OperatingSystemTest() : DiagnosticTest(ASCIIToUTF16(\"Operating System\")) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n    int version = 0;\n    int major = 0;\n    int minor = 0;\n#if defined(OS_WIN)\n    version = win_util::GetWinVersion();\n    if (version < win_util::WINVERSION_XP) {\n      RecordFailure(ASCIIToUTF16(\"Windows 2000 or earlier\"));\n      return false;\n    }\n    win_util::GetServicePackLevel(&major, &minor);\n    if ((version == win_util::WINVERSION_XP) && (major < 2)) {\n      RecordFailure(ASCIIToUTF16(\"XP Service Pack 1 or earlier\"));\n      return false;\n    }\n#else\n    \/\/ TODO(port): define the OS criteria for linux and mac.\n#endif  \/\/ defined(OS_WIN)\n    RecordSuccess(ASCIIToUTF16(StringPrintf(\"%s %s (%d [%d:%d])\",\n        base::SysInfo::OperatingSystemName().c_str(),\n        base::SysInfo::OperatingSystemVersion().c_str(),\n        version, major, minor)));\n    return true;\n  }\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(OperatingSystemTest);\n};\n\n\/\/ Check if it is system install or per-user install.\nclass InstallTypeTest : public DiagnosticTest {\n public:\n  InstallTypeTest() : DiagnosticTest(ASCIIToUTF16(\"Install Type\")),\n                      user_level_(false) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n#if defined(OS_WIN)\n    FilePath chrome_exe;\n    if (!PathService::Get(base::FILE_EXE, &chrome_exe)) {\n      RecordFailure(ASCIIToUTF16(\"Path provider failure\"));\n      return false;\n    }\n    user_level_ = InstallUtil::IsPerUserInstall(\n        chrome_exe.ToWStringHack().c_str());\n    const char* type = user_level_ ? \"User Level\" : \"System Level\";\n    string16 install_type(ASCIIToUTF16(type));\n#else\n    string16 install_type(ASCIIToUTF16(\"System Level\"));\n#endif  \/\/ defined(OS_WIN)\n    RecordSuccess(install_type);\n    g_install_type = this;\n    return true;\n  }\n\n  bool system_level() const { return !user_level_; }\n\n private:\n  bool user_level_;\n  DISALLOW_COPY_AND_ASSIGN(InstallTypeTest);\n};\n\n\/\/ Check the version of Chrome.\nclass VersionTest : public DiagnosticTest {\n public:\n  VersionTest() : DiagnosticTest(ASCIIToUTF16(\"Browser Version\")) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n    scoped_ptr<FileVersionInfo> version_info(\n        FileVersionInfo::CreateFileVersionInfoForCurrentModule());\n    if (!version_info.get()) {\n      RecordFailure(ASCIIToUTF16(\"No Version\"));\n      return true;\n    }\n    string16 current_version = WideToUTF16(version_info->file_version());\n    if (current_version.empty()) {\n      RecordFailure(ASCIIToUTF16(\"Empty Version\"));\n      return true;\n    }\n    string16 version_modifier = platform_util::GetVersionStringModifier();\n    if (!version_modifier.empty()) {\n      current_version += ASCIIToUTF16(\" \");\n      current_version += version_modifier;\n    }\n#if defined(GOOGLE_CHROME_BUILD)\n    current_version += ASCIIToUTF16(\" GCB\");\n#endif  \/\/ defined(GOOGLE_CHROME_BUILD)\n    RecordSuccess(current_version);\n    return true;\n  }\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(VersionTest);\n};\n\nstruct TestPathInfo {\n  const char* test_name;\n  int  path_id;\n  bool is_directory;\n  bool is_optional;\n  bool test_writable;\n  int64 max_size;\n};\n\nconst int64 kOneKilo = 1024;\nconst int64 kOneMeg = 1024 * kOneKilo;\n\nconst TestPathInfo kPathsToTest[] = {\n  {\"User data Directory\", chrome::DIR_USER_DATA,\n      true, false, true, 250 * kOneMeg},\n  {\"Local state file\", chrome::FILE_LOCAL_STATE,\n      false, false, true, 100 * kOneKilo},\n  {\"Dictionaries Directory\", chrome::DIR_APP_DICTIONARIES,\n      true, true, false, 0},\n  {\"Inspector Directory\", chrome::DIR_INSPECTOR,\n      true, false, false, 0}\n};\n\n\/\/ Check that the user's data directory exists and the paths are writeable.\n\/\/ If it is a systemwide install some paths are not expected to be writeable.\n\/\/ This test depends on |InstallTypeTest| having run succesfuly.\nclass PathTest : public DiagnosticTest {\n public:\n  explicit PathTest(const TestPathInfo& path_info)\n      : DiagnosticTest(ASCIIToUTF16(path_info.test_name)),\n        path_info_(path_info) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n    if (!g_install_type) {\n      RecordStopFailure(ASCIIToUTF16(\"dependency failure\"));\n      return false;\n    }\n    FilePath dir_or_file;\n    if (!PathService::Get(path_info_.path_id, &dir_or_file)) {\n      RecordStopFailure(ASCIIToUTF16(\"Path provider failure\"));\n      return false;\n    }\n    if (!file_util::PathExists(dir_or_file)) {\n      RecordFailure(ASCIIToUTF16(\"Path not found\"));\n      return true;\n    }\n\n    int64 dir_or_file_size = 0;\n    if (path_info_.is_directory) {\n      dir_or_file_size = file_util::ComputeDirectorySize(dir_or_file);\n    } else {\n      file_util::GetFileSize(dir_or_file, &dir_or_file_size);\n    }\n    if (!dir_or_file_size && !path_info_.is_optional) {\n      RecordFailure(ASCIIToUTF16(\"Cannot obtain size\"));\n      return true;\n    }\n    DataUnits units = GetByteDisplayUnits(dir_or_file_size);\n    string16 printable_size =\n        WideToUTF16(FormatBytes(dir_or_file_size, units, true));\n\n    if (path_info_.max_size > 0) {\n      if (dir_or_file_size > path_info_.max_size) {\n        RecordFailure(ASCIIToUTF16(\"Path is too big: \") + printable_size);\n        return true;\n      }\n    }\n    if (g_install_type->system_level() && !path_info_.test_writable) {\n      RecordSuccess(ASCIIToUTF16(\"Path exists\"));\n      return true;\n    }\n    if (!file_util::PathIsWritable(dir_or_file)) {\n      RecordFailure(ASCIIToUTF16(\"Path is not writable\"));\n      return true;\n    }\n    RecordSuccess(ASCIIToUTF16(\"Path exists and is writable: \")\n                  + printable_size);\n    return true;\n  }\n\n private:\n  TestPathInfo path_info_;\n  DISALLOW_COPY_AND_ASSIGN(PathTest);\n};\n\n\/\/ Check that the disk space in the volume where the user data dir normally\n\/\/ lives is not dangerosly low.\nclass DiskSpaceTest : public DiagnosticTest {\n public:\n  DiskSpaceTest() : DiagnosticTest(ASCIIToUTF16(\"Disk Space\")) {}\n\n  virtual int GetId() { return 0; }\n\n  virtual bool ExecuteImpl(DiagnosticsModel::Observer* observer) {\n    FilePath data_dir;\n    if (!PathService::Get(chrome::DIR_USER_DATA, &data_dir))\n      return false;\n    int64 disk_space = base::SysInfo::AmountOfFreeDiskSpace(data_dir);\n    if (disk_space < 0) {\n      RecordFailure(ASCIIToUTF16(\"Unable to query free space\"));\n      return true;\n    }\n    DataUnits units = GetByteDisplayUnits(disk_space);\n    string16 printable_size =\n        WideToUTF16(FormatBytes(disk_space, units, true));\n    if (disk_space < 80 * kOneMeg) {\n      RecordFailure(ASCIIToUTF16(\"Low disk space : \") + printable_size);\n      return true;\n    }\n    RecordSuccess(ASCIIToUTF16(\"Free space : \") + printable_size);\n    return true;\n  }\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(DiskSpaceTest);\n};\n\n}  \/\/ namespace\n\nDiagnosticTest* MakeUserDirTest() {\n  return new PathTest(kPathsToTest[0]);\n}\n\nDiagnosticTest* MakeLocalStateFileTest() {\n  return new PathTest(kPathsToTest[1]);\n}\n\nDiagnosticTest* MakeDictonaryDirTest() {\n  return new PathTest(kPathsToTest[2]);\n}\n\nDiagnosticTest* MakeInspectorDirTest() {\n  return new PathTest(kPathsToTest[3]);\n}\n\nDiagnosticTest* MakeVersionTest() {\n  return new VersionTest();\n}\n\nDiagnosticTest* MakeDiskSpaceTest() {\n  return new DiskSpaceTest();\n}\n\nDiagnosticTest* MakeOperatingSystemTest() {\n  return new OperatingSystemTest();\n}\n\nDiagnosticTest* MakeInstallTypeTest() {\n  return new InstallTypeTest();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\/\n\n#include <exception>\n\n#include <glog\/logging.h>\n#include <gtest\/gtest.h>\n#include <react\/uimanager\/ComponentDescriptorFactory.h>\n#include <react\/uimanager\/UITemplateProcessor.h>\n\nusing namespace facebook::react;\n\n#include <react\/components\/rncore\/ComponentDescriptors.h>\n#include <react\/components\/scrollview\/ScrollViewComponentDescriptor.h>\n#include <react\/components\/view\/ViewComponentDescriptor.h>\n#include <react\/config\/ReactNativeConfig.h>\n#include <react\/uimanager\/ComponentDescriptorFactory.h>\n#include <react\/uimanager\/ComponentDescriptorRegistry.h>\n#include <react\/utils\/ContextContainer.h>\n\nnamespace facebook {\nnamespace react {\n\nstatic ComponentRegistryFactory getComponentRegistryFactory() {\n  return [](const EventDispatcher::Weak &eventDispatcher,\n            const ContextContainer::Shared &contextContainer) {\n    auto registry = std::make_shared<ComponentDescriptorRegistry>();\n    registry->registerComponentDescriptor(\n        std::make_shared<ViewComponentDescriptor>(eventDispatcher));\n    registry->registerComponentDescriptor(\n        std::make_shared<ScrollViewComponentDescriptor>(eventDispatcher));\n    registry->registerComponentDescriptor(\n        std::make_shared<ActivityIndicatorViewComponentDescriptor>(\n            eventDispatcher));\n    return registry;\n  };\n}\n\nbool mockSimpleTestValue_;\n\nNativeModuleRegistry buildNativeModuleRegistry();\n\nNativeModuleRegistry buildNativeModuleRegistry() {\n  NativeModuleRegistry nMR;\n  nMR.registerModule(\n      \"MobileConfig\",\n      [&](const std::string &methodName, const folly::dynamic &args) {\n        return mockSimpleTestValue_;\n      });\n  return nMR;\n}\n\nclass MockReactNativeConfig : public ReactNativeConfig {\n public:\n  MockReactNativeConfig() {}\n  bool getBool(const std::string &param) const override {\n    return mockSimpleTestValue_;\n  }\n\n  std::string getString(const std::string &param) const override {\n    return \"\";\n  }\n\n  int64_t getInt64(const std::string &param) const override {\n    return 0;\n  }\n\n  double getDouble(const std::string &param) const override {\n    return 0.0;\n  }\n};\n\nstd::shared_ptr<const ReactNativeConfig> mockReactNativeConfig_ =\n    std::make_shared<const MockReactNativeConfig>();\n\n} \/\/ namespace react\n} \/\/ namespace facebook\n\nTEST(UITemplateProcessorTest, testSimpleBytecode) {\n  auto surfaceId = 11;\n  auto eventDispatcher = std::shared_ptr<EventDispatcher const>();\n  auto componentDescriptorRegistry =\n      getComponentRegistryFactory()(eventDispatcher, nullptr);\n  auto nativeModuleRegistry = buildNativeModuleRegistry();\n\n  auto bytecode = R\"delim({\"version\":0.1,\"commands\":[\n    [\"createNode\",2,\"RCTView\",-1,{\"opacity\": 0.5, \"testId\": \"root\"}],\n    [\"createNode\",4,\"RCTView\",2,{\"testId\": \"child\"}],\n    [\"returnRoot\",2]\n  ]})delim\";\n\n  mockSimpleTestValue_ = true;\n\n  auto root1 = UITemplateProcessor::buildShadowTree(\n      bytecode,\n      surfaceId,\n      folly::dynamic::object(),\n      *componentDescriptorRegistry,\n      nativeModuleRegistry,\n      mockReactNativeConfig_);\n#ifndef NDEBUG\n  LOG(INFO) << std::endl << root1->getDebugDescription();\n#endif\n  auto props1 = std::dynamic_pointer_cast<const ViewProps>(root1->getProps());\n  ASSERT_NEAR(props1->opacity, 0.5, 0.001);\n  ASSERT_STREQ(props1->testId.c_str(), \"root\");\n  auto children1 = root1->getChildren();\n  ASSERT_EQ(children1.size(), 1);\n  auto child_props1 =\n      std::dynamic_pointer_cast<const ViewProps>(children1.at(0)->getProps());\n  ASSERT_STREQ(child_props1->testId.c_str(), \"child\");\n}\n\nTEST(UITemplateProcessorTest, testConditionalBytecode) {\n  auto surfaceId = 11;\n  auto eventDispatcher = std::shared_ptr<EventDispatcher const>();\n  auto componentDescriptorRegistry =\n      getComponentRegistryFactory()(eventDispatcher, nullptr);\n  auto nativeModuleRegistry = buildNativeModuleRegistry();\n\n  auto bytecode = R\"delim({\"version\":0.1,\"commands\":[\n    [\"createNode\",2,\"RCTView\",-1,{\"testId\": \"root\"}],\n    [\"loadNativeBool\",1,\"MobileConfig\",\"getBool\",[\"qe:simple_test\"]],\n    [\"conditional\",1,\n      [[\"createNode\",4,\"RCTView\",2,{\"testId\": \"cond_true\"}]],\n      [[\"createNode\",4,\"RCTView\",2,{\"testId\": \"cond_false\"}]]\n    ],\n    [\"returnRoot\",2]\n  ]})delim\";\n\n  mockSimpleTestValue_ = true;\n\n  auto root1 = UITemplateProcessor::buildShadowTree(\n      bytecode,\n      surfaceId,\n      folly::dynamic::object(),\n      *componentDescriptorRegistry,\n      nativeModuleRegistry,\n      mockReactNativeConfig_);\n#ifndef NDEBUG\n  LOG(INFO) << std::endl << root1->getDebugDescription();\n#endif\n  auto props1 = std::dynamic_pointer_cast<const ViewProps>(root1->getProps());\n  ASSERT_STREQ(props1->testId.c_str(), \"root\");\n  auto children1 = root1->getChildren();\n  ASSERT_EQ(children1.size(), 1);\n  auto child_props1 =\n      std::dynamic_pointer_cast<const ViewProps>(children1.at(0)->getProps());\n  ASSERT_STREQ(child_props1->testId.c_str(), \"cond_true\");\n\n  mockSimpleTestValue_ = false;\n\n  auto root2 = UITemplateProcessor::buildShadowTree(\n      bytecode,\n      surfaceId,\n      folly::dynamic::object(),\n      *componentDescriptorRegistry,\n      nativeModuleRegistry,\n      mockReactNativeConfig_);\n  auto child_props2 = std::dynamic_pointer_cast<const ViewProps>(\n      root2->getChildren().at(0)->getProps());\n  ASSERT_STREQ(child_props2->testId.c_str(), \"cond_false\");\n}\n<commit_msg>Fabric: Using ComponentDescriptorProviderRegistry in UITemplateProcessorTest<commit_after>\/*\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\/\n\n#include <exception>\n\n#include <glog\/logging.h>\n#include <gtest\/gtest.h>\n#include <react\/uimanager\/ComponentDescriptorFactory.h>\n#include <react\/uimanager\/UITemplateProcessor.h>\n\nusing namespace facebook::react;\n\n#include <react\/components\/rncore\/ComponentDescriptors.h>\n#include <react\/components\/scrollview\/ScrollViewComponentDescriptor.h>\n#include <react\/components\/view\/ViewComponentDescriptor.h>\n#include <react\/config\/ReactNativeConfig.h>\n#include <react\/uimanager\/ComponentDescriptorFactory.h>\n#include <react\/uimanager\/ComponentDescriptorProviderRegistry.h>\n#include <react\/uimanager\/ComponentDescriptorRegistry.h>\n#include <react\/utils\/ContextContainer.h>\n\nnamespace facebook {\nnamespace react {\n\nstatic ComponentRegistryFactory getComponentRegistryFactory() {\n  return [](const EventDispatcher::Weak &eventDispatcher,\n            const ContextContainer::Shared &contextContainer) {\n    ComponentDescriptorProviderRegistry providerRegistry{};\n    providerRegistry.add(\n        concreteComponentDescriptorProvider<ViewComponentDescriptor>());\n    providerRegistry.add(\n        concreteComponentDescriptorProvider<ScrollViewComponentDescriptor>());\n    providerRegistry.add(concreteComponentDescriptorProvider<\n                         ActivityIndicatorViewComponentDescriptor>());\n    return providerRegistry.createComponentDescriptorRegistry(\n        {eventDispatcher, contextContainer});\n  };\n}\n\nbool mockSimpleTestValue_;\n\nNativeModuleRegistry buildNativeModuleRegistry();\n\nNativeModuleRegistry buildNativeModuleRegistry() {\n  NativeModuleRegistry nMR;\n  nMR.registerModule(\n      \"MobileConfig\",\n      [&](const std::string &methodName, const folly::dynamic &args) {\n        return mockSimpleTestValue_;\n      });\n  return nMR;\n}\n\nclass MockReactNativeConfig : public ReactNativeConfig {\n public:\n  MockReactNativeConfig() {}\n  bool getBool(const std::string &param) const override {\n    return mockSimpleTestValue_;\n  }\n\n  std::string getString(const std::string &param) const override {\n    return \"\";\n  }\n\n  int64_t getInt64(const std::string &param) const override {\n    return 0;\n  }\n\n  double getDouble(const std::string &param) const override {\n    return 0.0;\n  }\n};\n\nstd::shared_ptr<const ReactNativeConfig> mockReactNativeConfig_ =\n    std::make_shared<const MockReactNativeConfig>();\n\n} \/\/ namespace react\n} \/\/ namespace facebook\n\nTEST(UITemplateProcessorTest, testSimpleBytecode) {\n  auto surfaceId = 11;\n  auto eventDispatcher = std::shared_ptr<EventDispatcher const>();\n  auto componentDescriptorRegistry =\n      getComponentRegistryFactory()(eventDispatcher, nullptr);\n  auto nativeModuleRegistry = buildNativeModuleRegistry();\n\n  auto bytecode = R\"delim({\"version\":0.1,\"commands\":[\n    [\"createNode\",2,\"RCTView\",-1,{\"opacity\": 0.5, \"testId\": \"root\"}],\n    [\"createNode\",4,\"RCTView\",2,{\"testId\": \"child\"}],\n    [\"returnRoot\",2]\n  ]})delim\";\n\n  mockSimpleTestValue_ = true;\n\n  auto root1 = UITemplateProcessor::buildShadowTree(\n      bytecode,\n      surfaceId,\n      folly::dynamic::object(),\n      *componentDescriptorRegistry,\n      nativeModuleRegistry,\n      mockReactNativeConfig_);\n#ifndef NDEBUG\n  LOG(INFO) << std::endl << root1->getDebugDescription();\n#endif\n  auto props1 = std::dynamic_pointer_cast<const ViewProps>(root1->getProps());\n  ASSERT_NEAR(props1->opacity, 0.5, 0.001);\n  ASSERT_STREQ(props1->testId.c_str(), \"root\");\n  auto children1 = root1->getChildren();\n  ASSERT_EQ(children1.size(), 1);\n  auto child_props1 =\n      std::dynamic_pointer_cast<const ViewProps>(children1.at(0)->getProps());\n  ASSERT_STREQ(child_props1->testId.c_str(), \"child\");\n}\n\nTEST(UITemplateProcessorTest, testConditionalBytecode) {\n  auto surfaceId = 11;\n  auto eventDispatcher = std::shared_ptr<EventDispatcher const>();\n  auto componentDescriptorRegistry =\n      getComponentRegistryFactory()(eventDispatcher, nullptr);\n  auto nativeModuleRegistry = buildNativeModuleRegistry();\n\n  auto bytecode = R\"delim({\"version\":0.1,\"commands\":[\n    [\"createNode\",2,\"RCTView\",-1,{\"testId\": \"root\"}],\n    [\"loadNativeBool\",1,\"MobileConfig\",\"getBool\",[\"qe:simple_test\"]],\n    [\"conditional\",1,\n      [[\"createNode\",4,\"RCTView\",2,{\"testId\": \"cond_true\"}]],\n      [[\"createNode\",4,\"RCTView\",2,{\"testId\": \"cond_false\"}]]\n    ],\n    [\"returnRoot\",2]\n  ]})delim\";\n\n  mockSimpleTestValue_ = true;\n\n  auto root1 = UITemplateProcessor::buildShadowTree(\n      bytecode,\n      surfaceId,\n      folly::dynamic::object(),\n      *componentDescriptorRegistry,\n      nativeModuleRegistry,\n      mockReactNativeConfig_);\n#ifndef NDEBUG\n  LOG(INFO) << std::endl << root1->getDebugDescription();\n#endif\n  auto props1 = std::dynamic_pointer_cast<const ViewProps>(root1->getProps());\n  ASSERT_STREQ(props1->testId.c_str(), \"root\");\n  auto children1 = root1->getChildren();\n  ASSERT_EQ(children1.size(), 1);\n  auto child_props1 =\n      std::dynamic_pointer_cast<const ViewProps>(children1.at(0)->getProps());\n  ASSERT_STREQ(child_props1->testId.c_str(), \"cond_true\");\n\n  mockSimpleTestValue_ = false;\n\n  auto root2 = UITemplateProcessor::buildShadowTree(\n      bytecode,\n      surfaceId,\n      folly::dynamic::object(),\n      *componentDescriptorRegistry,\n      nativeModuleRegistry,\n      mockReactNativeConfig_);\n  auto child_props2 = std::dynamic_pointer_cast<const ViewProps>(\n      root2->getChildren().at(0)->getProps());\n  ASSERT_STREQ(child_props2->testId.c_str(), \"cond_false\");\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 \"chrome\/browser\/renderer_host\/backing_store.h\"\n\n#include <utility>\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/logging.h\"\n#include \"chrome\/common\/transport_dib.h\"\n#include \"chrome\/common\/x11_util.h\"\n#include \"chrome\/common\/x11_util_internal.h\"\n\n\/\/ X Backing Stores:\n\/\/\n\/\/ Unlike Windows, where the backing store is kept in heap memory, we keep our\n\/\/ backing store in the X server, as a pixmap. Thus expose events just require\n\/\/ instructing the X server to copy from the backing store to the window.\n\/\/\n\/\/ The backing store is in the same format as the visual which our main window\n\/\/ is using. Bitmaps from the renderer are uploaded to the X server, either via\n\/\/ shared memory or over the wire, and XRENDER is used to convert them to the\n\/\/ correct format for the backing store.\n\nBackingStore::BackingStore(const gfx::Size& size,\n                           Display* display,\n                           int depth,\n                           void* visual,\n                           Drawable root_window,\n                           bool use_render,\n                           bool use_shared_memory)\n    : size_(size),\n      display_(display),\n      use_shared_memory_(use_shared_memory),\n      use_render_(use_render),\n      visual_depth_(depth),\n      root_window_(root_window) {\n  const int width = size.width();\n  const int height = size.height();\n\n  COMPILE_ASSERT(__BYTE_ORDER == __LITTLE_ENDIAN, assumes_little_endian);\n\n  pixmap_ = XCreatePixmap(display_, root_window, width, height, depth);\n\n  if (use_render_) {\n    picture_ = XRenderCreatePicture(\n        display_, pixmap_,\n        x11_util::GetRenderVisualFormat(display_, static_cast<Visual*>(visual)),\n        0, NULL);\n  } else {\n    picture_ = 0;\n    pixmap_bpp_ = x11_util::BitsPerPixelForPixmapDepth(display, depth);\n  }\n\n  pixmap_gc_ = XCreateGC(display_, pixmap_, 0, NULL);\n}\n\nBackingStore::BackingStore(const gfx::Size& size)\n    : size_(size),\n      display_(NULL),\n      use_shared_memory_(false),\n      use_render_(false),\n      visual_depth_(-1),\n      root_window_(0) {\n}\n\nBackingStore::~BackingStore() {\n  \/\/ In unit tests, display_ may be NULL.\n  if (!display_)\n    return;\n\n  XRenderFreePicture(display_, picture_);\n  XFreePixmap(display_, pixmap_);\n  XFreeGC(display_, static_cast<GC>(pixmap_gc_));\n}\n\nvoid BackingStore::PaintRectWithoutXrender(TransportDIB* bitmap,\n                                           const gfx::Rect &bitmap_rect) {\n  const int width = bitmap_rect.width();\n  const int height = bitmap_rect.height();\n  Pixmap pixmap = XCreatePixmap(display_, root_window_, width, height,\n                                visual_depth_);\n\n  XImage image;\n  memset(&image, 0, sizeof(image));\n\n  image.width = width;\n  image.height = height;\n  image.format = ZPixmap;\n  image.byte_order = LSBFirst;\n  image.bitmap_unit = 8;\n  image.bitmap_bit_order = LSBFirst;\n  image.red_mask = 0xff;\n  image.green_mask = 0xff00;\n  image.blue_mask = 0xff0000;\n\n  if (pixmap_bpp_ == 32) {\n    \/\/ If the X server depth is already 32-bits, then our job is easy.\n    image.depth = visual_depth_;\n    image.bits_per_pixel = 32;\n    image.bytes_per_line = width * 4;\n    image.data = static_cast<char*>(bitmap->memory());\n\n    XPutImage(display_, pixmap, static_cast<GC>(pixmap_gc_), &image,\n              0, 0 \/* source x, y *\/, 0, 0 \/* dest x, y *\/,\n              width, height);\n  } else if (pixmap_bpp_ == 24) {\n    \/\/ In this case we just need to strip the alpha channel out of each\n    \/\/ pixel. This is the case which covers VNC servers since they don't\n    \/\/ support Xrender but typically have 24-bit visuals.\n    \/\/\n    \/\/ It's possible to use some fancy SSE tricks here, but since this is the\n    \/\/ slow path anyway, we do it slowly.\n\n    uint8_t* bitmap24 = static_cast<uint8_t*>(malloc(3 * width * height));\n    const uint32_t* bitmap_in = static_cast<const uint32_t*>(bitmap->memory());\n    for (int y = 0; y < height; ++y) {\n      for (int x = 0; x < width; ++x) {\n        const uint32_t pixel = *(bitmap_in++);\n        bitmap24[0] = (pixel >> 16) & 0xff;\n        bitmap24[1] = (pixel >> 8) & 0xff;\n        bitmap24[2] = pixel & 0xff;\n        bitmap24 += 3;\n      }\n    }\n\n    image.depth = visual_depth_;\n    image.bits_per_pixel = 24;\n    image.bytes_per_line = width * 3;\n    image.data = reinterpret_cast<char*>(bitmap24);\n\n    XPutImage(display_, pixmap, static_cast<GC>(pixmap_gc_), &image,\n              0, 0 \/* source x, y *\/, 0, 0 \/* dest x, y *\/,\n              width, height);\n\n    free(bitmap24);\n  } else {\n    CHECK(false) << \"Sorry, we don't support your visual depth without \"\n                    \"Xrender support (depth:\" << visual_depth_\n                 << \" bpp:\" << pixmap_bpp_ << \")\";\n  }\n\n  XCopyArea(display_, pixmap \/* source *\/, pixmap_ \/* target *\/,\n            static_cast<GC>(pixmap_gc_),\n            0, 0 \/* source x, y *\/, bitmap_rect.width(), bitmap_rect.height(),\n            bitmap_rect.x(), bitmap_rect.y() \/* dest x, y *\/);\n\n  XFreePixmap(display_, pixmap);\n}\n\nvoid BackingStore::PaintRect(base::ProcessHandle process,\n                             TransportDIB* bitmap,\n                             const gfx::Rect& bitmap_rect) {\n  if (!display_)\n    return;\n\n  if (!use_render_)\n    return PaintRectWithoutXrender(bitmap, bitmap_rect);\n\n  const int width = bitmap_rect.width();\n  const int height = bitmap_rect.height();\n  Picture picture;\n  Pixmap pixmap;\n\n  if (use_shared_memory_) {\n    const XID shmseg = bitmap->MapToX(display_);\n\n    XShmSegmentInfo shminfo;\n    memset(&shminfo, 0, sizeof(shminfo));\n    shminfo.shmseg = shmseg;\n\n    \/\/ The NULL in the following is the |data| pointer: this is an artifact of\n    \/\/ Xlib trying to be helpful, rather than just exposing the X protocol. It\n    \/\/ assumes that we have the shared memory segment mapped into our memory,\n    \/\/ which we don't, and it's trying to calculate an offset by taking the\n    \/\/ difference between the |data| pointer and the address of the mapping in\n    \/\/ |shminfo|. Since both are NULL, the offset will be calculated to be 0,\n    \/\/ which is correct for us.\n    pixmap = XShmCreatePixmap(display_, root_window_, NULL, &shminfo, width,\n                              height, 32);\n  } else {\n    \/\/ No shared memory support, we have to copy the bitmap contents to the X\n    \/\/ server. Xlib wraps the underlying PutImage call behind several layers of\n    \/\/ functions which try to convert the image into the format which the X\n    \/\/ server expects. The following values hopefully disable all conversions.\n    XImage image;\n    memset(&image, 0, sizeof(image));\n\n    image.width = width;\n    image.height = height;\n    image.depth = 32;\n    image.bits_per_pixel = 32;\n    image.format = ZPixmap;\n    image.byte_order = LSBFirst;\n    image.bitmap_unit = 8;\n    image.bitmap_bit_order = LSBFirst;\n    image.bytes_per_line = width * 4;\n    image.red_mask = 0xff;\n    image.green_mask = 0xff00;\n    image.blue_mask = 0xff0000;\n    image.data = static_cast<char*>(bitmap->memory());\n\n    pixmap = XCreatePixmap(display_, root_window_, width, height, 32);\n    GC gc = XCreateGC(display_, pixmap, 0, NULL);\n    XPutImage(display_, pixmap, gc, &image,\n              0, 0 \/* source x, y *\/, 0, 0 \/* dest x, y *\/,\n              width, height);\n    XFreeGC(display_, gc);\n  }\n\n  picture = x11_util::CreatePictureFromSkiaPixmap(display_, pixmap);\n  XRenderComposite(display_, PictOpSrc, picture \/* source *\/, 0 \/* mask *\/,\n                   picture_ \/* dest *\/, 0, 0 \/* source x, y *\/,\n                   0, 0 \/* mask x, y *\/,\n                   bitmap_rect.x(), bitmap_rect.y() \/* target x, y *\/,\n                   width, height);\n\n  \/\/ In the case of shared memory, we wait for the composite to complete so that\n  \/\/ we are sure that the X server has finished reading.\n  if (use_shared_memory_)\n    XSync(display_, False);\n\n  XRenderFreePicture(display_, picture);\n  XFreePixmap(display_, pixmap);\n}\n\nvoid BackingStore::ScrollRect(base::ProcessHandle process,\n                              TransportDIB* bitmap,\n                              const gfx::Rect& bitmap_rect,\n                              int dx, int dy,\n                              const gfx::Rect& clip_rect,\n                              const gfx::Size& view_size) {\n  if (!display_)\n    return;\n\n  \/\/ We only support scrolling in one direction at a time.\n  DCHECK(dx == 0 || dy == 0);\n\n  if (dy) {\n    \/\/ Positive values of |dy| scroll up\n    XCopyArea(display_, pixmap_, pixmap_, static_cast<GC>(pixmap_gc_),\n              0, std::max(0, -dy) \/* source x, y *\/,\n              size_.width(), size_.height() - abs(dy),\n              0, std::max(0, dy) \/* dest x, y *\/);\n  } else if (dx) {\n    \/\/ Positive values of |dx| scroll right\n    XCopyArea(display_, pixmap_, pixmap_, static_cast<GC>(pixmap_gc_),\n              std::max(0, -dx), 0 \/* source x, y *\/,\n              size_.width() - abs(dx), size_.height(),\n              std::max(0, dx), 0 \/* dest x, y *\/);\n  }\n\n  PaintRect(process, bitmap, bitmap_rect);\n}\n\nvoid BackingStore::ShowRect(const gfx::Rect& rect, XID target) {\n  XCopyArea(display_, pixmap_, target, static_cast<GC>(pixmap_gc_),\n            rect.x(), rect.y(), rect.width(), rect.height(),\n            rect.x(), rect.y());\n}\n<commit_msg>Added missing <stdlib.h>, needed on ubuntu 8.10.<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 \"chrome\/browser\/renderer_host\/backing_store.h\"\n\n#include <stdlib.h>\n#include <utility>\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/logging.h\"\n#include \"chrome\/common\/transport_dib.h\"\n#include \"chrome\/common\/x11_util.h\"\n#include \"chrome\/common\/x11_util_internal.h\"\n\n\/\/ X Backing Stores:\n\/\/\n\/\/ Unlike Windows, where the backing store is kept in heap memory, we keep our\n\/\/ backing store in the X server, as a pixmap. Thus expose events just require\n\/\/ instructing the X server to copy from the backing store to the window.\n\/\/\n\/\/ The backing store is in the same format as the visual which our main window\n\/\/ is using. Bitmaps from the renderer are uploaded to the X server, either via\n\/\/ shared memory or over the wire, and XRENDER is used to convert them to the\n\/\/ correct format for the backing store.\n\nBackingStore::BackingStore(const gfx::Size& size,\n                           Display* display,\n                           int depth,\n                           void* visual,\n                           Drawable root_window,\n                           bool use_render,\n                           bool use_shared_memory)\n    : size_(size),\n      display_(display),\n      use_shared_memory_(use_shared_memory),\n      use_render_(use_render),\n      visual_depth_(depth),\n      root_window_(root_window) {\n  const int width = size.width();\n  const int height = size.height();\n\n  COMPILE_ASSERT(__BYTE_ORDER == __LITTLE_ENDIAN, assumes_little_endian);\n\n  pixmap_ = XCreatePixmap(display_, root_window, width, height, depth);\n\n  if (use_render_) {\n    picture_ = XRenderCreatePicture(\n        display_, pixmap_,\n        x11_util::GetRenderVisualFormat(display_, static_cast<Visual*>(visual)),\n        0, NULL);\n  } else {\n    picture_ = 0;\n    pixmap_bpp_ = x11_util::BitsPerPixelForPixmapDepth(display, depth);\n  }\n\n  pixmap_gc_ = XCreateGC(display_, pixmap_, 0, NULL);\n}\n\nBackingStore::BackingStore(const gfx::Size& size)\n    : size_(size),\n      display_(NULL),\n      use_shared_memory_(false),\n      use_render_(false),\n      visual_depth_(-1),\n      root_window_(0) {\n}\n\nBackingStore::~BackingStore() {\n  \/\/ In unit tests, display_ may be NULL.\n  if (!display_)\n    return;\n\n  XRenderFreePicture(display_, picture_);\n  XFreePixmap(display_, pixmap_);\n  XFreeGC(display_, static_cast<GC>(pixmap_gc_));\n}\n\nvoid BackingStore::PaintRectWithoutXrender(TransportDIB* bitmap,\n                                           const gfx::Rect &bitmap_rect) {\n  const int width = bitmap_rect.width();\n  const int height = bitmap_rect.height();\n  Pixmap pixmap = XCreatePixmap(display_, root_window_, width, height,\n                                visual_depth_);\n\n  XImage image;\n  memset(&image, 0, sizeof(image));\n\n  image.width = width;\n  image.height = height;\n  image.format = ZPixmap;\n  image.byte_order = LSBFirst;\n  image.bitmap_unit = 8;\n  image.bitmap_bit_order = LSBFirst;\n  image.red_mask = 0xff;\n  image.green_mask = 0xff00;\n  image.blue_mask = 0xff0000;\n\n  if (pixmap_bpp_ == 32) {\n    \/\/ If the X server depth is already 32-bits, then our job is easy.\n    image.depth = visual_depth_;\n    image.bits_per_pixel = 32;\n    image.bytes_per_line = width * 4;\n    image.data = static_cast<char*>(bitmap->memory());\n\n    XPutImage(display_, pixmap, static_cast<GC>(pixmap_gc_), &image,\n              0, 0 \/* source x, y *\/, 0, 0 \/* dest x, y *\/,\n              width, height);\n  } else if (pixmap_bpp_ == 24) {\n    \/\/ In this case we just need to strip the alpha channel out of each\n    \/\/ pixel. This is the case which covers VNC servers since they don't\n    \/\/ support Xrender but typically have 24-bit visuals.\n    \/\/\n    \/\/ It's possible to use some fancy SSE tricks here, but since this is the\n    \/\/ slow path anyway, we do it slowly.\n\n    uint8_t* bitmap24 = static_cast<uint8_t*>(malloc(3 * width * height));\n    const uint32_t* bitmap_in = static_cast<const uint32_t*>(bitmap->memory());\n    for (int y = 0; y < height; ++y) {\n      for (int x = 0; x < width; ++x) {\n        const uint32_t pixel = *(bitmap_in++);\n        bitmap24[0] = (pixel >> 16) & 0xff;\n        bitmap24[1] = (pixel >> 8) & 0xff;\n        bitmap24[2] = pixel & 0xff;\n        bitmap24 += 3;\n      }\n    }\n\n    image.depth = visual_depth_;\n    image.bits_per_pixel = 24;\n    image.bytes_per_line = width * 3;\n    image.data = reinterpret_cast<char*>(bitmap24);\n\n    XPutImage(display_, pixmap, static_cast<GC>(pixmap_gc_), &image,\n              0, 0 \/* source x, y *\/, 0, 0 \/* dest x, y *\/,\n              width, height);\n\n    free(bitmap24);\n  } else {\n    CHECK(false) << \"Sorry, we don't support your visual depth without \"\n                    \"Xrender support (depth:\" << visual_depth_\n                 << \" bpp:\" << pixmap_bpp_ << \")\";\n  }\n\n  XCopyArea(display_, pixmap \/* source *\/, pixmap_ \/* target *\/,\n            static_cast<GC>(pixmap_gc_),\n            0, 0 \/* source x, y *\/, bitmap_rect.width(), bitmap_rect.height(),\n            bitmap_rect.x(), bitmap_rect.y() \/* dest x, y *\/);\n\n  XFreePixmap(display_, pixmap);\n}\n\nvoid BackingStore::PaintRect(base::ProcessHandle process,\n                             TransportDIB* bitmap,\n                             const gfx::Rect& bitmap_rect) {\n  if (!display_)\n    return;\n\n  if (!use_render_)\n    return PaintRectWithoutXrender(bitmap, bitmap_rect);\n\n  const int width = bitmap_rect.width();\n  const int height = bitmap_rect.height();\n  Picture picture;\n  Pixmap pixmap;\n\n  if (use_shared_memory_) {\n    const XID shmseg = bitmap->MapToX(display_);\n\n    XShmSegmentInfo shminfo;\n    memset(&shminfo, 0, sizeof(shminfo));\n    shminfo.shmseg = shmseg;\n\n    \/\/ The NULL in the following is the |data| pointer: this is an artifact of\n    \/\/ Xlib trying to be helpful, rather than just exposing the X protocol. It\n    \/\/ assumes that we have the shared memory segment mapped into our memory,\n    \/\/ which we don't, and it's trying to calculate an offset by taking the\n    \/\/ difference between the |data| pointer and the address of the mapping in\n    \/\/ |shminfo|. Since both are NULL, the offset will be calculated to be 0,\n    \/\/ which is correct for us.\n    pixmap = XShmCreatePixmap(display_, root_window_, NULL, &shminfo, width,\n                              height, 32);\n  } else {\n    \/\/ No shared memory support, we have to copy the bitmap contents to the X\n    \/\/ server. Xlib wraps the underlying PutImage call behind several layers of\n    \/\/ functions which try to convert the image into the format which the X\n    \/\/ server expects. The following values hopefully disable all conversions.\n    XImage image;\n    memset(&image, 0, sizeof(image));\n\n    image.width = width;\n    image.height = height;\n    image.depth = 32;\n    image.bits_per_pixel = 32;\n    image.format = ZPixmap;\n    image.byte_order = LSBFirst;\n    image.bitmap_unit = 8;\n    image.bitmap_bit_order = LSBFirst;\n    image.bytes_per_line = width * 4;\n    image.red_mask = 0xff;\n    image.green_mask = 0xff00;\n    image.blue_mask = 0xff0000;\n    image.data = static_cast<char*>(bitmap->memory());\n\n    pixmap = XCreatePixmap(display_, root_window_, width, height, 32);\n    GC gc = XCreateGC(display_, pixmap, 0, NULL);\n    XPutImage(display_, pixmap, gc, &image,\n              0, 0 \/* source x, y *\/, 0, 0 \/* dest x, y *\/,\n              width, height);\n    XFreeGC(display_, gc);\n  }\n\n  picture = x11_util::CreatePictureFromSkiaPixmap(display_, pixmap);\n  XRenderComposite(display_, PictOpSrc, picture \/* source *\/, 0 \/* mask *\/,\n                   picture_ \/* dest *\/, 0, 0 \/* source x, y *\/,\n                   0, 0 \/* mask x, y *\/,\n                   bitmap_rect.x(), bitmap_rect.y() \/* target x, y *\/,\n                   width, height);\n\n  \/\/ In the case of shared memory, we wait for the composite to complete so that\n  \/\/ we are sure that the X server has finished reading.\n  if (use_shared_memory_)\n    XSync(display_, False);\n\n  XRenderFreePicture(display_, picture);\n  XFreePixmap(display_, pixmap);\n}\n\nvoid BackingStore::ScrollRect(base::ProcessHandle process,\n                              TransportDIB* bitmap,\n                              const gfx::Rect& bitmap_rect,\n                              int dx, int dy,\n                              const gfx::Rect& clip_rect,\n                              const gfx::Size& view_size) {\n  if (!display_)\n    return;\n\n  \/\/ We only support scrolling in one direction at a time.\n  DCHECK(dx == 0 || dy == 0);\n\n  if (dy) {\n    \/\/ Positive values of |dy| scroll up\n    XCopyArea(display_, pixmap_, pixmap_, static_cast<GC>(pixmap_gc_),\n              0, std::max(0, -dy) \/* source x, y *\/,\n              size_.width(), size_.height() - abs(dy),\n              0, std::max(0, dy) \/* dest x, y *\/);\n  } else if (dx) {\n    \/\/ Positive values of |dx| scroll right\n    XCopyArea(display_, pixmap_, pixmap_, static_cast<GC>(pixmap_gc_),\n              std::max(0, -dx), 0 \/* source x, y *\/,\n              size_.width() - abs(dx), size_.height(),\n              std::max(0, dx), 0 \/* dest x, y *\/);\n  }\n\n  PaintRect(process, bitmap, bitmap_rect);\n}\n\nvoid BackingStore::ShowRect(const gfx::Rect& rect, XID target) {\n  XCopyArea(display_, pixmap_, target, static_cast<GC>(pixmap_gc_),\n            rect.x(), rect.y(), rect.width(), rect.height(),\n            rect.x(), rect.y());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2012-2013 Samplecount S.L.\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"Methcla\/Audio\/Engine.hpp\"\n#include \"Methcla\/Audio\/Group.hpp\"\n\nusing namespace Methcla::Audio;\n\n#define METHCLA_ASSERT_NODE_IS_BLANK(node) \\\n    BOOST_ASSERT(node != nullptr); \\\n    BOOST_ASSERT(node->m_parent == nullptr); \\\n    BOOST_ASSERT(node->m_prev == nullptr); \\\n    BOOST_ASSERT(node->m_next == nullptr); \\\n\n#define METHCLA_ASSERT_NODE_IS_LINKED(node) \\\n    BOOST_ASSERT(m_first != nullptr); \\\n    BOOST_ASSERT(m_last != nullptr); \\\n    BOOST_ASSERT(node->m_prev != nullptr || node == m_first); \\\n    BOOST_ASSERT(node->m_next != nullptr || node == m_last); \\\n    BOOST_ASSERT(m_first != m_last || (m_first == node && node == m_last));\n\nGroup::Group(Environment& env, NodeId nodeId)\n    : Node(env, nodeId)\n    , m_first(nullptr)\n    , m_last(nullptr)\n{\n}\n\nGroup::~Group()\n{\n    freeAll();\n}\n\nGroup* Group::construct(Environment& env, NodeId nodeId)\n{\n    return new (env.rtMem().alloc(sizeof(Group))) Group(env, nodeId);\n}\n\nvoid Group::doProcess(size_t numFrames)\n{\n    Node* node = m_first;\n    while (node != nullptr) {\n        \/\/ Store pointer to next node because current node might be destroyed by done action after process.\n        Node* nextNode = node->m_next;\n        node->process(numFrames);\n        node = nextNode;\n    }\n}\n\nvoid Group::addToHead(Node* node)\n{\n    METHCLA_ASSERT_NODE_IS_BLANK(node);\n\n    node->m_parent = this;\n    node->m_next = m_first;\n\n    if (m_first != nullptr) {\n        m_first->m_prev = node;\n    }\n\n    m_first = node;\n\n    if (m_last == nullptr) {\n        m_last = node;\n    }\n\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n}\n\nvoid Group::addToTail(Node* node)\n{\n    METHCLA_ASSERT_NODE_IS_BLANK(node);\n\n    node->m_parent = this;\n    node->m_prev = m_last;\n\n    if (m_last != nullptr) {\n        m_last->m_next = node;\n    }\n\n    m_last = node;\n\n    if (m_first == nullptr) {\n        m_first = node;\n    }\n\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n}\n\nvoid Group::addBefore(Node* target, Node* node)\n{\n    BOOST_ASSERT(target != nullptr);\n    BOOST_ASSERT(target->parent() == this);\n    METHCLA_ASSERT_NODE_IS_BLANK(node);\n\n    node->m_parent = this;\n    node->m_prev = target->m_prev;\n    target->m_prev = node;\n    node->m_next = target;\n\n    if (target == m_first) {\n        BOOST_ASSERT(node->m_prev == nullptr);\n        m_first = node;\n    } else {\n        BOOST_ASSERT(node->m_prev != nullptr);\n        node->m_prev->m_next = node;\n    }\n\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n}\n\nvoid Group::addAfter(Node* target, Node* node)\n{\n    BOOST_ASSERT(target != nullptr);\n    BOOST_ASSERT(target->parent() == this);\n    METHCLA_ASSERT_NODE_IS_BLANK(node);\n\n    node->m_parent = this;\n    node->m_next = target->m_next;\n    target->m_next = node;\n    node->m_prev = target;\n\n    if (target == m_last) {\n        BOOST_ASSERT(node->m_next == nullptr);\n        m_last = node;\n    } else {\n        BOOST_ASSERT(node->m_next != nullptr);\n        node->m_next->m_prev = node;\n    }\n\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n}\n\nvoid Group::remove(Node* node)\n{\n    BOOST_ASSERT(node != nullptr);\n    BOOST_ASSERT(node->parent() == this);\n    BOOST_ASSERT(   (node == m_first && node == m_last && node->m_prev == nullptr && node->m_next == nullptr)\n                || !((node->m_prev == nullptr) && (node->m_next == nullptr)) );\n\n    if (node == m_first) {\n        BOOST_ASSERT(node->m_prev == nullptr);\n        m_first = node->m_next;\n        if (m_first != nullptr) {\n            m_first->m_prev = nullptr;\n        }\n    } else {\n        node->m_prev->m_next = node->m_next;\n    }\n\n    if (node == m_last) {\n        BOOST_ASSERT(node->m_next == nullptr);\n        m_last = node->m_prev;\n        if (m_last != nullptr) {\n            m_last->m_next = nullptr;\n        }\n    } else {\n        node->m_next->m_prev = node->m_prev;\n    }\n\n    node->m_parent = nullptr;\n    node->m_prev = nullptr;\n    node->m_next = nullptr;\n}\n\nbool Group::isEmpty() const\n{\n    return m_first == nullptr;\n}\n\nvoid Group::freeAll()\n{\n    Node* node = m_first;\n    while (node != nullptr) {\n        \/\/ Store pointer to next node because current node might be destroyed by done action after process.\n        Node* nextNode = node->m_next;\n        node->free();\n        node = nextNode;\n    }\n}\n<commit_msg>Add more node tree assertions<commit_after>\/\/ Copyright 2012-2013 Samplecount S.L.\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"Methcla\/Audio\/Engine.hpp\"\n#include \"Methcla\/Audio\/Group.hpp\"\n\nusing namespace Methcla::Audio;\n\n#define METHCLA_ASSERT_NODE_IS_BLANK(node) \\\n    BOOST_ASSERT(node != nullptr); \\\n    BOOST_ASSERT(node->m_parent == nullptr); \\\n    BOOST_ASSERT(node->m_prev == nullptr); \\\n    BOOST_ASSERT(node->m_next == nullptr); \\\n\n#define METHCLA_ASSERT_NODE_IS_LINKED(node) \\\n    BOOST_ASSERT(m_first != nullptr); \\\n    BOOST_ASSERT(m_last != nullptr); \\\n    BOOST_ASSERT(node != nullptr); \\\n    BOOST_ASSERT(node->m_parent == this); \\\n    BOOST_ASSERT(node->m_prev != nullptr || node == m_first); \\\n    BOOST_ASSERT(node->m_next != nullptr || node == m_last); \\\n    BOOST_ASSERT(m_first != m_last || (m_first == node && node == m_last));\n\nGroup::Group(Environment& env, NodeId nodeId)\n    : Node(env, nodeId)\n    , m_first(nullptr)\n    , m_last(nullptr)\n{\n}\n\nGroup::~Group()\n{\n    freeAll();\n}\n\nGroup* Group::construct(Environment& env, NodeId nodeId)\n{\n    return new (env.rtMem().alloc(sizeof(Group))) Group(env, nodeId);\n}\n\nvoid Group::doProcess(size_t numFrames)\n{\n    Node* node = m_first;\n    while (node != nullptr) {\n        \/\/ Store pointer to next node because current node might be destroyed by done action after process.\n        Node* nextNode = node->m_next;\n        node->process(numFrames);\n        node = nextNode;\n    }\n}\n\nvoid Group::addToHead(Node* node)\n{\n    METHCLA_ASSERT_NODE_IS_BLANK(node);\n\n    node->m_parent = this;\n    node->m_next = m_first;\n\n    if (m_first != nullptr) {\n        m_first->m_prev = node;\n    }\n\n    m_first = node;\n\n    if (m_last == nullptr) {\n        m_last = node;\n    }\n\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n}\n\nvoid Group::addToTail(Node* node)\n{\n    METHCLA_ASSERT_NODE_IS_BLANK(node);\n\n    node->m_parent = this;\n    node->m_prev = m_last;\n\n    if (m_last != nullptr) {\n        m_last->m_next = node;\n    }\n\n    m_last = node;\n\n    if (m_first == nullptr) {\n        m_first = node;\n    }\n\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n}\n\nvoid Group::addBefore(Node* target, Node* node)\n{\n    BOOST_ASSERT(target != nullptr);\n    BOOST_ASSERT(target->parent() == this);\n    METHCLA_ASSERT_NODE_IS_BLANK(node);\n\n    node->m_parent = this;\n    node->m_prev = target->m_prev;\n    target->m_prev = node;\n    node->m_next = target;\n\n    if (target == m_first) {\n        BOOST_ASSERT(node->m_prev == nullptr);\n        m_first = node;\n    } else {\n        BOOST_ASSERT(node->m_prev != nullptr);\n        node->m_prev->m_next = node;\n    }\n\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n}\n\nvoid Group::addAfter(Node* target, Node* node)\n{\n    BOOST_ASSERT(target != nullptr);\n    BOOST_ASSERT(target->parent() == this);\n    METHCLA_ASSERT_NODE_IS_BLANK(node);\n\n    node->m_parent = this;\n    node->m_next = target->m_next;\n    target->m_next = node;\n    node->m_prev = target;\n\n    if (target == m_last) {\n        BOOST_ASSERT(node->m_next == nullptr);\n        m_last = node;\n    } else {\n        BOOST_ASSERT(node->m_next != nullptr);\n        node->m_next->m_prev = node;\n    }\n\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n}\n\nvoid Group::remove(Node* node)\n{\n    METHCLA_ASSERT_NODE_IS_LINKED(node);\n\n    if (node == m_first) {\n        m_first = node->m_next;\n        if (m_first != nullptr) {\n            m_first->m_prev = nullptr;\n        }\n    } else {\n        node->m_prev->m_next = node->m_next;\n    }\n\n    if (node == m_last) {\n        m_last = node->m_prev;\n        if (m_last != nullptr) {\n            m_last->m_next = nullptr;\n        }\n    } else {\n        node->m_next->m_prev = node->m_prev;\n    }\n\n    node->m_parent = nullptr;\n    node->m_prev = nullptr;\n    node->m_next = nullptr;\n}\n\nbool Group::isEmpty() const\n{\n    BOOST_ASSERT(m_first != nullptr || m_last == nullptr);\n    return m_first == nullptr;\n}\n\nvoid Group::freeAll()\n{\n    Node* node = m_first;\n    while (node != nullptr) {\n        \/\/ Store pointer to next node because current node might be destroyed by done action after process.\n        Node* nextNode = node->m_next;\n        node->free();\n        node = nextNode;\n    }\n    BOOST_ASSERT(isEmpty());\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 \"webkit\/support\/platform_support.h\"\n\n#include \"base\/base_paths.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/path_service.h\"\n#include \"base\/resource_util.h\"\n#include \"base\/string16.h\"\n#include \"base\/string_piece.h\"\n#include \"grit\/webkit_chromium_resources.h\"\n#include \"grit\/webkit_resources.h\"\n\n#define MAX_LOADSTRING 100\n\nnamespace {\n\nFilePath GetResourceFilePath(const char* ascii_name) {\n  FilePath path;\n  PathService::Get(base::DIR_EXE, &path);\n  path = path.AppendASCII(\"DumpRenderTree_resources\");\n  return path.AppendASCII(ascii_name);\n}\n\nbase::StringPiece GetRawDataResource(HMODULE module, int resource_id) {\n  void* data_ptr;\n  size_t data_size;\n  return base::GetDataResourceFromModule(module, resource_id, &data_ptr,\n                                         &data_size)\n      ? base::StringPiece(static_cast<char*>(data_ptr), data_size)\n      : base::StringPiece();\n}\n\nbase::StringPiece NetResourceProvider(int key) {\n  return GetRawDataResource(::GetModuleHandle(NULL), key);\n}\n\n}  \/\/ namespace\n\nnamespace webkit_support {\n\n\/\/ TODO(tkent): Implement some of the followings for platform-dependent tasks\n\/\/ such as loading resource.\n\nvoid BeforeInitialize() {\n}\n\nvoid AfterInitialize() {\n}\n\nvoid BeforeShutdown() {\n}\n\nvoid AfterShutdown() {\n}\n\n}  \/\/ namespace webkit_support\n\nnamespace webkit_glue {\n\nstring16 GetLocalizedString(int message_id) {\n  wchar_t localized[MAX_LOADSTRING];\n  int length = ::LoadString(::GetModuleHandle(NULL), message_id,\n                            localized, MAX_LOADSTRING);\n  if (!length && ::GetLastError() == ERROR_RESOURCE_NAME_NOT_FOUND) {\n    NOTREACHED();\n    return L\"No string for this identifier!\";\n  }\n  return string16(localized, length);\n}\n\nbase::StringPiece GetDataResource(int resource_id) {\n  switch (resource_id) {\n  case IDR_BROKENIMAGE: {\n    \/\/ Use webkit's broken image icon (16x16)\n    static std::string broken_image_data;\n    if (broken_image_data.empty()) {\n      FilePath path = GetResourceFilePath(\"missingImage.gif\");\n      bool success = file_util::ReadFileToString(path, &broken_image_data);\n      if (!success) {\n        LOG(FATAL) << \"Failed reading: \" << path.value();\n      }\n    }\n    return broken_image_data;\n  }\n  case IDR_TEXTAREA_RESIZER: {\n    \/\/ Use webkit's text area resizer image.\n    static std::string resize_corner_data;\n    if (resize_corner_data.empty()) {\n      FilePath path = GetResourceFilePath(\"textAreaResizeCorner.png\");\n      bool success = file_util::ReadFileToString(path, &resize_corner_data);\n      if (!success) {\n        LOG(FATAL) << \"Failed reading: \" << path.value();\n      }\n    }\n    return resize_corner_data;\n  }\n\n  case IDR_SEARCH_CANCEL:\n  case IDR_SEARCH_CANCEL_PRESSED:\n  case IDR_SEARCH_MAGNIFIER:\n  case IDR_SEARCH_MAGNIFIER_RESULTS:\n  case IDR_MEDIA_PAUSE_BUTTON:\n  case IDR_MEDIA_PLAY_BUTTON:\n  case IDR_MEDIA_PLAY_BUTTON_DISABLED:\n  case IDR_MEDIA_SOUND_FULL_BUTTON:\n  case IDR_MEDIA_SOUND_NONE_BUTTON:\n  case IDR_MEDIA_SOUND_DISABLED:\n  case IDR_MEDIA_SLIDER_THUMB:\n  case IDR_MEDIA_VOLUME_SLIDER_THUMB:\n  case IDR_DEVTOOLS_INJECT_WEBKIT_JS:\n  case IDR_DEVTOOLS_INJECT_DISPATCH_JS:\n  case IDR_DEVTOOLS_DEBUGGER_SCRIPT_JS:\n    return NetResourceProvider(resource_id);\n\n  default:\n    break;\n  }\n\n  return base::StringPiece();\n}\n\n}  \/\/ namespace webkit_glue\n<commit_msg>DevTools: remove one more reference to InjectDispatch.js<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 \"webkit\/support\/platform_support.h\"\n\n#include \"base\/base_paths.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/path_service.h\"\n#include \"base\/resource_util.h\"\n#include \"base\/string16.h\"\n#include \"base\/string_piece.h\"\n#include \"grit\/webkit_chromium_resources.h\"\n#include \"grit\/webkit_resources.h\"\n\n#define MAX_LOADSTRING 100\n\nnamespace {\n\nFilePath GetResourceFilePath(const char* ascii_name) {\n  FilePath path;\n  PathService::Get(base::DIR_EXE, &path);\n  path = path.AppendASCII(\"DumpRenderTree_resources\");\n  return path.AppendASCII(ascii_name);\n}\n\nbase::StringPiece GetRawDataResource(HMODULE module, int resource_id) {\n  void* data_ptr;\n  size_t data_size;\n  return base::GetDataResourceFromModule(module, resource_id, &data_ptr,\n                                         &data_size)\n      ? base::StringPiece(static_cast<char*>(data_ptr), data_size)\n      : base::StringPiece();\n}\n\nbase::StringPiece NetResourceProvider(int key) {\n  return GetRawDataResource(::GetModuleHandle(NULL), key);\n}\n\n}  \/\/ namespace\n\nnamespace webkit_support {\n\n\/\/ TODO(tkent): Implement some of the followings for platform-dependent tasks\n\/\/ such as loading resource.\n\nvoid BeforeInitialize() {\n}\n\nvoid AfterInitialize() {\n}\n\nvoid BeforeShutdown() {\n}\n\nvoid AfterShutdown() {\n}\n\n}  \/\/ namespace webkit_support\n\nnamespace webkit_glue {\n\nstring16 GetLocalizedString(int message_id) {\n  wchar_t localized[MAX_LOADSTRING];\n  int length = ::LoadString(::GetModuleHandle(NULL), message_id,\n                            localized, MAX_LOADSTRING);\n  if (!length && ::GetLastError() == ERROR_RESOURCE_NAME_NOT_FOUND) {\n    NOTREACHED();\n    return L\"No string for this identifier!\";\n  }\n  return string16(localized, length);\n}\n\nbase::StringPiece GetDataResource(int resource_id) {\n  switch (resource_id) {\n  case IDR_BROKENIMAGE: {\n    \/\/ Use webkit's broken image icon (16x16)\n    static std::string broken_image_data;\n    if (broken_image_data.empty()) {\n      FilePath path = GetResourceFilePath(\"missingImage.gif\");\n      bool success = file_util::ReadFileToString(path, &broken_image_data);\n      if (!success) {\n        LOG(FATAL) << \"Failed reading: \" << path.value();\n      }\n    }\n    return broken_image_data;\n  }\n  case IDR_TEXTAREA_RESIZER: {\n    \/\/ Use webkit's text area resizer image.\n    static std::string resize_corner_data;\n    if (resize_corner_data.empty()) {\n      FilePath path = GetResourceFilePath(\"textAreaResizeCorner.png\");\n      bool success = file_util::ReadFileToString(path, &resize_corner_data);\n      if (!success) {\n        LOG(FATAL) << \"Failed reading: \" << path.value();\n      }\n    }\n    return resize_corner_data;\n  }\n\n  case IDR_SEARCH_CANCEL:\n  case IDR_SEARCH_CANCEL_PRESSED:\n  case IDR_SEARCH_MAGNIFIER:\n  case IDR_SEARCH_MAGNIFIER_RESULTS:\n  case IDR_MEDIA_PAUSE_BUTTON:\n  case IDR_MEDIA_PLAY_BUTTON:\n  case IDR_MEDIA_PLAY_BUTTON_DISABLED:\n  case IDR_MEDIA_SOUND_FULL_BUTTON:\n  case IDR_MEDIA_SOUND_NONE_BUTTON:\n  case IDR_MEDIA_SOUND_DISABLED:\n  case IDR_MEDIA_SLIDER_THUMB:\n  case IDR_MEDIA_VOLUME_SLIDER_THUMB:\n  case IDR_DEVTOOLS_INJECT_WEBKIT_JS:\n  case IDR_DEVTOOLS_DEBUGGER_SCRIPT_JS:\n    return NetResourceProvider(resource_id);\n\n  default:\n    break;\n  }\n\n  return base::StringPiece();\n}\n\n}  \/\/ namespace webkit_glue\n<|endoftext|>"}
{"text":"<commit_before>#include \"third_robot_driver.hpp\"\n\n\/\/ inclusive dependency\n#include \"ThirdRobotInterface\/ThirdRobotInterface.h\"\n\n\/\/ dependency to ROS\n#include <nav_msgs\/Odometry.h> \/\/ odom\n\n\/\/ dependency to Boost\n#include <boost\/thread.hpp>\n\n\/\/ dependency to std\n#include <iostream>\n\n\nusing namespace std; \/\/ FIXME: this software is library to third_robot_driver_node, don't erosion grobal area.\n\ncirkit::ThirdRobotDriver::ThirdRobotDriver(ros::NodeHandle nh)\n  : nh_(nh), rate_(100)\n{\n  ros::NodeHandle n(\"~\");\n  n.param<std::string>(\"imcs01_port\", imcs01_port_, \"\/dev\/urbtc0\");\n  double pulse_rate = 0;\n  double geer_rate = 0;\n  double wheel_diameter_right = 0;\n  double wheel_diameter_left = 0;\n  double tred_width = 0;\n  n.param(\"pulse_rate\", pulse_rate, 40.0);\n  n.param(\"geer_rate\", geer_rate, 33.0);\n  n.param(\"wheel_diameter_right\", wheel_diameter_right, 0.275);\n  n.param(\"wheel_diameter_left\", wheel_diameter_left, 0.275);\n  n.param(\"tred_width\", tred_width, 0.595);\n\n  thirdrobot_ = new cirkit::ThirdRobotInterface(imcs01_port_, 0);\n  thirdrobot_->setParams(pulse_rate, geer_rate, wheel_diameter_right, wheel_diameter_left, tred_width);\n\n  odom_pub_ = nh_.advertise<nav_msgs::Odometry>(\"\/odom\", 1);\n  steer_pub_ = nh_.advertise<geometry_msgs::Twist>(\"\/steer_ctrl\", 1);\n  cmd_vel_sub_ = nh_.subscribe<geometry_msgs::Twist>(\"\/cmd_vel\", 1, boost::bind(&cirkit::ThirdRobotDriver::cmdVelReceived, this, _1));\n}\n\nvoid cirkit::ThirdRobotDriver::init()\n{\n  if(thirdrobot_->openSerialPort() == 0)\n\t{\n\t  ROS_INFO(\"Connected to Third Robot.\");\n\t  thirdrobot_->driveDirect(0, 0);\n\t}\n  else\n\t{\n\t  ROS_FATAL(\"Could not connect to Third Robot.\");\n\t  ROS_BREAK();\n\t}\n\n  thirdrobot_->resetOdometry();\n  thirdrobot_->setOdometry(0, 0, 0);\n}\n\nvoid cirkit::ThirdRobotDriver::run()\n{\n  double last_x, last_y, last_yaw;\n  double vel_x, vel_y, vel_yaw;\n  double dt;\n\n  init();\n\n  while(nh_.ok())\n\t{\n\t  current_time_ = ros::Time::now();\n\t  last_x = thirdrobot_->odometry_x_;\n\t  last_y = thirdrobot_->odometry_y_;\n\t  last_yaw = thirdrobot_->odometry_yaw_;\n\t  {\n\t\tboost::mutex::scoped_lock(access_mutex_);\n        if( thirdrobot_->getEncoderPacket() == -1){\n\t\t  ROS_ERROR(\"Could not retrieve encoder packet.\");\n        }else{\n\t\t  thirdrobot_->calculateOdometry();\n        }\n\t  }\n\t  dt = (current_time_ - last_time_).toSec();\n\t  vel_x = (thirdrobot_->odometry_x_ - last_x)\/dt;\n\t  vel_y = (thirdrobot_->odometry_y_ - last_y)\/dt;\n\t  vel_yaw = (thirdrobot_->odometry_yaw_ - last_yaw)\/dt;\n\t  \n\t  geometry_msgs::Quaternion odom_quat \n\t\t= tf::createQuaternionMsgFromYaw(thirdrobot_->odometry_yaw_);\n\t  geometry_msgs::TransformStamped odom_trans;\n\t  odom_trans.header.stamp = current_time_;\n\t  odom_trans.header.frame_id = \"odom\";\n\t  odom_trans.child_frame_id = \"base_link\";\n\t\n\t  odom_trans.transform.translation.x = thirdrobot_->odometry_x_;\n\t  odom_trans.transform.translation.y = thirdrobot_->odometry_y_;\n\t  odom_trans.transform.translation.z = 0.0;\n\t  odom_trans.transform.rotation = odom_quat;\n        \n\t  odom_broadcaster_.sendTransform(odom_trans);\n\n\t  nav_msgs::Odometry odom;\n\t  odom.header.stamp = current_time_;\n\t  odom.header.frame_id = \"odom\";\n\n\t  \/\/set the position\n\t  odom.pose.pose.position.x = thirdrobot_->odometry_x_;\n\t  odom.pose.pose.position.y = thirdrobot_->odometry_y_;\n\t  odom.pose.pose.position.z = 0.0;\n\t  odom.pose.pose.orientation = odom_quat;\n\t\t\n\t  \/\/set the velocity\n\t  odom.child_frame_id = \"base_link\";\n\t  odom.twist.twist.linear.x = vel_x;\n\t  odom.twist.twist.linear.y = vel_y;\n\t  odom.twist.twist.angular.z = vel_yaw;\n\t\t\n\t  \/\/publish the message\n\t  odom_pub_.publish(odom);\n\n\t  ros::spinOnce();\n\t  rate_.sleep();\n\t}\n}\n\ncirkit::ThirdRobotDriver::~ThirdRobotDriver()\n{\n  thirdrobot_->closeSerialPort();\n}\n\nvoid cirkit::ThirdRobotDriver::cmdVelReceived(const geometry_msgs::Twist::ConstPtr& cmd_vel)\n{\n  static int steer = 0;\n  {\n\tboost::mutex::scoped_lock(access_mutex_);\n\t\/\/ cout << \"cmdreived.x :\" << cmd_vel->linear.x << endl;\n\t\/\/ cout << \"cmdreived.z :\" << cmd_vel->angular.z << endl;\n\tsteer_dir_ = thirdrobot_->drive(cmd_vel->linear.x, cmd_vel->angular.z);\n  }\n  steer_pub_.publish(steer_dir_);\n\n}\n<commit_msg>Update init variable for rosparams<commit_after>#include \"third_robot_driver.hpp\"\n\n\/\/ inclusive dependency\n#include \"ThirdRobotInterface\/ThirdRobotInterface.h\"\n\n\/\/ dependency to ROS\n#include <nav_msgs\/Odometry.h> \/\/ odom\n\n\/\/ dependency to Boost\n#include <boost\/thread.hpp>\n\n\/\/ dependency to std\n#include <iostream>\n\n\nusing namespace std; \/\/ FIXME: this software is library to third_robot_driver_node, don't erosion grobal area.\n\ncirkit::ThirdRobotDriver::ThirdRobotDriver(ros::NodeHandle nh)\n  : nh_(nh), rate_(100)\n{\n  ros::NodeHandle n(\"~\");\n  n.param<std::string>(\"imcs01_port\", imcs01_port_, \"\/dev\/urbtc0\");\n  double pulse_rate = 40.0;\n  double geer_rate = 33.0;\n  double wheel_diameter_right = 0.275;\n  double wheel_diameter_left = 0.275;\n  double tred_width = 0.595;\n  n.param(\"pulse_rate\", pulse_rate, pulse_rate);\n  n.param(\"geer_rate\", geer_rate, geer_rate);\n  n.param(\"wheel_diameter_right\", whel_diameter_right, whel_diameter_right);\n  n.param(\"wheel_diameter_left\", wheel_diameter_left, wheel_diameter_left);\n  n.param(\"tred_width\", tred_width, tred_width);\n\n  thirdrobot_ = new cirkit::ThirdRobotInterface(imcs01_port_, 0); \/\/ FIXME: path received by argument for constructor\n  thirdrobot_->setParams(pulse_rate, geer_rate, wheel_diameter_right, wheel_diameter_left, tred_width);\n\n  odom_pub_ = nh_.advertise<nav_msgs::Odometry>(\"\/odom\", 1);\n  steer_pub_ = nh_.advertise<geometry_msgs::Twist>(\"\/steer_ctrl\", 1);\n  cmd_vel_sub_ = nh_.subscribe<geometry_msgs::Twist>(\"\/cmd_vel\", 1, boost::bind(&cirkit::ThirdRobotDriver::cmdVelReceived, this, _1));\n}\n\nvoid cirkit::ThirdRobotDriver::init()\n{\n  if(thirdrobot_->openSerialPort() == 0)\n\t{\n\t  ROS_INFO(\"Connected to Third Robot.\");\n\t  thirdrobot_->driveDirect(0, 0);\n\t}\n  else\n\t{\n\t  ROS_FATAL(\"Could not connect to Third Robot.\");\n\t  ROS_BREAK();\n\t}\n\n  thirdrobot_->resetOdometry();\n  thirdrobot_->setOdometry(0, 0, 0);\n}\n\nvoid cirkit::ThirdRobotDriver::run()\n{\n  double last_x, last_y, last_yaw;\n  double vel_x, vel_y, vel_yaw;\n  double dt;\n\n  init();\n\n  while(nh_.ok())\n\t{\n\t  current_time_ = ros::Time::now();\n\t  last_x = thirdrobot_->odometry_x_;\n\t  last_y = thirdrobot_->odometry_y_;\n\t  last_yaw = thirdrobot_->odometry_yaw_;\n\t  {\n\t\tboost::mutex::scoped_lock(access_mutex_);\n        if( thirdrobot_->getEncoderPacket() == -1){\n\t\t  ROS_ERROR(\"Could not retrieve encoder packet.\");\n        }else{\n\t\t  thirdrobot_->calculateOdometry();\n        }\n\t  }\n\t  dt = (current_time_ - last_time_).toSec();\n\t  vel_x = (thirdrobot_->odometry_x_ - last_x)\/dt;\n\t  vel_y = (thirdrobot_->odometry_y_ - last_y)\/dt;\n\t  vel_yaw = (thirdrobot_->odometry_yaw_ - last_yaw)\/dt;\n\t  \n\t  geometry_msgs::Quaternion odom_quat \n\t\t= tf::createQuaternionMsgFromYaw(thirdrobot_->odometry_yaw_);\n\t  geometry_msgs::TransformStamped odom_trans;\n\t  odom_trans.header.stamp = current_time_;\n\t  odom_trans.header.frame_id = \"odom\";\n\t  odom_trans.child_frame_id = \"base_link\";\n\t\n\t  odom_trans.transform.translation.x = thirdrobot_->odometry_x_;\n\t  odom_trans.transform.translation.y = thirdrobot_->odometry_y_;\n\t  odom_trans.transform.translation.z = 0.0;\n\t  odom_trans.transform.rotation = odom_quat;\n        \n\t  odom_broadcaster_.sendTransform(odom_trans);\n\n\t  nav_msgs::Odometry odom;\n\t  odom.header.stamp = current_time_;\n\t  odom.header.frame_id = \"odom\";\n\n\t  \/\/set the position\n\t  odom.pose.pose.position.x = thirdrobot_->odometry_x_;\n\t  odom.pose.pose.position.y = thirdrobot_->odometry_y_;\n\t  odom.pose.pose.position.z = 0.0;\n\t  odom.pose.pose.orientation = odom_quat;\n\t\t\n\t  \/\/set the velocity\n\t  odom.child_frame_id = \"base_link\";\n\t  odom.twist.twist.linear.x = vel_x;\n\t  odom.twist.twist.linear.y = vel_y;\n\t  odom.twist.twist.angular.z = vel_yaw;\n\t\t\n\t  \/\/publish the message\n\t  odom_pub_.publish(odom);\n\n\t  ros::spinOnce();\n\t  rate_.sleep();\n\t}\n}\n\ncirkit::ThirdRobotDriver::~ThirdRobotDriver()\n{\n  thirdrobot_->closeSerialPort();\n}\n\nvoid cirkit::ThirdRobotDriver::cmdVelReceived(const geometry_msgs::Twist::ConstPtr& cmd_vel)\n{\n  static int steer = 0;\n  {\n\tboost::mutex::scoped_lock(access_mutex_);\n\t\/\/ cout << \"cmdreived.x :\" << cmd_vel->linear.x << endl;\n\t\/\/ cout << \"cmdreived.z :\" << cmd_vel->angular.z << endl;\n\tsteer_dir_ = thirdrobot_->drive(cmd_vel->linear.x, cmd_vel->angular.z);\n  }\n  steer_pub_.publish(steer_dir_);\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>FEM: cpp commands post, do not use create, same like constraints, data at point<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}\n * };\n *\/\nclass Solution {\npublic:\n    int closestValue(TreeNode* root, double target) {\n\n        TreeNode* left = root->left;\n        TreeNode* right = root->right;\n\n        int closest = root->val;\n        if (target < root->val && root->left) {\n            int leftClosest = closestValue(root->left, target);\n            if (fabs(target - leftClosest) < fabs(target - closest)) {\n                closest = leftClosest;\n            }\n        }\n\n        if (target > root->val && root->right) {\n            int rightClosest = closestValue(root->right, target);\n            if (fabs(target - rightClosest) < fabs(target - closest)) {\n                closest = rightClosest;\n            }\n        }\n\n        return closest;\n    }\n};<commit_msg>added solutions<commit_after>\/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}\n * };\n *\/\nclass Solution {\npublic:\n    int closestValue(TreeNode* root, double target) {\n        double diff = target - root->val;\n        \n        if (diff < 0 && root->left != NULL) {\n            int leftVal = closestValue(root->left, target);\n            return fabs(diff) < fabs(leftVal - target) ? root->val : leftVal;\n        } else if (diff > 0 && root->right != NULL) {\n            int rightVal = closestValue(root->right, target);\n            return fabs(diff) < fabs(rightVal - target) ? root->val : rightVal;\n        }\n        return root->val;\n    }\n};<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n    filename:   CEGUIIrrlichtGeometryBuffer.cpp\n    created:    Tue Mar 3 2009\n    author:     Paul D Turner (parts based on original code by Thomas Suter)\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2009 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#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"CEGUIIrrlichtGeometryBuffer.h\"\n#include \"CEGUIRenderEffect.h\"\n#include \"CEGUIIrrlichtTexture.h\"\n#include \"CEGUIVertex.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\nIrrlichtGeometryBuffer::IrrlichtGeometryBuffer(irr::video::IVideoDriver& driver):\n    d_driver(driver),\n    d_activeTexture(0),\n    d_clipRect(0, 0, 0, 0),\n    d_translation(0, 0, 0),\n    d_rotation(0, 0, 0),\n    d_pivot(0, 0, 0),\n    d_effect(0),\n    d_matrixValid(false),\n    d_xViewDir(driver.getDriverType() != irr::video::EDT_OPENGL ? 1.0f : -1.0f),\n    d_texelOffset(driver.getDriverType() != irr::video::EDT_OPENGL ? -0.5f : 0.0f)\n{\n    d_material.BackfaceCulling = false;\n    d_material.Lighting = false;\n    d_material.ZBuffer = 0;\n    d_material.ZWriteEnable = false;\n    #if CEGUI_IRR_SDK_VERSION >= 16\n        d_material.MaterialType = irr::video::EMT_ONETEXTURE_BLEND;\n        d_material.MaterialTypeParam = irr::video::pack_texureBlendFunc(\n                irr::video::EBF_SRC_ALPHA,\n                irr::video::EBF_ONE_MINUS_SRC_ALPHA,\n                irr::video::EMFN_MODULATE_1X,\n                irr::video::EAS_NONE);\n    #else\n        d_material.MaterialType = irr::video::EMT_TRANSPARENT_ALPHA_CHANNEL;\n        d_material.MaterialTypeParam = 0;\n    #endif\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::draw() const\n{\n    \/\/ Set up clipping for this buffer\n    \/\/\n    \/\/ NB: This is done via viewport & projection manipulation because Irrlicht\n    \/\/ does not expose scissoring facilities of underlying APIs.  This has the\n    \/\/ unfortunate side effect of being much more expensive to set up.\n    const irr::core::rect<irr::s32> target_vp(d_driver.getViewPort());\n    const irr::core::matrix4 proj\n        (d_driver.getTransform(irr::video::ETS_PROJECTION));\n\n    const Size csz(d_clipRect.getSize());\n    const Size tsz(static_cast<float>(target_vp.getWidth()),\n                   static_cast<float>(target_vp.getHeight()));\n\n    \/\/ set modified projection 'scissor' matix that negates scale and\n    \/\/ translation that would be done by setting the viewport to the clip area.\n    irr::core::matrix4 scsr(irr::core::matrix4::EM4CONST_IDENTITY);\n    scsr(0, 0) = tsz.d_width \/ csz.d_width;\n    scsr(1, 1) = tsz.d_height \/ csz.d_height;\n    scsr(3, 0) = d_xViewDir * (tsz.d_width + 2.0f *\n                   (target_vp.UpperLeftCorner.X -\n                     (d_clipRect.d_left + csz.d_width * 0.5f))) \/ csz.d_width;\n    scsr(3, 1) = -(tsz.d_height + 2.0f *\n                   (target_vp.UpperLeftCorner.Y -\n                     (d_clipRect.d_top + csz.d_height * 0.5f))) \/ csz.d_height;\n    scsr *= proj;\n    d_driver.setTransform(irr::video::ETS_PROJECTION, scsr);\n\n    \/\/ set new viewport for the clipping area\n    const irr::core::rect<irr::s32> vp(\n            static_cast<irr::s32>(d_clipRect.d_left),\n            static_cast<irr::s32>(d_clipRect.d_top),\n            static_cast<irr::s32>(d_clipRect.d_right),\n            static_cast<irr::s32>(d_clipRect.d_bottom));\n    d_driver.setViewPort(vp);\n\n    if (!d_matrixValid)\n        updateMatrix();\n\n    d_driver.setTransform(irr::video::ETS_WORLD, d_matrix);\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        \/\/ draw the batches\n        size_t pos = 0;\n        BatchList::const_iterator i = d_batches.begin();\n        for ( ; i != d_batches.end(); ++i)\n        {\n            d_material.setTexture(0, (*i).first);\n            d_driver.setMaterial(d_material);\n            d_driver.drawIndexedTriangleList(&d_vertices[pos], (*i).second,\n                                            &d_indices[pos], (*i).second \/ 3);\n            pos += (*i).second;\n        }\n    }\n\n    \/\/ clean up RenderEffect\n    if (d_effect)\n        d_effect->performPostRenderFunctions();\n\n    \/\/ restore original projection matrix and viewport.\n    d_driver.setTransform(irr::video::ETS_PROJECTION, proj);\n    d_driver.setViewPort(target_vp);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setTranslation(const Vector3& v)\n{\n    d_translation.X = v.d_x;\n    d_translation.Y = v.d_y;\n    d_translation.Z = v.d_z;\n    d_matrixValid = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setRotation(const Vector3& r)\n{\n    d_rotation.X = r.d_x;\n    d_rotation.Y = r.d_y;\n    d_rotation.Z = r.d_z;\n    d_matrixValid = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setPivot(const Vector3& p)\n{\n    d_pivot.X = p.d_x;\n    d_pivot.Y = p.d_y;\n    d_pivot.Z = p.d_z;\n    d_matrixValid = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setClippingRegion(const Rect& region)\n{\n    d_clipRect.d_top    = ceguimax(0.0f, PixelAligned(region.d_top));\n    d_clipRect.d_bottom = ceguimax(0.0f, PixelAligned(region.d_bottom));\n    d_clipRect.d_left   = ceguimax(0.0f, PixelAligned(region.d_left));\n    d_clipRect.d_right  = ceguimax(0.0f, PixelAligned(region.d_right));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::appendVertex(const Vertex& vertex)\n{\n    appendGeometry(&vertex, 1);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::appendGeometry(const Vertex* const vbuff,\n                                            uint vertex_count)\n{\n    \/\/ see if we should start a new batch\n    irr::video::ITexture* t =\n        d_activeTexture ? d_activeTexture->getIrrlichtTexture() : 0;\n\n    if (d_batches.empty() || d_batches.back().first != t)\n        d_batches.push_back(BatchInfo(t, 0));\n\n    \/\/ buffer these vertices\n    const irr::u16 idx_start = d_batches.back().second;\n    irr::video::S3DVertex v;\n    for (uint i = 0; i < vertex_count; ++i)\n    {\n        const Vertex& vs = vbuff[i];\n        v.Pos.X     = vs.position.d_x + d_texelOffset;\n        v.Pos.Y     = vs.position.d_y + d_texelOffset;\n        v.Pos.Z     = vs.position.d_z;\n        v.TCoords.X = vs.tex_coords.d_x;\n        v.TCoords.Y = vs.tex_coords.d_y;\n        v.Color.set(vs.colour_val.getARGB());\n        d_vertices.push_back(v);\n        d_indices.push_back(idx_start + i);\n    }\n\n    \/\/ update size of current batch\n    d_batches.back().second += vertex_count;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setActiveTexture(Texture* texture)\n{\n    d_activeTexture = static_cast<IrrlichtTexture*>(texture);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::reset()\n{\n    d_vertices.clear();\n    d_indices.clear();\n    d_batches.clear();\n    d_activeTexture = 0;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nTexture* IrrlichtGeometryBuffer::getActiveTexture() const\n{\n    return d_activeTexture;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nuint IrrlichtGeometryBuffer::getVertexCount() const\n{\n    return d_vertices.size();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nuint IrrlichtGeometryBuffer::getBatchCount() const\n{\n    return d_batches.size();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setRenderEffect(RenderEffect* effect)\n{\n    d_effect = effect;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nRenderEffect* IrrlichtGeometryBuffer::getRenderEffect()\n{\n    return d_effect;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst irr::core::matrix4& IrrlichtGeometryBuffer::getMatrix() const\n{\n    return d_matrix;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::updateMatrix() const\n{\n    d_matrix.makeIdentity();\n    d_matrix.setTranslation(d_translation + d_pivot);\n\n    irr::core::matrix4 rot;\n    rot.setRotationDegrees(d_rotation);\n    irr::core::matrix4 ptrans;\n    ptrans.setTranslation(-d_pivot);\n\n    d_matrix *= rot;\n    d_matrix *= ptrans;\n\n    d_matrixValid = true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nirr::video::SMaterial& IrrlichtGeometryBuffer::getMaterial()\n{\n    return const_cast<irr::video::SMaterial&>(\n        static_cast<const IrrlichtGeometryBuffer*>(this)->getMaterial());\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst irr::video::SMaterial& IrrlichtGeometryBuffer::getMaterial() const\n{\n    return d_material;\n}\n\n} \/\/ End of  CEGUI namespace section\n<commit_msg>Deal with the Irrlicht texure vs texture situation<commit_after>\/***********************************************************************\n    filename:   CEGUIIrrlichtGeometryBuffer.cpp\n    created:    Tue Mar 3 2009\n    author:     Paul D Turner (parts based on original code by Thomas Suter)\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2009 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#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"CEGUIIrrlichtGeometryBuffer.h\"\n#include \"CEGUIRenderEffect.h\"\n#include \"CEGUIIrrlichtTexture.h\"\n#include \"CEGUIVertex.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\nIrrlichtGeometryBuffer::IrrlichtGeometryBuffer(irr::video::IVideoDriver& driver):\n    d_driver(driver),\n    d_activeTexture(0),\n    d_clipRect(0, 0, 0, 0),\n    d_translation(0, 0, 0),\n    d_rotation(0, 0, 0),\n    d_pivot(0, 0, 0),\n    d_effect(0),\n    d_matrixValid(false),\n    d_xViewDir(driver.getDriverType() != irr::video::EDT_OPENGL ? 1.0f : -1.0f),\n    d_texelOffset(driver.getDriverType() != irr::video::EDT_OPENGL ? -0.5f : 0.0f)\n{\n    d_material.BackfaceCulling = false;\n    d_material.Lighting = false;\n    d_material.ZBuffer = 0;\n    d_material.ZWriteEnable = false;\n    #if CEGUI_IRR_SDK_VERSION >= 16\n        d_material.MaterialType = irr::video::EMT_ONETEXTURE_BLEND;\n        d_material.MaterialTypeParam =\n#if IRRLICHT_VERSION_MAJOR > 1 || (IRRLICHT_VERSION_MAJOR == 1 && IRRLICHT_VERSION_MINOR >= 8)\n            irr::video::pack_textureBlendFunc(\n#else\n            irr::video::pack_texureBlendFunc(\n#endif\n                irr::video::EBF_SRC_ALPHA,\n                irr::video::EBF_ONE_MINUS_SRC_ALPHA,\n                irr::video::EMFN_MODULATE_1X,\n                irr::video::EAS_NONE);\n    #else\n        d_material.MaterialType = irr::video::EMT_TRANSPARENT_ALPHA_CHANNEL;\n        d_material.MaterialTypeParam = 0;\n    #endif\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::draw() const\n{\n    \/\/ Set up clipping for this buffer\n    \/\/\n    \/\/ NB: This is done via viewport & projection manipulation because Irrlicht\n    \/\/ does not expose scissoring facilities of underlying APIs.  This has the\n    \/\/ unfortunate side effect of being much more expensive to set up.\n    const irr::core::rect<irr::s32> target_vp(d_driver.getViewPort());\n    const irr::core::matrix4 proj\n        (d_driver.getTransform(irr::video::ETS_PROJECTION));\n\n    const Size csz(d_clipRect.getSize());\n    const Size tsz(static_cast<float>(target_vp.getWidth()),\n                   static_cast<float>(target_vp.getHeight()));\n\n    \/\/ set modified projection 'scissor' matix that negates scale and\n    \/\/ translation that would be done by setting the viewport to the clip area.\n    irr::core::matrix4 scsr(irr::core::matrix4::EM4CONST_IDENTITY);\n    scsr(0, 0) = tsz.d_width \/ csz.d_width;\n    scsr(1, 1) = tsz.d_height \/ csz.d_height;\n    scsr(3, 0) = d_xViewDir * (tsz.d_width + 2.0f *\n                   (target_vp.UpperLeftCorner.X -\n                     (d_clipRect.d_left + csz.d_width * 0.5f))) \/ csz.d_width;\n    scsr(3, 1) = -(tsz.d_height + 2.0f *\n                   (target_vp.UpperLeftCorner.Y -\n                     (d_clipRect.d_top + csz.d_height * 0.5f))) \/ csz.d_height;\n    scsr *= proj;\n    d_driver.setTransform(irr::video::ETS_PROJECTION, scsr);\n\n    \/\/ set new viewport for the clipping area\n    const irr::core::rect<irr::s32> vp(\n            static_cast<irr::s32>(d_clipRect.d_left),\n            static_cast<irr::s32>(d_clipRect.d_top),\n            static_cast<irr::s32>(d_clipRect.d_right),\n            static_cast<irr::s32>(d_clipRect.d_bottom));\n    d_driver.setViewPort(vp);\n\n    if (!d_matrixValid)\n        updateMatrix();\n\n    d_driver.setTransform(irr::video::ETS_WORLD, d_matrix);\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        \/\/ draw the batches\n        size_t pos = 0;\n        BatchList::const_iterator i = d_batches.begin();\n        for ( ; i != d_batches.end(); ++i)\n        {\n            d_material.setTexture(0, (*i).first);\n            d_driver.setMaterial(d_material);\n            d_driver.drawIndexedTriangleList(&d_vertices[pos], (*i).second,\n                                            &d_indices[pos], (*i).second \/ 3);\n            pos += (*i).second;\n        }\n    }\n\n    \/\/ clean up RenderEffect\n    if (d_effect)\n        d_effect->performPostRenderFunctions();\n\n    \/\/ restore original projection matrix and viewport.\n    d_driver.setTransform(irr::video::ETS_PROJECTION, proj);\n    d_driver.setViewPort(target_vp);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setTranslation(const Vector3& v)\n{\n    d_translation.X = v.d_x;\n    d_translation.Y = v.d_y;\n    d_translation.Z = v.d_z;\n    d_matrixValid = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setRotation(const Vector3& r)\n{\n    d_rotation.X = r.d_x;\n    d_rotation.Y = r.d_y;\n    d_rotation.Z = r.d_z;\n    d_matrixValid = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setPivot(const Vector3& p)\n{\n    d_pivot.X = p.d_x;\n    d_pivot.Y = p.d_y;\n    d_pivot.Z = p.d_z;\n    d_matrixValid = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setClippingRegion(const Rect& region)\n{\n    d_clipRect.d_top    = ceguimax(0.0f, PixelAligned(region.d_top));\n    d_clipRect.d_bottom = ceguimax(0.0f, PixelAligned(region.d_bottom));\n    d_clipRect.d_left   = ceguimax(0.0f, PixelAligned(region.d_left));\n    d_clipRect.d_right  = ceguimax(0.0f, PixelAligned(region.d_right));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::appendVertex(const Vertex& vertex)\n{\n    appendGeometry(&vertex, 1);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::appendGeometry(const Vertex* const vbuff,\n                                            uint vertex_count)\n{\n    \/\/ see if we should start a new batch\n    irr::video::ITexture* t =\n        d_activeTexture ? d_activeTexture->getIrrlichtTexture() : 0;\n\n    if (d_batches.empty() || d_batches.back().first != t)\n        d_batches.push_back(BatchInfo(t, 0));\n\n    \/\/ buffer these vertices\n    const irr::u16 idx_start = d_batches.back().second;\n    irr::video::S3DVertex v;\n    for (uint i = 0; i < vertex_count; ++i)\n    {\n        const Vertex& vs = vbuff[i];\n        v.Pos.X     = vs.position.d_x + d_texelOffset;\n        v.Pos.Y     = vs.position.d_y + d_texelOffset;\n        v.Pos.Z     = vs.position.d_z;\n        v.TCoords.X = vs.tex_coords.d_x;\n        v.TCoords.Y = vs.tex_coords.d_y;\n        v.Color.set(vs.colour_val.getARGB());\n        d_vertices.push_back(v);\n        d_indices.push_back(idx_start + i);\n    }\n\n    \/\/ update size of current batch\n    d_batches.back().second += vertex_count;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setActiveTexture(Texture* texture)\n{\n    d_activeTexture = static_cast<IrrlichtTexture*>(texture);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::reset()\n{\n    d_vertices.clear();\n    d_indices.clear();\n    d_batches.clear();\n    d_activeTexture = 0;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nTexture* IrrlichtGeometryBuffer::getActiveTexture() const\n{\n    return d_activeTexture;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nuint IrrlichtGeometryBuffer::getVertexCount() const\n{\n    return d_vertices.size();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nuint IrrlichtGeometryBuffer::getBatchCount() const\n{\n    return d_batches.size();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::setRenderEffect(RenderEffect* effect)\n{\n    d_effect = effect;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nRenderEffect* IrrlichtGeometryBuffer::getRenderEffect()\n{\n    return d_effect;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst irr::core::matrix4& IrrlichtGeometryBuffer::getMatrix() const\n{\n    return d_matrix;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid IrrlichtGeometryBuffer::updateMatrix() const\n{\n    d_matrix.makeIdentity();\n    d_matrix.setTranslation(d_translation + d_pivot);\n\n    irr::core::matrix4 rot;\n    rot.setRotationDegrees(d_rotation);\n    irr::core::matrix4 ptrans;\n    ptrans.setTranslation(-d_pivot);\n\n    d_matrix *= rot;\n    d_matrix *= ptrans;\n\n    d_matrixValid = true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nirr::video::SMaterial& IrrlichtGeometryBuffer::getMaterial()\n{\n    return const_cast<irr::video::SMaterial&>(\n        static_cast<const IrrlichtGeometryBuffer*>(this)->getMaterial());\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst irr::video::SMaterial& IrrlichtGeometryBuffer::getMaterial() const\n{\n    return d_material;\n}\n\n} \/\/ End of  CEGUI namespace section\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n\n#include <iostream>\n#include <fstream>\n#include <opencv2\/opencv.hpp>\n#include <time.h>\n#include <unistd.h>\n#include <memory>\n\n#include \"objectTracking\/ColorTracker.h\"\n#include \"objectTracking\/Flooder.h\"\n#include \"CoordinateConverter.h\"\n#include \"Pool.h\"\n\nenum PROGRAM_STATE\n{\n    WAIT_FOR_SELECT,\n    SELECT_PARAMETERS,\n    PLAY\n};\nPROGRAM_STATE state;\n\nenum SELECT_STATE\n{\n    WHITE_BALL,\n    TARGET,\n    HOLE\n};\nSELECT_STATE selState;\n\ncv::VideoCapture camera(1);\n\nVec3 targetColor(29, 227, 218);\nVec3 minColor;\nVec3 maxColor;\nVec3 redColor(1, 227, 218);\nVec3 minRed;\nVec3 maxRed;\n\nVec3 threshold(30, 80, 80);\n\nstd::deque< Flooder::Blob > blobs;\n\nbool running = true;\n\n\/\/Used as a safe way of shutting down the program since ctrl+c doesn't stop\n\/\/using the webcam\nvoid onMouse(int event, int x, int y, int, void*);\nvoid selectColor(int event, int x, int y, int , void*);\nvoid setMinMaxColor(Vec3 target, Vec3& minColor, Vec3& maxColor, Vec3 threshold);\nvoid captureNewImage();\nvoid runSelect(float x, float y);\n\nvoid mainLoop();\n\nstd::unique_ptr<CoordinateConverter> coordinateConverter;\n\ncv::Mat currentImage;\nColorTracker ct;\n\nPool pool;\n\nint main()\n{\n    \/\/Reading bounds of the table\n    std::ifstream boundFile;\n    boundFile.open(\"bounds\");\n\n    std::vector<Vec2> boundCoords;\n    for(int i = 0; i < 3; ++i)\n    {\n        float x, y;\n\n        boundFile >> x >> y;\n\n        boundCoords.push_back(Vec2(x, y));\n    }\n    coordinateConverter.reset(new CoordinateConverter(boundCoords));\n    \n    if(camera.isOpened() == false)\n    {\n        std::cout << \"Failed to open camera\" << std::endl;\n    }\n\n    \/\/capture 1 image for use as reference\n    cv::Mat ref;\n    camera >> ref;\n\n    ColorTracker ct;\n    ct.setImage(ref);\n\n    \/\/targetColor = ct.getObjectColor();\n    minColor = targetColor - threshold;\n    maxColor = targetColor + threshold;\n    minRed = redColor - threshold;\n    maxRed = redColor + threshold;\n\n    cv::namedWindow(\"GUI\");\n    cv::setMouseCallback(\"GUI\", onMouse);\n    cv::moveWindow(\"GUI\", 0, 500);\n\n    cv::namedWindow(\"Display Image\");\n    cv::setMouseCallback(\"Display Image\", selectColor);\n\n    cv::namedWindow(\"Threshold img\");\n    cv::moveWindow(\"Threshold img\", 0, 0);\n\n    while(running == true)\n    {\n        mainLoop();\n    }\n\n    return 0;\n}\n\nvoid mainLoop()\n{\n    if(state == WAIT_FOR_SELECT)\n    {\n        captureNewImage();\n\n        \/\/Colortracking\n        ct.setImage(currentImage);\n        ct.generateBinary(minColor, maxColor, true);\n\n        \/\/Getting the blob data from the trackers\n        ct.generateBlobs();\n        blobs = ct.getBlobs(60);\n\n        int maxBlobSize = 0;\n        auto maxBlob= blobs.begin();\n        for(auto it = blobs.begin(); it != blobs.end(); ++it)\n        {\n            if(it->pixelAmount > maxBlobSize)\n            {\n                maxBlobSize = it->pixelAmount;\n                maxBlob= it;\n            }\n        }\n        blobs.erase(maxBlob);\n    }\n    else if(state == SELECT_PARAMETERS)\n    {\n    }\n    else if(state == PLAY)\n    {\n        state = WAIT_FOR_SELECT;\n    }\n\n    for(unsigned int i = 0; i < blobs.size(); i++)\n    {\n        ct.drawCircle(blobs.at(i).center, 5, cv::Scalar(255, 0, 0));\n    }\n    \n    cv::imshow(\"Threshold img\", ct.getBinary());\n    cv::imshow(\"Display Image\", currentImage);\n\n    cv::waitKey(1);\n}\n\nvoid onMouse(int event, int x, int y, int, void*)\n{\n    if(event != 1)\n    {\n        return;\n    }\n    \n    \/\/Exiting the program\n    running = false;\n}\n\nvoid selectColor(int event, int x, int y, int, void*)\n{\n    if(event == CV_EVENT_RBUTTONDOWN) \/\/If this isn't a left click\n    {\n\n        \/\/Create a color tracker to get the color\n        ColorTracker ct;\n        ct.setImage(currentImage);\n\n        redColor = ct.getColorInPixel(Vec2(x, y));\n        \n        \/\/Recalculating the threshold\n        setMinMaxColor(redColor, minColor, maxColor, threshold);\n    }\n    else if(event == CV_EVENT_LBUTTONDOWN)\n    {\n        \/\/std::cout << coordinateConverter->convertTo(Vec2(x,y)).getString() << std::endl;\n        switch(state) \n        {\n            case WAIT_FOR_SELECT:\n            {\n                state = SELECT_PARAMETERS;\n                break;\n            }\n            case SELECT_PARAMETERS:\n            {\n                runSelect(x, y);\n                break;\n            }\n        }\n    }\n}\n\n\nvoid setMinMaxColor(Vec3 target, Vec3& minColor, Vec3& maxColor, Vec3 threshold)\n{\n    minColor = target - threshold;\n    maxColor = target + threshold;\n}\n\nvoid captureNewImage()\n{\n    cv::Mat img;\n    camera >> img;\n\n    \/\/Fix fisheye problems\n    cv::Mat tmpImg;\n\n    \/\/Read fisheye correction stuff from a file. Generate using the \"cpp\/calibration\" sample\n    cv::Mat camera_matrix, distortion;\n    cv::FileStorage fs(\"fisheye0.txt\", cv::FileStorage::READ);\n    cv::FileNode fn = fs[\"IntParam\"];\n    fn[\"camera_matrix\"] >> camera_matrix;\n    fn[\"distortion\"] >> distortion;\n\n    cv::undistort(img, tmpImg, camera_matrix, distortion);\n\n    img = tmpImg;\n    currentImage = tmpImg;\n}\n\nvoid runSelect(float x, float y)\n{\n    \/\/Finding the closest ball\n    float minBlobDistance = 0;\n    auto closestBlob = blobs.begin();\n    for(auto it = blobs.begin(); it != blobs.end(); ++it)\n    {\n        Vec2 diff = closestBlob->center - Vec2(x, y);\n\n        if(diff.getLength() < minBlobDistance)\n        {\n            closestBlob = it;\n        }\n    }\n\n    switch(selState) \n    {\n        case WHITE_BALL:\n        {\n            pool.setWhiteBall(closestBlob->center);\n            selState = TARGET;\n            break;\n        }\n        case TARGET:\n        {\n            pool.setTargetBall(closestBlob->center);\n\n            selState = HOLE;\n            break;\n        }\n        case HOLE:\n        {\n            float holeX = round(x * 2) \/ 2.0;\n            float holeY = round(y * 2) \/ 2.0;\n\n            if(holeX < 0)\n                holeX = 0;\n            if(holeX > 1)\n                holeX = 1;\n            if(holeY < 0)\n                holeY = 0;\n            if(holeY > 0.5)\n                holeX = 0.5;\n\n            pool.setHole(Vec2(holeX, holeY));\n            selState = WHITE_BALL;\n            state = PLAY;\n            break;\n        }\n    }\n}\n<commit_msg>fix broken code from last commit<commit_after>#include <stdio.h>\n\n#include <iostream>\n#include <fstream>\n#include <opencv2\/opencv.hpp>\n#include <time.h>\n#include <unistd.h>\n#include <memory>\n\n#include \"objectTracking\/ColorTracker.h\"\n#include \"objectTracking\/Flooder.h\"\n#include \"CoordinateConverter.h\"\n#include \"Pool.h\"\n\nenum PROGRAM_STATE\n{\n    WAIT_FOR_SELECT,\n    SELECT_PARAMETERS,\n    PLAY\n};\nPROGRAM_STATE state;\n\nenum SELECT_STATE\n{\n    WHITE_BALL,\n    TARGET,\n    HOLE\n};\nSELECT_STATE selState;\n\ncv::VideoCapture camera(1);\n\nVec3 targetColor(29, 227, 218);\nVec3 minColor;\nVec3 maxColor;\nVec3 redColor(1, 227, 218);\nVec3 minRed;\nVec3 maxRed;\n\nVec3 threshold(30, 80, 80);\n\nstd::deque< Flooder::Blob > blobs;\n\nbool running = true;\n\n\/\/Used as a safe way of shutting down the program since ctrl+c doesn't stop\n\/\/using the webcam\nvoid onMouse(int event, int x, int y, int, void*);\nvoid selectColor(int event, int x, int y, int , void*);\nvoid setMinMaxColor(Vec3 target, Vec3& minColor, Vec3& maxColor, Vec3 threshold);\nvoid captureNewImage();\nvoid runSelect(float x, float y);\n\nvoid mainLoop();\n\nstd::unique_ptr<CoordinateConverter> coordinateConverter;\n\ncv::Mat currentImage;\nColorTracker ct;\n\nPool pool;\n\nint main()\n{\n    \/\/Reading bounds of the table\n    std::ifstream boundFile;\n    boundFile.open(\"bounds\");\n\n    std::vector<Vec2> boundCoords;\n    for(int i = 0; i < 3; ++i)\n    {\n        float x, y;\n\n        boundFile >> x >> y;\n\n        boundCoords.push_back(Vec2(x, y));\n    }\n    coordinateConverter.reset(new CoordinateConverter(boundCoords));\n    \n    if(camera.isOpened() == false)\n    {\n        std::cout << \"Failed to open camera\" << std::endl;\n    }\n\n    \/\/capture 1 image for use as reference\n    cv::Mat ref;\n    camera >> ref;\n\n    ColorTracker ct;\n    ct.setImage(ref);\n\n    \/\/targetColor = ct.getObjectColor();\n    minColor = targetColor - threshold;\n    maxColor = targetColor + threshold;\n    minRed = redColor - threshold;\n    maxRed = redColor + threshold;\n\n    cv::namedWindow(\"GUI\");\n    cv::setMouseCallback(\"GUI\", onMouse);\n    cv::moveWindow(\"GUI\", 0, 500);\n\n    cv::namedWindow(\"Display Image\");\n    cv::setMouseCallback(\"Display Image\", selectColor);\n\n    cv::namedWindow(\"Threshold img\");\n    cv::moveWindow(\"Threshold img\", 0, 0);\n\n    while(running == true)\n    {\n        mainLoop();\n    }\n\n    return 0;\n}\n\nvoid mainLoop()\n{\n    if(state == WAIT_FOR_SELECT)\n    {\n        captureNewImage();\n\n        \/\/Colortracking\n        ct.setImage(currentImage);\n        ct.generateBinary(minColor, maxColor, true);\n\n        \/\/Getting the blob data from the trackers\n        ct.generateBlobs();\n        blobs = ct.getBlobs(60);\n\n        int maxBlobSize = 0;\n        auto maxBlob= blobs.begin();\n        for(auto it = blobs.begin(); it != blobs.end(); ++it)\n        {\n            if(it->pixelAmount > maxBlobSize)\n            {\n                maxBlobSize = it->pixelAmount;\n                maxBlob= it;\n            }\n        }\n        blobs.erase(maxBlob);\n    }\n    else if(state == SELECT_PARAMETERS)\n    {\n    }\n    else if(state == PLAY)\n    {\n        state = WAIT_FOR_SELECT;\n    }\n\n    for(unsigned int i = 0; i < blobs.size(); i++)\n    {\n        ct.drawCircle(blobs.at(i).center, 5, cv::Scalar(255, 0, 0));\n    }\n    \n    cv::imshow(\"Threshold img\", ct.getBinary());\n    cv::imshow(\"Display Image\", currentImage);\n\n    cv::waitKey(1);\n}\n\nvoid onMouse(int event, int x, int y, int, void*)\n{\n    if(event != 1)\n    {\n        return;\n    }\n    \n    \/\/Exiting the program\n    running = false;\n}\n\nvoid selectColor(int event, int x, int y, int, void*)\n{\n    if(event == CV_EVENT_RBUTTONDOWN) \/\/If this isn't a left click\n    {\n\n        \/\/Create a color tracker to get the color\n        ColorTracker ct;\n        ct.setImage(currentImage);\n\n        redColor = ct.getColorInPixel(Vec2(x, y));\n        \n        \/\/Recalculating the threshold\n        setMinMaxColor(redColor, minColor, maxColor, threshold);\n    }\n    else if(event == CV_EVENT_LBUTTONDOWN)\n    {\n        \/\/std::cout << coordinateConverter->convertTo(Vec2(x,y)).getString() << std::endl;\n        switch(state) \n        {\n            case WAIT_FOR_SELECT:\n            {\n                state = SELECT_PARAMETERS;\n                break;\n            }\n            case SELECT_PARAMETERS:\n            {\n                runSelect(x, y);\n                break;\n            }\n        }\n    }\n}\n\n\nvoid setMinMaxColor(Vec3 target, Vec3& minColor, Vec3& maxColor, Vec3 threshold)\n{\n    minColor = target - threshold;\n    maxColor = target + threshold;\n}\n\nvoid captureNewImage()\n{\n    cv::Mat img;\n    camera >> img;\n\n    \/\/Fix fisheye problems\n    cv::Mat tmpImg;\n\n    \/\/Read fisheye correction stuff from a file. Generate using the \"cpp\/calibration\" sample\n    cv::Mat camera_matrix, distortion;\n    cv::FileStorage fs(\"fisheye0.txt\", cv::FileStorage::READ);\n    cv::FileNode fn = fs[\"IntParam\"];\n    fn[\"camera_matrix\"] >> camera_matrix;\n    fn[\"distortion\"] >> distortion;\n\n    cv::undistort(img, tmpImg, camera_matrix, distortion);\n\n    img = tmpImg;\n    currentImage = tmpImg;\n}\n\nvoid runSelect(float x, float y)\n{\n    \/\/Finding the closest ball\n    float minBlobDistance = 0;\n    auto closestBlob = blobs.begin();\n    for(auto it = blobs.begin(); it != blobs.end(); ++it)\n    {\n        Vec2 diff = closestBlob->center - Vec2(x, y);\n\n        if(diff.getLength() < minBlobDistance)\n        {\n            closestBlob = it;\n        }\n    }\n\n    switch(selState) \n    {\n        case WHITE_BALL:\n        {\n            pool.setWhiteBall(closestBlob->center);\n            selState = TARGET;\n            break;\n        }\n        case TARGET:\n        {\n            pool.setTargetBall(closestBlob->center);\n\n            selState = HOLE;\n            break;\n        }\n        case HOLE:\n        {\n            float holeX = round(x * 2) \/ 2.0;\n            float holeY = round(y * 2) \/ 2.0;\n\n            if(holeX < 0)\n                holeX = 0;\n            if(holeX > 1)\n                holeX = 1;\n            if(holeY < 0)\n                holeY = 0;\n            if(holeY > 0.5)\n                holeX = 0.5;\n\n            pool.setPocket(Vec2(holeX, holeY));\n            selState = WHITE_BALL;\n            state = PLAY;\n            break;\n        }\n    }\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 \"components\/cdm\/renderer\/widevine_key_systems.h\"\n\n#include <string>\n#include <vector>\n\n#include \"base\/logging.h\"\n#include \"components\/cdm\/common\/cdm_messages_android.h\"\n#include \"content\/public\/renderer\/key_system_info.h\"\n#include \"content\/public\/renderer\/render_thread.h\"\n\n#include \"widevine_cdm_version.h\" \/\/ In SHARED_INTERMEDIATE_DIR.\n\n#if defined(WIDEVINE_CDM_AVAILABLE)\n\nusing content::KeySystemInfo;\nusing content::SupportedCodecs;\n\nnamespace cdm {\n\n\/\/ Return |name|'s parent key system.\nstatic std::string GetDirectParentName(std::string name) {\n  int last_period = name.find_last_of('.');\n  DCHECK_GT(last_period, 0);\n  return name.substr(0, last_period);\n}\n\nvoid AddWidevineWithCodecs(WidevineCdmType widevine_cdm_type,\n                           SupportedCodecs supported_codecs,\n                           std::vector<KeySystemInfo>* concrete_key_systems) {\n  KeySystemInfo info(kWidevineKeySystem);\n\n  switch (widevine_cdm_type) {\n    case WIDEVINE:\n      \/\/ For standard Widevine, add parent name.\n      info.parent_key_system = GetDirectParentName(kWidevineKeySystem);\n      break;\n#if defined(OS_ANDROID)\n    case WIDEVINE_HR_NON_COMPOSITING:\n      info.key_system.append(\".hrnoncompositing\");\n      break;\n#endif  \/\/ defined(OS_ANDROID)\n    default:\n      NOTREACHED();\n  }\n\n  \/\/ TODO(xhwang): A container or an initDataType may be supported even though\n  \/\/ there are no codecs supported in that container. Fix this when we support\n  \/\/ initDataType.\n  info.supported_codecs = supported_codecs;\n\n#if defined(ENABLE_PEPPER_CDMS)\n  info.pepper_type = kWidevineCdmPluginMimeType;\n#endif  \/\/ defined(ENABLE_PEPPER_CDMS)\n\n  concrete_key_systems->push_back(info);\n}\n\n#if defined(OS_ANDROID)\nvoid AddAndroidWidevine(std::vector<KeySystemInfo>* concrete_key_systems) {\n  SupportedKeySystemRequest request;\n  SupportedKeySystemResponse response;\n\n  request.key_system = kWidevineKeySystem;\n  request.codecs = content::EME_CODEC_WEBM_ALL | content::EME_CODEC_MP4_ALL;\n  content::RenderThread::Get()->Send(\n      new ChromeViewHostMsg_GetSupportedKeySystems(request, &response));\n  DCHECK(response.compositing_codecs & content::EME_CODEC_ALL)\n      << \"unrecognized codec\";\n  DCHECK(response.non_compositing_codecs & content::EME_CODEC_ALL)\n      << \"unrecognized codec\";\n  if (response.compositing_codecs != content::EME_CODEC_NONE) {\n    AddWidevineWithCodecs(\n        WIDEVINE,\n        static_cast<SupportedCodecs>(response.compositing_codecs),\n        concrete_key_systems);\n  }\n\n  if (response.non_compositing_codecs != content::EME_CODEC_NONE) {\n    AddWidevineWithCodecs(\n        WIDEVINE_HR_NON_COMPOSITING,\n        static_cast<SupportedCodecs>(response.non_compositing_codecs),\n        concrete_key_systems);\n  }\n}\n#endif  \/\/ OS_ANDROID\n\n}  \/\/ namespace cdm\n\n#endif  \/\/ defined(WIDEVINE_CDM_AVAILABLE)\n<commit_msg>Fix the compile error for win64: widevine_key_systems.cc.<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 \"components\/cdm\/renderer\/widevine_key_systems.h\"\n\n#include <string>\n#include <vector>\n\n#include \"base\/logging.h\"\n#include \"components\/cdm\/common\/cdm_messages_android.h\"\n#include \"content\/public\/renderer\/key_system_info.h\"\n#include \"content\/public\/renderer\/render_thread.h\"\n\n#include \"widevine_cdm_version.h\" \/\/ In SHARED_INTERMEDIATE_DIR.\n\n#if defined(WIDEVINE_CDM_AVAILABLE)\n\nusing content::KeySystemInfo;\nusing content::SupportedCodecs;\n\nnamespace cdm {\n\n\/\/ Return |name|'s parent key system.\nstatic std::string GetDirectParentName(std::string name) {\n  size_t last_period = name.find_last_of('.');\n  DCHECK_GT(last_period, 0u);\n  return name.substr(0u, last_period);\n}\n\nvoid AddWidevineWithCodecs(WidevineCdmType widevine_cdm_type,\n                           SupportedCodecs supported_codecs,\n                           std::vector<KeySystemInfo>* concrete_key_systems) {\n  KeySystemInfo info(kWidevineKeySystem);\n\n  switch (widevine_cdm_type) {\n    case WIDEVINE:\n      \/\/ For standard Widevine, add parent name.\n      info.parent_key_system = GetDirectParentName(kWidevineKeySystem);\n      break;\n#if defined(OS_ANDROID)\n    case WIDEVINE_HR_NON_COMPOSITING:\n      info.key_system.append(\".hrnoncompositing\");\n      break;\n#endif  \/\/ defined(OS_ANDROID)\n    default:\n      NOTREACHED();\n  }\n\n  \/\/ TODO(xhwang): A container or an initDataType may be supported even though\n  \/\/ there are no codecs supported in that container. Fix this when we support\n  \/\/ initDataType.\n  info.supported_codecs = supported_codecs;\n\n#if defined(ENABLE_PEPPER_CDMS)\n  info.pepper_type = kWidevineCdmPluginMimeType;\n#endif  \/\/ defined(ENABLE_PEPPER_CDMS)\n\n  concrete_key_systems->push_back(info);\n}\n\n#if defined(OS_ANDROID)\nvoid AddAndroidWidevine(std::vector<KeySystemInfo>* concrete_key_systems) {\n  SupportedKeySystemRequest request;\n  SupportedKeySystemResponse response;\n\n  request.key_system = kWidevineKeySystem;\n  request.codecs = content::EME_CODEC_WEBM_ALL | content::EME_CODEC_MP4_ALL;\n  content::RenderThread::Get()->Send(\n      new ChromeViewHostMsg_GetSupportedKeySystems(request, &response));\n  DCHECK(response.compositing_codecs & content::EME_CODEC_ALL)\n      << \"unrecognized codec\";\n  DCHECK(response.non_compositing_codecs & content::EME_CODEC_ALL)\n      << \"unrecognized codec\";\n  if (response.compositing_codecs != content::EME_CODEC_NONE) {\n    AddWidevineWithCodecs(\n        WIDEVINE,\n        static_cast<SupportedCodecs>(response.compositing_codecs),\n        concrete_key_systems);\n  }\n\n  if (response.non_compositing_codecs != content::EME_CODEC_NONE) {\n    AddWidevineWithCodecs(\n        WIDEVINE_HR_NON_COMPOSITING,\n        static_cast<SupportedCodecs>(response.non_compositing_codecs),\n        concrete_key_systems);\n  }\n}\n#endif  \/\/ OS_ANDROID\n\n}  \/\/ namespace cdm\n\n#endif  \/\/ defined(WIDEVINE_CDM_AVAILABLE)\n<|endoftext|>"}
{"text":"<commit_before>#include <bits\/stdc++.h>\n#include <zmqpp\/zmqpp.hpp>\n#include \"lib\/json.hpp\"\n#include \"lib\/base64.hpp\"\n\n#define NAME_REQ 0\n#define LS_REQ 1\n#define GET_REQ 2\n#define SEND_REQ 3\n#define RM_REQ 4\n\nusing namespace std;\nusing namespace zmqpp;\nusing json = nlohmann::json;\n\nvoid Pause() {\n  cout << \"Press any key to continue...\";\n  cin.ignore().get();\n}\n\nstring GetName(socket& s) {\n  regex r(\"[a-zA-Z]\\\\w*\");\n  string name;\n\n  bool ok;\n  do {\n    system(\"clear\");\n    cout << \"Username: \";\n    getline(cin, name);\n    json req;\n    req[\"type\"] = NAME_REQ;\n    req[\"user\"] = name;\n\n    message m;\n    m << req.dump();\n    s.send(m);\n\n    cout << \"Waiting response\" << endl;\n    message ans;\n    s.receive(ans);\n    string _res;\n    ans >> _res;\n    json res = json::parse(_res);\n\n    ok = res[\"res\"] == \"OK\";\n    if (!ok) {\n      cout << \"Invalid name\" << endl;\n      Pause();\n    }\n  } while(!ok);\n\n  return name;\n}\n\nint GetOption(string& opt) {\n  stringstream ss(opt);\n  int o;\n  ss >> o;\n\n  if (!ss)\n    return -1;\n  return o;\n}\n\nvoid ListFiles(string &user, socket& s) {\n  json req;\n  req[\"type\"] = LS_REQ;\n  req[\"user\"] = user;\n\n  message m;\n  m << req.dump();\n  s.send(m);\n\n  message ans;\n  s.receive(ans);\n  string _res;\n  ans >> _res;\n  json res = json::parse(_res);\n\n  if (res[\"res\"] == \"OK\") {\n    cout << \"Your files are:\" << endl;\n    for (auto &f : res[\"data\"]) {\n      cout << f << endl;\n    }\n  } else {\n    cout << res[\"res\"] << endl;\n  }\n\n  Pause();\n}\n\nvoid GetFile(string &user, socket& s) {\n  \/\/ TODO: Get files from server\n}\n\nvoid SendFile(string &user, socket& s) {\n  string filename;\n  cin >> filename;\n\n  json req;\n  req[\"type\"] = SEND_REQ;\n  req[\"user\"] = user;\n\n  message m;\n  m << req.dump();\n  s.send(m);\n\n  message ans;\n  s.receive(ans);\n  string _res;\n  ans >> _res;\n  json res = json::parse(_res);\n\n  if (res[\"res\"] == \"OK\") {\n  } else {\n    cout << res[\"res\"] << endl;\n  }\n\n  Pause();\n}\n\nbool ExecuteOpt(int opt, string &user, socket& s) {\n  switch (opt) {\n    case LS_REQ:\n      ListFiles(user, s);\n      break;\n    case GET_REQ:\n      break;\n    case SEND_REQ:\n      SendFile(user, s);\n      break;\n    case RM_REQ:\n     break;\n    case 0:\n      return false;\n      break;\n    default:\n      cout << \"Invalid option\" << endl;\n      Pause();\n      break;\n  }\n\n  return true;\n}\n\nbool PrintMenu(string &user, socket& s) {\n  system(\"clear\");\n\n  cout << \"Welcome \" << user << \" to SuperFancy FileSystem (SFFS)\" << endl;\n  cout << \"Please enter your choice :)\" << endl;\n  cout << \"1. List your files\" << endl;\n  cout << \"2. Get a file\" << endl;\n  cout << \"3. Upload a file\" << endl;\n  cout << \"4. Delete a file\" << endl;\n  cout << \"0. Exit\" << endl;\n  cout << \"> \";\n\n  string _opt;\n  cin >> _opt;\n  int opt = GetOption(_opt);\n  return ExecuteOpt(opt, user, s);\n}\n\nint main(int argc, const char *argv[]) {\n  string ip = \"localhost\", port = \"5555\";\n  context ctx;\n  socket s(ctx, socket_type::req);\n  s.connect(\"tcp:\/\/\" + ip + \":\" + port);\n\n  string user = GetName(s);\n\n  bool cont;\n  do {\n    cont = PrintMenu(user, s);\n  } while(cont);\n\n  \/\/ context ctx;\n  \/\/ socket s(ctx, socket_type::req);\n  \/\/ s.connect(\"tcp:\/\/localhost:5555\");\n  \/\/\n  \/\/ json load;\n  \/\/ load[\"user\"] = \"leiver\";\n  \/\/ load[\"name\"] = \"copy.mp3\";\n  \/\/\n  \/\/ ifstream fin(\"fs\/Super Mario World Music - Title Theme.mp3\", ios::binary);\n  \/\/ if (!fin) {\n  \/\/   cout << \"Mucha loca\" << endl;\n  \/\/   return 0;\n  \/\/ }\n  \/\/ stringstream oss;\n  \/\/ oss << fin.rdbuf();\n  \/\/ fin.close();\n  \/\/\n  \/\/ Base64 b64;\n  \/\/ string in = oss.str(), out;\n  \/\/ b64.Encode(in, &out);\n  \/\/ load[\"file\"] = out;\n  \/\/\n  \/\/ message m;\n  \/\/ m << load.dump();\n  \/\/ s.send(m);\n\n  return 0;\n}\n<commit_msg>Added ReadFileBase64 to client<commit_after>#include <bits\/stdc++.h>\n#include <zmqpp\/zmqpp.hpp>\n#include \"lib\/json.hpp\"\n#include \"lib\/base64.hpp\"\n\n#define NAME_REQ 0\n#define LS_REQ 1\n#define GET_REQ 2\n#define SEND_REQ 3\n#define RM_REQ 4\n\nusing namespace std;\nusing namespace zmqpp;\nusing json = nlohmann::json;\n\nvoid Pause() {\n  cout << \"Press any key to continue...\";\n  cin.ignore().get();\n}\n\nstring GetName(socket& s) {\n  regex r(\"[a-zA-Z]\\\\w*\");\n  string name;\n\n  bool ok;\n  do {\n    system(\"clear\");\n    cout << \"Username: \";\n    getline(cin, name);\n    json req;\n    req[\"type\"] = NAME_REQ;\n    req[\"user\"] = name;\n\n    message m;\n    m << req.dump();\n    s.send(m);\n\n    cout << \"Waiting response\" << endl;\n    message ans;\n    s.receive(ans);\n    string _res;\n    ans >> _res;\n    json res = json::parse(_res);\n\n    ok = res[\"res\"] == \"OK\";\n    if (!ok) {\n      cout << \"Invalid name\" << endl;\n      \/\/ Pause();\n    }\n  } while(!ok);\n\n  return name;\n}\n\nint GetOption(string& opt) {\n  stringstream ss(opt);\n  int o;\n  ss >> o;\n\n  if (!ss)\n    return -1;\n  return o;\n}\n\nvoid ListFiles(string &user, socket& s) {\n  json req;\n  req[\"type\"] = LS_REQ;\n  req[\"user\"] = user;\n\n  message m;\n  m << req.dump();\n  s.send(m);\n\n  message ans;\n  s.receive(ans);\n  string _res;\n  ans >> _res;\n  json res = json::parse(_res);\n\n  if (res[\"res\"] == \"OK\") {\n    cout << \"Your files are:\" << endl;\n    for (auto &f : res[\"data\"]) {\n      cout << f << endl;\n    }\n  } else {\n    cout << res[\"res\"] << endl;\n  }\n\n  \/\/ Pause();\n}\n\nvoid GetFile(string &user, socket& s) {\n  \/\/ TODO: Get files from server\n}\n\nstring ReadFileBase64(string& filename) {\n  ifstream fin(filename, ios::binary);\n  if (!fin) {\n    return \"\";\n  }\n\n  stringstream oss;\n  oss << fin.rdbuf();\n  fin.close();\n\n  Base64 b64;\n  string in = oss.str(), out;\n  b64.Encode(in, &out);\n\n  return out;\n}\n\nvoid SendFile(string &user, socket& s) {\n  string filename;\n  cin >> filename;\n\n  json req;\n  req[\"type\"] = SEND_REQ;\n  req[\"user\"] = user;\n\n  string file = ReadFileBase64(filename);\n\n  message m;\n  m << req.dump();\n  s.send(m);\n\n  message ans;\n  s.receive(ans);\n  string _res;\n  ans >> _res;\n  json res = json::parse(_res);\n\n  if (res[\"res\"] == \"OK\") {\n  } else {\n    cout << res[\"res\"] << endl;\n  }\n\n  \/\/ Pause();\n}\n\nbool ExecuteOpt(int opt, string &user, socket& s) {\n  switch (opt) {\n    case LS_REQ:\n      ListFiles(user, s);\n      break;\n    case GET_REQ:\n      break;\n    case SEND_REQ:\n      SendFile(user, s);\n      break;\n    case RM_REQ:\n     break;\n    case 0:\n      return false;\n      break;\n    default:\n      cout << \"Invalid option\" << endl;\n      \/\/ Pause();\n      break;\n  }\n\n  return true;\n}\n\nbool PrintMenu(string &user, socket& s) {\n  \/\/ system(\"clear\");\n\n  cout << \"Welcome \" << user << \" to SuperFancy FileSystem (SFFS)\" << endl;\n  cout << \"Please enter your choice :)\" << endl;\n  cout << \"1. List your files\" << endl;\n  cout << \"2. Get a file\" << endl;\n  cout << \"3. Upload a file\" << endl;\n  cout << \"4. Delete a file\" << endl;\n  cout << \"0. Exit\" << endl;\n  cout << \"> \";\n\n  string _opt;\n  cin >> _opt;\n  int opt = GetOption(_opt);\n  return ExecuteOpt(opt, user, s);\n}\n\nint main(int argc, const char *argv[]) {\n  string ip = \"localhost\", port = \"5555\";\n  context ctx;\n  socket s(ctx, socket_type::req);\n  s.connect(\"tcp:\/\/\" + ip + \":\" + port);\n\n  string user = GetName(s);\n\n  bool cont;\n  do {\n    cont = PrintMenu(user, s);\n  } while(cont);\n\n  \/\/ context ctx;\n  \/\/ socket s(ctx, socket_type::req);\n  \/\/ s.connect(\"tcp:\/\/localhost:5555\");\n  \/\/\n  \/\/ json load;\n  \/\/ load[\"user\"] = \"leiver\";\n  \/\/ load[\"name\"] = \"copy.mp3\";\n  \/\/\n  \/\/ ifstream fin(\"fs\/Super Mario World Music - Title Theme.mp3\", ios::binary);\n  \/\/ if (!fin) {\n  \/\/   cout << \"Mucha loca\" << endl;\n  \/\/   return 0;\n  \/\/ }\n  \/\/ stringstream oss;\n  \/\/ oss << fin.rdbuf();\n  \/\/ fin.close();\n  \/\/\n  \/\/ Base64 b64;\n  \/\/ string in = oss.str(), out;\n  \/\/ b64.Encode(in, &out);\n  \/\/ load[\"file\"] = out;\n  \/\/\n  \/\/ message m;\n  \/\/ m << load.dump();\n  \/\/ s.send(m);\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: layerupdatehandler.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 03:31: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 \"layerupdatehandler.hxx\"\n\n#ifndef CONFIGMGR_BACKEND_LAYERUPDATEMERGER_HXX\n#include \"layerupdatemerger.hxx\"\n#endif\n\n#ifndef CONFIGMGR_API_FACTORY_HXX_\n#include \"confapifactory.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_CONFIGURATION_BACKEND_XLAYERHANDLER_HPP_\n#include <com\/sun\/star\/configuration\/backend\/XLayerHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONFIGURATION_BACKEND_XLAYER_HPP_\n#include <com\/sun\/star\/configuration\/backend\/XLayer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYEXISTEXCEPTION_HPP_\n#include <com\/sun\/star\/beans\/PropertyExistException.hpp>\n#endif\n\n\/\/ -----------------------------------------------------------------------------\n#define OUSTR( str ) OUString( RTL_CONSTASCII_USTRINGPARAM( str ) )\n\/\/ -----------------------------------------------------------------------------\nnamespace configmgr\n{\n\/\/ -----------------------------------------------------------------------------\n    namespace backend\n    {\n\/\/ -----------------------------------------------------------------------------\n        namespace uno       = ::com::sun::star::uno;\n        namespace lang      = ::com::sun::star::lang;\n        namespace backenduno = ::com::sun::star::configuration::backend;\n\/\/ -----------------------------------------------------------------------------\n\nuno::Reference< uno::XInterface > SAL_CALL instantiateUpdateMerger\n( CreationContext const& xContext )\n{\n    return * new LayerUpdateHandler( xContext );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nLayerUpdateHandler::LayerUpdateHandler(CreationArg _xContext)\n: UpdateService(_xContext)\n, m_aBuilder()\n{\n}\n\/\/ -----------------------------------------------------------------------------\n\nLayerUpdateHandler::~LayerUpdateHandler()\n{\n}\n\/\/ -----------------------------------------------------------------------------\ninline\nvoid LayerUpdateHandler::checkBuilder(bool _bForProperty)\n{\n    if ( m_aBuilder.isEmpty() )\n        raiseMalformedDataException(\"LayerUpdateHandler: Illegal operation - no update is in progress\");\n\n    if ( !m_aBuilder.isActive() )\n        raiseMalformedDataException(\"LayerUpdateHandler: Illegal operation - no context for update available\");\n\n    if ( m_aBuilder.isPropertyActive() != _bForProperty )\n        raiseMalformedDataException(\"LayerUpdateHandler: Illegal operation - a property is in progress\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid LayerUpdateHandler::raiseMalformedDataException(sal_Char const * pMsg)\n{\n    OUString sMsg = OUString::createFromAscii(pMsg);\n    throw backenduno::MalformedDataException(sMsg,*this,uno::Any());\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid LayerUpdateHandler::raiseNodeChangedBeforeException(sal_Char const * pMsg)\n{\n    OUString sMsg = OUString::createFromAscii(pMsg);\n    throw backenduno::MalformedDataException(sMsg,*this,uno::Any());\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid LayerUpdateHandler::raisePropChangedBeforeException(sal_Char const * pMsg)\n{\n    OUString sMsg = OUString::createFromAscii(pMsg);\n    throw backenduno::MalformedDataException(sMsg,*this,uno::Any());\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid LayerUpdateHandler::raisePropExistsException(sal_Char const * pMsg)\n{\n    OUString sMsg = OUString::createFromAscii(pMsg);\n    com::sun::star::beans::PropertyExistException e(sMsg,*this);\n\n    throw backenduno::MalformedDataException(sMsg,*this, uno::makeAny(e));\n}\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ XUpdateHandler\nvoid SAL_CALL\n    LayerUpdateHandler::startUpdate(  )\n        throw ( MalformedDataException, lang::IllegalAccessException,\n                lang::WrappedTargetException, uno::RuntimeException)\n{\n    this->checkSourceLayer();\n    if (!m_aBuilder.init())\n        raiseMalformedDataException(\"LayerUpdateHandler: Cannot start update - update is already in progress\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::endUpdate(  )\n        throw ( MalformedDataException, lang::IllegalAccessException,\n                lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.finish())\n        raiseMalformedDataException(\"LayerUpdateHandler: Cannot finish update - a node is still open.\");\n\n    uno::Reference< backenduno::XLayer > xMergedLayer( LayerUpdateMerger::getMergedLayer(this->getSourceLayer(), m_aBuilder.result()) );\n\n    m_aBuilder.clear();\n\n    this->writeUpdatedLayer(xMergedLayer);\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::modifyNode( const OUString& aName, sal_Int16 aAttributes, sal_Int16 aAttributeMask, sal_Bool bReset )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.modifyNode(aName,aAttributes,aAttributeMask,bReset))\n        raiseNodeChangedBeforeException(\"LayerUpdateHandler: Cannot start node modification - node has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::addOrReplaceNode( const OUString& aName, sal_Int16 aAttributes )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.replaceNode(aName,aAttributes,NULL))\n        raiseNodeChangedBeforeException(\"LayerUpdateHandler: Cannot start added\/replaced node - node has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::addOrReplaceNodeFromTemplate( const OUString& aName, sal_Int16 aAttributes, const TemplateIdentifier& aTemplate )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.replaceNode(aName,aAttributes,&aTemplate))\n        raiseNodeChangedBeforeException(\"LayerUpdateHandler: Cannot start added\/replaced node - node has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::endNode(  )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.finishNode())\n    {\n        OSL_ENSURE(m_aBuilder.isPropertyActive() || !m_aBuilder.isActive(), \"LayerUpdateHandler: Unexpected failure mode for finishNode\");\n        if (m_aBuilder.isPropertyActive())\n            raiseMalformedDataException(\"LayerUpdateHandler: Cannot finish node update - open property has not been ended.\");\n        else\n            raiseMalformedDataException(\"LayerUpdateHandler: Cannot finish node update - no node has been started.\");\n    }\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::removeNode( const OUString& aName )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.removeNode(aName))\n        raiseNodeChangedBeforeException(\"LayerUpdateHandler: Cannot remove node - node has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler:: modifyProperty( const OUString& aName, sal_Int16 aAttributes, sal_Int16 aAttributeMask, const uno::Type & aType )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(false);\n\n    if (!m_aBuilder.modifyProperty(aName,aAttributes,aAttributeMask, aType))\n        raisePropChangedBeforeException(\"LayerUpdateHandler: Cannot start property modification - property has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler:: setPropertyValue( const uno::Any& aValue )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY( m_aBuilder.setPropertyValue(aValue) );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler:: setPropertyValueForLocale( const uno::Any& aValue, const OUString& aLocale )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY( m_aBuilder.setPropertyValueForLocale(aValue,aLocale) );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::resetPropertyValue( )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY( m_aBuilder.resetPropertyValue() );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::resetPropertyValueForLocale( const OUString& aLocale )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY( m_aBuilder.resetPropertyValueForLocale(aLocale) );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::endProperty(  )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY ( m_aBuilder.finishProperty() );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::resetProperty( const OUString& aName )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    if (!m_aBuilder.resetProperty(aName))\n        raisePropChangedBeforeException(\"LayerUpdateHandler: Cannot reset property - property has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::addOrReplaceProperty( const OUString& aName, sal_Int16 aAttributes, const uno::Type& aType )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    if (!m_aBuilder.addNullProperty(aName,aAttributes,aType))\n        raisePropExistsException(\"LayerUpdateHandler: Cannot add property - property exists (and has already been changed).\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::addOrReplacePropertyWithValue( const OUString& aName, sal_Int16 aAttributes, const uno::Any& aValue )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    if (!m_aBuilder.addProperty(aName,aAttributes,aValue))\n        raisePropExistsException(\"LayerUpdateHandler: Cannot add property - property exists (and has already been changed).\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::removeProperty( const OUString& aName )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    \/\/ treat 'remove' as 'reset'. (Note: does not verify that this actually amounts to dropping the property)\n    if (!m_aBuilder.resetProperty(aName))\n        raisePropChangedBeforeException(\"LayerUpdateHandler: Cannot remove property - property has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n    } \/\/ namespace\n\n\/\/ -----------------------------------------------------------------------------\n} \/\/ namespace\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.10.60); FILE MERGED 2006\/09\/01 17:20:30 kaib 1.10.60.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: layerupdatehandler.cxx,v $\n *\n *  $Revision: 1.11 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 15:05: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_configmgr.hxx\"\n\n#include \"layerupdatehandler.hxx\"\n\n#ifndef CONFIGMGR_BACKEND_LAYERUPDATEMERGER_HXX\n#include \"layerupdatemerger.hxx\"\n#endif\n\n#ifndef CONFIGMGR_API_FACTORY_HXX_\n#include \"confapifactory.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_CONFIGURATION_BACKEND_XLAYERHANDLER_HPP_\n#include <com\/sun\/star\/configuration\/backend\/XLayerHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONFIGURATION_BACKEND_XLAYER_HPP_\n#include <com\/sun\/star\/configuration\/backend\/XLayer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYEXISTEXCEPTION_HPP_\n#include <com\/sun\/star\/beans\/PropertyExistException.hpp>\n#endif\n\n\/\/ -----------------------------------------------------------------------------\n#define OUSTR( str ) OUString( RTL_CONSTASCII_USTRINGPARAM( str ) )\n\/\/ -----------------------------------------------------------------------------\nnamespace configmgr\n{\n\/\/ -----------------------------------------------------------------------------\n    namespace backend\n    {\n\/\/ -----------------------------------------------------------------------------\n        namespace uno       = ::com::sun::star::uno;\n        namespace lang      = ::com::sun::star::lang;\n        namespace backenduno = ::com::sun::star::configuration::backend;\n\/\/ -----------------------------------------------------------------------------\n\nuno::Reference< uno::XInterface > SAL_CALL instantiateUpdateMerger\n( CreationContext const& xContext )\n{\n    return * new LayerUpdateHandler( xContext );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nLayerUpdateHandler::LayerUpdateHandler(CreationArg _xContext)\n: UpdateService(_xContext)\n, m_aBuilder()\n{\n}\n\/\/ -----------------------------------------------------------------------------\n\nLayerUpdateHandler::~LayerUpdateHandler()\n{\n}\n\/\/ -----------------------------------------------------------------------------\ninline\nvoid LayerUpdateHandler::checkBuilder(bool _bForProperty)\n{\n    if ( m_aBuilder.isEmpty() )\n        raiseMalformedDataException(\"LayerUpdateHandler: Illegal operation - no update is in progress\");\n\n    if ( !m_aBuilder.isActive() )\n        raiseMalformedDataException(\"LayerUpdateHandler: Illegal operation - no context for update available\");\n\n    if ( m_aBuilder.isPropertyActive() != _bForProperty )\n        raiseMalformedDataException(\"LayerUpdateHandler: Illegal operation - a property is in progress\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid LayerUpdateHandler::raiseMalformedDataException(sal_Char const * pMsg)\n{\n    OUString sMsg = OUString::createFromAscii(pMsg);\n    throw backenduno::MalformedDataException(sMsg,*this,uno::Any());\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid LayerUpdateHandler::raiseNodeChangedBeforeException(sal_Char const * pMsg)\n{\n    OUString sMsg = OUString::createFromAscii(pMsg);\n    throw backenduno::MalformedDataException(sMsg,*this,uno::Any());\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid LayerUpdateHandler::raisePropChangedBeforeException(sal_Char const * pMsg)\n{\n    OUString sMsg = OUString::createFromAscii(pMsg);\n    throw backenduno::MalformedDataException(sMsg,*this,uno::Any());\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid LayerUpdateHandler::raisePropExistsException(sal_Char const * pMsg)\n{\n    OUString sMsg = OUString::createFromAscii(pMsg);\n    com::sun::star::beans::PropertyExistException e(sMsg,*this);\n\n    throw backenduno::MalformedDataException(sMsg,*this, uno::makeAny(e));\n}\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ XUpdateHandler\nvoid SAL_CALL\n    LayerUpdateHandler::startUpdate(  )\n        throw ( MalformedDataException, lang::IllegalAccessException,\n                lang::WrappedTargetException, uno::RuntimeException)\n{\n    this->checkSourceLayer();\n    if (!m_aBuilder.init())\n        raiseMalformedDataException(\"LayerUpdateHandler: Cannot start update - update is already in progress\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::endUpdate(  )\n        throw ( MalformedDataException, lang::IllegalAccessException,\n                lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.finish())\n        raiseMalformedDataException(\"LayerUpdateHandler: Cannot finish update - a node is still open.\");\n\n    uno::Reference< backenduno::XLayer > xMergedLayer( LayerUpdateMerger::getMergedLayer(this->getSourceLayer(), m_aBuilder.result()) );\n\n    m_aBuilder.clear();\n\n    this->writeUpdatedLayer(xMergedLayer);\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::modifyNode( const OUString& aName, sal_Int16 aAttributes, sal_Int16 aAttributeMask, sal_Bool bReset )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.modifyNode(aName,aAttributes,aAttributeMask,bReset))\n        raiseNodeChangedBeforeException(\"LayerUpdateHandler: Cannot start node modification - node has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::addOrReplaceNode( const OUString& aName, sal_Int16 aAttributes )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.replaceNode(aName,aAttributes,NULL))\n        raiseNodeChangedBeforeException(\"LayerUpdateHandler: Cannot start added\/replaced node - node has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::addOrReplaceNodeFromTemplate( const OUString& aName, sal_Int16 aAttributes, const TemplateIdentifier& aTemplate )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.replaceNode(aName,aAttributes,&aTemplate))\n        raiseNodeChangedBeforeException(\"LayerUpdateHandler: Cannot start added\/replaced node - node has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::endNode(  )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.finishNode())\n    {\n        OSL_ENSURE(m_aBuilder.isPropertyActive() || !m_aBuilder.isActive(), \"LayerUpdateHandler: Unexpected failure mode for finishNode\");\n        if (m_aBuilder.isPropertyActive())\n            raiseMalformedDataException(\"LayerUpdateHandler: Cannot finish node update - open property has not been ended.\");\n        else\n            raiseMalformedDataException(\"LayerUpdateHandler: Cannot finish node update - no node has been started.\");\n    }\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::removeNode( const OUString& aName )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder();\n\n    if (!m_aBuilder.removeNode(aName))\n        raiseNodeChangedBeforeException(\"LayerUpdateHandler: Cannot remove node - node has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler:: modifyProperty( const OUString& aName, sal_Int16 aAttributes, sal_Int16 aAttributeMask, const uno::Type & aType )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(false);\n\n    if (!m_aBuilder.modifyProperty(aName,aAttributes,aAttributeMask, aType))\n        raisePropChangedBeforeException(\"LayerUpdateHandler: Cannot start property modification - property has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler:: setPropertyValue( const uno::Any& aValue )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY( m_aBuilder.setPropertyValue(aValue) );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler:: setPropertyValueForLocale( const uno::Any& aValue, const OUString& aLocale )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY( m_aBuilder.setPropertyValueForLocale(aValue,aLocale) );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::resetPropertyValue( )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY( m_aBuilder.resetPropertyValue() );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::resetPropertyValueForLocale( const OUString& aLocale )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY( m_aBuilder.resetPropertyValueForLocale(aLocale) );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::endProperty(  )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    checkBuilder(true); \/\/ already checks for open property\n\n    OSL_VERIFY ( m_aBuilder.finishProperty() );\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::resetProperty( const OUString& aName )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    if (!m_aBuilder.resetProperty(aName))\n        raisePropChangedBeforeException(\"LayerUpdateHandler: Cannot reset property - property has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::addOrReplaceProperty( const OUString& aName, sal_Int16 aAttributes, const uno::Type& aType )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    if (!m_aBuilder.addNullProperty(aName,aAttributes,aType))\n        raisePropExistsException(\"LayerUpdateHandler: Cannot add property - property exists (and has already been changed).\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::addOrReplacePropertyWithValue( const OUString& aName, sal_Int16 aAttributes, const uno::Any& aValue )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    if (!m_aBuilder.addProperty(aName,aAttributes,aValue))\n        raisePropExistsException(\"LayerUpdateHandler: Cannot add property - property exists (and has already been changed).\");\n}\n\/\/ -----------------------------------------------------------------------------\n\nvoid SAL_CALL\n    LayerUpdateHandler::removeProperty( const OUString& aName )\n        throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException)\n{\n    \/\/ treat 'remove' as 'reset'. (Note: does not verify that this actually amounts to dropping the property)\n    if (!m_aBuilder.resetProperty(aName))\n        raisePropChangedBeforeException(\"LayerUpdateHandler: Cannot remove property - property has already been changed.\");\n}\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n    } \/\/ namespace\n\n\/\/ -----------------------------------------------------------------------------\n} \/\/ namespace\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"types.h\"\n#include \"amd64.h\"\n#include \"bits.hh\"\n#include \"kernel.hh\"\n#include \"traps.h\"\n#include \"cpu.hh\"\n#include \"apic.hh\"\n#include \"kstream.hh\"\n#include \"bitset.hh\"\n\n#define ID      0x802   \/\/ ID\n#define VER     0x803   \/\/ Version\n#define TPR     0x808   \/\/ Task Priority\n#define PPR     0x80a   \/\/ Processor Priority\n#define EOI     0x80b   \/\/ EOI\n#define LDR     0x80d   \/\/ Logical Destination\n#define SVR     0x80f   \/\/ Spurious Interrupt Vector\n  #define ENABLE     0x00000100   \/\/ Unit Enable\n#define ISR     0x810\n  #define ISR_NR     0x8\n#define TMR     0x818\n#define IRR     0x820\n#define ESR     0x828ull   \/\/ Error Status\n#define ICR     0x830ull   \/\/ Interrupt Command\n  #define INIT       0x00000500ull   \/\/ INIT\/RESET\n  #define STARTUP    0x00000600   \/\/ Startup IPI\n  #define BCAST      0x00080000   \/\/ Send to all APICs, including self.\n  #define LEVEL      0x00008000ull   \/\/ Level triggered\n  #define ASSERT     0x00004000   \/\/ Assert interrupt (vs deassert)\n  #define DEASSERT   0x00000000\n  #define FIXED      0x00000000\n#define TIMER   0x832   \/\/ Local Vector Table 0 (TIMER)\n  #define X1         0x0000000B   \/\/ divide counts by 1\n  #define PERIODIC   0x00020000   \/\/ Periodic\n#define THERM   0x833   \/\/ Thermal sensor LVT\n#define PCINT   0x834   \/\/ Performance Counter LVT\n#define LINT0   0x835   \/\/ Local Vector Table 1 (LINT0)\n#define LINT1   0x836   \/\/ Local Vector Table 2 (LINT1)\n#define ERROR   0x837   \/\/ Local Vector Table 3 (ERROR)\n  #define MASKED     0x00010000   \/\/ Interrupt masked\n  #define MT_EXTINT  0x00000500\n  #define MT_NMI     0x00000400   \/\/ NMI message type\n  #define MT_FIX     0x00000000   \/\/ Fixed message type\n#define TICR    0x838   \/\/ Timer Initial Count\n#define TCCR    0x839   \/\/ Timer Current Count\n#define TDCR    0x83e   \/\/ Timer Divide Configuration\n\nstatic console_stream verbose(true);\n\nstatic u64 x2apichz;\n\nclass x2apic_lapic : public abstract_lapic\n{\npublic:\n  void cpu_init();\n  hwid_t id();\n  void eoi();\n  void send_ipi(struct cpu *c, int ino);\n  void mask_pc(bool mask);\n  void start_ap(struct cpu *c, u32 addr);\n  bool is_x2apic();\n  void dump();\n  void dumpall();\nprivate:\n  void clearintr();\n};\n\nstatic int\nx2apicmaxlvt(void)\n{\n  unsigned int v;\n\n  v = readmsr(VER);\n  return (((v) >> 16) & 0xFFu);\n}\n\nvoid\nx2apic_lapic::eoi()\n{\n  writemsr(EOI, 0);\n}\n\nstatic int\nx2apicwait(void)\n{\n  \/\/ Do nothing on x2apic\n  return 0;\n}\n\n\/\/ Code closely follows native_cpu_up, do_boot_cpu,\n\/\/ and wakeup_secondary_cpu_via_init in Linux v3.3\nvoid\nx2apic_lapic::start_ap(struct cpu *c, u32 addr)\n{\n  int i;\n\n  \/\/ Be paranoid about clearing APIC errors\n  writemsr(ESR, 0);\n  readmsr(ESR);\n  \n  unsigned long accept_status;\n  int maxlvt = x2apicmaxlvt();\n \n  if (maxlvt > 3)\n    writemsr(ESR, 0);\n  readmsr(ESR);\n\n  \/\/ \"Universal startup algorithm.\"\n  \/\/ Send INIT (level-triggered) interrupt to reset other CPU.\n  \/\/ Asserting INIT\n  writemsr(ICR, (((u64)c->hwid.num)<<32) | INIT | LEVEL | ASSERT);\n  microdelay(10000);\n  \/\/ Deasserting INIT\n  writemsr(ICR, (((u64)c->hwid.num)<<32) | INIT | LEVEL);\n  x2apicwait();\n\n  \/\/ Send startup IPI (twice!) to enter bootstrap code.\n  \/\/ Regular hardware is supposed to only accept a STARTUP\n  \/\/ when it is in the halted state due to an INIT.  So the second\n  \/\/ should be ignored, but it is part of the official Intel algorithm.\n  for(i = 0; i < 2; i++){\n    writemsr(ESR, 0);\n    readmsr(ESR);\n\n    \/\/ Kick the target chip\n    writemsr(ICR, (((u64)c->hwid.num)<<32) | STARTUP | (addr>>12));\n    \/\/ Linux gives 300 usecs to accept the IPI..\n    microdelay(300);\n    x2apicwait();\n    \/\/ ..then it gives some more time\n    microdelay(200);\n\n    if (maxlvt > 3)\n      writemsr(ESR, 0);\n\n    accept_status = (readmsr(ESR) & 0xEF);\n    if (accept_status)\n      panic(\"x2apicstartap: accept status %lx\", accept_status);\n  }\n}\n\nvoid\nx2apic_lapic::mask_pc(bool mask)\n{\n  writemsr(PCINT, mask ? MASKED : MT_NMI);\n}\n\nvoid\nx2apic_lapic::send_ipi(struct cpu *c, int ino)\n{\n  \/\/ Unlike other MSR writes, x2apic writes are NOT serializing and\n  \/\/ hence an IPI may be received before local writes become visible.\n  \/\/ Prevent this by first performing an mfence.\n  asm volatile(\"mfence\");\n  writemsr(ICR, (((u64)c->hwid.num)<<32) | FIXED | DEASSERT | ino);\n}\n\nhwid_t\nx2apic_lapic::id()\n{\n  u64 id = readmsr(ID);\n  return HWID((u32)id);\n}\n\nbool\nx2apic_lapic::is_x2apic()\n{\n  return true;\n}\n\nvoid\nx2apic_lapic::clearintr()\n{\n  \/\/ Clear any pending interrupts.  Linux does this.\n  unsigned int value, queued;\n  int i, j, acked = 0;\n  unsigned long long tsc = 0, ntsc;\n  long long max_loops = 2400000;\n\n  tsc = rdtsc();\n  do {\n    queued = 0;\n    for (i = ISR_NR - 1; i >= 0; i--)\n      queued |= readmsr(IRR + i*0x1);\n    \n    for (i = ISR_NR - 1; i >= 0; i--) {\n      value = readmsr(ISR + i*0x1);\n      for (j = 31; j >= 0; j--) {\n        if (value & (1<<j)) {\n          eoi();\n          acked++;\n        }\n      }\n    }\n    if (acked > 256) {\n      cprintf(\"x2apic pending interrupts after %d EOI\\n\",\n              acked);\n      break;\n    }\n    ntsc = rdtsc();\n    max_loops = (2400000 << 10) - (ntsc - tsc);\n  } while (queued && max_loops > 0);\n}\n\n\/\/ Code closely follows setup_local_APIC in Linux v3.3\nvoid\nx2apic_lapic::cpu_init()\n{\n  u64 count;\n  u32 value;\n  int maxlvt;\n\n  verbose.println(\"x2apic: Initializing LAPIC (CPU \", myid(), \")\");\n\n  \/\/ Enable performance counter overflow interrupts for sampler.cc\n  mask_pc(false);\n\n  \/\/ Enable interrupts on the APIC (but not on the processor).\n  value = readmsr(TPR);\n  value &= ~0xffU;\n  writemsr(TPR, value);\n\n  clearintr();\n\n  \/\/ Enable local APIC; set spurious interrupt vector.\n  value = readmsr(SVR);\n  value &= ~0x000FF;\n  value |= ENABLE;\n  value |= T_IRQ0 + IRQ_SPURIOUS;\n  writemsr(SVR, value);\n\n  writemsr(LINT0, MT_EXTINT | MASKED);\n  if (readmsr(ID) == 0)\n    writemsr(LINT1, MT_NMI);\n  else\n    writemsr(LINT1, MT_NMI | MASKED);\n\n  maxlvt = x2apicmaxlvt();\n  if (maxlvt > 3)\n    writemsr(ESR, 0);\n\n  \/\/ enables sending errors\n  value = T_IRQ0 + IRQ_ERROR;\n  writemsr(ERROR, value);\n\n  if (maxlvt > 3)\n    writemsr(ESR, 0);\n  readmsr(ESR);\n\n  \/\/ Send an Init Level De-Assert to synchronise arbitration ID's.\n  writemsr(ICR, BCAST | INIT | LEVEL);\n\n  if (x2apichz == 0) {\n    \/\/ Measure the TICR frequency\n    writemsr(TDCR, X1);    \n    writemsr(TICR, 0xffffffff); \n    u64 ccr0 = readmsr(TCCR);\n    microdelay(10 * 1000);    \/\/ 1\/100th of a second\n    u64 ccr1 = readmsr(TCCR);\n    x2apichz = 100 * (ccr0 - ccr1);\n  }\n\n  count = (QUANTUM*x2apichz) \/ 1000;\n  if (count > 0xffffffff)\n    panic(\"initx2apic: QUANTUM too large\");\n\n  \/\/ The timer repeatedly counts down at bus frequency\n  \/\/ from xapic[TICR] and then issues an interrupt.  \n  writemsr(TDCR, X1);\n  writemsr(TIMER, PERIODIC | (T_IRQ0 + IRQ_TIMER));\n  writemsr(TICR, count); \n\n  \/\/ Clear error status register (requires back-to-back writes).\n  writemsr(ESR, 0);\n  writemsr(ESR, 0);\n\n  \/\/ Ack any outstanding interrupts.\n  writemsr(EOI, 0);\n\n  return;\n}\n\nvoid\nx2apic_lapic::dump()\n{\n  bitset<256> isr, irr, tmr;\n  scoped_cli cli();\n  for (int word = 0; word < ISR_NR; ++word) {\n    isr.setword(word * 32, readmsr(ISR + word));\n    irr.setword(word * 32, readmsr(IRR + word));\n    tmr.setword(word * 32, readmsr(TMR + word));\n  }\n  if (isr.any() || irr.any() || tmr.any())\n    \/\/ Fixed-mode interrupt vectors that are awaiting EOI (ISR), that\n    \/\/ are pending delivery (IRR), and are level-triggered and will\n    \/\/ trigger an IOAPIC EOI when acknowledged (TMR).\n    console.println(\"LAPIC INT  ISR \", isr, \" IRR \", irr, \" TMR \", tmr);\n}\n\nvoid\nx2apic_lapic::dumpall()\n{\n  scoped_cli cli();\n  console.println(\"LAPIC CPU \", myid());\n#define SHOW(reg) console.println(\"  \" #reg \"\\t\", shex(readmsr(reg)).width(10).pad())\n  SHOW(ID);\n  SHOW(VER);\n  SHOW(TPR);\n  SHOW(PPR);\n  SHOW(LDR);\n  SHOW(SVR);\n  SHOW(ESR);\n  SHOW(ICR);\n  SHOW(TIMER);\n  SHOW(THERM);\n  SHOW(PCINT);\n  SHOW(LINT0);\n  SHOW(LINT1);\n  SHOW(ERROR);\n  SHOW(TICR);\n  SHOW(TCCR);\n  SHOW(TDCR);\n#undef SHOW\n}\n\nbool\ninitlapic_x2apic(void)\n{\n  u32 edx;\n  cpuid(CPUID_FEATURES, nullptr, nullptr, nullptr, &edx);\n  if (!(edx & FEATURE_ECX_X2APIC))\n    return false;\n\n  \/\/ According to [Intel SDM 3A 10.12.8.1], if the BIOS initializes\n  \/\/ logical processors with APIC IDs greater than 255, then it should\n  \/\/ enable the x2APIC.\n  u64 apic_bar = readmsr(MSR_APIC_BAR);\n  if (!(apic_bar & APIC_BAR_X2APIC_EN) || !(apic_bar & APIC_BAR_XAPIC_EN))\n    return false;\n\n  verbose.println(\"x2apic: Using x2APIC LAPIC\");\n  static x2apic_lapic apic;\n  lapic = &apic;\n  return true;\n}\n<commit_msg>x2apic: Fix detection process<commit_after>#include \"types.h\"\n#include \"amd64.h\"\n#include \"bits.hh\"\n#include \"kernel.hh\"\n#include \"traps.h\"\n#include \"cpu.hh\"\n#include \"apic.hh\"\n#include \"kstream.hh\"\n#include \"bitset.hh\"\n\n#define ID      0x802   \/\/ ID\n#define VER     0x803   \/\/ Version\n#define TPR     0x808   \/\/ Task Priority\n#define PPR     0x80a   \/\/ Processor Priority\n#define EOI     0x80b   \/\/ EOI\n#define LDR     0x80d   \/\/ Logical Destination\n#define SVR     0x80f   \/\/ Spurious Interrupt Vector\n  #define ENABLE     0x00000100   \/\/ Unit Enable\n#define ISR     0x810\n  #define ISR_NR     0x8\n#define TMR     0x818\n#define IRR     0x820\n#define ESR     0x828ull   \/\/ Error Status\n#define ICR     0x830ull   \/\/ Interrupt Command\n  #define INIT       0x00000500ull   \/\/ INIT\/RESET\n  #define STARTUP    0x00000600   \/\/ Startup IPI\n  #define BCAST      0x00080000   \/\/ Send to all APICs, including self.\n  #define LEVEL      0x00008000ull   \/\/ Level triggered\n  #define ASSERT     0x00004000   \/\/ Assert interrupt (vs deassert)\n  #define DEASSERT   0x00000000\n  #define FIXED      0x00000000\n#define TIMER   0x832   \/\/ Local Vector Table 0 (TIMER)\n  #define X1         0x0000000B   \/\/ divide counts by 1\n  #define PERIODIC   0x00020000   \/\/ Periodic\n#define THERM   0x833   \/\/ Thermal sensor LVT\n#define PCINT   0x834   \/\/ Performance Counter LVT\n#define LINT0   0x835   \/\/ Local Vector Table 1 (LINT0)\n#define LINT1   0x836   \/\/ Local Vector Table 2 (LINT1)\n#define ERROR   0x837   \/\/ Local Vector Table 3 (ERROR)\n  #define MASKED     0x00010000   \/\/ Interrupt masked\n  #define MT_EXTINT  0x00000500\n  #define MT_NMI     0x00000400   \/\/ NMI message type\n  #define MT_FIX     0x00000000   \/\/ Fixed message type\n#define TICR    0x838   \/\/ Timer Initial Count\n#define TCCR    0x839   \/\/ Timer Current Count\n#define TDCR    0x83e   \/\/ Timer Divide Configuration\n\nstatic console_stream verbose(true);\n\nstatic u64 x2apichz;\n\nclass x2apic_lapic : public abstract_lapic\n{\npublic:\n  void cpu_init();\n  hwid_t id();\n  void eoi();\n  void send_ipi(struct cpu *c, int ino);\n  void mask_pc(bool mask);\n  void start_ap(struct cpu *c, u32 addr);\n  bool is_x2apic();\n  void dump();\n  void dumpall();\nprivate:\n  void clearintr();\n};\n\nstatic int\nx2apicmaxlvt(void)\n{\n  unsigned int v;\n\n  v = readmsr(VER);\n  return (((v) >> 16) & 0xFFu);\n}\n\nvoid\nx2apic_lapic::eoi()\n{\n  writemsr(EOI, 0);\n}\n\nstatic int\nx2apicwait(void)\n{\n  \/\/ Do nothing on x2apic\n  return 0;\n}\n\n\/\/ Code closely follows native_cpu_up, do_boot_cpu,\n\/\/ and wakeup_secondary_cpu_via_init in Linux v3.3\nvoid\nx2apic_lapic::start_ap(struct cpu *c, u32 addr)\n{\n  int i;\n\n  \/\/ Be paranoid about clearing APIC errors\n  writemsr(ESR, 0);\n  readmsr(ESR);\n  \n  unsigned long accept_status;\n  int maxlvt = x2apicmaxlvt();\n \n  if (maxlvt > 3)\n    writemsr(ESR, 0);\n  readmsr(ESR);\n\n  \/\/ \"Universal startup algorithm.\"\n  \/\/ Send INIT (level-triggered) interrupt to reset other CPU.\n  \/\/ Asserting INIT\n  writemsr(ICR, (((u64)c->hwid.num)<<32) | INIT | LEVEL | ASSERT);\n  microdelay(10000);\n  \/\/ Deasserting INIT\n  writemsr(ICR, (((u64)c->hwid.num)<<32) | INIT | LEVEL);\n  x2apicwait();\n\n  \/\/ Send startup IPI (twice!) to enter bootstrap code.\n  \/\/ Regular hardware is supposed to only accept a STARTUP\n  \/\/ when it is in the halted state due to an INIT.  So the second\n  \/\/ should be ignored, but it is part of the official Intel algorithm.\n  for(i = 0; i < 2; i++){\n    writemsr(ESR, 0);\n    readmsr(ESR);\n\n    \/\/ Kick the target chip\n    writemsr(ICR, (((u64)c->hwid.num)<<32) | STARTUP | (addr>>12));\n    \/\/ Linux gives 300 usecs to accept the IPI..\n    microdelay(300);\n    x2apicwait();\n    \/\/ ..then it gives some more time\n    microdelay(200);\n\n    if (maxlvt > 3)\n      writemsr(ESR, 0);\n\n    accept_status = (readmsr(ESR) & 0xEF);\n    if (accept_status)\n      panic(\"x2apicstartap: accept status %lx\", accept_status);\n  }\n}\n\nvoid\nx2apic_lapic::mask_pc(bool mask)\n{\n  writemsr(PCINT, mask ? MASKED : MT_NMI);\n}\n\nvoid\nx2apic_lapic::send_ipi(struct cpu *c, int ino)\n{\n  \/\/ Unlike other MSR writes, x2apic writes are NOT serializing and\n  \/\/ hence an IPI may be received before local writes become visible.\n  \/\/ Prevent this by first performing an mfence.\n  asm volatile(\"mfence\");\n  writemsr(ICR, (((u64)c->hwid.num)<<32) | FIXED | DEASSERT | ino);\n}\n\nhwid_t\nx2apic_lapic::id()\n{\n  u64 id = readmsr(ID);\n  return HWID((u32)id);\n}\n\nbool\nx2apic_lapic::is_x2apic()\n{\n  return true;\n}\n\nvoid\nx2apic_lapic::clearintr()\n{\n  \/\/ Clear any pending interrupts.  Linux does this.\n  unsigned int value, queued;\n  int i, j, acked = 0;\n  unsigned long long tsc = 0, ntsc;\n  long long max_loops = 2400000;\n\n  tsc = rdtsc();\n  do {\n    queued = 0;\n    for (i = ISR_NR - 1; i >= 0; i--)\n      queued |= readmsr(IRR + i*0x1);\n    \n    for (i = ISR_NR - 1; i >= 0; i--) {\n      value = readmsr(ISR + i*0x1);\n      for (j = 31; j >= 0; j--) {\n        if (value & (1<<j)) {\n          eoi();\n          acked++;\n        }\n      }\n    }\n    if (acked > 256) {\n      cprintf(\"x2apic pending interrupts after %d EOI\\n\",\n              acked);\n      break;\n    }\n    ntsc = rdtsc();\n    max_loops = (2400000 << 10) - (ntsc - tsc);\n  } while (queued && max_loops > 0);\n}\n\n\/\/ Code closely follows setup_local_APIC in Linux v3.3\nvoid\nx2apic_lapic::cpu_init()\n{\n  u64 count;\n  u32 value;\n  int maxlvt;\n\n  verbose.println(\"x2apic: Initializing LAPIC (CPU \", myid(), \")\");\n\n  \/\/ Enable performance counter overflow interrupts for sampler.cc\n  mask_pc(false);\n\n  \/\/ Enable interrupts on the APIC (but not on the processor).\n  value = readmsr(TPR);\n  value &= ~0xffU;\n  writemsr(TPR, value);\n\n  clearintr();\n\n  \/\/ Enable local APIC; set spurious interrupt vector.\n  value = readmsr(SVR);\n  value &= ~0x000FF;\n  value |= ENABLE;\n  value |= T_IRQ0 + IRQ_SPURIOUS;\n  writemsr(SVR, value);\n\n  writemsr(LINT0, MT_EXTINT | MASKED);\n  if (readmsr(ID) == 0)\n    writemsr(LINT1, MT_NMI);\n  else\n    writemsr(LINT1, MT_NMI | MASKED);\n\n  maxlvt = x2apicmaxlvt();\n  if (maxlvt > 3)\n    writemsr(ESR, 0);\n\n  \/\/ enables sending errors\n  value = T_IRQ0 + IRQ_ERROR;\n  writemsr(ERROR, value);\n\n  if (maxlvt > 3)\n    writemsr(ESR, 0);\n  readmsr(ESR);\n\n  \/\/ Send an Init Level De-Assert to synchronise arbitration ID's.\n  writemsr(ICR, BCAST | INIT | LEVEL);\n\n  if (x2apichz == 0) {\n    \/\/ Measure the TICR frequency\n    writemsr(TDCR, X1);    \n    writemsr(TICR, 0xffffffff); \n    u64 ccr0 = readmsr(TCCR);\n    microdelay(10 * 1000);    \/\/ 1\/100th of a second\n    u64 ccr1 = readmsr(TCCR);\n    x2apichz = 100 * (ccr0 - ccr1);\n  }\n\n  count = (QUANTUM*x2apichz) \/ 1000;\n  if (count > 0xffffffff)\n    panic(\"initx2apic: QUANTUM too large\");\n\n  \/\/ The timer repeatedly counts down at bus frequency\n  \/\/ from xapic[TICR] and then issues an interrupt.  \n  writemsr(TDCR, X1);\n  writemsr(TIMER, PERIODIC | (T_IRQ0 + IRQ_TIMER));\n  writemsr(TICR, count); \n\n  \/\/ Clear error status register (requires back-to-back writes).\n  writemsr(ESR, 0);\n  writemsr(ESR, 0);\n\n  \/\/ Ack any outstanding interrupts.\n  writemsr(EOI, 0);\n\n  return;\n}\n\nvoid\nx2apic_lapic::dump()\n{\n  bitset<256> isr, irr, tmr;\n  scoped_cli cli();\n  for (int word = 0; word < ISR_NR; ++word) {\n    isr.setword(word * 32, readmsr(ISR + word));\n    irr.setword(word * 32, readmsr(IRR + word));\n    tmr.setword(word * 32, readmsr(TMR + word));\n  }\n  if (isr.any() || irr.any() || tmr.any())\n    \/\/ Fixed-mode interrupt vectors that are awaiting EOI (ISR), that\n    \/\/ are pending delivery (IRR), and are level-triggered and will\n    \/\/ trigger an IOAPIC EOI when acknowledged (TMR).\n    console.println(\"LAPIC INT  ISR \", isr, \" IRR \", irr, \" TMR \", tmr);\n}\n\nvoid\nx2apic_lapic::dumpall()\n{\n  scoped_cli cli();\n  console.println(\"LAPIC CPU \", myid());\n#define SHOW(reg) console.println(\"  \" #reg \"\\t\", shex(readmsr(reg)).width(10).pad())\n  SHOW(ID);\n  SHOW(VER);\n  SHOW(TPR);\n  SHOW(PPR);\n  SHOW(LDR);\n  SHOW(SVR);\n  SHOW(ESR);\n  SHOW(ICR);\n  SHOW(TIMER);\n  SHOW(THERM);\n  SHOW(PCINT);\n  SHOW(LINT0);\n  SHOW(LINT1);\n  SHOW(ERROR);\n  SHOW(TICR);\n  SHOW(TCCR);\n  SHOW(TDCR);\n#undef SHOW\n}\n\nbool\ninitlapic_x2apic(void)\n{\n  u32 ecx;\n  cpuid(CPUID_FEATURES, nullptr, nullptr, &ecx, nullptr);\n  if (!(ecx & FEATURE_ECX_X2APIC))\n    return false;\n\n  \/\/ According to [Intel SDM 3A 10.12.8.1], if the BIOS initializes\n  \/\/ logical processors with APIC IDs greater than 255, then it should\n  \/\/ enable the x2APIC.\n  u64 apic_bar = readmsr(MSR_APIC_BAR);\n  if (!(apic_bar & APIC_BAR_X2APIC_EN) || !(apic_bar & APIC_BAR_XAPIC_EN))\n    return false;\n\n  verbose.println(\"x2apic: Using x2APIC LAPIC\");\n  static x2apic_lapic apic;\n  lapic = &apic;\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\r\n#include <string>\r\n#include <vector>\r\n#include <tuple>\r\n#include <sstream>\r\n#include <type_traits>\r\n#include <functional>\r\n#include <memory>\r\n#include <unordered_map>\r\n\r\nnamespace argparse {\r\n\r\nnamespace detail {\r\n    template <typename In, typename Out, bool pass = std::is_convertible<In, Out>::value>\r\n    struct lexical_cast_t;\r\n\r\n    template <typename In, typename Out>\r\n    struct lexical_cast_t<In, Out, true> {\r\n        static Out apply(In const& val) {\r\n            return static_cast<Out>(val);\r\n        }\r\n    };\r\n\r\n    template <typename In>\r\n    struct lexical_cast_t<In, std::string, false> {\r\n        static std::string apply(In const& val) {\r\n            std::ostringstream osstr;\r\n            osstr << val;\r\n            return osstr.str();\r\n        }\r\n    };\r\n\r\n    template <typename Out>\r\n    struct lexical_cast_t<std::string, Out, false> {\r\n        static Out apply(std::string const& val) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n\r\n    template <typename Out, std::size_t N>\r\n    struct lexical_cast_t<char[N], Out, false> {\r\n        static Out apply(char const (&val)[N]) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n\r\n    template <typename Out, std::size_t N>\r\n    struct lexical_cast_t<char const[N], Out, false> {\r\n        static Out apply(char const (&val)[N]) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n} \/\/ namespace detail;\r\n\r\ntemplate <typename Out, typename In>\r\ninline Out lexical_cast(In const& val) {\r\n    return detail::lexical_cast_t<In, Out>::apply(val);\r\n}\r\n\r\n\/\/\r\n\r\nstruct argument_base {\r\n   virtual void assign(std::string const& src) = 0;\r\n   virtual void store_true() = 0;\r\n   virtual bool with_value() const = 0;\r\n\r\n   argument_base(std::string const& name, char short_name,\r\n                 std::string const& help)\r\n     : name_{name}, short_name_{short_name}, help_{help}\r\n  {\r\n  }\r\n\r\n   std::string const& name() const { return name_; }\r\n   char short_name() const { return short_name_; }\r\n\r\nprivate:\r\n   std::string name_;\r\n   char short_name_;\r\n   std::string help_;\r\n};\r\n\r\ntemplate <typename T>\r\nstruct argument_with_value : public argument_base {\r\n   using arg_type = T;\r\n\r\n   argument_with_value(std::string const& name, char short_name,\r\n                       std::string const& help)\r\n      : argument_base{name, short_name, help}\r\n   {\r\n   }\r\n\r\n   void assign(std::string const& src) override {\r\n      val_.reset(new T(lexical_cast<T>(src)));\r\n   }\r\n\r\n   void store_true() override { \/* do nothing. *\/ }\r\n   bool with_value() const override { return true; }\r\n\r\nprivate:\r\n   std::unique_ptr<T> val_;\r\n};\r\n\r\nstruct argument_flag : public argument_base {\r\n   using arg_type = bool;\r\n\r\n   argument_flag(std::string const& name, char short_name,\r\n            std::string const& help)\r\n      : argument_base{ name, short_name, help }\r\n   {\r\n   }\r\n\r\n   void assign(std::string const&) override { \/* do nothing. *\/ }\r\n   void store_true() override { val_ = true; }\r\n   bool with_value() const override { return false; }\r\n\r\nprivate:\r\n   bool val_ = false;\r\n};\r\n\r\n\r\ntemplate <typename T>\r\ninline argument_with_value<T> arg(std::string const& name, char short_name = '\\0',\r\n                                  std::string const& help = \"\")\r\n{\r\n   return argument_with_value<T>{ name, short_name, help };\r\n}\r\n\r\ntemplate <typename T>\r\ninline argument_with_value<T> arg(std::string const& name, std::string const& help)\r\n{\r\n   return argument_with_value<T>{ name, '\\0', help };\r\n}\r\n\r\ninline argument_flag flag(std::string const& name, char short_name = '\\0',\r\n                          std::string const& help = \"\")\r\n{\r\n   return argument_flag{ name, short_name, help };\r\n}\r\n\r\ninline argument_flag flag(std::string const& name, std::string const& help)\r\n{\r\n   return argument_flag{ name, '\\0', help };\r\n}\r\n\r\ntemplate <std::size_t... Idx>\r\nstruct index_sequence {\r\n   using next = index_sequence<Idx..., sizeof...(Idx)>;\r\n};\r\n\r\ntemplate <std::size_t Nt, std::size_t N>\r\nstruct iota {\r\n   using type = typename iota<Nt-1, N-1>::type::next;\r\n};\r\n\r\ntemplate <std::size_t Nt>\r\nstruct iota<Nt, 0> {\r\n   using type = index_sequence<>;\r\n};\r\n\r\ntemplate <std::size_t N>\r\nusing make_index_sequence = typename iota<N, N>::type;\r\n\r\ntemplate <typename... T> inline void dummy(T...) {}\r\n\r\n\r\ntemplate <typename... Args>\r\nstruct parser\r\n{\r\n   using args_type = std::tuple<typename Args::arg_type...>;\r\n\r\n   parser(Args&&... args)\r\n      : args_{ std::forward<Args>(args)... }\r\n   {\r\n      make_lookup_tables(args_, make_index_sequence<sizeof...(Args)>());\r\n   }\r\n\r\n   template <typename Tuple, std::size_t... Idx>\r\n   void make_lookup_tables(Tuple& args, index_sequence<Idx...>) {\r\n      dummy( append_to_lookup_table(std::get<Idx>(args))... );\r\n   }\r\n\r\n   template <typename Arg>\r\n   int append_to_lookup_table(Arg& arg) {\r\n      std::string const& name = arg.name();\r\n      lookup_.insert({ name, static_cast<argument_base&>(arg) });\r\n\r\n      char s = arg.short_name();\r\n      if (s != '\\0')\r\n         short_lookup_.insert({ s, static_cast<argument_base&>(arg) });\r\n\r\n      return 0;\r\n   }\r\n\r\n   void parse(std::vector<std::string> const& args) {\r\n      if (args.empty())\r\n         throw std::runtime_error(\"argument must be at least one item(s).\");\r\n\r\n      progname_ = args[0];\r\n\r\n      for (auto it = args.begin(); it != args.end(); ++it)\r\n      {\r\n         auto& arg = *it;\r\n         if (arg.substr(0,2)==\"--\") { \/\/ long option\r\n            std::string::size_type pos = arg.find('=',2);\r\n            if (pos==std::string::npos) {\r\n               std::string key = arg.substr(2);\r\n               if (lookup_.count(key) == 0)\r\n                  throw std::runtime_error(\"unknown option: --\" + key);\r\n               argument_base& a = lookup_.at(key).get();\r\n               if (a.with_value()) {\r\n                  \/\/ read next argument\r\n                  ++it;\r\n                  std::string val = *it;\r\n                  a.assign(val);\r\n               }\r\n               else {\r\n                  a.store_true();\r\n               }\r\n            }\r\n            else {\r\n               std::string key = arg.substr(2, pos);\r\n               std::string val = arg.substr(pos+1);\r\n               argument_base& a = lookup_.at(key).get();\r\n               if (a.with_value()) {\r\n                  a.assign(val);\r\n               }\r\n               else {\r\n                  a.store_true();\r\n               }\r\n            }\r\n         }\r\n         else if (arg[0] == '-') { \/\/ short option\r\n            if (arg.length() < 2) continue;\r\n            char s = arg[1];\r\n            if (short_lookup_.count(s) == 0)\r\n               throw std::runtime_error(std::string(\"unknown short option: -\") + s);\r\n            argument_base& a = short_lookup_.at(s).get();\r\n            if (a.with_value()) {\r\n               ++it;\r\n               std::string val = *it;\r\n               a.assign(val);\r\n            } else {\r\n               a.store_true();\r\n            }\r\n         }\r\n         else { \/\/ normal argument\r\n            remains_.push_back(arg);\r\n         }\r\n      }\r\n   }\r\n\r\n   std::string const& progname() const { return progname_; }\r\n   args_type const& options() const { return options_; }\r\n   std::vector<std::string> const& remains() const { return remains_; }\r\n\r\nprivate:\r\n   std::tuple<Args...> args_;\r\n   std::unordered_map<std::string, std::reference_wrapper<argument_base>> lookup_;\r\n   std::unordered_map<char,        std::reference_wrapper<argument_base>> short_lookup_;\r\n\r\n   std::string progname_;\r\n   args_type options_;\r\n   std::vector<std::string> remains_;\r\n};\r\n\r\ntemplate <typename... Args>\r\nparser<Args...> make_parser(Args&&... args) {\r\n   return parser<Args...>{ std::forward<Args>(args)... };\r\n}\r\n\r\n} \/\/ namespace argparse;\r\n<commit_msg>implemention is done<commit_after>#pragma once\r\n\r\n#include <string>\r\n#include <vector>\r\n#include <tuple>\r\n#include <sstream>\r\n#include <type_traits>\r\n#include <functional>\r\n#include <memory>\r\n#include <unordered_map>\r\n\r\nnamespace argparse {\r\n\r\nnamespace detail {\r\n    template <typename In, typename Out, bool pass = std::is_convertible<In, Out>::value>\r\n    struct lexical_cast_t;\r\n\r\n    template <typename In, typename Out>\r\n    struct lexical_cast_t<In, Out, true> {\r\n        static Out apply(In const& val) {\r\n            return static_cast<Out>(val);\r\n        }\r\n    };\r\n\r\n    template <typename In>\r\n    struct lexical_cast_t<In, std::string, false> {\r\n        static std::string apply(In const& val) {\r\n            std::ostringstream osstr;\r\n            osstr << val;\r\n            return osstr.str();\r\n        }\r\n    };\r\n\r\n    template <typename Out>\r\n    struct lexical_cast_t<std::string, Out, false> {\r\n        static Out apply(std::string const& val) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n\r\n    template <typename Out, std::size_t N>\r\n    struct lexical_cast_t<char[N], Out, false> {\r\n        static Out apply(char const (&val)[N]) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n\r\n    template <typename Out, std::size_t N>\r\n    struct lexical_cast_t<char const[N], Out, false> {\r\n        static Out apply(char const (&val)[N]) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n} \/\/ namespace detail;\r\n\r\ntemplate <typename Out, typename In>\r\ninline Out lexical_cast(In const& val) {\r\n    return detail::lexical_cast_t<In, Out>::apply(val);\r\n}\r\n\r\n\/\/\r\n\r\nstruct argument_base {\r\n   virtual void assign(std::string const& src) = 0;\r\n   virtual void store_true() = 0;\r\n   virtual bool with_value() const = 0;\r\n\r\n   argument_base(std::string const& name, char short_name,\r\n                 std::string const& help)\r\n     : name_{name}, short_name_{short_name}, help_{help}\r\n  {\r\n  }\r\n\r\n   std::string const& name() const { return name_; }\r\n   char short_name() const { return short_name_; }\r\n\r\nprivate:\r\n   std::string name_;\r\n   char short_name_;\r\n   std::string help_;\r\n};\r\n\r\ntemplate <typename T>\r\nstruct argument_with_value : public argument_base {\r\n   using arg_type = T;\r\n\r\n   argument_with_value(std::string const& name, char short_name,\r\n                       std::string const& help)\r\n      : argument_base{name, short_name, help}\r\n   {\r\n   }\r\n\r\n   void assign(std::string const& src) override {\r\n      val_.reset(new T(lexical_cast<T>(src)));\r\n   }\r\n\r\n   void store_true() override { \/* do nothing. *\/ }\r\n   bool with_value() const override { return true; }\r\n\r\n   T const& get() const {\r\n      if (val_) {\r\n         return *val_;\r\n      }\r\n      else {\r\n         throw std::runtime_error(\"not initialized\");\r\n      }\r\n   }\r\n\r\nprivate:\r\n   std::unique_ptr<T> val_;\r\n};\r\n\r\nstruct argument_flag : public argument_base {\r\n   using arg_type = bool;\r\n\r\n   argument_flag(std::string const& name, char short_name,\r\n            std::string const& help)\r\n      : argument_base{ name, short_name, help }\r\n   {\r\n   }\r\n\r\n   void assign(std::string const&) override { \/* do nothing. *\/ }\r\n   void store_true() override { val_ = true; }\r\n   bool with_value() const override { return false; }\r\n\r\n   bool get() const { return val_; }\r\n\r\nprivate:\r\n   bool val_ = false;\r\n};\r\n\r\n\r\ntemplate <typename T>\r\ninline argument_with_value<T> arg(std::string const& name, char short_name = '\\0',\r\n                                  std::string const& help = \"\")\r\n{\r\n   return argument_with_value<T>{ name, short_name, help };\r\n}\r\n\r\ntemplate <typename T>\r\ninline argument_with_value<T> arg(std::string const& name, std::string const& help)\r\n{\r\n   return argument_with_value<T>{ name, '\\0', help };\r\n}\r\n\r\ninline argument_flag flag(std::string const& name, char short_name = '\\0',\r\n                          std::string const& help = \"\")\r\n{\r\n   return argument_flag{ name, short_name, help };\r\n}\r\n\r\ninline argument_flag flag(std::string const& name, std::string const& help)\r\n{\r\n   return argument_flag{ name, '\\0', help };\r\n}\r\n\r\ntemplate <std::size_t... Idx>\r\nstruct index_sequence {\r\n   using next = index_sequence<Idx..., sizeof...(Idx)>;\r\n};\r\n\r\ntemplate <std::size_t Nt, std::size_t N>\r\nstruct iota {\r\n   using type = typename iota<Nt-1, N-1>::type::next;\r\n};\r\n\r\ntemplate <std::size_t Nt>\r\nstruct iota<Nt, 0> {\r\n   using type = index_sequence<>;\r\n};\r\n\r\ntemplate <std::size_t N>\r\nusing make_index_sequence = typename iota<N, N>::type;\r\n\r\ntemplate <typename... T> inline void dummy(T...) {}\r\n\r\n\r\ntemplate <typename... Args>\r\nstruct parser\r\n{\r\n   using args_type = std::tuple<typename Args::arg_type...>;\r\n\r\n   parser(Args&&... args)\r\n      : args_{ std::forward<Args>(args)... }\r\n   {\r\n      make_lookup_tables(args_, make_index_sequence<sizeof...(Args)>());\r\n   }\r\n\r\n   template <typename Tuple, std::size_t... Idx>\r\n   void make_lookup_tables(Tuple& args, index_sequence<Idx...>) {\r\n      dummy( append_to_lookup_table(std::get<Idx>(args))... );\r\n   }\r\n\r\n   template <typename Arg>\r\n   int append_to_lookup_table(Arg& arg) {\r\n      std::string const& name = arg.name();\r\n      lookup_.insert({ name, static_cast<argument_base&>(arg) });\r\n\r\n      char s = arg.short_name();\r\n      if (s != '\\0')\r\n         short_lookup_.insert({ s, static_cast<argument_base&>(arg) });\r\n\r\n      return 0;\r\n   }\r\n\r\n   void parse(std::vector<std::string> const& args) {\r\n      if (args.empty())\r\n         throw std::runtime_error(\"argument must be at least one item(s).\");\r\n\r\n      progname_ = args[0];\r\n\r\n      for (auto it = args.begin()+1; it != args.end(); ++it)\r\n      {\r\n         auto& arg = *it;\r\n         if (arg.substr(0,2)==\"--\") { \/\/ long option\r\n            std::string::size_type pos = arg.find('=',2);\r\n            if (pos==std::string::npos) {\r\n               std::string key = arg.substr(2);\r\n               if (lookup_.count(key) == 0)\r\n                  throw std::runtime_error(\"unknown option: --\" + key);\r\n               argument_base& a = lookup_.at(key).get();\r\n               if (a.with_value()) {\r\n                  \/\/ read next argument\r\n                  ++it;\r\n                  std::string val = *it;\r\n                  a.assign(val);\r\n               }\r\n               else {\r\n                  a.store_true();\r\n               }\r\n            }\r\n            else {\r\n               std::string key = arg.substr(2, pos);\r\n               std::string val = arg.substr(pos+1);\r\n               argument_base& a = lookup_.at(key).get();\r\n               if (a.with_value()) {\r\n                  a.assign(val);\r\n               }\r\n               else {\r\n                  a.store_true();\r\n               }\r\n            }\r\n         }\r\n         else if (arg[0] == '-') { \/\/ short option\r\n            if (arg.length() < 2) continue;\r\n            char s = arg[1];\r\n            if (short_lookup_.count(s) == 0)\r\n               throw std::runtime_error(std::string(\"unknown short option: -\") + s);\r\n            argument_base& a = short_lookup_.at(s).get();\r\n            if (a.with_value()) {\r\n               ++it;\r\n               std::string val = *it;\r\n               a.assign(val);\r\n            } else {\r\n               a.store_true();\r\n            }\r\n         }\r\n         else { \/\/ normal argument\r\n            remains_.push_back(arg);\r\n         }\r\n      }\r\n\r\n      get_values(make_index_sequence<std::tuple_size<args_type>::value>());\r\n   }\r\n\r\n   template <size_t... Idx>\r\n   void get_values(index_sequence<Idx...>)\r\n   {\r\n      dummy(get_value(std::get<Idx>(options_), std::get<Idx>(args_))...);\r\n   }\r\n\r\n   template <typename Opt, typename Arg>\r\n   int get_value(Opt& opt, Arg& arg) {\r\n      opt = arg.get();\r\n      return 0;\r\n   }\r\n\r\n   std::string const& progname() const { return progname_; }\r\n   args_type const& options() const { return options_; }\r\n   std::vector<std::string> const& remains() const { return remains_; }\r\n\r\nprivate:\r\n   std::tuple<Args...> args_;\r\n   std::unordered_map<std::string, std::reference_wrapper<argument_base>> lookup_;\r\n   std::unordered_map<char,        std::reference_wrapper<argument_base>> short_lookup_;\r\n\r\n   std::string progname_;\r\n   args_type options_;\r\n   std::vector<std::string> remains_;\r\n};\r\n\r\ntemplate <typename... Args>\r\nparser<Args...> make_parser(Args&&... args) {\r\n   return parser<Args...>{ std::forward<Args>(args)... };\r\n}\r\n\r\n} \/\/ namespace argparse;\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_DBC.hpp>\n\n#include <Kokkos_View.hpp>\n\n#include <fstream>\n#include <random>\n\nenum PointCloudType { filled_box, hollow_box, filled_sphere, hollow_sphere };\n\ntemplate <typename Layout, typename DeviceType>\nvoid writePointCloud(\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points,\n    std::string const &filename )\n\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::ofstream file( filename );\n    if ( file.is_open() )\n    {\n        unsigned int const n = random_points.extent( 0 );\n        for ( unsigned int i = 0; i < n; ++i )\n            file << random_points( i )[0] << \" \" << random_points( i )[1] << \" \"\n                 << random_points( i )[2] << \"\\n\";\n        file.close();\n    }\n}\n\ntemplate <typename Layout, typename DeviceType>\nvoid filledBoxCloud(\n    double const half_edge,\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points )\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::uniform_real_distribution<double> distribution( -half_edge,\n                                                         half_edge );\n    std::default_random_engine generator;\n    auto random = [&distribution, &generator]() {\n        return distribution( generator );\n    };\n    unsigned int const n = random_points.extent( 0 );\n    for ( unsigned int i = 0; i < n; ++i )\n        random_points( i ) = {{random(), random(), random()}};\n}\n\ntemplate <typename Layout, typename DeviceType>\nvoid hollowBoxCloud(\n    double const half_edge,\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points )\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::uniform_real_distribution<double> distribution( -half_edge,\n                                                         half_edge );\n    std::default_random_engine generator;\n    auto random = [&distribution, &generator]() {\n        return distribution( generator );\n    };\n    unsigned int const n = random_points.extent( 0 );\n    for ( unsigned int i = 0; i < n; ++i )\n    {\n        unsigned int face = i % 6;\n        switch ( face )\n        {\n        case 0:\n        {\n            random_points( i ) = {{-half_edge, random(), random()}};\n\n            break;\n        }\n        case 1:\n        {\n            random_points( i ) = {{half_edge, random(), random()}};\n\n            break;\n        }\n        case 2:\n        {\n            random_points( i ) = {{random(), -half_edge, random()}};\n\n            break;\n        }\n        case 3:\n        {\n            random_points( i ) = {{random(), half_edge, random()}};\n\n            break;\n        }\n        case 4:\n        {\n            random_points( i ) = {{random(), random(), -half_edge}};\n\n            break;\n        }\n        case 5:\n        {\n            random_points( i ) = {{random(), random(), half_edge}};\n\n            break;\n        }\n        default:\n        {\n            throw std::runtime_error( \"Your compiler is broken\" );\n        }\n        }\n    }\n}\n\ntemplate <typename Layout, typename DeviceType>\nvoid filledSphereCloud(\n    double const radius,\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points )\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::default_random_engine generator;\n\n    std::uniform_real_distribution<double> distribution( -radius, radius );\n    auto random = [&distribution, &generator]() {\n        return distribution( generator );\n    };\n\n    unsigned int const n = random_points.extent( 0 );\n    for ( unsigned int i = 0; i < n; ++i )\n    {\n        bool point_accepted = false;\n        while ( !point_accepted )\n        {\n            double const x = random();\n            double const y = random();\n            double const z = random();\n\n            \/\/ Only accept points that are in the sphere\n            if ( std::sqrt( x * x + y * y + z * z ) <= radius )\n            {\n                random_points( i ) = {{x, y, z}};\n                point_accepted = true;\n            }\n        }\n    }\n}\n\ntemplate <typename Layout, typename DeviceType>\nvoid hollowSphereCloud(\n    double const radius,\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points )\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::default_random_engine generator;\n\n    std::uniform_real_distribution<double> distribution( -1., 1. );\n    auto random = [&distribution, &generator]() {\n        return distribution( generator );\n    };\n\n    unsigned int const n = random_points.extent( 0 );\n    for ( unsigned int i = 0; i < n; ++i )\n    {\n        double const x = random();\n        double const y = random();\n        double const z = random();\n        double const norm = std::sqrt( x * x + y * y + z * z );\n\n        random_points( i ) = {\n            {radius * x \/ norm, radius * y \/ norm, radius * z \/ norm}};\n    }\n}\n\ntemplate <typename DeviceType>\nvoid generatePointCloud(\n    PointCloudType const point_cloud_type, double const length,\n    Kokkos::View<DataTransferKit::Point *, DeviceType> random_points )\n{\n    auto random_points_host = Kokkos::create_mirror_view( random_points );\n    if ( point_cloud_type == PointCloudType::filled_box )\n    {\n        filledBoxCloud( length, random_points_host );\n    }\n    else if ( point_cloud_type == PointCloudType::hollow_box )\n    {\n        hollowBoxCloud( length, random_points_host );\n    }\n    else if ( point_cloud_type == PointCloudType::filled_sphere )\n    {\n        filledSphereCloud( length, random_points_host );\n    }\n    else if ( point_cloud_type == PointCloudType::hollow_sphere )\n    {\n        hollowSphereCloud( length, random_points_host );\n    }\n    else\n    {\n        throw DataTransferKit::DataTransferKitNotImplementedException();\n    }\n    Kokkos::deep_copy( random_points, random_points_host );\n}\n<commit_msg>Load point cloud from a file<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_DBC.hpp>\n\n#include <Kokkos_View.hpp>\n\n#include <fstream>\n#include <random>\n\nenum PointCloudType { filled_box, hollow_box, filled_sphere, hollow_sphere };\n\ntemplate <typename Layout, typename DeviceType>\nvoid writePointCloud(\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points,\n    std::string const &filename )\n\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::ofstream file( filename );\n    if ( file.is_open() )\n    {\n        unsigned int const n = random_points.extent( 0 );\n        for ( unsigned int i = 0; i < n; ++i )\n            file << random_points( i )[0] << \" \" << random_points( i )[1] << \" \"\n                 << random_points( i )[2] << \"\\n\";\n        file.close();\n    }\n}\n\ntemplate <typename Layout, typename DeviceType>\nvoid filledBoxCloud(\n    double const half_edge,\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points )\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::uniform_real_distribution<double> distribution( -half_edge,\n                                                         half_edge );\n    std::default_random_engine generator;\n    auto random = [&distribution, &generator]() {\n        return distribution( generator );\n    };\n    unsigned int const n = random_points.extent( 0 );\n    for ( unsigned int i = 0; i < n; ++i )\n        random_points( i ) = {{random(), random(), random()}};\n}\n\ntemplate <typename Layout, typename DeviceType>\nvoid hollowBoxCloud(\n    double const half_edge,\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points )\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::uniform_real_distribution<double> distribution( -half_edge,\n                                                         half_edge );\n    std::default_random_engine generator;\n    auto random = [&distribution, &generator]() {\n        return distribution( generator );\n    };\n    unsigned int const n = random_points.extent( 0 );\n    for ( unsigned int i = 0; i < n; ++i )\n    {\n        unsigned int face = i % 6;\n        switch ( face )\n        {\n        case 0:\n        {\n            random_points( i ) = {{-half_edge, random(), random()}};\n\n            break;\n        }\n        case 1:\n        {\n            random_points( i ) = {{half_edge, random(), random()}};\n\n            break;\n        }\n        case 2:\n        {\n            random_points( i ) = {{random(), -half_edge, random()}};\n\n            break;\n        }\n        case 3:\n        {\n            random_points( i ) = {{random(), half_edge, random()}};\n\n            break;\n        }\n        case 4:\n        {\n            random_points( i ) = {{random(), random(), -half_edge}};\n\n            break;\n        }\n        case 5:\n        {\n            random_points( i ) = {{random(), random(), half_edge}};\n\n            break;\n        }\n        default:\n        {\n            throw std::runtime_error( \"Your compiler is broken\" );\n        }\n        }\n    }\n}\n\ntemplate <typename Layout, typename DeviceType>\nvoid filledSphereCloud(\n    double const radius,\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points )\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::default_random_engine generator;\n\n    std::uniform_real_distribution<double> distribution( -radius, radius );\n    auto random = [&distribution, &generator]() {\n        return distribution( generator );\n    };\n\n    unsigned int const n = random_points.extent( 0 );\n    for ( unsigned int i = 0; i < n; ++i )\n    {\n        bool point_accepted = false;\n        while ( !point_accepted )\n        {\n            double const x = random();\n            double const y = random();\n            double const z = random();\n\n            \/\/ Only accept points that are in the sphere\n            if ( std::sqrt( x * x + y * y + z * z ) <= radius )\n            {\n                random_points( i ) = {{x, y, z}};\n                point_accepted = true;\n            }\n        }\n    }\n}\n\ntemplate <typename Layout, typename DeviceType>\nvoid hollowSphereCloud(\n    double const radius,\n    Kokkos::View<DataTransferKit::Point *, Layout, DeviceType> random_points )\n{\n    static_assert(\n        Kokkos::Impl::MemorySpaceAccess<\n            Kokkos::HostSpace, typename DeviceType::memory_space>::accessible,\n        \"The View should be accessible on the Host\" );\n    std::default_random_engine generator;\n\n    std::uniform_real_distribution<double> distribution( -1., 1. );\n    auto random = [&distribution, &generator]() {\n        return distribution( generator );\n    };\n\n    unsigned int const n = random_points.extent( 0 );\n    for ( unsigned int i = 0; i < n; ++i )\n    {\n        double const x = random();\n        double const y = random();\n        double const z = random();\n        double const norm = std::sqrt( x * x + y * y + z * z );\n\n        random_points( i ) = {\n            {radius * x \/ norm, radius * y \/ norm, radius * z \/ norm}};\n    }\n}\n\ntemplate <typename DeviceType>\nvoid generatePointCloud(\n    PointCloudType const point_cloud_type, double const length,\n    Kokkos::View<DataTransferKit::Point *, DeviceType> random_points )\n{\n    auto random_points_host = Kokkos::create_mirror_view( random_points );\n    if ( point_cloud_type == PointCloudType::filled_box )\n    {\n        filledBoxCloud( length, random_points_host );\n    }\n    else if ( point_cloud_type == PointCloudType::hollow_box )\n    {\n        hollowBoxCloud( length, random_points_host );\n    }\n    else if ( point_cloud_type == PointCloudType::filled_sphere )\n    {\n        filledSphereCloud( length, random_points_host );\n    }\n    else if ( point_cloud_type == PointCloudType::hollow_sphere )\n    {\n        hollowSphereCloud( length, random_points_host );\n    }\n    else\n    {\n        throw DataTransferKit::DataTransferKitNotImplementedException();\n    }\n    Kokkos::deep_copy( random_points, random_points_host );\n}\n\ntemplate <typename DeviceType>\nvoid loadPointCloud(\n    std::string const &filename,\n    Kokkos::View<DataTransferKit::Point *, DeviceType> &random_points )\n{\n    std::ifstream file( filename );\n    if ( file.is_open() )\n    {\n        int size = -1;\n        file >> size;\n        DTK_REQUIRE( size > 0 );\n        Kokkos::realloc( random_points, size );\n        auto random_points_host = Kokkos::create_mirror_view( random_points );\n        for ( int i = 0; i < size; ++i )\n            for ( int j = 0; j < 3; ++j )\n                file >> random_points( i )[j];\n        Kokkos::deep_copy( random_points, random_points_host );\n    }\n    else\n    {\n        throw std::runtime_error( \"Cannot open file\" );\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Auto away-presence setter-class\n    Copyright (C) 2011  Martin Klapetek <martin.klapetek@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.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 \"autoaway.h\"\n\n#include <TelepathyQt4\/AccountManager>\n#include <TelepathyQt4\/AccountSet>\n\n#include <KDebug>\n#include <KIdleTime>\n#include <KConfig>\n#include <KConfigGroup>\n\nAutoAway::AutoAway(const Tp::AccountManagerPtr& am, QObject* parent)\n    : QObject(parent),\n      m_awayTimeoutId(-1),\n      m_extAwayTimeoutId(-1)\n{\n    readConfig();\n    m_accountManager = am;\n    m_prevPresence = Tp::Presence::available();\n\n    connect(KIdleTime::instance(), SIGNAL(timeoutReached(int)),\n            this, SLOT(timeoutReached(int)));\n\n    connect(KIdleTime::instance(), SIGNAL(resumingFromIdle()),\n            this, SLOT(backFromIdle()));\n}\n\nAutoAway::~AutoAway()\n{\n}\n\nvoid AutoAway::timeoutReached(int id)\n{\n    KIdleTime::instance()->catchNextResumeEvent();\n    if (id == m_awayTimeoutId) {\n        if (!m_accountManager->onlineAccounts()->accounts().isEmpty()) {\n            if (m_accountManager->onlineAccounts()->accounts().first()->currentPresence().type() != Tp::Presence::away().type() ||\n                m_accountManager->onlineAccounts()->accounts().first()->currentPresence().type() != Tp::Presence::xa().type() ||\n                m_accountManager->onlineAccounts()->accounts().first()->currentPresence().type() != Tp::Presence::hidden().type()) {\n\n                m_prevPresence = m_accountManager->onlineAccounts()->accounts().first()->currentPresence();\n                emit setPresence(Tp::Presence::away());\n\n            }\n        } else if (id == m_extAwayTimeoutId) {\n            if (!m_accountManager->onlineAccounts()->accounts().isEmpty()) {\n                if (m_accountManager->onlineAccounts()->accounts().first()->currentPresence().type() == Tp::Presence::away().type()) {\n                    emit setPresence(Tp::Presence::xa());\n                }\n            }\n        }\n    }\n}\n\nvoid AutoAway::backFromIdle()\n{\n    kDebug();\n    emit setPresence(m_prevPresence);\n}\n\nvoid AutoAway::readConfig()\n{\n    KSharedConfigPtr config = KSharedConfig::openConfig(QLatin1String(\"ktelepathyrc\"));\n    KConfigGroup kdedConfig = config->group(\"KDED\");\n\n    bool autoAwayEnabled = kdedConfig.readEntry(\"autoAwayEnabled\", true);\n    bool autoXAEnabled = kdedConfig.readEntry(\"autoXAEnabled\", true);\n\n    if (autoAwayEnabled) {\n        int awayTime = kdedConfig.readEntry(\"awayAfter\", 5);\n        m_awayTimeoutId = KIdleTime::instance()->addIdleTimeout(awayTime * 60 * 1000);\n    } else if (!autoAwayEnabled && m_awayTimeoutId != -1) {\n        KIdleTime::instance()->removeAllIdleTimeouts();\n    }\n    if (autoAwayEnabled && autoXAEnabled) {\n        int xaTime = kdedConfig.readEntry(\"xaAfter\", 15);\n        m_extAwayTimeoutId = KIdleTime::instance()->addIdleTimeout(xaTime * 60 * 1000);\n    }\n}\n\nvoid AutoAway::onSettingsChanged()\n{\n    readConfig();\n}\n<commit_msg>Prevent multiple timeouts being added on each config change<commit_after>\/*\n    Auto away-presence setter-class\n    Copyright (C) 2011  Martin Klapetek <martin.klapetek@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.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 \"autoaway.h\"\n\n#include <TelepathyQt4\/AccountManager>\n#include <TelepathyQt4\/AccountSet>\n\n#include <KDebug>\n#include <KIdleTime>\n#include <KConfig>\n#include <KConfigGroup>\n\nAutoAway::AutoAway(const Tp::AccountManagerPtr& am, QObject* parent)\n    : QObject(parent),\n      m_awayTimeoutId(-1),\n      m_extAwayTimeoutId(-1)\n{\n    readConfig();\n    m_accountManager = am;\n    m_prevPresence = Tp::Presence::available();\n\n    connect(KIdleTime::instance(), SIGNAL(timeoutReached(int)),\n            this, SLOT(timeoutReached(int)));\n\n    connect(KIdleTime::instance(), SIGNAL(resumingFromIdle()),\n            this, SLOT(backFromIdle()));\n}\n\nAutoAway::~AutoAway()\n{\n}\n\nvoid AutoAway::timeoutReached(int id)\n{\n    KIdleTime::instance()->catchNextResumeEvent();\n    if (id == m_awayTimeoutId) {\n        if (!m_accountManager->onlineAccounts()->accounts().isEmpty()) {\n            if (m_accountManager->onlineAccounts()->accounts().first()->currentPresence().type() != Tp::Presence::away().type() ||\n                m_accountManager->onlineAccounts()->accounts().first()->currentPresence().type() != Tp::Presence::xa().type() ||\n                m_accountManager->onlineAccounts()->accounts().first()->currentPresence().type() != Tp::Presence::hidden().type()) {\n\n                m_prevPresence = m_accountManager->onlineAccounts()->accounts().first()->currentPresence();\n                emit setPresence(Tp::Presence::away());\n\n            }\n        } else if (id == m_extAwayTimeoutId) {\n            if (!m_accountManager->onlineAccounts()->accounts().isEmpty()) {\n                if (m_accountManager->onlineAccounts()->accounts().first()->currentPresence().type() == Tp::Presence::away().type()) {\n                    emit setPresence(Tp::Presence::xa());\n                }\n            }\n        }\n    }\n}\n\nvoid AutoAway::backFromIdle()\n{\n    kDebug();\n    emit setPresence(m_prevPresence);\n}\n\nvoid AutoAway::readConfig()\n{\n    KSharedConfigPtr config = KSharedConfig::openConfig(QLatin1String(\"ktelepathyrc\"));\n    KConfigGroup kdedConfig = config->group(\"KDED\");\n\n    bool autoAwayEnabled = kdedConfig.readEntry(\"autoAwayEnabled\", true);\n    bool autoXAEnabled = kdedConfig.readEntry(\"autoXAEnabled\", true);\n\n    \/\/remove all our timeouts and only readd them if auto-away is enabled\n    \/\/WARNING: can't use removeAllTimeouts because this runs inside KDED, it would remove other KDED timeouts as well\n    KIdleTime::instance()->removeIdleTimeout(m_awayTimeoutId);\n    KIdleTime::instance()->removeIdleTimeout(m_extAwayTimeoutId);\n\n    if (autoAwayEnabled) {\n        int awayTime = kdedConfig.readEntry(\"awayAfter\", 5);\n        m_awayTimeoutId = KIdleTime::instance()->addIdleTimeout(awayTime * 60 * 1000);\n    }\n    if (autoAwayEnabled && autoXAEnabled) {\n        int xaTime = kdedConfig.readEntry(\"xaAfter\", 15);\n        m_extAwayTimeoutId = KIdleTime::instance()->addIdleTimeout(xaTime * 60 * 1000);\n    }\n}\n\nvoid AutoAway::onSettingsChanged()\n{\n    readConfig();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file    extract_keywords_for_translation.cc\n *  \\brief   A tool for extracting keywords that need to be translated.  The keywords and any possibly pre-existing\n *           translations will be stored in a 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 <unordered_set>\n#include <utility>\n#include <vector>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"DirectoryEntry.h\"\n#include \"IniFile.h\"\n#include \"Leader.h\"\n#include \"MarcUtil.h\"\n#include \"StringUtil.h\"\n#include \"Subfields.h\"\n#include \"TranslationUtil.h\"\n#include \"util.h\"\n\n\nvoid Usage() {\n    std::cerr << \"Usage: \" << progname << \" title_input norm_data_input\\n\";\n    std::exit(EXIT_FAILURE);\n}\n\n\nstatic std::unordered_set<std::string> *shared_norm_data_control_numbers;\n\n\nbool RecordKeywordControlNumbers(MarcUtil::Record * const record, XmlWriter * const \/*xml_writer*\/,\n\t\t\t\t std::string * const \/* err_msg *\/)\n{\n    std::vector<std::string> keyword_tags;\n    StringUtil::Split(\"600:610:611:630:650:653:656\", ':', &keyword_tags);\n    const std::vector<std::string> &fields(record->getFields());\n    const std::vector<DirectoryEntry> &dir_entries(record->getDirEntries());\n    for (const auto &keyword_tag : keyword_tags) {\n\tconst ssize_t start_index(record->getFieldIndex(keyword_tag));\n\tif (start_index == -1)\n\t    continue;\n\n        for (size_t index(start_index); index < dir_entries.size() and dir_entries[index].getTag() == keyword_tag; ++index) {\n            const Subfields subfields(fields[index]);\n            const auto begin_end(subfields.getIterators('0'));\n            for (auto subfield0(begin_end.first); subfield0 != begin_end.second; ++subfield0) {\n                if (not StringUtil::StartsWith(subfield0->second, \"(DE-576)\"))\n                    continue;\n\n                const std::string topic_id(subfield0->second.substr(8));\n\t\tshared_norm_data_control_numbers->insert(topic_id);\n            }\n        }\n    }\n\n    return true;\n}\n\n\nvoid ExtractKeywordNormdataControlNumbers(File * const marc_input,\n\t\t\t\t\t  std::unordered_set<std::string> * const norm_data_control_numbers)\n{\n    const size_t orig_size(norm_data_control_numbers->size());\n\n    shared_norm_data_control_numbers = norm_data_control_numbers;\n    std::string err_msg;\n    if (not MarcUtil::ProcessRecords(marc_input, RecordKeywordControlNumbers, nullptr, &err_msg))\n\tError(\"error while extracting keyword control numbers for \\\"\" + marc_input->getPath() + \"\\\": \" + err_msg);\n\n    std::cerr << \"Found \" << (norm_data_control_numbers->size() - orig_size) << \" new keyword control numbers in \"\n\t      << marc_input->getPath() << '\\n';\n}\n\n\nstatic unsigned keyword_count, translation_count;\nstatic DbConnection *shared_connection;\n\n\nbool ExtractTranslations(MarcUtil::Record * const record, XmlWriter * const \/*xml_writer*\/, std::string * const \/* err_msg *\/) {\n    const std::vector<std::string> &fields(record->getFields());\n    if (shared_norm_data_control_numbers->find(fields[0]) == shared_norm_data_control_numbers->cend())\n\treturn true; \/\/ Not one of the records w\/ a keyword used in our title data.\n\n    const ssize_t _150_index(record->getFieldIndex(\"150\"));\n    if (_150_index == -1)\n\treturn true;\n    const Subfields _150_subfields(fields[_150_index]);\n    const std::string german_text(_150_subfields.getFirstSubfieldValue('a'));\n    if (unlikely(german_text.empty()))\n\treturn true;\n    ++keyword_count;\n \n    std::vector<std::pair<std::string, std::string>> text_and_language_codes;\n    text_and_language_codes.emplace_back(std::make_pair(german_text, \"deu\"));\n\n    \/\/ Find translations:\n    const ssize_t first_750_index(record->getFieldIndex(\"750\"));\n    if (first_750_index != -1) {\n\tconst std::vector<DirectoryEntry> &dir_entries(record->getDirEntries());\n        for (size_t index(first_750_index); index < dir_entries.size() and dir_entries[index].getTag() == \"750\"; ++index) {\n\t    const Subfields _750_subfields(fields[index]);\n\t    auto start_end(_750_subfields.getIterators('9'));\n\t    if (start_end.first == start_end.second)\n\t\tcontinue;\n\t    std::string language_code, association;\n\t    for (auto code_and_value(start_end.first); code_and_value != start_end.second; ++code_and_value) {\n\t\tif (StringUtil::StartsWith(code_and_value->second, \"L:\"))\n\t\t    language_code = code_and_value->second.substr(2);\n\t\telse if (StringUtil::StartsWith(code_and_value->second, \"Z:\"))\n\t\t    association = code_and_value->second.substr(2);\n\t    }\n\t    if (not language_code.empty()) {\n\t\t++translation_count;\n\t\ttext_and_language_codes.emplace_back(std::make_pair(_750_subfields.getFirstSubfieldValue('a'), language_code));\n\t    }\n        }\n    }\n\n    \/\/ Update the database.\n    const std::string id(TranslationUtil::GetId(shared_connection, german_text));\n    for (const auto &text_and_language_code : text_and_language_codes) {\n\tconst std::string REPLACE_STMT(\"REPLACE INTO translations SET id=\" + id + \", language_code=\\\"\"\n\t\t\t\t       + text_and_language_code.second + \"\\\", category=\\\"keywords\\\", preexists=TRUE, text=\\\"\"\n\t\t\t\t       + shared_connection->escapeString(text_and_language_code.first) + \"\\\"\");\n\tif (not shared_connection->query(REPLACE_STMT))\n\t    Error(\"Insert failed: \" + REPLACE_STMT + \" (\" + shared_connection->getLastErrorMessage() + \")\");\n    }\n\n    return true;\n}\n\n\nvoid ExtractTranslationTerms(File * const norm_data_input, DbConnection * const connection) {\n    shared_connection = connection;\n\n    std::string err_msg;\n    if (not MarcUtil::ProcessRecords(norm_data_input, ExtractTranslations, nullptr, &err_msg))\n\tError(\"error while extracting translations from \\\"\" + norm_data_input->getPath() + \"\\\": \" + err_msg);\n\n    std::cerr << \"Added \" << keyword_count << \" to the translation database.\\n\";\n    std::cerr << \"Found \" << translation_count << \" translations in the norm data.\\n\";\n}\n\n\t\t\t     \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 != 3)\n        Usage();\n\n    const std::string marc_input_filename(argv[1]);\n    File marc_input(marc_input_filename, \"rm\");\n    if (not marc_input)\n        Error(\"can't open \\\"\" + marc_input_filename + \"\\\" for reading!\");\n\n    const std::string norm_data_marc_input_filename(argv[2]);\n    File norm_data_marc_input(norm_data_marc_input_filename, \"rm\");\n    if (not norm_data_marc_input)\n        Error(\"can't open \\\"\" + norm_data_marc_input_filename + \"\\\" for reading!\");\n\n    try {\n\tconst IniFile ini_file(CONF_FILE_PATH);\n\tconst std::string sql_database(ini_file.getString(\"\", \"sql_database\"));\n\tconst std::string sql_username(ini_file.getString(\"\", \"sql_username\"));\n\tconst std::string sql_password(ini_file.getString(\"\", \"sql_password\"));\n\tDbConnection db_connection(sql_database, sql_username, sql_password);\n\n\tstd::unordered_set<std::string> norm_data_control_numbers;\n\tExtractKeywordNormdataControlNumbers(&marc_input, &norm_data_control_numbers);\n\tExtractTranslationTerms(&norm_data_marc_input, &db_connection);\n    } catch (const std::exception &x) {\n\tError(\"caught exception: \" + std::string(x.what()));\n    }\n}\n<commit_msg>We now include 'lcsh' and 'ram' \"translations\" as well as German synonyms from 450$a subfields.<commit_after>\/** \\file    extract_keywords_for_translation.cc\n *  \\brief   A tool for extracting keywords that need to be translated.  The keywords and any possibly pre-existing\n *           translations will be stored in a 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 <unordered_set>\n#include <utility>\n#include <vector>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"DirectoryEntry.h\"\n#include \"IniFile.h\"\n#include \"Leader.h\"\n#include \"MarcUtil.h\"\n#include \"StringUtil.h\"\n#include \"Subfields.h\"\n#include \"TimeUtil.h\"\n#include \"TranslationUtil.h\"\n#include \"WallClockTimer.h\"\n#include \"util.h\"\n\n\nvoid Usage() {\n    std::cerr << \"Usage: \" << progname << \" title_input norm_data_input\\n\";\n    std::exit(EXIT_FAILURE);\n}\n\n\nstatic std::unordered_set<std::string> *shared_norm_data_control_numbers;\n\n\nbool RecordKeywordControlNumbers(MarcUtil::Record * const record, XmlWriter * const \/*xml_writer*\/,\n\t\t\t\t std::string * const \/* err_msg *\/)\n{\n    std::vector<std::string> keyword_tags;\n    StringUtil::Split(\"600:610:611:630:650:653:656\", ':', &keyword_tags);\n    const std::vector<std::string> &fields(record->getFields());\n    const std::vector<DirectoryEntry> &dir_entries(record->getDirEntries());\n    for (const auto &keyword_tag : keyword_tags) {\n\tconst ssize_t start_index(record->getFieldIndex(keyword_tag));\n\tif (start_index == -1)\n\t    continue;\n\n        for (size_t index(start_index); index < dir_entries.size() and dir_entries[index].getTag() == keyword_tag; ++index) {\n            const Subfields subfields(fields[index]);\n            const auto begin_end(subfields.getIterators('0'));\n            for (auto subfield0(begin_end.first); subfield0 != begin_end.second; ++subfield0) {\n                if (not StringUtil::StartsWith(subfield0->second, \"(DE-576)\"))\n                    continue;\n\n                const std::string topic_id(subfield0->second.substr(8));\n\t\tshared_norm_data_control_numbers->insert(topic_id);\n            }\n        }\n    }\n\n    return true;\n}\n\n\nvoid ExtractKeywordNormdataControlNumbers(File * const marc_input,\n\t\t\t\t\t  std::unordered_set<std::string> * const norm_data_control_numbers)\n{\n    const size_t orig_size(norm_data_control_numbers->size());\n\n    shared_norm_data_control_numbers = norm_data_control_numbers;\n    std::string err_msg;\n    if (not MarcUtil::ProcessRecords(marc_input, RecordKeywordControlNumbers, nullptr, &err_msg))\n\tError(\"error while extracting keyword control numbers for \\\"\" + marc_input->getPath() + \"\\\": \" + err_msg);\n\n    std::cerr << \"Found \" << (norm_data_control_numbers->size() - orig_size) << \" new keyword control numbers in \"\n\t      << marc_input->getPath() << '\\n';\n}\n\n\nstatic unsigned keyword_count, translation_count, additional_hits, synonym_count;\nstatic DbConnection *shared_connection;\n\n\nbool ExtractTranslations(MarcUtil::Record * const record, XmlWriter * const \/*xml_writer*\/, std::string * const \/* err_msg *\/) {\n    const std::vector<std::string> &fields(record->getFields());\n    if (shared_norm_data_control_numbers->find(fields[0]) == shared_norm_data_control_numbers->cend())\n\treturn true; \/\/ Not one of the records w\/ a keyword used in our title data.\n\n    \/\/ Extract original German entry:\n    const ssize_t _150_index(record->getFieldIndex(\"150\"));\n    if (_150_index == -1)\n\treturn true;\n    const Subfields _150_subfields(fields[_150_index]);\n    const std::string german_text(_150_subfields.getFirstSubfieldValue('a'));\n    if (unlikely(german_text.empty()))\n\treturn true;\n    ++keyword_count;\n \n    std::vector<std::pair<std::string, std::string>> text_and_language_codes;\n    text_and_language_codes.emplace_back(std::make_pair(german_text, \"deu\"));\n\n    \/\/ Look for German synonyms:\n    const std::vector<DirectoryEntry> &dir_entries(record->getDirEntries());\n    ssize_t _450_index(record->getFieldIndex(\"450\"));\n    if (_450_index != -1) {\n\tfor (\/* Intentionally empty! *\/;\n\t     static_cast<size_t>(_450_index) < fields.size() and dir_entries[_450_index].getTag() == \"450\"; ++_450_index)\n        {\n\t    const Subfields _450_subfields(fields[_450_index]);\n\t    if (_450_subfields.hasSubfield('a')) {\n\t\ttext_and_language_codes.emplace_back(std::make_pair(_450_subfields.getFirstSubfieldValue('a'), \"deu\"));\n\t\t++synonym_count;\n\t    }\n\t}\n    }\n\n    \/\/ Find translations:\n    const ssize_t first_750_index(record->getFieldIndex(\"750\"));\n    if (first_750_index != -1) {\n        for (size_t index(first_750_index); index < dir_entries.size() and dir_entries[index].getTag() == \"750\"; ++index) {\n\t    const Subfields _750_subfields(fields[index]);\n\t    auto start_end(_750_subfields.getIterators('9'));\n\t    if (start_end.first == start_end.second)\n\t\tcontinue;\n\t    std::string language_code;\n\t    for (auto code_and_value(start_end.first); code_and_value != start_end.second; ++code_and_value) {\n\t\tif (StringUtil::StartsWith(code_and_value->second, \"L:\"))\n\t\t    language_code = code_and_value->second.substr(2);\n\t    }\n\t    if (language_code.empty() and _750_subfields.hasSubfield('2')) {\n\t\tconst std::string _750_2(_750_subfields.getFirstSubfieldValue('2'));\n\t\tif (_750_2 == \"lcsh\")\n\t\t    language_code = \"eng\";\n\t\telse if (_750_2 == \"ram\")\n\t\t    language_code =\"fra\";\n\t\tif (not language_code.empty())\n\t\t    ++additional_hits;\n            }\n\t    if (not language_code.empty()) {\n\t\t++translation_count;\n\t\ttext_and_language_codes.emplace_back(std::make_pair(_750_subfields.getFirstSubfieldValue('a'), language_code));\n\t    }\n        }\n    }\n\n    \/\/ Update the database.\n    const std::string id(TranslationUtil::GetId(shared_connection, german_text));\n    for (const auto &text_and_language_code : text_and_language_codes) {\n\tconst std::string REPLACE_STMT(\"REPLACE INTO translations SET id=\" + id + \", language_code=\\\"\"\n\t\t\t\t       + text_and_language_code.second + \"\\\", category=\\\"keywords\\\", preexists=TRUE, text=\\\"\"\n\t\t\t\t       + shared_connection->escapeString(text_and_language_code.first) + \"\\\"\");\n\tif (not shared_connection->query(REPLACE_STMT))\n\t    Error(\"Insert failed: \" + REPLACE_STMT + \" (\" + shared_connection->getLastErrorMessage() + \")\");\n    }\n\n    return true;\n}\n\n\nvoid ExtractTranslationTerms(File * const norm_data_input, DbConnection * const connection) {\n    shared_connection = connection;\n\n    std::string err_msg;\n    if (not MarcUtil::ProcessRecords(norm_data_input, ExtractTranslations, nullptr, &err_msg))\n\tError(\"error while extracting translations from \\\"\" + norm_data_input->getPath() + \"\\\": \" + err_msg);\n\n    std::cerr << \"Added \" << keyword_count << \" to the translation database.\\n\";\n    std::cerr << \"Found \" << translation_count << \" translations in the norm data. (\" << additional_hits\n\t      << \" due to 'ram' and 'lcsh' entries.)\\n\";\n    std::cerr << \"Found \" << synonym_count << \" synonym entries.\\n\";\n}\n\n\t\t\t     \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 != 3)\n        Usage();\n\n    WallClockTimer timer(WallClockTimer::CUMULATIVE_WITH_AUTO_START);\n\n    const std::string marc_input_filename(argv[1]);\n    File marc_input(marc_input_filename, \"rm\");\n    if (not marc_input)\n        Error(\"can't open \\\"\" + marc_input_filename + \"\\\" for reading!\");\n\n    const std::string norm_data_marc_input_filename(argv[2]);\n    File norm_data_marc_input(norm_data_marc_input_filename, \"rm\");\n    if (not norm_data_marc_input)\n        Error(\"can't open \\\"\" + norm_data_marc_input_filename + \"\\\" for reading!\");\n\n    try {\n\tconst IniFile ini_file(CONF_FILE_PATH);\n\tconst std::string sql_database(ini_file.getString(\"\", \"sql_database\"));\n\tconst std::string sql_username(ini_file.getString(\"\", \"sql_username\"));\n\tconst std::string sql_password(ini_file.getString(\"\", \"sql_password\"));\n\tDbConnection db_connection(sql_database, sql_username, sql_password);\n\n\tstd::unordered_set<std::string> norm_data_control_numbers;\n\tExtractKeywordNormdataControlNumbers(&marc_input, &norm_data_control_numbers);\n\tExtractTranslationTerms(&norm_data_marc_input, &db_connection);\n\n\ttimer.stop();\n\tstd::cout << ::progname << \": execution time: \" << TimeUtil::FormatTime(timer.getTimeInMilliseconds()) << \".\\n\";\n    } catch (const std::exception &x) {\n\tError(\"caught exception: \" + std::string(x.what()));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ironbee.hpp\"\n\n#include <ironbee\/config.h>\n#include <ironbee\/mpool.h>\n#include <ironbee\/release.h>\n#include <ironbee\/debug.h>\n#include <ironbee\/util.h>\n#include <ironbee\/state_notify.h>\n\n#include <boost\/lexical_cast.hpp>\n\n#include <stdexcept>\n#include <string>\n\nusing namespace std;\n\nnamespace  {\n\nvoid expect_ok(ib_status_t rc, const char* message)\n{\n  if (rc != IB_OK) {\n    throw runtime_error(\n      string(\"Error (\") + ib_status_to_string(rc) + \"): \" + message\n    );\n  }\n}\n\nib_conndata_t* buffer_to_conndata(\n  ib_conn_t*               conn,\n  const IronBee::buffer_t& buffer\n)\n{\n  ib_conndata_t* conndata;\n  \/\/ We hope IronBee eventually destroys this...\n  expect_ok(ib_conn_data_create(conn, &conndata, buffer.length),\n    \"Allocating connection data.\"\n  );\n  conndata->dlen = buffer.length;\n  std::copy(\n    buffer.data, buffer.data + buffer.length,\n    reinterpret_cast<char*>(conndata->data)\n  );\n\n  return conndata;\n}\n\n}\n\nnamespace IronBee {\n\nIronBee::IronBee() :\n  m_server {\n    IB_SERVER_HEADER_DEFAULTS,\n    \"cpp_ironbee\"\n  }\n{\n  \/\/ Trace to stderr.\n  ib_trace_init(NULL);\n\n  \/\/ Initialize.\n  expect_ok(ib_initialize(), \"Initializing IronBee.\");\n  {\n    ib_engine_t* engine;\n    expect_ok(ib_engine_create(&engine, &m_server), \"Creating engine.\");\n    m_ironbee.reset(engine, &ib_engine_destroy);\n  }\n  expect_ok(ib_engine_init(m_ironbee.get()), \"Initializing engine.\");\n}\n\nvoid IronBee::load_config(const std::string& config_path)\n{\n  boost::shared_ptr<ib_cfgparser_t> parser;\n\n  expect_ok(ib_state_notify_cfg_started(m_ironbee.get()),\n    \"Starting config.\"\n  );\n  {\n    ib_cfgparser_t* cp;\n    expect_ok(ib_cfgparser_create(&cp, m_ironbee.get()),\n      \"Creating config parser.\"\n    );\n    parser.reset(cp, &ib_cfgparser_destroy);\n  }\n\n  expect_ok(ib_cfgparser_parse(parser.get(), config_path.c_str()),\n    \"Parsing config file.\"\n  );\n\n  ib_state_notify_cfg_finished(m_ironbee.get());\n\n  \/\/ Do some sanity checks.\n  auto ctx = ib_context_main(m_ironbee.get());\n  if (! ctx) {\n    throw runtime_error(\"IronBee has no main context.\");\n  }\n  if (ib_context_get_engine(ctx) != m_ironbee.get()) {\n    throw runtime_error(\"IronBee has corrupt context.\");\n  }\n}\n\nIronBee::connection_p IronBee::open_connection(\n  const buffer_t&    local_ip,\n  uint16_t           local_port,\n  const buffer_t&    remote_ip,\n  uint16_t           remote_port\n)\n{\n  return IronBee::connection_p(new Connection(\n    *this,\n    local_ip,\n    local_port,\n    remote_ip,\n    remote_port\n  ));\n}\n\nIronBee::connection_p IronBee::open_connection(const input_t& input)\n{\n  return open_connection(\n    input.local_ip,\n    input.local_port,\n    input.remote_ip,\n    input.remote_port\n  );\n}\n\nIronBee::Connection::Connection(\n  IronBee&           ib,\n  const buffer_t&    local_ip,\n  uint16_t           local_port,\n  const buffer_t&    remote_ip,\n  uint16_t           remote_port\n) :\n  m_ib(ib)\n{\n  expect_ok(ib_conn_create(m_ib.m_ironbee.get(), &m_connection, NULL),\n    \"Creating connection.\"\n  );\n\n  m_local_ip                 = local_ip.to_s();\n  m_remote_ip                = remote_ip.to_s();\n  m_connection->local_ipstr  = m_local_ip.c_str();\n  m_connection->local_port   = local_port;\n  m_connection->remote_ipstr = m_remote_ip.c_str();\n  m_connection->remote_port  = remote_port;\n\n  expect_ok(\n    ib_state_notify_conn_opened(\n      m_ib.m_ironbee.get(),\n      m_connection\n    ),\n    \"Opening connection.\"\n  );\n}\n\nIronBee::Connection::~Connection()\n{\n  if (m_connection) {\n    close();\n  }\n}\n\nvoid IronBee::Connection::close()\n{\n  expect_ok(\n    ib_state_notify_conn_closed(m_ib.m_ironbee.get(), m_connection),\n    \"Closing connection.\"\n  );\n  m_connection = NULL;\n}\n\nvoid IronBee::Connection::data_in(const buffer_t& data)\n{\n  auto conndata = buffer_to_conndata(\n    m_connection,\n    data\n  );\n\n  expect_ok(\n    ib_state_notify_conn_data_in(\n        m_ib.m_ironbee.get(),\n        conndata,\n        NULL\n    ),\n    \"Connection data in.\"\n  );\n}\n\nvoid IronBee::Connection::data_out(const buffer_t& data)\n{\n  auto conndata = buffer_to_conndata(\n    m_connection,\n    data\n  );\n\n  expect_ok(\n    ib_state_notify_conn_data_out(\n      m_ib.m_ironbee.get(),\n      conndata,\n      NULL\n    ),\n    \"Connection data in.\"\n  );\n}\n\n} \/\/ IronBee\n<commit_msg>ibcli_cpp: Update to match recent API changes.<commit_after>#include \"ironbee.hpp\"\n\n#include <ironbee\/config.h>\n#include <ironbee\/mpool.h>\n#include <ironbee\/release.h>\n#include <ironbee\/debug.h>\n#include <ironbee\/util.h>\n#include <ironbee\/state_notify.h>\n\n#include <boost\/lexical_cast.hpp>\n\n#include <stdexcept>\n#include <string>\n\nusing namespace std;\n\nnamespace  {\n\nvoid expect_ok(ib_status_t rc, const char* message)\n{\n  if (rc != IB_OK) {\n    throw runtime_error(\n      string(\"Error (\") + ib_status_to_string(rc) + \"): \" + message\n    );\n  }\n}\n\nib_conndata_t* buffer_to_conndata(\n  ib_conn_t*               conn,\n  const IronBee::buffer_t& buffer\n)\n{\n  ib_conndata_t* conndata;\n  \/\/ We hope IronBee eventually destroys this...\n  expect_ok(ib_conn_data_create(conn, &conndata, buffer.length),\n    \"Allocating connection data.\"\n  );\n  conndata->dlen = buffer.length;\n  std::copy(\n    buffer.data, buffer.data + buffer.length,\n    reinterpret_cast<char*>(conndata->data)\n  );\n\n  return conndata;\n}\n\n}\n\nnamespace IronBee {\n\nIronBee::IronBee() :\n  m_server {\n    IB_SERVER_HEADER_DEFAULTS,\n    \"cpp_ironbee\"\n  }\n{\n  \/\/ Trace to stderr.\n  ib_trace_init(NULL);\n\n  \/\/ Initialize.\n  expect_ok(ib_initialize(), \"Initializing IronBee.\");\n  {\n    ib_engine_t* engine;\n    expect_ok(ib_engine_create(&engine, &m_server), \"Creating engine.\");\n    m_ironbee.reset(engine, &ib_engine_destroy);\n  }\n  expect_ok(ib_engine_init(m_ironbee.get()), \"Initializing engine.\");\n}\n\nvoid IronBee::load_config(const std::string& config_path)\n{\n  boost::shared_ptr<ib_cfgparser_t> parser;\n\n  expect_ok(ib_state_notify_cfg_started(m_ironbee.get()),\n    \"Starting config.\"\n  );\n  {\n    ib_cfgparser_t* cp;\n    expect_ok(ib_cfgparser_create(&cp, m_ironbee.get()),\n      \"Creating config parser.\"\n    );\n    parser.reset(cp, &ib_cfgparser_destroy);\n  }\n\n  expect_ok(ib_cfgparser_parse(parser.get(), config_path.c_str()),\n    \"Parsing config file.\"\n  );\n\n  ib_state_notify_cfg_finished(m_ironbee.get());\n\n  \/\/ Do some sanity checks.\n  auto ctx = ib_context_main(m_ironbee.get());\n  if (! ctx) {\n    throw runtime_error(\"IronBee has no main context.\");\n  }\n  if (ib_context_get_engine(ctx) != m_ironbee.get()) {\n    throw runtime_error(\"IronBee has corrupt context.\");\n  }\n}\n\nIronBee::connection_p IronBee::open_connection(\n  const buffer_t&    local_ip,\n  uint16_t           local_port,\n  const buffer_t&    remote_ip,\n  uint16_t           remote_port\n)\n{\n  return IronBee::connection_p(new Connection(\n    *this,\n    local_ip,\n    local_port,\n    remote_ip,\n    remote_port\n  ));\n}\n\nIronBee::connection_p IronBee::open_connection(const input_t& input)\n{\n  return open_connection(\n    input.local_ip,\n    input.local_port,\n    input.remote_ip,\n    input.remote_port\n  );\n}\n\nIronBee::Connection::Connection(\n  IronBee&           ib,\n  const buffer_t&    local_ip,\n  uint16_t           local_port,\n  const buffer_t&    remote_ip,\n  uint16_t           remote_port\n) :\n  m_ib(ib)\n{\n  expect_ok(ib_conn_create(m_ib.m_ironbee.get(), &m_connection, NULL),\n    \"Creating connection.\"\n  );\n\n  m_local_ip                 = local_ip.to_s();\n  m_remote_ip                = remote_ip.to_s();\n  m_connection->local_ipstr  = m_local_ip.c_str();\n  m_connection->local_port   = local_port;\n  m_connection->remote_ipstr = m_remote_ip.c_str();\n  m_connection->remote_port  = remote_port;\n\n  expect_ok(\n    ib_state_notify_conn_opened(\n      m_ib.m_ironbee.get(),\n      m_connection\n    ),\n    \"Opening connection.\"\n  );\n}\n\nIronBee::Connection::~Connection()\n{\n  if (m_connection) {\n    close();\n  }\n}\n\nvoid IronBee::Connection::close()\n{\n  expect_ok(\n    ib_state_notify_conn_closed(m_ib.m_ironbee.get(), m_connection),\n    \"Closing connection.\"\n  );\n  m_connection = NULL;\n}\n\nvoid IronBee::Connection::data_in(const buffer_t& data)\n{\n  auto conndata = buffer_to_conndata(\n    m_connection,\n    data\n  );\n\n  expect_ok(\n    ib_state_notify_conn_data_in(\n        m_ib.m_ironbee.get(),\n        conndata\n    ),\n    \"Connection data in.\"\n  );\n}\n\nvoid IronBee::Connection::data_out(const buffer_t& data)\n{\n  auto conndata = buffer_to_conndata(\n    m_connection,\n    data\n  );\n\n  expect_ok(\n    ib_state_notify_conn_data_out(\n      m_ib.m_ironbee.get(),\n      conndata\n    ),\n    \"Connection data in.\"\n  );\n}\n\n} \/\/ IronBee\n<|endoftext|>"}
{"text":"<commit_before>#include \"isocalc.h\"\n\n#include \"fftw3.h\"\n#include <cassert>\n#include <cstring>\n#include <complex>\n#include <vector>\n#include <mutex>\n\nnamespace ms {\n  namespace detail {\n    __attribute ((__destructor__)) void fftwCleanup() { fftw_cleanup(); }\n\n    class FftwArray {\n      std::vector<int> dims_;\n      std::complex<double>* data_;\n      size_t n_;\n      public:\n      FftwArray(const std::vector<int>& dimensions) : dims_(dimensions) {\n        n_ = 1;\n        for (int x: dimensions)\n          n_ *= x;\n        data_ = reinterpret_cast<std::complex<double>*>(fftw_alloc_complex(n_));\n        std::memset(data_, 0, n_ * sizeof(fftw_complex));\n      }\n\n      fftw_complex* fftw_data() const { return reinterpret_cast<fftw_complex*>(data_); }\n      std::complex<double>* data() const { return data_; }\n      size_t size() const { return n_; }\n\n      ~FftwArray() {\n        fftw_free(data_);\n      }\n    };\n  }\n\n  double monoisotopicMass(const ElementCounter& counter) {\n    double sum = 0.0;\n    for (auto& item: counter)\n      sum += item.second * ms::Element::getByName(item.first).isotope_pattern.masses[0];\n    return sum;\n  }\n\n  double monoisotopicMass(const std::string& formula) {\n    return monoisotopicMass(::sf_parser::parseSumFormula(formula));\n  }\n\n  IsotopePattern computeIsotopePattern(const ms::Element& element, size_t amount, double threshold) {\n    size_t dim = element.isotope_pattern.size() - 1;\n    std::vector<int> dimensions(static_cast<int>(dim), amount + 1);\n    detail::FftwArray arr{dimensions};\n\n    static std::mutex plan_mutex; \/\/ planning is not thread-safe\n\n    \/\/ array setup\n    const auto& iso = element.isotope_pattern;\n    arr.data()[0] = iso.abundances[0];\n    for (size_t i = 0, k = 1; i < dim; i++, k *= amount + 1)\n      arr.data()[k] = iso.abundances[dim - i];\n\n    plan_mutex.lock();\n    \/\/ forward FFT\n    auto fwd_plan = fftw_plan_dft(int(dim), &dimensions[0], arr.fftw_data(), arr.fftw_data(),\n                                 FFTW_FORWARD, FFTW_ESTIMATE);\n    plan_mutex.unlock();\n    fftw_execute(fwd_plan);\n\n    \/\/ exponentiation\n    for (size_t i = 0; i < arr.size(); ++i)\n      arr.data()[i] = std::pow(arr.data()[i], amount);\n    fftw_destroy_plan(fwd_plan);\n\n    \/\/ inverse FFT\n    plan_mutex.lock();\n    auto bwd_plan = fftw_plan_dft(dim, &dimensions[0], arr.fftw_data(), arr.fftw_data(),\n                                  FFTW_BACKWARD, FFTW_ESTIMATE);\n    plan_mutex.unlock();\n    fftw_execute(bwd_plan);\n    for (size_t i = 0; i < arr.size(); ++i)\n      arr.data()[i] \/= double(arr.size()); \/\/ take care of FFTW normalization\n    fftw_destroy_plan(bwd_plan);\n\n    ms::IsotopePattern isotope_pattern;\n\n    std::vector<size_t> indices(dim, 0);\n    for (size_t i = 0; i < arr.size(); ++i) {\n      size_t k;\n      size_t n = 0;\n      double mass = 0.0;\n      for (k = 0; k < dim; ++k) {\n        mass += iso.masses[k + 1] * indices[k];\n        n += indices[k];\n      }\n\n      if (n <= amount && arr.data()[i].real() >= threshold) {\n        mass += (amount - n) * iso.masses[0];\n\n        isotope_pattern.masses.push_back(mass);\n        isotope_pattern.abundances.push_back(arr.data()[i].real());\n      }\n\n      if (i == arr.size() - 1) break;\n      for (k = dim - 1; indices[k] == amount; --k);\n      indices[k] += 1;\n      while (++k < dim) indices[k] = 0;\n    }\n\n    isotope_pattern.normalize();\n    return isotope_pattern;\n  }\n\n  IsotopePattern computeIsotopePattern(const ElementCounter& element_counts,\n      double threshold, double fft_threshold)\n  {\n    assert(threshold < 1);\n    ms::IsotopePattern result(0);\n\n    for (auto& item: element_counts) {\n      assert(ms::Element::isKnown(item.first));\n      auto element = ms::Element::getByName(item.first);\n      auto pattern = computeIsotopePattern(element, item.second, fft_threshold);\n      result = result.multiply(pattern, threshold * threshold);\n    }\n\n    return result;\n  }\n\n  IsotopePattern computeIsotopePattern(const std::string& sum_formula,\n      double threshold, double fft_threshold)\n  {\n    auto counts = sf_parser::parseSumFormula(sum_formula);\n    return computeIsotopePattern(counts, threshold, fft_threshold);\n  }\n}\n\nnamespace sf_parser {\n  typedef ms::ElementCounter ElementCounter;\n\n  using ::sf_parser::ParseError;\n  using ::sf_parser::NegativeTotalError;\n\n  class SumFormulaParser {\n    std::string s;\n    size_t n;\n    ElementCounter counter_;\n  public:\n    SumFormulaParser(const std::string& input) : s(input), n(0) {\n      parseSumFormula(counter_);\n    }\n\n    const ElementCounter& elementCounts() const {\n      return counter_;\n    }\n\n  private:\n    bool eof() const { return n >= s.length(); }\n\n    void checkAvailable() const {\n      if (eof()) throw new ParseError(\"unexpected end of input\", n);\n    }\n\n    char nextChar() { checkAvailable(); return s[n++]; }\n\n    char peek() const { checkAvailable(); return s[n]; }\n\n    uint16_t parseOptionalNumber() {\n      if (eof() || !std::isdigit(peek()))\n        return 1;\n      auto pos = n;\n      uint16_t result = 0;\n      while (!eof() && std::isdigit(peek())) {\n        if (result >= 6553)\n          throw new ParseError(\"the number is too big\", pos);\n        result = result * 10 + (nextChar() - '0');\n      }\n      return result;\n    }\n\n    void parseElement(ElementCounter& counter) {\n      std::string element;\n      element.push_back(nextChar());\n      auto pos = n;\n      if (!std::isupper(element.back())) throw new ParseError(\"expected an element\", n);\n      while (!eof() && std::islower(peek()))\n        element.push_back(nextChar());\n      uint16_t num = parseOptionalNumber();\n      if (!ms::Element::isKnown(element))\n        throw new ParseError(\"unknown element \" + element, pos);\n      counter[element] += num;\n    }\n\n    void parseSimpleFragment(ElementCounter& counter) {\n      while (!eof() && std::isupper(peek())) {\n        parseElement(counter);\n      }\n    }\n\n    void parseFragment(ElementCounter& counter) {\n      while (!eof()) {\n        if (peek() == '(') {\n          nextChar();\n          ElementCounter tmp;\n          parseFragment(tmp);\n          if (nextChar() != ')')\n            throw new ParseError(\"expected closing parenthesis\", n - 1);\n          auto repeats = parseOptionalNumber();\n          for (auto& item: tmp)\n            counter[item.first] += item.second * repeats;\n        } else if (std::isupper(peek())) {\n          parseSimpleFragment(counter);\n        } else {\n          break;\n        }\n      }\n    }\n\n    void parseMolecularComplex(ElementCounter& counter) {\n      ElementCounter tmp;\n      auto repeats = parseOptionalNumber();\n      while (!eof()) {\n        if (peek() == '.' || peek() == '-' || peek() == '+')\n          break;\n        parseFragment(tmp);\n      }\n      for (auto& item: tmp)\n        counter[item.first] += repeats * item.second;\n    }\n\n    void parseSumFormula(ElementCounter& counter) {\n      parseMolecularComplex(counter);\n\n      while (!eof()) {\n        if (peek() == '.') {\n          nextChar();\n          parseMolecularComplex(counter);\n        } else {\n          break;\n        }\n      }\n\n      if (!eof()) {\n        ElementCounter adduct;\n        char sign = nextChar();\n        int mult;\n        if (sign == '-') mult = -1;\n        else if (sign == '+') mult = 1;\n        else throw new ParseError(\"expected +\/-\", n-1);\n        parseMolecularComplex(adduct);\n        for (auto& item: adduct) {\n          auto total = int(counter[item.first]) + mult * int(item.second);\n          if (total < 0)\n            throw new NegativeTotalError(item.first, total);\n          counter[item.first] = total;\n        }\n      }\n    }\n  };\n\n  ms::ElementCounter parseSumFormula(const std::string& formula) {\n    sf_parser::SumFormulaParser parser{formula};\n    return parser.elementCounts();\n  }\n}\n<commit_msg>fftw_destroy_plan is not thread-safe<commit_after>#include \"isocalc.h\"\n\n#include \"fftw3.h\"\n#include <cassert>\n#include <cstring>\n#include <complex>\n#include <vector>\n#include <mutex>\n\nnamespace ms {\n  namespace detail {\n    __attribute ((__destructor__)) void fftwCleanup() { fftw_cleanup(); }\n\n    class FftwArray {\n      std::vector<int> dims_;\n      std::complex<double>* data_;\n      size_t n_;\n      public:\n      FftwArray(const std::vector<int>& dimensions) : dims_(dimensions) {\n        n_ = 1;\n        for (int x: dimensions)\n          n_ *= x;\n        data_ = reinterpret_cast<std::complex<double>*>(fftw_alloc_complex(n_));\n        std::memset(data_, 0, n_ * sizeof(fftw_complex));\n      }\n\n      fftw_complex* fftw_data() const { return reinterpret_cast<fftw_complex*>(data_); }\n      std::complex<double>* data() const { return data_; }\n      size_t size() const { return n_; }\n\n      ~FftwArray() {\n        fftw_free(data_);\n      }\n    };\n  }\n\n  double monoisotopicMass(const ElementCounter& counter) {\n    double sum = 0.0;\n    for (auto& item: counter)\n      sum += item.second * ms::Element::getByName(item.first).isotope_pattern.masses[0];\n    return sum;\n  }\n\n  double monoisotopicMass(const std::string& formula) {\n    return monoisotopicMass(::sf_parser::parseSumFormula(formula));\n  }\n\n  IsotopePattern computeIsotopePattern(const ms::Element& element, size_t amount, double threshold) {\n    size_t dim = element.isotope_pattern.size() - 1;\n    std::vector<int> dimensions(static_cast<int>(dim), amount + 1);\n    detail::FftwArray arr{dimensions};\n\n    static std::mutex plan_mutex; \/\/ planning is not thread-safe\n\n    \/\/ array setup\n    const auto& iso = element.isotope_pattern;\n    arr.data()[0] = iso.abundances[0];\n    for (size_t i = 0, k = 1; i < dim; i++, k *= amount + 1)\n      arr.data()[k] = iso.abundances[dim - i];\n\n    plan_mutex.lock();\n    \/\/ forward FFT\n    auto fwd_plan = fftw_plan_dft(int(dim), &dimensions[0], arr.fftw_data(), arr.fftw_data(),\n                                 FFTW_FORWARD, FFTW_ESTIMATE);\n    fftw_execute(fwd_plan);\n\n    \/\/ exponentiation\n    for (size_t i = 0; i < arr.size(); ++i)\n      arr.data()[i] = std::pow(arr.data()[i], amount);\n    fftw_destroy_plan(fwd_plan);\n\n    \/\/ inverse FFT\n    auto bwd_plan = fftw_plan_dft(dim, &dimensions[0], arr.fftw_data(), arr.fftw_data(),\n                                  FFTW_BACKWARD, FFTW_ESTIMATE);\n    fftw_execute(bwd_plan);\n    for (size_t i = 0; i < arr.size(); ++i)\n      arr.data()[i] \/= double(arr.size()); \/\/ take care of FFTW normalization\n    fftw_destroy_plan(bwd_plan);\n    plan_mutex.unlock();\n\n    ms::IsotopePattern isotope_pattern;\n\n    std::vector<size_t> indices(dim, 0);\n    for (size_t i = 0; i < arr.size(); ++i) {\n      size_t k;\n      size_t n = 0;\n      double mass = 0.0;\n      for (k = 0; k < dim; ++k) {\n        mass += iso.masses[k + 1] * indices[k];\n        n += indices[k];\n      }\n\n      if (n <= amount && arr.data()[i].real() >= threshold) {\n        mass += (amount - n) * iso.masses[0];\n\n        isotope_pattern.masses.push_back(mass);\n        isotope_pattern.abundances.push_back(arr.data()[i].real());\n      }\n\n      if (i == arr.size() - 1) break;\n      for (k = dim - 1; indices[k] == amount; --k);\n      indices[k] += 1;\n      while (++k < dim) indices[k] = 0;\n    }\n\n    isotope_pattern.normalize();\n    return isotope_pattern;\n  }\n\n  IsotopePattern computeIsotopePattern(const ElementCounter& element_counts,\n      double threshold, double fft_threshold)\n  {\n    assert(threshold < 1);\n    ms::IsotopePattern result(0);\n\n    for (auto& item: element_counts) {\n      assert(ms::Element::isKnown(item.first));\n      auto element = ms::Element::getByName(item.first);\n      auto pattern = computeIsotopePattern(element, item.second, fft_threshold);\n      result = result.multiply(pattern, threshold * threshold);\n    }\n\n    return result;\n  }\n\n  IsotopePattern computeIsotopePattern(const std::string& sum_formula,\n      double threshold, double fft_threshold)\n  {\n    auto counts = sf_parser::parseSumFormula(sum_formula);\n    return computeIsotopePattern(counts, threshold, fft_threshold);\n  }\n}\n\nnamespace sf_parser {\n  typedef ms::ElementCounter ElementCounter;\n\n  using ::sf_parser::ParseError;\n  using ::sf_parser::NegativeTotalError;\n\n  class SumFormulaParser {\n    std::string s;\n    size_t n;\n    ElementCounter counter_;\n  public:\n    SumFormulaParser(const std::string& input) : s(input), n(0) {\n      parseSumFormula(counter_);\n    }\n\n    const ElementCounter& elementCounts() const {\n      return counter_;\n    }\n\n  private:\n    bool eof() const { return n >= s.length(); }\n\n    void checkAvailable() const {\n      if (eof()) throw new ParseError(\"unexpected end of input\", n);\n    }\n\n    char nextChar() { checkAvailable(); return s[n++]; }\n\n    char peek() const { checkAvailable(); return s[n]; }\n\n    uint16_t parseOptionalNumber() {\n      if (eof() || !std::isdigit(peek()))\n        return 1;\n      auto pos = n;\n      uint16_t result = 0;\n      while (!eof() && std::isdigit(peek())) {\n        if (result >= 6553)\n          throw new ParseError(\"the number is too big\", pos);\n        result = result * 10 + (nextChar() - '0');\n      }\n      return result;\n    }\n\n    void parseElement(ElementCounter& counter) {\n      std::string element;\n      element.push_back(nextChar());\n      auto pos = n;\n      if (!std::isupper(element.back())) throw new ParseError(\"expected an element\", n);\n      while (!eof() && std::islower(peek()))\n        element.push_back(nextChar());\n      uint16_t num = parseOptionalNumber();\n      if (!ms::Element::isKnown(element))\n        throw new ParseError(\"unknown element \" + element, pos);\n      counter[element] += num;\n    }\n\n    void parseSimpleFragment(ElementCounter& counter) {\n      while (!eof() && std::isupper(peek())) {\n        parseElement(counter);\n      }\n    }\n\n    void parseFragment(ElementCounter& counter) {\n      while (!eof()) {\n        if (peek() == '(') {\n          nextChar();\n          ElementCounter tmp;\n          parseFragment(tmp);\n          if (nextChar() != ')')\n            throw new ParseError(\"expected closing parenthesis\", n - 1);\n          auto repeats = parseOptionalNumber();\n          for (auto& item: tmp)\n            counter[item.first] += item.second * repeats;\n        } else if (std::isupper(peek())) {\n          parseSimpleFragment(counter);\n        } else {\n          break;\n        }\n      }\n    }\n\n    void parseMolecularComplex(ElementCounter& counter) {\n      ElementCounter tmp;\n      auto repeats = parseOptionalNumber();\n      while (!eof()) {\n        if (peek() == '.' || peek() == '-' || peek() == '+')\n          break;\n        parseFragment(tmp);\n      }\n      for (auto& item: tmp)\n        counter[item.first] += repeats * item.second;\n    }\n\n    void parseSumFormula(ElementCounter& counter) {\n      parseMolecularComplex(counter);\n\n      while (!eof()) {\n        if (peek() == '.') {\n          nextChar();\n          parseMolecularComplex(counter);\n        } else {\n          break;\n        }\n      }\n\n      if (!eof()) {\n        ElementCounter adduct;\n        char sign = nextChar();\n        int mult;\n        if (sign == '-') mult = -1;\n        else if (sign == '+') mult = 1;\n        else throw new ParseError(\"expected +\/-\", n-1);\n        parseMolecularComplex(adduct);\n        for (auto& item: adduct) {\n          auto total = int(counter[item.first]) + mult * int(item.second);\n          if (total < 0)\n            throw new NegativeTotalError(item.first, total);\n          counter[item.first] = total;\n        }\n      }\n    }\n  };\n\n  ms::ElementCounter parseSumFormula(const std::string& formula) {\n    sf_parser::SumFormulaParser parser{formula};\n    return parser.elementCounts();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"OrbitService.h\"\n\n#include <iostream>\n\n#include \"Capture.h\"\n#include \"ConnectionManager.h\"\n#include \"Core.h\"\n#include \"CoreApp.h\"\n#include \"TcpServer.h\"\n#include \"TimerManager.h\"\n\n\/\/ TODO: we should probably make it configurable\nconstexpr uint32_t kAsioServerPort = 44766;\n\nOrbitService::OrbitService() {\n  \/\/ TODO: these should be a private fields.\n  GTimerManager = std::make_unique<TimerManager>();\n  GTcpServer = std::make_unique<TcpServer>();\n  Capture::Init();\n\n  GTcpServer->StartServer(kAsioServerPort);\n  ConnectionManager::Get().InitAsService();\n\n  core_app_ = std::make_unique<CoreApp>();\n  GCoreApp = core_app_.get();\n  GCoreApp->InitializeManagers();\n}\n\nvoid OrbitService::Run(std::atomic<bool>* exit_requested) {\n  while (!(*exit_requested)) {\n    GTcpServer->ProcessMainThreadCallbacks();\n    Capture::Update();\n    Sleep(16);\n  }\n\n  GCoreApp = nullptr;\n}\n<commit_msg>Simple line removals in OrbitService.cpp<commit_after>#include \"OrbitService.h\"\n\n#include \"ConnectionManager.h\"\n#include \"Core.h\"\n#include \"CoreApp.h\"\n#include \"TcpServer.h\"\n\n\/\/ TODO: we should probably make it configurable\nconstexpr uint32_t kAsioServerPort = 44766;\n\nOrbitService::OrbitService() {\n  \/\/ TODO: These should be private fields.\n  GTcpServer = std::make_unique<TcpServer>();\n  GTcpServer->StartServer(kAsioServerPort);\n\n  ConnectionManager::Get().InitAsService();\n\n  core_app_ = std::make_unique<CoreApp>();\n  GCoreApp = core_app_.get();\n  GCoreApp->InitializeManagers();\n}\n\nvoid OrbitService::Run(std::atomic<bool>* exit_requested) {\n  while (!(*exit_requested)) {\n    GTcpServer->ProcessMainThreadCallbacks();\n    Sleep(16);\n  }\n\n  GCoreApp = nullptr;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/isteps\/istep12\/call_omi_io_run_training.C $           *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,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    call_omi_io_run_training.C\n *\n *  Contains the HWP wrapper for Istep 12.7\n *      exp_omi_train\n *      p10_omi_train\n *\/\n#include    <stdint.h>\n\n#include    <trace\/interface.H>\n#include    <initservice\/taskargs.H>\n#include    <errl\/errlentry.H>\n\n#include    <isteps\/hwpisteperror.H>\n#include    <errl\/errludtarget.H>\n\n#include    <initservice\/isteps_trace.H>\n#include    <istepHelperFuncs.H>        \/\/ captureError\n\n\/\/Fapi Support\n#include    <config.h>\n#include    <fapi2.H>\n#include    <fapi2\/plat_hwp_invoker.H>\n\n\/\/HWP\n#include    <exp_omi_train.H>\n#include    <p10_omi_train.H>\n#include    <chipids.H>                 \/\/ for EXPLORER ID\n\nusing   namespace   ISTEP;\nusing   namespace   ISTEP_ERROR;\nusing   namespace   ERRORLOG;\nusing   namespace   TARGETING;\nusing   namespace   ERRORLOG;\nusing   namespace   ISTEPS_TRACE;\n\nnamespace ISTEP_12\n{\n\nvoid* call_omi_io_run_training (void *io_pArgs)\n{\n    IStepError l_StepError;\n    errlHndl_t l_err = nullptr;\n    TRACFCOMP( g_trac_isteps_trace, \"call_omi_io_run_training entry\" );\n\n    do\n    {\n        \/\/ Starting beginning at this istep, we may be unable to scom the OCMBs\n        \/\/ until the next istep is complete, except in certain cases where the\n        \/\/ hardware procedure fails. Set ATTR_ATTN_POLL_PLID so ATTN knows to\n        \/\/ poll the PRD_HWP_PLID before scomming the OCMBs.\n        TargetHandle_t sys = nullptr;\n        targetService().getTopLevelTarget(sys);\n        assert(sys != nullptr);\n        sys->setAttr<ATTR_ATTN_POLL_PLID>(1);\n\n        \/\/ 12.7.a exp_omi_train.C\n        TargetHandleList l_ocmbTargetList;\n        getAllChips(l_ocmbTargetList, TYPE_OCMB_CHIP);\n\n        for (const auto & l_ocmb_target : l_ocmbTargetList)\n        {\n            \/\/  call the HWP with each target\n            fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP> l_fapi_ocmb_target\n                (l_ocmb_target);\n\n            \/\/ Only run exp_omi_train on EXPLORER OCMB targets.\n            uint32_t chipId = l_ocmb_target->getAttr< ATTR_CHIP_ID>();\n            if (chipId == POWER_CHIPID::EXPLORER_16)\n            {\n                TRACFCOMP( g_trac_isteps_trace,\n                    \"Start exp_omi_train on target HUID 0x%.8X\",\n                    get_huid(l_ocmb_target) );\n                FAPI_INVOKE_HWP(l_err, exp_omi_train, l_fapi_ocmb_target);\n\n                \/\/  process return code.\n                if ( l_err )\n                {\n                    TRACFCOMP( g_trac_isteps_trace,\n                    \"ERROR : call exp_omi_train HWP(): failed on target 0x%08X.\"\n                        TRACE_ERR_FMT,\n                        get_huid(l_ocmb_target),\n                        TRACE_ERR_ARGS(l_err));\n\n                    \/\/ Capture error\n                    captureError(l_err, l_StepError, HWPF_COMP_ID,\n                                 l_ocmb_target);\n                }\n                else\n                {\n                    TRACFCOMP( g_trac_isteps_trace,\n                        \"SUCCESS :  exp_omi_train HWP on target 0x%.08X\",\n                        get_huid(l_ocmb_target));\n                }\n            }\n            else\n            {\n                \/\/ Skip exp_omi_train call on non-Explorer chips\n                TRACFCOMP( g_trac_isteps_trace,\n                    \"Skipping exp_omi_train HWP on target HUID 0x%.8X, \"\n                    \"chipId 0x%.4X\",\n                    get_huid(l_ocmb_target), chipId );\n            }\n        }\n\n        \/\/ Do not continue if an error was encountered\n        if(!l_StepError.isNull())\n        {\n            TRACFCOMP( g_trac_isteps_trace,\n                INFO_MRK \"call_omi_io_run_training exited early because \"\n                \"exp_omi_train had failures\" );\n            break;\n        }\n\n        \/\/ 12.7.b p10_omi_train.C\n        TargetHandleList l_omicTargetList;\n        getAllChiplets(l_omicTargetList, TYPE_OMIC);\n\n        for (const auto & l_omic_target : l_omicTargetList)\n        {\n            TRACFCOMP(g_trac_isteps_trace, \"p10_omi_train HWP target HUID %.8x\",\n                get_huid(l_omic_target));\n\n            \/\/  call the HWP with each OMIC target\n            fapi2::Target<fapi2::TARGET_TYPE_OMIC>\n                l_fapi_omic_target(l_omic_target);\n\n            FAPI_INVOKE_HWP(l_err, p10_omi_train, l_fapi_omic_target );\n\n            \/\/  process return code.\n            if ( l_err )\n            {\n                TRACFCOMP( g_trac_isteps_trace,\n                    \"ERROR : call p10_omi_train HWP: failed on target 0x%08X. \"\n                    TRACE_ERR_FMT,\n                    get_huid(l_omic_target),\n                    TRACE_ERR_ARGS(l_err));\n\n                \/\/ Capture error\n                captureError(l_err, l_StepError, HWPF_COMP_ID, l_omic_target);\n            }\n            else\n            {\n                TRACFCOMP( g_trac_isteps_trace,\n                        \"SUCCESS :  p10_omi_train HWP on 0x%.08X\",\n                        get_huid(l_omic_target));\n            }\n        }\n    } while (0);\n\n    TRACFCOMP( g_trac_isteps_trace, \"call_omi_io_run_training exit\" );\n\n    \/\/ end task, returning any errorlogs to IStepDisp\n    return l_StepError.getErrorHandle();\n}\n\n};\n<commit_msg>Swap order of exp_omi_train and p10_omi_train<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/isteps\/istep12\/call_omi_io_run_training.C $           *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2021                        *\/\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    call_omi_io_run_training.C\n *\n *  Contains the HWP wrapper for Istep 12.7\n *      exp_omi_train\n *      p10_omi_train\n *\/\n#include    <stdint.h>\n\n#include    <trace\/interface.H>\n#include    <initservice\/taskargs.H>\n#include    <errl\/errlentry.H>\n\n#include    <isteps\/hwpisteperror.H>\n#include    <errl\/errludtarget.H>\n\n#include    <initservice\/isteps_trace.H>\n#include    <istepHelperFuncs.H>        \/\/ captureError\n\n\/\/Fapi Support\n#include    <config.h>\n#include    <fapi2.H>\n#include    <fapi2\/plat_hwp_invoker.H>\n\n\/\/HWP\n#include    <exp_omi_train.H>\n#include    <p10_omi_train.H>\n#include    <chipids.H>                 \/\/ for EXPLORER ID\n\nusing   namespace   ISTEP;\nusing   namespace   ISTEP_ERROR;\nusing   namespace   ERRORLOG;\nusing   namespace   TARGETING;\nusing   namespace   ERRORLOG;\nusing   namespace   ISTEPS_TRACE;\n\nnamespace ISTEP_12\n{\n\nvoid* call_omi_io_run_training (void *io_pArgs)\n{\n    IStepError l_StepError;\n    errlHndl_t l_err = nullptr;\n    TRACFCOMP( g_trac_isteps_trace, \"call_omi_io_run_training entry\" );\n\n    do\n    {\n        \/\/ Starting beginning at this istep, we may be unable to scom the OCMBs\n        \/\/ until the next istep is complete, except in certain cases where the\n        \/\/ hardware procedure fails. Set ATTR_ATTN_POLL_PLID so ATTN knows to\n        \/\/ poll the PRD_HWP_PLID before scomming the OCMBs.\n        TargetHandle_t sys = nullptr;\n        targetService().getTopLevelTarget(sys);\n        assert(sys != nullptr);\n        sys->setAttr<ATTR_ATTN_POLL_PLID>(1);\n\n        \/\/ 12.7.a p10_omi_train.C\n        TargetHandleList l_omicTargetList;\n        getAllChiplets(l_omicTargetList, TYPE_OMIC);\n\n        for (const auto & l_omic_target : l_omicTargetList)\n        {\n            TRACFCOMP(g_trac_isteps_trace, \"p10_omi_train HWP target HUID %.8x\",\n                get_huid(l_omic_target));\n\n            \/\/  call the HWP with each OMIC target\n            fapi2::Target<fapi2::TARGET_TYPE_OMIC>\n                l_fapi_omic_target(l_omic_target);\n\n            FAPI_INVOKE_HWP(l_err, p10_omi_train, l_fapi_omic_target );\n\n            \/\/  process return code.\n            if ( l_err )\n            {\n                TRACFCOMP( g_trac_isteps_trace,\n                    \"ERROR : call p10_omi_train HWP: failed on target 0x%08X. \"\n                    TRACE_ERR_FMT,\n                    get_huid(l_omic_target),\n                    TRACE_ERR_ARGS(l_err));\n\n                \/\/ Capture error\n                captureError(l_err, l_StepError, HWPF_COMP_ID, l_omic_target);\n            }\n            else\n            {\n                TRACFCOMP( g_trac_isteps_trace,\n                        \"SUCCESS :  p10_omi_train HWP on 0x%.08X\",\n                        get_huid(l_omic_target));\n            }\n        }\n\n        \/\/ Do not continue if an error was encountered\n        if(!l_StepError.isNull())\n        {\n            TRACFCOMP( g_trac_isteps_trace,\n                INFO_MRK \"call_omi_io_run_training exited early because \"\n                \"p10_omi_train had failures\" );\n            break;\n        }\n\n        \/\/ 12.7.b exp_omi_train.C\n        TargetHandleList l_ocmbTargetList;\n        getAllChips(l_ocmbTargetList, TYPE_OCMB_CHIP);\n\n        for (const auto & l_ocmb_target : l_ocmbTargetList)\n        {\n            \/\/  call the HWP with each target\n            fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP> l_fapi_ocmb_target\n                (l_ocmb_target);\n\n            \/\/ Only run exp_omi_train on EXPLORER OCMB targets.\n            uint32_t chipId = l_ocmb_target->getAttr< ATTR_CHIP_ID>();\n            if (chipId == POWER_CHIPID::EXPLORER_16)\n            {\n                TRACFCOMP( g_trac_isteps_trace,\n                    \"Start exp_omi_train on target HUID 0x%.8X\",\n                    get_huid(l_ocmb_target) );\n                FAPI_INVOKE_HWP(l_err, exp_omi_train, l_fapi_ocmb_target);\n\n                \/\/  process return code.\n                if ( l_err )\n                {\n                    TRACFCOMP( g_trac_isteps_trace,\n                    \"ERROR : call exp_omi_train HWP(): failed on target 0x%08X.\"\n                        TRACE_ERR_FMT,\n                        get_huid(l_ocmb_target),\n                        TRACE_ERR_ARGS(l_err));\n\n                    \/\/ Capture error\n                    captureError(l_err, l_StepError, HWPF_COMP_ID,\n                                 l_ocmb_target);\n                }\n                else\n                {\n                    TRACFCOMP( g_trac_isteps_trace,\n                        \"SUCCESS :  exp_omi_train HWP on target 0x%.08X\",\n                        get_huid(l_ocmb_target));\n                }\n            }\n            else\n            {\n                \/\/ Skip exp_omi_train call on non-Explorer chips\n                TRACFCOMP( g_trac_isteps_trace,\n                    \"Skipping exp_omi_train HWP on target HUID 0x%.8X, \"\n                    \"chipId 0x%.4X\",\n                    get_huid(l_ocmb_target), chipId );\n            }\n        }\n\n    } while (0);\n\n    TRACFCOMP( g_trac_isteps_trace, \"call_omi_io_run_training exit\" );\n\n    \/\/ end task, returning any errorlogs to IStepDisp\n    return l_StepError.getErrorHandle();\n}\n\n};\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"JournalingObjectStore.h\"\n\n#include \"config.h\"\n\n#define DOUT_SUBSYS journal\n#undef dout_prefix\n#define dout_prefix *_dout << dbeginl << \"journal \"\n\n\n\nvoid JournalingObjectStore::journal_start()\n{\n  dout(10) << \"journal_start\" << dendl;\n  finisher.start();\n}\n \nvoid JournalingObjectStore::journal_stop() \n{\n  dout(10) << \"journal_stop\" << dendl;\n  finisher.stop();\n  if (journal) {\n    journal->close();\n    delete journal;\n    journal = 0;\n  }\n}\n\nint JournalingObjectStore::journal_replay(uint64_t fs_op_seq)\n{\n  dout(10) << \"journal_replay fs op_seq \" << fs_op_seq << dendl;\n  op_seq = fs_op_seq;\n\n  if (!journal)\n    return 0;\n\n  int err = journal->open(op_seq+1);\n  if (err < 0) {\n    char buf[80];\n    dout(3) << \"journal_replay open failed with \" \n\t    << strerror_r(-err, buf, sizeof(buf)) << dendl;\n    delete journal;\n    journal = 0;\n    return err;\n  }\n\n  int count = 0;\n  while (1) {\n    bufferlist bl;\n    uint64_t seq = op_seq + 1;\n    if (!journal->read_entry(bl, seq)) {\n      dout(3) << \"journal_replay: end of journal, done.\" << dendl;\n      break;\n    }\n\n    if (seq <= op_seq) {\n      dout(3) << \"journal_replay: skipping old op seq \" << seq << \" <= \" << op_seq << dendl;\n      continue;\n    }\n    assert(op_seq == seq-1);\n    \n    dout(3) << \"journal_replay: applying op seq \" << seq << \" (op_seq \" << op_seq << \")\" << dendl;\n    bufferlist::iterator p = bl.begin();\n    list<Transaction*> tls;\n    while (!p.end()) {\n      Transaction *t = new Transaction(p);\n      tls.push_back(t);\n    }\n    int r = apply_transactions(tls);\n    while (!tls.empty()) {\n      delete tls.front(); \n      tls.pop_front();\n    }\n\n    dout(3) << \"journal_replay: r = \" << r << \", op now seq \" << op_seq << dendl;\n    assert(op_seq == seq);\n    seq++;  \/\/ we expect the next op\n  }\n\n  committed_seq = op_seq;\n\n  \/\/ done reading, make writeable.\n  journal->make_writeable();\n\n  return count;\n}\n\n\n\/\/ ------------------------------------\n\nuint64_t JournalingObjectStore::op_apply_start(uint64_t op) \n{\n  lock.Lock();\n  while (blocked) {\n    dout(10) << \"op_apply_start blocked\" << dendl;\n    cond.Wait(lock);\n  }\n  open_ops++;\n\n  if (!op)\n    op = ++op_seq;\n  dout(10) << \"op_apply_start \" << op << dendl;\n\n  lock.Unlock();\n  return op;\n}\n\nvoid JournalingObjectStore::op_apply_finish(uint64_t op) \n{\n  dout(10) << \"op_apply_finish\" << dendl;\n  lock.Lock();\n  if (--open_ops == 0)\n    cond.Signal();\n\n  \/\/ there can be multiple applies in flight; track the max value we\n  \/\/ note.  note that we can't _read_ this value and learn anything\n  \/\/ meaningful unless\/until we've quiesced all in-flight applies.\n  if (op > applied_seq)\n    applied_seq = op;\n\n  lock.Unlock();\n}\n\nuint64_t JournalingObjectStore::op_journal_start(uint64_t op)\n{\n  journal_lock.Lock();\n  if (!op) {\n    lock.Lock();\n    op = ++op_seq;\n    lock.Unlock();\n  }\n  return op;\n}\n\nvoid JournalingObjectStore::op_journal_finish()\n{\n  journal_lock.Unlock();\n}\n\n\n\/\/ ------------------------------------------\n\nbool JournalingObjectStore::commit_start() \n{\n  \/\/ suspend new ops...\n  Mutex::Locker l(lock);\n\n  dout(10) << \"commit_start\" << dendl;\n  blocked = true;\n  while (open_ops > 0) {\n    dout(10) << \"commit_start blocked, waiting for \" << open_ops << \" open ops\" << dendl;\n    cond.Wait(lock);\n  }\n  \n  if (op_seq == committed_seq) {\n    dout(10) << \"commit_start nothing to do\" << dendl;\n    blocked = false;\n    cond.Signal();\n    assert(commit_waiters.empty());\n    return false;\n  }\n\n  \/\/ we can _only_ read applied_seq here because open_ops == 0 (we've\n  \/\/ quiesced all in-flight applies).\n  committing_seq = applied_seq;\n\n  dout(10) << \"commit_start committing \" << committing_seq << \", still blocked\" << dendl;\n  return true;\n}\n\nvoid JournalingObjectStore::commit_started() \n{\n  Mutex::Locker l(lock);\n  \/\/ allow new ops. (underlying fs should now be committing all prior ops)\n  dout(10) << \"commit_started committing \" << committing_seq << \", unblocking\" << dendl;\n  blocked = false;\n  cond.Signal();\n}\n\nvoid JournalingObjectStore::commit_finish()\n{\n  Mutex::Locker l(lock);\n  dout(10) << \"commit_finish thru \" << committing_seq << dendl;\n  \n  if (journal)\n    journal->committed_thru(committing_seq);\n  committed_seq = committing_seq;\n  \n  map<version_t, vector<Context*> >::iterator p = commit_waiters.begin();\n  while (p != commit_waiters.end() &&\n\t p->first <= committing_seq) {\n    finisher.queue(p->second);\n    commit_waiters.erase(p++);\n  }\n}\n\nvoid JournalingObjectStore::journal_transaction(ObjectStore::Transaction& t, uint64_t op,\n\t\t\t\t\t\tContext *onjournal)\n{\n  Mutex::Locker l(lock);\n  dout(10) << \"journal_transaction \" << op << dendl;\n  if (journal && journal->is_writeable()) {\n    bufferlist tbl;\n    t.encode(tbl);\n\n    int alignment = -1;\n    if ((int)t.get_data_length() >= g_conf.journal_align_min_size)\n      alignment = t.get_data_alignment();\n\n    journal->submit_entry(op, tbl, alignment, onjournal);\n  } else if (onjournal)\n    commit_waiters[op].push_back(onjournal);\n}\n\nvoid JournalingObjectStore::journal_transactions(list<ObjectStore::Transaction*>& tls, uint64_t op,\n\t\t\t\t\t\t Context *onjournal)\n{\n  Mutex::Locker l(lock);\n  dout(10) << \"journal_transactions \" << op << dendl;\n    \n  if (journal && journal->is_writeable()) {\n    bufferlist tbl;\n    unsigned data_len = 0, data_align = 0;\n    for (list<ObjectStore::Transaction*>::iterator p = tls.begin(); p != tls.end(); p++) {\n      ObjectStore::Transaction *t = *p;\n      if (t->get_data_length() > data_len &&\n\t  (int)t->get_data_length() >= g_conf.journal_align_min_size) {\n\tdata_len = t->get_data_length();\n\tdata_align = (t->get_data_alignment() - tbl.length()) & ~PAGE_MASK;\n      }\n      t->encode(tbl);\n    }\n    journal->submit_entry(op, tbl, data_align, onjournal);\n  } else if (onjournal)\n    commit_waiters[op].push_back(onjournal);\n}\n<commit_msg>journal: initialize applied_seq during journal replay<commit_after>\n#include \"JournalingObjectStore.h\"\n\n#include \"config.h\"\n\n#define DOUT_SUBSYS journal\n#undef dout_prefix\n#define dout_prefix *_dout << dbeginl << \"journal \"\n\n\n\nvoid JournalingObjectStore::journal_start()\n{\n  dout(10) << \"journal_start\" << dendl;\n  finisher.start();\n}\n \nvoid JournalingObjectStore::journal_stop() \n{\n  dout(10) << \"journal_stop\" << dendl;\n  finisher.stop();\n  if (journal) {\n    journal->close();\n    delete journal;\n    journal = 0;\n  }\n}\n\nint JournalingObjectStore::journal_replay(uint64_t fs_op_seq)\n{\n  dout(10) << \"journal_replay fs op_seq \" << fs_op_seq << dendl;\n  op_seq = fs_op_seq;\n  committed_seq = op_seq;\n  applied_seq = fs_op_seq;\n\n  if (!journal)\n    return 0;\n\n  int err = journal->open(op_seq+1);\n  if (err < 0) {\n    char buf[80];\n    dout(3) << \"journal_replay open failed with \" \n\t    << strerror_r(-err, buf, sizeof(buf)) << dendl;\n    delete journal;\n    journal = 0;\n    return err;\n  }\n\n  int count = 0;\n  while (1) {\n    bufferlist bl;\n    uint64_t seq = op_seq + 1;\n    if (!journal->read_entry(bl, seq)) {\n      dout(3) << \"journal_replay: end of journal, done.\" << dendl;\n      break;\n    }\n\n    if (seq <= op_seq) {\n      dout(3) << \"journal_replay: skipping old op seq \" << seq << \" <= \" << op_seq << dendl;\n      continue;\n    }\n    assert(op_seq == seq-1);\n    \n    dout(3) << \"journal_replay: applying op seq \" << seq << \" (op_seq \" << op_seq << \")\" << dendl;\n    bufferlist::iterator p = bl.begin();\n    list<Transaction*> tls;\n    while (!p.end()) {\n      Transaction *t = new Transaction(p);\n      tls.push_back(t);\n    }\n    int r = apply_transactions(tls);\n    while (!tls.empty()) {\n      delete tls.front(); \n      tls.pop_front();\n    }\n\n    dout(3) << \"journal_replay: r = \" << r << \", op now seq \" << op_seq << dendl;\n    assert(op_seq == seq);\n    seq++;  \/\/ we expect the next op\n  }\n\n  committed_seq = op_seq;\n  applied_seq = op_seq;\n\n  \/\/ done reading, make writeable.\n  journal->make_writeable();\n\n  return count;\n}\n\n\n\/\/ ------------------------------------\n\nuint64_t JournalingObjectStore::op_apply_start(uint64_t op) \n{\n  lock.Lock();\n  while (blocked) {\n    dout(10) << \"op_apply_start blocked\" << dendl;\n    cond.Wait(lock);\n  }\n  open_ops++;\n\n  if (!op)\n    op = ++op_seq;\n  dout(10) << \"op_apply_start \" << op << dendl;\n\n  lock.Unlock();\n  return op;\n}\n\nvoid JournalingObjectStore::op_apply_finish(uint64_t op) \n{\n  dout(10) << \"op_apply_finish\" << dendl;\n  lock.Lock();\n  if (--open_ops == 0)\n    cond.Signal();\n\n  \/\/ there can be multiple applies in flight; track the max value we\n  \/\/ note.  note that we can't _read_ this value and learn anything\n  \/\/ meaningful unless\/until we've quiesced all in-flight applies.\n  if (op > applied_seq)\n    applied_seq = op;\n\n  lock.Unlock();\n}\n\nuint64_t JournalingObjectStore::op_journal_start(uint64_t op)\n{\n  journal_lock.Lock();\n  if (!op) {\n    lock.Lock();\n    op = ++op_seq;\n    lock.Unlock();\n  }\n  return op;\n}\n\nvoid JournalingObjectStore::op_journal_finish()\n{\n  journal_lock.Unlock();\n}\n\n\n\/\/ ------------------------------------------\n\nbool JournalingObjectStore::commit_start() \n{\n  \/\/ suspend new ops...\n  Mutex::Locker l(lock);\n\n  dout(10) << \"commit_start\" << dendl;\n  blocked = true;\n  while (open_ops > 0) {\n    dout(10) << \"commit_start blocked, waiting for \" << open_ops << \" open ops\" << dendl;\n    cond.Wait(lock);\n  }\n  \n  if (op_seq == committed_seq) {\n    dout(10) << \"commit_start nothing to do\" << dendl;\n    blocked = false;\n    cond.Signal();\n    assert(commit_waiters.empty());\n    return false;\n  }\n\n  \/\/ we can _only_ read applied_seq here because open_ops == 0 (we've\n  \/\/ quiesced all in-flight applies).\n  committing_seq = applied_seq;\n\n  dout(10) << \"commit_start committing \" << committing_seq << \", still blocked\" << dendl;\n  return true;\n}\n\nvoid JournalingObjectStore::commit_started() \n{\n  Mutex::Locker l(lock);\n  \/\/ allow new ops. (underlying fs should now be committing all prior ops)\n  dout(10) << \"commit_started committing \" << committing_seq << \", unblocking\" << dendl;\n  blocked = false;\n  cond.Signal();\n}\n\nvoid JournalingObjectStore::commit_finish()\n{\n  Mutex::Locker l(lock);\n  dout(10) << \"commit_finish thru \" << committing_seq << dendl;\n  \n  if (journal)\n    journal->committed_thru(committing_seq);\n  committed_seq = committing_seq;\n  \n  map<version_t, vector<Context*> >::iterator p = commit_waiters.begin();\n  while (p != commit_waiters.end() &&\n\t p->first <= committing_seq) {\n    finisher.queue(p->second);\n    commit_waiters.erase(p++);\n  }\n}\n\nvoid JournalingObjectStore::journal_transaction(ObjectStore::Transaction& t, uint64_t op,\n\t\t\t\t\t\tContext *onjournal)\n{\n  Mutex::Locker l(lock);\n  dout(10) << \"journal_transaction \" << op << dendl;\n  if (journal && journal->is_writeable()) {\n    bufferlist tbl;\n    t.encode(tbl);\n\n    int alignment = -1;\n    if ((int)t.get_data_length() >= g_conf.journal_align_min_size)\n      alignment = t.get_data_alignment();\n\n    journal->submit_entry(op, tbl, alignment, onjournal);\n  } else if (onjournal)\n    commit_waiters[op].push_back(onjournal);\n}\n\nvoid JournalingObjectStore::journal_transactions(list<ObjectStore::Transaction*>& tls, uint64_t op,\n\t\t\t\t\t\t Context *onjournal)\n{\n  Mutex::Locker l(lock);\n  dout(10) << \"journal_transactions \" << op << dendl;\n    \n  if (journal && journal->is_writeable()) {\n    bufferlist tbl;\n    unsigned data_len = 0, data_align = 0;\n    for (list<ObjectStore::Transaction*>::iterator p = tls.begin(); p != tls.end(); p++) {\n      ObjectStore::Transaction *t = *p;\n      if (t->get_data_length() > data_len &&\n\t  (int)t->get_data_length() >= g_conf.journal_align_min_size) {\n\tdata_len = t->get_data_length();\n\tdata_align = (t->get_data_alignment() - tbl.length()) & ~PAGE_MASK;\n      }\n      t->encode(tbl);\n    }\n    journal->submit_entry(op, tbl, data_align, onjournal);\n  } else if (onjournal)\n    commit_waiters[op].push_back(onjournal);\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  \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 file.\n\n\/\/ Base include file.  Must be first.\n#include <xalanc\/PlatformSupport\/PlatformSupportDefinitions.hpp>\n\n#include <xalanc\/PlatformSupport\/DOMStringHelper.hpp>\n#include <xalanc\/PlatformSupport\/XalanMessageLoader.hpp>\n\n#include <xalanc\/Utils\/XalanMsgLib\/XalanMsgLib.hpp>\n\n#include <xercesc\/util\/XMLString.hpp>\n\n#if defined (XALAN_INMEM_MSG_LOADER)\n#include <xalanc\/PlatformSupport\/XalanInMemoryMessageLoader.hpp>\n#elif defined (XALAN_ICU_MSG_LOADER)\n#include <xalanc\/PlatformSupport\/XalanICUMessageLoader.hpp>\n#elif defined (XALAN_NLS_MSG_LOADER)\n#include <xalanc\/PlatformSupport\/XalanNLSMessageLoader.hpp>\n#else\n#error You must provide a message loader\n#endif\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\n#define MAX_MESSAGE_LEN 1024\n\n\nXalanMessageLoader*     XalanMessageLoader::s_msgLoader = 0;\n\nstatic MemoryManager*      s_initManager;\n\nXalanMessageLoader::~XalanMessageLoader()\n{\n}\n\n\n\nvoid\nXalanMessageLoader::initialize(MemoryManager&      theManager)\n{\n#if defined (XALAN_INMEM_MSG_LOADER)\n        typedef XalanMessageLoader::XalanMessageLoaderCreateFunct <XalanInMemoryMessageLoader> LoaderCreatorType;\n#elif defined (XALAN_ICU_MSG_LOADER)\n        typedef XalanMessageLoader::XalanMessageLoaderCreateFunct <XalanICUMessageLoader> LoaderCreatorType;\n#elif defined (XALAN_NLS_MSG_LOADER)\n        typedef XalanMessageLoader::XalanMessageLoaderCreateFunct <XalanNLSMessageLoader> LoaderCreatorType;\n#else\n#error You must provide a message loader\n#endif\n\n    if (s_msgLoader == 0)\n    {\n        s_initManager = &theManager;\n\n        s_msgLoader = LoaderCreatorType()(theManager);\n    }\n\n    assert(s_msgLoader != 0);\n}\n\n\n\nvoid\nXalanMessageLoader::terminate()\n{\n\n    typedef XalanMessageLoader::XalanMessageLoaderDestructFunct LoaderDestructType;\n\n    assert(s_initManager != 0);\n    \n    LoaderDestructType()(*s_initManager, s_msgLoader);\n\n    s_msgLoader = 0;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const XalanDOMString&   repText1 )\n{\n    assert(s_msgLoader != 0);\n\n    XalanDOMChar    sBuffer[MAX_MESSAGE_LEN];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        MAX_MESSAGE_LEN,\n        repText1.c_str());\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const XalanDOMString&   repText1, \n            const XalanDOMString&   repText2)\n{\n    assert(s_msgLoader != 0);\n\n    XalanDOMChar    sBuffer[MAX_MESSAGE_LEN];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        MAX_MESSAGE_LEN,\n        repText1.c_str(),\n        repText2.c_str());\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const XalanDOMString&   repText1 ,\n            const XalanDOMString&   repText2 ,\n            const XalanDOMString&   repText3)\n{\n    assert(s_msgLoader != 0);\n\n    XalanDOMChar    sBuffer[MAX_MESSAGE_LEN];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        MAX_MESSAGE_LEN,\n        repText1.c_str(),\n        repText2.c_str(),\n        repText3.c_str());\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad)\n\n{\n    assert(s_msgLoader != 0);\n\n    XalanDOMChar    sBuffer[MAX_MESSAGE_LEN];\n\n    s_msgLoader->loadMsg(msgToLoad,\n                            sBuffer,\n                            MAX_MESSAGE_LEN) ;\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nbool\nXalanMessageLoader::load(\n            XalanMessages::Codes    msgToLoad,\n            MemoryManager&          theMemoryManager,\n            XalanDOMChar*           toFill,\n            XalanSize_t             maxChars,\n            const XalanDOMChar*     repText1, \n            const XalanDOMChar*     repText2, \n            const XalanDOMChar*     repText3,\n            const XalanDOMChar*     repText4) \n{\n    \/\/ Call the other version to load up the message\n    if (!loadMsg(msgToLoad, toFill, maxChars))\n        return false;\n\n    XALAN_USING_XERCES(XMLString)\n\n    \/\/ And do the token replacement\n    XMLString::replaceTokens(\n        toFill,\n        maxChars,\n        repText1,\n        repText2,\n        repText3,\n        repText4,\n        &theMemoryManager);\n\n    return true;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const char*             repText1,\n            const char*             repText2,\n            const char*             repText3,\n            const char*             repText4)\n{\n    XalanDOMChar    sBuffer[MAX_MESSAGE_LEN];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        MAX_MESSAGE_LEN,\n        repText1,\n        repText2,\n        repText3,\n        repText4);\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const XalanDOMChar*     repText1, \n            const XalanDOMChar*     repText2,\n            const XalanDOMChar*     repText3,\n            const XalanDOMChar*     repText4)\n{\n    XalanDOMChar    sBuffer[MAX_MESSAGE_LEN];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        MAX_MESSAGE_LEN,\n        repText1,\n        repText2,\n        repText3,\n        repText4);\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nbool \nXalanMessageLoader::load(\n            XalanMessages::Codes    msgToLoad,\n            MemoryManager&      theManager,\n            XalanDOMChar*           toFill,\n            XalanSize_t             maxChars,\n            const char*             repText1, \n            const char*             repText2, \n            const char*             repText3, \n            const char*             repText4)\n{\n    XalanDOMString theFirstParam(theManager);\n    if (repText1 != 0)\n    {\n        theFirstParam.assign(repText1);\n    }\n\n    XalanDOMString theSecParam(theManager);\n    if (repText2 != 0)\n    {\n        theSecParam.assign(repText2);\n    }\n\n    XalanDOMString theThirdParam(theManager);\n    if( repText3 != 0)\n    {\n        theThirdParam.assign(repText3);\n    }\n\n    XalanDOMString theForthParam(theManager);\n    if (repText4 != 0)\n    {\n        theForthParam.assign(repText4);\n    }\n\n    return load(\n                msgToLoad,\n                theManager,\n                toFill,\n                maxChars,\n                theFirstParam.c_str(),\n                theSecParam.c_str(),\n                theThirdParam.c_str(),\n                theForthParam.c_str());\n}\n\n\n\nXALAN_CPP_NAMESPACE_END\n<commit_msg>Fixed buffer overflow problem with XMLString::replaceTokens. See XALANC-698.<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  \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 file.\n\n\/\/ Base include file.  Must be first.\n#include <xalanc\/PlatformSupport\/PlatformSupportDefinitions.hpp>\n\n#include <xalanc\/PlatformSupport\/DOMStringHelper.hpp>\n#include <xalanc\/PlatformSupport\/XalanMessageLoader.hpp>\n\n#include <xalanc\/Utils\/XalanMsgLib\/XalanMsgLib.hpp>\n\n#include <xercesc\/util\/XMLString.hpp>\n\n#if defined (XALAN_INMEM_MSG_LOADER)\n#include <xalanc\/PlatformSupport\/XalanInMemoryMessageLoader.hpp>\n#elif defined (XALAN_ICU_MSG_LOADER)\n#include <xalanc\/PlatformSupport\/XalanICUMessageLoader.hpp>\n#elif defined (XALAN_NLS_MSG_LOADER)\n#include <xalanc\/PlatformSupport\/XalanNLSMessageLoader.hpp>\n#else\n#error You must provide a message loader\n#endif\n\nXALAN_CPP_NAMESPACE_BEGIN\n\nstatic const size_t kMaxMessageLength = 1024;\n\nXalanMessageLoader*     XalanMessageLoader::s_msgLoader = 0;\n\nstatic MemoryManager*      s_initManager;\n\nXalanMessageLoader::~XalanMessageLoader()\n{\n}\n\n\n\nvoid\nXalanMessageLoader::initialize(MemoryManager&      theManager)\n{\n#if defined (XALAN_INMEM_MSG_LOADER)\n        typedef XalanMessageLoader::XalanMessageLoaderCreateFunct <XalanInMemoryMessageLoader> LoaderCreatorType;\n#elif defined (XALAN_ICU_MSG_LOADER)\n        typedef XalanMessageLoader::XalanMessageLoaderCreateFunct <XalanICUMessageLoader> LoaderCreatorType;\n#elif defined (XALAN_NLS_MSG_LOADER)\n        typedef XalanMessageLoader::XalanMessageLoaderCreateFunct <XalanNLSMessageLoader> LoaderCreatorType;\n#else\n#error You must provide a message loader\n#endif\n\n    if (s_msgLoader == 0)\n    {\n        s_initManager = &theManager;\n\n        s_msgLoader = LoaderCreatorType()(theManager);\n    }\n\n    assert(s_msgLoader != 0);\n}\n\n\n\nvoid\nXalanMessageLoader::terminate()\n{\n\n    typedef XalanMessageLoader::XalanMessageLoaderDestructFunct LoaderDestructType;\n\n    assert(s_initManager != 0);\n    \n    LoaderDestructType()(*s_initManager, s_msgLoader);\n\n    s_msgLoader = 0;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const XalanDOMString&   repText1 )\n{\n    assert(s_msgLoader != 0);\n\n    XalanDOMChar    sBuffer[kMaxMessageLength + 1];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        kMaxMessageLength,\n        repText1.c_str());\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const XalanDOMString&   repText1, \n            const XalanDOMString&   repText2)\n{\n    assert(s_msgLoader != 0);\n\n    XalanDOMChar    sBuffer[kMaxMessageLength + 1];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        kMaxMessageLength,\n        repText1.c_str(),\n        repText2.c_str());\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const XalanDOMString&   repText1 ,\n            const XalanDOMString&   repText2 ,\n            const XalanDOMString&   repText3)\n{\n    assert(s_msgLoader != 0);\n\n    XalanDOMChar    sBuffer[kMaxMessageLength + 1];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        kMaxMessageLength,\n        repText1.c_str(),\n        repText2.c_str(),\n        repText3.c_str());\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad)\n\n{\n    assert(s_msgLoader != 0);\n\n    XalanDOMChar    sBuffer[kMaxMessageLength + 1];\n\n    s_msgLoader->loadMsg(msgToLoad,\n                            sBuffer,\n                            kMaxMessageLength) ;\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nbool\nXalanMessageLoader::load(\n            XalanMessages::Codes    msgToLoad,\n            MemoryManager&          theMemoryManager,\n            XalanDOMChar*           toFill,\n            XalanSize_t             maxChars,\n            const XalanDOMChar*     repText1, \n            const XalanDOMChar*     repText2, \n            const XalanDOMChar*     repText3,\n            const XalanDOMChar*     repText4) \n{\n    \/\/ Call the other version to load up the message\n    if (!loadMsg(msgToLoad, toFill, maxChars))\n        return false;\n\n    XALAN_USING_XERCES(XMLString)\n\n    \/\/ And do the token replacement\n    XMLString::replaceTokens(\n        toFill,\n        maxChars,\n        repText1,\n        repText2,\n        repText3,\n        repText4,\n        &theMemoryManager);\n\n    return true;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const char*             repText1,\n            const char*             repText2,\n            const char*             repText3,\n            const char*             repText4)\n{\n    XalanDOMChar    sBuffer[kMaxMessageLength + 1];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        kMaxMessageLength,\n        repText1,\n        repText2,\n        repText3,\n        repText4);\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nXalanDOMString&\nXalanMessageLoader::getMessage(\n            XalanDOMString&         theResultMessage,\n            XalanMessages::Codes    msgToLoad,\n            const XalanDOMChar*     repText1, \n            const XalanDOMChar*     repText2,\n            const XalanDOMChar*     repText3,\n            const XalanDOMChar*     repText4)\n{\n    XalanDOMChar    sBuffer[kMaxMessageLength + 1];\n\n    s_msgLoader->load(\n        msgToLoad,\n        theResultMessage.getMemoryManager(),\n        sBuffer,\n        kMaxMessageLength,\n        repText1,\n        repText2,\n        repText3,\n        repText4);\n\n    theResultMessage.assign(sBuffer);\n\n    return theResultMessage;\n}\n\n\n\nbool \nXalanMessageLoader::load(\n            XalanMessages::Codes    msgToLoad,\n            MemoryManager&      theManager,\n            XalanDOMChar*           toFill,\n            XalanSize_t             maxChars,\n            const char*             repText1, \n            const char*             repText2, \n            const char*             repText3, \n            const char*             repText4)\n{\n    XalanDOMString theFirstParam(theManager);\n    if (repText1 != 0)\n    {\n        theFirstParam.assign(repText1);\n    }\n\n    XalanDOMString theSecParam(theManager);\n    if (repText2 != 0)\n    {\n        theSecParam.assign(repText2);\n    }\n\n    XalanDOMString theThirdParam(theManager);\n    if( repText3 != 0)\n    {\n        theThirdParam.assign(repText3);\n    }\n\n    XalanDOMString theForthParam(theManager);\n    if (repText4 != 0)\n    {\n        theForthParam.assign(repText4);\n    }\n\n    return load(\n                msgToLoad,\n                theManager,\n                toFill,\n                maxChars,\n                theFirstParam.c_str(),\n                theSecParam.c_str(),\n                theThirdParam.c_str(),\n                theForthParam.c_str());\n}\n\n\n\nXALAN_CPP_NAMESPACE_END\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,\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#ifdef HAVE_CONFIG_H\n#  include <config.h>\n#endif\n\n#include <arrow-glib\/buffer.hpp>\n#include <arrow-glib\/data-type.hpp>\n#include <arrow-glib\/tensor.hpp>\n#include <arrow-glib\/type.hpp>\n\nG_BEGIN_DECLS\n\n\/**\n * SECTION: tensor\n * @short_description: Tensor class.\n * @include: arrow-glib\/arrow-glib.h\n *\n * #GArrowTensor is a tensor class.\n *\n * Since: 0.3.0\n *\/\n\ntypedef struct GArrowTensorPrivate_ {\n  std::shared_ptr<arrow::Tensor> tensor;\n} GArrowTensorPrivate;\n\nenum {\n  PROP_0,\n  PROP_TENSOR\n};\n\nG_DEFINE_TYPE_WITH_PRIVATE(GArrowTensor, garrow_tensor, G_TYPE_OBJECT)\n\n#define GARROW_TENSOR_GET_PRIVATE(obj)                                   \\\n  (G_TYPE_INSTANCE_GET_PRIVATE((obj), GARROW_TYPE_TENSOR, GArrowTensorPrivate))\n\nstatic void\ngarrow_tensor_finalize(GObject *object)\n{\n  auto priv = GARROW_TENSOR_GET_PRIVATE(object);\n\n  priv->tensor = nullptr;\n\n  G_OBJECT_CLASS(garrow_tensor_parent_class)->finalize(object);\n}\n\nstatic void\ngarrow_tensor_set_property(GObject *object,\n                          guint prop_id,\n                          const GValue *value,\n                          GParamSpec *pspec)\n{\n  auto priv = GARROW_TENSOR_GET_PRIVATE(object);\n\n  switch (prop_id) {\n  case PROP_TENSOR:\n    priv->tensor =\n      *static_cast<std::shared_ptr<arrow::Tensor> *>(g_value_get_pointer(value));\n    break;\n  default:\n    G_OBJECT_WARN_INVALID_PROPERTY_ID(object, prop_id, pspec);\n    break;\n  }\n}\n\nstatic void\ngarrow_tensor_get_property(GObject *object,\n                          guint prop_id,\n                          GValue *value,\n                          GParamSpec *pspec)\n{\n  switch (prop_id) {\n  default:\n    G_OBJECT_WARN_INVALID_PROPERTY_ID(object, prop_id, pspec);\n    break;\n  }\n}\n\nstatic void\ngarrow_tensor_init(GArrowTensor *object)\n{\n}\n\nstatic void\ngarrow_tensor_class_init(GArrowTensorClass *klass)\n{\n  GParamSpec *spec;\n\n  auto gobject_class = G_OBJECT_CLASS(klass);\n\n  gobject_class->finalize     = garrow_tensor_finalize;\n  gobject_class->set_property = garrow_tensor_set_property;\n  gobject_class->get_property = garrow_tensor_get_property;\n\n  spec = g_param_spec_pointer(\"tensor\",\n                              \"Tensor\",\n                              \"The raw std::shared<arrow::Tensor> *\",\n                              static_cast<GParamFlags>(G_PARAM_WRITABLE |\n                                                       G_PARAM_CONSTRUCT_ONLY));\n  g_object_class_install_property(gobject_class, PROP_TENSOR, spec);\n}\n\n\/**\n * garrow_tensor_new:\n * @data_type: A #GArrowDataType that indicates each element type\n *   in the tensor.\n * @data: A #GArrowBuffer that contains tensor data.\n * @shape: (array length=n_dimensions): A list of dimension sizes.\n * @n_dimensions: The number of dimensions.\n * @strides: (array length=n_strides) (nullable): A list of the number of\n *   bytes in each dimension.\n * @n_strides: The number of strides.\n * @dimention_names: (array length=n_dimention_names) (nullable): A list of\n *   dimension names.\n * @n_dimention_names: The number of dimension names\n *\n * Returns: The newly created #GArrowTensor.\n *\n * Since: 0.3.0\n *\/\nGArrowTensor *\ngarrow_tensor_new(GArrowDataType *data_type,\n                  GArrowBuffer *data,\n                  gint64 *shape,\n                  gsize n_dimensions,\n                  gint64 *strides,\n                  gsize n_strides,\n                  gchar **dimension_names,\n                  gsize n_dimension_names)\n{\n  auto arrow_data_type = garrow_data_type_get_raw(data_type);\n  auto arrow_data = garrow_buffer_get_raw(data);\n  std::vector<int64_t> arrow_shape;\n  for (gsize i = 0; i < n_dimensions; ++i) {\n    arrow_shape.push_back(shape[i]);\n  }\n  std::vector<int64_t> arrow_strides;\n  for (gsize i = 0; i < n_strides; ++i) {\n    arrow_strides.push_back(strides[i]);\n  }\n  std::vector<std::string> arrow_dimension_names;\n  for (gsize i = 0; i < n_dimension_names; ++i) {\n    arrow_dimension_names.push_back(dimension_names[i]);\n  }\n  auto arrow_tensor =\n    std::make_shared<arrow::Tensor>(arrow_data_type,\n                                    arrow_data,\n                                    arrow_shape,\n                                    arrow_strides,\n                                    arrow_dimension_names);\n  auto tensor = garrow_tensor_new_raw(&arrow_tensor);\n  return tensor;\n}\n\n\/**\n * garrow_tensor_get_value_data_type:\n * @tensor: A #GArrowTensor.\n *\n * Returns: (transfer full): The data type of each value in the tensor.\n *\n * Since: 0.3.0\n *\/\nGArrowDataType *\ngarrow_tensor_get_value_data_type(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_data_type = arrow_tensor->type();\n  return garrow_data_type_new_raw(&arrow_data_type);\n}\n\n\/**\n * garrow_tensor_get_value_type:\n * @tensor: A #GArrowTensor.\n *\n * Returns: The type of each value in the tensor.\n *\n * Since: 0.3.0\n *\/\nGArrowType\ngarrow_tensor_get_value_type(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_type = arrow_tensor->type_id();\n  return garrow_type_from_raw(arrow_type);\n}\n\n\/**\n * garrow_tensor_get_buffer:\n * @tensor: A #GArrowTensor.\n *\n * Returns: (transfer full): The data of the tensor.\n *\n * Since: 0.3.0\n *\/\nGArrowBuffer *\ngarrow_tensor_get_buffer(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_buffer = arrow_tensor->data();\n  return garrow_buffer_new_raw(&arrow_buffer);\n}\n\n\/**\n * garrow_tensor_get_shape:\n * @tensor: A #GArrowTensor.\n * @n_dimensions: (out): The number of dimensions.\n *\n * Returns: (array length=n_dimensions): The shape of the tensor.\n *   It should be freed with g_free() when no longer needed.\n *\n * Since: 0.3.0\n *\/\ngint64 *\ngarrow_tensor_get_shape(GArrowTensor *tensor, gint *n_dimensions)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_shape = arrow_tensor->shape();\n  auto n_dimensions_raw = arrow_shape.size();\n  auto shape =\n    static_cast<gint64 *>(g_malloc_n(sizeof(gint64), n_dimensions_raw));\n  for (gsize i = 0; i < n_dimensions_raw; ++i) {\n    shape[i] = arrow_shape[i];\n  }\n  *n_dimensions = static_cast<gint>(n_dimensions_raw);\n  return shape;\n}\n\n\/**\n * garrow_tensor_get_strides:\n * @tensor: A #GArrowTensor.\n * @n_strides: (out): The number of strides.\n *\n * Returns: (array length=n_strides): The strides of the tensor.\n *   It should be freed with g_free() when no longer needed.\n *\n * Since: 0.3.0\n *\/\ngint64 *\ngarrow_tensor_get_strides(GArrowTensor *tensor, gint *n_strides)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_strides = arrow_tensor->strides();\n  auto n_strides_raw = arrow_strides.size();\n  auto strides =\n    static_cast<gint64 *>(g_malloc_n(sizeof(gint64), n_strides_raw));\n  for (gsize i = 0; i < n_strides_raw; ++i) {\n    strides[i] = arrow_strides[i];\n  }\n  *n_strides = static_cast<gint>(n_strides_raw);\n  return strides;\n}\n\n\/**\n * garrow_tensor_get_n_dimensions:\n * @tensor: A #GArrowTensor.\n *\n * Returns: The number of dimensions of the tensor.\n *\n * Since: 0.3.0\n *\/\ngint\ngarrow_tensor_get_n_dimensions(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->ndim();\n}\n\n\/**\n * garrow_tensor_get_dimension_name:\n * @tensor: A #GArrowTensor.\n * @i: The index of the target dimension.\n *\n * Returns: The i-th dimension name of the tensor.\n *\n * Since: 0.3.0\n *\/\nconst gchar *\ngarrow_tensor_get_dimension_name(GArrowTensor *tensor, gint i)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_dimension_name = arrow_tensor->dim_name(i);\n  return arrow_dimension_name.c_str();\n}\n\n\/**\n * garrow_tensor_get_size:\n * @tensor: A #GArrowTensor.\n *\n * Returns: The number of value cells in the tensor.\n *\n * Since: 0.3.0\n *\/\ngint64\ngarrow_tensor_get_size(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->size();\n}\n\n\/**\n * garrow_tensor_is_mutable:\n * @tensor: A #GArrowTensor.\n *\n * Returns: %TRUE if the tensor is mutable, %FALSE otherwise.\n *\n * Since: 0.3.0\n *\/\ngboolean\ngarrow_tensor_is_mutable(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->is_mutable();\n}\n\n\/**\n * garrow_tensor_is_contiguous:\n * @tensor: A #GArrowTensor.\n *\n * Returns: %TRUE if the tensor is contiguous, %FALSE otherwise.\n *\n * Since: 0.3.0\n *\/\ngboolean\ngarrow_tensor_is_contiguous(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->is_contiguous();\n}\n\n\/**\n * garrow_tensor_is_row_major:\n * @tensor: A #GArrowTensor.\n *\n * Returns: %TRUE if the tensor is row major a.k.a. C order,\n *   %FALSE otherwise.\n *\n * Since: 0.3.0\n *\/\ngboolean\ngarrow_tensor_is_row_major(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->is_row_major();\n}\n\n\/**\n * garrow_tensor_is_column_major:\n * @tensor: A #GArrowTensor.\n *\n * Returns: %TRUE if the tensor is column major a.k.a. Fortran order,\n *   %FALSE otherwise.\n *\n * Since: 0.3.0\n *\/\ngboolean\ngarrow_tensor_is_column_major(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->is_column_major();\n}\n\nG_END_DECLS\n\nGArrowTensor *\ngarrow_tensor_new_raw(std::shared_ptr<arrow::Tensor> *arrow_tensor)\n{\n  auto tensor = GARROW_TENSOR(g_object_new(GARROW_TYPE_TENSOR,\n                                           \"tensor\", arrow_tensor,\n                                           NULL));\n  return tensor;\n}\n\nstd::shared_ptr<arrow::Tensor>\ngarrow_tensor_get_raw(GArrowTensor *tensor)\n{\n  auto priv = GARROW_TENSOR_GET_PRIVATE(tensor);\n  return priv->tensor;\n}\n<commit_msg>ARROW-903: [GLib] Remove a needless \".\"<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,\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#ifdef HAVE_CONFIG_H\n#  include <config.h>\n#endif\n\n#include <arrow-glib\/buffer.hpp>\n#include <arrow-glib\/data-type.hpp>\n#include <arrow-glib\/tensor.hpp>\n#include <arrow-glib\/type.hpp>\n\nG_BEGIN_DECLS\n\n\/**\n * SECTION: tensor\n * @short_description: Tensor class\n * @include: arrow-glib\/arrow-glib.h\n *\n * #GArrowTensor is a tensor class.\n *\n * Since: 0.3.0\n *\/\n\ntypedef struct GArrowTensorPrivate_ {\n  std::shared_ptr<arrow::Tensor> tensor;\n} GArrowTensorPrivate;\n\nenum {\n  PROP_0,\n  PROP_TENSOR\n};\n\nG_DEFINE_TYPE_WITH_PRIVATE(GArrowTensor, garrow_tensor, G_TYPE_OBJECT)\n\n#define GARROW_TENSOR_GET_PRIVATE(obj)                                   \\\n  (G_TYPE_INSTANCE_GET_PRIVATE((obj), GARROW_TYPE_TENSOR, GArrowTensorPrivate))\n\nstatic void\ngarrow_tensor_finalize(GObject *object)\n{\n  auto priv = GARROW_TENSOR_GET_PRIVATE(object);\n\n  priv->tensor = nullptr;\n\n  G_OBJECT_CLASS(garrow_tensor_parent_class)->finalize(object);\n}\n\nstatic void\ngarrow_tensor_set_property(GObject *object,\n                          guint prop_id,\n                          const GValue *value,\n                          GParamSpec *pspec)\n{\n  auto priv = GARROW_TENSOR_GET_PRIVATE(object);\n\n  switch (prop_id) {\n  case PROP_TENSOR:\n    priv->tensor =\n      *static_cast<std::shared_ptr<arrow::Tensor> *>(g_value_get_pointer(value));\n    break;\n  default:\n    G_OBJECT_WARN_INVALID_PROPERTY_ID(object, prop_id, pspec);\n    break;\n  }\n}\n\nstatic void\ngarrow_tensor_get_property(GObject *object,\n                          guint prop_id,\n                          GValue *value,\n                          GParamSpec *pspec)\n{\n  switch (prop_id) {\n  default:\n    G_OBJECT_WARN_INVALID_PROPERTY_ID(object, prop_id, pspec);\n    break;\n  }\n}\n\nstatic void\ngarrow_tensor_init(GArrowTensor *object)\n{\n}\n\nstatic void\ngarrow_tensor_class_init(GArrowTensorClass *klass)\n{\n  GParamSpec *spec;\n\n  auto gobject_class = G_OBJECT_CLASS(klass);\n\n  gobject_class->finalize     = garrow_tensor_finalize;\n  gobject_class->set_property = garrow_tensor_set_property;\n  gobject_class->get_property = garrow_tensor_get_property;\n\n  spec = g_param_spec_pointer(\"tensor\",\n                              \"Tensor\",\n                              \"The raw std::shared<arrow::Tensor> *\",\n                              static_cast<GParamFlags>(G_PARAM_WRITABLE |\n                                                       G_PARAM_CONSTRUCT_ONLY));\n  g_object_class_install_property(gobject_class, PROP_TENSOR, spec);\n}\n\n\/**\n * garrow_tensor_new:\n * @data_type: A #GArrowDataType that indicates each element type\n *   in the tensor.\n * @data: A #GArrowBuffer that contains tensor data.\n * @shape: (array length=n_dimensions): A list of dimension sizes.\n * @n_dimensions: The number of dimensions.\n * @strides: (array length=n_strides) (nullable): A list of the number of\n *   bytes in each dimension.\n * @n_strides: The number of strides.\n * @dimention_names: (array length=n_dimention_names) (nullable): A list of\n *   dimension names.\n * @n_dimention_names: The number of dimension names\n *\n * Returns: The newly created #GArrowTensor.\n *\n * Since: 0.3.0\n *\/\nGArrowTensor *\ngarrow_tensor_new(GArrowDataType *data_type,\n                  GArrowBuffer *data,\n                  gint64 *shape,\n                  gsize n_dimensions,\n                  gint64 *strides,\n                  gsize n_strides,\n                  gchar **dimension_names,\n                  gsize n_dimension_names)\n{\n  auto arrow_data_type = garrow_data_type_get_raw(data_type);\n  auto arrow_data = garrow_buffer_get_raw(data);\n  std::vector<int64_t> arrow_shape;\n  for (gsize i = 0; i < n_dimensions; ++i) {\n    arrow_shape.push_back(shape[i]);\n  }\n  std::vector<int64_t> arrow_strides;\n  for (gsize i = 0; i < n_strides; ++i) {\n    arrow_strides.push_back(strides[i]);\n  }\n  std::vector<std::string> arrow_dimension_names;\n  for (gsize i = 0; i < n_dimension_names; ++i) {\n    arrow_dimension_names.push_back(dimension_names[i]);\n  }\n  auto arrow_tensor =\n    std::make_shared<arrow::Tensor>(arrow_data_type,\n                                    arrow_data,\n                                    arrow_shape,\n                                    arrow_strides,\n                                    arrow_dimension_names);\n  auto tensor = garrow_tensor_new_raw(&arrow_tensor);\n  return tensor;\n}\n\n\/**\n * garrow_tensor_get_value_data_type:\n * @tensor: A #GArrowTensor.\n *\n * Returns: (transfer full): The data type of each value in the tensor.\n *\n * Since: 0.3.0\n *\/\nGArrowDataType *\ngarrow_tensor_get_value_data_type(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_data_type = arrow_tensor->type();\n  return garrow_data_type_new_raw(&arrow_data_type);\n}\n\n\/**\n * garrow_tensor_get_value_type:\n * @tensor: A #GArrowTensor.\n *\n * Returns: The type of each value in the tensor.\n *\n * Since: 0.3.0\n *\/\nGArrowType\ngarrow_tensor_get_value_type(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_type = arrow_tensor->type_id();\n  return garrow_type_from_raw(arrow_type);\n}\n\n\/**\n * garrow_tensor_get_buffer:\n * @tensor: A #GArrowTensor.\n *\n * Returns: (transfer full): The data of the tensor.\n *\n * Since: 0.3.0\n *\/\nGArrowBuffer *\ngarrow_tensor_get_buffer(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_buffer = arrow_tensor->data();\n  return garrow_buffer_new_raw(&arrow_buffer);\n}\n\n\/**\n * garrow_tensor_get_shape:\n * @tensor: A #GArrowTensor.\n * @n_dimensions: (out): The number of dimensions.\n *\n * Returns: (array length=n_dimensions): The shape of the tensor.\n *   It should be freed with g_free() when no longer needed.\n *\n * Since: 0.3.0\n *\/\ngint64 *\ngarrow_tensor_get_shape(GArrowTensor *tensor, gint *n_dimensions)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_shape = arrow_tensor->shape();\n  auto n_dimensions_raw = arrow_shape.size();\n  auto shape =\n    static_cast<gint64 *>(g_malloc_n(sizeof(gint64), n_dimensions_raw));\n  for (gsize i = 0; i < n_dimensions_raw; ++i) {\n    shape[i] = arrow_shape[i];\n  }\n  *n_dimensions = static_cast<gint>(n_dimensions_raw);\n  return shape;\n}\n\n\/**\n * garrow_tensor_get_strides:\n * @tensor: A #GArrowTensor.\n * @n_strides: (out): The number of strides.\n *\n * Returns: (array length=n_strides): The strides of the tensor.\n *   It should be freed with g_free() when no longer needed.\n *\n * Since: 0.3.0\n *\/\ngint64 *\ngarrow_tensor_get_strides(GArrowTensor *tensor, gint *n_strides)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_strides = arrow_tensor->strides();\n  auto n_strides_raw = arrow_strides.size();\n  auto strides =\n    static_cast<gint64 *>(g_malloc_n(sizeof(gint64), n_strides_raw));\n  for (gsize i = 0; i < n_strides_raw; ++i) {\n    strides[i] = arrow_strides[i];\n  }\n  *n_strides = static_cast<gint>(n_strides_raw);\n  return strides;\n}\n\n\/**\n * garrow_tensor_get_n_dimensions:\n * @tensor: A #GArrowTensor.\n *\n * Returns: The number of dimensions of the tensor.\n *\n * Since: 0.3.0\n *\/\ngint\ngarrow_tensor_get_n_dimensions(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->ndim();\n}\n\n\/**\n * garrow_tensor_get_dimension_name:\n * @tensor: A #GArrowTensor.\n * @i: The index of the target dimension.\n *\n * Returns: The i-th dimension name of the tensor.\n *\n * Since: 0.3.0\n *\/\nconst gchar *\ngarrow_tensor_get_dimension_name(GArrowTensor *tensor, gint i)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  auto arrow_dimension_name = arrow_tensor->dim_name(i);\n  return arrow_dimension_name.c_str();\n}\n\n\/**\n * garrow_tensor_get_size:\n * @tensor: A #GArrowTensor.\n *\n * Returns: The number of value cells in the tensor.\n *\n * Since: 0.3.0\n *\/\ngint64\ngarrow_tensor_get_size(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->size();\n}\n\n\/**\n * garrow_tensor_is_mutable:\n * @tensor: A #GArrowTensor.\n *\n * Returns: %TRUE if the tensor is mutable, %FALSE otherwise.\n *\n * Since: 0.3.0\n *\/\ngboolean\ngarrow_tensor_is_mutable(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->is_mutable();\n}\n\n\/**\n * garrow_tensor_is_contiguous:\n * @tensor: A #GArrowTensor.\n *\n * Returns: %TRUE if the tensor is contiguous, %FALSE otherwise.\n *\n * Since: 0.3.0\n *\/\ngboolean\ngarrow_tensor_is_contiguous(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->is_contiguous();\n}\n\n\/**\n * garrow_tensor_is_row_major:\n * @tensor: A #GArrowTensor.\n *\n * Returns: %TRUE if the tensor is row major a.k.a. C order,\n *   %FALSE otherwise.\n *\n * Since: 0.3.0\n *\/\ngboolean\ngarrow_tensor_is_row_major(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->is_row_major();\n}\n\n\/**\n * garrow_tensor_is_column_major:\n * @tensor: A #GArrowTensor.\n *\n * Returns: %TRUE if the tensor is column major a.k.a. Fortran order,\n *   %FALSE otherwise.\n *\n * Since: 0.3.0\n *\/\ngboolean\ngarrow_tensor_is_column_major(GArrowTensor *tensor)\n{\n  auto arrow_tensor = garrow_tensor_get_raw(tensor);\n  return arrow_tensor->is_column_major();\n}\n\nG_END_DECLS\n\nGArrowTensor *\ngarrow_tensor_new_raw(std::shared_ptr<arrow::Tensor> *arrow_tensor)\n{\n  auto tensor = GARROW_TENSOR(g_object_new(GARROW_TYPE_TENSOR,\n                                           \"tensor\", arrow_tensor,\n                                           NULL));\n  return tensor;\n}\n\nstd::shared_ptr<arrow::Tensor>\ngarrow_tensor_get_raw(GArrowTensor *tensor)\n{\n  auto priv = GARROW_TENSOR_GET_PRIVATE(tensor);\n  return priv->tensor;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"HAL\/HAL.hpp\"\n\n#include \"Port.h\"\n#include \"HAL\/Errors.hpp\"\n#include \"ChipObject.h\"\n#include \"NetworkCommunication\/FRCComm.h\"\n#include \"NetworkCommunication\/UsageReporting.h\"\n#include \"NetworkCommunication\/LoadOut.h\"\n#include \"ChipObject\/nInterfaceGlobals.h\"\n#include <fstream>\n#include <iostream>\n#include <unistd.h>\n#include <signal.h> \/\/ linux for kill\nconst uint32_t solenoid_kNumDO7_0Elements = 8;\nconst uint32_t dio_kNumSystems = tDIO::kNumSystems;\nconst uint32_t interrupt_kNumSystems = tInterrupt::kNumSystems;\nconst uint32_t kSystemClockTicksPerMicrosecond = 40;\n\nstatic tGlobal *global;\n\nvoid* getPort(uint8_t pin)\n{\n\tPort* port = new Port();\n\tport->pin = pin;\n\tport->module = 1;\n\treturn port;\n}\n\n\/**\n * @deprecated Uses module numbers\n *\/\nvoid* getPortWithModule(uint8_t module, uint8_t pin)\n{\n\tPort* port = new Port();\n\tport->pin = pin;\n\tport->module = module;\n\treturn port;\n}\n\nconst char* getHALErrorMessage(int32_t code)\n{\n\tif (code == 0)\n\t\treturn \"\";\n\telse if (code == SAMPLE_RATE_TOO_HIGH)\n\t\treturn SAMPLE_RATE_TOO_HIGH_MESSAGE;\n\telse if (code == VOLTAGE_OUT_OF_RANGE)\n\t\treturn VOLTAGE_OUT_OF_RANGE_MESSAGE;\n\telse if (code == LOOP_TIMING_ERROR)\n\t\treturn LOOP_TIMING_ERROR_MESSAGE;\n\telse if (code == SPI_WRITE_NO_MOSI)\n\t\treturn SPI_WRITE_NO_MOSI_MESSAGE;\n\telse if (code == SPI_READ_NO_MISO)\n\t\treturn SPI_READ_NO_MISO_MESSAGE;\n\telse if (code == SPI_READ_NO_DATA)\n\t\treturn SPI_READ_NO_DATA_MESSAGE;\n\telse if (code == INCOMPATIBLE_STATE)\n\t\treturn INCOMPATIBLE_STATE_MESSAGE;\n\telse if (code == NO_AVAILABLE_RESOURCES)\n\t\treturn NO_AVAILABLE_RESOURCES_MESSAGE;\n\telse if (code == NULL_PARAMETER)\n\t\treturn NULL_PARAMETER_MESSAGE;\n\telse if (code == ANALOG_TRIGGER_LIMIT_ORDER_ERROR)\n\t\treturn ANALOG_TRIGGER_LIMIT_ORDER_ERROR_MESSAGE;\n\telse if (code == ANALOG_TRIGGER_PULSE_OUTPUT_ERROR)\n\t\treturn ANALOG_TRIGGER_PULSE_OUTPUT_ERROR_MESSAGE;\n\telse if (code == PARAMETER_OUT_OF_RANGE)\n\t\treturn PARAMETER_OUT_OF_RANGE_MESSAGE;\n\telse\n\t\treturn \"\";\n}\n\n\/**\n * Return the FPGA Version number.\n * For now, expect this to be competition year.\n * @return FPGA Version number.\n *\/\nuint16_t getFPGAVersion(int32_t *status)\n{\n\treturn global->readVersion(status);\n}\n\n\/**\n * Return the FPGA Revision number.\n * The format of the revision is 3 numbers.\n * The 12 most significant bits are the Major Revision.\n * the next 8 bits are the Minor Revision.\n * The 12 least significant bits are the Build Number.\n * @return FPGA Revision number.\n *\/\nuint32_t getFPGARevision(int32_t *status)\n{\n\treturn global->readRevision(status);\n}\n\n\/**\n * Read the microsecond-resolution timer on the FPGA.\n *\n * @return The current time in microseconds according to the FPGA (since FPGA reset).\n *\/\nuint32_t getFPGATime(int32_t *status)\n{\n\treturn global->readLocalTime(status);\n}\n\n\/**\n * Set the state of the FPGA status LED on the cRIO.\n *\/\nvoid setFPGALED(uint32_t state, int32_t *status)\n{\n\t\/\/ XXX: Not supported?\n\t\/\/ global->writeFPGA_LED(state, status);\n}\n\n\/**\n * Get the current state of the FPGA status LED on the cRIO.\n * @return The curent state of the FPGA LED.\n *\/\nint32_t getFPGALED(int32_t *status)\n{\n\t\/\/ XXX: Not supported?\n\t\/\/ bool ledValue = global->readFPGA_LED(status);\n\t\/\/ return ledValue;\n\treturn 0; \/\/ XXX: Dummy value\n}\n\nint HALSetErrorData(const char *errors, int errorsLength, int wait_ms)\n{\n\treturn setErrorData(errors, errorsLength, wait_ms);\n}\n\nint HALSetUserDsLcdData(const char *userDsLcdData, int userDsLcdDataLength,\n\t\tint wait_ms)\n{\n\treturn setUserDsLcdData(userDsLcdData, userDsLcdDataLength, wait_ms);\n}\n\nint HALOverrideIOConfig(const char *ioConfig, int wait_ms)\n{\n\treturn overrideIOConfig(ioConfig, wait_ms);\n}\n\nint HALGetDynamicControlData(uint8_t type, char *dynamicData, int32_t maxLength,\n\t\tint wait_ms)\n{\n\treturn getDynamicControlData(type, dynamicData, maxLength, wait_ms);\n}\n\nint HALGetCommonControlData(HALCommonControlData *data, int wait_ms)\n{\n\treturn getRecentCommonControlData((FRCCommonControlData*) data, wait_ms);\n}\n\nvoid HALSetNewDataSem(pthread_mutex_t * param)\n{\n\tsetNewDataSem(param);\n}\n\nint HALSetStatusData(float battery, uint8_t dsDigitalOut, uint8_t updateNumber,\n\t\tconst char *userDataHigh, int userDataHighLength,\n\t\tconst char *userDataLow, int userDataLowLength, int wait_ms)\n{\n\treturn setStatusData(battery, dsDigitalOut, updateNumber, userDataHigh,\n\t\t\tuserDataHighLength, userDataLow, userDataLowLength, wait_ms);\n}\n\n\/**\n * Call this to start up HAL. This is required for robot programs.\n *\/\nint HALInitialize(int mode)\n{\n\t\/\/ image 4; Fixes errors caused by multiple processes. Talk to NI about this\n\tnFPGA::nRoboRIO_FPGANamespace::g_currentTargetClass =\n\t\t\tnLoadOut::kTargetClass_RoboRIO;\n\n\tglobal = tGlobal::create(&status);\n\n\t\/\/ Kill any previous robot programs\n\tstd::fstream fs;\n\t\/\/ By making this both in\/out, it won't give us an error if it doesnt exist\n\tfs.open(\"\/var\/lock\/frc.pid\", std::fstream::in | std::fstream::out);\n\tif (fs.bad())\n\t\treturn 0;\n\n\tpid_t pid = 0;\n\tif (!fs.eof() && !fs.fail())\n\t{\n\t\tfs >> pid;\n\t\t\/\/see if the pid is around, but we don't want to mess with init id=1, or ourselves\n\t\tif (pid >= 2 && kill(pid, 0) == 0 && pid != getpid())\n\t\t{\n\t\t\tstd::cout << \"Killing previously running FRC program...\"\n\t\t\t\t\t<< std::endl;\n\t\t\tkill(pid, SIGTERM); \/\/ try to kill it\n\t\t\tdelayMillis(100);\n\t\t\tif (kill(pid, 0) == 0)\n\t\t\t{\n\t\t\t\t\/\/ still not successfull\n\t\t\t\tif (mode == 0)\n\t\t\t\t{\n\t\t\t\t\tstd::cout << \"FRC pid \" << pid\n\t\t\t\t\t\t\t<< \" did not die within 110ms. Aborting\"\n\t\t\t\t\t\t\t<< std::endl;\n\t\t\t\t\treturn 0; \/\/ just fail\n\t\t\t\t}\n\t\t\t\telse if (mode == 1) \/\/ kill -9 it\n\t\t\t\t\tkill(pid, SIGKILL);\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstd::cout << \"WARNING: FRC pid \" << pid\n\t\t\t\t\t\t\t<< \" did not die within 110ms.\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\tfs.close();\n\t\/\/ we will re-open it write only to truncate the file\n\tfs.open(\"\/var\/lock\/frc.pid\", std::fstream::out | std::fstream::trunc);\n\tfs.seekp(0);\n\tpid = getpid();\n\tfs << pid << std::endl;\n\tfs.close();\n\treturn 1;\n}\n\nvoid HALNetworkCommunicationObserveUserProgramStarting(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramStarting();\n}\n\nvoid HALNetworkCommunicationObserveUserProgramDisabled(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramDisabled();\n}\n\nvoid HALNetworkCommunicationObserveUserProgramAutonomous(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramAutonomous();\n}\n\nvoid HALNetworkCommunicationObserveUserProgramTeleop(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramTeleop();\n}\n\nvoid HALNetworkCommunicationObserveUserProgramTest(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramTest();\n}\n\nuint32_t HALReport(uint8_t resource, uint8_t instanceNumber, uint8_t context,\n\t\tconst char *feature)\n{\n\t\/\/return FRC_NetworkCommunication_nUsageReporting_report( resource, instanceNumber, context, feature);\n\treturn 0;\n}\n\n\/\/ TODO: HACKS\nvoid NumericArrayResize()\n{\n}\nvoid RTSetCleanupProc()\n{\n}\nvoid EDVR_CreateReference()\n{\n}\nvoid Occur()\n{\n}\n\nvoid imaqGetErrorText()\n{\n}\nvoid imaqGetLastError()\n{\n}\nvoid niTimestamp64()\n{\n}\n\n#include \"NetworkCommunication\/LoadOut.h\"\nnamespace nLoadOut\n{\nbool getModulePresence(tModuleType moduleType, uint8_t moduleNumber)\n{\n\treturn true;\n}\n}\n<commit_msg>Fixed a typo with the tGlobal commit<commit_after>#include \"HAL\/HAL.hpp\"\n\n#include \"Port.h\"\n#include \"HAL\/Errors.hpp\"\n#include \"ChipObject.h\"\n#include \"NetworkCommunication\/FRCComm.h\"\n#include \"NetworkCommunication\/UsageReporting.h\"\n#include \"NetworkCommunication\/LoadOut.h\"\n#include \"ChipObject\/nInterfaceGlobals.h\"\n#include <fstream>\n#include <iostream>\n#include <unistd.h>\n#include <signal.h> \/\/ linux for kill\nconst uint32_t solenoid_kNumDO7_0Elements = 8;\nconst uint32_t dio_kNumSystems = tDIO::kNumSystems;\nconst uint32_t interrupt_kNumSystems = tInterrupt::kNumSystems;\nconst uint32_t kSystemClockTicksPerMicrosecond = 40;\n\nstatic tGlobal *global;\n\nvoid* getPort(uint8_t pin)\n{\n\tPort* port = new Port();\n\tport->pin = pin;\n\tport->module = 1;\n\treturn port;\n}\n\n\/**\n * @deprecated Uses module numbers\n *\/\nvoid* getPortWithModule(uint8_t module, uint8_t pin)\n{\n\tPort* port = new Port();\n\tport->pin = pin;\n\tport->module = module;\n\treturn port;\n}\n\nconst char* getHALErrorMessage(int32_t code)\n{\n\tif (code == 0)\n\t\treturn \"\";\n\telse if (code == SAMPLE_RATE_TOO_HIGH)\n\t\treturn SAMPLE_RATE_TOO_HIGH_MESSAGE;\n\telse if (code == VOLTAGE_OUT_OF_RANGE)\n\t\treturn VOLTAGE_OUT_OF_RANGE_MESSAGE;\n\telse if (code == LOOP_TIMING_ERROR)\n\t\treturn LOOP_TIMING_ERROR_MESSAGE;\n\telse if (code == SPI_WRITE_NO_MOSI)\n\t\treturn SPI_WRITE_NO_MOSI_MESSAGE;\n\telse if (code == SPI_READ_NO_MISO)\n\t\treturn SPI_READ_NO_MISO_MESSAGE;\n\telse if (code == SPI_READ_NO_DATA)\n\t\treturn SPI_READ_NO_DATA_MESSAGE;\n\telse if (code == INCOMPATIBLE_STATE)\n\t\treturn INCOMPATIBLE_STATE_MESSAGE;\n\telse if (code == NO_AVAILABLE_RESOURCES)\n\t\treturn NO_AVAILABLE_RESOURCES_MESSAGE;\n\telse if (code == NULL_PARAMETER)\n\t\treturn NULL_PARAMETER_MESSAGE;\n\telse if (code == ANALOG_TRIGGER_LIMIT_ORDER_ERROR)\n\t\treturn ANALOG_TRIGGER_LIMIT_ORDER_ERROR_MESSAGE;\n\telse if (code == ANALOG_TRIGGER_PULSE_OUTPUT_ERROR)\n\t\treturn ANALOG_TRIGGER_PULSE_OUTPUT_ERROR_MESSAGE;\n\telse if (code == PARAMETER_OUT_OF_RANGE)\n\t\treturn PARAMETER_OUT_OF_RANGE_MESSAGE;\n\telse\n\t\treturn \"\";\n}\n\n\/**\n * Return the FPGA Version number.\n * For now, expect this to be competition year.\n * @return FPGA Version number.\n *\/\nuint16_t getFPGAVersion(int32_t *status)\n{\n\treturn global->readVersion(status);\n}\n\n\/**\n * Return the FPGA Revision number.\n * The format of the revision is 3 numbers.\n * The 12 most significant bits are the Major Revision.\n * the next 8 bits are the Minor Revision.\n * The 12 least significant bits are the Build Number.\n * @return FPGA Revision number.\n *\/\nuint32_t getFPGARevision(int32_t *status)\n{\n\treturn global->readRevision(status);\n}\n\n\/**\n * Read the microsecond-resolution timer on the FPGA.\n *\n * @return The current time in microseconds according to the FPGA (since FPGA reset).\n *\/\nuint32_t getFPGATime(int32_t *status)\n{\n\treturn global->readLocalTime(status);\n}\n\n\/**\n * Set the state of the FPGA status LED on the cRIO.\n *\/\nvoid setFPGALED(uint32_t state, int32_t *status)\n{\n\t\/\/ XXX: Not supported?\n\t\/\/ global->writeFPGA_LED(state, status);\n}\n\n\/**\n * Get the current state of the FPGA status LED on the cRIO.\n * @return The curent state of the FPGA LED.\n *\/\nint32_t getFPGALED(int32_t *status)\n{\n\t\/\/ XXX: Not supported?\n\t\/\/ bool ledValue = global->readFPGA_LED(status);\n\t\/\/ return ledValue;\n\treturn 0; \/\/ XXX: Dummy value\n}\n\nint HALSetErrorData(const char *errors, int errorsLength, int wait_ms)\n{\n\treturn setErrorData(errors, errorsLength, wait_ms);\n}\n\nint HALSetUserDsLcdData(const char *userDsLcdData, int userDsLcdDataLength,\n\t\tint wait_ms)\n{\n\treturn setUserDsLcdData(userDsLcdData, userDsLcdDataLength, wait_ms);\n}\n\nint HALOverrideIOConfig(const char *ioConfig, int wait_ms)\n{\n\treturn overrideIOConfig(ioConfig, wait_ms);\n}\n\nint HALGetDynamicControlData(uint8_t type, char *dynamicData, int32_t maxLength,\n\t\tint wait_ms)\n{\n\treturn getDynamicControlData(type, dynamicData, maxLength, wait_ms);\n}\n\nint HALGetCommonControlData(HALCommonControlData *data, int wait_ms)\n{\n\treturn getRecentCommonControlData((FRCCommonControlData*) data, wait_ms);\n}\n\nvoid HALSetNewDataSem(pthread_mutex_t * param)\n{\n\tsetNewDataSem(param);\n}\n\nint HALSetStatusData(float battery, uint8_t dsDigitalOut, uint8_t updateNumber,\n\t\tconst char *userDataHigh, int userDataHighLength,\n\t\tconst char *userDataLow, int userDataLowLength, int wait_ms)\n{\n\treturn setStatusData(battery, dsDigitalOut, updateNumber, userDataHigh,\n\t\t\tuserDataHighLength, userDataLow, userDataLowLength, wait_ms);\n}\n\n\/**\n * Call this to start up HAL. This is required for robot programs.\n *\/\nint HALInitialize(int mode)\n{\n\t\/\/ image 4; Fixes errors caused by multiple processes. Talk to NI about this\n\tnFPGA::nRoboRIO_FPGANamespace::g_currentTargetClass =\n\t\t\tnLoadOut::kTargetClass_RoboRIO;\n\n\tint32_t status;\n\tglobal = tGlobal::create(&status);\n\n\t\/\/ Kill any previous robot programs\n\tstd::fstream fs;\n\t\/\/ By making this both in\/out, it won't give us an error if it doesnt exist\n\tfs.open(\"\/var\/lock\/frc.pid\", std::fstream::in | std::fstream::out);\n\tif (fs.bad())\n\t\treturn 0;\n\n\tpid_t pid = 0;\n\tif (!fs.eof() && !fs.fail())\n\t{\n\t\tfs >> pid;\n\t\t\/\/see if the pid is around, but we don't want to mess with init id=1, or ourselves\n\t\tif (pid >= 2 && kill(pid, 0) == 0 && pid != getpid())\n\t\t{\n\t\t\tstd::cout << \"Killing previously running FRC program...\"\n\t\t\t\t\t<< std::endl;\n\t\t\tkill(pid, SIGTERM); \/\/ try to kill it\n\t\t\tdelayMillis(100);\n\t\t\tif (kill(pid, 0) == 0)\n\t\t\t{\n\t\t\t\t\/\/ still not successfull\n\t\t\t\tif (mode == 0)\n\t\t\t\t{\n\t\t\t\t\tstd::cout << \"FRC pid \" << pid\n\t\t\t\t\t\t\t<< \" did not die within 110ms. Aborting\"\n\t\t\t\t\t\t\t<< std::endl;\n\t\t\t\t\treturn 0; \/\/ just fail\n\t\t\t\t}\n\t\t\t\telse if (mode == 1) \/\/ kill -9 it\n\t\t\t\t\tkill(pid, SIGKILL);\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstd::cout << \"WARNING: FRC pid \" << pid\n\t\t\t\t\t\t\t<< \" did not die within 110ms.\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\tfs.close();\n\t\/\/ we will re-open it write only to truncate the file\n\tfs.open(\"\/var\/lock\/frc.pid\", std::fstream::out | std::fstream::trunc);\n\tfs.seekp(0);\n\tpid = getpid();\n\tfs << pid << std::endl;\n\tfs.close();\n\treturn 1;\n}\n\nvoid HALNetworkCommunicationObserveUserProgramStarting(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramStarting();\n}\n\nvoid HALNetworkCommunicationObserveUserProgramDisabled(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramDisabled();\n}\n\nvoid HALNetworkCommunicationObserveUserProgramAutonomous(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramAutonomous();\n}\n\nvoid HALNetworkCommunicationObserveUserProgramTeleop(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramTeleop();\n}\n\nvoid HALNetworkCommunicationObserveUserProgramTest(void)\n{\n\tFRC_NetworkCommunication_observeUserProgramTest();\n}\n\nuint32_t HALReport(uint8_t resource, uint8_t instanceNumber, uint8_t context,\n\t\tconst char *feature)\n{\n\t\/\/return FRC_NetworkCommunication_nUsageReporting_report( resource, instanceNumber, context, feature);\n\treturn 0;\n}\n\n\/\/ TODO: HACKS\nvoid NumericArrayResize()\n{\n}\nvoid RTSetCleanupProc()\n{\n}\nvoid EDVR_CreateReference()\n{\n}\nvoid Occur()\n{\n}\n\nvoid imaqGetErrorText()\n{\n}\nvoid imaqGetLastError()\n{\n}\nvoid niTimestamp64()\n{\n}\n\n#include \"NetworkCommunication\/LoadOut.h\"\nnamespace nLoadOut\n{\nbool getModulePresence(tModuleType moduleType, uint8_t moduleNumber)\n{\n\treturn true;\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 \"ash\/focus_cycler.h\"\n\n#include \"ash\/launcher\/launcher.h\"\n#include \"ash\/shell.h\"\n#include \"ash\/shell_window_ids.h\"\n#include \"ash\/wm\/window_util.h\"\n#include \"ash\/test\/ash_test_base.h\"\n#include \"ash\/shell_factory.h\"\n#include \"ui\/aura\/test\/test_windows.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/views\/controls\/button\/menu_button.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nnamespace ash {\nnamespace test {\n\nusing aura::test::CreateTestWindowWithId;\nusing aura::Window;\nusing internal::FocusCycler;\n\ntypedef AshTestBase FocusCyclerTest;\n\nTEST_F(FocusCyclerTest, CycleFocusBrowserOnly) {\n  scoped_ptr<FocusCycler> focus_cycler(new FocusCycler());\n\n  \/\/ Create a single test window.\n  Window* default_container =\n      ash::Shell::GetInstance()->GetContainer(\n          internal::kShellWindowId_DefaultContainer);\n  scoped_ptr<Window> window0(CreateTestWindowWithId(0, default_container));\n  ActivateWindow(window0.get());\n  EXPECT_TRUE(IsActiveWindow(window0.get()));\n\n  \/\/ Cycle the window\n  focus_cycler->RotateFocus(FocusCycler::FORWARD);\n  EXPECT_TRUE(IsActiveWindow(window0.get()));\n}\n\nTEST_F(FocusCyclerTest, CycleFocusForward) {\n  scoped_ptr<FocusCycler> focus_cycler(new FocusCycler());\n\n  \/\/ Add the Status area\n  views::Widget* status_widget = internal::CreateStatusArea();\n  ASSERT_TRUE(status_widget);\n  focus_cycler->AddWidget(status_widget);\n\n  \/\/ Add a mock button to the status area.\n  status_widget->GetContentsView()->AddChildView(\n      new views::MenuButton(NULL, string16(), NULL, false));\n\n  \/\/ Add the launcher\n  Launcher* launcher = Shell::GetInstance()->launcher();\n  ASSERT_TRUE(launcher);\n  views::Widget* launcher_widget = launcher->widget();\n  ASSERT_TRUE(launcher_widget);\n  focus_cycler->AddWidget(launcher_widget);\n  launcher->SetFocusCycler(focus_cycler.get());\n\n  \/\/ Create a single test window.\n  Window* default_container =\n      ash::Shell::GetInstance()->GetContainer(\n          internal::kShellWindowId_DefaultContainer);\n  scoped_ptr<Window> window0(CreateTestWindowWithId(0, default_container));\n  ActivateWindow(window0.get());\n  EXPECT_TRUE(IsActiveWindow(window0.get()));\n\n  \/\/ Cycle focus to the status area\n  focus_cycler->RotateFocus(FocusCycler::FORWARD);\n  EXPECT_TRUE(status_widget->IsActive());\n\n  \/\/ Cycle focus to the launcher\n  focus_cycler->RotateFocus(FocusCycler::FORWARD);\n  EXPECT_TRUE(launcher_widget->IsActive());\n\n  \/\/ Cycle focus to the browser\n  focus_cycler->RotateFocus(FocusCycler::FORWARD);\n  EXPECT_TRUE(IsActiveWindow(window0.get()));\n}\n\nTEST_F(FocusCyclerTest, CycleFocusBackward) {\n  scoped_ptr<FocusCycler> focus_cycler(new FocusCycler());\n\n  \/\/ Add the Status area\n  views::Widget* status_widget = internal::CreateStatusArea();\n  ASSERT_TRUE(status_widget);\n  focus_cycler->AddWidget(status_widget);\n\n  \/\/ Add a mock button to the status area.\n  status_widget->GetContentsView()->AddChildView(\n      new views::MenuButton(NULL, string16(), NULL, false));\n\n  \/\/ Add the launcher\n  Launcher* launcher = Shell::GetInstance()->launcher();\n  ASSERT_TRUE(launcher);\n  views::Widget* launcher_widget = launcher->widget();\n  ASSERT_TRUE(launcher_widget);\n  focus_cycler->AddWidget(launcher_widget);\n  launcher->SetFocusCycler(focus_cycler.get());\n\n  \/\/ Create a single test window.\n  Window* default_container =\n      ash::Shell::GetInstance()->GetContainer(\n          internal::kShellWindowId_DefaultContainer);\n  scoped_ptr<Window> window0(CreateTestWindowWithId(0, default_container));\n  ActivateWindow(window0.get());\n  EXPECT_TRUE(IsActiveWindow(window0.get()));\n\n  \/\/ Cycle focus to the launcher\n  focus_cycler->RotateFocus(FocusCycler::BACKWARD);\n  EXPECT_TRUE(launcher_widget->IsActive());\n\n  \/\/ Cycle focus to the status area\n  focus_cycler->RotateFocus(FocusCycler::BACKWARD);\n  EXPECT_TRUE(status_widget->IsActive());\n\n  \/\/ Cycle focus to the browser\n  focus_cycler->RotateFocus(FocusCycler::BACKWARD);\n  EXPECT_TRUE(IsActiveWindow(window0.get()));\n}\n\n}  \/\/ namespace test\n}  \/\/ namespace ash\n<commit_msg>ash: Fix chromeos build by adding missing wm:: for focus_cycler_unittest.cc<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 \"ash\/focus_cycler.h\"\n\n#include \"ash\/launcher\/launcher.h\"\n#include \"ash\/shell.h\"\n#include \"ash\/shell_window_ids.h\"\n#include \"ash\/wm\/window_util.h\"\n#include \"ash\/test\/ash_test_base.h\"\n#include \"ash\/shell_factory.h\"\n#include \"ui\/aura\/test\/test_windows.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/views\/controls\/button\/menu_button.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nnamespace ash {\nnamespace test {\n\nusing aura::test::CreateTestWindowWithId;\nusing aura::Window;\nusing internal::FocusCycler;\n\ntypedef AshTestBase FocusCyclerTest;\n\nTEST_F(FocusCyclerTest, CycleFocusBrowserOnly) {\n  scoped_ptr<FocusCycler> focus_cycler(new FocusCycler());\n\n  \/\/ Create a single test window.\n  Window* default_container =\n      ash::Shell::GetInstance()->GetContainer(\n          internal::kShellWindowId_DefaultContainer);\n  scoped_ptr<Window> window0(CreateTestWindowWithId(0, default_container));\n  wm::ActivateWindow(window0.get());\n  EXPECT_TRUE(wm::IsActiveWindow(window0.get()));\n\n  \/\/ Cycle the window\n  focus_cycler->RotateFocus(FocusCycler::FORWARD);\n  EXPECT_TRUE(wm::IsActiveWindow(window0.get()));\n}\n\nTEST_F(FocusCyclerTest, CycleFocusForward) {\n  scoped_ptr<FocusCycler> focus_cycler(new FocusCycler());\n\n  \/\/ Add the Status area\n  views::Widget* status_widget = internal::CreateStatusArea();\n  ASSERT_TRUE(status_widget);\n  focus_cycler->AddWidget(status_widget);\n\n  \/\/ Add a mock button to the status area.\n  status_widget->GetContentsView()->AddChildView(\n      new views::MenuButton(NULL, string16(), NULL, false));\n\n  \/\/ Add the launcher\n  Launcher* launcher = Shell::GetInstance()->launcher();\n  ASSERT_TRUE(launcher);\n  views::Widget* launcher_widget = launcher->widget();\n  ASSERT_TRUE(launcher_widget);\n  focus_cycler->AddWidget(launcher_widget);\n  launcher->SetFocusCycler(focus_cycler.get());\n\n  \/\/ Create a single test window.\n  Window* default_container =\n      ash::Shell::GetInstance()->GetContainer(\n          internal::kShellWindowId_DefaultContainer);\n  scoped_ptr<Window> window0(CreateTestWindowWithId(0, default_container));\n  wm::ActivateWindow(window0.get());\n  EXPECT_TRUE(wm::IsActiveWindow(window0.get()));\n\n  \/\/ Cycle focus to the status area\n  focus_cycler->RotateFocus(FocusCycler::FORWARD);\n  EXPECT_TRUE(status_widget->IsActive());\n\n  \/\/ Cycle focus to the launcher\n  focus_cycler->RotateFocus(FocusCycler::FORWARD);\n  EXPECT_TRUE(launcher_widget->IsActive());\n\n  \/\/ Cycle focus to the browser\n  focus_cycler->RotateFocus(FocusCycler::FORWARD);\n  EXPECT_TRUE(wm::IsActiveWindow(window0.get()));\n}\n\nTEST_F(FocusCyclerTest, CycleFocusBackward) {\n  scoped_ptr<FocusCycler> focus_cycler(new FocusCycler());\n\n  \/\/ Add the Status area\n  views::Widget* status_widget = internal::CreateStatusArea();\n  ASSERT_TRUE(status_widget);\n  focus_cycler->AddWidget(status_widget);\n\n  \/\/ Add a mock button to the status area.\n  status_widget->GetContentsView()->AddChildView(\n      new views::MenuButton(NULL, string16(), NULL, false));\n\n  \/\/ Add the launcher\n  Launcher* launcher = Shell::GetInstance()->launcher();\n  ASSERT_TRUE(launcher);\n  views::Widget* launcher_widget = launcher->widget();\n  ASSERT_TRUE(launcher_widget);\n  focus_cycler->AddWidget(launcher_widget);\n  launcher->SetFocusCycler(focus_cycler.get());\n\n  \/\/ Create a single test window.\n  Window* default_container =\n      ash::Shell::GetInstance()->GetContainer(\n          internal::kShellWindowId_DefaultContainer);\n  scoped_ptr<Window> window0(CreateTestWindowWithId(0, default_container));\n  wm::ActivateWindow(window0.get());\n  EXPECT_TRUE(wm::IsActiveWindow(window0.get()));\n\n  \/\/ Cycle focus to the launcher\n  focus_cycler->RotateFocus(FocusCycler::BACKWARD);\n  EXPECT_TRUE(launcher_widget->IsActive());\n\n  \/\/ Cycle focus to the status area\n  focus_cycler->RotateFocus(FocusCycler::BACKWARD);\n  EXPECT_TRUE(status_widget->IsActive());\n\n  \/\/ Cycle focus to the browser\n  focus_cycler->RotateFocus(FocusCycler::BACKWARD);\n  EXPECT_TRUE(wm::IsActiveWindow(window0.get()));\n}\n\n}  \/\/ namespace test\n}  \/\/ namespace ash\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream> \r\n#include <string> \r\n#include <fstream> \r\nusing namespace std;\r\n\r\ntemplate<typename T>\r\nstruct Node\r\n{\r\n\tT x;\r\n\tNode<T> * left;\r\n\tNode<T> * right;\r\n\tNode(T const& value) : x{ value }, left{ nullptr }, right{ nullptr } {}\r\n};\r\n\r\ntemplate<typename T>\r\nclass Tree\r\n{\r\nprivate:\r\n\tNode<T> * root;\r\npublic:\r\n\tTree()\r\n\t{\r\n\t\troot  = nullptr;\r\n\t}\r\n\r\n\t~Tree()\r\n\t{\r\n\t\tdeleteNode(root);\r\n\t}\r\n\r\n\tvoid deleteNode(Node<T> * node)\r\n\t{\r\n\t\tif (node == nullptr) return;\r\n\t\tdeleteNode(node->left);\r\n\t\tdeleteNode(node->right);\r\n\t\tdelete node;\r\n\t}\r\n\r\n\tT x_() const\r\n\t{\r\n\t\treturn root->x;\r\n\t}\r\n\r\n\tNode<T> * left_() const\r\n\t{\r\n\t\treturn root->left;\r\n\t}\r\n\r\n\tNode<T> * right_() const\r\n\t{\r\n\t\treturn root->right;\r\n\t}\r\n\r\n\tNode<T> * root_() const\r\n\t{\r\n\t\treturn root;\r\n\t}\r\n\r\n\tvoid insert(const T& value)\r\n\t{\r\n\t\tinsert(root, value);\r\n\t}\r\n\r\n\tvoid insert(Node<T>* & node, const T& value)\r\n\t{\r\n\t\tif (node) \r\n\t\t{\r\n\t\t\tif (value < node->x) \r\n\t\t\t\tinsert(node->left, value);\r\n\t\t\telse if (value > node->x) \r\n\t\t\t\tinsert(node->right, value);\r\n\t\t\telse return;\r\n\t\t}\r\n\t\telse node = new Node<T>(value);\r\n\t}\r\n\r\n\tNode<T> * search(const T& x)const\r\n\t{\r\n\t\tNode<T> * curEl = root;\r\n\t\twhile (curEl != nullptr)\r\n\t\t{\r\n\t\t\tif (curEl->x == x)\r\n\t\t\t\tbreak;\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tif (x > curEl->x)\r\n\t\t\t\t\tcurEl = curEl->right;\r\n\t\t\t\telse curEl = curEl->left;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn curEl;\r\n\t}\r\n\t\r\n\tbool check_search(const T& x)\r\n\t{\r\n\t\tNode<T> * node;\r\n\t\tnode = search(x);\r\n\t\tif (node != nullptr)\r\n\t\t\treturn true;\r\n\t\telse return false;\r\n\t}\r\n\r\n\tvoid fIn(const string filename)\r\n\t{\r\n\t\tifstream fin;\r\n\t\tunsigned int k;\r\n\t\tfin.open(filename);\r\n\t\tif (!fin.is_open())\r\n\t\t\tcout << \"The file isn't find\" << endl;\r\n\t\telse\r\n\t\t{\r\n\t\t\tdeleteNode(root);\r\n\t\t\tif (fin.eof()) return;\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tfin >> k;\r\n\t\t\t\tT newEl;\r\n\t\t\t\tfor (unsigned int i = 0; i < k; ++i)\r\n\t\t\t\t{\r\n\t\t\t\t\tfin >> newEl;\r\n\t\t\t\t\tinsert(newEl);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfin.close();\r\n\t\t}\r\n\t}\r\n\r\n\tunsigned int size(Node<T> * node)const\r\n\t{\r\n\t\tunsigned int size_ = 0;\r\n\t\tif (node != nullptr)\r\n\t\t\tsize_ = size(node->left) + 1 + size(node->right);\r\n\t\treturn size_;\r\n\t}\r\n\r\n\tvoid out_to_file(const string filename)const\r\n\t{\r\n\t\tofstream fout;\r\n\t\tfout.open(filename);\r\n\t\tif (!fout.is_open())\r\n\t\t\tcout << \"The file isn't find\" << endl;\r\n\t\telse\r\n\t\t{\r\n\t\t\tunsigned int size_ = size(root);\r\n\t\t\tif (size_ == 0)\r\n\t\t\t\treturn;\r\n\t\t\tfout << size_ << \"\\t\";\r\n\t\t\tfOut(root, fout);\r\n\t\t\tfout.close();\r\n\t\t}\r\n\t}\r\n\r\n\tvoid fOut(Node<T> * node, ostream&stream)const\r\n\t{\r\n\t\tif (node != nullptr)\r\n\t\t{\r\n\t\t\tfOut(node->left, stream);\r\n\t\t\tstream << node->x << \" \";\r\n\t\t\tfOut(node->right, stream);\r\n\t\t}\r\n\t}\r\n\r\n\tvoid out(ostream & stream)const\r\n\t{\r\n\t\tOut(root, stream, 0);\r\n\t}\r\n\r\n\tvoid Out(Node<T> * node, ostream&stream, size_t level)const\r\n\t{\r\n\t\tNode<T> * curEl = node;\r\n\t\tif (curEl != nullptr)\r\n\t\t{\r\n\t\t\tOut(curEl->right, stream, level + 1);\r\n\t\t\tfor (unsigned int i = 0; i < level; ++i)\r\n\t\t\t\tstream << '-';\r\n\t\t\tstream << curEl->x << endl;\r\n\t\t\tOut(curEl->left, stream, level + 1);\r\n\t\t}\r\n\t}\r\n\t\r\n\tNode<T> * prev_(const T& x)\r\n\t{\r\n\t\treturn prev(root, x);\r\n\t}\r\n\t\r\n\tNode<T> * prev_(Node<T> * & node, const T& x)\r\n\t{\r\n\t\tif (check_search(x))\r\n\t\t{\r\n\t\t\tNode<T> * prev = nullptr;\r\n\t\t\tNode<T> * cur = nullptr;\r\n\t\t\twhile (node->x != x)\r\n\t\t\t{\r\n\t\t\t\tif (x < node->x)\r\n\t\t\t\t{\r\n\t\t\t\t\tprev = node;\r\n\t\t\t\t\tcur = node->left;\r\n\t\t\t\t\tprev(cur, x);\r\n\t\t\t\t}\r\n\t\t\t\telse if (x > node->x)\r\n\t\t\t\t{\r\n\t\t\t\t\tprev = node;\r\n\t\t\t\t\tcur = node->right;\r\n\t\t\t\t\tprev(cur, x);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn prev;\r\n\t\t}\r\n\t\telse return;\r\n\t}\r\n\t\r\n\tvoid deliteX(const T& x)\r\n\t{\r\n\t\tNode<T> * curEl = search(x);\r\n\t\tNode<T> * prev = nullptr;\r\n\t\tif (curEl != nullptr)\r\n\t\t{\r\n\t\t\tif (curEl->left == nullptr&&curEl->right == nullptr)\r\n\t\t\t{\r\n\t\t\t\tprev = prev_(x);\r\n\t\t\t\tif (x < prev->x)\r\n\t\t\t\t\tprev->left = nullptr;\r\n\t\t\t\tif (x > prev->x)\r\n\t\t\t\t\tprev->right = nullptr;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tif (curEl->right != nullptr)\r\n\t\t\t\t{\r\n\t\t\t\t\t* left = curEl->left;\r\n\t\t\t\t\t* right = curEl->right;\r\n\t\t\t\t\tNode<T> * leftEl = curEl->right;\r\n\t\t\t\t\twhile (leftEl->left||leftEl->right)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tif (leftEl->left)\r\n\t\t\t\t\t\t\tleftEl = leftEl->left;\r\n\t\t\t\t\t\telse leftEl = leftEl->right;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprev = prev_(leftEl->x);\r\n\t\t\t\t\tif (x < prev->x)\r\n\t\t\t\t\t\tprev->left = nullptr;\r\n\t\t\t\t\tif (x > prev->x)\r\n\t\t\t\t\t\tprev->right = nullptr;\r\n\t\t\t\t\tleftEl->left = left;\r\n\t\t\t\t\tleftEl->right = right;\r\n\t\t\t\t\tcurEl = leftEl;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\telse return;\r\n\t}\r\n};\r\n<commit_msg>Update BinaryTree.hpp<commit_after>#include <iostream> \r\n#include <string> \r\n#include <fstream> \r\nusing namespace std;\r\n\r\ntemplate<typename T>\r\nstruct Node\r\n{\r\n\tT x;\r\n\tNode<T> * left;\r\n\tNode<T> * right;\r\n\tNode(T const& value) : x{ value }, left{ nullptr }, right{ nullptr } {}\r\n};\r\n\r\ntemplate<typename T>\r\nclass Tree\r\n{\r\nprivate:\r\n\tNode<T> * root;\r\npublic:\r\n\tTree()\r\n\t{\r\n\t\troot  = nullptr;\r\n\t}\r\n\r\n\t~Tree()\r\n\t{\r\n\t\tdeleteNode(root);\r\n\t}\r\n\r\n\tvoid deleteNode(Node<T> * node)\r\n\t{\r\n\t\tif (node == nullptr) return;\r\n\t\tdeleteNode(node->left);\r\n\t\tdeleteNode(node->right);\r\n\t\tdelete node;\r\n\t}\r\n\r\n\tT x_() const\r\n\t{\r\n\t\treturn root->x;\r\n\t}\r\n\r\n\tNode<T> * left_() const\r\n\t{\r\n\t\treturn root->left;\r\n\t}\r\n\r\n\tNode<T> * right_() const\r\n\t{\r\n\t\treturn root->right;\r\n\t}\r\n\r\n\tNode<T> * root_() const\r\n\t{\r\n\t\treturn root;\r\n\t}\r\n\r\n\tvoid insert(const T& value)\r\n\t{\r\n\t\tinsert(root, value);\r\n\t}\r\n\r\n\tvoid insert(Node<T>* & node, const T& value)\r\n\t{\r\n\t\tif (node) \r\n\t\t{\r\n\t\t\tif (value < node->x) \r\n\t\t\t\tinsert(node->left, value);\r\n\t\t\telse if (value > node->x) \r\n\t\t\t\tinsert(node->right, value);\r\n\t\t\telse return;\r\n\t\t}\r\n\t\telse node = new Node<T>(value);\r\n\t}\r\n\r\n\tNode<T> * search(const T& x)const\r\n\t{\r\n\t\tNode<T> * curEl = root;\r\n\t\twhile (curEl != nullptr)\r\n\t\t{\r\n\t\t\tif (curEl->x == x)\r\n\t\t\t\tbreak;\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tif (x > curEl->x)\r\n\t\t\t\t\tcurEl = curEl->right;\r\n\t\t\t\telse curEl = curEl->left;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn curEl;\r\n\t}\r\n\t\r\n\tbool check_search(const T& x)\r\n\t{\r\n\t\tNode<T> * node;\r\n\t\tnode = search(x);\r\n\t\tif (node != nullptr)\r\n\t\t\treturn true;\r\n\t\telse return false;\r\n\t}\r\n\r\n\tvoid fIn(const string filename)\r\n\t{\r\n\t\tifstream fin;\r\n\t\tunsigned int k;\r\n\t\tfin.open(filename);\r\n\t\tif (!fin.is_open())\r\n\t\t\tcout << \"The file isn't find\" << endl;\r\n\t\telse\r\n\t\t{\r\n\t\t\tdeleteNode(root);\r\n\t\t\tif (fin.eof()) return;\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tfin >> k;\r\n\t\t\t\tT newEl;\r\n\t\t\t\tfor (unsigned int i = 0; i < k; ++i)\r\n\t\t\t\t{\r\n\t\t\t\t\tfin >> newEl;\r\n\t\t\t\t\tinsert(newEl);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfin.close();\r\n\t\t}\r\n\t}\r\n\r\n\tunsigned int size(Node<T> * node)const\r\n\t{\r\n\t\tunsigned int size_ = 0;\r\n\t\tif (node != nullptr)\r\n\t\t\tsize_ = size(node->left) + 1 + size(node->right);\r\n\t\treturn size_;\r\n\t}\r\n\r\n\tvoid out_to_file(const string filename)const\r\n\t{\r\n\t\tofstream fout;\r\n\t\tfout.open(filename);\r\n\t\tif (!fout.is_open())\r\n\t\t\tcout << \"The file isn't find\" << endl;\r\n\t\telse\r\n\t\t{\r\n\t\t\tunsigned int size_ = size(root);\r\n\t\t\tif (size_ == 0)\r\n\t\t\t\treturn;\r\n\t\t\tfout << size_ << \"\\t\";\r\n\t\t\tfOut(root, fout);\r\n\t\t\tfout.close();\r\n\t\t}\r\n\t}\r\n\r\n\tvoid fOut(Node<T> * node, ostream&stream)const\r\n\t{\r\n\t\tif (node != nullptr)\r\n\t\t{\r\n\t\t\tfOut(node->left, stream);\r\n\t\t\tstream << node->x << \" \";\r\n\t\t\tfOut(node->right, stream);\r\n\t\t}\r\n\t}\r\n\r\n\tvoid out(ostream & stream)const\r\n\t{\r\n\t\tOut(root, stream, 0);\r\n\t}\r\n\r\n\tvoid Out(Node<T> * node, ostream&stream, size_t level)const\r\n\t{\r\n\t\tNode<T> * curEl = node;\r\n\t\tif (curEl != nullptr)\r\n\t\t{\r\n\t\t\tOut(curEl->right, stream, level + 1);\r\n\t\t\tfor (unsigned int i = 0; i < level; ++i)\r\n\t\t\t\tstream << '-';\r\n\t\t\tstream << curEl->x << endl;\r\n\t\t\tOut(curEl->left, stream, level + 1);\r\n\t\t}\r\n\t}\r\n\t\r\n\tNode<T> * prev_(const T& x)\r\n\t{\r\n\t\treturn prev(root, x);\r\n\t}\r\n\t\r\n\tNode<T> * prev_(Node<T> * & node, const T& x)\r\n\t{\r\n\t\tif (check_search(x))\r\n\t\t{\r\n\t\t\tNode<T> * prev = nullptr;\r\n\t\t\tNode<T> * cur = nullptr;\r\n\t\t\twhile (node->x != x)\r\n\t\t\t{\r\n\t\t\t\tif (x < node->x)\r\n\t\t\t\t{\r\n\t\t\t\t\tprev = node;\r\n\t\t\t\t\tcur = node->left;\r\n\t\t\t\t\tprev(cur, x);\r\n\t\t\t\t}\r\n\t\t\t\telse if (x > node->x)\r\n\t\t\t\t{\r\n\t\t\t\t\tprev = node;\r\n\t\t\t\t\tcur = node->right;\r\n\t\t\t\t\tprev(cur, x);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn prev;\r\n\t\t}\r\n\t\telse return;\r\n\t}\r\n\t\r\n\tvoid deliteX(const T& x)\r\n\t{\r\n\t\tNode<T> * curEl = search(x);\r\n\t\tNode<T> * prev = nullptr;\r\n\t\tif (curEl != nullptr)\r\n\t\t{\r\n\t\t\tif (curEl->left == nullptr&&curEl->right == nullptr)\r\n\t\t\t{\r\n\t\t\t\tprev = prev_(x);\r\n\t\t\t\tif (x < prev->x)\r\n\t\t\t\t\tprev->left = nullptr;\r\n\t\t\t\tif (x > prev->x)\r\n\t\t\t\t\tprev->right = nullptr;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tif (curEl->right != nullptr)\r\n\t\t\t\t{\r\n\t\t\t\t\tNode<T> * left_ = curEl->left;\r\n\t\t\t\t\tNode<T> * right_ = curEl->right;\r\n\t\t\t\t\tNode<T> * leftEl = curEl->right;\r\n\t\t\t\t\twhile (leftEl->left)\r\n\t\t\t\t\t\tleftEl = leftEl->left;\r\n\t\t\t\t\tprev = prev_(leftEl->x);\r\n\t\t\t\t\tif (x < prev->x)\r\n\t\t\t\t\t\tprev->left = nullptr;\r\n\t\t\t\t\tif (x > prev->x)\r\n\t\t\t\t\t\tprev->right = nullptr;\r\n\t\t\t\t\tleftEl->left = left_;\r\n\t\t\t\t\tleftEl->right = right_;\r\n\t\t\t\t\tcurEl = leftEl;\r\n\t\t\t\t}\r\n\t\t\t\tif (curEl->left != nullptr&&curEl->right == nullptr)\r\n\t\t\t\t{\r\n\t\t\t\t\tprev = prev_(curEl->x);\r\n\t\t\t\t\tif (curEl->x < prev->x)\r\n\t\t\t\t\t\tprev->left = curEl->left;\r\n\t\t\t\t\telse prev->right = curEl->left;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\telse return;\r\n\t}\r\n};\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2014 CNRS\n\/\/ Authors: Florent Lamiraux\n\/\/\n\/\/ This file is part of hpp-core\n\/\/ hpp-core 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 version\n\/\/ 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ hpp-core 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\/\/ General Lesser Public License for more details.  You should have\n\/\/ received a copy of the GNU Lesser General Public License along with\n\/\/ hpp-core  If not, see\n\/\/ <http:\/\/www.gnu.org\/licenses\/>.\n\n#define BOOST_TEST_MODULE gradient_based\n\n#include <cmath>\n#include <boost\/test\/included\/unit_test.hpp>\n\n#include <hpp\/fcl\/collision_object.h>\n#include <hpp\/fcl\/math\/transform.h>\n#include <hpp\/fcl\/shape\/geometric_shapes.h>\n\n#include <hpp\/model\/device.hh>\n\n#include <hpp\/pinocchio\/joint.hh>\n#include <hpp\/pinocchio\/collision-object.hh>\n#include <hpp\/pinocchio\/device.hh>\n\n#include <hpp\/core\/steering-method-straight.hh>\n#include <hpp\/core\/path-optimization\/gradient-based.hh>\n#include <hpp\/core\/path-vector.hh>\n#include <hpp\/core\/problem.hh>\n#include <pinocchio\/multibody\/joint\/joint-variant.hpp>\n#include <pinocchio\/spatial\/fcl-pinocchio-conversions.hpp>\n#include <pinocchio\/multibody\/geometry.hpp>\n\n#include \"..\/tests\/utils.hh\"\n\n\nusing hpp::pinocchio::BodyPtr_t;\nusing hpp::pinocchio::Body;\nusing hpp::pinocchio::CollisionObject;\nusing hpp::pinocchio::CollisionObjectPtr_t;\nusing hpp::pinocchio::Configuration_t;\nusing hpp::pinocchio::Device;\nusing hpp::pinocchio::DevicePtr_t;\nusing hpp::pinocchio::Transform3f;\nusing hpp::pinocchio::JointPtr_t;\nusing hpp::pinocchio::value_type;\nusing fcl::Quaternion3f;\nusing fcl::Box;\nusing hpp::core::ConfigurationPtr_t;\nusing hpp::core::PathVector;\nusing hpp::core::PathVectorPtr_t;\nusing hpp::core::Problem;\nusing hpp::core::SteeringMethodPtr_t;\nusing hpp::core::SteeringMethodStraight;\nusing hpp::core::PathOptimizerPtr_t;\nusing hpp::core::pathOptimization::GradientBased;\n\nusing namespace hpp::core;\nusing namespace hpp::pinocchio;\n\nusing ::se3::JointModelPX;\nusing ::se3::JointModelPY;\nusing ::se3::JointModelPZ;\nusing ::se3::JointModelRUBZ;\nusing ::se3::JointIndex;\nusing ::se3::FrameIndex;\n\n\nBOOST_AUTO_TEST_SUITE( test_hpp_core )\n\nDevicePtr_t createRobot ()\n{\n  DevicePtr_t robot = Device::create (\"test\");\n  const std::string& name = robot->name ();\n  ModelPtr_t m = ModelPtr_t(new ::se3::Model());\n  GeomModelPtr_t gm = GeomModelPtr_t(new ::se3::GeometryModel());\n  robot->model(m);\n  robot->geomModel(gm);\n  Transform3f mat; mat.setIdentity ();\n  std::string jointName = name + \"_x\";\n\n  JointIndex idX = robot->model().addJoint(0,JointModelPX(), mat,jointName);\n\n  std::string jointNameY = name + \"_y\";\n\n  idX = robot->model().addJoint(idX,JointModelPY(), mat,jointNameY);\n\n  idX = robot->model().addJoint(idX,JointModelRUBZ(), mat,\"rot_z\");\n\n  fcl::Transform3f position; position.setIdentity ();\n\n  boost::shared_ptr <Box> box (new Box (1,2,1));\n  fcl::CollisionObject object(box, position);\n  robot->model().appendBodyToJoint(idX,::se3::Inertia::Identity(), se3::SE3::Identity());\n  robot->model().addBodyFrame(\"body\", idX, se3::SE3::Identity());\n  FrameIndex bodyId = robot->model().getFrameId(\"body\");\n  robot->geomModel().addGeometryObject(\n      se3::GeometryObject(\"obstacle\", bodyId, idX, object.collisionGeometry(), mat, \"\", hpp::pinocchio::vector3_t::Ones()),\n      robot->model());\n\n  robot->createData();\n  robot->createGeomData();\n  return robot;\n  \/*\n  DevicePtr_t robot = Device::create (\"planar-robot\");\n  Transform3f position; position.setIdentity ();\n  ObjectFactory factory;\n\n  \/\/ planar root joint\n  JointPtr_t root = factory.createJointTranslation2 (position);\n  robot->rootJoint (root);\n  \/\/ Rotation around z\n  position.setQuatRotation (Quaternion3f (sqrt (2)\/2, 0, -sqrt (2)\/2, 0));\n  JointPtr_t joint = factory.createUnBoundedJointRotation (position);\n  root->addChildJoint (joint);\n  position.setIdentity ();\n  boost::shared_ptr <Box> box (new Box (1,2,1));\n  CollisionObjectPtr_t object = CollisionObject::create (box, position, \"box\");\n  BodyPtr_t body = new Body ();\n  joint->setLinkedBody (body);\n  body->addInnerObject (object, true, true);\n\n  return robot;*\/\n}\n\nBOOST_AUTO_TEST_CASE (BFGS)\n{\n  DevicePtr_t robot = createRobot ();\n  Configuration_t q0 (robot->configSize ());\n  Configuration_t q1 (robot->configSize ());\n  Configuration_t q2 (robot->configSize ());\n  Configuration_t q3 (robot->configSize ());\n  Configuration_t q4 (robot->configSize ());\n  value_type s = sqrt (2)\/2;\n  q0 (0) = -1; q0 (1) = 0; q0 (2) = 1; q0 (3) = 0;\n  q1 (0) = -s; q1 (1) = s; q1 (2) = s; q1 (3) = s;\n  q2 (0) = 0; q2 (1) = 1; q2 (2) = 0; q2 (3) = 1;\n  q3 (0) = s; q3 (1) = s; q3 (2) = s; q3 (3) = s;\n  q4 (0) = 1; q4 (1) = 0; q4 (2) = 1; q4 (3) = 0;\n\n  Problem problem (robot);\n  SteeringMethodPtr_t sm = problem.steeringMethod ();\n  PathVectorPtr_t path = PathVector::create (robot->configSize (),\n\t\t\t\t\t     robot->numberDof ());\n  path->appendPath ((*sm) (q0, q1));\n  path->appendPath ((*sm) (q1, q2));\n  path->appendPath ((*sm) (q2, q3));\n  path->appendPath ((*sm) (q3, q4));\n\n  PathOptimizerPtr_t pathOptimizer (GradientBased::create (problem));\n  pathOptimizer->optimize (path);\n}\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Fix creation of robot in test-gradient-based.cc<commit_after>\/\/\n\/\/ Copyright (c) 2014 CNRS\n\/\/ Authors: Florent Lamiraux\n\/\/\n\/\/ This file is part of hpp-core\n\/\/ hpp-core 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 version\n\/\/ 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ hpp-core 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\/\/ General Lesser Public License for more details.  You should have\n\/\/ received a copy of the GNU Lesser General Public License along with\n\/\/ hpp-core  If not, see\n\/\/ <http:\/\/www.gnu.org\/licenses\/>.\n\n#define BOOST_TEST_MODULE gradient_based\n\n#include <cmath>\n#include <boost\/test\/included\/unit_test.hpp>\n\n#include <hpp\/fcl\/collision_object.h>\n#include <hpp\/fcl\/math\/transform.h>\n#include <hpp\/fcl\/shape\/geometric_shapes.h>\n\n#include <hpp\/model\/device.hh>\n\n#include <hpp\/pinocchio\/joint.hh>\n#include <hpp\/pinocchio\/collision-object.hh>\n#include <hpp\/pinocchio\/device.hh>\n\n#include <hpp\/core\/steering-method-straight.hh>\n#include <hpp\/core\/path-optimization\/gradient-based.hh>\n#include <hpp\/core\/path-vector.hh>\n#include <hpp\/core\/problem.hh>\n#include <pinocchio\/multibody\/joint\/joint-variant.hpp>\n#include <pinocchio\/spatial\/fcl-pinocchio-conversions.hpp>\n#include <pinocchio\/multibody\/geometry.hpp>\n\n#include \"..\/tests\/utils.hh\"\n\n\nusing hpp::pinocchio::BodyPtr_t;\nusing hpp::pinocchio::Body;\nusing hpp::pinocchio::CollisionObject;\nusing hpp::pinocchio::CollisionObjectPtr_t;\nusing hpp::pinocchio::Configuration_t;\nusing hpp::pinocchio::Device;\nusing hpp::pinocchio::DevicePtr_t;\nusing hpp::pinocchio::Transform3f;\nusing hpp::pinocchio::JointPtr_t;\nusing hpp::pinocchio::value_type;\nusing fcl::Quaternion3f;\nusing fcl::Box;\nusing hpp::core::ConfigurationPtr_t;\nusing hpp::core::PathVector;\nusing hpp::core::PathVectorPtr_t;\nusing hpp::core::Problem;\nusing hpp::core::SteeringMethodPtr_t;\nusing hpp::core::SteeringMethodStraight;\nusing hpp::core::PathOptimizerPtr_t;\nusing hpp::core::pathOptimization::GradientBased;\n\nusing namespace hpp::core;\nusing namespace hpp::pinocchio;\n\nusing ::se3::JointModelPX;\nusing ::se3::JointModelPY;\nusing ::se3::JointModelPZ;\nusing ::se3::JointModelRUBZ;\nusing ::se3::JointIndex;\nusing ::se3::FrameIndex;\n\n\nBOOST_AUTO_TEST_SUITE( test_hpp_core )\n\nDevicePtr_t createRobot ()\n{\n  DevicePtr_t robot = Device::create (\"test\");\n  const std::string& name = robot->name ();\n  ModelPtr_t m = ModelPtr_t(new ::se3::Model());\n  GeomModelPtr_t gm = GeomModelPtr_t(new ::se3::GeometryModel());\n  robot->model(m);\n  robot->geomModel(gm);\n  Transform3f mat; mat.setIdentity ();\n  std::string jointName = name + \"_x\";\n\n  JointIndex idX = robot->model().addJoint(0,JointModelPX(), mat,jointName);\n  robot->model().addJointFrame(idX);\n\n  std::string jointNameY = name + \"_y\";\n\n  idX = robot->model().addJoint(idX,JointModelPY(), mat,jointNameY);\n  robot->model().addJointFrame(idX);\n\n  idX = robot->model().addJoint(idX,JointModelRUBZ(), mat,\"rot_z\");\n  robot->model().addJointFrame(idX);\n\n  fcl::Transform3f position; position.setIdentity ();\n\n  boost::shared_ptr <Box> box (new Box (1,2,1));\n  fcl::CollisionObject object(box, position);\n  robot->model().appendBodyToJoint(idX,::se3::Inertia::Identity(), se3::SE3::Identity());\n  robot->model().addBodyFrame(\"body\", idX, se3::SE3::Identity());\n  FrameIndex bodyId = robot->model().getFrameId(\"body\");\n  robot->geomModel().addGeometryObject(\n      se3::GeometryObject(\"obstacle\", bodyId, idX, object.collisionGeometry(), mat, \"\", hpp::pinocchio::vector3_t::Ones()),\n      robot->model());\n\n  robot->createData();\n  robot->createGeomData();\n  return robot;\n  \/*\n  DevicePtr_t robot = Device::create (\"planar-robot\");\n  Transform3f position; position.setIdentity ();\n  ObjectFactory factory;\n\n  \/\/ planar root joint\n  JointPtr_t root = factory.createJointTranslation2 (position);\n  robot->rootJoint (root);\n  \/\/ Rotation around z\n  position.setQuatRotation (Quaternion3f (sqrt (2)\/2, 0, -sqrt (2)\/2, 0));\n  JointPtr_t joint = factory.createUnBoundedJointRotation (position);\n  root->addChildJoint (joint);\n  position.setIdentity ();\n  boost::shared_ptr <Box> box (new Box (1,2,1));\n  CollisionObjectPtr_t object = CollisionObject::create (box, position, \"box\");\n  BodyPtr_t body = new Body ();\n  joint->setLinkedBody (body);\n  body->addInnerObject (object, true, true);\n\n  return robot;*\/\n}\n\nBOOST_AUTO_TEST_CASE (BFGS)\n{\n  DevicePtr_t robot = createRobot ();\n  Configuration_t q0 (robot->configSize ());\n  Configuration_t q1 (robot->configSize ());\n  Configuration_t q2 (robot->configSize ());\n  Configuration_t q3 (robot->configSize ());\n  Configuration_t q4 (robot->configSize ());\n  value_type s = sqrt (2)\/2;\n  q0 (0) = -1; q0 (1) = 0; q0 (2) = 1; q0 (3) = 0;\n  q1 (0) = -s; q1 (1) = s; q1 (2) = s; q1 (3) = s;\n  q2 (0) = 0; q2 (1) = 1; q2 (2) = 0; q2 (3) = 1;\n  q3 (0) = s; q3 (1) = s; q3 (2) = s; q3 (3) = s;\n  q4 (0) = 1; q4 (1) = 0; q4 (2) = 1; q4 (3) = 0;\n\n  Problem problem (robot);\n  SteeringMethodPtr_t sm = problem.steeringMethod ();\n  PathVectorPtr_t path = PathVector::create (robot->configSize (),\n\t\t\t\t\t     robot->numberDof ());\n  path->appendPath ((*sm) (q0, q1));\n  path->appendPath ((*sm) (q1, q2));\n  path->appendPath ((*sm) (q2, q3));\n  path->appendPath ((*sm) (q3, q4));\n\n  PathOptimizerPtr_t pathOptimizer (GradientBased::create (problem));\n  pathOptimizer->optimize (path);\n}\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * StreamServerManager.cpp\n *\n *  Created on: Sep 10, 2015\n *      Author: alarrosa14\n *\/\n#include <chrono>\n\n#include \"lz4.h\"\n#include \"lz4frame.h\"\n\n#include \"StreamServerManager.h\"\n\n#define PACKET_HEADER_SIZE 10\n\nStreamServerManager::StreamServerManager(void) {\n\twaitForNewFrameMutex.lock();\n}\n\nStreamServerManager::~StreamServerManager(void) {}\n\nvoid StreamServerManager::setEnabled(const bool &isEnabled) {\n\tthis->enabled = isEnabled;\n}\n\nvoid StreamServerManager::setCompressionEnabled(const bool &compression) {\n\tthis->compressionEnabled = compression;\n}\n\nvoid StreamServerManager::setAddress(const string &address) {\n\tthis->address = address;\n}\n\nvoid StreamServerManager::setPixelQuantity(const int &pixelQty){\n\tthis->pixelQuantity = pixelQty;\n}\n\nvoid StreamServerManager::setPort(const int &port){\n\tthis->port = port;\n} \n\nbool StreamServerManager::getEnabled() {\n\treturn this->enabled;\n}\n\nbool StreamServerManager::getCompressionEnabled() {\n\treturn this->compressionEnabled;\n}\n\nstring StreamServerManager::getAddress() {\n\treturn this->address;\n}\n\nint StreamServerManager::getPixelQuantity() {\n\treturn this->pixelQuantity;\n}\n\nint StreamServerManager::getPort(){\n\treturn this->port;\n} \n\nvoid StreamServerManager::setupStreamingSender() {\n\tcout << \"Server config: \" << this->address << endl << this->port << endl;\n\tcout << \"Compression enabled? \" << (this->compressionEnabled ? \"True\" : \"False\") << endl;\n\tstring url = \"http:\/\/\" + this->address + \":\" + to_string(this->port);\n\tcout << \"Setting up Streaming Server: \" << url << endl;\n\n\tudpManager.Create();\n\tcout << this->address.c_str() << this->port << endl;\n\tif (!udpManager.Connect(this->address.c_str(), this->port));\n\t\tcout << endl << endl << \"Error connecting socket!\" << endl << endl;\n\tudpManager.SetNonBlocking(true);\n\n}\n\nvoid StreamServerManager::addFrameToSendBuffer(DTFrame* newFrame) {\n\tlock();\n\tthis->sendBuffer.push_back(newFrame);\n\tunlock();\n\twaitForNewFrameMutex.unlock();\n}\n\nvoid convertToArrayOfBytes(void* data, int length, unsigned char *buffer) {\n\tchar* ptr = (char*)data;\n\tfor (int i = 0; i < length; i++)\n\t\tbuffer[i] = *ptr++;\n};\n\nuint64_t htonll(uint64_t n) {\n#if __BYTE_ORDER == __BIG_ENDIAN\n    return n;\n#else\n    return (((uint64_t)htonl(n)) << 32) + htonl(n >> 32);\n#endif\n}\n\nuint64_t ntohll(uint64_t n) {\n\treturn htonll(n);\n}\n\nvoid StreamServerManager::threadedFunction() {\n\n\tuint8_t currentSeqNmb = 0;\n\tuint8_t flags = 0x00;\n\n\tconst int frameSize = this->pixelQuantity*3;\n\n\tsize_t compressedBufferMaxSize;\n\tunsigned char *compressedBuffer = NULL;\n\tif (compressionEnabled) {\n\t\tflags = 0x01;\n\t\tcompressedBufferMaxSize = LZ4F_compressFrameBound(frameSize, NULL);\n\t\tcompressedBuffer = new unsigned char[compressedBufferMaxSize];\n\t}\n\n\tconst int bufferSize = PACKET_HEADER_SIZE + ((compressionEnabled && compressedBufferMaxSize > frameSize) ? compressedBufferMaxSize : frameSize);\n\tunsigned char *buffer = new unsigned char[bufferSize];\n\tbuffer[sizeof(uint64_t) + 2*sizeof(uint8_t) - 1] = flags;\n\n\tusing namespace std::chrono;\n\twhile(isThreadRunning()) {\n\n\t\twaitForNewFrameMutex.lock();\n\t\tlock();\n\t\tif(this->sendBuffer.size()>0){\n\t        vector<DTFrame*>::iterator it = this->sendBuffer.begin();\n\t        this->sendBuffer.erase(it);\n\t        unlock();\n\n\t        uint8_t* raw_frame = (*it)->getRawFrameData();\n\t\t\tint raw_frame_length = (*it)->getPixelQuantity()*3;\n\n\t\t\tassert(raw_frame_length == this->pixelQuantity*3);\n\n\t\t\tuint64_t ms = htonll(duration_cast< milliseconds >(\n\t\t\t    system_clock::now().time_since_epoch()\n\t\t\t).count());\n\n\t\t\tconvertToArrayOfBytes(&ms, sizeof(ms), buffer);\n\t\t\tconvertToArrayOfBytes(&currentSeqNmb, sizeof(currentSeqNmb), buffer + sizeof(ms));\n\n\n\t\t\tif (compressionEnabled) {\n\t\t\t\tsize_t compressedBufferSize = LZ4F_compressFrame(compressedBuffer, compressedBufferMaxSize, raw_frame, raw_frame_length, NULL);\n\t\t\t\tconvertToArrayOfBytes(compressedBuffer, compressedBufferSize, buffer + PACKET_HEADER_SIZE);\n\t\t\t\tthis->udpManager.Send((char*) buffer, PACKET_HEADER_SIZE + compressedBufferSize);\n\t\t\t} else {\n\t\t\t\tconvertToArrayOfBytes(raw_frame, raw_frame_length, buffer + PACKET_HEADER_SIZE);\n\t\t\t\tthis->udpManager.Send((char*) buffer, bufferSize);\n\t\t\t}\n\n\t\t\tcurrentSeqNmb = (currentSeqNmb + 1) % 256;\n\n\t\t} else {\n\t    \tunlock();\n\t    }\n\t}\n\tthis->udpManager.Close();\n\tdelete[]buffer;\n\tdelete[]compressedBuffer;\n}\n<commit_msg>Added some scalability oriented code<commit_after>\/*\n * StreamServerManager.cpp\n *\n *  Created on: Sep 10, 2015\n *      Author: alarrosa14\n *\/\n#include <chrono>\n\n#include \"lz4.h\"\n#include \"lz4frame.h\"\n\n#include \"StreamServerManager.h\"\n\n#define PACKET_HEADER_SIZE 10\n\n#define FRAME_DATA_COMPRESSED_MASK 0x01\n\nStreamServerManager::StreamServerManager(void) {\n\twaitForNewFrameMutex.lock();\n}\n\nStreamServerManager::~StreamServerManager(void) {}\n\nvoid StreamServerManager::setEnabled(const bool &isEnabled) {\n\tthis->enabled = isEnabled;\n}\n\nvoid StreamServerManager::setCompressionEnabled(const bool &compression) {\n\tthis->compressionEnabled = compression;\n}\n\nvoid StreamServerManager::setAddress(const string &address) {\n\tthis->address = address;\n}\n\nvoid StreamServerManager::setPixelQuantity(const int &pixelQty){\n\tthis->pixelQuantity = pixelQty;\n}\n\nvoid StreamServerManager::setPort(const int &port){\n\tthis->port = port;\n} \n\nbool StreamServerManager::getEnabled() {\n\treturn this->enabled;\n}\n\nbool StreamServerManager::getCompressionEnabled() {\n\treturn this->compressionEnabled;\n}\n\nstring StreamServerManager::getAddress() {\n\treturn this->address;\n}\n\nint StreamServerManager::getPixelQuantity() {\n\treturn this->pixelQuantity;\n}\n\nint StreamServerManager::getPort(){\n\treturn this->port;\n} \n\nvoid StreamServerManager::setupStreamingSender() {\n\tcout << \"Server config: \" << this->address << endl << this->port << endl;\n\tcout << \"Compression enabled? \" << (this->compressionEnabled ? \"True\" : \"False\") << endl;\n\tstring url = \"http:\/\/\" + this->address + \":\" + to_string(this->port);\n\tcout << \"Setting up Streaming Server: \" << url << endl;\n\n\tudpManager.Create();\n\tcout << this->address.c_str() << this->port << endl;\n\tif (!udpManager.Connect(this->address.c_str(), this->port));\n\t\tcout << endl << endl << \"Error connecting socket!\" << endl << endl;\n\tudpManager.SetNonBlocking(true);\n\n}\n\nvoid StreamServerManager::addFrameToSendBuffer(DTFrame* newFrame) {\n\tlock();\n\tthis->sendBuffer.push_back(newFrame);\n\tunlock();\n\twaitForNewFrameMutex.unlock();\n}\n\nvoid convertToArrayOfBytes(void* data, int length, unsigned char *buffer) {\n\tchar* ptr = (char*)data;\n\tfor (int i = 0; i < length; i++)\n\t\tbuffer[i] = *ptr++;\n};\n\nuint64_t htonll(uint64_t n) {\n#if __BYTE_ORDER == __BIG_ENDIAN\n    return n;\n#else\n    return (((uint64_t)htonl(n)) << 32) + htonl(n >> 32);\n#endif\n}\n\nuint64_t ntohll(uint64_t n) {\n\treturn htonll(n);\n}\n\nvoid StreamServerManager::threadedFunction() {\n\n\tuint8_t currentSeqNmb = 0;\n\tuint8_t flags = 0x00;\n\n\tconst int frameSize = this->pixelQuantity*3;\n\n\tsize_t compressedBufferMaxSize;\n\tunsigned char *compressedBuffer = NULL;\n\tif (compressionEnabled) {\n\t\tflags = flags | FRAME_DATA_COMPRESSED_MASK;\n\t\tcompressedBufferMaxSize = LZ4F_compressFrameBound(frameSize, NULL);\n\t\tcompressedBuffer = new unsigned char[compressedBufferMaxSize];\n\t}\n\n\tconst int bufferSize = PACKET_HEADER_SIZE + ((compressionEnabled && compressedBufferMaxSize > frameSize) ? compressedBufferMaxSize : frameSize);\n\tunsigned char *buffer = new unsigned char[bufferSize];\n\tbuffer[sizeof(uint64_t) + 2*sizeof(uint8_t) - 1] = flags;\n\n\tusing namespace std::chrono;\n\twhile(isThreadRunning()) {\n\n\t\twaitForNewFrameMutex.lock();\n\t\tlock();\n\t\tif(this->sendBuffer.size()>0){\n\t        vector<DTFrame*>::iterator it = this->sendBuffer.begin();\n\t        this->sendBuffer.erase(it);\n\t        unlock();\n\n\t        uint8_t* raw_frame = (*it)->getRawFrameData();\n\t\t\tint raw_frame_length = (*it)->getPixelQuantity()*3;\n\n\t\t\tassert(raw_frame_length == this->pixelQuantity*3);\n\n\t\t\tuint64_t ms = htonll(duration_cast< milliseconds >(\n\t\t\t    system_clock::now().time_since_epoch()\n\t\t\t).count());\n\n\t\t\tconvertToArrayOfBytes(&ms, sizeof(ms), buffer);\n\t\t\tconvertToArrayOfBytes(&currentSeqNmb, sizeof(currentSeqNmb), buffer + sizeof(ms));\n\n\n\t\t\tif (compressionEnabled) {\n\t\t\t\tsize_t compressedBufferSize = LZ4F_compressFrame(compressedBuffer, compressedBufferMaxSize, raw_frame, raw_frame_length, NULL);\n\t\t\t\tconvertToArrayOfBytes(compressedBuffer, compressedBufferSize, buffer + PACKET_HEADER_SIZE);\n\t\t\t\tthis->udpManager.Send((char*) buffer, PACKET_HEADER_SIZE + compressedBufferSize);\n\t\t\t} else {\n\t\t\t\tconvertToArrayOfBytes(raw_frame, raw_frame_length, buffer + PACKET_HEADER_SIZE);\n\t\t\t\tthis->udpManager.Send((char*) buffer, bufferSize);\n\t\t\t}\n\n\t\t\tcurrentSeqNmb = (currentSeqNmb + 1) % 256;\n\n\t\t} else {\n\t    \tunlock();\n\t    }\n\t}\n\tthis->udpManager.Close();\n\tdelete[]buffer;\n\tdelete[]compressedBuffer;\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 *\n *\/\n#ifndef PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_DISTANCE_HPP_\n#define PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_DISTANCE_HPP_\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid\npcl::registration::CorrespondenceRejectorDistance::applyRejection (pcl::Correspondences &correspondences)\n{\n  unsigned int number_valid_correspondences = 0;\n  correspondences.resize (input_correspondences_->size ());\n  for (size_t i = 0; i < input_correspondences_->size (); ++i)\n  {\n    if (data_container_)\n    {\n      if (data_container_->getCorrespondenceScore ((*input_correspondences_)[i]) < max_distance_)\n      {\n        correspondences[number_valid_correspondences] = (*input_correspondences_)[i];\n        ++number_valid_correspondences;\n      }\n    }\n    else\n    {\n      if ((*input_correspondences_)[i].distance < max_distance_)\n      {\n        correspondences[number_valid_correspondences] = (*input_correspondences_)[i];\n        ++number_valid_correspondences;\n      }\n    }\n  }\n  correspondences.resize (number_valid_correspondences);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid\npcl::registration::CorrespondenceRejectorDistance::getRemainingCorrespondences (\n    const pcl::Correspondences& original_correspondences, \n    pcl::Correspondences& remaining_correspondences)\n{\n  unsigned int number_valid_correspondences = 0;\n  remaining_correspondences.resize (original_correspondences.size ());\n  for (size_t i = 0; i < original_correspondences.size (); ++i)\n  {\n    if (original_correspondences[i].distance < max_distance_)\n    {\n      remaining_correspondences[number_valid_correspondences] = original_correspondences[i];\n      ++number_valid_correspondences;\n    }\n  }\n  remaining_correspondences.resize (number_valid_correspondences);\n}\n\n#endif \/* PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_DISTANCE_HPP_ *\/\n<commit_msg>fixed `pcl::registration::CorrespondenceRejectorDistance::getRemainingCorrespondences (const pcl::Correspondences& original_correspondences, pcl::Correspondences& remaining_correspondences)`    <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 *\n *\/\n#ifndef PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_DISTANCE_HPP_\n#define PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_DISTANCE_HPP_\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid\npcl::registration::CorrespondenceRejectorDistance::applyRejection (pcl::Correspondences &correspondences)\n{\n  unsigned int number_valid_correspondences = 0;\n  correspondences.resize (input_correspondences_->size ());\n  for (size_t i = 0; i < input_correspondences_->size (); ++i)\n  {\n    if (data_container_)\n    {\n      if (data_container_->getCorrespondenceScore ((*input_correspondences_)[i]) < max_distance_)\n      {\n        correspondences[number_valid_correspondences] = (*input_correspondences_)[i];\n        ++number_valid_correspondences;\n      }\n    }\n    else\n    {\n      if ((*input_correspondences_)[i].distance < max_distance_)\n      {\n        correspondences[number_valid_correspondences] = (*input_correspondences_)[i];\n        ++number_valid_correspondences;\n      }\n    }\n  }\n  correspondences.resize (number_valid_correspondences);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid\npcl::registration::CorrespondenceRejectorDistance::getRemainingCorrespondences (\n    const pcl::Correspondences& original_correspondences, \n    pcl::Correspondences& remaining_correspondences)\n{\n  unsigned int number_valid_correspondences = 0;\n  remaining_correspondences.resize (original_correspondences.size ());\n  for (size_t i = 0; i < original_correspondences.size (); ++i)\n  {\n    if (data_container_)\n    {\n      if (data_container_->getCorrespondenceScore (original_correspondences[i]) < max_distance_)\n      {\n        remaining_correspondences[number_valid_correspondences] = original_correspondences[i];\n        ++number_valid_correspondences;\n      }\n    }\n    else\n    {\n      if (original_correspondences[i].distance < max_distance_)\n      {\n        remaining_correspondences[number_valid_correspondences] = original_correspondences[i];\n        ++number_valid_correspondences;\n      }\n    }\n  }\n  remaining_correspondences.resize (number_valid_correspondences);\n}\n\n#endif \/* PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_DISTANCE_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"cm_utils.h\"\n#include <gtk\/gtk.h>\n#include <sys\/types.h>\n#include <sys\/inotify.h>\n#include <poll.h>\n\nnamespace cm\n{\n\nstatic void SetDefaultPath( GtkWidget *dialog, const char *defaultPath )\n{\n    if ( !defaultPath || strlen(defaultPath) == 0 )\n        return;\n\n    \/* GTK+ manual recommends not specifically setting the default path.\n       We do it anyway in order to be consistent across platforms.\n\n       If consistency with the native OS is preferred, this is the line\n       to comment out. -ml *\/\n    gtk_file_chooser_set_current_folder( GTK_FILE_CHOOSER(dialog), defaultPath );\n}\n\n#define MAX_STRLEN 512\n\nstatic void AddFiltersToDialog( GtkWidget *dialog, const char *type )\n{\n    GtkFileFilter *filter;\n    \n    if ( !type || strlen(type) == 0 )\n        return;\n\n    std::string wildcard = std::string(\"*.\") + type;\n    filter = gtk_file_filter_new();\n    gtk_file_filter_set_name(filter, type);\n    gtk_file_filter_add_pattern( filter, wildcard.c_str() );\n    gtk_file_chooser_add_filter( GTK_FILE_CHOOSER(dialog), filter );\n\n    filter = gtk_file_filter_new();\n    gtk_file_filter_set_name( filter, \"*.*\" );\n    gtk_file_filter_add_pattern( filter, \"*\" );\n    gtk_file_chooser_add_filter( GTK_FILE_CHOOSER(dialog), filter );\n}\n\nstatic void WaitForCleanup(void)\n{\n    while (gtk_events_pending())\n        gtk_main_iteration();\n}\n\nbool openFolderDialog( std::string & str, const char *title )\n{\n    printf(\"openFolderDialog not implemented on LINUX!!\");\n    return false;\n}\n\n\/\/\/ \\todo String!\n\/\/\/ Dialog for opening file\nbool\t\topenFileDialog( std::string & path,  const char*  type, int maxsize  )\n{\n\tstatic std::string currentOpenPath=\"none\";\n\n\tbool result = false;\n\tchar * outPath;\n\n\tGtkWidget *dialog;\n\n    if ( !gtk_init_check( NULL, NULL ) )\n    {\n        return false;\n    }\n\n    dialog = gtk_file_chooser_dialog_new( \"Open File\",\n                                          NULL,\n                                          GTK_FILE_CHOOSER_ACTION_OPEN,\n                                          \"_Cancel\", GTK_RESPONSE_CANCEL,\n                                          \"_Open\", GTK_RESPONSE_ACCEPT,\n                                          NULL );\n\n    bool typeSpecified = true;\n    if( strcmp(type,\"*\")==0 )\n\t{\n\t\ttypeSpecified = false;\n\t}\n\telse\n\t{\n    \tAddFiltersToDialog(dialog, type);\n    }\n\n    \/* Set the default path *\/\n    if(currentOpenPath != \"none\")\n\t    SetDefaultPath(dialog, currentOpenPath.c_str());\n\telse\n\t\tSetDefaultPath(dialog, getCurrentDirectory().c_str());\n\n    result = false;\n    if ( gtk_dialog_run( GTK_DIALOG(dialog) ) == GTK_RESPONSE_ACCEPT )\n    {\n        char *filename;\n\n        filename = gtk_file_chooser_get_filename( GTK_FILE_CHOOSER(dialog) );\n\n        path = filename;\n        \n        g_free( filename );\n\n        currentOpenPath = getDirectoryFromPath(path);\n       \t\n        result = true;\n    }\n\n    WaitForCleanup();\n    gtk_widget_destroy(dialog);\n    WaitForCleanup();\n\n    return result;\n}\n\n\/\/\/ Dialog for saving file\nbool\t\tsaveFileDialog( std::string & path, const char* type, int maxsize  )\n{\n\tstatic std::string currentSavePath=\"none\";\n\n\tbool result = false;\n\tchar * outPath;\n\n\tGtkWidget *dialog;\n\n    if ( !gtk_init_check( NULL, NULL ) )\n    {\n        return false;\n    }\n\n    dialog = gtk_file_chooser_dialog_new( \"Save File\",\n                                          NULL,\n                                          GTK_FILE_CHOOSER_ACTION_SAVE,\n                                          \"_Cancel\", GTK_RESPONSE_CANCEL,\n                                          \"_Save\", GTK_RESPONSE_ACCEPT,\n                                          NULL );\n\n    bool typeSpecified = true;\n    if( strcmp(type,\"*\")==0 )\n\t{\n\t\ttypeSpecified = false;\n\t}\n\telse\n\t{\n    \tAddFiltersToDialog(dialog, type);\n    }\n\n    \/* Set the default path *\/\n    if( currentSavePath != \"none\" )\n    \tSetDefaultPath(dialog, currentSavePath.c_str());\n    else\n    \tSetDefaultPath(dialog, getCurrentDirectory().c_str());\n\n    result = false;\n    if ( gtk_dialog_run( GTK_DIALOG(dialog) ) == GTK_RESPONSE_ACCEPT )\n    {\n        char *filename;\n\n        filename = gtk_file_chooser_get_filename( GTK_FILE_CHOOSER(dialog) );\n\n        std::string res = filename;\n        if(typeSpecified)\n\t\t{\n\t\t\tstd::string suff = getFileExt(res);\n\t\t\tif( suff != type )\n\t\t\t{\n\t\t\t\tres = getPathWithoutExt(res) + \".\" + std::string(type);\n\t\t\t}\n\t\t}\n\n\t\tpath = res;\n       \t\n       \tcurrentSavePath = getDirectoryFromPath(path);\n\n        g_free( filename );\n\n        result = true;\n    }\n\n    WaitForCleanup();\n    gtk_widget_destroy(dialog);\n    WaitForCleanup();\n\n    return result;\n}\n\n\nstd::string  getExecutablePath()\n{\n\tchar buffer[PATH_MAX];\n\n\tchar* path_end;\n  \t\/* Read the target of \/proc\/self\/exe.  *\/\n  \tif (readlink (\"\/proc\/self\/exe\", buffer, PATH_MAX) <= 0)\n    \treturn \"\";\n  \t\/* Find the last occurence of a forward slash, the path separator.  *\/\n \tpath_end = strrchr (buffer, '\/');\n  \tif (path_end == NULL)\n    \treturn \"\";\n \t \/* Advance to the character past the last slash.  *\/\n  \t++path_end;\n\t\/* Obtain the directory containing the program by truncating the\n\t   path after the last slash.  *\/\n\t*path_end = '\\0';\n\t\/* The length of the path is the number of characters up through the\n\t last slash.  *\/\n\treturn std::string(buffer); \n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Gross filewatcher\n\n#define EVENT_SIZE  ( sizeof (struct inotify_event) )\n#define EVENT_BUF_LEN     ( 1024 * ( EVENT_SIZE + 16 ) )\n\nFileWatcher::FileWatcher( const std::string & path, int msecs  )\n:\nfileFlags(0),\nmsecs(msecs)\n{\n  \/\/http:\/\/man7.org\/tlpi\/code\/online\/diff\/inotify\/demo_inotify.c.html\n     \n     struct inotify_event *event;\n \n     fd = inotify_init();                 \/* Create inotify instance *\/\n     if (fd == -1)\n         assert(0);\n\n  numFiles =  1;\n  \n  int wd = inotify_add_watch(fd, path.c_str(), IN_MODIFY ); \/\/IN_ALL_EVENTS);\n    Wd.push_back(wd);\n\n    \/\/paths.push_back(path);\n\n    running = true;\n    thread = std::thread(&FileWatcher::run, this);\n}\n\nFileWatcher::~FileWatcher()\n{\n    stop();\n    for( int i = 0; i < Wd.size(); i++ )\n       inotify_rm_watch( fd, Wd[i] );\n   close(fd);\n     printf(\"Closed file watcher\\n\");\n}\n\nbool FileWatcher::hasFileChanged()\n{\n  bool res = fileFlags != 0;\n  fileFlags = 0;\n  return res;\n}\n\nstatic void             \/* Display information from inotify_event structure *\/\n displayInotifyEvent(FileWatcher * watcher, struct inotify_event *i)\n {\n    \/*\n     printf(\"    wd =%2d; \", i->wd);\n     if (i->cookie > 0)\n         printf(\"cookie =%4d; \", i->cookie);\n    \n    \n     printf(\"mask = \");\n     if (i->mask & IN_ACCESS)        printf(\"IN_ACCESS \");\n     if (i->mask & IN_ATTRIB)        printf(\"IN_ATTRIB \");\n     if (i->mask & IN_CLOSE_NOWRITE) printf(\"IN_CLOSE_NOWRITE \");\n     if (i->mask & IN_CLOSE_WRITE)   printf(\"IN_CLOSE_WRITE \");\n     if (i->mask & IN_CREATE)        printf(\"IN_CREATE \");\n     if (i->mask & IN_DELETE)        printf(\"IN_DELETE \");\n     if (i->mask & IN_DELETE_SELF)   printf(\"IN_DELETE_SELF \");\n     if (i->mask & IN_IGNORED)       printf(\"IN_IGNORED \");\n     if (i->mask & IN_ISDIR)         printf(\"IN_ISDIR \");\n     if (i->mask & IN_MODIFY)        printf(\"IN_MODIFY \");\n     if (i->mask & IN_MOVE_SELF)     printf(\"IN_MOVE_SELF \");\n     if (i->mask & IN_MOVED_FROM)    printf(\"IN_MOVED_FROM \");\n     if (i->mask & IN_MOVED_TO)      printf(\"IN_MOVED_TO \");\n     if (i->mask & IN_OPEN)          printf(\"IN_OPEN \");\n     if (i->mask & IN_Q_OVERFLOW)    printf(\"IN_Q_OVERFLOW \");\n     if (i->mask & IN_UNMOUNT)       printf(\"IN_UNMOUNT \");\n     printf(\"\\n\");\n    \n*\/\n\n    if( i->len < 1 )\n        return;\n\n    std::string name = i->name;\n    if( getFileExt(name) == \"py\" && getFilenameFromPath(name) != \"tmp.py\" )\n    {\n        printf(\"Modified file: %s\\n\", i->name);\n        watcher->fileFlags = 1;\n    }\n\n }\n \nvoid FileWatcher::stop()\n{\n    if(running)\n    {\n        mutex.lock();\n        printf(\"Joining thread\\n\");\n        running = false;\n        thread.join();\n        printf(\"Stopped file watching thread\\n\");\n        mutex.unlock();\n    }\n}\n\nvoid FileWatcher::run()\n{\n  char *p;\n  struct inotify_event *event;\n  char buf[EVENT_BUF_LEN] __attribute__ ((aligned(8)));\n    printf(\"Starting file watcher\\n\");\n\n  while( running )\n  {\n        \/\/mutex.lock();\n        struct pollfd pfd = { fd, POLLIN, 0 };\n        int ret = poll(&pfd, 1, 50);  \/\/ timeout of 50ms\n        if (ret < 0) {\n            fprintf(stderr, \"poll failed: %s\\n\", strerror(errno));\n        } else if (ret == 0) {\n            continue;\n        }\n\n    int numRead = read(fd, buf, EVENT_BUF_LEN);\n        \n        if( numRead == 0 )\n    {\n      continue;\n    }\n\n    for (p = buf; p < buf + numRead; ) {\n             event = (struct inotify_event *) p;\n             displayInotifyEvent(this, event);\n         \/\/fileFlags = 1;\n             p += EVENT_SIZE + event->len;\n         }\n         \/\/mutex.unlock();\n         std::this_thread::sleep_for(std::chrono::milliseconds(10));\n\n    \/\/Thread::sleep(msecs);\n  }\n}\n\n\n}<commit_msg>fixes for linux<commit_after>#include \"cm_utils.h\"\n#include <gtk\/gtk.h>\n#include <sys\/types.h>\n#include <sys\/inotify.h>\n#include <poll.h>\n\nnamespace cm\n{\n\nstatic void SetDefaultPath( GtkWidget *dialog, const char *defaultPath )\n{\n    if ( !defaultPath || strlen(defaultPath) == 0 )\n        return;\n\n    \/* GTK+ manual recommends not specifically setting the default path.\n       We do it anyway in order to be consistent across platforms.\n\n       If consistency with the native OS is preferred, this is the line\n       to comment out. -ml *\/\n    gtk_file_chooser_set_current_folder( GTK_FILE_CHOOSER(dialog), defaultPath );\n}\n\n#define MAX_STRLEN 512\n\nstatic void AddFiltersToDialog( GtkWidget *dialog, const char *type )\n{\n    GtkFileFilter *filter;\n    \n    if ( !type || strlen(type) == 0 )\n        return;\n\n    std::string wildcard = std::string(\"*.\") + type;\n    filter = gtk_file_filter_new();\n    gtk_file_filter_set_name(filter, type);\n    gtk_file_filter_add_pattern( filter, wildcard.c_str() );\n    gtk_file_chooser_add_filter( GTK_FILE_CHOOSER(dialog), filter );\n\n    filter = gtk_file_filter_new();\n    gtk_file_filter_set_name( filter, \"*.*\" );\n    gtk_file_filter_add_pattern( filter, \"*\" );\n    gtk_file_chooser_add_filter( GTK_FILE_CHOOSER(dialog), filter );\n}\n\nstatic void WaitForCleanup(void)\n{\n    while (gtk_events_pending())\n        gtk_main_iteration();\n}\n\nbool openFolderDialog( std::string & str, const char *title )\n{\n    printf(\"openFolderDialog not implemented on LINUX!!\");\n    return false;\n}\n\n\/\/\/ \\todo String!\n\/\/\/ Dialog for opening file\nbool\t\topenFileDialog( std::string & path,  const char*  type, int maxsize  )\n{\n\tstatic std::string currentOpenPath=\"none\";\n\n\tbool result = false;\n\tchar * outPath;\n\n\tGtkWidget *dialog;\n\n    if ( !gtk_init_check( NULL, NULL ) )\n    {\n        return false;\n    }\n\n    dialog = gtk_file_chooser_dialog_new( \"Open File\",\n                                          NULL,\n                                          GTK_FILE_CHOOSER_ACTION_OPEN,\n                                          \"_Cancel\", GTK_RESPONSE_CANCEL,\n                                          \"_Open\", GTK_RESPONSE_ACCEPT,\n                                          NULL );\n\n    bool typeSpecified = true;\n    if( strcmp(type,\"*\")==0 )\n\t{\n\t\ttypeSpecified = false;\n\t}\n\telse\n\t{\n    \tAddFiltersToDialog(dialog, type);\n    }\n\n    \/* Set the default path *\/\n    if(currentOpenPath != \"none\")\n\t    SetDefaultPath(dialog, currentOpenPath.c_str());\n\telse\n\t\tSetDefaultPath(dialog, getCurrentDirectory().c_str());\n\n    result = false;\n    if ( gtk_dialog_run( GTK_DIALOG(dialog) ) == GTK_RESPONSE_ACCEPT )\n    {\n        char *filename;\n\n        filename = gtk_file_chooser_get_filename( GTK_FILE_CHOOSER(dialog) );\n\n        path = filename;\n        \n        g_free( filename );\n\n        currentOpenPath = getDirectoryFromPath(path);\n       \t\n        result = true;\n    }\n\n    WaitForCleanup();\n    gtk_widget_destroy(dialog);\n    WaitForCleanup();\n\n    return result;\n}\n\n\/\/\/ Dialog for saving file\nbool\t\tsaveFileDialog( std::string & path, const char* type, int maxsize  )\n{\n\tstatic std::string currentSavePath=\"none\";\n\n\tbool result = false;\n\tchar * outPath;\n\n\tGtkWidget *dialog;\n\n    if ( !gtk_init_check( NULL, NULL ) )\n    {\n        return false;\n    }\n\n    dialog = gtk_file_chooser_dialog_new( \"Save File\",\n                                          NULL,\n                                          GTK_FILE_CHOOSER_ACTION_SAVE,\n                                          \"_Cancel\", GTK_RESPONSE_CANCEL,\n                                          \"_Save\", GTK_RESPONSE_ACCEPT,\n                                          NULL );\n\n    bool typeSpecified = true;\n    if( strcmp(type,\"*\")==0 )\n\t{\n\t\ttypeSpecified = false;\n\t}\n\telse\n\t{\n    \tAddFiltersToDialog(dialog, type);\n    }\n\n    \/* Set the default path *\/\n    if( currentSavePath != \"none\" )\n    \tSetDefaultPath(dialog, currentSavePath.c_str());\n    else\n    \tSetDefaultPath(dialog, getCurrentDirectory().c_str());\n\n    result = false;\n    if ( gtk_dialog_run( GTK_DIALOG(dialog) ) == GTK_RESPONSE_ACCEPT )\n    {\n        char *filename;\n\n        filename = gtk_file_chooser_get_filename( GTK_FILE_CHOOSER(dialog) );\n\n        std::string res = filename;\n        if(typeSpecified)\n\t\t{\n\t\t\tstd::string suff = getFileExt(res);\n\t\t\tif( suff != type )\n\t\t\t{\n\t\t\t\tres = getPathWithoutExt(res) + \".\" + std::string(type);\n\t\t\t}\n\t\t}\n\n\t\tpath = res;\n       \t\n       \tcurrentSavePath = getDirectoryFromPath(path);\n\n        g_free( filename );\n\n        result = true;\n    }\n\n    WaitForCleanup();\n    gtk_widget_destroy(dialog);\n    WaitForCleanup();\n\n    return result;\n}\n\n\nstd::string  getExecutablePath()\n{\n\tchar buffer[PATH_MAX];\n\n\tchar* path_end;\n  \t\/* Read the target of \/proc\/self\/exe.  *\/\n  \tif (readlink (\"\/proc\/self\/exe\", buffer, PATH_MAX) <= 0)\n    \treturn \"\";\n  \t\/* Find the last occurence of a forward slash, the path separator.  *\/\n \tpath_end = strrchr (buffer, '\/');\n  \tif (path_end == NULL)\n    \treturn \"\";\n \t \/* Advance to the character past the last slash.  *\/\n  \t++path_end;\n\t\/* Obtain the directory containing the program by truncating the\n\t   path after the last slash.  *\/\n\t*path_end = '\\0';\n\t\/* The length of the path is the number of characters up through the\n\t last slash.  *\/\n\treturn std::string(buffer); \n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Gross filewatcher\n\n#define EVENT_SIZE  ( sizeof (struct inotify_event) )\n#define EVENT_BUF_LEN     ( 1024 * ( EVENT_SIZE + 16 ) )\n\nFileWatcher::FileWatcher( const std::string & path, int msecs  )\n:\nfileFlags(0),\nmsecs(msecs)\n{\n  \/\/http:\/\/man7.org\/tlpi\/code\/online\/diff\/inotify\/demo_inotify.c.html\n\n    struct inotify_event *event;\n\n    fd = inotify_init();                 \/* Create inotify instance *\/\n    if (fd == -1)\n        assert(0);\n\n    int wd = inotify_add_watch(fd, path.c_str(), IN_ALL_EVENTS ); \/\/IN_ALL_EVENTS);\n\n    Wd.push_back(wd);\n\n    printf(\"Watching file: %s\\n\", path.c_str());\n    \/\/paths.push_back(path);\n\n    running = true;\n    thread = std::thread(&FileWatcher::run, this);\n}\n\nFileWatcher::~FileWatcher()\n{\n    stop();\n    for( int i = 0; i < Wd.size(); i++ )\n        inotify_rm_watch( fd, Wd[i] );\n    close(fd);\n    printf(\"Closed file watcher\\n\");\n}\n\nbool FileWatcher::hasFileChanged()\n{\n  bool res = fileFlags != 0;\n  fileFlags = 0;\n  return res;\n}\n\nstatic void             \/* Display information from inotify_event structure *\/\n displayInotifyEvent(FileWatcher * watcher, struct inotify_event *i)\n {\n    \n     printf(\"    wd =%2d; \", i->wd);\n     if (i->cookie > 0)\n         printf(\"cookie =%4d; \", i->cookie);\n    \n    \n     printf(\"mask = \");\n     if (i->mask & IN_ACCESS)        printf(\"IN_ACCESS \");\n     if (i->mask & IN_ATTRIB)        printf(\"IN_ATTRIB \");\n     if (i->mask & IN_CLOSE_NOWRITE) printf(\"IN_CLOSE_NOWRITE \");\n     if (i->mask & IN_CLOSE_WRITE)   printf(\"IN_CLOSE_WRITE \");\n     if (i->mask & IN_CREATE)        printf(\"IN_CREATE \");\n     if (i->mask & IN_DELETE)        printf(\"IN_DELETE \");\n     if (i->mask & IN_DELETE_SELF)   printf(\"IN_DELETE_SELF \");\n     if (i->mask & IN_IGNORED)       printf(\"IN_IGNORED \");\n     if (i->mask & IN_ISDIR)         printf(\"IN_ISDIR \");\n     if (i->mask & IN_MODIFY)        printf(\"IN_MODIFY \");\n     if (i->mask & IN_MOVE_SELF)     printf(\"IN_MOVE_SELF \");\n     if (i->mask & IN_MOVED_FROM)    printf(\"IN_MOVED_FROM \");\n     if (i->mask & IN_MOVED_TO)      printf(\"IN_MOVED_TO \");\n     if (i->mask & IN_OPEN)          printf(\"IN_OPEN \");\n     if (i->mask & IN_Q_OVERFLOW)    printf(\"IN_Q_OVERFLOW \");\n     if (i->mask & IN_UNMOUNT)       printf(\"IN_UNMOUNT \");\n     printf(\"\\n\");\n    \n\n\n    if( i->len < 1 )\n        return;\n\n    printf(\"caz\\n\");\n\n    std::string name = i->name;\n    if( getFileExt(name) == \"py\" && getFilenameFromPath(name) != \"tmp.py\" )\n    {\n        printf(\"Modified file: %s\\n\", i->name);\n        watcher->fileFlags = 1;\n    }\n\n }\n \nvoid FileWatcher::stop()\n{\n    if(running)\n    {\n        mutex.lock();\n        printf(\"Joining thread\\n\");\n        running = false;\n        thread.join();\n        printf(\"Stopped file watching thread\\n\");\n        mutex.unlock();\n    }\n}\n\nvoid FileWatcher::run()\n{\n  char *p;\n  struct inotify_event *event;\n  char buf[EVENT_BUF_LEN] __attribute__ ((aligned(8)));\n  printf(\"Starting file watcher\\n\");\n\n  while( running )\n  {\n        printf(\"Polling\\n\");\n        \/\/std::this_thread::sleep_for(std::chrono::milliseconds(200));\n\n        \/\/mutex.lock();\n        struct pollfd pfd = { fd, POLLIN, 0 };\n        int ret = poll(&pfd, 1, 1050);  \/\/ timeout of 50ms\n        if (ret < 0) {\n            fprintf(stderr, \"poll failed: %s\\n\", strerror(errno));\n        } else if (ret == 0) {\n            printf(\"nothing from poll\\n\");\n            continue;\n        }\n\n        int numRead = read(fd, buf, EVENT_BUF_LEN);\n    \n        if( numRead == 0 )\n    {\n        printf(\"nothing to read\\n\");\n      continue;\n    }\n    else\n    {\n        printf(\"stuff\\n\");\n    }\n    for (p = buf; p < buf + numRead; ) {\n             event = (struct inotify_event *) p;\n             displayInotifyEvent(this, event);\n         \/\/fileFlags = 1;\n             p += EVENT_SIZE + event->len;\n         }\n         \/\/mutex.unlock();\n         std::this_thread::sleep_for(std::chrono::milliseconds(10));\n\n    \/\/Thread::sleep(msecs);\n  }\n\n  printf(\"Exit loop\\n\");\n}\n\n\n}<|endoftext|>"}
{"text":"<commit_before>\/*\r\nCopyright (c) 2017 InversePalindrome\r\nMemento Mori - PauseState.cpp\r\nInversePalindrome.com\r\n*\/\r\n\r\n\r\n#include \"PauseState.hpp\"\r\n#include \"StateMachine.hpp\"\r\n\r\n#include <SFGUI\/Image.hpp>\r\n\r\n\r\nPauseState::PauseState(StateMachine& stateMachine, SharedData& sharedData) :\r\n\tState(stateMachine, sharedData),\r\n\tpauseMenu(sharedData.textures[Textures::ID::PauseMenu]),\r\n\tresumeButton(sfg::Button::Create()),\r\n\trestartButton(sfg::Button::Create()),\r\n\tsettingsButton(sfg::Button::Create()),\r\n\tquitButton(sfg::Button::Create())\r\n{\r\n\tpauseMenu.setPosition(sf::Vector2f(1020.f, 280.f));\r\n\r\n\tresumeButton->SetImage(sfg::Image::Create(sharedData.images[Images::ID::ResumeButton]));\r\n\tresumeButton->SetPosition(sf::Vector2f(1078.f, 428.f));\r\n\tresumeButton->GetSignal(sfg::Widget::OnLeftClick).Connect([this] { transitionToGame(); });\r\n\r\n\trestartButton->SetImage(sfg::Image::Create(sharedData.images[Images::ID::RestartButton]));\r\n\trestartButton->SetPosition(sf::Vector2f(1078.f, 578.f));\r\n\trestartButton->GetSignal(sfg::Widget::OnLeftClick).Connect([this] { restartGame(); });\r\n\r\n\tsettingsButton->SetImage(sfg::Image::Create(sharedData.images[Images::ID::SettingsButton2]));\r\n\tsettingsButton->SetPosition(sf::Vector2f(1078.f, 728.f));\r\n\tsettingsButton->GetSignal(sfg::Widget::OnLeftClick).Connect([this] { transitionToSettings(); });\r\n\r\n\tquitButton->SetImage(sfg::Image::Create(sharedData.images[Images::ID::QuitButton]));\r\n\tquitButton->SetPosition(sf::Vector2f(1078.f, 878.f));\r\n\tquitButton->GetSignal(sfg::Widget::OnLeftClick).Connect([this] { transitionToMenu(); });\r\n\r\n\tsharedData.hud.Add(resumeButton);\r\n\tsharedData.hud.Add(restartButton);\r\n\tsharedData.hud.Add(settingsButton);\r\n\tsharedData.hud.Add(quitButton);\r\n}\r\n\r\nvoid PauseState::handleEvent(const sf::Event& event)\r\n{\r\n\r\n}\r\n\r\nvoid PauseState::update(sf::Time deltaTime)\r\n{\r\n\tthis->resumeButton->Show(true);\r\n\tthis->restartButton->Show(true);\r\n\tthis->settingsButton->Show(true);\r\n\tthis->quitButton->Show(true);\r\n}\r\n\r\nvoid PauseState::draw()\r\n{\r\n\tthis->sharedData.window.draw(this->pauseMenu);\r\n}\r\n\r\nbool PauseState::isTransparent()\r\n{\r\n\treturn true;\r\n}\r\n\r\nvoid PauseState::transitionToGame()\r\n{\r\n\tthis->resumeButton->Show(false);\r\n\tthis->restartButton->Show(false);\r\n\tthis->settingsButton->Show(false);\r\n\tthis->quitButton->Show(false);\r\n\r\n\tthis->stateMachine.popState();\r\n}\r\n\r\nvoid PauseState::restartGame()\r\n{\r\n\tthis->resumeButton->Show(false);\r\n\tthis->restartButton->Show(false);\r\n\tthis->settingsButton->Show(false);\r\n\tthis->quitButton->Show(false);\r\n\r\n\tthis->stateMachine.clearStates();\r\n\tthis->stateMachine.pushState(StateMachine::StateID::Game);\r\n}\r\n\r\nvoid PauseState::transitionToSettings()\r\n{\r\n\tthis->resumeButton->Show(false);\r\n\tthis->restartButton->Show(false);\r\n\tthis->settingsButton->Show(false);\r\n\tthis->quitButton->Show(false);\r\n\r\n\tthis->stateMachine.pushState(StateMachine::StateID::Settings);\r\n}\r\n\r\nvoid PauseState::transitionToMenu()\r\n{\r\n\tthis->resumeButton->Show(false);\r\n\tthis->restartButton->Show(false);\r\n\tthis->settingsButton->Show(false);\r\n\tthis->quitButton->Show(false);\r\n\r\n\tthis->stateMachine.clearStates();\r\n\tthis->stateMachine.pushState(StateMachine::StateID::Menu);\r\n}<commit_msg>Delete PauseState.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"AudioDevice.h\"\n\nextern \"C\" {\n#include \"gba.h\"\n#include \"gba-audio.h\"\n#include \"gba-thread.h\"\n}\n\nusing namespace QGBA;\n\nAudioDevice::AudioDevice(QObject* parent)\n\t: QIODevice(parent)\n\t, m_context(nullptr)\n{\n\tsetOpenMode(ReadOnly);\n}\n\nvoid AudioDevice::setFormat(const QAudioFormat& format) {\n\tif (!GBAThreadHasStarted(m_context)) {\n\t\treturn;\n\t}\n\tGBAThreadInterrupt(m_context);\n\tm_ratio = GBAAudioCalculateRatio(&m_context->gba->audio, m_context->fpsTarget, format.sampleRate());\n\tGBAThreadContinue(m_context);\n}\n\nvoid AudioDevice::setInput(GBAThread* input) {\n\tm_context = input;\n}\n\nqint64 AudioDevice::readData(char* data, qint64 maxSize) {\n\tif (maxSize > 0xFFFFFFFF) {\n\t\tmaxSize = 0xFFFFFFFF;\n\t}\n\n\tif (!m_context->gba) {\n\t\treturn 0;\n\t}\n\n\treturn GBAAudioResampleNN(&m_context->gba->audio, m_ratio, &m_drift, reinterpret_cast<GBAStereoSample*>(data), maxSize \/ sizeof(GBAStereoSample)) * sizeof(GBAStereoSample);\n}\n\nqint64 AudioDevice::writeData(const char*, qint64) {\n\treturn 0;\n}\n<commit_msg>Initialize audio drift<commit_after>#include \"AudioDevice.h\"\n\nextern \"C\" {\n#include \"gba.h\"\n#include \"gba-audio.h\"\n#include \"gba-thread.h\"\n}\n\nusing namespace QGBA;\n\nAudioDevice::AudioDevice(QObject* parent)\n\t: QIODevice(parent)\n\t, m_context(nullptr)\n\t, m_drift(0)\n{\n\tsetOpenMode(ReadOnly);\n}\n\nvoid AudioDevice::setFormat(const QAudioFormat& format) {\n\tif (!GBAThreadHasStarted(m_context)) {\n\t\treturn;\n\t}\n\tGBAThreadInterrupt(m_context);\n\tm_ratio = GBAAudioCalculateRatio(&m_context->gba->audio, m_context->fpsTarget, format.sampleRate());\n\tGBAThreadContinue(m_context);\n}\n\nvoid AudioDevice::setInput(GBAThread* input) {\n\tm_context = input;\n}\n\nqint64 AudioDevice::readData(char* data, qint64 maxSize) {\n\tif (maxSize > 0xFFFFFFFF) {\n\t\tmaxSize = 0xFFFFFFFF;\n\t}\n\n\tif (!m_context->gba) {\n\t\treturn 0;\n\t}\n\n\treturn GBAAudioResampleNN(&m_context->gba->audio, m_ratio, &m_drift, reinterpret_cast<GBAStereoSample*>(data), maxSize \/ sizeof(GBAStereoSample)) * sizeof(GBAStereoSample);\n}\n\nqint64 AudioDevice::writeData(const char*, qint64) {\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"acmacs-base\/argv.hh\"\n\/\/ #include \"acmacs-base\/range-v3.hh\"\n#include \"acmacs-base\/enumerate.hh\"\n#include \"acmacs-base\/string-join.hh\"\n#include \"acmacs-chart-2\/factory-import.hh\"\n#include \"acmacs-chart-2\/chart.hh\"\n#include \"hidb-5\/hidb-set.hh\"\n#include \"hidb-5\/hidb.hh\"\n#include \"acmacs-whocc\/log.hh\"\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    option<str_array> verbose{*this, 'v', \"verbose\", desc{\"comma separated list (or multiple switches) of log enablers\"}};\n\n    argument<str_array> tables{*this, arg_name{\".ace\"}, mandatory};\n};\n\nint main(int argc, char* const argv[])\n{\n    using namespace std::string_view_literals;\n    int exit_code = 0;\n    try {\n        Options opt(argc, argv);\n        acmacs::log::enable(opt.verbose);\n\n        for (const auto& filename : *opt.tables) {\n            auto chart = acmacs::chart::import_from_file(filename);\n            AD_INFO(\"{}\", chart->make_name());\n            const auto& hidb = hidb::get(chart->info()->virus_type(acmacs::chart::Info::Compute::Yes));\n            auto tables = hidb.tables();\n\n            auto antigens = chart->antigens();\n            for (auto [ag_no, antigen] : acmacs::enumerate(*antigens)) {\n                if (!antigen->distinct()) {\n                    const auto hidb_antigens = hidb.antigens()->find(antigen->name(), hidb::fix_location::no);\n                    if (!hidb_antigens.empty()) {\n                        const auto full_name = antigen->full_name();\n                        fmt::print(\"AG {:3d} \\\"{}\\\"\\n\", ag_no, full_name);\n                        std::vector<std::pair<std::string, fmt::memory_buffer>> hidb_variants;\n                        bool full_name_match_present{false};\n                        for (const auto& [hidb_antigen, hidb_index] : hidb_antigens) {\n                            auto hidb_antigen_full_name =\n                                acmacs::string::join(acmacs::string::join_space, hidb_antigen->name(), acmacs::string::join(acmacs::string::join_space, hidb_antigen->annotations()),\n                                                     hidb_antigen->reassortant(), hidb_antigen->passage());\n                            full_name_match_present |= hidb_antigen_full_name == full_name;\n                            auto& variant = hidb_variants.emplace_back(std::move(hidb_antigen_full_name), fmt::memory_buffer{});\n                            const auto by_lab_assay = hidb.tables(*hidb_antigen, hidb::lab_assay_table_t::recent_first);\n                            for (auto entry : by_lab_assay) {\n                                fmt::format_to(variant.second, \"        {}:{} ({})\", entry.lab, entry.assay, entry.tables.size());\n                                for (auto table : entry.tables)\n                                    fmt::format_to(variant.second, \" {}{}\", table->date(), entry.assay); \/\/ rbc(entry.assay, table->rbc()));\n                                fmt::format_to(variant.second, \"\\n\");\n                            }\n                        }\n                        std::sort(std::begin(hidb_variants), std::end(hidb_variants), [&full_name](const auto& e1, const auto& e2) {\n                            const auto f1 = e1.first == full_name, f2 = e2.first == full_name;\n                            if (f1 && !f2)\n                                return true;\n                            else if (!f1 && f2)\n                                return false;\n                            else\n                                return e1.first < e2.first;\n                        });\n                        if (!full_name_match_present)\n                            hidb_variants.emplace(hidb_variants.begin(), \"*** New ***\", fmt::memory_buffer{});\n                        for (const auto& variant : hidb_variants)\n                            fmt::print(\"    {}\\n{}\", variant.first, fmt::to_string(variant.second));\n                    }\n                }\n            }\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>whocc-check-new-tables<commit_after>#include \"acmacs-base\/argv.hh\"\n\/\/ #include \"acmacs-base\/range-v3.hh\"\n#include \"acmacs-base\/enumerate.hh\"\n#include \"acmacs-base\/string-join.hh\"\n#include \"acmacs-chart-2\/factory-import.hh\"\n#include \"acmacs-chart-2\/chart.hh\"\n#include \"hidb-5\/hidb-set.hh\"\n#include \"hidb-5\/hidb.hh\"\n#include \"acmacs-whocc\/log.hh\"\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    option<str_array> verbose{*this, 'v', \"verbose\", desc{\"comma separated list (or multiple switches) of log enablers\"}};\n\n    argument<str_array> tables{*this, arg_name{\".ace\"}, mandatory};\n};\n\nint main(int argc, char* const argv[])\n{\n    using namespace std::string_view_literals;\n    int exit_code = 0;\n    try {\n        Options opt(argc, argv);\n        acmacs::log::enable(opt.verbose);\n\n        for (const auto& filename : *opt.tables) {\n            auto chart = acmacs::chart::import_from_file(filename);\n            AD_INFO(\"{}\", chart->make_name());\n            const auto& hidb = hidb::get(chart->info()->virus_type(acmacs::chart::Info::Compute::Yes));\n            auto tables = hidb.tables();\n\n            auto antigens = chart->antigens();\n            for (auto [ag_no, antigen] : acmacs::enumerate(*antigens)) {\n                if (!antigen->distinct()) {\n                    const auto hidb_antigens = hidb.antigens()->find(antigen->name(), hidb::fix_location::no);\n                    if (!hidb_antigens.empty()) {\n                        const auto full_name = antigen->full_name();\n                        fmt::print(\"AG {:3d} \\\"{}\\\"\\n\", ag_no, full_name);\n                        std::vector<std::pair<std::string, fmt::memory_buffer>> hidb_variants;\n                        bool full_name_match_present{false};\n                        for (const auto& [hidb_antigen, hidb_index] : hidb_antigens) {\n                            auto hidb_antigen_full_name =\n                                acmacs::string::join(acmacs::string::join_space, hidb_antigen->name(), acmacs::string::join(acmacs::string::join_space, hidb_antigen->annotations()),\n                                                     hidb_antigen->reassortant(), hidb_antigen->passage());\n                            full_name_match_present |= hidb_antigen_full_name == full_name;\n                            auto& variant = hidb_variants.emplace_back(std::move(hidb_antigen_full_name), fmt::memory_buffer{});\n                            const auto by_lab_assay = hidb.tables(*hidb_antigen, hidb::lab_assay_rbc_table_t::recent_first);\n                            for (auto entry : by_lab_assay) {\n                                fmt::format_to(variant.second, \"        [{} {} {}] ({})\", entry.lab, entry.assay, entry.rbc, entry.tables.size());\n                                for (auto table : entry.tables)\n                                    fmt::format_to(variant.second, \" {}\", table->date());\n                                fmt::format_to(variant.second, \"\\n\");\n                            }\n                        }\n                        std::sort(std::begin(hidb_variants), std::end(hidb_variants), [&full_name](const auto& e1, const auto& e2) {\n                            const auto f1 = e1.first == full_name, f2 = e2.first == full_name;\n                            if (f1 && !f2)\n                                return true;\n                            else if (!f1 && f2)\n                                return false;\n                            else\n                                return e1.first < e2.first;\n                        });\n                        if (!full_name_match_present)\n                            hidb_variants.emplace(hidb_variants.begin(), \"*** New ***\", fmt::memory_buffer{});\n                        for (const auto& variant : hidb_variants)\n                            fmt::print(\"    {}\\n{}\", variant.first, fmt::to_string(variant.second));\n                    }\n                }\n            }\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>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXQt - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2012 Razor team\n * Authors:\n *   Alexander Sokoloff <sokoloff.a@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\n#include \"lxqtgridlayout.h\"\n#include <QDebug>\n#include <math.h>\n#include <QWidget>\n#include <QVariantAnimation>\n\nusing namespace LXQt;\n\nnamespace\n{\n    class ItemMoveAnimation : public QVariantAnimation\n    {\n    public:\n        static void animate(QLayoutItem * item, QRect const & geometry)\n        {\n            ItemMoveAnimation* animation = new ItemMoveAnimation(item);\n            animation->setStartValue(item->geometry());\n            animation->setEndValue(geometry);\n            animation->start(DeleteWhenStopped);\n        }\n\n        ItemMoveAnimation(QLayoutItem *item)\n            : mItem(item)\n        {\n            setEasingCurve(QEasingCurve::OutBack);\n            setDuration(250);\n        }\n\n        void updateCurrentValue(const QVariant &current)\n        {\n            mItem->setGeometry(current.toRect());\n        }\n\n    private:\n        QLayoutItem* mItem;\n\n    };\n}\n\nclass LXQt::GridLayoutPrivate\n{\npublic:\n    GridLayoutPrivate();\n\n    QList<QLayoutItem*> mItems;\n    int mRowCount;\n    int mColumnCount;\n    GridLayout::Direction mDirection;\n\n    bool mIsValid;\n    QSize mCellSizeHint;\n    QSize mCellMaxSize;\n    int mVisibleCount;\n    GridLayout::Stretch mStretch;\n    bool mAnimate;\n\n\n    void updateCache();\n    int rows() const;\n    int cols() const;\n    void setItemGeometry(QLayoutItem * item, QRect const & geometry);\n    QSize mPrefCellMinSize;\n    QSize mPrefCellMaxSize;\n    QRect mOccupiedGeometry;\n};\n\n\n\/************************************************\n\n ************************************************\/\nGridLayoutPrivate::GridLayoutPrivate()\n{\n    mColumnCount = 0;\n    mRowCount = 0;\n    mDirection = GridLayout::LeftToRight;\n    mIsValid = false;\n    mVisibleCount = 0;\n    mStretch = GridLayout::StretchHorizontal | GridLayout::StretchVertical;\n    mAnimate = false;\n    mPrefCellMinSize = QSize(0,0);\n    mPrefCellMaxSize = QSize(QWIDGETSIZE_MAX, QWIDGETSIZE_MAX);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayoutPrivate::updateCache()\n{\n    mCellSizeHint = QSize(0, 0);\n    mCellMaxSize = QSize(0, 0);\n    mVisibleCount = 0;\n\n    for (int i=0; i<mItems.count(); ++i)\n    {\n        QLayoutItem *item = mItems.at(i);\n        if (!item->widget() || item->widget()->isHidden())\n            continue;\n\n        int h = qBound(item->minimumSize().height(),\n                       item->sizeHint().height(),\n                       item->maximumSize().height());\n\n        int w = qBound(item->minimumSize().width(),\n                       item->sizeHint().width(),\n                       item->maximumSize().width());\n\n        mCellSizeHint.rheight() = qMax(mCellSizeHint.height(), h);\n        mCellSizeHint.rwidth()  = qMax(mCellSizeHint.width(), w);\n\n        mCellMaxSize.rheight() = qMax(mCellMaxSize.height(), item->maximumSize().height());\n        mCellMaxSize.rwidth()  = qMax(mCellMaxSize.width(), item->maximumSize().width());\n        mVisibleCount++;\n\n#if 0\n        qDebug() << \"-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-\";\n        qDebug() << \"item.min\" << item->minimumSize().width();\n        qDebug() << \"item.sz \" << item->sizeHint().width();\n        qDebug() << \"item.max\" << item->maximumSize().width();\n        qDebug() << \"w h\" << w << h;\n        qDebug() << \"wid.sizeHint\" << item->widget()->sizeHint();\n        qDebug() << \"mCellSizeHint:\" << mCellSizeHint;\n        qDebug() << \"mCellMaxSize: \" << mCellMaxSize;\n        qDebug() << \"-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-\";\n#endif\n\n    }\n    mCellSizeHint.rwidth() = qBound(mPrefCellMinSize.width(),  mCellSizeHint.width(),  mPrefCellMaxSize.width());\n    mCellSizeHint.rheight()= qBound(mPrefCellMinSize.height(), mCellSizeHint.height(), mPrefCellMaxSize.height());\n    mIsValid = !mCellSizeHint.isEmpty();\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayoutPrivate::rows() const\n{\n    if (mRowCount)\n        return mRowCount;\n\n    if (!mColumnCount)\n        return 1;\n\n    return ceil(mVisibleCount * 1.0 \/ mColumnCount);\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayoutPrivate::cols() const\n{\n    if (mColumnCount)\n        return mColumnCount;\n\n    int rows = mRowCount;\n    if (!rows)\n        rows = 1;\n\n    return ceil(mVisibleCount * 1.0 \/ rows);\n}\n\nvoid GridLayoutPrivate::setItemGeometry(QLayoutItem * item, QRect const & geometry)\n{\n    mOccupiedGeometry |= geometry;\n    if (mAnimate)\n    {\n        ItemMoveAnimation::animate(item, geometry);\n    } else\n    {\n        item->setGeometry(geometry);\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nGridLayout::GridLayout(QWidget *parent):\n    QLayout(parent),\n    d_ptr(new GridLayoutPrivate())\n{\n}\n\n\n\/************************************************\n\n ************************************************\/\nGridLayout::~GridLayout()\n{\n    delete d_ptr;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::addItem(QLayoutItem *item)\n{\n    d_ptr->mItems.append(item);\n}\n\n\n\/************************************************\n\n ************************************************\/\nQLayoutItem *GridLayout::itemAt(int index) const\n{\n    Q_D(const GridLayout);\n    if (index < 0 || index >= d->mItems.count())\n        return 0;\n\n    return d->mItems.at(index);\n}\n\n\n\/************************************************\n\n ************************************************\/\nQLayoutItem *GridLayout::takeAt(int index)\n{\n    Q_D(GridLayout);\n    if (index < 0 || index >= d->mItems.count())\n        return 0;\n\n    QLayoutItem *item = d->mItems.takeAt(index);\n    return item;\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayout::count() const\n{\n    Q_D(const GridLayout);\n    return d->mItems.count();\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::invalidate()\n{\n    Q_D(GridLayout);\n    d->mIsValid = false;\n    QLayout::invalidate();\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayout::rowCount() const\n{\n    Q_D(const GridLayout);\n    return d->mRowCount;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setRowCount(int value)\n{\n    Q_D(GridLayout);\n    if (d->mRowCount != value)\n    {\n        d->mRowCount = value;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayout::columnCount() const\n{\n    Q_D(const GridLayout);\n    return d->mColumnCount;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setColumnCount(int value)\n{\n    Q_D(GridLayout);\n    if (d->mColumnCount != value)\n    {\n        d->mColumnCount = value;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nGridLayout::Direction GridLayout::direction() const\n{\n    Q_D(const GridLayout);\n    return d->mDirection;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setDirection(GridLayout::Direction value)\n{\n    Q_D(GridLayout);\n    if (d->mDirection != value)\n    {\n        d->mDirection = value;\n        invalidate();\n    }\n}\n\n\/************************************************\n\n ************************************************\/\nGridLayout::Stretch GridLayout::stretch() const\n{\n    Q_D(const GridLayout);\n    return d->mStretch;\n}\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setStretch(Stretch value)\n{\n    Q_D(GridLayout);\n    if (d->mStretch != value)\n    {\n        d->mStretch = value;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::moveItem(int from, int to, bool withAnimation \/*= false*\/)\n{\n    Q_D(GridLayout);\n    d->mAnimate = withAnimation;\n    d->mItems.move(from, to);\n    invalidate();\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize GridLayout::cellMinimumSize() const\n{\n    Q_D(const GridLayout);\n    return d->mPrefCellMinSize;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMinimumSize(QSize minSize)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize != minSize)\n    {\n        d->mPrefCellMinSize = minSize;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMinimumHeight(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize.height() != value)\n    {\n        d->mPrefCellMinSize.setHeight(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMinimumWidth(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize.width() != value)\n    {\n        d->mPrefCellMinSize.setWidth(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize GridLayout::cellMaximumSize() const\n{\n    Q_D(const GridLayout);\n    return d->mPrefCellMaxSize;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMaximumSize(QSize maxSize)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMaxSize != maxSize)\n    {\n        d->mPrefCellMaxSize = maxSize;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMaximumHeight(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMaxSize.height() != value)\n    {\n        d->mPrefCellMaxSize.setHeight(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMaximumWidth(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMaxSize.width() != value)\n    {\n        d->mPrefCellMaxSize.setWidth(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellFixedSize(QSize size)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize != size ||\n        d->mPrefCellMaxSize != size)\n    {\n        d->mPrefCellMinSize = size;\n        d->mPrefCellMaxSize = size;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellFixedHeight(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize.height() != value ||\n        d->mPrefCellMaxSize.height() != value)\n    {\n        d->mPrefCellMinSize.setHeight(value);\n        d->mPrefCellMaxSize.setHeight(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellFixedWidth(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize.width() != value ||\n        d->mPrefCellMaxSize.width() != value)\n    {\n        d->mPrefCellMinSize.setWidth(value);\n        d->mPrefCellMaxSize.setWidth(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize GridLayout::sizeHint() const\n{\n    Q_D(const GridLayout);\n\n    if (!d->mIsValid)\n        const_cast<GridLayoutPrivate*>(d)->updateCache();\n\n    return QSize(d->cols() * d->mCellSizeHint.width(),\n                 d->rows() * d->mCellSizeHint.height());\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setGeometry(const QRect &geometry)\n{\n    Q_D(GridLayout);\n\n    QLayout::setGeometry(geometry);\n    d->mOccupiedGeometry.setTopLeft(geometry.topLeft());\n    d->mOccupiedGeometry.setBottomRight(geometry.topLeft());\n\n    if (!d->mIsValid)\n        d->updateCache();\n\n    int y = geometry.top();\n    int x = geometry.left();\n\n    \/\/ For historical reasons QRect::right returns left() + width() - 1\n    \/\/ and QRect::bottom() returns top() + height() - 1;\n    \/\/ So we use left() + height() and top() + height()\n    \/\/\n    \/\/ http:\/\/qt-project.org\/doc\/qt-4.8\/qrect.html\n\n    const int maxX = geometry.left() + geometry.width();\n    const int maxY = geometry.top() + geometry.height();\n\n    const bool stretch_h = d->mStretch.testFlag(StretchHorizontal);\n    const bool stretch_v = d->mStretch.testFlag(StretchVertical);\n\n    const int cols = d->cols();\n    int itemWidth = 0;\n    if (stretch_h && 0 < cols)\n        itemWidth = qMin(geometry.width() \/ cols, d->mCellMaxSize.width());\n    else\n        itemWidth = d->mCellSizeHint.width();\n    itemWidth = qBound(qMin(d->mPrefCellMinSize.width(), maxX), itemWidth, d->mPrefCellMaxSize.width());\n    const int widthRemain = stretch_h && 0 < itemWidth ? geometry.width() % itemWidth : 0;\n\n    const int rows = d->rows();\n    int itemHeight = 0;\n    if (stretch_v && 0 < rows)\n        itemHeight = qMin(geometry.height() \/ rows, d->mCellMaxSize.height());\n    else\n        itemHeight = d->mCellSizeHint.height();\n    itemHeight = qBound(qMin(d->mPrefCellMinSize.height(), maxY), itemHeight, d->mPrefCellMaxSize.height());\n    const int heightRemain = stretch_v && 0 < itemHeight ? geometry.height() % itemHeight : 0;\n\n#if 0\n    qDebug() << \"** GridLayout::setGeometry *******************************\";\n    qDebug() << \"Geometry:\" << geometry;\n    qDebug() << \"CellSize:\" << d->mCellSizeHint;\n    qDebug() << \"Constraints:\" << \"min\" << d->mPrefCellMinSize << \"max\" << d->mPrefCellMaxSize;\n    qDebug() << \"Count\" << count();\n    qDebug() << \"Cols:\" << d->cols() << \"(\" << d->mColumnCount << \")\";\n    qDebug() << \"Rows:\" << d->rows() << \"(\" << d->mRowCount << \")\";\n    qDebug() << \"Stretch:\" << \"h:\" << (d->mStretch.testFlag(StretchHorizontal)) << \" v:\" << (d->mStretch.testFlag(StretchVertical));\n    qDebug() << \"Item:\" << \"h:\" << itemHeight << \" w:\" << itemWidth;\n#endif\n\n    int remain_height = heightRemain;\n    int remain_width = widthRemain;\n    if (d->mDirection == LeftToRight)\n    {\n        int height = itemHeight + (0 < remain_height-- ? 1 : 0);\n        foreach(QLayoutItem *item, d->mItems)\n        {\n            if (!item->widget() || item->widget()->isHidden())\n                continue;\n            int width = itemWidth + (0 < remain_width-- ? 1 : 0);\n\n            if (x + width > maxX)\n            {\n                x = geometry.left();\n                y += height;\n\n                height = itemHeight + (0 < remain_height-- ? 1 : 0);\n                remain_width = widthRemain;\n            }\n\n            d->setItemGeometry(item, QRect(x, y, width, height));\n            x += width;\n        }\n    }\n    else\n    {\n        int width = itemWidth + (0 < remain_width-- ? 1 : 0);\n        foreach(QLayoutItem *item, d->mItems)\n        {\n            if (!item->widget() || item->widget()->isHidden())\n                continue;\n            int height = itemHeight + (0 < remain_height-- ? 1 : 0);\n\n            if (y + height > maxY)\n            {\n                y = geometry.top();\n                x += width;\n\n                width = itemWidth + (0 < remain_width-- ? 1 : 0);\n                remain_height = heightRemain;\n            }\n            d->setItemGeometry(item, QRect(x, y, width, height));\n            y += height;\n        }\n    }\n    d->mAnimate = false;\n}\n\n\/************************************************\n\n ************************************************\/\nQRect GridLayout::occupiedGeometry() const\n{\n    return d_func()->mOccupiedGeometry;\n}\n<commit_msg>gridlayout: Use linear animation<commit_after>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXQt - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2012 Razor team\n * Authors:\n *   Alexander Sokoloff <sokoloff.a@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\n#include \"lxqtgridlayout.h\"\n#include <QDebug>\n#include <math.h>\n#include <QWidget>\n#include <QVariantAnimation>\n\nusing namespace LXQt;\n\nnamespace\n{\n    class ItemMoveAnimation : public QVariantAnimation\n    {\n    public:\n        static void animate(QLayoutItem * item, QRect const & geometry)\n        {\n            ItemMoveAnimation* animation = new ItemMoveAnimation(item);\n            animation->setStartValue(item->geometry());\n            animation->setEndValue(geometry);\n            animation->start(DeleteWhenStopped);\n        }\n\n        ItemMoveAnimation(QLayoutItem *item)\n            : mItem(item)\n        {\n            setDuration(150);\n        }\n\n        void updateCurrentValue(const QVariant &current)\n        {\n            mItem->setGeometry(current.toRect());\n        }\n\n    private:\n        QLayoutItem* mItem;\n\n    };\n}\n\nclass LXQt::GridLayoutPrivate\n{\npublic:\n    GridLayoutPrivate();\n\n    QList<QLayoutItem*> mItems;\n    int mRowCount;\n    int mColumnCount;\n    GridLayout::Direction mDirection;\n\n    bool mIsValid;\n    QSize mCellSizeHint;\n    QSize mCellMaxSize;\n    int mVisibleCount;\n    GridLayout::Stretch mStretch;\n    bool mAnimate;\n\n\n    void updateCache();\n    int rows() const;\n    int cols() const;\n    void setItemGeometry(QLayoutItem * item, QRect const & geometry);\n    QSize mPrefCellMinSize;\n    QSize mPrefCellMaxSize;\n    QRect mOccupiedGeometry;\n};\n\n\n\/************************************************\n\n ************************************************\/\nGridLayoutPrivate::GridLayoutPrivate()\n{\n    mColumnCount = 0;\n    mRowCount = 0;\n    mDirection = GridLayout::LeftToRight;\n    mIsValid = false;\n    mVisibleCount = 0;\n    mStretch = GridLayout::StretchHorizontal | GridLayout::StretchVertical;\n    mAnimate = false;\n    mPrefCellMinSize = QSize(0,0);\n    mPrefCellMaxSize = QSize(QWIDGETSIZE_MAX, QWIDGETSIZE_MAX);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayoutPrivate::updateCache()\n{\n    mCellSizeHint = QSize(0, 0);\n    mCellMaxSize = QSize(0, 0);\n    mVisibleCount = 0;\n\n    for (int i=0; i<mItems.count(); ++i)\n    {\n        QLayoutItem *item = mItems.at(i);\n        if (!item->widget() || item->widget()->isHidden())\n            continue;\n\n        int h = qBound(item->minimumSize().height(),\n                       item->sizeHint().height(),\n                       item->maximumSize().height());\n\n        int w = qBound(item->minimumSize().width(),\n                       item->sizeHint().width(),\n                       item->maximumSize().width());\n\n        mCellSizeHint.rheight() = qMax(mCellSizeHint.height(), h);\n        mCellSizeHint.rwidth()  = qMax(mCellSizeHint.width(), w);\n\n        mCellMaxSize.rheight() = qMax(mCellMaxSize.height(), item->maximumSize().height());\n        mCellMaxSize.rwidth()  = qMax(mCellMaxSize.width(), item->maximumSize().width());\n        mVisibleCount++;\n\n#if 0\n        qDebug() << \"-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-\";\n        qDebug() << \"item.min\" << item->minimumSize().width();\n        qDebug() << \"item.sz \" << item->sizeHint().width();\n        qDebug() << \"item.max\" << item->maximumSize().width();\n        qDebug() << \"w h\" << w << h;\n        qDebug() << \"wid.sizeHint\" << item->widget()->sizeHint();\n        qDebug() << \"mCellSizeHint:\" << mCellSizeHint;\n        qDebug() << \"mCellMaxSize: \" << mCellMaxSize;\n        qDebug() << \"-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-\";\n#endif\n\n    }\n    mCellSizeHint.rwidth() = qBound(mPrefCellMinSize.width(),  mCellSizeHint.width(),  mPrefCellMaxSize.width());\n    mCellSizeHint.rheight()= qBound(mPrefCellMinSize.height(), mCellSizeHint.height(), mPrefCellMaxSize.height());\n    mIsValid = !mCellSizeHint.isEmpty();\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayoutPrivate::rows() const\n{\n    if (mRowCount)\n        return mRowCount;\n\n    if (!mColumnCount)\n        return 1;\n\n    return ceil(mVisibleCount * 1.0 \/ mColumnCount);\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayoutPrivate::cols() const\n{\n    if (mColumnCount)\n        return mColumnCount;\n\n    int rows = mRowCount;\n    if (!rows)\n        rows = 1;\n\n    return ceil(mVisibleCount * 1.0 \/ rows);\n}\n\nvoid GridLayoutPrivate::setItemGeometry(QLayoutItem * item, QRect const & geometry)\n{\n    mOccupiedGeometry |= geometry;\n    if (mAnimate)\n    {\n        ItemMoveAnimation::animate(item, geometry);\n    } else\n    {\n        item->setGeometry(geometry);\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nGridLayout::GridLayout(QWidget *parent):\n    QLayout(parent),\n    d_ptr(new GridLayoutPrivate())\n{\n}\n\n\n\/************************************************\n\n ************************************************\/\nGridLayout::~GridLayout()\n{\n    delete d_ptr;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::addItem(QLayoutItem *item)\n{\n    d_ptr->mItems.append(item);\n}\n\n\n\/************************************************\n\n ************************************************\/\nQLayoutItem *GridLayout::itemAt(int index) const\n{\n    Q_D(const GridLayout);\n    if (index < 0 || index >= d->mItems.count())\n        return 0;\n\n    return d->mItems.at(index);\n}\n\n\n\/************************************************\n\n ************************************************\/\nQLayoutItem *GridLayout::takeAt(int index)\n{\n    Q_D(GridLayout);\n    if (index < 0 || index >= d->mItems.count())\n        return 0;\n\n    QLayoutItem *item = d->mItems.takeAt(index);\n    return item;\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayout::count() const\n{\n    Q_D(const GridLayout);\n    return d->mItems.count();\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::invalidate()\n{\n    Q_D(GridLayout);\n    d->mIsValid = false;\n    QLayout::invalidate();\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayout::rowCount() const\n{\n    Q_D(const GridLayout);\n    return d->mRowCount;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setRowCount(int value)\n{\n    Q_D(GridLayout);\n    if (d->mRowCount != value)\n    {\n        d->mRowCount = value;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nint GridLayout::columnCount() const\n{\n    Q_D(const GridLayout);\n    return d->mColumnCount;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setColumnCount(int value)\n{\n    Q_D(GridLayout);\n    if (d->mColumnCount != value)\n    {\n        d->mColumnCount = value;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nGridLayout::Direction GridLayout::direction() const\n{\n    Q_D(const GridLayout);\n    return d->mDirection;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setDirection(GridLayout::Direction value)\n{\n    Q_D(GridLayout);\n    if (d->mDirection != value)\n    {\n        d->mDirection = value;\n        invalidate();\n    }\n}\n\n\/************************************************\n\n ************************************************\/\nGridLayout::Stretch GridLayout::stretch() const\n{\n    Q_D(const GridLayout);\n    return d->mStretch;\n}\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setStretch(Stretch value)\n{\n    Q_D(GridLayout);\n    if (d->mStretch != value)\n    {\n        d->mStretch = value;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::moveItem(int from, int to, bool withAnimation \/*= false*\/)\n{\n    Q_D(GridLayout);\n    d->mAnimate = withAnimation;\n    d->mItems.move(from, to);\n    invalidate();\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize GridLayout::cellMinimumSize() const\n{\n    Q_D(const GridLayout);\n    return d->mPrefCellMinSize;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMinimumSize(QSize minSize)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize != minSize)\n    {\n        d->mPrefCellMinSize = minSize;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMinimumHeight(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize.height() != value)\n    {\n        d->mPrefCellMinSize.setHeight(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMinimumWidth(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize.width() != value)\n    {\n        d->mPrefCellMinSize.setWidth(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize GridLayout::cellMaximumSize() const\n{\n    Q_D(const GridLayout);\n    return d->mPrefCellMaxSize;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMaximumSize(QSize maxSize)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMaxSize != maxSize)\n    {\n        d->mPrefCellMaxSize = maxSize;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMaximumHeight(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMaxSize.height() != value)\n    {\n        d->mPrefCellMaxSize.setHeight(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellMaximumWidth(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMaxSize.width() != value)\n    {\n        d->mPrefCellMaxSize.setWidth(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellFixedSize(QSize size)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize != size ||\n        d->mPrefCellMaxSize != size)\n    {\n        d->mPrefCellMinSize = size;\n        d->mPrefCellMaxSize = size;\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellFixedHeight(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize.height() != value ||\n        d->mPrefCellMaxSize.height() != value)\n    {\n        d->mPrefCellMinSize.setHeight(value);\n        d->mPrefCellMaxSize.setHeight(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setCellFixedWidth(int value)\n{\n    Q_D(GridLayout);\n    if (d->mPrefCellMinSize.width() != value ||\n        d->mPrefCellMaxSize.width() != value)\n    {\n        d->mPrefCellMinSize.setWidth(value);\n        d->mPrefCellMaxSize.setWidth(value);\n        invalidate();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize GridLayout::sizeHint() const\n{\n    Q_D(const GridLayout);\n\n    if (!d->mIsValid)\n        const_cast<GridLayoutPrivate*>(d)->updateCache();\n\n    return QSize(d->cols() * d->mCellSizeHint.width(),\n                 d->rows() * d->mCellSizeHint.height());\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid GridLayout::setGeometry(const QRect &geometry)\n{\n    Q_D(GridLayout);\n\n    QLayout::setGeometry(geometry);\n    d->mOccupiedGeometry.setTopLeft(geometry.topLeft());\n    d->mOccupiedGeometry.setBottomRight(geometry.topLeft());\n\n    if (!d->mIsValid)\n        d->updateCache();\n\n    int y = geometry.top();\n    int x = geometry.left();\n\n    \/\/ For historical reasons QRect::right returns left() + width() - 1\n    \/\/ and QRect::bottom() returns top() + height() - 1;\n    \/\/ So we use left() + height() and top() + height()\n    \/\/\n    \/\/ http:\/\/qt-project.org\/doc\/qt-4.8\/qrect.html\n\n    const int maxX = geometry.left() + geometry.width();\n    const int maxY = geometry.top() + geometry.height();\n\n    const bool stretch_h = d->mStretch.testFlag(StretchHorizontal);\n    const bool stretch_v = d->mStretch.testFlag(StretchVertical);\n\n    const int cols = d->cols();\n    int itemWidth = 0;\n    if (stretch_h && 0 < cols)\n        itemWidth = qMin(geometry.width() \/ cols, d->mCellMaxSize.width());\n    else\n        itemWidth = d->mCellSizeHint.width();\n    itemWidth = qBound(qMin(d->mPrefCellMinSize.width(), maxX), itemWidth, d->mPrefCellMaxSize.width());\n    const int widthRemain = stretch_h && 0 < itemWidth ? geometry.width() % itemWidth : 0;\n\n    const int rows = d->rows();\n    int itemHeight = 0;\n    if (stretch_v && 0 < rows)\n        itemHeight = qMin(geometry.height() \/ rows, d->mCellMaxSize.height());\n    else\n        itemHeight = d->mCellSizeHint.height();\n    itemHeight = qBound(qMin(d->mPrefCellMinSize.height(), maxY), itemHeight, d->mPrefCellMaxSize.height());\n    const int heightRemain = stretch_v && 0 < itemHeight ? geometry.height() % itemHeight : 0;\n\n#if 0\n    qDebug() << \"** GridLayout::setGeometry *******************************\";\n    qDebug() << \"Geometry:\" << geometry;\n    qDebug() << \"CellSize:\" << d->mCellSizeHint;\n    qDebug() << \"Constraints:\" << \"min\" << d->mPrefCellMinSize << \"max\" << d->mPrefCellMaxSize;\n    qDebug() << \"Count\" << count();\n    qDebug() << \"Cols:\" << d->cols() << \"(\" << d->mColumnCount << \")\";\n    qDebug() << \"Rows:\" << d->rows() << \"(\" << d->mRowCount << \")\";\n    qDebug() << \"Stretch:\" << \"h:\" << (d->mStretch.testFlag(StretchHorizontal)) << \" v:\" << (d->mStretch.testFlag(StretchVertical));\n    qDebug() << \"Item:\" << \"h:\" << itemHeight << \" w:\" << itemWidth;\n#endif\n\n    int remain_height = heightRemain;\n    int remain_width = widthRemain;\n    if (d->mDirection == LeftToRight)\n    {\n        int height = itemHeight + (0 < remain_height-- ? 1 : 0);\n        foreach(QLayoutItem *item, d->mItems)\n        {\n            if (!item->widget() || item->widget()->isHidden())\n                continue;\n            int width = itemWidth + (0 < remain_width-- ? 1 : 0);\n\n            if (x + width > maxX)\n            {\n                x = geometry.left();\n                y += height;\n\n                height = itemHeight + (0 < remain_height-- ? 1 : 0);\n                remain_width = widthRemain;\n            }\n\n            d->setItemGeometry(item, QRect(x, y, width, height));\n            x += width;\n        }\n    }\n    else\n    {\n        int width = itemWidth + (0 < remain_width-- ? 1 : 0);\n        foreach(QLayoutItem *item, d->mItems)\n        {\n            if (!item->widget() || item->widget()->isHidden())\n                continue;\n            int height = itemHeight + (0 < remain_height-- ? 1 : 0);\n\n            if (y + height > maxY)\n            {\n                y = geometry.top();\n                x += width;\n\n                width = itemWidth + (0 < remain_width-- ? 1 : 0);\n                remain_height = heightRemain;\n            }\n            d->setItemGeometry(item, QRect(x, y, width, height));\n            y += height;\n        }\n    }\n    d->mAnimate = false;\n}\n\n\/************************************************\n\n ************************************************\/\nQRect GridLayout::occupiedGeometry() const\n{\n    return d_func()->mOccupiedGeometry;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: autonamecache.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-27 13:51: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 SC_AUTONAMECACHE_HXX\n#define SC_AUTONAMECACHE_HXX\n\n#include <vector>\n#include <hash_map>\n\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n#include \"global.hxx\"\n\ntypedef ::std::vector< ScAddress > ScAutoNameAddresses;\ntypedef ::std::hash_map< String, ScAutoNameAddresses, ScStringHashCode, ::std::equal_to< String > > ScAutoNameHashMap;\n\n\/\/\n\/\/  Cache for faster lookup of automatic names during CompileXML\n\/\/  (during CompileXML, no document content is changed)\n\/\/\n\nclass ScAutoNameCache\n{\n    ScAutoNameHashMap   aNames;\n    ScDocument*         pDoc;\n    SCTAB               nCurrentTab;\n\npublic:\n            ScAutoNameCache( ScDocument* pD );\n            ~ScAutoNameCache();\n\n    const ScAutoNameAddresses& GetNameOccurences( const String& rName, SCTAB nTab );\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.176); FILE MERGED 2008\/04\/01 12:35:50 thb 1.3.176.2: #i85898# Stripping all external header guards 2008\/03\/31 17:13:26 rt 1.3.176.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: autonamecache.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 SC_AUTONAMECACHE_HXX\n#define SC_AUTONAMECACHE_HXX\n\n#include <vector>\n#include <hash_map>\n#include \"address.hxx\"\n#include \"global.hxx\"\n\ntypedef ::std::vector< ScAddress > ScAutoNameAddresses;\ntypedef ::std::hash_map< String, ScAutoNameAddresses, ScStringHashCode, ::std::equal_to< String > > ScAutoNameHashMap;\n\n\/\/\n\/\/  Cache for faster lookup of automatic names during CompileXML\n\/\/  (during CompileXML, no document content is changed)\n\/\/\n\nclass ScAutoNameCache\n{\n    ScAutoNameHashMap   aNames;\n    ScDocument*         pDoc;\n    SCTAB               nCurrentTab;\n\npublic:\n            ScAutoNameCache( ScDocument* pD );\n            ~ScAutoNameCache();\n\n    const ScAutoNameAddresses& GetNameOccurences( const String& rName, SCTAB nTab );\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"DissentTest.hpp\"\n\nnamespace Dissent {\nnamespace Tests {\n  TEST(Crypto, DSAEncrypt)\n  {\n    QSharedPointer<CppDsaPrivateKey> private_key(new CppDsaPrivateKey());\n    QSharedPointer<AsymmetricKey> public_key(private_key->GetPublicKey());\n\n    Integer generator = private_key->GetGenerator();\n    Integer modulus = private_key->GetModulus();\n    Integer subgroup = private_key->GetSubgroup();\n\n    Integer val = generator.Pow(Integer::GetRandomInteger(0, subgroup), modulus);\n    QByteArray initial = val.GetByteArray();\n    QByteArray encrypted = public_key->Encrypt(initial);\n    QByteArray decrypted = private_key->Decrypt(encrypted);\n\n    QByteArray encrypted0 = public_key->Encrypt(initial);\n    QByteArray decrypted0 = private_key->Decrypt(encrypted0);\n\n    EXPECT_EQ(initial, decrypted);\n    EXPECT_NE(encrypted0, encrypted);\n    EXPECT_EQ(decrypted0, decrypted);\n  }\n\n  TEST(Crypto, DSASeriesEncrypt)\n  {\n    QSharedPointer<CppDsaPrivateKey> base_key(new CppDsaPrivateKey());\n    Integer generator = base_key->GetGenerator();\n    Integer subgroup = base_key->GetSubgroup();\n    Integer modulus = base_key->GetModulus();\n\n    QVector<QSharedPointer<CppDsaPrivateKey> > private_keys;\n    QVector<QSharedPointer<AsymmetricKey> > public_keys;\n    int keys = 10;\n\n    for(int idx = 0; idx < keys; idx++) {\n      QSharedPointer<CppDsaPrivateKey> private_key(\n          new CppDsaPrivateKey(modulus, subgroup, generator));\n      private_keys.append(private_key);\n      public_keys.append(QSharedPointer<AsymmetricKey>(private_key->GetPublicKey()));\n    }\n\n    Integer val = generator.Pow(Integer::GetRandomInteger(0, subgroup), modulus);\n    QByteArray initial = val.GetByteArray();\n    QByteArray encrypted = CppDsaPublicKey::SeriesEncrypt(public_keys,\n        val.GetByteArray());\n\n    QByteArray decrypted = encrypted;\n    for(int idx = 0; idx < keys - 1; idx++) {\n      decrypted = private_keys[idx]->SeriesDecrypt(decrypted);\n    }\n    decrypted = private_keys.last()->Decrypt(decrypted);\n\n    QByteArray encrypted0 = CppDsaPublicKey::SeriesEncrypt(public_keys,\n        val.GetByteArray());\n\n    QByteArray decrypted0 = encrypted0;\n    for(int idx = 0; idx < keys - 1; idx++) {\n      decrypted0 = private_keys[idx]->SeriesDecrypt(decrypted0);\n    }\n    QByteArray decrypted0_0 = private_keys[keys - 1]->SeriesDecrypt(decrypted0);\n    decrypted0_0 = private_keys[keys - 1]->SeriesDecryptFinish(decrypted0_0);\n    decrypted0 = private_keys.last()->Decrypt(decrypted0);\n\n    EXPECT_EQ(initial, decrypted);\n    EXPECT_NE(encrypted0, encrypted);\n    EXPECT_EQ(decrypted0, decrypted);\n    EXPECT_EQ(decrypted0_0, decrypted);\n  }\n\n  TEST(Crypto, CppDsaNeff)\n  {\n    int keys = 50;\n    int servers = 10;\n    QSharedPointer<CppDsaPrivateKey> base_key(new CppDsaPrivateKey());\n    Integer generator = base_key->GetGenerator();\n    Integer subgroup = base_key->GetSubgroup();\n    Integer modulus = base_key->GetModulus();\n\n    QVector<QSharedPointer<CppDsaPrivateKey> > private_keys;\n    QVector<Integer> public_elements;\n\n    for(int idx = 0; idx < keys; idx++) {\n      QSharedPointer<CppDsaPrivateKey> private_key(\n          new CppDsaPrivateKey(modulus, subgroup, generator));\n      EXPECT_EQ(modulus, private_key->GetModulus());\n      EXPECT_EQ(subgroup, private_key->GetSubgroup());\n      EXPECT_EQ(generator, private_key->GetGenerator());\n      private_keys.append(private_key);\n\n      public_elements.append(private_key->GetPublicElement());\n      EXPECT_NE(generator, private_key->GetPublicElement());\n      EXPECT_NE(modulus, private_key->GetPublicElement());\n\n      EXPECT_TRUE(private_key->VerifyKey(*private_key->GetPublicKey()));\n      EXPECT_TRUE(private_key->GetPublicKey()->VerifyKey(*private_key)); \n    }\n\n    for(int idx = 0; idx < servers; idx++) {\n      QSharedPointer<CppDsaPrivateKey> private_key(new CppDsaPrivateKey());\n      Integer local_generator = private_key->GetPrivateExponent();\n      generator = generator.Pow(local_generator, modulus);\n\n      for(int jdx = 0; jdx < keys; jdx++) {\n        public_elements[jdx] = public_elements[jdx].Pow(local_generator, modulus);\n      }\n    }\n\n    QVector<QSharedPointer<CppDsaPublicKey> > public_keys;\n\n    for(int idx = 0; idx < keys; idx++) {\n      QSharedPointer<CppDsaPrivateKey> private_key(\n          new CppDsaPrivateKey(modulus, subgroup, generator,\n            private_keys[idx]->GetPrivateExponent()));\n      private_keys[idx] = private_key;\n      \n      public_keys.append(QSharedPointer<CppDsaPublicKey>(\n            new CppDsaPublicKey(modulus, subgroup, generator, public_elements[idx])));\n    }\n\n    QScopedPointer<Random> rng(CryptoFactory::GetInstance().\n        GetLibrary()->GetRandomNumberGenerator());\n    QByteArray data(1500, 0);\n    rng->GenerateBlock(data);\n\n    for(int idx = 0; idx < keys; idx++) {\n      EXPECT_TRUE(private_keys[idx]->VerifyKey(*public_keys[idx].data()));\n      EXPECT_TRUE(public_keys[idx]->Verify(data, private_keys[idx]->Sign(data)));\n    }\n  }\n\n  TEST(Crypto, CppDsaSanityCheck)\n  {\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key;\n    CryptoPP::AutoSeededX917RNG<CryptoPP::DES_EDE3> rng;\n    key.GenerateRandom(rng,\n        CryptoPP::MakeParameters\n        (CryptoPP::Name::ModulusSize(), 2048)\n        (CryptoPP::Name::SubgroupOrderSize(), 256)); \n    for(int idx = 0; idx < 4; idx++)\n      EXPECT_TRUE(key.Validate(rng, idx));\n\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key0;\n    key0.GenerateRandom(rng,\n        CryptoPP::MakeParameters\n        (CryptoPP::Name::Modulus(), key.GetGroupParameters().GetModulus())\n        (CryptoPP::Name::SubgroupOrder(), key.GetGroupParameters().GetSubgroupOrder())\n        (CryptoPP::Name::SubgroupGenerator(), key.GetGroupParameters().GetGenerator()));\n    for(int idx = 0; idx < 4; idx++)\n      EXPECT_TRUE(key0.Validate(rng, idx));\n\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key1;\n    key1.Initialize(rng, key.GetGroupParameters().GetModulus(), key.GetGroupParameters().GetGenerator());\n    \/\/ Some of these will fail since we ignore the subgoup\n    EXPECT_FALSE(key1.Validate(rng, 3));\n\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key2;\n    key2.Initialize(key.GetGroupParameters().GetModulus(), key.GetGroupParameters().GetSubgroupOrder(),\n        key.GetGroupParameters().GetGenerator(), key.GetPrivateExponent());\n    for(int idx = 0; idx < 4; idx++)\n      EXPECT_TRUE(key2.Validate(rng, idx));\n\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key3;\n    key3.GenerateRandomWithKeySize(rng, 1024);\n    for(int idx = 0; idx < 4; idx++)\n      EXPECT_TRUE(key3.Validate(rng, idx));\n  }\n\n  TEST(Crypto, LRSTest)\n  {\n    QSharedPointer<CppDsaPrivateKey> base_key(new CppDsaPrivateKey());\n    Integer generator = base_key->GetGenerator();\n    Integer subgroup = base_key->GetSubgroup();\n    Integer modulus = base_key->GetModulus();\n\n    QVector<QSharedPointer<AsymmetricKey> > priv_keys;\n    QVector<QSharedPointer<AsymmetricKey> > pub_keys;\n\n    int count = 8;\n\n    for(int idx = 0; idx < count; idx++) {\n      QSharedPointer<CppDsaPrivateKey> key(\n          new CppDsaPrivateKey(modulus, subgroup, generator));\n      priv_keys.append(key);\n      pub_keys.append(QSharedPointer<AsymmetricKey>(key->GetPublicKey()));\n    }\n\n    CppRandom rng;\n    QByteArray context(1024, 0);\n    rng.GenerateBlock(context);\n\n    QVector<QSharedPointer<LRSPrivateKey> > lrss;\n    LRSPublicKey lrp(pub_keys, context);\n\n    for(int idx = 0; idx < count; idx++) {\n      lrss.append(QSharedPointer<LRSPrivateKey>(\n            new LRSPrivateKey(priv_keys[idx], pub_keys, context)));\n    }\n\n    QByteArray msg(1500, 0);\n    rng.GenerateBlock(msg);\n\n    foreach(const QSharedPointer<LRSPrivateKey> &lrs, lrss) {\n      QByteArray signature = lrs->Sign(msg);\n      lrp.Verify(msg, signature);\n      EXPECT_TRUE(lrp.VerifyKey(*(lrs.data())));\n    }\n  }\n\n  TEST(Crypto, Reencrypt)\n  {\n    QSharedPointer<CppDsaPrivateKey> private_key(new CppDsaPrivateKey());\n\n    Integer modulus = private_key->GetModulus();\n    Integer generator = private_key->GetGenerator();\n    Integer subgroup = private_key->GetSubgroup();\n    Integer h = private_key->GetPublicElement();\n    Integer x = private_key->GetPrivateExponent();\n\n    Integer value_exp = Integer::GetRandomInteger(2, subgroup);\n    Integer value = generator.Pow(value_exp, modulus);\n\n    Integer secret = Integer::GetRandomInteger(2, subgroup);\n    Integer shared = generator.Pow(secret, modulus);\n    Integer encrypted = (value * h.Pow(secret, modulus)) % modulus;\n\n    Integer decrypted = (encrypted * shared.Pow(x, modulus).MultiplicativeInverse(modulus)) % modulus;\n    EXPECT_EQ(decrypted, value);\n\n    Integer beta = Integer::GetRandomInteger(2, subgroup);\n\n    shared = (shared * generator.Pow(beta, modulus)) % modulus;\n    encrypted = (encrypted * h.Pow(beta, modulus)) % modulus;\n\n    decrypted = (encrypted * shared.Pow(x, modulus).MultiplicativeInverse(modulus)) % modulus;\n    EXPECT_EQ(decrypted, value);\n  }\n\n  TEST(Crypto, NeffShuffle)\n  {\n    int values = 50;\n    int keys = 10;\n\n    QSharedPointer<CppDsaPrivateKey> base_key(new CppDsaPrivateKey());\n    Integer modulus = base_key->GetModulus();\n    Integer generator = base_key->GetGenerator();\n    Integer subgroup = base_key->GetSubgroup();\n\n    QVector<QSharedPointer<CppDsaPrivateKey> > pr_keys;\n    QVector<QSharedPointer<AsymmetricKey> > pub_keys;\n    for(int idx = 0; idx < keys; idx++) {\n      pr_keys.append(QSharedPointer<CppDsaPrivateKey>(new CppDsaPrivateKey(\n              modulus, subgroup, generator)));\n      pub_keys.append(QSharedPointer<AsymmetricKey>(pr_keys.last()->GetPublicKey()));\n    }\n\n    QVector<QByteArray> input;\n    QVector<Integer> x;\n\n    for(int idx = 0; idx < values; idx++) {\n      Integer tmp_val = Integer::GetRandomInteger(0, subgroup);\n      x.append(generator.Pow(tmp_val, modulus));\n\n      input.append(CppDsaPublicKey::SeriesEncrypt(pub_keys,\n            x.last().GetByteArray()));\n    }\n\n    CppNeffShuffle shuffle;\n\n    QVector<QByteArray> output;\n    QByteArray proof;\n    QVector<QSharedPointer<AsymmetricKey> > npub_keys = pub_keys;\n    QVector<QSharedPointer<AsymmetricKey> > cpub_keys = pub_keys;\n\n    foreach(const QSharedPointer<CppDsaPrivateKey> &private_key, pr_keys) {\n      npub_keys.pop_front();\n      EXPECT_TRUE(shuffle.Shuffle(input, private_key, npub_keys, output, proof));\n      EXPECT_TRUE(shuffle.Verify(input, cpub_keys, proof, output));\n      input = output;\n      cpub_keys = npub_keys;\n    }\n\n    foreach(const QByteArray &encrypted, output) {\n      QByteArray decrypted = CppDsaPrivateKey::SeriesDecryptFinish(encrypted);\n      Integer val(decrypted);\n      EXPECT_TRUE(x.contains(val));\n    }\n  }\n}\n}\n<commit_msg>[Tests] Removed unnecessary tests<commit_after>#include \"DissentTest.hpp\"\n\nnamespace Dissent {\nnamespace Tests {\n  TEST(Crypto, DSAEncrypt)\n  {\n    QSharedPointer<CppDsaPrivateKey> private_key(new CppDsaPrivateKey());\n    QSharedPointer<AsymmetricKey> public_key(private_key->GetPublicKey());\n\n    Integer generator = private_key->GetGenerator();\n    Integer modulus = private_key->GetModulus();\n    Integer subgroup = private_key->GetSubgroup();\n\n    Integer val = generator.Pow(Integer::GetRandomInteger(0, subgroup), modulus);\n    QByteArray initial = val.GetByteArray();\n    QByteArray encrypted = public_key->Encrypt(initial);\n    QByteArray decrypted = private_key->Decrypt(encrypted);\n\n    QByteArray encrypted0 = public_key->Encrypt(initial);\n    QByteArray decrypted0 = private_key->Decrypt(encrypted0);\n\n    EXPECT_EQ(initial, decrypted);\n    EXPECT_NE(encrypted0, encrypted);\n    EXPECT_EQ(decrypted0, decrypted);\n  }\n\n  TEST(Crypto, DSASeriesEncrypt)\n  {\n    QSharedPointer<CppDsaPrivateKey> base_key(new CppDsaPrivateKey());\n    Integer generator = base_key->GetGenerator();\n    Integer subgroup = base_key->GetSubgroup();\n    Integer modulus = base_key->GetModulus();\n\n    QVector<QSharedPointer<CppDsaPrivateKey> > private_keys;\n    QVector<QSharedPointer<AsymmetricKey> > public_keys;\n    int keys = 10;\n\n    for(int idx = 0; idx < keys; idx++) {\n      QSharedPointer<CppDsaPrivateKey> private_key(\n          new CppDsaPrivateKey(modulus, subgroup, generator));\n      private_keys.append(private_key);\n      public_keys.append(QSharedPointer<AsymmetricKey>(private_key->GetPublicKey()));\n    }\n\n    Integer val = generator.Pow(Integer::GetRandomInteger(0, subgroup), modulus);\n    QByteArray initial = val.GetByteArray();\n    QByteArray encrypted = CppDsaPublicKey::SeriesEncrypt(public_keys,\n        val.GetByteArray());\n\n    QByteArray decrypted = encrypted;\n    for(int idx = 0; idx < keys - 1; idx++) {\n      decrypted = private_keys[idx]->SeriesDecrypt(decrypted);\n    }\n    decrypted = private_keys.last()->Decrypt(decrypted);\n\n    QByteArray encrypted0 = CppDsaPublicKey::SeriesEncrypt(public_keys,\n        val.GetByteArray());\n\n    QByteArray decrypted0 = encrypted0;\n    for(int idx = 0; idx < keys - 1; idx++) {\n      decrypted0 = private_keys[idx]->SeriesDecrypt(decrypted0);\n    }\n    QByteArray decrypted0_0 = private_keys[keys - 1]->SeriesDecrypt(decrypted0);\n    decrypted0_0 = private_keys[keys - 1]->SeriesDecryptFinish(decrypted0_0);\n    decrypted0 = private_keys.last()->Decrypt(decrypted0);\n\n    EXPECT_EQ(initial, decrypted);\n    EXPECT_NE(encrypted0, encrypted);\n    EXPECT_EQ(decrypted0, decrypted);\n    EXPECT_EQ(decrypted0_0, decrypted);\n  }\n\n  TEST(Crypto, CppDsaSanityCheck)\n  {\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key;\n    CryptoPP::AutoSeededX917RNG<CryptoPP::DES_EDE3> rng;\n    key.GenerateRandom(rng,\n        CryptoPP::MakeParameters\n        (CryptoPP::Name::ModulusSize(), 2048)\n        (CryptoPP::Name::SubgroupOrderSize(), 256)); \n    for(int idx = 0; idx < 4; idx++)\n      EXPECT_TRUE(key.Validate(rng, idx));\n\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key0;\n    key0.GenerateRandom(rng,\n        CryptoPP::MakeParameters\n        (CryptoPP::Name::Modulus(), key.GetGroupParameters().GetModulus())\n        (CryptoPP::Name::SubgroupOrder(), key.GetGroupParameters().GetSubgroupOrder())\n        (CryptoPP::Name::SubgroupGenerator(), key.GetGroupParameters().GetGenerator()));\n    for(int idx = 0; idx < 4; idx++)\n      EXPECT_TRUE(key0.Validate(rng, idx));\n\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key1;\n    key1.Initialize(rng, key.GetGroupParameters().GetModulus(), key.GetGroupParameters().GetGenerator());\n    \/\/ Some of these will fail since we ignore the subgoup\n    EXPECT_FALSE(key1.Validate(rng, 3));\n\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key2;\n    key2.Initialize(key.GetGroupParameters().GetModulus(), key.GetGroupParameters().GetSubgroupOrder(),\n        key.GetGroupParameters().GetGenerator(), key.GetPrivateExponent());\n    for(int idx = 0; idx < 4; idx++)\n      EXPECT_TRUE(key2.Validate(rng, idx));\n\n    CryptoPP::GDSA<CryptoPP::SHA256>::PrivateKey key3;\n    key3.GenerateRandomWithKeySize(rng, 1024);\n    for(int idx = 0; idx < 4; idx++)\n      EXPECT_TRUE(key3.Validate(rng, idx));\n  }\n\n  TEST(Crypto, LRSTest)\n  {\n    QSharedPointer<CppDsaPrivateKey> base_key(new CppDsaPrivateKey());\n    Integer generator = base_key->GetGenerator();\n    Integer subgroup = base_key->GetSubgroup();\n    Integer modulus = base_key->GetModulus();\n\n    QVector<QSharedPointer<AsymmetricKey> > priv_keys;\n    QVector<QSharedPointer<AsymmetricKey> > pub_keys;\n\n    int count = 8;\n\n    for(int idx = 0; idx < count; idx++) {\n      QSharedPointer<CppDsaPrivateKey> key(\n          new CppDsaPrivateKey(modulus, subgroup, generator));\n      priv_keys.append(key);\n      pub_keys.append(QSharedPointer<AsymmetricKey>(key->GetPublicKey()));\n    }\n\n    CppRandom rng;\n    QByteArray context(1024, 0);\n    rng.GenerateBlock(context);\n\n    QVector<QSharedPointer<LRSPrivateKey> > lrss;\n    LRSPublicKey lrp(pub_keys, context);\n\n    for(int idx = 0; idx < count; idx++) {\n      lrss.append(QSharedPointer<LRSPrivateKey>(\n            new LRSPrivateKey(priv_keys[idx], pub_keys, context)));\n    }\n\n    QByteArray msg(1500, 0);\n    rng.GenerateBlock(msg);\n\n    foreach(const QSharedPointer<LRSPrivateKey> &lrs, lrss) {\n      QByteArray signature = lrs->Sign(msg);\n      lrp.Verify(msg, signature);\n      EXPECT_TRUE(lrp.VerifyKey(*(lrs.data())));\n    }\n  }\n\n  TEST(Crypto, NeffShuffle)\n  {\n    int values = 50;\n    int keys = 10;\n\n    QSharedPointer<CppDsaPrivateKey> base_key(new CppDsaPrivateKey());\n    Integer modulus = base_key->GetModulus();\n    Integer generator = base_key->GetGenerator();\n    Integer subgroup = base_key->GetSubgroup();\n\n    QVector<QSharedPointer<CppDsaPrivateKey> > pr_keys;\n    QVector<QSharedPointer<AsymmetricKey> > pub_keys;\n    for(int idx = 0; idx < keys; idx++) {\n      pr_keys.append(QSharedPointer<CppDsaPrivateKey>(new CppDsaPrivateKey(\n              modulus, subgroup, generator)));\n      pub_keys.append(QSharedPointer<AsymmetricKey>(pr_keys.last()->GetPublicKey()));\n    }\n\n    QVector<QByteArray> input;\n    QVector<Integer> x;\n\n    for(int idx = 0; idx < values; idx++) {\n      Integer tmp_val = Integer::GetRandomInteger(0, subgroup);\n      x.append(generator.Pow(tmp_val, modulus));\n\n      input.append(CppDsaPublicKey::SeriesEncrypt(pub_keys,\n            x.last().GetByteArray()));\n    }\n\n    CppNeffShuffle shuffle;\n\n    QVector<QByteArray> output;\n    QByteArray proof;\n    QVector<QSharedPointer<AsymmetricKey> > npub_keys = pub_keys;\n    QVector<QSharedPointer<AsymmetricKey> > cpub_keys = pub_keys;\n\n    foreach(const QSharedPointer<CppDsaPrivateKey> &private_key, pr_keys) {\n      npub_keys.pop_front();\n      EXPECT_TRUE(shuffle.Shuffle(input, private_key, npub_keys, output, proof));\n      EXPECT_TRUE(shuffle.Verify(input, cpub_keys, proof, output));\n      input = output;\n      cpub_keys = npub_keys;\n    }\n\n    foreach(const QByteArray &encrypted, output) {\n      QByteArray decrypted = CppDsaPrivateKey::SeriesDecryptFinish(encrypted);\n      Integer val(decrypted);\n      EXPECT_TRUE(x.contains(val));\n    }\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\/gtk\/clear_browsing_data_dialog_gtk.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"chrome\/browser\/browsing_data_remover.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/gtk_util.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"grit\/generated_resources.h\"\n\n\/\/ static\nvoid ClearBrowsingDataDialogGtk::Show(GtkWindow* parent, Profile* profile) {\n  new ClearBrowsingDataDialogGtk(parent, profile);\n}\n\nClearBrowsingDataDialogGtk::ClearBrowsingDataDialogGtk(GtkWindow* parent,\n                                                       Profile* profile) :\n    profile_(profile), remover_(NULL) {\n  \/\/ Build the dialog.\n  GtkWidget* dialog = gtk_dialog_new_with_buttons(\n      l10n_util::GetStringUTF8(IDS_CLEAR_BROWSING_DATA_TITLE).c_str(),\n      parent,\n      (GtkDialogFlags) (GTK_DIALOG_MODAL | GTK_DIALOG_NO_SEPARATOR),\n      GTK_STOCK_CANCEL,\n      GTK_RESPONSE_REJECT,\n      l10n_util::GetStringUTF8(IDS_CLEAR_BROWSING_DATA_COMMIT).c_str(),\n      GTK_RESPONSE_ACCEPT,\n      NULL);\n\n  GtkWidget* content_area = GTK_DIALOG(dialog)->vbox;\n  gtk_box_set_spacing(GTK_BOX(content_area), gtk_util::kContentAreaSpacing);\n\n  GtkWidget* vbox = gtk_vbox_new(FALSE, gtk_util::kControlSpacing);\n  gtk_container_add(GTK_CONTAINER(content_area), vbox);\n\n  \/\/ Label on top of the checkboxes.\n  GtkWidget* description = gtk_label_new(\n      l10n_util::GetStringUTF8(IDS_CLEAR_BROWSING_DATA_LABEL).c_str());\n  gtk_misc_set_alignment(GTK_MISC(description), 0, 0);\n  gtk_box_pack_start(GTK_BOX(vbox), description, FALSE, FALSE, 0);\n\n  \/\/ History checkbox.\n  del_history_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_BROWSING_HISTORY_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_history_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_history_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteBrowsingHistory));\n  g_signal_connect(del_history_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Downloads checkbox.\n  del_downloads_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_DOWNLOAD_HISTORY_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_downloads_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_downloads_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteDownloadHistory));\n  g_signal_connect(del_downloads_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Cache checkbox.\n  del_cache_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_CACHE_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_cache_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_cache_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteCache));\n  g_signal_connect(del_cache_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Cookies checkbox.\n  del_cookies_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_COOKIES_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_cookies_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_cookies_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteCookies));\n  g_signal_connect(del_cookies_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Passwords checkbox.\n  del_passwords_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_PASSWORDS_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_passwords_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_passwords_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeletePasswords));\n  g_signal_connect(del_passwords_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Form data checkbox.\n  del_form_data_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_FORM_DATA_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_form_data_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_form_data_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteFormData));\n  g_signal_connect(del_form_data_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Create a horizontal layout for the combo box and label.\n  GtkWidget* combo_hbox = gtk_hbox_new(FALSE, gtk_util::kLabelSpacing);\n  GtkWidget* time_period_label_ = gtk_label_new(\n      l10n_util::GetStringUTF8(IDS_CLEAR_BROWSING_DATA_TIME_LABEL).c_str());\n  gtk_box_pack_start(GTK_BOX(combo_hbox), time_period_label_, FALSE, FALSE, 0);\n\n  \/\/ Time period combo box items.\n  time_period_combobox_ = gtk_combo_box_new_text();\n  gtk_combo_box_append_text(GTK_COMBO_BOX(time_period_combobox_),\n      l10n_util::GetStringUTF8(IDS_CLEAR_DATA_DAY).c_str());\n  gtk_combo_box_append_text(GTK_COMBO_BOX(time_period_combobox_),\n      l10n_util::GetStringUTF8(IDS_CLEAR_DATA_WEEK).c_str());\n  gtk_combo_box_append_text(GTK_COMBO_BOX(time_period_combobox_),\n      l10n_util::GetStringUTF8(IDS_CLEAR_DATA_4WEEKS).c_str());\n  gtk_combo_box_append_text(GTK_COMBO_BOX(time_period_combobox_),\n      l10n_util::GetStringUTF8(IDS_CLEAR_DATA_EVERYTHING).c_str());\n  gtk_combo_box_set_active(GTK_COMBO_BOX(time_period_combobox_),\n      profile_->GetPrefs()->GetInteger(prefs::kDeleteTimePeriod));\n  gtk_box_pack_start(GTK_BOX(combo_hbox),\n                     time_period_combobox_, FALSE, FALSE, 0);\n  g_signal_connect(time_period_combobox_, \"changed\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Add the combo\/label time period box to the vertical layout.\n  gtk_box_pack_start(GTK_BOX(vbox), combo_hbox, FALSE, FALSE, 0);\n\n  g_signal_connect(dialog, \"response\",\n                   G_CALLBACK(HandleOnResponseDialog), this);\n  gtk_window_set_resizable(GTK_WINDOW(dialog), FALSE);\n  gtk_widget_show_all(dialog);\n}\n\nvoid ClearBrowsingDataDialogGtk::OnDialogResponse(GtkWidget* widget,\n                                                  int response) {\n  if (response == GTK_RESPONSE_ACCEPT) {\n    int period_selected = gtk_combo_box_get_active(\n        GTK_COMBO_BOX(time_period_combobox_));\n\n    int items = 0;\n    if (gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(del_history_checkbox_)))\n      items |= BrowsingDataRemover::REMOVE_HISTORY;\n    if (gtk_toggle_button_get_active(\n        GTK_TOGGLE_BUTTON(del_downloads_checkbox_))) {\n      items |= BrowsingDataRemover::REMOVE_DOWNLOADS;\n    }\n    if (gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(del_cookies_checkbox_)))\n      items |= BrowsingDataRemover::REMOVE_COOKIES;\n    if (gtk_toggle_button_get_active(\n        GTK_TOGGLE_BUTTON(del_passwords_checkbox_))) {\n      items |= BrowsingDataRemover::REMOVE_PASSWORDS;\n    }\n    if (gtk_toggle_button_get_active(\n        GTK_TOGGLE_BUTTON(del_form_data_checkbox_))) {\n      items |= BrowsingDataRemover::REMOVE_FORM_DATA;\n    }\n    if (gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(del_cache_checkbox_)))\n      items |= BrowsingDataRemover::REMOVE_CACHE;\n\n    \/\/ BrowsingDataRemover deletes itself when done.\n    remover_ = new BrowsingDataRemover(profile_,\n        static_cast<BrowsingDataRemover::TimePeriod>(period_selected),\n        base::Time());\n    remover_->Remove(items);\n  }\n\n  delete this;\n  gtk_widget_destroy(GTK_WIDGET(widget));\n}\n\nvoid ClearBrowsingDataDialogGtk::OnDialogWidgetClicked(GtkWidget* widget) {\n  if (widget == del_history_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteBrowsingHistory,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_downloads_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteDownloadHistory,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_cache_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteCache,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_cookies_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteCookies,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_passwords_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeletePasswords,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_form_data_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteFormData,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == time_period_combobox_) {\n    profile_->GetPrefs()->SetInteger(prefs::kDeleteTimePeriod,\n        gtk_combo_box_get_active(GTK_COMBO_BOX(widget)));\n  }\n}\n<commit_msg>Rename the Cancel button to Close in gtk Clear Browsing Data.<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\/clear_browsing_data_dialog_gtk.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"chrome\/browser\/browsing_data_remover.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/gtk_util.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"grit\/generated_resources.h\"\n\n\/\/ static\nvoid ClearBrowsingDataDialogGtk::Show(GtkWindow* parent, Profile* profile) {\n  new ClearBrowsingDataDialogGtk(parent, profile);\n}\n\nClearBrowsingDataDialogGtk::ClearBrowsingDataDialogGtk(GtkWindow* parent,\n                                                       Profile* profile) :\n    profile_(profile), remover_(NULL) {\n  \/\/ Build the dialog.\n  GtkWidget* dialog = gtk_dialog_new_with_buttons(\n      l10n_util::GetStringUTF8(IDS_CLEAR_BROWSING_DATA_TITLE).c_str(),\n      parent,\n      (GtkDialogFlags) (GTK_DIALOG_MODAL | GTK_DIALOG_NO_SEPARATOR),\n      GTK_STOCK_CLOSE,\n      GTK_RESPONSE_REJECT,\n      l10n_util::GetStringUTF8(IDS_CLEAR_BROWSING_DATA_COMMIT).c_str(),\n      GTK_RESPONSE_ACCEPT,\n      NULL);\n\n  GtkWidget* content_area = GTK_DIALOG(dialog)->vbox;\n  gtk_box_set_spacing(GTK_BOX(content_area), gtk_util::kContentAreaSpacing);\n\n  GtkWidget* vbox = gtk_vbox_new(FALSE, gtk_util::kControlSpacing);\n  gtk_container_add(GTK_CONTAINER(content_area), vbox);\n\n  \/\/ Label on top of the checkboxes.\n  GtkWidget* description = gtk_label_new(\n      l10n_util::GetStringUTF8(IDS_CLEAR_BROWSING_DATA_LABEL).c_str());\n  gtk_misc_set_alignment(GTK_MISC(description), 0, 0);\n  gtk_box_pack_start(GTK_BOX(vbox), description, FALSE, FALSE, 0);\n\n  \/\/ History checkbox.\n  del_history_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_BROWSING_HISTORY_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_history_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_history_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteBrowsingHistory));\n  g_signal_connect(del_history_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Downloads checkbox.\n  del_downloads_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_DOWNLOAD_HISTORY_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_downloads_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_downloads_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteDownloadHistory));\n  g_signal_connect(del_downloads_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Cache checkbox.\n  del_cache_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_CACHE_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_cache_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_cache_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteCache));\n  g_signal_connect(del_cache_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Cookies checkbox.\n  del_cookies_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_COOKIES_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_cookies_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_cookies_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteCookies));\n  g_signal_connect(del_cookies_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Passwords checkbox.\n  del_passwords_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_PASSWORDS_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_passwords_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_passwords_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeletePasswords));\n  g_signal_connect(del_passwords_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Form data checkbox.\n  del_form_data_checkbox_ = gtk_check_button_new_with_label(\n      l10n_util::GetStringUTF8(IDS_DEL_FORM_DATA_CHKBOX).c_str());\n  gtk_box_pack_start(GTK_BOX(vbox), del_form_data_checkbox_, FALSE, FALSE, 0);\n  gtk_toggle_button_set_active(GTK_TOGGLE_BUTTON(del_form_data_checkbox_),\n      profile_->GetPrefs()->GetBoolean(prefs::kDeleteFormData));\n  g_signal_connect(del_form_data_checkbox_, \"toggled\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Create a horizontal layout for the combo box and label.\n  GtkWidget* combo_hbox = gtk_hbox_new(FALSE, gtk_util::kLabelSpacing);\n  GtkWidget* time_period_label_ = gtk_label_new(\n      l10n_util::GetStringUTF8(IDS_CLEAR_BROWSING_DATA_TIME_LABEL).c_str());\n  gtk_box_pack_start(GTK_BOX(combo_hbox), time_period_label_, FALSE, FALSE, 0);\n\n  \/\/ Time period combo box items.\n  time_period_combobox_ = gtk_combo_box_new_text();\n  gtk_combo_box_append_text(GTK_COMBO_BOX(time_period_combobox_),\n      l10n_util::GetStringUTF8(IDS_CLEAR_DATA_DAY).c_str());\n  gtk_combo_box_append_text(GTK_COMBO_BOX(time_period_combobox_),\n      l10n_util::GetStringUTF8(IDS_CLEAR_DATA_WEEK).c_str());\n  gtk_combo_box_append_text(GTK_COMBO_BOX(time_period_combobox_),\n      l10n_util::GetStringUTF8(IDS_CLEAR_DATA_4WEEKS).c_str());\n  gtk_combo_box_append_text(GTK_COMBO_BOX(time_period_combobox_),\n      l10n_util::GetStringUTF8(IDS_CLEAR_DATA_EVERYTHING).c_str());\n  gtk_combo_box_set_active(GTK_COMBO_BOX(time_period_combobox_),\n      profile_->GetPrefs()->GetInteger(prefs::kDeleteTimePeriod));\n  gtk_box_pack_start(GTK_BOX(combo_hbox),\n                     time_period_combobox_, FALSE, FALSE, 0);\n  g_signal_connect(time_period_combobox_, \"changed\",\n                   G_CALLBACK(HandleOnClickedWidget), this);\n\n  \/\/ Add the combo\/label time period box to the vertical layout.\n  gtk_box_pack_start(GTK_BOX(vbox), combo_hbox, FALSE, FALSE, 0);\n\n  g_signal_connect(dialog, \"response\",\n                   G_CALLBACK(HandleOnResponseDialog), this);\n  gtk_window_set_resizable(GTK_WINDOW(dialog), FALSE);\n  gtk_widget_show_all(dialog);\n}\n\nvoid ClearBrowsingDataDialogGtk::OnDialogResponse(GtkWidget* widget,\n                                                  int response) {\n  if (response == GTK_RESPONSE_ACCEPT) {\n    int period_selected = gtk_combo_box_get_active(\n        GTK_COMBO_BOX(time_period_combobox_));\n\n    int items = 0;\n    if (gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(del_history_checkbox_)))\n      items |= BrowsingDataRemover::REMOVE_HISTORY;\n    if (gtk_toggle_button_get_active(\n        GTK_TOGGLE_BUTTON(del_downloads_checkbox_))) {\n      items |= BrowsingDataRemover::REMOVE_DOWNLOADS;\n    }\n    if (gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(del_cookies_checkbox_)))\n      items |= BrowsingDataRemover::REMOVE_COOKIES;\n    if (gtk_toggle_button_get_active(\n        GTK_TOGGLE_BUTTON(del_passwords_checkbox_))) {\n      items |= BrowsingDataRemover::REMOVE_PASSWORDS;\n    }\n    if (gtk_toggle_button_get_active(\n        GTK_TOGGLE_BUTTON(del_form_data_checkbox_))) {\n      items |= BrowsingDataRemover::REMOVE_FORM_DATA;\n    }\n    if (gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(del_cache_checkbox_)))\n      items |= BrowsingDataRemover::REMOVE_CACHE;\n\n    \/\/ BrowsingDataRemover deletes itself when done.\n    remover_ = new BrowsingDataRemover(profile_,\n        static_cast<BrowsingDataRemover::TimePeriod>(period_selected),\n        base::Time());\n    remover_->Remove(items);\n  }\n\n  delete this;\n  gtk_widget_destroy(GTK_WIDGET(widget));\n}\n\nvoid ClearBrowsingDataDialogGtk::OnDialogWidgetClicked(GtkWidget* widget) {\n  if (widget == del_history_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteBrowsingHistory,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_downloads_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteDownloadHistory,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_cache_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteCache,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_cookies_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteCookies,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_passwords_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeletePasswords,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == del_form_data_checkbox_) {\n    profile_->GetPrefs()->SetBoolean(prefs::kDeleteFormData,\n        gtk_toggle_button_get_active(GTK_TOGGLE_BUTTON(widget)) ?\n        true : false);\n  } else if (widget == time_period_combobox_) {\n    profile_->GetPrefs()->SetInteger(prefs::kDeleteTimePeriod,\n        gtk_combo_box_get_active(GTK_COMBO_BOX(widget)));\n  }\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\/ui\/apps\/chrome_app_window_delegate.h\"\n\n#include \"base\/strings\/stringprintf.h\"\n#include \"chrome\/browser\/favicon\/favicon_tab_helper.h\"\n#include \"chrome\/browser\/file_select_helper.h\"\n#include \"chrome\/browser\/media\/media_capture_devices_dispatcher.h\"\n#include \"chrome\/browser\/platform_util.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/shell_integration.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_dialogs.h\"\n#include \"chrome\/browser\/ui\/browser_tabstrip.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/scoped_tabbed_browser_displayer.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"content\/public\/browser\/browser_context.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n\n#if defined(USE_ASH)\n#include \"ash\/shelf\/shelf_constants.h\"\n#endif\n\n#if defined(ENABLE_PRINTING)\n#if defined(ENABLE_FULL_PRINTING)\n#include \"chrome\/browser\/printing\/print_preview_message_handler.h\"\n#include \"chrome\/browser\/printing\/print_view_manager.h\"\n#else\n#include \"chrome\/browser\/printing\/print_view_manager_basic.h\"\n#endif  \/\/ defined(ENABLE_FULL_PRINTING)\n#endif  \/\/ defined(ENABLE_PRINTING)\n\nnamespace {\n\nbool disable_external_open_for_testing_ = false;\n\n\/\/ Opens a URL with Chromium (not external browser) with the right profile.\ncontent::WebContents* OpenURLFromTabInternal(\n    content::BrowserContext* context,\n    content::WebContents* source,\n    const content::OpenURLParams& params) {\n  \/\/ Force all links to open in a new tab, even if they were trying to open a\n  \/\/ window.\n  chrome::NavigateParams new_tab_params(\n      static_cast<Browser*>(NULL), params.url, params.transition);\n  new_tab_params.disposition = params.disposition == NEW_BACKGROUND_TAB\n                                   ? params.disposition\n                                   : NEW_FOREGROUND_TAB;\n  new_tab_params.initiating_profile = Profile::FromBrowserContext(context);\n  chrome::Navigate(&new_tab_params);\n\n  return new_tab_params.target_contents;\n}\n\n\/\/ Helper class that opens a URL based on if this browser instance is the\n\/\/ default system browser. If it is the default, open the URL directly instead\n\/\/ of asking the system to open it.\nclass OpenURLFromTabBasedOnBrowserDefault\n    : public ShellIntegration::DefaultWebClientObserver {\n public:\n  OpenURLFromTabBasedOnBrowserDefault(content::WebContents* source,\n                                      const content::OpenURLParams& params)\n      : source_(source), params_(params) {}\n\n  \/\/ Opens a URL when called with the result of if this is the default system\n  \/\/ browser or not.\n  virtual void SetDefaultWebClientUIState(\n      ShellIntegration::DefaultWebClientUIState state) OVERRIDE {\n    Profile* profile =\n        Profile::FromBrowserContext(source_->GetBrowserContext());\n    DCHECK(profile);\n    if (!profile)\n      return;\n    switch (state) {\n      case ShellIntegration::STATE_PROCESSING:\n        break;\n      case ShellIntegration::STATE_IS_DEFAULT:\n        OpenURLFromTabInternal(profile, source_, params_);\n        break;\n      case ShellIntegration::STATE_NOT_DEFAULT:\n      case ShellIntegration::STATE_UNKNOWN:\n        platform_util::OpenExternal(profile, params_.url);\n        break;\n    }\n  }\n\n  virtual bool IsOwnedByWorker() OVERRIDE { return true; }\n\n private:\n  content::WebContents* source_;\n  const content::OpenURLParams params_;\n};\n\n}  \/\/ namespace\n\nAppWindowLinkDelegate::AppWindowLinkDelegate() {}\n\nAppWindowLinkDelegate::~AppWindowLinkDelegate() {}\n\n\/\/ TODO(rockot): Add a test that exercises this code. See\n\/\/ http:\/\/crbug.com\/254260.\ncontent::WebContents* AppWindowLinkDelegate::OpenURLFromTab(\n    content::WebContents* source,\n    const content::OpenURLParams& params) {\n  if (source) {\n    scoped_refptr<ShellIntegration::DefaultWebClientWorker>\n        check_if_default_browser_worker =\n            new ShellIntegration::DefaultBrowserWorker(\n                new OpenURLFromTabBasedOnBrowserDefault(source, params));\n    \/\/ Object lifetime notes: The OpenURLFromTabBasedOnBrowserDefault is owned\n    \/\/ by check_if_default_browser_worker. StartCheckIsDefault() takes lifetime\n    \/\/ ownership of check_if_default_browser_worker and will clean up after\n    \/\/ the asynchronous tasks.\n    check_if_default_browser_worker->StartCheckIsDefault();\n  }\n  return NULL;\n}\n\nChromeAppWindowDelegate::ChromeAppWindowDelegate() {}\n\nChromeAppWindowDelegate::~ChromeAppWindowDelegate() {}\n\nvoid ChromeAppWindowDelegate::DisableExternalOpenForTesting() {\n  disable_external_open_for_testing_ = true;\n}\n\nvoid ChromeAppWindowDelegate::InitWebContents(\n    content::WebContents* web_contents) {\n  FaviconTabHelper::CreateForWebContents(web_contents);\n\n#if defined(ENABLE_PRINTING)\n#if defined(ENABLE_FULL_PRINTING)\n  printing::PrintViewManager::CreateForWebContents(web_contents);\n  printing::PrintPreviewMessageHandler::CreateForWebContents(web_contents);\n#else\n  printing::PrintViewManagerBasic::CreateForWebContents(web_contents);\n#endif  \/\/ defined(ENABLE_FULL_PRINTING)\n#endif  \/\/ defined(ENABLE_PRINTING)\n}\n\napps::NativeAppWindow* ChromeAppWindowDelegate::CreateNativeAppWindow(\n    apps::AppWindow* window,\n    const apps::AppWindow::CreateParams& params) {\n  return CreateNativeAppWindowImpl(window, params);\n}\n\ncontent::WebContents* ChromeAppWindowDelegate::OpenURLFromTab(\n    content::BrowserContext* context,\n    content::WebContents* source,\n    const content::OpenURLParams& params) {\n  return OpenURLFromTabInternal(context, source, params);\n}\n\nvoid ChromeAppWindowDelegate::AddNewContents(content::BrowserContext* context,\n                                             content::WebContents* new_contents,\n                                             WindowOpenDisposition disposition,\n                                             const gfx::Rect& initial_pos,\n                                             bool user_gesture,\n                                             bool* was_blocked) {\n  if (!disable_external_open_for_testing_) {\n    if (!app_window_link_delegate_.get())\n      app_window_link_delegate_.reset(new AppWindowLinkDelegate());\n    new_contents->SetDelegate(app_window_link_delegate_.get());\n    return;\n  }\n  chrome::ScopedTabbedBrowserDisplayer displayer(\n      Profile::FromBrowserContext(context), chrome::GetActiveDesktop());\n  \/\/ Force all links to open in a new tab, even if they were trying to open a\n  \/\/ new window.\n  disposition =\n      disposition == NEW_BACKGROUND_TAB ? disposition : NEW_FOREGROUND_TAB;\n  chrome::AddWebContents(displayer.browser(), NULL, new_contents, disposition,\n                         initial_pos, user_gesture, was_blocked);\n}\n\ncontent::ColorChooser* ChromeAppWindowDelegate::ShowColorChooser(\n    content::WebContents* web_contents,\n    SkColor initial_color) {\n  return chrome::ShowColorChooser(web_contents, initial_color);\n}\n\nvoid ChromeAppWindowDelegate::RunFileChooser(\n    content::WebContents* tab,\n    const content::FileChooserParams& params) {\n  FileSelectHelper::RunFileChooser(tab, params);\n}\n\nvoid ChromeAppWindowDelegate::RequestMediaAccessPermission(\n    content::WebContents* web_contents,\n    const content::MediaStreamRequest& request,\n    const content::MediaResponseCallback& callback,\n    const extensions::Extension* extension) {\n  MediaCaptureDevicesDispatcher::GetInstance()->ProcessMediaAccessRequest(\n      web_contents, request, callback, extension);\n}\n\nint ChromeAppWindowDelegate::PreferredIconSize() {\n#if defined(USE_ASH)\n  return ash::kShelfPreferredSize;\n#else\n  return extension_misc::EXTENSION_ICON_SMALL;\n#endif\n}\n\nvoid ChromeAppWindowDelegate::SetWebContentsBlocked(\n    content::WebContents* web_contents,\n    bool blocked) {\n  \/\/ RenderViewHost may be NULL during shutdown.\n  content::RenderViewHost* host = web_contents->GetRenderViewHost();\n  if (host) {\n    host->Send(new ChromeViewMsg_SetVisuallyDeemphasized(\n        host->GetRoutingID(), blocked));\n  }\n}\n\nbool ChromeAppWindowDelegate::IsWebContentsVisible(\n    content::WebContents* web_contents) {\n  return platform_util::IsVisible(web_contents->GetView()->GetNativeView());\n}\n<commit_msg>Activate browser window when opening new tab from a packaged app window.<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\/ui\/apps\/chrome_app_window_delegate.h\"\n\n#include \"base\/strings\/stringprintf.h\"\n#include \"chrome\/browser\/favicon\/favicon_tab_helper.h\"\n#include \"chrome\/browser\/file_select_helper.h\"\n#include \"chrome\/browser\/media\/media_capture_devices_dispatcher.h\"\n#include \"chrome\/browser\/platform_util.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/shell_integration.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_dialogs.h\"\n#include \"chrome\/browser\/ui\/browser_tabstrip.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/scoped_tabbed_browser_displayer.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"content\/public\/browser\/browser_context.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n\n#if defined(USE_ASH)\n#include \"ash\/shelf\/shelf_constants.h\"\n#endif\n\n#if defined(ENABLE_PRINTING)\n#if defined(ENABLE_FULL_PRINTING)\n#include \"chrome\/browser\/printing\/print_preview_message_handler.h\"\n#include \"chrome\/browser\/printing\/print_view_manager.h\"\n#else\n#include \"chrome\/browser\/printing\/print_view_manager_basic.h\"\n#endif  \/\/ defined(ENABLE_FULL_PRINTING)\n#endif  \/\/ defined(ENABLE_PRINTING)\n\nnamespace {\n\nbool disable_external_open_for_testing_ = false;\n\n\/\/ Opens a URL with Chromium (not external browser) with the right profile.\ncontent::WebContents* OpenURLFromTabInternal(\n    content::BrowserContext* context,\n    content::WebContents* source,\n    const content::OpenURLParams& params) {\n  \/\/ Force all links to open in a new tab, even if they were trying to open a\n  \/\/ window.\n  chrome::NavigateParams new_tab_params(\n      static_cast<Browser*>(NULL), params.url, params.transition);\n  if (params.disposition == NEW_BACKGROUND_TAB) {\n    new_tab_params.disposition = NEW_BACKGROUND_TAB;\n  } else {\n    new_tab_params.disposition = NEW_FOREGROUND_TAB;\n    new_tab_params.window_action = chrome::NavigateParams::SHOW_WINDOW;\n  }\n\n  new_tab_params.initiating_profile = Profile::FromBrowserContext(context);\n  chrome::Navigate(&new_tab_params);\n\n  return new_tab_params.target_contents;\n}\n\n\/\/ Helper class that opens a URL based on if this browser instance is the\n\/\/ default system browser. If it is the default, open the URL directly instead\n\/\/ of asking the system to open it.\nclass OpenURLFromTabBasedOnBrowserDefault\n    : public ShellIntegration::DefaultWebClientObserver {\n public:\n  OpenURLFromTabBasedOnBrowserDefault(content::WebContents* source,\n                                      const content::OpenURLParams& params)\n      : source_(source), params_(params) {}\n\n  \/\/ Opens a URL when called with the result of if this is the default system\n  \/\/ browser or not.\n  virtual void SetDefaultWebClientUIState(\n      ShellIntegration::DefaultWebClientUIState state) OVERRIDE {\n    Profile* profile =\n        Profile::FromBrowserContext(source_->GetBrowserContext());\n    DCHECK(profile);\n    if (!profile)\n      return;\n    switch (state) {\n      case ShellIntegration::STATE_PROCESSING:\n        break;\n      case ShellIntegration::STATE_IS_DEFAULT:\n        OpenURLFromTabInternal(profile, source_, params_);\n        break;\n      case ShellIntegration::STATE_NOT_DEFAULT:\n      case ShellIntegration::STATE_UNKNOWN:\n        platform_util::OpenExternal(profile, params_.url);\n        break;\n    }\n  }\n\n  virtual bool IsOwnedByWorker() OVERRIDE { return true; }\n\n private:\n  content::WebContents* source_;\n  const content::OpenURLParams params_;\n};\n\n}  \/\/ namespace\n\nAppWindowLinkDelegate::AppWindowLinkDelegate() {}\n\nAppWindowLinkDelegate::~AppWindowLinkDelegate() {}\n\n\/\/ TODO(rockot): Add a test that exercises this code. See\n\/\/ http:\/\/crbug.com\/254260.\ncontent::WebContents* AppWindowLinkDelegate::OpenURLFromTab(\n    content::WebContents* source,\n    const content::OpenURLParams& params) {\n  if (source) {\n    scoped_refptr<ShellIntegration::DefaultWebClientWorker>\n        check_if_default_browser_worker =\n            new ShellIntegration::DefaultBrowserWorker(\n                new OpenURLFromTabBasedOnBrowserDefault(source, params));\n    \/\/ Object lifetime notes: The OpenURLFromTabBasedOnBrowserDefault is owned\n    \/\/ by check_if_default_browser_worker. StartCheckIsDefault() takes lifetime\n    \/\/ ownership of check_if_default_browser_worker and will clean up after\n    \/\/ the asynchronous tasks.\n    check_if_default_browser_worker->StartCheckIsDefault();\n  }\n  return NULL;\n}\n\nChromeAppWindowDelegate::ChromeAppWindowDelegate() {}\n\nChromeAppWindowDelegate::~ChromeAppWindowDelegate() {}\n\nvoid ChromeAppWindowDelegate::DisableExternalOpenForTesting() {\n  disable_external_open_for_testing_ = true;\n}\n\nvoid ChromeAppWindowDelegate::InitWebContents(\n    content::WebContents* web_contents) {\n  FaviconTabHelper::CreateForWebContents(web_contents);\n\n#if defined(ENABLE_PRINTING)\n#if defined(ENABLE_FULL_PRINTING)\n  printing::PrintViewManager::CreateForWebContents(web_contents);\n  printing::PrintPreviewMessageHandler::CreateForWebContents(web_contents);\n#else\n  printing::PrintViewManagerBasic::CreateForWebContents(web_contents);\n#endif  \/\/ defined(ENABLE_FULL_PRINTING)\n#endif  \/\/ defined(ENABLE_PRINTING)\n}\n\napps::NativeAppWindow* ChromeAppWindowDelegate::CreateNativeAppWindow(\n    apps::AppWindow* window,\n    const apps::AppWindow::CreateParams& params) {\n  return CreateNativeAppWindowImpl(window, params);\n}\n\ncontent::WebContents* ChromeAppWindowDelegate::OpenURLFromTab(\n    content::BrowserContext* context,\n    content::WebContents* source,\n    const content::OpenURLParams& params) {\n  return OpenURLFromTabInternal(context, source, params);\n}\n\nvoid ChromeAppWindowDelegate::AddNewContents(content::BrowserContext* context,\n                                             content::WebContents* new_contents,\n                                             WindowOpenDisposition disposition,\n                                             const gfx::Rect& initial_pos,\n                                             bool user_gesture,\n                                             bool* was_blocked) {\n  if (!disable_external_open_for_testing_) {\n    if (!app_window_link_delegate_.get())\n      app_window_link_delegate_.reset(new AppWindowLinkDelegate());\n    new_contents->SetDelegate(app_window_link_delegate_.get());\n    return;\n  }\n  chrome::ScopedTabbedBrowserDisplayer displayer(\n      Profile::FromBrowserContext(context), chrome::GetActiveDesktop());\n  \/\/ Force all links to open in a new tab, even if they were trying to open a\n  \/\/ new window.\n  disposition =\n      disposition == NEW_BACKGROUND_TAB ? disposition : NEW_FOREGROUND_TAB;\n  chrome::AddWebContents(displayer.browser(), NULL, new_contents, disposition,\n                         initial_pos, user_gesture, was_blocked);\n}\n\ncontent::ColorChooser* ChromeAppWindowDelegate::ShowColorChooser(\n    content::WebContents* web_contents,\n    SkColor initial_color) {\n  return chrome::ShowColorChooser(web_contents, initial_color);\n}\n\nvoid ChromeAppWindowDelegate::RunFileChooser(\n    content::WebContents* tab,\n    const content::FileChooserParams& params) {\n  FileSelectHelper::RunFileChooser(tab, params);\n}\n\nvoid ChromeAppWindowDelegate::RequestMediaAccessPermission(\n    content::WebContents* web_contents,\n    const content::MediaStreamRequest& request,\n    const content::MediaResponseCallback& callback,\n    const extensions::Extension* extension) {\n  MediaCaptureDevicesDispatcher::GetInstance()->ProcessMediaAccessRequest(\n      web_contents, request, callback, extension);\n}\n\nint ChromeAppWindowDelegate::PreferredIconSize() {\n#if defined(USE_ASH)\n  return ash::kShelfPreferredSize;\n#else\n  return extension_misc::EXTENSION_ICON_SMALL;\n#endif\n}\n\nvoid ChromeAppWindowDelegate::SetWebContentsBlocked(\n    content::WebContents* web_contents,\n    bool blocked) {\n  \/\/ RenderViewHost may be NULL during shutdown.\n  content::RenderViewHost* host = web_contents->GetRenderViewHost();\n  if (host) {\n    host->Send(new ChromeViewMsg_SetVisuallyDeemphasized(\n        host->GetRoutingID(), blocked));\n  }\n}\n\nbool ChromeAppWindowDelegate::IsWebContentsVisible(\n    content::WebContents* web_contents) {\n  return platform_util::IsVisible(web_contents->GetView()->GetNativeView());\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MINIDBG_BREAKPOINT_HPP\n#define MINIDBG_BREAKPOINT_HPP\n\n#include <cstdint>\n#include <sys\/ptrace.h>\n\nnamespace minidbg {\n    class breakpoint {\n    public:\n        breakpoint() = default;\n        breakpoint(pid_t pid, std::intptr_t addr) : m_pid{pid}, m_addr{addr}, m_enabled{false}, m_saved_data{} {}\n\n        void enable() {\n            m_saved_data = ptrace(PTRACE_PEEKDATA, m_pid, m_addr, nullptr);\n            uint64_t int3 = 0xcc;\n            uint64_t data_with_int3 = ((m_saved_data & ~0xff) | int3); \/\/set bottom two bytes to 0xcc\n            ptrace(PTRACE_POKEDATA, m_pid, m_addr, data_with_int3);\n\n            m_enabled = true;\n        }\n\n        void disable() {\n            ptrace(PTRACE_POKEDATA, m_pid, m_addr, m_saved_data);\n            m_enabled = false;\n        }\n\n        bool is_enabled() { return m_enabled; }\n\n        auto get_address() -> std::intptr_t { return m_addr; }\n    private:\n        pid_t m_pid;\n        std::intptr_t m_addr;\n        bool m_enabled;\n        uint64_t m_saved_data; \/\/data which used to be at the breakpoint address\n    };\n}\n\n#endif\n<commit_msg>Const correctness and fix comment<commit_after>#ifndef MINIDBG_BREAKPOINT_HPP\n#define MINIDBG_BREAKPOINT_HPP\n\n#include <cstdint>\n#include <sys\/ptrace.h>\n\nnamespace minidbg {\n    class breakpoint {\n    public:\n        breakpoint() = default;\n        breakpoint(pid_t pid, std::intptr_t addr) : m_pid{pid}, m_addr{addr}, m_enabled{false}, m_saved_data{} {}\n\n        void enable() {\n            m_saved_data = ptrace(PTRACE_PEEKDATA, m_pid, m_addr, nullptr);\n            uint64_t int3 = 0xcc;\n            uint64_t data_with_int3 = ((m_saved_data & ~0xff) | int3); \/\/set bottom byte to 0xcc\n            ptrace(PTRACE_POKEDATA, m_pid, m_addr, data_with_int3);\n\n            m_enabled = true;\n        }\n\n        void disable() {\n            ptrace(PTRACE_POKEDATA, m_pid, m_addr, m_saved_data);\n            m_enabled = false;\n        }\n\n        bool is_enabled() const { return m_enabled; }\n\n        auto get_address() const -> std::intptr_t { return m_addr; }\n    private:\n        pid_t m_pid;\n        std::intptr_t m_addr;\n        bool m_enabled;\n        uint64_t m_saved_data; \/\/data which used to be at the breakpoint address\n    };\n}\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 \"chrome\/browser\/ui\/views\/edit_search_engine_dialog.h\"\n\n#include \"base\/i18n\/rtl.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/search_engines\/template_url.h\"\n#include \"chrome\/browser\/ui\/search_engines\/edit_search_engine_controller.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"grit\/ui_resources.h\"\n#include \"ui\/base\/events\/event.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"ui\/views\/controls\/image_view.h\"\n#include \"ui\/views\/controls\/label.h\"\n#include \"ui\/views\/controls\/textfield\/textfield.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#include \"ui\/views\/window\/dialog_client_view.h\"\n\nusing views::GridLayout;\nusing views::Textfield;\n\nnamespace chrome {\n\nvoid EditSearchEngine(gfx::NativeWindow parent,\n                      TemplateURL* template_url,\n                      EditSearchEngineControllerDelegate* delegate,\n                      Profile* profile) {\n  EditSearchEngineDialog::Show(parent, template_url, delegate, profile);\n}\n\n}  \/\/ namespace chrome\n\nEditSearchEngineDialog::EditSearchEngineDialog(\n    TemplateURL* template_url,\n    EditSearchEngineControllerDelegate* delegate,\n    Profile* profile)\n    : controller_(new EditSearchEngineController(template_url,\n                                                 delegate,\n                                                 profile)) {\n  Init();\n}\n\nEditSearchEngineDialog::~EditSearchEngineDialog() {\n}\n\n\/\/ static\nvoid EditSearchEngineDialog::Show(gfx::NativeWindow parent,\n                                  TemplateURL* template_url,\n                                  EditSearchEngineControllerDelegate* delegate,\n                                  Profile* profile) {\n  EditSearchEngineDialog* contents =\n      new EditSearchEngineDialog(template_url, delegate, profile);\n  \/\/ Window interprets an empty rectangle as needing to query the content for\n  \/\/ the size as well as centering relative to the parent.\n  views::Widget::CreateWindowWithParent(contents, parent);\n  contents->GetWidget()->Show();\n  contents->GetDialogClientView()->UpdateDialogButtons();\n  contents->title_tf_->SelectAll(true);\n  contents->title_tf_->RequestFocus();\n}\n\nui::ModalType EditSearchEngineDialog::GetModalType() const {\n  return ui::MODAL_TYPE_WINDOW;\n}\n\nstring16 EditSearchEngineDialog::GetWindowTitle() const {\n  return l10n_util::GetStringUTF16(controller_->template_url() ?\n      IDS_SEARCH_ENGINES_EDITOR_EDIT_WINDOW_TITLE :\n      IDS_SEARCH_ENGINES_EDITOR_NEW_WINDOW_TITLE);\n}\n\nbool EditSearchEngineDialog::IsDialogButtonEnabled(\n    ui::DialogButton button) const {\n  if (button == ui::DIALOG_BUTTON_OK) {\n    return (controller_->IsKeywordValid(keyword_tf_->text()) &&\n            controller_->IsTitleValid(title_tf_->text()) &&\n            controller_->IsURLValid(UTF16ToUTF8(url_tf_->text())));\n  }\n  return true;\n}\n\nbool EditSearchEngineDialog::Cancel() {\n  controller_->CleanUpCancelledAdd();\n  return true;\n}\n\nbool EditSearchEngineDialog::Accept() {\n  controller_->AcceptAddOrEdit(title_tf_->text(), keyword_tf_->text(),\n                               UTF16ToUTF8(url_tf_->text()));\n  return true;\n}\n\nvoid EditSearchEngineDialog::ContentsChanged(Textfield* sender,\n                                             const string16& new_contents) {\n  GetDialogClientView()->UpdateDialogButtons();\n  UpdateImageViews();\n}\n\nbool EditSearchEngineDialog::HandleKeyEvent(\n    Textfield* sender,\n    const ui::KeyEvent& key_event) {\n  return false;\n}\n\nvoid EditSearchEngineDialog::Init() {\n  \/\/ Create the views we'll need.\n  if (controller_->template_url()) {\n    title_tf_ = CreateTextfield(controller_->template_url()->short_name(),\n                                false);\n    keyword_tf_ = CreateTextfield(controller_->template_url()->keyword(), true);\n    url_tf_ = CreateTextfield(\n        controller_->template_url()->url_ref().DisplayURL(), false);\n    \/\/ We don't allow users to edit prepopulate URLs. This is done as\n    \/\/ occasionally we need to update the URL of prepopulated TemplateURLs.\n    url_tf_->SetReadOnly(controller_->template_url()->prepopulate_id() != 0);\n  } else {\n    title_tf_ = CreateTextfield(string16(), false);\n    keyword_tf_ = CreateTextfield(string16(), true);\n    url_tf_ = CreateTextfield(string16(), false);\n  }\n  title_iv_ = new views::ImageView();\n  keyword_iv_ = new views::ImageView();\n  url_iv_ = new views::ImageView();\n\n  UpdateImageViews();\n\n  const int related_x = views::kRelatedControlHorizontalSpacing;\n  const int related_y = views::kRelatedControlVerticalSpacing;\n  const int unrelated_y = views::kUnrelatedControlVerticalSpacing;\n\n  \/\/ View and GridLayout take care of deleting GridLayout for us.\n  GridLayout* layout = GridLayout::CreatePanel(this);\n  SetLayoutManager(layout);\n\n  \/\/ Define the structure of the layout.\n\n  \/\/ For the buttons.\n  views::ColumnSet* column_set = layout->AddColumnSet(0);\n  column_set->AddPaddingColumn(1, 0);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, related_x);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->LinkColumnSizes(1, 3, -1);\n\n  \/\/ For the Textfields.\n  column_set = layout->AddColumnSet(1);\n  column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, related_x);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 1,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, related_x);\n  column_set->AddColumn(GridLayout::CENTER, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n\n  \/\/ For the description.\n  column_set = layout->AddColumnSet(2);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n\n  \/\/ Add the contents.\n  layout->StartRow(0, 1);\n  layout->AddView(CreateLabel(IDS_SEARCH_ENGINES_EDITOR_DESCRIPTION_LABEL));\n  layout->AddView(title_tf_);\n  layout->AddView(title_iv_);\n\n  layout->StartRowWithPadding(0, 1, 0, related_y);\n  layout->AddView(CreateLabel(IDS_SEARCH_ENGINES_EDITOR_KEYWORD_LABEL));\n  layout->AddView(keyword_tf_);\n  layout->AddView(keyword_iv_);\n\n  layout->StartRowWithPadding(0, 1, 0, related_y);\n  layout->AddView(CreateLabel(IDS_SEARCH_ENGINES_EDITOR_URL_LABEL));\n  layout->AddView(url_tf_);\n  layout->AddView(url_iv_);\n\n  \/\/ On RTL UIs (such as Arabic and Hebrew) the description text is not\n  \/\/ displayed correctly since it contains the substring \"%s\". This substring\n  \/\/ is not interpreted by the Unicode BiDi algorithm as an LTR string and\n  \/\/ therefore the end result is that the following right to left text is\n  \/\/ displayed: \".three two s% one\" (where 'one', 'two', etc. are words in\n  \/\/ Hebrew).\n  \/\/\n  \/\/ In order to fix this problem we transform the substring \"%s\" so that it\n  \/\/ is displayed correctly when rendered in an RTL context.\n  layout->StartRowWithPadding(0, 2, 0, unrelated_y);\n  string16 description = l10n_util::GetStringUTF16(\n      IDS_SEARCH_ENGINES_EDITOR_URL_DESCRIPTION_LABEL);\n  if (base::i18n::IsRTL()) {\n    const string16 reversed_percent(ASCIIToUTF16(\"s%\"));\n    string16::size_type percent_index =\n        description.find(ASCIIToUTF16(\"%s\"),\n                         static_cast<string16::size_type>(0));\n    if (percent_index != string16::npos)\n      description.replace(percent_index,\n                          reversed_percent.length(),\n                          reversed_percent);\n  }\n\n  views::Label* description_label = new views::Label(description);\n  description_label->SetHorizontalAlignment(gfx::ALIGN_LEFT);\n  layout->AddView(description_label);\n\n  layout->AddPaddingRow(0, related_y);\n}\n\nviews::Label* EditSearchEngineDialog::CreateLabel(int message_id) {\n  views::Label* label =\n      new views::Label(l10n_util::GetStringUTF16(message_id));\n  label->SetHorizontalAlignment(gfx::ALIGN_LEFT);\n  return label;\n}\n\nTextfield* EditSearchEngineDialog::CreateTextfield(const string16& text,\n                                                   bool lowercase) {\n  Textfield* text_field = new Textfield(\n      lowercase ? Textfield::STYLE_LOWERCASE : Textfield::STYLE_DEFAULT);\n  text_field->SetText(text);\n  text_field->SetController(this);\n  return text_field;\n}\n\nvoid EditSearchEngineDialog::UpdateImageViews() {\n  UpdateImageView(keyword_iv_, controller_->IsKeywordValid(keyword_tf_->text()),\n                  IDS_SEARCH_ENGINES_INVALID_KEYWORD_TT);\n  UpdateImageView(url_iv_,\n                  controller_->IsURLValid(UTF16ToUTF8(url_tf_->text())),\n                  IDS_SEARCH_ENGINES_INVALID_URL_TT);\n  UpdateImageView(title_iv_, controller_->IsTitleValid(title_tf_->text()),\n                  IDS_SEARCH_ENGINES_INVALID_TITLE_TT);\n}\n\nvoid EditSearchEngineDialog::UpdateImageView(views::ImageView* image_view,\n                                             bool is_valid,\n                                             int invalid_message_id) {\n  ui::ResourceBundle& rb = ui::ResourceBundle::GetSharedInstance();\n  if (is_valid) {\n    image_view->SetTooltipText(string16());\n    image_view->SetImage(rb.GetImageSkiaNamed(IDR_INPUT_GOOD));\n  } else {\n    image_view->SetTooltipText(l10n_util::GetStringUTF16(invalid_message_id));\n    image_view->SetImage(rb.GetImageSkiaNamed(IDR_INPUT_ALERT));\n  }\n}\n<commit_msg>Remove the edit search engine dialog black border.<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\/edit_search_engine_dialog.h\"\n\n#include \"base\/i18n\/rtl.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/search_engines\/template_url.h\"\n#include \"chrome\/browser\/ui\/search_engines\/edit_search_engine_controller.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"grit\/ui_resources.h\"\n#include \"ui\/base\/events\/event.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"ui\/views\/controls\/image_view.h\"\n#include \"ui\/views\/controls\/label.h\"\n#include \"ui\/views\/controls\/textfield\/textfield.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#include \"ui\/views\/window\/dialog_client_view.h\"\n\nusing views::GridLayout;\nusing views::Textfield;\n\nnamespace chrome {\n\nvoid EditSearchEngine(gfx::NativeWindow parent,\n                      TemplateURL* template_url,\n                      EditSearchEngineControllerDelegate* delegate,\n                      Profile* profile) {\n  EditSearchEngineDialog::Show(parent, template_url, delegate, profile);\n}\n\n}  \/\/ namespace chrome\n\nEditSearchEngineDialog::EditSearchEngineDialog(\n    TemplateURL* template_url,\n    EditSearchEngineControllerDelegate* delegate,\n    Profile* profile)\n    : controller_(new EditSearchEngineController(template_url,\n                                                 delegate,\n                                                 profile)) {\n  Init();\n}\n\nEditSearchEngineDialog::~EditSearchEngineDialog() {\n}\n\n\/\/ static\nvoid EditSearchEngineDialog::Show(gfx::NativeWindow parent,\n                                  TemplateURL* template_url,\n                                  EditSearchEngineControllerDelegate* delegate,\n                                  Profile* profile) {\n  EditSearchEngineDialog* contents =\n      new EditSearchEngineDialog(template_url, delegate, profile);\n  \/\/ Window interprets an empty rectangle as needing to query the content for\n  \/\/ the size as well as centering relative to the parent.\n  views::DialogDelegate::CreateDialogWidget(contents, NULL, parent);\n  contents->GetWidget()->Show();\n  contents->GetDialogClientView()->UpdateDialogButtons();\n  contents->title_tf_->SelectAll(true);\n  contents->title_tf_->RequestFocus();\n}\n\nui::ModalType EditSearchEngineDialog::GetModalType() const {\n  return ui::MODAL_TYPE_WINDOW;\n}\n\nstring16 EditSearchEngineDialog::GetWindowTitle() const {\n  return l10n_util::GetStringUTF16(controller_->template_url() ?\n      IDS_SEARCH_ENGINES_EDITOR_EDIT_WINDOW_TITLE :\n      IDS_SEARCH_ENGINES_EDITOR_NEW_WINDOW_TITLE);\n}\n\nbool EditSearchEngineDialog::IsDialogButtonEnabled(\n    ui::DialogButton button) const {\n  if (button == ui::DIALOG_BUTTON_OK) {\n    return (controller_->IsKeywordValid(keyword_tf_->text()) &&\n            controller_->IsTitleValid(title_tf_->text()) &&\n            controller_->IsURLValid(UTF16ToUTF8(url_tf_->text())));\n  }\n  return true;\n}\n\nbool EditSearchEngineDialog::Cancel() {\n  controller_->CleanUpCancelledAdd();\n  return true;\n}\n\nbool EditSearchEngineDialog::Accept() {\n  controller_->AcceptAddOrEdit(title_tf_->text(), keyword_tf_->text(),\n                               UTF16ToUTF8(url_tf_->text()));\n  return true;\n}\n\nvoid EditSearchEngineDialog::ContentsChanged(Textfield* sender,\n                                             const string16& new_contents) {\n  GetDialogClientView()->UpdateDialogButtons();\n  UpdateImageViews();\n}\n\nbool EditSearchEngineDialog::HandleKeyEvent(\n    Textfield* sender,\n    const ui::KeyEvent& key_event) {\n  return false;\n}\n\nvoid EditSearchEngineDialog::Init() {\n  \/\/ Create the views we'll need.\n  if (controller_->template_url()) {\n    title_tf_ = CreateTextfield(controller_->template_url()->short_name(),\n                                false);\n    keyword_tf_ = CreateTextfield(controller_->template_url()->keyword(), true);\n    url_tf_ = CreateTextfield(\n        controller_->template_url()->url_ref().DisplayURL(), false);\n    \/\/ We don't allow users to edit prepopulate URLs. This is done as\n    \/\/ occasionally we need to update the URL of prepopulated TemplateURLs.\n    url_tf_->SetReadOnly(controller_->template_url()->prepopulate_id() != 0);\n  } else {\n    title_tf_ = CreateTextfield(string16(), false);\n    keyword_tf_ = CreateTextfield(string16(), true);\n    url_tf_ = CreateTextfield(string16(), false);\n  }\n  title_iv_ = new views::ImageView();\n  keyword_iv_ = new views::ImageView();\n  url_iv_ = new views::ImageView();\n\n  UpdateImageViews();\n\n  const int related_x = views::kRelatedControlHorizontalSpacing;\n  const int related_y = views::kRelatedControlVerticalSpacing;\n  const int unrelated_y = views::kUnrelatedControlVerticalSpacing;\n\n  \/\/ View and GridLayout take care of deleting GridLayout for us.\n  GridLayout* layout = GridLayout::CreatePanel(this);\n  SetLayoutManager(layout);\n\n  \/\/ Define the structure of the layout.\n\n  \/\/ For the buttons.\n  views::ColumnSet* column_set = layout->AddColumnSet(0);\n  column_set->AddPaddingColumn(1, 0);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, related_x);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->LinkColumnSizes(1, 3, -1);\n\n  \/\/ For the Textfields.\n  column_set = layout->AddColumnSet(1);\n  column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, related_x);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 1,\n                        GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, related_x);\n  column_set->AddColumn(GridLayout::CENTER, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n\n  \/\/ For the description.\n  column_set = layout->AddColumnSet(2);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::CENTER, 0,\n                        GridLayout::USE_PREF, 0, 0);\n\n  \/\/ Add the contents.\n  layout->StartRow(0, 1);\n  layout->AddView(CreateLabel(IDS_SEARCH_ENGINES_EDITOR_DESCRIPTION_LABEL));\n  layout->AddView(title_tf_);\n  layout->AddView(title_iv_);\n\n  layout->StartRowWithPadding(0, 1, 0, related_y);\n  layout->AddView(CreateLabel(IDS_SEARCH_ENGINES_EDITOR_KEYWORD_LABEL));\n  layout->AddView(keyword_tf_);\n  layout->AddView(keyword_iv_);\n\n  layout->StartRowWithPadding(0, 1, 0, related_y);\n  layout->AddView(CreateLabel(IDS_SEARCH_ENGINES_EDITOR_URL_LABEL));\n  layout->AddView(url_tf_);\n  layout->AddView(url_iv_);\n\n  \/\/ On RTL UIs (such as Arabic and Hebrew) the description text is not\n  \/\/ displayed correctly since it contains the substring \"%s\". This substring\n  \/\/ is not interpreted by the Unicode BiDi algorithm as an LTR string and\n  \/\/ therefore the end result is that the following right to left text is\n  \/\/ displayed: \".three two s% one\" (where 'one', 'two', etc. are words in\n  \/\/ Hebrew).\n  \/\/\n  \/\/ In order to fix this problem we transform the substring \"%s\" so that it\n  \/\/ is displayed correctly when rendered in an RTL context.\n  layout->StartRowWithPadding(0, 2, 0, unrelated_y);\n  string16 description = l10n_util::GetStringUTF16(\n      IDS_SEARCH_ENGINES_EDITOR_URL_DESCRIPTION_LABEL);\n  if (base::i18n::IsRTL()) {\n    const string16 reversed_percent(ASCIIToUTF16(\"s%\"));\n    string16::size_type percent_index =\n        description.find(ASCIIToUTF16(\"%s\"),\n                         static_cast<string16::size_type>(0));\n    if (percent_index != string16::npos)\n      description.replace(percent_index,\n                          reversed_percent.length(),\n                          reversed_percent);\n  }\n\n  views::Label* description_label = new views::Label(description);\n  description_label->SetHorizontalAlignment(gfx::ALIGN_LEFT);\n  layout->AddView(description_label);\n\n  layout->AddPaddingRow(0, related_y);\n}\n\nviews::Label* EditSearchEngineDialog::CreateLabel(int message_id) {\n  views::Label* label =\n      new views::Label(l10n_util::GetStringUTF16(message_id));\n  label->SetHorizontalAlignment(gfx::ALIGN_LEFT);\n  return label;\n}\n\nTextfield* EditSearchEngineDialog::CreateTextfield(const string16& text,\n                                                   bool lowercase) {\n  Textfield* text_field = new Textfield(\n      lowercase ? Textfield::STYLE_LOWERCASE : Textfield::STYLE_DEFAULT);\n  text_field->SetText(text);\n  text_field->SetController(this);\n  return text_field;\n}\n\nvoid EditSearchEngineDialog::UpdateImageViews() {\n  UpdateImageView(keyword_iv_, controller_->IsKeywordValid(keyword_tf_->text()),\n                  IDS_SEARCH_ENGINES_INVALID_KEYWORD_TT);\n  UpdateImageView(url_iv_,\n                  controller_->IsURLValid(UTF16ToUTF8(url_tf_->text())),\n                  IDS_SEARCH_ENGINES_INVALID_URL_TT);\n  UpdateImageView(title_iv_, controller_->IsTitleValid(title_tf_->text()),\n                  IDS_SEARCH_ENGINES_INVALID_TITLE_TT);\n}\n\nvoid EditSearchEngineDialog::UpdateImageView(views::ImageView* image_view,\n                                             bool is_valid,\n                                             int invalid_message_id) {\n  ui::ResourceBundle& rb = ui::ResourceBundle::GetSharedInstance();\n  if (is_valid) {\n    image_view->SetTooltipText(string16());\n    image_view->SetImage(rb.GetImageSkiaNamed(IDR_INPUT_GOOD));\n  } else {\n    image_view->SetTooltipText(l10n_util::GetStringUTF16(invalid_message_id));\n    image_view->SetImage(rb.GetImageSkiaNamed(IDR_INPUT_ALERT));\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n#include <config_category.h>\n#include <string.h>\n#include <string>\n#include <rapidjson\/document.h>\n\nusing namespace std;\nusing namespace rapidjson;\n\nconst char *categories = \"{\\\"categories\\\": [\"\n\t\"{\\\"key\\\": \\\"cat1\\\", \\\"description\\\":\\\"First category\\\"},\"\n\t\"{\\\"key\\\": \\\"cat2\\\", \\\"description\\\":\\\"Second\\\"}]}\";\n\nconst char *myCategory = \"{\\\"description\\\": {\"\n\t\t\"\\\"value\\\": \\\"The FogLAMP administrative API\\\",\"\n\t\t\"\\\"type\\\": \\\"string\\\",\"\n\t\t\"\\\"default\\\": \\\"The FogLAMP administrative API\\\",\"\n\t\t\"\\\"description\\\": \\\"The description of this FogLAMP service\\\"},\"\n\t\"\\\"name\\\": {\"\n\t\t\"\\\"value\\\": \\\"FogLAMP\\\",\"\n\t\t\"\\\"type\\\": \\\"string\\\",\"\n\t\t\"\\\"default\\\": \\\"FogLAMP\\\",\"\n\t\t\"\\\"description\\\": \\\"The name of this FogLAMP service\\\"},\"\n        \"\\\"complex\\\": {\" \\\n\t\t\"\\\"value\\\": { \\\"first\\\" : \\\"FogLAMP\\\", \\\"second\\\" : \\\"json\\\" },\"\n\t\t\"\\\"type\\\": \\\"json\\\",\"\n\t\t\"\\\"default\\\": {\\\"first\\\" : \\\"FogLAMP\\\", \\\"second\\\" : \\\"json\\\" },\"\n\t\t\"\\\"description\\\": \\\"A JSON configuration parameter\\\"}}\";\n\nconst char *json = \"{ \\\"key\\\" : \\\"test\\\", \\\"description\\\" : \\\"Test description\\\", \"\n\t\"\\\"description\\\" : { \"\n\t\t\"\\\"description\\\" : \\\"The description of this FogLAMP service\\\", \"\n\t\t\"\\\"type\\\" : \\\"string\\\", \"\n\t\t\"\\\"value\\\" : \\\"The FogLAMP administrative API\\\", \"\n\t\t\"\\\"default\\\" : \\\"The FogLAMP administrative API\\\" }, \"\n\t\"\\\"name\\\" : { \"\n\t\t\"\\\"description\\\" : \\\"The name of this FogLAMP service\\\", \"\n\t\t\"\\\"type\\\" : \\\"string\\\", \"\n\t\t\"\\\"value\\\" : \\\"FogLAMP\\\", \"\n\t\t\"\\\"default\\\" : \\\"FogLAMP\\\" }, \"\n\t\"\\\"complex\\\" : { \" \n\t\t\"\\\"description\\\" : \\\"A JSON configuration parameter\\\", \"\n\t\t\"\\\"type\\\" : \\\"json\\\", \"\n\t\t\"\\\"value\\\" : {\\\"first\\\":\\\"FogLAMP\\\",\\\"second\\\":\\\"json\\\"}, \"\n\t\t\"\\\"default\\\" : {\\\"first\\\":\\\"FogLAMP\\\",\\\"second\\\":\\\"json\\\"} }}\";\n\nTEST(CategoriesTest, Count)\n{\n\tConfigCategories confCategories(categories);\n\tASSERT_EQ(2, confCategories.length());\n}\n\nTEST(CategoriesTest, Index)\n{\n\tConfigCategories confCategories(categories);\n\tconst ConfigCategoryDescription *item = confCategories[0];\n\tASSERT_EQ(0, item->getName().compare(\"cat1\"));\n\tASSERT_EQ(0, item->getDescription().compare(\"First category\"));\n}\n\nTEST(CategoryTest, Construct)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(3, confCategory.getCount());\n}\n\nTEST(CategoryTest, ExistsTest)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(true, confCategory.itemExists(\"name\"));\n\tASSERT_EQ(false, confCategory.itemExists(\"non-existance\"));\n}\n\nTEST(CategoryTest, getValue)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(0, confCategory.getValue(\"name\").compare(\"FogLAMP\"));\n}\n\nTEST(CategoryTest, getType)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(0, confCategory.getType(\"name\").compare(\"string\"));\n}\n\nTEST(CategoryTest, getDefault)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(0, confCategory.getDefault(\"name\").compare(\"FogLAMP\"));\n}\n\nTEST(CategoryTest, getDescription)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(0, confCategory.getDescription(\"name\").compare(\"The name of this FogLAMP service\"));\n}\n\nTEST(CategoryTest, isString)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(true, confCategory.isString(\"name\"));\n\tASSERT_EQ(false, confCategory.isString(\"complex\"));\n}\n\nTEST(CategoryTest, isJSON)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(false, confCategory.isJSON(\"name\"));\n\tASSERT_EQ(true, confCategory.isJSON(\"complex\"));\n}\n\nTEST(CategoryTest, toJSON)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tconfCategory.setDescription(\"Test description\");\n\tASSERT_EQ(0, confCategory.toJSON().compare(json));\n}\n<commit_msg>Fix unit test broken by merginf previous checkin<commit_after>#include <gtest\/gtest.h>\n#include <config_category.h>\n#include <string.h>\n#include <string>\n#include <rapidjson\/document.h>\n\nusing namespace std;\nusing namespace rapidjson;\n\nconst char *categories = \"{\\\"categories\\\": [\"\n\t\"{\\\"key\\\": \\\"cat1\\\", \\\"description\\\":\\\"First category\\\"},\"\n\t\"{\\\"key\\\": \\\"cat2\\\", \\\"description\\\":\\\"Second\\\"}]}\";\n\nconst char *myCategory = \"{\\\"description\\\": {\"\n\t\t\"\\\"value\\\": \\\"The FogLAMP administrative API\\\",\"\n\t\t\"\\\"type\\\": \\\"string\\\",\"\n\t\t\"\\\"default\\\": \\\"The FogLAMP administrative API\\\",\"\n\t\t\"\\\"description\\\": \\\"The description of this FogLAMP service\\\"},\"\n\t\"\\\"name\\\": {\"\n\t\t\"\\\"value\\\": \\\"FogLAMP\\\",\"\n\t\t\"\\\"type\\\": \\\"string\\\",\"\n\t\t\"\\\"default\\\": \\\"FogLAMP\\\",\"\n\t\t\"\\\"description\\\": \\\"The name of this FogLAMP service\\\"},\"\n        \"\\\"complex\\\": {\" \\\n\t\t\"\\\"value\\\": { \\\"first\\\" : \\\"FogLAMP\\\", \\\"second\\\" : \\\"json\\\" },\"\n\t\t\"\\\"type\\\": \\\"json\\\",\"\n\t\t\"\\\"default\\\": {\\\"first\\\" : \\\"FogLAMP\\\", \\\"second\\\" : \\\"json\\\" },\"\n\t\t\"\\\"description\\\": \\\"A JSON configuration parameter\\\"}}\";\n\nconst char *json = \"{ \\\"key\\\" : \\\"test\\\", \\\"description\\\" : \\\"Test description\\\", \"\n    \"\\\"value\\\" : {\"\n\t\"\\\"description\\\" : { \"\n\t\t\"\\\"description\\\" : \\\"The description of this FogLAMP service\\\", \"\n\t\t\"\\\"type\\\" : \\\"string\\\", \"\n\t\t\"\\\"value\\\" : \\\"The FogLAMP administrative API\\\", \"\n\t\t\"\\\"default\\\" : \\\"The FogLAMP administrative API\\\" }, \"\n\t\"\\\"name\\\" : { \"\n\t\t\"\\\"description\\\" : \\\"The name of this FogLAMP service\\\", \"\n\t\t\"\\\"type\\\" : \\\"string\\\", \"\n\t\t\"\\\"value\\\" : \\\"FogLAMP\\\", \"\n\t\t\"\\\"default\\\" : \\\"FogLAMP\\\" }, \"\n\t\"\\\"complex\\\" : { \" \n\t\t\"\\\"description\\\" : \\\"A JSON configuration parameter\\\", \"\n\t\t\"\\\"type\\\" : \\\"json\\\", \"\n\t\t\"\\\"value\\\" : {\\\"first\\\":\\\"FogLAMP\\\",\\\"second\\\":\\\"json\\\"}, \"\n\t\t\"\\\"default\\\" : {\\\"first\\\":\\\"FogLAMP\\\",\\\"second\\\":\\\"json\\\"} }} }\";\n\nTEST(CategoriesTest, Count)\n{\n\tConfigCategories confCategories(categories);\n\tASSERT_EQ(2, confCategories.length());\n}\n\nTEST(CategoriesTest, Index)\n{\n\tConfigCategories confCategories(categories);\n\tconst ConfigCategoryDescription *item = confCategories[0];\n\tASSERT_EQ(0, item->getName().compare(\"cat1\"));\n\tASSERT_EQ(0, item->getDescription().compare(\"First category\"));\n}\n\nTEST(CategoryTest, Construct)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(3, confCategory.getCount());\n}\n\nTEST(CategoryTest, ExistsTest)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(true, confCategory.itemExists(\"name\"));\n\tASSERT_EQ(false, confCategory.itemExists(\"non-existance\"));\n}\n\nTEST(CategoryTest, getValue)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(0, confCategory.getValue(\"name\").compare(\"FogLAMP\"));\n}\n\nTEST(CategoryTest, getType)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(0, confCategory.getType(\"name\").compare(\"string\"));\n}\n\nTEST(CategoryTest, getDefault)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(0, confCategory.getDefault(\"name\").compare(\"FogLAMP\"));\n}\n\nTEST(CategoryTest, getDescription)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(0, confCategory.getDescription(\"name\").compare(\"The name of this FogLAMP service\"));\n}\n\nTEST(CategoryTest, isString)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(true, confCategory.isString(\"name\"));\n\tASSERT_EQ(false, confCategory.isString(\"complex\"));\n}\n\nTEST(CategoryTest, isJSON)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tASSERT_EQ(false, confCategory.isJSON(\"name\"));\n\tASSERT_EQ(true, confCategory.isJSON(\"complex\"));\n}\n\nTEST(CategoryTest, toJSON)\n{\n\tConfigCategory confCategory(\"test\", myCategory);\n\tconfCategory.setDescription(\"Test description\");\n\tASSERT_EQ(0, confCategory.toJSON().compare(json));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <MutilaDebug.h>\n#include <stdint.h>\n#include <string.h>\n#include \"PowerMode.h\"\n#include \"Matrix.h\"\n#include \"Config.h\"\n#include \"Settings.h\"\n\nPowerMode_ PowerMode;\n\nPowerMode_::PowerMode_() :\n    lastPlot(0),\n    graphPos(0),\n    maxSincePlot(0)\n{\n    clearGraph();\n}\n\nvoid PowerMode_::start(const char* data)\n{\n    DB(F(\"PowerMode::start \"));\n    DBLN(data);\n    String s = data;\n    \/\/ strip trailing '-' characters\n    s.replace(\"-\", \"\");\n    Matrix.clear();\n    \/\/ TODO: determine if we need to clear the graph - if we have had no value for some number of seconds\n\n    \/\/ Update maxSincePlot\n    if (s.toInt() > maxSincePlot) {\n        maxSincePlot = s.toInt();\n    }\n\n    \/\/ Plot the graph if we need to\n    if (millis() >= lastPlot + GRAPH_PLOT_MS) {\n        lastPlot = millis();\n        plotGraph();\n    }\n\n    writeValue(s.toInt());\n    Matrix.paint();\n}\n\nvoid PowerMode_::writeValue(uint32_t tenthsWatt)\n{\n    \/\/ Work out width in pixels of whole part text\n    uint16_t wholePart = tenthsWatt\/10;\n    uint8_t wholePartWidth = wholePart == 0 ? otherWidth+1 : 0;\n    for (uint16_t i=wholePart; i>0; i\/=10) {\n        wholePartWidth += (i%10==1) ? oneWidth : otherWidth;\n        wholePartWidth++;\n    }\n\n    Matrix.setFont(fontSize);\n    \/\/ Write the whole part\n    Matrix.text(MATRIX_GREEN, xpos - wholePartWidth, ypos, String(wholePart));\n    \/\/ Draw the decimal point\n    Matrix.rectangle(MATRIX_GREEN, xpos, ypos, 2, 2);\n    \/\/ Write the fractional part (1 d.p.)\n    Matrix.text(MATRIX_GREEN, xpos+3, ypos, String(tenthsWatt%10));\n    \/\/ Write the units symbol (Watts)\n    Matrix.text(MATRIX_GREEN, xpos+otherWidth+4, ypos, \"W\");\n}\n\nvoid PowerMode_::update()\n{\n}\n\nvoid PowerMode_::clearGraph()\n{\n    DBLN(F(\"PowerMode::clearGraph\"));\n    memset((void*)graphData, 0, sizeof(uint32_t)*GRAPH_DATA_ITEMS);\n}\n\nvoid PowerMode_::plotGraph()\n{\n    DB(F(\"PowerMode::plotGraph 10ths=\"));\n    DBLN(maxSincePlot);\n    \/\/ Add a value to the graph data & change the pointer\n    graphData[graphPos] = maxSincePlot;\n    \/\/ Incremement the pointer\n    graphPos = (graphPos+1)%GRAPH_DATA_ITEMS;\n\n    \/\/ Plot up to the pointer\n    int8_t idx = graphPos; \n    for (uint8_t i=0; i<GRAPH_DATA_ITEMS; i++) {\n        idx = idx == 0 ? GRAPH_DATA_ITEMS-1 : idx-1;\n        \/\/ get the index in the graph in reverse chronological order (most recent first)\n        uint8_t height = (graphData[idx]*MATRIX_SIZE_Y)\/(10*MaxPowerWatts.get());\n        DB(F(\"PLOT idx=\"));\n        DB(idx);\n        DB(F(\" 10ths=\"));\n        DB(graphData[idx]);\n        DB(F(\" max=\"));\n        DB(MaxPowerWatts.get());\n        DB(F(\" height=\"));\n        DBLN(height);\n        if (graphData[idx]>0) {\n            Matrix.line(MATRIX_RED, MATRIX_SIZE_X-i-1, MATRIX_SIZE_Y-1, MATRIX_SIZE_X-i-1, MATRIX_SIZE_Y-1-height);\n        }\n    }\n    maxSincePlot = 0;\n}\n\n\n\n<commit_msg>prevent wrap with high graphs<commit_after>#include <MutilaDebug.h>\n#include <stdint.h>\n#include <string.h>\n#include \"PowerMode.h\"\n#include \"Matrix.h\"\n#include \"Config.h\"\n#include \"Settings.h\"\n\nPowerMode_ PowerMode;\n\nPowerMode_::PowerMode_() :\n    lastPlot(0),\n    graphPos(0),\n    maxSincePlot(0)\n{\n    clearGraph();\n}\n\nvoid PowerMode_::start(const char* data)\n{\n    DB(F(\"PowerMode::start \"));\n    DBLN(data);\n    String s = data;\n    \/\/ strip trailing '-' characters\n    s.replace(\"-\", \"\");\n    Matrix.clear();\n    \/\/ TODO: determine if we need to clear the graph - if we have had no value for some number of seconds\n\n    \/\/ Update maxSincePlot\n    if (s.toInt() > maxSincePlot) {\n        maxSincePlot = s.toInt();\n    }\n\n    \/\/ Plot the graph if we need to\n    if (millis() >= lastPlot + GRAPH_PLOT_MS) {\n        lastPlot = millis();\n        plotGraph();\n    }\n\n    writeValue(s.toInt());\n    Matrix.paint();\n}\n\nvoid PowerMode_::writeValue(uint32_t tenthsWatt)\n{\n    \/\/ Work out width in pixels of whole part text\n    uint16_t wholePart = tenthsWatt\/10;\n    uint8_t wholePartWidth = wholePart == 0 ? otherWidth+1 : 0;\n    for (uint16_t i=wholePart; i>0; i\/=10) {\n        wholePartWidth += (i%10==1) ? oneWidth : otherWidth;\n        wholePartWidth++;\n    }\n\n    Matrix.setFont(fontSize);\n    \/\/ Write the whole part\n    Matrix.text(MATRIX_GREEN, xpos - wholePartWidth, ypos, String(wholePart));\n    \/\/ Draw the decimal point\n    Matrix.rectangle(MATRIX_GREEN, xpos, ypos, 2, 2);\n    \/\/ Write the fractional part (1 d.p.)\n    Matrix.text(MATRIX_GREEN, xpos+3, ypos, String(tenthsWatt%10));\n    \/\/ Write the units symbol (Watts)\n    Matrix.text(MATRIX_GREEN, xpos+otherWidth+4, ypos, \"W\");\n}\n\nvoid PowerMode_::update()\n{\n}\n\nvoid PowerMode_::clearGraph()\n{\n    DBLN(F(\"PowerMode::clearGraph\"));\n    memset((void*)graphData, 0, sizeof(uint32_t)*GRAPH_DATA_ITEMS);\n}\n\nvoid PowerMode_::plotGraph()\n{\n    DB(F(\"PowerMode::plotGraph 10ths=\"));\n    DBLN(maxSincePlot);\n    \/\/ Add a value to the graph data & change the pointer\n    graphData[graphPos] = maxSincePlot;\n    \/\/ Incremement the pointer\n    graphPos = (graphPos+1)%GRAPH_DATA_ITEMS;\n\n    \/\/ Plot up to the pointer\n    int8_t idx = graphPos; \n    for (uint8_t i=0; i<GRAPH_DATA_ITEMS; i++) {\n        idx = idx == 0 ? GRAPH_DATA_ITEMS-1 : idx-1;\n        \/\/ get the index in the graph in reverse chronological order (most recent first)\n        uint8_t height = (graphData[idx]*MATRIX_SIZE_Y)\/(10*MaxPowerWatts.get());\n        DB(F(\"PLOT idx=\"));\n        DB(idx);\n        DB(F(\" 10ths=\"));\n        DB(graphData[idx]);\n        DB(F(\" max=\"));\n        DB(MaxPowerWatts.get());\n        DB(F(\" height=\"));\n        DBLN(height);\n        if (graphData[idx]>0) {\n            Matrix.line(MATRIX_RED, MATRIX_SIZE_X-i-1, MATRIX_SIZE_Y-1, MATRIX_SIZE_X-i-1, height < MATRIX_SIZE_Y ? MATRIX_SIZE_Y-1-height : 0);\n        }\n    }\n    maxSincePlot = 0;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * @file node.hpp\n *\n * @brief Ellis node public C++ header.\n *\n *\/\n\n#pragma once\n#ifndef ELLIS_NODE_HPP_\n#define ELLIS_NODE_HPP_\n\n#include <ellis\/type.hpp>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <vector>\n#include <vector>\n\n\nnamespace ellis {\n\n\n\/* Forward declaration. *\/\nclass array_node;\nclass binary_node;\nclass map_node;\nstruct prize_blk;\n\n\n\/* TODO: steal\/adapt doxygen documentation from the C headers *\/\n\/* TODO: name the variables in the function prototypes *\/\n\n\n\/** node is an in-memory generic hierarchical node that can represent a\n * map, array, integer, or string, etc, corresponding to a hierarchical object\n * expressed in a variety of formats, such as XML, JSON, BSON, or msgpack.\n *\n * It is intended as a convenient interoperable in-memory object (representing\n * unpacked data received from network or disk in some serialized form), and\n * for general purpose conveyance between functions in a program after having\n * been received.  For example, a server might receive an node using one\n * serialization format, modify the node, store it into a queue, and\n * then send it elsewhere in a completely different format.\n *\n * This object has ref-counted copy-on-write semantics--if you make a copy,\n * then the reference count of the source will be incremented, but if you\n * then modify the copy, then an actual copy will occur at the given node,\n * with new reference count equal to one, and the original reference count\n * will decrease.\n *\/\nclass node {\n\n  using pad_t = char[8];  \/* pad covers union--checked via static_assert *\/\n  union {\n    bool m_boo;\n    double m_dbl;\n    int64_t m_int;\n    std::string m_str;\n    prize_blk *m_blk;\n    pad_t m_pad;\n  };\n  unsigned int m_type;\n\n  \/* Private methods--see implementation for description. *\/\n  void _zap_contents(type t);\n  void _grab_contents(const node &other);\n  void _release_contents();\n  void _prep_for_write();\n  bool & _as_mutable_bool();\n  const bool & _as_bool() const;\n  int64_t & _as_mutable_int64();\n  const int64_t & _as_int64() const;\n  double & _as_mutable_double();\n  \/\/ TODO: remove this const as well? no! but still, rename for _const_as.\n  const double & _as_double() const;\n  std::string & _as_mutable_u8str();\n  const std::string & _as_u8str() const;\n  array_node & _as_mutable_array();\n  const array_node & _as_array() const;\n  map_node & _as_mutable_map();\n  const map_node & _as_map() const;\n  binary_node & _as_mutable_binary();\n  const binary_node & _as_binary() const;\n\n public:\n\n  \/*   ____                _                   _\n   *  \/ ___|___  _ __  ___| |_ _ __ _   _  ___| |_ ___  _ __ ___\n   * | |   \/ _ \\| '_ \\\/ __| __| '__| | | |\/ __| __\/ _ \\| '__\/ __|\n   * | |__| (_) | | | \\__ \\ |_| |  | |_| | (__| || (_) | |  \\__ \\\n   *  \\____\\___\/|_| |_|___\/\\__|_|   \\__,_|\\___|\\__\\___\/|_|  |___\/\n   *\n   *\/\n\n  \/\/ TODO: experiment re safety w\/o explicit constructors\n\n  \/** Construct an ARRAY, MAP, or NIL node. *\/\n  node(type);\n\n  \/** Construct a BINARY node. *\/\n  node(const uint8_t *mem, size_t bytes);\n\n  \/** Construct a BOOL node. *\/\n  node(bool);\n\n  \/** Construct an INT64 node. *\/\n  node(int);\n\n  \/** Construct an INT64 node. *\/\n  node(int64_t);\n\n  \/** Construct an INT64 node. *\/\n  node(unsigned int);\n\n  \/** Construct an INT64 node. *\/\n  node(uint64_t);\n\n  \/** Construct a DOUBLE node. *\/\n  node(double);\n\n  \/** Construct a U8STR node. *\/\n  node(const std::string&);\n\n  \/** Construct a U8STR node. *\/\n  node(const char *);\n\n  \/** Copy constructor.\n   *\n   * Shares contents by incrementing ref count.  Contents are subject to\n   * copy on write, until refcount goes down to 1 again. *\/\n  node(const node& other);\n\n  \/** Move constructor.\n   *\n   * Steals contents, without changing ref count.  Other no longer has a\n   * reference count, and will not affect the contents when deleted. *\/\n  node(node&& other);\n\n\n  \/*  ____            _                   _\n   * |  _ \\  ___  ___| |_ _ __ _   _  ___| |_ ___  _ __\n   * | | | |\/ _ \\\/ __| __| '__| | | |\/ __| __\/ _ \\| '__|\n   * | |_| |  __\/\\__ \\ |_| |  | |_| | (__| || (_) | |\n   * |____\/ \\___||___\/\\__|_|   \\__,_|\\___|\\__\\___\/|_|\n   *\n   *\/\n\n  void release();\n  ~node();\n\n\n  void swap(node &other);\n\n  \/** Do a deep copy of the other node--new objects, new reference counter,\n   * no sharing.\n   *\n   * The \"other\" node is allowed to be this very node; copy-on-write does this.\n   *\/\n  void deep_copy(const node &other);\n\n\n  \/*   ___                       _\n   *  \/ _ \\ _ __   ___ _ __ __ _| |_ ___  _ __ ___\n   * | | | | '_ \\ \/ _ \\ '__\/ _` | __\/ _ \\| '__\/ __|\n   * | |_| | |_) |  __\/ | | (_| | || (_) | |  \\__ \\\n   *  \\___\/| .__\/ \\___|_|  \\__,_|\\__\\___\/|_|  |___\/\n   *       |_|\n   *\/\n\n  \/** Copy assignment operator.\n   *\n   * Shares the RHS's contents via COW, as in copy constructor.\n   *\n   * Any prior contents of this node are lost (refcount decremented).\n   *\/\n  node& operator=(const node& rhs);\n  node& operator=(bool o);\n  node& operator=(double o);\n  node& operator=(int o);\n  node& operator=(unsigned int o);\n  node& operator=(int64_t o);\n  node& operator=(const char *o);\n  node& operator=(const std::string &o);\n\n  \/** Move assignment operator.\n   *\n   * Steals the RHS's contents, as in move constructor.\n   *\n   * Any prior contents of this node are lost (refcount decremented).\n   *\/\n  node& operator=(node&& rhs);\n\n  \/** Equality operator.\n   *\n   * Equality is defined as one might expect--types same, simple values same,\n   * array sizes and elements same, map keys and values same.\n   *\n   * Note that we also define not equal operator, but we do not define\n   * lesser\/greater operators since there is not a clear scheme for ordering\n   * at this time.\n   *\/\n  bool operator==(const node &) const;\n  bool operator==(bool o) const;\n  bool operator==(double o) const;\n  bool operator==(int o) const;\n  bool operator==(unsigned int o) const;\n  bool operator==(int64_t o) const;\n  bool operator==(const char *o) const;\n  bool operator==(const std::string &o) const;\n\n\n  \/** Inequality operator.\n   *\n   * Same as (not (a==b)).\n   *\/\n  bool operator!=(const node &o) const;\n  bool operator!=(bool o) const;\n  bool operator!=(double o) const;\n  bool operator!=(int o) const;\n  bool operator!=(unsigned int o) const;\n  bool operator!=(int64_t o) const;\n  bool operator!=(const char *o) const;\n  bool operator!=(const std::string &o) const;\n\n\n  \/*  _____\n   * |_   _|   _ _ __   ___\n   *   | || | | | '_ \\ \/ _ \\\n   *   | || |_| | |_) |  __\/\n   *   |_| \\__, | .__\/ \\___|\n   *       |___\/|_|\n   *\/\n\n\n  \/** Check whether this node is of type t. *\/\n  bool is_type(type t) const;\n\n  \/** Return the type of this node. *\/\n  type get_type() const;\n\n\n  \/*   ____            _             _\n   *  \/ ___|___  _ __ | |_ ___ _ __ | |_ ___\n   * | |   \/ _ \\| '_ \\| __\/ _ \\ '_ \\| __\/ __|\n   * | |__| (_) | | | | ||  __\/ | | | |_\\__ \\\n   *  \\____\\___\/|_| |_|\\__\\___|_| |_|\\__|___\/\n   *\n   *\/\n\n\n  \/** Get contents as an bool.\n   *\n   * Will throw WRONG_TYPE error if type is not convertible.\n   *\/\n  explicit operator bool() const;\n  bool & as_mutable_bool();\n  const bool & as_bool() const;\n\n  \/** Get contents as an int64_t.\n   *\n   * Will throw WRONG_TYPE error if type is not convertible.\n   *\/\n  explicit operator int() const;\n  explicit operator unsigned int() const;\n  explicit operator int64_t() const;\n  explicit operator uint64_t() const;\n  int64_t & as_mutable_int64();\n  const int64_t & as_int64() const;\n\n  \/** Get contents as a double.\n   *\n   * Will throw WRONG_TYPE error if type is not convertible.\n   *\/\n  explicit operator double() const;\n  double & as_mutable_double();\n  const double & as_double() const;\n\n  \/** Provide access to UTF-8 string contents.\n   *\n   * Will throw WRONG_TYPE error if type is not U8STR.\n   *\/\n  std::string & as_mutable_u8str();\n  const std::string & as_u8str() const;\n\n  \/** Provide access to array functionality.\n   *\n   * See array_node.hpp for more information.\n   *\n   * Will throw WRONG_TYPE error if type is not ARRAY.\n   *\/\n  array_node & as_mutable_array();\n  const array_node & as_array() const;\n\n  \/** Provide access to map functionality.\n   *\n   * See map_node.hpp for more information.\n   *\n   * Will throw WRONG_TYPE error if type is not MAP.\n   *\/\n  map_node & as_mutable_map();\n  const map_node & as_map() const;\n\n  \/** Provide access to binary blob contents.\n   *\n   * See binary_node.hpp for more information.\n   *\n   * Will throw WRONG_TYPE error if type is not BINARY.\n   *\/\n  binary_node & as_mutable_binary();\n  const binary_node & as_binary() const;\n\n  \/** Get value from tree at given path (e.g. \"{log}{handlers}[0]{sync}\").\n   *\/\n  node & at_path_mutable(const std::string &path);\n  const node & at_path(const std::string &path) const;\n\n  friend class array_node;\n  friend class binary_node;\n  friend class map_node;\n};\n\n\nnamespace prize_types {\n  using arr_t = std::vector<node>;\n  using map_t = std::unordered_map<std::string, node>;\n  using bin_t = std::vector<uint8_t>;\n  using refcount_t = unsigned;\n}\n\n\nstruct prize_blk {\n  prize_types::refcount_t m_refcount;\n  union {\n    prize_types::arr_t m_arr;\n    prize_types::map_t m_map;\n    prize_types::bin_t m_bin;\n  };\n};\n\n\n\/*  ___          _\n * |_ _|___  ___| |_ _ __ ___  __ _ _ __ ___\n *  | |\/ _ \\\/ __| __| '__\/ _ \\\/ _` | '_ ` _ \\\n *  | | (_) \\__ \\ |_| | |  __\/ (_| | | | | | |\n * |___\\___\/|___\/\\__|_|  \\___|\\__,_|_| |_| |_|\n *\n *   ___                       _\n *  \/ _ \\ _ __   ___ _ __ __ _| |_ ___  _ __ ___\n * | | | | '_ \\ \/ _ \\ '__\/ _` | __\/ _ \\| '__\/ __|\n * | |_| | |_) |  __\/ | | (_| | || (_) | |  \\__ \\\n *  \\___\/| .__\/ \\___|_|  \\__,_|\\__\\___\/|_|  |___\/\n *       |_|\n *\/\n\n\nstd::ostream & operator<<(std::ostream & os, const node & v);\nstd::istream & operator>>(std::istream & is, node & v);\n\n\n}  \/* namespace ellis *\/\n\n\n#endif  \/* ELLIS_NODE_HPP_ *\/\n<commit_msg>refactorizin<commit_after>\/*\n * @file node.hpp\n *\n * @brief Ellis node public C++ header.\n *\n *\/\n\n#pragma once\n#ifndef ELLIS_NODE_HPP_\n#define ELLIS_NODE_HPP_\n\n#include <ellis\/type.hpp>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <vector>\n#include <vector>\n\n\nnamespace ellis {\n\n\n\/* Forward declaration. *\/\nclass array_node;\nclass binary_node;\nclass map_node;\nstruct prize_blk;\n\n\n\/* TODO: steal\/adapt doxygen documentation from the C headers *\/\n\/* TODO: name the variables in the function prototypes *\/\n\n\n\/** node is an in-memory generic hierarchical node that can represent a\n * map, array, integer, or string, etc, corresponding to a hierarchical object\n * expressed in a variety of formats, such as XML, JSON, BSON, or msgpack.\n *\n * It is intended as a convenient interoperable in-memory object (representing\n * unpacked data received from network or disk in some serialized form), and\n * for general purpose conveyance between functions in a program after having\n * been received.  For example, a server might receive an node using one\n * serialization format, modify the node, store it into a queue, and\n * then send it elsewhere in a completely different format.\n *\n * This object has ref-counted copy-on-write semantics--if you make a copy,\n * then the reference count of the source will be incremented, but if you\n * then modify the copy, then an actual copy will occur at the given node,\n * with new reference count equal to one, and the original reference count\n * will decrease.\n *\/\nclass node {\n\n  using pad_t = char[8];  \/* pad covers union--checked via static_assert *\/\n  union {\n    bool m_boo;\n    double m_dbl;\n    int64_t m_int;\n    std::string m_str;\n    prize_blk *m_blk;\n    pad_t m_pad;\n  };\n  unsigned int m_type;\n\n  \/* Private methods--see implementation for description. *\/\n  void _zap_contents(type t);\n  void _grab_contents(const node &other);\n  void _release_contents();\n  void _prep_for_write();\n  const bool        & _as_bool() const;\n  const int64_t     & _as_int64() const;\n  const double      & _as_double() const;\n  const std::string & _as_u8str() const;\n  const array_node  & _as_array() const;\n  const map_node    & _as_map() const;\n  const binary_node & _as_binary() const;\n  bool        & _as_mutable_bool();\n  int64_t     & _as_mutable_int64();\n  double      & _as_mutable_double();\n  std::string & _as_mutable_u8str();\n  array_node  & _as_mutable_array();\n  map_node    & _as_mutable_map();\n  binary_node & _as_mutable_binary();\n\n public:\n\n  \/*   ____                _                   _\n   *  \/ ___|___  _ __  ___| |_ _ __ _   _  ___| |_ ___  _ __ ___\n   * | |   \/ _ \\| '_ \\\/ __| __| '__| | | |\/ __| __\/ _ \\| '__\/ __|\n   * | |__| (_) | | | \\__ \\ |_| |  | |_| | (__| || (_) | |  \\__ \\\n   *  \\____\\___\/|_| |_|___\/\\__|_|   \\__,_|\\___|\\__\\___\/|_|  |___\/\n   *\n   *\/\n\n  \/\/ TODO: experiment re safety w\/o explicit constructors\n\n  \/** Construct an ARRAY, MAP, or NIL node. *\/\n  node(type);\n\n  \/** Construct a BINARY node. *\/\n  node(const uint8_t *mem, size_t bytes);\n\n  \/** Construct a BOOL node. *\/\n  node(bool);\n\n  \/** Construct an INT64 node. *\/\n  node(int);\n\n  \/** Construct an INT64 node. *\/\n  node(int64_t);\n\n  \/** Construct an INT64 node. *\/\n  node(unsigned int);\n\n  \/** Construct an INT64 node. *\/\n  node(uint64_t);\n\n  \/** Construct a DOUBLE node. *\/\n  node(double);\n\n  \/** Construct a U8STR node. *\/\n  node(const std::string&);\n\n  \/** Construct a U8STR node. *\/\n  node(const char *);\n\n  \/** Copy constructor.\n   *\n   * Shares contents by incrementing ref count.  Contents are subject to\n   * copy on write, until refcount goes down to 1 again. *\/\n  node(const node& other);\n\n  \/** Move constructor.\n   *\n   * Steals contents, without changing ref count.  Other no longer has a\n   * reference count, and will not affect the contents when deleted. *\/\n  node(node&& other);\n\n\n  \/*  ____            _                   _\n   * |  _ \\  ___  ___| |_ _ __ _   _  ___| |_ ___  _ __\n   * | | | |\/ _ \\\/ __| __| '__| | | |\/ __| __\/ _ \\| '__|\n   * | |_| |  __\/\\__ \\ |_| |  | |_| | (__| || (_) | |\n   * |____\/ \\___||___\/\\__|_|   \\__,_|\\___|\\__\\___\/|_|\n   *\n   *\/\n\n  \/** TODO: is this supposed to be related to _release_contents() and if\n   * so why public?  Unimplemented.  Remove unless there is a purpose. *\/\n  void release();\n\n  ~node();\n\n\n  \/** Swap the contents of this node and the other. *\/\n  void swap(node &other);\n\n  \/** Do a deep copy of the other node--new objects, new reference counter,\n   * no sharing.\n   *\n   * The \"other\" node is allowed to be this very node; copy-on-write uses\n   * this scenario to move self away from the original copy.\n   *\/\n  void deep_copy(const node &other);\n\n\n  \/*   ___                       _\n   *  \/ _ \\ _ __   ___ _ __ __ _| |_ ___  _ __ ___\n   * | | | | '_ \\ \/ _ \\ '__\/ _` | __\/ _ \\| '__\/ __|\n   * | |_| | |_) |  __\/ | | (_| | || (_) | |  \\__ \\\n   *  \\___\/| .__\/ \\___|_|  \\__,_|\\__\\___\/|_|  |___\/\n   *       |_|\n   *\/\n\n  \/** Copy assignment operator.\n   *\n   * Shares the RHS's contents via COW, as in copy constructor.\n   *\n   * Any prior contents of this node are lost (refcount decremented).\n   *\/\n  node& operator=(const node& rhs);\n\n  \/** Move assignment operator.\n   *\n   * Steals the RHS's contents, as in move constructor.\n   *\n   * Any prior contents of this node are lost (refcount decremented).\n   *\/\n  node& operator=(node&& rhs);\n\n  \/** Assignment operators from primitive types.\n   *\n   * Any prior contents of this node are lost (refcount decremented).\n   *\/\n  node& operator=(bool o);\n  node& operator=(double o);\n  node& operator=(int o);\n  node& operator=(unsigned int o);\n  node& operator=(int64_t o);\n  node& operator=(const char *o);\n  node& operator=(const std::string &o);\n\n  \/** Comparison operators for another node.\n   *\n   * Equality is defined as one might expect--types same, simple values same,\n   * array sizes and elements same, map keys and values same.\n   *\n   * Note that we define the not equal operator, but we do not define\n   * lesser\/greater operators since there is not a clear scheme for ordering\n   * at this time.\n   *\/\n  bool operator==(const node &) const;\n  bool operator!=(const node &o) const;\n\n  \/** Comparison operators for primitive types.\n   *\n   * This implicitly verifies the type, e.g.:\n   *\n   *   mynode == 4.5\n   *\n   * Is equivalent to:\n   *\n   *   mynode.as_double() == 4.5\n   *\n   * This means that an exception can be thrown if the type is incorrect,\n   * as is the case with the as_xxx() converter functions.\n   *\/\n  bool operator==(bool o) const;\n  bool operator==(double o) const;\n  bool operator==(int o) const;\n  bool operator==(unsigned int o) const;\n  bool operator==(int64_t o) const;\n  bool operator==(const char *o) const;\n  bool operator==(const std::string &o) const;\n\n  \/** Inequality operators for primitive types.\n   *\n   * Same as (not (a==b)).\n   *\/\n  bool operator!=(bool o) const;\n  bool operator!=(double o) const;\n  bool operator!=(int o) const;\n  bool operator!=(unsigned int o) const;\n  bool operator!=(int64_t o) const;\n  bool operator!=(const char *o) const;\n  bool operator!=(const std::string &o) const;\n\n  \/** Typecasting operators for primitive types.\n   *\n   * These are convenience wrappers.  For example:\n   *\n   *   (bool)mynode\n   *\n   * is equivalent to:\n   *\n   *   mynode.as_bool()\n   *\n   * This means that an exception can be thrown if the type is incorrect,\n   * as is the case with the as_xxx() converter functions.\n   *\/\n  explicit operator bool() const;\n  explicit operator int() const;\n  explicit operator unsigned int() const;\n  explicit operator int64_t() const;\n  explicit operator uint64_t() const;\n  explicit operator double() const;\n  explicit operator std::string() const;\n  explicit operator const char *() const;\n\n\n  \/*  _____\n   * |_   _|   _ _ __   ___\n   *   | || | | | '_ \\ \/ _ \\\n   *   | || |_| | |_) |  __\/\n   *   |_| \\__, | .__\/ \\___|\n   *       |___\/|_|\n   *\/\n\n\n  \/** Check whether this node is of type t. *\/\n  bool is_type(type t) const;\n\n  \/** Return the type of this node. *\/\n  type get_type() const;\n\n\n  \/*   ____            _             _\n   *  \/ ___|___  _ __ | |_ ___ _ __ | |_ ___\n   * | |   \/ _ \\| '_ \\| __\/ _ \\ '_ \\| __\/ __|\n   * | |__| (_) | | | | ||  __\/ | | | |_\\__ \\\n   *  \\____\\___\/|_| |_|\\__\\___|_| |_|\\__|___\/\n   *\n   *\/\n\n\n  \/** Get contents as an bool.\n   *\n   * Will throw WRONG_TYPE error if type is not convertible.\n   *\/\n  const bool & as_bool() const;\n\n  \/** Get contents as an int64_t.\n   *\n   * Will throw WRONG_TYPE error if type is not convertible.\n   *\/\n  const int64_t & as_int64() const;\n\n  \/** Get contents as a double.\n   *\n   * Will throw WRONG_TYPE error if type is not convertible.\n   *\/\n  const double & as_double() const;\n\n  \/** Provide access to UTF-8 string contents.\n   *\n   * Will throw WRONG_TYPE error if type is not U8STR.\n   *\/\n  const std::string & as_u8str() const;\n  const char * as_u8cstr() const;\n\n  \/** Provide access to array functionality.\n   *\n   * See array_node.hpp for more information.\n   *\n   * Will throw WRONG_TYPE error if type is not ARRAY.\n   *\/\n  const array_node & as_array() const;\n\n  \/** Provide access to map functionality.\n   *\n   * See map_node.hpp for more information.\n   *\n   * Will throw WRONG_TYPE error if type is not MAP.\n   *\/\n  const map_node & as_map() const;\n\n  \/** Provide access to binary blob contents.\n   *\n   * See binary_node.hpp for more information.\n   *\n   * Will throw WRONG_TYPE error if type is not BINARY.\n   *\/\n  const binary_node & as_binary() const;\n\n  \/** Get value from tree at given path (e.g. \"{log}{handlers}[0]{sync}\").\n   *\/\n  const node & at_path(const std::string &path) const;\n\n  \/** Mutable access to contents.\n   *\n   * Similar to immutable versions above, including type exceptions,\n   * but the return value can be modified and the node will be updated.\n   *\n   * NOTE: since we don't have an easy hook for when you change the given\n   * double pointer\/reference, the copy-on-write logic is initiated as soon\n   * as you request mutable access, even if you don't actually change it.\n   *\/\n  bool        & as_mutable_bool();\n  int64_t     & as_mutable_int64();\n  double      & as_mutable_double();\n  std::string & as_mutable_u8str();\n  array_node  & as_mutable_array();\n  map_node    & as_mutable_map();\n  binary_node & as_mutable_binary();\n  node & at_path_mutable(const std::string &path);\n\n  friend class array_node;\n  friend class binary_node;\n  friend class map_node;\n};\n\n\nnamespace prize_types {\n  using arr_t = std::vector<node>;\n  using map_t = std::unordered_map<std::string, node>;\n  using bin_t = std::vector<uint8_t>;\n  using refcount_t = unsigned;\n}\n\n\nstruct prize_blk {\n  prize_types::refcount_t m_refcount;\n  union {\n    prize_types::arr_t m_arr;\n    prize_types::map_t m_map;\n    prize_types::bin_t m_bin;\n  };\n};\n\n\n\/*  ___          _\n * |_ _|___  ___| |_ _ __ ___  __ _ _ __ ___\n *  | |\/ _ \\\/ __| __| '__\/ _ \\\/ _` | '_ ` _ \\\n *  | | (_) \\__ \\ |_| | |  __\/ (_| | | | | | |\n * |___\\___\/|___\/\\__|_|  \\___|\\__,_|_| |_| |_|\n *\n *   ___                       _\n *  \/ _ \\ _ __   ___ _ __ __ _| |_ ___  _ __ ___\n * | | | | '_ \\ \/ _ \\ '__\/ _` | __\/ _ \\| '__\/ __|\n * | |_| | |_) |  __\/ | | (_| | || (_) | |  \\__ \\\n *  \\___\/| .__\/ \\___|_|  \\__,_|\\__\\___\/|_|  |___\/\n *       |_|\n *\/\n\n\nstd::ostream & operator<<(std::ostream & os, const node & v);\nstd::istream & operator>>(std::istream & is, node & v);\n\n\n}  \/* namespace ellis *\/\n\n\n#endif  \/* ELLIS_NODE_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 \"chrome\/browser\/process_singleton.h\"\n\n#include <shellapi.h>\n\n#include \"base\/base_paths.h\"\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/files\/file_util.h\"\n#include \"base\/process\/process.h\"\n#include \"base\/process\/process_info.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/time\/time.h\"\n#include \"base\/win\/registry.h\"\n#include \"base\/win\/scoped_handle.h\"\n#include \"base\/win\/windows_version.h\"\n#include \"chrome\/browser\/chrome_process_finder_win.h\"\n#include \"content\/public\/common\/result_codes.h\"\n#include \"net\/base\/escape.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/gfx\/win\/hwnd_util.h\"\n\nnamespace {\n\nconst char kLockfile[] = \"lockfile\";\n\n\/\/ A helper class that acquires the given |mutex| while the AutoLockMutex is in\n\/\/ scope.\nclass AutoLockMutex {\n public:\n  explicit AutoLockMutex(HANDLE mutex) : mutex_(mutex) {\n    DWORD result = ::WaitForSingleObject(mutex_, INFINITE);\n    DPCHECK(result == WAIT_OBJECT_0) << \"Result = \" << result;\n  }\n\n  ~AutoLockMutex() {\n    BOOL released = ::ReleaseMutex(mutex_);\n    DPCHECK(released);\n  }\n\n private:\n  HANDLE mutex_;\n  DISALLOW_COPY_AND_ASSIGN(AutoLockMutex);\n};\n\n\/\/ A helper class that releases the given |mutex| while the AutoUnlockMutex is\n\/\/ in scope and immediately re-acquires it when going out of scope.\nclass AutoUnlockMutex {\n public:\n  explicit AutoUnlockMutex(HANDLE mutex) : mutex_(mutex) {\n    BOOL released = ::ReleaseMutex(mutex_);\n    DPCHECK(released);\n  }\n\n  ~AutoUnlockMutex() {\n    DWORD result = ::WaitForSingleObject(mutex_, INFINITE);\n    DPCHECK(result == WAIT_OBJECT_0) << \"Result = \" << result;\n  }\n\n private:\n  HANDLE mutex_;\n  DISALLOW_COPY_AND_ASSIGN(AutoUnlockMutex);\n};\n\n\/\/ Checks the visibility of the enumerated window and signals once a visible\n\/\/ window has been found.\nBOOL CALLBACK BrowserWindowEnumeration(HWND window, LPARAM param) {\n  bool* result = reinterpret_cast<bool*>(param);\n  *result = ::IsWindowVisible(window) != 0;\n  \/\/ Stops enumeration if a visible window has been found.\n  return !*result;\n}\n\n\/\/ Convert Command line string to argv.\nbase::CommandLine::StringVector CommandLineStringToArgv(\n    const std::wstring& command_line_string) {\n  int num_args = 0;\n  wchar_t** args = NULL;\n  args = ::CommandLineToArgvW(command_line_string.c_str(), &num_args);\n  base::CommandLine::StringVector argv;\n  for (int i = 0; i < num_args; ++i)\n    argv.push_back(std::wstring(args[i]));\n  LocalFree(args);\n  return argv;\n}\n\nbool ParseCommandLine(const COPYDATASTRUCT* cds,\n                      base::CommandLine::StringVector* parsed_command_line,\n                      base::FilePath* current_directory) {\n  \/\/ We should have enough room for the shortest command (min_message_size)\n  \/\/ and also be a multiple of wchar_t bytes. The shortest command\n  \/\/ possible is L\"START\\0\\0\" (empty current directory and command line).\n  static const int min_message_size = 7;\n  if (cds->cbData < min_message_size * sizeof(wchar_t) ||\n      cds->cbData % sizeof(wchar_t) != 0) {\n    LOG(WARNING) << \"Invalid WM_COPYDATA, length = \" << cds->cbData;\n    return false;\n  }\n\n  \/\/ We split the string into 4 parts on NULLs.\n  DCHECK(cds->lpData);\n  const std::wstring msg(static_cast<wchar_t*>(cds->lpData),\n                         cds->cbData \/ sizeof(wchar_t));\n  const std::wstring::size_type first_null = msg.find_first_of(L'\\0');\n  if (first_null == 0 || first_null == std::wstring::npos) {\n    \/\/ no NULL byte, don't know what to do\n    LOG(WARNING) << \"Invalid WM_COPYDATA, length = \" << msg.length() <<\n      \", first null = \" << first_null;\n    return false;\n  }\n\n  \/\/ Decode the command, which is everything until the first NULL.\n  if (msg.substr(0, first_null) == L\"START\") {\n    \/\/ Another instance is starting parse the command line & do what it would\n    \/\/ have done.\n    VLOG(1) << \"Handling STARTUP request from another process\";\n    const std::wstring::size_type second_null =\n        msg.find_first_of(L'\\0', first_null + 1);\n    if (second_null == std::wstring::npos ||\n        first_null == msg.length() - 1 || second_null == msg.length()) {\n      LOG(WARNING) << \"Invalid format for start command, we need a string in 4 \"\n        \"parts separated by NULLs\";\n      return false;\n    }\n\n    \/\/ Get current directory.\n    *current_directory = base::FilePath(msg.substr(first_null + 1,\n                                                   second_null - first_null));\n\n    const std::wstring::size_type third_null =\n        msg.find_first_of(L'\\0', second_null + 1);\n    if (third_null == std::wstring::npos ||\n        third_null == msg.length()) {\n      LOG(WARNING) << \"Invalid format for start command, we need a string in 4 \"\n        \"parts separated by NULLs\";\n    }\n\n    \/\/ Get command line.\n    const std::wstring cmd_line =\n        msg.substr(second_null + 1, third_null - second_null);\n    *parsed_command_line = CommandLineStringToArgv(cmd_line);\n    return true;\n  }\n  return false;\n}\n\nbool ProcessLaunchNotification(\n    const ProcessSingleton::NotificationCallback& notification_callback,\n    UINT message,\n    WPARAM wparam,\n    LPARAM lparam,\n    LRESULT* result) {\n  if (message != WM_COPYDATA)\n    return false;\n\n  \/\/ Handle the WM_COPYDATA message from another process.\n  const COPYDATASTRUCT* cds = reinterpret_cast<COPYDATASTRUCT*>(lparam);\n\n  base::CommandLine::StringVector parsed_command_line;\n  base::FilePath current_directory;\n  if (!ParseCommandLine(cds, &parsed_command_line, &current_directory)) {\n    *result = TRUE;\n    return true;\n  }\n\n  *result = notification_callback.Run(parsed_command_line, current_directory) ?\n      TRUE : FALSE;\n  return true;\n}\n\nbool TerminateAppWithError() {\n  \/\/ TODO: This is called when the secondary process can't ping the primary\n  \/\/ process. Need to find out what to do here.\n  return false;\n}\n\n}  \/\/ namespace\n\nProcessSingleton::ProcessSingleton(\n    const base::FilePath& user_data_dir,\n    const NotificationCallback& notification_callback)\n    : notification_callback_(notification_callback),\n      is_virtualized_(false),\n      lock_file_(INVALID_HANDLE_VALUE),\n      user_data_dir_(user_data_dir),\n      should_kill_remote_process_callback_(\n          base::Bind(&TerminateAppWithError)) {\n  \/\/ The user_data_dir may have not been created yet.\n  base::CreateDirectoryAndGetError(user_data_dir, nullptr);\n}\n\nProcessSingleton::~ProcessSingleton() {\n  if (lock_file_ != INVALID_HANDLE_VALUE)\n    ::CloseHandle(lock_file_);\n}\n\n\/\/ Code roughly based on Mozilla.\nProcessSingleton::NotifyResult ProcessSingleton::NotifyOtherProcess() {\n  if (is_virtualized_)\n    return PROCESS_NOTIFIED;  \/\/ We already spawned the process in this case.\n  if (lock_file_ == INVALID_HANDLE_VALUE && !remote_window_) {\n    return LOCK_ERROR;\n  } else if (!remote_window_) {\n    return PROCESS_NONE;\n  }\n\n  switch (chrome::AttemptToNotifyRunningChrome(remote_window_, false)) {\n    case chrome::NOTIFY_SUCCESS:\n      return PROCESS_NOTIFIED;\n    case chrome::NOTIFY_FAILED:\n      remote_window_ = NULL;\n      return PROCESS_NONE;\n    case chrome::NOTIFY_WINDOW_HUNG:\n      \/\/ Fall through and potentially terminate the hung browser.\n      break;\n  }\n\n  DWORD process_id = 0;\n  DWORD thread_id = ::GetWindowThreadProcessId(remote_window_, &process_id);\n  if (!thread_id || !process_id) {\n    remote_window_ = NULL;\n    return PROCESS_NONE;\n  }\n  base::Process process = base::Process::Open(process_id);\n\n  \/\/ The window is hung. Scan for every window to find a visible one.\n  bool visible_window = false;\n  ::EnumThreadWindows(thread_id,\n                      &BrowserWindowEnumeration,\n                      reinterpret_cast<LPARAM>(&visible_window));\n\n  \/\/ If there is a visible browser window, ask the user before killing it.\n  if (visible_window && !should_kill_remote_process_callback_.Run()) {\n    \/\/ The user denied. Quit silently.\n    return PROCESS_NOTIFIED;\n  }\n\n  \/\/ Time to take action. Kill the browser process.\n  process.Terminate(content::RESULT_CODE_HUNG, true);\n  remote_window_ = NULL;\n  return PROCESS_NONE;\n}\n\nProcessSingleton::NotifyResult\nProcessSingleton::NotifyOtherProcessOrCreate() {\n  ProcessSingleton::NotifyResult result = PROCESS_NONE;\n  if (!Create()) {\n    result = NotifyOtherProcess();\n    if (result == PROCESS_NONE)\n      result = PROFILE_IN_USE;\n  }\n  return result;\n}\n\n\/\/ Look for a Chrome instance that uses the same profile directory. If there\n\/\/ isn't one, create a message window with its title set to the profile\n\/\/ directory path.\nbool ProcessSingleton::Create() {\n  static const wchar_t kMutexName[] = L\"Local\\\\AtomProcessSingletonStartup!\";\n\n  remote_window_ = chrome::FindRunningChromeWindow(user_data_dir_);\n  if (!remote_window_) {\n    \/\/ Make sure we will be the one and only process creating the window.\n    \/\/ We use a named Mutex since we are protecting against multi-process\n    \/\/ access. As documented, it's clearer to NOT request ownership on creation\n    \/\/ since it isn't guaranteed we will get it. It is better to create it\n    \/\/ without ownership and explicitly get the ownership afterward.\n    base::win::ScopedHandle only_me(::CreateMutex(NULL, FALSE, kMutexName));\n    if (!only_me.IsValid()) {\n      DPLOG(FATAL) << \"CreateMutex failed\";\n      return false;\n    }\n\n    AutoLockMutex auto_lock_only_me(only_me.Get());\n\n    \/\/ We now own the mutex so we are the only process that can create the\n    \/\/ window at this time, but we must still check if someone created it\n    \/\/ between the time where we looked for it above and the time the mutex\n    \/\/ was given to us.\n    remote_window_ = chrome::FindRunningChromeWindow(user_data_dir_);\n    if (!remote_window_) {\n      \/\/ We have to make sure there is no Chrome instance running on another\n      \/\/ machine that uses the same profile.\n      base::FilePath lock_file_path = user_data_dir_.AppendASCII(kLockfile);\n      lock_file_ = ::CreateFile(lock_file_path.value().c_str(),\n                                GENERIC_WRITE,\n                                FILE_SHARE_READ,\n                                NULL,\n                                CREATE_ALWAYS,\n                                FILE_ATTRIBUTE_NORMAL |\n                                FILE_FLAG_DELETE_ON_CLOSE,\n                                NULL);\n      DWORD error = ::GetLastError();\n      LOG_IF(WARNING, lock_file_ != INVALID_HANDLE_VALUE &&\n          error == ERROR_ALREADY_EXISTS) << \"Lock file exists but is writable.\";\n      LOG_IF(ERROR, lock_file_ == INVALID_HANDLE_VALUE)\n          << \"Lock file can not be created! Error code: \" << error;\n\n      if (lock_file_ != INVALID_HANDLE_VALUE) {\n        \/\/ Set the window's title to the path of our user data directory so\n        \/\/ other Chrome instances can decide if they should forward to us.\n        bool result = window_.CreateNamed(\n            base::Bind(&ProcessLaunchNotification, notification_callback_),\n            user_data_dir_.value());\n\n        \/\/ NB: Ensure that if the primary app gets started as elevated\n        \/\/ admin inadvertently, secondary windows running not as elevated\n        \/\/ will still be able to send messages\n        ::ChangeWindowMessageFilterEx(window_.hwnd(), WM_COPYDATA, MSGFLT_ALLOW, NULL);\n        CHECK(result && window_.hwnd());\n      }\n    }\n  }\n\n  return window_.hwnd() != NULL;\n}\n\nvoid ProcessSingleton::Cleanup() {\n}\n\nvoid ProcessSingleton::OverrideShouldKillRemoteProcessCallbackForTesting(\n    const ShouldKillRemoteProcessCallback& display_dialog_callback) {\n  should_kill_remote_process_callback_ = display_dialog_callback;\n}\n<commit_msg>fix process finder path<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\/process_singleton.h\"\n\n#include <shellapi.h>\n\n#include \"base\/base_paths.h\"\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/files\/file_util.h\"\n#include \"base\/process\/process.h\"\n#include \"base\/process\/process_info.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/time\/time.h\"\n#include \"base\/win\/registry.h\"\n#include \"base\/win\/scoped_handle.h\"\n#include \"base\/win\/windows_version.h\"\n#include \"chrome\/browser\/win\/chrome_process_finder.h\"\n#include \"content\/public\/common\/result_codes.h\"\n#include \"net\/base\/escape.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/gfx\/win\/hwnd_util.h\"\n\nnamespace {\n\nconst char kLockfile[] = \"lockfile\";\n\n\/\/ A helper class that acquires the given |mutex| while the AutoLockMutex is in\n\/\/ scope.\nclass AutoLockMutex {\n public:\n  explicit AutoLockMutex(HANDLE mutex) : mutex_(mutex) {\n    DWORD result = ::WaitForSingleObject(mutex_, INFINITE);\n    DPCHECK(result == WAIT_OBJECT_0) << \"Result = \" << result;\n  }\n\n  ~AutoLockMutex() {\n    BOOL released = ::ReleaseMutex(mutex_);\n    DPCHECK(released);\n  }\n\n private:\n  HANDLE mutex_;\n  DISALLOW_COPY_AND_ASSIGN(AutoLockMutex);\n};\n\n\/\/ A helper class that releases the given |mutex| while the AutoUnlockMutex is\n\/\/ in scope and immediately re-acquires it when going out of scope.\nclass AutoUnlockMutex {\n public:\n  explicit AutoUnlockMutex(HANDLE mutex) : mutex_(mutex) {\n    BOOL released = ::ReleaseMutex(mutex_);\n    DPCHECK(released);\n  }\n\n  ~AutoUnlockMutex() {\n    DWORD result = ::WaitForSingleObject(mutex_, INFINITE);\n    DPCHECK(result == WAIT_OBJECT_0) << \"Result = \" << result;\n  }\n\n private:\n  HANDLE mutex_;\n  DISALLOW_COPY_AND_ASSIGN(AutoUnlockMutex);\n};\n\n\/\/ Checks the visibility of the enumerated window and signals once a visible\n\/\/ window has been found.\nBOOL CALLBACK BrowserWindowEnumeration(HWND window, LPARAM param) {\n  bool* result = reinterpret_cast<bool*>(param);\n  *result = ::IsWindowVisible(window) != 0;\n  \/\/ Stops enumeration if a visible window has been found.\n  return !*result;\n}\n\n\/\/ Convert Command line string to argv.\nbase::CommandLine::StringVector CommandLineStringToArgv(\n    const std::wstring& command_line_string) {\n  int num_args = 0;\n  wchar_t** args = NULL;\n  args = ::CommandLineToArgvW(command_line_string.c_str(), &num_args);\n  base::CommandLine::StringVector argv;\n  for (int i = 0; i < num_args; ++i)\n    argv.push_back(std::wstring(args[i]));\n  LocalFree(args);\n  return argv;\n}\n\nbool ParseCommandLine(const COPYDATASTRUCT* cds,\n                      base::CommandLine::StringVector* parsed_command_line,\n                      base::FilePath* current_directory) {\n  \/\/ We should have enough room for the shortest command (min_message_size)\n  \/\/ and also be a multiple of wchar_t bytes. The shortest command\n  \/\/ possible is L\"START\\0\\0\" (empty current directory and command line).\n  static const int min_message_size = 7;\n  if (cds->cbData < min_message_size * sizeof(wchar_t) ||\n      cds->cbData % sizeof(wchar_t) != 0) {\n    LOG(WARNING) << \"Invalid WM_COPYDATA, length = \" << cds->cbData;\n    return false;\n  }\n\n  \/\/ We split the string into 4 parts on NULLs.\n  DCHECK(cds->lpData);\n  const std::wstring msg(static_cast<wchar_t*>(cds->lpData),\n                         cds->cbData \/ sizeof(wchar_t));\n  const std::wstring::size_type first_null = msg.find_first_of(L'\\0');\n  if (first_null == 0 || first_null == std::wstring::npos) {\n    \/\/ no NULL byte, don't know what to do\n    LOG(WARNING) << \"Invalid WM_COPYDATA, length = \" << msg.length() <<\n      \", first null = \" << first_null;\n    return false;\n  }\n\n  \/\/ Decode the command, which is everything until the first NULL.\n  if (msg.substr(0, first_null) == L\"START\") {\n    \/\/ Another instance is starting parse the command line & do what it would\n    \/\/ have done.\n    VLOG(1) << \"Handling STARTUP request from another process\";\n    const std::wstring::size_type second_null =\n        msg.find_first_of(L'\\0', first_null + 1);\n    if (second_null == std::wstring::npos ||\n        first_null == msg.length() - 1 || second_null == msg.length()) {\n      LOG(WARNING) << \"Invalid format for start command, we need a string in 4 \"\n        \"parts separated by NULLs\";\n      return false;\n    }\n\n    \/\/ Get current directory.\n    *current_directory = base::FilePath(msg.substr(first_null + 1,\n                                                   second_null - first_null));\n\n    const std::wstring::size_type third_null =\n        msg.find_first_of(L'\\0', second_null + 1);\n    if (third_null == std::wstring::npos ||\n        third_null == msg.length()) {\n      LOG(WARNING) << \"Invalid format for start command, we need a string in 4 \"\n        \"parts separated by NULLs\";\n    }\n\n    \/\/ Get command line.\n    const std::wstring cmd_line =\n        msg.substr(second_null + 1, third_null - second_null);\n    *parsed_command_line = CommandLineStringToArgv(cmd_line);\n    return true;\n  }\n  return false;\n}\n\nbool ProcessLaunchNotification(\n    const ProcessSingleton::NotificationCallback& notification_callback,\n    UINT message,\n    WPARAM wparam,\n    LPARAM lparam,\n    LRESULT* result) {\n  if (message != WM_COPYDATA)\n    return false;\n\n  \/\/ Handle the WM_COPYDATA message from another process.\n  const COPYDATASTRUCT* cds = reinterpret_cast<COPYDATASTRUCT*>(lparam);\n\n  base::CommandLine::StringVector parsed_command_line;\n  base::FilePath current_directory;\n  if (!ParseCommandLine(cds, &parsed_command_line, &current_directory)) {\n    *result = TRUE;\n    return true;\n  }\n\n  *result = notification_callback.Run(parsed_command_line, current_directory) ?\n      TRUE : FALSE;\n  return true;\n}\n\nbool TerminateAppWithError() {\n  \/\/ TODO: This is called when the secondary process can't ping the primary\n  \/\/ process. Need to find out what to do here.\n  return false;\n}\n\n}  \/\/ namespace\n\nProcessSingleton::ProcessSingleton(\n    const base::FilePath& user_data_dir,\n    const NotificationCallback& notification_callback)\n    : notification_callback_(notification_callback),\n      is_virtualized_(false),\n      lock_file_(INVALID_HANDLE_VALUE),\n      user_data_dir_(user_data_dir),\n      should_kill_remote_process_callback_(\n          base::Bind(&TerminateAppWithError)) {\n  \/\/ The user_data_dir may have not been created yet.\n  base::CreateDirectoryAndGetError(user_data_dir, nullptr);\n}\n\nProcessSingleton::~ProcessSingleton() {\n  if (lock_file_ != INVALID_HANDLE_VALUE)\n    ::CloseHandle(lock_file_);\n}\n\n\/\/ Code roughly based on Mozilla.\nProcessSingleton::NotifyResult ProcessSingleton::NotifyOtherProcess() {\n  if (is_virtualized_)\n    return PROCESS_NOTIFIED;  \/\/ We already spawned the process in this case.\n  if (lock_file_ == INVALID_HANDLE_VALUE && !remote_window_) {\n    return LOCK_ERROR;\n  } else if (!remote_window_) {\n    return PROCESS_NONE;\n  }\n\n  switch (chrome::AttemptToNotifyRunningChrome(remote_window_, false)) {\n    case chrome::NOTIFY_SUCCESS:\n      return PROCESS_NOTIFIED;\n    case chrome::NOTIFY_FAILED:\n      remote_window_ = NULL;\n      return PROCESS_NONE;\n    case chrome::NOTIFY_WINDOW_HUNG:\n      \/\/ Fall through and potentially terminate the hung browser.\n      break;\n  }\n\n  DWORD process_id = 0;\n  DWORD thread_id = ::GetWindowThreadProcessId(remote_window_, &process_id);\n  if (!thread_id || !process_id) {\n    remote_window_ = NULL;\n    return PROCESS_NONE;\n  }\n  base::Process process = base::Process::Open(process_id);\n\n  \/\/ The window is hung. Scan for every window to find a visible one.\n  bool visible_window = false;\n  ::EnumThreadWindows(thread_id,\n                      &BrowserWindowEnumeration,\n                      reinterpret_cast<LPARAM>(&visible_window));\n\n  \/\/ If there is a visible browser window, ask the user before killing it.\n  if (visible_window && !should_kill_remote_process_callback_.Run()) {\n    \/\/ The user denied. Quit silently.\n    return PROCESS_NOTIFIED;\n  }\n\n  \/\/ Time to take action. Kill the browser process.\n  process.Terminate(content::RESULT_CODE_HUNG, true);\n  remote_window_ = NULL;\n  return PROCESS_NONE;\n}\n\nProcessSingleton::NotifyResult\nProcessSingleton::NotifyOtherProcessOrCreate() {\n  ProcessSingleton::NotifyResult result = PROCESS_NONE;\n  if (!Create()) {\n    result = NotifyOtherProcess();\n    if (result == PROCESS_NONE)\n      result = PROFILE_IN_USE;\n  }\n  return result;\n}\n\n\/\/ Look for a Chrome instance that uses the same profile directory. If there\n\/\/ isn't one, create a message window with its title set to the profile\n\/\/ directory path.\nbool ProcessSingleton::Create() {\n  static const wchar_t kMutexName[] = L\"Local\\\\AtomProcessSingletonStartup!\";\n\n  remote_window_ = chrome::FindRunningChromeWindow(user_data_dir_);\n  if (!remote_window_) {\n    \/\/ Make sure we will be the one and only process creating the window.\n    \/\/ We use a named Mutex since we are protecting against multi-process\n    \/\/ access. As documented, it's clearer to NOT request ownership on creation\n    \/\/ since it isn't guaranteed we will get it. It is better to create it\n    \/\/ without ownership and explicitly get the ownership afterward.\n    base::win::ScopedHandle only_me(::CreateMutex(NULL, FALSE, kMutexName));\n    if (!only_me.IsValid()) {\n      DPLOG(FATAL) << \"CreateMutex failed\";\n      return false;\n    }\n\n    AutoLockMutex auto_lock_only_me(only_me.Get());\n\n    \/\/ We now own the mutex so we are the only process that can create the\n    \/\/ window at this time, but we must still check if someone created it\n    \/\/ between the time where we looked for it above and the time the mutex\n    \/\/ was given to us.\n    remote_window_ = chrome::FindRunningChromeWindow(user_data_dir_);\n    if (!remote_window_) {\n      \/\/ We have to make sure there is no Chrome instance running on another\n      \/\/ machine that uses the same profile.\n      base::FilePath lock_file_path = user_data_dir_.AppendASCII(kLockfile);\n      lock_file_ = ::CreateFile(lock_file_path.value().c_str(),\n                                GENERIC_WRITE,\n                                FILE_SHARE_READ,\n                                NULL,\n                                CREATE_ALWAYS,\n                                FILE_ATTRIBUTE_NORMAL |\n                                FILE_FLAG_DELETE_ON_CLOSE,\n                                NULL);\n      DWORD error = ::GetLastError();\n      LOG_IF(WARNING, lock_file_ != INVALID_HANDLE_VALUE &&\n          error == ERROR_ALREADY_EXISTS) << \"Lock file exists but is writable.\";\n      LOG_IF(ERROR, lock_file_ == INVALID_HANDLE_VALUE)\n          << \"Lock file can not be created! Error code: \" << error;\n\n      if (lock_file_ != INVALID_HANDLE_VALUE) {\n        \/\/ Set the window's title to the path of our user data directory so\n        \/\/ other Chrome instances can decide if they should forward to us.\n        bool result = window_.CreateNamed(\n            base::Bind(&ProcessLaunchNotification, notification_callback_),\n            user_data_dir_.value());\n\n        \/\/ NB: Ensure that if the primary app gets started as elevated\n        \/\/ admin inadvertently, secondary windows running not as elevated\n        \/\/ will still be able to send messages\n        ::ChangeWindowMessageFilterEx(window_.hwnd(), WM_COPYDATA, MSGFLT_ALLOW, NULL);\n        CHECK(result && window_.hwnd());\n      }\n    }\n  }\n\n  return window_.hwnd() != NULL;\n}\n\nvoid ProcessSingleton::Cleanup() {\n}\n\nvoid ProcessSingleton::OverrideShouldKillRemoteProcessCallbackForTesting(\n    const ShouldKillRemoteProcessCallback& display_dialog_callback) {\n  should_kill_remote_process_callback_ = display_dialog_callback;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * AbstractView_EventConsumption.cpp\n *\n * Copyright (C) 2020 by Universitaet Stuttgart (VIS).\n * Alle Rechte vorbehalten.\n *\/\n\n#include \"mmcore\/view\/AbstractView_EventConsumption.h\"\n\n#include \"Framebuffer_Events.h\"\n#include \"KeyboardMouse_Events.h\"\n#include \"Window_Events.h\"\n#include \"IOpenGL_Context.h\"\n\n#include <chrono>\n\nnamespace megamol {\nnamespace core {\nnamespace view {\n\nusing namespace megamol::module_resources;\n\n\/\/ shorthand notation to unpack a ModuleResource to some type. \n\/\/ if the type is present in the resource is made available as an 'events' variable in the if statemtnt.\n\/\/ note that when using this macro there is no visible opening bracket { for the if statements because it is hidden inside the macro\n#define GET_RESOURCE(TYPENAME) \\\n    { \\\n\t\tTYPENAME const& events = resource.getResource<TYPENAME>();\n\n\nvoid view_consume_keyboard_events(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    GET_RESOURCE(KeyboardEvents)\/\/{\n\t\tfor (auto& e : events.key_events)\n\t\t\tview.OnKey(std::get<0>(e), std::get<1>(e), std::get<2>(e));\n\n\t\tfor (auto& e : events.codepoint_events)\n\t\t\tview.OnChar(e);\n\t}\n}\n\nvoid view_consume_mouse_events(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    GET_RESOURCE(MouseEvents)\/\/{\n\t\tfor (auto& e : events.buttons_events) \n\t\t\tview.OnMouseButton(std::get<0>(e), std::get<1>(e), std::get<2>(e));\n\n\t\tfor (auto& e : events.position_events)\n\t\t\tview.OnMouseMove(std::get<0>(e), std::get<1>(e));\n\n\t\tfor (auto& e : events.scroll_events)\n\t\t\tview.OnMouseScroll(std::get<0>(e), std::get<1>(e));\n\n\t\t\/\/for (auto& e: events.enter_events) {}\n\t}\n}\n\nvoid view_consume_window_events(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    GET_RESOURCE(WindowEvents)\/\/{\n\t\tevents.is_focused_events;\n\t}\n}\n\nvoid view_consume_framebuffer_events(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    GET_RESOURCE(FramebufferEvents)\/\/{\n        \/\/\/ XXX Permanent resize might be required for new views getting right size without new framebuffer event\n        view.Resize(static_cast<unsigned int>(events.previous_state.width), static_cast<unsigned int>(events.previous_state.height));\n\t\t\/\/for (auto& e: events.size_events)\n\t\t\/\/\tview.Resize(static_cast<unsigned int>(e.width), static_cast<unsigned int>(e.height));\n    }\n}\n\n\/\/ this is a weird place to measure passed program time, but we do it here so we satisfy _mmcRenderViewContext and nobody else needs to know\nstatic std::chrono::high_resolution_clock::time_point render_view_context_timer_start;\n\nvoid view_poke_rendering(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    megamol::module_resources::IOpenGL_Context const * maybe_opengl = nullptr;\n\n    if (resource.getIdentifier() == \"IOpenGL_Context\")\n\t\tmaybe_opengl = &resource.getResource<megamol::module_resources::IOpenGL_Context>();\n\t\n\tstatic bool started_timer = false;\n\tif (!started_timer) {\n\t\trender_view_context_timer_start = std::chrono::high_resolution_clock::now();\n        started_timer = true;\n\t}\n\n\tconst auto render = [&]() {\n\t\t_mmcRenderViewContext dummyRenderViewContext = {}; \/\/ zero initialization. the struct is currently only used for time propagation.\n\n        const double time = std::chrono::duration_cast<std::chrono::milliseconds>(\n            std::chrono::high_resolution_clock::now() - render_view_context_timer_start)\n            .count() \/ static_cast<double>(1000);\n\n        dummyRenderViewContext.InstanceTime = time;\n        dummyRenderViewContext.Time = time;\n\n\t\tview.Render(dummyRenderViewContext);\n\t};\n\n    if (maybe_opengl) {\n\t\tmaybe_opengl->activate(); \/\/ makes GL context current\n\n\t\trender();\n\n\t\tmaybe_opengl->close();\n\t} else {\n\t\trender();\n\t}\n}\n\nstd::vector<std::string> get_gl_view_runtime_resources_requests() {\n    return {\"KeyboardEvents\", \"MouseEvents\", \"WindowEvents\", \"FramebufferEvents\", \"IOpenGL_Context\"};\n}\n\nbool view_rendering_execution(megamol::core::Module::ptr_type module_ptr, std::vector<megamol::frontend::ModuleResource> const& resources) {\n\tmegamol::core::view::AbstractView* view_ptr =\n\t\tdynamic_cast<megamol::core::view::AbstractView*>(module_ptr.get());\n\t\n\tif (!view_ptr) {\n\t\tstd::cout << \"error. module is not a view module. could not set as graph rendering entry point.\" << std::endl;\n\t\treturn false;\n\t}\n\t\n\tmegamol::core::view::AbstractView& view = *view_ptr;\n\t\n\t\/\/ resources are in order of initial requests from get_gl_view_runtime_resources_requests()\n\tmegamol::core::view::view_consume_keyboard_events(view, resources[0]);\n\tmegamol::core::view::view_consume_mouse_events(view, resources[1]);\n\tmegamol::core::view::view_consume_window_events(view, resources[2]);\n\tmegamol::core::view::view_consume_framebuffer_events(view, resources[3]);\n\tmegamol::core::view::view_poke_rendering(view, resources[4]);\n\t\n\treturn true;\n}\n\n} \/* end namespace view *\/\n} \/* end namespace core *\/\n} \/* end namespace megamol *\/\n\n<commit_msg>I think we have partial time<commit_after>\/*\n * AbstractView_EventConsumption.cpp\n *\n * Copyright (C) 2020 by Universitaet Stuttgart (VIS).\n * Alle Rechte vorbehalten.\n *\/\n\n#include \"mmcore\/view\/AbstractView_EventConsumption.h\"\n\n#include \"Framebuffer_Events.h\"\n#include \"KeyboardMouse_Events.h\"\n#include \"Window_Events.h\"\n#include \"IOpenGL_Context.h\"\n\n#include <chrono>\n\nnamespace megamol {\nnamespace core {\nnamespace view {\n\nusing namespace megamol::module_resources;\n\n\/\/ shorthand notation to unpack a ModuleResource to some type. \n\/\/ if the type is present in the resource is made available as an 'events' variable in the if statemtnt.\n\/\/ note that when using this macro there is no visible opening bracket { for the if statements because it is hidden inside the macro\n#define GET_RESOURCE(TYPENAME) \\\n    { \\\n\t\tTYPENAME const& events = resource.getResource<TYPENAME>();\n\n\nvoid view_consume_keyboard_events(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    GET_RESOURCE(KeyboardEvents)\/\/{\n\t\tfor (auto& e : events.key_events)\n\t\t\tview.OnKey(std::get<0>(e), std::get<1>(e), std::get<2>(e));\n\n\t\tfor (auto& e : events.codepoint_events)\n\t\t\tview.OnChar(e);\n\t}\n}\n\nvoid view_consume_mouse_events(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    GET_RESOURCE(MouseEvents)\/\/{\n\t\tfor (auto& e : events.buttons_events) \n\t\t\tview.OnMouseButton(std::get<0>(e), std::get<1>(e), std::get<2>(e));\n\n\t\tfor (auto& e : events.position_events)\n\t\t\tview.OnMouseMove(std::get<0>(e), std::get<1>(e));\n\n\t\tfor (auto& e : events.scroll_events)\n\t\t\tview.OnMouseScroll(std::get<0>(e), std::get<1>(e));\n\n\t\t\/\/for (auto& e: events.enter_events) {}\n\t}\n}\n\nvoid view_consume_window_events(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    GET_RESOURCE(WindowEvents)\/\/{\n\t\tevents.is_focused_events;\n\t}\n}\n\nvoid view_consume_framebuffer_events(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    GET_RESOURCE(FramebufferEvents)\/\/{\n        \/\/\/ XXX Permanent resize might be required for new views getting right size without new framebuffer event\n        view.Resize(static_cast<unsigned int>(events.previous_state.width), static_cast<unsigned int>(events.previous_state.height));\n\t\t\/\/for (auto& e: events.size_events)\n\t\t\/\/\tview.Resize(static_cast<unsigned int>(e.width), static_cast<unsigned int>(e.height));\n    }\n}\n\n\/\/ this is a weird place to measure passed program time, but we do it here so we satisfy _mmcRenderViewContext and nobody else needs to know\nstatic std::chrono::high_resolution_clock::time_point render_view_context_timer_start;\n\nvoid view_poke_rendering(AbstractView& view, megamol::frontend::ModuleResource const& resource) {\n    megamol::module_resources::IOpenGL_Context const * maybe_opengl = nullptr;\n\n    if (resource.getIdentifier() == \"IOpenGL_Context\")\n\t\tmaybe_opengl = &resource.getResource<megamol::module_resources::IOpenGL_Context>();\n\t\n\tstatic bool started_timer = false;\n\tif (!started_timer) {\n\t\trender_view_context_timer_start = std::chrono::high_resolution_clock::now();\n        started_timer = true;\n\t}\n\n\tconst auto render = [&]() {\n\t\t_mmcRenderViewContext dummyRenderViewContext = {}; \/\/ zero initialization. the struct is currently only used for time propagation.\n\n        const double time = std::chrono::duration_cast<std::chrono::milliseconds>(\n            std::chrono::high_resolution_clock::now() - render_view_context_timer_start)\n            .count() \/ static_cast<double>(1000);\n\n            \/\/ this is missing!\n            \/\/ auto core = view->View()->GetCoreInstance();\n            \/\/ core->SetFrameID(frameID);\n            dummyRenderViewContext.InstanceTime = time;\n            dummyRenderViewContext.Time = view.DefaultTime(time);\n\n\t\tview.Render(dummyRenderViewContext);\n\t};\n\n    if (maybe_opengl) {\n\t\tmaybe_opengl->activate(); \/\/ makes GL context current\n\n\t\trender();\n\n\t\tmaybe_opengl->close();\n\t} else {\n\t\trender();\n\t}\n}\n\nstd::vector<std::string> get_gl_view_runtime_resources_requests() {\n    return {\"KeyboardEvents\", \"MouseEvents\", \"WindowEvents\", \"FramebufferEvents\", \"IOpenGL_Context\"};\n}\n\nbool view_rendering_execution(megamol::core::Module::ptr_type module_ptr, std::vector<megamol::frontend::ModuleResource> const& resources) {\n\tmegamol::core::view::AbstractView* view_ptr =\n\t\tdynamic_cast<megamol::core::view::AbstractView*>(module_ptr.get());\n\t\n\tif (!view_ptr) {\n\t\tstd::cout << \"error. module is not a view module. could not set as graph rendering entry point.\" << std::endl;\n\t\treturn false;\n\t}\n\t\n\tmegamol::core::view::AbstractView& view = *view_ptr;\n\t\n\t\/\/ resources are in order of initial requests from get_gl_view_runtime_resources_requests()\n\tmegamol::core::view::view_consume_keyboard_events(view, resources[0]);\n\tmegamol::core::view::view_consume_mouse_events(view, resources[1]);\n\tmegamol::core::view::view_consume_window_events(view, resources[2]);\n\tmegamol::core::view::view_consume_framebuffer_events(view, resources[3]);\n\tmegamol::core::view::view_poke_rendering(view, resources[4]);\n\t\n\treturn true;\n}\n\n} \/* end namespace view *\/\n} \/* end namespace core *\/\n} \/* end namespace megamol *\/\n\n<|endoftext|>"}
{"text":"<commit_before>void Config()\n{\n  \/\/\n  \/\/ Set Random Number seed\n  gRandom->SetSeed(12345);\n  \n  \/\/ ThetaRange is (0., 180.). It was (0.28,179.72) 7\/12\/00 09:00\n  new AliGeant3(\"C++ Interface to Geant3\");\n\n  \/\/=======================================================================\n  \/\/  Create the output file\n   \n  TFile *rootfile = new TFile(\"galice.root\",\"recreate\");\n  rootfile->SetCompressionLevel(2);\n  TGeant3 *geant3 = (TGeant3*)gMC;\n\n  \/\/\n  \/\/ Set External decayer\n  AliDecayer* decayer = new AliDecayerPythia();\n  decayer->SetForceDecay(kAll);\n  decayer->Init();\n  gMC->SetExternalDecayer(decayer);\n\n  \/\/\n  \/\/\n  \/\/=======================================================================\n  \/\/ ******* GEANT STEERING parameters FOR ALICE SIMULATION *******\n  geant3->SetTRIG(1); \/\/Number of events to be processed \n  geant3->SetSWIT(4,10);\n  geant3->SetDEBU(0,0,1);\n  \/\/geant3->SetSWIT(2,2);\n  geant3->SetDCAY(1);\n  geant3->SetPAIR(1);\n  geant3->SetCOMP(1);\n  geant3->SetPHOT(1);\n  geant3->SetPFIS(0);\n  geant3->SetDRAY(0);\n  geant3->SetANNI(1);\n  geant3->SetBREM(1);\n  geant3->SetMUNU(1);\n  geant3->SetCKOV(1);\n  geant3->SetHADR(1); \/\/Select pure GEANH (HADR 1) or GEANH\/NUCRIN (HADR 3)\n  geant3->SetLOSS(2);\n  geant3->SetMULS(1);\n  geant3->SetRAYL(1);\n  geant3->SetAUTO(1); \/\/Select automatic STMIN etc... calc. (AUTO 1) or manual (AUTO 0)\n  geant3->SetABAN(0); \/\/Restore 3.16 behaviour for abandoned tracks\n  geant3->SetOPTI(2); \/\/Select optimisation level for GEANT geometry searches (0,1,2)\n  geant3->SetERAN(5.e-7);\n\n  Float_t cut    = 1.e-3; \/\/ 1MeV cut by default\n  Float_t tofmax = 1.e10;\n  \/\/             GAM ELEC NHAD CHAD MUON EBREM MUHAB EDEL MUDEL MUPA TOFMAX\n  geant3->SetCUTS(cut,cut, cut, cut, cut, cut,  cut,  cut, cut,  cut, tofmax);\n  \/\/\n  \/\/=======================================================================\n  \/\/ ************* STEERING parameters FOR ALICE SIMULATION **************\n  \/\/ --- Specify event type to be tracked through the ALICE setup\n  \/\/ --- All positions are in cm, angles in degrees, and P and E in GeV\n  AliGenHIJINGpara *gener = new AliGenHIJINGpara(84210);\n  gener->SetMomentumRange(0,999);\n  gener->SetPhiRange(0,360);\n  \/\/  gener->SetThetaRange(0.28,179.72);\n  gener->SetThetaRange(0.,180.);\n  gener->SetOrigin(0,0,0);        \/\/vertex position\n  gener->SetSigma(0,0,0);         \/\/Sigma in (X,Y,Z) (cm) on IP position\n  gener->Init();\n  \/\/ \n  \/\/ Activate this line if you want the vertex smearing to happen\n  \/\/ track by track\n  \/\/\n  \/\/gener->SetVertexSmear(perTrack); \n\n  gAlice->SetField(-999,2);    \/\/Specify maximum magnetic field in Tesla (neg. ==> default field)\n\n  Int_t iABSO=1;\n  Int_t iCASTOR=1;\n  Int_t iDIPO=1;\n  Int_t iFMD=1;\n  Int_t iFRAME=1;\n  Int_t iHALL=1;\n  Int_t iITS=1;\n  Int_t iMAG=1;\n  Int_t iMUON=1;\n  Int_t iPHOS=1;\n  Int_t iPIPE=1;\n  Int_t iPMD=1;\n  Int_t iRICH=1;\n  Int_t iSHIL=1;\n  Int_t iSTART=1;\n  Int_t iTOF=1;\n  Int_t iTPC=1;\n  Int_t iTRD=1;\n  Int_t iZDC=1;\n\n  \/\/=================== Alice BODY parameters =============================\n  AliBODY *BODY = new AliBODY(\"BODY\",\"Alice envelop\");\n\n  if(iMAG) {\n    \/\/=================== MAG parameters ============================\n    \/\/ --- Start with Magnet since detector layouts may be depending ---\n    \/\/ --- on the selected Magnet dimensions ---\n    AliMAG *MAG  = new AliMAG(\"MAG\",\"Magnet\");\n  }\n\n\n  if(iABSO) {\n    \/\/=================== ABSO parameters ============================\n    AliABSO *ABSO  = new AliABSOv0(\"ABSO\",\"Muon Absorber\");\n  }\n\n  if(iDIPO) {\n    \/\/=================== DIPO parameters ============================\n\n    AliDIPO *DIPO  = new AliDIPOv2(\"DIPO\",\"Dipole version 2\");\n  }\n\n  if(iHALL) {\n    \/\/=================== HALL parameters ============================\n\n    AliHALL *HALL  = new AliHALL(\"HALL\",\"Alice Hall\");\n  }\n\n\n  if(iFRAME) {\n    \/\/=================== FRAME parameters ============================\n\n    AliFRAME *FRAME  = new AliFRAMEv2(\"FRAME\",\"Space Frame\");\n\n  }\n\n  if(iSHIL) {\n    \/\/=================== SHIL parameters ============================\n\n    AliSHIL *SHIL  = new AliSHILv0(\"SHIL\",\"Shielding\");\n  }\n\n\n  if(iPIPE) {\n    \/\/=================== PIPE parameters ============================\n\n    AliPIPE *PIPE  = new AliPIPEv0(\"PIPE\",\"Beam Pipe\");\n  }\n\n\n  if(iITS) {\n\n\/\/=================== ITS parameters ============================\n    \/\/\n    \/\/ As the innermost detector in ALICE, the Inner Tracking System \"impacts\" on\n    \/\/ almost all other detectors. This involves the fact that the ITS geometry\n    \/\/ still has several options to be followed in parallel in order to determine\n    \/\/ the best set-up which minimizes the induced background. All the geometries\n    \/\/ available to date are described in the following. Read carefully the comments\n    \/\/ and use the default version (the only one uncommented) unless you are making\n    \/\/ comparisons and you know what you are doing. In this case just uncomment the\n    \/\/ ITS geometry you want to use and run Aliroot.\n    \/\/\n    \/\/ Detailed geometries:         \n    \/\/\n    \/\/\n    \/\/AliITS *ITS  = new AliITSv5symm(\"ITS\",\"Updated ITS TDR detailed version with symmetric services\");\n    \/\/\n    \/\/AliITS *ITS  = new AliITSv5asymm(\"ITS\",\"Updates ITS TDR detailed version with asymmetric services\");\n    \/\/\n    AliITSvPPRasymm *ITS  = new AliITSvPPRasymm(\"ITS\",\"New ITS PPR detailed version with asymmetric services\");\n    ITS->SetMinorVersion(2);                                         \/\/ don't touch this parameter if you're not an ITS developer\n    ITS->SetReadDet(kFALSE);                                         \/\/ don't touch this parameter if you're not an ITS developer\n    ITS->SetWriteDet(\"$ALICE_ROOT\/ITS\/ITSgeometry_vPPRasymm2.det\");  \/\/ don't touch this parameter if you're not an ITS developer\n    ITS->SetThicknessDet1(300.);   \/\/ detector thickness on layer 1 must be in the range [100,300]\n    ITS->SetThicknessDet2(300.);   \/\/ detector thickness on layer 2 must be in the range [100,300]\n    ITS->SetThicknessChip1(300.);  \/\/ chip thickness on layer 1 must be in the range [150,300]\n    ITS->SetThicknessChip2(300.);  \/\/ chip thickness on layer 2 must be in the range [150,300]\n    ITS->SetRails(1);\t           \/\/ 1 --> rails in ; 0 --> rails out\n    ITS->SetCoolingFluid(1);       \/\/ 1 --> water ; 0 --> freon\n    \/\/\n    \/\/AliITSvPPRsymm *ITS  = new AliITSvPPRsymm(\"ITS\",\"New ITS PPR detailed version with symmetric services\");\n    \/\/ITS->SetMinorVersion(2);                                       \/\/ don't touch this parameter if you're not an ITS developer\n    \/\/ITS->SetReadDet(kFALSE);                                       \/\/ don't touch this parameter if you're not an ITS developer\n    \/\/ITS->SetWriteDet(\"$ALICE_ROOT\/ITS\/ITSgeometry_vPPRsymm2.det\"); \/\/ don't touch this parameter if you're not an ITS developer\n    \/\/ITS->SetThicknessDet1(300.);   \/\/ detector thickness on layer 1 must be in the range [100,300]\n    \/\/ITS->SetThicknessDet2(300.);   \/\/ detector thickness on layer 2 must be in the range [100,300]\n    \/\/ITS->SetThicknessChip1(300.);  \/\/ chip thickness on layer 1 must be in the range [150,300]\n    \/\/ITS->SetThicknessChip2(300.);  \/\/ chip thickness on layer 2 must be in the range [150,300]\n    \/\/ITS->SetRails(1);              \/\/ 1 --> rails in ; 0 --> rails out\n    \/\/ITS->SetCoolingFluid(1);       \/\/ 1 --> water ; 0 --> freon\n    \/\/\n    \/\/\n    \/\/ Coarse geometries (warning: no hits are produced with these coarse geometries and they unuseful \n    \/\/ for reconstruction !):\n    \/\/                                                     \n    \/\/\n    \/\/AliITSvPPRcoarseasymm *ITS  = new AliITSvPPRcoarseasymm(\"ITS\",\"New ITS PPR coarse version with asymmetric services\");\n    \/\/ITS->SetRails(1);                \/\/ 1 --> rails in ; 0 --> rails out\n    \/\/ITS->SetSupportMaterial(0);      \/\/ 0 --> Copper ; 1 --> Aluminum ; 2 --> Carbon\n    \/\/\n    \/\/AliITS *ITS  = new AliITSvPPRcoarsesymm(\"ITS\",\"New ITS PPR coarse version with symmetric services\");\n    \/\/ITS->SetRails(1);                \/\/ 1 --> rails in ; 0 --> rails out\n    \/\/ITS->SetSupportMaterial(0);      \/\/ 0 --> Copper ; 1 --> Aluminum ; 2 --> Carbon\n    \/\/                      \n    \/\/\n    \/\/\n    \/\/ Geant3 <-> EUCLID conversion\n    \/\/ ============================\n    \/\/\n    \/\/ SetEUCLID is a flag to output (=1) or not to output (=0) both geometry and\n    \/\/ media to two ASCII files (called by default ITSgeometry.euc and\n    \/\/ ITSgeometry.tme) in a format understandable to the CAD system EUCLID.\n    \/\/ The default (=0) means that you dont want to use this facility.\n    \/\/\n    ITS->SetEUCLID(0);  \n  }\n  \n\n  if(iTPC) {\n    \/\/============================ TPC parameters ================================\n    \/\/ --- This allows the user to specify sectors for the SLOW (TPC geometry 2)\n    \/\/ --- Simulator. SecAL (SecAU) <0 means that ALL lower (upper)\n    \/\/ --- sectors are specified, any value other than that requires at least one \n    \/\/ --- sector (lower or upper)to be specified!\n    \/\/ --- Reminder: sectors 1-24 are lower sectors (1-12 -> z>0, 13-24 -> z<0)\n    \/\/ ---           sectors 25-72 are the upper ones (25-48 -> z>0, 49-72 -> z<0)\n    \/\/ --- SecLows - number of lower sectors specified (up to 6)\n    \/\/ --- SecUps - number of upper sectors specified (up to 12)\n    \/\/ --- Sens - sensitive strips for the Slow Simulator !!!\n    \/\/ --- This does NOT work if all S or L-sectors are specified, i.e.\n    \/\/ --- if SecAL or SecAU < 0\n    \/\/\n    \/\/\n    \/\/-----------------------------------------------------------------------------\n\n    \/\/  gROOT->LoadMacro(\"SetTPCParam.C\");\n    \/\/  AliTPCParam *param = SetTPCParam();\n    AliTPC *TPC  = new AliTPCv2(\"TPC\",\"Default\");\n    \/\/ All sectors included \n    TPC->SetSecAL(-1);\n    TPC->SetSecAU(-1);\n\n  }\n\n\n  if(iTOF) {\n    \/\/=================== TOF parameters ============================\n    AliTOF *TOF  = new AliTOFv2(\"TOF\",\"normal TOF\");\n  }\n\n  if(iRICH) {\n    \/\/=================== RICH parameters ===========================\n    AliRICH *RICH  = new AliRICHv1(\"RICH\",\"normal RICH\");    \n\n  }\n\n\n  if(iZDC) {\n    \/\/=================== ZDC parameters ============================\n\n    AliZDC *ZDC  = new AliZDCv1(\"ZDC\",\"normal ZDC\");\n  }\n\n  if(iCASTOR) {\n    \/\/=================== CASTOR parameters ============================\n\n    AliCASTOR *CASTOR  = new AliCASTORv1(\"CASTOR\",\"normal CASTOR\");\n  }\n\n  if(iTRD) {\n    \/\/=================== TRD parameters ============================\n  \n    AliTRD *TRD  = new AliTRDv1(\"TRD\",\"TRD slow simulator\");\n  \n    \/\/ Select the gas mixture (0: 97% Xe + 3% isobutane, 1: 90% Xe + 10% CO2)\n    TRD->SetGasMix(1);\n  \n    \/\/ With hole in front of PHOS\n    TRD->SetPHOShole();\n    \/\/ With hole in front of RICH\n    TRD->SetRICHhole();\n    \/\/ Switch on TR\n    AliTRDsim *TRDsim = TRD->CreateTR();\n  }\n\n  if(iFMD) {\n    \/\/=================== FMD parameters ============================\n\n    AliFMD *FMD  = new AliFMDv0(\"FMD\",\"normal FMD\");\n  }\n\n  if(iMUON) {\n    \/\/=================== MUON parameters ===========================\n    AliMUON *MUON  = new AliMUONv1(\"MUON\",\"default\");\n  }\n \n  \/\/=================== PHOS parameters ===========================\n\n  if(iPHOS) {\n    AliPHOS *PHOS  = new AliPHOSv1(\"PHOS\",\"GPS2\");\n  }\n\n\n  if(iPMD) {\n    \/\/=================== PMD parameters ============================\n\n    AliPMD *PMD  = new AliPMDv1(\"PMD\",\"normal PMD\");\n    PMD->SetPAR(1., 1., 0.8, 0.02);\n    PMD->SetIN(6., 18., -580., 27., 27.);\n    PMD->SetGEO(0.0, 0.2, 4.);\n    PMD->SetPadSize(0.8, 1.0, 1.0, 1.5);\n\n  }\n\n  if(iSTART) {\n    \/\/=================== START parameters ============================\n    AliSTART *START  = new AliSTARTv1(\"START\",\"START Detector\");\n  }\n\n         \n}\n<commit_msg>ConfigPPR.C removed to avoid confusions with Config.C. Config.C contains all the information for PPR<commit_after><|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n#include <fmt\/ostream.h>\n#include <vector>\n#include <sstream>\n\n#include <xl\/templates.h>\n#include <xl\/library_extensions.h>\nusing xl::templates::ProviderPtr;\n\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wshadow\"\n#include \"clang\/AST\/DeclCXX.h\"\n#pragma clang diagnostic pop\n\n\n#include \"..\/wrapped_class.h\"\n#include \"..\/parsed_method.h\"\n#include \"bidirectional_output.h\"\n#include \"..\/helper_functions.h\"\n\n\/\/MAY BE OTHER ISSUES WITH CONSTRUCTOR PARAMETERS\n\n\nnamespace v8toolkit::class_parser::bidirectional_output {\n\nusing namespace xl::templates;\n\nextern xl::templates::Template class_template;\nextern std::map<string, xl::templates::Template> bidirectional_templates;\n\n\nbool BidirectionalCriteria::operator()(WrappedClass const & c) {\n    if (!c.bidirectional) {\n        log.info(LogSubjects::Subjects::BidirectionalOutput,\n                 \"BidirectionalCriteria: skipping {} because not bidirectional\", c.class_name);\n        return false;\n    }\n\n    if (c.base_types.size() != 1) {\n        log.error(LogSubjects::Subjects::BidirectionalOutput,\n                  \"BidirectionalCriteria: bidirectional class {} must have 1 base type but actually has {} - {}\",\n                  c.get_js_name(), c.base_types.size(), xl::join(c.base_types));\n        return false;\n    }\n\n    return true;\n}\n\n\nstd::ostream & BidirectionalOutputStreamProvider::get_class_collection_stream() {\n    return std::cerr;\n}\n\nostream & BidirectionalOutputStreamProvider::get_class_stream(WrappedClass const & c) {\n    this->output_file.close();\n    if (auto results = xl::RegexPcre(\"^\\\"([^\\\"]+)\\\"$\").match(c.my_include)) {\n        this->output_file.open(results[1]);\n        return this->output_file;\n    } else {\n        llvm::report_fatal_error(\"bidirectional type my_include field not in expected format\");\n    }\n}\n\n\n\n\nstd::string generate_bidirectional_constructor_parameter_list(WrappedClass const & c) {\n    auto base_type = *c.base_types.begin();\n    ClassFunction bidirectional_constructor(*base_type, base_type->bidirectional_constructor);\n    int param_position = 1;\n    std::string result;\n    result.reserve(64);\n    for (auto & parameter : bidirectional_constructor.parameters) {\n        result += fmt::format(\", {} var{}\", parameter.type.get_name(), param_position++);\n    }\n    return result;\n}\n\n\n\nvector<string> generate_variable_names(vector<QualType> qual_types, bool with_std_move) {\n    vector<string> results;\n    for (std::size_t i = 0; i < qual_types.size(); i++) {\n        if (with_std_move && qual_types[i]->isRValueReferenceType()) {\n            results.push_back(fmt::format(\"std::move(var{})\", i + 1));\n        } else {\n            results.push_back(fmt::format(\"var{}\", i + 1));\n        }\n    }\n    return results;\n}\n\n\nvector<QualType> get_method_param_qual_types(const CXXMethodDecl * method,\n                                             string const & annotation = \"\") {\n    vector<QualType> results;\n    auto parameter_count = method->getNumParams();\n    for (unsigned int i = 0; i < parameter_count; i++) {\n        auto param_decl = method->getParamDecl(i);\n\n\n        Annotations annotations(param_decl);\n        if (annotation != \"\" && !annotations.has(annotation)) {\n            continue;\n        }\n        auto param_qual_type = param_decl->getType();\n        results.push_back(param_qual_type);\n    }\n    return results;\n}\n\n\n\nstruct BidirectionalProviderContainer {\n\n\n    static ProviderPtr get_provider(WrappedClass const & c) {\n\n        std::vector<MemberFunction const *> virtual_functions;\n        c.foreach_inheritance_level([&](auto & current) {\n            for(auto & f : current.get_member_functions()) {\n                std::cerr << fmt::format(\"in {}, {} is virtual override? {}\", current.class_name, f->name, f->is_virtual_override) << std::endl;\n                if (f->is_virtual && !f->is_virtual_override) {\n                    std::cerr << fmt::format(\"adding it\") << std::endl;\n                    virtual_functions.push_back(f.get());\n                }\n            }\n        });\n\n\/\/\n        log.info(LogSubjects::BidirectionalOutput, \"virtual function count for {}: {}\", c.get_js_name(), virtual_functions.size());\n\n        log.info(LogSubjects::BidirectionalOutput, \"includes for {}, {}\", c.get_js_name(), xl::join(c.include_files));\n\n\n        return xl::templates::make_provider<BidirectionalProviderContainer>(\n            std::pair(\"name\", c.get_js_name()),\n\/\/            std::pair(\"virtual_functions\", xl::erase_if(xl::copy(c.get_member_functions()), [](auto & e){return e.get()->is_virtual;})),\n            std::pair(\"virtual_functions\", virtual_functions),\n            std::pair(\"includes\", std::ref(c.include_files)),\n            std::pair(\"base_name\", (*c.base_types.begin())->class_name),\n            std::pair(\"constructor_parameters\", generate_bidirectional_constructor_parameter_list(c)),\n            std::pair(\"constructor_variables\",\n                      xl::join(generate_variable_names(get_method_param_qual_types((*c.base_types.begin())->bidirectional_constructor), true)))\n        );\n    }\n\n\n    static ProviderPtr get_provider(MemberFunction const & f) {\n        return xl::templates::make_provider<BidirectionalProviderContainer>(\n            std::pair(\"name\", f.get_short_name()),\n            std::pair(\"js_name\", f.js_name),\n            std::pair(\"comment\", f.comment),\n            std::pair(\"params\", f.parameters),\n            std::pair(\"return_type\", make_macro_safe_comma(f.return_type.get_name())),\n            std::pair(\"param_count\", std::to_string(f.parameters.size())),\n            std::pair(\"const\", f.is_const() ? \"_CONST\" : \"\")\n        );\n    }\n\n\n    static ProviderPtr get_provider(ClassFunction::ParameterInfo const & p) {\n        return xl::templates::make_provider<BidirectionalProviderContainer>(\n            std::pair(\"type\", make_macro_safe_comma(p.type.get_name())),\n            std::pair(\"name\", p.name)\n        );\n    }\n\n\n    static ProviderPtr get_provider(TypeInfo const & t) {\n        return xl::templates::make_provider<BidirectionalProviderContainer>(\"Implement me\");\n    }\n};\n\n\n\nvoid BidirectionalOutputModule::process(std::vector < WrappedClass const*> wrapped_classes)\n{\n\n    BidirectionalOutputStreamProvider stream_provider;\n\n    log.info(LogSubjects::Subjects::BidirectionalOutput, \"Starting Bidirectional output module\");\n\n\n    log.info(LogT::Subjects::BidirectionalOutput, \"Bidirectional wrapped classes count: {}\",\n             wrapped_classes.size());\n\n    for(auto c : wrapped_classes) {\n        log.info(LogT::Subjects::BidirectionalOutput, \"Creating bidirectional output for class: {}\",\n                 c->class_name);\n        auto & ostream = this->output_stream_provider->get_class_stream(*c);\n\n        ostream << bidirectional_templates[\"class\"].template fill<BidirectionalProviderContainer>(std::ref(*c), &bidirectional_templates);\n    }\n\n    log.info(LogSubjects::Subjects::BidirectionalOutput, \"Finished Bidirectional output module\");\n\n}\n\nstring BidirectionalOutputModule::get_name() {\n    return \"BidirectionalOutputModule\";\n}\n\nOutputCriteria & BidirectionalOutputModule::get_criteria() {\n    return this->criteria;\n}\n\n\n\n\n\n::xl::templates::Template bidirectional_class_template(R\"(#pragma once\n\n{{includes|!!\n#include {{include}}}}\n\nclass {{name}} : public {{base_name}}, public v8toolkit::JSWrapper<{{base_name}}> {\npublic:\n\n    {{name}}(v8::Local<v8::Context> context, v8::Local<v8::Object> object,\n        v8::Local<v8::FunctionTemplate> created_by{{constructor_parameters}}) :\n      {{base_name}}({{constructor_variables}}),\n      v8toolkit::JSWrapper<{{base_name}}>(context, object, created_by)\n    {}\n\n{{virtual_functions|!!\n    JS_ACCESS_{{param_count}}{{const}}({{return_type}}, {{<name}}, {{js_name}}{{params%%, |!{{type}}}});}}\n};)\");\n\n\nstd::map<string, Template> bidirectional_templates {\n    std::pair(\"class\", bidirectional_class_template),\n};\n\n\n\n} \/\/ end namespace v8toolkit::class_parser::bidirectional_output<commit_msg>fixed bug generating stub\/js template with duplicate virtuals when overridden in derived classes<commit_after>\n#include <iostream>\n#include <fmt\/ostream.h>\n#include <vector>\n#include <sstream>\n\n#include <xl\/templates.h>\n#include <xl\/library_extensions.h>\nusing xl::templates::ProviderPtr;\n\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wshadow\"\n#include \"clang\/AST\/DeclCXX.h\"\n#pragma clang diagnostic pop\n\n\n#include \"..\/wrapped_class.h\"\n#include \"..\/parsed_method.h\"\n#include \"bidirectional_output.h\"\n#include \"..\/helper_functions.h\"\n\n\/\/MAY BE OTHER ISSUES WITH CONSTRUCTOR PARAMETERS\n\n\nnamespace v8toolkit::class_parser::bidirectional_output {\n\nusing namespace xl::templates;\n\nextern xl::templates::Template class_template;\nextern std::map<string, xl::templates::Template> bidirectional_templates;\n\n\nbool BidirectionalCriteria::operator()(WrappedClass const & c) {\n    if (!c.bidirectional) {\n        log.info(LogSubjects::Subjects::BidirectionalOutput,\n                 \"BidirectionalCriteria: skipping {} because not bidirectional\", c.class_name);\n        return false;\n    }\n\n    if (c.base_types.size() != 1) {\n        log.error(LogSubjects::Subjects::BidirectionalOutput,\n                  \"BidirectionalCriteria: bidirectional class {} must have 1 base type but actually has {} - {}\",\n                  c.get_js_name(), c.base_types.size(), xl::join(c.base_types));\n        return false;\n    }\n\n    return true;\n}\n\n\nstd::ostream & BidirectionalOutputStreamProvider::get_class_collection_stream() {\n    return std::cerr;\n}\n\nostream & BidirectionalOutputStreamProvider::get_class_stream(WrappedClass const & c) {\n    this->output_file.close();\n    if (auto results = xl::RegexPcre(\"^\\\"([^\\\"]+)\\\"$\").match(c.my_include)) {\n        this->output_file.open(results[1]);\n        return this->output_file;\n    } else {\n        llvm::report_fatal_error(\"bidirectional type my_include field not in expected format\");\n    }\n}\n\n\n\n\nstd::string generate_bidirectional_constructor_parameter_list(WrappedClass const & c) {\n    auto base_type = *c.base_types.begin();\n    ClassFunction bidirectional_constructor(*base_type, base_type->bidirectional_constructor);\n    int param_position = 1;\n    std::string result;\n    result.reserve(64);\n    for (auto & parameter : bidirectional_constructor.parameters) {\n        result += fmt::format(\", {} var{}\", parameter.type.get_name(), param_position++);\n    }\n    return result;\n}\n\n\n\nvector<string> generate_variable_names(vector<QualType> qual_types, bool with_std_move) {\n    vector<string> results;\n    for (std::size_t i = 0; i < qual_types.size(); i++) {\n        if (with_std_move && qual_types[i]->isRValueReferenceType()) {\n            results.push_back(fmt::format(\"std::move(var{})\", i + 1));\n        } else {\n            results.push_back(fmt::format(\"var{}\", i + 1));\n        }\n    }\n    return results;\n}\n\n\nvector<QualType> get_method_param_qual_types(const CXXMethodDecl * method,\n                                             string const & annotation = \"\") {\n    vector<QualType> results;\n    auto parameter_count = method->getNumParams();\n    for (unsigned int i = 0; i < parameter_count; i++) {\n        auto param_decl = method->getParamDecl(i);\n\n\n        Annotations annotations(param_decl);\n        if (annotation != \"\" && !annotations.has(annotation)) {\n            continue;\n        }\n        auto param_qual_type = param_decl->getType();\n        results.push_back(param_qual_type);\n    }\n    return results;\n}\n\n\n\nstruct BidirectionalProviderContainer {\n\n\n    static ProviderPtr get_provider(WrappedClass const & c) {\n\n        std::vector<MemberFunction const *> virtual_functions;\n        c.foreach_inheritance_level([&](auto & current) {\n            for(auto & f : current.get_member_functions()) {\n                if (f->is_virtual && !f->is_virtual_override) {\n                    virtual_functions.push_back(f.get());\n                }\n            }\n        });\n\n\/\/\n        log.info(LogSubjects::BidirectionalOutput, \"virtual function count for {}: {}\", c.get_js_name(), virtual_functions.size());\n\n        log.info(LogSubjects::BidirectionalOutput, \"includes for {}, {}\", c.get_js_name(), xl::join(c.include_files));\n\n\n        return xl::templates::make_provider<BidirectionalProviderContainer>(\n            std::pair(\"name\", c.get_js_name()),\n\/\/            std::pair(\"virtual_functions\", xl::erase_if(xl::copy(c.get_member_functions()), [](auto & e){return e.get()->is_virtual;})),\n            std::pair(\"virtual_functions\", virtual_functions),\n            std::pair(\"includes\", std::ref(c.include_files)),\n            std::pair(\"base_name\", (*c.base_types.begin())->class_name),\n            std::pair(\"constructor_parameters\", generate_bidirectional_constructor_parameter_list(c)),\n            std::pair(\"constructor_variables\",\n                      xl::join(generate_variable_names(get_method_param_qual_types((*c.base_types.begin())->bidirectional_constructor), true)))\n        );\n    }\n\n\n    static ProviderPtr get_provider(MemberFunction const & f) {\n        return xl::templates::make_provider<BidirectionalProviderContainer>(\n            std::pair(\"name\", f.get_short_name()),\n            std::pair(\"js_name\", f.js_name),\n            std::pair(\"comment\", f.comment),\n            std::pair(\"params\", f.parameters),\n            std::pair(\"return_type\", make_macro_safe_comma(f.return_type.get_name())),\n            std::pair(\"param_count\", std::to_string(f.parameters.size())),\n            std::pair(\"const\", f.is_const() ? \"_CONST\" : \"\")\n        );\n    }\n\n\n    static ProviderPtr get_provider(ClassFunction::ParameterInfo const & p) {\n        return xl::templates::make_provider<BidirectionalProviderContainer>(\n            std::pair(\"type\", make_macro_safe_comma(p.type.get_name())),\n            std::pair(\"name\", p.name)\n        );\n    }\n\n\n    static ProviderPtr get_provider(TypeInfo const & t) {\n        return xl::templates::make_provider<BidirectionalProviderContainer>(\"Implement me\");\n    }\n};\n\n\n\nvoid BidirectionalOutputModule::process(std::vector < WrappedClass const*> wrapped_classes)\n{\n\n    BidirectionalOutputStreamProvider stream_provider;\n\n    log.info(LogSubjects::Subjects::BidirectionalOutput, \"Starting Bidirectional output module\");\n\n\n    log.info(LogT::Subjects::BidirectionalOutput, \"Bidirectional wrapped classes count: {}\",\n             wrapped_classes.size());\n\n    for(auto c : wrapped_classes) {\n        log.info(LogT::Subjects::BidirectionalOutput, \"Creating bidirectional output for class: {}\",\n                 c->class_name);\n        auto & ostream = this->output_stream_provider->get_class_stream(*c);\n\n        ostream << bidirectional_templates[\"class\"].template fill<BidirectionalProviderContainer>(std::ref(*c), &bidirectional_templates);\n    }\n\n    log.info(LogSubjects::Subjects::BidirectionalOutput, \"Finished Bidirectional output module\");\n\n}\n\nstring BidirectionalOutputModule::get_name() {\n    return \"BidirectionalOutputModule\";\n}\n\nOutputCriteria & BidirectionalOutputModule::get_criteria() {\n    return this->criteria;\n}\n\n\n\n\n\n::xl::templates::Template bidirectional_class_template(R\"(#pragma once\n\n{{includes|!!\n#include {{include}}}}\n\nclass {{name}} : public {{base_name}}, public v8toolkit::JSWrapper<{{base_name}}> {\npublic:\n\n    {{name}}(v8::Local<v8::Context> context, v8::Local<v8::Object> object,\n        v8::Local<v8::FunctionTemplate> created_by{{constructor_parameters}}) :\n      {{base_name}}({{constructor_variables}}),\n      v8toolkit::JSWrapper<{{base_name}}>(context, object, created_by)\n    {}\n\n{{virtual_functions|!!\n    JS_ACCESS_{{param_count}}{{const}}({{return_type}}, {{<name}}, {{js_name}}{{params%%, |!{{type}}}});}}\n};)\");\n\n\nstd::map<string, Template> bidirectional_templates {\n    std::pair(\"class\", bidirectional_class_template),\n};\n\n\n\n} \/\/ end namespace v8toolkit::class_parser::bidirectional_output<|endoftext|>"}
{"text":"<commit_before>\/*\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., 51 Franklin Street, Fifth Floor,\n   Boston, MA 02110-1301, USA.\n*\/\n\n#include \"propertywidgetcontainer.h\"\n#include \"propertywidgetitem.h\"\n#include \"core\/gluonobject.h\"\n\n#include <QtGui\/QGridLayout>\n#include <QtGui\/QBoxLayout>\n#include <QtGui\/QToolButton>\n#include <QtGui\/QCheckBox>\n#include <QtGui\/QLabel>\n#include <QtGui\/QMenu>\n#include <QtCore\/QHash>\n#include <QtCore\/QMetaProperty>\n#include <QtCore\/QStringBuilder>\n#include <KIcon>\n\nnamespace GluonCreator {\nclass PropertyWidgetContainer::PropertyWidgetContainerPrivate\n{\n    public:\n        PropertyWidgetContainerPrivate(PropertyWidgetContainer* parent)\n            : expanded(true)\n            , enabled(true)\n            , containerWidget(0)\n            , containerLayout(0)\n            , expander(0)\n            , enabler(0)\n            , menuButton(0)\n        {\n            this->parent = parent;\n            menu = new QMenu(parent);\n            \n            \/\/ The widget used for the heading\n            QFrame* titleWidget = new QFrame(parent);\n            titleWidget->setFrameShape(QFrame::StyledPanel);\n            titleWidget->setFrameShadow(QFrame::Raised);\n            parent->layout()->addWidget(titleWidget);\n            \n            QHBoxLayout* titleLayout = new QHBoxLayout();\n            titleLayout->setSpacing(0);\n            titleLayout->setContentsMargins(0, 0, 0, 0);\n            titleWidget->setLayout(titleLayout);\n            \n            expander = new QToolButton(titleWidget);\n            expander->setAutoRaise(true);\n            expander->setArrowType(Qt::DownArrow);\n            connect(expander, SIGNAL(clicked(bool)), parent, SLOT(toggleExpanded()));\n            titleLayout->addWidget(expander);\n            \n            enabler = new QCheckBox(titleWidget);\n            enabler->setText(title);\n            enabler->setChecked(enabled);\n            connect(enabler, SIGNAL(toggled(bool)), parent, SLOT(setEnabled(bool)));\n            titleLayout->addWidget(enabler);\n            \n            menuButton = new QToolButton(titleWidget);\n            menuButton->setIcon(KIcon(\"preferences-other\"));\n            menuButton->setAutoRaise(true);\n            menuButton->setPopupMode(QToolButton::InstantPopup);\n            menuButton->setMenu(menu);\n            titleLayout->addWidget(menuButton);\n            \n            \/\/ The widget used for containing the children\n            containerWidget = new QWidget(parent);\n            containerLayout = new QGridLayout();\n            containerLayout->setSpacing(0);\n            containerLayout->setContentsMargins(0, 0, 0, 0);\n            containerWidget->setLayout(containerLayout);\n            parent->layout()->addWidget(containerWidget);\n        }\n        ~PropertyWidgetContainerPrivate()\n        {\n        }\n        \n        QString humanifyString(QString fixThis);\n        \n        PropertyWidgetContainer* parent;\n        GluonCore::GluonObject* object;\n        void appendMetaObject(QObject* object);\n        void addPropertyItem(QString name, PropertyWidgetItem* item);\n        \n        bool expanded;\n        bool enabled;\n        QString title;\n        \n        QWidget* containerWidget;\n        QGridLayout* containerLayout;\n        QHash<QString, QWidget*> items;\n        \n        QToolButton* expander;\n        QCheckBox* enabler;\n        QToolButton* menuButton;\n        \n        QMenu* menu;\n}; }\n\nusing namespace GluonCreator;\n\nPropertyWidgetContainer::PropertyWidgetContainer(GluonCore::GluonObject* theObject, QWidget* parent, Qt::WindowFlags f)\n    : QWidget(parent, f)\n{\n    \/\/ Create a base layout to add our two children to...\n    QVBoxLayout* layout = new QVBoxLayout(this);\n    layout->setSpacing(0);\n    layout->setContentsMargins(0, 0, 0, 0);\n    setLayout(layout);\n    \n    d = new PropertyWidgetContainerPrivate(this);\n    setObject(theObject);\n}\n\nPropertyWidgetContainer::~PropertyWidgetContainer()\n{\n    delete(d);\n}\n\nvoid PropertyWidgetContainer::setObject(GluonCore::GluonObject* theObject)\n{\n    d->object = theObject;\n\n    QString classname(theObject->metaObject()->className());\n    classname = classname.right(classname.length() - classname.lastIndexOf(':') - 1);\n    setTitle(d->humanifyString(classname));\n\n    if(!theObject->property(\"enabled\").isNull())\n        setEnabled(theObject->property(\"enabled\").value<bool>());\n    if(!theObject->property(\"expanded\").isNull())\n        setExpanded(theObject->property(\"expanded\").value<bool>());\n    connect(this, SIGNAL(propertyChanged(QObject*,QString,QVariant,QVariant)), parentWidget(), SIGNAL(propertyChanged(QObject*,QString,QVariant,QVariant)));\n\n    PropertyWidgetItem *nameWidget = PropertyWidgetItemFactory::instance()->create(theObject, \"QString\", parentWidget());\n    nameWidget->setEditObject(theObject);\n    nameWidget->setEditProperty(\"name\");\n    d->addPropertyItem(\"name\", nameWidget);\n\n    PropertyWidgetItem *descriptionWidget = PropertyWidgetItemFactory::instance()->create(theObject, \"QString\", parentWidget());\n    descriptionWidget->setEditObject(theObject);\n    descriptionWidget->setEditProperty(\"description\");\n    d->addPropertyItem(\"description\", descriptionWidget);\n\n    QFrame* separator = new QFrame(this);\n    separator->setFrameShape(QFrame::HLine);\n    d->containerLayout->addWidget(separator, d->containerLayout->rowCount(), 0, 1, 2);\n    \n    d->appendMetaObject(theObject);\n}\n\nbool\nPropertyWidgetContainer::expanded() const\n{\n    return d->expanded;\n}\n\nvoid\nPropertyWidgetContainer::setExpanded(const bool& newExpanded)\n{\n    bool oldExpanded = d->expanded;\n    d->expanded = newExpanded;\n\n    \/\/ This is done to avoid polluting the GDL with unneeded data - the invalid QVariant removes the expanded property, because true is the default value\n    if(!newExpanded)\n        d->object->setProperty(\"expanded\", false);\n    else\n        d->object->setProperty(\"expanded\", QVariant());\n    \n    if(newExpanded)\n    {\n        d->expander->setArrowType(Qt::DownArrow);\n    }\n    else\n    {\n        d->expander->setArrowType(Qt::RightArrow);\n    }\n    \/\/ This should be animated - need to experiment with the animation framework for that to be pretty ;)\n    d->containerWidget->setVisible(newExpanded);\n    \n    emit propertyChanged(d->object, \"expanded\", oldExpanded, newExpanded);\n}\n\nvoid\nPropertyWidgetContainer::toggleExpanded()\n{\n    setExpanded(!expanded());\n}\n\nbool\nPropertyWidgetContainer::enabled() const\n{\n    return d->enabled;\n}\n\nvoid\nPropertyWidgetContainer::setEnabled(const bool& newEnabled)\n{\n    bool oldEnabled = d->enabled;\n    d->enabled = newEnabled;\n    if(d->enabled != d->object->property(\"enabled\").value<bool>())\n        d->object->setProperty(\"enabled\", newEnabled);\n    if(d->enabler->isChecked() != newEnabled)\n        d->enabler->setChecked(newEnabled);\n    emit propertyChanged(d->object, \"expanded\", oldEnabled, newEnabled);\n}\n\nQString\nPropertyWidgetContainer::title() const\n{\n    return d->title;\n}\n\nvoid\nPropertyWidgetContainer::setTitle(const QString& newTitle)\n{\n    d->title = newTitle;\n    d->enabler->setText(newTitle);\n}\n\nvoid\nPropertyWidgetContainer::addDefaultMenuItems()\n{\n}\n\nvoid\nPropertyWidgetContainer::addMenuItem(QAction* menuItem)\n{\n    d->menu->addAction(menuItem);\n}\n\nvoid\nPropertyWidgetContainer::removeMenuItem(QAction* menuItem)\n{\n    if(d->menu->actions().contains(menuItem))\n        d->menu->removeAction(menuItem);\n}\n\nvoid\nPropertyWidgetContainer::PropertyWidgetContainerPrivate::appendMetaObject(QObject* object)\n{\n    QString propertyName, propertyDescription;\n    QVariant propertyValue;\n    \n    const QMetaObject *metaObject = object->metaObject();\n    QMetaProperty metaProperty;\n    \n    int count = metaObject->propertyCount();\n    for (int i = 0; i < count; ++i)\n    {\n        metaProperty = metaObject->property(i);\n        \n        \/\/ Guard against adding these, as we manually add them above, to ensure that they\n        \/\/ are right at the top and have a little line under them and such... all pretty ;)\n        \/\/ Also disregard enabled, as that is done by the checkbox above...\n        propertyName = QString(metaProperty.name());\n        if (propertyName == QString(\"objectName\") || propertyName == QString(\"name\") || propertyName == QString(\"description\") || propertyName == QString(\"expanded\") || propertyName == QString(\"enabled\"))\n            continue;\n        \n        PropertyWidgetItem *editWidget = PropertyWidgetItemFactory::instance()->create(object, metaProperty.typeName(), parent->parentWidget());\n        editWidget->setEditObject(object);\n        editWidget->setEditProperty(metaProperty.name());\n        \n        addPropertyItem(metaProperty.name(), editWidget);\n    }\n    \n    foreach(const QByteArray &propName, object->dynamicPropertyNames())\n    {\n        QString thePropName(propName);\n        \/\/ Don't show the expanded dynamic property - we make this one dynamic because\n        \/\/ we don't want to pollute the API with this arguably very meta information\n        if(thePropName == QString(\"expanded\") || thePropName == QString(\"enabled\"))\n            continue;\n        \n        PropertyWidgetItem *editWidget = PropertyWidgetItemFactory::instance()->create(object, object->property(propName).typeName(), parent->parentWidget());\n        editWidget->setEditObject(object);\n        editWidget->setEditProperty(thePropName);\n        \n        addPropertyItem(thePropName, editWidget);\n    }\n}\n\nvoid\nPropertyWidgetContainer::PropertyWidgetContainerPrivate::addPropertyItem(QString name, PropertyWidgetItem* item)\n{\n    \n    QLabel* nameLabel = new QLabel(parent);\n    nameLabel->setAlignment(Qt::AlignRight | Qt::AlignVCenter);\n    \/\/ Sanitize the name according to the camelCasing\n    \/\/ - Make first letter upper case\n    \/\/ - Split at upper-case letters\n    \/\/ - Add space between those indicated words\n    nameLabel->setText(humanifyString(name));\n    \n    item->setMinimumWidth(250);\n    item->setSizePolicy(QSizePolicy::MinimumExpanding, QSizePolicy::Fixed);\n    \/\/ Yeah, looks a bit funny, but this makes it possible to connect to either the pwi container... or the pwi view ;)\n    connect(item, SIGNAL(propertyChanged(QObject*, QString, QVariant, QVariant)), parent, SIGNAL(propertyChanged(QObject*, QString, QVariant, QVariant)));\n    \n    int row = containerLayout->rowCount();\n    containerLayout->addWidget(nameLabel, row, 0);\n    containerLayout->addWidget(item, row, 1);\n    \n    items.insert(name, item);\n}\n\nQString\nPropertyWidgetContainer::PropertyWidgetContainerPrivate::humanifyString(QString fixThis)\n{\n    QString fixedString;\n    const int length = fixThis.size();\n    for(int i = 0; i < length; ++i)\n    {\n        const QChar current = fixThis.at(i);\n        if(i == 0)\n        {\n            \/\/ Always upper-case the first word, whether it is or not...\n            fixedString = current.toUpper();\n        }\n        else\n        {\n            if(current.isUpper())\n            {\n                fixedString = fixedString % ' ' % current;\n            }\n            else\n            {\n                fixedString = fixedString % current;\n            }\n        }\n    }\n    return fixedString;\n}\n\n#include \"propertywidgetcontainer.moc\"\n<commit_msg>Right, description is now hidden when dynamic as well (it is a dynamic property in Assets, and indeed all other Gluonobjects)<commit_after>\/*\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., 51 Franklin Street, Fifth Floor,\n   Boston, MA 02110-1301, USA.\n*\/\n\n#include \"propertywidgetcontainer.h\"\n#include \"propertywidgetitem.h\"\n#include \"core\/gluonobject.h\"\n\n#include <QtGui\/QGridLayout>\n#include <QtGui\/QBoxLayout>\n#include <QtGui\/QToolButton>\n#include <QtGui\/QCheckBox>\n#include <QtGui\/QLabel>\n#include <QtGui\/QMenu>\n#include <QtCore\/QHash>\n#include <QtCore\/QMetaProperty>\n#include <QtCore\/QStringBuilder>\n#include <KIcon>\n\nnamespace GluonCreator {\nclass PropertyWidgetContainer::PropertyWidgetContainerPrivate\n{\n    public:\n        PropertyWidgetContainerPrivate(PropertyWidgetContainer* parent)\n            : expanded(true)\n            , enabled(true)\n            , containerWidget(0)\n            , containerLayout(0)\n            , expander(0)\n            , enabler(0)\n            , menuButton(0)\n        {\n            this->parent = parent;\n            menu = new QMenu(parent);\n            \n            \/\/ The widget used for the heading\n            QFrame* titleWidget = new QFrame(parent);\n            titleWidget->setFrameShape(QFrame::StyledPanel);\n            titleWidget->setFrameShadow(QFrame::Raised);\n            parent->layout()->addWidget(titleWidget);\n            \n            QHBoxLayout* titleLayout = new QHBoxLayout();\n            titleLayout->setSpacing(0);\n            titleLayout->setContentsMargins(0, 0, 0, 0);\n            titleWidget->setLayout(titleLayout);\n            \n            expander = new QToolButton(titleWidget);\n            expander->setAutoRaise(true);\n            expander->setArrowType(Qt::DownArrow);\n            connect(expander, SIGNAL(clicked(bool)), parent, SLOT(toggleExpanded()));\n            titleLayout->addWidget(expander);\n            \n            enabler = new QCheckBox(titleWidget);\n            enabler->setText(title);\n            enabler->setChecked(enabled);\n            connect(enabler, SIGNAL(toggled(bool)), parent, SLOT(setEnabled(bool)));\n            titleLayout->addWidget(enabler);\n            \n            menuButton = new QToolButton(titleWidget);\n            menuButton->setIcon(KIcon(\"preferences-other\"));\n            menuButton->setAutoRaise(true);\n            menuButton->setPopupMode(QToolButton::InstantPopup);\n            menuButton->setMenu(menu);\n            titleLayout->addWidget(menuButton);\n            \n            \/\/ The widget used for containing the children\n            containerWidget = new QWidget(parent);\n            containerLayout = new QGridLayout();\n            containerLayout->setSpacing(0);\n            containerLayout->setContentsMargins(0, 0, 0, 0);\n            containerWidget->setLayout(containerLayout);\n            parent->layout()->addWidget(containerWidget);\n        }\n        ~PropertyWidgetContainerPrivate()\n        {\n        }\n        \n        QString humanifyString(QString fixThis);\n        \n        PropertyWidgetContainer* parent;\n        GluonCore::GluonObject* object;\n        void appendMetaObject(QObject* object);\n        void addPropertyItem(QString name, PropertyWidgetItem* item);\n        \n        bool expanded;\n        bool enabled;\n        QString title;\n        \n        QWidget* containerWidget;\n        QGridLayout* containerLayout;\n        QHash<QString, QWidget*> items;\n        \n        QToolButton* expander;\n        QCheckBox* enabler;\n        QToolButton* menuButton;\n        \n        QMenu* menu;\n}; }\n\nusing namespace GluonCreator;\n\nPropertyWidgetContainer::PropertyWidgetContainer(GluonCore::GluonObject* theObject, QWidget* parent, Qt::WindowFlags f)\n    : QWidget(parent, f)\n{\n    \/\/ Create a base layout to add our two children to...\n    QVBoxLayout* layout = new QVBoxLayout(this);\n    layout->setSpacing(0);\n    layout->setContentsMargins(0, 0, 0, 0);\n    setLayout(layout);\n    \n    d = new PropertyWidgetContainerPrivate(this);\n    setObject(theObject);\n}\n\nPropertyWidgetContainer::~PropertyWidgetContainer()\n{\n    delete(d);\n}\n\nvoid PropertyWidgetContainer::setObject(GluonCore::GluonObject* theObject)\n{\n    d->object = theObject;\n\n    QString classname(theObject->metaObject()->className());\n    classname = classname.right(classname.length() - classname.lastIndexOf(':') - 1);\n    setTitle(d->humanifyString(classname));\n\n    if(!theObject->property(\"enabled\").isNull())\n        setEnabled(theObject->property(\"enabled\").value<bool>());\n    if(!theObject->property(\"expanded\").isNull())\n        setExpanded(theObject->property(\"expanded\").value<bool>());\n    connect(this, SIGNAL(propertyChanged(QObject*,QString,QVariant,QVariant)), parentWidget(), SIGNAL(propertyChanged(QObject*,QString,QVariant,QVariant)));\n\n    PropertyWidgetItem *nameWidget = PropertyWidgetItemFactory::instance()->create(theObject, \"QString\", parentWidget());\n    nameWidget->setEditObject(theObject);\n    nameWidget->setEditProperty(\"name\");\n    d->addPropertyItem(\"name\", nameWidget);\n\n    PropertyWidgetItem *descriptionWidget = PropertyWidgetItemFactory::instance()->create(theObject, \"QString\", parentWidget());\n    descriptionWidget->setEditObject(theObject);\n    descriptionWidget->setEditProperty(\"description\");\n    d->addPropertyItem(\"description\", descriptionWidget);\n\n    QFrame* separator = new QFrame(this);\n    separator->setFrameShape(QFrame::HLine);\n    d->containerLayout->addWidget(separator, d->containerLayout->rowCount(), 0, 1, 2);\n    \n    d->appendMetaObject(theObject);\n}\n\nbool\nPropertyWidgetContainer::expanded() const\n{\n    return d->expanded;\n}\n\nvoid\nPropertyWidgetContainer::setExpanded(const bool& newExpanded)\n{\n    bool oldExpanded = d->expanded;\n    d->expanded = newExpanded;\n\n    \/\/ This is done to avoid polluting the GDL with unneeded data - the invalid QVariant removes the expanded property, because true is the default value\n    if(!newExpanded)\n        d->object->setProperty(\"expanded\", false);\n    else\n        d->object->setProperty(\"expanded\", QVariant());\n    \n    if(newExpanded)\n    {\n        d->expander->setArrowType(Qt::DownArrow);\n    }\n    else\n    {\n        d->expander->setArrowType(Qt::RightArrow);\n    }\n    \/\/ This should be animated - need to experiment with the animation framework for that to be pretty ;)\n    d->containerWidget->setVisible(newExpanded);\n    \n    emit propertyChanged(d->object, \"expanded\", oldExpanded, newExpanded);\n}\n\nvoid\nPropertyWidgetContainer::toggleExpanded()\n{\n    setExpanded(!expanded());\n}\n\nbool\nPropertyWidgetContainer::enabled() const\n{\n    return d->enabled;\n}\n\nvoid\nPropertyWidgetContainer::setEnabled(const bool& newEnabled)\n{\n    bool oldEnabled = d->enabled;\n    d->enabled = newEnabled;\n    if(d->enabled != d->object->property(\"enabled\").value<bool>())\n        d->object->setProperty(\"enabled\", newEnabled);\n    if(d->enabler->isChecked() != newEnabled)\n        d->enabler->setChecked(newEnabled);\n    emit propertyChanged(d->object, \"expanded\", oldEnabled, newEnabled);\n}\n\nQString\nPropertyWidgetContainer::title() const\n{\n    return d->title;\n}\n\nvoid\nPropertyWidgetContainer::setTitle(const QString& newTitle)\n{\n    d->title = newTitle;\n    d->enabler->setText(newTitle);\n}\n\nvoid\nPropertyWidgetContainer::addDefaultMenuItems()\n{\n}\n\nvoid\nPropertyWidgetContainer::addMenuItem(QAction* menuItem)\n{\n    d->menu->addAction(menuItem);\n}\n\nvoid\nPropertyWidgetContainer::removeMenuItem(QAction* menuItem)\n{\n    if(d->menu->actions().contains(menuItem))\n        d->menu->removeAction(menuItem);\n}\n\nvoid\nPropertyWidgetContainer::PropertyWidgetContainerPrivate::appendMetaObject(QObject* object)\n{\n    QString propertyName, propertyDescription;\n    QVariant propertyValue;\n    \n    const QMetaObject *metaObject = object->metaObject();\n    QMetaProperty metaProperty;\n    \n    int count = metaObject->propertyCount();\n    for (int i = 0; i < count; ++i)\n    {\n        metaProperty = metaObject->property(i);\n        \n        \/\/ Guard against adding these, as we manually add them above, to ensure that they\n        \/\/ are right at the top and have a little line under them and such... all pretty ;)\n        \/\/ Also disregard enabled, as that is done by the checkbox above...\n        propertyName = QString(metaProperty.name());\n        if (propertyName == QString(\"objectName\") || propertyName == QString(\"name\") || propertyName == QString(\"description\") || propertyName == QString(\"expanded\") || propertyName == QString(\"enabled\"))\n            continue;\n        \n        PropertyWidgetItem *editWidget = PropertyWidgetItemFactory::instance()->create(object, metaProperty.typeName(), parent->parentWidget());\n        editWidget->setEditObject(object);\n        editWidget->setEditProperty(metaProperty.name());\n        \n        addPropertyItem(metaProperty.name(), editWidget);\n    }\n    \n    foreach(const QByteArray &propName, object->dynamicPropertyNames())\n    {\n        QString thePropName(propName);\n        \/\/ Don't show the expanded dynamic property - we make this one dynamic because\n        \/\/ we don't want to pollute the API with this arguably very meta information\n        if(thePropName == QString(\"description\") || thePropName == QString(\"expanded\") || thePropName == QString(\"enabled\"))\n            continue;\n        \n        PropertyWidgetItem *editWidget = PropertyWidgetItemFactory::instance()->create(object, object->property(propName).typeName(), parent->parentWidget());\n        editWidget->setEditObject(object);\n        editWidget->setEditProperty(thePropName);\n        \n        addPropertyItem(thePropName, editWidget);\n    }\n}\n\nvoid\nPropertyWidgetContainer::PropertyWidgetContainerPrivate::addPropertyItem(QString name, PropertyWidgetItem* item)\n{\n    \n    QLabel* nameLabel = new QLabel(parent);\n    nameLabel->setAlignment(Qt::AlignRight | Qt::AlignVCenter);\n    \/\/ Sanitize the name according to the camelCasing\n    \/\/ - Make first letter upper case\n    \/\/ - Split at upper-case letters\n    \/\/ - Add space between those indicated words\n    nameLabel->setText(humanifyString(name));\n    \n    item->setMinimumWidth(250);\n    item->setSizePolicy(QSizePolicy::MinimumExpanding, QSizePolicy::Fixed);\n    \/\/ Yeah, looks a bit funny, but this makes it possible to connect to either the pwi container... or the pwi view ;)\n    connect(item, SIGNAL(propertyChanged(QObject*, QString, QVariant, QVariant)), parent, SIGNAL(propertyChanged(QObject*, QString, QVariant, QVariant)));\n    \n    int row = containerLayout->rowCount();\n    containerLayout->addWidget(nameLabel, row, 0);\n    containerLayout->addWidget(item, row, 1);\n    \n    items.insert(name, item);\n}\n\nQString\nPropertyWidgetContainer::PropertyWidgetContainerPrivate::humanifyString(QString fixThis)\n{\n    QString fixedString;\n    const int length = fixThis.size();\n    for(int i = 0; i < length; ++i)\n    {\n        const QChar current = fixThis.at(i);\n        if(i == 0)\n        {\n            \/\/ Always upper-case the first word, whether it is or not...\n            fixedString = current.toUpper();\n        }\n        else\n        {\n            if(current.isUpper())\n            {\n                fixedString = fixedString % ' ' % current;\n            }\n            else\n            {\n                fixedString = fixedString % current;\n            }\n        }\n    }\n    return fixedString;\n}\n\n#include \"propertywidgetcontainer.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  DueTimer.cpp - Implementation of Timers defined on DueTimer.h\n  For instructions, go to https:\/\/github.com\/ivanseidel\/DueTimer\n\n  Created by Ivan Seidel Gomes, March, 2013.\n  Modified by Philipp Klaus, June 2013.\n  Thanks to stimmer (from Arduino forum), for coding the \"timer soul\" (Register stuff)\n  Released into the public domain.\n*\/\n\n#include \"DueTimer.h\"\n\nconst DueTimer::Timer DueTimer::Timers[9] = {\n\t{TC0,0,TC0_IRQn},\n\t{TC0,1,TC1_IRQn},\n\t{TC0,2,TC2_IRQn},\n\t{TC1,0,TC3_IRQn},\n\t{TC1,1,TC4_IRQn},\n\t{TC1,2,TC5_IRQn},\n\t{TC2,0,TC6_IRQn},\n\t{TC2,1,TC7_IRQn},\n\t{TC2,2,TC8_IRQn},\n};\n\nvoid (*DueTimer::callbacks[9])() = {};\ndouble DueTimer::_frequency[9] = {1,1,1,1,1,1,1,1,1};\n\n\/*\n\tInitializing all timers, so you can use them like this: Timer0.start();\n*\/\nDueTimer Timer(0);\n\nDueTimer Timer0(0);\nDueTimer Timer1(1);\nDueTimer Timer2(2);\nDueTimer Timer3(3);\nDueTimer Timer4(4);\nDueTimer Timer5(5);\nDueTimer Timer6(6);\nDueTimer Timer7(7);\nDueTimer Timer8(8);\n\nDueTimer::DueTimer(int _timer){\n\t\/*\n\t\tThe constructor of the class DueTimer \n\t*\/\n\n\ttimer = _timer;\n}\n\nDueTimer DueTimer::getAvailable(){\n\t\/*\n\t\tReturn the first timer with no callback set\n\t*\/\n\n\tfor(int i = 0; i < 9; i++){\n\t\tif(!callbacks[i])\n\t\t\treturn DueTimer(i);\n\t}\n\t\/\/ Default, return Timer0;\n\treturn DueTimer(0);\n}\n\nDueTimer DueTimer::attachInterrupt(void (*isr)()){\n\t\/*\n\t\tLinks the function passed as argument to the timer of the object\n\t*\/\n\n\tcallbacks[timer] = isr;\n\n\treturn *this;\n}\n\nDueTimer DueTimer::detachInterrupt(){\n\t\/*\n\t\tLinks the function passed as argument to the timer of the object\n\t*\/\n\n\tstop(); \/\/ Stop the currently running timer\n\n\tcallbacks[timer] = NULL;\n\n\treturn *this;\n}\n\nDueTimer DueTimer::start(long microseconds){\n\t\/*\n\t\tStart the timer\n\t\tIf a period is set, then sets the period and start the timer\n\t*\/\n\n\tif(microseconds > 0)\n\t\tsetPeriod(microseconds);\n\t\n\tNVIC_ClearPendingIRQ(Timers[timer].irq);\n\tNVIC_EnableIRQ(Timers[timer].irq);\n\n\treturn *this;\n}\n\nDueTimer DueTimer::stop(){\n\t\/*\n\t\tStop the timer\n\t*\/\n\n\tNVIC_DisableIRQ(Timers[timer].irq);\n\n\treturn *this;\n}\n\nuint8_t DueTimer::bestClock(double frequency, uint32_t& retRC){\n\t\/*\n\t\tPick the best Clock, thanks to Ogle Basil Hall!\n\n\t\tTimer\t\tDefinition\n\t\tTIMER_CLOCK1\tMCK\/2\n\t\tTIMER_CLOCK2\tMCK\/8\n\t\tTIMER_CLOCK3\tMCK\/32\n\t\tTIMER_CLOCK4\tMCK\/128\n\t*\/\n\tstruct {\n\t\tuint8_t flag;\n\t\tuint8_t divisor;\n\t} clockConfig[] = {\n\t\t{ TC_CMR_TCCLKS_TIMER_CLOCK1, 2 },\n\t\t{ TC_CMR_TCCLKS_TIMER_CLOCK2, 8 },\n\t\t{ TC_CMR_TCCLKS_TIMER_CLOCK3, 32 },\n\t\t{ TC_CMR_TCCLKS_TIMER_CLOCK4, 128 }\n\t};\n\tfloat ticks;\n\tfloat error;\n\tint clkId = 3;\n\tint bestClock = 3;\n\tfloat bestError = 1.0;\n\tdo\n\t{\n\t\tticks = (float) VARIANT_MCK \/ frequency \/ (float) clockConfig[clkId].divisor;\n\t\terror = abs(ticks - round(ticks));\n\t\tif (abs(error) < bestError)\n\t\t{\n\t\t\tbestClock = clkId;\n\t\t\tbestError = error;\n\t\t}\n\t} while (clkId-- > 0);\n\tticks = (float) VARIANT_MCK \/ frequency \/ (float) clockConfig[bestClock].divisor;\n\tretRC = (uint32_t) round(ticks);\n\treturn clockConfig[bestClock].flag;\n}\n\n\nDueTimer DueTimer::setFrequency(double frequency){\n\t\/*\n\t\tSet the timer frequency (in Hz)\n\t*\/\n\n\t\/\/ Prevent negative frequencies\n\tif(frequency <= 0) { frequency = 1; }\n\n\t\/\/ Remember the frequency\n\t_frequency[timer] = frequency;\n\n\t\/\/ Get current timer configurations\n\tTimer t = Timers[timer];\n\n\tuint32_t rc = 0;\n\tuint8_t clock;\n\n\t\/\/ Tell the Power Management Controller to disable \n\t\/\/ the write protection of the (Timer\/Counter) registers:\n\tpmc_set_writeprotect(false);\n\n\t\/\/ Enable clock for the timer\n\tpmc_enable_periph_clk((uint32_t)Timers[timer].irq);\n\n\t\/\/ Find the best clock for the wanted frequency\n\tclock = bestClock(frequency, rc);\n\n\t\/\/ Set up the Timer in waveform mode which creates a PWM\n\t\/\/ in UP mode with automatic trigger on RC Compare\n\t\/\/ and sets it up with the determined internal clock as clock input.\n\tTC_Configure(t.tc, t.channel, TC_CMR_WAVE | TC_CMR_WAVSEL_UP_RC | clock);\n\t\/\/ Reset counter and fire interrupt when RC value is matched:\n\tTC_SetRC(t.tc, t.channel, rc);\n\t\/\/ Start the Counter channel\n\tTC_Start(t.tc, t.channel);\n\t\/\/ Enable the RC Compare Interrupt...\n\tt.tc->TC_CHANNEL[t.channel].TC_IER=TC_IER_CPCS;\n\t\/\/ ... and disable all others.\n\tt.tc->TC_CHANNEL[t.channel].TC_IDR=~TC_IER_CPCS;\n\n\treturn *this;\n}\n\nDueTimer DueTimer::setPeriod(long microseconds){\n\t\/*\n\t\tSet the period of the timer (in microseconds)\n\t*\/\n\n\t\/\/ Convert period in microseconds to frequency in Hz\n\tdouble frequency = 1000000.0 \/ microseconds;\t\n\tsetFrequency(frequency);\n\treturn *this;\n}\n\ndouble DueTimer::getFrequency(){\n\t\/*\n\t\tGet current time frequency\n\t*\/\n\n\treturn _frequency[timer];\n}\n\nlong DueTimer::getPeriod(){\n\t\/*\n\t\tGet current time period\n\t*\/\n\n\treturn 1.0\/getFrequency()*1000000;\n}\n\n\n\/*\n\tImplementation of the timer callbacks defined in \n\tarduino-1.5.2\/hardware\/arduino\/sam\/system\/CMSIS\/Device\/ATMEL\/sam3xa\/include\/sam3x8e.h\n*\/\nvoid TC0_Handler(){\n\tTC_GetStatus(TC0, 0);\n\tDueTimer::callbacks[0]();\n}\nvoid TC1_Handler(){\n\tTC_GetStatus(TC0, 1);\n\tDueTimer::callbacks[1]();\n}\nvoid TC2_Handler(){\n\tTC_GetStatus(TC0, 2);\n\tDueTimer::callbacks[2]();\n}\nvoid TC3_Handler(){\n\tTC_GetStatus(TC1, 0);\n\tDueTimer::callbacks[3]();\n}\nvoid TC4_Handler(){\n\tTC_GetStatus(TC1, 1);\n\tDueTimer::callbacks[4]();\n}\nvoid TC5_Handler(){\n\tTC_GetStatus(TC1, 2);\n\tDueTimer::callbacks[5]();\n}\nvoid TC6_Handler(){\n\tTC_GetStatus(TC2, 0);\n\tDueTimer::callbacks[6]();\n}\nvoid TC7_Handler(){\n\tTC_GetStatus(TC2, 1);\n\tDueTimer::callbacks[7]();\n}\nvoid TC8_Handler(){\n\tTC_GetStatus(TC2, 2);\n\tDueTimer::callbacks[8]();\n}\n<commit_msg>fixing bug: check in start() if _frequency is > 0.<commit_after>\/*\n  DueTimer.cpp - Implementation of Timers defined on DueTimer.h\n  For instructions, go to https:\/\/github.com\/ivanseidel\/DueTimer\n\n  Created by Ivan Seidel Gomes, March, 2013.\n  Modified by Philipp Klaus, June 2013.\n  Thanks to stimmer (from Arduino forum), for coding the \"timer soul\" (Register stuff)\n  Released into the public domain.\n*\/\n\n#include \"DueTimer.h\"\n\nconst DueTimer::Timer DueTimer::Timers[9] = {\n\t{TC0,0,TC0_IRQn},\n\t{TC0,1,TC1_IRQn},\n\t{TC0,2,TC2_IRQn},\n\t{TC1,0,TC3_IRQn},\n\t{TC1,1,TC4_IRQn},\n\t{TC1,2,TC5_IRQn},\n\t{TC2,0,TC6_IRQn},\n\t{TC2,1,TC7_IRQn},\n\t{TC2,2,TC8_IRQn},\n};\n\nvoid (*DueTimer::callbacks[9])() = {};\n\n\/*\n\tInitializing all timers, so you can use them like this: Timer0.start();\n*\/\nDueTimer Timer(0);\n\nDueTimer Timer0(0);\nDueTimer Timer1(1);\nDueTimer Timer2(2);\nDueTimer Timer3(3);\nDueTimer Timer4(4);\nDueTimer Timer5(5);\nDueTimer Timer6(6);\nDueTimer Timer7(7);\nDueTimer Timer8(8);\n\nDueTimer::DueTimer(int _timer){\n\t\/*\n\t\tThe constructor of the class DueTimer \n\t*\/\n\n\ttimer = _timer;\n\n\t_frequency[timer] = -1;\n}\n\nDueTimer DueTimer::getAvailable(){\n\t\/*\n\t\tReturn the first timer with no callback set\n\t*\/\n\n\tfor(int i = 0; i < 9; i++){\n\t\tif(!callbacks[i])\n\t\t\treturn DueTimer(i);\n\t}\n\t\/\/ Default, return Timer0;\n\treturn DueTimer(0);\n}\n\nDueTimer DueTimer::attachInterrupt(void (*isr)()){\n\t\/*\n\t\tLinks the function passed as argument to the timer of the object\n\t*\/\n\n\tcallbacks[timer] = isr;\n\n\treturn *this;\n}\n\nDueTimer DueTimer::detachInterrupt(){\n\t\/*\n\t\tLinks the function passed as argument to the timer of the object\n\t*\/\n\n\tstop(); \/\/ Stop the currently running timer\n\n\tcallbacks[timer] = NULL;\n\n\treturn *this;\n}\n\nDueTimer DueTimer::start(long microseconds){\n\t\/*\n\t\tStart the timer\n\t\tIf a period is set, then sets the period and start the timer\n\t*\/\n\n\tif(microseconds > 0)\n\t\tsetPeriod(microseconds);\n\t\n\tif(_frequency[timer] <= 0)\n\t\tsetFrequency(1);\n\n\tNVIC_ClearPendingIRQ(Timers[timer].irq);\n\tNVIC_EnableIRQ(Timers[timer].irq);\n\n\treturn *this;\n}\n\nDueTimer DueTimer::stop(){\n\t\/*\n\t\tStop the timer\n\t*\/\n\n\tNVIC_DisableIRQ(Timers[timer].irq);\n\n\treturn *this;\n}\n\nuint8_t DueTimer::bestClock(double frequency, uint32_t& retRC){\n\t\/*\n\t\tPick the best Clock, thanks to Ogle Basil Hall!\n\n\t\tTimer\t\tDefinition\n\t\tTIMER_CLOCK1\tMCK\/2\n\t\tTIMER_CLOCK2\tMCK\/8\n\t\tTIMER_CLOCK3\tMCK\/32\n\t\tTIMER_CLOCK4\tMCK\/128\n\t*\/\n\tstruct {\n\t\tuint8_t flag;\n\t\tuint8_t divisor;\n\t} clockConfig[] = {\n\t\t{ TC_CMR_TCCLKS_TIMER_CLOCK1, 2 },\n\t\t{ TC_CMR_TCCLKS_TIMER_CLOCK2, 8 },\n\t\t{ TC_CMR_TCCLKS_TIMER_CLOCK3, 32 },\n\t\t{ TC_CMR_TCCLKS_TIMER_CLOCK4, 128 }\n\t};\n\tfloat ticks;\n\tfloat error;\n\tint clkId = 3;\n\tint bestClock = 3;\n\tfloat bestError = 1.0;\n\tdo\n\t{\n\t\tticks = (float) VARIANT_MCK \/ frequency \/ (float) clockConfig[clkId].divisor;\n\t\terror = abs(ticks - round(ticks));\n\t\tif (abs(error) < bestError)\n\t\t{\n\t\t\tbestClock = clkId;\n\t\t\tbestError = error;\n\t\t}\n\t} while (clkId-- > 0);\n\tticks = (float) VARIANT_MCK \/ frequency \/ (float) clockConfig[bestClock].divisor;\n\tretRC = (uint32_t) round(ticks);\n\treturn clockConfig[bestClock].flag;\n}\n\n\nDueTimer DueTimer::setFrequency(double frequency){\n\t\/*\n\t\tSet the timer frequency (in Hz)\n\t*\/\n\n\t\/\/ Prevent negative frequencies\n\tif(frequency <= 0) { frequency = 1; }\n\n\t\/\/ Remember the frequency\n\t_frequency[timer] = frequency;\n\n\t\/\/ Get current timer configurations\n\tTimer t = Timers[timer];\n\n\tuint32_t rc = 0;\n\tuint8_t clock;\n\n\t\/\/ Tell the Power Management Controller to disable \n\t\/\/ the write protection of the (Timer\/Counter) registers:\n\tpmc_set_writeprotect(false);\n\n\t\/\/ Enable clock for the timer\n\tpmc_enable_periph_clk((uint32_t)Timers[timer].irq);\n\n\t\/\/ Find the best clock for the wanted frequency\n\tclock = bestClock(frequency, rc);\n\n\t\/\/ Set up the Timer in waveform mode which creates a PWM\n\t\/\/ in UP mode with automatic trigger on RC Compare\n\t\/\/ and sets it up with the determined internal clock as clock input.\n\tTC_Configure(t.tc, t.channel, TC_CMR_WAVE | TC_CMR_WAVSEL_UP_RC | clock);\n\t\/\/ Reset counter and fire interrupt when RC value is matched:\n\tTC_SetRC(t.tc, t.channel, rc);\n\t\/\/ Start the Counter channel\n\tTC_Start(t.tc, t.channel);\n\t\/\/ Enable the RC Compare Interrupt...\n\tt.tc->TC_CHANNEL[t.channel].TC_IER=TC_IER_CPCS;\n\t\/\/ ... and disable all others.\n\tt.tc->TC_CHANNEL[t.channel].TC_IDR=~TC_IER_CPCS;\n\n\treturn *this;\n}\n\nDueTimer DueTimer::setPeriod(long microseconds){\n\t\/*\n\t\tSet the period of the timer (in microseconds)\n\t*\/\n\n\t\/\/ Convert period in microseconds to frequency in Hz\n\tdouble frequency = 1000000.0 \/ microseconds;\t\n\tsetFrequency(frequency);\n\treturn *this;\n}\n\ndouble DueTimer::getFrequency(){\n\t\/*\n\t\tGet current time frequency\n\t*\/\n\n\treturn _frequency[timer];\n}\n\nlong DueTimer::getPeriod(){\n\t\/*\n\t\tGet current time period\n\t*\/\n\n\treturn 1.0\/getFrequency()*1000000;\n}\n\n\n\/*\n\tImplementation of the timer callbacks defined in \n\tarduino-1.5.2\/hardware\/arduino\/sam\/system\/CMSIS\/Device\/ATMEL\/sam3xa\/include\/sam3x8e.h\n*\/\nvoid TC0_Handler(){\n\tTC_GetStatus(TC0, 0);\n\tDueTimer::callbacks[0]();\n}\nvoid TC1_Handler(){\n\tTC_GetStatus(TC0, 1);\n\tDueTimer::callbacks[1]();\n}\nvoid TC2_Handler(){\n\tTC_GetStatus(TC0, 2);\n\tDueTimer::callbacks[2]();\n}\nvoid TC3_Handler(){\n\tTC_GetStatus(TC1, 0);\n\tDueTimer::callbacks[3]();\n}\nvoid TC4_Handler(){\n\tTC_GetStatus(TC1, 1);\n\tDueTimer::callbacks[4]();\n}\nvoid TC5_Handler(){\n\tTC_GetStatus(TC1, 2);\n\tDueTimer::callbacks[5]();\n}\nvoid TC6_Handler(){\n\tTC_GetStatus(TC2, 0);\n\tDueTimer::callbacks[6]();\n}\nvoid TC7_Handler(){\n\tTC_GetStatus(TC2, 1);\n\tDueTimer::callbacks[7]();\n}\nvoid TC8_Handler(){\n\tTC_GetStatus(TC2, 2);\n\tDueTimer::callbacks[8]();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"GameScene.h\"\n#include \"GameConfigBase.h\"\n#include \"..\/json\/json.h\"\n#include \"msg_proto\/web_data.pb.h\"\n#include \"msg_proto\/web_game.pb.h\"\n#include \"fxredis.h\"\n#include \"Player.h\"\n#include \"PlayerSession.h\"\n\nclass RedisSetPlayerTeamId : public IRedisQuery\n{\npublic:\n\tRedisSetPlayerTeamId(UINT64 qwTeamId, UINT64 qwPlayerId) : m_qwTeamId(qwTeamId), m_qwPlayerId(qwPlayerId) {}\n\t~RedisSetPlayerTeamId() {}\n\n\tvirtual int\t\t\t\t\tGetDBId(void) { return 0; }\n\tvirtual void\t\t\t\tOnQuery(IRedisConnection *poDBConnection)\n\t{\n\t\tchar szQuery[64] = { 0 };\n\t\tsprintf(szQuery, \"SET %llu_%s %llu\", m_qwPlayerId, RedisConstant::szPlayerTeamId, m_qwTeamId);\n\t\tpoDBConnection->Query(szQuery);\n\t}\n\tvirtual void OnResult(void) { }\n\tvirtual void Release(void) { }\n\nprivate:\n\tUINT64 m_qwTeamId;\n\tUINT64 m_qwPlayerId;\n};\n\nclass RedisDelPlayerTeamId : public IRedisQuery\n{\npublic:\n\tRedisDelPlayerTeamId(UINT64 qwPlayerId) : m_qwPlayerId(qwPlayerId) {}\n\t~RedisDelPlayerTeamId() {}\n\n\tvirtual int\t\t\t\t\tGetDBId(void) { return 0; }\n\tvirtual void\t\t\t\tOnQuery(IRedisConnection *poDBConnection)\n\t{\n\t\tchar szQuery[64] = { 0 };\n\t\tsprintf(szQuery, \"DEL %llu_%s\", m_qwPlayerId, RedisConstant::szPlayerTeamId);\n\t\tpoDBConnection->Query(szQuery);\n\t}\n\tvirtual void OnResult(void) { }\n\tvirtual void Release(void) { }\n\nprivate:\n\tUINT64 m_qwPlayerId;\n};\n\nCGameSceneBase::CGameSceneBase()\n{\n}\n\n\nCGameSceneBase::~CGameSceneBase()\n{\n}\n\nbool CGameSceneBase::Init(unsigned int dwGameType, std::string szRoles, UINT64 qwTeamId)\n{\n\tswitch ((GameProto::EGameType)(dwGameType))\n\t{\n\t\tcase GameProto::GT_Common:\n\t\t{\n\t\t\tif (CreateInstance(new CGameSceneCommon) == false)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\tbreak;\n\t\tdefault:\n\t\t\treturn false;\n\t}\n\tJson::Value jRoles;\n\tJson::Reader jReader;\n\n\tif (!jReader.parse(szRoles, jRoles))\n\t{\n\t\treturn false;\n\t}\n\tif (!jRoles.isArray())\n\t{\n\t\treturn false;\n\t}\n\tif (jRoles.size() > MAXCLIENTNUM)\n\t{\n\t\tAssert(0);\n\t}\n\tfor (int i = 0; i < jRoles.size(); ++i)\n\t{\n\t\tInstance()->m_qwRoles[i] = jRoles[i].asInt64();\n\t\tif (Instance()->m_qwRoles[i])\n\t\t{\n\t\t\tRedisSetPlayerTeamId oRedisSetPlayerTeamId(qwTeamId, Instance()->m_qwRoles[i]);\n\t\t\tFxRedisGetModule()->QueryDirect(&oRedisSetPlayerTeamId);\n\t\t}\n\t}\n\n\tInstance()->m_dwGameType = dwGameType;\n\tInstance()->m_qwTeamId = qwTeamId;\n\tInstance()->m_dwGameStartTime = GetTimeHandler()->GetSecond();\n\treturn Instance()->Init();\n}\n\nvoid CGameSceneBase::Run(double fTime)\n{\n\tswitch (GetSceneState())\n\t{\n\t\tcase GameProto::ESS_None: break;\n\t\tcase GameProto::ESS_Prepare: { Preparing(fTime); } break;\n\t\tcase GameProto::ESS_GameReady: { GameReady(fTime); } break;\n\t\tcase GameProto::ESS_Gaming: { Gaming(fTime); } break;\n\t\tcase GameProto::ESS_Transact: { Transacting(fTime); } break;\n\t\tdefault: {Assert(0); } break;\n\t}\n}\n\nvoid CGameSceneBase::Preparing(double fTime)\n{\n\tstatic UINT32 s_dwNotifyTime = m_dwGameStartTime + 5;\n\n\tINT32 dwLeftTime = m_dwGameStartTime + CGameConfigBase::Instance()->GetPrepareTime() - GetTimeHandler()->GetSecond();\n\tif (dwLeftTime < 0)\n\t{\n\t\tChangeState(GameProto::ESS_GameReady);\n\t\treturn;\n\t}\n\tGameProto::GameNotifyPlayerPrepareTime oNotify;\n\toNotify.set_dw_left_time(dwLeftTime);\n\tif (GetTimeHandler()->GetSecond() >= s_dwNotifyTime)\n\t{\n\t\tNotifyPlayer(oNotify);\n\n\t\t\/\/֪ͨͻƵ 5 ÿһ ǰ 5һ\n\t\tif (s_dwNotifyTime >= m_dwGameStartTime + CGameConfigBase::Instance()->GetPrepareTime() - 5)\n\t\t{\n\t\t\ts_dwNotifyTime += 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ts_dwNotifyTime += 5;\n\t\t}\n\t}\n}\n\nvoid CGameSceneBase::GameReady(double fTime)\n{\n\tstatic UINT32 s_dwNotifyTime = m_dwGameStartTime + CGameConfigBase::Instance()->GetPrepareTime() + 1;\n\n\tINT32 dwLeftTime = m_dwGameStartTime + CGameConfigBase::Instance()->GetPrepareTime() + CGameConfigBase::Instance()->GetGameReadyTime() - GetTimeHandler()->GetSecond();\n\tif (dwLeftTime < 0)\n\t{\n\t\tChangeState(GameProto::ESS_Gaming);\n\t\treturn;\n\t}\n\tGameProto::GameNotifyPlayerGameReadyTime oNotify;\n\toNotify.set_dw_left_time(dwLeftTime);\n\tif (GetTimeHandler()->GetSecond() >= s_dwNotifyTime)\n\t{\n\t\tNotifyPlayer(oNotify);\n\t\ts_dwNotifyTime += 1;\n\t}\n}\n\nvoid CGameSceneBase::Gaming(double fTime)\n{\n\n}\n\nvoid CGameSceneBase::Transacting(double fTime)\n{\n\n}\n\nvoid CGameSceneBase::OnPrepare()\n{\n}\n\nvoid CGameSceneBase::OnGameReady()\n{\n}\n\nvoid CGameSceneBase::OnGameStart()\n{\n}\n\nvoid CGameSceneBase::OnTransact()\n{\n}\n\nvoid CGameSceneBase::GameEnd()\n{\n\tLogExe(LogLv_Debug, \"%s\", \"game end~~~~~\");\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tif (m_qwRoles[i])\n\t\t{\n\t\t\tRedisDelPlayerTeamId oRedisDelPlayerTeamId(m_qwRoles[i]);\n\t\t\tFxRedisGetModule()->QueryDirect(&oRedisDelPlayerTeamId);\n\t\t}\n\t}\n}\n\nvoid CGameSceneBase::NotifyPlayer(google::protobuf::Message& refMsg)\n{\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tCPlayerBase* pPlayerBase = GetPlayer(m_qwRoles[i]);\n\t\tif (!pPlayerBase)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tif (!pPlayerBase->GetPlayerSession())\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tchar* pBuf = NULL;\n\t\tunsigned int dwBufLen = 0;\n\t\tProtoUtility::MakeProtoSendBuffer(refMsg, pBuf, dwBufLen);\n\t\tpPlayerBase->GetPlayerSession()->Send(pBuf, dwBufLen);\n\t}\n}\n\nvoid CGameSceneBase::NotifyPlayerExcept(google::protobuf::Message& refMsg, UINT64 qwPlayerId)\n{\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tif (m_qwRoles[i] == qwPlayerId)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tCPlayerBase* pPlayerBase = GetPlayer(m_qwRoles[i]);\n\t\tif (!pPlayerBase)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tif (!pPlayerBase->GetPlayerSession())\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tchar* pBuf = NULL;\n\t\tunsigned int dwBufLen = 0;\n\t\tProtoUtility::MakeProtoSendBuffer(refMsg, pBuf, dwBufLen);\n\t\tpPlayerBase->GetPlayerSession()->Send(pBuf, dwBufLen);\n\t}\n}\n\nvoid CGameSceneBase::ChangeState(GameProto::EGameSceneState eGameSceneState)\n{\n\tLogExe(LogLv_Info, \"game change state : %d\", (int)eGameSceneState);\n\tSetSceneState(eGameSceneState);\n\n\tGameProto::GameNotifyPlayerGameState oNotify;\n\toNotify.set_state(eGameSceneState);\n\tNotifyPlayer(oNotify);\n\n\tswitch (GetSceneState())\n\t{\n\t\tcase GameProto::ESS_Prepare: OnPrepare(); break;\n\t\tcase GameProto::ESS_GameReady: OnGameReady(); break;\n\t\tcase GameProto::ESS_Gaming: OnGameStart(); break;\n\t\tcase GameProto::ESS_Transact: OnTransact(); break;\n\t\tdefault:Assert(0); break;\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCGameSceneCommon::CGameSceneCommon()\n{\n\tSetSceneState(GameProto::ESS_None);\n}\n\nCGameSceneCommon::~CGameSceneCommon()\n{\n}\n\nbool CGameSceneCommon::Init()\n{\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tif (m_qwRoles[i] != 0)\n\t\t{\n\t\t\tm_mapPlayers[m_qwRoles[i]].SetPlayerSession(NULL);\n\t\t\tm_mapPlayers[m_qwRoles[i]].SetPlayerId(m_qwRoles[i]);\n\t\t}\n\t}\n\tChangeState(GameProto::ESS_Prepare);\n\treturn true;\n}\n\nCPlayerBase* CGameSceneCommon::GetPlayer(UINT64 qwPlayerId)\n{\n\tstd::map<UINT64, CCommonPlayer>::iterator it = m_mapPlayers.find(qwPlayerId);\n\tif (it == m_mapPlayers.end())\n\t{\n\t\treturn NULL;\n\t}\n\treturn &(it->second);\n}\n\nvoid CGameSceneCommon::OnGameStart()\n{\n\tfor (std::map<UINT64, CCommonPlayer>::iterator it = m_mapPlayers.begin();\n\t\tit != m_mapPlayers.end(); ++it)\n\t{\n\t\tit->second.Init();\n\t}\n}\n\nvoid CGameSceneCommon::Gaming(double fTime)\n{\n\tfor (std::map<UINT64, CCommonPlayer>::iterator it = m_mapPlayers.begin();\n\t\tit != m_mapPlayers.end(); ++it)\n\t{\n\t\tit->second.Update(fTime);\n\t}\n}\n\nGameProto::EGameSceneState CGameSceneCommon::GetSceneState()\n{\n\treturn m_oSceneInfo.mutable_scene_info()->state();\n}\n\nvoid CGameSceneCommon::FillProtoScene(GameProto::GameNotifyPlayerGameSceneInfo& refInfo)\n{\n\trefInfo.set_dw_game_type(m_dwGameType);\n\t*(refInfo.mutable_common_scene_info()) = m_oSceneInfo;\n\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tGameProto::RoleData* pData = refInfo.add_players();\n\t\tif (m_qwRoles[i])\n\t\t{\n\t\t\tm_mapPlayers[i].FillPlayerData(*pData);\n\t\t}\n\t}\n}\n\nvoid CGameSceneCommon::SetSceneState(GameProto::EGameSceneState eGameSceneState)\n{\n\tm_oSceneInfo.mutable_scene_info()->set_state(eGameSceneState);\n}\n\n<commit_msg>fix<commit_after>#include \"GameScene.h\"\n#include \"GameConfigBase.h\"\n#include \"..\/json\/json.h\"\n#include \"msg_proto\/web_data.pb.h\"\n#include \"msg_proto\/web_game.pb.h\"\n#include \"fxredis.h\"\n#include \"Player.h\"\n#include \"PlayerSession.h\"\n\nclass RedisSetPlayerTeamId : public IRedisQuery\n{\npublic:\n\tRedisSetPlayerTeamId(UINT64 qwTeamId, UINT64 qwPlayerId) : m_qwTeamId(qwTeamId), m_qwPlayerId(qwPlayerId) {}\n\t~RedisSetPlayerTeamId() {}\n\n\tvirtual int\t\t\t\t\tGetDBId(void) { return 0; }\n\tvirtual void\t\t\t\tOnQuery(IRedisConnection *poDBConnection)\n\t{\n\t\tchar szQuery[64] = { 0 };\n\t\tsprintf(szQuery, \"SET %llu_%s %llu\", m_qwPlayerId, RedisConstant::szPlayerTeamId, m_qwTeamId);\n\t\tpoDBConnection->Query(szQuery);\n\t}\n\tvirtual void OnResult(void) { }\n\tvirtual void Release(void) { }\n\nprivate:\n\tUINT64 m_qwTeamId;\n\tUINT64 m_qwPlayerId;\n};\n\nclass RedisDelPlayerTeamId : public IRedisQuery\n{\npublic:\n\tRedisDelPlayerTeamId(UINT64 qwPlayerId) : m_qwPlayerId(qwPlayerId) {}\n\t~RedisDelPlayerTeamId() {}\n\n\tvirtual int\t\t\t\t\tGetDBId(void) { return 0; }\n\tvirtual void\t\t\t\tOnQuery(IRedisConnection *poDBConnection)\n\t{\n\t\tchar szQuery[64] = { 0 };\n\t\tsprintf(szQuery, \"DEL %llu_%s\", m_qwPlayerId, RedisConstant::szPlayerTeamId);\n\t\tpoDBConnection->Query(szQuery);\n\t}\n\tvirtual void OnResult(void) { }\n\tvirtual void Release(void) { }\n\nprivate:\n\tUINT64 m_qwPlayerId;\n};\n\nCGameSceneBase::CGameSceneBase()\n{\n}\n\n\nCGameSceneBase::~CGameSceneBase()\n{\n}\n\nbool CGameSceneBase::Init(unsigned int dwGameType, std::string szRoles, UINT64 qwTeamId)\n{\n\tswitch ((GameProto::EGameType)(dwGameType))\n\t{\n\t\tcase GameProto::GT_Common:\n\t\t{\n\t\t\tif (CreateInstance(new CGameSceneCommon) == false)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\tbreak;\n\t\tdefault:\n\t\t\treturn false;\n\t}\n\tJson::Value jRoles;\n\tJson::Reader jReader;\n\n\tif (!jReader.parse(szRoles, jRoles))\n\t{\n\t\treturn false;\n\t}\n\tif (!jRoles.isArray())\n\t{\n\t\treturn false;\n\t}\n\tif (jRoles.size() > MAXCLIENTNUM)\n\t{\n\t\tAssert(0);\n\t}\n\tfor (int i = 0; i < jRoles.size(); ++i)\n\t{\n\t\tInstance()->m_qwRoles[i] = jRoles[i].asInt64();\n\t\tif (Instance()->m_qwRoles[i])\n\t\t{\n\t\t\tRedisSetPlayerTeamId oRedisSetPlayerTeamId(qwTeamId, Instance()->m_qwRoles[i]);\n\t\t\tFxRedisGetModule()->QueryDirect(&oRedisSetPlayerTeamId);\n\t\t}\n\t}\n\n\tInstance()->m_dwGameType = dwGameType;\n\tInstance()->m_qwTeamId = qwTeamId;\n\tInstance()->m_dwGameStartTime = GetTimeHandler()->GetSecond();\n\treturn Instance()->Init();\n}\n\nvoid CGameSceneBase::Run(double fTime)\n{\n\tswitch (GetSceneState())\n\t{\n\t\tcase GameProto::ESS_None: break;\n\t\tcase GameProto::ESS_Prepare: { Preparing(fTime); } break;\n\t\tcase GameProto::ESS_GameReady: { GameReady(fTime); } break;\n\t\tcase GameProto::ESS_Gaming: { Gaming(fTime); } break;\n\t\tcase GameProto::ESS_Transact: { Transacting(fTime); } break;\n\t\tdefault: {Assert(0); } break;\n\t}\n}\n\nvoid CGameSceneBase::Preparing(double fTime)\n{\n\tstatic UINT32 s_dwNotifyTime = m_dwGameStartTime + 5;\n\n\tINT32 dwLeftTime = m_dwGameStartTime + CGameConfigBase::Instance()->GetPrepareTime() - GetTimeHandler()->GetSecond();\n\tif (dwLeftTime < 0)\n\t{\n\t\tChangeState(GameProto::ESS_GameReady);\n\t\treturn;\n\t}\n\tGameProto::GameNotifyPlayerPrepareTime oNotify;\n\toNotify.set_dw_left_time(dwLeftTime);\n\tif (GetTimeHandler()->GetSecond() >= s_dwNotifyTime)\n\t{\n\t\tNotifyPlayer(oNotify);\n\n\t\t\/\/֪ͨͻƵ 5 ÿһ ǰ 5һ\n\t\tif (s_dwNotifyTime >= m_dwGameStartTime + CGameConfigBase::Instance()->GetPrepareTime() - 5)\n\t\t{\n\t\t\ts_dwNotifyTime += 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ts_dwNotifyTime += 5;\n\t\t}\n\t}\n}\n\nvoid CGameSceneBase::GameReady(double fTime)\n{\n\tstatic UINT32 s_dwNotifyTime = m_dwGameStartTime + CGameConfigBase::Instance()->GetPrepareTime() + 1;\n\n\tINT32 dwLeftTime = m_dwGameStartTime + CGameConfigBase::Instance()->GetPrepareTime() + CGameConfigBase::Instance()->GetGameReadyTime() - GetTimeHandler()->GetSecond();\n\tif (dwLeftTime < 0)\n\t{\n\t\tChangeState(GameProto::ESS_Gaming);\n\t\treturn;\n\t}\n\tGameProto::GameNotifyPlayerGameReadyTime oNotify;\n\toNotify.set_dw_left_time(dwLeftTime);\n\tif (GetTimeHandler()->GetSecond() >= s_dwNotifyTime)\n\t{\n\t\tNotifyPlayer(oNotify);\n\t\ts_dwNotifyTime += 1;\n\t}\n}\n\nvoid CGameSceneBase::Gaming(double fTime)\n{\n\n}\n\nvoid CGameSceneBase::Transacting(double fTime)\n{\n\n}\n\nvoid CGameSceneBase::OnPrepare()\n{\n}\n\nvoid CGameSceneBase::OnGameReady()\n{\n}\n\nvoid CGameSceneBase::OnGameStart()\n{\n}\n\nvoid CGameSceneBase::OnTransact()\n{\n}\n\nvoid CGameSceneBase::GameEnd()\n{\n\tLogExe(LogLv_Debug, \"%s\", \"game end~~~~~\");\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tif (m_qwRoles[i])\n\t\t{\n\t\t\tRedisDelPlayerTeamId oRedisDelPlayerTeamId(m_qwRoles[i]);\n\t\t\tFxRedisGetModule()->QueryDirect(&oRedisDelPlayerTeamId);\n\t\t}\n\t}\n}\n\nvoid CGameSceneBase::NotifyPlayer(google::protobuf::Message& refMsg)\n{\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tCPlayerBase* pPlayerBase = GetPlayer(m_qwRoles[i]);\n\t\tif (!pPlayerBase)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tif (!pPlayerBase->GetPlayerSession())\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tchar* pBuf = NULL;\n\t\tunsigned int dwBufLen = 0;\n\t\tProtoUtility::MakeProtoSendBuffer(refMsg, pBuf, dwBufLen);\n\t\tpPlayerBase->GetPlayerSession()->Send(pBuf, dwBufLen);\n\t}\n}\n\nvoid CGameSceneBase::NotifyPlayerExcept(google::protobuf::Message& refMsg, UINT64 qwPlayerId)\n{\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tif (m_qwRoles[i] == qwPlayerId)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tCPlayerBase* pPlayerBase = GetPlayer(m_qwRoles[i]);\n\t\tif (!pPlayerBase)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tif (!pPlayerBase->GetPlayerSession())\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tchar* pBuf = NULL;\n\t\tunsigned int dwBufLen = 0;\n\t\tProtoUtility::MakeProtoSendBuffer(refMsg, pBuf, dwBufLen);\n\t\tpPlayerBase->GetPlayerSession()->Send(pBuf, dwBufLen);\n\t}\n}\n\nvoid CGameSceneBase::ChangeState(GameProto::EGameSceneState eGameSceneState)\n{\n\tLogExe(LogLv_Info, \"game change state : %d\", (int)eGameSceneState);\n\tSetSceneState(eGameSceneState);\n\n\tGameProto::GameNotifyPlayerGameState oNotify;\n\toNotify.set_state(eGameSceneState);\n\tNotifyPlayer(oNotify);\n\n\tswitch (GetSceneState())\n\t{\n\t\tcase GameProto::ESS_Prepare: OnPrepare(); break;\n\t\tcase GameProto::ESS_GameReady: OnGameReady(); break;\n\t\tcase GameProto::ESS_Gaming: OnGameStart(); break;\n\t\tcase GameProto::ESS_Transact: OnTransact(); break;\n\t\tdefault:Assert(0); break;\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCGameSceneCommon::CGameSceneCommon()\n{\n\tSetSceneState(GameProto::ESS_None);\n}\n\nCGameSceneCommon::~CGameSceneCommon()\n{\n}\n\nbool CGameSceneCommon::Init()\n{\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tif (m_qwRoles[i] != 0)\n\t\t{\n\t\t\tm_mapPlayers[m_qwRoles[i]].SetPlayerSession(NULL);\n\t\t\tm_mapPlayers[m_qwRoles[i]].SetPlayerId(m_qwRoles[i]);\n\t\t}\n\t}\n\tChangeState(GameProto::ESS_Prepare);\n\treturn true;\n}\n\nCPlayerBase* CGameSceneCommon::GetPlayer(UINT64 qwPlayerId)\n{\n\tstd::map<UINT64, CCommonPlayer>::iterator it = m_mapPlayers.find(qwPlayerId);\n\tif (it == m_mapPlayers.end())\n\t{\n\t\treturn NULL;\n\t}\n\treturn &(it->second);\n}\n\nvoid CGameSceneCommon::OnGameStart()\n{\n\tfor (std::map<UINT64, CCommonPlayer>::iterator it = m_mapPlayers.begin();\n\t\tit != m_mapPlayers.end(); ++it)\n\t{\n\t\tit->second.Init();\n\t}\n}\n\nvoid CGameSceneCommon::Gaming(double fTime)\n{\n\tfor (std::map<UINT64, CCommonPlayer>::iterator it = m_mapPlayers.begin();\n\t\tit != m_mapPlayers.end(); ++it)\n\t{\n\t\tit->second.Update(fTime);\n\t}\n}\n\nGameProto::EGameSceneState CGameSceneCommon::GetSceneState()\n{\n\treturn m_oSceneInfo.mutable_scene_info()->state();\n}\n\nvoid CGameSceneCommon::FillProtoScene(GameProto::GameNotifyPlayerGameSceneInfo& refInfo)\n{\n\trefInfo.set_dw_game_type(m_dwGameType);\n\t*(refInfo.mutable_common_scene_info()) = m_oSceneInfo;\n\n\tfor (int i = 0; i < MAXCLIENTNUM; ++i)\n\t{\n\t\tGameProto::RoleData* pData = refInfo.add_players();\n\t\tif (m_qwRoles[i] != 0)\n\t\t{\n\t\t\tm_mapPlayers[m_qwRoles[i]].FillPlayerData(*pData);\n\t\t}\n\t}\n}\n\nvoid CGameSceneCommon::SetSceneState(GameProto::EGameSceneState eGameSceneState)\n{\n\tm_oSceneInfo.mutable_scene_info()->set_state(eGameSceneState);\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 \"Dialog.h\"\n\n#include \"..\/..\/3RVX\/Logger.h\"\n#include \"..\/UITranslator.h\"\n#include \"Control.h\"\n\nDialog::Dialog() {\n\n}\n\nDialog::Dialog(HWND parent, LPCWSTR dlgTemplate) :\n_parent(parent) {\n    _dlgHwnd = CreateDialogParam(\n        NULL,\n        dlgTemplate,\n        parent,\n        StaticDialogProc,\n        (LPARAM) this);\n\n    if (_dlgHwnd == NULL) {\n        Logger::LogLastError();\n    }\n}\n\nvoid Dialog::Show() {\n    DialogBoxParam(NULL, _template, _parent, StaticDialogProc, (LPARAM) this);\n    UITranslator::TranslateWindowText(_dlgHwnd);\n}\n\nvoid Dialog::AddControl(Control *control) {\n    if (control == nullptr) {\n        return;\n    }\n\n    int id = control->ID();\n    _controlMap[id] = control;\n}\n\nHWND Dialog::DialogHandle() {\n    return _dlgHwnd;\n}\n\nHWND Dialog::ParentHandle() {\n    return _parent;\n}\n\nINT_PTR Dialog::StaticDialogProc(\n        HWND hwndDlg, UINT uMsg, WPARAM wParam, LPARAM lParam) {\n    Dialog *dlg;\n\n    if (uMsg == WM_INITDIALOG) {\n        dlg = (Dialog *) lParam;\n        SetWindowLongPtr(hwndDlg, DWLP_USER, (LONG_PTR) dlg);\n    } else {\n        dlg = (Dialog *) GetWindowLongPtr(hwndDlg, DWLP_USER);\n        if (!dlg) {\n            return FALSE;\n        }\n    }\n\n    return dlg->DialogProc(hwndDlg, uMsg, wParam, lParam);\n}\n\nINT_PTR Dialog::DialogProc(HWND hwndDlg, UINT uMsg,\n        WPARAM wParam, LPARAM lParam) {\n\n    unsigned short nCode, ctrlId;\n\n    switch (uMsg) {\n    case WM_INITDIALOG:\n        _dlgHwnd = hwndDlg;\n        return FALSE;\n\n    case WM_COMMAND:\n        nCode = HIWORD(wParam);\n        ctrlId = LOWORD(wParam);\n        if (_controlMap.count(ctrlId) > 0) {\n            return _controlMap[ctrlId]->Command(nCode);\n        } else {\n            return FALSE;\n        }\n\n    case WM_NOTIFY: {\n        NMHDR *nHdr = (NMHDR *) lParam;\n        ctrlId = nHdr->idFrom;\n        if (_controlMap.count(ctrlId) > 0) {\n            return _controlMap[ctrlId]->Notification(nHdr);\n        } else {\n            return FALSE;\n        }\n    }\n\n    case WM_HSCROLL:\n    case WM_VSCROLL: {\n        WORD request = LOWORD(wParam);\n        WORD position = HIWORD(wParam);\n        HWND scrollHandle = (HWND) lParam;\n        ctrlId = GetDlgCtrlID(scrollHandle);\n\n        if (_controlMap.count(ctrlId) > 0) {\n            return _controlMap[ctrlId]->Scroll(\n                (uMsg == WM_HSCROLL), request, position);\n        } else {\n            return FALSE;\n        }\n    }\n    }\n\n    return FALSE;\n}\n<commit_msg>Comment out old dialog constructor for now<commit_after>\/\/ Copyright (c) 2015, Matthew Malensek.\n\/\/ Distributed under the BSD 2-Clause License (see LICENSE.txt for details)\n\n#include \"Dialog.h\"\n\n#include \"..\/..\/3RVX\/Logger.h\"\n#include \"..\/UITranslator.h\"\n#include \"Control.h\"\n\nDialog::Dialog() {\n\n}\n\nDialog::Dialog(HWND parent, LPCWSTR dlgTemplate) :\n_parent(parent),\n_template(dlgTemplate) {\n\/\/    _dlgHwnd = CreateDialogParam(\n\/\/        NULL,\n\/\/        dlgTemplate,\n\/\/        parent,\n\/\/        StaticDialogProc,\n\/\/        (LPARAM) this);\n\n\/\/    if (_dlgHwnd == NULL) {\n\/\/        Logger::LogLastError();\n\/\/    }\n\n\/\/    UITranslator::TranslateWindowText(_dlgHwnd);\n}\n\nvoid Dialog::Show() {\n    DialogBoxParam(NULL, _template, _parent, StaticDialogProc, (LPARAM) this);\n    UITranslator::TranslateWindowText(_dlgHwnd);\n}\n\nvoid Dialog::AddControl(Control *control) {\n    if (control == nullptr) {\n        return;\n    }\n\n    int id = control->ID();\n    _controlMap[id] = control;\n}\n\nHWND Dialog::DialogHandle() {\n    return _dlgHwnd;\n}\n\nHWND Dialog::ParentHandle() {\n    return _parent;\n}\n\nINT_PTR Dialog::StaticDialogProc(\n        HWND hwndDlg, UINT uMsg, WPARAM wParam, LPARAM lParam) {\n    Dialog *dlg;\n\n    if (uMsg == WM_INITDIALOG) {\n        dlg = (Dialog *) lParam;\n        SetWindowLongPtr(hwndDlg, DWLP_USER, (LONG_PTR) dlg);\n    } else {\n        dlg = (Dialog *) GetWindowLongPtr(hwndDlg, DWLP_USER);\n        if (!dlg) {\n            return FALSE;\n        }\n    }\n\n    return dlg->DialogProc(hwndDlg, uMsg, wParam, lParam);\n}\n\nINT_PTR Dialog::DialogProc(HWND hwndDlg, UINT uMsg,\n        WPARAM wParam, LPARAM lParam) {\n\n    unsigned short nCode, ctrlId;\n\n    switch (uMsg) {\n    case WM_INITDIALOG:\n        _dlgHwnd = hwndDlg;\n        return FALSE;\n\n    case WM_COMMAND:\n        nCode = HIWORD(wParam);\n        ctrlId = LOWORD(wParam);\n        if (_controlMap.count(ctrlId) > 0) {\n            return _controlMap[ctrlId]->Command(nCode);\n        } else {\n            return FALSE;\n        }\n\n    case WM_NOTIFY: {\n        NMHDR *nHdr = (NMHDR *) lParam;\n        ctrlId = nHdr->idFrom;\n        if (_controlMap.count(ctrlId) > 0) {\n            return _controlMap[ctrlId]->Notification(nHdr);\n        } else {\n            return FALSE;\n        }\n    }\n\n    case WM_HSCROLL:\n    case WM_VSCROLL: {\n        WORD request = LOWORD(wParam);\n        WORD position = HIWORD(wParam);\n        HWND scrollHandle = (HWND) lParam;\n        ctrlId = GetDlgCtrlID(scrollHandle);\n\n        if (_controlMap.count(ctrlId) > 0) {\n            return _controlMap[ctrlId]->Scroll(\n                (uMsg == WM_HSCROLL), request, position);\n        } else {\n            return FALSE;\n        }\n    }\n    }\n\n    return FALSE;\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#ifndef INCLUDED_OSL_SOCKET_HXX\n#define INCLUDED_OSL_SOCKET_HXX\n\n#include <osl\/socket_decl.hxx>\n\nnamespace osl\n{\n\n    inline SocketAddr::SocketAddr()\n        : m_handle( osl_createEmptySocketAddr( osl_Socket_FamilyInet ) )\n    {}\n\n\n    inline SocketAddr::SocketAddr(const SocketAddr& Addr)\n        : m_handle( osl_copySocketAddr( Addr.m_handle ) )\n    {\n    }\n\n\n    inline SocketAddr::SocketAddr(oslSocketAddr Addr)\n        : m_handle( osl_copySocketAddr( Addr ) )\n    {\n    }\n\n\n    inline SocketAddr::SocketAddr(oslSocketAddr Addr, __osl_socket_NoCopy )\n        : m_handle( Addr )\n    {\n    }\n\n\n    inline SocketAddr::SocketAddr( const ::rtl::OUString& strAddrOrHostName, sal_Int32 nPort)\n        : m_handle( osl_createInetSocketAddr( strAddrOrHostName.pData, nPort ) )\n    {\n        if(! m_handle )\n        {\n            m_handle = osl_resolveHostname(strAddrOrHostName.pData);\n\n            \/\/ host found?\n            if(m_handle)\n            {\n                osl_setInetPortOfSocketAddr(m_handle, nPort);\n            }\n            else\n            {\n                osl_destroySocketAddr( m_handle );\n                m_handle = 0;\n            }\n        }\n    }\n\n\n    inline SocketAddr::~SocketAddr()\n    {\n        if( m_handle )\n            osl_destroySocketAddr( m_handle );\n    }\n\n\n    inline ::rtl::OUString SocketAddr::getHostname( oslSocketResult *pResult ) const\n    {\n        ::rtl::OUString hostname;\n        oslSocketResult result = osl_getHostnameOfSocketAddr( m_handle, &(hostname.pData) );\n        if( pResult )\n            *pResult = result;\n        return hostname;\n    }\n\n\n    inline sal_Int32 SAL_CALL SocketAddr::getPort() const\n    {\n        return osl_getInetPortOfSocketAddr(m_handle);\n    }\n\n\n    inline bool SAL_CALL SocketAddr::setPort( sal_Int32 nPort )\n    {\n        return osl_setInetPortOfSocketAddr(m_handle, nPort );\n    }\n\n    inline bool SAL_CALL SocketAddr::setHostname( const ::rtl::OUString &sDottedIpOrHostname )\n    {\n        *this = SocketAddr( sDottedIpOrHostname , getPort() );\n        return is();\n    }\n\n\n    inline bool SAL_CALL SocketAddr::setAddr( const ::rtl::ByteSequence & address )\n    {\n        return osl_setAddrOfSocketAddr( m_handle, address.getHandle() )\n            == osl_Socket_Ok;\n    }\n\n    inline ::rtl::ByteSequence SAL_CALL SocketAddr::getAddr( oslSocketResult *pResult ) const\n    {\n        ::rtl::ByteSequence sequence;\n        oslSocketResult result = osl_getAddrOfSocketAddr( m_handle,(sal_Sequence **) &sequence );\n        if( pResult )\n            *pResult = result;\n        return sequence;\n    }\n\n\n    inline SocketAddr & SAL_CALL SocketAddr::operator= (oslSocketAddr Addr)\n    {\n        oslSocketAddr pNewAddr = osl_copySocketAddr( Addr );\n        if( m_handle )\n            osl_destroySocketAddr( m_handle );\n        m_handle = pNewAddr;\n        return *this;\n    }\n\n\n    inline SocketAddr & SAL_CALL SocketAddr::operator= (const SocketAddr& Addr)\n    {\n        *this = (Addr.getHandle());\n        return *this;\n    }\n\n    inline SocketAddr & SAL_CALL SocketAddr::assign( oslSocketAddr Addr, __osl_socket_NoCopy )\n    {\n        if( m_handle )\n            osl_destroySocketAddr( m_handle );\n        m_handle = Addr;\n        return *this;\n    }\n\n\n    inline bool SAL_CALL SocketAddr::operator== (oslSocketAddr Addr) const\n    {\n        return osl_isEqualSocketAddr( m_handle, Addr );\n    }\n\n    inline oslSocketAddr SocketAddr::getHandle() const\n    {\n        return m_handle;\n    }\n\n\n    inline bool SocketAddr::is() const\n    {\n        return m_handle != 0;\n    }\n\n    \/\/ (static method)______________________________________________________________\n    inline ::rtl::OUString SAL_CALL SocketAddr::getLocalHostname( oslSocketResult *pResult )\n    {\n        ::rtl::OUString hostname;\n        oslSocketResult result = osl_getLocalHostname( &(hostname.pData) );\n        if(pResult )\n            *pResult = result;\n        return hostname;\n    }\n\n    \/\/ (static method)______________________________________________________________\n    inline void SAL_CALL SocketAddr::resolveHostname(\n        const ::rtl::OUString & strHostName, SocketAddr &Addr)\n    {\n        Addr = SocketAddr( osl_resolveHostname( strHostName.pData ) , SAL_NO_COPY );\n    }\n\n    \/\/ (static method)______________________________________________________________\n    inline sal_Int32 SAL_CALL SocketAddr::getServicePort(\n            const ::rtl::OUString& strServiceName,\n            const ::rtl::OUString & strProtocolName )\n    {\n        return osl_getServicePort( strServiceName.pData, strProtocolName.pData );\n    }\n\n\n    inline Socket::Socket(oslSocketType Type,\n                          oslAddrFamily Family,\n                          oslProtocol   Protocol)\n        : m_handle( osl_createSocket(Family, Type, Protocol) )\n    {}\n\n\n    inline Socket::Socket( oslSocket socketHandle, __sal_NoAcquire )\n        : m_handle( socketHandle )\n    {}\n\n\n    inline Socket::Socket( oslSocket socketHandle )\n        : m_handle( socketHandle )\n    {\n        osl_acquireSocket( m_handle );\n    }\n\n\n    inline Socket::Socket( const Socket & socket )\n        : m_handle( socket.getHandle() )\n    {\n        osl_acquireSocket( m_handle );\n    }\n\n\n    inline Socket::~Socket()\n    {\n        osl_releaseSocket( m_handle );\n    }\n\n\n    inline Socket& Socket::operator= ( oslSocket socketHandle)\n    {\n        osl_acquireSocket( socketHandle );\n        osl_releaseSocket( m_handle );\n        m_handle = socketHandle;\n        return *this;\n    }\n\n\n    inline Socket&  Socket::operator= (const Socket& sock)\n    {\n        return (*this) = sock.getHandle();\n    }\n\n\n    inline bool Socket::operator==( const Socket& rSocket ) const\n    {\n        return m_handle == rSocket.getHandle();\n    }\n\n\n    inline bool Socket::operator==( const oslSocket socketHandle ) const\n    {\n        return m_handle == socketHandle;\n    }\n\n\n    inline void Socket::shutdown( oslSocketDirection Direction )\n    {\n        osl_shutdownSocket( m_handle , Direction );\n    }\n\n\n    inline void Socket::close()\n    {\n        osl_closeSocket( m_handle );\n    }\n\n\n    inline void Socket::getLocalAddr( SocketAddr & addr) const\n    {\n        addr.assign( osl_getLocalAddrOfSocket( m_handle ) , SAL_NO_COPY );\n    }\n\n\n    inline sal_Int32 Socket::getLocalPort() const\n    {\n        SocketAddr addr( 0 );\n        getLocalAddr( addr );\n        return addr.getPort();\n    }\n\n\n    inline ::rtl::OUString Socket::getLocalHost() const\n    {\n        SocketAddr addr( 0 );\n        getLocalAddr( addr );\n        return addr.getHostname();\n    }\n\n\n    inline void Socket::getPeerAddr( SocketAddr &addr ) const\n    {\n        addr.assign( osl_getPeerAddrOfSocket( m_handle ), SAL_NO_COPY );\n    }\n\n\n    inline sal_Int32 Socket::getPeerPort() const\n    {\n        SocketAddr addr( 0 );\n        getPeerAddr( addr );\n        return addr.getPort();\n    }\n\n\n    inline ::rtl::OUString Socket::getPeerHost() const\n    {\n        SocketAddr addr( 0 );\n        getPeerAddr( addr );\n        return addr.getHostname();\n    }\n\n\n    inline bool Socket::bind(const SocketAddr& LocalInterface)\n    {\n        return osl_bindAddrToSocket( m_handle , LocalInterface.getHandle() );\n    }\n\n\n    inline bool Socket::isRecvReady(const TimeValue *pTimeout ) const\n    {\n        return osl_isReceiveReady( m_handle , pTimeout );\n    }\n\n\n    inline bool Socket::isSendReady(const TimeValue *pTimeout ) const\n    {\n        return osl_isSendReady( m_handle, pTimeout );\n    }\n\n\n    inline bool Socket::isExceptionPending(const TimeValue *pTimeout ) const\n    {\n        return osl_isExceptionPending( m_handle, pTimeout );\n    }\n\n\n    inline oslSocketType Socket::getType() const\n    {\n        return osl_getSocketType( m_handle );\n    }\n\n\n    inline sal_Int32  Socket::getOption(\n        oslSocketOption Option,\n        void* pBuffer,\n        sal_uInt32 BufferLen,\n        oslSocketOptionLevel Level) const\n    {\n        return osl_getSocketOption( m_handle, Level, Option, pBuffer , BufferLen );\n    }\n\n\n    inline bool Socket::setOption(  oslSocketOption Option,\n                                        void* pBuffer,\n                                        sal_uInt32 BufferLen,\n                                        oslSocketOptionLevel Level ) const\n    {\n        return osl_setSocketOption( m_handle, Level, Option , pBuffer, BufferLen );\n    }\n\n\n    inline bool Socket::setOption( oslSocketOption option, sal_Int32 nValue  )\n    {\n        return setOption( option, &nValue, sizeof( nValue ) );\n    }\n\n\n    inline sal_Int32 Socket::getOption( oslSocketOption option ) const\n    {\n        sal_Int32 n;\n        getOption( option, &n, sizeof( n ) );\n        return n;\n    }\n\n\n    inline bool Socket::enableNonBlockingMode( bool bNonBlockingMode)\n    {\n        return osl_enableNonBlockingMode( m_handle , bNonBlockingMode );\n    }\n\n\n    inline bool Socket::isNonBlockingMode() const\n    {\n        return osl_isNonBlockingMode( m_handle );\n    }\n\n\n    inline void SAL_CALL Socket::clearError() const\n    {\n        sal_Int32 err = 0;\n        getOption(osl_Socket_OptionError, &err, sizeof(err));\n    }\n\n\n    inline oslSocketError Socket::getError() const\n    {\n        return osl_getLastSocketError( m_handle );\n    }\n\n\n    inline ::rtl::OUString Socket::getErrorAsString( ) const\n    {\n        ::rtl::OUString error;\n        osl_getLastSocketErrorDescription( m_handle, &(error.pData) );\n        return error;\n    }\n\n\n    inline oslSocket Socket::getHandle() const\n    {\n        return m_handle;\n    }\n\n\n    inline StreamSocket::StreamSocket(oslAddrFamily Family,\n                                      oslProtocol Protocol,\n                                      oslSocketType Type )\n        : Socket( Type, Family, Protocol )\n    {}\n\n\n    inline StreamSocket::StreamSocket( oslSocket socketHandle, __sal_NoAcquire noacquire )\n        : Socket( socketHandle, noacquire )\n    {}\n\n\n    inline StreamSocket::StreamSocket( oslSocket socketHandle )\n        : Socket( socketHandle )\n    {}\n\n\n    inline StreamSocket::StreamSocket( const StreamSocket & socket )\n        : Socket( socket )\n    {}\n\n\n    inline sal_Int32 StreamSocket::read(void* pBuffer, sal_uInt32 n)\n    {\n        return osl_readSocket( m_handle, pBuffer, n );\n    }\n\n\n    inline sal_Int32 StreamSocket::write(const void* pBuffer, sal_uInt32 n)\n    {\n        return osl_writeSocket( m_handle, pBuffer, n );\n    }\n\n\n\n    inline sal_Int32 StreamSocket::recv(void* pBuffer,\n                                        sal_uInt32 BytesToRead,\n                                        oslSocketMsgFlag Flag)\n    {\n        return osl_receiveSocket( m_handle, pBuffer,BytesToRead, Flag );\n    }\n\n\n    inline sal_Int32 StreamSocket::send(const void* pBuffer,\n                                        sal_uInt32 BytesToSend,\n                                        oslSocketMsgFlag Flag)\n    {\n        return osl_sendSocket( m_handle, pBuffer, BytesToSend, Flag );\n    }\n\n\n      inline ConnectorSocket::ConnectorSocket(oslAddrFamily Family,\n                                            oslProtocol Protocol,\n                                            oslSocketType   Type)\n        : StreamSocket( Family, Protocol ,Type )\n    {}\n\n\n    inline oslSocketResult ConnectorSocket::connect( const SocketAddr& TargetHost,\n                                                     const TimeValue* pTimeout )\n    {\n        return osl_connectSocketTo( m_handle , TargetHost.getHandle(), pTimeout );\n    }\n\n\n    inline AcceptorSocket::AcceptorSocket(oslAddrFamily Family ,\n                                          oslProtocol   Protocol ,\n                                          oslSocketType Type )\n        : Socket( Type, Family, Protocol )\n    {}\n\n\n    inline bool AcceptorSocket::listen(sal_Int32 MaxPendingConnections)\n    {\n        return osl_listenOnSocket( m_handle, MaxPendingConnections );\n    }\n\n\n    inline oslSocketResult AcceptorSocket::acceptConnection( StreamSocket& Connection)\n    {\n        oslSocket o = osl_acceptConnectionOnSocket( m_handle, 0 );\n        oslSocketResult status = osl_Socket_Ok;\n        if( o )\n        {\n            Connection = StreamSocket( o , SAL_NO_ACQUIRE );\n        }\n        else\n        {\n            Connection = StreamSocket();\n            status = osl_Socket_Error;\n        }\n        return status;\n    }\n\n\n    inline oslSocketResult AcceptorSocket::acceptConnection(\n        StreamSocket&   Connection, SocketAddr & PeerAddr)\n    {\n        \/\/ TODO change in\/OUT parameter\n        oslSocket o = osl_acceptConnectionOnSocket( m_handle, (oslSocketAddr *)&PeerAddr );\n        oslSocketResult status = osl_Socket_Ok;\n        if( o )\n        {\n            Connection = StreamSocket( o , SAL_NO_ACQUIRE );\n        }\n        else\n        {\n            Connection = StreamSocket();\n            status = osl_Socket_Error;\n        }\n        return status;\n    }\n\n\n    inline DatagramSocket::DatagramSocket(oslAddrFamily Family,\n                                          oslProtocol   Protocol,\n                                          oslSocketType Type)\n        : Socket( Type, Family, Protocol )\n    {}\n\n\n    inline sal_Int32 DatagramSocket::recvFrom(void*  pBuffer,\n                                              sal_uInt32 BufferSize,\n                                              SocketAddr* pSenderAddr,\n                                              oslSocketMsgFlag Flag )\n    {\n        sal_Int32 nByteRead;\n        if( pSenderAddr )\n        {\n            \/\/ TODO : correct the out-parameter pSenderAddr outparameter\n              nByteRead = osl_receiveFromSocket( m_handle, pSenderAddr->getHandle() , pBuffer,\n                                                 BufferSize, Flag);\n\/\/              nByteRead = osl_receiveFromSocket( m_handle, *(oslSocketAddr**) &pSenderAddr , pBuffer,\n\/\/                                                 BufferSize, Flag);\n        }\n        else\n        {\n            nByteRead = osl_receiveFromSocket( m_handle, 0 , pBuffer , BufferSize ,  Flag );\n        }\n        return nByteRead;\n    }\n\n\n    inline sal_Int32  DatagramSocket::sendTo( const SocketAddr& ReceiverAddr,\n                                              const void* pBuffer,\n                                              sal_uInt32 BufferSize,\n                                              oslSocketMsgFlag Flag )\n    {\n        return osl_sendToSocket( m_handle, ReceiverAddr.getHandle(), pBuffer, BufferSize, Flag );\n    }\n}\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>loplugin:cstylecast, involving pointer to incomplete type<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#ifndef INCLUDED_OSL_SOCKET_HXX\n#define INCLUDED_OSL_SOCKET_HXX\n\n#include <osl\/socket_decl.hxx>\n\nnamespace osl\n{\n\n    inline SocketAddr::SocketAddr()\n        : m_handle( osl_createEmptySocketAddr( osl_Socket_FamilyInet ) )\n    {}\n\n\n    inline SocketAddr::SocketAddr(const SocketAddr& Addr)\n        : m_handle( osl_copySocketAddr( Addr.m_handle ) )\n    {\n    }\n\n\n    inline SocketAddr::SocketAddr(oslSocketAddr Addr)\n        : m_handle( osl_copySocketAddr( Addr ) )\n    {\n    }\n\n\n    inline SocketAddr::SocketAddr(oslSocketAddr Addr, __osl_socket_NoCopy )\n        : m_handle( Addr )\n    {\n    }\n\n\n    inline SocketAddr::SocketAddr( const ::rtl::OUString& strAddrOrHostName, sal_Int32 nPort)\n        : m_handle( osl_createInetSocketAddr( strAddrOrHostName.pData, nPort ) )\n    {\n        if(! m_handle )\n        {\n            m_handle = osl_resolveHostname(strAddrOrHostName.pData);\n\n            \/\/ host found?\n            if(m_handle)\n            {\n                osl_setInetPortOfSocketAddr(m_handle, nPort);\n            }\n            else\n            {\n                osl_destroySocketAddr( m_handle );\n                m_handle = 0;\n            }\n        }\n    }\n\n\n    inline SocketAddr::~SocketAddr()\n    {\n        if( m_handle )\n            osl_destroySocketAddr( m_handle );\n    }\n\n\n    inline ::rtl::OUString SocketAddr::getHostname( oslSocketResult *pResult ) const\n    {\n        ::rtl::OUString hostname;\n        oslSocketResult result = osl_getHostnameOfSocketAddr( m_handle, &(hostname.pData) );\n        if( pResult )\n            *pResult = result;\n        return hostname;\n    }\n\n\n    inline sal_Int32 SAL_CALL SocketAddr::getPort() const\n    {\n        return osl_getInetPortOfSocketAddr(m_handle);\n    }\n\n\n    inline bool SAL_CALL SocketAddr::setPort( sal_Int32 nPort )\n    {\n        return osl_setInetPortOfSocketAddr(m_handle, nPort );\n    }\n\n    inline bool SAL_CALL SocketAddr::setHostname( const ::rtl::OUString &sDottedIpOrHostname )\n    {\n        *this = SocketAddr( sDottedIpOrHostname , getPort() );\n        return is();\n    }\n\n\n    inline bool SAL_CALL SocketAddr::setAddr( const ::rtl::ByteSequence & address )\n    {\n        return osl_setAddrOfSocketAddr( m_handle, address.getHandle() )\n            == osl_Socket_Ok;\n    }\n\n    inline ::rtl::ByteSequence SAL_CALL SocketAddr::getAddr( oslSocketResult *pResult ) const\n    {\n        ::rtl::ByteSequence sequence;\n        oslSocketResult result = osl_getAddrOfSocketAddr( m_handle,(sal_Sequence **) &sequence );\n        if( pResult )\n            *pResult = result;\n        return sequence;\n    }\n\n\n    inline SocketAddr & SAL_CALL SocketAddr::operator= (oslSocketAddr Addr)\n    {\n        oslSocketAddr pNewAddr = osl_copySocketAddr( Addr );\n        if( m_handle )\n            osl_destroySocketAddr( m_handle );\n        m_handle = pNewAddr;\n        return *this;\n    }\n\n\n    inline SocketAddr & SAL_CALL SocketAddr::operator= (const SocketAddr& Addr)\n    {\n        *this = (Addr.getHandle());\n        return *this;\n    }\n\n    inline SocketAddr & SAL_CALL SocketAddr::assign( oslSocketAddr Addr, __osl_socket_NoCopy )\n    {\n        if( m_handle )\n            osl_destroySocketAddr( m_handle );\n        m_handle = Addr;\n        return *this;\n    }\n\n\n    inline bool SAL_CALL SocketAddr::operator== (oslSocketAddr Addr) const\n    {\n        return osl_isEqualSocketAddr( m_handle, Addr );\n    }\n\n    inline oslSocketAddr SocketAddr::getHandle() const\n    {\n        return m_handle;\n    }\n\n\n    inline bool SocketAddr::is() const\n    {\n        return m_handle != 0;\n    }\n\n    \/\/ (static method)______________________________________________________________\n    inline ::rtl::OUString SAL_CALL SocketAddr::getLocalHostname( oslSocketResult *pResult )\n    {\n        ::rtl::OUString hostname;\n        oslSocketResult result = osl_getLocalHostname( &(hostname.pData) );\n        if(pResult )\n            *pResult = result;\n        return hostname;\n    }\n\n    \/\/ (static method)______________________________________________________________\n    inline void SAL_CALL SocketAddr::resolveHostname(\n        const ::rtl::OUString & strHostName, SocketAddr &Addr)\n    {\n        Addr = SocketAddr( osl_resolveHostname( strHostName.pData ) , SAL_NO_COPY );\n    }\n\n    \/\/ (static method)______________________________________________________________\n    inline sal_Int32 SAL_CALL SocketAddr::getServicePort(\n            const ::rtl::OUString& strServiceName,\n            const ::rtl::OUString & strProtocolName )\n    {\n        return osl_getServicePort( strServiceName.pData, strProtocolName.pData );\n    }\n\n\n    inline Socket::Socket(oslSocketType Type,\n                          oslAddrFamily Family,\n                          oslProtocol   Protocol)\n        : m_handle( osl_createSocket(Family, Type, Protocol) )\n    {}\n\n\n    inline Socket::Socket( oslSocket socketHandle, __sal_NoAcquire )\n        : m_handle( socketHandle )\n    {}\n\n\n    inline Socket::Socket( oslSocket socketHandle )\n        : m_handle( socketHandle )\n    {\n        osl_acquireSocket( m_handle );\n    }\n\n\n    inline Socket::Socket( const Socket & socket )\n        : m_handle( socket.getHandle() )\n    {\n        osl_acquireSocket( m_handle );\n    }\n\n\n    inline Socket::~Socket()\n    {\n        osl_releaseSocket( m_handle );\n    }\n\n\n    inline Socket& Socket::operator= ( oslSocket socketHandle)\n    {\n        osl_acquireSocket( socketHandle );\n        osl_releaseSocket( m_handle );\n        m_handle = socketHandle;\n        return *this;\n    }\n\n\n    inline Socket&  Socket::operator= (const Socket& sock)\n    {\n        return (*this) = sock.getHandle();\n    }\n\n\n    inline bool Socket::operator==( const Socket& rSocket ) const\n    {\n        return m_handle == rSocket.getHandle();\n    }\n\n\n    inline bool Socket::operator==( const oslSocket socketHandle ) const\n    {\n        return m_handle == socketHandle;\n    }\n\n\n    inline void Socket::shutdown( oslSocketDirection Direction )\n    {\n        osl_shutdownSocket( m_handle , Direction );\n    }\n\n\n    inline void Socket::close()\n    {\n        osl_closeSocket( m_handle );\n    }\n\n\n    inline void Socket::getLocalAddr( SocketAddr & addr) const\n    {\n        addr.assign( osl_getLocalAddrOfSocket( m_handle ) , SAL_NO_COPY );\n    }\n\n\n    inline sal_Int32 Socket::getLocalPort() const\n    {\n        SocketAddr addr( 0 );\n        getLocalAddr( addr );\n        return addr.getPort();\n    }\n\n\n    inline ::rtl::OUString Socket::getLocalHost() const\n    {\n        SocketAddr addr( 0 );\n        getLocalAddr( addr );\n        return addr.getHostname();\n    }\n\n\n    inline void Socket::getPeerAddr( SocketAddr &addr ) const\n    {\n        addr.assign( osl_getPeerAddrOfSocket( m_handle ), SAL_NO_COPY );\n    }\n\n\n    inline sal_Int32 Socket::getPeerPort() const\n    {\n        SocketAddr addr( 0 );\n        getPeerAddr( addr );\n        return addr.getPort();\n    }\n\n\n    inline ::rtl::OUString Socket::getPeerHost() const\n    {\n        SocketAddr addr( 0 );\n        getPeerAddr( addr );\n        return addr.getHostname();\n    }\n\n\n    inline bool Socket::bind(const SocketAddr& LocalInterface)\n    {\n        return osl_bindAddrToSocket( m_handle , LocalInterface.getHandle() );\n    }\n\n\n    inline bool Socket::isRecvReady(const TimeValue *pTimeout ) const\n    {\n        return osl_isReceiveReady( m_handle , pTimeout );\n    }\n\n\n    inline bool Socket::isSendReady(const TimeValue *pTimeout ) const\n    {\n        return osl_isSendReady( m_handle, pTimeout );\n    }\n\n\n    inline bool Socket::isExceptionPending(const TimeValue *pTimeout ) const\n    {\n        return osl_isExceptionPending( m_handle, pTimeout );\n    }\n\n\n    inline oslSocketType Socket::getType() const\n    {\n        return osl_getSocketType( m_handle );\n    }\n\n\n    inline sal_Int32  Socket::getOption(\n        oslSocketOption Option,\n        void* pBuffer,\n        sal_uInt32 BufferLen,\n        oslSocketOptionLevel Level) const\n    {\n        return osl_getSocketOption( m_handle, Level, Option, pBuffer , BufferLen );\n    }\n\n\n    inline bool Socket::setOption(  oslSocketOption Option,\n                                        void* pBuffer,\n                                        sal_uInt32 BufferLen,\n                                        oslSocketOptionLevel Level ) const\n    {\n        return osl_setSocketOption( m_handle, Level, Option , pBuffer, BufferLen );\n    }\n\n\n    inline bool Socket::setOption( oslSocketOption option, sal_Int32 nValue  )\n    {\n        return setOption( option, &nValue, sizeof( nValue ) );\n    }\n\n\n    inline sal_Int32 Socket::getOption( oslSocketOption option ) const\n    {\n        sal_Int32 n;\n        getOption( option, &n, sizeof( n ) );\n        return n;\n    }\n\n\n    inline bool Socket::enableNonBlockingMode( bool bNonBlockingMode)\n    {\n        return osl_enableNonBlockingMode( m_handle , bNonBlockingMode );\n    }\n\n\n    inline bool Socket::isNonBlockingMode() const\n    {\n        return osl_isNonBlockingMode( m_handle );\n    }\n\n\n    inline void SAL_CALL Socket::clearError() const\n    {\n        sal_Int32 err = 0;\n        getOption(osl_Socket_OptionError, &err, sizeof(err));\n    }\n\n\n    inline oslSocketError Socket::getError() const\n    {\n        return osl_getLastSocketError( m_handle );\n    }\n\n\n    inline ::rtl::OUString Socket::getErrorAsString( ) const\n    {\n        ::rtl::OUString error;\n        osl_getLastSocketErrorDescription( m_handle, &(error.pData) );\n        return error;\n    }\n\n\n    inline oslSocket Socket::getHandle() const\n    {\n        return m_handle;\n    }\n\n\n    inline StreamSocket::StreamSocket(oslAddrFamily Family,\n                                      oslProtocol Protocol,\n                                      oslSocketType Type )\n        : Socket( Type, Family, Protocol )\n    {}\n\n\n    inline StreamSocket::StreamSocket( oslSocket socketHandle, __sal_NoAcquire noacquire )\n        : Socket( socketHandle, noacquire )\n    {}\n\n\n    inline StreamSocket::StreamSocket( oslSocket socketHandle )\n        : Socket( socketHandle )\n    {}\n\n\n    inline StreamSocket::StreamSocket( const StreamSocket & socket )\n        : Socket( socket )\n    {}\n\n\n    inline sal_Int32 StreamSocket::read(void* pBuffer, sal_uInt32 n)\n    {\n        return osl_readSocket( m_handle, pBuffer, n );\n    }\n\n\n    inline sal_Int32 StreamSocket::write(const void* pBuffer, sal_uInt32 n)\n    {\n        return osl_writeSocket( m_handle, pBuffer, n );\n    }\n\n\n\n    inline sal_Int32 StreamSocket::recv(void* pBuffer,\n                                        sal_uInt32 BytesToRead,\n                                        oslSocketMsgFlag Flag)\n    {\n        return osl_receiveSocket( m_handle, pBuffer,BytesToRead, Flag );\n    }\n\n\n    inline sal_Int32 StreamSocket::send(const void* pBuffer,\n                                        sal_uInt32 BytesToSend,\n                                        oslSocketMsgFlag Flag)\n    {\n        return osl_sendSocket( m_handle, pBuffer, BytesToSend, Flag );\n    }\n\n\n      inline ConnectorSocket::ConnectorSocket(oslAddrFamily Family,\n                                            oslProtocol Protocol,\n                                            oslSocketType   Type)\n        : StreamSocket( Family, Protocol ,Type )\n    {}\n\n\n    inline oslSocketResult ConnectorSocket::connect( const SocketAddr& TargetHost,\n                                                     const TimeValue* pTimeout )\n    {\n        return osl_connectSocketTo( m_handle , TargetHost.getHandle(), pTimeout );\n    }\n\n\n    inline AcceptorSocket::AcceptorSocket(oslAddrFamily Family ,\n                                          oslProtocol   Protocol ,\n                                          oslSocketType Type )\n        : Socket( Type, Family, Protocol )\n    {}\n\n\n    inline bool AcceptorSocket::listen(sal_Int32 MaxPendingConnections)\n    {\n        return osl_listenOnSocket( m_handle, MaxPendingConnections );\n    }\n\n\n    inline oslSocketResult AcceptorSocket::acceptConnection( StreamSocket& Connection)\n    {\n        oslSocket o = osl_acceptConnectionOnSocket( m_handle, 0 );\n        oslSocketResult status = osl_Socket_Ok;\n        if( o )\n        {\n            Connection = StreamSocket( o , SAL_NO_ACQUIRE );\n        }\n        else\n        {\n            Connection = StreamSocket();\n            status = osl_Socket_Error;\n        }\n        return status;\n    }\n\n\n    inline oslSocketResult AcceptorSocket::acceptConnection(\n        StreamSocket&   Connection, SocketAddr & PeerAddr)\n    {\n        \/\/ TODO change in\/OUT parameter\n        oslSocket o = osl_acceptConnectionOnSocket(\n            m_handle, reinterpret_cast<oslSocketAddr *>(&PeerAddr));\n        oslSocketResult status = osl_Socket_Ok;\n        if( o )\n        {\n            Connection = StreamSocket( o , SAL_NO_ACQUIRE );\n        }\n        else\n        {\n            Connection = StreamSocket();\n            status = osl_Socket_Error;\n        }\n        return status;\n    }\n\n\n    inline DatagramSocket::DatagramSocket(oslAddrFamily Family,\n                                          oslProtocol   Protocol,\n                                          oslSocketType Type)\n        : Socket( Type, Family, Protocol )\n    {}\n\n\n    inline sal_Int32 DatagramSocket::recvFrom(void*  pBuffer,\n                                              sal_uInt32 BufferSize,\n                                              SocketAddr* pSenderAddr,\n                                              oslSocketMsgFlag Flag )\n    {\n        sal_Int32 nByteRead;\n        if( pSenderAddr )\n        {\n            \/\/ TODO : correct the out-parameter pSenderAddr outparameter\n              nByteRead = osl_receiveFromSocket( m_handle, pSenderAddr->getHandle() , pBuffer,\n                                                 BufferSize, Flag);\n\/\/              nByteRead = osl_receiveFromSocket( m_handle, *(oslSocketAddr**) &pSenderAddr , pBuffer,\n\/\/                                                 BufferSize, Flag);\n        }\n        else\n        {\n            nByteRead = osl_receiveFromSocket( m_handle, 0 , pBuffer , BufferSize ,  Flag );\n        }\n        return nByteRead;\n    }\n\n\n    inline sal_Int32  DatagramSocket::sendTo( const SocketAddr& ReceiverAddr,\n                                              const void* pBuffer,\n                                              sal_uInt32 BufferSize,\n                                              oslSocketMsgFlag Flag )\n    {\n        return osl_sendToSocket( m_handle, ReceiverAddr.getHandle(), pBuffer, BufferSize, Flag );\n    }\n}\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010-2016 Raffaello 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\nLesser General 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 Lesser\nGeneral Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License along with Abaclade. If\nnot, see <http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abaclade.hxx>\n#include <abaclade\/text.hxx>\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace abc { namespace _pvt {\n\n\/*static*\/ void scope_trace_tuple::write_separator(io::text::ostream * ptos) {\n   ptos->write(ABC_SL(\", \"));\n}\n\n}} \/\/namespace abc::_pvt\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace abc { namespace _pvt {\n\ncoroutine_local_value<scope_trace const *> scope_trace::sm_pstHead \/*= nullptr*\/;\ncoroutine_local_value<bool> scope_trace::sm_bReentering \/*= false*\/;\ncoroutine_local_ptr<io::text::str_ostream> scope_trace::sm_psosScopeTrace;\ncoroutine_local_value<unsigned> scope_trace::sm_cScopeTraceRefs \/*= 0*\/;\ncoroutine_local_value<unsigned> scope_trace::sm_iStackDepth \/*= 0*\/;\n\nscope_trace::scope_trace(source_file_address const * psfa, scope_trace_tuple const * ptplVars) :\n   m_pstPrev(sm_pstHead),\n   m_psfa(psfa),\n   m_ptplVars(ptplVars) {\n   sm_pstHead = this;\n}\n\nscope_trace::~scope_trace() {\n   \/* The set-and-reset of sm_bReentering doesn’t need memory barriers because this is all contained\n   in a single thread (sm_bReentering is in TLS). *\/\n   if (!sm_bReentering && _std::uncaught_exception()) {\n      sm_bReentering = true;\n      try {\n         write(get_trace_ostream(), ++sm_iStackDepth);\n      } catch (...) {\n         \/\/ Don’t allow a trace to interfere with the program flow.\n         \/\/ FIXME: EXC-SWALLOW\n      }\n      sm_bReentering = false;\n   }\n   \/\/ Restore the previous scope trace single-linked list head.\n   sm_pstHead = m_pstPrev;\n}\n\nvoid scope_trace::write(io::text::ostream * ptos, unsigned iStackDepth) const {\n   ptos->print(\n      ABC_SL(\"#{} {} with args: \"), iStackDepth, str(external_buffer, m_psfa->function())\n   );\n   \/\/ Write the variables tuple.\n   m_ptplVars->write(ptos);\n   ptos->print(ABC_SL(\" at {}\\n\"), m_psfa->file_address());\n}\n\n\/*static*\/ void scope_trace::write_list(io::text::ostream * ptos) {\n   unsigned iStackDepth = 0;\n   for (scope_trace const * pst = sm_pstHead; pst; pst = pst->m_pstPrev) {\n      pst->write(ptos, ++iStackDepth);\n   }\n}\n\n}} \/\/namespace abc::_pvt\n<commit_msg>Fix numbering of non-destructed scope traces in abc::_pvt::scope_trace::write_list()<commit_after>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010-2016 Raffaello 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\nLesser General 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 Lesser\nGeneral Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License along with Abaclade. If\nnot, see <http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abaclade.hxx>\n#include <abaclade\/text.hxx>\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace abc { namespace _pvt {\n\n\/*static*\/ void scope_trace_tuple::write_separator(io::text::ostream * ptos) {\n   ptos->write(ABC_SL(\", \"));\n}\n\n}} \/\/namespace abc::_pvt\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace abc { namespace _pvt {\n\ncoroutine_local_value<scope_trace const *> scope_trace::sm_pstHead \/*= nullptr*\/;\ncoroutine_local_value<bool> scope_trace::sm_bReentering \/*= false*\/;\ncoroutine_local_ptr<io::text::str_ostream> scope_trace::sm_psosScopeTrace;\ncoroutine_local_value<unsigned> scope_trace::sm_cScopeTraceRefs \/*= 0*\/;\ncoroutine_local_value<unsigned> scope_trace::sm_iStackDepth \/*= 0*\/;\n\nscope_trace::scope_trace(source_file_address const * psfa, scope_trace_tuple const * ptplVars) :\n   m_pstPrev(sm_pstHead),\n   m_psfa(psfa),\n   m_ptplVars(ptplVars) {\n   sm_pstHead = this;\n}\n\nscope_trace::~scope_trace() {\n   \/* The set-and-reset of sm_bReentering doesn’t need memory barriers because this is all contained\n   in a single thread (sm_bReentering is in TLS). *\/\n   if (!sm_bReentering && _std::uncaught_exception()) {\n      sm_bReentering = true;\n      try {\n         write(get_trace_ostream(), ++sm_iStackDepth);\n      } catch (...) {\n         \/\/ Don’t allow a trace to interfere with the program flow.\n         \/\/ FIXME: EXC-SWALLOW\n      }\n      sm_bReentering = false;\n   }\n   \/\/ Restore the previous scope trace single-linked list head.\n   sm_pstHead = m_pstPrev;\n}\n\nvoid scope_trace::write(io::text::ostream * ptos, unsigned iStackDepth) const {\n   ptos->print(\n      ABC_SL(\"#{} {} with args: \"), iStackDepth, str(external_buffer, m_psfa->function())\n   );\n   \/\/ Write the variables tuple.\n   m_ptplVars->write(ptos);\n   ptos->print(ABC_SL(\" at {}\\n\"), m_psfa->file_address());\n}\n\n\/*static*\/ void scope_trace::write_list(io::text::ostream * ptos) {\n   unsigned iStackDepth = sm_iStackDepth;\n   for (scope_trace const * pst = sm_pstHead; pst; pst = pst->m_pstPrev) {\n      pst->write(ptos, ++iStackDepth);\n   }\n}\n\n}} \/\/namespace abc::_pvt\n<|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#pragma once\n\n#include <pdal\/pdal_internal.hpp>\n\n#include <string>\n#include <cassert>\n#include <stdexcept>\n#include <cmath>\n#include <fstream>\n#include <istream>\n#include <limits>\n#include <cstring>\n#include <sstream>\n#include <vector>\n\n#include <boost\/numeric\/conversion\/cast.hpp>\n\nnamespace pdal\n{\n\nclass PDAL_DLL Utils\n{\npublic:\n    static void random_seed(unsigned int seed);\n    static double random(double minimum, double maximum);\n    static double uniform(const double& minimum=0.0f,\n        const double& maximum=1.0f, boost::uint32_t seed=0);\n    static double normal(const double& mean=0.0f, const double& sigma=1.0f,\n        boost::uint32_t seed=0);\n\n    \/\/ compares two values to within the datatype's epsilon\n    template<class T>\n    static bool compare_distance(const T& actual, const T& expected)\n    {\n        const T epsilon = std::numeric_limits<T>::epsilon();\n        return compare_approx<T>(actual, expected, epsilon);\n    }\n\n    \/\/ compares two values to within a given tolerance\n    \/\/ the value |tolerance| is compared to |actual - expected|\n    template<class T>\n    static bool compare_approx(const T& actual, const T& expected,\n        const T& tolerance)\n    {\n        double diff = std::abs((double)actual - (double)expected);\n        return diff <= std::abs((double) tolerance);\n    }\n\n\n    \/\/ Return a 'T' from a stream and increment src by the sizeof 'T'\n    template<class T>\n    static inline T read_field(boost::uint8_t*& src)\n    {\n        T tmp = *(T*)(void*)src;\n        src += sizeof(T);\n        return tmp;\n    }\n\n    \/\/ Read 'num' items from the source stream to the dest location\n    template <typename T>\n    static inline void read_n(T& dest, std::istream& src,\n        std::streamsize const& num)\n    {\n        if (!src.good())\n            throw pdal::invalid_stream(\"pdal::Utils::read_n<T> input stream is \"\n                \"not readable\");\n\n        char* p = as_buffer(dest);\n        src.read(p, num);\n\n        assert(check_stream_state(src));\n    }\n\n    \/\/\n    \/\/ From http:\/\/stackoverflow.com\/questions\/485525\/round-for-float-in-c\n    static inline double sround(double r)\n    {\n        return (r > 0.0) ? floor(r + 0.5) : ceil(r - 0.5);\n    }\n\n    static inline std::vector<boost::uint8_t>hex_string_to_binary(\n        std::string const& source)\n    {\n        \/\/ Stolen from http:\/\/stackoverflow.com\/questions\/7363774\/  ...\n        \/\/    c-converting-binary-data-to-a-hex-string-and-back\n        static int nibbles[] =\n            { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0,\n              10, 11, 12, 13, 14, 15 };\n        std::vector<unsigned char> retval;\n        for (auto it = source.begin(); it < source.end(); it += 2) {\n            unsigned char v = 0;\n            if (::isxdigit(*it))\n                v = (unsigned char)nibbles[::toupper(*it) - '0'] << 4;\n            if (it + 1 < source.end() && ::isxdigit(*(it + 1)))\n                v += (unsigned char)nibbles[::toupper(*(it + 1)) - '0'];\n            retval.push_back(v);\n        }\n        return retval;\n    }\n\n    static inline void binary_to_hex_stream(unsigned char* source,\n        std::ostream& destination, int start, int end )\n    {\n        static char syms[] = \"0123456789ABCDEF\";\n        for (int i = start; i != end; i++)\n            destination << syms[((source[i] >> 4) & 0xf)] <<\n                           syms[source[i] & 0xf];\n    }\n\n    static inline std::string binary_to_hex_string(\n        const std::vector<unsigned char>& source)\n    {\n        static char syms[] = \"0123456789ABCDEF\";\n        std::stringstream ss;\n        for (std::vector<unsigned char>::const_iterator it = source.begin();\n                it != source.end(); it++)\n            ss << syms[((*it >> 4) & 0xf)] << syms[*it & 0xf];\n\n        return ss.str();\n    }\n\n    template<typename Target, typename Source>\n    static inline Target saturation_cast(Source const& src)\n    {\n        try\n        {\n            return boost::numeric_cast<Target>(src);\n        }\n        catch (boost::numeric::negative_overflow const&)\n        {\n            return std::numeric_limits<Target>::min();\n        }\n        catch (boost::numeric::positive_overflow const&)\n        {\n            return std::numeric_limits<Target>::max();\n        }\n    }\n\n    static void* registerPlugin( void* stageFactoryPtr,\n                                std::string const& filename,\n                                std::string const& registerMethodName,\n                                std::string const& versionMethodName);\n\n    static char* getenv(const char* env);\n    static std::string getenv(std::string const& name);\n    static int putenv(const char* env);\n\n    \/\/ aid to operator>> parsers\n    static void eatwhitespace(std::istream& s);\n    static void removeTrailingBlanks(std::string& s);\n\n    \/\/ aid to operator>> parsers\n    \/\/ if char found, eats it and returns true; otherwise, don't eat it and\n    \/\/ then return false\n    static bool eatcharacter(std::istream& s, char x);\n\n    static uint32_t getStreamPrecision(double scale);\n\n    static void* getDLLSymbol(std::string const& library,\n       std::string const& name);\n    static std::string base64_encode(std::vector<uint8_t> const& bytes)\n        { return base64_encode(bytes.data(), bytes.size()); }\n    static std::string base64_encode(const unsigned char *buf, size_t size);\n    static std::vector<boost::uint8_t> base64_decode(std::string const& input);\n\n    static FILE* portable_popen(const std::string& command,\n        const std::string& mode);\n    static int portable_pclose(FILE* fp);\n    static int run_shell_command(const std::string& cmd, std::string& output);\n\n    static std::string replaceAll(std::string result,\n                                  const std::string& replaceWhat,\n                                  const std::string& replaceWithWhat);\n    static void wordWrap(std::string const& inputString,\n                         std::vector<std::string>& outputString,\n                         unsigned int lineLength);\n    static std::string escapeJSON(const std::string &s);\n    static std::string demangle(const std::string& s);\n\n    template<typename T>\n    static std::string typeidName()\n        { return Utils::demangle(typeid(T).name()); }\n\n    struct RedirectCtx\n    {\n        std::ofstream *m_out;\n        std::streambuf *m_buf;\n    };\n\n    \/\/\/ Redirect a stream to some file, by default \/dev\/null.\n    \/\/\/ \\param[in] out   Stream to redirect.\n    \/\/\/ \\param[in] file  Name of file where stream should be redirected.\n    \/\/\/ \\return  Context for stream restoration (see restore()).\n    static RedirectCtx redirect(std::ostream& out,\n        const std::string& file = \"\/dev\/null\")\n    {\n        RedirectCtx ctx;\n\n        ctx.m_out = new std::ofstream(file);\n        ctx.m_buf = out.rdbuf();\n        out.rdbuf(ctx.m_out->rdbuf());\n        return ctx;\n    }\n\n    \/\/\/ Restore a stream redirected with redirect().\n    \/\/\/ \\param[in] out  Stream to be restored.\n    \/\/\/ \\param[in] ctx  Context returned from corresponding redirect() call.\n    static void restore(std::ostream& out, RedirectCtx ctx)\n    {\n        out.rdbuf(ctx.m_buf);\n        ctx.m_out->close();\n    }\n\nprivate:\n    template<typename T>\n    static inline char* as_buffer(T& data)\n    {\n        return static_cast<char*>(static_cast<void*>(&data));\n    }\n\n    template<typename T>\n    static inline char* as_buffer(T* data)\n    {\n        return static_cast<char*>(static_cast<void*>(data));\n    }\n\n    \/**\n    template<typename T>\n    static inline char const* as_bytes(T const& data)\n    {\n        return static_cast<char const*>(static_cast<void const*>(&data));\n    }\n\n    template<typename T>\n    static inline char const* as_bytes(T const* data)\n    {\n        return static_cast<char const*>(static_cast<void const*>(data));\n    }\n    **\/\n\n    template <typename C, typename T>\n    static inline bool check_stream_state(std::basic_ios<C, T>& srtm)\n    {\n        \/\/ Test stream state bits\n        if (srtm.eof())\n            throw std::out_of_range(\"end of file encountered\");\n        else if (srtm.fail())\n            throw std::runtime_error(\"non-fatal I\/O error occured\");\n        else if (srtm.bad())\n            throw std::runtime_error(\"fatal I\/O error occured\");\n        return true;\n    }\n};\n\n} \/\/ namespace pdal\n\n<commit_msg>Utils to namespace.<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#pragma once\n\n#include <pdal\/pdal_internal.hpp>\n\n#include <string>\n#include <cassert>\n#include <stdexcept>\n#include <cmath>\n#include <fstream>\n#include <istream>\n#include <limits>\n#include <cstring>\n#include <sstream>\n#include <vector>\n\n#include <boost\/numeric\/conversion\/cast.hpp>\n\nnamespace pdal\n{\n\nnamespace Utils\n{\n    template<typename T>\n    char *as_buffer(T& data)\n        { return static_cast<char*>(static_cast<void*>(&data)); }\n\n    template<typename T>\n    char *as_buffer(T* data)\n        { return static_cast<char*>(static_cast<void*>(data)); }\n\n    template <typename C, typename T>\n    bool check_stream_state(std::basic_ios<C, T>& srtm)\n    {\n        \/\/ Test stream state bits\n        if (srtm.eof())\n            throw std::out_of_range(\"end of file encountered\");\n        else if (srtm.fail())\n            throw std::runtime_error(\"non-fatal I\/O error occured\");\n        else if (srtm.bad())\n            throw std::runtime_error(\"fatal I\/O error occured\");\n        return true;\n    }\n\n    PDAL_DLL void random_seed(unsigned int seed);\n    PDAL_DLL double random(double minimum, double maximum);\n    PDAL_DLL double uniform(const double& minimum=0.0f,\n        const double& maximum=1.0f, boost::uint32_t seed=0);\n    PDAL_DLL double normal(const double& mean=0.0f, const double& sigma=1.0f,\n        boost::uint32_t seed=0);\n\n    \/\/ compares two values to within a given tolerance\n    \/\/ the value |tolerance| is compared to |actual - expected|\n    template<class T>\n    bool compare_approx(const T& actual, const T& expected, const T& tolerance)\n    {\n        double diff = std::abs((double)actual - (double)expected);\n        return diff <= std::abs((double) tolerance);\n    }\n\n    \/\/ compares two values to within the datatype's epsilon\n    template<class T>\n    bool compare_distance(const T& actual, const T& expected)\n    {\n        const T epsilon = std::numeric_limits<T>::epsilon();\n        return compare_approx<T>(actual, expected, epsilon);\n    }\n\n    \/\/ Return a 'T' from a stream and increment src by the sizeof 'T'\n    template<class T>\n    T read_field(boost::uint8_t*& src)\n    {\n        T tmp = *(T*)(void*)src;\n        src += sizeof(T);\n        return tmp;\n    }\n\n    \/\/ Read 'num' items from the source stream to the dest location\n    template <typename T>\n    void read_n(T& dest, std::istream& src, std::streamsize const& num)\n    {\n        if (!src.good())\n            throw pdal::invalid_stream(\"pdal::Utils::read_n<T> input stream is \"\n                \"not readable\");\n\n        src.read(as_buffer(dest), num);\n        assert(check_stream_state(src));\n    }\n\n    \/\/ From http:\/\/stackoverflow.com\/questions\/485525\/round-for-float-in-c\n    inline double sround(double r)\n        { return (r > 0.0) ? floor(r + 0.5) : ceil(r - 0.5); }\n\n    inline std::vector<boost::uint8_t>hex_string_to_binary(\n        std::string const& source)\n    {\n        \/\/ Stolen from http:\/\/stackoverflow.com\/questions\/7363774\/  ...\n        \/\/    c-converting-binary-data-to-a-hex-string-and-back\n        static int nibbles[] =\n            { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0,\n              10, 11, 12, 13, 14, 15 };\n        std::vector<unsigned char> retval;\n        for (auto it = source.begin(); it < source.end(); it += 2) {\n            unsigned char v = 0;\n            if (::isxdigit(*it))\n                v = (unsigned char)nibbles[::toupper(*it) - '0'] << 4;\n            if (it + 1 < source.end() && ::isxdigit(*(it + 1)))\n                v += (unsigned char)nibbles[::toupper(*(it + 1)) - '0'];\n            retval.push_back(v);\n        }\n        return retval;\n    }\n\n    inline void binary_to_hex_stream(unsigned char* source,\n        std::ostream& destination, int start, int end )\n    {\n        static char syms[] = \"0123456789ABCDEF\";\n        for (int i = start; i != end; i++)\n            destination << syms[((source[i] >> 4) & 0xf)] <<\n                           syms[source[i] & 0xf];\n    }\n\n    inline std::string binary_to_hex_string(\n        const std::vector<unsigned char>& source)\n    {\n        static char syms[] = \"0123456789ABCDEF\";\n        std::stringstream ss;\n        for (std::vector<unsigned char>::const_iterator it = source.begin();\n                it != source.end(); it++)\n            ss << syms[((*it >> 4) & 0xf)] << syms[*it & 0xf];\n\n        return ss.str();\n    }\n\n    template<typename Target, typename Source>\n    Target saturation_cast(Source const& src)\n    {\n        try\n        {\n            return boost::numeric_cast<Target>(src);\n        }\n        catch (boost::numeric::negative_overflow const&)\n        {\n            return std::numeric_limits<Target>::min();\n        }\n        catch (boost::numeric::positive_overflow const&)\n        {\n            return std::numeric_limits<Target>::max();\n        }\n    }\n\n    PDAL_DLL void *registerPlugin(void *stageFactoryPtr,\n        std::string const& filename, std::string const& registerMethodName,\n        std::string const& versionMethodName);\n\n    PDAL_DLL char *getenv(const char *env);\n    PDAL_DLL std::string getenv(std::string const& name);\n    PDAL_DLL int putenv(const char *env);\n\n    \/\/ aid to operator>> parsers\n    PDAL_DLL void eatwhitespace(std::istream& s);\n    PDAL_DLL void removeTrailingBlanks(std::string& s);\n\n    \/\/ aid to operator>> parsers\n    \/\/ if char found, eats it and returns true; otherwise, don't eat it and\n    \/\/ then return false\n    PDAL_DLL bool eatcharacter(std::istream& s, char x);\n    PDAL_DLL uint32_t getStreamPrecision(double scale);\n    PDAL_DLL void *getDLLSymbol(std::string const& library,\n        std::string const& name);\n    PDAL_DLL std::string base64_encode(const unsigned char *buf, size_t size);\n    inline std::string base64_encode(std::vector<uint8_t> const& bytes)\n        { return base64_encode(bytes.data(), bytes.size()); }\n    PDAL_DLL std::vector<boost::uint8_t>\n    base64_decode(std::string const& input);\n\n    PDAL_DLL FILE* portable_popen(const std::string& command,\n        const std::string& mode);\n    PDAL_DLL int portable_pclose(FILE* fp);\n    PDAL_DLL int run_shell_command(const std::string& cmd, std::string& output);\n    PDAL_DLL std::string replaceAll(std::string result,\n        const std::string& replaceWhat, const std::string& replaceWithWhat);\n    PDAL_DLL void wordWrap(std::string const& inputString,\n        std::vector<std::string>& outputString, unsigned int lineLength);\n    PDAL_DLL std::string escapeJSON(const std::string &s);\n    PDAL_DLL std::string demangle(const std::string& s);\n\n    template<typename T>\n    std::string typeidName()\n        { return Utils::demangle(typeid(T).name()); }\n\n    struct RedirectCtx\n    {\n        std::ofstream *m_out;\n        std::streambuf *m_buf;\n    };\n\n    \/\/\/ Redirect a stream to some file, by default \/dev\/null.\n    \/\/\/ \\param[in] out   Stream to redirect.\n    \/\/\/ \\param[in] file  Name of file where stream should be redirected.\n    \/\/\/ \\return  Context for stream restoration (see restore()).\n    inline RedirectCtx redirect(std::ostream& out,\n        const std::string& file = \"\/dev\/null\")\n    {\n        RedirectCtx ctx;\n\n        ctx.m_out = new std::ofstream(file);\n        ctx.m_buf = out.rdbuf();\n        out.rdbuf(ctx.m_out->rdbuf());\n        return ctx;\n    }\n\n    \/\/\/ Restore a stream redirected with redirect().\n    \/\/\/ \\param[in] out  Stream to be restored.\n    \/\/\/ \\param[in] ctx  Context returned from corresponding redirect() call.\n    inline void restore(std::ostream& out, RedirectCtx ctx)\n    {\n        out.rdbuf(ctx.m_buf);\n        ctx.m_out->close();\n    }\n};\n\n} \/\/ namespace pdal\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n +----------------------------------------------------------------------+\n | PHP-OpenCV                                                           |\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 | hihozhou@gmail.com so we can mail you a copy immediately.            |\n +----------------------------------------------------------------------+\n | Author: HaiHao Zhou  <hihozhou@gmail.com>                            |\n +----------------------------------------------------------------------+\n *\/\n\n\n\/* $Id$ *\/\n\nextern \"C\" {\n\t#ifdef HAVE_CONFIG_H\n\t#include \"config.h\"\n\t#endif\n\n\t#include \"php.h\"\n\t#include \"php_ini.h\"\n\t#include \"ext\/standard\/info.h\"\n}\n#include \"php_opencv.h\"\n#include \"source\/opencv2\/opencv_imgcodecs.h\"\n#include \"source\/opencv2\/opencv_highgui.h\"\n#include \"source\/opencv2\/opencv_imgproc.h\"\n#include \"source\/opencv2\/core\/opencv_type.h\"\n#include \"source\/opencv2\/core\/opencv_mat.h\"\n#include \"source\/opencv2\/core\/hal\/opencv_interface.h\"\n#include \"opencv_exception.h\"\n#include \"source\/opencv2\/opencv_core.h\"\n#include \"source\/opencv2\/core\/opencv_base.h\"\n#include \"source\/opencv2\/core\/opencv_persistence.h\"\n#include \"source\/opencv2\/opencv_objdetect.h\"\n#include \"source\/opencv2\/opencv_videoio.h\"\n#include \"source\/opencv2\/opencv_face.h\"\n\n\/* If you declare any globals in php_opencv.h uncomment this:\nZEND_DECLARE_MODULE_GLOBALS(opencv)\n*\/\n\n\/* True global resources - no need for thread safety here *\/\nstatic int le_opencv;\n\n\/* {{{ PHP_INI\n *\/\n\/* Remove comments and fill if you need to have entries in php.ini\nPHP_INI_BEGIN()\n    STD_PHP_INI_ENTRY(\"opencv.global_value\",      \"42\", PHP_INI_ALL, OnUpdateLong, global_value, zend_opencv_globals, opencv_globals)\n    STD_PHP_INI_ENTRY(\"opencv.global_string\", \"foobar\", PHP_INI_ALL, OnUpdateString, global_string, zend_opencv_globals, opencv_globals)\nPHP_INI_END()\n*\/\n\/* }}} *\/\n\n\/* Remove the following function when you have successfully modified config.m4\n   so that your module can be compiled into PHP, it exists only for testing\n   purposes. *\/\n\n\/* Every user-visible function in PHP should document itself in the source *\/\n\/* {{{ proto string confirm_opencv_compiled(string arg)\n   Return a string to confirm that the module is compiled in *\/\nPHP_FUNCTION(confirm_opencv_compiled)\n{\n    char *arg = NULL;\n\tsize_t arg_len, len;\n\tzend_string *strg;\n\n\tif (zend_parse_parameters(ZEND_NUM_ARGS(), \"s\", &arg, &arg_len) == FAILURE) {\n\t\treturn;\n\t}\n\n\tstrg = strpprintf(0, \"Congratulations! You have successfully modified ext\/%.78s\/config.m4. Module %.78s is now compiled into PHP.\", \"opencv\", arg);\n\n\tRETURN_STR(strg);\n}\n\n\n\/* }}} *\/\n\/* The previous line is meant for vim and emacs, so it can correctly fold and\n   unfold functions in source code. See the corresponding marks just before\n   function definition, where the functions purpose is also documented. Please\n   follow this convention for the convenience of others editing your code.\n*\/\n\n\n\/* {{{ php_opencv_init_globals\n *\/\n\/* Uncomment this function if you have INI entries\nstatic void php_opencv_init_globals(zend_opencv_globals *opencv_globals)\n{\n\topencv_globals->global_value = 0;\n\topencv_globals->global_string = NULL;\n}\n*\/\n\/* }}} *\/\n\n\n\/* {{{ PHP_MINIT_FUNCTION\n *\/\nPHP_MINIT_FUNCTION(opencv)\n{\n\t\/* If you have INI entries, uncomment these lines\n\tREGISTER_INI_ENTRIES();\n\t*\/\n    opencv_interface_init(module_number);\n    opencv_imgcodecs_init(module_number);\n    opencv_highgui_init(module_number);\n    opencv_exception_init();\n    opencv_mat_init();\n    opencv_type_init(module_number);\n    opencv_imgproc_init(module_number);\n\topencv_core_init(module_number);\n    opencv_border_types_init(module_number);\n\topencv_file_storage_init(module_number);\n\topencv_objdetect_init(module_number);\n\topencv_videoio_init(module_number);\n    opencv_face_init(module_number);\n\n\treturn SUCCESS;\n}\n\/* }}} *\/\n\n\/* {{{ PHP_MSHUTDOWN_FUNCTION\n *\/\nPHP_MSHUTDOWN_FUNCTION(opencv)\n{\n\t\/* uncomment this line if you have INI entries\n\tUNREGISTER_INI_ENTRIES();\n\t*\/\n\treturn SUCCESS;\n}\n\/* }}} *\/\n\n\/* Remove if there's nothing to do at request start *\/\n\/* {{{ PHP_RINIT_FUNCTION\n *\/\nPHP_RINIT_FUNCTION(opencv)\n{\n#if defined(COMPILE_DL_OPENCV) && defined(ZTS)\n\tZEND_TSRMLS_CACHE_UPDATE();\n#endif\n\treturn SUCCESS;\n}\n\/* }}} *\/\n\n\/* Remove if there's nothing to do at request end *\/\n\/* {{{ PHP_RSHUTDOWN_FUNCTION\n *\/\nPHP_RSHUTDOWN_FUNCTION(opencv)\n{\n\treturn SUCCESS;\n}\n\/* }}} *\/\n\n\/* {{{ PHP_MINFO_FUNCTION\n *\/\nPHP_MINFO_FUNCTION(opencv)\n{\n\tphp_info_print_table_start();\n\tphp_info_print_table_header(2, \"opencv support\", \"enabled\");\n\tphp_info_print_table_end();\n\n\t\/* Remove comments if you have entries in php.ini\n\tDISPLAY_INI_ENTRIES();\n\t*\/\n}\n\/* }}} *\/\n\n\/* {{{ opencv_functions[]\n *\n * Every user visible function must have an entry in opencv_functions[].\n *\/\nconst zend_function_entry opencv_functions[] = {\n\tPHP_FE(confirm_opencv_compiled,\tNULL)\t\t\/* For testing, remove later. *\/\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_8UC, ZEND_FN(opencv_cv_8uc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_8SC, ZEND_FN(opencv_cv_8sc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_16UC, ZEND_FN(opencv_cv_16uc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_16SC, ZEND_FN(opencv_cv_16sc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_32SC, ZEND_FN(opencv_cv_32sc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_32FC, ZEND_FN(opencv_cv_32fc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_64FC, ZEND_FN(opencv_cv_64fc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, imread, ZEND_FN(opencv_imread), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, imwrite, ZEND_FN(opencv_imwrite), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, imshow, ZEND_FN(opencv_imshow), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, waitKey, ZEND_FN(opencv_wait_key), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, namedWindow, ZEND_FN(opencv_named_window), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, cvtColor, ZEND_FN(opencv_cv_t_color), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, ellipse, ZEND_FN(opencv_ellipse), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, circle, ZEND_FN(opencv_circle), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, fillPoly, ZEND_FN(opencv_fill_poly), NULL)\/\/\/\/TODO fillPoly\n    ZEND_NS_NAMED_FE(OPENCV_NS, line, ZEND_FN(opencv_line), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, rectangle, ZEND_FN(opencv_rectangle), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, rectangleByPoint, ZEND_FN(opencv_rectangle_by_point), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, rectangleByRect, ZEND_FN(opencv_rectangle_by_rect), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, addWeighted, ZEND_FN(opencv_add_weighted), opencv_add_weighted_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, split, ZEND_FN(opencv_split), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, merge, ZEND_FN(opencv_merge), opencv_merge_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, createTrackbar, ZEND_FN(opencv_create_trackbar), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, destroyWindow, ZEND_FN(opencv_destroy_window), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, getOptimalDFTSize, ZEND_FN(opencv_get_optimal_dft_size), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, copyMakeBorder, ZEND_FN(opencv_copy_make_border), opencv_copy_make_border_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, dft, ZEND_FN(opencv_dft), opencv_dft_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, magnitude, ZEND_FN(opencv_magnitude), opencv_magnitude_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, add, ZEND_FN(opencv_add), opencv_add_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, log, ZEND_FN(opencv_log), opencv_log_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, normalize, ZEND_FN(opencv_normalize), opencv_normalize_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, equalizeHist, ZEND_FN(opencv_equalize_hist), opencv_equalize_hist_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, resize, ZEND_FN(opencv_resize), opencv_resize_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, putText, ZEND_FN(opencv_put_text), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, absdiff, ZEND_FN(opencv_absdiff), opencv_absdiff_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, getTrackBarPos, ZEND_FN(opencv_get_track_bar_pos), NULL)\n\tPHP_FE_END\t\/* Must be the last line in opencv_functions[] *\/\n};\n\/* }}} *\/\n\n\/* {{{ opencv_module_entry\n *\/\nzend_module_entry opencv_module_entry = {\n\tSTANDARD_MODULE_HEADER,\n\t\"opencv\",\n\topencv_functions,\n\tPHP_MINIT(opencv),\n\tPHP_MSHUTDOWN(opencv),\n\tPHP_RINIT(opencv),\t\t\/* Replace with NULL if there's nothing to do at request start *\/\n\tPHP_RSHUTDOWN(opencv),\t\/* Replace with NULL if there's nothing to do at request end *\/\n\tPHP_MINFO(opencv),\n\tPHP_OPENCV_VERSION,\n\tSTANDARD_MODULE_PROPERTIES\n};\n\/* }}} *\/\n\n#ifdef COMPILE_DL_OPENCV\n#ifdef ZTS\nZEND_TSRMLS_CACHE_DEFINE()\n#endif\nZEND_GET_MODULE(opencv)\n#endif\n\n\/*\n * Local variables:\n * tab-width: 4\n * c-basic-offset: 4\n * End:\n * vim600: noet sw=4 ts=4 fdm=marker\n * vim<600: noet sw=4 ts=4\n *\/\n<commit_msg>add annotation<commit_after>\/*\n +----------------------------------------------------------------------+\n | PHP-OpenCV                                                           |\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 | hihozhou@gmail.com so we can mail you a copy immediately.            |\n +----------------------------------------------------------------------+\n | Author: HaiHao Zhou  <hihozhou@gmail.com>                            |\n +----------------------------------------------------------------------+\n *\/\n\n\n\/* $Id$ *\/\n\nextern \"C\" {\n\t#ifdef HAVE_CONFIG_H\n\t#include \"config.h\"\n\t#endif\n\n\t#include \"php.h\"\n\t#include \"php_ini.h\"\n\t#include \"ext\/standard\/info.h\"\n}\n#include \"php_opencv.h\"\n#include \"source\/opencv2\/opencv_imgcodecs.h\"\n#include \"source\/opencv2\/opencv_highgui.h\"\n#include \"source\/opencv2\/opencv_imgproc.h\"\n#include \"source\/opencv2\/core\/opencv_type.h\"\n#include \"source\/opencv2\/core\/opencv_mat.h\"\n#include \"source\/opencv2\/core\/hal\/opencv_interface.h\"\n#include \"opencv_exception.h\"\n#include \"source\/opencv2\/opencv_core.h\"\n#include \"source\/opencv2\/core\/opencv_base.h\"\n#include \"source\/opencv2\/core\/opencv_persistence.h\"\n#include \"source\/opencv2\/opencv_objdetect.h\"\n#include \"source\/opencv2\/opencv_videoio.h\"\n#include \"source\/opencv2\/opencv_face.h\"\n\n\/* If you declare any globals in php_opencv.h uncomment this:\nZEND_DECLARE_MODULE_GLOBALS(opencv)\n*\/\n\n\/* True global resources - no need for thread safety here *\/\nstatic int le_opencv;\n\n\/* {{{ PHP_INI\n *\/\n\/* Remove comments and fill if you need to have entries in php.ini\nPHP_INI_BEGIN()\n    STD_PHP_INI_ENTRY(\"opencv.global_value\",      \"42\", PHP_INI_ALL, OnUpdateLong, global_value, zend_opencv_globals, opencv_globals)\n    STD_PHP_INI_ENTRY(\"opencv.global_string\", \"foobar\", PHP_INI_ALL, OnUpdateString, global_string, zend_opencv_globals, opencv_globals)\nPHP_INI_END()\n*\/\n\/* }}} *\/\n\n\/* Remove the following function when you have successfully modified config.m4\n   so that your module can be compiled into PHP, it exists only for testing\n   purposes. *\/\n\n\/* Every user-visible function in PHP should document itself in the source *\/\n\/* {{{ proto string confirm_opencv_compiled(string arg)\n   Return a string to confirm that the module is compiled in *\/\nPHP_FUNCTION(confirm_opencv_compiled)\n{\n    char *arg = NULL;\n\tsize_t arg_len, len;\n\tzend_string *strg;\n\n\tif (zend_parse_parameters(ZEND_NUM_ARGS(), \"s\", &arg, &arg_len) == FAILURE) {\n\t\treturn;\n\t}\n\n\tstrg = strpprintf(0, \"Congratulations! You have successfully modified ext\/%.78s\/config.m4. Module %.78s is now compiled into PHP.\", \"opencv\", arg);\n\n\tRETURN_STR(strg);\n}\n\n\n\/* }}} *\/\n\/* The previous line is meant for vim and emacs, so it can correctly fold and\n   unfold functions in source code. See the corresponding marks just before\n   function definition, where the functions purpose is also documented. Please\n   follow this convention for the convenience of others editing your code.\n*\/\n\n\n\/* {{{ php_opencv_init_globals\n *\/\n\/* Uncomment this function if you have INI entries\nstatic void php_opencv_init_globals(zend_opencv_globals *opencv_globals)\n{\n\topencv_globals->global_value = 0;\n\topencv_globals->global_string = NULL;\n}\n*\/\n\/* }}} *\/\n\n\n\/* {{{ PHP_MINIT_FUNCTION\n *\/\nPHP_MINIT_FUNCTION(opencv)\n{\n\t\/* If you have INI entries, uncomment these lines\n\tREGISTER_INI_ENTRIES();\n\t*\/\n    opencv_interface_init(module_number);\n    opencv_imgcodecs_init(module_number);\n    opencv_highgui_init(module_number);\n    opencv_exception_init();\n    opencv_mat_init();\n    opencv_type_init(module_number);\n    opencv_imgproc_init(module_number);\n\topencv_core_init(module_number);\n    opencv_border_types_init(module_number);\n\topencv_file_storage_init(module_number);\n\topencv_objdetect_init(module_number);\n\topencv_videoio_init(module_number);\n    opencv_face_init(module_number);\n\n\treturn SUCCESS;\n}\n\/* }}} *\/\n\n\/* {{{ PHP_MSHUTDOWN_FUNCTION\n *\/\nPHP_MSHUTDOWN_FUNCTION(opencv)\n{\n\t\/* uncomment this line if you have INI entries\n\tUNREGISTER_INI_ENTRIES();\n\t*\/\n\treturn SUCCESS;\n}\n\/* }}} *\/\n\n\/* Remove if there's nothing to do at request start *\/\n\/* {{{ PHP_RINIT_FUNCTION\n *\/\nPHP_RINIT_FUNCTION(opencv)\n{\n#if defined(COMPILE_DL_OPENCV) && defined(ZTS)\n\tZEND_TSRMLS_CACHE_UPDATE();\n#endif\n\treturn SUCCESS;\n}\n\/* }}} *\/\n\n\/* Remove if there's nothing to do at request end *\/\n\/* {{{ PHP_RSHUTDOWN_FUNCTION\n *\/\nPHP_RSHUTDOWN_FUNCTION(opencv)\n{\n\treturn SUCCESS;\n}\n\/* }}} *\/\n\n\/* {{{ PHP_MINFO_FUNCTION\n *\/\nPHP_MINFO_FUNCTION(opencv)\n{\n\tphp_info_print_table_start();\n\tphp_info_print_table_header(2, \"opencv support\", \"enabled\");\n\tphp_info_print_table_end();\n\n\t\/* Remove comments if you have entries in php.ini\n\tDISPLAY_INI_ENTRIES();\n\t*\/\n}\n\/* }}} *\/\n\n\/* {{{ opencv_functions[]\n *\n * Every user visible function must have an entry in opencv_functions[].\n *\/\nconst zend_function_entry opencv_functions[] = {\n\tPHP_FE(confirm_opencv_compiled,\tNULL)\t\t\/* For testing, remove later. *\/\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_8UC, ZEND_FN(opencv_cv_8uc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_8SC, ZEND_FN(opencv_cv_8sc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_16UC, ZEND_FN(opencv_cv_16uc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_16SC, ZEND_FN(opencv_cv_16sc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_32SC, ZEND_FN(opencv_cv_32sc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_32FC, ZEND_FN(opencv_cv_32fc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, CV_64FC, ZEND_FN(opencv_cv_64fc), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, imread, ZEND_FN(opencv_imread), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, imwrite, ZEND_FN(opencv_imwrite), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, imshow, ZEND_FN(opencv_imshow), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, waitKey, ZEND_FN(opencv_wait_key), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, namedWindow, ZEND_FN(opencv_named_window), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, cvtColor, ZEND_FN(opencv_cv_t_color), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, ellipse, ZEND_FN(opencv_ellipse), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, circle, ZEND_FN(opencv_circle), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, fillPoly, ZEND_FN(opencv_fill_poly), NULL)\/\/TODO fillPoly\n    ZEND_NS_NAMED_FE(OPENCV_NS, line, ZEND_FN(opencv_line), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, rectangle, ZEND_FN(opencv_rectangle), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, rectangleByPoint, ZEND_FN(opencv_rectangle_by_point), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, rectangleByRect, ZEND_FN(opencv_rectangle_by_rect), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, addWeighted, ZEND_FN(opencv_add_weighted), opencv_add_weighted_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, split, ZEND_FN(opencv_split), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, merge, ZEND_FN(opencv_merge), opencv_merge_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, createTrackbar, ZEND_FN(opencv_create_trackbar), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, destroyWindow, ZEND_FN(opencv_destroy_window), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, getOptimalDFTSize, ZEND_FN(opencv_get_optimal_dft_size), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, copyMakeBorder, ZEND_FN(opencv_copy_make_border), opencv_copy_make_border_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, dft, ZEND_FN(opencv_dft), opencv_dft_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, magnitude, ZEND_FN(opencv_magnitude), opencv_magnitude_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, add, ZEND_FN(opencv_add), opencv_add_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, log, ZEND_FN(opencv_log), opencv_log_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, normalize, ZEND_FN(opencv_normalize), opencv_normalize_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, equalizeHist, ZEND_FN(opencv_equalize_hist), opencv_equalize_hist_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, resize, ZEND_FN(opencv_resize), opencv_resize_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, putText, ZEND_FN(opencv_put_text), NULL)\n    ZEND_NS_NAMED_FE(OPENCV_NS, absdiff, ZEND_FN(opencv_absdiff), opencv_absdiff_arginfo)\n    ZEND_NS_NAMED_FE(OPENCV_NS, getTrackBarPos, ZEND_FN(opencv_get_track_bar_pos), NULL)\n\tPHP_FE_END\t\/* Must be the last line in opencv_functions[] *\/\n};\n\/* }}} *\/\n\n\/* {{{ opencv_module_entry\n *\/\nzend_module_entry opencv_module_entry = {\n\tSTANDARD_MODULE_HEADER,\n\t\"opencv\",\n\topencv_functions,\n\tPHP_MINIT(opencv),\n\tPHP_MSHUTDOWN(opencv),\n\tPHP_RINIT(opencv),\t\t\/* Replace with NULL if there's nothing to do at request start *\/\n\tPHP_RSHUTDOWN(opencv),\t\/* Replace with NULL if there's nothing to do at request end *\/\n\tPHP_MINFO(opencv),\n\tPHP_OPENCV_VERSION,\n\tSTANDARD_MODULE_PROPERTIES\n};\n\/* }}} *\/\n\n#ifdef COMPILE_DL_OPENCV\n#ifdef ZTS\nZEND_TSRMLS_CACHE_DEFINE()\n#endif\nZEND_GET_MODULE(opencv)\n#endif\n\n\/*\n * Local variables:\n * tab-width: 4\n * c-basic-offset: 4\n * End:\n * vim600: noet sw=4 ts=4 fdm=marker\n * vim<600: noet sw=4 ts=4\n *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <ros\/ros.h>\n\n\/\/ROS libraries\n#include <tf\/transform_datatypes.h>\n\n\/\/ROS messages\n#include <std_msgs\/Float32.h>\n#include <std_msgs\/String.h>\n#include <geometry_msgs\/Quaternion.h>\n#include <geometry_msgs\/QuaternionStamped.h>\n#include <geometry_msgs\/Twist.h>\n#include <nav_msgs\/Odometry.h>\n#include <sensor_msgs\/Imu.h>\n#include <sensor_msgs\/Range.h>\n\n\/\/Package include\n#include <usbSerial.h>\n\nusing namespace std;\n\n\/\/aBridge functions\nvoid cmdHandler(const geometry_msgs::Twist::ConstPtr& message);\nvoid fingerAngleHandler(const std_msgs::Float32::ConstPtr& angle);\nvoid wristAngleHandler(const std_msgs::Float32::ConstPtr& angle);\nvoid serialActivityTimer(const ros::TimerEvent& e);\nvoid publishRosTopics();\nvoid parseData(string data);\n\n\/\/Globals\ngeometry_msgs::QuaternionStamped fingerAngle;\ngeometry_msgs::QuaternionStamped wristAngle;\nsensor_msgs::Imu imu;\nnav_msgs::Odometry odom;\nsensor_msgs::Range sonarLeft;\nsensor_msgs::Range sonarCenter;\nsensor_msgs::Range sonarRight;\nUSBSerial usb;\nconst int baud = 115200;\nchar dataCmd[] = \"d\\n\";\nchar moveCmd[16];\nchar host[128];\nchar delimiter = ',';\nvector<string> dataSet;\nfloat linearSpeed = 0.;\nfloat turnSpeed = 0.;\nconst float deltaTime = 0.1;\n\n\/\/Publishers\nros::Publisher fingerAnglePublish;\nros::Publisher wristAnglePublish;\nros::Publisher imuPublish;\nros::Publisher odomPublish;\nros::Publisher sonarLeftPublish;\nros::Publisher sonarCenterPublish;\nros::Publisher sonarRightPublish;\n\n\/\/Subscribers\nros::Subscriber velocitySubscriber;\nros::Subscriber fingerAngleSubscriber;\nros::Subscriber wristAngleSubscriber;\n\n\/\/Timers\nros::Timer publishTimer;\n\nint main(int argc, char **argv) {\n    \n    gethostname(host, sizeof (host));\n    string hostname(host);\n    string publishedName;\n    ros::init(argc, argv, (hostname + \"_ABRIDGE\"));\n    \n    ros::NodeHandle param(\"~\");\n    string devicePath;\n    param.param(\"device\", devicePath, string(\"\/dev\/ttyUSB0\"));\n    usb.openUSBPort(devicePath, baud);\n    \n    sleep(5);\n    \n    ros::NodeHandle aNH;\n    \n    if (argc >= 2) {\n        publishedName = argv[1];\n        cout << \"Welcome to the world of tomorrow \" << publishedName << \"!  ABridge module started.\" << endl;\n    } else {\n        publishedName = hostname;\n        cout << \"No Name Selected. Default is: \" << publishedName << endl;\n    }\n    \n    fingerAnglePublish = aNH.advertise<geometry_msgs::QuaternionStamped>((publishedName + \"\/fingerAngle\/prev_cmd\"), 10);\n    wristAnglePublish = aNH.advertise<geometry_msgs::QuaternionStamped>((publishedName + \"\/wristAngle\/prev_cmd\"), 10);\n    imuPublish = aNH.advertise<sensor_msgs::Imu>((publishedName + \"\/imu\"), 10);\n    odomPublish = aNH.advertise<nav_msgs::Odometry>((publishedName + \"\/odom\"), 10);\n    sonarLeftPublish = aNH.advertise<sensor_msgs::Range>((publishedName + \"\/sonarLeft\"), 10);\n    sonarCenterPublish = aNH.advertise<sensor_msgs::Range>((publishedName + \"\/sonarCenter\"), 10);\n    sonarRightPublish = aNH.advertise<sensor_msgs::Range>((publishedName + \"\/sonarRight\"), 10);\n    \n    velocitySubscriber = aNH.subscribe((publishedName + \"\/velocity\"), 10, cmdHandler);\n    fingerAngleSubscriber = aNH.subscribe((publishedName + \"\/fingerAngle\/cmd\"), 1, fingerAngleHandler);\n    wristAngleSubscriber = aNH.subscribe((publishedName + \"\/wristAngle\/cmd\"), 1, wristAngleHandler);\n    \n    publishTimer = aNH.createTimer(ros::Duration(deltaTime), serialActivityTimer);\n    \n    imu.header.frame_id = publishedName+\"\/base_link\";\n    \n    odom.header.frame_id = publishedName+\"\/odom\";\n    odom.child_frame_id = publishedName+\"\/base_link\";\n\n    ros::spin();\n    \n    return EXIT_SUCCESS;\n}\n\nvoid cmdHandler(const geometry_msgs::Twist::ConstPtr& message) {\n    \/\/ remove artificial factor that was multiplied for simulation. this scales it back down to -1.0 to +1.0\n  linearSpeed = (message->linear.x); \/\/ \/ 1.5;\n  turnSpeed = (message->angular.z); \/\/ \/ 8;\n    \n    if (linearSpeed != 0.) {\n        sprintf(moveCmd, \"m,%d\\n\", (int) (linearSpeed * 255));\n        usb.sendData(moveCmd);\n    } else if (turnSpeed != 0.) {\n        sprintf(moveCmd, \"t,%d\\n\", (int) (turnSpeed * 255));\n        usb.sendData(moveCmd);\n    } else {\n        sprintf(moveCmd, \"s\\n\");\n        usb.sendData(moveCmd);\n    }\n    \n    memset(&moveCmd, '\\0', sizeof (moveCmd));\n}\n\n\/\/ The finger and wrist handlers receive gripper angle commands in floating point\n\/\/ radians, write them to a string and send that to the arduino\n\/\/ for processing.\nvoid fingerAngleHandler(const std_msgs::Float32::ConstPtr& angle) {\n  char cmd[16]={'\\0'};\n\n  \/\/ Avoid dealing with negative exponents which confuse the conversion to string by checking if the angle is small\n  if (angle->data < 0.01) {\n    \/\/ 'f' indicates this is a finger command to the arduino\n    sprintf(cmd, \"f,0\\n\");\n  } else {\n    sprintf(cmd, \"f,%.4g\\n\", angle->data);\n  }\n  usb.sendData(cmd);\n  memset(&cmd, '\\0', sizeof (cmd));\n}\n\nvoid wristAngleHandler(const std_msgs::Float32::ConstPtr& angle) {\n    char cmd[16]={'\\0'};\n\n    \/\/ Avoid dealing with negative exponents which confuse the conversion to string by checking if the angle is small\n  if (angle->data < 0.01) {\n    \/\/ 'w' indicates this is a wrist command to the arduino\n    sprintf(cmd, \"w,0\\n\");\n  } else {\n    sprintf(cmd, \"w,%.4g\\n\", angle->data);\n  }\n  usb.sendData(cmd);\n  memset(&cmd, '\\0', sizeof (cmd));\n}\n\nvoid serialActivityTimer(const ros::TimerEvent& e) {\n    usb.sendData(dataCmd);\n    parseData(usb.readData());\n    publishRosTopics();\n}\n\nvoid publishRosTopics() {\n    fingerAnglePublish.publish(fingerAngle);\n    wristAnglePublish.publish(wristAngle);\n    imuPublish.publish(imu);\n    odomPublish.publish(odom);\n    sonarLeftPublish.publish(sonarLeft);\n    sonarCenterPublish.publish(sonarCenter);\n    sonarRightPublish.publish(sonarRight);\n}\n\nvoid parseData(string str) {\n    istringstream oss(str);\n    string sentence;\n    \n    while (getline(oss, sentence, '\\n')) {\n\t\tistringstream wss(sentence);\n\t\tstring word;\n\n\t\tvector<string> dataSet;\n\t\twhile (getline(wss, word, ',')) {\n\t\t\tdataSet.push_back(word);\n\t\t}\n\n\t\tif (dataSet.size() >= 3 && dataSet.at(1) == \"1\") {\n\n\t\t\tif (dataSet.at(0) == \"GRF\") {\n\t\t\t\tfingerAngle.header.stamp = ros::Time::now();\n\t\t\t\tfingerAngle.quaternion = tf::createQuaternionMsgFromRollPitchYaw(atof(dataSet.at(2).c_str()), 0.0, 0.0);\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"GRW\") {\n\t\t\t\twristAngle.header.stamp = ros::Time::now();\n\t\t\t\twristAngle.quaternion = tf::createQuaternionMsgFromRollPitchYaw(atof(dataSet.at(2).c_str()), 0.0, 0.0);\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"IMU\") {\n\t\t\t\timu.header.stamp = ros::Time::now();\n\t\t\t\timu.linear_acceleration.x = atof(dataSet.at(2).c_str());\n\t\t\t\timu.linear_acceleration.y = atof(dataSet.at(3).c_str());\n\t\t\t\timu.linear_acceleration.z = atof(dataSet.at(4).c_str());\n\t\t\t\timu.angular_velocity.x = atof(dataSet.at(5).c_str());\n\t\t\t\timu.angular_velocity.y = atof(dataSet.at(6).c_str());\n\t\t\t\timu.angular_velocity.z = atof(dataSet.at(7).c_str());\n\t\t\t\timu.orientation = tf::createQuaternionMsgFromRollPitchYaw(atof(dataSet.at(8).c_str()), atof(dataSet.at(9).c_str()), atof(dataSet.at(10).c_str()));\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"ODOM\") {\n\t\t\t\todom.header.stamp = ros::Time::now();\n\t\t\t\todom.pose.pose.position.x += atof(dataSet.at(2).c_str()) \/ 100.0;\n\t\t\t\todom.pose.pose.position.y += atof(dataSet.at(3).c_str()) \/ 100.0;\n\t\t\t\todom.pose.pose.position.z = 0.0;\n\t\t\t\todom.pose.pose.orientation = tf::createQuaternionMsgFromYaw(atof(dataSet.at(4).c_str()));\n\t\t\t\todom.twist.twist.linear.x = atof(dataSet.at(5).c_str()) \/ 100.0;\n\t\t\t\todom.twist.twist.linear.y = atof(dataSet.at(6).c_str()) \/ 100.0;\n\t\t\t\todom.twist.twist.angular.z = atof(dataSet.at(7).c_str());\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"USL\") {\n\t\t\t\tsonarLeft.header.stamp = ros::Time::now();\n\t\t\t\tsonarLeft.range = atof(dataSet.at(2).c_str()) \/ 100.0;\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"USC\") {\n\t\t\t\tsonarCenter.header.stamp = ros::Time::now();\n\t\t\t\tsonarCenter.range = atof(dataSet.at(2).c_str()) \/ 100.0;\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"USR\") {\n\t\t\t\tsonarRight.header.stamp = ros::Time::now();\n\t\t\t\tsonarRight.range = atof(dataSet.at(2).c_str()) \/ 100.0;\n\t\t\t}\n\n\t\t}\n\t}\n}\n<commit_msg>Delete unused variables from abridge package<commit_after>#include <ros\/ros.h>\n\n\/\/ROS libraries\n#include <tf\/transform_datatypes.h>\n\n\/\/ROS messages\n#include <std_msgs\/Float32.h>\n#include <std_msgs\/String.h>\n#include <geometry_msgs\/Quaternion.h>\n#include <geometry_msgs\/QuaternionStamped.h>\n#include <geometry_msgs\/Twist.h>\n#include <nav_msgs\/Odometry.h>\n#include <sensor_msgs\/Imu.h>\n#include <sensor_msgs\/Range.h>\n\n\/\/Package include\n#include <usbSerial.h>\n\nusing namespace std;\n\n\/\/aBridge functions\nvoid cmdHandler(const geometry_msgs::Twist::ConstPtr& message);\nvoid fingerAngleHandler(const std_msgs::Float32::ConstPtr& angle);\nvoid wristAngleHandler(const std_msgs::Float32::ConstPtr& angle);\nvoid serialActivityTimer(const ros::TimerEvent& e);\nvoid publishRosTopics();\nvoid parseData(string data);\n\n\/\/Globals\ngeometry_msgs::QuaternionStamped fingerAngle;\ngeometry_msgs::QuaternionStamped wristAngle;\nsensor_msgs::Imu imu;\nnav_msgs::Odometry odom;\nsensor_msgs::Range sonarLeft;\nsensor_msgs::Range sonarCenter;\nsensor_msgs::Range sonarRight;\nUSBSerial usb;\nconst int baud = 115200;\nchar dataCmd[] = \"d\\n\";\nchar moveCmd[16];\nchar host[128];\nfloat linearSpeed = 0.;\nfloat turnSpeed = 0.;\nconst float deltaTime = 0.1;\n\n\/\/Publishers\nros::Publisher fingerAnglePublish;\nros::Publisher wristAnglePublish;\nros::Publisher imuPublish;\nros::Publisher odomPublish;\nros::Publisher sonarLeftPublish;\nros::Publisher sonarCenterPublish;\nros::Publisher sonarRightPublish;\n\n\/\/Subscribers\nros::Subscriber velocitySubscriber;\nros::Subscriber fingerAngleSubscriber;\nros::Subscriber wristAngleSubscriber;\n\n\/\/Timers\nros::Timer publishTimer;\n\nint main(int argc, char **argv) {\n    \n    gethostname(host, sizeof (host));\n    string hostname(host);\n    string publishedName;\n    ros::init(argc, argv, (hostname + \"_ABRIDGE\"));\n    \n    ros::NodeHandle param(\"~\");\n    string devicePath;\n    param.param(\"device\", devicePath, string(\"\/dev\/ttyUSB0\"));\n    usb.openUSBPort(devicePath, baud);\n    \n    sleep(5);\n    \n    ros::NodeHandle aNH;\n    \n    if (argc >= 2) {\n        publishedName = argv[1];\n        cout << \"Welcome to the world of tomorrow \" << publishedName << \"!  ABridge module started.\" << endl;\n    } else {\n        publishedName = hostname;\n        cout << \"No Name Selected. Default is: \" << publishedName << endl;\n    }\n    \n    fingerAnglePublish = aNH.advertise<geometry_msgs::QuaternionStamped>((publishedName + \"\/fingerAngle\/prev_cmd\"), 10);\n    wristAnglePublish = aNH.advertise<geometry_msgs::QuaternionStamped>((publishedName + \"\/wristAngle\/prev_cmd\"), 10);\n    imuPublish = aNH.advertise<sensor_msgs::Imu>((publishedName + \"\/imu\"), 10);\n    odomPublish = aNH.advertise<nav_msgs::Odometry>((publishedName + \"\/odom\"), 10);\n    sonarLeftPublish = aNH.advertise<sensor_msgs::Range>((publishedName + \"\/sonarLeft\"), 10);\n    sonarCenterPublish = aNH.advertise<sensor_msgs::Range>((publishedName + \"\/sonarCenter\"), 10);\n    sonarRightPublish = aNH.advertise<sensor_msgs::Range>((publishedName + \"\/sonarRight\"), 10);\n    \n    velocitySubscriber = aNH.subscribe((publishedName + \"\/velocity\"), 10, cmdHandler);\n    fingerAngleSubscriber = aNH.subscribe((publishedName + \"\/fingerAngle\/cmd\"), 1, fingerAngleHandler);\n    wristAngleSubscriber = aNH.subscribe((publishedName + \"\/wristAngle\/cmd\"), 1, wristAngleHandler);\n    \n    publishTimer = aNH.createTimer(ros::Duration(deltaTime), serialActivityTimer);\n    \n    imu.header.frame_id = publishedName+\"\/base_link\";\n    \n    odom.header.frame_id = publishedName+\"\/odom\";\n    odom.child_frame_id = publishedName+\"\/base_link\";\n\n    ros::spin();\n    \n    return EXIT_SUCCESS;\n}\n\nvoid cmdHandler(const geometry_msgs::Twist::ConstPtr& message) {\n    \/\/ remove artificial factor that was multiplied for simulation. this scales it back down to -1.0 to +1.0\n  linearSpeed = (message->linear.x); \/\/ \/ 1.5;\n  turnSpeed = (message->angular.z); \/\/ \/ 8;\n    \n    if (linearSpeed != 0.) {\n        sprintf(moveCmd, \"m,%d\\n\", (int) (linearSpeed * 255));\n        usb.sendData(moveCmd);\n    } else if (turnSpeed != 0.) {\n        sprintf(moveCmd, \"t,%d\\n\", (int) (turnSpeed * 255));\n        usb.sendData(moveCmd);\n    } else {\n        sprintf(moveCmd, \"s\\n\");\n        usb.sendData(moveCmd);\n    }\n    \n    memset(&moveCmd, '\\0', sizeof (moveCmd));\n}\n\n\/\/ The finger and wrist handlers receive gripper angle commands in floating point\n\/\/ radians, write them to a string and send that to the arduino\n\/\/ for processing.\nvoid fingerAngleHandler(const std_msgs::Float32::ConstPtr& angle) {\n  char cmd[16]={'\\0'};\n\n  \/\/ Avoid dealing with negative exponents which confuse the conversion to string by checking if the angle is small\n  if (angle->data < 0.01) {\n    \/\/ 'f' indicates this is a finger command to the arduino\n    sprintf(cmd, \"f,0\\n\");\n  } else {\n    sprintf(cmd, \"f,%.4g\\n\", angle->data);\n  }\n  usb.sendData(cmd);\n  memset(&cmd, '\\0', sizeof (cmd));\n}\n\nvoid wristAngleHandler(const std_msgs::Float32::ConstPtr& angle) {\n    char cmd[16]={'\\0'};\n\n    \/\/ Avoid dealing with negative exponents which confuse the conversion to string by checking if the angle is small\n  if (angle->data < 0.01) {\n    \/\/ 'w' indicates this is a wrist command to the arduino\n    sprintf(cmd, \"w,0\\n\");\n  } else {\n    sprintf(cmd, \"w,%.4g\\n\", angle->data);\n  }\n  usb.sendData(cmd);\n  memset(&cmd, '\\0', sizeof (cmd));\n}\n\nvoid serialActivityTimer(const ros::TimerEvent& e) {\n    usb.sendData(dataCmd);\n    parseData(usb.readData());\n    publishRosTopics();\n}\n\nvoid publishRosTopics() {\n    fingerAnglePublish.publish(fingerAngle);\n    wristAnglePublish.publish(wristAngle);\n    imuPublish.publish(imu);\n    odomPublish.publish(odom);\n    sonarLeftPublish.publish(sonarLeft);\n    sonarCenterPublish.publish(sonarCenter);\n    sonarRightPublish.publish(sonarRight);\n}\n\nvoid parseData(string str) {\n    istringstream oss(str);\n    string sentence;\n    \n    while (getline(oss, sentence, '\\n')) {\n\t\tistringstream wss(sentence);\n\t\tstring word;\n\n\t\tvector<string> dataSet;\n\t\twhile (getline(wss, word, ',')) {\n\t\t\tdataSet.push_back(word);\n\t\t}\n\n\t\tif (dataSet.size() >= 3 && dataSet.at(1) == \"1\") {\n\n\t\t\tif (dataSet.at(0) == \"GRF\") {\n\t\t\t\tfingerAngle.header.stamp = ros::Time::now();\n\t\t\t\tfingerAngle.quaternion = tf::createQuaternionMsgFromRollPitchYaw(atof(dataSet.at(2).c_str()), 0.0, 0.0);\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"GRW\") {\n\t\t\t\twristAngle.header.stamp = ros::Time::now();\n\t\t\t\twristAngle.quaternion = tf::createQuaternionMsgFromRollPitchYaw(atof(dataSet.at(2).c_str()), 0.0, 0.0);\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"IMU\") {\n\t\t\t\timu.header.stamp = ros::Time::now();\n\t\t\t\timu.linear_acceleration.x = atof(dataSet.at(2).c_str());\n\t\t\t\timu.linear_acceleration.y = atof(dataSet.at(3).c_str());\n\t\t\t\timu.linear_acceleration.z = atof(dataSet.at(4).c_str());\n\t\t\t\timu.angular_velocity.x = atof(dataSet.at(5).c_str());\n\t\t\t\timu.angular_velocity.y = atof(dataSet.at(6).c_str());\n\t\t\t\timu.angular_velocity.z = atof(dataSet.at(7).c_str());\n\t\t\t\timu.orientation = tf::createQuaternionMsgFromRollPitchYaw(atof(dataSet.at(8).c_str()), atof(dataSet.at(9).c_str()), atof(dataSet.at(10).c_str()));\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"ODOM\") {\n\t\t\t\todom.header.stamp = ros::Time::now();\n\t\t\t\todom.pose.pose.position.x += atof(dataSet.at(2).c_str()) \/ 100.0;\n\t\t\t\todom.pose.pose.position.y += atof(dataSet.at(3).c_str()) \/ 100.0;\n\t\t\t\todom.pose.pose.position.z = 0.0;\n\t\t\t\todom.pose.pose.orientation = tf::createQuaternionMsgFromYaw(atof(dataSet.at(4).c_str()));\n\t\t\t\todom.twist.twist.linear.x = atof(dataSet.at(5).c_str()) \/ 100.0;\n\t\t\t\todom.twist.twist.linear.y = atof(dataSet.at(6).c_str()) \/ 100.0;\n\t\t\t\todom.twist.twist.angular.z = atof(dataSet.at(7).c_str());\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"USL\") {\n\t\t\t\tsonarLeft.header.stamp = ros::Time::now();\n\t\t\t\tsonarLeft.range = atof(dataSet.at(2).c_str()) \/ 100.0;\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"USC\") {\n\t\t\t\tsonarCenter.header.stamp = ros::Time::now();\n\t\t\t\tsonarCenter.range = atof(dataSet.at(2).c_str()) \/ 100.0;\n\t\t\t}\n\t\t\telse if (dataSet.at(0) == \"USR\") {\n\t\t\t\tsonarRight.header.stamp = ros::Time::now();\n\t\t\t\tsonarRight.range = atof(dataSet.at(2).c_str()) \/ 100.0;\n\t\t\t}\n\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (C) 2016 - Gbor \"Razzie\" Grzsny\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject 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, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE\n*\/\n\n#pragma once\n\n#include <array>\n#include <cstdint>\n#include <iosfwd>\n#include <random>\n#include <type_traits>\n\nnamespace raz\n{\n\t\/*\n\t * RandomGenerator is based on the xorshift128+ algorithm\n\t * https:\/\/en.wikipedia.org\/wiki\/Xorshift\n\t *\/\n\tclass RandomGenerator\n\t{\n\tpublic:\n\t\ttypedef uint64_t result_type;\n\t\tstatic constexpr result_type default_seed = 1;\n\t\t\n\t\tRandomGenerator(result_type value = default_seed)\n\t\t{\n\t\t\tseed(value);\n\t\t}\n\n\t\ttemplate<class Sseq>\n\t\tRandomGenerator(Sseq& seq)\n\t\t{\n\t\t\tseed(seq);\n\t\t}\n\n\t\tRandomGenerator(const RandomGenerator& other) :\n\t\t\tm_state(other.m_state)\n\t\t{\n\t\t}\n\n\t\tRandomGenerator& operator=(const RandomGenerator& other)\n\t\t{\n\t\t\tm_state = other.m_state;\n\t\t\treturn *this;\n\t\t}\n\n\t\tvoid seed(result_type value = default_seed)\n\t\t{\n\t\t\tm_state[0] = value;\n\t\t\tm_state[1] = 0;\n\t\t}\n\n\t\ttemplate<class Sseq>\n\t\tvoid seed(Sseq& seq)\n\t\t{\n\t\t\tseq.generate(m_state.begin(), m_state.end());\n\t\t}\n\n\t\tresult_type operator()()\n\t\t{\n\t\t\tuint64_t x = m_state[0];\n\t\t\tuint64_t const y = m_state[1];\n\t\t\tm_state[0] = y;\n\t\t\tx ^= x << 23; \/\/ a\n\t\t\tm_state[1] = x ^ y ^ (x >> 17) ^ (y >> 26); \/\/ b, c\n\t\t\treturn (m_state[1] + y);\n\t\t}\n\n\t\tvoid discard(unsigned long long z)\n\t\t{\n\t\t\tfor (unsigned long long i = 0; i < z; ++i)\n\t\t\t{\n\t\t\t\tuint64_t x = m_state[0];\n\t\t\t\tuint64_t const y = m_state[1];\n\t\t\t\tm_state[0] = y;\n\t\t\t\tx ^= x << 23; \/\/ a\n\t\t\t\tm_state[1] = x ^ y ^ (x >> 17) ^ (y >> 26); \/\/ b, c\n\t\t\t}\n\t\t}\n\n\t\tbool operator==(const RandomGenerator& other) const\n\t\t{\n\t\t\treturn (m_state == other.m_state);\n\t\t}\n\n\t\tbool operator!=(const RandomGenerator& other) const\n\t\t{\n\t\t\treturn (m_state != other.m_state);\n\t\t}\n\n\t\ttemplate<class Serializer>\n\t\tvoid operator()(Serializer& serializer)\n\t\t{\n\t\t\tserializer(m_state[0])(m_state[1]);\n\t\t}\n\n#pragma push_macro(\"__raz\")\n#undef min\n#undef max\n\t\tstatic constexpr result_type min()\n\t\t{\n\t\t\treturn (0);\n\t\t}\n\n\t\tstatic constexpr result_type max()\n\t\t{\n\t\t\treturn ((result_type)-1);\n\t\t}\n#pragma pop_macro(\"__raz\")\n\n\t\ttemplate<class CharT, class Traits>\n\t\tfriend std::basic_ostream<CharT, Traits>&\n\t\t\toperator<<(std::basic_ostream<CharT, Traits>& ost, const RandomGenerator& gen)\n\t\t{\n\t\t\treturn (ost << gen.m_state[0] << \" \" << gen.m_state[1]);\n\t\t}\n\n\t\ttemplate<class CharT, class Traits>\n\t\tfriend std::basic_istream<CharT, Traits>&\n\t\t\toperator>>(std::basic_istream<CharT, Traits>& ist, RandomGenerator& gen)\n\t\t{\n\t\t\treturn (ist >> gen.m_state[0] >> gen.m_state[1]);\n\t\t}\n\n\tprivate:\n\t\tstd::array<uint64_t, 2> m_state;\n\t};\n\n\ttemplate<class Generator>\n\tclass RandomDistributor\n\t{\n\tpublic:\n\t\tRandomDistributor(Generator& generator) :\n\t\t\tm_generator(&generator)\n\t\t{\n\t\t}\n\n\t\tRandomDistributor(const RandomDistributor& other) :\n\t\t\tm_generator(other.m_generator)\n\t\t{\n\t\t}\n\n\t\tRandomDistributor& operator=(const RandomDistributor& other) = default;\n\n\t\ttemplate<class IntType>\n\t\tstd::enable_if_t<std::is_integral<IntType>::value, IntType>\n\t\t\toperator()(IntType min_value, IntType max_value)\n\t\t{\n\t\t\tstd::uniform_int_distribution<IntType> dist(min_value, max_value);\n\t\t\treturn dist(*m_generator);\n\t\t}\n\n\t\ttemplate<class RealType>\n\t\tstd::enable_if_t<std::is_floating_point<RealType>::value, RealType>\n\t\t\toperator()(RealType min_value, RealType max_value)\n\t\t{\n\t\t\tstd::uniform_real_distribution<RealType> dist(min_value, max_value);\n\t\t\treturn dist(*m_generator);\n\t\t}\n\n\tprivate:\n\t\tGenerator* m_generator;\n\t};\n\n\tclass Random : public RandomGenerator, public RandomDistributor<RandomGenerator>\n\t{\n\tpublic:\n\t\tRandom(result_type value = default_seed) :\n\t\t\tRandomGenerator(value),\n\t\t\tRandomDistributor<RandomGenerator>(*this)\n\t\t{\n\t\t}\n\n\t\ttemplate<class Sseq>\n\t\tRandom(Sseq& seq) :\n\t\t\tRandomGenerator(seq),\n\t\t\tRandomDistributor<RandomGenerator>(*this)\n\t\t{\n\t\t}\n\n\t\tRandom(const RandomGenerator& gen) :\n\t\t\tRandomGenerator(gen),\n\t\t\tRandomDistributor<RandomGenerator>(*this)\n\t\t{\n\t\t}\n\n\t\tRandom& operator=(const Random& other)\n\t\t{\n\t\t\tRandomGenerator::operator=(other);\n\t\t\treturn *this;\n\t\t}\n\t};\n}\n<commit_msg>Changed copy assignment operator of Random<commit_after>\/*\nCopyright (C) 2016 - Gbor \"Razzie\" Grzsny\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject 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, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE\n*\/\n\n#pragma once\n\n#include <array>\n#include <cstdint>\n#include <iosfwd>\n#include <random>\n#include <type_traits>\n\nnamespace raz\n{\n\t\/*\n\t * RandomGenerator is based on the xorshift128+ algorithm\n\t * https:\/\/en.wikipedia.org\/wiki\/Xorshift\n\t *\/\n\tclass RandomGenerator\n\t{\n\tpublic:\n\t\ttypedef uint64_t result_type;\n\t\tstatic constexpr result_type default_seed = 1;\n\t\t\n\t\tRandomGenerator(result_type value = default_seed)\n\t\t{\n\t\t\tseed(value);\n\t\t}\n\n\t\ttemplate<class Sseq>\n\t\tRandomGenerator(Sseq& seq)\n\t\t{\n\t\t\tseed(seq);\n\t\t}\n\n\t\tRandomGenerator(const RandomGenerator& other) :\n\t\t\tm_state(other.m_state)\n\t\t{\n\t\t}\n\n\t\tRandomGenerator& operator=(const RandomGenerator& other)\n\t\t{\n\t\t\tm_state = other.m_state;\n\t\t\treturn *this;\n\t\t}\n\n\t\tvoid seed(result_type value = default_seed)\n\t\t{\n\t\t\tm_state[0] = value;\n\t\t\tm_state[1] = 0;\n\t\t}\n\n\t\ttemplate<class Sseq>\n\t\tvoid seed(Sseq& seq)\n\t\t{\n\t\t\tseq.generate(m_state.begin(), m_state.end());\n\t\t}\n\n\t\tresult_type operator()()\n\t\t{\n\t\t\tuint64_t x = m_state[0];\n\t\t\tuint64_t const y = m_state[1];\n\t\t\tm_state[0] = y;\n\t\t\tx ^= x << 23; \/\/ a\n\t\t\tm_state[1] = x ^ y ^ (x >> 17) ^ (y >> 26); \/\/ b, c\n\t\t\treturn (m_state[1] + y);\n\t\t}\n\n\t\tvoid discard(unsigned long long z)\n\t\t{\n\t\t\tfor (unsigned long long i = 0; i < z; ++i)\n\t\t\t{\n\t\t\t\tuint64_t x = m_state[0];\n\t\t\t\tuint64_t const y = m_state[1];\n\t\t\t\tm_state[0] = y;\n\t\t\t\tx ^= x << 23; \/\/ a\n\t\t\t\tm_state[1] = x ^ y ^ (x >> 17) ^ (y >> 26); \/\/ b, c\n\t\t\t}\n\t\t}\n\n\t\tbool operator==(const RandomGenerator& other) const\n\t\t{\n\t\t\treturn (m_state == other.m_state);\n\t\t}\n\n\t\tbool operator!=(const RandomGenerator& other) const\n\t\t{\n\t\t\treturn (m_state != other.m_state);\n\t\t}\n\n\t\ttemplate<class Serializer>\n\t\tvoid operator()(Serializer& serializer)\n\t\t{\n\t\t\tserializer(m_state[0])(m_state[1]);\n\t\t}\n\n#pragma push_macro(\"__raz\")\n#undef min\n#undef max\n\t\tstatic constexpr result_type min()\n\t\t{\n\t\t\treturn (0);\n\t\t}\n\n\t\tstatic constexpr result_type max()\n\t\t{\n\t\t\treturn ((result_type)-1);\n\t\t}\n#pragma pop_macro(\"__raz\")\n\n\t\ttemplate<class CharT, class Traits>\n\t\tfriend std::basic_ostream<CharT, Traits>&\n\t\t\toperator<<(std::basic_ostream<CharT, Traits>& ost, const RandomGenerator& gen)\n\t\t{\n\t\t\treturn (ost << gen.m_state[0] << \" \" << gen.m_state[1]);\n\t\t}\n\n\t\ttemplate<class CharT, class Traits>\n\t\tfriend std::basic_istream<CharT, Traits>&\n\t\t\toperator>>(std::basic_istream<CharT, Traits>& ist, RandomGenerator& gen)\n\t\t{\n\t\t\treturn (ist >> gen.m_state[0] >> gen.m_state[1]);\n\t\t}\n\n\tprivate:\n\t\tstd::array<uint64_t, 2> m_state;\n\t};\n\n\ttemplate<class Generator>\n\tclass RandomDistributor\n\t{\n\tpublic:\n\t\tRandomDistributor(Generator& generator) :\n\t\t\tm_generator(&generator)\n\t\t{\n\t\t}\n\n\t\tRandomDistributor(const RandomDistributor& other) :\n\t\t\tm_generator(other.m_generator)\n\t\t{\n\t\t}\n\n\t\tRandomDistributor& operator=(const RandomDistributor& other) = default;\n\n\t\ttemplate<class IntType>\n\t\tstd::enable_if_t<std::is_integral<IntType>::value, IntType>\n\t\t\toperator()(IntType min_value, IntType max_value)\n\t\t{\n\t\t\tstd::uniform_int_distribution<IntType> dist(min_value, max_value);\n\t\t\treturn dist(*m_generator);\n\t\t}\n\n\t\ttemplate<class RealType>\n\t\tstd::enable_if_t<std::is_floating_point<RealType>::value, RealType>\n\t\t\toperator()(RealType min_value, RealType max_value)\n\t\t{\n\t\t\tstd::uniform_real_distribution<RealType> dist(min_value, max_value);\n\t\t\treturn dist(*m_generator);\n\t\t}\n\n\tprivate:\n\t\tGenerator* m_generator;\n\t};\n\n\tclass Random : public RandomGenerator, public RandomDistributor<RandomGenerator>\n\t{\n\tpublic:\n\t\tRandom(result_type value = default_seed) :\n\t\t\tRandomGenerator(value),\n\t\t\tRandomDistributor<RandomGenerator>(*this)\n\t\t{\n\t\t}\n\n\t\ttemplate<class Sseq>\n\t\tRandom(Sseq& seq) :\n\t\t\tRandomGenerator(seq),\n\t\t\tRandomDistributor<RandomGenerator>(*this)\n\t\t{\n\t\t}\n\n\t\tRandom(const RandomGenerator& gen) :\n\t\t\tRandomGenerator(gen),\n\t\t\tRandomDistributor<RandomGenerator>(*this)\n\t\t{\n\t\t}\n\n\t\tRandom& operator=(const RandomGenerator& other)\n\t\t{\n\t\t\tRandomGenerator::operator=(other);\n\t\t\treturn *this;\n\t\t}\n\t};\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (C) Gbor \"Razzie\" Grzsny\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject 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, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE\n*\/\n\n#pragma once\n\n#include <iosfwd>\n#include <locale>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <type_traits>\n\nnamespace raz\n{\n\ttemplate<class T>\n\tclass HasStreamInserter\n\t{\n\t\ttemplate<class U>\n\t\tstatic constexpr auto test() -> decltype(bool(std::declval<std::ostream&>() << std::declval<const U&>()))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\n\t\ttemplate<class U>\n\t\tstatic constexpr bool test(...)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\tpublic:\n\t\tconstexpr static bool value = test<T>();\n\t};\n\n\ttemplate<class T>\n\tclass HasStreamExtractor\n\t{\n\t\ttemplate<class U>\n\t\tstatic constexpr auto test() -> decltype(bool(std::declval<std::ostream&>() >> std::declval<U&>()))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\n\t\ttemplate<class U>\n\t\tstatic constexpr bool test(...)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\tpublic:\n\t\tconstexpr static bool value = test<T>();\n\t};\n\n\tstruct __FallbackType\n\t{\n\t\ttemplate<class T>\n\t\t__FallbackType(const T&) : type(&typeid(T))\n\t\t{\n\t\t}\n\n\t\tfriend std::ostream& operator<< (std::ostream& os, const __FallbackType& t)\n\t\t{\n\t\t\tos << t.type->name();\n\t\t\treturn os;\n\t\t}\n\n\t\tfriend std::istream& operator>> (std::istream& is, __FallbackType&)\n\t\t{\n\t\t\treturn is;\n\t\t}\n\n\t\tconst std::type_info* type;\n\t};\n\n\ttemplate<class T>\n\tstd::conditional_t<HasStreamInserter<T>::value, const T&, __FallbackType> insert(const T& t)\n\t{\n\t\treturn { t };\n\t}\n\n\ttemplate<class T>\n\tstd::conditional_t<HasStreamExtractor<T>::value, T&, __FallbackType> extract(T& t)\n\t{\n\t\treturn { t };\n\t}\n\n\n\ttemplate<class To, class From>\n\tTo lexical_cast(const From& from)\n\t{\n\t\tTo to;\n\t\tstd::sstream ss;\n\t\tss << from;\n\t\tss >> to;\n\t\treturn to;\n\t}\n\n\n\ttemplate<class T>\n\tclass StreamManipulator\n\t{\n\tpublic:\n\t\ttypedef std::ios&(*Manipulator)(std::ios&, T);\n\n\t\texplicit StreamManipulator(Manipulator m, T t) :\n\t\t\tm_manip(m), m_value(t)\n\t\t{\n\t\t}\n\n\t\tfriend std::ios& operator<< (std::ios& io, const StreamManipulator<T>& m)\n\t\t{\n\t\t\treturn m.m_manip(io, m.m_value);\n\t\t}\n\n\tprivate:\n\t\tManipulator m_manip;\n\t\tT m_value;\n\t};\n\n\ttemplate<class T>\n\tclass IstreamManipulator\n\t{\n\tpublic:\n\t\ttypedef std::istream&(*Manipulator)(std::istream&, T);\n\n\t\texplicit IstreamManipulator(Manipulator m, T t) :\n\t\t\tm_manip(m), m_value(t)\n\t\t{\n\t\t}\n\n\t\tfriend std::istream& operator<< (std::istream& io, const IstreamManipulator<T>& m)\n\t\t{\n\t\t\treturn m.m_manip(io, m.m_value);\n\t\t}\n\n\tprivate:\n\t\tManipulator m_manip;\n\t\tT m_value;\n\t};\n\n\ttemplate<class T>\n\tclass OstreamManipulator\n\t{\n\tpublic:\n\t\ttypedef std::ostream&(*Manipulator)(std::ostream&, T);\n\n\t\texplicit OstreamManipulator(Manipulator m, T t) :\n\t\t\tm_manip(m), m_value(t)\n\t\t{\n\t\t}\n\n\t\tfriend std::ostream& operator<< (std::ostream& io, const OstreamManipulator<T>& m)\n\t\t{\n\t\t\treturn m.m_manip(io, m.m_value);\n\t\t}\n\n\tprivate:\n\t\tManipulator m_manip;\n\t\tT m_value;\n\t};\n\n\n\ttemplate<class T>\n\tOstreamManipulator<T> hex(T t)\n\t{\n\t\tOstreamManipulator<T>::Manipulator m =\n\t\t\t[](std::ostream& o, T t) -> std::ostream&\n\t\t\t{\n\t\t\t\tconst char map[] = \"0123456789abcdef\";\n\t\t\t\tconst unsigned char* ptr = reinterpret_cast<const unsigned char*>(&t);\n\t\t\t\tfor (size_t i = 0; i < sizeof(T); ++i)\n\t\t\t\t{\n\t\t\t\t\tunsigned first = ptr[i] \/ 16;\n\t\t\t\t\tunsigned second = ptr[i] - (first * 16);\n\t\t\t\t\to << map[first] << map[second];\n\t\t\t\t}\n\t\t\t\treturn o;\n\t\t\t};\n\n\t\treturn OstreamManipulator<T>(m, t);\n\t}\n\n\tinline OstreamManipulator<const char*> format(const char* f)\n\t{\n\t\tOstreamManipulator<const char*>::Manipulator m =\n\t\t\t[](std::ostream& os, const char* fmt) -> std::ostream&\n\t\t\t{\n\t\t\t\tstd::locale& loc = os.getloc();\n\t\t\t\tint i = 0;\n\t\t\t\twhile (fmt[i] != 0)\n\t\t\t\t{\n\t\t\t\t\tif (fmt[i] != '%')\n\t\t\t\t\t{\n\t\t\t\t\t\tos << fmt[i];\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\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\tif (fmt[i] == '%')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tos << fmt[i];\n\t\t\t\t\t\t\ti++;\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\tbool ok = true;\n\t\t\t\t\t\t\tint istart = i;\n\t\t\t\t\t\t\tbool more = true;\n\t\t\t\t\t\t\tint width = 0;\n\t\t\t\t\t\t\tint precision = 6;\n\t\t\t\t\t\t\tstd::ios_base::fmtflags flags;\n\t\t\t\t\t\t\tchar fill = ' ';\n\t\t\t\t\t\t\tbool alternate = false;\n\t\t\t\t\t\t\twhile (more)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tswitch (fmt[i])\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcase '+':\n\t\t\t\t\t\t\t\t\tflags |= std::ios::showpos;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tcase '-':\n\t\t\t\t\t\t\t\t\tflags |= std::ios::left;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tcase '0':\n\t\t\t\t\t\t\t\t\tflags |= std::ios::internal;\n\t\t\t\t\t\t\t\t\tfill = '0';\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\t\talternate = true;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tcase ' ':\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\tmore = false;\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\tif (more) i++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (std::isdigit(fmt[i], loc))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\twidth = std::atoi(fmt + i);\n\t\t\t\t\t\t\t\tdo i++;\n\t\t\t\t\t\t\t\twhile (std::isdigit(fmt[i], loc));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (fmt[i] == '.')\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\t\tprecision = std::atoi(fmt + i);\n\t\t\t\t\t\t\t\twhile (std::isdigit(fmt[i], loc)) i++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tswitch (fmt[i])\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcase 'd':\n\t\t\t\t\t\t\t\tflags |= std::ios::dec;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'x':\n\t\t\t\t\t\t\t\tflags |= std::ios::hex;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showbase;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'X':\n\t\t\t\t\t\t\t\tflags |= std::ios::hex | std::ios::uppercase;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showbase;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'o':\n\t\t\t\t\t\t\t\tflags |= std::ios::hex;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showbase;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'f':\n\t\t\t\t\t\t\t\tflags |= std::ios::fixed;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'e':\n\t\t\t\t\t\t\t\tflags |= std::ios::scientific;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\tflags |= std::ios::scientific | std::ios::uppercase;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'g':\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'G':\n\t\t\t\t\t\t\t\tflags |= std::ios::uppercase;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\tif (fmt[i] != 0) ok = false;\n\t\t\t\t\t\t\tif (ok)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tos.unsetf(std::ios::adjustfield | std::ios::basefield |\n\t\t\t\t\t\t\t\t\tstd::ios::floatfield);\n\t\t\t\t\t\t\t\tos.setf(flags);\n\t\t\t\t\t\t\t\tos.width(width);\n\t\t\t\t\t\t\t\tos.precision(precision);\n\t\t\t\t\t\t\t\tos.fill(fill);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse i = istart;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn os;\n\t\t\t};\n\n\t\treturn OstreamManipulator<const char*>(m, f);\n\t}\n\n\tinline IstreamManipulator<char> delimiter(char d)\n\t{\n\t\tstruct CustomLocale : std::ctype<char>\n\t\t{\n\t\t\tstd::ctype_base::mask m_rc[table_size];\n\n\t\t\tCustomLocale(char delim) :\n\t\t\t\tstd::ctype<char>(get_table(static_cast<unsigned char>(delim)))\n\t\t\t{\n\t\t\t}\n\n\t\t\tconst std::ctype_base::mask* get_table(unsigned char delim)\n\t\t\t{\n\t\t\t\tmemset(m_rc, 0, sizeof(std::ctype_base::mask) * table_size);\n\t\t\t\tm_rc[delim] = std::ctype_base::space;\n\t\t\t\tm_rc['\\n'] = std::ctype_base::space;\n\t\t\t\treturn &m_rc[0];\n\t\t\t}\n\t\t};\n\n\t\tIstreamManipulator<char>::Manipulator m =\n\t\t\t[](std::istream& i, char d) -> std::istream&\n\t\t\t{\n\t\t\t\ti.imbue(std::locale(i.getloc(), new CustomLocale(d)));\n\t\t\t\treturn i;\n\t\t\t};\n\n\t\treturn IstreamManipulator<char>(m, d);\n\t}\n\n\tinline IstreamManipulator<char> next(char d)\n\t{\n\t\tIstreamManipulator<char>::Manipulator m =\n\t\t\t[](std::istream& i, char d) -> std::istream&\n\t\t\t{\n#pragma push_macro(\"__raz\")\n#undef max\n\t\t\t\ti.ignore(std::numeric_limits<std::streamsize>::max(), d);\n#pragma pop_macro(\"__raz\")\n\t\t\t\treturn i;\n\t\t\t};\n\n\t\treturn IstreamManipulator<char>(m, d);\n\t}\n\n\tinline std::istream& nextLine(std::istream& i)\n\t{\n\t\treturn (i << next('\\n'));\n\t}\n\n\n\ttemplate<class Param>\n\tstd::tuple<Param> parse(std::istream& i, char* d = nullptr)\n\t{\n\t\tParam p;\n\t\tif (d) i << delimiter(*d);\n\t\tif (!static_cast<bool>(i >> extract(p)))\n\t\t\tthrow std::logic_error(\"parse error: \" + typeid(Param).name());\n\t\treturn std::tuple<Param> { p };\n\t}\n\n\ttemplate<class Param1, class Param2, class... Params>\n\tstd::tuple<Param1, Param2, Params...> parse(std::istream& i, char* d = nullptr)\n\t{\n\t\tif (d) i << delimiter(*d);\n\t\tauto a = parse<Param1>(i);\n\t\tauto b = parse<Param2, Params...>(i);\n\t\treturn std::tuple_cat(a, b);\n\t}\n\n\ttemplate<class... Params>\n\tstd::tuple<Params...> parse(std::string str, char* d = nullptr)\n\t{\n\t\tstd::stringstream ss(str);\n\t\tif (d) ss << delimiter(*d);\n\t\treturn parse<Params...>(ss);\n\t}\n};\n<commit_msg>Added raz::extract(std::string)<commit_after>\/*\nCopyright (C) Gbor \"Razzie\" Grzsny\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject 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, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE\n*\/\n\n#pragma once\n\n#include <iosfwd>\n#include <locale>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <type_traits>\n\nnamespace raz\n{\n\ttemplate<class T>\n\tclass HasStreamInserter\n\t{\n\t\ttemplate<class U>\n\t\tstatic constexpr auto test() -> decltype(bool(std::declval<std::ostream&>() << std::declval<const U&>()))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\n\t\ttemplate<class U>\n\t\tstatic constexpr bool test(...)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\tpublic:\n\t\tconstexpr static bool value = test<T>();\n\t};\n\n\ttemplate<class T>\n\tclass HasStreamExtractor\n\t{\n\t\ttemplate<class U>\n\t\tstatic constexpr auto test() -> decltype(bool(std::declval<std::ostream&>() >> std::declval<U&>()))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\n\t\ttemplate<class U>\n\t\tstatic constexpr bool test(...)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\tpublic:\n\t\tconstexpr static bool value = test<T>();\n\t};\n\n\tstruct __FallbackType\n\t{\n\t\ttemplate<class T>\n\t\t__FallbackType(const T&) : type(typeid(T))\n\t\t{\n\t\t}\n\n\t\tfriend std::ostream& operator<< (std::ostream& os, const __FallbackType& t)\n\t\t{\n\t\t\tos << t.type.name();\n\t\t\treturn os;\n\t\t}\n\n\t\tfriend std::istream& operator>> (std::istream& is, __FallbackType&)\n\t\t{\n\t\t\treturn is;\n\t\t}\n\n\t\tconst std::type_info& type;\n\t};\n\n\tstruct __StringFallbackType\n\t{\n\t\t__StringFallbackType(std::string& _str) : str(_str)\n\t\t{\n\t\t}\n\n\t\tfriend std::istream& operator>> (std::istream& is, __StringFallbackType& str)\n\t\t{\n\t\t\tstd::getline(is, str.str);\n\t\t\treturn is;\n\t\t}\n\n\t\tstd::string& str;\n\t};\n\n\ttemplate<class T>\n\tstd::conditional_t<HasStreamInserter<T>::value, const T&, __FallbackType> insert(const T& t)\n\t{\n\t\treturn { t };\n\t}\n\n\ttemplate<class T>\n\tstd::conditional_t<HasStreamExtractor<T>::value, T&, __FallbackType> extract(T& t)\n\t{\n\t\treturn { t };\n\t}\n\n\t__StringFallbackType extract(std::string& str)\n\t{\n\t\treturn { str };\n\t}\n\n\n\ttemplate<class To, class From>\n\tTo lexical_cast(const From& from)\n\t{\n\t\tTo to;\n\t\tstd::sstream ss;\n\t\tss << from;\n\t\tss >> to;\n\t\treturn to;\n\t}\n\n\n\ttemplate<class T>\n\tclass StreamManipulator\n\t{\n\tpublic:\n\t\ttypedef std::ios&(*Manipulator)(std::ios&, T);\n\n\t\texplicit StreamManipulator(Manipulator m, T t) :\n\t\t\tm_manip(m), m_value(t)\n\t\t{\n\t\t}\n\n\t\tfriend std::ios& operator<< (std::ios& io, const StreamManipulator<T>& m)\n\t\t{\n\t\t\treturn m.m_manip(io, m.m_value);\n\t\t}\n\n\tprivate:\n\t\tManipulator m_manip;\n\t\tT m_value;\n\t};\n\n\ttemplate<class T>\n\tclass IstreamManipulator\n\t{\n\tpublic:\n\t\ttypedef std::istream&(*Manipulator)(std::istream&, T);\n\n\t\texplicit IstreamManipulator(Manipulator m, T t) :\n\t\t\tm_manip(m), m_value(t)\n\t\t{\n\t\t}\n\n\t\tfriend std::istream& operator<< (std::istream& io, const IstreamManipulator<T>& m)\n\t\t{\n\t\t\treturn m.m_manip(io, m.m_value);\n\t\t}\n\n\tprivate:\n\t\tManipulator m_manip;\n\t\tT m_value;\n\t};\n\n\ttemplate<class T>\n\tclass OstreamManipulator\n\t{\n\tpublic:\n\t\ttypedef std::ostream&(*Manipulator)(std::ostream&, T);\n\n\t\texplicit OstreamManipulator(Manipulator m, T t) :\n\t\t\tm_manip(m), m_value(t)\n\t\t{\n\t\t}\n\n\t\tfriend std::ostream& operator<< (std::ostream& io, const OstreamManipulator<T>& m)\n\t\t{\n\t\t\treturn m.m_manip(io, m.m_value);\n\t\t}\n\n\tprivate:\n\t\tManipulator m_manip;\n\t\tT m_value;\n\t};\n\n\n\ttemplate<class T>\n\tOstreamManipulator<T> hex(T t)\n\t{\n\t\tOstreamManipulator<T>::Manipulator m =\n\t\t\t[](std::ostream& o, T t) -> std::ostream&\n\t\t\t{\n\t\t\t\tconst char map[] = \"0123456789abcdef\";\n\t\t\t\tconst unsigned char* ptr = reinterpret_cast<const unsigned char*>(&t);\n\t\t\t\tfor (size_t i = 0; i < sizeof(T); ++i)\n\t\t\t\t{\n\t\t\t\t\tunsigned first = ptr[i] \/ 16;\n\t\t\t\t\tunsigned second = ptr[i] - (first * 16);\n\t\t\t\t\to << map[first] << map[second];\n\t\t\t\t}\n\t\t\t\treturn o;\n\t\t\t};\n\n\t\treturn OstreamManipulator<T>(m, t);\n\t}\n\n\tinline OstreamManipulator<const char*> format(const char* f)\n\t{\n\t\tOstreamManipulator<const char*>::Manipulator m =\n\t\t\t[](std::ostream& os, const char* fmt) -> std::ostream&\n\t\t\t{\n\t\t\t\tstd::locale& loc = os.getloc();\n\t\t\t\tint i = 0;\n\t\t\t\twhile (fmt[i] != 0)\n\t\t\t\t{\n\t\t\t\t\tif (fmt[i] != '%')\n\t\t\t\t\t{\n\t\t\t\t\t\tos << fmt[i];\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\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\tif (fmt[i] == '%')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tos << fmt[i];\n\t\t\t\t\t\t\ti++;\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\tbool ok = true;\n\t\t\t\t\t\t\tint istart = i;\n\t\t\t\t\t\t\tbool more = true;\n\t\t\t\t\t\t\tint width = 0;\n\t\t\t\t\t\t\tint precision = 6;\n\t\t\t\t\t\t\tstd::ios_base::fmtflags flags;\n\t\t\t\t\t\t\tchar fill = ' ';\n\t\t\t\t\t\t\tbool alternate = false;\n\t\t\t\t\t\t\twhile (more)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tswitch (fmt[i])\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcase '+':\n\t\t\t\t\t\t\t\t\tflags |= std::ios::showpos;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tcase '-':\n\t\t\t\t\t\t\t\t\tflags |= std::ios::left;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tcase '0':\n\t\t\t\t\t\t\t\t\tflags |= std::ios::internal;\n\t\t\t\t\t\t\t\t\tfill = '0';\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\t\talternate = true;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tcase ' ':\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\tmore = false;\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\tif (more) i++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (std::isdigit(fmt[i], loc))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\twidth = std::atoi(fmt + i);\n\t\t\t\t\t\t\t\tdo i++;\n\t\t\t\t\t\t\t\twhile (std::isdigit(fmt[i], loc));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (fmt[i] == '.')\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\t\tprecision = std::atoi(fmt + i);\n\t\t\t\t\t\t\t\twhile (std::isdigit(fmt[i], loc)) i++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tswitch (fmt[i])\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcase 'd':\n\t\t\t\t\t\t\t\tflags |= std::ios::dec;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'x':\n\t\t\t\t\t\t\t\tflags |= std::ios::hex;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showbase;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'X':\n\t\t\t\t\t\t\t\tflags |= std::ios::hex | std::ios::uppercase;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showbase;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'o':\n\t\t\t\t\t\t\t\tflags |= std::ios::hex;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showbase;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'f':\n\t\t\t\t\t\t\t\tflags |= std::ios::fixed;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'e':\n\t\t\t\t\t\t\t\tflags |= std::ios::scientific;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\tflags |= std::ios::scientific | std::ios::uppercase;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'g':\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'G':\n\t\t\t\t\t\t\t\tflags |= std::ios::uppercase;\n\t\t\t\t\t\t\t\tif (alternate) flags |= std::ios::showpoint;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\tif (fmt[i] != 0) ok = false;\n\t\t\t\t\t\t\tif (ok)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tos.unsetf(std::ios::adjustfield | std::ios::basefield |\n\t\t\t\t\t\t\t\t\tstd::ios::floatfield);\n\t\t\t\t\t\t\t\tos.setf(flags);\n\t\t\t\t\t\t\t\tos.width(width);\n\t\t\t\t\t\t\t\tos.precision(precision);\n\t\t\t\t\t\t\t\tos.fill(fill);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse i = istart;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn os;\n\t\t\t};\n\n\t\treturn OstreamManipulator<const char*>(m, f);\n\t}\n\n\tinline IstreamManipulator<char> delimiter(char d)\n\t{\n\t\tstruct CustomLocale : std::ctype<char>\n\t\t{\n\t\t\tstd::ctype_base::mask m_rc[table_size];\n\n\t\t\tCustomLocale(char delim) :\n\t\t\t\tstd::ctype<char>(get_table(static_cast<unsigned char>(delim)))\n\t\t\t{\n\t\t\t}\n\n\t\t\tconst std::ctype_base::mask* get_table(unsigned char delim)\n\t\t\t{\n\t\t\t\tmemset(m_rc, 0, sizeof(std::ctype_base::mask) * table_size);\n\t\t\t\tm_rc[delim] = std::ctype_base::space;\n\t\t\t\tm_rc['\\n'] = std::ctype_base::space;\n\t\t\t\treturn &m_rc[0];\n\t\t\t}\n\t\t};\n\n\t\tIstreamManipulator<char>::Manipulator m =\n\t\t\t[](std::istream& i, char d) -> std::istream&\n\t\t\t{\n\t\t\t\ti.imbue(std::locale(i.getloc(), new CustomLocale(d)));\n\t\t\t\treturn i;\n\t\t\t};\n\n\t\treturn IstreamManipulator<char>(m, d);\n\t}\n\n\tinline IstreamManipulator<char> next(char d)\n\t{\n\t\tIstreamManipulator<char>::Manipulator m =\n\t\t\t[](std::istream& i, char d) -> std::istream&\n\t\t\t{\n#pragma push_macro(\"__raz\")\n#undef max\n\t\t\t\ti.ignore(std::numeric_limits<std::streamsize>::max(), d);\n#pragma pop_macro(\"__raz\")\n\t\t\t\treturn i;\n\t\t\t};\n\n\t\treturn IstreamManipulator<char>(m, d);\n\t}\n\n\tinline std::istream& nextLine(std::istream& i)\n\t{\n\t\treturn (i << next('\\n'));\n\t}\n\n\n\ttemplate<class Param>\n\tstd::tuple<Param> parse(std::istream& i, char* d = nullptr)\n\t{\n\t\tParam p;\n\t\tif (d) i << delimiter(*d);\n\t\tif (!static_cast<bool>(i >> extract(p)))\n\t\t\tthrow std::logic_error(\"parse error: \" + typeid(Param).name());\n\t\treturn std::tuple<Param> { p };\n\t}\n\n\ttemplate<class Param1, class Param2, class... Params>\n\tstd::tuple<Param1, Param2, Params...> parse(std::istream& i, char* d = nullptr)\n\t{\n\t\tif (d) i << delimiter(*d);\n\t\tauto a = parse<Param1>(i);\n\t\tauto b = parse<Param2, Params...>(i);\n\t\treturn std::tuple_cat(a, b);\n\t}\n\n\ttemplate<class... Params>\n\tstd::tuple<Params...> parse(std::string str, char* d = nullptr)\n\t{\n\t\tstd::stringstream ss(str);\n\t\tif (d) ss << delimiter(*d);\n\t\treturn parse<Params...>(ss);\n\t}\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"Runtime\/World\/CWorldLight.hpp\"\n\n#include <cfloat>\n\nnamespace urde {\nCWorldLight::CWorldLight(CInputStream& in)\n: x0_type(EWorldLightType(in.readUint32Big()))\n, x4_color(zeus::CVector3f::ReadBig(in))\n, x10_position(zeus::CVector3f::ReadBig(in))\n, x1c_direction(zeus::CVector3f::ReadBig(in))\n, x28_q(in.readFloatBig())\n, x2c_cutoffAngle(in.readFloatBig())\n, x30_(in.readFloatBig())\n, x34_castShadows(in.readBool())\n, x38_(in.readFloatBig())\n, x3c_falloff(EFalloffType(in.readUint32Big()))\n, x40_(in.readFloatBig()) {}\n\nstd::tuple<float, float, float> CalculateLightFalloff(EFalloffType falloff, float q) {\n  float constant = 0.f;\n  float linear = 0.f;\n  float quadratic = 0.f;\n\n  if (falloff == EFalloffType::Constant)\n    constant = 2.f \/ q;\n  else if (falloff == EFalloffType::Linear)\n    linear = 250.f \/ q;\n  else if (falloff == EFalloffType::Quadratic)\n    quadratic = 25000.f \/ q;\n\n  return {constant, linear, quadratic};\n}\n\nCLight CWorldLight::GetAsCGraphicsLight() const {\n  zeus::CVector3f float_color = x4_color;\n  float q = x28_q;\n  if (q < FLT_EPSILON)\n    q = 0.000001f;\n\n  if (x0_type == EWorldLightType::LocalAmbient) {\n    float_color *= zeus::CVector3f(q);\n    if (float_color.x() >= 1.f)\n      float_color.x() = 1.f;\n\n    if (float_color.y() >= 1.f)\n      float_color.y() = 1.f;\n\n    if (float_color.z() >= 1.f)\n      float_color.z() = 1.f;\n\n    return CLight::BuildLocalAmbient(x10_position,\n                                     zeus::CColor(float_color.x(), float_color.y(), float_color.z(), 1.f));\n  } else if (x0_type == EWorldLightType::Directional) {\n    return CLight::BuildDirectional(x1c_direction, zeus::CColor{x4_color.x(), x4_color.y(), x4_color.z(), 1.f});\n  } else if (x0_type == EWorldLightType::Spot) {\n    CLight light =\n        CLight::BuildSpot(x10_position, x1c_direction.normalized(),\n                          zeus::CColor{x4_color.x(), x4_color.y(), x4_color.z(), 1.f}, x2c_cutoffAngle * .5f);\n\n    float c, l, q;\n    std::tie(c, l, q) = CalculateLightFalloff(x3c_falloff, x28_q);\n\n    light.SetAttenuation(c, l, q);\n    return light;\n  }\n  float distC, distL, distQ;\n  std::tie(distC, distL, distQ) = CalculateLightFalloff(x3c_falloff, x28_q);\n  return CLight::BuildCustom(x10_position, zeus::CVector3f{0.f, 1.f, 0.f},\n                             zeus::CColor{x4_color.x(), x4_color.y(), x4_color.z(), 1.f}, distC, distL, distQ, 1.f, 0.f,\n                             0.f);\n}\n} \/\/ namespace urde\n<commit_msg>CWorldLight: Eliminate variable shadowing<commit_after>#include \"Runtime\/World\/CWorldLight.hpp\"\n\n#include <cfloat>\n\nnamespace urde {\nCWorldLight::CWorldLight(CInputStream& in)\n: x0_type(EWorldLightType(in.readUint32Big()))\n, x4_color(zeus::CVector3f::ReadBig(in))\n, x10_position(zeus::CVector3f::ReadBig(in))\n, x1c_direction(zeus::CVector3f::ReadBig(in))\n, x28_q(in.readFloatBig())\n, x2c_cutoffAngle(in.readFloatBig())\n, x30_(in.readFloatBig())\n, x34_castShadows(in.readBool())\n, x38_(in.readFloatBig())\n, x3c_falloff(EFalloffType(in.readUint32Big()))\n, x40_(in.readFloatBig()) {}\n\nstd::tuple<float, float, float> CalculateLightFalloff(EFalloffType falloff, float q) {\n  float constant = 0.f;\n  float linear = 0.f;\n  float quadratic = 0.f;\n\n  if (falloff == EFalloffType::Constant)\n    constant = 2.f \/ q;\n  else if (falloff == EFalloffType::Linear)\n    linear = 250.f \/ q;\n  else if (falloff == EFalloffType::Quadratic)\n    quadratic = 25000.f \/ q;\n\n  return {constant, linear, quadratic};\n}\n\nCLight CWorldLight::GetAsCGraphicsLight() const {\n  zeus::CVector3f float_color = x4_color;\n  float q = x28_q;\n  if (q < FLT_EPSILON)\n    q = 0.000001f;\n\n  if (x0_type == EWorldLightType::LocalAmbient) {\n    float_color *= zeus::CVector3f(q);\n    if (float_color.x() >= 1.f)\n      float_color.x() = 1.f;\n\n    if (float_color.y() >= 1.f)\n      float_color.y() = 1.f;\n\n    if (float_color.z() >= 1.f)\n      float_color.z() = 1.f;\n\n    return CLight::BuildLocalAmbient(x10_position,\n                                     zeus::CColor(float_color.x(), float_color.y(), float_color.z(), 1.f));\n  } else if (x0_type == EWorldLightType::Directional) {\n    return CLight::BuildDirectional(x1c_direction, zeus::CColor{x4_color.x(), x4_color.y(), x4_color.z(), 1.f});\n  } else if (x0_type == EWorldLightType::Spot) {\n    CLight light =\n        CLight::BuildSpot(x10_position, x1c_direction.normalized(),\n                          zeus::CColor{x4_color.x(), x4_color.y(), x4_color.z(), 1.f}, x2c_cutoffAngle * .5f);\n\n    const auto [constant, linear, quadratic] = CalculateLightFalloff(x3c_falloff, x28_q);\n    light.SetAttenuation(constant, linear, quadratic);\n    return light;\n  }\n\n  const auto [distC, distL, distQ] = CalculateLightFalloff(x3c_falloff, x28_q);\n  return CLight::BuildCustom(x10_position, zeus::CVector3f{0.f, 1.f, 0.f},\n                             zeus::CColor{x4_color.x(), x4_color.y(), x4_color.z(), 1.f}, distC, distL, distQ, 1.f, 0.f,\n                             0.f);\n}\n} \/\/ namespace urde\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 \"fnord-json\/jsonutil.h\"\n\nnamespace fnord {\nnamespace json {\n\nOption<String> JSONUtil::objectGetString(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    const std::string& key) {\n  auto iter = objectLookup(begin, end, key);\n\n  if (iter != end && iter->type == JSON_STRING) {\n    return Some(iter->data);\n  } else {\n    return None<String>();\n  }\n}\n\nOption<uint64_t> JSONUtil::objectGetUInt64(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    const std::string& key) {\n  auto iter = objectLookup(begin, end, key);\n\n  if (iter != end && (iter->type == JSON_STRING || iter->type == JSON_NUMBER)) {\n    return Some<uint64_t>(std::stoul(iter->data));\n  } else {\n    return None<uint64_t>();\n  }\n}\n\nJSONObject::const_iterator JSONUtil::objectLookup(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    const std::string& key) {\n  if (begin == end) {\n    return end;\n  }\n\n  if (begin->type != json::JSON_OBJECT_BEGIN) {\n    RAISEF(kParseError, \"expected JSON_OBJECT_BEGIN, got: $0\", begin->type);\n  }\n\n  auto oend = begin + begin->size;\n  if (oend > end) {\n    return end;\n  }\n\n  for (++begin; begin < end;) {\n    switch (begin->type) {\n      case json::JSON_STRING:\n        if (begin->data == key) {\n          return ++begin;\n        }\n\n      default:\n        break;\n    }\n\n    if (++begin == oend) {\n      break;\n    } else {\n      begin += begin->size;\n    }\n  }\n\n  return end;\n}\n\nsize_t JSONUtil::arrayLength(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end) {\n  if (begin->type != json::JSON_ARRAY_BEGIN) {\n    RAISEF(kParseError, \"expected JSON_OBJECT_BEGIN, got: $0\", begin->type);\n  }\n\n  auto aend = begin + begin->size - 1;\n  if (aend > end) {\n    RAISE(kIndexError);\n  }\n\n  size_t length = 0;\n  for (++begin; begin < aend; begin += begin->size) {\n    length++;\n  }\n\n  return length;\n}\n\nJSONObject::const_iterator JSONUtil::arrayLookup(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    size_t index) {\n  if (begin->type != json::JSON_ARRAY_BEGIN) {\n    RAISEF(kParseError, \"expected JSON_OBJECT_BEGIN, got: $0\", begin->type);\n  }\n\n  auto aend = begin + begin->size - 1;\n  if (aend > end || begin == aend) {\n    RAISE(kIndexError);\n  }\n\n  size_t idx = 0;\n  for (++begin; begin < aend; begin += begin->size) {\n    if (idx++ == index) {\n      return begin;\n    }\n  }\n\n  RAISEF(kIndexError, \"invalid index: $0\", index);\n  return end;\n}\n\nOption<String> JSONUtil::arrayGetString(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    size_t index) {\n  auto iter = arrayLookup(begin, end, index);\n\n  if (iter != end && iter->type == JSON_STRING) {\n    return Some(iter->data);\n  } else {\n    return None<String>();\n  }\n}\n\n}\n}\n\n<commit_msg>solved merge conflict<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 \"fnord-json\/jsonutil.h\"\n\nnamespace fnord {\nnamespace json {\n\nOption<String> JSONUtil::objectGetString(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    const std::string& key) {\n  auto iter = objectLookup(begin, end, key);\n\n  if (iter != end && iter->type == JSON_STRING) {\n    return Some(iter->data);\n  } else {\n    return None<String>();\n  }\n}\n\nOption<uint64_t> JSONUtil::objectGetUInt64(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    const std::string& key) {\n  auto iter = objectLookup(begin, end, key);\n\n  if (iter != end && (iter->type == JSON_STRING || iter->type == JSON_NUMBER)) {\n    return Some<uint64_t>(std::stoul(iter->data));\n  } else {\n    return None<uint64_t>();\n  }\n}\n\nJSONObject::const_iterator JSONUtil::objectLookup(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    const std::string& key) {\n  if (begin == end) {\n    return end;\n  }\n\n  if (begin->type != json::JSON_OBJECT_BEGIN) {\n    RAISEF(kParseError, \"expected JSON_OBJECT_BEGIN, got: $0\", begin->type);\n  }\n\n  auto oend = begin + begin->size;\n  if (oend > end) {\n    return end;\n  }\n\n  for (++begin; begin < end;) {\n    switch (begin->type) {\n      case json::JSON_STRING:\n        if (begin->data == key) {\n          return ++begin;\n        }\n\n      default:\n        break;\n    }\n\n    if (++begin == oend) {\n      break;\n    } else {\n      begin += begin->size;\n    }\n  }\n\n  return end;\n}\n\nsize_t JSONUtil::arrayLength(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end) {\n  if (begin == end) {\n    return 0;\n  }\n\n  if (begin->type != json::JSON_ARRAY_BEGIN) {\n    RAISEF(kParseError, \"expected JSON_OBJECT_BEGIN, got: $0\", begin->type);\n  }\n\n  auto aend = begin + begin->size - 1;\n  if (aend > end) {\n    RAISE(kIndexError);\n  }\n\n  size_t length = 0;\n  for (++begin; begin < aend; begin += begin->size) {\n    length++;\n  }\n\n  return length;\n}\n\nJSONObject::const_iterator JSONUtil::arrayLookup(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    size_t index) {\n  if (begin == end) {\n    return end;\n  }\n\n  if (begin->type != json::JSON_ARRAY_BEGIN) {\n    RAISEF(kParseError, \"expected JSON_OBJECT_BEGIN, got: $0\", begin->type);\n  }\n\n  auto aend = begin + begin->size - 1;\n  if (aend > end || begin == aend) {\n    RAISE(kIndexError);\n  }\n\n  size_t idx = 0;\n  for (++begin; begin < aend; begin += begin->size) {\n    if (idx++ == index) {\n      return begin;\n    }\n  }\n\n  RAISEF(kIndexError, \"invalid index: $0\", index);\n  return end;\n}\n\nOption<String> JSONUtil::arrayGetString(\n    JSONObject::const_iterator begin,\n    JSONObject::const_iterator end,\n    size_t index) {\n  auto iter = arrayLookup(begin, end, index);\n\n  if (iter != end && iter->type == JSON_STRING) {\n    return Some(iter->data);\n  } else {\n    return None<String>();\n  }\n}\n\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/\n\/\/  EventBus.hpp\n\/\/  CatchLib\n\/\/\n\/\/  Created by Jesper Persson and Sebastian Odbjer on 2\/10-12.\n\/\/  Copyright (c) 2012 Catch22. All rights reserved.\n\/\/\n\nclass EventBus\n{\npublic:\n\tstatic EventBus getSharedInstance();\n\tvoid publishEvent();\n\tvoid addEventHandler();\n\tvoid removeEventHandler();\nprivate:\n\t~EventBus();\n\tEventBus();\n};\n<commit_msg>added struct EventListenerArray<commit_after>\/\/\n\/\/  EventBus.hpp\n\/\/  CatchLib\n\/\/\n\/\/  Created by Jesper Persson and Sebastian Odbjer on 2\/10-12.\n\/\/  Copyright (c) 2012 Catch22. All rights reserved.\n\/\/\n#include \"EEvent.hpp\"\n#include \"IEventListener.hpp\"\n\nstruct EventListenerArray\n{\n\tIEventListener** m_eventListeners;\n\tint m_size;\n\tint m_incrementBy;\n\tint m_index;\n\tEventListenerArray()\n\t{\n\t\tm_incrementBy = 5;\n\t\tm_index = 0;\n\t\tm_size = 0;\n\t\tm_eventListeners = 0;\n\t}\n};\n\nclass EventBus\n{\npublic:\n\tstatic EventBus* getSharedInstance();\n\tvoid publishEvent(EEvent event, void* source);\n\tvoid addEventListener(IEventListener* listener);\n\tvoid removeEventListener(IEventListener* listener);\nprivate:\n\tEventListenerArray* m_listeners;\n\t~EventBus();\n\tEventBus();\n};\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SLIC3R_FIELD_HPP\n#define SLIC3R_FIELD_HPP\n\n#include <functional>\n#include <string>\n#include <limits>\n#include <regex>\n#include <tuple>\n\n#include <boost\/any.hpp>\n#include \"ConfigBase.hpp\"\n#include \"Log.hpp\"\n\n#include \"wx\/spinctrl.h\"\n#include \"wx\/checkbox.h\"\n#include \"wx\/textctrl.h\"\n#include \"wx\/combobox.h\"\n#include \"wx\/arrstr.h\"\n#include \"wx\/stattext.h\"\n#include \"wx\/sizer.h\"\n\nnamespace Slic3r { namespace GUI {\n\nusing namespace std::string_literals;\n\nclass UI_Field {\npublic:\n    UI_Field(wxWindow* _parent, Slic3r::ConfigOptionDef _opt) : parent(_parent), opt(_opt) { };\n    virtual ~UI_Field() = default; \n\n    \/\/\/ Don't trigger on_change when this is true.\n    bool disable_change_event {false};\n    \n    \/\/\/ Set the underlying control to the value (cast it and throw bad_any_cast if there are problems).\n    virtual void set_value(boost::any value) = 0;\n\n    \/\/\/ Enables the underlying UI widget.\n    virtual void enable() { this->window->Enable(); }\n    \n    \/\/\/ Disables the underlying UI widget.\n    virtual void disable() { this->window->Disable(); }\n    \n    \/\/\/ Set the underlying widget to either enabled or disabled.\n    virtual void toggle(bool enable = true) { enable ? this->enable() : this->disable(); }\n\n    \/\/\/ Getter functions for UI_Window items.\n    virtual bool get_bool() { Slic3r::Log::warn(this->LogChannel(), \"get_bool does not exist\"s); return false; } \/\/< return false all the time if this is not implemented.\n    virtual double get_double() { Slic3r::Log::warn(this->LogChannel(), \"get_double does not exist\"s); return 0.0; } \/\/< return 0.0 all the time if this is not implemented.\n    virtual int get_int() { Slic3r::Log::warn(this->LogChannel(), \"get_int does not exist\"s); return 0; } \/\/< return 0 all the time if this is not implemented.\n    virtual std::string get_string() { Slic3r::Log::warn(this->LogChannel(), \"get_string does not exist\"s); return 0; } \/\/< return 0 all the time if this is not implemented.\n\n    virtual Slic3r::Pointf get_point() { Slic3r::Log::warn(this->LogChannel(), \"get_point does not exist\"s); return Slic3r::Pointf(); } \/\/< return 0 all the time if this is not implemented.\n    virtual Slic3r::Pointf3 get_point3() { Slic3r::Log::warn(this->LogChannel(), \"get_point3 does not exist\"s); return Slic3r::Pointf3(); } \/\/< return 0 all the time if this is not implemented.\n\n    \/\/\/ Provide access in a generic fashion to the underlying Window.\n    virtual wxWindow* get_window() { return this->window; }\n\n    \/\/\/ Provide access in a generic fashion to the underlying Sizer.\n    virtual wxSizer* get_sizer() { return this->sizer; }\n\n    \/\/\/ Function to call when focus leaves.\n    std::function<void (const std::string&)> on_kill_focus {nullptr};\n\nprotected:\n    wxWindow* parent {nullptr}; \/\/< Cached copy of the parent object\n    wxWindow* window {nullptr}; \/\/< Pointer copy of the derived classes\n    wxSizer* sizer {nullptr}; \/\/< Pointer copy of the derived classes\n\n    const Slic3r::ConfigOptionDef opt; \/\/< Reference to the UI-specific bits of this option\n\n    virtual std::string LogChannel() { return \"UI_Field\"s; }\n    \n    virtual void _on_change(std::string opt_id) = 0; \n\n    \/\/\/ Define a default size for derived classes.\n    wxSize _default_size() { return wxSize((opt.width >= 0 ? opt.width : 60), (opt.height != -1 ? opt.height : -1)); }\n};\n\n\n\/\/\/ Organizing class for single-part UI elements.\nclass UI_Window : public UI_Field { \npublic:\n    UI_Window(wxWindow* _parent, Slic3r::ConfigOptionDef _opt) : UI_Field(_parent, _opt) {};\n    virtual ~UI_Window() = default; \n    virtual std::string LogChannel() override { return \"UI_Window\"s; }\n};\n\n\/\/\/ Organizing class for multi-part UI elements.\nclass UI_Sizer : public UI_Field {\npublic:\n    UI_Sizer(wxWindow* _parent, Slic3r::ConfigOptionDef _opt) : UI_Field(_parent, _opt) {};\n    virtual ~UI_Sizer() = default; \n    virtual std::string LogChannel() override { return \"UI_Sizer\"s; }\n};\n\nclass UI_Checkbox : public UI_Window {\npublic:\n    UI_Checkbox(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID checkid = wxID_ANY) : UI_Window(parent, _opt) {\n        _check = new wxCheckBox(parent, checkid, \"\");\n        this->window = _check;\n\n        \/\/ Set some defaults.\n        if (this->opt.readonly) { this->_check->Disable(); }\n        if (this->opt.default_value != nullptr) { this->_check->SetValue(this->opt.default_value->getBool()); }\n        \n        \/\/ Set up event handlers\n        _check->Bind(wxEVT_CHECKBOX, [this](wxCommandEvent& e) { this->_on_change(\"\"); e.Skip(); });\n        _check->Bind(wxEVT_KILL_FOCUS, [this](wxFocusEvent& e) { if (this->on_kill_focus != nullptr) {this->on_kill_focus(\"\");} e.Skip(); });\n    }\n\n    ~UI_Checkbox() { _check->Destroy(); }\n\n    \/\/\/ Returns a bare pointer to the underlying checkbox, usually for test interface\n    wxCheckBox* check() { return _check; }\n\n    \/\/\/ Returns the value of the enclosed checkbox.\n    \/\/\/ Implements get_bool\n    virtual bool get_bool() override { return _check->GetValue();}\n\n    \/\/\/ Casts the containing value to boolean and sets the built-in checkbox appropriately.\n    \/\/\/ implements set_value\n    virtual void set_value(boost::any value) override { this->_check->SetValue(boost::any_cast<bool>(value)); }\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, bool value)> on_change {nullptr};\n\nprotected:\n    virtual std::string LogChannel() override { return \"UI_Checkbox\"s; }\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_bool());\n        }\n    }\nprivate:\n    wxCheckBox* _check {nullptr};\n\n};\n\nclass UI_SpinCtrl : public UI_Window {\npublic:\n    UI_SpinCtrl(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID spinid = wxID_ANY) : UI_Window(parent, _opt) {\n\n        \/\/\/ Initialize and set defaults, if available.\n        _spin = new wxSpinCtrl(parent, spinid, \"\", wxDefaultPosition, _default_size(), 0,\n            (opt.min > 0 ? opt.min : 0), \n            (opt.max > 0 ? opt.max : std::numeric_limits<int>::max()), \n            (opt.default_value != NULL ? opt.default_value->getInt() : 0));\n\n        window = _spin;\n\n        \/\/ Set up event handlers\n        _spin->Bind(wxEVT_SPINCTRL, [this](wxCommandEvent& e) { this->_on_change(\"\"); e.Skip(); });\n        _spin->Bind(wxEVT_KILL_FOCUS, [this](wxFocusEvent& e) { if (this->on_kill_focus != nullptr) { this->_on_change(\"\"); this->on_kill_focus(\"\");} e.Skip(); });\n    }\n    ~UI_SpinCtrl() { _spin->Destroy();}\n    int get_int() { return this->_spin->GetValue(); }\n    void set_value(boost::any value) { this->_spin->SetValue(boost::any_cast<int>(value)); }\n\n    \/\/\/ Access method for the underlying SpinCtrl\n    wxSpinCtrl* spinctrl() { return _spin; }\n    \n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, int value)> on_change {nullptr};\n\nprotected:\n    virtual std::string LogChannel() { return \"UI_SpinCtrl\"s; }\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_int());\n        }\n    }\n\nprivate:\n    wxSpinCtrl* _spin {nullptr};\n};\n\nclass UI_TextCtrl : public UI_Window {\npublic:\n    UI_TextCtrl(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID id = wxID_ANY) : UI_Window(parent, _opt) {\n        int style {0};\n        if (opt.multiline) {\n            style |= wxHSCROLL;\n            style |= wxTE_MULTILINE;\n        } else {\n            style |= wxTE_PROCESS_ENTER;\n        }\n        \/\/\/ Initialize and set defaults, if available.\n        _text = new wxTextCtrl(parent, id, \n            (opt.default_value != NULL ? wxString(opt.default_value->getString()) : wxString()), \n            wxDefaultPosition, \n            _default_size(), \n            style);\n\n        window = _text;\n\n        \/\/ Set up event handlers\n        if (!opt.multiline) {\n            _text->Bind(wxEVT_TEXT_ENTER, [this](wxCommandEvent& e) { this->_on_change(\"\"); e.Skip(); });\n        }\n        _text->Bind(wxEVT_KILL_FOCUS, [this](wxFocusEvent& e) { if (this->on_kill_focus != nullptr) {this->on_kill_focus(\"\"); this->_on_change(\"\");} e.Skip(); });\n    }\n    ~UI_TextCtrl() { _text->Destroy(); }\n    std::string get_string() { return this->_text->GetValue().ToStdString(); }\n    void set_value(boost::any value) { this->_text->SetValue(boost::any_cast<std::string>(value)); }\n\n    \/\/\/ Access method for the underlying TextCtrl\n    wxTextCtrl* textctrl() { return _text; }\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, std::string value)> on_change {nullptr};\n\nprotected:\n    virtual std::string LogChannel() { return \"UI_TextCtrl\"s; }\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_string());\n        }\n    }\n\nprivate:\n    wxTextCtrl* _text {nullptr};\n};\n\nclass UI_Choice : public UI_Window {\npublic:\n    UI_Choice(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID id = wxID_ANY);\n    ~UI_Choice() { _choice->Destroy(); }\n\n    std::string get_string() override;\n\n    void set_value(boost::any value) override;\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, std::string value)> on_change {nullptr};\n\n    \/\/\/ Returns a bare pointer to the underlying combobox, usually for test interface\n    wxComboBox* choice() { return this->_choice; }\nprotected:\n    virtual std::string LogChannel() override { return \"UI_Choice\"s; }\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_string());\n        }\n    }\nprivate:\n    wxComboBox* _choice {nullptr};\n};\n\n\nclass UI_NumChoice : public UI_Window {\npublic:\n    UI_NumChoice(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID id = wxID_ANY);\n    ~UI_NumChoice() { _choice->Destroy(); }\n\n    \/\/\/ Returns the underlying value for the selected value (defined by enum_values). If there are labels, this may not \n    \/\/\/ match the underlying combobox->GetValue(). \n    std::string get_string() override;\n\n    \/\/\/ Returns the item in the value field of the associated option as an integer.\n    int get_int() override { return std::stoi(this->get_string()); }\n\n    \/\/\/ Returns the item in the value field of the associated option as a double.\n    double get_double() override { return std::stod(this->get_string()); }\n\n\n    \/\/\/ Returns a bare pointer to the underlying combobox, usually for test interface\n    wxComboBox* choice() { return this->_choice; }\n\n    \/\/\/ For NumChoice, value can be the actual input value or an index into the value.\n    void set_value(boost::any value) override;\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, std::string value)> on_change {nullptr};\n\nprotected:\n    virtual std::string LogChannel() override { return \"UI_NumChoice\"s; }\n\n    void _set_value(int value, bool show_value = false);\n    void _set_value(double value, bool show_value = false);\n    void _set_value(std::string value);\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_string());\n        }\n    }\nprivate:\n    wxComboBox* _choice {nullptr};\n    std::regex show_value_flag {\"\\bshow_value\\b\"};\n};\n\nclass UI_Point : public UI_Sizer {\npublic:\n\n    UI_Point(wxWindow* _parent, Slic3r::ConfigOptionDef _opt);\n    ~UI_Point() { _lbl_x->Destroy(); _lbl_y->Destroy(); _ctrl_x->Destroy(); _ctrl_y->Destroy(); }\n    std::string get_string();\n\n    void set_value(boost::any value) override; \/\/< Implements set_value\n\n    Slic3r::Pointf get_point() override; \/\/< return a Slic3r::Pointf corresponding to the textctrl contents.\n    Slic3r::Pointf3 get_point3() override; \/\/< return a Slic3r::Pointf3 corresponding to the textctrl contents.\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, std::tuple<std::string, std::string> value)> on_change {nullptr};\n\n\n    void enable() override { _ctrl_x->Enable(); _ctrl_y->Enable(); }\n    void disable() override { _ctrl_x->Disable(); _ctrl_y->Disable(); }\n\n    \/\/\/ Local-access items\n    wxTextCtrl* ctrl_x() { return _ctrl_x;}\n    wxTextCtrl* ctrl_y() { return _ctrl_y;}\n\n    wxStaticText* lbl_x() { return _lbl_x;}\n    wxStaticText* lbl_y() { return _lbl_y;}\n\nprotected:\n    virtual std::string LogChannel() override { return \"UI_Point\"s; }\n\n    void _on_change(std::string opt_id) override { \n        if (!this->disable_change_event && this->_ctrl_x->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, std::make_pair<std::string, std::string>(_ctrl_x->GetValue().ToStdString(), _ctrl_y->GetValue().ToStdString()));\n        }\n    }\n\nprivate:\n    wxSize field_size {40, 1};\n    wxStaticText* _lbl_x {nullptr};\n    wxStaticText* _lbl_y {nullptr};\n\n    wxTextCtrl* _ctrl_x {nullptr};\n    wxTextCtrl* _ctrl_y {nullptr};\n\n    wxBoxSizer* _sizer {nullptr};\n\n    void _set_value(Slic3r::Pointf value);\n    void _set_value(Slic3r::Pointf3 value);\n    void _set_value(std::string value);\n\n    }\n\n\n\n};\n\n} } \/\/ Namespace Slic3r::GUI\n\n#endif \/\/ SLIC3R_FIELD_HPP\n<commit_msg>use make_tuple instead of make_pair<commit_after>#ifndef SLIC3R_FIELD_HPP\n#define SLIC3R_FIELD_HPP\n\n#include <functional>\n#include <string>\n#include <limits>\n#include <regex>\n#include <tuple>\n\n#include <boost\/any.hpp>\n#include \"ConfigBase.hpp\"\n#include \"Log.hpp\"\n\n#include \"wx\/spinctrl.h\"\n#include \"wx\/checkbox.h\"\n#include \"wx\/textctrl.h\"\n#include \"wx\/combobox.h\"\n#include \"wx\/arrstr.h\"\n#include \"wx\/stattext.h\"\n#include \"wx\/sizer.h\"\n\nnamespace Slic3r { namespace GUI {\n\nusing namespace std::string_literals;\n\nclass UI_Field {\npublic:\n    UI_Field(wxWindow* _parent, Slic3r::ConfigOptionDef _opt) : parent(_parent), opt(_opt) { };\n    virtual ~UI_Field() = default; \n\n    \/\/\/ Don't trigger on_change when this is true.\n    bool disable_change_event {false};\n    \n    \/\/\/ Set the underlying control to the value (cast it and throw bad_any_cast if there are problems).\n    virtual void set_value(boost::any value) = 0;\n\n    \/\/\/ Enables the underlying UI widget.\n    virtual void enable() { this->window->Enable(); }\n    \n    \/\/\/ Disables the underlying UI widget.\n    virtual void disable() { this->window->Disable(); }\n    \n    \/\/\/ Set the underlying widget to either enabled or disabled.\n    virtual void toggle(bool enable = true) { enable ? this->enable() : this->disable(); }\n\n    \/\/\/ Getter functions for UI_Window items.\n    virtual bool get_bool() { Slic3r::Log::warn(this->LogChannel(), \"get_bool does not exist\"s); return false; } \/\/< return false all the time if this is not implemented.\n    virtual double get_double() { Slic3r::Log::warn(this->LogChannel(), \"get_double does not exist\"s); return 0.0; } \/\/< return 0.0 all the time if this is not implemented.\n    virtual int get_int() { Slic3r::Log::warn(this->LogChannel(), \"get_int does not exist\"s); return 0; } \/\/< return 0 all the time if this is not implemented.\n    virtual std::string get_string() { Slic3r::Log::warn(this->LogChannel(), \"get_string does not exist\"s); return 0; } \/\/< return 0 all the time if this is not implemented.\n\n    virtual Slic3r::Pointf get_point() { Slic3r::Log::warn(this->LogChannel(), \"get_point does not exist\"s); return Slic3r::Pointf(); } \/\/< return 0 all the time if this is not implemented.\n    virtual Slic3r::Pointf3 get_point3() { Slic3r::Log::warn(this->LogChannel(), \"get_point3 does not exist\"s); return Slic3r::Pointf3(); } \/\/< return 0 all the time if this is not implemented.\n\n    \/\/\/ Provide access in a generic fashion to the underlying Window.\n    virtual wxWindow* get_window() { return this->window; }\n\n    \/\/\/ Provide access in a generic fashion to the underlying Sizer.\n    virtual wxSizer* get_sizer() { return this->sizer; }\n\n    \/\/\/ Function to call when focus leaves.\n    std::function<void (const std::string&)> on_kill_focus {nullptr};\n\nprotected:\n    wxWindow* parent {nullptr}; \/\/< Cached copy of the parent object\n    wxWindow* window {nullptr}; \/\/< Pointer copy of the derived classes\n    wxSizer* sizer {nullptr}; \/\/< Pointer copy of the derived classes\n\n    const Slic3r::ConfigOptionDef opt; \/\/< Reference to the UI-specific bits of this option\n\n    virtual std::string LogChannel() { return \"UI_Field\"s; }\n    \n    virtual void _on_change(std::string opt_id) = 0; \n\n    \/\/\/ Define a default size for derived classes.\n    wxSize _default_size() { return wxSize((opt.width >= 0 ? opt.width : 60), (opt.height != -1 ? opt.height : -1)); }\n};\n\n\n\/\/\/ Organizing class for single-part UI elements.\nclass UI_Window : public UI_Field { \npublic:\n    UI_Window(wxWindow* _parent, Slic3r::ConfigOptionDef _opt) : UI_Field(_parent, _opt) {};\n    virtual ~UI_Window() = default; \n    virtual std::string LogChannel() override { return \"UI_Window\"s; }\n};\n\n\/\/\/ Organizing class for multi-part UI elements.\nclass UI_Sizer : public UI_Field {\npublic:\n    UI_Sizer(wxWindow* _parent, Slic3r::ConfigOptionDef _opt) : UI_Field(_parent, _opt) {};\n    virtual ~UI_Sizer() = default; \n    virtual std::string LogChannel() override { return \"UI_Sizer\"s; }\n};\n\nclass UI_Checkbox : public UI_Window {\npublic:\n    UI_Checkbox(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID checkid = wxID_ANY) : UI_Window(parent, _opt) {\n        _check = new wxCheckBox(parent, checkid, \"\");\n        this->window = _check;\n\n        \/\/ Set some defaults.\n        if (this->opt.readonly) { this->_check->Disable(); }\n        if (this->opt.default_value != nullptr) { this->_check->SetValue(this->opt.default_value->getBool()); }\n        \n        \/\/ Set up event handlers\n        _check->Bind(wxEVT_CHECKBOX, [this](wxCommandEvent& e) { this->_on_change(\"\"); e.Skip(); });\n        _check->Bind(wxEVT_KILL_FOCUS, [this](wxFocusEvent& e) { if (this->on_kill_focus != nullptr) {this->on_kill_focus(\"\");} e.Skip(); });\n    }\n\n    ~UI_Checkbox() { _check->Destroy(); }\n\n    \/\/\/ Returns a bare pointer to the underlying checkbox, usually for test interface\n    wxCheckBox* check() { return _check; }\n\n    \/\/\/ Returns the value of the enclosed checkbox.\n    \/\/\/ Implements get_bool\n    virtual bool get_bool() override { return _check->GetValue();}\n\n    \/\/\/ Casts the containing value to boolean and sets the built-in checkbox appropriately.\n    \/\/\/ implements set_value\n    virtual void set_value(boost::any value) override { this->_check->SetValue(boost::any_cast<bool>(value)); }\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, bool value)> on_change {nullptr};\n\nprotected:\n    virtual std::string LogChannel() override { return \"UI_Checkbox\"s; }\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_bool());\n        }\n    }\nprivate:\n    wxCheckBox* _check {nullptr};\n\n};\n\nclass UI_SpinCtrl : public UI_Window {\npublic:\n    UI_SpinCtrl(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID spinid = wxID_ANY) : UI_Window(parent, _opt) {\n\n        \/\/\/ Initialize and set defaults, if available.\n        _spin = new wxSpinCtrl(parent, spinid, \"\", wxDefaultPosition, _default_size(), 0,\n            (opt.min > 0 ? opt.min : 0), \n            (opt.max > 0 ? opt.max : std::numeric_limits<int>::max()), \n            (opt.default_value != NULL ? opt.default_value->getInt() : 0));\n\n        window = _spin;\n\n        \/\/ Set up event handlers\n        _spin->Bind(wxEVT_SPINCTRL, [this](wxCommandEvent& e) { this->_on_change(\"\"); e.Skip(); });\n        _spin->Bind(wxEVT_KILL_FOCUS, [this](wxFocusEvent& e) { if (this->on_kill_focus != nullptr) { this->_on_change(\"\"); this->on_kill_focus(\"\");} e.Skip(); });\n    }\n    ~UI_SpinCtrl() { _spin->Destroy();}\n    int get_int() { return this->_spin->GetValue(); }\n    void set_value(boost::any value) { this->_spin->SetValue(boost::any_cast<int>(value)); }\n\n    \/\/\/ Access method for the underlying SpinCtrl\n    wxSpinCtrl* spinctrl() { return _spin; }\n    \n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, int value)> on_change {nullptr};\n\nprotected:\n    virtual std::string LogChannel() { return \"UI_SpinCtrl\"s; }\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_int());\n        }\n    }\n\nprivate:\n    wxSpinCtrl* _spin {nullptr};\n};\n\nclass UI_TextCtrl : public UI_Window {\npublic:\n    UI_TextCtrl(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID id = wxID_ANY) : UI_Window(parent, _opt) {\n        int style {0};\n        if (opt.multiline) {\n            style |= wxHSCROLL;\n            style |= wxTE_MULTILINE;\n        } else {\n            style |= wxTE_PROCESS_ENTER;\n        }\n        \/\/\/ Initialize and set defaults, if available.\n        _text = new wxTextCtrl(parent, id, \n            (opt.default_value != NULL ? wxString(opt.default_value->getString()) : wxString()), \n            wxDefaultPosition, \n            _default_size(), \n            style);\n\n        window = _text;\n\n        \/\/ Set up event handlers\n        if (!opt.multiline) {\n            _text->Bind(wxEVT_TEXT_ENTER, [this](wxCommandEvent& e) { this->_on_change(\"\"); e.Skip(); });\n        }\n        _text->Bind(wxEVT_KILL_FOCUS, [this](wxFocusEvent& e) { if (this->on_kill_focus != nullptr) {this->on_kill_focus(\"\"); this->_on_change(\"\");} e.Skip(); });\n    }\n    ~UI_TextCtrl() { _text->Destroy(); }\n    std::string get_string() { return this->_text->GetValue().ToStdString(); }\n    void set_value(boost::any value) { this->_text->SetValue(boost::any_cast<std::string>(value)); }\n\n    \/\/\/ Access method for the underlying TextCtrl\n    wxTextCtrl* textctrl() { return _text; }\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, std::string value)> on_change {nullptr};\n\nprotected:\n    virtual std::string LogChannel() { return \"UI_TextCtrl\"s; }\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_string());\n        }\n    }\n\nprivate:\n    wxTextCtrl* _text {nullptr};\n};\n\nclass UI_Choice : public UI_Window {\npublic:\n    UI_Choice(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID id = wxID_ANY);\n    ~UI_Choice() { _choice->Destroy(); }\n\n    std::string get_string() override;\n\n    void set_value(boost::any value) override;\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, std::string value)> on_change {nullptr};\n\n    \/\/\/ Returns a bare pointer to the underlying combobox, usually for test interface\n    wxComboBox* choice() { return this->_choice; }\nprotected:\n    virtual std::string LogChannel() override { return \"UI_Choice\"s; }\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_string());\n        }\n    }\nprivate:\n    wxComboBox* _choice {nullptr};\n};\n\n\nclass UI_NumChoice : public UI_Window {\npublic:\n    UI_NumChoice(wxWindow* parent, Slic3r::ConfigOptionDef _opt, wxWindowID id = wxID_ANY);\n    ~UI_NumChoice() { _choice->Destroy(); }\n\n    \/\/\/ Returns the underlying value for the selected value (defined by enum_values). If there are labels, this may not \n    \/\/\/ match the underlying combobox->GetValue(). \n    std::string get_string() override;\n\n    \/\/\/ Returns the item in the value field of the associated option as an integer.\n    int get_int() override { return std::stoi(this->get_string()); }\n\n    \/\/\/ Returns the item in the value field of the associated option as a double.\n    double get_double() override { return std::stod(this->get_string()); }\n\n\n    \/\/\/ Returns a bare pointer to the underlying combobox, usually for test interface\n    wxComboBox* choice() { return this->_choice; }\n\n    \/\/\/ For NumChoice, value can be the actual input value or an index into the value.\n    void set_value(boost::any value) override;\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, std::string value)> on_change {nullptr};\n\nprotected:\n    virtual std::string LogChannel() override { return \"UI_NumChoice\"s; }\n\n    void _set_value(int value, bool show_value = false);\n    void _set_value(double value, bool show_value = false);\n    void _set_value(std::string value);\n\n    void _on_change(std::string opt_id) {\n        if (!this->disable_change_event && this->window->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, this->get_string());\n        }\n    }\nprivate:\n    wxComboBox* _choice {nullptr};\n    std::regex show_value_flag {\"\\bshow_value\\b\"};\n};\n\nclass UI_Point : public UI_Sizer {\npublic:\n\n    UI_Point(wxWindow* _parent, Slic3r::ConfigOptionDef _opt);\n    ~UI_Point() { _lbl_x->Destroy(); _lbl_y->Destroy(); _ctrl_x->Destroy(); _ctrl_y->Destroy(); }\n    std::string get_string();\n\n    void set_value(boost::any value) override; \/\/< Implements set_value\n\n    Slic3r::Pointf get_point() override; \/\/< return a Slic3r::Pointf corresponding to the textctrl contents.\n    Slic3r::Pointf3 get_point3() override; \/\/< return a Slic3r::Pointf3 corresponding to the textctrl contents.\n\n    \/\/\/ Function to call when the contents of this change.\n    std::function<void (const std::string&, std::tuple<std::string, std::string> value)> on_change {nullptr};\n\n\n    void enable() override { _ctrl_x->Enable(); _ctrl_y->Enable(); }\n    void disable() override { _ctrl_x->Disable(); _ctrl_y->Disable(); }\n\n    \/\/\/ Local-access items\n    wxTextCtrl* ctrl_x() { return _ctrl_x;}\n    wxTextCtrl* ctrl_y() { return _ctrl_y;}\n\n    wxStaticText* lbl_x() { return _lbl_x;}\n    wxStaticText* lbl_y() { return _lbl_y;}\n\nprotected:\n    virtual std::string LogChannel() override { return \"UI_Point\"s; }\n\n    void _on_change(std::string opt_id) override { \n        if (!this->disable_change_event && this->_ctrl_x->IsEnabled() && this->on_change != nullptr) {\n            this->on_change(opt_id, std::make_tuple<std::string, std::string>(_ctrl_x->GetValue().ToStdString(), _ctrl_y->GetValue().ToStdString()));\n        }\n    }\n\nprivate:\n    wxSize field_size {40, 1};\n    wxStaticText* _lbl_x {nullptr};\n    wxStaticText* _lbl_y {nullptr};\n\n    wxTextCtrl* _ctrl_x {nullptr};\n    wxTextCtrl* _ctrl_y {nullptr};\n\n    wxBoxSizer* _sizer {nullptr};\n\n    void _set_value(Slic3r::Pointf value);\n    void _set_value(Slic3r::Pointf3 value);\n    void _set_value(std::string value);\n\n    }\n\n\n\n};\n\n} } \/\/ Namespace Slic3r::GUI\n\n#endif \/\/ SLIC3R_FIELD_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Higher-order functions (HOFs) are functions that take other functions as their arguments. \n\/\/ A basic example of a HOF is map which takes a function and a list as its arguments, applies \n\/\/ the function to all elements of the list, and returns the list of its results. \n\/\/ For instance, we can write a function that subtracts 2 from all elements of \n\/\/ a list without using loops or recursion:\n\n\/\/ subtractTwoFromList l = map (\\x -> x - 2) l\n\/\/ \n\/\/ \n\n#include<algorithm>\n\n\/\/The typename function should be a function object\n\/\/The typename sequence should be a sequence type\nnamespace fool{\n  template<typename function, typename sequence>\n  sequence& FMap(function &f,sequence &s)\n  {\n    std::for_each(s.begin(),s.end(),\n        [&f](typename sequence::value_type& v) {\n          f(v);\n        });\n    return s;\n  }\n}\n<commit_msg>added terms and conditions along with examples as comment<commit_after>\/\/ This file is distributed under the MIT License. See http:\/\/www.opensource.org\/licenses\/mit-license.php \n\/\/ for terms and conditions.\n\/\/\n\/\/ Higher-order functions (HOFs) are functions that take other functions as their arguments. \n\/\/ A basic example of a HOF is map which takes a function and a list as its arguments, applies \n\/\/ the function to all elements of the list, and returns the list of its results. \n\/\/ For instance, we can write a function that subtracts 2 from all elements of \n\/\/ a list without using loops or recursion:\n\n\/\/ subtractTwoFromList l = map (\\x -> x - 2) l\n\/\/sample use case\n\/\/#include \"hof.hpp\"\n\/\/#include<iostream>\n\/\/#include<vector>\n\/\/using namespace fool;\n\/\/int main()\n\/\/{\n\/\/  std::vector<int> vi{1,2,3,4};\n\/\/  auto f = [](int& i){i+=2;};\n\/\/  FMap(f,vi);\n\/\/  for(auto v = vi.begin(); v != vi.end(); ++v)\n\/\/  {\n\/\/    std::cout<<*v<<\"\\t\";\n\/\/  }\n\/\/  return 0;\n\/\/}\n \n\n#include<algorithm>\n\n\/\/The typename function should be a function object\n\/\/The typename sequence should be a sequence type\nnamespace fool{\n  template<typename function, typename sequence>\n  sequence& FMap(function &f,sequence &s)\n  {\n    std::for_each(s.begin(),s.end(),\n        [&f](typename sequence::value_type& v) {\n          f(v);\n        });\n    return s;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"hash.hpp\"\r\n\r\nHash::Hash() : prev(nullptr), flag(EMPTY) {}\r\n\r\nHash::~Hash() {\r\n\tclean();\r\n}\r\n\r\nbool Hash::back() {\r\n\tif(prev) {\r\n\t\tif(!prev->empty()) {\r\n\t\t\tmove = prev->top();\r\n\t\t\tprev->pop();\r\n\r\n\t\t\treturn true;\r\n\t\t}\r\n\t}\r\n\r\n\treturn false;\r\n}\r\n\r\nvoid Hash::recordPrev() {\r\n\tif(flag == EXACT) {\r\n\t\tif(!prev) {\r\n\t\t\tprev = new std::stack<BitMove>();\r\n\t\t}\r\n\r\n\t\tprev->push(move);\r\n\t}\r\n}\r\n\r\nvoid Hash::clean() {\r\n\tif(prev) {\r\n\t\twhile(!prev->empty()) {\r\n\t\t\tprev->pop();\r\n\t\t}\r\n\r\n\t\tdelete prev;\r\n\t\tprev = nullptr;\r\n\t}\r\n\r\n\t\/\/flag = EMPTY;\r\n}\r\n<commit_msg>cancelled experemental<commit_after>#include \"hash.hpp\"\r\n\r\nHash::Hash() : prev(nullptr), flag(EMPTY) {}\r\n\r\nHash::~Hash() {\r\n\tclean();\r\n}\r\n\r\nbool Hash::back() {\r\n\tif(prev) {\r\n\t\tif(!prev->empty()) {\r\n\t\t\tmove = prev->top();\r\n\t\t\tprev->pop();\r\n\r\n\t\t\treturn true;\r\n\t\t}\r\n\t}\r\n\r\n\treturn false;\r\n}\r\n\r\nvoid Hash::recordPrev() {\r\n\tif(flag == EXACT) {\r\n\t\tif(!prev) {\r\n\t\t\tprev = new std::stack<BitMove>();\r\n\t\t}\r\n\r\n\t\tprev->push(move);\r\n\t}\r\n}\r\n\r\nvoid Hash::clean() {\r\n\tif(prev) {\r\n\t\twhile(!prev->empty()) {\r\n\t\t\tprev->pop();\r\n\t\t}\r\n\r\n\t\tdelete prev;\r\n\t\tprev = nullptr;\r\n\t}\r\n\r\n\tflag = EMPTY;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ***************************************************************************\n\/\/ bamtools.cpp (c) 2010 Derek Barnett, Erik Garrison\n\/\/ Marth Lab, Department of Biology, Boston College\n\/\/ All rights reserved.\n\/\/ ---------------------------------------------------------------------------\n\/\/ Last modified: 22 July 2010\n\/\/ ---------------------------------------------------------------------------\n\/\/ Integrates a number of BamTools functionalities into a single executable.\n\/\/ ***************************************************************************\n\n\/\/ Std C\/C++ includes\n#include <iostream>\n\n\/\/ BamTools includes\n#include \"bamtools_convert.h\"\n#include \"bamtools_count.h\"\n#include \"bamtools_coverage.h\"\n#include \"bamtools_filter.h\"\n#include \"bamtools_header.h\"\n#include \"bamtools_index.h\"\n#include \"bamtools_merge.h\"\n#include \"bamtools_random.h\"\n#include \"bamtools_sort.h\"\n#include \"bamtools_stats.h\"\n\nusing namespace std;\nusing namespace BamTools;\n\n\/\/ ------------------------------------------\n\/\/ bamtools subtool names\nstatic const string CONVERT  = \"convert\";\nstatic const string COUNT    = \"count\";\nstatic const string COVERAGE = \"coverage\";\nstatic const string FILTER   = \"filter\";\nstatic const string HEADER   = \"header\";\nstatic const string INDEX    = \"index\";\nstatic const string MERGE    = \"merge\";\nstatic const string RANDOM   = \"random\";\nstatic const string SORT     = \"sort\";\nstatic const string STATS    = \"stats\";\n\n\/\/ ------------------------------------------\n\/\/ bamtools help\/version names\nstatic const string HELP       = \"help\";\nstatic const string LONG_HELP  = \"--help\";\nstatic const string SHORT_HELP = \"-h\";\n\nstatic const string VERSION       = \"version\";\nstatic const string LONG_VERSION  = \"--version\";\nstatic const string SHORT_VERSION = \"-v\";\n\n\/\/ ------------------------------------------\n\/\/ Print help info\nint Help(int argc, char* argv[]) {\n  \n    \/\/ 'bamtools help COMMAND'\n    if (argc > 2) {\n        \n        AbstractTool* tool(0);\n        if ( argv[2] == CONVERT )  tool = new ConvertTool;\n        if ( argv[2] == COUNT )    tool = new CountTool;\n        if ( argv[2] == COVERAGE ) tool = new CoverageTool;\n        if ( argv[2] == FILTER )   tool = new FilterTool;\n        if ( argv[2] == HEADER )   tool = new HeaderTool;\n        if ( argv[2] == INDEX )    tool = new IndexTool;\n        if ( argv[2] == MERGE )    tool = new MergeTool;\n        if ( argv[2] == RANDOM )   tool = new RandomTool;\n        if ( argv[2] == SORT )     tool = new SortTool;\n        if ( argv[2] == STATS )    tool = new StatsTool;\n        \n        \/\/ if tool known, print its help screen\n        if ( tool ) return tool->Help();\n    }\n\n    \/\/ either 'bamtools help' or unrecognized argument after 'help'\n    cerr << endl;\n    cerr << \"usage: bamtools [--help] COMMAND [ARGS]\" << endl;\n    cerr << endl;\n    cerr << \"Available bamtools commands:\" << endl;\n    cerr << \"\\tconvert   Converts between BAM and a number of other formats\" << endl;\n    cerr << \"\\tcount     Prints number of alignments in BAM file\" << endl;\n    cerr << \"\\tcoverage  Prints coverage statistics from the input BAM file\" << endl;\n    cerr << \"\\tfilter    Filters BAM file(s) by user-specified criteria\" << endl;\n    cerr << \"\\theader    Prints BAM header information\" << endl;\n    cerr << \"\\tindex     Generates index for BAM file\" << endl;\n    cerr << \"\\tmerge     Merge multiple BAM files into single file\" << endl;\n    cerr << \"\\trandom    Grab a random subset of alignments\" << endl;\n    cerr << \"\\tsort      Sorts the BAM file according to some criteria\" << endl;\n    cerr << \"\\tstats     Prints some basic statistics from the input BAM file\" << endl;\n    cerr << endl;\n    cerr << \"See 'bamtools help COMMAND' for more information on a specific command.\" << endl;\n    cerr << endl;\n    return 0;\n}\n\n\/\/ ------------------------------------------\n\/\/ Print version info\nint Version(void) {\n    cout << endl;\n    cout << \"bamtools v0.8.xx\" << endl;\n    cout << \"Part of BamTools API and toolkit\" << endl;\n    cout << \"Primary authors: Derek Barnett, Erik Garrison, Michael Stromberg\" << endl;\n    cout << \"(c) 2009-2010 Marth Lab, Biology Dept., Boston College\" << endl;\n    cout << endl;\n    return 0;\n}\n\n\/\/ ------------------------------------------\n\/\/ toolkit entry point\nint main(int argc, char* argv[]) {\n\n    \/\/ just 'bamtools'\n    if ( (argc == 1) ) return Help(argc, argv);\n    \n    \/\/ 'bamtools help', 'bamtools --help', or 'bamtools -h'\n    if ( (argv[1] == HELP) || (argv[1] == LONG_HELP) || (argv[1] == SHORT_HELP) ) return Help(argc, argv); \n    \n    \/\/ 'bamtools version', 'bamtools --version', or 'bamtools -v'\n    if ( (argv[1] == VERSION) || (argv[1] == LONG_VERSION) || (argv[1] == SHORT_VERSION) ) return Version(); \n        \n    \/\/ determine desired sub-tool\n    AbstractTool* tool(0);\n    if ( argv[1] == CONVERT )  tool = new ConvertTool;\n    if ( argv[1] == COUNT )    tool = new CountTool;\n    if ( argv[1] == COVERAGE ) tool = new CoverageTool;\n    if ( argv[1] == FILTER )   tool = new FilterTool;\n    if ( argv[1] == HEADER )   tool = new HeaderTool;\n    if ( argv[1] == INDEX )    tool = new IndexTool;\n    if ( argv[1] == MERGE )    tool = new MergeTool;\n    if ( argv[1] == RANDOM )   tool = new RandomTool;\n    if ( argv[1] == SORT )     tool = new SortTool;\n    if ( argv[1] == STATS )    tool = new StatsTool;\n    \n    \/\/ if found, run tool\n    if ( tool ) return tool->Run(argc, argv);\n    \/\/ no match found, show help\n    else return Help(argc, argv); \n}\n<commit_msg>Reworded bamtools stats general help description<commit_after>\/\/ ***************************************************************************\n\/\/ bamtools.cpp (c) 2010 Derek Barnett, Erik Garrison\n\/\/ Marth Lab, Department of Biology, Boston College\n\/\/ All rights reserved.\n\/\/ ---------------------------------------------------------------------------\n\/\/ Last modified: 22 July 2010\n\/\/ ---------------------------------------------------------------------------\n\/\/ Integrates a number of BamTools functionalities into a single executable.\n\/\/ ***************************************************************************\n\n\/\/ Std C\/C++ includes\n#include <iostream>\n\n\/\/ BamTools includes\n#include \"bamtools_convert.h\"\n#include \"bamtools_count.h\"\n#include \"bamtools_coverage.h\"\n#include \"bamtools_filter.h\"\n#include \"bamtools_header.h\"\n#include \"bamtools_index.h\"\n#include \"bamtools_merge.h\"\n#include \"bamtools_random.h\"\n#include \"bamtools_sort.h\"\n#include \"bamtools_stats.h\"\n\nusing namespace std;\nusing namespace BamTools;\n\n\/\/ ------------------------------------------\n\/\/ bamtools subtool names\nstatic const string CONVERT  = \"convert\";\nstatic const string COUNT    = \"count\";\nstatic const string COVERAGE = \"coverage\";\nstatic const string FILTER   = \"filter\";\nstatic const string HEADER   = \"header\";\nstatic const string INDEX    = \"index\";\nstatic const string MERGE    = \"merge\";\nstatic const string RANDOM   = \"random\";\nstatic const string SORT     = \"sort\";\nstatic const string STATS    = \"stats\";\n\n\/\/ ------------------------------------------\n\/\/ bamtools help\/version names\nstatic const string HELP       = \"help\";\nstatic const string LONG_HELP  = \"--help\";\nstatic const string SHORT_HELP = \"-h\";\n\nstatic const string VERSION       = \"version\";\nstatic const string LONG_VERSION  = \"--version\";\nstatic const string SHORT_VERSION = \"-v\";\n\n\/\/ ------------------------------------------\n\/\/ Print help info\nint Help(int argc, char* argv[]) {\n  \n    \/\/ 'bamtools help COMMAND'\n    if (argc > 2) {\n        \n        AbstractTool* tool(0);\n        if ( argv[2] == CONVERT )  tool = new ConvertTool;\n        if ( argv[2] == COUNT )    tool = new CountTool;\n        if ( argv[2] == COVERAGE ) tool = new CoverageTool;\n        if ( argv[2] == FILTER )   tool = new FilterTool;\n        if ( argv[2] == HEADER )   tool = new HeaderTool;\n        if ( argv[2] == INDEX )    tool = new IndexTool;\n        if ( argv[2] == MERGE )    tool = new MergeTool;\n        if ( argv[2] == RANDOM )   tool = new RandomTool;\n        if ( argv[2] == SORT )     tool = new SortTool;\n        if ( argv[2] == STATS )    tool = new StatsTool;\n        \n        \/\/ if tool known, print its help screen\n        if ( tool ) return tool->Help();\n    }\n\n    \/\/ either 'bamtools help' or unrecognized argument after 'help'\n    cerr << endl;\n    cerr << \"usage: bamtools [--help] COMMAND [ARGS]\" << endl;\n    cerr << endl;\n    cerr << \"Available bamtools commands:\" << endl;\n    cerr << \"\\tconvert   Converts between BAM and a number of other formats\" << endl;\n    cerr << \"\\tcount     Prints number of alignments in BAM file\" << endl;\n    cerr << \"\\tcoverage  Prints coverage statistics from the input BAM file\" << endl;\n    cerr << \"\\tfilter    Filters BAM file(s) by user-specified criteria\" << endl;\n    cerr << \"\\theader    Prints BAM header information\" << endl;\n    cerr << \"\\tindex     Generates index for BAM file\" << endl;\n    cerr << \"\\tmerge     Merge multiple BAM files into single file\" << endl;\n    cerr << \"\\trandom    Grab a random subset of alignments\" << endl;\n    cerr << \"\\tsort      Sorts the BAM file according to some criteria\" << endl;\n    cerr << \"\\tstats     Prints general alignment statistics\" << endl;\n    cerr << endl;\n    cerr << \"See 'bamtools help COMMAND' for more information on a specific command.\" << endl;\n    cerr << endl;\n    return 0;\n}\n\n\/\/ ------------------------------------------\n\/\/ Print version info\nint Version(void) {\n    cout << endl;\n    cout << \"bamtools v0.8.xx\" << endl;\n    cout << \"Part of BamTools API and toolkit\" << endl;\n    cout << \"Primary authors: Derek Barnett, Erik Garrison, Michael Stromberg\" << endl;\n    cout << \"(c) 2009-2010 Marth Lab, Biology Dept., Boston College\" << endl;\n    cout << endl;\n    return 0;\n}\n\n\/\/ ------------------------------------------\n\/\/ toolkit entry point\nint main(int argc, char* argv[]) {\n\n    \/\/ just 'bamtools'\n    if ( (argc == 1) ) return Help(argc, argv);\n    \n    \/\/ 'bamtools help', 'bamtools --help', or 'bamtools -h'\n    if ( (argv[1] == HELP) || (argv[1] == LONG_HELP) || (argv[1] == SHORT_HELP) ) return Help(argc, argv); \n    \n    \/\/ 'bamtools version', 'bamtools --version', or 'bamtools -v'\n    if ( (argv[1] == VERSION) || (argv[1] == LONG_VERSION) || (argv[1] == SHORT_VERSION) ) return Version(); \n        \n    \/\/ determine desired sub-tool\n    AbstractTool* tool(0);\n    if ( argv[1] == CONVERT )  tool = new ConvertTool;\n    if ( argv[1] == COUNT )    tool = new CountTool;\n    if ( argv[1] == COVERAGE ) tool = new CoverageTool;\n    if ( argv[1] == FILTER )   tool = new FilterTool;\n    if ( argv[1] == HEADER )   tool = new HeaderTool;\n    if ( argv[1] == INDEX )    tool = new IndexTool;\n    if ( argv[1] == MERGE )    tool = new MergeTool;\n    if ( argv[1] == RANDOM )   tool = new RandomTool;\n    if ( argv[1] == SORT )     tool = new SortTool;\n    if ( argv[1] == STATS )    tool = new StatsTool;\n    \n    \/\/ if found, run tool\n    if ( tool ) return tool->Run(argc, argv);\n    \/\/ no match found, show help\n    else return Help(argc, argv); \n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <iosfwd>\n#include <initializer_list>\n\nnamespace RealRT\n{\n    class Vector3D\n    {\n        public:\n            Vector3D(void) = default;\n            \n            Vector3D(float i, float j, float k);\n            \n            explicit Vector3D(const float *values);\n            \n            Vector3D(std::initializer_list<float> list);\n            \n            float I(void) const;\n            \n            float J(void) const;\n            \n            float K(void) const;\n            \n            Vector3D Add(const Vector3D &v) const;\n            \n            Vector3D Subtract(const Vector3D &v) const;\n            \n            Vector3D Normalize(void) const;\n            \n            float Distance(const Vector3D &rhs) const;\n            \n            float Magnitude(void) const;\n            \n            Vector3D Scale(float scalar) const;\n            \n            Vector3D Clip(float maxVal) const;\n            \n            Vector3D Weight(Vector3D dimWeights) const;\n            \n            float Dot(const Vector3D &rhs) const;\n            \n            Vector3D Cross(const Vector3D &rhs) const;\n            \n            float operator [](int i) const;\n            \n            bool operator ==(const Vector3D &rhs) const;\n            \n            bool operator !=(const Vector3D &rhs) const;\n            \n            bool operator <(const Vector3D &rhs) const;\n            \n            bool operator <=(const Vector3D &rhs) const;\n            \n            bool operator >(const Vector3D &rhs) const;\n            \n            bool operator >=(const Vector3D &rhs) const;\n            \n            Vector3D operator +(const Vector3D &rhs) const;\n            \n            Vector3D operator -(const Vector3D &rhs) const;\n            \n            Vector3D &operator +=(const Vector3D &rhs);\n            \n            Vector3D &operator -=(const Vector3D &rhs);\n            \n            friend Vector3D operator *(float scalar, const Vector3D &v);\n            \n            friend Vector3D operator *(const Vector3D &v, float scalar);\n            \n            float operator *(const Vector3D &rhs) const;\n            \n            Vector3D &operator *=(float scalar);\n            \n            Vector3D operator %(const Vector3D &rhs) const;            \n            \n            Vector3D &operator %=(const Vector3D &rhs);            \n            \n            friend std::ostream &operator<<(std::ostream &os, const Vector3D &obj);\n            \n            friend std::istream &operator>>(std::istream &is, Vector3D &obj);\n\n        private:\n\n            float _I = 0.f, _J = 0.f, _K = 0.f;\n        };\n\n}\n<commit_msg>Fixed missing const reference on weight function declaration<commit_after>#pragma once\n\n#include <iosfwd>\n#include <initializer_list>\n\nnamespace RealRT\n{\n    class Vector3D\n    {\n        public:\n            Vector3D(void) = default;\n            \n            Vector3D(float i, float j, float k);\n            \n            explicit Vector3D(const float *values);\n            \n            Vector3D(std::initializer_list<float> list);\n            \n            float I(void) const;\n            \n            float J(void) const;\n            \n            float K(void) const;\n            \n            Vector3D Add(const Vector3D &v) const;\n            \n            Vector3D Subtract(const Vector3D &v) const;\n            \n            Vector3D Normalize(void) const;\n            \n            float Distance(const Vector3D &rhs) const;\n            \n            float Magnitude(void) const;\n            \n            Vector3D Scale(float scalar) const;\n            \n            Vector3D Clip(float maxVal) const;\n            \n            Vector3D Weight(const Vector3D &dimWeights) const;\n            \n            float Dot(const Vector3D &rhs) const;\n            \n            Vector3D Cross(const Vector3D &rhs) const;\n            \n            float operator [](int i) const;\n            \n            bool operator ==(const Vector3D &rhs) const;\n            \n            bool operator !=(const Vector3D &rhs) const;\n            \n            bool operator <(const Vector3D &rhs) const;\n            \n            bool operator <=(const Vector3D &rhs) const;\n            \n            bool operator >(const Vector3D &rhs) const;\n            \n            bool operator >=(const Vector3D &rhs) const;\n            \n            Vector3D operator +(const Vector3D &rhs) const;\n            \n            Vector3D operator -(const Vector3D &rhs) const;\n            \n            Vector3D &operator +=(const Vector3D &rhs);\n            \n            Vector3D &operator -=(const Vector3D &rhs);\n            \n            friend Vector3D operator *(float scalar, const Vector3D &v);\n            \n            friend Vector3D operator *(const Vector3D &v, float scalar);\n            \n            float operator *(const Vector3D &rhs) const;\n            \n            Vector3D &operator *=(float scalar);\n            \n            Vector3D operator %(const Vector3D &rhs) const;            \n            \n            Vector3D &operator %=(const Vector3D &rhs);            \n            \n            friend std::ostream &operator<<(std::ostream &os, const Vector3D &obj);\n            \n            friend std::istream &operator>>(std::istream &is, Vector3D &obj);\n\n        private:\n\n            float _I = 0.f, _J = 0.f, _K = 0.f;\n        };\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\n**  Copyright (C) 2015 Klarälvdalens Datakonsult AB, a KDAB Group company, info@kdab.com\n**  Author: Sérgio Martins <sergio.martins@kdab.com>\n**\n** This file may be distributed and\/or modified under the terms of the\n** GNU Lesser General Public License version 2.1 and version 3 as published by the\n** Free Software Foundation and appearing in the file LICENSE.LGPL.txt included.\n**\n** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE\n** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n**********************************************************************\/\n\n#include \"movablecontainers.h\"\n#include \"Utils.h\"\n\n#include <clang\/AST\/AST.h>\n#include <clang\/AST\/DeclTemplate.h>\n\n#include <sstream>\n\nusing namespace std;\nusing namespace clang;\n\n\/\/ Recomends usages of Q_PRIMITIVE_TYPE, don't advise for non-POD types that are movable\n\nMovableContainers::MovableContainers(clang::CompilerInstance &ci)\n    : CheckBase(ci)\n{\n}\n\nvoid MovableContainers::VisitDecl(clang::Decl *decl)\n{\n    \/\/ Catches QTypeInfo<Foo> to know type classification\n    auto templateDef = dyn_cast<ClassTemplateSpecializationDecl>(decl);\n    if (templateDef) {\n        registerQTypeInfo(templateDef);\n    }\n\n    \/\/ Catches QList<Foo>\n    ClassTemplateSpecializationDecl *tstdecl = Utils::templateDecl(decl);\n    if (tstdecl == nullptr || tstdecl->getName() != \"QList\")\n        return;\n\n    const TemplateArgumentList &tal = tstdecl->getTemplateArgs();\n\n    if (tal.size() != 1) return;\n    QualType qt2 = tal[0].getAsType();\n    const int size_of_void = 32; \/\/ performance on arm is more important\n    const int size_of_T = m_ci.getASTContext().getTypeSize(qt2); \/\/ QList<T>\n\n    const bool isMovable = qt2.isTriviallyCopyableType(m_ci.getASTContext());\n\n    if (size_of_T <= size_of_void && isMovable) {\n        const Type *t = qt2.getTypePtrOrNull();\n        if (t == nullptr || t->getAsCXXRecordDecl() == nullptr) return;\n\n        std::string typeName = t->getAsCXXRecordDecl()->getName();\n        if (m_typeInfos.count(t->getAsCXXRecordDecl()->getQualifiedNameAsString()) != 0)\n            return;\n\n        if (t->isRecordType() && !ignoreTypeInfo(typeName)) {\n            std::string s;\n            std::stringstream out;\n            out << m_ci.getASTContext().getTypeSize(qt2)\/8;\n            s = \"Make this class movable: \" + typeName + \" [-Wmore-warnings-movable]\";\n            emitWarning(decl->getLocStart(), s.c_str());\n            emitWarning(t->getAsCXXRecordDecl()->getLocStart(), \"Type declared here:\");\n        }\n    }\n}\n\nvoid MovableContainers::registerQTypeInfo(ClassTemplateSpecializationDecl *decl)\n{\n    if (decl->getName() == \"QTypeInfo\") {\n        auto &args = decl->getTemplateArgs();\n        if (args.size() != 1)\n            return;\n\n        QualType qt = args[0].getAsType();\n        const Type *t = qt.getTypePtrOrNull();\n        CXXRecordDecl *recordDecl =  t ? t->getAsCXXRecordDecl() : nullptr;\n        if (recordDecl != nullptr) {\n            m_typeInfos.insert(recordDecl->getQualifiedNameAsString());\n        }\n    }\n}\n\nbool MovableContainers::ignoreTypeInfo(const std::string &className) const\n{\n    std::vector<std::string> primitives {\"QPair\"};\n    return std::find(primitives.begin(), primitives.end(), className) != primitives.end();\n}\n\nstd::string MovableContainers::name() const\n{\n    return \"mark-it-primitive\";\n}\n<commit_msg>Don't crash when we only have a fwd decl.<commit_after>\/**********************************************************************\n**  Copyright (C) 2015 Klarälvdalens Datakonsult AB, a KDAB Group company, info@kdab.com\n**  Author: Sérgio Martins <sergio.martins@kdab.com>\n**\n** This file may be distributed and\/or modified under the terms of the\n** GNU Lesser General Public License version 2.1 and version 3 as published by the\n** Free Software Foundation and appearing in the file LICENSE.LGPL.txt included.\n**\n** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE\n** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n**********************************************************************\/\n\n#include \"movablecontainers.h\"\n#include \"Utils.h\"\n\n#include <clang\/AST\/AST.h>\n#include <clang\/AST\/DeclTemplate.h>\n\n#include <sstream>\n\nusing namespace std;\nusing namespace clang;\n\n\/\/ Recomends usages of Q_PRIMITIVE_TYPE, don't advise for non-POD types that are movable\n\nMovableContainers::MovableContainers(clang::CompilerInstance &ci)\n    : CheckBase(ci)\n{\n}\n\nvoid MovableContainers::VisitDecl(clang::Decl *decl)\n{\n    \/\/ Catches QTypeInfo<Foo> to know type classification\n    auto templateDef = dyn_cast<ClassTemplateSpecializationDecl>(decl);\n    if (templateDef) {\n        registerQTypeInfo(templateDef);\n    }\n\n    \/\/ Catches QList<Foo>\n    ClassTemplateSpecializationDecl *tstdecl = Utils::templateDecl(decl);\n    if (tstdecl == nullptr || tstdecl->getName() != \"QList\")\n        return;\n\n    const TemplateArgumentList &tal = tstdecl->getTemplateArgs();\n\n    if (tal.size() != 1) return;\n    QualType qt2 = tal[0].getAsType();\n\n    const Type *t = qt2.getTypePtrOrNull();\n    if (t == nullptr || t->getAsCXXRecordDecl() == nullptr || t->getAsCXXRecordDecl()->getDefinition() == nullptr) return; \/\/ Don't crash if we only have a fwd decl\n\n    const int size_of_void = 32; \/\/ performance on arm is more important\n    const int size_of_T = m_ci.getASTContext().getTypeSize(qt2); \/\/ QList<T>\n\n    const bool isMovable = qt2.isTriviallyCopyableType(m_ci.getASTContext());\n\n    if (size_of_T <= size_of_void && isMovable) {\n\n        std::string typeName = t->getAsCXXRecordDecl()->getName();\n        if (m_typeInfos.count(t->getAsCXXRecordDecl()->getQualifiedNameAsString()) != 0)\n            return;\n\n        if (t->isRecordType() && !ignoreTypeInfo(typeName)) {\n            std::string s;\n            std::stringstream out;\n            out << m_ci.getASTContext().getTypeSize(qt2)\/8;\n            s = \"Make this class movable: \" + typeName + \" [-Wmore-warnings-movable]\";\n            emitWarning(decl->getLocStart(), s.c_str());\n            emitWarning(t->getAsCXXRecordDecl()->getLocStart(), \"Type declared here:\");\n        }\n    }\n}\n\nvoid MovableContainers::registerQTypeInfo(ClassTemplateSpecializationDecl *decl)\n{\n    if (decl->getName() == \"QTypeInfo\") {\n        auto &args = decl->getTemplateArgs();\n        if (args.size() != 1)\n            return;\n\n        QualType qt = args[0].getAsType();\n        const Type *t = qt.getTypePtrOrNull();\n        CXXRecordDecl *recordDecl =  t ? t->getAsCXXRecordDecl() : nullptr;\n        if (recordDecl != nullptr) {\n            m_typeInfos.insert(recordDecl->getQualifiedNameAsString());\n        }\n    }\n}\n\nbool MovableContainers::ignoreTypeInfo(const std::string &className) const\n{\n    std::vector<std::string> primitives {\"QPair\"};\n    return std::find(primitives.begin(), primitives.end(), className) != primitives.end();\n}\n\nstd::string MovableContainers::name() const\n{\n    return \"mark-it-primitive\";\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QApplication>\n#include \"MotionCapture.h\"\n#include <ros\/ros.h>\n\nint main(int argc, char *argv[])\n{\n\tros::init(argc, argv, \"MotionCapture\");\n\tros::NodeHandle node;\n    QApplication a(argc, argv);\n\tMotionCapture w(node);\n    w.show();\n    \n    return a.exec();\n}\n\n<commit_msg>Update main.cpp<commit_after>#include <QApplication>\n#include \"MotionCapture.h\"\n#include <ros\/ros.h>\n\nint main(int argc, char *argv[])\n{\n    ros::init(argc, argv, \"MotionCapture\");\n    ros::NodeHandle node;\n    QApplication a(argc, argv);\n    MotionCapture w(node);\n    w.show();\n    \n    return a.exec();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef WIN32\n\n\/\/===--- TerminalDisplayUnix.cpp - Output To UNIX Terminal ------*- 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 interface for writing to a UNIX terminal. It tries to\n\/\/  support all \"common\" terminal types.\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"textinput\/TerminalDisplayUnix.h\"\n\n#include \"textinput\/TerminalConfigUnix.h\"\n#include \"textinput\/Color.h\"\n\n#include <stdio.h>\n\/\/ putenv not in cstdlib on Solaris\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/ioctl.h>\n#include <termios.h>\n#include <csignal>\n#include <cstring>\n#include <sstream>\n\nusing std::signal;\nusing std::strstr;\n\nnamespace {\n  textinput::TerminalDisplayUnix*& gTerminalDisplayUnix() {\n    static textinput::TerminalDisplayUnix* S = 0;\n    return S;\n  }\n\n  void InitRGB256(unsigned char rgb256[][3]) {\n    \/\/ initialize the array with the expected standard colors:\n    \/\/ (from http:\/\/frexx.de\/xterm-256-notes)\n\n    \/\/ this is not what I see, though it's supposedly the default:\n    \/\/   rgb[0][0] =   0; rgb[0][1] =   0; rgb[0][1] =   0;\n    \/\/ use this instead, just to be on the safe side:\n    rgb256[0][0] =  46; rgb256[0][1] =  52; rgb256[0][1] =  64;\n    rgb256[1][0] = 205; rgb256[1][1] =   0; rgb256[1][1] =   0;\n    rgb256[2][0] =   0; rgb256[2][1] = 205; rgb256[2][1] =   0;\n    rgb256[3][0] = 205; rgb256[3][1] = 205; rgb256[3][1] =   0;\n    rgb256[4][0] =   0; rgb256[4][1] =   0; rgb256[4][1] = 238;\n    rgb256[5][0] = 205; rgb256[5][1] =   0; rgb256[5][1] = 205;\n    rgb256[6][0] =   0; rgb256[6][1] = 205; rgb256[6][1] = 205;\n    rgb256[7][0] = 229; rgb256[7][1] = 229; rgb256[7][1] = 229;\n    \n    \/\/ this is not what I see, though it's supposedly the default:\n    \/\/   rgb256[ 8][0] = 127; rgb256[ 8][1] = 127; rgb256[ 8][1] = 127;\n    \/\/ use this instead, just to be on the safe side:\n    rgb256[ 8][0] =   0; rgb256[ 8][1] =   0; rgb256[ 8][1] =   0;\n    rgb256[ 9][0] = 255; rgb256[ 9][1] =   0; rgb256[ 9][1] =   0;\n    rgb256[10][0] =   0; rgb256[10][1] = 255; rgb256[10][1] =   0;\n    rgb256[11][0] = 255; rgb256[11][1] = 255; rgb256[11][1] =   0;\n    rgb256[12][0] =  92; rgb256[12][1] =  92; rgb256[12][1] = 255;\n    rgb256[13][0] = 255; rgb256[13][1] =   0; rgb256[13][1] = 255;\n    rgb256[14][0] =   0; rgb256[14][1] = 255; rgb256[14][1] = 255;\n    rgb256[15][0] = 255; rgb256[15][1] = 255; rgb256[15][1] = 255;\n    \n    \/\/ 6 intensity RGB\n    static const int intensities[] = {0, 0x5f, 0x87, 0xaf, 0xd7, 0xff};\n    int idx = 16;\n    for (int r = 0; r < 6; ++r) {\n      for (int g = 0; g < 6; ++g) {\n        for (int b = 0; b < 6; ++b) {\n          rgb256[idx][0] = intensities[r];\n          rgb256[idx][1] = intensities[g];\n          rgb256[idx][2] = intensities[b];\n          ++idx;\n        }\n      }\n    }\n\n    \/\/ colors 232-255 are a grayscale ramp, intentionally leaving out\n    \/\/ black and white\n    for (unsigned char gray = 0; gray < 24; ++gray) {\n      unsigned char level = (gray * 10) + 8;\n      rgb256[232 + gray][0] = level;\n      rgb256[232 + gray][1] = level;\n      rgb256[232 + gray][2] = level;\n    }\n  }\n} \/\/ unnamed namespace\n\nextern \"C\" void TerminalDisplayUnix__handleResizeSignal(int) {\n  gTerminalDisplayUnix()->HandleResizeSignal();\n}\n\nnamespace textinput {\n  \/\/ If input is not a tty don't write in tty-mode either.\n  TerminalDisplayUnix::TerminalDisplayUnix():\n    TerminalDisplay(isatty(fileno(stdin)) && isatty(fileno(stdout))),\n    fIsAttached(false), fNColors(16) {\n    HandleResizeSignal();\n    gTerminalDisplayUnix() = this;\n    signal(SIGWINCH, TerminalDisplayUnix__handleResizeSignal);\n#ifdef TCSANOW\n    TerminalConfigUnix::Get().TIOS()->c_lflag &= ~(ECHO);\n    TerminalConfigUnix::Get().TIOS()->c_lflag |= ECHOCTL|ECHOKE|ECHOE;\n#endif\n    const char* TERM = getenv(\"TERM\");\n    if (TERM &&  strstr(TERM, \"256\")) {\n      fNColors = 256;\n    }\n  }\n\n  TerminalDisplayUnix::~TerminalDisplayUnix() {\n    Detach();\n  }\n  \n  void\n  TerminalDisplayUnix::HandleResizeSignal() {\n#ifdef TIOCGWINSZ\n    struct winsize sz;\n    int ret = ioctl(fileno(stdout), TIOCGWINSZ, (char*)&sz);\n    if (!ret && sz.ws_col) {\n      SetWidth(sz.ws_col);\n\n      \/\/ Export what we found.\n      std::stringstream s;\n      s << sz.ws_col;\n      setenv(\"COLUMS\", s.str().c_str(), 1 \/*overwrite*\/);\n      s.clear();\n      s << sz.ws_row;\n      setenv(\"LINES\", s.str().c_str(), 1 \/*overwrite*\/);\n    }\n#else\n    \/\/ try $COLUMNS\n    const char* COLUMNS = getenv(\"COLUMNS\");\n    if (COLUMNS) {\n      long width = atol(COLUMNS);\n      if (width > 4 && width < 1024*16) {\n        SetWidth(width);\n      }\n    }\n#endif\n  }\n\n  void\n  TerminalDisplayUnix::SetColor(char CIdx, const Color& C) {\n    if (!IsTTY()) return;\n    \n    \/\/ Default color, reset previous bold etc.\n    static const char text[] = {(char)0x1b, '[', '0', 'm', 0};\n    WriteRawString(text, 4);\n\n    if (CIdx == 0) return;\n\n    if (fNColors == 256) {\n      int ANSIIdx = GetClosestColorIdx256(C);\n      static const char preamble[] = {'\\x1b', '[', '3', '8', ';', '5', ';', 0};\n      std::string buf(preamble);\n      if (ANSIIdx > 100) {\n        buf += '0' + (ANSIIdx \/ 100);\n      }\n      if (ANSIIdx > 10) {\n        buf += '0' + ((ANSIIdx \/ 10) % 10);\n      }\n      buf += '0' + (ANSIIdx % 10);\n      buf +=  \"m\";\n      WriteRawString(buf.c_str(), buf.length());\n    } else {\n      int ANSIIdx = GetClosestColorIdx16(C);\n      char buf[] = {'\\x1b', '[', '3', '0' + (ANSIIdx % 8), 'm', 0};\n      if (ANSIIdx > 7) buf[2] += 6;\n      WriteRawString(buf, 5);\n    }\n\n    if (C.fModifiers & Color::kModUnderline) {\n      WriteRawString(\"\\033[4m\", 4);\n    }\n    if (C.fModifiers & Color::kModBold) {\n      WriteRawString(\"\\033[1m\", 4);\n    }\n    if (C.fModifiers & Color::kModInverse) {\n      WriteRawString(\"\\033[7m\", 4);\n    }\n\n  }\n  \n  void\n  TerminalDisplayUnix::MoveFront() {\n    static const char text[] = {(char)0x1b, '[', '1', 'G', 0};\n    if (!IsTTY()) return;\n    WriteRawString(text, sizeof(text));\n  }\n  \n  void\n  TerminalDisplayUnix::MoveInternal(char What, size_t n) {\n    static const char cmd[] = \"\\x1b[\";\n    if (!IsTTY()) return;\n    std::string text;\n    for (size_t i = 0; i < n; ++i) {\n      text += cmd;\n      text += What;\n    }\n    WriteRawString(text.c_str(), text.length()); \n  }\n\n  void\n  TerminalDisplayUnix::MoveUp(size_t nLines \/* = 1 *\/) {\n    MoveInternal('A', nLines);\n  }\n\n  void\n  TerminalDisplayUnix::MoveDown(size_t nLines \/* = 1 *\/) {\n    if (!IsTTY()) return;\n    std::string moves(nLines, 0x0a);\n    WriteRawString(moves.c_str(), nLines);\n  }\n  \n  void\n  TerminalDisplayUnix::MoveRight(size_t nCols \/* = 1 *\/) {\n    MoveInternal('C', nCols);\n  }\n  \n  void\n  TerminalDisplayUnix::MoveLeft(size_t nCols \/* = 1 *\/) {\n    MoveInternal('D', nCols);\n  }\n  \n  void\n  TerminalDisplayUnix::EraseToRight() {\n    static const char text[] = {(char)0x1b, '[', 'K', 0};\n    if (!IsTTY()) return;\n    WriteRawString(text, sizeof(text));\n  }\n\n  void\n  TerminalDisplayUnix::WriteRawString(const char *text, size_t len) {\n    if (write(fileno(stdout), text, len) == -1) {\n      \/\/ Silence Ubuntu's \"unused result\". We don't care if it fails.\n    }\n  }\n\n  void\n  TerminalDisplayUnix::ActOnEOL() {\n    if (!IsTTY()) return;\n    WriteRawString(\" \\b\", 2);\n    \/\/MoveUp();\n  }\n  \n  void\n  TerminalDisplayUnix::Attach() {\n    \/\/ set to noecho\n    if (fIsAttached) return;\n    fflush(stdout);\n    TerminalConfigUnix::Get().Attach();\n    fIsAttached = true;\n    NotifyTextChange(Range::AllWithPrompt());\n  }\n  \n  void\n  TerminalDisplayUnix::Detach() {\n    if (!fIsAttached) return;\n    fflush(stdout);\n    TerminalConfigUnix::Get().Detach();\n    TerminalDisplay::Detach();\n    fIsAttached = false;\n  }\n\n  int\n  TerminalDisplayUnix::GetClosestColorIdx16(const Color& C) {\n    int r = C.fR;\n    int g = C.fG;\n    int b = C.fB;\n    int sum = r + g + b;\n    r = r > sum \/ 4;\n    g = g > sum \/ 4;\n    b = b > sum \/ 4;\n    \n    \/\/ ANSI:\n    return r + (g * 2) + (b * 4);\n    \/\/ ! ANSI:\n    \/\/ return (r * 4) + (g * 2) + b;\n  }\n\n  int\n  TerminalDisplayUnix::GetClosestColorIdx256(const Color& C) {\n    static unsigned char rgb256[256][3] = {{0}};\n    if (rgb256[0][0] == 0) {\n      InitRGB256(rgb256);\n    }\n    \n    \/\/ Find the closest index.\n    \/\/ A: the closest color match (square of geometric distance in RGB)\n    \/\/ B: the closest brightness match\n    \/\/ Treat them equally, which suppresses differences\n    \/\/ in color due to squared distance.\n    \n    \/\/ start with black:\n    int idx = 0;\n    unsigned int r = C.fR;\n    unsigned int g = C.fG;\n    unsigned int b = C.fB;\n    unsigned int graylvl = (r + g + b)\/3;\n    long mindelta = (r*r + g*g + b*b) + graylvl;\n    if (mindelta) {\n      for (unsigned int i = 0; i < 256; ++i) {\n        long delta = (rgb256[i][0] + rgb256[i][1] + rgb256[i][2])\/3 - graylvl;\n        if (delta < 0) delta = -delta;\n        delta += (r-rgb256[i][0])*(r-rgb256[i][0]) +\n        (g-rgb256[i][1])*(g-rgb256[i][1]) +\n        (b-rgb256[i][2])*(b-rgb256[i][2]);\n        \n        if (delta < mindelta) {\n          mindelta = delta;\n          idx = i;\n          if (mindelta == 0) break;\n        }\n      }\n    }\n    return idx;\n  }\n        \n}\n\n#endif \/\/ #ifndef WIN32\n<commit_msg>Reset fWritePos+Len when Attach()ing: we don't know where the application has sent us, cursor-wise.<commit_after>#ifndef WIN32\n\n\/\/===--- TerminalDisplayUnix.cpp - Output To UNIX Terminal ------*- 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 interface for writing to a UNIX terminal. It tries to\n\/\/  support all \"common\" terminal types.\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"textinput\/TerminalDisplayUnix.h\"\n\n#include \"textinput\/TerminalConfigUnix.h\"\n#include \"textinput\/Color.h\"\n\n#include <stdio.h>\n\/\/ putenv not in cstdlib on Solaris\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/ioctl.h>\n#include <termios.h>\n#include <csignal>\n#include <cstring>\n#include <sstream>\n\nusing std::signal;\nusing std::strstr;\n\nnamespace {\n  textinput::TerminalDisplayUnix*& gTerminalDisplayUnix() {\n    static textinput::TerminalDisplayUnix* S = 0;\n    return S;\n  }\n\n  void InitRGB256(unsigned char rgb256[][3]) {\n    \/\/ initialize the array with the expected standard colors:\n    \/\/ (from http:\/\/frexx.de\/xterm-256-notes)\n\n    \/\/ this is not what I see, though it's supposedly the default:\n    \/\/   rgb[0][0] =   0; rgb[0][1] =   0; rgb[0][1] =   0;\n    \/\/ use this instead, just to be on the safe side:\n    rgb256[0][0] =  46; rgb256[0][1] =  52; rgb256[0][1] =  64;\n    rgb256[1][0] = 205; rgb256[1][1] =   0; rgb256[1][1] =   0;\n    rgb256[2][0] =   0; rgb256[2][1] = 205; rgb256[2][1] =   0;\n    rgb256[3][0] = 205; rgb256[3][1] = 205; rgb256[3][1] =   0;\n    rgb256[4][0] =   0; rgb256[4][1] =   0; rgb256[4][1] = 238;\n    rgb256[5][0] = 205; rgb256[5][1] =   0; rgb256[5][1] = 205;\n    rgb256[6][0] =   0; rgb256[6][1] = 205; rgb256[6][1] = 205;\n    rgb256[7][0] = 229; rgb256[7][1] = 229; rgb256[7][1] = 229;\n    \n    \/\/ this is not what I see, though it's supposedly the default:\n    \/\/   rgb256[ 8][0] = 127; rgb256[ 8][1] = 127; rgb256[ 8][1] = 127;\n    \/\/ use this instead, just to be on the safe side:\n    rgb256[ 8][0] =   0; rgb256[ 8][1] =   0; rgb256[ 8][1] =   0;\n    rgb256[ 9][0] = 255; rgb256[ 9][1] =   0; rgb256[ 9][1] =   0;\n    rgb256[10][0] =   0; rgb256[10][1] = 255; rgb256[10][1] =   0;\n    rgb256[11][0] = 255; rgb256[11][1] = 255; rgb256[11][1] =   0;\n    rgb256[12][0] =  92; rgb256[12][1] =  92; rgb256[12][1] = 255;\n    rgb256[13][0] = 255; rgb256[13][1] =   0; rgb256[13][1] = 255;\n    rgb256[14][0] =   0; rgb256[14][1] = 255; rgb256[14][1] = 255;\n    rgb256[15][0] = 255; rgb256[15][1] = 255; rgb256[15][1] = 255;\n    \n    \/\/ 6 intensity RGB\n    static const int intensities[] = {0, 0x5f, 0x87, 0xaf, 0xd7, 0xff};\n    int idx = 16;\n    for (int r = 0; r < 6; ++r) {\n      for (int g = 0; g < 6; ++g) {\n        for (int b = 0; b < 6; ++b) {\n          rgb256[idx][0] = intensities[r];\n          rgb256[idx][1] = intensities[g];\n          rgb256[idx][2] = intensities[b];\n          ++idx;\n        }\n      }\n    }\n\n    \/\/ colors 232-255 are a grayscale ramp, intentionally leaving out\n    \/\/ black and white\n    for (unsigned char gray = 0; gray < 24; ++gray) {\n      unsigned char level = (gray * 10) + 8;\n      rgb256[232 + gray][0] = level;\n      rgb256[232 + gray][1] = level;\n      rgb256[232 + gray][2] = level;\n    }\n  }\n} \/\/ unnamed namespace\n\nextern \"C\" void TerminalDisplayUnix__handleResizeSignal(int) {\n  gTerminalDisplayUnix()->HandleResizeSignal();\n}\n\nnamespace textinput {\n  \/\/ If input is not a tty don't write in tty-mode either.\n  TerminalDisplayUnix::TerminalDisplayUnix():\n    TerminalDisplay(isatty(fileno(stdin)) && isatty(fileno(stdout))),\n    fIsAttached(false), fNColors(16) {\n    HandleResizeSignal();\n    gTerminalDisplayUnix() = this;\n    signal(SIGWINCH, TerminalDisplayUnix__handleResizeSignal);\n#ifdef TCSANOW\n    TerminalConfigUnix::Get().TIOS()->c_lflag &= ~(ECHO);\n    TerminalConfigUnix::Get().TIOS()->c_lflag |= ECHOCTL|ECHOKE|ECHOE;\n#endif\n    const char* TERM = getenv(\"TERM\");\n    if (TERM &&  strstr(TERM, \"256\")) {\n      fNColors = 256;\n    }\n  }\n\n  TerminalDisplayUnix::~TerminalDisplayUnix() {\n    Detach();\n  }\n  \n  void\n  TerminalDisplayUnix::HandleResizeSignal() {\n#ifdef TIOCGWINSZ\n    struct winsize sz;\n    int ret = ioctl(fileno(stdout), TIOCGWINSZ, (char*)&sz);\n    if (!ret && sz.ws_col) {\n      SetWidth(sz.ws_col);\n\n      \/\/ Export what we found.\n      std::stringstream s;\n      s << sz.ws_col;\n      setenv(\"COLUMS\", s.str().c_str(), 1 \/*overwrite*\/);\n      s.clear();\n      s << sz.ws_row;\n      setenv(\"LINES\", s.str().c_str(), 1 \/*overwrite*\/);\n    }\n#else\n    \/\/ try $COLUMNS\n    const char* COLUMNS = getenv(\"COLUMNS\");\n    if (COLUMNS) {\n      long width = atol(COLUMNS);\n      if (width > 4 && width < 1024*16) {\n        SetWidth(width);\n      }\n    }\n#endif\n  }\n\n  void\n  TerminalDisplayUnix::SetColor(char CIdx, const Color& C) {\n    if (!IsTTY()) return;\n    \n    \/\/ Default color, reset previous bold etc.\n    static const char text[] = {(char)0x1b, '[', '0', 'm', 0};\n    WriteRawString(text, 4);\n\n    if (CIdx == 0) return;\n\n    if (fNColors == 256) {\n      int ANSIIdx = GetClosestColorIdx256(C);\n      static const char preamble[] = {'\\x1b', '[', '3', '8', ';', '5', ';', 0};\n      std::string buf(preamble);\n      if (ANSIIdx > 100) {\n        buf += '0' + (ANSIIdx \/ 100);\n      }\n      if (ANSIIdx > 10) {\n        buf += '0' + ((ANSIIdx \/ 10) % 10);\n      }\n      buf += '0' + (ANSIIdx % 10);\n      buf +=  \"m\";\n      WriteRawString(buf.c_str(), buf.length());\n    } else {\n      int ANSIIdx = GetClosestColorIdx16(C);\n      char buf[] = {'\\x1b', '[', '3', '0' + (ANSIIdx % 8), 'm', 0};\n      if (ANSIIdx > 7) buf[2] += 6;\n      WriteRawString(buf, 5);\n    }\n\n    if (C.fModifiers & Color::kModUnderline) {\n      WriteRawString(\"\\033[4m\", 4);\n    }\n    if (C.fModifiers & Color::kModBold) {\n      WriteRawString(\"\\033[1m\", 4);\n    }\n    if (C.fModifiers & Color::kModInverse) {\n      WriteRawString(\"\\033[7m\", 4);\n    }\n\n  }\n  \n  void\n  TerminalDisplayUnix::MoveFront() {\n    static const char text[] = {(char)0x1b, '[', '1', 'G', 0};\n    if (!IsTTY()) return;\n    WriteRawString(text, sizeof(text));\n  }\n  \n  void\n  TerminalDisplayUnix::MoveInternal(char What, size_t n) {\n    static const char cmd[] = \"\\x1b[\";\n    if (!IsTTY()) return;\n    std::string text;\n    for (size_t i = 0; i < n; ++i) {\n      text += cmd;\n      text += What;\n    }\n    WriteRawString(text.c_str(), text.length()); \n  }\n\n  void\n  TerminalDisplayUnix::MoveUp(size_t nLines \/* = 1 *\/) {\n    MoveInternal('A', nLines);\n  }\n\n  void\n  TerminalDisplayUnix::MoveDown(size_t nLines \/* = 1 *\/) {\n    if (!IsTTY()) return;\n    std::string moves(nLines, 0x0a);\n    WriteRawString(moves.c_str(), nLines);\n  }\n  \n  void\n  TerminalDisplayUnix::MoveRight(size_t nCols \/* = 1 *\/) {\n    MoveInternal('C', nCols);\n  }\n  \n  void\n  TerminalDisplayUnix::MoveLeft(size_t nCols \/* = 1 *\/) {\n    MoveInternal('D', nCols);\n  }\n  \n  void\n  TerminalDisplayUnix::EraseToRight() {\n    static const char text[] = {(char)0x1b, '[', 'K', 0};\n    if (!IsTTY()) return;\n    WriteRawString(text, sizeof(text));\n  }\n\n  void\n  TerminalDisplayUnix::WriteRawString(const char *text, size_t len) {\n    if (write(fileno(stdout), text, len) == -1) {\n      \/\/ Silence Ubuntu's \"unused result\". We don't care if it fails.\n    }\n  }\n\n  void\n  TerminalDisplayUnix::ActOnEOL() {\n    if (!IsTTY()) return;\n    WriteRawString(\" \\b\", 2);\n    \/\/MoveUp();\n  }\n  \n  void\n  TerminalDisplayUnix::Attach() {\n    \/\/ set to noecho\n    if (fIsAttached) return;\n    fflush(stdout);\n    TerminalConfigUnix::Get().Attach();\n    fWritePos = Pos();\n    fWriteLen = 0;\n    fIsAttached = true;\n    NotifyTextChange(Range::AllWithPrompt());\n  }\n  \n  void\n  TerminalDisplayUnix::Detach() {\n    if (!fIsAttached) return;\n    fflush(stdout);\n    TerminalConfigUnix::Get().Detach();\n    TerminalDisplay::Detach();\n    fIsAttached = false;\n  }\n\n  int\n  TerminalDisplayUnix::GetClosestColorIdx16(const Color& C) {\n    int r = C.fR;\n    int g = C.fG;\n    int b = C.fB;\n    int sum = r + g + b;\n    r = r > sum \/ 4;\n    g = g > sum \/ 4;\n    b = b > sum \/ 4;\n    \n    \/\/ ANSI:\n    return r + (g * 2) + (b * 4);\n    \/\/ ! ANSI:\n    \/\/ return (r * 4) + (g * 2) + b;\n  }\n\n  int\n  TerminalDisplayUnix::GetClosestColorIdx256(const Color& C) {\n    static unsigned char rgb256[256][3] = {{0}};\n    if (rgb256[0][0] == 0) {\n      InitRGB256(rgb256);\n    }\n    \n    \/\/ Find the closest index.\n    \/\/ A: the closest color match (square of geometric distance in RGB)\n    \/\/ B: the closest brightness match\n    \/\/ Treat them equally, which suppresses differences\n    \/\/ in color due to squared distance.\n    \n    \/\/ start with black:\n    int idx = 0;\n    unsigned int r = C.fR;\n    unsigned int g = C.fG;\n    unsigned int b = C.fB;\n    unsigned int graylvl = (r + g + b)\/3;\n    long mindelta = (r*r + g*g + b*b) + graylvl;\n    if (mindelta) {\n      for (unsigned int i = 0; i < 256; ++i) {\n        long delta = (rgb256[i][0] + rgb256[i][1] + rgb256[i][2])\/3 - graylvl;\n        if (delta < 0) delta = -delta;\n        delta += (r-rgb256[i][0])*(r-rgb256[i][0]) +\n        (g-rgb256[i][1])*(g-rgb256[i][1]) +\n        (b-rgb256[i][2])*(b-rgb256[i][2]);\n        \n        if (delta < mindelta) {\n          mindelta = delta;\n          idx = i;\n          if (mindelta == 0) break;\n        }\n      }\n    }\n    return idx;\n  }\n        \n}\n\n#endif \/\/ #ifndef WIN32\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\/nacl\/nacl_listener.h\"\n\n#include <errno.h>\n#include <stdlib.h>\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/message_loop.h\"\n#include \"chrome\/common\/nacl_messages.h\"\n#include \"chrome\/nacl\/nacl_validation_db.h\"\n#include \"chrome\/nacl\/nacl_validation_query.h\"\n#include \"ipc\/ipc_sync_channel.h\"\n#include \"ipc\/ipc_sync_message_filter.h\"\n#include \"ipc\/ipc_switches.h\"\n#include \"native_client\/src\/trusted\/service_runtime\/sel_main_chrome.h\"\n\n#if defined(OS_LINUX)\n#include \"content\/public\/common\/child_process_sandbox_support_linux.h\"\n#endif\n\n#if defined(OS_WIN)\n#include <fcntl.h>\n#include <io.h>\n\n#include \"content\/public\/common\/sandbox_init.h\"\n#endif\n\nnamespace {\n#if defined(OS_MACOSX)\n\n\/\/ On Mac OS X, shm_open() works in the sandbox but does not give us\n\/\/ an FD that we can map as PROT_EXEC.  Rather than doing an IPC to\n\/\/ get an executable SHM region when CreateMemoryObject() is called,\n\/\/ we preallocate one on startup, since NaCl's sel_ldr only needs one\n\/\/ of them.  This saves a round trip.\n\nbase::subtle::Atomic32 g_shm_fd = -1;\n\nint CreateMemoryObject(size_t size, int executable) {\n  if (executable && size > 0) {\n    int result_fd = base::subtle::NoBarrier_AtomicExchange(&g_shm_fd, -1);\n    if (result_fd != -1) {\n      \/\/ ftruncate() is disallowed by the Mac OS X sandbox and\n      \/\/ returns EPERM.  Luckily, we can get the same effect with\n      \/\/ lseek() + write().\n      if (lseek(result_fd, size - 1, SEEK_SET) == -1) {\n        LOG(ERROR) << \"lseek() failed: \" << errno;\n        return -1;\n      }\n      if (write(result_fd, \"\", 1) != 1) {\n        LOG(ERROR) << \"write() failed: \" << errno;\n        return -1;\n      }\n      return result_fd;\n    }\n  }\n  \/\/ Fall back to NaCl's default implementation.\n  return -1;\n}\n\n#elif defined(OS_LINUX)\n\nint CreateMemoryObject(size_t size, int executable) {\n  return content::MakeSharedMemorySegmentViaIPC(size, executable);\n}\n\n#elif defined(OS_WIN)\n\n\/\/ We wrap the function to convert the bool return value to an int.\nint BrokerDuplicateHandle(NaClHandle source_handle,\n                          uint32_t process_id,\n                          NaClHandle* target_handle,\n                          uint32_t desired_access,\n                          uint32_t options) {\n  return content::BrokerDuplicateHandle(source_handle, process_id,\n                                        target_handle, desired_access,\n                                        options);\n}\n\n#endif\n\n\/\/ Use an env var because command line args are eaten by nacl_helper.\nbool CheckEnvVar(const char* name, bool default_value) {\n  bool result = default_value;\n  const char* var = getenv(name);\n  if (var && strlen(var) > 0) {\n    result = var[0] != '0';\n  }\n  return result;\n}\n\n}  \/\/ namespace\n\nclass BrowserValidationDBProxy : public NaClValidationDB {\n public:\n  explicit BrowserValidationDBProxy(NaClListener* listener)\n      : listener_(listener) {\n  }\n\n  bool QueryKnownToValidate(const std::string& signature) {\n    \/\/ Initialize to false so that if the Send fails to write to the return\n    \/\/ value we're safe.  For example if the message is (for some reason)\n    \/\/ dispatched as an async message the return parameter will not be written.\n    bool result = false;\n    if (!listener_->Send(new NaClProcessMsg_QueryKnownToValidate(signature,\n                                                                 &result))) {\n      LOG(ERROR) << \"Failed to query NaCl validation cache.\";\n      result = false;\n    }\n    return result;\n  }\n\n  void SetKnownToValidate(const std::string& signature) {\n    \/\/ Caching is optional: NaCl will still work correctly if the IPC fails.\n    if (!listener_->Send(new NaClProcessMsg_SetKnownToValidate(signature))) {\n      LOG(ERROR) << \"Failed to update NaCl validation cache.\";\n    }\n  }\n\n private:\n  \/\/ The listener never dies, otherwise this might be a dangling reference.\n  NaClListener* listener_;\n};\n\n\nNaClListener::NaClListener() : shutdown_event_(true, false),\n                               io_thread_(\"NaCl_IOThread\"),\n                               main_loop_(NULL),\n                               debug_enabled_(false) {\n  io_thread_.StartWithOptions(base::Thread::Options(MessageLoop::TYPE_IO, 0));\n}\n\nNaClListener::~NaClListener() {\n  NOTREACHED();\n  shutdown_event_.Signal();\n}\n\nbool NaClListener::Send(IPC::Message* msg) {\n  DCHECK(main_loop_ != NULL);\n  if (MessageLoop::current() == main_loop_) {\n    \/\/ This thread owns the channel.\n    return channel_->Send(msg);\n  } else {\n    \/\/ This thread does not own the channel.\n    return filter_->Send(msg);\n  }\n}\n\nvoid NaClListener::Listen() {\n  std::string channel_name =\n      CommandLine::ForCurrentProcess()->GetSwitchValueASCII(\n          switches::kProcessChannelID);\n  channel_.reset(new IPC::SyncChannel(this, io_thread_.message_loop_proxy(),\n                                      &shutdown_event_));\n  filter_ = new IPC::SyncMessageFilter(&shutdown_event_);\n  channel_->AddFilter(filter_.get());\n  channel_->Init(channel_name, IPC::Channel::MODE_CLIENT, true);\n  main_loop_ = MessageLoop::current();\n  main_loop_->Run();\n}\n\nbool NaClListener::OnMessageReceived(const IPC::Message& msg) {\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(NaClListener, msg)\n      IPC_MESSAGE_HANDLER(NaClProcessMsg_Start, OnMsgStart)\n      IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nvoid NaClListener::OnMsgStart(const nacl::NaClStartParams& params) {\n  struct NaClChromeMainArgs *args = NaClChromeMainArgsCreate();\n  if (args == NULL) {\n    LOG(ERROR) << \"NaClChromeMainArgsCreate() failed\";\n    return;\n  }\n\n  std::vector<nacl::FileDescriptor> handles = params.handles;\n\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n  args->create_memory_object_func = CreateMemoryObject;\n# if defined(OS_MACOSX)\n  CHECK(handles.size() >= 1);\n  g_shm_fd = nacl::ToNativeHandle(handles[handles.size() - 1]);\n  handles.pop_back();\n# endif\n#endif\n\n  CHECK(handles.size() >= 1);\n  NaClHandle irt_handle = nacl::ToNativeHandle(handles[handles.size() - 1]);\n  handles.pop_back();\n\n#if defined(OS_WIN)\n  args->irt_fd = _open_osfhandle(reinterpret_cast<intptr_t>(irt_handle),\n                                 _O_RDONLY | _O_BINARY);\n  if (args->irt_fd < 0) {\n    LOG(ERROR) << \"_open_osfhandle() failed\";\n    return;\n  }\n#else\n  args->irt_fd = irt_handle;\n#endif\n\n  if (CheckEnvVar(\"NACL_VALIDATION_CACHE\", true)) {\n    \/\/ The cache structure is not freed and exists until the NaCl process exits.\n    args->validation_cache = CreateValidationCache(\n        new BrowserValidationDBProxy(this), params.validation_cache_key,\n        params.version);\n  }\n\n  CHECK(handles.size() == 1);\n  args->imc_bootstrap_handle = nacl::ToNativeHandle(handles[0]);\n  args->enable_exception_handling = params.enable_exception_handling;\n  args->enable_debug_stub = debug_enabled_;\n#if defined(OS_WIN)\n  args->broker_duplicate_handle_func = BrokerDuplicateHandle;\n#endif\n  NaClChromeMainStart(args);\n  NOTREACHED();\n}\n<commit_msg>Revert 134369 \"Enable NaCl's validation cache.\"<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\/nacl\/nacl_listener.h\"\n\n#include <errno.h>\n#include <stdlib.h>\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/message_loop.h\"\n#include \"chrome\/common\/nacl_messages.h\"\n#include \"chrome\/nacl\/nacl_validation_db.h\"\n#include \"chrome\/nacl\/nacl_validation_query.h\"\n#include \"ipc\/ipc_sync_channel.h\"\n#include \"ipc\/ipc_sync_message_filter.h\"\n#include \"ipc\/ipc_switches.h\"\n#include \"native_client\/src\/trusted\/service_runtime\/sel_main_chrome.h\"\n\n#if defined(OS_LINUX)\n#include \"content\/public\/common\/child_process_sandbox_support_linux.h\"\n#endif\n\n#if defined(OS_WIN)\n#include <fcntl.h>\n#include <io.h>\n\n#include \"content\/public\/common\/sandbox_init.h\"\n#endif\n\nnamespace {\n#if defined(OS_MACOSX)\n\n\/\/ On Mac OS X, shm_open() works in the sandbox but does not give us\n\/\/ an FD that we can map as PROT_EXEC.  Rather than doing an IPC to\n\/\/ get an executable SHM region when CreateMemoryObject() is called,\n\/\/ we preallocate one on startup, since NaCl's sel_ldr only needs one\n\/\/ of them.  This saves a round trip.\n\nbase::subtle::Atomic32 g_shm_fd = -1;\n\nint CreateMemoryObject(size_t size, int executable) {\n  if (executable && size > 0) {\n    int result_fd = base::subtle::NoBarrier_AtomicExchange(&g_shm_fd, -1);\n    if (result_fd != -1) {\n      \/\/ ftruncate() is disallowed by the Mac OS X sandbox and\n      \/\/ returns EPERM.  Luckily, we can get the same effect with\n      \/\/ lseek() + write().\n      if (lseek(result_fd, size - 1, SEEK_SET) == -1) {\n        LOG(ERROR) << \"lseek() failed: \" << errno;\n        return -1;\n      }\n      if (write(result_fd, \"\", 1) != 1) {\n        LOG(ERROR) << \"write() failed: \" << errno;\n        return -1;\n      }\n      return result_fd;\n    }\n  }\n  \/\/ Fall back to NaCl's default implementation.\n  return -1;\n}\n\n#elif defined(OS_LINUX)\n\nint CreateMemoryObject(size_t size, int executable) {\n  return content::MakeSharedMemorySegmentViaIPC(size, executable);\n}\n\n#elif defined(OS_WIN)\n\n\/\/ We wrap the function to convert the bool return value to an int.\nint BrokerDuplicateHandle(NaClHandle source_handle,\n                          uint32_t process_id,\n                          NaClHandle* target_handle,\n                          uint32_t desired_access,\n                          uint32_t options) {\n  return content::BrokerDuplicateHandle(source_handle, process_id,\n                                        target_handle, desired_access,\n                                        options);\n}\n\n#endif\n\n\/\/ Use an env var because command line args are eaten by nacl_helper.\nbool CheckEnvVar(const char* name, bool default_value) {\n  bool result = default_value;\n  const char* var = getenv(name);\n  if (var && strlen(var) > 0) {\n    result = var[0] != '0';\n  }\n  return result;\n}\n\n}  \/\/ namespace\n\nclass BrowserValidationDBProxy : public NaClValidationDB {\n public:\n  explicit BrowserValidationDBProxy(NaClListener* listener)\n      : listener_(listener) {\n  }\n\n  bool QueryKnownToValidate(const std::string& signature) {\n    \/\/ Initialize to false so that if the Send fails to write to the return\n    \/\/ value we're safe.  For example if the message is (for some reason)\n    \/\/ dispatched as an async message the return parameter will not be written.\n    bool result = false;\n    if (!listener_->Send(new NaClProcessMsg_QueryKnownToValidate(signature,\n                                                                 &result))) {\n      LOG(ERROR) << \"Failed to query NaCl validation cache.\";\n      result = false;\n    }\n    return result;\n  }\n\n  void SetKnownToValidate(const std::string& signature) {\n    \/\/ Caching is optional: NaCl will still work correctly if the IPC fails.\n    if (!listener_->Send(new NaClProcessMsg_SetKnownToValidate(signature))) {\n      LOG(ERROR) << \"Failed to update NaCl validation cache.\";\n    }\n  }\n\n private:\n  \/\/ The listener never dies, otherwise this might be a dangling reference.\n  NaClListener* listener_;\n};\n\n\nNaClListener::NaClListener() : shutdown_event_(true, false),\n                               io_thread_(\"NaCl_IOThread\"),\n                               main_loop_(NULL),\n                               debug_enabled_(false) {\n  io_thread_.StartWithOptions(base::Thread::Options(MessageLoop::TYPE_IO, 0));\n}\n\nNaClListener::~NaClListener() {\n  NOTREACHED();\n  shutdown_event_.Signal();\n}\n\nbool NaClListener::Send(IPC::Message* msg) {\n  DCHECK(main_loop_ != NULL);\n  if (MessageLoop::current() == main_loop_) {\n    \/\/ This thread owns the channel.\n    return channel_->Send(msg);\n  } else {\n    \/\/ This thread does not own the channel.\n    return filter_->Send(msg);\n  }\n}\n\nvoid NaClListener::Listen() {\n  std::string channel_name =\n      CommandLine::ForCurrentProcess()->GetSwitchValueASCII(\n          switches::kProcessChannelID);\n  channel_.reset(new IPC::SyncChannel(this, io_thread_.message_loop_proxy(),\n                                      &shutdown_event_));\n  filter_ = new IPC::SyncMessageFilter(&shutdown_event_);\n  channel_->AddFilter(filter_.get());\n  channel_->Init(channel_name, IPC::Channel::MODE_CLIENT, true);\n  main_loop_ = MessageLoop::current();\n  main_loop_->Run();\n}\n\nbool NaClListener::OnMessageReceived(const IPC::Message& msg) {\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(NaClListener, msg)\n      IPC_MESSAGE_HANDLER(NaClProcessMsg_Start, OnMsgStart)\n      IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nvoid NaClListener::OnMsgStart(const nacl::NaClStartParams& params) {\n  struct NaClChromeMainArgs *args = NaClChromeMainArgsCreate();\n  if (args == NULL) {\n    LOG(ERROR) << \"NaClChromeMainArgsCreate() failed\";\n    return;\n  }\n\n  std::vector<nacl::FileDescriptor> handles = params.handles;\n\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n  args->create_memory_object_func = CreateMemoryObject;\n# if defined(OS_MACOSX)\n  CHECK(handles.size() >= 1);\n  g_shm_fd = nacl::ToNativeHandle(handles[handles.size() - 1]);\n  handles.pop_back();\n# endif\n#endif\n\n  CHECK(handles.size() >= 1);\n  NaClHandle irt_handle = nacl::ToNativeHandle(handles[handles.size() - 1]);\n  handles.pop_back();\n\n#if defined(OS_WIN)\n  args->irt_fd = _open_osfhandle(reinterpret_cast<intptr_t>(irt_handle),\n                                 _O_RDONLY | _O_BINARY);\n  if (args->irt_fd < 0) {\n    LOG(ERROR) << \"_open_osfhandle() failed\";\n    return;\n  }\n#else\n  args->irt_fd = irt_handle;\n#endif\n\n  if (CheckEnvVar(\"NACL_VALIDATION_CACHE\", false)) {\n    LOG(INFO) << \"NaCl validation cache enabled.\";\n    \/\/ The cache structure is not freed and exists until the NaCl process exits.\n    args->validation_cache = CreateValidationCache(\n        new BrowserValidationDBProxy(this), params.validation_cache_key,\n        params.version);\n  }\n\n  CHECK(handles.size() == 1);\n  args->imc_bootstrap_handle = nacl::ToNativeHandle(handles[0]);\n  args->enable_exception_handling = params.enable_exception_handling;\n  args->enable_debug_stub = debug_enabled_;\n#if defined(OS_WIN)\n  args->broker_duplicate_handle_func = BrokerDuplicateHandle;\n#endif\n  NaClChromeMainStart(args);\n  NOTREACHED();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2004, 2005, 2008 Nikolas Zimmermann <zimmermann@kde.org>\n * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@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#include \"config.h\"\n\n#include \"core\/svg\/SVGTests.h\"\n\n#include \"SVGNames.h\"\n#include \"core\/dom\/Attribute.h\"\n#include \"core\/dom\/DOMImplementation.h\"\n#include \"core\/platform\/Language.h\"\n#include \"core\/svg\/SVGElement.h\"\n#include \"core\/svg\/SVGStringList.h\"\n\nnamespace WebCore {\n\n\/\/ Define custom non-animated property 'requiredFeatures'.\nconst SVGPropertyInfo* SVGTests::requiredFeaturesPropertyInfo()\n{\n    static const SVGPropertyInfo* s_propertyInfo = 0;\n    if (!s_propertyInfo) {\n        s_propertyInfo = new SVGPropertyInfo(AnimatedUnknown,\n                                             PropertyIsReadWrite,\n                                             SVGNames::requiredFeaturesAttr,\n                                             SVGNames::requiredFeaturesAttr.localName(),\n                                             &SVGElement::synchronizeRequiredFeatures,\n                                             0);\n    }\n    return s_propertyInfo;\n}\n\n\/\/ Define custom non-animated property 'requiredExtensions'.\nconst SVGPropertyInfo* SVGTests::requiredExtensionsPropertyInfo()\n{\n    static const SVGPropertyInfo* s_propertyInfo = 0;\n    if (!s_propertyInfo) {\n        s_propertyInfo = new SVGPropertyInfo(AnimatedUnknown,\n                                             PropertyIsReadWrite,\n                                             SVGNames::requiredExtensionsAttr,\n                                             SVGNames::requiredExtensionsAttr.localName(),\n                                             &SVGElement::synchronizeRequiredExtensions,\n                                             0);\n    }\n    return s_propertyInfo;\n}\n\n\/\/ Define custom non-animated property 'systemLanguage'.\nconst SVGPropertyInfo* SVGTests::systemLanguagePropertyInfo()\n{\n    static const SVGPropertyInfo* s_propertyInfo = 0;\n    if (!s_propertyInfo) {\n        s_propertyInfo = new SVGPropertyInfo(AnimatedUnknown,\n                                             PropertyIsReadWrite,\n                                             SVGNames::systemLanguageAttr,\n                                             SVGNames::systemLanguageAttr.localName(),\n                                             &SVGElement::synchronizeSystemLanguage,\n                                             0);\n    }\n    return s_propertyInfo;\n}\n\nSVGTests::SVGTests()\n    : m_requiredFeatures(SVGNames::requiredFeaturesAttr)\n    , m_requiredExtensions(SVGNames::requiredExtensionsAttr)\n    , m_systemLanguage(SVGNames::systemLanguageAttr)\n{\n}\n\nSVGAttributeToPropertyMap& SVGTests::attributeToPropertyMap()\n{\n    DEFINE_STATIC_LOCAL(SVGAttributeToPropertyMap, map, ());\n    if (!map.isEmpty())\n        return map;\n    map.addProperty(requiredFeaturesPropertyInfo());\n    map.addProperty(requiredExtensionsPropertyInfo());\n    map.addProperty(systemLanguagePropertyInfo());\n    return map;\n}\n\nbool SVGTests::hasExtension(const String&) const\n{\n    \/\/ FIXME: Implement me!\n    return false;\n}\n\nbool SVGTests::isValid() const\n{\n    unsigned featuresSize = m_requiredFeatures.value.size();\n    for (unsigned i = 0; i < featuresSize; ++i) {\n        String value = m_requiredFeatures.value.at(i);\n        if (value.isEmpty() || !DOMImplementation::hasFeature(value, String()))\n            return false;\n    }\n\n    unsigned systemLanguageSize = m_systemLanguage.value.size();\n    for (unsigned i = 0; i < systemLanguageSize; ++i) {\n        String value = m_systemLanguage.value.at(i);\n        if (value != defaultLanguage().substring(0, 2))\n            return false;\n    }\n\n    if (!m_requiredExtensions.value.isEmpty())\n        return false;\n\n    return true;\n}\n\nbool SVGTests::parseAttribute(const QualifiedName& name, const AtomicString& value)\n{\n    if (name == SVGNames::requiredFeaturesAttr) {\n        m_requiredFeatures.value.reset(value);\n        return true;\n    }\n    if (name == SVGNames::requiredExtensionsAttr) {\n        m_requiredExtensions.value.reset(value);\n        return true;\n    }\n    if (name == SVGNames::systemLanguageAttr) {\n        m_systemLanguage.value.reset(value);\n        return true;\n    }\n    \n    return false;\n}\n\nbool SVGTests::isKnownAttribute(const QualifiedName& attrName)\n{\n    return attrName == SVGNames::requiredFeaturesAttr\n        || attrName == SVGNames::requiredExtensionsAttr\n        || attrName == SVGNames::systemLanguageAttr;\n}\n\nbool SVGTests::handleAttributeChange(SVGElement* targetElement, const QualifiedName& attrName)\n{\n    ASSERT(targetElement);\n    if (!isKnownAttribute(attrName))\n        return false;\n    if (!targetElement->inDocument())\n        return true;\n\n    bool valid = targetElement->isValid();\n    bool attached = targetElement->attached();\n    if (valid && !attached && targetElement->parentNode()->attached())\n        targetElement->attach();\n    else if (!valid && attached)\n        targetElement->detach();\n\n    return true;\n}\n\nvoid SVGTests::addSupportedAttributes(HashSet<QualifiedName>& supportedAttributes)\n{\n    supportedAttributes.add(SVGNames::requiredFeaturesAttr);\n    supportedAttributes.add(SVGNames::requiredExtensionsAttr);\n    supportedAttributes.add(SVGNames::systemLanguageAttr);\n}\n\nvoid SVGTests::synchronizeRequiredFeatures(SVGElement* contextElement)\n{\n    ASSERT(contextElement);\n    if (!m_requiredFeatures.shouldSynchronize)\n        return;\n    AtomicString value(m_requiredFeatures.value.valueAsString());\n    m_requiredFeatures.synchronize(contextElement, requiredFeaturesPropertyInfo()->attributeName, value);\n}\n\nvoid SVGTests::synchronizeRequiredExtensions(SVGElement* contextElement)\n{\n    ASSERT(contextElement);\n    if (!m_requiredExtensions.shouldSynchronize)\n        return;\n    AtomicString value(m_requiredExtensions.value.valueAsString());\n    m_requiredExtensions.synchronize(contextElement, requiredExtensionsPropertyInfo()->attributeName, value);\n}\n\nvoid SVGTests::synchronizeSystemLanguage(SVGElement* contextElement)\n{\n    ASSERT(contextElement);\n    if (!m_systemLanguage.shouldSynchronize)\n        return;\n    AtomicString value(m_systemLanguage.value.valueAsString());\n    m_systemLanguage.synchronize(contextElement, systemLanguagePropertyInfo()->attributeName, value);\n}\n\nSVGStringList& SVGTests::requiredFeatures()\n{\n    m_requiredFeatures.shouldSynchronize = true;\n    return m_requiredFeatures.value;\n}\n\nSVGStringList& SVGTests::requiredExtensions()\n{\n    m_requiredExtensions.shouldSynchronize = true;    \n    return m_requiredExtensions.value;\n}\n\nSVGStringList& SVGTests::systemLanguage()\n{\n    m_systemLanguage.shouldSynchronize = true;\n    return m_systemLanguage.value;\n}\n\n}\n<commit_msg>SVGTests should lazyAttach<commit_after>\/*\n * Copyright (C) 2004, 2005, 2008 Nikolas Zimmermann <zimmermann@kde.org>\n * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@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#include \"config.h\"\n\n#include \"core\/svg\/SVGTests.h\"\n\n#include \"SVGNames.h\"\n#include \"core\/dom\/Attribute.h\"\n#include \"core\/dom\/DOMImplementation.h\"\n#include \"core\/platform\/Language.h\"\n#include \"core\/svg\/SVGElement.h\"\n#include \"core\/svg\/SVGStringList.h\"\n\nnamespace WebCore {\n\n\/\/ Define custom non-animated property 'requiredFeatures'.\nconst SVGPropertyInfo* SVGTests::requiredFeaturesPropertyInfo()\n{\n    static const SVGPropertyInfo* s_propertyInfo = 0;\n    if (!s_propertyInfo) {\n        s_propertyInfo = new SVGPropertyInfo(AnimatedUnknown,\n                                             PropertyIsReadWrite,\n                                             SVGNames::requiredFeaturesAttr,\n                                             SVGNames::requiredFeaturesAttr.localName(),\n                                             &SVGElement::synchronizeRequiredFeatures,\n                                             0);\n    }\n    return s_propertyInfo;\n}\n\n\/\/ Define custom non-animated property 'requiredExtensions'.\nconst SVGPropertyInfo* SVGTests::requiredExtensionsPropertyInfo()\n{\n    static const SVGPropertyInfo* s_propertyInfo = 0;\n    if (!s_propertyInfo) {\n        s_propertyInfo = new SVGPropertyInfo(AnimatedUnknown,\n                                             PropertyIsReadWrite,\n                                             SVGNames::requiredExtensionsAttr,\n                                             SVGNames::requiredExtensionsAttr.localName(),\n                                             &SVGElement::synchronizeRequiredExtensions,\n                                             0);\n    }\n    return s_propertyInfo;\n}\n\n\/\/ Define custom non-animated property 'systemLanguage'.\nconst SVGPropertyInfo* SVGTests::systemLanguagePropertyInfo()\n{\n    static const SVGPropertyInfo* s_propertyInfo = 0;\n    if (!s_propertyInfo) {\n        s_propertyInfo = new SVGPropertyInfo(AnimatedUnknown,\n                                             PropertyIsReadWrite,\n                                             SVGNames::systemLanguageAttr,\n                                             SVGNames::systemLanguageAttr.localName(),\n                                             &SVGElement::synchronizeSystemLanguage,\n                                             0);\n    }\n    return s_propertyInfo;\n}\n\nSVGTests::SVGTests()\n    : m_requiredFeatures(SVGNames::requiredFeaturesAttr)\n    , m_requiredExtensions(SVGNames::requiredExtensionsAttr)\n    , m_systemLanguage(SVGNames::systemLanguageAttr)\n{\n}\n\nSVGAttributeToPropertyMap& SVGTests::attributeToPropertyMap()\n{\n    DEFINE_STATIC_LOCAL(SVGAttributeToPropertyMap, map, ());\n    if (!map.isEmpty())\n        return map;\n    map.addProperty(requiredFeaturesPropertyInfo());\n    map.addProperty(requiredExtensionsPropertyInfo());\n    map.addProperty(systemLanguagePropertyInfo());\n    return map;\n}\n\nbool SVGTests::hasExtension(const String&) const\n{\n    \/\/ FIXME: Implement me!\n    return false;\n}\n\nbool SVGTests::isValid() const\n{\n    unsigned featuresSize = m_requiredFeatures.value.size();\n    for (unsigned i = 0; i < featuresSize; ++i) {\n        String value = m_requiredFeatures.value.at(i);\n        if (value.isEmpty() || !DOMImplementation::hasFeature(value, String()))\n            return false;\n    }\n\n    unsigned systemLanguageSize = m_systemLanguage.value.size();\n    for (unsigned i = 0; i < systemLanguageSize; ++i) {\n        String value = m_systemLanguage.value.at(i);\n        if (value != defaultLanguage().substring(0, 2))\n            return false;\n    }\n\n    if (!m_requiredExtensions.value.isEmpty())\n        return false;\n\n    return true;\n}\n\nbool SVGTests::parseAttribute(const QualifiedName& name, const AtomicString& value)\n{\n    if (name == SVGNames::requiredFeaturesAttr) {\n        m_requiredFeatures.value.reset(value);\n        return true;\n    }\n    if (name == SVGNames::requiredExtensionsAttr) {\n        m_requiredExtensions.value.reset(value);\n        return true;\n    }\n    if (name == SVGNames::systemLanguageAttr) {\n        m_systemLanguage.value.reset(value);\n        return true;\n    }\n    \n    return false;\n}\n\nbool SVGTests::isKnownAttribute(const QualifiedName& attrName)\n{\n    return attrName == SVGNames::requiredFeaturesAttr\n        || attrName == SVGNames::requiredExtensionsAttr\n        || attrName == SVGNames::systemLanguageAttr;\n}\n\nbool SVGTests::handleAttributeChange(SVGElement* targetElement, const QualifiedName& attrName)\n{\n    ASSERT(targetElement);\n    if (!isKnownAttribute(attrName))\n        return false;\n    if (!targetElement->inDocument())\n        return true;\n\n    bool valid = targetElement->isValid();\n    if (valid && !targetElement->attached())\n        targetElement->lazyAttach();\n    else if (!valid && targetElement->attached())\n        targetElement->detach();\n\n    return true;\n}\n\nvoid SVGTests::addSupportedAttributes(HashSet<QualifiedName>& supportedAttributes)\n{\n    supportedAttributes.add(SVGNames::requiredFeaturesAttr);\n    supportedAttributes.add(SVGNames::requiredExtensionsAttr);\n    supportedAttributes.add(SVGNames::systemLanguageAttr);\n}\n\nvoid SVGTests::synchronizeRequiredFeatures(SVGElement* contextElement)\n{\n    ASSERT(contextElement);\n    if (!m_requiredFeatures.shouldSynchronize)\n        return;\n    AtomicString value(m_requiredFeatures.value.valueAsString());\n    m_requiredFeatures.synchronize(contextElement, requiredFeaturesPropertyInfo()->attributeName, value);\n}\n\nvoid SVGTests::synchronizeRequiredExtensions(SVGElement* contextElement)\n{\n    ASSERT(contextElement);\n    if (!m_requiredExtensions.shouldSynchronize)\n        return;\n    AtomicString value(m_requiredExtensions.value.valueAsString());\n    m_requiredExtensions.synchronize(contextElement, requiredExtensionsPropertyInfo()->attributeName, value);\n}\n\nvoid SVGTests::synchronizeSystemLanguage(SVGElement* contextElement)\n{\n    ASSERT(contextElement);\n    if (!m_systemLanguage.shouldSynchronize)\n        return;\n    AtomicString value(m_systemLanguage.value.valueAsString());\n    m_systemLanguage.synchronize(contextElement, systemLanguagePropertyInfo()->attributeName, value);\n}\n\nSVGStringList& SVGTests::requiredFeatures()\n{\n    m_requiredFeatures.shouldSynchronize = true;\n    return m_requiredFeatures.value;\n}\n\nSVGStringList& SVGTests::requiredExtensions()\n{\n    m_requiredExtensions.shouldSynchronize = true;    \n    return m_requiredExtensions.value;\n}\n\nSVGStringList& SVGTests::systemLanguage()\n{\n    m_systemLanguage.shouldSynchronize = true;\n    return m_systemLanguage.value;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015, Vsevolod Stakhov\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 *\t * Redistributions of source code must retain the above copyright\n *\t   notice, this list of conditions and the following disclaimer.\n *\t * Redistributions in binary form must reproduce the above copyright\n *\t   notice, this list of conditions and the following disclaimer in the\n *\t   documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY AUTHOR ''AS IS'' AND ANY\n * 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 AUTHOR 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#include \"printf_check.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include <unordered_map>\n#include <vector>\n#include <sstream>\n#include <ctype.h>\n\nusing namespace clang;\n\nnamespace rspamd {\n\tstruct PrintfArgChecker;\n\n\tstatic bool cstring_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\tstatic bool int_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\n\tusing arg_parser_t = bool (*) (const Expr *, struct PrintfArgChecker *);\n\n\tstatic void\n\tprint_error (const std::string &err, const Expr *e, const ASTContext *ast)\n\t{\n\t\tauto const &sm = ast->getSourceManager ();\n\t\tauto loc = e->getExprLoc ();\n\t\tllvm::errs() << err << \" at \" << loc.printToString (sm) << \"\\n\";\n\t}\n\n\tstruct PrintfArgChecker {\n\tprivate:\n\t\targ_parser_t parser;\n\tpublic:\n\t\tint width;\n\t\tint precision;\n\t\tASTContext *past;\n\n\t\tPrintfArgChecker (arg_parser_t _p, ASTContext *_ast) :\n\t\t\t\tparser(_p), past(_ast) {}\n\t\tvirtual ~PrintfArgChecker () {}\n\n\t\tbool operator () (const Expr *e)\n\t\t{\n\t\t\treturn parser (e, this);\n\t\t}\n\t};\n\n\tclass PrintfCheckVisitor::impl {\n\t\tstd::unordered_map<std::string, int> printf_functions;\n\t\tASTContext *pcontext;\n\n\t\tstd::unique_ptr<PrintfArgChecker> parseFlags (const std::string &flags)\n\t\t{\n\t\t\tauto type = flags.back();\n\n\t\t\tswitch (type) {\n\t\t\tcase 's':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker>(cstring_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tcase 'd':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker>(int_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tdefault:\n\t\t\t\tllvm::errs () << \"unknown parser flag: \" << type << \"\\n\";\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tstd::shared_ptr<std::vector<PrintfArgChecker> >\n\t\tgenParsers (const StringRef query)\n\t\t{\n\t\t\tenum {\n\t\t\t\tignore_chars = 0,\n\t\t\t\tread_percent,\n\t\t\t\tread_width,\n\t\t\t\tread_precision,\n\t\t\t\tread_arg\n\t\t\t} state = ignore_chars;\n\t\t\tint width, precision;\n\t\t\tstd::string flags;\n\n\t\t\tauto res = std::make_shared<std::vector<PrintfArgChecker> >();\n\n\t\t\tfor (const auto c : query) {\n\t\t\t\tswitch (state) {\n\t\t\t\tcase ignore_chars:\n\t\t\t\t\tif (c == '%') {\n\t\t\t\t\t\tstate = read_percent;\n\t\t\t\t\t\tflags.clear ();\n\t\t\t\t\t\twidth = precision = 0;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase read_percent:\n\t\t\t\t\tif (isdigit (c)) {\n\t\t\t\t\t\tstate = read_width;\n\t\t\t\t\t\twidth = c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '.') {\n\t\t\t\t\t\tstate = read_precision;\n\t\t\t\t\t\tprecision = c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '*') {\n\t\t\t\t\t\t\/* %*s - need integer argument *\/\n\t\t\t\t\t\tres->emplace_back (int_arg_handler, this->pcontext);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '%') {\n\t\t\t\t\t\t\/* Percent character, ignore *\/\n\t\t\t\t\t\tstate = ignore_chars;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflags.push_back (c);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase read_width:\n\t\t\t\t\tif (isdigit (c)) {\n\t\t\t\t\t\twidth *= 10;\n\t\t\t\t\t\twidth += c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '.') {\n\t\t\t\t\t\tstate = read_precision;\n\t\t\t\t\t\tprecision = c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflags.push_back (c);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase read_precision:\n\t\t\t\t\tif (isdigit (c)) {\n\t\t\t\t\t\tprecision *= 10;\n\t\t\t\t\t\tprecision += c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '*') {\n\t\t\t\t\t\tres->emplace_back (int_arg_handler, this->pcontext);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflags.push_back (c);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase read_arg:\n\t\t\t\t\tif (!isalpha (c)) {\n\t\t\t\t\t\tauto handler = parseFlags (flags);\n\n\t\t\t\t\t\tif (handler) {\n\t\t\t\t\t\t\tauto handler_copy = *handler;\n\t\t\t\t\t\t\thandler_copy.precision = precision;\n\t\t\t\t\t\t\thandler_copy.width = width;\n\t\t\t\t\t\t\tres->emplace_back (std::move (handler_copy));\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tllvm::errs () << \"invalid modifier\\n\";\n\t\t\t\t\t\t\treturn nullptr;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstate = ignore_chars;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflags.push_back (c);\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\tif (state == read_arg) {\n\t\t\t\tauto handler = parseFlags (flags);\n\n\t\t\t\tif (handler) {\n\t\t\t\t\tauto handler_copy = *handler;\n\t\t\t\t\thandler_copy.precision = precision;\n\t\t\t\t\thandler_copy.width = width;\n\t\t\t\t\tres->emplace_back (std::move (handler_copy));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tllvm::errs () << \"invalid modifier\\n\";\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn res;\n\t\t}\n\tpublic:\n\t\timpl (ASTContext *_ctx) : pcontext(_ctx)\n\t\t{\n\t\t\t\/* name -> format string position *\/\n\t\t\tprintf_functions = {\n\t\t\t\t\t{\"rspamd_printf\",               0},\n\t\t\t\t\t{\"rspamd_default_log_function\", 4},\n\t\t\t\t\t{\"rspamd_snprintf\",             2},\n\t\t\t\t\t{\"rspamd_fprintf\",              1}\n\t\t\t};\n\t\t};\n\n\t\tbool VisitCallExpr (CallExpr *E)\n\t\t{\n\t\t\tauto callee = dyn_cast<NamedDecl> (E->getCalleeDecl ());\n\t\t\tif (callee == NULL) {\n\t\t\t\tllvm::errs () << \"Bad callee\\n\";\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tauto fname = callee->getNameAsString ();\n\n\t\t\tauto pos_it = printf_functions.find (fname);\n\n\t\t\tif (pos_it != printf_functions.end ()) {\n\t\t\t\tconst auto args = E->getArgs ();\n\t\t\t\tauto pos = pos_it->second;\n\t\t\t\tauto query = args[pos];\n\n\t\t\t\tif (!query->isEvaluatable (*pcontext)) {\n\t\t\t\t\tllvm::errs () << \"Cannot evaluate query\\n\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tclang::Expr::EvalResult r;\n\n\t\t\t\tif (!query->EvaluateAsRValue (r, *pcontext)) {\n\t\t\t\t\tllvm::errs () << \"Cannot evaluate query\\n\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tauto qval = dyn_cast<StringLiteral> (\n\t\t\t\t\t\tr.Val.getLValueBase ().get<const Expr *> ());\n\t\t\t\tif (!qval) {\n\t\t\t\t\tllvm::errs () << \"Bad or absent query string\\n\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tauto parsers = genParsers (qval->getString ());\n\n\t\t\t\tif (parsers) {\n\t\t\t\t\tif (parsers->size () != E->getNumArgs () - (pos + 1)) {\n\t\t\t\t\t\tstd::ostringstream err_buf;\n\t\t\t\t\t\terr_buf << \"number of arguments for \" << fname\n\t\t\t\t\t\t\t\t<< \" missmatches query string '\" <<\n\t\t\t\t\t\t\t\tqval->getString().str()\n\t\t\t\t\t\t\t\t<< \"', expected \" << parsers->size () << \" args\"\n\t\t\t\t\t\t\t\t<< \", got \" << (E->getNumArgs () - (pos + 1))\n\t\t\t\t\t\t\t\t<< \" args\";\n\t\t\t\t\t\tprint_error (err_buf.str (), E, this->pcontext);\n\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tfor (auto i = pos + 1; i < E->getNumArgs (); i++) {\n\t\t\t\t\t\t\tauto arg = args[i];\n\n\t\t\t\t\t\t\tif (arg) {\n\t\t\t\t\t\t\t\tif (!parsers->at(i - (pos + 1))(arg)) {\n\t\t\t\t\t\t\t\t\treturn false;\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\n\t\t\treturn true;\n\t\t}\n\t};\n\n\tPrintfCheckVisitor::PrintfCheckVisitor (ASTContext *ctx) :\n\t\tpimpl { new impl(ctx) }\n\t{\n\t}\n\n\tPrintfCheckVisitor::~PrintfCheckVisitor ()\n\t{\n\t}\n\n\tbool PrintfCheckVisitor::VisitCallExpr (clang::CallExpr *E)\n\t{\n\t\treturn pimpl->VisitCallExpr (E);\n\t}\n\n\t\/* Type handlers *\/\n\tstatic bool\n\tcstring_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tif (!type->isPointerType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad string argument for %s: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto ptr_type = type->getPointeeType().split().Ty;\n\n\t\tif (!ptr_type->isCharType ()) {\n\t\t\t\/* We might have gchar * here *\/\n\t\t\tauto desugared_type = ptr_type->getUnqualifiedDesugaredType ();\n\n\t\t\tif (!desugared_type || !desugared_type->isCharType ()) {\n\t\t\t\tif (desugared_type) {\n\t\t\t\t\tdesugared_type->dump ();\n\t\t\t\t}\n\t\t\t\tprint_error (\n\t\t\t\t\t\tstd::string (\"bad string argument for %s: \") +\n\t\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tstatic bool\n\tint_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tauto desugared_type = type->getUnqualifiedDesugaredType ();\n\n\t\tif (!desugared_type->isIntegerType ()) {\n\t\t\tprint_error (std::string (\"bad integer argument for %d or * arg: \") +\n\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\t\telse if (!desugared_type->isBuiltinType ()) {\n\t\t\tprint_error (std::string (\"bad integer argument for %d or * arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString(), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto builtin_type = dyn_cast<BuiltinType>(desugared_type);\n\t\tauto kind = builtin_type->getKind ();\n\n\t\tif (kind != BuiltinType::Kind::UInt &&\n\t\t\t\tkind != BuiltinType::Kind::Int) {\n\t\t\tprint_error (std::string (\"bad integer argument for %d or * arg: \") +\n\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n};\n<commit_msg>More primitive types parsers<commit_after>\/*\n * Copyright (c) 2015, Vsevolod Stakhov\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 *\t * Redistributions of source code must retain the above copyright\n *\t   notice, this list of conditions and the following disclaimer.\n *\t * Redistributions in binary form must reproduce the above copyright\n *\t   notice, this list of conditions and the following disclaimer in the\n *\t   documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY AUTHOR ''AS IS'' AND ANY\n * 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 AUTHOR 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#include \"printf_check.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include <unordered_map>\n#include <vector>\n#include <sstream>\n#include <ctype.h>\n\nusing namespace clang;\n\nnamespace rspamd {\n\tstruct PrintfArgChecker;\n\n\tstatic bool cstring_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\tstatic bool int_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\tstatic bool long_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\tstatic bool size_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\tstatic bool char_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\tstatic bool double_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\tstatic bool long_double_arg_handler (const Expr *arg,\n\t\t\tstruct PrintfArgChecker *ctx);\n\n\tusing arg_parser_t = bool (*) (const Expr *, struct PrintfArgChecker *);\n\n\tstatic void\n\tprint_error (const std::string &err, const Expr *e, const ASTContext *ast)\n\t{\n\t\tauto const &sm = ast->getSourceManager ();\n\t\tauto loc = e->getExprLoc ();\n\t\tllvm::errs() << err << \" at \" << loc.printToString (sm) << \"\\n\";\n\t}\n\n\tstruct PrintfArgChecker {\n\tprivate:\n\t\targ_parser_t parser;\n\tpublic:\n\t\tint width;\n\t\tint precision;\n\t\tbool is_unsigned;\n\t\tASTContext *past;\n\n\t\tPrintfArgChecker (arg_parser_t _p, ASTContext *_ast) :\n\t\t\t\tparser(_p), past(_ast)\n\t\t{\n\t\t\twidth = 0;\n\t\t\tprecision = 0;\n\t\t\tis_unsigned = false;\n\t\t}\n\t\tvirtual ~PrintfArgChecker () {}\n\n\t\tbool operator () (const Expr *e)\n\t\t{\n\t\t\treturn parser (e, this);\n\t\t}\n\t};\n\n\tclass PrintfCheckVisitor::impl {\n\t\tstd::unordered_map<std::string, int> printf_functions;\n\t\tASTContext *pcontext;\n\n\t\tstd::unique_ptr<PrintfArgChecker> parseFlags (const std::string &flags)\n\t\t{\n\t\t\tauto type = flags.back();\n\n\t\t\tswitch (type) {\n\t\t\tcase 's':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker>(cstring_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tcase 'd':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker>(int_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tcase 'z':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker> (size_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tcase 'l':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker> (long_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tcase 'f':\n\t\t\tcase 'g':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker> (double_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tcase 'F':\n\t\t\tcase 'G':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker> (long_double_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tcase 'c':\n\t\t\t\treturn llvm::make_unique<PrintfArgChecker> (char_arg_handler,\n\t\t\t\t\t\tthis->pcontext);\n\t\t\tdefault:\n\t\t\t\tllvm::errs () << \"unknown parser flag: \" << type << \"\\n\";\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tstd::shared_ptr<std::vector<PrintfArgChecker> >\n\t\tgenParsers (const StringRef query)\n\t\t{\n\t\t\tenum {\n\t\t\t\tignore_chars = 0,\n\t\t\t\tread_percent,\n\t\t\t\tread_width,\n\t\t\t\tread_precision,\n\t\t\t\tread_arg\n\t\t\t} state = ignore_chars;\n\t\t\tint width, precision;\n\t\t\tstd::string flags;\n\n\t\t\tauto res = std::make_shared<std::vector<PrintfArgChecker> >();\n\n\t\t\tfor (const auto c : query) {\n\t\t\t\tswitch (state) {\n\t\t\t\tcase ignore_chars:\n\t\t\t\t\tif (c == '%') {\n\t\t\t\t\t\tstate = read_percent;\n\t\t\t\t\t\tflags.clear ();\n\t\t\t\t\t\twidth = precision = 0;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase read_percent:\n\t\t\t\t\tif (isdigit (c)) {\n\t\t\t\t\t\tstate = read_width;\n\t\t\t\t\t\twidth = c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '.') {\n\t\t\t\t\t\tstate = read_precision;\n\t\t\t\t\t\tprecision = c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '*') {\n\t\t\t\t\t\t\/* %*s - need integer argument *\/\n\t\t\t\t\t\tres->emplace_back (int_arg_handler, this->pcontext);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '%') {\n\t\t\t\t\t\t\/* Percent character, ignore *\/\n\t\t\t\t\t\tstate = ignore_chars;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflags.push_back (c);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase read_width:\n\t\t\t\t\tif (isdigit (c)) {\n\t\t\t\t\t\twidth *= 10;\n\t\t\t\t\t\twidth += c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '.') {\n\t\t\t\t\t\tstate = read_precision;\n\t\t\t\t\t\tprecision = c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflags.push_back (c);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase read_precision:\n\t\t\t\t\tif (isdigit (c)) {\n\t\t\t\t\t\tprecision *= 10;\n\t\t\t\t\t\tprecision += c - '0';\n\t\t\t\t\t}\n\t\t\t\t\telse if (c == '*') {\n\t\t\t\t\t\tres->emplace_back (int_arg_handler, this->pcontext);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflags.push_back (c);\n\t\t\t\t\t\tstate = read_arg;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase read_arg:\n\t\t\t\t\tif (!isalpha (c)) {\n\t\t\t\t\t\tauto handler = parseFlags (flags);\n\n\t\t\t\t\t\tif (handler) {\n\t\t\t\t\t\t\tauto handler_copy = *handler;\n\t\t\t\t\t\t\thandler_copy.precision = precision;\n\t\t\t\t\t\t\thandler_copy.width = width;\n\t\t\t\t\t\t\tres->emplace_back (std::move (handler_copy));\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tllvm::errs () << \"invalid modifier\\n\";\n\t\t\t\t\t\t\treturn nullptr;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstate = ignore_chars;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflags.push_back (c);\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\tif (state == read_arg) {\n\t\t\t\tauto handler = parseFlags (flags);\n\n\t\t\t\tif (handler) {\n\t\t\t\t\tauto handler_copy = *handler;\n\t\t\t\t\thandler_copy.precision = precision;\n\t\t\t\t\thandler_copy.width = width;\n\t\t\t\t\tres->emplace_back (std::move (handler_copy));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tllvm::errs () << \"invalid modifier\\n\";\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn res;\n\t\t}\n\tpublic:\n\t\timpl (ASTContext *_ctx) : pcontext(_ctx)\n\t\t{\n\t\t\t\/* name -> format string position *\/\n\t\t\tprintf_functions = {\n\t\t\t\t\t{\"rspamd_printf\",               0},\n\t\t\t\t\t{\"rspamd_default_log_function\", 4},\n\t\t\t\t\t{\"rspamd_snprintf\",             2},\n\t\t\t\t\t{\"rspamd_fprintf\",              1}\n\t\t\t};\n\t\t};\n\n\t\tbool VisitCallExpr (CallExpr *E)\n\t\t{\n\t\t\tauto callee = dyn_cast<NamedDecl> (E->getCalleeDecl ());\n\t\t\tif (callee == NULL) {\n\t\t\t\tllvm::errs () << \"Bad callee\\n\";\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tauto fname = callee->getNameAsString ();\n\n\t\t\tauto pos_it = printf_functions.find (fname);\n\n\t\t\tif (pos_it != printf_functions.end ()) {\n\t\t\t\tconst auto args = E->getArgs ();\n\t\t\t\tauto pos = pos_it->second;\n\t\t\t\tauto query = args[pos];\n\n\t\t\t\tif (!query->isEvaluatable (*pcontext)) {\n\t\t\t\t\tllvm::errs () << \"Cannot evaluate query\\n\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tclang::Expr::EvalResult r;\n\n\t\t\t\tif (!query->EvaluateAsRValue (r, *pcontext)) {\n\t\t\t\t\tllvm::errs () << \"Cannot evaluate query\\n\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tauto qval = dyn_cast<StringLiteral> (\n\t\t\t\t\t\tr.Val.getLValueBase ().get<const Expr *> ());\n\t\t\t\tif (!qval) {\n\t\t\t\t\tllvm::errs () << \"Bad or absent query string\\n\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tauto parsers = genParsers (qval->getString ());\n\n\t\t\t\tif (parsers) {\n\t\t\t\t\tif (parsers->size () != E->getNumArgs () - (pos + 1)) {\n\t\t\t\t\t\tstd::ostringstream err_buf;\n\t\t\t\t\t\terr_buf << \"number of arguments for \" << fname\n\t\t\t\t\t\t\t\t<< \" missmatches query string '\" <<\n\t\t\t\t\t\t\t\tqval->getString().str()\n\t\t\t\t\t\t\t\t<< \"', expected \" << parsers->size () << \" args\"\n\t\t\t\t\t\t\t\t<< \", got \" << (E->getNumArgs () - (pos + 1))\n\t\t\t\t\t\t\t\t<< \" args\";\n\t\t\t\t\t\tprint_error (err_buf.str (), E, this->pcontext);\n\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tfor (auto i = pos + 1; i < E->getNumArgs (); i++) {\n\t\t\t\t\t\t\tauto arg = args[i];\n\n\t\t\t\t\t\t\tif (arg) {\n\t\t\t\t\t\t\t\tif (!parsers->at(i - (pos + 1))(arg)) {\n\t\t\t\t\t\t\t\t\treturn false;\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\n\t\t\treturn true;\n\t\t}\n\t};\n\n\tPrintfCheckVisitor::PrintfCheckVisitor (ASTContext *ctx) :\n\t\tpimpl { new impl(ctx) }\n\t{\n\t}\n\n\tPrintfCheckVisitor::~PrintfCheckVisitor ()\n\t{\n\t}\n\n\tbool PrintfCheckVisitor::VisitCallExpr (clang::CallExpr *E)\n\t{\n\t\treturn pimpl->VisitCallExpr (E);\n\t}\n\n\t\/* Type handlers *\/\n\tstatic bool\n\tcstring_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tif (!type->isPointerType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad string argument for %s: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto ptr_type = type->getPointeeType().split().Ty;\n\n\t\tif (!ptr_type->isCharType ()) {\n\t\t\t\/* We might have gchar * here *\/\n\t\t\tauto desugared_type = ptr_type->getUnqualifiedDesugaredType ();\n\n\t\t\tif (!desugared_type || !desugared_type->isCharType ()) {\n\t\t\t\tif (desugared_type) {\n\t\t\t\t\tdesugared_type->dump ();\n\t\t\t\t}\n\t\t\t\tprint_error (\n\t\t\t\t\t\tstd::string (\"bad string argument for %s: \") +\n\t\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tstatic bool\n\tint_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tauto desugared_type = type->getUnqualifiedDesugaredType ();\n\n\t\tif (!desugared_type->isIntegerType ()) {\n\t\t\tprint_error (std::string (\"bad integer argument for %d or * arg: \") +\n\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\t\telse if (!desugared_type->isBuiltinType ()) {\n\t\t\tprint_error (std::string (\"bad integer argument for %d or * arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString(), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto builtin_type = dyn_cast<BuiltinType>(desugared_type);\n\t\tauto kind = builtin_type->getKind ();\n\n\t\tif (kind != BuiltinType::Kind::UInt &&\n\t\t\t\tkind != BuiltinType::Kind::Int) {\n\t\t\tprint_error (std::string (\"bad integer argument for %d or * arg: \") +\n\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tstatic bool\n\tlong_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tauto desugared_type = type->getUnqualifiedDesugaredType ();\n\n\t\tif (!desugared_type->isIntegerType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad integer argument for %l arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\t\telse if (!desugared_type->isBuiltinType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad integer argument for %l arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto builtin_type = dyn_cast<BuiltinType> (desugared_type);\n\t\tauto kind = builtin_type->getKind ();\n\n\t\tif (kind != BuiltinType::Kind::ULong &&\n\t\t\t\tkind != BuiltinType::Kind::Long) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad integer argument for %l arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tstatic bool\n\tchar_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tauto desugared_type = type->getUnqualifiedDesugaredType ();\n\n\t\tif (!desugared_type->isCharType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad char argument for %c arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\t\telse if (!desugared_type->isBuiltinType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad char argument for %c arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto builtin_type = dyn_cast<BuiltinType> (desugared_type);\n\t\tauto kind = builtin_type->getKind ();\n\n\t\tif (kind != BuiltinType::Kind::UChar &&\n\t\t\t\tkind != BuiltinType::Kind::SChar) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad char argument for %c arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tstatic bool\n\tsize_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tauto desugared_type = type->getUnqualifiedDesugaredType ();\n\n\t\tif (!desugared_type->isIntegerType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad integer argument for %z arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\t\telse if (!desugared_type->isBuiltinType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad integer argument for %z arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto builtin_type = dyn_cast<BuiltinType> (desugared_type);\n\t\tauto kind = builtin_type->getKind ();\n\n\t\tif (sizeof (size_t) == sizeof (long)) {\n\t\t\tif (kind != BuiltinType::Kind::ULong &&\n\t\t\t\t\tkind != BuiltinType::Kind::Long) {\n\t\t\t\tprint_error (\n\t\t\t\t\t\tstd::string (\"bad integer argument for %z arg: \") +\n\t\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse if (sizeof (size_t) == sizeof (int)) {\n\t\t\tif (kind != BuiltinType::Kind::UInt &&\n\t\t\t\t\tkind != BuiltinType::Kind::Int) {\n\t\t\t\tprint_error (\n\t\t\t\t\t\tstd::string (\"bad integer argument for %z arg: \") +\n\t\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tstatic bool\n\tdouble_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tauto desugared_type = type->getUnqualifiedDesugaredType ();\n\n\t\tif (!desugared_type->isRealFloatingType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad double argument for %f or %g arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\t\telse if (!desugared_type->isBuiltinType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad double argument for %f or %g arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto builtin_type = dyn_cast<BuiltinType> (desugared_type);\n\t\tauto kind = builtin_type->getKind ();\n\n\t\tif (kind != BuiltinType::Kind::Double) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad double argument for %f or %g arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tstatic bool\n\tlong_double_arg_handler (const Expr *arg, struct PrintfArgChecker *ctx)\n\t{\n\t\tauto type = arg->getType ().split ().Ty;\n\n\t\tauto desugared_type = type->getUnqualifiedDesugaredType ();\n\n\t\tif (!desugared_type->isRealFloatingType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad long double argument for %F or %G arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\t\telse if (!desugared_type->isBuiltinType ()) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad long double argument for %F or %G arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\tauto builtin_type = dyn_cast<BuiltinType> (desugared_type);\n\t\tauto kind = builtin_type->getKind ();\n\n\t\tif (kind != BuiltinType::Kind::LongDouble) {\n\t\t\tprint_error (\n\t\t\t\t\tstd::string (\"bad long double argument for %F or %G arg: \") +\n\t\t\t\t\t\t\targ->getType ().getAsString (), arg, ctx->past);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: scopeguard.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 02:38: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#if ! defined(INCLUDED_COMPHELPER_SCOPEGUARD_HXX)\n#define INCLUDED_COMPHELPER_SCOPEGUARD_HXX\n\n#if ! defined(INCLUDED_COMPHELPERDLLAPI_H)\n#include \"comphelper\/comphelperdllapi.h\"\n#endif\n#include \"boost\/function.hpp\"\n#include \"boost\/noncopyable.hpp\"\n\nnamespace comphelper {\n\n\/** ScopeGuard to ease writing exception-safe code.\n *\/\nclass COMPHELPER_DLLPUBLIC ScopeGuard : private ::boost::noncopyable\n                                        \/\/ noncopyable until we have\n                                        \/\/ good reasons...\n{\npublic:\n    enum exc_handling { IGNORE_EXCEPTIONS, ALLOW_EXCEPTIONS };\n\n    \/** @param func function object to be executed in dtor\n        @param excHandling switches whether thrown exceptions in dtor will be\n                           silently ignored (but OSL_ asserted)\n    *\/\n    template <typename func_type>\n    explicit ScopeGuard( func_type const & func,\n                         exc_handling excHandling = IGNORE_EXCEPTIONS )\n        : m_func( func ), m_excHandling( excHandling ) {}\n\n    ~ScopeGuard();\n\n    \/** Dismisses the scope guard, i.e. the function won't\n        be executed.\n    *\/\n    void dismiss();\n\nprivate:\n    ::boost::function0<void> m_func; \/\/ preferring portable syntax\n    exc_handling const m_excHandling;\n};\n\n} \/\/ namespace comphelper\n\n#endif \/\/ ! defined(INCLUDED_COMPHELPER_SCOPEGUARD_HXX)\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.246); FILE MERGED 2008\/03\/31 12:19:29 rt 1.5.246.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: scopeguard.hxx,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#if ! defined(INCLUDED_COMPHELPER_SCOPEGUARD_HXX)\n#define INCLUDED_COMPHELPER_SCOPEGUARD_HXX\n\n#if ! defined(INCLUDED_COMPHELPERDLLAPI_H)\n#include \"comphelper\/comphelperdllapi.h\"\n#endif\n#include \"boost\/function.hpp\"\n#include \"boost\/noncopyable.hpp\"\n\nnamespace comphelper {\n\n\/** ScopeGuard to ease writing exception-safe code.\n *\/\nclass COMPHELPER_DLLPUBLIC ScopeGuard : private ::boost::noncopyable\n                                        \/\/ noncopyable until we have\n                                        \/\/ good reasons...\n{\npublic:\n    enum exc_handling { IGNORE_EXCEPTIONS, ALLOW_EXCEPTIONS };\n\n    \/** @param func function object to be executed in dtor\n        @param excHandling switches whether thrown exceptions in dtor will be\n                           silently ignored (but OSL_ asserted)\n    *\/\n    template <typename func_type>\n    explicit ScopeGuard( func_type const & func,\n                         exc_handling excHandling = IGNORE_EXCEPTIONS )\n        : m_func( func ), m_excHandling( excHandling ) {}\n\n    ~ScopeGuard();\n\n    \/** Dismisses the scope guard, i.e. the function won't\n        be executed.\n    *\/\n    void dismiss();\n\nprivate:\n    ::boost::function0<void> m_func; \/\/ preferring portable syntax\n    exc_handling const m_excHandling;\n};\n\n} \/\/ namespace comphelper\n\n#endif \/\/ ! defined(INCLUDED_COMPHELPER_SCOPEGUARD_HXX)\n\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n\n  This source file is part of the tomviz project.\n\n  Copyright 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#include \"vtkChartHistogram.h\"\n\n#include \"vtkAxis.h\"\n#include \"vtkCommand.h\"\n#include \"vtkContext2D.h\"\n#include \"vtkContextMouseEvent.h\"\n#include \"vtkContextScene.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPiecewiseFunction.h\"\n#include \"vtkPiecewiseFunctionItem.h\"\n#include \"vtkPiecewiseControlPointsItem.h\"\n#include \"vtkPen.h\"\n#include \"vtkPlot.h\"\n#include \"vtkPlotBar.h\"\n#include \"vtkScalarsToColors.h\"\n#include \"vtkTable.h\"\n#include \"vtkTransform2D.h\"\n\n\/\/-----------------------------------------------------------------------------\nclass vtkHistogramMarker : public vtkPlot\n{\npublic:\n  static vtkHistogramMarker * New();\n  double PositionX;\n\n  bool Paint(vtkContext2D *painter) override\n  {\n    vtkNew<vtkPen> pen;\n    pen->SetColor(255, 0, 0, 255);\n    pen->SetWidth(2.0);\n    painter->ApplyPen(pen.Get());\n    painter->DrawLine(PositionX, 0, PositionX, 1e9);\n    return true;\n  }\n};\nvtkStandardNewMacro(vtkHistogramMarker)\n\n\/\/-----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkChartHistogram)\n\n\/\/-----------------------------------------------------------------------------\nvtkChartHistogram::vtkChartHistogram()\n{\n  this->SetBarWidthFraction(1.0);\n  this->SetRenderEmpty(true);\n  this->SetAutoAxes(false);\n  this->ZoomWithMouseWheelOff();\n  this->GetAxis(vtkAxis::LEFT)->SetTitle(\"\");\n  this->GetAxis(vtkAxis::BOTTOM)->SetTitle(\"\");\n  this->GetAxis(vtkAxis::BOTTOM)->SetBehavior(vtkAxis::FIXED);\n  this->GetAxis(vtkAxis::BOTTOM)->SetRange(0, 255);\n  this->GetAxis(vtkAxis::LEFT)->SetBehavior(vtkAxis::FIXED);\n  this->GetAxis(vtkAxis::LEFT)->SetRange(0.0001, 10);\n  this->GetAxis(vtkAxis::LEFT)->SetMinimumLimit(1);\n  this->GetAxis(vtkAxis::LEFT)->SetLogScale(true);\n  this->GetAxis(vtkAxis::RIGHT)->SetBehavior(vtkAxis::FIXED);\n  this->GetAxis(vtkAxis::RIGHT)->SetRange(0.0, 1.0);\n  this->GetAxis(vtkAxis::RIGHT)->SetVisible(true);\n\n  \/\/ Set up the plot bar\n  this->AddPlot(this->HistogramPlotBar.Get());\n  this->HistogramPlotBar->SetColor(0, 0, 255, 255);\n  this->HistogramPlotBar->GetPen()->SetLineType(vtkPen::NO_PEN);\n\n  \/\/ Set up and add the opacity editor chart items\n  this->OpacityFunctionItem->SetOpacity(0.0); \/\/ don't show the transfer function\n  this->AddPlot(this->OpacityFunctionItem.Get());\n  this->SetPlotCorner(this->OpacityFunctionItem.Get(), 1);\n\n  this->OpacityControlPointsItem->SetEndPointsXMovable(false);\n  this->OpacityControlPointsItem->SetEndPointsYMovable(true);\n\n  vtkPen* pen = this->OpacityControlPointsItem->GetPen();\n  pen->SetLineType(vtkPen::SOLID_LINE);\n  pen->SetColor(0, 0, 0);\n  pen->SetOpacity(255);\n  pen->SetWidth(2.0);\n  this->AddPlot(this->OpacityControlPointsItem.Get());\n  this->SetPlotCorner(this->OpacityControlPointsItem.Get(), 1);\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartHistogram::MouseDoubleClickEvent(const vtkContextMouseEvent &m)\n{\n  \/\/ Determine the location of the click, and emit something we can listen to!\n  vtkPlotBar *histo = nullptr;\n  if (this->GetNumberOfPlots() > 0)\n  {\n    histo = vtkPlotBar::SafeDownCast(this->GetPlot(0));\n  }\n  if (!histo)\n  {\n    return false;\n  }\n  this->CalculateUnscaledPlotTransform(histo->GetXAxis(), histo->GetYAxis(),\n                                       this->Transform.Get());\n  vtkVector2f pos;\n  this->Transform->InverseTransformPoints(m.GetScenePos().GetData(), pos.GetData(),\n                                          1);\n  this->PositionX = pos.GetX();\n  this->Marker->PositionX = this->PositionX;\n  this->Marker->Modified();\n  this->Scene->SetDirty(true);\n  if (this->GetNumberOfPlots() == 1)\n  {\n    \/\/ Work around a bug in the charts - ensure corner is invalid for the plot.\n    this->Marker->SetXAxis(nullptr);\n    this->Marker->SetYAxis(nullptr);\n    this->AddPlot(this->Marker.Get());\n  }\n  this->InvokeEvent(vtkCommand::CursorChangedEvent);\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SetHistogramInputData(vtkTable* table,\n                                              const char* xAxisColumn,\n                                              const char* yAxisColumn)\n{\n  this->HistogramPlotBar->SetInputData(table, xAxisColumn, yAxisColumn);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SetScalarVisibility(bool visible)\n{\n  this->HistogramPlotBar->SetScalarVisibility(visible);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::ScalarVisibilityOn()\n{\n  this->HistogramPlotBar->ScalarVisibilityOn();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SetLookupTable(vtkScalarsToColors* lut)\n{\n  this->HistogramPlotBar->SetLookupTable(lut);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SelectColorArray(const char* arrayName)\n{\n  this->HistogramPlotBar->SelectColorArray(arrayName);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SetOpacityFunction(vtkPiecewiseFunction* opacityFunction)\n{\n  this->OpacityFunctionItem->SetPiecewiseFunction(opacityFunction);\n  this->OpacityControlPointsItem->SetPiecewiseFunction(opacityFunction);\n}\n<commit_msg>Prevent endpoint removal from opacity function editor<commit_after>\/******************************************************************************\n\n  This source file is part of the tomviz project.\n\n  Copyright 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#include \"vtkChartHistogram.h\"\n\n#include \"vtkAxis.h\"\n#include \"vtkCommand.h\"\n#include \"vtkContext2D.h\"\n#include \"vtkContextMouseEvent.h\"\n#include \"vtkContextScene.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPiecewiseFunction.h\"\n#include \"vtkPiecewiseFunctionItem.h\"\n#include \"vtkPiecewiseControlPointsItem.h\"\n#include \"vtkPen.h\"\n#include \"vtkPlot.h\"\n#include \"vtkPlotBar.h\"\n#include \"vtkScalarsToColors.h\"\n#include \"vtkTable.h\"\n#include \"vtkTransform2D.h\"\n\n\/\/-----------------------------------------------------------------------------\nclass vtkHistogramMarker : public vtkPlot\n{\npublic:\n  static vtkHistogramMarker * New();\n  double PositionX;\n\n  bool Paint(vtkContext2D *painter) override\n  {\n    vtkNew<vtkPen> pen;\n    pen->SetColor(255, 0, 0, 255);\n    pen->SetWidth(2.0);\n    painter->ApplyPen(pen.Get());\n    painter->DrawLine(PositionX, 0, PositionX, 1e9);\n    return true;\n  }\n};\nvtkStandardNewMacro(vtkHistogramMarker)\n\n\/\/-----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkChartHistogram)\n\n\/\/-----------------------------------------------------------------------------\nvtkChartHistogram::vtkChartHistogram()\n{\n  this->SetBarWidthFraction(1.0);\n  this->SetRenderEmpty(true);\n  this->SetAutoAxes(false);\n  this->ZoomWithMouseWheelOff();\n  this->GetAxis(vtkAxis::LEFT)->SetTitle(\"\");\n  this->GetAxis(vtkAxis::BOTTOM)->SetTitle(\"\");\n  this->GetAxis(vtkAxis::BOTTOM)->SetBehavior(vtkAxis::FIXED);\n  this->GetAxis(vtkAxis::BOTTOM)->SetRange(0, 255);\n  this->GetAxis(vtkAxis::LEFT)->SetBehavior(vtkAxis::FIXED);\n  this->GetAxis(vtkAxis::LEFT)->SetRange(0.0001, 10);\n  this->GetAxis(vtkAxis::LEFT)->SetMinimumLimit(1);\n  this->GetAxis(vtkAxis::LEFT)->SetLogScale(true);\n  this->GetAxis(vtkAxis::RIGHT)->SetBehavior(vtkAxis::FIXED);\n  this->GetAxis(vtkAxis::RIGHT)->SetRange(0.0, 1.0);\n  this->GetAxis(vtkAxis::RIGHT)->SetVisible(true);\n\n  \/\/ Set up the plot bar\n  this->AddPlot(this->HistogramPlotBar.Get());\n  this->HistogramPlotBar->SetColor(0, 0, 255, 255);\n  this->HistogramPlotBar->GetPen()->SetLineType(vtkPen::NO_PEN);\n\n  \/\/ Set up and add the opacity editor chart items\n  this->OpacityFunctionItem->SetOpacity(0.0); \/\/ don't show the transfer function\n  this->AddPlot(this->OpacityFunctionItem.Get());\n  this->SetPlotCorner(this->OpacityFunctionItem.Get(), 1);\n\n  this->OpacityControlPointsItem->SetEndPointsXMovable(false);\n  this->OpacityControlPointsItem->SetEndPointsYMovable(true);\n  this->OpacityControlPointsItem->SetEndPointsRemovable(false);\n\n  vtkPen* pen = this->OpacityControlPointsItem->GetPen();\n  pen->SetLineType(vtkPen::SOLID_LINE);\n  pen->SetColor(0, 0, 0);\n  pen->SetOpacity(255);\n  pen->SetWidth(2.0);\n  this->AddPlot(this->OpacityControlPointsItem.Get());\n  this->SetPlotCorner(this->OpacityControlPointsItem.Get(), 1);\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartHistogram::MouseDoubleClickEvent(const vtkContextMouseEvent &m)\n{\n  \/\/ Determine the location of the click, and emit something we can listen to!\n  vtkPlotBar *histo = nullptr;\n  if (this->GetNumberOfPlots() > 0)\n  {\n    histo = vtkPlotBar::SafeDownCast(this->GetPlot(0));\n  }\n  if (!histo)\n  {\n    return false;\n  }\n  this->CalculateUnscaledPlotTransform(histo->GetXAxis(), histo->GetYAxis(),\n                                       this->Transform.Get());\n  vtkVector2f pos;\n  this->Transform->InverseTransformPoints(m.GetScenePos().GetData(), pos.GetData(),\n                                          1);\n  this->PositionX = pos.GetX();\n  this->Marker->PositionX = this->PositionX;\n  this->Marker->Modified();\n  this->Scene->SetDirty(true);\n  if (this->GetNumberOfPlots() == 1)\n  {\n    \/\/ Work around a bug in the charts - ensure corner is invalid for the plot.\n    this->Marker->SetXAxis(nullptr);\n    this->Marker->SetYAxis(nullptr);\n    this->AddPlot(this->Marker.Get());\n  }\n  this->InvokeEvent(vtkCommand::CursorChangedEvent);\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SetHistogramInputData(vtkTable* table,\n                                              const char* xAxisColumn,\n                                              const char* yAxisColumn)\n{\n  this->HistogramPlotBar->SetInputData(table, xAxisColumn, yAxisColumn);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SetScalarVisibility(bool visible)\n{\n  this->HistogramPlotBar->SetScalarVisibility(visible);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::ScalarVisibilityOn()\n{\n  this->HistogramPlotBar->ScalarVisibilityOn();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SetLookupTable(vtkScalarsToColors* lut)\n{\n  this->HistogramPlotBar->SetLookupTable(lut);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SelectColorArray(const char* arrayName)\n{\n  this->HistogramPlotBar->SelectColorArray(arrayName);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartHistogram::SetOpacityFunction(vtkPiecewiseFunction* opacityFunction)\n{\n  this->OpacityFunctionItem->SetPiecewiseFunction(opacityFunction);\n  this->OpacityControlPointsItem->SetPiecewiseFunction(opacityFunction);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ESTIMATE_NORMALS_H\n#define ESTIMATE_NORMALS_H\n\n\/\/\/ PROJECT\n#include <csapex\/model\/node.h>\n#include <csapex_point_cloud\/point_cloud_message.h>\n#include <csapex_point_cloud\/normals_message.h>\n#include <csapex\/model\/node_modifier.h>\n#include <csapex\/msg\/io.h>\n#include <csapex\/utility\/register_apex_plugin.h>\n\n\/\/\/ SYSTEM\n#include <pcl\/point_types.h>\n#include <pcl\/features\/normal_3d.h>\n#include <pcl\/features\/integral_image_normal.h>\n#include <pcl\/search\/impl\/kdtree.hpp>\n\nusing namespace csapex::connection_types;\n\nnamespace csapex\n{\n\nclass EstimateNormals : public Node\n{\npublic:\n    EstimateNormals()\n    {\n\n    }\n\n    virtual void setup(csapex::NodeModifier& node_modifier) override\n    {\n        input_ = node_modifier.addInput<PointCloudMessage>(\"cloud\");\n        output_ = node_modifier.addOutput<NormalsMessage>(\"normals\");\n    }\n\n    void setupParameters(Parameterizable& parameters)\n    {\n\n    }\n\n    virtual void process() override\n    {\n        PointCloudMessage::ConstPtr msg(msg::getMessage<PointCloudMessage>(input_));\n\n        boost::apply_visitor (PointCloudMessage::Dispatch<EstimateNormals>(this, msg), msg->value);\n    }\n\n    template <class PointT>\n    void inputCloud(typename pcl::PointCloud<PointT>::ConstPtr cloud)\n    {\n        NormalsMessage::Ptr out_msg(new NormalsMessage(cloud->header.frame_id, cloud->header.stamp));\n        pcl::PointCloud<pcl::Normal>::Ptr msg(new pcl::PointCloud<pcl::Normal>);\n        out_msg->value = msg;\n\n        bool dense = cloud->width > 1 && cloud->height > 1;\n        if(!dense) {\n            pcl::NormalEstimation<PointT, pcl::Normal> ne;\n            ne.setInputCloud (cloud);\n\n            \/\/ Create an empty kdtree representation, and pass it to the normal estimation object.\n            \/\/ Its content will be filled inside the object, based on the given input dataset (as no other search surface is given).\n            typename pcl::search::KdTree<PointT>::Ptr tree (new pcl::search::KdTree<PointT> ());\n            ne.setSearchMethod (tree);\n\n            \/\/ Use all neighbors in a sphere of radius 3cm\n            ne.setRadiusSearch (0.03);\n\n            \/\/ Compute the features\n            ne.compute (*msg);\n\n        }  else {\n            pcl::IntegralImageNormalEstimation<PointT, pcl::Normal> ne;\n            ne.setNormalEstimationMethod (ne.AVERAGE_3D_GRADIENT);\n            ne.setMaxDepthChangeFactor(0.02f);\n            ne.setNormalSmoothingSize(10.0f);\n            ne.setInputCloud(cloud);\n            ne.compute(*msg);\n        }\n\n        msg::publish(output_, out_msg);\n    }\n\nprivate:\n    Input*  input_;\n    Output* output_;\n\n\n};\n\n}\n\nCSAPEX_REGISTER_CLASS(csapex::EstimateNormals, csapex::Node)\n\n#endif \/\/ ESTIMATE_NORMALS_H\n<commit_msg>parameters<commit_after>#ifndef ESTIMATE_NORMALS_H\n#define ESTIMATE_NORMALS_H\n\n\/\/\/ PROJECT\n#include <csapex\/model\/node.h>\n#include <csapex_point_cloud\/point_cloud_message.h>\n#include <csapex_point_cloud\/normals_message.h>\n#include <csapex\/model\/node_modifier.h>\n#include <csapex\/msg\/io.h>\n#include <csapex\/utility\/register_apex_plugin.h>\n#include <csapex\/param\/parameter_factory.h>\n\n\/\/\/ SYSTEM\n#include <pcl\/point_types.h>\n#include <pcl\/features\/normal_3d.h>\n#include <pcl\/features\/integral_image_normal.h>\n#include <pcl\/search\/impl\/kdtree.hpp>\n\nusing namespace csapex::connection_types;\n\nnamespace csapex\n{\n\nclass EstimateNormals : public Node\n{\npublic:\n    EstimateNormals()\n    {\n\n    }\n\n    virtual void setup(csapex::NodeModifier& node_modifier) override\n    {\n        input_ = node_modifier.addInput<PointCloudMessage>(\"cloud\");\n        output_ = node_modifier.addOutput<NormalsMessage>(\"normals\");\n    }\n\n    void setupParameters(Parameterizable& parameters)\n    {\n\n        parameters.addParameter(param::ParameterFactory::declareRange(\"max_depth_change_factor\",\n                                                                      0.0, 0.5, 0.02, 0.001),\n                                max_depth_change_factor);\n        parameters.addParameter(param::ParameterFactory::declareRange(\"normal_smoothing_size\",\n                                                                      0.0, 50.0, 10.0, 0.1),\n                                normal_smoothing_size);\n\n        typedef pcl::IntegralImageNormalEstimation<pcl::PointXYZ, pcl::Normal> T;\n\n        std::map<std::string, int> methods {\n            {\"COVARIANCE_MATRIX\", T::COVARIANCE_MATRIX},\n            {\"AVERAGE_3D_GRADIENT\", T::AVERAGE_3D_GRADIENT},\n            {\"AVERAGE_DEPTH_CHANGE\", T::AVERAGE_DEPTH_CHANGE},\n            {\"SIMPLE_3D_GRADIENT\", T::SIMPLE_3D_GRADIENT}\n        };\n        parameters.addParameter(param::ParameterFactory::declareParameterSet(\"method\", methods,\n                                                                             (int) T::AVERAGE_3D_GRADIENT),\n                                method);\n    }\n\n    virtual void process() override\n    {\n        PointCloudMessage::ConstPtr msg(msg::getMessage<PointCloudMessage>(input_));\n\n        boost::apply_visitor (PointCloudMessage::Dispatch<EstimateNormals>(this, msg), msg->value);\n    }\n\n    template <class PointT>\n    void inputCloud(typename pcl::PointCloud<PointT>::ConstPtr cloud)\n    {\n        NormalsMessage::Ptr out_msg(new NormalsMessage(cloud->header.frame_id, cloud->header.stamp));\n        pcl::PointCloud<pcl::Normal>::Ptr msg(new pcl::PointCloud<pcl::Normal>);\n        out_msg->value = msg;\n\n        bool dense = cloud->width > 1 && cloud->height > 1;\n        if(!dense) {\n            pcl::NormalEstimation<PointT, pcl::Normal> ne;\n            ne.setInputCloud (cloud);\n\n            \/\/ Create an empty kdtree representation, and pass it to the normal estimation object.\n            \/\/ Its content will be filled inside the object, based on the given input dataset (as no other search surface is given).\n            typename pcl::search::KdTree<PointT>::Ptr tree (new pcl::search::KdTree<PointT> ());\n            ne.setSearchMethod (tree);\n\n            \/\/ Use all neighbors in a sphere of radius 3cm\n            ne.setRadiusSearch (0.03);\n\n            \/\/ Compute the features\n            ne.compute (*msg);\n\n        }  else {\n            typedef pcl::IntegralImageNormalEstimation<PointT, pcl::Normal> N;\n            N ne;\n            ne.setNormalEstimationMethod (static_cast<typename N::NormalEstimationMethod>(method));\n            ne.setMaxDepthChangeFactor(max_depth_change_factor);\n            ne.setNormalSmoothingSize(normal_smoothing_size);\n            ne.setInputCloud(cloud);\n            ne.compute(*msg);\n        }\n\n        msg::publish(output_, out_msg);\n    }\n\nprivate:\n    Input*  input_;\n    Output* output_;\n\n    int method;\n    double max_depth_change_factor;\n    double normal_smoothing_size;\n};\n\n}\n\nCSAPEX_REGISTER_CLASS(csapex::EstimateNormals, csapex::Node)\n\n#endif \/\/ ESTIMATE_NORMALS_H\n<|endoftext|>"}
{"text":"<commit_before>#include \"acf_depth_channel.hpp\"\n\n#include <csapex\/msg\/io.h>\n#include <csapex\/msg\/generic_vector_message.hpp>\n#include <csapex\/model\/node_modifier.h>\n#include <csapex\/param\/parameter_factory.h>\n#include <csapex\/utility\/register_apex_plugin.h>\n\n#include <csapex_opencv\/cv_mat_message.h>\n#include <csapex_opencv\/roi_message.h>\n#include <csapex_ml\/features_message.h>\n\nCSAPEX_REGISTER_CLASS(csapex::vision::ACFDepthChannel, csapex::Node)\n\nusing namespace csapex;\nusing namespace csapex::vision;\nusing namespace csapex::connection_types;\n\nvoid ACFDepthChannel::setup(csapex::NodeModifier& node_modifier)\n{\n    in_image_      = node_modifier.addInput<CvMatMessage>(\"Depth Map\");\n    in_rois_       = node_modifier.addOptionalInput<GenericVectorMessage, RoiMessage>(\"ROIs\");\n    out_channels_  = node_modifier.addOutput<GenericVectorMessage, FeaturesMessage>(\"Channel Features\");\n    out_visualize_ = node_modifier.addOutput<CvMatMessage>(\"Visualize\");\n}\n\nvoid ACFDepthChannel::setupParameters(csapex::Parameterizable& parameters)\n{\n    parameters.addParameter(param::ParameterFactory::declareRange(\"window\/width\",\n                                                                  10, 1024, 64, 1),\n                            std::bind(&ACFDepthChannel::updateWindow, this));\n    parameters.addParameter(param::ParameterFactory::declareRange(\"window\/height\",\n                                                                  10, 1024, 128, 1),\n                            std::bind(&ACFDepthChannel::updateWindow, this));\n    parameters.addParameter(param::ParameterFactory::declareBool(\"window\/keep_ratio\",\n                                                                 false),\n                            keep_ratio_);\n    parameters.addParameter(param::ParameterFactory::declareBool(\"window\/mirror\",\n                                                                 false),\n                            mirror_);\n\n    parameters.addParameter(param::ParameterFactory::declareRange(\"aggregate\/block_size\",\n                                                                  1, 32, 4, 1),\n                            block_size_);\n\n    static const std::map<std::string, int> available_types = {\n            { \"binary\", static_cast<int>(Type::BINARY) },\n            { \"ternary\", static_cast<int>(Type::TERNARY) },\n    };\n    parameters.addParameter(param::ParameterFactory::declareParameterSet(\"channel\/type\",\n                                                                        available_types,\n                                                                        static_cast<int>(Type::BINARY)),\n                            reinterpret_cast<int&>(type_));\n\n    static const std::map<std::string, int> available_methods = {\n            { \"median\", static_cast<int>(Method::MEDIAN) },\n            { \"mean\", static_cast<int>(Method::MEAN) },\n            { \"histogram\", static_cast<int>(Method::HISTOGRAM) },\n    };\n    parameters.addParameter(param::ParameterFactory::declareParameterSet(\"channel\/method\",\n                                                                        available_methods,\n                                                                        static_cast<int>(Method::MEDIAN)),\n                            reinterpret_cast<int&>(method_));\n\n    parameters.addParameter(param::ParameterFactory::declareRange(\"channel\/threshold\",\n                                                                 0.0, 1000.0, 0.1, 0.01),\n                           threshold_);\n\n   parameters.addParameter(param::ParameterFactory::declareBool(\"channel\/normalize\",\n                                                                false),\n                           normalize_);\n}\n\nvoid ACFDepthChannel::updateWindow()\n{\n    int old_height = window_height_;\n\n    window_width_  = readParameter<int>(\"window\/width\");\n    window_height_ = readParameter<int>(\"window\/height\");\n    if (window_ratio_ == 0.0)\n        window_ratio_ = window_height_ \/ double(window_width_);\n\n    if (keep_ratio_)\n    {\n        if (window_height_ != old_height)\n        {\n            window_width_ = window_height_ \/ window_ratio_;\n            setParameter<int>(\"window\/width\", window_width_);\n        } else\n        {\n            window_height_ = window_width_ * window_ratio_;\n            setParameter<int>(\"window\/height\", window_height_);\n        }\n    }\n}\n\nstd::vector<float> ACFDepthChannel::extractChannel(const cv::Mat& depth_map) const\n{\n    cv::Mat aggregated_depth_map;\n    cv::resize(depth_map, aggregated_depth_map, cv::Size(depth_map.cols \/ block_size_, depth_map.rows \/ block_size_));\n    const cv::Mat valid_pixel_mask = aggregated_depth_map > 0;\n\n    double min_value;\n    double max_value;\n    cv::minMaxLoc(aggregated_depth_map, &min_value, &max_value);\n\n    float center = 0.0f;\n    switch (method_)\n    {\n        case Method::HISTOGRAM:\n        {\n            const static float BIN_SIZE = 0.25f;\n            static const int channels[] = { 0 };\n            const int bins[] = { int((max_value - min_value) \/ BIN_SIZE) };\n            const float value_range[] = { float(min_value), float(max_value) + std::numeric_limits<float>::epsilon() };\n            const float* ranges[] = { value_range };\n\n            cv::Mat hist;\n            cv::calcHist(&aggregated_depth_map, 1, channels, valid_pixel_mask, hist, 1, bins, ranges, true);\n\n            cv::Point max;\n            cv::minMaxLoc(hist, nullptr, nullptr, nullptr, &max);\n\n            center = min_value + (max.y + 0.5f) * BIN_SIZE;\n            break;\n        }\n        case Method::MEDIAN:\n        {\n            cv::Mat values = aggregated_depth_map.reshape(0, 1).clone();\n            const int invalid_pixel_count = values.cols - cv::countNonZero(valid_pixel_mask);\n\n            const auto middle = invalid_pixel_count + (values.cols - invalid_pixel_count) \/ 2;\n            std::nth_element(values.begin<float>(), values.begin<float>() + middle, values.end<float>());\n            center = values.at<float>(0, middle);\n            break;\n        }\n        case Method::MEAN:\n            center = cv::mean(aggregated_depth_map, valid_pixel_mask)[0];\n            break;\n    }\n\n    std::vector<float> feature;\n    feature.reserve(aggregated_depth_map.rows * aggregated_depth_map.cols);\n\n    switch (type_)\n    {\n        case Type::TERNARY:\n            std::transform(aggregated_depth_map.begin<float>(), aggregated_depth_map.end<float>(),\n                           std::back_inserter(feature),\n                           [&](float value)\n                           {\n                               if (normalize_)\n                               {\n                                   const float delta = value - center;\n                                   if (delta > threshold_)\n                                       return delta \/ float(max_value - (center + threshold_));\n                                   else if (delta < -threshold_)\n                                       return delta \/ float(center - threshold_ - min_value);\n                                   else\n                                       return 0.f;\n                               }\n                               else\n                               {\n                                   if (value > center + threshold_)\n                                       return 1.f;\n                                   else if (value < center - threshold_)\n                                       return -1.f;\n                                   else\n                                       return 0.f;\n                               }\n                           });\n            break;\n        case Type::BINARY:\n            std::transform(aggregated_depth_map.begin<float>(), aggregated_depth_map.end<float>(),\n                           std::back_inserter(feature),\n                           [&](float value)\n                           {\n                               if (normalize_)\n                               {\n                                   const float delta = value - center;\n                                   if (delta > threshold_)\n                                       return delta \/ float(max_value - (center + threshold_));\n                                   else if (delta < -threshold_)\n                                       return -delta \/ float(center - threshold_ - min_value);\n                                   else\n                                       return 0.f;\n                               }\n                               else\n                               {\n                                   if (std::abs(value - center) > threshold_)\n                                       return 1.f;\n                                   else\n                                       return 0.f;\n                               }\n                           });\n            break;\n    }\n\n    return std::move(feature);\n}\n\nvoid ACFDepthChannel::process()\n{\n    CvMatMessage::ConstPtr in_image = msg::getMessage<CvMatMessage>(in_image_);\n    const cv::Mat& image = in_image->value;\n\n    std::shared_ptr<std::vector<RoiMessage> const> in_rois;\n    if (msg::hasMessage(in_rois_))\n        in_rois = msg::getMessage<GenericVectorMessage, RoiMessage>(in_rois_);\n\n    if (image.channels() != 1 || image.type() != CV_32F)\n        throw std::runtime_error(\"Only 1 channel float images (depth maps) are supported\");\n\n\n    CvMatMessage::Ptr out_visualize;\n    if (msg::isConnected(out_visualize_))\n    {\n        out_visualize = std::make_shared<CvMatMessage>(enc::bgr, in_image->stamp_micro_seconds);\n        out_visualize->frame_id = in_image->frame_id;\n        out_visualize->value = cv::Mat(image.rows, image.cols, CV_8UC3, cv::Scalar(0, 0, 0));\n    }\n\n\n    auto out_features = std::make_shared<std::vector<FeaturesMessage>>();\n\n    const auto process_roi = [&](const Roi& roi)\n    {\n        const cv::Rect roi_region = roi.rect() & cv::Rect(0, 0, image.cols, image.rows);\n\n        FeaturesMessage feature(in_image->stamp_micro_seconds);\n        feature.classification = roi.classification();\n\n        cv::Mat image_region;\n        cv::resize(cv::Mat(image, roi_region), image_region, cv::Size(window_width_, window_height_));\n\n        feature.value = extractChannel(image_region);\n        out_features->push_back(feature);\n\n        if (out_visualize)\n        {\n            const float scale_x = float(image_region.cols \/ block_size_) \/ roi_region.width;\n            const float scale_y = float(image_region.rows \/ block_size_) \/ roi_region.height;\n\n            for (int dy = 0; dy < roi_region.height; ++dy)\n                for (int dx = 0; dx < roi_region.width; ++dx)\n                {\n                    const int ldx = dx * scale_x;\n                    const int ldy = dy * scale_y;\n                    const int step = window_width_ \/ block_size_;\n\n                    const float value = feature.value[ldx + step * ldy];\n                    cv::Vec3b& dst = out_visualize->value.at<cv::Vec3b>(roi_region.y + dy, roi_region.x + dx);\n\n                    if (value == 0)\n                         dst = cv::Vec3b(0, 255, 0);\n                    else if (value < 0)\n                        dst = cv::Vec3b(0, 0, 255) * std::abs(value);\n                    else if (value > 0)\n                        dst = cv::Vec3b(255, 0, 0) * std::abs(value);\n                }\n        }\n\n        if (mirror_)\n        {\n            cv::flip(image_region, image_region, 1);\n\n            feature.value = extractChannel(image_region);\n            out_features->push_back(std::move(feature));\n        }\n    };\n\n    if (in_rois)\n    {\n        for (const RoiMessage& roi : *in_rois)\n            process_roi(roi.value);\n    }\n    else\n        process_roi(csapex::Roi(0, 0, image.cols, image.rows));\n\n\n    msg::publish<GenericVectorMessage, FeaturesMessage>(out_channels_, out_features);\n    if (out_visualize)\n        msg::publish(out_visualize_, out_visualize);\n}\n<commit_msg>vision: ACFDepthChannel - skip invalid points for all methods<commit_after>#include \"acf_depth_channel.hpp\"\n\n#include <csapex\/msg\/io.h>\n#include <csapex\/msg\/generic_vector_message.hpp>\n#include <csapex\/model\/node_modifier.h>\n#include <csapex\/param\/parameter_factory.h>\n#include <csapex\/utility\/register_apex_plugin.h>\n\n#include <csapex_opencv\/cv_mat_message.h>\n#include <csapex_opencv\/roi_message.h>\n#include <csapex_ml\/features_message.h>\n\nCSAPEX_REGISTER_CLASS(csapex::vision::ACFDepthChannel, csapex::Node)\n\nusing namespace csapex;\nusing namespace csapex::vision;\nusing namespace csapex::connection_types;\n\nvoid ACFDepthChannel::setup(csapex::NodeModifier& node_modifier)\n{\n    in_image_      = node_modifier.addInput<CvMatMessage>(\"Depth Map\");\n    in_rois_       = node_modifier.addOptionalInput<GenericVectorMessage, RoiMessage>(\"ROIs\");\n    out_channels_  = node_modifier.addOutput<GenericVectorMessage, FeaturesMessage>(\"Channel Features\");\n    out_visualize_ = node_modifier.addOutput<CvMatMessage>(\"Visualize\");\n}\n\nvoid ACFDepthChannel::setupParameters(csapex::Parameterizable& parameters)\n{\n    parameters.addParameter(param::ParameterFactory::declareRange(\"window\/width\",\n                                                                  10, 1024, 64, 1),\n                            std::bind(&ACFDepthChannel::updateWindow, this));\n    parameters.addParameter(param::ParameterFactory::declareRange(\"window\/height\",\n                                                                  10, 1024, 128, 1),\n                            std::bind(&ACFDepthChannel::updateWindow, this));\n    parameters.addParameter(param::ParameterFactory::declareBool(\"window\/keep_ratio\",\n                                                                 false),\n                            keep_ratio_);\n    parameters.addParameter(param::ParameterFactory::declareBool(\"window\/mirror\",\n                                                                 false),\n                            mirror_);\n\n    parameters.addParameter(param::ParameterFactory::declareRange(\"aggregate\/block_size\",\n                                                                  1, 32, 4, 1),\n                            block_size_);\n\n    static const std::map<std::string, int> available_types = {\n            { \"binary\", static_cast<int>(Type::BINARY) },\n            { \"ternary\", static_cast<int>(Type::TERNARY) },\n    };\n    parameters.addParameter(param::ParameterFactory::declareParameterSet(\"channel\/type\",\n                                                                        available_types,\n                                                                        static_cast<int>(Type::BINARY)),\n                            reinterpret_cast<int&>(type_));\n\n    static const std::map<std::string, int> available_methods = {\n            { \"median\", static_cast<int>(Method::MEDIAN) },\n            { \"mean\", static_cast<int>(Method::MEAN) },\n            { \"histogram\", static_cast<int>(Method::HISTOGRAM) },\n    };\n    parameters.addParameter(param::ParameterFactory::declareParameterSet(\"channel\/method\",\n                                                                        available_methods,\n                                                                        static_cast<int>(Method::MEDIAN)),\n                            reinterpret_cast<int&>(method_));\n\n    parameters.addParameter(param::ParameterFactory::declareRange(\"channel\/threshold\",\n                                                                 0.0, 1000.0, 0.1, 0.01),\n                           threshold_);\n\n   parameters.addParameter(param::ParameterFactory::declareBool(\"channel\/normalize\",\n                                                                false),\n                           normalize_);\n}\n\nvoid ACFDepthChannel::updateWindow()\n{\n    int old_height = window_height_;\n\n    window_width_  = readParameter<int>(\"window\/width\");\n    window_height_ = readParameter<int>(\"window\/height\");\n    if (window_ratio_ == 0.0)\n        window_ratio_ = window_height_ \/ double(window_width_);\n\n    if (keep_ratio_)\n    {\n        if (window_height_ != old_height)\n        {\n            window_width_ = window_height_ \/ window_ratio_;\n            setParameter<int>(\"window\/width\", window_width_);\n        } else\n        {\n            window_height_ = window_width_ * window_ratio_;\n            setParameter<int>(\"window\/height\", window_height_);\n        }\n    }\n}\n\nstd::vector<float> ACFDepthChannel::extractChannel(const cv::Mat& depth_map) const\n{\n    cv::Mat aggregated_depth_map;\n    cv::resize(depth_map, aggregated_depth_map, cv::Size(depth_map.cols \/ block_size_, depth_map.rows \/ block_size_));\n    const cv::Mat valid_pixel_mask = aggregated_depth_map > 0;\n\n    double min_value;\n    double max_value;\n    cv::minMaxLoc(aggregated_depth_map, &min_value, &max_value);\n\n    float center = 0.0f;\n    switch (method_)\n    {\n        case Method::HISTOGRAM:\n        {\n            const static float BIN_SIZE = 0.25f;\n            static const int channels[] = { 0 };\n            const int bins[] = { int((max_value - min_value) \/ BIN_SIZE) };\n            const float value_range[] = { float(min_value), float(max_value) + std::numeric_limits<float>::epsilon() };\n            const float* ranges[] = { value_range };\n\n            cv::Mat hist;\n            cv::calcHist(&aggregated_depth_map, 1, channels, valid_pixel_mask, hist, 1, bins, ranges, true);\n\n            cv::Point max;\n            cv::minMaxLoc(hist, nullptr, nullptr, nullptr, &max);\n\n            center = min_value + (max.y + 0.5f) * BIN_SIZE;\n            break;\n        }\n        case Method::MEDIAN:\n        {\n            cv::Mat values = aggregated_depth_map.reshape(0, 1).clone();\n            const int invalid_pixel_count = values.cols - cv::countNonZero(valid_pixel_mask);\n\n            \/\/ invalid points are <0 and thus will be at the beginning of the (partial) sort, so we have to skip them\n            const auto middle = invalid_pixel_count + (values.cols - invalid_pixel_count) \/ 2;\n            std::nth_element(values.begin<float>(), values.begin<float>() + middle, values.end<float>());\n            center = values.at<float>(0, middle);\n            break;\n        }\n        case Method::MEAN:\n            center = cv::mean(aggregated_depth_map, valid_pixel_mask)[0];\n            break;\n    }\n\n    std::vector<float> feature;\n    feature.reserve(aggregated_depth_map.rows * aggregated_depth_map.cols);\n\n    switch (type_)\n    {\n        case Type::TERNARY:\n            std::transform(aggregated_depth_map.begin<float>(), aggregated_depth_map.end<float>(),\n                           std::back_inserter(feature),\n                           [&](float value)\n                           {\n                               if (normalize_)\n                               {\n                                   const float delta = value - center;\n                                   if (delta > threshold_)\n                                       return delta \/ float(max_value - (center + threshold_));\n                                   else if (delta < -threshold_)\n                                       return delta \/ float(center - threshold_ - min_value);\n                                   else\n                                       return 0.f;\n                               }\n                               else\n                               {\n                                   if (value > center + threshold_)\n                                       return 1.f;\n                                   else if (value < center - threshold_)\n                                       return -1.f;\n                                   else\n                                       return 0.f;\n                               }\n                           });\n            break;\n        case Type::BINARY:\n            std::transform(aggregated_depth_map.begin<float>(), aggregated_depth_map.end<float>(),\n                           std::back_inserter(feature),\n                           [&](float value)\n                           {\n                               if (normalize_)\n                               {\n                                   const float delta = value - center;\n                                   if (delta > threshold_)\n                                       return delta \/ float(max_value - (center + threshold_));\n                                   else if (delta < -threshold_)\n                                       return -delta \/ float(center - threshold_ - min_value);\n                                   else\n                                       return 0.f;\n                               }\n                               else\n                               {\n                                   if (std::abs(value - center) > threshold_)\n                                       return 1.f;\n                                   else\n                                       return 0.f;\n                               }\n                           });\n            break;\n    }\n\n    return std::move(feature);\n}\n\nvoid ACFDepthChannel::process()\n{\n    CvMatMessage::ConstPtr in_image = msg::getMessage<CvMatMessage>(in_image_);\n    const cv::Mat& image = in_image->value;\n\n    std::shared_ptr<std::vector<RoiMessage> const> in_rois;\n    if (msg::hasMessage(in_rois_))\n        in_rois = msg::getMessage<GenericVectorMessage, RoiMessage>(in_rois_);\n\n    if (image.channels() != 1 || image.type() != CV_32F)\n        throw std::runtime_error(\"Only 1 channel float images (depth maps) are supported\");\n\n\n    CvMatMessage::Ptr out_visualize;\n    if (msg::isConnected(out_visualize_))\n    {\n        out_visualize = std::make_shared<CvMatMessage>(enc::bgr, in_image->stamp_micro_seconds);\n        out_visualize->frame_id = in_image->frame_id;\n        out_visualize->value = cv::Mat(image.rows, image.cols, CV_8UC3, cv::Scalar(0, 0, 0));\n    }\n\n\n    auto out_features = std::make_shared<std::vector<FeaturesMessage>>();\n\n    const auto process_roi = [&](const Roi& roi)\n    {\n        const cv::Rect roi_region = roi.rect() & cv::Rect(0, 0, image.cols, image.rows);\n\n        FeaturesMessage feature(in_image->stamp_micro_seconds);\n        feature.classification = roi.classification();\n\n        cv::Mat image_region;\n        cv::resize(cv::Mat(image, roi_region), image_region, cv::Size(window_width_, window_height_));\n\n        feature.value = extractChannel(image_region);\n        out_features->push_back(feature);\n\n        if (out_visualize)\n        {\n            const float scale_x = float(image_region.cols \/ block_size_) \/ roi_region.width;\n            const float scale_y = float(image_region.rows \/ block_size_) \/ roi_region.height;\n\n            for (int dy = 0; dy < roi_region.height; ++dy)\n                for (int dx = 0; dx < roi_region.width; ++dx)\n                {\n                    const int ldx = dx * scale_x;\n                    const int ldy = dy * scale_y;\n                    const int step = window_width_ \/ block_size_;\n\n                    const float value = feature.value[ldx + step * ldy];\n                    cv::Vec3b& dst = out_visualize->value.at<cv::Vec3b>(roi_region.y + dy, roi_region.x + dx);\n\n                    if (value == 0)\n                         dst = cv::Vec3b(0, 255, 0);\n                    else if (value < 0)\n                        dst = cv::Vec3b(0, 0, 255) * std::abs(value);\n                    else if (value > 0)\n                        dst = cv::Vec3b(255, 0, 0) * std::abs(value);\n                }\n        }\n\n        if (mirror_)\n        {\n            cv::flip(image_region, image_region, 1);\n\n            feature.value = extractChannel(image_region);\n            out_features->push_back(std::move(feature));\n        }\n    };\n\n    if (in_rois)\n    {\n        for (const RoiMessage& roi : *in_rois)\n            process_roi(roi.value);\n    }\n    else\n        process_roi(csapex::Roi(0, 0, image.cols, image.rows));\n\n\n    msg::publish<GenericVectorMessage, FeaturesMessage>(out_channels_, out_features);\n    if (out_visualize)\n        msg::publish(out_visualize_, out_visualize);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014 eric schkufza\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <fstream>\n#include <iostream>\n#include <random>\n#include <string>\n#include <vector>\n\n#include \"src\/ext\/cpputil\/include\/command_line\/command_line.h\"\n#include \"src\/ext\/cpputil\/include\/serialize\/span_reader.h\"\n#include \"src\/ext\/cpputil\/include\/signal\/debug_handler.h\"\n#include \"src\/ext\/cpputil\/include\/system\/terminal.h\"\n\n#include \"src\/state\/cpu_states.h\"\n#include \"src\/stategen\/stategen.h\"\n#include \"tools\/args\/target.h\"\n#include \"tools\/gadgets\/sandbox.h\"\n#include \"tools\/gadgets\/target.h\"\n#include \"tools\/io\/tunit.h\"\n\nusing namespace cpputil;\nusing namespace std;\nusing namespace stoke;\n\nauto& io_opt = Heading::create(\"I\/O options:\");\nauto& bin = ValueArg<string>::create(\"bin\")\n            .usage(\"<path\/to\/bin>\")\n            .description(\"Executable binary containing function to generate testcases for\")\n            .default_val(\".\/a.out\");\nauto& args = ValueArg<string>::create(\"args\")\n             .usage(\"<arg1 arg2 ... argn>\")\n             .description(\"Optional command line arguments to pass to binary\")\n             .default_val(\"\");\nauto& out = ValueArg<string>::create(\"o\")\n            .alternate(\"out\")\n            .usage(\"<path\/to\/file.tc>\")\n            .description(\"File to write testcases to (defaults to console if unspecified)\")\n            .default_val(\"\");\n\nauto& common_opt = Heading::create(\"Common options:\");\nauto& max_tc = ValueArg<size_t>::create(\"max_testcases\")\n               .usage(\"<int>\")\n               .description(\"The maximum number of testcases to generate\")\n               .default_val(16);\n\nauto& trace_opt = Heading::create(\"Trace options:\");\nauto& fxn = ValueArg<string>::create(\"fxn\")\n            .usage(\"<string>\")\n            .description(\"Function to generate testcases for\")\n            .default_val(\"main\");\nauto& begin_line = ValueArg<size_t>::create(\"begin_line\")\n                   .usage(\"<int>\")\n                   .description(\"The line number to begin recording from\")\n                   .default_val(1);\nauto& end_lines = ValueArg<vector<size_t>>::create(\"end_lines\")\n                  .usage(\"{ 0 1 ... 9 }\")\n                  .description(\"Line number to end recording on; recording always stops on returns\")\n                  .default_val({});\nauto& max_stack = ValueArg<uint64_t>::create(\"max_stack\")\n                  .usage(\"<bytes>\")\n                  .description(\"The maximum number of bytes to assume could be stack\")\n                  .default_val(1024);\n\nauto& autogen_opt = Heading::create(\"Autogen options:\");\nauto& max_attempts = ValueArg<uint64_t>::create(\"max_attempts\")\n                     .usage(\"<int>\")\n                     .description(\"The maximum number of attempts to make at generating a testcase\")\n                     .default_val(16);\nauto& max_memory = ValueArg<uint64_t>::create(\"max_memory\")\n                   .usage(\"<bytes>\")\n                   .description(\"The maximum number of bytes to allocate to stack or heap\")\n                   .default_val(1024);\nauto& stack_size = ValueArg<size_t>::create(\"stack_size\")\n                     .usage(\"<int>\")\n                     .description(\"The minimum stack size available to the testcase\")\n                     .default_val(16);\n\nauto& conv_opt = Heading::create(\"File conversion options:\");\nauto& compress = FlagArg::create(\"compress\")\n                 .description(\"Convert testcase file from text to binary\");\nauto& decompress = FlagArg::create(\"decompress\")\n                   .description(\"Convert testcase file from binary to text\");\nauto& in = ValueArg<string>::create(\"in\")\n           .alternate(\"i\")\n           .usage(\"<path\/to\/file.tc>\")\n           .description(\"Path to testcases file\")\n           .default_val(\"in.tc\");\n\nint auto_gen() {\n  TargetGadget target;\n  SandboxGadget sb({});\n\n  StateGen sg(&sb, stack_size.value());\n  sg.set_max_attempts(max_attempts.value())\n  .set_max_memory(max_stack.value());\n\n  CpuStates tcs;\n  for (size_t i = 0, ie = max_tc.value(); i < ie; ++i) {\n    CpuState tc;\n    if (sg.get(tc, target)) {\n      tcs.push_back(tc);\n    }\n  }\n\n  if (tcs.empty()) {\n    cout << \"Unable to generate testcases!\" << endl;\n    return 1;\n  }\n\n  if (out.value() != \"\") {\n    ofstream ofs(out.value());\n    tcs.write_text(ofs);\n  } else {\n    tcs.write_text(cout);\n    cout << endl;\n  }\n\n  return 0;\n}\n\nint trace(const string& argv0) {\n  string here = argv0;\n  here = here.substr(0, here.find_last_of(\"\/\") + 1);\n\n  const string pin_path = here + \"..\/src\/ext\/pin-2.13-62732-gcc.4.4.7-linux\/\";\n  const string so_path = pin_path + \"source\/tools\/stoke\/obj-intel64\/\";\n\n  Terminal term;\n  term << pin_path << \"pin -injection child -t \" << so_path << \"testcase.so \";\n\n  term << \"-f \" << fxn.value() << \" \";\n  if (out.value() != \"\") {\n    term << \"-o \" << out.value() << \" \";\n  }\n  term << \"-x \" << max_stack.value() << \" \";\n  term << \"-n \" << max_tc.value() << \" \";\n  term << \"-b \" << begin_line.value() << \" \";\n  term << \"-e \\\" \";\n  for (auto e : end_lines.value()) {\n    term << e << \" \";\n  }\n  term << \"\\\" \";\n\n  term << \" -- \" << bin.value() << \" \" << args.value() << endl;\n\n  return 0;\n}\n\nint do_compress() {\n  ifstream ifs(in.value());\n  if (!ifs.is_open()) {\n    cout << \"Unable to open input file: \" << in.value() << \"!\" << endl;\n    return 1;\n  }\n\n  CpuStates cs;\n  cs.read_text(ifs);\n  if (ifs.fail()) {\n    cout << \"Unable to read input file: \" << in.value() << \"!\" << endl;\n    return 1;\n  }\n\n  if (out.value() != \"\") {\n    ofstream ofs(out.value());\n    cs.write_bin(ofs);\n  } else {\n    cs.write_bin(cout);\n    cout << endl;\n  }\n\n  return 0;\n}\n\nint do_decompress() {\n  ifstream ifs(in.value());\n  if (!ifs.is_open()) {\n    cout << \"Unable to open input file: \" << in.value() << \"!\" << endl;\n    return 1;\n  }\n\n  CpuStates cs;\n  cs.read_bin(ifs);\n  if (ifs.fail()) {\n    cout << \"Unable to read input file: \" << in.value() << \"!\" << endl;\n    return 1;\n  }\n\n  if (out.value() != \"\") {\n    ofstream ofs(out.value());\n    cs.write_text(ofs);\n  } else {\n    cs.write_text(cout);\n    cout << endl;\n  }\n\n  return 0;\n}\n\nint main(int argc, char** argv) {\n  CommandLineConfig::strict_with_convenience(argc, argv);\n  DebugHandler::install_sigsegv();\n  DebugHandler::install_sigill();\n\n  if (compress.value()) {\n    return do_compress();\n  } else if (decompress.value()) {\n    return do_decompress();\n  } else if (target_arg.value().name != \"anon\") {\n    return auto_gen();\n  } else {\n    return trace(argv[0]);\n  }\n}\n\n<commit_msg>whitespace<commit_after>\/\/ Copyright 2014 eric schkufza\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <fstream>\n#include <iostream>\n#include <random>\n#include <string>\n#include <vector>\n\n#include \"src\/ext\/cpputil\/include\/command_line\/command_line.h\"\n#include \"src\/ext\/cpputil\/include\/serialize\/span_reader.h\"\n#include \"src\/ext\/cpputil\/include\/signal\/debug_handler.h\"\n#include \"src\/ext\/cpputil\/include\/system\/terminal.h\"\n\n#include \"src\/state\/cpu_states.h\"\n#include \"src\/stategen\/stategen.h\"\n#include \"tools\/args\/target.h\"\n#include \"tools\/gadgets\/sandbox.h\"\n#include \"tools\/gadgets\/target.h\"\n#include \"tools\/io\/tunit.h\"\n\nusing namespace cpputil;\nusing namespace std;\nusing namespace stoke;\n\nauto& io_opt = Heading::create(\"I\/O options:\");\nauto& bin = ValueArg<string>::create(\"bin\")\n            .usage(\"<path\/to\/bin>\")\n            .description(\"Executable binary containing function to generate testcases for\")\n            .default_val(\".\/a.out\");\nauto& args = ValueArg<string>::create(\"args\")\n             .usage(\"<arg1 arg2 ... argn>\")\n             .description(\"Optional command line arguments to pass to binary\")\n             .default_val(\"\");\nauto& out = ValueArg<string>::create(\"o\")\n            .alternate(\"out\")\n            .usage(\"<path\/to\/file.tc>\")\n            .description(\"File to write testcases to (defaults to console if unspecified)\")\n            .default_val(\"\");\n\nauto& common_opt = Heading::create(\"Common options:\");\nauto& max_tc = ValueArg<size_t>::create(\"max_testcases\")\n               .usage(\"<int>\")\n               .description(\"The maximum number of testcases to generate\")\n               .default_val(16);\n\nauto& trace_opt = Heading::create(\"Trace options:\");\nauto& fxn = ValueArg<string>::create(\"fxn\")\n            .usage(\"<string>\")\n            .description(\"Function to generate testcases for\")\n            .default_val(\"main\");\nauto& begin_line = ValueArg<size_t>::create(\"begin_line\")\n                   .usage(\"<int>\")\n                   .description(\"The line number to begin recording from\")\n                   .default_val(1);\nauto& end_lines = ValueArg<vector<size_t>>::create(\"end_lines\")\n                  .usage(\"{ 0 1 ... 9 }\")\n                  .description(\"Line number to end recording on; recording always stops on returns\")\n                  .default_val({});\nauto& max_stack = ValueArg<uint64_t>::create(\"max_stack\")\n                  .usage(\"<bytes>\")\n                  .description(\"The maximum number of bytes to assume could be stack\")\n                  .default_val(1024);\n\nauto& autogen_opt = Heading::create(\"Autogen options:\");\nauto& max_attempts = ValueArg<uint64_t>::create(\"max_attempts\")\n                     .usage(\"<int>\")\n                     .description(\"The maximum number of attempts to make at generating a testcase\")\n                     .default_val(16);\nauto& max_memory = ValueArg<uint64_t>::create(\"max_memory\")\n                   .usage(\"<bytes>\")\n                   .description(\"The maximum number of bytes to allocate to stack or heap\")\n                   .default_val(1024);\nauto& stack_size = ValueArg<size_t>::create(\"stack_size\")\n                   .usage(\"<int>\")\n                   .description(\"The minimum stack size available to the testcase\")\n                   .default_val(16);\n\nauto& conv_opt = Heading::create(\"File conversion options:\");\nauto& compress = FlagArg::create(\"compress\")\n                 .description(\"Convert testcase file from text to binary\");\nauto& decompress = FlagArg::create(\"decompress\")\n                   .description(\"Convert testcase file from binary to text\");\nauto& in = ValueArg<string>::create(\"in\")\n           .alternate(\"i\")\n           .usage(\"<path\/to\/file.tc>\")\n           .description(\"Path to testcases file\")\n           .default_val(\"in.tc\");\n\nint auto_gen() {\n  TargetGadget target;\n  SandboxGadget sb({});\n\n  StateGen sg(&sb, stack_size.value());\n  sg.set_max_attempts(max_attempts.value())\n  .set_max_memory(max_stack.value());\n\n  CpuStates tcs;\n  for (size_t i = 0, ie = max_tc.value(); i < ie; ++i) {\n    CpuState tc;\n    if (sg.get(tc, target)) {\n      tcs.push_back(tc);\n    }\n  }\n\n  if (tcs.empty()) {\n    cout << \"Unable to generate testcases!\" << endl;\n    return 1;\n  }\n\n  if (out.value() != \"\") {\n    ofstream ofs(out.value());\n    tcs.write_text(ofs);\n  } else {\n    tcs.write_text(cout);\n    cout << endl;\n  }\n\n  return 0;\n}\n\nint trace(const string& argv0) {\n  string here = argv0;\n  here = here.substr(0, here.find_last_of(\"\/\") + 1);\n\n  const string pin_path = here + \"..\/src\/ext\/pin-2.13-62732-gcc.4.4.7-linux\/\";\n  const string so_path = pin_path + \"source\/tools\/stoke\/obj-intel64\/\";\n\n  Terminal term;\n  term << pin_path << \"pin -injection child -t \" << so_path << \"testcase.so \";\n\n  term << \"-f \" << fxn.value() << \" \";\n  if (out.value() != \"\") {\n    term << \"-o \" << out.value() << \" \";\n  }\n  term << \"-x \" << max_stack.value() << \" \";\n  term << \"-n \" << max_tc.value() << \" \";\n  term << \"-b \" << begin_line.value() << \" \";\n  term << \"-e \\\" \";\n  for (auto e : end_lines.value()) {\n    term << e << \" \";\n  }\n  term << \"\\\" \";\n\n  term << \" -- \" << bin.value() << \" \" << args.value() << endl;\n\n  return 0;\n}\n\nint do_compress() {\n  ifstream ifs(in.value());\n  if (!ifs.is_open()) {\n    cout << \"Unable to open input file: \" << in.value() << \"!\" << endl;\n    return 1;\n  }\n\n  CpuStates cs;\n  cs.read_text(ifs);\n  if (ifs.fail()) {\n    cout << \"Unable to read input file: \" << in.value() << \"!\" << endl;\n    return 1;\n  }\n\n  if (out.value() != \"\") {\n    ofstream ofs(out.value());\n    cs.write_bin(ofs);\n  } else {\n    cs.write_bin(cout);\n    cout << endl;\n  }\n\n  return 0;\n}\n\nint do_decompress() {\n  ifstream ifs(in.value());\n  if (!ifs.is_open()) {\n    cout << \"Unable to open input file: \" << in.value() << \"!\" << endl;\n    return 1;\n  }\n\n  CpuStates cs;\n  cs.read_bin(ifs);\n  if (ifs.fail()) {\n    cout << \"Unable to read input file: \" << in.value() << \"!\" << endl;\n    return 1;\n  }\n\n  if (out.value() != \"\") {\n    ofstream ofs(out.value());\n    cs.write_text(ofs);\n  } else {\n    cs.write_text(cout);\n    cout << endl;\n  }\n\n  return 0;\n}\n\nint main(int argc, char** argv) {\n  CommandLineConfig::strict_with_convenience(argc, argv);\n  DebugHandler::install_sigsegv();\n  DebugHandler::install_sigill();\n\n  if (compress.value()) {\n    return do_compress();\n  } else if (decompress.value()) {\n    return do_decompress();\n  } else if (target_arg.value().name != \"anon\") {\n    return auto_gen();\n  } else {\n    return trace(argv[0]);\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- GenerateCode.cpp - Functions for generating executable files  ------===\/\/\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\/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\n\/\/\n\/\/ Function: GenerateBytecode ()\n\/\/\n\/\/ Description:\n\/\/  This function 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\/\/ Outputs:\n\/\/  None.\n\/\/\n\/\/ Return value:\n\/\/  0 - No error.\n\/\/  1 - Error.\n\/\/\nint\nGenerateBytecode (Module *M, bool Strip, bool Internalize, 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  \/\/ Add an appropriate TargetData instance for this module...\n  Passes.add(new TargetData(\"gccld\", M));\n\n  \/\/ Linking modules together can lead to duplicated global constants, only keep\n  \/\/ one copy of each constant...\n  Passes.add(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    Passes.add(createSymbolStrippingPass());\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  Passes.add(createFunctionResolvingPass());\n\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    Passes.add(createInternalizePass());\n  }\n\n  \/\/ Remove unused arguments from functions...\n  Passes.add(createDeadArgEliminationPass());\n\n  \/\/ The FuncResolve pass may leave cruft around if functions were prototyped\n  \/\/ differently than they were defined.  Remove this cruft.\n  Passes.add(createInstructionCombiningPass());\n\n  \/\/ Delete basic blocks, which optimization passes may have killed...\n  Passes.add(createCFGSimplificationPass());\n\n  \/\/ Now that we have optimized the program, discard unreachable functions...\n  Passes.add(createGlobalDCEPass());\n\n  \/\/ Add the pass that writes bytecode to the output file...\n  Passes.add(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\/\/\n\/\/ Function: GenerateAssembly ()\n\/\/\n\/\/ Description:\n\/\/  This function 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\/\/ Outputs:\n\/\/  None.\n\/\/\n\/\/ Return value:\n\/\/  0 - Success\n\/\/  1 - Failure\n\/\/\nint\nGenerateAssembly(const std::string &OutputFilename,\n                 const std::string &InputFilename,\n                 const std::string &llc,\n                 char ** const envp)\n{\n  \/\/ Run LLC to convert the bytecode file into assembly code.\n  const char *cmd[8];\n\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] = NULL;\n\n  return ExecWait(cmd, envp);\n}\n\n\/\/\n\/\/ Function: GenerateNative ()\n\/\/\n\/\/ Description:\n\/\/  This function 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\/\/ Return value:\n\/\/  0 - Success\n\/\/  1 - Failure\n\/\/\nint\nGenerateNative(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,\n               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(\"-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    Libs[index] = \"-l\" + Libs[index];\n    cmd.push_back(Libs[index].c_str());\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>Doxygen-ified function comments.<commit_after>\/\/===- GenerateCode.cpp - Functions for generating executable files  ------===\/\/\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\/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\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\/\/\/ Outputs:\n\/\/\/  None.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint\nGenerateBytecode (Module *M, bool Strip, bool Internalize, 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  \/\/ Add an appropriate TargetData instance for this module...\n  Passes.add(new TargetData(\"gccld\", M));\n\n  \/\/ Linking modules together can lead to duplicated global constants, only keep\n  \/\/ one copy of each constant...\n  Passes.add(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    Passes.add(createSymbolStrippingPass());\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  Passes.add(createFunctionResolvingPass());\n\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    Passes.add(createInternalizePass());\n  }\n\n  \/\/ Remove unused arguments from functions...\n  Passes.add(createDeadArgEliminationPass());\n\n  \/\/ The FuncResolve pass may leave cruft around if functions were prototyped\n  \/\/ differently than they were defined.  Remove this cruft.\n  Passes.add(createInstructionCombiningPass());\n\n  \/\/ Delete basic blocks, which optimization passes may have killed...\n  Passes.add(createCFGSimplificationPass());\n\n  \/\/ Now that we have optimized the program, discard unreachable functions...\n  Passes.add(createGlobalDCEPass());\n\n  \/\/ Add the pass that writes bytecode to the output file...\n  Passes.add(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\/\/\/ Outputs:\n\/\/\/  None.\n\/\/\/\n\/\/\/ Return non-zero value on error.\n\/\/\/\nint\nGenerateAssembly(const std::string &OutputFilename,\n                 const std::string &InputFilename,\n                 const std::string &llc,\n                 char ** const envp)\n{\n  \/\/ Run LLC to convert the bytecode file into assembly code.\n  const char *cmd[8];\n\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] = NULL;\n\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\nGenerateNative(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,\n               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(\"-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    Libs[index] = \"-l\" + Libs[index];\n    cmd.push_back(Libs[index].c_str());\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>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: comdep.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-02 13:01:41 $\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 _COMDEP_HXX\n#define _COMDEP_HXX\n\n#include <tools\/fsys.hxx>\n\n#define ACCESSDELIM(e)  ( (e == FSYS_STYLE_MAC) ? \":\" : \\\n                        ( ( e == FSYS_STYLE_VFAT || e == FSYS_STYLE_HPFS || \\\n                            e == FSYS_STYLE_FAT ) || e == FSYS_STYLE_NTFS ) \\\n                          ? \"\\\\\" : \"\/\" )\n#define ACCESSDELIM_C(e)(char)\\\n                        ( (e == FSYS_STYLE_MAC) ? ':' : \\\n                        ( ( e == FSYS_STYLE_VFAT || e == FSYS_STYLE_HPFS || \\\n                            e == FSYS_STYLE_FAT ) || e == FSYS_STYLE_NTFS ) \\\n                          ? '\\\\' : '\/' )\n#define SEARCHDELIM(e)  ( (e == FSYS_STYLE_SYSV || e == FSYS_STYLE_BSD) ? \":\" \\\n                        : \";\" )\n#define SEARCHDELIM_C(e)(char)\\\n                        ( (e == FSYS_STYLE_SYSV || e == FSYS_STYLE_BSD) ? ':' \\\n                        : ';' )\n#define ACTPARENT(e)    ( (e == FSYS_STYLE_MAC) ? \":\" : \"..\" )\n#define ACTCURRENT(e)   ( (e == FSYS_STYLE_MAC) ? \"\" : \".\" )\n\n#if defined UNX\n#include \"unx.hxx\"\n#elif defined WNT\n#include \"wntmsc.hxx\"\n#elif defined OS2\n#include \"os2.hxx\"\n#endif\n\n\/\/--------------------------------------------------------------------\n\n#ifndef LINUX\nDIR *opendir( const char* pPfad );\ndirent *readdir( DIR *pDir );\nint closedir( DIR *pDir );\nchar *volumeid( const char* pPfad );\n#endif\n\n\/\/--------------------------------------------------------------------\n\nstruct DirReader_Impl\n{\n    Dir*        pDir;\n    DIR*        pDosDir;\n    dirent*     pDosEntry;\n    DirEntry*   pParent;\n    String      aPath;\n    ByteString  aBypass;\n    BOOL        bReady;\n    BOOL        bInUse;\n\n                DirReader_Impl( Dir &rDir )\n                :   pDir( &rDir ),\n                    pDosEntry( 0 ),\n                    pParent( 0 ),\n                    aPath( GUI2FSYS(rDir.GetFull()) ),\n                    bReady ( FALSE ),\n                    bInUse( FALSE )\n                {\n#ifndef BOOTSTRAP\n                    \/\/ Redirection\n                    FSysRedirector::DoRedirect( aPath );\n#endif\n\n                    \/\/ nur den String der Memer-Var nehmen!\n\n#if defined(UNX) || defined(OS2) \/\/for further exlpanation see DirReader_Impl::Read() in unx.cxx\n                    pDosDir = NULL;\n#else\n                    aBypass = ByteString(aPath, osl_getThreadTextEncoding());\n                    pDosDir = opendir( (char*) aBypass.GetBuffer() );\n#endif\n\n                    \/\/ Parent f\"ur die neuen DirEntries ermitteln\n                    pParent = pDir->GetFlag() == FSYS_FLAG_NORMAL ||\n                              pDir->GetFlag() == FSYS_FLAG_ABSROOT\n                                    ? pDir\n                                    : pDir->GetParent();\n\n                }\n\n                ~DirReader_Impl()\n                { if( pDosDir ) closedir( pDosDir ); }\n\n                \/\/ die folgenden sind systemabh\"angig implementiert\n    USHORT      Init(); \/\/ initialisiert, liest ggf. devices\n    USHORT      Read(); \/\/ liest 1 Eintrag, F2ugt ein falls ok\n};\n\n\/\/--------------------------------------------------------------------\n\nstruct FileCopier_Impl\n{\n    FSysAction      nActions;       \/\/ was zu tun ist (Copy\/Move\/recur)\n    Link            aErrorLink;     \/\/ bei Fehlern zu rufen\n    ErrCode         eErr;           \/\/ aktueller Fehlercode im Error-Handler\n    const DirEntry* pErrSource;     \/\/ fuer Error-Handler falls Source-Fehler\n    const DirEntry* pErrTarget;     \/\/ fuer Error-Handler falls Target-Fehler\n\n                    FileCopier_Impl()\n                    :   nActions( 0 ), eErr( 0 ),\n                        pErrSource( 0 ), pErrTarget( 0 )\n                    {}\n                    FileCopier_Impl( const FileCopier_Impl &rOrig )\n                    :   nActions( rOrig.nActions ), eErr( 0 ),\n                        pErrSource( 0 ), pErrTarget( 0 )\n                    {}\n\n    FileCopier_Impl& operator=( const FileCopier_Impl &rOrig )\n                    {\n                        nActions = rOrig.nActions;\n                        eErr = 0; pErrSource = 0; pErrTarget = 0;\n                        return *this;\n                    }\n};\n\n\/\/--------------------------------------------------------------------\n\n#if defined WNT || defined OS2\nBOOL IsRedirectable_Impl( const ByteString &rPath );\n#else\n#define IsRedirectable_Impl( rPath )    TRUE\n#endif\n\n\/\/--------------------------------------------------------------------\n\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.58); FILE MERGED 2008\/03\/28 15:41:17 rt 1.5.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: comdep.hxx,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#ifndef _COMDEP_HXX\n#define _COMDEP_HXX\n\n#include <tools\/fsys.hxx>\n\n#define ACCESSDELIM(e)  ( (e == FSYS_STYLE_MAC) ? \":\" : \\\n                        ( ( e == FSYS_STYLE_VFAT || e == FSYS_STYLE_HPFS || \\\n                            e == FSYS_STYLE_FAT ) || e == FSYS_STYLE_NTFS ) \\\n                          ? \"\\\\\" : \"\/\" )\n#define ACCESSDELIM_C(e)(char)\\\n                        ( (e == FSYS_STYLE_MAC) ? ':' : \\\n                        ( ( e == FSYS_STYLE_VFAT || e == FSYS_STYLE_HPFS || \\\n                            e == FSYS_STYLE_FAT ) || e == FSYS_STYLE_NTFS ) \\\n                          ? '\\\\' : '\/' )\n#define SEARCHDELIM(e)  ( (e == FSYS_STYLE_SYSV || e == FSYS_STYLE_BSD) ? \":\" \\\n                        : \";\" )\n#define SEARCHDELIM_C(e)(char)\\\n                        ( (e == FSYS_STYLE_SYSV || e == FSYS_STYLE_BSD) ? ':' \\\n                        : ';' )\n#define ACTPARENT(e)    ( (e == FSYS_STYLE_MAC) ? \":\" : \"..\" )\n#define ACTCURRENT(e)   ( (e == FSYS_STYLE_MAC) ? \"\" : \".\" )\n\n#if defined UNX\n#include \"unx.hxx\"\n#elif defined WNT\n#include \"wntmsc.hxx\"\n#elif defined OS2\n#include \"os2.hxx\"\n#endif\n\n\/\/--------------------------------------------------------------------\n\n#ifndef LINUX\nDIR *opendir( const char* pPfad );\ndirent *readdir( DIR *pDir );\nint closedir( DIR *pDir );\nchar *volumeid( const char* pPfad );\n#endif\n\n\/\/--------------------------------------------------------------------\n\nstruct DirReader_Impl\n{\n    Dir*        pDir;\n    DIR*        pDosDir;\n    dirent*     pDosEntry;\n    DirEntry*   pParent;\n    String      aPath;\n    ByteString  aBypass;\n    BOOL        bReady;\n    BOOL        bInUse;\n\n                DirReader_Impl( Dir &rDir )\n                :   pDir( &rDir ),\n                    pDosEntry( 0 ),\n                    pParent( 0 ),\n                    aPath( GUI2FSYS(rDir.GetFull()) ),\n                    bReady ( FALSE ),\n                    bInUse( FALSE )\n                {\n#ifndef BOOTSTRAP\n                    \/\/ Redirection\n                    FSysRedirector::DoRedirect( aPath );\n#endif\n\n                    \/\/ nur den String der Memer-Var nehmen!\n\n#if defined(UNX) || defined(OS2) \/\/for further exlpanation see DirReader_Impl::Read() in unx.cxx\n                    pDosDir = NULL;\n#else\n                    aBypass = ByteString(aPath, osl_getThreadTextEncoding());\n                    pDosDir = opendir( (char*) aBypass.GetBuffer() );\n#endif\n\n                    \/\/ Parent f\"ur die neuen DirEntries ermitteln\n                    pParent = pDir->GetFlag() == FSYS_FLAG_NORMAL ||\n                              pDir->GetFlag() == FSYS_FLAG_ABSROOT\n                                    ? pDir\n                                    : pDir->GetParent();\n\n                }\n\n                ~DirReader_Impl()\n                { if( pDosDir ) closedir( pDosDir ); }\n\n                \/\/ die folgenden sind systemabh\"angig implementiert\n    USHORT      Init(); \/\/ initialisiert, liest ggf. devices\n    USHORT      Read(); \/\/ liest 1 Eintrag, F2ugt ein falls ok\n};\n\n\/\/--------------------------------------------------------------------\n\nstruct FileCopier_Impl\n{\n    FSysAction      nActions;       \/\/ was zu tun ist (Copy\/Move\/recur)\n    Link            aErrorLink;     \/\/ bei Fehlern zu rufen\n    ErrCode         eErr;           \/\/ aktueller Fehlercode im Error-Handler\n    const DirEntry* pErrSource;     \/\/ fuer Error-Handler falls Source-Fehler\n    const DirEntry* pErrTarget;     \/\/ fuer Error-Handler falls Target-Fehler\n\n                    FileCopier_Impl()\n                    :   nActions( 0 ), eErr( 0 ),\n                        pErrSource( 0 ), pErrTarget( 0 )\n                    {}\n                    FileCopier_Impl( const FileCopier_Impl &rOrig )\n                    :   nActions( rOrig.nActions ), eErr( 0 ),\n                        pErrSource( 0 ), pErrTarget( 0 )\n                    {}\n\n    FileCopier_Impl& operator=( const FileCopier_Impl &rOrig )\n                    {\n                        nActions = rOrig.nActions;\n                        eErr = 0; pErrSource = 0; pErrTarget = 0;\n                        return *this;\n                    }\n};\n\n\/\/--------------------------------------------------------------------\n\n#if defined WNT || defined OS2\nBOOL IsRedirectable_Impl( const ByteString &rPath );\n#else\n#define IsRedirectable_Impl( rPath )    TRUE\n#endif\n\n\/\/--------------------------------------------------------------------\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of Magnum.\n\n    Original authors — credit is appreciated but not required:\n\n        2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019 —\n            Vladimír Vondruš <mosra@centrum.cz>\n        2020 — Nghia Truong <nghiatruong.vn@gmail.com>\n\n    This is free and unencumbered software released into the public domain.\n\n    Anyone is free to copy, modify, publish, use, compile, sell, or distribute\n    this software, either in source code form or as a compiled binary, for any\n    purpose, commercial or non-commercial, and by any means.\n\n    In jurisdictions that recognize copyright laws, the author or authors of\n    this software dedicate any and all copyright interest in the software to\n    the public domain. We make this dedication for the benefit of the public\n    at large and to the detriment of our heirs and successors. We intend this\n    dedication to be an overt act of relinquishment in perpetuity of all\n    present and future rights to this software under copyright law.\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 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#include <Corrade\/Containers\/Optional.h>\n#include <Magnum\/Mesh.h>\n#include <Magnum\/GL\/Buffer.h>\n#include <Magnum\/GL\/DefaultFramebuffer.h>\n#include <Magnum\/GL\/Mesh.h>\n#include <Magnum\/GL\/Renderer.h>\n#include <Magnum\/Math\/Color.h>\n#include <Magnum\/Math\/Matrix4.h>\n#include <Magnum\/Platform\/Sdl2Application.h>\n#include <Magnum\/SceneGraph\/Camera.h>\n#include <Magnum\/SceneGraph\/Drawable.h>\n#include <Magnum\/SceneGraph\/MatrixTransformation3D.h>\n#include <Magnum\/SceneGraph\/Object.h>\n#include <Magnum\/SceneGraph\/Scene.h>\n#include <Magnum\/Shaders\/VertexColor.h>\n#include <Magnum\/Shaders\/MeshVisualizer.h>\n\n#include \"ArcBall.h\"\n#include \"ArcBallCamera.h\"\n\nnamespace Magnum { namespace Examples {\n\nusing Object3D = SceneGraph::Object<SceneGraph::MatrixTransformation3D>;\nusing Scene3D = SceneGraph::Scene<SceneGraph::MatrixTransformation3D>;\n\nusing namespace Math::Literals;\n\nclass ArcBallExample: public Platform::Application {\n    public:\n        explicit ArcBallExample(const Arguments& arguments);\n\n    private:\n        void drawEvent() override;\n        void viewportEvent(ViewportEvent& event) override;\n        void keyPressEvent(KeyEvent& event) override;\n        void mousePressEvent(MouseEvent& event) override;\n        void mouseReleaseEvent(MouseEvent& event) override;\n        void mouseMoveEvent(MouseMoveEvent& event) override;\n        void mouseScrollEvent(MouseScrollEvent& event) override;\n\n        Scene3D _scene;\n        SceneGraph::DrawableGroup3D _drawables;\n        GL::Mesh _mesh{NoCreate};\n        Shaders::VertexColor3D _shader{NoCreate};\n        Shaders::MeshVisualizer _wireframeShader{NoCreate};\n        Containers::Optional<ArcBallCamera> _arcballCamera;\n};\n\nclass VertexColorDrawable: public SceneGraph::Drawable3D {\n    public:\n        explicit VertexColorDrawable(Object3D& object,\n            Shaders::VertexColor3D& shader,\n            Shaders::MeshVisualizer& wireframeShader, GL::Mesh& mesh,\n            SceneGraph::DrawableGroup3D& drawables):\n                SceneGraph::Drawable3D{object, &drawables}, _shader(shader),\n                _wireframeShader(wireframeShader), _mesh(mesh) {}\n\n        void draw(const Matrix4& transformation, SceneGraph::Camera3D& camera) {\n            _shader\n                .setTransformationProjectionMatrix(\n                    camera.projectionMatrix()*transformation)\n                .draw(_mesh);\n            _wireframeShader\n                .setTransformationProjectionMatrix(\n                    camera.projectionMatrix()*transformation)\n                .draw(_mesh);\n        }\n\n    private:\n        Shaders::VertexColor3D& _shader;\n        Shaders::MeshVisualizer& _wireframeShader;\n        GL::Mesh& _mesh;\n};\n\nArcBallExample::ArcBallExample(const Arguments& arguments) :\n    Platform::Application{arguments, NoCreate}\n{\n    \/* Setup window *\/\n    {\n        const Vector2 dpiScaling = this->dpiScaling({});\n        Configuration conf;\n        conf.setTitle(\"Magnum ArcBall Camera Example\")\n            .setSize(conf.size(), dpiScaling)\n            .setWindowFlags(Configuration::WindowFlag::Resizable);\n        GLConfiguration glConf;\n        glConf.setSampleCount(dpiScaling.max() < 2.0f ? 8 : 2);\n        if(!tryCreate(conf, glConf)) {\n            create(conf, glConf.setSampleCount(0));\n        }\n    }\n\n    GL::Renderer::enable(GL::Renderer::Feature::DepthTest);\n    GL::Renderer::enable(GL::Renderer::Feature::FaceCulling);\n\n    \/* For cube wireframe vizualization *\/\n    GL::Renderer::setDepthFunction(GL::Renderer::DepthFunction::LessOrEqual);\n    GL::Renderer::setBlendEquation(GL::Renderer::BlendEquation::Add,\n        GL::Renderer::BlendEquation::Add);\n    GL::Renderer::setBlendFunction(GL::Renderer::BlendFunction::One,\n        GL::Renderer::BlendFunction::OneMinusSourceAlpha);\n    GL::Renderer::enable(GL::Renderer::Feature::Blending);\n\n    \/* Setup the cube with vertex color *\/\n    {\n        const Deg hue = 360.0_degf\/8;\n        const struct {\n            Vector3 position;\n            Color3 color;\n        } cubeVertices[] {\n            \/* front *\/\n            {{-1.0f, -1.0f,  1.0f}, Color3::fromHsv({hue*1.0f, 0.666f, 1.0f})},\n            {{ 1.0f, -1.0f,  1.0f}, Color3::fromHsv({hue*2.0f, 0.666f, 1.0f})},\n            {{ 1.0f,  1.0f,  1.0f}, Color3::fromHsv({hue*3.0f, 0.666f, 1.0f})},\n            {{-1.0f,  1.0f,  1.0f}, Color3::fromHsv({hue*4.0f, 0.666f, 1.0f})},\n\n            \/* back *\/\n            {{-1.0f, -1.0f, -1.0f}, Color3::fromHsv({hue*5.0f, 0.666f, 1.0f})},\n            {{ 1.0f, -1.0f, -1.0f}, Color3::fromHsv({hue*6.0f, 0.666f, 1.0f})},\n            {{ 1.0f,  1.0f, -1.0f}, Color3::fromHsv({hue*7.0f, 0.666f, 1.0f})},\n            {{-1.0f,  1.0f, -1.0f}, Color3::fromHsv({hue*8.0f, 0.666f, 1.0f})}\n        };\n\n        UnsignedByte cubeIndices[]{\n            \/* front *\/\n            0, 1, 2, 2, 3, 0,\n            \/* right *\/\n            1, 5, 6, 6, 2, 1,\n            \/* back *\/\n            7, 6, 5, 5, 4, 7,\n            \/* left *\/\n            4, 0, 3, 3, 7, 4,\n            \/* bottom *\/\n            4, 5, 1, 1, 0, 4,\n            \/* top *\/\n            3, 2, 6, 6, 7, 3\n        };\n\n        _mesh = GL::Mesh{};\n        _mesh.setCount(Containers::arraySize(cubeIndices))\n            .addVertexBuffer(GL::Buffer{cubeVertices}, 0,\n                Shaders::VertexColor3D::Position{},\n                Shaders::VertexColor3D::Color3{})\n            .setIndexBuffer(GL::Buffer{cubeIndices}, 0,\n                MeshIndexType::UnsignedByte);\n\n        _shader = Shaders::VertexColor3D{};\n        _wireframeShader = Shaders::MeshVisualizer{Shaders::MeshVisualizer::Flag::Wireframe};\n        _wireframeShader.setViewportSize(Vector2{framebufferSize()})\n            .setColor(0x00000000_rgbaf)\n            .setWireframeColor(0x000000ff_rgbaf);\n        new VertexColorDrawable{*(new Object3D{&_scene}),\n            _shader, _wireframeShader, _mesh, _drawables};\n    }\n\n    \/* Set up the camera *\/\n    {\n        \/* Setup the arcball after the camera objects *\/\n        const Vector3 eye = Vector3::zAxis(-10.0f);\n        const Vector3 center{};\n        const Vector3 up = Vector3::yAxis();\n        _arcballCamera.emplace(_scene, eye, center, up, 45.0_degf,\n            windowSize(), framebufferSize());\n    }\n\n    \/* Start the timer, loop at 60 Hz max *\/\n    setSwapInterval(1);\n    setMinimalLoopPeriod(16);\n}\n\nvoid ArcBallExample::drawEvent() {\n    GL::defaultFramebuffer.clear(\n        GL::FramebufferClear::Color|GL::FramebufferClear::Depth);\n\n    \/* Call arcball update in every frame. This will do nothing if the camera\n       has not been changed. Otherwise, camera transformation will be\n       propagated into the camera objects. *\/\n    bool camChanged = _arcballCamera->update();\n    _arcballCamera->draw(_drawables);\n    swapBuffers();\n\n    if(camChanged) redraw();\n}\n\nvoid ArcBallExample::viewportEvent(ViewportEvent& event) {\n    GL::defaultFramebuffer.setViewport({{}, event.framebufferSize()});\n\n    _arcballCamera->reshape(event.windowSize(), event.framebufferSize());\n    _wireframeShader.setViewportSize(Vector2{framebufferSize()});\n}\n\nvoid ArcBallExample::keyPressEvent(KeyEvent& event) {\n    switch(event.key()) {\n        case KeyEvent::Key::L:\n            if(_arcballCamera->lagging() > 0.0f) {\n                Debug{} << \"Lagging disabled\";\n                _arcballCamera->setLagging(0.0f);\n            } else {\n                Debug{} << \"Lagging enabled\";\n                _arcballCamera->setLagging(0.85f);\n            }\n            break;\n        case KeyEvent::Key::R:\n            _arcballCamera->reset();\n            break;\n\n        default: return;\n    }\n\n    event.setAccepted();\n    redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mousePressEvent(MouseEvent& event) {\n    \/* Enable mouse capture so the mouse can drag outside of the window *\/\n    \/** @todo replace once https:\/\/github.com\/mosra\/magnum\/pull\/419 is in *\/\n    SDL_CaptureMouse(SDL_TRUE);\n\n    _arcballCamera->initTransformation(event.position());\n\n    event.setAccepted();\n    redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mouseReleaseEvent(MouseEvent&) {\n    \/* Disable mouse capture again *\/\n    \/** @todo replace once https:\/\/github.com\/mosra\/magnum\/pull\/419 is in *\/\n    SDL_CaptureMouse(SDL_FALSE);\n}\n\nvoid ArcBallExample::mouseMoveEvent(MouseMoveEvent& event) {\n    if(!event.buttons()) return;\n\n    if(event.modifiers() & MouseMoveEvent::Modifier::Shift)\n        _arcballCamera->translate(event.position());\n    else _arcballCamera->rotate(event.position());\n\n    event.setAccepted();\n    redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mouseScrollEvent(MouseScrollEvent& event) {\n    const Float delta = event.offset().y();\n    if(Math::abs(delta) < 1.0e-2f) return;\n\n    _arcballCamera->zoom(delta);\n\n    event.setAccepted();\n    redraw(); \/* camera has changed, redraw! *\/\n}\n\n}}\n\nMAGNUM_APPLICATION_MAIN(Magnum::Examples::ArcBallExample)\n<commit_msg>arcball: adapt to Magnum changes.<commit_after>\/*\n    This file is part of Magnum.\n\n    Original authors — credit is appreciated but not required:\n\n        2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019 —\n            Vladimír Vondruš <mosra@centrum.cz>\n        2020 — Nghia Truong <nghiatruong.vn@gmail.com>\n\n    This is free and unencumbered software released into the public domain.\n\n    Anyone is free to copy, modify, publish, use, compile, sell, or distribute\n    this software, either in source code form or as a compiled binary, for any\n    purpose, commercial or non-commercial, and by any means.\n\n    In jurisdictions that recognize copyright laws, the author or authors of\n    this software dedicate any and all copyright interest in the software to\n    the public domain. We make this dedication for the benefit of the public\n    at large and to the detriment of our heirs and successors. We intend this\n    dedication to be an overt act of relinquishment in perpetuity of all\n    present and future rights to this software under copyright law.\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 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#include <Corrade\/Containers\/Optional.h>\n#include <Magnum\/Mesh.h>\n#include <Magnum\/GL\/Buffer.h>\n#include <Magnum\/GL\/DefaultFramebuffer.h>\n#include <Magnum\/GL\/Mesh.h>\n#include <Magnum\/GL\/Renderer.h>\n#include <Magnum\/Math\/Color.h>\n#include <Magnum\/Math\/Matrix4.h>\n#include <Magnum\/Platform\/Sdl2Application.h>\n#include <Magnum\/SceneGraph\/Camera.h>\n#include <Magnum\/SceneGraph\/Drawable.h>\n#include <Magnum\/SceneGraph\/MatrixTransformation3D.h>\n#include <Magnum\/SceneGraph\/Object.h>\n#include <Magnum\/SceneGraph\/Scene.h>\n#include <Magnum\/Shaders\/VertexColor.h>\n#include <Magnum\/Shaders\/MeshVisualizer.h>\n\n#include \"ArcBall.h\"\n#include \"ArcBallCamera.h\"\n\nnamespace Magnum { namespace Examples {\n\nusing Object3D = SceneGraph::Object<SceneGraph::MatrixTransformation3D>;\nusing Scene3D = SceneGraph::Scene<SceneGraph::MatrixTransformation3D>;\n\nusing namespace Math::Literals;\n\nclass ArcBallExample: public Platform::Application {\n    public:\n        explicit ArcBallExample(const Arguments& arguments);\n\n    private:\n        void drawEvent() override;\n        void viewportEvent(ViewportEvent& event) override;\n        void keyPressEvent(KeyEvent& event) override;\n        void mousePressEvent(MouseEvent& event) override;\n        void mouseReleaseEvent(MouseEvent& event) override;\n        void mouseMoveEvent(MouseMoveEvent& event) override;\n        void mouseScrollEvent(MouseScrollEvent& event) override;\n\n        Scene3D _scene;\n        SceneGraph::DrawableGroup3D _drawables;\n        GL::Mesh _mesh{NoCreate};\n        Shaders::VertexColor3D _shader{NoCreate};\n        Shaders::MeshVisualizer3D _wireframeShader{NoCreate};\n        Containers::Optional<ArcBallCamera> _arcballCamera;\n};\n\nclass VertexColorDrawable: public SceneGraph::Drawable3D {\n    public:\n        explicit VertexColorDrawable(Object3D& object,\n            Shaders::VertexColor3D& shader,\n            Shaders::MeshVisualizer3D& wireframeShader, GL::Mesh& mesh,\n            SceneGraph::DrawableGroup3D& drawables):\n                SceneGraph::Drawable3D{object, &drawables}, _shader(shader),\n                _wireframeShader(wireframeShader), _mesh(mesh) {}\n\n        void draw(const Matrix4& transformation, SceneGraph::Camera3D& camera) {\n            _shader\n                .setTransformationProjectionMatrix(\n                    camera.projectionMatrix()*transformation)\n                .draw(_mesh);\n            _wireframeShader\n                .setTransformationMatrix(transformation)\n                .setProjectionMatrix(camera.projectionMatrix())\n                .draw(_mesh);\n        }\n\n    private:\n        Shaders::VertexColor3D& _shader;\n        Shaders::MeshVisualizer3D& _wireframeShader;\n        GL::Mesh& _mesh;\n};\n\nArcBallExample::ArcBallExample(const Arguments& arguments) :\n    Platform::Application{arguments, NoCreate}\n{\n    \/* Setup window *\/\n    {\n        const Vector2 dpiScaling = this->dpiScaling({});\n        Configuration conf;\n        conf.setTitle(\"Magnum ArcBall Camera Example\")\n            .setSize(conf.size(), dpiScaling)\n            .setWindowFlags(Configuration::WindowFlag::Resizable);\n        GLConfiguration glConf;\n        glConf.setSampleCount(dpiScaling.max() < 2.0f ? 8 : 2);\n        if(!tryCreate(conf, glConf)) {\n            create(conf, glConf.setSampleCount(0));\n        }\n    }\n\n    GL::Renderer::enable(GL::Renderer::Feature::DepthTest);\n    GL::Renderer::enable(GL::Renderer::Feature::FaceCulling);\n\n    \/* For cube wireframe vizualization *\/\n    GL::Renderer::setDepthFunction(GL::Renderer::DepthFunction::LessOrEqual);\n    GL::Renderer::setBlendEquation(GL::Renderer::BlendEquation::Add,\n        GL::Renderer::BlendEquation::Add);\n    GL::Renderer::setBlendFunction(GL::Renderer::BlendFunction::One,\n        GL::Renderer::BlendFunction::OneMinusSourceAlpha);\n    GL::Renderer::enable(GL::Renderer::Feature::Blending);\n\n    \/* Setup the cube with vertex color *\/\n    {\n        const Deg hue = 360.0_degf\/8;\n        const struct {\n            Vector3 position;\n            Color3 color;\n        } cubeVertices[] {\n            \/* front *\/\n            {{-1.0f, -1.0f,  1.0f}, Color3::fromHsv({hue*1.0f, 0.666f, 1.0f})},\n            {{ 1.0f, -1.0f,  1.0f}, Color3::fromHsv({hue*2.0f, 0.666f, 1.0f})},\n            {{ 1.0f,  1.0f,  1.0f}, Color3::fromHsv({hue*3.0f, 0.666f, 1.0f})},\n            {{-1.0f,  1.0f,  1.0f}, Color3::fromHsv({hue*4.0f, 0.666f, 1.0f})},\n\n            \/* back *\/\n            {{-1.0f, -1.0f, -1.0f}, Color3::fromHsv({hue*5.0f, 0.666f, 1.0f})},\n            {{ 1.0f, -1.0f, -1.0f}, Color3::fromHsv({hue*6.0f, 0.666f, 1.0f})},\n            {{ 1.0f,  1.0f, -1.0f}, Color3::fromHsv({hue*7.0f, 0.666f, 1.0f})},\n            {{-1.0f,  1.0f, -1.0f}, Color3::fromHsv({hue*8.0f, 0.666f, 1.0f})}\n        };\n\n        UnsignedByte cubeIndices[]{\n            \/* front *\/\n            0, 1, 2, 2, 3, 0,\n            \/* right *\/\n            1, 5, 6, 6, 2, 1,\n            \/* back *\/\n            7, 6, 5, 5, 4, 7,\n            \/* left *\/\n            4, 0, 3, 3, 7, 4,\n            \/* bottom *\/\n            4, 5, 1, 1, 0, 4,\n            \/* top *\/\n            3, 2, 6, 6, 7, 3\n        };\n\n        _mesh = GL::Mesh{};\n        _mesh.setCount(Containers::arraySize(cubeIndices))\n            .addVertexBuffer(GL::Buffer{cubeVertices}, 0,\n                Shaders::VertexColor3D::Position{},\n                Shaders::VertexColor3D::Color3{})\n            .setIndexBuffer(GL::Buffer{cubeIndices}, 0,\n                MeshIndexType::UnsignedByte);\n\n        _shader = Shaders::VertexColor3D{};\n        _wireframeShader = Shaders::MeshVisualizer3D{Shaders::MeshVisualizer3D::Flag::Wireframe};\n        _wireframeShader.setViewportSize(Vector2{framebufferSize()})\n            .setColor(0x00000000_rgbaf)\n            .setWireframeColor(0x000000ff_rgbaf);\n        new VertexColorDrawable{*(new Object3D{&_scene}),\n            _shader, _wireframeShader, _mesh, _drawables};\n    }\n\n    \/* Set up the camera *\/\n    {\n        \/* Setup the arcball after the camera objects *\/\n        const Vector3 eye = Vector3::zAxis(-10.0f);\n        const Vector3 center{};\n        const Vector3 up = Vector3::yAxis();\n        _arcballCamera.emplace(_scene, eye, center, up, 45.0_degf,\n            windowSize(), framebufferSize());\n    }\n\n    \/* Start the timer, loop at 60 Hz max *\/\n    setSwapInterval(1);\n    setMinimalLoopPeriod(16);\n}\n\nvoid ArcBallExample::drawEvent() {\n    GL::defaultFramebuffer.clear(\n        GL::FramebufferClear::Color|GL::FramebufferClear::Depth);\n\n    \/* Call arcball update in every frame. This will do nothing if the camera\n       has not been changed. Otherwise, camera transformation will be\n       propagated into the camera objects. *\/\n    bool camChanged = _arcballCamera->update();\n    _arcballCamera->draw(_drawables);\n    swapBuffers();\n\n    if(camChanged) redraw();\n}\n\nvoid ArcBallExample::viewportEvent(ViewportEvent& event) {\n    GL::defaultFramebuffer.setViewport({{}, event.framebufferSize()});\n\n    _arcballCamera->reshape(event.windowSize(), event.framebufferSize());\n    _wireframeShader.setViewportSize(Vector2{framebufferSize()});\n}\n\nvoid ArcBallExample::keyPressEvent(KeyEvent& event) {\n    switch(event.key()) {\n        case KeyEvent::Key::L:\n            if(_arcballCamera->lagging() > 0.0f) {\n                Debug{} << \"Lagging disabled\";\n                _arcballCamera->setLagging(0.0f);\n            } else {\n                Debug{} << \"Lagging enabled\";\n                _arcballCamera->setLagging(0.85f);\n            }\n            break;\n        case KeyEvent::Key::R:\n            _arcballCamera->reset();\n            break;\n\n        default: return;\n    }\n\n    event.setAccepted();\n    redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mousePressEvent(MouseEvent& event) {\n    \/* Enable mouse capture so the mouse can drag outside of the window *\/\n    \/** @todo replace once https:\/\/github.com\/mosra\/magnum\/pull\/419 is in *\/\n    SDL_CaptureMouse(SDL_TRUE);\n\n    _arcballCamera->initTransformation(event.position());\n\n    event.setAccepted();\n    redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mouseReleaseEvent(MouseEvent&) {\n    \/* Disable mouse capture again *\/\n    \/** @todo replace once https:\/\/github.com\/mosra\/magnum\/pull\/419 is in *\/\n    SDL_CaptureMouse(SDL_FALSE);\n}\n\nvoid ArcBallExample::mouseMoveEvent(MouseMoveEvent& event) {\n    if(!event.buttons()) return;\n\n    if(event.modifiers() & MouseMoveEvent::Modifier::Shift)\n        _arcballCamera->translate(event.position());\n    else _arcballCamera->rotate(event.position());\n\n    event.setAccepted();\n    redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mouseScrollEvent(MouseScrollEvent& event) {\n    const Float delta = event.offset().y();\n    if(Math::abs(delta) < 1.0e-2f) return;\n\n    _arcballCamera->zoom(delta);\n\n    event.setAccepted();\n    redraw(); \/* camera has changed, redraw! *\/\n}\n\n}}\n\nMAGNUM_APPLICATION_MAIN(Magnum::Examples::ArcBallExample)\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- ExecutionEngineTest.cpp - Unit tests for ExecutionEngine -----------===\/\/\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 \"llvm\/ExecutionEngine\/Interpreter.h\"\n#include \"llvm\/IR\/DerivedTypes.h\"\n#include \"llvm\/IR\/GlobalVariable.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nclass ExecutionEngineTest : public testing::Test {\nprotected:\n  ExecutionEngineTest() {\n    auto Owner = make_unique<Module>(\"<main>\", getGlobalContext());\n    M = Owner.get();\n    Engine.reset(EngineBuilder(std::move(Owner)).setErrorStr(&Error).create());\n  }\n\n  virtual void SetUp() {\n    ASSERT_TRUE(Engine.get() != nullptr) << \"EngineBuilder returned error: '\"\n      << Error << \"'\";\n  }\n\n  GlobalVariable *NewExtGlobal(Type *T, const Twine &Name) {\n    return new GlobalVariable(*M, T, false,  \/\/ Not constant.\n                              GlobalValue::ExternalLinkage, nullptr, Name);\n  }\n\n  std::string Error;\n  Module *M;  \/\/ Owned by ExecutionEngine.\n  std::unique_ptr<ExecutionEngine> Engine;\n};\n\nTEST_F(ExecutionEngineTest, ForwardGlobalMapping) {\n  GlobalVariable *G1 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n  int32_t Mem1 = 3;\n  Engine->addGlobalMapping(G1, &Mem1);\n  EXPECT_EQ(&Mem1, Engine->getPointerToGlobalIfAvailable(G1));\n  int32_t Mem2 = 4;\n  Engine->updateGlobalMapping(G1, &Mem2);\n  EXPECT_EQ(&Mem2, Engine->getPointerToGlobalIfAvailable(G1));\n  Engine->updateGlobalMapping(G1, nullptr);\n  EXPECT_EQ(nullptr, Engine->getPointerToGlobalIfAvailable(G1));\n  Engine->updateGlobalMapping(G1, &Mem2);\n  EXPECT_EQ(&Mem2, Engine->getPointerToGlobalIfAvailable(G1));\n\n  GlobalVariable *G2 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n  EXPECT_EQ(nullptr, Engine->getPointerToGlobalIfAvailable(G2))\n    << \"The NULL return shouldn't depend on having called\"\n    << \" updateGlobalMapping(..., NULL)\";\n  \/\/ Check that update...() can be called before add...().\n  Engine->updateGlobalMapping(G2, &Mem1);\n  EXPECT_EQ(&Mem1, Engine->getPointerToGlobalIfAvailable(G2));\n  EXPECT_EQ(&Mem2, Engine->getPointerToGlobalIfAvailable(G1))\n    << \"A second mapping shouldn't affect the first.\";\n}\n\nTEST_F(ExecutionEngineTest, ReverseGlobalMapping) {\n  GlobalVariable *G1 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n\n  int32_t Mem1 = 3;\n  Engine->addGlobalMapping(G1, &Mem1);\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem1));\n  int32_t Mem2 = 4;\n  Engine->updateGlobalMapping(G1, &Mem2);\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem1));\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem2));\n\n  GlobalVariable *G2 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global2\");\n  Engine->updateGlobalMapping(G2, &Mem1);\n  EXPECT_EQ(G2, Engine->getGlobalValueAtAddress(&Mem1));\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem2));\n  Engine->updateGlobalMapping(G1, nullptr);\n  EXPECT_EQ(G2, Engine->getGlobalValueAtAddress(&Mem1))\n    << \"Removing one mapping doesn't affect a different one.\";\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem2));\n  Engine->updateGlobalMapping(G2, &Mem2);\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem1));\n  EXPECT_EQ(G2, Engine->getGlobalValueAtAddress(&Mem2))\n    << \"Once a mapping is removed, we can point another GV at the\"\n    << \" now-free address.\";\n}\n\nTEST_F(ExecutionEngineTest, ClearModuleMappings) {\n  GlobalVariable *G1 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n\n  int32_t Mem1 = 3;\n  Engine->addGlobalMapping(G1, &Mem1);\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem1));\n\n  Engine->clearGlobalMappingsFromModule(M);\n\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem1));\n\n  GlobalVariable *G2 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global2\");\n  \/\/ After clearing the module mappings, we can assign a new GV to the\n  \/\/ same address.\n  Engine->addGlobalMapping(G2, &Mem1);\n  EXPECT_EQ(G2, Engine->getGlobalValueAtAddress(&Mem1));\n}\n\nTEST_F(ExecutionEngineTest, DestructionRemovesGlobalMapping) {\n  GlobalVariable *G1 =\n    NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n  int32_t Mem1 = 3;\n  Engine->addGlobalMapping(G1, &Mem1);\n  \/\/ Make sure the reverse mapping is enabled.\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem1));\n  \/\/ When the GV goes away, the ExecutionEngine should remove any\n  \/\/ mappings that refer to it.\n  G1->eraseFromParent();\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem1));\n}\n\n}\n<commit_msg>ExecutionEngineTests: Call llvm_shutdown() on exit for ManagedStatic introduced in r218151.<commit_after>\/\/===- ExecutionEngineTest.cpp - Unit tests for ExecutionEngine -----------===\/\/\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 \"llvm\/ExecutionEngine\/Interpreter.h\"\n#include \"llvm\/IR\/DerivedTypes.h\"\n#include \"llvm\/IR\/GlobalVariable.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nstatic llvm_shutdown_obj Y; \/\/ Call llvm_shutdown() on exit.\n\nnamespace {\n\nclass ExecutionEngineTest : public testing::Test {\nprotected:\n  ExecutionEngineTest() {\n    auto Owner = make_unique<Module>(\"<main>\", getGlobalContext());\n    M = Owner.get();\n    Engine.reset(EngineBuilder(std::move(Owner)).setErrorStr(&Error).create());\n  }\n\n  virtual void SetUp() {\n    ASSERT_TRUE(Engine.get() != nullptr) << \"EngineBuilder returned error: '\"\n      << Error << \"'\";\n  }\n\n  GlobalVariable *NewExtGlobal(Type *T, const Twine &Name) {\n    return new GlobalVariable(*M, T, false,  \/\/ Not constant.\n                              GlobalValue::ExternalLinkage, nullptr, Name);\n  }\n\n  std::string Error;\n  Module *M;  \/\/ Owned by ExecutionEngine.\n  std::unique_ptr<ExecutionEngine> Engine;\n};\n\nTEST_F(ExecutionEngineTest, ForwardGlobalMapping) {\n  GlobalVariable *G1 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n  int32_t Mem1 = 3;\n  Engine->addGlobalMapping(G1, &Mem1);\n  EXPECT_EQ(&Mem1, Engine->getPointerToGlobalIfAvailable(G1));\n  int32_t Mem2 = 4;\n  Engine->updateGlobalMapping(G1, &Mem2);\n  EXPECT_EQ(&Mem2, Engine->getPointerToGlobalIfAvailable(G1));\n  Engine->updateGlobalMapping(G1, nullptr);\n  EXPECT_EQ(nullptr, Engine->getPointerToGlobalIfAvailable(G1));\n  Engine->updateGlobalMapping(G1, &Mem2);\n  EXPECT_EQ(&Mem2, Engine->getPointerToGlobalIfAvailable(G1));\n\n  GlobalVariable *G2 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n  EXPECT_EQ(nullptr, Engine->getPointerToGlobalIfAvailable(G2))\n    << \"The NULL return shouldn't depend on having called\"\n    << \" updateGlobalMapping(..., NULL)\";\n  \/\/ Check that update...() can be called before add...().\n  Engine->updateGlobalMapping(G2, &Mem1);\n  EXPECT_EQ(&Mem1, Engine->getPointerToGlobalIfAvailable(G2));\n  EXPECT_EQ(&Mem2, Engine->getPointerToGlobalIfAvailable(G1))\n    << \"A second mapping shouldn't affect the first.\";\n}\n\nTEST_F(ExecutionEngineTest, ReverseGlobalMapping) {\n  GlobalVariable *G1 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n\n  int32_t Mem1 = 3;\n  Engine->addGlobalMapping(G1, &Mem1);\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem1));\n  int32_t Mem2 = 4;\n  Engine->updateGlobalMapping(G1, &Mem2);\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem1));\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem2));\n\n  GlobalVariable *G2 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global2\");\n  Engine->updateGlobalMapping(G2, &Mem1);\n  EXPECT_EQ(G2, Engine->getGlobalValueAtAddress(&Mem1));\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem2));\n  Engine->updateGlobalMapping(G1, nullptr);\n  EXPECT_EQ(G2, Engine->getGlobalValueAtAddress(&Mem1))\n    << \"Removing one mapping doesn't affect a different one.\";\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem2));\n  Engine->updateGlobalMapping(G2, &Mem2);\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem1));\n  EXPECT_EQ(G2, Engine->getGlobalValueAtAddress(&Mem2))\n    << \"Once a mapping is removed, we can point another GV at the\"\n    << \" now-free address.\";\n}\n\nTEST_F(ExecutionEngineTest, ClearModuleMappings) {\n  GlobalVariable *G1 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n\n  int32_t Mem1 = 3;\n  Engine->addGlobalMapping(G1, &Mem1);\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem1));\n\n  Engine->clearGlobalMappingsFromModule(M);\n\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem1));\n\n  GlobalVariable *G2 =\n      NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global2\");\n  \/\/ After clearing the module mappings, we can assign a new GV to the\n  \/\/ same address.\n  Engine->addGlobalMapping(G2, &Mem1);\n  EXPECT_EQ(G2, Engine->getGlobalValueAtAddress(&Mem1));\n}\n\nTEST_F(ExecutionEngineTest, DestructionRemovesGlobalMapping) {\n  GlobalVariable *G1 =\n    NewExtGlobal(Type::getInt32Ty(getGlobalContext()), \"Global1\");\n  int32_t Mem1 = 3;\n  Engine->addGlobalMapping(G1, &Mem1);\n  \/\/ Make sure the reverse mapping is enabled.\n  EXPECT_EQ(G1, Engine->getGlobalValueAtAddress(&Mem1));\n  \/\/ When the GV goes away, the ExecutionEngine should remove any\n  \/\/ mappings that refer to it.\n  G1->eraseFromParent();\n  EXPECT_EQ(nullptr, Engine->getGlobalValueAtAddress(&Mem1));\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\n#include <iostream>\n#include <cstdlib>\n#include \"drake\/systems\/plants\/RigidBodyTree.h\"\n\nusing namespace std;\n\nint main(int argc, char* argv[]) {\n  if (argc < 2) {\n    cerr << \"Usage: urdfCollisionTest urdf_filename\" << endl;\n    exit(-1);\n  }\n  RigidBodyTree* model = new RigidBodyTree(argv[1]);\n  if (!model) {\n    cerr << \"ERROR: Failed to load model from \" << argv[1] << endl;\n    return -1;\n  }\n\n  \/\/ run kinematics with second derivatives 100 times\n  Eigen::VectorXd q = model->getZeroConfiguration();\n  int i;\n\n  if (argc >= 2 + model->num_positions) {\n    for (i = 0; i < model->num_positions; i++)\n      sscanf(argv[2 + i], \"%lf\", &q(i));\n  }\n\n  \/\/ for (i=0; i<model->num_dof; i++)\n  \/\/ \t q(i)=(double)rand() \/ RAND_MAX;\n  KinematicsCache<double> cache = model->doKinematics(q);\n  \/\/  }\n\n  Eigen::VectorXd phi;\n  Eigen::Matrix3Xd normal, xA, xB;\n  vector<int> bodyA_idx, bodyB_idx;\n\n  model->collisionDetect(cache, phi, normal, xA, xB, bodyA_idx, bodyB_idx);\n\n  cout << \"=======\" << endl;\n  for (int j = 0; j < phi.rows(); ++j) {\n    cout << phi(j) << \" \";\n    for (int i = 0; i < 3; ++i) {\n      cout << normal(i, j) << \" \";\n    }\n    for (int i = 0; i < 3; ++i) {\n      cout << xA(i, j) << \" \";\n    }\n    for (int i = 0; i < 3; ++i) {\n      cout << xB(i, j) << \" \";\n    }\n    cout << model->bodies[bodyA_idx.at(j)]->linkname << \" \";\n    cout << model->bodies[bodyB_idx.at(j)]->linkname << endl;\n  }\n\n  delete model;\n  return 0;\n}\n<commit_msg>Remove literal tabs from urdfCollisionTest.cpp.<commit_after>\n\n#include <iostream>\n#include <cstdlib>\n#include \"drake\/systems\/plants\/RigidBodyTree.h\"\n\nusing namespace std;\n\nint main(int argc, char* argv[]) {\n  if (argc < 2) {\n    cerr << \"Usage: urdfCollisionTest urdf_filename\" << endl;\n    exit(-1);\n  }\n  RigidBodyTree* model = new RigidBodyTree(argv[1]);\n  if (!model) {\n    cerr << \"ERROR: Failed to load model from \" << argv[1] << endl;\n    return -1;\n  }\n\n  \/\/ run kinematics with second derivatives 100 times\n  Eigen::VectorXd q = model->getZeroConfiguration();\n  int i;\n\n  if (argc >= 2 + model->num_positions) {\n    for (i = 0; i < model->num_positions; i++)\n      sscanf(argv[2 + i], \"%lf\", &q(i));\n  }\n\n  \/\/ for (i=0; i<model->num_dof; i++)\n  \/\/   q(i)=(double)rand() \/ RAND_MAX;\n  KinematicsCache<double> cache = model->doKinematics(q);\n  \/\/  }\n\n  Eigen::VectorXd phi;\n  Eigen::Matrix3Xd normal, xA, xB;\n  vector<int> bodyA_idx, bodyB_idx;\n\n  model->collisionDetect(cache, phi, normal, xA, xB, bodyA_idx, bodyB_idx);\n\n  cout << \"=======\" << endl;\n  for (int j = 0; j < phi.rows(); ++j) {\n    cout << phi(j) << \" \";\n    for (int i = 0; i < 3; ++i) {\n      cout << normal(i, j) << \" \";\n    }\n    for (int i = 0; i < 3; ++i) {\n      cout << xA(i, j) << \" \";\n    }\n    for (int i = 0; i < 3; ++i) {\n      cout << xB(i, j) << \" \";\n    }\n    cout << model->bodies[bodyA_idx.at(j)]->linkname << \" \";\n    cout << model->bodies[bodyB_idx.at(j)]->linkname << endl;\n  }\n\n  delete model;\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2013-2019 Couchbase, 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 \"internal.h\"\n#include \"clconfig.h\"\n#include <lcbio\/lcbio.h>\n#include <lcbio\/timer-ng.h>\n#include <lcbio\/timer-cxx.h>\n#include <fstream>\n#include <iostream>\n#include <istream>\n#include <cstring>\n\n#define CONFIG_CACHE_MAGIC \"{{{fb85b563d0a8f65fa8d3d58f1b3a0708}}}\"\n\n#define LOGARGS(pb, lvl) static_cast< Provider * >(pb)->parent->settings, \"bc_file\", LCB_LOG_##lvl, __FILE__, __LINE__\n#define LOGFMT \"(cache=%s) \"\n#define LOGID(fb) fb->filename.c_str()\n\nusing namespace lcb::clconfig;\n\nstruct FileProvider : Provider, Listener {\n    FileProvider(Confmon *confmon);\n    ~FileProvider();\n\n    enum Status { CACHE_ERROR, NO_CHANGES, UPDATED };\n    Status load_cache();\n    void reload_cache();\n    void maybe_remove_file()\n    {\n        if (!is_readonly && !filename.empty()) {\n            remove(filename.c_str());\n        }\n    }\n    void write_cache(lcbvb_CONFIG *vbc);\n\n    \/* Overrides *\/\n    ConfigInfo *get_cached();\n    lcb_STATUS refresh();\n    void dump(FILE *) const;\n    void clconfig_lsn(EventType, ConfigInfo *);\n\n    std::string filename;\n    ConfigInfo *config;\n    time_t last_mtime;\n    int last_errno;\n    bool is_readonly; \/* Whether the config cache should _not_ overwrite the file *\/\n    lcb::io::Timer< FileProvider, &FileProvider::reload_cache > timer;\n};\n\nFileProvider::Status FileProvider::load_cache()\n{\n    if (filename.empty()) {\n        return CACHE_ERROR;\n    }\n\n    std::ifstream ifs(filename.c_str(), std::ios::in | std::ios::binary | std::ios::ate);\n\n    if (!ifs.is_open() || !ifs.good()) {\n        int save_errno = last_errno = errno;\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Couldn't open for reading: %s\", LOGID(this), strerror(save_errno));\n        return CACHE_ERROR;\n    }\n\n    struct stat st;\n    if (stat(filename.c_str(), &st)) {\n        last_errno = errno;\n        return CACHE_ERROR;\n    }\n\n    if (last_mtime == st.st_mtime) {\n        lcb_log(LOGARGS(this, DEBUG), LOGFMT \"Modification time too old\", LOGID(this));\n        return NO_CHANGES;\n    }\n\n    size_t fsize = ifs.tellg();\n    if (!fsize) {\n        lcb_log(LOGARGS(this, WARN), LOGFMT \"File '%s' is empty\", LOGID(this), filename.c_str());\n        return CACHE_ERROR;\n    }\n    ifs.seekg(0, std::ios::beg);\n    std::vector< char > buf(fsize);\n    ifs.read(&buf[0], fsize);\n    buf.push_back(0); \/\/ NUL termination\n\n    char *end = std::strstr(&buf[0], CONFIG_CACHE_MAGIC);\n    if (end == NULL) {\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Couldn't find magic\", LOGID(this));\n        maybe_remove_file();\n        return CACHE_ERROR;\n    }\n    *end = '\\0'; \/\/ Stop parsing at MAGIC\n\n    lcbvb_CONFIG *vbc = lcbvb_create();\n    if (vbc == NULL) {\n        return CACHE_ERROR;\n    }\n\n    Status status = CACHE_ERROR;\n\n    if (lcbvb_load_json(vbc, &buf[0]) != 0) {\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Couldn't parse configuration\", LOGID(this));\n        lcb_log_badconfig(LOGARGS(this, ERROR), vbc, &buf[0]);\n        maybe_remove_file();\n        goto GT_DONE;\n    }\n\n    if (lcbvb_get_distmode(vbc) != LCBVB_DIST_VBUCKET) {\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Not applying cached memcached config\", LOGID(this));\n        goto GT_DONE;\n    }\n\n    if (strcmp(vbc->bname, settings().bucket) != 0) {\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Bucket name in file is different from the one requested\", LOGID(this));\n        goto GT_DONE;\n    }\n\n    if (config) {\n        config->decref();\n    }\n\n    config = ConfigInfo::create(vbc, CLCONFIG_FILE);\n    last_mtime = st.st_mtime;\n\n    status = UPDATED;\n    vbc = NULL;\n\nGT_DONE:\n    if (vbc != NULL) {\n        lcbvb_destroy(vbc);\n    }\n    return status;\n}\n\nvoid FileProvider::write_cache(lcbvb_CONFIG *cfg)\n{\n    if (filename.empty() || is_readonly) {\n        return;\n    }\n\n    std::ofstream ofs(filename.c_str(), std::ios::trunc);\n    if (ofs.good()) {\n        lcb_log(LOGARGS(this, INFO), LOGFMT \"Writing configuration to file\", LOGID(this));\n        char *json = lcbvb_save_json(cfg);\n        ofs << json;\n        ofs << CONFIG_CACHE_MAGIC;\n        free(json);\n    } else {\n        int save_errno = errno;\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Couldn't open file for writing: %s\", LOGID(this), strerror(save_errno));\n    }\n}\n\nConfigInfo *FileProvider::get_cached()\n{\n    return filename.empty() ? NULL : config;\n}\n\nvoid FileProvider::reload_cache()\n{\n    if (load_cache() == UPDATED) {\n        parent->provider_got_config(this, config);\n    } else {\n        parent->provider_failed(this, LCB_ERROR);\n    }\n}\n\nlcb_STATUS FileProvider::refresh()\n{\n    if (!timer.is_armed()) {\n        timer.signal();\n    }\n    return LCB_SUCCESS;\n}\n\nFileProvider::~FileProvider()\n{\n    timer.release();\n    if (config) {\n        config->decref();\n    }\n}\n\nvoid FileProvider::clconfig_lsn(EventType event, ConfigInfo *info)\n{\n    if (event != CLCONFIG_EVENT_GOT_NEW_CONFIG) {\n        return;\n    }\n    if (!enabled) {\n        return;\n    }\n\n    if (info->get_origin() == CLCONFIG_PHONY || info->get_origin() == CLCONFIG_FILE) {\n        lcb_log(LOGARGS(this, TRACE), \"Not writing configuration originating from PHONY or FILE to cache\");\n        return;\n    }\n\n    write_cache(info->vbc);\n}\n\nvoid FileProvider::dump(FILE *fp) const\n{\n    fprintf(fp, \"## BEGIN FILE PROVIEDER DUMP ##\\n\");\n    if (!filename.empty()) {\n        fprintf(fp, \"FILENAME: %s\\n\", filename.c_str());\n    }\n    fprintf(fp, \"LAST SYSTEM ERRNO: %d\\n\", last_errno);\n    fprintf(fp, \"LAST MTIME: %lu\\n\", (unsigned long)last_mtime);\n    fprintf(fp, \"## END FILE PROVIDER DUMP ##\\n\");\n}\n\nFileProvider::FileProvider(Confmon *parent_)\n    : Provider(parent_, CLCONFIG_FILE), config(NULL), last_mtime(0), last_errno(0), is_readonly(false),\n      timer(parent_->iot, this)\n{\n    parent->add_listener(this);\n}\n\nstatic std::string mkcachefile(const char *name, const char *bucket)\n{\n    std::string buffer;\n    bool is_dir = false;\n    if (name != NULL) {\n        buffer = std::string(name);\n        if (buffer.back() == '\/') {\n            is_dir = true;\n        }\n    } else {\n        buffer = lcb_get_tmpdir();\n        if (buffer.empty()) {\n            buffer += \".\";\n        }\n        buffer += \"\/\";\n        is_dir = true;\n    }\n    if (is_dir) {\n        \/\/ append bucket name only if we know that\n        \/\/ cachefile is directory\n        buffer += bucket;\n    }\n\n    return buffer;\n}\n\nbool lcb::clconfig::file_set_filename(Provider *p, const char *f, bool ro)\n{\n    FileProvider *provider = static_cast< FileProvider * >(p);\n    provider->enabled = 1;\n    provider->filename = mkcachefile(f, p->parent->settings->bucket);\n    provider->is_readonly = bool(ro);\n\n    if (ro) {\n        FILE *fp_tmp = fopen(provider->filename.c_str(), \"r\");\n        if (!fp_tmp) {\n            lcb_log(LOGARGS(provider, ERROR), LOGFMT \"Couldn't open for reading: %s\", LOGID(provider), strerror(errno));\n            return false;\n        } else {\n            fclose(fp_tmp);\n        }\n    }\n    return true;\n}\n\nconst char *lcb::clconfig::file_get_filename(Provider *p)\n{\n    FileProvider *fp = static_cast< FileProvider * >(p);\n    if (fp->filename.empty()) {\n        return NULL;\n    } else {\n        return fp->filename.c_str();\n    }\n}\n\nvoid lcb::clconfig::file_set_readonly(Provider *p, bool val)\n{\n    static_cast< FileProvider * >(p)->is_readonly = val;\n}\n\nProvider *lcb::clconfig::new_file_provider(Confmon *mon)\n{\n    return new FileProvider(mon);\n}\n<commit_msg>Fix build on CentOS 6<commit_after>\/* -*- Mode: C; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2013-2019 Couchbase, 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 \"internal.h\"\n#include \"clconfig.h\"\n#include <lcbio\/lcbio.h>\n#include <lcbio\/timer-ng.h>\n#include <lcbio\/timer-cxx.h>\n#include <fstream>\n#include <iostream>\n#include <istream>\n#include <cstring>\n\n#define CONFIG_CACHE_MAGIC \"{{{fb85b563d0a8f65fa8d3d58f1b3a0708}}}\"\n\n#define LOGARGS(pb, lvl) static_cast< Provider * >(pb)->parent->settings, \"bc_file\", LCB_LOG_##lvl, __FILE__, __LINE__\n#define LOGFMT \"(cache=%s) \"\n#define LOGID(fb) fb->filename.c_str()\n\nusing namespace lcb::clconfig;\n\nstruct FileProvider : Provider, Listener {\n    FileProvider(Confmon *confmon);\n    ~FileProvider();\n\n    enum Status { CACHE_ERROR, NO_CHANGES, UPDATED };\n    Status load_cache();\n    void reload_cache();\n    void maybe_remove_file()\n    {\n        if (!is_readonly && !filename.empty()) {\n            remove(filename.c_str());\n        }\n    }\n    void write_cache(lcbvb_CONFIG *vbc);\n\n    \/* Overrides *\/\n    ConfigInfo *get_cached();\n    lcb_STATUS refresh();\n    void dump(FILE *) const;\n    void clconfig_lsn(EventType, ConfigInfo *);\n\n    std::string filename;\n    ConfigInfo *config;\n    time_t last_mtime;\n    int last_errno;\n    bool is_readonly; \/* Whether the config cache should _not_ overwrite the file *\/\n    lcb::io::Timer< FileProvider, &FileProvider::reload_cache > timer;\n};\n\nFileProvider::Status FileProvider::load_cache()\n{\n    if (filename.empty()) {\n        return CACHE_ERROR;\n    }\n\n    std::ifstream ifs(filename.c_str(), std::ios::in | std::ios::binary | std::ios::ate);\n\n    if (!ifs.is_open() || !ifs.good()) {\n        int save_errno = last_errno = errno;\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Couldn't open for reading: %s\", LOGID(this), strerror(save_errno));\n        return CACHE_ERROR;\n    }\n\n    struct stat st;\n    if (stat(filename.c_str(), &st)) {\n        last_errno = errno;\n        return CACHE_ERROR;\n    }\n\n    if (last_mtime == st.st_mtime) {\n        lcb_log(LOGARGS(this, DEBUG), LOGFMT \"Modification time too old\", LOGID(this));\n        return NO_CHANGES;\n    }\n\n    size_t fsize = ifs.tellg();\n    if (!fsize) {\n        lcb_log(LOGARGS(this, WARN), LOGFMT \"File '%s' is empty\", LOGID(this), filename.c_str());\n        return CACHE_ERROR;\n    }\n    ifs.seekg(0, std::ios::beg);\n    std::vector< char > buf(fsize);\n    ifs.read(&buf[0], fsize);\n    buf.push_back(0); \/\/ NUL termination\n\n    char *end = std::strstr(&buf[0], CONFIG_CACHE_MAGIC);\n    if (end == NULL) {\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Couldn't find magic\", LOGID(this));\n        maybe_remove_file();\n        return CACHE_ERROR;\n    }\n    *end = '\\0'; \/\/ Stop parsing at MAGIC\n\n    lcbvb_CONFIG *vbc = lcbvb_create();\n    if (vbc == NULL) {\n        return CACHE_ERROR;\n    }\n\n    Status status = CACHE_ERROR;\n\n    if (lcbvb_load_json(vbc, &buf[0]) != 0) {\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Couldn't parse configuration\", LOGID(this));\n        lcb_log_badconfig(LOGARGS(this, ERROR), vbc, &buf[0]);\n        maybe_remove_file();\n        goto GT_DONE;\n    }\n\n    if (lcbvb_get_distmode(vbc) != LCBVB_DIST_VBUCKET) {\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Not applying cached memcached config\", LOGID(this));\n        goto GT_DONE;\n    }\n\n    if (strcmp(vbc->bname, settings().bucket) != 0) {\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Bucket name in file is different from the one requested\", LOGID(this));\n        goto GT_DONE;\n    }\n\n    if (config) {\n        config->decref();\n    }\n\n    config = ConfigInfo::create(vbc, CLCONFIG_FILE);\n    last_mtime = st.st_mtime;\n\n    status = UPDATED;\n    vbc = NULL;\n\nGT_DONE:\n    if (vbc != NULL) {\n        lcbvb_destroy(vbc);\n    }\n    return status;\n}\n\nvoid FileProvider::write_cache(lcbvb_CONFIG *cfg)\n{\n    if (filename.empty() || is_readonly) {\n        return;\n    }\n\n    std::ofstream ofs(filename.c_str(), std::ios::trunc);\n    if (ofs.good()) {\n        lcb_log(LOGARGS(this, INFO), LOGFMT \"Writing configuration to file\", LOGID(this));\n        char *json = lcbvb_save_json(cfg);\n        ofs << json;\n        ofs << CONFIG_CACHE_MAGIC;\n        free(json);\n    } else {\n        int save_errno = errno;\n        lcb_log(LOGARGS(this, ERROR), LOGFMT \"Couldn't open file for writing: %s\", LOGID(this), strerror(save_errno));\n    }\n}\n\nConfigInfo *FileProvider::get_cached()\n{\n    return filename.empty() ? NULL : config;\n}\n\nvoid FileProvider::reload_cache()\n{\n    if (load_cache() == UPDATED) {\n        parent->provider_got_config(this, config);\n    } else {\n        parent->provider_failed(this, LCB_ERROR);\n    }\n}\n\nlcb_STATUS FileProvider::refresh()\n{\n    if (!timer.is_armed()) {\n        timer.signal();\n    }\n    return LCB_SUCCESS;\n}\n\nFileProvider::~FileProvider()\n{\n    timer.release();\n    if (config) {\n        config->decref();\n    }\n}\n\nvoid FileProvider::clconfig_lsn(EventType event, ConfigInfo *info)\n{\n    if (event != CLCONFIG_EVENT_GOT_NEW_CONFIG) {\n        return;\n    }\n    if (!enabled) {\n        return;\n    }\n\n    if (info->get_origin() == CLCONFIG_PHONY || info->get_origin() == CLCONFIG_FILE) {\n        lcb_log(LOGARGS(this, TRACE), \"Not writing configuration originating from PHONY or FILE to cache\");\n        return;\n    }\n\n    write_cache(info->vbc);\n}\n\nvoid FileProvider::dump(FILE *fp) const\n{\n    fprintf(fp, \"## BEGIN FILE PROVIEDER DUMP ##\\n\");\n    if (!filename.empty()) {\n        fprintf(fp, \"FILENAME: %s\\n\", filename.c_str());\n    }\n    fprintf(fp, \"LAST SYSTEM ERRNO: %d\\n\", last_errno);\n    fprintf(fp, \"LAST MTIME: %lu\\n\", (unsigned long)last_mtime);\n    fprintf(fp, \"## END FILE PROVIDER DUMP ##\\n\");\n}\n\nFileProvider::FileProvider(Confmon *parent_)\n    : Provider(parent_, CLCONFIG_FILE), config(NULL), last_mtime(0), last_errno(0), is_readonly(false),\n      timer(parent_->iot, this)\n{\n    parent->add_listener(this);\n}\n\nstatic std::string mkcachefile(const char *name, const char *bucket)\n{\n    std::string buffer;\n    bool is_dir = false;\n    if (name != NULL) {\n        buffer = std::string(name);\n        if (buffer.size() > 0 && buffer[buffer.size() - 1] == '\/') {\n            is_dir = true;\n        }\n    } else {\n        buffer = lcb_get_tmpdir();\n        if (buffer.empty()) {\n            buffer += \".\";\n        }\n        buffer += \"\/\";\n        is_dir = true;\n    }\n    if (is_dir) {\n        \/\/ append bucket name only if we know that\n        \/\/ cachefile is directory\n        buffer += bucket;\n    }\n\n    return buffer;\n}\n\nbool lcb::clconfig::file_set_filename(Provider *p, const char *f, bool ro)\n{\n    FileProvider *provider = static_cast< FileProvider * >(p);\n    provider->enabled = 1;\n    provider->filename = mkcachefile(f, p->parent->settings->bucket);\n    provider->is_readonly = bool(ro);\n\n    if (ro) {\n        FILE *fp_tmp = fopen(provider->filename.c_str(), \"r\");\n        if (!fp_tmp) {\n            lcb_log(LOGARGS(provider, ERROR), LOGFMT \"Couldn't open for reading: %s\", LOGID(provider), strerror(errno));\n            return false;\n        } else {\n            fclose(fp_tmp);\n        }\n    }\n    return true;\n}\n\nconst char *lcb::clconfig::file_get_filename(Provider *p)\n{\n    FileProvider *fp = static_cast< FileProvider * >(p);\n    if (fp->filename.empty()) {\n        return NULL;\n    } else {\n        return fp->filename.c_str();\n    }\n}\n\nvoid lcb::clconfig::file_set_readonly(Provider *p, bool val)\n{\n    static_cast< FileProvider * >(p)->is_readonly = val;\n}\n\nProvider *lcb::clconfig::new_file_provider(Confmon *mon)\n{\n    return new FileProvider(mon);\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"Math.hpp\"\n\nnamespace atlas::math\n{\n    Point cartesianToSpherical(Point const& p)\n    {\n        float r     = glm::length(p);\n        float theta = glm::atan(p.y \/ p.x);\n        float phi   = glm::acos(p.z \/ r);\n        return {r, theta, phi};\n    }\n\n    Point sphericalToCartesian(Point const& p)\n    {\n        float x = p.r * glm::cos(p.y) * glm::sin(p.z);\n        float y = p.r * glm::sin(p.y) * glm::sin(p.z);\n        float z = p.r * glm::cos(p.z);\n        return {x, y, z};\n    }\n\n    Point cartesianToCylindrical(Point const& p)\n    {\n        float r     = glm::length(Point2{p});\n        float theta = glm::atan(p.y \/ p.x);\n        return {r, theta, p.z};\n    }\n\n    Point cylindricalToCartesian(Point const& p)\n    {\n        float x = p.x * glm::cos(p.y);\n        float y = p.x * glm::sin(p.y);\n        return {x, y, p.z};\n    }\n\n    Point2 cartesianToPolar(Point2 const& p)\n    {\n        float r     = glm::length(p);\n        float theta = glm::atan(p.y \/ p.x);\n        return {r, theta};\n    }\n\n    Point2 polarToCartesian(Point2 const& p)\n    {\n        float x = p.r * glm::cos(p.y);\n        float y = p.r * glm::sin(p.y);\n        return {x, y};\n    }\n} \/\/ namespace atlas::math<commit_msg>[brief] Updates coding style for Coordinates.<commit_after>#pragma once\n\n#include \"Math.hpp\"\n\nnamespace atlas::math\n{\n    Point cartesian_to_spherical(Point const& p)\n    {\n        float r     = glm::length(p);\n        float theta = glm::atan(p.y \/ p.x);\n        float phi   = glm::acos(p.z \/ r);\n        return {r, theta, phi};\n    }\n\n    Point spherical_to_cartesian(Point const& p)\n    {\n        float x = p.r * glm::cos(p.y) * glm::sin(p.z);\n        float y = p.r * glm::sin(p.y) * glm::sin(p.z);\n        float z = p.r * glm::cos(p.z);\n        return {x, y, z};\n    }\n\n    Point cartesian_to_cylindrical(Point const& p)\n    {\n        float r     = glm::length(Point2{p});\n        float theta = glm::atan(p.y \/ p.x);\n        return {r, theta, p.z};\n    }\n\n    Point cylindrical_to_cartesian(Point const& p)\n    {\n        float x = p.x * glm::cos(p.y);\n        float y = p.x * glm::sin(p.y);\n        return {x, y, p.z};\n    }\n\n    Point2 cartesian_to_polar(Point2 const& p)\n    {\n        float r     = glm::length(p);\n        float theta = glm::atan(p.y \/ p.x);\n        return {r, theta};\n    }\n\n    Point2 polar_to_cartesian(Point2 const& p)\n    {\n        float x = p.r * glm::cos(p.y);\n        float y = p.r * glm::sin(p.y);\n        return {x, y};\n    }\n} \/\/ namespace atlas::math\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_PLAYGROUND_PRODUCTS_BASE_HH\n#define DUNE_GDT_PLAYGROUND_PRODUCTS_BASE_HH\n\n#include <type_traits>\n\n#include <dune\/grid\/common\/gridview.hh>\n\n#include <dune\/stuff\/common\/memory.hh>\n#include <dune\/stuff\/common\/tmp-storage.hh>\n#include <dune\/stuff\/functions\/interfaces.hh>\n#include <dune\/stuff\/grid\/walker.hh>\n#include <dune\/stuff\/la\/container\/pattern.hh>\n\n#include <dune\/gdt\/assembler\/system.hh>\n#include <dune\/gdt\/localoperator\/codim1.hh>\n#include <dune\/gdt\/playground\/localevaluation\/swipdg.hh>\n#include <dune\/gdt\/products\/interfaces.hh>\n#include <dune\/gdt\/spaces\/interface.hh>\n\nnamespace Dune {\nnamespace GDT {\nnamespace Products {\n\n\n\/\/ forward, needed for the traits\ntemplate <class GridViewImp, class DiffusionFactorImp, class RangeImp, class SourceImp, class FieldImp,\n          class DiffusionTensorImp>\nclass EllipticSWIPDGPenaltyLocalizable;\n\n\nnamespace internal {\n\n\ntemplate <class GridViewImp, class DiffusionFactorImp, class RangeImp, class SourceImp, class FieldImp,\n          class DiffusionTensorImp>\nclass EllipticSWIPDGPenaltyLocalizableTraits\n{\npublic:\n  typedef EllipticSWIPDGPenaltyLocalizable<GridViewImp, DiffusionFactorImp, RangeImp, SourceImp, FieldImp,\n                                           DiffusionTensorImp> derived_type;\n  typedef GridViewImp GridViewType;\n  typedef RangeImp RangeType;\n  typedef SourceImp SourceType;\n  typedef FieldImp FieldType;\n}; \/\/ class EllipticSWIPDGPenaltyLocalizableTraits\n\n\n} \/\/ namespace internal\n\n\ntemplate <class GridViewImp, class DiffusionFactorImp, class RangeImp, class SourceImp = RangeImp,\n          class FieldImp = double, class DiffusionTensorImp = void>\nclass EllipticSWIPDGPenaltyLocalizable\n    : public LocalizableProductInterface<internal::EllipticSWIPDGPenaltyLocalizableTraits<GridViewImp,\n                                                                                          DiffusionFactorImp, RangeImp,\n                                                                                          SourceImp, FieldImp,\n                                                                                          DiffusionTensorImp>>,\n      public Stuff::Grid::Functor::Codim1<GridViewImp>\n{\n  typedef LocalizableProductInterface<internal::EllipticSWIPDGPenaltyLocalizableTraits<GridViewImp, DiffusionFactorImp,\n                                                                                       RangeImp, SourceImp, FieldImp,\n                                                                                       DiffusionTensorImp>>\n      ProductBaseType;\n  typedef Stuff::Grid::Functor::Codim1<GridViewImp> FunctorBaseType;\n\npublic:\n  typedef internal::EllipticSWIPDGPenaltyLocalizableTraits<GridViewImp, DiffusionFactorImp, RangeImp, SourceImp,\n                                                           FieldImp, DiffusionTensorImp> Traits;\n\n  typedef typename FunctorBaseType::GridViewType GridViewType;\n  typedef typename ProductBaseType::RangeType RangeType;\n  typedef typename ProductBaseType::SourceType SourceType;\n  typedef typename ProductBaseType::FieldType FieldType;\n  typedef typename FunctorBaseType::EntityType EntityType;\n  typedef typename FunctorBaseType::IntersectionType IntersectionType;\n  typedef DiffusionFactorImp DiffusionFactorType;\n  typedef DiffusionTensorImp DiffusionTensorType;\n\n  typedef LocalOperator::Codim1CouplingIntegral<LocalEvaluation::SWIPDG::InnerPenalty<DiffusionFactorType,\n                                                                                      DiffusionTensorType>>\n      CouplingOperatorType;\n  typedef LocalOperator::Codim1BoundaryIntegral<LocalEvaluation::SWIPDG::BoundaryLHSPenalty<DiffusionFactorType,\n                                                                                            DiffusionTensorType>>\n      BoundaryOperatorType;\n\nprivate:\n  typedef DSC::TmpMatricesStorage<FieldType> TmpMatricesProviderType;\n\npublic:\n  EllipticSWIPDGPenaltyLocalizable(const GridViewType& grd_vw, const RangeType& rng, const SourceType& src,\n                                   const DiffusionFactorType& diffusion_factor,\n                                   const DiffusionTensorType& diffusion_tensor, const size_t over_integrate = 0)\n    : grid_view_(grd_vw)\n    , range_(rng)\n    , source_(src)\n    , diffusion_factor_(diffusion_factor)\n    , diffusion_tensor_(diffusion_tensor)\n    , coupling_operator_(over_integrate, diffusion_factor_, diffusion_tensor_)\n    , boundary_operator_(over_integrate, diffusion_factor_, diffusion_tensor_)\n    , inner_intersections_()\n    , boundary_intersections_()\n    , tmp_storage_(nullptr)\n    , prepared_(false)\n    , finalized_(false)\n    , result_(0)\n    , finalized_result_(0)\n  {\n  }\n\n  virtual ~EllipticSWIPDGPenaltyLocalizable()\n  {\n  }\n\n  const GridViewType& grid_view() const\n  {\n    return grid_view_;\n  }\n\n  const RangeType& range() const\n  {\n    return range_;\n  }\n\n  const SourceType& source() const\n  {\n    return source_;\n  }\n\n  virtual void prepare() DS_OVERRIDE\n  {\n    if (!prepared_) {\n      tmp_storage_ = std::unique_ptr<TmpMatricesProviderType>(new TmpMatricesProviderType(\n          {4, std::max(coupling_operator_.numTmpObjectsRequired(), boundary_operator_.numTmpObjectsRequired())}, 1, 1));\n      result_   = FieldType(0.0);\n      prepared_ = true;\n    }\n  } \/\/ ... prepare()\n\n  FieldType compute_locally(const IntersectionType& intersection, const EntityType& inside_entity,\n                            const EntityType& outside_entity) const\n  {\n    assert(prepared_);\n    assert(tmp_storage_);\n    auto& tmp_storage = tmp_storage_->matrices();\n    assert(tmp_storage.size() >= 2);\n    assert(tmp_storage[0].size() >= 4);\n    auto& local_operator_result_en_en = tmp_storage[0][0];\n    auto& local_operator_result_ne_ne = tmp_storage[0][1];\n    auto& local_operator_result_en_ne = tmp_storage[0][2];\n    auto& local_operator_result_ne_en = tmp_storage[0][3];\n    auto& tmp_matrices                = tmp_storage[1];\n    \/\/ get the local functions\n    const auto local_source_ptr_en = this->source().local_function(inside_entity);\n    const auto local_source_ptr_ne = this->source().local_function(outside_entity);\n    const auto local_range_ptr_en  = this->range().local_function(inside_entity);\n    const auto local_range_ptr_ne  = this->range().local_function(outside_entity);\n    \/\/ apply local operator\n    FieldType ret = 0;\n    if (inner_intersections_.apply_on(grid_view_, intersection)) {\n      coupling_operator_.apply(*local_range_ptr_en,\n                               *local_source_ptr_en,\n                               *local_source_ptr_ne,\n                               *local_range_ptr_ne,\n                               intersection,\n                               local_operator_result_en_en,\n                               local_operator_result_ne_ne,\n                               local_operator_result_en_ne,\n                               local_operator_result_ne_en,\n                               tmp_matrices);\n      assert(local_operator_result_en_en.rows() == 1);\n      assert(local_operator_result_en_en.cols() == 1);\n      assert(local_operator_result_ne_ne.rows() == 1);\n      assert(local_operator_result_ne_ne.cols() == 1);\n      assert(local_operator_result_en_ne.rows() == 1);\n      assert(local_operator_result_en_ne.cols() == 1);\n      assert(local_operator_result_ne_en.rows() == 1);\n      assert(local_operator_result_ne_en.cols() == 1);\n      ret += local_operator_result_en_en[0][0] + local_operator_result_ne_ne[0][0] + local_operator_result_en_ne[0][0]\n             + local_operator_result_ne_en[0][0];\n    }\n    if (boundary_intersections_.apply_on(grid_view_, intersection)) {\n      boundary_operator_.apply(\n          *local_range_ptr_en, *local_source_ptr_en, intersection, local_operator_result_en_en, tmp_matrices);\n      assert(local_operator_result_en_en.rows() == 1);\n      assert(local_operator_result_en_en.cols() == 1);\n      ret += local_operator_result_en_en[0][0];\n    }\n    return ret;\n  } \/\/ ... compute_locally(...)\n\n  virtual void apply_local(const IntersectionType& intersection, const EntityType& inside_entity,\n                           const EntityType& outside_entity) DS_OVERRIDE\n  {\n    *result_ += compute_locally(intersection, inside_entity, outside_entity);\n  }\n\n  virtual void finalize() DS_OVERRIDE\n  {\n    if (!finalized_) {\n      finalized_result_ = result_.sum();\n      finalized_result_ = grid_view_.comm().sum(finalized_result_);\n      finalized_        = true;\n    }\n  } \/\/ ... finalize(...)\n\n  FieldType apply2()\n  {\n    if (!finalized_) {\n      Stuff::Grid::Walker<GridViewType> grid_walker(grid_view_);\n      grid_walker.add(*this);\n      grid_walker.walk();\n    }\n    return finalized_result_;\n  } \/\/ ... apply2(...)\n\nprivate:\n  const GridViewType& grid_view_;\n  const RangeType& range_;\n  const SourceType& source_;\n  const DiffusionFactorType& diffusion_factor_;\n  const DiffusionTensorType& diffusion_tensor_;\n  const CouplingOperatorType coupling_operator_;\n  const BoundaryOperatorType boundary_operator_;\n  const DSG::ApplyOn::InnerIntersectionsPrimally<GridViewType> inner_intersections_;\n  const DSG::ApplyOn::BoundaryIntersections<GridViewType> boundary_intersections_;\n  std::unique_ptr<TmpMatricesProviderType> tmp_storage_;\n  bool prepared_;\n  bool finalized_;\n  DS::PerThreadValue<FieldType> result_;\n  FieldType finalized_result_;\n}; \/\/ class EllipticSWIPDGPenaltyLocalizable\n\n\n} \/\/ namespace Products\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_PLAYGROUND_PRODUCTS_BASE_HH\n<commit_msg>[products.elliptic-swipdg] added first draft of assemblable product<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_PLAYGROUND_PRODUCTS_BASE_HH\n#define DUNE_GDT_PLAYGROUND_PRODUCTS_BASE_HH\n\n#include <type_traits>\n\n#include <dune\/grid\/common\/gridview.hh>\n\n#include <dune\/stuff\/common\/memory.hh>\n#include <dune\/stuff\/common\/tmp-storage.hh>\n#include <dune\/stuff\/functions\/interfaces.hh>\n#include <dune\/stuff\/grid\/walker.hh>\n#include <dune\/stuff\/la\/container\/pattern.hh>\n\n#include <dune\/gdt\/assembler\/system.hh>\n#include <dune\/gdt\/assembler\/local\/codim1.hh>\n#include <dune\/gdt\/localoperator\/codim1.hh>\n#include <dune\/gdt\/playground\/localevaluation\/swipdg.hh>\n#include <dune\/gdt\/products\/interfaces.hh>\n#include <dune\/gdt\/spaces\/interface.hh>\n\nnamespace Dune {\nnamespace GDT {\nnamespace Products {\n\n\n\/\/ forward, needed for the traits\ntemplate <class GridViewImp, class DiffusionFactorImp, class RangeImp, class SourceImp, class FieldImp,\n          class DiffusionTensorImp>\nclass EllipticSWIPDGPenaltyLocalizable;\n\n\ntemplate <class DiffusionFactorImp, class MatrixImp, class RangeSpaceImp, class GridViewImp, class SourceSpaceImp,\n          class DiffusionTensorImp>\nclass EllipticSWIPDGPenaltyAssemblable;\n\n\nnamespace internal {\n\n\ntemplate <class GridViewImp, class DiffusionFactorImp, class RangeImp, class SourceImp, class FieldImp,\n          class DiffusionTensorImp>\nclass EllipticSWIPDGPenaltyLocalizableTraits\n{\npublic:\n  typedef EllipticSWIPDGPenaltyLocalizable<GridViewImp, DiffusionFactorImp, RangeImp, SourceImp, FieldImp,\n                                           DiffusionTensorImp> derived_type;\n  typedef GridViewImp GridViewType;\n  typedef RangeImp RangeType;\n  typedef SourceImp SourceType;\n  typedef FieldImp FieldType;\n}; \/\/ class EllipticSWIPDGPenaltyLocalizableTraits\n\n\ntemplate <class DiffusionFactorImp, class MatrixImp, class RangeSpaceImp, class GridViewImp, class SourceSpaceImp,\n          class DiffusionTensorImp>\nclass EllipticSWIPDGPenaltyAssemblableTraits\n{\npublic:\n  typedef EllipticSWIPDGPenaltyAssemblable<DiffusionFactorImp, MatrixImp, RangeSpaceImp, GridViewImp, SourceSpaceImp,\n                                           DiffusionTensorImp> derived_type;\n  typedef GridViewImp GridViewType;\n  typedef RangeSpaceImp RangeSpaceType;\n  typedef SourceSpaceImp SourceSpaceType;\n  typedef MatrixImp MatrixType;\n}; \/\/ class EllipticSWIPDGPenaltyAssemblableTraits\n\n\n} \/\/ namespace internal\n\n\ntemplate <class GridViewImp, class DiffusionFactorImp, class RangeImp, class SourceImp = RangeImp,\n          class FieldImp = double, class DiffusionTensorImp = void>\nclass EllipticSWIPDGPenaltyLocalizable\n    : public LocalizableProductInterface<internal::EllipticSWIPDGPenaltyLocalizableTraits<GridViewImp,\n                                                                                          DiffusionFactorImp, RangeImp,\n                                                                                          SourceImp, FieldImp,\n                                                                                          DiffusionTensorImp>>,\n      public Stuff::Grid::Functor::Codim1<GridViewImp>\n{\n  typedef LocalizableProductInterface<internal::EllipticSWIPDGPenaltyLocalizableTraits<GridViewImp, DiffusionFactorImp,\n                                                                                       RangeImp, SourceImp, FieldImp,\n                                                                                       DiffusionTensorImp>>\n      ProductBaseType;\n  typedef Stuff::Grid::Functor::Codim1<GridViewImp> FunctorBaseType;\n\npublic:\n  typedef internal::EllipticSWIPDGPenaltyLocalizableTraits<GridViewImp, DiffusionFactorImp, RangeImp, SourceImp,\n                                                           FieldImp, DiffusionTensorImp> Traits;\n\n  typedef typename FunctorBaseType::GridViewType GridViewType;\n  typedef typename ProductBaseType::RangeType RangeType;\n  typedef typename ProductBaseType::SourceType SourceType;\n  typedef typename ProductBaseType::FieldType FieldType;\n  typedef typename FunctorBaseType::EntityType EntityType;\n  typedef typename FunctorBaseType::IntersectionType IntersectionType;\n  typedef DiffusionFactorImp DiffusionFactorType;\n  typedef DiffusionTensorImp DiffusionTensorType;\n\n  typedef LocalOperator::Codim1CouplingIntegral<LocalEvaluation::SWIPDG::InnerPenalty<DiffusionFactorType,\n                                                                                      DiffusionTensorType>>\n      CouplingOperatorType;\n  typedef LocalOperator::Codim1BoundaryIntegral<LocalEvaluation::SWIPDG::BoundaryLHSPenalty<DiffusionFactorType,\n                                                                                            DiffusionTensorType>>\n      BoundaryOperatorType;\n\nprivate:\n  typedef DSC::TmpMatricesStorage<FieldType> TmpMatricesProviderType;\n\npublic:\n  EllipticSWIPDGPenaltyLocalizable(const GridViewType& grd_vw, const RangeType& rng, const SourceType& src,\n                                   const DiffusionFactorType& diffusion_factor,\n                                   const DiffusionTensorType& diffusion_tensor, const size_t over_integrate = 0)\n    : grid_view_(grd_vw)\n    , range_(rng)\n    , source_(src)\n    , diffusion_factor_(diffusion_factor)\n    , diffusion_tensor_(diffusion_tensor)\n    , coupling_operator_(over_integrate, diffusion_factor_, diffusion_tensor_)\n    , boundary_operator_(over_integrate, diffusion_factor_, diffusion_tensor_)\n    , inner_intersections_()\n    , boundary_intersections_()\n    , tmp_storage_(nullptr)\n    , prepared_(false)\n    , finalized_(false)\n    , result_(0)\n    , finalized_result_(0)\n  {\n  }\n\n  virtual ~EllipticSWIPDGPenaltyLocalizable()\n  {\n  }\n\n  const GridViewType& grid_view() const\n  {\n    return grid_view_;\n  }\n\n  const RangeType& range() const\n  {\n    return range_;\n  }\n\n  const SourceType& source() const\n  {\n    return source_;\n  }\n\n  virtual void prepare() DS_OVERRIDE\n  {\n    if (!prepared_) {\n      tmp_storage_ = std::unique_ptr<TmpMatricesProviderType>(new TmpMatricesProviderType(\n          {4, std::max(coupling_operator_.numTmpObjectsRequired(), boundary_operator_.numTmpObjectsRequired())}, 1, 1));\n      result_   = FieldType(0.0);\n      prepared_ = true;\n    }\n  } \/\/ ... prepare()\n\n  FieldType compute_locally(const IntersectionType& intersection, const EntityType& inside_entity,\n                            const EntityType& outside_entity) const\n  {\n    assert(prepared_);\n    assert(tmp_storage_);\n    auto& tmp_storage = tmp_storage_->matrices();\n    assert(tmp_storage.size() >= 2);\n    assert(tmp_storage[0].size() >= 4);\n    auto& local_operator_result_en_en = tmp_storage[0][0];\n    auto& local_operator_result_ne_ne = tmp_storage[0][1];\n    auto& local_operator_result_en_ne = tmp_storage[0][2];\n    auto& local_operator_result_ne_en = tmp_storage[0][3];\n    auto& tmp_matrices                = tmp_storage[1];\n    \/\/ get the local functions\n    const auto local_source_ptr_en = this->source().local_function(inside_entity);\n    const auto local_source_ptr_ne = this->source().local_function(outside_entity);\n    const auto local_range_ptr_en  = this->range().local_function(inside_entity);\n    const auto local_range_ptr_ne  = this->range().local_function(outside_entity);\n    \/\/ apply local operator\n    FieldType ret = 0;\n    if (inner_intersections_.apply_on(grid_view_, intersection)) {\n      coupling_operator_.apply(*local_range_ptr_en,\n                               *local_source_ptr_en,\n                               *local_source_ptr_ne,\n                               *local_range_ptr_ne,\n                               intersection,\n                               local_operator_result_en_en,\n                               local_operator_result_ne_ne,\n                               local_operator_result_en_ne,\n                               local_operator_result_ne_en,\n                               tmp_matrices);\n      assert(local_operator_result_en_en.rows() == 1);\n      assert(local_operator_result_en_en.cols() == 1);\n      assert(local_operator_result_ne_ne.rows() == 1);\n      assert(local_operator_result_ne_ne.cols() == 1);\n      assert(local_operator_result_en_ne.rows() == 1);\n      assert(local_operator_result_en_ne.cols() == 1);\n      assert(local_operator_result_ne_en.rows() == 1);\n      assert(local_operator_result_ne_en.cols() == 1);\n      ret += local_operator_result_en_en[0][0] + local_operator_result_ne_ne[0][0] + local_operator_result_en_ne[0][0]\n             + local_operator_result_ne_en[0][0];\n    }\n    if (boundary_intersections_.apply_on(grid_view_, intersection)) {\n      boundary_operator_.apply(\n          *local_range_ptr_en, *local_source_ptr_en, intersection, local_operator_result_en_en, tmp_matrices);\n      assert(local_operator_result_en_en.rows() == 1);\n      assert(local_operator_result_en_en.cols() == 1);\n      ret += local_operator_result_en_en[0][0];\n    }\n    return ret;\n  } \/\/ ... compute_locally(...)\n\n  virtual void apply_local(const IntersectionType& intersection, const EntityType& inside_entity,\n                           const EntityType& outside_entity) DS_OVERRIDE\n  {\n    *result_ += compute_locally(intersection, inside_entity, outside_entity);\n  }\n\n  virtual void finalize() DS_OVERRIDE\n  {\n    if (!finalized_) {\n      finalized_result_ = result_.sum();\n      finalized_result_ = grid_view_.comm().sum(finalized_result_);\n      finalized_        = true;\n    }\n  } \/\/ ... finalize(...)\n\n  FieldType apply2()\n  {\n    if (!finalized_) {\n      Stuff::Grid::Walker<GridViewType> grid_walker(grid_view_);\n      grid_walker.add(*this);\n      grid_walker.walk();\n    }\n    return finalized_result_;\n  } \/\/ ... apply2(...)\n\nprivate:\n  const GridViewType& grid_view_;\n  const RangeType& range_;\n  const SourceType& source_;\n  const DiffusionFactorType& diffusion_factor_;\n  const DiffusionTensorType& diffusion_tensor_;\n  const CouplingOperatorType coupling_operator_;\n  const BoundaryOperatorType boundary_operator_;\n  const DSG::ApplyOn::InnerIntersectionsPrimally<GridViewType> inner_intersections_;\n  const DSG::ApplyOn::BoundaryIntersections<GridViewType> boundary_intersections_;\n  std::unique_ptr<TmpMatricesProviderType> tmp_storage_;\n  bool prepared_;\n  bool finalized_;\n  DS::PerThreadValue<FieldType> result_;\n  FieldType finalized_result_;\n}; \/\/ class EllipticSWIPDGPenaltyLocalizable\n\n\ntemplate <class DiffusionFactorImp, class MatrixImp, class RangeSpaceImp,\n          class GridViewImp = typename RangeSpaceImp::GridViewType, class SourceSpaceImp = RangeSpaceImp,\n          class DiffusionTensorImp = void>\nclass EllipticSWIPDGPenaltyAssemblable\n    : DSC::StorageProvider<MatrixImp>,\n      public AssemblableProductInterface<internal::EllipticSWIPDGPenaltyAssemblableTraits<DiffusionFactorImp, MatrixImp,\n                                                                                          RangeSpaceImp, GridViewImp,\n                                                                                          SourceSpaceImp,\n                                                                                          DiffusionTensorImp>>,\n      public SystemAssembler<RangeSpaceImp, GridViewImp, SourceSpaceImp>\n{\n  typedef DSC::StorageProvider<MatrixImp> StorageBaseType;\n  typedef AssemblableProductInterface<internal::EllipticSWIPDGPenaltyAssemblableTraits<DiffusionFactorImp, MatrixImp,\n                                                                                       RangeSpaceImp, GridViewImp,\n                                                                                       SourceSpaceImp,\n                                                                                       DiffusionTensorImp>>\n      ProductBaseType;\n  typedef SystemAssembler<RangeSpaceImp, GridViewImp, SourceSpaceImp> AssemblerBaseType;\n\npublic:\n  typedef internal::EllipticSWIPDGPenaltyAssemblableTraits<DiffusionFactorImp, MatrixImp, RangeSpaceImp, GridViewImp,\n                                                           SourceSpaceImp, DiffusionTensorImp> Traits;\n  typedef typename AssemblerBaseType::GridViewType GridViewType;\n  typedef typename ProductBaseType::RangeSpaceType RangeSpaceType;\n  typedef typename ProductBaseType::SourceSpaceType SourceSpaceType;\n  typedef typename ProductBaseType::FieldType FieldType;\n  typedef typename ProductBaseType::MatrixType MatrixType;\n  typedef typename AssemblerBaseType::EntityType EntityType;\n  typedef typename AssemblerBaseType::IntersectionType IntersectionType;\n  typedef DiffusionFactorImp DiffusionFactorType;\n  typedef DiffusionTensorImp DiffusionTensorType;\n\n  typedef LocalOperator::Codim1CouplingIntegral<LocalEvaluation::SWIPDG::InnerPenalty<DiffusionFactorType,\n                                                                                      DiffusionTensorType>>\n      CouplingOperatorType;\n  typedef LocalOperator::Codim1BoundaryIntegral<LocalEvaluation::SWIPDG::BoundaryLHSPenalty<DiffusionFactorType,\n                                                                                            DiffusionTensorType>>\n      BoundaryOperatorType;\n  typedef LocalAssembler::Codim1CouplingMatrix<CouplingOperatorType> CouplingAssemblerType;\n  typedef LocalAssembler::Codim1BoundaryMatrix<BoundaryOperatorType> BoundaryAssemblerType;\n\n  using ProductBaseType::pattern;\n\n  static Stuff::LA::SparsityPatternDefault pattern(const RangeSpaceType& range_space,\n                                                   const SourceSpaceType& source_space, const GridViewType& grid_view)\n  {\n    return range_space.compute_face_and_volume_pattern(grid_view, source_space);\n  }\n\n  EllipticSWIPDGPenaltyAssemblable(const RangeSpaceType& rng_spc, const GridViewType& grd_vw,\n                                   const SourceSpaceType& src_spc, const DiffusionFactorImp& diffusion_factor,\n                                   const DiffusionTensorImp& diffusion_tensor, const size_t over_integrate = 0)\n    : StorageBaseType(\n          new MatrixType(rng_spc.mapper().size(), src_spc.mapper().size(), pattern(rng_spc, src_spc, grd_vw)))\n    , AssemblerBaseType(rng_spc, src_spc, grd_vw)\n    , diffusion_factor_(diffusion_factor)\n    , diffusion_tensor_(diffusion_tensor)\n    , coupling_operator_(over_integrate, diffusion_factor_, diffusion_tensor_)\n    , boundary_operator_(over_integrate, diffusion_factor_, diffusion_tensor_)\n    , coupling_assembler_(coupling_operator_)\n    , boundary_assembler_(boundary_operator_)\n    , assembled_(false)\n  {\n    setup();\n  }\n\n  const GridViewType& grid_view() const\n  {\n    return AssemblerBaseType::grid_view();\n  }\n\n  const RangeSpaceType& range_space() const\n  {\n    return AssemblerBaseType::test_space();\n  }\n\n  const SourceSpaceType& source_space() const\n  {\n    return AssemblerBaseType::ansatz_space();\n  }\n\n  MatrixType& matrix()\n  {\n    return StorageBaseType::storage_access();\n  }\n\n  const MatrixType& matrix() const\n  {\n    return StorageBaseType::storage_access();\n  }\n\n  void assemble()\n  {\n    if (!assembled_) {\n      AssemblerBaseType::assemble();\n      assembled_ = true;\n    }\n  } \/\/ ... assemble()\n\nprivate:\n  void setup()\n  {\n    this->add(coupling_assembler_, matrix(), new DSG::ApplyOn::InnerIntersectionsPrimally<GridViewType>());\n    this->add(boundary_assembler_, matrix(), new DSG::ApplyOn::BoundaryIntersections<GridViewType>());\n  }\n\n  const DiffusionFactorType& diffusion_factor_;\n  const DiffusionTensorType& diffusion_tensor_;\n  const CouplingOperatorType coupling_operator_;\n  const BoundaryOperatorType boundary_operator_;\n  const CouplingAssemblerType coupling_assembler_;\n  const BoundaryAssemblerType boundary_assembler_;\n  bool assembled_;\n}; \/\/ class EllipticSWIPDGPenaltyAssemblable\n\n\n} \/\/ namespace Products\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_PLAYGROUND_PRODUCTS_BASE_HH\n<|endoftext|>"}
{"text":"<commit_before>\/\/..............................................................................\n\/\/\n\/\/  This file is part of the AXL library.\n\/\/\n\/\/  AXL 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\/axl\/license.txt\n\/\/\n\/\/..............................................................................\n\n#include \"pch.h\"\n#include \"axl_dox_Module.h\"\n#include \"axl_dox_Host.h\"\n\nnamespace axl {\nnamespace dox {\n\n\/\/..............................................................................\n\nvoid\nModule::clear()\n{\n\tm_blockList.clear();\n\tm_groupList.clear();\n\tm_footnoteList.clear();\n\tm_refIdMap.clear();\n\tm_groupMap.clear();\n\tm_targetList.clear();\n}\n\nGroup*\nModule::getGroup(const sl::StringRef& name)\n{\n\tsl::StringHashTableIterator<Group*> it = m_groupMap.visit(name);\n\tif (it->m_value)\n\t\treturn it->m_value;\n\n\tsl::String refId;\n\trefId.format(\"group_%s\", name.sz());\n\trefId.replace('-', '_');\n\n\tGroup* group = AXL_MEM_NEW_ARGS(Group, (m_host));\n\tgroup->m_name = name;\n\tgroup->m_refId = adjustRefId(refId);\n\n\tm_groupList.insertTail(group);\n\tit->m_value = group;\n\treturn  group;\n}\n\nBlock*\nModule::createBlock(handle_t item)\n{\n\tBlock* block = AXL_MEM_NEW_ARGS(Block, (m_host));\n\tblock->m_item = item;\n\tm_blockList.insertTail(block);\n\treturn  block;\n}\n\nFootnote*\nModule::createFootnote()\n{\n\tFootnote* footnote = AXL_MEM_NEW_ARGS(Footnote, (m_host));\n\tm_blockList.insertTail(footnote);\n\treturn footnote;\n}\n\nsl::String\nModule::adjustRefId(const sl::StringRef& refId)\n{\n\tsl::StringHashTableIterator<size_t> it = m_refIdMap.visit(refId);\n\tif (!it->m_value) \/\/ no collisions\n\t{\n\t\tit->m_value = 2; \/\/ start with index 2\n\t\treturn refId;\n\t}\n\n\tsl::String adjustedRefId;\n\tadjustedRefId.format(\"%s_%d\", refId.sz(), it->m_value);\n\n\tit->m_value++;\n\treturn adjustedRefId;\n}\n\nvoid\nModule::setBlockTarget(\n\tBlock* block,\n\tint tokenKind,\n\tconst sl::StringRef& itemName,\n\tsize_t overloadIdx\n\t)\n{\n\tTarget* target = AXL_MEM_NEW(Target);\n\ttarget->m_block = block;\n\ttarget->m_tokenKind = tokenKind;\n\ttarget->m_itemName = itemName;\n\ttarget->m_overloadIdx = overloadIdx;\n\tm_targetList.insertTail(target);\n}\n\nbool\nModule::resolveBlockTargets()\n{\n\tbool result = true;\n\n\tsl::Iterator<Target> it = m_targetList.getHead();\n\tfor (; it; it++)\n\t{\n\t\tTarget* target = *it;\n\n\t\thandle_t item = m_host->findItem(target->m_itemName, target->m_overloadIdx);\n\t\tif (!item)\n\t\t{\n\t\t\tresult = false;\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ keep the group of the original item (usually, we use @{ ... @} for grouping)\n\n\t\tBlock* block = m_host->findItemBlock(item);\n\t\tif (block && block->m_group && !target->m_block->m_group)\n\t\t\ttarget->m_block->m_group = block->m_group;\n\n\t\tm_host->setItemBlock(item, target->m_block);\n\t}\n\n\tif (!result)\n\t\terr::setError(\"documentation target(s) not found\");\n\n\treturn result;\n}\n\nvoid\nModule::deleteEmptyGroups()\n{\n\tbool isGroupDeleted;\n\n\tdo\n\t{\n\t\tisGroupDeleted = false;\n\n\t\tsl::Iterator<Group> groupIt = m_groupList.getHead();\n\t\twhile (groupIt)\n\t\t{\n\t\t\tsl::Iterator<Group> nextIt = groupIt.getNext();\n\n\t\t\tif (groupIt->isEmpty())\n\t\t\t{\n\t\t\t\tif (groupIt->m_group)\n\t\t\t\t\tgroupIt->m_group->m_groupList.remove(groupIt->m_parentGroupListIt);\n\n\t\t\t\tm_groupMap.eraseKey(groupIt->m_name);\n\t\t\t\tm_groupList.erase(groupIt);\n\t\t\t\tisGroupDeleted = true;\n\t\t\t}\n\n\t\t\tgroupIt = nextIt;\n\t\t}\n\t} while (isGroupDeleted);\n}\n\nbool\nModule::generateDocumentation(\n\tconst sl::StringRef& outputDir,\n\tconst sl::StringRef& indexFileName,\n\tconst sl::StringRef& globalNamespaceFileName\n\t)\n{\n\tstatic char indexFileHdr[] =\n\t\t\"<?xml version='1.0' encoding='UTF-8' standalone='no'?>\\n\"\n\t\t\"<doxygenindex>\\n\";\n\n\tstatic char indexFileTerm[] = \"<\/doxygenindex>\\n\";\n\n\tstatic char compoundFileHdr[] =\n\t\t\"<?xml version='1.0' encoding='UTF-8' standalone='no'?>\\n\"\n\t\t\"<doxygen>\\n\";\n\n\tstatic char compoundFileTerm[] = \"<\/doxygen>\\n\";\n\n\tbool result;\n\n\tresult = io::ensureDirExists(outputDir);\n\tif (!result)\n\t\treturn false;\n\n\tresult = resolveBlockTargets();\n\tif (!result)\n\t{\n\t\t\/\/ generate a warning about orphan doxy blocks?\n\t}\n\n\tsl::String nspaceXml;\n\tsl::String indexXml;\n\n\tresult = m_host->generateGlobalNamespaceDocumentation(outputDir, &nspaceXml, &indexXml);\n\tif (!result)\n\t\treturn false;\n\n\tif (nspaceXml.isEmpty())\n\t{\n\t\terr::setError(\"module does not contain any documentable items\");\n\t\treturn false;\n\t}\n\n\tdeleteEmptyGroups();\n\n\tresult = generateGroupDocumentation(outputDir, &indexXml);\n\tif (!result)\n\t\treturn false;\n\n\tsl::String nspaceFilePath = io::concatFilePath(outputDir, globalNamespaceFileName);\n\tsl::String indexFilePath = io::concatFilePath(outputDir, indexFileName);\n\n\tio::File file;\n\treturn\n\t\tfile.open(nspaceFilePath, io::FileFlag_Clear) &&\n\t\tfile.write(compoundFileHdr, lengthof(compoundFileHdr)) != -1 &&\n\t\tfile.write(nspaceXml, nspaceXml.getLength()) != -1 &&\n\t\tfile.write(compoundFileTerm, lengthof(compoundFileTerm)) != -1 &&\n\n\t\tfile.open(indexFilePath, io::FileFlag_Clear) &&\n\t\tfile.write(indexFileHdr, lengthof(indexFileHdr)) != -1 &&\n\t\tfile.write(indexXml, indexXml.getLength()) != -1 &&\n\t\tfile.write(indexFileTerm, lengthof(indexFileTerm)) != -1;\n}\n\nbool\nModule::generateGroupDocumentation(\n\tconst sl::StringRef& outputDir,\n\tsl::String* indexXml\n\t)\n{\n\tbool result;\n\n\tstatic char compoundFileHdr[] =\n\t\t\"<?xml version='1.0' encoding='UTF-8' standalone='no'?>\\n\"\n\t\t\"<doxygen>\\n\";\n\n\tstatic char compoundFileTerm[] = \"<\/doxygen>\\n\";\n\n\tsl::String itemXml;\n\n\tsl::Iterator<Group> groupIt = m_groupList.getHead();\n\tfor (; groupIt; groupIt++)\n\t{\n\t\tresult = groupIt->generateDocumentation(outputDir, &itemXml, indexXml);\n\t\tif (!result)\n\t\t\treturn false;\n\n\t\tsl::String refId = groupIt->getRefId();\n\t\tsl::String fileName = sl::String(outputDir) + \"\/\" + refId + \".xml\";\n\n\t\tio::File compoundFile;\n\t\tresult =\n\t\t\tcompoundFile.open(fileName, io::FileFlag_Clear) &&\n\t\t\tcompoundFile.write(compoundFileHdr, lengthof(compoundFileHdr)) != -1 &&\n\t\t\tcompoundFile.write(itemXml, itemXml.getLength()) != -1 &&\n\t\t\tcompoundFile.write(compoundFileTerm, lengthof(compoundFileTerm)) != -1;\n\n\t\tif (!result)\n\t\t\treturn false;\n\t}\n\n\treturn true;\n}\n\n\/\/..............................................................................\n\n} \/\/ namespace dox\n} \/\/ namespace axl\n<commit_msg>[axl_dox] don't delete empty groups (we now use an empty group to specify title\/description for the global page)<commit_after>\/\/..............................................................................\n\/\/\n\/\/  This file is part of the AXL library.\n\/\/\n\/\/  AXL 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\/axl\/license.txt\n\/\/\n\/\/..............................................................................\n\n#include \"pch.h\"\n#include \"axl_dox_Module.h\"\n#include \"axl_dox_Host.h\"\n\nnamespace axl {\nnamespace dox {\n\n\/\/..............................................................................\n\nvoid\nModule::clear()\n{\n\tm_blockList.clear();\n\tm_groupList.clear();\n\tm_footnoteList.clear();\n\tm_refIdMap.clear();\n\tm_groupMap.clear();\n\tm_targetList.clear();\n}\n\nGroup*\nModule::getGroup(const sl::StringRef& name)\n{\n\tsl::StringHashTableIterator<Group*> it = m_groupMap.visit(name);\n\tif (it->m_value)\n\t\treturn it->m_value;\n\n\tsl::String refId;\n\trefId.format(\"group_%s\", name.sz());\n\trefId.replace('-', '_');\n\n\tGroup* group = AXL_MEM_NEW_ARGS(Group, (m_host));\n\tgroup->m_name = name;\n\tgroup->m_refId = adjustRefId(refId);\n\n\tm_groupList.insertTail(group);\n\tit->m_value = group;\n\treturn  group;\n}\n\nBlock*\nModule::createBlock(handle_t item)\n{\n\tBlock* block = AXL_MEM_NEW_ARGS(Block, (m_host));\n\tblock->m_item = item;\n\tm_blockList.insertTail(block);\n\treturn  block;\n}\n\nFootnote*\nModule::createFootnote()\n{\n\tFootnote* footnote = AXL_MEM_NEW_ARGS(Footnote, (m_host));\n\tm_blockList.insertTail(footnote);\n\treturn footnote;\n}\n\nsl::String\nModule::adjustRefId(const sl::StringRef& refId)\n{\n\tsl::StringHashTableIterator<size_t> it = m_refIdMap.visit(refId);\n\tif (!it->m_value) \/\/ no collisions\n\t{\n\t\tit->m_value = 2; \/\/ start with index 2\n\t\treturn refId;\n\t}\n\n\tsl::String adjustedRefId;\n\tadjustedRefId.format(\"%s_%d\", refId.sz(), it->m_value);\n\n\tit->m_value++;\n\treturn adjustedRefId;\n}\n\nvoid\nModule::setBlockTarget(\n\tBlock* block,\n\tint tokenKind,\n\tconst sl::StringRef& itemName,\n\tsize_t overloadIdx\n\t)\n{\n\tTarget* target = AXL_MEM_NEW(Target);\n\ttarget->m_block = block;\n\ttarget->m_tokenKind = tokenKind;\n\ttarget->m_itemName = itemName;\n\ttarget->m_overloadIdx = overloadIdx;\n\tm_targetList.insertTail(target);\n}\n\nbool\nModule::resolveBlockTargets()\n{\n\tbool result = true;\n\n\tsl::Iterator<Target> it = m_targetList.getHead();\n\tfor (; it; it++)\n\t{\n\t\tTarget* target = *it;\n\n\t\thandle_t item = m_host->findItem(target->m_itemName, target->m_overloadIdx);\n\t\tif (!item)\n\t\t{\n\t\t\tresult = false;\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ keep the group of the original item (usually, we use @{ ... @} for grouping)\n\n\t\tBlock* block = m_host->findItemBlock(item);\n\t\tif (block && block->m_group && !target->m_block->m_group)\n\t\t\ttarget->m_block->m_group = block->m_group;\n\n\t\tm_host->setItemBlock(item, target->m_block);\n\t}\n\n\tif (!result)\n\t\terr::setError(\"documentation target(s) not found\");\n\n\treturn result;\n}\n\nvoid\nModule::deleteEmptyGroups()\n{\n\tbool isGroupDeleted;\n\n\tdo\n\t{\n\t\tisGroupDeleted = false;\n\n\t\tsl::Iterator<Group> groupIt = m_groupList.getHead();\n\t\twhile (groupIt)\n\t\t{\n\t\t\tsl::Iterator<Group> nextIt = groupIt.getNext();\n\n\t\t\tif (groupIt->isEmpty())\n\t\t\t{\n\t\t\t\tif (groupIt->m_group)\n\t\t\t\t\tgroupIt->m_group->m_groupList.remove(groupIt->m_parentGroupListIt);\n\n\t\t\t\tm_groupMap.eraseKey(groupIt->m_name);\n\t\t\t\tm_groupList.erase(groupIt);\n\t\t\t\tisGroupDeleted = true;\n\t\t\t}\n\n\t\t\tgroupIt = nextIt;\n\t\t}\n\t} while (isGroupDeleted);\n}\n\nbool\nModule::generateDocumentation(\n\tconst sl::StringRef& outputDir,\n\tconst sl::StringRef& indexFileName,\n\tconst sl::StringRef& globalNamespaceFileName\n\t)\n{\n\tstatic char indexFileHdr[] =\n\t\t\"<?xml version='1.0' encoding='UTF-8' standalone='no'?>\\n\"\n\t\t\"<doxygenindex>\\n\";\n\n\tstatic char indexFileTerm[] = \"<\/doxygenindex>\\n\";\n\n\tstatic char compoundFileHdr[] =\n\t\t\"<?xml version='1.0' encoding='UTF-8' standalone='no'?>\\n\"\n\t\t\"<doxygen>\\n\";\n\n\tstatic char compoundFileTerm[] = \"<\/doxygen>\\n\";\n\n\tbool result;\n\n\tresult = io::ensureDirExists(outputDir);\n\tif (!result)\n\t\treturn false;\n\n\tresult = resolveBlockTargets();\n\tif (!result)\n\t{\n\t\t\/\/ generate a warning about orphan doxy blocks?\n\t}\n\n\tsl::String nspaceXml;\n\tsl::String indexXml;\n\n\tresult = m_host->generateGlobalNamespaceDocumentation(outputDir, &nspaceXml, &indexXml);\n\tif (!result)\n\t\treturn false;\n\n\tif (nspaceXml.isEmpty())\n\t{\n\t\terr::setError(\"module does not contain any documentable items\");\n\t\treturn false;\n\t}\n\n\tresult = generateGroupDocumentation(outputDir, &indexXml);\n\tif (!result)\n\t\treturn false;\n\n\tsl::String nspaceFilePath = io::concatFilePath(outputDir, globalNamespaceFileName);\n\tsl::String indexFilePath = io::concatFilePath(outputDir, indexFileName);\n\n\tio::File file;\n\treturn\n\t\tfile.open(nspaceFilePath, io::FileFlag_Clear) &&\n\t\tfile.write(compoundFileHdr, lengthof(compoundFileHdr)) != -1 &&\n\t\tfile.write(nspaceXml, nspaceXml.getLength()) != -1 &&\n\t\tfile.write(compoundFileTerm, lengthof(compoundFileTerm)) != -1 &&\n\n\t\tfile.open(indexFilePath, io::FileFlag_Clear) &&\n\t\tfile.write(indexFileHdr, lengthof(indexFileHdr)) != -1 &&\n\t\tfile.write(indexXml, indexXml.getLength()) != -1 &&\n\t\tfile.write(indexFileTerm, lengthof(indexFileTerm)) != -1;\n}\n\nbool\nModule::generateGroupDocumentation(\n\tconst sl::StringRef& outputDir,\n\tsl::String* indexXml\n\t)\n{\n\tbool result;\n\n\tstatic char compoundFileHdr[] =\n\t\t\"<?xml version='1.0' encoding='UTF-8' standalone='no'?>\\n\"\n\t\t\"<doxygen>\\n\";\n\n\tstatic char compoundFileTerm[] = \"<\/doxygen>\\n\";\n\n\tsl::String itemXml;\n\n\tsl::Iterator<Group> groupIt = m_groupList.getHead();\n\tfor (; groupIt; groupIt++)\n\t{\n\t\tresult = groupIt->generateDocumentation(outputDir, &itemXml, indexXml);\n\t\tif (!result)\n\t\t\treturn false;\n\n\t\tsl::String refId = groupIt->getRefId();\n\t\tsl::String fileName = sl::String(outputDir) + \"\/\" + refId + \".xml\";\n\n\t\tio::File compoundFile;\n\t\tresult =\n\t\t\tcompoundFile.open(fileName, io::FileFlag_Clear) &&\n\t\t\tcompoundFile.write(compoundFileHdr, lengthof(compoundFileHdr)) != -1 &&\n\t\t\tcompoundFile.write(itemXml, itemXml.getLength()) != -1 &&\n\t\t\tcompoundFile.write(compoundFileTerm, lengthof(compoundFileTerm)) != -1;\n\n\t\tif (!result)\n\t\t\treturn false;\n\t}\n\n\treturn true;\n}\n\n\/\/..............................................................................\n\n} \/\/ namespace dox\n} \/\/ namespace axl\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * File:   PolynomialCircuit.cpp\n * Author: ph4r05\n *\n * Created on April 29, 2014, 4:20 PM\n *\/\n\n#include \"PolynomialCircuit.h\"\n#include \"circuit\/ICircuit.h\"\n#include \"PolynomialCircuitIO.h\"\n#include \"GAPolyCallbacks.h\"\n#include \"Term.h\"\n#include <cmath>\n#include \"XMLProcessor.h\"\n\nPolynomialCircuit::PolynomialCircuit() : ICircuit(CIRCUIT_POLYNOMIAL) { }\n\nPolynomialCircuit::~PolynomialCircuit() { }\n\nstring PolynomialCircuit::shortDescription() {\n    return \"polynomial functions in ANF\";\n}\n\nGAGenome* PolynomialCircuit::createGenome(bool setCallbacks) {\n    \/\/ Has to compute genome dimensions.\n    int numVariables = PolynomialCircuit::getNumVariables();\n    int numPolynomials = PolynomialCircuit::getNumPolynomials();\n    \/\/ Length of one term in terms of POLY_GENOME_ITEM_TYPE.\n    unsigned int termSize = Term::getTermSize(numVariables);\n\n    GA2DArrayGenome<POLY_GENOME_ITEM_TYPE>* g = new GA2DArrayGenome<POLY_GENOME_ITEM_TYPE>(\n            numPolynomials,\n            \/\/ 1 (number of terms) + term size * max number of terms\n            1 + termSize * pGlobals->settings->polyCircuit.maxNumTerms,\n            this->getEvaluator());\n    if (setCallbacks){\n        setGACallbacks(g);\n    }\n    return g;\n}\n\nGAPopulation* PolynomialCircuit::createPopulation() {\n    GAGenome* g = createGenome(true);\n    GAPopulation* population = new GAPopulation(*g, pGlobals->settings->ga.popupationSize);\n    delete g;\n    return population;\n}\n\nbool PolynomialCircuit::postProcess(GAGenome& originalGenome, GAGenome& prunnedGenome) {\n    return false;\n}\n\nint PolynomialCircuit::loadCircuitConfiguration(TiXmlNode* pRoot) {\n    \/\/ parsing EACIRC\/POLYNOMIAL_CIRCUIT\n    pGlobals->settings->polyCircuit.numPolynomials                 = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/NUM_POLYNOMIALS\").c_str());\n    pGlobals->settings->polyCircuit.maxNumTerms                    = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/MAX_NUM_TERMS\").c_str());\n    pGlobals->settings->polyCircuit.mutateTermStrategy             = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/MUTATE_TERM_STRATEGY\").c_str());\n    pGlobals->settings->polyCircuit.genomeInitTermCountProbability = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/TERM_COUNT_PROB\").c_str());\n    pGlobals->settings->polyCircuit.genomeInitTermStopProbability  = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/TERM_VAR_PROB\").c_str());\n    pGlobals->settings->polyCircuit.mutateAddTermProbability       = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/ADD_TERM_PROB\").c_str());\n    pGlobals->settings->polyCircuit.mutateAddTermStrategy          = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/ADD_TERM_STRATEGY\").c_str());\n    pGlobals->settings->polyCircuit.mutateRemoveTermProbability    = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/RM_TERM_PROB\").c_str());\n    pGlobals->settings->polyCircuit.mutateRemoveTermStrategy       = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/RM_TERM_STRATEGY\").c_str());\n    pGlobals->settings->polyCircuit.crossoverRandomizePolySelect   = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/CROSSOVER_RANDOMIZE_POLY\").c_str()) ? true : false;\n    pGlobals->settings->polyCircuit.crossoverTermsProbability      = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/CROSSOVER_TERM_PROB\").c_str());\n\n    \/\/ Sanity checks\n    if (pGlobals->settings->polyCircuit.numPolynomials <= 0\n            || pGlobals->settings->polyCircuit.numPolynomials > pGlobals->settings->main.circuitSizeOutput*BITS_IN_UCHAR){\n        mainLogger.out(LOGGER_ERROR) << \"Number of polynomials not set properly.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.genomeInitTermCountProbability < 0 || pGlobals->settings->polyCircuit.genomeInitTermCountProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Genome initialization term count probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.genomeInitTermStopProbability < 0 || pGlobals->settings->polyCircuit.genomeInitTermStopProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Genome initialization term stop probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.mutateAddTermProbability < 0 || pGlobals->settings->polyCircuit.mutateAddTermProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Mutate add term probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.mutateRemoveTermProbability < 0 || pGlobals->settings->polyCircuit.mutateRemoveTermProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Mutate remove term probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.crossoverTermsProbability < 0 || pGlobals->settings->polyCircuit.crossoverTermsProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Crossover terms probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->ga.replacementSize % 2 == 1) {\n        mainLogger.out(LOGGER_ERROR) << \"GA\/REPLACEMENT_SIZE is odd, polynomials have to use even size of replacement population.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n\n    return STAT_OK;\n}\n<commit_msg>Added sanity check for polynomials count<commit_after>\/*\n * File:   PolynomialCircuit.cpp\n * Author: ph4r05\n *\n * Created on April 29, 2014, 4:20 PM\n *\/\n\n#include \"PolynomialCircuit.h\"\n#include \"circuit\/ICircuit.h\"\n#include \"PolynomialCircuitIO.h\"\n#include \"GAPolyCallbacks.h\"\n#include \"Term.h\"\n#include <cmath>\n#include \"XMLProcessor.h\"\n\nPolynomialCircuit::PolynomialCircuit() : ICircuit(CIRCUIT_POLYNOMIAL) { }\n\nPolynomialCircuit::~PolynomialCircuit() { }\n\nstring PolynomialCircuit::shortDescription() {\n    return \"polynomial functions in ANF\";\n}\n\nGAGenome* PolynomialCircuit::createGenome(bool setCallbacks) {\n    \/\/ Has to compute genome dimensions.\n    int numVariables = PolynomialCircuit::getNumVariables();\n    int numPolynomials = PolynomialCircuit::getNumPolynomials();\n    \/\/ Length of one term in terms of POLY_GENOME_ITEM_TYPE.\n    unsigned int termSize = Term::getTermSize(numVariables);\n\n    GA2DArrayGenome<POLY_GENOME_ITEM_TYPE>* g = new GA2DArrayGenome<POLY_GENOME_ITEM_TYPE>(\n            numPolynomials,\n            \/\/ 1 (number of terms) + term size * max number of terms\n            1 + termSize * pGlobals->settings->polyCircuit.maxNumTerms,\n            this->getEvaluator());\n    if (setCallbacks){\n        setGACallbacks(g);\n    }\n    return g;\n}\n\nGAPopulation* PolynomialCircuit::createPopulation() {\n    GAGenome* g = createGenome(true);\n    GAPopulation* population = new GAPopulation(*g, pGlobals->settings->ga.popupationSize);\n    delete g;\n    return population;\n}\n\nbool PolynomialCircuit::postProcess(GAGenome& originalGenome, GAGenome& prunnedGenome) {\n    return false;\n}\n\nint PolynomialCircuit::loadCircuitConfiguration(TiXmlNode* pRoot) {\n    \/\/ parsing EACIRC\/POLYNOMIAL_CIRCUIT\n    pGlobals->settings->polyCircuit.numPolynomials                 = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/NUM_POLYNOMIALS\").c_str());\n    pGlobals->settings->polyCircuit.maxNumTerms                    = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/MAX_NUM_TERMS\").c_str());\n    pGlobals->settings->polyCircuit.mutateTermStrategy             = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/MUTATE_TERM_STRATEGY\").c_str());\n    pGlobals->settings->polyCircuit.genomeInitTermCountProbability = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/TERM_COUNT_PROB\").c_str());\n    pGlobals->settings->polyCircuit.genomeInitTermStopProbability  = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/TERM_VAR_PROB\").c_str());\n    pGlobals->settings->polyCircuit.mutateAddTermProbability       = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/ADD_TERM_PROB\").c_str());\n    pGlobals->settings->polyCircuit.mutateAddTermStrategy          = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/ADD_TERM_STRATEGY\").c_str());\n    pGlobals->settings->polyCircuit.mutateRemoveTermProbability    = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/RM_TERM_PROB\").c_str());\n    pGlobals->settings->polyCircuit.mutateRemoveTermStrategy       = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/RM_TERM_STRATEGY\").c_str());\n    pGlobals->settings->polyCircuit.crossoverRandomizePolySelect   = atoi(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/CROSSOVER_RANDOMIZE_POLY\").c_str()) ? true : false;\n    pGlobals->settings->polyCircuit.crossoverTermsProbability      = atof(getXMLElementValue(pRoot,\"POLYNOMIAL_CIRCUIT\/CROSSOVER_TERM_PROB\").c_str());\n\n    \/\/ Sanity checks\n    if (pGlobals->settings->polyCircuit.numPolynomials <= 0\n            || pGlobals->settings->polyCircuit.numPolynomials > pGlobals->settings->main.circuitSizeOutput*BITS_IN_UCHAR) {\n        mainLogger.out(LOGGER_ERROR) << \"Number of polynomials <= 0 or > 8 * MAIN\/CIRCUIT_SIZE_OUTPUT.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->main.evaluatorType != 25\n            && pGlobals->settings->polyCircuit.numPolynomials != pGlobals->settings->main.circuitSizeOutput*BITS_IN_UCHAR) {\n        mainLogger.out(LOGGER_ERROR) << \"Number of polynomials is not 8 * MAIN\/CIRCUIT_SIZE_OUTPUT (using evaluator 26 with this polynomials count causes undefined behaviour).\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.genomeInitTermCountProbability < 0 || pGlobals->settings->polyCircuit.genomeInitTermCountProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Genome initialization term count probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.genomeInitTermStopProbability < 0 || pGlobals->settings->polyCircuit.genomeInitTermStopProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Genome initialization term stop probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.mutateAddTermProbability < 0 || pGlobals->settings->polyCircuit.mutateAddTermProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Mutate add term probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.mutateRemoveTermProbability < 0 || pGlobals->settings->polyCircuit.mutateRemoveTermProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Mutate remove term probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->polyCircuit.crossoverTermsProbability < 0 || pGlobals->settings->polyCircuit.crossoverTermsProbability > 1) {\n        mainLogger.out(LOGGER_ERROR) << \"Crossover terms probability is out of bounds.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n    if (pGlobals->settings->ga.replacementSize % 2 == 1) {\n        mainLogger.out(LOGGER_ERROR) << \"GA\/REPLACEMENT_SIZE is odd, polynomials have to use even size of replacement population.\" << endl;\n        return STAT_CONFIG_INCORRECT;\n    }\n\n    return STAT_OK;\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 \"SampleSlide.h\"\n\n#include \"SkCanvas.h\"\n#include \"SkCommonFlags.h\"\n#include \"SkKey.h\"\n#include \"SkOSFile.h\"\n#include \"SkStream.h\"\n\nusing namespace sk_app;\n\nSampleSlide::SampleSlide(const SkViewFactory* factory)\n    : fViewFactory(factory)\n    , fClick(nullptr) {\n    SkView* view = (*factory)();\n    SampleCode::RequestTitle(view, &fName);\n    view->unref();\n}\n\nSampleSlide::~SampleSlide() { delete fClick; }\n\nvoid SampleSlide::draw(SkCanvas* canvas) {\n    SkASSERT(fView);\n    fView->draw(canvas);\n}\n\nvoid SampleSlide::load(SkScalar winWidth, SkScalar winHeight) {\n    fView.reset((*fViewFactory)());\n    fView->setVisibleP(true);\n    fView->setClipToBounds(false);\n    fView->setSize(winWidth, winHeight);\n}\n\nvoid SampleSlide::unload() {\n    fView.reset();\n}\n\nbool SampleSlide::onChar(SkUnichar c) {\n    if (!fView) {\n        return false;\n    }\n    SkEvent evt(gCharEvtName);\n    evt.setFast32(c);\n    return fView->doQuery(&evt);\n}\n\nbool SampleSlide::onMouse(SkScalar x, SkScalar y, Window::InputState state,\n                          uint32_t modifiers) {\n    \/\/ map to SkView modifiers\n    unsigned modifierKeys = 0;\n    modifierKeys |= (state & Window::kShift_ModifierKey) ? kShift_SkModifierKey : 0;\n    modifierKeys |= (state & Window::kControl_ModifierKey) ? kControl_SkModifierKey : 0;\n    modifierKeys |= (state & Window::kOption_ModifierKey) ? kOption_SkModifierKey : 0;\n    modifierKeys |= (state & Window::kCommand_ModifierKey) ? kCommand_SkModifierKey : 0;\n\n    bool handled = false;\n    switch (state) {\n        case Window::kDown_InputState: {\n            delete fClick;\n            fClick = fView->findClickHandler(SkIntToScalar(x), SkIntToScalar(y), modifierKeys);\n            if (fClick) {\n                SkView::DoClickDown(fClick, x, y, modifierKeys);\n                handled = true;\n            }\n            break;\n        }\n        case Window::kMove_InputState: {\n            if (fClick) {\n                SkView::DoClickMoved(fClick, x, y, modifierKeys);\n                handled = true;\n            }\n            break;\n        }\n        case Window::kUp_InputState: {\n            if (fClick) {\n                SkView::DoClickUp(fClick, x, y, modifierKeys);\n                delete fClick;\n                fClick = nullptr;\n                handled = true;\n            }\n            break;\n        }\n    }\n\n    return handled;\n}\n<commit_msg>Roll external\/skia c6f7a4ffa..6f3eac9b5 (1 commits)<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 \"SampleSlide.h\"\n\n#include \"SkCanvas.h\"\n#include \"SkCommonFlags.h\"\n#include \"SkKey.h\"\n#include \"SkOSFile.h\"\n#include \"SkStream.h\"\n\nusing namespace sk_app;\n\nSampleSlide::SampleSlide(const SkViewFactory* factory)\n    : fViewFactory(factory)\n    , fClick(nullptr) {\n    SkView* view = (*factory)();\n    SampleCode::RequestTitle(view, &fName);\n    view->unref();\n}\n\nSampleSlide::~SampleSlide() { delete fClick; }\n\nvoid SampleSlide::draw(SkCanvas* canvas) {\n    SkASSERT(fView);\n    fView->draw(canvas);\n}\n\nvoid SampleSlide::load(SkScalar winWidth, SkScalar winHeight) {\n    fView.reset((*fViewFactory)());\n    fView->setVisibleP(true);\n    fView->setClipToBounds(false);\n    fView->setSize(winWidth, winHeight);\n}\n\nvoid SampleSlide::unload() {\n    fView.reset();\n}\n\nbool SampleSlide::onChar(SkUnichar c) {\n    if (!fView) {\n        return false;\n    }\n    SkEvent evt(gCharEvtName);\n    evt.setFast32(c);\n    return fView->doQuery(&evt);\n}\n\nbool SampleSlide::onMouse(SkScalar x, SkScalar y, Window::InputState state,\n                          uint32_t modifiers) {\n    \/\/ map to SkView modifiers\n    unsigned modifierKeys = 0;\n    modifierKeys |= (modifiers & Window::kShift_ModifierKey) ? kShift_SkModifierKey : 0;\n    modifierKeys |= (modifiers & Window::kControl_ModifierKey) ? kControl_SkModifierKey : 0;\n    modifierKeys |= (modifiers & Window::kOption_ModifierKey) ? kOption_SkModifierKey : 0;\n    modifierKeys |= (modifiers & Window::kCommand_ModifierKey) ? kCommand_SkModifierKey : 0;\n\n    bool handled = false;\n    switch (state) {\n        case Window::kDown_InputState: {\n            delete fClick;\n            fClick = fView->findClickHandler(SkIntToScalar(x), SkIntToScalar(y), modifierKeys);\n            if (fClick) {\n                SkView::DoClickDown(fClick, x, y, modifierKeys);\n                handled = true;\n            }\n            break;\n        }\n        case Window::kMove_InputState: {\n            if (fClick) {\n                SkView::DoClickMoved(fClick, x, y, modifierKeys);\n                handled = true;\n            }\n            break;\n        }\n        case Window::kUp_InputState: {\n            if (fClick) {\n                SkView::DoClickUp(fClick, x, y, modifierKeys);\n                delete fClick;\n                fClick = nullptr;\n                handled = true;\n            }\n            break;\n        }\n    }\n\n    return handled;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* bzflag\n* Copyright (c) 1993 - 2005 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 \"WorldEventManager.h\"\n\n\/\/-------------------BaseEventData--------------------\nBaseEventData::BaseEventData()\n{\n\teventType = eNullEvent;\n}\n\n\/\/-------------------CTFCaptureEventData--------------------\nCTFCaptureEventData::CTFCaptureEventData()\n{\n\teventType = eCaptureEvent;\n\tteamCAped = -1;\n\tteamCaping = -1;\n\tplayerCaping = -1;\n}\n\nCTFCaptureEventData::~CTFCaptureEventData()\n{\n}\n\n\/\/-------------------PlayerDieEventData--------------------\nPlayerDieEventData::PlayerDieEventData()\n{\n\teventType = ePlayerDieEvent;\n\tplayerID = -1;\n\tteamID = -1;\n\tkillerID = -1;\n\tkillerTeamID = -1;\n\n\tpos[0] = pos[1] = pos[2] = 0.0f;\n\trot = 0.0f;\n\ttime = 0.0;\n}\n\nPlayerDieEventData::~PlayerDieEventData()\n{\n}\n\n\/\/-------------------PlayerSpawnEventData--------------------\nPlayerSpawnEventData::PlayerSpawnEventData()\n{\n\teventType = ePlayerSpawnEvent;\n\tplayerID = -1;\n\tteamID = -1;\n\n\tpos[0] = pos[1] = pos[2] = 0.0f;\n\trot = 0.0f;\n\ttime = 0.0;\n}\n\nPlayerSpawnEventData::~PlayerSpawnEventData()\n{\n}\n\n\/\/-------------------ZoneEntryExitEventData--------------------\nZoneEntryExitEventData::ZoneEntryExitEventData()\n{\n\teventType = eZoneEntryEvent;\n\tplayerID = -1;\n\tteamID = -1;\n\tzoneID = -1;\n\n\tpos[0] = pos[1] = pos[2] = 0.0f;\n\trot = 0.0f;\n\ttime = 0.0;\n}\n\nZoneEntryExitEventData::~ZoneEntryExitEventData()\n{\n}\n\n\/\/-------------------PlayerJoinPartEventData--------------------\nPlayerJoinPartEventData::PlayerJoinPartEventData()\n{\n\teventType = ePlayerJoinEvent;\n\n\tplayerID = -1;\n\tteamID = -1;\n\ttime = 0.0;\n}\n\nPlayerJoinPartEventData::~PlayerJoinPartEventData()\n{\n}\n\n\/\/-------------------WorldEventManager--------------------\nWorldEventManager::WorldEventManager()\n{\n}\n\nWorldEventManager::~WorldEventManager()\n{\n\ttmEventMap::iterator teamItr = eventtMap.begin();\n\twhile ( teamItr != eventtMap.end() )\n\t{\n\t\ttmEventTypeList::iterator eventItr = teamItr->second.begin();\n\t\twhile (eventItr == teamItr->second.end())\n\t\t{\n\t\t\ttvEventList::iterator itr = eventItr->second.begin();\n\t\t\twhile ( itr != eventItr->second.end() )\n\t\t\t{\n\t\t\t\tif ((*itr)->autoDelete())\n\t\t\t\t\tdelete (*itr++);\n\t\t\t}\n\t\t\teventItr++;\n\t\t}\n\t\tteamItr++;\n\t}\n}\n\nvoid WorldEventManager::addEvent ( teEventType eventType, int team, BaseEventHandaler* theEvetnt )\n{\n\tif (!theEvetnt)\n\t\treturn;\n\n\ttmEventTypeList*\tteamEvents = getTeamEventList(team);\n\n\tif (teamEvents->find(eventType) == teamEvents->end())\n\t{\n\t\ttvEventList newList;\n\t\t(*teamEvents)[eventType] = newList;\n\t}\n\n\tteamEvents->find(eventType)->second.push_back(theEvetnt);\n}\n\nvoid WorldEventManager::removeEvent ( teEventType eventType, int team, BaseEventHandaler* theEvetnt )\n{\n\tif (!theEvetnt)\n\t\treturn;\n\n\ttmEventTypeList*\tteamEvents = getTeamEventList(team);\n\n\tif (teamEvents->find(eventType) == teamEvents->end())\n\t\treturn;\n\n\ttmEventTypeList::iterator eventTypeItr = teamEvents->begin();\n\tif ( eventTypeItr != teamEvents->end() )\n\t{\n\t\ttvEventList::iterator itr = eventTypeItr->second.begin();\n\t\twhile (itr == eventTypeItr->second.end())\n\t\t{\n\t\t\tif (*itr == theEvetnt)\n\t\t\t\titr = eventTypeItr->second.erase(itr);\n\t\t\telse\n\t\t\t\titr++;\n\t\t}\n\t}\n}\n\ntvEventList WorldEventManager::getEventList ( teEventType eventType, int team )\n\n{\n\ttvEventList\teventList;\n\n\ttmEventTypeList*\tteamEvents = getTeamEventList(team);\n\n\ttmEventTypeList::iterator teamItr = teamEvents->find(eventType);\n\tif ( teamItr == teamEvents->end() )\n\t\treturn eventList;\n\n\teventList = teamItr->second;\n\treturn eventList;\n}\n\nvoid WorldEventManager::callEvents ( teEventType eventType, int team, BaseEventData\t*eventData )\n{\n\tif (!eventData)\n\t\treturn;\n\n\ttvEventList\teventList = getEventList(eventType,team);\n\n\tfor ( unsigned int i = 0; i < eventList.size(); i++)\n\t\teventList[i]->process(eventData);\n}\n\ntmEventTypeList* WorldEventManager::getTeamEventList ( int team )\n{\n\tif (eventtMap.find(team) == eventtMap.end())\n\t{\n\t\ttmEventTypeList newList;\n\t\teventtMap[team] = newList;\n\t}\n\treturn &(eventtMap.find(team)->second);\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>don't delete a null<commit_after>\/* bzflag\n* Copyright (c) 1993 - 2005 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 \"WorldEventManager.h\"\n\n\/\/-------------------BaseEventData--------------------\nBaseEventData::BaseEventData()\n{\n\teventType = eNullEvent;\n}\n\n\/\/-------------------CTFCaptureEventData--------------------\nCTFCaptureEventData::CTFCaptureEventData()\n{\n\teventType = eCaptureEvent;\n\tteamCAped = -1;\n\tteamCaping = -1;\n\tplayerCaping = -1;\n}\n\nCTFCaptureEventData::~CTFCaptureEventData()\n{\n}\n\n\/\/-------------------PlayerDieEventData--------------------\nPlayerDieEventData::PlayerDieEventData()\n{\n\teventType = ePlayerDieEvent;\n\tplayerID = -1;\n\tteamID = -1;\n\tkillerID = -1;\n\tkillerTeamID = -1;\n\n\tpos[0] = pos[1] = pos[2] = 0.0f;\n\trot = 0.0f;\n\ttime = 0.0;\n}\n\nPlayerDieEventData::~PlayerDieEventData()\n{\n}\n\n\/\/-------------------PlayerSpawnEventData--------------------\nPlayerSpawnEventData::PlayerSpawnEventData()\n{\n\teventType = ePlayerSpawnEvent;\n\tplayerID = -1;\n\tteamID = -1;\n\n\tpos[0] = pos[1] = pos[2] = 0.0f;\n\trot = 0.0f;\n\ttime = 0.0;\n}\n\nPlayerSpawnEventData::~PlayerSpawnEventData()\n{\n}\n\n\/\/-------------------ZoneEntryExitEventData--------------------\nZoneEntryExitEventData::ZoneEntryExitEventData()\n{\n\teventType = eZoneEntryEvent;\n\tplayerID = -1;\n\tteamID = -1;\n\tzoneID = -1;\n\n\tpos[0] = pos[1] = pos[2] = 0.0f;\n\trot = 0.0f;\n\ttime = 0.0;\n}\n\nZoneEntryExitEventData::~ZoneEntryExitEventData()\n{\n}\n\n\/\/-------------------PlayerJoinPartEventData--------------------\nPlayerJoinPartEventData::PlayerJoinPartEventData()\n{\n\teventType = ePlayerJoinEvent;\n\n\tplayerID = -1;\n\tteamID = -1;\n\ttime = 0.0;\n}\n\nPlayerJoinPartEventData::~PlayerJoinPartEventData()\n{\n}\n\n\/\/-------------------WorldEventManager--------------------\nWorldEventManager::WorldEventManager()\n{\n}\n\nWorldEventManager::~WorldEventManager()\n{\n\ttmEventMap::iterator teamItr = eventtMap.begin();\n\twhile ( teamItr != eventtMap.end() )\n\t{\n\t\ttmEventTypeList::iterator eventItr = teamItr->second.begin();\n\t\twhile (eventItr == teamItr->second.end())\n\t\t{\n\t\t\ttvEventList::iterator itr = eventItr->second.begin();\n\t\t\twhile ( itr != eventItr->second.end() )\n\t\t\t{\n\t\t\t\tif ((*itr) && (*itr)->autoDelete())\n\t\t\t\t\tdelete (*itr++);\n\t\t\t}\n\t\t\teventItr++;\n\t\t}\n\t\tteamItr++;\n\t}\n}\n\nvoid WorldEventManager::addEvent ( teEventType eventType, int team, BaseEventHandaler* theEvetnt )\n{\n\tif (!theEvetnt)\n\t\treturn;\n\n\ttmEventTypeList*\tteamEvents = getTeamEventList(team);\n\n\tif (teamEvents->find(eventType) == teamEvents->end())\n\t{\n\t\ttvEventList newList;\n\t\t(*teamEvents)[eventType] = newList;\n\t}\n\n\tteamEvents->find(eventType)->second.push_back(theEvetnt);\n}\n\nvoid WorldEventManager::removeEvent ( teEventType eventType, int team, BaseEventHandaler* theEvetnt )\n{\n\tif (!theEvetnt)\n\t\treturn;\n\n\ttmEventTypeList*\tteamEvents = getTeamEventList(team);\n\n\tif (teamEvents->find(eventType) == teamEvents->end())\n\t\treturn;\n\n\ttmEventTypeList::iterator eventTypeItr = teamEvents->begin();\n\tif ( eventTypeItr != teamEvents->end() )\n\t{\n\t\ttvEventList::iterator itr = eventTypeItr->second.begin();\n\t\twhile (itr == eventTypeItr->second.end())\n\t\t{\n\t\t\tif (*itr == theEvetnt)\n\t\t\t\titr = eventTypeItr->second.erase(itr);\n\t\t\telse\n\t\t\t\titr++;\n\t\t}\n\t}\n}\n\ntvEventList WorldEventManager::getEventList ( teEventType eventType, int team )\n\n{\n\ttvEventList\teventList;\n\n\ttmEventTypeList*\tteamEvents = getTeamEventList(team);\n\n\ttmEventTypeList::iterator teamItr = teamEvents->find(eventType);\n\tif ( teamItr == teamEvents->end() )\n\t\treturn eventList;\n\n\teventList = teamItr->second;\n\treturn eventList;\n}\n\nvoid WorldEventManager::callEvents ( teEventType eventType, int team, BaseEventData\t*eventData )\n{\n\tif (!eventData)\n\t\treturn;\n\n\ttvEventList\teventList = getEventList(eventType,team);\n\n\tfor ( unsigned int i = 0; i < eventList.size(); i++)\n\t\teventList[i]->process(eventData);\n}\n\ntmEventTypeList* WorldEventManager::getTeamEventList ( int team )\n{\n\tif (eventtMap.find(team) == eventtMap.end())\n\t{\n\t\ttmEventTypeList newList;\n\t\teventtMap[team] = newList;\n\t}\n\treturn &(eventtMap.find(team)->second);\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>\/******************************************************************************\\\n\n          This file is part of the C! library.  A.K.A the cbang library.\n\n                Copyright (c) 2003-2019, Cauldron Development LLC\n                   Copyright (c) 2003-2017, Stanford University\n                               All rights reserved.\n\n         The C! library 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 of\n               the License, or (at your option) any later version.\n\n        The C! library is distributed in the hope that it will be 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 C! library.  If not, see\n                         <http:\/\/www.gnu.org\/licenses\/>.\n\n        In addition, BSD licensing may be granted on a case by case basis\n        by written permission from at least one of the copyright holders.\n           You may request written permission by emailing the authors.\n\n                  For information regarding this software email:\n                                 Joseph Coffland\n                          joseph@cauldrondevelopment.com\n\n\\******************************************************************************\/\n\n#include \"IPAddress.h\"\n\n#include <cbang\/socket\/Winsock.h>\n\n#include <cbang\/Exception.h>\n#include <cbang\/String.h>\n\n#include <cbang\/log\/Logger.h>\n\n#include <cbang\/socket\/Socket.h>\n\n#include <cbang\/os\/SysError.h>\n\n#ifdef _WIN32\n#include <ws2tcpip.h>\n#include <wspiapi.h>\n\n#else\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#endif\n\n#include <string.h>\n\nusing namespace std;\nusing namespace cb;\n\n\nIPAddress::IPAddress(uint32_t ip, const std::string &host, uint16_t port) :\n  host(host), ip(ip), port(port ? port : portFromString(host)) {\n  Socket::initialize(); \/\/ Windows needs this\n\n  size_t ptr = host.find(\":\");\n  if (ptr != string::npos) this->host = host.substr(0, ptr);\n\n  if (this->host == \"0\") this->host = \"0.0.0.0\"; \/\/ OSX & Windows need this\n}\n\n\nIPAddress::IPAddress(uint32_t ip, uint16_t port) :\n  host(ipToString(ip)), ip(ip), port(port) {}\n\n\nIPAddress::IPAddress(const string &host, uint16_t port) :\n  IPAddress(ipFromString(host), host, port) {}\n\n\nbool IPAddress::hasHost() const {\n  return host.find_first_not_of(\"1234567890. \\t\\n\\r\") != string::npos;\n}\n\n\nvoid IPAddress::lookupHost() {host = hostFromIP(*this);}\n\n\nstring IPAddress::toString() const {\n  return getHost() + (getPort() ? String::printf(\":%u\", getPort()) : string());\n}\n\n\nstring IPAddress::ipToString(uint32_t ip) {\n  return String::printf(\"%u.%u.%u.%u\", ip >> 24, (ip >> 16) & 0xff,\n                        (ip >> 8) & 0xff, ip & 0xff);\n}\n\n\nuint32_t IPAddress::ipFromString(const string &host) {\n  vector<IPAddress> addrs;\n\n  if (!ipsFromString(host, addrs, 0, 1))\n    THROW(\"Could not get IP address for \" << host);\n\n  return addrs[0].getIP();\n}\n\n\nunsigned IPAddress::ipsFromString(const string &host, vector<IPAddress> &addrs,\n                                  uint16_t port, unsigned max) {\n  \/\/ TODO support IPv6 addresses\n\n  Socket::initialize(); \/\/ Windows needs this\n\n  string hostname;\n  size_t ptr = host.find_last_of(\":\");\n  if (ptr != string::npos) {\n    hostname = host.substr(0, ptr);\n    port = String::parseU16(host.substr(ptr + 1));\n\n  } else hostname = host;\n\n  if (hostname == \"0\") hostname = \"0.0.0.0\";\n\n  struct addrinfo hints;\n  struct addrinfo *res = 0;\n  int err;\n\n  memset(&hints, 0, sizeof(hints));\n  hints.ai_family = PF_INET; \/\/ Force IPv4 for now\n  hints.ai_socktype = SOCK_STREAM;\n\n  if ((err = getaddrinfo(hostname.c_str(), 0, &hints, &res)))\n    THROW(\"Could not get IP address for \" << hostname << \": \"\n           << gai_strerror(err));\n\n  unsigned count = 0;\n  struct addrinfo *info;\n  for (info = res; info && (!max || count < max); info = info->ai_next) {\n    if (!info->ai_addr) continue;\n    uint32_t ip = ntohl(((struct sockaddr_in *)info->ai_addr)->sin_addr.s_addr);\n    IPAddress addr(ip, port);\n    addr.host = hostname;\n    addrs.push_back(addr);\n    count++;\n  }\n\n  freeaddrinfo(res);\n\n  return count;\n}\n\n\nstring IPAddress::hostFromIP(const IPAddress &ip) {\n  if (ip.hasHost()) return ip.getHost();\n\n  \/\/ Force 127.0.0.1 to localhost\n  if (ip.getIP() == 0x7f000001) return \"localhost\";\n\n  Socket::initialize(); \/\/ Windows needs this\n\n  struct sockaddr_in addr;\n  char buffer[1024];\n\n  \/\/ TODO support IPv6\n  memset(&addr, 0, sizeof(addr));\n  addr.sin_family = AF_INET;\n  addr.sin_port = htons(ip.getPort());\n  addr.sin_addr.s_addr = htonl(ip.getIP());\n\n  if (getnameinfo((struct sockaddr *)&addr, sizeof(addr), buffer,\n                  sizeof(buffer), 0, 0, 0))\n    THROW(\"Reverse lookup for \" << ip << \" failed: \" << SysError());\n\n  return buffer;\n}\n\n\nuint16_t IPAddress::portFromString(const string &host) {\n  size_t ptr = host.find_last_of(\":\");\n  if (ptr == string::npos) return 0;\n  return String::parseU16(host.substr(ptr + 1));\n}\n<commit_msg>Adding a missing header for FreeBSD.<commit_after>\/******************************************************************************\\\n\n          This file is part of the C! library.  A.K.A the cbang library.\n\n                Copyright (c) 2003-2019, Cauldron Development LLC\n                   Copyright (c) 2003-2017, Stanford University\n                               All rights reserved.\n\n         The C! library 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 of\n               the License, or (at your option) any later version.\n\n        The C! library is distributed in the hope that it will be 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 C! library.  If not, see\n                         <http:\/\/www.gnu.org\/licenses\/>.\n\n        In addition, BSD licensing may be granted on a case by case basis\n        by written permission from at least one of the copyright holders.\n           You may request written permission by emailing the authors.\n\n                  For information regarding this software email:\n                                 Joseph Coffland\n                          joseph@cauldrondevelopment.com\n\n\\******************************************************************************\/\n\n#include \"IPAddress.h\"\n\n#include <cbang\/socket\/Winsock.h>\n\n#include <cbang\/Exception.h>\n#include <cbang\/String.h>\n\n#include <cbang\/log\/Logger.h>\n\n#include <cbang\/socket\/Socket.h>\n\n#include <cbang\/os\/SysError.h>\n\n#ifdef _WIN32\n#include <ws2tcpip.h>\n#include <wspiapi.h>\n\n#else\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#  ifdef __FreeBSD__\n#include <netinet\/in.h>\n#  endif\n#include <netdb.h>\n#endif\n\n#include <string.h>\n\nusing namespace std;\nusing namespace cb;\n\n\nIPAddress::IPAddress(uint32_t ip, const std::string &host, uint16_t port) :\n  host(host), ip(ip), port(port ? port : portFromString(host)) {\n  Socket::initialize(); \/\/ Windows needs this\n\n  size_t ptr = host.find(\":\");\n  if (ptr != string::npos) this->host = host.substr(0, ptr);\n\n  if (this->host == \"0\") this->host = \"0.0.0.0\"; \/\/ OSX & Windows need this\n}\n\n\nIPAddress::IPAddress(uint32_t ip, uint16_t port) :\n  host(ipToString(ip)), ip(ip), port(port) {}\n\n\nIPAddress::IPAddress(const string &host, uint16_t port) :\n  IPAddress(ipFromString(host), host, port) {}\n\n\nbool IPAddress::hasHost() const {\n  return host.find_first_not_of(\"1234567890. \\t\\n\\r\") != string::npos;\n}\n\n\nvoid IPAddress::lookupHost() {host = hostFromIP(*this);}\n\n\nstring IPAddress::toString() const {\n  return getHost() + (getPort() ? String::printf(\":%u\", getPort()) : string());\n}\n\n\nstring IPAddress::ipToString(uint32_t ip) {\n  return String::printf(\"%u.%u.%u.%u\", ip >> 24, (ip >> 16) & 0xff,\n                        (ip >> 8) & 0xff, ip & 0xff);\n}\n\n\nuint32_t IPAddress::ipFromString(const string &host) {\n  vector<IPAddress> addrs;\n\n  if (!ipsFromString(host, addrs, 0, 1))\n    THROW(\"Could not get IP address for \" << host);\n\n  return addrs[0].getIP();\n}\n\n\nunsigned IPAddress::ipsFromString(const string &host, vector<IPAddress> &addrs,\n                                  uint16_t port, unsigned max) {\n  \/\/ TODO support IPv6 addresses\n\n  Socket::initialize(); \/\/ Windows needs this\n\n  string hostname;\n  size_t ptr = host.find_last_of(\":\");\n  if (ptr != string::npos) {\n    hostname = host.substr(0, ptr);\n    port = String::parseU16(host.substr(ptr + 1));\n\n  } else hostname = host;\n\n  if (hostname == \"0\") hostname = \"0.0.0.0\";\n\n  struct addrinfo hints;\n  struct addrinfo *res = 0;\n  int err;\n\n  memset(&hints, 0, sizeof(hints));\n  hints.ai_family = PF_INET; \/\/ Force IPv4 for now\n  hints.ai_socktype = SOCK_STREAM;\n\n  if ((err = getaddrinfo(hostname.c_str(), 0, &hints, &res)))\n    THROW(\"Could not get IP address for \" << hostname << \": \"\n           << gai_strerror(err));\n\n  unsigned count = 0;\n  struct addrinfo *info;\n  for (info = res; info && (!max || count < max); info = info->ai_next) {\n    if (!info->ai_addr) continue;\n    uint32_t ip = ntohl(((struct sockaddr_in *)info->ai_addr)->sin_addr.s_addr);\n    IPAddress addr(ip, port);\n    addr.host = hostname;\n    addrs.push_back(addr);\n    count++;\n  }\n\n  freeaddrinfo(res);\n\n  return count;\n}\n\n\nstring IPAddress::hostFromIP(const IPAddress &ip) {\n  if (ip.hasHost()) return ip.getHost();\n\n  \/\/ Force 127.0.0.1 to localhost\n  if (ip.getIP() == 0x7f000001) return \"localhost\";\n\n  Socket::initialize(); \/\/ Windows needs this\n\n  struct sockaddr_in addr;\n  char buffer[1024];\n\n  \/\/ TODO support IPv6\n  memset(&addr, 0, sizeof(addr));\n  addr.sin_family = AF_INET;\n  addr.sin_port = htons(ip.getPort());\n  addr.sin_addr.s_addr = htonl(ip.getIP());\n\n  if (getnameinfo((struct sockaddr *)&addr, sizeof(addr), buffer,\n                  sizeof(buffer), 0, 0, 0))\n    THROW(\"Reverse lookup for \" << ip << \" failed: \" << SysError());\n\n  return buffer;\n}\n\n\nuint16_t IPAddress::portFromString(const string &host) {\n  size_t ptr = host.find_last_of(\":\");\n  if (ptr == string::npos) return 0;\n  return String::parseU16(host.substr(ptr + 1));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n\n          This file is part of the C! library.  A.K.A the cbang library.\n\n                Copyright (c) 2003-2019, Cauldron Development LLC\n                   Copyright (c) 2003-2017, Stanford University\n                               All rights reserved.\n\n         The C! library 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 of\n               the License, or (at your option) any later version.\n\n        The C! library is distributed in the hope that it will be 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 C! library.  If not, see\n                         <http:\/\/www.gnu.org\/licenses\/>.\n\n        In addition, BSD licensing may be granted on a case by case basis\n        by written permission from at least one of the copyright holders.\n           You may request written permission by emailing the authors.\n\n                  For information regarding this software email:\n                                 Joseph Coffland\n                          joseph@cauldrondevelopment.com\n\n\\******************************************************************************\/\n\n#include \"SystemInfo.h\"\n#include \"PowerManagement.h\"\n#include \"CPUInfo.h\"\n\n#include <cbang\/Info.h>\n#include <cbang\/SStream.h>\n#include <cbang\/String.h>\n\n#include <cbang\/os\/Thread.h>\n#include <cbang\/os\/SystemUtilities.h>\n\n#include <cbang\/log\/Logger.h>\n#include <cbang\/util\/HumanSize.h>\n\n#include <boost\/filesystem\/operations.hpp>\n\n#if defined(_WIN32)\n#define WIN32_LEAN_AND_MEAN \/\/ Avoid including winsock.h\n#include <windows.h>\n\n#elif defined(__APPLE__)\n#include <sys\/types.h>\n#include <sys\/param.h>\n#include <sys\/sysctl.h>\n\n#include <mach\/vm_statistics.h>\n#include <mach\/mach_types.h>\n#include <mach\/mach_init.h>\n#include <mach\/mach_host.h>\n\n#include <CoreFoundation\/CoreFoundation.h>\n#include <CoreServices\/CoreServices.h>\n\n#include \"MacOSUtilities.h\"\n\n#else \/\/ !_MSC_VER && !__APPLE__\n#include <sys\/sysinfo.h>\n#include <sys\/utsname.h>\n#endif\n\n#ifndef _WIN32\n#include <unistd.h>\n#endif\n\nusing namespace cb;\nusing namespace std;\n\nnamespace fs = boost::filesystem;\n\n\nSystemInfo::SystemInfo(Inaccessible) {\n  detectThreads();\n}\n\n\nuint32_t SystemInfo::getCPUCount() const {\n#if defined(_WIN32)\n  SYSTEM_INFO sysinfo;\n  GetSystemInfo(&sysinfo);\n  return sysinfo.dwNumberOfProcessors;\n\n#elif defined(__APPLE__) || defined(__FreeBSD__)\n  int nm[2];\n  size_t length = 4;\n  uint32_t count;\n\n  nm[0] = CTL_HW; nm[1] = HW_AVAILCPU;\n  sysctl(nm, 2, &count, &length, 0, 0);\n\n  if (count < 1) {\n    nm[1] = HW_NCPU;\n    sysctl(nm, 2, &count, &length, 0, 0);\n    if (count < 1) count = 1;\n  }\n\n  return count;\n\n#else\n  return sysconf(_SC_NPROCESSORS_ONLN);\n#endif\n}\n\n\nuint64_t SystemInfo::getMemoryInfo(memory_info_t type) const {\n#if defined(_WIN32)\n  MEMORYSTATUSEX info;\n\n  info.dwLength = sizeof(MEMORYSTATUSEX);\n  GlobalMemoryStatusEx(&info);\n\n  switch (type) {\n  case MEM_INFO_TOTAL: return (uint64_t)info.ullTotalPhys;\n  case MEM_INFO_FREE: return (uint64_t)info.ullAvailPhys;\n  case MEM_INFO_SWAP: return (uint64_t)info.ullAvailPageFile;\n  case MEM_INFO_USABLE:\n    return (uint64_t)(info.ullAvailPhys + info.ullAvailPageFile);\n  }\n\n#elif defined(__APPLE__) || defined(__FreeBSD__)\n  if (type == MEM_INFO_TOTAL) {\n    int64_t memory;\n    int mib[2];\n    size_t length = 2;\n\n    mib[0] = CTL_HW;\n    mib[1] = HW_MEMSIZE;\n    length = sizeof(int64_t);\n\n    if (!sysctl(mib, 2, &memory, &length, 0, 0)) return memory;\n\n  } else {\n    vm_size_t page;\n    vm_statistics_data_t stats;\n    mach_msg_type_number_t count = sizeof(stats) \/ sizeof(natural_t);\n    mach_port_t port = mach_host_self();\n\n    if (host_page_size(port, &page) == KERN_SUCCESS &&\n        host_statistics(port, HOST_VM_INFO, (host_info_t)&stats, &count) ==\n        KERN_SUCCESS)\n      switch (type) {\n      case MEM_INFO_TOTAL: break; \/\/ Handled above\n      case MEM_INFO_FREE: return (uint64_t)(stats.free_count * page);\n      case MEM_INFO_SWAP: return 0; \/\/ Not sure how to get this on OSX\n      case MEM_INFO_USABLE:\n        \/\/ An IBM article says this should be free + inactive + file-backed\n        \/\/ pages.  No idea how to get at file-backed pages.\n        return (uint64_t)((stats.free_count + stats.inactive_count) * page);\n      }\n  }\n\n#else\n  struct sysinfo info;\n  if (!sysinfo(&info))\n    switch (type) {\n    case MEM_INFO_TOTAL: return (uint64_t)(info.totalram * info.mem_unit);\n    case MEM_INFO_FREE: return (uint64_t)(info.freeram * info.mem_unit);\n    case MEM_INFO_SWAP: return (uint64_t)(info.freeswap * info.mem_unit);\n    case MEM_INFO_USABLE:\n      return (uint64_t)((info.freeram + info.bufferram + info.freeswap) *\n                        info.mem_unit);\n    }\n#endif\n\n  return 0;\n}\n\n\nuint64_t SystemInfo::getFreeDiskSpace(const string &path) {\n  fs::space_info si;\n\n  try {\n    si = fs::space(path);\n\n  } catch (const fs::filesystem_error &e) {\n    THROW(\"Could not get disk space at '\" << path << \"': \" << e.what());\n  }\n\n  return si.available;\n}\n\n\nVersion SystemInfo::getOSVersion() const {\n#if defined(_WIN32)\n  OSVERSIONINFO info;\n  ZeroMemory(&info, sizeof(info));\n  info.dwOSVersionInfoSize = sizeof(info);\n  if (!GetVersionEx(&info)) THROW(\"Failed to get Windows version\");\n\n  return Version((uint8_t)info.dwMajorVersion, (uint8_t)info.dwMinorVersion);\n\n#elif defined(__APPLE__)\n  return MacOSUtilities::getMacOSVersion();\n\n#else\n  struct utsname i;\n\n  uname(&i);\n  string release = i.release;\n  size_t dot = release.find('.');\n  uint8_t major = String::parseU32(release.substr(0, dot));\n  uint8_t minor = String::parseU32(release.substr(dot + 1));\n\n  return Version(major, minor);\n#endif\n}\n\n\nvoid SystemInfo::add(Info &info) {\n  const char *category = \"System\";\n  auto cpuInfo = CPUInfo::create();\n\n  info.add(category, \"CPU\", cpuInfo->getBrand());\n  info.add(category, \"CPU ID\", SSTR(\n             cpuInfo->getVendor()\n             << \" Family \"   << cpuInfo->getFamily()\n             << \" Model \"    << cpuInfo->getModel()\n             << \" Stepping \" << cpuInfo->getStepping()));\n  info.add(category, \"CPUs\", String(getCPUCount()));\n\n  info.add(category, \"Memory\", HumanSize(getTotalMemory()).toString() + \"B\");\n  info.add(category, \"Free Memory\",\n           HumanSize(getFreeMemory()).toString() + \"B\");\n  info.add(category, \"Threads\", getThreadsType().toString());\n\n  Version osVersion = getOSVersion();\n  info.add(category, \"OS Version\", osVersion.toString());\n\n  info.add(category, \"Has Battery\",\n           String(PowerManagement::instance().hasBattery()));\n  info.add(category, \"On Battery\",\n           String(PowerManagement::instance().onBattery()));\n}\n\n\n\n\nvoid SystemInfo::detectThreads() {\n  \/\/ Threads type\n#ifdef _WIN32\n  threadsType = ThreadsType::WINDOWS_THREADS;\n\n#elif __linux__\n  \/\/ Test for LinuxThreads which has a different PID for each thread\n  struct TestThread : public Thread {\n    unsigned pid;\n    TestThread() : pid(0) {}\n    void run() {pid = SystemUtilities::getPID();}\n  };\n\n  TestThread testThread;\n  testThread.start();\n  testThread.join();\n\n  if (testThread.pid != SystemUtilities::getPID())\n    threadsType = ThreadsType::LINUX_THREADS;\n  else threadsType = ThreadsType::POSIX_THREADS;\n\n#else \/\/ __linux__\n  \/\/ Assume POSIX\n  threadsType = ThreadsType::POSIX_THREADS;\n#endif\n}\n<commit_msg>Improve CPU count detection in Windows. re:#81<commit_after>\/******************************************************************************\\\n\n          This file is part of the C! library.  A.K.A the cbang library.\n\n                Copyright (c) 2003-2019, Cauldron Development LLC\n                   Copyright (c) 2003-2017, Stanford University\n                               All rights reserved.\n\n         The C! library 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 of\n               the License, or (at your option) any later version.\n\n        The C! library is distributed in the hope that it will be 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 C! library.  If not, see\n                         <http:\/\/www.gnu.org\/licenses\/>.\n\n        In addition, BSD licensing may be granted on a case by case basis\n        by written permission from at least one of the copyright holders.\n           You may request written permission by emailing the authors.\n\n                  For information regarding this software email:\n                                 Joseph Coffland\n                          joseph@cauldrondevelopment.com\n\n\\******************************************************************************\/\n\n#include \"SystemInfo.h\"\n#include \"PowerManagement.h\"\n#include \"CPUInfo.h\"\n\n#include <cbang\/Info.h>\n#include <cbang\/SStream.h>\n#include <cbang\/String.h>\n\n#include <cbang\/os\/Thread.h>\n#include <cbang\/os\/SystemUtilities.h>\n\n#include <cbang\/log\/Logger.h>\n#include <cbang\/util\/HumanSize.h>\n\n#include <boost\/filesystem\/operations.hpp>\n\n#if defined(_WIN32)\n#define WIN32_LEAN_AND_MEAN \/\/ Avoid including winsock.h\n#include <windows.h>\n#include <sysinfoapi.h>\n\n#elif defined(__APPLE__)\n#include <sys\/types.h>\n#include <sys\/param.h>\n#include <sys\/sysctl.h>\n\n#include <mach\/vm_statistics.h>\n#include <mach\/mach_types.h>\n#include <mach\/mach_init.h>\n#include <mach\/mach_host.h>\n\n#include <CoreFoundation\/CoreFoundation.h>\n#include <CoreServices\/CoreServices.h>\n\n#include \"MacOSUtilities.h\"\n\n#else \/\/ !_MSC_VER && !__APPLE__\n#include <sys\/sysinfo.h>\n#include <sys\/utsname.h>\n#endif\n\n#ifndef _WIN32\n#include <unistd.h>\n#endif\n\nusing namespace cb;\nusing namespace std;\n\nnamespace fs = boost::filesystem;\n\n\nSystemInfo::SystemInfo(Inaccessible) {\n  detectThreads();\n}\n\n\nuint32_t SystemInfo::getCPUCount() const {\n#if defined(_WIN32)\n  \/\/ Count active CPU threads\n  DWORD len = 0;\n\n  if (!GetLogicalProcessorInformationEx(RelationGroup, 0, &len)) {\n    SmartPointer<uint8_t>::Array buffer = new uint8_t[len];\n    auto info = (PSYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX *)buffer.get();\n\n    if (!GetLogicalProcessorInformationEx(RelationGroup, info, &len)) {\n      uint32_t cpus = 0;\n\n      for (unsigned i = 0; i < len;) {\n        info = (PSYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX *)&buffer[i];\n\n        for (unsigned j = 0; j < info->Group.ActiveGroupCount; j++) {\n          cpus += info->Group.GroupInfo[j].ActiveProcessorCount;\n\n        i += info->Size;\n      }\n\n      if (cpus) return cpus;\n    }\n  }\n\n  \/\/ Fallback to old method\n  SYSTEM_INFO info;\n  GetSystemInfo(&info);\n  return info.dwNumberOfProcessors;\n\n#elif defined(__APPLE__) || defined(__FreeBSD__)\n  int nm[2];\n  size_t length = 4;\n  uint32_t count;\n\n  nm[0] = CTL_HW; nm[1] = HW_AVAILCPU;\n  sysctl(nm, 2, &count, &length, 0, 0);\n\n  if (count < 1) {\n    nm[1] = HW_NCPU;\n    sysctl(nm, 2, &count, &length, 0, 0);\n    if (count < 1) count = 1;\n  }\n\n  return count;\n\n#else\n  return sysconf(_SC_NPROCESSORS_ONLN);\n#endif\n}\n\n\nuint64_t SystemInfo::getMemoryInfo(memory_info_t type) const {\n#if defined(_WIN32)\n  MEMORYSTATUSEX info;\n\n  info.dwLength = sizeof(MEMORYSTATUSEX);\n  GlobalMemoryStatusEx(&info);\n\n  switch (type) {\n  case MEM_INFO_TOTAL: return (uint64_t)info.ullTotalPhys;\n  case MEM_INFO_FREE: return (uint64_t)info.ullAvailPhys;\n  case MEM_INFO_SWAP: return (uint64_t)info.ullAvailPageFile;\n  case MEM_INFO_USABLE:\n    return (uint64_t)(info.ullAvailPhys + info.ullAvailPageFile);\n  }\n\n#elif defined(__APPLE__) || defined(__FreeBSD__)\n  if (type == MEM_INFO_TOTAL) {\n    int64_t memory;\n    int mib[2];\n    size_t length = 2;\n\n    mib[0] = CTL_HW;\n    mib[1] = HW_MEMSIZE;\n    length = sizeof(int64_t);\n\n    if (!sysctl(mib, 2, &memory, &length, 0, 0)) return memory;\n\n  } else {\n    vm_size_t page;\n    vm_statistics_data_t stats;\n    mach_msg_type_number_t count = sizeof(stats) \/ sizeof(natural_t);\n    mach_port_t port = mach_host_self();\n\n    if (host_page_size(port, &page) == KERN_SUCCESS &&\n        host_statistics(port, HOST_VM_INFO, (host_info_t)&stats, &count) ==\n        KERN_SUCCESS)\n      switch (type) {\n      case MEM_INFO_TOTAL: break; \/\/ Handled above\n      case MEM_INFO_FREE: return (uint64_t)(stats.free_count * page);\n      case MEM_INFO_SWAP: return 0; \/\/ Not sure how to get this on OSX\n      case MEM_INFO_USABLE:\n        \/\/ An IBM article says this should be free + inactive + file-backed\n        \/\/ pages.  No idea how to get at file-backed pages.\n        return (uint64_t)((stats.free_count + stats.inactive_count) * page);\n      }\n  }\n\n#else\n  struct sysinfo info;\n  if (!sysinfo(&info))\n    switch (type) {\n    case MEM_INFO_TOTAL: return (uint64_t)(info.totalram * info.mem_unit);\n    case MEM_INFO_FREE: return (uint64_t)(info.freeram * info.mem_unit);\n    case MEM_INFO_SWAP: return (uint64_t)(info.freeswap * info.mem_unit);\n    case MEM_INFO_USABLE:\n      return (uint64_t)((info.freeram + info.bufferram + info.freeswap) *\n                        info.mem_unit);\n    }\n#endif\n\n  return 0;\n}\n\n\nuint64_t SystemInfo::getFreeDiskSpace(const string &path) {\n  fs::space_info si;\n\n  try {\n    si = fs::space(path);\n\n  } catch (const fs::filesystem_error &e) {\n    THROW(\"Could not get disk space at '\" << path << \"': \" << e.what());\n  }\n\n  return si.available;\n}\n\n\nVersion SystemInfo::getOSVersion() const {\n#if defined(_WIN32)\n  OSVERSIONINFO info;\n  ZeroMemory(&info, sizeof(info));\n  info.dwOSVersionInfoSize = sizeof(info);\n  if (!GetVersionEx(&info)) THROW(\"Failed to get Windows version\");\n\n  return Version((uint8_t)info.dwMajorVersion, (uint8_t)info.dwMinorVersion);\n\n#elif defined(__APPLE__)\n  return MacOSUtilities::getMacOSVersion();\n\n#else\n  struct utsname i;\n\n  uname(&i);\n  string release = i.release;\n  size_t dot = release.find('.');\n  uint8_t major = String::parseU32(release.substr(0, dot));\n  uint8_t minor = String::parseU32(release.substr(dot + 1));\n\n  return Version(major, minor);\n#endif\n}\n\n\nvoid SystemInfo::add(Info &info) {\n  const char *category = \"System\";\n  auto cpuInfo = CPUInfo::create();\n\n  info.add(category, \"CPU\", cpuInfo->getBrand());\n  info.add(category, \"CPU ID\", SSTR(\n             cpuInfo->getVendor()\n             << \" Family \"   << cpuInfo->getFamily()\n             << \" Model \"    << cpuInfo->getModel()\n             << \" Stepping \" << cpuInfo->getStepping()));\n  info.add(category, \"CPUs\", String(getCPUCount()));\n\n  info.add(category, \"Memory\", HumanSize(getTotalMemory()).toString() + \"B\");\n  info.add(category, \"Free Memory\",\n           HumanSize(getFreeMemory()).toString() + \"B\");\n  info.add(category, \"Threads\", getThreadsType().toString());\n\n  Version osVersion = getOSVersion();\n  info.add(category, \"OS Version\", osVersion.toString());\n\n  info.add(category, \"Has Battery\",\n           String(PowerManagement::instance().hasBattery()));\n  info.add(category, \"On Battery\",\n           String(PowerManagement::instance().onBattery()));\n}\n\n\n\n\nvoid SystemInfo::detectThreads() {\n  \/\/ Threads type\n#ifdef _WIN32\n  threadsType = ThreadsType::WINDOWS_THREADS;\n\n#elif __linux__\n  \/\/ Test for LinuxThreads which has a different PID for each thread\n  struct TestThread : public Thread {\n    unsigned pid;\n    TestThread() : pid(0) {}\n    void run() {pid = SystemUtilities::getPID();}\n  };\n\n  TestThread testThread;\n  testThread.start();\n  testThread.join();\n\n  if (testThread.pid != SystemUtilities::getPID())\n    threadsType = ThreadsType::LINUX_THREADS;\n  else threadsType = ThreadsType::POSIX_THREADS;\n\n#else \/\/ __linux__\n  \/\/ Assume POSIX\n  threadsType = ThreadsType::POSIX_THREADS;\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STL\n#include <cassert>\n#include <ostream>\n\/\/ StdAir\n#include <stdair\/basic\/BasConst_BomDisplay.hpp>\n#include <stdair\/bom\/BomManager.hpp>\n\/\/ SEvMgr\n#include <sevmgr\/SEVMGR_Service.hpp>\n#include <sevmgr\/SEVMGR_Types.hpp>\n\/\/ TraDemGen\n#include <trademgen\/bom\/DemandStream.hpp>\n#include <trademgen\/bom\/BomDisplay.hpp>\n\nnamespace TRADEMGEN {\n\n  \/**\n   * Helper singleton structure to store the current formatting flags\n   * of any given output stream. The flags are re-set at the\n   * structure destruction.\n   *\/\n  struct FlagSaver {\n  public:\n    \/** Constructor. *\/\n    FlagSaver (std::ostream& oStream)\n      : _oStream (oStream), _streamFlags (oStream.flags()) {\n    }\n\n    \/** Destructor. *\/\n    ~FlagSaver() {\n      \/\/ Reset formatting flags of the given output stream\n      _oStream.flags (_streamFlags);\n    }\n    \n  private:\n    \/** Reference on the STL stream, for which the flags must be saved. *\/\n    std::ostream& _oStream;\n    \/** Saved STL stream flags. *\/\n    std::ios::fmtflags _streamFlags;\n  };\n\n  \/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  std::string BomDisplay::csvDisplay (const SEVMGR::SEVMGR_ServicePtr_T iSEVMGR_ServicePtr) {\n    std::ostringstream oStream;\n\n    \/**\n     * Bom root level (only)\n     *\/\n    oStream << std::endl;\n    oStream << \"===============================================================\"\n            << std::endl;\n    oStream << \"EventQueue: \" << iSEVMGR_ServicePtr->describeKey() << std::endl;\n    oStream << \"===============================================================\"\n            << std::endl;\n\n    \/\/ Check whether there are DemandStream objects\n    const bool hasEventGeneratorList =\n      iSEVMGR_ServicePtr->hasEventGeneratorList<DemandStream>();\n    if (hasEventGeneratorList == false) {\n      return oStream.str();\n    }\n    \n    \/\/ Retrieve the DemandStream list\n    const DemandStreamList_T& lDemandStreamList =\n      iSEVMGR_ServicePtr->getEventGeneratorList<DemandStream>();\n\n    \/\/ Browse the inventories\n    for (DemandStreamList_T::const_iterator itDemandStream =\n           lDemandStreamList.begin();\n         itDemandStream != lDemandStreamList.end(); ++itDemandStream) {\n      DemandStream* lDemandStream_ptr = *itDemandStream;\n      assert (lDemandStream_ptr != NULL);\n\n      \/\/ Display the demand stream\n      csvDisplay (oStream, *lDemandStream_ptr);\n    }\n\n    return oStream.str();\n  }\n\n  \/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  void BomDisplay::csvDisplay (std::ostream& oStream,\n                               const DemandStream& iDemandStream) {\n    \/\/ Save the formatting flags for the given STL output stream\n    FlagSaver flagSaver (oStream);\n\n    \/**\n     * DemandStream level (only)\n     *\/\n    oStream << \"+++++++++++++++++++++++++++++++++++++++++++++++++\" << std::endl;\n    oStream << iDemandStream.display();\n    oStream << \"+++++++++++++++++++++++++++++++++++++++++++++++++\" << std::endl;\n  }\n\n}\n<commit_msg>[Dev] Added an assertion around a (shared) pointer.<commit_after>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STL\n#include <cassert>\n#include <ostream>\n\/\/ StdAir\n#include <stdair\/basic\/BasConst_BomDisplay.hpp>\n#include <stdair\/bom\/BomManager.hpp>\n\/\/ SEvMgr\n#include <sevmgr\/SEVMGR_Service.hpp>\n#include <sevmgr\/SEVMGR_Types.hpp>\n\/\/ TraDemGen\n#include <trademgen\/bom\/DemandStream.hpp>\n#include <trademgen\/bom\/BomDisplay.hpp>\n\nnamespace TRADEMGEN {\n\n  \/**\n   * Helper singleton structure to store the current formatting flags\n   * of any given output stream. The flags are re-set at the\n   * structure destruction.\n   *\/\n  struct FlagSaver {\n  public:\n    \/** Constructor. *\/\n    FlagSaver (std::ostream& oStream)\n      : _oStream (oStream), _streamFlags (oStream.flags()) {\n    }\n\n    \/** Destructor. *\/\n    ~FlagSaver() {\n      \/\/ Reset formatting flags of the given output stream\n      _oStream.flags (_streamFlags);\n    }\n    \n  private:\n    \/** Reference on the STL stream, for which the flags must be saved. *\/\n    std::ostream& _oStream;\n    \/** Saved STL stream flags. *\/\n    std::ios::fmtflags _streamFlags;\n  };\n\n  \/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  std::string BomDisplay::csvDisplay (const SEVMGR::SEVMGR_ServicePtr_T iSEVMGR_ServicePtr) {\n    std::ostringstream oStream;\n\n\t\/\/\n\tassert (iSEVMGR_ServicePtr != NULL);\n\n    \/**\n     * Bom root level (only)\n     *\/\n    oStream << std::endl;\n    oStream << \"===============================================================\"\n            << std::endl;\n    oStream << \"EventQueue: \" << iSEVMGR_ServicePtr->describeKey() << std::endl;\n    oStream << \"===============================================================\"\n            << std::endl;\n\n    \/\/ Check whether there are DemandStream objects\n    const bool hasEventGeneratorList =\n      iSEVMGR_ServicePtr->hasEventGeneratorList<DemandStream>();\n    if (hasEventGeneratorList == false) {\n      return oStream.str();\n    }\n    \n    \/\/ Retrieve the DemandStream list\n    const DemandStreamList_T& lDemandStreamList =\n      iSEVMGR_ServicePtr->getEventGeneratorList<DemandStream>();\n\n    \/\/ Browse the inventories\n    for (DemandStreamList_T::const_iterator itDemandStream =\n           lDemandStreamList.begin();\n         itDemandStream != lDemandStreamList.end(); ++itDemandStream) {\n      DemandStream* lDemandStream_ptr = *itDemandStream;\n      assert (lDemandStream_ptr != NULL);\n\n      \/\/ Display the demand stream\n      csvDisplay (oStream, *lDemandStream_ptr);\n    }\n\n    return oStream.str();\n  }\n\n  \/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  void BomDisplay::csvDisplay (std::ostream& oStream,\n                               const DemandStream& iDemandStream) {\n    \/\/ Save the formatting flags for the given STL output stream\n    FlagSaver flagSaver (oStream);\n\n    \/**\n     * DemandStream level (only)\n     *\/\n    oStream << \"+++++++++++++++++++++++++++++++++++++++++++++++++\" << std::endl;\n    oStream << iDemandStream.display();\n    oStream << \"+++++++++++++++++++++++++++++++++++++++++++++++++\" << std::endl;\n  }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ values_runtime.cpp\n\/\/\n\/\/ Identification: src\/codegen\/values_runtime.cpp\n\/\/\n\/\/ Copyright (c) 2015-17, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"codegen\/values_runtime.h\"\n\n#include \"common\/logger.h\"\n#include \"type\/type_util.h\"\n#include \"type\/value_factory.h\"\n#include \"type\/value_peeker.h\"\n\nnamespace peloton {\nnamespace codegen {\n\nvoid ValuesRuntime::OutputTinyInt(char *values, uint32_t idx, int8_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetTinyIntValue(val);\n}\n\nvoid ValuesRuntime::OutputSmallInt(char *values, uint32_t idx, int16_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetSmallIntValue(val);\n}\n\nvoid ValuesRuntime::OutputInteger(char *values, uint32_t idx, int32_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetIntegerValue(val);\n}\n\nvoid ValuesRuntime::OutputBigInt(char *values, uint32_t idx, int64_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetBigIntValue(val);\n}\n\nvoid ValuesRuntime::OutputTimestamp(char *values, uint32_t idx, int64_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetTimestampValue(val);\n}\n\nvoid ValuesRuntime::OutputDecimal(char *values, uint32_t idx, double val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetDecimalValue(val);\n}\n\nvoid ValuesRuntime::OutputVarchar(char *values, uint32_t idx, char *str,\n                                  uint32_t len) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  std::string string_val{str, len - 1};\n  vals[idx] = type::ValueFactory::GetVarcharValue(string_val);\n}\n\nint32_t ValuesRuntime::CompareStrings(const char *str1, uint32_t len1,\n                                      const char *str2, uint32_t len2) {\n  return type::TypeUtil::CompareStrings(str1, len1, str2, len2);\n}\n\n}  \/\/ namespace codegen\n}  \/\/ namespace peloton\n<commit_msg>Fix memory leak<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ values_runtime.cpp\n\/\/\n\/\/ Identification: src\/codegen\/values_runtime.cpp\n\/\/\n\/\/ Copyright (c) 2015-17, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"codegen\/values_runtime.h\"\n\n#include \"common\/logger.h\"\n#include \"type\/type_util.h\"\n#include \"type\/value_factory.h\"\n#include \"type\/value_peeker.h\"\n\nnamespace peloton {\nnamespace codegen {\n\nvoid ValuesRuntime::OutputTinyInt(char *values, uint32_t idx, int8_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetTinyIntValue(val);\n}\n\nvoid ValuesRuntime::OutputSmallInt(char *values, uint32_t idx, int16_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetSmallIntValue(val);\n}\n\nvoid ValuesRuntime::OutputInteger(char *values, uint32_t idx, int32_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetIntegerValue(val);\n}\n\nvoid ValuesRuntime::OutputBigInt(char *values, uint32_t idx, int64_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetBigIntValue(val);\n}\n\nvoid ValuesRuntime::OutputTimestamp(char *values, uint32_t idx, int64_t val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetTimestampValue(val);\n}\n\nvoid ValuesRuntime::OutputDecimal(char *values, uint32_t idx, double val) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetDecimalValue(val);\n}\n\nvoid ValuesRuntime::OutputVarchar(char *values, uint32_t idx, char *str,\n                                  UNUSED_ATTRIBUTE uint32_t len) {\n  type::Value *vals = reinterpret_cast<type::Value *>(values);\n  vals[idx] = type::ValueFactory::GetVarcharValue(str, false);\n}\n\nint32_t ValuesRuntime::CompareStrings(const char *str1, uint32_t len1,\n                                      const char *str2, uint32_t len2) {\n  return type::TypeUtil::CompareStrings(str1, len1, str2, len2);\n}\n\n}  \/\/ namespace codegen\n}  \/\/ namespace peloton\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          util.cpp\n* Purpose:       Implementation of wxExtension utility methods\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/clipbrd.h>\n#include <wx\/config.h>\n#include <wx\/file.h>\n#include <wx\/regex.h>\n#include <wx\/stdpaths.h>\n#include <wx\/textfile.h> \/\/ for wxTextFile::GetEOL()\n#include <wx\/tokenzr.h>\n#include <wx\/extension\/util.h>\n#include <wx\/extension\/frame.h>\n#include <wx\/extension\/frd.h>\n\nconst wxString wxExAlignText(\n  const wxString& lines,\n  const wxString& header,\n  bool fill_out_with_space,\n  bool fill_out,\n  const wxExLexer& lexer)\n{\n  const size_t line_length = lexer.UsableCharactersPerLine();\n\n  \/\/ Use the header, with one space extra to separate, or no header at all.\n  const wxString header_with_spaces =\n    (header.size() == 0) ? wxEmptyString : wxString(' ', header.size());\n\n  wxString in = lines, line = header;\n\n  bool at_begin = true;\n  wxString out;\n\n  while (!in.empty())\n  {\n    const wxString word = wxExGetWord(in, false, false);\n\n    if (line.size() + 1 + word.size() > line_length)\n    {\n      out << lexer.MakeSingleLineComment(line, fill_out_with_space, fill_out) << \"\\n\";\n\n      line = header_with_spaces + word;\n    }\n    else\n    {\n      line += (!line.empty() && !at_begin ? wxString(\" \"): wxEmptyString) + word;\n      at_begin = false;\n    }\n  }\n\n  out << lexer.MakeSingleLineComment(line, fill_out_with_space, fill_out);\n\n  return out;\n}\n\nbool wxExClipboardAdd(const wxString& text)\n{\n  wxClipboardLocker locker;\n  if (!locker) return false;\n  if (!wxTheClipboard->AddData(new wxTextDataObject(text))) return false;\n\n  \/\/ Take care that clipboard data remain after exiting\n  \/\/ This is a boolean method as well, we don't check it, as\n  \/\/ clipboard data is copied.\n  \/\/ At least on Ubuntu 8.10 FLush returns false.\n  wxTheClipboard->Flush();\n\n  return true;\n}\n\nconst wxString wxExClipboardGet()\n{\n  wxBusyCursor wait;\n  wxClipboardLocker locker;\n\n  if (!locker)\n  {\n    wxLogError(\"Cannot open clipboard\");\n    return wxEmptyString;\n  }\n\n  if (!wxTheClipboard->IsSupported(wxDF_TEXT))\n  {\n    wxLogError(\"Clipboard format not supported\");\n    return wxEmptyString;\n  }\n\n  wxTextDataObject data;\n  if (!wxTheClipboard->GetData(data))\n  {\n    wxLogError(\"Cannot get clipboard data\");\n    return wxEmptyString;\n  }\n\n  return data.GetText();\n}\n\n#if wxUSE_GUI\nvoid wxExComboBoxFromString(\n  wxComboBox* cb,\n  const wxString& text)\n{\n  wxASSERT(cb != NULL);\n\n  wxStringTokenizer tkz(\n    text, \n    wxExFindReplaceData::Get()->GetFieldSeparator());\n\n  while (tkz.HasMoreTokens())\n  {\n    const wxString val = tkz.GetNextToken();\n    if (cb->FindString(val) == wxNOT_FOUND)\n    {\n      cb->Append(val);\n    }\n  }\n\n  if (cb->GetCount() > 0) \n  {\n    cb->SetValue(cb->GetString(0));\n  }\n}\n\nconst wxString wxExComboBoxToString(\n  const wxComboBox* cb,\n  size_t max_items)\n{\n  wxASSERT(cb != NULL);\n\n  wxString text = cb->GetValue();\n\n  switch (cb->FindString(cb->GetValue()))\n  {\n    case 0: \n      text.clear();\n      \/\/ No change necessary, the string is already present as the first one.\n      for (size_t i = 0; i < max_items; i++)\n        if (i < cb->GetCount())\n          text += cb->GetString(i) + wxExFindReplaceData::Get()->GetFieldSeparator();\n      break;\n\n    case wxNOT_FOUND:\n      \/\/ Add the string, as it is not in the combo box, to the text,\n      \/\/ simply by appending all combobox items.\n      for (size_t i = 0; i < max_items - 1; i++)\n        if (i < cb->GetCount())\n          text += wxExFindReplaceData::Get()->GetFieldSeparator() + cb->GetString(i);\n    break;\n\n    default:\n      \/\/ Reorder. The new first element already present, just add all others.\n      for (size_t i = 0; i < cb->GetCount(); i++)\n      {\n        const wxString cb_element = cb->GetString(i);\n        if (cb_element != cb->GetValue())\n          text += wxExFindReplaceData::Get()->GetFieldSeparator() + cb_element;\n      }\n  }\n\n  return text;\n}\n\nconst wxString wxExConfigFirstOf(const wxString& key)\n{\n  const wxString value = wxConfigBase::Get()->Read(key);\n  return value.BeforeFirst(wxExFindReplaceData::Get()->GetFieldSeparator());\n}\n\n#endif \/\/ wxUSE_GUI\n\nconst wxString wxExEllipsed(const wxString& text, const wxString& control)\n{\n  return text + \"...\" + (!control.empty() ? \"\\t\" + control: wxEmptyString);\n}\n\nvoid wxExFindResult(\n  const wxString& find_text,\n  bool find_next, \n  bool recursive)\n{\n  if (!recursive)\n  {\n    const wxString where = (find_next) ? _(\"bottom\"): _(\"top\");\n\n#if wxUSE_STATUSBAR\n    wxExFrame::StatusText(\n      _(\"Searching for\") + \" \" + wxExQuoted(wxExSkipWhiteSpace(find_text)) + \" \" + \n      _(\"hit\") + \" \" + where);\n#endif\n  }\n  else\n  {\n    wxBell();\n\n#if wxUSE_STATUSBAR\n    wxExFrame::StatusText(\n      wxExQuoted(wxExSkipWhiteSpace(find_text)) + \" \" + _(\"not found\"));\n#endif\n  }\n}\n\nconst wxString wxExGetEndOfText(\n  const wxString& text,\n  size_t max_chars)\n{\n  wxString text_out(text);\n\n  if (text_out.length() > max_chars)\n  {\n    text_out = \"...\" + text_out.substr(text_out.length() - max_chars);\n  }\n\n  return text_out;\n}\n\nint wxExGetNumberOfLines(const wxString& text)\n{\n  if (text.empty())\n  {\n    return 0;\n  }\n  else if (text.Find(wxUniChar('\\r')) != wxNOT_FOUND)\n  {\n    return text.Freq(wxUniChar('\\r')) + 1;\n  }\n  else if (text.Find(wxUniChar('\\n')) != wxNOT_FOUND)\n  {\n    return text.Freq(wxUniChar('\\n')) + 1;\n  }\n  else\n  {\n    return 1;\n  }\n}\n\nint wxExGetLineNumberFromText(const wxString& text)\n{\n  \/\/ Get text after :.\n  const size_t pos_char = text.rfind(\":\");\n\n  if (pos_char == wxString::npos)\n  {\n    return 0;\n  }\n\n  const wxString linenumber = text.substr(pos_char + 1);\n\n  long line;\n\n  if (linenumber.ToLong(&line))\n  {\n    return line;\n  }\n  else\n  {\n    return 0;\n  }\n}\n\nconst wxString wxExGetWord(\n  wxString& text,\n  bool use_other_field_separators,\n  bool use_path_separator)\n{\n  wxString field_separators = \" \\t\";\n  if (use_other_field_separators) field_separators += \":\";\n  if (use_path_separator) field_separators = wxFILE_SEP_PATH;\n  wxString token;\n  wxStringTokenizer tkz(text, field_separators);\n  if (tkz.HasMoreTokens()) token = tkz.GetNextToken();\n  text = tkz.GetString();\n  text.Trim(false);\n  return token;\n}\n\nbool wxExMatchesOneOf(const wxFileName& filename, const wxString& pattern)\n{\n  if (pattern == \"*\") return true; \/\/ asterix matches always.\n\n  const wxString fullname_uppercase = filename.GetFullName().Upper();\n\n  wxStringTokenizer tokenizer(pattern.Upper(), \";\");\n  while (tokenizer.HasMoreTokens())\n  {\n    if (fullname_uppercase.Matches(tokenizer.GetNextToken())) return true;\n  }\n\n  return false;\n}\n\n#if wxUSE_GUI\nbool wxExOpenFile(const wxFileName& filename, long open_flags)\n{\n  wxASSERT(wxTheApp != NULL);\n\n  wxWindow* window = wxTheApp->GetTopWindow();\n  wxExFrame* frame = wxDynamicCast(window, wxExFrame);\n\n  if (frame != NULL)\n  {\n    return frame->OpenFile(\n      wxExFileName(filename.GetFullPath()), -1, wxEmptyString, open_flags);\n  }\n  else\n  {\n    return false;\n  }\n}\n#endif\n\nconst wxString wxExPrintCaption(const wxFileName& filename)\n{\n  if (filename.FileExists())\n  {\n    return filename.GetFullPath();\n  }\n  else\n  {\n    return _(\"Printout\");\n  }\n}\n\nconst wxString wxExPrintFooter()\n{\n  return _(\"Page @PAGENUM@ of @PAGESCNT@\");\n}\n\nconst wxString wxExPrintHeader(const wxFileName& filename)\n{\n  if (filename.FileExists())\n  {\n    return\n      wxExGetEndOfText(filename.GetFullPath(), 20) + \" \" +\n      filename.GetModificationTime().Format() + \" \" +\n      wxDateTime::Now().Format();\n  }\n  else\n  {\n    return _(\"Printed\") + \": \" + wxDateTime::Now().Format();\n  }\n}\n\nconst wxString wxExQuoted(const wxString& text)\n{\n  return \"'\" + text + \"'\";\n}\n\nconst wxString wxExSkipWhiteSpace(const wxString& text, const wxString& replace_with)\n{\n  wxString output = text;\n  wxRegEx(\"[ \\t\\n]+\").ReplaceAll(&output, replace_with);\n  return output;\n}\n\nconst wxString wxExTranslate(const wxString& text, int pageNum, int numPages)\n{\n  wxString translation = text;\n  wxString num;\n\n  num.Printf(\"%i\", pageNum);\n  translation.Replace(\"@PAGENUM@\", num);\n\n  num.Printf(\"%i\", numPages);\n  translation.Replace(\"@PAGESCNT@\", num);\n\n  return translation;\n}\n<commit_msg>fix for Ubuntu?\\011<commit_after>\/******************************************************************************\\\n* File:          util.cpp\n* Purpose:       Implementation of wxExtension utility methods\n* Author:        Anton van Wezenbeek\n* RCS-ID:        $Id$\n*\n* Copyright (c) 2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/clipbrd.h>\n#include <wx\/config.h>\n#include <wx\/file.h>\n#include <wx\/regex.h>\n#include <wx\/stdpaths.h>\n#include <wx\/textfile.h> \/\/ for wxTextFile::GetEOL()\n#include <wx\/tokenzr.h>\n#include <wx\/extension\/util.h>\n#include <wx\/extension\/frame.h>\n#include <wx\/extension\/frd.h>\n\nconst wxString wxExAlignText(\n  const wxString& lines,\n  const wxString& header,\n  bool fill_out_with_space,\n  bool fill_out,\n  const wxExLexer& lexer)\n{\n  const size_t line_length = lexer.UsableCharactersPerLine();\n\n  \/\/ Use the header, with one space extra to separate, or no header at all.\n  const wxString header_with_spaces =\n    (header.size() == 0) ? wxEmptyString : wxString(' ', header.size());\n\n  wxString in = lines, line = header;\n\n  bool at_begin = true;\n  wxString out;\n\n  while (!in.empty())\n  {\n    const wxString word = wxExGetWord(in, false, false);\n\n    if (line.size() + 1 + word.size() > line_length)\n    {\n      out << lexer.MakeSingleLineComment(line, fill_out_with_space, fill_out) << \"\\n\";\n\n      line = header_with_spaces + word;\n    }\n    else\n    {\n      line += (!line.empty() && !at_begin ? wxString(\" \"): wxEmptyString) + word;\n      at_begin = false;\n    }\n  }\n\n  out << lexer.MakeSingleLineComment(line, fill_out_with_space, fill_out);\n\n  return out;\n}\n\nbool wxExClipboardAdd(const wxString& text)\n{\n  wxClipboardLocker locker;\n  if (!locker) return false;\n  if (!wxTheClipboard->AddData(new wxTextDataObject(text))) return false;\n\n  \/\/ Take care that clipboard data remain after exiting\n  \/\/ This is a boolean method as well, we don't check it, as\n  \/\/ clipboard data is copied.\n  \/\/ At least on Ubuntu 8.10 FLush returns false.\n  wxTheClipboard->Flush();\n\n  return true;\n}\n\nconst wxString wxExClipboardGet()\n{\n  wxBusyCursor wait;\n  wxClipboardLocker locker;\n\n  if (!locker)\n  {\n    wxLogError(\"Cannot open clipboard\");\n    return wxEmptyString;\n  }\n\n  if (!wxTheClipboard->IsSupported(wxDF_TEXT))\n  {\n    wxLogError(\"Clipboard format not supported\");\n    return wxEmptyString;\n  }\n\n  wxTextDataObject data;\n  if (!wxTheClipboard->GetData(data))\n  {\n    wxLogError(\"Cannot get clipboard data\");\n    return wxEmptyString;\n  }\n\n  return data.GetText();\n}\n\n#if wxUSE_GUI\nvoid wxExComboBoxFromString(\n  wxComboBox* cb,\n  const wxString& text)\n{\n  wxASSERT(cb != NULL);\n\n  wxStringTokenizer tkz(\n    text, \n    wxExFindReplaceData::Get()->GetFieldSeparator());\n\n  while (tkz.HasMoreTokens())\n  {\n    const wxString val = tkz.GetNextToken();\n    if (cb->FindString(val) == wxNOT_FOUND)\n    {\n      cb->Append(val);\n    }\n  }\n\n  if (cb->GetCount() > 0) \n  {\n    cb->SetValue(cb->GetString(0));\n  }\n}\n\nconst wxString wxExComboBoxToString(\n  const wxComboBox* cb,\n  size_t max_items)\n{\n  wxASSERT(cb != NULL);\n\n  wxString text = cb->GetValue();\n\n  switch (cb->FindString(cb->GetValue()))\n  {\n    case 0: \n      text.clear();\n      \/\/ No change necessary, the string is already present as the first one.\n      for (size_t i = 0; i < max_items; i++)\n        if (i < cb->GetCount())\n          text += cb->GetString(i) + wxExFindReplaceData::Get()->GetFieldSeparator();\n      break;\n\n    case wxNOT_FOUND:\n      \/\/ Add the string, as it is not in the combo box, to the text,\n      \/\/ simply by appending all combobox items.\n      for (size_t i = 0; i < max_items - 1; i++)\n        if (i < cb->GetCount())\n          text += wxExFindReplaceData::Get()->GetFieldSeparator() + cb->GetString(i);\n    break;\n\n    default:\n      \/\/ Reorder. The new first element already present, just add all others.\n      for (size_t i = 0; i < cb->GetCount(); i++)\n      {\n        const wxString cb_element = cb->GetString(i);\n        if (cb_element != cb->GetValue())\n          text += wxExFindReplaceData::Get()->GetFieldSeparator() + cb_element;\n      }\n  }\n\n  return text;\n}\n\nconst wxString wxExConfigFirstOf(const wxString& key)\n{\n  const wxString value = wxConfigBase::Get()->Read(key);\n  return value.BeforeFirst(wxExFindReplaceData::Get()->GetFieldSeparator());\n}\n\n#endif \/\/ wxUSE_GUI\n\nconst wxString wxExEllipsed(const wxString& text, const wxString& control)\n{\n  return text + \"...\" + (!control.empty() ? \"\\t\" + control: wxString(wxEmptyString));\n}\n\nvoid wxExFindResult(\n  const wxString& find_text,\n  bool find_next, \n  bool recursive)\n{\n  if (!recursive)\n  {\n    const wxString where = (find_next) ? _(\"bottom\"): _(\"top\");\n\n#if wxUSE_STATUSBAR\n    wxExFrame::StatusText(\n      _(\"Searching for\") + \" \" + wxExQuoted(wxExSkipWhiteSpace(find_text)) + \" \" + \n      _(\"hit\") + \" \" + where);\n#endif\n  }\n  else\n  {\n    wxBell();\n\n#if wxUSE_STATUSBAR\n    wxExFrame::StatusText(\n      wxExQuoted(wxExSkipWhiteSpace(find_text)) + \" \" + _(\"not found\"));\n#endif\n  }\n}\n\nconst wxString wxExGetEndOfText(\n  const wxString& text,\n  size_t max_chars)\n{\n  wxString text_out(text);\n\n  if (text_out.length() > max_chars)\n  {\n    text_out = \"...\" + text_out.substr(text_out.length() - max_chars);\n  }\n\n  return text_out;\n}\n\nint wxExGetNumberOfLines(const wxString& text)\n{\n  if (text.empty())\n  {\n    return 0;\n  }\n  else if (text.Find(wxUniChar('\\r')) != wxNOT_FOUND)\n  {\n    return text.Freq(wxUniChar('\\r')) + 1;\n  }\n  else if (text.Find(wxUniChar('\\n')) != wxNOT_FOUND)\n  {\n    return text.Freq(wxUniChar('\\n')) + 1;\n  }\n  else\n  {\n    return 1;\n  }\n}\n\nint wxExGetLineNumberFromText(const wxString& text)\n{\n  \/\/ Get text after :.\n  const size_t pos_char = text.rfind(\":\");\n\n  if (pos_char == wxString::npos)\n  {\n    return 0;\n  }\n\n  const wxString linenumber = text.substr(pos_char + 1);\n\n  long line;\n\n  if (linenumber.ToLong(&line))\n  {\n    return line;\n  }\n  else\n  {\n    return 0;\n  }\n}\n\nconst wxString wxExGetWord(\n  wxString& text,\n  bool use_other_field_separators,\n  bool use_path_separator)\n{\n  wxString field_separators = \" \\t\";\n  if (use_other_field_separators) field_separators += \":\";\n  if (use_path_separator) field_separators = wxFILE_SEP_PATH;\n  wxString token;\n  wxStringTokenizer tkz(text, field_separators);\n  if (tkz.HasMoreTokens()) token = tkz.GetNextToken();\n  text = tkz.GetString();\n  text.Trim(false);\n  return token;\n}\n\nbool wxExMatchesOneOf(const wxFileName& filename, const wxString& pattern)\n{\n  if (pattern == \"*\") return true; \/\/ asterix matches always.\n\n  const wxString fullname_uppercase = filename.GetFullName().Upper();\n\n  wxStringTokenizer tokenizer(pattern.Upper(), \";\");\n  while (tokenizer.HasMoreTokens())\n  {\n    if (fullname_uppercase.Matches(tokenizer.GetNextToken())) return true;\n  }\n\n  return false;\n}\n\n#if wxUSE_GUI\nbool wxExOpenFile(const wxFileName& filename, long open_flags)\n{\n  wxASSERT(wxTheApp != NULL);\n\n  wxWindow* window = wxTheApp->GetTopWindow();\n  wxExFrame* frame = wxDynamicCast(window, wxExFrame);\n\n  if (frame != NULL)\n  {\n    return frame->OpenFile(\n      wxExFileName(filename.GetFullPath()), -1, wxEmptyString, open_flags);\n  }\n  else\n  {\n    return false;\n  }\n}\n#endif\n\nconst wxString wxExPrintCaption(const wxFileName& filename)\n{\n  if (filename.FileExists())\n  {\n    return filename.GetFullPath();\n  }\n  else\n  {\n    return _(\"Printout\");\n  }\n}\n\nconst wxString wxExPrintFooter()\n{\n  return _(\"Page @PAGENUM@ of @PAGESCNT@\");\n}\n\nconst wxString wxExPrintHeader(const wxFileName& filename)\n{\n  if (filename.FileExists())\n  {\n    return\n      wxExGetEndOfText(filename.GetFullPath(), 20) + \" \" +\n      filename.GetModificationTime().Format() + \" \" +\n      wxDateTime::Now().Format();\n  }\n  else\n  {\n    return _(\"Printed\") + \": \" + wxDateTime::Now().Format();\n  }\n}\n\nconst wxString wxExQuoted(const wxString& text)\n{\n  return \"'\" + text + \"'\";\n}\n\nconst wxString wxExSkipWhiteSpace(const wxString& text, const wxString& replace_with)\n{\n  wxString output = text;\n  wxRegEx(\"[ \\t\\n]+\").ReplaceAll(&output, replace_with);\n  return output;\n}\n\nconst wxString wxExTranslate(const wxString& text, int pageNum, int numPages)\n{\n  wxString translation = text;\n  wxString num;\n\n  num.Printf(\"%i\", pageNum);\n  translation.Replace(\"@PAGENUM@\", num);\n\n  num.Printf(\"%i\", numPages);\n  translation.Replace(\"@PAGESCNT@\", num);\n\n  return translation;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2017 Advanced Micro Devices, Inc.\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 <iostream>\n#include <cstdio>\n\n#include \"activ_driver.hpp\"\n#include \"bn_driver.hpp\"\n#include \"conv_driver.hpp\"\n#include \"driver.hpp\"\n#include \"gemm_driver.hpp\"\n#include \"lrn_driver.hpp\"\n#include \"pool_driver.hpp\"\n#include \"softmax_driver.hpp\"\n#include \"rnn_driver.hpp\"\n#include \"miopen\/config.h\"\n\nint main(int argc, char* argv[])\n{\n    \/\/ show command\n    std::cout << \"MIOpenDriver:\";\n    for(int i = 1; i < argc; i++)\n        std::cout << \" \" << argv[i];\n    std::cout << std::endl;\n\n    std::string base_arg = ParseBaseArg(argc, argv);\n\n    Driver* drv;\n    if(base_arg == \"conv\")\n    {\n        drv = new ConvDriver<float, float>();\n    }\n    else if(base_arg == \"convfp16\")\n    {\n        drv = new ConvDriver<float16, double>();\n    }\n    else if(base_arg == \"pool\")\n    {\n        drv = new PoolDriver<float, double>();\n    }\n    else if(base_arg == \"poolfp16\")\n    {\n        drv = new PoolDriver<float16, double>();\n    }\n    else if(base_arg == \"lrn\")\n    {\n        drv = new LRNDriver<float, double>();\n    }\n    else if(base_arg == \"lrnfp16\")\n    {\n        drv = new LRNDriver<float16, double>();\n    }\n    else if(base_arg == \"activ\")\n    {\n        drv = new ActivationDriver<float, double>();\n    }\n    else if(base_arg == \"activfp16\")\n    {\n        drv = new ActivationDriver<float16, double>();\n    }\n    else if(base_arg == \"softmax\")\n    {\n        drv = new SoftmaxDriver<float, double>();\n    }\n    else if(base_arg == \"softmaxfp16\")\n    {\n        drv = new SoftmaxDriver<float16, double>();\n    }\n    else if(base_arg == \"gemm\")\n    {\n        drv = new GemmDriver<float>();\n    }\n    \/\/ TODO half is not supported in gemm\n    \/\/#if MIOPEN_USE_MIOPENGEMM\n    \/\/    else if(base_arg == \"gemmfp16\")\n    \/\/    {\n    \/\/        drv = new GemmDriver<float16>();\n    \/\/    }\n    \/\/#endif\n    else if(base_arg == \"bnorm\")\n    {\n        drv = new BatchNormDriver<float, double>();\n    }\n    else if(base_arg == \"bnormfp16\")\n    {\n        drv = new BatchNormDriver<float16, double>();\n    }\n    else if(base_arg == \"rnn\")\n    {\n        drv = new RNNDriver<float>();\n    }\n    else\n    {\n        printf(\"Incorrect BaseArg\\n\");\n        exit(0);\n    }\n\n    drv->AddCmdLineArgs();\n    drv->ParseCmdLineArgs(argc, argv);\n    drv->GetandSetData();\n    drv->AllocateBuffersAndCopy();\n\n    int fargval     = drv->GetInputFlags().GetValueInt(\"forw\");\n    bool bnFwdInVer = (fargval == 2 && (base_arg == \"bnorm\"));\n    bool verifyarg  = (drv->GetInputFlags().GetValueInt(\"verify\") == 1);\n\n    if((fargval != 2) || bnFwdInVer)\n    {\n        drv->RunForwardGPU();\n    }\n\n    if(verifyarg)\n    {\n        if(base_arg != \"gemm\")\n        {\n            if(fargval != 2 || bnFwdInVer)\n            {\n                drv->VerifyForward();\n            }\n        }\n        else\n        {\n            printf(\"GEMM verification done in the GEMM library\\n\");\n        }\n    }\n\n    if(fargval != 1)\n    {\n        if(base_arg != \"gemm\")\n        {\n            drv->RunBackwardGPU();\n            if(verifyarg)\n            {\n                drv->VerifyBackward();\n            }\n        }\n    }\n\n    return 0;\n}\n<commit_msg>use double to validate on CPU<commit_after>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2017 Advanced Micro Devices, Inc.\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 <iostream>\n#include <cstdio>\n\n#include \"activ_driver.hpp\"\n#include \"bn_driver.hpp\"\n#include \"conv_driver.hpp\"\n#include \"driver.hpp\"\n#include \"gemm_driver.hpp\"\n#include \"lrn_driver.hpp\"\n#include \"pool_driver.hpp\"\n#include \"softmax_driver.hpp\"\n#include \"rnn_driver.hpp\"\n#include \"miopen\/config.h\"\n\nint main(int argc, char* argv[])\n{\n    \/\/ show command\n    std::cout << \"MIOpenDriver:\";\n    for(int i = 1; i < argc; i++)\n        std::cout << \" \" << argv[i];\n    std::cout << std::endl;\n\n    std::string base_arg = ParseBaseArg(argc, argv);\n\n    Driver* drv;\n    if(base_arg == \"conv\")\n    {\n        drv = new ConvDriver<float, double>();\n    }\n    else if(base_arg == \"convfp16\")\n    {\n        drv = new ConvDriver<float16, double>();\n    }\n    else if(base_arg == \"pool\")\n    {\n        drv = new PoolDriver<float, double>();\n    }\n    else if(base_arg == \"poolfp16\")\n    {\n        drv = new PoolDriver<float16, double>();\n    }\n    else if(base_arg == \"lrn\")\n    {\n        drv = new LRNDriver<float, double>();\n    }\n    else if(base_arg == \"lrnfp16\")\n    {\n        drv = new LRNDriver<float16, double>();\n    }\n    else if(base_arg == \"activ\")\n    {\n        drv = new ActivationDriver<float, double>();\n    }\n    else if(base_arg == \"activfp16\")\n    {\n        drv = new ActivationDriver<float16, double>();\n    }\n    else if(base_arg == \"softmax\")\n    {\n        drv = new SoftmaxDriver<float, double>();\n    }\n    else if(base_arg == \"softmaxfp16\")\n    {\n        drv = new SoftmaxDriver<float16, double>();\n    }\n    else if(base_arg == \"gemm\")\n    {\n        drv = new GemmDriver<float>();\n    }\n    \/\/ TODO half is not supported in gemm\n    \/\/#if MIOPEN_USE_MIOPENGEMM\n    \/\/    else if(base_arg == \"gemmfp16\")\n    \/\/    {\n    \/\/        drv = new GemmDriver<float16>();\n    \/\/    }\n    \/\/#endif\n    else if(base_arg == \"bnorm\")\n    {\n        drv = new BatchNormDriver<float, double>();\n    }\n    else if(base_arg == \"bnormfp16\")\n    {\n        drv = new BatchNormDriver<float16, double>();\n    }\n    else if(base_arg == \"rnn\")\n    {\n        drv = new RNNDriver<float>();\n    }\n    else\n    {\n        printf(\"Incorrect BaseArg\\n\");\n        exit(0);\n    }\n\n    drv->AddCmdLineArgs();\n    drv->ParseCmdLineArgs(argc, argv);\n    drv->GetandSetData();\n    drv->AllocateBuffersAndCopy();\n\n    int fargval     = drv->GetInputFlags().GetValueInt(\"forw\");\n    bool bnFwdInVer = (fargval == 2 && (base_arg == \"bnorm\"));\n    bool verifyarg  = (drv->GetInputFlags().GetValueInt(\"verify\") == 1);\n\n    if((fargval != 2) || bnFwdInVer)\n    {\n        drv->RunForwardGPU();\n    }\n\n    if(verifyarg)\n    {\n        if(base_arg != \"gemm\")\n        {\n            if(fargval != 2 || bnFwdInVer)\n            {\n                drv->VerifyForward();\n            }\n        }\n        else\n        {\n            printf(\"GEMM verification done in the GEMM library\\n\");\n        }\n    }\n\n    if(fargval != 1)\n    {\n        if(base_arg != \"gemm\")\n        {\n            drv->RunBackwardGPU();\n            if(verifyarg)\n            {\n                drv->VerifyBackward();\n            }\n        }\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright © 2015 Slack Technologies, Inc. All rights reserved.\n\/\/\n\n#include \"slack\/http.h\"\n\nnamespace slack\n{\nnamespace http\n{\n\nstd::function<response(std::string url, params)> get;\nstd::function<response(std::string url, params)> post;\n\n} \/\/namespace http\n} \/\/namespace slack\n<commit_msg>Use CPR by default now.<commit_after>\/\/\n\/\/ Copyright © 2015 Slack Technologies, Inc. All rights reserved.\n\/\/\n\n#include \"slack\/http.h\"\n#include <cpr.h>\n\nnamespace slack\n{\nnamespace http\n{\n\nstd::function<response(std::string url, params)> get = [](std::string url, slack::http::params params) -> slack::http::response {\n    cpr::Parameters p;\n    for (auto &kv : params)\n    {\n        p.AddParameter({kv.first, kv.second});\n    }\n\n    auto response = cpr::Get(cpr::Url{url}, p);\n\n    return {static_cast<uint32_t>(response.status_code), response.text};\n};\n\nstd::function<response(std::string url, params)> post = [](std::string url, slack::http::params params) -> slack::http::response {\n    cpr::Parameters p;\n    for (auto &kv : params)\n    {\n        p.AddParameter({kv.first, kv.second});\n    }\n\n    auto response = cpr::Post(cpr::Url{url}, p);\n\n    return {static_cast<uint32_t>(response.status_code), response.text};\n};\n\n} \/\/namespace http\n} \/\/namespace slack\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fixed issue being stuck on non x64 arch<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n *  SystemFunctions.cpp\n *  OpenLieroX\n *\n *  Created by Albert Zeyer on 01.12.09.\n *  code under LGPL\n *\n *\/\n\n\n\n#include <iomanip>\n#include <time.h>\n#include <SDL.h>\n#define Font Font_Xlib \/\/ Hack to prevent name clash in precompiled header\n#include <SDL_syswm.h>\n#undef Font\n#ifdef REAL_OPENGL\n#include <SDL_opengl.h>\n#endif\n#include <cstdlib>\n#include <sstream>\n#include <cstring>\n\n#if defined(__APPLE__)\n#include <mach\/host_info.h>\n#include <mach\/mach_host.h>\n#include <mach\/mach_init.h>\n#include <sys\/sysctl.h>\n#include <mach\/mach_traps.h>\n#elif defined(WIN32) || defined(WIN64)\n#include <windows.h>\n#else\n#include <cstdio>\n#include <unistd.h>\n#endif\n\n#ifdef __FREEBSD__\n#include <sys\/sysctl.h>\n#include <vm\/vm_param.h>\n#include <sys\/vmmeter.h>\n#endif\n\n#ifndef WIN32\n#include <sys\/types.h>\n#include <sys\/resource.h>\n#include <unistd.h>\n#include <signal.h>\n#endif\n\n#include \"StringUtils.h\"\n#include \"ThreadPool.h\"\n#include \"util\/macros.h\"\n\n#if !defined(WIN32) || defined(HAVE_PTHREAD)\n#include <pthread.h>\n#ifndef HAVE_PTHREAD\n#define HAVE_PTHREAD\n#endif\n\n#ifndef HAVE_PTHREAD_NAME\n\/\/ pthread_setname_np only available since MacOSX SDK 10.6\n#if defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6) && MAC_OS_X_VERSION_MIN_REQUIRED >= MAC_OS_X_VERSION_10_6\n#define HAVE_PTHREAD_NAME\n\/\/ glibc 2.12 introduced this\n#elif __GLIBC_PREREQ(2,12)\n#define HAVE_PTHREAD_NAME\n#endif\n#endif\n\n#endif\n\n\n\n#ifdef THREADNAME_VIA_SIGUSR1\nstatic void setCurThreadName__signalraiser(const char* name) {\n#ifndef _MSC_VER\n\t\/\/ this signal is only for debuggers, we should ignore it\n\tsignal( SIGUSR1, SIG_IGN );\n\n\t\/\/ KDevelop will catch this, read the 'name' parameter and continue execution\n\traise( SIGUSR1 );\n#endif\n}\n#endif\n\n\nThreadId getCurrentThreadId() {\n#ifdef HAVE_PTHREAD\n\treturn (ThreadId) pthread_self();\n#else\n\t\/\/ SDL_ThreadID returns a Uint32.\n\t\/\/ On 64bit systems, this might not be enough information about the current thread.\n\t\/\/ Win64 thread HANDLE is 64bit, aswell as pthread_t.\n\treturn (ThreadId) SDL_ThreadID();\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Gives a name to the thread\n\/\/ Code taken from http:\/\/www.codeproject.com\/KB\/threads\/Name_threads_in_debugger.aspx\nvoid setCurThreadName(const std::string& name)\n{\n#ifdef _MSC_VER \/\/ Currently only for MSVC, haven't found a Windows-general way (I doubt there is one)\n\ttypedef struct tagTHREADNAME_INFO\n\t{\n\t\tDWORD dwType; \/\/ Must be 0x1000.\n\t\tLPCSTR szName; \/\/ Pointer to name (in user addr space).\n\t\tDWORD dwThreadID; \/\/ Thread ID (-1=caller thread).\n\t\tDWORD dwFlags; \/\/ Reserved for future use, must be zero.\n\t} THREADNAME_INFO;\n\t\n\tTHREADNAME_INFO info;\n\t{\n\t\tinfo.dwType = 0x1000;\n\t\tinfo.szName = name.c_str();\n\t\tinfo.dwThreadID = (DWORD)-1;\n\t\tinfo.dwFlags = 0;\n\t}\n\t\n\t__try\n\t{\n\t\tRaiseException( 0x406D1388 \/* MSVC EXCEPTION *\/, 0, sizeof(info)\/sizeof(DWORD), (DWORD*)&info );\n\t}\n\t__except (EXCEPTION_CONTINUE_EXECUTION)\n\t{\n\t}\n#endif\n\n#ifdef THREADNAME_VIA_SIGUSR1\n\tsetCurThreadName__signalraiser(name.c_str());\n#endif\n\n#ifdef HAVE_PTHREAD_NAME\n\tpthread_setname_np(pthread_self(), name.c_str());\n#endif\n}\n\nstd::string getThreadName(ThreadId tid) {\n#ifdef HAVE_PTHREAD_NAME\n\tchar buf[128] = \"\\0\";\n\tif(pthread_getname_np((pthread_t) tid, buf, sizeof(buf)) == 0)\n\t\tif(strlen(buf) > 0)\n\t\t\treturn buf;\n#endif\n\n\tif(threadPool) {\n\t\tstd::map<ThreadId, std::string> threads;\n\t\tthreadPool->getAllWorkingThreads(threads);\n\t\tforeach(t, threads) {\n\t\t\tif(t->first == tid)\n\t\t\t\treturn t->second;\n\t\t}\n\t}\n\n\treturn \"\";\n}\n\nvoid setCurThreadPriority(float p) {\n#ifdef WIN32\n\t\n#elif defined(__APPLE__)\n\t\/\/int curp = getpriority(PRIO_DARWIN_THREAD, 0); \n\t\/\/int newp = p >= 0 ? 0 : 1;\n\t\/\/notes << \"curp:\" << curp << \", newp:\" << newp << endl;\n\t\/\/setpriority(PRIO_DARWIN_THREAD, 0, newp);\n#endif\n}\n\n\n\nsize_t GetFreeSysMemory() {\n#if defined(__APPLE__)\n\tvm_statistics_data_t page_info;\n\tvm_size_t pagesize;\n\tmach_msg_type_number_t count;\n\tkern_return_t kret;\n\t\n\tpagesize = 0;\n\tkret = host_page_size (mach_host_self(), &pagesize);\n\tcount = HOST_VM_INFO_COUNT;\n\t\n\tkret = host_statistics (mach_host_self(), HOST_VM_INFO,(host_info_t)&page_info, &count);\n\treturn page_info.free_count * pagesize;\n#elif defined(__WIN64__)\n\tMEMORYSTATUSEX memStatex;\n\tmemStatex.dwLength = sizeof (memStatex);\n\t::GlobalMemoryStatusEx (&memStatex);\n\treturn memStatex.ullAvailPhys;\n#elif defined(__WIN32__)\n\tMEMORYSTATUS memStatus;\n\tmemStatus.dwLength = sizeof(MEMORYSTATUS);\n\t::GlobalMemoryStatus(&memStatus);\n\treturn memStatus.dwAvailPhys;\n#elif defined(__SUN__) && defined(_SC_AVPHYS_PAGES)\n\treturn sysconf(_SC_AVPHYS_PAGES) * sysconf(_SC_PAGESIZE);\n#elif defined(__FREEBSD__)\n\tint vm_vmtotal[] = { CTL_VM, VM_METER };\n\tstruct vmtotal vmdata;\n\t\n\tsize_t len = sizeof(vmdata);\n\tint result = sysctl(vm_vmtotal, sizeof(vm_vmtotal) \/ sizeof(*vm_vmtotal), &vmdata, &len, NULL, 0);\n\tif(result != 0) return 0;\n\t\n\treturn vmdata.t_free * sysconf(_SC_PAGESIZE);\n#elif defined(__linux__)\n\t\n\t\/\/ get it from \/proc\/meminfo\n\tFILE *fp = fopen(\"\/proc\/meminfo\", \"r\");\n\tif ( fp )\n\t{\n\t\tunsigned long freeMem = 0;\n\t\tunsigned long buffersMem = 0;\n\t\tunsigned long cachedMem = 0;\n\t\tstruct SearchTerm { const char* name; unsigned long* var; };\n\t\tSearchTerm terms[] = { {\"MemFree:\", &freeMem}, {\"Buffers:\", &buffersMem}, {\"Cached:\", &cachedMem} };\n\t\t\n\t\tchar buf[1024];\n\t\tint n = fread(buf, sizeof(char), sizeof(buf) - 1, fp);\n\t\tbuf[sizeof(buf)-1] = '\\0';\n\t\tif(n > 0) {\n\t\t\tfor(unsigned int i = 0; i < sizeof(terms) \/ sizeof(SearchTerm); ++i) {\n\t\t\t\tchar* p = strstr(buf, terms[i].name);\n\t\t\t\tif(p) {\n\t\t\t\t\tp += strlen(terms[i].name);\n\t\t\t\t\t*terms[i].var = strtoul(p, NULL, 10);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfclose(fp);\n\t\t\/\/ it's written in KB in meminfo\n\t\treturn ((size_t)freeMem + (size_t)buffersMem + (size_t)cachedMem) * 1024;\n\t}\n\t\n\treturn 0;\n#else\n#warning No GetFreeSysMemory implementation for this arch\/sys\n\treturn 50 * 1024 * 1024; \/\/ return 50 MB (really randomly made up, but helps for cache system)\n#endif\n}\n\n\n\n\nstd::string GetDateTimeText()\n{\n\ttime_t t = time(NULL);\n\t\n\tif (t == (time_t)-1)\n\t\treturn \"TIME-ERROR1\";\n\t\n\tchar* timeCstr = ctime(&t);\n\tif(timeCstr == NULL)\n\t\treturn \"TIME-ERROR2\";\n\t\n\tstd::string timeStr(timeCstr);\n\tTrimSpaces(timeStr);\n\treturn timeStr;\n}\n\nstd::string GetDateTimeFilename()\n{\n\t\/\/ Add date and server name to screenshot filename\n\ttime_t curtime1 = time(NULL);\n\tif (curtime1 == (time_t)-1)\n\t\treturn \"TIME-ERROR1\";\n\tstruct tm *curtime = localtime(&curtime1);\n\tif (curtime == NULL)\n\t\treturn \"TIME-ERROR2\";\n\tchar filePrefixTime[200] = {0};\n\tstrftime(filePrefixTime, sizeof(filePrefixTime), \"%Y%m%d-%H%M\", curtime);\n\treturn filePrefixTime;\n}\n\n\n<commit_msg>small fix<commit_after>\/*\n *  SystemFunctions.cpp\n *  OpenLieroX\n *\n *  Created by Albert Zeyer on 01.12.09.\n *  code under LGPL\n *\n *\/\n\n\n\n#include <iomanip>\n#include <time.h>\n#include <SDL.h>\n#define Font Font_Xlib \/\/ Hack to prevent name clash in precompiled header\n#include <SDL_syswm.h>\n#undef Font\n#ifdef REAL_OPENGL\n#include <SDL_opengl.h>\n#endif\n#include <cstdlib>\n#include <sstream>\n#include <cstring>\n\n#if defined(__APPLE__)\n#include <mach\/host_info.h>\n#include <mach\/mach_host.h>\n#include <mach\/mach_init.h>\n#include <sys\/sysctl.h>\n#include <mach\/mach_traps.h>\n#elif defined(WIN32) || defined(WIN64)\n#include <windows.h>\n#else\n#include <cstdio>\n#include <unistd.h>\n#endif\n\n#ifdef __FREEBSD__\n#include <sys\/sysctl.h>\n#include <vm\/vm_param.h>\n#include <sys\/vmmeter.h>\n#endif\n\n#ifndef WIN32\n#include <sys\/types.h>\n#include <sys\/resource.h>\n#include <unistd.h>\n#include <signal.h>\n#endif\n\n#include \"StringUtils.h\"\n#include \"ThreadPool.h\"\n#include \"util\/macros.h\"\n\n#if !defined(WIN32) || defined(HAVE_PTHREAD)\n#include <pthread.h>\n#ifndef HAVE_PTHREAD\n#define HAVE_PTHREAD\n#endif\n\n#ifndef HAVE_PTHREAD_NAME\n\/\/ pthread_setname_np only available since MacOSX SDK 10.6\n#if defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6) && MAC_OS_X_VERSION_MIN_REQUIRED >= MAC_OS_X_VERSION_10_6\n#define HAVE_PTHREAD_NAME\n\/\/ glibc 2.12 introduced this\n#elif __GLIBC_PREREQ(2,12)\n#define HAVE_PTHREAD_NAME\n#endif\n#endif\n\n#endif\n\n\n\n#ifdef THREADNAME_VIA_SIGUSR1\nstatic void setCurThreadName__signalraiser(const char* name) {\n#ifndef _MSC_VER\n\t\/\/ this signal is only for debuggers, we should ignore it\n\tsignal( SIGUSR1, SIG_IGN );\n\n\t\/\/ KDevelop will catch this, read the 'name' parameter and continue execution\n\traise( SIGUSR1 );\n#endif\n}\n#endif\n\n\nThreadId getCurrentThreadId() {\n#ifdef HAVE_PTHREAD\n\treturn (ThreadId) pthread_self();\n#else\n\t\/\/ SDL_ThreadID returns a Uint32.\n\t\/\/ On 64bit systems, this might not be enough information about the current thread.\n\t\/\/ Win64 thread HANDLE is 64bit, aswell as pthread_t.\n\treturn (ThreadId) SDL_ThreadID();\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Gives a name to the thread\n\/\/ Code taken from http:\/\/www.codeproject.com\/KB\/threads\/Name_threads_in_debugger.aspx\nvoid setCurThreadName(const std::string& name)\n{\n#ifdef _MSC_VER \/\/ Currently only for MSVC, haven't found a Windows-general way (I doubt there is one)\n\ttypedef struct tagTHREADNAME_INFO\n\t{\n\t\tDWORD dwType; \/\/ Must be 0x1000.\n\t\tLPCSTR szName; \/\/ Pointer to name (in user addr space).\n\t\tDWORD dwThreadID; \/\/ Thread ID (-1=caller thread).\n\t\tDWORD dwFlags; \/\/ Reserved for future use, must be zero.\n\t} THREADNAME_INFO;\n\t\n\tTHREADNAME_INFO info;\n\t{\n\t\tinfo.dwType = 0x1000;\n\t\tinfo.szName = name.c_str();\n\t\tinfo.dwThreadID = (DWORD)-1;\n\t\tinfo.dwFlags = 0;\n\t}\n\t\n\t__try\n\t{\n\t\tRaiseException( 0x406D1388 \/* MSVC EXCEPTION *\/, 0, sizeof(info)\/sizeof(DWORD), (DWORD*)&info );\n\t}\n\t__except (EXCEPTION_CONTINUE_EXECUTION)\n\t{\n\t}\n#endif\n\n#ifdef THREADNAME_VIA_SIGUSR1\n\tsetCurThreadName__signalraiser(name.c_str());\n#endif\n\n#ifdef HAVE_PTHREAD_NAME\n\/\/ http:\/\/stackoverflow.com\/questions\/2369738\/can-i-set-the-name-of-a-thread-in-pthreads-linux\/7989973#7989973\n#ifdef __APPLE__\n\tpthread_setname_np(name.c_str());\n#else\n\tpthread_setname_np(pthread_self(), name.c_str());\n#endif\n#endif\n}\n\nstd::string getThreadName(ThreadId tid) {\n#ifdef HAVE_PTHREAD_NAME\n\tchar buf[128] = \"\\0\";\n\tif(pthread_getname_np((pthread_t) tid, buf, sizeof(buf)) == 0)\n\t\tif(strlen(buf) > 0)\n\t\t\treturn buf;\n#endif\n\n\tif(threadPool) {\n\t\tstd::map<ThreadId, std::string> threads;\n\t\tthreadPool->getAllWorkingThreads(threads);\n\t\tforeach(t, threads) {\n\t\t\tif(t->first == tid)\n\t\t\t\treturn t->second;\n\t\t}\n\t}\n\n\treturn \"\";\n}\n\nvoid setCurThreadPriority(float p) {\n#ifdef WIN32\n\t\n#elif defined(__APPLE__)\n\t\/\/int curp = getpriority(PRIO_DARWIN_THREAD, 0); \n\t\/\/int newp = p >= 0 ? 0 : 1;\n\t\/\/notes << \"curp:\" << curp << \", newp:\" << newp << endl;\n\t\/\/setpriority(PRIO_DARWIN_THREAD, 0, newp);\n#endif\n}\n\n\n\nsize_t GetFreeSysMemory() {\n#if defined(__APPLE__)\n\tvm_statistics_data_t page_info;\n\tvm_size_t pagesize;\n\tmach_msg_type_number_t count;\n\tkern_return_t kret;\n\t\n\tpagesize = 0;\n\tkret = host_page_size (mach_host_self(), &pagesize);\n\tcount = HOST_VM_INFO_COUNT;\n\t\n\tkret = host_statistics (mach_host_self(), HOST_VM_INFO,(host_info_t)&page_info, &count);\n\treturn page_info.free_count * pagesize;\n#elif defined(__WIN64__)\n\tMEMORYSTATUSEX memStatex;\n\tmemStatex.dwLength = sizeof (memStatex);\n\t::GlobalMemoryStatusEx (&memStatex);\n\treturn memStatex.ullAvailPhys;\n#elif defined(__WIN32__)\n\tMEMORYSTATUS memStatus;\n\tmemStatus.dwLength = sizeof(MEMORYSTATUS);\n\t::GlobalMemoryStatus(&memStatus);\n\treturn memStatus.dwAvailPhys;\n#elif defined(__SUN__) && defined(_SC_AVPHYS_PAGES)\n\treturn sysconf(_SC_AVPHYS_PAGES) * sysconf(_SC_PAGESIZE);\n#elif defined(__FREEBSD__)\n\tint vm_vmtotal[] = { CTL_VM, VM_METER };\n\tstruct vmtotal vmdata;\n\t\n\tsize_t len = sizeof(vmdata);\n\tint result = sysctl(vm_vmtotal, sizeof(vm_vmtotal) \/ sizeof(*vm_vmtotal), &vmdata, &len, NULL, 0);\n\tif(result != 0) return 0;\n\t\n\treturn vmdata.t_free * sysconf(_SC_PAGESIZE);\n#elif defined(__linux__)\n\t\n\t\/\/ get it from \/proc\/meminfo\n\tFILE *fp = fopen(\"\/proc\/meminfo\", \"r\");\n\tif ( fp )\n\t{\n\t\tunsigned long freeMem = 0;\n\t\tunsigned long buffersMem = 0;\n\t\tunsigned long cachedMem = 0;\n\t\tstruct SearchTerm { const char* name; unsigned long* var; };\n\t\tSearchTerm terms[] = { {\"MemFree:\", &freeMem}, {\"Buffers:\", &buffersMem}, {\"Cached:\", &cachedMem} };\n\t\t\n\t\tchar buf[1024];\n\t\tint n = fread(buf, sizeof(char), sizeof(buf) - 1, fp);\n\t\tbuf[sizeof(buf)-1] = '\\0';\n\t\tif(n > 0) {\n\t\t\tfor(unsigned int i = 0; i < sizeof(terms) \/ sizeof(SearchTerm); ++i) {\n\t\t\t\tchar* p = strstr(buf, terms[i].name);\n\t\t\t\tif(p) {\n\t\t\t\t\tp += strlen(terms[i].name);\n\t\t\t\t\t*terms[i].var = strtoul(p, NULL, 10);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfclose(fp);\n\t\t\/\/ it's written in KB in meminfo\n\t\treturn ((size_t)freeMem + (size_t)buffersMem + (size_t)cachedMem) * 1024;\n\t}\n\t\n\treturn 0;\n#else\n#warning No GetFreeSysMemory implementation for this arch\/sys\n\treturn 50 * 1024 * 1024; \/\/ return 50 MB (really randomly made up, but helps for cache system)\n#endif\n}\n\n\n\n\nstd::string GetDateTimeText()\n{\n\ttime_t t = time(NULL);\n\t\n\tif (t == (time_t)-1)\n\t\treturn \"TIME-ERROR1\";\n\t\n\tchar* timeCstr = ctime(&t);\n\tif(timeCstr == NULL)\n\t\treturn \"TIME-ERROR2\";\n\t\n\tstd::string timeStr(timeCstr);\n\tTrimSpaces(timeStr);\n\treturn timeStr;\n}\n\nstd::string GetDateTimeFilename()\n{\n\t\/\/ Add date and server name to screenshot filename\n\ttime_t curtime1 = time(NULL);\n\tif (curtime1 == (time_t)-1)\n\t\treturn \"TIME-ERROR1\";\n\tstruct tm *curtime = localtime(&curtime1);\n\tif (curtime == NULL)\n\t\treturn \"TIME-ERROR2\";\n\tchar filePrefixTime[200] = {0};\n\tstrftime(filePrefixTime, sizeof(filePrefixTime), \"%Y%m%d-%H%M\", curtime);\n\treturn filePrefixTime;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <iomanip>\n#include <cassert>\n#include <iostream>\n#include <algorithm>\n\n#include \"test.hpp\"\n\n#include \"cppa\/cppa.hpp\"\n#include \"cppa\/opencl.hpp\"\n\nusing namespace std;\nusing namespace cppa;\nusing namespace cppa::opencl;\n\nnamespace {\n\nusing ivec = vector<int>;\n\nconstexpr size_t matrix_size = 4;\nconstexpr const char* kernel_name = \"matrix_square\";\n\nconstexpr const char* kernel_source = R\"__(\n    __kernel void matrix_square(__global int* matrix,\n                                __global int* output) {\n        size_t size = get_global_size(0); \/\/ == get_global_size_(1);\n        size_t x = get_global_id(0);\n        size_t y = get_global_id(1);\n        int result = 0;\n        for (size_t idx = 0; idx < size; ++idx) {\n            result += matrix[idx + y * size] * matrix[x + idx * size];\n        }\n        output[x + y * size] = result;\n    }\n)__\";\n\nconstexpr const char* kernel_source_error = R\"__(\n    __kernel void matrix_square(__global int*) {\n        size_t semicolon\n    }\n)__\";\n\n}\n\ntemplate<size_t Size>\nclass square_matrix {\n\n public:\n\n    static constexpr size_t num_elements = Size * Size;\n\n    square_matrix(square_matrix&&) = default;\n    square_matrix(const square_matrix&) = default;\n    square_matrix& operator=(square_matrix&&) = default;\n    square_matrix& operator=(const square_matrix&) = default;\n\n    square_matrix() : m_data(num_elements) { }\n\n    explicit square_matrix(ivec d) : m_data(move(d)) {\n        assert(m_data.size() == num_elements);\n    }\n\n    inline float& operator()(size_t column, size_t row) {\n        return m_data[column + row * Size];\n    }\n\n    inline const float& operator()(size_t column, size_t row) const {\n        return m_data[column + row * Size];\n    }\n\n    inline void iota_fill() {\n        iota(m_data.begin(), m_data.end(), 0);\n    }\n\n    typedef typename ivec::const_iterator const_iterator;\n\n    const_iterator begin() const { return m_data.begin(); }\n\n    const_iterator end() const { return m_data.end(); }\n\n    ivec& data() { return m_data; }\n\n    const ivec& data() const { return m_data; }\n\n private:\n\n    ivec m_data;\n\n};\n\ntemplate<size_t Size>\ninline bool operator==(const square_matrix<Size>& lhs,\n                       const square_matrix<Size>& rhs) {\n    return equal(lhs.begin(), lhs.end(), rhs.begin());\n}\n\ntemplate<size_t Size>\ninline bool operator!=(const square_matrix<Size>& lhs,\n                       const square_matrix<Size>& rhs) {\n    return !(lhs == rhs);\n}\n\nusing matrix_type = square_matrix<matrix_size>;\n\nint main() {\n    CPPA_TEST(test_opencl);\n\n    announce<ivec>();\n    announce<matrix_type>();\n\n    const ivec expected1{ 56, 62, 68, 74\n                        , 152, 174, 196, 218\n                        , 248, 286, 324, 362\n                        , 344, 398, 452, 506};\n\n    auto worker1 = spawn_cl<ivec(ivec&)>(program::create(kernel_source),\n                                         kernel_name,\n                                         {matrix_size, matrix_size});\n    ivec m1(matrix_size * matrix_size);\n    iota(m1.begin(), m1.end(), 0);\n    send(worker1, move(m1));\n    receive (\n        on_arg_match >> [&] (const ivec& result) {\n            CPPA_CHECK(equal(begin(expected1), end(expected1), begin(result)));\n        }\n    );\n\n    auto worker2 = spawn_cl<ivec(ivec&)>(kernel_source,\n                                         kernel_name,\n                                         {matrix_size, matrix_size});\n    ivec m2(matrix_size * matrix_size);\n    iota(m2.begin(), m2.end(), 0);\n    send(worker2, move(m2));\n    receive (\n        on_arg_match >> [&] (const ivec& result) {\n            CPPA_CHECK(equal(begin(expected1), end(expected1), begin(result)));\n        }\n    );\n\n\n    const matrix_type expected2(move(expected1));\n\n    auto map_args = [] (any_tuple msg) -> optional<cow_tuple<ivec>> {\n        auto opt = tuple_cast<matrix_type>(msg);\n        if (opt) {\n            return {make_cow_tuple(move(get_ref<0>(*opt).data()))};\n        }\n        return {};\n    };\n\n    auto map_results = [] (ivec& result) -> any_tuple {\n        return make_any_tuple(matrix_type{move(result)});\n    };\n\n    matrix_type m3;\n    m3.iota_fill();\n    auto worker3 = spawn_cl(program::create(kernel_source), kernel_name,\n                            map_args, map_results,\n                            {matrix_size, matrix_size});\n    send(worker3, move(m3));\n    receive (\n        on_arg_match >> [&] (const matrix_type& result) {\n            CPPA_CHECK(expected2 == result);\n        }\n    );\n\n    matrix_type m4;\n    m4.iota_fill();\n    auto worker4 = spawn_cl(kernel_source, kernel_name,\n                            map_args, map_results,\n                            {matrix_size, matrix_size}\n    );\n    send(worker4, move(m4));\n    receive (\n        on_arg_match >> [&] (const matrix_type& result) {\n            CPPA_CHECK(expected2 == result);\n        }\n    );\n\n    try {\n        program create_error = program::create(kernel_source_error);\n    }\n    catch (const exception& exc) {\n        cout << exc.what() << endl;\n        CPPA_CHECK_EQUAL(\"clBuildProgram: CL_BUILD_PROGRAM_FAILURE\", exc.what());\n    }\n\n    cppa::await_all_others_done();\n    cppa::shutdown();\n\n    return CPPA_TEST_RESULT();\n}\n<commit_msg>fixed opencl unit test<commit_after>#include <vector>\n#include <iomanip>\n#include <cassert>\n#include <iostream>\n#include <algorithm>\n\n#include \"test.hpp\"\n\n#include \"cppa\/cppa.hpp\"\n#include \"cppa\/opencl.hpp\"\n\nusing namespace std;\nusing namespace cppa;\nusing namespace cppa::opencl;\n\nnamespace {\n\nusing ivec = vector<int>;\n\nconstexpr size_t matrix_size = 4;\nconstexpr const char* kernel_name = \"matrix_square\";\n\nconstexpr const char* kernel_source = R\"__(\n    __kernel void matrix_square(__global int* matrix,\n                                __global int* output) {\n        size_t size = get_global_size(0); \/\/ == get_global_size_(1);\n        size_t x = get_global_id(0);\n        size_t y = get_global_id(1);\n        int result = 0;\n        for (size_t idx = 0; idx < size; ++idx) {\n            result += matrix[idx + y * size] * matrix[x + idx * size];\n        }\n        output[x + y * size] = result;\n    }\n)__\";\n\nconstexpr const char* kernel_source_error = R\"__(\n    __kernel void matrix_square(__global int*) {\n        size_t semicolon\n    }\n)__\";\n\n}\n\ntemplate<size_t Size>\nclass square_matrix {\n\n public:\n\n    static constexpr size_t num_elements = Size * Size;\n\n    square_matrix(square_matrix&&) = default;\n    square_matrix(const square_matrix&) = default;\n    square_matrix& operator=(square_matrix&&) = default;\n    square_matrix& operator=(const square_matrix&) = default;\n\n    square_matrix() : m_data(num_elements) { }\n\n    explicit square_matrix(ivec d) : m_data(move(d)) {\n        assert(m_data.size() == num_elements);\n    }\n\n    inline float& operator()(size_t column, size_t row) {\n        return m_data[column + row * Size];\n    }\n\n    inline const float& operator()(size_t column, size_t row) const {\n        return m_data[column + row * Size];\n    }\n\n    inline void iota_fill() {\n        iota(m_data.begin(), m_data.end(), 0);\n    }\n\n    typedef typename ivec::const_iterator const_iterator;\n\n    const_iterator begin() const { return m_data.begin(); }\n\n    const_iterator end() const { return m_data.end(); }\n\n    ivec& data() { return m_data; }\n\n    const ivec& data() const { return m_data; }\n\n private:\n\n    ivec m_data;\n\n};\n\ntemplate<size_t Size>\ninline bool operator==(const square_matrix<Size>& lhs,\n                       const square_matrix<Size>& rhs) {\n    return equal(lhs.begin(), lhs.end(), rhs.begin());\n}\n\ntemplate<size_t Size>\ninline bool operator!=(const square_matrix<Size>& lhs,\n                       const square_matrix<Size>& rhs) {\n    return !(lhs == rhs);\n}\n\nusing matrix_type = square_matrix<matrix_size>;\n\nint main() {\n    CPPA_TEST(test_opencl);\n\n    announce<ivec>();\n    announce<matrix_type>();\n\n    const ivec expected1{ 56, 62, 68, 74\n                        , 152, 174, 196, 218\n                        , 248, 286, 324, 362\n                        , 344, 398, 452, 506};\n\n    auto worker1 = spawn_cl<ivec(ivec&)>(program::create(kernel_source),\n                                         kernel_name,\n                                         {matrix_size, matrix_size});\n    ivec m1(matrix_size * matrix_size);\n    iota(m1.begin(), m1.end(), 0);\n    send(worker1, move(m1));\n    receive (\n        on_arg_match >> [&] (const ivec& result) {\n            CPPA_CHECK(equal(begin(expected1), end(expected1), begin(result)));\n        }\n    );\n\n    auto worker2 = spawn_cl<ivec(ivec&)>(kernel_source,\n                                         kernel_name,\n                                         {matrix_size, matrix_size});\n    ivec m2(matrix_size * matrix_size);\n    iota(m2.begin(), m2.end(), 0);\n    send(worker2, move(m2));\n    receive (\n        on_arg_match >> [&] (const ivec& result) {\n            CPPA_CHECK(equal(begin(expected1), end(expected1), begin(result)));\n        }\n    );\n\n\n    const matrix_type expected2(move(expected1));\n\n    auto map_args = [] (any_tuple msg) -> optional<cow_tuple<ivec>> {\n        auto opt = tuple_cast<matrix_type>(msg);\n        if (opt) {\n            return make_cow_tuple(move(get_ref<0>(*opt).data()));\n        }\n        return none;\n    };\n\n    auto map_results = [] (ivec& result) -> any_tuple {\n        return make_any_tuple(matrix_type{move(result)});\n    };\n\n    matrix_type m3;\n    m3.iota_fill();\n    auto worker3 = spawn_cl(program::create(kernel_source), kernel_name,\n                            map_args, map_results,\n                            {matrix_size, matrix_size});\n    send(worker3, move(m3));\n    receive (\n        on_arg_match >> [&] (const matrix_type& result) {\n            CPPA_CHECK(expected2 == result);\n        }\n    );\n\n    matrix_type m4;\n    m4.iota_fill();\n    auto worker4 = spawn_cl(kernel_source, kernel_name,\n                            map_args, map_results,\n                            {matrix_size, matrix_size}\n    );\n    send(worker4, move(m4));\n    receive (\n        on_arg_match >> [&] (const matrix_type& result) {\n            CPPA_CHECK(expected2 == result);\n        }\n    );\n\n    try {\n        program create_error = program::create(kernel_source_error);\n    }\n    catch (const exception& exc) {\n        cout << exc.what() << endl;\n        CPPA_CHECK_EQUAL(\"clBuildProgram: CL_BUILD_PROGRAM_FAILURE\", exc.what());\n    }\n\n    cppa::await_all_others_done();\n    cppa::shutdown();\n\n    return CPPA_TEST_RESULT();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/test\/unit_test.hpp>\n#include <boost\/test\/test_case_template.hpp>\n\n#include \"args.hpp\"\n#include \"fixture.hpp\"\n#include \"coordinates.hpp\"\n\n#include \"osrm\/route_parameters.hpp\"\n\n#include \"osrm\/coordinate.hpp\"\n#include \"osrm\/engine_config.hpp\"\n#include \"osrm\/json_container.hpp\"\n#include \"osrm\/status.hpp\"\n#include \"osrm\/osrm.hpp\"\n\nBOOST_AUTO_TEST_SUITE(route)\n\nBOOST_AUTO_TEST_CASE(test_route_same_coordinates)\n{\n    const auto args = get_args();\n    auto osrm = get_osrm(args.at(0));\n\n    using namespace osrm;\n\n    RouteParameters params;\n    params.coordinates.push_back(get_dummy_location());\n    params.coordinates.push_back(get_dummy_location());\n    params.coordinates.push_back(get_dummy_location());\n\n    json::Object result;\n    const auto rc = osrm.Route(params, result);\n    BOOST_CHECK(rc == Status::Ok);\n\n    const auto code = result.values.at(\"code\").get<json::String>().value;\n    BOOST_CHECK_EQUAL(code, \"ok\");\n\n    const auto &waypoints = result.values.at(\"waypoints\").get<json::Array>().values;\n    BOOST_CHECK(!waypoints.empty());\n\n    for (const auto &waypoint : waypoints)\n    {\n        const auto &waypoint_object = waypoint.get<json::Object>();\n\n        \/\/ nothing can be said about name, empty or contains name of the street\n        const auto name = waypoint_object.values.at(\"name\").get<json::String>().value;\n        BOOST_CHECK(((void)name, true));\n\n        const auto location = waypoint_object.values.at(\"location\").get<json::Array>().values;\n        const auto longitude = location[0].get<json::Number>().value;\n        const auto latitude = location[1].get<json::Number>().value;\n        BOOST_CHECK(longitude >= -180. && longitude <= 180.);\n        BOOST_CHECK(latitude >= -90. && latitude <= 90.);\n\n        const auto hint = waypoint_object.values.at(\"hint\").get<json::String>().value;\n        BOOST_CHECK(!hint.empty());\n    }\n\n    \/\/ alternative=true by default\n    const auto &routes = result.values.at(\"routes\").get<json::Array>().values;\n    BOOST_CHECK(!routes.empty());\n    BOOST_CHECK(routes.size() > 1);\n\n    for (const auto &route : routes)\n    {\n        const auto &route_object = route.get<json::Object>();\n\n        const auto distance = route_object.values.at(\"distance\").get<json::Number>().value;\n        BOOST_CHECK(distance == 0);\n\n        const auto duration = route_object.values.at(\"duration\").get<json::Number>().value;\n        BOOST_CHECK(duration == 0);\n\n        \/\/ geometries=polyline by default\n        const auto geometry = route_object.values.at(\"geometry\").get<json::String>().value;\n        BOOST_CHECK(!geometry.empty());\n\n        const auto &legs = route_object.values.at(\"legs\").get<json::Array>().values;\n        BOOST_CHECK(!legs.empty());\n\n        for (const auto &leg : legs)\n        {\n            const auto &leg_object = leg.get<json::Object>();\n\n            const auto distance = leg_object.values.at(\"distance\").get<json::Number>().value;\n            BOOST_CHECK(distance == 0);\n\n            const auto duration = leg_object.values.at(\"duration\").get<json::Number>().value;\n            BOOST_CHECK(duration == 0);\n\n            \/\/ nothing can be said about summary, empty or contains human readable summary\n            const auto summary = leg_object.values.at(\"summary\").get<json::String>().value;\n            BOOST_CHECK(((void)summary, true));\n\n            \/\/ steps=true by default\n            const auto &steps = leg_object.values.at(\"steps\").get<json::Array>().values;\n            BOOST_CHECK(!steps.empty());\n\n            for (const auto &step : steps)\n            {\n                const auto &step_object = step.get<json::Object>();\n\n                const auto distance = step_object.values.at(\"distance\").get<json::Number>().value;\n                BOOST_CHECK(distance == 0);\n\n                const auto duration = step_object.values.at(\"duration\").get<json::Number>().value;\n                BOOST_CHECK(duration == 0);\n\n                \/\/ geometries=polyline by default\n                const auto geometry = step_object.values.at(\"geometry\").get<json::String>().value;\n                BOOST_CHECK(!geometry.empty());\n\n                \/\/ nothing can be said about name, empty or contains way name\n                const auto name = step_object.values.at(\"name\").get<json::String>().value;\n                BOOST_CHECK(((void)name, true));\n\n                \/\/ nothing can be said about mode, contains mode of transportation\n                const auto mode = step_object.values.at(\"mode\").get<json::String>().value;\n                BOOST_CHECK(!name.empty());\n\n                const auto &maneuver = step_object.values.at(\"maneuver\").get<json::Object>().values;\n\n                const auto location = maneuver.at(\"location\").get<json::Array>().values;\n                const auto longitude = location[0].get<json::Number>().value;\n                const auto latitude = location[1].get<json::Number>().value;\n                BOOST_CHECK(longitude >= -180. && longitude <= 180.);\n                BOOST_CHECK(latitude >= -90. && latitude <= 90.);\n\n                const auto bearing_before = maneuver.at(\"bearing_before\").get<json::Number>().value;\n                const auto bearing_after = maneuver.at(\"bearing_after\").get<json::Number>().value;\n                BOOST_CHECK(bearing_before >= 0. && bearing_before <= 360.);\n                BOOST_CHECK(bearing_after >= 0. && bearing_after <= 360.);\n\n                const auto type = maneuver.at(\"type\").get<json::String>().value;\n                BOOST_CHECK(!type.empty());\n\n                \/\/ modifier is optional\n                \/\/ TODO(daniel-j-h):\n\n                \/\/ exit is optional\n                \/\/ TODO(daniel-j-h):\n            }\n        }\n    }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Make test assumption failure output violation in Route unit tests<commit_after>#include <boost\/test\/unit_test.hpp>\n#include <boost\/test\/test_case_template.hpp>\n\n#include \"args.hpp\"\n#include \"fixture.hpp\"\n#include \"coordinates.hpp\"\n\n#include \"osrm\/route_parameters.hpp\"\n\n#include \"osrm\/coordinate.hpp\"\n#include \"osrm\/engine_config.hpp\"\n#include \"osrm\/json_container.hpp\"\n#include \"osrm\/status.hpp\"\n#include \"osrm\/osrm.hpp\"\n\nBOOST_AUTO_TEST_SUITE(route)\n\nBOOST_AUTO_TEST_CASE(test_route_same_coordinates)\n{\n    const auto args = get_args();\n    auto osrm = get_osrm(args.at(0));\n\n    using namespace osrm;\n\n    RouteParameters params;\n    params.coordinates.push_back(get_dummy_location());\n    params.coordinates.push_back(get_dummy_location());\n    params.coordinates.push_back(get_dummy_location());\n\n    json::Object result;\n    const auto rc = osrm.Route(params, result);\n    BOOST_CHECK(rc == Status::Ok);\n\n    const auto code = result.values.at(\"code\").get<json::String>().value;\n    BOOST_CHECK_EQUAL(code, \"ok\");\n\n    const auto &waypoints = result.values.at(\"waypoints\").get<json::Array>().values;\n    BOOST_CHECK(!waypoints.empty());\n\n    for (const auto &waypoint : waypoints)\n    {\n        const auto &waypoint_object = waypoint.get<json::Object>();\n\n        \/\/ nothing can be said about name, empty or contains name of the street\n        const auto name = waypoint_object.values.at(\"name\").get<json::String>().value;\n        BOOST_CHECK(((void)name, true));\n\n        const auto location = waypoint_object.values.at(\"location\").get<json::Array>().values;\n        const auto longitude = location[0].get<json::Number>().value;\n        const auto latitude = location[1].get<json::Number>().value;\n        BOOST_CHECK(longitude >= -180. && longitude <= 180.);\n        BOOST_CHECK(latitude >= -90. && latitude <= 90.);\n\n        const auto hint = waypoint_object.values.at(\"hint\").get<json::String>().value;\n        BOOST_CHECK(!hint.empty());\n    }\n\n    \/\/ alternative=true by default\n    const auto &routes = result.values.at(\"routes\").get<json::Array>().values;\n    BOOST_CHECK(!routes.empty());\n    BOOST_CHECK(routes.size() > 1);\n\n    for (const auto &route : routes)\n    {\n        const auto &route_object = route.get<json::Object>();\n\n        const auto distance = route_object.values.at(\"distance\").get<json::Number>().value;\n        BOOST_CHECK_EQUAL(distance, 0);\n\n        const auto duration = route_object.values.at(\"duration\").get<json::Number>().value;\n        BOOST_CHECK_EQUAL(duration, 0);\n\n        \/\/ geometries=polyline by default\n        const auto geometry = route_object.values.at(\"geometry\").get<json::String>().value;\n        BOOST_CHECK(!geometry.empty());\n\n        const auto &legs = route_object.values.at(\"legs\").get<json::Array>().values;\n        BOOST_CHECK(!legs.empty());\n\n        for (const auto &leg : legs)\n        {\n            const auto &leg_object = leg.get<json::Object>();\n\n            const auto distance = leg_object.values.at(\"distance\").get<json::Number>().value;\n            BOOST_CHECK_EQUAL(distance, 0);\n\n            const auto duration = leg_object.values.at(\"duration\").get<json::Number>().value;\n            BOOST_CHECK_EQUAL(duration, 0);\n\n            \/\/ nothing can be said about summary, empty or contains human readable summary\n            const auto summary = leg_object.values.at(\"summary\").get<json::String>().value;\n            BOOST_CHECK(((void)summary, true));\n\n            \/\/ steps=true by default\n            const auto &steps = leg_object.values.at(\"steps\").get<json::Array>().values;\n            BOOST_CHECK(!steps.empty());\n\n            for (const auto &step : steps)\n            {\n                const auto &step_object = step.get<json::Object>();\n\n                const auto distance = step_object.values.at(\"distance\").get<json::Number>().value;\n                BOOST_CHECK_EQUAL(distance, 0);\n\n                const auto duration = step_object.values.at(\"duration\").get<json::Number>().value;\n                BOOST_CHECK_EQUAL(duration, 0);\n\n                \/\/ geometries=polyline by default\n                const auto geometry = step_object.values.at(\"geometry\").get<json::String>().value;\n                BOOST_CHECK(!geometry.empty());\n\n                \/\/ nothing can be said about name, empty or contains way name\n                const auto name = step_object.values.at(\"name\").get<json::String>().value;\n                BOOST_CHECK(((void)name, true));\n\n                \/\/ nothing can be said about mode, contains mode of transportation\n                const auto mode = step_object.values.at(\"mode\").get<json::String>().value;\n                BOOST_CHECK(!name.empty());\n\n                const auto &maneuver = step_object.values.at(\"maneuver\").get<json::Object>().values;\n\n                const auto location = maneuver.at(\"location\").get<json::Array>().values;\n                const auto longitude = location[0].get<json::Number>().value;\n                const auto latitude = location[1].get<json::Number>().value;\n                BOOST_CHECK(longitude >= -180. && longitude <= 180.);\n                BOOST_CHECK(latitude >= -90. && latitude <= 90.);\n\n                const auto bearing_before = maneuver.at(\"bearing_before\").get<json::Number>().value;\n                const auto bearing_after = maneuver.at(\"bearing_after\").get<json::Number>().value;\n                BOOST_CHECK(bearing_before >= 0. && bearing_before <= 360.);\n                BOOST_CHECK(bearing_after >= 0. && bearing_after <= 360.);\n\n                const auto type = maneuver.at(\"type\").get<json::String>().value;\n                BOOST_CHECK(!type.empty());\n\n                \/\/ modifier is optional\n                \/\/ TODO(daniel-j-h):\n\n                \/\/ exit is optional\n                \/\/ TODO(daniel-j-h):\n            }\n        }\n    }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>#include \"utest_helper.hpp\"\n\nnamespace {\n\ntypedef struct {\n  unsigned long x;\n  unsigned long y;\n  unsigned long z;\n  unsigned long w;\n}ulong4;\n\ntypedef struct {\n  uint32_t x;\n  uint32_t y;\n  uint32_t z;\n  uint32_t w;\n} uint4;\n\ntypedef struct {\n  uint16_t x;\n  uint16_t y;\n  uint16_t z;\n  uint16_t w;\n} ushort4;\n\ntypedef struct {\n  uint8_t x;\n  uint8_t y;\n  uint8_t z;\n  uint8_t w;\n} uchar4;\n\ntemplate <typename U>\nU get_max()\n{\n  int shift_bit = sizeof(U)*8;\n  U u_max = 0;\n  for (int i = 0; i < shift_bit; i++)\n    u_max |= 1<<(shift_bit-i-1);\n  return u_max;\n}\n\ntemplate<typename T, typename U>\nvoid test(const char *kernel_name, int func_type)\n{\n  const size_t n = 16;\n\n  \/\/ Setup kernel and buffers\n  OCL_CREATE_KERNEL_FROM_FILE(\"compiler_overflow\", kernel_name);\n  OCL_CREATE_BUFFER(buf[0], 0, n * sizeof(T), NULL);\n  OCL_CREATE_BUFFER(buf[1], 0, n * sizeof(T), NULL);\n  OCL_CREATE_BUFFER(buf[2], 0, n * sizeof(T), NULL);\n  OCL_SET_ARG(0, sizeof(cl_mem), &buf[0]);\n  OCL_SET_ARG(1, sizeof(cl_mem), &buf[1]);\n  OCL_SET_ARG(2, sizeof(cl_mem), &buf[2]);\n\n  U max = get_max<U>();\n\n  OCL_MAP_BUFFER(0);\n  for (uint32_t i = 0; i < n; ++i) {\n    if(func_type == 0) {\n      ((T*)buf_data[0])[i].x = max;\n      ((T*)buf_data[0])[i].y = max;\n      ((T*)buf_data[0])[i].z = max;\n      ((T*)buf_data[0])[i].w = i;\n    }else if(func_type == 1) {\n      ((T*)buf_data[0])[i].x = 0;\n      ((T*)buf_data[0])[i].y = 0;\n      ((T*)buf_data[0])[i].z = 0;\n      ((T*)buf_data[0])[i].w = n+2-i;\n    }else\n      OCL_ASSERT(0);\n  }\n  OCL_UNMAP_BUFFER(0);\n  OCL_MAP_BUFFER(1);\n  for (uint32_t i = 0; i < n; ++i) {\n      ((T*)buf_data[1])[i].x = 1;\n      ((T*)buf_data[1])[i].y = 1;\n      ((T*)buf_data[1])[i].z = 1;\n      ((T*)buf_data[1])[i].w = 1;\n  }\n  OCL_UNMAP_BUFFER(1);\n\n  globals[0] = n;\n  locals[0] = 16;\n  OCL_NDRANGE(1);\n  OCL_MAP_BUFFER(2);\n  for (uint32_t i = 0; i < 16; ++i) {\n   \/\/ printf(\"%u,%u,%u,%u\\n\", ((T*)buf_data[2])[i].x,((T*)buf_data[2])[i].y, ((T*)buf_data[2])[i].z, ((T*)buf_data[2])[i].w  );\n    if(func_type == 0) {\n      OCL_ASSERT(((T*)buf_data[2])[i].x == 0);\n      OCL_ASSERT(((T*)buf_data[2])[i].y == 1);\n      OCL_ASSERT(((T*)buf_data[2])[i].z == 1);\n      OCL_ASSERT(((T*)buf_data[2])[i].w == i+2);\n    }else if(func_type == 1) {\n      OCL_ASSERT(((T*)buf_data[2])[i].x == max);\n      OCL_ASSERT(((T*)buf_data[2])[i].y == max-1);\n      OCL_ASSERT(((T*)buf_data[2])[i].z == max-1);\n      OCL_ASSERT(((T*)buf_data[2])[i].w == n-i);\n    }else\n      OCL_ASSERT(0);\n  }\n  OCL_UNMAP_BUFFER(2);\n}\n\n}\n\n#define compiler_overflow_add(type, subtype, kernel, func_type) \\\nstatic void compiler_overflow_add_ ##type(void)\\\n{\\\n  test<type, subtype>(# kernel, func_type);\\\n}\\\nMAKE_UTEST_FROM_FUNCTION(compiler_overflow_add_ ## type);\n\n#define compiler_overflow_sub(type, subtype, kernel, func_type) \\\nstatic void compiler_overflow_sub_ ##type(void)\\\n{\\\n  test<type, subtype>(# kernel, func_type);\\\n}\\\nMAKE_UTEST_FROM_FUNCTION(compiler_overflow_sub_ ## type);\n\ncompiler_overflow_add(ulong4, unsigned long, compiler_overflow_ulong4_add, 0)\ncompiler_overflow_add(uint4, uint32_t, compiler_overflow_uint4_add, 0)\ncompiler_overflow_add(ushort4, uint16_t, compiler_overflow_ushort4_add, 0)\ncompiler_overflow_add(uchar4, uint8_t, compiler_overflow_uchar4_add, 0)\n\n\/\/ as llvm intrincs function doesn't support byte\/short overflow,\n\/\/ we just test uint overflow here.\ncompiler_overflow_sub(uint4, uint32_t, compiler_overflow_uint4_sub, 1)\n<commit_msg>refine overflow utest to cover nsetc fail cases.<commit_after>#include \"utest_helper.hpp\"\n\nnamespace {\n\ntypedef struct {\n  unsigned long x;\n  unsigned long y;\n  unsigned long z;\n  unsigned long w;\n}ulong4;\n\ntypedef struct {\n  uint32_t x;\n  uint32_t y;\n  uint32_t z;\n  uint32_t w;\n} uint4;\n\ntypedef struct {\n  uint16_t x;\n  uint16_t y;\n  uint16_t z;\n  uint16_t w;\n} ushort4;\n\ntypedef struct {\n  uint8_t x;\n  uint8_t y;\n  uint8_t z;\n  uint8_t w;\n} uchar4;\n\ntemplate <typename U>\nU get_max()\n{\n  int shift_bit = sizeof(U)*8;\n  U u_max = 0;\n  for (int i = 0; i < shift_bit; i++)\n    u_max |= 1<<(shift_bit-i-1);\n  return u_max;\n}\n\ntemplate<typename T, typename U>\nvoid test(const char *kernel_name, int func_type)\n{\n  const size_t n = 16;\n\n  \/\/ Setup kernel and buffers\n  OCL_CREATE_KERNEL_FROM_FILE(\"compiler_overflow\", kernel_name);\n  OCL_CREATE_BUFFER(buf[0], 0, n * sizeof(T), NULL);\n  OCL_CREATE_BUFFER(buf[1], 0, n * sizeof(T), NULL);\n  OCL_CREATE_BUFFER(buf[2], 0, n * sizeof(T), NULL);\n  OCL_SET_ARG(0, sizeof(cl_mem), &buf[0]);\n  OCL_SET_ARG(1, sizeof(cl_mem), &buf[1]);\n  OCL_SET_ARG(2, sizeof(cl_mem), &buf[2]);\n\n  U max = get_max<U>();\n\n  \/\/ test add and sub overflow when src1 is 1:\n  \/\/ uadd.with.overflow: max + 1\n  \/\/ usub.with.overflow: 0 - 1\n  OCL_MAP_BUFFER(0);\n  for (uint32_t i = 0; i < n; ++i) {\n    if(func_type == 0) {\n      ((T*)buf_data[0])[i].x = max;\n      ((T*)buf_data[0])[i].y = max;\n      ((T*)buf_data[0])[i].z = max;\n      ((T*)buf_data[0])[i].w = i;\n    }else if(func_type == 1) {\n      ((T*)buf_data[0])[i].x = 0;\n      ((T*)buf_data[0])[i].y = 0;\n      ((T*)buf_data[0])[i].z = 0;\n      ((T*)buf_data[0])[i].w = n+2-i;\n    }else\n      OCL_ASSERT(0);\n  }\n  OCL_UNMAP_BUFFER(0);\n  OCL_MAP_BUFFER(1);\n  for (uint32_t i = 0; i < n; ++i) {\n      ((T*)buf_data[1])[i].x = 1;\n      ((T*)buf_data[1])[i].y = 1;\n      ((T*)buf_data[1])[i].z = 1;\n      ((T*)buf_data[1])[i].w = 1;\n  }\n  OCL_UNMAP_BUFFER(1);\n\n  globals[0] = n;\n  locals[0] = 16;\n  OCL_NDRANGE(1);\n  OCL_MAP_BUFFER(2);\n  for (uint32_t i = 0; i < 16; ++i) {\n   \/\/ printf(\"%u,%u,%u,%u\\n\", ((T*)buf_data[2])[i].x,((T*)buf_data[2])[i].y, ((T*)buf_data[2])[i].z, ((T*)buf_data[2])[i].w  );\n    if(func_type == 0) {\n      OCL_ASSERT(((T*)buf_data[2])[i].x == 0);\n      OCL_ASSERT(((T*)buf_data[2])[i].y == 1);\n      OCL_ASSERT(((T*)buf_data[2])[i].z == 1);\n      OCL_ASSERT(((T*)buf_data[2])[i].w == i+2);\n    }else if(func_type == 1) {\n      OCL_ASSERT(((T*)buf_data[2])[i].x == max);\n      OCL_ASSERT(((T*)buf_data[2])[i].y == max-1);\n      OCL_ASSERT(((T*)buf_data[2])[i].z == max-1);\n      OCL_ASSERT(((T*)buf_data[2])[i].w == n-i);\n    }else\n      OCL_ASSERT(0);\n  }\n  OCL_UNMAP_BUFFER(2);\n\n  \/\/ test add and sub overflow when src1 is max:\n  \/\/ uadd.with.overflow: max + max\n  \/\/ usub.with.overflow: 0 - max\n  OCL_MAP_BUFFER(0);\n  for (uint32_t i = 0; i < n; ++i) {\n    if(func_type == 0) {\n      ((T*)buf_data[0])[i].x = max;\n      ((T*)buf_data[0])[i].y = max;\n      ((T*)buf_data[0])[i].z = max;\n      ((T*)buf_data[0])[i].w = i;\n    }else if(func_type == 1) {\n      ((T*)buf_data[0])[i].x = 0;\n      ((T*)buf_data[0])[i].y = 0;\n      ((T*)buf_data[0])[i].z = 0;\n      ((T*)buf_data[0])[i].w = n+2-i;\n    }else\n      OCL_ASSERT(0);\n  }\n  OCL_UNMAP_BUFFER(0);\n  OCL_MAP_BUFFER(1);\n  for (uint32_t i = 0; i < n; ++i) {\n      ((T*)buf_data[1])[i].x = max;\n      ((T*)buf_data[1])[i].y = max;\n      ((T*)buf_data[1])[i].z = max;\n      ((T*)buf_data[1])[i].w = 1;\n  }\n  OCL_UNMAP_BUFFER(1);\n\n  globals[0] = n;\n  locals[0] = 16;\n  OCL_NDRANGE(1);\n  OCL_MAP_BUFFER(2);\n  for (uint32_t i = 0; i < 16; ++i) {\n    \/\/ printf(\"%u,%u,%u,%u\\n\", ((T*)buf_data[2])[i].x,((T*)buf_data[2])[i].y, ((T*)buf_data[2])[i].z, ((T*)buf_data[2])[i].w  );\n    if(func_type == 0) {\n      OCL_ASSERT(((T*)buf_data[2])[i].x == max-1);\n      OCL_ASSERT(((T*)buf_data[2])[i].y == max);\n      OCL_ASSERT(((T*)buf_data[2])[i].z == max);\n      OCL_ASSERT(((T*)buf_data[2])[i].w == i+2);\n    }else if(func_type == 1) {\n      OCL_ASSERT(((T*)buf_data[2])[i].x == 1);\n      OCL_ASSERT(((T*)buf_data[2])[i].y == 0);\n      OCL_ASSERT(((T*)buf_data[2])[i].z == 0);\n      OCL_ASSERT(((T*)buf_data[2])[i].w == n-i);\n    }else\n      OCL_ASSERT(0);\n  }\n  OCL_UNMAP_BUFFER(2);\n}\n\n}\n\n#define compiler_overflow_add(type, subtype, kernel, func_type) \\\nstatic void compiler_overflow_add_ ##type(void)\\\n{\\\n  test<type, subtype>(# kernel, func_type);\\\n}\\\nMAKE_UTEST_FROM_FUNCTION(compiler_overflow_add_ ## type);\n\n#define compiler_overflow_sub(type, subtype, kernel, func_type) \\\nstatic void compiler_overflow_sub_ ##type(void)\\\n{\\\n  test<type, subtype>(# kernel, func_type);\\\n}\\\nMAKE_UTEST_FROM_FUNCTION(compiler_overflow_sub_ ## type);\n\ncompiler_overflow_add(ulong4, unsigned long, compiler_overflow_ulong4_add, 0)\ncompiler_overflow_add(uint4, uint32_t, compiler_overflow_uint4_add, 0)\ncompiler_overflow_add(ushort4, uint16_t, compiler_overflow_ushort4_add, 0)\ncompiler_overflow_add(uchar4, uint8_t, compiler_overflow_uchar4_add, 0)\n\n\/\/ as llvm intrincs function doesn't support byte\/short overflow,\n\/\/ we just test uint overflow here.\ncompiler_overflow_sub(uint4, uint32_t, compiler_overflow_uint4_sub, 1)\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Don't use the CoreUI private framework when sandboxed (i.e., for App Store)<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Hack to make an in-destruction SystemWindow no longer claim to be one<commit_after><|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 \"video_engine\/vie_renderer.h\"\n\n#include \"common_video\/libyuv\/include\/webrtc_libyuv.h\"\n#include \"webrtc\/modules\/video_render\/include\/video_render.h\"\n#include \"webrtc\/modules\/video_render\/include\/video_render_defines.h\"\n#include \"video_engine\/vie_render_manager.h\"\n\nnamespace webrtc {\n\nViERenderer* ViERenderer::CreateViERenderer(const WebRtc_Word32 render_id,\n                                            const WebRtc_Word32 engine_id,\n                                            VideoRender& render_module,\n                                            ViERenderManager& render_manager,\n                                            const WebRtc_UWord32 z_order,\n                                            const float left,\n                                            const float top,\n                                            const float right,\n                                            const float bottom) {\n  ViERenderer* self = new ViERenderer(render_id, engine_id, render_module,\n                                      render_manager);\n  if (!self || self->Init(z_order, left, top, right, bottom) != 0) {\n    delete self;\n    self = NULL;\n  }\n  return self;\n}\n\nViERenderer::~ViERenderer(void) {\n  if (render_callback_)\n    render_module_.DeleteIncomingRenderStream(render_id_);\n\n  if (incoming_external_callback_)\n    delete incoming_external_callback_;\n}\n\nWebRtc_Word32 ViERenderer::StartRender() {\n  return render_module_.StartRender(render_id_);\n}\nWebRtc_Word32 ViERenderer::StopRender() {\n  return render_module_.StopRender(render_id_);\n}\n\nWebRtc_Word32 ViERenderer::GetLastRenderedFrame(const WebRtc_Word32 renderID,\n                                                I420VideoFrame& video_frame) {\n  return render_module_.GetLastRenderedFrame(renderID, video_frame);\n}\n\nint ViERenderer::SetExpectedRenderDelay(int render_delay) {\n  return render_module_.SetExpectedRenderDelay(render_id_, render_delay);\n}\n\nWebRtc_Word32 ViERenderer::ConfigureRenderer(const unsigned int z_order,\n                                             const float left,\n                                             const float top,\n                                             const float right,\n                                             const float bottom) {\n  return render_module_.ConfigureRenderer(render_id_, z_order, left, top, right,\n                                          bottom);\n}\n\nVideoRender& ViERenderer::RenderModule() {\n  return render_module_;\n}\n\nWebRtc_Word32 ViERenderer::EnableMirroring(const WebRtc_Word32 render_id,\n                                           const bool enable,\n                                           const bool mirror_xaxis,\n                                           const bool mirror_yaxis) {\n  return render_module_.MirrorRenderStream(render_id, enable, mirror_xaxis,\n                                           mirror_yaxis);\n}\n\nWebRtc_Word32 ViERenderer::SetTimeoutImage(const I420VideoFrame& timeout_image,\n                                           const WebRtc_Word32 timeout_value) {\n  return render_module_.SetTimeoutImage(render_id_, timeout_image,\n                                        timeout_value);\n}\n\nWebRtc_Word32  ViERenderer::SetRenderStartImage(\n    const I420VideoFrame& start_image) {\n  return render_module_.SetStartImage(render_id_, start_image);\n}\n\nWebRtc_Word32 ViERenderer::SetExternalRenderer(\n    const WebRtc_Word32 render_id,\n    RawVideoType video_input_format,\n    ExternalRenderer* external_renderer) {\n  if (!incoming_external_callback_)\n    return -1;\n\n  incoming_external_callback_->SetViEExternalRenderer(external_renderer,\n                                                      video_input_format);\n  return render_module_.AddExternalRenderCallback(render_id,\n                                                  incoming_external_callback_);\n}\n\nViERenderer::ViERenderer(const WebRtc_Word32 render_id,\n                         const WebRtc_Word32 engine_id,\n                         VideoRender& render_module,\n                         ViERenderManager& render_manager)\n    : render_id_(render_id),\n      render_module_(render_module),\n      render_manager_(render_manager),\n      render_callback_(NULL),\n      incoming_external_callback_(new ViEExternalRendererImpl()) {\n}\n\nWebRtc_Word32 ViERenderer::Init(const WebRtc_UWord32 z_order,\n                                const float left,\n                                const float top,\n                                const float right,\n                                const float bottom) {\n  render_callback_ =\n      static_cast<VideoRenderCallback*>(render_module_.AddIncomingRenderStream(\n          render_id_, z_order, left, top, right, bottom));\n  if (!render_callback_) {\n    \/\/ Logging done.\n    return -1;\n  }\n  return 0;\n}\n\nvoid ViERenderer::DeliverFrame(int id,\n                               I420VideoFrame* video_frame,\n                               int num_csrcs,\n                               const WebRtc_UWord32 CSRC[kRtpCsrcSize]) {\n  render_callback_->RenderFrame(render_id_, *video_frame);\n}\n\nvoid ViERenderer::DelayChanged(int id, int frame_delay) {}\n\nint ViERenderer::GetPreferedFrameSettings(int* width,\n                                          int* height,\n                                          int* frame_rate) {\n    return -1;\n}\n\nvoid ViERenderer::ProviderDestroyed(int id) {\n  \/\/ Remove the render stream since the provider is destroyed.\n  render_manager_.RemoveRenderStream(render_id_);\n}\n\nViEExternalRendererImpl::ViEExternalRendererImpl()\n    : external_renderer_(NULL),\n      external_renderer_format_(kVideoUnknown),\n      external_renderer_width_(0),\n      external_renderer_height_(0),\n      converted_frame_(new VideoFrame()) {\n}\n\nint ViEExternalRendererImpl::SetViEExternalRenderer(\n    ExternalRenderer* external_renderer,\n    RawVideoType video_input_format) {\n  external_renderer_ = external_renderer;\n  external_renderer_format_ = video_input_format;\n  return 0;\n}\n\nWebRtc_Word32 ViEExternalRendererImpl::RenderFrame(\n    const WebRtc_UWord32 stream_id,\n    I420VideoFrame&   video_frame) {\n  VideoFrame* out_frame = converted_frame_.get();\n\n  \/\/ Convert to requested format.\n  VideoType type =\n      RawVideoTypeToCommonVideoVideoType(external_renderer_format_);\n  int buffer_size = CalcBufferSize(type, video_frame.width(),\n                                   video_frame.height());\n  if (buffer_size <= 0) {\n    \/\/ Unsupported video format.\n    assert(false);\n    return -1;\n  }\n  converted_frame_->VerifyAndAllocate(buffer_size);\n\n  switch (external_renderer_format_) {\n    case kVideoI420: {\n      \/\/ TODO(mikhal): need to copy the buffer as is.\n      \/\/ can the output here be a I420 frame?\n      int length = ExtractBuffer(video_frame, out_frame->Size(),\n                                 out_frame->Buffer());\n      if (length < 0)\n        return -1;\n      out_frame->SetLength(length);\n      break;\n    }\n    case kVideoYV12:\n    case kVideoYUY2:\n    case kVideoUYVY:\n    case kVideoARGB:\n    case kVideoRGB24:\n    case kVideoRGB565:\n    case kVideoARGB4444:\n    case kVideoARGB1555 :\n      {\n        ConvertFromI420(video_frame, type, 0, converted_frame_->Buffer());\n      }\n      break;\n    case kVideoIYUV:\n      \/\/ no conversion available\n      break;\n    default:\n      assert(false);\n      out_frame = NULL;\n      break;\n  }\n\n  if (external_renderer_width_ != video_frame.width() ||\n      external_renderer_height_ != video_frame.height()) {\n    external_renderer_width_ = video_frame.width();\n    external_renderer_height_ = video_frame.height();\n    external_renderer_->FrameSizeChange(external_renderer_width_,\n                                        external_renderer_height_, stream_id);\n  }\n\n  if (out_frame) {\n    external_renderer_->DeliverFrame(out_frame->Buffer(),\n                                     out_frame->Length(),\n                                     video_frame.timestamp(),\n                                     video_frame.render_time_ms());\n  }\n  return 0;\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Set frame length for frame converting in external renderer<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 \"video_engine\/vie_renderer.h\"\n\n#include \"common_video\/libyuv\/include\/webrtc_libyuv.h\"\n#include \"webrtc\/modules\/video_render\/include\/video_render.h\"\n#include \"webrtc\/modules\/video_render\/include\/video_render_defines.h\"\n#include \"video_engine\/vie_render_manager.h\"\n\nnamespace webrtc {\n\nViERenderer* ViERenderer::CreateViERenderer(const WebRtc_Word32 render_id,\n                                            const WebRtc_Word32 engine_id,\n                                            VideoRender& render_module,\n                                            ViERenderManager& render_manager,\n                                            const WebRtc_UWord32 z_order,\n                                            const float left,\n                                            const float top,\n                                            const float right,\n                                            const float bottom) {\n  ViERenderer* self = new ViERenderer(render_id, engine_id, render_module,\n                                      render_manager);\n  if (!self || self->Init(z_order, left, top, right, bottom) != 0) {\n    delete self;\n    self = NULL;\n  }\n  return self;\n}\n\nViERenderer::~ViERenderer(void) {\n  if (render_callback_)\n    render_module_.DeleteIncomingRenderStream(render_id_);\n\n  if (incoming_external_callback_)\n    delete incoming_external_callback_;\n}\n\nWebRtc_Word32 ViERenderer::StartRender() {\n  return render_module_.StartRender(render_id_);\n}\nWebRtc_Word32 ViERenderer::StopRender() {\n  return render_module_.StopRender(render_id_);\n}\n\nWebRtc_Word32 ViERenderer::GetLastRenderedFrame(const WebRtc_Word32 renderID,\n                                                I420VideoFrame& video_frame) {\n  return render_module_.GetLastRenderedFrame(renderID, video_frame);\n}\n\nint ViERenderer::SetExpectedRenderDelay(int render_delay) {\n  return render_module_.SetExpectedRenderDelay(render_id_, render_delay);\n}\n\nWebRtc_Word32 ViERenderer::ConfigureRenderer(const unsigned int z_order,\n                                             const float left,\n                                             const float top,\n                                             const float right,\n                                             const float bottom) {\n  return render_module_.ConfigureRenderer(render_id_, z_order, left, top, right,\n                                          bottom);\n}\n\nVideoRender& ViERenderer::RenderModule() {\n  return render_module_;\n}\n\nWebRtc_Word32 ViERenderer::EnableMirroring(const WebRtc_Word32 render_id,\n                                           const bool enable,\n                                           const bool mirror_xaxis,\n                                           const bool mirror_yaxis) {\n  return render_module_.MirrorRenderStream(render_id, enable, mirror_xaxis,\n                                           mirror_yaxis);\n}\n\nWebRtc_Word32 ViERenderer::SetTimeoutImage(const I420VideoFrame& timeout_image,\n                                           const WebRtc_Word32 timeout_value) {\n  return render_module_.SetTimeoutImage(render_id_, timeout_image,\n                                        timeout_value);\n}\n\nWebRtc_Word32  ViERenderer::SetRenderStartImage(\n    const I420VideoFrame& start_image) {\n  return render_module_.SetStartImage(render_id_, start_image);\n}\n\nWebRtc_Word32 ViERenderer::SetExternalRenderer(\n    const WebRtc_Word32 render_id,\n    RawVideoType video_input_format,\n    ExternalRenderer* external_renderer) {\n  if (!incoming_external_callback_)\n    return -1;\n\n  incoming_external_callback_->SetViEExternalRenderer(external_renderer,\n                                                      video_input_format);\n  return render_module_.AddExternalRenderCallback(render_id,\n                                                  incoming_external_callback_);\n}\n\nViERenderer::ViERenderer(const WebRtc_Word32 render_id,\n                         const WebRtc_Word32 engine_id,\n                         VideoRender& render_module,\n                         ViERenderManager& render_manager)\n    : render_id_(render_id),\n      render_module_(render_module),\n      render_manager_(render_manager),\n      render_callback_(NULL),\n      incoming_external_callback_(new ViEExternalRendererImpl()) {\n}\n\nWebRtc_Word32 ViERenderer::Init(const WebRtc_UWord32 z_order,\n                                const float left,\n                                const float top,\n                                const float right,\n                                const float bottom) {\n  render_callback_ =\n      static_cast<VideoRenderCallback*>(render_module_.AddIncomingRenderStream(\n          render_id_, z_order, left, top, right, bottom));\n  if (!render_callback_) {\n    \/\/ Logging done.\n    return -1;\n  }\n  return 0;\n}\n\nvoid ViERenderer::DeliverFrame(int id,\n                               I420VideoFrame* video_frame,\n                               int num_csrcs,\n                               const WebRtc_UWord32 CSRC[kRtpCsrcSize]) {\n  render_callback_->RenderFrame(render_id_, *video_frame);\n}\n\nvoid ViERenderer::DelayChanged(int id, int frame_delay) {}\n\nint ViERenderer::GetPreferedFrameSettings(int* width,\n                                          int* height,\n                                          int* frame_rate) {\n    return -1;\n}\n\nvoid ViERenderer::ProviderDestroyed(int id) {\n  \/\/ Remove the render stream since the provider is destroyed.\n  render_manager_.RemoveRenderStream(render_id_);\n}\n\nViEExternalRendererImpl::ViEExternalRendererImpl()\n    : external_renderer_(NULL),\n      external_renderer_format_(kVideoUnknown),\n      external_renderer_width_(0),\n      external_renderer_height_(0),\n      converted_frame_(new VideoFrame()) {\n}\n\nint ViEExternalRendererImpl::SetViEExternalRenderer(\n    ExternalRenderer* external_renderer,\n    RawVideoType video_input_format) {\n  external_renderer_ = external_renderer;\n  external_renderer_format_ = video_input_format;\n  return 0;\n}\n\nWebRtc_Word32 ViEExternalRendererImpl::RenderFrame(\n    const WebRtc_UWord32 stream_id,\n    I420VideoFrame&   video_frame) {\n  VideoFrame* out_frame = converted_frame_.get();\n\n  \/\/ Convert to requested format.\n  VideoType type =\n      RawVideoTypeToCommonVideoVideoType(external_renderer_format_);\n  int buffer_size = CalcBufferSize(type, video_frame.width(),\n                                   video_frame.height());\n  if (buffer_size <= 0) {\n    \/\/ Unsupported video format.\n    assert(false);\n    return -1;\n  }\n  converted_frame_->VerifyAndAllocate(buffer_size);\n\n  switch (external_renderer_format_) {\n    case kVideoI420: {\n      \/\/ TODO(mikhal): need to copy the buffer as is.\n      \/\/ can the output here be a I420 frame?\n      int length = ExtractBuffer(video_frame, out_frame->Size(),\n                                 out_frame->Buffer());\n      if (length < 0)\n        return -1;\n      out_frame->SetLength(length);\n      break;\n    }\n    case kVideoYV12:\n    case kVideoYUY2:\n    case kVideoUYVY:\n    case kVideoARGB:\n    case kVideoRGB24:\n    case kVideoRGB565:\n    case kVideoARGB4444:\n    case kVideoARGB1555 :\n      {\n        if (ConvertFromI420(video_frame, type, 0,\n                            converted_frame_->Buffer()) < 0)\n          return -1;\n        converted_frame_->SetLength(buffer_size);\n      }\n      break;\n    case kVideoIYUV:\n      \/\/ no conversion available\n      break;\n    default:\n      assert(false);\n      out_frame = NULL;\n      break;\n  }\n\n  if (external_renderer_width_ != video_frame.width() ||\n      external_renderer_height_ != video_frame.height()) {\n    external_renderer_width_ = video_frame.width();\n    external_renderer_height_ = video_frame.height();\n    external_renderer_->FrameSizeChange(external_renderer_width_,\n                                        external_renderer_height_, stream_id);\n  }\n\n  if (out_frame) {\n    external_renderer_->DeliverFrame(out_frame->Buffer(),\n                                     out_frame->Length(),\n                                     video_frame.timestamp(),\n                                     video_frame.render_time_ms());\n  }\n  return 0;\n}\n\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>#ifndef VIENNAGRID_STORAGE_RANGE_HPP\n#define VIENNAGRID_STORAGE_RANGE_HPP\n\n#include \"viennagrid\/forwards.hpp\"\n\nnamespace viennagrid\n{\n    \n    namespace storage\n    {\n        \n        \n        template<typename container_type>\n        class container_range_wrapper\n        {\n            friend class container_range_wrapper<const container_type>;\n            \n        public:\n            \n            container_range_wrapper(container_type & _container) : container(&_container) {}\n            \n            typedef typename container_type::size_type size_type;\n            typedef typename container_type::value_type value_type;\n            \n            typedef typename container_type::reference reference;\n            typedef typename container_type::const_reference const_reference;\n            \n            typedef typename container_type::pointer pointer;\n            typedef typename container_type::const_pointer const_pointer;\n            \n            typedef typename container_type::iterator iterator;\n            typedef typename container_type::const_iterator const_iterator;\n            \n            typedef typename container_type::reverse_iterator reverse_iterator;\n            typedef typename container_type::const_reverse_iterator const_reverse_iterator;\n            \n            \n            \n            iterator begin() { return container->begin(); }\n            const_iterator begin() const { return container->begin(); }\n            iterator end() { return container->end(); }\n            const_iterator end() const { return container->end(); }\n            \n            reverse_iterator rbegin() { return container->rbegin(); }\n            const_reverse_iterator rbegin() const { return container->rbegin(); }\n            reverse_iterator rend() { return container->rend(); }\n            const_reverse_iterator rend() const { return container->rend(); }\n            \n            \n            \n            reference front() { return container->front(); }\n            const_reference front() const { return container->front(); }\n            reference back() { return container->back(); }\n            const_reference back() const { return container->back(); }\n            \n            \n            \n            reference operator[] (size_type index) { return (*container)[index]; }\n            const_reference operator[] (size_type index) const { return (*container)[index]; }\n            \n            \n            \n            bool empty() const { return container->empty(); }\n            size_type size() const { return container->size(); }\n            \n            \n            \n            \n            typedef typename container_type::hook_type hook_type;\n            typedef typename container_type::hook_iterator hook_iterator;\n            hook_iterator hook_begin() { return container->hook_begin(); }\n            hook_iterator hook_end() { return container->hook_end(); }\n\n            typedef typename container_type::const_hook_type const_hook_type;\n            typedef typename container_type::const_hook_iterator const_hook_iterator;\n            const_hook_iterator hook_begin() const { return container->hook_begin(); }\n            const_hook_iterator hook_end() const { return container->hook_end(); }\n            \n            hook_type hook_at(std::size_t pos)\n            {\n                return *viennagrid::advance(hook_begin(), pos);\n\/\/                 hook_iterator it = hook_begin();\n\/\/                 std::advance( it, pos );\n\/\/                 return *it;\n            }\n            \n            const_hook_type hook_at(std::size_t pos) const\n            {\n                return *viennagrid::advance(hook_begin(), pos);\n\/\/                 const_hook_iterator it = hook_begin();\n\/\/                 std::advance( it, pos );\n\/\/                 return *it;\n            }\n            \n        private:\n            \n            container_type * container;\n        };\n        \n        template<typename container_type>\n        class container_range_wrapper<const container_type>\n        {\n        public:\n            \n            container_range_wrapper(const container_type & _container) : container(&_container) {}\n            container_range_wrapper(const container_range_wrapper<container_type> & rhs) : container(rhs.container) {}\n            \n            typedef typename container_type::size_type size_type;\n            typedef typename container_type::value_type value_type;\n            \n            typedef typename container_type::const_reference reference;\n            typedef typename container_type::const_reference const_reference;\n            \n            typedef typename container_type::const_pointer pointer;\n            typedef typename container_type::const_pointer const_pointer;\n            \n            typedef typename container_type::const_iterator iterator;\n            typedef typename container_type::const_iterator const_iterator;\n            \n            typedef typename container_type::const_reverse_iterator reverse_iterator;\n            typedef typename container_type::const_reverse_iterator const_reverse_iterator;\n            \n            \n            \n            iterator begin() { return container->begin(); }\n            const_iterator begin() const { return container->begin(); }\n            iterator end() { return container->end(); }\n            const_iterator end() const { return container->end(); }\n            \n            reverse_iterator rbegin() { return container->rbegin(); }\n            const_reverse_iterator rbegin() const { return container->rbegin(); }\n            reverse_iterator rend() { return container->rend(); }\n            const_reverse_iterator rend() const { return container->rend(); }\n            \n            \n            \n            reference front() { return container->front(); }\n            const_reference front() const { return container->front(); }\n            reference back() { return container->back(); }\n            const_reference back() const { return container->back(); }\n            \n            \n            \n            reference operator[] (size_type index) { return (*container)[index]; }\n            const_reference operator[] (size_type index) const { return (*container)[index]; }\n            \n            \n            \n            bool empty() const { return container->empty(); }\n            size_type size() const { return container->size(); }\n            \n            \n            \n            typedef typename container_type::const_hook_type hook_type;\n            typedef typename container_type::const_hook_iterator hook_iterator;\n            hook_iterator hook_begin() { return container->hook_begin(); }\n            hook_iterator hook_end() { return container->hook_end(); }\n\n            typedef typename container_type::const_hook_type const_hook_type;\n            typedef typename container_type::const_hook_iterator const_hook_iterator;\n            const_hook_iterator hook_begin() const { return container->hook_begin(); }\n            const_hook_iterator hook_end() const { return container->hook_end(); }\n            \n            hook_type hook_at(std::size_t pos)\n            {\n                return *viennagrid::advance(hook_begin(), pos);\n\/\/                 hook_iterator it = hook_begin();\n\/\/                 std::advance( it, pos );\n\/\/                 return *it;\n            }\n            \n            const_hook_type hook_at(std::size_t pos) const\n            {\n                return *viennagrid::advance(hook_begin(), pos);\n\/\/                 const_hook_iterator it = hook_begin();\n\/\/                 std::advance( it, pos );\n\/\/                 return *it;\n            }\n            \n        private:\n            \n            const container_type * container;\n        };\n        \n        \n        \n        template<typename iterator_type>\n        class forward_iterator_range\n        {\n        public:\n            \n            forward_iterator_range(iterator_type _first, iterator_type _last) : first(_first), last(_last) {}\n            \n            typedef typename iterator_type::T value_type;\n            \n            typedef typename iterator_type::Reference reference;\n            typedef const typename iterator_type::Reference const_reference;\n            \n            typedef typename iterator_type::Pointer pointer;\n            typedef const typename iterator_type::Pointer const_pointer;\n            \n            typedef iterator_type iterator;\n            typedef const iterator_type const_iterator;\n            \n            \n            \n            iterator begin() { return first; }\n            const_iterator begin() const { return first; }\n            iterator end() { return last; }\n            const_iterator end() const { return last; }\n            \n            \n            reference front() { return *first; }\n            const_reference front() const { return *first; }\n            reference back() { iterator_type tmp = last; return *(--tmp); }\n            const_reference back() const { iterator_type tmp = last; return *(--tmp); }\n            \n            \n            \n            bool empty() const { return first == last; }\n            \n            \n            \n        private:\n            iterator_type first;\n            iterator_type last;\n        };\n\n    }\n    \n}\n\n#endif\n\n<commit_msg>added functionality for accessing base container (needed for creating views from a range)<commit_after>#ifndef VIENNAGRID_STORAGE_RANGE_HPP\n#define VIENNAGRID_STORAGE_RANGE_HPP\n\n#include \"viennagrid\/forwards.hpp\"\n\nnamespace viennagrid\n{\n    \n    namespace storage\n    {\n        \n        \n        template<typename container_type>\n        class container_range_wrapper\n        {\n            friend class container_range_wrapper<const container_type>;\n            \n        public:\n            \n            typedef container_type base_container_type;\n            \n            container_range_wrapper(container_type & _container) : container(&_container) {}\n            \n            typedef typename container_type::size_type size_type;\n            typedef typename container_type::value_type value_type;\n            \n            typedef typename container_type::reference reference;\n            typedef typename container_type::const_reference const_reference;\n            \n            typedef typename container_type::pointer pointer;\n            typedef typename container_type::const_pointer const_pointer;\n            \n            typedef typename container_type::iterator iterator;\n            typedef typename container_type::const_iterator const_iterator;\n            \n            typedef typename container_type::reverse_iterator reverse_iterator;\n            typedef typename container_type::const_reverse_iterator const_reverse_iterator;\n            \n            \n            \n            iterator begin() { return container->begin(); }\n            const_iterator begin() const { return container->begin(); }\n            iterator end() { return container->end(); }\n            const_iterator end() const { return container->end(); }\n            \n            reverse_iterator rbegin() { return container->rbegin(); }\n            const_reverse_iterator rbegin() const { return container->rbegin(); }\n            reverse_iterator rend() { return container->rend(); }\n            const_reverse_iterator rend() const { return container->rend(); }\n            \n            \n            \n            reference front() { return container->front(); }\n            const_reference front() const { return container->front(); }\n            reference back() { return container->back(); }\n            const_reference back() const { return container->back(); }\n            \n            \n            \n            reference operator[] (size_type index) { return (*container)[index]; }\n            const_reference operator[] (size_type index) const { return (*container)[index]; }\n            \n            \n            \n            bool empty() const { return container->empty(); }\n            size_type size() const { return container->size(); }\n            \n            \n            \n            \n            typedef typename container_type::hook_type hook_type;\n            typedef typename container_type::hook_iterator hook_iterator;\n            hook_iterator hook_begin() { return container->hook_begin(); }\n            hook_iterator hook_end() { return container->hook_end(); }\n\n            typedef typename container_type::const_hook_type const_hook_type;\n            typedef typename container_type::const_hook_iterator const_hook_iterator;\n            const_hook_iterator hook_begin() const { return container->hook_begin(); }\n            const_hook_iterator hook_end() const { return container->hook_end(); }\n            \n            hook_type hook_at(std::size_t pos)\n            { return *viennagrid::advance(hook_begin(), pos); }\n            const_hook_type hook_at(std::size_t pos) const\n            { return *viennagrid::advance(hook_begin(), pos); }\n            \n            container_type * get_base_container() { return container; }\n            const container_type * get_base_container() const { return container; }\n\n        private:\n            \n            container_type * container;\n        };\n        \n        template<typename container_type>\n        class container_range_wrapper<const container_type>\n        {\n        public:\n            \n            typedef const container_type base_container_type;\n            \n            container_range_wrapper(const container_type & _container) : container(&_container) {}\n            container_range_wrapper(const container_range_wrapper<container_type> & rhs) : container(rhs.container) {}\n            \n            typedef typename container_type::size_type size_type;\n            typedef typename container_type::value_type value_type;\n            \n            typedef typename container_type::const_reference reference;\n            typedef typename container_type::const_reference const_reference;\n            \n            typedef typename container_type::const_pointer pointer;\n            typedef typename container_type::const_pointer const_pointer;\n            \n            typedef typename container_type::const_iterator iterator;\n            typedef typename container_type::const_iterator const_iterator;\n            \n            typedef typename container_type::const_reverse_iterator reverse_iterator;\n            typedef typename container_type::const_reverse_iterator const_reverse_iterator;\n            \n            \n            \n            iterator begin() { return container->begin(); }\n            const_iterator begin() const { return container->begin(); }\n            iterator end() { return container->end(); }\n            const_iterator end() const { return container->end(); }\n            \n            reverse_iterator rbegin() { return container->rbegin(); }\n            const_reverse_iterator rbegin() const { return container->rbegin(); }\n            reverse_iterator rend() { return container->rend(); }\n            const_reverse_iterator rend() const { return container->rend(); }\n            \n            \n            \n            reference front() { return container->front(); }\n            const_reference front() const { return container->front(); }\n            reference back() { return container->back(); }\n            const_reference back() const { return container->back(); }\n            \n            \n            \n            reference operator[] (size_type index) { return (*container)[index]; }\n            const_reference operator[] (size_type index) const { return (*container)[index]; }\n            \n            \n            \n            bool empty() const { return container->empty(); }\n            size_type size() const { return container->size(); }\n            \n            \n            \n            typedef typename container_type::const_hook_type hook_type;\n            typedef typename container_type::const_hook_iterator hook_iterator;\n            hook_iterator hook_begin() { return container->hook_begin(); }\n            hook_iterator hook_end() { return container->hook_end(); }\n\n            typedef typename container_type::const_hook_type const_hook_type;\n            typedef typename container_type::const_hook_iterator const_hook_iterator;\n            const_hook_iterator hook_begin() const { return container->hook_begin(); }\n            const_hook_iterator hook_end() const { return container->hook_end(); }\n            \n            hook_type hook_at(std::size_t pos)\n            { return *viennagrid::advance(hook_begin(), pos); }\n            const_hook_type hook_at(std::size_t pos) const\n            { return *viennagrid::advance(hook_begin(), pos); }\n            \n            const container_type * get_base_container() const { return container; }\n            \n        private:\n            \n            const container_type * container;\n        };\n        \n        \n        \n        template<typename iterator_type>\n        class forward_iterator_range\n        {\n        public:\n            \n            forward_iterator_range(iterator_type _first, iterator_type _last) : first(_first), last(_last) {}\n            \n            typedef typename iterator_type::T value_type;\n            \n            typedef typename iterator_type::Reference reference;\n            typedef const typename iterator_type::Reference const_reference;\n            \n            typedef typename iterator_type::Pointer pointer;\n            typedef const typename iterator_type::Pointer const_pointer;\n            \n            typedef iterator_type iterator;\n            typedef const iterator_type const_iterator;\n            \n            \n            \n            iterator begin() { return first; }\n            const_iterator begin() const { return first; }\n            iterator end() { return last; }\n            const_iterator end() const { return last; }\n            \n            \n            reference front() { return *first; }\n            const_reference front() const { return *first; }\n            reference back() { iterator_type tmp = last; return *(--tmp); }\n            const_reference back() const { iterator_type tmp = last; return *(--tmp); }\n            \n            \n            \n            bool empty() const { return first == last; }\n            \n            \n            \n        private:\n            iterator_type first;\n            iterator_type last;\n        };\n\n    }\n    \n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Virvo - Virtual Reality Volume Rendering\n\/\/ Copyright (C) 1999-2003 University of Stuttgart, 2004-2005 Brown University\n\/\/ Contact: Jurgen P. Schulze, jschulze@ucsd.edu\n\/\/\n\/\/ This file is part of Virvo.\n\/\/\n\/\/ Virvo 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 (see license.txt); if not, write to the\n\/\/ Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n#include <GL\/glew.h>\n\n#include \"vvcanvas.h\"\n\n#include <virvo\/vvdebugmsg.h>\n#include <virvo\/vvfileio.h>\n#include <virvo\/vvgltools.h>\n\n#include <QSettings>\n#include <QTimer>\n\n#include <iostream>\n\nusing vox::vvObjView;\n\nvvCanvas::vvCanvas(const QGLFormat& format, const QString& filename, QWidget* parent)\n  : QGLWidget(format, parent)\n  , _vd(NULL)\n  , _renderer(NULL)\n  , _projectionType(vox::vvObjView::PERSPECTIVE)\n  , _doubleBuffering(format.doubleBuffer())\n  , _superSamples(format.samples())\n{\n  vvDebugMsg::msg(1, \"vvCanvas::vvCanvas()\");\n\n  if (filename != \"\")\n  {\n    _vd = new vvVolDesc(filename.toStdString().c_str());\n  }\n  else\n  {\n    \/\/ load default volume\n    _vd = new vvVolDesc;\n    _vd->vox[0] = 32;\n    _vd->vox[1] = 32;\n    _vd->vox[2] = 32;\n    _vd->frames = 0;\n  }\n\n  \/\/ init ui\n  setMouseTracking(true);\n  setFocusPolicy(Qt::StrongFocus);\n\n  \/\/ read persistent settings\n  QSettings settings;\n  QColor qcolor = settings.value(\"canvas\/bgcolor\").value<QColor>();\n  _bgColor = vvColor(qcolor.redF(), qcolor.greenF(), qcolor.blueF());\n\n  _animTimer = new QTimer(this);\n  connect(_animTimer, SIGNAL(timeout()), this, SLOT(incTimeStep()));\n}\n\nvvCanvas::~vvCanvas()\n{\n  vvDebugMsg::msg(1, \"vvCanvas::~vvCanvas()\");\n\n  delete _renderer;\n  delete _vd;\n}\n\nvoid vvCanvas::setParameter(ParameterType param, const vvParam& value)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setParameter()\");\n\n  switch (param)\n  {\n  case VV_BG_COLOR:\n    _bgColor = value;\n    break;\n  case VV_DOUBLEBUFFERING:\n    _doubleBuffering = value;\n    break;\n  case VV_SUPERSAMPLES:\n    _superSamples = value;\n    break;\n  default:\n    break;\n  }\n}\n\nvoid vvCanvas::setVolDesc(vvVolDesc* vd)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setVolDesc()\");\n\n  delete _vd;\n  _vd = vd;\n\n  if (_vd != NULL)\n  {\n    createRenderer();\n  }\n\n  foreach (vvPlugin* plugin, _plugins)\n  {\n    plugin->setVolDesc(_vd);\n  }\n\n  emit newVolDesc(_vd);\n}\n\nvoid vvCanvas::setPlugins(const QList<vvPlugin*>& plugins)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setPlugins()\");\n\n  _plugins = plugins;\n}\n\nvvVolDesc* vvCanvas::getVolDesc() const\n{\n  vvDebugMsg::msg(3, \"vvCanvas::getVolDesc()\");\n\n  return _vd;\n}\n\nvvRenderer* vvCanvas::getRenderer() const\n{\n  vvDebugMsg::msg(3, \"vvCanvas::getRenderer()\");\n\n  return _renderer;\n}\n\nvoid vvCanvas::loadCamera(const QString& filename)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::loadCamera()\");\n\n  QByteArray ba = filename.toLatin1();\n  _ov.loadCamera(ba.data());\n}\n\nvoid vvCanvas::saveCamera(const QString& filename)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::saveCamera()\");\n\n  QByteArray ba = filename.toLatin1();\n  _ov.saveCamera(ba.data());\n}\n\nvoid vvCanvas::initializeGL()\n{\n  vvDebugMsg::msg(1, \"vvCanvas::initializeGL()\");\n\n  glewInit();\n  init();\n}\n\nvoid vvCanvas::paintGL()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::paintGL()\");\n\n  if (_renderer == NULL)\n  {\n    return;\n  }\n\n  if (_doubleBuffering)\n  {\n    glDrawBuffer(GL_BACK);\n  }\n  else\n  {\n    glDrawBuffer(GL_FRONT);\n  }\n\n  glClearColor(_bgColor[0], _bgColor[1], _bgColor[2], 0.0f);\n  glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n  glMatrixMode(GL_MODELVIEW);\n  _ov.setModelviewMatrix(vvObjView::CENTER);\n\n  foreach (vvPlugin* plugin, _plugins)\n  {\n    if (plugin->isActive())\n    {\n      plugin->prerender();\n    }\n  }\n\n  _renderer->renderVolumeGL();\n\n  foreach (vvPlugin* plugin, _plugins)\n  {\n    if (plugin->isActive())\n    {\n      plugin->postrender();\n    }\n  }\n}\n\nvoid vvCanvas::resizeGL(const int w, const int h)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::resizeGL()\");\n\n  glViewport(0, 0, w, h);\n  if (h > 0)\n  {\n    _ov.setAspectRatio(static_cast<float>(w) \/ static_cast<float>(h));\n  }\n  updateGL();\n\n  emit resized(QSize(w, h));\n}\n\nvoid vvCanvas::mouseMoveEvent(QMouseEvent* event)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::mouseMoveEvent()\");\n\n  switch (_mouseButton)\n  {\n  case Qt::LeftButton:\n  {\n    _ov._camera.trackballRotation(width(), height(),\n      _lastMousePos.x(), _lastMousePos.y(),\n      event->pos().x(), event->pos().y());\n    break;\n  }\n  case Qt::MiddleButton:\n  {\n    const float pixelInWorld = _ov.getViewportWidth() \/ static_cast<float>(width());\n    const float dx = static_cast<float>(event->pos().x() - _lastMousePos.x());\n    const float dy = static_cast<float>(event->pos().y() - _lastMousePos.y());\n    vvVector2f pan(pixelInWorld * dx, pixelInWorld * dy);\n    _ov._camera.translate(pan[0], -pan[1], 0.0f);\n    break;\n  }\n  case Qt::RightButton:\n  {\n    const float factor = event->pos().y() - _lastMousePos.y();\n    _ov._camera.translate(0.0f, 0.0f, factor);\n    break;\n  }\n  default:\n    break;\n  }\n  _lastMousePos = event->pos();\n  updateGL();\n}\n\nvoid vvCanvas::mousePressEvent(QMouseEvent* event)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::mousePressEvent()\");\n\n  _mouseButton = event->button();\n  _lastMousePos = event->pos();\n}\n\nvoid vvCanvas::mouseReleaseEvent(QMouseEvent*)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::mouseReleaseEvent()\");\n\n  _mouseButton = Qt::NoButton;\n}\n\nvoid vvCanvas::init()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::init()\");\n\n  \n  vvFileIO* fio = new vvFileIO;\n  fio->loadVolumeData(_vd, vvFileIO::ALL_DATA);\n  delete fio;\n\n  \/\/ default transfer function\n  if (_vd->tf.isEmpty())\n  {\n    _vd->tf.setDefaultAlpha(0, _vd->real[0], _vd->real[1]);\n    _vd->tf.setDefaultColors((_vd->chan == 1) ? 0 : 3, _vd->real[0], _vd->real[1]);\n  }\n\n  \/\/ init renderer\n  if (_vd != NULL)\n  {\n    _currentRenderer = \"viewport\";\n    _currentOptions[\"voxeltype\"] = \"arb\";\n    createRenderer();\n  }\n\n  updateProjection();\n\n  foreach (vvPlugin* plugin, _plugins)\n  {\n    plugin->setVolDesc(_vd);\n  }\n\n  emit newVolDesc(_vd);\n}\n\nvoid vvCanvas::createRenderer()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::createRenderer()\");\n\n  vvRenderState state;\n  if (_renderer)\n  {\n    state = *_renderer;\n    delete _renderer;\n  }\n\n  vvRendererFactory::Options opt(_currentOptions);\n  _renderer = vvRendererFactory::create(_vd, state, _currentRenderer.c_str(), opt);\n}\n\nvoid vvCanvas::updateProjection()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::updateProjection()\");\n\n  if (_projectionType == vvObjView::PERSPECTIVE)\n  {\n    _ov.setProjection(vvObjView::PERSPECTIVE, vvObjView::DEF_FOV, vvObjView::DEF_CLIP_NEAR, vvObjView::DEF_CLIP_FAR);\n  }\n  else if (_projectionType == vvObjView::ORTHO)\n  {\n    _ov.setProjection(vvObjView::ORTHO, vvObjView::DEF_VIEWPORT_WIDTH, vvObjView::DEF_CLIP_NEAR, vvObjView::DEF_CLIP_FAR);\n  }\n}\n\nvoid vvCanvas::setCurrentFrame(const int frame)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setCurrentFrame()\");\n\n  _renderer->setCurrentFrame(frame);\n  emit currentFrame(frame);\n  updateGL();\n}\n\nvoid vvCanvas::startAnimation(const double fps)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::startAnimation()\");\n\n  _vd->dt = 1.0f \/ static_cast<float>(fps);\n  const float delay = std::abs(_vd->dt * 1000.0f);\n  _animTimer->start(static_cast<int>(delay));\n}\n\nvoid vvCanvas::stopAnimation()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::stopAnimation()\");\n\n  _animTimer->stop();\n}\n\nvoid vvCanvas::setTimeStep(const int step)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setTimeStep()\");\n\n  int f = step;\n  while (f < 0)\n  {\n    f += _vd->frames; \n  }\n\n  while (f >= _vd->frames)\n  {\n    f -= _vd->frames;\n  }\n\n  _renderer->setCurrentFrame(f);\n  \/\/ don't emit currentFrame!\n  updateGL();\n}\n\nvoid vvCanvas::incTimeStep()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::incTimeStep()\");\n\n  int f = _renderer->getCurrentFrame();\n  f = (f >= _vd->frames - 1) ? 0 : f + 1;\n  setCurrentFrame(f);\n}\n\nvoid vvCanvas::decTimeStep()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::decTimeStep()\");\n\n  int f = _renderer->getCurrentFrame();\n  f = (f <= 0) ? _vd->frames - 1 : f - 1;\n  setCurrentFrame(f);\n}\n\nvoid vvCanvas::firstTimeStep()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::firstTimeStep()\");\n\n  setCurrentFrame(0);\n}\n\nvoid vvCanvas::lastTimeStep()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::lastTimeStep()\");\n\n  setCurrentFrame(_vd->frames - 1);\n}\n\n<commit_msg>Bug fix<commit_after>\/\/ Virvo - Virtual Reality Volume Rendering\n\/\/ Copyright (C) 1999-2003 University of Stuttgart, 2004-2005 Brown University\n\/\/ Contact: Jurgen P. Schulze, jschulze@ucsd.edu\n\/\/\n\/\/ This file is part of Virvo.\n\/\/\n\/\/ Virvo 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 (see license.txt); if not, write to the\n\/\/ Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n#include <GL\/glew.h>\n\n#include \"vvcanvas.h\"\n\n#include <virvo\/vvdebugmsg.h>\n#include <virvo\/vvfileio.h>\n#include <virvo\/vvgltools.h>\n\n#include <QSettings>\n#include <QTimer>\n\n#include <iostream>\n\nusing vox::vvObjView;\n\nvvCanvas::vvCanvas(const QGLFormat& format, const QString& filename, QWidget* parent)\n  : QGLWidget(format, parent)\n  , _vd(NULL)\n  , _renderer(NULL)\n  , _projectionType(vox::vvObjView::PERSPECTIVE)\n  , _doubleBuffering(format.doubleBuffer())\n  , _superSamples(format.samples())\n{\n  vvDebugMsg::msg(1, \"vvCanvas::vvCanvas()\");\n\n  if (filename != \"\")\n  {\n    _vd = new vvVolDesc(filename.toStdString().c_str());\n  }\n  else\n  {\n    \/\/ load default volume\n    _vd = new vvVolDesc;\n    _vd->vox[0] = 32;\n    _vd->vox[1] = 32;\n    _vd->vox[2] = 32;\n    _vd->frames = 0;\n  }\n\n  \/\/ init ui\n  setMouseTracking(true);\n  setFocusPolicy(Qt::StrongFocus);\n\n  \/\/ read persistent settings\n  QSettings settings;\n  QColor qcolor = settings.value(\"canvas\/bgcolor\").value<QColor>();\n  _bgColor = vvColor(qcolor.redF(), qcolor.greenF(), qcolor.blueF());\n\n  _animTimer = new QTimer(this);\n  connect(_animTimer, SIGNAL(timeout()), this, SLOT(incTimeStep()));\n}\n\nvvCanvas::~vvCanvas()\n{\n  vvDebugMsg::msg(1, \"vvCanvas::~vvCanvas()\");\n\n  delete _renderer;\n  delete _vd;\n}\n\nvoid vvCanvas::setParameter(ParameterType param, const vvParam& value)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setParameter()\");\n\n  switch (param)\n  {\n  case VV_BG_COLOR:\n    _bgColor = value;\n    break;\n  case VV_DOUBLEBUFFERING:\n    _doubleBuffering = value;\n    break;\n  case VV_SUPERSAMPLES:\n    _superSamples = value;\n    break;\n  default:\n    break;\n  }\n}\n\nvoid vvCanvas::setVolDesc(vvVolDesc* vd)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setVolDesc()\");\n\n  delete _vd;\n  _vd = vd;\n\n  if (_vd != NULL)\n  {\n    createRenderer();\n  }\n\n  foreach (vvPlugin* plugin, _plugins)\n  {\n    plugin->setVolDesc(_vd);\n  }\n\n  emit newVolDesc(_vd);\n}\n\nvoid vvCanvas::setPlugins(const QList<vvPlugin*>& plugins)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setPlugins()\");\n\n  _plugins = plugins;\n}\n\nvvVolDesc* vvCanvas::getVolDesc() const\n{\n  vvDebugMsg::msg(3, \"vvCanvas::getVolDesc()\");\n\n  return _vd;\n}\n\nvvRenderer* vvCanvas::getRenderer() const\n{\n  vvDebugMsg::msg(3, \"vvCanvas::getRenderer()\");\n\n  return _renderer;\n}\n\nvoid vvCanvas::loadCamera(const QString& filename)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::loadCamera()\");\n\n  QByteArray ba = filename.toLatin1();\n  _ov.loadCamera(ba.data());\n}\n\nvoid vvCanvas::saveCamera(const QString& filename)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::saveCamera()\");\n\n  QByteArray ba = filename.toLatin1();\n  _ov.saveCamera(ba.data());\n}\n\nvoid vvCanvas::initializeGL()\n{\n  vvDebugMsg::msg(1, \"vvCanvas::initializeGL()\");\n\n  glewInit();\n  init();\n}\n\nvoid vvCanvas::paintGL()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::paintGL()\");\n\n  if (_renderer == NULL)\n  {\n    return;\n  }\n\n  if (_doubleBuffering)\n  {\n    glDrawBuffer(GL_BACK);\n  }\n  else\n  {\n    glDrawBuffer(GL_FRONT);\n  }\n\n  glClearColor(_bgColor[0], _bgColor[1], _bgColor[2], 0.0f);\n  glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n  glMatrixMode(GL_MODELVIEW);\n  _ov.setModelviewMatrix(vvObjView::CENTER);\n\n  foreach (vvPlugin* plugin, _plugins)\n  {\n    if (plugin->isActive())\n    {\n      plugin->prerender();\n    }\n  }\n\n  _renderer->renderVolumeGL();\n\n  foreach (vvPlugin* plugin, _plugins)\n  {\n    if (plugin->isActive())\n    {\n      plugin->postrender();\n    }\n  }\n}\n\nvoid vvCanvas::resizeGL(const int w, const int h)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::resizeGL()\");\n\n  glViewport(0, 0, w, h);\n  if (h > 0)\n  {\n    _ov.setAspectRatio(static_cast<float>(w) \/ static_cast<float>(h));\n  }\n  updateGL();\n\n  emit resized(QSize(w, h));\n}\n\nvoid vvCanvas::mouseMoveEvent(QMouseEvent* event)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::mouseMoveEvent()\");\n\n  switch (_mouseButton)\n  {\n  case Qt::LeftButton:\n  {\n    _ov._camera.trackballRotation(width(), height(),\n      _lastMousePos.x(), _lastMousePos.y(),\n      event->pos().x(), event->pos().y());\n    break;\n  }\n  case Qt::MiddleButton:\n  {\n    const float pixelInWorld = _ov.getViewportWidth() \/ static_cast<float>(width());\n    const float dx = static_cast<float>(event->pos().x() - _lastMousePos.x());\n    const float dy = static_cast<float>(event->pos().y() - _lastMousePos.y());\n    vvVector2f pan(pixelInWorld * dx, pixelInWorld * dy);\n    _ov._camera.translate(pan[0], -pan[1], 0.0f);\n    break;\n  }\n  case Qt::RightButton:\n  {\n    const float factor = event->pos().y() - _lastMousePos.y();\n    _ov._camera.translate(0.0f, 0.0f, factor);\n    break;\n  }\n  default:\n    break;\n  }\n  _lastMousePos = event->pos();\n  updateGL();\n}\n\nvoid vvCanvas::mousePressEvent(QMouseEvent* event)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::mousePressEvent()\");\n\n  _mouseButton = event->button();\n  _lastMousePos = event->pos();\n}\n\nvoid vvCanvas::mouseReleaseEvent(QMouseEvent*)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::mouseReleaseEvent()\");\n\n  _mouseButton = Qt::NoButton;\n}\n\nvoid vvCanvas::init()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::init()\");\n\n  \n  vvFileIO* fio = new vvFileIO;\n  fio->loadVolumeData(_vd, vvFileIO::ALL_DATA);\n  delete fio;\n\n  \/\/ default transfer function\n  if (_vd->tf.isEmpty())\n  {\n    _vd->tf.setDefaultAlpha(0, _vd->real[0], _vd->real[1]);\n    _vd->tf.setDefaultColors((_vd->chan == 1) ? 0 : 3, _vd->real[0], _vd->real[1]);\n  }\n\n  \/\/ init renderer\n  if (_vd != NULL)\n  {\n    _currentRenderer = \"viewport\";\n    _currentOptions[\"voxeltype\"] = \"arb\";\n    createRenderer();\n  }\n\n  updateProjection();\n\n  foreach (vvPlugin* plugin, _plugins)\n  {\n    plugin->setVolDesc(_vd);\n  }\n\n  emit newVolDesc(_vd);\n}\n\nvoid vvCanvas::createRenderer()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::createRenderer()\");\n\n  vvRenderState state;\n  if (_renderer)\n  {\n    state = *_renderer;\n    delete _renderer;\n  }\n\n  vvRendererFactory::Options opt(_currentOptions);\n  _renderer = vvRendererFactory::create(_vd, state, _currentRenderer.c_str(), opt);\n}\n\nvoid vvCanvas::updateProjection()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::updateProjection()\");\n\n  if (_projectionType == vvObjView::PERSPECTIVE)\n  {\n    _ov.setProjection(vvObjView::PERSPECTIVE, vvObjView::DEF_FOV, vvObjView::DEF_CLIP_NEAR, vvObjView::DEF_CLIP_FAR);\n  }\n  else if (_projectionType == vvObjView::ORTHO)\n  {\n    _ov.setProjection(vvObjView::ORTHO, vvObjView::DEF_VIEWPORT_WIDTH, vvObjView::DEF_CLIP_NEAR, vvObjView::DEF_CLIP_FAR);\n  }\n}\n\nvoid vvCanvas::setCurrentFrame(const int frame)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setCurrentFrame()\");\n\n  _renderer->setCurrentFrame(frame);\n  emit currentFrame(frame);\n  updateGL();\n}\n\nvoid vvCanvas::startAnimation(const double fps)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::startAnimation()\");\n\n  _vd->dt = 1.0f \/ static_cast<float>(fps);\n  const float delay = std::abs(_vd->dt * 1000.0f);\n  _animTimer->start(static_cast<int>(delay));\n}\n\nvoid vvCanvas::stopAnimation()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::stopAnimation()\");\n\n  _animTimer->stop();\n}\n\nvoid vvCanvas::setTimeStep(const int step)\n{\n  vvDebugMsg::msg(3, \"vvCanvas::setTimeStep()\");\n\n  int f = step;\n  while (f < 0)\n  {\n    f += _vd->frames; \n  }\n\n  while (f >= _vd->frames)\n  {\n    f -= _vd->frames;\n  }\n\n  setCurrentFrame(f);\n}\n\nvoid vvCanvas::incTimeStep()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::incTimeStep()\");\n\n  int f = _renderer->getCurrentFrame();\n  f = (f >= _vd->frames - 1) ? 0 : f + 1;\n  setCurrentFrame(f);\n}\n\nvoid vvCanvas::decTimeStep()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::decTimeStep()\");\n\n  int f = _renderer->getCurrentFrame();\n  f = (f <= 0) ? _vd->frames - 1 : f - 1;\n  setCurrentFrame(f);\n}\n\nvoid vvCanvas::firstTimeStep()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::firstTimeStep()\");\n\n  setCurrentFrame(0);\n}\n\nvoid vvCanvas::lastTimeStep()\n{\n  vvDebugMsg::msg(3, \"vvCanvas::lastTimeStep()\");\n\n  setCurrentFrame(_vd->frames - 1);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"environment.h\"\n\nenvironment::environment()\n{\n    \/\/curBudget_ = 0;\n    algo_ = ml::LINEAR_REGRESSION;\n    budget_ = 1;\n}\n\nvoid environment::read_from_stream(vw* model, istream &fin)\n{\n    string line;\n    while (true)\n    {\n\tgetline(fin, line, '\\n');\n\tif ( line.empty())\n\t    break;\n\titem tmp;\n\ttmp.init_example(model, &line[0]);\n\titems_.push_back(tmp);\n    }\n}\n\n\nvoid environment::linear_regression(vw* model, int numPasses)  \n{\n    for (int ct = 0; ct < numPasses; ct++)\n\t{ \n\t    \/\/   cout << \"Passes \" << ct << endl;\n\t    for (int i = 0; i < items_.size(); i++)\n\t\t{\n\t\t    \/\/  cout << \"regress on \" << i <<endl;\n\t\t    items_[i].vw_create_example(model);\n\t\t    model->learn(items_[i].ex);\n\t\t    items_[i].release_vwexample(model);\n\t\t    \/\/   cout << \"train \" << ((label_data*) items_[i].ex->ld)->label << \" ::: \" << items_[i].ex->final_prediction << endl;\n\t\t}\n\t}\n}\n\nvoid environment::svm_rank(vw* model, int numPasses)\n{\n    cout << \"start svm_rank binary classification\" <<endl;\n    for (int ct = 0; ct < numPasses; ct++)\n\t{\n\t    for (int i = 0; i < items_.size(); i++)\n\t\t{\n\t\t    for (int j = 0; j < items_.size(); j++)\n\t\t\tif (i != j)\n\t\t\t    {\n\t\t\t    \n\t\t\t\t\/\/\tcout << i << \";\" << j <<endl;\n\t\t\t\t\/\/\tcout << \"progress \" << double(i)\/items_.size() <<endl;\n\t\t\t\tchar str[charN];\n\t\t\t\t\/\/ char *str = new char[charN];\n\t\t\t\t\/\/  str = NULL;\n\t\t\t\t\/\/  strcpy(str, items_[i].get_diff_str(items_[j]));\n\t\t\t\titems_[i].get_diff_str(items_[j], str);\n\t\t\t\tif (!strcmp(str, \"\\0\")) \n\t\t\t\t    {\n\t\t\t\t\t\/\/\t\t\tcout << \"label equal\" <<endl;\n\t\t\t\t\tcontinue;\n\t\t\t\t    }\n\t\t\t    \n\t\t\t\t\/\/ items_[i].get_diff_str(items_[j], str);\n\t\t\t\t\/\/\tcout <<\"str:\" << str <<endl;\n\t\t\t\texample *ex = VW::read_example(*model, str);\n\t\t\t\tmodel->learn(ex);\n\t\t\t\t\/\/\t\t\t\tcout << \"learn\" <<endl;\n\t\t\t\tVW::finish_example(*model, ex);\n\t\t\t\t\/\/cout << \"free example\" <<endl;\n\t\t\t\t\/\/ delete []str;\n\t\t\t    }\n\t\t    \/\/   items_[i].release_vwexample(model);\n\t\t}\n\t}\n}\n\ndouble environment::get_dis2set(item & itm)\n{\n    \/\/return sum of distance\n    double sumDis = 0;\n    for (int i = 0; i < predList_.size(); i++)\n\t{\n\t    sumDis += itm.compute_simDis(items_[predList_[i]]);\n\t}\n       return sumDis;\n}\nvector<double> environment::getVecSimVals()\n{\n    \/\/return the normalized inverse sum of distance similarity\n    double sumDisVal = 0;\n    double minDisVal = 0;\n    vector<double> recSumDists;\n    double maxSumDis = -1e+9;\n    for (int i = 0; i < items_.size(); i++)\n\t{\n\t    \/\/sum of dis\n\t    sumDisVal = get_dis2set(items_[i]);\n\t    recSumDists.push_back(sumDisVal);\n\t    maxSumDis = (maxSumDis > sumDisVal)? maxSumDis: sumDisVal;\n\t}\n    \n    for (int i = 0; i < items_.size(); i++)\n\t{  \n\t    recSumDists[i] = 1 - recSumDists[i]\/maxSumDis;\n\t}\n    \n    return recSumDists;\n}\nvoid environment::updateSimFeatures(vw* model, submodOracle & fOracle)\n{\n    \/\/get the submodular values for things in the predList_\n    \/\/ double predListScore = 0;\n    cout << \"updateFeatures\" << endl;    \n    vector<simpleItem> predListItems;\n    for (int i = 0; i < predList_.size(); i++)\n\t{\n\t    simpleItem tmpItem;\n\t    tmpItem.itemId = predList_[i];\n\t    tmpItem.envId = items_[tmpItem.itemId].get_envId();\n\t    tmpItem.label = items_[tmpItem.itemId].get_label();\n\t    predListItems.push_back(tmpItem);\n\t}\n\n    vector<double> vecSumSim = getVecSimVals();\n    double newLabel = 0;\n    for (int i = 0; i < items_.size(); i++)\n\t{\n\t    vector<feat_pair> vec_feat;\n\t    feat_pair featPair;\n\t    featPair.featId = featIndex::SUMSIM;  \n\t    featPair.val = vecSumSim[i];\n\t    \/\/    cout << \"Similarity for item \" << i << \" to predList :\" << featPair.val << endl;\n\n\t    vec_feat.push_back(featPair);\n\t\n\t    \/\/ compute marginal gain and update label  \n\t    simpleItem tmpItem;\n\t    tmpItem.itemId = i;\n\t    tmpItem.envId = items_[tmpItem.itemId].get_envId();\n\t    tmpItem.label = items_[tmpItem.itemId].get_label();\n\t    newLabel = fOracle.getMarginalScore(predListItems, tmpItem);\n\t    \/\/    cout << \"newLabel \" <<newLabel << endl;\n\t    items_[i].update_example(model, vec_feat, newLabel, true); \n\t    \/\/need to check whether budget overflow\n\t}\n}\n\nvoid environment::updateSimFeaturesPredictOnly(vw* model)\n{\n    vector<double> vecSumSim = getVecSimVals();\n    for (int i = 0; i < items_.size(); i++)\n\t{\n\t    vector<feat_pair> vec_feat;\n\t    feat_pair featPair;\n\t    featPair.featId = featIndex::SUMSIM;  \n\t    featPair.val = vecSumSim[i];\n\t    vec_feat.push_back(featPair);\n\n\t    \/\/ no need to update label, cuz it's prediction only  \n\t    items_[i].update_example(model, vec_feat); \n\t    \/\/need to check whether budget overflow\n\t}\n}\n\nvoid environment::oneRoundTrain(vw* model, int numPasses)\n{\n    cout <<\"startOneRoundTraining\" <<endl;\n    model->training = true; \n    if (algo_ == ml::LINEAR_REGRESSION)\n\t{\n\t    linear_regression(model, numPasses);\n\t}\n    else if (algo_ == ml::SVM_RANK)\n\t{\n\t    svm_rank(model, numPasses);\n\t}\n}\n\nvoid environment::oneRoundPrediction(vw* model, bool useGreedyOracle )\n{\n    cout << \"startoneRoundPrediction\" <<endl;\n    double maxValue = -1e10;\n    int maxItemId = -1;\n    double modelPredScore = 0;\n    model->training = false;  \n    haveSpace_ = false;\n    for (int i = 0; i < items_.size(); i++)\n\t{\n\t    if (!useGreedyOracle)  \/\/if use model prediction\n\t\t{\n\t\t    \/\/vw will produce warning here because it will see non-binary labels, but for prediction, label does not matter\n\t\t    items_[i].vw_create_example(model);   \n\t\t    if (algo_ == ml::SVM_RANK)\n\t\t\t((label_data*) items_[i].ex->ld)->label = 1;\n\t\t    model->learn(items_[i].ex);\n\t\t    modelPredScore = items_[i].ex->final_prediction;\n\t\t    items_[i].release_vwexample(model);\n\t\t}\n\t    else  \/\/if use greedy ground truth, note label is updated as marginal gain\n\t\t{\n\t\t    \/\/ modelPredScore  = ((label_data*) items_[i].ex->ld)->label;\n\t\t    modelPredScore = items_[i].get_label();\n\t\t}\n\t    \/\/    cout << \"predictStatus for Item \" << i << \": gdScore \" << ((label_data*) items_[i].ex->ld)->label << \" vwScore \" << items_[i].ex->final_prediction <<endl;\n\t    if ( curBudget_ + items_[i].size > budget_ )\n\t\t{\n\t\t    tag_usable[i] = false;\n\t\t}\n\t    if ( modelPredScore > maxValue && tag_usable[i])  \/\/find largest \n\t\t{\n\t\t    maxValue = modelPredScore;\n\t\t    maxItemId = i;\n\t\t    if (curBudget_ + items_[i].size < budget_)\n\t\t\thaveSpace_ = true;\n\t\t}\n\t}\n    if (maxItemId != -1)\n\t{\n\t    predList_.push_back(maxItemId);\n\t    curBudget_ += items_[maxItemId].size; \n\t    \/\/both for cardinality and knapsack constraint\n\t    curSubModScore_ += maxValue * items_[maxItemId].size;  \n\t    tag_usable[maxItemId] = false;\n\t}\n    \/\/display prediction information\n    for (int i = 0; i < predList_.size(); i++)\n\t{\n\t    cout << predList_[i] << \",\";\n\t}\n    cout << \" currentSubModScore:  \" << curSubModScore_ << endl;\n    cout << \" currentBudget: \" << curBudget_<< endl;\n}\n\nvoid environment::multiRoundTrain(vw* model, submodOracle & fOracle, bool useGreedyPolicy, int numPasses)\n{\n    curBudget_ = 0;\n    curSubModScore_ = 0;\n    haveSpace_ = true;\n    tag_usable = new bool[items_.size()];\n    memset(tag_usable, true , sizeof(bool) * items_.size());\n    while (haveSpace_)\n\t{\n\t    cout << \"trainingOneRound\" << endl;\n\t    oneRoundTrain(model, numPasses);\n\t    \/\/if useGreedyPolicy is true \n\t    oneRoundPrediction(model, useGreedyPolicy); \n\t    updateSimFeatures(model, fOracle);\n\t}\n    \n     getPerSlotScore(fOracle);\n     \/\/  release_items_vwexample(model);\n}\n\nvoid environment::multiRoundPredictOnly(vw* model)\n{\n    curBudget_ = 0;\n    curSubModScore_ = 0;\n    haveSpace_ = true;\n    tag_usable = new bool[items_.size()];\n    memset(tag_usable, true , sizeof(bool) * items_.size());\n    while (haveSpace_)\n\t{\n\t    oneRoundPrediction(model); \n\t    updateSimFeaturesPredictOnly(model);\n\t} \n    \/\/   release_items_vwexample(model);\n}\n\nvector<double> environment::getPerSlotScore( submodOracle & fOracle)\n{\n    vector<simpleItem> predListItems;\n    double gain = 0 ;\n    double fVal = 0;\n    vector<double> perSlotScore;\n    for (int pos = 0; pos < predList_.size(); pos++)\n\t{\n\t    \/\/create partial list\n\t    predListItems.clear();\n\t    for (int i = 0; i < pos; i++)\n\t\t{\n\t\t    simpleItem tmpItem;\n\t\t    tmpItem.itemId = predList_[i];\n\t\t    tmpItem.envId = items_[tmpItem.itemId].get_envId();\n\t\t    tmpItem.label = items_[tmpItem.itemId].get_label();\n\t\t    predListItems.push_back(tmpItem);\n\t\t}\n\t    simpleItem tmpItem;\n\t    tmpItem.itemId = predList_[pos];\n\t    tmpItem.envId = items_[tmpItem.itemId].get_envId();\n\t    tmpItem.label = items_[tmpItem.itemId].get_label();\n\t    gain = fOracle.getMarginalScore(predListItems, tmpItem)  ;\n\t    \/\/\t    cout << \"PredictList at Pos \" << pos << \" have marginal gain : \" << gain <<endl;\n\t    fVal += gain;\n\t    perSlotScore.push_back(fVal);\n\t    cout << \"PredictList at Pos \" << pos << \" is \" << predList_[pos] << \" , has submod value : \" << fVal << endl;\n\t}\n    return perSlotScore;\n}\n\nvoid environment::release_items_vwexample(vw* model)\n{\n    for (int i = 0; i < items_.size(); i++)\n\t{\n\t    items_[i].release_vwexample(model);\n\t}\n}\n\n<commit_msg>Delete environment.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"csvmodelwriter.h\"\n\n#include <QAbstractItemModel>\n#include <QFile>\n#include <QTextStream>\n\nCSVModelWriter::CSVModelWriter(const QString &filename, QObject *parent) :\n    QObject(parent),\n    filename(filename)\n{\n}\n\nvoid CSVModelWriter::setModel(const QAbstractItemModel *model)\n{\n    this->model = model;\n}\n\nvoid CSVModelWriter::addColumn(const QString &title, int column, int role)\n{\n    Column col;\n    col.title = title;\n    col.column = column;\n    col.role = role;\n\n    columns.append(col);\n}\n\nstatic void writeValue(QTextStream &f, const QString &value)\n{\n    \/\/ TODO: quoting if \" or \\n in string\n    f << \"\\\"\" << value << \"\\\"\";\n}\n\nstatic void writeSep(QTextStream &f)\n{\n    f << \",\";\n}\n\nstatic void writeNewline(QTextStream &f)\n{\n    f << \"\\n\";\n}\n\nbool CSVModelWriter::write()\n{\n    QFile file(filename);\n    if(!file.open(QIODevice::WriteOnly | QIODevice::Text))\n        return false;\n    QTextStream out(&file);\n\n    int numRows = 0;\n    if(model)\n    {\n        numRows = model->rowCount();\n    }\n\n    \/\/ Header row\n    for(int i=0; i<columns.size(); ++i)\n    {\n        if(i!=0)\n        {\n            writeSep(out);\n        }\n        writeValue(out, columns[i].title);\n    }\n    writeNewline(out);\n\n    \/\/ Data rows\n    for(int j=0; j<numRows; ++j)\n    {\n        for(int i=0; i<columns.size(); ++i)\n        {\n            if(i!=0)\n            {\n                writeSep(out);\n            }\n            QVariant data = model->index(j, columns[i].column).data(columns[i].role);\n            writeValue(out, data.toString());\n        }\n        writeNewline(out);\n    }\n\n    file.close();\n\n    return file.error() == QFile::NoError;\n}\n\n<commit_msg>Add forgotten initializer<commit_after>#include \"csvmodelwriter.h\"\n\n#include <QAbstractItemModel>\n#include <QFile>\n#include <QTextStream>\n\nCSVModelWriter::CSVModelWriter(const QString &filename, QObject *parent) :\n    QObject(parent),\n    filename(filename), model(0)\n{\n}\n\nvoid CSVModelWriter::setModel(const QAbstractItemModel *model)\n{\n    this->model = model;\n}\n\nvoid CSVModelWriter::addColumn(const QString &title, int column, int role)\n{\n    Column col;\n    col.title = title;\n    col.column = column;\n    col.role = role;\n\n    columns.append(col);\n}\n\nstatic void writeValue(QTextStream &f, const QString &value)\n{\n    \/\/ TODO: quoting if \" or \\n in string\n    f << \"\\\"\" << value << \"\\\"\";\n}\n\nstatic void writeSep(QTextStream &f)\n{\n    f << \",\";\n}\n\nstatic void writeNewline(QTextStream &f)\n{\n    f << \"\\n\";\n}\n\nbool CSVModelWriter::write()\n{\n    QFile file(filename);\n    if(!file.open(QIODevice::WriteOnly | QIODevice::Text))\n        return false;\n    QTextStream out(&file);\n\n    int numRows = 0;\n    if(model)\n    {\n        numRows = model->rowCount();\n    }\n\n    \/\/ Header row\n    for(int i=0; i<columns.size(); ++i)\n    {\n        if(i!=0)\n        {\n            writeSep(out);\n        }\n        writeValue(out, columns[i].title);\n    }\n    writeNewline(out);\n\n    \/\/ Data rows\n    for(int j=0; j<numRows; ++j)\n    {\n        for(int i=0; i<columns.size(); ++i)\n        {\n            if(i!=0)\n            {\n                writeSep(out);\n            }\n            QVariant data = model->index(j, columns[i].column).data(columns[i].role);\n            writeValue(out, data.toString());\n        }\n        writeNewline(out);\n    }\n\n    file.close();\n\n    return file.error() == QFile::NoError;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011-2014 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 \"lookupspdialog.h\"\n#include \"ui_lookupspdialog.h\"\n\n#include \"guiutil.h\"\n#include \"optionsmodel.h\"\n#include \"walletmodel.h\"\n#include \"wallet.h\"\n#include \"base58.h\"\n#include \"ui_interface.h\"\n\n#include <boost\/filesystem.hpp>\n\n#include \"leveldb\/db.h\"\n#include \"leveldb\/write_batch.h\"\n\n\/\/ potentially overzealous includes here\n#include \"base58.h\"\n#include \"rpcserver.h\"\n#include \"init.h\"\n#include \"util.h\"\n#include <fstream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <string>\n#include <boost\/assign\/list_of.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/algorithm\/string\/find.hpp>\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/format.hpp>\n#include <boost\/filesystem.hpp>\n#include \"json\/json_spirit_utils.h\"\n#include \"json\/json_spirit_value.h\"\n#include \"leveldb\/db.h\"\n#include \"leveldb\/write_batch.h\"\n\/\/ end potentially overzealous includes\n\nusing namespace json_spirit;\n#include \"mastercore.h\"\nusing namespace mastercore;\n\n\/\/ potentially overzealous using here\nusing namespace std;\nusing namespace boost;\nusing namespace boost::assign;\nusing namespace leveldb;\n\/\/ end potentially overzealous using\n\n#include \"mastercore_dex.h\"\n#include \"mastercore_tx.h\"\n#include \"mastercore_sp.h\"\n\n#include <QMessageBox>\n#include <QScrollBar>\n#include <QTextDocument>\n#include <QDateTime>\n\nLookupSPDialog::LookupSPDialog(QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::LookupSPDialog),\n    model(0)\n{\n    ui->setupUi(this);\n    this->model = model;\n\n    \/\/ populate placeholder text\n    ui->searchLineEdit->setPlaceholderText(\"ID, name or issuer\");\n\n    \/\/ connect actions\n    connect(ui->matchingComboBox, SIGNAL(activated(int)), this, SLOT(matchingComboBoxChanged(int)));\n    connect(ui->searchButton, SIGNAL(clicked()), this, SLOT(searchButtonClicked()));\n\n    \/\/ hide crowd info\n    ui->desired->setVisible(false);\n    ui->tokensperunit->setVisible(false);\n    ui->deadline->setVisible(false);\n    ui->bonus->setVisible(false);\n    ui->issuerperc->setVisible(false);\n    ui->desiredLabel->setVisible(false);\n    ui->tokensPerUnitLabel->setVisible(false);\n    ui->deadlineLabel->setVisible(false);\n    ui->bonusLabel->setVisible(false);\n    ui->issuerPercLabel->setVisible(false);\n    ui->activeLabel->setVisible(false);\n    ui->active->setText(\"Not applicable.\");\n    ui->topFrame->setVisible(false);\n    ui->leftFrame->setVisible(false);\n    ui->rightFrame->setVisible(false);\n}\n\nvoid LookupSPDialog::searchSP()\n{\n    \/\/ search function to lookup properties, we want this search function to be as capable as possible to\n    \/\/ help users find the property they're looking for via search terms they may want to use\n    int searchParamType = 0;\n    string searchText = ui->searchLineEdit->text().toStdString();\n    unsigned int searchPropertyId = 0;\n\n    \/\/ first let's check if we have a searchText, if not do nothing\n    if (searchText.empty()) return;\n\n    \/\/ try seeing if we have a numerical search string, if so treat it as a property ID search\n    try\n    {\n        searchPropertyId = boost::lexical_cast<int64_t>(searchText);\n        searchParamType = 1; \/\/ search by propertyId\n    }\n    catch(const boost::bad_lexical_cast &e) { }\n    if (searchParamType == 1 && 0 >= searchPropertyId) searchParamType = 0; \/\/ we got a number but it's <=0\n\n    \/\/ next if not positive numerical, lets see if the string is a valid bitcoin address for issuer search\n    if (searchParamType == 0)\n    {\n        CBitcoinAddress address;\n        address.SetString(searchText); \/\/ no null check on searchText required we've already checked it's not empty above\n        if (address.IsValid()) searchParamType = 2; \/\/ search by address;\n    }\n\n    \/\/ if we still don't have a param we'll search against free text in the name\n    if (searchParamType == 0) searchParamType = 3; \/\/ search by free text\n\n    \/\/ clear matching results combo\n    ui->matchingComboBox->clear();\n    bool spExists;\n    unsigned int tmpPropertyId;\n    unsigned int nextSPID;\n    unsigned int nextTestSPID;\n    unsigned int propertyId;\n    QString strId;\n    switch(searchParamType)\n    {\n        case 1: \/\/search by property Id\n           \/\/ convert search string to ID\n           strId = QString::fromStdString(searchText);\n           propertyId = strId.toUInt();\n           \/\/ check if this property ID exists, if not no match to populate and just return\n           spExists = _my_sps->hasSP(propertyId);\n           if (spExists)\n           {\n               addSPToMatchingResults(propertyId);\n               updateDisplayedProperty(); \/\/show straight away, only one to select\n           }\n           else\n           {\n               return;\n           }\n        break;\n        case 2: \/\/search by address\n           \/\/ iterate through my_sps looking for the issuer address and add any properties issued by said address to matchingcombo\n           \/\/ talk with @Michael @Bart to see if perhaps a more efficient way to do this, but not major issue as only run on user request\n           nextSPID = _my_sps->peekNextSPID(1);\n           nextTestSPID = _my_sps->peekNextSPID(2);\n           for (tmpPropertyId = 1; tmpPropertyId<nextSPID; tmpPropertyId++)\n           {\n               CMPSPInfo::Entry sp;\n               if (false != _my_sps->getSP(tmpPropertyId, sp))\n               {\n                   if (sp.issuer == searchText)\n                   {\n                       addSPToMatchingResults(tmpPropertyId);\n                   }\n               }\n           }\n           for (tmpPropertyId = TEST_ECO_PROPERTY_1; tmpPropertyId<nextTestSPID; tmpPropertyId++)\n           {\n               CMPSPInfo::Entry sp;\n               if (false != _my_sps->getSP(tmpPropertyId, sp))\n               {\n                   if (sp.issuer == searchText)\n                   {\n                       addSPToMatchingResults(tmpPropertyId);\n                   }\n               }\n           }\n        break;\n        case 3: \/\/search by freetext\n           \/\/ iterate through my_sps and see if property name contains the search text\n           nextSPID = _my_sps->peekNextSPID(1);\n           nextTestSPID = _my_sps->peekNextSPID(2);\n           for (tmpPropertyId = 1; tmpPropertyId<nextSPID; tmpPropertyId++)\n           {\n               CMPSPInfo::Entry sp;\n               if (false != _my_sps->getSP(tmpPropertyId, sp))\n               {\n                   \/\/ make the search case insensitive\n                   string lowerName = sp.name;\n                   std::transform(lowerName.begin(), lowerName.end(), lowerName.begin(), ::tolower);\n                   string lowerSearch = searchText;\n                   std::transform(lowerSearch.begin(), lowerSearch.end(), lowerSearch.begin(), ::tolower);\n                   size_t loc = lowerName.find(lowerSearch);\n                   if (loc!=std::string::npos)\n                   {\n                       addSPToMatchingResults(tmpPropertyId);\n                   }\n               }\n           }\n           for (tmpPropertyId = TEST_ECO_PROPERTY_1; tmpPropertyId<nextTestSPID; tmpPropertyId++)\n           {\n               CMPSPInfo::Entry sp;\n               if (false != _my_sps->getSP(tmpPropertyId, sp))\n               {\n                   \/\/ make the search case insensitive\n                   string lowerName = sp.name;\n                   std::transform(lowerName.begin(), lowerName.end(), lowerName.begin(), ::tolower);\n                   string lowerSearch = searchText;\n                   std::transform(lowerSearch.begin(), lowerSearch.end(), lowerSearch.begin(), ::tolower);\n                   size_t loc = lowerName.find(lowerSearch);\n                   if (loc!=std::string::npos)\n                   {\n                       addSPToMatchingResults(tmpPropertyId);\n                   }\n               }\n           }\n        break;\n    }\n\n}\n\nvoid LookupSPDialog::addSPToMatchingResults(unsigned int propertyId)\n{\n    \/\/ verify the supplied property exists (sanity check) then populate the matching results combo box\n    bool spExists = _my_sps->hasSP(propertyId);\n    if (spExists)\n    {\n        string spName;\n        spName = getPropertyName(propertyId).c_str();\n        if(spName.size()>50) spName=spName.substr(0,50)+\"...\";\n        string spId = static_cast<ostringstream*>( &(ostringstream() << propertyId) )->str();\n        spName += \" (#\" + spId + \")\";\n        ui->matchingComboBox->addItem(spName.c_str(),spId.c_str());\n    }\n    else\n    {\n        return;\n    }\n}\n\nvoid LookupSPDialog::updateDisplayedProperty()\n{\n    QString strId = ui->matchingComboBox->itemData(ui->matchingComboBox->currentIndex()).toString();\n    \/\/ protect against an empty matchedComboBox\n    if (strId.toStdString().empty()) return;\n\n    \/\/ map property Id\n    unsigned int propertyId = strId.toUInt();\n    CMPSPInfo::Entry sp;\n    if (false == _my_sps->getSP(propertyId, sp)) { return; } \/\/ something has gone wrong, don't attempt to display non-existent property\n\n    \/\/ populate the fields\n    bool divisible=sp.isDivisible();\n    if (divisible) { ui->divisibleLabel->setText(\"Yes\"); } else { ui->divisibleLabel->setText(\"No\"); }\n    if (propertyId>2147483647) { ui->ecosystemLabel->setText(\"Test\"); } else { ui->ecosystemLabel->setText(\"Production\"); }\n    ui->propertyIDLabel->setText(QString::fromStdString(FormatIndivisibleMP(propertyId)));\n    ui->nameLabel->setText(QString::fromStdString(sp.name));\n    ui->categoryLabel->setText(QString::fromStdString(sp.category + \" > \" + sp.subcategory));\n    ui->dataLabel->setText(QString::fromStdString(sp.data));\n    ui->urlLabel->setText(QString::fromStdString(sp.url));\n    string strTotalTokens;\n    string strWalletTokens;\n    int64_t totalTokens = getTotalTokens(propertyId);\n    int64_t walletTokens = 0;\n    if (propertyId<2147483648)\n    { walletTokens = global_balance_money_maineco[propertyId]; }\n    else\n    { walletTokens = global_balance_money_testeco[propertyId-2147483647]; }\n    string tokenLabel;\n    if (propertyId > 2)\n    {\n       tokenLabel = \" SPT\";\n    }\n    else\n    {\n       if (propertyId == 1) { tokenLabel = \" MSC\"; } else { tokenLabel = \" TMSC\"; }\n    }\n    if (divisible) { strTotalTokens = FormatDivisibleMP(totalTokens); } else { strTotalTokens = FormatIndivisibleMP(totalTokens); }\n    if (divisible) { strWalletTokens = FormatDivisibleMP(walletTokens); } else { strWalletTokens = FormatIndivisibleMP(walletTokens); }\n    ui->totalTokensLabel->setText(QString::fromStdString(strTotalTokens + tokenLabel));\n    ui->walletBalanceLabel->setText(QString::fromStdString(strWalletTokens + tokenLabel));\n    ui->issuerLabel->setText(QString::fromStdString(sp.issuer));\n    bool fixedIssuance = sp.fixed;\n    bool manualIssuance = sp.manual;\n    if ((!fixedIssuance) && (!manualIssuance) && (propertyId > 2))\n    {\n        ui->issuanceTypeLabel->setText(\"Crowdsale\");\n        \/\/ obtain crowdinfo\n        bool active = isCrowdsaleActive(propertyId);\n        int64_t deadline = sp.deadline;\n        uint8_t earlyBonus = sp.early_bird;\n        uint8_t percentToIssuer = sp.percentage;\n        int64_t tokensPerUnit = sp.num_tokens;\n        int64_t propertyIdDesired = sp.property_desired;\n        QDateTime qDeadline;\n        qDeadline.setTime_t(deadline);\n        string desiredText = getPropertyName(propertyIdDesired).c_str();\n        if(desiredText.size()>22) desiredText=desiredText.substr(0,22)+\"...\";\n        string spId = static_cast<ostringstream*>( &(ostringstream() << propertyIdDesired) )->str();\n        desiredText += \" (#\" + spId + \")\";\n        string tokensPerUnitText;\n        if (divisible) { tokensPerUnitText = FormatDivisibleMP(tokensPerUnit); } else { tokensPerUnitText = FormatIndivisibleMP(tokensPerUnit); }\n        if (active) { ui->activeLabel->setText(\"Yes\"); } else { ui->activeLabel->setText(\"No\"); }\n        \/\/ populate crowdinfo\n        ui->desiredLabel->setText(QString::fromStdString(desiredText));\n        ui->tokensPerUnitLabel->setText(QString::fromStdString(tokensPerUnitText));\n        ui->deadlineLabel->setText(qDeadline.toString(Qt::SystemLocaleShortDate));\n        ui->bonusLabel->setText(QString::fromStdString(FormatIndivisibleMP((int64_t)earlyBonus) + \"%\"));\n        ui->issuerPercLabel->setText(QString::fromStdString(FormatIndivisibleMP((int64_t)percentToIssuer) + \"%\"));\n        \/\/ show crowdinfo\n        ui->desired->setVisible(true);\n        ui->tokensperunit->setVisible(true);\n        ui->deadline->setVisible(true);\n        ui->bonus->setVisible(true);\n        ui->issuerperc->setVisible(true);\n        ui->desiredLabel->setVisible(true);\n        ui->tokensPerUnitLabel->setVisible(true);\n        ui->deadlineLabel->setVisible(true);\n        ui->bonusLabel->setVisible(true);\n        ui->issuerPercLabel->setVisible(true);\n        ui->activeLabel->setVisible(true);\n        ui->active->setText(\"Active:\");\n    }\n    else\n    {\n        ui->issuanceTypeLabel->setText(\"Exodus\");\n        if (fixedIssuance) ui->issuanceTypeLabel->setText(\"Fixed\");\n        if (manualIssuance) ui->issuanceTypeLabel->setText(\"Manual\");\n        \/\/ hide crowdinfo\n        ui->desired->setVisible(false);\n        ui->tokensperunit->setVisible(false);\n        ui->deadline->setVisible(false);\n        ui->bonus->setVisible(false);\n        ui->issuerperc->setVisible(false);\n        ui->desiredLabel->setVisible(false);\n        ui->tokensPerUnitLabel->setVisible(false);\n        ui->deadlineLabel->setVisible(false);\n        ui->bonusLabel->setVisible(false);\n        ui->issuerPercLabel->setVisible(false);\n        ui->activeLabel->setVisible(false);\n        ui->active->setText(\"Not applicable.\");\n    }\n    ui->topFrame->setVisible(true);\n    ui->leftFrame->setVisible(true);\n    ui->rightFrame->setVisible(true);\n}\n\nvoid LookupSPDialog::searchButtonClicked()\n{\n    searchSP();\n}\n\nvoid LookupSPDialog::matchingComboBoxChanged(int idx)\n{\n    updateDisplayedProperty();\n}\n<commit_msg>Fix ecosystem display on property lookup<commit_after>\/\/ Copyright (c) 2011-2014 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 \"lookupspdialog.h\"\n#include \"ui_lookupspdialog.h\"\n\n#include \"guiutil.h\"\n#include \"optionsmodel.h\"\n#include \"walletmodel.h\"\n#include \"wallet.h\"\n#include \"base58.h\"\n#include \"ui_interface.h\"\n\n#include <boost\/filesystem.hpp>\n\n#include \"leveldb\/db.h\"\n#include \"leveldb\/write_batch.h\"\n\n\/\/ potentially overzealous includes here\n#include \"base58.h\"\n#include \"rpcserver.h\"\n#include \"init.h\"\n#include \"util.h\"\n#include <fstream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <string>\n#include <boost\/assign\/list_of.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/algorithm\/string\/find.hpp>\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/format.hpp>\n#include <boost\/filesystem.hpp>\n#include \"json\/json_spirit_utils.h\"\n#include \"json\/json_spirit_value.h\"\n#include \"leveldb\/db.h\"\n#include \"leveldb\/write_batch.h\"\n\/\/ end potentially overzealous includes\n\nusing namespace json_spirit;\n#include \"mastercore.h\"\nusing namespace mastercore;\n\n\/\/ potentially overzealous using here\nusing namespace std;\nusing namespace boost;\nusing namespace boost::assign;\nusing namespace leveldb;\n\/\/ end potentially overzealous using\n\n#include \"mastercore_dex.h\"\n#include \"mastercore_tx.h\"\n#include \"mastercore_sp.h\"\n\n#include <QMessageBox>\n#include <QScrollBar>\n#include <QTextDocument>\n#include <QDateTime>\n\nLookupSPDialog::LookupSPDialog(QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::LookupSPDialog),\n    model(0)\n{\n    ui->setupUi(this);\n    this->model = model;\n\n    \/\/ populate placeholder text\n    ui->searchLineEdit->setPlaceholderText(\"ID, name or issuer\");\n\n    \/\/ connect actions\n    connect(ui->matchingComboBox, SIGNAL(activated(int)), this, SLOT(matchingComboBoxChanged(int)));\n    connect(ui->searchButton, SIGNAL(clicked()), this, SLOT(searchButtonClicked()));\n\n    \/\/ hide crowd info\n    ui->desired->setVisible(false);\n    ui->tokensperunit->setVisible(false);\n    ui->deadline->setVisible(false);\n    ui->bonus->setVisible(false);\n    ui->issuerperc->setVisible(false);\n    ui->desiredLabel->setVisible(false);\n    ui->tokensPerUnitLabel->setVisible(false);\n    ui->deadlineLabel->setVisible(false);\n    ui->bonusLabel->setVisible(false);\n    ui->issuerPercLabel->setVisible(false);\n    ui->activeLabel->setVisible(false);\n    ui->active->setText(\"Not applicable.\");\n    ui->topFrame->setVisible(false);\n    ui->leftFrame->setVisible(false);\n    ui->rightFrame->setVisible(false);\n}\n\nvoid LookupSPDialog::searchSP()\n{\n    \/\/ search function to lookup properties, we want this search function to be as capable as possible to\n    \/\/ help users find the property they're looking for via search terms they may want to use\n    int searchParamType = 0;\n    string searchText = ui->searchLineEdit->text().toStdString();\n    unsigned int searchPropertyId = 0;\n\n    \/\/ first let's check if we have a searchText, if not do nothing\n    if (searchText.empty()) return;\n\n    \/\/ try seeing if we have a numerical search string, if so treat it as a property ID search\n    try\n    {\n        searchPropertyId = boost::lexical_cast<int64_t>(searchText);\n        searchParamType = 1; \/\/ search by propertyId\n    }\n    catch(const boost::bad_lexical_cast &e) { }\n    if (searchParamType == 1 && 0 >= searchPropertyId) searchParamType = 0; \/\/ we got a number but it's <=0\n\n    \/\/ next if not positive numerical, lets see if the string is a valid bitcoin address for issuer search\n    if (searchParamType == 0)\n    {\n        CBitcoinAddress address;\n        address.SetString(searchText); \/\/ no null check on searchText required we've already checked it's not empty above\n        if (address.IsValid()) searchParamType = 2; \/\/ search by address;\n    }\n\n    \/\/ if we still don't have a param we'll search against free text in the name\n    if (searchParamType == 0) searchParamType = 3; \/\/ search by free text\n\n    \/\/ clear matching results combo\n    ui->matchingComboBox->clear();\n    bool spExists;\n    unsigned int tmpPropertyId;\n    unsigned int nextSPID;\n    unsigned int nextTestSPID;\n    unsigned int propertyId;\n    QString strId;\n    switch(searchParamType)\n    {\n        case 1: \/\/search by property Id\n           \/\/ convert search string to ID\n           strId = QString::fromStdString(searchText);\n           propertyId = strId.toUInt();\n           \/\/ check if this property ID exists, if not no match to populate and just return\n           spExists = _my_sps->hasSP(propertyId);\n           if (spExists)\n           {\n               addSPToMatchingResults(propertyId);\n               updateDisplayedProperty(); \/\/show straight away, only one to select\n           }\n           else\n           {\n               return;\n           }\n        break;\n        case 2: \/\/search by address\n           \/\/ iterate through my_sps looking for the issuer address and add any properties issued by said address to matchingcombo\n           \/\/ talk with @Michael @Bart to see if perhaps a more efficient way to do this, but not major issue as only run on user request\n           nextSPID = _my_sps->peekNextSPID(1);\n           nextTestSPID = _my_sps->peekNextSPID(2);\n           for (tmpPropertyId = 1; tmpPropertyId<nextSPID; tmpPropertyId++)\n           {\n               CMPSPInfo::Entry sp;\n               if (false != _my_sps->getSP(tmpPropertyId, sp))\n               {\n                   if (sp.issuer == searchText)\n                   {\n                       addSPToMatchingResults(tmpPropertyId);\n                   }\n               }\n           }\n           for (tmpPropertyId = TEST_ECO_PROPERTY_1; tmpPropertyId<nextTestSPID; tmpPropertyId++)\n           {\n               CMPSPInfo::Entry sp;\n               if (false != _my_sps->getSP(tmpPropertyId, sp))\n               {\n                   if (sp.issuer == searchText)\n                   {\n                       addSPToMatchingResults(tmpPropertyId);\n                   }\n               }\n           }\n        break;\n        case 3: \/\/search by freetext\n           \/\/ iterate through my_sps and see if property name contains the search text\n           nextSPID = _my_sps->peekNextSPID(1);\n           nextTestSPID = _my_sps->peekNextSPID(2);\n           for (tmpPropertyId = 1; tmpPropertyId<nextSPID; tmpPropertyId++)\n           {\n               CMPSPInfo::Entry sp;\n               if (false != _my_sps->getSP(tmpPropertyId, sp))\n               {\n                   \/\/ make the search case insensitive\n                   string lowerName = sp.name;\n                   std::transform(lowerName.begin(), lowerName.end(), lowerName.begin(), ::tolower);\n                   string lowerSearch = searchText;\n                   std::transform(lowerSearch.begin(), lowerSearch.end(), lowerSearch.begin(), ::tolower);\n                   size_t loc = lowerName.find(lowerSearch);\n                   if (loc!=std::string::npos)\n                   {\n                       addSPToMatchingResults(tmpPropertyId);\n                   }\n               }\n           }\n           for (tmpPropertyId = TEST_ECO_PROPERTY_1; tmpPropertyId<nextTestSPID; tmpPropertyId++)\n           {\n               CMPSPInfo::Entry sp;\n               if (false != _my_sps->getSP(tmpPropertyId, sp))\n               {\n                   \/\/ make the search case insensitive\n                   string lowerName = sp.name;\n                   std::transform(lowerName.begin(), lowerName.end(), lowerName.begin(), ::tolower);\n                   string lowerSearch = searchText;\n                   std::transform(lowerSearch.begin(), lowerSearch.end(), lowerSearch.begin(), ::tolower);\n                   size_t loc = lowerName.find(lowerSearch);\n                   if (loc!=std::string::npos)\n                   {\n                       addSPToMatchingResults(tmpPropertyId);\n                   }\n               }\n           }\n        break;\n    }\n\n}\n\nvoid LookupSPDialog::addSPToMatchingResults(unsigned int propertyId)\n{\n    \/\/ verify the supplied property exists (sanity check) then populate the matching results combo box\n    bool spExists = _my_sps->hasSP(propertyId);\n    if (spExists)\n    {\n        string spName;\n        spName = getPropertyName(propertyId).c_str();\n        if(spName.size()>50) spName=spName.substr(0,50)+\"...\";\n        string spId = static_cast<ostringstream*>( &(ostringstream() << propertyId) )->str();\n        spName += \" (#\" + spId + \")\";\n        ui->matchingComboBox->addItem(spName.c_str(),spId.c_str());\n    }\n    else\n    {\n        return;\n    }\n}\n\nvoid LookupSPDialog::updateDisplayedProperty()\n{\n    QString strId = ui->matchingComboBox->itemData(ui->matchingComboBox->currentIndex()).toString();\n    \/\/ protect against an empty matchedComboBox\n    if (strId.toStdString().empty()) return;\n\n    \/\/ map property Id\n    unsigned int propertyId = strId.toUInt();\n    CMPSPInfo::Entry sp;\n    if (false == _my_sps->getSP(propertyId, sp)) { return; } \/\/ something has gone wrong, don't attempt to display non-existent property\n\n    \/\/ populate the fields\n    bool divisible=sp.isDivisible();\n    if (divisible) { ui->divisibleLabel->setText(\"Yes\"); } else { ui->divisibleLabel->setText(\"No\"); }\n    if (isTestEcosystemProperty(propertyId)) { ui->ecosystemLabel->setText(\"Test\"); } else { ui->ecosystemLabel->setText(\"Production\"); }\n    ui->propertyIDLabel->setText(QString::fromStdString(FormatIndivisibleMP(propertyId)));\n    ui->nameLabel->setText(QString::fromStdString(sp.name));\n    ui->categoryLabel->setText(QString::fromStdString(sp.category + \" > \" + sp.subcategory));\n    ui->dataLabel->setText(QString::fromStdString(sp.data));\n    ui->urlLabel->setText(QString::fromStdString(sp.url));\n    string strTotalTokens;\n    string strWalletTokens;\n    int64_t totalTokens = getTotalTokens(propertyId);\n    int64_t walletTokens = 0;\n    if (propertyId<2147483648)\n    { walletTokens = global_balance_money_maineco[propertyId]; }\n    else\n    { walletTokens = global_balance_money_testeco[propertyId-2147483647]; }\n    string tokenLabel;\n    if (propertyId > 2)\n    {\n       tokenLabel = \" SPT\";\n    }\n    else\n    {\n       if (propertyId == 1) { tokenLabel = \" MSC\"; } else { tokenLabel = \" TMSC\"; }\n    }\n    if (divisible) { strTotalTokens = FormatDivisibleMP(totalTokens); } else { strTotalTokens = FormatIndivisibleMP(totalTokens); }\n    if (divisible) { strWalletTokens = FormatDivisibleMP(walletTokens); } else { strWalletTokens = FormatIndivisibleMP(walletTokens); }\n    ui->totalTokensLabel->setText(QString::fromStdString(strTotalTokens + tokenLabel));\n    ui->walletBalanceLabel->setText(QString::fromStdString(strWalletTokens + tokenLabel));\n    ui->issuerLabel->setText(QString::fromStdString(sp.issuer));\n    bool fixedIssuance = sp.fixed;\n    bool manualIssuance = sp.manual;\n    if ((!fixedIssuance) && (!manualIssuance) && (propertyId > 2))\n    {\n        ui->issuanceTypeLabel->setText(\"Crowdsale\");\n        \/\/ obtain crowdinfo\n        bool active = isCrowdsaleActive(propertyId);\n        int64_t deadline = sp.deadline;\n        uint8_t earlyBonus = sp.early_bird;\n        uint8_t percentToIssuer = sp.percentage;\n        int64_t tokensPerUnit = sp.num_tokens;\n        int64_t propertyIdDesired = sp.property_desired;\n        QDateTime qDeadline;\n        qDeadline.setTime_t(deadline);\n        string desiredText = getPropertyName(propertyIdDesired).c_str();\n        if(desiredText.size()>22) desiredText=desiredText.substr(0,22)+\"...\";\n        string spId = static_cast<ostringstream*>( &(ostringstream() << propertyIdDesired) )->str();\n        desiredText += \" (#\" + spId + \")\";\n        string tokensPerUnitText;\n        if (divisible) { tokensPerUnitText = FormatDivisibleMP(tokensPerUnit); } else { tokensPerUnitText = FormatIndivisibleMP(tokensPerUnit); }\n        if (active) { ui->activeLabel->setText(\"Yes\"); } else { ui->activeLabel->setText(\"No\"); }\n        \/\/ populate crowdinfo\n        ui->desiredLabel->setText(QString::fromStdString(desiredText));\n        ui->tokensPerUnitLabel->setText(QString::fromStdString(tokensPerUnitText));\n        ui->deadlineLabel->setText(qDeadline.toString(Qt::SystemLocaleShortDate));\n        ui->bonusLabel->setText(QString::fromStdString(FormatIndivisibleMP((int64_t)earlyBonus) + \"%\"));\n        ui->issuerPercLabel->setText(QString::fromStdString(FormatIndivisibleMP((int64_t)percentToIssuer) + \"%\"));\n        \/\/ show crowdinfo\n        ui->desired->setVisible(true);\n        ui->tokensperunit->setVisible(true);\n        ui->deadline->setVisible(true);\n        ui->bonus->setVisible(true);\n        ui->issuerperc->setVisible(true);\n        ui->desiredLabel->setVisible(true);\n        ui->tokensPerUnitLabel->setVisible(true);\n        ui->deadlineLabel->setVisible(true);\n        ui->bonusLabel->setVisible(true);\n        ui->issuerPercLabel->setVisible(true);\n        ui->activeLabel->setVisible(true);\n        ui->active->setText(\"Active:\");\n    }\n    else\n    {\n        ui->issuanceTypeLabel->setText(\"Exodus\");\n        if (fixedIssuance) ui->issuanceTypeLabel->setText(\"Fixed\");\n        if (manualIssuance) ui->issuanceTypeLabel->setText(\"Manual\");\n        \/\/ hide crowdinfo\n        ui->desired->setVisible(false);\n        ui->tokensperunit->setVisible(false);\n        ui->deadline->setVisible(false);\n        ui->bonus->setVisible(false);\n        ui->issuerperc->setVisible(false);\n        ui->desiredLabel->setVisible(false);\n        ui->tokensPerUnitLabel->setVisible(false);\n        ui->deadlineLabel->setVisible(false);\n        ui->bonusLabel->setVisible(false);\n        ui->issuerPercLabel->setVisible(false);\n        ui->activeLabel->setVisible(false);\n        ui->active->setText(\"Not applicable.\");\n    }\n    ui->topFrame->setVisible(true);\n    ui->leftFrame->setVisible(true);\n    ui->rightFrame->setVisible(true);\n}\n\nvoid LookupSPDialog::searchButtonClicked()\n{\n    searchSP();\n}\n\nvoid LookupSPDialog::matchingComboBoxChanged(int idx)\n{\n    updateDisplayedProperty();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QTest>\r\n#include <QObject>\r\n\r\n#include \"uritests.h\"\r\n\r\n\/\/ This is all you need to run all the tests\r\nint main(int argc, char *argv[])\r\n{\r\n    URITests test1;\r\n    QTest::qExec(&test1);\r\n}\r\n<commit_msg>Return !0 when qt tests fail.<commit_after>#include <QTest>\r\n#include <QObject>\r\n\r\n#include \"uritests.h\"\r\n\r\n\/\/ This is all you need to run all the tests\r\nint main(int argc, char *argv[])\r\n{\r\n    bool fInvalid = false;\r\n\r\n    URITests test1;\r\n    if (QTest::qExec(&test1) != 0)\r\n        fInvalid = true;\r\n\r\n    return fInvalid;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/ConvexHull.h\"\n#include \"cinder\/Rand.h\"\n#include \"cinder\/params\/Params.h\"\n#include \"cinder\/Font.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nclass ConvexHullApp : public App {\n  public:\n\tvoid setup();\n\tvoid makeNewLetter();\n\tvoid mouseDown( MouseEvent event );\t\n\tvoid mouseDrag( MouseEvent event );\n\tvoid update();\n\tvoid draw();\n\n\tbool\t\t\t\tmUsingShape;\n\tvector<vec2>\t\tmPoints;\n\tShape2d\t\t\t\tmShape;\n\n\tPolyLine2f\t\t\tmConvexHull;\n\t\n\tparams::InterfaceGlRef\tmParams;\n};\n\nvoid ConvexHullApp::setup()\n{\n\tmUsingShape = true;\n\tmParams = params::InterfaceGl::create( \"App parameters\", ivec2( 180, 100 ) );\n\tmParams->addParam( \"Use Glyph\", &mUsingShape );\n\tmParams->addButton( \"Clear Points\", [&] { mPoints.clear(); } );\n\t\n\tif( mUsingShape )\n\t\tmakeNewLetter();\n}\n\nvoid ConvexHullApp::makeNewLetter()\n{\n\tFont arial( \"Times\", 512 );\n\tmShape = arial.getGlyphShape( arial.getGlyphChar( '!' + randInt( 92 ) ) );\n\/\/\tmat2 transform = MatrixAffine2f::makeTranslate( vec2( 100, getWindowHeight() - 100 ) );\n\tmShape.transform( translate( mat3(), vec2( 100, getWindowHeight() - 100 ) ) );\n}\n\nvoid ConvexHullApp::update()\n{\n\t\/\/ this should be cached but doesn't matter for this demo\n\tif( mUsingShape )\n\t\tmConvexHull = calcConvexHull( mShape );\n\telse\n\t\tmConvexHull = calcConvexHull( mPoints );\n}\n\nvoid ConvexHullApp::mouseDown( MouseEvent event )\n{\n\tif( mUsingShape )\n\t\tmakeNewLetter();\n\telse\n\t\tmPoints.push_back( event.getPos() );\n}\n\nvoid ConvexHullApp::mouseDrag( MouseEvent event )\n{\n\tif( mUsingShape )\n\t\tmakeNewLetter();\n\telse\n\t\tmPoints.back() = event.getPos();\n}\n\nvoid ConvexHullApp::draw()\n{\n\t\/\/ clear out the window with black\n\tgl::clear( Color( 0, 0, 0 ) );\n\tgl::enableAlphaBlending();\n\n\t\/\/ draw solid convex hull\n\tgl::color( ColorA( 0.8f, 0, 1.0f, 0.2f ) );\n\tgl::drawSolid( mConvexHull );\n\tgl::color( ColorA( 0.8f, 0, 1.0f, 0.8f ) );\n\tgl::draw( mConvexHull );\n\t\n\t\/\/ draw convex hull points\n\tgl::color( Color( 0.0f, 0, 1.0f ) );\n\tfor( auto ptIt = mConvexHull.begin(); ptIt != mConvexHull.end(); ++ptIt ) {\n\t\tgl::drawSolidCircle( *ptIt, 4 );\n\t}\n\t\n\tgl::color( ColorA( 1.0f, 0.8f, 0, 0.6f ) );\n\tif( mUsingShape ) {\n\t\tgl::draw( mShape );\n\t}\n\telse {\n\t\tfor( auto ptIt = mPoints.begin(); ptIt != mPoints.end(); ++ptIt ) {\n\t\t\tgl::drawSolidCircle( *ptIt, 3 );\n\t\t}\n\t}\n\t\t\n\tmParams->draw();\n}\n\nCINDER_APP( ConvexHullApp, RendererGl )<commit_msg>Fixing missing #include in ConvexHull sample<commit_after>#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n#include \"cinder\/ConvexHull.h\"\n#include \"cinder\/Rand.h\"\n#include \"cinder\/params\/Params.h\"\n#include \"cinder\/Font.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nclass ConvexHullApp : public App {\n  public:\n\tvoid setup();\n\tvoid makeNewLetter();\n\tvoid mouseDown( MouseEvent event );\t\n\tvoid mouseDrag( MouseEvent event );\n\tvoid update();\n\tvoid draw();\n\n\tbool\t\t\t\tmUsingShape;\n\tvector<vec2>\t\tmPoints;\n\tShape2d\t\t\t\tmShape;\n\n\tPolyLine2f\t\t\tmConvexHull;\n\t\n\tparams::InterfaceGlRef\tmParams;\n};\n\nvoid ConvexHullApp::setup()\n{\n\tmUsingShape = true;\n\tmParams = params::InterfaceGl::create( \"App parameters\", ivec2( 180, 100 ) );\n\tmParams->addParam( \"Use Glyph\", &mUsingShape );\n\tmParams->addButton( \"Clear Points\", [&] { mPoints.clear(); } );\n\t\n\tif( mUsingShape )\n\t\tmakeNewLetter();\n}\n\nvoid ConvexHullApp::makeNewLetter()\n{\n\tFont arial( \"Times\", 512 );\n\tmShape = arial.getGlyphShape( arial.getGlyphChar( '!' + randInt( 92 ) ) );\n\/\/\tmat2 transform = MatrixAffine2f::makeTranslate( vec2( 100, getWindowHeight() - 100 ) );\n\tmShape.transform( translate( mat3(), vec2( 100, getWindowHeight() - 100 ) ) );\n}\n\nvoid ConvexHullApp::update()\n{\n\t\/\/ this should be cached but doesn't matter for this demo\n\tif( mUsingShape )\n\t\tmConvexHull = calcConvexHull( mShape );\n\telse\n\t\tmConvexHull = calcConvexHull( mPoints );\n}\n\nvoid ConvexHullApp::mouseDown( MouseEvent event )\n{\n\tif( mUsingShape )\n\t\tmakeNewLetter();\n\telse\n\t\tmPoints.push_back( event.getPos() );\n}\n\nvoid ConvexHullApp::mouseDrag( MouseEvent event )\n{\n\tif( mUsingShape )\n\t\tmakeNewLetter();\n\telse\n\t\tmPoints.back() = event.getPos();\n}\n\nvoid ConvexHullApp::draw()\n{\n\t\/\/ clear out the window with black\n\tgl::clear( Color( 0, 0, 0 ) );\n\tgl::enableAlphaBlending();\n\n\t\/\/ draw solid convex hull\n\tgl::color( ColorA( 0.8f, 0, 1.0f, 0.2f ) );\n\tgl::drawSolid( mConvexHull );\n\tgl::color( ColorA( 0.8f, 0, 1.0f, 0.8f ) );\n\tgl::draw( mConvexHull );\n\t\n\t\/\/ draw convex hull points\n\tgl::color( Color( 0.0f, 0, 1.0f ) );\n\tfor( auto ptIt = mConvexHull.begin(); ptIt != mConvexHull.end(); ++ptIt ) {\n\t\tgl::drawSolidCircle( *ptIt, 4 );\n\t}\n\t\n\tgl::color( ColorA( 1.0f, 0.8f, 0, 0.6f ) );\n\tif( mUsingShape ) {\n\t\tgl::draw( mShape );\n\t}\n\telse {\n\t\tfor( auto ptIt = mPoints.begin(); ptIt != mPoints.end(); ++ptIt ) {\n\t\t\tgl::drawSolidCircle( *ptIt, 3 );\n\t\t}\n\t}\n\t\t\n\tmParams->draw();\n}\n\nCINDER_APP( ConvexHullApp, RendererGl )<|endoftext|>"}
{"text":"<commit_before>#include \"planner_modules_pr2\/putdown_modules.h\"\n#include \"planner_modules_pr2\/module_param_cache.h\"\n\/\/#include \"tidyup_utils\/arm_state.h\"\n\/\/#include \"tidyup_utils\/planning_scene_interface.h\"\n#include \"planner_modules_pr2\/tidyup_planning_scene_updater.h\"\n#include \"tidyup_utils\/planning_scene_interface.h\"\n\/\/#include \"tidyup_utils\/transformer.h\"\n#include <ros\/ros.h>\n#include <geometry_msgs\/PoseStamped.h>\n#include <map>\n#include <set>\nusing std::set;\nusing std::map;\n#include <utility>\nusing std::pair; using std::make_pair;\n\/\/#include <boost\/foreach.hpp>\n\/\/#ifdef __CDT_PARSER__\n\/\/#define forEach(a, b) for(a : b)\n\/\/#else\n\/\/#define forEach BOOST_FOREACH\n\/\/#endif\n#include <sys\/times.h>\n\/\/#include <tf\/tf.h>\n\/\/#include <tf\/transform_listener.h>\n#include <arm_navigation_msgs\/ArmNavigationErrorCodes.h>\n#include <arm_navigation_msgs\/convert_messages.h>\n\/\/#include <boost\/tuple\/tuple.hpp>\n\/\/#include <boost\/tuple\/tuple_comparison.hpp>\n#include <tidyup_msgs\/GetPutdownPose.h>\n#include <sstream>\n#include \"tidyup_utils\/stringutil.h\"\n\nVERIFY_CONDITIONCHECKER_DEF(canPutdown);\nVERIFY_APPLYEFFECT_DEF(updatePutdownPose);\n\nstring g_WorldFrame;\nros::NodeHandle* g_NodeHandle = NULL;\nros::ServiceClient g_GetPutdownPose;\n\nModuleParamCacheString paramCache;\nstring separator = \" \";\n\nstring logName;\ngeometry_msgs::Pose defaultAttachPose;\n\n\nvoid putdown_init(int argc, char** argv)\n{\n    ROS_ASSERT(argc == 2);\n    logName = \"[putdownModule]\";\n\n    g_NodeHandle = new ros::NodeHandle();\n    string service_name = \"\/tidyup\/request_putdown_pose\";\n\n    while (!ros::service::waitForService(service_name, ros::Duration(3.0)))\n    {\n        ROS_ERROR(\"%s Service %s not available - waiting.\", logName.c_str(), service_name.c_str());\n    }\n\n    g_GetPutdownPose = g_NodeHandle->serviceClient<tidyup_msgs::GetPutdownPose>(service_name, true);\n    if (!g_GetPutdownPose)\n    {\n        ROS_FATAL(\"%s Could not initialize get putdown service from %s (client name: %s)\", logName.c_str(), service_name.c_str(), g_GetPutdownPose.getService().c_str());\n    }\n\n    \/\/ initialize cache\n    paramCache.initialize(\"putdown\", g_NodeHandle);\n\n    defaultAttachPose.position.x = 0.032;\n    defaultAttachPose.position.y = 0.015;\n    defaultAttachPose.position.z = 0.0;\n    defaultAttachPose.orientation.x = 0.707;\n    defaultAttachPose.orientation.y = -0.106;\n    defaultAttachPose.orientation.z = -0.690;\n    defaultAttachPose.orientation.w = 0.105;\n\n    ROS_INFO(\"%s Initialized Putdown Module.\\n\", logName.c_str());\n}\n\nbool callFindPutdownPoseService(tidyup_msgs::GetPutdownPose & srv)\n{\n    if (!g_GetPutdownPose)\n    {\n        ROS_ERROR(\"%s Persistent service connection to %s failed.\", logName.c_str(), g_GetPutdownPose.getService().c_str());\n        \/\/ FIXME reconnect - this shouldn't happen.\n        return false;\n    }\n\n    \/\/ statistics about using the ros service\n    static double plannerCalls = 0;\n    static ros::Duration totalCallsTime = ros::Duration(0.0);\n    plannerCalls += 1.0;\n    ros::Time callStartTime = ros::Time::now();\n\n    \/\/ perform the actual path planner call\n    if (! g_GetPutdownPose.call(srv))\n    {\n        ROS_ERROR(\"%s Failed to call service %s.\", logName.c_str(), g_GetPutdownPose.getService().c_str());\n        return false;\n    }\n    if (g_Debug)\n    {\n        ros::Time callEndTime = ros::Time::now();\n        ros::Duration dt = callEndTime - callStartTime;\n        totalCallsTime += dt;\n        ROS_DEBUG(\"%s ServiceCall took: %f, avg: %f (num %f).\", logName.c_str(),\n                dt.toSec(), totalCallsTime.toSec()\/plannerCalls, plannerCalls);\n    }\n\/\/\n\/\/    if (srv.response.error_code.val == arm_navigation_msgs::ArmNavigationErrorCodes::SUCCESS)\n\/\/    {\n\/\/        ROS_INFO(\"%s Got a putdown pose.\", logName.c_str());\n\/\/        return true;\n\/\/    }\n\/\/\n\/\/    ROS_WARN(\"%s GetPutdownPose failed. Reason: %s (%d)\", logName.c_str(),\n\/\/            arm_navigation_msgs::armNavigationErrorCodeToString(srv.response.error_code).c_str(),\n\/\/            srv.response.error_code.val);\n    return true;\n}\n\nstring writePoseToString(const geometry_msgs::Pose& pose)\n{\n    std::stringstream stream;\n    stream.precision(3);\n    stream << std::fixed;\n    stream << pose.position.x << separator;\n    stream << pose.position.y << separator;\n    stream << pose.position.z << separator;\n    stream << pose.orientation.x << separator;\n    stream << pose.orientation.y << separator;\n    stream << pose.orientation.z << separator;\n    stream << pose.orientation.w << separator;\n    return stream.str();\n}\n\nbool readPoseFromString(const string cacheValue, geometry_msgs::Pose& pose)\n{\n    std::stringstream stream;\n    stream << cacheValue;\n    vector<double> coordinates;\n    coordinates.resize(7);\n    for(size_t i = 0; ! stream.eof() && i < coordinates.size(); i++)\n    {\n        stream >> coordinates[i];\n    }\n    if (!stream.good())\n        return false;\n    pose.position.x = coordinates[0];\n    pose.position.y = coordinates[1];\n    pose.position.z = coordinates[2];\n    pose.orientation.x = coordinates[3];\n    pose.orientation.y = coordinates[4];\n    pose.orientation.z = coordinates[5];\n    pose.orientation.w = coordinates[6];\n    return true;\n}\n\nstring createCacheKey(const string& putdownObject,\n        const string& arm,\n        const string& staticObject,\n        const map<string, geometry_msgs::Pose>& movableObjects,\n        const map<string, string>& objectsOnStatic)\n{\n    ROS_DEBUG(\"%s createCacheKey %s %s %s\", logName.c_str(), putdownObject.c_str(), arm.c_str(), staticObject.c_str());\n    std::stringstream stream;\n    stream.precision(3);\n    stream << std::fixed << putdownObject << arm << staticObject;\n    for (map<string, string>::const_iterator objectIt = objectsOnStatic.begin(); objectIt != objectsOnStatic.end(); objectIt++)\n    {\n        ROS_DEBUG(\"%s object %s on %s\", logName.c_str(), objectIt->first.c_str(), objectIt->second.c_str());\n        if (objectIt->second == staticObject)\n        {\n            const geometry_msgs::Pose& pose = movableObjects.find(objectIt->first)->second;\n            stream << pose.position.x;\n            stream << pose.position.y;\n            stream << pose.position.z;\n            stream << pose.orientation.x;\n            stream << pose.orientation.y;\n            stream << pose.orientation.z;\n            stream << pose.orientation.w;\n        }\n    }\n    return stream.str();\n}\n\nbool findPutdownPose(const ParameterList & parameterList,\n        predicateCallbackType predicateCallback,\n        numericalFluentCallbackType numericalFluentCallback,\n        geometry_msgs::Pose& putdown_pose)\n{\n    \/\/ (canPutdown ?o - movable_object ?a - arm ?s - static_object ?g - manipulation_location)\n    ROS_ASSERT(parameterList.size() == 4);\n    Parameter putdown_object = parameterList[0];\n    Parameter arm = parameterList[1];\n    Parameter static_object = parameterList[2];\n    Parameter robot_location = parameterList[3];\n\n    \/\/ read state\n    geometry_msgs::Pose robotPose;\n    map<string, geometry_msgs::Pose> movableObjects;\n    map<string, string> graspedObjects;\n    map<string, string> objectsOnStatic;\n    set<string> openDoors;\n    arm_navigation_msgs::PlanningScene world = PlanningSceneInterface::instance()->getCurrentScene();\n    if (! TidyupPlanningSceneUpdater::readState(robot_location.value, predicateCallback, numericalFluentCallback, robotPose, movableObjects, graspedObjects, objectsOnStatic, openDoors))\n    {\n        ROS_ERROR(\"%s read state failed.\", logName.c_str());\n        return false;\n    }\n\n    tidyup_msgs::GetPutdownPose srv;\n    srv.request.static_object = static_object.value;\n    srv.request.putdown_object = putdown_object.value;\n    srv.request.arm = arm.value;\n    ROS_INFO(\"%s putdown request: %s, %s, %s, %s\", logName.c_str(), parameterList[0].value.c_str(), parameterList[1].value.c_str(), parameterList[2].value.c_str(), parameterList[3].value.c_str());\n\n    string cacheKey = createCacheKey(srv.request.putdown_object, srv.request.arm, srv.request.static_object, movableObjects, objectsOnStatic);\n    ROS_DEBUG(\"%s cacheKey: %s\", logName.c_str(), cacheKey.c_str());\n    \/\/ retrieved cached result\n    string cacheValue;\n    if (paramCache.get(cacheKey, cacheValue))\n    {\n        \/\/ cache hit. either 'impossible' or a valid pose\n        if (cacheValue == \"impossible\")\n        {\n            ROS_DEBUG(\"%s cache hit: impossible\", logName.c_str());\n            return false;\n        }\n        else\n        {\n            if (! readPoseFromString(cacheValue, putdown_pose))\n            {\n                ROS_ERROR(\"%s could not read cached value. cache may be corrupt.\", logName.c_str());\n                return false;\n            }\n            ROS_DEBUG(\"%s cache hit: pose from cache\", logName.c_str());\n            return true;\n        }\n    }\n\n    \/\/ no cache entry, set planning scene\n    PlanningSceneInterface::instance()->resetPlanningScene();\n    ROS_DEBUG(\"%s set planning scene\", logName.c_str());\n    if (! TidyupPlanningSceneUpdater::update(robotPose, movableObjects, graspedObjects, openDoors))\n    {\n        ROS_ERROR(\"%s update planning scene failed.\", logName.c_str());\n        return false;\n    }\n\n    \/\/ call putdown service\n    ROS_INFO(\"%s call putdown service\", logName.c_str());\n    if (! callFindPutdownPoseService(srv))\n    {\n        ROS_ERROR(\"%s service call failed\", logName.c_str());\n        return false;\n    }\n    if (srv.response.error_code.val == srv.response.error_code.PLANNING_FAILED)\n    {\n        ROS_INFO(\"%s service returned: impossible\", logName.c_str());\n        paramCache.set(cacheKey, \"impossible\", true);\n        return false;\n    }\n    if  (srv.response.error_code.val == srv.response.error_code.SUCCESS)\n    {\n        \/\/ insert results into cache\n        ROS_INFO(\"%s service returned: pose found, adding to cache\", logName.c_str());\n        putdown_pose = srv.response.putdown_pose.pose;\n        paramCache.set(cacheKey, writePoseToString(putdown_pose), true);\n        return true;\n    }\n\n    ROS_ERROR(\"%s GetPutdownPose failed. Reason: %s (%d)\", logName.c_str(),\n            arm_navigation_msgs::armNavigationErrorCodeToString(srv.response.error_code).c_str(),\n            srv.response.error_code.val);\n    return false;\n}\n\n\ndouble canPutdown(const ParameterList & parameterList,\n        predicateCallbackType predicateCallback,\n        numericalFluentCallbackType numericalFluentCallback,\n        int relaxed)\n{\n    if (g_Debug)\n    { \/\/ prevent spamming ROS_DEBUG calls unless we really want debug\n        \/\/ debugging raw planner calls\n        static unsigned int calls = 0;\n        calls++;\n        if (calls % 10000 == 0)\n        {\n            ROS_DEBUG(\"%s Got %d putdown module calls.\\n\", logName.c_str(), calls);\n        }\n    }\n\n    geometry_msgs::Pose putdownPose;\n    if (! findPutdownPose(parameterList, predicateCallback, numericalFluentCallback, putdownPose))\n    {\n        return INFINITE_COST;\n    }\n    return 0;\n}\n\nint updatePutdownPose(const ParameterList & parameterList, predicateCallbackType predicateCallback,\n        numericalFluentCallbackType numericalFluentCallback, std::vector<double> & writtenVars)\n{\n    geometry_msgs::Pose putdownPose;\n    if (! findPutdownPose(parameterList, predicateCallback, numericalFluentCallback, putdownPose))\n    {\n        return 1;\n    }\n    \/\/ write the pose to state:\n    writtenVars[0] = putdownPose.position.x;\n    writtenVars[1] = putdownPose.position.y;\n    writtenVars[2] = putdownPose.position.z;\n    writtenVars[3] = putdownPose.orientation.x;\n    writtenVars[4] = putdownPose.orientation.y;\n    writtenVars[5] = putdownPose.orientation.z;\n    writtenVars[6] = putdownPose.orientation.w;\n    return 0;\n}\n\n<commit_msg>compute correct cache keys for param server<commit_after>#include \"planner_modules_pr2\/putdown_modules.h\"\n#include \"planner_modules_pr2\/module_param_cache.h\"\n\/\/#include \"tidyup_utils\/arm_state.h\"\n\/\/#include \"tidyup_utils\/planning_scene_interface.h\"\n#include \"planner_modules_pr2\/tidyup_planning_scene_updater.h\"\n#include \"tidyup_utils\/planning_scene_interface.h\"\n\/\/#include \"tidyup_utils\/transformer.h\"\n#include <ros\/ros.h>\n#include <geometry_msgs\/PoseStamped.h>\n#include <map>\n#include <set>\nusing std::set;\nusing std::map;\n#include <utility>\nusing std::pair; using std::make_pair;\n\/\/#include <boost\/foreach.hpp>\n\/\/#ifdef __CDT_PARSER__\n\/\/#define forEach(a, b) for(a : b)\n\/\/#else\n\/\/#define forEach BOOST_FOREACH\n\/\/#endif\n#include <sys\/times.h>\n\/\/#include <tf\/tf.h>\n\/\/#include <tf\/transform_listener.h>\n#include <arm_navigation_msgs\/ArmNavigationErrorCodes.h>\n#include <arm_navigation_msgs\/convert_messages.h>\n\/\/#include <boost\/tuple\/tuple.hpp>\n\/\/#include <boost\/tuple\/tuple_comparison.hpp>\n#include <tidyup_msgs\/GetPutdownPose.h>\n#include <sstream>\n#include \"tidyup_utils\/stringutil.h\"\n\nVERIFY_CONDITIONCHECKER_DEF(canPutdown);\nVERIFY_APPLYEFFECT_DEF(updatePutdownPose);\n\nstring g_WorldFrame;\nros::NodeHandle* g_NodeHandle = NULL;\nros::ServiceClient g_GetPutdownPose;\n\nModuleParamCacheString paramCache;\nstring separator = \" \";\n\nstring logName;\ngeometry_msgs::Pose defaultAttachPose;\n\n\nvoid putdown_init(int argc, char** argv)\n{\n    ROS_ASSERT(argc == 2);\n    logName = \"[putdownModule]\";\n\n    g_NodeHandle = new ros::NodeHandle();\n    string service_name = \"\/tidyup\/request_putdown_pose\";\n\n    while (!ros::service::waitForService(service_name, ros::Duration(3.0)))\n    {\n        ROS_ERROR(\"%s Service %s not available - waiting.\", logName.c_str(), service_name.c_str());\n    }\n\n    g_GetPutdownPose = g_NodeHandle->serviceClient<tidyup_msgs::GetPutdownPose>(service_name, true);\n    if (!g_GetPutdownPose)\n    {\n        ROS_FATAL(\"%s Could not initialize get putdown service from %s (client name: %s)\", logName.c_str(), service_name.c_str(), g_GetPutdownPose.getService().c_str());\n    }\n\n    \/\/ initialize cache\n    paramCache.initialize(\"putdown\", g_NodeHandle);\n\n    defaultAttachPose.position.x = 0.032;\n    defaultAttachPose.position.y = 0.015;\n    defaultAttachPose.position.z = 0.0;\n    defaultAttachPose.orientation.x = 0.707;\n    defaultAttachPose.orientation.y = -0.106;\n    defaultAttachPose.orientation.z = -0.690;\n    defaultAttachPose.orientation.w = 0.105;\n\n    ROS_INFO(\"%s Initialized Putdown Module.\\n\", logName.c_str());\n}\n\nbool callFindPutdownPoseService(tidyup_msgs::GetPutdownPose & srv)\n{\n    if (!g_GetPutdownPose)\n    {\n        ROS_ERROR(\"%s Persistent service connection to %s failed.\", logName.c_str(), g_GetPutdownPose.getService().c_str());\n        \/\/ FIXME reconnect - this shouldn't happen.\n        return false;\n    }\n\n    \/\/ statistics about using the ros service\n    static double plannerCalls = 0;\n    static ros::Duration totalCallsTime = ros::Duration(0.0);\n    plannerCalls += 1.0;\n    ros::Time callStartTime = ros::Time::now();\n\n    \/\/ perform the actual path planner call\n    if (! g_GetPutdownPose.call(srv))\n    {\n        ROS_ERROR(\"%s Failed to call service %s.\", logName.c_str(), g_GetPutdownPose.getService().c_str());\n        return false;\n    }\n    if (g_Debug)\n    {\n        ros::Time callEndTime = ros::Time::now();\n        ros::Duration dt = callEndTime - callStartTime;\n        totalCallsTime += dt;\n        ROS_DEBUG(\"%s ServiceCall took: %f, avg: %f (num %f).\", logName.c_str(),\n                dt.toSec(), totalCallsTime.toSec()\/plannerCalls, plannerCalls);\n    }\n\/\/\n\/\/    if (srv.response.error_code.val == arm_navigation_msgs::ArmNavigationErrorCodes::SUCCESS)\n\/\/    {\n\/\/        ROS_INFO(\"%s Got a putdown pose.\", logName.c_str());\n\/\/        return true;\n\/\/    }\n\/\/\n\/\/    ROS_WARN(\"%s GetPutdownPose failed. Reason: %s (%d)\", logName.c_str(),\n\/\/            arm_navigation_msgs::armNavigationErrorCodeToString(srv.response.error_code).c_str(),\n\/\/            srv.response.error_code.val);\n    return true;\n}\n\nstring writePoseToString(const geometry_msgs::Pose& pose)\n{\n    std::stringstream stream;\n    stream.precision(0);\n    stream << std::fixed;\n    stream << pose.position.x << separator;\n    stream << pose.position.y << separator;\n    stream << pose.position.z << separator;\n    stream << pose.orientation.x << separator;\n    stream << pose.orientation.y << separator;\n    stream << pose.orientation.z << separator;\n    stream << pose.orientation.w << separator;\n    return stream.str();\n}\n\nbool readPoseFromString(const string cacheValue, geometry_msgs::Pose& pose)\n{\n    std::stringstream stream;\n    stream << cacheValue;\n    vector<double> coordinates;\n    coordinates.resize(7);\n    for(size_t i = 0; ! stream.eof() && i < coordinates.size(); i++)\n    {\n        stream >> coordinates[i];\n    }\n    if (!stream.good())\n        return false;\n    pose.position.x = coordinates[0];\n    pose.position.y = coordinates[1];\n    pose.position.z = coordinates[2];\n    pose.orientation.x = coordinates[3];\n    pose.orientation.y = coordinates[4];\n    pose.orientation.z = coordinates[5];\n    pose.orientation.w = coordinates[6];\n    return true;\n}\n\nstring createCacheKey(const string& putdownObject,\n        const string& arm,\n        const string& staticObject,\n        const map<string, geometry_msgs::Pose>& movableObjects,\n        const map<string, string>& objectsOnStatic)\n{\n    ROS_DEBUG(\"%s createCacheKey %s %s %s\", logName.c_str(), putdownObject.c_str(), arm.c_str(), staticObject.c_str());\n    std::stringstream stream;\n    stream.precision(0);\n    stream << std::fixed << putdownObject << arm << staticObject;\n    for (map<string, string>::const_iterator objectIt = objectsOnStatic.begin(); objectIt != objectsOnStatic.end(); objectIt++)\n    {\n        ROS_DEBUG(\"%s object %s on %s\", logName.c_str(), objectIt->first.c_str(), objectIt->second.c_str());\n        if (objectIt->second == staticObject)\n        {\n            const geometry_msgs::Pose& pose = movableObjects.find(objectIt->first)->second;\n            \/\/ the actual values don't matter as long as they are unique for this object\n            \/\/ cannot use doubles here, as param keys are not allowed to contain '.'\n            if(pose.position.x < 0)\n                stream << \"N\";\n            stream << abs(static_cast<int>(10000.0 * pose.position.x));\n            if(pose.position.y < 0)\n                stream << \"N\";\n            stream << abs(static_cast<int>(10000.0 * pose.position.y));\n            if(pose.position.z < 0)\n                stream << \"N\";\n            stream << abs(static_cast<int>(10000.0 * pose.position.z));\n            if(pose.orientation.x < 0)\n                stream << \"N\";\n            stream << abs(static_cast<int>(10000.0 * pose.orientation.x));\n            if(pose.orientation.y < 0)\n                stream << \"N\";\n            stream << abs(static_cast<int>(10000.0 * pose.orientation.y));\n            if(pose.orientation.z < 0)\n                stream << \"N\";\n            stream << abs(static_cast<int>(10000.0 * pose.orientation.z));\n            if(pose.orientation.w < 0)\n                stream << \"N\";\n            stream << abs(static_cast<int>(10000.0 * pose.orientation.w));\n        }\n    }\n    return stream.str();\n}\n\nbool findPutdownPose(const ParameterList & parameterList,\n        predicateCallbackType predicateCallback,\n        numericalFluentCallbackType numericalFluentCallback,\n        geometry_msgs::Pose& putdown_pose)\n{\n    \/\/ (canPutdown ?o - movable_object ?a - arm ?s - static_object ?g - manipulation_location)\n    ROS_ASSERT(parameterList.size() == 4);\n    Parameter putdown_object = parameterList[0];\n    Parameter arm = parameterList[1];\n    Parameter static_object = parameterList[2];\n    Parameter robot_location = parameterList[3];\n\n    \/\/ read state\n    geometry_msgs::Pose robotPose;\n    map<string, geometry_msgs::Pose> movableObjects;\n    map<string, string> graspedObjects;\n    map<string, string> objectsOnStatic;\n    set<string> openDoors;\n    arm_navigation_msgs::PlanningScene world = PlanningSceneInterface::instance()->getCurrentScene();\n    if (! TidyupPlanningSceneUpdater::readState(robot_location.value, predicateCallback, numericalFluentCallback, robotPose, movableObjects, graspedObjects, objectsOnStatic, openDoors))\n    {\n        ROS_ERROR(\"%s read state failed.\", logName.c_str());\n        return false;\n    }\n\n    tidyup_msgs::GetPutdownPose srv;\n    srv.request.static_object = static_object.value;\n    srv.request.putdown_object = putdown_object.value;\n    srv.request.arm = arm.value;\n    ROS_INFO(\"%s putdown request: %s, %s, %s, %s\", logName.c_str(), parameterList[0].value.c_str(), parameterList[1].value.c_str(), parameterList[2].value.c_str(), parameterList[3].value.c_str());\n\n    string cacheKey = createCacheKey(srv.request.putdown_object, srv.request.arm, srv.request.static_object, movableObjects, objectsOnStatic);\n    ROS_DEBUG(\"%s cacheKey: %s\", logName.c_str(), cacheKey.c_str());\n    \/\/ retrieved cached result\n    string cacheValue;\n    if (paramCache.get(cacheKey, cacheValue))\n    {\n        \/\/ cache hit. either 'impossible' or a valid pose\n        if (cacheValue == \"impossible\")\n        {\n            ROS_DEBUG(\"%s cache hit: impossible\", logName.c_str());\n            return false;\n        }\n        else\n        {\n            if (! readPoseFromString(cacheValue, putdown_pose))\n            {\n                ROS_ERROR(\"%s could not read cached value. cache may be corrupt.\", logName.c_str());\n                return false;\n            }\n            ROS_DEBUG(\"%s cache hit: pose from cache\", logName.c_str());\n            return true;\n        }\n    }\n\n    \/\/ no cache entry, set planning scene\n    PlanningSceneInterface::instance()->resetPlanningScene();\n    ROS_DEBUG(\"%s set planning scene\", logName.c_str());\n    if (! TidyupPlanningSceneUpdater::update(robotPose, movableObjects, graspedObjects, openDoors))\n    {\n        ROS_ERROR(\"%s update planning scene failed.\", logName.c_str());\n        return false;\n    }\n\n    \/\/ call putdown service\n    ROS_INFO(\"%s call putdown service\", logName.c_str());\n    if (! callFindPutdownPoseService(srv))\n    {\n        ROS_ERROR(\"%s service call failed\", logName.c_str());\n        return false;\n    }\n    if (srv.response.error_code.val == srv.response.error_code.PLANNING_FAILED)\n    {\n        ROS_INFO(\"%s service returned: impossible\", logName.c_str());\n        paramCache.set(cacheKey, \"impossible\", true);\n        return false;\n    }\n    if  (srv.response.error_code.val == srv.response.error_code.SUCCESS)\n    {\n        \/\/ insert results into cache\n        ROS_INFO(\"%s service returned: pose found, adding to cache\", logName.c_str());\n        putdown_pose = srv.response.putdown_pose.pose;\n        paramCache.set(cacheKey, writePoseToString(putdown_pose), true);\n        return true;\n    }\n\n    ROS_ERROR(\"%s GetPutdownPose failed. Reason: %s (%d)\", logName.c_str(),\n            arm_navigation_msgs::armNavigationErrorCodeToString(srv.response.error_code).c_str(),\n            srv.response.error_code.val);\n    return false;\n}\n\n\ndouble canPutdown(const ParameterList & parameterList,\n        predicateCallbackType predicateCallback,\n        numericalFluentCallbackType numericalFluentCallback,\n        int relaxed)\n{\n    if (g_Debug)\n    { \/\/ prevent spamming ROS_DEBUG calls unless we really want debug\n        \/\/ debugging raw planner calls\n        static unsigned int calls = 0;\n        calls++;\n        if (calls % 10000 == 0)\n        {\n            ROS_DEBUG(\"%s Got %d putdown module calls.\\n\", logName.c_str(), calls);\n        }\n    }\n\n    geometry_msgs::Pose putdownPose;\n    if (! findPutdownPose(parameterList, predicateCallback, numericalFluentCallback, putdownPose))\n    {\n        return INFINITE_COST;\n    }\n    return 0;\n}\n\nint updatePutdownPose(const ParameterList & parameterList, predicateCallbackType predicateCallback,\n        numericalFluentCallbackType numericalFluentCallback, std::vector<double> & writtenVars)\n{\n    geometry_msgs::Pose putdownPose;\n    if (! findPutdownPose(parameterList, predicateCallback, numericalFluentCallback, putdownPose))\n    {\n        return 1;\n    }\n    \/\/ write the pose to state:\n    writtenVars[0] = putdownPose.position.x;\n    writtenVars[1] = putdownPose.position.y;\n    writtenVars[2] = putdownPose.position.z;\n    writtenVars[3] = putdownPose.orientation.x;\n    writtenVars[4] = putdownPose.orientation.y;\n    writtenVars[5] = putdownPose.orientation.z;\n    writtenVars[6] = putdownPose.orientation.w;\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>saving backface culling<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"branchmodel.h\"\n#include \"gitclient.h\"\n\n#include <QtCore\/QDebug>\n\nenum { debug = 0 };\n\nnamespace Git {\n    namespace Internal {\n\n\/\/ Parse a branch line: \" *name sha description\".  Return  true if it is\n\/\/ the current one\nbool BranchModel::Branch::parse(const QString &lineIn, bool *isCurrent)\n{\n    if (debug)\n        qDebug() << Q_FUNC_INFO << lineIn;\n\n    *isCurrent = lineIn.startsWith(QLatin1String(\"* \"));\n    if (lineIn.size() < 3)\n        return false;\n\n    const QStringList tokens =lineIn.mid(2).split(QLatin1Char(' '), QString::SkipEmptyParts);\n    if (tokens.size() < 2)\n        return false;\n    name = tokens.at(0);\n    currentSHA= tokens.at(1);\n    toolTip.clear();\n    return true;\n}\n\nstatic inline Qt::ItemFlags typeToModelFlags(BranchModel::Type t)\n{\n    Qt::ItemFlags rc = Qt::ItemIsSelectable|Qt::ItemIsEnabled;\n    if (t == BranchModel::BranchModel::LocalBranches)\n        rc |= Qt::ItemIsUserCheckable;\n    return rc;\n}\n\n\/\/ --- BranchModel\nBranchModel::BranchModel(GitClient *client, Type type, QObject *parent) :\n    QAbstractListModel(parent),\n    m_type(type),\n    m_flags(typeToModelFlags(type)),\n    m_client(client),\n    m_currentBranch(-1)\n{\n}\n\nint BranchModel::currentBranch() const\n{\n    return m_currentBranch;\n}\n\nQString BranchModel::branchName(int row) const\n{\n    return m_branches.at(row).name;\n}\n\nint BranchModel::rowCount(const QModelIndex & \/* parent *\/) const\n{\n    return m_branches.size();\n}\n\nQVariant BranchModel::data(const QModelIndex &index, int role) const\n{\n    const int row = index.row();\n    switch (role) {\n        case Qt::DisplayRole:\n        return branchName(row);\n        case Qt::ToolTipRole:\n        if (m_branches.at(row).toolTip.isEmpty())\n            m_branches.at(row).toolTip = toolTip(m_branches.at(row).currentSHA);\n        return m_branches.at(row).toolTip;\n        break;\n        case Qt::CheckStateRole:\n        if (m_type == RemoteBranches)\n            return QVariant();\n        return row == m_currentBranch ? Qt::Checked : Qt::Unchecked;\n        default:\n        break;\n    }\n    return QVariant();\n}\n\nQt::ItemFlags BranchModel::flags(const QModelIndex & \/*index *\/) const\n{\n    return m_flags;\n}\n\nbool BranchModel::refresh(const QString &workingDirectory, QString *errorMessage)\n{\n    \/\/ Run branch command with verbose.\n    QStringList branchArgs(QLatin1String(\"-v\"));\n    QString output;\n    if (m_type == RemoteBranches)\n        branchArgs.push_back(QLatin1String(\"-r\"));\n    if (!m_client->synchronousBranchCmd(workingDirectory, branchArgs, &output, errorMessage))\n        return false;\n    if (debug)\n        qDebug() << Q_FUNC_INFO << workingDirectory << output;\n    \/\/ Parse output\n    m_workingDirectory = workingDirectory;\n    m_branches.clear();\n    m_currentBranch = -1;\n    const QStringList branches = output.split(QLatin1Char('\\n'));\n    const int branchCount = branches.size();\n    bool isCurrent;\n    for (int b = 0; b < branchCount; b++) {\n        Branch newBranch;\n        if (newBranch.parse(branches.at(b), &isCurrent)) {\n            m_branches.push_back(newBranch);\n            if (isCurrent)\n                m_currentBranch = b;\n        }\n    }\n    reset();\n    return true;\n}\n\nQString BranchModel::toolTip(const QString &sha) const\n{\n    \/\/ Show the sha description excluding diff as toolTip\n    QString output;\n    QString errorMessage;\n    if (!m_client->synchronousShow(m_workingDirectory, sha, &output, &errorMessage))\n        return errorMessage;\n    \/\/ Remove 'diff' output\n    const int diffPos = output.indexOf(QLatin1String(\"\\ndiff --\"));\n    if (diffPos != -1)\n        output.remove(diffPos, output.size() - diffPos);\n    return output;\n}\n\n}\n}\n\n<commit_msg>Compile Windows<commit_after>#include \"branchmodel.h\"\n#include \"gitclient.h\"\n\n#include <QtCore\/QDebug>\n\nenum { debug = 0 };\n\nnamespace Git {\n    namespace Internal {\n\n\/\/ Parse a branch line: \" *name sha description\".  Return  true if it is\n\/\/ the current one\nbool BranchModel::Branch::parse(const QString &lineIn, bool *isCurrent)\n{\n    if (debug)\n        qDebug() << Q_FUNC_INFO << lineIn;\n\n    *isCurrent = lineIn.startsWith(QLatin1String(\"* \"));\n    if (lineIn.size() < 3)\n        return false;\n\n    const QStringList tokens =lineIn.mid(2).split(QLatin1Char(' '), QString::SkipEmptyParts);\n    if (tokens.size() < 2)\n        return false;\n    name = tokens.at(0);\n    currentSHA= tokens.at(1);\n    toolTip.clear();\n    return true;\n}\n\nstatic inline Qt::ItemFlags typeToModelFlags(BranchModel::Type t)\n{\n    Qt::ItemFlags rc = Qt::ItemIsSelectable|Qt::ItemIsEnabled;\n    if (t == BranchModel::LocalBranches)\n        rc |= Qt::ItemIsUserCheckable;\n    return rc;\n}\n\n\/\/ --- BranchModel\nBranchModel::BranchModel(GitClient *client, Type type, QObject *parent) :\n    QAbstractListModel(parent),\n    m_type(type),\n    m_flags(typeToModelFlags(type)),\n    m_client(client),\n    m_currentBranch(-1)\n{\n}\n\nint BranchModel::currentBranch() const\n{\n    return m_currentBranch;\n}\n\nQString BranchModel::branchName(int row) const\n{\n    return m_branches.at(row).name;\n}\n\nint BranchModel::rowCount(const QModelIndex & \/* parent *\/) const\n{\n    return m_branches.size();\n}\n\nQVariant BranchModel::data(const QModelIndex &index, int role) const\n{\n    const int row = index.row();\n    switch (role) {\n        case Qt::DisplayRole:\n        return branchName(row);\n        case Qt::ToolTipRole:\n        if (m_branches.at(row).toolTip.isEmpty())\n            m_branches.at(row).toolTip = toolTip(m_branches.at(row).currentSHA);\n        return m_branches.at(row).toolTip;\n        break;\n        case Qt::CheckStateRole:\n        if (m_type == RemoteBranches)\n            return QVariant();\n        return row == m_currentBranch ? Qt::Checked : Qt::Unchecked;\n        default:\n        break;\n    }\n    return QVariant();\n}\n\nQt::ItemFlags BranchModel::flags(const QModelIndex & \/*index *\/) const\n{\n    return m_flags;\n}\n\nbool BranchModel::refresh(const QString &workingDirectory, QString *errorMessage)\n{\n    \/\/ Run branch command with verbose.\n    QStringList branchArgs(QLatin1String(\"-v\"));\n    QString output;\n    if (m_type == RemoteBranches)\n        branchArgs.push_back(QLatin1String(\"-r\"));\n    if (!m_client->synchronousBranchCmd(workingDirectory, branchArgs, &output, errorMessage))\n        return false;\n    if (debug)\n        qDebug() << Q_FUNC_INFO << workingDirectory << output;\n    \/\/ Parse output\n    m_workingDirectory = workingDirectory;\n    m_branches.clear();\n    m_currentBranch = -1;\n    const QStringList branches = output.split(QLatin1Char('\\n'));\n    const int branchCount = branches.size();\n    bool isCurrent;\n    for (int b = 0; b < branchCount; b++) {\n        Branch newBranch;\n        if (newBranch.parse(branches.at(b), &isCurrent)) {\n            m_branches.push_back(newBranch);\n            if (isCurrent)\n                m_currentBranch = b;\n        }\n    }\n    reset();\n    return true;\n}\n\nQString BranchModel::toolTip(const QString &sha) const\n{\n    \/\/ Show the sha description excluding diff as toolTip\n    QString output;\n    QString errorMessage;\n    if (!m_client->synchronousShow(m_workingDirectory, sha, &output, &errorMessage))\n        return errorMessage;\n    \/\/ Remove 'diff' output\n    const int diffPos = output.indexOf(QLatin1String(\"\\ndiff --\"));\n    if (diffPos != -1)\n        output.remove(diffPos, output.size() - diffPos);\n    return output;\n}\n\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/calculates the worthiest pack to go for\n\nvoid worthyPack() {\n    for(int i = 0; i < 4; i++) {    \/\/we ignore small packs, not worth at all\n        getRank(i);\n    }\n    getWorthyPackInfo();\n    setDist();\n}\n\n\n\/\/details about position of the pack\n\nint itemStat(int num) {\n    if(game.itemInZone(num))  \/\/in our zone\n        return 3;\n\n    if(packInTheirZone(num) && game.hasItem(num) == 0)  \/\/in their zone\n        return 4;\n\n    return(game.hasItem(num));  \/\/otherwise,\n}\n\n\n\/\/get rating for each pack based on their status\nvoid getRank(int num) {\n    float target[3];\n    getMyPos();\n    game.getItemLoc(target, num);\n    ranking[num] = 1\/(dist(myPos, target)); \/\/the closer it is, the worthier it gets\n    switch(num){\n        case 0:   \/\/large\n        case 1:\n            ranking[num]*=4.5;\n            break;\n        case 2:   \/\/medium\n        case 3:\n            ranking[num]*=2.5;\n            break;\n    }\n    switch(itemStat(num)){\n        case 0:\n            ranking[num]*=1;  \/\/no special case\n            break;\n        case 4:\n            ranking[num]*=1.75; \/\/in their zone\n            break;\n        default:\n            ranking[num]*=-100; \/\/don't even consider that pack\n            break;\n    }\n}\n\n\n\/\/processes info about packs, determining the worthiest to go for\nvoid getWorthyPackInfo(){\n    targetNumber = 0;\n    float max = ranking[0];\n    for(int i = 0; i < 4; i++){\n        if(ranking[i] > max){\n            targetNumber = i;\n            max = ranking[i];\n        }\n    }\n    game.getItemLoc(actualTarget, targetNumber);\n}\n\n\n\/\/set distances for docks based on our target\nvoid setDist(){\n    switch(targetNumber){\n        case 0:   \/\/large\n        case 1:\n            distFromTarget = .182;   \/\/medium distance\n            distMin = 0.151;\n            distMax = 0.173;  \n            break;\n        case 2: \/\/medium\n        case 3:\n            distFromTarget = .1725;\n            distMin = 0.138;\n            distMax = 0.160;\n            break;\n    }\n}\n<commit_msg>Edited packs page<commit_after>void worthyPack() {\n    for(int i = 0; i < 4; i++) {\n        getRank(i);\n    }\n    getWorthyPackInfo();\n    setDist();\n}\n\n\/*cumulative function to learn which pack is the worthiest*\/\n\nint itemStat(int num) {\n    if(game.itemInZone(num))\n        return 3;\n        \n    if(packInTheirZone(num) && game.hasItem(num) == 0)\n        return 4;\n        \n    return(game.hasItem(num));\n}\n\n\/* we check if the pack is in our or their zone to calculate the real rating of the item*\/\n\nvoid getRank(int num) {\n    float target[3];\n    getMyPos();\n    game.getItemLoc(target, num);\n    ranking[num] = 1\/(dist(myPos, target));\n    switch(num){\n        case 0:   \/\/large\n        case 1:\n            ranking[num]*=4.5;\n            break;\n        case 2:   \/\/medium\n        case 3:\n            ranking[num]*=2.5;\n            break;\n    }\n    switch(itemStat(num)){\n        case 0:\n            ranking[num]*=1;\n            break;\n        case 4:\n            ranking[num]*=1.75;\n            break;\n        default:\n            ranking[num]*=-100;\n            break;\n    }\n}\n\n\/* the rating is based on distance and points\/second that the item gives*\/\n\nvoid getWorthyPackInfo(){\n    targetNumber = 0;\n    float max = ranking[0];\n    for(int i = 0; i < 4; i++){\n        if(ranking[i] > max){\n            targetNumber = i;\n            max = ranking[i];\n        }\n    }\n    game.getItemLoc(actualTarget, targetNumber);\n}\n\n\/*calculates the max valued pack *\/\n\nvoid setDist(){\n    switch(targetNumber){\n        case 0:\n        case 1:\n            \/\/distFromTarget = .182;\n            distFromTarget = .162;\n            distMin = 0.151;\n            distMax = 0.173;\n            break;\n        case 2:\n        case 3:\n            \/\/distFromTarget = .1725;\n            distFromTarget = .143;\n            distMin = 0.138;\n            distMax = 0.160;\n            break;\n    }\n}\n\n\/*set docking distances based on pack. (probably useless with the new functions we're using) *\/<|endoftext|>"}
{"text":"<commit_before>#include \"PrimitiveCreation.h\"\n\n#include \"Sofa_test.h\"\n#include <sofa\/component\/collision\/BarycentricContactMapper.h>\n#include <sofa\/component\/mapping\/BarycentricMapping.h>\n\nnamespace sofa {\n\ntypedef sofa::component::topology::MeshTopology MeshTopology;\ntypedef sofa::simulation::Node::SPtr NodePtr;\ntypedef sofa::component::collision::TriangleModel TriangleModel;\ntypedef sofa::defaulttype::Vec3Types DataTypes;\ntypedef DataTypes::VecCoord VecCoord;\nstruct BaryMapperTest  : public ::testing::Test{\n\n\n    MeshTopology* initMesh(NodePtr & father);\n\n    bool test_inside(double alpha,double beta);\n    bool test_outside(int index);\n    void initTriPts();\n\n    VecCoord triPts;\n    Vector3 norm;\n};\n\nvoid BaryMapperTest::initTriPts(){\n    triPts.resize(3);\n    triPts[0] = Vector3(-1,-1,0);\n    triPts[1] = Vector3(1,-1,0);\n    triPts[2] = Vector3(0,1,0);\n}\n\ndouble tol = 1e-6;\ndouble tol2 = tol*tol;\n\/\/BaryMapperTest::initTriPts();\n\n\/\/Vector3 BaryMapperTest::triPts[] = {Vector3(-1,-1,0),Vector3(1,-1,0),Vector3(0,1,0)};\n\nstatic bool equal(const Vector3 & v0,const Vector3 & v1){\n    return (v0 - v1).norm2() <= tol2;\n}\n\nMeshTopology* BaryMapperTest::initMesh(NodePtr &father){\n    makeTri(triPts[0],triPts[1],triPts[2],Vector3(0,0,0),father);\n    norm = cross(-triPts[0] + triPts[1],triPts[2] - triPts[0]);\n    norm.normalize();\n\n    return father->getTreeObject<MeshTopology>();\n}\n\n\/\/sofa::BaryMapperTest::triPts[0] = Vector3(-1,-1,0);\n\/\/triPts[0];\/\/ = Vector3(-1,-1,0);\n\n\n\n\/\/sofa::defaulttype::Rigid3Types zz;\n\/\/BarycentricMapperMeshTopology(core::topology::BaseMeshTopology* fromTopology,\n\/\/        component::topology::PointSetTopologyContainer* toTopology,\n\/\/        helper::ParticleMask *_maskFrom,\n\/\/        helper::ParticleMask *_maskTo)\n\/\/    : TopologyBarycentricMapper<In,Out>(fromTopology, toTopology),\n\/\/      maskFrom(_maskFrom), maskTo(_maskTo),\n\/\/      matrixJ(NULL), updateJ(true)\n\/\/{\n\/\/}\n\nbool BaryMapperTest::test_inside(double alpha,double beta){\n    initTriPts();\n    sofa::simulation::Node::SPtr father = New<sofa::simulation::tree::GNode>();\n    MeshTopology * topo = initMesh(father);\n    \/\/makeTri()\n    component::mapping::BarycentricMapperMeshTopology<DataTypes, DataTypes>::SPtr mapper = sofa::core::objectmodel::New<component::mapping::BarycentricMapperMeshTopology<DataTypes, DataTypes> >(topo,(component::topology::PointSetTopologyContainer*)0x0,(helper::ParticleMask *)0x0,(helper::ParticleMask *)0x0\/*model->getMeshTopology(), (topology::PointSetTopologyContainer*)NULL, &model->getMechanicalState()->forceMask, &mstate->forceMask*\/);\n\n    Vector3 the_point = (1 - alpha - beta) * triPts[0] + alpha * triPts[1] + beta * triPts[2];\n    Vector3 the_point_trans = the_point + 10.0 * norm;\n    mapper->createPointInTriangle( the_point_trans, 0, &triPts );\n\n    VecCoord res;\n\n    mapper->apply ( res, triPts );\n\n    return equal(the_point,res[0]);\n}\n\n\nbool BaryMapperTest::test_outside(int index){\n    initTriPts();\n    sofa::simulation::Node::SPtr father = New<sofa::simulation::tree::GNode>();\n    MeshTopology * topo = initMesh(father);\n    \/\/makeTri()\n    component::mapping::BarycentricMapperMeshTopology<DataTypes, DataTypes>::SPtr mapper = sofa::core::objectmodel::New<component::mapping::BarycentricMapperMeshTopology<DataTypes, DataTypes> >(topo,(component::topology::PointSetTopologyContainer*)0x0,(helper::ParticleMask *)0x0,(helper::ParticleMask *)0x0\/*model->getMeshTopology(), (topology::PointSetTopologyContainer*)NULL, &model->getMechanicalState()->forceMask, &mstate->forceMask*\/);\n\n    Vector3 the_point = 2.0 * triPts[index] + 10.0 * norm;\n\n    mapper->createPointInTriangle( the_point, 0, &triPts );\n\n    VecCoord res;\n\n    mapper->apply ( res, triPts );\n\n    return equal(triPts[index],res[0]);\n}\n\nTEST_F(BaryMapperTest, alpha0dot3_beta0dot2 ) { ASSERT_TRUE( test_inside(0.3,0.2)); }\nTEST_F(BaryMapperTest, alpha0dot4_beta0dot6 ) { ASSERT_TRUE( test_inside(0.4,0.6)); }\nTEST_F(BaryMapperTest, alpha0_beta0 ) { ASSERT_TRUE( test_inside(0,0)); }\nTEST_F(BaryMapperTest, out_0 ) { ASSERT_TRUE( test_outside(0)); }\nTEST_F(BaryMapperTest, out_1 ) { ASSERT_TRUE( test_outside(1)); }\nTEST_F(BaryMapperTest, out_2 ) { ASSERT_TRUE( test_outside(2)); }\n\n\n}\n\n<commit_msg>r10427\/sofa : Compilation fix number 3<commit_after>#include \"PrimitiveCreation.h\"\n\n#include \"Sofa_test.h\"\n#include <sofa\/component\/collision\/BarycentricContactMapper.h>\n#include <sofa\/component\/mapping\/BarycentricMapping.h>\n\nnamespace sofa {\n\ntypedef sofa::component::topology::MeshTopology MeshTopology;\ntypedef sofa::simulation::Node::SPtr NodePtr;\ntypedef sofa::component::collision::TriangleModel TriangleModel;\ntypedef sofa::defaulttype::Vec3Types DataTypes;\ntypedef DataTypes::VecCoord VecCoord;\nstruct BaryMapperTest  : public ::testing::Test{\n\n\n    MeshTopology* initMesh(NodePtr & father);\n\n    bool test_inside(SReal alpha,SReal beta);\n    bool test_outside(int index);\n    void initTriPts();\n\n    VecCoord triPts;\n    Vector3 norm;\n};\n\nvoid BaryMapperTest::initTriPts(){\n    triPts.resize(3);\n    triPts[0] = Vector3(-1,-1,0);\n    triPts[1] = Vector3(1,-1,0);\n    triPts[2] = Vector3(0,1,0);\n}\n\nSReal tol = 1e-6;\nSReal tol2 = tol*tol;\n\/\/BaryMapperTest::initTriPts();\n\n\/\/Vector3 BaryMapperTest::triPts[] = {Vector3(-1,-1,0),Vector3(1,-1,0),Vector3(0,1,0)};\n\nstatic bool equal(const Vector3 & v0,const Vector3 & v1){\n    return (v0 - v1).norm2() <= tol2;\n}\n\nMeshTopology* BaryMapperTest::initMesh(NodePtr &father){\n    makeTri(triPts[0],triPts[1],triPts[2],Vector3(0,0,0),father);\n    norm = cross(-triPts[0] + triPts[1],triPts[2] - triPts[0]);\n    norm.normalize();\n\n    return father->getTreeObject<MeshTopology>();\n}\n\n\/\/sofa::BaryMapperTest::triPts[0] = Vector3(-1,-1,0);\n\/\/triPts[0];\/\/ = Vector3(-1,-1,0);\n\n\n\n\/\/sofa::defaulttype::Rigid3Types zz;\n\/\/BarycentricMapperMeshTopology(core::topology::BaseMeshTopology* fromTopology,\n\/\/        component::topology::PointSetTopologyContainer* toTopology,\n\/\/        helper::ParticleMask *_maskFrom,\n\/\/        helper::ParticleMask *_maskTo)\n\/\/    : TopologyBarycentricMapper<In,Out>(fromTopology, toTopology),\n\/\/      maskFrom(_maskFrom), maskTo(_maskTo),\n\/\/      matrixJ(NULL), updateJ(true)\n\/\/{\n\/\/}\n\nbool BaryMapperTest::test_inside(SReal alpha,SReal beta){\n    initTriPts();\n    sofa::simulation::Node::SPtr father = New<sofa::simulation::tree::GNode>();\n    MeshTopology * topo = initMesh(father);\n    \/\/makeTri()\n    component::mapping::BarycentricMapperMeshTopology<DataTypes, DataTypes>::SPtr mapper = sofa::core::objectmodel::New<component::mapping::BarycentricMapperMeshTopology<DataTypes, DataTypes> >(topo,(component::topology::PointSetTopologyContainer*)0x0,(helper::ParticleMask *)0x0,(helper::ParticleMask *)0x0\/*model->getMeshTopology(), (topology::PointSetTopologyContainer*)NULL, &model->getMechanicalState()->forceMask, &mstate->forceMask*\/);\n\n    Vector3 the_point = ((SReal)(1.0) - alpha - beta) * triPts[0] + alpha * triPts[1] + beta * triPts[2];\n    Vector3 the_point_trans = the_point + (SReal)(10.0) * norm;\n    mapper->createPointInTriangle( the_point_trans, 0, &triPts );\n\n    VecCoord res;\n\n    mapper->apply ( res, triPts );\n\n    return equal(the_point,res[0]);\n}\n\n\nbool BaryMapperTest::test_outside(int index){\n    initTriPts();\n    sofa::simulation::Node::SPtr father = New<sofa::simulation::tree::GNode>();\n    MeshTopology * topo = initMesh(father);\n    \/\/makeTri()\n    component::mapping::BarycentricMapperMeshTopology<DataTypes, DataTypes>::SPtr mapper = sofa::core::objectmodel::New<component::mapping::BarycentricMapperMeshTopology<DataTypes, DataTypes> >(topo,(component::topology::PointSetTopologyContainer*)0x0,(helper::ParticleMask *)0x0,(helper::ParticleMask *)0x0\/*model->getMeshTopology(), (topology::PointSetTopologyContainer*)NULL, &model->getMechanicalState()->forceMask, &mstate->forceMask*\/);\n\n    Vector3 the_point = (SReal)(2.0) * triPts[index] + (SReal)(10.0) * norm;\n\n    mapper->createPointInTriangle( the_point, 0, &triPts );\n\n    VecCoord res;\n\n    mapper->apply ( res, triPts );\n\n    return equal(triPts[index],res[0]);\n}\n\nTEST_F(BaryMapperTest, alpha0dot3_beta0dot2 ) { ASSERT_TRUE( test_inside((SReal)(0.3),(SReal)(0.2))); }\nTEST_F(BaryMapperTest, alpha0dot4_beta0dot6 ) { ASSERT_TRUE( test_inside((SReal)(0.4),(SReal)(0.6))); }\nTEST_F(BaryMapperTest, alpha0_beta0 ) { ASSERT_TRUE( test_inside((SReal)(0),(SReal)(0))); }\nTEST_F(BaryMapperTest, out_0 ) { ASSERT_TRUE( test_outside(0)); }\nTEST_F(BaryMapperTest, out_1 ) { ASSERT_TRUE( test_outside(1)); }\nTEST_F(BaryMapperTest, out_2 ) { ASSERT_TRUE( test_outside(2)); }\n\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cacheline.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 04: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#include \"cacheline.hxx\"\n\n#ifndef CONFIGMGR_SETNODEACCESS_HXX\n#include \"setnodeaccess.hxx\"\n#endif\n#ifndef CONFIGMGR_TREEACCESSOR_HXX\n#include \"treeaccessor.hxx\"\n#endif\n#ifndef CONFIGMGR_BUILDDATA_HXX\n#include \"builddata.hxx\"\n#endif\n\n#ifndef CONFIGMGR_TREE_CHANGEFACTORY_HXX\n#include \"treechangefactory.hxx\"\n#endif\n#ifndef INCLUDED_CONFIGMGR_MERGECHANGE_HXX\n#include \"mergechange.hxx\"\n#endif\n#ifndef CONFIGMGR_CONFIGEXCEPT_HXX_\n#include \"configexcept.hxx\"\n#endif\n\n#ifndef _CONFIGMGR_TRACER_HXX_\n#include \"tracer.hxx\"\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\nnamespace configmgr\n{\n\/\/ -----------------------------------------------------------------------------\n    static inline CacheLine::Name implExtractModuleName(CacheLine::Path const& _aConfigPath)\n    {\n        return _aConfigPath.getModuleName();\n    }\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ class CacheLine\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\n    CacheLine::CacheLine(Name const & _aModuleName, memory::HeapManager & _rHeapImpl)\n    : m_storage(_rHeapImpl  )\n    , m_base()\n    , m_name(_aModuleName)\n    , m_nDataRefs(0)\n    {\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    CacheLine::CacheLine(Name const & _aModuleName, memory::HeapManager & _rHeapImpl,\n                            memory::SegmentAddress const & _aSegment)\n    : m_storage(_rHeapImpl,_aSegment.id)\n    , m_base( memory::Pointer(_aSegment.base) )\n    , m_name(_aModuleName)\n    , m_nDataRefs(0)\n    {\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    memory::SegmentAddress CacheLine::getDataSegmentAddress() const\n    {\n        memory::SegmentAddress aResult;\n\n        aResult.id      = m_storage.getId();\n        aResult.base    = m_base.addressValue();\n\n        return aResult;\n    }\n\n\/\/ -----------------------------------------------------------------------------\n\n    void CacheLine::setBase(data::TreeAddress _base)\n    {\n        OSL_PRECOND(!m_base.is(), \"CacheLine: Data base address was already set\");\n        OSL_PRECOND(  _base.is(), \"CacheLine: Cannot set NULL base address\");\n        m_base = _base;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    CacheLineRef CacheLine::createAttached( Name const & _aModuleName,\n                                            memory::HeapManager & _rHeapImpl,\n                                            memory::SegmentAddress const & _aSegment\n                                          ) CFG_UNO_THROW_RTE(  )\n    {\n        if (_aModuleName.isEmpty())\n        {\n            OSL_ENSURE(false, \"Cannot make a cache line without a name\");\n            return NULL;\n        }\n        if (_aSegment.isNull())\n        {\n            OSL_ENSURE(false, \"Cannot attach a cache line to a NULL segment\");\n            return NULL;\n        }\n\n        CacheLineRef xResult = new CacheLine(_aModuleName,_rHeapImpl,_aSegment);\n\n        return xResult;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    CacheLineRef CacheLine::createNew(  Name const & _aModuleName,\n                                        memory::HeapManager & _rHeapImpl\n                                      ) CFG_UNO_THROW_RTE(  )\n    {\n        if (_aModuleName.isEmpty())\n        {\n            OSL_ENSURE(false, \"Cannot make a cache line without a name\");\n            return NULL;\n        }\n\n        CacheLineRef xResult = new CacheLine(_aModuleName,_rHeapImpl);\n\n        return xResult;\n    }\n\/\/ -------------------------------------------------------------------------\n\n    CacheLine::Name CacheLine::getModuleName() const\n    {\n        return m_name;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    data::TreeAddress CacheLine::getPartialTree(memory::Accessor const & _aAccessor, Path const& aConfigName) const\n    {\n        data::SetNodeAccess aParentSet( internalGetNode(_aAccessor, aConfigName.getParentPath()) );\n\n        if (aParentSet.isValid())\n            return aParentSet.getElementTree(aConfigName.getLocalName().getName()).address();\n        else\n            return data::TreeAddress();\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    bool CacheLine::hasDefaults(memory::Accessor const & _anAccessor) const\n    {\n        if ( !m_base.is() ) return false; \/\/ cannot get defaults without data\n\n        data::TreeAccessor aModuleTree(_anAccessor, m_base);\n        OSL_ASSERT( aModuleTree.isValid());\n\n        return aModuleTree.data().hasDefaultsAvailable();\n    }\n\/\/ -----------------------------------------------------------------------------\n    data::NodeAccess CacheLine::internalGetNode(memory::Accessor const & _anAccessor, Path const& aConfigName) const\n    {\n        OSL_ENSURE( m_base.is(), \"Cannot get a node from a dataless module\");\n\n        data::TreeAccessor aModuleTree(_anAccessor, m_base);\n        OSL_ASSERT( aModuleTree.isValid());\n\n        data::NodeAccess aNode = aModuleTree.getRootNode().toNodeAccess();\n        OSL_ENSURE( aNode.isValid(), \"CacheLine contains no nodes\");\n\n        Path::Iterator it = aConfigName.begin();\n        OSL_ENSURE( it != aConfigName.end(), \"Empty Path can't match any module\");\n        OSL_ENSURE( aNode.getName() == it->getInternalName(), \"Module part in config path does not match selected CacheLine\");\n\n        \/\/ find child of node\n        \/\/ might be done using a visitor\n        while(aNode.isValid() && ++it != aConfigName.end())\n        {\n            aNode = data::getSubnode(aNode,it->getName());\n        }\n        return aNode;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    data::NodeAddress CacheLine::getNode(memory::Accessor const & _aAccessor, Path const& aConfigName) const\n    {\n        data::NodeAccess aNode = internalGetNode(_aAccessor, aConfigName);\n        return aNode.address();\n    }\n\/\/ -------------------------------------------------------------------------\n\n    data::TreeAddress CacheLine::setComponentData( memory::UpdateAccessor& _aAccessToken,\n                                                           backend::ComponentData const & _aComponentInstance,\n                                                           bool _bWithDefaults\n                                                         ) CFG_UNO_THROW_RTE(  )\n    {\n        OSL_PRECOND(_aComponentInstance.data.get(), \"CacheLine::insertDefaults: inserting NULL defaults !\");\n        OSL_PRECOND(_aComponentInstance.name == this->getModuleName(),\"Data location does not match module\");\n\n        OSL_PRECOND(!base().is(), \"Data is already loaded\");\n\n        if (!base().is()) \/\/ no data yet\n        {\n            this->setBase( data::buildTree(_aAccessToken, _aComponentInstance.data->getName(), *_aComponentInstance.data, _bWithDefaults) );\n        }\n\n        return this->base();\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    data::TreeAddress CacheLine::insertDefaults( memory::UpdateAccessor& _aAccessToken,\n                                                 backend::NodeInstance const & _aDefaultInstance\n                                               ) CFG_UNO_THROW_RTE(  )\n    {\n        OSL_PRECOND(_aDefaultInstance.data().get(), \"CacheLine::insertDefaults: inserting NULL defaults !\");\n        OSL_PRECOND(_aDefaultInstance.root().isModuleRoot(), \"Should have complete component to fill tree with defaults\");\n        OSL_PRECOND(_aDefaultInstance.root().getModuleName() == this->getModuleName(),\"Data location does not match module\");\n\n        OSL_PRECOND(m_base.is(), \"Data must already be loaded to insert defaults\");\n\n        if (m_base.is())\n        {\n            data::mergeDefaults(_aAccessToken,m_base,*_aDefaultInstance.data());\n        }\n\n        return m_base;\n    }\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n\n    ExtendedCacheLine::ExtendedCacheLine(Name const & _aModuleName, memory::HeapManager & _rHeapImpl)\n    : CacheLine(_aModuleName,_rHeapImpl)\n    , m_pPending()\n    {\n    }\n\n\/\/ -----------------------------------------------------------------------------\n\n    ExtendedCacheLine::ExtendedCacheLine(Name const & _aModuleName, memory::HeapManager & _rHeapImpl,\n                                            memory::SegmentAddress const & _aSegment)\n    : CacheLine(_aModuleName,_rHeapImpl,_aSegment)\n    , m_pPending()\n    {\n    }\n\n\/\/ -----------------------------------------------------------------------------\n\n    ExtendedCacheLineRef ExtendedCacheLine::createAttached( Name const & _aModuleName,\n                                                            memory::HeapManager & _rHeapImpl,\n                                                            memory::SegmentAddress const & _aSegment\n                                                          ) CFG_UNO_THROW_RTE(  )\n    {\n        if (_aModuleName.isEmpty())\n        {\n            OSL_ENSURE(false, \"Cannot make a cache line without a name\");\n            return NULL;\n        }\n        if (_aSegment.isNull())\n        {\n            OSL_ENSURE(false, \"Cannot attach a cache line to a NULL segment\");\n            return NULL;\n        }\n\n        ExtendedCacheLineRef xResult = new ExtendedCacheLine(_aModuleName,_rHeapImpl,_aSegment);\n\n        return xResult;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    ExtendedCacheLineRef ExtendedCacheLine::createNew(  Name const & _aModuleName,\n                                                        memory::HeapManager & _rHeapImpl\n                                                      ) CFG_UNO_THROW_RTE(  )\n    {\n        if (_aModuleName.isEmpty())\n        {\n            OSL_ENSURE(false, \"Cannot make a cache line without a name\");\n            return NULL;\n        }\n\n        ExtendedCacheLineRef xResult = new ExtendedCacheLine(_aModuleName,_rHeapImpl);\n\n        return xResult;\n    }\n\/\/ -------------------------------------------------------------------------\n\n    void ExtendedCacheLine::addPending(backend::ConstUpdateInstance const & _anUpdate) CFG_UNO_THROW_RTE(  )\n    {\n        Path aRootLocation = _anUpdate.root().location();\n\n        OSL_PRECOND(!aRootLocation.isRoot(),\"Pending change cannot be located at root\");\n        OSL_PRECOND(aRootLocation.getModuleName() == this->getModuleName(),\"Pending change location does not match module\");\n\n        OSL_PRECOND(_anUpdate.data() != NULL,\"Adding NULL 'pending' change\");\n        OSL_PRECOND(_anUpdate.data()->getNodeName() == aRootLocation.getLocalName().getName().toString(),\n                    \"Path to pending change does not match change name\");\n\n        using std::auto_ptr;\n\n        \/\/ first make the _pSubtreeChange a full tree starting at the module root\n        auto_ptr<SubtreeChange> pRootChange;\n        SubtreeChange *pExistingEntry = NULL;\n\n        Path::Iterator last = aRootLocation.end();\n\n        OSL_ASSERT(last != aRootLocation.begin());\n        --last;\n\n        for (Path::Iterator it = aRootLocation.begin();\n             it != last;\n             ++it)\n        {\n            OSL_ASSERT( it   != aRootLocation.end());\n            OSL_ASSERT( it+1 != aRootLocation.end());\n            \/\/ We need to create a new SubtreeChange\n            Name const aChangeName      = it->getName();\n            Name const aElementTypeName = (it+1)->getTypeName();\n\n            auto_ptr<SubtreeChange> pNewChange =\n                        OTreeChangeFactory::createDummyChange(aChangeName, aElementTypeName);\n\n            if (pExistingEntry == NULL)\n            {\n                OSL_ASSERT(pRootChange.get() == NULL);\n\n                pRootChange     = pNewChange;\n                pExistingEntry  = pRootChange.get();\n            }\n            else\n            {\n                OSL_ASSERT(pRootChange.get() != NULL);\n\n                pExistingEntry->addChange(base_ptr(pNewChange));\n\n                Change* pChange = pExistingEntry->getChange(aChangeName.toString());\n                pExistingEntry = static_cast<SubtreeChange*>(pChange);\n\n                OSL_ENSURE(pChange && pChange->ISA(SubtreeChange), \"ERROR: Cannot recover change just added\");\n            }\n        }\n\n        auto_ptr<SubtreeChange> pAddedChange( new SubtreeChange(*_anUpdate.data(), SubtreeChange::DeepChildCopy()) );\n\n        if (aRootLocation.getDepth() > 1)\n        {\n            OSL_ASSERT(pRootChange.get() != NULL && pExistingEntry != NULL);\n\n            \/\/ the _pSubtreeChange did not start at root, so add its clone to the built dummies\n            pExistingEntry->addChange(base_ptr(pAddedChange));\n        }\n        else\n        {\n            OSL_ASSERT(pRootChange.get() == NULL && pExistingEntry == NULL);\n\n            \/\/ the _pSubtreeChange starts at root, so just reset pRootChange\n            pRootChange = pAddedChange;\n        }\n        OSL_ASSERT(pRootChange.get() != NULL);\n\n        if (m_pPending.get() == NULL)\n        {\n            \/\/ no merge is need, because the existing pending changes are empty\n            m_pPending = pRootChange;\n        }\n        else\n        {\n            try\n            {\n                \/\/ We need to merge the new rebased changes into the m_pPending\n                combineUpdates(*pRootChange,*m_pPending);\n            }\n            catch (configuration::Exception& e)\n            {\n                OUString sMessage(RTL_CONSTASCII_USTRINGPARAM(\"Update cache for module: Could not add pending changes at\"));\n\n                sMessage += aRootLocation.toString();\n\n                sMessage += OUString(RTL_CONSTASCII_USTRINGPARAM(\". Internal Exception:\")) + e.message();\n\n                throw uno::RuntimeException(sMessage,0);\n            }\n        }\n\n        OSL_POSTCOND(m_pPending.get() != NULL, \"Could not insert new pending changes\");\n    }\n\/\/ -----------------------------------------------------------------------------\n\n\n} \/\/ namespace configmgr\n\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.8.60); FILE MERGED 2006\/09\/01 17:20:46 kaib 1.8.60.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cacheline.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 15: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\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_configmgr.hxx\"\n\n#include \"cacheline.hxx\"\n\n#ifndef CONFIGMGR_SETNODEACCESS_HXX\n#include \"setnodeaccess.hxx\"\n#endif\n#ifndef CONFIGMGR_TREEACCESSOR_HXX\n#include \"treeaccessor.hxx\"\n#endif\n#ifndef CONFIGMGR_BUILDDATA_HXX\n#include \"builddata.hxx\"\n#endif\n\n#ifndef CONFIGMGR_TREE_CHANGEFACTORY_HXX\n#include \"treechangefactory.hxx\"\n#endif\n#ifndef INCLUDED_CONFIGMGR_MERGECHANGE_HXX\n#include \"mergechange.hxx\"\n#endif\n#ifndef CONFIGMGR_CONFIGEXCEPT_HXX_\n#include \"configexcept.hxx\"\n#endif\n\n#ifndef _CONFIGMGR_TRACER_HXX_\n#include \"tracer.hxx\"\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\nnamespace configmgr\n{\n\/\/ -----------------------------------------------------------------------------\n    static inline CacheLine::Name implExtractModuleName(CacheLine::Path const& _aConfigPath)\n    {\n        return _aConfigPath.getModuleName();\n    }\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ class CacheLine\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\n    CacheLine::CacheLine(Name const & _aModuleName, memory::HeapManager & _rHeapImpl)\n    : m_storage(_rHeapImpl  )\n    , m_base()\n    , m_name(_aModuleName)\n    , m_nDataRefs(0)\n    {\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    CacheLine::CacheLine(Name const & _aModuleName, memory::HeapManager & _rHeapImpl,\n                            memory::SegmentAddress const & _aSegment)\n    : m_storage(_rHeapImpl,_aSegment.id)\n    , m_base( memory::Pointer(_aSegment.base) )\n    , m_name(_aModuleName)\n    , m_nDataRefs(0)\n    {\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    memory::SegmentAddress CacheLine::getDataSegmentAddress() const\n    {\n        memory::SegmentAddress aResult;\n\n        aResult.id      = m_storage.getId();\n        aResult.base    = m_base.addressValue();\n\n        return aResult;\n    }\n\n\/\/ -----------------------------------------------------------------------------\n\n    void CacheLine::setBase(data::TreeAddress _base)\n    {\n        OSL_PRECOND(!m_base.is(), \"CacheLine: Data base address was already set\");\n        OSL_PRECOND(  _base.is(), \"CacheLine: Cannot set NULL base address\");\n        m_base = _base;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    CacheLineRef CacheLine::createAttached( Name const & _aModuleName,\n                                            memory::HeapManager & _rHeapImpl,\n                                            memory::SegmentAddress const & _aSegment\n                                          ) CFG_UNO_THROW_RTE(  )\n    {\n        if (_aModuleName.isEmpty())\n        {\n            OSL_ENSURE(false, \"Cannot make a cache line without a name\");\n            return NULL;\n        }\n        if (_aSegment.isNull())\n        {\n            OSL_ENSURE(false, \"Cannot attach a cache line to a NULL segment\");\n            return NULL;\n        }\n\n        CacheLineRef xResult = new CacheLine(_aModuleName,_rHeapImpl,_aSegment);\n\n        return xResult;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    CacheLineRef CacheLine::createNew(  Name const & _aModuleName,\n                                        memory::HeapManager & _rHeapImpl\n                                      ) CFG_UNO_THROW_RTE(  )\n    {\n        if (_aModuleName.isEmpty())\n        {\n            OSL_ENSURE(false, \"Cannot make a cache line without a name\");\n            return NULL;\n        }\n\n        CacheLineRef xResult = new CacheLine(_aModuleName,_rHeapImpl);\n\n        return xResult;\n    }\n\/\/ -------------------------------------------------------------------------\n\n    CacheLine::Name CacheLine::getModuleName() const\n    {\n        return m_name;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    data::TreeAddress CacheLine::getPartialTree(memory::Accessor const & _aAccessor, Path const& aConfigName) const\n    {\n        data::SetNodeAccess aParentSet( internalGetNode(_aAccessor, aConfigName.getParentPath()) );\n\n        if (aParentSet.isValid())\n            return aParentSet.getElementTree(aConfigName.getLocalName().getName()).address();\n        else\n            return data::TreeAddress();\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    bool CacheLine::hasDefaults(memory::Accessor const & _anAccessor) const\n    {\n        if ( !m_base.is() ) return false; \/\/ cannot get defaults without data\n\n        data::TreeAccessor aModuleTree(_anAccessor, m_base);\n        OSL_ASSERT( aModuleTree.isValid());\n\n        return aModuleTree.data().hasDefaultsAvailable();\n    }\n\/\/ -----------------------------------------------------------------------------\n    data::NodeAccess CacheLine::internalGetNode(memory::Accessor const & _anAccessor, Path const& aConfigName) const\n    {\n        OSL_ENSURE( m_base.is(), \"Cannot get a node from a dataless module\");\n\n        data::TreeAccessor aModuleTree(_anAccessor, m_base);\n        OSL_ASSERT( aModuleTree.isValid());\n\n        data::NodeAccess aNode = aModuleTree.getRootNode().toNodeAccess();\n        OSL_ENSURE( aNode.isValid(), \"CacheLine contains no nodes\");\n\n        Path::Iterator it = aConfigName.begin();\n        OSL_ENSURE( it != aConfigName.end(), \"Empty Path can't match any module\");\n        OSL_ENSURE( aNode.getName() == it->getInternalName(), \"Module part in config path does not match selected CacheLine\");\n\n        \/\/ find child of node\n        \/\/ might be done using a visitor\n        while(aNode.isValid() && ++it != aConfigName.end())\n        {\n            aNode = data::getSubnode(aNode,it->getName());\n        }\n        return aNode;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    data::NodeAddress CacheLine::getNode(memory::Accessor const & _aAccessor, Path const& aConfigName) const\n    {\n        data::NodeAccess aNode = internalGetNode(_aAccessor, aConfigName);\n        return aNode.address();\n    }\n\/\/ -------------------------------------------------------------------------\n\n    data::TreeAddress CacheLine::setComponentData( memory::UpdateAccessor& _aAccessToken,\n                                                           backend::ComponentData const & _aComponentInstance,\n                                                           bool _bWithDefaults\n                                                         ) CFG_UNO_THROW_RTE(  )\n    {\n        OSL_PRECOND(_aComponentInstance.data.get(), \"CacheLine::insertDefaults: inserting NULL defaults !\");\n        OSL_PRECOND(_aComponentInstance.name == this->getModuleName(),\"Data location does not match module\");\n\n        OSL_PRECOND(!base().is(), \"Data is already loaded\");\n\n        if (!base().is()) \/\/ no data yet\n        {\n            this->setBase( data::buildTree(_aAccessToken, _aComponentInstance.data->getName(), *_aComponentInstance.data, _bWithDefaults) );\n        }\n\n        return this->base();\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    data::TreeAddress CacheLine::insertDefaults( memory::UpdateAccessor& _aAccessToken,\n                                                 backend::NodeInstance const & _aDefaultInstance\n                                               ) CFG_UNO_THROW_RTE(  )\n    {\n        OSL_PRECOND(_aDefaultInstance.data().get(), \"CacheLine::insertDefaults: inserting NULL defaults !\");\n        OSL_PRECOND(_aDefaultInstance.root().isModuleRoot(), \"Should have complete component to fill tree with defaults\");\n        OSL_PRECOND(_aDefaultInstance.root().getModuleName() == this->getModuleName(),\"Data location does not match module\");\n\n        OSL_PRECOND(m_base.is(), \"Data must already be loaded to insert defaults\");\n\n        if (m_base.is())\n        {\n            data::mergeDefaults(_aAccessToken,m_base,*_aDefaultInstance.data());\n        }\n\n        return m_base;\n    }\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n\n    ExtendedCacheLine::ExtendedCacheLine(Name const & _aModuleName, memory::HeapManager & _rHeapImpl)\n    : CacheLine(_aModuleName,_rHeapImpl)\n    , m_pPending()\n    {\n    }\n\n\/\/ -----------------------------------------------------------------------------\n\n    ExtendedCacheLine::ExtendedCacheLine(Name const & _aModuleName, memory::HeapManager & _rHeapImpl,\n                                            memory::SegmentAddress const & _aSegment)\n    : CacheLine(_aModuleName,_rHeapImpl,_aSegment)\n    , m_pPending()\n    {\n    }\n\n\/\/ -----------------------------------------------------------------------------\n\n    ExtendedCacheLineRef ExtendedCacheLine::createAttached( Name const & _aModuleName,\n                                                            memory::HeapManager & _rHeapImpl,\n                                                            memory::SegmentAddress const & _aSegment\n                                                          ) CFG_UNO_THROW_RTE(  )\n    {\n        if (_aModuleName.isEmpty())\n        {\n            OSL_ENSURE(false, \"Cannot make a cache line without a name\");\n            return NULL;\n        }\n        if (_aSegment.isNull())\n        {\n            OSL_ENSURE(false, \"Cannot attach a cache line to a NULL segment\");\n            return NULL;\n        }\n\n        ExtendedCacheLineRef xResult = new ExtendedCacheLine(_aModuleName,_rHeapImpl,_aSegment);\n\n        return xResult;\n    }\n\/\/ -----------------------------------------------------------------------------\n\n    ExtendedCacheLineRef ExtendedCacheLine::createNew(  Name const & _aModuleName,\n                                                        memory::HeapManager & _rHeapImpl\n                                                      ) CFG_UNO_THROW_RTE(  )\n    {\n        if (_aModuleName.isEmpty())\n        {\n            OSL_ENSURE(false, \"Cannot make a cache line without a name\");\n            return NULL;\n        }\n\n        ExtendedCacheLineRef xResult = new ExtendedCacheLine(_aModuleName,_rHeapImpl);\n\n        return xResult;\n    }\n\/\/ -------------------------------------------------------------------------\n\n    void ExtendedCacheLine::addPending(backend::ConstUpdateInstance const & _anUpdate) CFG_UNO_THROW_RTE(  )\n    {\n        Path aRootLocation = _anUpdate.root().location();\n\n        OSL_PRECOND(!aRootLocation.isRoot(),\"Pending change cannot be located at root\");\n        OSL_PRECOND(aRootLocation.getModuleName() == this->getModuleName(),\"Pending change location does not match module\");\n\n        OSL_PRECOND(_anUpdate.data() != NULL,\"Adding NULL 'pending' change\");\n        OSL_PRECOND(_anUpdate.data()->getNodeName() == aRootLocation.getLocalName().getName().toString(),\n                    \"Path to pending change does not match change name\");\n\n        using std::auto_ptr;\n\n        \/\/ first make the _pSubtreeChange a full tree starting at the module root\n        auto_ptr<SubtreeChange> pRootChange;\n        SubtreeChange *pExistingEntry = NULL;\n\n        Path::Iterator last = aRootLocation.end();\n\n        OSL_ASSERT(last != aRootLocation.begin());\n        --last;\n\n        for (Path::Iterator it = aRootLocation.begin();\n             it != last;\n             ++it)\n        {\n            OSL_ASSERT( it   != aRootLocation.end());\n            OSL_ASSERT( it+1 != aRootLocation.end());\n            \/\/ We need to create a new SubtreeChange\n            Name const aChangeName      = it->getName();\n            Name const aElementTypeName = (it+1)->getTypeName();\n\n            auto_ptr<SubtreeChange> pNewChange =\n                        OTreeChangeFactory::createDummyChange(aChangeName, aElementTypeName);\n\n            if (pExistingEntry == NULL)\n            {\n                OSL_ASSERT(pRootChange.get() == NULL);\n\n                pRootChange     = pNewChange;\n                pExistingEntry  = pRootChange.get();\n            }\n            else\n            {\n                OSL_ASSERT(pRootChange.get() != NULL);\n\n                pExistingEntry->addChange(base_ptr(pNewChange));\n\n                Change* pChange = pExistingEntry->getChange(aChangeName.toString());\n                pExistingEntry = static_cast<SubtreeChange*>(pChange);\n\n                OSL_ENSURE(pChange && pChange->ISA(SubtreeChange), \"ERROR: Cannot recover change just added\");\n            }\n        }\n\n        auto_ptr<SubtreeChange> pAddedChange( new SubtreeChange(*_anUpdate.data(), SubtreeChange::DeepChildCopy()) );\n\n        if (aRootLocation.getDepth() > 1)\n        {\n            OSL_ASSERT(pRootChange.get() != NULL && pExistingEntry != NULL);\n\n            \/\/ the _pSubtreeChange did not start at root, so add its clone to the built dummies\n            pExistingEntry->addChange(base_ptr(pAddedChange));\n        }\n        else\n        {\n            OSL_ASSERT(pRootChange.get() == NULL && pExistingEntry == NULL);\n\n            \/\/ the _pSubtreeChange starts at root, so just reset pRootChange\n            pRootChange = pAddedChange;\n        }\n        OSL_ASSERT(pRootChange.get() != NULL);\n\n        if (m_pPending.get() == NULL)\n        {\n            \/\/ no merge is need, because the existing pending changes are empty\n            m_pPending = pRootChange;\n        }\n        else\n        {\n            try\n            {\n                \/\/ We need to merge the new rebased changes into the m_pPending\n                combineUpdates(*pRootChange,*m_pPending);\n            }\n            catch (configuration::Exception& e)\n            {\n                OUString sMessage(RTL_CONSTASCII_USTRINGPARAM(\"Update cache for module: Could not add pending changes at\"));\n\n                sMessage += aRootLocation.toString();\n\n                sMessage += OUString(RTL_CONSTASCII_USTRINGPARAM(\". Internal Exception:\")) + e.message();\n\n                throw uno::RuntimeException(sMessage,0);\n            }\n        }\n\n        OSL_POSTCOND(m_pPending.get() != NULL, \"Could not insert new pending changes\");\n    }\n\/\/ -----------------------------------------------------------------------------\n\n\n} \/\/ namespace configmgr\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright 2012 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 \"shader_writer.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <map>\n#include <memory>\n#include <set>\n#include <stack>\n#include <string>\n#include <sstream>\n#include <vector>\n\n#include <compiler\/complete_type.hpp>\n#include <compiler\/entry_function.hpp>\n#include <compiler\/generic_value.hpp>\n#include <compiler\/function.hpp>\n#include <compiler\/variable.hpp>\n#include <compiler\/semantic_info.hpp>\n#include <compiler\/tokens\/expressions\/expression.hpp>\n#include <compiler\/tokens\/expressions\/postfix_operator.hpp>\n#include <joelang\/context.hpp>\n#include <joelang\/shader.hpp>\n\nnamespace JoeLang\n{\nnamespace Compiler\n{\n\nconst std::string ShaderWriter::s_GLSLVersion = \"150\";\n\nShaderWriter::ShaderWriter( const Context& context )\n    :m_Context( context )\n{\n    m_Shader.setf( std::ios_base::scientific );\n    m_Shader.setf( std::ios_base::boolalpha );\n    m_Shader.setf( std::ios_base::showpoint );\n}\n\nstd::string ShaderWriter::GenerateGLSL( const EntryFunction& entry_function )\n{\n    GenerateShader( entry_function );\n        \n    std::string ret = m_Shader.str();\n\n    \/\/ reset things\n    m_Shader.str(\"\");\n\n    assert( m_Indentation == 0 && \"Unmatched indentations\" );\n\n    \/\/ return an empty string if we've had an error\n    if( m_Good )\n        return ret;\n    else\n        return \"\";\n}\n\nvoid ShaderWriter::PushIndentation()\n{\n    ++m_Indentation;\n}\n\nvoid ShaderWriter::PopIndentation()\n{\n    assert( m_Indentation > 0 && \"Trying to pop 0 indentation\" );\n    --m_Indentation;\n}\n\nstd::string ShaderWriter::Mangle( const std::string& identifier,\n                                  IdentifierType identifier_type )\n{\n    const static std::map<IdentifierType, std::string> prefix_map\n    {\n        { IdentifierType::VARIABLE,    \"_\"  },\n        { IdentifierType::IN_VARYING,  \"i_\"  },\n        { IdentifierType::OUT_VARYING, \"o_\"  },\n        { IdentifierType::FUNCTION,    \"f_\" }\n    };\n    return prefix_map.at(identifier_type) + identifier;\n}\n\nShaderWriter& ShaderWriter::operator << ( const CompleteType& value )\n{\n    value.Write( *this );\n    return *this;\n}\n\nShaderWriter& ShaderWriter::operator << ( const Expression& value )\n{\n    value.Write( *this );\n    return *this;\n}\n\nShaderWriter& ShaderWriter::operator << ( const Statement& value )\n{\n    value.Write( *this );\n    return *this;\n}\n\nShaderWriter& ShaderWriter::operator << ( const GenericValue& value )\n{\n    value.Write( *this );\n    return *this;\n}\n\nvoid ShaderWriter::GenerateShader( const EntryFunction& entry_function )\n{\n    WriteGLSLVersion();\n\n    \/\/\n    \/\/ Get all the functions used by this entry function\n    \/\/\n    std::set<Function_sp> functions = GatherFunctions(\n                                          entry_function.GetFunctionPointer() );\n\n    \/\/\n    \/\/ Get all the variables used by the functions. We're interested in the\n    \/\/ inputs and outputs\n    \/\/\n    std::set<Variable_sp> variables = GatherVariables( functions );\n    std::set<Variable_sp> input_variables;\n    std::set<Variable_sp> output_variables;\n\n    input_variables = WriteInputVaryings( entry_function, variables );\n    NewLine();\n    output_variables = WriteOutputVaryings( entry_function, variables );\n    NewLine();\n\n    WriteGlobalVariables( variables );\n    NewLine();\n\n    WriteFunctionDeclarations( functions );\n    NewLine();\n\n    WriteFunctionDefinitions( functions );\n    NewLine();\n\n    WriteMainFunction( entry_function, input_variables, output_variables );\n}\n\nvoid ShaderWriter::WriteGLSLVersion()\n{\n    m_Shader << \"#version \" << s_GLSLVersion;\n    NewLine(2);\n}\n\nstd::set<Variable_sp> ShaderWriter::WriteInputVaryings(\n                                        const EntryFunction& entry_function,\n                                        const std::set<Variable_sp>& variables )\n{\n    std::set<Variable_sp> input_varyings;\n    std::set<Variable_sp> input_parameters = GatherParameterVariables(\n                                                               entry_function );\n\n    for( const auto& v : variables )\n        \/\/ Ignore the varying specifier if it's on a parameter to a\n        \/\/ non-top-level function\n        if( v->IsVarying() && v->IsIn() && !v->IsParameter() )\n            input_varyings.insert( v );\n\n    for( const auto& v : input_parameters )\n        if( v->IsVarying() && v->IsIn() &&\n            input_varyings.find( v ) == input_varyings.end() )\n        {\n            \/\/ We only care about input varyings here,\n            \/\/ and only about ones which are not used elsewhere\n            \n            \/\/\n            \/\/ If this has a builtin don't write the 'in'\n            \/\/\n            if( !v->GetSemantic().HasBuiltin( entry_function.GetDomain(), \n                                              true ) )\n                *this << \"in \";  \n            \n            \/\/ todo layout information here\n            *this << v->GetType() << \" \" <<\n                     Mangle( v->GetName(), IdentifierType::IN_VARYING ) << \";\";\n            NewLine();\n        }\n\n    for( const auto& v : input_varyings )\n    {\n        \/\/\n        \/\/ if this has a builtin don't write the layout information\n        \/\/\n        if( !v->GetSemantic().HasBuiltin( entry_function.GetDomain(), true ) )\n            *this << \"in \";\n        \n        \/\/ todo layout information here\n        *this << v->GetType() << \" \" <<\n                 Mangle( v->GetName(), IdentifierType::IN_VARYING ) << \";\";\n        NewLine();\n    }\n\n    return input_varyings;\n}\n\nstd::set<Variable_sp> ShaderWriter::WriteOutputVaryings(\n                                        const EntryFunction& entry_function,\n                                        const std::set<Variable_sp>& variables )\n{\n    std::set<Variable_sp> output_varyings;\n\n    \/\/\n    \/\/ The entry function may have a varying semantic\n    \/\/\n    if( entry_function.GetFunction().GetSemantic().IsVarying() )\n    {\n        \/\/\n        \/\/ If this has a glsl builtin don't create the variable as an 'out'\n        \/\/\n        if( !entry_function.GetFunction().GetSemantic().HasBuiltin( \n                                                     entry_function.GetDomain(),\n                                                     false ) )\n            *this << \"out \"; \n        \/\/ This isn't actually a variable, so just output it now\n        *this << entry_function.GetFunction().GetReturnType() <<  \" \" <<\n                 Mangle( entry_function.GetFunction().GetIdentifier(),\n                         IdentifierType::OUT_VARYING ) <<  \";\";\n        NewLine();\n    }\n\n    \/\/\n    \/\/ Add the outputs in the form of function parameters\n    \/\/\n    for( const auto& v : entry_function.GetFunction().GetParameters() )\n        \/\/ we only care about varying parameters\n        if( v->IsVarying() && v->IsOut() )\n            output_varyings.insert( v );\n\n    for( const auto& v : variables )\n        \/\/ Ignore the varying specifier if it's on a parameter to a\n        \/\/ non-top-level function\n        if( v->IsVarying() && v->IsOut() && !v->IsParameter() )\n            output_varyings.insert( v );\n\n    for( const auto& v : output_varyings )\n    {\n        if( !v->GetSemantic().HasBuiltin( entry_function.GetDomain(), false ) )\n            *this << \"out \";\n        \/\/ todo layout information here\n        *this << v->GetType() << \" \" <<\n                 Mangle( v->GetName(), IdentifierType::OUT_VARYING ) << \";\";\n        NewLine();\n    }\n\n    return output_varyings;\n}\n\nvoid ShaderWriter::WriteGlobalVariables(\n                                        const std::set<Variable_sp>& variables )\n{\n    for( const auto& v : variables )\n        if( v->IsGlobal() )\n        {\n            v->WriteDeclaration( *this );\n            NewLine();\n        }\n}\n\nvoid ShaderWriter::WriteFunctionDeclarations(\n                                         const std::set<Function_sp> functions )\n{\n#if !defined(NDEBUG)\n    for( const auto& f : functions )\n        assert( f && \"Null function in WriteFunctionDeclarations\" );\n#endif\n\n    for( const auto& f : functions )\n        f->WriteDeclaration( *this );\n}\n\nvoid ShaderWriter::WriteFunctionDefinitions(\n                                         const std::set<Function_sp> functions )\n{\n#if !defined(NDEBUG)\n    for( const auto& f : functions )\n        assert( f && \"Null function in WriteFunctionDefinitions\" );\n#endif\n\n    for( const auto& f : functions )\n        f->WriteDefinition( *this );\n}\n\nvoid ShaderWriter::WriteMainFunction(\n                                 const EntryFunction& entry_function,\n                                 const std::set<Variable_sp>& input_variables,\n                                 const std::set<Variable_sp>& output_variables )\n{\n    m_Shader << \"void main()\";\n    NewLine();\n    m_Shader << \"{\";\n    PushIndentation();\n    NewLine();\n\n    \/\/\n    \/\/ Gather all the input parameters\n    \/\/\n    std::set<Variable_sp> input_parameters = GatherParameterVariables(\n                                                               entry_function );\n\n    \/\/\n    \/\/ Copy all the in varyings to the global variables except if they came from\n    \/\/ a parameter\n    \/\/\n    for( const auto& v : input_variables )\n        \/\/ Dont allow input parameters, they have already been assigned to a\n        \/\/ local variable\n        if( v->IsGlobal() )\n        {\n            *this << Mangle( v->GetName(), IdentifierType::VARIABLE ) <<\n                     \" = \";\n            if( !v->GetSemantic().HasBuiltin( entry_function.GetDomain(), \n                                              true ) )\n                *this << Mangle( v->GetName(), IdentifierType::IN_VARYING );\n            else\n                *this << v->GetSemantic().GetBuiltin( \n                                                     entry_function.GetDomain(),\n                                                     true );\n            *this << \";\";\n            NewLine();\n        }\n\n    NewLine();\n\n    \/\/\n    \/\/ Write all the input parameters\n    \/\/\n    for( const auto& v : input_parameters )\n    {\n        *this << v->GetType() << \" \" <<\n                 Mangle( v->GetName(), IdentifierType::VARIABLE ) << \" = \" <<\n                 Mangle( v->GetName(), IdentifierType::IN_VARYING ) << \";\";\n        NewLine();\n    }\n\n    NewLine();\n\n    \/\/\n    \/\/ Write a call the the entry function and sort out all the output variables\n    \/\/\n    if( entry_function.GetFunction().GetSemantic().IsVarying() )\n        \/\/ If we have a varying semantic on this function write to the output\n        *this << Mangle( entry_function.GetFunction().GetIdentifier(),\n                         IdentifierType::OUT_VARYING ) << \" = \";\n    *this << Mangle( entry_function.GetFunction().GetIdentifier(),\n                     IdentifierType::FUNCTION ) << \"(\";\n    bool first = true;\n    for( const auto& argument : entry_function.GetParameters() )\n    {\n        if( !first )\n            *this << \", \";\n        else\n            first = false;\n        *this << *argument;\n    }\n    *this << \");\";\n\n    NewLine();\n\n    \/\/\n    \/\/ Copy the function's return variable to the builtin if it has one\n    \/\/\n    if( entry_function.GetFunction().GetSemantic().HasBuiltin( \n                                                     entry_function.GetDomain(), \n                                                     false ) )\n    {\n        *this << entry_function.GetFunction().GetSemantic().GetBuiltin( \n                                                     entry_function.GetDomain(),\n                                                     false ) <<\n                 \" = \" << Mangle( entry_function.GetFunction().GetIdentifier(),\n                                  IdentifierType::OUT_VARYING ) << \";\";\n        NewLine();\n    }\n    \n    \/\/\n    \/\/ Copy all the global variables to their out variables or builtins\n    \/\/\n    for( const auto& v : output_variables )\n        if( v->IsGlobal() )\n        {\n            if( v->GetSemantic().HasBuiltin( entry_function.GetDomain(), \n                                             false ) )\n                *this << v->GetSemantic().GetBuiltin( \n                                                     entry_function.GetDomain(),\n                                                     false );\n            else\n                *this << Mangle( v->GetName(), IdentifierType::OUT_VARYING );\n            \n            *this << \" = \" <<\n                     Mangle( v->GetName(), IdentifierType::VARIABLE ) << \";\";\n            NewLine();\n        }\n\n    PopIndentation();\n    NewLine();\n    m_Shader << \"}\";\n    NewLine(2);\n}\n\nstd::set<Function_sp> ShaderWriter::GatherFunctions( Function_sp function )\n{\n    assert( function && \"GatherFunctions given null function\" );\n\n    std::set<Function_sp> ret =\n    {\n        function\n    };\n\n    \/\/\n    \/\/ Perform a dfs on the function tree\n    \/\/\n    std::vector<Function_sp>               call_stack = { function };\n    std::stack< std::set<Function_sp> > expanded;\n    expanded.push( function->GetCallees() );\n\n    while( !expanded.empty() )\n    {\n        \/\/\n        \/\/ If we've exhausted all of the expanded functions we can move up\n        \/\/\n        if( expanded.top().empty() )\n        {\n            expanded.pop();\n            call_stack.pop_back();\n            continue;\n        }\n\n        \/\/\n        \/\/ We still have functions at this level to explore explore the next one\n        \/\/\n        Function_sp current = *expanded.top().begin();\n\n        const auto& f = std::find( call_stack.begin(), call_stack.end(),\n                                   current );\n        if( f != call_stack.end() )\n        {\n            \/\/\n            \/\/ If this function is in the call stack, error because of recursion\n            \/\/\n            Error( \"Recursion in shader function: \" +\n                   current->GetSignatureString() );\n            return {};\n        }\n\n\n        \/\/\n        \/\/ Remove this function from the expanded function list\n        \/\/\n        expanded.top().erase( expanded.top().begin() );\n\n        \/\/\n        \/\/ Add this function to the call stack and expand it's children\n        \/\/\n        ret.insert( current );\n        call_stack.push_back( current );\n        expanded.push( current->GetCallees() );\n    }\n\n    return ret;\n}\n\nstd::set<Variable_sp> ShaderWriter::GatherVariables(\n                                        const std::set<Function_sp>& functions )\n{\n    std::set<Variable_sp> ret;\n    for( const auto& f : functions )\n    {\n        std::set<Variable_sp> v = f->GetVariables();\n        ret.insert( v.begin(), v.end() );\n    }\n    return ret;\n}\n\nstd::set<Variable_sp> ShaderWriter::GatherParameterVariables(\n                                        const EntryFunction& entry_function )\n{\n    std::set<Variable_sp> ret;\n    for( const auto& p : entry_function.GetParameters() )\n    {\n        std::set<Variable_sp> v = p->GetVariables();\n        ret.insert( v.begin(), v.end() );\n    }\n    return ret;\n}\n\nvoid ShaderWriter::NewLine( unsigned num_lines )\n{\n    const std::string indent = \"    \";\n    for( unsigned i = 0; i < num_lines; ++i )\n        m_Shader << '\\n';\n    for( unsigned i = 0; i < m_Indentation; ++i )\n        m_Shader << indent;\n}\n\nvoid ShaderWriter::Error( const std::string& error_string )\n{\n    m_Good = false;\n    m_Context.Error( error_string );\n}\n\nvoid ShaderWriter::Warning( const std::string& warning_string )\n{\n    \/\/ todo Context::Warning\n    m_Context.Error( \"Warning: \" + warning_string );\n}\n\n} \/\/ namespace Compiler\n} \/\/ namespace JoeLang\n<commit_msg>[+] whitespace<commit_after>\/*\n    Copyright 2012 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 \"shader_writer.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <map>\n#include <memory>\n#include <set>\n#include <stack>\n#include <string>\n#include <sstream>\n#include <vector>\n\n#include <compiler\/complete_type.hpp>\n#include <compiler\/entry_function.hpp>\n#include <compiler\/generic_value.hpp>\n#include <compiler\/function.hpp>\n#include <compiler\/variable.hpp>\n#include <compiler\/semantic_info.hpp>\n#include <compiler\/tokens\/expressions\/expression.hpp>\n#include <compiler\/tokens\/expressions\/postfix_operator.hpp>\n#include <joelang\/context.hpp>\n#include <joelang\/shader.hpp>\n\nnamespace JoeLang\n{\nnamespace Compiler\n{\n\nconst std::string ShaderWriter::s_GLSLVersion = \"150\";\n\nShaderWriter::ShaderWriter( const Context& context )\n    :m_Context( context )\n{\n    m_Shader.setf( std::ios_base::scientific );\n    m_Shader.setf( std::ios_base::boolalpha );\n    m_Shader.setf( std::ios_base::showpoint );\n}\n\nstd::string ShaderWriter::GenerateGLSL( const EntryFunction& entry_function )\n{\n    GenerateShader( entry_function );\n        \n    std::string ret = m_Shader.str();\n\n    \/\/ reset things\n    m_Shader.str(\"\");\n\n    assert( m_Indentation == 0 && \"Unmatched indentations\" );\n\n    \/\/ return an empty string if we've had an error\n    if( m_Good )\n        return ret;\n    else\n        return \"\";\n}\n\nvoid ShaderWriter::PushIndentation()\n{\n    ++m_Indentation;\n}\n\nvoid ShaderWriter::PopIndentation()\n{\n    assert( m_Indentation > 0 && \"Trying to pop 0 indentation\" );\n    --m_Indentation;\n}\n\nstd::string ShaderWriter::Mangle( const std::string& identifier,\n                                  IdentifierType identifier_type )\n{\n    const static std::map<IdentifierType, std::string> prefix_map\n    {\n        { IdentifierType::VARIABLE,    \"_\"  },\n        { IdentifierType::IN_VARYING,  \"i_\"  },\n        { IdentifierType::OUT_VARYING, \"o_\"  },\n        { IdentifierType::FUNCTION,    \"f_\" }\n    };\n    return prefix_map.at(identifier_type) + identifier;\n}\n\nShaderWriter& ShaderWriter::operator << ( const CompleteType& value )\n{\n    value.Write( *this );\n    return *this;\n}\n\nShaderWriter& ShaderWriter::operator << ( const Expression& value )\n{\n    value.Write( *this );\n    return *this;\n}\n\nShaderWriter& ShaderWriter::operator << ( const Statement& value )\n{\n    value.Write( *this );\n    return *this;\n}\n\nShaderWriter& ShaderWriter::operator << ( const GenericValue& value )\n{\n    value.Write( *this );\n    return *this;\n}\n\nvoid ShaderWriter::GenerateShader( const EntryFunction& entry_function )\n{\n    WriteGLSLVersion();\n\n    \/\/\n    \/\/ Get all the functions used by this entry function\n    \/\/\n    std::set<Function_sp> functions = GatherFunctions(\n                                          entry_function.GetFunctionPointer() );\n\n    \/\/\n    \/\/ Get all the variables used by the functions. We're interested in the\n    \/\/ inputs and outputs\n    \/\/\n    std::set<Variable_sp> variables = GatherVariables( functions );\n    std::set<Variable_sp> input_variables;\n    std::set<Variable_sp> output_variables;\n\n    input_variables = WriteInputVaryings( entry_function, variables );\n    NewLine();\n    output_variables = WriteOutputVaryings( entry_function, variables );\n    NewLine();\n\n    WriteGlobalVariables( variables );\n    NewLine();\n\n    WriteFunctionDeclarations( functions );\n    NewLine();\n\n    WriteFunctionDefinitions( functions );\n    NewLine();\n\n    WriteMainFunction( entry_function, input_variables, output_variables );\n}\n\nvoid ShaderWriter::WriteGLSLVersion()\n{\n    m_Shader << \"#version \" << s_GLSLVersion;\n    NewLine(2);\n}\n\nstd::set<Variable_sp> ShaderWriter::WriteInputVaryings(\n                                        const EntryFunction& entry_function,\n                                        const std::set<Variable_sp>& variables )\n{\n    std::set<Variable_sp> input_varyings;\n    std::set<Variable_sp> input_parameters = GatherParameterVariables(\n                                                               entry_function );\n\n    for( const auto& v : variables )\n        \/\/ Ignore the varying specifier if it's on a parameter to a\n        \/\/ non-top-level function\n        if( v->IsVarying() && v->IsIn() && !v->IsParameter() )\n            input_varyings.insert( v );\n\n    for( const auto& v : input_parameters )\n        if( v->IsVarying() && v->IsIn() &&\n            input_varyings.find( v ) == input_varyings.end() )\n        {\n            \/\/ We only care about input varyings here,\n            \/\/ and only about ones which are not used elsewhere\n            \n            \/\/\n            \/\/ If this has a builtin don't write the 'in'\n            \/\/\n            if( !v->GetSemantic().HasBuiltin( entry_function.GetDomain(), \n                                              true ) )\n                *this << \"in \";  \n            \n            \/\/ todo layout information here\n            *this << v->GetType() << \" \" <<\n                     Mangle( v->GetName(), IdentifierType::IN_VARYING ) << \";\";\n            NewLine();\n        }\n\n    for( const auto& v : input_varyings )\n    {\n        \/\/\n        \/\/ if this has a builtin don't write the layout information\n        \/\/\n        if( !v->GetSemantic().HasBuiltin( entry_function.GetDomain(), true ) )\n            *this << \"in \";\n        \n        \/\/ todo layout information here\n        *this << v->GetType() << \" \" <<\n                 Mangle( v->GetName(), IdentifierType::IN_VARYING ) << \";\";\n        NewLine();\n    }\n\n    return input_varyings;\n}\n\nstd::set<Variable_sp> ShaderWriter::WriteOutputVaryings(\n                                        const EntryFunction& entry_function,\n                                        const std::set<Variable_sp>& variables )\n{\n    std::set<Variable_sp> output_varyings;\n\n    \/\/\n    \/\/ The entry function may have a varying semantic\n    \/\/\n    if( entry_function.GetFunction().GetSemantic().IsVarying() )\n    {\n        \/\/\n        \/\/ If this has a glsl builtin don't create the variable as an 'out'\n        \/\/\n        if( !entry_function.GetFunction().GetSemantic().HasBuiltin( \n                                                     entry_function.GetDomain(),\n                                                     false ) )\n            *this << \"out \"; \n        \/\/ This isn't actually a variable, so just output it now\n        *this << entry_function.GetFunction().GetReturnType() <<  \" \" <<\n                 Mangle( entry_function.GetFunction().GetIdentifier(),\n                         IdentifierType::OUT_VARYING ) <<  \";\";\n        NewLine();\n    }\n\n    \/\/\n    \/\/ Add the outputs in the form of function parameters\n    \/\/\n    for( const auto& v : entry_function.GetFunction().GetParameters() )\n        \/\/ we only care about varying parameters\n        if( v->IsVarying() && v->IsOut() )\n            output_varyings.insert( v );\n\n    for( const auto& v : variables )\n        \/\/ Ignore the varying specifier if it's on a parameter to a\n        \/\/ non-top-level function\n        if( v->IsVarying() && v->IsOut() && !v->IsParameter() )\n            output_varyings.insert( v );\n\n    for( const auto& v : output_varyings )\n    {\n        if( !v->GetSemantic().HasBuiltin( entry_function.GetDomain(), false ) )\n            *this << \"out \";\n        \/\/ todo layout information here\n        *this << v->GetType() << \" \" <<\n                 Mangle( v->GetName(), IdentifierType::OUT_VARYING ) << \";\";\n        NewLine();\n    }\n\n    return output_varyings;\n}\n\nvoid ShaderWriter::WriteGlobalVariables(\n                                        const std::set<Variable_sp>& variables )\n{\n    for( const auto& v : variables )\n        if( v->IsGlobal() )\n        {\n            v->WriteDeclaration( *this );\n            NewLine();\n        }\n}\n\nvoid ShaderWriter::WriteFunctionDeclarations(\n                                         const std::set<Function_sp> functions )\n{\n#if !defined(NDEBUG)\n    for( const auto& f : functions )\n        assert( f && \"Null function in WriteFunctionDeclarations\" );\n#endif\n\n    for( const auto& f : functions )\n        f->WriteDeclaration( *this );\n}\n\nvoid ShaderWriter::WriteFunctionDefinitions(\n                                         const std::set<Function_sp> functions )\n{\n#if !defined(NDEBUG)\n    for( const auto& f : functions )\n        assert( f && \"Null function in WriteFunctionDefinitions\" );\n#endif\n\n    for( const auto& f : functions )\n        f->WriteDefinition( *this );\n}\n\nvoid ShaderWriter::WriteMainFunction(\n                                 const EntryFunction& entry_function,\n                                 const std::set<Variable_sp>& input_variables,\n                                 const std::set<Variable_sp>& output_variables )\n{\n    m_Shader << \"void main()\";\n    NewLine();\n    m_Shader << \"{\";\n    PushIndentation();\n    NewLine();\n\n    \/\/\n    \/\/ Gather all the input parameters\n    \/\/\n    std::set<Variable_sp> input_parameters = GatherParameterVariables(\n                                                               entry_function );\n\n    \/\/\n    \/\/ Copy all the in varyings to the global variables except if they came from\n    \/\/ a parameter\n    \/\/\n    for( const auto& v : input_variables )\n        \/\/ Dont allow input parameters, they have already been assigned to a\n        \/\/ local variable\n        if( v->IsGlobal() )\n        {\n            *this << Mangle( v->GetName(), IdentifierType::VARIABLE ) <<\n                     \" = \";\n            if( !v->GetSemantic().HasBuiltin( entry_function.GetDomain(), \n                                              true ) )\n                *this << Mangle( v->GetName(), IdentifierType::IN_VARYING );\n            else\n                *this << v->GetSemantic().GetBuiltin( \n                                                     entry_function.GetDomain(),\n                                                     true );\n            *this << \";\";\n            NewLine();\n        }\n\n    NewLine();\n\n    \/\/\n    \/\/ Write all the input parameters\n    \/\/\n    for( const auto& v : input_parameters )\n    {\n        *this << v->GetType() << \" \" <<\n                 Mangle( v->GetName(), IdentifierType::VARIABLE ) << \" = \" <<\n                 Mangle( v->GetName(), IdentifierType::IN_VARYING ) << \";\";\n        NewLine();\n    }\n\n    NewLine();\n\n    \/\/\n    \/\/ Write a call the the entry function and sort out all the output variables\n    \/\/\n    if( entry_function.GetFunction().GetSemantic().IsVarying() )\n        \/\/ If we have a varying semantic on this function write to the output\n        *this << Mangle( entry_function.GetFunction().GetIdentifier(),\n                         IdentifierType::OUT_VARYING ) << \" = \";\n    *this << Mangle( entry_function.GetFunction().GetIdentifier(),\n                     IdentifierType::FUNCTION ) << \"(\";\n    bool first = true;\n    for( const auto& argument : entry_function.GetParameters() )\n    {\n        if( !first )\n            *this << \", \";\n        else\n            first = false;\n        *this << *argument;\n    }\n    *this << \");\";\n\n    NewLine();\n\n    \/\/\n    \/\/ Copy the function's return variable to the builtin if it has one\n    \/\/\n    if( entry_function.GetFunction().GetSemantic().HasBuiltin( \n                                                     entry_function.GetDomain(), \n                                                     false ) )\n    {\n        NewLine();\n        *this << entry_function.GetFunction().GetSemantic().GetBuiltin( \n                                                     entry_function.GetDomain(),\n                                                     false ) <<\n                 \" = \" << Mangle( entry_function.GetFunction().GetIdentifier(),\n                                  IdentifierType::OUT_VARYING ) << \";\";\n    }\n    \n    \/\/\n    \/\/ Copy all the global variables to their out variables or builtins\n    \/\/\n    for( const auto& v : output_variables )\n        if( v->IsGlobal() )\n        {\n            if( v->GetSemantic().HasBuiltin( entry_function.GetDomain(), \n                                             false ) )\n                *this << v->GetSemantic().GetBuiltin( \n                                                     entry_function.GetDomain(),\n                                                     false );\n            else\n                *this << Mangle( v->GetName(), IdentifierType::OUT_VARYING );\n            \n            *this << \" = \" <<\n                     Mangle( v->GetName(), IdentifierType::VARIABLE ) << \";\";\n            NewLine();\n        }\n\n    PopIndentation();\n    NewLine();\n    m_Shader << \"}\";\n    NewLine(2);\n}\n\nstd::set<Function_sp> ShaderWriter::GatherFunctions( Function_sp function )\n{\n    assert( function && \"GatherFunctions given null function\" );\n\n    std::set<Function_sp> ret =\n    {\n        function\n    };\n\n    \/\/\n    \/\/ Perform a dfs on the function tree\n    \/\/\n    std::vector<Function_sp>               call_stack = { function };\n    std::stack< std::set<Function_sp> > expanded;\n    expanded.push( function->GetCallees() );\n\n    while( !expanded.empty() )\n    {\n        \/\/\n        \/\/ If we've exhausted all of the expanded functions we can move up\n        \/\/\n        if( expanded.top().empty() )\n        {\n            expanded.pop();\n            call_stack.pop_back();\n            continue;\n        }\n\n        \/\/\n        \/\/ We still have functions at this level to explore explore the next one\n        \/\/\n        Function_sp current = *expanded.top().begin();\n\n        const auto& f = std::find( call_stack.begin(), call_stack.end(),\n                                   current );\n        if( f != call_stack.end() )\n        {\n            \/\/\n            \/\/ If this function is in the call stack, error because of recursion\n            \/\/\n            Error( \"Recursion in shader function: \" +\n                   current->GetSignatureString() );\n            return {};\n        }\n\n\n        \/\/\n        \/\/ Remove this function from the expanded function list\n        \/\/\n        expanded.top().erase( expanded.top().begin() );\n\n        \/\/\n        \/\/ Add this function to the call stack and expand it's children\n        \/\/\n        ret.insert( current );\n        call_stack.push_back( current );\n        expanded.push( current->GetCallees() );\n    }\n\n    return ret;\n}\n\nstd::set<Variable_sp> ShaderWriter::GatherVariables(\n                                        const std::set<Function_sp>& functions )\n{\n    std::set<Variable_sp> ret;\n    for( const auto& f : functions )\n    {\n        std::set<Variable_sp> v = f->GetVariables();\n        ret.insert( v.begin(), v.end() );\n    }\n    return ret;\n}\n\nstd::set<Variable_sp> ShaderWriter::GatherParameterVariables(\n                                        const EntryFunction& entry_function )\n{\n    std::set<Variable_sp> ret;\n    for( const auto& p : entry_function.GetParameters() )\n    {\n        std::set<Variable_sp> v = p->GetVariables();\n        ret.insert( v.begin(), v.end() );\n    }\n    return ret;\n}\n\nvoid ShaderWriter::NewLine( unsigned num_lines )\n{\n    const std::string indent = \"    \";\n    for( unsigned i = 0; i < num_lines; ++i )\n        m_Shader << '\\n';\n    for( unsigned i = 0; i < m_Indentation; ++i )\n        m_Shader << indent;\n}\n\nvoid ShaderWriter::Error( const std::string& error_string )\n{\n    m_Good = false;\n    m_Context.Error( error_string );\n}\n\nvoid ShaderWriter::Warning( const std::string& warning_string )\n{\n    \/\/ todo Context::Warning\n    m_Context.Error( \"Warning: \" + warning_string );\n}\n\n} \/\/ namespace Compiler\n} \/\/ namespace JoeLang\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- ClangSACheckerProvider.cpp - Clang SA Checkers Provider ----------===\/\/\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\/\/ Defines the CheckerProvider for the checkers defined in\n\/\/ libclangStaticAnalyzerCheckers.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangSACheckerProvider.h\"\n#include \"ClangSACheckers.h\"\n#include \"clang\/StaticAnalyzer\/Core\/CheckerManager.h\"\n#include \"clang\/StaticAnalyzer\/Core\/CheckerProvider.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n\nusing namespace clang;\nusing namespace ento;\n\nnamespace {\n\n\/\/\/ \\brief Provider for all the checkers in libclangStaticAnalyzerCheckers.\nclass ClangSACheckerProvider : public CheckerProvider {\npublic:\n  virtual void registerCheckers(CheckerManager &checkerMgr,\n                              CheckerOptInfo *checkOpts, unsigned numCheckOpts);\n};\n\n}\n\nCheckerProvider *ento::createClangSACheckerProvider() {\n  return new ClangSACheckerProvider();\n}\n\nnamespace {\n\nstruct StaticCheckerInfoRec {\n  const char *FullName;\n  CheckerManager::RegisterFunc RegFunc;\n  bool Hidden;\n};\n\n} \/\/ end anonymous namespace.\n\nstatic const StaticCheckerInfoRec StaticCheckerInfo[] = {\n#define GET_CHECKERS\n#define CHECKER(FULLNAME,CLASS,DESCFILE,HELPTEXT,HIDDEN)    \\\n  { FULLNAME, register##CLASS, HIDDEN },\n#include \"Checkers.inc\"\n  { 0, 0, 0}\n#undef CHECKER\n#undef GET_CHECKERS\n};\n\nnamespace {\n\nstruct CheckNameOption {\n  const char  *Name;\n  const short *Members;\n  const short *SubGroups;\n};\n\n} \/\/ end anonymous namespace.\n\n#define GET_MEMBER_ARRAYS\n#include \"Checkers.inc\"\n#undef GET_MEMBER_ARRAYS\n\n\/\/ The table of check name options, sorted by name for fast binary lookup.\nstatic const CheckNameOption CheckNameTable[] = {\n#define GET_CHECKNAME_TABLE\n#include \"Checkers.inc\"\n#undef GET_CHECKNAME_TABLE\n};\nstatic const size_t\n        CheckNameTableSize = sizeof(CheckNameTable) \/ sizeof(CheckNameTable[0]);\n\nstatic bool CheckNameOptionCompare(const CheckNameOption &LHS,\n                                   const CheckNameOption &RHS) {\n  return strcmp(LHS.Name, RHS.Name) < 0;\n}\n\nstatic void collectCheckers(const CheckNameOption *checkName,\n                            bool enable,\n                         llvm::DenseSet<const StaticCheckerInfoRec *> &checkers,\n                            bool collectHidden) {\n  if (const short *member = checkName->Members) {\n    if (enable) {\n      if (collectHidden || !StaticCheckerInfo[*member].Hidden)\n        checkers.insert(&StaticCheckerInfo[*member]);\n    } else {\n      for (; *member != -1; ++member)\n        checkers.erase(&StaticCheckerInfo[*member]);\n    }\n  }\n\n  \/\/ Enable\/disable all subgroups along with this one.\n  if (const short *subGroups = checkName->SubGroups) {\n    for (; *subGroups != -1; ++subGroups)\n      collectCheckers(&CheckNameTable[*subGroups], enable, checkers,\n                      \/*don't enable hidden in subgroups*\/ false);\n  }\n}\n\nstatic void collectCheckers(CheckerOptInfo &opt,\n                       llvm::DenseSet<const StaticCheckerInfoRec *> &checkers) {\n  const char *optName = opt.getName();\n  CheckNameOption key = { optName, 0, 0 };\n  const CheckNameOption *found =\n  std::lower_bound(CheckNameTable, CheckNameTable + CheckNameTableSize, key,\n                   CheckNameOptionCompare);\n  if (found == CheckNameTable + CheckNameTableSize ||\n      strcmp(found->Name, optName) != 0)\n    return;  \/\/ Check name not found.\n\n  opt.claim();\n  collectCheckers(found, opt.isEnabled(), checkers, \/*collectHidden=*\/true);\n}\n\n#include \"llvm\/Support\/raw_ostream.h\"\n\nvoid ClangSACheckerProvider::registerCheckers(CheckerManager &checkerMgr,\n                             CheckerOptInfo *checkOpts, unsigned numCheckOpts) {\n  llvm::DenseSet<const StaticCheckerInfoRec *> enabledCheckers;\n  for (unsigned i = 0; i != numCheckOpts; ++i)\n    collectCheckers(checkOpts[i], enabledCheckers);\n  for (llvm::DenseSet<const StaticCheckerInfoRec *>::iterator\n         I = enabledCheckers.begin(), E = enabledCheckers.end(); I != E; ++I) {\n    checkerMgr.addCheckerRegisterFunction((*I)->RegFunc);\n  }\n}\n<commit_msg>Remove left-over #include.<commit_after>\/\/===--- ClangSACheckerProvider.cpp - Clang SA Checkers Provider ----------===\/\/\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\/\/ Defines the CheckerProvider for the checkers defined in\n\/\/ libclangStaticAnalyzerCheckers.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangSACheckerProvider.h\"\n#include \"ClangSACheckers.h\"\n#include \"clang\/StaticAnalyzer\/Core\/CheckerManager.h\"\n#include \"clang\/StaticAnalyzer\/Core\/CheckerProvider.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n\nusing namespace clang;\nusing namespace ento;\n\nnamespace {\n\n\/\/\/ \\brief Provider for all the checkers in libclangStaticAnalyzerCheckers.\nclass ClangSACheckerProvider : public CheckerProvider {\npublic:\n  virtual void registerCheckers(CheckerManager &checkerMgr,\n                              CheckerOptInfo *checkOpts, unsigned numCheckOpts);\n};\n\n}\n\nCheckerProvider *ento::createClangSACheckerProvider() {\n  return new ClangSACheckerProvider();\n}\n\nnamespace {\n\nstruct StaticCheckerInfoRec {\n  const char *FullName;\n  CheckerManager::RegisterFunc RegFunc;\n  bool Hidden;\n};\n\n} \/\/ end anonymous namespace.\n\nstatic const StaticCheckerInfoRec StaticCheckerInfo[] = {\n#define GET_CHECKERS\n#define CHECKER(FULLNAME,CLASS,DESCFILE,HELPTEXT,HIDDEN)    \\\n  { FULLNAME, register##CLASS, HIDDEN },\n#include \"Checkers.inc\"\n  { 0, 0, 0}\n#undef CHECKER\n#undef GET_CHECKERS\n};\n\nnamespace {\n\nstruct CheckNameOption {\n  const char  *Name;\n  const short *Members;\n  const short *SubGroups;\n};\n\n} \/\/ end anonymous namespace.\n\n#define GET_MEMBER_ARRAYS\n#include \"Checkers.inc\"\n#undef GET_MEMBER_ARRAYS\n\n\/\/ The table of check name options, sorted by name for fast binary lookup.\nstatic const CheckNameOption CheckNameTable[] = {\n#define GET_CHECKNAME_TABLE\n#include \"Checkers.inc\"\n#undef GET_CHECKNAME_TABLE\n};\nstatic const size_t\n        CheckNameTableSize = sizeof(CheckNameTable) \/ sizeof(CheckNameTable[0]);\n\nstatic bool CheckNameOptionCompare(const CheckNameOption &LHS,\n                                   const CheckNameOption &RHS) {\n  return strcmp(LHS.Name, RHS.Name) < 0;\n}\n\nstatic void collectCheckers(const CheckNameOption *checkName,\n                            bool enable,\n                         llvm::DenseSet<const StaticCheckerInfoRec *> &checkers,\n                            bool collectHidden) {\n  if (const short *member = checkName->Members) {\n    if (enable) {\n      if (collectHidden || !StaticCheckerInfo[*member].Hidden)\n        checkers.insert(&StaticCheckerInfo[*member]);\n    } else {\n      for (; *member != -1; ++member)\n        checkers.erase(&StaticCheckerInfo[*member]);\n    }\n  }\n\n  \/\/ Enable\/disable all subgroups along with this one.\n  if (const short *subGroups = checkName->SubGroups) {\n    for (; *subGroups != -1; ++subGroups)\n      collectCheckers(&CheckNameTable[*subGroups], enable, checkers,\n                      \/*don't enable hidden in subgroups*\/ false);\n  }\n}\n\nstatic void collectCheckers(CheckerOptInfo &opt,\n                       llvm::DenseSet<const StaticCheckerInfoRec *> &checkers) {\n  const char *optName = opt.getName();\n  CheckNameOption key = { optName, 0, 0 };\n  const CheckNameOption *found =\n  std::lower_bound(CheckNameTable, CheckNameTable + CheckNameTableSize, key,\n                   CheckNameOptionCompare);\n  if (found == CheckNameTable + CheckNameTableSize ||\n      strcmp(found->Name, optName) != 0)\n    return;  \/\/ Check name not found.\n\n  opt.claim();\n  collectCheckers(found, opt.isEnabled(), checkers, \/*collectHidden=*\/true);\n}\n\nvoid ClangSACheckerProvider::registerCheckers(CheckerManager &checkerMgr,\n                             CheckerOptInfo *checkOpts, unsigned numCheckOpts) {\n  llvm::DenseSet<const StaticCheckerInfoRec *> enabledCheckers;\n  for (unsigned i = 0; i != numCheckOpts; ++i)\n    collectCheckers(checkOpts[i], enabledCheckers);\n  for (llvm::DenseSet<const StaticCheckerInfoRec *>::iterator\n         I = enabledCheckers.begin(), E = enabledCheckers.end(); I != E; ++I) {\n    checkerMgr.addCheckerRegisterFunction((*I)->RegFunc);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"game\/tileview\/tile.h\"\n#include \"framework\/framework.h\"\n\nnamespace OpenApoc {\n\nTileMap::TileMap(Framework &fw, Vec3<int> size)\n\t: fw(fw), size(size)\n{\n\ttiles.reserve(size.z * size.y * size.z);\n\tfor (int z = 0; z < size.z; z++)\n\t{\n\t\tfor (int y = 0; y < size.y; y++)\n\t\t{\n\t\t\tfor (int x = 0; x < size.x; x++)\n\t\t\t{\n\t\t\t\ttiles.emplace_back(*this, Vec3<int>{x,y,z});\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid\nTileMap::update(unsigned int ticks)\n{\n\tfor (auto& object : this->activeObjects)\n\t\tobject->update(ticks);\n\tfor (auto& object : this->projectiles)\n\t\tobject->checkProjectileCollision();\n}\n\nTile*\nTileMap::getTile(int x, int y, int z)\n{\n\tif (x >= size.x || y >= size.y || z >= size.z)\n\t{\n\t\tLogError(\"Requesting tile {%d,%d,%d} in map of size {%d,%d,%d}\",\n\t\t\tx, y, z, size.x, size.y, size.z);\n\t\treturn nullptr;\n\t}\n\treturn &this->tiles[z * size.x * size.y + y * size.x + x];\n}\n\nTile*\nTileMap::getTile(Vec3<int> pos)\n{\n\treturn getTile(pos.x, pos.y, pos.z);\n}\n\nTile*\nTileMap::getTile(Vec3<float> pos)\n{\n\treturn getTile(pos.x, pos.y, pos.z);\n}\n\nvoid\nTileMap::addObject(std::shared_ptr<TileObject> obj)\n{\n\tif (!obj->getOwningTile())\n\t{\n\t\tLogError(\"Adding object with no owner\");\n\t\tassert(0);\n\t}\n\tobj->getOwningTile()->ownedObjects.insert(obj);\n\tif (obj->isActive())\n\t\tthis->activeObjects.insert(obj);\n\tif (obj->isVisible())\n\t\tobj->getOwningTile()->visibleObjects.insert(obj);\n\tif (obj->isCollidable())\n\t\tobj->addToAffectedTiles();\n\tif (obj->isProjectile())\n\t\tthis->projectiles.insert(obj);\n\n}\n\nvoid\nTileMap::removeObject(std::shared_ptr<TileObject> obj)\n{\n\tif (!obj->getOwningTile())\n\t{\n\t\tLogError(\"Removing object with no owner\");\n\t\tassert(0);\n\t}\n\tif (obj->isActive())\n\t\tthis->activeObjects.erase(obj);\n\tif (obj->isProjectile())\n\t{\n\t\tobj->getOwningTile()->ownedProjectiles.erase(obj);\n\t\tthis->projectiles.erase(obj);\n\t}\n\tif (obj->isVisible())\n\t\tobj->getOwningTile()->visibleObjects.erase(obj);\n\tif (obj->isCollidable())\n\t\tobj->removeFromAffectedTiles();\n\tauto count = obj->getOwningTile()->ownedObjects.erase(obj);\n\tif (count != 1)\n\t{\n\t\tLogError(\"Removed %u objects from owning tile\", (unsigned)count);\n\t}\n}\n\nTileMap::~TileMap()\n{\n}\n\nTile::Tile(TileMap &map, Vec3<int> position)\n\t: map(map), position(position)\n{\n}\n\nTileObject::TileObject(TileMap &map, Vec3<float> position, bool active, bool collides, bool visible, bool projectile)\n\t: position(position), owningTile(map.getTile(position)), active(active), collides(collides), visible(visible), projectile(projectile)\n{\n\t\/\/May be called by multiple subclass constructors - don't do anything\n\t\/\/non-repeatable here\n}\n\nTileObject::~TileObject()\n{\n\n}\n\nconst Vec3<float>&\nTileObject::getPosition() const\n{\n\treturn this->position;\n}\n\nvoid\nTileObject::setPosition(Vec3<float> newPos)\n{\n\tauto thisPtr = shared_from_this();\n\tthis->position = newPos;\n\tauto &map = this->owningTile->map;\n\tauto newOwner = map.getTile(this->position);\n\tif (newOwner != this->owningTile)\n\t{\n\t\tif (this->isVisible())\n\t\t{\n\t\t\tthis->owningTile->visibleObjects.erase(thisPtr);\n\t\t\tnewOwner->visibleObjects.insert(thisPtr);\n\t\t}\n\t\tif (this->isProjectile())\n\t\t{\n\t\t\tthis->owningTile->ownedProjectiles.erase(thisPtr);\n\t\t\tnewOwner->ownedProjectiles.insert(thisPtr);\n\t\t}\n\t\tthis->owningTile->ownedObjects.erase(thisPtr);\n\t\tnewOwner->ownedObjects.insert(thisPtr);\n\t\tthis->owningTile = newOwner;\n\t}\n}\n\nvoid\nTileObject::update(unsigned int ticks)\n{\n\t\/\/Override this for active objects\n\tLogWarning(\"Called on non-active object\");\n\tassert(!this->isActive());\n\tstd::ignore = ticks;\n}\n\nstd::shared_ptr<Image>\nTileObject::getSprite()\n{\n\t\/\/Override this for visible objects\n\tLogWarning(\"Called on non-visible object\");\n\tassert(!this->isVisible());\n\treturn nullptr;\n}\n\nVec3<float>\nTileObject::getDrawPosition() const\n{\n\t\/\/Override this for visible objects\n\tLogWarning(\"Called on non-visible object\");\n\tassert(!this->isVisible());\n\treturn this->getPosition();\n}\n\nconst Vec3<int>&\nTileObject::getTileSizeInVoxels() const\n{\n\tstatic Vec3<int> invalidSize{0,0,0};\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\treturn invalidSize;\n}\n\nconst Vec3<int>&\nTileObject::getBounds() const\n{\n\tstatic Vec3<int> invalidSize{0,0,0};\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\treturn invalidSize;\n}\n\nbool\nTileObject::hasVoxelAt(const Vec3<float> &worldPosition) const\n{\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\tstd::ignore = worldPosition;\n\treturn false;\n}\n\nvoid\nTileObject::handleCollision(const Collision &c) \n{\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\tstd::ignore = c;\n\treturn;\n}\n\nvoid\nTileObject::removeFromAffectedTiles()\n{\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\treturn;\n}\n\nvoid\nTileObject::addToAffectedTiles()\n{\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\treturn;\n}\n\nvoid\nTileObject::checkProjectileCollision()\n{\n\t\/\/Override this for projectile objects\n\tLogWarning(\"Called on non-projectile object\");\n\tassert(!this->isProjectile());\n\treturn;\n}\n\nvoid\nTileObject::drawProjectile(TileView &v, Renderer &r, Vec2<int> screenPosition)\n{\n\t\/\/Override this for projectile objects\n\tLogWarning(\"Called on non-projectile object\");\n\tassert(!this->isProjectile());\n\tstd::ignore = v;\n\tstd::ignore = r;\n\tstd::ignore = screenPosition;\n\treturn;\n}\n\nclass PathComparer\n{\npublic:\n\tVec3<float> dest;\n\tVec3<float> origin;\n\tPathComparer(Vec3<int> d)\n\t\t: dest{d.x, d.y, d.z}{}\n\tbool operator() (Tile* t1, Tile* t2)\n\t{\n\t\tVec3<float> t1Pos {t1->position.x, t1->position.y, t1->position.z};\n\t\tVec3<float> t2Pos {t2->position.x, t2->position.y, t2->position.z};\n\n\t\tVec3<float> t1tod  = dest - t1Pos;\n\t\tVec3<float> t2tod  = dest - t2Pos;\n\n\t\tfloat t1cost = glm::length(t1tod);\n\t\tfloat t2cost = glm::length(t2tod);\n\n\t\tt1cost += glm::length(t1Pos-origin);\n\t\tt2cost += glm::length(t2Pos-origin);\n\n\t\treturn (t1cost < t2cost);\n\n\t}\n};\n\n#define THRESHOLD_ITERATIONS 500\n\nstatic bool findNextNodeOnPath(PathComparer &comparer, TileMap &map, std::list<Tile*> &currentPath, Vec3<int> destination, volatile unsigned long *numIterations)\n{\n\tif (currentPath.back()->position == destination)\n\t\treturn true;\n\tif (*numIterations > THRESHOLD_ITERATIONS)\n\t\treturn false;\n\t*numIterations = (*numIterations)+1;\n\tstd::vector<Tile*> fringe;\n\tfor (int x = -1; x <= 1; x++)\n\t{\n\t\tfor (int y = -1; y <= 1; y++)\n\t\t{\n\t\t\tfor (int z = -1; z <= 1; z++)\n\t\t\t{\n\t\t\t\tVec3<int> currentPosition = currentPath.back()->position;\n\t\t\t\tif (z == 0 && y == 0 && x == 0)\n\t\t\t\t\tcontinue;\n\t\t\t\tVec3<int> nextPosition = currentPosition;\n\t\t\t\tnextPosition.x += x;\n\t\t\t\tnextPosition.y += y;\n\t\t\t\tnextPosition.z += z;\n\t\t\t\tif (nextPosition.z < 0 || nextPosition.z >= map.size.z\n\t\t\t\t\t|| nextPosition.y < 0 || nextPosition.y >= map.size.y\n\t\t\t\t\t|| nextPosition.x < 0 || nextPosition.x >= map.size.x)\n\t\t\t\t\tcontinue;\n\t\t\t\tTile *tile = map.getTile(nextPosition);\n\t\t\t\t\/\/FIXME: Make 'blocked' tiles cleverer (e.g. don't plan around objects that will move anyway?)\n\t\t\t\tif (!tile->collideableObjects.empty())\n\t\t\t\t\tcontinue;\n\t\t\t\t\/\/Check for diagonal routes that the 'corner' tiles we touch are empty\n\t\t\t\tVec3<int> cornerPosition = currentPosition;\n\t\t\t\tcornerPosition += Vec3<int>{0,y,z};\n\t\t\t\tif (cornerPosition != currentPosition &&\n\t\t\t\t\t!map.getTile(cornerPosition)->ownedObjects.empty())\n\t\t\t\t\tcontinue;\n\t\t\t\tcornerPosition = currentPosition;\n\t\t\t\tcornerPosition += Vec3<int>{x,0,z};\n\t\t\t\tif (cornerPosition != currentPosition &&\n\t\t\t\t\t!map.getTile(cornerPosition)->ownedObjects.empty())\n\t\t\t\t\tcontinue;\n\t\t\t\tcornerPosition = currentPosition;\n\t\t\t\tcornerPosition += Vec3<int>{x,y,0};\n\t\t\t\tif (cornerPosition != currentPosition &&\n\t\t\t\t\t!map.getTile(cornerPosition)->ownedObjects.empty())\n\t\t\t\t\tcontinue;\n\t\t\t\t\/\/Already visited this tile\n\t\t\t\tif (std::find(currentPath.begin(), currentPath.end(), tile) != currentPath.end())\n\t\t\t\t\tcontinue;\n\t\t\t\tfringe.push_back(tile);\n\t\t\t}\n\t\t}\n\t}\n\tstd::sort(fringe.begin(), fringe.end(), comparer);\n\tfor (auto tile : fringe)\n\t{\n\t\tcurrentPath.push_back(tile);\n\t\tcomparer.origin = {tile->position.x, tile->position.y, tile->position.z};\n\t\tif (findNextNodeOnPath(comparer, map, currentPath, destination, numIterations))\n\t\t\treturn true;\n\t\tcurrentPath.pop_back();\n\t}\n\treturn false;\n\n}\n\n\nstd::list<Tile*>\nTileMap::findShortestPath(Vec3<int> origin, Vec3<int> destination)\n{\n\tvolatile unsigned long numIterations = 0;\n\tstd::list<Tile*> path;\n\tPathComparer pc(destination);\n\tif (origin.x < 0 || origin.x >= this->size.x\n\t\t|| origin.y < 0 || origin.y >= this->size.y\n\t\t|| origin.z < 0 || origin.z >= this->size.z)\n\t{\n\t\tLogError(\"Bad origin {%d,%d,%d}\", origin.x, origin.y, origin.z);\n\t\treturn path;\n\t}\n\tif (destination.x < 0 || destination.x >= this->size.x\n\t\t|| destination.y < 0 || destination.y >= this->size.y\n\t\t|| destination.z < 0 || destination.z >= this->size.z)\n\t{\n\t\tLogError(\"Bad destination {%d,%d,%d}\", destination.x, destination.y, destination.z);\n\t\treturn path;\n\t}\n\tpath.push_back(this->getTile(origin));\n\tif (!findNextNodeOnPath(pc, *this, path, destination, &numIterations))\n\t{\n\t\tLogWarning(\"No route found from origin {%d,%d,%d} to desination {%d,%d,%d}\", origin.x, origin.y, origin.z, destination.x, destination.y, destination.z);\n\t\tpath.clear();\n\t\treturn path;\n\t}\n\treturn path;\n}\n\n\n}; \/\/namespace OpenApoc\n<commit_msg>Fix using invalid iterators in Tilemap::Update()<commit_after>#include \"game\/tileview\/tile.h\"\n#include \"framework\/framework.h\"\n\nnamespace OpenApoc {\n\nTileMap::TileMap(Framework &fw, Vec3<int> size)\n\t: fw(fw), size(size)\n{\n\ttiles.reserve(size.z * size.y * size.z);\n\tfor (int z = 0; z < size.z; z++)\n\t{\n\t\tfor (int y = 0; y < size.y; y++)\n\t\t{\n\t\t\tfor (int x = 0; x < size.x; x++)\n\t\t\t{\n\t\t\t\ttiles.emplace_back(*this, Vec3<int>{x,y,z});\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid\nTileMap::update(unsigned int ticks)\n{\n\t\/\/Objects may remove themselves from these lists in their update functions.\n\t\/\/So we can't just use the foreach iterator stuff as we need to\n\t\/\/store the next iterator before calling update\n\tauto activeIt = this->activeObjects.begin();\n\twhile (activeIt != this->activeObjects.end())\n\t{\n\t\t\/\/Post-increment to store a copy of the 'next' object iterator\n\t\t\/\/before calling the update, as ->update() may destroy the 'current'\n\t\t\/\/iterator if it removes the object from the set\n\t\tauto objIt = activeIt++;\n\t\t(*objIt)->update(ticks);\n\t}\n\tauto projIt = this->projectiles.begin();\n\twhile (projIt != this->projectiles.end())\n\t{\n\t\tauto objIt = projIt++;\n\t\t(*objIt)->update(ticks);\n\t}\n}\n\nTile*\nTileMap::getTile(int x, int y, int z)\n{\n\tif (x >= size.x || y >= size.y || z >= size.z)\n\t{\n\t\tLogError(\"Requesting tile {%d,%d,%d} in map of size {%d,%d,%d}\",\n\t\t\tx, y, z, size.x, size.y, size.z);\n\t\treturn nullptr;\n\t}\n\treturn &this->tiles[z * size.x * size.y + y * size.x + x];\n}\n\nTile*\nTileMap::getTile(Vec3<int> pos)\n{\n\treturn getTile(pos.x, pos.y, pos.z);\n}\n\nTile*\nTileMap::getTile(Vec3<float> pos)\n{\n\treturn getTile(pos.x, pos.y, pos.z);\n}\n\nvoid\nTileMap::addObject(std::shared_ptr<TileObject> obj)\n{\n\tif (!obj->getOwningTile())\n\t{\n\t\tLogError(\"Adding object with no owner\");\n\t\tassert(0);\n\t}\n\tobj->getOwningTile()->ownedObjects.insert(obj);\n\tif (obj->isActive())\n\t\tthis->activeObjects.insert(obj);\n\tif (obj->isVisible())\n\t\tobj->getOwningTile()->visibleObjects.insert(obj);\n\tif (obj->isCollidable())\n\t\tobj->addToAffectedTiles();\n\tif (obj->isProjectile())\n\t\tthis->projectiles.insert(obj);\n\n}\n\nvoid\nTileMap::removeObject(std::shared_ptr<TileObject> obj)\n{\n\tif (!obj->getOwningTile())\n\t{\n\t\tLogError(\"Removing object with no owner\");\n\t\tassert(0);\n\t}\n\tif (obj->isActive())\n\t\tthis->activeObjects.erase(obj);\n\tif (obj->isProjectile())\n\t{\n\t\tobj->getOwningTile()->ownedProjectiles.erase(obj);\n\t\tthis->projectiles.erase(obj);\n\t}\n\tif (obj->isVisible())\n\t\tobj->getOwningTile()->visibleObjects.erase(obj);\n\tif (obj->isCollidable())\n\t\tobj->removeFromAffectedTiles();\n\tauto count = obj->getOwningTile()->ownedObjects.erase(obj);\n\tif (count != 1)\n\t{\n\t\tLogError(\"Removed %u objects from owning tile\", (unsigned)count);\n\t}\n}\n\nTileMap::~TileMap()\n{\n}\n\nTile::Tile(TileMap &map, Vec3<int> position)\n\t: map(map), position(position)\n{\n}\n\nTileObject::TileObject(TileMap &map, Vec3<float> position, bool active, bool collides, bool visible, bool projectile)\n\t: position(position), owningTile(map.getTile(position)), active(active), collides(collides), visible(visible), projectile(projectile)\n{\n\t\/\/May be called by multiple subclass constructors - don't do anything\n\t\/\/non-repeatable here\n}\n\nTileObject::~TileObject()\n{\n\n}\n\nconst Vec3<float>&\nTileObject::getPosition() const\n{\n\treturn this->position;\n}\n\nvoid\nTileObject::setPosition(Vec3<float> newPos)\n{\n\tauto thisPtr = shared_from_this();\n\tthis->position = newPos;\n\tauto &map = this->owningTile->map;\n\tauto newOwner = map.getTile(this->position);\n\tif (newOwner != this->owningTile)\n\t{\n\t\tif (this->isVisible())\n\t\t{\n\t\t\tthis->owningTile->visibleObjects.erase(thisPtr);\n\t\t\tnewOwner->visibleObjects.insert(thisPtr);\n\t\t}\n\t\tif (this->isProjectile())\n\t\t{\n\t\t\tthis->owningTile->ownedProjectiles.erase(thisPtr);\n\t\t\tnewOwner->ownedProjectiles.insert(thisPtr);\n\t\t}\n\t\tthis->owningTile->ownedObjects.erase(thisPtr);\n\t\tnewOwner->ownedObjects.insert(thisPtr);\n\t\tthis->owningTile = newOwner;\n\t}\n}\n\nvoid\nTileObject::update(unsigned int ticks)\n{\n\t\/\/Override this for active objects\n\tLogWarning(\"Called on non-active object\");\n\tassert(!this->isActive());\n\tstd::ignore = ticks;\n}\n\nstd::shared_ptr<Image>\nTileObject::getSprite()\n{\n\t\/\/Override this for visible objects\n\tLogWarning(\"Called on non-visible object\");\n\tassert(!this->isVisible());\n\treturn nullptr;\n}\n\nVec3<float>\nTileObject::getDrawPosition() const\n{\n\t\/\/Override this for visible objects\n\tLogWarning(\"Called on non-visible object\");\n\tassert(!this->isVisible());\n\treturn this->getPosition();\n}\n\nconst Vec3<int>&\nTileObject::getTileSizeInVoxels() const\n{\n\tstatic Vec3<int> invalidSize{0,0,0};\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\treturn invalidSize;\n}\n\nconst Vec3<int>&\nTileObject::getBounds() const\n{\n\tstatic Vec3<int> invalidSize{0,0,0};\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\treturn invalidSize;\n}\n\nbool\nTileObject::hasVoxelAt(const Vec3<float> &worldPosition) const\n{\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\tstd::ignore = worldPosition;\n\treturn false;\n}\n\nvoid\nTileObject::handleCollision(const Collision &c) \n{\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\tstd::ignore = c;\n\treturn;\n}\n\nvoid\nTileObject::removeFromAffectedTiles()\n{\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\treturn;\n}\n\nvoid\nTileObject::addToAffectedTiles()\n{\n\t\/\/Override this for collidable objects\n\tLogWarning(\"Called on non-collidable object\");\n\tassert(!this->isCollidable());\n\treturn;\n}\n\nvoid\nTileObject::checkProjectileCollision()\n{\n\t\/\/Override this for projectile objects\n\tLogWarning(\"Called on non-projectile object\");\n\tassert(!this->isProjectile());\n\treturn;\n}\n\nvoid\nTileObject::drawProjectile(TileView &v, Renderer &r, Vec2<int> screenPosition)\n{\n\t\/\/Override this for projectile objects\n\tLogWarning(\"Called on non-projectile object\");\n\tassert(!this->isProjectile());\n\tstd::ignore = v;\n\tstd::ignore = r;\n\tstd::ignore = screenPosition;\n\treturn;\n}\n\nclass PathComparer\n{\npublic:\n\tVec3<float> dest;\n\tVec3<float> origin;\n\tPathComparer(Vec3<int> d)\n\t\t: dest{d.x, d.y, d.z}{}\n\tbool operator() (Tile* t1, Tile* t2)\n\t{\n\t\tVec3<float> t1Pos {t1->position.x, t1->position.y, t1->position.z};\n\t\tVec3<float> t2Pos {t2->position.x, t2->position.y, t2->position.z};\n\n\t\tVec3<float> t1tod  = dest - t1Pos;\n\t\tVec3<float> t2tod  = dest - t2Pos;\n\n\t\tfloat t1cost = glm::length(t1tod);\n\t\tfloat t2cost = glm::length(t2tod);\n\n\t\tt1cost += glm::length(t1Pos-origin);\n\t\tt2cost += glm::length(t2Pos-origin);\n\n\t\treturn (t1cost < t2cost);\n\n\t}\n};\n\n#define THRESHOLD_ITERATIONS 500\n\nstatic bool findNextNodeOnPath(PathComparer &comparer, TileMap &map, std::list<Tile*> &currentPath, Vec3<int> destination, volatile unsigned long *numIterations)\n{\n\tif (currentPath.back()->position == destination)\n\t\treturn true;\n\tif (*numIterations > THRESHOLD_ITERATIONS)\n\t\treturn false;\n\t*numIterations = (*numIterations)+1;\n\tstd::vector<Tile*> fringe;\n\tfor (int x = -1; x <= 1; x++)\n\t{\n\t\tfor (int y = -1; y <= 1; y++)\n\t\t{\n\t\t\tfor (int z = -1; z <= 1; z++)\n\t\t\t{\n\t\t\t\tVec3<int> currentPosition = currentPath.back()->position;\n\t\t\t\tif (z == 0 && y == 0 && x == 0)\n\t\t\t\t\tcontinue;\n\t\t\t\tVec3<int> nextPosition = currentPosition;\n\t\t\t\tnextPosition.x += x;\n\t\t\t\tnextPosition.y += y;\n\t\t\t\tnextPosition.z += z;\n\t\t\t\tif (nextPosition.z < 0 || nextPosition.z >= map.size.z\n\t\t\t\t\t|| nextPosition.y < 0 || nextPosition.y >= map.size.y\n\t\t\t\t\t|| nextPosition.x < 0 || nextPosition.x >= map.size.x)\n\t\t\t\t\tcontinue;\n\t\t\t\tTile *tile = map.getTile(nextPosition);\n\t\t\t\t\/\/FIXME: Make 'blocked' tiles cleverer (e.g. don't plan around objects that will move anyway?)\n\t\t\t\tif (!tile->collideableObjects.empty())\n\t\t\t\t\tcontinue;\n\t\t\t\t\/\/Check for diagonal routes that the 'corner' tiles we touch are empty\n\t\t\t\tVec3<int> cornerPosition = currentPosition;\n\t\t\t\tcornerPosition += Vec3<int>{0,y,z};\n\t\t\t\tif (cornerPosition != currentPosition &&\n\t\t\t\t\t!map.getTile(cornerPosition)->ownedObjects.empty())\n\t\t\t\t\tcontinue;\n\t\t\t\tcornerPosition = currentPosition;\n\t\t\t\tcornerPosition += Vec3<int>{x,0,z};\n\t\t\t\tif (cornerPosition != currentPosition &&\n\t\t\t\t\t!map.getTile(cornerPosition)->ownedObjects.empty())\n\t\t\t\t\tcontinue;\n\t\t\t\tcornerPosition = currentPosition;\n\t\t\t\tcornerPosition += Vec3<int>{x,y,0};\n\t\t\t\tif (cornerPosition != currentPosition &&\n\t\t\t\t\t!map.getTile(cornerPosition)->ownedObjects.empty())\n\t\t\t\t\tcontinue;\n\t\t\t\t\/\/Already visited this tile\n\t\t\t\tif (std::find(currentPath.begin(), currentPath.end(), tile) != currentPath.end())\n\t\t\t\t\tcontinue;\n\t\t\t\tfringe.push_back(tile);\n\t\t\t}\n\t\t}\n\t}\n\tstd::sort(fringe.begin(), fringe.end(), comparer);\n\tfor (auto tile : fringe)\n\t{\n\t\tcurrentPath.push_back(tile);\n\t\tcomparer.origin = {tile->position.x, tile->position.y, tile->position.z};\n\t\tif (findNextNodeOnPath(comparer, map, currentPath, destination, numIterations))\n\t\t\treturn true;\n\t\tcurrentPath.pop_back();\n\t}\n\treturn false;\n\n}\n\n\nstd::list<Tile*>\nTileMap::findShortestPath(Vec3<int> origin, Vec3<int> destination)\n{\n\tvolatile unsigned long numIterations = 0;\n\tstd::list<Tile*> path;\n\tPathComparer pc(destination);\n\tif (origin.x < 0 || origin.x >= this->size.x\n\t\t|| origin.y < 0 || origin.y >= this->size.y\n\t\t|| origin.z < 0 || origin.z >= this->size.z)\n\t{\n\t\tLogError(\"Bad origin {%d,%d,%d}\", origin.x, origin.y, origin.z);\n\t\treturn path;\n\t}\n\tif (destination.x < 0 || destination.x >= this->size.x\n\t\t|| destination.y < 0 || destination.y >= this->size.y\n\t\t|| destination.z < 0 || destination.z >= this->size.z)\n\t{\n\t\tLogError(\"Bad destination {%d,%d,%d}\", destination.x, destination.y, destination.z);\n\t\treturn path;\n\t}\n\tpath.push_back(this->getTile(origin));\n\tif (!findNextNodeOnPath(pc, *this, path, destination, &numIterations))\n\t{\n\t\tLogWarning(\"No route found from origin {%d,%d,%d} to desination {%d,%d,%d}\", origin.x, origin.y, origin.z, destination.x, destination.y, destination.z);\n\t\tpath.clear();\n\t\treturn path;\n\t}\n\treturn path;\n}\n\n\n}; \/\/namespace OpenApoc\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _SDD_DD_PATH_GENERATOR_HH_\n#define _SDD_DD_PATH_GENERATOR_HH_\n\n#include <functional> \/\/ bind\n#include <cassert>\n#include <deque>\n#include <memory>\n\n#include <boost\/coroutine\/coroutine.hpp>\n\n#include \"sdd\/dd\/definition.hh\"\n#include \"sdd\/dd\/path_generator_fwd.hh\"\n\nnamespace sdd { namespace dd {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief Generate all paths of an SDD.\n\/\/\/\n\/\/\/ It uses coroutines in order to generate them on the fly. For now, it doesn't use the visitor\n\/\/\/ mechanism of mem::variant, but a manual dispatch using variant's indexes.\ntemplate <typename C>\nvoid\nxpaths_impl( typename path_generator<C>::caller_type& yield\n           , SDD<C> sdd, std::shared_ptr<path<C>> p, std::shared_ptr<sdd_stack<C>> stack)\n{\n  switch(sdd.index())\n  {\n    case (SDD<C>::hierarchical_node_index) :\n    {\n      const auto& node = sdd::mem::variant_cast<sdd::hierarchical_node<C>>(*sdd);\n      for (const auto& arc : node)\n      {\n        const auto local_stack = std::make_shared<sdd_stack<C>>(arc.successor(), stack);\n        xpaths_impl(yield, arc.valuation(), p, local_stack);\n      }\n      break;\n    }\n\n    case (SDD<C>::flat_node_index) :\n    {\n      const auto& node = sdd::mem::variant_cast<sdd::flat_node<C>>(*sdd);\n      for (const auto& arc : node)\n      {\n        p->emplace_back(arc.valuation());\n        xpaths_impl(yield, arc.successor(), p, stack);\n        p->pop_back();\n      }\n      break;\n    }\n\n    case (SDD<C>::one_terminal_index) :\n    {\n      if (stack)\n      {\n        xpaths_impl(yield, stack->sdd, p, stack->next);\n        return;\n      }\n      \/\/ end of a path\n      yield(*p);\n      break;\n    }\n\n    default \/* zero_terminal *\/ :\n    {\n      assert(p->empty() && \"Non empty path leading to |0|\");\n      yield(*p);\n    }\n  }\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::dd\n\n#endif \/\/ _SDD_DD_PATH_GENERATOR_HH_\n<commit_msg>Code cleanup (useless headers).<commit_after>#ifndef _SDD_DD_PATH_GENERATOR_HH_\n#define _SDD_DD_PATH_GENERATOR_HH_\n\n#include <cassert>\n#include <memory>\n\n#include <boost\/coroutine\/coroutine.hpp>\n\n#include \"sdd\/dd\/definition.hh\"\n#include \"sdd\/dd\/path_generator_fwd.hh\"\n\nnamespace sdd { namespace dd {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief Generate all paths of an SDD.\n\/\/\/\n\/\/\/ It uses coroutines in order to generate them on the fly. For now, it doesn't use the visitor\n\/\/\/ mechanism of mem::variant, but a manual dispatch using variant's indexes.\ntemplate <typename C>\nvoid\nxpaths_impl( typename path_generator<C>::caller_type& yield\n           , SDD<C> sdd, std::shared_ptr<path<C>> p, std::shared_ptr<sdd_stack<C>> stack)\n{\n  switch(sdd.index())\n  {\n    case (SDD<C>::hierarchical_node_index) :\n    {\n      const auto& node = sdd::mem::variant_cast<sdd::hierarchical_node<C>>(*sdd);\n      for (const auto& arc : node)\n      {\n        const auto local_stack = std::make_shared<sdd_stack<C>>(arc.successor(), stack);\n        xpaths_impl(yield, arc.valuation(), p, local_stack);\n      }\n      break;\n    }\n\n    case (SDD<C>::flat_node_index) :\n    {\n      const auto& node = sdd::mem::variant_cast<sdd::flat_node<C>>(*sdd);\n      for (const auto& arc : node)\n      {\n        p->emplace_back(arc.valuation());\n        xpaths_impl(yield, arc.successor(), p, stack);\n        p->pop_back();\n      }\n      break;\n    }\n\n    case (SDD<C>::one_terminal_index) :\n    {\n      if (stack)\n      {\n        xpaths_impl(yield, stack->sdd, p, stack->next);\n        return;\n      }\n      \/\/ end of a path\n      yield(*p);\n      break;\n    }\n\n    default \/* zero_terminal *\/ :\n    {\n      assert(p->empty() && \"Non empty path leading to |0|\");\n      yield(*p);\n    }\n  }\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::dd\n\n#endif \/\/ _SDD_DD_PATH_GENERATOR_HH_\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 <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/Language.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-base\/util\/SimpleRateLimit.h\"\n#include \"fnord-base\/InternMap.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"fnord-sstable\/sstablereader.h\"\n#include \"fnord-sstable\/sstablewriter.h\"\n#include \"fnord-sstable\/SSTableColumnSchema.h\"\n#include \"fnord-sstable\/SSTableColumnReader.h\"\n#include \"fnord-sstable\/SSTableColumnWriter.h\"\n#include <fnord-fts\/fts.h>\n#include <fnord-fts\/fts_common.h>\n#include \"fnord-eventdb\/TableReader.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n#include \"CustomerNamespace.h\"\n#include \"FeatureSchema.h\"\n#include \"JoinedQuery.h\"\n#include \"CTRCounter.h\"\n#include \"IndexReader.h\"\n#include \"analytics\/ReportBuilder.h\"\n#include \"analytics\/AnalyticsTableScanSource.h\"\n#include \"analytics\/JoinedQueryTableSource.h\"\n#include \"analytics\/CTRByPositionMapper.h\"\n#include \"analytics\/CTRByPageMapper.h\"\n#include \"analytics\/CTRBySearchQueryMapper.h\"\n#include \"analytics\/CTRByQueryAttributeMapper.h\"\n#include \"analytics\/CTRBySearchTermCrossCategoryMapper.h\"\n#include \"analytics\/CTRStatsMapper.h\"\n#include \"analytics\/CTRCounterMergeReducer.h\"\n#include \"analytics\/CTRCounterTableSink.h\"\n#include \"analytics\/CTRCounterTableSource.h\"\n#include \"analytics\/RelatedTermsMapper.h\"\n#include \"analytics\/TopCategoriesByTermMapper.h\"\n#include \"analytics\/TermInfoMergeReducer.h\"\n\nusing namespace fnord;\nusing namespace cm;\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  \/\/    \"conf\",\n  \/\/    cli::FlagParser::T_STRING,\n  \/\/    false,\n  \/\/    NULL,\n  \/\/    \".\/conf\",\n  \/\/    \"conf directory\",\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      \"replica\",\n      cli::FlagParser::T_STRING,\n      true,\n      NULL,\n      NULL,\n      \"replica id\",\n      \"<id>\");\n\n  flags.defineFlag(\n      \"datadir\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"artifact directory\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"tempdir\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"artifact directory\",\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  auto index_path = flags.getString(\"index\");\n  \/\/auto conf_path = flags.getString(\"conf\");\n  auto tempdir = flags.getString(\"tempdir\");\n  auto datadir = flags.getString(\"datadir\");\n\n  \/* open index *\/\n  auto index_reader = cm::IndexReader::openIndex(index_path);\n  \/\/auto analyzer = RefPtr<fts::Analyzer>(new fts::Analyzer(conf_path));\n\n  \/* set up reportbuilder *\/\n  cm::ReportBuilder report_builder;\n\n  auto buildid = 0;\n\n  auto table = eventdb::TableReader::open(\n      \"dawanda_joined_sessions\",\n      flags.getString(\"replica\"),\n      flags.getString(\"datadir\"),\n      joinedSessionsSchema());\n\n  auto snap = table->getSnapshot();\n\n  Set<String> searchterm_x_e1_tables;\n  Set<String> related_terms_tables;\n\n  for (const auto& c : snap->head->chunks) {\n    auto input_table = StringUtil::format(\n        \"$0\/$1.$2.$3.cst\",\n        datadir,\n        \"dawanda_joined_sessions\",\n        c.replica_id,\n        c.chunk_id);\n\n    \/* map related terms *\/\n    auto related_terms_table = StringUtil::format(\n        \"$0\/dawanda_related_terms.$1.$2.sst\",\n        tempdir,\n        c.replica_id,\n        c.chunk_id);\n\n    related_terms_tables.emplace(related_terms_table);\n    report_builder.addReport(\n        new RelatedTermsMapper(\n            new AnalyticsTableScanSource(input_table),\n            new CTRCounterTableSink(0, 0, related_terms_table)));\n\n    \/* map serchterm x e1 *\/\n    auto searchterm_x_e1_table = StringUtil::format(\n        \"$0\/dawanda_ctr_by_searchterm_cross_e1.$1.$2.sst\",\n        tempdir,\n        c.replica_id,\n        c.chunk_id);\n\n    searchterm_x_e1_tables.emplace(searchterm_x_e1_table);\n    report_builder.addReport(\n        new CTRBySearchTermCrossCategoryMapper(\n            new AnalyticsTableScanSource(input_table),\n            new CTRCounterTableSink(0, 0, searchterm_x_e1_table),\n            \"category1\",\n            index_reader));\n  }\n\n  report_builder.addReport(\n      new TermInfoMergeReducer(\n          new TermInfoTableSource(related_terms_tables),\n          new TermInfoTableSink(\n              StringUtil::format(\n                  \"$0\/dawanda_related_terms.$1.sstable\",\n                  tempdir,\n                  buildid))));\n\n  report_builder.addReport(\n      new TermInfoMergeReducer(\n          new TermInfoTableSource(searchterm_x_e1_tables),\n          new TermInfoTableSink(\n              StringUtil::format(\n                  \"$0\/dawanda_top_cats_by_searchterm_e1.$1.sstable\",\n                  tempdir,\n                  buildid))));\n\n  report_builder.addReport(\n      new TermInfoMergeReducer(\n          new TermInfoTableSource(Set<String> {\n            StringUtil::format(\n                  \"$0\/dawanda_related_terms.$1.sstable\",\n                  tempdir,\n                  buildid),\n            StringUtil::format(\n                  \"$0\/dawanda_top_cats_by_searchterm_e1.$1.sstable\",\n                  tempdir,\n                  buildid)\n          }),\n          new TermInfoTableSink(\n              StringUtil::format(\n                  \"$0\/dawanda_termstats.$1.sstable\",\n                  tempdir,\n                  buildid))));\n\n  report_builder.buildAll();\n\n  fnord::logInfo(\n      \"cm.reportbuild\",\n      \"Build completed: dawanda_termstats.$0.sstable\",\n      buildid);\n\n  return 0;\n}\n\n<commit_msg>RelatedTermsMapper...<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 <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/Language.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-base\/util\/SimpleRateLimit.h\"\n#include \"fnord-base\/InternMap.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"fnord-sstable\/sstablereader.h\"\n#include \"fnord-sstable\/sstablewriter.h\"\n#include \"fnord-sstable\/SSTableColumnSchema.h\"\n#include \"fnord-sstable\/SSTableColumnReader.h\"\n#include \"fnord-sstable\/SSTableColumnWriter.h\"\n#include <fnord-fts\/fts.h>\n#include <fnord-fts\/fts_common.h>\n#include \"fnord-eventdb\/TableReader.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n#include \"CustomerNamespace.h\"\n#include \"FeatureSchema.h\"\n#include \"JoinedQuery.h\"\n#include \"CTRCounter.h\"\n#include \"IndexReader.h\"\n#include \"analytics\/ReportBuilder.h\"\n#include \"analytics\/AnalyticsTableScanSource.h\"\n#include \"analytics\/JoinedQueryTableSource.h\"\n#include \"analytics\/CTRByPositionMapper.h\"\n#include \"analytics\/CTRByPageMapper.h\"\n#include \"analytics\/CTRBySearchQueryMapper.h\"\n#include \"analytics\/CTRByQueryAttributeMapper.h\"\n#include \"analytics\/CTRBySearchTermCrossCategoryMapper.h\"\n#include \"analytics\/CTRStatsMapper.h\"\n#include \"analytics\/CTRCounterMergeReducer.h\"\n#include \"analytics\/CTRCounterTableSink.h\"\n#include \"analytics\/CTRCounterTableSource.h\"\n#include \"analytics\/RelatedTermsMapper.h\"\n#include \"analytics\/TopCategoriesByTermMapper.h\"\n#include \"analytics\/TermInfoMergeReducer.h\"\n\nusing namespace fnord;\nusing namespace cm;\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  \/\/    \"conf\",\n  \/\/    cli::FlagParser::T_STRING,\n  \/\/    false,\n  \/\/    NULL,\n  \/\/    \".\/conf\",\n  \/\/    \"conf directory\",\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      \"replica\",\n      cli::FlagParser::T_STRING,\n      true,\n      NULL,\n      NULL,\n      \"replica id\",\n      \"<id>\");\n\n  flags.defineFlag(\n      \"datadir\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"artifact directory\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"tempdir\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"artifact directory\",\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  auto index_path = flags.getString(\"index\");\n  \/\/auto conf_path = flags.getString(\"conf\");\n  auto tempdir = flags.getString(\"tempdir\");\n  auto datadir = flags.getString(\"datadir\");\n\n  \/* open index *\/\n  auto index_reader = cm::IndexReader::openIndex(index_path);\n  \/\/auto analyzer = RefPtr<fts::Analyzer>(new fts::Analyzer(conf_path));\n\n  \/* set up reportbuilder *\/\n  cm::ReportBuilder report_builder;\n\n  auto buildid = 0;\n\n  auto table = eventdb::TableReader::open(\n      \"dawanda_joined_sessions\",\n      flags.getString(\"replica\"),\n      flags.getString(\"datadir\"),\n      joinedSessionsSchema());\n\n  auto snap = table->getSnapshot();\n\n  Set<String> searchterm_x_e1_tables;\n  Set<String> related_terms_tables;\n\n  for (const auto& c : snap->head->chunks) {\n    auto input_table = StringUtil::format(\n        \"$0\/$1.$2.$3.cst\",\n        datadir,\n        \"dawanda_joined_sessions\",\n        c.replica_id,\n        c.chunk_id);\n\n    \/* map related terms *\/\n    auto related_terms_table = StringUtil::format(\n        \"$0\/dawanda_related_terms.$1.$2.sst\",\n        tempdir,\n        c.replica_id,\n        c.chunk_id);\n\n    related_terms_tables.emplace(related_terms_table);\n    report_builder.addReport(\n        new RelatedTermsMapper(\n            new AnalyticsTableScanSource(input_table),\n            new TermInfoTableSink(related_terms_table)));\n\n    \/* map serchterm x e1 *\/\n    auto searchterm_x_e1_table = StringUtil::format(\n        \"$0\/dawanda_ctr_by_searchterm_cross_e1.$1.$2.sst\",\n        tempdir,\n        c.replica_id,\n        c.chunk_id);\n\n    searchterm_x_e1_tables.emplace(searchterm_x_e1_table);\n    report_builder.addReport(\n        new CTRBySearchTermCrossCategoryMapper(\n            new AnalyticsTableScanSource(input_table),\n            new CTRCounterTableSink(0, 0, searchterm_x_e1_table),\n            \"category1\",\n            index_reader));\n  }\n\n  report_builder.addReport(\n      new TermInfoMergeReducer(\n          new TermInfoTableSource(related_terms_tables),\n          new TermInfoTableSink(\n              StringUtil::format(\n                  \"$0\/dawanda_related_terms.$1.sstable\",\n                  tempdir,\n                  buildid))));\n\n  report_builder.addReport(\n      new TopCategoriesByTermMapper(\n          new CTRCounterTableSource(searchterm_x_e1_tables),\n          new TermInfoTableSink(\n              StringUtil::format(\n                  \"$0\/dawanda_top_cats_by_searchterm_e1.$1.sstable\",\n                  tempdir,\n                  buildid)),\n          \"e1-\"));\n\n  report_builder.addReport(\n      new TermInfoMergeReducer(\n          new TermInfoTableSource(Set<String> {\n            StringUtil::format(\n                  \"$0\/dawanda_related_terms.$1.sstable\",\n                  tempdir,\n                  buildid),\n            StringUtil::format(\n                  \"$0\/dawanda_top_cats_by_searchterm_e1.$1.sstable\",\n                  tempdir,\n                  buildid)\n          }),\n          new TermInfoTableSink(\n              StringUtil::format(\n                  \"$0\/dawanda_termstats.$1.sstable\",\n                  tempdir,\n                  buildid))));\n\n  report_builder.buildAll();\n\n  fnord::logInfo(\n      \"cm.reportbuild\",\n      \"Build completed: dawanda_termstats.$0.sstable\",\n      buildid);\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2018 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 \"config.h\"\n\n#include \"file_handler.hpp\"\n#include \"firmware_handler.hpp\"\n#include \"flags.hpp\"\n#include \"image_handler.hpp\"\n#include \"lpc_aspeed.hpp\"\n#include \"lpc_handler.hpp\"\n#include \"lpc_nuvoton.hpp\"\n#include \"pci_handler.hpp\"\n#include \"prepare_systemd.hpp\"\n#include \"status.hpp\"\n#include \"update_systemd.hpp\"\n#include \"util.hpp\"\n#include \"verify_systemd.hpp\"\n\n#include <cstdint>\n#include <memory>\n#include <phosphor-logging\/log.hpp>\n#include <sdbusplus\/bus.hpp>\n#include <unordered_map>\n\nnamespace ipmi_flash\n{\nnamespace\n{\n\n\/* The maximum external buffer size we expect is 64KB. *\/\nstatic constexpr std::size_t memoryRegionSize = 64 * 1024UL;\n\n#ifdef ENABLE_LPC_BRIDGE\n#if defined(ASPEED_LPC)\nLpcDataHandler lpcDataHandler(\n    LpcMapperAspeed::createAspeedMapper(MAPPED_ADDRESS, memoryRegionSize));\n#elif defined(NUVOTON_LPC)\nLpcDataHandler lpcDataHandler(\n    LpcMapperNuvoton::createNuvotonMapper(MAPPED_ADDRESS, memoryRegionSize));\n#else\n#error \"You must specify a hardware implementation.\"\n#endif\n#endif\n\n#ifdef ENABLE_PCI_BRIDGE\n#if defined(ASPEED_P2A)\nPciDataHandler pciDataHandler(MAPPED_ADDRESS, memoryRegionSize);\n#else\n#error \"You must specify a hardware implementation.\"\n#endif\n#endif\n\nstd::vector<DataHandlerPack> supportedTransports = {\n    {FirmwareFlags::UpdateFlags::ipmi, nullptr},\n#ifdef ENABLE_PCI_BRIDGE\n    {FirmwareFlags::UpdateFlags::p2a, &pciDataHandler},\n#endif\n#ifdef ENABLE_LPC_BRIDGE\n    {FirmwareFlags::UpdateFlags::lpc, &lpcDataHandler},\n#endif\n};\n\n} \/\/ namespace\n} \/\/ namespace ipmi_flash\n\nextern \"C\" {\nstd::unique_ptr<blobs::GenericBlobInterface> createHandler();\n}\n\nstd::unique_ptr<blobs::GenericBlobInterface> createHandler()\n{\n    ipmi_flash::ActionMap actionPacks = {};\n\n#ifdef ENABLE_REBOOT_UPDATE\n    static constexpr auto rebootTarget = \"reboot.target\";\n    static constexpr auto rebootMode = \"replace-irreversibly\";\n\n    auto updater = ipmi_flash::SystemdUpdateMechanism::CreateSystemdUpdate(\n        sdbusplus::bus::new_default(), rebootTarget, rebootMode);\n#else\n    auto updater = ipmi_flash::SystemdUpdateMechanism::CreateSystemdUpdate(\n        sdbusplus::bus::new_default(), UPDATE_DBUS_SERVICE);\n#endif\n\n    auto prepare = ipmi_flash::SystemdPreparation::CreatePreparation(\n        sdbusplus::bus::new_default(), PREPARATION_DBUS_SERVICE);\n\n    auto verifier = ipmi_flash::SystemdVerification::CreateVerification(\n        sdbusplus::bus::new_default(), VERIFY_STATUS_FILENAME,\n        VERIFY_DBUS_SERVICE);\n\n    \/* TODO: for bios should the name be, bios or \/flash\/bios?, these are\n     * \/flash\/... and it simplifies a few other things later (open\/etc)\n     *\/\n    std::string bmcName;\n#ifdef ENABLE_STATIC_LAYOUT\n    bmcName = ipmi_flash::staticLayoutBlobId;\n#endif\n#ifdef ENABLE_TARBALL_UBI\n    bmcName = ipmi_flash::ubiTarballBlobId;\n#endif\n\n    auto bmcPack = std::make_unique<ipmi_flash::ActionPack>();\n    bmcPack->preparation = std::move(prepare);\n    bmcPack->verification = std::move(verifier);\n    bmcPack->update = std::move(updater);\n    actionPacks[bmcName] = std::move(bmcPack);\n\n#ifdef ENABLE_HOST_BIOS\n    {\n        auto biosPack = std::make_unique<ipmi_flash::ActionPack>();\n\n        biosPack->preparation =\n            ipmi_flash::SystemdPreparation::CreatePreparation(\n                sdbusplus::bus::new_default(), PREPARATION_BIOS_TARGET);\n\n        biosPack->verification =\n            ipmi_flash::SystemdVerification::CreateVerification(\n                sdbusplus::bus::new_default(), BIOS_VERIFY_STATUS_FILENAME,\n                VERIFY_BIOS_TARGET);\n\n        biosPack->update =\n            ipmi_flash::SystemdUpdateMechanism::CreateSystemdUpdate(\n                sdbusplus::bus::new_default(), UPDATE_BIOS_TARGET);\n\n        actionPacks[ipmi_flash::biosBlobId] = std::move(biosPack);\n    }\n#endif\n\n    std::vector<ipmi_flash::HandlerPack> supportedFirmware;\n\n    supportedFirmware.push_back(std::move(ipmi_flash::HandlerPack(\n        ipmi_flash::hashBlobId,\n        std::make_unique<ipmi_flash::FileHandler>(HASH_FILENAME))));\n\n#ifdef ENABLE_STATIC_LAYOUT\n    supportedFirmware.push_back(std::move(\n        ipmi_flash::HandlerPack(ipmi_flash::staticLayoutBlobId,\n                                std::make_unique<ipmi_flash::FileHandler>(\n                                    STATIC_HANDLER_STAGED_NAME))));\n#endif\n#ifdef ENABLE_TARBALL_UBI\n    supportedFirmware.push_back(std::move(ipmi_flash::HandlerPack(\n        ipmi_flash::ubiTarballBlobId,\n        std::make_unique<ipmi_flash::FileHandler>(TARBALL_STAGED_NAME))));\n#endif\n#ifdef ENABLE_HOST_BIOS\n    supportedFirmware.push_back(std::move(ipmi_flash::HandlerPack(\n        ipmi_flash::biosBlobId,\n        std::make_unique<ipmi_flash::FileHandler>(BIOS_STAGED_NAME))));\n#endif\n\n    auto handler = ipmi_flash::FirmwareBlobHandler::CreateFirmwareBlobHandler(\n        std::move(supportedFirmware), ipmi_flash::supportedTransports,\n        std::move(actionPacks));\n\n    if (!handler)\n    {\n        using namespace phosphor::logging;\n\n        log<level::ERR>(\"Firmware Handler has invalid configuration\");\n        return nullptr;\n    }\n\n    return handler;\n}\n<commit_msg>bmc: consolidate action pack code slightly<commit_after>\/*\n * Copyright 2018 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 \"config.h\"\n\n#include \"file_handler.hpp\"\n#include \"firmware_handler.hpp\"\n#include \"flags.hpp\"\n#include \"image_handler.hpp\"\n#include \"lpc_aspeed.hpp\"\n#include \"lpc_handler.hpp\"\n#include \"lpc_nuvoton.hpp\"\n#include \"pci_handler.hpp\"\n#include \"prepare_systemd.hpp\"\n#include \"status.hpp\"\n#include \"update_systemd.hpp\"\n#include \"util.hpp\"\n#include \"verify_systemd.hpp\"\n\n#include <cstdint>\n#include <memory>\n#include <phosphor-logging\/log.hpp>\n#include <sdbusplus\/bus.hpp>\n#include <unordered_map>\n\nnamespace ipmi_flash\n{\nnamespace\n{\n\n\/* The maximum external buffer size we expect is 64KB. *\/\nstatic constexpr std::size_t memoryRegionSize = 64 * 1024UL;\n\n#ifdef ENABLE_LPC_BRIDGE\n#if defined(ASPEED_LPC)\nLpcDataHandler lpcDataHandler(\n    LpcMapperAspeed::createAspeedMapper(MAPPED_ADDRESS, memoryRegionSize));\n#elif defined(NUVOTON_LPC)\nLpcDataHandler lpcDataHandler(\n    LpcMapperNuvoton::createNuvotonMapper(MAPPED_ADDRESS, memoryRegionSize));\n#else\n#error \"You must specify a hardware implementation.\"\n#endif\n#endif\n\n#ifdef ENABLE_PCI_BRIDGE\n#if defined(ASPEED_P2A)\nPciDataHandler pciDataHandler(MAPPED_ADDRESS, memoryRegionSize);\n#else\n#error \"You must specify a hardware implementation.\"\n#endif\n#endif\n\nstd::vector<DataHandlerPack> supportedTransports = {\n    {FirmwareFlags::UpdateFlags::ipmi, nullptr},\n#ifdef ENABLE_PCI_BRIDGE\n    {FirmwareFlags::UpdateFlags::p2a, &pciDataHandler},\n#endif\n#ifdef ENABLE_LPC_BRIDGE\n    {FirmwareFlags::UpdateFlags::lpc, &lpcDataHandler},\n#endif\n};\n\n\/**\n * Given a name and path, create a HandlerPack.\n *\n * @param[in] name - the blob id path for this\n * @param[in] path - the file path to write the contents.\n * @return the HandlerPack.\n *\/\nHandlerPack CreateFileHandlerPack(const std::string& name,\n                                  const std::string& path)\n{\n    return HandlerPack(name, std::make_unique<FileHandler>(path));\n}\n\n} \/\/ namespace\n} \/\/ namespace ipmi_flash\n\nextern \"C\" {\nstd::unique_ptr<blobs::GenericBlobInterface> createHandler();\n}\n\nstd::unique_ptr<blobs::GenericBlobInterface> createHandler()\n{\n    ipmi_flash::ActionMap actionPacks = {};\n\n    {\n        auto bmcPack = std::make_unique<ipmi_flash::ActionPack>();\n\n#ifdef ENABLE_REBOOT_UPDATE\n        static constexpr auto rebootTarget = \"reboot.target\";\n        static constexpr auto rebootMode = \"replace-irreversibly\";\n\n        bmcPack->update =\n            ipmi_flash::SystemdUpdateMechanism::CreateSystemdUpdate(\n                sdbusplus::bus::new_default(), rebootTarget, rebootMode);\n#else\n        bmcPack->update =\n            ipmi_flash::SystemdUpdateMechanism::CreateSystemdUpdate(\n                sdbusplus::bus::new_default(), UPDATE_DBUS_SERVICE);\n#endif\n\n        bmcPack->preparation =\n            ipmi_flash::SystemdPreparation::CreatePreparation(\n                sdbusplus::bus::new_default(), PREPARATION_DBUS_SERVICE);\n\n        bmcPack->verification =\n            ipmi_flash::SystemdVerification::CreateVerification(\n                sdbusplus::bus::new_default(), VERIFY_STATUS_FILENAME,\n                VERIFY_DBUS_SERVICE);\n\n        std::string bmcName;\n#ifdef ENABLE_STATIC_LAYOUT\n        bmcName = ipmi_flash::staticLayoutBlobId;\n#endif\n#ifdef ENABLE_TARBALL_UBI\n        bmcName = ipmi_flash::ubiTarballBlobId;\n#endif\n\n        actionPacks[bmcName] = std::move(bmcPack);\n    }\n\n#ifdef ENABLE_HOST_BIOS\n    {\n        auto biosPack = std::make_unique<ipmi_flash::ActionPack>();\n\n        biosPack->preparation =\n            ipmi_flash::SystemdPreparation::CreatePreparation(\n                sdbusplus::bus::new_default(), PREPARATION_BIOS_TARGET);\n\n        biosPack->verification =\n            ipmi_flash::SystemdVerification::CreateVerification(\n                sdbusplus::bus::new_default(), BIOS_VERIFY_STATUS_FILENAME,\n                VERIFY_BIOS_TARGET);\n\n        biosPack->update =\n            ipmi_flash::SystemdUpdateMechanism::CreateSystemdUpdate(\n                sdbusplus::bus::new_default(), UPDATE_BIOS_TARGET);\n\n        actionPacks[ipmi_flash::biosBlobId] = std::move(biosPack);\n    }\n#endif\n\n    std::vector<ipmi_flash::HandlerPack> supportedFirmware;\n\n    supportedFirmware.push_back(std::move(ipmi_flash::CreateFileHandlerPack(\n        ipmi_flash::hashBlobId, HASH_FILENAME)));\n\n#ifdef ENABLE_STATIC_LAYOUT\n    supportedFirmware.push_back(std::move(ipmi_flash::CreateFileHandlerPack(\n        ipmi_flash::staticLayoutBlobId, STATIC_HANDLER_STAGED_NAME)));\n#endif\n#ifdef ENABLE_TARBALL_UBI\n    supportedFirmware.push_back(std::move(ipmi_flash::CreateFileHandlerPack(\n        ipmi_flash::ubiTarballBlobId, TARBALL_STAGED_NAME)));\n#endif\n#ifdef ENABLE_HOST_BIOS\n    supportedFirmware.push_back(std::move(ipmi_flash::CreateFileHandlerPack(\n        ipmi_flash::biosBlobId, BIOS_STAGED_NAME)));\n#endif\n\n    auto handler = ipmi_flash::FirmwareBlobHandler::CreateFirmwareBlobHandler(\n        std::move(supportedFirmware), ipmi_flash::supportedTransports,\n        std::move(actionPacks));\n\n    if (!handler)\n    {\n        using namespace phosphor::logging;\n\n        log<level::ERR>(\"Firmware Handler has invalid configuration\");\n        return nullptr;\n    }\n\n    return handler;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2021-2022 ArangoDB 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 Lars Maier\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"Logger\/LogMacros.h\"\n#include \"UpdateReplicatedState.h\"\n#include \"Replication2\/ReplicatedState\/StateCommon.h\"\n#include \"Basics\/voc-errors.h\"\n#include \"Logger\/LogContextKeys.h\"\n\nusing namespace arangodb::replication2;\nusing namespace arangodb::replication2::replicated_state;\n\nauto algorithms::updateReplicatedState(\n    StateActionContext& ctx, std::string const& serverId, LogId id,\n    replicated_state::agency::Plan const* spec,\n    replicated_state::agency::Current const* current) -> arangodb::Result {\n  if (spec == nullptr) {\n    return ctx.dropReplicatedState(id);\n  }\n\n  TRI_ASSERT(id == spec->id);\n  TRI_ASSERT(spec->participants.contains(serverId));\n  auto expectedGeneration = spec->participants.at(serverId).generation;\n\n  auto logCtx =\n      LoggerContext(Logger::REPLICATED_STATE).with<logContextKeyLogId>(id);\n\n  LOG_CTX(\"b089c\", TRACE, logCtx) << \"Update replicated log\" << id\n                                  << \" for generation \" << expectedGeneration;\n\n  auto state = ctx.getReplicatedStateById(id);\n  if (state == nullptr) {\n    \/\/ TODO use user data instead of non-slice\n    auto result =\n        ctx.createReplicatedState(id, spec->properties.implementation.type,\n                                  velocypack::Slice::noneSlice());\n    if (result.fail()) {\n      return result.result();\n    }\n\n    state = result.get();\n\n    auto token = std::invoke([&] {\n      if (current) {\n        if (auto const p = current->participants.find(serverId);\n            p != std::end(current->participants)) {\n          if (p->second.generation == expectedGeneration) {\n            LOG_CTX(\"19d00\", DEBUG, logCtx)\n                << \"Using existing snapshot information from current\";\n            \/\/ we are allowed to use the information stored here\n            return std::make_unique<ReplicatedStateToken>(\n                ReplicatedStateToken::withExplicitSnapshotStatus(\n                    expectedGeneration, p->second.snapshot));\n          } else {\n            LOG_CTX(\"6d8c9\", DEBUG, logCtx)\n                << \"Must not use existing information, generation is \"\n                   \"different. \"\n                << \"Plan = \" << expectedGeneration\n                << \" but Current = \" << p->second.generation;\n          }\n        } else {\n          LOG_CTX(\"cef1a\", DEBUG, logCtx)\n              << \"No snapshot information available for this server \"\n              << serverId;\n        }\n      } else {\n        LOG_CTX(\"d4fd8\", DEBUG, logCtx)\n            << \"no current available to read snapshot information from. \"\n               \"Assuming no snapshot available\";\n      }\n\n      return std::make_unique<ReplicatedStateToken>(expectedGeneration);\n    });\n    \/\/ now start the replicated state\n    state->start(std::move(token));\n    return {TRI_ERROR_NO_ERROR};\n  } else {\n    auto status = state->getStatus();\n    if (status.has_value()) {\n      auto generation = status.value().getGeneration();\n      if (generation != expectedGeneration) {\n        state->flush(expectedGeneration);\n      }\n    } else if (!spec->participants.contains(serverId)) {\n      ctx.dropReplicatedState(id);\n    }\n    return {TRI_ERROR_NO_ERROR};\n  }\n}\n<commit_msg>Removed dead code (#16088)<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2021-2022 ArangoDB 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 Lars Maier\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"Logger\/LogMacros.h\"\n#include \"UpdateReplicatedState.h\"\n#include \"Replication2\/ReplicatedState\/StateCommon.h\"\n#include \"Basics\/voc-errors.h\"\n#include \"Logger\/LogContextKeys.h\"\n\nusing namespace arangodb::replication2;\nusing namespace arangodb::replication2::replicated_state;\n\nauto algorithms::updateReplicatedState(\n    StateActionContext& ctx, std::string const& serverId, LogId id,\n    replicated_state::agency::Plan const* spec,\n    replicated_state::agency::Current const* current) -> arangodb::Result {\n  if (spec == nullptr) {\n    return ctx.dropReplicatedState(id);\n  }\n\n  TRI_ASSERT(id == spec->id);\n  TRI_ASSERT(spec->participants.contains(serverId));\n  auto expectedGeneration = spec->participants.at(serverId).generation;\n\n  auto logCtx =\n      LoggerContext(Logger::REPLICATED_STATE).with<logContextKeyLogId>(id);\n\n  LOG_CTX(\"b089c\", TRACE, logCtx) << \"Update replicated log\" << id\n                                  << \" for generation \" << expectedGeneration;\n\n  auto state = ctx.getReplicatedStateById(id);\n  if (state == nullptr) {\n    \/\/ TODO use user data instead of non-slice\n    auto result =\n        ctx.createReplicatedState(id, spec->properties.implementation.type,\n                                  velocypack::Slice::noneSlice());\n    if (result.fail()) {\n      return result.result();\n    }\n\n    state = result.get();\n\n    auto token = std::invoke([&] {\n      if (current) {\n        if (auto const p = current->participants.find(serverId);\n            p != std::end(current->participants)) {\n          if (p->second.generation == expectedGeneration) {\n            LOG_CTX(\"19d00\", DEBUG, logCtx)\n                << \"Using existing snapshot information from current\";\n            \/\/ we are allowed to use the information stored here\n            return std::make_unique<ReplicatedStateToken>(\n                ReplicatedStateToken::withExplicitSnapshotStatus(\n                    expectedGeneration, p->second.snapshot));\n          } else {\n            LOG_CTX(\"6d8c9\", DEBUG, logCtx)\n                << \"Must not use existing information, generation is \"\n                   \"different. \"\n                << \"Plan = \" << expectedGeneration\n                << \" but Current = \" << p->second.generation;\n          }\n        } else {\n          LOG_CTX(\"cef1a\", DEBUG, logCtx)\n              << \"No snapshot information available for this server \"\n              << serverId;\n        }\n      } else {\n        LOG_CTX(\"d4fd8\", DEBUG, logCtx)\n            << \"no current available to read snapshot information from. \"\n               \"Assuming no snapshot available\";\n      }\n\n      return std::make_unique<ReplicatedStateToken>(expectedGeneration);\n    });\n    \/\/ now start the replicated state\n    state->start(std::move(token));\n    return {TRI_ERROR_NO_ERROR};\n  } else {\n    auto status = state->getStatus();\n    if (status.has_value()) {\n      auto generation = status.value().getGeneration();\n      if (generation != expectedGeneration) {\n        state->flush(expectedGeneration);\n      }\n    }\n    return {TRI_ERROR_NO_ERROR};\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>document with unit test rather odd embedded null handling<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: Ref.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 01:35:34 $\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_JAVA_SQL_REF_HXX_\n#include \"java\/sql\/Ref.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_TOOLS_HXX_\n#include \"java\/tools.hxx\"\n#endif\nusing namespace connectivity;\n\/\/**************************************************************\n\/\/************ Class: java.sql.Ref\n\/\/**************************************************************\n\njclass java_sql_Ref::theClass = 0;\njava_sql_Ref::java_sql_Ref( JNIEnv * pEnv, jobject myObj )\n: java_lang_Object( pEnv, myObj )\n{\n    SDBThreadAttach::addRef();\n}\njava_sql_Ref::~java_sql_Ref()\n{\n    SDBThreadAttach::releaseRef();\n}\n\njclass java_sql_Ref::getMyClass()\n{\n    \/\/ die Klasse muss nur einmal geholt werden, daher statisch\n    if( !theClass ){\n        SDBThreadAttach t;\n        if( !t.pEnv ) return (jclass)NULL;\n        jclass tempClass = t.pEnv->FindClass( \"java\/sql\/Ref\" );\n        jclass globClass = (jclass)t.pEnv->NewGlobalRef( tempClass );\n        t.pEnv->DeleteLocalRef( tempClass );\n        saveClassRef( globClass );\n    }\n    return theClass;\n}\n\nvoid java_sql_Ref::saveClassRef( jclass pClass )\n{\n    if( pClass==NULL  )\n        return;\n    \/\/ der uebergebe Klassen-Handle ist schon global, daher einfach speichern\n    theClass = pClass;\n}\n\n::rtl::OUString SAL_CALL java_sql_Ref::getBaseTypeName(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException)\n{\n    SDBThreadAttach t; OSL_ENSURE(t.pEnv,\"Java Enviroment geloescht worden!\");\n    ::rtl::OUString aStr;\n    if( t.pEnv ){\n        \/\/ temporaere Variable initialisieren\n        static const char * cSignature = \"()Ljava\/lang\/String;\";\n        static const char * cMethodName = \"getBaseTypeName\";\n        \/\/ Java-Call absetzen\n        static jmethodID mID = NULL;\n        if ( !mID  )\n            mID  = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n        if( mID ){\n            jstring out = (jstring)t.pEnv->CallObjectMethod( object, mID);\n            ThrowSQLException(t.pEnv,*this);\n            aStr = JavaString2String(t.pEnv,out);\n            \/\/ und aufraeumen\n        } \/\/mID\n    } \/\/t.pEnv\n    \/\/ ACHTUNG: der Aufrufer wird Eigentuemer des zurueckgelieferten Zeigers !!!\n    return  aStr;\n}\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.8.60); FILE MERGED 2006\/09\/01 17:22:21 kaib 1.8.60.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: Ref.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 02:48: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_connectivity.hxx\"\n\n#ifndef _CONNECTIVITY_JAVA_SQL_REF_HXX_\n#include \"java\/sql\/Ref.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_TOOLS_HXX_\n#include \"java\/tools.hxx\"\n#endif\nusing namespace connectivity;\n\/\/**************************************************************\n\/\/************ Class: java.sql.Ref\n\/\/**************************************************************\n\njclass java_sql_Ref::theClass = 0;\njava_sql_Ref::java_sql_Ref( JNIEnv * pEnv, jobject myObj )\n: java_lang_Object( pEnv, myObj )\n{\n    SDBThreadAttach::addRef();\n}\njava_sql_Ref::~java_sql_Ref()\n{\n    SDBThreadAttach::releaseRef();\n}\n\njclass java_sql_Ref::getMyClass()\n{\n    \/\/ die Klasse muss nur einmal geholt werden, daher statisch\n    if( !theClass ){\n        SDBThreadAttach t;\n        if( !t.pEnv ) return (jclass)NULL;\n        jclass tempClass = t.pEnv->FindClass( \"java\/sql\/Ref\" );\n        jclass globClass = (jclass)t.pEnv->NewGlobalRef( tempClass );\n        t.pEnv->DeleteLocalRef( tempClass );\n        saveClassRef( globClass );\n    }\n    return theClass;\n}\n\nvoid java_sql_Ref::saveClassRef( jclass pClass )\n{\n    if( pClass==NULL  )\n        return;\n    \/\/ der uebergebe Klassen-Handle ist schon global, daher einfach speichern\n    theClass = pClass;\n}\n\n::rtl::OUString SAL_CALL java_sql_Ref::getBaseTypeName(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException)\n{\n    SDBThreadAttach t; OSL_ENSURE(t.pEnv,\"Java Enviroment geloescht worden!\");\n    ::rtl::OUString aStr;\n    if( t.pEnv ){\n        \/\/ temporaere Variable initialisieren\n        static const char * cSignature = \"()Ljava\/lang\/String;\";\n        static const char * cMethodName = \"getBaseTypeName\";\n        \/\/ Java-Call absetzen\n        static jmethodID mID = NULL;\n        if ( !mID  )\n            mID  = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n        if( mID ){\n            jstring out = (jstring)t.pEnv->CallObjectMethod( object, mID);\n            ThrowSQLException(t.pEnv,*this);\n            aStr = JavaString2String(t.pEnv,out);\n            \/\/ und aufraeumen\n        } \/\/mID\n    } \/\/t.pEnv\n    \/\/ ACHTUNG: der Aufrufer wird Eigentuemer des zurueckgelieferten Zeigers !!!\n    return  aStr;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\r\n#include \"OptFossilCollManagerFactory.h\"\r\n#include \"ChebyFossilCollManager.h\"\r\n#include \"SimulationConfiguration.h\"\r\n#include \"TimeWarpConfigurationManager.h\"\r\n#include \"ThreadedTimeWarpSimulationManager.h\"\r\n#include \"ThreadedChebyFossilCollManager.h\"\r\n#include <WarpedDebug.h>\r\n\r\nOptFossilCollManagerFactory::OptFossilCollManagerFactory(){}\r\n\r\nOptFossilCollManagerFactory::~OptFossilCollManagerFactory(){\r\n  \/\/ myFossilManager will be deleted by the end user - the\r\n  \/\/ TimeWarpSimulationManager\r\n}\r\n\r\nConfigurable *\r\nOptFossilCollManagerFactory::allocate(SimulationConfiguration &configuration,\r\n\t\tConfigurable *parent) const {\r\n\tConfigurable *retval = NULL;\r\n\tTimeWarpSimulationManager *mySimulationManager =\r\n\t\t\tdynamic_cast<TimeWarpSimulationManager *> (parent);\r\n\tThreadedTimeWarpSimulationManager *myThreadedSimulationManager =\r\n\t\t\tdynamic_cast<ThreadedTimeWarpSimulationManager *> (parent);\r\n\r\n\tASSERT( mySimulationManager != NULL );\r\n\t\/\/ the following cases are possible:\r\n\r\n\t\/\/ (1) Manager is Cheby.\r\n\t\/\/ (2) None is used.\r\n\r\n    std::string optFossilCollManagerType = configuration.get_string(\r\n    \t{\"TimeWarp\", \"OptFossilCollManager\", \"Type\"}, \"None\");\r\n    std::string simulationType = configuration.get_string({\"Simulation\"}, \"Sequential\");\r\n\tif (optFossilCollManagerType == \"Cheby\") {\r\n\t\tunsigned int checkpointPeriod = 1000;\r\n\t\tunsigned int minSamples = 64;\r\n\t\tunsigned int maxSamples = 100;\r\n\t\tunsigned int defaultLength = 2000;\r\n\t\tdouble riskFactor = 0.99;\r\n\t\tconfiguration.getOptFossilCollPeriod(checkpointPeriod);\r\n\t\tconfiguration.getOptFossilCollMinSamples(minSamples);\r\n\t\tconfiguration.getOptFossilCollMaxSamples(maxSamples);\r\n\t\tconfiguration.getOptFossilCollDefaultLength(defaultLength);\r\n\t\tconfiguration.getOptFossilCollRiskFactor(riskFactor);\r\n\t\tif (simulationType == \"ThreadedTimeWarp\") {\r\n\t\t\tretval = new ThreadedChebyFossilCollManager(myThreadedSimulationManager,\r\n\t\t\t\t\tcheckpointPeriod, minSamples, maxSamples, defaultLength,\r\n\t\t\t\t\triskFactor);\r\n\t\t\tmyThreadedSimulationManager->setOptFossilColl(true);\r\n\r\n\t\t} else {\r\n\t\t\tretval = new ChebyFossilCollManager(mySimulationManager,\r\n\t\t\t\t\tcheckpointPeriod, minSamples, maxSamples, defaultLength,\r\n\t\t\t\t\triskFactor);\r\n\t\t\tmySimulationManager->setOptFossilColl(true);\r\n\t\t\tdebug::debugout << \"(\"\r\n\t\t\t\t\t<< mySimulationManager->getSimulationManagerID()\r\n\t\t\t\t\t<< \") configured a Cheby Optimistic Fossil Collection Manager \"\r\n\t\t\t\t\t<< \"with checkpoint interval: \" << checkpointPeriod\r\n\t\t\t\t\t<< \", and risk factor: \" << riskFactor << endl;\r\n\t\t}\r\n\t} else if (optFossilCollManagerType == \"None\") {\r\n\t\tretval = NULL;\r\n\t} else {\r\n\t\tmySimulationManager->shutdown(\r\n\t\t\t\t\"Unknown FossilManager choice \\\"\"\r\n\t\t\t\t\t\t+ configuration.getGVTManagerType() + \"\\\"\");\r\n\t}\r\n\r\n\treturn retval;\r\n}\r\n\r\nconst OptFossilCollManagerFactory *\r\nOptFossilCollManagerFactory::instance(){\r\n  static OptFossilCollManagerFactory *singleton = new OptFossilCollManagerFactory();\r\n\r\n  return singleton;\r\n}\r\n<commit_msg>Removed getOptFossilCollPeriod usage<commit_after>\r\n#include \"OptFossilCollManagerFactory.h\"\r\n#include \"ChebyFossilCollManager.h\"\r\n#include \"SimulationConfiguration.h\"\r\n#include \"TimeWarpConfigurationManager.h\"\r\n#include \"ThreadedTimeWarpSimulationManager.h\"\r\n#include \"ThreadedChebyFossilCollManager.h\"\r\n#include <WarpedDebug.h>\r\n\r\nOptFossilCollManagerFactory::OptFossilCollManagerFactory(){}\r\n\r\nOptFossilCollManagerFactory::~OptFossilCollManagerFactory(){\r\n  \/\/ myFossilManager will be deleted by the end user - the\r\n  \/\/ TimeWarpSimulationManager\r\n}\r\n\r\nConfigurable *\r\nOptFossilCollManagerFactory::allocate(SimulationConfiguration &configuration,\r\n\t\tConfigurable *parent) const {\r\n\tConfigurable *retval = NULL;\r\n\tTimeWarpSimulationManager *mySimulationManager =\r\n\t\t\tdynamic_cast<TimeWarpSimulationManager *> (parent);\r\n\tThreadedTimeWarpSimulationManager *myThreadedSimulationManager =\r\n\t\t\tdynamic_cast<ThreadedTimeWarpSimulationManager *> (parent);\r\n\r\n\tASSERT( mySimulationManager != NULL );\r\n\t\/\/ the following cases are possible:\r\n\r\n\t\/\/ (1) Manager is Cheby.\r\n\t\/\/ (2) None is used.\r\n\r\n    std::string optFossilCollManagerType = configuration.get_string(\r\n    \t{\"TimeWarp\", \"OptFossilCollManager\", \"Type\"}, \"None\");\r\n    std::string simulationType = configuration.get_string({\"Simulation\"}, \"Sequential\");\r\n\tif (optFossilCollManagerType == \"Cheby\") {\r\n\t\tint checkpointPeriod = configuration.get_int({\"TimeWarp\", \"OptFossilCollManager\", \"CheckpointTime\"}, \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t1000);\r\n\t\tunsigned int minSamples = 64;\r\n\t\tunsigned int maxSamples = 100;\r\n\t\tunsigned int defaultLength = 2000;\r\n\t\tdouble riskFactor = 0.99;\r\n\t\tconfiguration.getOptFossilCollMinSamples(minSamples);\r\n\t\tconfiguration.getOptFossilCollMaxSamples(maxSamples);\r\n\t\tconfiguration.getOptFossilCollDefaultLength(defaultLength);\r\n\t\tconfiguration.getOptFossilCollRiskFactor(riskFactor);\r\n\t\tif (simulationType == \"ThreadedTimeWarp\") {\r\n\t\t\tretval = new ThreadedChebyFossilCollManager(myThreadedSimulationManager,\r\n\t\t\t\t\tcheckpointPeriod, minSamples, maxSamples, defaultLength,\r\n\t\t\t\t\triskFactor);\r\n\t\t\tmyThreadedSimulationManager->setOptFossilColl(true);\r\n\r\n\t\t} else {\r\n\t\t\tretval = new ChebyFossilCollManager(mySimulationManager,\r\n\t\t\t\t\tcheckpointPeriod, minSamples, maxSamples, defaultLength,\r\n\t\t\t\t\triskFactor);\r\n\t\t\tmySimulationManager->setOptFossilColl(true);\r\n\t\t\tdebug::debugout << \"(\"\r\n\t\t\t\t\t<< mySimulationManager->getSimulationManagerID()\r\n\t\t\t\t\t<< \") configured a Cheby Optimistic Fossil Collection Manager \"\r\n\t\t\t\t\t<< \"with checkpoint interval: \" << checkpointPeriod\r\n\t\t\t\t\t<< \", and risk factor: \" << riskFactor << endl;\r\n\t\t}\r\n\t} else if (optFossilCollManagerType == \"None\") {\r\n\t\tretval = NULL;\r\n\t} else {\r\n\t\tmySimulationManager->shutdown(\r\n\t\t\t\t\"Unknown FossilManager choice \\\"\"\r\n\t\t\t\t\t\t+ configuration.getGVTManagerType() + \"\\\"\");\r\n\t}\r\n\r\n\treturn retval;\r\n}\r\n\r\nconst OptFossilCollManagerFactory *\r\nOptFossilCollManagerFactory::instance(){\r\n  static OptFossilCollManagerFactory *singleton = new OptFossilCollManagerFactory();\r\n\r\n  return singleton;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/* RTcmix - Copyright (C) 2005 The RTcmix Development Team\n   See ``AUTHORS'' for a list of contributors. See ``LICENSE'' for\n   the license to this software and for a DISCLAIMER OF ALL WARRANTIES.\n*\/\n\/\/ The set_option function, called from a script, lets the user override\n\/\/ default options (and those stored in the .rtcmixrc file).  The options\n\/\/ are kept in the <options> object.  See Option.h for advice on how to add\n\/\/ new options.\n\/\/\n\/\/ Please keep the items created in the steps above in the same order that they\n\/\/ appear in Option.h -- makes this file easier to maintain.\n\/\/\n\/\/ -JGG, 6\/30\/04, rev. 4\/10\/05\n\n#include <RTcmix.h>\n#include <ugens.h>\t\t\/\/ for die()\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <errno.h>\n#include <Option.h>\n\nenum ParamType {\n\tAUDIO,\n\tPLAY,\n\tRECORD,\n\tCLOBBER,\n\tPRINT,\n\tREPORT_CLIPPING,\n\tCHECK_PEAKS,\n\tFULL_DUPLEX,\n\tEXIT_ON_ERROR,\n\tAUTO_LOAD,\n\tFAST_UPDATE,\n\tBUFFER_FRAMES,\n\tBUFFER_COUNT,\n\tDEVICE,\n\tINDEVICE,\n\tOUTDEVICE,\n\tMIDI_INDEVICE,\n\tMIDI_OUTDEVICE,\n\tDSOPATH,\n\tRCNAME\n};\n\n#define OPT_STRLEN 128\n\nstruct Param {\n\tchar arg[OPT_STRLEN];\n\tParamType type;\n\tbool value;\t\t\/\/ use false if not relevant, i.e. for key=value style\n};\n\nstatic Param _param_list[] = {\n\t\/\/ These are key=value option strings.  Please list these in the order in \n\t\/\/ which they appear in Option.h, to make it easier to compare.\n\t{ kOptionAudio, AUDIO, false},\n\t{ kOptionPlay, PLAY, false},\n\t{ kOptionRecord, RECORD, false},\n\t{ kOptionClobber, CLOBBER, false},\n\t{ kOptionPrint, PRINT, false},\n\t{ kOptionReportClipping, REPORT_CLIPPING, false},\n\t{ kOptionCheckPeaks, CHECK_PEAKS, false},\n\t{ kOptionExitOnError, EXIT_ON_ERROR, false},\n\t{ kOptionAutoLoad, AUTO_LOAD, false},\n\t{ kOptionFastUpdate, FAST_UPDATE, false},\n\n\t{ kOptionBufferFrames, BUFFER_FRAMES, false},\n\t{ kOptionBufferCount, BUFFER_COUNT, false},\n\n\t{ kOptionDevice, DEVICE, false},\n\t{ kOptionInDevice, INDEVICE, false},\n\t{ kOptionOutDevice, OUTDEVICE, false},\n\t{ kOptionMidiInDevice, MIDI_INDEVICE, false},\n\t{ kOptionMidiOutDevice, MIDI_OUTDEVICE, false},\n\t{ kOptionDSOPath, DSOPATH, false},\n\t{ kOptionRCName, RCNAME, false},\n\n\t\/\/ These are the deprecated single-value option strings.\n\t\/\/ Please don't add more.\n\t{ \"AUDIO_ON\", AUDIO, true},\n\t{ \"AUDIO_OFF\", AUDIO, false},\n\t{ \"RECORD_ON\", RECORD, true},\n\t{ \"RECORD_OFF\", RECORD, false},\n\t{ \"PLAY_ON\", AUDIO, true},\n\t{ \"PLAY_OFF\", AUDIO, false},\n\t{ \"CLOBBER_ON\", CLOBBER, true},\n\t{ \"CLOBBER_OFF\", CLOBBER, false},\n\t{ \"REPORT_CLIPPING_ON\", REPORT_CLIPPING, true},\n\t{ \"REPORT_CLIPPING_OFF\", REPORT_CLIPPING, false},\n\t{ \"CHECK_PEAKS_ON\", CHECK_PEAKS, true},\n\t{ \"CHECK_PEAKS_OFF\", CHECK_PEAKS, false},\n\t{ \"FULL_DUPLEX_ON\", FULL_DUPLEX, true},\n\t{ \"FULL_DUPLEX_OFF\", FULL_DUPLEX, false},\n};\nstatic int _num_params = sizeof(_param_list) \/ sizeof(Param);\n\n\n\/\/-------------------------------- _str_to_bool, _str_to_int, _str_to_double ---\nstatic int _str_to_bool(const char *str, bool &val)\n{\n\tif (strcasecmp(str, \"yes\") == 0 || strcasecmp(str, \"true\") == 0\n\t\t\t|| strcasecmp(str, \"on\") == 0 || strcmp(str, \"1\") == 0)\n\t\tval = true;\n\telse if (strcasecmp(str, \"no\") == 0 || strcasecmp(str, \"false\") == 0\n\t\t\t|| strcasecmp(str, \"off\") == 0 || strcmp(str, \"0\") == 0)\n\t\tval = false;\n\telse {\n\t\tval = false;\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\nstatic int _str_to_int(const char *str, int &val)\n{\n\tchar *pos = NULL;\n\tlong num = strtol(str, &pos, 10);\n\tif (*pos != 0)\n\t\treturn -1;\n\tval = num;\n\treturn 0;\n}\n\nstatic int _str_to_double(const char *str, double &val)\n{\n\tchar *pos = NULL;\n\terrno = 0;\n\tval = strtod(str, &pos);\n\tif (errno != 0 || (val == 0.0 && pos == str))\n\t\treturn -1;\n\treturn 0;\n}\n\n\/\/--------------------------------------------------------- _set_full_duplex ---\n\/\/ The full duplex state has now been broken up into the <play> and <record>\n\/\/ options, used during audio setup.  rtsetparams() checks <record>.\nstatic int _set_full_duplex(const bool full_duplex,\n\tconst bool rtsetparams_called)\n{\n\tif (full_duplex && rtsetparams_called)\n\t\treturn die(\"set_option\",\n\t\t\t\t\t\"Turn on full duplex BEFORE calling rtsetparams.\");\n\n\tif (full_duplex)\n\t\tOption::record(true);\n\telse {\n\t\t\/\/ If not play, then record.\n\t\tbool state = Option::record() && !Option::play();\n\t\tOption::record(state);\n\t}\n\t\/\/ Same check as above, for record.\n\tif (Option::record() && rtsetparams_called)\n\t\treturn die(\"set_option\",\n\t\t\t\t\t\"Turn on record BEFORE calling rtsetparams.\");\n\treturn 0;\n}\n\n\/\/---------------------------------------------------- _set_key_value_option ---\nstatic int _set_key_value_option(const char *key, const char *sval,\n\tconst bool rtsetparams_called)\n{\n\tint type = -1;\n\tfor (int j = 0; j < _num_params; j++) {\n\t\tif (strcasecmp(_param_list[j].arg, key) == 0) {\n\t\t\ttype = _param_list[j].type;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (type == -1)\n\t\treturn -1;\n\tif (sval == NULL)\n\t\treturn die(\"set_option\", \"No value for \\\"%s\\\"\", key);\n\n\tint status = 0;\n\tbool bval = false;\n\tint ival = 0;\n\tdouble dval = 0.0;\n\n\tswitch (type) {\n\t\tcase AUDIO:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::audio(bval);\n\t\t\tbreak;\n\t\tcase PLAY:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::play(bval);\n\t\t\tbreak;\n\t\tcase RECORD:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::record(bval);\n\t\t\tif (Option::record() && rtsetparams_called)\n\t\t\t\treturn die(\"set_option\",\n\t\t\t\t\t\t\t\"Turn on record BEFORE calling rtsetparams.\");\n\t\t\tbreak;\n\t\tcase CLOBBER:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::clobber(bval);\n\t\t\tbreak;\n\t\tcase PRINT:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::print(bval);\n\t\t\tbreak;\n\t\tcase REPORT_CLIPPING:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::reportClipping(bval);\n\t\t\tbreak;\n\t\tcase CHECK_PEAKS:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::checkPeaks(bval);\n\t\t\tbreak;\n\t\tcase EXIT_ON_ERROR:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::exitOnError(bval);\n\t\t\tbreak;\n\t\tcase AUTO_LOAD:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::autoLoad(bval);\n\t\t\tbreak;\n\t\tcase FAST_UPDATE:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::fastUpdate(bval);\n\t\t\tif (bval)\n\t\t\t\twarn(\"set_option\", \"With \\\"%s\\\" on, certain instruments run \"\n\t\t\t\t\t\"faster at the expense of reduced capabilities.\\n\", key);\n\t\t\tbreak;\n\t\tcase BUFFER_FRAMES:\n\t\t\tstatus = _str_to_int(sval, ival);\n\t\t\tif (status == 0) {\n\t\t\t\tif (ival <= 0)\n\t\t\t\t\treturn die(\"set_option\", \"\\\"%s\\\" value must be > 0\", key);\n\t\t\t\tOption::bufferFrames(ival);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase BUFFER_COUNT:\n\t\t\tstatus = _str_to_int(sval, ival);\n\t\t\tif (status == 0) {\n\t\t\t\tif (ival <= 0)\n\t\t\t\t\treturn die(\"set_option\", \"\\\"%s\\\" value must be > 0\", key);\n\t\t\t\tOption::bufferCount(ival);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase DEVICE:\n\t\t\tOption::device(sval);\n\t\t\tbreak;\n\t\tcase INDEVICE:\n\t\t\tOption::inDevice(sval);\n\t\t\tbreak;\n\t\tcase OUTDEVICE:\n\t\t\tOption::outDevice(sval);\n\t\t\tbreak;\n\t\tcase MIDI_INDEVICE:\n\t\t\tOption::midiInDevice(sval);\n\t\t\tbreak;\n\t\tcase MIDI_OUTDEVICE:\n\t\t\tOption::midiOutDevice(sval);\n\t\t\tbreak;\n\t\tcase DSOPATH:\n\t\t\tOption::dsoPath(sval);\n\t\t\tbreak;\n\t\tcase RCNAME:\n\t\t\tOption::rcName(sval);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\n\tif (status == -1)\n\t\treturn die(\"set_option\", \"Trouble parsing value \\\"%s\\\"\", sval);\n\treturn status;\n}\n\n\/\/-------------------------------------------------------- _set_value_option ---\n\/\/ This way of setting options is deprecated, in favor of the new key=value way.\n\/\/ Do not handle new options in this function; use _set_key_value_option.\nstatic int _set_value_option(const char *sval, const bool rtsetparams_called)\n{\n\tint type = -1;\n\tbool bval = false;\n\tfor (int j = 0; j < _num_params; j++) {\n\t\tif (strcasecmp(_param_list[j].arg, sval) == 0) {\n\t\t\ttype = _param_list[j].type;\n\t\t\tbval = _param_list[j].value;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (type == -1)\n\t\treturn -1;\n\n\tswitch (type) {\n\t\tcase AUDIO:\n\t\t\tOption::play(bval);\n\t\t\tbreak;\n\t\tcase RECORD:\n\t\t\tOption::record(bval);\n\t\t\tif (Option::record() && rtsetparams_called)\n\t\t\t\treturn die(\"set_option\",\n\t\t\t\t\t\t\t\"Turn on record BEFORE calling rtsetparams.\");\n\t\t\tbreak;\n\t\tcase CLOBBER:\n\t\t\tOption::clobber(bval);\n\t\t\tbreak;\n\t\tcase REPORT_CLIPPING:\n\t\t\tOption::reportClipping(bval);\n\t\t\tbreak;\n\t\tcase CHECK_PEAKS:\n\t\t\tOption::checkPeaks(bval);\n\t\t\tbreak;\n\t\tcase FULL_DUPLEX:\n\t\t\tif (_set_full_duplex(bval, rtsetparams_called) == -1)\n\t\t\t\treturn -1;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\n\treturn 0;\n}\n\n\/\/--------------------------------------------------------------- _parse_arg ---\nstatic int _parse_arg(const char *arg, const bool rtsetparams_called)\n{\n\t\/\/ Strip white-space chars from text to the left of any '=' and between\n\t\/\/ the '=' and the next non-white space.  The reason we don't strip the\n\t\/\/ whole string is to preserve options that must include spaces, such\n\t\/\/ as \"MOTU 828\".  Store result into <opt>.\n\n\tint len = arg ? strlen(arg) : 0;\n\tif (len > OPT_STRLEN - 1)\n\t\tlen = OPT_STRLEN - 1;\n\n\tchar opt[OPT_STRLEN];\n\tchar *p = opt;\n\tint space_state = 0;\n\tfor (int j = 0; j < len; j++) {\n\t\tif (space_state > 1)\n\t\t\t*p++ = arg[j];\n\t\telse if (!isspace(arg[j])) {\n\t\t\tif (space_state == 1)\n\t\t\t\tspace_state++;\n\t\t\telse if (arg[j] == '=')\n\t\t\t\tspace_state = 1;\n\t\t\t*p++ = arg[j];\n\t\t}\n\t}\n\t*p = '\\0';\n\n\t\/\/ Two styles of option string: a single \"value\" and a \"key=value\" pair.\n\tint status = 0;\n\tp = strchr(opt, '=');\t\t\t\t\/\/ check for \"key=value\"\n\tif (p) {\n\t\t*p++ = '\\0';\t\t\t\t\t\t\/\/ <opt> is now key only\n\t\tif (*p == '\\0')\t\t\t\t\t\/\/ p now points to value string\n\t\t\treturn die(\"set_option\", \"Missing value for key \\\"%s\\\"\", opt);\n\t\tstatus = _set_key_value_option(opt, p, rtsetparams_called);\n\t}\n\telse\t\t\t\t\t\t\t\t\t\t\/\/ check for single \"value\"\n\t\tstatus = _set_value_option(opt, rtsetparams_called);\n\n\tif (status == -1)\n\t\treturn die(\"set_option\", \"Unrecognized option \\\"%s\\\"\", opt);\n\treturn 0;\n}\n\n\/\/--------------------------------------------------------------- set_option ---\ndouble RTcmix::set_option(float *p, int nargs, double pp[])\n{\n\t\/\/ Because options can be set in any order, we need to check certain state\n\t\/\/ at the starting point and compare it to the finished state to determine if\n\t\/\/ a legal change has been made.\n\t\n\tbool playWasOn = Option::play();\n\t\n\tfor (int i = 0; i < nargs; i++) {\n\t\tchar *arg = (char *) ((int) pp[i]);\t\t\/\/ cast pfield to string\n\n\t\tif (_parse_arg(arg, rtsetparams_was_called()) == -1)\n\t\t\treturn -1.0;\n\t}\n\t\n\t\/\/ Now we check the finished state\n\t\n\tif (rtsetparams_was_called() && playWasOn && !Option::play()) {\n\t\treturn die(\"set_option\", \"Turn off audio\/play BEFORE calling rtsetparams.\");\n\t}\n\treturn 0.0;\n}\n\n<commit_msg>Removed unneeded logic.<commit_after>\/* RTcmix - Copyright (C) 2005 The RTcmix Development Team\n   See ``AUTHORS'' for a list of contributors. See ``LICENSE'' for\n   the license to this software and for a DISCLAIMER OF ALL WARRANTIES.\n*\/\n\/\/ The set_option function, called from a script, lets the user override\n\/\/ default options (and those stored in the .rtcmixrc file).  The options\n\/\/ are kept in the <options> object.  See Option.h for advice on how to add\n\/\/ new options.\n\/\/\n\/\/ Please keep the items created in the steps above in the same order that they\n\/\/ appear in Option.h -- makes this file easier to maintain.\n\/\/\n\/\/ -JGG, 6\/30\/04, rev. 4\/10\/05\n\n#include <RTcmix.h>\n#include <ugens.h>\t\t\/\/ for die()\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <errno.h>\n#include <Option.h>\n\nenum ParamType {\n\tAUDIO,\n\tPLAY,\n\tRECORD,\n\tCLOBBER,\n\tPRINT,\n\tREPORT_CLIPPING,\n\tCHECK_PEAKS,\n\tFULL_DUPLEX,\n\tEXIT_ON_ERROR,\n\tAUTO_LOAD,\n\tFAST_UPDATE,\n\tBUFFER_FRAMES,\n\tBUFFER_COUNT,\n\tDEVICE,\n\tINDEVICE,\n\tOUTDEVICE,\n\tMIDI_INDEVICE,\n\tMIDI_OUTDEVICE,\n\tDSOPATH,\n\tRCNAME\n};\n\n#define OPT_STRLEN 128\n\nstruct Param {\n\tchar arg[OPT_STRLEN];\n\tParamType type;\n\tbool value;\t\t\/\/ use false if not relevant, i.e. for key=value style\n};\n\nstatic Param _param_list[] = {\n\t\/\/ These are key=value option strings.  Please list these in the order in \n\t\/\/ which they appear in Option.h, to make it easier to compare.\n\t{ kOptionAudio, AUDIO, false},\n\t{ kOptionPlay, PLAY, false},\n\t{ kOptionRecord, RECORD, false},\n\t{ kOptionClobber, CLOBBER, false},\n\t{ kOptionPrint, PRINT, false},\n\t{ kOptionReportClipping, REPORT_CLIPPING, false},\n\t{ kOptionCheckPeaks, CHECK_PEAKS, false},\n\t{ kOptionExitOnError, EXIT_ON_ERROR, false},\n\t{ kOptionAutoLoad, AUTO_LOAD, false},\n\t{ kOptionFastUpdate, FAST_UPDATE, false},\n\n\t{ kOptionBufferFrames, BUFFER_FRAMES, false},\n\t{ kOptionBufferCount, BUFFER_COUNT, false},\n\n\t{ kOptionDevice, DEVICE, false},\n\t{ kOptionInDevice, INDEVICE, false},\n\t{ kOptionOutDevice, OUTDEVICE, false},\n\t{ kOptionMidiInDevice, MIDI_INDEVICE, false},\n\t{ kOptionMidiOutDevice, MIDI_OUTDEVICE, false},\n\t{ kOptionDSOPath, DSOPATH, false},\n\t{ kOptionRCName, RCNAME, false},\n\n\t\/\/ These are the deprecated single-value option strings.\n\t\/\/ Please don't add more.\n\t{ \"AUDIO_ON\", AUDIO, true},\n\t{ \"AUDIO_OFF\", AUDIO, false},\n\t{ \"RECORD_ON\", RECORD, true},\n\t{ \"RECORD_OFF\", RECORD, false},\n\t{ \"PLAY_ON\", AUDIO, true},\n\t{ \"PLAY_OFF\", AUDIO, false},\n\t{ \"CLOBBER_ON\", CLOBBER, true},\n\t{ \"CLOBBER_OFF\", CLOBBER, false},\n\t{ \"REPORT_CLIPPING_ON\", REPORT_CLIPPING, true},\n\t{ \"REPORT_CLIPPING_OFF\", REPORT_CLIPPING, false},\n\t{ \"CHECK_PEAKS_ON\", CHECK_PEAKS, true},\n\t{ \"CHECK_PEAKS_OFF\", CHECK_PEAKS, false},\n\t{ \"FULL_DUPLEX_ON\", FULL_DUPLEX, true},\n\t{ \"FULL_DUPLEX_OFF\", FULL_DUPLEX, false},\n};\nstatic int _num_params = sizeof(_param_list) \/ sizeof(Param);\n\n\n\/\/-------------------------------- _str_to_bool, _str_to_int, _str_to_double ---\nstatic int _str_to_bool(const char *str, bool &val)\n{\n\tif (strcasecmp(str, \"yes\") == 0 || strcasecmp(str, \"true\") == 0\n\t\t\t|| strcasecmp(str, \"on\") == 0 || strcmp(str, \"1\") == 0)\n\t\tval = true;\n\telse if (strcasecmp(str, \"no\") == 0 || strcasecmp(str, \"false\") == 0\n\t\t\t|| strcasecmp(str, \"off\") == 0 || strcmp(str, \"0\") == 0)\n\t\tval = false;\n\telse {\n\t\tval = false;\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\nstatic int _str_to_int(const char *str, int &val)\n{\n\tchar *pos = NULL;\n\tlong num = strtol(str, &pos, 10);\n\tif (*pos != 0)\n\t\treturn -1;\n\tval = num;\n\treturn 0;\n}\n\nstatic int _str_to_double(const char *str, double &val)\n{\n\tchar *pos = NULL;\n\terrno = 0;\n\tval = strtod(str, &pos);\n\tif (errno != 0 || (val == 0.0 && pos == str))\n\t\treturn -1;\n\treturn 0;\n}\n\n\/\/--------------------------------------------------------- _set_full_duplex ---\n\/\/ The full duplex state has now been broken up into the <play> and <record>\n\/\/ options, used during audio setup.  rtsetparams() checks <record>.\nstatic int _set_full_duplex(const bool full_duplex,\n\tconst bool rtsetparams_called)\n{\n\tif (full_duplex && rtsetparams_called)\n\t\treturn die(\"set_option\",\n\t\t\t\t\t\"Turn on full duplex BEFORE calling rtsetparams.\");\n\n\tif (full_duplex)\n\t\tOption::record(true);\n\telse {\n\t\t\/\/ If not play, then record.\n\t\tbool state = Option::record() && !Option::play();\n\t\tOption::record(state);\n\t}\n\t\/\/ Same check as above, for record.\n\tif (Option::record() && rtsetparams_called)\n\t\treturn die(\"set_option\",\n\t\t\t\t\t\"Turn on record BEFORE calling rtsetparams.\");\n\treturn 0;\n}\n\n\/\/---------------------------------------------------- _set_key_value_option ---\nstatic int _set_key_value_option(const char *key, const char *sval,\n\tconst bool rtsetparams_called)\n{\n\tint type = -1;\n\tfor (int j = 0; j < _num_params; j++) {\n\t\tif (strcasecmp(_param_list[j].arg, key) == 0) {\n\t\t\ttype = _param_list[j].type;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (type == -1)\n\t\treturn -1;\n\tif (sval == NULL)\n\t\treturn die(\"set_option\", \"No value for \\\"%s\\\"\", key);\n\n\tint status = 0;\n\tbool bval = false;\n\tint ival = 0;\n\tdouble dval = 0.0;\n\n\tswitch (type) {\n\t\tcase AUDIO:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::audio(bval);\n\t\t\tbreak;\n\t\tcase PLAY:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::play(bval);\n\t\t\tbreak;\n\t\tcase RECORD:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::record(bval);\n\t\t\tif (Option::record() && rtsetparams_called)\n\t\t\t\treturn die(\"set_option\",\n\t\t\t\t\t\t\t\"Turn on record BEFORE calling rtsetparams.\");\n\t\t\tbreak;\n\t\tcase CLOBBER:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::clobber(bval);\n\t\t\tbreak;\n\t\tcase PRINT:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::print(bval);\n\t\t\tbreak;\n\t\tcase REPORT_CLIPPING:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::reportClipping(bval);\n\t\t\tbreak;\n\t\tcase CHECK_PEAKS:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::checkPeaks(bval);\n\t\t\tbreak;\n\t\tcase EXIT_ON_ERROR:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::exitOnError(bval);\n\t\t\tbreak;\n\t\tcase AUTO_LOAD:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::autoLoad(bval);\n\t\t\tbreak;\n\t\tcase FAST_UPDATE:\n\t\t\tstatus = _str_to_bool(sval, bval);\n\t\t\tOption::fastUpdate(bval);\n\t\t\tif (bval)\n\t\t\t\twarn(\"set_option\", \"With \\\"%s\\\" on, certain instruments run \"\n\t\t\t\t\t\"faster at the expense of reduced capabilities.\\n\", key);\n\t\t\tbreak;\n\t\tcase BUFFER_FRAMES:\n\t\t\tstatus = _str_to_int(sval, ival);\n\t\t\tif (status == 0) {\n\t\t\t\tif (ival <= 0)\n\t\t\t\t\treturn die(\"set_option\", \"\\\"%s\\\" value must be > 0\", key);\n\t\t\t\tOption::bufferFrames(ival);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase BUFFER_COUNT:\n\t\t\tstatus = _str_to_int(sval, ival);\n\t\t\tif (status == 0) {\n\t\t\t\tif (ival <= 0)\n\t\t\t\t\treturn die(\"set_option\", \"\\\"%s\\\" value must be > 0\", key);\n\t\t\t\tOption::bufferCount(ival);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase DEVICE:\n\t\t\tOption::device(sval);\n\t\t\tbreak;\n\t\tcase INDEVICE:\n\t\t\tOption::inDevice(sval);\n\t\t\tbreak;\n\t\tcase OUTDEVICE:\n\t\t\tOption::outDevice(sval);\n\t\t\tbreak;\n\t\tcase MIDI_INDEVICE:\n\t\t\tOption::midiInDevice(sval);\n\t\t\tbreak;\n\t\tcase MIDI_OUTDEVICE:\n\t\t\tOption::midiOutDevice(sval);\n\t\t\tbreak;\n\t\tcase DSOPATH:\n\t\t\tOption::dsoPath(sval);\n\t\t\tbreak;\n\t\tcase RCNAME:\n\t\t\tOption::rcName(sval);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\n\tif (status == -1)\n\t\treturn die(\"set_option\", \"Trouble parsing value \\\"%s\\\"\", sval);\n\treturn status;\n}\n\n\/\/-------------------------------------------------------- _set_value_option ---\n\/\/ This way of setting options is deprecated, in favor of the new key=value way.\n\/\/ Do not handle new options in this function; use _set_key_value_option.\nstatic int _set_value_option(const char *sval, const bool rtsetparams_called)\n{\n\tint type = -1;\n\tbool bval = false;\n\tfor (int j = 0; j < _num_params; j++) {\n\t\tif (strcasecmp(_param_list[j].arg, sval) == 0) {\n\t\t\ttype = _param_list[j].type;\n\t\t\tbval = _param_list[j].value;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (type == -1)\n\t\treturn -1;\n\n\tswitch (type) {\n\t\tcase AUDIO:\n\t\t\tOption::play(bval);\n\t\t\tbreak;\n\t\tcase RECORD:\n\t\t\tOption::record(bval);\n\t\t\tif (Option::record() && rtsetparams_called)\n\t\t\t\treturn die(\"set_option\",\n\t\t\t\t\t\t\t\"Turn on record BEFORE calling rtsetparams.\");\n\t\t\tbreak;\n\t\tcase CLOBBER:\n\t\t\tOption::clobber(bval);\n\t\t\tbreak;\n\t\tcase REPORT_CLIPPING:\n\t\t\tOption::reportClipping(bval);\n\t\t\tbreak;\n\t\tcase CHECK_PEAKS:\n\t\t\tOption::checkPeaks(bval);\n\t\t\tbreak;\n\t\tcase FULL_DUPLEX:\n\t\t\tif (_set_full_duplex(bval, rtsetparams_called) == -1)\n\t\t\t\treturn -1;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\n\treturn 0;\n}\n\n\/\/--------------------------------------------------------------- _parse_arg ---\nstatic int _parse_arg(const char *arg, const bool rtsetparams_called)\n{\n\t\/\/ Strip white-space chars from text to the left of any '=' and between\n\t\/\/ the '=' and the next non-white space.  The reason we don't strip the\n\t\/\/ whole string is to preserve options that must include spaces, such\n\t\/\/ as \"MOTU 828\".  Store result into <opt>.\n\n\tint len = arg ? strlen(arg) : 0;\n\tif (len > OPT_STRLEN - 1)\n\t\tlen = OPT_STRLEN - 1;\n\n\tchar opt[OPT_STRLEN];\n\tchar *p = opt;\n\tint space_state = 0;\n\tfor (int j = 0; j < len; j++) {\n\t\tif (space_state > 1)\n\t\t\t*p++ = arg[j];\n\t\telse if (!isspace(arg[j])) {\n\t\t\tif (space_state == 1)\n\t\t\t\tspace_state++;\n\t\t\telse if (arg[j] == '=')\n\t\t\t\tspace_state = 1;\n\t\t\t*p++ = arg[j];\n\t\t}\n\t}\n\t*p = '\\0';\n\n\t\/\/ Two styles of option string: a single \"value\" and a \"key=value\" pair.\n\tint status = 0;\n\tp = strchr(opt, '=');\t\t\t\t\/\/ check for \"key=value\"\n\tif (p) {\n\t\t*p++ = '\\0';\t\t\t\t\t\t\/\/ <opt> is now key only\n\t\tif (*p == '\\0')\t\t\t\t\t\/\/ p now points to value string\n\t\t\treturn die(\"set_option\", \"Missing value for key \\\"%s\\\"\", opt);\n\t\tstatus = _set_key_value_option(opt, p, rtsetparams_called);\n\t}\n\telse\t\t\t\t\t\t\t\t\t\t\/\/ check for single \"value\"\n\t\tstatus = _set_value_option(opt, rtsetparams_called);\n\n\tif (status == -1)\n\t\treturn die(\"set_option\", \"Unrecognized option \\\"%s\\\"\", opt);\n\treturn 0;\n}\n\n\/\/--------------------------------------------------------------- set_option ---\ndouble RTcmix::set_option(float *p, int nargs, double pp[])\n{\n\tfor (int i = 0; i < nargs; i++) {\n\t\tchar *arg = (char *) ((int) pp[i]);\t\t\/\/ cast pfield to string\n\n\t\tif (_parse_arg(arg, rtsetparams_was_called()) == -1)\n\t\t\treturn -1.0;\n\t}\n\treturn 0.0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (C) 2008-2013 The Communi Project\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\n#include \"themeinfo.h\"\n#include <QApplication>\n#include <QSettings>\n#include <QPalette>\n#include <QColor>\n#include <QFile>\n#include <Irc>\n\nQString ThemeInfo::attribute(const QString& key) const\n{\n    return d.attributes.value(key);\n}\n\nQString ThemeInfo::prefix() const\n{\n    return d.prefix;\n}\n\nQString ThemeInfo::docStyleSheet() const\n{\n    return d.css;\n}\n\nQString ThemeInfo::appStyleSheet() const\n{\n    return d.qss;\n}\n\nQMap<int, QString> ThemeInfo::colors() const\n{\n    return d.colors;\n}\n\nQMap<QString, QPalette> ThemeInfo::palettes() const\n{\n    return d.palettes;\n}\n\nstatic QColor parsePaletteColor(const QString& str)\n{\n    if (str == \"alternate-base\")\n        return qApp->palette().color(QPalette::AlternateBase);\n    else if (str == \"base\")\n        return qApp->palette().color(QPalette::Base);\n    else if (str == \"bright-text\")\n        return qApp->palette().color(QPalette::BrightText);\n    else if (str == \"button\")\n        return qApp->palette().color(QPalette::Button);\n    else if (str == \"button-text\")\n        return qApp->palette().color(QPalette::ButtonText);\n    else if (str == \"dark\")\n        return qApp->palette().color(QPalette::Dark);\n    else if (str == \"highlight\")\n        return qApp->palette().color(QPalette::Highlight);\n    else if (str == \"highlighted-text\")\n        return qApp->palette().color(QPalette::HighlightedText);\n    else if (str == \"light\")\n        return qApp->palette().color(QPalette::Light);\n    else if (str == \"link\")\n        return qApp->palette().color(QPalette::Link);\n    else if (str == \"link-visited\")\n        return qApp->palette().color(QPalette::LinkVisited);\n    else if (str == \"mid\")\n        return qApp->palette().color(QPalette::Mid);\n    else if (str == \"midlight\")\n        return qApp->palette().color(QPalette::Midlight);\n    else if (str == \"shadow\")\n        return qApp->palette().color(QPalette::Shadow);\n    else if (str == \"text\")\n        return qApp->palette().color(QPalette::Text);\n    else if (str == \"window\")\n        return qApp->palette().color(QPalette::Window);\n    else if (str == \"window-text\")\n        return qApp->palette().color(QPalette::WindowText);\n    return QColor();\n}\n\nstatic QColor parseRgbColor(const QString& str)\n{\n    QStringList rgb = str.split(\",\", QString::SkipEmptyParts);\n    if (rgb.count() == 3)\n        return qRgb(rgb.first().toInt(), rgb.at(1).toInt(), rgb.last().toInt());\n    return QColor();\n}\n\nstatic QColor parseRgbaColor(const QString& str)\n{\n    QStringList rgba = str.split(\",\", QString::SkipEmptyParts);\n    if (rgba.count() == 4)\n        return qRgba(rgba.first().toInt(), rgba.at(1).toInt(), rgba.at(2).toInt(), rgba.last().toInt());\n    return QColor();\n}\n\nstatic QColor parseColorValue(const QString& str, const QColor& defaultColor = QColor())\n{\n    QColor color;\n    if (str.startsWith(\"palette(\") && str.endsWith(\")\"))\n        color = parsePaletteColor(str.mid(8, str.length() - 9));\n    else if (str.startsWith(\"rgb(\") && str.endsWith(\")\"))\n        color = parseRgbColor(str.mid(4, str.length() - 5));\n    else if (str.startsWith(\"rgba(\") && str.endsWith(\")\"))\n        color = parseRgbaColor(str.mid(5, str.length() - 6));\n    else if (QColor::isValidColor(str))\n        color = QColor(str);\n    return color.isValid() ? color : defaultColor;\n}\n\nstatic QString readFile(const QString& filePath)\n{\n    QFile file(filePath);\n    if (file.open(QFile::ReadOnly | QIODevice::Text))\n        return QString::fromUtf8(file.readAll());\n    return QString();\n}\n\nstatic void fillPalette(const QSettings& settings, QPalette& palette, QPalette::ColorGroup group)\n{\n    palette.setColor(group, QPalette::AlternateBase, parseColorValue(settings.value(\"alternate-base\").toString(), palette.color(group, QPalette::AlternateBase)));\n    palette.setColor(group, QPalette::Base, parseColorValue(settings.value(\"base\").toString(), palette.color(group, QPalette::Base)));\n    palette.setColor(group, QPalette::BrightText, parseColorValue(settings.value(\"bright-text\").toString(), palette.color(group, QPalette::BrightText)));\n    palette.setColor(group, QPalette::Button, parseColorValue(settings.value(\"button\").toString(), palette.color(group, QPalette::Button)));\n    palette.setColor(group, QPalette::ButtonText, parseColorValue(settings.value(\"button-text\").toString(), palette.color(group, QPalette::ButtonText)));\n    palette.setColor(group, QPalette::Dark, parseColorValue(settings.value(\"dark\").toString(), palette.color(group, QPalette::Dark)));\n    palette.setColor(group, QPalette::Highlight, parseColorValue(settings.value(\"highlight\").toString(), palette.color(group, QPalette::Highlight)));\n    palette.setColor(group, QPalette::HighlightedText, parseColorValue(settings.value(\"highlighted-text\").toString(), palette.color(group, QPalette::HighlightedText)));\n    palette.setColor(group, QPalette::Light, parseColorValue(settings.value(\"light\").toString(), palette.color(group, QPalette::Light)));\n    palette.setColor(group, QPalette::Link, parseColorValue(settings.value(\"link\").toString(), palette.color(group, QPalette::Link)));\n    palette.setColor(group, QPalette::LinkVisited, parseColorValue(settings.value(\"link-visited\").toString(), palette.color(group, QPalette::LinkVisited)));\n    palette.setColor(group, QPalette::Mid, parseColorValue(settings.value(\"mid\").toString(), palette.color(group, QPalette::Mid)));\n    palette.setColor(group, QPalette::Midlight, parseColorValue(settings.value(\"midlight\").toString(), palette.color(group, QPalette::Midlight)));\n    palette.setColor(group, QPalette::Shadow, parseColorValue(settings.value(\"shadow\").toString(), palette.color(group, QPalette::Shadow)));\n    palette.setColor(group, QPalette::Text, parseColorValue(settings.value(\"text\").toString(), palette.color(group, QPalette::Text)));\n    palette.setColor(group, QPalette::Window, parseColorValue(settings.value(\"window\").toString(), palette.color(group, QPalette::Window)));\n    palette.setColor(group, QPalette::WindowText, parseColorValue(settings.value(\"window-text\").toString(), palette.color(group, QPalette::WindowText)));\n}\n\nstatic QPalette readPalette(QSettings& settings)\n{\n    QPalette palette;\n    fillPalette(settings, palette, QPalette::Normal);\n    settings.beginGroup(\"normal\");\n    fillPalette(settings, palette, QPalette::Normal);\n    settings.endGroup();\n    settings.beginGroup(\"disabled\");\n    fillPalette(settings, palette, QPalette::Disabled);\n    settings.endGroup();\n    settings.beginGroup(\"inactive\");\n    fillPalette(settings, palette, QPalette::Inactive);\n    settings.endGroup();\n    settings.beginGroup(\"active\");\n    fillPalette(settings, palette, QPalette::Active);\n    return palette;\n}\n\nbool ThemeInfo::load(const QString& filePath)\n{\n    QSettings settings(filePath, QSettings::IniFormat);\n\n    QStringList groups = settings.childGroups();\n    if (groups.contains(\"Theme\")) {\n        settings.beginGroup(\"Theme\");\n        foreach (const QString& key, settings.childKeys())\n            d.attributes.insert(key, settings.value(key).toString());\n        settings.endGroup();\n    }\n\n    if (groups.contains(\"Resources\")) {\n        settings.beginGroup(\"Resources\");\n        d.prefix = settings.value(\"prefix\").toString();\n        settings.endGroup();\n    }\n\n    if (groups.contains(\"StyleSheets\")) {\n        settings.beginGroup(\"StyleSheets\");\n        d.css = readFile(settings.value(\"document\").toString());\n        d.qss = readFile(settings.value(\"application\").toString());\n        settings.endGroup();\n    }\n\n    if (groups.contains(\"QPalette\")) {\n        settings.beginGroup(\"QPalette\");\n        foreach (const QString& group, settings.childGroups()) {\n            settings.beginGroup(group);\n            d.palettes.insert(group, readPalette(settings));\n            settings.endGroup();\n        }\n        settings.endGroup();\n    }\n\n    if (groups.contains(\"IrcPalette\")) {\n        settings.beginGroup(\"IrcPalette\");\n        const QStringList colorNames = QStringList() << \"white\" << \"black\" << \"blue\" << \"green\"\n                                                     << \"red\" << \"brown\" << \"purple\" << \"orange\"\n                                                     << \"yellow\" << \"lightgreen\" << \"cyan\" << \"lightcyan\"\n                                                     << \"lightblue\" << \"pink\" << \"gray\" << \"lightgray\";\n        for (int i = 0; i < colorNames.count(); ++i) {\n            const QColor color = parseColorValue(settings.value(colorNames.at(i)).toString(), colorNames.at(i));\n            if (color.isValid())\n                d.colors.insert(i, color.name());\n        }\n        settings.endGroup();\n    }\n\n    return !d.attributes.value(\"name\").isEmpty();\n}\n<commit_msg>Themes: add \"background\" & \"foreground\"<commit_after>\/*\n* Copyright (C) 2008-2013 The Communi Project\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\n#include \"themeinfo.h\"\n#include <QApplication>\n#include <QSettings>\n#include <QPalette>\n#include <QColor>\n#include <QFile>\n#include <Irc>\n\nQString ThemeInfo::attribute(const QString& key) const\n{\n    return d.attributes.value(key);\n}\n\nQString ThemeInfo::prefix() const\n{\n    return d.prefix;\n}\n\nQString ThemeInfo::docStyleSheet() const\n{\n    return d.css;\n}\n\nQString ThemeInfo::appStyleSheet() const\n{\n    return d.qss;\n}\n\nQMap<int, QString> ThemeInfo::colors() const\n{\n    return d.colors;\n}\n\nQMap<QString, QPalette> ThemeInfo::palettes() const\n{\n    return d.palettes;\n}\n\nstatic QColor parsePaletteColor(const QString& str)\n{\n    if (str == \"alternate-base\")\n        return qApp->palette().color(QPalette::AlternateBase);\n    else if (str == \"background\")\n        return qApp->palette().color(QPalette::Background);\n    else if (str == \"base\")\n        return qApp->palette().color(QPalette::Base);\n    else if (str == \"bright-text\")\n        return qApp->palette().color(QPalette::BrightText);\n    else if (str == \"button\")\n        return qApp->palette().color(QPalette::Button);\n    else if (str == \"button-text\")\n        return qApp->palette().color(QPalette::ButtonText);\n    else if (str == \"dark\")\n        return qApp->palette().color(QPalette::Dark);\n    else if (str == \"foreground\")\n        return qApp->palette().color(QPalette::Foreground);\n    else if (str == \"highlight\")\n        return qApp->palette().color(QPalette::Highlight);\n    else if (str == \"highlighted-text\")\n        return qApp->palette().color(QPalette::HighlightedText);\n    else if (str == \"light\")\n        return qApp->palette().color(QPalette::Light);\n    else if (str == \"link\")\n        return qApp->palette().color(QPalette::Link);\n    else if (str == \"link-visited\")\n        return qApp->palette().color(QPalette::LinkVisited);\n    else if (str == \"mid\")\n        return qApp->palette().color(QPalette::Mid);\n    else if (str == \"midlight\")\n        return qApp->palette().color(QPalette::Midlight);\n    else if (str == \"shadow\")\n        return qApp->palette().color(QPalette::Shadow);\n    else if (str == \"text\")\n        return qApp->palette().color(QPalette::Text);\n    else if (str == \"window\")\n        return qApp->palette().color(QPalette::Window);\n    else if (str == \"window-text\")\n        return qApp->palette().color(QPalette::WindowText);\n    return QColor();\n}\n\nstatic QColor parseRgbColor(const QString& str)\n{\n    QStringList rgb = str.split(\",\", QString::SkipEmptyParts);\n    if (rgb.count() == 3)\n        return qRgb(rgb.first().toInt(), rgb.at(1).toInt(), rgb.last().toInt());\n    return QColor();\n}\n\nstatic QColor parseRgbaColor(const QString& str)\n{\n    QStringList rgba = str.split(\",\", QString::SkipEmptyParts);\n    if (rgba.count() == 4)\n        return qRgba(rgba.first().toInt(), rgba.at(1).toInt(), rgba.at(2).toInt(), rgba.last().toInt());\n    return QColor();\n}\n\nstatic QColor parseColorValue(const QString& str, const QColor& defaultColor = QColor())\n{\n    QColor color;\n    if (str.startsWith(\"palette(\") && str.endsWith(\")\"))\n        color = parsePaletteColor(str.mid(8, str.length() - 9));\n    else if (str.startsWith(\"rgb(\") && str.endsWith(\")\"))\n        color = parseRgbColor(str.mid(4, str.length() - 5));\n    else if (str.startsWith(\"rgba(\") && str.endsWith(\")\"))\n        color = parseRgbaColor(str.mid(5, str.length() - 6));\n    else if (QColor::isValidColor(str))\n        color = QColor(str);\n    return color.isValid() ? color : defaultColor;\n}\n\nstatic QString readFile(const QString& filePath)\n{\n    QFile file(filePath);\n    if (file.open(QFile::ReadOnly | QIODevice::Text))\n        return QString::fromUtf8(file.readAll());\n    return QString();\n}\n\nstatic void fillPalette(const QSettings& settings, QPalette& palette, QPalette::ColorGroup group)\n{\n    palette.setColor(group, QPalette::AlternateBase, parseColorValue(settings.value(\"alternate-base\").toString(), palette.color(group, QPalette::AlternateBase)));\n    palette.setColor(group, QPalette::Base, parseColorValue(settings.value(\"base\").toString(), palette.color(group, QPalette::Base)));\n    palette.setColor(group, QPalette::BrightText, parseColorValue(settings.value(\"bright-text\").toString(), palette.color(group, QPalette::BrightText)));\n    palette.setColor(group, QPalette::Button, parseColorValue(settings.value(\"button\").toString(), palette.color(group, QPalette::Button)));\n    palette.setColor(group, QPalette::ButtonText, parseColorValue(settings.value(\"button-text\").toString(), palette.color(group, QPalette::ButtonText)));\n    palette.setColor(group, QPalette::Dark, parseColorValue(settings.value(\"dark\").toString(), palette.color(group, QPalette::Dark)));\n    palette.setColor(group, QPalette::Highlight, parseColorValue(settings.value(\"highlight\").toString(), palette.color(group, QPalette::Highlight)));\n    palette.setColor(group, QPalette::HighlightedText, parseColorValue(settings.value(\"highlighted-text\").toString(), palette.color(group, QPalette::HighlightedText)));\n    palette.setColor(group, QPalette::Light, parseColorValue(settings.value(\"light\").toString(), palette.color(group, QPalette::Light)));\n    palette.setColor(group, QPalette::Link, parseColorValue(settings.value(\"link\").toString(), palette.color(group, QPalette::Link)));\n    palette.setColor(group, QPalette::LinkVisited, parseColorValue(settings.value(\"link-visited\").toString(), palette.color(group, QPalette::LinkVisited)));\n    palette.setColor(group, QPalette::Mid, parseColorValue(settings.value(\"mid\").toString(), palette.color(group, QPalette::Mid)));\n    palette.setColor(group, QPalette::Midlight, parseColorValue(settings.value(\"midlight\").toString(), palette.color(group, QPalette::Midlight)));\n    palette.setColor(group, QPalette::Shadow, parseColorValue(settings.value(\"shadow\").toString(), palette.color(group, QPalette::Shadow)));\n    palette.setColor(group, QPalette::Text, parseColorValue(settings.value(\"text\").toString(), palette.color(group, QPalette::Text)));\n    palette.setColor(group, QPalette::Window, parseColorValue(settings.value(\"window\").toString(), palette.color(group, QPalette::Window)));\n    palette.setColor(group, QPalette::WindowText, parseColorValue(settings.value(\"window-text\").toString(), palette.color(group, QPalette::WindowText)));\n}\n\nstatic QPalette readPalette(QSettings& settings)\n{\n    QPalette palette;\n    fillPalette(settings, palette, QPalette::Normal);\n    settings.beginGroup(\"normal\");\n    fillPalette(settings, palette, QPalette::Normal);\n    settings.endGroup();\n    settings.beginGroup(\"disabled\");\n    fillPalette(settings, palette, QPalette::Disabled);\n    settings.endGroup();\n    settings.beginGroup(\"inactive\");\n    fillPalette(settings, palette, QPalette::Inactive);\n    settings.endGroup();\n    settings.beginGroup(\"active\");\n    fillPalette(settings, palette, QPalette::Active);\n    return palette;\n}\n\nbool ThemeInfo::load(const QString& filePath)\n{\n    QSettings settings(filePath, QSettings::IniFormat);\n\n    QStringList groups = settings.childGroups();\n    if (groups.contains(\"Theme\")) {\n        settings.beginGroup(\"Theme\");\n        foreach (const QString& key, settings.childKeys())\n            d.attributes.insert(key, settings.value(key).toString());\n        settings.endGroup();\n    }\n\n    if (groups.contains(\"Resources\")) {\n        settings.beginGroup(\"Resources\");\n        d.prefix = settings.value(\"prefix\").toString();\n        settings.endGroup();\n    }\n\n    if (groups.contains(\"StyleSheets\")) {\n        settings.beginGroup(\"StyleSheets\");\n        d.css = readFile(settings.value(\"document\").toString());\n        d.qss = readFile(settings.value(\"application\").toString());\n        settings.endGroup();\n    }\n\n    if (groups.contains(\"QPalette\")) {\n        settings.beginGroup(\"QPalette\");\n        foreach (const QString& group, settings.childGroups()) {\n            settings.beginGroup(group);\n            d.palettes.insert(group, readPalette(settings));\n            settings.endGroup();\n        }\n        settings.endGroup();\n    }\n\n    if (groups.contains(\"IrcPalette\")) {\n        settings.beginGroup(\"IrcPalette\");\n        const QStringList colorNames = QStringList() << \"white\" << \"black\" << \"blue\" << \"green\"\n                                                     << \"red\" << \"brown\" << \"purple\" << \"orange\"\n                                                     << \"yellow\" << \"lightgreen\" << \"cyan\" << \"lightcyan\"\n                                                     << \"lightblue\" << \"pink\" << \"gray\" << \"lightgray\";\n        for (int i = 0; i < colorNames.count(); ++i) {\n            const QColor color = parseColorValue(settings.value(colorNames.at(i)).toString(), colorNames.at(i));\n            if (color.isValid())\n                d.colors.insert(i, color.name());\n        }\n        settings.endGroup();\n    }\n\n    return !d.attributes.value(\"name\").isEmpty();\n}\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>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n * CONDOR Copyright Notice\n *\n * See LICENSE.TXT for additional notices and disclaimers.\n *\n * Copyright (c)1990-1998 CONDOR Team, Computer Sciences Department, \n * University of Wisconsin-Madison, Madison, WI.  All Rights Reserved.  \n * No use of the CONDOR Software Program Source Code is authorized \n * without the express consent of the CONDOR Team.  For more information \n * contact: CONDOR Team, Attention: Professor Miron Livny, \n * 7367 Computer Sciences, 1210 W. Dayton St., Madison, WI 53706-1685, \n * (608) 262-0856 or miron@cs.wisc.edu.\n *\n * U.S. Government Rights Restrictions: Use, duplication, or disclosure \n * by the U.S. Government is subject to restrictions as set forth in \n * subparagraph (c)(1)(ii) of The Rights in Technical Data and Computer \n * Software clause at DFARS 252.227-7013 or subparagraphs (c)(1) and \n * (2) of Commercial Computer Software-Restricted Rights at 48 CFR \n * 52.227-19, as applicable, CONDOR Team, Attention: Professor Miron \n * Livny, 7367 Computer Sciences, 1210 W. Dayton St., Madison, \n * WI 53706-1685, (608) 262-0856 or miron@cs.wisc.edu.\n****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n \n\n#define _POSIX_SOURCE\n#include <sys\/types.h>\n#include <stdlib.h>\n\n\nvoid * operator new(size_t size)\n{\n\treturn (void *)malloc(size);\n}\n\n\nvoid operator delete( void *to_free )\n{\n\tif( to_free ) {\n\t\t(void)free( to_free );\n\t}\n}\n\n#if defined( __GNUC__ )\n#\tif (__GNUG__== 2 && (__GNUC_MINOR__ == 6 || __GNUC_MINOR__ == 7))\n\t\textern \"C\" {\n\t\t\tvoid *__builtin_new( size_t );\n\t\t\tvoid __builtin_delete( void * );\n\t\t\tvoid *\n\t\t\t__builtin_vec_new (size_t sz)\n\t\t\t{\n\t\t\t\treturn __builtin_new( sz );\n\t\t\t}\n\n\t\t\tvoid\n\t\t\t__builtin_vec_delete( void *to_free )\n\t\t\t{\n\t\t\t\t__builtin_delete( to_free );\n\t\t\t}\n\t\t}\n#\tendif\n#endif\n<commit_msg>- #include \"condor_common.h\" - define __pure_virtual() to avoid problems linking our egcs compiled   C++ code with a non-egcs compiled user job<commit_after>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n * CONDOR Copyright Notice\n *\n * See LICENSE.TXT for additional notices and disclaimers.\n *\n * Copyright (c)1990-1998 CONDOR Team, Computer Sciences Department, \n * University of Wisconsin-Madison, Madison, WI.  All Rights Reserved.  \n * No use of the CONDOR Software Program Source Code is authorized \n * without the express consent of the CONDOR Team.  For more information \n * contact: CONDOR Team, Attention: Professor Miron Livny, \n * 7367 Computer Sciences, 1210 W. Dayton St., Madison, WI 53706-1685, \n * (608) 262-0856 or miron@cs.wisc.edu.\n *\n * U.S. Government Rights Restrictions: Use, duplication, or disclosure \n * by the U.S. Government is subject to restrictions as set forth in \n * subparagraph (c)(1)(ii) of The Rights in Technical Data and Computer \n * Software clause at DFARS 252.227-7013 or subparagraphs (c)(1) and \n * (2) of Commercial Computer Software-Restricted Rights at 48 CFR \n * 52.227-19, as applicable, CONDOR Team, Attention: Professor Miron \n * Livny, 7367 Computer Sciences, 1210 W. Dayton St., Madison, \n * WI 53706-1685, (608) 262-0856 or miron@cs.wisc.edu.\n****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n#include \"condor_common.h\"\n\nvoid * operator new(size_t size)\n{\n\treturn (void *)malloc(size);\n}\n\n\nvoid operator delete( void *to_free )\n{\n\tif( to_free ) {\n\t\t(void)free( to_free );\n\t}\n}\n\n#if defined( __GNUC__ )\n#\tif (__GNUG__== 2 && (__GNUC_MINOR__ == 6 || __GNUC_MINOR__ == 7))\n\t\textern \"C\" {\n\t\t\tvoid *__builtin_new( size_t );\n\t\t\tvoid __builtin_delete( void * );\n\t\t\tvoid *\n\t\t\t__builtin_vec_new (size_t sz)\n\t\t\t{\n\t\t\t\treturn __builtin_new( sz );\n\t\t\t}\n\n\t\t\tvoid\n\t\t\t__builtin_vec_delete( void *to_free )\n\t\t\t{\n\t\t\t\t__builtin_delete( to_free );\n\t\t\t}\n\t\t}\n#\tendif\n#endif\n\n\/* This function is called by egcs when a pure virtual method is called.\n   Since the user job may not be linking with egcs libraries, we need to\n   provide our own version. *\/\n\n#define MESSAGE \"pure virtual method called\\n\"\n\nextern \"C\" {\nvoid\n__pure_virtual()\n{\n\twrite (2, MESSAGE, sizeof (MESSAGE) - 1);\n\t_exit (1);\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <tuple>\n#include <limits>\n\nnamespace ceps{\n namespace serialization{\n   namespace basic{\n     constexpr unsigned long long inline read_base128_ull(unsigned char* addr, unsigned short max_width = 10)\n     {\n        unsigned long long r = *((unsigned long long*)addr);\n        if ( (r & 0x80) == 0) return r & 0x7f;\n        else if ( (r & 0x8000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1);\n        else if ( (r & 0x800000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2);\n        else if ( (r & 0x80000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) ;\n        else if ( (r & 0x8000000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                ((r & 0x7f00000000) >> 4) ;\n        else if ( (r & 0x800000000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) ;\n        else if ( (r & 0x80000000000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) | ((r & 0x7f000000000000) >> 6);\n        else if ( (r & 0x8000000000000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) | \n                ((r & 0x7f000000000000) >> 6) | ((r & 0x7f00000000000000) >> 7);\n        else if ((*(addr + sizeof(unsigned long long int)) & 0x80) == 0) \n          return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                 ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) | \n                 ((r & 0x7f000000000000) >> 6) | ((r & 0x7f00000000000000) >> 7) | \n                 ((unsigned long long int)(*(addr + sizeof(unsigned long long int)) & 0x7f) << 56);\n        return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n               ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) | \n               ((r & 0x7f000000000000) >> 6) | ((r & 0x7f00000000000000) >> 7) | \n               ((unsigned long long int)(*(addr + sizeof(unsigned long long int)) & 0x7f) << 56)| \n               ((unsigned long long int)(*(addr + sizeof(unsigned long long int)+1) & 0x01) << 63);\n     }\n   }\n   unsigned short write_base128(unsigned char* addr, unsigned long long value){\n          unsigned short bytes_to_write = 0;\n          if (0x8000000000000000 & value){ \/\/ => 80 bit representation (64 bit value)\n            bytes_to_write = 10;\n          }\n          else if (0x7f00000000000000 & value){ \/\/ => 72 bit representation (63 bit value)\n            bytes_to_write = 9;\n          }\n          else if (0xfe000000000000 & value){ \/\/ => 64 bit representation (56 bit value)\n            bytes_to_write = 8;\n          }\n          else if (  0x1fC0000000000 & value){ \/\/ => 56 bit representation (49 bit value)\n            bytes_to_write = 7;\n          }\n          else if (    0x3f800000000 & value){ \/\/ => 48 bit representation (42 bit representation)\n            bytes_to_write = 6;\n          }\n          else if (0x7f0000000 & value){ \/\/ => 40 bit representation (35 bit representation)\n            bytes_to_write = 5;\n          }\n          else if (0xfe00000 & value){ \/\/ => 32 bit representation (28 bit representation)\n            bytes_to_write = 4;\n          }\n          else if (0x1fc000 & value){ \/\/ => 24 bit representation (21 bit representation)\n            bytes_to_write = 3;\n          }\n          else if (0x7f80 & value){ \/\/ => 16 bit representation (14 bit representation)\n            bytes_to_write = 2;\n          } else { \/\/ 8bit representation (7 bit value)\n            bytes_to_write = 1;\n          }\n          for (unsigned short i = 0; i != bytes_to_write;++i,value >>= 7){\n              *addr = value & 0x7F | (i + 1 != bytes_to_write ? 0x80:0);\n              ++addr;\n          }\n          return bytes_to_write;\n   }\n\n  template<typename T> struct mem_tag{      \n\n  };\n  template<> struct mem_tag<std::int32_t>{\n     using tag_t = signed char; \n     static const tag_t tag = 5; \n     static const tag_t rle_tag = -5;\n     static const size_t tag_len = sizeof(tag_t);  \n  };\n   \n  struct tag_match_result_t{\n      operator bool(){return match;}\n      bool match; \n      bool rle;\n  };\n  \n  template<typename T> struct type_handler:public mem_tag<T>{\n      static size_t write_tag(char* addr,bool rle = false){\n          *((typename mem_tag<T>::tag_t*)addr) = rle?mem_tag<T>::rle_tag:mem_tag<T>::tag;\n          return mem_tag<T>::tag_len;\n      }\n      static void write_length_7bit_encoded(char* addr,int v){\n          *addr = v;\n      }\n      static size_t increment_7bit_encoded(char* addr,size_t width){\n          unsigned long long int stored_value = 0;\n          stored_value = basic::read_base128_ull((unsigned char*) addr,width);\n          ++stored_value;\n          return  write_base128( (unsigned char*)addr, stored_value);\n      }\n      static tag_match_result_t tag_match(char* addr){\n          if (*addr == mem_tag<T>::tag || *addr == mem_tag<T>::rle_tag)\n           return{true,*addr == mem_tag<T>::rle_tag};\n          return {false,false}; \n      }       \n  };\n\n  class mem{\n      public:\n        struct seg_info{\n            char* type_seg_          = {};\n            char* info_seg_          = {};\n            size_t type_seg_size_    = {};\n            size_t info_seg_size_    = {};\n            size_t type_seg_ofs_     = {};\n            size_t info_seg_ofs_     = {};\n            size_t info_seg_written_ = {};\n            size_t type_seg_written_ = {};\n        };\n        using set_mem_result_t = seg_info;\n        using write_result_t = std::pair<size_t,size_t>;\n      private:\n        seg_info segs_ = {};\n      public:\n        set_mem_result_t set_mem(seg_info new_seg_info){\n            auto t = segs_;\n            segs_ = new_seg_info;\n            return segs_;\n        }\n        write_result_t write_unchecked(std::int32_t v,bool write_through = true){\n            \/\/Write Data\n            if (write_through) *((decltype(v)*) (segs_.info_seg_+segs_.info_seg_written_) ) = v;\n            segs_.info_seg_written_ += sizeof(v);\n            \/\/Write Type\n            if (segs_.type_seg_ofs_ == segs_.type_seg_written_){\n                \/\/Start of a data\n                segs_.type_seg_written_ += type_handler<decltype(v)>::write_tag(segs_.type_seg_ + segs_.type_seg_ofs_);\n            } else if (auto r = type_handler<decltype(v)>::tag_match(segs_.type_seg_ + segs_.type_seg_ofs_)) {\n                if(!r.rle) {\n                    type_handler<decltype(v)>::write_tag(segs_.type_seg_ + segs_.type_seg_ofs_,true);\n                    type_handler<decltype(v)>::write_length_7bit_encoded(segs_.type_seg_ + segs_.type_seg_ofs_ + 1,2);\n                    ++segs_.type_seg_written_;\n                } else {\n                    auto cur_width_of_len_tag = segs_.type_seg_written_ - segs_.type_seg_ofs_ - 1;\n                    auto cur_width = type_handler<decltype(v)>::increment_7bit_encoded(segs_.type_seg_ + segs_.type_seg_ofs_ + 1,segs_.type_seg_written_ - segs_.type_seg_ofs_ - 1);\n                    if (cur_width > cur_width_of_len_tag) segs_.type_seg_written_ += cur_width - cur_width_of_len_tag;\n                }            \n            }            \n            return {};\n        }\n        std::ostream& dump_info(std::ostream& os){\n            for(size_t i = 0;i != segs_.info_seg_written_;++i){\n             if (i % 16 == 0) os << \"\\n\";\n             os << (int)*( ((unsigned char *)segs_.info_seg_)+i) << ' ';\n            }\n            return os;\n        }\n        std::ostream& dump_type(std::ostream& os){\n            for(size_t i = 0;i != segs_.type_seg_written_;++i){\n             if (i % 16 == 0) os << \"\\n\";\n             os << (int)*( (unsigned char *) segs_.type_seg_+i) << ' ';\n            }\n            return os;\n        }\n\n  };\n }\n}\n\n\nnamespace ceps{\n namespace serialization{\n   namespace basic{\n     namespace tests{\n       void dump_data(unsigned char* buffer, size_t elems){\n         for(size_t i = 0; i != elems;++i)\n          std::cout << (unsigned int)buffer[i] << (i % 16 == 0 ? \"\\n\":\" \");\n       }\n       void read_write_128_base(){\n         unsigned char buffer[128];\n         auto wr1 = write_base128(buffer, 0);\n         auto rr1 = read_base128_ull(buffer);\n         std::cout << \"bytes written:\"<< wr1 << \" value read:\" << rr1 << \"\\n\";\n         auto wr2 = write_base128(buffer, 1);\n         auto rr2 = read_base128_ull(buffer);\n         std::cout << \"bytes written:\"<< wr2 << \" value read:\" << rr2 << \"\\n\";\n         auto wr3 = write_base128(buffer, 127);\n         auto rr3 = read_base128_ull(buffer);\n         std::cout << \"bytes written:\"<< wr3 << \" value read:\" << rr3 << \"\\n\";\n         auto wr4 = write_base128(buffer, 128);\n         auto rr4 = read_base128_ull(buffer);\n         std::cout << \"bytes written:\"<< wr4 << \" value read:\" << rr4 << \"\\n\";\n\n       }\n     }\n   }\n  }\n}\nint main(){\n    ceps::serialization::basic::tests::read_write_128_base();\n    return 0;\n    std::cout << \"Serialization Study I\\n\";\n    constexpr auto mem_size = 1024*1024;\n    char* info_seg = new char[mem_size];\n    char* type_seg = new char[mem_size];\n    ceps::serialization::mem mem;\n    \/\/for (int i = 0; i <= 16384;++i)\n    \/\/ mem.write_unchecked(i,false);\n    \/\/1  2  4  8  16  32  64  128 256 512 1024 2048 4096 8192  16384 32768  65536  131072  262144  524288  1048576\n    \/\/0  1  2  3  4   5   6   7   8   9   10   11   12   13    14    15     16     17      18      19      20\n    \/\/|-------- 0 - 127----| |----------128 -16383 ---------| | -------------- 16384 - 1048575 -------------------| \n\n    for (unsigned int i = 0; i <= 63;++i){\n        mem.set_mem({info_seg,type_seg,mem_size,mem_size,0,0,0,0});\n        for(unsigned long long j=0;j < 1 << i; ++j)\n          mem.write_unchecked(j,false);\n        std::cerr << \"\\nType Segment:2^\"<< i << \":\";\n        mem.dump_type(std::cerr);\n    }\n    \n    \/\/std::cout << \"Info Segment:\\n\";mem.dump_info(std::cout);std::cout << \"\\n\\n\";\n    \/\/std::cout << \"Type Segment:\\n\";mem.dump_type(std::cout);\n}<commit_msg>Tests<commit_after>#include <iostream>\n#include <iomanip>\n#include <tuple>\n#include <limits>\n#include <cstring>\n#include <cassert>\n\nnamespace ceps{\n namespace serialization{\n   namespace basic{\n     constexpr unsigned long long inline read_base128_ull(unsigned char* addr, unsigned short max_width = 10)\n     {\n        unsigned long long r = *((unsigned long long*)addr);\n        if ( (r & 0x80) == 0) return r & 0x7f;\n        else if ( (r & 0x8000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1);\n        else if ( (r & 0x800000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2);\n        else if ( (r & 0x80000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) ;\n        else if ( (r & 0x8000000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                ((r & 0x7f00000000) >> 4) ;\n        else if ( (r & 0x800000000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) ;\n        else if ( (r & 0x80000000000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) | ((r & 0x7f000000000000) >> 6);\n        else if ( (r & 0x8000000000000000) == 0) \n         return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) | \n                ((r & 0x7f000000000000) >> 6) | ((r & 0x7f00000000000000) >> 7);\n        else if ((*(addr + sizeof(unsigned long long int)) & 0x80) == 0) \n          return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n                 ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) | \n                 ((r & 0x7f000000000000) >> 6) | ((r & 0x7f00000000000000) >> 7) | \n                 ((unsigned long long int)(*(addr + sizeof(unsigned long long int)) & 0x7f) << 56);\n        return (r & 0x7f) | ((r & 0x7f00) >> 1) | ((r & 0x7f0000) >> 2) | ((r & 0x7f000000) >> 3) | \n               ((r & 0x7f00000000) >> 4) | ((r & 0x7f0000000000) >> 5) | \n               ((r & 0x7f000000000000) >> 6) | ((r & 0x7f00000000000000) >> 7) | \n               ((unsigned long long int)(*(addr + sizeof(unsigned long long int)) & 0x7f) << 56)| \n               ((unsigned long long int)(*(addr + sizeof(unsigned long long int)+1) & 0x01) << 63);\n     }\n   }\n   unsigned short write_base128(unsigned char* addr, unsigned long long value){\n          unsigned short bytes_to_write = 0;\n          if (0x8000000000000000 & value){ \/\/ => 80 bit representation (64 bit value)\n            bytes_to_write = 10;\n          }\n          else if (0x7f00000000000000 & value){ \/\/ => 72 bit representation (63 bit value)\n            bytes_to_write = 9;\n          }\n          else if (0xfe000000000000 & value){ \/\/ => 64 bit representation (56 bit value)\n            bytes_to_write = 8;\n          }\n          else if (  0x1fC0000000000 & value){ \/\/ => 56 bit representation (49 bit value)\n            bytes_to_write = 7;\n          }\n          else if (    0x3f800000000 & value){ \/\/ => 48 bit representation (42 bit representation)\n            bytes_to_write = 6;\n          }\n          else if (0x7f0000000 & value){ \/\/ => 40 bit representation (35 bit representation)\n            bytes_to_write = 5;\n          }\n          else if (0xfe00000 & value){ \/\/ => 32 bit representation (28 bit representation)\n            bytes_to_write = 4;\n          }\n          else if (0x1fc000 & value){ \/\/ => 24 bit representation (21 bit representation)\n            bytes_to_write = 3;\n          }\n          else if (0x7f80 & value){ \/\/ => 16 bit representation (14 bit representation)\n            bytes_to_write = 2;\n          } else { \/\/ 8bit representation (7 bit value)\n            bytes_to_write = 1;\n          }\n          for (unsigned short i = 0; i != bytes_to_write;++i,value >>= 7){\n              *addr = value & 0x7F | (i + 1 != bytes_to_write ? 0x80:0);\n              ++addr;\n          }\n          return bytes_to_write;\n   }\n   \n   unsigned short write_base128(unsigned char* addr, unsigned int value){\n          return write_base128(addr, (unsigned long long) value);\n   }\n\n   unsigned short write_base128(unsigned char* addr, unsigned short value){\n          return write_base128(addr, (unsigned long long) value);\n   }\n\n   unsigned short write_base128(unsigned char* addr, unsigned char value){\n          return write_base128(addr, (unsigned long long) value);\n   }\n\n  template<typename T> struct mem_tag{      \n\n  };\n  template<> struct mem_tag<std::int32_t>{\n     using tag_t = signed char; \n     static const tag_t tag = 5; \n     static const tag_t rle_tag = -5;\n     static const size_t tag_len = sizeof(tag_t);  \n  };\n   \n  struct tag_match_result_t{\n      operator bool(){return match;}\n      bool match; \n      bool rle;\n  };\n  \n  template<typename T> struct type_handler:public mem_tag<T>{\n      static size_t write_tag(char* addr,bool rle = false){\n          *((typename mem_tag<T>::tag_t*)addr) = rle?mem_tag<T>::rle_tag:mem_tag<T>::tag;\n          return mem_tag<T>::tag_len;\n      }\n      static void write_length_7bit_encoded(char* addr,int v){\n          *addr = v;\n      }\n      static size_t increment_7bit_encoded(char* addr,size_t width){\n          unsigned long long int stored_value = 0;\n          stored_value = basic::read_base128_ull((unsigned char*) addr,width);\n          ++stored_value;\n          return  write_base128( (unsigned char*)addr, stored_value);\n      }\n      static tag_match_result_t tag_match(char* addr){\n          if (*addr == mem_tag<T>::tag || *addr == mem_tag<T>::rle_tag)\n           return{true,*addr == mem_tag<T>::rle_tag};\n          return {false,false}; \n      }       \n  };\n\n  class mem{\n      public:\n        struct seg_info{\n            char* type_seg_          = {};\n            char* info_seg_          = {};\n            size_t type_seg_size_    = {};\n            size_t info_seg_size_    = {};\n            size_t type_seg_ofs_     = {};\n            size_t info_seg_ofs_     = {};\n            size_t info_seg_written_ = {};\n            size_t type_seg_written_ = {};\n        };\n        using set_mem_result_t = seg_info;\n        using write_result_t = std::pair<size_t,size_t>;\n      private:\n        seg_info segs_ = {};\n      public:\n        set_mem_result_t set_mem(seg_info new_seg_info){\n            auto t = segs_;\n            segs_ = new_seg_info;\n            return segs_;\n        }\n        write_result_t write_unchecked(std::int32_t v,bool write_through = true){\n            \/\/Write Data\n            if (write_through) *((decltype(v)*) (segs_.info_seg_+segs_.info_seg_written_) ) = v;\n            segs_.info_seg_written_ += sizeof(v);\n            \/\/Write Type\n            if (segs_.type_seg_ofs_ == segs_.type_seg_written_){\n                \/\/Start of a data\n                segs_.type_seg_written_ += type_handler<decltype(v)>::write_tag(segs_.type_seg_ + segs_.type_seg_ofs_);\n            } else if (auto r = type_handler<decltype(v)>::tag_match(segs_.type_seg_ + segs_.type_seg_ofs_)) {\n                if(!r.rle) {\n                    type_handler<decltype(v)>::write_tag(segs_.type_seg_ + segs_.type_seg_ofs_,true);\n                    type_handler<decltype(v)>::write_length_7bit_encoded(segs_.type_seg_ + segs_.type_seg_ofs_ + 1,2);\n                    ++segs_.type_seg_written_;\n                } else {\n                    auto cur_width_of_len_tag = segs_.type_seg_written_ - segs_.type_seg_ofs_ - 1;\n                    auto cur_width = type_handler<decltype(v)>::increment_7bit_encoded(segs_.type_seg_ + segs_.type_seg_ofs_ + 1,segs_.type_seg_written_ - segs_.type_seg_ofs_ - 1);\n                    if (cur_width > cur_width_of_len_tag) segs_.type_seg_written_ += cur_width - cur_width_of_len_tag;\n                }            \n            }            \n            return {};\n        }\n        std::ostream& dump_info(std::ostream& os){\n            for(size_t i = 0;i != segs_.info_seg_written_;++i){\n             if (i % 16 == 0) os << \"\\n\";\n             os << (int)*( ((unsigned char *)segs_.info_seg_)+i) << ' ';\n            }\n            return os;\n        }\n        std::ostream& dump_type(std::ostream& os){\n            for(size_t i = 0;i != segs_.type_seg_written_;++i){\n             if (i % 16 == 0) os << \"\\n\";\n             os << (int)*( (unsigned char *) segs_.type_seg_+i) << ' ';\n            }\n            return os;\n        }\n\n  };\n }\n}\n\n\nnamespace ceps{\n namespace serialization{\n   namespace basic{\n     namespace tests{\n       void dump_data(unsigned char* buffer, size_t elems){\n         for(size_t i = 0; i != elems;++i)\n          std::cout << std::setw(4) << std::setfill(' ') << (unsigned int)buffer[i] << ((i+1) % 16 == 0 ? \"\\n\":\" \");\n       }\n       void read_write_128_base(){\n         constexpr auto buf_size = 128;\n         unsigned char buffer[buf_size];\/\/ = {0};\n         auto read_write_128_base_step = [&](unsigned long long v){\n                    memset(buffer,0,buf_size); \n                    auto wr = write_base128(buffer, v);\n                    auto rr = read_base128_ull(buffer);\n                    if (v!=rr){ \n                      std::cout << \"bytes written:\"<< wr << \" value read:\" << rr << \" value expected: \" << v << \"\\n\";\n                      dump_data(buffer,buf_size);\n                      assert(v==rr);\n                    }\n         };\n            \/\/1  2  4  8  16  32  64  128 256 512 1024 2048 4096 8192  16384 32768  65536  131072  262144  524288  1048576\n            \/\/0  1  2  3  4   5   6   7   8   9   10   11   12   13    14    15     16     17      18      19      20\n            \/\/|-------- 0 - 127----| |----------128 -16383 ---------| | -------------- 16384 - 1048575 -------------------| \n\n         for (auto v : {0ull,1ull,127ull,128ull,129ull,16383ull,16384ull,32768ull,1048676ull,1048677ull,\n                        0x0ull,0xfull,0xffull,0xfffull,0xffffull,0xfffffull,0xffffffull,0xfffffffull,0xffffffffull,0xfffffffffull,0xffffffffffull,\n                        0xfffffffffffull,0xffffffffffffull,0xfffffffffffffull,0xffffffffffffffull,0xfffffffffffffffull, 0xffffffffffffffffull,\n                        0x1ull,0xeull,0xfeull,0xefull,0xfffull,0xeffull,0xaffull,0xbf3ull,0xffffull,0xfffffull,0xffffffull,0xfffffffull,0xffffffffull,\n                        0xfffffffffull,0xffffffffffull,0xfffffffffffull,0xffffffffffffull,0xfffffffffffffull,0xffffffffffffffull,0xfffffffffffffffull, \n                        0xffffffffffffffffull,\n                         }\n                        )\n           read_write_128_base_step(v);\n       }\n       void run_all(){\n         read_write_128_base();\n       }\n     }\n   }\n  }\n}\n\nint main(){\n    ceps::serialization::basic::tests::run_all();\n}<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <memory>\n#include <logger_export.h>\n\nnamespace logger\n{\n    class LOGGER_EXPORT ILogger \n    {\n    public:\n        virtual ~ILogger() {};\n        virtual void Trace(const std::string& message) = 0;\n        virtual void Error(const std::string& message) = 0;\n    };\n    \n    LOGGER_EXPORT ILogger* createMainLogger();\n    LOGGER_EXPORT ILogger* getLogger(const std::string& module);\n}\n<commit_msg>Include string<commit_after>#pragma once\n\n#include <string>\n\n#include <logger_export.h>\n\nnamespace logger\n{\n    class LOGGER_EXPORT ILogger \n    {\n    public:\n        virtual ~ILogger() {};\n        virtual void Trace(const std::string& message) = 0;\n        virtual void Error(const std::string& message) = 0;\n    };\n    \n    LOGGER_EXPORT ILogger* createMainLogger();\n    LOGGER_EXPORT ILogger* getLogger(const std::string& module);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* \n** Copyright 1994 by Miron Livny, and Mike Litzkow\n** \n** Permission to use, copy, modify, and distribute this software and its\n** documentation for any purpose and without fee is hereby granted,\n** provided that the above copyright notice appear in all copies and that\n** both that copyright notice and this permission notice appear in\n** supporting documentation, and that the names of the University of\n** Wisconsin and the copyright holders not be used in advertising or\n** publicity pertaining to distribution of the software without specific,\n** written prior permission.  The University of Wisconsin and the \n** copyright holders make no representations about the suitability of this\n** software for any purpose.  It is provided \"as is\" without express\n** or implied warranty.\n** \n** THE UNIVERSITY OF WISCONSIN AND THE COPYRIGHT HOLDERS DISCLAIM ALL\n** WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES\n** OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE UNIVERSITY OF\n** WISCONSIN OR THE COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT\n** OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n** OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE\n** OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE\n** OR PERFORMANCE OF THIS SOFTWARE.\n** \n** Author:  Mike Litzkow\n**\n*\/ \n\n\/*\n  Build site specific versions of config and script files by dialoging\n  with the user to get\/confirm settings.\n*\/\n\n#define _POSIX_SOURCE\n\n#include <stdio.h>\n#include <limits.h>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include \"custom.h\"\n\nconst int MATCH = 0;\t\/\/ for strcmp()\n\nint check_dir( const char *path );\nint check_exec( const char *path );\nchar * xlate_tilde( const char *path );\nchar * lookup_tilde( char *orig,  const char *user );\nint check_host( const char *name );\n\n\/*\n  All the macros which are to be customized should go here.  Parameters\n  are:\n\tMacro name\n\tDescription\n\tDefault value\n*\/\nMacro release_dir(\n\t\"RELEASEDIR\",\n\t\"Full pathname of the parent directory of Condor's \\\"bin\\\" and \\\"lib\\\"\\n\\\ndirectories.  For example: specifying \\\"\/usr\/psup\/condor\\\" means that\\n\\\nusers will find Condor libraries and executables in \\\"\/usr\/psup\/condor\/lib\\\"\\n\\\nand \\\"\/usr\/psup\/condor\/bin\\\" respectively.\",\n\t\"\/usr\/psup\/condor\"\n);\nMacro condor_host(\n\t\"CONDOR_HOST\",\n\t\"Host where central manager should run, this should be a fully qualified\\n\\\ninternet domain name.\",\n\t\"frigg.cs.wisc.edu\"\n);\nMacro condor_admin(\n\t\"CONDOR_ADMIN\",\n\"Address of the local condor administrator, for automatically generated\\n\\\nmail regarding problems\",\n\t\"condor-admin\"\n);\nMacro condor_developers(\n\t\"CONDOR_DEVELOPERS\",\n\"Address of condor development team at University of Wisconsin, for\\n\\\nautomatically generated mail regarding status of Condor at your site\",\n\t\"condor-admin@cs.wisc.edu\"\n);\nMacro local_dir(\n\t\"LOCAL_DIR\",\n\"Parent directory for machine specific directories \\\"spool\\\", \\\"log\\\", and\\n\\\n\\\"execute\\\".  Specifying $(TILDE) means condor's home directory\",\n\t\"$(TILDE)\"\n);\nMacro has_afs(\n\t\"HAS_AFS\",\n\t\"Does this machine run AFS?\",\n\t\"TRUE\"\n);\nMacro use_afs(\n\t\"USE_AFS\",\n\t\"Do you want to use AFS for condor file access?\",\n\t\"FALSE\"\n);\nMacro fs_path(\n\t\"FS_PATHNAME\",\n\t\"Pathname of the AFS \\\"fs\\\" command\",\n\t\"\/usr\/afsws\/bin\/fs\"\n);\nMacro vos_path(\n\t\"VOS_PATHNAME\",\n\t\"Pathname of the AFS \\\"vos\\\" command\",\n\t\"\/usr\/afsws\/etc\/vos\"\n);\nMacro mailer_path(\n\t\"MAIL\",\n\t\"Pathname of user level program Condor software should use to send mail\",\n#if defined(SUNOS41) || defined(ULTRIX43)\n\t\"\/usr\/ucb\/mail\"\n#else\n\t\"\/bin\/mail\"\n#endif\n);\nMacro uid_domain(\n\t\"UID_DOMAIN\",\n\t\"Internet domain of machines sharing a common UID space.  If you\\n\\\nspecify a UID space, Condor will execute user jobs under the\\n\\\nUID of the submitting user - otherwise Condor will execute user\\n\\\njobs with the UID \\\"nobody\\\".  Specify \\\"none\\\" unless all machines\\n\\\nin your pool are guaranteed to have consistent UIDs.\",\n\t\"cs.wisc.edu\"\n);\nMacro filesystem_domain(\n\t\"FILESYSTEM_DOMAIN\",\n\t\"\\nInternet domain of machines sharing a common NFS file space\",\n\t\"cs.wisc.edu\"\n);\n\nint\nmain()\n{\n\tConfigFile\t*file;\n\tchar\t\tdir[_POSIX_PATH_MAX];\n\tint\t\t\twe_have_afs = 0;\n\tint\t\t\twe_have_fs_domain = 0;\n\n\t\t\/\/ Customize the macros by dialoging with the user\n\tcondor_host.init( check_host );\n\tcondor_admin.init();\n\tcondor_developers.init();\n\trelease_dir.init( check_dir );\n\tlocal_dir.init( check_dir );\n\tif( confirm(\"Will all machines in your pool participate in a common file system via AFS? \") ) {\n\t\twe_have_afs = 1;\n\t\thas_afs.init( TRUE );\n\t\tif( confirm(\"\\nDo you want to use AFS for condor file access? (This may not have\\n a positive impact on performance.)\") ) {\n\t\t\tuse_afs.init( TRUE );\n\t\t} else {\n\t\t\tuse_afs.init( FALSE );\n\t\t}\n\t\tfs_path.init( check_exec );\n\t\tvos_path.init( check_exec );\n\t} else {\n\t\thas_afs.init( FALSE );\n\t}\n\tmailer_path.init( check_exec );\n\tuid_domain.init();\n\tif( confirm(\"Will all machines in your pool participate in a common file system via NFS? \") ) {\n\t\twe_have_fs_domain = 1;\n\t\tfilesystem_domain.init();\n\t}\n\n\t\t\/\/ Make user confirm that everything is correct\n\tprintf( \"Please Confirm:\\n\" );\n\tprintf( \"\\t%s\\n\", release_dir.gen() );\n\tprintf( \"\\t%s\\n\", condor_host.gen() );\n\tprintf( \"\\t%s\\n\", condor_admin.gen() );\n\tprintf( \"\\t%s\\n\", condor_developers.gen() );\n\tprintf( \"\\t%s\\n\", local_dir.gen() );\n\tprintf( \"\\t%s\\n\", has_afs.gen() );\n\tprintf( \"\\t%s\\n\", use_afs.gen() );\n\tif( we_have_afs ) {\n\t\tprintf( \"\\t%s\\n\", fs_path.gen() );\n\t\tprintf( \"\\t%s\\n\", vos_path.gen() );\n\t}\n\tprintf( \"\\t%s\\n\", mailer_path.gen() );\n\tprintf( \"\\t%s\\n\", uid_domain.gen() );\n\tif( we_have_fs_domain ) {\n\t\tprintf( \"\\t%s\\n\", filesystem_domain.gen() );\n\t}\n\tif( !confirm(\"Are all the above settings correct? \") ) {\n\t\tprintf( \"Configuration Aborted\\n\" );\n\t\treturn 1;\n\t}\n\n\t\t\/\/ Prepare to customize the files in the \"lib\" directory.\n\tstrcpy( dir, release_dir.get_val() );\n\tstrcat( dir, \"\/lib\" );\n\tfile = new ConfigFile( dir );\n\n\t\t\/\/ Customize \"condor_config\"\n\tfile->begin( \"condor_config\" );\n\tfile->add_macro( release_dir.gen() );\n\tfile->add_macro( condor_host.gen() );\n\tfile->add_macro( condor_admin.gen() );\n\tfile->add_macro( condor_developers.gen() );\n\tfile->add_macro( local_dir.gen() );\n\tfile->add_macro( has_afs.gen() );\n\tif( we_have_afs ) {\n\t\tfile->add_macro( use_afs.gen() );\n\t\tfile->add_macro( fs_path.gen() );\n\t\tfile->add_macro( vos_path.gen() );\n\t}\n\tfile->add_macro( mailer_path.gen() );\n\tfile->add_macro( uid_domain.gen() );\n\tif( we_have_fs_domain ) {\n\t\tfile->add_macro( filesystem_domain.gen() );\n\t}\n\tfile->end();\n\n\t\t\/\/ Customize \"config_off\"\n\tfile->begin( \"config_off\" );\n\tfile->add_macro( release_dir.gen(TRUE) );\n\tfile->end();\n\n\t\t\/\/ Customize \"config_on\"\n\tfile->begin( \"config_on\" );\n\tfile->add_macro( release_dir.gen(TRUE) );\n\tfile->end();\n\n\t\t\/\/ Prepare to customize the files in the \"bin\" directory.\n\tdelete file;\n\tstrcpy( dir, release_dir.get_val() );\n\tstrcat( dir, \"\/bin\" );\n\tfile = new ConfigFile( dir );\n\n\t\t\/\/ Customize \"condor_init\"\n\tfile->begin( \"condor_init\" );\n\tfile->add_macro( \"#!\/bin\/csh -f\" );\n\tfile->add_macro( \"\" );\n\tfile->add_macro( release_dir.gen(TRUE) );\n\tfile->end();\n\n\t\t\/\/ Customize \"condor_throttle\"\n\tfile->begin( \"condor_throttle\" );\n\tfile->add_macro( \"#!\/bin\/csh -f\" );\n\tfile->add_macro( \"\" );\n\tfile->add_macro( release_dir.gen(TRUE) );\n\tfile->end();\n\n\tdelete file;\n\tprintf( \"\\nCustomization Complete\\n\" );\n\n\treturn 0;\n}\n\n\/*\n  Check a directory for validity.  We only check that this is a real\n  directory on the system - no permissions or other reasonableness\n  criteria are checked.  The directory name may contain the component\n  $(TILDE) which is interpreted to mean \"~condor\".\n*\/\nint\ncheck_dir( const char *path )\n{\n\tstruct stat\tbuf;\n\tchar\t\t*tmp;\n\n\tif( path[0] != '\/' && path[0] != '$' ) {\n\t\tprintf( \"Must supply a full pathname starting with \\\"\/\\\"\\n\" );\n\t\treturn FALSE;\n\t}\n\n\ttmp = xlate_tilde( path );\n\n\tif( stat(tmp,&buf) < 0 ) {\n\t\tprintf( \"Warning: \\\"%s\\\" is not a valid directory\\n\", path );\n\t\treturn FALSE;\n\t}\n\n\tif( S_ISDIR(buf.st_mode) ) {\n\t\treturn TRUE;\n\t} else {\n\t\tprintf( \"Warning: \\\"%s\\\" is not a valid directory\\n\", path );\n\t\treturn FALSE;\n\t}\n}\n\n\/*\n  Translate a pathname which may contain $(TILDE) to a simple pathname.\n*\/\nchar *\nxlate_tilde( const char *path )\n{\n\tstatic char answer[_POSIX_PATH_MAX];\n\tchar\t*component;\n\tchar\t*tmp;\n\n\ttmp = new char[ strlen(path) + 1 ];\n\tstrcpy( tmp, path );\n\n\tcomponent = strtok( tmp, \"\/\" );\n\tif( strcmp(\"$(TILDE)\",component) == MATCH ) {\n\t\tcomponent = lookup_tilde( component, \"condor\" );\n\t}\n\tstrcpy( answer, \"\/\" );\n\tstrcat( answer, component );\n\n\twhile( component = strtok(NULL,\"\/\") ) {\n\t\tif( strcmp(\"$(TILDE)\",component) == MATCH ) {\n\t\t\tcomponent = lookup_tilde( component, \"condor\" );\n\t\t}\n\t\tstrcat( answer, \"\/\" );\n\t\tstrcat( answer, component );\n\t}\n\tdelete [] tmp;\n\treturn answer;\n}\n\n\/*\n  Lookup the given user's home directory.\n*\/\n#include <pwd.h>\nchar *\nlookup_tilde( char *orig,  const char *user )\n{\n\tstruct passwd *entry;\n\n\tif( (entry = getpwnam(user)) == NULL ) {\n\t\tprintf( \"Warning: Can't find user \\\"%s\\\" in passwd file\\n\", user );\n\t\treturn orig;\n\t}\n\treturn entry->pw_dir + 1;\n}\n\nextern \"C\" {\n#\tinclude <netdb.h>\n}\nint check_host( const char *name )\n{\n\tstruct hostent\t*hp;\n\n\tif( gethostbyname(name) ) {\n\t\treturn TRUE;\n\t} else {\n\t\tprintf( \"Warning: Can't locate host \\\"%s\\\"\\n\", name );\n\t\treturn FALSE;\n\t}\n}\n\n\/*\n  Check a pathname for an executable program for validity.  The\n  pathname may contain the component $(TILDE) which is interpreted to\n  mean \"~condor\".\n*\/\nint\ncheck_exec( const char *path )\n{\n\tstruct stat\tbuf;\n\tchar\t\t*tmp;\n\n\tif( path[0] != '\/' && path[0] != '$' ) {\n\t\tprintf( \"Must supply a full pathname starting with \\\"\/\\\"\\n\" );\n\t\treturn FALSE;\n\t}\n\n\ttmp = xlate_tilde( path );\n\n\tif( stat(tmp,&buf) < 0 ) {\n\t\tprintf( \"Warning: \\\"%s\\\" is not a valid pathname\\n\", path );\n\t\treturn FALSE;\n\t}\n\n\tif( S_IXUSR & buf.st_mode ) {\n\t\treturn TRUE;\n\t} else {\n\t\tprintf( \"Warning: \\\"%s\\\" is not an executable file\\n\", path );\n\t\treturn FALSE;\n\t}\n}\n<commit_msg>Moved call to use_afs.gen() inside test for we_have_afs.  If the user answers no to has_afs, then use_afs is never asked, thus having no value, and use_afs.gen() causes a segmentation fault.<commit_after>\/* \n** Copyright 1994 by Miron Livny, and Mike Litzkow\n** \n** Permission to use, copy, modify, and distribute this software and its\n** documentation for any purpose and without fee is hereby granted,\n** provided that the above copyright notice appear in all copies and that\n** both that copyright notice and this permission notice appear in\n** supporting documentation, and that the names of the University of\n** Wisconsin and the copyright holders not be used in advertising or\n** publicity pertaining to distribution of the software without specific,\n** written prior permission.  The University of Wisconsin and the \n** copyright holders make no representations about the suitability of this\n** software for any purpose.  It is provided \"as is\" without express\n** or implied warranty.\n** \n** THE UNIVERSITY OF WISCONSIN AND THE COPYRIGHT HOLDERS DISCLAIM ALL\n** WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES\n** OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE UNIVERSITY OF\n** WISCONSIN OR THE COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT\n** OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n** OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE\n** OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE\n** OR PERFORMANCE OF THIS SOFTWARE.\n** \n** Author:  Mike Litzkow\n**\n*\/ \n\n\/*\n  Build site specific versions of config and script files by dialoging\n  with the user to get\/confirm settings.\n*\/\n\n#define _POSIX_SOURCE\n\n#include <stdio.h>\n#include <limits.h>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include \"custom.h\"\n\nconst int MATCH = 0;\t\/\/ for strcmp()\n\nint check_dir( const char *path );\nint check_exec( const char *path );\nchar * xlate_tilde( const char *path );\nchar * lookup_tilde( char *orig,  const char *user );\nint check_host( const char *name );\n\n\/*\n  All the macros which are to be customized should go here.  Parameters\n  are:\n\tMacro name\n\tDescription\n\tDefault value\n*\/\nMacro release_dir(\n\t\"RELEASEDIR\",\n\t\"Full pathname of the parent directory of Condor's \\\"bin\\\" and \\\"lib\\\"\\n\\\ndirectories.  For example: specifying \\\"\/usr\/psup\/condor\\\" means that\\n\\\nusers will find Condor libraries and executables in \\\"\/usr\/psup\/condor\/lib\\\"\\n\\\nand \\\"\/usr\/psup\/condor\/bin\\\" respectively.\",\n\t\"\/usr\/psup\/condor\"\n);\nMacro condor_host(\n\t\"CONDOR_HOST\",\n\t\"Host where central manager should run, this should be a fully qualified\\n\\\ninternet domain name.\",\n\t\"frigg.cs.wisc.edu\"\n);\nMacro condor_admin(\n\t\"CONDOR_ADMIN\",\n\"Address of the local condor administrator, for automatically generated\\n\\\nmail regarding problems\",\n\t\"condor-admin\"\n);\nMacro condor_developers(\n\t\"CONDOR_DEVELOPERS\",\n\"Address of condor development team at University of Wisconsin, for\\n\\\nautomatically generated mail regarding status of Condor at your site\",\n\t\"condor-admin@cs.wisc.edu\"\n);\nMacro local_dir(\n\t\"LOCAL_DIR\",\n\"Parent directory for machine specific directories \\\"spool\\\", \\\"log\\\", and\\n\\\n\\\"execute\\\".  Specifying $(TILDE) means condor's home directory\",\n\t\"$(TILDE)\"\n);\nMacro has_afs(\n\t\"HAS_AFS\",\n\t\"Does this machine run AFS?\",\n\t\"TRUE\"\n);\nMacro use_afs(\n\t\"USE_AFS\",\n\t\"Do you want to use AFS for condor file access?\",\n\t\"FALSE\"\n);\nMacro fs_path(\n\t\"FS_PATHNAME\",\n\t\"Pathname of the AFS \\\"fs\\\" command\",\n\t\"\/usr\/afsws\/bin\/fs\"\n);\nMacro vos_path(\n\t\"VOS_PATHNAME\",\n\t\"Pathname of the AFS \\\"vos\\\" command\",\n\t\"\/usr\/afsws\/etc\/vos\"\n);\nMacro mailer_path(\n\t\"MAIL\",\n\t\"Pathname of user level program Condor software should use to send mail\",\n#if defined(SUNOS41) || defined(ULTRIX43)\n\t\"\/usr\/ucb\/mail\"\n#else\n\t\"\/bin\/mail\"\n#endif\n);\nMacro uid_domain(\n\t\"UID_DOMAIN\",\n\t\"Internet domain of machines sharing a common UID space.  If you\\n\\\nspecify a UID space, Condor will execute user jobs under the\\n\\\nUID of the submitting user - otherwise Condor will execute user\\n\\\njobs with the UID \\\"nobody\\\".  Specify \\\"none\\\" unless all machines\\n\\\nin your pool are guaranteed to have consistent UIDs.\",\n\t\"cs.wisc.edu\"\n);\nMacro filesystem_domain(\n\t\"FILESYSTEM_DOMAIN\",\n\t\"\\nInternet domain of machines sharing a common NFS file space\",\n\t\"cs.wisc.edu\"\n);\n\nint\nmain()\n{\n\tConfigFile\t*file;\n\tchar\t\tdir[_POSIX_PATH_MAX];\n\tint\t\t\twe_have_afs = 0;\n\tint\t\t\twe_have_fs_domain = 0;\n\n\t\t\/\/ Customize the macros by dialoging with the user\n\tcondor_host.init( check_host );\n\tcondor_admin.init();\n\tcondor_developers.init();\n\trelease_dir.init( check_dir );\n\tlocal_dir.init( check_dir );\n\tif( confirm(\"Will all machines in your pool participate in a common file system via AFS? \") ) {\n\t\twe_have_afs = 1;\n\t\thas_afs.init( TRUE );\n\t\tif( confirm(\"\\nDo you want to use AFS for condor file access? (This may not have\\n a positive impact on performance.)\") ) {\n\t\t\tuse_afs.init( TRUE );\n\t\t} else {\n\t\t\tuse_afs.init( FALSE );\n\t\t}\n\t\tfs_path.init( check_exec );\n\t\tvos_path.init( check_exec );\n\t} else {\n\t\thas_afs.init( FALSE );\n\t}\n\tmailer_path.init( check_exec );\n\tuid_domain.init();\n\tif( confirm(\"Will all machines in your pool participate in a common file system via NFS? \") ) {\n\t\twe_have_fs_domain = 1;\n\t\tfilesystem_domain.init();\n\t}\n\n\t\t\/\/ Make user confirm that everything is correct\n\tprintf( \"Please Confirm:\\n\" );\n\tprintf( \"\\t%s\\n\", release_dir.gen() );\n\tprintf( \"\\t%s\\n\", condor_host.gen() );\n\tprintf( \"\\t%s\\n\", condor_admin.gen() );\n\tprintf( \"\\t%s\\n\", condor_developers.gen() );\n\tprintf( \"\\t%s\\n\", local_dir.gen() );\n\tprintf( \"\\t%s\\n\", has_afs.gen() );\n\tif( we_have_afs ) {\n\t\tprintf( \"\\t%s\\n\", use_afs.gen() );\n\t\tprintf( \"\\t%s\\n\", fs_path.gen() );\n\t\tprintf( \"\\t%s\\n\", vos_path.gen() );\n\t}\n\tprintf( \"\\t%s\\n\", mailer_path.gen() );\n\tprintf( \"\\t%s\\n\", uid_domain.gen() );\n\tif( we_have_fs_domain ) {\n\t\tprintf( \"\\t%s\\n\", filesystem_domain.gen() );\n\t}\n\tif( !confirm(\"Are all the above settings correct? \") ) {\n\t\tprintf( \"Configuration Aborted\\n\" );\n\t\treturn 1;\n\t}\n\n\t\t\/\/ Prepare to customize the files in the \"lib\" directory.\n\tstrcpy( dir, release_dir.get_val() );\n\tstrcat( dir, \"\/lib\" );\n\tfile = new ConfigFile( dir );\n\n\t\t\/\/ Customize \"condor_config\"\n\tfile->begin( \"condor_config\" );\n\tfile->add_macro( release_dir.gen() );\n\tfile->add_macro( condor_host.gen() );\n\tfile->add_macro( condor_admin.gen() );\n\tfile->add_macro( condor_developers.gen() );\n\tfile->add_macro( local_dir.gen() );\n\tfile->add_macro( has_afs.gen() );\n\tif( we_have_afs ) {\n\t\tfile->add_macro( use_afs.gen() );\n\t\tfile->add_macro( fs_path.gen() );\n\t\tfile->add_macro( vos_path.gen() );\n\t}\n\tfile->add_macro( mailer_path.gen() );\n\tfile->add_macro( uid_domain.gen() );\n\tif( we_have_fs_domain ) {\n\t\tfile->add_macro( filesystem_domain.gen() );\n\t}\n\tfile->end();\n\n\t\t\/\/ Customize \"config_off\"\n\tfile->begin( \"config_off\" );\n\tfile->add_macro( release_dir.gen(TRUE) );\n\tfile->end();\n\n\t\t\/\/ Customize \"config_on\"\n\tfile->begin( \"config_on\" );\n\tfile->add_macro( release_dir.gen(TRUE) );\n\tfile->end();\n\n\t\t\/\/ Prepare to customize the files in the \"bin\" directory.\n\tdelete file;\n\tstrcpy( dir, release_dir.get_val() );\n\tstrcat( dir, \"\/bin\" );\n\tfile = new ConfigFile( dir );\n\n\t\t\/\/ Customize \"condor_init\"\n\tfile->begin( \"condor_init\" );\n\tfile->add_macro( \"#!\/bin\/csh -f\" );\n\tfile->add_macro( \"\" );\n\tfile->add_macro( release_dir.gen(TRUE) );\n\tfile->end();\n\n\t\t\/\/ Customize \"condor_throttle\"\n\tfile->begin( \"condor_throttle\" );\n\tfile->add_macro( \"#!\/bin\/csh -f\" );\n\tfile->add_macro( \"\" );\n\tfile->add_macro( release_dir.gen(TRUE) );\n\tfile->end();\n\n\tdelete file;\n\tprintf( \"\\nCustomization Complete\\n\" );\n\n\treturn 0;\n}\n\n\/*\n  Check a directory for validity.  We only check that this is a real\n  directory on the system - no permissions or other reasonableness\n  criteria are checked.  The directory name may contain the component\n  $(TILDE) which is interpreted to mean \"~condor\".\n*\/\nint\ncheck_dir( const char *path )\n{\n\tstruct stat\tbuf;\n\tchar\t\t*tmp;\n\n\tif( path[0] != '\/' && path[0] != '$' ) {\n\t\tprintf( \"Must supply a full pathname starting with \\\"\/\\\"\\n\" );\n\t\treturn FALSE;\n\t}\n\n\ttmp = xlate_tilde( path );\n\n\tif( stat(tmp,&buf) < 0 ) {\n\t\tprintf( \"Warning: \\\"%s\\\" is not a valid directory\\n\", path );\n\t\treturn FALSE;\n\t}\n\n\tif( S_ISDIR(buf.st_mode) ) {\n\t\treturn TRUE;\n\t} else {\n\t\tprintf( \"Warning: \\\"%s\\\" is not a valid directory\\n\", path );\n\t\treturn FALSE;\n\t}\n}\n\n\/*\n  Translate a pathname which may contain $(TILDE) to a simple pathname.\n*\/\nchar *\nxlate_tilde( const char *path )\n{\n\tstatic char answer[_POSIX_PATH_MAX];\n\tchar\t*component;\n\tchar\t*tmp;\n\n\ttmp = new char[ strlen(path) + 1 ];\n\tstrcpy( tmp, path );\n\n\tcomponent = strtok( tmp, \"\/\" );\n\tif( strcmp(\"$(TILDE)\",component) == MATCH ) {\n\t\tcomponent = lookup_tilde( component, \"condor\" );\n\t}\n\tstrcpy( answer, \"\/\" );\n\tstrcat( answer, component );\n\n\twhile( component = strtok(NULL,\"\/\") ) {\n\t\tif( strcmp(\"$(TILDE)\",component) == MATCH ) {\n\t\t\tcomponent = lookup_tilde( component, \"condor\" );\n\t\t}\n\t\tstrcat( answer, \"\/\" );\n\t\tstrcat( answer, component );\n\t}\n\tdelete [] tmp;\n\treturn answer;\n}\n\n\/*\n  Lookup the given user's home directory.\n*\/\n#include <pwd.h>\nchar *\nlookup_tilde( char *orig,  const char *user )\n{\n\tstruct passwd *entry;\n\n\tif( (entry = getpwnam(user)) == NULL ) {\n\t\tprintf( \"Warning: Can't find user \\\"%s\\\" in passwd file\\n\", user );\n\t\treturn orig;\n\t}\n\treturn entry->pw_dir + 1;\n}\n\nextern \"C\" {\n#\tinclude <netdb.h>\n}\nint check_host( const char *name )\n{\n\tstruct hostent\t*hp;\n\n\tif( gethostbyname(name) ) {\n\t\treturn TRUE;\n\t} else {\n\t\tprintf( \"Warning: Can't locate host \\\"%s\\\"\\n\", name );\n\t\treturn FALSE;\n\t}\n}\n\n\/*\n  Check a pathname for an executable program for validity.  The\n  pathname may contain the component $(TILDE) which is interpreted to\n  mean \"~condor\".\n*\/\nint\ncheck_exec( const char *path )\n{\n\tstruct stat\tbuf;\n\tchar\t\t*tmp;\n\n\tif( path[0] != '\/' && path[0] != '$' ) {\n\t\tprintf( \"Must supply a full pathname starting with \\\"\/\\\"\\n\" );\n\t\treturn FALSE;\n\t}\n\n\ttmp = xlate_tilde( path );\n\n\tif( stat(tmp,&buf) < 0 ) {\n\t\tprintf( \"Warning: \\\"%s\\\" is not a valid pathname\\n\", path );\n\t\treturn FALSE;\n\t}\n\n\tif( S_IXUSR & buf.st_mode ) {\n\t\treturn TRUE;\n\t} else {\n\t\tprintf( \"Warning: \\\"%s\\\" is not an executable file\\n\", path );\n\t\treturn FALSE;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * libseaside - Library that provides an interface to the Contacts application\n * Copyright © 2010, 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\n#include <QDebug>\n\n#include <QStringList>\n\n#include \"seasideproxymodel.h\"\n#include \"seasidesyncmodel.h\"\n#include \"seaside.h\"\n\nclass SeasideProxyModelPriv\n{\npublic:\n    SeasideProxyModel::FilterType filterType;\n    SeasideProxyModel::SortType sortType;\n};\n\nSeasideProxyModel::SeasideProxyModel()\n{\n    priv = new SeasideProxyModelPriv;\n    priv->filterType = FilterAll;\n    priv->sortType = SortName;\n    setDynamicSortFilter(true);\n    setFilterKeyColumn(-1);\n}\n\nSeasideProxyModel::~SeasideProxyModel()\n{\n    delete priv;\n}\n\nvoid SeasideProxyModel::setFilter(FilterType filter)\n{\n    priv->filterType = filter;\n    invalidateFilter();\n}\n\nvoid SeasideProxyModel::setSortType(SortType sortType)\n{\n    priv->sortType = sortType;\n    if (priv->sortType == SortRecent)\n        sort(Seaside::ColumnCommTimestamp, Qt::DescendingOrder);\n    else\n        sort(Seaside::ColumnFirstName, Qt::AscendingOrder);\n}\n\nbool SeasideProxyModel::filterAcceptsRow(int source_row,\n                                         const QModelIndex& source_parent) const\n{\n    \/\/ TODO: add communication history\n\n    if (!QSortFilterProxyModel::filterAcceptsRow(source_row, source_parent))\n        return false;\n\n    if (priv->filterType == FilterAll)\n        return true;\n\n    SeasideSyncModel *model = dynamic_cast<SeasideSyncModel *>(sourceModel());\n    if (!model)\n        return true;\n\n    QContact *contact = model->contact(source_row);\n\n    if (priv->filterType == FilterRecent) {\n        QDateTime cutoff = QDateTime::currentDateTime();\n        cutoff = cutoff.addDays(-30);\n        const QDateTime& dt = Seaside::contactCommTimestamp(contact);\n        return dt.isValid() && (dt > cutoff);\n    }\n    else if (priv->filterType == FilterFavorites) {\n        SEASIDE_SHORTCUTS;\n        SEASIDE_SET_MODEL_AND_ROW(model, source_row);\n        return SEASIDE_FIELD(Favorite, Bool);\n    }\n    else {\n        qWarning() << \"[ProxyModel] invalid filter type\";\n        return true;\n    }\n}\n\nbool SeasideProxyModel::lessThan(const QModelIndex& left,\n                                 const QModelIndex& right) const\n{\n    if (priv->sortType == SortName) {\n        const QString& lStr = left.data(Seaside::DataRole).toString();\n        const QString& rStr = right.data(Seaside::DataRole).toString();\n        \/\/qWarning() << \"[ProxyModel] lessThan \" << lStr << \"VS\" << rStr;\n        return QString::localeAwareCompare(lStr, rStr) < 0;\n    }\n    else if (priv->sortType == SortRecent) {\n        const QDateTime& lDate = left.data(Seaside::DataRole).toDateTime();\n        const QDateTime& rDate = right.data(Seaside::DataRole).toDateTime();\n        return lDate < rDate;\n    }\n    return false;\n}\n<commit_msg>Ensuring that a MeCard is always evaluated to be less than any other Contact in proxy model. Fix for BMC#6007 Contacts crashes when saving a contact with high possibility. Ensure proxy model and list are aligned in sort order. Signed-off-by: Connie Berardi <connie.berardi@intel.com><commit_after>\/*\n * libseaside - Library that provides an interface to the Contacts application\n * Copyright © 2010, 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\n#include <QDebug>\n\n#include <QStringList>\n\n#include \"seasideproxymodel.h\"\n#include \"seasidesyncmodel.h\"\n#include \"seaside.h\"\n\nclass SeasideProxyModelPriv\n{\npublic:\n    SeasideProxyModel::FilterType filterType;\n    SeasideProxyModel::SortType sortType;\n};\n\nSeasideProxyModel::SeasideProxyModel()\n{\n    priv = new SeasideProxyModelPriv;\n    priv->filterType = FilterAll;\n    priv->sortType = SortName;\n    setDynamicSortFilter(true);\n    setFilterKeyColumn(-1);\n}\n\nSeasideProxyModel::~SeasideProxyModel()\n{\n    delete priv;\n}\n\nvoid SeasideProxyModel::setFilter(FilterType filter)\n{\n    priv->filterType = filter;\n    invalidateFilter();\n}\n\nvoid SeasideProxyModel::setSortType(SortType sortType)\n{\n    priv->sortType = sortType;\n    if (priv->sortType == SortRecent)\n        sort(Seaside::ColumnCommTimestamp, Qt::DescendingOrder);\n    else\n        sort(Seaside::ColumnFirstName, Qt::AscendingOrder);\n}\n\nbool SeasideProxyModel::filterAcceptsRow(int source_row,\n                                         const QModelIndex& source_parent) const\n{\n    \/\/ TODO: add communication history\n\n    if (!QSortFilterProxyModel::filterAcceptsRow(source_row, source_parent))\n        return false;\n\n    if (priv->filterType == FilterAll)\n        return true;\n\n    SeasideSyncModel *model = dynamic_cast<SeasideSyncModel *>(sourceModel());\n    if (!model)\n        return true;\n\n    QContact *contact = model->contact(source_row);\n\n    if (priv->filterType == FilterRecent) {\n        QDateTime cutoff = QDateTime::currentDateTime();\n        cutoff = cutoff.addDays(-30);\n        const QDateTime& dt = Seaside::contactCommTimestamp(contact);\n        return dt.isValid() && (dt > cutoff);\n    }\n    else if (priv->filterType == FilterFavorites) {\n        SEASIDE_SHORTCUTS;\n        SEASIDE_SET_MODEL_AND_ROW(model, source_row);\n        return SEASIDE_FIELD(Favorite, Bool);\n    }\n    else {\n        qWarning() << \"[ProxyModel] invalid filter type\";\n        return true;\n    }\n}\n\nbool SeasideProxyModel::lessThan(const QModelIndex& left,\n                                 const QModelIndex& right) const\n{\n\n    SeasideSyncModel *model = dynamic_cast<SeasideSyncModel *>(sourceModel());\n    if (!model)\n        return true;\n\n    SEASIDE_SHORTCUTS;\n    SEASIDE_SET_MODEL_AND_ROW(model, left.row());\n    const QString& lStr = SEASIDE_FIELD(FirstName, String);\n    const bool isleftSelf = SEASIDE_FIELD(isSelf, Bool);\n\n    SEASIDE_SET_MODEL_AND_ROW(model, right.row());\n    const QString& rStr = SEASIDE_FIELD(FirstName, String);\n    const bool isrightSelf = SEASIDE_FIELD(isSelf, Bool);\n\n    \/\/qWarning() << \"[ProxyModel] lessThan isSelf left\" << isleftSelf << \" right\" << isrightSelf;\n\n    \/\/MeCard should always be top of the list\n    if(isleftSelf)\n        return true;\n    if(isrightSelf)\n        return false;\n\n    if (priv->sortType == SortName) {\n      \/\/qWarning() << \"[ProxyModel] lessThan \" << lStr << \"VS\" << rStr;\n        return QString::localeAwareCompare(lStr, rStr) < 0;\n    }\n    else if (priv->sortType == SortRecent) {\n        const QDateTime& lDate = left.data(Seaside::DataRole).toDateTime();\n        const QDateTime& rDate = right.data(Seaside::DataRole).toDateTime();\n        return lDate < rDate;\n    }\n    return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"compiler\/parse_table.h\"\n#include <string>\n\nnamespace tree_sitter {\n    using std::string;\n    using std::ostream;\n    using std::to_string;\n    using std::set;\n    using std::vector;\n    using rules::Symbol;\n\n    ParseAction::ParseAction(ParseActionType type,\n                             size_t state_index,\n                             Symbol symbol,\n                             size_t consumed_symbol_count,\n                             set<int> precedence_values) :\n        type(type),\n        symbol(symbol),\n        state_index(state_index),\n        consumed_symbol_count(consumed_symbol_count),\n        precedence_values(precedence_values) {}\n\n    ParseAction::ParseAction() :\n        type(ParseActionTypeError),\n        symbol(Symbol(-1)),\n        state_index(-1),\n        consumed_symbol_count(0) {}\n\n    ParseAction ParseAction::Error() {\n        return ParseAction(ParseActionTypeError, -1, Symbol(-1), 0, { 0 });\n    }\n\n    ParseAction ParseAction::Accept() {\n        return ParseAction(ParseActionTypeAccept, -1, Symbol(-1), 0, { 0 });\n    }\n\n    ParseAction ParseAction::Shift(size_t state_index, set<int> precedence_values) {\n        return ParseAction(ParseActionTypeShift, state_index, Symbol(-1), 0, precedence_values);\n    }\n\n    ParseAction ParseAction::ShiftExtra() {\n        return ParseAction(ParseActionTypeShiftExtra, -1, Symbol(-1), 0, { 0 });\n    }\n\n    ParseAction ParseAction::ReduceExtra(Symbol symbol) {\n        return ParseAction(ParseActionTypeReduceExtra, -1, symbol, 0, { 0 });\n    }\n\n    ParseAction ParseAction::Reduce(Symbol symbol, size_t consumed_symbol_count, int precedence) {\n        return ParseAction(ParseActionTypeReduce, -1, symbol, consumed_symbol_count, { precedence });\n    }\n\n    bool ParseAction::operator==(const ParseAction &other) const {\n        bool types_eq = type == other.type;\n        bool symbols_eq = symbol == other.symbol;\n        bool state_indices_eq = state_index == other.state_index;\n        bool consumed_symbol_counts_eq = consumed_symbol_count == other.consumed_symbol_count;\n        return types_eq && symbols_eq && state_indices_eq && consumed_symbol_counts_eq;\n    }\n\n    ostream& operator<<(ostream &stream, const ParseAction &action) {\n        switch (action.type) {\n            case ParseActionTypeError:\n                return stream << string(\"#<error>\");\n            case ParseActionTypeAccept:\n                return stream << string(\"#<accept>\");\n            case ParseActionTypeShift:\n                return stream << (string(\"#<shift \") + to_string(action.state_index) + \">\");\n            case ParseActionTypeShiftExtra:\n                return stream << string(\"#<shift_extra\");\n            case ParseActionTypeReduce:\n                return stream << (string(\"#<reduce sym\") + to_string(action.symbol.index) + \" \" + to_string(action.consumed_symbol_count) + \">\");\n            default:\n                return stream;\n        }\n    }\n\n    ParseState::ParseState() : lex_state_id(-1) {}\n\n    set<Symbol> ParseState::expected_inputs() const {\n        set<Symbol> result;\n        for (auto &pair : actions)\n            result.insert(pair.first);\n        return result;\n    }\n\n    ostream& operator<<(ostream &stream, const ParseState &state) {\n        stream << string(\"#<parse_state \");\n        bool started = false;\n        for (auto pair : state.actions) {\n            if (started) stream << string(\", \");\n            stream << pair.first << string(\" => \") << pair.second;\n            started = true;\n        }\n        stream << string(\">\");\n        return stream;\n    }\n\n    ParseStateId ParseTable::add_state() {\n        states.push_back(ParseState());\n        return states.size() - 1;\n    }\n\n    void ParseTable::add_action(ParseStateId id, Symbol symbol, ParseAction action) {\n        symbols.insert(symbol);\n        states[id].actions[symbol] = action;\n    }\n}\n<commit_msg>Fix stream operator for new parse action types<commit_after>#include \"compiler\/parse_table.h\"\n#include <string>\n\nnamespace tree_sitter {\n    using std::string;\n    using std::ostream;\n    using std::to_string;\n    using std::set;\n    using std::vector;\n    using rules::Symbol;\n\n    ParseAction::ParseAction(ParseActionType type,\n                             size_t state_index,\n                             Symbol symbol,\n                             size_t consumed_symbol_count,\n                             set<int> precedence_values) :\n        type(type),\n        symbol(symbol),\n        state_index(state_index),\n        consumed_symbol_count(consumed_symbol_count),\n        precedence_values(precedence_values) {}\n\n    ParseAction::ParseAction() :\n        type(ParseActionTypeError),\n        symbol(Symbol(-1)),\n        state_index(-1),\n        consumed_symbol_count(0) {}\n\n    ParseAction ParseAction::Error() {\n        return ParseAction(ParseActionTypeError, -1, Symbol(-1), 0, { 0 });\n    }\n\n    ParseAction ParseAction::Accept() {\n        return ParseAction(ParseActionTypeAccept, -1, Symbol(-1), 0, { 0 });\n    }\n\n    ParseAction ParseAction::Shift(size_t state_index, set<int> precedence_values) {\n        return ParseAction(ParseActionTypeShift, state_index, Symbol(-1), 0, precedence_values);\n    }\n\n    ParseAction ParseAction::ShiftExtra() {\n        return ParseAction(ParseActionTypeShiftExtra, -1, Symbol(-1), 0, { 0 });\n    }\n\n    ParseAction ParseAction::ReduceExtra(Symbol symbol) {\n        return ParseAction(ParseActionTypeReduceExtra, -1, symbol, 0, { 0 });\n    }\n\n    ParseAction ParseAction::Reduce(Symbol symbol, size_t consumed_symbol_count, int precedence) {\n        return ParseAction(ParseActionTypeReduce, -1, symbol, consumed_symbol_count, { precedence });\n    }\n\n    bool ParseAction::operator==(const ParseAction &other) const {\n        bool types_eq = type == other.type;\n        bool symbols_eq = symbol == other.symbol;\n        bool state_indices_eq = state_index == other.state_index;\n        bool consumed_symbol_counts_eq = consumed_symbol_count == other.consumed_symbol_count;\n        return types_eq && symbols_eq && state_indices_eq && consumed_symbol_counts_eq;\n    }\n\n    ostream& operator<<(ostream &stream, const ParseAction &action) {\n        switch (action.type) {\n            case ParseActionTypeError:\n                return stream << string(\"#<error>\");\n            case ParseActionTypeAccept:\n                return stream << string(\"#<accept>\");\n            case ParseActionTypeShift:\n                return stream << (string(\"#<shift \") + to_string(action.state_index) + \">\");\n            case ParseActionTypeShiftExtra:\n                return stream << string(\"#<shift_extra\");\n            case ParseActionTypeReduceExtra:\n                return stream << (\"#<reduce_extra sym\" + to_string(action.symbol.index) + \">\");\n            case ParseActionTypeReduce:\n                return stream << (\"#<reduce sym\" + to_string(action.symbol.index) + \" \" + to_string(action.consumed_symbol_count) + \">\");\n            default:\n                return stream;\n        }\n    }\n\n    ParseState::ParseState() : lex_state_id(-1) {}\n\n    set<Symbol> ParseState::expected_inputs() const {\n        set<Symbol> result;\n        for (auto &pair : actions)\n            result.insert(pair.first);\n        return result;\n    }\n\n    ostream& operator<<(ostream &stream, const ParseState &state) {\n        stream << string(\"#<parse_state \");\n        bool started = false;\n        for (auto pair : state.actions) {\n            if (started) stream << string(\", \");\n            stream << pair.first << string(\" => \") << pair.second;\n            started = true;\n        }\n        stream << string(\">\");\n        return stream;\n    }\n\n    ParseStateId ParseTable::add_state() {\n        states.push_back(ParseState());\n        return states.size() - 1;\n    }\n\n    void ParseTable::add_action(ParseStateId id, Symbol symbol, ParseAction action) {\n        symbols.insert(symbol);\n        states[id].actions[symbol] = action;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"common.th\"\n\n#define IRR_ADDR        rel(IRR) \/\/-1\n#define ISR_ADDR        rel(ISR) \/\/-2\n#define IMR_ADDR        rel(IMR) \/\/-3\n#define SAVE_ADDR(Idx)  reloff(SAVE_END,Idx) \/\/-4 - Idx\n\n\/\/ TODO rewrite save_registers() to reduce arithmetic on stack pointer (O is\n\/\/ updated twice consecutively due to the pushall_() macro where if handwritten\n\/\/ it could be updated only once)\n#define get_interrupt_stack() \\\n    O   -> [SAVE_ADDR(0)]   ; \\\n    O   <- SAVE_ADDR(1)     ; \\\n    \/\/\n\n#define restore_user_stack()  \\\n    O   <- [SAVE_ADDR(0)]   ; \\\n    \/\/\n\n.global irq_handler\nirq_handler:\n    get_interrupt_stack()\n    pushall(C,B,D)\n\n    B   <- [ISR_ADDR]\n\n    \/\/ get lowest set bit in B\n    C   <- B - 1\n    C   <- B ^ C\n    B   <- B & C\n\n    D   <- 0            \/\/ base, for checking 8 bits at a time\n    goto(check8)\n\ntop8:\n    D   <- C & 1 + D\n    B   <- B >> 8\ncheck8:\n    C   <- B & 0xff     \/\/ 0000000011111111\n    C   <- C == A\n    jnzrel(C,top8)\n\nready8:\n    C   <- B & 0x0f     \/\/ 00001111\n    C   <- C <> A + 1\n    C   <- D << 1 + C\n\n    D   <- B & 0x33     \/\/ 00110011\n    D   <- D <> A + 1\n    D   <- C << 1 + D\n\n    C   <- B & 0x55     \/\/ 01010101\n    C   <- C <> A + 1\n    D   <- D << 1 + C\n\n    \/\/ now D has the bit index of the lowest set bit in B\n    C   <- [D + rel(irqtable)]\n\n    popall(B,D)\n    push(rel(after))\n    \/\/ At vector dispatch, only O and C are saved. O is usable as the vector's\n    \/\/ stack pointer ; C is the vector number and can be used as scratch.\n    P   <- offsetpc(C)\n\nafter:\n    popall(C)\n    restore_user_stack()\n    P   <- [IRR_ADDR]\n\n\/\/ The IRR is written by the CPU, before irq_handler is called, with the address\n\/\/ of the next userspace PC to be executed\nIRR: .word @abort + 0x1000 \/\/ XXX hand-relocated address\nISR: .word -1 << 7\nIMR: .word -1\n\nSAVE: .word 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0\nSAVE_END:\n\nirq_unhandled: .word 0x00ffdead ; illegal\n\n.set irq00, @irq_unhandled ; .set irq01, @irq_unhandled ;\n.set irq02, @irq_unhandled ; .set irq03, @irq_unhandled ;\n.set irq04, @irq_unhandled ; .set irq05, @irq_unhandled ;\n.set irq06, @irq_unhandled ; .set irq07, @irq_unhandled ;\n.set irq08, @irq_unhandled ; .set irq09, @irq_unhandled ;\n.set irq10, @irq_unhandled ; .set irq11, @irq_unhandled ;\n.set irq12, @irq_unhandled ; .set irq13, @irq_unhandled ;\n.set irq14, @irq_unhandled ; .set irq15, @irq_unhandled ;\n.set irq16, @irq_unhandled ; .set irq17, @irq_unhandled ;\n.set irq18, @irq_unhandled ; .set irq19, @irq_unhandled ;\n.set irq20, @irq_unhandled ; .set irq21, @irq_unhandled ;\n.set irq22, @irq_unhandled ; .set irq23, @irq_unhandled ;\n.set irq24, @irq_unhandled ; .set irq25, @irq_unhandled ;\n.set irq26, @irq_unhandled ; .set irq27, @irq_unhandled ;\n.set irq28, @irq_unhandled ; .set irq29, @irq_unhandled ;\n.set irq30, @irq_unhandled ; .set irq31, @irq_unhandled ;\n\n.global irq00 ; .global irq01 ; .global irq02 ; .global irq03 ;\n.global irq04 ; .global irq05 ; .global irq06 ; .global irq07 ;\n.global irq08 ; .global irq09 ; .global irq10 ; .global irq11 ;\n.global irq12 ; .global irq13 ; .global irq14 ; .global irq15 ;\n.global irq16 ; .global irq17 ; .global irq18 ; .global irq19 ;\n.global irq20 ; .global irq21 ; .global irq22 ; .global irq23 ;\n.global irq24 ; .global irq25 ; .global irq26 ; .global irq27 ;\n.global irq28 ; .global irq29 ; .global irq30 ; .global irq31 ;\n\nirq07: .word  7; ret\n\nirqtable:\n    .word @irq00, @irq01, @irq02, @irq03, @irq04, @irq05, @irq06, @irq07,\n          @irq08, @irq09, @irq10, @irq11, @irq12, @irq13, @irq14, @irq15,\n          @irq16, @irq17, @irq18, @irq19, @irq20, @irq21, @irq22, @irq23,\n          @irq24, @irq25, @irq26, @irq27, @irq28, @irq29, @irq30, @irq31\n\nabort: .word 0x00aadead; illegal\n<commit_msg>Explain changes needed for non-PIC vectors<commit_after>#include \"common.th\"\n\n#define IRR_ADDR        rel(IRR) \/\/-1\n#define ISR_ADDR        rel(ISR) \/\/-2\n#define IMR_ADDR        rel(IMR) \/\/-3\n#define SAVE_ADDR(Idx)  reloff(SAVE_END,Idx) \/\/-4 - Idx\n\n\/\/ TODO rewrite save_registers() to reduce arithmetic on stack pointer (O is\n\/\/ updated twice consecutively due to the pushall_() macro where if handwritten\n\/\/ it could be updated only once)\n#define get_interrupt_stack() \\\n    O   -> [SAVE_ADDR(0)]   ; \\\n    O   <- SAVE_ADDR(1)     ; \\\n    \/\/\n\n#define restore_user_stack()  \\\n    O   <- [SAVE_ADDR(0)]   ; \\\n    \/\/\n\n.global irq_handler\nirq_handler:\n    get_interrupt_stack()\n    pushall(C,B,D)\n\n    B   <- [ISR_ADDR]\n\n    \/\/ get lowest set bit in B\n    C   <- B - 1\n    C   <- B ^ C\n    B   <- B & C\n\n    D   <- 0            \/\/ base, for checking 8 bits at a time\n    goto(check8)\n\ntop8:\n    D   <- C & 1 + D\n    B   <- B >> 8\ncheck8:\n    C   <- B & 0xff     \/\/ 0000000011111111\n    C   <- C == A\n    jnzrel(C,top8)\n\nready8:\n    C   <- B & 0x0f     \/\/ 00001111\n    C   <- C <> A + 1\n    C   <- D << 1 + C\n\n    D   <- B & 0x33     \/\/ 00110011\n    D   <- D <> A + 1\n    D   <- C << 1 + D\n\n    C   <- B & 0x55     \/\/ 01010101\n    C   <- C <> A + 1\n    C   <- D << 1 + C\n\n    popall(B,D)\n    push(rel(after))\n    \/\/ now C has the bit index of the lowest set bit in B\n    C   <- [C + rel(irqtable)]\n    \/\/ At vector dispatch, only O and C are saved. O is usable as the vector's\n    \/\/ stack pointer ; C is the vector number and can be used as scratch.\n    \/\/ XXX C does not contain the vector number as it should !\n    \/\/ This is because we are using position-independent code, when in the case\n    \/\/ of the real vector table, both the table itself and its contents will be\n    \/\/ effectively relocated (their addresses will be fixed in high memory).\n    \/\/ Thus we will be able to turn load-jump instruction pair into a single\n    \/\/ load-jump instruction. TODO support an .org or similar directive to put\n    \/\/ things at known addresses.\n    P   <- offsetpc(C)\n\nafter:\n    popall(C)\n    restore_user_stack()\n    P   <- [IRR_ADDR]\n\n\/\/ The IRR is written by the CPU, before irq_handler is called, with the address\n\/\/ of the next userspace PC to be executed\nIRR: .word @abort + 0x1000 \/\/ XXX hand-relocated address\nISR: .word -1 << 7\nIMR: .word -1\n\nSAVE: .word 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0\nSAVE_END:\n\nirq_unhandled: .word 0x00ffdead ; illegal\n\n.set irq00, @irq_unhandled ; .set irq01, @irq_unhandled ;\n.set irq02, @irq_unhandled ; .set irq03, @irq_unhandled ;\n.set irq04, @irq_unhandled ; .set irq05, @irq_unhandled ;\n.set irq06, @irq_unhandled ; .set irq07, @irq_unhandled ;\n.set irq08, @irq_unhandled ; .set irq09, @irq_unhandled ;\n.set irq10, @irq_unhandled ; .set irq11, @irq_unhandled ;\n.set irq12, @irq_unhandled ; .set irq13, @irq_unhandled ;\n.set irq14, @irq_unhandled ; .set irq15, @irq_unhandled ;\n.set irq16, @irq_unhandled ; .set irq17, @irq_unhandled ;\n.set irq18, @irq_unhandled ; .set irq19, @irq_unhandled ;\n.set irq20, @irq_unhandled ; .set irq21, @irq_unhandled ;\n.set irq22, @irq_unhandled ; .set irq23, @irq_unhandled ;\n.set irq24, @irq_unhandled ; .set irq25, @irq_unhandled ;\n.set irq26, @irq_unhandled ; .set irq27, @irq_unhandled ;\n.set irq28, @irq_unhandled ; .set irq29, @irq_unhandled ;\n.set irq30, @irq_unhandled ; .set irq31, @irq_unhandled ;\n\n.global irq00 ; .global irq01 ; .global irq02 ; .global irq03 ;\n.global irq04 ; .global irq05 ; .global irq06 ; .global irq07 ;\n.global irq08 ; .global irq09 ; .global irq10 ; .global irq11 ;\n.global irq12 ; .global irq13 ; .global irq14 ; .global irq15 ;\n.global irq16 ; .global irq17 ; .global irq18 ; .global irq19 ;\n.global irq20 ; .global irq21 ; .global irq22 ; .global irq23 ;\n.global irq24 ; .global irq25 ; .global irq26 ; .global irq27 ;\n.global irq28 ; .global irq29 ; .global irq30 ; .global irq31 ;\n\nirq07: .word  7; ret\n\nirqtable:\n    .word @irq00, @irq01, @irq02, @irq03, @irq04, @irq05, @irq06, @irq07,\n          @irq08, @irq09, @irq10, @irq11, @irq12, @irq13, @irq14, @irq15,\n          @irq16, @irq17, @irq18, @irq19, @irq20, @irq21, @irq22, @irq23,\n          @irq24, @irq25, @irq26, @irq27, @irq28, @irq29, @irq30, @irq31\n\nabort: .word 0x00aadead; illegal\n<|endoftext|>"}
{"text":"<commit_before>\/\/   Copyright (c) 2018 PaddlePaddle 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#include <algorithm>\n\n#include \"paddle\/fluid\/framework\/details\/all_reduce_op_handle.h\"\n#include \"paddle\/fluid\/framework\/details\/container_cast.h\"\n#include \"paddle\/fluid\/framework\/details\/reduce_and_gather.h\"\n#include \"paddle\/fluid\/framework\/details\/variable_visitor.h\"\n#include \"paddle\/fluid\/platform\/profiler.h\"\n\nnamespace paddle {\nnamespace framework {\nnamespace details {\n\n#if defined(PADDLE_WITH_CUDA) && !defined(_WIN32)\nAllReduceOpHandle::AllReduceOpHandle(ir::Node *node,\n                                     const std::vector<Scope *> &local_scopes,\n                                     const std::vector<platform::Place> &places,\n                                     const platform::NCCLContextMap *ctxs)\n    : OpHandleBase(node),\n      local_scopes_(local_scopes),\n      places_(places),\n      nccl_ctxs_(ctxs) {\n  if (nccl_ctxs_) {\n    for (auto &p : places_) {\n      this->SetDeviceContext(p, nccl_ctxs_->DevCtx(p));\n    }\n  }\n}\n#else\nAllReduceOpHandle::AllReduceOpHandle(ir::Node *node,\n                                     const std::vector<Scope *> &local_scopes,\n                                     const std::vector<platform::Place> &places)\n    : OpHandleBase(node), local_scopes_(local_scopes), places_(places) {}\n#endif\n\nvoid AllReduceOpHandle::RunImpl() {\n  platform::RecordEvent record_event(Name(), dev_ctxes_.cbegin()->second);\n\n\/\/ FIXME(typhoonzero): If scope0(global scope) have NCCL_ID_VAR,\n\/\/ this is a distributed or inter-process call, find a better way.\n#ifdef PADDLE_WITH_CUDA\n  if (NoDummyInputSize() == 1 &&\n      local_scopes_[0]->FindVar(NCCL_ID_VARNAME) == nullptr) {\n#else\n  if (NoDummyInputSize() == 1) {\n#endif\n    return;  \/\/ No need to all reduce when GPU count = 1;\n  } else {\n    \/\/ Wait input done\n    WaitInputVarGenerated();\n    auto in_var_handles = DynamicCast<VarHandle>(this->Inputs());\n    auto out_var_handles = DynamicCast<VarHandle>(this->Outputs());\n    PADDLE_ENFORCE_EQ(\n        in_var_handles.size(), places_.size(),\n        \"The NoDummyInputSize should be equal to the number of places.\");\n    PADDLE_ENFORCE_EQ(\n        in_var_handles.size(), out_var_handles.size(),\n        \"The NoDummyInputSize and NoDummyOutputSize should be equal.\");\n\n    std::vector<const LoDTensor *> lod_tensors;\n    for (size_t i = 0; i < local_scopes_.size(); ++i) {\n      auto *s = local_scopes_[i];\n      auto &local_scope = *s->FindVar(kLocalExecScopeName)->Get<Scope *>();\n      auto &lod_tensor =\n          local_scope.FindVar(in_var_handles[i]->name_)->Get<LoDTensor>();\n      lod_tensors.emplace_back(&lod_tensor);\n      PADDLE_ENFORCE_EQ(in_var_handles[i]->name_, out_var_handles[i]->name_,\n                        \"The name of input and output should be equal.\");\n    }\n\n    if (platform::is_gpu_place(lod_tensors[0]->place())) {\n#if defined(PADDLE_WITH_CUDA) && !defined(_WIN32)\n      PADDLE_ENFORCE(nccl_ctxs_, \"nccl_ctxs should not be nullptr.\");\n      int dtype = -1;\n      size_t numel = 0;\n      std::vector<std::function<void()>> all_reduce_calls;\n      for (size_t i = 0; i < local_scopes_.size(); ++i) {\n        auto &p = places_[i];\n        auto &lod_tensor = *lod_tensors[i];\n        void *buffer = const_cast<void *>(lod_tensor.data<void>());\n\n        if (dtype == -1) {\n          dtype = platform::ToNCCLDataType(lod_tensor.type());\n        }\n\n        if (numel == 0) {\n          numel = static_cast<size_t>(lod_tensor.numel());\n        }\n\n        int dev_id = boost::get<platform::CUDAPlace>(p).device;\n        auto &nccl_ctx = nccl_ctxs_->at(dev_id);\n        auto stream = nccl_ctx.stream();\n        auto comm = nccl_ctx.comm_;\n        all_reduce_calls.emplace_back([=] {\n          PADDLE_ENFORCE(platform::dynload::ncclAllReduce(\n              buffer, buffer, numel, static_cast<ncclDataType_t>(dtype),\n              ncclSum, comm, stream));\n        });\n      }\n\n      this->RunAndRecordEvent([&] {\n        \/\/ TODO(Yancey1989): need allreduce operator to avoid this flag\n        if (nccl_ctxs_->need_group_call_) {\n          platform::NCCLGroupGuard guard;\n          for (auto &call : all_reduce_calls) {\n            call();\n          }\n        } else {\n          \/\/ only used in executor_type == ParallalGraph, one thread one GPU\n          \/\/ TODO(Yancey1989): use allreduce operator to avoid this tricky.\n          PADDLE_ENFORCE(all_reduce_calls.size() == 1UL);\n          all_reduce_calls[0]();\n        }\n      });\n\n#else\n      PADDLE_THROW(\"Not compiled with CUDA\");\n#endif\n    } else {  \/\/ Special handle CPU only Operator's gradient. Like CRF\n      auto &trg = *this->local_scopes_[0]\n                       ->FindVar(kLocalExecScopeName)\n                       ->Get<Scope *>()\n                       ->FindVar(out_var_handles[0]->name_)\n                       ->GetMutable<framework::LoDTensor>();\n\n      \/\/ Reduce All Tensor to trg in CPU\n      ReduceLoDTensor func(lod_tensors, &trg);\n      VisitDataType(ToDataType(lod_tensors[0]->type()), func);\n\n      for (size_t i = 1; i < local_scopes_.size(); ++i) {\n        auto &scope =\n            *local_scopes_[i]->FindVar(kLocalExecScopeName)->Get<Scope *>();\n        auto &p = places_[i];\n        auto *var = scope.FindVar(out_var_handles[i]->name_);\n        auto *dev_ctx = dev_ctxes_.at(p);\n\n        RunAndRecordEvent(p, [&trg, var, dev_ctx, p] {\n          auto &tensor_gpu = *var->GetMutable<framework::LoDTensor>();\n          auto &tensor_cpu = trg;\n          TensorCopy(tensor_cpu, p, *dev_ctx, &tensor_gpu);\n        });\n      }\n    }\n  }\n}\n\nstd::string AllReduceOpHandle::Name() const { return \"all_reduce\"; }\n}  \/\/ namespace details\n}  \/\/ namespace framework\n}  \/\/ namespace paddle\n<commit_msg>fix performance<commit_after>\/\/   Copyright (c) 2018 PaddlePaddle 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#include <algorithm>\n\n#include \"paddle\/fluid\/framework\/details\/all_reduce_op_handle.h\"\n#include \"paddle\/fluid\/framework\/details\/container_cast.h\"\n#include \"paddle\/fluid\/framework\/details\/reduce_and_gather.h\"\n#include \"paddle\/fluid\/framework\/details\/variable_visitor.h\"\n#include \"paddle\/fluid\/platform\/profiler.h\"\n\nnamespace paddle {\nnamespace framework {\nnamespace details {\n\n#if defined(PADDLE_WITH_CUDA) && !defined(_WIN32)\nAllReduceOpHandle::AllReduceOpHandle(ir::Node *node,\n                                     const std::vector<Scope *> &local_scopes,\n                                     const std::vector<platform::Place> &places,\n                                     const platform::NCCLContextMap *ctxs)\n    : OpHandleBase(node),\n      local_scopes_(local_scopes),\n      places_(places),\n      nccl_ctxs_(ctxs) {\n  if (nccl_ctxs_) {\n    for (auto &p : places_) {\n      this->SetDeviceContext(p, nccl_ctxs_->DevCtx(p));\n    }\n  }\n}\n#else\nAllReduceOpHandle::AllReduceOpHandle(ir::Node *node,\n                                     const std::vector<Scope *> &local_scopes,\n                                     const std::vector<platform::Place> &places)\n    : OpHandleBase(node), local_scopes_(local_scopes), places_(places) {}\n#endif\n\nvoid AllReduceOpHandle::RunImpl() {\n  platform::RecordEvent record_event(Name(), dev_ctxes_.cbegin()->second);\n\n\/\/ FIXME(typhoonzero): If scope0(global scope) have NCCL_ID_VAR,\n\/\/ this is a distributed or inter-process call, find a better way.\n#ifdef PADDLE_WITH_CUDA\n  if (NoDummyInputSize() == 1 &&\n      local_scopes_[0]->FindVar(NCCL_ID_VARNAME) == nullptr) {\n#else\n  if (NoDummyInputSize() == 1) {\n#endif\n    return;  \/\/ No need to all reduce when GPU count = 1;\n  } else {\n    \/\/ Wait input done\n    WaitInputVarGenerated();\n    auto in_var_handles = DynamicCast<VarHandle>(this->Inputs());\n    auto out_var_handles = DynamicCast<VarHandle>(this->Outputs());\n    PADDLE_ENFORCE_EQ(\n        in_var_handles.size(), places_.size(),\n        \"The NoDummyInputSize should be equal to the number of places.\");\n    PADDLE_ENFORCE_EQ(\n        in_var_handles.size(), out_var_handles.size(),\n        \"The NoDummyInputSize and NoDummyOutputSize should be equal.\");\n\n    std::vector<const LoDTensor *> lod_tensors;\n    for (size_t i = 0; i < local_scopes_.size(); ++i) {\n      auto *s = local_scopes_[i];\n      auto &local_scope = *s->FindVar(kLocalExecScopeName)->Get<Scope *>();\n      auto &lod_tensor =\n          local_scope.FindVar(in_var_handles[i]->name_)->Get<LoDTensor>();\n      lod_tensors.emplace_back(&lod_tensor);\n      PADDLE_ENFORCE_EQ(in_var_handles[i]->name_, out_var_handles[i]->name_,\n                        \"The name of input and output should be equal.\");\n    }\n\n    if (platform::is_gpu_place(lod_tensors[0]->place())) {\n#if defined(PADDLE_WITH_CUDA) && !defined(_WIN32)\n      PADDLE_ENFORCE(nccl_ctxs_, \"nccl_ctxs should not be nullptr.\");\n      int dtype = -1;\n      size_t numel = 0;\n      std::vector<std::function<void()>> all_reduce_calls;\n      for (size_t i = 0; i < local_scopes_.size(); ++i) {\n        auto &p = places_[i];\n        auto &lod_tensor = *lod_tensors[i];\n        void *buffer = const_cast<void *>(lod_tensor.data<void>());\n\n        if (dtype == -1) {\n          dtype = platform::ToNCCLDataType(lod_tensor.type());\n        }\n\n        if (numel == 0) {\n          numel = static_cast<size_t>(lod_tensor.numel());\n        }\n\n        int dev_id = boost::get<platform::CUDAPlace>(p).device;\n        auto &nccl_ctx = nccl_ctxs_->at(dev_id);\n        auto stream = nccl_ctx.stream();\n        auto comm = nccl_ctx.comm_;\n        all_reduce_calls.emplace_back([=] {\n          PADDLE_ENFORCE(platform::dynload::ncclAllReduce(\n              buffer, buffer, numel, static_cast<ncclDataType_t>(dtype),\n              ncclSum, comm, stream));\n          if (!nccl_ctxs_->need_group_call_) cudaStreamSynchronize(stream);\n        });\n      }\n\n      this->RunAndRecordEvent([&] {\n        \/\/ TODO(Yancey1989): need allreduce operator to avoid this flag\n        if (nccl_ctxs_->need_group_call_) {\n          platform::NCCLGroupGuard guard;\n          for (auto &call : all_reduce_calls) {\n            call();\n          }\n        } else {\n          \/\/ only used in executor_type == ParallalGraph, one thread one GPU\n          \/\/ TODO(Yancey1989): use allreduce operator to avoid this tricky.\n          PADDLE_ENFORCE(all_reduce_calls.size() == 1UL);\n          all_reduce_calls[0]();\n        }\n      });\n\n#else\n      PADDLE_THROW(\"Not compiled with CUDA\");\n#endif\n    } else {  \/\/ Special handle CPU only Operator's gradient. Like CRF\n      auto &trg = *this->local_scopes_[0]\n                       ->FindVar(kLocalExecScopeName)\n                       ->Get<Scope *>()\n                       ->FindVar(out_var_handles[0]->name_)\n                       ->GetMutable<framework::LoDTensor>();\n\n      \/\/ Reduce All Tensor to trg in CPU\n      ReduceLoDTensor func(lod_tensors, &trg);\n      VisitDataType(ToDataType(lod_tensors[0]->type()), func);\n\n      for (size_t i = 1; i < local_scopes_.size(); ++i) {\n        auto &scope =\n            *local_scopes_[i]->FindVar(kLocalExecScopeName)->Get<Scope *>();\n        auto &p = places_[i];\n        auto *var = scope.FindVar(out_var_handles[i]->name_);\n        auto *dev_ctx = dev_ctxes_.at(p);\n\n        RunAndRecordEvent(p, [&trg, var, dev_ctx, p] {\n          auto &tensor_gpu = *var->GetMutable<framework::LoDTensor>();\n          auto &tensor_cpu = trg;\n          TensorCopy(tensor_cpu, p, *dev_ctx, &tensor_gpu);\n        });\n      }\n    }\n  }\n}\n\nstd::string AllReduceOpHandle::Name() const { return \"all_reduce\"; }\n}  \/\/ namespace details\n}  \/\/ namespace framework\n}  \/\/ namespace paddle\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2015-2017 Matthew Sitton <matthewsitton@gmail.com>\n\/\/ See LICENSE in the project root for license information.\n\n#pragma once\n#include \"streams.hpp\"\n\nnamespace ORCore\n{\n    class CubebOutput: public Consumer\n    {\n    public:\n        bool start();\n        void stop();\n        \n        bool set_stream(Stream* stream)\n        {\n            m_stream = stream;\n        }\n\n\n    private:\n        Stream* m_stream;\n    };\n}<commit_msg>include cubeb header to make sure builds are setup properly.<commit_after>\/\/ Copyright (c) 2015-2017 Matthew Sitton <matthewsitton@gmail.com>\n\/\/ See LICENSE in the project root for license information.\n\n#pragma once\n#include \"streams.hpp\"\n\n#include \"cubeb\/cubeb.h\"\n\nnamespace ORCore\n{\n    class CubebOutput: public Consumer\n    {\n    public:\n        bool start();\n        void stop();\n        \n        bool set_stream(Stream* stream)\n        {\n            m_stream = stream;\n        }\n\n\n    private:\n        Stream* m_stream;\n    };\n}<|endoftext|>"}
{"text":"<commit_before>#include \"S3StreamDefaults.h\"\n#include <ossim\/base\/ossimPreferences.h>\n\n\/\/ defaults to a 1 megabyte block size\n\/\/\nossim_int64 ossim::S3StreamDefaults::m_readBlocksize = 1048576;\n\nvoid ossim::S3StreamDefaults::loadDefaults()\n{\n   ossimString s3ReadBlocksize = ossimPreferences::instance()->findPreference(\"ossim.plugins.aws.s3.readBlocksize\");\n\n   if(!s3ReadBlocksize.empty())\n   {\n     ossim_int64 blockSize = s3ReadBlocksize.toInt64();\n     if(blockSize > 0)\n     {\n         ossimString byteType(s3ReadBlocksize.begin()+(s3ReadBlocksize.size()-1), s3ReadBlocksize.end());\n         byteType.upcase();\n         m_readBlocksize = blockSize;\n         if ( byteType == \"K\")\n         {\n            m_readBlocksize *=static_cast<ossim_int64>(1024);\n         }\n         else if ( byteType == \"M\")\n         {\n            m_readBlocksize *=static_cast<ossim_int64>(1048576);\n         }\n         else if ( byteType == \"G\")\n         {\n            m_readBlocksize *=static_cast<ossim_int64>(1073741824);\n         }\n         std::cout << \"SET TO \" << m_readBlocksize << \" bytes\\n\";\n     }\n   }\n\n}\n<commit_msg>Remove print statement<commit_after>#include \"S3StreamDefaults.h\"\n#include <ossim\/base\/ossimPreferences.h>\n\n\/\/ defaults to a 1 megabyte block size\n\/\/\nossim_int64 ossim::S3StreamDefaults::m_readBlocksize = 1048576;\n\nvoid ossim::S3StreamDefaults::loadDefaults()\n{\n   ossimString s3ReadBlocksize = ossimPreferences::instance()->findPreference(\"ossim.plugins.aws.s3.readBlocksize\");\n\n   if(!s3ReadBlocksize.empty())\n   {\n     ossim_int64 blockSize = s3ReadBlocksize.toInt64();\n     if(blockSize > 0)\n     {\n         ossimString byteType(s3ReadBlocksize.begin()+(s3ReadBlocksize.size()-1), s3ReadBlocksize.end());\n         byteType.upcase();\n         m_readBlocksize = blockSize;\n         if ( byteType == \"K\")\n         {\n            m_readBlocksize *=static_cast<ossim_int64>(1024);\n         }\n         else if ( byteType == \"M\")\n         {\n            m_readBlocksize *=static_cast<ossim_int64>(1048576);\n         }\n         else if ( byteType == \"G\")\n         {\n            m_readBlocksize *=static_cast<ossim_int64>(1073741824);\n         }\n     }\n   }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <stdint.h>\n\n\/* Comment out this line for a non-test network *\/\n#define BTS_TEST_NETWORK\n#define BTS_TEST_NETWORK_VERSION                            6 \/\/ autogenerated\n\n\/** @file bts\/blockchain\/config.hpp\n *  @brief Defines global constants that determine blockchain behavior\n *\/\n#define BTS_BLOCKCHAIN_VERSION                              2\n#define BTS_BLOCKCHAIN_DATABASE_VERSION                     6\n\n\/**\n *  The address prepended to string representation of\n *  addresses.\n *\n *  Changing these parameters will result in a hard fork.\n *\/\n#define BTS_ADDRESS_PREFIX                                  \"XTS\"\n#define BTS_BLOCKCHAIN_SYMBOL                               \"XTS\"\n#define BTS_BLOCKCHAIN_NAME                                 \"BitShares PLAY XTS\"\n#define BTS_BLOCKCHAIN_DESCRIPTION                          \"BitShares PLAY Test Network\"\n\n#define BTS_BLOCKCHAIN_PRECISION                            100000\n#define BTS_BLOCKCHAIN_MAX_TRANSACTION_EXPIRATION_SEC       (60*60*24*2)\n#define BTS_BLOCKCHAIN_MIN_YIELD_PERIOD_SEC                 (60*60*24) \/\/ 24 hours\n\n#define BTS_BLOCKCHAIN_MIN_BURN_FEE                         BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_DEFAULT_RELAY_FEE                    10000 \/\/ XTS\n#define BTS_BLOCKCHAIN_MINIMUM_SHORT_ORDER_SIZE             (BTS_BLOCKCHAIN_PRECISION*100)\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (2*60*60) \/\/ 2 hours\n#else\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (30*24*60*60) \/\/ 1 month\n#endif\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               40\n#else\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               (60*60) \/\/ 1 hour\n#endif\n\n\/**\n * The number of delegates that the blockchain is designed to support\n *\/\n#define BTS_BLOCKCHAIN_HOUSE_EDGE                           (1) \/\/ 1% house edge\n#define BTS_BLOCKCHAIN_NUM_DELEGATES                        uint32_t(101)\n#define BTS_BLOCKCHAIN_MAX_SLATE_SIZE                       (BTS_BLOCKCHAIN_NUM_DELEGATES + (BTS_BLOCKCHAIN_NUM_DELEGATES\/10))\n#define BTS_BLOCKCHAIN_MIN_FEEDS                            ((BTS_BLOCKCHAIN_NUM_DELEGATES\/2) + 1)\n#define BTS_BLOCKCHAIN_MAX_UNDO_HISTORY                     (BTS_BLOCKCHAIN_NUM_DELEGATES*4)\n\n#define BTS_BLOCKCHAIN_ENABLE_NEGATIVE_VOTES                false\n\n#define BTS_MAX_DELEGATE_PAY_PER_BLOCK                      int64_t( 50 * BTS_BLOCKCHAIN_PRECISION ) \/\/ 50 XTS\n\n\/**\n * To prevent a delegate from producing blocks on split network,\n * we check the connection count.  This means no blocks get produced\n * until at least a minimum number of clients are on line.\n *\/\n#define BTS_MIN_DELEGATE_CONNECTION_COUNT                   1\n\n\/**\n * Defines the number of seconds that should elapse between blocks\n *\/\n#define BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC                   int64_t(10)\n\n\/**\n *  The maximum size of the raw data contained in the blockchain, this size is\n *  notional based upon the serilized size of all user-generated transactions in\n *  all blocks for one year.\n *\n *  Actual size on disk will likely be 2 or 3x this size due to indexes and other\n *  storeage overhead.\n *\n *  Adjusting this value will change the effective fee charged on transactions\n *\/\n#define BTS_BLOCKCHAIN_MAX_SIZE                             (1024*1024*1024*int64_t(100)) \/\/ 100 GB\n#define BTS_BLOCKCHAIN_MIN_NAME_SIZE                        1\n#define BTS_BLOCKCHAIN_MAX_NAME_SIZE                        63\n#define BTS_BLOCKCHAIN_MAX_NAME_DATA_SIZE                   (1024*64)\n#define BTS_BLOCKCHAIN_MAX_MEMO_SIZE                        19 \/\/ bytes\n#define BTS_BLOCKCHAIN_MAX_SYMBOL_SIZE                      8 \/\/ characters\n#define BTS_BLOCKCHAIN_MIN_SYMBOL_SIZE                      3 \/\/ characters\n\n\/**\n *  The maximum amount that can be issued for user assets.\n *\n *  10^18 \/ 2^63 < 1  however, to support representing all share values as a double in\n *  languages like java script, we must stay within the epsilon so\n *\n *  10^15 \/ 2^53 < 1 allows all values to be represented as a double or an int64\n *\/\n#define BTS_BLOCKCHAIN_MAX_SHARES                           (1000*1000*int64_t(1000)*1000*int64_t(1000))\n\n\/**\n * Initial shares read from the genesis block are scaled to this number. It is divided\n * by 100 so that new shares may be issued without exceeding BTS_BLOCKCHAIN_MAX_SHARES\n *\/\n#define BTS_BLOCKCHAIN_INITIAL_SHARES                       (BTS_BLOCKCHAIN_MAX_SHARES\/5)\n\n\/**\n *  The number of blocks expected per hour based upon the BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC\n *\/\n#define BTS_BLOCKCHAIN_BLOCKS_PER_HOUR                      ((60*60)\/BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n\n\/**\n *  The number of blocks expected per day based upon the BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC\n *\/\n#define BTS_BLOCKCHAIN_BLOCKS_PER_DAY                       (BTS_BLOCKCHAIN_BLOCKS_PER_HOUR*int64_t(24))\n\n\/**\n * The number of blocks expected per year based upon the BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC\n *\/\n#define BTS_BLOCKCHAIN_BLOCKS_PER_YEAR                      (BTS_BLOCKCHAIN_BLOCKS_PER_DAY*int64_t(365))\n\n#define BTS_BLOCKCHAIN_AVERAGE_TRX_SIZE                     512 \/\/ just a random assumption used to calibrate TRX per SEC\n#define BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND                   1  \/\/ (10)\n#define BTS_BLOCKCHAIN_MAX_PENDING_QUEUE_SIZE               10 \/\/ (BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n\n\/** defines the maximum block size allowed, 2 MB per hour *\/\n#define BTS_BLOCKCHAIN_MAX_BLOCK_SIZE                       (10 * BTS_BLOCKCHAIN_AVERAGE_TRX_SIZE * BTS_BLOCKCHAIN_MAX_PENDING_QUEUE_SIZE )\n\n\/**\n    This constant defines the number of blocks a delegate must produce before\n    they are expected to break even on registration costs with their earned income.\n\n *   Currently set to 2 hours of active block production to break even.\n *\/\n#define BTS_BLOCKCHAIN_DELEGATE_REGISTRATION_FEE            (BTS_BLOCKCHAIN_BLOCKS_PER_DAY\/12)\n\n\/**\n    If you are going to create an asset, you expect that it will be used in transactions.  We would\n    like to limit the issuance of assets that have no demand for transactions, so we charge a fee\n    proportional to average transaction fees included in a block (AKA delegate pay).  This constant\n    defines the number of blocks worth of transactions that justify the creation of a new asset.\n\n    The fee is set such that the transactions of this asset alone could justify filling up 2 full weeks of\n    block production.\n *\/\n#define BTS_BLOCKCHAIN_ASSET_REGISTRATION_FEE               (BTS_BLOCKCHAIN_BLOCKS_PER_DAY * 14)\n<commit_msg>revert bad commit<commit_after>#pragma once\n\n#include <stdint.h>\n\n\/* Comment out this line for a non-test network *\/\n#define BTS_TEST_NETWORK\n#define BTS_TEST_NETWORK_VERSION                            5 \/\/ autogenerated\n\n\/** @file bts\/blockchain\/config.hpp\n *  @brief Defines global constants that determine blockchain behavior\n *\/\n#define BTS_BLOCKCHAIN_VERSION                              1\n#define BTS_BLOCKCHAIN_DATABASE_VERSION                     5\n\n\/**\n *  The address prepended to string representation of\n *  addresses.\n *\n *  Changing these parameters will result in a hard fork.\n *\/\n#define BTS_ADDRESS_PREFIX                                  \"PLS\"\n#define BTS_BLOCKCHAIN_SYMBOL                               \"PLS\"\n#define BTS_BLOCKCHAIN_NAME                                 \"BitShares PLS\"\n#define BTS_BLOCKCHAIN_DESCRIPTION                          \"BitShares PLAY Test Network\"\n\n#define BTS_BLOCKCHAIN_PRECISION                            100000\n#define BTS_BLOCKCHAIN_MAX_TRANSACTION_EXPIRATION_SEC       (60*60*24*2)\n#define BTS_BLOCKCHAIN_MIN_YIELD_PERIOD_SEC                 (60*60*24) \/\/ 24 hours\n\n#define BTS_BLOCKCHAIN_MIN_BURN_FEE                         BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_DEFAULT_RELAY_FEE                    10000 \/\/ XTS\n#define BTS_BLOCKCHAIN_MINIMUM_SHORT_ORDER_SIZE             (BTS_BLOCKCHAIN_PRECISION*100)\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (2*60*60) \/\/ 2 hours\n#else\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (30*24*60*60) \/\/ 1 month\n#endif\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               40\n#else\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               (60*60) \/\/ 1 hour\n#endif\n\n\/**\n * The number of delegates that the blockchain is designed to support\n *\/\n#define BTS_BLOCKCHAIN_HOUSE_EDGE                           (1) \/\/ 1% house edge\n#define BTS_BLOCKCHAIN_NUM_DELEGATES                        uint32_t(101)\n#define BTS_BLOCKCHAIN_MAX_SLATE_SIZE                       (BTS_BLOCKCHAIN_NUM_DELEGATES + (BTS_BLOCKCHAIN_NUM_DELEGATES\/10))\n#define BTS_BLOCKCHAIN_MIN_FEEDS                            ((BTS_BLOCKCHAIN_NUM_DELEGATES\/2) + 1)\n#define BTS_BLOCKCHAIN_MAX_UNDO_HISTORY                     (BTS_BLOCKCHAIN_NUM_DELEGATES*4)\n\n#define BTS_BLOCKCHAIN_ENABLE_NEGATIVE_VOTES                false\n\n#define BTS_MAX_DELEGATE_PAY_PER_BLOCK                      int64_t( 50 * BTS_BLOCKCHAIN_PRECISION ) \/\/ 50 XTS\n\n\/**\n * To prevent a delegate from producing blocks on split network,\n * we check the connection count.  This means no blocks get produced\n * until at least a minimum number of clients are on line.\n *\/\n#define BTS_MIN_DELEGATE_CONNECTION_COUNT                   1\n\n\/**\n * Defines the number of seconds that should elapse between blocks\n *\/\n#define BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC                   int64_t(10)\n\n\/**\n *  The maximum size of the raw data contained in the blockchain, this size is\n *  notional based upon the serilized size of all user-generated transactions in\n *  all blocks for one year.\n *\n *  Actual size on disk will likely be 2 or 3x this size due to indexes and other\n *  storeage overhead.\n *\n *  Adjusting this value will change the effective fee charged on transactions\n *\/\n#define BTS_BLOCKCHAIN_MAX_SIZE                             (1024*1024*1024*int64_t(100)) \/\/ 100 GB\n#define BTS_BLOCKCHAIN_MIN_NAME_SIZE                        1\n#define BTS_BLOCKCHAIN_MAX_NAME_SIZE                        63\n#define BTS_BLOCKCHAIN_MAX_NAME_DATA_SIZE                   (1024*64)\n#define BTS_BLOCKCHAIN_MAX_MEMO_SIZE                        19 \/\/ bytes\n#define BTS_BLOCKCHAIN_MAX_SYMBOL_SIZE                      8 \/\/ characters\n#define BTS_BLOCKCHAIN_MIN_SYMBOL_SIZE                      3 \/\/ characters\n\n\/**\n *  The maximum amount that can be issued for user assets.\n *\n *  10^18 \/ 2^63 < 1  however, to support representing all share values as a double in\n *  languages like java script, we must stay within the epsilon so\n *\n *  10^15 \/ 2^53 < 1 allows all values to be represented as a double or an int64\n *\/\n#define BTS_BLOCKCHAIN_MAX_SHARES                           (1000*1000*int64_t(1000)*1000*int64_t(1000))\n\n\/**\n * Initial shares read from the genesis block are scaled to this number. It is divided\n * by 100 so that new shares may be issued without exceeding BTS_BLOCKCHAIN_MAX_SHARES\n *\/\n#define BTS_BLOCKCHAIN_INITIAL_SHARES                       (BTS_BLOCKCHAIN_MAX_SHARES\/5)\n\n\/**\n *  The number of blocks expected per hour based upon the BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC\n *\/\n#define BTS_BLOCKCHAIN_BLOCKS_PER_HOUR                      ((60*60)\/BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n\n\/**\n *  The number of blocks expected per day based upon the BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC\n *\/\n#define BTS_BLOCKCHAIN_BLOCKS_PER_DAY                       (BTS_BLOCKCHAIN_BLOCKS_PER_HOUR*int64_t(24))\n\n\/**\n * The number of blocks expected per year based upon the BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC\n *\/\n#define BTS_BLOCKCHAIN_BLOCKS_PER_YEAR                      (BTS_BLOCKCHAIN_BLOCKS_PER_DAY*int64_t(365))\n\n#define BTS_BLOCKCHAIN_AVERAGE_TRX_SIZE                     512 \/\/ just a random assumption used to calibrate TRX per SEC\n#define BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND                   1  \/\/ (10)\n#define BTS_BLOCKCHAIN_MAX_PENDING_QUEUE_SIZE               10 \/\/ (BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n\n\/** defines the maximum block size allowed, 2 MB per hour *\/\n#define BTS_BLOCKCHAIN_MAX_BLOCK_SIZE                       (10 * BTS_BLOCKCHAIN_AVERAGE_TRX_SIZE * BTS_BLOCKCHAIN_MAX_PENDING_QUEUE_SIZE )\n\n\/**\n    This constant defines the number of blocks a delegate must produce before\n    they are expected to break even on registration costs with their earned income.\n\n *   Currently set to 2 hours of active block production to break even.\n *\/\n#define BTS_BLOCKCHAIN_DELEGATE_REGISTRATION_FEE            (BTS_BLOCKCHAIN_BLOCKS_PER_DAY\/12)\n\n\/**\n    If you are going to create an asset, you expect that it will be used in transactions.  We would\n    like to limit the issuance of assets that have no demand for transactions, so we charge a fee\n    proportional to average transaction fees included in a block (AKA delegate pay).  This constant\n    defines the number of blocks worth of transactions that justify the creation of a new asset.\n\n    The fee is set such that the transactions of this asset alone could justify filling up 2 full weeks of\n    block production.\n *\/\n#define BTS_BLOCKCHAIN_ASSET_REGISTRATION_FEE               (BTS_BLOCKCHAIN_BLOCKS_PER_DAY * 14)\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <stdint.h>\n\n\/* Comment out this line for a non-test network *\/\n\/\/ #define BTS_TEST_NETWORK\n\/\/ #define BTS_TEST_NETWORK_VERSION                            10 \/\/ autogenerated\n\n#define BTS_TEST_NETWORK_VERSION                            23 \/\/ autogenerated\n#define BTS_BLOCKCHAIN_DATABASE_VERSION                     uint64_t( 21 )\n\n\/**\n *  The address prepended to string representation of\n *  addresses.\n *\n *  Changing these parameters will result in a hard fork.\n *\/\n#define BTS_ADDRESS_PREFIX                                  \"PLS\"\n#define BTS_BLOCKCHAIN_SYMBOL                               \"PLS\"\n#define BTS_BLOCKCHAIN_NAME                                 \"DAC PLAY\"\n#define BTS_BLOCKCHAIN_DESCRIPTION                          \"DAC PLAY Network\"\n\n#define BTS_BLOCKCHAIN_PRECISION                            100000\n\n#define BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC                   int64_t(10)\n#define BTS_BLOCKCHAIN_BLOCKS_PER_HOUR                      ((60*60)\/BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n#define BTS_BLOCKCHAIN_BLOCKS_PER_DAY                       (BTS_BLOCKCHAIN_BLOCKS_PER_HOUR*int64_t(24))\n#define BTS_BLOCKCHAIN_BLOCKS_PER_YEAR                      (BTS_BLOCKCHAIN_BLOCKS_PER_DAY*int64_t(365))\n\n#define BTS_BLOCKCHAIN_NUM_DELEGATES                        uint32_t(101)\n#define BTS_MAX_DELEGATE_PAY_PER_BLOCK                      int64_t( 50 * BTS_BLOCKCHAIN_PRECISION ) \/\/ 50 XTS\n#define BTS_BLOCKCHAIN_MAX_UNDO_HISTORY                     ( BTS_BLOCKCHAIN_BLOCKS_PER_HOUR * 3 )\n\n#define BTS_BLOCKCHAIN_MAX_SLATE_SIZE                       (BTS_BLOCKCHAIN_NUM_DELEGATES + (BTS_BLOCKCHAIN_NUM_DELEGATES\/10))\n#define BTS_BLOCKCHAIN_MAX_TRANSACTION_EXPIRATION_SEC       (60*60*24*2)\n#define BTS_BLOCKCHAIN_MAX_MEMO_SIZE                        19 \/\/ bytes\n#define BTS_BLOCKCHAIN_EXTENDED_MEMO_SIZE                   32 \/\/ bytes\n#define BTS_BLOCKCHAIN_MAX_EXTENDED_MEMO_SIZE               (BTS_BLOCKCHAIN_MAX_MEMO_SIZE + BTS_BLOCKCHAIN_EXTENDED_MEMO_SIZE)\n\n\/**\n *  The maximum amount that can be issued for user assets.\n *\n *  10^18 \/ 2^63 < 1  however, to support representing all share values as a double in\n *  languages like java script, we must stay within the epsilon so\n *\n *  10^15 \/ 2^53 < 1 allows all values to be represented as a double or an int64\n *\/\n#define BTS_BLOCKCHAIN_MAX_SHARES                           (1000*1000*int64_t(1000)*1000*int64_t(1000))\n\n#define BTS_BLOCKCHAIN_MIN_NAME_SIZE                        1\n#define BTS_BLOCKCHAIN_MAX_NAME_SIZE                        63\n#define BTS_BLOCKCHAIN_MAX_NAME_DATA_SIZE                   (1024*64)\n\n#define BTS_BLOCKCHAIN_MAX_SUB_SYMBOL_SIZE                  8 \/\/ characters\n#define BTS_BLOCKCHAIN_MIN_SYMBOL_SIZE                      3 \/\/ characters\n#define BTS_BLOCKCHAIN_MAX_SYMBOL_SIZE                      12 \/\/ characters\n\n#define BTS_BLOCKCHAIN_MIN_BURN_FEE                         BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_MIN_NOTE_FEE                         BTS_BLOCKCHAIN_PRECISION * 5 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_MIN_AD_FEE                           BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_MIN_RED_PACKET_FEE                   BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_MIN_RED_PACKET_UNIT                  BTS_BLOCKCHAIN_PRECISION * 1 \/\/ XTS\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               10\n#else\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               (60*60) \/\/ 1 hour\n#endif\n\n#define BTS_BLOCKCHAIN_MIN_FEEDS                            ((BTS_BLOCKCHAIN_NUM_DELEGATES\/2) + 1)\n#define BTS_BLOCKCHAIN_MINIMUM_SHORT_ORDER_SIZE             (BTS_BLOCKCHAIN_PRECISION*100)\n#define BTS_BLOCKCHAIN_MIN_YIELD_PERIOD_SEC                 (60*60*24) \/\/ 24 hours\n#define BTS_BLOCKCHAIN_MAX_YIELD_PERIOD_SEC                 (BTS_BLOCKCHAIN_BLOCKS_PER_YEAR * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC) \/\/ 1 year\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (2*60*60) \/\/ 2 hours\n#else\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (30*24*60*60) \/\/ 1 month\n#endif\n\n#define BTS_BLOCKCHAIN_MAX_SHORT_APR_PCT                    uint64_t( 50 )\n\n#define BTS_BLOCKCHAIN_MCALL_D2C_NUMERATOR                  1\n#define BTS_BLOCKCHAIN_MCALL_D2C_DENOMINATOR                2\n\n#define BTS_BLOCKCHAIN_MAX_UIA_MARKET_FEE_RATE              10000\n\n\/\/ TODO: This stuff only matters for propagation throttling; should go somewhere else\n#define BTS_BLOCKCHAIN_DEFAULT_RELAY_FEE                    10000 \/\/ XTS\n#define BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND                   1  \/\/ (10)\n#define BTS_BLOCKCHAIN_MAX_PENDING_QUEUE_SIZE               10 \/\/ (BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n<commit_msg>update db version<commit_after>#pragma once\n\n#include <stdint.h>\n\n\/* Comment out this line for a non-test network *\/\n\/\/ #define BTS_TEST_NETWORK\n\/\/ #define BTS_TEST_NETWORK_VERSION                            10 \/\/ autogenerated\n\n#define BTS_TEST_NETWORK_VERSION                            23 \/\/ autogenerated\n#define BTS_BLOCKCHAIN_DATABASE_VERSION                     uint64_t( 22 )\n\n\/**\n *  The address prepended to string representation of\n *  addresses.\n *\n *  Changing these parameters will result in a hard fork.\n *\/\n#define BTS_ADDRESS_PREFIX                                  \"PLS\"\n#define BTS_BLOCKCHAIN_SYMBOL                               \"PLS\"\n#define BTS_BLOCKCHAIN_NAME                                 \"DAC PLAY\"\n#define BTS_BLOCKCHAIN_DESCRIPTION                          \"DAC PLAY Network\"\n\n#define BTS_BLOCKCHAIN_PRECISION                            100000\n\n#define BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC                   int64_t(10)\n#define BTS_BLOCKCHAIN_BLOCKS_PER_HOUR                      ((60*60)\/BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n#define BTS_BLOCKCHAIN_BLOCKS_PER_DAY                       (BTS_BLOCKCHAIN_BLOCKS_PER_HOUR*int64_t(24))\n#define BTS_BLOCKCHAIN_BLOCKS_PER_YEAR                      (BTS_BLOCKCHAIN_BLOCKS_PER_DAY*int64_t(365))\n\n#define BTS_BLOCKCHAIN_NUM_DELEGATES                        uint32_t(101)\n#define BTS_MAX_DELEGATE_PAY_PER_BLOCK                      int64_t( 50 * BTS_BLOCKCHAIN_PRECISION ) \/\/ 50 XTS\n#define BTS_BLOCKCHAIN_MAX_UNDO_HISTORY                     ( BTS_BLOCKCHAIN_BLOCKS_PER_HOUR * 3 )\n\n#define BTS_BLOCKCHAIN_MAX_SLATE_SIZE                       (BTS_BLOCKCHAIN_NUM_DELEGATES + (BTS_BLOCKCHAIN_NUM_DELEGATES\/10))\n#define BTS_BLOCKCHAIN_MAX_TRANSACTION_EXPIRATION_SEC       (60*60*24*2)\n#define BTS_BLOCKCHAIN_MAX_MEMO_SIZE                        19 \/\/ bytes\n#define BTS_BLOCKCHAIN_EXTENDED_MEMO_SIZE                   32 \/\/ bytes\n#define BTS_BLOCKCHAIN_MAX_EXTENDED_MEMO_SIZE               (BTS_BLOCKCHAIN_MAX_MEMO_SIZE + BTS_BLOCKCHAIN_EXTENDED_MEMO_SIZE)\n\n\/**\n *  The maximum amount that can be issued for user assets.\n *\n *  10^18 \/ 2^63 < 1  however, to support representing all share values as a double in\n *  languages like java script, we must stay within the epsilon so\n *\n *  10^15 \/ 2^53 < 1 allows all values to be represented as a double or an int64\n *\/\n#define BTS_BLOCKCHAIN_MAX_SHARES                           (1000*1000*int64_t(1000)*1000*int64_t(1000))\n\n#define BTS_BLOCKCHAIN_MIN_NAME_SIZE                        1\n#define BTS_BLOCKCHAIN_MAX_NAME_SIZE                        63\n#define BTS_BLOCKCHAIN_MAX_NAME_DATA_SIZE                   (1024*64)\n\n#define BTS_BLOCKCHAIN_MAX_SUB_SYMBOL_SIZE                  8 \/\/ characters\n#define BTS_BLOCKCHAIN_MIN_SYMBOL_SIZE                      3 \/\/ characters\n#define BTS_BLOCKCHAIN_MAX_SYMBOL_SIZE                      12 \/\/ characters\n\n#define BTS_BLOCKCHAIN_MIN_BURN_FEE                         BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_MIN_NOTE_FEE                         BTS_BLOCKCHAIN_PRECISION * 5 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_MIN_AD_FEE                           BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_MIN_RED_PACKET_FEE                   BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n#define BTS_BLOCKCHAIN_MIN_RED_PACKET_UNIT                  BTS_BLOCKCHAIN_PRECISION * 1 \/\/ XTS\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               10\n#else\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               (60*60) \/\/ 1 hour\n#endif\n\n#define BTS_BLOCKCHAIN_MIN_FEEDS                            ((BTS_BLOCKCHAIN_NUM_DELEGATES\/2) + 1)\n#define BTS_BLOCKCHAIN_MINIMUM_SHORT_ORDER_SIZE             (BTS_BLOCKCHAIN_PRECISION*100)\n#define BTS_BLOCKCHAIN_MIN_YIELD_PERIOD_SEC                 (60*60*24) \/\/ 24 hours\n#define BTS_BLOCKCHAIN_MAX_YIELD_PERIOD_SEC                 (BTS_BLOCKCHAIN_BLOCKS_PER_YEAR * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC) \/\/ 1 year\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (2*60*60) \/\/ 2 hours\n#else\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (30*24*60*60) \/\/ 1 month\n#endif\n\n#define BTS_BLOCKCHAIN_MAX_SHORT_APR_PCT                    uint64_t( 50 )\n\n#define BTS_BLOCKCHAIN_MCALL_D2C_NUMERATOR                  1\n#define BTS_BLOCKCHAIN_MCALL_D2C_DENOMINATOR                2\n\n#define BTS_BLOCKCHAIN_MAX_UIA_MARKET_FEE_RATE              10000\n\n\/\/ TODO: This stuff only matters for propagation throttling; should go somewhere else\n#define BTS_BLOCKCHAIN_DEFAULT_RELAY_FEE                    10000 \/\/ XTS\n#define BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND                   1  \/\/ (10)\n#define BTS_BLOCKCHAIN_MAX_PENDING_QUEUE_SIZE               10 \/\/ (BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-8-4 22:09:58\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\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst char ds[4] = {'D', 'R', 'U', 'L'};\n\ntypedef tuple<ll, int, int> state;\n\n\/\/ const int C = 1e6+10;\nconst ll infty = 1000000007;\n\nint N, M, K;\nstring D;\nstring S[1010];\nll dist[200010][4];\nll ans[1010][1010];\n\nint main()\n{\n  cin >> N >> M >> K;\n  cin >> D;\n  D = D + D + D;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> S[i];\n  }\n  for (auto k = 0; k < 4; k++)\n  {\n    dist[2 * K][k] = infty;\n  }\n  for (int i = 2 * K - 1; i >= 0; i--)\n  {\n    for (auto k = 0; k < 4; k++)\n    {\n      if (D[i] == ds[k])\n      {\n        dist[i][k] = 1;\n      }\n      else\n      {\n        dist[i][k] = dist[i + 1][k] + 1;\n      }\n    }\n  }\n  \/*\n  for (auto i = 0; i < K; i++)\n  {\n    for (auto k = 0; k < 4; k++)\n    {\n      cerr << \"dist[\" << i << \"][\" << k << \"] = \" << dist[i][k] << endl;\n    }\n  }\n  *\/\n  int sx, sy, gx, gy;\n  fill(&ans[0][0], &ans[0][0] + 1010 * 1010, -1);\n  for (auto i = 0; i < N; i++)\n  {\n    for (auto j = 0; j < M; j++)\n    {\n      if (S[i][j] == 'S')\n      {\n        sx = i;\n        sy = j;\n      }\n      else if (S[i][j] == 'G')\n      {\n        gx = i;\n        gy = j;\n      }\n    }\n  }\n  priority_queue<state, vector<state>, greater<state>> Q;\n  Q.push(state(0, sx, sy));\n  while (!Q.empty())\n  {\n    ll d = get<0>(Q.top());\n    int x = get<1>(Q.top());\n    int y = get<2>(Q.top());\n    Q.pop();\n    if (ans[x][y] == -1)\n    {\n      ans[x][y] = d;\n      \/\/ cerr << \"ans[\" << x << \"][\" << y << \"] = \" << ans[x][y] << endl;\n      if (x == gx && y == gy)\n      {\n        cout << d << endl;\n        return 0;\n      }\n      for (auto k = 0; k < 4; k++)\n      {\n        int new_x = x + dx[k];\n        int new_y = y + dy[k];\n        if (0 <= new_x && new_x < N && 0 <= new_y && new_y < M && S[new_x][new_y] != '#' && ans[new_x][new_y] == -1)\n        {\n          ll new_d = d + dist[d % K][k];\n          if (new_d < infty)\n          {\n            Q.push(state(new_d, new_x, new_y));\n          }\n        }\n      }\n    }\n  }\n  cout << -1 << endl;\n}<commit_msg>submit E.cpp to 'E - 迷路' (mujin-pc-2018) [C++14 (GCC 5.4.1)]<commit_after>\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-8-4 22:09:58\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\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst char ds[4] = {'D', 'R', 'U', 'L'};\n\ntypedef tuple<ll, int, int> state;\n\n\/\/ const int C = 1e6+10;\nconst ll infty = 1000000007;\n\nint N, M, K;\nstring D;\nstring S[1010];\nll dist[300010][4];\nll ans[1010][1010];\n\nint main()\n{\n  cin >> N >> M >> K;\n  cin >> D;\n  D = D + D + D;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> S[i];\n  }\n  for (auto k = 0; k < 4; k++)\n  {\n    dist[3 * K][k] = infty;\n  }\n  for (int i = 3 * K - 1; i >= 0; i--)\n  {\n    for (auto k = 0; k < 4; k++)\n    {\n      if (D[i] == ds[k])\n      {\n        dist[i][k] = 1;\n      }\n      else\n      {\n        dist[i][k] = dist[i + 1][k] + 1;\n      }\n    }\n  }\n  \/*\n  for (auto i = 0; i < K; i++)\n  {\n    for (auto k = 0; k < 4; k++)\n    {\n      cerr << \"dist[\" << i << \"][\" << k << \"] = \" << dist[i][k] << endl;\n    }\n  }\n  *\/\n  int sx, sy, gx, gy;\n  fill(&ans[0][0], &ans[0][0] + 1010 * 1010, -1);\n  for (auto i = 0; i < N; i++)\n  {\n    for (auto j = 0; j < M; j++)\n    {\n      if (S[i][j] == 'S')\n      {\n        sx = i;\n        sy = j;\n      }\n      else if (S[i][j] == 'G')\n      {\n        gx = i;\n        gy = j;\n      }\n    }\n  }\n  priority_queue<state, vector<state>, greater<state>> Q;\n  Q.push(state(0, sx, sy));\n  while (!Q.empty())\n  {\n    ll d = get<0>(Q.top());\n    int x = get<1>(Q.top());\n    int y = get<2>(Q.top());\n    Q.pop();\n    if (ans[x][y] == -1)\n    {\n      ans[x][y] = d;\n      \/\/ cerr << \"ans[\" << x << \"][\" << y << \"] = \" << ans[x][y] << endl;\n      if (x == gx && y == gy)\n      {\n        cout << d << endl;\n        return 0;\n      }\n      for (auto k = 0; k < 4; k++)\n      {\n        int new_x = x + dx[k];\n        int new_y = y + dy[k];\n        if (0 <= new_x && new_x < N && 0 <= new_y && new_y < M && S[new_x][new_y] != '#' && ans[new_x][new_y] == -1)\n        {\n          ll new_d = d + dist[d % K][k];\n          if (new_d < infty)\n          {\n            Q.push(state(new_d, new_x, new_y));\n          }\n        }\n      }\n    }\n  }\n  cout << -1 << endl;\n}<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/* EBookImportFilter: Sets up the filter, and calls DocumentCollector\n * to do the actual filtering\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 <com\/sun\/star\/uno\/Reference.h>\n#include <cppuhelper\/supportsservice.hxx>\n\n#include <libe-book\/libe-book.h>\n\n#include \"EBookImportFilter.hxx\"\n\nusing com::sun::star::uno::Sequence;\nusing com::sun::star::uno::Reference;\nusing com::sun::star::uno::Any;\nusing com::sun::star::uno::XInterface;\nusing com::sun::star::uno::Exception;\nusing com::sun::star::uno::RuntimeException;\nusing com::sun::star::uno::XComponentContext;\n\nusing libebook::EBOOKDocument;\n\nbool EBookImportFilter::doImportDocument( librevenge::RVNGInputStream &rInput, const rtl::OUString &rFilterName, librevenge::RVNGTextInterface &rGenerator )\n{\n    if (rFilterName == \"FictionBook 2\")\n        return EBOOKDocument::parse(&rInput, &rGenerator, EBOOKDocument::TYPE_FICTIONBOOK2);\n    else if (rFilterName == \"PalmDoc\")\n        return EBOOKDocument::parse(&rInput, &rGenerator, EBOOKDocument::TYPE_PALMDOC);\n    else if (rFilterName == \"Plucker eBook\")\n        return EBOOKDocument::parse(&rInput, &rGenerator, EBOOKDocument::TYPE_PLUCKER);\n    else if (rFilterName == \"eReader eBook\")\n        return EBOOKDocument::parse(&rInput, &rGenerator, EBOOKDocument::TYPE_PEANUTPRESS);\n    else if (rFilterName == \"TealDoc\")\n        return EBOOKDocument::parse(&rInput, &rGenerator, EBOOKDocument::TYPE_TEALDOC);\n    else if (rFilterName == \"zTXT\")\n        return EBOOKDocument::parse(&rInput, &rGenerator, EBOOKDocument::TYPE_ZTXT);\n\n    return false;\n}\n\nbool EBookImportFilter::doDetectFormat( librevenge::RVNGInputStream &rInput, OUString &rTypeName )\n{\n    rTypeName = \"\";\n\n    EBOOKDocument::Type type = EBOOKDocument::TYPE_UNKNOWN;\n\n    if (EBOOKDocument::CONFIDENCE_EXCELLENT == EBOOKDocument::isSupported(&rInput, &type))\n    {\n        switch (type)\n        {\n            case EBOOKDocument::TYPE_FICTIONBOOK2 :\n                rTypeName = \"writer_FictionBook_2\";\n                break;\n            case EBOOKDocument::TYPE_PALMDOC :\n                rTypeName = \"writer_PalmDoc\";\n                break;\n            case EBOOKDocument::TYPE_PLUCKER :\n                rTypeName = \"writer_Plucker_eBook\";\n                break;\n            case EBOOKDocument::TYPE_PEANUTPRESS :\n                rTypeName = \"writer_eReader_eBook\";\n                break;\n            case EBOOKDocument::TYPE_TEALDOC :\n                rTypeName = \"writer_TealDoc\";\n                break;\n            case EBOOKDocument::TYPE_ZTXT :\n                rTypeName = \"writer_zTXT\";\n                break;\n            default :\n                SAL_WARN_IF(type != EBOOKDocument::TYPE_UNKNOWN, \"writerperfect\", \"EBookImportFilter::doDetectFormat: document type \" << type << \" detected, but ignored\");\n        }\n    }\n\n    return !rTypeName.isEmpty();\n}\n\nOUString EBookImportFilter_getImplementationName ()\nthrow (RuntimeException)\n{\n    return OUString (  \"org.libreoffice.comp.Writer.EBookImportFilter\"  );\n}\n\nSequence< OUString > SAL_CALL EBookImportFilter_getSupportedServiceNames(  )\nthrow (RuntimeException)\n{\n    Sequence < OUString > aRet(2);\n    OUString *pArray = aRet.getArray();\n    pArray[0] =  \"com.sun.star.document.ImportFilter\";\n    pArray[1] =  \"com.sun.star.document.ExtendedTypeDetection\";\n    return aRet;\n}\n#undef SERVICE_NAME2\n#undef SERVICE_NAME1\n\nReference< XInterface > SAL_CALL EBookImportFilter_createInstance( const Reference< XComponentContext > & rContext)\nthrow( Exception )\n{\n    return (cppu::OWeakObject *) new EBookImportFilter( rContext );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL EBookImportFilter::getImplementationName(  )\nthrow (RuntimeException, std::exception)\n{\n    return EBookImportFilter_getImplementationName();\n}\nsal_Bool SAL_CALL EBookImportFilter::supportsService( const OUString &rServiceName )\nthrow (RuntimeException, std::exception)\n{\n    return cppu::supportsService( this, rServiceName );\n}\nSequence< OUString > SAL_CALL EBookImportFilter::getSupportedServiceNames(  )\nthrow (RuntimeException, std::exception)\n{\n    return EBookImportFilter_getSupportedServiceNames();\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>fix return value for libe-book import filter<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/* EBookImportFilter: Sets up the filter, and calls DocumentCollector\n * to do the actual filtering\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 <com\/sun\/star\/uno\/Reference.h>\n#include <cppuhelper\/supportsservice.hxx>\n\n#include <libe-book\/libe-book.h>\n\n#include \"EBookImportFilter.hxx\"\n\nusing com::sun::star::uno::Sequence;\nusing com::sun::star::uno::Reference;\nusing com::sun::star::uno::Any;\nusing com::sun::star::uno::XInterface;\nusing com::sun::star::uno::Exception;\nusing com::sun::star::uno::RuntimeException;\nusing com::sun::star::uno::XComponentContext;\n\nusing libebook::EBOOKDocument;\n\nbool EBookImportFilter::doImportDocument( librevenge::RVNGInputStream &rInput, const rtl::OUString &rFilterName, librevenge::RVNGTextInterface &rGenerator )\n{\n    EBOOKDocument::Type type = EBOOKDocument::TYPE_UNKNOWN;\n\n    if (rFilterName == \"FictionBook 2\")\n        type = EBOOKDocument::TYPE_FICTIONBOOK2;\n    else if (rFilterName == \"PalmDoc\")\n        type = EBOOKDocument::TYPE_PALMDOC;\n    else if (rFilterName == \"Plucker eBook\")\n        type = EBOOKDocument::TYPE_PLUCKER;\n    else if (rFilterName == \"eReader eBook\")\n        type = EBOOKDocument::TYPE_PEANUTPRESS;\n    else if (rFilterName == \"TealDoc\")\n        type = EBOOKDocument::TYPE_TEALDOC;\n    else if (rFilterName == \"zTXT\")\n        type = EBOOKDocument::TYPE_ZTXT;\n\n    if (EBOOKDocument::TYPE_UNKNOWN != type)\n        return EBOOKDocument::RESULT_OK == EBOOKDocument::parse(&rInput, &rGenerator, type);\n\n    return false;\n}\n\nbool EBookImportFilter::doDetectFormat( librevenge::RVNGInputStream &rInput, OUString &rTypeName )\n{\n    rTypeName = \"\";\n\n    EBOOKDocument::Type type = EBOOKDocument::TYPE_UNKNOWN;\n\n    if (EBOOKDocument::CONFIDENCE_EXCELLENT == EBOOKDocument::isSupported(&rInput, &type))\n    {\n        switch (type)\n        {\n            case EBOOKDocument::TYPE_FICTIONBOOK2 :\n                rTypeName = \"writer_FictionBook_2\";\n                break;\n            case EBOOKDocument::TYPE_PALMDOC :\n                rTypeName = \"writer_PalmDoc\";\n                break;\n            case EBOOKDocument::TYPE_PLUCKER :\n                rTypeName = \"writer_Plucker_eBook\";\n                break;\n            case EBOOKDocument::TYPE_PEANUTPRESS :\n                rTypeName = \"writer_eReader_eBook\";\n                break;\n            case EBOOKDocument::TYPE_TEALDOC :\n                rTypeName = \"writer_TealDoc\";\n                break;\n            case EBOOKDocument::TYPE_ZTXT :\n                rTypeName = \"writer_zTXT\";\n                break;\n            default :\n                SAL_WARN_IF(type != EBOOKDocument::TYPE_UNKNOWN, \"writerperfect\", \"EBookImportFilter::doDetectFormat: document type \" << type << \" detected, but ignored\");\n        }\n    }\n\n    return !rTypeName.isEmpty();\n}\n\nOUString EBookImportFilter_getImplementationName ()\nthrow (RuntimeException)\n{\n    return OUString (  \"org.libreoffice.comp.Writer.EBookImportFilter\"  );\n}\n\nSequence< OUString > SAL_CALL EBookImportFilter_getSupportedServiceNames(  )\nthrow (RuntimeException)\n{\n    Sequence < OUString > aRet(2);\n    OUString *pArray = aRet.getArray();\n    pArray[0] =  \"com.sun.star.document.ImportFilter\";\n    pArray[1] =  \"com.sun.star.document.ExtendedTypeDetection\";\n    return aRet;\n}\n#undef SERVICE_NAME2\n#undef SERVICE_NAME1\n\nReference< XInterface > SAL_CALL EBookImportFilter_createInstance( const Reference< XComponentContext > & rContext)\nthrow( Exception )\n{\n    return (cppu::OWeakObject *) new EBookImportFilter( rContext );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL EBookImportFilter::getImplementationName(  )\nthrow (RuntimeException, std::exception)\n{\n    return EBookImportFilter_getImplementationName();\n}\nsal_Bool SAL_CALL EBookImportFilter::supportsService( const OUString &rServiceName )\nthrow (RuntimeException, std::exception)\n{\n    return cppu::supportsService( this, rServiceName );\n}\nSequence< OUString > SAL_CALL EBookImportFilter::getSupportedServiceNames(  )\nthrow (RuntimeException, std::exception)\n{\n    return EBookImportFilter_getSupportedServiceNames();\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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#include <vector>\n\n#include <glog\/logging.h>\n\n#include <gmock\/gmock.h>\n\n#include <gtest\/gtest.h>\n\n#include <stout\/check.hpp>\n#include <stout\/exit.hpp>\n#include <stout\/fs.hpp>\n\n#include <stout\/os\/mkdtemp.hpp>\n#include <stout\/os\/socket.hpp> \/\/ For `wsa_*` on Windows.\n#include <stout\/os\/touch.hpp>\n\n#include <stout\/tests\/environment.hpp>\n\nusing stout::internal::tests::Environment;\nusing stout::internal::tests::TestFilter;\n\nusing std::make_shared;\nusing std::shared_ptr;\nusing std::string;\nusing std::vector;\n\n\n\/\/ Attempt to create a symlink. If creating a symlink fails, disable\n\/\/ all unit tests that rely on the creation of symlinks.\nclass SymlinkFilter : public TestFilter\n{\npublic:\n  SymlinkFilter()\n  {\n    const Try<string> temp_path = os::mkdtemp();\n    CHECK_SOME(temp_path);\n\n    const string file = path::join(temp_path.get(), \"file\");\n    const string link = path::join(temp_path.get(), \"link\");\n\n    CHECK_SOME(os::touch(file));\n\n    Try<Nothing> symlink_check = fs::symlink(file, link);\n    can_create_symlinks = !symlink_check.isError();\n\n    if (!can_create_symlinks) {\n      std::cerr\n        << \"-------------------------------------------------------------\\n\"\n        << \"Unable to create symlinks, so no symlink tests will be run\\n\"\n        << \"-------------------------------------------------------------\"\n        << std::endl;\n    }\n  }\n\n  bool disable(const ::testing::TestInfo* test) const override\n  {\n    return matches(test, \"SYMLINK_\") && !can_create_symlinks;\n  }\n\nprivate:\n  bool can_create_symlinks;\n};\n\n\n#ifdef __WINDOWS__\n\/\/ A no-op parameter validator. We use this to prevent the Windows\n\/\/ implementation of the C runtime from calling `abort` during our test suite.\n\/\/ See comment in `main.cpp`.\nstatic void noop_invalid_parameter_handler(\n    const wchar_t* expression,\n    const wchar_t* function,\n    const wchar_t* file,\n    unsigned int line,\n    uintptr_t reserved)\n{\n  return;\n}\n#endif \/\/ __WINDOWS__\n\n\nint main(int argc, char** argv)\n{\n  \/\/ Initialize Google Mock\/Test.\n  testing::InitGoogleMock(&argc, argv);\n\n#ifndef __WINDOWS__\n  \/\/ Install glog's signal handler.\n  \/\/ NOTE: this function is declared but not defined on Windows, so if we\n  \/\/ attempt to compile this on Windows, we get a linker error.\n  google::InstallFailureSignalHandler();\n#else\n  if (!net::wsa_initialize()) {\n    EXIT(EXIT_FAILURE) << \"WSA failed to initialize\";\n  }\n\n  \/\/ When we're running a debug build, the Windows implementation of the C\n  \/\/ runtime will validate parameters passed to C-standard functions like\n  \/\/ `::close`. When we are in debug mode, if a parameter is invalid, the\n  \/\/ handler will usually call `abort`, rather than populating `errno` and\n  \/\/ returning an error value. Since we expect some tests to pass invalid\n  \/\/ paramaters to these functions, we disable this for testing.\n  _set_invalid_parameter_handler(noop_invalid_parameter_handler);\n#endif \/\/ __WINDOWS__\n\n  vector<shared_ptr<TestFilter>> filters = {make_shared<SymlinkFilter>()};\n  Environment* environment = new Environment(filters);\n  testing::AddGlobalTestEnvironment(environment);\n\n  const int test_results = RUN_ALL_TESTS();\n\n  \/\/ Prefer to return the error code from the test run over the error code\n  \/\/ from the WSA teardown. That is: if the test run failed, return that error\n  \/\/ code; but, if the tests passed, we still want to return an error if the\n  \/\/ WSA teardown failed. If both succeeded, return 0.\n  const bool teardown_failed =\n#ifdef __WINDOWS__\n    !net::wsa_cleanup();\n#else\n    false;\n#endif \/\/ __WINDOWS__\n\n  return test_results > 0\n    ? test_results\n    : teardown_failed;\n}\n<commit_msg>Prevented leaking files in some stout tests.<commit_after>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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#include <vector>\n\n#include <glog\/logging.h>\n\n#include <gmock\/gmock.h>\n\n#include <gtest\/gtest.h>\n\n#include <stout\/check.hpp>\n#include <stout\/exit.hpp>\n#include <stout\/fs.hpp>\n\n#include <stout\/os\/mkdtemp.hpp>\n#include <stout\/os\/rmdir.hpp>\n#include <stout\/os\/socket.hpp> \/\/ For `wsa_*` on Windows.\n#include <stout\/os\/touch.hpp>\n\n#include <stout\/tests\/environment.hpp>\n\nusing stout::internal::tests::Environment;\nusing stout::internal::tests::TestFilter;\n\nusing std::make_shared;\nusing std::shared_ptr;\nusing std::string;\nusing std::vector;\n\n\n\/\/ Attempt to create a symlink. If creating a symlink fails, disable\n\/\/ all unit tests that rely on the creation of symlinks.\nclass SymlinkFilter : public TestFilter\n{\npublic:\n  SymlinkFilter() : temp_path(CHECK_NOTERROR(os::mkdtemp()))\n  {\n    const string file = path::join(temp_path, \"file\");\n    const string link = path::join(temp_path, \"link\");\n\n    CHECK_SOME(os::touch(file));\n\n    Try<Nothing> symlink_check = fs::symlink(file, link);\n    can_create_symlinks = !symlink_check.isError();\n\n    if (!can_create_symlinks) {\n      std::cerr\n        << \"-------------------------------------------------------------\\n\"\n        << \"Unable to create symlinks, so no symlink tests will be run\\n\"\n        << \"-------------------------------------------------------------\"\n        << std::endl;\n    }\n  }\n\n  ~SymlinkFilter() override\n  {\n    os::rmdir(temp_path);\n  }\n\n  bool disable(const ::testing::TestInfo* test) const override\n  {\n    return matches(test, \"SYMLINK_\") && !can_create_symlinks;\n  }\n\nprivate:\n  bool can_create_symlinks;\n  string temp_path;\n};\n\n\n#ifdef __WINDOWS__\n\/\/ A no-op parameter validator. We use this to prevent the Windows\n\/\/ implementation of the C runtime from calling `abort` during our test suite.\n\/\/ See comment in `main.cpp`.\nstatic void noop_invalid_parameter_handler(\n    const wchar_t* expression,\n    const wchar_t* function,\n    const wchar_t* file,\n    unsigned int line,\n    uintptr_t reserved)\n{\n  return;\n}\n#endif \/\/ __WINDOWS__\n\n\nint main(int argc, char** argv)\n{\n  \/\/ Initialize Google Mock\/Test.\n  testing::InitGoogleMock(&argc, argv);\n\n#ifndef __WINDOWS__\n  \/\/ Install glog's signal handler.\n  \/\/ NOTE: this function is declared but not defined on Windows, so if we\n  \/\/ attempt to compile this on Windows, we get a linker error.\n  google::InstallFailureSignalHandler();\n#else\n  if (!net::wsa_initialize()) {\n    EXIT(EXIT_FAILURE) << \"WSA failed to initialize\";\n  }\n\n  \/\/ When we're running a debug build, the Windows implementation of the C\n  \/\/ runtime will validate parameters passed to C-standard functions like\n  \/\/ `::close`. When we are in debug mode, if a parameter is invalid, the\n  \/\/ handler will usually call `abort`, rather than populating `errno` and\n  \/\/ returning an error value. Since we expect some tests to pass invalid\n  \/\/ paramaters to these functions, we disable this for testing.\n  _set_invalid_parameter_handler(noop_invalid_parameter_handler);\n#endif \/\/ __WINDOWS__\n\n  vector<shared_ptr<TestFilter>> filters = {make_shared<SymlinkFilter>()};\n  Environment* environment = new Environment(filters);\n  testing::AddGlobalTestEnvironment(environment);\n\n  const int test_results = RUN_ALL_TESTS();\n\n  \/\/ Prefer to return the error code from the test run over the error code\n  \/\/ from the WSA teardown. That is: if the test run failed, return that error\n  \/\/ code; but, if the tests passed, we still want to return an error if the\n  \/\/ WSA teardown failed. If both succeeded, return 0.\n  const bool teardown_failed =\n#ifdef __WINDOWS__\n    !net::wsa_cleanup();\n#else\n    false;\n#endif \/\/ __WINDOWS__\n\n  return test_results > 0\n    ? test_results\n    : teardown_failed;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"ShareDBManager.h\"\n#include \"Config.h\"\n#include \"ODBCInterface.h\"\n#include \"TimeManager.h\"\n#include \"Log.h\"\n\nBOOL    ShareDBManager::Init()\n{\n    __ENTER_FUNCTION\n\n        \/\/从Config 读取Login DB 相关的数据\n        CHAR    szCharDBHost[ HOST_STR_LEN ] ;\n        strncpy( szCharDBHost, g_Config.m_ShareMemInfo.m_DBIP, HOST_STR_LEN ) ;                      \/\/连接对端IP\n        szCharDBHost[ HOST_STR_LEN - 1 ] = '\\0' ;\n\n        UINT    uCharDBPort = g_Config.m_ShareMemInfo.m_DBPort ;                                     \/\/连接对端端口\n        CHAR    szCharDBDatabase[DATABASE_STR_LEN] ;\n        strncpy( szCharDbDatabase, g_Config.m_ShareMemInfo.m_DBName, DATABASE_STR_LEN ) ;            \/\/数据库名称\n        szCharDBDatabase[ DATABASE_STR_LEN - 1 ] = '\\0' ;\n\n        CHAR    szCharDBUser[ DB_USE_STR_LEN ] ;                                                     \/\/用户名称\n        strncpy( szCharDBUser, g_Config.m_ShareMemInfo.m_DBUser, DB_USE_STR_LEN ) ;\n        szCharDBUser[ DB_USE_STR_LEN - 1 ] = '\\0' ;\n\n        CHAR    szCharDBPassword[ DB_PASSWORD_STR_LEN ] ;                                            \/\/密码\n        strncpy( szCharDBPassword, g_Config.m_ShareMemInfo.m_DBPassword, DB_PASSWORD_STR_LEN ) ;\n        szCharDBPassword[ DB_PASSWORD_STR_LEN - 1 ] = '\\0' ;\n\n        Assert( mCharDBInterface ) ;\n\n        mCharDBInterface->Connect( szCharDBDatabase, szCharDBUser, szCharDBPassword ) ;\n\n        if( !mCharDBInterface->IsConnected() )\n        {\n            Log::SaveLog( \"ShareMemory\", \"mCharDBInterface->Connect()... Get Errors: %s \", mCharDBInterface->GetErrorMsg() ) ;\n        }\n\n        return mCharDBInterface->IsConnected() ;\n\n    __LEAVE_FUNCTION\n\n        return FALSE ;\n}\n\nVOID ShareDBManager::run()\n{\n    __ENTER_FUNCTION\n       \n    __LEAVE_FUNCTION\n}\n<commit_msg>fix some bug<commit_after>#include \"stdafx.h\"\n#include \"ShareDBManager.h\"\n#include \"Config.h\"\n#include \"ODBCInterface.h\"\n#include \"TimeManager.h\"\n#include \"Log.h\"\n\nBOOL    ShareDBManager::Init()\n{\n    __ENTER_FUNCTION\n\n        \/\/从Config 读取Login DB 相关的数据\n        CHAR    szCharDBHost[ HOST_STR_LEN ] ;\n        strncpy( szCharDBHost, g_Config.m_ShareMemInfo.m_DBIP, HOST_STR_LEN ) ;                      \/\/连接对端IP\n        szCharDBHost[ HOST_STR_LEN - 1 ] = '\\0' ;\n\n        UINT    uCharDBPort = g_Config.m_ShareMemInfo.m_DBPort ;                                     \/\/连接对端端口\n        CHAR    szCharDBDatabase[ DATABASE_STR_LEN ] ;\n        strncpy( szCharDBDatabase, g_Config.m_ShareMemInfo.m_DBName, DATABASE_STR_LEN ) ;            \/\/数据库名称\n        szCharDBDatabase[ DATABASE_STR_LEN - 1 ] = '\\0' ;\n\n        CHAR    szCharDBUser[ DB_USE_STR_LEN ] ;                                                     \/\/用户名称\n        strncpy( szCharDBUser, g_Config.m_ShareMemInfo.m_DBUser, DB_USE_STR_LEN ) ;\n        szCharDBUser[ DB_USE_STR_LEN - 1 ] = '\\0' ;\n\n        CHAR    szCharDBPassword[ DB_PASSWORD_STR_LEN ] ;                                            \/\/密码\n        strncpy( szCharDBPassword, g_Config.m_ShareMemInfo.m_DBPassword, DB_PASSWORD_STR_LEN ) ;\n        szCharDBPassword[ DB_PASSWORD_STR_LEN - 1 ] = '\\0' ;\n\n        Assert( mCharDBInterface ) ;\n\n        mCharDBInterface->Connect( szCharDBDatabase, szCharDBUser, szCharDBPassword ) ;\n\n        if( !mCharDBInterface->IsConnected() )\n        {\n            Log::SaveLog( \"ShareMemory\", \"mCharDBInterface->Connect()... Get Errors: %s \", mCharDBInterface->GetErrorMsg() ) ;\n        }\n\n        return mCharDBInterface->IsConnected() ;\n\n    __LEAVE_FUNCTION\n\n        return FALSE ;\n}\n\nVOID ShareDBManager::run()\n{\n    __ENTER_FUNCTION\n       \n    __LEAVE_FUNCTION\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"offeracceptdialogbtc.h\"\n#include \"ui_offeracceptdialogbtc.h\"\n#include \"init.h\"\n#include \"util.h\"\n#include \"offerpaydialog.h\"\n#include \"guiconstants.h\"\n#include \"guiutil.h\"\n#include \"platformstyle.h\"\n#include \"syscoingui.h\"\n#include <QMessageBox>\n#include \"rpcserver.h\"\n#include \"pubkey.h\"\n#include \"wallet\/wallet.h\"\n#include \"main.h\"\n#include \"utilmoneystr.h\"\n#include <QDesktopServices>\n#if QT_VERSION < 0x050000\n#include <QUrl>\n#else\n#include <QUrlQuery>\n#endif\n#include <QPixmap>\n#if defined(HAVE_CONFIG_H)\n#include \"config\/syscoin-config.h\" \/* for USE_QRCODE *\/\n#endif\n#ifdef USE_QRCODE\n#include <qrencode.h>\n#endif\nusing namespace std;\n#include <QNetworkAccessManager>\n#include <QNetworkRequest>\n#include <QNetworkReply>\nextern const CRPCTable tableRPC;\nOfferAcceptDialogBTC::OfferAcceptDialogBTC(const PlatformStyle *platformStyle, QString alias, QString offer, QString quantity, QString notes, QString title, QString currencyCode, QString qstrPrice, QString sellerAlias, QString address, QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::OfferAcceptDialogBTC), platformStyle(platformStyle), alias(alias), offer(offer), notes(notes), quantity(quantity), title(title), sellerAlias(sellerAlias), address(address)\n{\n    ui->setupUi(this);\n\tQString theme = GUIUtil::getThemeName();  \n\tui->aboutShadeBTC->setPixmap(QPixmap(\":\/images\/\" + theme + \"\/about_btc\"));\n\tdblPrice = qstrPrice.toDouble()*quantity.toUInt();\n\tstring strfPrice = strprintf(\"%f\", dblPrice);\n\tQString fprice = QString::fromStdString(strfPrice);\n\tstring strCurrencyCode = currencyCode.toStdString();\n\tui->escrowDisclaimer->setText(tr(\"<font color='blue'>Please note escrow is not available since you are paying in BTC, only SYS payments can be escrowed. <\/font>\"));\n\tui->bitcoinInstructionLabel->setText(tr(\"After paying for this item, please enter the Bitcoin Transaction ID and click on the confirm button below. You may use the QR Code to the left to scan the payment request into your wallet or click on the Open BTC Wallet if you are on the desktop and have Bitcoin Core installed.\"));\n\tui->acceptMessage->setText(tr(\"Are you sure you want to purchase %1 of '%2' from merchant: '%3'? To complete your purchase please pay %4 BTC to %5 using your Bitcoin wallet.\").arg(quantity).arg(title).arg(sellerAlias).arg(fprice).arg(address));\n\tstring strPrice = strprintf(\"%f\", dblPrice);\n\tprice = QString::fromStdString(strPrice);\n\n\tif (!platformStyle->getImagesOnButtons())\n\t{\n\t\tui->confirmButton->setIcon(QIcon());\n\t\tui->openBtcWalletButton->setIcon(QIcon());\n\t\tui->cancelButton->setIcon(QIcon());\n\n\t}\n\telse\n\t{\n\t\tui->confirmButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/transaction_confirmed\"));\n\t\tui->openBtcWalletButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/send\"));\n\t\tui->cancelButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/quit\"));\n\t}\t\n\tthis->offerPaid = false;\n\tconnect(ui->confirmButton, SIGNAL(clicked()), this, SLOT(tryAcceptOffer()));\n\tconnect(ui->openBtcWalletButton, SIGNAL(clicked()), this, SLOT(openBTCWallet()));\n\n#ifdef USE_QRCODE\n\tQString message = \"Payment for offer ID \" + this->offer + \" on Syscoin Decentralized Marketplace.\";\n\tSendCoinsRecipient info;\n\tinfo.address = this->address;\n\tinfo.label = this->sellerAlias;\n\tinfo.message = message;\n\tParseMoney(price.toStdString(), info.amount);\n\tQString uri = GUIUtil::formatBitcoinURI(info);\n\n\tui->lblQRCode->setText(\"\");\n    if(!uri.isEmpty())\n    {\n        \/\/ limit URI length\n        if (uri.length() > MAX_URI_LENGTH)\n        {\n            ui->lblQRCode->setText(tr(\"Resulting URI too long, try to reduce the text for label \/ message.\"));\n        } else {\n            QRcode *code = QRcode_encodeString(uri.toUtf8().constData(), 0, QR_ECLEVEL_L, QR_MODE_8, 1);\n            if (!code)\n            {\n                ui->lblQRCode->setText(tr(\"Error encoding URI into QR Code.\"));\n                return;\n            }\n            QImage myImage = QImage(code->width + 8, code->width + 8, QImage::Format_RGB32);\n            myImage.fill(0xffffff);\n            unsigned char *p = code->data;\n            for (int y = 0; y < code->width; y++)\n            {\n                for (int x = 0; x < code->width; x++)\n                {\n                    myImage.setPixel(x + 4, y + 4, ((*p & 1) ? 0x0 : 0xffffff));\n                    p++;\n                }\n            }\n            QRcode_free(code);\n            ui->lblQRCode->setPixmap(QPixmap::fromImage(myImage).scaled(128, 128));\n        }\n    }\n#endif\n}\nvoid OfferAcceptDialogBTC::on_cancelButton_clicked()\n{\n    reject();\n}\nOfferAcceptDialogBTC::~OfferAcceptDialogBTC()\n{\n    delete ui;\n}\n\nvoid OfferAcceptDialogBTC::slotConfirmedFinished(QNetworkReply * reply){\n\tif(reply->error() != QNetworkReply::NoError) {\n\t\tui->confirmButton->setText(m_buttonText);\n\t\tui->confirmButton->setEnabled(true);\n        QMessageBox::critical(this, windowTitle(),\n            tr(\"Error making request: \") + reply->errorString(),\n                QMessageBox::Ok, QMessageBox::Ok);\n\t\treturn;\n\t}\n\tdouble valueAmount = 0;\n\tQString time;\n\t\t\n\tQByteArray bytes = reply->readAll();\n\tQString str = QString::fromUtf8(bytes.data(), bytes.size());\n\tUniValue outerValue;\n\tbool read = outerValue.read(str.toStdString());\n\tif (read)\n\t{\n\t\tUniValue outerObj = outerValue.get_obj();\n\t\tUniValue statusValue = find_value(outerObj, \"status\");\n\t\tif (statusValue.isStr())\n\t\t{\n\t\t\tif(statusValue.get_str() != \"success\")\n\t\t\t{\n\t\t\t\tui->confirmButton->setText(m_buttonText);\n\t\t\t\tui->confirmButton->setEnabled(true);\n\t\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\t\ttr(\"Transaction status not successful: \") + QString::fromStdString(statusValue.get_str()),\n\t\t\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tUniValue dataObj = find_value(outerObj, \"data\");\n\t\tUniValue timeValue = find_value(dataObj, \"time_utc\");\n\t\tif (timeValue.isStr())\n\t\t\ttime = QString::fromStdString(timeValue.get_str());\n\t\tUniValue outputsValue = find_value(dataObj, \"vouts\");\n\t\tif (outputsValue.isArray())\n\t\t{\n\t\t\tUniValue outputs = outputsValue.get_array();\n\t\t\tfor (unsigned int idx = 0; idx < outputs.size(); idx++) {\n\t\t\t\tconst UniValue& output = outputs[idx];\t\n\t\t\t\tUniValue addressValue = find_value(output, \"address\");\n\t\t\t\tif(addressValue.isStr())\n\t\t\t\t{\n\t\t\t\t\tif(addressValue.get_str() == address.toStdString())\n\t\t\t\t\t{\n\t\t\t\t\t\tUniValue paymentValue = find_value(output, \"amount\");\n\t\t\t\t\t\tif(paymentValue.isStr())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tvalueAmount += QString::fromStdString(paymentValue.get_str()).toDouble();\n\t\n\t\t\t\t\t\t\tif(valueAmount >= dblPrice)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tui->confirmButton->setText(m_buttonText);\n\t\t\t\t\t\t\t\tui->confirmButton->setEnabled(true);\n\t\t\t\t\t\t\t\tQMessageBox::information(this, windowTitle(),\n\t\t\t\t\t\t\t\t\ttr(\"Transaction ID %1 was found in the Bitcoin blockchain! Full payment has been detected at %3.\").arg(ui->btctxidEdit->text().trimmed()).arg(height).arg(time),\n\t\t\t\t\t\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\t\t\t\t\t\tacceptOffer();\n\t\t\t\t\t\t\t\treturn;\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\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tui->confirmButton->setText(m_buttonText);\n\t\tui->confirmButton->setEnabled(true);\n\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"Cannot parse JSON response: \") + str,\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\treturn;\n\t}\n\t\n\treply->deleteLater();\n\tui->confirmButton->setText(m_buttonText);\n\tui->confirmButton->setEnabled(true);\n\tQMessageBox::warning(this, windowTitle(),\n\t\ttr(\"Payment not found in the Bitcoin blockchain! Please try again later.\"),\n\t\t\tQMessageBox::Ok, QMessageBox::Ok);\t\n}\nvoid OfferAcceptDialogBTC::CheckPaymentInBTC()\n{\n\tm_buttonText = ui->confirmButton->text();\n\tui->confirmButton->setText(tr(\"Please Wait...\"));\n\tui->confirmButton->setEnabled(false);\n\tQNetworkAccessManager *nam = new QNetworkAccessManager(this); \n\tconnect(nam, SIGNAL(finished(QNetworkReply *)), this, SLOT(slotConfirmedFinished(QNetworkReply *)));\n\tQUrl url(\"http:\/\/btc.blockr.io\/api\/v1\/tx\/info\/\" + ui->btctxidEdit->text().trimmed());\n\tQNetworkRequest request(url);\n\tnam->get(request);\n}\n\/\/ send offeraccept with offer guid\/qty as params and then send offerpay with wtxid (first param of response) as param, using RPC commands.\nvoid OfferAcceptDialogBTC::tryAcceptOffer()\n{\n\tif (ui->btctxidEdit->text().trimmed().isEmpty()) {\n        ui->btctxidEdit->setText(\"\");\n        QMessageBox::critical(this, windowTitle(),\n        tr(\"Please enter a valid Bitcoin Transaction ID into the input box and try again\"),\n            QMessageBox::Ok, QMessageBox::Ok);\n        return;\n    }\n\tCheckPaymentInBTC();\t\t\n}\nvoid OfferAcceptDialogBTC::acceptOffer(){\n\t\tUniValue params(UniValue::VARR);\n\t\tUniValue valError;\n\t\tUniValue valResult;\n\t\tUniValue valId;\n\t\tUniValue result ;\n\t\tstring strReply;\n\t\tstring strError;\n\n\t\tstring strMethod = string(\"offeraccept\");\n\t\tif(this->quantity.toLong() <= 0)\n\t\t{\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\ttr(\"Invalid quantity when trying to accept offer!\"),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\tthis->offerPaid = false;\n\t\tparams.push_back(this->alias.toStdString());\n\t\tparams.push_back(this->offer.toStdString());\n\t\tparams.push_back(this->quantity.toStdString());\n\t\tparams.push_back(this->notes.toStdString());\n\t\tparams.push_back(ui->btctxidEdit->text().trimmed().toStdString());\n\n\t    try {\n            result = tableRPC.execute(strMethod, params);\n\t\t\tif (result.type() != UniValue::VNULL)\n\t\t\t{\n\t\t\t\tconst UniValue &arr = result.get_array();\n\t\t\t\tstring strResult = arr[0].get_str();\n\t\t\t\tQString offerAcceptTXID = QString::fromStdString(strResult);\n\t\t\t\tif(offerAcceptTXID != QString(\"\"))\n\t\t\t\t{\n\t\t\t\t\tOfferPayDialog dlg(platformStyle, this->title, this->quantity, this->price, \"BTC\", this);\n\t\t\t\t\tdlg.exec();\n\t\t\t\t\tthis->offerPaid = true;\n\t\t\t\t\tOfferAcceptDialogBTC::accept();\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (UniValue& objError)\n\t\t{\n\t\t\tstrError = find_value(objError, \"message\").get_str();\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"Error accepting offer: \\\"%1\\\"\").arg(QString::fromStdString(strError)),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\tcatch(std::exception& e)\n\t\t{\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\ttr(\"General exception when accepting offer\"),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n}\nvoid OfferAcceptDialogBTC::openBTCWallet()\n{\n\tQString message = \"Payment for offer ID \" + this->offer + \" on Syscoin Decentralized Marketplace.\";\n\tSendCoinsRecipient info;\n\tinfo.address = this->address;\n\tinfo.label = this->sellerAlias;\n\tinfo.message = message;\n\tParseMoney(price.toStdString(), info.amount);\n\tQString uri = GUIUtil::formatBitcoinURI(info);\n\tQDesktopServices::openUrl(QUrl(uri, QUrl::TolerantMode));\n}\nbool OfferAcceptDialogBTC::getPaymentStatus()\n{\n\treturn this->offerPaid;\n}\n<commit_msg>typo<commit_after>#include \"offeracceptdialogbtc.h\"\n#include \"ui_offeracceptdialogbtc.h\"\n#include \"init.h\"\n#include \"util.h\"\n#include \"offerpaydialog.h\"\n#include \"guiconstants.h\"\n#include \"guiutil.h\"\n#include \"platformstyle.h\"\n#include \"syscoingui.h\"\n#include <QMessageBox>\n#include \"rpcserver.h\"\n#include \"pubkey.h\"\n#include \"wallet\/wallet.h\"\n#include \"main.h\"\n#include \"utilmoneystr.h\"\n#include <QDesktopServices>\n#if QT_VERSION < 0x050000\n#include <QUrl>\n#else\n#include <QUrlQuery>\n#endif\n#include <QPixmap>\n#if defined(HAVE_CONFIG_H)\n#include \"config\/syscoin-config.h\" \/* for USE_QRCODE *\/\n#endif\n#ifdef USE_QRCODE\n#include <qrencode.h>\n#endif\nusing namespace std;\n#include <QNetworkAccessManager>\n#include <QNetworkRequest>\n#include <QNetworkReply>\nextern const CRPCTable tableRPC;\nOfferAcceptDialogBTC::OfferAcceptDialogBTC(const PlatformStyle *platformStyle, QString alias, QString offer, QString quantity, QString notes, QString title, QString currencyCode, QString qstrPrice, QString sellerAlias, QString address, QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::OfferAcceptDialogBTC), platformStyle(platformStyle), alias(alias), offer(offer), notes(notes), quantity(quantity), title(title), sellerAlias(sellerAlias), address(address)\n{\n    ui->setupUi(this);\n\tQString theme = GUIUtil::getThemeName();  \n\tui->aboutShadeBTC->setPixmap(QPixmap(\":\/images\/\" + theme + \"\/about_btc\"));\n\tdblPrice = qstrPrice.toDouble()*quantity.toUInt();\n\tstring strfPrice = strprintf(\"%f\", dblPrice);\n\tQString fprice = QString::fromStdString(strfPrice);\n\tstring strCurrencyCode = currencyCode.toStdString();\n\tui->escrowDisclaimer->setText(tr(\"<font color='blue'>Please note escrow is not available since you are paying in BTC, only SYS payments can be escrowed. <\/font>\"));\n\tui->bitcoinInstructionLabel->setText(tr(\"After paying for this item, please enter the Bitcoin Transaction ID and click on the confirm button below. You may use the QR Code to the left to scan the payment request into your wallet or click on the Open BTC Wallet if you are on the desktop and have Bitcoin Core installed.\"));\n\tui->acceptMessage->setText(tr(\"Are you sure you want to purchase %1 of '%2' from merchant: '%3'? To complete your purchase please pay %4 BTC to %5 using your Bitcoin wallet.\").arg(quantity).arg(title).arg(sellerAlias).arg(fprice).arg(address));\n\tstring strPrice = strprintf(\"%f\", dblPrice);\n\tprice = QString::fromStdString(strPrice);\n\n\tif (!platformStyle->getImagesOnButtons())\n\t{\n\t\tui->confirmButton->setIcon(QIcon());\n\t\tui->openBtcWalletButton->setIcon(QIcon());\n\t\tui->cancelButton->setIcon(QIcon());\n\n\t}\n\telse\n\t{\n\t\tui->confirmButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/transaction_confirmed\"));\n\t\tui->openBtcWalletButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/send\"));\n\t\tui->cancelButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/quit\"));\n\t}\t\n\tthis->offerPaid = false;\n\tconnect(ui->confirmButton, SIGNAL(clicked()), this, SLOT(tryAcceptOffer()));\n\tconnect(ui->openBtcWalletButton, SIGNAL(clicked()), this, SLOT(openBTCWallet()));\n\n#ifdef USE_QRCODE\n\tQString message = \"Payment for offer ID \" + this->offer + \" on Syscoin Decentralized Marketplace.\";\n\tSendCoinsRecipient info;\n\tinfo.address = this->address;\n\tinfo.label = this->sellerAlias;\n\tinfo.message = message;\n\tParseMoney(price.toStdString(), info.amount);\n\tQString uri = GUIUtil::formatBitcoinURI(info);\n\n\tui->lblQRCode->setText(\"\");\n    if(!uri.isEmpty())\n    {\n        \/\/ limit URI length\n        if (uri.length() > MAX_URI_LENGTH)\n        {\n            ui->lblQRCode->setText(tr(\"Resulting URI too long, try to reduce the text for label \/ message.\"));\n        } else {\n            QRcode *code = QRcode_encodeString(uri.toUtf8().constData(), 0, QR_ECLEVEL_L, QR_MODE_8, 1);\n            if (!code)\n            {\n                ui->lblQRCode->setText(tr(\"Error encoding URI into QR Code.\"));\n                return;\n            }\n            QImage myImage = QImage(code->width + 8, code->width + 8, QImage::Format_RGB32);\n            myImage.fill(0xffffff);\n            unsigned char *p = code->data;\n            for (int y = 0; y < code->width; y++)\n            {\n                for (int x = 0; x < code->width; x++)\n                {\n                    myImage.setPixel(x + 4, y + 4, ((*p & 1) ? 0x0 : 0xffffff));\n                    p++;\n                }\n            }\n            QRcode_free(code);\n            ui->lblQRCode->setPixmap(QPixmap::fromImage(myImage).scaled(128, 128));\n        }\n    }\n#endif\n}\nvoid OfferAcceptDialogBTC::on_cancelButton_clicked()\n{\n    reject();\n}\nOfferAcceptDialogBTC::~OfferAcceptDialogBTC()\n{\n    delete ui;\n}\n\nvoid OfferAcceptDialogBTC::slotConfirmedFinished(QNetworkReply * reply){\n\tif(reply->error() != QNetworkReply::NoError) {\n\t\tui->confirmButton->setText(m_buttonText);\n\t\tui->confirmButton->setEnabled(true);\n        QMessageBox::critical(this, windowTitle(),\n            tr(\"Error making request: \") + reply->errorString(),\n                QMessageBox::Ok, QMessageBox::Ok);\n\t\treturn;\n\t}\n\tdouble valueAmount = 0;\n\tQString time;\n\t\t\n\tQByteArray bytes = reply->readAll();\n\tQString str = QString::fromUtf8(bytes.data(), bytes.size());\n\tUniValue outerValue;\n\tbool read = outerValue.read(str.toStdString());\n\tif (read)\n\t{\n\t\tUniValue outerObj = outerValue.get_obj();\n\t\tUniValue statusValue = find_value(outerObj, \"status\");\n\t\tif (statusValue.isStr())\n\t\t{\n\t\t\tif(statusValue.get_str() != \"success\")\n\t\t\t{\n\t\t\t\tui->confirmButton->setText(m_buttonText);\n\t\t\t\tui->confirmButton->setEnabled(true);\n\t\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\t\ttr(\"Transaction status not successful: \") + QString::fromStdString(statusValue.get_str()),\n\t\t\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tUniValue dataObj = find_value(outerObj, \"data\");\n\t\tUniValue timeValue = find_value(dataObj, \"time_utc\");\n\t\tif (timeValue.isStr())\n\t\t\ttime = QString::fromStdString(timeValue.get_str());\n\t\tUniValue outputsValue = find_value(dataObj, \"vouts\");\n\t\tif (outputsValue.isArray())\n\t\t{\n\t\t\tUniValue outputs = outputsValue.get_array();\n\t\t\tfor (unsigned int idx = 0; idx < outputs.size(); idx++) {\n\t\t\t\tconst UniValue& output = outputs[idx];\t\n\t\t\t\tUniValue addressValue = find_value(output, \"address\");\n\t\t\t\tif(addressValue.isStr())\n\t\t\t\t{\n\t\t\t\t\tif(addressValue.get_str() == address.toStdString())\n\t\t\t\t\t{\n\t\t\t\t\t\tUniValue paymentValue = find_value(output, \"amount\");\n\t\t\t\t\t\tif(paymentValue.isStr())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tvalueAmount += QString::fromStdString(paymentValue.get_str()).toDouble();\n\t\n\t\t\t\t\t\t\tif(valueAmount >= dblPrice)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tui->confirmButton->setText(m_buttonText);\n\t\t\t\t\t\t\t\tui->confirmButton->setEnabled(true);\n\t\t\t\t\t\t\t\tQMessageBox::information(this, windowTitle(),\n\t\t\t\t\t\t\t\t\ttr(\"Transaction ID %1 was found in the Bitcoin blockchain! Full payment has been detected at %2.\").arg(ui->btctxidEdit->text().trimmed()).arg(time),\n\t\t\t\t\t\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\t\t\t\t\t\tacceptOffer();\n\t\t\t\t\t\t\t\treturn;\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\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tui->confirmButton->setText(m_buttonText);\n\t\tui->confirmButton->setEnabled(true);\n\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"Cannot parse JSON response: \") + str,\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\treturn;\n\t}\n\t\n\treply->deleteLater();\n\tui->confirmButton->setText(m_buttonText);\n\tui->confirmButton->setEnabled(true);\n\tQMessageBox::warning(this, windowTitle(),\n\t\ttr(\"Payment not found in the Bitcoin blockchain! Please try again later.\"),\n\t\t\tQMessageBox::Ok, QMessageBox::Ok);\t\n}\nvoid OfferAcceptDialogBTC::CheckPaymentInBTC()\n{\n\tm_buttonText = ui->confirmButton->text();\n\tui->confirmButton->setText(tr(\"Please Wait...\"));\n\tui->confirmButton->setEnabled(false);\n\tQNetworkAccessManager *nam = new QNetworkAccessManager(this); \n\tconnect(nam, SIGNAL(finished(QNetworkReply *)), this, SLOT(slotConfirmedFinished(QNetworkReply *)));\n\tQUrl url(\"http:\/\/btc.blockr.io\/api\/v1\/tx\/info\/\" + ui->btctxidEdit->text().trimmed());\n\tQNetworkRequest request(url);\n\tnam->get(request);\n}\n\/\/ send offeraccept with offer guid\/qty as params and then send offerpay with wtxid (first param of response) as param, using RPC commands.\nvoid OfferAcceptDialogBTC::tryAcceptOffer()\n{\n\tif (ui->btctxidEdit->text().trimmed().isEmpty()) {\n        ui->btctxidEdit->setText(\"\");\n        QMessageBox::critical(this, windowTitle(),\n        tr(\"Please enter a valid Bitcoin Transaction ID into the input box and try again\"),\n            QMessageBox::Ok, QMessageBox::Ok);\n        return;\n    }\n\tCheckPaymentInBTC();\t\t\n}\nvoid OfferAcceptDialogBTC::acceptOffer(){\n\t\tUniValue params(UniValue::VARR);\n\t\tUniValue valError;\n\t\tUniValue valResult;\n\t\tUniValue valId;\n\t\tUniValue result ;\n\t\tstring strReply;\n\t\tstring strError;\n\n\t\tstring strMethod = string(\"offeraccept\");\n\t\tif(this->quantity.toLong() <= 0)\n\t\t{\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\ttr(\"Invalid quantity when trying to accept offer!\"),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\tthis->offerPaid = false;\n\t\tparams.push_back(this->alias.toStdString());\n\t\tparams.push_back(this->offer.toStdString());\n\t\tparams.push_back(this->quantity.toStdString());\n\t\tparams.push_back(this->notes.toStdString());\n\t\tparams.push_back(ui->btctxidEdit->text().trimmed().toStdString());\n\n\t    try {\n            result = tableRPC.execute(strMethod, params);\n\t\t\tif (result.type() != UniValue::VNULL)\n\t\t\t{\n\t\t\t\tconst UniValue &arr = result.get_array();\n\t\t\t\tstring strResult = arr[0].get_str();\n\t\t\t\tQString offerAcceptTXID = QString::fromStdString(strResult);\n\t\t\t\tif(offerAcceptTXID != QString(\"\"))\n\t\t\t\t{\n\t\t\t\t\tOfferPayDialog dlg(platformStyle, this->title, this->quantity, this->price, \"BTC\", this);\n\t\t\t\t\tdlg.exec();\n\t\t\t\t\tthis->offerPaid = true;\n\t\t\t\t\tOfferAcceptDialogBTC::accept();\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (UniValue& objError)\n\t\t{\n\t\t\tstrError = find_value(objError, \"message\").get_str();\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"Error accepting offer: \\\"%1\\\"\").arg(QString::fromStdString(strError)),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\tcatch(std::exception& e)\n\t\t{\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\ttr(\"General exception when accepting offer\"),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n}\nvoid OfferAcceptDialogBTC::openBTCWallet()\n{\n\tQString message = \"Payment for offer ID \" + this->offer + \" on Syscoin Decentralized Marketplace.\";\n\tSendCoinsRecipient info;\n\tinfo.address = this->address;\n\tinfo.label = this->sellerAlias;\n\tinfo.message = message;\n\tParseMoney(price.toStdString(), info.amount);\n\tQString uri = GUIUtil::formatBitcoinURI(info);\n\tQDesktopServices::openUrl(QUrl(uri, QUrl::TolerantMode));\n}\nbool OfferAcceptDialogBTC::getPaymentStatus()\n{\n\treturn this->offerPaid;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"offeracceptdialogbtc.h\"\n#include \"ui_offeracceptdialogbtc.h\"\n#include \"init.h\"\n#include \"util.h\"\n#include \"offerpaydialog.h\"\n#include \"guiconstants.h\"\n#include \"guiutil.h\"\n#include \"platformstyle.h\"\n#include \"syscoingui.h\"\n#include <QMessageBox>\n#include \"rpcserver.h\"\n#include \"pubkey.h\"\n#include \"wallet\/wallet.h\"\n#include \"main.h\"\n#include \"utilmoneystr.h\"\n#include <QDesktopServices>\n#if QT_VERSION < 0x050000\n#include <QUrl>\n#else\n#include <QUrlQuery>\n#endif\n#include <QPixmap>\n#if defined(HAVE_CONFIG_H)\n#include \"config\/syscoin-config.h\" \/* for USE_QRCODE *\/\n#endif\n\n#ifdef USE_QRCODE\n#include <qrencode.h>\n#endif\nusing namespace std;\n#include <QNetworkAccessManager>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n\nextern const CRPCTable tableRPC;\nOfferAcceptDialogBTC::OfferAcceptDialogBTC(const PlatformStyle *platformStyle, QString alias, QString offer, QString quantity, QString notes, QString title, QString currencyCode, QString qstrPrice, QString sellerAlias, QString address, QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::OfferAcceptDialogBTC), platformStyle(platformStyle), alias(alias), offer(offer), notes(notes), quantity(quantity), title(title), sellerAlias(sellerAlias), address(address)\n{\n    ui->setupUi(this);\n\tQString theme = GUIUtil::getThemeName();  \n\tui->aboutShadeBTC->setPixmap(QPixmap(\":\/images\/\" + theme + \"\/about_btc\"));\n\tdouble dblPrice = qstrPrice.toDouble()*quantity.toUInt();\n\tstring strfPrice = strprintf(\"%f\", dblPrice);\n\tQString fprice = QString::fromStdString(strfPrice);\n\tstring strCurrencyCode = currencyCode.toStdString();\n\tui->escrowDisclaimer->setText(tr(\"<font color='blue'>Please note escrow is not available since you are paying in BTC, only SYS payments can be escrowed. <\/font>\"));\n\tui->bitcoinInstructionLabel->setText(tr(\"After paying for this item, please enter the Bitcoin Transaction ID and click on the confirm button below. You may use the QR Code to the left to scan the payment request into your wallet or click on the Open BTC Wallet if you are on the desktop and have Bitcoin Core installed.\"));\n\tui->acceptMessage->setText(tr(\"Are you sure you want to purchase %1 of '%2' from merchant: '%3'? To complete your purchase please pay %4 BTC using your Bitcoin wallet.\").arg(quantity).arg(title).arg(sellerAlias).arg(fprice));\n\tstring strPrice = strprintf(\"%f\", dblPrice);\n\tprice = QString::fromStdString(strPrice);\n\n\tif (!platformStyle->getImagesOnButtons())\n\t{\n\t\tui->confirmButton->setIcon(QIcon());\n\t\tui->openBtcWalletButton->setIcon(QIcon());\n\t\tui->cancelButton->setIcon(QIcon());\n\n\t}\n\telse\n\t{\n\t\tui->confirmButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/transaction_confirmed\"));\n\t\tui->openBtcWalletButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/send\"));\n\t\tui->cancelButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/quit\"));\n\t}\t\n\tthis->offerPaid = false;\n\tconnect(ui->confirmButton, SIGNAL(clicked()), this, SLOT(acceptPayment()));\n\tconnect(ui->openBtcWalletButton, SIGNAL(clicked()), this, SLOT(openBTCWallet()));\n\n#ifdef USE_QRCODE\n\tQString message = \"Payment for offer ID \" + this->offer + \" on Syscoin Decentralized Marketplace\";\n\tQString uri = \"bitcoin:\" + this->address + \"?amount=\" + price + \"&label=\" + this->sellerAlias + \"&message=\" + GUIUtil::HtmlEscape(message);\n\t\n\tui->lblQRCode->setText(\"\");\n    if(!uri.isEmpty())\n    {\n        \/\/ limit URI length\n        if (uri.length() > MAX_URI_LENGTH)\n        {\n            ui->lblQRCode->setText(tr(\"Resulting URI too long, try to reduce the text for label \/ message.\"));\n        } else {\n            QRcode *code = QRcode_encodeString(uri.toUtf8().constData(), 0, QR_ECLEVEL_L, QR_MODE_8, 1);\n            if (!code)\n            {\n                ui->lblQRCode->setText(tr(\"Error encoding URI into QR Code.\"));\n                return;\n            }\n            QImage myImage = QImage(code->width + 8, code->width + 8, QImage::Format_RGB32);\n            myImage.fill(0xffffff);\n            unsigned char *p = code->data;\n            for (int y = 0; y < code->width; y++)\n            {\n                for (int x = 0; x < code->width; x++)\n                {\n                    myImage.setPixel(x + 4, y + 4, ((*p & 1) ? 0x0 : 0xffffff));\n                    p++;\n                }\n            }\n            QRcode_free(code);\n            ui->lblQRCode->setPixmap(QPixmap::fromImage(myImage).scaled(128, 128));\n        }\n    }\n#endif\n}\nvoid OfferAcceptDialogBTC::on_cancelButton_clicked()\n{\n    reject();\n}\nOfferAcceptDialogBTC::~OfferAcceptDialogBTC()\n{\n    delete ui;\n}\n\nvoid OfferAcceptDialogBTC::acceptPayment()\n{\n\tacceptOffer();\n}\nbool OfferAcceptDialogBTC::CheckPaymentInBTC(const QString &strBTCTxId, const QString& address, const QString& price, int& height, long& time)\n{\n\tQNetworkAccessManager *nam = new QNetworkAccessManager(this);\n\tQUrl url(\"https:\/\/blockchain.info\/tx\/\" + strBTCTxId + \"?format=json\");\n\tQNetworkRequest request(url);\n\trequest.setHeader(QNetworkRequest::ContentTypeHeader, \"application\/json\");\n\tQNetworkReply* reply = nam->get(request);\n\treply->ignoreSslErrors();\n\tCAmount valueAmount = 0;\n\tCAmount priceAmount = 0;\n\tif(!ParseMoney(price.toStdString(), priceAmount))\n\t\treturn false;\n\tint totalTime = 0;\n\twhile(!reply->isFinished())\n\t{\n\t\tqApp->processEvents();\n\t\ttotalTime += 100;\n\t\tMilliSleep(100);\n\t\tif(totalTime > 30000)\n\t\t\tthrow runtime_error(\"Timeout connecting to blockchain.info!\");\n\t}\n\tbool doubleSpend = false;\n\tif(reply->error() == QNetworkReply::NoError) {\n\n\t\tUniValue outerValue;\n\t\tbool read = outerValue.read(reply->readAll().toStdString());\n\t\tif (read)\n\t\t{\n\t\t\tUniValue outerObj = outerValue.get_obj();\n\t\t\tUniValue heightValue = find_value(outerObj, \"block_height\");\n\t\t\tif (heightValue.isNum())\n\t\t\t\theight = heightValue.get_num();\n\t\t\tUniValue timeValue = find_value(outerObj, \"time\");\n\t\t\tif (timeValue.isNum())\n\t\t\t\ttime = timeValue.get_num();\n\n\t\t\tUniValue outerObj = outerValue.get_obj();\n\t\t\tUniValue doubleSpendValue = find_value(outerObj, \"double_spend\");\n\t\t\tif (doubleSpendValue.isBool())\n\t\t\t{\n\t\t\t\tdoubleSpend = doubleSpendValue.get_bool();\n\t\t\t\tif(doubleSpend)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\tUniValue outputsValue = find_value(outerObj, \"out\");\n\t\t\tif (outputsValue.isArray())\n\t\t\t{\n\t\t\t\tUniValue outputs = outputsValue.get_array();\n\t\t\t\tfor (unsigned int idx = 0; idx < outputs.size(); idx++) {\n\t\t\t\t\tconst UniValue& output = outputs[idx];\t\n\t\t\t\t\tUniValue addressValue = find_value(output, \"addr\");\n\t\t\t\t\tif(addressValue.isStr())\n\t\t\t\t\t{\n\t\t\t\t\t\tLogPrintf(\"address: %s\\n\", address.toStdString().c_str());\n\t\t\t\t\t\tif(addressValue.get_str() == address.toStdString())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tUniValue paymentValue = find_value(output, \"value\");\n\t\t\t\t\t\t\tLogPrintf(\"value: %lld\\n\", paymentValue.get_int64());\n\t\t\t\t\t\t\tif(paymentValue.isNum())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tvalueAmount += paymentValue.get_int64();\n\t\t\t\t\t\t\t\tif(valueAmount >= priceAmount)\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\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}\n\treply->deleteLater();\n\treturn false;\n\n\n}\n\nbool OfferAcceptDialogBTC::lookup(const QString &lookupid, QString& address, QString& price)\n{\n\tstring strError;\n\tstring strMethod = string(\"offerinfo\");\n\tUniValue params(UniValue::VARR);\n\tUniValue result;\n\tparams.push_back(lookupid.toStdString());\n\n    try {\n        result = tableRPC.execute(strMethod, params);\n\n\t\tif (result.type() == UniValue::VOBJ)\n\t\t{\n\t\t\tconst UniValue &offerObj = result.get_obj();\n\n\t\t\tconst string &strAddress = find_value(offerObj, \"address\").get_str();\n\t\t\tconst string &strPrice = find_value(offerObj, \"price\").get_str();\n\t\t\taddress = QString::fromStdString(strAddress);\n\t\t\tprice = QString::fromStdString(strPrice);\n\t\t\treturn true;\n\t\t}\n\t}\n\tcatch (UniValue& objError)\n\t{\n\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"Could not find this offer, please check the offer ID and that it has been confirmed by the blockchain: \") + lookupid,\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\treturn true;\n\n\t}\n\tcatch(std::exception& e)\n\t{\n\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"There was an exception trying to locate this offer, please check the offer ID and that it has been confirmed by the blockchain: \") + QString::fromStdString(e.what()),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\treturn true;\n\t}\n\treturn false;\n\n\n}\n\/\/ send offeraccept with offer guid\/qty as params and then send offerpay with wtxid (first param of response) as param, using RPC commands.\nvoid OfferAcceptDialogBTC::acceptOffer()\n{\n\t\tQString address, price;\n\t\tif (ui->btctxidEdit->text().trimmed().isEmpty()) {\n            ui->btctxidEdit->setText(\"\");\n            QMessageBox::information(this, windowTitle(),\n            tr(\"Please enter a valid Bitcoin Transaction ID into the input box and try again\"),\n                QMessageBox::Ok, QMessageBox::Ok);\n            return;\n        }\n\t\tif(!lookup(this->offer, address, price))\n\t\t{\n            QMessageBox::information(this, windowTitle(),\n            tr(\"Could not find this offer, please check the offer ID and that it has been confirmed by the blockchain: \") + this->offer,\n                QMessageBox::Ok, QMessageBox::Ok);\n            return;\n\t\t}\n\t\tint height;\n\t\tlong time;\n\t\tif(!CheckPaymentInBTC(ui->btctxidEdit->text().trimmed(), address, price, height, time))\n\t\t{\n            QMessageBox::information(this, windowTitle(),\n            tr(\"Could not find this payment, please check the Transaction ID and that it has been confirmed by the Bitcoin blockchain: \") + ui->btctxidEdit->text().trimmed(),\n                QMessageBox::Ok, QMessageBox::Ok);\n            return;\n\t\t}\n\n\t\tUniValue params(UniValue::VARR);\n\t\tUniValue valError;\n\t\tUniValue valResult;\n\t\tUniValue valId;\n\t\tUniValue result ;\n\t\tstring strReply;\n\t\tstring strError;\n\n\t\tstring strMethod = string(\"offeraccept\");\n\t\tif(this->quantity.toLong() <= 0)\n\t\t{\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\ttr(\"Invalid quantity when trying to accept offer!\"),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\tthis->offerPaid = false;\n\t\tparams.push_back(this->alias.toStdString());\n\t\tparams.push_back(this->offer.toStdString());\n\t\tparams.push_back(this->quantity.toStdString());\n\t\tparams.push_back(this->notes.toStdString());\n\t\tparams.push_back(ui->btctxidEdit->text().toStdString());\n\n\t    try {\n            result = tableRPC.execute(strMethod, params);\n\t\t\tif (result.type() != UniValue::VNULL)\n\t\t\t{\n\t\t\t\tconst UniValue &arr = result.get_array();\n\t\t\t\tstring strResult = arr[0].get_str();\n\t\t\t\tQString offerAcceptTXID = QString::fromStdString(strResult);\n\t\t\t\tif(offerAcceptTXID != QString(\"\"))\n\t\t\t\t{\n\t\t\t\t\tOfferPayDialog dlg(platformStyle, this->title, this->quantity, this->price, \"BTC\", this);\n\t\t\t\t\tdlg.exec();\n\t\t\t\t\tthis->offerPaid = true;\n\t\t\t\t\tOfferAcceptDialogBTC::accept();\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (UniValue& objError)\n\t\t{\n\t\t\tstrError = find_value(objError, \"message\").get_str();\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"Error accepting offer: \\\"%1\\\"\").arg(QString::fromStdString(strError)),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\tcatch(std::exception& e)\n\t\t{\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\ttr(\"General exception when accepting offer\"),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\n   \n\n}\nvoid OfferAcceptDialogBTC::openBTCWallet()\n{\n\tQString message = \"Payment for offer ID \" + this->offer + \" on Syscoin Decentralized Marketplace\";\n\tQString uri = \"bitcoin:\" + this->address + \"?amount=\" + price + \"&label=\" + this->sellerAlias + \"&message=\" + GUIUtil::HtmlEscape(message);\n\tQDesktopServices::openUrl(QUrl(uri, QUrl::TolerantMode));\n}\nbool OfferAcceptDialogBTC::getPaymentStatus()\n{\n\treturn this->offerPaid;\n}\n<commit_msg>fix compile<commit_after>#include \"offeracceptdialogbtc.h\"\n#include \"ui_offeracceptdialogbtc.h\"\n#include \"init.h\"\n#include \"util.h\"\n#include \"offerpaydialog.h\"\n#include \"guiconstants.h\"\n#include \"guiutil.h\"\n#include \"platformstyle.h\"\n#include \"syscoingui.h\"\n#include <QMessageBox>\n#include \"rpcserver.h\"\n#include \"pubkey.h\"\n#include \"wallet\/wallet.h\"\n#include \"main.h\"\n#include \"utilmoneystr.h\"\n#include <QDesktopServices>\n#if QT_VERSION < 0x050000\n#include <QUrl>\n#else\n#include <QUrlQuery>\n#endif\n#include <QPixmap>\n#if defined(HAVE_CONFIG_H)\n#include \"config\/syscoin-config.h\" \/* for USE_QRCODE *\/\n#endif\n\n#ifdef USE_QRCODE\n#include <qrencode.h>\n#endif\nusing namespace std;\n#include <QNetworkAccessManager>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n\nextern const CRPCTable tableRPC;\nOfferAcceptDialogBTC::OfferAcceptDialogBTC(const PlatformStyle *platformStyle, QString alias, QString offer, QString quantity, QString notes, QString title, QString currencyCode, QString qstrPrice, QString sellerAlias, QString address, QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::OfferAcceptDialogBTC), platformStyle(platformStyle), alias(alias), offer(offer), notes(notes), quantity(quantity), title(title), sellerAlias(sellerAlias), address(address)\n{\n    ui->setupUi(this);\n\tQString theme = GUIUtil::getThemeName();  \n\tui->aboutShadeBTC->setPixmap(QPixmap(\":\/images\/\" + theme + \"\/about_btc\"));\n\tdouble dblPrice = qstrPrice.toDouble()*quantity.toUInt();\n\tstring strfPrice = strprintf(\"%f\", dblPrice);\n\tQString fprice = QString::fromStdString(strfPrice);\n\tstring strCurrencyCode = currencyCode.toStdString();\n\tui->escrowDisclaimer->setText(tr(\"<font color='blue'>Please note escrow is not available since you are paying in BTC, only SYS payments can be escrowed. <\/font>\"));\n\tui->bitcoinInstructionLabel->setText(tr(\"After paying for this item, please enter the Bitcoin Transaction ID and click on the confirm button below. You may use the QR Code to the left to scan the payment request into your wallet or click on the Open BTC Wallet if you are on the desktop and have Bitcoin Core installed.\"));\n\tui->acceptMessage->setText(tr(\"Are you sure you want to purchase %1 of '%2' from merchant: '%3'? To complete your purchase please pay %4 BTC using your Bitcoin wallet.\").arg(quantity).arg(title).arg(sellerAlias).arg(fprice));\n\tstring strPrice = strprintf(\"%f\", dblPrice);\n\tprice = QString::fromStdString(strPrice);\n\n\tif (!platformStyle->getImagesOnButtons())\n\t{\n\t\tui->confirmButton->setIcon(QIcon());\n\t\tui->openBtcWalletButton->setIcon(QIcon());\n\t\tui->cancelButton->setIcon(QIcon());\n\n\t}\n\telse\n\t{\n\t\tui->confirmButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/transaction_confirmed\"));\n\t\tui->openBtcWalletButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/send\"));\n\t\tui->cancelButton->setIcon(platformStyle->SingleColorIcon(\":\/icons\/\" + theme + \"\/quit\"));\n\t}\t\n\tthis->offerPaid = false;\n\tconnect(ui->confirmButton, SIGNAL(clicked()), this, SLOT(acceptPayment()));\n\tconnect(ui->openBtcWalletButton, SIGNAL(clicked()), this, SLOT(openBTCWallet()));\n\n#ifdef USE_QRCODE\n\tQString message = \"Payment for offer ID \" + this->offer + \" on Syscoin Decentralized Marketplace\";\n\tQString uri = \"bitcoin:\" + this->address + \"?amount=\" + price + \"&label=\" + this->sellerAlias + \"&message=\" + GUIUtil::HtmlEscape(message);\n\t\n\tui->lblQRCode->setText(\"\");\n    if(!uri.isEmpty())\n    {\n        \/\/ limit URI length\n        if (uri.length() > MAX_URI_LENGTH)\n        {\n            ui->lblQRCode->setText(tr(\"Resulting URI too long, try to reduce the text for label \/ message.\"));\n        } else {\n            QRcode *code = QRcode_encodeString(uri.toUtf8().constData(), 0, QR_ECLEVEL_L, QR_MODE_8, 1);\n            if (!code)\n            {\n                ui->lblQRCode->setText(tr(\"Error encoding URI into QR Code.\"));\n                return;\n            }\n            QImage myImage = QImage(code->width + 8, code->width + 8, QImage::Format_RGB32);\n            myImage.fill(0xffffff);\n            unsigned char *p = code->data;\n            for (int y = 0; y < code->width; y++)\n            {\n                for (int x = 0; x < code->width; x++)\n                {\n                    myImage.setPixel(x + 4, y + 4, ((*p & 1) ? 0x0 : 0xffffff));\n                    p++;\n                }\n            }\n            QRcode_free(code);\n            ui->lblQRCode->setPixmap(QPixmap::fromImage(myImage).scaled(128, 128));\n        }\n    }\n#endif\n}\nvoid OfferAcceptDialogBTC::on_cancelButton_clicked()\n{\n    reject();\n}\nOfferAcceptDialogBTC::~OfferAcceptDialogBTC()\n{\n    delete ui;\n}\n\nvoid OfferAcceptDialogBTC::acceptPayment()\n{\n\tacceptOffer();\n}\nbool OfferAcceptDialogBTC::CheckPaymentInBTC(const QString &strBTCTxId, const QString& address, const QString& price, int& height, long& time)\n{\n\tQNetworkAccessManager *nam = new QNetworkAccessManager(this);\n\tQUrl url(\"https:\/\/blockchain.info\/tx\/\" + strBTCTxId + \"?format=json\");\n\tQNetworkRequest request(url);\n\trequest.setHeader(QNetworkRequest::ContentTypeHeader, \"application\/json\");\n\tQNetworkReply* reply = nam->get(request);\n\treply->ignoreSslErrors();\n\tCAmount valueAmount = 0;\n\tCAmount priceAmount = 0;\n\tif(!ParseMoney(price.toStdString(), priceAmount))\n\t\treturn false;\n\tint totalTime = 0;\n\twhile(!reply->isFinished())\n\t{\n\t\tqApp->processEvents();\n\t\ttotalTime += 100;\n\t\tMilliSleep(100);\n\t\tif(totalTime > 30000)\n\t\t\tthrow runtime_error(\"Timeout connecting to blockchain.info!\");\n\t}\n\tbool doubleSpend = false;\n\tif(reply->error() == QNetworkReply::NoError) {\n\n\t\tUniValue outerValue;\n\t\tbool read = outerValue.read(reply->readAll().toStdString());\n\t\tif (read)\n\t\t{\n\t\t\tUniValue outerObj = outerValue.get_obj();\n\t\t\tUniValue heightValue = find_value(outerObj, \"block_height\");\n\t\t\tif (heightValue.isNum())\n\t\t\t\theight = heightValue.get_int();\n\t\t\tUniValue timeValue = find_value(outerObj, \"time\");\n\t\t\tif (timeValue.isNum())\n\t\t\t\ttime = timeValue.get_int64();\n\t\t\tLogPrintf(\"height: %d time: %lld\\n\",height, time);\n\t\t\tUniValue doubleSpendValue = find_value(outerObj, \"double_spend\");\n\t\t\tif (doubleSpendValue.isBool())\n\t\t\t{\n\t\t\t\tdoubleSpend = doubleSpendValue.get_bool();\n\t\t\t\tif(doubleSpend)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\tUniValue outputsValue = find_value(outerObj, \"out\");\n\t\t\tif (outputsValue.isArray())\n\t\t\t{\n\t\t\t\tUniValue outputs = outputsValue.get_array();\n\t\t\t\tfor (unsigned int idx = 0; idx < outputs.size(); idx++) {\n\t\t\t\t\tconst UniValue& output = outputs[idx];\t\n\t\t\t\t\tUniValue addressValue = find_value(output, \"addr\");\n\t\t\t\t\tif(addressValue.isStr())\n\t\t\t\t\t{\n\t\t\t\t\t\tLogPrintf(\"address: %s\\n\", address.toStdString().c_str());\n\t\t\t\t\t\tif(addressValue.get_str() == address.toStdString())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tUniValue paymentValue = find_value(output, \"value\");\n\t\t\t\t\t\t\tLogPrintf(\"value: %lld\\n\", paymentValue.get_int64());\n\t\t\t\t\t\t\tif(paymentValue.isNum())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tvalueAmount += paymentValue.get_int64();\n\t\t\t\t\t\t\t\tif(valueAmount >= priceAmount)\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\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}\n\treply->deleteLater();\n\treturn false;\n\n\n}\n\nbool OfferAcceptDialogBTC::lookup(const QString &lookupid, QString& address, QString& price)\n{\n\tstring strError;\n\tstring strMethod = string(\"offerinfo\");\n\tUniValue params(UniValue::VARR);\n\tUniValue result;\n\tparams.push_back(lookupid.toStdString());\n\n    try {\n        result = tableRPC.execute(strMethod, params);\n\n\t\tif (result.type() == UniValue::VOBJ)\n\t\t{\n\t\t\tconst UniValue &offerObj = result.get_obj();\n\n\t\t\tconst string &strAddress = find_value(offerObj, \"address\").get_str();\n\t\t\tconst string &strPrice = find_value(offerObj, \"price\").get_str();\n\t\t\taddress = QString::fromStdString(strAddress);\n\t\t\tprice = QString::fromStdString(strPrice);\n\t\t\treturn true;\n\t\t}\n\t}\n\tcatch (UniValue& objError)\n\t{\n\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"Could not find this offer, please check the offer ID and that it has been confirmed by the blockchain: \") + lookupid,\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\treturn true;\n\n\t}\n\tcatch(std::exception& e)\n\t{\n\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"There was an exception trying to locate this offer, please check the offer ID and that it has been confirmed by the blockchain: \") + QString::fromStdString(e.what()),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\treturn true;\n\t}\n\treturn false;\n\n\n}\n\/\/ send offeraccept with offer guid\/qty as params and then send offerpay with wtxid (first param of response) as param, using RPC commands.\nvoid OfferAcceptDialogBTC::acceptOffer()\n{\n\t\tQString address, price;\n\t\tif (ui->btctxidEdit->text().trimmed().isEmpty()) {\n            ui->btctxidEdit->setText(\"\");\n            QMessageBox::information(this, windowTitle(),\n            tr(\"Please enter a valid Bitcoin Transaction ID into the input box and try again\"),\n                QMessageBox::Ok, QMessageBox::Ok);\n            return;\n        }\n\t\tif(!lookup(this->offer, address, price))\n\t\t{\n            QMessageBox::information(this, windowTitle(),\n            tr(\"Could not find this offer, please check the offer ID and that it has been confirmed by the blockchain: \") + this->offer,\n                QMessageBox::Ok, QMessageBox::Ok);\n            return;\n\t\t}\n\t\tint height;\n\t\tlong time;\n\t\tif(!CheckPaymentInBTC(ui->btctxidEdit->text().trimmed(), address, price, height, time))\n\t\t{\n            QMessageBox::information(this, windowTitle(),\n            tr(\"Could not find this payment, please check the Transaction ID and that it has been confirmed by the Bitcoin blockchain: \") + ui->btctxidEdit->text().trimmed(),\n                QMessageBox::Ok, QMessageBox::Ok);\n            return;\n\t\t}\n\n\t\tUniValue params(UniValue::VARR);\n\t\tUniValue valError;\n\t\tUniValue valResult;\n\t\tUniValue valId;\n\t\tUniValue result ;\n\t\tstring strReply;\n\t\tstring strError;\n\n\t\tstring strMethod = string(\"offeraccept\");\n\t\tif(this->quantity.toLong() <= 0)\n\t\t{\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\ttr(\"Invalid quantity when trying to accept offer!\"),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\tthis->offerPaid = false;\n\t\tparams.push_back(this->alias.toStdString());\n\t\tparams.push_back(this->offer.toStdString());\n\t\tparams.push_back(this->quantity.toStdString());\n\t\tparams.push_back(this->notes.toStdString());\n\t\tparams.push_back(ui->btctxidEdit->text().toStdString());\n\n\t    try {\n            result = tableRPC.execute(strMethod, params);\n\t\t\tif (result.type() != UniValue::VNULL)\n\t\t\t{\n\t\t\t\tconst UniValue &arr = result.get_array();\n\t\t\t\tstring strResult = arr[0].get_str();\n\t\t\t\tQString offerAcceptTXID = QString::fromStdString(strResult);\n\t\t\t\tif(offerAcceptTXID != QString(\"\"))\n\t\t\t\t{\n\t\t\t\t\tOfferPayDialog dlg(platformStyle, this->title, this->quantity, this->price, \"BTC\", this);\n\t\t\t\t\tdlg.exec();\n\t\t\t\t\tthis->offerPaid = true;\n\t\t\t\t\tOfferAcceptDialogBTC::accept();\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (UniValue& objError)\n\t\t{\n\t\t\tstrError = find_value(objError, \"message\").get_str();\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\ttr(\"Error accepting offer: \\\"%1\\\"\").arg(QString::fromStdString(strError)),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\tcatch(std::exception& e)\n\t\t{\n\t\t\tQMessageBox::critical(this, windowTitle(),\n\t\t\t\ttr(\"General exception when accepting offer\"),\n\t\t\t\tQMessageBox::Ok, QMessageBox::Ok);\n\t\t\treturn;\n\t\t}\n\t\n   \n\n}\nvoid OfferAcceptDialogBTC::openBTCWallet()\n{\n\tQString message = \"Payment for offer ID \" + this->offer + \" on Syscoin Decentralized Marketplace\";\n\tQString uri = \"bitcoin:\" + this->address + \"?amount=\" + price + \"&label=\" + this->sellerAlias + \"&message=\" + GUIUtil::HtmlEscape(message);\n\tQDesktopServices::openUrl(QUrl(uri, QUrl::TolerantMode));\n}\nbool OfferAcceptDialogBTC::getPaymentStatus()\n{\n\treturn this->offerPaid;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef RDB_PROTOCOL_EXCEPTIONS_HPP_\n#define RDB_PROTOCOL_EXCEPTIONS_HPP_\n\n#include <string>\n\n#include \"rdb_protocol\/backtrace.hpp\"\n\nnamespace query_language {\n\n\/* Thrown if the client sends a malformed or nonsensical query (e.g. a\n   protocol buffer that doesn't match our schema or STOP for an\n   unknown token). *\/\nclass meaningless_query_exc_t : public std::exception {\npublic:\n    meaningless_query_exc_t(const std::string &_what) : message(_what) { }\n    ~meaningless_query_exc_t() throw () { }\n\n    const char *what() const throw () {\n        return message.c_str();\n    }\n\n    std::string message;\n};\n\n\/* `bad_query_exc_t` is thrown if the user writes a query that accesses\nundefined variables or that has mismatched types. The difference between this\nand `bad_protobuf_exc_t` is that `bad_protobuf_exc_t` is the client's fault and\n`bad_query_exc_t` is the client's user's fault. *\/\n\nclass bad_query_exc_t : public std::exception {\npublic:\n    bad_query_exc_t(const std::string &s, const backtrace_t &bt) : message(s), backtrace(bt) { }\n\n    ~bad_query_exc_t() throw () { }\n\n    const char *what() const throw () {\n        return message.c_str();\n    }\n\n    std::string message;\n    backtrace_t backtrace;\n};\n\nclass runtime_exc_t {\npublic:\n    runtime_exc_t(const std::string &_what, const backtrace_t &bt)\n        : message(_what), backtrace(bt)\n    { }\n\n    std::string what() const throw() {\n        return message;\n    }\n\n    std::string message;\n    backtrace_t backtrace;\n};\n\n\n}\/\/ namespace query_language \n#endif\n<commit_msg>Fixed comments.<commit_after>#ifndef RDB_PROTOCOL_EXCEPTIONS_HPP_\n#define RDB_PROTOCOL_EXCEPTIONS_HPP_\n\n#include <string>\n\n#include \"rdb_protocol\/backtrace.hpp\"\n\nnamespace query_language {\n\n\/* Thrown if the client sends a malformed or nonsensical query (e.g. a\n   protocol buffer that doesn't match our schema or STOP for an\n   unknown token). *\/\nclass meaningless_query_exc_t : public std::exception {\npublic:\n    meaningless_query_exc_t(const std::string &_what) : message(_what) { }\n    ~meaningless_query_exc_t() throw () { }\n\n    const char *what() const throw () {\n        return message.c_str();\n    }\n\n    std::string message;\n};\n\n\/* `bad_query_exc_t` is thrown if the user writes a query that\n   accesses undefined variables or that has mismatched types. The\n   difference between this and `meaningless_query_exc_t` is that\n   `meaningless_query_exc_t` is the client's fault and\n   `bad_query_exc_t` is the client's user's fault. *\/\n\nclass bad_query_exc_t : public std::exception {\npublic:\n    bad_query_exc_t(const std::string &s, const backtrace_t &bt) : message(s), backtrace(bt) { }\n\n    ~bad_query_exc_t() throw () { }\n\n    const char *what() const throw () {\n        return message.c_str();\n    }\n\n    std::string message;\n    backtrace_t backtrace;\n};\n\nclass runtime_exc_t {\npublic:\n    runtime_exc_t(const std::string &_what, const backtrace_t &bt)\n        : message(_what), backtrace(bt)\n    { }\n\n    std::string what() const throw() {\n        return message;\n    }\n\n    std::string message;\n    backtrace_t backtrace;\n};\n\n\n}\/\/ namespace query_language \n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <StdAfx.h>\n#include <UI\/Controls\/FakeSplitter.h>\n#include <UI\/UIFunctions.h>\n#include <UI\/DoubleBuffer.h>\n#include <core\/utility\/output.h>\n\nnamespace controls\n{\n\tstatic std::wstring CLASS = L\"CFakeSplitter\";\n\n\tenum FakesSplitHitTestValue\n\t{\n\t\tnoHit = 0,\n\t\tSplitterHit = 1\n\t};\n\n\tCFakeSplitter::~CFakeSplitter()\n\t{\n\t\tTRACE_DESTRUCTOR(CLASS);\n\t\tstatic_cast<void>(DestroyCursor(m_hSplitCursorH));\n\t\tstatic_cast<void>(DestroyCursor(m_hSplitCursorV));\n\t\tCWnd::DestroyWindow();\n\t}\n\n\tvoid CFakeSplitter::Init(HWND hWnd)\n\t{\n\t\tm_hwndParent = hWnd;\n\t\tWNDCLASSEX wc = {};\n\t\tconst auto hInst = AfxGetInstanceHandle();\n\t\tif (!::GetClassInfoEx(hInst, _T(\"FakeSplitter\"), &wc)) \/\/ STRING_OK\n\t\t{\n\t\t\twc.cbSize = sizeof wc;\n\t\t\twc.style = 0; \/\/ not passing CS_VREDRAW | CS_HREDRAW fixes flicker\n\t\t\twc.lpszClassName = _T(\"FakeSplitter\"); \/\/ STRING_OK\n\t\t\twc.lpfnWndProc = ::DefWindowProc;\n\t\t\twc.hbrBackground = GetSysBrush(ui::uiColor::Background); \/\/ helps spot flashing\n\n\t\t\tRegisterClassEx(&wc);\n\t\t}\n\n\t\t\/\/ WS_CLIPCHILDREN is used to reduce flicker\n\t\tEC_B_S(CreateEx(\n\t\t\t0,\n\t\t\t_T(\"FakeSplitter\"), \/\/ STRING_OK\n\t\t\t_T(\"FakeSplitter\"), \/\/ STRING_OK\n\t\t\tWS_CHILD | WS_CLIPSIBLINGS | WS_CLIPCHILDREN | WS_VISIBLE,\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\tm_hwndParent,\n\t\t\treinterpret_cast<HMENU>(static_cast<INT_PTR>(IDC_FAKE_SPLITTER)),\n\t\t\tnullptr));\n\n\t\t\/\/ Necessary for TAB to work. Without this, all TABS get stuck on the fake splitter control\n\t\t\/\/ instead of passing to the children. Haven't tested with nested splitters.\n\t\tEC_B_S(ModifyStyleEx(0, WS_EX_CONTROLPARENT));\n\n\t\t\/\/ Load split cursors\n\t\tm_hSplitCursorV = EC_D(HCURSOR, ::LoadCursor(GetModuleHandle(nullptr), MAKEINTRESOURCE(IDC_SPLITV)));\n\t\tm_hSplitCursorH = EC_D(HCURSOR, ::LoadCursor(GetModuleHandle(nullptr), MAKEINTRESOURCE(IDC_SPLITH)));\n\t}\n\n\tBEGIN_MESSAGE_MAP(CFakeSplitter, CWnd)\n\tON_WM_MOUSEMOVE()\n\tON_WM_SIZE()\n\tON_WM_PAINT()\n\tEND_MESSAGE_MAP()\n\n\tLRESULT CFakeSplitter::WindowProc(const UINT message, const WPARAM wParam, const LPARAM lParam)\n\t{\n\t\tLRESULT lRes = 0;\n\t\tif (ui::HandleControlUI(message, wParam, lParam, &lRes)) return lRes;\n\n\t\tswitch (message)\n\t\t{\n\t\tcase WM_CLOSE:\n\t\t\t::SendMessage(m_hwndParent, message, wParam, lParam);\n\t\t\treturn true;\n\t\tcase WM_HELP:\n\t\t\treturn true;\n\t\tcase WM_LBUTTONUP:\n\t\tcase WM_CANCELMODE: \/\/ Called if focus changes while we're adjusting the splitter\n\t\t\tStopTracking();\n\t\t\treturn NULL;\n\t\tcase WM_LBUTTONDOWN:\n\t\t\tif (m_bTracking) return true;\n\t\t\tStartTracking(HitTest(LOWORD(lParam), HIWORD(lParam)));\n\t\t\treturn NULL;\n\t\tcase WM_SETCURSOR:\n\t\t\tif (LOWORD(lParam) == HTCLIENT && reinterpret_cast<HWND>(wParam) == this->m_hWnd && !m_bTracking)\n\t\t\t\treturn true; \/\/ we will handle it in the mouse move\n\t\t\tbreak;\n\t\tcase WM_COMMAND:\n\t\t{\n\t\t\tconst auto nCode = HIWORD(wParam);\n\t\t\tif (EN_CHANGE == nCode || CBN_SELCHANGE == nCode || CBN_EDITCHANGE == nCode || BN_CLICKED == nCode)\n\t\t\t{\n\t\t\t\t::SendMessage(m_hwndParent, message, wParam, lParam);\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\t\t}\n\n\t\treturn CWnd::WindowProc(message, wParam, lParam);\n\t}\n\n\tvoid CFakeSplitter::SetPaneOne(HWND paneOne) noexcept\n\t{\n\t\tm_PaneOne = paneOne;\n\t\tif (m_PaneOne)\n\t\t{\n\t\t\tm_iSplitWidth = 7;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_iSplitWidth = 0;\n\t\t}\n\t}\n\n\tvoid CFakeSplitter::SetPaneTwo(HWND paneTwo) noexcept { m_PaneTwo = paneTwo; }\n\n\tvoid CFakeSplitter::OnSize(UINT \/*nType*\/, const int cx, const int cy)\n\t{\n\t\tCalcSplitPos();\n\n\t\tauto hdwp = WC_D(HDWP, BeginDeferWindowPos(2));\n\t\tif (hdwp)\n\t\t{\n\t\t\thdwp = EC_D(HDWP, DeferWindowPos(hdwp, 0, 0, cx, cy));\n\t\t\tEC_B_S(EndDeferWindowPos(hdwp));\n\t\t}\n\t}\n\n\tHDWP CFakeSplitter::DeferWindowPos(\n\t\t_In_ HDWP hWinPosInfo,\n\t\t_In_ const int x,\n\t\t_In_ const int y,\n\t\t_In_ const int width,\n\t\t_In_ const int height)\n\t{\n\t\toutput::DebugPrint(\n\t\t\toutput::dbgLevel::Draw,\n\t\t\tL\"CFakeSplitter::DeferWindowPos x:%d y:%d width:%d height:%d v:%d\\n\",\n\t\t\tx,\n\t\t\ty,\n\t\t\twidth,\n\t\t\theight,\n\t\t\tIsWindowVisible());\n\t\tInvalidateRect(CRect(x, y, width, height), false);\n\t\tif (m_PaneOne || m_ViewPaneOne)\n\t\t{\n\t\t\tCRect r1;\n\t\t\tif (m_SplitType == splitType::horizontal)\n\t\t\t{\n\t\t\t\tr1.SetRect(x, y, m_iSplitPos, height);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tr1.SetRect(x, y, width, m_iSplitPos);\n\t\t\t}\n\n\t\t\tif (m_PaneOne)\n\t\t\t{\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(hWinPosInfo, m_PaneOne, x, y, r1.Width(), r1.Height(), L\"CFakeSplitter::DeferWindowPos pane 1\");\n\t\t\t}\n\n\t\t\tif (m_ViewPaneOne)\n\t\t\t{\n\t\t\t\toutput::DebugPrint(\n\t\t\t\t\toutput::dbgLevel::Draw,\n\t\t\t\t\tL\"CFakeSplitter::DeferWindowPos viewpane 1 x:%d y:%d width:%d height:%d\\n\",\n\t\t\t\t\tx,\n\t\t\t\t\ty,\n\t\t\t\t\twidth,\n\t\t\t\t\theight);\n\t\t\t\thWinPosInfo = EC_D(HDWP, m_ViewPaneOne->DeferWindowPos(hWinPosInfo, x, y, r1.Width(), r1.Height()));\n\t\t\t}\n\t\t}\n\n\t\tif (m_PaneTwo || m_ViewPaneTwo)\n\t\t{\n\t\t\tCRect r2;\n\t\t\tif (m_SplitType == splitType::horizontal)\n\t\t\t{\n\t\t\t\tr2.SetRect(\n\t\t\t\t\tx + m_iSplitPos + m_iSplitWidth, \/\/ new x\n\t\t\t\t\ty, \/\/ new y\n\t\t\t\t\twidth, \/\/ bottom right corner\n\t\t\t\t\theight); \/\/ bottom right corner\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tr2.SetRect(\n\t\t\t\t\tx, \/\/ new x\n\t\t\t\t\ty + m_iSplitPos + m_iSplitWidth, \/\/ new y\n\t\t\t\t\twidth, \/\/ bottom right corner\n\t\t\t\t\theight); \/\/ bottom right corner\n\t\t\t}\n\n\t\t\tif (m_PaneTwo)\n\t\t\t{\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(hWinPosInfo, m_PaneTwo, r2.left, r2.top, r2.Width(), r2.Height(), L\"CFakeSplitter::DeferWindowPos pane 2\");\n\t\t\t}\n\n\t\t\tif (m_ViewPaneTwo)\n\t\t\t{\n\t\t\t\toutput::DebugPrint(\n\t\t\t\t\toutput::dbgLevel::Draw,\n\t\t\t\t\tL\"CFakeSplitter::DeferWindowPos view pane 2 x:%d y:%d width:%d height:%d\\n\",\n\t\t\t\t\tx,\n\t\t\t\t\ty,\n\t\t\t\t\twidth,\n\t\t\t\t\theight);\n\t\t\t\thWinPosInfo =\n\t\t\t\t\tEC_D(HDWP, m_ViewPaneTwo->DeferWindowPos(hWinPosInfo, r2.left, r2.top, r2.Width(), r2.Height()));\n\t\t\t}\n\t\t}\n\n\t\toutput::DebugPrint(output::dbgLevel::Draw, L\"CFakeSplitter::DeferWindowPos end\\n\");\n\t\treturn hWinPosInfo;\n\t}\n\n\tvoid CFakeSplitter::CalcSplitPos()\n\t{\n\t\tif (!m_PaneOne && !m_ViewPaneOne)\n\t\t{\n\t\t\tm_iSplitPos = 0;\n\t\t\treturn;\n\t\t}\n\n\t\tint iCurSpan = 0;\n\t\tCRect rect;\n\t\tGetClientRect(rect);\n\t\tif (m_SplitType == splitType::horizontal)\n\t\t{\n\t\t\tiCurSpan = rect.Width();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tiCurSpan = rect.Height();\n\t\t}\n\n\t\tm_iSplitPos = static_cast<int>(static_cast<FLOAT>(iCurSpan) * m_flSplitPercent);\n\t\tauto paneOneMinSpan = PaneOneMinSpanCallback ? PaneOneMinSpanCallback() : 0;\n\t\tauto paneTwoMinSpan = PaneTwoMinSpanCallback ? PaneTwoMinSpanCallback() : 0;\n\t\tif (paneOneMinSpan + paneTwoMinSpan + m_iSplitWidth + 1 >= iCurSpan)\n\t\t{\n\t\t\tpaneOneMinSpan = 0;\n\t\t\tpaneTwoMinSpan = 0;\n\t\t}\n\n\t\tif (m_iSplitPos < paneOneMinSpan)\n\t\t{\n\t\t\tm_iSplitPos = paneOneMinSpan;\n\t\t}\n\t\telse if (iCurSpan - m_iSplitPos < paneTwoMinSpan)\n\t\t{\n\t\t\tm_iSplitPos = iCurSpan - paneTwoMinSpan;\n\t\t}\n\n\t\tif (m_iSplitPos + m_iSplitWidth + 1 >= iCurSpan)\n\t\t{\n\t\t\tm_iSplitPos = m_iSplitPos - m_iSplitWidth - 1;\n\t\t}\n\n\t\tif (m_iSplitPos < 0) m_iSplitPos = 0;\n\t}\n\n\tvoid CFakeSplitter::SetPercent(const FLOAT iNewPercent)\n\t{\n\t\tif (iNewPercent < 0.0 || iNewPercent > 1.0) return;\n\t\tm_flSplitPercent = iNewPercent;\n\n\t\tCalcSplitPos();\n\n\t\tCRect rect;\n\t\tGetClientRect(rect);\n\n\t\t\/\/ Recalculate our layout\n\t\tOnSize(0, rect.Width(), rect.Height());\n\t}\n\n\tvoid CFakeSplitter::SetSplitType(const splitType stSplitType) noexcept { m_SplitType = stSplitType; }\n\n\t_Check_return_ int CFakeSplitter::HitTest(const LONG x, const LONG y) const noexcept\n\t{\n\t\tif (!m_PaneOne && !m_ViewPaneOne) return noHit;\n\n\t\tLONG lTestPos = 0;\n\n\t\tif (m_SplitType == splitType::horizontal)\n\t\t{\n\t\t\tlTestPos = x;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlTestPos = y;\n\t\t}\n\n\t\tif (lTestPos >= m_iSplitPos && lTestPos <= m_iSplitPos + m_iSplitWidth) return SplitterHit;\n\n\t\treturn noHit;\n\t}\n\n\tvoid CFakeSplitter::OnMouseMove(UINT \/*nFlags*\/, const CPoint point)\n\t{\n\t\tif (!m_PaneOne && !m_ViewPaneOne) return;\n\n\t\t\/\/ If we don't have GetCapture, then we don't want to track right now.\n\t\tif (GetCapture() != this) StopTracking();\n\n\t\tif (SplitterHit == HitTest(point.x, point.y))\n\t\t{\n\t\t\t\/\/ This looks backwards, but it is not. A horizontal split needs the vertical cursor\n\t\t\tSetCursor(m_SplitType == splitType::horizontal ? m_hSplitCursorV : m_hSplitCursorH);\n\t\t}\n\n\t\tif (m_bTracking)\n\t\t{\n\t\t\tCRect Rect;\n\t\t\tFLOAT flNewPercent = {};\n\t\t\tGetWindowRect(Rect);\n\n\t\t\tif (m_SplitType == splitType::horizontal)\n\t\t\t{\n\t\t\t\tflNewPercent = point.x \/ static_cast<FLOAT>(Rect.Width());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tflNewPercent = point.y \/ static_cast<FLOAT>(Rect.Height());\n\t\t\t}\n\t\t\tSetPercent(flNewPercent);\n\n\t\t\t\/\/ Force child windows to refresh now\n\t\t\tEC_B_S(RedrawWindow(nullptr, nullptr, RDW_ALLCHILDREN | RDW_UPDATENOW));\n\t\t}\n\t}\n\n\tvoid CFakeSplitter::StartTracking(const int ht)\n\t{\n\t\tif (ht == noHit) return;\n\n\t\t\/\/ steal focus and capture\n\t\tSetCapture();\n\t\tSetFocus();\n\n\t\t\/\/ make sure no updates are pending\n\t\t\/\/ CSplitterWnd does this...not sure why\n\t\tEC_B_S(RedrawWindow(nullptr, nullptr, RDW_ALLCHILDREN | RDW_UPDATENOW));\n\n\t\t\/\/ set tracking state and appropriate cursor\n\t\tm_bTracking = true;\n\n\t\t\/\/ Force redraw to get our tracking gripper\n\t\tSetPercent(m_flSplitPercent);\n\t}\n\n\tvoid CFakeSplitter::StopTracking()\n\t{\n\t\tif (!m_bTracking) return;\n\n\t\tReleaseCapture();\n\n\t\tm_bTracking = false;\n\n\t\t\/\/ Force redraw to get our non-tracking gripper\n\t\tSetPercent(m_flSplitPercent);\n\t}\n\n\tvoid CFakeSplitter::OnPaint()\n\t{\n\t\tauto ps = PAINTSTRUCT{};\n\t\t::BeginPaint(m_hWnd, &ps);\n\t\tif (ps.hdc)\n\t\t{\n\t\t\tauto rcWin = RECT{};\n\t\t\t::GetClientRect(m_hWnd, &rcWin);\n\t\t\tui::CDoubleBuffer db;\n\t\t\tauto hdc = ps.hdc;\n\t\t\tdb.Begin(hdc, rcWin);\n\n\t\t\tauto rcSplitter = rcWin;\n\t\t\tFillRect(hdc, &rcSplitter, GetSysBrush(ui::uiColor::Background));\n\n\t\t\tPOINT pts[2] = {}; \/\/ 0 is left top, 1 is right bottom\n\t\t\tif (m_SplitType == splitType::horizontal)\n\t\t\t{\n\t\t\t\tpts[0].x = m_iSplitPos + m_iSplitWidth \/ 2;\n\t\t\t\tpts[0].y = rcSplitter.top;\n\t\t\t\tpts[1].x = pts[0].x;\n\t\t\t\tpts[1].y = rcSplitter.bottom;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpts[0].x = rcSplitter.left;\n\t\t\t\tpts[0].y = m_iSplitPos + m_iSplitWidth \/ 2;\n\t\t\t\tpts[1].x = rcSplitter.right;\n\t\t\t\tpts[1].y = pts[0].y;\n\t\t\t}\n\n\t\t\t\/\/ Draw the splitter bar\n\t\t\tconst auto hpenOld = SelectObject(hdc, GetPen(m_bTracking ? ui::uiPen::SolidPen : ui::uiPen::DashedPen));\n\t\t\tMoveToEx(hdc, pts[0].x, pts[0].y, nullptr);\n\t\t\tLineTo(hdc, pts[1].x, pts[1].y);\n\t\t\tstatic_cast<void>(SelectObject(hdc, hpenOld));\n\n\t\t\tdb.End(hdc);\n\t\t}\n\n\t\t::EndPaint(m_hWnd, &ps);\n\t}\n} \/\/ namespace controls<commit_msg>Fix tabs in splitter controls<commit_after>#include <StdAfx.h>\n#include <UI\/Controls\/FakeSplitter.h>\n#include <UI\/UIFunctions.h>\n#include <UI\/DoubleBuffer.h>\n#include <core\/utility\/output.h>\n\nnamespace controls\n{\n\tstatic std::wstring CLASS = L\"CFakeSplitter\";\n\n\tenum FakesSplitHitTestValue\n\t{\n\t\tnoHit = 0,\n\t\tSplitterHit = 1\n\t};\n\n\tCFakeSplitter::~CFakeSplitter()\n\t{\n\t\tTRACE_DESTRUCTOR(CLASS);\n\t\tstatic_cast<void>(DestroyCursor(m_hSplitCursorH));\n\t\tstatic_cast<void>(DestroyCursor(m_hSplitCursorV));\n\t\tCWnd::DestroyWindow();\n\t}\n\n\tvoid CFakeSplitter::Init(HWND hWnd)\n\t{\n\t\tm_hwndParent = hWnd;\n\t\tWNDCLASSEX wc = {};\n\t\tconst auto hInst = AfxGetInstanceHandle();\n\t\tif (!::GetClassInfoEx(hInst, _T(\"FakeSplitter\"), &wc)) \/\/ STRING_OK\n\t\t{\n\t\t\twc.cbSize = sizeof wc;\n\t\t\twc.style = 0; \/\/ not passing CS_VREDRAW | CS_HREDRAW fixes flicker\n\t\t\twc.lpszClassName = _T(\"FakeSplitter\"); \/\/ STRING_OK\n\t\t\twc.lpfnWndProc = ::DefWindowProc;\n\t\t\twc.hbrBackground = GetSysBrush(ui::uiColor::Background); \/\/ helps spot flashing\n\n\t\t\tRegisterClassEx(&wc);\n\t\t}\n\n\t\t\/\/ WS_CLIPCHILDREN is used to reduce flicker\n\t\tEC_B_S(CreateEx(\n\t\t\t0,\n\t\t\t_T(\"FakeSplitter\"), \/\/ STRING_OK\n\t\t\t_T(\"FakeSplitter\"), \/\/ STRING_OK\n\t\t\tWS_CHILD | WS_CLIPSIBLINGS | WS_CLIPCHILDREN | WS_VISIBLE,\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\tm_hwndParent,\n\t\t\treinterpret_cast<HMENU>(static_cast<INT_PTR>(IDC_FAKE_SPLITTER)),\n\t\t\tnullptr));\n\n\t\t\/\/ Necessary for TAB to work. Without this, all TABS get stuck on the fake splitter control\n\t\t\/\/ instead of passing to the children. Haven't tested with nested splitters.\n\t\tEC_B_S(ModifyStyleEx(0, WS_EX_CONTROLPARENT));\n\n\t\t\/\/ Load split cursors\n\t\tm_hSplitCursorV = EC_D(HCURSOR, ::LoadCursor(GetModuleHandle(nullptr), MAKEINTRESOURCE(IDC_SPLITV)));\n\t\tm_hSplitCursorH = EC_D(HCURSOR, ::LoadCursor(GetModuleHandle(nullptr), MAKEINTRESOURCE(IDC_SPLITH)));\n\t}\n\n\tBEGIN_MESSAGE_MAP(CFakeSplitter, CWnd)\n\tON_WM_MOUSEMOVE()\n\tON_WM_SIZE()\n\tON_WM_PAINT()\n\tEND_MESSAGE_MAP()\n\n\tLRESULT CFakeSplitter::WindowProc(const UINT message, const WPARAM wParam, const LPARAM lParam)\n\t{\n\t\tLRESULT lRes = 0;\n\t\tif (ui::HandleControlUI(message, wParam, lParam, &lRes)) return lRes;\n\n\t\tswitch (message)\n\t\t{\n\t\tcase WM_CLOSE:\n\t\t\t::SendMessage(m_hwndParent, message, wParam, lParam);\n\t\t\treturn true;\n\t\tcase WM_HELP:\n\t\t\treturn true;\n\t\tcase WM_LBUTTONUP:\n\t\tcase WM_CANCELMODE: \/\/ Called if focus changes while we're adjusting the splitter\n\t\t\tStopTracking();\n\t\t\treturn NULL;\n\t\tcase WM_LBUTTONDOWN:\n\t\t\tif (m_bTracking) return true;\n\t\t\tStartTracking(HitTest(LOWORD(lParam), HIWORD(lParam)));\n\t\t\treturn NULL;\n\t\tcase WM_SETCURSOR:\n\t\t\tif (LOWORD(lParam) == HTCLIENT && reinterpret_cast<HWND>(wParam) == this->m_hWnd && !m_bTracking)\n\t\t\t\treturn true; \/\/ we will handle it in the mouse move\n\t\t\tbreak;\n\t\tcase WM_NEXTDLGCTL:\n\t\t\t\/\/ Ensure tabs are handled by parent dialog\n\t\t\treturn ::SendMessage(m_hwndParent, message, wParam, lParam);\n\t\tcase WM_COMMAND:\n\t\t{\n\t\t\tconst auto nCode = HIWORD(wParam);\n\t\t\tif (EN_CHANGE == nCode || CBN_SELCHANGE == nCode || CBN_EDITCHANGE == nCode || BN_CLICKED == nCode)\n\t\t\t{\n\t\t\t\t::SendMessage(m_hwndParent, message, wParam, lParam);\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\t\t}\n\n\t\treturn CWnd::WindowProc(message, wParam, lParam);\n\t}\n\n\tvoid CFakeSplitter::SetPaneOne(HWND paneOne) noexcept\n\t{\n\t\tm_PaneOne = paneOne;\n\t\tif (m_PaneOne)\n\t\t{\n\t\t\tm_iSplitWidth = 7;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_iSplitWidth = 0;\n\t\t}\n\t}\n\n\tvoid CFakeSplitter::SetPaneTwo(HWND paneTwo) noexcept { m_PaneTwo = paneTwo; }\n\n\tvoid CFakeSplitter::OnSize(UINT \/*nType*\/, const int cx, const int cy)\n\t{\n\t\tCalcSplitPos();\n\n\t\tauto hdwp = WC_D(HDWP, BeginDeferWindowPos(2));\n\t\tif (hdwp)\n\t\t{\n\t\t\thdwp = EC_D(HDWP, DeferWindowPos(hdwp, 0, 0, cx, cy));\n\t\t\tEC_B_S(EndDeferWindowPos(hdwp));\n\t\t}\n\t}\n\n\tHDWP CFakeSplitter::DeferWindowPos(\n\t\t_In_ HDWP hWinPosInfo,\n\t\t_In_ const int x,\n\t\t_In_ const int y,\n\t\t_In_ const int width,\n\t\t_In_ const int height)\n\t{\n\t\toutput::DebugPrint(\n\t\t\toutput::dbgLevel::Draw,\n\t\t\tL\"CFakeSplitter::DeferWindowPos x:%d y:%d width:%d height:%d v:%d\\n\",\n\t\t\tx,\n\t\t\ty,\n\t\t\twidth,\n\t\t\theight,\n\t\t\tIsWindowVisible());\n\t\tInvalidateRect(CRect(x, y, width, height), false);\n\t\tif (m_PaneOne || m_ViewPaneOne)\n\t\t{\n\t\t\tCRect r1;\n\t\t\tif (m_SplitType == splitType::horizontal)\n\t\t\t{\n\t\t\t\tr1.SetRect(x, y, m_iSplitPos, height);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tr1.SetRect(x, y, width, m_iSplitPos);\n\t\t\t}\n\n\t\t\tif (m_PaneOne)\n\t\t\t{\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(hWinPosInfo, m_PaneOne, x, y, r1.Width(), r1.Height(), L\"CFakeSplitter::DeferWindowPos pane 1\");\n\t\t\t}\n\n\t\t\tif (m_ViewPaneOne)\n\t\t\t{\n\t\t\t\toutput::DebugPrint(\n\t\t\t\t\toutput::dbgLevel::Draw,\n\t\t\t\t\tL\"CFakeSplitter::DeferWindowPos viewpane 1 x:%d y:%d width:%d height:%d\\n\",\n\t\t\t\t\tx,\n\t\t\t\t\ty,\n\t\t\t\t\twidth,\n\t\t\t\t\theight);\n\t\t\t\thWinPosInfo = EC_D(HDWP, m_ViewPaneOne->DeferWindowPos(hWinPosInfo, x, y, r1.Width(), r1.Height()));\n\t\t\t}\n\t\t}\n\n\t\tif (m_PaneTwo || m_ViewPaneTwo)\n\t\t{\n\t\t\tCRect r2;\n\t\t\tif (m_SplitType == splitType::horizontal)\n\t\t\t{\n\t\t\t\tr2.SetRect(\n\t\t\t\t\tx + m_iSplitPos + m_iSplitWidth, \/\/ new x\n\t\t\t\t\ty, \/\/ new y\n\t\t\t\t\twidth, \/\/ bottom right corner\n\t\t\t\t\theight); \/\/ bottom right corner\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tr2.SetRect(\n\t\t\t\t\tx, \/\/ new x\n\t\t\t\t\ty + m_iSplitPos + m_iSplitWidth, \/\/ new y\n\t\t\t\t\twidth, \/\/ bottom right corner\n\t\t\t\t\theight); \/\/ bottom right corner\n\t\t\t}\n\n\t\t\tif (m_PaneTwo)\n\t\t\t{\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(hWinPosInfo, m_PaneTwo, r2.left, r2.top, r2.Width(), r2.Height(), L\"CFakeSplitter::DeferWindowPos pane 2\");\n\t\t\t}\n\n\t\t\tif (m_ViewPaneTwo)\n\t\t\t{\n\t\t\t\toutput::DebugPrint(\n\t\t\t\t\toutput::dbgLevel::Draw,\n\t\t\t\t\tL\"CFakeSplitter::DeferWindowPos view pane 2 x:%d y:%d width:%d height:%d\\n\",\n\t\t\t\t\tx,\n\t\t\t\t\ty,\n\t\t\t\t\twidth,\n\t\t\t\t\theight);\n\t\t\t\thWinPosInfo =\n\t\t\t\t\tEC_D(HDWP, m_ViewPaneTwo->DeferWindowPos(hWinPosInfo, r2.left, r2.top, r2.Width(), r2.Height()));\n\t\t\t}\n\t\t}\n\n\t\toutput::DebugPrint(output::dbgLevel::Draw, L\"CFakeSplitter::DeferWindowPos end\\n\");\n\t\treturn hWinPosInfo;\n\t}\n\n\tvoid CFakeSplitter::CalcSplitPos()\n\t{\n\t\tif (!m_PaneOne && !m_ViewPaneOne)\n\t\t{\n\t\t\tm_iSplitPos = 0;\n\t\t\treturn;\n\t\t}\n\n\t\tint iCurSpan = 0;\n\t\tCRect rect;\n\t\tGetClientRect(rect);\n\t\tif (m_SplitType == splitType::horizontal)\n\t\t{\n\t\t\tiCurSpan = rect.Width();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tiCurSpan = rect.Height();\n\t\t}\n\n\t\tm_iSplitPos = static_cast<int>(static_cast<FLOAT>(iCurSpan) * m_flSplitPercent);\n\t\tauto paneOneMinSpan = PaneOneMinSpanCallback ? PaneOneMinSpanCallback() : 0;\n\t\tauto paneTwoMinSpan = PaneTwoMinSpanCallback ? PaneTwoMinSpanCallback() : 0;\n\t\tif (paneOneMinSpan + paneTwoMinSpan + m_iSplitWidth + 1 >= iCurSpan)\n\t\t{\n\t\t\tpaneOneMinSpan = 0;\n\t\t\tpaneTwoMinSpan = 0;\n\t\t}\n\n\t\tif (m_iSplitPos < paneOneMinSpan)\n\t\t{\n\t\t\tm_iSplitPos = paneOneMinSpan;\n\t\t}\n\t\telse if (iCurSpan - m_iSplitPos < paneTwoMinSpan)\n\t\t{\n\t\t\tm_iSplitPos = iCurSpan - paneTwoMinSpan;\n\t\t}\n\n\t\tif (m_iSplitPos + m_iSplitWidth + 1 >= iCurSpan)\n\t\t{\n\t\t\tm_iSplitPos = m_iSplitPos - m_iSplitWidth - 1;\n\t\t}\n\n\t\tif (m_iSplitPos < 0) m_iSplitPos = 0;\n\t}\n\n\tvoid CFakeSplitter::SetPercent(const FLOAT iNewPercent)\n\t{\n\t\tif (iNewPercent < 0.0 || iNewPercent > 1.0) return;\n\t\tm_flSplitPercent = iNewPercent;\n\n\t\tCalcSplitPos();\n\n\t\tCRect rect;\n\t\tGetClientRect(rect);\n\n\t\t\/\/ Recalculate our layout\n\t\tOnSize(0, rect.Width(), rect.Height());\n\t}\n\n\tvoid CFakeSplitter::SetSplitType(const splitType stSplitType) noexcept { m_SplitType = stSplitType; }\n\n\t_Check_return_ int CFakeSplitter::HitTest(const LONG x, const LONG y) const noexcept\n\t{\n\t\tif (!m_PaneOne && !m_ViewPaneOne) return noHit;\n\n\t\tLONG lTestPos = 0;\n\n\t\tif (m_SplitType == splitType::horizontal)\n\t\t{\n\t\t\tlTestPos = x;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlTestPos = y;\n\t\t}\n\n\t\tif (lTestPos >= m_iSplitPos && lTestPos <= m_iSplitPos + m_iSplitWidth) return SplitterHit;\n\n\t\treturn noHit;\n\t}\n\n\tvoid CFakeSplitter::OnMouseMove(UINT \/*nFlags*\/, const CPoint point)\n\t{\n\t\tif (!m_PaneOne && !m_ViewPaneOne) return;\n\n\t\t\/\/ If we don't have GetCapture, then we don't want to track right now.\n\t\tif (GetCapture() != this) StopTracking();\n\n\t\tif (SplitterHit == HitTest(point.x, point.y))\n\t\t{\n\t\t\t\/\/ This looks backwards, but it is not. A horizontal split needs the vertical cursor\n\t\t\tSetCursor(m_SplitType == splitType::horizontal ? m_hSplitCursorV : m_hSplitCursorH);\n\t\t}\n\n\t\tif (m_bTracking)\n\t\t{\n\t\t\tCRect Rect;\n\t\t\tFLOAT flNewPercent = {};\n\t\t\tGetWindowRect(Rect);\n\n\t\t\tif (m_SplitType == splitType::horizontal)\n\t\t\t{\n\t\t\t\tflNewPercent = point.x \/ static_cast<FLOAT>(Rect.Width());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tflNewPercent = point.y \/ static_cast<FLOAT>(Rect.Height());\n\t\t\t}\n\t\t\tSetPercent(flNewPercent);\n\n\t\t\t\/\/ Force child windows to refresh now\n\t\t\tEC_B_S(RedrawWindow(nullptr, nullptr, RDW_ALLCHILDREN | RDW_UPDATENOW));\n\t\t}\n\t}\n\n\tvoid CFakeSplitter::StartTracking(const int ht)\n\t{\n\t\tif (ht == noHit) return;\n\n\t\t\/\/ steal focus and capture\n\t\tSetCapture();\n\t\tSetFocus();\n\n\t\t\/\/ make sure no updates are pending\n\t\t\/\/ CSplitterWnd does this...not sure why\n\t\tEC_B_S(RedrawWindow(nullptr, nullptr, RDW_ALLCHILDREN | RDW_UPDATENOW));\n\n\t\t\/\/ set tracking state and appropriate cursor\n\t\tm_bTracking = true;\n\n\t\t\/\/ Force redraw to get our tracking gripper\n\t\tSetPercent(m_flSplitPercent);\n\t}\n\n\tvoid CFakeSplitter::StopTracking()\n\t{\n\t\tif (!m_bTracking) return;\n\n\t\tReleaseCapture();\n\n\t\tm_bTracking = false;\n\n\t\t\/\/ Force redraw to get our non-tracking gripper\n\t\tSetPercent(m_flSplitPercent);\n\t}\n\n\tvoid CFakeSplitter::OnPaint()\n\t{\n\t\tauto ps = PAINTSTRUCT{};\n\t\t::BeginPaint(m_hWnd, &ps);\n\t\tif (ps.hdc)\n\t\t{\n\t\t\tauto rcWin = RECT{};\n\t\t\t::GetClientRect(m_hWnd, &rcWin);\n\t\t\tui::CDoubleBuffer db;\n\t\t\tauto hdc = ps.hdc;\n\t\t\tdb.Begin(hdc, rcWin);\n\n\t\t\tauto rcSplitter = rcWin;\n\t\t\tFillRect(hdc, &rcSplitter, GetSysBrush(ui::uiColor::Background));\n\n\t\t\tPOINT pts[2] = {}; \/\/ 0 is left top, 1 is right bottom\n\t\t\tif (m_SplitType == splitType::horizontal)\n\t\t\t{\n\t\t\t\tpts[0].x = m_iSplitPos + m_iSplitWidth \/ 2;\n\t\t\t\tpts[0].y = rcSplitter.top;\n\t\t\t\tpts[1].x = pts[0].x;\n\t\t\t\tpts[1].y = rcSplitter.bottom;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpts[0].x = rcSplitter.left;\n\t\t\t\tpts[0].y = m_iSplitPos + m_iSplitWidth \/ 2;\n\t\t\t\tpts[1].x = rcSplitter.right;\n\t\t\t\tpts[1].y = pts[0].y;\n\t\t\t}\n\n\t\t\t\/\/ Draw the splitter bar\n\t\t\tconst auto hpenOld = SelectObject(hdc, GetPen(m_bTracking ? ui::uiPen::SolidPen : ui::uiPen::DashedPen));\n\t\t\tMoveToEx(hdc, pts[0].x, pts[0].y, nullptr);\n\t\t\tLineTo(hdc, pts[1].x, pts[1].y);\n\t\t\tstatic_cast<void>(SelectObject(hdc, hpenOld));\n\n\t\t\tdb.End(hdc);\n\t\t}\n\n\t\t::EndPaint(m_hWnd, &ps);\n\t}\n} \/\/ namespace controls<|endoftext|>"}
{"text":"<commit_before>\/*\n * CommonESP8266.cpp\n *\n *  Created on: Nov 13, 2015\n *      Author: Supun Jayathilake (supunj@gmail.com)\n *\/\n\n#include <ESP8266WiFi.h>\n#include <WiFiClient.h>\n#include <ESP8266mDNS.h>\n#include <ESP8266WebServer.h>\n#include \"base64.h\"\n#include \"esp8266util.h\"\n\/\/#include <ArduinoJson.h>\n#include \"eepromutil.h\"\n\nMDNSResponder mdns;\nESP8266WebServer server(80);\nWiFiClient client;\n\nESP8266Util::ESP8266Util(char* sid, char* pwd, const int ind_led) :\n\t\tssid(sid), password(pwd), indicator_led(ind_led) {\n}\n\n\/**\n * Connect to the wifi\n *\/\nvoid ESP8266Util::wifiConnect() {\n\t\/\/ set WiFi mode to station (client)\n\tWiFi.mode(WIFI_STA);\n\n\t\/\/ initiate\n\tWiFi.begin(ssid, password);\n\tSerial.println(\"\");\n\n\t\/\/ Wait for connection\n\twhile (WiFi.status() != WL_CONNECTED) {\n\t\tdelay(500);\n\t\tSerial.print(\".\");\n\t}\n\n\t\/\/ get the ip address\n\tip = WiFi.localIP();\n\tSerial.println(\"\");\n\tSerial.print(\"Connected to \");\n\tSerial.println(ssid);\n\tSerial.print(\"IP address: \");\n\tSerial.println(ip);\n\n\tif (mdns.begin(\"esp8266\", ip)) {\n\t\tSerial.println(\"MDNS responder started\");\n\t}\n}\n\n\/**\n * Keep updating dns\n *\/\nvoid ESP8266Util::mdnsUpdate() {\n\tmdns.update();\n}\n\nbool ESP8266Util::startWebServer() {\n\t\/\/ bind non-memeber functions\n\tstd::function<void(void)> handleRoot(\n\t\t\tstd::bind(&ESP8266Util::handleRoot, this));\n\tstd::function<void(void)> handleNotFound(\n\t\t\tstd::bind(&ESP8266Util::handleNotFound, this));\n\tstd::function<void(void)> resetDevice(\n\t\t\tstd::bind(&ESP8266Util::resetDevice, this));\n\tstd::function<void(void)> restartDevice(\n\t\t\tstd::bind(&ESP8266Util::restartDevice, this));\n\tstd::function<void(void)> store(std::bind(&ESP8266Util::store, this));\n\tstd::function<String(void)> readAll(std::bind(&ESP8266Util::readAll, this));\n\tstd::function<void(void)> clearEEPROM(\n\t\t\tstd::bind(&ESP8266Util::clearEEPROM, this));\n\n\tserver.on(\"\/\", handleRoot);\n\tserver.on(\"\/reset\", resetDevice);\n\tserver.on(\"\/restart\", restartDevice);\n\tserver.on(\"\/store\", store);\n\tserver.on(\"\/readall\", readAll);\n\tserver.on(\"\/clear\", clearEEPROM);\n\tserver.onNotFound(handleNotFound);\n\tserver.begin();\n\tSerial.println(\"HTTP server started\");\n\treturn true;\n}\n\n\/**\n * handle web server root\n *\/\nvoid ESP8266Util::handleRoot() {\n\tdigitalWrite(indicator_led, 1);\n\tchar temp[400];\n\tint sec = millis() \/ 1000;\n\tint min = sec \/ 60;\n\tint hr = min \/ 60;\n\n\tsnprintf(temp, 400,\n\n\t\t\t\"<html>\\\n  <head>\\\n    <meta http-equiv='refresh' content='5'\/>\\\n    <title>ESP8266 Demo<\/title>\\\n    <style>\\\n      body { background-color: #cccccc; font-family: Arial, Helvetica, Sans-Serif; Color: #000088; }\\\n    <\/style>\\\n  <\/head>\\\n  <body>\\\n    <h1>Hello from ESP8266!<\/h1>\\\n    <p>Uptime: %02d:%02d:%02d<\/p>\\\n    <img src=\\\"\/test.svg\\\" \/>\\\n  <\/body>\\\n<\/html>\",\n\n\t\t\thr, min % 60, sec % 60);\n\tserver.send(200, \"text\/html\", temp);\n\tdigitalWrite(indicator_led, 0);\n}\n\n\/**\n * handle resource not found\n *\/\nvoid ESP8266Util::handleNotFound() {\n\tdigitalWrite(indicator_led, 1);\n\tString message = \"File Not Found\\n\\n\";\n\tmessage += \"URI: \";\n\tmessage += server.uri();\n\tmessage += \"\\nMethod: \";\n\tmessage += (server.method() == HTTP_GET) ? \"GET\" : \"POST\";\n\tmessage += \"\\nArguments: \";\n\tmessage += server.args();\n\tmessage += \"\\n\";\n\n\tfor (uint8_t i = 0; i < server.args(); i++) {\n\t\tmessage += \" \" + server.argName(i) + \": \" + server.arg(i) + \"\\n\";\n\t}\n\n\tserver.send(404, \"text\/plain\", message);\n\tdigitalWrite(indicator_led, 0);\n}\n\n\/**\n * handle web requests\n *\/\nvoid ESP8266Util::handleWebClient() {\n\tserver.handleClient();\n}\n\n\/**\n * reset the device\n *\/\nvoid ESP8266Util::resetDevice() {\n\tserver.send(200, \"text\/plain\", \"device reset called\");\n\twdt_enable(WDTO_0MS);\n\twhile (1) {\n\t}\n}\n\n\/**\n * restart the device\n *\/\nvoid ESP8266Util::restartDevice() {\n\tserver.send(200, \"text\/plain\", \"device restart called\");\n\tdigitalWrite(12, LOW);\n\tdelay(100);\n\tdigitalWrite(12, HIGH);\n}\n\n\/**\n * send http get request\n *\/\nString ESP8266Util::httpGET(char* host, int port, String uri, const int wait) {\n\tif (!client.connect(host, port)) {\n\t\tSerial.println(\"connection failed\");\n\t\treturn \"\";\n\t}\n\n\t\/\/ this will send the request to the server\n\tclient.print(\n\t\t\tString(\"GET \") + uri + \" HTTP\/1.1\\r\\n\" + \"Host: \" + host + \"\\r\\n\"\n\t\t\t\t\t+ \"Connection: close\\r\\n\\r\\n\");\n\n\t\/\/ wait till response comes\n\tdelay(wait);\n\n\t\/\/ read all the lines of the reply from server and print them to Serial\n\tString response = \"\";\n\twhile (client.available()) {\n\t\tresponse.concat(client.readString());\n\t\tresponse.concat(client.readStringUntil('\\r'));\n\t}\n\n\t\/\/Serial.print(response);\n\t\/\/Serial.println();\n\tSerial.println(\"closing connection\");\n\treturn response;\n}\n\n\/**\n * send http post request\n *\/\nString ESP8266Util::httpPOST(char* host, int port, String uri, String payload,\n\t\tconst int wait) {\n\tif (!client.connect(host, port)) {\n\t\tSerial.println(\"connection failed\");\n\t\treturn \"\";\n\t}\n\n\tString enc = base64_encode(\n\t\t\treinterpret_cast<const unsigned char*>(payload.c_str()),\n\t\t\tpayload.length());\n\n\t\/\/ this will send the request to the server\n\tclient.print(\n\t\t\tString(\"POST \") + uri + \" HTTP\/1.1\\r\\n\" + \"Host: \" + host + \"\\r\\n\"\n\t\t\t\t\t+ \"Accept: *\/*\\r\\n\" + \"Content-Length: \" + enc.length()\n\t\t\t\t\t+ \"\\r\\n\"\n\t\t\t\t\t+ \"Content-Type: application\/x-www-form-urlencoded\\r\\n\"\n\t\t\t\t\t+ \"Connection: close\\r\\n\\r\\n\" + enc);\n\n\t\/\/ wait till response comes\n\tdelay(wait);\n\n\t\/\/ read all the lines of the reply from server and print them to Serial\n\tString response = \"\";\n\twhile (client.available()) {\n\t\tresponse.concat(client.readStringUntil('\\r'));\n\t}\n\n\t\/\/Serial.print(response);\n\t\/\/Serial.println();\n\tSerial.println(\"closing connection\");\n\treturn response;\n}\n\nvoid ESP8266Util::store() {\n\tEEPROMUtility.put(\"key1\", \"test\");\n\tserver.send(200, \"text\/plain\", \"key\/value stored\");\n\tSerial.println(EEPROMUtility.get(\"key1\"));\n}\n\nString ESP8266Util::readAll() {\n\tString str = EEPROMUtility.readAll();\n\tSerial.println(str);\n\tserver.send(200, \"text\/plain\", str);\n\treturn str;\n}\n\nvoid ESP8266Util::clearEEPROM() {\n\tEEPROMUtility.clear();\n\tserver.send(200, \"text\/plain\", \"EEPROM cleared\");\n}\n\nESP8266Util::~ESP8266Util() {\n\n}\n<commit_msg>Web console related changes<commit_after>\/*\n * CommonESP8266.cpp\n *\n *  Created on: Nov 13, 2015\n *      Author: Supun Jayathilake (supunj@gmail.com)\n *\/\n\n#include <ESP8266WiFi.h>\n#include <WiFiClient.h>\n#include <ESP8266mDNS.h>\n#include <ESP8266WebServer.h>\n#include \"base64.h\"\n#include \"esp8266util.h\"\n\/\/#include <ArduinoJson.h>\n#include \"eepromutil.h\"\n\nMDNSResponder mdns;\nESP8266WebServer server(80);\nWiFiClient client;\n\nESP8266Util::ESP8266Util(char* sid, char* pwd, const int ind_led) :\n\t\tssid(sid), password(pwd), indicator_led(ind_led) {\n}\n\n\/**\n * Connect to the wifi\n *\/\nvoid ESP8266Util::wifiConnect() {\n\t\/\/ set WiFi mode to station (client)\n\tWiFi.mode(WIFI_STA);\n\n\t\/\/ initiate\n\tWiFi.begin(ssid, password);\n\tSerial.println(\"\");\n\n\t\/\/ Wait for connection\n\twhile (WiFi.status() != WL_CONNECTED) {\n\t\tdelay(500);\n\t\tSerial.print(\".\");\n\t}\n\n\t\/\/ get the ip address\n\tip = WiFi.localIP();\n\tSerial.println(\"\");\n\tSerial.print(\"Connected to \");\n\tSerial.println(ssid);\n\tSerial.print(\"IP address: \");\n\tSerial.println(ip);\n\n\tif (mdns.begin(\"esp8266\", ip)) {\n\t\tSerial.println(\"MDNS responder started\");\n\t}\n}\n\n\/**\n * Keep updating dns\n *\/\nvoid ESP8266Util::mdnsUpdate() {\n\tmdns.update();\n}\n\nbool ESP8266Util::startWebServer() {\n\t\/\/ bind non-memeber functions\n\tstd::function<void(void)> handleRoot(\n\t\t\tstd::bind(&ESP8266Util::handleRoot, this));\n\tstd::function<void(void)> handleNotFound(\n\t\t\tstd::bind(&ESP8266Util::handleNotFound, this));\n\tstd::function<void(void)> resetDevice(\n\t\t\tstd::bind(&ESP8266Util::resetDevice, this));\n\tstd::function<void(void)> restartDevice(\n\t\t\tstd::bind(&ESP8266Util::restartDevice, this));\n\tstd::function<void(void)> store(std::bind(&ESP8266Util::store, this));\n\tstd::function<String(void)> readAll(std::bind(&ESP8266Util::readAll, this));\n\tstd::function<void(void)> clearEEPROM(\n\t\t\tstd::bind(&ESP8266Util::clearEEPROM, this));\n\n\tserver.on(\"\/\", handleRoot);\n\tserver.on(\"\/reset\", resetDevice);\n\tserver.on(\"\/restart\", restartDevice);\n\tserver.on(\"\/store\", store);\n\tserver.on(\"\/readall\", readAll);\n\tserver.on(\"\/clear\", clearEEPROM);\n\tserver.onNotFound(handleNotFound);\n\tserver.begin();\n\tSerial.println(\"HTTP server started\");\n\treturn true;\n}\n\n\/**\n * handle web server root\n *\/\nvoid ESP8266Util::handleRoot() {\n\tdigitalWrite(indicator_led, 1);\n\tchar temp[1000];\n\tint sec = millis() \/ 1000;\n\tint min = sec \/ 60;\n\tint hr = min \/ 60;\n\n\tsnprintf(temp, 1000,\n\t\t\t\"<html>\\\n\t\t\t  <head>\\\n\t\t\t\t<meta http-equiv='refresh' content='5'\/>\\\n\t\t\t\t<title>ESP8266 Based IoT Platform<\/title>\\\n\t\t\t   <\/head>\\\n\t\t\t  <body>\\\n\t\t\t\t<h1>ESP8266 Based IoT Platform<\/h1>\\\n\t\t\t\t\t<p><a href=\\\"\/reset\\\" target=\\\"_blank\\\">Reset the device<\/a><\/p>\\\n\t\t\t\t\t<p><a href=\\\"\/restart\\\" target=\\\"_blank\\\">Re-start the device<\/a><\/p>\\\n\t\t\t\t\t<p><a href=\\\"\/store\\\" target=\\\"_blank\\\">Store value on EEPROM<\/a><\/p>\\\n\t\t\t\t\t<p><a href=\\\"\/readall\\\" target=\\\"_blank\\\">Read all the values on EEPROM<\/a><\/p>\\\n\t\t\t\t\t<p><a href=\\\"\/clear\\\" target=\\\"_blank\\\">Clear EEPROM<\/a><\/p>\\\n\t\t\t\t\t<p>Uptime: %02d:%02d:%02d<\/p>\\\n\t\t\t  <\/body>\\\n\t\t\t<\/html>\",\n\t\t\thr, min % 60, sec % 60);\n\tserver.send(200, \"text\/html\", temp);\n\tdigitalWrite(indicator_led, 0);\n}\n\n\/**\n * handle resource not found\n *\/\nvoid ESP8266Util::handleNotFound() {\n\tdigitalWrite(indicator_led, 1);\n\tString message = \"Resource not found\\n\\n\";\n\tmessage += \"URI: \";\n\tmessage += server.uri();\n\tmessage += \"\\nMethod: \";\n\tmessage += (server.method() == HTTP_GET) ? \"GET\" : \"POST\";\n\tmessage += \"\\nArguments: \";\n\tmessage += server.args();\n\tmessage += \"\\n\";\n\n\tfor (uint8_t i = 0; i < server.args(); i++) {\n\t\tmessage += \" \" + server.argName(i) + \": \" + server.arg(i) + \"\\n\";\n\t}\n\n\tserver.send(404, \"text\/plain\", message);\n\tdigitalWrite(indicator_led, 0);\n}\n\n\/**\n * handle web requests\n *\/\nvoid ESP8266Util::handleWebClient() {\n\tserver.handleClient();\n}\n\n\/**\n * reset the device\n *\/\nvoid ESP8266Util::resetDevice() {\n\tserver.send(200, \"text\/plain\", \"device reset called\");\n\twdt_enable(WDTO_0MS);\n\twhile (1) {\n\t}\n}\n\n\/**\n * restart the device\n *\/\nvoid ESP8266Util::restartDevice() {\n\tserver.send(200, \"text\/plain\", \"device restart called\");\n\tdigitalWrite(12, LOW);\n\tdelay(100);\n\tdigitalWrite(12, HIGH);\n}\n\n\/**\n * send http get request\n *\/\nString ESP8266Util::httpGET(char* host, int port, String uri, const int wait) {\n\tif (!client.connect(host, port)) {\n\t\tSerial.println(\"connection failed\");\n\t\treturn \"\";\n\t}\n\n\t\/\/ this will send the request to the server\n\tclient.print(\n\t\t\tString(\"GET \") + uri + \" HTTP\/1.1\\r\\n\" + \"Host: \" + host + \"\\r\\n\"\n\t\t\t\t\t+ \"Connection: close\\r\\n\\r\\n\");\n\n\t\/\/ wait till response comes\n\tdelay(wait);\n\n\t\/\/ read all the lines of the reply from server and print them to Serial\n\tString response = \"\";\n\twhile (client.available()) {\n\t\tresponse.concat(client.readString());\n\t\tresponse.concat(client.readStringUntil('\\r'));\n\t}\n\n\t\/\/Serial.print(response);\n\t\/\/Serial.println();\n\tSerial.println(\"closing connection\");\n\treturn response;\n}\n\n\/**\n * send http post request\n *\/\nString ESP8266Util::httpPOST(char* host, int port, String uri, String payload,\n\t\tconst int wait) {\n\tif (!client.connect(host, port)) {\n\t\tSerial.println(\"connection failed\");\n\t\treturn \"\";\n\t}\n\n\tString enc = base64_encode(\n\t\t\treinterpret_cast<const unsigned char*>(payload.c_str()),\n\t\t\tpayload.length());\n\n\t\/\/ this will send the request to the server\n\tclient.print(\n\t\t\tString(\"POST \") + uri + \" HTTP\/1.1\\r\\n\" + \"Host: \" + host + \"\\r\\n\"\n\t\t\t\t\t+ \"Accept: *\/*\\r\\n\" + \"Content-Length: \" + enc.length()\n\t\t\t\t\t+ \"\\r\\n\"\n\t\t\t\t\t+ \"Content-Type: application\/x-www-form-urlencoded\\r\\n\"\n\t\t\t\t\t+ \"Connection: close\\r\\n\\r\\n\" + enc);\n\n\t\/\/ wait till response comes\n\tdelay(wait);\n\n\t\/\/ read all the lines of the reply from server and print them to Serial\n\tString response = \"\";\n\twhile (client.available()) {\n\t\tresponse.concat(client.readStringUntil('\\r'));\n\t}\n\n\t\/\/Serial.print(response);\n\t\/\/Serial.println();\n\tSerial.println(\"closing connection\");\n\treturn response;\n}\n\nvoid ESP8266Util::store() {\n\tdigitalWrite(indicator_led, 1);\n\tchar temp[1000];\n\tint sec = millis() \/ 1000;\n\tint min = sec \/ 60;\n\tint hr = min \/ 60;\n\n\tsnprintf(temp, 1000,\n\t\t\t\"<html>\\\n\t\t\t\t  <head>\\\n\t\t\t\t\t<title>ESP8266 Based IoT Platform<\/title>\\\n\t\t\t\t   <\/head>\\\n\t\t\t\t  <body>\\\n\t\t\t\t\t\t<h1>Store key\/value in the EEPROM<\/h1>\\\n\t\t\t\t\t\t<form action=\\\"\/eepromstore\\\">\\\n\t\t\t\t\t\t<table>\\\n\t\t\t\t\t\t<tbody>\\\n\t\t\t\t\t\t\t<tr>\\\n\t\t\t\t\t\t\t\t<td>Key<\/td>\\\n\t\t\t\t\t\t\t\t<td><input type=\\\"text\\\" name=\\\"key\\\"\/><\/td>\\\n\t\t\t\t\t\t\t<\/tr>\\\n\t\t\t\t\t\t\t<tr>\\\n\t\t\t\t\t\t\t\t<td>Value<\/td>\\\n\t\t\t\t\t\t\t\t<td><input type=\\\"text\\\" name=\\\"value\\\"\/><\/td>\\\n\t\t\t\t\t\t\t<\/tr>\\\n\t\t\t\t\t\t\t<tr>\\\n\t\t\t\t\t\t\t\t<td><\/td>\\\n\t\t\t\t\t\t\t\t<td><input type=\\\"submit\\\" name=\\\"store\\\" value=\\\"Store\\\"\/><\/td>\\\n\t\t\t\t\t\t\t<\/tr>\\\n\t\t\t\t\t\t<\/tbody>\\\n\t\t\t\t\t\t<\/table>\\\n\t\t\t\t  <\/body>\\\n\t\t\t\t<\/html>\");\n\tserver.send(200, \"text\/html\", temp);\n\tdigitalWrite(indicator_led, 0);\n\n\tEEPROMUtility.put(\"key1\", \"test\");\n\tserver.send(200, \"text\/plain\", \"key\/value stored\");\n\tSerial.println(EEPROMUtility.get(\"key1\"));\n}\n\nString ESP8266Util::readAll() {\n\tString str = EEPROMUtility.readAll();\n\tSerial.println(str);\n\tserver.send(200, \"text\/plain\", str);\n\treturn str;\n}\n\nvoid ESP8266Util::clearEEPROM() {\n\tEEPROMUtility.clear();\n\tserver.send(200, \"text\/plain\", \"EEPROM cleared\");\n}\n\nESP8266Util::~ESP8266Util() {\n\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 \"H5Group.hpp\"\n#include <nix\/util\/util.hpp>\n#include \"H5Exception.hpp\"\n\n\nnamespace nix {\nnamespace hdf5 {\n\noptGroup::optGroup(const H5Group &parent, const std::string &g_name)\n    : parent(parent), g_name(g_name)\n{}\n\nboost::optional<H5Group> optGroup::operator() (bool create) const {\n    if (parent.hasGroup(g_name)) {\n        g = boost::optional<H5Group>(parent.openGroup(g_name));\n    } else if (create) {\n        g = boost::optional<H5Group>(parent.openGroup(g_name, true));\n    }\n    return g;\n}\n\n\nH5Group::H5Group() : LocID() {}\n\n\nH5Group::H5Group(hid_t hid) : LocID(hid) {}\n\n\nH5Group::H5Group(const H5Group &other) : LocID(other) {}\n\n\nbool H5Group::hasObject(const std::string &name) const {\n    \/\/ empty string should return false, not exception (which H5Lexists would)\n    if (name.empty()) {\n        return false;\n    }\n\n    HTri res = H5Lexists(hid, name.c_str(), H5P_DEFAULT);\n    return res.check(\"H5Group::hasObject(): H5Lexists failed\");\n}\n\nbool H5Group::objectOfType(const std::string &name, H5O_type_t type) const {\n    H5O_info_t info;\n\n    hid_t obj = H5Oopen(hid, name.c_str(), H5P_DEFAULT);\n\n    if (!H5Iis_valid(obj)) {\n        return false;\n    }\n\n    HErr err = H5Oget_info(obj, &info);\n    err.check(\"Could not obtain object info\");\n\n    bool res = info.type == type;\n\n    H5Oclose(obj);\n    return res;\n}\n\nndsize_t H5Group::objectCount() const {\n    hsize_t n_objs;\n    HErr res = H5Gget_num_objs(hid, &n_objs);\n    res.check(\"Could not get object count\");\n    return n_objs;\n}\n\n\nboost::optional<H5Group> H5Group::findGroupByAttribute(const std::string &attribute, const std::string &value) const {\n    boost::optional<H5Group> ret;\n\n    \/\/ look up first direct sub-group that has given attribute with given value\n    for (ndsize_t index = 0; index < objectCount(); index++) {\n        std::string obj_name = objectName(index);\n        if(hasGroup(obj_name)) {\n            H5Group group = openGroup(obj_name, false);\n            if(group.hasAttr(attribute)) {\n                std::string attr_value;\n                group.getAttr(attribute, attr_value);\n                if (attr_value == value) {\n                    ret = group;\n                    break;\n                }\n            }\n        }\n    }\n\n    return ret;\n}\n\n\nboost::optional<DataSet> H5Group::findDataByAttribute(const std::string &attribute, const std::string &value) const {\n    std::vector<DataSet> dsets;\n    boost::optional<DataSet> ret;\n\n    \/\/ look up all direct sub-datasets that have the given attribute\n    for (ndsize_t index = 0; index < objectCount(); index++) {\n        std::string obj_name = objectName(index);\n        if(hasData(obj_name)) {\n            DataSet ds = openData(obj_name);\n\n            if (ds.hasAttr(attribute)) {\n                dsets.push_back(ds);\n            }\n        }\n    }\n    \/\/ look for first dataset with given attribute set to given value\n    auto found = std::find_if(dsets.begin(), dsets.end(),\n                 [value, attribute](DataSet &dset) {\n                     std::string attr_value;\n                     dset.getAttr(attribute, attr_value);\n                     return attr_value == value; });\n    if(found != dsets.end()) ret = *found;\n\n    return ret;\n}\n\n\nstd::string H5Group::objectName(ndsize_t index) const {\n    \/\/ check if index valid\n    if(index > objectCount()) {\n        throw OutOfBounds(\"No object at given index\",\n\t\t\t              static_cast<size_t>(index));\n    }\n\n    std::string str_name;\n    \/\/ check whether name is found by index\n    ssize_t name_len = H5Lget_name_by_idx(hid,\n                                          \".\",\n                                          H5_INDEX_NAME,\n                                          H5_ITER_NATIVE,\n                                          (hsize_t) index,\n                                          NULL,\n                                          0,\n                                          H5P_DEFAULT);\n    if (name_len > 0) {\n        char* name = new char[name_len+1];\n        name_len = H5Lget_name_by_idx(hid,\n                                      \".\",\n                                      H5_INDEX_NAME,\n                                      H5_ITER_NATIVE,\n                                      (hsize_t) index,\n                                      name,\n                                      name_len+1,\n                                      H5P_DEFAULT);\n        str_name = name;\n        delete [] name;\n    } else {\n        throw H5Exception(\"objectName: No object found, H5Lget_name_by_idx returned no name\");\n    }\n\n    return str_name;\n}\n\n\nbool H5Group::hasData(const std::string &name) const {\n    return hasObject(name) && objectOfType(name, H5O_TYPE_DATASET);\n}\n\n\nvoid H5Group::removeData(const std::string &name) {\n    if (hasData(name)) {\n        HErr res = H5Gunlink(hid, name.c_str());\n        res.check(\"H5Group::removeData(): Could not unlink DataSet\");\n    }\n}\n\n\nDataSet H5Group::createData(const std::string &name,\n                            const h5x::DataType &fileType,\n                            const NDSize &size,\n                            const NDSize &maxsize,\n                            NDSize chunks,\n                            bool max_size_unlimited,\n                            bool guess_chunks) const\n{\n    DataSpace space;\n\n    if (size) {\n        if (maxsize) {\n            space = DataSpace::create(size, maxsize);\n        } else {\n            space = DataSpace::create(size, max_size_unlimited);\n        }\n    }\n\n    H5Object dcpl = H5Pcreate(H5P_DATASET_CREATE);\n    dcpl.check(\"Could not create data creation plist\");\n\n    if (!chunks && guess_chunks) {\n        chunks = DataSet::guessChunking(size, fileType.size());\n    }\n\n    if (chunks) {\n        int rank = static_cast<int>(chunks.size());\n        HErr res = H5Pset_chunk(dcpl.h5id(), rank, chunks.data());\n        res.check(\"Could not set chunk size on data set creation plist\");\n    }\n\n    DataSet ds = H5Dcreate(hid, name.c_str(), fileType.h5id(), space.h5id(), H5P_DEFAULT, dcpl.h5id(), H5P_DEFAULT);\n    ds.check(\"H5Group::createData: Could not create DataSet with name \" + name);\n\n    return ds;\n}\n\n\nDataSet H5Group::openData(const std::string &name) const {\n    DataSet ds = H5Dopen(hid, name.c_str(), H5P_DEFAULT);\n    ds.check(\"H5Group::openData(): Could not open DataSet\");\n    return ds;\n}\n\n\nbool H5Group::hasGroup(const std::string &name) const {\n    return hasObject(name) && objectOfType(name, H5O_TYPE_GROUP);\n}\n\n\nH5Group H5Group::openGroup(const std::string &name, bool create) const {\n    check_h5_arg_name(name);\n\n    H5Group g;\n\n    if (hasGroup(name)) {\n        g = H5Group(H5Gopen(hid, name.c_str(), H5P_DEFAULT));\n        g.check(\"H5Group::openGroup(): Could not open group: \" + name);\n    } else if (create) {\n        H5Object gcpl = H5Pcreate(H5P_GROUP_CREATE);\n        gcpl.check(\"Unable to create group with name '\" + name + \"'! (H5Pcreate)\");\n\n        \/\/we want hdf5 to keep track of the order in which links were created so that\n        \/\/the order for indexed based accessors is stable cf. issue #387\n        HErr res = H5Pset_link_creation_order(gcpl.h5id(), H5P_CRT_ORDER_TRACKED|H5P_CRT_ORDER_INDEXED);\n        res.check(\"Unable to create group with name '\" + name + \"'! (H5Pset_link_cr...)\");\n\n        g = H5Group(H5Gcreate2(hid, name.c_str(), H5P_DEFAULT, gcpl.h5id(), H5P_DEFAULT));\n        g.check(\"Unable to create group with name '\" + name + \"'! (H5Gcreate2)\");\n\n    } else {\n        throw H5Exception(\"Unable to open group with name '\" + name + \"'!\");\n    }\n\n    return g;\n}\n\n\noptGroup H5Group::openOptGroup(const std::string &name) {\n    check_h5_arg_name(name);\n    return optGroup(*this, name);\n}\n\n\nvoid H5Group::removeGroup(const std::string &name) {\n    if (hasGroup(name))\n        H5Gunlink(hid, name.c_str());\n}\n\n\nvoid H5Group::renameGroup(const std::string &old_name, const std::string &new_name) {\n    check_h5_arg_name(new_name);\n\n    if (hasGroup(old_name)) {\n        H5Gmove(hid, old_name.c_str(), new_name.c_str()); \/\/FIXME: H5Gmove is deprecated\n    }\n}\n\n\nH5Group H5Group::createLink(const H5Group &target, const std::string &link_name) {\n    check_h5_arg_name(link_name);\n\n    HErr res = H5Lcreate_hard(target.hid, \".\", hid, link_name.c_str(),\n                              H5L_SAME_LOC, H5L_SAME_LOC);\n    res.check(\"Unable to create link \" + link_name);\n    return openGroup(link_name, false);\n}\n\n\/\/ TODO implement some kind of roll-back in order to avoid half renamed links.\nbool H5Group::renameAllLinks(const std::string &old_name, const std::string &new_name) {\n    check_h5_arg_name(new_name);\n\n    bool renamed = false;\n\n    if (hasGroup(old_name)) {\n        std::vector<std::string> links;\n\n        H5Group group     = openGroup(old_name, false);\n        std::string gname = group.name();\n\n        while (! gname.empty()) {\n            deleteLink(gname);\n            links.push_back(gname);\n            gname = group.name();\n        }\n\n        renamed = links.size() > 0;\n        for (std::string curr_name: links) {\n            size_t pos = curr_name.find_last_of('\/') + 1;\n\n            if (curr_name.substr(pos) == old_name) {\n                curr_name.replace(curr_name.begin() + pos, curr_name.end(), new_name.begin(), new_name.end());\n            }\n\n            HErr res = H5Lcreate_hard(group.hid, \".\", hid, curr_name.c_str(),\n                                      H5L_SAME_LOC, H5L_SAME_LOC);\n            renamed = renamed && res;\n        }\n    }\n\n    return renamed;\n}\n\n\/\/ TODO implement some kind of roll-back in order to avoid half removed links.\nbool H5Group::removeAllLinks(const std::string &name) {\n    bool removed = false;\n\n    if (hasGroup(name)) {\n        H5Group group      = openGroup(name, false);\n\n        std::string gname = group.name();\n\n        while (! gname.empty()) {\n            deleteLink(gname);\n            gname = group.name();\n        }\n\n        removed = true;\n    }\n\n    return removed;\n}\n\n\nboost::optional<H5Group> H5Group::findGroupByNameOrAttribute(std::string const &attr, std::string const &value) const {\n\n    if (hasObject(value)) {\n        return boost::make_optional(openGroup(value, false));\n    } else if (util::looksLikeUUID(value)) {\n        return findGroupByAttribute(attr, value);\n    } else {\n        return boost::optional<H5Group>();\n    }\n}\n\n\nboost::optional<DataSet> H5Group::findDataByNameOrAttribute(std::string const &attr, std::string const &value) const {\n\n    if (hasObject(value)) {\n        return boost::make_optional(openData(value));\n    } else if (util::looksLikeUUID(value)) {\n        return findDataByAttribute(attr, value);\n    } else {\n        return boost::optional<DataSet>();\n    }\n}\n\n\nH5Group::~H5Group()\n{}\n\n} \/\/ namespace hdf5\n} \/\/ namespace nix\n<commit_msg>Set Group iteration order to tracked creation order<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 \"H5Group.hpp\"\n#include <nix\/util\/util.hpp>\n#include \"H5Exception.hpp\"\n\n\nnamespace nix {\nnamespace hdf5 {\n\noptGroup::optGroup(const H5Group &parent, const std::string &g_name)\n    : parent(parent), g_name(g_name)\n{}\n\nboost::optional<H5Group> optGroup::operator() (bool create) const {\n    if (parent.hasGroup(g_name)) {\n        g = boost::optional<H5Group>(parent.openGroup(g_name));\n    } else if (create) {\n        g = boost::optional<H5Group>(parent.openGroup(g_name, true));\n    }\n    return g;\n}\n\n\nH5Group::H5Group() : LocID() {}\n\n\nH5Group::H5Group(hid_t hid) : LocID(hid) {}\n\n\nH5Group::H5Group(const H5Group &other) : LocID(other) {}\n\n\nbool H5Group::hasObject(const std::string &name) const {\n    \/\/ empty string should return false, not exception (which H5Lexists would)\n    if (name.empty()) {\n        return false;\n    }\n\n    HTri res = H5Lexists(hid, name.c_str(), H5P_DEFAULT);\n    return res.check(\"H5Group::hasObject(): H5Lexists failed\");\n}\n\nbool H5Group::objectOfType(const std::string &name, H5O_type_t type) const {\n    H5O_info_t info;\n\n    hid_t obj = H5Oopen(hid, name.c_str(), H5P_DEFAULT);\n\n    if (!H5Iis_valid(obj)) {\n        return false;\n    }\n\n    HErr err = H5Oget_info(obj, &info);\n    err.check(\"Could not obtain object info\");\n\n    bool res = info.type == type;\n\n    H5Oclose(obj);\n    return res;\n}\n\nndsize_t H5Group::objectCount() const {\n    hsize_t n_objs;\n    HErr res = H5Gget_num_objs(hid, &n_objs);\n    res.check(\"Could not get object count\");\n    return n_objs;\n}\n\n\nboost::optional<H5Group> H5Group::findGroupByAttribute(const std::string &attribute, const std::string &value) const {\n    boost::optional<H5Group> ret;\n\n    \/\/ look up first direct sub-group that has given attribute with given value\n    for (ndsize_t index = 0; index < objectCount(); index++) {\n        std::string obj_name = objectName(index);\n        if(hasGroup(obj_name)) {\n            H5Group group = openGroup(obj_name, false);\n            if(group.hasAttr(attribute)) {\n                std::string attr_value;\n                group.getAttr(attribute, attr_value);\n                if (attr_value == value) {\n                    ret = group;\n                    break;\n                }\n            }\n        }\n    }\n\n    return ret;\n}\n\n\nboost::optional<DataSet> H5Group::findDataByAttribute(const std::string &attribute, const std::string &value) const {\n    std::vector<DataSet> dsets;\n    boost::optional<DataSet> ret;\n\n    \/\/ look up all direct sub-datasets that have the given attribute\n    for (ndsize_t index = 0; index < objectCount(); index++) {\n        std::string obj_name = objectName(index);\n        if(hasData(obj_name)) {\n            DataSet ds = openData(obj_name);\n\n            if (ds.hasAttr(attribute)) {\n                dsets.push_back(ds);\n            }\n        }\n    }\n    \/\/ look for first dataset with given attribute set to given value\n    auto found = std::find_if(dsets.begin(), dsets.end(),\n                 [value, attribute](DataSet &dset) {\n                     std::string attr_value;\n                     dset.getAttr(attribute, attr_value);\n                     return attr_value == value; });\n    if(found != dsets.end()) ret = *found;\n\n    return ret;\n}\n\n\nstd::string H5Group::objectName(ndsize_t index) const {\n    \/\/ check if index valid\n    if(index > objectCount()) {\n        throw OutOfBounds(\"No object at given index\",\n\t\t\t              static_cast<size_t>(index));\n    }\n\n    std::string str_name;\n    \/\/ check whether name is found by index\n    ssize_t name_len = H5Lget_name_by_idx(hid,\n                                          \".\",\n                                          H5_INDEX_CRT_ORDER,\n                                          H5_ITER_INC,\n                                          (hsize_t) index,\n                                          NULL,\n                                          0,\n                                          H5P_DEFAULT);\n    if (name_len > 0) {\n        char* name = new char[name_len+1];\n        name_len = H5Lget_name_by_idx(hid,\n                                      \".\",\n                                      H5_INDEX_CRT_ORDER,\n                                      H5_ITER_INC,\n                                      (hsize_t) index,\n                                      name,\n                                      name_len+1,\n                                      H5P_DEFAULT);\n        str_name = name;\n        delete [] name;\n    } else {\n        throw H5Exception(\"objectName: No object found, H5Lget_name_by_idx returned no name\");\n    }\n\n    return str_name;\n}\n\n\nbool H5Group::hasData(const std::string &name) const {\n    return hasObject(name) && objectOfType(name, H5O_TYPE_DATASET);\n}\n\n\nvoid H5Group::removeData(const std::string &name) {\n    if (hasData(name)) {\n        HErr res = H5Gunlink(hid, name.c_str());\n        res.check(\"H5Group::removeData(): Could not unlink DataSet\");\n    }\n}\n\n\nDataSet H5Group::createData(const std::string &name,\n                            const h5x::DataType &fileType,\n                            const NDSize &size,\n                            const NDSize &maxsize,\n                            NDSize chunks,\n                            bool max_size_unlimited,\n                            bool guess_chunks) const\n{\n    DataSpace space;\n\n    if (size) {\n        if (maxsize) {\n            space = DataSpace::create(size, maxsize);\n        } else {\n            space = DataSpace::create(size, max_size_unlimited);\n        }\n    }\n\n    H5Object dcpl = H5Pcreate(H5P_DATASET_CREATE);\n    dcpl.check(\"Could not create data creation plist\");\n\n    if (!chunks && guess_chunks) {\n        chunks = DataSet::guessChunking(size, fileType.size());\n    }\n\n    if (chunks) {\n        int rank = static_cast<int>(chunks.size());\n        HErr res = H5Pset_chunk(dcpl.h5id(), rank, chunks.data());\n        res.check(\"Could not set chunk size on data set creation plist\");\n    }\n\n    DataSet ds = H5Dcreate(hid, name.c_str(), fileType.h5id(), space.h5id(), H5P_DEFAULT, dcpl.h5id(), H5P_DEFAULT);\n    ds.check(\"H5Group::createData: Could not create DataSet with name \" + name);\n\n    return ds;\n}\n\n\nDataSet H5Group::openData(const std::string &name) const {\n    DataSet ds = H5Dopen(hid, name.c_str(), H5P_DEFAULT);\n    ds.check(\"H5Group::openData(): Could not open DataSet\");\n    return ds;\n}\n\n\nbool H5Group::hasGroup(const std::string &name) const {\n    return hasObject(name) && objectOfType(name, H5O_TYPE_GROUP);\n}\n\n\nH5Group H5Group::openGroup(const std::string &name, bool create) const {\n    check_h5_arg_name(name);\n\n    H5Group g;\n\n    if (hasGroup(name)) {\n        g = H5Group(H5Gopen(hid, name.c_str(), H5P_DEFAULT));\n        g.check(\"H5Group::openGroup(): Could not open group: \" + name);\n    } else if (create) {\n        H5Object gcpl = H5Pcreate(H5P_GROUP_CREATE);\n        gcpl.check(\"Unable to create group with name '\" + name + \"'! (H5Pcreate)\");\n\n        \/\/we want hdf5 to keep track of the order in which links were created so that\n        \/\/the order for indexed based accessors is stable cf. issue #387\n        HErr res = H5Pset_link_creation_order(gcpl.h5id(), H5P_CRT_ORDER_TRACKED|H5P_CRT_ORDER_INDEXED);\n        res.check(\"Unable to create group with name '\" + name + \"'! (H5Pset_link_cr...)\");\n\n        g = H5Group(H5Gcreate2(hid, name.c_str(), H5P_DEFAULT, gcpl.h5id(), H5P_DEFAULT));\n        g.check(\"Unable to create group with name '\" + name + \"'! (H5Gcreate2)\");\n\n    } else {\n        throw H5Exception(\"Unable to open group with name '\" + name + \"'!\");\n    }\n\n    return g;\n}\n\n\noptGroup H5Group::openOptGroup(const std::string &name) {\n    check_h5_arg_name(name);\n    return optGroup(*this, name);\n}\n\n\nvoid H5Group::removeGroup(const std::string &name) {\n    if (hasGroup(name))\n        H5Gunlink(hid, name.c_str());\n}\n\n\nvoid H5Group::renameGroup(const std::string &old_name, const std::string &new_name) {\n    check_h5_arg_name(new_name);\n\n    if (hasGroup(old_name)) {\n        H5Gmove(hid, old_name.c_str(), new_name.c_str()); \/\/FIXME: H5Gmove is deprecated\n    }\n}\n\n\nH5Group H5Group::createLink(const H5Group &target, const std::string &link_name) {\n    check_h5_arg_name(link_name);\n\n    HErr res = H5Lcreate_hard(target.hid, \".\", hid, link_name.c_str(),\n                              H5L_SAME_LOC, H5L_SAME_LOC);\n    res.check(\"Unable to create link \" + link_name);\n    return openGroup(link_name, false);\n}\n\n\/\/ TODO implement some kind of roll-back in order to avoid half renamed links.\nbool H5Group::renameAllLinks(const std::string &old_name, const std::string &new_name) {\n    check_h5_arg_name(new_name);\n\n    bool renamed = false;\n\n    if (hasGroup(old_name)) {\n        std::vector<std::string> links;\n\n        H5Group group     = openGroup(old_name, false);\n        std::string gname = group.name();\n\n        while (! gname.empty()) {\n            deleteLink(gname);\n            links.push_back(gname);\n            gname = group.name();\n        }\n\n        renamed = links.size() > 0;\n        for (std::string curr_name: links) {\n            size_t pos = curr_name.find_last_of('\/') + 1;\n\n            if (curr_name.substr(pos) == old_name) {\n                curr_name.replace(curr_name.begin() + pos, curr_name.end(), new_name.begin(), new_name.end());\n            }\n\n            HErr res = H5Lcreate_hard(group.hid, \".\", hid, curr_name.c_str(),\n                                      H5L_SAME_LOC, H5L_SAME_LOC);\n            renamed = renamed && res;\n        }\n    }\n\n    return renamed;\n}\n\n\/\/ TODO implement some kind of roll-back in order to avoid half removed links.\nbool H5Group::removeAllLinks(const std::string &name) {\n    bool removed = false;\n\n    if (hasGroup(name)) {\n        H5Group group      = openGroup(name, false);\n\n        std::string gname = group.name();\n\n        while (! gname.empty()) {\n            deleteLink(gname);\n            gname = group.name();\n        }\n\n        removed = true;\n    }\n\n    return removed;\n}\n\n\nboost::optional<H5Group> H5Group::findGroupByNameOrAttribute(std::string const &attr, std::string const &value) const {\n\n    if (hasObject(value)) {\n        return boost::make_optional(openGroup(value, false));\n    } else if (util::looksLikeUUID(value)) {\n        return findGroupByAttribute(attr, value);\n    } else {\n        return boost::optional<H5Group>();\n    }\n}\n\n\nboost::optional<DataSet> H5Group::findDataByNameOrAttribute(std::string const &attr, std::string const &value) const {\n\n    if (hasObject(value)) {\n        return boost::make_optional(openData(value));\n    } else if (util::looksLikeUUID(value)) {\n        return findDataByAttribute(attr, value);\n    } else {\n        return boost::optional<DataSet>();\n    }\n}\n\n\nH5Group::~H5Group()\n{}\n\n} \/\/ namespace hdf5\n} \/\/ namespace nix\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"CppUnitTest.h\"\n\n\nusing namespace Microsoft::VisualStudio::CppUnitTestFramework;\nusing namespace NP_DATETIME;\n\nnamespace CSS133Assignment1Tests\n{\t\t\n\tTEST_CLASS(CTimeTests)\n\t{\n\tpublic:\n\t\t\n\t\tTEST_METHOD(EmptyConstructorTest)\n\t\t{\n\t\t\tvalidateTime(CTime());\n\t\t}\n\n\t\tTEST_METHOD(MaxHourConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(23);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)23);\n\t\t}\n\n\t\tTEST_METHOD(OverflowMaxHourConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(24);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreNotEqual(time.getHour(), (short)24);\n\t\t}\n\n\t\tTEST_METHOD(MaxMinuteConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(1, 59);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)1);\n\t\t\tAssert::AreEqual(time.getMinute(), (short)59);\n\t\t}\n\n\t\tTEST_METHOD(OverflowMaxMinuteConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(1, 60);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)1);\n\t\t\tAssert::AreNotEqual(time.getMinute(), (short)60);\n\t\t}\n\n\t\tTEST_METHOD(MaxSecondConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(1, 1, 59);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)1);\n\t\t\tAssert::AreEqual(time.getMinute(), (short)1);\n\t\t\tAssert::AreEqual(time.getSecond(), (short)59);\n\t\t}\n\n\t\tTEST_METHOD(OverflowMaxSecondConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(1, 1, 60);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)1);\n\t\t\tAssert::AreEqual(time.getMinute(), (short)1);\n\t\t\tAssert::AreNotEqual(time.getSecond(), (short)60);\n\t\t}\n\n\t\tTEST_METHOD(SetHourValidValues)\n\t\t{\n\t\t\tCTime time = CTime(0,0,0);\n\t\t\tfor (short hour = 0; hour < 24; hour++) {\n\t\t\t\ttime.setHour(hour);\n\t\t\t\tvalidateTime(time);\n\t\t\t\tAssert::AreEqual(time.getHour(), hour);\n\t\t\t}\n\t\t}\n\n\t\t\/*TEST_METHOD(SetHourInValidValues)\n\t\t{\n\t\t\tCTime time = CTime(0, 0, 0);\n\t\t\tfor (short hour = 0; hour < 24; hour++) {\n\t\t\t\ttime.setHour(hour);\n\t\t\t\tvalidateTime(time);\n\t\t\t\tAssert::AreEqual(time.getHour(), hour);\n\t\t\t}\n\t\t}*\/\n\n\tprivate:\n\t\tvoid validateTime(CTime time) {\n\t\t\tAssert::IsTrue(time.getHour() >= 0 && time.getHour() < 24);\n\t\t\tAssert::IsTrue(time.getMinute() >= 0 && time.getMinute() < 60);\n\t\t\tAssert::IsTrue(time.getSecond() >= 0 && time.getSecond() < 60);\n\t\t}\n\t\t\n\t};\n}<commit_msg>Minute validation tests<commit_after>#include \"stdafx.h\"\n#include \"CppUnitTest.h\"\n\n\nusing namespace Microsoft::VisualStudio::CppUnitTestFramework;\nusing namespace NP_DATETIME;\n\nnamespace CSS133Assignment1Tests\n{\t\t\n\tTEST_CLASS(CTimeTests)\n\t{\n\tpublic:\n\t\t\n\t\tTEST_METHOD(EmptyConstructorTest)\n\t\t{\n\t\t\tvalidateTime(CTime());\n\t\t}\n\n\t\tTEST_METHOD(MaxHourConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(23);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)23);\n\t\t}\n\n\t\tTEST_METHOD(OverflowMaxHourConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(24);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreNotEqual(time.getHour(), (short)24);\n\t\t}\n\n\t\tTEST_METHOD(MaxMinuteConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(1, 59);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)1);\n\t\t\tAssert::AreEqual(time.getMinute(), (short)59);\n\t\t}\n\n\t\tTEST_METHOD(OverflowMaxMinuteConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(1, 60);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)1);\n\t\t\tAssert::AreNotEqual(time.getMinute(), (short)60);\n\t\t}\n\n\t\tTEST_METHOD(MaxSecondConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(1, 1, 59);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)1);\n\t\t\tAssert::AreEqual(time.getMinute(), (short)1);\n\t\t\tAssert::AreEqual(time.getSecond(), (short)59);\n\t\t}\n\n\t\tTEST_METHOD(OverflowMaxSecondConstructorTest)\n\t\t{\n\t\t\tCTime time = CTime(1, 1, 60);\n\t\t\tvalidateTime(time);\n\t\t\tAssert::AreEqual(time.getHour(), (short)1);\n\t\t\tAssert::AreEqual(time.getMinute(), (short)1);\n\t\t\tAssert::AreNotEqual(time.getSecond(), (short)60);\n\t\t}\n\n\t\tTEST_METHOD(SetHourValidValues)\n\t\t{\n\t\t\tCTime time = CTime(0,0,0);\n\t\t\tfor (short hour = 0; hour < 24; hour++) {\n\t\t\t\ttime.setHour(hour);\n\t\t\t\tvalidateTime(time);\n\t\t\t\tAssert::AreEqual(time.getHour(), hour);\n\t\t\t}\n\t\t}\n\n\t\tTEST_METHOD(SetHourInValidValues)\n\t\t{\n\t\t\tCTime time = CTime(0, 0, 0);\n\t\t\tfor (short hour = 24; hour < 100; hour++) {\n\t\t\t\ttime.setHour(hour);\n\t\t\t\tvalidateTime(time);\n\t\t\t\tAssert::AreEqual(time.getHour(), (short)0);\n\t\t\t}\n\t\t}\n\n\t\tTEST_METHOD(SetMinuteValidValues)\n\t\t{\n\t\t\tCTime time = CTime(0, 0, 0);\n\t\t\tfor (short minute = 0; minute < 60; minute++) {\n\t\t\t\ttime.setMinute(minute);\n\t\t\t\tvalidateTime(time);\n\t\t\t\tAssert::AreEqual(time.getMinute(), minute);\n\t\t\t}\n\t\t}\n\n\t\tTEST_METHOD(SetMinuteInValidValues)\n\t\t{\n\t\t\tCTime time = CTime(0, 0, 0);\n\t\t\tfor (short minute = 60; minute < 100; minute++) {\n\t\t\t\ttime.setMinute(minute);\n\t\t\t\tvalidateTime(time);\n\t\t\t\tAssert::AreEqual(time.getMinute(), (short)0);\n\t\t\t}\n\t\t}\n\n\tprivate:\n\t\tvoid validateTime(CTime time) {\n\t\t\tAssert::IsTrue(time.getHour() >= 0 && time.getHour() < 24);\n\t\t\tAssert::IsTrue(time.getMinute() >= 0 && time.getMinute() < 60);\n\t\t\tAssert::IsTrue(time.getSecond() >= 0 && time.getSecond() < 60);\n\t\t}\n\t\t\n\t};\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#if defined(OS_WIN)\n#include <process.h>\n#include <windows.h>\n#endif\n\n#include \"base\/multiprocess_test.h\"\n#include \"base\/platform_thread.h\"\n#include \"base\/simple_thread.h\"\n#include \"base\/shared_memory.h\"\n#include \"base\/stats_table.h\"\n#include \"base\/stats_counters.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"testing\/multiprocess_func_list.h\"\n\nnamespace base {\n\nclass StatsTableTest : public MultiProcessTest {\n public:\n  void DeleteShmem(std::string name) {\n    base::SharedMemory mem;\n    mem.Delete(UTF8ToWide(name));\n  }\n};\n\n\/\/ Open a StatsTable and verify that we can write to each of the\n\/\/ locations in the table.\nTEST_F(StatsTableTest, VerifySlots) {\n  const std::string kTableName = \"VerifySlotsStatTable\";\n  const int kMaxThreads = 1;\n  const int kMaxCounter = 5;\n  DeleteShmem(kTableName);\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n\n  \/\/ Register a single thread.\n  std::string thread_name = \"mainThread\";\n  int slot_id = table.RegisterThread(thread_name);\n  EXPECT_NE(slot_id, 0);\n\n  \/\/ Fill up the table with counters.\n  std::string counter_base_name = \"counter\";\n  for (int index = 0; index < kMaxCounter; index++) {\n    std::string counter_name = counter_base_name;\n    StringAppendF(&counter_name, \"counter.ctr%d\", index);\n    int counter_id = table.FindCounter(counter_name);\n    EXPECT_GT(counter_id, 0);\n  }\n\n  \/\/ Try to allocate an additional thread.  Verify it fails.\n  slot_id = table.RegisterThread(\"too many threads\");\n  EXPECT_EQ(slot_id, 0);\n\n  \/\/ Try to allocate an additional counter.  Verify it fails.\n  int counter_id = table.FindCounter(counter_base_name);\n  EXPECT_EQ(counter_id, 0);\n\n  DeleteShmem(kTableName);\n}\n\n\/\/ CounterZero will continually be set to 0.\nconst std::string kCounterZero = \"CounterZero\";\n\/\/ Counter1313 will continually be set to 1313.\nconst std::string kCounter1313 = \"Counter1313\";\n\/\/ CounterIncrement will be incremented each time.\nconst std::string kCounterIncrement = \"CounterIncrement\";\n\/\/ CounterDecrement will be decremented each time.\nconst std::string kCounterDecrement = \"CounterDecrement\";\n\/\/ CounterMixed will be incremented by odd numbered threads and\n\/\/ decremented by even threads.\nconst std::string kCounterMixed = \"CounterMixed\";\n\/\/ The number of thread loops that we will do.\nconst int kThreadLoops = 1000;\n\nclass StatsTableThread : public base::SimpleThread {\n public:\n  StatsTableThread(std::string name, int id)\n      : base::SimpleThread(name), id_(id) { }\n  virtual void Run();\n private:\n  int id_;\n};\n\nvoid StatsTableThread::Run() {\n  \/\/ Each thread will open the shared memory and set counters\n  \/\/ concurrently in a loop.  We'll use some pauses to\n  \/\/ mixup the thread scheduling.\n\n  StatsCounter zero_counter(kCounterZero);\n  StatsCounter lucky13_counter(kCounter1313);\n  StatsCounter increment_counter(kCounterIncrement);\n  StatsCounter decrement_counter(kCounterDecrement);\n  for (int index = 0; index < kThreadLoops; index++) {\n    StatsCounter mixed_counter(kCounterMixed);  \/\/ create this one in the loop\n    zero_counter.Set(0);\n    lucky13_counter.Set(1313);\n    increment_counter.Increment();\n    decrement_counter.Decrement();\n    if (id_ % 2)\n      mixed_counter.Decrement();\n    else\n      mixed_counter.Increment();\n    PlatformThread::Sleep(index % 10);   \/\/ short wait\n  }\n}\n\n\/\/ Create a few threads and have them poke on their counters.\n\/\/ Disabled, http:\/\/crbug.com\/10611.\nTEST_F(StatsTableTest, DISABLED_MultipleThreads) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"MultipleThreadStatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  DeleteShmem(kTableName);\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  EXPECT_EQ(0, table.CountThreadsRegistered());\n\n  \/\/ Spin up a set of threads to go bang on the various counters.\n  \/\/ After we join the threads, we'll make sure the counters\n  \/\/ contain the values we expected.\n  StatsTableThread* threads[kMaxThreads];\n\n  \/\/ Spawn the threads.\n  for (int index = 0; index < kMaxThreads; index++) {\n    threads[index] = new StatsTableThread(\"MultipleThreadsTest\", index);\n    threads[index]->Start();\n  }\n\n  \/\/ Wait for the threads to finish.\n  for (int index = 0; index < kMaxThreads; index++) {\n    threads[index]->Join();\n    delete threads[index];\n  }\n\n  StatsCounter zero_counter(kCounterZero);\n  StatsCounter lucky13_counter(kCounter1313);\n  StatsCounter increment_counter(kCounterIncrement);\n  StatsCounter decrement_counter(kCounterDecrement);\n  StatsCounter mixed_counter(kCounterMixed);\n\n  \/\/ Verify the various counters are correct.\n  std::string name;\n  name = \"c:\" + kCounterZero;\n  EXPECT_EQ(0, table.GetCounterValue(name));\n  name = \"c:\" + kCounter1313;\n  EXPECT_EQ(1313 * kMaxThreads,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterIncrement;\n  EXPECT_EQ(kMaxThreads * kThreadLoops,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterDecrement;\n  EXPECT_EQ(-kMaxThreads * kThreadLoops,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterMixed;\n  EXPECT_EQ((kMaxThreads % 2) * kThreadLoops,\n      table.GetCounterValue(name));\n  EXPECT_EQ(0, table.CountThreadsRegistered());\n\n  DeleteShmem(kTableName);\n}\n\nconst std::string kMPTableName = \"MultipleProcessStatTable\";\n\nMULTIPROCESS_TEST_MAIN(StatsTableMultipleProcessMain) {\n  \/\/ Each process will open the shared memory and set counters\n  \/\/ concurrently in a loop.  We'll use some pauses to\n  \/\/ mixup the scheduling.\n\n  StatsTable table(kMPTableName, 0, 0);\n  StatsTable::set_current(&table);\n  StatsCounter zero_counter(kCounterZero);\n  StatsCounter lucky13_counter(kCounter1313);\n  StatsCounter increment_counter(kCounterIncrement);\n  StatsCounter decrement_counter(kCounterDecrement);\n  for (int index = 0; index < kThreadLoops; index++) {\n    zero_counter.Set(0);\n    lucky13_counter.Set(1313);\n    increment_counter.Increment();\n    decrement_counter.Decrement();\n    PlatformThread::Sleep(index % 10);   \/\/ short wait\n  }\n  return 0;\n}\n\n\/\/ Create a few processes and have them poke on their counters.\nTEST_F(StatsTableTest, MultipleProcesses) {\n  \/\/ Create a stats table.\n  const int kMaxProcs = 20;\n  const int kMaxCounter = 5;\n  DeleteShmem(kMPTableName);\n  StatsTable table(kMPTableName, kMaxProcs, kMaxCounter);\n  StatsTable::set_current(&table);\n  EXPECT_EQ(0, table.CountThreadsRegistered());\n\n  \/\/ Spin up a set of processes to go bang on the various counters.\n  \/\/ After we join the processes, we'll make sure the counters\n  \/\/ contain the values we expected.\n  ProcessHandle procs[kMaxProcs];\n\n  \/\/ Spawn the processes.\n  for (int16 index = 0; index < kMaxProcs; index++) {\n    procs[index] = this->SpawnChild(L\"StatsTableMultipleProcessMain\");\n    EXPECT_NE(base::kNullProcessHandle, procs[index]);\n  }\n\n  \/\/ Wait for the processes to finish.\n  for (int index = 0; index < kMaxProcs; index++) {\n    EXPECT_TRUE(WaitForSingleProcess(procs[index], 60 * 1000));\n    base::CloseProcessHandle(procs[index]);\n  }\n\n  StatsCounter zero_counter(kCounterZero);\n  StatsCounter lucky13_counter(kCounter1313);\n  StatsCounter increment_counter(kCounterIncrement);\n  StatsCounter decrement_counter(kCounterDecrement);\n\n  \/\/ Verify the various counters are correct.\n  std::string name;\n  name = \"c:\" + kCounterZero;\n  EXPECT_EQ(0, table.GetCounterValue(name));\n  name = \"c:\" + kCounter1313;\n  EXPECT_EQ(1313 * kMaxProcs,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterIncrement;\n  EXPECT_EQ(kMaxProcs * kThreadLoops,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterDecrement;\n  EXPECT_EQ(-kMaxProcs * kThreadLoops,\n      table.GetCounterValue(name));\n  EXPECT_EQ(0, table.CountThreadsRegistered());\n\n  DeleteShmem(kMPTableName);\n}\n\nclass MockStatsCounter : public StatsCounter {\n public:\n  explicit MockStatsCounter(const std::string& name)\n      : StatsCounter(name) {}\n  int* Pointer() { return GetPtr(); }\n};\n\n\/\/ Test some basic StatsCounter operations\nTEST_F(StatsTableTest, StatsCounter) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"StatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  DeleteShmem(kTableName);\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  MockStatsCounter foo(\"foo\");\n\n  \/\/ Test initial state.\n  EXPECT_TRUE(foo.Enabled());\n  ASSERT_NE(foo.Pointer(), static_cast<int*>(0));\n  EXPECT_EQ(0, *(foo.Pointer()));\n  EXPECT_EQ(0, table.GetCounterValue(\"c:foo\"));\n\n  \/\/ Test Increment.\n  while (*(foo.Pointer()) < 123) foo.Increment();\n  EXPECT_EQ(123, table.GetCounterValue(\"c:foo\"));\n  foo.Add(0);\n  EXPECT_EQ(123, table.GetCounterValue(\"c:foo\"));\n  foo.Add(-1);\n  EXPECT_EQ(122, table.GetCounterValue(\"c:foo\"));\n\n  \/\/ Test Set.\n  foo.Set(0);\n  EXPECT_EQ(0, table.GetCounterValue(\"c:foo\"));\n  foo.Set(100);\n  EXPECT_EQ(100, table.GetCounterValue(\"c:foo\"));\n  foo.Set(-1);\n  EXPECT_EQ(-1, table.GetCounterValue(\"c:foo\"));\n  foo.Set(0);\n  EXPECT_EQ(0, table.GetCounterValue(\"c:foo\"));\n\n  \/\/ Test Decrement.\n  foo.Subtract(1);\n  EXPECT_EQ(-1, table.GetCounterValue(\"c:foo\"));\n  foo.Subtract(0);\n  EXPECT_EQ(-1, table.GetCounterValue(\"c:foo\"));\n  foo.Subtract(-1);\n  EXPECT_EQ(0, table.GetCounterValue(\"c:foo\"));\n\n  DeleteShmem(kTableName);\n}\n\nclass MockStatsCounterTimer : public StatsCounterTimer {\n public:\n  explicit MockStatsCounterTimer(const std::string& name)\n      : StatsCounterTimer(name) {}\n\n  TimeTicks start_time() { return start_time_; }\n  TimeTicks stop_time() { return stop_time_; }\n};\n\n\/\/ Test some basic StatsCounterTimer operations\nTEST_F(StatsTableTest, StatsCounterTimer) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"StatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  MockStatsCounterTimer bar(\"bar\");\n\n  \/\/ Test initial state.\n  EXPECT_FALSE(bar.Running());\n  EXPECT_TRUE(bar.start_time().is_null());\n  EXPECT_TRUE(bar.stop_time().is_null());\n\n  \/\/ Do some timing.\n  bar.Start();\n  PlatformThread::Sleep(500);\n  bar.Stop();\n  EXPECT_LE(500, table.GetCounterValue(\"t:bar\"));\n\n  \/\/ Verify that timing again is additive.\n  bar.Start();\n  PlatformThread::Sleep(500);\n  bar.Stop();\n  EXPECT_LE(1000, table.GetCounterValue(\"t:bar\"));\n}\n\n\/\/ Test some basic StatsRate operations\nTEST_F(StatsTableTest, StatsRate) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"StatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  StatsRate baz(\"baz\");\n\n  \/\/ Test initial state.\n  EXPECT_FALSE(baz.Running());\n  EXPECT_EQ(0, table.GetCounterValue(\"c:baz\"));\n  EXPECT_EQ(0, table.GetCounterValue(\"t:baz\"));\n\n  \/\/ Do some timing.\n  baz.Start();\n  PlatformThread::Sleep(500);\n  baz.Stop();\n  EXPECT_EQ(1, table.GetCounterValue(\"c:baz\"));\n  EXPECT_LE(500, table.GetCounterValue(\"t:baz\"));\n\n  \/\/ Verify that timing again is additive.\n  baz.Start();\n  PlatformThread::Sleep(500);\n  baz.Stop();\n  EXPECT_EQ(2, table.GetCounterValue(\"c:baz\"));\n  EXPECT_LE(1000, table.GetCounterValue(\"t:baz\"));\n}\n\n\/\/ Test some basic StatsScope operations\nTEST_F(StatsTableTest, StatsScope) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"StatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  DeleteShmem(kTableName);\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  StatsCounterTimer foo(\"foo\");\n  StatsRate bar(\"bar\");\n\n  \/\/ Test initial state.\n  EXPECT_EQ(0, table.GetCounterValue(\"t:foo\"));\n  EXPECT_EQ(0, table.GetCounterValue(\"t:bar\"));\n  EXPECT_EQ(0, table.GetCounterValue(\"c:bar\"));\n\n  \/\/ Try a scope.\n  {\n    StatsScope<StatsCounterTimer> timer(foo);\n    StatsScope<StatsRate> timer2(bar);\n    PlatformThread::Sleep(500);\n  }\n  EXPECT_LE(500, table.GetCounterValue(\"t:foo\"));\n  EXPECT_LE(500, table.GetCounterValue(\"t:bar\"));\n  EXPECT_EQ(1, table.GetCounterValue(\"c:bar\"));\n\n  \/\/ Try a second scope.\n  {\n    StatsScope<StatsCounterTimer> timer(foo);\n    StatsScope<StatsRate> timer2(bar);\n    PlatformThread::Sleep(500);\n  }\n  EXPECT_LE(1000, table.GetCounterValue(\"t:foo\"));\n  EXPECT_LE(1000, table.GetCounterValue(\"t:bar\"));\n  EXPECT_EQ(2, table.GetCounterValue(\"c:bar\"));\n\n  DeleteShmem(kTableName);\n}\n\n}  \/\/ namespace base\n<commit_msg>TTF: Re-enable StatsTableTest.MultipleThreads by marking it 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#if defined(OS_WIN)\n#include <process.h>\n#include <windows.h>\n#endif\n\n#include \"base\/multiprocess_test.h\"\n#include \"base\/platform_thread.h\"\n#include \"base\/simple_thread.h\"\n#include \"base\/shared_memory.h\"\n#include \"base\/stats_table.h\"\n#include \"base\/stats_counters.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"testing\/multiprocess_func_list.h\"\n\nnamespace base {\n\nclass StatsTableTest : public MultiProcessTest {\n public:\n  void DeleteShmem(std::string name) {\n    base::SharedMemory mem;\n    mem.Delete(UTF8ToWide(name));\n  }\n};\n\n\/\/ Open a StatsTable and verify that we can write to each of the\n\/\/ locations in the table.\nTEST_F(StatsTableTest, VerifySlots) {\n  const std::string kTableName = \"VerifySlotsStatTable\";\n  const int kMaxThreads = 1;\n  const int kMaxCounter = 5;\n  DeleteShmem(kTableName);\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n\n  \/\/ Register a single thread.\n  std::string thread_name = \"mainThread\";\n  int slot_id = table.RegisterThread(thread_name);\n  EXPECT_NE(slot_id, 0);\n\n  \/\/ Fill up the table with counters.\n  std::string counter_base_name = \"counter\";\n  for (int index = 0; index < kMaxCounter; index++) {\n    std::string counter_name = counter_base_name;\n    StringAppendF(&counter_name, \"counter.ctr%d\", index);\n    int counter_id = table.FindCounter(counter_name);\n    EXPECT_GT(counter_id, 0);\n  }\n\n  \/\/ Try to allocate an additional thread.  Verify it fails.\n  slot_id = table.RegisterThread(\"too many threads\");\n  EXPECT_EQ(slot_id, 0);\n\n  \/\/ Try to allocate an additional counter.  Verify it fails.\n  int counter_id = table.FindCounter(counter_base_name);\n  EXPECT_EQ(counter_id, 0);\n\n  DeleteShmem(kTableName);\n}\n\n\/\/ CounterZero will continually be set to 0.\nconst std::string kCounterZero = \"CounterZero\";\n\/\/ Counter1313 will continually be set to 1313.\nconst std::string kCounter1313 = \"Counter1313\";\n\/\/ CounterIncrement will be incremented each time.\nconst std::string kCounterIncrement = \"CounterIncrement\";\n\/\/ CounterDecrement will be decremented each time.\nconst std::string kCounterDecrement = \"CounterDecrement\";\n\/\/ CounterMixed will be incremented by odd numbered threads and\n\/\/ decremented by even threads.\nconst std::string kCounterMixed = \"CounterMixed\";\n\/\/ The number of thread loops that we will do.\nconst int kThreadLoops = 1000;\n\nclass StatsTableThread : public base::SimpleThread {\n public:\n  StatsTableThread(std::string name, int id)\n      : base::SimpleThread(name), id_(id) { }\n  virtual void Run();\n private:\n  int id_;\n};\n\nvoid StatsTableThread::Run() {\n  \/\/ Each thread will open the shared memory and set counters\n  \/\/ concurrently in a loop.  We'll use some pauses to\n  \/\/ mixup the thread scheduling.\n\n  StatsCounter zero_counter(kCounterZero);\n  StatsCounter lucky13_counter(kCounter1313);\n  StatsCounter increment_counter(kCounterIncrement);\n  StatsCounter decrement_counter(kCounterDecrement);\n  for (int index = 0; index < kThreadLoops; index++) {\n    StatsCounter mixed_counter(kCounterMixed);  \/\/ create this one in the loop\n    zero_counter.Set(0);\n    lucky13_counter.Set(1313);\n    increment_counter.Increment();\n    decrement_counter.Decrement();\n    if (id_ % 2)\n      mixed_counter.Decrement();\n    else\n      mixed_counter.Increment();\n    PlatformThread::Sleep(index % 10);   \/\/ short wait\n  }\n}\n\n\/\/ Create a few threads and have them poke on their counters.\n\/\/ Flaky, http:\/\/crbug.com\/10611.\nTEST_F(StatsTableTest, FLAKY_MultipleThreads) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"MultipleThreadStatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  DeleteShmem(kTableName);\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  EXPECT_EQ(0, table.CountThreadsRegistered());\n\n  \/\/ Spin up a set of threads to go bang on the various counters.\n  \/\/ After we join the threads, we'll make sure the counters\n  \/\/ contain the values we expected.\n  StatsTableThread* threads[kMaxThreads];\n\n  \/\/ Spawn the threads.\n  for (int index = 0; index < kMaxThreads; index++) {\n    threads[index] = new StatsTableThread(\"MultipleThreadsTest\", index);\n    threads[index]->Start();\n  }\n\n  \/\/ Wait for the threads to finish.\n  for (int index = 0; index < kMaxThreads; index++) {\n    threads[index]->Join();\n    delete threads[index];\n  }\n\n  StatsCounter zero_counter(kCounterZero);\n  StatsCounter lucky13_counter(kCounter1313);\n  StatsCounter increment_counter(kCounterIncrement);\n  StatsCounter decrement_counter(kCounterDecrement);\n  StatsCounter mixed_counter(kCounterMixed);\n\n  \/\/ Verify the various counters are correct.\n  std::string name;\n  name = \"c:\" + kCounterZero;\n  EXPECT_EQ(0, table.GetCounterValue(name));\n  name = \"c:\" + kCounter1313;\n  EXPECT_EQ(1313 * kMaxThreads,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterIncrement;\n  EXPECT_EQ(kMaxThreads * kThreadLoops,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterDecrement;\n  EXPECT_EQ(-kMaxThreads * kThreadLoops,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterMixed;\n  EXPECT_EQ((kMaxThreads % 2) * kThreadLoops,\n      table.GetCounterValue(name));\n  EXPECT_EQ(0, table.CountThreadsRegistered());\n\n  DeleteShmem(kTableName);\n}\n\nconst std::string kMPTableName = \"MultipleProcessStatTable\";\n\nMULTIPROCESS_TEST_MAIN(StatsTableMultipleProcessMain) {\n  \/\/ Each process will open the shared memory and set counters\n  \/\/ concurrently in a loop.  We'll use some pauses to\n  \/\/ mixup the scheduling.\n\n  StatsTable table(kMPTableName, 0, 0);\n  StatsTable::set_current(&table);\n  StatsCounter zero_counter(kCounterZero);\n  StatsCounter lucky13_counter(kCounter1313);\n  StatsCounter increment_counter(kCounterIncrement);\n  StatsCounter decrement_counter(kCounterDecrement);\n  for (int index = 0; index < kThreadLoops; index++) {\n    zero_counter.Set(0);\n    lucky13_counter.Set(1313);\n    increment_counter.Increment();\n    decrement_counter.Decrement();\n    PlatformThread::Sleep(index % 10);   \/\/ short wait\n  }\n  return 0;\n}\n\n\/\/ Create a few processes and have them poke on their counters.\nTEST_F(StatsTableTest, MultipleProcesses) {\n  \/\/ Create a stats table.\n  const int kMaxProcs = 20;\n  const int kMaxCounter = 5;\n  DeleteShmem(kMPTableName);\n  StatsTable table(kMPTableName, kMaxProcs, kMaxCounter);\n  StatsTable::set_current(&table);\n  EXPECT_EQ(0, table.CountThreadsRegistered());\n\n  \/\/ Spin up a set of processes to go bang on the various counters.\n  \/\/ After we join the processes, we'll make sure the counters\n  \/\/ contain the values we expected.\n  ProcessHandle procs[kMaxProcs];\n\n  \/\/ Spawn the processes.\n  for (int16 index = 0; index < kMaxProcs; index++) {\n    procs[index] = this->SpawnChild(L\"StatsTableMultipleProcessMain\");\n    EXPECT_NE(base::kNullProcessHandle, procs[index]);\n  }\n\n  \/\/ Wait for the processes to finish.\n  for (int index = 0; index < kMaxProcs; index++) {\n    EXPECT_TRUE(WaitForSingleProcess(procs[index], 60 * 1000));\n    base::CloseProcessHandle(procs[index]);\n  }\n\n  StatsCounter zero_counter(kCounterZero);\n  StatsCounter lucky13_counter(kCounter1313);\n  StatsCounter increment_counter(kCounterIncrement);\n  StatsCounter decrement_counter(kCounterDecrement);\n\n  \/\/ Verify the various counters are correct.\n  std::string name;\n  name = \"c:\" + kCounterZero;\n  EXPECT_EQ(0, table.GetCounterValue(name));\n  name = \"c:\" + kCounter1313;\n  EXPECT_EQ(1313 * kMaxProcs,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterIncrement;\n  EXPECT_EQ(kMaxProcs * kThreadLoops,\n      table.GetCounterValue(name));\n  name = \"c:\" + kCounterDecrement;\n  EXPECT_EQ(-kMaxProcs * kThreadLoops,\n      table.GetCounterValue(name));\n  EXPECT_EQ(0, table.CountThreadsRegistered());\n\n  DeleteShmem(kMPTableName);\n}\n\nclass MockStatsCounter : public StatsCounter {\n public:\n  explicit MockStatsCounter(const std::string& name)\n      : StatsCounter(name) {}\n  int* Pointer() { return GetPtr(); }\n};\n\n\/\/ Test some basic StatsCounter operations\nTEST_F(StatsTableTest, StatsCounter) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"StatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  DeleteShmem(kTableName);\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  MockStatsCounter foo(\"foo\");\n\n  \/\/ Test initial state.\n  EXPECT_TRUE(foo.Enabled());\n  ASSERT_NE(foo.Pointer(), static_cast<int*>(0));\n  EXPECT_EQ(0, *(foo.Pointer()));\n  EXPECT_EQ(0, table.GetCounterValue(\"c:foo\"));\n\n  \/\/ Test Increment.\n  while (*(foo.Pointer()) < 123) foo.Increment();\n  EXPECT_EQ(123, table.GetCounterValue(\"c:foo\"));\n  foo.Add(0);\n  EXPECT_EQ(123, table.GetCounterValue(\"c:foo\"));\n  foo.Add(-1);\n  EXPECT_EQ(122, table.GetCounterValue(\"c:foo\"));\n\n  \/\/ Test Set.\n  foo.Set(0);\n  EXPECT_EQ(0, table.GetCounterValue(\"c:foo\"));\n  foo.Set(100);\n  EXPECT_EQ(100, table.GetCounterValue(\"c:foo\"));\n  foo.Set(-1);\n  EXPECT_EQ(-1, table.GetCounterValue(\"c:foo\"));\n  foo.Set(0);\n  EXPECT_EQ(0, table.GetCounterValue(\"c:foo\"));\n\n  \/\/ Test Decrement.\n  foo.Subtract(1);\n  EXPECT_EQ(-1, table.GetCounterValue(\"c:foo\"));\n  foo.Subtract(0);\n  EXPECT_EQ(-1, table.GetCounterValue(\"c:foo\"));\n  foo.Subtract(-1);\n  EXPECT_EQ(0, table.GetCounterValue(\"c:foo\"));\n\n  DeleteShmem(kTableName);\n}\n\nclass MockStatsCounterTimer : public StatsCounterTimer {\n public:\n  explicit MockStatsCounterTimer(const std::string& name)\n      : StatsCounterTimer(name) {}\n\n  TimeTicks start_time() { return start_time_; }\n  TimeTicks stop_time() { return stop_time_; }\n};\n\n\/\/ Test some basic StatsCounterTimer operations\nTEST_F(StatsTableTest, StatsCounterTimer) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"StatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  MockStatsCounterTimer bar(\"bar\");\n\n  \/\/ Test initial state.\n  EXPECT_FALSE(bar.Running());\n  EXPECT_TRUE(bar.start_time().is_null());\n  EXPECT_TRUE(bar.stop_time().is_null());\n\n  \/\/ Do some timing.\n  bar.Start();\n  PlatformThread::Sleep(500);\n  bar.Stop();\n  EXPECT_LE(500, table.GetCounterValue(\"t:bar\"));\n\n  \/\/ Verify that timing again is additive.\n  bar.Start();\n  PlatformThread::Sleep(500);\n  bar.Stop();\n  EXPECT_LE(1000, table.GetCounterValue(\"t:bar\"));\n}\n\n\/\/ Test some basic StatsRate operations\nTEST_F(StatsTableTest, StatsRate) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"StatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  StatsRate baz(\"baz\");\n\n  \/\/ Test initial state.\n  EXPECT_FALSE(baz.Running());\n  EXPECT_EQ(0, table.GetCounterValue(\"c:baz\"));\n  EXPECT_EQ(0, table.GetCounterValue(\"t:baz\"));\n\n  \/\/ Do some timing.\n  baz.Start();\n  PlatformThread::Sleep(500);\n  baz.Stop();\n  EXPECT_EQ(1, table.GetCounterValue(\"c:baz\"));\n  EXPECT_LE(500, table.GetCounterValue(\"t:baz\"));\n\n  \/\/ Verify that timing again is additive.\n  baz.Start();\n  PlatformThread::Sleep(500);\n  baz.Stop();\n  EXPECT_EQ(2, table.GetCounterValue(\"c:baz\"));\n  EXPECT_LE(1000, table.GetCounterValue(\"t:baz\"));\n}\n\n\/\/ Test some basic StatsScope operations\nTEST_F(StatsTableTest, StatsScope) {\n  \/\/ Create a stats table.\n  const std::string kTableName = \"StatTable\";\n  const int kMaxThreads = 20;\n  const int kMaxCounter = 5;\n  DeleteShmem(kTableName);\n  StatsTable table(kTableName, kMaxThreads, kMaxCounter);\n  StatsTable::set_current(&table);\n\n  StatsCounterTimer foo(\"foo\");\n  StatsRate bar(\"bar\");\n\n  \/\/ Test initial state.\n  EXPECT_EQ(0, table.GetCounterValue(\"t:foo\"));\n  EXPECT_EQ(0, table.GetCounterValue(\"t:bar\"));\n  EXPECT_EQ(0, table.GetCounterValue(\"c:bar\"));\n\n  \/\/ Try a scope.\n  {\n    StatsScope<StatsCounterTimer> timer(foo);\n    StatsScope<StatsRate> timer2(bar);\n    PlatformThread::Sleep(500);\n  }\n  EXPECT_LE(500, table.GetCounterValue(\"t:foo\"));\n  EXPECT_LE(500, table.GetCounterValue(\"t:bar\"));\n  EXPECT_EQ(1, table.GetCounterValue(\"c:bar\"));\n\n  \/\/ Try a second scope.\n  {\n    StatsScope<StatsCounterTimer> timer(foo);\n    StatsScope<StatsRate> timer2(bar);\n    PlatformThread::Sleep(500);\n  }\n  EXPECT_LE(1000, table.GetCounterValue(\"t:foo\"));\n  EXPECT_LE(1000, table.GetCounterValue(\"t:bar\"));\n  EXPECT_EQ(2, table.GetCounterValue(\"c:bar\"));\n\n  DeleteShmem(kTableName);\n}\n\n}  \/\/ namespace base\n<|endoftext|>"}
{"text":"<commit_before>\/* -------------------------------------------------------------------------- *\n *                      OpenSim:  ControllerExample.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-2012 Stanford University and the Authors                *\n * Author(s): Chand T. John, 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\/* \n *  Below is an extension example of an OpenSim application that provides its own \n *  main() routine.  It applies a controller to the forward simulation of a tug-of-war \n *  between two muscles pulling on a block.\n *\/\n\n\/\/ Author:  Chand T. John and Ajay Seth\n\n\/\/==============================================================================\n\/\/==============================================================================\n\n\/\/ Include OpenSim and functions\n#include <OpenSim\/OpenSim.h>\n\n\/\/ This allows us to use OpenSim functions, classes, etc., without having to\n\/\/ prefix the names of those things with \"OpenSim::\".\nusing namespace OpenSim;\n\n\/\/ This allows us to use SimTK functions, classes, etc., without having to\n\/\/ prefix the names of those things with \"SimTK::\".\nusing namespace SimTK;\n\n\n\/\/______________________________________________________________________________\n\/**\n * The controller will try to make the model follow this position\n * in the z direction.\n *\/\ndouble desiredModelZPosition( double t ) {\n    \/\/ z(t) = 0.15 sin( pi * t )\n    return 0.15 * sin( Pi * t );\n}\n\n\/**\n * The controller will try to make the model follow this velocity\n * in the z direction.\n *\/\ndouble desiredModelZVelocity( double t ) {\n    \/\/ z(t) = 0.15 sin( pi * t )\n    return 0.15 * Pi * cos( Pi * t );\n}\n\/\/______________________________________________________________________________\n\/**\n * The controller will try to make the model follow this acceleration\n * in the z direction.\n *\/\ndouble desiredModelZAcceleration( double t ) {\n    \/\/ z''(t) = -(0.15*pi^2) sin( pi * t )\n    return -0.15 * Pi * Pi * sin( Pi * t );\n}\n\n\/\/______________________________________________________________________________\n\/**\n * This controller will try to track a desired trajectory of the block in\n * the tug-of-war model.\n *\/\nclass TugOfWarController : public Controller {\nOpenSim_DECLARE_CONCRETE_OBJECT(TugOfWarController, Controller);\n\n\/\/ This section contains methods that can be called in this controller class.\npublic:\n    \/**\n     * Constructor\n     *\n     * @param aModel Model to be controlled\n     * @param aKp Position gain by which the position error will be multiplied\n     *\/\n    TugOfWarController(double aKp, double aKv) : Controller(), kp( aKp ), kv( aKv ) \n    {\n    }\n\n    \/**\n     * This function is called at every time step for every actuator.\n     *\n     * @param s Current state of the system\n     * @param controls Controls being calculated\n     *\/\n    void computeControls(const SimTK::State& s, SimTK::Vector &controls) const\n    {\n        \/\/ Get the current time in the simulation.\n        double t = s.getTime();\n\n        \/\/ Read the mass of the block.\n        double blockMass = getModel().getBodySet().get( \"block\" ).getMass();\n\n        \/\/ Get pointers to each of the muscles in the model.\n        Muscle* leftMuscle = dynamic_cast<Muscle*>  ( &getActuatorSet().get(0) );\n        Muscle* rightMuscle = dynamic_cast<Muscle*> ( &getActuatorSet().get(1) );\n\n        \/\/ Compute the desired position of the block in the tug-of-war\n        \/\/ model.\n        double zdes  = desiredModelZPosition(t);\n\n        \/\/ Compute the desired velocity of the block in the tug-of-war\n        \/\/ model.\n        double zdesv = desiredModelZVelocity(t);\n\n        \/\/ Compute the desired acceleration of the block in the tug-\n        \/\/ of-war model.\n        double zdesa = desiredModelZAcceleration(t);\n\n        \/\/ Get the z translation coordinate in the model.\n        const Coordinate& zCoord = _model->getCoordinateSet().\n            get( \"blockToGround_zTranslation\" );\n\n        \/\/ Get the current position of the block in the tug-of-war\n        \/\/ model.\n        double z  = zCoord.getValue(s);\n        \n        \/\/ Get the current velocity of the block in the tug-of-war\n        \/\/ model.\n        double zv = zCoord.getSpeedValue(s);\n\n        \/\/ Compute the correction to the desired acceleration arising\n        \/\/ from the deviation of the block's current position from its\n        \/\/ desired position (this deviation is the \"position error\").\n        double pErrTerm = kp * ( zdes  - z  );\n        \n        \/\/ Compute the total desired velocity based on the initial\n        \/\/ desired velocity plus the position error term we\n        \/\/ computed above.\n        double vErrTerm = kv * ( zdesv - zv );\n\n        \/\/ Compute the total desired acceleration based on the initial\n        \/\/ desired acceleration plus the position error term we\n        \/\/ computed above.\n        double desAcc = zdesa + vErrTerm + pErrTerm;\n\n        \/\/ Compute the desired force on the block as the mass of the\n        \/\/ block times the total desired acceleration of the block.\n        double desFrc = desAcc * blockMass;\n\n        \/\/ Get the maximum isometric force for the left muscle.\n        double FoptL = leftMuscle->getMaxIsometricForce();\n\n        \/\/ Get the maximum isometric force for the right muscle.\n        double FoptR = rightMuscle->getMaxIsometricForce();\n\n        \/\/ If desired force is in direction of one muscle's pull\n        \/\/ direction, then set that muscle's control based on desired\n        \/\/ force.  Otherwise, set the muscle's control to zero.\n        double leftControl = 0.0, rightControl = 0.0;\n        if( desFrc < 0 ) {\n            leftControl = abs( desFrc ) \/ FoptL;\n            rightControl = 0.0;\n        }\n        else if( desFrc > 0 ) {\n            leftControl = 0.0;\n            rightControl = abs( desFrc ) \/ FoptR;\n        }\n        \/\/ Don't allow any control value to be greater than one.\n        if( leftControl > 1.0 ) leftControl = 1.0;\n        if( rightControl > 1.0 ) rightControl = 1.0;\n\n        \/\/ Thelen muscle has only one control\n        Vector muscleControl(1, leftControl);\n        \/\/ Add in the controls computed for this muscle to the set of all model controls\n        leftMuscle->addInControls(muscleControl, controls);\n        \/\/ Specify control for other actuator (muscle) controlled by this controller\n        muscleControl[0] = rightControl;\n        rightMuscle->addInControls(muscleControl, controls);\n    }\n\n\/\/ This section contains the member variables of this controller class.\nprivate:\n\n    \/** Position gain for this controller *\/\n    double kp;\n    \/** Velocity gain for this controller *\/\n    double kv;\n\n};\n\n\n\/\/______________________________________________________________________________\n\/**\n * Run a forward dynamics simulation with a controller attached to a model.\n * The model consists of a block attached by two muscles to two walls.  The\n * block can make contact with the ground.\n *\/\nint main()\n{\n    try {\n\n                \/\/ Need to load this DLL so muscle types are recognized.\n        LoadOpenSimLibrary( \"osimActuators\" );\n\n        \/\/ Create an OpenSim model from the model file provided.\n        Model osimModel( \"tugOfWar_model_ThelenOnly.osim\" );\n\n        \/\/ Define the initial and final simulation times.\n        double initialTime = 0.0;\n        double finalTime = 1.0;\n\n        \/\/ Set gain for the controller.\n        double kp = 1600.0; \/\/ position gain\n        double kv = 80.0;   \/\/ velocity gain\n\n        \/\/ Print the control gains and block mass.\n        std::cout << std::endl;\n        std::cout << \"kp = \" << kp << std::endl;\n        std::cout << \"kv = \" << kv << std::endl;\n        \n        \/\/ Create the controller.\n        TugOfWarController *controller = new TugOfWarController(kp, kv);\n\n        \/\/ Give the controller the Model's actuators so it knows\n        \/\/ to control those actuators.\n        controller->setActuators( osimModel.updActuators() );\n\n        \/\/ Add the controller to the Model.\n        osimModel.addController( controller );\n\n        \/\/ Initialize the system and get the state representing the\n        \/\/ system.\n        SimTK::State& si = osimModel.initSystem();\n\n        \/\/ Define non-zero (defaults are 0) states for the free joint.\n        CoordinateSet& modelCoordinateSet =\n            osimModel.updCoordinateSet();\n        \/\/ Get the z translation coordinate.\n        Coordinate& zCoord = modelCoordinateSet.\n            get( \"blockToGround_zTranslation\" );\n        \/\/ Set z translation speed value.\n        zCoord.setSpeedValue( si, 0.15 * Pi );\n\n        \/\/ Define the initial muscle states.\n        const Set<Muscle>& muscleSet = osimModel.getMuscles();\n        ActivationFiberLengthMuscle* muscle1 = dynamic_cast<ActivationFiberLengthMuscle*>( &muscleSet.get(0) );\n        ActivationFiberLengthMuscle* muscle2 = dynamic_cast<ActivationFiberLengthMuscle*>( &muscleSet.get(1) );\n        if((muscle1 == NULL) || (muscle2 == NULL)){\n            throw OpenSim::Exception(\"ControllerExample: muscle1 or muscle2 is not an ActivationFiberLengthMuscle and example cannot proceed.\");\n        }\n        muscle1->setActivation(si, 0.01 ); \/\/ muscle1 activation\n        muscle1->setFiberLength(si, 0.2 ); \/\/ muscle1 fiber length\n        muscle2->setActivation(si, 0.01 ); \/\/ muscle2 activation\n        muscle2->setFiberLength(si, 0.2 ); \/\/ muscle2 fiber length\n\n        \/\/ Create the integrator and manager for the simulation.\n        SimTK::RungeKuttaMersonIntegrator\n            integrator( osimModel.getMultibodySystem() );\n        integrator.setAccuracy( 1.0e-4 );\n\n        Manager manager( osimModel, integrator );\n\n        \/\/ Examine the model.\n        osimModel.printDetailedInfo( si, std::cout );\n\n        \/\/ Print out the initial position and velocity states.\n        for( int i = 0; i < modelCoordinateSet.getSize(); i++ ) {\n            std::cout << \"Initial \" << modelCoordinateSet[i].getName()\n                << \" = \" << modelCoordinateSet[i].getValue( si )\n                << \", and speed = \"\n                << modelCoordinateSet[i].getSpeedValue( si ) << std::endl;\n        }\n\n        \/\/ Integrate from initial time to final time.\n        manager.setInitialTime( initialTime );\n        manager.setFinalTime( finalTime );\n        std::cout << \"\\n\\nIntegrating from \" << initialTime\n            << \" to \" << finalTime << std::endl;\n        manager.integrate( si );\n\n        \/\/ Save the simulation results.\n        osimModel.printControlStorage( \"tugOfWar_controls.sto\" );\n        manager.getStateStorage().print( \"tugOfWar_states.sto\" );\n    }\n    catch (const std::exception &ex) {\n        \n        \/\/ In case of an exception, print it out to the screen.\n        std::cout << ex.what() << std::endl;\n\n        \/\/ Return 1 instead of 0 to indicate that something\n        \/\/ undesirable happened.\n        return 1;\n    }\n\n    \/\/ If this program executed up to this line, return 0 to\n    \/\/ indicate that the intended lines of code were executed.\n    return 0;\n}\n<commit_msg>Replace Storage calls with TimeSeriesTable calls.<commit_after>\/* -------------------------------------------------------------------------- *\n *                      OpenSim:  ControllerExample.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-2012 Stanford University and the Authors                *\n * Author(s): Chand T. John, 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\/* \n *  Below is an extension example of an OpenSim application that provides its own \n *  main() routine.  It applies a controller to the forward simulation of a tug-of-war \n *  between two muscles pulling on a block.\n *\/\n\n\/\/ Author:  Chand T. John and Ajay Seth\n\n\/\/==============================================================================\n\/\/==============================================================================\n\n\/\/ Include OpenSim and functions\n#include <OpenSim\/OpenSim.h>\n#include \"OpenSim\/Common\/MOTFileAdapter.h\"\n\n\/\/ This allows us to use OpenSim functions, classes, etc., without having to\n\/\/ prefix the names of those things with \"OpenSim::\".\nusing namespace OpenSim;\n\n\/\/ This allows us to use SimTK functions, classes, etc., without having to\n\/\/ prefix the names of those things with \"SimTK::\".\nusing namespace SimTK;\n\n\n\/\/______________________________________________________________________________\n\/**\n * The controller will try to make the model follow this position\n * in the z direction.\n *\/\ndouble desiredModelZPosition( double t ) {\n    \/\/ z(t) = 0.15 sin( pi * t )\n    return 0.15 * sin( Pi * t );\n}\n\n\/**\n * The controller will try to make the model follow this velocity\n * in the z direction.\n *\/\ndouble desiredModelZVelocity( double t ) {\n    \/\/ z(t) = 0.15 sin( pi * t )\n    return 0.15 * Pi * cos( Pi * t );\n}\n\/\/______________________________________________________________________________\n\/**\n * The controller will try to make the model follow this acceleration\n * in the z direction.\n *\/\ndouble desiredModelZAcceleration( double t ) {\n    \/\/ z''(t) = -(0.15*pi^2) sin( pi * t )\n    return -0.15 * Pi * Pi * sin( Pi * t );\n}\n\n\/\/______________________________________________________________________________\n\/**\n * This controller will try to track a desired trajectory of the block in\n * the tug-of-war model.\n *\/\nclass TugOfWarController : public Controller {\nOpenSim_DECLARE_CONCRETE_OBJECT(TugOfWarController, Controller);\n\n\/\/ This section contains methods that can be called in this controller class.\npublic:\n    \/**\n     * Constructor\n     *\n     * @param aModel Model to be controlled\n     * @param aKp Position gain by which the position error will be multiplied\n     *\/\n    TugOfWarController(double aKp, double aKv) : Controller(), kp( aKp ), kv( aKv ) \n    {\n    }\n\n    \/**\n     * This function is called at every time step for every actuator.\n     *\n     * @param s Current state of the system\n     * @param controls Controls being calculated\n     *\/\n    void computeControls(const SimTK::State& s, SimTK::Vector &controls) const\n    {\n        \/\/ Get the current time in the simulation.\n        double t = s.getTime();\n\n        \/\/ Read the mass of the block.\n        double blockMass = getModel().getBodySet().get( \"block\" ).getMass();\n\n        \/\/ Get pointers to each of the muscles in the model.\n        Muscle* leftMuscle = dynamic_cast<Muscle*>  ( &getActuatorSet().get(0) );\n        Muscle* rightMuscle = dynamic_cast<Muscle*> ( &getActuatorSet().get(1) );\n\n        \/\/ Compute the desired position of the block in the tug-of-war\n        \/\/ model.\n        double zdes  = desiredModelZPosition(t);\n\n        \/\/ Compute the desired velocity of the block in the tug-of-war\n        \/\/ model.\n        double zdesv = desiredModelZVelocity(t);\n\n        \/\/ Compute the desired acceleration of the block in the tug-\n        \/\/ of-war model.\n        double zdesa = desiredModelZAcceleration(t);\n\n        \/\/ Get the z translation coordinate in the model.\n        const Coordinate& zCoord = _model->getCoordinateSet().\n            get( \"blockToGround_zTranslation\" );\n\n        \/\/ Get the current position of the block in the tug-of-war\n        \/\/ model.\n        double z  = zCoord.getValue(s);\n        \n        \/\/ Get the current velocity of the block in the tug-of-war\n        \/\/ model.\n        double zv = zCoord.getSpeedValue(s);\n\n        \/\/ Compute the correction to the desired acceleration arising\n        \/\/ from the deviation of the block's current position from its\n        \/\/ desired position (this deviation is the \"position error\").\n        double pErrTerm = kp * ( zdes  - z  );\n        \n        \/\/ Compute the total desired velocity based on the initial\n        \/\/ desired velocity plus the position error term we\n        \/\/ computed above.\n        double vErrTerm = kv * ( zdesv - zv );\n\n        \/\/ Compute the total desired acceleration based on the initial\n        \/\/ desired acceleration plus the position error term we\n        \/\/ computed above.\n        double desAcc = zdesa + vErrTerm + pErrTerm;\n\n        \/\/ Compute the desired force on the block as the mass of the\n        \/\/ block times the total desired acceleration of the block.\n        double desFrc = desAcc * blockMass;\n\n        \/\/ Get the maximum isometric force for the left muscle.\n        double FoptL = leftMuscle->getMaxIsometricForce();\n\n        \/\/ Get the maximum isometric force for the right muscle.\n        double FoptR = rightMuscle->getMaxIsometricForce();\n\n        \/\/ If desired force is in direction of one muscle's pull\n        \/\/ direction, then set that muscle's control based on desired\n        \/\/ force.  Otherwise, set the muscle's control to zero.\n        double leftControl = 0.0, rightControl = 0.0;\n        if( desFrc < 0 ) {\n            leftControl = abs( desFrc ) \/ FoptL;\n            rightControl = 0.0;\n        }\n        else if( desFrc > 0 ) {\n            leftControl = 0.0;\n            rightControl = abs( desFrc ) \/ FoptR;\n        }\n        \/\/ Don't allow any control value to be greater than one.\n        if( leftControl > 1.0 ) leftControl = 1.0;\n        if( rightControl > 1.0 ) rightControl = 1.0;\n\n        \/\/ Thelen muscle has only one control\n        Vector muscleControl(1, leftControl);\n        \/\/ Add in the controls computed for this muscle to the set of all model controls\n        leftMuscle->addInControls(muscleControl, controls);\n        \/\/ Specify control for other actuator (muscle) controlled by this controller\n        muscleControl[0] = rightControl;\n        rightMuscle->addInControls(muscleControl, controls);\n    }\n\n\/\/ This section contains the member variables of this controller class.\nprivate:\n\n    \/** Position gain for this controller *\/\n    double kp;\n    \/** Velocity gain for this controller *\/\n    double kv;\n\n};\n\n\n\/\/______________________________________________________________________________\n\/**\n * Run a forward dynamics simulation with a controller attached to a model.\n * The model consists of a block attached by two muscles to two walls.  The\n * block can make contact with the ground.\n *\/\nint main()\n{\n    try {\n\n                \/\/ Need to load this DLL so muscle types are recognized.\n        LoadOpenSimLibrary( \"osimActuators\" );\n\n        \/\/ Create an OpenSim model from the model file provided.\n        Model osimModel( \"tugOfWar_model_ThelenOnly.osim\" );\n\n        \/\/ Define the initial and final simulation times.\n        double initialTime = 0.0;\n        double finalTime = 1.0;\n\n        \/\/ Set gain for the controller.\n        double kp = 1600.0; \/\/ position gain\n        double kv = 80.0;   \/\/ velocity gain\n\n        \/\/ Print the control gains and block mass.\n        std::cout << std::endl;\n        std::cout << \"kp = \" << kp << std::endl;\n        std::cout << \"kv = \" << kv << std::endl;\n        \n        \/\/ Create the controller.\n        TugOfWarController *controller = new TugOfWarController(kp, kv);\n\n        \/\/ Give the controller the Model's actuators so it knows\n        \/\/ to control those actuators.\n        controller->setActuators( osimModel.updActuators() );\n\n        \/\/ Add the controller to the Model.\n        osimModel.addController( controller );\n\n        \/\/ Initialize the system and get the state representing the\n        \/\/ system.\n        SimTK::State& si = osimModel.initSystem();\n\n        \/\/ Define non-zero (defaults are 0) states for the free joint.\n        CoordinateSet& modelCoordinateSet =\n            osimModel.updCoordinateSet();\n        \/\/ Get the z translation coordinate.\n        Coordinate& zCoord = modelCoordinateSet.\n            get( \"blockToGround_zTranslation\" );\n        \/\/ Set z translation speed value.\n        zCoord.setSpeedValue( si, 0.15 * Pi );\n\n        \/\/ Define the initial muscle states.\n        const Set<Muscle>& muscleSet = osimModel.getMuscles();\n        ActivationFiberLengthMuscle* muscle1 = dynamic_cast<ActivationFiberLengthMuscle*>( &muscleSet.get(0) );\n        ActivationFiberLengthMuscle* muscle2 = dynamic_cast<ActivationFiberLengthMuscle*>( &muscleSet.get(1) );\n        if((muscle1 == NULL) || (muscle2 == NULL)){\n            throw OpenSim::Exception(\"ControllerExample: muscle1 or muscle2 is not an ActivationFiberLengthMuscle and example cannot proceed.\");\n        }\n        muscle1->setActivation(si, 0.01 ); \/\/ muscle1 activation\n        muscle1->setFiberLength(si, 0.2 ); \/\/ muscle1 fiber length\n        muscle2->setActivation(si, 0.01 ); \/\/ muscle2 activation\n        muscle2->setFiberLength(si, 0.2 ); \/\/ muscle2 fiber length\n\n        \/\/ Create the integrator and manager for the simulation.\n        SimTK::RungeKuttaMersonIntegrator\n            integrator( osimModel.getMultibodySystem() );\n        integrator.setAccuracy( 1.0e-4 );\n\n        Manager manager( osimModel, integrator );\n\n        \/\/ Examine the model.\n        osimModel.printDetailedInfo( si, std::cout );\n\n        \/\/ Print out the initial position and velocity states.\n        for( int i = 0; i < modelCoordinateSet.getSize(); i++ ) {\n            std::cout << \"Initial \" << modelCoordinateSet[i].getName()\n                << \" = \" << modelCoordinateSet[i].getValue( si )\n                << \", and speed = \"\n                << modelCoordinateSet[i].getSpeedValue( si ) << std::endl;\n        }\n\n        \/\/ Integrate from initial time to final time.\n        manager.setInitialTime( initialTime );\n        manager.setFinalTime( finalTime );\n        std::cout << \"\\n\\nIntegrating from \" << initialTime\n            << \" to \" << finalTime << std::endl;\n        manager.integrate( si );\n\n        \/\/ Save the simulation results.\n        auto controlsTable = osimModel.getControlsTable();\n        MOTFileAdapter::write(controlsTable, \"tugOfWar_controls.mot\");\n\n        auto statesTable = manager.getStatesTable();\n        MOTFileAdapter::write(statesTable, \"tugOfWar_states.mot\");\n    }\n    catch (const std::exception &ex) {\n        \n        \/\/ In case of an exception, print it out to the screen.\n        std::cout << ex.what() << std::endl;\n\n        \/\/ Return 1 instead of 0 to indicate that something\n        \/\/ undesirable happened.\n        return 1;\n    }\n\n    \/\/ If this program executed up to this line, return 0 to\n    \/\/ indicate that the intended lines of code were executed.\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *  @file VPSSMgrFactory.cpp\n *    Definitions for factory to build instances of classes that manage the\n *    calculation of standard state properties for all the species in a phase\n *    (see \\ref spthermo and class \n *    \\link Cantera::VPSSMgrFactory VPSSMgrFactory\\endlink);\n *\/\n\/*\n * $Id$\n *\/\n\n\/*\n * Copywrite (2005) Sandia Corporation. Under the terms of \n * Contract DE-AC04-94AL85000 with Sandia Corporation, the\n * U.S. Government retains certain rights in this software.\n *\/\n#ifdef WIN32\n#pragma warning(disable:4786)\n#endif\n\n\n#include \"SpeciesThermo.h\"\n\n\n#include \"VPSSMgr.h\"\n#include \"VPSSMgrFactory.h\"\n\n#include \"VPStandardStateTP.h\"\n\n#include \"VPSSMgr_IdealGas.h\"\n#include \"VPSSMgr_ConstVol.h\"\n#include \"VPSSMgr_Water_ConstVol.h\"\n#include \"VPSSMgr_Water_HKFT.h\"\n#include \"VPSSMgr_General.h\"\n\n#include \"VPSSMgr_types.h\"\n\n#include \"SpeciesThermoMgr.h\"\n#include \"speciesThermoTypes.h\"\n#include \"SpeciesThermo.h\"\n#include \"SpeciesThermoFactory.h\"\n#include \"GeneralSpeciesThermo.h\"\n\n#include \"mix_defs.h\"\n\n#include \"xml.h\"\n#include \"ctml.h\"\n\nusing namespace ctml;\nusing namespace std;\n\n\nnamespace Cantera {\n\n  VPSSMgrFactory* VPSSMgrFactory::s_factory = 0;\n\n#if defined(THREAD_SAFE_CANTERA)\n  \/\/ Defn of the static mutex variable that locks the \n  \/\/ %VPSSMgr factory singelton\n  boost::mutex VPSSMgrFactory::vpss_species_thermo_mutex;\n#endif\n \n  \n  \/\/! Examine the types of species thermo parameterizations, and return a flag indicating the type of parameterization\n  \/\/! needed by the species.\n  \/*!\n   * \n   *  @param spDataNodeList            Species Data XML node. This node contains a list\n   *                                     of species XML nodes underneath it.\n   *  @param has_nasa_idealGas         Boolean indicating that one species has a nasa ideal gas standard state\n   *  @param has_nasa_constVol         Boolean indicating that one species has a nasa ideal solution standard state\n   *  @param has_shomate_idealGas      Boolean indicating that one species has a shomate ideal gas standard state\n   *  @param has_shomate_constVol      Boolean indicating that one species has a shomate ideal solution standard state\n   *  @param has_simple_idealGas       Boolean indicating that one species has a simple ideal gas standard state\n   *  @param has_simple_constVol       Boolean indicating that one species has a simple ideal solution standard state\n   *  @param has_water                 Boolean indicating that one species has a water standard state\n   *  @param has_tpx                   Boolean indicating that one species has a tpx standard state\n   *  @param has_hptx                  Boolean indicating that one species has a htpx standard state\n   *  @param has_other                 Boolean indicating that one species has different standard state than the ones listed above\n   * \n   * @todo Make sure that spDadta_node is species Data XML node by checking \n   *      its name is speciesData\n   *\/\n  static void getVPSSMgrTypes(std::vector<XML_Node *> & spDataNodeList,\n\t\t\t      int &has_nasa_idealGas, \n\t\t\t      int &has_nasa_constVol, \n\t\t\t      int& has_shomate_idealGas, \n\t\t\t      int& has_shomate_constVol, \n\t\t\t      int& has_simple_idealGas,\n\t\t\t      int& has_simple_constVol,\n\t\t\t      int &has_water,\n\t\t\t      int &has_tpx,\n\t\t\t      int &has_hptx,\n\t\t\t      int &has_other) {\n  \n    XML_Node *ss_ptr = 0;\n    string ssModel = \"idealGas\";\n    size_t ns = spDataNodeList.size();\n    for (size_t n = 0; n < ns; n++) {\n      bool ifound = false;\n      XML_Node* spNode = spDataNodeList[n];\n      if (spNode->hasChild(\"standardState\")) {\n\tconst XML_Node& ssN = spNode->child(\"standardState\");\n\tstring mm = ssN[\"model\"];\n\tif (mm == \"waterIAPWS\" || mm == \"waterPDSS\") {\n\t  has_water++;\n\t  ifound = true;\n\t}\n\tif (mm == \"HKFT\") {\n\t  has_hptx++;\n\t  ifound = true;\n\t}\n      } \n      if (!ifound) {\n\tif (spNode->hasChild(\"thermo\")) {\n\t  const XML_Node& th = spNode->child(\"thermo\");\n\t  if (spNode->hasChild(\"standardState\")) {\n\t    ss_ptr = &(spNode->child(\"standardState\"));\n\t    ssModel = ss_ptr->attrib(\"model\");\n\t  }\n\t  if (th.hasChild(\"NASA\")) {\n\t    if (ssModel == \"idealGas\") {\n\t      has_nasa_idealGas++;\n\t    } else if (ssModel == \"constant_incompressible\" ||\n\t\t       ssModel == \"constantVolume\") {\n\t      has_nasa_constVol++;\n\t    } else if (ssModel == \"temperature_polynomial\" ||\n\t\t       ssModel == \"density_temperature_polynomial\"  ||\n\t\t       ssModel == \"constant\") {\n\t      has_other++;\n\t    } else {\n\t      throw UnknownVPSSMgrModel(\"getVPSSMgrTypes:\",\n\t\t\t\t\tspNode->attrib(\"name\"));\n\t    }\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"Shomate\")) {\n\t    if (ssModel == \"idealGas\") {\n\t      has_shomate_idealGas++;\n\t    } else if (ssModel == \"constant_incompressible\" ||\n\t\t       ssModel == \"constantVolume\") {\n\t      has_shomate_constVol++;\n\t    } else if (ssModel == \"temperature_polynomial\" ||\n\t\t       ssModel == \"density_temperature_polynomial\"  ||\n\t\t       ssModel == \"constant\") {\n\t      has_other++;\n\t    } else {\n\t      throw UnknownVPSSMgrModel(\"getVPSSMgrTypes:\",\n\t\t\t\t\tspNode->attrib(\"name\"));\n\t    }\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"const_cp\")){\n\t    if (ssModel == \"idealGas\") {\n\t      has_simple_idealGas++;\n\t    } else if (ssModel == \"constant_incompressible\" ||\n\t\t       ssModel == \"constantVolume\") {\n\t      has_simple_constVol++;\n\t    } else if (ssModel == \"temperature_polynomial\" ||\n\t\t       ssModel == \"density_temperature_polynomial\"  ||\n\t\t       ssModel == \"constant\") {\n\t      has_other++;\n\t    } else {\n\t      throw UnknownVPSSMgrModel(\"getVPSSMgrTypes:\",\n\t\t\t\t\tspNode->attrib(\"name\"));\n\t    }\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"poly\")) {\n\t    if (th.child(\"poly\")[\"order\"] == \"1\") {\n\t      has_simple_constVol = 1;\n\t      ifound = true;\n\t    } else throw CanteraError(\"newSpeciesThermo\",\n\t\t\t\t      \"poly with order > 1 not yet supported\");\n\t  }\n\t  if (th.hasChild(\"Mu0\")) {\n\t    has_other++;\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"NASA9\")) {\n\t    has_other++;\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"NASA9MULTITEMP\")) {\n\t    has_other++;\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"adsorbate\")) {\n\t    has_other++;\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"HKFT\")) {\n\t    has_hptx++;\n\t    ifound = true;\n\t  }\n\t} else {\n\t  throw UnknownVPSSMgrModel(\"getVPSSMgrTypes:\",\n\t\t\t\t    spNode->attrib(\"name\"));\n\t}\n      }\n    }\n  }\n\n  \/\/ Delete static instance of this class\n  \/*\n   * If it is necessary to explicitly delete the factory before\n   * the process terminates (for example, when checking for\n   * memory leaks) then this method can be called to delete it.\n   *\/\n  void VPSSMgrFactory::deleteFactory() {\n\n#if defined(THREAD_SAFE_CANTERA)\n      boost::mutex::scoped_lock lock(species_thermo_mutex);\n#endif\n      if (s_factory) {\n\tdelete s_factory;\n\ts_factory = 0;\n      }\n  }\n\n  VPSSMgrFactory::~VPSSMgrFactory() {\n  }\n\n  VPSSMgr_enumType\n  VPSSMgrFactory::VPSSMgr_StringConversion(std::string ssModel) const {\n    std::string lssModel = lowercase(ssModel); \n    VPSSMgr_enumType type;\n    if (lssModel == \"idealgas\") {\n      type = cVPSSMGR_IDEALGAS;\n    } else if (lssModel == \"constvol\") {\n      type = cVPSSMGR_CONSTVOL;\n    } else if (lssModel == \"purefuild\") {\n      type = cVPSSMGR_PUREFLUID;\n    } else if (lssModel == \"water_constvol\") {\n      type = cVPSSMGR_WATER_CONSTVOL;\n    } else if (lssModel == \"water_hkft\") {\n      type = cVPSSMGR_WATER_HKFT;\n    } else if (lssModel == \"general\") {\n      type = cVPSSMGR_GENERAL;\n    } else {\n      type = cVPSSMGR_UNDEF;\n    }\n    return type;\n  }\n  \n  \/\/ Chose the variable pressure standard state manager \n  \/\/ and the reference standard state manager\n  VPSSMgr* \n  VPSSMgrFactory::newVPSSMgr(VPStandardStateTP *vp_ptr, \n\t\t\t     XML_Node* phaseNode_ptr,\n\t\t\t     std::vector<XML_Node*> & spDataNodeList) {\n\n    std::string ssManager=\"\";\n    std::string vpssManager=\"\";\n    VPSSMgr *vpss = 0;\n\n    \/\/ First look for any explicit instructions within the XML Database\n    \/\/ for the standard state manager and the variable pressure \n    \/\/ standard state manager\n    if (phaseNode_ptr) {\n      if (phaseNode_ptr->hasChild(\"thermo\")) {\n\tconst XML_Node& thermoNode = phaseNode_ptr->child(\"thermo\");\n\tif (thermoNode.hasChild(\"standardStateManager\")) {\n\t  const XML_Node& ssNode = thermoNode.child(\"standardStateManager\");\n\t  ssManager = ssNode[\"model\"];\n\t}\n\tif (thermoNode.hasChild(\"variablePressureStandardStateManager\")) {\n\t  const XML_Node& vpssNode = thermoNode.child(\"variablePressureStandardStateManager\");\n\t  vpssManager = vpssNode[\"model\"];\n\t}\n      }\n    }\n\n    \/\/ first get the reference state handler. If we have explicit instructions,\n    \/\/ use them to spawn the object.\n    SpeciesThermo *spth = 0;\n    if (ssManager != \"\") {\n      spth = newSpeciesThermoMgr(ssManager);\n    } else {\n      spth = newSpeciesThermoMgr(spDataNodeList);\n    }\n    vp_ptr->setSpeciesThermo(spth);\n\n    \/\/ Next, if we have specific directions, use them to get the VPSSSMgr object\n    \/\/ and return immediately\n    if (vpssManager != \"\") {\n      VPSSMgr_enumType type = VPSSMgr_StringConversion(vpssManager);\n      vpss = newVPSSMgr(type, vp_ptr);\n      return vpss;\n    }\n\n \n    \/\/ If it comes back as general, then there may be some unknown \n    \/\/ parameterizations to the SpeciesThermo factory routine.\n    bool haveSomeUnknowns = true;\n    GeneralSpeciesThermo *ttmp = dynamic_cast<GeneralSpeciesThermo *>(spth);\n    if (ttmp == 0) {\n      haveSomeUnknowns = false;\n    }\n \n    \/\/ Handle special cases based on the VPStandardState types\n    if (vp_ptr->eosType() == cVPSS_IdealGas) {\n      vpss = new VPSSMgr_IdealGas(vp_ptr, spth);\n      return vpss;\n    } else if (vp_ptr->eosType() == cVPSS_ConstVol) {\n      vpss = new VPSSMgr_ConstVol(vp_ptr, spth);\n      return vpss;\n    }\n\n\n    int inasaIG = 0, inasaCV = 0, ishomateIG = 0, ishomateCV = 0,\n      isimpleIG = 0, isimpleCV = 0, \n      iwater = 0, itpx = 0, iother = 0;\n    int ihptx = 0;\n  \n    try {\n      getVPSSMgrTypes(spDataNodeList, inasaIG, inasaCV, ishomateIG, ishomateCV,\n\t\t      isimpleIG, isimpleCV, iwater, itpx, ihptx, iother);\n    } catch (UnknownSpeciesThermoModel) {\n      iother = 1;\n      popError();\n    }\n    \n    if (iwater == 1) {\n      if (ihptx == 0) {\n\tif (inasaIG ||  ishomateIG || isimpleIG) {\n\t  throw CanteraError(\"newVPSSMgr\", \"Ideal gas with liquid water\");\n\t} else {\n\t  vpss = new VPSSMgr_Water_ConstVol(vp_ptr, spth);\n\t}\n      } else {\n\tif (inasaIG ||  ishomateIG || isimpleIG) {\n\t  throw CanteraError(\"newVPSSMgr\", \"Ideal gas with liquid water\");\n\t} else if (inasaCV || ishomateCV ||  isimpleCV) {\n\t  vpss = new VPSSMgr_General(vp_ptr, spth);\n\t} else {\n\t  vpss = new VPSSMgr_Water_HKFT(vp_ptr, spth);\n\t}\n      }\n    }\n    if (vpss == 0) {\n      if (inasaCV || ishomateCV || isimpleCV) {\n\tif (!inasaIG && !ishomateIG && !isimpleIG && !itpx && !ihptx && !iother) {\n\t  vpss = new VPSSMgr_ConstVol(vp_ptr, spth);\n\t}\n      }\n    }\n    if (vpss == 0) {\n      vpss = new VPSSMgr_General(vp_ptr, spth);\n    }\n    return vpss;\n  }\n\n  \n\n  \/\/ I don't think this is currently used. However, this is a virtual \n  \/\/ function where additional capabilities may be added.\n  VPSSMgr* \n  VPSSMgrFactory::newVPSSMgr(VPSSMgr_enumType type, VPStandardStateTP *vp_ptr) {\n    SpeciesThermo &spthermoRef = vp_ptr->speciesThermo();\n    switch (type) {\n    case cVPSSMGR_IDEALGAS:\n      return new VPSSMgr_IdealGas(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_CONSTVOL:\n      return new VPSSMgr_ConstVol(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_PUREFLUID:\n      throw CanteraError(\"VPSSMgrFactory::newVPSSMgr\",\n\t\t\t \"unimplemented\");\n    case cVPSSMGR_WATER_CONSTVOL:\n      return new VPSSMgr_Water_ConstVol(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_WATER_HKFT:\n      return new VPSSMgr_Water_HKFT(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_GENERAL:\n      return new VPSSMgr_General(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_UNDEF:\n    default:\n      throw UnknownVPSSMgrModel(\"VPSSMgrFactory::newVPSSMgr\", int2str(type));\n      return 0; \n    }\n  }\n\n  \/\/ I don't think this is currently used\n  VPSSMgr* newVPSSMgr(VPSSMgr_enumType type, VPStandardStateTP *vp_ptr,\n\t\t      Cantera::VPSSMgrFactory* f) {\n    if (f == 0) {\n      f = VPSSMgrFactory::factory();\n    }\n    VPSSMgr* vpsssptherm = f->newVPSSMgr(type, vp_ptr);\n    return vpsssptherm;\n  }\n\n\n  VPSSMgr* newVPSSMgr(VPStandardStateTP *tp_ptr,\n\t\t      XML_Node* phaseNode_ptr,\n\t\t      std::vector<XML_Node *> & spDataNodeList,\n\t\t      VPSSMgrFactory* f) {\n    if (f == 0) {\n      f = VPSSMgrFactory::factory();\n    }\n    VPSSMgr* vpsssptherm = f->newVPSSMgr(tp_ptr, phaseNode_ptr, spDataNodeList);\n    return vpsssptherm;\n  }\n\n\n}\n<commit_msg>Fixed issue #17. There was an obvious error in the THREAD_SAFE_CANTERA ifdef block compile.<commit_after>\/**\n *  @file VPSSMgrFactory.cpp\n *    Definitions for factory to build instances of classes that manage the\n *    calculation of standard state properties for all the species in a phase\n *    (see \\ref spthermo and class \n *    \\link Cantera::VPSSMgrFactory VPSSMgrFactory\\endlink);\n *\/\n\/*\n * $Id$\n *\/\n\n\/*\n * Copywrite (2005) Sandia Corporation. Under the terms of \n * Contract DE-AC04-94AL85000 with Sandia Corporation, the\n * U.S. Government retains certain rights in this software.\n *\/\n#ifdef WIN32\n#pragma warning(disable:4786)\n#endif\n\n\n#include \"SpeciesThermo.h\"\n\n\n#include \"VPSSMgr.h\"\n#include \"VPSSMgrFactory.h\"\n\n#include \"VPStandardStateTP.h\"\n\n#include \"VPSSMgr_IdealGas.h\"\n#include \"VPSSMgr_ConstVol.h\"\n#include \"VPSSMgr_Water_ConstVol.h\"\n#include \"VPSSMgr_Water_HKFT.h\"\n#include \"VPSSMgr_General.h\"\n\n#include \"VPSSMgr_types.h\"\n\n#include \"SpeciesThermoMgr.h\"\n#include \"speciesThermoTypes.h\"\n#include \"SpeciesThermo.h\"\n#include \"SpeciesThermoFactory.h\"\n#include \"GeneralSpeciesThermo.h\"\n\n#include \"mix_defs.h\"\n\n#include \"xml.h\"\n#include \"ctml.h\"\n\nusing namespace ctml;\nusing namespace std;\n\n\nnamespace Cantera {\n\n  VPSSMgrFactory* VPSSMgrFactory::s_factory = 0;\n\n#if defined(THREAD_SAFE_CANTERA)\n  \/\/ Defn of the static mutex variable that locks the \n  \/\/ %VPSSMgr factory singelton\n  boost::mutex VPSSMgrFactory::vpss_species_thermo_mutex;\n#endif\n \n  \n  \/\/! Examine the types of species thermo parameterizations, and return a flag indicating the type of parameterization\n  \/\/! needed by the species.\n  \/*!\n   * \n   *  @param spDataNodeList            Species Data XML node. This node contains a list\n   *                                     of species XML nodes underneath it.\n   *  @param has_nasa_idealGas         Boolean indicating that one species has a nasa ideal gas standard state\n   *  @param has_nasa_constVol         Boolean indicating that one species has a nasa ideal solution standard state\n   *  @param has_shomate_idealGas      Boolean indicating that one species has a shomate ideal gas standard state\n   *  @param has_shomate_constVol      Boolean indicating that one species has a shomate ideal solution standard state\n   *  @param has_simple_idealGas       Boolean indicating that one species has a simple ideal gas standard state\n   *  @param has_simple_constVol       Boolean indicating that one species has a simple ideal solution standard state\n   *  @param has_water                 Boolean indicating that one species has a water standard state\n   *  @param has_tpx                   Boolean indicating that one species has a tpx standard state\n   *  @param has_hptx                  Boolean indicating that one species has a htpx standard state\n   *  @param has_other                 Boolean indicating that one species has different standard state than the ones listed above\n   * \n   * @todo Make sure that spDadta_node is species Data XML node by checking \n   *      its name is speciesData\n   *\/\n  static void getVPSSMgrTypes(std::vector<XML_Node *> & spDataNodeList,\n\t\t\t      int &has_nasa_idealGas, \n\t\t\t      int &has_nasa_constVol, \n\t\t\t      int& has_shomate_idealGas, \n\t\t\t      int& has_shomate_constVol, \n\t\t\t      int& has_simple_idealGas,\n\t\t\t      int& has_simple_constVol,\n\t\t\t      int &has_water,\n\t\t\t      int &has_tpx,\n\t\t\t      int &has_hptx,\n\t\t\t      int &has_other) {\n  \n    XML_Node *ss_ptr = 0;\n    string ssModel = \"idealGas\";\n    size_t ns = spDataNodeList.size();\n    for (size_t n = 0; n < ns; n++) {\n      bool ifound = false;\n      XML_Node* spNode = spDataNodeList[n];\n      if (spNode->hasChild(\"standardState\")) {\n\tconst XML_Node& ssN = spNode->child(\"standardState\");\n\tstring mm = ssN[\"model\"];\n\tif (mm == \"waterIAPWS\" || mm == \"waterPDSS\") {\n\t  has_water++;\n\t  ifound = true;\n\t}\n\tif (mm == \"HKFT\") {\n\t  has_hptx++;\n\t  ifound = true;\n\t}\n      } \n      if (!ifound) {\n\tif (spNode->hasChild(\"thermo\")) {\n\t  const XML_Node& th = spNode->child(\"thermo\");\n\t  if (spNode->hasChild(\"standardState\")) {\n\t    ss_ptr = &(spNode->child(\"standardState\"));\n\t    ssModel = ss_ptr->attrib(\"model\");\n\t  }\n\t  if (th.hasChild(\"NASA\")) {\n\t    if (ssModel == \"idealGas\") {\n\t      has_nasa_idealGas++;\n\t    } else if (ssModel == \"constant_incompressible\" ||\n\t\t       ssModel == \"constantVolume\") {\n\t      has_nasa_constVol++;\n\t    } else if (ssModel == \"temperature_polynomial\" ||\n\t\t       ssModel == \"density_temperature_polynomial\"  ||\n\t\t       ssModel == \"constant\") {\n\t      has_other++;\n\t    } else {\n\t      throw UnknownVPSSMgrModel(\"getVPSSMgrTypes:\",\n\t\t\t\t\tspNode->attrib(\"name\"));\n\t    }\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"Shomate\")) {\n\t    if (ssModel == \"idealGas\") {\n\t      has_shomate_idealGas++;\n\t    } else if (ssModel == \"constant_incompressible\" ||\n\t\t       ssModel == \"constantVolume\") {\n\t      has_shomate_constVol++;\n\t    } else if (ssModel == \"temperature_polynomial\" ||\n\t\t       ssModel == \"density_temperature_polynomial\"  ||\n\t\t       ssModel == \"constant\") {\n\t      has_other++;\n\t    } else {\n\t      throw UnknownVPSSMgrModel(\"getVPSSMgrTypes:\",\n\t\t\t\t\tspNode->attrib(\"name\"));\n\t    }\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"const_cp\")){\n\t    if (ssModel == \"idealGas\") {\n\t      has_simple_idealGas++;\n\t    } else if (ssModel == \"constant_incompressible\" ||\n\t\t       ssModel == \"constantVolume\") {\n\t      has_simple_constVol++;\n\t    } else if (ssModel == \"temperature_polynomial\" ||\n\t\t       ssModel == \"density_temperature_polynomial\"  ||\n\t\t       ssModel == \"constant\") {\n\t      has_other++;\n\t    } else {\n\t      throw UnknownVPSSMgrModel(\"getVPSSMgrTypes:\",\n\t\t\t\t\tspNode->attrib(\"name\"));\n\t    }\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"poly\")) {\n\t    if (th.child(\"poly\")[\"order\"] == \"1\") {\n\t      has_simple_constVol = 1;\n\t      ifound = true;\n\t    } else throw CanteraError(\"newSpeciesThermo\",\n\t\t\t\t      \"poly with order > 1 not yet supported\");\n\t  }\n\t  if (th.hasChild(\"Mu0\")) {\n\t    has_other++;\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"NASA9\")) {\n\t    has_other++;\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"NASA9MULTITEMP\")) {\n\t    has_other++;\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"adsorbate\")) {\n\t    has_other++;\n\t    ifound = true;\n\t  }\n\t  if (th.hasChild(\"HKFT\")) {\n\t    has_hptx++;\n\t    ifound = true;\n\t  }\n\t} else {\n\t  throw UnknownVPSSMgrModel(\"getVPSSMgrTypes:\",\n\t\t\t\t    spNode->attrib(\"name\"));\n\t}\n      }\n    }\n  }\n\n  \/\/ Delete static instance of this class\n  \/*\n   * If it is necessary to explicitly delete the factory before\n   * the process terminates (for example, when checking for\n   * memory leaks) then this method can be called to delete it.\n   *\/\n  void VPSSMgrFactory::deleteFactory() {\n\n#if defined(THREAD_SAFE_CANTERA)\n      boost::mutex::scoped_lock lock(vpss_species_thermo_mutex);\n#endif\n      if (s_factory) {\n\tdelete s_factory;\n\ts_factory = 0;\n      }\n  }\n\n  VPSSMgrFactory::~VPSSMgrFactory() {\n  }\n\n  VPSSMgr_enumType\n  VPSSMgrFactory::VPSSMgr_StringConversion(std::string ssModel) const {\n    std::string lssModel = lowercase(ssModel); \n    VPSSMgr_enumType type;\n    if (lssModel == \"idealgas\") {\n      type = cVPSSMGR_IDEALGAS;\n    } else if (lssModel == \"constvol\") {\n      type = cVPSSMGR_CONSTVOL;\n    } else if (lssModel == \"purefuild\") {\n      type = cVPSSMGR_PUREFLUID;\n    } else if (lssModel == \"water_constvol\") {\n      type = cVPSSMGR_WATER_CONSTVOL;\n    } else if (lssModel == \"water_hkft\") {\n      type = cVPSSMGR_WATER_HKFT;\n    } else if (lssModel == \"general\") {\n      type = cVPSSMGR_GENERAL;\n    } else {\n      type = cVPSSMGR_UNDEF;\n    }\n    return type;\n  }\n  \n  \/\/ Chose the variable pressure standard state manager \n  \/\/ and the reference standard state manager\n  VPSSMgr* \n  VPSSMgrFactory::newVPSSMgr(VPStandardStateTP *vp_ptr, \n\t\t\t     XML_Node* phaseNode_ptr,\n\t\t\t     std::vector<XML_Node*> & spDataNodeList) {\n\n    std::string ssManager=\"\";\n    std::string vpssManager=\"\";\n    VPSSMgr *vpss = 0;\n\n    \/\/ First look for any explicit instructions within the XML Database\n    \/\/ for the standard state manager and the variable pressure \n    \/\/ standard state manager\n    if (phaseNode_ptr) {\n      if (phaseNode_ptr->hasChild(\"thermo\")) {\n\tconst XML_Node& thermoNode = phaseNode_ptr->child(\"thermo\");\n\tif (thermoNode.hasChild(\"standardStateManager\")) {\n\t  const XML_Node& ssNode = thermoNode.child(\"standardStateManager\");\n\t  ssManager = ssNode[\"model\"];\n\t}\n\tif (thermoNode.hasChild(\"variablePressureStandardStateManager\")) {\n\t  const XML_Node& vpssNode = thermoNode.child(\"variablePressureStandardStateManager\");\n\t  vpssManager = vpssNode[\"model\"];\n\t}\n      }\n    }\n\n    \/\/ first get the reference state handler. If we have explicit instructions,\n    \/\/ use them to spawn the object.\n    SpeciesThermo *spth = 0;\n    if (ssManager != \"\") {\n      spth = newSpeciesThermoMgr(ssManager);\n    } else {\n      spth = newSpeciesThermoMgr(spDataNodeList);\n    }\n    vp_ptr->setSpeciesThermo(spth);\n\n    \/\/ Next, if we have specific directions, use them to get the VPSSSMgr object\n    \/\/ and return immediately\n    if (vpssManager != \"\") {\n      VPSSMgr_enumType type = VPSSMgr_StringConversion(vpssManager);\n      vpss = newVPSSMgr(type, vp_ptr);\n      return vpss;\n    }\n\n \n    \/\/ If it comes back as general, then there may be some unknown \n    \/\/ parameterizations to the SpeciesThermo factory routine.\n    bool haveSomeUnknowns = true;\n    GeneralSpeciesThermo *ttmp = dynamic_cast<GeneralSpeciesThermo *>(spth);\n    if (ttmp == 0) {\n      haveSomeUnknowns = false;\n    }\n \n    \/\/ Handle special cases based on the VPStandardState types\n    if (vp_ptr->eosType() == cVPSS_IdealGas) {\n      vpss = new VPSSMgr_IdealGas(vp_ptr, spth);\n      return vpss;\n    } else if (vp_ptr->eosType() == cVPSS_ConstVol) {\n      vpss = new VPSSMgr_ConstVol(vp_ptr, spth);\n      return vpss;\n    }\n\n\n    int inasaIG = 0, inasaCV = 0, ishomateIG = 0, ishomateCV = 0,\n      isimpleIG = 0, isimpleCV = 0, \n      iwater = 0, itpx = 0, iother = 0;\n    int ihptx = 0;\n  \n    try {\n      getVPSSMgrTypes(spDataNodeList, inasaIG, inasaCV, ishomateIG, ishomateCV,\n\t\t      isimpleIG, isimpleCV, iwater, itpx, ihptx, iother);\n    } catch (UnknownSpeciesThermoModel) {\n      iother = 1;\n      popError();\n    }\n    \n    if (iwater == 1) {\n      if (ihptx == 0) {\n\tif (inasaIG ||  ishomateIG || isimpleIG) {\n\t  throw CanteraError(\"newVPSSMgr\", \"Ideal gas with liquid water\");\n\t} else {\n\t  vpss = new VPSSMgr_Water_ConstVol(vp_ptr, spth);\n\t}\n      } else {\n\tif (inasaIG ||  ishomateIG || isimpleIG) {\n\t  throw CanteraError(\"newVPSSMgr\", \"Ideal gas with liquid water\");\n\t} else if (inasaCV || ishomateCV ||  isimpleCV) {\n\t  vpss = new VPSSMgr_General(vp_ptr, spth);\n\t} else {\n\t  vpss = new VPSSMgr_Water_HKFT(vp_ptr, spth);\n\t}\n      }\n    }\n    if (vpss == 0) {\n      if (inasaCV || ishomateCV || isimpleCV) {\n\tif (!inasaIG && !ishomateIG && !isimpleIG && !itpx && !ihptx && !iother) {\n\t  vpss = new VPSSMgr_ConstVol(vp_ptr, spth);\n\t}\n      }\n    }\n    if (vpss == 0) {\n      vpss = new VPSSMgr_General(vp_ptr, spth);\n    }\n    return vpss;\n  }\n\n  \n\n  \/\/ I don't think this is currently used. However, this is a virtual \n  \/\/ function where additional capabilities may be added.\n  VPSSMgr* \n  VPSSMgrFactory::newVPSSMgr(VPSSMgr_enumType type, VPStandardStateTP *vp_ptr) {\n    SpeciesThermo &spthermoRef = vp_ptr->speciesThermo();\n    switch (type) {\n    case cVPSSMGR_IDEALGAS:\n      return new VPSSMgr_IdealGas(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_CONSTVOL:\n      return new VPSSMgr_ConstVol(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_PUREFLUID:\n      throw CanteraError(\"VPSSMgrFactory::newVPSSMgr\",\n\t\t\t \"unimplemented\");\n    case cVPSSMGR_WATER_CONSTVOL:\n      return new VPSSMgr_Water_ConstVol(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_WATER_HKFT:\n      return new VPSSMgr_Water_HKFT(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_GENERAL:\n      return new VPSSMgr_General(vp_ptr, &spthermoRef);\n      break;\n    case cVPSSMGR_UNDEF:\n    default:\n      throw UnknownVPSSMgrModel(\"VPSSMgrFactory::newVPSSMgr\", int2str(type));\n      return 0; \n    }\n  }\n\n  \/\/ I don't think this is currently used\n  VPSSMgr* newVPSSMgr(VPSSMgr_enumType type, VPStandardStateTP *vp_ptr,\n\t\t      Cantera::VPSSMgrFactory* f) {\n    if (f == 0) {\n      f = VPSSMgrFactory::factory();\n    }\n    VPSSMgr* vpsssptherm = f->newVPSSMgr(type, vp_ptr);\n    return vpsssptherm;\n  }\n\n\n  VPSSMgr* newVPSSMgr(VPStandardStateTP *tp_ptr,\n\t\t      XML_Node* phaseNode_ptr,\n\t\t      std::vector<XML_Node *> & spDataNodeList,\n\t\t      VPSSMgrFactory* f) {\n    if (f == 0) {\n      f = VPSSMgrFactory::factory();\n    }\n    VPSSMgr* vpsssptherm = f->newVPSSMgr(tp_ptr, phaseNode_ptr, spDataNodeList);\n    return vpsssptherm;\n  }\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012-2013 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 * 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: Andreas Hansson\n *\/\n\n\/**\n * @file\n * ClockedObject declaration and implementation.\n *\/\n\n#ifndef __SIM_CLOCKED_OBJECT_HH__\n#define __SIM_CLOCKED_OBJECT_HH__\n\n#include \"base\/intmath.hh\"\n#include \"base\/misc.hh\"\n#include \"params\/ClockedObject.hh\"\n#include \"sim\/core.hh\"\n#include \"sim\/clock_domain.hh\"\n#include \"sim\/sim_object.hh\"\n\n\/**\n * The ClockedObject class extends the SimObject with a clock and\n * accessor functions to relate ticks to the cycles of the object.\n *\/\nclass ClockedObject : public SimObject\n{\n\n  private:\n\n    \/\/ the tick value of the next clock edge (>= curTick()) at the\n    \/\/ time of the last call to update()\n    mutable Tick tick;\n\n    \/\/ The cycle counter value corresponding to the current value of\n    \/\/ 'tick'\n    mutable Cycles cycle;\n\n    \/**\n     * Prevent inadvertent use of the copy constructor and assignment\n     * operator by making them private.\n     *\/\n    ClockedObject(ClockedObject&);\n    ClockedObject& operator=(ClockedObject&);\n\n    \/**\n     *  Align cycle and tick to the next clock edge if not already done.\n     *\/\n    void update() const\n    {\n        \/\/ both tick and cycle are up-to-date and we are done, note\n        \/\/ that the >= is important as it captures cases where tick\n        \/\/ has already passed curTick()\n        if (tick >= curTick())\n            return;\n\n        \/\/ optimise for the common case and see if the tick should be\n        \/\/ advanced by a single clock period\n        tick += clockPeriod();\n        ++cycle;\n\n        \/\/ see if we are done at this point\n        if (tick >= curTick())\n            return;\n\n        \/\/ if not, we have to recalculate the cycle and tick, we\n        \/\/ perform the calculations in terms of relative cycles to\n        \/\/ allow changes to the clock period in the future\n        Cycles elapsedCycles(divCeil(curTick() - tick, clockPeriod()));\n        cycle += elapsedCycles;\n        tick += elapsedCycles * clockPeriod();\n    }\n\n    \/**\n     * The clock domain this clocked object belongs to\n     *\/\n    ClockDomain &clockDomain;\n\n  protected:\n\n    \/**\n     * Create a clocked object and set the clock domain based on the\n     * parameters.\n     *\/\n    ClockedObject(const ClockedObjectParams* p) :\n        SimObject(p), tick(0), cycle(0), clockDomain(*p->clk_domain)\n    {\n    }\n\n    \/**\n     * Virtual destructor due to inheritance.\n     *\/\n    virtual ~ClockedObject() { }\n\n    \/**\n     * Reset the object's clock using the current global tick value. Likely\n     * to be used only when the global clock is reset. Currently, this done\n     * only when Ruby is done warming up the memory system.\n     *\/\n    void resetClock() const\n    {\n        Cycles elapsedCycles(divCeil(curTick(), clockPeriod()));\n        cycle = elapsedCycles;\n        tick = elapsedCycles * clockPeriod();\n    }\n\n  public:\n\n    \/**\n     * Determine the tick when a cycle begins, by default the current\n     * one, but the argument also enables the caller to determine a\n     * future cycle.\n     *\n     * @param cycles The number of cycles into the future\n     *\n     * @return The tick when the clock edge occurs\n     *\/\n    inline Tick clockEdge(Cycles cycles = Cycles(0)) const\n    {\n        \/\/ align tick to the next clock edge\n        update();\n\n        \/\/ figure out when this future cycle is\n        return tick + clockPeriod() * cycles;\n    }\n\n    \/**\n     * Determine the current cycle, corresponding to a tick aligned to\n     * a clock edge.\n     *\n     * @return The current cycle count\n     *\/\n    inline Cycles curCycle() const\n    {\n        \/\/ align cycle to the next clock edge.\n        update();\n\n        return cycle;\n    }\n\n    \/**\n     * Based on the clock of the object, determine the tick when the next\n     * cycle begins, in other words, return the next clock edge.\n     * (This can never be the current tick.)\n     *\n     * @return The tick when the next cycle starts\n     *\/\n    Tick nextCycle() const\n    { return clockEdge(Cycles(1)); }\n\n    inline uint64_t frequency() const\n    {\n        return SimClock::Frequency \/ clockPeriod();\n    }\n\n    inline Tick clockPeriod() const\n    {\n        return clockDomain.clockPeriod();\n    }\n\n    inline Cycles ticksToCycles(Tick t) const\n    { return Cycles(t \/ clockPeriod()); }\n\n};\n\n#endif \/\/__SIM_CLOCKED_OBJECT_HH__\n<commit_msg>sim: correct ticksToCycles() function.<commit_after>\/*\n * Copyright (c) 2012-2013 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 * 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: Andreas Hansson\n *\/\n\n\/**\n * @file\n * ClockedObject declaration and implementation.\n *\/\n\n#ifndef __SIM_CLOCKED_OBJECT_HH__\n#define __SIM_CLOCKED_OBJECT_HH__\n\n#include \"base\/intmath.hh\"\n#include \"base\/misc.hh\"\n#include \"params\/ClockedObject.hh\"\n#include \"sim\/core.hh\"\n#include \"sim\/clock_domain.hh\"\n#include \"sim\/sim_object.hh\"\n\n\/**\n * The ClockedObject class extends the SimObject with a clock and\n * accessor functions to relate ticks to the cycles of the object.\n *\/\nclass ClockedObject : public SimObject\n{\n\n  private:\n\n    \/\/ the tick value of the next clock edge (>= curTick()) at the\n    \/\/ time of the last call to update()\n    mutable Tick tick;\n\n    \/\/ The cycle counter value corresponding to the current value of\n    \/\/ 'tick'\n    mutable Cycles cycle;\n\n    \/**\n     * Prevent inadvertent use of the copy constructor and assignment\n     * operator by making them private.\n     *\/\n    ClockedObject(ClockedObject&);\n    ClockedObject& operator=(ClockedObject&);\n\n    \/**\n     *  Align cycle and tick to the next clock edge if not already done.\n     *\/\n    void update() const\n    {\n        \/\/ both tick and cycle are up-to-date and we are done, note\n        \/\/ that the >= is important as it captures cases where tick\n        \/\/ has already passed curTick()\n        if (tick >= curTick())\n            return;\n\n        \/\/ optimise for the common case and see if the tick should be\n        \/\/ advanced by a single clock period\n        tick += clockPeriod();\n        ++cycle;\n\n        \/\/ see if we are done at this point\n        if (tick >= curTick())\n            return;\n\n        \/\/ if not, we have to recalculate the cycle and tick, we\n        \/\/ perform the calculations in terms of relative cycles to\n        \/\/ allow changes to the clock period in the future\n        Cycles elapsedCycles(divCeil(curTick() - tick, clockPeriod()));\n        cycle += elapsedCycles;\n        tick += elapsedCycles * clockPeriod();\n    }\n\n    \/**\n     * The clock domain this clocked object belongs to\n     *\/\n    ClockDomain &clockDomain;\n\n  protected:\n\n    \/**\n     * Create a clocked object and set the clock domain based on the\n     * parameters.\n     *\/\n    ClockedObject(const ClockedObjectParams* p) :\n        SimObject(p), tick(0), cycle(0), clockDomain(*p->clk_domain)\n    {\n    }\n\n    \/**\n     * Virtual destructor due to inheritance.\n     *\/\n    virtual ~ClockedObject() { }\n\n    \/**\n     * Reset the object's clock using the current global tick value. Likely\n     * to be used only when the global clock is reset. Currently, this done\n     * only when Ruby is done warming up the memory system.\n     *\/\n    void resetClock() const\n    {\n        Cycles elapsedCycles(divCeil(curTick(), clockPeriod()));\n        cycle = elapsedCycles;\n        tick = elapsedCycles * clockPeriod();\n    }\n\n  public:\n\n    \/**\n     * Determine the tick when a cycle begins, by default the current\n     * one, but the argument also enables the caller to determine a\n     * future cycle.\n     *\n     * @param cycles The number of cycles into the future\n     *\n     * @return The tick when the clock edge occurs\n     *\/\n    inline Tick clockEdge(Cycles cycles = Cycles(0)) const\n    {\n        \/\/ align tick to the next clock edge\n        update();\n\n        \/\/ figure out when this future cycle is\n        return tick + clockPeriod() * cycles;\n    }\n\n    \/**\n     * Determine the current cycle, corresponding to a tick aligned to\n     * a clock edge.\n     *\n     * @return The current cycle count\n     *\/\n    inline Cycles curCycle() const\n    {\n        \/\/ align cycle to the next clock edge.\n        update();\n\n        return cycle;\n    }\n\n    \/**\n     * Based on the clock of the object, determine the tick when the next\n     * cycle begins, in other words, return the next clock edge.\n     * (This can never be the current tick.)\n     *\n     * @return The tick when the next cycle starts\n     *\/\n    Tick nextCycle() const\n    { return clockEdge(Cycles(1)); }\n\n    inline uint64_t frequency() const\n    {\n        return SimClock::Frequency \/ clockPeriod();\n    }\n\n    inline Tick clockPeriod() const\n    {\n        return clockDomain.clockPeriod();\n    }\n\n    inline Cycles ticksToCycles(Tick t) const\n    { return Cycles(divCeil(t, clockPeriod())); }\n\n};\n\n#endif \/\/__SIM_CLOCKED_OBJECT_HH__\n<|endoftext|>"}
{"text":"<commit_before>\/*  Copyright (c) MediaArea.net SARL. All Rights Reserved.\r\n *\r\n *  Use of this source code is governed by a BSD-style license that can\r\n *  be found in the License.html file in the root of the source tree.\r\n *\/\r\n\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\/\/\r\n\/\/ Utility methods for TinyXML-2\r\n\/\/ Contributor: Peter Chapman, pchapman@vidcheck.com\r\n\/\/\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/XmlUtils.h\"\r\n#include <string>\r\n#include <cstddef>\r\nusing namespace tinyxml2;\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/ Finds the value of the named attribute within the given element or its\r\n\/\/ closest ancestor\r\nstatic const char *AncestorAttrVal(const XMLElement* Elem, const char* AttrName)\r\n{\r\n    if (!Elem)\r\n        return NULL;\r\n    if (const XMLAttribute* Attr=Elem->FindAttribute(AttrName))\r\n        return Attr->Value();\r\n    const XMLElement* ParentElem=NULL;\r\n    if (const XMLNode* ParentNode=Elem->Parent())\r\n        ParentElem=ParentNode->ToElement();\r\n    return AncestorAttrVal(ParentElem, AttrName);\r\n}\r\n\r\nnamespace MediaInfoLib\r\n{\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\r\nconst char *LocalName(const XMLElement* Elem)\r\n{\r\n    const char* Name=Elem->Name();\r\n    const char* Colon=strrchr(Name, ':');\r\n    return Colon ? Colon+1 : Name;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\r\nconst char *LocalName(const XMLElement* Elem, const char* &Ns \/* out *\/)\r\n{\r\n    const char* Name=Elem->Name();\r\n    if (const char* Colon=strrchr(Name, ':'))\r\n    {\r\n        \/\/ Search element and ancestors for given namespace prefix\r\n        Ns=AncestorAttrVal(Elem, (\"xmlns:\"+std::string(Name, Colon)).c_str());\r\n        \/\/ NB no default namespace if given prefix not found, will return NULL\r\n        return Colon+1;\r\n    }\r\n    else\r\n    {\r\n        Ns=AncestorAttrVal(Elem, \"xmlns\");\r\n        if (!Ns)\r\n            Ns = \"\"; \/\/ default namespace\r\n        return Name;\r\n    }\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\r\nbool MatchQName(const XMLElement* Elem, const char* Name, const char* NameSpace)\r\n{\r\n    if (strcmp(LocalName(Elem), Name))\r\n        return false; \/\/ exit cheaply if local name doesn't match\r\n    const char *ElemNs;\r\n    LocalName(Elem, ElemNs); \/\/ look up namespace\r\n    return ElemNs && \/\/ ElemNs can be null if Elem uses a bad namespace prefix\r\n           !strcmp(ElemNs, NameSpace); \/\/ compare namespaces\r\n}\r\n\r\n}\r\n<commit_msg>+ XML utility methods to assist with namespace matching in TinyXML-2, precompilation was failing with Visual C++<commit_after>\/*  Copyright (c) MediaArea.net SARL. All Rights Reserved.\r\n *\r\n *  Use of this source code is governed by a BSD-style license that can\r\n *  be found in the License.html file in the root of the source tree.\r\n *\/\r\n\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\/\/\r\n\/\/ Utility methods for TinyXML-2\r\n\/\/ Contributor: Peter Chapman, pchapman@vidcheck.com\r\n\/\/\r\n\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Pre-compilation\r\n#include \"MediaInfo\/PreComp.h\"\r\n#ifdef __BORLANDC__\r\n#pragma hdrstop\r\n#endif\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/XmlUtils.h\"\r\n#include <string>\r\n#include <cstddef>\r\nusing namespace tinyxml2;\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/ Finds the value of the named attribute within the given element or its\r\n\/\/ closest ancestor\r\nstatic const char *AncestorAttrVal(const XMLElement* Elem, const char* AttrName)\r\n{\r\n    if (!Elem)\r\n        return NULL;\r\n    if (const XMLAttribute* Attr=Elem->FindAttribute(AttrName))\r\n        return Attr->Value();\r\n    const XMLElement* ParentElem=NULL;\r\n    if (const XMLNode* ParentNode=Elem->Parent())\r\n        ParentElem=ParentNode->ToElement();\r\n    return AncestorAttrVal(ParentElem, AttrName);\r\n}\r\n\r\nnamespace MediaInfoLib\r\n{\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\r\nconst char *LocalName(const XMLElement* Elem)\r\n{\r\n    const char* Name=Elem->Name();\r\n    const char* Colon=strrchr(Name, ':');\r\n    return Colon ? Colon+1 : Name;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\r\nconst char *LocalName(const XMLElement* Elem, const char* &Ns \/* out *\/)\r\n{\r\n    const char* Name=Elem->Name();\r\n    if (const char* Colon=strrchr(Name, ':'))\r\n    {\r\n        \/\/ Search element and ancestors for given namespace prefix\r\n        Ns=AncestorAttrVal(Elem, (\"xmlns:\"+std::string(Name, Colon)).c_str());\r\n        \/\/ NB no default namespace if given prefix not found, will return NULL\r\n        return Colon+1;\r\n    }\r\n    else\r\n    {\r\n        Ns=AncestorAttrVal(Elem, \"xmlns\");\r\n        if (!Ns)\r\n            Ns = \"\"; \/\/ default namespace\r\n        return Name;\r\n    }\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\r\nbool MatchQName(const XMLElement* Elem, const char* Name, const char* NameSpace)\r\n{\r\n    if (strcmp(LocalName(Elem), Name))\r\n        return false; \/\/ exit cheaply if local name doesn't match\r\n    const char *ElemNs;\r\n    LocalName(Elem, ElemNs); \/\/ look up namespace\r\n    return ElemNs && \/\/ ElemNs can be null if Elem uses a bad namespace prefix\r\n           !strcmp(ElemNs, NameSpace); \/\/ compare namespaces\r\n}\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015 The Rust Project Developers. See the COPYRIGHT\n\/\/ file at the top-level directory of this distribution and at\n\/\/ http:\/\/rust-lang.org\/COPYRIGHT.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0> or the MIT license\n\/\/ <LICENSE-MIT or http:\/\/opensource.org\/licenses\/MIT>, at your\n\/\/ option. This file may not be copied, modified, or distributed\n\/\/ except according to those terms.\n\n#include \"rustllvm.h\"\n\n#include \"llvm\/Object\/Archive.h\"\n#include \"llvm\/Object\/ArchiveWriter.h\"\n\nusing namespace llvm;\nusing namespace llvm::object;\n\nstruct LLVMRustArchiveMember {\n  const char *filename;\n  const char *name;\n  Archive::Child child;\n\n  LLVMRustArchiveMember(): filename(NULL), name(NULL),\n#if LLVM_VERSION_MINOR >= 8\n    child(NULL, NULL, NULL)\n#else\n    child(NULL, NULL)\n#endif\n  {}\n  ~LLVMRustArchiveMember() {}\n};\n\ntypedef OwningBinary<Archive> RustArchive;\n\nextern \"C\" void*\nLLVMRustOpenArchive(char *path) {\n    ErrorOr<std::unique_ptr<MemoryBuffer>> buf_or = MemoryBuffer::getFile(path,\n                                                                          -1,\n                                                                          false);\n    if (!buf_or) {\n        LLVMRustSetLastError(buf_or.getError().message().c_str());\n        return nullptr;\n    }\n\n    ErrorOr<std::unique_ptr<Archive>> archive_or =\n        Archive::create(buf_or.get()->getMemBufferRef());\n\n    if (!archive_or) {\n        LLVMRustSetLastError(archive_or.getError().message().c_str());\n        return nullptr;\n    }\n\n    OwningBinary<Archive> *ret = new OwningBinary<Archive>(\n            std::move(archive_or.get()), std::move(buf_or.get()));\n\n    return ret;\n}\n\nextern \"C\" void\nLLVMRustDestroyArchive(RustArchive *ar) {\n    delete ar;\n}\n\nstruct RustArchiveIterator {\n    Archive::child_iterator cur;\n    Archive::child_iterator end;\n};\n\nextern \"C\" RustArchiveIterator*\nLLVMRustArchiveIteratorNew(RustArchive *ra) {\n    Archive *ar = ra->getBinary();\n    RustArchiveIterator *rai = new RustArchiveIterator();\n    rai->cur = ar->child_begin();\n    rai->end = ar->child_end();\n    return rai;\n}\n\nextern \"C\" const Archive::Child*\nLLVMRustArchiveIteratorNext(RustArchiveIterator *rai) {\n    if (rai->cur == rai->end)\n        return NULL;\n#if LLVM_VERSION_MINOR >= 8\n    const ErrorOr<Archive::Child>* cur = rai->cur.operator->();\n    if (!*cur) {\n        LLVMRustSetLastError(cur->getError().message().c_str());\n        return NULL;\n    }\n    const Archive::Child &child = cur->get();\n#else\n    const Archive::Child &child = *rai->cur.operator->();\n#endif\n    Archive::Child *ret = new Archive::Child(child);\n\n    ++rai->cur;\n    return ret;\n}\n\nextern \"C\" void\nLLVMRustArchiveChildFree(Archive::Child *child) {\n    delete child;\n}\n\nextern \"C\" void\nLLVMRustArchiveIteratorFree(RustArchiveIterator *rai) {\n    delete rai;\n}\n\nextern \"C\" const char*\nLLVMRustArchiveChildName(const Archive::Child *child, size_t *size) {\n    ErrorOr<StringRef> name_or_err = child->getName();\n    if (name_or_err.getError())\n        return NULL;\n    StringRef name = name_or_err.get();\n    *size = name.size();\n    return name.data();\n}\n\nextern \"C\" const char*\nLLVMRustArchiveChildData(Archive::Child *child, size_t *size) {\n    StringRef buf;\n    ErrorOr<StringRef> buf_or_err = child->getBuffer();\n    if (buf_or_err.getError()) {\n      LLVMRustSetLastError(buf_or_err.getError().message().c_str());\n      return NULL;\n    }\n    buf = buf_or_err.get();\n    *size = buf.size();\n    return buf.data();\n}\n\nextern \"C\" LLVMRustArchiveMember*\nLLVMRustArchiveMemberNew(char *Filename, char *Name, Archive::Child *child) {\n    LLVMRustArchiveMember *Member = new LLVMRustArchiveMember;\n    Member->filename = Filename;\n    Member->name = Name;\n    if (child)\n        Member->child = *child;\n    return Member;\n}\n\nextern \"C\" void\nLLVMRustArchiveMemberFree(LLVMRustArchiveMember *Member) {\n    delete Member;\n}\n\nextern \"C\" int\nLLVMRustWriteArchive(char *Dst,\n                     size_t NumMembers,\n                     const LLVMRustArchiveMember **NewMembers,\n                     bool WriteSymbtab,\n                     Archive::Kind Kind) {\n  std::vector<NewArchiveMember> Members;\n\n  for (size_t i = 0; i < NumMembers; i++) {\n    auto Member = NewMembers[i];\n    assert(Member->name);\n    if (Member->filename) {\n#if LLVM_VERSION_MINOR >= 9\n      Expected<NewArchiveMember> MOrErr = NewArchiveMember::getFile(Member->filename, true);\n      if (!MOrErr) {\n        LLVMRustSetLastError(toString(MOrErr.takeError()).c_str());\n        return -1;\n      }\n      Members.push_back(std::move(*MOrErr));\n#else\n      Members.push_back(NewArchiveIterator(Member->filename, Member->name));\n#endif\n    } else {\n#if LLVM_VERSION_MINOR >= 9\n      Expected<NewArchiveMember> MOrErr = NewArchiveMember::getOldMember(Member->child, true);\n      if (!MOrErr) {\n        LLVMRustSetLastError(toString(MOrErr.takeError()).c_str());\n        return -1;\n      }\n      Members.push_back(std::move(*MOrErr));\n#else\n      Members.push_back(NewArchiveIterator(Member->child, Member->name));\n#endif\n    }\n  }\n#if LLVM_VERSION_MINOR >= 8\n  auto pair = writeArchive(Dst, Members, WriteSymbtab, Kind, true, false);\n#else\n  auto pair = writeArchive(Dst, Members, WriteSymbtab, Kind, true);\n#endif\n  if (!pair.second)\n    return 0;\n  LLVMRustSetLastError(pair.second.message().c_str());\n  return -1;\n}\n<commit_msg>[LLVM-3.9] Update return type for Archive::create<commit_after>\/\/ Copyright 2015 The Rust Project Developers. See the COPYRIGHT\n\/\/ file at the top-level directory of this distribution and at\n\/\/ http:\/\/rust-lang.org\/COPYRIGHT.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0> or the MIT license\n\/\/ <LICENSE-MIT or http:\/\/opensource.org\/licenses\/MIT>, at your\n\/\/ option. This file may not be copied, modified, or distributed\n\/\/ except according to those terms.\n\n#include \"rustllvm.h\"\n\n#include \"llvm\/Object\/Archive.h\"\n#include \"llvm\/Object\/ArchiveWriter.h\"\n\nusing namespace llvm;\nusing namespace llvm::object;\n\nstruct LLVMRustArchiveMember {\n  const char *filename;\n  const char *name;\n  Archive::Child child;\n\n  LLVMRustArchiveMember(): filename(NULL), name(NULL),\n#if LLVM_VERSION_MINOR >= 8\n    child(NULL, NULL, NULL)\n#else\n    child(NULL, NULL)\n#endif\n  {}\n  ~LLVMRustArchiveMember() {}\n};\n\ntypedef OwningBinary<Archive> RustArchive;\n\nextern \"C\" void*\nLLVMRustOpenArchive(char *path) {\n    ErrorOr<std::unique_ptr<MemoryBuffer>> buf_or = MemoryBuffer::getFile(path,\n                                                                          -1,\n                                                                          false);\n    if (!buf_or) {\n        LLVMRustSetLastError(buf_or.getError().message().c_str());\n        return nullptr;\n    }\n\n#if LLVM_VERSION_MINOR <= 8\n    ErrorOr<std::unique_ptr<Archive>> archive_or =\n#else\n    Expected<std::unique_ptr<Archive>> archive_or =\n#endif\n        Archive::create(buf_or.get()->getMemBufferRef());\n\n    if (!archive_or) {\n#if LLVM_VERSION_MINOR <= 8\n        LLVMRustSetLastError(archive_or.getError().message().c_str());\n#else\n        LLVMRustSetLastError(toString(archive_or.takeError()).c_str());\n#endif\n        return nullptr;\n    }\n\n    OwningBinary<Archive> *ret = new OwningBinary<Archive>(\n            std::move(archive_or.get()), std::move(buf_or.get()));\n\n    return ret;\n}\n\nextern \"C\" void\nLLVMRustDestroyArchive(RustArchive *ar) {\n    delete ar;\n}\n\nstruct RustArchiveIterator {\n    Archive::child_iterator cur;\n    Archive::child_iterator end;\n};\n\nextern \"C\" RustArchiveIterator*\nLLVMRustArchiveIteratorNew(RustArchive *ra) {\n    Archive *ar = ra->getBinary();\n    RustArchiveIterator *rai = new RustArchiveIterator();\n    rai->cur = ar->child_begin();\n    rai->end = ar->child_end();\n    return rai;\n}\n\nextern \"C\" const Archive::Child*\nLLVMRustArchiveIteratorNext(RustArchiveIterator *rai) {\n    if (rai->cur == rai->end)\n        return NULL;\n#if LLVM_VERSION_MINOR >= 8\n    const ErrorOr<Archive::Child>* cur = rai->cur.operator->();\n    if (!*cur) {\n        LLVMRustSetLastError(cur->getError().message().c_str());\n        return NULL;\n    }\n    const Archive::Child &child = cur->get();\n#else\n    const Archive::Child &child = *rai->cur.operator->();\n#endif\n    Archive::Child *ret = new Archive::Child(child);\n\n    ++rai->cur;\n    return ret;\n}\n\nextern \"C\" void\nLLVMRustArchiveChildFree(Archive::Child *child) {\n    delete child;\n}\n\nextern \"C\" void\nLLVMRustArchiveIteratorFree(RustArchiveIterator *rai) {\n    delete rai;\n}\n\nextern \"C\" const char*\nLLVMRustArchiveChildName(const Archive::Child *child, size_t *size) {\n    ErrorOr<StringRef> name_or_err = child->getName();\n    if (name_or_err.getError())\n        return NULL;\n    StringRef name = name_or_err.get();\n    *size = name.size();\n    return name.data();\n}\n\nextern \"C\" const char*\nLLVMRustArchiveChildData(Archive::Child *child, size_t *size) {\n    StringRef buf;\n    ErrorOr<StringRef> buf_or_err = child->getBuffer();\n    if (buf_or_err.getError()) {\n      LLVMRustSetLastError(buf_or_err.getError().message().c_str());\n      return NULL;\n    }\n    buf = buf_or_err.get();\n    *size = buf.size();\n    return buf.data();\n}\n\nextern \"C\" LLVMRustArchiveMember*\nLLVMRustArchiveMemberNew(char *Filename, char *Name, Archive::Child *child) {\n    LLVMRustArchiveMember *Member = new LLVMRustArchiveMember;\n    Member->filename = Filename;\n    Member->name = Name;\n    if (child)\n        Member->child = *child;\n    return Member;\n}\n\nextern \"C\" void\nLLVMRustArchiveMemberFree(LLVMRustArchiveMember *Member) {\n    delete Member;\n}\n\nextern \"C\" int\nLLVMRustWriteArchive(char *Dst,\n                     size_t NumMembers,\n                     const LLVMRustArchiveMember **NewMembers,\n                     bool WriteSymbtab,\n                     Archive::Kind Kind) {\n  std::vector<NewArchiveMember> Members;\n\n  for (size_t i = 0; i < NumMembers; i++) {\n    auto Member = NewMembers[i];\n    assert(Member->name);\n    if (Member->filename) {\n#if LLVM_VERSION_MINOR >= 9\n      Expected<NewArchiveMember> MOrErr = NewArchiveMember::getFile(Member->filename, true);\n      if (!MOrErr) {\n        LLVMRustSetLastError(toString(MOrErr.takeError()).c_str());\n        return -1;\n      }\n      Members.push_back(std::move(*MOrErr));\n#else\n      Members.push_back(NewArchiveIterator(Member->filename, Member->name));\n#endif\n    } else {\n#if LLVM_VERSION_MINOR >= 9\n      Expected<NewArchiveMember> MOrErr = NewArchiveMember::getOldMember(Member->child, true);\n      if (!MOrErr) {\n        LLVMRustSetLastError(toString(MOrErr.takeError()).c_str());\n        return -1;\n      }\n      Members.push_back(std::move(*MOrErr));\n#else\n      Members.push_back(NewArchiveIterator(Member->child, Member->name));\n#endif\n    }\n  }\n#if LLVM_VERSION_MINOR >= 8\n  auto pair = writeArchive(Dst, Members, WriteSymbtab, Kind, true, false);\n#else\n  auto pair = writeArchive(Dst, Members, WriteSymbtab, Kind, true);\n#endif\n  if (!pair.second)\n    return 0;\n  LLVMRustSetLastError(pair.second.message().c_str());\n  return -1;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"src\/s3_cmds\/zgw_s3_object.h\"\n\n#include <vector>\n\n#include <glog\/logging.h>\n#include \"slash\/include\/env.h\"\n#include \"slash\/include\/slash_string.h\"\n\nbool GetObjectCmd::DoInitial() {\n  block_buffer_.clear();\n  data_size_ = 0;\n  range_result_.clear();\n  std::queue<std::tuple<uint64_t, uint64_t, uint64_t>> empty;\n  std::swap(blocks_, empty);\n  need_partial_ = req_headers_.count(\"range\");\n\n  return TryAuth();\n}\n\nint GetObjectCmd::ParseRange(const std::string& range, uint64_t data_size,\n                             uint64_t* range_start, uint64_t* range_end) {\n  \/\/ Check whether range is valid\n  \/\/ Support sigle range for only\n  if (range.find(\"bytes=\") == std::string::npos) {\n    return 400;\n  }\n  std::string range_header = range.substr(6);\n  int start = 0;\n  int end = INT32_MAX;\n  int res = sscanf(range_header.c_str(), \"%d-%d\", &start, &end);\n  end = std::min(data_size - 1, static_cast<uint64_t>(end));\n  if (res == 1 && start < 0) {\n    start = data_size + start;\n    end = data_size - 1;\n  }\n\n  if (res > 0 &&\n      start <= end) {\n    \/\/ Valid range\n    LOG(INFO) << \"Get range: \" << start << \"-\" << end;\n    *range_start = start;\n    *range_end = end;\n    return 206;\n  }\n  return 416;\n}\n\nvoid GetObjectCmd::ParseBlocksFrom(const std::vector<std::string>& block_indexes) {\n  if (data_size_ == 0) {\n    if (need_partial_) {\n      http_ret_code_ = 416;\n      GenerateErrorXml(kInvalidRange, object_name_);\n      return;\n    } else {\n      return;\n    }\n  }\n  assert(data_size_ > 0);\n  uint64_t range_start = 0;\n  uint64_t range_end = data_size_ - 1;\n  if (need_partial_) {\n    http_ret_code_ = ParseRange(req_headers_.at(\"range\"), data_size_,\n                                &range_start, &range_end);\n    if (http_ret_code_ == 400) {\n      GenerateErrorXml(kInvalidArgument, \"range\");\n    } else if (http_ret_code_ == 416) {\n      GenerateErrorXml(kInvalidRange, object_name_);\n    } else if (http_ret_code_ == 206) {\n      \/\/ Success partial\n      char buf[100];\n      sprintf(buf, \"bytes %lu-%lu\/%lu\", range_start, range_end, object_.size);\n      http_ret_code_ = 206;\n      range_result_.assign(buf);\n      data_size_ = range_end - range_start + 1;\n    } else {\n      \/\/ Can't reach here\n    }\n  }\n  uint64_t needed_size = range_end - range_start + 1;\n  for (size_t i = 0; i < block_indexes.size(); i++) {\n    \/\/ Parse all block needed\n    uint64_t start_block, end_block, start_byte, data_size;\n    int ret = sscanf(block_indexes[i].c_str(), \"%lu-%lu(%lu,%lu)\",\n                     &start_block, &end_block, &start_byte, &data_size);\n\n    \/\/ Select block interval index\n    if (range_start >= (data_size - start_byte)) {\n      range_start -= (data_size - start_byte);\n      start_byte = 0;\n      \/\/ Next block group\n      continue;\n    }\n\n    for (uint64_t b = start_block; b <= end_block; b++) {\n      uint64_t cur_bsize = std::min(data_size, zgwstore::kZgwBlockSize) - start_byte;\n      \/\/ Select block\n      if (range_start >= cur_bsize) {\n        range_start -= cur_bsize;\n        start_byte = 0;\n        \/\/ Next block\n        continue;\n      }\n\n      uint64_t remain = std::min(needed_size,\n                                 zgwstore::kZgwBlockSize - range_start);\n      remain = std::min(remain, data_size);\n\n      blocks_.push(std::make_tuple(b, start_byte + range_start, remain));\n      needed_size -= remain;\n      start_byte = 0;\n\n      if (needed_size == 0) {\n        return;\n      }\n\n      range_start = 0;\n    }\n  }\n}\n\nvoid GetObjectCmd::SortBlockIndexes(std::vector<std::string>* block_indexes) {\n  std::sort(block_indexes->begin(), block_indexes->end(),\n            [](const std::string& a, const std::string& b) {\n              return std::atoi(a.substr(0, 5).c_str()) <\n                      std::atoi(b.substr(0, 5).c_str());\n            });\n  std::vector<std::string> tmp(*block_indexes);\n  block_indexes->clear();\n  for (auto& b : tmp) {\n    \/\/ Trim sort sign e.g. 00012(3-9)(0,12) -> (3-9)(0,12)\n    b = b.substr(5);\n    std::vector<std::string> items;\n    slash::StringSplit(b, '|', items);\n    for (auto& i : items) {\n      block_indexes->push_back(i);\n    }\n  }\n}\n\nvoid GetObjectCmd::DoAndResponse(pink::HttpResponse* resp) {\n  if (http_ret_code_ == 200) {\n    \/\/ Get object_ meta\n    Status s = store_->GetObject(user_name_, bucket_name_, object_name_,\n                                 &object_);\n    if (!s.ok()) {\n      if (s.ToString().find(\"Bucket Doesn't Belong To This User\") !=\n          std::string::npos) {\n        http_ret_code_ = 404;\n        GenerateErrorXml(kNoSuchBucket, bucket_name_);\n      } else if (s.ToString().find(\"Object Not Found\") != std::string::npos) {\n        http_ret_code_ = 404;\n        GenerateErrorXml(kNoSuchKey, object_name_);\n      }\n    } else {\n      data_size_ = object_.size;\n\n      std::vector<std::string> sorted_block_indexes;\n      if (object_.upload_id != \"_\") {\n        s = store_->GetMultiBlockSet(bucket_name_, object_name_,\n                                     object_.upload_id, &sorted_block_indexes);\n        if (s.IsIOError()) {\n          http_ret_code_ = 500;\n        }\n        \/\/ Sort block indexes load from redis set\n        SortBlockIndexes(&sorted_block_indexes);\n      } else {\n        \/\/ Sigle block index needn't sorting\n        sorted_block_indexes.push_back(object_.data_block);\n      }\n      ParseBlocksFrom(sorted_block_indexes);\n    }\n\n    if (http_ret_code_ == 200 ||\n        http_ret_code_ == 206) {\n      \/\/ Success\n      if (http_ret_code_ == 206) {\n        resp->SetHeaders(\"Content-Range\", range_result_);\n      }\n      resp->SetHeaders(\"ETag\", \"\\\"\" + object_.etag + \"\\\"\");\n      resp->SetHeaders(\"Last-Modified\", http_nowtime(object_.last_modified));\n      resp->SetContentLength(data_size_);\n    }\n  }\n  if (http_ret_code_ != 206 &&\n      http_ret_code_ != 200) {\n    \/\/ Response error xml\n    resp->SetContentLength(http_response_xml_.size());\n  }\n  resp->SetStatusCode(http_ret_code_);\n}\n\nint GetObjectCmd::DoResponseBody(char* buf, size_t max_size) {\n  if (http_ret_code_ != 200 &&\n      http_ret_code_ != 206 &&\n      !http_response_xml_.empty()) {\n    \/\/ Error happend, response error xml\n    if (max_size < http_response_xml_.size()) {\n      memcpy(buf, http_response_xml_.data(), max_size);\n      http_response_xml_.assign(http_response_xml_.substr(max_size));\n    } else {\n      memcpy(buf, http_response_xml_.data(), http_response_xml_.size());\n    }\n    return std::min(max_size, http_response_xml_.size());\n  }\n  \/\/ Response object data\n  if (data_size_ == 0) {\n    return 0;\n  }\n\n  uint64_t block_size = std::get<2>(blocks_.front());\n  if (block_size > max_size) {\n    \/\/ Waiting for enough buffer\n    return 0;\n  }\n  std::string block_index = std::to_string(std::get<0>(blocks_.front()));\n  uint64_t start_byte = std::get<1>(blocks_.front());\n  blocks_.pop();\n  Status s = store_->BlockGet(block_index, &block_buffer_);\n  if (!s.ok()) {\n    \/\/ Zeppelin error, close the http connection\n    return -1;\n  }\n  memcpy(buf, block_buffer_.data() + start_byte, block_size);\n  data_size_ -= block_size; \/\/ Has written\n  return block_size;\n}\n<commit_msg>Bugfix of get object copied<commit_after>#include \"src\/s3_cmds\/zgw_s3_object.h\"\n\n#include <vector>\n\n#include <glog\/logging.h>\n#include \"slash\/include\/env.h\"\n#include \"slash\/include\/slash_string.h\"\n\nbool GetObjectCmd::DoInitial() {\n  block_buffer_.clear();\n  data_size_ = 0;\n  range_result_.clear();\n  std::queue<std::tuple<uint64_t, uint64_t, uint64_t>> empty;\n  std::swap(blocks_, empty);\n  need_partial_ = req_headers_.count(\"range\");\n\n  return TryAuth();\n}\n\nint GetObjectCmd::ParseRange(const std::string& range, uint64_t data_size,\n                             uint64_t* range_start, uint64_t* range_end) {\n  \/\/ Check whether range is valid\n  \/\/ Support sigle range for only\n  if (range.find(\"bytes=\") == std::string::npos) {\n    return 400;\n  }\n  std::string range_header = range.substr(6);\n  int start = 0;\n  int end = INT32_MAX;\n  int res = sscanf(range_header.c_str(), \"%d-%d\", &start, &end);\n  end = std::min(data_size - 1, static_cast<uint64_t>(end));\n  if (res == 1 && start < 0) {\n    start = data_size + start;\n    end = data_size - 1;\n  }\n\n  if (res > 0 &&\n      start <= end) {\n    \/\/ Valid range\n    LOG(INFO) << \"Get range: \" << start << \"-\" << end;\n    *range_start = start;\n    *range_end = end;\n    return 206;\n  }\n  return 416;\n}\n\nvoid GetObjectCmd::ParseBlocksFrom(const std::vector<std::string>& block_indexes) {\n  if (data_size_ == 0) {\n    if (need_partial_) {\n      http_ret_code_ = 416;\n      GenerateErrorXml(kInvalidRange, object_name_);\n      return;\n    } else {\n      return;\n    }\n  }\n  assert(data_size_ > 0);\n  uint64_t range_start = 0;\n  uint64_t range_end = data_size_ - 1;\n  if (need_partial_) {\n    http_ret_code_ = ParseRange(req_headers_.at(\"range\"), data_size_,\n                                &range_start, &range_end);\n    if (http_ret_code_ == 400) {\n      GenerateErrorXml(kInvalidArgument, \"range\");\n    } else if (http_ret_code_ == 416) {\n      GenerateErrorXml(kInvalidRange, object_name_);\n    } else if (http_ret_code_ == 206) {\n      \/\/ Success partial\n      char buf[100];\n      sprintf(buf, \"bytes %lu-%lu\/%lu\", range_start, range_end, object_.size);\n      http_ret_code_ = 206;\n      range_result_.assign(buf);\n      data_size_ = range_end - range_start + 1;\n    } else {\n      \/\/ Can't reach here\n    }\n  }\n  uint64_t needed_size = range_end - range_start + 1;\n  for (size_t i = 0; i < block_indexes.size(); i++) {\n    \/\/ Parse all block needed\n    uint64_t start_block, end_block, start_byte, data_size;\n    int ret = sscanf(block_indexes[i].c_str(), \"%lu-%lu(%lu,%lu)\",\n                     &start_block, &end_block, &start_byte, &data_size);\n\n    \/\/ Select block interval index\n    if (range_start >= (data_size - start_byte)) {\n      range_start -= (data_size - start_byte);\n      start_byte = 0;\n      \/\/ Next block group\n      continue;\n    }\n\n    for (uint64_t b = start_block; b <= end_block; b++) {\n      uint64_t cur_bsize = std::min(data_size, zgwstore::kZgwBlockSize) - start_byte;\n      \/\/ Select block\n      if (range_start >= cur_bsize) {\n        range_start -= cur_bsize;\n        start_byte = 0;\n        \/\/ Next block\n        continue;\n      }\n\n      uint64_t remain = std::min(needed_size,\n                                 zgwstore::kZgwBlockSize - range_start);\n      remain = std::min(remain, data_size);\n\n      blocks_.push(std::make_tuple(b, start_byte + range_start, remain));\n      needed_size -= remain;\n      start_byte = 0;\n\n      if (needed_size == 0) {\n        return;\n      }\n\n      range_start = 0;\n    }\n  }\n}\n\nvoid GetObjectCmd::SortBlockIndexes(std::vector<std::string>* block_indexes) {\n  std::sort(block_indexes->begin(), block_indexes->end(),\n            [](const std::string& a, const std::string& b) {\n              return std::atoi(a.substr(0, 5).c_str()) <\n                      std::atoi(b.substr(0, 5).c_str());\n            });\n  std::vector<std::string> tmp(*block_indexes);\n  block_indexes->clear();\n  for (auto& b : tmp) {\n    \/\/ Trim sort sign e.g. 00012(3-9)(0,12) -> (3-9)(0,12)\n    b = b.substr(5);\n    std::vector<std::string> items;\n    slash::StringSplit(b, '|', items);\n    for (auto& i : items) {\n      block_indexes->push_back(i);\n    }\n  }\n}\n\nvoid GetObjectCmd::DoAndResponse(pink::HttpResponse* resp) {\n  if (http_ret_code_ == 200) {\n    \/\/ Get object_ meta\n    Status s = store_->GetObject(user_name_, bucket_name_, object_name_,\n                                 &object_);\n    if (!s.ok()) {\n      if (s.ToString().find(\"Bucket Doesn't Belong To This User\") !=\n          std::string::npos) {\n        http_ret_code_ = 404;\n        GenerateErrorXml(kNoSuchBucket, bucket_name_);\n      } else if (s.ToString().find(\"Object Not Found\") != std::string::npos) {\n        http_ret_code_ = 404;\n        GenerateErrorXml(kNoSuchKey, object_name_);\n      }\n    } else {\n      data_size_ = object_.size;\n\n      std::vector<std::string> sorted_block_indexes;\n      if (object_.upload_id != \"_\") {\n        std::string data_block = object_.data_block;\n        size_t pos = data_block.find(\"|\");\n        assert(pos != std::string::npos);\n        std::string bkname = data_block.substr(32, pos - 32);\n        std::string obname = data_block.substr(pos + 1);\n        s = store_->GetMultiBlockSet(bkname, obname,\n                                     object_.upload_id, &sorted_block_indexes);\n        if (s.IsIOError()) {\n          http_ret_code_ = 500;\n        }\n        \/\/ Sort block indexes load from redis set\n        SortBlockIndexes(&sorted_block_indexes);\n      } else {\n        \/\/ Sigle block index needn't sorting\n        sorted_block_indexes.push_back(object_.data_block);\n      }\n      ParseBlocksFrom(sorted_block_indexes);\n    }\n\n    if (http_ret_code_ == 200 ||\n        http_ret_code_ == 206) {\n      \/\/ Success\n      if (http_ret_code_ == 206) {\n        resp->SetHeaders(\"Content-Range\", range_result_);\n      }\n      resp->SetHeaders(\"ETag\", \"\\\"\" + object_.etag + \"\\\"\");\n      resp->SetHeaders(\"Last-Modified\", http_nowtime(object_.last_modified));\n      resp->SetContentLength(data_size_);\n    }\n  }\n  if (http_ret_code_ != 206 &&\n      http_ret_code_ != 200) {\n    \/\/ Response error xml\n    resp->SetContentLength(http_response_xml_.size());\n  }\n  resp->SetStatusCode(http_ret_code_);\n}\n\nint GetObjectCmd::DoResponseBody(char* buf, size_t max_size) {\n  if (http_ret_code_ != 200 &&\n      http_ret_code_ != 206 &&\n      !http_response_xml_.empty()) {\n    \/\/ Error happend, response error xml\n    if (max_size < http_response_xml_.size()) {\n      memcpy(buf, http_response_xml_.data(), max_size);\n      http_response_xml_.assign(http_response_xml_.substr(max_size));\n    } else {\n      memcpy(buf, http_response_xml_.data(), http_response_xml_.size());\n    }\n    return std::min(max_size, http_response_xml_.size());\n  }\n  \/\/ Response object data\n  if (data_size_ == 0) {\n    return 0;\n  }\n\n  uint64_t block_size = std::get<2>(blocks_.front());\n  if (block_size > max_size) {\n    \/\/ Waiting for enough buffer\n    return 0;\n  }\n  std::string block_index = std::to_string(std::get<0>(blocks_.front()));\n  uint64_t start_byte = std::get<1>(blocks_.front());\n  blocks_.pop();\n  Status s = store_->BlockGet(block_index, &block_buffer_);\n  if (!s.ok()) {\n    \/\/ Zeppelin error, close the http connection\n    return -1;\n  }\n  memcpy(buf, block_buffer_.data() + start_byte, block_size);\n  data_size_ -= block_size; \/\/ Has written\n  return block_size;\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#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <tools\/resid.hxx>\n#include <vcl\/msgbox.hxx>\n#include <osl\/file.hxx>\n\n#include \"xmlfilterdialogstrings.hrc\"\n#include \"xmlfiltertabdialog.hxx\"\n#include \"xmlfiltertabdialog.hrc\"\n#include \"xmlfiltertabpagebasic.hrc\"\n#include \"xmlfiltertabpagexslt.hrc\"\n#include \"xmlfiltertabpagebasic.hxx\"\n#include \"xmlfiltertabpagexslt.hxx\"\n#include \"xmlfiltersettingsdialog.hxx\"\n#include \"xmlfilterhelpids.hrc\"\n\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::container;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::lang;\n\nXMLFilterTabDialog::XMLFilterTabDialog( Window *pParent, ResMgr& rResMgr, const Reference< XMultiServiceFactory >& rxMSF, const filter_info_impl* pInfo ) :\n    TabDialog( pParent, ResId( DLG_XML_FILTER_TABDIALOG, rResMgr ) ),\n    mxMSF( rxMSF ),\n    mrResMgr( rResMgr ),\n    maTabCtrl( this, ResId( 1, rResMgr ) ),\n    maOKBtn( this ),\n    maCancelBtn( this ),\n    maHelpBtn( this )\n{\n    FreeResource();\n\n    maTabCtrl.SetHelpId( HID_XML_FILTER_TABPAGE_CTRL );\n\n    mpOldInfo = pInfo;\n    mpNewInfo = new filter_info_impl( *mpOldInfo );\n\n    OUString aTitle( GetText() );\n    aTitle.replaceAll(\"%s\", mpNewInfo->maFilterName);\n    SetText( aTitle );\n\n    maTabCtrl.Show();\n    maOKBtn.Show();\n    maCancelBtn.Show();\n    maHelpBtn.Show();\n\n    maOKBtn.SetClickHdl( LINK( this, XMLFilterTabDialog, OkHdl ) );\n\n    maTabCtrl.SetActivatePageHdl( LINK( this, XMLFilterTabDialog, ActivatePageHdl ) );\n    maTabCtrl.SetDeactivatePageHdl( LINK( this, XMLFilterTabDialog, DeactivatePageHdl ) );\n\n    mpBasicPage = new XMLFilterTabPageBasic( &maTabCtrl, mrResMgr );\n    mpBasicPage->SetInfo( mpNewInfo );\n\n    maTabCtrl.SetTabPage( RID_XML_FILTER_TABPAGE_BASIC, mpBasicPage );\n\n    Size aSiz = mpBasicPage->GetSizePixel();\n    Size aCtrlSiz = maTabCtrl.GetTabPageSizePixel();\n    \/\/ set size on TabControl only if smaller than TabPage\n    if ( aCtrlSiz.Width() < aSiz.Width() || aCtrlSiz.Height() < aSiz.Height() )\n    {\n        maTabCtrl.SetTabPageSizePixel( aSiz );\n        aCtrlSiz = aSiz;\n    }\n\n    mpXSLTPage = new XMLFilterTabPageXSLT( &maTabCtrl, mrResMgr, mxMSF );\n    mpXSLTPage->SetInfo( mpNewInfo );\n\n    maTabCtrl.SetTabPage( RID_XML_FILTER_TABPAGE_XSLT, mpXSLTPage );\n\n    aSiz = mpXSLTPage->GetSizePixel();\n    if ( aCtrlSiz.Width() < aSiz.Width() || aCtrlSiz.Height() < aSiz.Height() )\n    {\n        maTabCtrl.SetTabPageSizePixel( aSiz );\n        aCtrlSiz = aSiz;\n    }\n\n    ActivatePageHdl( &maTabCtrl );\n\n    AdjustLayout();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nXMLFilterTabDialog::~XMLFilterTabDialog()\n{\n    delete mpBasicPage;\n    delete mpXSLTPage;\n    delete mpNewInfo;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nbool XMLFilterTabDialog::onOk()\n{\n    mpXSLTPage->FillInfo( mpNewInfo );\n    mpBasicPage->FillInfo( mpNewInfo );\n\n    sal_uInt16 nErrorPage = 0;\n    sal_uInt16 nErrorId = 0;\n    Window* pFocusWindow = NULL;\n    OUString aReplace1;\n    OUString aReplace2;\n\n    \/\/ 1. see if the filter name is ok\n    if( (mpNewInfo->maFilterName.isEmpty()) || (mpNewInfo->maFilterName != mpOldInfo->maFilterName) )\n    {\n        \/\/ if the user deleted the filter name, we reset the original filter name\n        if( mpNewInfo->maFilterName.isEmpty() )\n        {\n            mpNewInfo->maFilterName = mpOldInfo->maFilterName;\n        }\n        else\n        {\n            try\n            {\n                Reference< XNameAccess > xFilterContainer( mxMSF->createInstance( \"com.sun.star.document.FilterFactory\" ), UNO_QUERY );\n                if( xFilterContainer.is() )\n                {\n                    if( xFilterContainer->hasByName( mpNewInfo->maFilterName ) )\n                    {\n                        nErrorPage = RID_XML_FILTER_TABPAGE_BASIC;\n                        nErrorId = STR_ERROR_FILTER_NAME_EXISTS;\n                        pFocusWindow = &(mpBasicPage->maEDFilterName);\n                        aReplace1 = mpNewInfo->maFilterName;\n                    }\n\n                }\n            }\n            catch( const Exception& )\n            {\n                OSL_FAIL( \"XMLFilterTabDialog::onOk exception catched!\" );\n            }\n        }\n    }\n\n    \/\/ 2. see if the interface name is ok\n    if( (mpNewInfo->maInterfaceName.isEmpty()) || (mpNewInfo->maInterfaceName != mpOldInfo->maInterfaceName) )\n    {\n        \/\/ if the user deleted the interface name, we reset the original filter name\n        if( mpNewInfo->maInterfaceName.isEmpty() )\n        {\n            mpNewInfo->maInterfaceName = mpOldInfo->maInterfaceName;\n        }\n        else\n        {\n            try\n            {\n                Reference< XNameAccess > xFilterContainer( mxMSF->createInstance( \"com.sun.star.document.FilterFactory\" ), UNO_QUERY );\n                if( xFilterContainer.is() )\n                {\n                    Sequence< OUString > aFilterNames( xFilterContainer->getElementNames() );\n                    OUString* pFilterName = aFilterNames.getArray();\n\n                    const sal_Int32 nCount = aFilterNames.getLength();\n                    sal_Int32 nFilter;\n\n                    Sequence< PropertyValue > aValues;\n                    for( nFilter = 0; (nFilter < nCount) && (nErrorId == 0); nFilter++, pFilterName++ )\n                    {\n                        Any aAny( xFilterContainer->getByName( *pFilterName ) );\n                        if( !(aAny >>= aValues) )\n                            continue;\n\n                        const sal_Int32 nValueCount( aValues.getLength() );\n                        PropertyValue* pValues = aValues.getArray();\n                        sal_Int32 nValue;\n\n                        for( nValue = 0; (nValue < nValueCount) && (nErrorId == 0); nValue++, pValues++ )\n                        {\n                            if ( pValues->Name == \"UIName\" )\n                            {\n                                OUString aInterfaceName;\n                                pValues->Value >>= aInterfaceName;\n                                if( aInterfaceName == mpNewInfo->maInterfaceName )\n                                {\n                                    nErrorPage = RID_XML_FILTER_TABPAGE_BASIC;\n                                    nErrorId = STR_ERROR_TYPE_NAME_EXISTS;\n                                    pFocusWindow = &(mpBasicPage->maEDInterfaceName);\n                                    aReplace1 = mpNewInfo->maInterfaceName;\n                                    aReplace2 = *pFilterName;\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n            catch( const Exception& )\n            {\n                OSL_FAIL( \"XMLFilterTabDialog::onOk exception catched!\" );\n            }\n        }\n    }\n\n    if( 0 == nErrorId )\n    {\n        \/\/ 4. see if the export xslt is valid\n        if( (mpNewInfo->maExportXSLT != mpOldInfo->maExportXSLT) && isFileURL( mpNewInfo->maExportXSLT ) )\n        {\n            osl::File aFile( mpNewInfo->maExportXSLT );\n            osl::File::RC aRC = aFile.open( osl_File_OpenFlag_Read );\n            if( aRC != osl::File::E_None )\n            {\n                nErrorId = STR_ERROR_EXPORT_XSLT_NOT_FOUND;\n                nErrorPage = RID_XML_FILTER_TABPAGE_XSLT;\n                pFocusWindow = &(mpXSLTPage->maEDExportXSLT);\n            }\n        }\n    }\n\n    if( 0 == nErrorId )\n    {\n        \/\/ 5. see if the import xslt is valid\n        if( (mpNewInfo->maImportXSLT != mpOldInfo->maImportXSLT) && isFileURL( mpNewInfo->maImportXSLT ) )\n        {\n            osl::File aFile( mpNewInfo->maImportXSLT );\n            osl::File::RC aRC = aFile.open( osl_File_OpenFlag_Read );\n            if( aRC != osl::File::E_None )\n            {\n                nErrorId = STR_ERROR_IMPORT_XSLT_NOT_FOUND;\n                nErrorPage = RID_XML_FILTER_TABPAGE_XSLT;\n                pFocusWindow = &(mpXSLTPage->maEDImportTemplate);\n            }\n        }\n    }\n\n    \/\/ see if we have at least an import or an export xslt\n    if((mpNewInfo->maImportXSLT.isEmpty()) && (mpNewInfo->maExportXSLT.isEmpty()) )\n    {\n        nErrorId = STR_ERROR_EXPORT_XSLT_NOT_FOUND;\n        nErrorPage = RID_XML_FILTER_TABPAGE_XSLT;\n        pFocusWindow = &(mpXSLTPage->maEDExportXSLT);\n    }\n\n    if( 0 == nErrorId )\n    {\n        \/\/ 6. see if the import template is valid\n        if( (mpNewInfo->maImportTemplate != mpOldInfo->maImportTemplate) && isFileURL( mpNewInfo->maImportTemplate ) )\n        {\n            osl::File aFile( mpNewInfo->maImportTemplate );\n            osl::File::RC aRC = aFile.open( osl_File_OpenFlag_Read );\n            if( aRC != osl::File::E_None )\n            {\n                nErrorId = STR_ERROR_IMPORT_TEMPLATE_NOT_FOUND;\n                nErrorPage = RID_XML_FILTER_TABPAGE_XSLT;\n                pFocusWindow = &(mpXSLTPage->maEDImportTemplate);\n            }\n        }\n    }\n\n    if( 0 != nErrorId )\n    {\n        maTabCtrl.SetCurPageId( (sal_uInt16)nErrorPage );\n        ActivatePageHdl( &maTabCtrl );\n\n        ResId aResId( nErrorId, mrResMgr );\n        OUString aMessage( aResId );\n\n        if( aReplace2.getLength() )\n        {\n            aMessage.replaceAll( \"%s1\", aReplace1 );\n            aMessage.replaceAll( \"%s2\", aReplace2 );\n        }\n        else if( aReplace1.getLength() )\n        {\n            aMessage.replaceAll( \"%s\", aReplace1 );\n        }\n\n        ErrorBox aBox(this, (WinBits)(WB_OK), aMessage );\n        aBox.Execute();\n\n        if( pFocusWindow )\n            pFocusWindow->GrabFocus();\n\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nfilter_info_impl* XMLFilterTabDialog::getNewFilterInfo() const\n{\n    return mpNewInfo;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK_NOARG(XMLFilterTabDialog, OkHdl)\n{\n    if( onOk() )\n        EndDialog(1);\n\n    return 0;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( XMLFilterTabDialog, ActivatePageHdl, TabControl *, pTabCtrl )\n{\n    const sal_uInt16 nId = pTabCtrl->GetCurPageId();\n    TabPage* pTabPage = pTabCtrl->GetTabPage( nId );\n    pTabPage->Show();\n\n    return 0;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( XMLFilterTabDialog, DeactivatePageHdl, TabControl *, \/* pTabCtrl *\/ )\n{\n    return sal_True;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>OUString::replaceAll unused results<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 <com\/sun\/star\/container\/XNameAccess.hpp>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <tools\/resid.hxx>\n#include <vcl\/msgbox.hxx>\n#include <osl\/file.hxx>\n\n#include \"xmlfilterdialogstrings.hrc\"\n#include \"xmlfiltertabdialog.hxx\"\n#include \"xmlfiltertabdialog.hrc\"\n#include \"xmlfiltertabpagebasic.hrc\"\n#include \"xmlfiltertabpagexslt.hrc\"\n#include \"xmlfiltertabpagebasic.hxx\"\n#include \"xmlfiltertabpagexslt.hxx\"\n#include \"xmlfiltersettingsdialog.hxx\"\n#include \"xmlfilterhelpids.hrc\"\n\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::container;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::lang;\n\nXMLFilterTabDialog::XMLFilterTabDialog( Window *pParent, ResMgr& rResMgr, const Reference< XMultiServiceFactory >& rxMSF, const filter_info_impl* pInfo ) :\n    TabDialog( pParent, ResId( DLG_XML_FILTER_TABDIALOG, rResMgr ) ),\n    mxMSF( rxMSF ),\n    mrResMgr( rResMgr ),\n    maTabCtrl( this, ResId( 1, rResMgr ) ),\n    maOKBtn( this ),\n    maCancelBtn( this ),\n    maHelpBtn( this )\n{\n    FreeResource();\n\n    maTabCtrl.SetHelpId( HID_XML_FILTER_TABPAGE_CTRL );\n\n    mpOldInfo = pInfo;\n    mpNewInfo = new filter_info_impl( *mpOldInfo );\n\n    OUString aTitle( GetText() );\n    aTitle = aTitle.replaceAll(\"%s\", mpNewInfo->maFilterName);\n    SetText( aTitle );\n\n    maTabCtrl.Show();\n    maOKBtn.Show();\n    maCancelBtn.Show();\n    maHelpBtn.Show();\n\n    maOKBtn.SetClickHdl( LINK( this, XMLFilterTabDialog, OkHdl ) );\n\n    maTabCtrl.SetActivatePageHdl( LINK( this, XMLFilterTabDialog, ActivatePageHdl ) );\n    maTabCtrl.SetDeactivatePageHdl( LINK( this, XMLFilterTabDialog, DeactivatePageHdl ) );\n\n    mpBasicPage = new XMLFilterTabPageBasic( &maTabCtrl, mrResMgr );\n    mpBasicPage->SetInfo( mpNewInfo );\n\n    maTabCtrl.SetTabPage( RID_XML_FILTER_TABPAGE_BASIC, mpBasicPage );\n\n    Size aSiz = mpBasicPage->GetSizePixel();\n    Size aCtrlSiz = maTabCtrl.GetTabPageSizePixel();\n    \/\/ set size on TabControl only if smaller than TabPage\n    if ( aCtrlSiz.Width() < aSiz.Width() || aCtrlSiz.Height() < aSiz.Height() )\n    {\n        maTabCtrl.SetTabPageSizePixel( aSiz );\n        aCtrlSiz = aSiz;\n    }\n\n    mpXSLTPage = new XMLFilterTabPageXSLT( &maTabCtrl, mrResMgr, mxMSF );\n    mpXSLTPage->SetInfo( mpNewInfo );\n\n    maTabCtrl.SetTabPage( RID_XML_FILTER_TABPAGE_XSLT, mpXSLTPage );\n\n    aSiz = mpXSLTPage->GetSizePixel();\n    if ( aCtrlSiz.Width() < aSiz.Width() || aCtrlSiz.Height() < aSiz.Height() )\n    {\n        maTabCtrl.SetTabPageSizePixel( aSiz );\n        aCtrlSiz = aSiz;\n    }\n\n    ActivatePageHdl( &maTabCtrl );\n\n    AdjustLayout();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nXMLFilterTabDialog::~XMLFilterTabDialog()\n{\n    delete mpBasicPage;\n    delete mpXSLTPage;\n    delete mpNewInfo;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nbool XMLFilterTabDialog::onOk()\n{\n    mpXSLTPage->FillInfo( mpNewInfo );\n    mpBasicPage->FillInfo( mpNewInfo );\n\n    sal_uInt16 nErrorPage = 0;\n    sal_uInt16 nErrorId = 0;\n    Window* pFocusWindow = NULL;\n    OUString aReplace1;\n    OUString aReplace2;\n\n    \/\/ 1. see if the filter name is ok\n    if( (mpNewInfo->maFilterName.isEmpty()) || (mpNewInfo->maFilterName != mpOldInfo->maFilterName) )\n    {\n        \/\/ if the user deleted the filter name, we reset the original filter name\n        if( mpNewInfo->maFilterName.isEmpty() )\n        {\n            mpNewInfo->maFilterName = mpOldInfo->maFilterName;\n        }\n        else\n        {\n            try\n            {\n                Reference< XNameAccess > xFilterContainer( mxMSF->createInstance( \"com.sun.star.document.FilterFactory\" ), UNO_QUERY );\n                if( xFilterContainer.is() )\n                {\n                    if( xFilterContainer->hasByName( mpNewInfo->maFilterName ) )\n                    {\n                        nErrorPage = RID_XML_FILTER_TABPAGE_BASIC;\n                        nErrorId = STR_ERROR_FILTER_NAME_EXISTS;\n                        pFocusWindow = &(mpBasicPage->maEDFilterName);\n                        aReplace1 = mpNewInfo->maFilterName;\n                    }\n\n                }\n            }\n            catch( const Exception& )\n            {\n                OSL_FAIL( \"XMLFilterTabDialog::onOk exception catched!\" );\n            }\n        }\n    }\n\n    \/\/ 2. see if the interface name is ok\n    if( (mpNewInfo->maInterfaceName.isEmpty()) || (mpNewInfo->maInterfaceName != mpOldInfo->maInterfaceName) )\n    {\n        \/\/ if the user deleted the interface name, we reset the original filter name\n        if( mpNewInfo->maInterfaceName.isEmpty() )\n        {\n            mpNewInfo->maInterfaceName = mpOldInfo->maInterfaceName;\n        }\n        else\n        {\n            try\n            {\n                Reference< XNameAccess > xFilterContainer( mxMSF->createInstance( \"com.sun.star.document.FilterFactory\" ), UNO_QUERY );\n                if( xFilterContainer.is() )\n                {\n                    Sequence< OUString > aFilterNames( xFilterContainer->getElementNames() );\n                    OUString* pFilterName = aFilterNames.getArray();\n\n                    const sal_Int32 nCount = aFilterNames.getLength();\n                    sal_Int32 nFilter;\n\n                    Sequence< PropertyValue > aValues;\n                    for( nFilter = 0; (nFilter < nCount) && (nErrorId == 0); nFilter++, pFilterName++ )\n                    {\n                        Any aAny( xFilterContainer->getByName( *pFilterName ) );\n                        if( !(aAny >>= aValues) )\n                            continue;\n\n                        const sal_Int32 nValueCount( aValues.getLength() );\n                        PropertyValue* pValues = aValues.getArray();\n                        sal_Int32 nValue;\n\n                        for( nValue = 0; (nValue < nValueCount) && (nErrorId == 0); nValue++, pValues++ )\n                        {\n                            if ( pValues->Name == \"UIName\" )\n                            {\n                                OUString aInterfaceName;\n                                pValues->Value >>= aInterfaceName;\n                                if( aInterfaceName == mpNewInfo->maInterfaceName )\n                                {\n                                    nErrorPage = RID_XML_FILTER_TABPAGE_BASIC;\n                                    nErrorId = STR_ERROR_TYPE_NAME_EXISTS;\n                                    pFocusWindow = &(mpBasicPage->maEDInterfaceName);\n                                    aReplace1 = mpNewInfo->maInterfaceName;\n                                    aReplace2 = *pFilterName;\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n            catch( const Exception& )\n            {\n                OSL_FAIL( \"XMLFilterTabDialog::onOk exception catched!\" );\n            }\n        }\n    }\n\n    if( 0 == nErrorId )\n    {\n        \/\/ 4. see if the export xslt is valid\n        if( (mpNewInfo->maExportXSLT != mpOldInfo->maExportXSLT) && isFileURL( mpNewInfo->maExportXSLT ) )\n        {\n            osl::File aFile( mpNewInfo->maExportXSLT );\n            osl::File::RC aRC = aFile.open( osl_File_OpenFlag_Read );\n            if( aRC != osl::File::E_None )\n            {\n                nErrorId = STR_ERROR_EXPORT_XSLT_NOT_FOUND;\n                nErrorPage = RID_XML_FILTER_TABPAGE_XSLT;\n                pFocusWindow = &(mpXSLTPage->maEDExportXSLT);\n            }\n        }\n    }\n\n    if( 0 == nErrorId )\n    {\n        \/\/ 5. see if the import xslt is valid\n        if( (mpNewInfo->maImportXSLT != mpOldInfo->maImportXSLT) && isFileURL( mpNewInfo->maImportXSLT ) )\n        {\n            osl::File aFile( mpNewInfo->maImportXSLT );\n            osl::File::RC aRC = aFile.open( osl_File_OpenFlag_Read );\n            if( aRC != osl::File::E_None )\n            {\n                nErrorId = STR_ERROR_IMPORT_XSLT_NOT_FOUND;\n                nErrorPage = RID_XML_FILTER_TABPAGE_XSLT;\n                pFocusWindow = &(mpXSLTPage->maEDImportTemplate);\n            }\n        }\n    }\n\n    \/\/ see if we have at least an import or an export xslt\n    if((mpNewInfo->maImportXSLT.isEmpty()) && (mpNewInfo->maExportXSLT.isEmpty()) )\n    {\n        nErrorId = STR_ERROR_EXPORT_XSLT_NOT_FOUND;\n        nErrorPage = RID_XML_FILTER_TABPAGE_XSLT;\n        pFocusWindow = &(mpXSLTPage->maEDExportXSLT);\n    }\n\n    if( 0 == nErrorId )\n    {\n        \/\/ 6. see if the import template is valid\n        if( (mpNewInfo->maImportTemplate != mpOldInfo->maImportTemplate) && isFileURL( mpNewInfo->maImportTemplate ) )\n        {\n            osl::File aFile( mpNewInfo->maImportTemplate );\n            osl::File::RC aRC = aFile.open( osl_File_OpenFlag_Read );\n            if( aRC != osl::File::E_None )\n            {\n                nErrorId = STR_ERROR_IMPORT_TEMPLATE_NOT_FOUND;\n                nErrorPage = RID_XML_FILTER_TABPAGE_XSLT;\n                pFocusWindow = &(mpXSLTPage->maEDImportTemplate);\n            }\n        }\n    }\n\n    if( 0 != nErrorId )\n    {\n        maTabCtrl.SetCurPageId( (sal_uInt16)nErrorPage );\n        ActivatePageHdl( &maTabCtrl );\n\n        ResId aResId( nErrorId, mrResMgr );\n        OUString aMessage( aResId );\n\n        if( aReplace2.getLength() )\n        {\n            aMessage = aMessage.replaceAll( \"%s1\", aReplace1 );\n            aMessage = aMessage.replaceAll( \"%s2\", aReplace2 );\n        }\n        else if( aReplace1.getLength() )\n        {\n            aMessage = aMessage.replaceAll( \"%s\", aReplace1 );\n        }\n\n        ErrorBox aBox(this, (WinBits)(WB_OK), aMessage );\n        aBox.Execute();\n\n        if( pFocusWindow )\n            pFocusWindow->GrabFocus();\n\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nfilter_info_impl* XMLFilterTabDialog::getNewFilterInfo() const\n{\n    return mpNewInfo;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK_NOARG(XMLFilterTabDialog, OkHdl)\n{\n    if( onOk() )\n        EndDialog(1);\n\n    return 0;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( XMLFilterTabDialog, ActivatePageHdl, TabControl *, pTabCtrl )\n{\n    const sal_uInt16 nId = pTabCtrl->GetCurPageId();\n    TabPage* pTabPage = pTabCtrl->GetTabPage( nId );\n    pTabPage->Show();\n\n    return 0;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( XMLFilterTabDialog, DeactivatePageHdl, TabControl *, \/* pTabCtrl *\/ )\n{\n    return sal_True;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\n\/*\n * Version: MPL 1.1 \/ GPLv3+ \/ LGPLv3+\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 Initial Developer of the Original Code is\n *       [ Peter Jentsch <pjotr@guineapics.de> ]\n * Portions created by the Initial Developer are Copyright (C) 2010 the\n * Initial Developer. All Rights Reserved.\n *\n * Contributor(s): Peter Jentsch <pjotr@guineapics.de>\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 3 or later (the \"GPLv3+\"), or\n * the GNU Lesser General Public License Version 3 or later (the \"LGPLv3+\"),\n * in which case the provisions of the GPLv3+ or the LGPLv3+ are applicable\n * instead of those above.\n *\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_filter.hxx\"\n\n#include <cstdio>\n#include <cstring>\n#include <list>\n#include <map>\n#include <vector>\n#include <iostream>\n#include <libxml\/parser.h>\n#include <libxml\/tree.h>\n#include <libxml\/xmlIO.h>\n#include <libxslt\/transform.h>\n#include <libxslt\/xsltutils.h>\n#include <libxslt\/variables.h>\n\n#include <cppuhelper\/factory.hxx>\n#include <cppuhelper\/servicefactory.hxx>\n#include <cppuhelper\/implbase4.hxx>\n#include <cppuhelper\/implbase.hxx>\n#include <osl\/module.h>\n#include <osl\/file.hxx>\n#include <osl\/process.h>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#include <com\/sun\/star\/io\/XActiveDataSource.hpp>\n#include <com\/sun\/star\/io\/XActiveDataSink.hpp>\n#include <com\/sun\/star\/io\/XActiveDataControl.hpp>\n#include <com\/sun\/star\/io\/XStreamListener.hpp>\n\n#include <LibXSLTTransformer.hxx>\n\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::osl;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::io;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::registry;\nusing ::std::list;\nusing ::std::map;\nusing ::std::pair;\n\n#define _INPUT_BUFFER_SIZE 4096\n#define _OUTPUT_BUFFER_SIZE 4096\n\nnamespace XSLT\n{\n    const char* const LibXSLTTransformer::PARAM_SOURCE_URL = \"sourceURL\";\n    const char* const LibXSLTTransformer::PARAM_SOURCE_BASE_URL =\n            \"sourceBaseURL\";\n    const char* const LibXSLTTransformer::PARAM_TARGET_URL = \"targetURL\";\n    const char* const LibXSLTTransformer::PARAM_TARGET_BASE_URL =\n            \"targetBaseURL\";\n    const char* const LibXSLTTransformer::PARAM_DOCTYPE_SYSTEM = \"sytemType\";\n    const char* const LibXSLTTransformer::PARAM_DOCTYPE_PUBLIC = \"publicType\";\n\n    const sal_Int32 Reader::OUTPUT_BUFFER_SIZE = _OUTPUT_BUFFER_SIZE;\n\n    const sal_Int32 Reader::INPUT_BUFFER_SIZE = _INPUT_BUFFER_SIZE;\n\n    struct ParserInputBufferCallback\n    {\n        static int\n        on_read(void * context, char * buffer, int len)\n        {\n            Reader * tmp = static_cast<Reader*> (context);\n            return tmp->read(buffer, len);\n        }\n        static int\n        on_close(void * context)\n        {\n            Reader * tmp = static_cast<Reader*> (context);\n            return tmp->closeInput();\n        }\n    };\n    struct ParserOutputBufferCallback\n    {\n        static int\n        on_write(void * context, const char * buffer, int len)\n        {\n            Reader * tmp = static_cast<Reader*> (context);\n            return tmp->write(buffer, len);\n        }\n        static int\n        on_close(void * context)\n        {\n            Reader * tmp = static_cast<Reader*> (context);\n            return tmp->closeOutput();\n        }\n    };\n\n    Reader::Reader(LibXSLTTransformer* transformer) :\n        m_transformer(transformer), m_terminated(false), m_readBuf(\n                INPUT_BUFFER_SIZE), m_writeBuf(OUTPUT_BUFFER_SIZE)\n    {\n        LIBXML_TEST_VERSION;\n    }\n    ;\n\n    int\n    Reader::read(char * buffer, int len)\n    {\n        \/\/        const char *ptr = (const char *) context;\n        if (buffer == NULL || len < 0)\n            return (-1);\n        sal_Int32 n;\n        Reference<XInputStream> xis = this->m_transformer->getInputStream();\n        n = xis.get()->readBytes(m_readBuf, len);\n        if (n > 0)\n            {\n                memcpy(buffer, m_readBuf.getArray(), n);\n            }\n        return n;\n    }\n\n    int\n    Reader::write(const char * buffer, int len)\n    {\n        if (buffer == NULL || len < 0)\n            return -1;\n        if (len > 0)\n            {\n                Reference<XOutputStream> xos = m_transformer->getOutputStream();\n                sal_Int32 writeLen = len;\n                sal_Int32 bufLen = ::std::min(writeLen,\n                        this->OUTPUT_BUFFER_SIZE);\n                const sal_uInt8* memPtr =\n                        reinterpret_cast<const sal_uInt8*> (buffer);\n                while (writeLen > 0)\n                    {\n                        sal_Int32 n = ::std::min(writeLen, bufLen);\n                        m_writeBuf.realloc(n);\n                        memcpy(m_writeBuf.getArray(), memPtr,\n                                static_cast<size_t> (n));\n                        xos.get()->writeBytes(m_writeBuf);\n                        memPtr += n;\n                        writeLen -= n;\n                    }\n            }\n        return len;\n    }\n\n    int\n    Reader::closeInput()\n    {\n        return 0;\n    }\n\n    int\n    Reader::closeOutput()\n    {\n        Reference<XOutputStream> xos = m_transformer->getOutputStream();\n        if (xos.is())\n            {\n                xos.get()->flush();\n                xos.get()->closeOutput();\n            }\n        m_transformer->done();\n        return 0;\n    }\n\n    void\n    Reader::run()\n    {\n        OSL_ASSERT(m_transformer != NULL);\n        OSL_ASSERT(m_transformer->getInputStream().is());\n        OSL_ASSERT(m_transformer->getOutputStream().is());\n        OSL_ASSERT(m_transformer->getStyleSheetURL());\n        ::std::map<const char*, OString>::iterator pit;\n        ::std::map<const char*, OString> pmap = m_transformer->getParameters();\n        ::std::vector< const char* > params( pmap.size() * 2 + 1 ); \/\/ build parameters\n        int paramIndex = 0;\n        for (pit = pmap.begin(); pit != pmap.end(); pit++)\n            {\n                params[paramIndex++] = (*pit).first;\n                params[paramIndex++] = (*pit).second.getStr();\n            }\n        params[paramIndex] = NULL;\n        xmlDocPtr doc = xmlReadIO(&ParserInputBufferCallback::on_read,\n                &ParserInputBufferCallback::on_close,\n                static_cast<void*> (this), NULL, NULL, 0);\n        xsltStylesheetPtr styleSheet = xsltParseStylesheetFile(\n                (const xmlChar *) m_transformer->getStyleSheetURL().getStr());\n        xmlDocPtr result = NULL;\n        xsltTransformContextPtr tcontext = NULL;\n        if (styleSheet)\n            {\n                tcontext = xsltNewTransformContext(styleSheet, doc);\n                xsltQuoteUserParams(tcontext, &params[0]);\n                result = xsltApplyStylesheetUser(styleSheet, doc, 0, 0, 0,\n                        tcontext);\n            }\n\n        if (result)\n            {\n                xmlCharEncodingHandlerPtr encoder = xmlGetCharEncodingHandler(\n                        XML_CHAR_ENCODING_UTF8);\n                xmlOutputBufferPtr outBuf = xmlAllocOutputBuffer(encoder);\n                outBuf->context = static_cast<void *> (this);\n                outBuf->writecallback = &ParserOutputBufferCallback::on_write;\n                outBuf->closecallback = &ParserOutputBufferCallback::on_close;\n                xsltSaveResultTo(outBuf, result, styleSheet);\n            }\n        else\n            {\n                xmlErrorPtr lastErr = xmlGetLastError();\n                OUString msg;\n                if (lastErr)\n                    msg = OUString::createFromAscii(lastErr->message);\n                else\n                    msg = OUString::createFromAscii(\n                            \"Unknown XSLT transformation error\");\n\n                m_transformer->error(msg);\n            }\n        closeOutput();\n        xsltFreeStylesheet(styleSheet);\n        xsltFreeTransformContext(tcontext);\n        xmlFreeDoc(doc);\n        xmlFreeDoc(result);\n    }\n    ;\n\n    void\n    Reader::onTerminated()\n    {\n        m_terminated = true;\n    }\n    ;\n\n    Reader::~Reader()\n    {\n    }\n\n    LibXSLTTransformer::LibXSLTTransformer(\n            const Reference<XMultiServiceFactory> &r) :\n        m_rServiceFactory(r)\n    {\n    }\n\n    void\n    LibXSLTTransformer::setInputStream(\n            const Reference<XInputStream>& inputStream)\n            throw (RuntimeException)\n    {\n        m_rInputStream = inputStream;\n    }\n\n    Reference<XInputStream>\n    LibXSLTTransformer::getInputStream() throw (RuntimeException)\n    {\n        return m_rInputStream;\n    }\n\n    void\n    LibXSLTTransformer::setOutputStream(\n            const Reference<XOutputStream>& outputStream)\n            throw (RuntimeException)\n    {\n        m_rOutputStream = outputStream;\n    }\n\n    Reference<XOutputStream>\n    LibXSLTTransformer::getOutputStream() throw (RuntimeException)\n    {\n        return m_rOutputStream;\n    }\n\n    void\n    LibXSLTTransformer::addListener(const Reference<XStreamListener>& listener)\n            throw (RuntimeException)\n    {\n        m_listeners.insert(m_listeners.begin(), listener);\n    }\n\n    void\n    LibXSLTTransformer::removeListener(\n            const Reference<XStreamListener>& listener)\n            throw (RuntimeException)\n    {\n        m_listeners.remove(listener);\n    }\n\n    void\n    LibXSLTTransformer::start() throw (RuntimeException)\n    {\n        ListenerList::iterator it;\n        ListenerList* l = &m_listeners;\n        for (it = l->begin(); it != l->end(); it++)\n            {\n                Reference<XStreamListener> xl = *it;\n                xl.get()->started();\n            }\n        Reader* r = new Reader(this);\n        r->create();\n    }\n\n    void\n    LibXSLTTransformer::error(const OUString& msg)\n    {\n        ListenerList* l = &m_listeners;\n        Any arg;\n        arg <<= Exception(msg, *this);\n        for (ListenerList::iterator it = l->begin(); it != l->end(); it++)\n            {\n                Reference<XStreamListener> xl = *it;\n                if (xl.is())\n                    {\n                        xl.get()->error(arg);\n                    }\n            }\n    }\n\n    void\n    LibXSLTTransformer::done()\n    {\n        ListenerList* l = &m_listeners;\n        for (ListenerList::iterator it = l->begin(); it != l->end(); it++)\n            {\n                Reference<XStreamListener> xl = *it;\n                if (xl.is())\n                    {\n                        xl.get()->closed();\n                    }\n            }\n    }\n\n    void\n    LibXSLTTransformer::terminate() throw (RuntimeException)\n    {\n        m_parameters.clear();\n    }\n\n    void\n    LibXSLTTransformer::initialize(const Sequence<Any>& params)\n            throw (RuntimeException)\n    {\n        xmlSubstituteEntitiesDefault(0);\n        m_parameters.clear();\n        for (int i = 0; i < params.getLength(); i++)\n            {\n                NamedValue nv;\n                params[i] >>= nv;\n                OString nameUTF8 = OUStringToOString(nv.Name,\n                        RTL_TEXTENCODING_UTF8);\n                OUString value;\n                OString valueUTF8;\n                if (nv.Value >>= value)\n                    {\n                        valueUTF8 = OUStringToOString(value,\n                                RTL_TEXTENCODING_UTF8);\n                    }\n                else\n                    {\n                        \/\/ ignore non-string parameters\n                        continue;\n                    }\n                if (nameUTF8.equals(\"StylesheetURL\"))\n                    {\n                        m_styleSheetURL = valueUTF8;\n                    }\n                else if (nameUTF8.equals(\"SourceURL\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_SOURCE_URL, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"SourceBaseURL\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_SOURCE_BASE_URL, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"TargetURL\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_TARGET_URL, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"TargetBaseURL\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_TARGET_BASE_URL, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"DoctypeSystem\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_DOCTYPE_SYSTEM, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"DoctypePublic\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_DOCTYPE_PUBLIC, valueUTF8));\n                    }\n            }\n    }\n\n    const OString\n    LibXSLTTransformer::getStyleSheetURL()\n    {\n        return m_styleSheetURL;\n    }\n\n    ::std::map<const char*, OString>\n    LibXSLTTransformer::getParameters()\n    {\n        return m_parameters;\n    }\n}\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n\n<commit_msg>cppcheck: post- to pre- *crement change<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\n\/*\n * Version: MPL 1.1 \/ GPLv3+ \/ LGPLv3+\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 Initial Developer of the Original Code is\n *       [ Peter Jentsch <pjotr@guineapics.de> ]\n * Portions created by the Initial Developer are Copyright (C) 2010 the\n * Initial Developer. All Rights Reserved.\n *\n * Contributor(s): Peter Jentsch <pjotr@guineapics.de>\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 3 or later (the \"GPLv3+\"), or\n * the GNU Lesser General Public License Version 3 or later (the \"LGPLv3+\"),\n * in which case the provisions of the GPLv3+ or the LGPLv3+ are applicable\n * instead of those above.\n *\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_filter.hxx\"\n\n#include <cstdio>\n#include <cstring>\n#include <list>\n#include <map>\n#include <vector>\n#include <iostream>\n#include <libxml\/parser.h>\n#include <libxml\/tree.h>\n#include <libxml\/xmlIO.h>\n#include <libxslt\/transform.h>\n#include <libxslt\/xsltutils.h>\n#include <libxslt\/variables.h>\n\n#include <cppuhelper\/factory.hxx>\n#include <cppuhelper\/servicefactory.hxx>\n#include <cppuhelper\/implbase4.hxx>\n#include <cppuhelper\/implbase.hxx>\n#include <osl\/module.h>\n#include <osl\/file.hxx>\n#include <osl\/process.h>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#include <com\/sun\/star\/io\/XActiveDataSource.hpp>\n#include <com\/sun\/star\/io\/XActiveDataSink.hpp>\n#include <com\/sun\/star\/io\/XActiveDataControl.hpp>\n#include <com\/sun\/star\/io\/XStreamListener.hpp>\n\n#include <LibXSLTTransformer.hxx>\n\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::osl;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::io;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::registry;\nusing ::std::list;\nusing ::std::map;\nusing ::std::pair;\n\n#define _INPUT_BUFFER_SIZE 4096\n#define _OUTPUT_BUFFER_SIZE 4096\n\nnamespace XSLT\n{\n    const char* const LibXSLTTransformer::PARAM_SOURCE_URL = \"sourceURL\";\n    const char* const LibXSLTTransformer::PARAM_SOURCE_BASE_URL =\n            \"sourceBaseURL\";\n    const char* const LibXSLTTransformer::PARAM_TARGET_URL = \"targetURL\";\n    const char* const LibXSLTTransformer::PARAM_TARGET_BASE_URL =\n            \"targetBaseURL\";\n    const char* const LibXSLTTransformer::PARAM_DOCTYPE_SYSTEM = \"sytemType\";\n    const char* const LibXSLTTransformer::PARAM_DOCTYPE_PUBLIC = \"publicType\";\n\n    const sal_Int32 Reader::OUTPUT_BUFFER_SIZE = _OUTPUT_BUFFER_SIZE;\n\n    const sal_Int32 Reader::INPUT_BUFFER_SIZE = _INPUT_BUFFER_SIZE;\n\n    struct ParserInputBufferCallback\n    {\n        static int\n        on_read(void * context, char * buffer, int len)\n        {\n            Reader * tmp = static_cast<Reader*> (context);\n            return tmp->read(buffer, len);\n        }\n        static int\n        on_close(void * context)\n        {\n            Reader * tmp = static_cast<Reader*> (context);\n            return tmp->closeInput();\n        }\n    };\n    struct ParserOutputBufferCallback\n    {\n        static int\n        on_write(void * context, const char * buffer, int len)\n        {\n            Reader * tmp = static_cast<Reader*> (context);\n            return tmp->write(buffer, len);\n        }\n        static int\n        on_close(void * context)\n        {\n            Reader * tmp = static_cast<Reader*> (context);\n            return tmp->closeOutput();\n        }\n    };\n\n    Reader::Reader(LibXSLTTransformer* transformer) :\n        m_transformer(transformer), m_terminated(false), m_readBuf(\n                INPUT_BUFFER_SIZE), m_writeBuf(OUTPUT_BUFFER_SIZE)\n    {\n        LIBXML_TEST_VERSION;\n    }\n    ;\n\n    int\n    Reader::read(char * buffer, int len)\n    {\n        \/\/        const char *ptr = (const char *) context;\n        if (buffer == NULL || len < 0)\n            return (-1);\n        sal_Int32 n;\n        Reference<XInputStream> xis = this->m_transformer->getInputStream();\n        n = xis.get()->readBytes(m_readBuf, len);\n        if (n > 0)\n            {\n                memcpy(buffer, m_readBuf.getArray(), n);\n            }\n        return n;\n    }\n\n    int\n    Reader::write(const char * buffer, int len)\n    {\n        if (buffer == NULL || len < 0)\n            return -1;\n        if (len > 0)\n            {\n                Reference<XOutputStream> xos = m_transformer->getOutputStream();\n                sal_Int32 writeLen = len;\n                sal_Int32 bufLen = ::std::min(writeLen,\n                        this->OUTPUT_BUFFER_SIZE);\n                const sal_uInt8* memPtr =\n                        reinterpret_cast<const sal_uInt8*> (buffer);\n                while (writeLen > 0)\n                    {\n                        sal_Int32 n = ::std::min(writeLen, bufLen);\n                        m_writeBuf.realloc(n);\n                        memcpy(m_writeBuf.getArray(), memPtr,\n                                static_cast<size_t> (n));\n                        xos.get()->writeBytes(m_writeBuf);\n                        memPtr += n;\n                        writeLen -= n;\n                    }\n            }\n        return len;\n    }\n\n    int\n    Reader::closeInput()\n    {\n        return 0;\n    }\n\n    int\n    Reader::closeOutput()\n    {\n        Reference<XOutputStream> xos = m_transformer->getOutputStream();\n        if (xos.is())\n            {\n                xos.get()->flush();\n                xos.get()->closeOutput();\n            }\n        m_transformer->done();\n        return 0;\n    }\n\n    void\n    Reader::run()\n    {\n        OSL_ASSERT(m_transformer != NULL);\n        OSL_ASSERT(m_transformer->getInputStream().is());\n        OSL_ASSERT(m_transformer->getOutputStream().is());\n        OSL_ASSERT(m_transformer->getStyleSheetURL());\n        ::std::map<const char*, OString>::iterator pit;\n        ::std::map<const char*, OString> pmap = m_transformer->getParameters();\n        ::std::vector< const char* > params( pmap.size() * 2 + 1 ); \/\/ build parameters\n        int paramIndex = 0;\n        for (pit = pmap.begin(); pit != pmap.end(); pit++)\n            {\n                params[paramIndex++] = (*pit).first;\n                params[paramIndex++] = (*pit).second.getStr();\n            }\n        params[paramIndex] = NULL;\n        xmlDocPtr doc = xmlReadIO(&ParserInputBufferCallback::on_read,\n                &ParserInputBufferCallback::on_close,\n                static_cast<void*> (this), NULL, NULL, 0);\n        xsltStylesheetPtr styleSheet = xsltParseStylesheetFile(\n                (const xmlChar *) m_transformer->getStyleSheetURL().getStr());\n        xmlDocPtr result = NULL;\n        xsltTransformContextPtr tcontext = NULL;\n        if (styleSheet)\n            {\n                tcontext = xsltNewTransformContext(styleSheet, doc);\n                xsltQuoteUserParams(tcontext, &params[0]);\n                result = xsltApplyStylesheetUser(styleSheet, doc, 0, 0, 0,\n                        tcontext);\n            }\n\n        if (result)\n            {\n                xmlCharEncodingHandlerPtr encoder = xmlGetCharEncodingHandler(\n                        XML_CHAR_ENCODING_UTF8);\n                xmlOutputBufferPtr outBuf = xmlAllocOutputBuffer(encoder);\n                outBuf->context = static_cast<void *> (this);\n                outBuf->writecallback = &ParserOutputBufferCallback::on_write;\n                outBuf->closecallback = &ParserOutputBufferCallback::on_close;\n                xsltSaveResultTo(outBuf, result, styleSheet);\n            }\n        else\n            {\n                xmlErrorPtr lastErr = xmlGetLastError();\n                OUString msg;\n                if (lastErr)\n                    msg = OUString::createFromAscii(lastErr->message);\n                else\n                    msg = OUString::createFromAscii(\n                            \"Unknown XSLT transformation error\");\n\n                m_transformer->error(msg);\n            }\n        closeOutput();\n        xsltFreeStylesheet(styleSheet);\n        xsltFreeTransformContext(tcontext);\n        xmlFreeDoc(doc);\n        xmlFreeDoc(result);\n    }\n    ;\n\n    void\n    Reader::onTerminated()\n    {\n        m_terminated = true;\n    }\n    ;\n\n    Reader::~Reader()\n    {\n    }\n\n    LibXSLTTransformer::LibXSLTTransformer(\n            const Reference<XMultiServiceFactory> &r) :\n        m_rServiceFactory(r)\n    {\n    }\n\n    void\n    LibXSLTTransformer::setInputStream(\n            const Reference<XInputStream>& inputStream)\n            throw (RuntimeException)\n    {\n        m_rInputStream = inputStream;\n    }\n\n    Reference<XInputStream>\n    LibXSLTTransformer::getInputStream() throw (RuntimeException)\n    {\n        return m_rInputStream;\n    }\n\n    void\n    LibXSLTTransformer::setOutputStream(\n            const Reference<XOutputStream>& outputStream)\n            throw (RuntimeException)\n    {\n        m_rOutputStream = outputStream;\n    }\n\n    Reference<XOutputStream>\n    LibXSLTTransformer::getOutputStream() throw (RuntimeException)\n    {\n        return m_rOutputStream;\n    }\n\n    void\n    LibXSLTTransformer::addListener(const Reference<XStreamListener>& listener)\n            throw (RuntimeException)\n    {\n        m_listeners.insert(m_listeners.begin(), listener);\n    }\n\n    void\n    LibXSLTTransformer::removeListener(\n            const Reference<XStreamListener>& listener)\n            throw (RuntimeException)\n    {\n        m_listeners.remove(listener);\n    }\n\n    void\n    LibXSLTTransformer::start() throw (RuntimeException)\n    {\n        ListenerList::iterator it;\n        ListenerList* l = &m_listeners;\n        for (it = l->begin(); it != l->end(); ++it)\n            {\n                Reference<XStreamListener> xl = *it;\n                xl.get()->started();\n            }\n        Reader* r = new Reader(this);\n        r->create();\n    }\n\n    void\n    LibXSLTTransformer::error(const OUString& msg)\n    {\n        ListenerList* l = &m_listeners;\n        Any arg;\n        arg <<= Exception(msg, *this);\n        for (ListenerList::iterator it = l->begin(); it != l->end(); ++it)\n            {\n                Reference<XStreamListener> xl = *it;\n                if (xl.is())\n                    {\n                        xl.get()->error(arg);\n                    }\n            }\n    }\n\n    void\n    LibXSLTTransformer::done()\n    {\n        ListenerList* l = &m_listeners;\n        for (ListenerList::iterator it = l->begin(); it != l->end(); ++it)\n            {\n                Reference<XStreamListener> xl = *it;\n                if (xl.is())\n                    {\n                        xl.get()->closed();\n                    }\n            }\n    }\n\n    void\n    LibXSLTTransformer::terminate() throw (RuntimeException)\n    {\n        m_parameters.clear();\n    }\n\n    void\n    LibXSLTTransformer::initialize(const Sequence<Any>& params)\n            throw (RuntimeException)\n    {\n        xmlSubstituteEntitiesDefault(0);\n        m_parameters.clear();\n        for (int i = 0; i < params.getLength(); i++)\n            {\n                NamedValue nv;\n                params[i] >>= nv;\n                OString nameUTF8 = OUStringToOString(nv.Name,\n                        RTL_TEXTENCODING_UTF8);\n                OUString value;\n                OString valueUTF8;\n                if (nv.Value >>= value)\n                    {\n                        valueUTF8 = OUStringToOString(value,\n                                RTL_TEXTENCODING_UTF8);\n                    }\n                else\n                    {\n                        \/\/ ignore non-string parameters\n                        continue;\n                    }\n                if (nameUTF8.equals(\"StylesheetURL\"))\n                    {\n                        m_styleSheetURL = valueUTF8;\n                    }\n                else if (nameUTF8.equals(\"SourceURL\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_SOURCE_URL, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"SourceBaseURL\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_SOURCE_BASE_URL, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"TargetURL\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_TARGET_URL, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"TargetBaseURL\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_TARGET_BASE_URL, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"DoctypeSystem\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_DOCTYPE_SYSTEM, valueUTF8));\n                    }\n                else if (nameUTF8.equals(\"DoctypePublic\"))\n                    {\n                        m_parameters.insert(pair<const char*, OString> (\n                                PARAM_DOCTYPE_PUBLIC, valueUTF8));\n                    }\n            }\n    }\n\n    const OString\n    LibXSLTTransformer::getStyleSheetURL()\n    {\n        return m_styleSheetURL;\n    }\n\n    ::std::map<const char*, OString>\n    LibXSLTTransformer::getParameters()\n    {\n        return m_parameters;\n    }\n}\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- History.cpp - Previously Entered Lines -----------------*- 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 interface for setting and retrieving previously\n\/\/  entered input, with a persistent backend (i.e. a history file).\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"textinput\/History.h\"\n#include <iostream>\n#include <fstream>\n\n#ifdef WIN32\n# include <stdio.h>\n#else\n# include <unistd.h>\n#endif\n\nnamespace textinput {\n  History::History(const char* filename):\n    fHistFileName(filename ? filename : \"\"), fMaxDepth((size_t) -1),\n    fPruneLength(0), fNumHistFileLines(0) {\n    \/\/ Create a history object, initialize from filename if the file\n    \/\/ exists. Append new lines to filename taking into account the\n    \/\/ maximal number of lines allowed by SetMaxDepth().\n    if (filename) ReadFile(filename);\n  }\n\n  History::~History() {}\n\n  void\n  History::AddLine(const std::string& line) {\n    \/\/ Add a line to entries and file.\n    if (line.empty()) return;\n    fEntries.push_back(line);\n    AppendToFile();\n  }\n\n  void\n  History::ReadFile(const char* FileName) {\n    \/\/ Inject all lines of FileName.\n    \/\/ Intentionally ignore fMaxDepth\n    std::ifstream InHistFile(FileName);\n    if (!InHistFile) return;\n    std::string line;\n    while (std::getline(InHistFile, line)) {\n      while (!line.empty()) {\n        size_t len = line.length();\n        char c = line[len - 1];\n        if (c != '\\n' && c != '\\r') break;\n        line.erase(len - 1);\n      }\n      if (!line.empty()) {\n        fEntries.push_back(line);\n      }\n    }\n    fNumHistFileLines = fEntries.size();\n  }\n\n  void\n  History::AppendToFile() {\n    \/\/ Write last entry to hist file.\n    \/\/ Prune if needed.\n    if (fHistFileName.empty() || !fMaxDepth) return;\n\n    \/\/ Calculate prune length to use\n    size_t nPrune = fPruneLength;\n    if (nPrune == (size_t)kPruneLengthDefault) {\n      nPrune = (size_t)(fMaxDepth * 0.8);\n    } else if (nPrune > fMaxDepth) {\n      nPrune = fMaxDepth - 1; \/\/ fMaxDepth is guaranteed to be > 0.\n    }\n\n    \/\/ Don't check for the actual line count of the history file after every\n    \/\/ single line. Once every 50% on the way between nPrune and fMaxDepth is\n    \/\/ enough.\n    if (fNumHistFileLines < fMaxDepth\n        && (fNumHistFileLines % (fMaxDepth - nPrune)) == 0) {\n      fNumHistFileLines = 0;\n      std::string line;\n      std::ifstream in(fHistFileName.c_str());\n      while (std::getline(in, line))\n        ++fNumHistFileLines;\n    }\n\n    size_t numLines = fNumHistFileLines;\n    if (numLines >= fMaxDepth) {\n      \/\/ Prune! But don't simply write our lines - other processes might have\n      \/\/ added their own.\n      std::string line;\n      std::ifstream in(fHistFileName.c_str());\n      std::string pruneFileName = fHistFileName + \"_prune\";\n      std::ofstream out(pruneFileName.c_str());\n      if (out) {\n        if (in) {\n          while (numLines >= nPrune && std::getline(in, line)) {\n            \/\/ skip\n            --numLines;\n          }\n          while (std::getline(in, line)) {\n            out << line << '\\n';\n          }\n        }\n        out << fEntries.back() << '\\n';\n        in.close();\n        out.close();\n#ifdef WIN32\n        ::_unlink(fHistFileName.c_str());\n#else\n        ::unlink(fHistFileName.c_str());\n#endif\n        if (::rename(pruneFileName.c_str(), fHistFileName.c_str()) == -1) {\n           std::cerr << \"ERROR in textinput::History::AppendToFile(): \"\n              \"cannot rename \" << pruneFileName << \" to \" << fHistFileName;\n        }\n        fNumHistFileLines = nPrune;\n      }\n    } else {\n      std::ofstream out(fHistFileName.c_str(), std::ios_base::app);\n      out << fEntries.back() << '\\n';\n      ++fNumHistFileLines;\n    }\n  }\n}\n<commit_msg>Make tmp prune files process-unique (ROOT-6539).<commit_after>\/\/===--- History.cpp - Previously Entered Lines -----------------*- 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 interface for setting and retrieving previously\n\/\/  entered input, with a persistent backend (i.e. a history file).\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"textinput\/History.h\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n#ifdef WIN32\n# include <stdio.h>\nextern \"C\" unsigned int GetCurrentProcessId();\n#else\n# include <unistd.h>\n#endif\n\nnamespace textinput {\n  History::History(const char* filename):\n    fHistFileName(filename ? filename : \"\"), fMaxDepth((size_t) -1),\n    fPruneLength(0), fNumHistFileLines(0) {\n    \/\/ Create a history object, initialize from filename if the file\n    \/\/ exists. Append new lines to filename taking into account the\n    \/\/ maximal number of lines allowed by SetMaxDepth().\n    if (filename) ReadFile(filename);\n  }\n\n  History::~History() {}\n\n  void\n  History::AddLine(const std::string& line) {\n    \/\/ Add a line to entries and file.\n    if (line.empty()) return;\n    fEntries.push_back(line);\n    AppendToFile();\n  }\n\n  void\n  History::ReadFile(const char* FileName) {\n    \/\/ Inject all lines of FileName.\n    \/\/ Intentionally ignore fMaxDepth\n    std::ifstream InHistFile(FileName);\n    if (!InHistFile) return;\n    std::string line;\n    while (std::getline(InHistFile, line)) {\n      while (!line.empty()) {\n        size_t len = line.length();\n        char c = line[len - 1];\n        if (c != '\\n' && c != '\\r') break;\n        line.erase(len - 1);\n      }\n      if (!line.empty()) {\n        fEntries.push_back(line);\n      }\n    }\n    fNumHistFileLines = fEntries.size();\n  }\n\n  void\n  History::AppendToFile() {\n    \/\/ Write last entry to hist file.\n    \/\/ Prune if needed.\n    if (fHistFileName.empty() || !fMaxDepth) return;\n\n    \/\/ Calculate prune length to use\n    size_t nPrune = fPruneLength;\n    if (nPrune == (size_t)kPruneLengthDefault) {\n      nPrune = (size_t)(fMaxDepth * 0.8);\n    } else if (nPrune > fMaxDepth) {\n      nPrune = fMaxDepth - 1; \/\/ fMaxDepth is guaranteed to be > 0.\n    }\n\n    \/\/ Don't check for the actual line count of the history file after every\n    \/\/ single line. Once every 50% on the way between nPrune and fMaxDepth is\n    \/\/ enough.\n    if (fNumHistFileLines < fMaxDepth\n        && (fNumHistFileLines % (fMaxDepth - nPrune)) == 0) {\n      fNumHistFileLines = 0;\n      std::string line;\n      std::ifstream in(fHistFileName.c_str());\n      while (std::getline(in, line))\n        ++fNumHistFileLines;\n    }\n\n    size_t numLines = fNumHistFileLines;\n    if (numLines >= fMaxDepth) {\n      \/\/ Prune! But don't simply write our lines - other processes might have\n      \/\/ added their own.\n      std::string line;\n      std::ifstream in(fHistFileName.c_str());\n      std::stringstream pruneFileNameStream;\n      pruneFileNameStream << fHistFileName + \"_prune\"\n#if _WIN32\n                          << ::GetCurrentProcessId();\n#else\n                          << ::getpid();\n#endif\n      std::ofstream out(pruneFileNameStream.str().c_str());\n      if (out) {\n        if (in) {\n          while (numLines >= nPrune && std::getline(in, line)) {\n            \/\/ skip\n            --numLines;\n          }\n          while (std::getline(in, line)) {\n            out << line << '\\n';\n          }\n        }\n        out << fEntries.back() << '\\n';\n        in.close();\n        out.close();\n#ifdef WIN32\n        ::_unlink(fHistFileName.c_str());\n#else\n        ::unlink(fHistFileName.c_str());\n#endif\n        if (::rename(pruneFileNameStream.str().c_str(), fHistFileName.c_str()) == -1){\n           std::cerr << \"ERROR in textinput::History::AppendToFile(): \"\n              \"cannot rename \" << pruneFileNameStream.str() << \" to \" << fHistFileName;\n        }\n        fNumHistFileLines = nPrune;\n      }\n    } else {\n      std::ofstream out(fHistFileName.c_str(), std::ios_base::app);\n      out << fEntries.back() << '\\n';\n      ++fNumHistFileLines;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2012 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\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. AND ITS CONTRIBUTORS ``AS IS'' AND ANY\n * 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 APPLE INC. OR ITS CONTRIBUTORS 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 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 \"config.h\"\n\n#include \"core\/platform\/graphics\/chromium\/OpaqueRectTrackingContentLayerDelegate.h\"\n\n#include \"core\/platform\/graphics\/GraphicsContext.h\"\n#include \"core\/platform\/graphics\/IntRect.h\"\n#include \"core\/platform\/graphics\/transforms\/AffineTransform.h\"\n#include \"public\/platform\/WebFloatRect.h\"\n#include \"public\/platform\/WebRect.h\"\n\nusing WebKit::WebFloatRect;\nusing WebKit::WebRect;\n\nnamespace WebCore {\n\nOpaqueRectTrackingContentLayerDelegate::OpaqueRectTrackingContentLayerDelegate(GraphicsContextPainter* painter)\n    : m_painter(painter)\n    , m_opaque(false)\n{\n}\n\nOpaqueRectTrackingContentLayerDelegate::~OpaqueRectTrackingContentLayerDelegate()\n{\n}\n\nvoid OpaqueRectTrackingContentLayerDelegate::paintContents(SkCanvas* canvas, const WebRect& clip, bool canPaintLCDText, WebFloatRect& opaque)\n{\n    GraphicsContext context(canvas);\n    context.setTrackOpaqueRegion(!m_opaque);\n    context.setCertainlyOpaque(m_opaque);\n    context.setShouldSmoothFonts(canPaintLCDText);\n\n    \/\/ Record transform prior to painting, as all opaque tracking will be\n    \/\/ relative to this current value.\n    AffineTransform canvasToContentTransform = context.getCTM().inverse();\n\n    m_painter->paint(context, clip);\n\n    \/\/ Transform tracked opaque paints back to our layer's content space.\n    ASSERT(canvasToContentTransform.isInvertible());\n    ASSERT(canvasToContentTransform.preservesAxisAlignment());\n    opaque = canvasToContentTransform.mapRect(context.opaqueRegion().asRect());\n}\n\n}\n<commit_msg>Turn on GraphicsContext annotations when tracing.<commit_after>\/*\n * Copyright (C) 2012 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\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. AND ITS CONTRIBUTORS ``AS IS'' AND ANY\n * 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 APPLE INC. OR ITS CONTRIBUTORS 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 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 \"config.h\"\n\n#include \"core\/platform\/graphics\/chromium\/OpaqueRectTrackingContentLayerDelegate.h\"\n\n#include \"core\/platform\/EventTracer.h\"\n#include \"core\/platform\/graphics\/GraphicsContext.h\"\n#include \"core\/platform\/graphics\/IntRect.h\"\n#include \"core\/platform\/graphics\/transforms\/AffineTransform.h\"\n#include \"public\/platform\/WebFloatRect.h\"\n#include \"public\/platform\/WebRect.h\"\n\nusing WebKit::WebFloatRect;\nusing WebKit::WebRect;\n\nnamespace WebCore {\n\nOpaqueRectTrackingContentLayerDelegate::OpaqueRectTrackingContentLayerDelegate(GraphicsContextPainter* painter)\n    : m_painter(painter)\n    , m_opaque(false)\n{\n}\n\nOpaqueRectTrackingContentLayerDelegate::~OpaqueRectTrackingContentLayerDelegate()\n{\n}\n\nvoid OpaqueRectTrackingContentLayerDelegate::paintContents(SkCanvas* canvas, const WebRect& clip, bool canPaintLCDText, WebFloatRect& opaque)\n{\n    GraphicsContext context(canvas);\n    context.setTrackOpaqueRegion(!m_opaque);\n    context.setCertainlyOpaque(m_opaque);\n    context.setShouldSmoothFonts(canPaintLCDText);\n\n    if (*EventTracer::getTraceCategoryEnabledFlag(\"blink.graphics_context_annotations\"))\n        context.setAnnotationMode(AnnotateAll);\n\n    \/\/ Record transform prior to painting, as all opaque tracking will be\n    \/\/ relative to this current value.\n    AffineTransform canvasToContentTransform = context.getCTM().inverse();\n\n    m_painter->paint(context, clip);\n\n    \/\/ Transform tracked opaque paints back to our layer's content space.\n    ASSERT(canvasToContentTransform.isInvertible());\n    ASSERT(canvasToContentTransform.preservesAxisAlignment());\n    opaque = canvasToContentTransform.mapRect(context.opaqueRegion().asRect());\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2013, Project OSRM, Dennis Luxen, others\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\nRedistributions of source code must retain the above copyright notice, this list\nof conditions and the following disclaimer.\nRedistributions 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\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\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 ON\nANY 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 <osrm\/Coordinate.h>\n\n#include \"DouglasPeucker.h\"\n#include \"..\/DataStructures\/SegmentInformation.h\"\n\n#include <boost\/assert.hpp>\n\n#include <cmath>\n\n#include <limits>\n\nDouglasPeucker::DouglasPeucker()\n    : douglas_peucker_thresholds({262144., \/\/ z0\n                                  131072., \/\/ z1\n                                  65536.,  \/\/ z2\n                                  32768.,  \/\/ z3\n                                  16384.,  \/\/ z4\n                                  8192.,   \/\/ z5\n                                  4096.,   \/\/ z6\n                                  2048.,   \/\/ z7\n                                  960.,    \/\/ z8\n                                  480.,    \/\/ z9\n                                  240.,    \/\/ z10\n                                  90.,     \/\/ z11\n                                  50.,     \/\/ z12\n                                  25.,     \/\/ z13\n                                  15.,     \/\/ z14\n                                  5.,      \/\/ z15\n                                  .65,     \/\/ z16\n                                  .5,      \/\/ z17\n                                  .35      \/\/ z18\n      })\n{\n}\n\nvoid DouglasPeucker::Run(std::vector<SegmentInformation> &input_geometry, const unsigned zoom_level)\n{\n    {\n        BOOST_ASSERT_MSG(zoom_level < 19, \"unsupported zoom level\");\n        BOOST_ASSERT_MSG(1 < input_geometry.size(), \"geometry invalid\");\n        unsigned left_border = 0;\n        unsigned right_border = 1;\n        \/\/ Sweep over array and identify those ranges that need to be checked\n        do\n        {\n            BOOST_ASSERT_MSG(input_geometry[left_border].necessary,\n                             \"left border must be necessary\");\n            BOOST_ASSERT_MSG(input_geometry.back().necessary, \"right border must be necessary\");\n\n            if (input_geometry[right_border].necessary)\n            {\n                recursion_stack.emplace(left_border, right_border);\n                left_border = right_border;\n            }\n            ++right_border;\n        } while (right_border < input_geometry.size());\n    }\n    while (!recursion_stack.empty())\n    {\n        \/\/ pop next element\n        const GeometryRange pair = recursion_stack.top();\n        recursion_stack.pop();\n        BOOST_ASSERT_MSG(input_geometry[pair.first].necessary, \"left border mus be necessary\");\n        BOOST_ASSERT_MSG(input_geometry[pair.second].necessary, \"right border must be necessary\");\n        BOOST_ASSERT_MSG(pair.second < input_geometry.size(), \"right border outside of geometry\");\n        BOOST_ASSERT_MSG(pair.first < pair.second, \"left border on the wrong side\");\n        double max_distance = std::numeric_limits<double>::min();\n\n        unsigned farthest_element_index = pair.second;\n        \/\/ find index idx of element with max_distance\n        for (unsigned i = pair.first + 1; i < pair.second; ++i)\n        {\n            const double temp_dist = FixedPointCoordinate::ComputePerpendicularDistance(\n                input_geometry[i].location,\n                input_geometry[pair.first].location,\n                input_geometry[pair.second].location);\n            const double distance = std::abs(temp_dist);\n            if (distance > douglas_peucker_thresholds[zoom_level] && distance > max_distance)\n            {\n                farthest_element_index = i;\n                max_distance = distance;\n            }\n        }\n        if (max_distance > douglas_peucker_thresholds[zoom_level])\n        {\n            \/\/  mark idx as necessary\n            input_geometry[farthest_element_index].necessary = true;\n            if (1 < (farthest_element_index - pair.first))\n            {\n                recursion_stack.emplace(pair.first, farthest_element_index);\n            }\n            if (1 < (pair.second - farthest_element_index))\n            {\n                recursion_stack.emplace(farthest_element_index, pair.second);\n            }\n        }\n    }\n}\n<commit_msg>return gracefully instead of failing of geometry is only a single node<commit_after>\/*\n\nCopyright (c) 2013, Project OSRM, Dennis Luxen, others\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\nRedistributions of source code must retain the above copyright notice, this list\nof conditions and the following disclaimer.\nRedistributions 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\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\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 ON\nANY 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 <osrm\/Coordinate.h>\n\n#include \"DouglasPeucker.h\"\n#include \"..\/DataStructures\/SegmentInformation.h\"\n\n#include <boost\/assert.hpp>\n\n#include <cmath>\n\n#include <limits>\n\nDouglasPeucker::DouglasPeucker()\n    : douglas_peucker_thresholds({262144., \/\/ z0\n                                  131072., \/\/ z1\n                                  65536.,  \/\/ z2\n                                  32768.,  \/\/ z3\n                                  16384.,  \/\/ z4\n                                  8192.,   \/\/ z5\n                                  4096.,   \/\/ z6\n                                  2048.,   \/\/ z7\n                                  960.,    \/\/ z8\n                                  480.,    \/\/ z9\n                                  240.,    \/\/ z10\n                                  90.,     \/\/ z11\n                                  50.,     \/\/ z12\n                                  25.,     \/\/ z13\n                                  15.,     \/\/ z14\n                                  5.,      \/\/ z15\n                                  .65,     \/\/ z16\n                                  .5,      \/\/ z17\n                                  .35      \/\/ z18\n      })\n{\n}\n\nvoid DouglasPeucker::Run(std::vector<SegmentInformation> &input_geometry, const unsigned zoom_level)\n{\n    BOOST_ASSERT_MSG(!input_geometry.empty(), \"geometry invalid\");\n    if (input_geometry.size() <= 2)\n    {\n        return;\n    }\n\n    {\n        BOOST_ASSERT_MSG(zoom_level < 19, \"unsupported zoom level\");\n        unsigned left_border = 0;\n        unsigned right_border = 1;\n        \/\/ Sweep over array and identify those ranges that need to be checked\n        do\n        {\n            BOOST_ASSERT_MSG(input_geometry[left_border].necessary,\n                             \"left border must be necessary\");\n            BOOST_ASSERT_MSG(input_geometry.back().necessary, \"right border must be necessary\");\n\n            if (input_geometry[right_border].necessary)\n            {\n                recursion_stack.emplace(left_border, right_border);\n                left_border = right_border;\n            }\n            ++right_border;\n        } while (right_border < input_geometry.size());\n    }\n    while (!recursion_stack.empty())\n    {\n        \/\/ pop next element\n        const GeometryRange pair = recursion_stack.top();\n        recursion_stack.pop();\n        BOOST_ASSERT_MSG(input_geometry[pair.first].necessary, \"left border mus be necessary\");\n        BOOST_ASSERT_MSG(input_geometry[pair.second].necessary, \"right border must be necessary\");\n        BOOST_ASSERT_MSG(pair.second < input_geometry.size(), \"right border outside of geometry\");\n        BOOST_ASSERT_MSG(pair.first < pair.second, \"left border on the wrong side\");\n        double max_distance = std::numeric_limits<double>::min();\n\n        unsigned farthest_element_index = pair.second;\n        \/\/ find index idx of element with max_distance\n        for (unsigned i = pair.first + 1; i < pair.second; ++i)\n        {\n            const double temp_dist = FixedPointCoordinate::ComputePerpendicularDistance(\n                input_geometry[i].location,\n                input_geometry[pair.first].location,\n                input_geometry[pair.second].location);\n            const double distance = std::abs(temp_dist);\n            if (distance > douglas_peucker_thresholds[zoom_level] && distance > max_distance)\n            {\n                farthest_element_index = i;\n                max_distance = distance;\n            }\n        }\n        if (max_distance > douglas_peucker_thresholds[zoom_level])\n        {\n            \/\/  mark idx as necessary\n            input_geometry[farthest_element_index].necessary = true;\n            if (1 < (farthest_element_index - pair.first))\n            {\n                recursion_stack.emplace(pair.first, farthest_element_index);\n            }\n            if (1 < (pair.second - farthest_element_index))\n            {\n                recursion_stack.emplace(farthest_element_index, pair.second);\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>TODO-553: spreading start-up further<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"..\/Include\/CEntityNode.h\"\n#include \"..\/Include\/CSceneNode.h\"\n#include \"..\/Include\/CMenuNode.h\"\n\n#include \"cocos2d.h\"\n\nusing namespace cocos2d;\n\nnamespace LM\n{\n\nCEntityNode::CEntityNode(EAnchor a_eAnchor, int a_iWidth, int a_iHeight,\n\t\t\t\t\t\t int a_iXPosition, int a_iYPosition, const std::string& a_sID) :\n    m_eAnchor(a_eAnchor),\n\tm_iXPosition(a_iXPosition),\n    m_iYPosition(a_iYPosition),\n\tm_iWidth(a_iWidth),\n\tm_iHeight(a_iHeight),\n\tm_bVisible(true),\n\tm_bLocked(false),\n\tm_sID(a_sID),\n\tm_fEntityStartScale(0),\n\tm_pCocosEntity(nullptr)\n{\n}\n\n\n\nvoid CEntityNode::UnInit(bool removeChild)\n{\n\t\/\/m_pCocosEntity->autorelease();\n\t\/\/m_pCocosEntity->release();\n\tif (m_pCocosEntity != nullptr) {\n\t\tif(removeChild)\n\t\t\tGetParentScene()->removeChild(m_pCocosEntity);\n\n\t\tm_pCocosEntity = nullptr;\n\t\tCNode::UnInit();\n\t}\n\telse {\n\t\treturn;\n\t}\n}\n\n\n\nvoid CEntityNode::Revert(bool a_bVisible)\n{\n\tShow(a_bVisible);\n\tif (m_sID != \"\")\n\t\tCCLOG(\"reverting : %s\", m_sID.c_str());\n\tm_pCocosEntity->setPosition(m_oEntityStartLocation);\n\tm_pCocosEntity->setScale(m_fEntityStartScale);\n        for (CNode* itNode : m_vChildren)\n        {\n          CEntityNode* pEntity = dynamic_cast<CEntityNode*>(itNode);\n          if (pEntity)\n          {\n            pEntity->Revert(a_bVisible);\n          }\n        }\n}\n\n\ncocos2d::Node* CEntityNode::GetCocosEntity()\n{\n\treturn m_pCocosEntity;\n}\n\n\nvoid CEntityNode::AddListener(const std::string& a_rEvent, const CEventCallback& a_rCallback)\n{\n\tstd::map<std::string, std::vector<CEventCallback>>::iterator it = m_mListeners.find(a_rEvent);\n\tif (it != m_mListeners.end())\n\t{\n\t\tit->second.push_back(a_rCallback);\n\t}\n\telse\n\t{\n\t\tstd::vector<CEventCallback> oCallbacks;\n\t\toCallbacks.push_back(a_rCallback);\n\t\tm_mListeners.insert(std::pair<std::string, std::vector<CEventCallback>>(a_rEvent, oCallbacks));\n\t}\n}\n\nvoid CEntityNode::DisableEvent(const std::string& a_rEvent)\n{\n\tm_oDisabledEvents.insert(a_rEvent);\n}\n\nvoid CEntityNode::EnableEvent(const std::string& a_rEvent)\n{\n\tm_oDisabledEvents.erase(a_rEvent);\n}\n\n\nbool CEntityNode::EventIsDisabled(const std::string& a_rEvent)\n{\n\treturn (m_oDisabledEvents.find(a_rEvent) != m_oDisabledEvents.end());\n}\n\nbool CEntityNode::IsListeningTo(const std::string& a_rEvent)\n{\n\tif (m_oDisabledEvents.find(a_rEvent) == m_oDisabledEvents.end())\n\t{\n\t\tstd::map<std::string, std::vector<CEventCallback>>::iterator it = m_mListeners.find(a_rEvent);\n\t\treturn (it != m_mListeners.end());\n\t}\n}\n\n\nvoid CEntityNode::Dispatch(const std::string& a_rEvent, CEntityNode* a_pSender)\n{\n\tif (m_oDisabledEvents.find(a_rEvent) == m_oDisabledEvents.end())\n\t{\n\t\tstd::map<std::string, std::vector<CEventCallback>>::iterator it = m_mListeners.find(a_rEvent);\n\t\tif (it != m_mListeners.end())\n\t\t{\n\t\t\tfor (CEventCallback oCallback : it->second)\n\t\t\t{\n\t\t\t\tCCLOG(\"CEntity::Dispatch : Calling callback %s on entity %s\", a_rEvent.c_str(), m_sID.c_str());\n\t\t\t\toCallback(a_pSender);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid CEntityNode::PopulateParent(bool a_bDoScaling)\n{\n\n\t\/\/ Size oVisibleSize = Director::getInstance()->getVisibleSize();\n\t\/\/ Vec2 oOrigin = Director::getInstance()->getVisibleOrigin();\n  Size oVisibleSize = GetParentVisibleSize();\n  Vec2 oOrigin = GetParentOrigin();\n\t\n\tswitch (m_eAnchor)\n\t{\n\tcase LM::CENTER:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0.5, 0.5));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width\/2, oOrigin.y + oVisibleSize.height\/2));\n\t\tbreak;\n\tcase LM::BOTTOM_LEFT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0, 0));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x, oOrigin.y));\n\t\tbreak;\n\tcase LM::LEFT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0, 0.5));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x, oOrigin.y + oVisibleSize.height \/ 2));\n\t\tbreak;\n\tcase LM::TOP_LEFT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0, 1));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x, oOrigin.y + oVisibleSize.height));\n\t\tbreak;\n\tcase LM::TOP:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0.5, 1));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width \/ 2, oOrigin.y + oVisibleSize.height));\n\t\tbreak;\n\tcase LM::TOP_RIGHT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(1, 1));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width, oOrigin.y + oVisibleSize.height));\n\t\tbreak;\n\tcase LM::RIGHT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(1, 0.5));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width, oOrigin.y + oVisibleSize.height \/ 2));\n\t\tbreak;\n\tcase LM::BOTTOM_RIGHT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(1, 0));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width, oOrigin.y));\n\t\tbreak;\n\tcase LM::BOTTOM:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0.5, 0));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width \/ 2, oOrigin.y));\n\t\tbreak;\n\tcase LM::FLOAT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0.5, 0.5));\n\t\tm_pCocosEntity->setPosition(Vec2(m_iXPosition, m_iYPosition));\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\n\tif (a_bDoScaling) {\n\n\t\tfloat fNewScale;\n\n\t\tif (m_iWidth != 0)\n\t\t{\n\t\t\tfloat fOldWidth = m_pCocosEntity->getBoundingBox().getMaxX() - m_pCocosEntity->getBoundingBox().getMinX();\n\t\t\tfloat fNewWidth = oVisibleSize.width * ((float)m_iWidth \/ 100.0f);\n\t\t\tfNewScale = fNewWidth \/ fOldWidth;\n\t\t}\n\t\telse \n\t\t{\n\t\t\tfloat fOldHeight = m_pCocosEntity->getBoundingBox().getMaxY() - m_pCocosEntity->getBoundingBox().getMinY();\n\t\t\tfloat fNewHeight = oVisibleSize.height * ((float)m_iHeight \/ 100.0f);\n\t\t\tfNewScale = fNewHeight \/ fOldHeight;\n\t\t}\n\n\n\n\t\tm_pCocosEntity->setScale(fNewScale);\n\n\t}\n\tcocos2d::Scene* pScene = GetParentScene();\n\tif (pScene)\n\t{\n\t\tpScene->addChild(m_pCocosEntity, 0);\n\t}\n\n\n\tm_pCocosEntity->setVisible(m_bVisible);\n\n\tm_oEntityStartLocation = m_pCocosEntity->getPosition();\n\tm_fEntityStartScale = m_pCocosEntity->getScale();\n\n\tDispatch(\"Init\");\n}\n\n\nScene* CEntityNode::GetParentScene()\n{\n\tCSceneNode* pParentScene = dynamic_cast<CSceneNode*>(m_pParent);\n\tif (pParentScene)\n\t{\n\t\treturn pParentScene->GetScene();\n\t}\n\telse\n\t{\n\t\tCEntityNode* pParentNode = dynamic_cast<CEntityNode*>(m_pParent);\n\t\tif (pParentNode)\n\t\t{\n\t\t\treturn pParentNode->GetParentScene();\n\t\t}\n\t}\n}\n\nSize CEntityNode::GetParentVisibleSize()\n{\n\n  CEntityNode* pParentEntity = dynamic_cast<CEntityNode*>(m_pParent);\n  if (pParentEntity)\n  {\n    return pParentEntity->GetVisibleSize();\n  }\n  \n  return Director::getInstance()->getVisibleSize();\n  \n}\n\nVec2 CEntityNode::GetParentOrigin()\n{\n  CEntityNode* pParentEntity = dynamic_cast<CEntityNode*>(m_pParent);\n  if (pParentEntity)\n  {\n    return pParentEntity->GetOrigin();\n  }\n\n  return Director::getInstance()->getVisibleOrigin();\n}\n\n\nSize CEntityNode::GetVisibleSize()\n{\n\t\/\/return m_pCocosEntity->getContentSize();\n\tRect oBoundingBox = m_pCocosEntity->getBoundingBox();\n\treturn Size(oBoundingBox.getMaxX() - oBoundingBox.getMinX(),\n\t\toBoundingBox.getMaxY() - oBoundingBox.getMinY());\n}\n\nVec2 CEntityNode::GetOrigin()\n{\n\tRect oBoundingBox = m_pCocosEntity->getBoundingBox();\n\treturn Vec2(oBoundingBox.getMinX(), oBoundingBox.getMinY());\n}\n\nvoid CEntityNode::SetVisible(bool a_bVisible)\n{\n\tm_bVisible = a_bVisible;\n}\n\nbool CEntityNode::IsVisible()\n{\n\treturn m_bVisible;\n}\n\nstd::string CEntityNode::GetID()\n{\n\treturn m_sID;\n}\n\nvoid CEntityNode::SetID(const std::string& a_rID)\n{\n\tm_sID = a_rID;\n}\n\nvoid CEntityNode::Show(bool a_bVisible)\n{\n\tif (GetID() != \"\" && a_bVisible)\n\t\tCCLOG(\"Showing entity : %s\", GetID().c_str());\n\n\tm_bVisible = a_bVisible;\n\tif (m_pCocosEntity) \n\t{\n\t\tm_pCocosEntity->setVisible(a_bVisible);\n\t\tFadeIn();\n\t}\n\t\n\tfor (CNode* itNode : *this)\n\t{\n\t\tCEntityNode* pEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\tif (pEntity && (!pEntity->IsListeningTo(\"Show\") || !a_bVisible))\n\t\t{\n\t\t\tpEntity->Show(a_bVisible);\n\t\t}\n\t}\n\n}\n\nbool CEntityNode::IsLocked()\n{\n\treturn m_bLocked;\n}\n\nVec2 CEntityNode::GetEntityStartLocation()\n{\n\treturn m_oEntityStartLocation;\n}\n\nfloat CEntityNode::GetEntityStartScale()\n{\n\treturn m_fEntityStartScale;\n}\n\n\nvoid CEntityNode::Fade()\n{\n\tauto fpReleaseEntity = CallFunc::create([this]() {\n\t\tCEntityNode::Release(this);\n\t\tthis->Revert();\n\t});\n\n\tauto oFadeOut = FadeOut::create(1.0f);\n\tauto oSequence = Sequence::create(oFadeOut, fpReleaseEntity, nullptr);\n\n\tm_pCocosEntity->runAction(oSequence);\n\n\tfor (CNode* itNode : m_vChildren)\n\t{\n\t\tCEntityNode* pChildEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\tif (pChildEntity)\n\t\t{\n\t\t\tpChildEntity->Fade();\n\t\t}\n\t}\n}\n\nvoid CEntityNode::FadeIn()\n{\n\tCCLOG(\"CEntityNode::FadeIn %s\", m_sID.c_str());\n\tauto oFadeIn = FadeIn::create(0.5f);\n\n\tm_pCocosEntity->runAction(oFadeIn);\n\n\t\/*for (CNode* itNode : m_vChildren)\n\t{\n\t\tCEntityNode* pChildEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\tif (pChildEntity)\n\t\t{\n\t\t\tpChildEntity->FadeIn();\n\t\t}\n\t}*\/\n}\n\n\nbool CEntityNode::Lock(CEntityNode* a_pEntity)\n{\n\tif (!a_pEntity->IsLocked())\n\t{\n\t\ta_pEntity->m_bLocked = true;\n\t\tfor (CNode* itNode : *a_pEntity)\n\t\t{\n\t\t\tCEntityNode* pEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\t\tif (pEntity)\n\t\t\t{\n\t\t\t\tCEntityNode::Lock(pEntity);\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid CEntityNode::Release(CEntityNode* a_pEntity)\n{\n\ta_pEntity->m_bLocked = false;\n\tfor (CNode* itNode : *a_pEntity)\n\t{\n\t\tCEntityNode* pEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\tif (pEntity)\n\t\t{\n\t\t\tCEntityNode::Release(pEntity);\n\t\t}\n\t}\n}\n\n\n} \/\/ namespace LM\n<commit_msg>[FIX] fixed entities disappearing on transitions<commit_after>#include \"..\/Include\/CEntityNode.h\"\n#include \"..\/Include\/CSceneNode.h\"\n#include \"..\/Include\/CMenuNode.h\"\n\n#include \"cocos2d.h\"\n\nusing namespace cocos2d;\n\nnamespace LM\n{\n\nCEntityNode::CEntityNode(EAnchor a_eAnchor, int a_iWidth, int a_iHeight,\n\t\t\t\t\t\t int a_iXPosition, int a_iYPosition, const std::string& a_sID) :\n    m_eAnchor(a_eAnchor),\n\tm_iXPosition(a_iXPosition),\n    m_iYPosition(a_iYPosition),\n\tm_iWidth(a_iWidth),\n\tm_iHeight(a_iHeight),\n\tm_bVisible(true),\n\tm_bLocked(false),\n\tm_sID(a_sID),\n\tm_fEntityStartScale(0),\n\tm_pCocosEntity(nullptr)\n{\n}\n\n\n\nvoid CEntityNode::UnInit(bool removeChild)\n{\n\t\/\/m_pCocosEntity->autorelease();\n\t\/\/m_pCocosEntity->release();\n\tif (m_pCocosEntity != nullptr) {\n\t\tif(removeChild)\n\t\t\tGetParentScene()->removeChild(m_pCocosEntity);\n\n\t\tm_pCocosEntity = nullptr;\n\t\tCNode::UnInit(removeChild);\n\t}\n\telse {\n\t\treturn;\n\t}\n}\n\n\n\nvoid CEntityNode::Revert(bool a_bVisible)\n{\n\tShow(a_bVisible);\n\tif (m_sID != \"\")\n\t\tCCLOG(\"reverting : %s\", m_sID.c_str());\n\tm_pCocosEntity->setPosition(m_oEntityStartLocation);\n\tm_pCocosEntity->setScale(m_fEntityStartScale);\n        for (CNode* itNode : m_vChildren)\n        {\n          CEntityNode* pEntity = dynamic_cast<CEntityNode*>(itNode);\n          if (pEntity)\n          {\n            pEntity->Revert(a_bVisible);\n          }\n        }\n}\n\n\ncocos2d::Node* CEntityNode::GetCocosEntity()\n{\n\treturn m_pCocosEntity;\n}\n\n\nvoid CEntityNode::AddListener(const std::string& a_rEvent, const CEventCallback& a_rCallback)\n{\n\tstd::map<std::string, std::vector<CEventCallback>>::iterator it = m_mListeners.find(a_rEvent);\n\tif (it != m_mListeners.end())\n\t{\n\t\tit->second.push_back(a_rCallback);\n\t}\n\telse\n\t{\n\t\tstd::vector<CEventCallback> oCallbacks;\n\t\toCallbacks.push_back(a_rCallback);\n\t\tm_mListeners.insert(std::pair<std::string, std::vector<CEventCallback>>(a_rEvent, oCallbacks));\n\t}\n}\n\nvoid CEntityNode::DisableEvent(const std::string& a_rEvent)\n{\n\tm_oDisabledEvents.insert(a_rEvent);\n}\n\nvoid CEntityNode::EnableEvent(const std::string& a_rEvent)\n{\n\tm_oDisabledEvents.erase(a_rEvent);\n}\n\n\nbool CEntityNode::EventIsDisabled(const std::string& a_rEvent)\n{\n\treturn (m_oDisabledEvents.find(a_rEvent) != m_oDisabledEvents.end());\n}\n\nbool CEntityNode::IsListeningTo(const std::string& a_rEvent)\n{\n\tif (m_oDisabledEvents.find(a_rEvent) == m_oDisabledEvents.end())\n\t{\n\t\tstd::map<std::string, std::vector<CEventCallback>>::iterator it = m_mListeners.find(a_rEvent);\n\t\treturn (it != m_mListeners.end());\n\t}\n}\n\n\nvoid CEntityNode::Dispatch(const std::string& a_rEvent, CEntityNode* a_pSender)\n{\n\tif (m_oDisabledEvents.find(a_rEvent) == m_oDisabledEvents.end())\n\t{\n\t\tstd::map<std::string, std::vector<CEventCallback>>::iterator it = m_mListeners.find(a_rEvent);\n\t\tif (it != m_mListeners.end())\n\t\t{\n\t\t\tfor (CEventCallback oCallback : it->second)\n\t\t\t{\n\t\t\t\tCCLOG(\"CEntity::Dispatch : Calling callback %s on entity %s\", a_rEvent.c_str(), m_sID.c_str());\n\t\t\t\toCallback(a_pSender);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid CEntityNode::PopulateParent(bool a_bDoScaling)\n{\n\n\t\/\/ Size oVisibleSize = Director::getInstance()->getVisibleSize();\n\t\/\/ Vec2 oOrigin = Director::getInstance()->getVisibleOrigin();\n  Size oVisibleSize = GetParentVisibleSize();\n  Vec2 oOrigin = GetParentOrigin();\n\t\n\tswitch (m_eAnchor)\n\t{\n\tcase LM::CENTER:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0.5, 0.5));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width\/2, oOrigin.y + oVisibleSize.height\/2));\n\t\tbreak;\n\tcase LM::BOTTOM_LEFT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0, 0));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x, oOrigin.y));\n\t\tbreak;\n\tcase LM::LEFT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0, 0.5));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x, oOrigin.y + oVisibleSize.height \/ 2));\n\t\tbreak;\n\tcase LM::TOP_LEFT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0, 1));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x, oOrigin.y + oVisibleSize.height));\n\t\tbreak;\n\tcase LM::TOP:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0.5, 1));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width \/ 2, oOrigin.y + oVisibleSize.height));\n\t\tbreak;\n\tcase LM::TOP_RIGHT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(1, 1));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width, oOrigin.y + oVisibleSize.height));\n\t\tbreak;\n\tcase LM::RIGHT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(1, 0.5));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width, oOrigin.y + oVisibleSize.height \/ 2));\n\t\tbreak;\n\tcase LM::BOTTOM_RIGHT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(1, 0));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width, oOrigin.y));\n\t\tbreak;\n\tcase LM::BOTTOM:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0.5, 0));\n\t\tm_pCocosEntity->setPosition(Vec2(oOrigin.x + oVisibleSize.width \/ 2, oOrigin.y));\n\t\tbreak;\n\tcase LM::FLOAT:\n\t\tm_pCocosEntity->setAnchorPoint(Vec2(0.5, 0.5));\n\t\tm_pCocosEntity->setPosition(Vec2(m_iXPosition, m_iYPosition));\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\n\tif (a_bDoScaling) {\n\n\t\tfloat fNewScale;\n\n\t\tif (m_iWidth != 0)\n\t\t{\n\t\t\tfloat fOldWidth = m_pCocosEntity->getBoundingBox().getMaxX() - m_pCocosEntity->getBoundingBox().getMinX();\n\t\t\tfloat fNewWidth = oVisibleSize.width * ((float)m_iWidth \/ 100.0f);\n\t\t\tfNewScale = fNewWidth \/ fOldWidth;\n\t\t}\n\t\telse \n\t\t{\n\t\t\tfloat fOldHeight = m_pCocosEntity->getBoundingBox().getMaxY() - m_pCocosEntity->getBoundingBox().getMinY();\n\t\t\tfloat fNewHeight = oVisibleSize.height * ((float)m_iHeight \/ 100.0f);\n\t\t\tfNewScale = fNewHeight \/ fOldHeight;\n\t\t}\n\n\n\n\t\tm_pCocosEntity->setScale(fNewScale);\n\n\t}\n\tcocos2d::Scene* pScene = GetParentScene();\n\tif (pScene)\n\t{\n\t\tpScene->addChild(m_pCocosEntity, 0);\n\t}\n\n\n\tm_pCocosEntity->setVisible(m_bVisible);\n\n\tm_oEntityStartLocation = m_pCocosEntity->getPosition();\n\tm_fEntityStartScale = m_pCocosEntity->getScale();\n\n\tDispatch(\"Init\");\n}\n\n\nScene* CEntityNode::GetParentScene()\n{\n\tCSceneNode* pParentScene = dynamic_cast<CSceneNode*>(m_pParent);\n\tif (pParentScene)\n\t{\n\t\treturn pParentScene->GetScene();\n\t}\n\telse\n\t{\n\t\tCEntityNode* pParentNode = dynamic_cast<CEntityNode*>(m_pParent);\n\t\tif (pParentNode)\n\t\t{\n\t\t\treturn pParentNode->GetParentScene();\n\t\t}\n\t}\n}\n\nSize CEntityNode::GetParentVisibleSize()\n{\n\n  CEntityNode* pParentEntity = dynamic_cast<CEntityNode*>(m_pParent);\n  if (pParentEntity)\n  {\n    return pParentEntity->GetVisibleSize();\n  }\n  \n  return Director::getInstance()->getVisibleSize();\n  \n}\n\nVec2 CEntityNode::GetParentOrigin()\n{\n  CEntityNode* pParentEntity = dynamic_cast<CEntityNode*>(m_pParent);\n  if (pParentEntity)\n  {\n    return pParentEntity->GetOrigin();\n  }\n\n  return Director::getInstance()->getVisibleOrigin();\n}\n\n\nSize CEntityNode::GetVisibleSize()\n{\n\t\/\/return m_pCocosEntity->getContentSize();\n\tRect oBoundingBox = m_pCocosEntity->getBoundingBox();\n\treturn Size(oBoundingBox.getMaxX() - oBoundingBox.getMinX(),\n\t\toBoundingBox.getMaxY() - oBoundingBox.getMinY());\n}\n\nVec2 CEntityNode::GetOrigin()\n{\n\tRect oBoundingBox = m_pCocosEntity->getBoundingBox();\n\treturn Vec2(oBoundingBox.getMinX(), oBoundingBox.getMinY());\n}\n\nvoid CEntityNode::SetVisible(bool a_bVisible)\n{\n\tm_bVisible = a_bVisible;\n}\n\nbool CEntityNode::IsVisible()\n{\n\treturn m_bVisible;\n}\n\nstd::string CEntityNode::GetID()\n{\n\treturn m_sID;\n}\n\nvoid CEntityNode::SetID(const std::string& a_rID)\n{\n\tm_sID = a_rID;\n}\n\nvoid CEntityNode::Show(bool a_bVisible)\n{\n\tif (GetID() != \"\" && a_bVisible)\n\t\tCCLOG(\"Showing entity : %s\", GetID().c_str());\n\n\tm_bVisible = a_bVisible;\n\tif (m_pCocosEntity) \n\t{\n\t\tm_pCocosEntity->setVisible(a_bVisible);\n\t\tFadeIn();\n\t}\n\t\n\tfor (CNode* itNode : *this)\n\t{\n\t\tCEntityNode* pEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\tif (pEntity && (!pEntity->IsListeningTo(\"Show\") || !a_bVisible))\n\t\t{\n\t\t\tpEntity->Show(a_bVisible);\n\t\t}\n\t}\n\n}\n\nbool CEntityNode::IsLocked()\n{\n\treturn m_bLocked;\n}\n\nVec2 CEntityNode::GetEntityStartLocation()\n{\n\treturn m_oEntityStartLocation;\n}\n\nfloat CEntityNode::GetEntityStartScale()\n{\n\treturn m_fEntityStartScale;\n}\n\n\nvoid CEntityNode::Fade()\n{\n\tauto fpReleaseEntity = CallFunc::create([this]() {\n\t\tCEntityNode::Release(this);\n\t\tthis->Revert();\n\t});\n\n\tauto oFadeOut = FadeOut::create(1.0f);\n\tauto oSequence = Sequence::create(oFadeOut, fpReleaseEntity, nullptr);\n\n\tm_pCocosEntity->runAction(oSequence);\n\n\tfor (CNode* itNode : m_vChildren)\n\t{\n\t\tCEntityNode* pChildEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\tif (pChildEntity)\n\t\t{\n\t\t\tpChildEntity->Fade();\n\t\t}\n\t}\n}\n\nvoid CEntityNode::FadeIn()\n{\n\tCCLOG(\"CEntityNode::FadeIn %s\", m_sID.c_str());\n\tauto oFadeIn = FadeIn::create(0.5f);\n\n\tm_pCocosEntity->runAction(oFadeIn);\n\n\t\/*for (CNode* itNode : m_vChildren)\n\t{\n\t\tCEntityNode* pChildEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\tif (pChildEntity)\n\t\t{\n\t\t\tpChildEntity->FadeIn();\n\t\t}\n\t}*\/\n}\n\n\nbool CEntityNode::Lock(CEntityNode* a_pEntity)\n{\n\tif (!a_pEntity->IsLocked())\n\t{\n\t\ta_pEntity->m_bLocked = true;\n\t\tfor (CNode* itNode : *a_pEntity)\n\t\t{\n\t\t\tCEntityNode* pEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\t\tif (pEntity)\n\t\t\t{\n\t\t\t\tCEntityNode::Lock(pEntity);\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid CEntityNode::Release(CEntityNode* a_pEntity)\n{\n\ta_pEntity->m_bLocked = false;\n\tfor (CNode* itNode : *a_pEntity)\n\t{\n\t\tCEntityNode* pEntity = dynamic_cast<CEntityNode*>(itNode);\n\t\tif (pEntity)\n\t\t{\n\t\t\tCEntityNode::Release(pEntity);\n\t\t}\n\t}\n}\n\n\n} \/\/ namespace LM\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <cmath>\n\n#include \"..\/..\/include\/solvers\/Solver.h\"\n#include \"..\/..\/include\/solvers\/UCTSolver.h\"\n\nnamespace mlsolvers\n{\n\nmlcore::Action* UCTSolver::pickAction(UCTNode* node, double C)\n{\n    double best = mdplib::dead_end_cost + 1;\n    mlcore::Action* bestAction = nullptr;\n    std::vector<mlcore::Action*> unexplored_actions;\n                                                                                dprint2(\"  ==pick action\", node);\n    auto actions_qvalue_map = action_qvalues_[node];\n    int num_actions = actions_qvalue_map.size();\n                                                                                dprint2(\"  num actions\", num_actions);\n    for (auto action_and_qvalue : actions_qvalue_map) {\n        mlcore::Action* a = action_and_qvalue.first;\n        if (!problem_->applicable(node->state_, a))\n            continue;\n        if (counters_node_action_[node][a] == delta_) {  \/\/ unexplored action\n            unexplored_actions.push_back(a);\n            continue;\n        }\n                                                                                dprint2(\"    cost for\", a);\n        if (use_qvalues_for_c_) {\n            C = action_and_qvalue.second;\n            C \/= sqrt(log(num_actions) \/ (delta_ + 1) + 1);\n        }\n        double ucb1 = ucb1Cost(node, a, C);\n                                                                                dprint2(\"    ucb1cost =\", ucb1);\n        if (ucb1 < best) {\n            bestAction = a;\n            best = ucb1;\n        }\n    }\n    if (unexplored_actions.size() > 0) {\n        int idx = rand() % unexplored_actions.size();\n                                                                                dprint2(\"    unexplored\", unexplored_actions[idx]);\n        return unexplored_actions[idx];\n    }\n                                                                                dprint2(\"    best\", bestAction);\n    return bestAction;\n}\n\ndouble UCTSolver::ucb1Cost(UCTNode* node, mlcore::Action* a, double C)\n{\n                                                                                dprint4(\"      counters (node, action) \/ qvalue =\",\n                                                                                        counters_node_[node],\n                                                                                        counters_node_action_[node][a],\n                                                                                        action_qvalues_[node][a]);\n    double cost = action_qvalues_[node][a] - C\n        * std::sqrt(std::log(counters_node_[node])\n                    \/ counters_node_action_[node][a]);\n    return std::min(cost, mdplib::dead_end_cost);\n}\n\nmlcore::Action* UCTSolver::solve(mlcore::State* s0)\n{\n    UCTNode* root = new UCTNode(s0, start_depth_);\n    for (int r = 0; r < max_rollouts_; r++) {\n        UCTNode* tmp_node = root;\n        std::vector<int> cumCost(cutoff_ + 1);\n        std::vector<UCTNode*> nodes_in_rollout(cutoff_ + 1);\n        std::vector<mlcore::Action*> actions_in_rollout(cutoff_ + 1);\n        int maxSteps = 0;\n        for (int i = 1; i <= cutoff_; i++) {\n            bool first_time_seen = visited_.insert(tmp_node).second;\n            if (first_time_seen) {\n                counters_node_[tmp_node] = 0;\n                                                                                dprint2(\"count\", counters_node_.size());\n                for (mlcore::Action* a : problem_->actions()) {\n                    if (!problem_->applicable(tmp_node->state_, a))\n                        continue;\n                    counters_node_action_[tmp_node][a] = delta_;\n                    counters_node_[tmp_node] += delta_; \/\/ not sure about this\n                    action_qvalues_[tmp_node][a] =\n                        qvalue(problem_, tmp_node->state_, a);\n                }\n            }\n            if (problem_->goal(tmp_node->state_))\n                break;\n            maxSteps = i;\n            mlcore::Action* a = pickAction(tmp_node, C_);\n            mlcore::State* next =\n                randomSuccessor(problem_, tmp_node->state_, a);\n            cumCost[i] = cumCost[i - 1] + problem_->cost(tmp_node->state_, a);\n            nodes_in_rollout[i] = tmp_node;\n            actions_in_rollout[i] = a;\n            tmp_node = new UCTNode(next, tmp_node->depth_ + 1);\n                                                                                dprint2(\"  ==next\", tmp_node);\n        }\n\n        for (int i = 1; i <= maxSteps; i++) {\n            UCTNode* node = nodes_in_rollout[i];\n            mlcore::Action* a = actions_in_rollout[i];\n            double newq = counters_node_action_[node][a]\n                * action_qvalues_[node][a]\n                + cumCost[maxSteps] - cumCost[i - 1];\n            newq \/= (counters_node_action_[node][a] + 1);\n                                                                                dprint3(\"update-qvalue\", node, a);\n                                                                                dprint3(counters_node_action_[node][a],\n                                                                                        newq,\n                                                                                        cumCost[maxSteps] - cumCost[i - 1]);\n            action_qvalues_[node][a] = newq;\n            counters_node_[node]++;\n            counters_node_action_[node][a]++;\n        }\n                                                                                dprint1(\"**************************************\");\n    }\n\n    if (auto_adjust_depth_) {\n        cutoff_++;\n        start_depth_++;\n    }\n    return pickAction(root, 0.0);\n}\n\n}\n\n<commit_msg>cleaned up the UCT code<commit_after>#include <vector>\n#include <cmath>\n\n#include \"..\/..\/include\/solvers\/Solver.h\"\n#include \"..\/..\/include\/solvers\/UCTSolver.h\"\n\nnamespace mlsolvers\n{\n\nmlcore::Action* UCTSolver::pickAction(UCTNode* node, double C)\n{\n    double best = mdplib::dead_end_cost + 1;\n    mlcore::Action* bestAction = nullptr;\n    std::vector<mlcore::Action*> unexplored_actions;\n    auto actions_qvalue_map = action_qvalues_[node];\n    int num_actions = actions_qvalue_map.size();\n    for (auto action_and_qvalue : actions_qvalue_map) {\n        mlcore::Action* a = action_and_qvalue.first;\n        if (!problem_->applicable(node->state_, a))\n            continue;\n        if (counters_node_action_[node][a] == delta_) {  \/\/ unexplored action\n            unexplored_actions.push_back(a);\n            continue;\n        }\n        if (use_qvalues_for_c_) {\n            C = action_and_qvalue.second;\n            C \/= sqrt(log(num_actions) \/ (delta_ + 1) + 1);\n        }\n        double ucb1 = ucb1Cost(node, a, C);\n        if (ucb1 < best) {\n            bestAction = a;\n            best = ucb1;\n        }\n    }\n    if (unexplored_actions.size() > 0) {\n        int idx = rand() % unexplored_actions.size();\n        return unexplored_actions[idx];\n    }\n    return bestAction;\n}\n\ndouble UCTSolver::ucb1Cost(UCTNode* node, mlcore::Action* a, double C)\n{\n    double cost = action_qvalues_[node][a] - C\n        * std::sqrt(std::log(counters_node_[node])\n                    \/ counters_node_action_[node][a]);\n    return std::min(cost, mdplib::dead_end_cost);\n}\n\nmlcore::Action* UCTSolver::solve(mlcore::State* s0)\n{\n    UCTNode* root = new UCTNode(s0, start_depth_);\n    for (int r = 0; r < max_rollouts_; r++) {\n        UCTNode* tmp_node = root;\n        std::vector<int> cumCost(cutoff_ + 1);\n        std::vector<UCTNode*> nodes_in_rollout(cutoff_ + 1);\n        std::vector<mlcore::Action*> actions_in_rollout(cutoff_ + 1);\n        int maxSteps = 0;\n        for (int i = 1; i <= cutoff_; i++) {\n            bool first_time_seen = visited_.insert(tmp_node).second;\n            if (first_time_seen) {\n                counters_node_[tmp_node] = 0;\n                for (mlcore::Action* a : problem_->actions()) {\n                    if (!problem_->applicable(tmp_node->state_, a))\n                        continue;\n                    counters_node_action_[tmp_node][a] = delta_;\n                    counters_node_[tmp_node] += delta_; \/\/ not sure about this\n                    action_qvalues_[tmp_node][a] =\n                        qvalue(problem_, tmp_node->state_, a);\n                }\n            }\n            if (problem_->goal(tmp_node->state_))\n                break;\n            maxSteps = i;\n            mlcore::Action* a = pickAction(tmp_node, C_);\n            mlcore::State* next =\n                randomSuccessor(problem_, tmp_node->state_, a);\n            cumCost[i] = cumCost[i - 1] + problem_->cost(tmp_node->state_, a);\n            nodes_in_rollout[i] = tmp_node;\n            actions_in_rollout[i] = a;\n            tmp_node = new UCTNode(next, tmp_node->depth_ + 1);\n        }\n\n        for (int i = 1; i <= maxSteps; i++) {\n            UCTNode* node = nodes_in_rollout[i];\n            mlcore::Action* a = actions_in_rollout[i];\n            double newq = counters_node_action_[node][a]\n                * action_qvalues_[node][a]\n                + cumCost[maxSteps] - cumCost[i - 1];\n            newq \/= (counters_node_action_[node][a] + 1);\n            action_qvalues_[node][a] = newq;\n            counters_node_[node]++;\n            counters_node_action_[node][a]++;\n        }\n    }\n\n    if (auto_adjust_depth_) {\n        cutoff_++;\n        start_depth_++;\n    }\n    return pickAction(root, 0.0);\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <cmath>\n\n#include \"..\/..\/include\/solvers\/Solver.h\"\n#include \"..\/..\/include\/solvers\/UCTSolver.h\"\n\nnamespace mlsolvers\n{\n    UCTSolver::UCTSolver(mlcore::Problem* problem, double C, int maxRollouts, int cutoff)\n    {\n        problem_ = problem;\n        C_ = C;\n        maxRollouts_ = maxRollouts;\n        cutoff_ = cutoff;\n    }\n\n    mlcore::Action* UCTSolver::pickUCB1Action(mlcore::State* s)\n    {\n        return pickAction(s, C_);\n    }\n\n    mlcore::Action* UCTSolver::pickAction(mlcore::State* s, double C)\n    {\n        double best = mdplib::dead_end_cost + 1;\n        mlcore::Action* bestAction = nullptr;\n        for (std::pair<mlcore::Action*,double> entry : qvalues_[s]) {\n            mlcore::Action* a = entry.first;\n            if (counterSA_[s][a] == 0)\n                return a;\n            double ucb1 = ucb1Cost(s, a, entry.second);\n            if (ucb1 < best) {\n                bestAction = a;\n                best = ucb1;\n            }\n        }\n        return bestAction;\n    }\n\n    double UCTSolver::ucb1Cost(mlcore::State* s, mlcore::Action* a, double C)\n    {\n        double cost = qvalues_[s][a] - C*std::sqrt(2 * std::log(counterS_[s]) \/ counterSA_[s][a]);\n        if (cost > mdplib::dead_end_cost)\n            cost = mdplib::dead_end_cost;\n        return cost;\n    }\n\n    mlcore::Action* UCTSolver::solve(mlcore::State* s0)\n    {\n        for (int r = 0; r < maxRollouts_; r++) {\n            mlcore::State* tmp = s0;\n            std::vector<int> cumCost(cutoff_ + 1);\n            std::vector<mlcore::State*> statesRoll(cutoff_ + 1);\n            std::vector<mlcore::Action*> actionsRoll(cutoff_ + 1);\n            int maxSteps = 0;\n            for (int i = 1; i <= cutoff_; i++) {\n                if (visited_.insert(tmp).second) {\n                    counterS_[tmp] = 0;\n                    for (mlcore::Action* a : problem_->actions()) {\n                        if (!problem_->applicable(tmp, a))\n                            continue;\n                        counterSA_[tmp][a] = 0;\n                        qvalues_[tmp][a] = qvalue(problem_, tmp, a);\n                    }\n                }\n                maxSteps = i;\n                mlcore::Action* a = pickUCB1Action(tmp);\n                mlcore::State* next = randomSuccessor(problem_, tmp, a);\n                cumCost[i] = cumCost[i - 1] + problem_->cost(tmp, a);\n                statesRoll[i] = tmp;\n                actionsRoll[i] = a;\n                tmp = next;\n                if (problem_->goal(tmp))\n                    break;\n            }\n\n            for (int i = 1; i <= maxSteps; i++) {\n                mlcore::State* s = statesRoll[i];\n                mlcore::Action* a = actionsRoll[i];\n                double newq = counterSA_[s][a]*qvalues_[s][a] + cumCost[maxSteps] - cumCost[i - 1];\n                newq \/= (counterSA_[s][a] + 1);\n                qvalues_[s][a] = newq;\n                counterS_[s]++;\n                counterSA_[s][a]++;\n            }\n        }\n        return pickAction(s0, 0.0);\n    }\n}\n\n<commit_msg>minor changes<commit_after>#include <vector>\n#include <cmath>\n\n#include \"..\/..\/include\/solvers\/Solver.h\"\n#include \"..\/..\/include\/solvers\/UCTSolver.h\"\n\nnamespace mlsolvers\n{\n\nUCTSolver::UCTSolver(\n    mlcore::Problem* problem, double C, int maxRollouts, int cutoff)\n{\n    problem_ = problem;\n    C_ = C;\n    maxRollouts_ = maxRollouts;\n    cutoff_ = cutoff;\n}\n\n\nmlcore::Action* UCTSolver::pickUCB1Action(mlcore::State* s)\n{\n    return pickAction(s, C_);\n}\n\n\nmlcore::Action* UCTSolver::pickAction(mlcore::State* s, double C)\n{\n    double best = mdplib::dead_end_cost + 1;\n    mlcore::Action* bestAction = nullptr;\n    for (std::pair<mlcore::Action*,double> entry : qvalues_[s]) {\n        mlcore::Action* a = entry.first;\n        if (counterSA_[s][a] == 0)\n            return a;\n        double ucb1 = ucb1Cost(s, a, entry.second);\n        if (ucb1 < best) {\n            bestAction = a;\n            best = ucb1;\n        }\n    }\n    return bestAction;\n}\n\n\ndouble UCTSolver::ucb1Cost(mlcore::State* s, mlcore::Action* a, double C)\n{\n    double cost = qvalues_[s][a] - C *\n        std::sqrt(2 * std::log(counterS_[s]) \/ counterSA_[s][a]);\n    if (cost > mdplib::dead_end_cost)\n        cost = mdplib::dead_end_cost;\n    return cost;\n}\n\n\nmlcore::Action* UCTSolver::solve(mlcore::State* s0)\n{\n    for (int r = 0; r < maxRollouts_; r++) {\n        mlcore::State* tmp = s0;\n        std::vector<int> cumCost(cutoff_ + 1);\n        std::vector<mlcore::State*> statesRoll(cutoff_ + 1);\n        std::vector<mlcore::Action*> actionsRoll(cutoff_ + 1);\n        int maxSteps = 0;\n        for (int i = 1; i <= cutoff_; i++) {\n            if (visited_.insert(tmp).second) {\n                counterS_[tmp] = 0;\n                for (mlcore::Action* a : problem_->actions()) {\n                    if (!problem_->applicable(tmp, a))\n                        continue;\n                    counterSA_[tmp][a] = 0;\n                    qvalues_[tmp][a] = qvalue(problem_, tmp, a);\n                }\n            }\n            maxSteps = i;\n            mlcore::Action* a = pickUCB1Action(tmp);\n            mlcore::State* next = randomSuccessor(problem_, tmp, a);\n            cumCost[i] = cumCost[i - 1] + problem_->cost(tmp, a);\n            statesRoll[i] = tmp;\n            actionsRoll[i] = a;\n            tmp = next;\n            if (problem_->goal(tmp))\n                break;\n        }\n\n        for (int i = 1; i <= maxSteps; i++) {\n            mlcore::State* s = statesRoll[i];\n            mlcore::Action* a = actionsRoll[i];\n            double newq = counterSA_[s][a] * qvalues_[s][a] +\n                cumCost[maxSteps] - cumCost[i - 1];\n            newq \/= (counterSA_[s][a] + 1);\n            qvalues_[s][a] = newq;\n            counterS_[s]++;\n            counterSA_[s][a]++;\n        }\n    }\n    return pickAction(s0, 0.0);\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n#include <fstream>\n#include <ostream>\n#include <string>\n#include <vector>\n\n#include <boost\/algorithm\/string.hpp>\n\n#include <llvm\/Support\/raw_os_ostream.h>\n\n#include <libdevcore\/Common.h>\n#include <libdevcore\/CommonIO.h>\n#include <libevmface\/Instruction.h>\n#include <libevmjit\/Compiler.h>\n#include <libevmjit\/ExecutionEngine.h>\n\n\nvoid show_usage()\n{\n    \/\/ FIXME: Use arg[0] as program name?\n    std::cerr << \"usage: evmcc (-b|-c|-d)+ <inputfile.bc>\\n\";\n}\n\n\nint main(int argc, char** argv)\n{\n\n    std::string input_file;\n    bool opt_dissassemble = false;\n    bool opt_show_bytes = false;\n\tbool opt_compile = false;\n\tbool opt_interpret = false;\n\tbool opt_dump_graph = false;\n\tbool opt_unknown = false;\n\n    for (int i = 1; i < argc; i++)\n    {\n        std::string option = argv[i];\n        if (option == \"-b\")\n            opt_show_bytes = true;\n        else if (option == \"-c\")\n            opt_compile = true;\n        else if (option == \"-d\")\n\t\t\topt_dissassemble = true;\n\t\telse if (option == \"-i\")\n\t\t\topt_interpret = true;\n\t\telse if (option == \"-g\")\n\t\t\topt_dump_graph = true;\n\t\telse if (option[0] != '-' && input_file.empty())\n\t\t\tinput_file = option;\n        else\n        {\n            opt_unknown = true;\n            break;\n        }\n    }\n\n    if (opt_unknown ||\n        input_file.empty() ||\n        (!opt_show_bytes && !opt_compile && !opt_dissassemble && !opt_interpret))\n    {\n        show_usage();\n        exit(1);\n    }\n\n    std::ifstream ifs(input_file);\n    if (!ifs.is_open())\n    {\n        std::cerr << \"cannot open file \" << input_file << std::endl;\n        exit(1);\n    }\n\n    std::string src((std::istreambuf_iterator<char>(ifs)),\n\t\t    (std::istreambuf_iterator<char>()));\n\n    boost::algorithm::trim(src);\n\n\tusing namespace dev;\n\n    bytes bytecode = fromHex(src);\n\n    if (opt_show_bytes)\n    {\n        std::cout << memDump(bytecode) << std::endl;\n    }\n\n    if (opt_dissassemble)\n    {\n        std::string assembly = eth::disassemble(bytecode);\n        std::cout << assembly << std::endl;\n    }\n\n    if (opt_compile)\n    {\n    \tauto compiler = eth::jit::Compiler();\n\t\tauto module = compiler.compile({bytecode.data(), bytecode.size()});\n\t\tllvm::raw_os_ostream out(std::cout);\n\t\tmodule->print(out, nullptr);\n\n\t\tif (opt_dump_graph)\n\t\t{\n\t\t\tstd::ofstream ofs(\"blocks.dot\");\n\t\t\tcompiler.dumpBasicBlockGraph(ofs);\n\t\t\tofs.close();\n\t\t\tstd::cout << \"Basic blocks graph written to block.dot\\n\";\n\t\t}\n    }\n\n\tif (opt_interpret)\n\t{\n\t\tauto engine = eth::jit::ExecutionEngine();\n\t\tauto module = eth::jit::Compiler().compile({bytecode.data(), bytecode.size()});\n\t\tmodule->dump();\n\t\tu256 gas = 10000;\n\t\tauto result = engine.run(std::move(module), gas);\n\t\treturn result;\n\t}\n\n    return 0;\n}\n<commit_msg>minor changes in the compiler driver<commit_after>\n#include <iostream>\n#include <fstream>\n#include <ostream>\n#include <string>\n#include <vector>\n\n#include <boost\/algorithm\/string.hpp>\n\n#include <llvm\/Support\/raw_os_ostream.h>\n\n#include <libdevcore\/Common.h>\n#include <libdevcore\/CommonIO.h>\n#include <libevmface\/Instruction.h>\n#include <libevmjit\/Compiler.h>\n#include <libevmjit\/ExecutionEngine.h>\n\n\nvoid show_usage()\n{\n    \/\/ FIXME: Use arg[0] as program name?\n    std::cerr << \"usage: evmcc (-b|-c|-d)+ <inputfile.bc>\\n\";\n}\n\n\nint main(int argc, char** argv)\n{\n\n    std::string input_file;\n    bool opt_dissassemble = false;\n    bool opt_show_bytes = false;\n\tbool opt_compile = false;\n\tbool opt_interpret = false;\n\tbool opt_dump_graph = false;\n\tbool opt_unknown = false;\n\n    for (int i = 1; i < argc; i++)\n    {\n        std::string option = argv[i];\n        if (option == \"-b\")\n            opt_show_bytes = true;\n        else if (option == \"-c\")\n            opt_compile = true;\n        else if (option == \"-d\")\n\t\t\topt_dissassemble = true;\n\t\telse if (option == \"-i\")\n\t\t\topt_interpret = true;\n\t\telse if (option == \"-g\")\n\t\t\topt_dump_graph = true;\n\t\telse if (option[0] != '-' && input_file.empty())\n\t\t\tinput_file = option;\n        else\n        {\n            opt_unknown = true;\n            break;\n        }\n    }\n\n    if (opt_unknown ||\n        input_file.empty() ||\n        (!opt_show_bytes && !opt_compile && !opt_dissassemble && !opt_interpret))\n    {\n        show_usage();\n        exit(1);\n    }\n\n    std::ifstream ifs(input_file);\n    if (!ifs.is_open())\n    {\n        std::cerr << \"cannot open file \" << input_file << std::endl;\n        exit(1);\n    }\n\n    std::string src((std::istreambuf_iterator<char>(ifs)),\n\t\t    (std::istreambuf_iterator<char>()));\n\n    boost::algorithm::trim(src);\n\n\tusing namespace dev;\n\n    bytes bytecode = fromHex(src);\n\n    if (opt_show_bytes)\n    {\n        std::cout << memDump(bytecode) << std::endl;\n    }\n\n    if (opt_dissassemble)\n    {\n        std::string assembly = eth::disassemble(bytecode);\n        std::cout << assembly << std::endl;\n    }\n\n    if (opt_compile || opt_interpret)\n    {\n    \tauto compiler = eth::jit::Compiler();\n\t\tauto module = compiler.compile({bytecode.data(), bytecode.size()});\n\n\t\tmodule->dump();\n\n\t\tif (opt_dump_graph)\n\t\t{\n\t\t\tstd::ofstream ofs(\"blocks.dot\");\n\t\t\tcompiler.dumpBasicBlockGraph(ofs);\n\t\t\tofs.close();\n\t\t\tstd::cout << \"Basic blocks graph written to block.dot\\n\";\n\t\t}\n\n\t\tif (opt_interpret)\n\t\t{\n\t\t\tauto engine = eth::jit::ExecutionEngine();\n\t\t\tu256 gas = 10000;\n\t\t\tauto result = engine.run(std::move(module), gas);\n\t\t\treturn result;\n\t\t}\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n#include <fstream>\n#include <ostream>\n#include <string>\n#include <vector>\n\n#include <boost\/algorithm\/string.hpp>\n\n#include <llvm\/Support\/raw_os_ostream.h>\n\n#include <libdevcore\/Common.h>\n#include <libdevcore\/CommonIO.h>\n#include <libevmface\/Instruction.h>\n#include <libevmjit\/Compiler.h>\n#include <libevmjit\/ExecutionEngine.h>\n\n\nvoid show_usage()\n{\n    \/\/ FIXME: Use arg[0] as program name?\n    std::cerr << \"usage: evmcc (-b|-c|-d)+ <inputfile.bc>\\n\";\n}\n\n\nint main(int argc, char** argv)\n{\n\n    std::string input_file;\n    bool opt_dissassemble = false;\n    bool opt_show_bytes = false;\n\tbool opt_compile = false;\n\tbool opt_interpret = false;\n\tbool opt_dump_graph = false;\n\tbool opt_unknown = false;\n\n    for (int i = 1; i < argc; i++)\n    {\n        std::string option = argv[i];\n        if (option == \"-b\")\n            opt_show_bytes = true;\n        else if (option == \"-c\")\n            opt_compile = true;\n        else if (option == \"-d\")\n\t\t\topt_dissassemble = true;\n\t\telse if (option == \"-i\")\n\t\t\topt_interpret = true;\n\t\telse if (option == \"-g\")\n\t\t\topt_dump_graph = true;\n\t\telse if (option[0] != '-' && input_file.empty())\n\t\t\tinput_file = option;\n        else\n        {\n            opt_unknown = true;\n            break;\n        }\n    }\n\n    if (opt_unknown ||\n        input_file.empty() ||\n        (!opt_show_bytes && !opt_compile && !opt_dissassemble && !opt_interpret))\n    {\n        show_usage();\n        exit(1);\n    }\n\n    std::ifstream ifs(input_file);\n    if (!ifs.is_open())\n    {\n        std::cerr << \"cannot open file \" << input_file << std::endl;\n        exit(1);\n    }\n\n    std::string src((std::istreambuf_iterator<char>(ifs)),\n\t\t    (std::istreambuf_iterator<char>()));\n\n    boost::algorithm::trim(src);\n\n\tusing namespace dev;\n\n    bytes bytecode = fromHex(src);\n\n    if (opt_show_bytes)\n    {\n        std::cout << memDump(bytecode) << std::endl;\n    }\n\n    if (opt_dissassemble)\n    {\n        std::string assembly = eth::disassemble(bytecode);\n        std::cout << assembly << std::endl;\n    }\n\n    if (opt_compile)\n    {\n    \tauto compiler = eth::jit::Compiler();\n\t\tauto module = compiler.compile({bytecode.data(), bytecode.size()});\n\t\tllvm::raw_os_ostream out(std::cout);\n\t\tmodule->print(out, nullptr);\n\n\t\tif (opt_dump_graph)\n\t\t{\n\t\t\tstd::ofstream ofs(\"blocks.dot\");\n\t\t\tcompiler.dumpBasicBlockGraph(ofs);\n\t\t\tofs.close();\n\t\t\tstd::cout << \"Basic blocks graph written to block.dot\\n\";\n\t\t}\n    }\n\n\tif (opt_interpret)\n\t{\n\t\tauto engine = eth::jit::ExecutionEngine();\n\t\tauto module = eth::jit::Compiler().compile({bytecode.data(), bytecode.size()});\n\t\tmodule->dump();\n\t\tu256 gas = 10000;\n\t\tauto result = engine.run(std::move(module), gas);\n\t\treturn result;\n\t}\n\n    return 0;\n}\n<commit_msg>minor changes in the compiler driver<commit_after>\n#include <iostream>\n#include <fstream>\n#include <ostream>\n#include <string>\n#include <vector>\n\n#include <boost\/algorithm\/string.hpp>\n\n#include <llvm\/Support\/raw_os_ostream.h>\n\n#include <libdevcore\/Common.h>\n#include <libdevcore\/CommonIO.h>\n#include <libevmface\/Instruction.h>\n#include <libevmjit\/Compiler.h>\n#include <libevmjit\/ExecutionEngine.h>\n\n\nvoid show_usage()\n{\n    \/\/ FIXME: Use arg[0] as program name?\n    std::cerr << \"usage: evmcc (-b|-c|-d)+ <inputfile.bc>\\n\";\n}\n\n\nint main(int argc, char** argv)\n{\n\n    std::string input_file;\n    bool opt_dissassemble = false;\n    bool opt_show_bytes = false;\n\tbool opt_compile = false;\n\tbool opt_interpret = false;\n\tbool opt_dump_graph = false;\n\tbool opt_unknown = false;\n\n    for (int i = 1; i < argc; i++)\n    {\n        std::string option = argv[i];\n        if (option == \"-b\")\n            opt_show_bytes = true;\n        else if (option == \"-c\")\n            opt_compile = true;\n        else if (option == \"-d\")\n\t\t\topt_dissassemble = true;\n\t\telse if (option == \"-i\")\n\t\t\topt_interpret = true;\n\t\telse if (option == \"-g\")\n\t\t\topt_dump_graph = true;\n\t\telse if (option[0] != '-' && input_file.empty())\n\t\t\tinput_file = option;\n        else\n        {\n            opt_unknown = true;\n            break;\n        }\n    }\n\n    if (opt_unknown ||\n        input_file.empty() ||\n        (!opt_show_bytes && !opt_compile && !opt_dissassemble && !opt_interpret))\n    {\n        show_usage();\n        exit(1);\n    }\n\n    std::ifstream ifs(input_file);\n    if (!ifs.is_open())\n    {\n        std::cerr << \"cannot open file \" << input_file << std::endl;\n        exit(1);\n    }\n\n    std::string src((std::istreambuf_iterator<char>(ifs)),\n\t\t    (std::istreambuf_iterator<char>()));\n\n    boost::algorithm::trim(src);\n\n\tusing namespace dev;\n\n    bytes bytecode = fromHex(src);\n\n    if (opt_show_bytes)\n    {\n        std::cout << memDump(bytecode) << std::endl;\n    }\n\n    if (opt_dissassemble)\n    {\n        std::string assembly = eth::disassemble(bytecode);\n        std::cout << assembly << std::endl;\n    }\n\n    if (opt_compile || opt_interpret)\n    {\n    \tauto compiler = eth::jit::Compiler();\n\t\tauto module = compiler.compile({bytecode.data(), bytecode.size()});\n\n\t\tmodule->dump();\n\n\t\tif (opt_dump_graph)\n\t\t{\n\t\t\tstd::ofstream ofs(\"blocks.dot\");\n\t\t\tcompiler.dumpBasicBlockGraph(ofs);\n\t\t\tofs.close();\n\t\t\tstd::cout << \"Basic blocks graph written to block.dot\\n\";\n\t\t}\n\n\t\tif (opt_interpret)\n\t\t{\n\t\t\tauto engine = eth::jit::ExecutionEngine();\n\t\t\tu256 gas = 10000;\n\t\t\tauto result = engine.run(std::move(module), gas);\n\t\t\treturn result;\n\t\t}\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of TelepathyQt4\n *\n * Copyright (C) 2008 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * Copyright (C) 2008 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\/ManagerFile>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QHash>\n#include <QtCore\/QString>\n#include <QtCore\/QStringList>\n#include <QtDBus\/QDBusVariant>\n\n#include <TelepathyQt4\/KeyFile>\n#include <TelepathyQt4\/Constants>\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\nnamespace Tp\n{\n\nstruct ManagerFile::Private\n{\n    QString cmName;\n    KeyFile keyFile;\n    QHash<QString, ParamSpecList> protocolParams;\n\n    Private(const QString &cnName);\n\n    void init();\n    bool parse(const QString &fileName);\n    bool isValid() const;\n\n    bool hasParameter(const QString &protocol, const QString &paramName) const;\n    ParamSpec *getParameter(const QString &protocol, const QString &paramName);\n    QStringList protocols() const;\n    ParamSpecList parameters(const QString &protocol) const;\n\n    QVariant valueForKey(const QString &param, const QString &signature);\n};\n\nManagerFile::Private::Private(const QString &cmName)\n    : cmName(cmName)\n{\n    init();\n}\n\nvoid ManagerFile::Private::init()\n{\n    \/\/ TODO: should we cache the configDirs anywhere?\n    QStringList configDirs;\n\n    QString xdgDataHome = QString::fromLocal8Bit(qgetenv(\"XDG_DATA_HOME\"));\n    if (xdgDataHome.isEmpty()) {\n        configDirs << QDir::homePath() + \"\/.local\/share\/data\/telepathy\/managers\/\";\n    }\n    else {\n        configDirs << xdgDataHome + QLatin1String(\"\/telepathy\/managers\/\");\n    }\n\n    QString xdgDataDirsEnv = QString::fromLocal8Bit(qgetenv(\"XDG_DATA_DIRS\"));\n    if (xdgDataDirsEnv.isEmpty()) {\n        configDirs << \"\/usr\/local\/share\/telepathy\/managers\/\";\n        configDirs << \"\/usr\/share\/telepathy\/managers\/\";\n    }\n    else {\n        QStringList xdgDataDirs = xdgDataDirsEnv.split(QLatin1Char(':'));\n        Q_FOREACH (const QString xdgDataDir, xdgDataDirs) {\n            configDirs << xdgDataDir + QLatin1String(\"\/telepathy\/managers\/\");\n        }\n    }\n\n    Q_FOREACH (const QString configDir, configDirs) {\n        QString fileName = configDir + cmName + QLatin1String(\".manager\");\n        if (QFile::exists(fileName)) {\n            debug() << \"parsing manager file\" << fileName;\n            if (!parse(fileName)) {\n                warning() << \"error parsing manager file\" << fileName;\n                continue;\n            }\n            return;\n        }\n    }\n}\n\nbool ManagerFile::Private::parse(const QString &fileName)\n{\n    keyFile.setFileName(fileName);\n    if (keyFile.status() != KeyFile::NoError) {\n        return false;\n    }\n\n    \/* read supported protocols and parameters *\/\n    QString protocol;\n    QStringList groups = keyFile.allGroups();\n    Q_FOREACH (const QString group, groups) {\n        if (group.startsWith(\"Protocol \")) {\n            protocol = group.right(group.length() - 9);\n            keyFile.setGroup(group);\n\n            ParamSpecList paramSpecList;\n            QString param;\n            QStringList params = keyFile.keys();\n            Q_FOREACH (param, params) {\n                ParamSpec spec;\n                spec.flags = 0;\n                if (param.startsWith(\"param-\")) {\n                    spec.name = param.right(param.length() - 6);\n\n                    if (spec.name.endsWith(\"password\")) {\n                        spec.flags |= ConnMgrParamFlagSecret;\n                    }\n\n                    QStringList values = keyFile.value(param).split(QChar(' '));\n\n                    spec.signature = values[0];\n                    if (values.contains(\"secret\")) {\n                        spec.flags |= ConnMgrParamFlagSecret;\n                    }\n                    if (values.contains(\"dbus-property\")) {\n                        spec.flags |= ConnMgrParamFlagDBusProperty;\n                    }\n                    if (values.contains(\"required\")) {\n                        spec.flags |= ConnMgrParamFlagRequired;\n                    }\n                    if (values.contains(\"register\")) {\n                        spec.flags |= ConnMgrParamFlagRegister;\n                    }\n\n                    paramSpecList.append(spec);\n                }\n            }\n\n            protocolParams[protocol] = paramSpecList;\n\n            \/* now that we have all param-* created, let's find their default values *\/\n            Q_FOREACH (param, params) {\n                if (param.startsWith(\"default-\")) {\n                    QString paramName = param.right(param.length() - 8);\n\n                    if (!hasParameter(protocol, paramName)) {\n                        warning() << \"param\" << paramName\n                                  << \"has default value set, but not a definition\";\n                        continue;\n                    }\n\n                    ParamSpec *spec = getParameter(protocol, paramName);\n\n                    spec->flags |= ConnMgrParamFlagHasDefault;\n\n                    \/* map based on the param dbus signature, otherwise use\n                     * QString *\/\n                    QVariant value = valueForKey(param, spec->signature);\n                    spec->defaultValue = QDBusVariant(value);\n                }\n            }\n        }\n    }\n\n    return true;\n}\n\nbool ManagerFile::Private::isValid() const\n{\n    return (keyFile.status() == KeyFile::NoError);\n}\n\nbool ManagerFile::Private::hasParameter(const QString &protocol,\n                                        const QString &paramName) const\n{\n    ParamSpecList paramSpecList = protocolParams[protocol];\n    Q_FOREACH (ParamSpec paramSpec, paramSpecList) {\n        if (paramSpec.name == paramName) {\n            return true;\n        }\n    }\n    return false;\n}\n\nParamSpec *ManagerFile::Private::getParameter(const QString &protocol,\n                                              const QString &paramName)\n{\n    ParamSpecList &paramSpecList = protocolParams[protocol];\n    for (int i = 0; i < paramSpecList.size(); ++i) {\n        ParamSpec &paramSpec = paramSpecList[i];\n        if (paramSpec.name == paramName) {\n            return &paramSpec;\n        }\n    }\n    return NULL;\n}\n\nQStringList ManagerFile::Private::protocols() const\n{\n    return protocolParams.keys();\n}\n\nParamSpecList ManagerFile::Private::parameters(const QString &protocol) const\n{\n    return protocolParams.value(protocol);\n}\n\nQVariant ManagerFile::Private::valueForKey(const QString &param,\n                                           const QString &signature)\n{\n    QVariant::Type type = ManagerFile::variantTypeFromDBusSignature(signature);\n\n    if (type == QVariant::Invalid) {\n        return QVariant(type);\n    }\n\n    switch (type) {\n        case QVariant::Bool:\n            {\n                QString value = keyFile.value(param);\n                if (value.toLower() == \"true\" || value == \"1\") {\n                    return QVariant(true);\n                }\n                else {\n                    return QVariant(false);\n                }\n                break;\n            }\n        case QVariant::Int:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toInt());\n            }\n        case QVariant::UInt:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toUInt());\n            }\n        case QVariant::LongLong:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toLongLong());\n            }\n        case QVariant::ULongLong:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toULongLong());\n            }\n        case QVariant::Double:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toDouble());\n            }\n        case QVariant::StringList:\n            {\n                QStringList value = keyFile.valueAsStringList(param);\n                return QVariant(value);\n            }\n        default:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value);\n            }\n    }\n}\n\n\n\/**\n * \\class ManagerFile\n * \\headerfile <TelepathyQt4\/manager-file.h> <TelepathyQt4\/ManagerFile>\n *\n * The ManagerFile class provides an easy way to read telepathy manager files\n * according to http:\/\/telepathy.freedesktop.org\/spec.html.\n *\/\n\n\/**\n * Create a ManagerFile object used to read .manager compliant files.\n *\n * \\param cmName Name of the connection manager to read the file for.\n *\/\nManagerFile::ManagerFile(const QString &cmName)\n    : mPriv(new Private(cmName))\n{\n}\n\n\/**\n * Class destructor.\n *\/\nManagerFile::~ManagerFile()\n{\n    delete mPriv;\n}\n\n\/**\n * Check whether or not a ManagerFile object is valid. If the file for the\n * specified connection manager cannot be found it will be considered invalid.\n *\n * \\return true if valid, false otherwise.\n *\/\nbool ManagerFile::isValid() const\n{\n    return mPriv->isValid();\n}\n\n\/**\n * Return a list of all protocols defined in the manager file.\n *\n * \\return List of all protocols defined in the file.\n *\/\nQStringList ManagerFile::protocols() const\n{\n    return mPriv->protocols();\n}\n\n\/**\n * Return a list of all protocols defined in the manager file.\n *\n * \\param protocol Name of the protocol to look for.\n * \\return List of ParamSpec of a specific protocol defined in the file, or an\n *         empty list if the protocol is not defined.\n *\/\nParamSpecList ManagerFile::parameters(const QString &protocol) const\n{\n    return mPriv->parameters(protocol);\n}\n\nQVariant::Type ManagerFile::variantTypeFromDBusSignature(const QString &signature)\n{\n    QVariant::Type type;\n    if (signature == \"b\")\n        type = QVariant::Bool;\n    else if (signature == \"n\" || signature == \"i\")\n        type = QVariant::Int;\n    else if (signature == \"q\" || signature == \"u\")\n        type = QVariant::UInt;\n    else if (signature == \"x\")\n        type = QVariant::LongLong;\n    else if (signature == \"t\")\n        type = QVariant::ULongLong;\n    else if (signature == \"d\")\n        type = QVariant::Double;\n    else if (signature == \"as\")\n        type = QVariant::StringList;\n    else if (signature == \"s\" || signature == \"o\")\n        type = QVariant::String;\n    else\n        type = QVariant::Invalid;\n\n    return type;\n}\n\n} \/\/ Tp\n<commit_msg>manager-file: Fixed build with some gcc versions.<commit_after>\/*\n * This file is part of TelepathyQt4\n *\n * Copyright (C) 2008 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * Copyright (C) 2008 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\/ManagerFile>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QHash>\n#include <QtCore\/QString>\n#include <QtCore\/QStringList>\n#include <QtDBus\/QDBusVariant>\n\n#include <TelepathyQt4\/KeyFile>\n#include <TelepathyQt4\/Constants>\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\nnamespace Tp\n{\n\nstruct ManagerFile::Private\n{\n    QString cmName;\n    KeyFile keyFile;\n    QHash<QString, ParamSpecList> protocolParams;\n\n    Private(const QString &cnName);\n\n    void init();\n    bool parse(const QString &fileName);\n    bool isValid() const;\n\n    bool hasParameter(const QString &protocol, const QString &paramName) const;\n    ParamSpec *getParameter(const QString &protocol, const QString &paramName);\n    QStringList protocols() const;\n    ParamSpecList parameters(const QString &protocol) const;\n\n    QVariant valueForKey(const QString &param, const QString &signature);\n};\n\nManagerFile::Private::Private(const QString &cmName)\n    : cmName(cmName)\n{\n    init();\n}\n\nvoid ManagerFile::Private::init()\n{\n    \/\/ TODO: should we cache the configDirs anywhere?\n    QStringList configDirs;\n\n    QString xdgDataHome = QString::fromLocal8Bit(qgetenv(\"XDG_DATA_HOME\"));\n    if (xdgDataHome.isEmpty()) {\n        configDirs << QDir::homePath() + \"\/.local\/share\/data\/telepathy\/managers\/\";\n    }\n    else {\n        configDirs << xdgDataHome + QLatin1String(\"\/telepathy\/managers\/\");\n    }\n\n    QString xdgDataDirsEnv = QString::fromLocal8Bit(qgetenv(\"XDG_DATA_DIRS\"));\n    if (xdgDataDirsEnv.isEmpty()) {\n        configDirs << \"\/usr\/local\/share\/telepathy\/managers\/\";\n        configDirs << \"\/usr\/share\/telepathy\/managers\/\";\n    }\n    else {\n        QStringList xdgDataDirs = xdgDataDirsEnv.split(QLatin1Char(':'));\n        Q_FOREACH (const QString xdgDataDir, xdgDataDirs) {\n            configDirs << xdgDataDir + QLatin1String(\"\/telepathy\/managers\/\");\n        }\n    }\n\n    Q_FOREACH (const QString configDir, configDirs) {\n        QString fileName = configDir + cmName + QLatin1String(\".manager\");\n        if (QFile::exists(fileName)) {\n            debug() << \"parsing manager file\" << fileName;\n            if (!parse(fileName)) {\n                warning() << \"error parsing manager file\" << fileName;\n                continue;\n            }\n            return;\n        }\n    }\n}\n\nbool ManagerFile::Private::parse(const QString &fileName)\n{\n    keyFile.setFileName(fileName);\n    if (keyFile.status() != KeyFile::NoError) {\n        return false;\n    }\n\n    \/* read supported protocols and parameters *\/\n    QString protocol;\n    QStringList groups = keyFile.allGroups();\n    Q_FOREACH (const QString group, groups) {\n        if (group.startsWith(\"Protocol \")) {\n            protocol = group.right(group.length() - 9);\n            keyFile.setGroup(group);\n\n            ParamSpecList paramSpecList;\n            QString param;\n            QStringList params = keyFile.keys();\n            Q_FOREACH (param, params) {\n                ParamSpec spec;\n                spec.flags = 0;\n                if (param.startsWith(\"param-\")) {\n                    spec.name = param.right(param.length() - 6);\n\n                    if (spec.name.endsWith(\"password\")) {\n                        spec.flags |= ConnMgrParamFlagSecret;\n                    }\n\n                    QStringList values = keyFile.value(param).split(QChar(' '));\n\n                    spec.signature = values[0];\n                    if (values.contains(\"secret\")) {\n                        spec.flags |= ConnMgrParamFlagSecret;\n                    }\n                    if (values.contains(\"dbus-property\")) {\n                        spec.flags |= ConnMgrParamFlagDBusProperty;\n                    }\n                    if (values.contains(\"required\")) {\n                        spec.flags |= ConnMgrParamFlagRequired;\n                    }\n                    if (values.contains(\"register\")) {\n                        spec.flags |= ConnMgrParamFlagRegister;\n                    }\n\n                    paramSpecList.append(spec);\n                }\n            }\n\n            protocolParams[protocol] = paramSpecList;\n\n            \/* now that we have all param-* created, let's find their default values *\/\n            Q_FOREACH (param, params) {\n                if (param.startsWith(\"default-\")) {\n                    QString paramName = param.right(param.length() - 8);\n\n                    if (!hasParameter(protocol, paramName)) {\n                        warning() << \"param\" << paramName\n                                  << \"has default value set, but not a definition\";\n                        continue;\n                    }\n\n                    ParamSpec *spec = getParameter(protocol, paramName);\n\n                    spec->flags |= ConnMgrParamFlagHasDefault;\n\n                    \/* map based on the param dbus signature, otherwise use\n                     * QString *\/\n                    QVariant value = valueForKey(param, spec->signature);\n                    spec->defaultValue = QDBusVariant(value);\n                }\n            }\n        }\n    }\n\n    return true;\n}\n\nbool ManagerFile::Private::isValid() const\n{\n    return (keyFile.status() == KeyFile::NoError);\n}\n\nbool ManagerFile::Private::hasParameter(const QString &protocol,\n                                        const QString &paramName) const\n{\n    ParamSpecList paramSpecList = protocolParams[protocol];\n    Q_FOREACH (ParamSpec paramSpec, paramSpecList) {\n        if (paramSpec.name == paramName) {\n            return true;\n        }\n    }\n    return false;\n}\n\nParamSpec *ManagerFile::Private::getParameter(const QString &protocol,\n                                              const QString &paramName)\n{\n    ParamSpecList &paramSpecList = protocolParams[protocol];\n    for (int i = 0; i < paramSpecList.size(); ++i) {\n        ParamSpec &paramSpec = paramSpecList[i];\n        if (paramSpec.name == paramName) {\n            return &paramSpec;\n        }\n    }\n    return NULL;\n}\n\nQStringList ManagerFile::Private::protocols() const\n{\n    return protocolParams.keys();\n}\n\nParamSpecList ManagerFile::Private::parameters(const QString &protocol) const\n{\n    return protocolParams.value(protocol);\n}\n\nQVariant ManagerFile::Private::valueForKey(const QString &param,\n                                           const QString &signature)\n{\n    QVariant::Type type = ManagerFile::variantTypeFromDBusSignature(signature);\n\n    if (type == QVariant::Invalid) {\n        return QVariant(type);\n    }\n\n    switch (type) {\n        case QVariant::Bool:\n            {\n                QString value = keyFile.value(param);\n                if (value.toLower() == \"true\" || value == \"1\") {\n                    return QVariant(true);\n                }\n                else {\n                    return QVariant(false);\n                }\n                break;\n            }\n        case QVariant::Int:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toInt());\n            }\n        case QVariant::UInt:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toUInt());\n            }\n        case QVariant::LongLong:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toLongLong());\n            }\n        case QVariant::ULongLong:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toULongLong());\n            }\n        case QVariant::Double:\n            {\n                QString value = keyFile.value(param);\n                return QVariant(value.toDouble());\n            }\n        case QVariant::StringList:\n            {\n                QStringList value = keyFile.valueAsStringList(param);\n                return QVariant(value);\n            }\n        default:\n            break;\n    }\n    QString value = keyFile.value(param);\n    return QVariant(value);\n}\n\n\n\/**\n * \\class ManagerFile\n * \\headerfile <TelepathyQt4\/manager-file.h> <TelepathyQt4\/ManagerFile>\n *\n * The ManagerFile class provides an easy way to read telepathy manager files\n * according to http:\/\/telepathy.freedesktop.org\/spec.html.\n *\/\n\n\/**\n * Create a ManagerFile object used to read .manager compliant files.\n *\n * \\param cmName Name of the connection manager to read the file for.\n *\/\nManagerFile::ManagerFile(const QString &cmName)\n    : mPriv(new Private(cmName))\n{\n}\n\n\/**\n * Class destructor.\n *\/\nManagerFile::~ManagerFile()\n{\n    delete mPriv;\n}\n\n\/**\n * Check whether or not a ManagerFile object is valid. If the file for the\n * specified connection manager cannot be found it will be considered invalid.\n *\n * \\return true if valid, false otherwise.\n *\/\nbool ManagerFile::isValid() const\n{\n    return mPriv->isValid();\n}\n\n\/**\n * Return a list of all protocols defined in the manager file.\n *\n * \\return List of all protocols defined in the file.\n *\/\nQStringList ManagerFile::protocols() const\n{\n    return mPriv->protocols();\n}\n\n\/**\n * Return a list of all protocols defined in the manager file.\n *\n * \\param protocol Name of the protocol to look for.\n * \\return List of ParamSpec of a specific protocol defined in the file, or an\n *         empty list if the protocol is not defined.\n *\/\nParamSpecList ManagerFile::parameters(const QString &protocol) const\n{\n    return mPriv->parameters(protocol);\n}\n\nQVariant::Type ManagerFile::variantTypeFromDBusSignature(const QString &signature)\n{\n    QVariant::Type type;\n    if (signature == \"b\")\n        type = QVariant::Bool;\n    else if (signature == \"n\" || signature == \"i\")\n        type = QVariant::Int;\n    else if (signature == \"q\" || signature == \"u\")\n        type = QVariant::UInt;\n    else if (signature == \"x\")\n        type = QVariant::LongLong;\n    else if (signature == \"t\")\n        type = QVariant::ULongLong;\n    else if (signature == \"d\")\n        type = QVariant::Double;\n    else if (signature == \"as\")\n        type = QVariant::StringList;\n    else if (signature == \"s\" || signature == \"o\")\n        type = QVariant::String;\n    else\n        type = QVariant::Invalid;\n\n    return type;\n}\n\n} \/\/ Tp\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright © 2016 by Donald King <chronos@chronos-tachyon.net>\n\/\/ Available under the MIT License. See LICENSE for details.\n\n#include \"event\/poller.h\"\n\n#include <sys\/epoll.h>\n#include <unistd.h>\n\n#include \"base\/logging.h\"\n#include \"base\/util.h\"\n\nstatic uint32_t epoll_mask(event::Set set) noexcept {\n  uint32_t result = EPOLLET;\n  if (set.readable()) result |= EPOLLIN | EPOLLRDHUP;\n  if (set.writable()) result |= EPOLLOUT;\n  if (set.priority()) result |= EPOLLPRI;\n  return result;\n}\n\nstatic event::Set epoll_unmask(uint32_t bits) noexcept {\n  event::Set set;\n  set.set_readable(bits & (EPOLLIN | EPOLLRDHUP));\n  set.set_writable(bits & EPOLLOUT);\n  set.set_priority(bits & EPOLLPRI);\n  set.set_hangup(bits & EPOLLHUP);\n  set.set_error(bits & EPOLLERR);\n  return set;\n}\n\nnamespace event {\n\nnamespace {\n\nclass EPollPoller : public Poller {\n public:\n  explicit EPollPoller(int epoll_fd) noexcept : epoll_fd_(epoll_fd) {}\n  ~EPollPoller() noexcept override { ::close(epoll_fd_); }\n\n  PollerType type() const noexcept override { return PollerType::epoll_poller; }\n\n  base::Result add(base::FD fd, base::token_t t, Set set) override {\n    epoll_event ev;\n    ::bzero(&ev, sizeof(ev));\n    ev.events = epoll_mask(set);\n    ev.data.u64 = uint64_t(t);\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, pair.first, &ev);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result modify(base::FD fd, base::token_t t, Set set) override {\n    epoll_event ev;\n    ::bzero(&ev, sizeof(ev));\n    ev.events = epoll_mask(set);\n    ev.data.u64 = uint64_t(t);\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_MOD, pair.first, &ev);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result remove(base::FD fd) override {\n    epoll_event dummy;\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_DEL, pair.first, &dummy);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result wait(EventVec* out, int timeout_ms) const override {\n    base::Result result;\n    std::array<epoll_event, 8> ev = {};\n    std::size_t num = ev.size();\n    while (num >= ev.size()) {\n      ev.fill(epoll_event());\n      int n = ::epoll_wait(epoll_fd_, ev.data(), ev.size(), timeout_ms);\n      if (n < 0) {\n        int err_no = errno;\n        if (err_no == EINTR) break;\n        result = base::Result::from_errno(err_no, \"epoll_wait(2)\");\n        break;\n      }\n      num = n;\n      if (num > ev.size()) n = ev.size();\n      for (std::size_t i = 0; i < num; ++i) {\n        Set set = epoll_unmask(ev[i].events);\n        auto t = base::token_t(ev[i].data.u64);\n        out->emplace_back(t, set);\n      }\n      timeout_ms = 0;\n    }\n    return result;\n  }\n\n private:\n  const int epoll_fd_;\n};\n\nbase::Result new_epoll_poller(PollerPtr* out, const PollerOptions& opts) {\n  int fd = ::epoll_create1(EPOLL_CLOEXEC);\n  if (fd == -1) {\n    int err_no = errno;\n    return base::Result::from_errno(err_no, \"epoll_create1(2)\");\n  }\n  *out = std::make_shared<EPollPoller>(fd);\n  return base::Result();\n}\n\n}  \/\/ anonymous namespace\n\nbase::Result new_poller(PollerPtr* out, const PollerOptions& opts) {\n  DCHECK_NOTNULL(out)->reset();\n  auto type = opts.type();\n  switch (type) {\n    case PollerType::unspecified:\n    case PollerType::epoll_poller:\n      return new_epoll_poller(out, opts);\n\n    default:\n      return base::Result::not_implemented();\n  }\n}\n\n}  \/\/ namespace event\n<commit_msg>Implement poll(2) polling.<commit_after>\/\/ Copyright © 2016 by Donald King <chronos@chronos-tachyon.net>\n\/\/ Available under the MIT License. See LICENSE for details.\n\n#include \"event\/poller.h\"\n\n#include <poll.h>\n#include <sys\/epoll.h>\n#include <unistd.h>\n\n#include \"base\/logging.h\"\n#include \"base\/util.h\"\n\nstatic short poll_mask(event::Set set) noexcept {\n  short result = 0;\n  if (set.readable()) result |= POLLIN | POLLRDHUP;\n  if (set.writable()) result |= POLLOUT;\n  if (set.priority()) result |= POLLPRI;\n  return result;\n}\n\nstatic event::Set poll_unmask(short bits) noexcept {\n  event::Set set;\n  set.set_readable(bits & (POLLIN | POLLRDHUP));\n  set.set_writable(bits & POLLOUT);\n  set.set_priority(bits & POLLPRI);\n  set.set_hangup(bits & POLLHUP);\n  set.set_error(bits & POLLERR);\n  return set;\n}\n\nstatic uint32_t epoll_mask(event::Set set) noexcept {\n  uint32_t result = EPOLLET;\n  if (set.readable()) result |= EPOLLIN | EPOLLRDHUP;\n  if (set.writable()) result |= EPOLLOUT;\n  if (set.priority()) result |= EPOLLPRI;\n  return result;\n}\n\nstatic event::Set epoll_unmask(uint32_t bits) noexcept {\n  event::Set set;\n  set.set_readable(bits & (EPOLLIN | EPOLLRDHUP));\n  set.set_writable(bits & EPOLLOUT);\n  set.set_priority(bits & EPOLLPRI);\n  set.set_hangup(bits & EPOLLHUP);\n  set.set_error(bits & EPOLLERR);\n  return set;\n}\n\nnamespace event {\n\nnamespace {\n\nclass PollPoller : public Poller {\n public:\n  PollPoller() = default;\n\n  PollerType type() const noexcept override { return PollerType::poll_poller; }\n\n  base::Result add(base::FD fd, base::token_t t, Set set) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    map_[fdpair.first] = Item(std::move(fd), t, set);\n    return base::Result();\n  }\n\n  base::Result modify(base::FD fd, base::token_t t, Set set) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    map_[fdpair.first] = Item(std::move(fd), t, set);\n    return base::Result();\n  }\n\n  base::Result remove(base::FD fd) override {\n    auto lock = base::acquire_lock(mu_);\n    auto fdpair = fd->acquire_fd();\n    map_.erase(fdpair.first);\n    return base::Result();\n  }\n\n  base::Result wait(EventVec* out, int timeout_ms) const override {\n    auto lock = base::acquire_lock(mu_);\n    const std::size_t n = map_.size();\n\n    std::vector<Activation> acts;\n    acts.reserve(n);\n    for (const auto& pair : map_) {\n      const auto& item = pair.second;\n      int fdnum;\n      base::RLock rlock;\n      std::tie(fdnum, rlock) = item.filedesc->acquire_fd();\n      acts.emplace_back(std::move(rlock), fdnum, item.token, item.set);\n    }\n\n    std::vector<struct pollfd> pfds;\n    pfds.resize(n);\n    for (std::size_t i = 0; i < n; ++i) {\n      auto& act = acts[i];\n      auto& pfd = pfds[i];\n      ::bzero(&pfd, sizeof(pfd));\n      pfd.fd = act.fdnum;\n      pfd.events = poll_mask(act.set);\n      pfd.revents = 0;\n    }\n\n    int rc = ::poll(pfds.data(), pfds.size(), timeout_ms);\n    if (rc < 0) {\n      int err_no = errno;\n      if (err_no == EINTR) return base::Result();\n      return base::Result::from_errno(err_no, \"poll(2)\");\n    }\n    if (rc > 0) {\n      for (std::size_t i = 0; i < n; ++i) {\n        auto& act = acts[i];\n        auto& pfd = pfds[i];\n        if (pfd.revents != 0) {\n          Set set = poll_unmask(pfd.revents);\n          out->emplace_back(act.token, set);\n        }\n      }\n    }\n    return base::Result();\n  }\n\n private:\n  struct Item {\n    base::FD filedesc;\n    base::token_t token;\n    Set set;\n\n    Item() noexcept = default;\n    Item(base::FD fd, base::token_t t, Set s) noexcept\n        : filedesc(std::move(fd)),\n          token(t),\n          set(s) {}\n  };\n\n  struct Activation {\n    base::RLock lock;\n    int fdnum;\n    base::token_t token;\n    Set set;\n\n    Activation(base::RLock lk, int n, base::token_t t, Set s) noexcept\n        : lock(std::move(lk)),\n          fdnum(n),\n          token(t),\n          set(s) {}\n  };\n\n  mutable std::mutex mu_;\n  std::map<int, Item> map_;\n};\n\nclass EPollPoller : public Poller {\n public:\n  explicit EPollPoller(int epoll_fd) noexcept : epoll_fd_(epoll_fd) {}\n  ~EPollPoller() noexcept override { ::close(epoll_fd_); }\n\n  PollerType type() const noexcept override { return PollerType::epoll_poller; }\n\n  base::Result add(base::FD fd, base::token_t t, Set set) override {\n    epoll_event ev;\n    ::bzero(&ev, sizeof(ev));\n    ev.events = epoll_mask(set);\n    ev.data.u64 = uint64_t(t);\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, pair.first, &ev);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result modify(base::FD fd, base::token_t t, Set set) override {\n    epoll_event ev;\n    ::bzero(&ev, sizeof(ev));\n    ev.events = epoll_mask(set);\n    ev.data.u64 = uint64_t(t);\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_MOD, pair.first, &ev);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result remove(base::FD fd) override {\n    epoll_event dummy;\n    auto pair = DCHECK_NOTNULL(fd)->acquire_fd();\n    int rc = ::epoll_ctl(epoll_fd_, EPOLL_CTL_DEL, pair.first, &dummy);\n    if (rc != 0) {\n      int err_no = errno;\n      return base::Result::from_errno(err_no, \"epoll_ctl(2)\");\n    }\n    return base::Result();\n  }\n\n  base::Result wait(EventVec* out, int timeout_ms) const override {\n    base::Result result;\n    std::array<epoll_event, 8> ev = {};\n    std::size_t num = ev.size();\n    while (num >= ev.size()) {\n      ev.fill(epoll_event());\n      int n = ::epoll_wait(epoll_fd_, ev.data(), ev.size(), timeout_ms);\n      if (n < 0) {\n        int err_no = errno;\n        if (err_no == EINTR) break;\n        result = base::Result::from_errno(err_no, \"epoll_wait(2)\");\n        break;\n      }\n      num = n;\n      if (num > ev.size()) n = ev.size();\n      for (std::size_t i = 0; i < num; ++i) {\n        Set set = epoll_unmask(ev[i].events);\n        auto t = base::token_t(ev[i].data.u64);\n        out->emplace_back(t, set);\n      }\n      timeout_ms = 0;\n    }\n    return result;\n  }\n\n private:\n  const int epoll_fd_;\n};\n\nbase::Result new_poll_poller(PollerPtr* out, const PollerOptions& opts) {\n  *out = std::make_shared<PollPoller>();\n  return base::Result();\n}\n\nbase::Result new_epoll_poller(PollerPtr* out, const PollerOptions& opts) {\n  int fd = ::epoll_create1(EPOLL_CLOEXEC);\n  if (fd == -1) {\n    int err_no = errno;\n    return base::Result::from_errno(err_no, \"epoll_create1(2)\");\n  }\n  *out = std::make_shared<EPollPoller>(fd);\n  return base::Result();\n}\n\n}  \/\/ anonymous namespace\n\nbase::Result new_poller(PollerPtr* out, const PollerOptions& opts) {\n  DCHECK_NOTNULL(out)->reset();\n  auto type = opts.type();\n  switch (type) {\n    case PollerType::poll_poller:\n      return new_poll_poller(out, opts);\n\n    case PollerType::unspecified:\n    case PollerType::epoll_poller:\n      return new_epoll_poller(out, opts);\n\n    default:\n      return base::Result::not_implemented();\n  }\n}\n\n}  \/\/ namespace event\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright © 2010, 2011, 2012 Vladimír Vondruš <mosra@centrum.cz>\n\n    This file is part of Magnum.\n\n    Magnum 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    Magnum is distributed in the hope that it 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*\/\n\n#include \"CubeMapExample.h\"\n\n#include <PluginManager\/PluginManager.h>\n#include <Math\/Constants.h>\n#include <AbstractShaderProgram.h>\n#include <DefaultFramebuffer.h>\n#include <IndexedMesh.h>\n#include <Renderer.h>\n#include <Texture.h>\n#include <SceneGraph\/Camera3D.h>\n#include <Trade\/AbstractImporter.h>\n\n#include \"CubeMap.h\"\n#include \"Reflector.h\"\n#include \"configure.h\"\n\nusing namespace Corrade::PluginManager;\n\nnamespace Magnum { namespace Examples {\n\nCubeMapExample::CubeMapExample(int& argc, char** argv): GlutApplication(argc, argv, \"Cube map example\") {\n    Renderer::setFeature(Renderer::Feature::DepthTest, true);\n    Renderer::setFeature(Renderer::Feature::FaceCulling, true);\n\n    \/* Set up perspective camera *\/\n    (cameraObject = new Object3D(&scene))\n        ->translate(Vector3::zAxis(3.0f));\n    (camera = new SceneGraph::Camera3D<>(cameraObject))\n        ->setAspectRatioPolicy(SceneGraph::AspectRatioPolicy::Extend)\n        ->setPerspective(deg(55.0f), 0.001f, 100.0f);\n\n    \/* Load TGA importer plugin *\/\n    PluginManager<Trade::AbstractImporter> manager(MAGNUM_PLUGINS_IMPORTER_DIR);\n    Trade::AbstractImporter* importer;\n    if(manager.load(\"TgaImporter\") != AbstractPluginManager::LoadOk || !(importer = manager.instance(\"TgaImporter\"))) {\n        Error() << \"Cannot load TGAImporter plugin from\" << manager.pluginDirectory();\n        std::exit(1);\n    }\n    resourceManager.set<Trade::AbstractImporter>(\"tga-importer\", importer, ResourceDataState::Final, ResourcePolicy::Manual);\n\n    \/* Add objects to scene *\/\n    (new CubeMap(argc == 2 ? argv[1] : \"\", &scene, &drawables))\n        ->scale(Vector3(20.0f));\n\n    (new Reflector(&scene, &drawables))\n        ->scale(Vector3(0.5f))\n        ->translate(Vector3::xAxis(-0.5f));\n\n    (new Reflector(&scene, &drawables))\n        ->scale(Vector3(0.3f))\n        ->rotate(deg(37.0f), Vector3::xAxis())\n        ->translate(Vector3::xAxis(0.3f));\n\n    \/* We don't need the importer anymore *\/\n    resourceManager.free<Trade::AbstractImporter>();\n}\n\nvoid CubeMapExample::viewportEvent(const Vector2i& size) {\n    defaultFramebuffer.setViewport({{}, size});\n    camera->setViewport(size);\n}\n\nvoid CubeMapExample::drawEvent() {\n    defaultFramebuffer.clear(DefaultFramebuffer::Clear::Depth);\n    defaultFramebuffer.invalidate({DefaultFramebuffer::InvalidationAttachment::Color});\n\n    camera->draw(drawables);\n    swapBuffers();\n}\n\nvoid CubeMapExample::keyPressEvent(KeyEvent& event) {\n    if(event.key() == KeyEvent::Key::Up)\n        cameraObject->rotate(deg(-10.0f), cameraObject->transformation().right().normalized());\n\n    else if(event.key() == KeyEvent::Key::Down)\n        cameraObject->rotate(deg(10.0f), cameraObject->transformation().right().normalized());\n\n    else if(event.key() == KeyEvent::Key::Left || event.key() == KeyEvent::Key::Right) {\n        GLfloat translationY = cameraObject->transformation().translation().y();\n        cameraObject->translate(Vector3::yAxis(-translationY))\n            ->rotateY(event.key() == KeyEvent::Key::Left ? deg(10.0f) : deg(-10.0f))\n            ->translate(Vector3::yAxis(translationY));\n\n    } else return;\n\n    redraw();\n}\n\n}}\n\nMAGNUM_APPLICATION_MAIN(Magnum::Examples::CubeMapExample)\n<commit_msg>cubemap: assert that ARB_invalidate_subdata is supported.<commit_after>\/*\n    Copyright © 2010, 2011, 2012 Vladimír Vondruš <mosra@centrum.cz>\n\n    This file is part of Magnum.\n\n    Magnum 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    Magnum is distributed in the hope that it 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*\/\n\n#include \"CubeMapExample.h\"\n\n#include <PluginManager\/PluginManager.h>\n#include <Math\/Constants.h>\n#include <AbstractShaderProgram.h>\n#include <DefaultFramebuffer.h>\n#include <Extensions.h>\n#include <IndexedMesh.h>\n#include <Renderer.h>\n#include <Texture.h>\n#include <SceneGraph\/Camera3D.h>\n#include <Trade\/AbstractImporter.h>\n\n#include \"CubeMap.h\"\n#include \"Reflector.h\"\n#include \"configure.h\"\n\nusing namespace Corrade::PluginManager;\n\nnamespace Magnum { namespace Examples {\n\nCubeMapExample::CubeMapExample(int& argc, char** argv): GlutApplication(argc, argv, \"Cube map example\") {\n    MAGNUM_ASSERT_EXTENSION_SUPPORTED(Extensions::GL::ARB::invalidate_subdata);\n\n    Renderer::setFeature(Renderer::Feature::DepthTest, true);\n    Renderer::setFeature(Renderer::Feature::FaceCulling, true);\n\n    \/* Set up perspective camera *\/\n    (cameraObject = new Object3D(&scene))\n        ->translate(Vector3::zAxis(3.0f));\n    (camera = new SceneGraph::Camera3D<>(cameraObject))\n        ->setAspectRatioPolicy(SceneGraph::AspectRatioPolicy::Extend)\n        ->setPerspective(deg(55.0f), 0.001f, 100.0f);\n\n    \/* Load TGA importer plugin *\/\n    PluginManager<Trade::AbstractImporter> manager(MAGNUM_PLUGINS_IMPORTER_DIR);\n    Trade::AbstractImporter* importer;\n    if(manager.load(\"TgaImporter\") != AbstractPluginManager::LoadOk || !(importer = manager.instance(\"TgaImporter\"))) {\n        Error() << \"Cannot load TGAImporter plugin from\" << manager.pluginDirectory();\n        std::exit(1);\n    }\n    resourceManager.set<Trade::AbstractImporter>(\"tga-importer\", importer, ResourceDataState::Final, ResourcePolicy::Manual);\n\n    \/* Add objects to scene *\/\n    (new CubeMap(argc == 2 ? argv[1] : \"\", &scene, &drawables))\n        ->scale(Vector3(20.0f));\n\n    (new Reflector(&scene, &drawables))\n        ->scale(Vector3(0.5f))\n        ->translate(Vector3::xAxis(-0.5f));\n\n    (new Reflector(&scene, &drawables))\n        ->scale(Vector3(0.3f))\n        ->rotate(deg(37.0f), Vector3::xAxis())\n        ->translate(Vector3::xAxis(0.3f));\n\n    \/* We don't need the importer anymore *\/\n    resourceManager.free<Trade::AbstractImporter>();\n}\n\nvoid CubeMapExample::viewportEvent(const Vector2i& size) {\n    defaultFramebuffer.setViewport({{}, size});\n    camera->setViewport(size);\n}\n\nvoid CubeMapExample::drawEvent() {\n    defaultFramebuffer.clear(DefaultFramebuffer::Clear::Depth);\n    defaultFramebuffer.invalidate({DefaultFramebuffer::InvalidationAttachment::Color});\n\n    camera->draw(drawables);\n    swapBuffers();\n}\n\nvoid CubeMapExample::keyPressEvent(KeyEvent& event) {\n    if(event.key() == KeyEvent::Key::Up)\n        cameraObject->rotate(deg(-10.0f), cameraObject->transformation().right().normalized());\n\n    else if(event.key() == KeyEvent::Key::Down)\n        cameraObject->rotate(deg(10.0f), cameraObject->transformation().right().normalized());\n\n    else if(event.key() == KeyEvent::Key::Left || event.key() == KeyEvent::Key::Right) {\n        GLfloat translationY = cameraObject->transformation().translation().y();\n        cameraObject->translate(Vector3::yAxis(-translationY))\n            ->rotateY(event.key() == KeyEvent::Key::Left ? deg(10.0f) : deg(-10.0f))\n            ->translate(Vector3::yAxis(translationY));\n\n    } else return;\n\n    redraw();\n}\n\n}}\n\nMAGNUM_APPLICATION_MAIN(Magnum::Examples::CubeMapExample)\n<|endoftext|>"}
{"text":"<commit_before>\/** \\brief Utility for generating a dependency graph for externally-referenced symbols.\n *  \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n *  \\copyright 2019 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 <algorithm>\n#include <iostream>\n#include <unordered_set>\n#include <vector>\n#include <cstdlib>\n#include <cstring>\n#include \"ExecUtil.h\"\n#include \"FileUtil.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\n[[noreturn]] void Usage() {\n    ::Usage(\"[--debug] absolute_library_paths\");\n}\n\n\nstruct LibraryAndSymbols {\n    std::string library_path_;\n    std::unordered_set<std::string> provided_, needed_;\npublic:\n    LibraryAndSymbols() = default;\n    LibraryAndSymbols(const LibraryAndSymbols &other) = default;\n    explicit LibraryAndSymbols(const std::string &library_path): library_path_(library_path) { }\n};\n\n\nvoid ProcessLine(const bool debug, const std::string &line, LibraryAndSymbols * const library_and_symbols,\n                 std::unordered_set<std::string> * const all_provided)\n{\n    std::vector<std::string> parts;\n    StringUtil::SplitThenTrimWhite(line, ' ', &parts);\n    if (parts.size() == 2 and parts[1] != \"_GLOBAL_OFFSET_TABLE_\")\n        library_and_symbols->needed_.emplace(parts[1] + (debug ? \" (\" + parts[0] + \")\" : \"\"));\n    else if (parts.size() == 3) {\n        all_provided->emplace(parts[2] + (debug ? \" (U)\" : \"\"));\n        if (parts[1] == \"T\")\n            library_and_symbols->provided_.emplace(parts[2] + (debug ? \" (\" + parts[1] + \")\" : \"\"));\n    }\n}\n\n\nvoid ExtractSymbols(const bool debug, LibraryAndSymbols * const library_and_symbols) {\n    std::string stdout;\n    const std::string COMMAND(\"nm \" + library_and_symbols->library_path_);\n    if (not ExecUtil::ExecSubcommandAndCaptureStdout(COMMAND, &stdout, \/* suppress_stderr = *\/true))\n        LOG_ERROR(\"failed to execute \\\"\" + COMMAND + \"\\\"!\");\n\n    std::unordered_set<std::string> all_provided;\n\n    std::string line;\n    for (const char ch : stdout) {\n        if (ch == '\\n') {\n            ProcessLine(debug, line, library_and_symbols, &all_provided);\n            line.clear();\n        } else\n            line += ch;\n    }\n\n    if (not line.empty())\n        ProcessLine(debug, line, library_and_symbols, &all_provided);\n\n    \/\/ Remove referenced symbols that are implemented in the library themselves:\n    for (const auto &symbol : all_provided)\n        library_and_symbols->needed_.erase(symbol);\n\n    LOG_DEBUG(library_and_symbols->library_path_ + \" provided: \" + std::to_string(library_and_symbols->provided_.size())\n              + \" needed: \" + std::to_string(library_and_symbols->needed_.size()));\n}\n\n\nvoid ListSymbols(const std::string &library_path, const std::string &description, const std::unordered_set<std::string> &symbols) {\n    std::vector<std::string> sorted_symbols;\n    sorted_symbols.reserve(symbols.size());\n\n    for (const auto &symbol : symbols)\n        sorted_symbols.emplace_back(symbol);\n    std::sort(sorted_symbols.begin(), sorted_symbols.end());\n\n    std::cout << FileUtil::GetBasename(library_path) << \" (\" << description << \")\\n\";\n    for (const auto &symbol : sorted_symbols)\n        std::cout << \"    \" << symbol << '\\n';\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n    if (argc == 1)\n        Usage();\n\n    bool debug(false);\n    if (argc > 1 and std::strcmp(\"--debug\", argv[1]) == 0) {\n        debug = true;\n        logger->setMinimumLogLevel(Logger::LL_DEBUG);\n        --argc, ++argv;\n    }\n    if (argc < 1)\n        Usage();\n\n    std::vector<LibraryAndSymbols> libraries_and_symbols;\n    for (int arg_no(1); arg_no < argc; ++arg_no) {\n        LibraryAndSymbols new_library_and_symbols(argv[arg_no]);\n        ExtractSymbols(debug, &new_library_and_symbols);\n        if (debug) {\n            ListSymbols(new_library_and_symbols.library_path_, \"defined\", new_library_and_symbols.provided_);\n            ListSymbols(new_library_and_symbols.library_path_, \"referenced\", new_library_and_symbols.needed_);\n        } else\n            libraries_and_symbols.emplace_back(new_library_and_symbols);\n    }\n\n    if (debug) {\n        std::unordered_set<std::string> found_external_references;\n        for (const auto &lib1 : libraries_and_symbols) {\n            for (const auto &lib2 : libraries_and_symbols) {\n                if (lib1.library_path_ == lib2.library_path_)\n                    continue;\n\n                for (const auto &external_symbol : lib1.needed_) {\n                    if (lib2.provided_.find(external_symbol) != lib2.provided_.cend())\n                        found_external_references.emplace(external_symbol);\n                }\n            }\n        }\n\n        std::cout << \"Missing external references:\\n\";\n        for (const auto &lib : libraries_and_symbols) {\n            for (const auto &external_symbol : lib.needed_) {\n                if (found_external_references.find(external_symbol) == found_external_references.cend())\n                    std::cout << external_symbol << \" (\" << FileUtil::GetBasename(lib.library_path_) << \")\\n\";\n            }\n        }\n    } else {\n        for (const auto &lib1 : libraries_and_symbols) {\n            for (const auto &lib2 : libraries_and_symbols) {\n                if (lib1.library_path_ == lib2.library_path_)\n                    continue;\n\n                for (const auto &external_symbol : lib1.needed_) {\n                    if (lib2.provided_.find(external_symbol) != lib2.provided_.cend())\n                        std::cout << FileUtil::GetLastPathComponent(lib1.library_path_) << \" -> \"\n                                  << FileUtil::GetLastPathComponent(lib2.library_path_) << '\\n';\n                    break;\n                }\n            }\n        }\n    }\n\n    return EXIT_SUCCESS;\n}\n<commit_msg>Fixed an obvious bug.<commit_after>\/** \\brief Utility for generating a dependency graph for externally-referenced symbols.\n *  \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n *  \\copyright 2019 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 <algorithm>\n#include <iostream>\n#include <unordered_set>\n#include <vector>\n#include <cstdlib>\n#include <cstring>\n#include \"ExecUtil.h\"\n#include \"FileUtil.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\n[[noreturn]] void Usage() {\n    ::Usage(\"[--debug] absolute_library_paths\");\n}\n\n\nstruct LibraryAndSymbols {\n    std::string library_path_;\n    std::unordered_set<std::string> provided_, needed_;\npublic:\n    LibraryAndSymbols() = default;\n    LibraryAndSymbols(const LibraryAndSymbols &other) = default;\n    explicit LibraryAndSymbols(const std::string &library_path): library_path_(library_path) { }\n};\n\n\nvoid ProcessLine(const bool debug, const std::string &line, LibraryAndSymbols * const library_and_symbols,\n                 std::unordered_set<std::string> * const all_provided)\n{\n    std::vector<std::string> parts;\n    StringUtil::SplitThenTrimWhite(line, ' ', &parts);\n    if (parts.size() == 2 and parts[1] != \"_GLOBAL_OFFSET_TABLE_\")\n        library_and_symbols->needed_.emplace(parts[1] + (debug ? \" (\" + parts[0] + \")\" : \"\"));\n    else if (parts.size() == 3) {\n        all_provided->emplace(parts[2] + (debug ? \" (U)\" : \"\"));\n        if (parts[1] == \"T\")\n            library_and_symbols->provided_.emplace(parts[2] + (debug ? \" (\" + parts[1] + \")\" : \"\"));\n    }\n}\n\n\nvoid ExtractSymbols(const bool debug, LibraryAndSymbols * const library_and_symbols) {\n    std::string stdout;\n    const std::string COMMAND(\"nm \" + library_and_symbols->library_path_);\n    if (not ExecUtil::ExecSubcommandAndCaptureStdout(COMMAND, &stdout, \/* suppress_stderr = *\/true))\n        LOG_ERROR(\"failed to execute \\\"\" + COMMAND + \"\\\"!\");\n\n    std::unordered_set<std::string> all_provided;\n\n    std::string line;\n    for (const char ch : stdout) {\n        if (ch == '\\n') {\n            ProcessLine(debug, line, library_and_symbols, &all_provided);\n            line.clear();\n        } else\n            line += ch;\n    }\n\n    if (not line.empty())\n        ProcessLine(debug, line, library_and_symbols, &all_provided);\n\n    \/\/ Remove referenced symbols that are implemented in the library themselves:\n    for (const auto &symbol : all_provided)\n        library_and_symbols->needed_.erase(symbol);\n\n    LOG_DEBUG(library_and_symbols->library_path_ + \" provided: \" + std::to_string(library_and_symbols->provided_.size())\n              + \" needed: \" + std::to_string(library_and_symbols->needed_.size()));\n}\n\n\nvoid ListSymbols(const std::string &library_path, const std::string &description, const std::unordered_set<std::string> &symbols) {\n    std::vector<std::string> sorted_symbols;\n    sorted_symbols.reserve(symbols.size());\n\n    for (const auto &symbol : symbols)\n        sorted_symbols.emplace_back(symbol);\n    std::sort(sorted_symbols.begin(), sorted_symbols.end());\n\n    std::cout << FileUtil::GetBasename(library_path) << \" (\" << description << \")\\n\";\n    for (const auto &symbol : sorted_symbols)\n        std::cout << \"    \" << symbol << '\\n';\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n    if (argc == 1)\n        Usage();\n\n    bool debug(false);\n    if (argc > 1 and std::strcmp(\"--debug\", argv[1]) == 0) {\n        debug = true;\n        logger->setMinimumLogLevel(Logger::LL_DEBUG);\n        --argc, ++argv;\n    }\n    if (argc < 1)\n        Usage();\n\n    std::vector<LibraryAndSymbols> libraries_and_symbols;\n    for (int arg_no(1); arg_no < argc; ++arg_no) {\n        LibraryAndSymbols new_library_and_symbols(argv[arg_no]);\n        ExtractSymbols(debug, &new_library_and_symbols);\n        if (debug) {\n            ListSymbols(new_library_and_symbols.library_path_, \"defined\", new_library_and_symbols.provided_);\n            ListSymbols(new_library_and_symbols.library_path_, \"referenced\", new_library_and_symbols.needed_);\n        } else\n            libraries_and_symbols.emplace_back(new_library_and_symbols);\n    }\n\n    if (debug) {\n        std::unordered_set<std::string> found_external_references;\n        for (const auto &lib1 : libraries_and_symbols) {\n            for (const auto &lib2 : libraries_and_symbols) {\n                if (lib1.library_path_ == lib2.library_path_)\n                    continue;\n\n                for (const auto &external_symbol : lib1.needed_) {\n                    if (lib2.provided_.find(external_symbol) != lib2.provided_.cend())\n                        found_external_references.emplace(external_symbol);\n                }\n            }\n        }\n\n        std::cout << \"Missing external references:\\n\";\n        for (const auto &lib : libraries_and_symbols) {\n            for (const auto &external_symbol : lib.needed_) {\n                if (found_external_references.find(external_symbol) == found_external_references.cend())\n                    std::cout << external_symbol << \" (\" << FileUtil::GetBasename(lib.library_path_) << \")\\n\";\n            }\n        }\n    } else {\n        for (const auto &lib1 : libraries_and_symbols) {\n            for (const auto &lib2 : libraries_and_symbols) {\n                if (lib1.library_path_ == lib2.library_path_)\n                    continue;\n\n                for (const auto &external_symbol : lib1.needed_) {\n                    if (lib2.provided_.find(external_symbol) != lib2.provided_.cend()) {\n                        std::cout << FileUtil::GetLastPathComponent(lib1.library_path_) << \" -> \"\n                                  << FileUtil::GetLastPathComponent(lib2.library_path_) << '\\n';\n                        break;\n                    }\n                }\n            }\n        }\n    }\n\n    return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode:linux -*- *\/\n\/**\n * \\file tiles_state.cc\n *\n *\n *\n * \\author Ethan Burns\n * \\date 2008-11-03\n *\/\n\n#include <assert.h>\n#include <math.h>\n\n#include <vector>\n#include <iostream>\n\n#include \"tiles.h\"\n#include \"tiles_state.h\"\n\nusing namespace std;\n\nvoid TilesState::compute_hash(void)\n{\n\tunsigned int bits = 0;\n\tunsigned int n = tiles.size();\n\tconst Tiles *t = dynamic_cast<const Tiles *>(domain);\n\tconst vector<unsigned int> *ones = t->get_ones();\n\n\thash_val = 0;\n\tfor (int i = tiles.size() - 1; i >= 0; i -= 1) {\n\t\tunsigned int k = tiles[i];\n\t\thash_val += (ones->at(bits >> (n - k)) * (n - 1 - i));\n\t\tbits |= 1 << (n - k - 1);\n\t}\n}\n\n\nTilesState::TilesState(SearchDomain *d, const State *parent, float g,\n\t\t       float h, vector<unsigned int> tiles,\n\t\t       unsigned int blank)\n\t: State(d, parent, g),\n\t  tiles(tiles),\n\t  blank(blank)\n{\n\tthis->h = h;\n\tcompute_hash();\n}\n\n\nTilesState::TilesState(SearchDomain *d, const State *parent, float g,\n\t\t       vector<unsigned int> tiles, unsigned int blank)\n\t: State(d, parent, g),\n\t  tiles(tiles),\n\t  blank(blank)\n{\n\tconst Tiles::ManhattanDist *mh =\n\t\tdynamic_cast<const Tiles::ManhattanDist *>(domain->get_heuristic());\n\tmh == mh;\n\tassert(tiles[blank] == 0);\n\tthis->h = domain->get_heuristic()->compute(this);\n\tassert(this->h == 0 ? is_goal() : 1);\n\tcompute_hash();\n}\n\n\n\/**\n * Test if the tiles are in order.\n *\/\nbool TilesState::is_goal(void) const\n{\n\tTiles * t= dynamic_cast<Tiles*>(domain);\n\n\treturn t->is_goal(this);\n}\n\n\nint TilesState::hash(void) const\n{\n\treturn hash_val;\n}\n\n\nState *TilesState::clone(void) const\n{\n\treturn new TilesState(domain, parent, g, tiles, blank);\n}\n\n\nvoid TilesState::print(ostream &o) const\n{\n\tTiles *t = dynamic_cast<Tiles*>(domain);\n\tunsigned int i = 0;\n\n\to << \"Hash: \" << hash_val << endl;\n\tfor (unsigned int y = 0; y < t->get_height(); y += 1) {\n\t\tfor (unsigned int x = 0; x < t->get_width(); x += 1) {\n\t\t\to << tiles[i];\n\t\t\tif (x < t->get_width() - 1)\n\t\t\t\to << \"\\t\";\n\t\t\ti += 1;\n\t\t}\n\t\to << endl;\n\t}\n}\n\n\/**\n * Test if two states are the same configuration.\n *\/\nbool TilesState::equals(const State *s) const\n{\n\tconst TilesState *other = dynamic_cast<const TilesState *>(s);\n\n\tfor (unsigned int i = 0; i < tiles.size(); i += 1)\n\t\tif (tiles[i] != other->tiles[i])\n\t\t\treturn false;\n\n\treturn true;\n}\n\n\/**\n * Get the tile vector.\n *\/\nconst vector<unsigned int> *TilesState::get_tiles(void) const\n{\n\treturn &tiles;\n}\n\n\/**\n * Get the blank position.\n *\/\nunsigned int TilesState::get_blank(void) const\n{\n\treturn blank;\n}\n<commit_msg>Remove debug code.<commit_after>\/* -*- mode:linux -*- *\/\n\/**\n * \\file tiles_state.cc\n *\n *\n *\n * \\author Ethan Burns\n * \\date 2008-11-03\n *\/\n\n#include <assert.h>\n#include <math.h>\n\n#include <vector>\n#include <iostream>\n\n#include \"tiles.h\"\n#include \"tiles_state.h\"\n\nusing namespace std;\n\nvoid TilesState::compute_hash(void)\n{\n\tunsigned int bits = 0;\n\tunsigned int n = tiles.size();\n\tconst Tiles *t = dynamic_cast<const Tiles *>(domain);\n\tconst vector<unsigned int> *ones = t->get_ones();\n\n\thash_val = 0;\n\tfor (int i = tiles.size() - 1; i >= 0; i -= 1) {\n\t\tunsigned int k = tiles[i];\n\t\thash_val += (ones->at(bits >> (n - k)) * (n - 1 - i));\n\t\tbits |= 1 << (n - k - 1);\n\t}\n}\n\n\nTilesState::TilesState(SearchDomain *d, const State *parent, float g,\n\t\t       float h, vector<unsigned int> tiles,\n\t\t       unsigned int blank)\n\t: State(d, parent, g),\n\t  tiles(tiles),\n\t  blank(blank)\n{\n\tthis->h = h;\n\tcompute_hash();\n}\n\n\nTilesState::TilesState(SearchDomain *d, const State *parent, float g,\n\t\t       vector<unsigned int> tiles, unsigned int blank)\n\t: State(d, parent, g),\n\t  tiles(tiles),\n\t  blank(blank)\n{\n\tassert(tiles[blank] == 0);\n\tthis->h = domain->get_heuristic()->compute(this);\n\tassert(this->h == 0 ? is_goal() : 1);\n\tcompute_hash();\n}\n\n\n\/**\n * Test if the tiles are in order.\n *\/\nbool TilesState::is_goal(void) const\n{\n\tTiles * t= dynamic_cast<Tiles*>(domain);\n\n\treturn t->is_goal(this);\n}\n\n\nint TilesState::hash(void) const\n{\n\treturn hash_val;\n}\n\n\nState *TilesState::clone(void) const\n{\n\treturn new TilesState(domain, parent, g, tiles, blank);\n}\n\n\nvoid TilesState::print(ostream &o) const\n{\n\tTiles *t = dynamic_cast<Tiles*>(domain);\n\tunsigned int i = 0;\n\n\to << \"Hash: \" << hash_val << endl;\n\tfor (unsigned int y = 0; y < t->get_height(); y += 1) {\n\t\tfor (unsigned int x = 0; x < t->get_width(); x += 1) {\n\t\t\to << tiles[i];\n\t\t\tif (x < t->get_width() - 1)\n\t\t\t\to << \"\\t\";\n\t\t\ti += 1;\n\t\t}\n\t\to << endl;\n\t}\n}\n\n\/**\n * Test if two states are the same configuration.\n *\/\nbool TilesState::equals(const State *s) const\n{\n\tconst TilesState *other = dynamic_cast<const TilesState *>(s);\n\n\tfor (unsigned int i = 0; i < tiles.size(); i += 1)\n\t\tif (tiles[i] != other->tiles[i])\n\t\t\treturn false;\n\n\treturn true;\n}\n\n\/**\n * Get the tile vector.\n *\/\nconst vector<unsigned int> *TilesState::get_tiles(void) const\n{\n\treturn &tiles;\n}\n\n\/**\n * Get the blank position.\n *\/\nunsigned int TilesState::get_blank(void) const\n{\n\treturn blank;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015 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\/\/#define DEBUG \/\/ Enable debugging\n\/\/#define DEBUG2\n\n#include <kernel\/elf.hpp>\n#include <util\/fixedvec.hpp>\n#include <common>\n#include <cassert>\n#include <cstdlib>\n#include <cstdint>\n#include <map>\n#include <stdexcept>\n\nextern void print_backtrace();\nextern void* heap_begin;\nextern void* heap_end;\nstatic void safe_print_symbol(int N, void* addr);\n\nstatic char dbg_write_buffer[1024];\n#include <unistd.h>\n#define DPRINTF(X,...)  { \\\n        int L = snprintf(dbg_write_buffer, sizeof(dbg_write_buffer), \\\n        X, ##__VA_ARGS__); write(1, dbg_write_buffer, L); }\n\n\nstruct allocation\n{\n  allocation() : addr(0) {}\n  allocation(char* A, size_t S, void* L1, void* L2, void* L3)\n    :  addr(A), len(S), level1(L1), level2(L2), level3(L3) {}\n\n  char*  addr;\n  size_t len;\n  void*  level1;\n  void*  level2;\n  void*  level3;\n};\n\nstatic int enable_debugging = 1;\nstatic int enable_debugging_verbose = 0;\nstatic int enable_buffer_protection = 1;\nstatic fixedvector<allocation,  65536> allocs;\nstatic fixedvector<allocation*, 65536> free_allocs;\n\n\/\/ There is a chance of a buffer overrun where this exact value\n\/\/ is written, but the chance of that happening is minimal\nstatic const uint64_t buffer_protection_checksum = 0xdeadbeef1badcafe;\n\nextern \"C\"\nvoid _enable_heap_debugging(int enabled)\n{\n  enable_debugging = enabled;\n}\nextern \"C\"\nvoid _enable_heap_debugging_verbose(int enabled)\n{\n  enable_debugging_verbose = enabled;\n}\nextern \"C\"\nvoid _enable_heap_debugging_buffer_protection(int enabled)\n{\n  enable_buffer_protection = enabled;\n}\nextern \"C\"\nint _get_heap_debugging_buffers_usage()\n{\n  return allocs.size();\n}\nextern \"C\"\nint _get_heap_debugging_buffers_total()\n{\n  return allocs.capacity();\n}\n\nstatic allocation* find_alloc(char* addr)\n{\n  for (auto& x : allocs)\n  if (x.addr) \/\/ nullptr's are free slots\n  {\n    if (addr >= x.addr && addr < x.addr + x.len)\n        return &x; \/\/ perfect match or misaligned pointer\n  }\n  return nullptr;\n}\n\nvoid* operator new (std::size_t len) throw(std::bad_alloc)\n{\n  void* data = nullptr;\n\n  if (enable_buffer_protection) {\n    \/\/ Allocate requested memory + enough to fit checksum at start and end\n    data = malloc(len + sizeof(buffer_protection_checksum) * 2);\n\n    \/\/ Write checksums\n    auto* temp = reinterpret_cast<char*>(data);\n    memcpy(temp,\n           &buffer_protection_checksum,\n           sizeof(buffer_protection_checksum));\n\n    memcpy(temp + sizeof(buffer_protection_checksum) + len,\n           &buffer_protection_checksum,\n           sizeof(buffer_protection_checksum));\n\n  } else {\n    data = malloc(len);\n  }\n\n  if (enable_debugging_verbose) {\n    DPRINTF(\"malloc(%u bytes) == %p\\n\", len, data);\n    safe_print_symbol(1, __builtin_return_address(0));\n    safe_print_symbol(2, __builtin_return_address(1));\n  }\n\n  if (UNLIKELY(!data)) {\n      print_backtrace();\n      DPRINTF(\"malloc(%u bytes): FAILED\\n\", len);\n      throw std::bad_alloc();\n  }\n\n  if (enable_debugging) {\n    if (!free_allocs.empty()) {\n      auto* x = free_allocs.pop();\n      new(x) allocation((char*) data, len,\n                        __builtin_return_address(0),\n                        __builtin_return_address(1),\n                        __builtin_return_address(2));\n    } else if (!allocs.free_capacity()) {\n      DPRINTF(\"[WARNING] Internal fixed vectors are FULL, expect bogus double free messages\\n\");\n    } else {\n      allocs.emplace((char*) data, len,\n                      __builtin_return_address(0),\n                      __builtin_return_address(1),\n                      __builtin_return_address(2));\n    }\n  }\n\n  if (enable_buffer_protection) {\n    \/\/ We need to return a pointer to the allocated memory + 4\n    \/\/ e.g. after our first checksum\n    return reinterpret_cast<void*>(reinterpret_cast<char*>(data) +\n                                   sizeof(buffer_protection_checksum));\n  } else {\n    return data;\n  }\n}\nvoid* operator new[] (std::size_t n) throw(std::bad_alloc)\n{\n  return ::operator new (n);\n}\n\ninline static void deleted_ptr(void* ptr)\n{\n  if (enable_buffer_protection) {\n    \/\/ Calculate where the real allocation starts (at our first checksum)\n    ptr = reinterpret_cast<void*>(reinterpret_cast<char*>(ptr) -\n                                  sizeof(buffer_protection_checksum));\n  }\n\n  if (enable_debugging) {\n    auto* x = find_alloc((char*) ptr);\n    if (x == nullptr) {\n      if (ptr < heap_begin || ptr > heap_end) {\n          DPRINTF(\"[ERROR] Free on invalid non-heap address: %p\\n\", ptr);\n      } else {\n          DPRINTF(\"[ERROR] Possible double free on address: %p\\n\", ptr);\n      }\n      print_backtrace();\n      return;\n    }\n    else if (x->addr == ptr) {\n      if (enable_debugging_verbose) {\n        DPRINTF(\"free(%p) == %u bytes\\n\", x->addr, x->len);\n        safe_print_symbol(1, __builtin_return_address(1));\n        safe_print_symbol(2, __builtin_return_address(2));\n      }\n\n      \/\/ This is the only place where we can verify the buffer protection\n      \/\/ checksums, since we need to know the length of the allocation\n      if (enable_buffer_protection)\n      {\n        auto* temp = reinterpret_cast<char*>(ptr);\n        auto underflow = memcmp(temp,\n                                &buffer_protection_checksum,\n                                sizeof(buffer_protection_checksum));\n        auto overflow = memcmp(temp + sizeof(buffer_protection_checksum) + x->len,\n                               &buffer_protection_checksum,\n                               sizeof(buffer_protection_checksum));\n\n        if (underflow)\n        {\n          DPRINTF(\"[ERROR] Buffer underflow found on address: %p\\n\", ptr);\n          \/\/ TODO: print stacktrace\n        }\n\n        if (overflow)\n        {\n          DPRINTF(\"[ERROR] Buffer overflow found on address: %p\\n\", ptr);\n          \/\/ TODO: print stacktrace\n        }\n      }\n\n      \/\/ perfect match\n      x->addr = nullptr;\n      x->len  = 0;\n      free_allocs.add(x);\n    }\n    else if (x->addr != ptr) {\n      DPRINTF(\"[ERROR] Free on misaligned address: %p inside %p:%u\",\n             ptr, x->addr, x->len);\n      print_backtrace();\n      return;\n    }\n  }\n  free(ptr);\n}\nvoid operator delete(void* ptr) throw()\n{\n  deleted_ptr(ptr);\n}\nvoid operator delete[] (void* ptr) throw()\n{\n  deleted_ptr(ptr);\n}\n\nstatic void safe_print_symbol(int N, void* addr)\n{\n  char _symbol_buffer[2048];\n  char _btrace_buffer[2048];\n  auto symb = Elf::safe_resolve_symbol(\n              addr, _symbol_buffer, sizeof(_symbol_buffer));\n  int len = snprintf(_btrace_buffer, sizeof(_btrace_buffer),\n           \"-> [%d] %8x + 0x%.3x: %s\\n\", \\\n           N, symb.addr, symb.offset, symb.name);\\\n  write(1, _btrace_buffer, len);\n}\n\n#include <delegate>\ntypedef delegate<bool(void*, size_t)> heap_print_func;\n\nvoid print_heap_allocations(heap_print_func func)\n{\n  DPRINTF(\"Listing %u allocations...\\n\", allocs.size());\n  for (auto& x : allocs) {\n    if (x.addr != nullptr && func(x.addr, x.len)) {\n      \/\/ entry\n      DPRINTF(\"[%p] %u bytes\\n\", x.addr, x.len);\n      \/\/ backtrace\n      safe_print_symbol(1, x.level1);\n      safe_print_symbol(2, x.level2);\n      safe_print_symbol(3, x.level3);\n    }\n  }\n}\n<commit_msg>heap_debugging: Fix warnings in 64-bit<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015 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\/\/#define DEBUG \/\/ Enable debugging\n\/\/#define DEBUG2\n\n#include <kernel\/elf.hpp>\n#include <util\/fixedvec.hpp>\n#include <common>\n#include <cassert>\n#include <cstdlib>\n#include <cstdint>\n#include <map>\n#include <stdexcept>\n\nextern void print_backtrace();\nextern void* heap_begin;\nextern void* heap_end;\nstatic void safe_print_symbol(int N, void* addr);\n\nstatic char dbg_write_buffer[1024];\n#include <unistd.h>\n#define DPRINTF(X,...)  { \\\n        int L = snprintf(dbg_write_buffer, sizeof(dbg_write_buffer), \\\n        X, ##__VA_ARGS__); write(1, dbg_write_buffer, L); }\n\n\nstruct allocation\n{\n  allocation() : addr(0) {}\n  allocation(char* A, size_t S, void* L1, void* L2, void* L3)\n    :  addr(A), len(S), level1(L1), level2(L2), level3(L3) {}\n\n  char*  addr;\n  size_t len;\n  void*  level1;\n  void*  level2;\n  void*  level3;\n};\n\nstatic int enable_debugging = 1;\nstatic int enable_debugging_verbose = 0;\nstatic int enable_buffer_protection = 1;\nstatic fixedvector<allocation,  65536> allocs;\nstatic fixedvector<allocation*, 65536> free_allocs;\n\n\/\/ There is a chance of a buffer overrun where this exact value\n\/\/ is written, but the chance of that happening is minimal\nstatic const uint64_t buffer_protection_checksum = 0xdeadbeef1badcafe;\n\nextern \"C\"\nvoid _enable_heap_debugging(int enabled)\n{\n  enable_debugging = enabled;\n}\nextern \"C\"\nvoid _enable_heap_debugging_verbose(int enabled)\n{\n  enable_debugging_verbose = enabled;\n}\nextern \"C\"\nvoid _enable_heap_debugging_buffer_protection(int enabled)\n{\n  enable_buffer_protection = enabled;\n}\nextern \"C\"\nint _get_heap_debugging_buffers_usage()\n{\n  return allocs.size();\n}\nextern \"C\"\nint _get_heap_debugging_buffers_total()\n{\n  return allocs.capacity();\n}\n\nstatic allocation* find_alloc(char* addr)\n{\n  for (auto& x : allocs)\n  if (x.addr) \/\/ nullptr's are free slots\n  {\n    if (addr >= x.addr && addr < x.addr + x.len)\n        return &x; \/\/ perfect match or misaligned pointer\n  }\n  return nullptr;\n}\n\nvoid* operator new (std::size_t len) throw(std::bad_alloc)\n{\n  void* data = nullptr;\n\n  if (enable_buffer_protection) {\n    \/\/ Allocate requested memory + enough to fit checksum at start and end\n    data = malloc(len + sizeof(buffer_protection_checksum) * 2);\n\n    \/\/ Write checksums\n    auto* temp = reinterpret_cast<char*>(data);\n    memcpy(temp,\n           &buffer_protection_checksum,\n           sizeof(buffer_protection_checksum));\n\n    memcpy(temp + sizeof(buffer_protection_checksum) + len,\n           &buffer_protection_checksum,\n           sizeof(buffer_protection_checksum));\n\n  } else {\n    data = malloc(len);\n  }\n\n  if (enable_debugging_verbose) {\n    DPRINTF(\"malloc(%llu bytes) == %p\\n\", (unsigned long long) len, data);\n    safe_print_symbol(1, __builtin_return_address(0));\n    safe_print_symbol(2, __builtin_return_address(1));\n  }\n\n  if (UNLIKELY(!data)) {\n      print_backtrace();\n      DPRINTF(\"malloc(%llu bytes): FAILED\\n\", (unsigned long long) len);\n      throw std::bad_alloc();\n  }\n\n  if (enable_debugging) {\n    if (!free_allocs.empty()) {\n      auto* x = free_allocs.pop();\n      new(x) allocation((char*) data, len,\n                        __builtin_return_address(0),\n                        __builtin_return_address(1),\n                        __builtin_return_address(2));\n    } else if (!allocs.free_capacity()) {\n      DPRINTF(\"[WARNING] Internal fixed vectors are FULL, expect bogus double free messages\\n\");\n    } else {\n      allocs.emplace((char*) data, len,\n                      __builtin_return_address(0),\n                      __builtin_return_address(1),\n                      __builtin_return_address(2));\n    }\n  }\n\n  if (enable_buffer_protection) {\n    \/\/ We need to return a pointer to the allocated memory + 4\n    \/\/ e.g. after our first checksum\n    return reinterpret_cast<void*>(reinterpret_cast<char*>(data) +\n                                   sizeof(buffer_protection_checksum));\n  } else {\n    return data;\n  }\n}\nvoid* operator new[] (std::size_t n) throw(std::bad_alloc)\n{\n  return ::operator new (n);\n}\n\ninline static void deleted_ptr(void* ptr)\n{\n  if (enable_buffer_protection) {\n    \/\/ Calculate where the real allocation starts (at our first checksum)\n    ptr = reinterpret_cast<void*>(reinterpret_cast<char*>(ptr) -\n                                  sizeof(buffer_protection_checksum));\n  }\n\n  if (enable_debugging) {\n    auto* x = find_alloc((char*) ptr);\n    if (x == nullptr) {\n      if (ptr < heap_begin || ptr > heap_end) {\n          DPRINTF(\"[ERROR] Free on invalid non-heap address: %p\\n\", ptr);\n      } else {\n          DPRINTF(\"[ERROR] Possible double free on address: %p\\n\", ptr);\n      }\n      print_backtrace();\n      return;\n    }\n    else if (x->addr == ptr) {\n      if (enable_debugging_verbose) {\n        DPRINTF(\"free(%p) == %llu bytes\\n\", x->addr, (unsigned long long) x->len);\n        safe_print_symbol(1, __builtin_return_address(1));\n        safe_print_symbol(2, __builtin_return_address(2));\n      }\n\n      \/\/ This is the only place where we can verify the buffer protection\n      \/\/ checksums, since we need to know the length of the allocation\n      if (enable_buffer_protection)\n      {\n        auto* temp = reinterpret_cast<char*>(ptr);\n        auto underflow = memcmp(temp,\n                                &buffer_protection_checksum,\n                                sizeof(buffer_protection_checksum));\n        auto overflow = memcmp(temp + sizeof(buffer_protection_checksum) + x->len,\n                               &buffer_protection_checksum,\n                               sizeof(buffer_protection_checksum));\n\n        if (underflow)\n        {\n          DPRINTF(\"[ERROR] Buffer underflow found on address: %p\\n\", ptr);\n          \/\/ TODO: print stacktrace\n        }\n\n        if (overflow)\n        {\n          DPRINTF(\"[ERROR] Buffer overflow found on address: %p\\n\", ptr);\n          \/\/ TODO: print stacktrace\n        }\n      }\n\n      \/\/ perfect match\n      x->addr = nullptr;\n      x->len  = 0;\n      free_allocs.add(x);\n    }\n    else if (x->addr != ptr) {\n      DPRINTF(\"[ERROR] Free on misaligned address: %p inside %p:%llu\",\n             ptr, x->addr, (unsigned long long) x->len);\n      print_backtrace();\n      return;\n    }\n  }\n  free(ptr);\n}\nvoid operator delete(void* ptr) throw()\n{\n  deleted_ptr(ptr);\n}\nvoid operator delete[] (void* ptr) throw()\n{\n  deleted_ptr(ptr);\n}\n\nstatic void safe_print_symbol(int N, void* addr)\n{\n  char _symbol_buffer[2048];\n  char _btrace_buffer[2048];\n  auto symb = Elf::safe_resolve_symbol(\n              addr, _symbol_buffer, sizeof(_symbol_buffer));\n  int len = snprintf(_btrace_buffer, sizeof(_btrace_buffer),\n           \"-> [%d] %16p + 0x%.3x: %s\\n\", \\\n           N, (void*) symb.addr, symb.offset, symb.name);\\\n  write(1, _btrace_buffer, len);\n}\n\n#include <delegate>\ntypedef delegate<bool(void*, size_t)> heap_print_func;\n\nvoid print_heap_allocations(heap_print_func func)\n{\n  DPRINTF(\"Listing %u allocations...\\n\", allocs.size());\n  for (auto& x : allocs) {\n    if (x.addr != nullptr && func(x.addr, x.len)) {\n      \/\/ entry\n      DPRINTF(\"[%p] %llu bytes\\n\", x.addr, (unsigned long long) x.len);\n      \/\/ backtrace\n      safe_print_symbol(1, x.level1);\n      safe_print_symbol(2, x.level2);\n      safe_print_symbol(3, x.level3);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode: C++; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*- *\/\n\/\/ vim:sts=4:sw=4:ts=4:noet:sr:cino=>s,f0,{0,g0,(0,\\:0,t0,+0,=s\n\/\/#include \"goto-def.h\"\n\n\/* Copyright (c) FFLAS-FFPACK\n* Written by Clément Pernet <clement.pernet@imag.fr>\n* ========LICENCE========\n* This file is part of the library FFLAS-FFPACK.\n*\n* FFLAS-FFPACK is free software: you can redistribute it and\/or modify\n* 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* ========LICENCE========\n*\/\n\n\/\/ Please do not commit with any of these defines on - AB 2015-01-12\n\/\/#define __FFLASFFPACK_USE_TBB\n\/\/#define __FFLASFFPACK_USE_OPENMP \n\/\/#define __FFLASFFPACK_USE_DATAFLOW\n\/\/#define WINO_PARALLEL_TMPS\n\/\/#define __FFLASFFPACK_FORCE_SEQ\n\/\/#define PFGEMM_WINO_SEQ 32\n\/\/#define CLASSIC_SEQ\n#define CLASSIC_HYBRID\n\/\/#define WINO_SEQ\n\/\/#define FFT_PROFILER\n\/\/#define PROFILE_FGEMM_MP\n#include \"fflas-ffpack\/fflas-ffpack-config.h\"\n#include <iostream>\n#include <givaro\/modular-balanced.h>\n\n#include \"fflas-ffpack\/config-blas.h\"\n#include \"fflas-ffpack\/fflas\/fflas.h\"\n#include \"fflas-ffpack\/utils\/timer.h\"\n#include \"fflas-ffpack\/utils\/args-parser.h\"\n\n#ifdef __FFLASFFPACK_USE_KAAPI\n#include \"libkomp.h\"\n#endif\n\n\nusing namespace std;\nusing namespace FFLAS;\n\n\nint main(int argc, char** argv) {\n\n\tsize_t iter = 3 ;\n\tGivaro::Integer q = 131071 ;\n\tsize_t m = 2000 ;\n\tsize_t k = 2000 ;\n\tsize_t n = 2000 ;\n\tint nbw = -1 ;\n\tint p=0;\n\tint t=MAX_THREADS;\n\tint NBK = -1;\n\n\tArgument as[] = {\n\t\t{ 'q', \"-q Q\", \"Set the field characteristic (-1 for random).\",         TYPE_INTEGER , &q },\n\t\t{ 'm', \"-m M\", \"Set the row dimension of A.\",      TYPE_INT , &m },\n\t\t{ 'k', \"-k K\", \"Set the col dimension of A.\",      TYPE_INT , &k },\n\t\t{ 'n', \"-n N\", \"Set the col dimension of B.\",      TYPE_INT , &n },\n\t\t{ 'w', \"-w N\", \"Set the number of winograd levels (-1 for random).\",    TYPE_INT , &nbw },\n\t\t{ 'i', \"-i R\", \"Set number of repetitions.\",       TYPE_INT , &iter },\n\t\t{ 'p', \"-p P\", \"0 for sequential, 1 for 2D iterative, 2 for 2D rec, 3 for 2D rec adaptive, 4 for 3D rc in-place, 5 for 3D rec, 6 for 3D rec adaptive.\", TYPE_INT , &p },\n\t\t{ 't', \"-t T\", \"number of virtual threads to drive the partition.\", TYPE_INT , &t },\n\t\t{ 'b', \"-b B\", \"number of numa blocks per dimension for the numa placement\", TYPE_INT , &NBK },\n\t\tEND_OF_ARGUMENTS\n\t};\n\n\tparseArguments(argc,argv,as);\n\n\tif (NBK==-1) NBK = t;\n\/\/  typedef Givaro::Modular<Givaro::Integer> Field;\n\/\/  typedef Givaro::Modular<int64_t> Field;\n    typedef Givaro::Modular<double> Field;\n\/\/\ttypedef Givaro::Modular<float> Field;\n\/\/\ttypedef Givaro::ModularBalanced<float> Field;\n\/\/\ttypedef Givaro::ModularBalanced<double> Field;\n\/\/\ttypedef Givaro::Modular<Givaro::Integer> Field;\n\ttypedef Field::Element Element;\n\n  Field F(q);\n\n  Timer chrono, TimFreivalds;\n  double time=0.0, timev=0.0;\n\n  Element * A, * B, * C;\n\n  Field::RandIter G(F);\n  A = fflas_new(F,m,k,Alignment::CACHE_PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n  PAR_BLOCK { pfrand(F,G, m,k,A,m\/size_t(NBK)); }\t\n  \n  B = fflas_new(F,k,n,Alignment::CACHE_PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n  PAR_BLOCK { pfrand(F,G, k,n,B,k\/NBK); }\t\n\n  C = fflas_new(F,m,n,Alignment::CACHE_PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n  PAR_BLOCK { pfzero(F, m,n,C,m\/NBK); }\n  \n\n  for (size_t i=0;i<=iter;++i){\n\n      chrono.clear();\n      if (p && p!=7){\n\t      \/\/ CuttingStrategy meth = RECURSIVE;\n\t      \/\/ StrategyParameter strat = THREADS;\n\n\t      typedef CuttingStrategy::Block block;\n\t      typedef CuttingStrategy::Recursive rec;\n\t      typedef StrategyParameter::Threads threads;\n\t      typedef StrategyParameter::TwoD  twod;\n\t      typedef StrategyParameter::TwoDAdaptive  twoda;\n\t      typedef StrategyParameter::ThreeD  threed;\n\t      typedef StrategyParameter::ThreeDAdaptive  threeda;\n\t      typedef StrategyParameter::ThreeDInPlace  threedip;\n\t      PAR_BLOCK{\n              if (i) { chrono.start(); }\n              \n\t      switch (p){\n\t\t  case 1:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<block,threads> > WH(F,nbw, SPLITTER(t,block,threads));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;}\n\t\t  case 2:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,twod> > WH(F,nbw, SPLITTER(t,rec,twod));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  case 3:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,twoda> > WH(F,nbw, SPLITTER(t,rec,twoda));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  case 4:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,threedip> > WH(F,nbw, SPLITTER(t,rec,threedip));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  case 5:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,threed> > WH(F,nbw, SPLITTER(t,rec,threed));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  case 6:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,threeda> > WH(F,nbw, SPLITTER(t,rec,threeda));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  default:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<block,threads> > WH(F,nbw, SPLITTER(t,block,threads));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t      }\n\t\t  }\n\t      if (i) {chrono.stop(); time+=chrono.realtime();}\n      }else{\n\t      if(p==7){\n\n\t\t\t  int nrec = 0;\n\t\t\t  int dim = m;\n\t\t\t  \/\/                      if(dim < 19000)\n\t\t\t  nrec--;\n\t\t\t  while(dim >= __FFLASFFPACK_WINOTHRESHOLD*2){\n\t\t\t\t  dim=dim\/2;\n\t\t\t\t  nrec++;\n\t\t\t  }\n\t\t\t  nrec=std::max(1,nrec);\n\t\t\t  \/\/\t\t\t  std::cout<<\" WINO_THREShold\"<<__FFLASFFPACK_WINOTHRESHOLD<<\" nrec = \"<<nrec<<\" dim = \"<<dim<<std::endl;\n\t\t\t  if(nbw != -1)\n\t\t\t\t  nrec=nbw;\n\t\t\t  nbw=nrec;\n\t\t\t  if (i) chrono.start();\n\t\t\t  PAR_BLOCK\n\t\t\t  {\n\t\t\t\t  MMHelper<Field, MMHelperAlgo::WinogradPar,ModeTraits<Field>::value,ParSeqHelper::Parallel<> >  WH (F, nrec, ParSeqHelper::Parallel<>(t));\n\t\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n\t\t\t  }\n\t\t\t  if (i) {chrono.stop(); time+=chrono.realtime();}\n\t\t\t  \n\t\t\t  \n\t\t      \/\/ MMHelper<Field, MMHelperAlgo::WinogradPar>\n\t\t      \/\/ \t      WH (F, nbw, ParSeqHelper::Sequential());\n\t\t      \/\/ \t  \/\/\t\t      cout<<\"wino parallel\"<<endl;\n\t\t      \/\/ if (i) chrono.start();\n\t\t      \/\/ PAR_BLOCK\n\t\t      \/\/ {\n\t\t      \/\/ \t      fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n\t\t      \/\/ }\n\t\t      \/\/ if (i) {chrono.stop(); time+=chrono.realtime();}\n\t      }\n\t      else{\n\n\t\t      MMHelper<Field,MMHelperAlgo::Winograd>\/\/,\n\t\t\t\t\t  \/\/typename FieldTraits<Field>::value,\n\t\t\t\t\t  \/\/ParSeqHelper::Sequential>\n\t\t\t      WH (F, nbw, ParSeqHelper::Sequential());\n\t\t      if (i) chrono.start();\n\t\t      fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n\t\t      if (i) {chrono.stop(); time+=chrono.realtime();}\n\t      }\n  }\n\n      TimFreivalds.clear();\n      TimFreivalds.start();\n      \n      bool pass = freivalds(F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, C,n);\n      TimFreivalds.stop();\n      timev+=TimFreivalds.usertime();\n      if (!pass) \n\t      std::cout<<\"FAILED\"<<std::endl;\n}\n  fflas_delete( A);\n  fflas_delete( B);\n  fflas_delete( C);\n  \n\t\/\/ -----------\n\t\/\/ Standard output for benchmark - Alexis Breust 2014\/11\/14\n\tstd::cout << \"Time: \" << time \/ double(iter)\n\t\t\t  << \" Gfops: \" << (2.*double(m)\/1000.*double(n)\/1000.*double(k)\/1000.0) \/ time * double(iter);\n\twriteCommandString(std::cout, as) << std::endl;\n  \n#if __FFLASFFPACK_DEBUG\n        std::cout<<\"Freivalds vtime: \"<<timev\/(double)iter<<std::endl;\n#endif\n\n  return 0;\n}\n\n<commit_msg>median for bench fgemm<commit_after>\/* -*- mode: C++; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*- *\/\n\/\/ vim:sts=4:sw=4:ts=4:noet:sr:cino=>s,f0,{0,g0,(0,\\:0,t0,+0,=s\n\/\/#include \"goto-def.h\"\n\n\/* Copyright (c) FFLAS-FFPACK\n* Written by Clément Pernet <clement.pernet@imag.fr>\n* ========LICENCE========\n* This file is part of the library FFLAS-FFPACK.\n*\n* FFLAS-FFPACK is free software: you can redistribute it and\/or modify\n* 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* ========LICENCE========\n*\/\n\n\/\/ Please do not commit with any of these defines on - AB 2015-01-12\n\/\/#define __FFLASFFPACK_USE_TBB\n\/\/#define __FFLASFFPACK_USE_OPENMP \n\/\/#define __FFLASFFPACK_USE_DATAFLOW\n\/\/#define WINO_PARALLEL_TMPS\n\/\/#define __FFLASFFPACK_FORCE_SEQ\n\/\/#define PFGEMM_WINO_SEQ 32\n\/\/#define CLASSIC_SEQ\n#define CLASSIC_HYBRID\n\/\/#define WINO_SEQ\n\/\/#define FFT_PROFILER\n\/\/#define PROFILE_FGEMM_MP\n#include \"fflas-ffpack\/fflas-ffpack-config.h\"\n#include <iostream>\n#include <givaro\/modular-balanced.h>\n\n#include \"fflas-ffpack\/config-blas.h\"\n#include \"fflas-ffpack\/fflas\/fflas.h\"\n#include \"fflas-ffpack\/utils\/timer.h\"\n#include \"fflas-ffpack\/utils\/args-parser.h\"\n\n#ifdef __FFLASFFPACK_USE_KAAPI\n#include \"libkomp.h\"\n#endif\n\n\nusing namespace std;\nusing namespace FFLAS;\n\n\nint main(int argc, char** argv) {\n\n\tsize_t iter = 3 ;\n\tGivaro::Integer q = 131071 ;\n\tsize_t m = 2000 ;\n\tsize_t k = 2000 ;\n\tsize_t n = 2000 ;\n\tint nbw = -1 ;\n\tint p=0;\n\tint t=MAX_THREADS;\n\tint NBK = -1;\n\n\tArgument as[] = {\n\t\t{ 'q', \"-q Q\", \"Set the field characteristic (-1 for random).\",         TYPE_INTEGER , &q },\n\t\t{ 'm', \"-m M\", \"Set the row dimension of A.\",      TYPE_INT , &m },\n\t\t{ 'k', \"-k K\", \"Set the col dimension of A.\",      TYPE_INT , &k },\n\t\t{ 'n', \"-n N\", \"Set the col dimension of B.\",      TYPE_INT , &n },\n\t\t{ 'w', \"-w N\", \"Set the number of winograd levels (-1 for random).\",    TYPE_INT , &nbw },\n\t\t{ 'i', \"-i R\", \"Set number of repetitions.\",       TYPE_INT , &iter },\n\t\t{ 'p', \"-p P\", \"0 for sequential, 1 for 2D iterative, 2 for 2D rec, 3 for 2D rec adaptive, 4 for 3D rc in-place, 5 for 3D rec, 6 for 3D rec adaptive.\", TYPE_INT , &p },\n\t\t{ 't', \"-t T\", \"number of virtual threads to drive the partition.\", TYPE_INT , &t },\n\t\t{ 'b', \"-b B\", \"number of numa blocks per dimension for the numa placement\", TYPE_INT , &NBK },\n\t\tEND_OF_ARGUMENTS\n\t};\n\n\tparseArguments(argc,argv,as);\n\n\tif (NBK==-1) NBK = t;\n\/\/  typedef Givaro::Modular<Givaro::Integer> Field;\n\/\/  typedef Givaro::Modular<int64_t> Field;\n    typedef Givaro::Modular<double> Field;\n\/\/\ttypedef Givaro::Modular<float> Field;\n\/\/\ttypedef Givaro::ModularBalanced<float> Field;\n\/\/\ttypedef Givaro::ModularBalanced<double> Field;\n\/\/\ttypedef Givaro::Modular<Givaro::Integer> Field;\n\ttypedef Field::Element Element;\n\n  Field F(q);\n\n  Timer chrono, TimFreivalds;\n  double timev=0.0;\n  double *time=new double[iter];\n\n  Element * A, * B, * C;\n\n  Field::RandIter G(F);\n  A = fflas_new(F,m,k,Alignment::CACHE_PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n  PAR_BLOCK { pfrand(F,G, m,k,A,m\/size_t(NBK)); }\t\n  \n  B = fflas_new(F,k,n,Alignment::CACHE_PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n  PAR_BLOCK { pfrand(F,G, k,n,B,k\/NBK); }\t\n\n  C = fflas_new(F,m,n,Alignment::CACHE_PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n  PAR_BLOCK { pfzero(F, m,n,C,m\/NBK); }\n  \n\n  for (size_t i=0;i<=iter;++i){\n\n      chrono.clear();\n      if (p && p!=7){\n\t      \/\/ CuttingStrategy meth = RECURSIVE;\n\t      \/\/ StrategyParameter strat = THREADS;\n\n\t      typedef CuttingStrategy::Block block;\n\t      typedef CuttingStrategy::Recursive rec;\n\t      typedef StrategyParameter::Threads threads;\n\t      typedef StrategyParameter::TwoD  twod;\n\t      typedef StrategyParameter::TwoDAdaptive  twoda;\n\t      typedef StrategyParameter::ThreeD  threed;\n\t      typedef StrategyParameter::ThreeDAdaptive  threeda;\n\t      typedef StrategyParameter::ThreeDInPlace  threedip;\n\t      PAR_BLOCK{\n              if (i) { chrono.start(); }\n              \n\t      switch (p){\n\t\t  case 1:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<block,threads> > WH(F,nbw, SPLITTER(t,block,threads));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;}\n\t\t  case 2:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,twod> > WH(F,nbw, SPLITTER(t,rec,twod));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  case 3:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,twoda> > WH(F,nbw, SPLITTER(t,rec,twoda));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  case 4:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,threedip> > WH(F,nbw, SPLITTER(t,rec,threedip));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  case 5:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,threed> > WH(F,nbw, SPLITTER(t,rec,threed));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  case 6:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<rec,threeda> > WH(F,nbw, SPLITTER(t,rec,threeda));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t\t  default:{\n\t\t\t  MMHelper<Field, MMHelperAlgo::Winograd, typename ModeTraits<Field>::value, ParSeqHelper::Parallel<block,threads> > WH(F,nbw, SPLITTER(t,block,threads));\n\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n, WH);\n\t\t\t  break;\n\t\t  }\n\t      }\n\t\t  }\n\t      if (i) {chrono.stop(); time[i-1]=chrono.realtime();}\n      }else{\n\t      if(p==7){\n\n\t\t\t  int nrec = 0;\n\t\t\t  int dim = m;\n\t\t\t  \/\/                      if(dim < 19000)\n\t\t\t  nrec--;\n\t\t\t  while(dim >= __FFLASFFPACK_WINOTHRESHOLD*2){\n\t\t\t\t  dim=dim\/2;\n\t\t\t\t  nrec++;\n\t\t\t  }\n\t\t\t  nrec=std::max(1,nrec);\n\t\t\t  \/\/\t\t\t  std::cout<<\" WINO_THREShold\"<<__FFLASFFPACK_WINOTHRESHOLD<<\" nrec = \"<<nrec<<\" dim = \"<<dim<<std::endl;\n\t\t\t  if(nbw != -1)\n\t\t\t\t  nrec=nbw;\n\t\t\t  nbw=nrec;\n\t\t\t  if (i) chrono.start();\n\t\t\t  PAR_BLOCK\n\t\t\t  {\n\t\t\t\t  MMHelper<Field, MMHelperAlgo::WinogradPar,ModeTraits<Field>::value,ParSeqHelper::Parallel<> >  WH (F, nrec, ParSeqHelper::Parallel<>(t));\n\t\t\t\t  fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n\t\t\t  }\n\t\t\t  if (i) {chrono.stop(); time[i-1]=chrono.realtime();}\n\t\t\t  \n\t\t\t  \n\t\t      \/\/ MMHelper<Field, MMHelperAlgo::WinogradPar>\n\t\t      \/\/ \t      WH (F, nbw, ParSeqHelper::Sequential());\n\t\t      \/\/ \t  \/\/\t\t      cout<<\"wino parallel\"<<endl;\n\t\t      \/\/ if (i) chrono.start();\n\t\t      \/\/ PAR_BLOCK\n\t\t      \/\/ {\n\t\t      \/\/ \t      fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n\t\t      \/\/ }\n\t\t      \/\/ if (i) {chrono.stop(); time+=chrono.realtime();}\n\t      }\n\t      else{\n\n\t\t      MMHelper<Field,MMHelperAlgo::Winograd>\/\/,\n\t\t\t\t\t  \/\/typename FieldTraits<Field>::value,\n\t\t\t\t\t  \/\/ParSeqHelper::Sequential>\n\t\t\t      WH (F, nbw, ParSeqHelper::Sequential());\n\t\t      if (i) chrono.start();\n\t\t      fgemm (F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n\t\t      if (i) {chrono.stop(); time[i-1]=chrono.realtime();}\n\t      }\n  }\n\n      TimFreivalds.clear();\n      TimFreivalds.start();\n      \n      bool pass = freivalds(F, FflasNoTrans, FflasNoTrans, m,n,k, F.one, A, k, B, n, C,n);\n      TimFreivalds.stop();\n      timev+=TimFreivalds.usertime();\n      if (!pass) \n\t      std::cout<<\"FAILED\"<<std::endl;\n}\n  fflas_delete( A);\n  fflas_delete( B);\n  fflas_delete( C);\n  std::sort(time, time+iter);\n  double mediantime = time[iter\/2];\n  delete[] time;\n  \n\t\/\/ -----------\n\t\/\/ Standard output for benchmark - Alexis Breust 2014\/11\/14\n\tstd::cout << \"Time: \" << mediantime\n\t\t\t  << \" Gfops: \" << (2.*double(m)\/1000.*double(n)\/1000.*double(k)\/1000.0) \/ mediantime;\n\twriteCommandString(std::cout, as) << std::endl;\n  \n#if __FFLASFFPACK_DEBUG\n        std::cout<<\"Freivalds vtime: \"<<timev\/(double)iter<<std::endl;\n#endif\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream> \n#include <string> \n#include <fstream> \n#include <cstdint> \n\nusing namespace std;\n\ntemplate <typename T>\nstruct Node\n{\n\tNode *left;\n\tNode *right;\n\tT data;\n};\n\ntemplate <typename T>\nclass BinaryTree;\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream&, const BinaryTree<T>&);\n\ntemplate <typename T>\nclass BinaryTree\n{\nprivate:\n\tNode<T>*root;\n\tint count;\npublic:\n\tBinaryTree();\n\t~BinaryTree();\n\tNode<T>* root_();\n\tint getCount()const;\n\tvoid insert_node(const T&x);\n\tNode<T> *find_node(const T&, Node<T>*)const;\n\tvoid remove_element(const T& temp);\n\tvoid deleteNode(Node<T>* temp);\n\tNode<T>* _deleteRoot(Node<T>* temp);\n\tvoid writing(const std::string& filename)const;\n\tfriend std::ostream& operator<<<>(std::ostream&, const BinaryTree<T>&);\n};\n\ntemplate <typename T>\nBinaryTree<T>::BinaryTree()\n{\n\troot = nullptr;\n\tcount = 0;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::root_()\n{\n\treturn root;\n}\n\ntemplate <typename T>\nBinaryTree<T>::~BinaryTree()\n{\n\tdeleteNode(root);\n}\n\ntemplate <typename T>\nint BinaryTree<T>::getCount()const\n{\n\treturn count;\n}\n\n\ntemplate<typename T>\nvoid BinaryTree<T>::insert_node(const T&x)\n{\n\tif (find_node(x, root_())) return;\n\tNode<T>* MyTree = new Node<T>;\n\tMyTree->data = x;\n\tMyTree->left = MyTree->right = 0;\n\tNode<T>* buff = root;\n\tNode<T>* temp = root;\n\twhile (temp)\n\t{\n\t\tbuff = temp;\n\t\tif (x < temp->data)\n\t\t\ttemp = temp->left;\n\t\telse\n\t\t\ttemp = temp->right;\n\t}\n\tif (!buff)\n\t\troot = MyTree;\n\telse\n\t{\n\t\tif (x < buff->data)\n\t\t\tbuff->left = MyTree;\n\t\telse\n\t\t\tbuff->right = MyTree;\n\t}\n\t++count;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::find_node(const T& data, Node<T>* temp) const\n{\n\tif (temp == 0 || data == temp->data)\n\t\treturn temp;\n\tif (data > temp->data)\n\t\treturn find_node(data, temp->right);\n\telse\n\t\treturn find_node(data, temp->left);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::writing(const std::string& filename)const\n{\n\tofstream file_1(filename);\n\tfile_1 << count << \"\\t\";\n\toutput(file_1, root);\n\tfile_1.close();\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::deleteNode(Node<T>* temp)\n{\n\tif (!temp)\n\t{\n\t\tthrow \"error\";\n\t}\n\tif (temp->left)\n\t{\n\t\tdeleteNode(temp->left);\n\t\ttemp->left = nullptr;\n\t}\n\n\tif (temp->right)\n\t{\n\t\tdeleteNode(temp->right);\n\t\ttemp->right = nullptr;\n\t}\n\tdelete temp;\n}\n\ntemplate <typename T>\nstd::ostream& output(std::ostream& ost, const Node<T>* node, unsigned int level)\n{\n\tif (!node)\n\t\treturn ost;\n\toutput(ost, node->right, level + 1);\n\tfor (unsigned int i = 0; i < level; i++)\n\t\tost << \"\\t\";\n\tost << node->data << std::endl;\n\toutput(ost, node->left, level + 1);\n\treturn ost;\n}\n\ntemplate <typename T>\nNode<T>* BinaryTree<T>::_deleteRoot(Node<T>* temp)\n{\n\tNode<T>* buff, *parent;\n\tif (temp)\n\t{\n\t\tbuff = temp->right;\n\t\tif (!buff)\n\t\t{\n\t\t\tbuff = temp->left;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (buff->left)\n\t\t\t{\n\t\t\t\tparent = temp;\n\t\t\t\twhile (buff->left)\n\t\t\t\t{\n\t\t\t\t\tparent = buff;\n\t\t\t\t\tbuff = buff->left;\n\t\t\t\t}\n\t\t\t\tparent->left = buff->right;\n\t\t\t\tbuff->right = temp->right;\n\t\t\t}\n\t\t\tbuff->left = temp->left;\n\t\t}\n\t\tdelete temp;\n\t\treturn buff;\n\t}\n\treturn nullptr;\n}\n\ntemplate <typename T>\nvoid BinaryTree<T>::remove_element(const T& temp)\n{\n\tNode<T>* buff = root, *parent;\n\tif (root)\n\t{\n\t\tif (root->data == temp)\n\t\t{\n\t\t\troot = _deleteRoot(root);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tparent = root;\n\t\t\tif (temp < parent->data) buff = parent->left;\n\t\t\telse buff = parent->right;\n\t\t\twhile (buff)\n\t\t\t{\n\t\t\t\tif (buff->data == temp)\n\t\t\t\t\t{\n\t\t\t\t\tif (temp < parent->data) parent->left = _deleteRoot(parent->left);\n\t\t\t\t\telse parent->right = _deleteRoot(parent->right);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tparent = buff;\n\t\t\t\tif (temp < parent->data) buff = parent->left;\n\t\t\t\telse buff = parent->right;\n\t\t\t}\n\t\t}\n\t}\n\t--count;\n}\n\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& ost, const BinaryTree<T>& temp)\n{\n\toutput(ost, temp.root, 0);\n\treturn ost;\n}\n\n\n<commit_msg>Update BinaryTree.hpp<commit_after>#include <iostream> \n#include <string> \n#include <fstream> \n#include <cstdint> \n\nusing namespace std;\n\ntemplate <typename T>\nstruct Node\n{\n\tNode *left;\n\tNode *right;\n\tT data;\n};\n\ntemplate <typename T>\nclass BinaryTree;\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream&, const BinaryTree<T>&);\n\ntemplate <typename T>\nclass BinaryTree\n{\nprivate:\n\tNode<T>*root;\n\tint count;\npublic:\n\tBinaryTree();\n\t~BinaryTree();\n\tNode<T>* root_();\n\tunsigned int getCount()const;\n\tvoid insert_node(const T&x);\n\tNode<T> *find_node(const T&, Node<T>*)const;\n\tvoid remove_element(const T& temp);\n\tvoid deleteNode(Node<T>* temp);\n\tNode<T>* _deleteRoot(Node<T>* temp);\n\tvoid writing(const std::string& filename)const;\n\tfriend std::ostream& operator<<<>(std::ostream&, const BinaryTree<T>&);\n};\n\ntemplate <typename T>\nBinaryTree<T>::BinaryTree()\n{\n\troot = nullptr;\n\tcount = 0;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::root_()\n{\n\treturn root;\n}\n\ntemplate <typename T>\nBinaryTree<T>::~BinaryTree()\n{\n\tdeleteNode(root);\n}\n\ntemplate <typename T>\nunsigned int BinaryTree<T>::getCount()const\n{\n\treturn count;\n}\n\n\ntemplate<typename T>\nvoid BinaryTree<T>::insert_node(const T&x)\n{\n\tif (find_node(x, root_())) return;\n\tNode<T>* MyTree = new Node<T>;\n\tMyTree->data = x;\n\tMyTree->left = MyTree->right = 0;\n\tNode<T>* buff = root;\n\tNode<T>* temp = root;\n\twhile (temp)\n\t{\n\t\tbuff = temp;\n\t\tif (x < temp->data)\n\t\t\ttemp = temp->left;\n\t\telse\n\t\t\ttemp = temp->right;\n\t}\n\tif (!buff)\n\t\troot = MyTree;\n\telse\n\t{\n\t\tif (x < buff->data)\n\t\t\tbuff->left = MyTree;\n\t\telse\n\t\t\tbuff->right = MyTree;\n\t}\n\t++count;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::find_node(const T& data, Node<T>* temp) const\n{\n\tif (temp == 0 || data == temp->data)\n\t\treturn temp;\n\tif (data > temp->data)\n\t\treturn find_node(data, temp->right);\n\telse\n\t\treturn find_node(data, temp->left);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::writing(const std::string& filename)const\n{\n\tofstream file_1(filename);\n\tfile_1 << count << \"\\t\";\n\toutput(file_1, root);\n\tfile_1.close();\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::deleteNode(Node<T>* temp)\n{\n\tif (!temp)\n\t{\n\t\tthrow \"error\";\n\t}\n\tif (temp->left)\n\t{\n\t\tdeleteNode(temp->left);\n\t\ttemp->left = nullptr;\n\t}\n\n\tif (temp->right)\n\t{\n\t\tdeleteNode(temp->right);\n\t\ttemp->right = nullptr;\n\t}\n\tdelete temp;\n}\n\ntemplate <typename T>\nstd::ostream& output(std::ostream& ost, const Node<T>* node, unsigned int level)\n{\n\tif (!node)\n\t\treturn ost;\n\toutput(ost, node->right, level + 1);\n\tfor (unsigned int i = 0; i < level; i++)\n\t\tost << \"\\t\";\n\tost << node->data << std::endl;\n\toutput(ost, node->left, level + 1);\n\treturn ost;\n}\n\ntemplate <typename T>\nNode<T>* BinaryTree<T>::_deleteRoot(Node<T>* temp)\n{\n\tNode<T>* buff, *parent;\n\tif (temp)\n\t{\n\t\tbuff = temp->right;\n\t\tif (!buff)\n\t\t{\n\t\t\tbuff = temp->left;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (buff->left)\n\t\t\t{\n\t\t\t\tparent = temp;\n\t\t\t\twhile (buff->left)\n\t\t\t\t{\n\t\t\t\t\tparent = buff;\n\t\t\t\t\tbuff = buff->left;\n\t\t\t\t}\n\t\t\t\tparent->left = buff->right;\n\t\t\t\tbuff->right = temp->right;\n\t\t\t}\n\t\t\tbuff->left = temp->left;\n\t\t}\n\t\tdelete temp;\n\t\treturn buff;\n\t}\n\treturn nullptr;\n}\n\ntemplate <typename T>\nvoid BinaryTree<T>::remove_element(const T& temp)\n{\n\tNode<T>* buff = root, *parent;\n\tif (root)\n\t{\n\t\tif (root->data == temp)\n\t\t{\n\t\t\troot = _deleteRoot(root);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tparent = root;\n\t\t\tif (temp < parent->data) buff = parent->left;\n\t\t\telse buff = parent->right;\n\t\t\twhile (buff)\n\t\t\t{\n\t\t\t\tif (buff->data == temp)\n\t\t\t\t\t{\n\t\t\t\t\tif (temp < parent->data) parent->left = _deleteRoot(parent->left);\n\t\t\t\t\telse parent->right = _deleteRoot(parent->right);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tparent = buff;\n\t\t\t\tif (temp < parent->data) buff = parent->left;\n\t\t\t\telse buff = parent->right;\n\t\t\t}\n\t\t}\n\t}\n\t--count;\n}\n\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& ost, const BinaryTree<T>& temp)\n{\n\toutput(ost, temp.root, 0);\n\treturn ost;\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\n#include <sal\/types.h>\n#include <assert.h>\n\n#include <premac.h>\n#ifndef IOS\n#include <CoreServices\/CoreServices.h>\n#endif\n#include <CoreFoundation\/CoreFoundation.h>\n#include <postmac.h>\n\nnamespace \/* private *\/\n{\n    template <typename T>\n    class CFGuard\n    {\n    public:\n        explicit CFGuard(T& rT) : rT_(rT) {}\n        ~CFGuard() { if (rT_) CFRelease(rT_); }\n    private:\n        T& rT_;\n    };\n\n    typedef CFGuard<CFArrayRef> CFArrayGuard;\n    typedef CFGuard<CFStringRef> CFStringGuard;\n    typedef CFGuard<CFPropertyListRef> CFPropertyListGuard;\n\n    \/** Get the current process locale from system\n    *\/\n    CFStringRef getProcessLocale()\n    {\n        CFPropertyListRef pref = CFPreferencesCopyAppValue(CFSTR(\"AppleLocale\"), kCFPreferencesCurrentApplication);\n        CFPropertyListGuard proplGuard(pref);\n\n        if (pref == NULL) \/\/ return fallback value 'en_US'\n             return CFStringCreateWithCString(kCFAllocatorDefault, \"en_US\", kCFStringEncodingASCII);\n\n        CFStringRef sref = (CFGetTypeID(pref) == CFArrayGetTypeID()) ? (CFStringRef)CFArrayGetValueAtIndex((CFArrayRef)pref, 0) : (CFStringRef)pref;\n\n        \/\/ NOTE: this API is only available with Mac OS X >=10.3. We need to use it because\n        \/\/ Apple used non-ISO values on systems <10.2 like \"German\" for instance but didn't\n        \/\/ upgrade those values during upgrade to newer Mac OS X versions. See also #i54337#\n        return CFLocaleCreateCanonicalLocaleIdentifierFromString(kCFAllocatorDefault, sref);\n    }\n} \/\/ namespace private\n\n\/** Grab current locale from system.\n*\/\nextern \"C\" {\nint macosx_getLocale(char *locale, sal_uInt32 bufferLen)\n{\n    CFStringRef sref = getProcessLocale();\n    CFStringGuard sGuard(sref);\n\n    assert(sref != NULL && \"osxlocale.cxx: getProcessLocale must return a non-NULL value\");\n\n    \/\/ split the string into substrings; the first two (if there are two) substrings\n    \/\/ are language and country\n    CFArrayRef subs = CFStringCreateArrayBySeparatingStrings(NULL, sref, CFSTR(\"_\"));\n    CFArrayGuard arrGuard(subs);\n\n    CFStringRef lang = (CFStringRef)CFArrayGetValueAtIndex(subs, 0);\n    CFStringGetCString(lang, locale, bufferLen, kCFStringEncodingASCII);\n\n    \/\/ country also available? Assumption: if the array contains more than one\n    \/\/ value the second value is always the country!\n    if (CFArrayGetCount(subs) > 1)\n    {\n        strlcat(locale, \"_\", bufferLen - strlen(locale));\n\n        CFStringRef country = (CFStringRef)CFArrayGetValueAtIndex(subs, 1);\n        CFStringGetCString(country, locale + strlen(locale), bufferLen - strlen(locale), kCFStringEncodingASCII);\n    }\n    \/\/ Append 'UTF-8' to the locale because the Mac OS X file\n    \/\/ system interface is UTF-8 based and sal tries to determine\n    \/\/ the file system locale from the locale information\n    strlcat(locale, \".UTF-8\", bufferLen - strlen(locale));\n\n    return noErr;\n}\n}\n\n\n\n\/*\n * macxp_OSXConvertCFEncodingToIANACharSetName\n *\n * Convert a CoreFoundation text encoding to an IANA charset name.\n *\/\nextern \"C\" int macxp_OSXConvertCFEncodingToIANACharSetName( char *buffer, unsigned int bufferLen, CFStringEncoding cfEncoding )\n{\n    CFStringRef sCFEncodingName;\n\n    sCFEncodingName = CFStringConvertEncodingToIANACharSetName( cfEncoding );\n    CFStringGetCString( sCFEncodingName, buffer, bufferLen, cfEncoding );\n\n    if ( sCFEncodingName )\n        CFRelease( sCFEncodingName );\n\n    return( noErr );\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Bin obsolete comment<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\n#include <sal\/types.h>\n#include <assert.h>\n\n#include <premac.h>\n#ifndef IOS\n#include <CoreServices\/CoreServices.h>\n#endif\n#include <CoreFoundation\/CoreFoundation.h>\n#include <postmac.h>\n\nnamespace \/* private *\/\n{\n    template <typename T>\n    class CFGuard\n    {\n    public:\n        explicit CFGuard(T& rT) : rT_(rT) {}\n        ~CFGuard() { if (rT_) CFRelease(rT_); }\n    private:\n        T& rT_;\n    };\n\n    typedef CFGuard<CFArrayRef> CFArrayGuard;\n    typedef CFGuard<CFStringRef> CFStringGuard;\n    typedef CFGuard<CFPropertyListRef> CFPropertyListGuard;\n\n    \/** Get the current process locale from system\n    *\/\n    CFStringRef getProcessLocale()\n    {\n        CFPropertyListRef pref = CFPreferencesCopyAppValue(CFSTR(\"AppleLocale\"), kCFPreferencesCurrentApplication);\n        CFPropertyListGuard proplGuard(pref);\n\n        if (pref == NULL) \/\/ return fallback value 'en_US'\n             return CFStringCreateWithCString(kCFAllocatorDefault, \"en_US\", kCFStringEncodingASCII);\n\n        CFStringRef sref = (CFGetTypeID(pref) == CFArrayGetTypeID()) ? (CFStringRef)CFArrayGetValueAtIndex((CFArrayRef)pref, 0) : (CFStringRef)pref;\n\n        return CFLocaleCreateCanonicalLocaleIdentifierFromString(kCFAllocatorDefault, sref);\n    }\n} \/\/ namespace private\n\n\/** Grab current locale from system.\n*\/\nextern \"C\" {\nint macosx_getLocale(char *locale, sal_uInt32 bufferLen)\n{\n    CFStringRef sref = getProcessLocale();\n    CFStringGuard sGuard(sref);\n\n    assert(sref != NULL && \"osxlocale.cxx: getProcessLocale must return a non-NULL value\");\n\n    \/\/ split the string into substrings; the first two (if there are two) substrings\n    \/\/ are language and country\n    CFArrayRef subs = CFStringCreateArrayBySeparatingStrings(NULL, sref, CFSTR(\"_\"));\n    CFArrayGuard arrGuard(subs);\n\n    CFStringRef lang = (CFStringRef)CFArrayGetValueAtIndex(subs, 0);\n    CFStringGetCString(lang, locale, bufferLen, kCFStringEncodingASCII);\n\n    \/\/ country also available? Assumption: if the array contains more than one\n    \/\/ value the second value is always the country!\n    if (CFArrayGetCount(subs) > 1)\n    {\n        strlcat(locale, \"_\", bufferLen - strlen(locale));\n\n        CFStringRef country = (CFStringRef)CFArrayGetValueAtIndex(subs, 1);\n        CFStringGetCString(country, locale + strlen(locale), bufferLen - strlen(locale), kCFStringEncodingASCII);\n    }\n    \/\/ Append 'UTF-8' to the locale because the Mac OS X file\n    \/\/ system interface is UTF-8 based and sal tries to determine\n    \/\/ the file system locale from the locale information\n    strlcat(locale, \".UTF-8\", bufferLen - strlen(locale));\n\n    return noErr;\n}\n}\n\n\n\n\/*\n * macxp_OSXConvertCFEncodingToIANACharSetName\n *\n * Convert a CoreFoundation text encoding to an IANA charset name.\n *\/\nextern \"C\" int macxp_OSXConvertCFEncodingToIANACharSetName( char *buffer, unsigned int bufferLen, CFStringEncoding cfEncoding )\n{\n    CFStringRef sCFEncodingName;\n\n    sCFEncodingName = CFStringConvertEncodingToIANACharSetName( cfEncoding );\n    CFStringGetCString( sCFEncodingName, buffer, bufferLen, cfEncoding );\n\n    if ( sCFEncodingName )\n        CFRelease( sCFEncodingName );\n\n    return( noErr );\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2013 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 \"SkGpuBlurUtils.h\"\n\n#include \"SkRect.h\"\n\n#if SK_SUPPORT_GPU\n#include \"effects\/GrConvolutionEffect.h\"\n#include \"effects\/GrTextureDomainEffect.h\"\n#include \"GrContext.h\"\n#endif\n\nnamespace SkGpuBlurUtils {\n\n#if SK_SUPPORT_GPU\n\n#define MAX_BLUR_SIGMA 4.0f\n\nstatic void scale_rect(SkRect* rect, float xScale, float yScale) {\n    rect->fLeft   = SkScalarMul(rect->fLeft,   SkFloatToScalar(xScale));\n    rect->fTop    = SkScalarMul(rect->fTop,    SkFloatToScalar(yScale));\n    rect->fRight  = SkScalarMul(rect->fRight,  SkFloatToScalar(xScale));\n    rect->fBottom = SkScalarMul(rect->fBottom, SkFloatToScalar(yScale));\n}\n\nstatic float adjust_sigma(float sigma, int *scaleFactor, int *radius) {\n    *scaleFactor = 1;\n    while (sigma > MAX_BLUR_SIGMA) {\n        *scaleFactor *= 2;\n        sigma *= 0.5f;\n    }\n    *radius = static_cast<int>(ceilf(sigma * 3.0f));\n    GrAssert(*radius <= GrConvolutionEffect::kMaxKernelRadius);\n    return sigma;\n}\n\nstatic void convolve_gaussian(GrContext* context,\n                              GrTexture* texture,\n                              const SkRect& srcRect,\n                              const SkRect& dstRect,\n                              bool cropToSrcRect,\n                              float sigma,\n                              int radius,\n                              Gr1DKernelEffect::Direction direction) {\n    GrPaint paint;\n    paint.reset();\n    float bounds[2] = { 0.0f, 1.0f };\n    if (cropToSrcRect) {\n        if (direction == Gr1DKernelEffect::kX_Direction) {\n            bounds[0] = SkScalarToFloat(srcRect.left()) \/ texture->width();\n            bounds[1] = SkScalarToFloat(srcRect.right()) \/ texture->width();\n        } else {\n            bounds[0] = SkScalarToFloat(srcRect.top()) \/ texture->height();\n            bounds[1] = SkScalarToFloat(srcRect.bottom()) \/ texture->height();\n        }\n    }\n\n    SkAutoTUnref<GrEffectRef> conv(GrConvolutionEffect::CreateGaussian(texture,\n                                                                       direction,\n                                                                       radius,\n                                                                       sigma,\n                                                                       cropToSrcRect,\n                                                                       bounds));\n    paint.addColorEffect(conv);\n    context->drawRectToRect(paint, dstRect, srcRect);\n}\n\nGrTexture* GaussianBlur(GrContext* context,\n                        GrTexture* srcTexture,\n                        bool canClobberSrc,\n                        const SkRect& rect,\n                        bool cropToRect,\n                        float sigmaX,\n                        float sigmaY) {\n    GrAssert(NULL != context);\n\n    GrContext::AutoRenderTarget art(context);\n\n    GrContext::AutoMatrix am;\n    am.setIdentity(context);\n\n    SkIRect clearRect;\n    int scaleFactorX, radiusX;\n    int scaleFactorY, radiusY;\n    sigmaX = adjust_sigma(sigmaX, &scaleFactorX, &radiusX);\n    sigmaY = adjust_sigma(sigmaY, &scaleFactorY, &radiusY);\n\n    SkRect srcRect(rect);\n    scale_rect(&srcRect, 1.0f \/ scaleFactorX, 1.0f \/ scaleFactorY);\n    srcRect.roundOut();\n    scale_rect(&srcRect, static_cast<float>(scaleFactorX),\n                         static_cast<float>(scaleFactorY));\n\n    GrContext::AutoClip acs(context, SkRect::MakeWH(srcRect.width(), srcRect.height()));\n\n    GrAssert(kBGRA_8888_GrPixelConfig == srcTexture->config() ||\n             kRGBA_8888_GrPixelConfig == srcTexture->config() ||\n             kAlpha_8_GrPixelConfig == srcTexture->config());\n\n    GrTextureDesc desc;\n    desc.fFlags = kRenderTarget_GrTextureFlagBit | kNoStencil_GrTextureFlagBit;\n    desc.fWidth = SkScalarFloorToInt(srcRect.width());\n    desc.fHeight = SkScalarFloorToInt(srcRect.height());\n    desc.fConfig = srcTexture->config();\n\n    GrAutoScratchTexture temp1, temp2;\n    GrTexture* dstTexture = temp1.set(context, desc);\n    GrTexture* tempTexture = canClobberSrc ? srcTexture : temp2.set(context, desc);\n    if (NULL == dstTexture || NULL == tempTexture) {\n        return NULL;\n    }\n\n    for (int i = 1; i < scaleFactorX || i < scaleFactorY; i *= 2) {\n        GrPaint paint;\n        SkMatrix matrix;\n        matrix.setIDiv(srcTexture->width(), srcTexture->height());\n        context->setRenderTarget(dstTexture->asRenderTarget());\n        SkRect dstRect(srcRect);\n        if (cropToRect && i == 1) {\n            dstRect.offset(-dstRect.fLeft, -dstRect.fTop);\n            SkRect domain;\n            matrix.mapRect(&domain, rect);\n            domain.inset(i < scaleFactorX ? SK_ScalarHalf \/ srcTexture->width() : 0.0f,\n                         i < scaleFactorY ? SK_ScalarHalf \/ srcTexture->height() : 0.0f);\n            SkAutoTUnref<GrEffectRef> effect(GrTextureDomainEffect::Create(\n                srcTexture,\n                matrix,\n                domain,\n                GrTextureDomainEffect::kDecal_WrapMode,\n                GrTextureParams::kBilerp_FilterMode));\n            paint.addColorEffect(effect);\n        } else {\n            GrTextureParams params(SkShader::kClamp_TileMode, GrTextureParams::kBilerp_FilterMode);\n            paint.addColorTextureEffect(srcTexture, matrix, params);\n        }\n        scale_rect(&dstRect, i < scaleFactorX ? 0.5f : 1.0f,\n                             i < scaleFactorY ? 0.5f : 1.0f);\n        context->drawRectToRect(paint, dstRect, srcRect);\n        srcRect = dstRect;\n        srcTexture = dstTexture;\n        SkTSwap(dstTexture, tempTexture);\n    }\n\n    SkIRect srcIRect;\n    srcRect.roundOut(&srcIRect);\n\n    if (sigmaX > 0.0f) {\n        if (scaleFactorX > 1) {\n            \/\/ Clear out a radius to the right of the srcRect to prevent the\n            \/\/ X convolution from reading garbage.\n            clearRect = SkIRect::MakeXYWH(srcIRect.fRight, srcIRect.fTop,\n                                          radiusX, srcIRect.height());\n            context->clear(&clearRect, 0x0);\n        }\n        context->setRenderTarget(dstTexture->asRenderTarget());\n        SkRect dstRect = SkRect::MakeWH(srcRect.width(), srcRect.height());\n        convolve_gaussian(context, srcTexture, srcRect, dstRect, cropToRect,\n                          sigmaX, radiusX, Gr1DKernelEffect::kX_Direction);\n        srcTexture = dstTexture;\n        srcRect = dstRect;\n        SkTSwap(dstTexture, tempTexture);\n    }\n\n    if (sigmaY > 0.0f) {\n        if (scaleFactorY > 1 || sigmaX > 0.0f) {\n            \/\/ Clear out a radius below the srcRect to prevent the Y\n            \/\/ convolution from reading garbage.\n            clearRect = SkIRect::MakeXYWH(srcIRect.fLeft, srcIRect.fBottom,\n                                          srcIRect.width(), radiusY);\n            context->clear(&clearRect, 0x0);\n        }\n\n        context->setRenderTarget(dstTexture->asRenderTarget());\n        SkRect dstRect = SkRect::MakeWH(srcRect.width(), srcRect.height());\n        convolve_gaussian(context, srcTexture, srcRect, dstRect, cropToRect,\n                          sigmaY, radiusY, Gr1DKernelEffect::kY_Direction);\n        srcTexture = dstTexture;\n        srcRect = dstRect;\n        SkTSwap(dstTexture, tempTexture);\n    }\n\n    if (scaleFactorX > 1 || scaleFactorY > 1) {\n        \/\/ Clear one pixel to the right and below, to accommodate bilinear\n        \/\/ upsampling.\n        clearRect = SkIRect::MakeXYWH(srcIRect.fLeft, srcIRect.fBottom,\n                                      srcIRect.width() + 1, 1);\n        context->clear(&clearRect, 0x0);\n        clearRect = SkIRect::MakeXYWH(srcIRect.fRight, srcIRect.fTop,\n                                      1, srcIRect.height());\n        context->clear(&clearRect, 0x0);\n        SkMatrix matrix;\n        matrix.setIDiv(srcTexture->width(), srcTexture->height());\n        context->setRenderTarget(dstTexture->asRenderTarget());\n\n        GrPaint paint;\n        \/\/ FIXME:  this should be mitchell, not bilinear.\n        GrTextureParams params(SkShader::kClamp_TileMode, GrTextureParams::kBilerp_FilterMode);\n        paint.addColorTextureEffect(srcTexture, matrix, params);\n\n        SkRect dstRect(srcRect);\n        scale_rect(&dstRect, (float) scaleFactorX, (float) scaleFactorY);\n        context->drawRectToRect(paint, dstRect, srcRect);\n        srcRect = dstRect;\n        srcTexture = dstTexture;\n        SkTSwap(dstTexture, tempTexture);\n    }\n    if (srcTexture == temp1.texture()) {\n        return temp1.detach();\n    } else if (srcTexture == temp2.texture()) {\n        return temp2.detach();\n    } else {\n        srcTexture->ref();\n        return srcTexture;\n    }\n}\n#endif\n\n}\n<commit_msg>Optimize the blur convolution by only applying domain clamping where necessary.  Split the blur convolution into left and right margins which have clamping applied and a center portion which doesn't. Also reorder the convolve_gaussian() parameters to match GrConvolutionEffect params. Correctness is covered by existing tests; performance is covered by BlurImageFilter bench.<commit_after>\/*\n * Copyright 2013 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 \"SkGpuBlurUtils.h\"\n\n#include \"SkRect.h\"\n\n#if SK_SUPPORT_GPU\n#include \"effects\/GrConvolutionEffect.h\"\n#include \"effects\/GrTextureDomainEffect.h\"\n#include \"GrContext.h\"\n#endif\n\nnamespace SkGpuBlurUtils {\n\n#if SK_SUPPORT_GPU\n\n#define MAX_BLUR_SIGMA 4.0f\n\nstatic void scale_rect(SkRect* rect, float xScale, float yScale) {\n    rect->fLeft   = SkScalarMul(rect->fLeft,   SkFloatToScalar(xScale));\n    rect->fTop    = SkScalarMul(rect->fTop,    SkFloatToScalar(yScale));\n    rect->fRight  = SkScalarMul(rect->fRight,  SkFloatToScalar(xScale));\n    rect->fBottom = SkScalarMul(rect->fBottom, SkFloatToScalar(yScale));\n}\n\nstatic float adjust_sigma(float sigma, int *scaleFactor, int *radius) {\n    *scaleFactor = 1;\n    while (sigma > MAX_BLUR_SIGMA) {\n        *scaleFactor *= 2;\n        sigma *= 0.5f;\n    }\n    *radius = static_cast<int>(ceilf(sigma * 3.0f));\n    GrAssert(*radius <= GrConvolutionEffect::kMaxKernelRadius);\n    return sigma;\n}\n\nstatic void convolve_gaussian_pass(GrContext* context,\n                                   const SkRect& srcRect,\n                                   const SkRect& dstRect,\n                                   GrTexture* texture,\n                                   Gr1DKernelEffect::Direction direction,\n                                   int radius,\n                                   float sigma,\n                                   bool useBounds,\n                                   float bounds[2]) {\n    GrPaint paint;\n    paint.reset();\n    SkAutoTUnref<GrEffectRef> conv(GrConvolutionEffect::CreateGaussian(\n        texture, direction, radius, sigma, useBounds, bounds));\n    paint.reset();\n    paint.addColorEffect(conv);\n    context->drawRectToRect(paint, dstRect, srcRect);\n}\n\nstatic void convolve_gaussian(GrContext* context,\n                              const SkRect& srcRect,\n                              const SkRect& dstRect,\n                              GrTexture* texture,\n                              Gr1DKernelEffect::Direction direction,\n                              int radius,\n                              float sigma,\n                              bool cropToSrcRect) {\n    float bounds[2] = { 0.0f, 1.0f };\n    if (!cropToSrcRect) {\n        convolve_gaussian_pass(context, srcRect, dstRect, texture,\n                          direction, radius, sigma, false, bounds);\n        return;\n    }\n    SkRect lowerSrcRect = srcRect, lowerDstRect = dstRect;\n    SkRect middleSrcRect = srcRect, middleDstRect = dstRect;\n    SkRect upperSrcRect = srcRect, upperDstRect = dstRect;\n    SkScalar size;\n    SkScalar rad = SkIntToScalar(radius);\n    if (direction == Gr1DKernelEffect::kX_Direction) {\n        bounds[0] = SkScalarToFloat(srcRect.left()) \/ texture->width();\n        bounds[1] = SkScalarToFloat(srcRect.right()) \/ texture->width();\n        size = srcRect.width();\n        lowerSrcRect.fRight = srcRect.left() + rad;\n        lowerDstRect.fRight = dstRect.left() + rad;\n        upperSrcRect.fLeft = srcRect.right() - rad;\n        upperDstRect.fLeft = dstRect.right() - rad;\n        middleSrcRect.inset(rad, 0);\n        middleDstRect.inset(rad, 0);\n    } else {\n        bounds[0] = SkScalarToFloat(srcRect.top()) \/ texture->height();\n        bounds[1] = SkScalarToFloat(srcRect.bottom()) \/ texture->height();\n        size = srcRect.height();\n        lowerSrcRect.fBottom = srcRect.top() + rad;\n        lowerDstRect.fBottom = dstRect.top() + rad;\n        upperSrcRect.fTop = srcRect.bottom() - rad;\n        upperDstRect.fTop = dstRect.bottom() - rad;\n        middleSrcRect.inset(0, rad);\n        middleDstRect.inset(0, rad);\n    }\n    if (radius >= size * SK_ScalarHalf) {\n        \/\/ Blur radius covers srcRect; use bounds over entire draw\n        convolve_gaussian_pass(context, srcRect, dstRect, texture,\n                          direction, radius, sigma, true, bounds);\n    } else {\n        \/\/ Draw upper and lower margins with bounds; middle without.\n        convolve_gaussian_pass(context, lowerSrcRect, lowerDstRect, texture,\n                          direction, radius, sigma, true, bounds);\n        convolve_gaussian_pass(context, upperSrcRect, upperDstRect, texture,\n                          direction, radius, sigma, true, bounds);\n        convolve_gaussian_pass(context, middleSrcRect, middleDstRect, texture,\n                          direction, radius, sigma, false, bounds);\n    }\n}\n\nGrTexture* GaussianBlur(GrContext* context,\n                        GrTexture* srcTexture,\n                        bool canClobberSrc,\n                        const SkRect& rect,\n                        bool cropToRect,\n                        float sigmaX,\n                        float sigmaY) {\n    GrAssert(NULL != context);\n\n    GrContext::AutoRenderTarget art(context);\n\n    GrContext::AutoMatrix am;\n    am.setIdentity(context);\n\n    SkIRect clearRect;\n    int scaleFactorX, radiusX;\n    int scaleFactorY, radiusY;\n    sigmaX = adjust_sigma(sigmaX, &scaleFactorX, &radiusX);\n    sigmaY = adjust_sigma(sigmaY, &scaleFactorY, &radiusY);\n\n    SkRect srcRect(rect);\n    scale_rect(&srcRect, 1.0f \/ scaleFactorX, 1.0f \/ scaleFactorY);\n    srcRect.roundOut();\n    scale_rect(&srcRect, static_cast<float>(scaleFactorX),\n                         static_cast<float>(scaleFactorY));\n\n    GrContext::AutoClip acs(context, SkRect::MakeWH(srcRect.width(), srcRect.height()));\n\n    GrAssert(kBGRA_8888_GrPixelConfig == srcTexture->config() ||\n             kRGBA_8888_GrPixelConfig == srcTexture->config() ||\n             kAlpha_8_GrPixelConfig == srcTexture->config());\n\n    GrTextureDesc desc;\n    desc.fFlags = kRenderTarget_GrTextureFlagBit | kNoStencil_GrTextureFlagBit;\n    desc.fWidth = SkScalarFloorToInt(srcRect.width());\n    desc.fHeight = SkScalarFloorToInt(srcRect.height());\n    desc.fConfig = srcTexture->config();\n\n    GrAutoScratchTexture temp1, temp2;\n    GrTexture* dstTexture = temp1.set(context, desc);\n    GrTexture* tempTexture = canClobberSrc ? srcTexture : temp2.set(context, desc);\n    if (NULL == dstTexture || NULL == tempTexture) {\n        return NULL;\n    }\n\n    for (int i = 1; i < scaleFactorX || i < scaleFactorY; i *= 2) {\n        GrPaint paint;\n        SkMatrix matrix;\n        matrix.setIDiv(srcTexture->width(), srcTexture->height());\n        context->setRenderTarget(dstTexture->asRenderTarget());\n        SkRect dstRect(srcRect);\n        if (cropToRect && i == 1) {\n            dstRect.offset(-dstRect.fLeft, -dstRect.fTop);\n            SkRect domain;\n            matrix.mapRect(&domain, rect);\n            domain.inset(i < scaleFactorX ? SK_ScalarHalf \/ srcTexture->width() : 0.0f,\n                         i < scaleFactorY ? SK_ScalarHalf \/ srcTexture->height() : 0.0f);\n            SkAutoTUnref<GrEffectRef> effect(GrTextureDomainEffect::Create(\n                srcTexture,\n                matrix,\n                domain,\n                GrTextureDomainEffect::kDecal_WrapMode,\n                GrTextureParams::kBilerp_FilterMode));\n            paint.addColorEffect(effect);\n        } else {\n            GrTextureParams params(SkShader::kClamp_TileMode, GrTextureParams::kBilerp_FilterMode);\n            paint.addColorTextureEffect(srcTexture, matrix, params);\n        }\n        scale_rect(&dstRect, i < scaleFactorX ? 0.5f : 1.0f,\n                             i < scaleFactorY ? 0.5f : 1.0f);\n        context->drawRectToRect(paint, dstRect, srcRect);\n        srcRect = dstRect;\n        srcTexture = dstTexture;\n        SkTSwap(dstTexture, tempTexture);\n    }\n\n    SkIRect srcIRect;\n    srcRect.roundOut(&srcIRect);\n\n    if (sigmaX > 0.0f) {\n        if (scaleFactorX > 1) {\n            \/\/ Clear out a radius to the right of the srcRect to prevent the\n            \/\/ X convolution from reading garbage.\n            clearRect = SkIRect::MakeXYWH(srcIRect.fRight, srcIRect.fTop,\n                                          radiusX, srcIRect.height());\n            context->clear(&clearRect, 0x0);\n        }\n        context->setRenderTarget(dstTexture->asRenderTarget());\n        SkRect dstRect = SkRect::MakeWH(srcRect.width(), srcRect.height());\n        convolve_gaussian(context, srcRect, dstRect, srcTexture,\n                          Gr1DKernelEffect::kX_Direction, radiusX, sigmaX, cropToRect);\n        srcTexture = dstTexture;\n        srcRect = dstRect;\n        SkTSwap(dstTexture, tempTexture);\n    }\n\n    if (sigmaY > 0.0f) {\n        if (scaleFactorY > 1 || sigmaX > 0.0f) {\n            \/\/ Clear out a radius below the srcRect to prevent the Y\n            \/\/ convolution from reading garbage.\n            clearRect = SkIRect::MakeXYWH(srcIRect.fLeft, srcIRect.fBottom,\n                                          srcIRect.width(), radiusY);\n            context->clear(&clearRect, 0x0);\n        }\n\n        context->setRenderTarget(dstTexture->asRenderTarget());\n        SkRect dstRect = SkRect::MakeWH(srcRect.width(), srcRect.height());\n        convolve_gaussian(context, srcRect, dstRect, srcTexture,\n                          Gr1DKernelEffect::kY_Direction, radiusY, sigmaY, cropToRect);\n        srcTexture = dstTexture;\n        srcRect = dstRect;\n        SkTSwap(dstTexture, tempTexture);\n    }\n\n    if (scaleFactorX > 1 || scaleFactorY > 1) {\n        \/\/ Clear one pixel to the right and below, to accommodate bilinear\n        \/\/ upsampling.\n        clearRect = SkIRect::MakeXYWH(srcIRect.fLeft, srcIRect.fBottom,\n                                      srcIRect.width() + 1, 1);\n        context->clear(&clearRect, 0x0);\n        clearRect = SkIRect::MakeXYWH(srcIRect.fRight, srcIRect.fTop,\n                                      1, srcIRect.height());\n        context->clear(&clearRect, 0x0);\n        SkMatrix matrix;\n        matrix.setIDiv(srcTexture->width(), srcTexture->height());\n        context->setRenderTarget(dstTexture->asRenderTarget());\n\n        GrPaint paint;\n        \/\/ FIXME:  this should be mitchell, not bilinear.\n        GrTextureParams params(SkShader::kClamp_TileMode, GrTextureParams::kBilerp_FilterMode);\n        paint.addColorTextureEffect(srcTexture, matrix, params);\n\n        SkRect dstRect(srcRect);\n        scale_rect(&dstRect, (float) scaleFactorX, (float) scaleFactorY);\n        context->drawRectToRect(paint, dstRect, srcRect);\n        srcRect = dstRect;\n        srcTexture = dstTexture;\n        SkTSwap(dstTexture, tempTexture);\n    }\n    if (srcTexture == temp1.texture()) {\n        return temp1.detach();\n    } else if (srcTexture == temp2.texture()) {\n        return temp2.detach();\n    } else {\n        srcTexture->ref();\n        return srcTexture;\n    }\n}\n#endif\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\nCopyright (c) 2017 InversePalindrome\r\nMemento Mori - SharedData.cpp\r\nInversePalindrome.com\r\n*\/\r\n\r\n\r\n#include \"SharedData.hpp\"\r\n\r\n\r\nSharedData::SharedData(sf::RenderWindow& window, sfg::SFGUI& gui, sfg::Desktop& hud, TextureHolder& textures,\r\n\tImageHolder& images, SoundHolder& sounds, FontHolder& fonts, SoundManager& soundManager, KeyBindings& keyBindings) :\r\n\twindow(window),\r\n\tgui(gui),\r\n\thud(hud),\r\n\ttextures(textures),\r\n\timages(images),\r\n\tsounds(sounds),\r\n\tfonts(fonts),\r\n\tsoundManager(soundManager),\r\n\tkeyBindings(keyBindings)\r\n{\r\n}<commit_msg>Delete SharedData.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2017 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#include \"libmesh\/diff_solver.h\"\n#include \"libmesh\/diff_system.h\"\n#include \"libmesh\/time_solver.h\"\n#include \"libmesh\/unsteady_solver.h\"\n#include \"libmesh\/dirichlet_boundaries.h\"\n#include \"libmesh\/dof_map.h\"\n\nnamespace libMesh\n{\n\n\n\nDifferentiableSystem::DifferentiableSystem(EquationSystems & es,\n                                           const std::string & name_in,\n                                           const unsigned int number_in) :\n  Parent      (es, name_in, number_in),\n  time_solver (),\n  deltat(1.),\n  print_solution_norms(false),\n  print_solutions(false),\n  print_residual_norms(false),\n  print_residuals(false),\n  print_jacobian_norms(false),\n  print_jacobians(false),\n  print_element_solutions(false),\n  print_element_residuals(false),\n  print_element_jacobians(false),\n  _diff_physics(this),\n  diff_qoi(this)\n{\n}\n\n\n\nDifferentiableSystem::~DifferentiableSystem ()\n{\n  \/\/ If we had an attached Physics object, delete it.\n  if (this->_diff_physics != this)\n    delete this->_diff_physics;\n\n  \/\/ If we had an attached QoI object, delete it.\n  if (this->diff_qoi != this)\n    delete this->diff_qoi;\n}\n\n\n\nvoid DifferentiableSystem::clear ()\n{\n  \/\/ If we had an attached Physics object, delete it.\n  if (this->_diff_physics != this)\n    {\n      delete this->_diff_physics;\n      this->_diff_physics = this;\n    }\n  \/\/ If we had no attached Physics object, clear our own Physics data\n  else\n    this->clear_physics();\n\n  \/\/ If we had an attached QoI object, delete it.\n  if (this->diff_qoi != this)\n    {\n      delete this->diff_qoi;\n      this->diff_qoi = this;\n    }\n  \/\/ If we had no attached QoI object, clear our own QoI data\n  else\n    this->clear_qoi();\n\n  use_fixed_solution = false;\n}\n\n\n\nvoid DifferentiableSystem::reinit ()\n{\n  Parent::reinit();\n\n  libmesh_assert(time_solver.get());\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n\n  time_solver->reinit();\n}\n\n\n\nvoid DifferentiableSystem::init_data ()\n{\n  \/\/ If it isn't a separate initialized-upon-attachment object, do any\n  \/\/ initialization our physics needs.\n  if (this->_diff_physics == this)\n    this->init_physics(*this);\n\n  \/\/ Do any initialization our solvers need\n  libmesh_assert(time_solver.get());\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n\n  \/\/ Now check for second order variables and add their velocities to the System.\n  if( !time_solver->is_steady() )\n    {\n      const UnsteadySolver & unsteady_solver =\n        cast_ref<const UnsteadySolver &>(*(time_solver.get()));\n\n      if( unsteady_solver.time_order() == 1 )\n        this->add_second_order_dot_vars();\n    }\n\n  time_solver->init();\n\n  \/\/ Next initialize ImplicitSystem data\n  Parent::init_data();\n\n  time_solver->init_data();\n}\n\nUniquePtr<DiffContext> DifferentiableSystem::build_context ()\n{\n  DiffContext * context = new DiffContext(*this);\n  context->set_deltat_pointer( &this->deltat );\n  return UniquePtr<DiffContext>(context);\n}\n\n\nvoid DifferentiableSystem::assemble ()\n{\n  this->assembly(true, true);\n}\n\n\n\nvoid DifferentiableSystem::solve ()\n{\n  \/\/ Get the time solver object associated with the system, and tell it that\n  \/\/ we are not solving the adjoint problem\n  this->get_time_solver().set_is_adjoint(false);\n\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n  time_solver->solve();\n}\n\n\n\nstd::pair<unsigned int, Real> DifferentiableSystem::adjoint_solve (const QoISet & qoi_indices)\n{\n  \/\/ Get the time solver object associated with the system, and tell it that\n  \/\/ we are solving the adjoint problem\n  this->get_time_solver().set_is_adjoint(true);\n\n  return this->ImplicitSystem::adjoint_solve(qoi_indices);\n}\n\n\n\nLinearSolver<Number> * DifferentiableSystem::get_linear_solver() const\n{\n  libmesh_assert(time_solver.get());\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n  return this->time_solver->linear_solver().get();\n}\n\n\n\nstd::pair<unsigned int, Real> DifferentiableSystem::get_linear_solve_parameters() const\n{\n  libmesh_assert(time_solver.get());\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n  return std::make_pair(this->time_solver->diff_solver()->max_linear_iterations,\n                        this->time_solver->diff_solver()->relative_residual_tolerance);\n}\n\n\n\nvoid DifferentiableSystem::release_linear_solver(LinearSolver<Number> *) const\n{\n}\n\nvoid DifferentiableSystem::add_second_order_dot_vars()\n{\n  const std::set<unsigned int> & second_order_vars = this->get_second_order_vars();\n  if( !second_order_vars.empty() )\n    {\n      for( std::set<unsigned int>::const_iterator var_it = second_order_vars.begin();\n           var_it != second_order_vars.end(); ++var_it )\n        {\n          const Variable & var = this->variable(*var_it);\n          std::string new_var_name = std::string(\"dot_\")+var.name();\n\n          unsigned int v_var_idx;\n\n          if( var.active_subdomains().empty() )\n            v_var_idx = this->add_variable( new_var_name, var.type() );\n          else\n            v_var_idx = this->add_variable( new_var_name, var.type(), &var.active_subdomains() );\n\n          _second_order_dot_vars.insert( std::pair<unsigned int,unsigned int>(*var_it,v_var_idx) );\n\n          \/\/ The new velocities are time evolving variables of first order\n          this->time_evolving( v_var_idx, 1 );\n\n          \/\/ And if there are any boundary conditions set on the second order\n          \/\/ variable, we also need to set it on its velocity variable.\n          this->add_dot_var_dirichlet_bcs( *var_it, v_var_idx );\n        }\n    }\n}\n\nvoid DifferentiableSystem::add_dot_var_dirichlet_bcs( unsigned int var_idx,\n                                                      unsigned int dot_var_idx )\n{\n  \/\/ We're assuming that there could be a lot more variables than\n  \/\/ boundary conditions, so we search each of the boundary conditions\n  \/\/ for this variable rather than looping over boundary conditions\n  \/\/ in a separate loop and searching through all the variables.\n  const DirichletBoundaries * all_dbcs =\n    this->get_dof_map().get_dirichlet_boundaries();\n\n  if( all_dbcs )\n    {\n      \/\/ We need to cache the DBCs to be added so that we add them\n      \/\/ after looping over the existing DBCs. Otherwise, we're polluting\n      \/\/ the thing we're looping over.\n      std::vector<DirichletBoundary*> new_dbcs;\n\n      DirichletBoundaries::const_iterator dbc_it = all_dbcs->begin();\n      for( ; dbc_it != all_dbcs->end(); ++dbc_it )\n        {\n          libmesh_assert(*dbc_it);\n          DirichletBoundary & dbc = *(*dbc_it);\n\n          \/\/ Look for second order variable in the current\n          \/\/ DirichletBoundary object\n          std::vector<unsigned int>::const_iterator dbc_var_it =\n            std::find( dbc.variables.begin(), dbc.variables.end(), var_idx );\n\n          \/\/ If we found it, then we also need to add it's corresponding\n          \/\/ \"dot\" variable to a DirichletBoundary\n          std::vector<unsigned int> vars_to_add;\n          if( dbc_var_it != dbc.variables.end() )\n            vars_to_add.push_back(dot_var_idx);\n\n          if( !vars_to_add.empty() )\n            {\n              DirichletBoundary * new_dbc;\n\n              if( dbc.f )\n                {\n                  if( dbc.g )\n                    new_dbc = new DirichletBoundary(dbc.b,\n                                                    vars_to_add,\n                                                    dbc.f.get(),\n                                                    dbc.g.get());\n\n                  else\n                    new_dbc = new DirichletBoundary(dbc.b,\n                                                    vars_to_add,\n                                                    dbc.f.get());\n                }\n              else if( dbc.f_fem )\n                {\n                  if( dbc.g_fem )\n                    new_dbc = new DirichletBoundary(dbc.b,\n                                                    vars_to_add,\n                                                    *this,\n                                                    dbc.f_fem.get(),\n                                                    dbc.g_fem.get());\n\n                  else\n                    new_dbc = new DirichletBoundary(dbc.b,\n                                                    vars_to_add,\n                                                    *this,\n                                                    dbc.f_fem.get());\n                }\n              else\n                libmesh_error_msg(\"Could not find valid boundary function!\");\n\n              new_dbcs.push_back(new_dbc);\n            }\n        }\n\n      \/\/ Now add the new DBCs for the \"dot\" vars to the DofMap\n      std::vector<DirichletBoundary*>::iterator new_dbc_it =\n        new_dbcs.begin();\n\n      for( ; new_dbc_it != new_dbcs.end(); ++new_dbc_it )\n        {\n          const DirichletBoundary & dbc = *(*new_dbc_it);\n          this->get_dof_map().add_dirichlet_boundary(dbc);\n          delete *new_dbc_it;\n        }\n\n    } \/\/ if(all_dbcs)\n}\n\nunsigned int DifferentiableSystem::get_second_order_dot_var( unsigned int var ) const\n{\n  \/\/ For SteadySolver or SecondOrderUnsteadySolvers, we just give back var\n  unsigned int dot_var = var;\n\n  if( !time_solver->is_steady() )\n    {\n      const UnsteadySolver & unsteady_solver =\n        cast_ref<const UnsteadySolver &>(*(time_solver.get()));\n\n      if( unsteady_solver.time_order() == 1 )\n        dot_var = this->_second_order_dot_vars.find(var)->second;\n    }\n\n  return dot_var;\n}\n\nbool DifferentiableSystem::have_first_order_scalar_vars() const\n{\n  bool have_first_order_scalar_vars = false;\n\n  if(this->have_first_order_vars())\n    {\n      for( std::set<unsigned int>::const_iterator var_it = this->get_first_order_vars().begin();\n           var_it != this->get_first_order_vars().end();\n           ++var_it )\n        {\n          if( this->variable(*var_it).type().family == FEFamily::SCALAR )\n            have_first_order_scalar_vars = true;\n        }\n    }\n\n  return have_first_order_scalar_vars;\n}\n\nbool DifferentiableSystem::have_second_order_scalar_vars() const\n{\n  bool have_second_order_scalar_vars = false;\n\n  if(this->have_second_order_vars())\n    {\n      for( std::set<unsigned int>::const_iterator var_it = this->get_second_order_vars().begin();\n           var_it != this->get_second_order_vars().end();\n           ++var_it )\n        {\n          if( this->variable(*var_it).type().family == FEFamily::SCALAR )\n            have_second_order_scalar_vars = true;\n        }\n    }\n\n  return have_second_order_scalar_vars;\n}\n\n} \/\/ namespace libMesh\n<commit_msg>Fix BC construction for velocity variables<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2017 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#include \"libmesh\/diff_solver.h\"\n#include \"libmesh\/diff_system.h\"\n#include \"libmesh\/time_solver.h\"\n#include \"libmesh\/unsteady_solver.h\"\n#include \"libmesh\/dirichlet_boundaries.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/zero_function.h\"\n\nnamespace libMesh\n{\n\n\n\nDifferentiableSystem::DifferentiableSystem(EquationSystems & es,\n                                           const std::string & name_in,\n                                           const unsigned int number_in) :\n  Parent      (es, name_in, number_in),\n  time_solver (),\n  deltat(1.),\n  print_solution_norms(false),\n  print_solutions(false),\n  print_residual_norms(false),\n  print_residuals(false),\n  print_jacobian_norms(false),\n  print_jacobians(false),\n  print_element_solutions(false),\n  print_element_residuals(false),\n  print_element_jacobians(false),\n  _diff_physics(this),\n  diff_qoi(this)\n{\n}\n\n\n\nDifferentiableSystem::~DifferentiableSystem ()\n{\n  \/\/ If we had an attached Physics object, delete it.\n  if (this->_diff_physics != this)\n    delete this->_diff_physics;\n\n  \/\/ If we had an attached QoI object, delete it.\n  if (this->diff_qoi != this)\n    delete this->diff_qoi;\n}\n\n\n\nvoid DifferentiableSystem::clear ()\n{\n  \/\/ If we had an attached Physics object, delete it.\n  if (this->_diff_physics != this)\n    {\n      delete this->_diff_physics;\n      this->_diff_physics = this;\n    }\n  \/\/ If we had no attached Physics object, clear our own Physics data\n  else\n    this->clear_physics();\n\n  \/\/ If we had an attached QoI object, delete it.\n  if (this->diff_qoi != this)\n    {\n      delete this->diff_qoi;\n      this->diff_qoi = this;\n    }\n  \/\/ If we had no attached QoI object, clear our own QoI data\n  else\n    this->clear_qoi();\n\n  use_fixed_solution = false;\n}\n\n\n\nvoid DifferentiableSystem::reinit ()\n{\n  Parent::reinit();\n\n  libmesh_assert(time_solver.get());\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n\n  time_solver->reinit();\n}\n\n\n\nvoid DifferentiableSystem::init_data ()\n{\n  \/\/ If it isn't a separate initialized-upon-attachment object, do any\n  \/\/ initialization our physics needs.\n  if (this->_diff_physics == this)\n    this->init_physics(*this);\n\n  \/\/ Do any initialization our solvers need\n  libmesh_assert(time_solver.get());\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n\n  \/\/ Now check for second order variables and add their velocities to the System.\n  if( !time_solver->is_steady() )\n    {\n      const UnsteadySolver & unsteady_solver =\n        cast_ref<const UnsteadySolver &>(*(time_solver.get()));\n\n      if( unsteady_solver.time_order() == 1 )\n        this->add_second_order_dot_vars();\n    }\n\n  time_solver->init();\n\n  \/\/ Next initialize ImplicitSystem data\n  Parent::init_data();\n\n  time_solver->init_data();\n}\n\nUniquePtr<DiffContext> DifferentiableSystem::build_context ()\n{\n  DiffContext * context = new DiffContext(*this);\n  context->set_deltat_pointer( &this->deltat );\n  return UniquePtr<DiffContext>(context);\n}\n\n\nvoid DifferentiableSystem::assemble ()\n{\n  this->assembly(true, true);\n}\n\n\n\nvoid DifferentiableSystem::solve ()\n{\n  \/\/ Get the time solver object associated with the system, and tell it that\n  \/\/ we are not solving the adjoint problem\n  this->get_time_solver().set_is_adjoint(false);\n\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n  time_solver->solve();\n}\n\n\n\nstd::pair<unsigned int, Real> DifferentiableSystem::adjoint_solve (const QoISet & qoi_indices)\n{\n  \/\/ Get the time solver object associated with the system, and tell it that\n  \/\/ we are solving the adjoint problem\n  this->get_time_solver().set_is_adjoint(true);\n\n  return this->ImplicitSystem::adjoint_solve(qoi_indices);\n}\n\n\n\nLinearSolver<Number> * DifferentiableSystem::get_linear_solver() const\n{\n  libmesh_assert(time_solver.get());\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n  return this->time_solver->linear_solver().get();\n}\n\n\n\nstd::pair<unsigned int, Real> DifferentiableSystem::get_linear_solve_parameters() const\n{\n  libmesh_assert(time_solver.get());\n  libmesh_assert_equal_to (&(time_solver->system()), this);\n  return std::make_pair(this->time_solver->diff_solver()->max_linear_iterations,\n                        this->time_solver->diff_solver()->relative_residual_tolerance);\n}\n\n\n\nvoid DifferentiableSystem::release_linear_solver(LinearSolver<Number> *) const\n{\n}\n\nvoid DifferentiableSystem::add_second_order_dot_vars()\n{\n  const std::set<unsigned int> & second_order_vars = this->get_second_order_vars();\n  if( !second_order_vars.empty() )\n    {\n      for( std::set<unsigned int>::const_iterator var_it = second_order_vars.begin();\n           var_it != second_order_vars.end(); ++var_it )\n        {\n          const Variable & var = this->variable(*var_it);\n          std::string new_var_name = std::string(\"dot_\")+var.name();\n\n          unsigned int v_var_idx;\n\n          if( var.active_subdomains().empty() )\n            v_var_idx = this->add_variable( new_var_name, var.type() );\n          else\n            v_var_idx = this->add_variable( new_var_name, var.type(), &var.active_subdomains() );\n\n          _second_order_dot_vars.insert( std::pair<unsigned int,unsigned int>(*var_it,v_var_idx) );\n\n          \/\/ The new velocities are time evolving variables of first order\n          this->time_evolving( v_var_idx, 1 );\n\n          \/\/ And if there are any boundary conditions set on the second order\n          \/\/ variable, we also need to set it on its velocity variable.\n          this->add_dot_var_dirichlet_bcs( *var_it, v_var_idx );\n        }\n    }\n}\n\nvoid DifferentiableSystem::add_dot_var_dirichlet_bcs( unsigned int var_idx,\n                                                      unsigned int dot_var_idx )\n{\n  \/\/ We're assuming that there could be a lot more variables than\n  \/\/ boundary conditions, so we search each of the boundary conditions\n  \/\/ for this variable rather than looping over boundary conditions\n  \/\/ in a separate loop and searching through all the variables.\n  const DirichletBoundaries * all_dbcs =\n    this->get_dof_map().get_dirichlet_boundaries();\n\n  if( all_dbcs )\n    {\n      \/\/ We need to cache the DBCs to be added so that we add them\n      \/\/ after looping over the existing DBCs. Otherwise, we're polluting\n      \/\/ the thing we're looping over.\n      std::vector<DirichletBoundary*> new_dbcs;\n\n      DirichletBoundaries::const_iterator dbc_it = all_dbcs->begin();\n      for( ; dbc_it != all_dbcs->end(); ++dbc_it )\n        {\n          libmesh_assert(*dbc_it);\n          DirichletBoundary & dbc = *(*dbc_it);\n\n          \/\/ Look for second order variable in the current\n          \/\/ DirichletBoundary object\n          std::vector<unsigned int>::const_iterator dbc_var_it =\n            std::find( dbc.variables.begin(), dbc.variables.end(), var_idx );\n\n          \/\/ If we found it, then we also need to add it's corresponding\n          \/\/ \"dot\" variable to a DirichletBoundary\n          std::vector<unsigned int> vars_to_add;\n          if( dbc_var_it != dbc.variables.end() )\n            vars_to_add.push_back(dot_var_idx);\n\n          if( !vars_to_add.empty() )\n            {\n              \/\/ We need to check if the boundary condition is time-dependent.\n              \/\/ Currently, we cannot automatically differentiate w.r.t. time\n              \/\/ so if the user supplies a time-dependent Dirichlet BC, then\n              \/\/ we can't automatically support the Dirichlet BC for the\n              \/\/ \"velocity\" boundary condition, so we error. Otherwise,\n              \/\/ the \"velocity boundary condition will just be zero.\n              bool is_time_evolving_bc = false;\n              if( dbc.f )\n                is_time_evolving_bc = dbc.f->is_time_dependent();\n              else if( dbc.f_fem )\n                \/\/ We it's a FEMFunctionBase object, it will be implictly\n                \/\/ time-dependent since it is assumed to depend on the solution.\n                is_time_evolving_bc = true;\n              else\n                libmesh_error_msg(\"Could not find valid boundary function!\");\n\n              if( is_time_evolving_bc )\n                libmesh_error_msg(\"Cannot currently support time-dependent Dirichlet BC for dot variables!\");\n\n\n              DirichletBoundary * new_dbc;\n\n              if( dbc.f )\n                {\n                  ZeroFunction<Number> zf;\n\n                  new_dbc = new DirichletBoundary(dbc.b, vars_to_add, zf);\n                }\n              else\n                libmesh_error();\n\n              new_dbcs.push_back(new_dbc);\n            }\n        }\n\n      \/\/ Now add the new DBCs for the \"dot\" vars to the DofMap\n      std::vector<DirichletBoundary*>::iterator new_dbc_it =\n        new_dbcs.begin();\n\n      for( ; new_dbc_it != new_dbcs.end(); ++new_dbc_it )\n        {\n          const DirichletBoundary & dbc = *(*new_dbc_it);\n          this->get_dof_map().add_dirichlet_boundary(dbc);\n          delete *new_dbc_it;\n        }\n\n    } \/\/ if(all_dbcs)\n}\n\nunsigned int DifferentiableSystem::get_second_order_dot_var( unsigned int var ) const\n{\n  \/\/ For SteadySolver or SecondOrderUnsteadySolvers, we just give back var\n  unsigned int dot_var = var;\n\n  if( !time_solver->is_steady() )\n    {\n      const UnsteadySolver & unsteady_solver =\n        cast_ref<const UnsteadySolver &>(*(time_solver.get()));\n\n      if( unsteady_solver.time_order() == 1 )\n        dot_var = this->_second_order_dot_vars.find(var)->second;\n    }\n\n  return dot_var;\n}\n\nbool DifferentiableSystem::have_first_order_scalar_vars() const\n{\n  bool have_first_order_scalar_vars = false;\n\n  if(this->have_first_order_vars())\n    {\n      for( std::set<unsigned int>::const_iterator var_it = this->get_first_order_vars().begin();\n           var_it != this->get_first_order_vars().end();\n           ++var_it )\n        {\n          if( this->variable(*var_it).type().family == FEFamily::SCALAR )\n            have_first_order_scalar_vars = true;\n        }\n    }\n\n  return have_first_order_scalar_vars;\n}\n\nbool DifferentiableSystem::have_second_order_scalar_vars() const\n{\n  bool have_second_order_scalar_vars = false;\n\n  if(this->have_second_order_vars())\n    {\n      for( std::set<unsigned int>::const_iterator var_it = this->get_second_order_vars().begin();\n           var_it != this->get_second_order_vars().end();\n           ++var_it )\n        {\n          if( this->variable(*var_it).type().family == FEFamily::SCALAR )\n            have_second_order_scalar_vars = true;\n        }\n    }\n\n  return have_second_order_scalar_vars;\n}\n\n} \/\/ namespace libMesh\n<|endoftext|>"}
{"text":"<commit_before>\/\/  File: whitelist_auth.cc\n\/\/  Author: Tom Roeder <tmroeder@google.com>\n\/\/\n\/\/  Description: An implementation of the whitelist manager that handles\n\/\/  whitelist files signed with the policy public key.\n\/\/\n\/\/  Copyright (c) 2013, 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 \"tao\/whitelist_auth.h\"\n\n#include <arpa\/inet.h>\n\n#include <fstream>\n\n#include <keyczar\/base\/base64w.h>\n#include <openssl\/pem.h>\n#include <openssl\/rsa.h>\n#include <openssl\/sha.h>\n\n#include \"tao\/hosted_programs.pb.h\"\n#include \"tao\/attestation.pb.h\"\n#include \"tao\/keyczar_public_key.pb.h\"\n#include \"tao\/util.h\"\n\nusing keyczar::Keyczar;\nusing keyczar::Keyset;\nusing keyczar::Verifier;\n\nusing std::ifstream;\n\ntypedef unsigned char BYTE;\ntypedef unsigned int UINT32;\ntypedef unsigned short UINT16;\n\nnamespace tao {\nbool WhitelistAuth::Init() {\n  \/\/ Load the public policy key\n  policy_key_.reset(keyczar::Verifier::Read(policy_public_key_.c_str()));\n  policy_key_->set_encoding(keyczar::Keyczar::NO_ENCODING);\n\n  \/\/ load the whitelist file and check its signature\n  ifstream whitelist(whitelist_path_);\n\n  SignedWhitelist sw;\n  sw.ParseFromIstream(&whitelist);\n  if (!policy_key_->Verify(sw.serialized_whitelist(), sw.signature())) {\n    LOG(ERROR) << \"The signature did not verify on the signed whitelist\";\n    return false;\n  }\n\n  Whitelist w;\n  const string &serialized_w = sw.serialized_whitelist();\n\n  if (!w.ParseFromString(serialized_w)) {\n    LOG(ERROR) << \"Could not parse the serialized whitelist\";\n    return false;\n  }\n\n  for (int i = 0; i < w.programs_size(); i++) {\n    const HostedProgram &hp = w.programs(i);\n    if (whitelist_.find(hp.name()) != whitelist_.end()) {\n      LOG(ERROR) << \"Can't add \" << hp.name() << \" to the whitelist twice\";\n      return false;\n    }\n\n    whitelist_[hp.name()] = hp.hash();\n    hash_whitelist_.insert(hp.hash());\n  }\n\n  return true;\n}\n\nbool WhitelistAuth::IsAuthorized(const string &program_hash) const {\n  return hash_whitelist_.find(program_hash) != hash_whitelist_.end();\n}\n\nbool WhitelistAuth::IsAuthorized(const string &program_name,\n                                 const string &program_hash) const {\n  auto it = whitelist_.find(program_name);\n  if (it == whitelist_.end()) {\n    return false;\n  }\n\n  return (it->second.compare(program_hash) == 0);\n}\n\nbool WhitelistAuth::CheckAuthorization(const Attestation &attestation) const {\n  Statement s;\n  if (!s.ParseFromString(attestation.serialized_statement())) {\n    LOG(ERROR) << \"Could not parse the statement from an attestation\";\n    return false;\n  }\n\n  \/\/ check the time to make sure it hasn't expired\n  time_t cur_time;\n  time(&cur_time);\n  if (cur_time > s.expiration()) {\n    LOG(ERROR) << \"This attestation has expired\";\n    return false;\n  }\n\n  if (s.hash_alg().compare(\"SHA256\") == 0) {\n    \/\/ This is a normal program-like hash, so check the whitelist directly\n    return IsAuthorized(s.hash());\n  }\n\n  if (attestation.has_quote()) {\n    \/\/ Extract the PCRs as a single string and look for them in the whitelist.\n    string quote(attestation.quote().data(), attestation.quote().size());\n    size_t quote_len = quote.size();\n    if (quote_len < sizeof(UINT16)) {\n      LOG(ERROR) << \"The quote was not long enough to contain a mask length\";\n      return false;\n    }\n\n    const char *quote_bytes = quote.c_str();\n    UINT32 index = 0;\n    UINT16 mask_len = ntohs(*(UINT16 *)(quote_bytes + index));\n    index += sizeof(UINT16);\n\n    \/\/ skip the mask bytes\n    if ((quote_len < index) || (quote_len - index < mask_len)) {\n      LOG(ERROR) << \"The quote was not long enough to contain the mask\";\n      return false;\n    }\n\n    index += mask_len;\n\n    if ((quote_len < index) || (quote_len - index < sizeof(UINT32))) {\n      LOG(ERROR) << \"The quote was not long enough to contain the pcr length\";\n      return false;\n    }\n\n    UINT32 pcr_len = ntohl(*(UINT32 *)(quote_bytes + index));\n    index += sizeof(UINT32);\n\n    if ((quote_len < index) || (quote_len - index < pcr_len)) {\n      LOG(ERROR) << \"The quote was not long enough to contain the PCRs\";\n      return false;\n    }\n\n    string pcrs(quote_bytes + index, pcr_len);\n\n    \/\/ The whitelist uses Base64W encoding for hashes\n    string serialized;\n    if (!keyczar::base::Base64WEncode(pcrs, &serialized)) {\n      LOG(ERROR) << \"Can't serialize the PCRs\";\n      return false;\n    }\n\n    return IsAuthorized(serialized);\n  }\n\n  return (attestation.type() == ROOT);\n}\n\nbool WhitelistAuth::VerifyAttestation(const string &attestation,\n                                      string *data) const {\n  Attestation a;\n  if (!a.ParseFromString(attestation)) {\n    LOG(ERROR) << \"Could not deserialize an Attestation\";\n    return false;\n  }\n\n  \/\/ Choose the verifier to use based on the type of the attestation.\n  bool verified = false;\n  switch (a.type()) {\n    case ROOT:\n      verified = CheckRootSignature(a);\n      break;\n    case INTERMEDIATE:\n      verified = CheckIntermediateSignature(a);\n      break;\n    case TPM_1_2_QUOTE:\n      verified = CheckTPM12Quote(a);\n      break;\n    case LEGACY:\n      LOG(ERROR) << \"Legacy attestations are not currently supported\";\n      return false;\n    case UNKNOWN:\n    default:\n      LOG(ERROR) << \"Unknown attestation type\";\n      return false;\n  }\n\n  if (!verified) {\n    LOG(ERROR) << \"Could not verify the signature\";\n    return false;\n  }\n\n  \/\/ Check that this attestation is authorized.\n  if (!CheckAuthorization(a)) {\n    LOG(ERROR) << \"The attested program was not authorized\";\n    return false;\n  }\n\n  Statement s;\n  if (!s.ParseFromString(a.serialized_statement())) {\n    LOG(ERROR) << \"Could not parse the statement\";\n    return false;\n  }\n\n  data->assign(s.data().data(), s.data().size());\n\n  VLOG(1) << \"The attestation passed verification\";\n\n  return true;\n}\n\nbool WhitelistAuth::CheckRootSignature(const Attestation &a) const {\n  if (a.type() != ROOT) {\n    LOG(ERROR) << \"This is not a ROOT attestation, but it claims to be \"\n                  \"signed with the public key\";\n    return false;\n  }\n\n  VLOG(2) << \"About to verify the signature against the policy key\";\n  VLOG(2) << \"a.serialized_statement().size = \"\n          << (int)a.serialized_statement().size();\n  VLOG(2) << \"a.signature().size = \" << (int)a.signature().size();\n\n  \/\/ Verify against the policy key.\n  if (!policy_key_->Verify(a.serialized_statement(), a.signature())) {\n    LOG(ERROR) << \"Verification failed with the policy key\";\n    return false;\n  }\n\n  return true;\n}\n\nbool WhitelistAuth::CheckIntermediateSignature(const Attestation &a) const {\n  if (a.type() != INTERMEDIATE) {\n    LOG(ERROR)\n        << \"Expected this Attestation to be INTERMEDIATE, but it was not\";\n    return false;\n  }\n\n  \/\/ Recurse on the attestation to get the key information from the cert.\n  string key_data;\n  if (!VerifyAttestation(a.cert(), &key_data)) {\n    LOG(ERROR) << \"Could not verify the public_key attestation\";\n    return false;\n  }\n\n  KeyczarPublicKey kpk;\n  if (!kpk.ParseFromString(key_data)) {\n    LOG(ERROR) << \"Could not deserialize the public key for this attestation\";\n    return false;\n  }\n\n  \/\/ Get a Keyset corresponding to this public key\n  Keyset *k = nullptr;\n  if (!DeserializePublicKey(kpk, &k)) {\n    LOG(ERROR) << \"Could not deserialize the public key\";\n    return false;\n  }\n\n  scoped_ptr<Verifier> v(new Verifier(k));\n  v->set_encoding(Keyczar::NO_ENCODING);\n  if (!v->Verify(a.serialized_statement(), a.signature())) {\n    LOG(ERROR) << \"The statement in an attestation did not have a valid \"\n                  \"signature from its public key\";\n    return false;\n  }\n\n  return true;\n}\n\nbool WhitelistAuth::CheckTPM12Quote(const Attestation &a) const {\n  if (a.type() != TPM_1_2_QUOTE) {\n    LOG(ERROR) << \"This method can only verify TPM_1_2_QUOTE attestations\";\n    return false;\n  }\n\n  if (!a.has_cert()) {\n    LOG(ERROR) << \"A TPM 1.2 Quote attestation must have a certificate that \"\n                  \"signs the AIK with the public policy key\";\n    return false;\n  }\n\n  \/\/ The data in the Statement in this Attestation should be the serialization\n  \/\/ of a PEM OpenSSL public key that we can use to check the signature.\n  string data;\n  if (!VerifyAttestation(a.cert(), &data)) {\n    LOG(ERROR) << \"The attestation on the AIK did not pass verification\";\n    return false;\n  }\n\n  BIO *mem = BIO_new(BIO_s_mem());\n  int bio_bytes_written =\n      BIO_write(mem, reinterpret_cast<const void *>(data.data()),\n                static_cast<int>(data.size()));\n  if (bio_bytes_written != static_cast<int>(data.size())) {\n    LOG(ERROR) << \"Could not write the data to the BIO\";\n    return false;\n  }\n\n  RSA *aik_rsa = nullptr;\n  if (!PEM_read_bio_RSAPublicKey(mem, &aik_rsa, NULL, NULL)) {\n    LOG(ERROR) << \"Could not read the RSA public key from the attestation\";\n    return false;\n  }\n\n  ScopedRsa aik(aik_rsa);\n\n  \/\/ Hash the statement with SHA1 for the external data part of the quote.\n  BYTE statement_hash[20];\n  SHA1(reinterpret_cast<const BYTE *>(a.serialized_statement().data()),\n       a.serialized_statement().size(), statement_hash);\n\n  \/\/ The quote can be verified in a qinfo, which has a header of 8 bytes, and\n  \/\/ two hashes.  The first hash is the hash of the external data, and the\n  \/\/ second is the hash of the quote itself (pcr_buf above with length in\n  \/\/ index). This can be hashed and verified directly by OpenSSL.\n\n  BYTE qinfo[8 + 2 * 20];\n  qinfo[0] = 1;\n  qinfo[1] = 1;\n  qinfo[2] = 0;\n  qinfo[3] = 0;\n  qinfo[4] = 'Q';\n  qinfo[5] = 'U';\n  qinfo[6] = 'O';\n  qinfo[7] = 'T';\n\n  \/\/ The quote in a TPM_1_2_QUOTE is the quote data itself.\n  if (!a.has_quote()) {\n    LOG(ERROR) << \"A TPM_1_2_QUOTE must have a quote value\";\n    return false;\n  }\n\n  SHA1(reinterpret_cast<const BYTE *>(a.quote().data()), a.quote().size(),\n       qinfo + 8);\n  memcpy(qinfo + 8 + 20, statement_hash, sizeof(statement_hash));\n\n  BYTE quote_hash[20];\n  SHA1(qinfo, sizeof(qinfo), quote_hash);\n  if (RSA_verify(NID_sha1, quote_hash, sizeof(quote_hash),\n                 reinterpret_cast<const BYTE *>(a.signature().data()),\n                 a.signature().size(), aik.get()) !=\n      1) {\n    LOG(ERROR) << \"The RSA signature did not pass verification\";\n    return false;\n  }\n\n  return true;\n}\n}  \/\/ namespace tao\n<commit_msg>Added some more error messages for when a program\/hash is not authorized<commit_after>\/\/  File: whitelist_auth.cc\n\/\/  Author: Tom Roeder <tmroeder@google.com>\n\/\/\n\/\/  Description: An implementation of the whitelist manager that handles\n\/\/  whitelist files signed with the policy public key.\n\/\/\n\/\/  Copyright (c) 2013, 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 \"tao\/whitelist_auth.h\"\n\n#include <arpa\/inet.h>\n\n#include <fstream>\n\n#include <keyczar\/base\/base64w.h>\n#include <openssl\/pem.h>\n#include <openssl\/rsa.h>\n#include <openssl\/sha.h>\n\n#include \"tao\/hosted_programs.pb.h\"\n#include \"tao\/attestation.pb.h\"\n#include \"tao\/keyczar_public_key.pb.h\"\n#include \"tao\/util.h\"\n\nusing keyczar::Keyczar;\nusing keyczar::Keyset;\nusing keyczar::Verifier;\n\nusing std::ifstream;\n\ntypedef unsigned char BYTE;\ntypedef unsigned int UINT32;\ntypedef unsigned short UINT16;\n\nnamespace tao {\nbool WhitelistAuth::Init() {\n  \/\/ Load the public policy key\n  policy_key_.reset(keyczar::Verifier::Read(policy_public_key_.c_str()));\n  policy_key_->set_encoding(keyczar::Keyczar::NO_ENCODING);\n\n  \/\/ load the whitelist file and check its signature\n  ifstream whitelist(whitelist_path_);\n\n  SignedWhitelist sw;\n  sw.ParseFromIstream(&whitelist);\n  if (!policy_key_->Verify(sw.serialized_whitelist(), sw.signature())) {\n    LOG(ERROR) << \"The signature did not verify on the signed whitelist\";\n    return false;\n  }\n\n  Whitelist w;\n  const string &serialized_w = sw.serialized_whitelist();\n\n  if (!w.ParseFromString(serialized_w)) {\n    LOG(ERROR) << \"Could not parse the serialized whitelist\";\n    return false;\n  }\n\n  for (int i = 0; i < w.programs_size(); i++) {\n    const HostedProgram &hp = w.programs(i);\n    if (whitelist_.find(hp.name()) != whitelist_.end()) {\n      LOG(ERROR) << \"Can't add \" << hp.name() << \" to the whitelist twice\";\n      return false;\n    }\n\n    whitelist_[hp.name()] = hp.hash();\n    hash_whitelist_.insert(hp.hash());\n  }\n\n  return true;\n}\n\nbool WhitelistAuth::IsAuthorized(const string &program_hash) const {\n  bool authorized = (hash_whitelist_.find(program_hash) != hash_whitelist_.end());\n  if (!authorized) {\n    LOG(ERROR) << \"Could not find the hash \" << program_hash\n               << \" on the whitelist\";\n  }\n\n  return authorized;\n}\n\nbool WhitelistAuth::IsAuthorized(const string &program_name,\n                                 const string &program_hash) const {\n  auto it = whitelist_.find(program_name);\n  if (it == whitelist_.end()) {\n    LOG(ERROR) << \"The program \" << program_name << \" with hash \"\n               << program_hash << \" was not found on the whitelist\";\n    return false;\n  }\n\n  return (it->second.compare(program_hash) == 0);\n}\n\nbool WhitelistAuth::CheckAuthorization(const Attestation &attestation) const {\n  Statement s;\n  if (!s.ParseFromString(attestation.serialized_statement())) {\n    LOG(ERROR) << \"Could not parse the statement from an attestation\";\n    return false;\n  }\n\n  \/\/ check the time to make sure it hasn't expired\n  time_t cur_time;\n  time(&cur_time);\n  if (cur_time > s.expiration()) {\n    LOG(ERROR) << \"This attestation has expired\";\n    return false;\n  }\n\n  if (s.hash_alg().compare(\"SHA256\") == 0) {\n    \/\/ This is a normal program-like hash, so check the whitelist directly\n    return IsAuthorized(s.hash());\n  }\n\n  if (attestation.has_quote()) {\n    \/\/ Extract the PCRs as a single string and look for them in the whitelist.\n    string quote(attestation.quote().data(), attestation.quote().size());\n    size_t quote_len = quote.size();\n    if (quote_len < sizeof(UINT16)) {\n      LOG(ERROR) << \"The quote was not long enough to contain a mask length\";\n      return false;\n    }\n\n    const char *quote_bytes = quote.c_str();\n    UINT32 index = 0;\n    UINT16 mask_len = ntohs(*(UINT16 *)(quote_bytes + index));\n    index += sizeof(UINT16);\n\n    \/\/ skip the mask bytes\n    if ((quote_len < index) || (quote_len - index < mask_len)) {\n      LOG(ERROR) << \"The quote was not long enough to contain the mask\";\n      return false;\n    }\n\n    index += mask_len;\n\n    if ((quote_len < index) || (quote_len - index < sizeof(UINT32))) {\n      LOG(ERROR) << \"The quote was not long enough to contain the pcr length\";\n      return false;\n    }\n\n    UINT32 pcr_len = ntohl(*(UINT32 *)(quote_bytes + index));\n    index += sizeof(UINT32);\n\n    if ((quote_len < index) || (quote_len - index < pcr_len)) {\n      LOG(ERROR) << \"The quote was not long enough to contain the PCRs\";\n      return false;\n    }\n\n    string pcrs(quote_bytes + index, pcr_len);\n\n    \/\/ The whitelist uses Base64W encoding for hashes\n    string serialized;\n    if (!keyczar::base::Base64WEncode(pcrs, &serialized)) {\n      LOG(ERROR) << \"Can't serialize the PCRs\";\n      return false;\n    }\n\n    return IsAuthorized(serialized);\n  }\n\n  return (attestation.type() == ROOT);\n}\n\nbool WhitelistAuth::VerifyAttestation(const string &attestation,\n                                      string *data) const {\n  Attestation a;\n  if (!a.ParseFromString(attestation)) {\n    LOG(ERROR) << \"Could not deserialize an Attestation\";\n    return false;\n  }\n\n  \/\/ Choose the verifier to use based on the type of the attestation.\n  bool verified = false;\n  switch (a.type()) {\n    case ROOT:\n      verified = CheckRootSignature(a);\n      break;\n    case INTERMEDIATE:\n      verified = CheckIntermediateSignature(a);\n      break;\n    case TPM_1_2_QUOTE:\n      verified = CheckTPM12Quote(a);\n      break;\n    case LEGACY:\n      LOG(ERROR) << \"Legacy attestations are not currently supported\";\n      return false;\n    case UNKNOWN:\n    default:\n      LOG(ERROR) << \"Unknown attestation type\";\n      return false;\n  }\n\n  if (!verified) {\n    LOG(ERROR) << \"Could not verify the signature\";\n    return false;\n  }\n\n  \/\/ Check that this attestation is authorized.\n  if (!CheckAuthorization(a)) {\n    LOG(ERROR) << \"The attested program was not authorized\";\n    return false;\n  }\n\n  Statement s;\n  if (!s.ParseFromString(a.serialized_statement())) {\n    LOG(ERROR) << \"Could not parse the statement\";\n    return false;\n  }\n\n  data->assign(s.data().data(), s.data().size());\n\n  VLOG(1) << \"The attestation passed verification\";\n\n  return true;\n}\n\nbool WhitelistAuth::CheckRootSignature(const Attestation &a) const {\n  if (a.type() != ROOT) {\n    LOG(ERROR) << \"This is not a ROOT attestation, but it claims to be \"\n                  \"signed with the public key\";\n    return false;\n  }\n\n  VLOG(2) << \"About to verify the signature against the policy key\";\n  VLOG(2) << \"a.serialized_statement().size = \"\n          << (int)a.serialized_statement().size();\n  VLOG(2) << \"a.signature().size = \" << (int)a.signature().size();\n\n  \/\/ Verify against the policy key.\n  if (!policy_key_->Verify(a.serialized_statement(), a.signature())) {\n    LOG(ERROR) << \"Verification failed with the policy key\";\n    return false;\n  }\n\n  return true;\n}\n\nbool WhitelistAuth::CheckIntermediateSignature(const Attestation &a) const {\n  if (a.type() != INTERMEDIATE) {\n    LOG(ERROR)\n        << \"Expected this Attestation to be INTERMEDIATE, but it was not\";\n    return false;\n  }\n\n  \/\/ Recurse on the attestation to get the key information from the cert.\n  string key_data;\n  if (!VerifyAttestation(a.cert(), &key_data)) {\n    LOG(ERROR) << \"Could not verify the public_key attestation\";\n    return false;\n  }\n\n  KeyczarPublicKey kpk;\n  if (!kpk.ParseFromString(key_data)) {\n    LOG(ERROR) << \"Could not deserialize the public key for this attestation\";\n    return false;\n  }\n\n  \/\/ Get a Keyset corresponding to this public key\n  Keyset *k = nullptr;\n  if (!DeserializePublicKey(kpk, &k)) {\n    LOG(ERROR) << \"Could not deserialize the public key\";\n    return false;\n  }\n\n  scoped_ptr<Verifier> v(new Verifier(k));\n  v->set_encoding(Keyczar::NO_ENCODING);\n  if (!v->Verify(a.serialized_statement(), a.signature())) {\n    LOG(ERROR) << \"The statement in an attestation did not have a valid \"\n                  \"signature from its public key\";\n    return false;\n  }\n\n  return true;\n}\n\nbool WhitelistAuth::CheckTPM12Quote(const Attestation &a) const {\n  if (a.type() != TPM_1_2_QUOTE) {\n    LOG(ERROR) << \"This method can only verify TPM_1_2_QUOTE attestations\";\n    return false;\n  }\n\n  if (!a.has_cert()) {\n    LOG(ERROR) << \"A TPM 1.2 Quote attestation must have a certificate that \"\n                  \"signs the AIK with the public policy key\";\n    return false;\n  }\n\n  \/\/ The data in the Statement in this Attestation should be the serialization\n  \/\/ of a PEM OpenSSL public key that we can use to check the signature.\n  string data;\n  if (!VerifyAttestation(a.cert(), &data)) {\n    LOG(ERROR) << \"The attestation on the AIK did not pass verification\";\n    return false;\n  }\n\n  BIO *mem = BIO_new(BIO_s_mem());\n  int bio_bytes_written =\n      BIO_write(mem, reinterpret_cast<const void *>(data.data()),\n                static_cast<int>(data.size()));\n  if (bio_bytes_written != static_cast<int>(data.size())) {\n    LOG(ERROR) << \"Could not write the data to the BIO\";\n    return false;\n  }\n\n  RSA *aik_rsa = nullptr;\n  if (!PEM_read_bio_RSAPublicKey(mem, &aik_rsa, NULL, NULL)) {\n    LOG(ERROR) << \"Could not read the RSA public key from the attestation\";\n    return false;\n  }\n\n  ScopedRsa aik(aik_rsa);\n\n  \/\/ Hash the statement with SHA1 for the external data part of the quote.\n  BYTE statement_hash[20];\n  SHA1(reinterpret_cast<const BYTE *>(a.serialized_statement().data()),\n       a.serialized_statement().size(), statement_hash);\n\n  \/\/ The quote can be verified in a qinfo, which has a header of 8 bytes, and\n  \/\/ two hashes.  The first hash is the hash of the external data, and the\n  \/\/ second is the hash of the quote itself (pcr_buf above with length in\n  \/\/ index). This can be hashed and verified directly by OpenSSL.\n\n  BYTE qinfo[8 + 2 * 20];\n  qinfo[0] = 1;\n  qinfo[1] = 1;\n  qinfo[2] = 0;\n  qinfo[3] = 0;\n  qinfo[4] = 'Q';\n  qinfo[5] = 'U';\n  qinfo[6] = 'O';\n  qinfo[7] = 'T';\n\n  \/\/ The quote in a TPM_1_2_QUOTE is the quote data itself.\n  if (!a.has_quote()) {\n    LOG(ERROR) << \"A TPM_1_2_QUOTE must have a quote value\";\n    return false;\n  }\n\n  SHA1(reinterpret_cast<const BYTE *>(a.quote().data()), a.quote().size(),\n       qinfo + 8);\n  memcpy(qinfo + 8 + 20, statement_hash, sizeof(statement_hash));\n\n  BYTE quote_hash[20];\n  SHA1(qinfo, sizeof(qinfo), quote_hash);\n  if (RSA_verify(NID_sha1, quote_hash, sizeof(quote_hash),\n                 reinterpret_cast<const BYTE *>(a.signature().data()),\n                 a.signature().size(), aik.get()) !=\n      1) {\n    LOG(ERROR) << \"The RSA signature did not pass verification\";\n    return false;\n  }\n\n  return true;\n}\n}  \/\/ namespace tao\n<|endoftext|>"}
{"text":"<commit_before>#ifndef BOOK_FUNCIDS_HPP\n#define BOOK_FUNCIDS_HPP\n\n#include <string>\n#include <SFML-Book\/common\/Configuration.hpp>\n\nnamespace book\n{\n    namespace FuncIds{\n        enum FUNCIDS {\n            \/\/specials\n            IdHandler = 0,\n            IdDisconnected,\n            IdLogOut,\n\n            \/\/main menu\n            IdGetListGame, \/\/client\n            IdSetListGame, \/\/server\n            IdCreateGame, \/\/client\n            IdJoinGame, \/\/client\n            IdJoinGameConfirmation, \/\/server\n            IdJoinGameReject, \/\/server\n\n            \/\/in game\n            IdRequestCreateEntity, \/\/client\n            IdRequestDestroyEntity, \/\/client\n            IdDestroyEntity, \/\/server\n            IdCreateEntity, \/\/server\n            IdUpdateEntity, \/\/server\n            \/\/\/\/ Entity Event\n            IdOnHittedEntity, \/\/server\n            IdOnHitEntity, \/\/server\n            IdOnSpawnEntity, \/\/server\n            \/\/\/\/ Team event\n            IdUpdateTeam, \/\/server\n        };\n    }\n\n    namespace EntityType {\n        enum TYPES {\n            IdMain = 0,\n            IdEye,\n            IdWormEgg,\n            IdWorm,\n            IdCarnivor,\n        };\n\n        enum BuildEntities {\n            EntityMain,\n            EntityWormEgg,\n            EntityCarnivor,\n            SIZE\n        };\n\n        struct Info {\n            int cost;\n            std::string name;\n            short int makeAs;\n            int icon_id;\n            int animation_id;\n            std::string description;\n        };\n\n        static Info informations[SIZE] = {\n            {5000, \"GQ\",IdMain, Configuration::TexBuildMain, Configuration::AnimMainStand,\"Main building.\\nGenerates gold.\\nYou loose the game\\nif you don't control\\nany one of them.\"},\n            {250, \"Worm Egg\",IdWormEgg,Configuration::TexBuildWormEgg, Configuration::AnimWormEggStand, \"Spawn some worms\"},\n            {300, \"Carnivore\",IdCarnivor, Configuration::TexBuildCarnivor, Configuration::AnimCarnivorStand, \"Make hight damage\"}\n        };\n    }\n\n}\n\n#endif\n<commit_msg>remove useless datas<commit_after>#ifndef BOOK_FUNCIDS_HPP\n#define BOOK_FUNCIDS_HPP\n\n#include <string>\n#include <SFML-Book\/common\/Configuration.hpp>\n\nnamespace book\n{\n    namespace FuncIds{\n        enum FUNCIDS {\n            \/\/specials\n            IdHandler = 0,\n            IdDisconnected,\n            IdLogOut,\n\n            \/\/main menu\n            IdGetListGame, \/\/client\n            IdSetListGame, \/\/server\n            IdCreateGame, \/\/client\n            IdJoinGame, \/\/client\n            IdJoinGameConfirmation, \/\/server\n            IdJoinGameReject, \/\/server\n\n            \/\/in game\n            IdRequestCreateEntity, \/\/client\n            IdRequestDestroyEntity, \/\/client\n            IdDestroyEntity, \/\/server\n            IdCreateEntity, \/\/server\n            IdUpdateEntity, \/\/server\n            \/\/\/\/ Entity Event\n            IdOnHittedEntity, \/\/server\n            IdOnHitEntity, \/\/server\n            IdOnSpawnEntity, \/\/server\n            \/\/\/\/ Team event\n            IdUpdateTeam, \/\/server\n        };\n    }\n\n    namespace EntityType {\n        enum TYPES {\n            IdMain = 0,\n            IdEye,\n            IdWormEgg,\n            IdWorm,\n            IdCarnivor,\n        };\n\n        \/*enum BuildEntities {\n            EntityMain,\n            EntityWormEgg,\n            EntityCarnivor,\n            SIZE\n        };*\/\n\n        struct Info {\n            int cost;\n            std::string name;\n            short int makeAs;\n            int icon_id;\n            int animation_id;\n            std::string description;\n        };\n\n        static Info informations[] = {\n            {5000, \"GQ\",IdMain, Configuration::TexBuildMain, Configuration::AnimMainStand,\"Main building.\\nGenerates gold.\\nYou loose the game\\nif you don't control\\nany one of them.\"},\n            {250, \"Worm Egg\",IdWormEgg,Configuration::TexBuildWormEgg, Configuration::AnimWormEggStand, \"Spawn some worms\"},\n            {300, \"Carnivore\",IdCarnivor, Configuration::TexBuildCarnivor, Configuration::AnimCarnivorStand, \"Make hight damage\"}\n        };\n    }\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"conv2d_dot.hpp\"\n#include \"conv2d_mad.hpp\"\n\nnamespace tensor\n{\n        \/\/\/\n        \/\/\/ \\brief 2D convolution: odata += idata @ kdata (decode at runtime the best operator to use)\n        \/\/\/\n        struct conv2d_dyn_t\n        {\n                template\n                <\n                        typename tmatrixi,\n                        typename tmatrixk,\n                        typename tmatrixo\n                >\n                void operator()(const tmatrixi& idata, const tmatrixk& kdata, tmatrixo&& odata) const\n                {\n                        conv2d_assert(idata, kdata, odata);\n\n                        if (kdata.rows() == 1 && kdata.cols() == 1)\n                        {\n                                odata.noalias() += idata * kdata(0, 0);\n                        }\n                        else if (odata.rows() == 1 && odata.cols() == 1)\n                        {\n                                odata(0, 0) += (idata.array() * kdata.array()).sum();\n                        }\n                        else\n                        {\n                                conv2d_dot_dyn_t()(idata, kdata, odata);\n                        }\n                }\n        };\n}\n\n<commit_msg>slightly faster 3x3 & 5x5 convolutions<commit_after>#pragma once\n\n#include \"conv2d_dot.hpp\"\n#include \"conv2d_mad.hpp\"\n\nnamespace tensor\n{\n        \/\/\/\n        \/\/\/ \\brief 2D convolution: odata += idata @ kdata (decode at runtime the best operator to use)\n        \/\/\/\n        struct conv2d_dyn_t\n        {\n                template\n                <\n                        typename tmatrixi,\n                        typename tmatrixk,\n                        typename tmatrixo\n                >\n                void conv3x3(const tmatrixi& idata, const tmatrixk& kdata, tmatrixo&& odata) const\n                {\n                        conv2d_assert(idata, kdata, odata);\n                        assert(kdata.rows() == 3);\n                        assert(kdata.cols() == 3);\n\n                        const auto orows = odata.rows();\n                        const auto ocols = odata.cols();\n\n                        for (auto r = 0; r < orows; r ++)\n                        {\n                                for (auto c = 0; c < ocols; c ++)\n                                {\n                                        odata(r, c) +=\n                                        idata.row(r + 0).template segment<3>(c).dot(kdata.row(0)) +\n                                        idata.row(r + 1).template segment<3>(c).dot(kdata.row(1)) +\n                                        idata.row(r + 2).template segment<3>(c).dot(kdata.row(2));\n                                }\n                        }\n                }\n\n                template\n                <\n                        typename tmatrixi,\n                        typename tmatrixk,\n                        typename tmatrixo\n                >\n                void conv5x5(const tmatrixi& idata, const tmatrixk& kdata, tmatrixo&& odata) const\n                {\n                        conv2d_assert(idata, kdata, odata);\n                        assert(kdata.rows() == 5);\n                        assert(kdata.cols() == 5);\n\n                        const auto orows = odata.rows();\n                        const auto ocols = odata.cols();\n\n                        const auto krow0 = kdata.row(0);\n                        const auto krow1 = kdata.row(1);\n                        const auto krow2 = kdata.row(2);\n                        const auto krow3 = kdata.row(3);\n                        const auto krow4 = kdata.row(4);\n\n                        for (auto r = 0; r < orows; r ++)\n                        {\n                                const auto irow0 = idata.row(r + 0);\n                                const auto irow1 = idata.row(r + 1);\n                                const auto irow2 = idata.row(r + 2);\n                                const auto irow3 = idata.row(r + 3);\n                                const auto irow4 = idata.row(r + 4);\n\n                                for (auto c = 0; c < ocols; c ++)\n                                {\n                                        odata(r, c) +=\n                                        irow0.template segment<5>(c).dot(krow0) +\n                                        irow1.template segment<5>(c).dot(krow1) +\n                                        irow2.template segment<5>(c).dot(krow2) +\n                                        irow3.template segment<5>(c).dot(krow3) +\n                                        irow4.template segment<5>(c).dot(krow4);\n                                }\n                        }\n                }\n\n                template\n                <\n                        typename tmatrixi,\n                        typename tmatrixk,\n                        typename tmatrixo\n                >\n                void operator()(const tmatrixi& idata, const tmatrixk& kdata, tmatrixo&& odata) const\n                {\n                        conv2d_assert(idata, kdata, odata);\n\n                        if (kdata.rows() == 1 && kdata.cols() == 1)\n                        {\n                                odata.noalias() += idata * kdata(0, 0);\n                        }\n                        else if (odata.rows() == 1 && odata.cols() == 1)\n                        {\n                                odata(0, 0) += (idata.array() * kdata.array()).sum();\n                        }\n                        else if (kdata.rows() == 3 && kdata.cols() == 3)\n                        {\n                                conv3x3(idata, kdata, odata);\n                        }\n                        else if (kdata.rows() == 5 && kdata.cols() == 5)\n                        {\n                                conv5x5(idata, kdata, odata);\n                        }\n                        else\n                        {\n                                conv2d_dot_dyn_t()(idata, kdata, odata);\n                        }\n                }\n        };\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2017 deepstreamHub 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 *\/\n#ifndef DEEPSTREAM_HPP\n#define DEEPSTREAM_HPP\n\n#include <deepstream\/core\/buffer.hpp>\n#include <deepstream\/core\/client.hpp>\n#include <deepstream\/core\/error_handler.hpp>\n#include <deepstream\/core\/event.hpp>\n#include <deepstream\/core\/presence.hpp>\n#include <deepstream\/core\/version.hpp>\n#include <deepstream\/lib\/poco-ws.hpp>\n#include <deepstream\/lib\/basic-error-handler.hpp>\n#include <deepstream\/lib\/json.hpp>\n#include <deepstream\/lib\/type-serializer.hpp>\n\n#include <string>\n#include <exception>\n\nnamespace deepstream {\n\n    using json = nlohmann::json;\n\n    struct Deepstream {\n\n        typedef std::function<void(const json &&)> LoginCallback;\n\n        Deepstream() = delete;\n\n        Deepstream(const Deepstream &) = delete;\n\n        Deepstream &operator=(const Deepstream &) = delete;\n\n        Deepstream(const std::string &uri)\n            : wsh_()\n            , error_handler_()\n            , client_(uri, wsh_, error_handler_)\n            , type_serializer_(error_handler_)\n            , event(client_, error_handler_, type_serializer_)\n            , presence(client_, error_handler_)\n        {\n        }\n\n        \/**\n         * This function reads all incoming messages from the websocket and\n         * executes the appropriate callbacks; it returns when there are no\n         * messages left.\n         *\/\n        void process_messages()\n        {\n            wsh_.process_messages();\n        }\n\n        void login()\n        {\n            const json::object_t auth({});\n            login(auth);\n        }\n\n        void login(const json::object_t &auth)\n        {\n            const LoginCallback callback;\n            login(auth, callback);\n        }\n\n        void login(const LoginCallback &callback)\n        {\n            login(json({}), callback);\n        }\n\n        \/**\n         * Given a client in `AWAIT_CONNECTION` state, this function attempts to\n         * log in with the given authentication data.\n         *\n         * The format of the user authentication data depends on the <a\n         * href=\"https:\/\/deepstream.io\/tutorials\/core\/security-overview\/\">authentication<\/a>\n         * method used by the server.\n         *\n         * @param[in] auth User authentication data\n         * @param[in] callback A LoginCallback that will be invoked with the\n         * user data on successful login.\n         * in `p_user_data` if the reference is not `NULL`.\n         *\/\n        void login(const json::object_t &auth, const LoginCallback &callback)\n        {\n            const std::string auth_str(json(auth).dump());\n            const Buffer auth_buff(auth_str);\n\n            const Client::LoginCallback core_callback([callback, this](const Buffer &&login_data) {\n                const json data = type_serializer_.prefixed_to_json(login_data);\n                callback(std::move(data));\n            });\n\n            client_.login(auth_buff, core_callback);\n        }\n\n        void close();\n\n        ConnectionState get_connection_state() const\n        {\n            return client_.get_connection_state();\n        }\n\n\n        struct EventWrapper {\n            typedef std::function<void(const json &)> SubscribeFn;\n            typedef std::function<bool(const std::string &, bool)> ListenFn;\n\n            EventWrapper() = delete;\n\n            EventWrapper(const EventWrapper &) = delete;\n\n            EventWrapper &operator=(const EventWrapper &) = delete;\n\n            EventWrapper(Client &client, ErrorHandler &error_handler, TypeSerializer &type_serializer)\n                : client_(client)\n                , error_handler_(error_handler)\n                , type_serializer_(type_serializer)\n            {\n            }\n\n            void emit(const std::string &name, json data)\n            {\n                const Buffer &data_buff = type_serializer_.to_prefixed_buffer(data);\n                const Buffer name_buff(name);\n                client_.event.emit(name_buff, data_buff);\n            }\n\n            SubscriptionId subscribe(const std::string &name, SubscribeFn callback)\n            {\n                Buffer name_buff(name);\n                Event::SubscribeFn core_callback([callback, this](const Buffer &prefixed_buff) {\n                    const json &data = type_serializer_.prefixed_to_json(prefixed_buff);\n                    callback(data);\n                });\n                SubscriptionId subscription_id = client_.event.subscribe(name_buff, core_callback);\n                return subscription_id;\n            }\n\n            void unsubscribe(const std::string &name, SubscriptionId subscription_id)\n            {\n                Buffer name_buff(name);\n                client_.event.unsubscribe(name_buff, subscription_id);\n            }\n\n            void listen(const std::string &pattern, const ListenFn callback)\n            {\n                Event::ListenFn core_callback([callback](const Event::Name &match, bool is_subscribed) -> bool {\n                    const std::string pattern_str(match.data(), match.size());\n                    return callback(pattern_str, is_subscribed);\n                });\n                Event::Name pattern_buff(pattern);\n                client_.event.listen(pattern_buff, core_callback);\n            }\n\n            void unlisten(const std::string &pattern)\n            {\n                Buffer pattern_buff(pattern);\n                client_.event.unlisten(pattern_buff);\n            }\n\n        private:\n            Client &client_;\n            ErrorHandler &error_handler_;\n            TypeSerializer &type_serializer_;\n        };\n\n        struct PresenceWrapper {\n            typedef std::function<void(const std::string &name, bool online)> SubscribeFn;\n\n            typedef std::vector<std::string> UserList;\n            typedef std::function<void(const UserList&)> QueryFn;\n\n            PresenceWrapper() = delete;\n\n            PresenceWrapper(const PresenceWrapper &) = delete;\n\n            PresenceWrapper &operator=(const PresenceWrapper &) = delete;\n\n            PresenceWrapper(Client &client, ErrorHandler &error_handler)\n                : client_(client)\n                , error_handler_(error_handler)\n            {\n            }\n\n            SubscriptionId subscribe(SubscribeFn callback)\n            {\n                Presence::SubscribeFn core_callback([callback, this](const Buffer &name, bool online) {\n                    callback(std::string(name.data(), name.size()), online);\n                });\n                return client_.presence.subscribe(core_callback);\n            }\n\n            void unsubscribe(SubscriptionId id)\n            {\n                client_.presence.unsubscribe(id);\n            }\n\n            void get_all(QueryFn callback)\n            {\n                Presence::QueryFn core_callback([callback, this](const std::vector<Buffer> users) {\n                    std::vector<std::string> users_str(users.size());\n                    for (std::size_t i = 0; i < users.size(); ++i) {\n                        const Buffer &user = users[i];\n                        users_str[i] = std::string(user.data(), user.size());\n                    }\n                    callback(users_str);\n                });\n                client_.presence.get_all(core_callback);\n            }\n\n        private:\n            Client &client_;\n            ErrorHandler &error_handler_;\n        };\n\n    private:\n        PocoWSHandler wsh_;\n        BasicErrorHandler error_handler_;\n        Client client_;\n        TypeSerializer type_serializer_;\n\n    public:\n        EventWrapper event;\n        PresenceWrapper presence;\n    };\n    }\n\n#endif \/\/ DEEPSTREAM_HPP\n<commit_msg>refactor: struct Deepstream -> class Deepstream<commit_after>\/*\n * Copyright 2017 deepstreamHub 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 *\/\n#ifndef DEEPSTREAM_HPP\n#define DEEPSTREAM_HPP\n\n#include <deepstream\/core\/buffer.hpp>\n#include <deepstream\/core\/client.hpp>\n#include <deepstream\/core\/error_handler.hpp>\n#include <deepstream\/core\/event.hpp>\n#include <deepstream\/core\/presence.hpp>\n#include <deepstream\/core\/version.hpp>\n#include <deepstream\/lib\/poco-ws.hpp>\n#include <deepstream\/lib\/basic-error-handler.hpp>\n#include <deepstream\/lib\/json.hpp>\n#include <deepstream\/lib\/type-serializer.hpp>\n\n#include <string>\n#include <exception>\n\nnamespace deepstream {\n\n    using json = nlohmann::json;\n\n    class Deepstream {\n\n    public:\n        typedef std::function<void(const json &&client_data)> LoginCallback;\n\n        Deepstream() = delete;\n\n        Deepstream(const Deepstream &) = delete;\n\n        Deepstream &operator=(const Deepstream &) = delete;\n\n        Deepstream(const std::string &uri)\n            : wsh_()\n            , error_handler_()\n            , client_(uri, wsh_, error_handler_)\n            , type_serializer_(error_handler_)\n            , event(client_, error_handler_, type_serializer_)\n            , presence(client_, error_handler_)\n        {\n        }\n\n        \/**\n         * This function reads all incoming messages from the websocket and\n         * executes the appropriate callbacks; it returns when there are no\n         * messages left.\n         *\/\n        void process_messages()\n        {\n            wsh_.process_messages();\n        }\n\n        void login()\n        {\n            const json::object_t auth({});\n            login(auth);\n        }\n\n        void login(const json::object_t &auth)\n        {\n            const LoginCallback callback;\n            login(auth, callback);\n        }\n\n        void login(const LoginCallback &callback)\n        {\n            login(json({}), callback);\n        }\n\n        \/**\n         * Given a client in `AWAIT_CONNECTION` state, this function attempts to\n         * log in with the given authentication data.\n         *\n         * The format of the user authentication data depends on the <a\n         * href=\"https:\/\/deepstream.io\/tutorials\/core\/security-overview\/\">authentication<\/a>\n         * method used by the server.\n         *\n         * @param[in] auth User authentication data\n         * @param[in] callback A LoginCallback that will be invoked with the\n         * user data on successful login.\n         * in `p_user_data` if the reference is not `NULL`.\n         *\/\n        void login(const json::object_t &auth, const LoginCallback &callback)\n        {\n            const std::string auth_str(json(auth).dump());\n            const Buffer auth_buff(auth_str);\n\n            const Client::LoginCallback core_callback([callback, this](const Buffer &&login_data) {\n                const json data = type_serializer_.prefixed_to_json(login_data);\n                callback(std::move(data));\n            });\n\n            client_.login(auth_buff, core_callback);\n        }\n\n        void close();\n\n        ConnectionState get_connection_state() const\n        {\n            return client_.get_connection_state();\n        }\n\n\n        struct EventWrapper {\n            typedef std::function<void(const json &)> SubscribeFn;\n            typedef std::function<bool(const std::string &, bool)> ListenFn;\n\n            EventWrapper() = delete;\n\n            EventWrapper(const EventWrapper &) = delete;\n\n            EventWrapper &operator=(const EventWrapper &) = delete;\n\n            EventWrapper(Client &client, ErrorHandler &error_handler, TypeSerializer &type_serializer)\n                : client_(client)\n                , error_handler_(error_handler)\n                , type_serializer_(type_serializer)\n            {\n            }\n\n            void emit(const std::string &name, json data)\n            {\n                const Buffer &data_buff = type_serializer_.to_prefixed_buffer(data);\n                const Buffer name_buff(name);\n                client_.event.emit(name_buff, data_buff);\n            }\n\n            SubscriptionId subscribe(const std::string &name, SubscribeFn callback)\n            {\n                Buffer name_buff(name);\n                Event::SubscribeFn core_callback([callback, this](const Buffer &prefixed_buff) {\n                    const json &data = type_serializer_.prefixed_to_json(prefixed_buff);\n                    callback(data);\n                });\n                SubscriptionId subscription_id = client_.event.subscribe(name_buff, core_callback);\n                return subscription_id;\n            }\n\n            void unsubscribe(const std::string &name, SubscriptionId subscription_id)\n            {\n                Buffer name_buff(name);\n                client_.event.unsubscribe(name_buff, subscription_id);\n            }\n\n            void listen(const std::string &pattern, const ListenFn callback)\n            {\n                Event::ListenFn core_callback([callback](const Event::Name &match, bool is_subscribed) -> bool {\n                    const std::string pattern_str(match.data(), match.size());\n                    return callback(pattern_str, is_subscribed);\n                });\n                Event::Name pattern_buff(pattern);\n                client_.event.listen(pattern_buff, core_callback);\n            }\n\n            void unlisten(const std::string &pattern)\n            {\n                Buffer pattern_buff(pattern);\n                client_.event.unlisten(pattern_buff);\n            }\n\n        private:\n            Client &client_;\n            ErrorHandler &error_handler_;\n            TypeSerializer &type_serializer_;\n        };\n\n        struct PresenceWrapper {\n            typedef std::function<void(const std::string &name, bool online)> SubscribeFn;\n\n            typedef std::vector<std::string> UserList;\n            typedef std::function<void(const UserList&)> QueryFn;\n\n            PresenceWrapper() = delete;\n\n            PresenceWrapper(const PresenceWrapper &) = delete;\n\n            PresenceWrapper &operator=(const PresenceWrapper &) = delete;\n\n            PresenceWrapper(Client &client, ErrorHandler &error_handler)\n                : client_(client)\n                , error_handler_(error_handler)\n            {\n            }\n\n            SubscriptionId subscribe(SubscribeFn callback)\n            {\n                Presence::SubscribeFn core_callback([callback, this](const Buffer &name, bool online) {\n                    callback(std::string(name.data(), name.size()), online);\n                });\n                return client_.presence.subscribe(core_callback);\n            }\n\n            void unsubscribe(SubscriptionId id)\n            {\n                client_.presence.unsubscribe(id);\n            }\n\n            void get_all(QueryFn callback)\n            {\n                Presence::QueryFn core_callback([callback, this](const std::vector<Buffer> users) {\n                    std::vector<std::string> users_str(users.size());\n                    for (std::size_t i = 0; i < users.size(); ++i) {\n                        const Buffer &user = users[i];\n                        users_str[i] = std::string(user.data(), user.size());\n                    }\n                    callback(users_str);\n                });\n                client_.presence.get_all(core_callback);\n            }\n\n        private:\n            Client &client_;\n            ErrorHandler &error_handler_;\n        };\n\n    private:\n        PocoWSHandler wsh_;\n        BasicErrorHandler error_handler_;\n        Client client_;\n        TypeSerializer type_serializer_;\n\n    public:\n        EventWrapper event;\n        PresenceWrapper presence;\n    };\n    }\n\n#endif \/\/ DEEPSTREAM_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * ImageHasher - C++ version of the Hashing module from SimilarImage\n * Copyright (C) 2014  Nicholas Wright\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 <gtest\/gtest.h>\n#include \"..\/include\/Database.hpp\"\n#include <boost\/filesystem.hpp>\n#include <iostream>\n\nclass DatabaseTest : public :: testing::Test {\nprotected:\n\n\tDatabase* db;\n\tboost::filesystem::path* dbPath;\n\n\tboost::filesystem::path tempfile() {\n\t\treturn boost::filesystem::temp_directory_path() \/= boost::filesystem::unique_path();\n\t}\n\n\tDatabaseTest() {\n\t\tdbPath = new boost::filesystem::path(tempfile());\n\t\tdb = new Database(dbPath->c_str());\n\t}\n\n\t~DatabaseTest() {\n\t\tdb->shutdown();\n\t\tdelete(db);\n\t\tdelete(dbPath);\n\t}\n};\n\nTEST_F(DatabaseTest, dbCreationCustom) {\n\tASSERT_TRUE(boost::filesystem::exists(*dbPath));\n}\n\nTEST_F(DatabaseTest, writeRecords) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tDatabase::db_data dbd2(\"bar\", \"bar\",0);\n\n\tdb->add(dbd1);\n\tdb->add(dbd2);\n\n\tdb->shutdown();\n\n\tASSERT_EQ(2, db->getRecordsWritten());\n}\n\nTEST_F(DatabaseTest, writeRecordsWithInvalid) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tDatabase::db_data dbd2(\"bar\", \"bar\",0);\n\tDatabase::db_data dbd3(\"notValid\", \"\",0);\n\n\tdbd3.status = Database::INVALID;\n\n\tdb->add(dbd1);\n\tdb->add(dbd2);\n\tdb->add(dbd3);\n\n\tdb->shutdown();\n\n\tASSERT_EQ(2, db->getRecordsWritten());\n}\n\nTEST_F(DatabaseTest, writeDuplicateRecords) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tDatabase::db_data dbd2(\"foo\",\"foo\",0);\n\n\tdb->add(dbd1);\n\tdb->add(dbd2);\n\n\tdb->shutdown();\n\n\tASSERT_EQ(1, db->getRecordsWritten());\n}\n\nTEST_F(DatabaseTest, writeDuplicateRecordsDifferentPath) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tDatabase::db_data dbd2(\"bar\",\"foo\",0);\n\n\tdb->add(dbd1);\n\tdb->add(dbd2);\n\n\tdb->shutdown();\n\n\tASSERT_EQ(2, db->getRecordsWritten());\n}\n\nTEST_F(DatabaseTest, entryExistsNonExistant) {\n\tDatabase::db_data dbd1(\"foo\");\n\n\tASSERT_FALSE(db->entryExists(dbd1));\n}\n\nTEST_F(DatabaseTest, entryExists) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tdb->add(dbd1);\n\tdb->flush();\n\tASSERT_TRUE(db->entryExists(dbd1));\n\tdb->shutdown();\n}\n\nTEST_F(DatabaseTest, getSHAvalid) {\n\tDatabase::db_data data(\"foobar\", \"ABCD\", 1);\n\n\tdb->add(data);\n\tdb->flush();\n\n\tstd::string shaHash = db->getSHA(fs::path(\"foobar\"));\n\n\tASSERT_EQ(\"ABCD\", shaHash);\n\tdb->shutdown();\n}\n\nTEST_F(DatabaseTest, getSHANotExisting) {\n\tstd::string shaHash = db->getSHA(fs::path(\"unknown\"));\n\n\tASSERT_TRUE(shaHash.empty());\n\tdb->shutdown();\n}\n\nTEST_F(DatabaseTest, add_path_placeholder) {\n\tint id = db->add_path_placeholder(\"placeholder\");\n\tdb->shutdown();\n\n\tASSERT_EQ(1, id);\n}\n\nTEST_F(DatabaseTest, get_files_with_path) {\n\tDatabase::db_data data0(\"\/foo\/bar\", \"ABCD\", 1);\n\tDatabase::db_data data1(\"\/foo\/bar\/bar\", \"ABCD\", 1);\n\tDatabase::db_data data2(\"\/foo\/baz\", \"ABCD\", 1);\n\tDatabase::db_data data3(\"\/bar\/foo\", \"ABCD\", 1);\n\tDatabase::db_data data4(\"\/red\/fox\", \"ABCD\", 1);\n\n\tdb->add(data0);\n\tdb->add(data1);\n\tdb->add(data2);\n\tdb->add(data3);\n\tdb->add(data4);\n\n\tdb->flush();\n\n\tfs::path search_path(\"\/foo\/\");\n\n\tstd::list<fs::path> paths = db->getFilesWithPath(search_path);\n\tASSERT_EQ(3,paths.size());\n\n\tpaths.sort();\n\n\tASSERT_STREQ(\"\/foo\/bar\", paths.front().string().c_str());\n\tASSERT_STREQ(\"\/foo\/baz\", paths.back().string().c_str());\n}\n\nTEST_F(DatabaseTest, prunePath) {\n\tDatabase::db_data data0(\"\/foo\/bar\", \"ABCD\", 1);\n\tDatabase::db_data data1(\"\/foo\/bar\/bar\", \"ABCD\", 1);\n\tDatabase::db_data data2(\"\/foo\/baz\", \"ABCD\", 1);\n\tDatabase::db_data data3(\"\/bar\/foo\", \"ABCD\", 1);\n\tDatabase::db_data data4(\"\/red\/fox\", \"ABCD\", 1);\n\n\tdb->add(data0);\n\tdb->add(data1);\n\tdb->add(data2);\n\tdb->add(data3);\n\tdb->add(data4);\n\n\tdb->flush();\n\n\tstd::list<fs::path> to_delete;\n\n\tto_delete.push_back(fs::path(\"\/foo\/bar\"));\n\tto_delete.push_back(fs::path(\"\/foo\/baz\"));\n\n\t\/\/ guard\n\tASSERT_TRUE(db->entryExists(to_delete.front()));\n\tASSERT_TRUE(db->entryExists(to_delete.back()));\n\n\tdb->prunePath(to_delete);\n\n\tASSERT_FALSE(db->entryExists(to_delete.front()));\n\tASSERT_FALSE(db->entryExists(to_delete.back()));\n}\n\nTEST_F(DatabaseTest, getPhash) {\n\tDatabase::db_data data(\"\/foo\/bar\", \"ABCD\", 42);\n\tdb->add(data);\n\tdb->flush();\n\n\tint64_t pHash = db->getPhash(\"\/foo\/bar\");\n\n\tASSERT_EQ(42, pHash);\n}\n\nTEST_F(DatabaseTest, getPhash_invalid_entry) {\n\tDatabase::db_data data(\"\/foo\/bar\", \"ABCD\", 42);\n\tdb->add(data);\n\tdb->flush();\n\n\tint64_t pHash = db->getPhash(\"\/foo\/baz\");\n\n\tASSERT_EQ(-1, pHash);\n}\n\nTEST_F(DatabaseTest, get_hash_phash) {\n\tDatabase::db_data data(\"\/foo\/bar\", \"ABCD\", 42);\n\tdb->add(data);\n\tdb->flush();\n\n\timageHasher::db::table::Hash hash = db->get_hash(42);\n\n\tASSERT_STREQ(\"ABCD\", hash.get_sha256().c_str());\n}\n\nTEST_F(DatabaseTest, get_hash_phash_not_valid) {\n\tDatabase::db_data data(\"\/foo\/bar\", \"ABCD\", 42);\n\tdb->add(data);\n\tdb->flush();\n\n\timageHasher::db::table::Hash hash = db->get_hash(12);\n\n\tASSERT_FALSE(hash.is_valid());\n}\n<commit_msg>Added tests for hash table pruning<commit_after>\/*\n * ImageHasher - C++ version of the Hashing module from SimilarImage\n * Copyright (C) 2014  Nicholas Wright\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 <gtest\/gtest.h>\n#include \"..\/include\/Database.hpp\"\n#include <boost\/filesystem.hpp>\n#include <iostream>\n\nclass DatabaseTest : public :: testing::Test {\nprotected:\n\n\tDatabase* db;\n\tboost::filesystem::path* dbPath;\n\n\tboost::filesystem::path tempfile() {\n\t\treturn boost::filesystem::temp_directory_path() \/= boost::filesystem::unique_path();\n\t}\n\n\tDatabaseTest() {\n\t\tdbPath = new boost::filesystem::path(tempfile());\n\t\tdb = new Database(dbPath->c_str());\n\t}\n\n\t~DatabaseTest() {\n\t\tdb->shutdown();\n\t\tdelete(db);\n\t\tdelete(dbPath);\n\t}\n};\n\nTEST_F(DatabaseTest, dbCreationCustom) {\n\tASSERT_TRUE(boost::filesystem::exists(*dbPath));\n}\n\nTEST_F(DatabaseTest, writeRecords) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tDatabase::db_data dbd2(\"bar\", \"bar\",0);\n\n\tdb->add(dbd1);\n\tdb->add(dbd2);\n\n\tdb->shutdown();\n\n\tASSERT_EQ(2, db->getRecordsWritten());\n}\n\nTEST_F(DatabaseTest, writeRecordsWithInvalid) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tDatabase::db_data dbd2(\"bar\", \"bar\",0);\n\tDatabase::db_data dbd3(\"notValid\", \"\",0);\n\n\tdbd3.status = Database::INVALID;\n\n\tdb->add(dbd1);\n\tdb->add(dbd2);\n\tdb->add(dbd3);\n\n\tdb->shutdown();\n\n\tASSERT_EQ(2, db->getRecordsWritten());\n}\n\nTEST_F(DatabaseTest, writeDuplicateRecords) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tDatabase::db_data dbd2(\"foo\",\"foo\",0);\n\n\tdb->add(dbd1);\n\tdb->add(dbd2);\n\n\tdb->shutdown();\n\n\tASSERT_EQ(1, db->getRecordsWritten());\n}\n\nTEST_F(DatabaseTest, writeDuplicateRecordsDifferentPath) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tDatabase::db_data dbd2(\"bar\",\"foo\",0);\n\n\tdb->add(dbd1);\n\tdb->add(dbd2);\n\n\tdb->shutdown();\n\n\tASSERT_EQ(2, db->getRecordsWritten());\n}\n\nTEST_F(DatabaseTest, entryExistsNonExistant) {\n\tDatabase::db_data dbd1(\"foo\");\n\n\tASSERT_FALSE(db->entryExists(dbd1));\n}\n\nTEST_F(DatabaseTest, entryExists) {\n\tDatabase::db_data dbd1(\"foo\",\"foo\",0);\n\tdb->add(dbd1);\n\tdb->flush();\n\tASSERT_TRUE(db->entryExists(dbd1));\n\tdb->shutdown();\n}\n\nTEST_F(DatabaseTest, getSHAvalid) {\n\tDatabase::db_data data(\"foobar\", \"ABCD\", 1);\n\n\tdb->add(data);\n\tdb->flush();\n\n\tstd::string shaHash = db->getSHA(fs::path(\"foobar\"));\n\n\tASSERT_EQ(\"ABCD\", shaHash);\n\tdb->shutdown();\n}\n\nTEST_F(DatabaseTest, getSHANotExisting) {\n\tstd::string shaHash = db->getSHA(fs::path(\"unknown\"));\n\n\tASSERT_TRUE(shaHash.empty());\n\tdb->shutdown();\n}\n\nTEST_F(DatabaseTest, add_path_placeholder) {\n\tint id = db->add_path_placeholder(\"placeholder\");\n\tdb->shutdown();\n\n\tASSERT_EQ(1, id);\n}\n\nTEST_F(DatabaseTest, get_files_with_path) {\n\tDatabase::db_data data0(\"\/foo\/bar\", \"ABCD\", 1);\n\tDatabase::db_data data1(\"\/foo\/bar\/bar\", \"ABCD\", 1);\n\tDatabase::db_data data2(\"\/foo\/baz\", \"ABCD\", 1);\n\tDatabase::db_data data3(\"\/bar\/foo\", \"ABCD\", 1);\n\tDatabase::db_data data4(\"\/red\/fox\", \"ABCD\", 1);\n\n\tdb->add(data0);\n\tdb->add(data1);\n\tdb->add(data2);\n\tdb->add(data3);\n\tdb->add(data4);\n\n\tdb->flush();\n\n\tfs::path search_path(\"\/foo\/\");\n\n\tstd::list<fs::path> paths = db->getFilesWithPath(search_path);\n\tASSERT_EQ(3,paths.size());\n\n\tpaths.sort();\n\n\tASSERT_STREQ(\"\/foo\/bar\", paths.front().string().c_str());\n\tASSERT_STREQ(\"\/foo\/baz\", paths.back().string().c_str());\n}\n\nTEST_F(DatabaseTest, prunePath) {\n\tDatabase::db_data data0(\"\/foo\/bar\", \"ABCD\", 1);\n\tDatabase::db_data data1(\"\/foo\/bar\/bar\", \"ABCD\", 1);\n\tDatabase::db_data data2(\"\/foo\/baz\", \"ABCD\", 1);\n\tDatabase::db_data data3(\"\/bar\/foo\", \"ABCD\", 1);\n\tDatabase::db_data data4(\"\/red\/fox\", \"ABCD\", 1);\n\n\tdb->add(data0);\n\tdb->add(data1);\n\tdb->add(data2);\n\tdb->add(data3);\n\tdb->add(data4);\n\n\tdb->flush();\n\n\tstd::list<fs::path> to_delete;\n\n\tto_delete.push_back(fs::path(\"\/foo\/bar\"));\n\tto_delete.push_back(fs::path(\"\/foo\/baz\"));\n\n\t\/\/ guard\n\tASSERT_TRUE(db->entryExists(to_delete.front()));\n\tASSERT_TRUE(db->entryExists(to_delete.back()));\n\n\tdb->prunePath(to_delete);\n\n\tASSERT_FALSE(db->entryExists(to_delete.front()));\n\tASSERT_FALSE(db->entryExists(to_delete.back()));\n}\n\nTEST_F(DatabaseTest, getPhash) {\n\tDatabase::db_data data(\"\/foo\/bar\", \"ABCD\", 42);\n\tdb->add(data);\n\tdb->flush();\n\n\tint64_t pHash = db->getPhash(\"\/foo\/bar\");\n\n\tASSERT_EQ(42, pHash);\n}\n\nTEST_F(DatabaseTest, getPhash_invalid_entry) {\n\tDatabase::db_data data(\"\/foo\/bar\", \"ABCD\", 42);\n\tdb->add(data);\n\tdb->flush();\n\n\tint64_t pHash = db->getPhash(\"\/foo\/baz\");\n\n\tASSERT_EQ(-1, pHash);\n}\n\nTEST_F(DatabaseTest, get_hash_phash) {\n\tDatabase::db_data data(\"\/foo\/bar\", \"ABCD\", 42);\n\tdb->add(data);\n\tdb->flush();\n\n\timageHasher::db::table::Hash hash = db->get_hash(42);\n\n\tASSERT_STREQ(\"ABCD\", hash.get_sha256().c_str());\n}\n\nTEST_F(DatabaseTest, get_hash_phash_not_valid) {\n\tDatabase::db_data data(\"\/foo\/bar\", \"ABCD\", 42);\n\tdb->add(data);\n\tdb->flush();\n\n\timageHasher::db::table::Hash hash = db->get_hash(12);\n\n\tASSERT_FALSE(hash.is_valid());\n}\n\nTEST_F(DatabaseTest, prune_hash_table_prune_count) {\n\tdb->add(Database::db_data (\"\/foo\/bar\", \"1\", 41));\n\tdb->add(Database::db_data (\"\/foo\/bar2\", \"2\", 42));\n\tdb->add(Database::db_data (\"\/foo\/bar3\", \"3\", 43));\n\tdb->add(Database::db_data (\"\/baz\/bar\", \"4\", 44));\n\n\tdb->flush();\n\n\tstd::list<boost::filesystem::path> paths;\n\tpaths.push_back(boost::filesystem::path(\"\/foo\/\"));\n\n\tdb->prunePath(paths);\n\n\tint pruned = db->prune_hash_table();\n\n\tASSERT_EQ(3, pruned);\n}\n\nTEST_F(DatabaseTest, prune_hash_table_hash_exists) {\n\tdb->add(Database::db_data (\"\/foo\/bar\", \"1\", 41));\n\tdb->add(Database::db_data (\"\/foo\/bar2\", \"2\", 42));\n\tdb->add(Database::db_data (\"\/foo\/bar3\", \"3\", 43));\n\tdb->add(Database::db_data (\"\/baz\/bar\", \"4\", 44));\n\n\tdb->flush();\n\n\tASSERT_TRUE(db->sha_exists(\"1\"));\n\n\tstd::list<boost::filesystem::path> paths;\n\tpaths.push_back(boost::filesystem::path(\"\/foo\/\"));\n\n\tdb->prunePath(paths);\n\n\tASSERT_FALSE(db->sha_exists(\"1\"));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 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\/*!\n * \\brief Compute the single-precision of the given vector\n * \\param x The vector to compute the sum from (GPU pointer)\n * \\param n The size of the vector\n * \\param s The stride of the vector\n * \\return the sum of the elements of the vector\n *\/\nfloat egblas_ssum(float* x, size_t n, size_t s);\n\n\/*!\n * \\brief Compute the single-precision of the given vector\n * \\param x The vector to compute the sum from (GPU pointer)\n * \\param n The size of the vector\n * \\param s The stride of the vector\n * \\return the sum of the elements of the vector\n *\/\ndouble egblas_dsum(double* x, size_t n, size_t s);\n\n#define EGBLAS_HAS_SSUM true\n#define EGBLAS_HAS_DSUM true\n<commit_msg>Fix doc<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 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\/*!\n * \\brief Compute the single-precision sum of the given vector\n * \\param x The vector to compute the sum from (GPU pointer)\n * \\param n The size of the vector\n * \\param s The stride of the vector\n * \\return the sum of the elements of the vector\n *\/\nfloat egblas_ssum(float* x, size_t n, size_t s);\n\n\/*!\n * \\brief Compute the single-precision sum of the given vector\n * \\param x The vector to compute the sum from (GPU pointer)\n * \\param n The size of the vector\n * \\param s The stride of the vector\n * \\return the sum of the elements of the vector\n *\/\ndouble egblas_dsum(double* x, size_t n, size_t s);\n\n#define EGBLAS_HAS_SSUM true\n#define EGBLAS_HAS_DSUM true\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Listener for shutdown signals (SIGTERM, SIGINT, SIGQUIT).\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"ShutdownListener.hxx\"\n\n#include <inline\/compiler.h>\n#include <daemon\/log.h>\n\n#include <signal.h>\n#include <unistd.h>\n\ninline void\nShutdownListener::SignalCallback(int signo)\n{\n    daemon_log(2, \"caught signal %d, shutting down (pid=%d)\\n\",\n               signo, (int)getpid());\n\n    Disable();\n    callback();\n}\n\nShutdownListener::ShutdownListener(EventLoop &loop, Callback _callback)\n    :event(loop, BIND_THIS_METHOD(SignalCallback)),\n     callback(_callback)\n{\n    event.Add(SIGTERM);\n    event.Add(SIGINT);\n    event.Add(SIGQUIT);\n}\n<commit_msg>event\/ShutdownListener: include cleanup<commit_after>\/*\n * Listener for shutdown signals (SIGTERM, SIGINT, SIGQUIT).\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"ShutdownListener.hxx\"\n\n#include <daemon\/log.h>\n\n#include <signal.h>\n\ninline void\nShutdownListener::SignalCallback(int signo)\n{\n    daemon_log(2, \"caught signal %d, shutting down (pid=%d)\\n\",\n               signo, (int)getpid());\n\n    Disable();\n    callback();\n}\n\nShutdownListener::ShutdownListener(EventLoop &loop, Callback _callback)\n    :event(loop, BIND_THIS_METHOD(SignalCallback)),\n     callback(_callback)\n{\n    event.Add(SIGTERM);\n    event.Add(SIGINT);\n    event.Add(SIGQUIT);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2019-2020 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 <test\/util\/setup_common.h>\n#include <util\/system.h>\n#include <univalue.h>\n\n#ifdef ENABLE_EXTERNAL_SIGNER\n#if defined(WIN32) && !defined(__kernel_entry)\n\/\/ A workaround for boost 1.71 incompatibility with mingw-w64 compiler.\n\/\/ For details see https:\/\/github.com\/bitcoin\/bitcoin\/pull\/22348.\n#define __kernel_entry\n#endif\n#include <boost\/process.hpp>\n#endif \/\/ ENABLE_EXTERNAL_SIGNER\n\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_FIXTURE_TEST_SUITE(system_tests, BasicTestingSetup)\n\n\/\/ At least one test is required (in case ENABLE_EXTERNAL_SIGNER is not defined).\n\/\/ Workaround for https:\/\/github.com\/bitcoin\/bitcoin\/issues\/19128\nBOOST_AUTO_TEST_CASE(dummy)\n{\n    BOOST_CHECK(true);\n}\n\n#ifdef ENABLE_EXTERNAL_SIGNER\n\nbool checkMessage(const std::runtime_error& ex)\n{\n    \/\/ On Linux & Mac: \"No such file or directory\"\n    \/\/ On Windows: \"The system cannot find the file specified.\"\n    const std::string what(ex.what());\n    BOOST_CHECK(what.find(\"file\") != std::string::npos);\n    return true;\n}\n\nbool checkMessageFalse(const std::runtime_error& ex)\n{\n    BOOST_CHECK_EQUAL(ex.what(), std::string(\"RunCommandParseJSON error: process(false) returned 1: \\n\"));\n    return true;\n}\n\nbool checkMessageStdErr(const std::runtime_error& ex)\n{\n    const std::string what(ex.what());\n    BOOST_CHECK(what.find(\"RunCommandParseJSON error:\") != std::string::npos);\n    return checkMessage(ex);\n}\n\nBOOST_AUTO_TEST_CASE(run_command)\n{\n    {\n        const UniValue result = RunCommandParseJSON(\"\");\n        BOOST_CHECK(result.isNull());\n    }\n    {\n#ifdef WIN32\n        const UniValue result = RunCommandParseJSON(\"cmd.exe \/c echo {\\\"success\\\": true}\");\n#else\n        const UniValue result = RunCommandParseJSON(\"echo \\\"{\\\"success\\\": true}\\\"\");\n#endif\n        BOOST_CHECK(result.isObject());\n        const UniValue& success = find_value(result, \"success\");\n        BOOST_CHECK(!success.isNull());\n        BOOST_CHECK_EQUAL(success.getBool(), true);\n    }\n    {\n        \/\/ An invalid command is handled by Boost\n        BOOST_CHECK_EXCEPTION(RunCommandParseJSON(\"invalid_command\"), boost::process::process_error, checkMessage); \/\/ Command failed\n    }\n    {\n        \/\/ Return non-zero exit code, no output to stderr\n        BOOST_CHECK_EXCEPTION(RunCommandParseJSON(\"false\"), std::runtime_error, checkMessageFalse);\n    }\n    {\n        \/\/ Return non-zero exit code, with error message for stderr\n        BOOST_CHECK_EXCEPTION(RunCommandParseJSON(\"ls nosuchfile\"), std::runtime_error, checkMessageStdErr);\n    }\n    {\n        BOOST_REQUIRE_THROW(RunCommandParseJSON(\"echo \\\"{\\\"\"), std::runtime_error); \/\/ Unable to parse JSON\n    }\n    \/\/ Test std::in, except for Windows\n#ifndef WIN32\n    {\n        const UniValue result = RunCommandParseJSON(\"cat\", \"{\\\"success\\\": true}\");\n        BOOST_CHECK(result.isObject());\n        const UniValue& success = find_value(result, \"success\");\n        BOOST_CHECK(!success.isNull());\n        BOOST_CHECK_EQUAL(success.getBool(), true);\n    }\n#endif\n}\n#endif \/\/ ENABLE_EXTERNAL_SIGNER\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>test: Fix \"false\" subtest in system_tests for Windows<commit_after>\/\/ Copyright (c) 2019-2020 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 <test\/util\/setup_common.h>\n#include <util\/system.h>\n#include <univalue.h>\n\n#ifdef ENABLE_EXTERNAL_SIGNER\n#if defined(WIN32) && !defined(__kernel_entry)\n\/\/ A workaround for boost 1.71 incompatibility with mingw-w64 compiler.\n\/\/ For details see https:\/\/github.com\/bitcoin\/bitcoin\/pull\/22348.\n#define __kernel_entry\n#endif\n#include <boost\/process.hpp>\n#endif \/\/ ENABLE_EXTERNAL_SIGNER\n\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_FIXTURE_TEST_SUITE(system_tests, BasicTestingSetup)\n\n\/\/ At least one test is required (in case ENABLE_EXTERNAL_SIGNER is not defined).\n\/\/ Workaround for https:\/\/github.com\/bitcoin\/bitcoin\/issues\/19128\nBOOST_AUTO_TEST_CASE(dummy)\n{\n    BOOST_CHECK(true);\n}\n\n#ifdef ENABLE_EXTERNAL_SIGNER\n\nbool checkMessage(const std::runtime_error& ex)\n{\n    \/\/ On Linux & Mac: \"No such file or directory\"\n    \/\/ On Windows: \"The system cannot find the file specified.\"\n    const std::string what(ex.what());\n    BOOST_CHECK(what.find(\"file\") != std::string::npos);\n    return true;\n}\n\nbool checkMessageStdErr(const std::runtime_error& ex)\n{\n    const std::string what(ex.what());\n    BOOST_CHECK(what.find(\"RunCommandParseJSON error:\") != std::string::npos);\n    return checkMessage(ex);\n}\n\nBOOST_AUTO_TEST_CASE(run_command)\n{\n    {\n        const UniValue result = RunCommandParseJSON(\"\");\n        BOOST_CHECK(result.isNull());\n    }\n    {\n#ifdef WIN32\n        const UniValue result = RunCommandParseJSON(\"cmd.exe \/c echo {\\\"success\\\": true}\");\n#else\n        const UniValue result = RunCommandParseJSON(\"echo \\\"{\\\"success\\\": true}\\\"\");\n#endif\n        BOOST_CHECK(result.isObject());\n        const UniValue& success = find_value(result, \"success\");\n        BOOST_CHECK(!success.isNull());\n        BOOST_CHECK_EQUAL(success.getBool(), true);\n    }\n    {\n        \/\/ An invalid command is handled by Boost\n        BOOST_CHECK_EXCEPTION(RunCommandParseJSON(\"invalid_command\"), boost::process::process_error, checkMessage); \/\/ Command failed\n    }\n    {\n        \/\/ Return non-zero exit code, no output to stderr\n#ifdef WIN32\n        const std::string command{\"cmd.exe \/c call\"};\n#else\n        const std::string command{\"false\"};\n#endif\n        BOOST_CHECK_EXCEPTION(RunCommandParseJSON(command), std::runtime_error, [&](const std::runtime_error& e) {\n            BOOST_CHECK(std::string(e.what()).find(strprintf(\"RunCommandParseJSON error: process(%s) returned 1: \\n\", command)) != std::string::npos);\n            return true;\n        });\n    }\n    {\n        \/\/ Return non-zero exit code, with error message for stderr\n        BOOST_CHECK_EXCEPTION(RunCommandParseJSON(\"ls nosuchfile\"), std::runtime_error, checkMessageStdErr);\n    }\n    {\n        BOOST_REQUIRE_THROW(RunCommandParseJSON(\"echo \\\"{\\\"\"), std::runtime_error); \/\/ Unable to parse JSON\n    }\n    \/\/ Test std::in, except for Windows\n#ifndef WIN32\n    {\n        const UniValue result = RunCommandParseJSON(\"cat\", \"{\\\"success\\\": true}\");\n        BOOST_CHECK(result.isObject());\n        const UniValue& success = find_value(result, \"success\");\n        BOOST_CHECK(!success.isNull());\n        BOOST_CHECK_EQUAL(success.getBool(), true);\n    }\n#endif\n}\n#endif \/\/ ENABLE_EXTERNAL_SIGNER\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>\/\/#include <TCanvas.h>\n\/\/#include <TLegend.h>\n\/\/#include <TRandom3.h>\n\/\/#include \"TH1.h\"\n\/\/#include \"TF1.h\"\n\/\/#include \"TMath.h\"\n#include <string>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass hit\n{\n\tdouble x;\n\tdouble y;\n\t\n\tpublic:\n\t\n\thit(double _x, double _y): x(_x), y(_y) {}\n};\n\n\nclass eeevent\n{\n\tint num1;\n\t\n\tint num_trig;\n\tint num_acq;\n\t\n\tint secs;\n\tint nsecs;\n\t\n\tint clk1;\n\tint clk2;\n\t\n\tvector<hit> event1;\n\tvector<hit> event2;\n\tvector<hit> event3;\n\t\n\tdouble hv1;\n\tdouble hv2;\n\tdouble hv3;\n\t\n\tpublic:\n\t\n\teeevent(int num1, int num_trig, int num_acq, int secs, int nsecs, int clk1, int clk2, double hv1, double hv2, double hv3):\n\t\tnum1(num1), num_trig(num_trig), num_acq(num_acq), secs(secs), nsecs(nsecs),\n\t\tclk1(clk1), clk2(clk2), hv1(hv1), hv2(hv2), hv3(hv3) {}\n\t\n\tvoid gethit(double x, double y, int z) {\n\t\thit newhit(x, y);\n\t\tswitch (z) {\n\t\t\tcase 149:\n\t\t\t\tthis->event1.push_back(newhit);\n\t\t\t\tbreak;\n\t\t\tcase 95:\n\t\t\t\tthis->event2.push_back(newhit);\n\t\t\t\tbreak;\n\t\t\tcase 49:\n\t\t\t\tthis->event3.push_back(newhit);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tcout << \"Unrecognized chamber\" << endl;\n\t\t}\n\t}\n};\n\nint parse(string path)\n{\n\tcout << \"Path given: \" << path << endl;\n\t\n\tifstream file;\n\tfile.open(path);\n\tconst int linesize=65536;\n\tchar* line = (char*)malloc(linesize*sizeof(char));  \/\/ get buffer for every line\n\t\n\tvector<eeevent> evector;               \/\/ vector of events\n\tdouble hv1, hv2, hv3;                  \/\/ variables for high voltage values\n\t\n\twhile (!file.eof()) {\n\t\tfile.getline(line, linesize);       \/\/ fill line\n\t\t\n\t\tchar* piece = strtok (line,\" \\t\");  \/\/ get initial number\n\t\tif (piece==NULL) continue;          \/\/ the file is finished at this point, but better run the eof() check\n\t\tint num1 = atoi(piece);             \/\/ inital number\n\t\tif (num1 == 0) continue;            \/\/ line needs to start with a number, not characters (like the name line)\n\t\t\n\t\tpiece = strtok (NULL, \" \\t\");       \/\/ get descriptor\n\t\tstring descriptor = piece;\n\t\t\n\t\tif (descriptor==\"STATUS\") {\n\t\t\tchar* next=piece+7;              \/\/ hack to get after \"STATUS\"\n\t\t\tsscanf(next, \"HV %lf %*f %lf %*f %lf %*f\", &hv1, &hv2, &hv3); \n\t\t\tcout << \"hv: \" << hv1 << \" - \" << hv2 << \" - \" << hv3 << endl;\n\t\t}\n\t\telse if (descriptor==\"EVENT\") {\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get num_trig\n\t\t\tint num_trig = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get num_acq\n\t\t\tint num_acq = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get seconds\n\t\t\tint secs = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get nseconds\n\t\t\tint nsecs = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get clk1\n\t\t\tint clk1 = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get clk2\n\t\t\tint clk2 = atoi(piece);\n\t\t\t\n\t\t\teeevent neweeevent(num1, num_trig, num_acq, secs, nsecs, clk1, clk2, hv1, hv2, hv3);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get events\n\t\t\twhile (piece != NULL) {\n\t\t\t\tdouble x = atof(piece);\n\t\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get more pieces\n\t\t\t\t\n\t\t\t\tdouble y = atof(piece);\n\t\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get more pieces\n\t\t\t\t\n\t\t\t\tint z = atoi(piece);\n\t\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get more pieces\n\t\t\t\t\n\t\t\t\tneweeevent.gethit(x, y, z);\n\t\t\t}\n\t\t\t\n\t\t\tevector.push_back(neweeevent);\n\t\t}\n\t}\n\n\t\n\treturn 0;\n}\n\nint main(int, char** argv)\n{\n\tparse(argv[1]);\n\treturn 0;\n}\n<commit_msg>Completed parsing part<commit_after>\/\/#include <TCanvas.h>\n\/\/#include <TLegend.h>\n\/\/#include <TRandom3.h>\n\/\/#include \"TH1.h\"\n\/\/#include \"TF1.h\"\n\/\/#include \"TMath.h\"\n#include <string>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass hit\n{\n\tdouble x;\n\tdouble y;\n\t\n\tpublic:\n\t\n\thit(double x, double y): x(x), y(y) {}\n};\n\n\nclass eeevent\n{\n\tint num1;\n\t\n\tint num_trig;\n\tint num_acq;\n\t\n\tint secs;\n\tint nsecs;\n\t\n\tint clk1;\n\tint clk2;\n\t\n\tvector<hit> events1;\n\tvector<hit> events2;\n\tvector<hit> events3;\n\t\n\tdouble hv1;\n\tdouble hv2;\n\tdouble hv3;\n\t\n\tpublic:\n\t\n\teeevent(int num1, int num_trig, int num_acq, int secs, int nsecs, int clk1, int clk2, double hv1, double hv2, double hv3):\n\t\tnum1(num1), num_trig(num_trig), num_acq(num_acq), secs(secs), nsecs(nsecs),\n\t\tclk1(clk1), clk2(clk2), hv1(hv1), hv2(hv2), hv3(hv3) {}\n\t\n\tvoid gethit(double x, double y, int z) {\n\t\thit newhit(x, y);\n\t\tswitch (z) {\n\t\t\tcase 149:\n\t\t\t\tthis->events1.push_back(newhit);\n\t\t\t\tbreak;\n\t\t\tcase 95:\n\t\t\t\tthis->events2.push_back(newhit);\n\t\t\t\tbreak;\n\t\t\tcase 49:\n\t\t\t\tthis->events3.push_back(newhit);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tcout << \"Unrecognized chamber\" << endl;\n\t\t}\n\t}\n};\n\ntypedef vector<eeevent> eeevector;\ntypedef vector<hit> hitvector;\n\nvector<eeevent> parse(string path)\n{\n\tcout << \"Path given: \" << path << endl;\n\t\n\tifstream file;\n\tfile.open(path);\n\tconst int linesize=65536;\n\tchar* line = (char*)malloc(linesize*sizeof(char));  \/\/ get buffer for every line\n\t\n\tvector<eeevent> evector;               \/\/ vector for the events\n\tdouble hv1, hv2, hv3;                  \/\/ variables for high voltage values\n\t\n\twhile (!file.eof()) {\n\t\tfile.getline(line, linesize);       \/\/ fill line\n\t\t\n\t\tchar* piece = strtok (line,\" \\t\");  \/\/ get initial number\n\t\tif (piece==NULL) continue;          \/\/ the file is finished at this point, but better run the eof() check\n\t\tint num1 = atoi(piece);             \/\/ inital number\n\t\tif (num1 == 0) continue;            \/\/ line needs to start with a number, not characters (like the name line)\n\t\t\n\t\tpiece = strtok (NULL, \" \\t\");       \/\/ get descriptor\n\t\tstring descriptor = piece;\n\t\t\n\t\tif (descriptor==\"STATUS\") {\n\t\t\tchar* next=piece+7;              \/\/ hack to get after \"STATUS\"\n\t\t\tsscanf(next, \"HV %lf %*f %lf %*f %lf %*f\", &hv1, &hv2, &hv3); \n\t\t\t\/\/cout << \"hv: \" << hv1 << \" - \" << hv2 << \" - \" << hv3 << endl;\n\t\t}\n\t\telse if (descriptor==\"EVENT\") {\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get num_trig\n\t\t\tint num_trig = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get num_acq\n\t\t\tint num_acq = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get seconds\n\t\t\tint secs = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get nseconds\n\t\t\tint nsecs = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get clk1\n\t\t\tint clk1 = atoi(piece);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get clk2\n\t\t\tint clk2 = atoi(piece);\n\t\t\t\n\t\t\teeevent neweeevent(num1, num_trig, num_acq, secs, nsecs, clk1, clk2, hv1, hv2, hv3);\n\t\t\t\n\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get events\n\t\t\twhile (piece != NULL) {\n\t\t\t\tdouble x = atof(piece);\n\t\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get more pieces\n\t\t\t\t\n\t\t\t\tif (piece!=NULL) {\n\t\t\t\t\tdouble y = atof(piece);\n\t\t\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get more pieces\n\t\t\t\t\t\n\t\t\t\t\tint z = atoi(piece);\n\t\t\t\t\tpiece = strtok (NULL, \" \\t\");    \/\/ get more pieces\n\t\t\t\t\t\n\t\t\t\t\tneweeevent.gethit(x, y, z);\n\t\t\t\t\t\/\/cout << x << \" - \" << y << \" - \" << z << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tevector.push_back(neweeevent);\n\t\t}\n\t}\n\tcout << \"Parsing complete: \" << evector.size() << \" events captured\" << endl;\n\t\n\treturn evector;\n}\n\nvoid cluster_size_study(eeevector evector)\n{\n\t\n\t\n}\n\nint main(int, char** argv)\n{\n\teeevector evector;\n\tevector = parse(argv[1]);\n\t\n\tcluster_size_study(evector);\n\t\n\t\/\/compute_eff(1, evector);\n\t\n\treturn 0;\n}\n\n\n\/* Code graveyard\n*\n* \n* \n\thitvector hvector;\n\tswitch (nchamber) {\n\t\tcase 1: hvector=evector.events1; break;\n\t\tcase 2: hvector=evector.events2; break;\n\t\tcase 3: hvector=evector.events3; break;\n\t\tdefault: cout << \"Unexpected chamber number\" << endl;\n\t}\n* \n* \n*\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"factory.h\"\n#include <chrono>\n#include <thread>\n\nvoid synopsis()\n{\n    std::cout << \"save_frames\"\n              << \"  [  \"\n              << std::endl << \"                \"\n              << \" help \"\n              << std::endl << \"                \"\n              << \" epiphan   xvid | h265   sdi | dvi \"\n              << std::endl << \"                \"\n              << \" file   <\/file\/path>   xvid | h265 \"\n              << std::endl << \"                \"\n              << \" chess   xvid | h265   <width>   <height> \"\n              << std::endl << \"            \"\n              << \" ]\"\n              << std::endl;\n}\n\nenum TestMode { Epiphan, File, Chessboard };\n\nenum TestMode test_mode = TestMode::Chessboard;\nenum gg::Target codec = gg::Target::File_XviD;\nstd::string codec_string = \"xvid\", filetype = \"avi\";\n\/* following numbers purposefully odd,\n * to test robustness when odd frame\n * width and\/or height provided, whereas\n * H265 requires even\n *\/\nint width = 11, height = 7, square_size = 61;\nfloat fps = 20;\nint duration = 1; \/\/ min\nint num_frames = duration * 60 * fps;\nint i = 0;\nVideoFrame_BGRA frame;\ncv::Mat image(height * square_size, width * square_size, CV_8UC4);\ncv::VideoCapture cap;\nenum gg::Device port = gg::Device::DVI2PCIeDuo_DVI;\nstd::string port_string = \"dvi\";\nint sleep_duration = 0;\nIVideoSource * epiphan = NULL;\n\nvoid init(int argc, char ** argv)\n{\n    std::vector<std::string> args;\n    for (int i = 0; i < argc; i++)\n        args.push_back(std::string(argv[i]));\n\n    if (args[1]==\"help\")\n    {\n        synopsis(); exit(0);\n    }\n\n    if (args[1]==\"epiphan\")\n    {\n        test_mode = TestMode::Epiphan;\n\n        if (argc < 4)\n        {\n            synopsis(); exit(-1);\n        }\n\n        codec_string = args[2];\n        port_string = args[3];\n\n        if (port_string == \"sdi\")\n            port = gg::Device::DVI2PCIeDuo_SDI;\n        else if (port_string == \"dvi\")\n            port = gg::Device::DVI2PCIeDuo_DVI;\n        else\n        {\n            std::cerr << \"Port \" << port_string << \" not recognised\" << std::endl;\n            synopsis();\n            exit(-1);\n        }\n\n        epiphan = gg::Factory::connect(port);\n        epiphan->set_sub_frame(600, 185, 678, 688); \/\/ optimal for Storz 27020 AA straight\n\n        sleep_duration = (int)(1000\/fps); \/\/ ms\n    }\n\n    else if (args[1]==\"file\")\n    {\n        test_mode = TestMode::File;\n\n        if (argc < 4)\n        {\n            synopsis(); exit(-1);\n        }\n\n        cap.open(args[2]);\n        if (not cap.isOpened())\n        {\n            std::cerr << \"File \" << args[2]\n                      << \" could not be opened\"\n                      << std::endl;\n            exit(-1);\n        }\n\n        codec_string = args[3];\n        num_frames = cap.get(CV_CAP_PROP_FRAME_COUNT);\n        fps = cap.get(CV_CAP_PROP_FPS);\n        duration = (num_frames \/ fps) \/ 60;\n    }\n\n    else if (args[1]==\"chess\")\n    {\n        test_mode = TestMode::Chessboard;\n\n        if (argc < 5)\n        {\n            synopsis(); exit(-1);\n        }\n\n        codec_string = args[2];\n        width = atoi(argv[3]); height = atoi(argv[4]);\n    }\n\n    else\n    {\n        synopsis(); exit(-1);\n    }\n\n    \/\/ health checks\n    if (codec_string == \"xvid\")\n        codec = gg::Target::File_XviD;\n    else if (codec_string == \"h265\")\n    {\n        codec = gg::Target::File_H265;\n        filetype = \"mp4\";\n    }\n    else\n    {\n        std::cerr << \"Codec \" << codec_string << \" not recognised\" << std::endl;\n        synopsis();\n        exit(-1);\n    }\n}\n\nstd::string which_file()\n{\n    std::string filename;\n    filename.append(std::to_string(duration))\n            .append(\"min_\")\n            .append(codec_string);\n    switch(test_mode)\n    {\n    case TestMode::Epiphan:\n        filename.append(\"_epiphan.\"); break;\n    case TestMode::File:\n        filename.append(\"_from_file.\"); break;\n    case TestMode::Chessboard:\n        filename.append(\"_colour_chessboard.\"); break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n    filename.append(filetype);\n    return filename;\n}\n\nvoid get_frame(VideoFrame_BGRA & frame)\n{\n    \/\/ Chessboard params\n    float elapsed, remaining;\n    int red, green, blue, alpha, min_intensity;\n    switch(test_mode)\n    {\n    case TestMode::Chessboard:\n        elapsed = (((float) i) \/ num_frames);\n        remaining = 1 - elapsed;\n        red = 0, green = 0, blue = 0, alpha = 0;\n        min_intensity = 50; \/\/ don't want black\n        for (int row = 0; row < height; row++)\n        {\n            green = min_intensity + elapsed * (((float) row) \/ height) * (255 - min_intensity);\n            for (int col = 0; col < width; col++)\n            {\n                red = min_intensity + elapsed * (((float) col) \/ width) * (255 - min_intensity);\n                blue = min_intensity +\n                       remaining *\n                            sqrt( ((float)(row*row + col*col))\n                                  \/\n                                  (height*height+width*width) ) * (255 - min_intensity);\n                cv::Mat square(square_size, square_size, CV_8UC4, cv::Scalar(blue, green, red, alpha));\n                square.copyTo(image(cv::Rect(col * square_size , row * square_size,\n                                             square.cols, square.rows)));\n            }\n        }\n        frame.init_from_opencv_mat(image);\n        break;\n    case TestMode::Epiphan:\n        epiphan->get_frame(frame);\n        break;\n    case TestMode::File:\n        cap >> image;\n        cv::cvtColor(image, image, CV_BGR2BGRA);\n        frame.init_from_opencv_mat(image);\n        break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n}\n\nauto start = std::chrono::steady_clock::now();\nfloat elapsed;\nvoid time_left()\n{\n    if (i % 5 == 0)\n        std::cout << \"Saving frame \" << i+1 << \" of \" << num_frames;\n\n    int left;\n\n    switch(test_mode)\n    {\n    case TestMode::Chessboard:\n        \/\/ nop\n        break;\n    case TestMode::File:\n    case TestMode::Epiphan:\n        elapsed = std::chrono::duration_cast<std::chrono::seconds>(\n                    std::chrono::steady_clock::now() - start).count();\n        left = ((float) num_frames - i + 1) * elapsed \/ (i+1);\n        std::cout << \" (\" << left << \" sec. left)\";\n        break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n\n    std::cout << \"\\r\";\n}\n\nvoid wait_for_next()\n{\n    switch(test_mode)\n    {\n    case TestMode::File:\n    case TestMode::Chessboard:\n        \/\/ nop\n        break;\n    case TestMode::Epiphan:\n        std::this_thread::sleep_for(std::chrono::milliseconds(sleep_duration));\n        break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n}\n\nvoid finalise()\n{\n    switch(test_mode)\n    {\n    case TestMode::File:\n    case TestMode::Chessboard:\n        \/\/ nop\n        break;\n    case TestMode::Epiphan:\n        gg::Factory::disconnect(port);\n        break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n}\n\nint main(int argc, char ** argv)\n{\n    try\n    {\n        init(argc, argv);\n\n        gg::IVideoTarget * file = gg::Factory::create(codec);\n        std::string filename = which_file();\n        file->init(filename, fps);\n        std::cout << \"Saving to file \" << filename << std::endl;\n\n        start = std::chrono::steady_clock::now();\n        for (i = 0; i < num_frames; i++)\n        {\n            time_left();\n            get_frame(frame);\n            file->append(frame);\n            wait_for_next();\n        }\n\n        file->finalise();\n\n        finalise();\n    }\n    catch (gg::VideoTargetError & e)\n    {\n        std::cerr << e.what() << std::endl;\n        return -1;\n    }\n    catch (gg::DeviceOffline & e)\n    {\n        std::cerr << e.what() << std::endl;\n        return -1;\n    }\n\n    return 0;\n}\n<commit_msg>Issue #21: 60 fps as default in one-for-all test<commit_after>#include \"factory.h\"\n#include <chrono>\n#include <thread>\n\nvoid synopsis()\n{\n    std::cout << \"save_frames\"\n              << \"  [  \"\n              << std::endl << \"                \"\n              << \" help \"\n              << std::endl << \"                \"\n              << \" epiphan   xvid | h265   sdi | dvi \"\n              << std::endl << \"                \"\n              << \" file   <\/file\/path>   xvid | h265 \"\n              << std::endl << \"                \"\n              << \" chess   xvid | h265   <width>   <height> \"\n              << std::endl << \"            \"\n              << \" ]\"\n              << std::endl;\n}\n\nenum TestMode { Epiphan, File, Chessboard };\n\nenum TestMode test_mode = TestMode::Chessboard;\nenum gg::Target codec = gg::Target::File_XviD;\nstd::string codec_string = \"xvid\", filetype = \"avi\";\n\/* following numbers purposefully odd,\n * to test robustness when odd frame\n * width and\/or height provided, whereas\n * H265 requires even\n *\/\nint width = 11, height = 7, square_size = 61;\nfloat fps = 60;\nint duration = 1; \/\/ min\nint num_frames = duration * 60 * fps;\nint i = 0;\nVideoFrame_BGRA frame;\ncv::Mat image(height * square_size, width * square_size, CV_8UC4);\ncv::VideoCapture cap;\nenum gg::Device port = gg::Device::DVI2PCIeDuo_DVI;\nstd::string port_string = \"dvi\";\nint sleep_duration = 0;\nIVideoSource * epiphan = NULL;\n\nvoid init(int argc, char ** argv)\n{\n    std::vector<std::string> args;\n    for (int i = 0; i < argc; i++)\n        args.push_back(std::string(argv[i]));\n\n    if (args[1]==\"help\")\n    {\n        synopsis(); exit(0);\n    }\n\n    if (args[1]==\"epiphan\")\n    {\n        test_mode = TestMode::Epiphan;\n\n        if (argc < 4)\n        {\n            synopsis(); exit(-1);\n        }\n\n        codec_string = args[2];\n        port_string = args[3];\n\n        if (port_string == \"sdi\")\n            port = gg::Device::DVI2PCIeDuo_SDI;\n        else if (port_string == \"dvi\")\n            port = gg::Device::DVI2PCIeDuo_DVI;\n        else\n        {\n            std::cerr << \"Port \" << port_string << \" not recognised\" << std::endl;\n            synopsis();\n            exit(-1);\n        }\n\n        epiphan = gg::Factory::connect(port);\n        epiphan->set_sub_frame(600, 185, 678, 688); \/\/ optimal for Storz 27020 AA straight\n\n        sleep_duration = (int)(1000\/fps); \/\/ ms\n    }\n\n    else if (args[1]==\"file\")\n    {\n        test_mode = TestMode::File;\n\n        if (argc < 4)\n        {\n            synopsis(); exit(-1);\n        }\n\n        cap.open(args[2]);\n        if (not cap.isOpened())\n        {\n            std::cerr << \"File \" << args[2]\n                      << \" could not be opened\"\n                      << std::endl;\n            exit(-1);\n        }\n\n        codec_string = args[3];\n        num_frames = cap.get(CV_CAP_PROP_FRAME_COUNT);\n        fps = cap.get(CV_CAP_PROP_FPS);\n        duration = (num_frames \/ fps) \/ 60;\n    }\n\n    else if (args[1]==\"chess\")\n    {\n        test_mode = TestMode::Chessboard;\n\n        if (argc < 5)\n        {\n            synopsis(); exit(-1);\n        }\n\n        codec_string = args[2];\n        width = atoi(argv[3]); height = atoi(argv[4]);\n    }\n\n    else\n    {\n        synopsis(); exit(-1);\n    }\n\n    \/\/ health checks\n    if (codec_string == \"xvid\")\n        codec = gg::Target::File_XviD;\n    else if (codec_string == \"h265\")\n    {\n        codec = gg::Target::File_H265;\n        filetype = \"mp4\";\n    }\n    else\n    {\n        std::cerr << \"Codec \" << codec_string << \" not recognised\" << std::endl;\n        synopsis();\n        exit(-1);\n    }\n}\n\nstd::string which_file()\n{\n    std::string filename;\n    filename.append(std::to_string(duration))\n            .append(\"min_\")\n            .append(codec_string);\n    switch(test_mode)\n    {\n    case TestMode::Epiphan:\n        filename.append(\"_epiphan.\"); break;\n    case TestMode::File:\n        filename.append(\"_from_file.\"); break;\n    case TestMode::Chessboard:\n        filename.append(\"_colour_chessboard.\"); break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n    filename.append(filetype);\n    return filename;\n}\n\nvoid get_frame(VideoFrame_BGRA & frame)\n{\n    \/\/ Chessboard params\n    float elapsed, remaining;\n    int red, green, blue, alpha, min_intensity;\n    switch(test_mode)\n    {\n    case TestMode::Chessboard:\n        elapsed = (((float) i) \/ num_frames);\n        remaining = 1 - elapsed;\n        red = 0, green = 0, blue = 0, alpha = 0;\n        min_intensity = 50; \/\/ don't want black\n        for (int row = 0; row < height; row++)\n        {\n            green = min_intensity + elapsed * (((float) row) \/ height) * (255 - min_intensity);\n            for (int col = 0; col < width; col++)\n            {\n                red = min_intensity + elapsed * (((float) col) \/ width) * (255 - min_intensity);\n                blue = min_intensity +\n                       remaining *\n                            sqrt( ((float)(row*row + col*col))\n                                  \/\n                                  (height*height+width*width) ) * (255 - min_intensity);\n                cv::Mat square(square_size, square_size, CV_8UC4, cv::Scalar(blue, green, red, alpha));\n                square.copyTo(image(cv::Rect(col * square_size , row * square_size,\n                                             square.cols, square.rows)));\n            }\n        }\n        frame.init_from_opencv_mat(image);\n        break;\n    case TestMode::Epiphan:\n        epiphan->get_frame(frame);\n        break;\n    case TestMode::File:\n        cap >> image;\n        cv::cvtColor(image, image, CV_BGR2BGRA);\n        frame.init_from_opencv_mat(image);\n        break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n}\n\nauto start = std::chrono::steady_clock::now();\nfloat elapsed;\nvoid time_left()\n{\n    if (i % 5 == 0)\n        std::cout << \"Saving frame \" << i+1 << \" of \" << num_frames;\n\n    int left;\n\n    switch(test_mode)\n    {\n    case TestMode::Chessboard:\n        \/\/ nop\n        break;\n    case TestMode::File:\n    case TestMode::Epiphan:\n        elapsed = std::chrono::duration_cast<std::chrono::seconds>(\n                    std::chrono::steady_clock::now() - start).count();\n        left = ((float) num_frames - i + 1) * elapsed \/ (i+1);\n        std::cout << \" (\" << left << \" sec. left)\";\n        break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n\n    std::cout << \"\\r\";\n}\n\nvoid wait_for_next()\n{\n    switch(test_mode)\n    {\n    case TestMode::File:\n    case TestMode::Chessboard:\n        \/\/ nop\n        break;\n    case TestMode::Epiphan:\n        std::this_thread::sleep_for(std::chrono::milliseconds(sleep_duration));\n        break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n}\n\nvoid finalise()\n{\n    switch(test_mode)\n    {\n    case TestMode::File:\n    case TestMode::Chessboard:\n        \/\/ nop\n        break;\n    case TestMode::Epiphan:\n        gg::Factory::disconnect(port);\n        break;\n    default:\n        std::cerr << \"Test mode not set\" << std::endl;\n        exit(-1);\n    }\n}\n\nint main(int argc, char ** argv)\n{\n    try\n    {\n        init(argc, argv);\n\n        gg::IVideoTarget * file = gg::Factory::create(codec);\n        std::string filename = which_file();\n        file->init(filename, fps);\n        std::cout << \"Saving to file \" << filename << std::endl;\n\n        start = std::chrono::steady_clock::now();\n        for (i = 0; i < num_frames; i++)\n        {\n            time_left();\n            get_frame(frame);\n            file->append(frame);\n            wait_for_next();\n        }\n\n        file->finalise();\n\n        finalise();\n    }\n    catch (gg::VideoTargetError & e)\n    {\n        std::cerr << e.what() << std::endl;\n        return -1;\n    }\n    catch (gg::DeviceOffline & e)\n    {\n        std::cerr << e.what() << std::endl;\n        return -1;\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n\n#include <zxtk\/modules\/memory.cpp>\n\n#include <iostream>\n\nusing namespace std;\n\nstruct Memory : ::testing::Test\n{\n    zxtk::memory::Memory m;\n}\n\nTEST(Memory, DefaultConstructor)\n{\n    cout << \"Created memory\";\n}\n<commit_msg>Fixed tiepo<commit_after>#include <gtest\/gtest.h>\n\n#include <zxtk\/modules\/memory.hpp>\n\n#include <iostream>\n\nusing namespace std;\n\nstruct Memory : ::testing::Test\n{\n    zxtk::memory::Memory m;\n}\n\nTEST(Memory, DefaultConstructor)\n{\n    cout << \"Created memory\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n   +----------------------------------------------------------------------+\n   | HipHop for PHP                                                       |\n   +----------------------------------------------------------------------+\n   | Copyright (c) 2010-2013 Facebook, Inc. (http:\/\/www.facebook.com)     |\n   +----------------------------------------------------------------------+\n   | This source file is subject to version 3.01 of the PHP 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.php.net\/license\/3_01.txt                                  |\n   | If you did not receive a copy of the PHP license and are unable to   |\n   | obtain it through the world-wide-web, please send a note to          |\n   | license@php.net so we can mail you a copy immediately.               |\n   +----------------------------------------------------------------------+\n*\/\n\n#include \"hphp\/runtime\/base\/base-includes.h\"\n#include \"msgpack-variant.h\"\n\n#define MSGPACK_HHVM_VERSION \"0.0.1\"\n\nnamespace HPHP {\n\nstatic String HHVM_FUNCTION(msgpack_pack, const Variant &var) {\n  msgpack::sbuffer sbuf;\n  msgpack::pack(sbuf, var);\n\n  return String(sbuf.data(), sbuf.size(), CopyString);\n}\n\nstatic Variant HHVM_FUNCTION(msgpack_unpack, const String &pack) {\n  msgpack::zone zone;\n  msgpack::object obj;\n\n  try {\n    msgpack::unpack(pack.c_str(), pack.size(), NULL, &zone, &obj);\n  } catch (msgpack::type_error&) {\n    raise_warning(\"unpack error\");\n    return false;\n  }\n\n  Variant v;\n  obj.convert(&v);\n\n  return v;\n}\n\nstatic class MsgpackExtension : public Extension {\n public:\n  MsgpackExtension() : Extension(\"msgpack\", MSGPACK_HHVM_VERSION) {}\n  virtual void moduleInit() {\n    HHVM_FE(msgpack_pack);\n    HHVM_FE(msgpack_unpack);\n\n    HHVM_FALIAS(msgpack_serialize, msgpack_pack);\n    HHVM_FALIAS(msgpack_unserialize, msgpack_unpack);\n\n    loadSystemlib();\n  }\n} s_msgpack_extension;\n\nHHVM_GET_MODULE(msgpack);\n\n} \/\/ namespace HPHP\n<commit_msg>Fixed compability for HHVM 2.*<commit_after>\/*\n   +----------------------------------------------------------------------+\n   | HipHop for PHP                                                       |\n   +----------------------------------------------------------------------+\n   | Copyright (c) 2010-2013 Facebook, Inc. (http:\/\/www.facebook.com)     |\n   +----------------------------------------------------------------------+\n   | This source file is subject to version 3.01 of the PHP 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.php.net\/license\/3_01.txt                                  |\n   | If you did not receive a copy of the PHP license and are unable to   |\n   | obtain it through the world-wide-web, please send a note to          |\n   | license@php.net so we can mail you a copy immediately.               |\n   +----------------------------------------------------------------------+\n*\/\n\n#include \"hphp\/runtime\/base\/base-includes.h\"\n#include \"msgpack-variant.h\"\n\n#define MSGPACK_HHVM_VERSION \"0.0.1\"\n\nnamespace HPHP {\n\nstatic String HHVM_FUNCTION(msgpack_pack, const Variant &var) {\n  msgpack::sbuffer sbuf;\n  msgpack::pack(sbuf, var);\n\n  return String(sbuf.data(), sbuf.size(), CopyString);\n}\n\nstatic Variant HHVM_FUNCTION(msgpack_unpack, const String &pack) {\n  msgpack::zone zone;\n  msgpack::object obj;\n\n  try {\n    msgpack::unpack(pack.c_str(), pack.size(), NULL, &zone, &obj);\n  } catch (msgpack::type_error&) {\n    raise_warning(\"unpack error\");\n    return false;\n  }\n\n  Variant v;\n  obj.convert(&v);\n\n  return v;\n}\n\n#ifndef HHVM_FALIAS\n#define HHVM_FALIAS(fn, falias) HHVM_NAMED_FE(fn, HHVM_FN(falias))\n#endif\n\nstatic class MsgpackExtension : public Extension {\n public:\n  MsgpackExtension() : Extension(\"msgpack\", MSGPACK_HHVM_VERSION) {}\n  virtual void moduleInit() {\n    HHVM_FE(msgpack_pack);\n    HHVM_FE(msgpack_unpack);\n\n    HHVM_FALIAS(msgpack_serialize, msgpack_pack);\n    HHVM_FALIAS(msgpack_unserialize, msgpack_unpack);\n\n    loadSystemlib();\n  }\n} s_msgpack_extension;\n\nHHVM_GET_MODULE(msgpack);\n\n} \/\/ namespace HPHP\n<|endoftext|>"}
{"text":"<commit_before>\/\/----------------------------------------------------------------------------\n\/\/\/ \\file   enum.hpp\n\/\/\/ \\author Serge Aleynikov\n\/\/----------------------------------------------------------------------------\n\/\/\/ \\brief This file defines enum stringification declaration macro.\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2015 Serge Aleynikov <saleyn@gmail.com>\n\/\/ Created: 2015-04-11\n\/\/----------------------------------------------------------------------------\n\/*\n***** BEGIN LICENSE BLOCK *****\n\nThis file is part of the utxx open-source project.\n\nCopyright (c) 2015 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#pragma once\n\n#include <boost\/preprocessor\/variadic\/to_seq.hpp>\n#include <boost\/preprocessor\/variadic\/size.hpp>\n#include <boost\/preprocessor\/seq\/enum.hpp>\n#include <boost\/preprocessor\/seq\/size.hpp>\n#include <boost\/preprocessor\/seq\/for_each.hpp>\n#include <boost\/preprocessor\/seq\/transform.hpp>\n#include <boost\/preprocessor\/seq\/variadic_seq_to_seq.hpp>\n#include <boost\/preprocessor\/stringize.hpp>\n#include <boost\/preprocessor\/facilities\/empty.hpp>\n#include <boost\/preprocessor\/comparison\/greater.hpp>\n#include <boost\/preprocessor\/control\/if.hpp>\n#include <boost\/preprocessor\/tuple\/elem.hpp>\n#include <boost\/preprocessor\/tuple\/size.hpp>\n#include <boost\/preprocessor\/stringize.hpp>\n#include <utxx\/string.hpp>\n#include <cassert>\n#include <map>\n\n#ifdef UTXX_ENUM_SUPPORT_SERIALIZATION\n#include <boost\/serialization\/access.hpp>\n#define UTXX__ENUM_FRIEND_SERIALIZATION__ \\\n    friend class boost::serialization::access\n#endif\n\n\/\/ The difference between enum.hpp and enumx.hpp is that UTXX_ENUMX\n\/\/ allows to assign specific values to the enumerated constants.\n\/\/\n\/\/ Note: Make sure that UndefValue is distinct from other values in this enum!\n\/\/\n\/\/ Enum declaration:\n\/\/  #include <utxx\/enumx.hpp>\n\/\/\n\/\/  UTXX_ENUMX(MyEnumT,\n\/\/               char,          \/\/ This is enum storage type\n\/\/               ' '            \/\/ This is an \"UNDEFINED\" value\n\/\/               (Apple, 'x')\n\/\/               (Pear,  'y')\n\/\/               (Grape)        \/\/ Grape will be equal to 'y'+1\n\/\/            );\n\/\/\n\/\/ Sample usage:\n\/\/  MyEnumT val = MyEnumT::from_string(\"Pear\");\n\/\/  std::cout << \"Value: \" << to_string(val) << std::endl;\n\/\/  std::cout << \"Value: \" << val            << std::endl;\n\/\/\n#define UTXX_ENUMX(ENUM, TYPE, UndefValue, ...)                              \\\n    struct ENUM {                                                            \\\n        enum type : TYPE {                                                   \\\n            UNDEFINED = (UndefValue),                                        \\\n            BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM(                        \\\n                UTXX_INTERNAL_ENUM_VAL, _,                                   \\\n                BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__)))                  \\\n        };                                                                   \\\n                                                                             \\\n        explicit  ENUM(long v) : m_val(type(v))   {}                         \\\n        constexpr ENUM()       : m_val(UNDEFINED) {}                         \\\n        constexpr ENUM(type v) : m_val(v) {}                                 \\\n                                                                             \\\n        ENUM(ENUM&&)                 = default;                              \\\n        ENUM(ENUM const&)            = default;                              \\\n                                                                             \\\n        ENUM& operator=(ENUM const&) = default;                              \\\n        ENUM& operator=(ENUM&&)      = default;                              \\\n                                                                             \\\n        constexpr operator type()      const { return m_val; }               \\\n        constexpr bool     empty()     const { return m_val == UNDEFINED; }  \\\n        const std::string& to_string() const {                               \\\n            auto it = names().find(m_val);                                   \\\n            return (it == names().end() ? null_pair() : *it).second;         \\\n        }                                                                    \\\n                                                                             \\\n        static const std::string&                                            \\\n                           to_string(type a){ return ENUM(a).to_string();  } \\\n        const char*        c_str()     const { return to_string().c_str(); } \\\n        static const char* c_str(type a)    { return to_string(a).c_str(); } \\\n                                                                             \\\n        static ENUM from_string(const char* a, bool a_nocase=false){         \\\n            auto f = a_nocase ? &strcasecmp : &strcmp;                       \\\n            for (auto& t : names())                                          \\\n                if (f(t.second.c_str(), a) == 0)                             \\\n                    return t.first;                                          \\\n            return UNDEFINED;                                                \\\n        }                                                                    \\\n                                                                             \\\n        static ENUM from_string(const std::string& a, bool a_nocase=false) { \\\n            return from_string(a.c_str(), a_nocase);                         \\\n        }                                                                    \\\n                                                                             \\\n        inline friend std::ostream& operator<< (std::ostream& out, ENUM a) { \\\n            return out << ENUM::to_string(a);                                \\\n        }                                                                    \\\n                                                                             \\\n        static constexpr size_t size()  { return s_size-1; }                 \\\n                                                                             \\\n        template <typename Visitor>                                          \\\n        static void for_each(const Visitor& a_fun) {                         \\\n            for (auto it = ++names().begin(), e = names().end(); it!=e; ++it)\\\n                if (!a_fun(it->first, it->second))                           \\\n                    break;                                                   \\\n        }                                                                    \\\n                                                                             \\\n    private:                                                                 \\\n        static const std::pair<const type, std::string>& null_pair() {       \\\n            static const std::pair<const type, std::string> s_val =          \\\n                std::make_pair(UNDEFINED, \"UNDEFINED\");                      \\\n            return s_val;                                                    \\\n        }                                                                    \\\n        static const size_t s_size =                                         \\\n            1+BOOST_PP_SEQ_SIZE(BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__));  \\\n        static const std::map<type, std::string>& names() {                  \\\n            static const std::map<type, std::string> s_names{                \\\n                null_pair(),                                                 \\\n                BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM(                    \\\n                    UTXX_INTERNAL_ENUM_PAIR, _,                              \\\n                    BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__)                \\\n                ))                                                           \\\n            };                                                               \\\n            return s_names;                                                  \\\n        }                                                                    \\\n                                                                             \\\n        UTXX__ENUM_FRIEND_SERIALIZATION__;                                   \\\n                                                                             \\\n        type m_val;                                                          \\\n    }\n\n\/\/ DEPRECATED!!! Use UTXX_ENUMX!\n\/\/\n\/\/ Same as UTXX_ENUMX except that the enum is untyped.\n\/\/\n\/\/ The difference between enum.hpp and enumx.hpp is that UTXX_DEFINE_ENUMX\n\/\/ allows to assign specific values to the enumerated constants.\n\/\/\n\/\/ Enum declaration:\n\/\/  #include <utxx\/enumx.hpp>\n\/\/\n\/\/  UTXX_DEFINE_ENUMX(MyEnumT,  ' '  \/* This is an \"UNDEFINED\" value *\/,\n\/\/                      (Apple, 'x')\n\/\/                      (Pear,  'y')\n\/\/                      (Grape)      \/* Grape will be equal to 'y'+1 *\/\n\/\/                   );\n\/\/\n\/\/ Sample usage:\n\/\/  MyEnumT val = MyEnumT::from_string(\"Pear\");\n\/\/  std::cout << \"Value: \" << to_string(val) << std::endl;\n\/\/  std::cout << \"Value: \" << val            << std::endl;\n\/\/\n#define UTXX_DEFINE_ENUMX(ENUM, UndefValue, ...)                             \\\n    struct [[deprecated]] ENUM {                                             \\\n        enum etype {                                                         \\\n            UNDEFINED = (UndefValue),                                        \\\n            BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM(                        \\\n                UTXX_INTERNAL_ENUM_VAL, _,                                   \\\n                BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__)))                  \\\n        };                                                                   \\\n                                                                             \\\n    private:                                                                 \\\n        static const std::pair<const etype, std::string>& null_pair() {      \\\n            static const std::pair<const etype, std::string> s_val =         \\\n                std::make_pair(UNDEFINED, \"UNDEFINED\");                      \\\n            return s_val;                                                    \\\n        }                                                                    \\\n        static const size_t s_size =                                         \\\n            1+BOOST_PP_SEQ_SIZE(BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__));  \\\n        static const std::map<etype, std::string>& names() {                 \\\n            static const std::map<etype, std::string> s_names{               \\\n                null_pair(),                                                 \\\n                BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM(                    \\\n                    UTXX_INTERNAL_ENUM_PAIR, _,                              \\\n                    BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__)                \\\n                ))                                                           \\\n            };                                                               \\\n            return s_names;                                                  \\\n        }                                                                    \\\n                                                                             \\\n        UTXX__ENUM_FRIEND_SERIALIZATION__;                                   \\\n                                                                             \\\n        etype m_val;                                                         \\\n                                                                             \\\n    public:                                                                  \\\n        explicit  ENUM(long v)  : m_val(etype(v))  {}                        \\\n        constexpr ENUM()        : m_val(UNDEFINED) {}                        \\\n        constexpr ENUM(etype v) : m_val(v) {}                                \\\n                                                                             \\\n        ENUM(ENUM&&)                 = default;                              \\\n        ENUM(ENUM const&)            = default;                              \\\n                                                                             \\\n        ENUM& operator=(ENUM const&) = default;                              \\\n        ENUM& operator=(ENUM&&)      = default;                              \\\n                                                                             \\\n        constexpr operator etype()     const { return m_val; }               \\\n        constexpr bool     empty()     const { return m_val == UNDEFINED; }  \\\n        const std::string& to_string() const {                               \\\n            auto it = names().find(m_val);                                   \\\n            return (it == names().end() ? null_pair() : *it).second;         \\\n        }                                                                    \\\n                                                                             \\\n        static const std::string&                                            \\\n                           to_string(etype a){ return ENUM(a).to_string();  }\\\n        const char*        c_str()     const { return to_string().c_str();  }\\\n        static const char* c_str(etype a)    { return to_string(a).c_str(); }\\\n                                                                             \\\n        static ENUM from_string(const char* a, bool a_nocase=false){         \\\n            auto f = a_nocase ? &strcasecmp : &strcmp;                       \\\n            for (auto& t : names())                                          \\\n                if (f(t.second.c_str(), a) == 0)                             \\\n                    return t.first;                                          \\\n            return UNDEFINED;                                                \\\n        }                                                                    \\\n                                                                             \\\n        static ENUM from_string(const std::string& a, bool a_nocase=false) { \\\n            return from_string(a.c_str(), a_nocase);                         \\\n        }                                                                    \\\n                                                                             \\\n        inline friend std::ostream& operator<< (std::ostream& out, ENUM a) { \\\n            return out << ENUM::to_string(a);                                \\\n        }                                                                    \\\n                                                                             \\\n        static constexpr size_t size()  { return s_size-1; }                 \\\n                                                                             \\\n        template <typename Visitor>                                          \\\n        static void for_each(const Visitor& a_fun) {                         \\\n            for (auto it = ++names().begin(), e = names().end(); it!=e; ++it)\\\n                if (!a_fun(it->first))                                       \\\n                    break;                                                   \\\n        }                                                                    \\\n    }\n\n\/\/ Internal macro for supporting BOOST_PP_SEQ_TRANSFORM\n#define UTXX_INTERNAL_ENUM_VAL(x, _, val)                                    \\\n    BOOST_PP_TUPLE_ELEM(0, val)                                              \\\n    BOOST_PP_IF(                                                             \\\n        BOOST_PP_GREATER(BOOST_PP_TUPLE_SIZE(val), 1),                       \\\n        = BOOST_PP_TUPLE_ELEM(1, val),                                       \\\n        BOOST_PP_EMPTY())\n#define UTXX_INTERNAL_ENUM_PAIR(x, _, val)                                   \\\n    {std::make_pair(BOOST_PP_TUPLE_ELEM(0, val),                             \\\n                    BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(0, val)))}\n<commit_msg>Formatting change<commit_after>\/\/----------------------------------------------------------------------------\n\/\/\/ \\file   enum.hpp\n\/\/\/ \\author Serge Aleynikov\n\/\/----------------------------------------------------------------------------\n\/\/\/ \\brief This file defines enum stringification declaration macro.\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2015 Serge Aleynikov <saleyn@gmail.com>\n\/\/ Created: 2015-04-11\n\/\/----------------------------------------------------------------------------\n\/*\n***** BEGIN LICENSE BLOCK *****\n\nThis file is part of the utxx open-source project.\n\nCopyright (c) 2015 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#pragma once\n\n#include <boost\/preprocessor\/variadic\/to_seq.hpp>\n#include <boost\/preprocessor\/variadic\/size.hpp>\n#include <boost\/preprocessor\/seq\/enum.hpp>\n#include <boost\/preprocessor\/seq\/size.hpp>\n#include <boost\/preprocessor\/seq\/for_each.hpp>\n#include <boost\/preprocessor\/seq\/transform.hpp>\n#include <boost\/preprocessor\/seq\/variadic_seq_to_seq.hpp>\n#include <boost\/preprocessor\/stringize.hpp>\n#include <boost\/preprocessor\/facilities\/empty.hpp>\n#include <boost\/preprocessor\/comparison\/greater.hpp>\n#include <boost\/preprocessor\/control\/if.hpp>\n#include <boost\/preprocessor\/tuple\/elem.hpp>\n#include <boost\/preprocessor\/tuple\/size.hpp>\n#include <boost\/preprocessor\/stringize.hpp>\n#include <utxx\/string.hpp>\n#include <cassert>\n#include <map>\n\n#ifdef UTXX_ENUM_SUPPORT_SERIALIZATION\n#include <boost\/serialization\/access.hpp>\n#define UTXX__ENUM_FRIEND_SERIALIZATION__ \\\n    friend class boost::serialization::access\n#endif\n\n\/\/ The difference between enum.hpp and enumx.hpp is that UTXX_ENUMX\n\/\/ allows to assign specific values to the enumerated constants.\n\/\/\n\/\/ Note: Make sure that UndefValue is distinct from other values in this enum!\n\/\/\n\/\/ Enum declaration:\n\/\/  #include <utxx\/enumx.hpp>\n\/\/\n\/\/  UTXX_ENUMX(MyEnumT,\n\/\/               char,          \/\/ This is enum storage type\n\/\/               ' '            \/\/ This is an \"UNDEFINED\" value\n\/\/               (Apple, 'x')\n\/\/               (Pear,  'y')\n\/\/               (Grape)        \/\/ Grape will be equal to 'y'+1\n\/\/            );\n\/\/\n\/\/ Sample usage:\n\/\/  MyEnumT val = MyEnumT::from_string(\"Pear\");\n\/\/  std::cout << \"Value: \" << to_string(val) << std::endl;\n\/\/  std::cout << \"Value: \" << val            << std::endl;\n\/\/\n#define UTXX_ENUMX(ENUM, TYPE, UndefValue, ...)                              \\\n    struct ENUM {                                                            \\\n        enum type : TYPE {                                                   \\\n            UNDEFINED = (UndefValue),                                        \\\n            BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM(                        \\\n                UTXX_INTERNAL_ENUM_VAL, _,                                   \\\n                BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__)))                  \\\n        };                                                                   \\\n                                                                             \\\n        explicit  ENUM(long v) : m_val(type(v))   {}                         \\\n        constexpr ENUM()       : m_val(UNDEFINED) {}                         \\\n        constexpr ENUM(type v) : m_val(v) {}                                 \\\n                                                                             \\\n        ENUM(ENUM&&)                 = default;                              \\\n        ENUM(ENUM const&)            = default;                              \\\n                                                                             \\\n        ENUM& operator=(ENUM const&) = default;                              \\\n        ENUM& operator=(ENUM&&)      = default;                              \\\n                                                                             \\\n        constexpr operator type()      const { return m_val; }               \\\n        constexpr bool     empty()     const { return m_val == UNDEFINED; }  \\\n        const std::string& to_string() const {                               \\\n            auto it = names().find(m_val);                                   \\\n            return (it == names().end() ? null_pair() : *it).second;         \\\n        }                                                                    \\\n                                                                             \\\n        static const std::string&                                            \\\n                           to_string(type a){ return ENUM(a).to_string();  } \\\n        const char*        c_str()    const { return to_string().c_str();  } \\\n        static const char* c_str(type a)    { return to_string(a).c_str(); } \\\n                                                                             \\\n        static ENUM from_string(const char* a, bool a_nocase=false){         \\\n            auto f = a_nocase ? &strcasecmp : &strcmp;                       \\\n            for (auto& t : names())                                          \\\n                if (f(t.second.c_str(), a) == 0)                             \\\n                    return t.first;                                          \\\n            return UNDEFINED;                                                \\\n        }                                                                    \\\n                                                                             \\\n        static ENUM from_string(const std::string& a, bool a_nocase=false) { \\\n            return from_string(a.c_str(), a_nocase);                         \\\n        }                                                                    \\\n                                                                             \\\n        inline friend std::ostream& operator<< (std::ostream& out, ENUM a) { \\\n            return out << ENUM::to_string(a);                                \\\n        }                                                                    \\\n                                                                             \\\n        static constexpr size_t size()  { return s_size-1; }                 \\\n                                                                             \\\n        template <typename Visitor>                                          \\\n        static void for_each(const Visitor& a_fun) {                         \\\n            for (auto it = ++names().begin(), e = names().end(); it!=e; ++it)\\\n                if (!a_fun(it->first, it->second))                           \\\n                    break;                                                   \\\n        }                                                                    \\\n                                                                             \\\n    private:                                                                 \\\n        static const std::pair<const type, std::string>& null_pair() {       \\\n            static const std::pair<const type, std::string> s_val =          \\\n                std::make_pair(UNDEFINED, \"UNDEFINED\");                      \\\n            return s_val;                                                    \\\n        }                                                                    \\\n        static const size_t s_size =                                         \\\n            1+BOOST_PP_SEQ_SIZE(BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__));  \\\n        static const std::map<type, std::string>& names() {                  \\\n            static const std::map<type, std::string> s_names{                \\\n                null_pair(),                                                 \\\n                BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM(                    \\\n                    UTXX_INTERNAL_ENUM_PAIR, _,                              \\\n                    BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__)                \\\n                ))                                                           \\\n            };                                                               \\\n            return s_names;                                                  \\\n        }                                                                    \\\n                                                                             \\\n        UTXX__ENUM_FRIEND_SERIALIZATION__;                                   \\\n                                                                             \\\n        type m_val;                                                          \\\n    }\n\n\/\/ DEPRECATED!!! Use UTXX_ENUMX!\n\/\/\n\/\/ Same as UTXX_ENUMX except that the enum is untyped.\n\/\/\n\/\/ The difference between enum.hpp and enumx.hpp is that UTXX_DEFINE_ENUMX\n\/\/ allows to assign specific values to the enumerated constants.\n\/\/\n\/\/ Enum declaration:\n\/\/  #include <utxx\/enumx.hpp>\n\/\/\n\/\/  UTXX_DEFINE_ENUMX(MyEnumT,  ' '  \/* This is an \"UNDEFINED\" value *\/,\n\/\/                      (Apple, 'x')\n\/\/                      (Pear,  'y')\n\/\/                      (Grape)      \/* Grape will be equal to 'y'+1 *\/\n\/\/                   );\n\/\/\n\/\/ Sample usage:\n\/\/  MyEnumT val = MyEnumT::from_string(\"Pear\");\n\/\/  std::cout << \"Value: \" << to_string(val) << std::endl;\n\/\/  std::cout << \"Value: \" << val            << std::endl;\n\/\/\n#define UTXX_DEFINE_ENUMX(ENUM, UndefValue, ...)                             \\\n    struct [[deprecated]] ENUM {                                             \\\n        enum etype {                                                         \\\n            UNDEFINED = (UndefValue),                                        \\\n            BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM(                        \\\n                UTXX_INTERNAL_ENUM_VAL, _,                                   \\\n                BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__)))                  \\\n        };                                                                   \\\n                                                                             \\\n    private:                                                                 \\\n        static const std::pair<const etype, std::string>& null_pair() {      \\\n            static const std::pair<const etype, std::string> s_val =         \\\n                std::make_pair(UNDEFINED, \"UNDEFINED\");                      \\\n            return s_val;                                                    \\\n        }                                                                    \\\n        static const size_t s_size =                                         \\\n            1+BOOST_PP_SEQ_SIZE(BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__));  \\\n        static const std::map<etype, std::string>& names() {                 \\\n            static const std::map<etype, std::string> s_names{               \\\n                null_pair(),                                                 \\\n                BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM(                    \\\n                    UTXX_INTERNAL_ENUM_PAIR, _,                              \\\n                    BOOST_PP_VARIADIC_SEQ_TO_SEQ(__VA_ARGS__)                \\\n                ))                                                           \\\n            };                                                               \\\n            return s_names;                                                  \\\n        }                                                                    \\\n                                                                             \\\n        UTXX__ENUM_FRIEND_SERIALIZATION__;                                   \\\n                                                                             \\\n        etype m_val;                                                         \\\n                                                                             \\\n    public:                                                                  \\\n        explicit  ENUM(long v)  : m_val(etype(v))  {}                        \\\n        constexpr ENUM()        : m_val(UNDEFINED) {}                        \\\n        constexpr ENUM(etype v) : m_val(v) {}                                \\\n                                                                             \\\n        ENUM(ENUM&&)                 = default;                              \\\n        ENUM(ENUM const&)            = default;                              \\\n                                                                             \\\n        ENUM& operator=(ENUM const&) = default;                              \\\n        ENUM& operator=(ENUM&&)      = default;                              \\\n                                                                             \\\n        constexpr operator etype()     const { return m_val; }               \\\n        constexpr bool     empty()     const { return m_val == UNDEFINED; }  \\\n        const std::string& to_string() const {                               \\\n            auto it = names().find(m_val);                                   \\\n            return (it == names().end() ? null_pair() : *it).second;         \\\n        }                                                                    \\\n                                                                             \\\n        static const std::string&                                            \\\n                           to_string(etype a){ return ENUM(a).to_string();  }\\\n        const char*        c_str()     const { return to_string().c_str();  }\\\n        static const char* c_str(etype a)    { return to_string(a).c_str(); }\\\n                                                                             \\\n        static ENUM from_string(const char* a, bool a_nocase=false){         \\\n            auto f = a_nocase ? &strcasecmp : &strcmp;                       \\\n            for (auto& t : names())                                          \\\n                if (f(t.second.c_str(), a) == 0)                             \\\n                    return t.first;                                          \\\n            return UNDEFINED;                                                \\\n        }                                                                    \\\n                                                                             \\\n        static ENUM from_string(const std::string& a, bool a_nocase=false) { \\\n            return from_string(a.c_str(), a_nocase);                         \\\n        }                                                                    \\\n                                                                             \\\n        inline friend std::ostream& operator<< (std::ostream& out, ENUM a) { \\\n            return out << ENUM::to_string(a);                                \\\n        }                                                                    \\\n                                                                             \\\n        static constexpr size_t size()  { return s_size-1; }                 \\\n                                                                             \\\n        template <typename Visitor>                                          \\\n        static void for_each(const Visitor& a_fun) {                         \\\n            for (auto it = ++names().begin(), e = names().end(); it!=e; ++it)\\\n                if (!a_fun(it->first))                                       \\\n                    break;                                                   \\\n        }                                                                    \\\n    }\n\n\/\/ Internal macro for supporting BOOST_PP_SEQ_TRANSFORM\n#define UTXX_INTERNAL_ENUM_VAL(x, _, val)                                    \\\n    BOOST_PP_TUPLE_ELEM(0, val)                                              \\\n    BOOST_PP_IF(                                                             \\\n        BOOST_PP_GREATER(BOOST_PP_TUPLE_SIZE(val), 1),                       \\\n        = BOOST_PP_TUPLE_ELEM(1, val),                                       \\\n        BOOST_PP_EMPTY())\n#define UTXX_INTERNAL_ENUM_PAIR(x, _, val)                                   \\\n    {std::make_pair(BOOST_PP_TUPLE_ELEM(0, val),                             \\\n                    BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(0, val)))}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file FFTCheckerFilter.cpp\n *\/\n\n#include \"FFTCheckerFilter.h\"\n\n#include <cmath>\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\nnamespace ATK\n{\n  template<class DataType_>\n  FFTCheckerFilter<DataType_>::FFTCheckerFilter()\n  :TypedBaseFilter<DataType_>(1, 0)\n  {\n    FFTimpl.reset(new FFT<DataType_>);\n  }\n  \n  template<class DataType_>\n  FFTCheckerFilter<DataType_>::~FFTCheckerFilter()\n  {\n  }\n  \n  template<class DataType_>\n  void FFTCheckerFilter<DataType_>::set_checks(const std::vector<std::pair<int, DataType> >& frequency_checks)\n  {\n    this->frequency_checks = frequency_checks;\n  }\n\n  template<class DataType_>\n  void FFTCheckerFilter<DataType_>::setup()\n  {\n    FFTimpl->set_size(input_sampling_rate);\n  }\n  \n  template<class DataType_>\n  void FFTCheckerFilter<DataType_>::process_impl(int64_t size) const\n  {\n    for(int64_t i = 0; i < size\/input_sampling_rate; ++i)\n    {\n      FFTimpl->process(converted_inputs[0] + i * input_sampling_rate, input_sampling_rate);\n      std::vector<DataType_> output_freqs;\n      FFTimpl->get_amp(output_freqs);\n      \n      for(int j = 0; j < frequency_checks.size(); ++j)\n      {\n        DataType amp = output_freqs[frequency_checks[j].first];\n        DataType amp_check = frequency_checks[j].second * frequency_checks[j].second;\n        if(amp_check == 0)\n        {\n          BOOST_REQUIRE_SMALL(amp, 0.1);\n        }\n        else\n        {\n          BOOST_REQUIRE_CLOSE(amp, amp_check, 0.1);\n        }\n      }\n    }\n  }\n  \n  template class FFTCheckerFilter<double>;\n}\n<commit_msg>Seems that changing the FFT computation factor messed up the default values, so let's fix that in the checker instead...<commit_after>\/**\n * \\file FFTCheckerFilter.cpp\n *\/\n\n#include \"FFTCheckerFilter.h\"\n\n#include <cmath>\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\nnamespace ATK\n{\n  template<class DataType_>\n  FFTCheckerFilter<DataType_>::FFTCheckerFilter()\n  :TypedBaseFilter<DataType_>(1, 0)\n  {\n    FFTimpl.reset(new FFT<DataType_>);\n  }\n  \n  template<class DataType_>\n  FFTCheckerFilter<DataType_>::~FFTCheckerFilter()\n  {\n  }\n  \n  template<class DataType_>\n  void FFTCheckerFilter<DataType_>::set_checks(const std::vector<std::pair<int, DataType> >& frequency_checks)\n  {\n    this->frequency_checks = frequency_checks;\n  }\n\n  template<class DataType_>\n  void FFTCheckerFilter<DataType_>::setup()\n  {\n    FFTimpl->set_size(input_sampling_rate);\n  }\n  \n  template<class DataType_>\n  void FFTCheckerFilter<DataType_>::process_impl(int64_t size) const\n  {\n    for(int64_t i = 0; i < size\/input_sampling_rate; ++i)\n    {\n      FFTimpl->process(converted_inputs[0] + i * input_sampling_rate, input_sampling_rate);\n      std::vector<DataType_> output_freqs;\n      FFTimpl->get_amp(output_freqs);\n      \n      for(int j = 0; j < frequency_checks.size(); ++j)\n      {\n        DataType amp = output_freqs[frequency_checks[j].first];\n        DataType amp_check = frequency_checks[j].second * frequency_checks[j].second;\n        if(amp_check == 0)\n        {\n          BOOST_REQUIRE_SMALL(amp, 0.1);\n        }\n        else\n        {\n          BOOST_REQUIRE_CLOSE(2*amp, amp_check, 0.1);\n        }\n      }\n    }\n  }\n  \n  template class FFTCheckerFilter<double>;\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* Copyright (c) 2010 Ruslan Kabatsayev <b7.10110111@gmail.com>\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 <gtk\/gtk.h>\n#include <dlfcn.h>\n#include <string>\n\nenum WinDecoOptions\n{\n    WinIsMaximized=1<<0,\n    WinIsShaded=1<<2,\n    WinIsResizable=1<<3,\n    WinIsActive=1<<4,\n    WinHasAlpha=1<<5,\n};\n\n\/\/! button status\nenum ButtonStatus\n{\n    Normal,\n    Disabled, \/\/ this shouldn't be specified by WMs unless button is really insensitive\n    Hovered,\n    Pressed,\n    ButtonStatusCount\n};\n\n\/\/! buttons\nenum ButtonType\n{\n    ButtonHelp=0,\n    ButtonMax,\n    ButtonMin,\n    ButtonClose,\n    ButtonMenu,\n    ButtonSticky,\n    ButtonAbove,\n    ButtonBelow,\n    ButtonShade,\n    ButtonUnmax,\n    ButtonUnstick,\n    ButtonUnshade,\n    ButtonUndoAbove,\n    ButtonUndoBelow,\n    ButtonTypeCount\n};\n\nenum Metric\n{\n    BorderLeft=0,\n    BorderRight,\n    BorderBottom,\n    \/\/ BorderTop includes title and resize handle heights\n    BorderTop,\n    ButtonSpacing,\n    ButtonMarginTop,\n    ButtonMarginBottom,\n    ShadowLeft,\n    ShadowTop,\n    ShadowRight,\n    ShadowBottom,\n    MetricsCount\n};\n\n\/\/___________________________________________________________________\n\/\/ external pointers to functions\nvoid (*drawWindowDecoration)(cairo_t*, unsigned long, gint, gint, gint, gint, const gchar**, gint, gint) = 0L;\nvoid (*drawWindecoButton)(cairo_t*, unsigned long, unsigned long, unsigned long, gint, gint, gint, gint) = 0L;\nvoid (*drawWindecoShapeMask)(cairo_t*, unsigned long, gint, gint, gint, gint) = 0L;\nvoid (*drawWindowShadow)(cairo_t*, unsigned long, gint, gint, gint, gint) = 0L;\ngint (*getWindecoABIVersion)(void) = 0L;\ngint (*getWindecoMetric)(unsigned long) = 0L;\ngint (*getWindecoButtonSize)(unsigned long) = 0L;\n\n\/\/ window dimensions\nint ww( 700 );\nint wh( 200 );\n\n\/\/ widgets\nGtkWidget *mw0( 0L );\nGtkWidget *mw1( 0L );\n\nconst gboolean useAlpha( TRUE );\n\n\/\/ windeco metrics\nint shadowLeft=0;\nint shadowRight=0;\nint shadowTop=0;\nint shadowBottom=0;\nint borderLeft=0;\nint borderRight=0;\nint borderTop=0;\nint borderBottom=0;\nint dw=0;\nint dh=0;\n\n\/\/___________________________________________________________________\ngboolean initLib()\n{\n    void* library;\n    char* error=0;\n    char* moduleDir=gtk_rc_get_module_dir();\n    if(moduleDir)\n    {\n        std::string libpath(moduleDir+std::string(\"\/liboxygen-gtk.so\"));\n        g_free(moduleDir);\n        library=dlopen(libpath.c_str(),RTLD_LAZY);\n        bool success=false;\n        do{\n            if(!library)\n            {\n                break;\n            } else {\n\n                getWindecoABIVersion=(gint(*)(void))dlsym(library, \"getWindecoABIVersion\");\n                if((error=dlerror())!=0L)\n                {\n                    break;\n                } else {\n\n                    #define EXPECTED_ABI_VERSION 3\n                    gint version=getWindecoABIVersion();\n                    if(version != EXPECTED_ABI_VERSION)\n                    {\n                        fprintf(stderr, \"ABI version %d is not equal to expected version %d\\n\", version, EXPECTED_ABI_VERSION);\n                        return FALSE;\n                    }\n\n                }\n\n                \/\/ store drawWindowDecoration symbol\n                drawWindowDecoration = (void(*)(cairo_t*, unsigned long, gint, gint, gint, gint, const gchar**, gint, gint))dlsym(library, \"drawWindowDecoration\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindecoButton symbol\n                drawWindecoButton = (void (*)(cairo_t*, unsigned long, unsigned long, unsigned long, gint, gint, gint, gint))dlsym(library, \"drawWindecoButton\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindecoShapeMask symbol\n                drawWindecoShapeMask=(void (*)(cairo_t*, unsigned long, gint, gint, gint, gint))dlsym(library, \"drawWindecoShapeMask\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindowShadow symbol\n                drawWindowShadow=(void (*)(cairo_t*, unsigned long, gint, gint, gint, gint))dlsym(library, \"drawWindowShadow\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindecoMetric symbol\n                getWindecoMetric=(gint (*)(unsigned long))dlsym(library, \"getWindecoMetric\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindecoButtonSize symbol\n                getWindecoButtonSize=(gint (*)(unsigned long))dlsym(library, \"getWindecoButtonSize\");\n                if((error=dlerror())!=0L)\n                    break;\n              }\n        }\n        while(0);\n        if(error)\n        {\n            fprintf(stderr, \"%s\\n\", error);\n            return FALSE;\n        }\n    }\n    return TRUE;\n}\n\nvoid getMetrics()\n{\n    shadowLeft=getWindecoMetric(ShadowLeft);\n    shadowRight=getWindecoMetric(ShadowRight);\n    shadowTop=getWindecoMetric(ShadowTop);\n    shadowBottom=getWindecoMetric(ShadowBottom);\n\n    borderLeft=getWindecoMetric(BorderLeft);\n    borderRight=getWindecoMetric(BorderRight);\n    borderTop=getWindecoMetric(BorderTop);\n    borderBottom=getWindecoMetric(BorderBottom);\n\n    dw = borderLeft + borderRight + shadowLeft + shadowRight;\n    dh = borderTop + borderBottom + shadowTop + shadowBottom;\n}\n\n\/\/___________________________________________________________________\ngboolean on_expose(GtkWidget* mw0, GdkEventExpose* event, gpointer user_data)\n{\n    cairo_t* cr=gdk_cairo_create( gtk_widget_get_window( mw0 ) );\n\n    \/\/ define options\n    int opt( WinIsResizable );\n    if( useAlpha ) opt |= WinHasAlpha;\n    if( !gtk_window_is_active( GTK_WINDOW(mw1) ) ) opt|= WinIsActive;\n\n    drawWindowShadow(cr, (WinDecoOptions) opt, 0, 0, mw0->allocation.width, mw0->allocation.height);\n\n    const gchar* windowStrings[] = {\n        \"This is a caption\",\n        \"WindowClass10110111\",\n        0 };\n\n    drawWindowDecoration(cr, (WinDecoOptions) opt, 0+shadowLeft, 0+shadowTop, mw0->allocation.width-shadowLeft-shadowRight, mw0->allocation.height-shadowTop-shadowBottom, windowStrings, 0, 20*ButtonTypeCount);\n\n    for( int status=0; status<ButtonStatusCount; status++)\n    {\n        for( int type=0; type<ButtonTypeCount; type++)\n        {\n            int buttonSize=getWindecoButtonSize(type);\n            int buttonSpacing=getWindecoMetric(ButtonSpacing);\n            int dbut=buttonSize+buttonSpacing;\n            drawWindecoButton(cr, type, status, opt, \n                    mw0->allocation.width-shadowRight-borderRight-buttonSize-buttonSize*type,\n                    status*dbut+shadowTop+(borderTop-buttonSize)\/2,\n                    buttonSize, buttonSize);\n        }\n    }\n\n    cairo_destroy(cr);\n    return TRUE;\n}\n\n\/\/___________________________________________________________________\ngboolean on_configure1(GtkWidget* mw1, GdkEventConfigure* event, gpointer user_data)\n{\n    static int w=0, h=0;\n    gboolean redraw( event->width != w || event->height != h );\n    if( redraw  )\n    {\n        w=event->width;\n        h=event->height;\n\n        int opt( WinIsActive|WinIsResizable );\n        if( useAlpha ) opt|= WinHasAlpha;\n\n        gtk_window_resize(GTK_WINDOW(mw0), event->width+dw, event->height+dh);\n\n        if(!useAlpha)\n        {\n            GdkBitmap* mask=gdk_pixmap_new(0L, event->width+dw, event->height+dh, 1);\n            cairo_t* cr=gdk_cairo_create(mask);\n            drawWindecoShapeMask(cr, (WinDecoOptions) opt, 0+shadowLeft, 0+shadowRight, event->width+dw-shadowLeft-shadowRight, event->height+dh-shadowTop-shadowBottom);\n            gdk_window_shape_combine_mask( gtk_widget_get_window( mw0 ), 0L, 0, 0 ); \/\/ remove old mask\n            gdk_window_shape_combine_mask( gtk_widget_get_window( mw0 ), mask, 0, 0 ); \/\/ apply new mask\n            gdk_pixmap_unref(mask);\n        }\n    }\n\n    return FALSE;\n\n}\n\n\/\/___________________________________________________________________\ngboolean on_configure0(GtkWidget* mw0, GdkEventConfigure* event, gpointer user_data)\n{\n    static int w=0, h=0;\n    static gboolean active=FALSE;\n\n    gboolean redraw( event->width != w || event->height != h );\n    if(!(gtk_window_is_active(GTK_WINDOW(mw1))!=active))\n    {\n        active ^= TRUE;\n        redraw = TRUE;\n    }\n\n    if( redraw )\n    {\n        w=event->width;\n        h=event->height;\n\n        gdk_window_begin_paint_rect( gtk_widget_get_window( mw0 ), (GdkRectangle*)&mw0->allocation);\n        on_expose(mw0, 0L, 0L );\n        gdk_window_end_paint( gtk_widget_get_window( mw0 ) );\n    }\n\n    return FALSE;\n\n}\n\n\/\/___________________________________________________________________\nint main(int argc, char** argv)\n{\n\n    \/\/ load methods from style library\n    if(!initLib()) return 1;\n\n    \/\/ initialize gtk\n    gtk_init(&argc, &argv);\n\n    \/\/ draw\n    mw0=gtk_window_new(GTK_WINDOW_TOPLEVEL);\n    mw1=gtk_window_new(GTK_WINDOW_TOPLEVEL);\n\n    GdkColormap* cmap=gdk_screen_get_rgba_colormap(gdk_screen_get_default());\n    gtk_widget_set_colormap(mw0, cmap);\n\n    g_signal_connect(G_OBJECT(mw0), \"destroy\", G_CALLBACK(gtk_main_quit), 0L);\n    g_signal_connect(G_OBJECT(mw1), \"destroy\", G_CALLBACK(gtk_main_quit), 0L);\n\n    gtk_window_set_default_size( GTK_WINDOW(mw1), ww, wh );\n    gtk_window_set_default_size( GTK_WINDOW(mw0), ww+dw, wh+dh );\n    gtk_window_set_decorated(GTK_WINDOW(mw0), FALSE);\n\n    gtk_window_set_title( GTK_WINDOW(mw1), \"This is a caption\");\n\n    g_signal_connect( G_OBJECT(mw0), \"expose-event\", G_CALLBACK(on_expose), 0L);\n    g_signal_connect( G_OBJECT(mw1), \"configure-event\", G_CALLBACK(on_configure1), 0L);\n    g_signal_connect( G_OBJECT(mw0), \"configure-event\", G_CALLBACK(on_configure0), 0L);\n\n    gtk_widget_show( mw1 );\n    gtk_widget_show( mw0 );\n\n    gtk_window_move( GTK_WINDOW(mw0), 300, 320);\n    gtk_window_move( GTK_WINDOW(mw1), 300, 320);\n\n    \/\/ FIXME: this call crashes in Oxygen::StyleHelper::initializeRefSurface()\n    \/\/ if done right after gtk_init() call, i.e. until any widget is created\n    getMetrics();\n\n    gtk_main();\n    return 0;\n}\n<commit_msg>Remove no longer needed casts from oxygen-gtk-deco<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* Copyright (c) 2010 Ruslan Kabatsayev <b7.10110111@gmail.com>\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 <gtk\/gtk.h>\n#include <dlfcn.h>\n#include <string>\n\nenum WinDecoOptions\n{\n    WinIsMaximized=1<<0,\n    WinIsShaded=1<<2,\n    WinIsResizable=1<<3,\n    WinIsActive=1<<4,\n    WinHasAlpha=1<<5,\n};\n\n\/\/! button status\nenum ButtonStatus\n{\n    Normal,\n    Disabled, \/\/ this shouldn't be specified by WMs unless button is really insensitive\n    Hovered,\n    Pressed,\n    ButtonStatusCount\n};\n\n\/\/! buttons\nenum ButtonType\n{\n    ButtonHelp=0,\n    ButtonMax,\n    ButtonMin,\n    ButtonClose,\n    ButtonMenu,\n    ButtonSticky,\n    ButtonAbove,\n    ButtonBelow,\n    ButtonShade,\n    ButtonUnmax,\n    ButtonUnstick,\n    ButtonUnshade,\n    ButtonUndoAbove,\n    ButtonUndoBelow,\n    ButtonTypeCount\n};\n\nenum Metric\n{\n    BorderLeft=0,\n    BorderRight,\n    BorderBottom,\n    \/\/ BorderTop includes title and resize handle heights\n    BorderTop,\n    ButtonSpacing,\n    ButtonMarginTop,\n    ButtonMarginBottom,\n    ShadowLeft,\n    ShadowTop,\n    ShadowRight,\n    ShadowBottom,\n    MetricsCount\n};\n\n\/\/___________________________________________________________________\n\/\/ external pointers to functions\nvoid (*drawWindowDecoration)(cairo_t*, unsigned long, gint, gint, gint, gint, const gchar**, gint, gint) = 0L;\nvoid (*drawWindecoButton)(cairo_t*, unsigned long, unsigned long, unsigned long, gint, gint, gint, gint) = 0L;\nvoid (*drawWindecoShapeMask)(cairo_t*, unsigned long, gint, gint, gint, gint) = 0L;\nvoid (*drawWindowShadow)(cairo_t*, unsigned long, gint, gint, gint, gint) = 0L;\ngint (*getWindecoABIVersion)(void) = 0L;\ngint (*getWindecoMetric)(unsigned long) = 0L;\ngint (*getWindecoButtonSize)(unsigned long) = 0L;\n\n\/\/ window dimensions\nint ww( 700 );\nint wh( 200 );\n\n\/\/ widgets\nGtkWidget *mw0( 0L );\nGtkWidget *mw1( 0L );\n\nconst gboolean useAlpha( TRUE );\n\n\/\/ windeco metrics\nint shadowLeft=0;\nint shadowRight=0;\nint shadowTop=0;\nint shadowBottom=0;\nint borderLeft=0;\nint borderRight=0;\nint borderTop=0;\nint borderBottom=0;\nint dw=0;\nint dh=0;\n\n\/\/___________________________________________________________________\ngboolean initLib()\n{\n    void* library;\n    char* error=0;\n    char* moduleDir=gtk_rc_get_module_dir();\n    if(moduleDir)\n    {\n        std::string libpath(moduleDir+std::string(\"\/liboxygen-gtk.so\"));\n        g_free(moduleDir);\n        library=dlopen(libpath.c_str(),RTLD_LAZY);\n        bool success=false;\n        do{\n            if(!library)\n            {\n                break;\n            } else {\n\n                getWindecoABIVersion=(gint(*)(void))dlsym(library, \"getWindecoABIVersion\");\n                if((error=dlerror())!=0L)\n                {\n                    break;\n                } else {\n\n                    #define EXPECTED_ABI_VERSION 3\n                    gint version=getWindecoABIVersion();\n                    if(version != EXPECTED_ABI_VERSION)\n                    {\n                        fprintf(stderr, \"ABI version %d is not equal to expected version %d\\n\", version, EXPECTED_ABI_VERSION);\n                        return FALSE;\n                    }\n\n                }\n\n                \/\/ store drawWindowDecoration symbol\n                drawWindowDecoration = (void(*)(cairo_t*, unsigned long, gint, gint, gint, gint, const gchar**, gint, gint))dlsym(library, \"drawWindowDecoration\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindecoButton symbol\n                drawWindecoButton = (void (*)(cairo_t*, unsigned long, unsigned long, unsigned long, gint, gint, gint, gint))dlsym(library, \"drawWindecoButton\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindecoShapeMask symbol\n                drawWindecoShapeMask=(void (*)(cairo_t*, unsigned long, gint, gint, gint, gint))dlsym(library, \"drawWindecoShapeMask\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindowShadow symbol\n                drawWindowShadow=(void (*)(cairo_t*, unsigned long, gint, gint, gint, gint))dlsym(library, \"drawWindowShadow\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindecoMetric symbol\n                getWindecoMetric=(gint (*)(unsigned long))dlsym(library, \"getWindecoMetric\");\n                if((error=dlerror())!=0L)\n                    break;\n\n                \/\/ store drawWindecoButtonSize symbol\n                getWindecoButtonSize=(gint (*)(unsigned long))dlsym(library, \"getWindecoButtonSize\");\n                if((error=dlerror())!=0L)\n                    break;\n              }\n        }\n        while(0);\n        if(error)\n        {\n            fprintf(stderr, \"%s\\n\", error);\n            return FALSE;\n        }\n    }\n    return TRUE;\n}\n\nvoid getMetrics()\n{\n    shadowLeft=getWindecoMetric(ShadowLeft);\n    shadowRight=getWindecoMetric(ShadowRight);\n    shadowTop=getWindecoMetric(ShadowTop);\n    shadowBottom=getWindecoMetric(ShadowBottom);\n\n    borderLeft=getWindecoMetric(BorderLeft);\n    borderRight=getWindecoMetric(BorderRight);\n    borderTop=getWindecoMetric(BorderTop);\n    borderBottom=getWindecoMetric(BorderBottom);\n\n    dw = borderLeft + borderRight + shadowLeft + shadowRight;\n    dh = borderTop + borderBottom + shadowTop + shadowBottom;\n}\n\n\/\/___________________________________________________________________\ngboolean on_expose(GtkWidget* mw0, GdkEventExpose* event, gpointer user_data)\n{\n    cairo_t* cr=gdk_cairo_create( gtk_widget_get_window( mw0 ) );\n\n    \/\/ define options\n    int opt( WinIsResizable );\n    if( useAlpha ) opt |= WinHasAlpha;\n    if( !gtk_window_is_active( GTK_WINDOW(mw1) ) ) opt|= WinIsActive;\n\n    drawWindowShadow(cr, opt, 0, 0, mw0->allocation.width, mw0->allocation.height);\n\n    const gchar* windowStrings[] = {\n        \"This is a caption\",\n        \"WindowClass10110111\",\n        0 };\n\n    drawWindowDecoration(cr, opt, 0+shadowLeft, 0+shadowTop, mw0->allocation.width-shadowLeft-shadowRight, mw0->allocation.height-shadowTop-shadowBottom, windowStrings, 0, 20*ButtonTypeCount);\n\n    for( int status=0; status<ButtonStatusCount; status++)\n    {\n        for( int type=0; type<ButtonTypeCount; type++)\n        {\n            int buttonSize=getWindecoButtonSize(type);\n            int buttonSpacing=getWindecoMetric(ButtonSpacing);\n            int dbut=buttonSize+buttonSpacing;\n            drawWindecoButton(cr, type, status, opt, \n                    mw0->allocation.width-shadowRight-borderRight-buttonSize-buttonSize*type,\n                    status*dbut+shadowTop+(borderTop-buttonSize)\/2,\n                    buttonSize, buttonSize);\n        }\n    }\n\n    cairo_destroy(cr);\n    return TRUE;\n}\n\n\/\/___________________________________________________________________\ngboolean on_configure1(GtkWidget* mw1, GdkEventConfigure* event, gpointer user_data)\n{\n    static int w=0, h=0;\n    gboolean redraw( event->width != w || event->height != h );\n    if( redraw  )\n    {\n        w=event->width;\n        h=event->height;\n\n        int opt( WinIsActive|WinIsResizable );\n        if( useAlpha ) opt|= WinHasAlpha;\n\n        gtk_window_resize(GTK_WINDOW(mw0), event->width+dw, event->height+dh);\n\n        if(!useAlpha)\n        {\n            GdkBitmap* mask=gdk_pixmap_new(0L, event->width+dw, event->height+dh, 1);\n            cairo_t* cr=gdk_cairo_create(mask);\n            drawWindecoShapeMask(cr, opt, 0+shadowLeft, 0+shadowRight, event->width+dw-shadowLeft-shadowRight, event->height+dh-shadowTop-shadowBottom);\n            gdk_window_shape_combine_mask( gtk_widget_get_window( mw0 ), 0L, 0, 0 ); \/\/ remove old mask\n            gdk_window_shape_combine_mask( gtk_widget_get_window( mw0 ), mask, 0, 0 ); \/\/ apply new mask\n            gdk_pixmap_unref(mask);\n        }\n    }\n\n    return FALSE;\n\n}\n\n\/\/___________________________________________________________________\ngboolean on_configure0(GtkWidget* mw0, GdkEventConfigure* event, gpointer user_data)\n{\n    static int w=0, h=0;\n    static gboolean active=FALSE;\n\n    gboolean redraw( event->width != w || event->height != h );\n    if(!(gtk_window_is_active(GTK_WINDOW(mw1))!=active))\n    {\n        active ^= TRUE;\n        redraw = TRUE;\n    }\n\n    if( redraw )\n    {\n        w=event->width;\n        h=event->height;\n\n        gdk_window_begin_paint_rect( gtk_widget_get_window( mw0 ), (GdkRectangle*)&mw0->allocation);\n        on_expose(mw0, 0L, 0L );\n        gdk_window_end_paint( gtk_widget_get_window( mw0 ) );\n    }\n\n    return FALSE;\n\n}\n\n\/\/___________________________________________________________________\nint main(int argc, char** argv)\n{\n\n    \/\/ load methods from style library\n    if(!initLib()) return 1;\n\n    \/\/ initialize gtk\n    gtk_init(&argc, &argv);\n\n    \/\/ draw\n    mw0=gtk_window_new(GTK_WINDOW_TOPLEVEL);\n    mw1=gtk_window_new(GTK_WINDOW_TOPLEVEL);\n\n    GdkColormap* cmap=gdk_screen_get_rgba_colormap(gdk_screen_get_default());\n    gtk_widget_set_colormap(mw0, cmap);\n\n    g_signal_connect(G_OBJECT(mw0), \"destroy\", G_CALLBACK(gtk_main_quit), 0L);\n    g_signal_connect(G_OBJECT(mw1), \"destroy\", G_CALLBACK(gtk_main_quit), 0L);\n\n    gtk_window_set_default_size( GTK_WINDOW(mw1), ww, wh );\n    gtk_window_set_default_size( GTK_WINDOW(mw0), ww+dw, wh+dh );\n    gtk_window_set_decorated(GTK_WINDOW(mw0), FALSE);\n\n    gtk_window_set_title( GTK_WINDOW(mw1), \"This is a caption\");\n\n    g_signal_connect( G_OBJECT(mw0), \"expose-event\", G_CALLBACK(on_expose), 0L);\n    g_signal_connect( G_OBJECT(mw1), \"configure-event\", G_CALLBACK(on_configure1), 0L);\n    g_signal_connect( G_OBJECT(mw0), \"configure-event\", G_CALLBACK(on_configure0), 0L);\n\n    gtk_widget_show( mw1 );\n    gtk_widget_show( mw0 );\n\n    gtk_window_move( GTK_WINDOW(mw0), 300, 320);\n    gtk_window_move( GTK_WINDOW(mw1), 300, 320);\n\n    \/\/ FIXME: this call crashes in Oxygen::StyleHelper::initializeRefSurface()\n    \/\/ if done right after gtk_init() call, i.e. until any widget is created\n    getMetrics();\n\n    gtk_main();\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Disable some warnings which are caused with CUDA headers\r\n#pragma warning(disable: 4201 4408 4100)\r\n\r\n#include <iostream>\r\n#include <cvconfig.h>\r\n#include \"opencv2\/core\/core.hpp\"\r\n#include <opencv2\/gpu\/gpu.hpp>\r\n\r\n#if !defined(HAVE_CUDA) || !defined(HAVE_TBB)\r\n\r\nint main()\r\n{\r\n#if !defined(HAVE_CUDA)\r\n    cout << \"CUDA support is required (CMake key 'WITH_CUDA' must be true).\\n\";\r\n#endif\r\n\r\n#if !defined(HAVE_TBB)\r\n    cout << \"TBB support is required (CMake key 'WITH_TBB' must be true).\\n\";\r\n#endif\r\n\r\n    return 0;\r\n}\r\n\r\n#else\r\n\r\n#include <cuda.h>\r\n#include <cuda_runtime.h>\r\n#include \"opencv2\/core\/internal.hpp\" \/\/ For TBB wrappers\r\n\r\nusing namespace std;\r\nusing namespace cv;\r\nusing namespace cv::gpu;\r\n\r\nstruct Worker { void operator()(int device_id) const; };\r\nvoid destroyContexts();\r\n\r\n#define cuSafeCall(code) if (code != CUDA_SUCCESS) { \\\r\n    cout << \"CUDA driver API error: code \" << code \\\r\n        << \", file \" << __FILE__ << \", line \" << __LINE__ << endl; \\\r\n    destroyContexts(); \\\r\n    exit(-1); \\\r\n}\r\n\r\n\r\n\/\/ Each GPU is associated with its own context\r\nCUcontext contexts[2];\r\n\r\n\r\nint main()\r\n{\r\n    if (getCudaEnabledDeviceCount() < 2)\r\n    {\r\n        cout << \"Two or more GPUs are required\\n\";\r\n        return -1;\r\n    }\r\n\r\n    cuSafeCall(cuInit(0));\r\n\r\n    \/\/ Create context for the first GPU\r\n    CUdevice device;\r\n    cuSafeCall(cuDeviceGet(&device, 0));\r\n    cuSafeCall(cuCtxCreate(&contexts[0], 0, device));\r\n\r\n    CUcontext prev_context;\r\n    cuCtxPopCurrent(&prev_context);\r\n\r\n    \/\/ Create context for the second GPU\r\n    cuSafeCall(cuDeviceGet(&device, 1));\r\n    cuSafeCall(cuCtxCreate(&contexts[1], 1, device));\r\n\r\n    cuCtxPopCurrent(&prev_context);\r\n\r\n    \/\/ Execute calculation in two threads using two GPUs\r\n    int devices[] = {0, 1};\r\n    parallel_do(devices, devices + 2, Worker());\r\n\r\n    destroyContexts();\r\n    return 0;\r\n}\r\n\r\n\r\nvoid Worker::operator()(int device_id) const\r\n{\r\n    cuCtxPushCurrent(contexts[device_id]);\r\n\r\n    \/\/ Generate random matrix\r\n    Mat src(1000, 1000, CV_32F);\r\n    RNG rng(0);\r\n    rng.fill(src, RNG::UNIFORM, 0, 1);\r\n\r\n    \/\/ Upload data on GPU\r\n    GpuMat d_src(src);\r\n    GpuMat d_dst;\r\n\r\n    transpose(d_src, d_dst);\r\n\r\n    \/\/ Deallocate here, otherwise deallocation will be performed \r\n    \/\/ after context is extracted from the stack\r\n    d_src.release();\r\n    d_dst.release();\r\n\r\n    CUcontext prev_context;\r\n    cuCtxPopCurrent(&prev_context);\r\n\r\n    cout << \"Device \" << device_id << \" finished\\n\";\r\n}\r\n\r\n\r\nvoid destroyContexts()\r\n{\r\n    cuCtxDestroy(contexts[0]);\r\n    cuCtxDestroy(contexts[1]);\r\n}\r\n\r\n#endif<commit_msg>added results check into multi_gpu sample<commit_after>\/\/ Disable some warnings which are caused with CUDA headers\r\n#pragma warning(disable: 4201 4408 4100)\r\n\r\n#include <iostream>\r\n#include <cvconfig.h>\r\n#include \"opencv2\/core\/core.hpp\"\r\n#include <opencv2\/gpu\/gpu.hpp>\r\n\r\n#if !defined(HAVE_CUDA) || !defined(HAVE_TBB)\r\n\r\nint main()\r\n{\r\n#if !defined(HAVE_CUDA)\r\n    cout << \"CUDA support is required (CMake key 'WITH_CUDA' must be true).\\n\";\r\n#endif\r\n\r\n#if !defined(HAVE_TBB)\r\n    cout << \"TBB support is required (CMake key 'WITH_TBB' must be true).\\n\";\r\n#endif\r\n\r\n    return 0;\r\n}\r\n\r\n#else\r\n\r\n#include <cuda.h>\r\n#include <cuda_runtime.h>\r\n#include \"opencv2\/core\/internal.hpp\" \/\/ For TBB wrappers\r\n\r\nusing namespace std;\r\nusing namespace cv;\r\nusing namespace cv::gpu;\r\n\r\nstruct Worker { void operator()(int device_id) const; };\r\nvoid destroyContexts();\r\n\r\n#define cuSafeCall(code) if (code != CUDA_SUCCESS) { \\\r\n    cout << \"CUDA driver API error: code \" << code \\\r\n        << \", file \" << __FILE__ << \", line \" << __LINE__ << endl; \\\r\n    destroyContexts(); \\\r\n    exit(-1); \\\r\n}\r\n\r\n\r\n\/\/ Each GPU is associated with its own context\r\nCUcontext contexts[2];\r\n\r\n\r\nint main()\r\n{\r\n    if (getCudaEnabledDeviceCount() < 2)\r\n    {\r\n        cout << \"Two or more GPUs are required\\n\";\r\n        return -1;\r\n    }\r\n\r\n    cuSafeCall(cuInit(0));\r\n\r\n    \/\/ Create context for the first GPU\r\n    CUdevice device;\r\n    cuSafeCall(cuDeviceGet(&device, 0));\r\n    cuSafeCall(cuCtxCreate(&contexts[0], 0, device));\r\n\r\n    CUcontext prev_context;\r\n    cuSafeCall(cuCtxPopCurrent(&prev_context));\r\n\r\n    \/\/ Create context for the second GPU\r\n    cuSafeCall(cuDeviceGet(&device, 1));\r\n    cuSafeCall(cuCtxCreate(&contexts[1], 1, device));\r\n\r\n    cuSafeCall(cuCtxPopCurrent(&prev_context));\r\n\r\n    \/\/ Execute calculation in two threads using two GPUs\r\n    int devices[] = {0, 1};\r\n    parallel_do(devices, devices + 2, Worker());\r\n\r\n    destroyContexts();\r\n    return 0;\r\n}\r\n\r\n\r\nvoid Worker::operator()(int device_id) const\r\n{\r\n    \/\/ Set proper context\r\n    cuSafeCall(cuCtxPushCurrent(contexts[device_id]));\r\n\r\n    Mat src(1000, 1000, CV_32F);\r\n    Mat dst;\r\n\r\n    RNG rng(0);\r\n    rng.fill(src, RNG::UNIFORM, 0, 1);\r\n\r\n    \/\/ CPU works\r\n    transpose(src, dst);\r\n\r\n    GpuMat d_src(src);\r\n    GpuMat d_dst;\r\n\r\n    \/\/ GPU works\r\n    transpose(d_src, d_dst);\r\n\r\n    \/\/ Check results\r\n    bool passed = norm(dst - Mat(d_dst), NORM_INF) < 1e-3;\r\n    cout << \"GPU #\" << device_id << \": \"<< (passed ? \"passed\" : \"FAILED\") << endl;\r\n\r\n    \/\/ Deallocate data here, otherwise deallocation will be performed\r\n    \/\/ after context is extracted from the stack\r\n    d_src.release();\r\n    d_dst.release();\r\n\r\n    CUcontext prev_context;\r\n    cuSafeCall(cuCtxPopCurrent(&prev_context));\r\n}\r\n\r\n\r\nvoid destroyContexts()\r\n{\r\n    cuSafeCall(cuCtxDestroy(contexts[0]));\r\n    cuSafeCall(cuCtxDestroy(contexts[1]));\r\n}\r\n\r\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2012 Carsten Burstedde, Donna Calhoun\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, this\nlist of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice,\nthis list of conditions and the following disclaimer in the documentation\nand\/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 HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY 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\/** \\file fclaw2d_face_neighbors.cpp\n * Average, coarsen and copy between grids at faces.\n **\/\n\n#include <fclaw2d_global.h>\n\n#include <fclaw2d_ghost_fill.h>\n#include <fclaw2d_clawpatch.hpp>\n#include <ClawPatch.H>\n\n\/* This is used to determine neighbor patch relative level (finer, coarser or samesize) *\/\nenum\n{\n    COARSER_GRID = -1,\n    SAMESIZE_GRID,\n    FINER_GRID\n};\n\n\/* This function is a bit overkill, but I put it here so the logic in both\n   the corner fill and face fill are the same *\/\nstatic\nvoid get_face_type(fclaw2d_domain_t *domain,\n                   int iface,\n                   fclaw_bool intersects_phys_bdry[],\n                   fclaw_bool intersects_block[],\n                   fclaw_bool *is_block_face,\n                   fclaw_bool *is_interior_face)\n{\n    *is_block_face = intersects_block[iface];\n    *is_interior_face = !intersects_phys_bdry[iface];\n}\n\n\nstatic\nvoid get_face_neighbors(fclaw2d_domain_t *domain,\n                        int this_block_idx,\n                        int this_patch_idx,\n                        int iface,\n                        int is_block_face,\n                        int *neighbor_block_idx,\n                        fclaw2d_patch_t* neighbor_patches[],\n                        int **ref_flag_ptr,\n                        int **fine_grid_pos_ptr,\n                        int **iface_neighbor_ptr,\n                        int ftransform[],\n                        fclaw2d_transform_data_t* ftransform_finegrid)\n{\n    int rproc[p4est_refineFactor];\n    int rblockno;\n    int rpatchno[p4est_refineFactor];\n    int rfaceno;\n    int num_neighbors;\n\n    for(int ir = 0; ir < p4est_refineFactor; ir++)\n    {\n        neighbor_patches[ir] = NULL;\n    }\n\n    fclaw2d_patch_relation_t neighbor_type =\n        fclaw2d_patch_face_neighbors(domain,\n                                     this_block_idx,\n                                     this_patch_idx,\n                                     iface,\n                                     rproc,\n                                     &rblockno,\n                                     rpatchno,\n                                     &rfaceno);\n\n    \/* ------------------------------\n      neighbor_type is one of :\n      FCLAW2D_PATCH_BOUNDARY,    -- physical boundary\n      FCLAW2D_PATCH_HALFSIZE,\n      FCLAW2D_PATCH_SAMESIZE,\n      FCLAW2D_PATCH_DOUBLESIZE\n      ------------------------------- *\/\n\n    if (neighbor_type == FCLAW2D_PATCH_BOUNDARY)\n    {\n        \/* This case should be excluded by earlier checkes *\/\n        printf(\"get_face_neighbors (fclaw2d_face_neighbors.cpp) : No patch found\\n\");\n        exit(0);\n    }\n    else\n    {\n        *neighbor_block_idx = is_block_face ? rblockno : -1;\n        \/* Get encoding of transforming a neighbor coordinate across a face *\/\n        fclaw2d_patch_face_transformation (iface, rfaceno, ftransform);\n\n        int iface1, rface1;\n        iface1 = iface;\n        rface1 = rfaceno;\n        fclaw2d_patch_face_swap(&iface1,&rface1);\n        fclaw2d_patch_face_transformation (iface1, rface1,\n                                           ftransform_finegrid->transform);\n        ftransform_finegrid->block_iface = iface1;\n        **iface_neighbor_ptr = iface1;\n\n\n        if (!is_block_face)\n        {\n            \/* If we are within one patch this is a special case *\/\n            FCLAW_ASSERT (*neighbor_block_idx == -1);\n            ftransform[8] = 4;\n            ftransform_finegrid->transform[8] = 4;\n        }\n\n        if (neighbor_type == FCLAW2D_PATCH_SAMESIZE)\n        {\n            **ref_flag_ptr = 0;\n            *fine_grid_pos_ptr = NULL;\n            num_neighbors = 1;\n        }\n        else if (neighbor_type == FCLAW2D_PATCH_DOUBLESIZE)\n        {\n            **ref_flag_ptr = -1;\n            **fine_grid_pos_ptr = rproc[1];    \/* Special storage for fine grid info *\/\n            num_neighbors = 1;\n        }\n        else if (neighbor_type == FCLAW2D_PATCH_HALFSIZE)\n        {\n            \/* Patch has two neighbors *\/\n            **ref_flag_ptr = 1; \/* patches are at one level finer *\/\n            *fine_grid_pos_ptr = NULL;\n            num_neighbors = p4est_refineFactor;\n        }\n        else\n        {\n            printf (\"Illegal fclaw2d_patch_face_neighbors return value\\n\");\n            exit (1);\n        }\n\n        for(int ir = 0; ir < num_neighbors; ir++)\n        {\n            fclaw2d_patch_t *neighbor;\n            if (rproc[ir] == domain->mpirank)\n            {\n                \/* neighbor patch is local *\/\n                fclaw2d_block_t *neighbor_block = &domain->blocks[rblockno];\n                neighbor = &neighbor_block->patches[rpatchno[ir]];\n            }\n            else\n            {\n                \/* neighbor patch is on a remote processor *\/\n                neighbor = &domain->ghost_patches[rpatchno[ir]];\n            }\n            neighbor_patches[ir] = neighbor;\n        }\n    }\n}\n\n\/**\n * \\ingroup Averaging\n **\/\nvoid cb_face_fill(fclaw2d_domain_t *domain,\n                  fclaw2d_patch_t *this_patch,\n                  int this_block_idx,\n                  int this_patch_idx,\n                  void *user)\n{\n    fclaw2d_exchange_info_t *filltype = (fclaw2d_exchange_info_t*) user;\n    fclaw_bool time_interp = filltype->time_interp;\n    fclaw_bool is_coarse = filltype->grid_type == FCLAW2D_IS_COARSE;\n    fclaw_bool is_fine = filltype->grid_type == FCLAW2D_IS_FINE;\n\n    fclaw_bool read_parallel_patches = filltype->read_parallel_patches;\n\n    fclaw_bool copy_from_neighbor = filltype->exchange_type == FCLAW2D_COPY;\n    fclaw_bool average_from_neighbor = filltype->exchange_type == FCLAW2D_AVERAGE;\n    fclaw_bool interpolate_to_neighbor = filltype->exchange_type == FCLAW2D_INTERPOLATE;\n\n    const amr_options_t *gparms = get_domain_parms(domain);\n    const int refratio = gparms->refratio;\n\n    fclaw_bool intersects_phys_bdry[NumFaces];\n    fclaw_bool intersects_block[NumFaces];\n\n    fclaw2d_get_physical_bc(domain,this_block_idx,this_patch_idx,\n                            intersects_phys_bdry);\n\n    fclaw2d_block_get_block_boundary(domain, this_patch, intersects_block);\n\n\n    \/* Transform data needed at block boundaries *\/\n    fclaw2d_transform_data_t transform_data;\n    transform_data.mx = gparms->mx;\n    transform_data.my = gparms->my;\n    transform_data.based = 1;                 \/* cell-centered data in this routine. *\/\n    transform_data.this_patch = this_patch;\n    transform_data.neighbor_patch = NULL;     \/* gets filled in below. *\/\n\n    fclaw2d_transform_data_t transform_data_finegrid;\n    transform_data_finegrid.mx = gparms->mx;\n    transform_data_finegrid.my = gparms->my;\n    transform_data_finegrid.based = 1;   \/* cell-centered data in this routine. *\/\n\n    ClawPatch *this_cp = fclaw2d_clawpatch_get_cp(this_patch);\n    for (int iface = 0; iface < NumFaces; iface++)\n    {\n        int idir = iface\/2;\n\n        fclaw_bool is_block_face;\n        fclaw_bool is_interior_face;\n        get_face_type(domain,\n                      iface,\n                      intersects_phys_bdry,\n                      intersects_block,\n                      &is_block_face,\n                      &is_interior_face);\n\n\n        if (is_interior_face)  \/* Not on a physical boundary *\/\n        {\n            \/* Output arguments *\/\n            int neighbor_block_idx;\n            int neighbor_level;   \/* = -1, 0, 1 *\/\n            int *ref_flag_ptr = &neighbor_level;\n            int fine_grid_pos = -1;\n            int *fine_grid_pos_ptr = &fine_grid_pos;\n\n            \/* Get the face neighbor relative to the neighbor's coordinate\n               orientation (this isn't used here) *\/\n            int iface_neighbor;\n            int *iface_neighbor_ptr = &iface_neighbor;\n\n            fclaw2d_patch_t* neighbor_patches[p4est_refineFactor];\n\n            \/* Reset this in case it got set in a remote copy *\/\n            transform_data.this_patch = this_patch;\n            this_cp = fclaw2d_clawpatch_get_cp(this_patch);\n\n            transform_data_finegrid.block_iface = -1;\n\n            \/* transform_data.block_iface = iface; *\/\n            get_face_neighbors(domain,\n                               this_block_idx,\n                               this_patch_idx,\n                               iface,\n\t\t\t       is_block_face,\n                               &neighbor_block_idx,\n                               neighbor_patches,\n                               &ref_flag_ptr,\n                               &fine_grid_pos_ptr,\n                               &iface_neighbor_ptr,\n                               transform_data.transform,\n                               &transform_data_finegrid);\n\n            \/* Needed for switching the context *\/\n            transform_data_finegrid.this_patch = neighbor_patches[0];\n            transform_data_finegrid.neighbor_patch = this_patch;\n\n\n            \/* fclaw_bool block_boundary = (neighbor_block_idx >= 0); *\/\n            if (ref_flag_ptr == NULL)\n            {\n                \/* We should never end up here *\/\n                printf(\"cb_face_fill (fclaw2d_face_neighbors.cpp) : no face found\\n\");\n                exit(0);\n            }\n\n            \/* Parallel distribution keeps siblings on same processor *\/\n            fclaw_bool remote_neighbor;\n            remote_neighbor = fclaw2d_patch_is_ghost(neighbor_patches[0]);\n            if (is_coarse)\n            {\n                if (neighbor_level == FINER_GRID)\n                {\n                    for (int igrid = 0; igrid < p4est_refineFactor; igrid++)\n                    {\n                        remote_neighbor = fclaw2d_patch_is_ghost(neighbor_patches[igrid]);\n                        if (!((read_parallel_patches && remote_neighbor) || !remote_neighbor))\n                        {\n                            continue;\n                        }\n                        ClawPatch *fine_neighbor_cp =\n                            fclaw2d_clawpatch_get_cp(neighbor_patches[igrid]);\n                        transform_data.neighbor_patch = neighbor_patches[igrid];\n                        if (interpolate_to_neighbor && !remote_neighbor)\n                        {\n                            \/* interpolate to igrid *\/\n                            this_cp->interpolate_face_ghost(idir,iface,p4est_refineFactor,\n                                                            refratio,fine_neighbor_cp,\n                                                            time_interp,igrid,\n                                                            &transform_data);\n                        }\n                        else if (average_from_neighbor)\n                        {\n                            \/* average from igrid *\/\n                            this_cp->average_face_ghost(idir,iface,p4est_refineFactor,\n                                                        refratio,fine_neighbor_cp,\n                                                        time_interp,igrid,\n                                                        &transform_data);\n                        }\n                    }\n                }\n                else if (neighbor_level == SAMESIZE_GRID && copy_from_neighbor)\n                {\n                    \/* Copy to same size patch *\/\n                    fclaw2d_patch_t *neighbor_patch = neighbor_patches[0];\n                    ClawPatch *neighbor_cp = fclaw2d_clawpatch_get_cp(neighbor_patch);\n                    transform_data.neighbor_patch = neighbor_patch;\n                    this_cp->exchange_face_ghost(iface,neighbor_cp,&transform_data);\n\n                    \/* We also need to copy _to_ the remote neighbor; switch contexts, but\n                       use ClawPatches that are only in scope here, to avoid\n                       conflicts with above uses of the same variables. This is needed\n                       in case we want to interpolate to adjacent corners on fine grids.*\/\n                    if (remote_neighbor)\n                    {\n                        \/* Create a new transform so we don't mess up the original one *\/\n                        ClawPatch *neighbor_cp = this_cp;\n                        ClawPatch *this_cp = fclaw2d_clawpatch_get_cp(neighbor_patch);\n                        int this_iface = iface_neighbor;\n                        this_cp->exchange_face_ghost(this_iface,neighbor_cp,\n                                                     &transform_data_finegrid);\n                    }\n                }\n            }\n            else if (is_fine && neighbor_level == COARSER_GRID && remote_neighbor\n                     && read_parallel_patches)\n            {\n                int iface_coarse = iface_neighbor;\n                int igrid = fine_grid_pos;  \/* Not used *\/\n                int idir_coarse = iface_coarse\/2;\n\n                \/* Swap 'this_patch' (fine grid) and the neighbor patch (a coarse grid) *\/\n                ClawPatch *coarse_cp = fclaw2d_clawpatch_get_cp(neighbor_patches[0]);\n                ClawPatch *fine_cp = fclaw2d_clawpatch_get_cp(this_patch);\n\n\t\tif (average_from_neighbor)\n                {\n\t\t    \/* Average from 'this' grid (fine grid) to remote grid (coarse grid) *\/\n\t\t    coarse_cp->average_face_ghost(idir_coarse,iface_coarse,\n\t\t\t\t\t\t  p4est_refineFactor,refratio,\n\t\t\t\t\t\t  fine_cp,time_interp,\n\t\t\t\t\t\t  igrid, &transform_data_finegrid);\n                }\n                else if (interpolate_to_neighbor)\n                {\n                    \/* Interpolate from remote neighbor to 'this' patch (the finer grid *\/\n                    fedisableexcept(FE_INVALID);\n                    coarse_cp->interpolate_face_ghost(idir_coarse,iface_coarse,\n                                                      p4est_refineFactor,refratio,\n                                                      fine_cp,time_interp,\n                                                      igrid, &transform_data_finegrid);\n                    if (gparms->trapfpe)\n                    {\n                        feenableexcept(FE_INVALID);\n                    }\n                }\n            }\n        }  \/* End of interior face *\/\n    } \/* End of iface loop *\/\n}\n<commit_msg>Comments<commit_after>\/*\nCopyright (c) 2012 Carsten Burstedde, Donna Calhoun\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, this\nlist of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice,\nthis list of conditions and the following disclaimer in the documentation\nand\/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 HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY 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\/** \\file fclaw2d_face_neighbors.cpp\n * Average, coarsen and copy between grids at faces.\n **\/\n\n#include <fclaw2d_global.h>\n\n#include <fclaw2d_ghost_fill.h>\n#include <fclaw2d_clawpatch.hpp>\n#include <ClawPatch.H>\n\n\/* This is used to determine neighbor patch relative level\n   (finer, coarser or samesize) *\/\nenum\n{\n    COARSER_GRID = -1,\n    SAMESIZE_GRID,\n    FINER_GRID\n};\n\n\/* This function is a bit overkill, but I put it here so the logic in both\n   the corner fill and face fill are the same *\/\nstatic\nvoid get_face_type(fclaw2d_domain_t *domain,\n                   int iface,\n                   fclaw_bool intersects_phys_bdry[],\n                   fclaw_bool intersects_block[],\n                   fclaw_bool *is_block_face,\n                   fclaw_bool *is_interior_face)\n{\n    *is_block_face = intersects_block[iface];\n    *is_interior_face = !intersects_phys_bdry[iface];\n}\n\n\nstatic\nvoid get_face_neighbors(fclaw2d_domain_t *domain,\n                        int this_block_idx,\n                        int this_patch_idx,\n                        int iface,\n                        int is_block_face,\n                        int *neighbor_block_idx,\n                        fclaw2d_patch_t* neighbor_patches[],\n                        int **ref_flag_ptr,\n                        int **fine_grid_pos_ptr,\n                        int **iface_neighbor_ptr,\n                        int ftransform[],\n                        fclaw2d_transform_data_t* ftransform_finegrid)\n{\n    int rproc[p4est_refineFactor];\n    int rblockno;\n    int rpatchno[p4est_refineFactor];\n    int rfaceno;\n    int num_neighbors;\n\n    for(int ir = 0; ir < p4est_refineFactor; ir++)\n    {\n        neighbor_patches[ir] = NULL;\n    }\n\n    fclaw2d_patch_relation_t neighbor_type =\n        fclaw2d_patch_face_neighbors(domain,\n                                     this_block_idx,\n                                     this_patch_idx,\n                                     iface,\n                                     rproc,\n                                     &rblockno,\n                                     rpatchno,\n                                     &rfaceno);\n\n    \/* ------------------------------\n      neighbor_type is one of :\n      FCLAW2D_PATCH_BOUNDARY,    -- physical boundary\n      FCLAW2D_PATCH_HALFSIZE,\n      FCLAW2D_PATCH_SAMESIZE,\n      FCLAW2D_PATCH_DOUBLESIZE\n      ------------------------------- *\/\n\n    if (neighbor_type == FCLAW2D_PATCH_BOUNDARY)\n    {\n        \/* This case should be excluded by earlier checkes *\/\n        printf(\"get_face_neighbors (fclaw2d_face_neighbors.cpp) : No patch \" \\\n               \"found\\n\");\n        exit(0);\n    }\n    else\n    {\n        *neighbor_block_idx = is_block_face ? rblockno : -1;\n        \/* Get encoding of transforming a neighbor coordinate across a face *\/\n        fclaw2d_patch_face_transformation (iface, rfaceno, ftransform);\n\n        int iface1, rface1;\n        iface1 = iface;\n        rface1 = rfaceno;\n        fclaw2d_patch_face_swap(&iface1,&rface1);\n        fclaw2d_patch_face_transformation (iface1, rface1,\n                                           ftransform_finegrid->transform);\n        ftransform_finegrid->block_iface = iface1;\n        **iface_neighbor_ptr = iface1;\n\n\n        if (!is_block_face)\n        {\n            \/* If we are within one patch this is a special case *\/\n            FCLAW_ASSERT (*neighbor_block_idx == -1);\n            ftransform[8] = 4;\n            ftransform_finegrid->transform[8] = 4;\n        }\n\n        if (neighbor_type == FCLAW2D_PATCH_SAMESIZE)\n        {\n            **ref_flag_ptr = 0;\n            *fine_grid_pos_ptr = NULL;\n            num_neighbors = 1;\n        }\n        else if (neighbor_type == FCLAW2D_PATCH_DOUBLESIZE)\n        {\n            **ref_flag_ptr = -1;\n            **fine_grid_pos_ptr = rproc[1];    \/* Special storage for fine grid info *\/\n            num_neighbors = 1;\n        }\n        else if (neighbor_type == FCLAW2D_PATCH_HALFSIZE)\n        {\n            \/* Patch has two neighbors *\/\n            **ref_flag_ptr = 1; \/* patches are at one level finer *\/\n            *fine_grid_pos_ptr = NULL;\n            num_neighbors = p4est_refineFactor;\n        }\n        else\n        {\n            printf (\"Illegal fclaw2d_patch_face_neighbors return value\\n\");\n            exit (1);\n        }\n\n        for(int ir = 0; ir < num_neighbors; ir++)\n        {\n            fclaw2d_patch_t *neighbor;\n            if (rproc[ir] == domain->mpirank)\n            {\n                \/* neighbor patch is local *\/\n                fclaw2d_block_t *neighbor_block = &domain->blocks[rblockno];\n                neighbor = &neighbor_block->patches[rpatchno[ir]];\n            }\n            else\n            {\n                \/* neighbor patch is on a remote processor *\/\n                neighbor = &domain->ghost_patches[rpatchno[ir]];\n            }\n            neighbor_patches[ir] = neighbor;\n        }\n    }\n}\n\n\/**\n * \\ingroup Averaging\n **\/\nvoid cb_face_fill(fclaw2d_domain_t *domain,\n                  fclaw2d_patch_t *this_patch,\n                  int this_block_idx,\n                  int this_patch_idx,\n                  void *user)\n{\n    fclaw2d_exchange_info_t *filltype = (fclaw2d_exchange_info_t*) user;\n    fclaw_bool time_interp = filltype->time_interp;\n    fclaw_bool is_coarse = filltype->grid_type == FCLAW2D_IS_COARSE;\n    fclaw_bool is_fine = filltype->grid_type == FCLAW2D_IS_FINE;\n\n    fclaw_bool read_parallel_patches = filltype->read_parallel_patches;\n\n    fclaw_bool copy_from_neighbor = filltype->exchange_type == FCLAW2D_COPY;\n    fclaw_bool average_from_neighbor = filltype->exchange_type == FCLAW2D_AVERAGE;\n    fclaw_bool interpolate_to_neighbor = filltype->exchange_type == FCLAW2D_INTERPOLATE;\n\n    const amr_options_t *gparms = get_domain_parms(domain);\n    const int refratio = gparms->refratio;\n\n    fclaw_bool intersects_phys_bdry[NumFaces];\n    fclaw_bool intersects_block[NumFaces];\n\n    fclaw2d_get_physical_bc(domain,this_block_idx,this_patch_idx,\n                            intersects_phys_bdry);\n\n    fclaw2d_block_get_block_boundary(domain, this_patch, intersects_block);\n\n\n    \/* Transform data needed at block boundaries *\/\n    fclaw2d_transform_data_t transform_data;\n    transform_data.mx = gparms->mx;\n    transform_data.my = gparms->my;\n    transform_data.based = 1;                 \/* cell-centered data in this routine. *\/\n    transform_data.this_patch = this_patch;\n    transform_data.neighbor_patch = NULL;     \/* gets filled in below. *\/\n\n    fclaw2d_transform_data_t transform_data_finegrid;\n    transform_data_finegrid.mx = gparms->mx;\n    transform_data_finegrid.my = gparms->my;\n    transform_data_finegrid.based = 1;   \/* cell-centered data in this routine. *\/\n\n    ClawPatch *this_cp = fclaw2d_clawpatch_get_cp(this_patch);\n    for (int iface = 0; iface < NumFaces; iface++)\n    {\n        int idir = iface\/2;\n\n        fclaw_bool is_block_face;\n        fclaw_bool is_interior_face;\n        get_face_type(domain,\n                      iface,\n                      intersects_phys_bdry,\n                      intersects_block,\n                      &is_block_face,\n                      &is_interior_face);\n\n\n        if (is_interior_face)  \/* Not on a physical boundary *\/\n        {\n            \/* Output arguments *\/\n            int neighbor_block_idx;\n            int neighbor_level;   \/* = -1, 0, 1 *\/\n            int *ref_flag_ptr = &neighbor_level;\n            int fine_grid_pos = -1;\n            int *fine_grid_pos_ptr = &fine_grid_pos;\n\n            \/* Get the face neighbor relative to the neighbor's coordinate\n               orientation (this isn't used here) *\/\n            int iface_neighbor;\n            int *iface_neighbor_ptr = &iface_neighbor;\n\n            fclaw2d_patch_t* neighbor_patches[p4est_refineFactor];\n\n            \/* Reset this in case it got set in a remote copy *\/\n            transform_data.this_patch = this_patch;\n            this_cp = fclaw2d_clawpatch_get_cp(this_patch);\n\n            transform_data_finegrid.block_iface = -1;\n\n            \/* transform_data.block_iface = iface; *\/\n            get_face_neighbors(domain,\n                               this_block_idx,\n                               this_patch_idx,\n                               iface,\n\t\t\t       is_block_face,\n                               &neighbor_block_idx,\n                               neighbor_patches,\n                               &ref_flag_ptr,\n                               &fine_grid_pos_ptr,\n                               &iface_neighbor_ptr,\n                               transform_data.transform,\n                               &transform_data_finegrid);\n\n            \/* Needed for switching the context *\/\n            transform_data_finegrid.this_patch = neighbor_patches[0];\n            transform_data_finegrid.neighbor_patch = this_patch;\n\n\n            \/* fclaw_bool block_boundary = (neighbor_block_idx >= 0); *\/\n            if (ref_flag_ptr == NULL)\n            {\n                \/* We should never end up here *\/\n                printf(\"cb_face_fill (fclaw2d_face_neighbors.cpp) : no face found\\n\");\n                exit(0);\n            }\n\n            \/* Parallel distribution keeps siblings on same processor *\/\n            fclaw_bool remote_neighbor;\n            remote_neighbor = fclaw2d_patch_is_ghost(neighbor_patches[0]);\n            if (is_coarse)\n            {\n                if (neighbor_level == FINER_GRID)\n                {\n                    for (int igrid = 0; igrid < p4est_refineFactor; igrid++)\n                    {\n                        remote_neighbor = fclaw2d_patch_is_ghost(neighbor_patches[igrid]);\n                        if (!((read_parallel_patches && remote_neighbor) || !remote_neighbor))\n                        {\n                            continue;\n                        }\n                        ClawPatch *fine_neighbor_cp =\n                            fclaw2d_clawpatch_get_cp(neighbor_patches[igrid]);\n                        transform_data.neighbor_patch = neighbor_patches[igrid];\n                        if (interpolate_to_neighbor && !remote_neighbor)\n                        {\n                            \/* interpolate to igrid *\/\n                            this_cp->interpolate_face_ghost(idir,iface,p4est_refineFactor,\n                                                            refratio,fine_neighbor_cp,\n                                                            time_interp,igrid,\n                                                            &transform_data);\n                        }\n                        else if (average_from_neighbor)\n                        {\n                            \/* average from igrid *\/\n                            this_cp->average_face_ghost(idir,iface,p4est_refineFactor,\n                                                        refratio,fine_neighbor_cp,\n                                                        time_interp,igrid,\n                                                        &transform_data);\n                        }\n                    }\n                }\n                else if (neighbor_level == SAMESIZE_GRID && copy_from_neighbor)\n                {\n                    \/* Copy to same size patch *\/\n                    fclaw2d_patch_t *neighbor_patch = neighbor_patches[0];\n                    ClawPatch *neighbor_cp = fclaw2d_clawpatch_get_cp(neighbor_patch);\n                    transform_data.neighbor_patch = neighbor_patch;\n                    this_cp->exchange_face_ghost(iface,neighbor_cp,&transform_data);\n\n                    \/* We also need to copy _to_ the remote neighbor; switch contexts, but\n                       use ClawPatches that are only in scope here, to avoid\n                       conflicts with above uses of the same variables. This is needed\n                       in case we want to interpolate to adjacent corners on fine grids.*\/\n                    if (remote_neighbor)\n                    {\n                        \/* Create a new transform so we don't mess up the original one *\/\n                        ClawPatch *neighbor_cp = this_cp;\n                        ClawPatch *this_cp = fclaw2d_clawpatch_get_cp(neighbor_patch);\n                        int this_iface = iface_neighbor;\n                        this_cp->exchange_face_ghost(this_iface,neighbor_cp,\n                                                     &transform_data_finegrid);\n                    }\n                }\n            }\n            else if (is_fine && neighbor_level == COARSER_GRID && remote_neighbor\n                     && read_parallel_patches)\n            {\n                int iface_coarse = iface_neighbor;\n                int igrid = fine_grid_pos;  \/* Not used *\/\n                int idir_coarse = iface_coarse\/2;\n\n                \/* Swap 'this_patch' (fine grid) and the neighbor patch (a coarse grid) *\/\n                ClawPatch *coarse_cp = fclaw2d_clawpatch_get_cp(neighbor_patches[0]);\n                ClawPatch *fine_cp = fclaw2d_clawpatch_get_cp(this_patch);\n\n\t\tif (average_from_neighbor)\n                {\n\t\t    \/* Average from 'this' grid (fine grid) to remote grid (coarse grid) *\/\n\t\t    coarse_cp->average_face_ghost(idir_coarse,iface_coarse,\n\t\t\t\t\t\t  p4est_refineFactor,refratio,\n\t\t\t\t\t\t  fine_cp,time_interp,\n\t\t\t\t\t\t  igrid, &transform_data_finegrid);\n                }\n                else if (interpolate_to_neighbor)\n                {\n                    \/* Interpolate from remote neighbor to 'this' patch (the finer grid *\/\n                    fedisableexcept(FE_INVALID);\n                    coarse_cp->interpolate_face_ghost(idir_coarse,iface_coarse,\n                                                      p4est_refineFactor,refratio,\n                                                      fine_cp,time_interp,\n                                                      igrid, &transform_data_finegrid);\n                    if (gparms->trapfpe)\n                    {\n                        feenableexcept(FE_INVALID);\n                    }\n                }\n            }\n        }  \/* End of interior face *\/\n    } \/* End of iface loop *\/\n}\n<|endoftext|>"}
{"text":"<commit_before>#\/*##########################################################################\n#\n# The fisx library for X-Ray Fluorescence\n#\n# Copyright (c) 2020 European Synchrotron Radiation Facility\n#\n# This file is part of the fisx X-ray developed by V.A. Sole\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 <stdexcept>\n#include \"fisx_transmissiontable.h\"\n#include <iostream>\n\nnamespace fisx\n{\n\nTransmissionTable::TransmissionTable()\n{\n    this->name = \"\";\n    this->comment = \"\";\n    \/\/ no attenuation at all\n    this->transmissionTable[0.0] = 1.0;\n}\n\nTransmissionTable::TransmissionTable(const std::string & name, const std::string & comment)\n{\n    this->name = name;\n    this->comment = comment;\n    \/\/ no attenuation at all\n    this->transmissionTable[0.0] = 1.0;\n}\n\n\nvoid TransmissionTable::setName(const std::string & name)\n{\n    this->name = name;\n}\n\nvoid TransmissionTable::setComment(const std::string & comment)\n{\n    this->comment = comment;\n}\n\n\nvoid TransmissionTable::setTransmissionTable(const std::map<double, double> & table, \\\n                          const std::string & name, const std::string & comment)\n{\n    std::string msg;\n        throw std::invalid_argument(msg);\n    std::map<double, double>::const_iterator c_it;\n\n    \/\/ verify that no value is negative\n    for (c_it = table.begin(); c_it != table.end(); ++c_it)\n    {\n        if (c_it->first < 0.0)\n        {\n            msg = \"TransmissionTable::setTransmissionTable. Invalid energy\";\n            throw std::invalid_argument(msg);\n        }\n        if (c_it->second < 0.0)\n        {\n            msg = \"TransmissionTable::setTransmissionTable. Invalid transmission\";\n            throw std::invalid_argument(msg);\n        }\n    }\n\n    \/\/ verify the table was not already named\n    if ((this->name.size() > 0) and (name.size() > 0))\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Table cannot be renamed\";\n        throw std::invalid_argument(msg);\n    }\n    if ((this->comment.size() > 0) and (comment.size() > 0))\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Table comment cannot be changed\";\n        throw std::invalid_argument(msg);\n    }\n\n    \/\/ assign the values\n    this->transmissionTable = table;\n    this->name = name;\n    this->comment = comment;\n}\n\nvoid TransmissionTable::setTransmissionTable(const std::vector<double> & energy, \\\n                                             const std::vector<double> & transmission, \\\n                                             const std::string & name, \\\n                                             const std::string & comment)\n{\n    std::vector<double>::size_type i;\n    std::string msg;\n\n    \/\/ check input\n    \/\/ verify the table was not already named\n    if ((this->name.size() > 0) and (name.size() > 0))\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Table cannot be renamed\";\n        throw std::invalid_argument(msg);\n    }\n    if ((this->comment.size() > 0) and (comment.size() > 0))\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Table comment cannot be changed\";\n        throw std::invalid_argument(msg);\n    }\n\n    \/\/ verify the data are consistent\n    if (energy.size() != transmission.size())\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Number of energies and attenuations not matching\";\n        throw std::invalid_argument(msg);\n    }\n    for (i = 0; i < energy.size(); ++i)\n    {\n        if (energy[i] < 0.0)\n        {\n            msg = \"TransmissionTable::setTransmissionTable. Negative energy\";\n            throw std::invalid_argument(msg);\n        }\n        if (transmission[i] < 0.0)\n        {\n            msg = \"TransmissionTable::setTransmissionTable. Negative transmission\";\n            throw std::invalid_argument(msg);\n        }\n    }\n\n    \/\/ fill the table\n    this->transmissionTable.clear();\n    for (i = 0; i < energy.size(); ++i)\n    {\n        this->transmissionTable[energy[i]] = transmission[i];\n    }\n    this->name = name;\n    this->comment = comment;\n}\n\n\nstd::string TransmissionTable::getComment() const\n{\n    return this->comment;\n}\n\nstd::string TransmissionTable::getName() const\n{\n    return this->name;\n}\n\ndouble TransmissionTable::getTransmission(const double & energy) const\n{\n    \/\/typedef std::map<double, double>::const_iterator i_t;\n    std::map<double, double>::const_iterator i1, i2;\n    double x1, x2, factor;\n\n    if (this->transmissionTable.size() < 1)\n    {\n        return 1.0;\n    }\n\n    if (energy <= 0.0)\n    {\n        return 1.0;\n    }\n\n    i2 = this->transmissionTable.upper_bound(energy);\n    if (i2 == this->transmissionTable.end())\n    {\n        \/\/ return last value of the table\n        \/\/ return (--i)->second;\n        \/\/ or return 1 because we are dealing with a transmission?\n        return 1.0;\n    }\n    i1 = this->transmissionTable.begin();\n    if (energy < (i1->second))\n    {\n        \/\/ return first value of the table\n        \/\/ return i->second;\n        \/\/ or return 0 because we are dealing with a transmission?\n        return 0.0;\n    }\n    i1 = i2;\n    i1--;\n\n    x1 = i1->first;\n    x2 = i2->first;\n\n    \/\/ perform a linear interpolation\n    factor = (energy - x1) \/ (x2 - x1);\n    return factor * (i2->second) + (1.0 - factor) * i1->second;\n}\n\nstd::vector<double> TransmissionTable::getTransmission(const std::vector<double> & energy) const\n{\n    std::vector<double>::size_type n, i;\n    std::vector<double> result;\n\n    n = energy.size();\n    result.resize(n);\n    for (i = 0; i < n; ++i)\n    {\n        result[i] = this->getTransmission(energy[i]);\n    }\n    return result;\n}\n\nstd::map<double, double> TransmissionTable::getTransmissionTable() const\n{\n    return this->transmissionTable;\n}\n\n\n\n} \/\/ namespace fisx\n<commit_msg>Use correct syntax<commit_after>#\/*##########################################################################\n#\n# The fisx library for X-Ray Fluorescence\n#\n# Copyright (c) 2020 European Synchrotron Radiation Facility\n#\n# This file is part of the fisx X-ray developed by V.A. Sole\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 <stdexcept>\n#include \"fisx_transmissiontable.h\"\n#include <iostream>\n\nnamespace fisx\n{\n\nTransmissionTable::TransmissionTable()\n{\n    this->name = \"\";\n    this->comment = \"\";\n    \/\/ no attenuation at all\n    this->transmissionTable[0.0] = 1.0;\n}\n\nTransmissionTable::TransmissionTable(const std::string & name, const std::string & comment)\n{\n    this->name = name;\n    this->comment = comment;\n    \/\/ no attenuation at all\n    this->transmissionTable[0.0] = 1.0;\n}\n\n\nvoid TransmissionTable::setName(const std::string & name)\n{\n    this->name = name;\n}\n\nvoid TransmissionTable::setComment(const std::string & comment)\n{\n    this->comment = comment;\n}\n\n\nvoid TransmissionTable::setTransmissionTable(const std::map<double, double> & table, \\\n                          const std::string & name, const std::string & comment)\n{\n    std::string msg;\n        throw std::invalid_argument(msg);\n    std::map<double, double>::const_iterator c_it;\n\n    \/\/ verify that no value is negative\n    for (c_it = table.begin(); c_it != table.end(); ++c_it)\n    {\n        if (c_it->first < 0.0)\n        {\n            msg = \"TransmissionTable::setTransmissionTable. Invalid energy\";\n            throw std::invalid_argument(msg);\n        }\n        if (c_it->second < 0.0)\n        {\n            msg = \"TransmissionTable::setTransmissionTable. Invalid transmission\";\n            throw std::invalid_argument(msg);\n        }\n    }\n\n    \/\/ verify the table was not already named\n    if ((this->name.size() > 0) && (name.size() > 0))\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Table cannot be renamed\";\n        throw std::invalid_argument(msg);\n    }\n    if ((this->comment.size() > 0) && (comment.size() > 0))\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Table comment cannot be changed\";\n        throw std::invalid_argument(msg);\n    }\n\n    \/\/ assign the values\n    this->transmissionTable = table;\n    this->name = name;\n    this->comment = comment;\n}\n\nvoid TransmissionTable::setTransmissionTable(const std::vector<double> & energy, \\\n                                             const std::vector<double> & transmission, \\\n                                             const std::string & name, \\\n                                             const std::string & comment)\n{\n    std::vector<double>::size_type i;\n    std::string msg;\n\n    \/\/ check input\n    \/\/ verify the table was not already named\n    if ((this->name.size() > 0) && (name.size() > 0))\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Table cannot be renamed\";\n        throw std::invalid_argument(msg);\n    }\n    if ((this->comment.size() > 0) && (comment.size() > 0))\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Table comment cannot be changed\";\n        throw std::invalid_argument(msg);\n    }\n\n    \/\/ verify the data are consistent\n    if (energy.size() != transmission.size())\n    {\n        msg = \"TransmissionTable::setTransmissionTable. Number of energies and attenuations not matching\";\n        throw std::invalid_argument(msg);\n    }\n    for (i = 0; i < energy.size(); ++i)\n    {\n        if (energy[i] < 0.0)\n        {\n            msg = \"TransmissionTable::setTransmissionTable. Negative energy\";\n            throw std::invalid_argument(msg);\n        }\n        if (transmission[i] < 0.0)\n        {\n            msg = \"TransmissionTable::setTransmissionTable. Negative transmission\";\n            throw std::invalid_argument(msg);\n        }\n    }\n\n    \/\/ fill the table\n    this->transmissionTable.clear();\n    for (i = 0; i < energy.size(); ++i)\n    {\n        this->transmissionTable[energy[i]] = transmission[i];\n    }\n    this->name = name;\n    this->comment = comment;\n}\n\n\nstd::string TransmissionTable::getComment() const\n{\n    return this->comment;\n}\n\nstd::string TransmissionTable::getName() const\n{\n    return this->name;\n}\n\ndouble TransmissionTable::getTransmission(const double & energy) const\n{\n    \/\/typedef std::map<double, double>::const_iterator i_t;\n    std::map<double, double>::const_iterator i1, i2;\n    double x1, x2, factor;\n\n    if (this->transmissionTable.size() < 1)\n    {\n        return 1.0;\n    }\n\n    if (energy <= 0.0)\n    {\n        return 1.0;\n    }\n\n    i2 = this->transmissionTable.upper_bound(energy);\n    if (i2 == this->transmissionTable.end())\n    {\n        \/\/ return last value of the table\n        \/\/ return (--i)->second;\n        \/\/ or return 1 because we are dealing with a transmission?\n        return 1.0;\n    }\n    i1 = this->transmissionTable.begin();\n    if (energy < (i1->second))\n    {\n        \/\/ return first value of the table\n        \/\/ return i->second;\n        \/\/ or return 0 because we are dealing with a transmission?\n        return 0.0;\n    }\n    i1 = i2;\n    i1--;\n\n    x1 = i1->first;\n    x2 = i2->first;\n\n    \/\/ perform a linear interpolation\n    factor = (energy - x1) \/ (x2 - x1);\n    return factor * (i2->second) + (1.0 - factor) * i1->second;\n}\n\nstd::vector<double> TransmissionTable::getTransmission(const std::vector<double> & energy) const\n{\n    std::vector<double>::size_type n, i;\n    std::vector<double> result;\n\n    n = energy.size();\n    result.resize(n);\n    for (i = 0; i < n; ++i)\n    {\n        result[i] = this->getTransmission(energy[i]);\n    }\n    return result;\n}\n\nstd::map<double, double> TransmissionTable::getTransmissionTable() const\n{\n    return this->transmissionTable;\n}\n\n\n\n} \/\/ namespace fisx\n<|endoftext|>"}
{"text":"<commit_before>#include \"libcmm_irob.h\"\n#include \"cmm_socket.h\"\n#include <errno.h>\n\n\/* Begin an IROB on a multi-socket.  \n * Such IROBs have sender labels, receiver labels, and a thunk\n * associated, just as traditional multi-socket send operations do. *\/\nirob_id_t begin_irob(mc_socket_t sock, int numdeps, const irob_id_t *deps, \n                     u_long send_labels, \n                     resume_handler_t fn, void *arg)\n{\n    return CMMSocket::lookup(sock)->mc_begin_irob(numdeps, deps,\n                                                  send_labels,\n                                                  fn, arg);\n}\n\n\/* End an IROB, notifying the receiver that it is complete. *\/\nint end_irob(irob_id_t id)\n{\n    return CMMSocket::lookup_by_irob(id)->mc_end_irob(id);\n}\n\n\/* Sending operations for IROBs.  Since an irob_id implies a socket,\n * the socket argument is not required. \n * Recall that send operations within an IROB are guaranteed to be \n * received in their original order (see receiver API below). *\/\nssize_t irob_send(irob_id_t irob_id, const void *buf, size_t len, int flags)\n{\n    return CMMSocket::lookup_by_irob(irob_id)->mc_irob_send(irob_id,\n                                                            buf, len, flags);\n}\n\nint irob_writev(irob_id_t irob_id, const struct iovec *vector, int count)\n{\n    return CMMSocket::lookup_by_irob(irob_id)->mc_irob_writev(irob_id,\n                                                              vector, count);\n}\n\nssize_t \ncmm_write_with_deps(mc_socket_t sock, const void *buf, size_t len,\n\t\t    int numdeps, const irob_id_t *deps, \n\t\t    u_long send_labels, resume_handler_t fn, void *arg,\n\t\t    irob_id_t *irob_id)\n{\n    return cmm_send_with_deps(sock, buf, len, 0, numdeps, deps, \n\t\t\t      send_labels, fn, arg, irob_id);\n}\n\nssize_t \ncmm_send_with_deps(mc_socket_t sock, const void *buf, size_t len, int flags,\n\t\t   int numdeps, const irob_id_t *deps, \n\t\t   u_long send_labels, resume_handler_t fn, void *arg,\n\t\t   irob_id_t *irob_id)\n{\n    irob_id_t id = begin_irob(sock, numdeps, deps, send_labels, fn, arg);\n    if (id < 0) {\n\tif (errno == EBADF) {\n\t    \/\/ this must not be a multisocket.  send it regular-style!\n\t    return cmm_send(sock, buf, len, flags, send_labels, fn, arg);\n\t} else {\n\t    \/\/ some other error; just return it\n\t    return id;\n\t}\n    }\n\n    ssize_t bytes_sent = irob_send(id, buf, len, flags);\n    if (bytes_sent < 0) {\n\treturn bytes_sent;\n    }\n\n    int rc = end_irob(id);\n    if (rc < 0) {\n\treturn rc;\n    }\n\n    *irob_id = id;\n    return bytes_sent;\n}\n\nint \ncmm_writev_with_deps(mc_socket_t sock, const struct iovec *vector, int count,\n\t\t     int numdeps, const irob_id_t *deps, \n\t\t     u_long send_labels, resume_handler_t fn, void *arg,\n\t\t     irob_id_t *irob_id)\n{\n    irob_id_t id = begin_irob(sock, numdeps, deps, send_labels, fn, arg);\n    if (id < 0) {\n\tif (errno == EBADF) {\n\t    \/\/ this must not be a multisocket.  send it regular-style!\n\t    return cmm_writev(sock, vector, count, send_labels, fn, arg);\n\t} else {\n\t    \/\/ some other error; just return it\n\t    return id;\n\t}\n    }\n\n    int bytes_sent = irob_writev(id, vector, count);\n    if (bytes_sent < 0) {\n\treturn bytes_sent;\n    }\n\n    int rc = end_irob(id);\n    if (rc < 0) {\n\treturn rc;\n    }\n\n    *irob_id = id;\n    return bytes_sent;\n}\n\nint \nirob_relabel(irob_id_t irob_id, u_long new_labels)\n{\n    return CMMSocket::lookup_by_irob(irob_id)->irob_relabel(irob_id, new_labels);\n}\n<commit_msg>Silly NULL-pointer dereference bug, fixed.<commit_after>#include \"libcmm_irob.h\"\n#include \"cmm_socket.h\"\n#include <errno.h>\n\n\/* Begin an IROB on a multi-socket.  \n * Such IROBs have sender labels, receiver labels, and a thunk\n * associated, just as traditional multi-socket send operations do. *\/\nirob_id_t begin_irob(mc_socket_t sock, int numdeps, const irob_id_t *deps, \n                     u_long send_labels, \n                     resume_handler_t fn, void *arg)\n{\n    return CMMSocket::lookup(sock)->mc_begin_irob(numdeps, deps,\n                                                  send_labels,\n                                                  fn, arg);\n}\n\n\/* End an IROB, notifying the receiver that it is complete. *\/\nint end_irob(irob_id_t id)\n{\n    return CMMSocket::lookup_by_irob(id)->mc_end_irob(id);\n}\n\n\/* Sending operations for IROBs.  Since an irob_id implies a socket,\n * the socket argument is not required. \n * Recall that send operations within an IROB are guaranteed to be \n * received in their original order (see receiver API below). *\/\nssize_t irob_send(irob_id_t irob_id, const void *buf, size_t len, int flags)\n{\n    return CMMSocket::lookup_by_irob(irob_id)->mc_irob_send(irob_id,\n                                                            buf, len, flags);\n}\n\nint irob_writev(irob_id_t irob_id, const struct iovec *vector, int count)\n{\n    return CMMSocket::lookup_by_irob(irob_id)->mc_irob_writev(irob_id,\n                                                              vector, count);\n}\n\nssize_t \ncmm_write_with_deps(mc_socket_t sock, const void *buf, size_t len,\n\t\t    int numdeps, const irob_id_t *deps, \n\t\t    u_long send_labels, resume_handler_t fn, void *arg,\n\t\t    irob_id_t *irob_id)\n{\n    return cmm_send_with_deps(sock, buf, len, 0, numdeps, deps, \n\t\t\t      send_labels, fn, arg, irob_id);\n}\n\nssize_t \ncmm_send_with_deps(mc_socket_t sock, const void *buf, size_t len, int flags,\n\t\t   int numdeps, const irob_id_t *deps, \n\t\t   u_long send_labels, resume_handler_t fn, void *arg,\n\t\t   irob_id_t *irob_id)\n{\n    irob_id_t id = begin_irob(sock, numdeps, deps, send_labels, fn, arg);\n    if (id < 0) {\n\tif (errno == EBADF) {\n\t    \/\/ this must not be a multisocket.  send it regular-style!\n\t    return cmm_send(sock, buf, len, flags, send_labels, fn, arg);\n\t} else {\n\t    \/\/ some other error; just return it\n\t    return id;\n\t}\n    }\n\n    ssize_t bytes_sent = irob_send(id, buf, len, flags);\n    if (bytes_sent < 0) {\n\treturn bytes_sent;\n    }\n\n    int rc = end_irob(id);\n    if (rc < 0) {\n\treturn rc;\n    }\n\n    if (irob_id) {\n        *irob_id = id;\n    }\n    return bytes_sent;\n}\n\nint \ncmm_writev_with_deps(mc_socket_t sock, const struct iovec *vector, int count,\n\t\t     int numdeps, const irob_id_t *deps, \n\t\t     u_long send_labels, resume_handler_t fn, void *arg,\n\t\t     irob_id_t *irob_id)\n{\n    irob_id_t id = begin_irob(sock, numdeps, deps, send_labels, fn, arg);\n    if (id < 0) {\n\tif (errno == EBADF) {\n\t    \/\/ this must not be a multisocket.  send it regular-style!\n\t    return cmm_writev(sock, vector, count, send_labels, fn, arg);\n\t} else {\n\t    \/\/ some other error; just return it\n\t    return id;\n\t}\n    }\n\n    int bytes_sent = irob_writev(id, vector, count);\n    if (bytes_sent < 0) {\n\treturn bytes_sent;\n    }\n\n    int rc = end_irob(id);\n    if (rc < 0) {\n\treturn rc;\n    }\n\n    if (irob_id) {\n        *irob_id = id;\n    }\n    return bytes_sent;\n}\n\nint \nirob_relabel(irob_id_t irob_id, u_long new_labels)\n{\n    return CMMSocket::lookup_by_irob(irob_id)->irob_relabel(irob_id, new_labels);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- Support\/Chrono.cpp - Utilities for Timing Manipulation ---*- 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 \"llvm\/Support\/Chrono.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nnamespace llvm {\n\nusing namespace sys;\n\nconst char llvm::detail::unit<std::ratio<3600>>::value[] = \"h\";\nconst char llvm::detail::unit<std::ratio<60>>::value[] = \"m\";\nconst char llvm::detail::unit<std::ratio<1>>::value[] = \"s\";\nconst char llvm::detail::unit<std::milli>::value[] = \"ms\";\nconst char llvm::detail::unit<std::micro>::value[] = \"us\";\nconst char llvm::detail::unit<std::nano>::value[] = \"ns\";\n\nstatic inline struct tm getStructTM(TimePoint<> TP) {\n  struct tm Storage;\n  std::time_t OurTime = toTimeT(TP);\n\n#if defined(LLVM_ON_UNIX)\n  struct tm *LT = ::localtime_r(&OurTime, &Storage);\n  assert(LT);\n  (void)LT;\n#endif\n#if defined(LLVM_ON_WIN32)\n  int Error = ::localtime_s(&Storage, &OurTime);\n  assert(!Error);\n  (void)Error;\n#endif\n\n  return Storage;\n}\n\nraw_ostream &operator<<(raw_ostream &OS, TimePoint<> TP) {\n  struct tm LT = getStructTM(TP);\n  char Buffer[sizeof(\"YYYY-MM-DD HH:MM:SS\")];\n  strftime(Buffer, sizeof(Buffer), \"%Y-%m-%d %H:%M:%S\", &LT);\n  return OS << Buffer << '.'\n            << format(\"%.9lu\",\n                      long((TP.time_since_epoch() % std::chrono::seconds(1))\n                               .count()));\n}\n\nvoid format_provider<TimePoint<>>::format(const TimePoint<> &T, raw_ostream &OS,\n                                          StringRef Style) {\n  using namespace std::chrono;\n  TimePoint<seconds> Truncated = time_point_cast<seconds>(T);\n  auto Fractional = T - Truncated;\n  struct tm LT = getStructTM(Truncated);\n  \/\/ Handle extensions first. strftime mangles unknown %x on some platforms.\n  if (Style.empty()) Style = \"%Y-%m-%d %H:%M:%S.%N\";\n  std::string Format;\n  raw_string_ostream FStream(Format);\n  for (unsigned I = 0; I < Style.size(); ++I) {\n    if (Style[I] == '%' && Style.size() > I + 1) switch (Style[I + 1]) {\n        case 'L':  \/\/ Milliseconds, from Ruby.\n          FStream << llvm::format(\n              \"%.3lu\", duration_cast<milliseconds>(Fractional).count());\n          ++I;\n          continue;\n        case 'f':  \/\/ Microseconds, from Python.\n          FStream << llvm::format(\n              \"%.6lu\", duration_cast<microseconds>(Fractional).count());\n          ++I;\n          continue;\n        case 'N':  \/\/ Nanoseconds, from date(1).\n          FStream << llvm::format(\n              \"%.6lu\", duration_cast<nanoseconds>(Fractional).count());\n          ++I;\n          continue;\n        case '%':  \/\/ Consume %%, so %%f parses as (%%)f not %(%f)\n          FStream << \"%%\";\n          ++I;\n          continue;\n      }\n    FStream << Style[I];\n  }\n  FStream.flush();\n  char Buffer[256];  \/\/ Should be enough for anywhen.\n  size_t Len = strftime(Buffer, sizeof(Buffer), Format.c_str(), &LT);\n  OS << (Len ? Buffer : \"BAD-DATE-FORMAT\");\n}\n\n} \/\/ namespace llvm\n<commit_msg>[Support][Chrono] Use explicit cast of text output of time values.<commit_after>\/\/===- Support\/Chrono.cpp - Utilities for Timing Manipulation ---*- 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 \"llvm\/Support\/Chrono.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nnamespace llvm {\n\nusing namespace sys;\n\nconst char llvm::detail::unit<std::ratio<3600>>::value[] = \"h\";\nconst char llvm::detail::unit<std::ratio<60>>::value[] = \"m\";\nconst char llvm::detail::unit<std::ratio<1>>::value[] = \"s\";\nconst char llvm::detail::unit<std::milli>::value[] = \"ms\";\nconst char llvm::detail::unit<std::micro>::value[] = \"us\";\nconst char llvm::detail::unit<std::nano>::value[] = \"ns\";\n\nstatic inline struct tm getStructTM(TimePoint<> TP) {\n  struct tm Storage;\n  std::time_t OurTime = toTimeT(TP);\n\n#if defined(LLVM_ON_UNIX)\n  struct tm *LT = ::localtime_r(&OurTime, &Storage);\n  assert(LT);\n  (void)LT;\n#endif\n#if defined(LLVM_ON_WIN32)\n  int Error = ::localtime_s(&Storage, &OurTime);\n  assert(!Error);\n  (void)Error;\n#endif\n\n  return Storage;\n}\n\nraw_ostream &operator<<(raw_ostream &OS, TimePoint<> TP) {\n  struct tm LT = getStructTM(TP);\n  char Buffer[sizeof(\"YYYY-MM-DD HH:MM:SS\")];\n  strftime(Buffer, sizeof(Buffer), \"%Y-%m-%d %H:%M:%S\", &LT);\n  return OS << Buffer << '.'\n            << format(\"%.9lu\",\n                      long((TP.time_since_epoch() % std::chrono::seconds(1))\n                               .count()));\n}\n\nvoid format_provider<TimePoint<>>::format(const TimePoint<> &T, raw_ostream &OS,\n                                          StringRef Style) {\n  using namespace std::chrono;\n  TimePoint<seconds> Truncated = time_point_cast<seconds>(T);\n  auto Fractional = T - Truncated;\n  struct tm LT = getStructTM(Truncated);\n  \/\/ Handle extensions first. strftime mangles unknown %x on some platforms.\n  if (Style.empty()) Style = \"%Y-%m-%d %H:%M:%S.%N\";\n  std::string Format;\n  raw_string_ostream FStream(Format);\n  for (unsigned I = 0; I < Style.size(); ++I) {\n    if (Style[I] == '%' && Style.size() > I + 1) switch (Style[I + 1]) {\n        case 'L':  \/\/ Milliseconds, from Ruby.\n          FStream << llvm::format(\n              \"%.3lu\", (long)duration_cast<milliseconds>(Fractional).count());\n          ++I;\n          continue;\n        case 'f':  \/\/ Microseconds, from Python.\n          FStream << llvm::format(\n              \"%.6lu\", (long)duration_cast<microseconds>(Fractional).count());\n          ++I;\n          continue;\n        case 'N':  \/\/ Nanoseconds, from date(1).\n          FStream << llvm::format(\n              \"%.6lu\", (long)duration_cast<nanoseconds>(Fractional).count());\n          ++I;\n          continue;\n        case '%':  \/\/ Consume %%, so %%f parses as (%%)f not %(%f)\n          FStream << \"%%\";\n          ++I;\n          continue;\n      }\n    FStream << Style[I];\n  }\n  FStream.flush();\n  char Buffer[256];  \/\/ Should be enough for anywhen.\n  size_t Len = strftime(Buffer, sizeof(Buffer), Format.c_str(), &LT);\n  OS << (Len ? Buffer : \"BAD-DATE-FORMAT\");\n}\n\n} \/\/ namespace llvm\n<|endoftext|>"}
{"text":"<commit_before>#ifdef _WIN32\n\/\/\trequest += \"Connection: Keep-Alive\\n\";\n#include <ws2tcpip.h>\n#include <windows.h>\n#include <winhttp.h>\n#pragma comment(lib, \"Winhttp.lib\")\n#else\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#define INVALID_SOCKET -1\n#include <unistd.h>\n#endif\n\n#include \"http.h\"\n#include \"libuuu.h\"\n#include \"liberror.h\"\n#include <string.h>\n#include <locale>\n#include <codecvt>\n\n#ifdef UUUSSL\n#include <openssl\/ssl.h>\n#include <openssl\/err.h>\n\nclass CUUUSSL\n{\npublic:\n\tCUUUSSL()\n\t{\n#if OPENSSL_VERSION_NUMBER < 0x10100000L\n\t\tSSL_library_init();\n\t\tSSLeay_add_ssl_algorithms();\n\t\tSSL_load_error_strings();\n#else\n\t\tOPENSSL_init_ssl(0, NULL);\n\t\tSSLeay_add_ssl_algorithms();\n#endif\n\t}\n\t~CUUUSSL()\n\t{\n\t}\n};\n\nstatic CUUUSSL g_uuussl;\n\n#endif\n\n\nusing namespace std;\n\n#ifdef _WIN32\n\/* Win32 implement*\/\n\nHttpStream::HttpStream()\n{\n\tm_buff.empty();\n\tm_socket = 0;\n\tm_hConnect = 0;\n\tm_hSession = 0;\n\tm_hRequest = 0;\n}\n\nint HttpStream::HttpGetHeader(std::string host, std::string path, int port)\n{\n\n\tm_hSession = WinHttpOpen(L\"WinHTTP UUU\/1.0\",\n\t\tWINHTTP_ACCESS_TYPE_DEFAULT_PROXY,\n\t\tWINHTTP_NO_PROXY_NAME,\n\t\tWINHTTP_NO_PROXY_BYPASS, 0);\n\n\tif (!m_hSession)\n\t{\n\t\tset_last_err_string(\"fail WinHttpOpen\");\n\t\treturn -1;\n\t}\n\n\twstring_convert<codecvt_utf8_utf16<wchar_t>> converter;\n\twstring whost = converter.from_bytes(host);\n\n\tif (m_hSession)\n\t\tm_hConnect = WinHttpConnect(m_hSession, whost.c_str(),\n\t\t\tport, 0);\n\n\tif (!m_hConnect)\n\t{\n\t\tset_last_err_string(\"Fail Connection\");\n\t\treturn -1;\n\t}\n\n\twstring wpath = converter.from_bytes(path);\n\n\tm_hRequest = WinHttpOpenRequest(m_hConnect, L\"GET\", wpath.c_str(),\n\t\t\tNULL, WINHTTP_NO_REFERER,\n\t\t\tWINHTTP_DEFAULT_ACCEPT_TYPES,\n\t\t\tport==443?WINHTTP_FLAG_SECURE:0);\n\n\tBOOL  bResults = FALSE;\n\tif (!m_hRequest)\n\t{\n\t\tset_last_err_string(\"Fail WinHttpOpenRequest\");\n\t\treturn -1;\n\t}\n\n\tbResults = WinHttpSendRequest(m_hRequest,\n\t\t\tWINHTTP_NO_ADDITIONAL_HEADERS, 0,\n\t\t\tWINHTTP_NO_REQUEST_DATA, 0,\n\t\t\t0, 0);\n\n\tif (!bResults)\n\t{\n\t\tset_last_err_string(\"Fail WinHttpSendRequest\");\n\t\treturn -1;\n\t}\n\n\tbResults = WinHttpReceiveResponse(m_hRequest, NULL);\n\n\tif (!bResults)\n\t{\n\t\tset_last_err_string(\"Fail WinHttpReceiveResponse\");\n\t\treturn -1;\n\t}\n\n\tDWORD status = 0;\n\tDWORD dwSize = sizeof(status);\n\tWinHttpQueryHeaders(m_hRequest, WINHTTP_QUERY_STATUS_CODE | WINHTTP_QUERY_FLAG_NUMBER,\n\t\tWINHTTP_HEADER_NAME_BY_INDEX, &status,\n\t\t&dwSize, WINHTTP_NO_HEADER_INDEX);\n\n\tif (status != HTTP_STATUS_OK)\n\t{\n\t\tset_last_err_string(\"HTTP status is not okay\");\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\nsize_t HttpStream::HttpGetFileSize()\n{\n\tDWORD dwSize = 0;\n\tBOOL  bResults = FALSE;\n\twstring out;\n\n\tWinHttpQueryHeaders(m_hRequest, WINHTTP_QUERY_CONTENT_LENGTH,\n\t\tWINHTTP_HEADER_NAME_BY_INDEX, NULL,\n\t\t&dwSize, WINHTTP_NO_HEADER_INDEX);\n\n\t\/\/ Allocate memory for the buffer.\n\tif (GetLastError() == ERROR_INSUFFICIENT_BUFFER)\n\t{\n\t\tout.resize(dwSize \/ sizeof(WCHAR));\n\n\t\t\/\/ Now, use WinHttpQueryHeaders to retrieve the header.\n\t\tbResults = WinHttpQueryHeaders(m_hRequest,\n\t\t\tWINHTTP_QUERY_CONTENT_LENGTH,\n\t\t\tWINHTTP_HEADER_NAME_BY_INDEX,\n\t\t\t(LPVOID)out.c_str(), &dwSize,\n\t\t\tWINHTTP_NO_HEADER_INDEX);\n\t}\n\treturn _wtoll(out.c_str());\n}\n\nint HttpStream::HttpDownload(char *buff, size_t sz)\n{\n\tDWORD dwSize = 0;\n\tDWORD dwDownloaded = 0;\n\twhile (sz)\n\t{\n\t\tif (!WinHttpQueryDataAvailable(m_hRequest, &dwSize))\n\t\t{\n\t\t\tset_last_err_string(\"WinHttpQueryDataAvailable\");\n\t\t\treturn -1;\n\t\t}\n\n\t\tif (dwSize > sz)\n\t\t\tdwSize = sz;\n\n\t\tif (!WinHttpReadData(m_hRequest, (LPVOID)buff,\n\t\t\tdwSize, &dwDownloaded))\n\t\t{\n\t\t\tset_last_err_string(\"Fail at WinHttpReadData\");\n\t\t\treturn -1;\n\t\t}\n\t\tbuff += dwDownloaded;\n\t\tsz -= dwDownloaded;\n\t}\n\treturn 0;\n}\n\nHttpStream::~HttpStream()\n{\n\tif (m_hRequest)\n\t\tWinHttpCloseHandle(m_hRequest);\n\tif (m_hConnect)\n\t\tWinHttpCloseHandle(m_hConnect);\n\tif (m_hSession)\n\t\tWinHttpCloseHandle(m_hSession);\n}\n\n#else\n\nHttpStream::HttpStream()\n{\n\tm_buff.empty();\n\tm_ssl = NULL;\n}\n\nint HttpStream::SendPacket(char *buff, size_t sz)\n{\n#ifdef UUUSSL\n\tif(m_ssl)\n\t\treturn SSL_write((SSL*)m_ssl, buff, sz);\n#endif\n\treturn send(m_socket, buff, sz, 0);\n}\n\n\nint HttpStream::RecvPacket(char *buff, size_t sz)\n{\n#ifdef UUUSSL\n\tif(m_ssl)\n\t\treturn SSL_read((SSL*)m_ssl, buff, sz);\n#endif\n\treturn recv(m_socket, buff, sz, 0);\n}\n\nint HttpStream::HttpGetHeader(std::string host, std::string path, int port)\n{\n\tint ret;\n\taddrinfo *pAddrInfo;\n\tchar s_port[10];\n\tsnprintf(s_port, 10, \"%d\", port);\n\n\tif (getaddrinfo(host.c_str(), s_port, 0, &pAddrInfo))\n\t{\n\t\tset_last_err_string(\"get network address error\");\n\t\treturn -1;\n\t}\n\n\tm_socket = socket(pAddrInfo->ai_family, pAddrInfo->ai_socktype, pAddrInfo->ai_protocol);\n\n\tstruct timeval tv;\n\ttv.tv_sec = 10;\n\ttv.tv_usec = 0;\n\n\tsetsockopt(m_socket, SOL_SOCKET, SO_RCVTIMEO, (const char*)&tv, sizeof(tv));\n\n\tif (m_socket == INVALID_SOCKET)\n\t{\n\t\tset_last_err_string(\"Can't get sock\");\n\t\treturn -1;\n\t}\n\n\tif (connect(m_socket, pAddrInfo->ai_addr, pAddrInfo->ai_addrlen))\n\t{\n\t\tset_last_err_string(\"connect error\");\n\t\treturn -1;\n\t}\n\n\tif(port == 443)\n\t{\n#ifdef UUUSSL\n\n\t\tconst SSL_METHOD *meth = TLSv1_2_client_method();\n\t\tif(!meth)\n\t\t{\n\t\t\tset_last_err_string(\"Failure at TLSv1_2_client_method\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tSSL_CTX *ctx = SSL_CTX_new (meth);\n\t\tif(!ctx)\n\t\t{\n\t\t\tset_last_err_string(\"Error create ssl ctx\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tm_ssl = SSL_new (ctx);\n\t\tif(!m_ssl)\n\t\t{\n\t\t\tset_last_err_string(\"Error create SSL\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tSSL_set_fd((SSL*)m_ssl, m_socket);\n\t\tif( SSL_connect((SSL*)m_ssl) <= 0)\n\t\t{\n\t\t\tset_last_err_string(\"error build ssl connection\");\n\t\t\treturn -1;\n\t\t}\n#else\n\t\tset_last_err_string(\"Can't support https\");\n\t\treturn -1;\n#endif\n        }\n\n\tif(port == 443)\n\t\tpath = \"https:\/\/\" + host + path;\n\n\tstring request = \"GET \" + path + \" HTTP\/1.1\\r\\n\";\n\trequest += \"Host: \" + host + \"\\r\\n\\r\\n\";\n\n\tret = SendPacket((char*)request.c_str(), request.size());\n\tif (ret != request.size())\n\t{\n\t\tset_last_err_string(\"http send error\");\n\t\treturn -1;\n\t}\n\n\tm_buff.resize(1024);\n\tret = RecvPacket((char*)m_buff.data(), m_buff.size());\n\tif (ret < 0)\n\t{\n\t\tset_last_err_string(\"http recv Error\");\n\t\treturn -1;\n\t}\n\n\tint i;\n\tfor (i = 0; i < 1024 - 4; i++)\n\t{\n\t\tif (m_buff[i] == 0xd &&\n\t\t\tm_buff[i + 1] == 0xa &&\n\t\t\tm_buff[i + 2] == 0xd &&\n\t\t\tm_buff[i + 3] == 0xa)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (i >= 1024 - 4)\n\t{\n\t\tset_last_err_string(\"Can't find termaniate\");\n\t\treturn -1;\n\t}\n\n\tm_data_start = i + 4;\n\n\tstring str;\n\tstr.resize(i + 2);\n\tmemcpy((void*)str.c_str(), m_buff.data(), i + 2);\n\n\tif (parser_response(str))\n\t\treturn -1;\n\n\treturn 0;\n}\n\nsize_t HttpStream::HttpGetFileSize()\n{\n\treturn atoll(m_response[\"Content-Length\"].c_str());\n}\n\nint HttpStream::parser_response(string rep)\n{\n\tsize_t pos = rep.find(\"\\r\\n\");\n\tif (pos == string::npos)\n\t{\n\t\tset_last_err_string(\"Can't find \\r\\n\");\n\t\treturn -1;\n\t}\n\n\tstring str = rep.substr(0, pos);\n\tif (str != \"HTTP\/1.1 200 OK\")\n\t{\n\t\tset_last_err_string(str);\n\t\treturn -1;\n\t}\n\n\tm_response.clear();\n\n\twhile (pos != string::npos)\n\t{\n\t\tpos += 2;\n\t\tsize_t split = rep.find(':', pos);\n\t\tif (split == string::npos)\n\t\t\tbreak;\n\t\tstring key = rep.substr(pos, split - pos);\n\t\tpos = rep.find(\"\\r\\n\", pos);\n\t\tstring value = rep.substr(split + 1, pos - split - 1);\n\t\tm_response[key] = value;\n\t}\n\n\treturn 0;\n}\n\nint HttpStream::HttpDownload(char *buff, size_t sz)\n{\n\tsize_t left = 0;\n\tif (m_data_start < m_buff.size())\n\t\tleft = m_buff.size() - m_data_start;\n\t\n\tsize_t trim_transfered = 0;\n\n\tif (left)\n\t{\n\t\t\n\t\ttrim_transfered = sz;\n\t\tif (trim_transfered > left)\n\t\t\ttrim_transfered = left;\n\n\t\tmemcpy(buff, m_buff.data() + m_data_start, trim_transfered);\n\t\tm_data_start += trim_transfered;\n\t}\n\n\tif (trim_transfered < sz)\n\t{\n\t\tint ret = 0;\n\t\tsz -= trim_transfered;\n\t\tbuff += trim_transfered;\n\t\twhile (sz && ((ret = RecvPacket(buff, sz)) > 0))\n\t\t{\n\t\t\tbuff += ret;\n\t\t\tsz -= ret;\n\t\t}\n\n\t\tif (ret < 0)\n\t\t{\n\t\t\tset_last_err_string(\"recv error\");\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nHttpStream::~HttpStream()\n{\n\tclose(m_socket);\n#ifdef UUUSSL\n\tif(m_ssl)\n\t{\n\t\tSSL_CTX_free(SSL_get_SSL_CTX((SSL*)m_ssl));\n\t\tSSL_free((SSL*)m_ssl);\n\t}\n#endif\n}\n\n#endif\n<commit_msg>add missed copyright for http.cpp<commit_after>\/*\n * Copyright 2019 NXP.\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 * 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, this\n * list of conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.\n *\n * Neither the name of the NXP Semiconductor 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\n\n#ifdef _WIN32\n\/\/\trequest += \"Connection: Keep-Alive\\n\";\n#include <ws2tcpip.h>\n#include <windows.h>\n#include <winhttp.h>\n#pragma comment(lib, \"Winhttp.lib\")\n#else\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#define INVALID_SOCKET -1\n#include <unistd.h>\n#endif\n\n#include \"http.h\"\n#include \"libuuu.h\"\n#include \"liberror.h\"\n#include <string.h>\n#include <locale>\n#include <codecvt>\n\n#ifdef UUUSSL\n#include <openssl\/ssl.h>\n#include <openssl\/err.h>\n\nclass CUUUSSL\n{\npublic:\n\tCUUUSSL()\n\t{\n#if OPENSSL_VERSION_NUMBER < 0x10100000L\n\t\tSSL_library_init();\n\t\tSSLeay_add_ssl_algorithms();\n\t\tSSL_load_error_strings();\n#else\n\t\tOPENSSL_init_ssl(0, NULL);\n\t\tSSLeay_add_ssl_algorithms();\n#endif\n\t}\n\t~CUUUSSL()\n\t{\n\t}\n};\n\nstatic CUUUSSL g_uuussl;\n\n#endif\n\n\nusing namespace std;\n\n#ifdef _WIN32\n\/* Win32 implement*\/\n\nHttpStream::HttpStream()\n{\n\tm_buff.empty();\n\tm_socket = 0;\n\tm_hConnect = 0;\n\tm_hSession = 0;\n\tm_hRequest = 0;\n}\n\nint HttpStream::HttpGetHeader(std::string host, std::string path, int port)\n{\n\n\tm_hSession = WinHttpOpen(L\"WinHTTP UUU\/1.0\",\n\t\tWINHTTP_ACCESS_TYPE_DEFAULT_PROXY,\n\t\tWINHTTP_NO_PROXY_NAME,\n\t\tWINHTTP_NO_PROXY_BYPASS, 0);\n\n\tif (!m_hSession)\n\t{\n\t\tset_last_err_string(\"fail WinHttpOpen\");\n\t\treturn -1;\n\t}\n\n\twstring_convert<codecvt_utf8_utf16<wchar_t>> converter;\n\twstring whost = converter.from_bytes(host);\n\n\tif (m_hSession)\n\t\tm_hConnect = WinHttpConnect(m_hSession, whost.c_str(),\n\t\t\tport, 0);\n\n\tif (!m_hConnect)\n\t{\n\t\tset_last_err_string(\"Fail Connection\");\n\t\treturn -1;\n\t}\n\n\twstring wpath = converter.from_bytes(path);\n\n\tm_hRequest = WinHttpOpenRequest(m_hConnect, L\"GET\", wpath.c_str(),\n\t\t\tNULL, WINHTTP_NO_REFERER,\n\t\t\tWINHTTP_DEFAULT_ACCEPT_TYPES,\n\t\t\tport==443?WINHTTP_FLAG_SECURE:0);\n\n\tBOOL  bResults = FALSE;\n\tif (!m_hRequest)\n\t{\n\t\tset_last_err_string(\"Fail WinHttpOpenRequest\");\n\t\treturn -1;\n\t}\n\n\tbResults = WinHttpSendRequest(m_hRequest,\n\t\t\tWINHTTP_NO_ADDITIONAL_HEADERS, 0,\n\t\t\tWINHTTP_NO_REQUEST_DATA, 0,\n\t\t\t0, 0);\n\n\tif (!bResults)\n\t{\n\t\tset_last_err_string(\"Fail WinHttpSendRequest\");\n\t\treturn -1;\n\t}\n\n\tbResults = WinHttpReceiveResponse(m_hRequest, NULL);\n\n\tif (!bResults)\n\t{\n\t\tset_last_err_string(\"Fail WinHttpReceiveResponse\");\n\t\treturn -1;\n\t}\n\n\tDWORD status = 0;\n\tDWORD dwSize = sizeof(status);\n\tWinHttpQueryHeaders(m_hRequest, WINHTTP_QUERY_STATUS_CODE | WINHTTP_QUERY_FLAG_NUMBER,\n\t\tWINHTTP_HEADER_NAME_BY_INDEX, &status,\n\t\t&dwSize, WINHTTP_NO_HEADER_INDEX);\n\n\tif (status != HTTP_STATUS_OK)\n\t{\n\t\tset_last_err_string(\"HTTP status is not okay\");\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\nsize_t HttpStream::HttpGetFileSize()\n{\n\tDWORD dwSize = 0;\n\tBOOL  bResults = FALSE;\n\twstring out;\n\n\tWinHttpQueryHeaders(m_hRequest, WINHTTP_QUERY_CONTENT_LENGTH,\n\t\tWINHTTP_HEADER_NAME_BY_INDEX, NULL,\n\t\t&dwSize, WINHTTP_NO_HEADER_INDEX);\n\n\t\/\/ Allocate memory for the buffer.\n\tif (GetLastError() == ERROR_INSUFFICIENT_BUFFER)\n\t{\n\t\tout.resize(dwSize \/ sizeof(WCHAR));\n\n\t\t\/\/ Now, use WinHttpQueryHeaders to retrieve the header.\n\t\tbResults = WinHttpQueryHeaders(m_hRequest,\n\t\t\tWINHTTP_QUERY_CONTENT_LENGTH,\n\t\t\tWINHTTP_HEADER_NAME_BY_INDEX,\n\t\t\t(LPVOID)out.c_str(), &dwSize,\n\t\t\tWINHTTP_NO_HEADER_INDEX);\n\t}\n\treturn _wtoll(out.c_str());\n}\n\nint HttpStream::HttpDownload(char *buff, size_t sz)\n{\n\tDWORD dwSize = 0;\n\tDWORD dwDownloaded = 0;\n\twhile (sz)\n\t{\n\t\tif (!WinHttpQueryDataAvailable(m_hRequest, &dwSize))\n\t\t{\n\t\t\tset_last_err_string(\"WinHttpQueryDataAvailable\");\n\t\t\treturn -1;\n\t\t}\n\n\t\tif (dwSize > sz)\n\t\t\tdwSize = sz;\n\n\t\tif (!WinHttpReadData(m_hRequest, (LPVOID)buff,\n\t\t\tdwSize, &dwDownloaded))\n\t\t{\n\t\t\tset_last_err_string(\"Fail at WinHttpReadData\");\n\t\t\treturn -1;\n\t\t}\n\t\tbuff += dwDownloaded;\n\t\tsz -= dwDownloaded;\n\t}\n\treturn 0;\n}\n\nHttpStream::~HttpStream()\n{\n\tif (m_hRequest)\n\t\tWinHttpCloseHandle(m_hRequest);\n\tif (m_hConnect)\n\t\tWinHttpCloseHandle(m_hConnect);\n\tif (m_hSession)\n\t\tWinHttpCloseHandle(m_hSession);\n}\n\n#else\n\nHttpStream::HttpStream()\n{\n\tm_buff.empty();\n\tm_ssl = NULL;\n}\n\nint HttpStream::SendPacket(char *buff, size_t sz)\n{\n#ifdef UUUSSL\n\tif(m_ssl)\n\t\treturn SSL_write((SSL*)m_ssl, buff, sz);\n#endif\n\treturn send(m_socket, buff, sz, 0);\n}\n\n\nint HttpStream::RecvPacket(char *buff, size_t sz)\n{\n#ifdef UUUSSL\n\tif(m_ssl)\n\t\treturn SSL_read((SSL*)m_ssl, buff, sz);\n#endif\n\treturn recv(m_socket, buff, sz, 0);\n}\n\nint HttpStream::HttpGetHeader(std::string host, std::string path, int port)\n{\n\tint ret;\n\taddrinfo *pAddrInfo;\n\tchar s_port[10];\n\tsnprintf(s_port, 10, \"%d\", port);\n\n\tif (getaddrinfo(host.c_str(), s_port, 0, &pAddrInfo))\n\t{\n\t\tset_last_err_string(\"get network address error\");\n\t\treturn -1;\n\t}\n\n\tm_socket = socket(pAddrInfo->ai_family, pAddrInfo->ai_socktype, pAddrInfo->ai_protocol);\n\n\tstruct timeval tv;\n\ttv.tv_sec = 10;\n\ttv.tv_usec = 0;\n\n\tsetsockopt(m_socket, SOL_SOCKET, SO_RCVTIMEO, (const char*)&tv, sizeof(tv));\n\n\tif (m_socket == INVALID_SOCKET)\n\t{\n\t\tset_last_err_string(\"Can't get sock\");\n\t\treturn -1;\n\t}\n\n\tif (connect(m_socket, pAddrInfo->ai_addr, pAddrInfo->ai_addrlen))\n\t{\n\t\tset_last_err_string(\"connect error\");\n\t\treturn -1;\n\t}\n\n\tif(port == 443)\n\t{\n#ifdef UUUSSL\n\n\t\tconst SSL_METHOD *meth = TLSv1_2_client_method();\n\t\tif(!meth)\n\t\t{\n\t\t\tset_last_err_string(\"Failure at TLSv1_2_client_method\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tSSL_CTX *ctx = SSL_CTX_new (meth);\n\t\tif(!ctx)\n\t\t{\n\t\t\tset_last_err_string(\"Error create ssl ctx\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tm_ssl = SSL_new (ctx);\n\t\tif(!m_ssl)\n\t\t{\n\t\t\tset_last_err_string(\"Error create SSL\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tSSL_set_fd((SSL*)m_ssl, m_socket);\n\t\tif( SSL_connect((SSL*)m_ssl) <= 0)\n\t\t{\n\t\t\tset_last_err_string(\"error build ssl connection\");\n\t\t\treturn -1;\n\t\t}\n#else\n\t\tset_last_err_string(\"Can't support https\");\n\t\treturn -1;\n#endif\n        }\n\n\tif(port == 443)\n\t\tpath = \"https:\/\/\" + host + path;\n\n\tstring request = \"GET \" + path + \" HTTP\/1.1\\r\\n\";\n\trequest += \"Host: \" + host + \"\\r\\n\\r\\n\";\n\n\tret = SendPacket((char*)request.c_str(), request.size());\n\tif (ret != request.size())\n\t{\n\t\tset_last_err_string(\"http send error\");\n\t\treturn -1;\n\t}\n\n\tm_buff.resize(1024);\n\tret = RecvPacket((char*)m_buff.data(), m_buff.size());\n\tif (ret < 0)\n\t{\n\t\tset_last_err_string(\"http recv Error\");\n\t\treturn -1;\n\t}\n\n\tint i;\n\tfor (i = 0; i < 1024 - 4; i++)\n\t{\n\t\tif (m_buff[i] == 0xd &&\n\t\t\tm_buff[i + 1] == 0xa &&\n\t\t\tm_buff[i + 2] == 0xd &&\n\t\t\tm_buff[i + 3] == 0xa)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (i >= 1024 - 4)\n\t{\n\t\tset_last_err_string(\"Can't find termaniate\");\n\t\treturn -1;\n\t}\n\n\tm_data_start = i + 4;\n\n\tstring str;\n\tstr.resize(i + 2);\n\tmemcpy((void*)str.c_str(), m_buff.data(), i + 2);\n\n\tif (parser_response(str))\n\t\treturn -1;\n\n\treturn 0;\n}\n\nsize_t HttpStream::HttpGetFileSize()\n{\n\treturn atoll(m_response[\"Content-Length\"].c_str());\n}\n\nint HttpStream::parser_response(string rep)\n{\n\tsize_t pos = rep.find(\"\\r\\n\");\n\tif (pos == string::npos)\n\t{\n\t\tset_last_err_string(\"Can't find \\r\\n\");\n\t\treturn -1;\n\t}\n\n\tstring str = rep.substr(0, pos);\n\tif (str != \"HTTP\/1.1 200 OK\")\n\t{\n\t\tset_last_err_string(str);\n\t\treturn -1;\n\t}\n\n\tm_response.clear();\n\n\twhile (pos != string::npos)\n\t{\n\t\tpos += 2;\n\t\tsize_t split = rep.find(':', pos);\n\t\tif (split == string::npos)\n\t\t\tbreak;\n\t\tstring key = rep.substr(pos, split - pos);\n\t\tpos = rep.find(\"\\r\\n\", pos);\n\t\tstring value = rep.substr(split + 1, pos - split - 1);\n\t\tm_response[key] = value;\n\t}\n\n\treturn 0;\n}\n\nint HttpStream::HttpDownload(char *buff, size_t sz)\n{\n\tsize_t left = 0;\n\tif (m_data_start < m_buff.size())\n\t\tleft = m_buff.size() - m_data_start;\n\t\n\tsize_t trim_transfered = 0;\n\n\tif (left)\n\t{\n\t\t\n\t\ttrim_transfered = sz;\n\t\tif (trim_transfered > left)\n\t\t\ttrim_transfered = left;\n\n\t\tmemcpy(buff, m_buff.data() + m_data_start, trim_transfered);\n\t\tm_data_start += trim_transfered;\n\t}\n\n\tif (trim_transfered < sz)\n\t{\n\t\tint ret = 0;\n\t\tsz -= trim_transfered;\n\t\tbuff += trim_transfered;\n\t\twhile (sz && ((ret = RecvPacket(buff, sz)) > 0))\n\t\t{\n\t\t\tbuff += ret;\n\t\t\tsz -= ret;\n\t\t}\n\n\t\tif (ret < 0)\n\t\t{\n\t\t\tset_last_err_string(\"recv error\");\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nHttpStream::~HttpStream()\n{\n\tclose(m_socket);\n#ifdef UUUSSL\n\tif(m_ssl)\n\t{\n\t\tSSL_CTX_free(SSL_get_SSL_CTX((SSL*)m_ssl));\n\t\tSSL_free((SSL*)m_ssl);\n\t}\n#endif\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \".\/qimage_drawer.h\"\n#include <QPainter>\n#include <vector>\n\nnamespace Graphics\n{\n\nQImageDrawer::QImageDrawer(int width, int height)\n{\n  image = std::make_shared<QImage>(width, height, QImage::Format_Grayscale8);\n}\n\nvoid drawPolygon(QPainter &painter, std::vector<QPointF> &points)\n{\n  if (points.size() < 3)\n    return;\n\n  QPointF triangle[3];\n  triangle[0] = points[0];\n  for (size_t i = 2; i < points.size(); ++i)\n  {\n    triangle[1] = points[i - 1];\n    triangle[2] = points[i];\n    painter.drawConvexPolygon(triangle, 3);\n  }\n  points.clear();\n}\n\nvoid QImageDrawer::drawElementVector(std::vector<float> positions, float color)\n{\n  QPainter painter;\n  painter.begin(image.get());\n  QColor brushColor = QColor::fromRgbF(color, color, color, 1.0f);\n  painter.setBrush(QBrush(brushColor));\n  painter.setPen(brushColor);\n\n  std::vector<QPointF> points;\n  size_t i = 0;\n  if (positions[0] == positions[2] && positions[1] == positions[3])\n    i = 1;\n\n  for (; i < positions.size() \/ 2; ++i)\n  {\n    float x = positions[i * 2];\n    float y = image->height() - positions[i * 2 + 1];\n    if (i * 2 + 3 < positions.size() && x == positions[i * 2 + 2] &&\n        y == positions[i * 2 + 3])\n    {\n      drawPolygon(painter, points);\n      points.clear();\n      i += 2;\n    }\n    points.push_back(QPointF(x, y));\n  }\n  drawPolygon(painter, points);\n  painter.end();\n}\n\nvoid QImageDrawer::clear()\n{\n  image->fill(Qt::GlobalColor::black);\n}\n\n}  \/\/ namespace Graphics\n<commit_msg>Implement drawing with logical or in QImageDrawer.<commit_after>#include \".\/qimage_drawer.h\"\n#include <QPainter>\n#include <vector>\n\nnamespace Graphics\n{\n\nQImageDrawer::QImageDrawer(int width, int height)\n{\n  image = std::make_shared<QImage>(width, height, QImage::Format_Grayscale8);\n}\n\nvoid drawPolygon(QPainter &painter, std::vector<QPointF> &points)\n{\n  if (points.size() < 3)\n    return;\n\n  QPointF triangle[3];\n  triangle[0] = points[0];\n  for (size_t i = 2; i < points.size(); ++i)\n  {\n    triangle[1] = points[i - 1];\n    triangle[2] = points[i];\n    painter.drawConvexPolygon(triangle, 3);\n  }\n  points.clear();\n}\n\nvoid QImageDrawer::drawElementVector(std::vector<float> positions, float color)\n{\n  QPainter painter;\n  QImage tempImage(image->width(), image->height(), image->format());\n  tempImage.fill(Qt::GlobalColor::black);\n  painter.begin(&tempImage);\n  QColor brushColor = QColor::fromRgbF(color, color, color, 1.0f);\n  painter.setBrush(QBrush(brushColor));\n  painter.setPen(brushColor);\n\n  std::vector<QPointF> points;\n  size_t i = 0;\n  if (positions[0] == positions[2] && positions[1] == positions[3])\n    i = 1;\n\n  for (; i < positions.size() \/ 2; ++i)\n  {\n    float x = positions[i * 2];\n    float y = image->height() - positions[i * 2 + 1];\n    if (i * 2 + 3 < positions.size() && x == positions[i * 2 + 2] &&\n        y == positions[i * 2 + 3])\n    {\n      drawPolygon(painter, points);\n      points.clear();\n      i += 2;\n    }\n    points.push_back(QPointF(x, y));\n  }\n  drawPolygon(painter, points);\n  painter.end();\n\n  for (int x = 0; x < image->width(); ++x)\n  {\n    for (int y = 0; y < image->height(); ++y)\n    {\n      QRgb imagePixel = image->pixel(x, y);\n      QRgb tempPixel = tempImage.pixel(x, y);\n      image->setPixel(x, y, imagePixel | tempPixel);\n    }\n  }\n}\n\nvoid QImageDrawer::clear()\n{\n  image->fill(Qt::GlobalColor::black);\n}\n\n}  \/\/ namespace Graphics\n<|endoftext|>"}
{"text":"<commit_before>\/\/ __BEGIN_LICENSE__\n\/\/ Copyright (C) 2006-2010 United States Government as represented by\n\/\/ the Administrator of the National Aeronautics and Space Administration.\n\/\/ All Rights Reserved.\n\/\/ __END_LICENSE__\n\n\n\/\/\/ deplate.cc\n\/\/\/\n\/\/\/ Converts a plate file to GeoTIFF tiles on disk.\n\n#include <vw\/Image.h>\n#include <vw\/FileIO.h>\n#include <vw\/Plate\/PlateView.h>\n#include <vw\/Plate\/PlateCarreePlateManager.h>\n\nusing namespace vw;\nusing namespace vw::platefile;\n\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/program_options.hpp>\nnamespace po = boost::program_options;\nnamespace fs = boost::filesystem;\n\nstruct Options {\n  Options() : west(0), east(0), north(0), south(0), tile_size(0),\n              tile_size_deg(0), pds_dem_mode(false), pds_imagery_mode(false) {}\n\n  \/\/ Input for project file\n  std::string plate_file_name;\n\n  \/\/ Settings\n  int west, east, north, south, tile_size, tile_size_deg;\n  double tile_ppd;\n  bool pds_dem_mode, pds_imagery_mode;\n\n  \/\/ Output\n  std::string output_datum, output_prefix;\n};\n\n\/\/ ConvertToPDSImagery\n\/\/  .. coverts an image into the range of 1-254 where 0 is invalid and 255 is reserved.\ntemplate <class PixelT>\nclass ConvertToPDSImagery : public ReturnFixedType<typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type,uint8>::type> {\n  typedef typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type,uint8>::type return_type;\n  typedef typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type,double>::type return_double_type;\n  typedef typename CompoundChannelType<PixelT>::type input_channel_type;\npublic:\n  return_type operator()( PixelT value ) const {\n    if ( is_transparent(value) ) {\n      return return_type();\n    } else {\n      return_double_type result\n        = channel_cast<double>(non_alpha_channels(value))*253.0\/ChannelRange<input_channel_type>::max();\n      for ( uint8 i = 0; i < CompoundNumChannels<return_double_type>::value; i++ ) {\n        if (result[i] < 0)\n          result[i] = 0;\n        if (result[i] > 253)\n          result[i] = 253;\n      }\n      return channel_cast<uint8>(result)+1;\n    }\n  }\n};\n\ntemplate <class ImageT>\nUnaryPerPixelView<ImageT, ConvertToPDSImagery<typename ImageT::pixel_type> >\ninline convert_to_pds_imagery( ImageViewBase<ImageT> const& image ) {\n  typedef ConvertToPDSImagery<typename ImageT::pixel_type> func_type;\n  return UnaryPerPixelView<ImageT, func_type>( image.impl(), func_type() );\n}\n\ntemplate <class PixelT>\nvoid do_tiles(boost::shared_ptr<PlateFile> platefile, Options& opt) {\n\n  PlateCarreePlateManager<PixelT> pm(platefile);\n  cartography::GeoReference output_georef = pm.georeference(platefile->num_levels()-1);\n  cartography::Datum datum;\n  datum.set_well_known_datum( opt.output_datum );\n  output_georef.set_datum( datum );\n\n  PlateView<PixelT> plate_view(opt.plate_file_name);\n  ImageViewRef<PixelT> plate_view_ref = plate_view;\n  double scale_change = 1;\n  if ( opt.tile_ppd > 0 ) {\n    \/\/ Finding out our current PPD and attempting to match\n    double curr_ppd = norm_2(output_georef.lonlat_to_pixel(Vector2(0,0))-\n                             output_georef.lonlat_to_pixel(Vector2(1,0)));\n    scale_change = opt.tile_ppd \/ curr_ppd;\n    plate_view_ref = resample( plate_view, scale_change, scale_change,\n                               ZeroEdgeExtension());\n    Matrix3x3 scale;\n    scale.set_identity();\n    scale(0,0) \/= scale_change;\n    scale(1,1) \/= scale_change;\n    output_georef.set_transform( output_georef.transform()*scale );\n\n    \/\/ Double check\n    curr_ppd = norm_2(output_georef.lonlat_to_pixel(Vector2(0,0))-\n                      output_georef.lonlat_to_pixel(Vector2(1,0)));\n  }\n  std::cout << \"Converting \" << opt.plate_file_name << \" to \" << opt.output_prefix << \"\\n\";\n  std::cout << output_georef << \"\\n\";\n\n  \/\/ Get the output georeference.\n  vw::BBox2i output_bbox;\n  output_bbox.grow(output_georef.lonlat_to_pixel(Vector2(opt.west, opt.north)));\n  output_bbox.grow(output_georef.lonlat_to_pixel(Vector2(opt.east, opt.north)));\n  output_bbox.grow(output_georef.lonlat_to_pixel(Vector2(opt.west, opt.south)));\n  output_bbox.grow(output_georef.lonlat_to_pixel(Vector2(opt.east, opt.south)));\n  std::cout << \"\\t--> Output bbox: \" << output_bbox << \"\\n\";\n\n  if ( opt.tile_size_deg > 0 ) {\n    if ( opt.tile_ppd > 0 ) {\n      opt.tile_size = opt.tile_size_deg * opt.tile_ppd;\n    } else {\n      \/\/ User must have specified out to be sized in degrees\n      opt.tile_size = norm_2(output_georef.lonlat_to_pixel(Vector2(0,0)) -\n                             output_georef.lonlat_to_pixel(Vector2(opt.tile_size_deg,0)));\n    }\n  }\n\n  \/\/ Compute the bounding box for each tile.\n  std::vector<BBox2i> crop_bboxes = image_blocks(crop(plate_view_ref, output_bbox),\n                                                 opt.tile_size, opt.tile_size);\n\n  for (unsigned i = 0; i < crop_bboxes.size(); ++i) {\n    \/\/ The crop bboxes start at (0,0), and we want them to start at\n    \/\/ the upper left corner of the output_bbox.\n    crop_bboxes[i].min() += output_bbox.min();\n    crop_bboxes[i].max() += output_bbox.min();\n\n    { \/\/ Checking to see if this section is transparent\n      std::list<TileHeader> theaders =\n        plate_view.search_for_tiles( crop_bboxes[i] \/ scale_change );\n      if (theaders.empty())\n        continue;\n    }\n\n    cartography::GeoReference tile_georef = output_georef;\n    Vector2 top_left_ll = output_georef.pixel_to_lonlat(crop_bboxes[i].min());\n    Matrix3x3 T = tile_georef.transform();\n    T(0,2) = top_left_ll(0);\n    T(1,2) = top_left_ll(1);\n    tile_georef.set_transform(T);\n\n    std::cout << \"\\t--> Generating tile \" << (i+1) << \" \/ \" << crop_bboxes.size()\n              << \" : \" << crop_bboxes[i] << \"\\n\"\n              << \"\\t    with transform  \"\n              << tile_georef.transform() << \"\\n\";\n\n    std::ostringstream output_filename;\n    output_filename << opt.output_prefix << \"_\"\n                    << abs(round(top_left_ll[0]));\n    if ( top_left_ll[0] < 0 )\n      output_filename << \"W_\";\n    else\n      output_filename << \"E_\";\n    output_filename << abs(round(top_left_ll[1]));\n    if ( top_left_ll[1] >= 0 )\n      output_filename << \"N.tif\";\n    else\n      output_filename << \"S.tif\";\n\n    ImageView<PixelT> cropped_view = crop(plate_view_ref, crop_bboxes[i]);\n    DiskImageResourceGDAL::Options gdal_options;\n    gdal_options[\"COMPRESS\"] = \"LZW\";\n\n    if ( opt.pds_dem_mode ) {\n      ImageViewRef<typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type ,int16>::type > dem_image = apply_mask(alpha_to_mask(channel_cast<int16>(cropped_view)),-32767);\n      DiskImageResourceGDAL rsrc(output_filename.str(), dem_image.format(),\n                                 Vector2i(256,256), gdal_options);\n      write_georeference(rsrc, tile_georef);\n      write_image(rsrc, dem_image,\n                  TerminalProgressCallback( \"plate.tools\", \"\\t    Writing: \"));\n    } else if ( opt.pds_imagery_mode ) {\n      ImageViewRef<typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type ,uint8>::type > dem_image = convert_to_pds_imagery( cropped_view );\n      DiskImageResourceGDAL rsrc(output_filename.str(), dem_image.format(),\n                                 Vector2i(256,256), gdal_options);\n      write_georeference(rsrc, tile_georef);\n      write_image(rsrc, dem_image,\n                  TerminalProgressCallback( \"plate.tools\", \"\\t    Writing: \"));\n    } else {\n      DiskImageResourceGDAL rsrc(output_filename.str(), cropped_view.format(),\n                                 Vector2i(256,256), gdal_options);\n      write_georeference(rsrc, tile_georef);\n      write_image(rsrc, cropped_view,\n                  TerminalProgressCallback( \"plate.tools\", \"\\t    Writing: \"));\n    }\n\n  }\n}\n\nvoid handle_arguments( int argc, char *argv[], Options& opt ) {\n  po::options_description general_options(\"Chops platefile into georeferenced squares.\\n\\nGeneral Options\");\n  general_options.add_options()\n    (\"output-prefix,o\", po::value(&opt.output_prefix), \"Specify the base output directory\")\n    (\"west,w\", po::value(&opt.west)->default_value(-180), \"Specify west edge of the region to extract (deg).\")\n    (\"east,e\", po::value(&opt.east)->default_value(180), \"Specify east edge of the region to extract (deg).\")\n    (\"north,n\", po::value(&opt.north)->default_value(90), \"Specify north edge of the region to extract (deg).\")\n    (\"south,s\", po::value(&opt.south)->default_value(-90), \"Specify south edge of the region to extract (deg).\")\n    (\"tile-size-px,t\", po::value(&opt.tile_size)->default_value(4096), \"Specify the size of each output dem in pixels.\")\n    (\"tile-size-deg,d\", po::value(&opt.tile_size_deg), \"Specify the size of each output dem in degrees.\")\n    (\"tile-px-per-degree,p\", po::value(&opt.tile_ppd), \"Specify the output tiles' pixel per degrees.\")\n    (\"output-datum\", po::value(&opt.output_datum)->default_value(\"WGS84\"), \"Specify the output datum to use, [WGS84, WGS72, D_MOON, D_MARS]\")\n    (\"export-pds-dem\", \"Export using int16 channel value with a -32767 nodata value\")\n    (\"export-pds-imagery\", \"Export using uint8 channel value with a 0 nodata value\")\n    (\"help\", \"Display this help message\");\n\n  po::options_description positional(\"\");\n  positional.add_options()\n    (\"plate-file\", po::value(&opt.plate_file_name));\n\n  po::positional_options_description positional_desc;\n  positional_desc.add(\"plate-file\", 1);\n\n  po::options_description all_options;\n  all_options.add(general_options).add(positional);\n\n  po::variables_map vm;\n  try {\n    po::store( po::command_line_parser( argc, argv ).options(all_options).positional(positional_desc).run(), vm );\n    po::notify( vm );\n  } catch (po::error &e) {\n    vw_throw( ArgumentErr() << \"Error parsing input:\\n\\t\"\n              << e.what() << general_options );\n  }\n\n  std::ostringstream usage;\n  usage << \"Usage: \" << argv[0] << \" <platefile-url> <optional project settings> \\n\";\n\n  if ( vm.count(\"help\") )\n    vw_throw( ArgumentErr() << usage.str() << general_options );\n  if ( opt.plate_file_name.empty() )\n    vw_throw( ArgumentErr() << \"Missing input platefile!\\n\"\n              << usage.str() << general_options );\n\n  opt.pds_dem_mode = vm.count(\"export-pds-dem\");\n  opt.pds_imagery_mode = vm.count(\"export-pds-imagery\");\n\n  if( opt.output_prefix == \"\" ) {\n    opt.output_prefix = fs::path(opt.plate_file_name).stem();\n    int indx = opt.output_prefix.rfind(\"\/\");\n    if ( indx > 0 )\n      opt.output_prefix = opt.output_prefix.substr(indx+1);\n  }\n}\n\nint main( int argc, char *argv[] ) {\n\n  Options opt;\n  try {\n    handle_arguments( argc, argv, opt );\n\n    boost::shared_ptr<PlateFile> platefile(new PlateFile(opt.plate_file_name));\n\n    std::cout << \"Opened \" << opt.plate_file_name << \".     Depth: \"\n              << platefile->num_levels() << \" levels.\\n\";\n\n    PixelFormatEnum pixel_format = platefile->pixel_format();\n    ChannelTypeEnum channel_type = platefile->channel_type();\n\n    switch(pixel_format) {\n    case VW_PIXEL_GRAYA:\n      switch(channel_type) {\n      case VW_CHANNEL_UINT8:\n        do_tiles<PixelGrayA<uint8> >(platefile, opt);\n        break;\n      case VW_CHANNEL_INT16:\n        do_tiles<PixelGrayA<int16> >(platefile, opt);\n        break;\n      case VW_CHANNEL_FLOAT32:\n        do_tiles<PixelGrayA<float32> >(platefile, opt);\n        break;\n      default:\n        vw_throw(ArgumentErr() << \"Platefile contains a channel type not supported by image2plate.\\n\");\n      }\n      break;\n    case VW_PIXEL_RGB:\n    case VW_PIXEL_RGBA:\n    default:\n      switch(channel_type) {\n      case VW_CHANNEL_UINT8:\n        do_tiles<PixelRGBA<uint8> >(platefile, opt);\n        break;\n      default:\n        vw_throw(ArgumentErr() << \"Platefile contains a channel type not supported by image2plate.\\n\");\n      }\n      break;\n    }\n\n  } catch ( const ArgumentErr& e ) {\n    vw_out() << e.what() << std::endl;\n    return 1;\n  } catch ( const Exception& e ) {\n    std::cerr << \"VW Error: \" << e.what() << std::endl;\n    return 1;\n  } catch ( const std::bad_alloc& e ) {\n    std::cerr << \"Error: Ran out of Memory!\" << std::endl;\n    return 1;\n  } catch ( const std::exception& e ) {\n    std::cerr << \"Error: \" << e.what() <<  std::endl;\n    return 1;\n  }\n}\n<commit_msg>Added the ability to operate with a specific level of the platefile<commit_after>\/\/ __BEGIN_LICENSE__\n\/\/ Copyright (C) 2006-2010 United States Government as represented by\n\/\/ the Administrator of the National Aeronautics and Space Administration.\n\/\/ All Rights Reserved.\n\/\/ __END_LICENSE__\n\n\n\/\/\/ deplate.cc\n\/\/\/\n\/\/\/ Converts a plate file to GeoTIFF tiles on disk.\n\n#include <vw\/Image.h>\n#include <vw\/FileIO.h>\n#include <vw\/Plate\/PlateView.h>\n#include <vw\/Plate\/PlateCarreePlateManager.h>\n\nusing namespace vw;\nusing namespace vw::platefile;\n\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/program_options.hpp>\nnamespace po = boost::program_options;\nnamespace fs = boost::filesystem;\n\nstruct Options {\n  Options() : west(0), east(0), north(0), south(0), tile_size(0),\n              tile_size_deg(0), pds_dem_mode(false), pds_imagery_mode(false) {}\n\n  \/\/ Input for project file\n  std::string plate_file_name;\n\n  \/\/ Settings\n  int west, east, north, south, tile_size, tile_size_deg;\n  double tile_ppd;\n  bool pds_dem_mode, pds_imagery_mode;\n  int level;\n\n  \/\/ Output\n  std::string output_datum, output_prefix;\n};\n\n\/\/ ConvertToPDSImagery\n\/\/  .. coverts an image into the range of 1-254 where 0 is invalid and 255 is reserved.\ntemplate <class PixelT>\nclass ConvertToPDSImagery : public ReturnFixedType<typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type,uint8>::type> {\n  typedef typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type,uint8>::type return_type;\n  typedef typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type,double>::type return_double_type;\n  typedef typename CompoundChannelType<PixelT>::type input_channel_type;\npublic:\n  return_type operator()( PixelT value ) const {\n    if ( is_transparent(value) ) {\n      return return_type();\n    } else {\n      return_double_type result\n        = channel_cast<double>(non_alpha_channels(value))*253.0\/ChannelRange<input_channel_type>::max();\n      for ( uint8 i = 0; i < CompoundNumChannels<return_double_type>::value; i++ ) {\n        if (result[i] < 0)\n          result[i] = 0;\n        if (result[i] > 253)\n          result[i] = 253;\n      }\n      return channel_cast<uint8>(result)+1;\n    }\n  }\n};\n\ntemplate <class ImageT>\nUnaryPerPixelView<ImageT, ConvertToPDSImagery<typename ImageT::pixel_type> >\ninline convert_to_pds_imagery( ImageViewBase<ImageT> const& image ) {\n  typedef ConvertToPDSImagery<typename ImageT::pixel_type> func_type;\n  return UnaryPerPixelView<ImageT, func_type>( image.impl(), func_type() );\n}\n\ntemplate <class PixelT>\nvoid do_tiles(boost::shared_ptr<PlateFile> platefile, Options& opt) {\n\n  PlateCarreePlateManager<PixelT> pm(platefile);\n  cartography::GeoReference output_georef;\n  output_georef = pm.georeference(platefile->num_levels()-1);\n\n  cartography::Datum datum;\n  datum.set_well_known_datum( opt.output_datum );\n  output_georef.set_datum( datum );\n\n  PlateView<PixelT> plate_view(opt.plate_file_name);\n  if ( opt.level != -1 )\n    plate_view.set_level( opt.level );\n  ImageViewRef<PixelT> plate_view_ref = plate_view;\n  double scale_change = 1;\n  if ( opt.tile_ppd > 0 ) {\n    \/\/ Finding out our current PPD and attempting to match\n    double curr_ppd = norm_2(output_georef.lonlat_to_pixel(Vector2(0,0))-\n                             output_georef.lonlat_to_pixel(Vector2(1,0)));\n    scale_change = opt.tile_ppd \/ curr_ppd;\n    plate_view_ref = resample( plate_view, scale_change, scale_change,\n                               ZeroEdgeExtension());\n    Matrix3x3 scale;\n    scale.set_identity();\n    scale(0,0) \/= scale_change;\n    scale(1,1) \/= scale_change;\n    output_georef.set_transform( output_georef.transform()*scale );\n\n    \/\/ Double check\n    curr_ppd = norm_2(output_georef.lonlat_to_pixel(Vector2(0,0))-\n                      output_georef.lonlat_to_pixel(Vector2(1,0)));\n  }\n  std::cout << \"Converting \" << opt.plate_file_name << \" to \" << opt.output_prefix << \"\\n\";\n  std::cout << output_georef << \"\\n\";\n\n  \/\/ Get the output georeference.\n  vw::BBox2i output_bbox;\n  output_bbox.grow(output_georef.lonlat_to_pixel(Vector2(opt.west, opt.north)));\n  output_bbox.grow(output_georef.lonlat_to_pixel(Vector2(opt.east, opt.north)));\n  output_bbox.grow(output_georef.lonlat_to_pixel(Vector2(opt.west, opt.south)));\n  output_bbox.grow(output_georef.lonlat_to_pixel(Vector2(opt.east, opt.south)));\n  std::cout << \"\\t--> Output bbox: \" << output_bbox << \"\\n\";\n\n  if ( opt.tile_size_deg > 0 ) {\n    if ( opt.tile_ppd > 0 ) {\n      opt.tile_size = opt.tile_size_deg * opt.tile_ppd;\n    } else {\n      \/\/ User must have specified out to be sized in degrees\n      opt.tile_size = norm_2(output_georef.lonlat_to_pixel(Vector2(0,0)) -\n                             output_georef.lonlat_to_pixel(Vector2(opt.tile_size_deg,0)));\n    }\n  }\n\n  \/\/ Compute the bounding box for each tile.\n  std::vector<BBox2i> crop_bboxes = image_blocks(crop(plate_view_ref, output_bbox),\n                                                 opt.tile_size, opt.tile_size);\n\n  for (unsigned i = 0; i < crop_bboxes.size(); ++i) {\n    \/\/ The crop bboxes start at (0,0), and we want them to start at\n    \/\/ the upper left corner of the output_bbox.\n    crop_bboxes[i].min() += output_bbox.min();\n    crop_bboxes[i].max() += output_bbox.min();\n\n    { \/\/ Checking to see if this section is transparent\n      std::list<TileHeader> theaders =\n        plate_view.search_for_tiles( crop_bboxes[i] \/ scale_change );\n      if (theaders.empty())\n        continue;\n    }\n\n    cartography::GeoReference tile_georef = output_georef;\n    Vector2 top_left_ll = output_georef.pixel_to_lonlat(crop_bboxes[i].min());\n    Matrix3x3 T = tile_georef.transform();\n    T(0,2) = top_left_ll(0);\n    T(1,2) = top_left_ll(1);\n    tile_georef.set_transform(T);\n\n    std::cout << \"\\t--> Generating tile \" << (i+1) << \" \/ \" << crop_bboxes.size()\n              << \" : \" << crop_bboxes[i] << \"\\n\"\n              << \"\\t    with transform  \"\n              << tile_georef.transform() << \"\\n\";\n\n    std::ostringstream output_filename;\n    output_filename << opt.output_prefix << \"_\"\n                    << abs(round(top_left_ll[0]));\n    if ( top_left_ll[0] < 0 )\n      output_filename << \"W_\";\n    else\n      output_filename << \"E_\";\n    output_filename << abs(round(top_left_ll[1]));\n    if ( top_left_ll[1] >= 0 )\n      output_filename << \"N.tif\";\n    else\n      output_filename << \"S.tif\";\n\n    ImageView<PixelT> cropped_view = crop(plate_view_ref, crop_bboxes[i]);\n    DiskImageResourceGDAL::Options gdal_options;\n    gdal_options[\"COMPRESS\"] = \"LZW\";\n\n    if ( opt.pds_dem_mode ) {\n      ImageViewRef<typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type ,int16>::type > dem_image = apply_mask(alpha_to_mask(channel_cast<int16>(cropped_view)),-32767);\n      DiskImageResourceGDAL rsrc(output_filename.str(), dem_image.format(),\n                                 Vector2i(256,256), gdal_options);\n      write_georeference(rsrc, tile_georef);\n      write_image(rsrc, dem_image,\n                  TerminalProgressCallback( \"plate.tools\", \"\\t    Writing: \"));\n    } else if ( opt.pds_imagery_mode ) {\n      ImageViewRef<typename CompoundChannelCast<typename PixelWithoutAlpha<PixelT>::type ,uint8>::type > dem_image = convert_to_pds_imagery( cropped_view );\n      DiskImageResourceGDAL rsrc(output_filename.str(), dem_image.format(),\n                                 Vector2i(256,256), gdal_options);\n      write_georeference(rsrc, tile_georef);\n      write_image(rsrc, dem_image,\n                  TerminalProgressCallback( \"plate.tools\", \"\\t    Writing: \"));\n    } else {\n      DiskImageResourceGDAL rsrc(output_filename.str(), cropped_view.format(),\n                                 Vector2i(256,256), gdal_options);\n      write_georeference(rsrc, tile_georef);\n      write_image(rsrc, cropped_view,\n                  TerminalProgressCallback( \"plate.tools\", \"\\t    Writing: \"));\n    }\n\n  }\n}\n\nvoid handle_arguments( int argc, char *argv[], Options& opt ) {\n  po::options_description general_options(\"Chops platefile into georeferenced squares.\\n\\nGeneral Options\");\n  general_options.add_options()\n    (\"output-prefix,o\", po::value(&opt.output_prefix), \"Specify the base output directory\")\n    (\"level,l\", po::value(&opt.level)->default_value(-1), \"Level inside the plate in which to process. -1 will error out at show the number of levels available.\")\n    (\"west,w\", po::value(&opt.west)->default_value(-180), \"Specify west edge of the region to extract (deg).\")\n    (\"east,e\", po::value(&opt.east)->default_value(180), \"Specify east edge of the region to extract (deg).\")\n    (\"north,n\", po::value(&opt.north)->default_value(90), \"Specify north edge of the region to extract (deg).\")\n    (\"south,s\", po::value(&opt.south)->default_value(-90), \"Specify south edge of the region to extract (deg).\")\n    (\"tile-size-px,t\", po::value(&opt.tile_size)->default_value(4096), \"Specify the size of each output dem in pixels.\")\n    (\"tile-size-deg,d\", po::value(&opt.tile_size_deg), \"Specify the size of each output dem in degrees.\")\n    (\"tile-px-per-degree,p\", po::value(&opt.tile_ppd), \"Specify the output tiles' pixel per degrees.\")\n    (\"output-datum\", po::value(&opt.output_datum)->default_value(\"WGS84\"), \"Specify the output datum to use, [WGS84, WGS72, D_MOON, D_MARS]\")\n    (\"export-pds-dem\", \"Export using int16 channel value with a -32767 nodata value\")\n    (\"export-pds-imagery\", \"Export using uint8 channel value with a 0 nodata value\")\n    (\"help\", \"Display this help message\");\n\n  po::options_description positional(\"\");\n  positional.add_options()\n    (\"plate-file\", po::value(&opt.plate_file_name));\n\n  po::positional_options_description positional_desc;\n  positional_desc.add(\"plate-file\", 1);\n\n  po::options_description all_options;\n  all_options.add(general_options).add(positional);\n\n  po::variables_map vm;\n  try {\n    po::store( po::command_line_parser( argc, argv ).options(all_options).positional(positional_desc).run(), vm );\n    po::notify( vm );\n  } catch (po::error &e) {\n    vw_throw( ArgumentErr() << \"Error parsing input:\\n\\t\"\n              << e.what() << general_options );\n  }\n\n  std::ostringstream usage;\n  usage << \"Usage: \" << argv[0] << \" <platefile-url> <optional project settings> \\n\";\n\n  if ( vm.count(\"help\") )\n    vw_throw( ArgumentErr() << usage.str() << general_options );\n  if ( opt.plate_file_name.empty() )\n    vw_throw( ArgumentErr() << \"Missing input platefile!\\n\"\n              << usage.str() << general_options );\n\n  opt.pds_dem_mode = vm.count(\"export-pds-dem\");\n  opt.pds_imagery_mode = vm.count(\"export-pds-imagery\");\n\n  if( opt.output_prefix == \"\" ) {\n    opt.output_prefix = fs::path(opt.plate_file_name).stem();\n    int indx = opt.output_prefix.rfind(\"\/\");\n    if ( indx > 0 )\n      opt.output_prefix = opt.output_prefix.substr(indx+1);\n  }\n}\n\nint main( int argc, char *argv[] ) {\n\n  Options opt;\n  try {\n    handle_arguments( argc, argv, opt );\n\n    boost::shared_ptr<PlateFile> platefile(new PlateFile(opt.plate_file_name));\n\n    std::cout << \"Opened \" << opt.plate_file_name << \".     Depth: \"\n              << platefile->num_levels() << \" levels.\\n\";\n\n    PixelFormatEnum pixel_format = platefile->pixel_format();\n    ChannelTypeEnum channel_type = platefile->channel_type();\n\n    switch(pixel_format) {\n    case VW_PIXEL_GRAYA:\n      switch(channel_type) {\n      case VW_CHANNEL_UINT8:\n        do_tiles<PixelGrayA<uint8> >(platefile, opt);\n        break;\n      case VW_CHANNEL_INT16:\n        do_tiles<PixelGrayA<int16> >(platefile, opt);\n        break;\n      case VW_CHANNEL_FLOAT32:\n        do_tiles<PixelGrayA<float32> >(platefile, opt);\n        break;\n      default:\n        vw_throw(ArgumentErr() << \"Platefile contains a channel type not supported by image2plate.\\n\");\n      }\n      break;\n    case VW_PIXEL_RGB:\n    case VW_PIXEL_RGBA:\n    default:\n      switch(channel_type) {\n      case VW_CHANNEL_UINT8:\n        do_tiles<PixelRGBA<uint8> >(platefile, opt);\n        break;\n      default:\n        vw_throw(ArgumentErr() << \"Platefile contains a channel type not supported by image2plate.\\n\");\n      }\n      break;\n    }\n\n  } catch ( const ArgumentErr& e ) {\n    vw_out() << e.what() << std::endl;\n    return 1;\n  } catch ( const Exception& e ) {\n    std::cerr << \"VW Error: \" << e.what() << std::endl;\n    return 1;\n  } catch ( const std::bad_alloc& e ) {\n    std::cerr << \"Error: Ran out of Memory!\" << std::endl;\n    return 1;\n  } catch ( const std::exception& e ) {\n    std::cerr << \"Error: \" << e.what() <<  std::endl;\n    return 1;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * PokerTH - The open source texas holdem engine                             *\n * Copyright (C) 2006-2011 Felix Hammer, Florian Thauer, Lothar May          *\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 \"sdlplayer.h\"\n\n#if (defined __APPLE__)\n#include <SDL.h>\n#else\n#include <SDL\/SDL.h>\n#endif\n\nusing namespace std;\n\nSDLPlayer::SDLPlayer(ConfigFile *c)\n\t: soundData(NULL), currentChannel(0) , audioEnabled(0), myConfig(c)\n{\n\tSDL_Init(SDL_INIT_AUDIO);\n\tinitAudio();\n\n\tmyAppDataPath = QString::fromUtf8(myConfig->readConfigString(\"AppDataDir\").c_str());\n}\n\n\nSDLPlayer::~SDLPlayer()\n{\n\tcloseAudio();\n\tSDL_Quit();\n}\n\nvoid SDLPlayer::initAudio()\n{\n\n\tif (!audioEnabled && myConfig->readConfigInt(\"PlaySoundEffects\")) {\n\t\tint\t\taudio_rate = 44100;\n\t\tUint16\taudio_format = AUDIO_S16; \/* 16-bit stereo *\/\n\t\tint\t\taudio_channels = 2;\n\t\tint\t\taudio_buffers = 4096;\n\t\tsound = NULL;\n\n\t\tif(Mix_OpenAudio(audio_rate, audio_format, audio_channels, audio_buffers) == 0) {\n\t\t\tMix_QuerySpec(&audio_rate, &audio_format, &audio_channels);\n\t\t\taudioEnabled = 1;\n\t\t}\n\t}\n}\n\nvoid SDLPlayer::playSound(string audioString, int playerID)\n{\n\n\tif(audioEnabled && myConfig->readConfigInt(\"PlaySoundEffects\")) {\n\n\t\tQFile myFile(myAppDataPath + \"sounds\/default\/\" + QString::fromStdString(audioString)+\".wav\");\n\n\t\tif(myFile.open(QIODevice::ReadOnly)) {\n\n\t\t\t\/\/set 3d position for player\n\t\t\tint position = 0;\n\t\t\tint distance = 0;\n\n\t\t\tswitch (playerID) {\n\n\t\t\tcase 0: {\n\t\t\t\tposition = 180;\n\t\t\t\tdistance = 10;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 1: {\n\t\t\t\tposition = 281;\n\t\t\t\tdistance = 50;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 2: {\n\t\t\t\tposition = 315;\n\t\t\t\tdistance = 120;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 3: {\n\t\t\t\tposition = 338;\n\t\t\t\tdistance = 160;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 4: {\n\t\t\t\tposition = 23;\n\t\t\t\tdistance = 160;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 5: {\n\t\t\t\tposition = 45;\n\t\t\t\tdistance = 120;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 6: {\n\t\t\t\tposition = 79;\n\t\t\t\tdistance = 50;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tdefault: {\n\t\t\t\tposition = 0;\n\t\t\t\tdistance = 0;\n\t\t\t}\n\t\t\tbreak;\n\t\t\t}\n\n\t\t\taudioDone();\n\n\t\t\tQDataStream in(&myFile);\n\t\t\tsoundData = new Uint8[(int)myFile.size()];\n\t\t\tin.readRawData( (char*)soundData, (int)myFile.size() );\n\n\t\t\tsound = Mix_QuickLoad_WAV(soundData);\n\n\n\t\t\t\/\/ set channel 0 to settings volume\n\t\t\tMix_Volume(0,myConfig->readConfigInt(\"SoundVolume\")*10);\n\n\t\t\t\/\/ set 3d effect\n\t\t\tif(!Mix_SetPosition(0, position, distance)) {\n\t\t\t\tprintf(\"Mix_SetPosition: %s\\n\", Mix_GetError());\n\t\t\t\t\/\/ no position effect, is it ok?\n\t\t\t}\n\t\t\tcurrentChannel = Mix_PlayChannel(-1, sound,0);\n\t\t}\n\t\t\/\/ \telse cout << \"could not load \" << audioString << \".wav\" << endl;\n\n\t\t\/\/test\n\t\t\/\/\taudioDone();\n\t\t\/\/\tsound = Mix_LoadWAV( QString(QString::fromStdString(audioString)+QString(\".wav\")).toStdString().c_str() );\n\t\t\/\/\tcurrentChannel = Mix_PlayChannel(-1, sound,0);\n\n\t}\n}\n\nvoid SDLPlayer::audioDone()\n{\n\n\tif(audioEnabled) {\n\t\tMix_HaltChannel(currentChannel);\n\t\tMix_FreeChunk(sound);\n\t\tsound = NULL;\n\t\tdelete[] soundData;\n\t\tsoundData = NULL;\n\t}\n}\n\nvoid SDLPlayer::closeAudio()\n{\n\n\tif(audioEnabled) {\n\t\taudioDone();\n\t\tMix_CloseAudio();\n\t\taudioEnabled = false;\n\t}\n}\n<commit_msg>some audio system tweaks to fix stop playing longer tracks for a new one instead of overlaying<commit_after>\/*****************************************************************************\n * PokerTH - The open source texas holdem engine                             *\n * Copyright (C) 2006-2011 Felix Hammer, Florian Thauer, Lothar May          *\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 \"sdlplayer.h\"\n\n#if (defined __APPLE__)\n#include <SDL.h>\n#else\n#include <SDL\/SDL.h>\n#endif\n\nusing namespace std;\n\nSDLPlayer::SDLPlayer(ConfigFile *c)\n\t: soundData(NULL), currentChannel(0) , audioEnabled(0), myConfig(c)\n{\n\tSDL_Init(SDL_INIT_AUDIO);\n\tinitAudio();\n\n\tmyAppDataPath = QString::fromUtf8(myConfig->readConfigString(\"AppDataDir\").c_str());\n}\n\n\nSDLPlayer::~SDLPlayer()\n{\n\tcloseAudio();\n\tSDL_Quit();\n}\n\nvoid SDLPlayer::initAudio()\n{\n\n\tif (!audioEnabled && myConfig->readConfigInt(\"PlaySoundEffects\")) {\n\t\tint\t\taudio_rate = 44100;\n\t\tUint16\taudio_format = AUDIO_S16; \/* 16-bit stereo *\/\n\t\tint\t\taudio_channels = 2;\n\t\tint\t\taudio_buffers = 4096;\n\t\tsound = NULL;\n\n\t\tif(Mix_OpenAudio(audio_rate, audio_format, audio_channels, audio_buffers) == 0) {\n\t\t\tMix_QuerySpec(&audio_rate, &audio_format, &audio_channels);\n\t\t\taudioEnabled = 1;\n\t\t}\n\t}\n}\n\nvoid SDLPlayer::playSound(string audioString, int playerID)\n{\n\n\tif(audioEnabled && myConfig->readConfigInt(\"PlaySoundEffects\")) {\n\n\t\tQFile myFile(myAppDataPath + \"sounds\/default\/\" + QString::fromStdString(audioString)+\".wav\");\n\n\t\tif(myFile.open(QIODevice::ReadOnly)) {\n\n\t\t\t\/\/set 3d position for player\n\t\t\tint position = 0;\n\t\t\tint distance = 0;\n\n\t\t\tswitch (playerID) {\n\n\t\t\tcase 0: {\n\t\t\t\tposition = 180;\n\t\t\t\tdistance = 10;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 1: {\n\t\t\t\tposition = 281;\n\t\t\t\tdistance = 50;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 2: {\n\t\t\t\tposition = 315;\n\t\t\t\tdistance = 120;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 3: {\n\t\t\t\tposition = 338;\n\t\t\t\tdistance = 160;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 4: {\n\t\t\t\tposition = 23;\n\t\t\t\tdistance = 160;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 5: {\n\t\t\t\tposition = 45;\n\t\t\t\tdistance = 120;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase 6: {\n\t\t\t\tposition = 79;\n\t\t\t\tdistance = 50;\n\t\t\t}\n\t\t\tbreak;\n\t\t\tdefault: {\n\t\t\t\tposition = 0;\n\t\t\t\tdistance = 0;\n\t\t\t}\n\t\t\tbreak;\n\t\t\t}\n\n\/\/\t\t\taudioDone();\n\n\t\t\tQDataStream in(&myFile);\n\t\t\tsoundData = new Uint8[(int)myFile.size()];\n\t\t\tin.readRawData( (char*)soundData, (int)myFile.size() );\n\n\t\t\tsound = Mix_QuickLoad_WAV(soundData);\n\n\n\t\t\t\/\/ set channel 0 to settings volume\n\t\t\tMix_Volume(0,myConfig->readConfigInt(\"SoundVolume\")*10);\n\n\t\t\t\/\/ set 3d effect\n\t\t\tif(!Mix_SetPosition(0, position, distance)) {\n\t\t\t\tprintf(\"Mix_SetPosition: %s\\n\", Mix_GetError());\n\t\t\t\t\/\/ no position effect, is it ok?\n\t\t\t}\n\t\t\tcurrentChannel = Mix_PlayChannel(-1, sound,0);\n\t\t}\n\t\t\/\/ \telse cout << \"could not load \" << audioString << \".wav\" << endl;\n\n\t\t\/\/test\n\t\t\/\/\taudioDone();\n\t\t\/\/\tsound = Mix_LoadWAV( QString(QString::fromStdString(audioString)+QString(\".wav\")).toStdString().c_str() );\n\t\t\/\/\tcurrentChannel = Mix_PlayChannel(-1, sound,0);\n\n\t}\n}\n\nvoid SDLPlayer::audioDone()\n{\n\n\tif(audioEnabled) {\n\t\tMix_HaltChannel(currentChannel);\n\t\tMix_FreeChunk(sound);\n\t\tsound = NULL;\n\t\tdelete[] soundData;\n\t\tsoundData = NULL;\n\t}\n}\n\nvoid SDLPlayer::closeAudio()\n{\n\n\tif(audioEnabled) {\n\t\taudioDone();\n\t\tMix_CloseAudio();\n\t\taudioEnabled = false;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/  (C) Copyright Gennadiy Rozental 2005-2008.\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 : contains XML Log formatter definition\n\/\/ ***************************************************************************\n\n#ifndef BOOST_TEST_XML_LOG_FORMATTER_020105GER\n#define BOOST_TEST_XML_LOG_FORMATTER_020105GER\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/global_typedef.hpp>\n#include <boost\/test\/unit_test_log_formatter.hpp>\n\n\/\/ STL\n#include <cstddef> \/\/ std::size_t\n\n#include <boost\/test\/detail\/suppress_warnings.hpp>\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\n\nnamespace unit_test {\n\nnamespace output {\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************               xml_log_formatter              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass xml_log_formatter : public unit_test_log_formatter {\npublic:\n    \/\/ Formatter interface\n    void    log_start( std::ostream&, counter_t test_cases_amount );\n    void    log_finish( std::ostream& );\n    void    log_build_info( std::ostream& );\n\n    void    test_unit_start( std::ostream&, test_unit const& tu );\n    void    test_unit_finish( std::ostream&, test_unit const& tu, unsigned long elapsed );\n    void    test_unit_skipped( std::ostream&, test_unit const& tu );\n\n    void    log_exception( std::ostream&, log_checkpoint_data const&, const_string explanation );\n\n    void    log_entry_start( std::ostream&, log_entry_data const&, log_entry_types let );\n    void    log_entry_value( std::ostream&, const_string value );\n    void    log_entry_finish( std::ostream& );\n\nprivate:\n    \/\/ Data members\n    const_string    m_curr_tag;\n};\n\n} \/\/ namespace output\n\n} \/\/ namespace unit_test\n\n} \/\/ namespace boost\n\n\/\/____________________________________________________________________________\/\/\n\n#include <boost\/test\/detail\/enable_warnings.hpp>\n\n#endif \/\/ BOOST_TEST_XML_LOG_FORMATTER_020105GER\n<commit_msg>bring the base class function into the overload set<commit_after>\/\/  (C) Copyright Gennadiy Rozental 2005-2008.\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 : contains XML Log formatter definition\n\/\/ ***************************************************************************\n\n#ifndef BOOST_TEST_XML_LOG_FORMATTER_020105GER\n#define BOOST_TEST_XML_LOG_FORMATTER_020105GER\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/global_typedef.hpp>\n#include <boost\/test\/unit_test_log_formatter.hpp>\n\n\/\/ STL\n#include <cstddef> \/\/ std::size_t\n\n#include <boost\/test\/detail\/suppress_warnings.hpp>\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\n\nnamespace unit_test {\n\nnamespace output {\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************               xml_log_formatter              ************** \/\/\n\/\/ ************************************************************************** \/\/\n\nclass xml_log_formatter : public unit_test_log_formatter {\npublic:\n    \/\/ Formatter interface\n    void    log_start( std::ostream&, counter_t test_cases_amount );\n    void    log_finish( std::ostream& );\n    void    log_build_info( std::ostream& );\n\n    void    test_unit_start( std::ostream&, test_unit const& tu );\n    void    test_unit_finish( std::ostream&, test_unit const& tu, unsigned long elapsed );\n    void    test_unit_skipped( std::ostream&, test_unit const& tu );\n\n    void    log_exception( std::ostream&, log_checkpoint_data const&, const_string explanation );\n\n    void    log_entry_start( std::ostream&, log_entry_data const&, log_entry_types let );\n    using   unit_test_log_formatter::log_entry_value; \/\/ bring base class functions into overload set\n    void    log_entry_value( std::ostream&, const_string value );\n    void    log_entry_finish( std::ostream& );\n\nprivate:\n    \/\/ Data members\n    const_string    m_curr_tag;\n};\n\n} \/\/ namespace output\n\n} \/\/ namespace unit_test\n\n} \/\/ namespace boost\n\n\/\/____________________________________________________________________________\/\/\n\n#include <boost\/test\/detail\/enable_warnings.hpp>\n\n#endif \/\/ BOOST_TEST_XML_LOG_FORMATTER_020105GER\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#ifndef OPENGM_GRIDSEARCH_LEARNER_HXX\n#define OPENGM_GRIDSEARCH_LEARNER_HXX\n\n#include <vector>\n\nnamespace opengm {\n   namespace learning {\n\n      template<class DATASET>\n      class GridSearchLearner\n      {\n      public: \n         typedef DATASET DatasetType;\n         typedef typename DATASET::GMType   GMType; \n         typedef typename DATASET::LossType LossType;\n         typedef typename GMType::ValueType ValueType;\n         typedef typename GMType::IndexType IndexType;\n         typedef typename GMType::LabelType LabelType; \n\n         class Parameter{\n         public:\n            std::vector<double> parameterUpperbound_; \n            std::vector<double> parameterLowerbound_;\n            std::vector<size_t> testingPoints_;\n            Parameter(){;}\n         };\n\n\n         GridSearchLearner(DATASET&, const Parameter& );\n\n         template<class INF>\n         void learn(const typename INF::Parameter& para); \n         \/\/template<class INF, class VISITOR>\n         \/\/void learn(typename INF::Parameter para, VITITOR vis);\n\n         const opengm::learning::Weights<double>& getWeights(){return weights_;}\n         Parameter& getLerningParameters(){return para_;}\n\n      private:\n         DATASET& dataset_;\n         opengm::learning::Weights<double> weights_;\n         Parameter para_;\n      }; \n\n      template<class DATASET>\n      GridSearchLearner<DATASET>::GridSearchLearner(DATASET& ds, const Parameter& p )\n         : dataset_(ds), para_(p)\n      {\n         weights_ = opengm::learning::Weights<double>(ds.getNumberOfWeights());\n         if(para_.parameterUpperbound_.size() != ds.getNumberOfWeights())\n            para_.parameterUpperbound_.resize(ds.getNumberOfWeights(),10.0);\n         if(para_.parameterLowerbound_.size() != ds.getNumberOfWeights())\n            para_.parameterLowerbound_.resize(ds.getNumberOfWeights(),0.0);\n         if(para_.testingPoints_.size() != ds.getNumberOfWeights())\n            para_.testingPoints_.resize(ds.getNumberOfWeights(),10);\n      }\n\n\n      template<class DATASET>\n      template<class INF>\n      void GridSearchLearner<DATASET>::learn(const typename INF::Parameter& para){\n         \/\/ generate model Parameters\n         opengm::learning::Weights<double> modelPara( dataset_.getNumberOfWeights() );\n         opengm::learning::Weights<double> bestModelPara( dataset_.getNumberOfWeights() );\n         double                            bestLoss = 100000000.0; \n         std::vector<size_t> itC(dataset_.getNumberOfWeights(),0);\n\n         LossType lossFunction;\n         bool search=true;\n         while(search){\n            \/\/ Get Parameter\n            for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n               modelPara.setWeight(p, para_.parameterLowerbound_[p] + double(itC[p])\/double(para_.testingPoints_[p]-1)*(para_.parameterUpperbound_[p]-para_.parameterLowerbound_[p]) );\n            }\n            \/\/ Evaluate Loss\n            opengm::learning::Weights<double>& mp =  dataset_.getWeights();\n            mp = modelPara;\n            std::vector< std::vector<typename INF::LabelType> > confs( dataset_.getNumberOfModels() );\n            double loss = 0;\n            for(size_t m=0; m<dataset_.getNumberOfModels(); ++m){\n               INF inf( dataset_.getModel(m),para);\n               inf.infer();\n               inf.arg(confs[m]);\n               const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n               loss += lossFunction.loss(dataset_.getModel(m),confs[m].begin(), confs[m].end(), gt.begin(), gt.end());\n            }\n            \n           \n\n            \/\/ **************\n\n            if(loss<bestLoss){\n\n                 \/\/ *call visitor*\n                for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n                   std::cout << modelPara[p] <<\" \";\n                }\n                std::cout << \" ==> \";\n                std::cout << loss << std::endl;\n\n                bestLoss=loss;\n                bestModelPara=modelPara;\n                if(loss<=0.000000001){\n                    search = false;\n                }\n            }\n            \/\/Increment Parameter\n            for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n               if(itC[p]<para_.testingPoints_[p]-1){\n                  ++itC[p];\n                  break;\n               }\n               else{\n                  itC[p]=0;\n                  if (p==dataset_.getNumberOfWeights()-1)\n                     search = false; \n               }             \n            }\n\n         }\n         std::cout << \"Best\"<<std::endl;\n         for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n            std::cout << bestModelPara[p] <<\" \";\n         }\n         std::cout << \" ==> \";\n         std::cout << bestLoss << std::endl;\n         weights_ = bestModelPara;\n\n         \/\/ save best weights in dataset\n         for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n            dataset_.getWeights().setWeight(p, weights_[p]);\n         }\n      };\n   }\n}\n#endif\n<commit_msg>fixed bug in gridesearchlearning<commit_after>#pragma once\n#ifndef OPENGM_GRIDSEARCH_LEARNER_HXX\n#define OPENGM_GRIDSEARCH_LEARNER_HXX\n\n#include <vector>\n\nnamespace opengm {\n   namespace learning {\n\n      \n      template<class DATASET>\n      class GridSearchLearner\n      {\n      public: \n         typedef DATASET DatasetType;\n         typedef typename DATASET::GMType   GMType; \n         typedef typename DATASET::LossType LossType;\n         typedef typename GMType::ValueType ValueType;\n         typedef typename GMType::IndexType IndexType;\n         typedef typename GMType::LabelType LabelType; \n\n         class Parameter{\n         public:\n            std::vector<double> parameterUpperbound_; \n            std::vector<double> parameterLowerbound_;\n            std::vector<size_t> testingPoints_;\n            Parameter(){;}\n         };\n\n\n         GridSearchLearner(DATASET&, const Parameter& );\n\n         template<class INF>\n         void learn(const typename INF::Parameter& para); \n         \/\/template<class INF, class VISITOR>\n         \/\/void learn(typename INF::Parameter para, VITITOR vis);\n\n         const opengm::learning::Weights<double>& getWeights(){return weights_;}\n         Parameter& getLerningParameters(){return para_;}\n\n      private:\n         DATASET& dataset_;\n         opengm::learning::Weights<double> weights_;\n         Parameter para_;\n      }; \n\n      template<class DATASET>\n      GridSearchLearner<DATASET>::GridSearchLearner(DATASET& ds, const Parameter& p )\n         : dataset_(ds), para_(p)\n      {\n         weights_ = opengm::learning::Weights<double>(ds.getNumberOfWeights());\n         if(para_.parameterUpperbound_.size() != ds.getNumberOfWeights())\n            para_.parameterUpperbound_.resize(ds.getNumberOfWeights(),10.0);\n         if(para_.parameterLowerbound_.size() != ds.getNumberOfWeights())\n            para_.parameterLowerbound_.resize(ds.getNumberOfWeights(),0.0);\n         if(para_.testingPoints_.size() != ds.getNumberOfWeights())\n            para_.testingPoints_.resize(ds.getNumberOfWeights(),10);\n      }\n\n\n      template<class DATASET>\n      template<class INF>\n      void GridSearchLearner<DATASET>::learn(const typename INF::Parameter& para){\n         \/\/ generate model Parameters\n         opengm::learning::Weights<double> modelPara( dataset_.getNumberOfWeights() );\n         opengm::learning::Weights<double> bestModelPara( dataset_.getNumberOfWeights() );\n         double bestLoss = std::numeric_limits<double>::infinity();\n         std::vector<size_t> itC(dataset_.getNumberOfWeights(),0);\n         \n         bool search=true;\n         while(search){\n            \/\/ Get Parameter\n            for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n               modelPara.setWeight(p, para_.parameterLowerbound_[p] + double(itC[p])\/double(para_.testingPoints_[p]-1)*(para_.parameterUpperbound_[p]-para_.parameterLowerbound_[p]) );\n            }\n            \/\/ Evaluate Loss\n            opengm::learning::Weights<double>& mp =  dataset_.getWeights();\n            mp = modelPara;\n            const double loss = dataset_. template getTotalLoss<INF>(para);\n           \n\n            \/\/ **************\n\n            if(loss<bestLoss){\n                 \/\/ *call visitor*\n                for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n                   std::cout << modelPara[p] <<\" \";\n                }\n                std::cout << \" ==> \";\n                std::cout << loss << std::endl;\n\n                bestLoss=loss;\n                bestModelPara=modelPara;\n                if(loss<=0.000000001){\n                    search = false;\n                }\n            }\n            \/\/Increment Parameter\n            for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n               if(itC[p]<para_.testingPoints_[p]-1){\n                  ++itC[p];\n                  break;\n               }\n               else{\n                  itC[p]=0;\n                  if (p==dataset_.getNumberOfWeights()-1)\n                     search = false; \n               }             \n            }\n         }\n         std::cout << \"Best\"<<std::endl;\n         for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n            std::cout << bestModelPara[p] <<\" \";\n         }\n         std::cout << \" ==> \";\n         std::cout << bestLoss << std::endl;\n         weights_ = bestModelPara;\n\n         \/\/ save best weights in dataset\n         for(size_t p=0; p<dataset_.getNumberOfWeights(); ++p){\n            dataset_.getWeights().setWeight(p, weights_[p]);\n         }\n      };\n   }\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014, University of Freiburg,\n\/\/ Chair of Algorithms and Data Structures.\n\/\/ Author: Björn Buchhold (buchhold@informatik.uni-freiburg.de)\n\n#include <getopt.h>\n#include <cstdlib>\n#include <cstdio>\n#include <string>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n\n#include \"..\/util\/File.h\"\n#include \"..\/global\/Constants.h\"\n#include \"..\/util\/ReadableNumberFact.h\"\n#include \".\/Index.h\"\n\n\nusing std::string;\nusing std::cout;\nusing std::endl;\nusing std::flush;\nusing std::cerr;\n\n#define EMPH_ON  \"\\033[1m\"\n#define EMPH_OFF \"\\033[21m\"\n\n\/\/ Available options.\nstruct option options[] = {\n    {\"tsv-file\",          required_argument, NULL, 't'},\n    {\"ntriples-file\",     required_argument, NULL, 'n'},\n    {\"index-basename\",    required_argument, NULL, 'i'},\n    {\"words-by-contexts\", required_argument, NULL, 'w'},\n    {\"docs-by-contexts\",  required_argument, NULL, 'd'},\n    {\"all-permutations\",  no_argument,       NULL, 'a'},\n    {\"on-disk-literals\",  no_argument,       NULL, 'l'},\n    {NULL, 0,                                NULL, 0}\n};\n\nstring getStxxlDiskFileName(const string& location, const string& tail) {\n  std::ostringstream os;\n  os << location << tail << \"-stxxl.disk\";\n  return os.str();\n}\n\n\/\/ Write a .stxxl config-file.\n\/\/ All we want is sufficient space somewhere with enough space.\n\/\/ We can use the location of input files and use a constant size for now.\n\/\/ The required size can only ben estimation anyway, since index size\n\/\/ depends on the structure of words files rather than their size only,\n\/\/ because of the \"multiplications\" performed.\nvoid writeStxxlConfigFile(const string& location, const string& tail) {\n  ad_utility::File stxxlConfig(\".stxxl\", \"w\");\n  std::ostringstream config;\n  config << \"disk=\" << getStxxlDiskFileName(location, tail) << \",\"\n         << STXXL_DISK_SIZE_INDEX_BUILDER << \",syscall\";\n  stxxlConfig.writeLine(config.str());\n}\n\n\/\/ Main function.\nint main(int argc, char** argv) {\n  std::cout << std::endl << EMPH_ON\n            << \"IndexBuilderMain, version \" << __DATE__\n            << \" \" << __TIME__ << EMPH_OFF << std::endl << std::endl;\n\n  char* locale = setlocale(LC_CTYPE, \"en_US.utf8\");\n  cout << \"Set locale LC_CTYPE to: \" << locale << endl;\n\n  std::locale loc;\n  ad_utility::ReadableNumberFacet facet(1);\n  std::locale locWithNumberGrouping(loc, &facet);\n  ad_utility::Log::imbue(locWithNumberGrouping);\n\n  string tsvFile;\n  string ntFile;\n  string baseName;\n  string wordsfile;\n  string docsfile;\n  bool allPermutations = false;\n  bool onDiskLiterals = false;\n  optind = 1;\n  \/\/ Process command line arguments.\n  while (true) {\n    int c = getopt_long(argc, argv, \"t:n:i:w:d:al\", options, NULL);\n    if (c == -1) { break; }\n    switch (c) {\n      case 't':\n        tsvFile = optarg;\n        break;\n      case 'n':\n        ntFile = optarg;\n        break;\n      case 'i':\n        baseName = optarg;\n        break;\n      case 'w':\n        wordsfile = optarg;\n        break;\n      case 'd':\n        docsfile = optarg;\n        break;\n      case 'a':\n        allPermutations = true;\n        break;\n      case 'l':\n        onDiskLiterals = true;\n        break;\n      default:\n        cout << endl\n             << \"! ERROR in processing options (getopt returned '\" << c\n             << \"' = 0x\" << std::setbase(16) << c << \")\"\n             << endl << endl;\n        exit(1);\n    }\n  }\n\n  if (baseName.size() == 0) {\n    cout << \"Missing required argument --index-basename (-i)...\" << endl;\n    exit(1);\n  }\n\n  if (tsvFile.size() == 0 && ntFile.size() == 0 && wordsfile.size() == 0) {\n    cout << \"Missing required argument --tsv-file (-t) or \"\n        \"--ntriples-file (-n) or --words-by-contexts (-w) ...\" << endl;\n    exit(1);\n  }\n\n  LOG(DEBUG) << \"Configuring STXXL...\" << std::endl;\n  string stxxlFileName;\n  size_t posOfLastSlash = baseName.rfind('\/');\n  string location = baseName.substr(0, posOfLastSlash + 1);\n  string tail = baseName.substr(posOfLastSlash + 1);\n  writeStxxlConfigFile(location, tail);\n  stxxlFileName = getStxxlDiskFileName(location, tail);\n  LOG(DEBUG) << \"done.\" << std::endl;\n\n  try {\n    Index index;\n    if (ntFile.size() > 0) {\n      index.createFromNTriplesFile(ntFile, baseName, allPermutations,\n                                   onDiskLiterals);\n    } else if (tsvFile.size() > 0) {\n      index.createFromTsvFile(tsvFile, baseName, allPermutations,\n                              onDiskLiterals);\n    } else {\n      index.createFromOnDiskIndex(baseName, onDiskLiterals);\n    }\n\n    if (wordsfile.size() > 0) {\n      index.addTextFromContextFile(wordsfile);\n    }\n\n    if (docsfile.size() > 0) {\n      index.buildDocsDB(docsfile);\n    }\n  } catch (ad_semsearch::Exception& e) {\n    LOG(ERROR) << e.getFullErrorMessage() << std::endl;\n  }\n  std::remove(stxxlFileName.c_str());\n  return 0;\n}\n<commit_msg>Fixed a bug in the IndexBuilderMain when adding text to prebuild kb index<commit_after>\/\/ Copyright 2014, University of Freiburg,\n\/\/ Chair of Algorithms and Data Structures.\n\/\/ Author: Björn Buchhold (buchhold@informatik.uni-freiburg.de)\n\n#include <getopt.h>\n#include <cstdlib>\n#include <cstdio>\n#include <string>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n\n#include \"..\/util\/File.h\"\n#include \"..\/global\/Constants.h\"\n#include \"..\/util\/ReadableNumberFact.h\"\n#include \".\/Index.h\"\n\n\nusing std::string;\nusing std::cout;\nusing std::endl;\nusing std::flush;\nusing std::cerr;\n\n#define EMPH_ON  \"\\033[1m\"\n#define EMPH_OFF \"\\033[21m\"\n\n\/\/ Available options.\nstruct option options[] = {\n    {\"tsv-file\",          required_argument, NULL, 't'},\n    {\"ntriples-file\",     required_argument, NULL, 'n'},\n    {\"index-basename\",    required_argument, NULL, 'i'},\n    {\"words-by-contexts\", required_argument, NULL, 'w'},\n    {\"docs-by-contexts\",  required_argument, NULL, 'd'},\n    {\"all-permutations\",  no_argument,       NULL, 'a'},\n    {\"on-disk-literals\",  no_argument,       NULL, 'l'},\n    {NULL, 0,                                NULL, 0}\n};\n\nstring getStxxlDiskFileName(const string& location, const string& tail) {\n  std::ostringstream os;\n  os << location << tail << \"-stxxl.disk\";\n  return os.str();\n}\n\n\/\/ Write a .stxxl config-file.\n\/\/ All we want is sufficient space somewhere with enough space.\n\/\/ We can use the location of input files and use a constant size for now.\n\/\/ The required size can only ben estimation anyway, since index size\n\/\/ depends on the structure of words files rather than their size only,\n\/\/ because of the \"multiplications\" performed.\nvoid writeStxxlConfigFile(const string& location, const string& tail) {\n  ad_utility::File stxxlConfig(\".stxxl\", \"w\");\n  std::ostringstream config;\n  config << \"disk=\" << getStxxlDiskFileName(location, tail) << \",\"\n         << STXXL_DISK_SIZE_INDEX_BUILDER << \",syscall\";\n  stxxlConfig.writeLine(config.str());\n}\n\n\/\/ Main function.\nint main(int argc, char** argv) {\n  std::cout << std::endl << EMPH_ON\n            << \"IndexBuilderMain, version \" << __DATE__\n            << \" \" << __TIME__ << EMPH_OFF << std::endl << std::endl;\n\n  char* locale = setlocale(LC_CTYPE, \"en_US.utf8\");\n  cout << \"Set locale LC_CTYPE to: \" << locale << endl;\n\n  std::locale loc;\n  ad_utility::ReadableNumberFacet facet(1);\n  std::locale locWithNumberGrouping(loc, &facet);\n  ad_utility::Log::imbue(locWithNumberGrouping);\n\n  string tsvFile;\n  string ntFile;\n  string baseName;\n  string wordsfile;\n  string docsfile;\n  bool allPermutations = false;\n  bool onDiskLiterals = false;\n  optind = 1;\n  \/\/ Process command line arguments.\n  while (true) {\n    int c = getopt_long(argc, argv, \"t:n:i:w:d:al\", options, NULL);\n    if (c == -1) { break; }\n    switch (c) {\n      case 't':\n        tsvFile = optarg;\n        break;\n      case 'n':\n        ntFile = optarg;\n        break;\n      case 'i':\n        baseName = optarg;\n        break;\n      case 'w':\n        wordsfile = optarg;\n        break;\n      case 'd':\n        docsfile = optarg;\n        break;\n      case 'a':\n        allPermutations = true;\n        break;\n      case 'l':\n        onDiskLiterals = true;\n        break;\n      default:\n        cout << endl\n             << \"! ERROR in processing options (getopt returned '\" << c\n             << \"' = 0x\" << std::setbase(16) << c << \")\"\n             << endl << endl;\n        exit(1);\n    }\n  }\n\n  if (baseName.size() == 0) {\n    cout << \"Missing required argument --index-basename (-i)...\" << endl;\n    exit(1);\n  }\n\n  if (tsvFile.size() == 0 && ntFile.size() == 0 && wordsfile.size() == 0) {\n    cout << \"Missing required argument --tsv-file (-t) or \"\n        \"--ntriples-file (-n) or --words-by-contexts (-w) ...\" << endl;\n    exit(1);\n  }\n\n  LOG(DEBUG) << \"Configuring STXXL...\" << std::endl;\n  string stxxlFileName;\n  size_t posOfLastSlash = baseName.rfind('\/');\n  string location = baseName.substr(0, posOfLastSlash + 1);\n  string tail = baseName.substr(posOfLastSlash + 1);\n  writeStxxlConfigFile(location, tail);\n  stxxlFileName = getStxxlDiskFileName(location, tail);\n  LOG(DEBUG) << \"done.\" << std::endl;\n\n  try {\n    Index index;\n    if (ntFile.size() > 0) {\n      index.createFromNTriplesFile(ntFile, baseName, allPermutations,\n                                   onDiskLiterals);\n    } else if (tsvFile.size() > 0) {\n      index.createFromTsvFile(tsvFile, baseName, allPermutations,\n                              onDiskLiterals);\n    } else {\n      index.createFromOnDiskIndex(baseName, allPermutations, onDiskLiterals);\n    }\n\n    if (wordsfile.size() > 0) {\n      index.addTextFromContextFile(wordsfile);\n    }\n\n    if (docsfile.size() > 0) {\n      index.buildDocsDB(docsfile);\n    }\n  } catch (ad_semsearch::Exception& e) {\n    LOG(ERROR) << e.getFullErrorMessage() << std::endl;\n  }\n  std::remove(stxxlFileName.c_str());\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef TWISTEDCPP_BASIC_PROTOCOL\n#define TWISTEDCPP_BASIC_PROTOCOL\n\nnamespace twisted {\n\ntemplate<typename ChildProtocol>\nclass basic_protocol : public std::enable_shared_from_this<ChildProtocol> {\npublic:\n    typedef boost::asio::ip::tcp::socket socket_type;\n    typedef boost::asio::steady_timer timer_type;\n    typedef boost::asio::io_service::strand strand_type;\n    typedef std::vector<char> buffer_type;\n    typedef buffer_type::iterator buffer_iterator;\n    typedef buffer_type::const_iterator const_buffer_iterator;\n\n    basic_protocol()\n        : _read_buffer(1024),\n            _read_index(_read_buffer.begin()) {}\n\n    void set_socket(socket_type socket) {\n        _socket.reset(new socket_type(std::move(socket)));\n        _strand = boost::in_place(boost::ref(_socket->get_io_service()));\n        _timer =  boost::in_place(boost::ref(_socket->get_io_service()));\n    }\n\n    void run_protocol() {\n        auto self = this_protocol().shared_from_this();\n        boost::asio::spawn(*_strand, [this, self] (boost::asio::yield_context yield) {\n            _yield = boost::in_place(yield);\n\n            try {\n                for(;_socket->is_open();) {\n                    expand_buffer();\n                    auto bytes_read = _socket->async_read_some(read_buffer(), yield);\n                    checked_on_message(_read_index, std::next(_read_index, bytes_read));\n                }\n            } catch(boost::system::system_error& connection_error) { \/\/ network errors\n                print_connection_error(connection_error);\n                this_protocol().on_disconnect();\n            } catch(const std::exception& excep) { \/\/ errors from user protocols\n                print_exception_what(excep);\n            }\n        });\n    }\n\n    boost::asio::mutable_buffers_1 read_buffer() {\n        return boost::asio::buffer(&*_read_index, std::distance(_read_index, _read_buffer.end()));\n    }\n\n    template<typename Iter>\n    void send_message(Iter begin, Iter end) {\n        boost::asio::async_write(\n            *_socket,\n            boost::asio::buffer(&*begin, std::distance(begin, end)),\n            *_yield);\n    }\n\n    template<typename BuffersType>\n    void send_buffers(const BuffersType& buffers) {\n        boost::asio::async_write(\n            *_socket,\n            buffers,\n            *_yield);\n    }\n\n    void on_disconnect() {}\n\n    void on_error(std::exception_ptr eptr) {\n        std::rethrow_exception(eptr);\n    }\n\n    void lose_connection() {\n        _socket->close();\n        std::cout << \"Closing connection to client\" << std::endl;\n    }\n\nprivate:\n    void print_connection_error(const boost::system::system_error& connection_error) const {\n        std::cerr << \"Client disconnected with code \"\n                  << connection_error.what()\n                  << std::endl;\n    }\n\n    void print_exception_what(const std::exception& excep) {\n        std::cerr << \"Killing connection, exception in client handler: \"\n                  << excep.what()\n                  << std::endl;\n    }\n\n    void expand_buffer() {\n        auto range = std::distance(_read_buffer.begin(), _read_index);\n        if(range < 1024) {\n            _read_buffer.resize(_read_buffer.size() * 2);\n            _read_index = std::next(_read_buffer.begin(), range);\n        }\n    }\n\n    template<typename Iter>\n    void checked_on_message(Iter begin, Iter end) {\n        try {\n            this_protocol().on_message(begin, end);\n        } catch (...) {\n            this_protocol().on_error(std::current_exception());\n        }\n    }\n\nprotected:\n    \/*\n     * @brief CRTP wrapper for derived class access\n     *\/\n    ChildProtocol& this_protocol() {\n        return *static_cast<ChildProtocol*>(this);\n    }\n\n    \/*\n     * @brief CRTP wrapper for derived class access\n     *\/\n    const ChildProtocol& this_protocol() const {\n        return *static_cast<ChildProtocol*>(this);\n    }\n\n    buffer_type _read_buffer;\n    buffer_iterator _read_index;\nprivate:\n    boost::optional<boost::asio::yield_context> _yield;\n    std::unique_ptr<socket_type> _socket; \/\/ unique_ptr as boost::optional has no move support\n    boost::optional<timer_type> _timer;\n    boost::optional<strand_type> _strand;\n};\n\n}\n\n\n#endif\n<commit_msg>added missing includes to basic_protocol<commit_after>#ifndef TWISTEDCPP_BASIC_PROTOCOL\n#define TWISTEDCPP_BASIC_PROTOCOL\n\n#include <boost\/asio\/ip\/tcp.hpp>\n#include <boost\/asio\/steady_timer.hpp>\n#include <boost\/optional.hpp>\n#include <boost\/asio\/spawn.hpp>\n#include <boost\/asio\/write.hpp>\n\nnamespace twisted {\n\ntemplate<typename ChildProtocol>\nclass basic_protocol : public std::enable_shared_from_this<ChildProtocol> {\npublic:\n    typedef boost::asio::ip::tcp::socket socket_type;\n    typedef boost::asio::steady_timer timer_type;\n    typedef boost::asio::io_service::strand strand_type;\n    typedef std::vector<char> buffer_type;\n    typedef buffer_type::iterator buffer_iterator;\n    typedef buffer_type::const_iterator const_buffer_iterator;\n\n    basic_protocol()\n        : _read_buffer(1024),\n            _read_index(_read_buffer.begin()) {}\n\n    void set_socket(socket_type socket) {\n        _socket.reset(new socket_type(std::move(socket)));\n        _strand = boost::in_place(boost::ref(_socket->get_io_service()));\n        _timer =  boost::in_place(boost::ref(_socket->get_io_service()));\n    }\n\n    void run_protocol() {\n        auto self = this_protocol().shared_from_this();\n        boost::asio::spawn(*_strand, [this, self] (boost::asio::yield_context yield) {\n            _yield = boost::in_place(yield);\n\n            try {\n                for(;_socket->is_open();) {\n                    expand_buffer();\n                    auto bytes_read = _socket->async_read_some(read_buffer(), yield);\n                    checked_on_message(_read_index, std::next(_read_index, bytes_read));\n                }\n            } catch(boost::system::system_error& connection_error) { \/\/ network errors\n                print_connection_error(connection_error);\n                this_protocol().on_disconnect();\n            } catch(const std::exception& excep) { \/\/ errors from user protocols\n                print_exception_what(excep);\n            }\n        });\n    }\n\n    boost::asio::mutable_buffers_1 read_buffer() {\n        return boost::asio::buffer(&*_read_index, std::distance(_read_index, _read_buffer.end()));\n    }\n\n    template<typename Iter>\n    void send_message(Iter begin, Iter end) {\n        boost::asio::async_write(\n            *_socket,\n            boost::asio::buffer(&*begin, std::distance(begin, end)),\n            *_yield);\n    }\n\n    template<typename BuffersType>\n    void send_buffers(const BuffersType& buffers) {\n        boost::asio::async_write(\n            *_socket,\n            buffers,\n            *_yield);\n    }\n\n    void on_disconnect() {}\n\n    void on_error(std::exception_ptr eptr) {\n        std::rethrow_exception(eptr);\n    }\n\n    void lose_connection() {\n        _socket->close();\n        std::cout << \"Closing connection to client\" << std::endl;\n    }\n\nprivate:\n    void print_connection_error(const boost::system::system_error& connection_error) const {\n        std::cerr << \"Client disconnected with code \"\n                  << connection_error.what()\n                  << std::endl;\n    }\n\n    void print_exception_what(const std::exception& excep) {\n        std::cerr << \"Killing connection, exception in client handler: \"\n                  << excep.what()\n                  << std::endl;\n    }\n\n    void expand_buffer() {\n        auto range = std::distance(_read_buffer.begin(), _read_index);\n        if(range < 1024) {\n            _read_buffer.resize(_read_buffer.size() * 2);\n            _read_index = std::next(_read_buffer.begin(), range);\n        }\n    }\n\n    template<typename Iter>\n    void checked_on_message(Iter begin, Iter end) {\n        try {\n            this_protocol().on_message(begin, end);\n        } catch (...) {\n            this_protocol().on_error(std::current_exception());\n        }\n    }\n\nprotected:\n    \/*\n     * @brief CRTP wrapper for derived class access\n     *\/\n    ChildProtocol& this_protocol() {\n        return *static_cast<ChildProtocol*>(this);\n    }\n\n    \/*\n     * @brief CRTP wrapper for derived class access\n     *\/\n    const ChildProtocol& this_protocol() const {\n        return *static_cast<ChildProtocol*>(this);\n    }\n\n    buffer_type _read_buffer;\n    buffer_iterator _read_index;\nprivate:\n    boost::optional<boost::asio::yield_context> _yield;\n    std::unique_ptr<socket_type> _socket; \/\/ unique_ptr as boost::optional has no move support\n    boost::optional<timer_type> _timer;\n    boost::optional<strand_type> _strand;\n};\n\n}\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\t\tdirectlight.cc: an integrator for direct lighting only\n *\t\tThis is part of the yafaray package\n *\t\tCopyright (C) 2006  Mathias Wein (Lynx)\n *\t\tCopyright (C) 2009  Rodrigo Placencia (DarkTide)\n *\n *\t\tThis 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#include <yafray_config.h>\n#include <core_api\/environment.h>\n#include <core_api\/material.h>\n#include <core_api\/mcintegrator.h>\n#include <core_api\/background.h>\n#include <core_api\/light.h>\n#include <sstream>\n\n__BEGIN_YAFRAY\n\nclass YAFRAYPLUGIN_EXPORT directLighting_t: public mcIntegrator_t\n{\n\tpublic:\n\t\tdirectLighting_t(bool transpShad=false, int shadowDepth=4, int rayDepth=6);\n\t\tvirtual bool preprocess();\n\t\tvirtual colorA_t integrate(renderState_t &state, diffRay_t &ray) const;\n\t\tstatic integrator_t* factory(paraMap_t &params, renderEnvironment_t &render);\n};\n\ndirectLighting_t::directLighting_t(bool transpShad, int shadowDepth, int rayDepth)\n{\n\ttype = SURFACE;\n\tcausRadius = 0.25;\n\tcausDepth = 10;\n\tnCausPhotons = 100000;\n\tnCausSearch = 100;\n\ttrShad = transpShad;\n\tusePhotonCaustics = false;\n\tsDepth = shadowDepth;\n\trDepth = rayDepth;\n\tintpb = 0;\n\tintegratorName = \"DirectLight\";\n\tintegratorShortName = \"DL\";\n}\n\nbool directLighting_t::preprocess()\n{\n\tbool success = true;\n\tstd::stringstream set;\n\tsettings = \"\";\n\t\n\tif(trShad)\n\t{\n\t\tset << \"ShadowDepth: [\" << sDepth << \"]\";\n\t}\n\tif(!set.str().empty()) set << \"+\";\n\tset << \"RayDepth: [\" << rDepth << \"]\";\n\t\n\tbackground = scene->getBackground();\n\tlights = scene->lights;\n\n\tif(usePhotonCaustics)\n\t{\n\t\tsuccess = createCausticMap();\n\t\tif(!set.str().empty()) set << \"+\";\n\t\tset << \"Caustics:\" << nCausPhotons << \" photons. \";\n\t}\n\t\n\tif(useAmbientOcclusion)\n\t{\n\t\tif(!set.str().empty()) set << \"+\";\n\t\tset << \"AO\";\n\t}\n\t\n\tsettings = set.str();\n\n\treturn success;\n}\n\ncolorA_t directLighting_t::integrate(renderState_t &state, diffRay_t &ray) const\n{\n\tcolor_t col(0.0);\n\tfloat alpha = 0.0;\n\tsurfacePoint_t sp;\n\tvoid *o_udat = state.userdata;\n\tbool oldIncludeLights = state.includeLights;\n\n\t\/\/ Shoot ray into scene\n\t\n\tif(scene->intersect(ray, sp)) \/\/ If it hits\n\t{\n\t\tunsigned char userdata[USER_DATA_SIZE];\n\t\tconst material_t *material = sp.material;\n\t\tBSDF_t bsdfs;\n\n\t\tstate.userdata = (void *) userdata;\n\t\tvector3d_t wo = -ray.dir;\n\t\tif(state.raylevel == 0) state.includeLights = true;\n\t\t\n\t\tmaterial->initBSDF(state, sp, bsdfs);\n\t\t\n\t\tif(bsdfs & BSDF_EMIT) col += material->emit(state, sp, wo);\n\t\t\n\t\tif(bsdfs & BSDF_DIFFUSE)\n\t\t{\n\t\t\tcol += estimateAllDirectLight(state, sp, wo);\n\t\t\tcol += estimateCausticPhotons(state, sp, wo);\n\t\t\tif(useAmbientOcclusion) col += sampleAmbientOcclusion(state, sp, wo);\n\t\t}\n\t\t\n\t\trecursiveRaytrace(state, ray, bsdfs, sp, wo, col, alpha);\n\t\t\n\t\tfloat m_alpha = material->getAlpha(state, sp, wo);\n\t\talpha = m_alpha + (1.f - m_alpha) * alpha;\n\t}\n\telse \/\/ Nothing hit, return background if any\n\t{\n\t\tif(background) col += (*background)(ray, state, false);\n\t}\n\t\n\tstate.userdata = o_udat;\n\tstate.includeLights = oldIncludeLights;\n\treturn colorA_t(col, alpha);\n}\n\nintegrator_t* directLighting_t::factory(paraMap_t &params, renderEnvironment_t &render)\n{\n\tbool transpShad=false;\n\tbool caustics=false;\n\tbool do_AO=false;\n\tint shadowDepth=5;\n\tint raydepth=5, cDepth=10;\n\tint search=100, photons=500000;\n\tint AO_samples = 32;\n\tdouble cRad = 0.25;\n\tdouble AO_dist = 1.0;\n\tcolor_t AO_col(1.f);\n\t\n\tparams.getParam(\"raydepth\", raydepth);\n\tparams.getParam(\"transpShad\", transpShad);\n\tparams.getParam(\"shadowDepth\", shadowDepth);\n\tparams.getParam(\"caustics\", caustics);\n\tparams.getParam(\"photons\", photons);\n\tparams.getParam(\"caustic_mix\", search);\n\tparams.getParam(\"caustic_depth\", cDepth);\n\tparams.getParam(\"caustic_radius\", cRad);\n\tparams.getParam(\"do_AO\", do_AO);\n\tparams.getParam(\"AO_samples\", AO_samples);\n\tparams.getParam(\"AO_distance\", AO_dist);\n\tparams.getParam(\"AO_color\", AO_col);\n\t\n\tdirectLighting_t *inte = new directLighting_t(transpShad, shadowDepth, raydepth);\n\t\/\/ caustic settings\n\tinte->usePhotonCaustics = caustics;\n\tinte->nCausPhotons = photons;\n\tinte->nCausSearch = search;\n\tinte->causDepth = cDepth;\n\tinte->causRadius = cRad;\n\t\/\/ AO settings\n\tinte->useAmbientOcclusion = do_AO;\n\tinte->aoSamples = AO_samples;\n\tinte->aoDist = (PFLOAT)AO_dist;\n\tinte->aoCol = AO_col;\n\treturn inte;\n}\n\nextern \"C\"\n{\n\n\tYAFRAYPLUGIN_EXPORT void registerPlugin(renderEnvironment_t &render)\n\t{\n\t\trender.registerFactory(\"directlighting\",directLighting_t::factory);\n\t}\n\n}\n\n__END_YAFRAY\n<commit_msg>- DirectLight: Removed useless cast<commit_after>\/****************************************************************************\n *\t\tdirectlight.cc: an integrator for direct lighting only\n *\t\tThis is part of the yafaray package\n *\t\tCopyright (C) 2006  Mathias Wein (Lynx)\n *\t\tCopyright (C) 2009  Rodrigo Placencia (DarkTide)\n *\n *\t\tThis 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#include <yafray_config.h>\n#include <core_api\/environment.h>\n#include <core_api\/material.h>\n#include <core_api\/mcintegrator.h>\n#include <core_api\/background.h>\n#include <core_api\/light.h>\n#include <sstream>\n\n__BEGIN_YAFRAY\n\nclass YAFRAYPLUGIN_EXPORT directLighting_t: public mcIntegrator_t\n{\n\tpublic:\n\t\tdirectLighting_t(bool transpShad=false, int shadowDepth=4, int rayDepth=6);\n\t\tvirtual bool preprocess();\n\t\tvirtual colorA_t integrate(renderState_t &state, diffRay_t &ray) const;\n\t\tstatic integrator_t* factory(paraMap_t &params, renderEnvironment_t &render);\n};\n\ndirectLighting_t::directLighting_t(bool transpShad, int shadowDepth, int rayDepth)\n{\n\ttype = SURFACE;\n\tcausRadius = 0.25;\n\tcausDepth = 10;\n\tnCausPhotons = 100000;\n\tnCausSearch = 100;\n\ttrShad = transpShad;\n\tusePhotonCaustics = false;\n\tsDepth = shadowDepth;\n\trDepth = rayDepth;\n\tintpb = 0;\n\tintegratorName = \"DirectLight\";\n\tintegratorShortName = \"DL\";\n}\n\nbool directLighting_t::preprocess()\n{\n\tbool success = true;\n\tstd::stringstream set;\n\tsettings = \"\";\n\t\n\tif(trShad)\n\t{\n\t\tset << \"ShadowDepth: [\" << sDepth << \"]\";\n\t}\n\tif(!set.str().empty()) set << \"+\";\n\tset << \"RayDepth: [\" << rDepth << \"]\";\n\t\n\tbackground = scene->getBackground();\n\tlights = scene->lights;\n\n\tif(usePhotonCaustics)\n\t{\n\t\tsuccess = createCausticMap();\n\t\tif(!set.str().empty()) set << \"+\";\n\t\tset << \"Caustics:\" << nCausPhotons << \" photons. \";\n\t}\n\t\n\tif(useAmbientOcclusion)\n\t{\n\t\tif(!set.str().empty()) set << \"+\";\n\t\tset << \"AO\";\n\t}\n\t\n\tsettings = set.str();\n\n\treturn success;\n}\n\ncolorA_t directLighting_t::integrate(renderState_t &state, diffRay_t &ray) const\n{\n\tcolor_t col(0.0);\n\tfloat alpha = 0.0;\n\tsurfacePoint_t sp;\n\tvoid *o_udat = state.userdata;\n\tbool oldIncludeLights = state.includeLights;\n\n\t\/\/ Shoot ray into scene\n\t\n\tif(scene->intersect(ray, sp)) \/\/ If it hits\n\t{\n\t\tunsigned char userdata[USER_DATA_SIZE];\n\t\tconst material_t *material = sp.material;\n\t\tBSDF_t bsdfs;\n\n\t\tstate.userdata = (void *) userdata;\n\t\tvector3d_t wo = -ray.dir;\n\t\tif(state.raylevel == 0) state.includeLights = true;\n\t\t\n\t\tmaterial->initBSDF(state, sp, bsdfs);\n\t\t\n\t\tif(bsdfs & BSDF_EMIT) col += material->emit(state, sp, wo);\n\t\t\n\t\tif(bsdfs & BSDF_DIFFUSE)\n\t\t{\n\t\t\tcol += estimateAllDirectLight(state, sp, wo);\n\t\t\tcol += estimateCausticPhotons(state, sp, wo);\n\t\t\tif(useAmbientOcclusion) col += sampleAmbientOcclusion(state, sp, wo);\n\t\t}\n\t\t\n\t\trecursiveRaytrace(state, ray, bsdfs, sp, wo, col, alpha);\n\t\t\n\t\tfloat m_alpha = material->getAlpha(state, sp, wo);\n\t\talpha = m_alpha + (1.f - m_alpha) * alpha;\n\t}\n\telse \/\/ Nothing hit, return background if any\n\t{\n\t\tif(background) col += (*background)(ray, state, false);\n\t}\n\t\n\tstate.userdata = o_udat;\n\tstate.includeLights = oldIncludeLights;\n\treturn colorA_t(col, alpha);\n}\n\nintegrator_t* directLighting_t::factory(paraMap_t &params, renderEnvironment_t &render)\n{\n\tbool transpShad=false;\n\tbool caustics=false;\n\tbool do_AO=false;\n\tint shadowDepth=5;\n\tint raydepth=5, cDepth=10;\n\tint search=100, photons=500000;\n\tint AO_samples = 32;\n\tdouble cRad = 0.25;\n\tdouble AO_dist = 1.0;\n\tcolor_t AO_col(1.f);\n\t\n\tparams.getParam(\"raydepth\", raydepth);\n\tparams.getParam(\"transpShad\", transpShad);\n\tparams.getParam(\"shadowDepth\", shadowDepth);\n\tparams.getParam(\"caustics\", caustics);\n\tparams.getParam(\"photons\", photons);\n\tparams.getParam(\"caustic_mix\", search);\n\tparams.getParam(\"caustic_depth\", cDepth);\n\tparams.getParam(\"caustic_radius\", cRad);\n\tparams.getParam(\"do_AO\", do_AO);\n\tparams.getParam(\"AO_samples\", AO_samples);\n\tparams.getParam(\"AO_distance\", AO_dist);\n\tparams.getParam(\"AO_color\", AO_col);\n\t\n\tdirectLighting_t *inte = new directLighting_t(transpShad, shadowDepth, raydepth);\n\t\/\/ caustic settings\n\tinte->usePhotonCaustics = caustics;\n\tinte->nCausPhotons = photons;\n\tinte->nCausSearch = search;\n\tinte->causDepth = cDepth;\n\tinte->causRadius = cRad;\n\t\/\/ AO settings\n\tinte->useAmbientOcclusion = do_AO;\n\tinte->aoSamples = AO_samples;\n\tinte->aoDist = AO_dist;\n\tinte->aoCol = AO_col;\n\treturn inte;\n}\n\nextern \"C\"\n{\n\n\tYAFRAYPLUGIN_EXPORT void registerPlugin(renderEnvironment_t &render)\n\t{\n\t\trender.registerFactory(\"directlighting\",directLighting_t::factory);\n\t}\n\n}\n\n__END_YAFRAY\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * BaseConnectionProbe.hpp\n *\n *  Created on: Oct 20, 2011\n *      Author: pschultz\n *\/\n\n#ifndef BASECONNECTIONPROBE_HPP_\n#define BASECONNECTIONPROBE_HPP_\n\n#include \"..\/connections\/HyPerConn.hpp\"\n\nenum PatchIDMethod { INDEX_METHOD, COORDINATE_METHOD };\n\nnamespace PV {\n\nclass BaseConnectionProbe {\n\n\/\/ Methods\npublic:\n   virtual ~BaseConnectionProbe();\n   virtual int outputState(double timef) = 0;\n   const char * getName()               {return name;}\n   const char * getFilename()           {return filename;}\n   FILE * getFilePtr()                  {return fp;}\n   HyPerConn * getTargetConn()          {return targetConn;}\n\nprotected:\n   BaseConnectionProbe(); \/\/ Default constructor, can only be called by derived classes\n   int initialize(const char * probename, const char * filename, HyPerConn * conn);\n   int initialize(const char * probename, const char * filename, HyPerConn * conn, int k, bool postProbeFlag);\n   int initialize(const char * probename, const char * filename, HyPerConn * conn, int kx, int ky, int kf, bool postProbeFlag);\n\nprivate:\n   int initialize_base();\n\n\/\/ Member variables\nprivate:\n   char * name; \/\/ Name of the probe; corresponds to the group name in the params file\n   char * filename; \/\/ Name of the output file.  Can be NULL if output goes to stdout\n   FILE * fp; \/\/ pointer to output file; NULL except for root process.  If filename is NULL, fp will be stdout.\n   HyPerConn * targetConn;\n   bool isPostProbe;\n\n}; \/\/ end of class BaseConnectionProbe block\n\n}  \/\/ end of namespace PV block\n\n#endif \/* BASECONNECTIONPROBE_HPP_ *\/\n<commit_msg>Changing member variables in BaseConnectionProbe from private to protected, to make it easier for write subclasses.<commit_after>\/*\n * BaseConnectionProbe.hpp\n *\n *  Created on: Oct 20, 2011\n *      Author: pschultz\n *\/\n\n#ifndef BASECONNECTIONPROBE_HPP_\n#define BASECONNECTIONPROBE_HPP_\n\n#include \"..\/connections\/HyPerConn.hpp\"\n\nenum PatchIDMethod { INDEX_METHOD, COORDINATE_METHOD };\n\nnamespace PV {\n\nclass BaseConnectionProbe {\n\n\/\/ Methods\npublic:\n   virtual ~BaseConnectionProbe();\n   virtual int outputState(double timef) = 0;\n   const char * getName()               {return name;}\n   const char * getFilename()           {return filename;}\n   FILE * getFilePtr()                  {return fp;}\n   HyPerConn * getTargetConn()          {return targetConn;}\n\nprotected:\n   BaseConnectionProbe(); \/\/ Default constructor, can only be called by derived classes\n   int initialize(const char * probename, const char * filename, HyPerConn * conn);\n   int initialize(const char * probename, const char * filename, HyPerConn * conn, int k, bool postProbeFlag);\n   int initialize(const char * probename, const char * filename, HyPerConn * conn, int kx, int ky, int kf, bool postProbeFlag);\n\nprivate:\n   int initialize_base();\n\n\/\/ Member variables\nprotected:\n   char * name; \/\/ Name of the probe; corresponds to the group name in the params file\n   char * filename; \/\/ Name of the output file.  Can be NULL if output goes to stdout\n   FILE * fp; \/\/ pointer to output file; NULL except for root process.  If filename is NULL, fp will be stdout.\n   HyPerConn * targetConn;\n   bool isPostProbe;\n\n}; \/\/ end of class BaseConnectionProbe block\n\n}  \/\/ end of namespace PV block\n\n#endif \/* BASECONNECTIONPROBE_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>FOGL-1552 Fix escaping in where clause<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"cmbNucLattice.h\"\n#include \"cmbNucPartDefinition.h\"\n\nLattice::Lattice()\n{\n  this->enGeometryType = RECTILINEAR;\n  this->SetDimensions(4, 4);\n  subType = FLAT | ANGLE_360;\n}\n\nLattice::Lattice( Lattice const& other )\n{\n  setUpGrid(other);\n  this->subType = other.subType;\n  this->enGeometryType = other.enGeometryType;\n  this->FullCellMode = Lattice::HEX_FULL;\n}\n\nLattice::~Lattice()\n{\n  Grid.clear();\n  for(std::map<std::string, LatticeCell*>::iterator i = LabelToCell.begin(); i != LabelToCell.end(); ++i)\n  {\n    delete i->second;\n    i->second = NULL;\n  }\n  LabelToCell.clear();\n}\n\nLattice& Lattice::operator=(Lattice const& other)\n{\n  \/\/TODO update grid\n  setUpGrid(other);\n  this->subType = other.subType;\n  this->enGeometryType = other.enGeometryType;\n  this->FullCellMode = other.FullCellMode;\n  return *this;\n}\n\nvoid Lattice::setUpGrid(Lattice const & other)\n{\n  for(std::map<std::string, LatticeCell*>::const_iterator i = other.LabelToCell.begin();\n      i != other.LabelToCell.end(); ++i)\n  {\n    if(LabelToCell[i->first]!= NULL) delete LabelToCell[i->first];\n    LabelToCell[i->first] = new LatticeCell(*(i->second));\n  }\n  \/\/TODO update grid\n  this->Grid.resize(other.Grid.size());\n  for(unsigned int i = 0; i < other.Grid.size(); ++i)\n  {\n    this->Grid[i].resize(other.Grid[i].size());\n    for(unsigned j = 0; j < other.Grid[i].size(); ++j)\n    {\n      this->Grid[i][j].setCell(this->getCell(other.Grid[i][j].getCell()->label));\n    }\n  }\n  this->computeValidRange();\n}\n\n\nstd::string Lattice::getLabel()\n{ return \"Lattice\"; }\n\nstd::string Lattice::getTitle(){ return \"Lattice\"; }\n\nvoid Lattice::setInvalidCells()\n{\n  LatticeCell * invalid = this->getCell(\"\");\n  invalid->setInvalid();\n  for(size_t i = 0; i < this->Grid.size(); i++)\n  {\n    size_t start = (subType & FLAT)?(i):(i-(i)\/2);\n    size_t cols = ((subType & FLAT)?(i+1):(((i+1)-(i+2)%2)))+start;\n    if(subType & ANGLE_30)\n    {\n      start = 2*i - i\/2;\n      cols = (i%2 ? (i+1)\/2 :(i+2)\/2) + start;\n    }\n    for(unsigned int j = 0; j < start; ++j)\n    {\n      this->Grid[i][j].setCell(invalid);\n    }\n    for( size_t j = cols; j < this->Grid[i].size(); j++)\n    {\n      this->Grid[i][j].setCell(invalid);\n    }\n  }\n}\n\nvoid Lattice::SetDimensions(int iin, int jin, bool reset)\n{\n  LatticeCell * invalid = this->getCell(\"\");\n  invalid->setInvalid();\n  LatticeCell * XX = this->getCell(\"xx\");\n  XX->color = Qt::white;\n  XX->valid = true;\n  if(this->enGeometryType == RECTILINEAR)\n  {\n    this->Grid.resize(iin);\n    for(int k = 0; k < iin; k++)\n    {\n      this->Grid[k].resize(jin);\n      for(int r = 0; r < jin; ++r)\n      {\n        this->Grid[k][r].setCell(XX);\n      }\n    }\n  }\n  else if(this->enGeometryType == HEXAGONAL)\n  {\n    int current = reset ? 0 : this->Grid.size();\n    if(current == iin)\n    {\n      return;\n    }\n\n    this->Grid.resize(iin);\n\n    this->computeValidRange();\n\n    if(iin > current)\n    {\n      for(int k = current; k < iin; k++)\n      {\n        if(k == 0)\n        {\n          this->Grid[k].resize(1);\n          this->Grid[k][0].setCell(XX);\n        }\n        else\n        {\n          \/\/ for each layer, we need 6*Layer cells\n          int cols = 6*k;\n          this->Grid[k].resize(cols);\n          int start, end;\n          getValidRange(k, start, end);\n          for(int c = 0; c < cols; c++)\n          {\n            if(start <= c && c <= end)\n            {\n              this->Grid[k][c].setCell(XX);\n            }\n            else\n            {\n              this->Grid[k][c].setCell(invalid);\n            }\n          }\n        }\n      }\n    }\n  }\n}\n\nbool Lattice::getValidRange(int layer, int & start, int & end) const\n{\n  if(this->enGeometryType == HEXAGONAL)\n  {\n    start = this->validRange[layer].first;\n    end = this->validRange[layer].second;\n    return true;\n  }\n  return false;\n}\n\nvoid Lattice::computeValidRange()\n{\n  if(this->enGeometryType == HEXAGONAL)\n  {\n    this->validRange.resize(Grid.size());\n    for( int layer = 0; layer < Grid.size(); ++layer)\n    {\n      this->validRange[layer].first = 0;\n      this->validRange[layer].second = 6*layer-1;\n      if(subType != 0 && !(subType & ANGLE_360))\n      {\n        this->validRange[layer].first = (subType & FLAT)?(layer):(layer-(layer)\/2);\n        this->validRange[layer].second = ((subType & FLAT)?(layer+1):\n                                                           (((layer+1)-(layer+2)%2)))+this->validRange[layer].first-1;\n        if(subType & ANGLE_30)\n        {\n          this->validRange[layer].first = 2*layer - layer\/2;\n          this->validRange[layer].second = (layer%2 ? (layer+1)\/2 :(layer+2)\/2) + this->validRange[layer].first - 1;\n        }\n      }\n    }\n  }\n}\n\nstd::pair<int, int> Lattice::GetDimensions() const\n{\n  if(this->Grid.size() == 0) return std::make_pair(0,0);\n  if(this->enGeometryType == RECTILINEAR)\n  {\n    return std::make_pair(static_cast<int>(this->Grid.size()),\n                          static_cast<int>(this->Grid[0].size()));\n  }\n  else\n  {\n    return std::make_pair(static_cast<int>(this->Grid.size()), 6);\n  }\n}\n\nvoid Lattice::SetCell(int i, int j, const std::string &name,\n                      const QColor& color, bool valid)\n{\n  LatticeCell * cr = this->getCell(name);\n  cr->color = color;\n  cr->valid = valid;\n  this->Grid[i][j].setCell(cr);\n}\n\nvoid Lattice::SetCell(int i, int j, const std::string &name)\n{\n  LatticeCell * cr = this->getCell(name);\n  this->Grid[i][j].setCell(cr);\n}\n\nvoid Lattice::SetCellColor(const std::string &name, const QColor& color)\n{\n  LatticeCell * cr = this->getCell(name);\n  cr->color = color;\n}\n\nvoid Lattice::setAsInvalid(int i, int j)\n{\n  LatticeCell * cr = this->getCell(\"\");\n  cr->setInvalid();\n  this->Grid[i][j].setCell(cr);\n}\n\nLattice::LatticeCell Lattice::GetCell(int i, int j) const\n{\n  return *(this->Grid[i][j].getCell());\n}\n\nLattice::LatticeCell Lattice::GetCell(int i) const\n{\n  \/\/ Convert to j,k\n  int s = static_cast<int>(this->Grid.size());\n  \/\/ For Hex type, This is different\n  if(this->enGeometryType == HEXAGONAL)\n  {\n    int j = 0, k = 0;\n    int totalNum = 0, preTotal;\n    for(int layer = 0; layer < s; layer++)\n    {\n      preTotal = totalNum;\n      \/\/ totalNum += (6*layer);\n      totalNum = 1 + 3*layer*(layer+1);\n      if(i < totalNum)\n      {\n        j = layer;\n        k = i-preTotal;\n        break;\n      }\n    }\n    return this->GetCell(j,k);\n  }\n  else\n  {\n    int size = static_cast<int>(this->Grid[0].size());\n    int j = i \/ size;\n    int k = i - (j*size);\n    assert(j < static_cast<int>(this->Grid.size()));\n    assert(k < static_cast<int>(this->Grid[j].size()));\n\n    return this->GetCell(j,k);\n  }\n}\n\nvoid Lattice::ClearCell(int i, int j)\n{\n  LatticeCell * cr = this->getCell(\"xx\");\n  this->Grid[i][j].setCell(cr);\n}\n\nbool Lattice::ClearCell(const std::string &label)\n{\n  bool r = false;\n  for(size_t i = 0; i < this->Grid.size(); i++)\n  {\n    for(size_t j = 0; j < this->Grid[i].size(); j++)\n    {\n      if(this->GetCell(i, j).label == label)\n      {\n        r = true;\n        this->ClearCell(i, j);\n      }\n    }\n  }\n  return r;\n}\n\nbool Lattice::replaceLabel(const std::string &oldL, const std::string &newL)\n{\n  std::map<std::string, LatticeCell *>::iterator iter = LabelToCell.find(oldL);\n  if(iter == LabelToCell.end() || iter->second->getCount() == 0)\n  {\n    return false;\n  }\n  std::map<std::string, LatticeCell *>::iterator newI = LabelToCell.find(newL);\n  if(newI == LabelToCell.end()) \/\/easy\n  {\n    iter->second->label = newL;\n    LabelToCell[newL] = iter->second;\n    LabelToCell.erase(iter);\n    return true;\n  }\n  \/\/harder\n  for(size_t i = 0; i < this->Grid.size(); i++)\n  {\n    for(size_t j = 0; j < this->Grid[i].size(); j++)\n    {\n      if(this->Grid[i][j].getCell() == iter->second)\n      {\n        this->Grid[i][j].setCell(newI->second);\n      }\n    }\n  }\n  return true;\n}\n\nenumNucPartsType Lattice::GetType() const\n{ return CMBNUC_ASSY_LATTICE;}\n\nint Lattice::GetNumberOfCells()\n{\n  if(this->Grid.size() == 0)\n  {\n    return 0;\n  }\n  if(this->enGeometryType == HEXAGONAL)\n  {\n    int tmp = static_cast<int>(this->Grid.size());\n    return 1 + 3*tmp*(tmp - 1);\n  }\n  else\n  {\n    return static_cast<int>(this->Grid.size()*this->Grid[0].size());\n  }\n}\n\nvoid Lattice::SetGeometryType(enumGeometryType type)\n{\n  if(this->enGeometryType == type) return;\n  this->enGeometryType = type;\n  if(type == RECTILINEAR) this->SetDimensions(4, 4);\n  else this->SetDimensions(1, 1, true);\n}\n\nenumGeometryType Lattice::GetGeometryType()\n{ return this->enGeometryType; }\n\nvoid Lattice::SetGeometrySubType(int type)\n{subType = type;}\n\nint Lattice::GetGeometrySubType() const\n{ return subType; }\n\nbool Lattice::labelUsed(const std::string &l) const\n{\n  std::map<std::string, LatticeCell *>::const_iterator iter = LabelToCell.find(l);\n  if(iter == LabelToCell.end())\n  {\n    return false;\n  }\n  return iter->second->getCount() != 0;\n}\n\nLattice::LatticeCell * Lattice::getCell(std::string label)\n{\n  LatticeCell * result = NULL;\n  std::map<std::string, LatticeCell *>::iterator iter = LabelToCell.find(label);\n  if(iter == LabelToCell.end())\n  {\n    result = new LatticeCell;\n    result->label = label;\n    LabelToCell[label] = result;\n  }\n  else\n  {\n    result = iter->second;\n  }\n  return result;\n}\n\nLattice::CellDrawMode Lattice::getDrawMode(int index, int layer) const\n{\n  if(this->enGeometryType == RECTILINEAR) return Lattice::RECT;\n  int start, end;\n  this->getValidRange(layer, start, end);\n  if(layer == 0)\n  {\n    if(this->subType & ANGLE_360)\n    {\n      return this->getFullCellMode();\n    }\n    else if(this->subType & ANGLE_60 && this->subType & FLAT)\n    {\n      return Lattice::HEX_SIXTH_FLAT_CENTER;\n    }\n    else if(this->subType & ANGLE_60 && this->subType & VERTEX)\n    {\n      return Lattice::HEX_SIXTH_VERT_CENTER;\n    }\n    else if(this->subType & ANGLE_30)\n    {\n      return Lattice::HEX_TWELFTH_CENTER;\n    }\n  }\n  else if(this->subType & ANGLE_360)\n  {\n    return FullCellMode;\n  }\n  else if( this->subType & ANGLE_60 && this->subType & FLAT )\n  {\n    if(index == start)\n    {\n      return Lattice::HEX_SIXTH_FLAT_TOP;\n    }\n    else if(index == end)\n    {\n      return Lattice::HEX_SIXTH_FLAT_BOTTOM;\n    }\n    else\n    {\n      return Lattice::HEX_FULL;\n    }\n  }\n  else if( this->subType & ANGLE_60 && this->subType & VERTEX )\n  {\n    if(index == start && layer % 2 == 0) return Lattice::HEX_SIXTH_VERT_TOP;\n    else if(index == end && layer % 2 == 0) return Lattice::HEX_SIXTH_VERT_BOTTOM;\n    return Lattice::HEX_FULL_30;\n  }\n  else if(this->subType & ANGLE_30)\n  {\n    if(index == end) return Lattice::HEX_TWELFTH_BOTTOM;\n    else if(index == start && layer % 2 == 0) return Lattice::HEX_TWELFTH_TOP;\n  }\n  return Lattice::HEX_FULL;\n}\n\nstd::string Lattice::generate_string(std::string in, CellDrawMode mode)\n{\n  switch(mode)\n  {\n    case RECT:\n    case HEX_FULL:\n    case HEX_FULL_30:\n      return in;\n    case HEX_SIXTH_FLAT_BOTTOM:\n    case HEX_SIXTH_VERT_BOTTOM:\n    case HEX_TWELFTH_BOTTOM:\n      return in+\"_bottom\";\n    case HEX_SIXTH_FLAT_CENTER:\n    case HEX_SIXTH_VERT_CENTER:\n    case HEX_TWELFTH_CENTER:\n      return in + \"_center\";\n    case HEX_SIXTH_FLAT_TOP:\n    case HEX_SIXTH_VERT_TOP:\n    case HEX_TWELFTH_TOP:\n      return in + \"_top\";\n  }\n}\n<commit_msg>fix resize of rect lattice<commit_after>#include \"cmbNucLattice.h\"\n#include \"cmbNucPartDefinition.h\"\n\nLattice::Lattice()\n{\n  this->enGeometryType = RECTILINEAR;\n  this->SetDimensions(4, 4);\n  subType = FLAT | ANGLE_360;\n}\n\nLattice::Lattice( Lattice const& other )\n{\n  setUpGrid(other);\n  this->subType = other.subType;\n  this->enGeometryType = other.enGeometryType;\n  this->FullCellMode = Lattice::HEX_FULL;\n}\n\nLattice::~Lattice()\n{\n  Grid.clear();\n  for(std::map<std::string, LatticeCell*>::iterator i = LabelToCell.begin(); i != LabelToCell.end(); ++i)\n  {\n    delete i->second;\n    i->second = NULL;\n  }\n  LabelToCell.clear();\n}\n\nLattice& Lattice::operator=(Lattice const& other)\n{\n  \/\/TODO update grid\n  setUpGrid(other);\n  this->subType = other.subType;\n  this->enGeometryType = other.enGeometryType;\n  this->FullCellMode = other.FullCellMode;\n  return *this;\n}\n\nvoid Lattice::setUpGrid(Lattice const & other)\n{\n  for(std::map<std::string, LatticeCell*>::const_iterator i = other.LabelToCell.begin();\n      i != other.LabelToCell.end(); ++i)\n  {\n    if(LabelToCell[i->first]!= NULL) delete LabelToCell[i->first];\n    LabelToCell[i->first] = new LatticeCell(*(i->second));\n  }\n  \/\/TODO update grid\n  this->Grid.resize(other.Grid.size());\n  for(unsigned int i = 0; i < other.Grid.size(); ++i)\n  {\n    this->Grid[i].resize(other.Grid[i].size());\n    for(unsigned j = 0; j < other.Grid[i].size(); ++j)\n    {\n      this->Grid[i][j].setCell(this->getCell(other.Grid[i][j].getCell()->label));\n    }\n  }\n  this->computeValidRange();\n}\n\n\nstd::string Lattice::getLabel()\n{ return \"Lattice\"; }\n\nstd::string Lattice::getTitle(){ return \"Lattice\"; }\n\nvoid Lattice::setInvalidCells()\n{\n  LatticeCell * invalid = this->getCell(\"\");\n  invalid->setInvalid();\n  for(size_t i = 0; i < this->Grid.size(); i++)\n  {\n    size_t start = (subType & FLAT)?(i):(i-(i)\/2);\n    size_t cols = ((subType & FLAT)?(i+1):(((i+1)-(i+2)%2)))+start;\n    if(subType & ANGLE_30)\n    {\n      start = 2*i - i\/2;\n      cols = (i%2 ? (i+1)\/2 :(i+2)\/2) + start;\n    }\n    for(unsigned int j = 0; j < start; ++j)\n    {\n      this->Grid[i][j].setCell(invalid);\n    }\n    for( size_t j = cols; j < this->Grid[i].size(); j++)\n    {\n      this->Grid[i][j].setCell(invalid);\n    }\n  }\n}\n\nvoid Lattice::SetDimensions(int iin, int jin, bool reset)\n{\n  LatticeCell * invalid = this->getCell(\"\");\n  invalid->setInvalid();\n  LatticeCell * XX = this->getCell(\"xx\");\n  XX->color = Qt::white;\n  XX->valid = true;\n  if(this->enGeometryType == RECTILINEAR)\n  {\n    this->Grid.resize(iin);\n    for(int k = 0; k < iin; k++)\n    {\n      int old = reset?0:this->Grid[k].size();\n      this->Grid[k].resize(jin);\n      for(int r = old; r < jin; ++r)\n      {\n        this->Grid[k][r].setCell(XX);\n      }\n    }\n  }\n  else if(this->enGeometryType == HEXAGONAL)\n  {\n    int current = reset ? 0 : this->Grid.size();\n    if(current == iin)\n    {\n      return;\n    }\n\n    this->Grid.resize(iin);\n\n    this->computeValidRange();\n\n    if(iin > current)\n    {\n      for(int k = current; k < iin; k++)\n      {\n        if(k == 0)\n        {\n          this->Grid[k].resize(1);\n          this->Grid[k][0].setCell(XX);\n        }\n        else\n        {\n          \/\/ for each layer, we need 6*Layer cells\n          int cols = 6*k;\n          this->Grid[k].resize(cols);\n          int start, end;\n          getValidRange(k, start, end);\n          for(int c = 0; c < cols; c++)\n          {\n            if(start <= c && c <= end)\n            {\n              this->Grid[k][c].setCell(XX);\n            }\n            else\n            {\n              this->Grid[k][c].setCell(invalid);\n            }\n          }\n        }\n      }\n    }\n  }\n}\n\nbool Lattice::getValidRange(int layer, int & start, int & end) const\n{\n  if(this->enGeometryType == HEXAGONAL)\n  {\n    start = this->validRange[layer].first;\n    end = this->validRange[layer].second;\n    return true;\n  }\n  return false;\n}\n\nvoid Lattice::computeValidRange()\n{\n  if(this->enGeometryType == HEXAGONAL)\n  {\n    this->validRange.resize(Grid.size());\n    for( int layer = 0; layer < Grid.size(); ++layer)\n    {\n      this->validRange[layer].first = 0;\n      this->validRange[layer].second = 6*layer-1;\n      if(subType != 0 && !(subType & ANGLE_360))\n      {\n        this->validRange[layer].first = (subType & FLAT)?(layer):(layer-(layer)\/2);\n        this->validRange[layer].second = ((subType & FLAT)?(layer+1):\n                                                           (((layer+1)-(layer+2)%2)))+this->validRange[layer].first-1;\n        if(subType & ANGLE_30)\n        {\n          this->validRange[layer].first = 2*layer - layer\/2;\n          this->validRange[layer].second = (layer%2 ? (layer+1)\/2 :(layer+2)\/2) + this->validRange[layer].first - 1;\n        }\n      }\n    }\n  }\n}\n\nstd::pair<int, int> Lattice::GetDimensions() const\n{\n  if(this->Grid.size() == 0) return std::make_pair(0,0);\n  if(this->enGeometryType == RECTILINEAR)\n  {\n    return std::make_pair(static_cast<int>(this->Grid.size()),\n                          static_cast<int>(this->Grid[0].size()));\n  }\n  else\n  {\n    return std::make_pair(static_cast<int>(this->Grid.size()), 6);\n  }\n}\n\nvoid Lattice::SetCell(int i, int j, const std::string &name,\n                      const QColor& color, bool valid)\n{\n  LatticeCell * cr = this->getCell(name);\n  cr->color = color;\n  cr->valid = valid;\n  this->Grid[i][j].setCell(cr);\n}\n\nvoid Lattice::SetCell(int i, int j, const std::string &name)\n{\n  LatticeCell * cr = this->getCell(name);\n  this->Grid[i][j].setCell(cr);\n}\n\nvoid Lattice::SetCellColor(const std::string &name, const QColor& color)\n{\n  LatticeCell * cr = this->getCell(name);\n  cr->color = color;\n}\n\nvoid Lattice::setAsInvalid(int i, int j)\n{\n  LatticeCell * cr = this->getCell(\"\");\n  cr->setInvalid();\n  this->Grid[i][j].setCell(cr);\n}\n\nLattice::LatticeCell Lattice::GetCell(int i, int j) const\n{\n  return *(this->Grid[i][j].getCell());\n}\n\nLattice::LatticeCell Lattice::GetCell(int i) const\n{\n  \/\/ Convert to j,k\n  int s = static_cast<int>(this->Grid.size());\n  \/\/ For Hex type, This is different\n  if(this->enGeometryType == HEXAGONAL)\n  {\n    int j = 0, k = 0;\n    int totalNum = 0, preTotal;\n    for(int layer = 0; layer < s; layer++)\n    {\n      preTotal = totalNum;\n      \/\/ totalNum += (6*layer);\n      totalNum = 1 + 3*layer*(layer+1);\n      if(i < totalNum)\n      {\n        j = layer;\n        k = i-preTotal;\n        break;\n      }\n    }\n    return this->GetCell(j,k);\n  }\n  else\n  {\n    int size = static_cast<int>(this->Grid[0].size());\n    int j = i \/ size;\n    int k = i - (j*size);\n    assert(j < static_cast<int>(this->Grid.size()));\n    assert(k < static_cast<int>(this->Grid[j].size()));\n\n    return this->GetCell(j,k);\n  }\n}\n\nvoid Lattice::ClearCell(int i, int j)\n{\n  LatticeCell * cr = this->getCell(\"xx\");\n  this->Grid[i][j].setCell(cr);\n}\n\nbool Lattice::ClearCell(const std::string &label)\n{\n  bool r = false;\n  for(size_t i = 0; i < this->Grid.size(); i++)\n  {\n    for(size_t j = 0; j < this->Grid[i].size(); j++)\n    {\n      if(this->GetCell(i, j).label == label)\n      {\n        r = true;\n        this->ClearCell(i, j);\n      }\n    }\n  }\n  return r;\n}\n\nbool Lattice::replaceLabel(const std::string &oldL, const std::string &newL)\n{\n  std::map<std::string, LatticeCell *>::iterator iter = LabelToCell.find(oldL);\n  if(iter == LabelToCell.end() || iter->second->getCount() == 0)\n  {\n    return false;\n  }\n  std::map<std::string, LatticeCell *>::iterator newI = LabelToCell.find(newL);\n  if(newI == LabelToCell.end()) \/\/easy\n  {\n    iter->second->label = newL;\n    LabelToCell[newL] = iter->second;\n    LabelToCell.erase(iter);\n    return true;\n  }\n  \/\/harder\n  for(size_t i = 0; i < this->Grid.size(); i++)\n  {\n    for(size_t j = 0; j < this->Grid[i].size(); j++)\n    {\n      if(this->Grid[i][j].getCell() == iter->second)\n      {\n        this->Grid[i][j].setCell(newI->second);\n      }\n    }\n  }\n  return true;\n}\n\nenumNucPartsType Lattice::GetType() const\n{ return CMBNUC_ASSY_LATTICE;}\n\nint Lattice::GetNumberOfCells()\n{\n  if(this->Grid.size() == 0)\n  {\n    return 0;\n  }\n  if(this->enGeometryType == HEXAGONAL)\n  {\n    int tmp = static_cast<int>(this->Grid.size());\n    return 1 + 3*tmp*(tmp - 1);\n  }\n  else\n  {\n    return static_cast<int>(this->Grid.size()*this->Grid[0].size());\n  }\n}\n\nvoid Lattice::SetGeometryType(enumGeometryType type)\n{\n  if(this->enGeometryType == type) return;\n  this->enGeometryType = type;\n  if(type == RECTILINEAR) this->SetDimensions(4, 4);\n  else this->SetDimensions(1, 1, true);\n}\n\nenumGeometryType Lattice::GetGeometryType()\n{ return this->enGeometryType; }\n\nvoid Lattice::SetGeometrySubType(int type)\n{subType = type;}\n\nint Lattice::GetGeometrySubType() const\n{ return subType; }\n\nbool Lattice::labelUsed(const std::string &l) const\n{\n  std::map<std::string, LatticeCell *>::const_iterator iter = LabelToCell.find(l);\n  if(iter == LabelToCell.end())\n  {\n    return false;\n  }\n  return iter->second->getCount() != 0;\n}\n\nLattice::LatticeCell * Lattice::getCell(std::string label)\n{\n  LatticeCell * result = NULL;\n  std::map<std::string, LatticeCell *>::iterator iter = LabelToCell.find(label);\n  if(iter == LabelToCell.end())\n  {\n    result = new LatticeCell;\n    result->label = label;\n    LabelToCell[label] = result;\n  }\n  else\n  {\n    result = iter->second;\n  }\n  return result;\n}\n\nLattice::CellDrawMode Lattice::getDrawMode(int index, int layer) const\n{\n  if(this->enGeometryType == RECTILINEAR) return Lattice::RECT;\n  int start, end;\n  this->getValidRange(layer, start, end);\n  if(layer == 0)\n  {\n    if(this->subType & ANGLE_360)\n    {\n      return this->getFullCellMode();\n    }\n    else if(this->subType & ANGLE_60 && this->subType & FLAT)\n    {\n      return Lattice::HEX_SIXTH_FLAT_CENTER;\n    }\n    else if(this->subType & ANGLE_60 && this->subType & VERTEX)\n    {\n      return Lattice::HEX_SIXTH_VERT_CENTER;\n    }\n    else if(this->subType & ANGLE_30)\n    {\n      return Lattice::HEX_TWELFTH_CENTER;\n    }\n  }\n  else if(this->subType & ANGLE_360)\n  {\n    return FullCellMode;\n  }\n  else if( this->subType & ANGLE_60 && this->subType & FLAT )\n  {\n    if(index == start)\n    {\n      return Lattice::HEX_SIXTH_FLAT_TOP;\n    }\n    else if(index == end)\n    {\n      return Lattice::HEX_SIXTH_FLAT_BOTTOM;\n    }\n    else\n    {\n      return Lattice::HEX_FULL;\n    }\n  }\n  else if( this->subType & ANGLE_60 && this->subType & VERTEX )\n  {\n    if(index == start && layer % 2 == 0) return Lattice::HEX_SIXTH_VERT_TOP;\n    else if(index == end && layer % 2 == 0) return Lattice::HEX_SIXTH_VERT_BOTTOM;\n    return Lattice::HEX_FULL_30;\n  }\n  else if(this->subType & ANGLE_30)\n  {\n    if(index == end) return Lattice::HEX_TWELFTH_BOTTOM;\n    else if(index == start && layer % 2 == 0) return Lattice::HEX_TWELFTH_TOP;\n  }\n  return Lattice::HEX_FULL;\n}\n\nstd::string Lattice::generate_string(std::string in, CellDrawMode mode)\n{\n  switch(mode)\n  {\n    case RECT:\n    case HEX_FULL:\n    case HEX_FULL_30:\n      return in;\n    case HEX_SIXTH_FLAT_BOTTOM:\n    case HEX_SIXTH_VERT_BOTTOM:\n    case HEX_TWELFTH_BOTTOM:\n      return in+\"_bottom\";\n    case HEX_SIXTH_FLAT_CENTER:\n    case HEX_SIXTH_VERT_CENTER:\n    case HEX_TWELFTH_CENTER:\n      return in + \"_center\";\n    case HEX_SIXTH_FLAT_TOP:\n    case HEX_SIXTH_VERT_TOP:\n    case HEX_TWELFTH_TOP:\n      return in + \"_top\";\n  }\n}\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\/\/ boost\n#include <boost\/version.hpp>\n#include <mapnik\/json\/geojson_generator.hpp>\n\n#if BOOST_VERSION >= 104700\n\n#include <mapnik\/json\/feature_generator_grammar.hpp>\n#include <mapnik\/json\/geometry_generator_grammar.hpp>\n#include <boost\/spirit\/include\/karma.hpp>\n\nnamespace  mapnik { namespace json {\n\n    feature_generator::feature_generator()\n        : grammar_(new feature_generator_grammar<sink_type>()) {}\n\n    feature_generator::~feature_generator() {}\n\n    bool feature_generator::generate(std::string & geojson, mapnik::Feature const& f)\n    {\n        sink_type sink(geojson);\n        return karma::generate(sink, *grammar_,f);\n    }\n\n\n    geometry_generator::geometry_generator()\n        : grammar_(new multi_geometry_generator_grammar<sink_type>()) {}\n\n    geometry_generator::~geometry_generator() {}\n\n    bool geometry_generator::generate(std::string & geojson, mapnik::geometry_container const& g)\n    {\n        sink_type sink(geojson);\n        return karma::generate(sink, *grammar_,g);\n    }\n\n    }}\n\n#else\n\n#include <string>\n#include <sstream>\n#include <exception>\n\nnamespace  mapnik { namespace json {\n\n    bool feature_generator::generate(std::string & geojson, mapnik::Feature const& f)\n    {\n        std::ostringstream s;\n        s << BOOST_VERSION\/100000 << \".\" << BOOST_VERSION\/100 % 1000  << \".\" << BOOST_VERSION % 100;\n        throw std::runtime_error(\"feature_generator::generate() requires at least boost 1.47 while your build was compiled against boost \" + s.str());\n        return false;\n    }\n\n    bool geometry_generator::generate(std::string & geojson, mapnik::geometry_container const& g)\n    {\n        std::ostringstream s;\n        s << BOOST_VERSION\/100000 << \".\" << BOOST_VERSION\/100 % 1000  << \".\" << BOOST_VERSION % 100;\n        throw std::runtime_error(\"geometry_generator::generate() requires at least boost 1.47 while your build was compiled against boost \" + s.str());\n        return false;\n    }\n\n    }}\n\n#endif\n<commit_msg>+ ident<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\/\/ boost\n#include <boost\/version.hpp>\n#include <mapnik\/json\/geojson_generator.hpp>\n\n#if BOOST_VERSION >= 104700\n\n#include <mapnik\/json\/feature_generator_grammar.hpp>\n#include <mapnik\/json\/geometry_generator_grammar.hpp>\n#include <boost\/spirit\/include\/karma.hpp>\n\nnamespace  mapnik { namespace json {\n\nfeature_generator::feature_generator()\n    : grammar_(new feature_generator_grammar<sink_type>()) {}\n\nfeature_generator::~feature_generator() {}\n\nbool feature_generator::generate(std::string & geojson, mapnik::Feature const& f)\n{\n    sink_type sink(geojson);\n    return karma::generate(sink, *grammar_,f);\n}\n\n\ngeometry_generator::geometry_generator()\n    : grammar_(new multi_geometry_generator_grammar<sink_type>()) {}\n\ngeometry_generator::~geometry_generator() {}\n\nbool geometry_generator::generate(std::string & geojson, mapnik::geometry_container const& g)\n{\n    sink_type sink(geojson);\n    return karma::generate(sink, *grammar_,g);\n}\n\n}}\n\n#else\n\n#include <string>\n#include <sstream>\n#include <exception>\n\nnamespace  mapnik { namespace json {\n\nbool feature_generator::generate(std::string & geojson, mapnik::Feature const& f)\n{\n    std::ostringstream s;\n    s << BOOST_VERSION\/100000 << \".\" << BOOST_VERSION\/100 % 1000  << \".\" << BOOST_VERSION % 100;\n    throw std::runtime_error(\"feature_generator::generate() requires at least boost 1.47 while your build was compiled against boost \" + s.str());\n    return false;\n}\n\nbool geometry_generator::generate(std::string & geojson, mapnik::geometry_container const& g)\n{\n    std::ostringstream s;\n    s << BOOST_VERSION\/100000 << \".\" << BOOST_VERSION\/100 % 1000  << \".\" << BOOST_VERSION % 100;\n    throw std::runtime_error(\"geometry_generator::generate() requires at least boost 1.47 while your build was compiled against boost \" + s.str());\n    return false;\n}\n\n}}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"headers\/mainwindow.h\"\n#include \"headers\/cryptogame.h\"\n#include \"ui_mainwindow.h\"\n#include \"QPushButton\"\n#include <QLayoutItem>\n#include <QMessageBox>\n#include <QtConcurrent\/QtConcurrent>\n#include <QFuture>\n#include \"headers\/buttonarray.h\"\n#include \"headers\/labelarray.h\"\n#include <QtWebKit>\n#include <QUrl>\n\n#include \"iostream\" \/\/for debugging\n\nMainWindow::MainWindow(QWidget *parent) :\n    QMainWindow(parent),\n    ui(new Ui::MainWindow)\n{\n    connect(&threadCrack, SIGNAL(finished()), this, SLOT(update_crack_result()));\n    connect(&threadFactor, SIGNAL(finished()), this, SLOT(update_factor_result()));\n    connect(&threadCrackData, SIGNAL(finished()), this, SLOT(update_crack_graph()));\n    connect(&threadFactorData, SIGNAL(finished()), this, SLOT(update_factor_graph()));\n    ui->setupUi(this);\n\n    QAction *act = new QAction(QString(\"Help\"), this);\n\n    connect(act, &QAction::triggered, this, &MainWindow::on_HELPBUTTONCLICKED);\n\n    ui->menuBar->addAction(act);\n\n}\n\nMainWindow::~MainWindow()\n{\n    delete ui;\n\n    if(threadCrack.isRunning()) {\n        threadCrack.quit();\n    }\n    if(threadFactor.isRunning()) {\n        threadFactor.quit();\n    }\n\n    if(factorAlg != NULL) {\n        delete factorAlg;\n    }\n    if(hashAlg != NULL) {\n        delete hashAlg;\n    }\n\n    if(fg != NULL) {\n        delete fg;\n    }\n    if(cg != NULL) {\n        delete cg;\n    }\n}\n\nvoid MainWindow::on_pushButton_clicked()\n{\n\n    \/\/Delete all buttons in the and labels in the gameGrid\n   for(int i=0; i<ui->gameGrid->columnCount(); i++){\n       for(int j = 0; j<ui->gameGrid->rowCount(); j++){\n\n       QLayoutItem *button = ui->gameGrid->itemAtPosition(j,i);\n       if(button){\n           ui->gameGrid->removeItem(button);\n          delete button->widget();\n       }\n\n\n        QLayoutItem *label = ui->gameGrid->itemAtPosition(j,i);\n        if(label){\n            ui->gameGrid->removeItem(label);\n\n            delete label->widget();\n        }\n\n       }\n\n    }\n\n    agame = new cryptogame();\n    QString q = QString::fromStdString(agame->getEncryptedMessage());\n    \/\/ui->label->setText(q);\n    LabelArray *lptr = new LabelArray(q, ui->tabWidget);\n    ButtonArray *buttonPtrs = new ButtonArray(q, ui->tabWidget, agame);\n    int j = 0;\n    int i = 0;\n    int counter = 0;\n    while(counter < q.length()){\n        if(i >= 3 && q.at(counter) == ' '){\n            j += 2;\n            i = 0;\n        } else {\n        ui->gameGrid->addWidget(lptr->get(counter), j, i);\n        ui->gameGrid->addWidget(buttonPtrs->get(counter), j+1, i);\n        i++;\n        }\n        counter++;\n    }\n\n\n}\n\n\nvoid MainWindow::on_pushButton_3_clicked()\n{\n    \/\/Give a hint to the player\n    QMessageBox hintMessage;\n    hintMessage.setText(QString::fromStdString(agame->getHint()));\n    hintMessage.exec();\n}\n\nvoid MainWindow::on_factorPrimesButton_clicked()\n{\n    \/\/reset label text\n    ui->resultLabel->setText(QString::fromStdString(\"Result:\"));\n    ui->timeLabel->setText(QString::fromStdString(\"Time: \"));\n    ui->resultLabel->repaint();\n    ui->timeLabel->repaint();\n\n    \/\/set algorithm\n    int algChoice = ui->factorAlgChooser->currentIndex();\n\n    switch(algChoice) {\n    case 0:{\n        factorAlg = new BruteForceFactor();\n        break;}\n    case 1:{\n        factorAlg = new QSFactor();\n        std::cout<<\"Quadratic sieve feature is in progress!\"<<std::endl;\n        break;}\n    }\n\t\n    mpz_class composite;\n    string s = ui->compositeTextField->text().toStdString();\n    composite.set_str(s, 10);\n\n    threadFactor.setFactor(factorAlg, composite);\n    threadFactor.work();\n\n    ui->factorPrimesButton->setDisabled(true);\n}\n\nvoid MainWindow::update_factor_result() {\n\n    long elapsed = threadFactor.getResult();\n    Factor* pf = threadFactor.getFactor();\n\n    string s = \"Time: \" + std::to_string(elapsed) + \" ms\";\n    ui->timeLabel->setText(QString::fromStdString(s));\n\n    s = \"Result: \" + pf->p1.get_str(10) + \" * \" + pf->p2.get_str(10);\n    ui->resultLabel->setText(QString::fromStdString(s));\n\n    ui->factorPrimesButton->setDisabled(false);\n}\n\nvoid MainWindow::on_random_composite_clicked()\n{\n    mpz_class composite, p, q;\n    GeneratePrimes gp = GeneratePrimes();\n    p = gp.readRandomPrime((char*)\"primes.txt\");\n    q = gp.readRandomPrime((char*)\"primes.txt\");\n    composite = p * q;\n    string s = composite.get_str(10);\n    ui->compositeTextField->setText(QString::fromStdString(s));\n}\n\nvoid MainWindow::on_hashButton_clicked()\n{\n    switch(ui->hashComboBox->currentIndex()) {\n    case 0:\n        hashAlg = new Md5();\n        break;\n    case 1:\n        hashAlg = new Sha512();\n        break;\n    case 2:\n        hashAlg = new Pbkdf2();\n        break;\n    }\n\n    hashAlg->setPlaintext(ui->plaintextField->text());\n\n    if(ui->saltField->text() != \"\") { \/\/if not empty\n        hashAlg->setSalt(ui->saltField->text());\n    }\n    hashAlg->compute();\n    digest = hashAlg->getDigest();\n    ui->digestField->setText(digest);\n\n    \/\/Perhaps make this an option?\n    \/\/hashAlg->salt = \"\";\n}\n\nvoid MainWindow::on_randomSaltButton_clicked()\n{\n    Hash h;\n    h.generateSalt(16);\n    ui->saltField->setText(h.getSalt());\n}\n\nvoid MainWindow::on_crackButton_clicked()\n{\n    \/\/reset label text\n    ui->crackTimeLabel->setText(\"Time: \");\n    ui->crackTimeLabel->repaint();\n    ui->crackedField->setText(\"\");\n    ui->crackedField->repaint();\n\n    Crack* c = new Crack();\n    if(hashAlg == NULL) {\n    \treturn;\n    }\n\n\n    switch(ui->crackTabWidget->currentIndex()) {\n    case 0:\n        {int maxLength = ui->charCountSpinBox->text().toInt();\n        c = new BruteForceCrack(hashAlg,bruteForceAlphabet(), maxLength);\n        break;}\n\n    case 1:\n        {c = new DictionaryCrack(hashAlg, \"..\/dictionary.txt\");\n        dictionaryOptions(c);\n        break;}\n    }\n\n    c->setDigest(digest);\n\n    threadCrack.setCrackType(c);\n    threadCrack.work();\n\n    ui->crackButton->setDisabled(true);\n}\n\nvoid MainWindow::update_crack_result() {\n\n    long elapsed;\n    bool success;\n\n    elapsed = threadCrack.getResult();\n    Crack* c = threadCrack.getCrack();\n    success = c->getPlaintext().length();\n\n\n    if(success) {\n        ui->crackedField->setText(threadCrack.getCrack()->getPlaintext());\n    } else {\n        ui->crackedField->setText(\"\\\"Uncrackable!!\\\"\");\n    }\n\n    string s = \"Time: \" + std::to_string(elapsed) + \" ms\";\n    ui->crackTimeLabel->setText(QString::fromStdString(s));\n\n    ui->crackButton->setDisabled(false);\n}\n\nstd::string MainWindow::bruteForceAlphabet() {\n\n    std::string alph = \" \";\/\/weird bug \"fix\"\n\n    if(ui->customCheckBox->isChecked()) {\n        return ui->alphabetField->text().toStdString();\n    }\n    if(ui->lettersCheckBox->isChecked()) {\n        alph += \"abcdefghijklmnopqrstuvwxyz\";\n    }\n    if(ui->upCaseCheckBox->isChecked()) {\n        alph += \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n    }\n    if(ui->numbersCheckBox->isChecked()) {\n        alph += \"1234567890\";\n    }\n    if(ui->symbolsCheckBox->isChecked()) {\n        alph += \"`~!@#$%^&*()_+-=,.<>\/?'[]{}\";\n    }\n    return alph;\n}\n\nvoid MainWindow::dictionaryOptions(Crack* d) {\n\n    unsigned int numWords = ui->wordCountSpinBox->text().toInt();\n    unsigned int appendedDigits = 0;\n    if(ui->appendCheckBox->isChecked()) {\n        appendedDigits = ui->digitCountSpinBox->text().toInt();\n    }\n    unsigned int prependedDigits = 0;\n    if(ui->prependCheckBox->isChecked()) {\n        prependedDigits = ui->digitCountSpinBox->text().toInt();\n    }\n\n    bool cap = ui->capCheckBox->isChecked();\n    bool symbols = ui->dictSymbolsCheckBox->isChecked();\n    bool complete = ui->completeModeCheckBox->isChecked();\n\n    d->setOptions(numWords,appendedDigits,prependedDigits,symbols,cap,complete);\n}\n\nvoid MainWindow::on_drawFactoring_clicked()\n{\n    \/\/set algorithm\n    int algChoice = ui->factorAlgChooser->currentIndex();\n\n    switch(algChoice) {\n    case 0:\n        factorAlg = new BruteForceFactor();\n        break;\n    case 1:\n        \/\/Quadratic sieve here\n        std::cout<<\"Quadratic sieve feature is in progress!\"<<std::endl;\n        return;\n        break;\n    }\n\n    \/\/generate data\n    int beginDigits = ui->startDigitsSpinBox->text().toInt();\n    unsigned int count = ui->dataPointsSpinBox->text().toInt();\n\n    threadFactorData.factorData(beginDigits, count, factorAlg);\n\n    ui->drawFactoring->setDisabled(true);\n}\n\nvoid MainWindow::update_factor_graph() {\n\n    factorDataPoints = threadFactorData.getResult();\n\n    \/\/draw points\n    fg = new GraphWindow(ui->factoringGraphicsView, factorDataPoints);\n    fg->vSize = 600;\n    fg->hSize = 600;\n\n    if(ui->factorLogScaleCheckBox->isChecked()) {\n        fg->logScaleDraw();\n    } else {\n        fg->draw();\n    }\n    fg->addLabels(\"Milliseconds\", \"Number of digits\");\n\n    fg->view->show();\n\n    ui->drawFactoring->setDisabled(false);\n}\n\nvoid MainWindow::on_plotCrackButton_clicked()\n{\n    \/\/grab hashing and cracking algorithms\n\n    switch(ui->hashComboBox->currentIndex()) {\n    case 0:\n        hashAlg = new Md5();\n        break;\n    case 1:\n        hashAlg = new Sha512();\n        break;\n    case 2:\n        hashAlg = new Pbkdf2();\n        break;\n    }\n\n    Crack* c = new Crack();\n    if(hashAlg == NULL) {\n        return;\n    }\n\n    switch(ui->crackTabWidget->currentIndex()) {\n    case 0:\n        {int maxLength = ui->charCountSpinBox->text().toInt();\n        c = new BruteForceCrack(hashAlg,bruteForceAlphabet(), maxLength);\n        break;}\n\n    case 1:\n        {c = new DictionaryCrack(hashAlg, \"..\/dictionary.txt\");\n        break;}\n    }\n\n    \/\/generate data\n    int beginChars = ui->charCountSpinBox_2->text().toInt();\n    int count = ui->crackPointCountSpinBox->text().toInt();\n\n    threadCrackData.crackData(beginChars, count, hashAlg, c);\n\n    ui->plotCrackButton->setEnabled(false);\n}\n\nvoid MainWindow::update_crack_graph() {\n\n    crackDataPoints = threadCrackData.getResult();\n\n    \/\/begin graphing\n    cg = new GraphWindow(ui->crackGraphicsView, crackDataPoints);\n    cg->vSize = 600;\n    cg->hSize = 600;\n\n    if(ui->hashLogScaleCheckBox->isChecked()) {\n        cg->logScaleDraw();\n    } else {\n        cg->draw();\n    }\n    cg->addLabels(\"Milliseconds\", \"Number of characters\");\n\n    cg->view->show();\n\n    ui->plotCrackButton->setEnabled(true);\n}\n\nvoid MainWindow::on_hashLogScaleCheckBox_clicked()\n{\n    if(cg == NULL) {\n        std::cout << \"graphwindow object not initialized. No action to take.\" << std::endl;\n        return;\n    }\n    if(crackDataPoints.size() == 0) {\n        std::cout << \"No points to graph.\" << std::endl;\n        return;\n    }\n\n    cg = new GraphWindow(ui->crackGraphicsView, crackDataPoints);\n    cg->vSize = 600;\n    cg->hSize = 600;\n\n    if(ui->hashLogScaleCheckBox->isChecked()) {\n        cg->logScaleDraw();\n    } else {\n        cg->draw();\n    }\n    cg->addLabels(\"Milliseconds\", \"Number of characters\");\n\n    cg->view->show();\n}\n\nvoid MainWindow::on_factorLogScaleCheckBox_clicked()\n{\n    if(fg == NULL) {\n        std::cout << \"graphwindow object not initialized. No action to take.\" << std::endl;\n        return;\n    }\n    if(factorDataPoints.size() == 0) {\n        std::cout << \"No points to graph.\" << std::endl;\n        return;\n    }\n\n    fg = new GraphWindow(ui->factoringGraphicsView, factorDataPoints);\n    fg->vSize = 600;\n    fg->hSize = 600;\n\n    if(ui->factorLogScaleCheckBox->isChecked()) {\n        fg->logScaleDraw();\n    } else {\n        fg->draw();\n    }\n    fg->addLabels(\"Milliseconds\", \"Number of characters\");\n\n    fg->view->show();\n}\n\nvoid MainWindow::on_cancelCrackButton_clicked()\n{\n    threadCrack.stop();\n}\n\nvoid MainWindow::on_stopFactorPushButton_clicked()\n{\n    threadFactor.stop();\n}\n\nvoid MainWindow::on_HELPBUTTONCLICKED(){\n    bool hi = QDesktopServices::openUrl(QUrl(\"https:\/\/www.google.com\"));\n}\n<commit_msg>Changed the address to our herokuapp<commit_after>#include \"headers\/mainwindow.h\"\n#include \"headers\/cryptogame.h\"\n#include \"ui_mainwindow.h\"\n#include \"QPushButton\"\n#include <QLayoutItem>\n#include <QMessageBox>\n#include <QtConcurrent\/QtConcurrent>\n#include <QFuture>\n#include \"headers\/buttonarray.h\"\n#include \"headers\/labelarray.h\"\n#include <QtWebKit>\n#include <QUrl>\n\n#include \"iostream\" \/\/for debugging\n\nMainWindow::MainWindow(QWidget *parent) :\n    QMainWindow(parent),\n    ui(new Ui::MainWindow)\n{\n    connect(&threadCrack, SIGNAL(finished()), this, SLOT(update_crack_result()));\n    connect(&threadFactor, SIGNAL(finished()), this, SLOT(update_factor_result()));\n    connect(&threadCrackData, SIGNAL(finished()), this, SLOT(update_crack_graph()));\n    connect(&threadFactorData, SIGNAL(finished()), this, SLOT(update_factor_graph()));\n    ui->setupUi(this);\n\n    QAction *act = new QAction(QString(\"Help\"), this);\n\n    connect(act, &QAction::triggered, this, &MainWindow::on_HELPBUTTONCLICKED);\n\n    ui->menuBar->addAction(act);\n\n}\n\nMainWindow::~MainWindow()\n{\n    delete ui;\n\n    if(threadCrack.isRunning()) {\n        threadCrack.quit();\n    }\n    if(threadFactor.isRunning()) {\n        threadFactor.quit();\n    }\n\n    if(factorAlg != NULL) {\n        delete factorAlg;\n    }\n    if(hashAlg != NULL) {\n        delete hashAlg;\n    }\n\n    if(fg != NULL) {\n        delete fg;\n    }\n    if(cg != NULL) {\n        delete cg;\n    }\n}\n\nvoid MainWindow::on_pushButton_clicked()\n{\n\n    \/\/Delete all buttons in the and labels in the gameGrid\n   for(int i=0; i<ui->gameGrid->columnCount(); i++){\n       for(int j = 0; j<ui->gameGrid->rowCount(); j++){\n\n       QLayoutItem *button = ui->gameGrid->itemAtPosition(j,i);\n       if(button){\n           ui->gameGrid->removeItem(button);\n          delete button->widget();\n       }\n\n\n        QLayoutItem *label = ui->gameGrid->itemAtPosition(j,i);\n        if(label){\n            ui->gameGrid->removeItem(label);\n\n            delete label->widget();\n        }\n\n       }\n\n    }\n\n    agame = new cryptogame();\n    QString q = QString::fromStdString(agame->getEncryptedMessage());\n    \/\/ui->label->setText(q);\n    LabelArray *lptr = new LabelArray(q, ui->tabWidget);\n    ButtonArray *buttonPtrs = new ButtonArray(q, ui->tabWidget, agame);\n    int j = 0;\n    int i = 0;\n    int counter = 0;\n    while(counter < q.length()){\n        if(i >= 3 && q.at(counter) == ' '){\n            j += 2;\n            i = 0;\n        } else {\n        ui->gameGrid->addWidget(lptr->get(counter), j, i);\n        ui->gameGrid->addWidget(buttonPtrs->get(counter), j+1, i);\n        i++;\n        }\n        counter++;\n    }\n\n\n}\n\n\nvoid MainWindow::on_pushButton_3_clicked()\n{\n    \/\/Give a hint to the player\n    QMessageBox hintMessage;\n    hintMessage.setText(QString::fromStdString(agame->getHint()));\n    hintMessage.exec();\n}\n\nvoid MainWindow::on_factorPrimesButton_clicked()\n{\n    \/\/reset label text\n    ui->resultLabel->setText(QString::fromStdString(\"Result:\"));\n    ui->timeLabel->setText(QString::fromStdString(\"Time: \"));\n    ui->resultLabel->repaint();\n    ui->timeLabel->repaint();\n\n    \/\/set algorithm\n    int algChoice = ui->factorAlgChooser->currentIndex();\n\n    switch(algChoice) {\n    case 0:{\n        factorAlg = new BruteForceFactor();\n        break;}\n    case 1:{\n        factorAlg = new QSFactor();\n        std::cout<<\"Quadratic sieve feature is in progress!\"<<std::endl;\n        break;}\n    }\n\t\n    mpz_class composite;\n    string s = ui->compositeTextField->text().toStdString();\n    composite.set_str(s, 10);\n\n    threadFactor.setFactor(factorAlg, composite);\n    threadFactor.work();\n\n    ui->factorPrimesButton->setDisabled(true);\n}\n\nvoid MainWindow::update_factor_result() {\n\n    long elapsed = threadFactor.getResult();\n    Factor* pf = threadFactor.getFactor();\n\n    string s = \"Time: \" + std::to_string(elapsed) + \" ms\";\n    ui->timeLabel->setText(QString::fromStdString(s));\n\n    s = \"Result: \" + pf->p1.get_str(10) + \" * \" + pf->p2.get_str(10);\n    ui->resultLabel->setText(QString::fromStdString(s));\n\n    ui->factorPrimesButton->setDisabled(false);\n}\n\nvoid MainWindow::on_random_composite_clicked()\n{\n    mpz_class composite, p, q;\n    GeneratePrimes gp = GeneratePrimes();\n    p = gp.readRandomPrime((char*)\"primes.txt\");\n    q = gp.readRandomPrime((char*)\"primes.txt\");\n    composite = p * q;\n    string s = composite.get_str(10);\n    ui->compositeTextField->setText(QString::fromStdString(s));\n}\n\nvoid MainWindow::on_hashButton_clicked()\n{\n    switch(ui->hashComboBox->currentIndex()) {\n    case 0:\n        hashAlg = new Md5();\n        break;\n    case 1:\n        hashAlg = new Sha512();\n        break;\n    case 2:\n        hashAlg = new Pbkdf2();\n        break;\n    }\n\n    hashAlg->setPlaintext(ui->plaintextField->text());\n\n    if(ui->saltField->text() != \"\") { \/\/if not empty\n        hashAlg->setSalt(ui->saltField->text());\n    }\n    hashAlg->compute();\n    digest = hashAlg->getDigest();\n    ui->digestField->setText(digest);\n\n    \/\/Perhaps make this an option?\n    \/\/hashAlg->salt = \"\";\n}\n\nvoid MainWindow::on_randomSaltButton_clicked()\n{\n    Hash h;\n    h.generateSalt(16);\n    ui->saltField->setText(h.getSalt());\n}\n\nvoid MainWindow::on_crackButton_clicked()\n{\n    \/\/reset label text\n    ui->crackTimeLabel->setText(\"Time: \");\n    ui->crackTimeLabel->repaint();\n    ui->crackedField->setText(\"\");\n    ui->crackedField->repaint();\n\n    Crack* c = new Crack();\n    if(hashAlg == NULL) {\n    \treturn;\n    }\n\n\n    switch(ui->crackTabWidget->currentIndex()) {\n    case 0:\n        {int maxLength = ui->charCountSpinBox->text().toInt();\n        c = new BruteForceCrack(hashAlg,bruteForceAlphabet(), maxLength);\n        break;}\n\n    case 1:\n        {c = new DictionaryCrack(hashAlg, \"..\/dictionary.txt\");\n        dictionaryOptions(c);\n        break;}\n    }\n\n    c->setDigest(digest);\n\n    threadCrack.setCrackType(c);\n    threadCrack.work();\n\n    ui->crackButton->setDisabled(true);\n}\n\nvoid MainWindow::update_crack_result() {\n\n    long elapsed;\n    bool success;\n\n    elapsed = threadCrack.getResult();\n    Crack* c = threadCrack.getCrack();\n    success = c->getPlaintext().length();\n\n\n    if(success) {\n        ui->crackedField->setText(threadCrack.getCrack()->getPlaintext());\n    } else {\n        ui->crackedField->setText(\"\\\"Uncrackable!!\\\"\");\n    }\n\n    string s = \"Time: \" + std::to_string(elapsed) + \" ms\";\n    ui->crackTimeLabel->setText(QString::fromStdString(s));\n\n    ui->crackButton->setDisabled(false);\n}\n\nstd::string MainWindow::bruteForceAlphabet() {\n\n    std::string alph = \" \";\/\/weird bug \"fix\"\n\n    if(ui->customCheckBox->isChecked()) {\n        return ui->alphabetField->text().toStdString();\n    }\n    if(ui->lettersCheckBox->isChecked()) {\n        alph += \"abcdefghijklmnopqrstuvwxyz\";\n    }\n    if(ui->upCaseCheckBox->isChecked()) {\n        alph += \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n    }\n    if(ui->numbersCheckBox->isChecked()) {\n        alph += \"1234567890\";\n    }\n    if(ui->symbolsCheckBox->isChecked()) {\n        alph += \"`~!@#$%^&*()_+-=,.<>\/?'[]{}\";\n    }\n    return alph;\n}\n\nvoid MainWindow::dictionaryOptions(Crack* d) {\n\n    unsigned int numWords = ui->wordCountSpinBox->text().toInt();\n    unsigned int appendedDigits = 0;\n    if(ui->appendCheckBox->isChecked()) {\n        appendedDigits = ui->digitCountSpinBox->text().toInt();\n    }\n    unsigned int prependedDigits = 0;\n    if(ui->prependCheckBox->isChecked()) {\n        prependedDigits = ui->digitCountSpinBox->text().toInt();\n    }\n\n    bool cap = ui->capCheckBox->isChecked();\n    bool symbols = ui->dictSymbolsCheckBox->isChecked();\n    bool complete = ui->completeModeCheckBox->isChecked();\n\n    d->setOptions(numWords,appendedDigits,prependedDigits,symbols,cap,complete);\n}\n\nvoid MainWindow::on_drawFactoring_clicked()\n{\n    \/\/set algorithm\n    int algChoice = ui->factorAlgChooser->currentIndex();\n\n    switch(algChoice) {\n    case 0:\n        factorAlg = new BruteForceFactor();\n        break;\n    case 1:\n        \/\/Quadratic sieve here\n        std::cout<<\"Quadratic sieve feature is in progress!\"<<std::endl;\n        return;\n        break;\n    }\n\n    \/\/generate data\n    int beginDigits = ui->startDigitsSpinBox->text().toInt();\n    unsigned int count = ui->dataPointsSpinBox->text().toInt();\n\n    threadFactorData.factorData(beginDigits, count, factorAlg);\n\n    ui->drawFactoring->setDisabled(true);\n}\n\nvoid MainWindow::update_factor_graph() {\n\n    factorDataPoints = threadFactorData.getResult();\n\n    \/\/draw points\n    fg = new GraphWindow(ui->factoringGraphicsView, factorDataPoints);\n    fg->vSize = 600;\n    fg->hSize = 600;\n\n    if(ui->factorLogScaleCheckBox->isChecked()) {\n        fg->logScaleDraw();\n    } else {\n        fg->draw();\n    }\n    fg->addLabels(\"Milliseconds\", \"Number of digits\");\n\n    fg->view->show();\n\n    ui->drawFactoring->setDisabled(false);\n}\n\nvoid MainWindow::on_plotCrackButton_clicked()\n{\n    \/\/grab hashing and cracking algorithms\n\n    switch(ui->hashComboBox->currentIndex()) {\n    case 0:\n        hashAlg = new Md5();\n        break;\n    case 1:\n        hashAlg = new Sha512();\n        break;\n    case 2:\n        hashAlg = new Pbkdf2();\n        break;\n    }\n\n    Crack* c = new Crack();\n    if(hashAlg == NULL) {\n        return;\n    }\n\n    switch(ui->crackTabWidget->currentIndex()) {\n    case 0:\n        {int maxLength = ui->charCountSpinBox->text().toInt();\n        c = new BruteForceCrack(hashAlg,bruteForceAlphabet(), maxLength);\n        break;}\n\n    case 1:\n        {c = new DictionaryCrack(hashAlg, \"..\/dictionary.txt\");\n        break;}\n    }\n\n    \/\/generate data\n    int beginChars = ui->charCountSpinBox_2->text().toInt();\n    int count = ui->crackPointCountSpinBox->text().toInt();\n\n    threadCrackData.crackData(beginChars, count, hashAlg, c);\n\n    ui->plotCrackButton->setEnabled(false);\n}\n\nvoid MainWindow::update_crack_graph() {\n\n    crackDataPoints = threadCrackData.getResult();\n\n    \/\/begin graphing\n    cg = new GraphWindow(ui->crackGraphicsView, crackDataPoints);\n    cg->vSize = 600;\n    cg->hSize = 600;\n\n    if(ui->hashLogScaleCheckBox->isChecked()) {\n        cg->logScaleDraw();\n    } else {\n        cg->draw();\n    }\n    cg->addLabels(\"Milliseconds\", \"Number of characters\");\n\n    cg->view->show();\n\n    ui->plotCrackButton->setEnabled(true);\n}\n\nvoid MainWindow::on_hashLogScaleCheckBox_clicked()\n{\n    if(cg == NULL) {\n        std::cout << \"graphwindow object not initialized. No action to take.\" << std::endl;\n        return;\n    }\n    if(crackDataPoints.size() == 0) {\n        std::cout << \"No points to graph.\" << std::endl;\n        return;\n    }\n\n    cg = new GraphWindow(ui->crackGraphicsView, crackDataPoints);\n    cg->vSize = 600;\n    cg->hSize = 600;\n\n    if(ui->hashLogScaleCheckBox->isChecked()) {\n        cg->logScaleDraw();\n    } else {\n        cg->draw();\n    }\n    cg->addLabels(\"Milliseconds\", \"Number of characters\");\n\n    cg->view->show();\n}\n\nvoid MainWindow::on_factorLogScaleCheckBox_clicked()\n{\n    if(fg == NULL) {\n        std::cout << \"graphwindow object not initialized. No action to take.\" << std::endl;\n        return;\n    }\n    if(factorDataPoints.size() == 0) {\n        std::cout << \"No points to graph.\" << std::endl;\n        return;\n    }\n\n    fg = new GraphWindow(ui->factoringGraphicsView, factorDataPoints);\n    fg->vSize = 600;\n    fg->hSize = 600;\n\n    if(ui->factorLogScaleCheckBox->isChecked()) {\n        fg->logScaleDraw();\n    } else {\n        fg->draw();\n    }\n    fg->addLabels(\"Milliseconds\", \"Number of characters\");\n\n    fg->view->show();\n}\n\nvoid MainWindow::on_cancelCrackButton_clicked()\n{\n    threadCrack.stop();\n}\n\nvoid MainWindow::on_stopFactorPushButton_clicked()\n{\n    threadFactor.stop();\n}\n\nvoid MainWindow::on_HELPBUTTONCLICKED(){\n    bool hi = QDesktopServices::openUrl(QUrl(\"https:\/\/cryptowiki.herokuapp.com\/\"));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"generic.h\"\n\ngeneric_device::generic_device(std::vector<gen_source_event>& inevents, int fd, bool watch, slot_manager* slot_man, device_manager* manager, input_source::devtype type) : input_source(slot_man, manager, type) {\n  this->fd = fd;\n  for (int i = 0; i < inevents.size(); i++) {\n    source_event ev;\n    input_absinfo     abs;\n    memset(&abs, 0, sizeof(abs));\n    ev.id = i;\n    ev.name = inevents.at(i).name.c_str();\n    ev.descr = inevents.at(i).descr.c_str();\n    ev.type = inevents.at(i).type;\n    ev.value = 0;\n    ev.trans = nullptr;\n    register_event(ev);\n\n    int type = EV_KEY;\n    if (ev.type == DEV_AXIS) type = EV_ABS;\n    if (ev.type == DEV_REL)  type = EV_REL;\n\n    evcode code(type, inevents.at(i).id);\n    if (ev.type == DEV_AXIS) {\n      if (ioctl(fd, EVIOCGABS(inevents.at(i).id), &abs)) {\n        perror(\"evdev EVIOCGABS ioctl\");\n      }\n    }\n    decodedevent decoded(i, abs);\n    eventcodes.insert(std::pair<evcode, decodedevent>(code, decoded));\n  }\n\n  if (watch) watch_file(fd, &fd);\n}\n\ngeneric_device::~generic_device() {\n  if (node) udev_device_unref(node);\n  free(nameptr);\n}\n\nint generic_device::set_player(int player_num) {};\n\n\nvoid generic_device::list_events(cat_list& list) {\n  struct category cat;\n  struct name_descr info;\n\n  cat.name = \"Generic\";\n  for (int i = 0; i < events.size(); i++) {\n    info.name = events[i].name;\n    info.descr = events[i].descr;\n    info.data = events[i].type;\n    cat.entries.push_back(info);\n  }\n\n  list.push_back(cat);\n  cat.entries.clear();\n}\n\nvoid generic_device::list_options(name_list& list) {};\n\n\nvoid generic_device::update_option(const char* opname, const char* value) {};\n\nenum entry_type generic_device::entry_type(const char* name) {\n  auto alias = aliases.find(std::string(name));\n  if (alias != aliases.end())\n    name = alias->second.c_str();\n  for (auto ev : events) {\n    if (!strcmp(ev.name, name)) return ev.type;\n  }\n  return NO_ENTRY;\n}\n\nvoid generic_device::process(void* tag) {\n  struct input_event ev;\n  int file = fd;\n  if (pipe_read >= 0 && tag == &pipe_read) {\n    file = pipe_read;\n  };\n  int ret = read(file, &ev, sizeof(ev));\n  if (ret > 0) {\n    if (ev.type == EV_SYN && out_dev) {\n      out_dev->take_event(ev);\n      return;\n    }\n    evcode code(ev.type, ev.code);\n    auto it = eventcodes.find(code);\n    if (it == eventcodes.end()) return;\n    decodedevent decoded = it->second;\n    int id = decoded.first;\n    if (ev.type == EV_KEY) {\n      send_value(id, ev.value);\n    }\n    if (ev.type == EV_ABS) {\n      \/\/do some ABS rescaling.\n      \/\/currently ignoring old deadzone (\"flat\")\n      input_absinfo info = decoded.second;\n      int value = ev.value;\n      int oldscale = info.maximum - info.minimum;\n      if (oldscale == 0) {\n        send_value(id, value);\n        return;\n      }\n      int newscale = 2 * ABS_RANGE;\n      long long int scaledvalue = -ABS_RANGE + (value - info.minimum) * newscale \/ oldscale;\n      send_value(id, scaledvalue);\n    }\n  }\n}\n\nint generic_device::get_pipe() {\n  if (pipe_write >= 0) return pipe_write;\n  int internal[2];\n  pipe(internal);\n  watch_file(internal[0], &pipe_read);\n  pipe_write = internal[1];\n  pipe_read = internal[0];\n\n  return pipe_write;\n}\n\n\n<commit_msg>hotfix to avoid some gendev overflow<commit_after>#include \"generic.h\"\n\ngeneric_device::generic_device(std::vector<gen_source_event>& inevents, int fd, bool watch, slot_manager* slot_man, device_manager* manager, input_source::devtype type) : input_source(slot_man, manager, type) {\n  this->fd = fd;\n  for (int i = 0; i < inevents.size(); i++) {\n    source_event ev;\n    input_absinfo     abs;\n    memset(&abs, 0, sizeof(abs));\n    ev.id = i;\n    ev.name = inevents.at(i).name.c_str();\n    ev.descr = inevents.at(i).descr.c_str();\n    ev.type = inevents.at(i).type;\n    ev.value = 0;\n    ev.trans = nullptr;\n    register_event(ev);\n\n    int type = EV_KEY;\n    if (ev.type == DEV_AXIS) type = EV_ABS;\n    if (ev.type == DEV_REL)  type = EV_REL;\n\n    evcode code(type, inevents.at(i).id);\n    if (ev.type == DEV_AXIS) {\n      if (ioctl(fd, EVIOCGABS(inevents.at(i).id), &abs)) {\n        perror(\"evdev EVIOCGABS ioctl\");\n      }\n    }\n    decodedevent decoded(i, abs);\n    eventcodes.insert(std::pair<evcode, decodedevent>(code, decoded));\n  }\n\n  if (watch) watch_file(fd, &fd);\n}\n\ngeneric_device::~generic_device() {\n  if (node) udev_device_unref(node);\n  free(nameptr);\n}\n\nint generic_device::set_player(int player_num) {};\n\n\nvoid generic_device::list_events(cat_list& list) {\n  struct category cat;\n  struct name_descr info;\n\n  cat.name = \"Generic\";\n  for (int i = 0; i < events.size(); i++) {\n    info.name = events[i].name;\n    info.descr = events[i].descr;\n    info.data = events[i].type;\n    cat.entries.push_back(info);\n  }\n\n  list.push_back(cat);\n  cat.entries.clear();\n}\n\nvoid generic_device::list_options(name_list& list) {};\n\n\nvoid generic_device::update_option(const char* opname, const char* value) {};\n\nenum entry_type generic_device::entry_type(const char* name) {\n  auto alias = aliases.find(std::string(name));\n  if (alias != aliases.end())\n    name = alias->second.c_str();\n  for (auto ev : events) {\n    if (!strcmp(ev.name, name)) return ev.type;\n  }\n  return NO_ENTRY;\n}\n\nvoid generic_device::process(void* tag) {\n  struct input_event ev;\n  int file = fd;\n  if (pipe_read >= 0 && tag == &pipe_read) {\n    file = pipe_read;\n  };\n  int ret = read(file, &ev, sizeof(ev));\n  if (ret > 0) {\n    if (ev.type == EV_SYN && out_dev) {\n      out_dev->take_event(ev);\n      return;\n    }\n    evcode code(ev.type, ev.code);\n    auto it = eventcodes.find(code);\n    if (it == eventcodes.end()) return;\n    decodedevent decoded = it->second;\n    int id = decoded.first;\n    if (ev.type == EV_KEY) {\n      send_value(id, ev.value);\n    }\n    if (ev.type == EV_ABS) {\n      \/\/do some ABS rescaling.\n      \/\/currently ignoring old deadzone (\"flat\")\n      input_absinfo info = decoded.second;\n      int value = ev.value;\n      long long int oldscale = info.maximum - info.minimum;\n      if (oldscale == 0) {\n        send_value(id, value);\n        return;\n      }\n      long long int newscale = 2 * ABS_RANGE;\n      long long int scaledvalue = -ABS_RANGE + (value - info.minimum) * newscale \/ oldscale;\n      send_value(id, scaledvalue);\n    }\n  }\n}\n\nint generic_device::get_pipe() {\n  if (pipe_write >= 0) return pipe_write;\n  int internal[2];\n  pipe(internal);\n  watch_file(internal[0], &pipe_read);\n  pipe_write = internal[1];\n  pipe_read = internal[0];\n\n  return pipe_write;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* GCM Mode Encryption\n* (C) 2013,2015 Jack Lloyd\n* (C) 2016 Daniel Neus, Rohde & Schwarz Cybersecurity\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/gcm.h>\n#include <botan\/ghash.h>\n#include <botan\/block_cipher.h>\n#include <botan\/ctr.h>\n\nnamespace Botan {\n\n\/*\n* GCM_Mode Constructor\n*\/\nGCM_Mode::GCM_Mode(BlockCipher* cipher, size_t tag_size) :\n   m_tag_size(tag_size),\n   m_cipher_name(cipher->name())\n   {\n   if(cipher->block_size() != GCM_BS)\n      throw Invalid_Argument(\"Invalid block cipher for GCM\");\n\n   m_ghash.reset(new GHASH);\n\n   m_ctr.reset(new CTR_BE(cipher, 4)); \/\/ CTR_BE takes ownership of cipher\n\n   \/* We allow any of the values 128, 120, 112, 104, or 96 bits as a tag size *\/\n   \/* 64 bit tag is still supported but deprecated and will be removed in the future *\/\n   if(m_tag_size != 8 && (m_tag_size < 12 || m_tag_size > 16))\n      throw Invalid_Argument(name() + \": Bad tag size \" + std::to_string(m_tag_size));\n   }\n\nGCM_Mode::~GCM_Mode() { \/* for unique_ptr *\/ }\n\nvoid GCM_Mode::clear()\n   {\n   m_ctr->clear();\n   m_ghash->clear();\n   reset();\n   }\n\nvoid GCM_Mode::reset()\n   {\n   m_ghash->reset();\n   }\n\nstd::string GCM_Mode::name() const\n   {\n   return (m_cipher_name + \"\/GCM(\" + std::to_string(tag_size()) + \")\");\n   }\n\nstd::string GCM_Mode::provider() const\n   {\n   return m_ghash->provider();\n   }\n\nsize_t GCM_Mode::update_granularity() const\n   {\n   return GCM_BS * std::max<size_t>(2, BOTAN_BLOCK_CIPHER_PAR_MULT);\n   }\n\nbool GCM_Mode::valid_nonce_length(size_t len) const\n   {\n   \/\/ GCM does not support empty nonces\n   return (len > 0);\n   }\n\nKey_Length_Specification GCM_Mode::key_spec() const\n   {\n   return m_ctr->key_spec();\n   }\n\nvoid GCM_Mode::key_schedule(const uint8_t key[], size_t keylen)\n   {\n   m_ctr->set_key(key, keylen);\n\n   const std::vector<uint8_t> zeros(GCM_BS);\n   m_ctr->set_iv(zeros.data(), zeros.size());\n\n   secure_vector<uint8_t> H(GCM_BS);\n   m_ctr->encipher(H);\n   m_ghash->set_key(H);\n   }\n\nvoid GCM_Mode::set_associated_data(const uint8_t ad[], size_t ad_len)\n   {\n   m_ghash->set_associated_data(ad, ad_len);\n   }\n\nvoid GCM_Mode::start_msg(const uint8_t nonce[], size_t nonce_len)\n   {\n   if(!valid_nonce_length(nonce_len))\n      throw Invalid_IV_Length(name(), nonce_len);\n\n   m_y0.resize(GCM_BS);\n\n   if(nonce_len == 12)\n      {\n      copy_mem(m_y0.data(), nonce, nonce_len);\n      m_y0[15] = 1;\n      }\n   else\n      {\n      m_ghash->nonce_hash(m_y0, nonce, nonce_len);\n      }\n\n   m_ctr->set_iv(m_y0.data(), m_y0.size());\n\n   zeroise(m_y0);\n   m_ctr->encipher(m_y0);\n\n   m_ghash->start(m_y0.data(), m_y0.size());\n   m_y0.clear();\n   }\n\nsize_t GCM_Encryption::process(uint8_t buf[], size_t sz)\n   {\n   BOTAN_ARG_CHECK(sz % update_granularity() == 0, \"Invalid buffer size\");\n   m_ctr->cipher(buf, buf, sz);\n   m_ghash->update(buf, sz);\n   return sz;\n   }\n\nvoid GCM_Encryption::finish(secure_vector<uint8_t>& buffer, size_t offset)\n   {\n   BOTAN_ARG_CHECK(offset <= buffer.size(), \"Invalid offset\");\n   const size_t sz = buffer.size() - offset;\n   uint8_t* buf = buffer.data() + offset;\n\n   m_ctr->cipher(buf, buf, sz);\n   m_ghash->update(buf, sz);\n\n   uint8_t mac[16] = { 0 };\n   m_ghash->final(mac, tag_size());\n   buffer += std::make_pair(mac, tag_size());\n   }\n\nsize_t GCM_Decryption::process(uint8_t buf[], size_t sz)\n   {\n   BOTAN_ARG_CHECK(sz % update_granularity() == 0, \"Invalid buffer size\");\n   m_ghash->update(buf, sz);\n   m_ctr->cipher(buf, buf, sz);\n   return sz;\n   }\n\nvoid GCM_Decryption::finish(secure_vector<uint8_t>& buffer, size_t offset)\n   {\n   BOTAN_ARG_CHECK(offset <= buffer.size(), \"Invalid offset\");\n   const size_t sz = buffer.size() - offset;\n   uint8_t* buf = buffer.data() + offset;\n\n   if(sz < tag_size())\n      throw Decoding_Error(\"Insufficient input for GCM decryption, tag missing\");\n\n   const size_t remaining = sz - tag_size();\n\n   \/\/ handle any final input before the tag\n   if(remaining)\n      {\n      m_ghash->update(buf, remaining);\n      m_ctr->cipher(buf, buf, remaining);\n      }\n\n   uint8_t mac[16] = { 0 };\n   m_ghash->final(mac, tag_size());\n\n   const uint8_t* included_tag = &buffer[remaining+offset];\n\n   if(!constant_time_compare(mac, included_tag, tag_size()))\n      throw Invalid_Authentication_Tag(\"GCM tag check failed\");\n\n   buffer.resize(offset + remaining);\n   }\n\n}\n<commit_msg>Very minor GCM optimization<commit_after>\/*\n* GCM Mode Encryption\n* (C) 2013,2015 Jack Lloyd\n* (C) 2016 Daniel Neus, Rohde & Schwarz Cybersecurity\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/gcm.h>\n#include <botan\/ghash.h>\n#include <botan\/block_cipher.h>\n#include <botan\/ctr.h>\n\nnamespace Botan {\n\n\/*\n* GCM_Mode Constructor\n*\/\nGCM_Mode::GCM_Mode(BlockCipher* cipher, size_t tag_size) :\n   m_tag_size(tag_size),\n   m_cipher_name(cipher->name())\n   {\n   if(cipher->block_size() != GCM_BS)\n      throw Invalid_Argument(\"Invalid block cipher for GCM\");\n\n   m_ghash.reset(new GHASH);\n\n   m_ctr.reset(new CTR_BE(cipher, 4)); \/\/ CTR_BE takes ownership of cipher\n\n   \/* We allow any of the values 128, 120, 112, 104, or 96 bits as a tag size *\/\n   \/* 64 bit tag is still supported but deprecated and will be removed in the future *\/\n   if(m_tag_size != 8 && (m_tag_size < 12 || m_tag_size > 16))\n      throw Invalid_Argument(name() + \": Bad tag size \" + std::to_string(m_tag_size));\n   }\n\nGCM_Mode::~GCM_Mode() { \/* for unique_ptr *\/ }\n\nvoid GCM_Mode::clear()\n   {\n   m_ctr->clear();\n   m_ghash->clear();\n   reset();\n   }\n\nvoid GCM_Mode::reset()\n   {\n   m_ghash->reset();\n   }\n\nstd::string GCM_Mode::name() const\n   {\n   return (m_cipher_name + \"\/GCM(\" + std::to_string(tag_size()) + \")\");\n   }\n\nstd::string GCM_Mode::provider() const\n   {\n   return m_ghash->provider();\n   }\n\nsize_t GCM_Mode::update_granularity() const\n   {\n   return GCM_BS * std::max<size_t>(2, BOTAN_BLOCK_CIPHER_PAR_MULT);\n   }\n\nbool GCM_Mode::valid_nonce_length(size_t len) const\n   {\n   \/\/ GCM does not support empty nonces\n   return (len > 0);\n   }\n\nKey_Length_Specification GCM_Mode::key_spec() const\n   {\n   return m_ctr->key_spec();\n   }\n\nvoid GCM_Mode::key_schedule(const uint8_t key[], size_t keylen)\n   {\n   m_ctr->set_key(key, keylen);\n\n   const std::vector<uint8_t> zeros(GCM_BS);\n   m_ctr->set_iv(zeros.data(), zeros.size());\n\n   secure_vector<uint8_t> H(GCM_BS);\n   m_ctr->encipher(H);\n   m_ghash->set_key(H);\n   }\n\nvoid GCM_Mode::set_associated_data(const uint8_t ad[], size_t ad_len)\n   {\n   m_ghash->set_associated_data(ad, ad_len);\n   }\n\nvoid GCM_Mode::start_msg(const uint8_t nonce[], size_t nonce_len)\n   {\n   if(!valid_nonce_length(nonce_len))\n      throw Invalid_IV_Length(name(), nonce_len);\n\n   if(m_y0.size() != GCM_BS)\n      m_y0.resize(GCM_BS);\n\n   clear_mem(m_y0.data(), m_y0.size());\n\n   if(nonce_len == 12)\n      {\n      copy_mem(m_y0.data(), nonce, nonce_len);\n      m_y0[15] = 1;\n      }\n   else\n      {\n      m_ghash->nonce_hash(m_y0, nonce, nonce_len);\n      }\n\n   m_ctr->set_iv(m_y0.data(), m_y0.size());\n\n   clear_mem(m_y0.data(), m_y0.size());\n   m_ctr->encipher(m_y0);\n\n   m_ghash->start(m_y0.data(), m_y0.size());\n   clear_mem(m_y0.data(), m_y0.size());\n   }\n\nsize_t GCM_Encryption::process(uint8_t buf[], size_t sz)\n   {\n   BOTAN_ARG_CHECK(sz % update_granularity() == 0, \"Invalid buffer size\");\n   m_ctr->cipher(buf, buf, sz);\n   m_ghash->update(buf, sz);\n   return sz;\n   }\n\nvoid GCM_Encryption::finish(secure_vector<uint8_t>& buffer, size_t offset)\n   {\n   BOTAN_ARG_CHECK(offset <= buffer.size(), \"Invalid offset\");\n   const size_t sz = buffer.size() - offset;\n   uint8_t* buf = buffer.data() + offset;\n\n   m_ctr->cipher(buf, buf, sz);\n   m_ghash->update(buf, sz);\n\n   uint8_t mac[16] = { 0 };\n   m_ghash->final(mac, tag_size());\n   buffer += std::make_pair(mac, tag_size());\n   }\n\nsize_t GCM_Decryption::process(uint8_t buf[], size_t sz)\n   {\n   BOTAN_ARG_CHECK(sz % update_granularity() == 0, \"Invalid buffer size\");\n   m_ghash->update(buf, sz);\n   m_ctr->cipher(buf, buf, sz);\n   return sz;\n   }\n\nvoid GCM_Decryption::finish(secure_vector<uint8_t>& buffer, size_t offset)\n   {\n   BOTAN_ARG_CHECK(offset <= buffer.size(), \"Invalid offset\");\n   const size_t sz = buffer.size() - offset;\n   uint8_t* buf = buffer.data() + offset;\n\n   if(sz < tag_size())\n      throw Decoding_Error(\"Insufficient input for GCM decryption, tag missing\");\n\n   const size_t remaining = sz - tag_size();\n\n   \/\/ handle any final input before the tag\n   if(remaining)\n      {\n      m_ghash->update(buf, remaining);\n      m_ctr->cipher(buf, buf, remaining);\n      }\n\n   uint8_t mac[16] = { 0 };\n   m_ghash->final(mac, tag_size());\n\n   const uint8_t* included_tag = &buffer[remaining+offset];\n\n   if(!constant_time_compare(mac, included_tag, tag_size()))\n      throw Invalid_Authentication_Tag(\"GCM tag check failed\");\n\n   buffer.resize(offset + remaining);\n   }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2016 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 <algorithm>\n#include \"kernel\/type_checker.h\"\n#include \"kernel\/replace_fn.h\"\n#include \"library\/locals.h\"\n#include \"library\/placeholder.h\"\n#include \"library\/module.h\"\n#include \"library\/trace.h\"\n#include \"library\/aux_definition.h\"\n#include \"library\/unfold_macros.h\"\n#include \"library\/replace_visitor_with_tc.h\"\n\nnamespace lean {\nlevel closure_helper::collect(level const & l) {\n    lean_assert(!m_finalized_collection);\n    return replace(l, [&](level const & l) {\n            if (is_meta(l)) {\n                name const & id = meta_id(l);\n                if (auto r = m_univ_meta_to_param.find(id)) {\n                    return some_level(*r);\n                } else {\n                    name n      = m_prefix.append_after(m_next_idx);\n                    m_next_idx++;\n                    level new_r = mk_param_univ(n);\n                    m_univ_meta_to_param.insert(id, new_r);\n                    m_univ_meta_to_param_inv.insert(n, l);\n                    m_level_params.push_back(n);\n                    return some_level(new_r);\n                }\n            } else if (is_param(l)) {\n                lean_assert(!is_placeholder(l));\n                name const & id = param_id(l);\n                if (!m_found_univ_params.contains(id)) {\n                    m_found_univ_params.insert(id);\n                    m_level_params.push_back(id);\n                }\n            }\n            return none_level();\n        });\n}\n\nlevels closure_helper::collect(levels const & ls) {\n    lean_assert(!m_finalized_collection);\n    bool modified = false;\n    buffer<level> r;\n    for (level const & l : ls) {\n        level new_l = collect(l);\n        if (new_l != l) modified = true;\n        r.push_back(new_l);\n    }\n    if (!modified)\n        return ls;\n    else\n        return to_list(r);\n}\n\nexpr closure_helper::collect(expr const & e) {\n    lean_assert(!m_finalized_collection);\n    return replace(e, [&](expr const & e, unsigned) {\n            if (is_metavar(e)) {\n                name const & id = mlocal_name(e);\n                if (auto r = m_meta_to_param.find(id)) {\n                    return some_expr(*r);\n                } else {\n                    expr type  = m_ctx.infer(e);\n                    expr x     = m_ctx.push_local(\"_x\", type);\n                    m_meta_to_param.insert(id, x);\n                    m_meta_to_param_inv.insert(mlocal_name(x), e);\n                    m_params.push_back(x);\n                    return some_expr(x);\n                }\n            } else if (is_local(e)) {\n                name const & id = mlocal_name(e);\n                if (!m_found_local.contains(id)) {\n                    m_found_local.insert(id);\n                    m_params.push_back(e);\n                }\n            } else if (is_sort(e)) {\n                return some_expr(update_sort(e, collect(sort_level(e))));\n            } else if (is_constant(e)) {\n                return some_expr(update_constant(e, collect(const_levels(e))));\n            }\n            return none_expr();\n        });\n}\n\nvoid closure_helper::finalize_collection() {\n    lean_assert(!m_finalized_collection);\n    name_map<expr> new_types;\n    for (unsigned i = 0; i < m_params.size(); i++) {\n        expr x = m_params[i];\n        expr new_type = collect(zeta_expand(m_ctx.lctx(), m_ctx.instantiate_mvars(m_ctx.infer(x))));\n        new_types.insert(mlocal_name(x), new_type);\n    }\n    local_context const & lctx = m_ctx.lctx();\n    std::sort(m_params.begin(), m_params.end(), [&](expr const & l1, expr const & l2) {\n            return lctx.get_local_decl(l1).get_idx() < lctx.get_local_decl(l2).get_idx();\n        });\n    for (unsigned i = 0; i < m_params.size(); i++) {\n        expr x         = m_params[i];\n        expr type      = *new_types.find(mlocal_name(x));\n        expr new_type  = replace_locals(type, i, m_params.data(), m_norm_params.data());\n        expr new_param = m_ctx.push_local(mlocal_pp_name(x), new_type, local_info(x));\n        m_norm_params.push_back(new_param);\n    }\n    m_finalized_collection = true;\n}\n\nexpr closure_helper::mk_pi_closure(expr const & e) {\n    lean_assert(m_finalized_collection);\n    expr new_e  = replace_locals(e, m_params, m_norm_params);\n    return m_ctx.mk_pi(m_norm_params, new_e);\n}\n\nexpr closure_helper::mk_lambda_closure(expr const & e) {\n    lean_assert(m_finalized_collection);\n    expr new_e  = replace_locals(e, m_params, m_norm_params);\n    return m_ctx.mk_lambda(m_norm_params, new_e);\n}\n\nvoid closure_helper::get_level_closure(buffer<level> & ls) {\n    lean_assert(m_finalized_collection);\n    for (name const & n : m_level_params) {\n        if (level const * l = m_univ_meta_to_param_inv.find(n))\n            ls.push_back(*l);\n        else\n            ls.push_back(mk_param_univ(n));\n    }\n}\n\nvoid closure_helper::get_expr_closure(buffer<expr> & ps) {\n    lean_assert(m_finalized_collection);\n    for (expr const & x : m_params) {\n        if (expr const * m = m_meta_to_param_inv.find(mlocal_name(x)))\n            ps.push_back(*m);\n        else\n            ps.push_back(x);\n    }\n}\n\nbuffer<expr> const & closure_helper::get_norm_closure_params() const {\n    lean_assert(m_finalized_collection);\n    return m_norm_params;\n}\n\nstruct mk_aux_definition_fn : public closure_helper {\n    mk_aux_definition_fn(type_context & ctx):closure_helper(ctx) {}\n\n    pair<environment, expr> operator()(name const & c, expr const & type, expr const & value, bool is_lemma, optional<bool> const & is_meta) {\n        lean_assert(!is_lemma || is_meta);\n        lean_assert(!is_lemma || *is_meta == false);\n        expr new_type  = collect(ctx().instantiate_mvars(type));\n        expr new_value = collect(ctx().instantiate_mvars(value));\n        environment env = ctx().env();\n        finalize_collection();\n        expr def_type  = mk_pi_closure(new_type);\n        expr def_value = mk_lambda_closure(new_value);\n        bool untrusted = false;\n        if (is_meta)\n            untrusted = *is_meta;\n        else\n            untrusted = use_untrusted(env, def_type) || use_untrusted(env, def_value);\n        if (!untrusted) {\n            def_type  = unfold_untrusted_macros(env, def_type);\n            def_value = unfold_untrusted_macros(env, def_value);\n        }\n        declaration d;\n        if (is_lemma) {\n            d = mk_theorem(c, get_norm_level_names(), def_type, def_value);\n        } else {\n            bool use_self_opt = true;\n            d = mk_definition(env, c, get_norm_level_names(), def_type, def_value, use_self_opt, !untrusted);\n        }\n        environment new_env = module::add(env, check(env, d, true));\n        buffer<level> ls;\n        get_level_closure(ls);\n        buffer<expr> ps;\n        get_expr_closure(ps);\n        expr r = mk_app(mk_constant(c, to_list(ls)), ps);\n        return mk_pair(new_env, r);\n    }\n};\n\npair<environment, expr> mk_aux_definition(environment const & env, metavar_context const & mctx, local_context const & lctx,\n                                          name const & c, expr const & type, expr const & value, optional<bool> const & is_meta) {\n    type_context ctx(env, options(), mctx, lctx, transparency_mode::All);\n    bool is_lemma = false;\n    return mk_aux_definition_fn(ctx)(c, type, value, is_lemma, is_meta);\n}\n\npair<environment, expr> mk_aux_definition(environment const & env, metavar_context const & mctx, local_context const & lctx,\n                                          name const & c, expr const & value, optional<bool> const & is_meta) {\n    type_context ctx(env, options(), mctx, lctx, transparency_mode::All);\n    expr type     = ctx.infer(value);\n    bool is_lemma = false;\n    return mk_aux_definition_fn(ctx)(c, type, value, is_lemma, is_meta);\n}\n\npair<environment, expr> mk_aux_lemma(environment const & env, metavar_context const & mctx, local_context const & lctx,\n                                     name const & c, expr const & type, expr const & value) {\n    type_context ctx(env, options(), mctx, lctx, transparency_mode::All);\n    bool is_lemma = true;\n    optional<bool> is_meta(false);\n    return mk_aux_definition_fn(ctx)(c, type, value, is_lemma, is_meta);\n}\n\nstruct abstract_nested_proofs_fn : public replace_visitor_with_tc {\n    name     m_base_name;\n    unsigned m_idx{1};\n\n    abstract_nested_proofs_fn(type_context & ctx, name const & b):\n        replace_visitor_with_tc(ctx),\n        m_base_name(b, \"_proof\") {\n    }\n\n    static bool is_atomic(expr const & e) {\n        return is_constant(e) || is_local(e);\n    }\n\n    name mk_name() {\n        environment env = m_ctx.env();\n        while (true) {\n            name curr = m_base_name.append_after(m_idx);\n            m_idx++;\n            if (!env.find(curr)) {\n                m_ctx.set_env(env);\n                return curr;\n            }\n        }\n    }\n\n    optional<expr> is_non_trivial_proof(expr const & e) {\n        if (is_atomic(e))\n            return none_expr();\n        if (is_pi(e) || is_sort(e))\n            return none_expr();\n        expr type = m_ctx.infer(e);\n        if (!m_ctx.is_prop(type))\n            return none_expr();\n        if (is_app(e)) {\n            buffer<expr> args;\n            expr const & fn = get_app_args(e, args);\n            if (!is_atomic(fn))\n                return some_expr(type);\n            for (expr const & arg : args) {\n                if (!is_atomic(arg))\n                    return some_expr(type);\n            }\n            return none_expr();\n        } else {\n            return some_expr(type);\n        }\n    }\n\n    virtual expr visit_mlocal(expr const & e) override {\n        return e;\n    }\n\n    virtual expr visit(expr const & e) override {\n        if (auto type = is_non_trivial_proof(e)) {\n            expr new_e = zeta_expand(m_ctx.lctx(), e);\n            if (e != new_e) {\n                *type = m_ctx.infer(new_e);\n            }\n            name n = mk_name();\n            auto new_env_new_e = mk_aux_lemma(m_ctx.env(), m_ctx.mctx(), m_ctx.lctx(), n, *type, new_e);\n            m_ctx.set_env(new_env_new_e.first);\n            return new_env_new_e.second;\n        } else {\n            return replace_visitor_with_tc::visit(e);\n        }\n    }\n\n    pair<environment, expr> operator()(expr const & e) {\n        expr new_e = replace_visitor_with_tc::operator()(e);\n        return mk_pair(m_ctx.env(), new_e);\n    }\n};\n\npair<environment, expr> abstract_nested_proofs(environment const & env, metavar_context const & mctx, local_context const & lctx, name const & base_name, expr const & e) {\n    type_context ctx(env, options(), mctx, lctx, transparency_mode::Semireducible);\n    return abstract_nested_proofs_fn(ctx, base_name)(e);\n}\n\npair<environment, expr> abstract_nested_proofs(environment const & env, name const & base_name, expr const & e) {\n    lean_assert(!has_metavar(e));\n    return abstract_nested_proofs(env, metavar_context(), local_context(), base_name, e);\n}\n}\n<commit_msg>fix(library\/aux_definition): make sure aux_definition level params are sorted<commit_after>\/*\nCopyright (c) 2016 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 <algorithm>\n#include \"kernel\/type_checker.h\"\n#include \"kernel\/replace_fn.h\"\n#include \"library\/locals.h\"\n#include \"library\/placeholder.h\"\n#include \"library\/module.h\"\n#include \"library\/trace.h\"\n#include \"library\/aux_definition.h\"\n#include \"library\/unfold_macros.h\"\n#include \"library\/replace_visitor_with_tc.h\"\n\nnamespace lean {\nlevel closure_helper::collect(level const & l) {\n    lean_assert(!m_finalized_collection);\n    return replace(l, [&](level const & l) {\n            if (is_meta(l)) {\n                name const & id = meta_id(l);\n                if (auto r = m_univ_meta_to_param.find(id)) {\n                    return some_level(*r);\n                } else {\n                    name n      = m_prefix.append_after(m_next_idx);\n                    m_next_idx++;\n                    level new_r = mk_param_univ(n);\n                    m_univ_meta_to_param.insert(id, new_r);\n                    m_univ_meta_to_param_inv.insert(n, l);\n                    m_level_params.push_back(n);\n                    return some_level(new_r);\n                }\n            } else if (is_param(l)) {\n                lean_assert(!is_placeholder(l));\n                name const & id = param_id(l);\n                if (!m_found_univ_params.contains(id)) {\n                    m_found_univ_params.insert(id);\n                    m_level_params.push_back(id);\n                }\n            }\n            return none_level();\n        });\n}\n\nlevels closure_helper::collect(levels const & ls) {\n    lean_assert(!m_finalized_collection);\n    bool modified = false;\n    buffer<level> r;\n    for (level const & l : ls) {\n        level new_l = collect(l);\n        if (new_l != l) modified = true;\n        r.push_back(new_l);\n    }\n    if (!modified)\n        return ls;\n    else\n        return to_list(r);\n}\n\nexpr closure_helper::collect(expr const & e) {\n    lean_assert(!m_finalized_collection);\n    return replace(e, [&](expr const & e, unsigned) {\n            if (is_metavar(e)) {\n                name const & id = mlocal_name(e);\n                if (auto r = m_meta_to_param.find(id)) {\n                    return some_expr(*r);\n                } else {\n                    expr type  = m_ctx.infer(e);\n                    expr x     = m_ctx.push_local(\"_x\", type);\n                    m_meta_to_param.insert(id, x);\n                    m_meta_to_param_inv.insert(mlocal_name(x), e);\n                    m_params.push_back(x);\n                    return some_expr(x);\n                }\n            } else if (is_local(e)) {\n                name const & id = mlocal_name(e);\n                if (!m_found_local.contains(id)) {\n                    m_found_local.insert(id);\n                    m_params.push_back(e);\n                }\n            } else if (is_sort(e)) {\n                return some_expr(update_sort(e, collect(sort_level(e))));\n            } else if (is_constant(e)) {\n                return some_expr(update_constant(e, collect(const_levels(e))));\n            }\n            return none_expr();\n        });\n}\n\nvoid closure_helper::finalize_collection() {\n    lean_assert(!m_finalized_collection);\n    std::sort(m_level_params.begin(), m_level_params.end());\n    name_map<expr> new_types;\n    for (unsigned i = 0; i < m_params.size(); i++) {\n        expr x = m_params[i];\n        expr new_type = collect(zeta_expand(m_ctx.lctx(), m_ctx.instantiate_mvars(m_ctx.infer(x))));\n        new_types.insert(mlocal_name(x), new_type);\n    }\n    local_context const & lctx = m_ctx.lctx();\n    std::sort(m_params.begin(), m_params.end(), [&](expr const & l1, expr const & l2) {\n            return lctx.get_local_decl(l1).get_idx() < lctx.get_local_decl(l2).get_idx();\n        });\n    for (unsigned i = 0; i < m_params.size(); i++) {\n        expr x         = m_params[i];\n        expr type      = *new_types.find(mlocal_name(x));\n        expr new_type  = replace_locals(type, i, m_params.data(), m_norm_params.data());\n        expr new_param = m_ctx.push_local(mlocal_pp_name(x), new_type, local_info(x));\n        m_norm_params.push_back(new_param);\n    }\n    m_finalized_collection = true;\n}\n\nexpr closure_helper::mk_pi_closure(expr const & e) {\n    lean_assert(m_finalized_collection);\n    expr new_e  = replace_locals(e, m_params, m_norm_params);\n    return m_ctx.mk_pi(m_norm_params, new_e);\n}\n\nexpr closure_helper::mk_lambda_closure(expr const & e) {\n    lean_assert(m_finalized_collection);\n    expr new_e  = replace_locals(e, m_params, m_norm_params);\n    return m_ctx.mk_lambda(m_norm_params, new_e);\n}\n\nvoid closure_helper::get_level_closure(buffer<level> & ls) {\n    lean_assert(m_finalized_collection);\n    for (name const & n : m_level_params) {\n        if (level const * l = m_univ_meta_to_param_inv.find(n))\n            ls.push_back(*l);\n        else\n            ls.push_back(mk_param_univ(n));\n    }\n}\n\nvoid closure_helper::get_expr_closure(buffer<expr> & ps) {\n    lean_assert(m_finalized_collection);\n    for (expr const & x : m_params) {\n        if (expr const * m = m_meta_to_param_inv.find(mlocal_name(x)))\n            ps.push_back(*m);\n        else\n            ps.push_back(x);\n    }\n}\n\nbuffer<expr> const & closure_helper::get_norm_closure_params() const {\n    lean_assert(m_finalized_collection);\n    return m_norm_params;\n}\n\nstruct mk_aux_definition_fn : public closure_helper {\n    mk_aux_definition_fn(type_context & ctx):closure_helper(ctx) {}\n\n    pair<environment, expr> operator()(name const & c, expr const & type, expr const & value, bool is_lemma, optional<bool> const & is_meta) {\n        lean_assert(!is_lemma || is_meta);\n        lean_assert(!is_lemma || *is_meta == false);\n        expr new_type  = collect(ctx().instantiate_mvars(type));\n        expr new_value = collect(ctx().instantiate_mvars(value));\n        environment env = ctx().env();\n        finalize_collection();\n        expr def_type  = mk_pi_closure(new_type);\n        expr def_value = mk_lambda_closure(new_value);\n        bool untrusted = false;\n        if (is_meta)\n            untrusted = *is_meta;\n        else\n            untrusted = use_untrusted(env, def_type) || use_untrusted(env, def_value);\n        if (!untrusted) {\n            def_type  = unfold_untrusted_macros(env, def_type);\n            def_value = unfold_untrusted_macros(env, def_value);\n        }\n        declaration d;\n        if (is_lemma) {\n            d = mk_theorem(c, get_norm_level_names(), def_type, def_value);\n        } else {\n            bool use_self_opt = true;\n            d = mk_definition(env, c, get_norm_level_names(), def_type, def_value, use_self_opt, !untrusted);\n        }\n        environment new_env = module::add(env, check(env, d, true));\n        buffer<level> ls;\n        get_level_closure(ls);\n        buffer<expr> ps;\n        get_expr_closure(ps);\n        expr r = mk_app(mk_constant(c, to_list(ls)), ps);\n        return mk_pair(new_env, r);\n    }\n};\n\npair<environment, expr> mk_aux_definition(environment const & env, metavar_context const & mctx, local_context const & lctx,\n                                          name const & c, expr const & type, expr const & value, optional<bool> const & is_meta) {\n    type_context ctx(env, options(), mctx, lctx, transparency_mode::All);\n    bool is_lemma = false;\n    return mk_aux_definition_fn(ctx)(c, type, value, is_lemma, is_meta);\n}\n\npair<environment, expr> mk_aux_definition(environment const & env, metavar_context const & mctx, local_context const & lctx,\n                                          name const & c, expr const & value, optional<bool> const & is_meta) {\n    type_context ctx(env, options(), mctx, lctx, transparency_mode::All);\n    expr type     = ctx.infer(value);\n    bool is_lemma = false;\n    return mk_aux_definition_fn(ctx)(c, type, value, is_lemma, is_meta);\n}\n\npair<environment, expr> mk_aux_lemma(environment const & env, metavar_context const & mctx, local_context const & lctx,\n                                     name const & c, expr const & type, expr const & value) {\n    type_context ctx(env, options(), mctx, lctx, transparency_mode::All);\n    bool is_lemma = true;\n    optional<bool> is_meta(false);\n    return mk_aux_definition_fn(ctx)(c, type, value, is_lemma, is_meta);\n}\n\nstruct abstract_nested_proofs_fn : public replace_visitor_with_tc {\n    name     m_base_name;\n    unsigned m_idx{1};\n\n    abstract_nested_proofs_fn(type_context & ctx, name const & b):\n        replace_visitor_with_tc(ctx),\n        m_base_name(b, \"_proof\") {\n    }\n\n    static bool is_atomic(expr const & e) {\n        return is_constant(e) || is_local(e);\n    }\n\n    name mk_name() {\n        environment env = m_ctx.env();\n        while (true) {\n            name curr = m_base_name.append_after(m_idx);\n            m_idx++;\n            if (!env.find(curr)) {\n                m_ctx.set_env(env);\n                return curr;\n            }\n        }\n    }\n\n    optional<expr> is_non_trivial_proof(expr const & e) {\n        if (is_atomic(e))\n            return none_expr();\n        if (is_pi(e) || is_sort(e))\n            return none_expr();\n        expr type = m_ctx.infer(e);\n        if (!m_ctx.is_prop(type))\n            return none_expr();\n        if (is_app(e)) {\n            buffer<expr> args;\n            expr const & fn = get_app_args(e, args);\n            if (!is_atomic(fn))\n                return some_expr(type);\n            for (expr const & arg : args) {\n                if (!is_atomic(arg))\n                    return some_expr(type);\n            }\n            return none_expr();\n        } else {\n            return some_expr(type);\n        }\n    }\n\n    virtual expr visit_mlocal(expr const & e) override {\n        return e;\n    }\n\n    virtual expr visit(expr const & e) override {\n        if (auto type = is_non_trivial_proof(e)) {\n            expr new_e = zeta_expand(m_ctx.lctx(), e);\n            if (e != new_e) {\n                *type = m_ctx.infer(new_e);\n            }\n            name n = mk_name();\n            auto new_env_new_e = mk_aux_lemma(m_ctx.env(), m_ctx.mctx(), m_ctx.lctx(), n, *type, new_e);\n            m_ctx.set_env(new_env_new_e.first);\n            return new_env_new_e.second;\n        } else {\n            return replace_visitor_with_tc::visit(e);\n        }\n    }\n\n    pair<environment, expr> operator()(expr const & e) {\n        expr new_e = replace_visitor_with_tc::operator()(e);\n        return mk_pair(m_ctx.env(), new_e);\n    }\n};\n\npair<environment, expr> abstract_nested_proofs(environment const & env, metavar_context const & mctx, local_context const & lctx, name const & base_name, expr const & e) {\n    type_context ctx(env, options(), mctx, lctx, transparency_mode::Semireducible);\n    return abstract_nested_proofs_fn(ctx, base_name)(e);\n}\n\npair<environment, expr> abstract_nested_proofs(environment const & env, name const & base_name, expr const & e) {\n    lean_assert(!has_metavar(e));\n    return abstract_nested_proofs(env, metavar_context(), local_context(), base_name, e);\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of Ingen.\n * Copyright (C) 2007 Dave 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 <iostream>\n#include <cassert>\n#include <cmath>\n#include <stdint.h>\n#include <raul\/Maid.hpp>\n#include <boost\/optional.hpp>\n#include \"LADSPANode.hpp\"\n#include \"AudioBuffer.hpp\"\n#include \"InputPort.hpp\"\n#include \"OutputPort.hpp\"\n#include \"PluginImpl.hpp\"\n#include \"ProcessContext.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\n\n\n\/** Partially construct a LADSPANode.\n *\n * Object is not usable until instantiate() is called with success.\n * (It _will_ crash!)\n *\/\nLADSPANode::LADSPANode(PluginImpl* plugin, const string& path, bool polyphonic, PatchImpl* parent, const LADSPA_Descriptor* descriptor, SampleRate srate, size_t buffer_size)\n\t: NodeBase(plugin, path, polyphonic, parent, srate, buffer_size)\n\t, _descriptor(descriptor)\n\t, _instances(NULL)\n\t, _prepared_instances(NULL)\n{\n\tassert(_descriptor != NULL);\n}\n\n\nLADSPANode::~LADSPANode()\n{\n\tfor (uint32_t i=0; i < _polyphony; ++i)\n\t\t_descriptor->cleanup((*_instances)[i]);\n\n\tdelete _instances;\n}\n\n\nbool\nLADSPANode::prepare_poly(uint32_t poly)\n{\n\tNodeBase::prepare_poly(poly);\n\n\tif ( (!_polyphonic)\n\t\t\t|| (_prepared_instances && poly <= _prepared_instances->size()) ) {\n\t\treturn true;\n\t}\n\t\n\t_prepared_instances = new Raul::Array<LADSPA_Handle>(poly, *_instances);\n\tfor (uint32_t i = _polyphony; i < _prepared_instances->size(); ++i) {\n\t\t_prepared_instances->at(i) = _descriptor->instantiate(_descriptor, _srate);\n\t\tif ((*_prepared_instances)[i] == NULL) {\n\t\t\tcerr << \"Failed to instantiate plugin!\" << endl;\n\t\t\treturn false;\n\t\t}\n\n\t\tif (_activated)\n\t\t\t_descriptor->activate((*_prepared_instances)[i]);\n\t}\n\t\n\treturn true;\n}\n\n\nbool\nLADSPANode::apply_poly(Raul::Maid& maid, uint32_t poly)\n{\n\tif (!_polyphonic)\n\t\treturn true;\n\n\tif (_prepared_instances) {\n\t\tassert(poly <= _prepared_instances->size());\n\t\tmaid.push(_instances);\n\t\t_instances = _prepared_instances;\n\t\t_prepared_instances = NULL;\n\t}\n\t\t\n\tassert(poly <= _instances->size());\n\t_polyphony = poly;\n\t\n\tNodeBase::apply_poly(maid, poly);\n\n\treturn true;\n}\n\n\n\/** Instantiate self from LADSPA plugin descriptor.\n *\n * Implemented as a seperate function (rather than in the constructor) to\n * allow graceful error-catching of broken plugins.\n * \n * Returns whether or not plugin was successfully instantiated.  If return\n * value is false, this object may not be used.\n *\/\nbool\nLADSPANode::instantiate()\n{\n\tif (!_ports)\n\t\t_ports = new Raul::Array<PortImpl*>(_descriptor->PortCount);\n\t\n\t_instances = new Raul::Array<LADSPA_Handle>(_polyphony, NULL);\n\t\n\tsize_t port_buffer_size = 0;\n\t\n\tfor (uint32_t i=0; i < _polyphony; ++i) {\n\t\t(*_instances)[i] = _descriptor->instantiate(_descriptor, _srate);\n\t\tif ((*_instances)[i] == NULL) {\n\t\t\tcerr << \"Failed to instantiate plugin!\" << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tstring port_name;\n\tstring port_path;\n\t\n\tPortImpl* port = NULL;\n\t\n\tfor (size_t j=0; j < _descriptor->PortCount; ++j) {\n\t\tport_name = Path::nameify(_descriptor->PortNames[j]);\n\n\t\tstring::size_type slash_index;\n\t\t\n\t\t\/\/ Name mangling, to guarantee port names are unique\n\t\tfor (size_t k=0; k < _descriptor->PortCount; ++k) {\n\t\t\tassert(_descriptor->PortNames[k] != NULL);\n\t\t\tif (k != j && port_name == _descriptor->PortNames[k]) { \/\/ clash\n\t\t\t\tif (LADSPA_IS_PORT_CONTROL(_descriptor->PortDescriptors[j]))\n\t\t\t\t\tport_name += \"(CR)\";\n\t\t\t\telse\n\t\t\t\t\tport_name += \"(AR)\";\n\t\t\t}\n\t\t\t\/\/ Replace all slashes with \"-\" (so they don't screw up paths)\n\t\t\twhile ((slash_index = port_name.find(\"\/\")) != string::npos)\n\t\t\t\tport_name[slash_index] = '-';\n\t\t}\n\t\t\n\t\t\/*if (_descriptor->PortNames[j] != port_name)\n\t\t\tcerr << \"NOTICE: Translated LADSPA port name: \" <<\n\t\t\t\t_descriptor->PortNames[j] << \" -> \" << port_name << endl;*\/\n\n\t\tport_path = path() + \"\/\" + port_name;\n\n\t\tDataType type = DataType::AUDIO;\n\t\tport_buffer_size = _buffer_size;\n\n\t\tif (LADSPA_IS_PORT_CONTROL(_descriptor->PortDescriptors[j])) {\n\t\t\ttype = DataType::CONTROL;\n\t\t\tport_buffer_size = 1;\n\t\t} else {\n\t\t\tassert(LADSPA_IS_PORT_AUDIO(_descriptor->PortDescriptors[j]));\n\t\t}\n\t\tassert (LADSPA_IS_PORT_INPUT(_descriptor->PortDescriptors[j])\n\t\t\t|| LADSPA_IS_PORT_OUTPUT(_descriptor->PortDescriptors[j]));\n\t\t\n\t\tboost::optional<Sample> default_val, min, max;\n\t\tget_port_limits(j, default_val, min, max);\n\t\n\t\tconst float value = default_val ? default_val.get() : 0.0f;\n\n\t\tif (LADSPA_IS_PORT_INPUT(_descriptor->PortDescriptors[j])) {\n\t\t\tport = new InputPort(this, port_name, j, _polyphony, type, value, port_buffer_size);\n\t\t\t_ports->at(j) = port;\n\t\t} else if (LADSPA_IS_PORT_OUTPUT(_descriptor->PortDescriptors[j])) {\n\t\t\tport = new OutputPort(this, port_name, j, _polyphony, type, value, port_buffer_size);\n\t\t\t_ports->at(j) = port;\n\t\t}\n\n\t\tassert(port);\n\t\tassert(_ports->at(j) == port);\n\n\t\t\/\/ Work around broke-ass crackhead plugins\n\t\tif (default_val && default_val.get() < min.get()) {\n\t\t\tcerr << \"WARNING: Broken LADSPA \" << _descriptor->UniqueID\n\t\t\t\t\t<< \": Port default < minimum.  Minimum adjusted.\" << endl;\n\t\t\tmin = default_val;\n\t\t}\n\t\t\n\t\tif (default_val && default_val.get() > max.get()) {\n\t\t\tcerr << \"WARNING: Broken LADSPA \" << _descriptor->UniqueID\n\t\t\t\t\t<< \": Maximum adjusted.\" << endl;\n\t\t\tmax = default_val;\n\t\t}\n\t\t\n\t\t\/\/ Set initial\/default value\n\t\tif (port->buffer_size() == 1) {\n\t\t\tfor (uint32_t i=0; i < _polyphony; ++i)\n\t\t\t\t((AudioBuffer*)port->buffer(i))->set(value, 0);\n\t\t}\n\n\t\tif (port->is_input() && port->buffer_size() == 1) {\n\t\t\tif (min)\n\t\t\t\tport->set_variable(\"ingen:minimum\", min.get());\n\t\t\tif (max)\n\t\t\t\tport->set_variable(\"ingen:maximum\", max.get());\n\t\t\tif (default_val)\n\t\t\t\tport->set_variable(\"ingen:default\", default_val.get());\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\nvoid\nLADSPANode::activate()\n{\n\tNodeBase::activate();\n\n\tfor (uint32_t i=0; i < _polyphony; ++i) {\n\t\tfor (unsigned long j=0; j < _descriptor->PortCount; ++j) {\n\t\t\tset_port_buffer(i, j, _ports->at(j)->buffer(i));\n\t\t\t\/*\tif (port->type() == DataType::FLOAT && port->buffer_size() == 1)\n\t\t\t\t\tport->set_value(0.0f, 0); \/\/ FIXME\n\t\t\t\telse if (port->type() == DataType::FLOAT && port->buffer_size() > 1)\n\t\t\t\t\tport->set_value(0.0f, 0);*\/\n\t\t}\n\t\tif (_descriptor->activate != NULL)\n\t\t\t_descriptor->activate((*_instances)[i]);\n\t}\n}\n\n\nvoid\nLADSPANode::deactivate()\n{\n\tNodeBase::deactivate();\n\t\n\tfor (uint32_t i=0; i < _polyphony; ++i)\n\t\tif (_descriptor->deactivate != NULL)\n\t\t\t_descriptor->deactivate((*_instances)[i]);\n}\n\n\nvoid\nLADSPANode::process(ProcessContext& context)\n{\n\tNodeBase::pre_process(context);\n\n\tfor (uint32_t i=0; i < _polyphony; ++i) \n\t\t_descriptor->run((*_instances)[i], context.nframes());\n\t\n\tNodeBase::post_process(context);\n}\n\n\nvoid\nLADSPANode::set_port_buffer(uint32_t voice, uint32_t port_num, Buffer* buf)\n{\n\tassert(voice < _polyphony);\n\t\n\tAudioBuffer* audio_buffer = dynamic_cast<AudioBuffer*>(buf);\n\tassert(audio_buffer);\n\n\tif (port_num < _descriptor->PortCount)\n\t\t_descriptor->connect_port((*_instances)[voice], port_num,\n\t\t\taudio_buffer->data());\n}\n\n\nvoid\nLADSPANode::get_port_limits(unsigned long            port_index,\n                            boost::optional<Sample>& normal,\n                            boost::optional<Sample>& lower,\n                            boost::optional<Sample>& upper)\n{\n\tLADSPA_PortRangeHintDescriptor hint_descriptor = _descriptor->PortRangeHints[port_index].HintDescriptor;\n\n\t\/* set upper and lower, possibly adjusted to the sample rate *\/\n\tif (LADSPA_IS_HINT_SAMPLE_RATE(hint_descriptor)) {\n\t\tupper = _descriptor->PortRangeHints[port_index].UpperBound * _srate;\n\t\tlower = _descriptor->PortRangeHints[port_index].LowerBound * _srate;\n\t} else {\n\t\tupper = _descriptor->PortRangeHints[port_index].UpperBound;\n\t\tlower = _descriptor->PortRangeHints[port_index].LowerBound;\n\t}\n\n\tif (LADSPA_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\/* FLT_EPSILON is defined as the different between 1.0 and the minimum\n\t\t * float greater than 1.0.  So, if lower is < FLT_EPSILON, it will be 1.0\n\t\t * and the logarithmic control will have a base of 1 and thus not change\n\t\t *\/\n\t\tif (lower < FLT_EPSILON) lower = FLT_EPSILON;\n\t}\n\n\n\tif (LADSPA_IS_HINT_HAS_DEFAULT(hint_descriptor)) {\n\n\t\tif (LADSPA_IS_HINT_DEFAULT_MINIMUM(hint_descriptor)) {\n\t\t\tnormal = lower;\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_LOW(hint_descriptor)) {\n\t\t\tassert(lower);\n\t\t\tassert(upper);\n\t\t\tif (LADSPA_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower.get()) * 0.75 + log(upper.get()) * 0.25);\n\t\t\t} else {\n\t\t\t\tnormal = lower.get() * 0.75 + upper.get() * 0.25;\n\t\t\t}\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_MIDDLE(hint_descriptor)) {\n\t\t\tassert(lower);\n\t\t\tassert(upper);\n\t\t\tif (LADSPA_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower.get()) * 0.5 + log(upper.get()) * 0.5);\n\t\t\t} else {\n\t\t\t\tnormal = lower.get() * 0.5 + upper.get() * 0.5;\n\t\t\t}\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_HIGH(hint_descriptor)) {\n\t\t\tassert(lower);\n\t\t\tassert(upper);\n\t\t\tif (LADSPA_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower.get()) * 0.25 + log(upper.get()) * 0.75);\n\t\t\t} else {\n\t\t\t\tnormal = lower.get() * 0.25 + upper.get() * 0.75;\n\t\t\t}\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_MAXIMUM(hint_descriptor)) {\n\t\t\tassert(upper);\n\t\t\tnormal = upper.get();\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_0(hint_descriptor)) {\n\t\t\tnormal = 0.0;\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_1(hint_descriptor)) {\n\t\t\tnormal = 1.0;\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_100(hint_descriptor)) {\n\t\t\tnormal = 100.0;\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_440(hint_descriptor)) {\n\t\t\tnormal = 440.0;\n\t\t}\n\t} else {  \/\/ No default hint\n\t\tif (LADSPA_IS_HINT_BOUNDED_BELOW(hint_descriptor)) {\n\t\t\tassert(lower);\n\t\t\tnormal = lower.get();\n\t\t} else if (LADSPA_IS_HINT_BOUNDED_ABOVE(hint_descriptor)) {\n\t\t\tassert(upper);\n\t\t\tnormal = upper.get();\n\t\t}\n\t}\n}\n\n\n} \/\/ namespace Ingen\n\n<commit_msg>Fix more boost::optional stuff.<commit_after>\/* This file is part of Ingen.\n * Copyright (C) 2007 Dave 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 <iostream>\n#include <cassert>\n#include <cmath>\n#include <stdint.h>\n#include <raul\/Maid.hpp>\n#include <boost\/optional.hpp>\n#include \"LADSPANode.hpp\"\n#include \"AudioBuffer.hpp\"\n#include \"InputPort.hpp\"\n#include \"OutputPort.hpp\"\n#include \"PluginImpl.hpp\"\n#include \"ProcessContext.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\n\n\n\/** Partially construct a LADSPANode.\n *\n * Object is not usable until instantiate() is called with success.\n * (It _will_ crash!)\n *\/\nLADSPANode::LADSPANode(PluginImpl* plugin, const string& path, bool polyphonic, PatchImpl* parent, const LADSPA_Descriptor* descriptor, SampleRate srate, size_t buffer_size)\n\t: NodeBase(plugin, path, polyphonic, parent, srate, buffer_size)\n\t, _descriptor(descriptor)\n\t, _instances(NULL)\n\t, _prepared_instances(NULL)\n{\n\tassert(_descriptor != NULL);\n}\n\n\nLADSPANode::~LADSPANode()\n{\n\tfor (uint32_t i=0; i < _polyphony; ++i)\n\t\t_descriptor->cleanup((*_instances)[i]);\n\n\tdelete _instances;\n}\n\n\nbool\nLADSPANode::prepare_poly(uint32_t poly)\n{\n\tNodeBase::prepare_poly(poly);\n\n\tif ( (!_polyphonic)\n\t\t\t|| (_prepared_instances && poly <= _prepared_instances->size()) ) {\n\t\treturn true;\n\t}\n\t\n\t_prepared_instances = new Raul::Array<LADSPA_Handle>(poly, *_instances);\n\tfor (uint32_t i = _polyphony; i < _prepared_instances->size(); ++i) {\n\t\t_prepared_instances->at(i) = _descriptor->instantiate(_descriptor, _srate);\n\t\tif ((*_prepared_instances)[i] == NULL) {\n\t\t\tcerr << \"Failed to instantiate plugin!\" << endl;\n\t\t\treturn false;\n\t\t}\n\n\t\tif (_activated)\n\t\t\t_descriptor->activate((*_prepared_instances)[i]);\n\t}\n\t\n\treturn true;\n}\n\n\nbool\nLADSPANode::apply_poly(Raul::Maid& maid, uint32_t poly)\n{\n\tif (!_polyphonic)\n\t\treturn true;\n\n\tif (_prepared_instances) {\n\t\tassert(poly <= _prepared_instances->size());\n\t\tmaid.push(_instances);\n\t\t_instances = _prepared_instances;\n\t\t_prepared_instances = NULL;\n\t}\n\t\t\n\tassert(poly <= _instances->size());\n\t_polyphony = poly;\n\t\n\tNodeBase::apply_poly(maid, poly);\n\n\treturn true;\n}\n\n\n\/** Instantiate self from LADSPA plugin descriptor.\n *\n * Implemented as a seperate function (rather than in the constructor) to\n * allow graceful error-catching of broken plugins.\n * \n * Returns whether or not plugin was successfully instantiated.  If return\n * value is false, this object may not be used.\n *\/\nbool\nLADSPANode::instantiate()\n{\n\tif (!_ports)\n\t\t_ports = new Raul::Array<PortImpl*>(_descriptor->PortCount);\n\t\n\t_instances = new Raul::Array<LADSPA_Handle>(_polyphony, NULL);\n\t\n\tsize_t port_buffer_size = 0;\n\t\n\tfor (uint32_t i=0; i < _polyphony; ++i) {\n\t\t(*_instances)[i] = _descriptor->instantiate(_descriptor, _srate);\n\t\tif ((*_instances)[i] == NULL) {\n\t\t\tcerr << \"Failed to instantiate plugin!\" << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tstring port_name;\n\tstring port_path;\n\t\n\tPortImpl* port = NULL;\n\t\n\tfor (size_t j=0; j < _descriptor->PortCount; ++j) {\n\t\tport_name = Path::nameify(_descriptor->PortNames[j]);\n\n\t\tstring::size_type slash_index;\n\t\t\n\t\t\/\/ Name mangling, to guarantee port names are unique\n\t\tfor (size_t k=0; k < _descriptor->PortCount; ++k) {\n\t\t\tassert(_descriptor->PortNames[k] != NULL);\n\t\t\tif (k != j && port_name == _descriptor->PortNames[k]) { \/\/ clash\n\t\t\t\tif (LADSPA_IS_PORT_CONTROL(_descriptor->PortDescriptors[j]))\n\t\t\t\t\tport_name += \"(CR)\";\n\t\t\t\telse\n\t\t\t\t\tport_name += \"(AR)\";\n\t\t\t}\n\t\t\t\/\/ Replace all slashes with \"-\" (so they don't screw up paths)\n\t\t\twhile ((slash_index = port_name.find(\"\/\")) != string::npos)\n\t\t\t\tport_name[slash_index] = '-';\n\t\t}\n\t\t\n\t\t\/*if (_descriptor->PortNames[j] != port_name)\n\t\t\tcerr << \"NOTICE: Translated LADSPA port name: \" <<\n\t\t\t\t_descriptor->PortNames[j] << \" -> \" << port_name << endl;*\/\n\n\t\tport_path = path() + \"\/\" + port_name;\n\n\t\tDataType type = DataType::AUDIO;\n\t\tport_buffer_size = _buffer_size;\n\n\t\tif (LADSPA_IS_PORT_CONTROL(_descriptor->PortDescriptors[j])) {\n\t\t\ttype = DataType::CONTROL;\n\t\t\tport_buffer_size = 1;\n\t\t} else {\n\t\t\tassert(LADSPA_IS_PORT_AUDIO(_descriptor->PortDescriptors[j]));\n\t\t}\n\t\tassert (LADSPA_IS_PORT_INPUT(_descriptor->PortDescriptors[j])\n\t\t\t|| LADSPA_IS_PORT_OUTPUT(_descriptor->PortDescriptors[j]));\n\t\t\n\t\tboost::optional<Sample> default_val, min, max;\n\t\tget_port_limits(j, default_val, min, max);\n\t\n\t\tconst float value = default_val ? default_val.get() : 0.0f;\n\n\t\tif (LADSPA_IS_PORT_INPUT(_descriptor->PortDescriptors[j])) {\n\t\t\tport = new InputPort(this, port_name, j, _polyphony, type, value, port_buffer_size);\n\t\t\t_ports->at(j) = port;\n\t\t} else if (LADSPA_IS_PORT_OUTPUT(_descriptor->PortDescriptors[j])) {\n\t\t\tport = new OutputPort(this, port_name, j, _polyphony, type, value, port_buffer_size);\n\t\t\t_ports->at(j) = port;\n\t\t}\n\n\t\tassert(port);\n\t\tassert(_ports->at(j) == port);\n\n\t\t\/\/ Work around broke-ass crackhead plugins\n\t\tif (default_val && default_val.get() < min.get()) {\n\t\t\tcerr << \"WARNING: Broken LADSPA \" << _descriptor->UniqueID\n\t\t\t\t\t<< \": Port default < minimum.  Minimum adjusted.\" << endl;\n\t\t\tmin = default_val;\n\t\t}\n\t\t\n\t\tif (default_val && default_val.get() > max.get()) {\n\t\t\tcerr << \"WARNING: Broken LADSPA \" << _descriptor->UniqueID\n\t\t\t\t\t<< \": Maximum adjusted.\" << endl;\n\t\t\tmax = default_val;\n\t\t}\n\t\t\n\t\t\/\/ Set initial\/default value\n\t\tif (port->buffer_size() == 1) {\n\t\t\tfor (uint32_t i=0; i < _polyphony; ++i)\n\t\t\t\t((AudioBuffer*)port->buffer(i))->set(value, 0);\n\t\t}\n\n\t\tif (port->is_input() && port->buffer_size() == 1) {\n\t\t\tif (min)\n\t\t\t\tport->set_variable(\"ingen:minimum\", min.get());\n\t\t\tif (max)\n\t\t\t\tport->set_variable(\"ingen:maximum\", max.get());\n\t\t\tif (default_val)\n\t\t\t\tport->set_variable(\"ingen:default\", default_val.get());\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\nvoid\nLADSPANode::activate()\n{\n\tNodeBase::activate();\n\n\tfor (uint32_t i=0; i < _polyphony; ++i) {\n\t\tfor (unsigned long j=0; j < _descriptor->PortCount; ++j) {\n\t\t\tset_port_buffer(i, j, _ports->at(j)->buffer(i));\n\t\t\t\/*\tif (port->type() == DataType::FLOAT && port->buffer_size() == 1)\n\t\t\t\t\tport->set_value(0.0f, 0); \/\/ FIXME\n\t\t\t\telse if (port->type() == DataType::FLOAT && port->buffer_size() > 1)\n\t\t\t\t\tport->set_value(0.0f, 0);*\/\n\t\t}\n\t\tif (_descriptor->activate != NULL)\n\t\t\t_descriptor->activate((*_instances)[i]);\n\t}\n}\n\n\nvoid\nLADSPANode::deactivate()\n{\n\tNodeBase::deactivate();\n\t\n\tfor (uint32_t i=0; i < _polyphony; ++i)\n\t\tif (_descriptor->deactivate != NULL)\n\t\t\t_descriptor->deactivate((*_instances)[i]);\n}\n\n\nvoid\nLADSPANode::process(ProcessContext& context)\n{\n\tNodeBase::pre_process(context);\n\n\tfor (uint32_t i=0; i < _polyphony; ++i) \n\t\t_descriptor->run((*_instances)[i], context.nframes());\n\t\n\tNodeBase::post_process(context);\n}\n\n\nvoid\nLADSPANode::set_port_buffer(uint32_t voice, uint32_t port_num, Buffer* buf)\n{\n\tassert(voice < _polyphony);\n\t\n\tAudioBuffer* audio_buffer = dynamic_cast<AudioBuffer*>(buf);\n\tassert(audio_buffer);\n\n\tif (port_num < _descriptor->PortCount)\n\t\t_descriptor->connect_port((*_instances)[voice], port_num,\n\t\t\taudio_buffer->data());\n}\n\n\nvoid\nLADSPANode::get_port_limits(unsigned long            port_index,\n                            boost::optional<Sample>& normal,\n                            boost::optional<Sample>& lower,\n                            boost::optional<Sample>& upper)\n{\n\tLADSPA_PortRangeHintDescriptor hint_descriptor = _descriptor->PortRangeHints[port_index].HintDescriptor;\n\n\t\/* set upper and lower, possibly adjusted to the sample rate *\/\n\tif (LADSPA_IS_HINT_SAMPLE_RATE(hint_descriptor)) {\n\t\tupper = _descriptor->PortRangeHints[port_index].UpperBound * _srate;\n\t\tlower = _descriptor->PortRangeHints[port_index].LowerBound * _srate;\n\t} else {\n\t\tupper = _descriptor->PortRangeHints[port_index].UpperBound;\n\t\tlower = _descriptor->PortRangeHints[port_index].LowerBound;\n\t}\n\n\tif (LADSPA_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\/* FLT_EPSILON is defined as the different between 1.0 and the minimum\n\t\t * float greater than 1.0.  So, if lower is < FLT_EPSILON, it will be 1.0\n\t\t * and the logarithmic control will have a base of 1 and thus not change\n\t\t *\/\n\t\tif (lower.get() < FLT_EPSILON) lower = FLT_EPSILON;\n\t}\n\n\n\tif (LADSPA_IS_HINT_HAS_DEFAULT(hint_descriptor)) {\n\n\t\tif (LADSPA_IS_HINT_DEFAULT_MINIMUM(hint_descriptor)) {\n\t\t\tnormal = lower;\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_LOW(hint_descriptor)) {\n\t\t\tassert(lower);\n\t\t\tassert(upper);\n\t\t\tif (LADSPA_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower.get()) * 0.75 + log(upper.get()) * 0.25);\n\t\t\t} else {\n\t\t\t\tnormal = lower.get() * 0.75 + upper.get() * 0.25;\n\t\t\t}\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_MIDDLE(hint_descriptor)) {\n\t\t\tassert(lower);\n\t\t\tassert(upper);\n\t\t\tif (LADSPA_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower.get()) * 0.5 + log(upper.get()) * 0.5);\n\t\t\t} else {\n\t\t\t\tnormal = lower.get() * 0.5 + upper.get() * 0.5;\n\t\t\t}\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_HIGH(hint_descriptor)) {\n\t\t\tassert(lower);\n\t\t\tassert(upper);\n\t\t\tif (LADSPA_IS_HINT_LOGARITHMIC(hint_descriptor)) {\n\t\t\t\tnormal = exp(log(lower.get()) * 0.25 + log(upper.get()) * 0.75);\n\t\t\t} else {\n\t\t\t\tnormal = lower.get() * 0.25 + upper.get() * 0.75;\n\t\t\t}\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_MAXIMUM(hint_descriptor)) {\n\t\t\tassert(upper);\n\t\t\tnormal = upper.get();\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_0(hint_descriptor)) {\n\t\t\tnormal = 0.0;\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_1(hint_descriptor)) {\n\t\t\tnormal = 1.0;\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_100(hint_descriptor)) {\n\t\t\tnormal = 100.0;\n\t\t} else if (LADSPA_IS_HINT_DEFAULT_440(hint_descriptor)) {\n\t\t\tnormal = 440.0;\n\t\t}\n\t} else {  \/\/ No default hint\n\t\tif (LADSPA_IS_HINT_BOUNDED_BELOW(hint_descriptor)) {\n\t\t\tassert(lower);\n\t\t\tnormal = lower.get();\n\t\t} else if (LADSPA_IS_HINT_BOUNDED_ABOVE(hint_descriptor)) {\n\t\t\tassert(upper);\n\t\t\tnormal = upper.get();\n\t\t}\n\t}\n}\n\n\n} \/\/ namespace Ingen\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 (info@qt.nokia.com)\n**\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** 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** Other Usage\n**\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** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n\n#include \"environment.h\"\n\n#include <QtCore\/QProcess>\n#include <QtCore\/QDir>\n#include <QtCore\/QString>\n\nusing namespace Utils;\n\nQList<EnvironmentItem> EnvironmentItem::fromStringList(QStringList list)\n{\n    QList<EnvironmentItem> result;\n    foreach (const QString &string, list) {\n        int pos = string.indexOf(QLatin1Char('='));\n        if (pos == -1) {\n            EnvironmentItem item(string, QString());\n            item.unset = true;\n            result.append(item);\n        } else {\n            EnvironmentItem item(string.left(pos), string.mid(pos+1));\n            result.append(item);\n        }\n    }\n    return result;\n}\n\nQStringList EnvironmentItem::toStringList(QList<EnvironmentItem> list)\n{\n    QStringList result;\n    foreach (const EnvironmentItem &item, list) {\n        if (item.unset)\n            result << QString(item.name);\n        else\n            result << QString(item.name + '=' + item.value);\n    }\n    return result;\n}\n\nEnvironment::Environment()\n{\n}\n\nEnvironment::Environment(QStringList env)\n{\n    foreach (const QString &s, env) {\n        int i = s.indexOf(\"=\");\n        if (i >= 0) {\n#ifdef Q_OS_WIN\n            m_values.insert(s.left(i).toUpper(), s.mid(i+1));\n#else\n            m_values.insert(s.left(i), s.mid(i+1));\n#endif\n        }\n    }\n}\n\nQStringList Environment::toStringList() const\n{\n    QStringList result;\n    const QMap<QString, QString>::const_iterator end = m_values.constEnd();\n    for (QMap<QString, QString>::const_iterator it = m_values.constBegin(); it != end; ++it) {\n        QString entry = it.key();\n        entry += QLatin1Char('=');\n        entry += it.value();\n        result.push_back(entry);\n    }\n    return result;\n}\n\nvoid Environment::set(const QString &key, const QString &value)\n{\n#ifdef Q_OS_WIN\n    QString _key = key.toUpper();\n#else\n    const QString &_key = key;\n#endif\n    m_values.insert(_key, value);\n}\n\nvoid Environment::unset(const QString &key)\n{\n#ifdef Q_OS_WIN\n    QString _key = key.toUpper();\n#else\n    const QString &_key = key;\n#endif\n    m_values.remove(_key);\n}\n\nvoid Environment::appendOrSet(const QString &key, const QString &value, const QString &sep)\n{\n#ifdef Q_OS_WIN\n    QString _key = key.toUpper();\n#else\n    const QString &_key = key;\n#endif\n    QMap<QString, QString>::iterator it = m_values.find(key);\n    if (it == m_values.end()) {\n        m_values.insert(_key, value);\n    } else {\n        \/\/ Append unless it is already there\n        const QString toAppend = sep + value;\n        if (!it.value().endsWith(toAppend))\n            it.value().append(toAppend);\n    }\n}\n\nvoid Environment::prependOrSet(const QString&key, const QString &value, const QString &sep)\n{\n#ifdef Q_OS_WIN\n    QString _key = key.toUpper();\n#else\n    const QString &_key = key;\n#endif\n    QMap<QString, QString>::iterator it = m_values.find(key);\n    if (it == m_values.end()) {\n        m_values.insert(_key, value);\n    } else {\n        \/\/ Prepend unless it is already there\n        const QString toPrepend = value + sep;\n        if (!it.value().startsWith(toPrepend))\n            it.value().prepend(toPrepend);\n    }\n}\n\nvoid Environment::appendOrSetPath(const QString &value)\n{\n#ifdef Q_OS_WIN\n    const QChar sep = QLatin1Char(';');\n#else\n    const QChar sep = QLatin1Char(':');\n#endif\n    appendOrSet(QLatin1String(\"PATH\"), QDir::toNativeSeparators(value), QString(sep));\n}\n\nvoid Environment::prependOrSetPath(const QString &value)\n{\n#ifdef Q_OS_WIN\n    const QChar sep = QLatin1Char(';');\n#else\n    const QChar sep = QLatin1Char(':');\n#endif\n    prependOrSet(QLatin1String(\"PATH\"), QDir::toNativeSeparators(value), QString(sep));\n}\n\nEnvironment Environment::systemEnvironment()\n{\n    return Environment(QProcess::systemEnvironment());\n}\n\nvoid Environment::clear()\n{\n    m_values.clear();\n}\n\nQString Environment::searchInPath(const QString &executable,\n                                  const QStringList &additionalDirs) const\n{\n    QStringList execs;\n    execs << executable;\n#ifdef Q_OS_WIN\n    \/\/ Check all the executable extensions on windows:\n    QStringList extensions = value(QLatin1String(\"PATHEXT\")).split(QLatin1Char(';'));\n\n    \/\/ .exe.bat is legal (and run when starting new.exe), so always go through the complete list once:\n    foreach (const QString &ext, extensions)\n        execs << executable + ext.toLower();\n#endif\n    return searchInPath(execs, additionalDirs);\n}\n\nQString Environment::searchInPath(const QStringList &executables,\n                                  const QStringList &additionalDirs) const\n{\n    foreach (const QString &executable, executables) {\n        QString exec = expandVariables(executable);\n\n        if (exec.isEmpty())\n            continue;\n\n        QFileInfo baseFi(exec);\n        if (baseFi.isAbsolute() && baseFi.exists())\n            return QDir::toNativeSeparators(exec);\n\n        \/\/ Check in directories:\n        foreach (const QString &dir, additionalDirs) {\n            if (dir.isEmpty())\n                continue;\n            QFileInfo fi(dir + QLatin1Char('\/') + exec);\n            if (fi.isFile() && fi.isExecutable())\n                return fi.absoluteFilePath();\n        }\n\n        \/\/ Check in path:\n        const QChar slash = QLatin1Char('\/');\n        if (exec.indexOf(slash) != -1)\n            continue;\n        foreach (const QString &p, path()) {\n            QString fp = p;\n            fp += slash;\n            fp += exec;\n            const QFileInfo fi(fp);\n            if (fi.exists() && fi.isExecutable() && !fi.isDir())\n                return fi.absoluteFilePath();\n        }\n    }\n    return QString();\n}\n\nQStringList Environment::path() const\n{\n#ifdef Q_OS_WIN\n    const QChar sep = QLatin1Char(';');\n#else\n    const QChar sep = QLatin1Char(':');\n#endif\n    return m_values.value(QLatin1String(\"PATH\")).split(sep, QString::SkipEmptyParts);\n}\n\nQString Environment::value(const QString &key) const\n{\n    return m_values.value(key);\n}\n\nQString Environment::key(Environment::const_iterator it) const\n{\n    return it.key();\n}\n\nQString Environment::value(Environment::const_iterator it) const\n{\n    return it.value();\n}\n\nEnvironment::const_iterator Environment::constBegin() const\n{\n    return m_values.constBegin();\n}\n\nEnvironment::const_iterator Environment::constEnd() const\n{\n    return m_values.constEnd();\n}\n\nEnvironment::const_iterator Environment::constFind(const QString &name) const\n{\n    QMap<QString, QString>::const_iterator it = m_values.constFind(name);\n    if (it == m_values.constEnd())\n        return constEnd();\n    else\n        return it;\n}\n\nint Environment::size() const\n{\n    return m_values.size();\n}\n\nvoid Environment::modify(const QList<EnvironmentItem> & list)\n{\n    Environment resultEnvironment = *this;\n    foreach (const EnvironmentItem &item, list) {\n        if (item.unset) {\n            resultEnvironment.unset(item.name);\n        } else {\n            \/\/ TODO use variable expansion\n            QString value = item.value;\n            for (int i=0; i < value.size(); ++i) {\n                if (value.at(i) == QLatin1Char('$')) {\n                    if ((i + 1) < value.size()) {\n                        const QChar &c = value.at(i+1);\n                        int end = -1;\n                        if (c == '(')\n                            end = value.indexOf(')', i);\n                        else if (c == '{')\n                            end = value.indexOf('}', i);\n                        if (end != -1) {\n                            const QString &name = value.mid(i+2, end-i-2);\n                            Environment::const_iterator it = constFind(name);\n                            if (it != constEnd())\n                                value.replace(i, end-i+1, it.value());\n                        }\n                    }\n                }\n            }\n            resultEnvironment.set(item.name, value);\n        }\n    }\n    *this = resultEnvironment;\n}\n\nQList<EnvironmentItem> Environment::diff(const Environment &other) const\n{\n    QMap<QString, QString>::const_iterator thisIt = constBegin();\n    QMap<QString, QString>::const_iterator otherIt = other.constBegin();\n\n    QList<EnvironmentItem> result;\n    while (thisIt != constEnd() || otherIt != other.constEnd()) {\n        if (thisIt == constEnd()) {\n            result.append(Utils::EnvironmentItem(otherIt.key(), otherIt.value()));\n            ++otherIt;\n        } else if (otherIt == constEnd()) {\n            Utils::EnvironmentItem item(thisIt.key(), QString());\n            item.unset = true;\n            result.append(item);\n            ++thisIt;\n        } else if (thisIt.key() < otherIt.key()) {\n            Utils::EnvironmentItem item(thisIt.key(), QString());\n            item.unset = true;\n            result.append(item);\n            ++thisIt;\n        } else if (thisIt.key() > otherIt.key()) {\n            result.append(Utils::EnvironmentItem(otherIt.key(), otherIt.value()));\n            ++otherIt;\n        } else {\n            result.append(Utils::EnvironmentItem(otherIt.key(), otherIt.value()));\n            ++otherIt;\n            ++thisIt;\n        }\n    }\n    return result;\n}\n\nbool Environment::hasKey(const QString &key)\n{\n    return m_values.contains(key);\n}\n\nbool Environment::operator!=(const Environment &other) const\n{\n    return !(*this == other);\n}\n\nbool Environment::operator==(const Environment &other) const\n{\n    return m_values == other.m_values;\n}\n\n\/** Expand environment variables in a string.\n *\n * Environment variables are accepted in the following forms:\n * $SOMEVAR, ${SOMEVAR} on Unix and %SOMEVAR% on Windows.\n * No escapes and quoting are supported.\n * If a variable is not found, it is not substituted.\n *\/\nQString Environment::expandVariables(const QString &input) const\n{\n    QString result = input;\n\n#ifdef Q_OS_WIN\n    for (int vStart = -1, i = 0; i < result.length(); ) {\n        if (result.at(i++) == QLatin1Char('%')) {\n            if (vStart > 0) {\n                const_iterator it = m_values.constFind(result.mid(vStart, i - vStart - 1).toUpper());\n                if (it != m_values.constEnd()) {\n                    result.replace(vStart - 1, i - vStart + 1, *it);\n                    i = vStart - 1 + it->length();\n                    vStart = -1;\n                } else {\n                    vStart = i;\n                }\n            } else {\n                vStart = i;\n            }\n        }\n    }\n#else\n    enum { BASE, OPTIONALVARIABLEBRACE, VARIABLE, BRACEDVARIABLE } state = BASE;\n    int vStart = -1;\n\n    for (int i = 0; i < result.length();) {\n        QChar c = result.at(i++);\n        if (state == BASE) {\n            if (c == QLatin1Char('$'))\n                state = OPTIONALVARIABLEBRACE;\n        } else if (state == OPTIONALVARIABLEBRACE) {\n            if (c == QLatin1Char('{')) {\n                state = BRACEDVARIABLE;\n                vStart = i;\n            } else if (c.isLetterOrNumber() || c == QLatin1Char('_')) {\n                state = VARIABLE;\n                vStart = i - 1;\n            } else {\n                state = BASE;\n            }\n        } else if (state == BRACEDVARIABLE) {\n            if (c == QLatin1Char('}')) {\n                const_iterator it = m_values.constFind(result.mid(vStart, i - 1 - vStart));\n                if (it != constEnd()) {\n                    result.replace(vStart - 2, i - vStart + 2, *it);\n                    i = vStart - 2 + it->length();\n                }\n                state = BASE;\n            }\n        } else if (state == VARIABLE) {\n            if (!c.isLetterOrNumber() && c != QLatin1Char('_')) {\n                const_iterator it = m_values.constFind(result.mid(vStart, i - vStart - 1));\n                if (it != constEnd()) {\n                    result.replace(vStart - 1, i - vStart, *it);\n                    i = vStart - 1 + it->length();\n                }\n                state = BASE;\n            }\n        }\n    }\n    if (state == VARIABLE) {\n        const_iterator it = m_values.constFind(result.mid(vStart));\n        if (it != constEnd())\n            result.replace(vStart - 1, result.length() - vStart + 1, *it);\n    }\n#endif\n    return result;\n}\n\nQStringList Environment::expandVariables(const QStringList &variables) const\n{\n    QStringList results;\n    foreach (const QString & i, variables)\n        results << expandVariables(i);\n    return results;\n}\n<commit_msg>Use non-native separators internally<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 (info@qt.nokia.com)\n**\n**\n** GNU Lesser General Public License Usage\n**\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 file.\n** Please review the following information to ensure the GNU Lesser General\n** 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** Other Usage\n**\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** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n\n#include \"environment.h\"\n\n#include <QtCore\/QProcess>\n#include <QtCore\/QDir>\n#include <QtCore\/QString>\n\nusing namespace Utils;\n\nQList<EnvironmentItem> EnvironmentItem::fromStringList(QStringList list)\n{\n    QList<EnvironmentItem> result;\n    foreach (const QString &string, list) {\n        int pos = string.indexOf(QLatin1Char('='));\n        if (pos == -1) {\n            EnvironmentItem item(string, QString());\n            item.unset = true;\n            result.append(item);\n        } else {\n            EnvironmentItem item(string.left(pos), string.mid(pos+1));\n            result.append(item);\n        }\n    }\n    return result;\n}\n\nQStringList EnvironmentItem::toStringList(QList<EnvironmentItem> list)\n{\n    QStringList result;\n    foreach (const EnvironmentItem &item, list) {\n        if (item.unset)\n            result << QString(item.name);\n        else\n            result << QString(item.name + '=' + item.value);\n    }\n    return result;\n}\n\nEnvironment::Environment()\n{\n}\n\nEnvironment::Environment(QStringList env)\n{\n    foreach (const QString &s, env) {\n        int i = s.indexOf(\"=\");\n        if (i >= 0) {\n#ifdef Q_OS_WIN\n            m_values.insert(s.left(i).toUpper(), s.mid(i+1));\n#else\n            m_values.insert(s.left(i), s.mid(i+1));\n#endif\n        }\n    }\n}\n\nQStringList Environment::toStringList() const\n{\n    QStringList result;\n    const QMap<QString, QString>::const_iterator end = m_values.constEnd();\n    for (QMap<QString, QString>::const_iterator it = m_values.constBegin(); it != end; ++it) {\n        QString entry = it.key();\n        entry += QLatin1Char('=');\n        entry += it.value();\n        result.push_back(entry);\n    }\n    return result;\n}\n\nvoid Environment::set(const QString &key, const QString &value)\n{\n#ifdef Q_OS_WIN\n    QString _key = key.toUpper();\n#else\n    const QString &_key = key;\n#endif\n    m_values.insert(_key, value);\n}\n\nvoid Environment::unset(const QString &key)\n{\n#ifdef Q_OS_WIN\n    QString _key = key.toUpper();\n#else\n    const QString &_key = key;\n#endif\n    m_values.remove(_key);\n}\n\nvoid Environment::appendOrSet(const QString &key, const QString &value, const QString &sep)\n{\n#ifdef Q_OS_WIN\n    QString _key = key.toUpper();\n#else\n    const QString &_key = key;\n#endif\n    QMap<QString, QString>::iterator it = m_values.find(key);\n    if (it == m_values.end()) {\n        m_values.insert(_key, value);\n    } else {\n        \/\/ Append unless it is already there\n        const QString toAppend = sep + value;\n        if (!it.value().endsWith(toAppend))\n            it.value().append(toAppend);\n    }\n}\n\nvoid Environment::prependOrSet(const QString&key, const QString &value, const QString &sep)\n{\n#ifdef Q_OS_WIN\n    QString _key = key.toUpper();\n#else\n    const QString &_key = key;\n#endif\n    QMap<QString, QString>::iterator it = m_values.find(key);\n    if (it == m_values.end()) {\n        m_values.insert(_key, value);\n    } else {\n        \/\/ Prepend unless it is already there\n        const QString toPrepend = value + sep;\n        if (!it.value().startsWith(toPrepend))\n            it.value().prepend(toPrepend);\n    }\n}\n\nvoid Environment::appendOrSetPath(const QString &value)\n{\n#ifdef Q_OS_WIN\n    const QChar sep = QLatin1Char(';');\n#else\n    const QChar sep = QLatin1Char(':');\n#endif\n    appendOrSet(QLatin1String(\"PATH\"), QDir::toNativeSeparators(value), QString(sep));\n}\n\nvoid Environment::prependOrSetPath(const QString &value)\n{\n#ifdef Q_OS_WIN\n    const QChar sep = QLatin1Char(';');\n#else\n    const QChar sep = QLatin1Char(':');\n#endif\n    prependOrSet(QLatin1String(\"PATH\"), QDir::toNativeSeparators(value), QString(sep));\n}\n\nEnvironment Environment::systemEnvironment()\n{\n    return Environment(QProcess::systemEnvironment());\n}\n\nvoid Environment::clear()\n{\n    m_values.clear();\n}\n\nQString Environment::searchInPath(const QString &executable,\n                                  const QStringList &additionalDirs) const\n{\n    QStringList execs;\n    execs << executable;\n#ifdef Q_OS_WIN\n    \/\/ Check all the executable extensions on windows:\n    QStringList extensions = value(QLatin1String(\"PATHEXT\")).split(QLatin1Char(';'));\n\n    \/\/ .exe.bat is legal (and run when starting new.exe), so always go through the complete list once:\n    foreach (const QString &ext, extensions)\n        execs << executable + ext.toLower();\n#endif\n    return searchInPath(execs, additionalDirs);\n}\n\nQString Environment::searchInPath(const QStringList &executables,\n                                  const QStringList &additionalDirs) const\n{\n    foreach (const QString &executable, executables) {\n        QString exec = expandVariables(executable);\n\n        if (exec.isEmpty())\n            continue;\n\n        QFileInfo baseFi(exec);\n        if (baseFi.isAbsolute() && baseFi.exists())\n            return QDir::fromNativeSeparators(exec);\n\n        \/\/ Check in directories:\n        foreach (const QString &dir, additionalDirs) {\n            if (dir.isEmpty())\n                continue;\n            QFileInfo fi(dir + QLatin1Char('\/') + exec);\n            if (fi.isFile() && fi.isExecutable())\n                return fi.absoluteFilePath();\n        }\n\n        \/\/ Check in path:\n        const QChar slash = QLatin1Char('\/');\n        if (exec.indexOf(slash) != -1)\n            continue;\n        foreach (const QString &p, path()) {\n            QString fp = p;\n            fp += slash;\n            fp += exec;\n            const QFileInfo fi(fp);\n            if (fi.exists() && fi.isExecutable() && !fi.isDir())\n                return fi.absoluteFilePath();\n        }\n    }\n    return QString();\n}\n\nQStringList Environment::path() const\n{\n#ifdef Q_OS_WIN\n    const QChar sep = QLatin1Char(';');\n#else\n    const QChar sep = QLatin1Char(':');\n#endif\n    return m_values.value(QLatin1String(\"PATH\")).split(sep, QString::SkipEmptyParts);\n}\n\nQString Environment::value(const QString &key) const\n{\n    return m_values.value(key);\n}\n\nQString Environment::key(Environment::const_iterator it) const\n{\n    return it.key();\n}\n\nQString Environment::value(Environment::const_iterator it) const\n{\n    return it.value();\n}\n\nEnvironment::const_iterator Environment::constBegin() const\n{\n    return m_values.constBegin();\n}\n\nEnvironment::const_iterator Environment::constEnd() const\n{\n    return m_values.constEnd();\n}\n\nEnvironment::const_iterator Environment::constFind(const QString &name) const\n{\n    QMap<QString, QString>::const_iterator it = m_values.constFind(name);\n    if (it == m_values.constEnd())\n        return constEnd();\n    else\n        return it;\n}\n\nint Environment::size() const\n{\n    return m_values.size();\n}\n\nvoid Environment::modify(const QList<EnvironmentItem> & list)\n{\n    Environment resultEnvironment = *this;\n    foreach (const EnvironmentItem &item, list) {\n        if (item.unset) {\n            resultEnvironment.unset(item.name);\n        } else {\n            \/\/ TODO use variable expansion\n            QString value = item.value;\n            for (int i=0; i < value.size(); ++i) {\n                if (value.at(i) == QLatin1Char('$')) {\n                    if ((i + 1) < value.size()) {\n                        const QChar &c = value.at(i+1);\n                        int end = -1;\n                        if (c == '(')\n                            end = value.indexOf(')', i);\n                        else if (c == '{')\n                            end = value.indexOf('}', i);\n                        if (end != -1) {\n                            const QString &name = value.mid(i+2, end-i-2);\n                            Environment::const_iterator it = constFind(name);\n                            if (it != constEnd())\n                                value.replace(i, end-i+1, it.value());\n                        }\n                    }\n                }\n            }\n            resultEnvironment.set(item.name, value);\n        }\n    }\n    *this = resultEnvironment;\n}\n\nQList<EnvironmentItem> Environment::diff(const Environment &other) const\n{\n    QMap<QString, QString>::const_iterator thisIt = constBegin();\n    QMap<QString, QString>::const_iterator otherIt = other.constBegin();\n\n    QList<EnvironmentItem> result;\n    while (thisIt != constEnd() || otherIt != other.constEnd()) {\n        if (thisIt == constEnd()) {\n            result.append(Utils::EnvironmentItem(otherIt.key(), otherIt.value()));\n            ++otherIt;\n        } else if (otherIt == constEnd()) {\n            Utils::EnvironmentItem item(thisIt.key(), QString());\n            item.unset = true;\n            result.append(item);\n            ++thisIt;\n        } else if (thisIt.key() < otherIt.key()) {\n            Utils::EnvironmentItem item(thisIt.key(), QString());\n            item.unset = true;\n            result.append(item);\n            ++thisIt;\n        } else if (thisIt.key() > otherIt.key()) {\n            result.append(Utils::EnvironmentItem(otherIt.key(), otherIt.value()));\n            ++otherIt;\n        } else {\n            result.append(Utils::EnvironmentItem(otherIt.key(), otherIt.value()));\n            ++otherIt;\n            ++thisIt;\n        }\n    }\n    return result;\n}\n\nbool Environment::hasKey(const QString &key)\n{\n    return m_values.contains(key);\n}\n\nbool Environment::operator!=(const Environment &other) const\n{\n    return !(*this == other);\n}\n\nbool Environment::operator==(const Environment &other) const\n{\n    return m_values == other.m_values;\n}\n\n\/** Expand environment variables in a string.\n *\n * Environment variables are accepted in the following forms:\n * $SOMEVAR, ${SOMEVAR} on Unix and %SOMEVAR% on Windows.\n * No escapes and quoting are supported.\n * If a variable is not found, it is not substituted.\n *\/\nQString Environment::expandVariables(const QString &input) const\n{\n    QString result = input;\n\n#ifdef Q_OS_WIN\n    for (int vStart = -1, i = 0; i < result.length(); ) {\n        if (result.at(i++) == QLatin1Char('%')) {\n            if (vStart > 0) {\n                const_iterator it = m_values.constFind(result.mid(vStart, i - vStart - 1).toUpper());\n                if (it != m_values.constEnd()) {\n                    result.replace(vStart - 1, i - vStart + 1, *it);\n                    i = vStart - 1 + it->length();\n                    vStart = -1;\n                } else {\n                    vStart = i;\n                }\n            } else {\n                vStart = i;\n            }\n        }\n    }\n#else\n    enum { BASE, OPTIONALVARIABLEBRACE, VARIABLE, BRACEDVARIABLE } state = BASE;\n    int vStart = -1;\n\n    for (int i = 0; i < result.length();) {\n        QChar c = result.at(i++);\n        if (state == BASE) {\n            if (c == QLatin1Char('$'))\n                state = OPTIONALVARIABLEBRACE;\n        } else if (state == OPTIONALVARIABLEBRACE) {\n            if (c == QLatin1Char('{')) {\n                state = BRACEDVARIABLE;\n                vStart = i;\n            } else if (c.isLetterOrNumber() || c == QLatin1Char('_')) {\n                state = VARIABLE;\n                vStart = i - 1;\n            } else {\n                state = BASE;\n            }\n        } else if (state == BRACEDVARIABLE) {\n            if (c == QLatin1Char('}')) {\n                const_iterator it = m_values.constFind(result.mid(vStart, i - 1 - vStart));\n                if (it != constEnd()) {\n                    result.replace(vStart - 2, i - vStart + 2, *it);\n                    i = vStart - 2 + it->length();\n                }\n                state = BASE;\n            }\n        } else if (state == VARIABLE) {\n            if (!c.isLetterOrNumber() && c != QLatin1Char('_')) {\n                const_iterator it = m_values.constFind(result.mid(vStart, i - vStart - 1));\n                if (it != constEnd()) {\n                    result.replace(vStart - 1, i - vStart, *it);\n                    i = vStart - 1 + it->length();\n                }\n                state = BASE;\n            }\n        }\n    }\n    if (state == VARIABLE) {\n        const_iterator it = m_values.constFind(result.mid(vStart));\n        if (it != constEnd())\n            result.replace(vStart - 1, result.length() - vStart + 1, *it);\n    }\n#endif\n    return result;\n}\n\nQStringList Environment::expandVariables(const QStringList &variables) const\n{\n    QStringList results;\n    foreach (const QString & i, variables)\n        results << expandVariables(i);\n    return results;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"util.hh\"\n#include \"local-store.hh\"\n#include \"globals.hh\"\n\n#include <cstdlib>\n#include <cstring>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <errno.h>\n#include <stdio.h>\n\n\nnamespace nix {\n\n\nstatic void makeWritable(const Path & path)\n{\n    struct stat st;\n    if (lstat(path.c_str(), &st))\n        throw SysError(format(\"getting attributes of path ‘%1%’\") % path);\n    if (chmod(path.c_str(), st.st_mode | S_IWUSR) == -1)\n        throw SysError(format(\"changing writability of ‘%1%’\") % path);\n}\n\n\nstruct MakeReadOnly\n{\n    Path path;\n    MakeReadOnly(const Path & path) : path(path) { }\n    ~MakeReadOnly()\n    {\n        try {\n            \/* This will make the path read-only. *\/\n            if (path != \"\") canonicaliseTimestampAndPermissions(path);\n        } catch (...) {\n            ignoreException();\n        }\n    }\n};\n\n\nLocalStore::InodeHash LocalStore::loadInodeHash()\n{\n    debug(\"loading hash inodes in memory\");\n    InodeHash inodeHash;\n\n    AutoCloseDir dir(opendir(linksDir.c_str()));\n    if (!dir) throw SysError(format(\"opening directory ‘%1%’\") % linksDir);\n\n    struct dirent * dirent;\n    while (errno = 0, dirent = readdir(dir.get())) { \/* sic *\/\n        checkInterrupt();\n        \/\/ We don't care if we hit non-hash files, anything goes\n        inodeHash.insert(dirent->d_ino);\n    }\n    if (errno) throw SysError(format(\"reading directory ‘%1%’\") % linksDir);\n\n    printMsg(lvlTalkative, format(\"loaded %1% hash inodes\") % inodeHash.size());\n\n    return inodeHash;\n}\n\n\nStrings LocalStore::readDirectoryIgnoringInodes(const Path & path, const InodeHash & inodeHash)\n{\n    Strings names;\n\n    AutoCloseDir dir(opendir(path.c_str()));\n    if (!dir) throw SysError(format(\"opening directory ‘%1%’\") % path);\n\n    struct dirent * dirent;\n    while (errno = 0, dirent = readdir(dir.get())) { \/* sic *\/\n        checkInterrupt();\n\n        if (inodeHash.count(dirent->d_ino)) {\n            debug(format(\"‘%1%’ is already linked\") % dirent->d_name);\n            continue;\n        }\n\n        string name = dirent->d_name;\n        if (name == \".\" || name == \"..\") continue;\n        names.push_back(name);\n    }\n    if (errno) throw SysError(format(\"reading directory ‘%1%’\") % path);\n\n    return names;\n}\n\n\nvoid LocalStore::optimisePath_(OptimiseStats & stats, const Path & path, InodeHash & inodeHash)\n{\n    checkInterrupt();\n\n    struct stat st;\n    if (lstat(path.c_str(), &st))\n        throw SysError(format(\"getting attributes of path ‘%1%’\") % path);\n\n    if (S_ISDIR(st.st_mode)) {\n        Strings names = readDirectoryIgnoringInodes(path, inodeHash);\n        for (auto & i : names)\n            optimisePath_(stats, path + \"\/\" + i, inodeHash);\n        return;\n    }\n\n    \/* We can hard link regular files and maybe symlinks. *\/\n    if (!S_ISREG(st.st_mode)\n#if CAN_LINK_SYMLINK\n        && !S_ISLNK(st.st_mode)\n#endif\n        ) return;\n\n    \/* Sometimes SNAFUs can cause files in the Nix store to be\n       modified, in particular when running programs as root under\n       NixOS (example: $fontconfig\/var\/cache being modified).  Skip\n       those files.  FIXME: check the modification time. *\/\n    if (S_ISREG(st.st_mode) && (st.st_mode & S_IWUSR)) {\n        printError(format(\"skipping suspicious writable file ‘%1%’\") % path);\n        return;\n    }\n\n    \/* This can still happen on top-level files. *\/\n    if (st.st_nlink > 1 && inodeHash.count(st.st_ino)) {\n        debug(format(\"‘%1%’ is already linked, with %2% other file(s)\") % path % (st.st_nlink - 2));\n        return;\n    }\n\n    \/* Hash the file.  Note that hashPath() returns the hash over the\n       NAR serialisation, which includes the execute bit on the file.\n       Thus, executable and non-executable files with the same\n       contents *won't* be linked (which is good because otherwise the\n       permissions would be screwed up).\n\n       Also note that if `path' is a symlink, then we're hashing the\n       contents of the symlink (i.e. the result of readlink()), not\n       the contents of the target (which may not even exist). *\/\n    Hash hash = hashPath(htSHA256, path).first;\n    debug(format(\"‘%1%’ has hash ‘%2%’\") % path % printHash(hash));\n\n    \/* Check if this is a known hash. *\/\n    Path linkPath = linksDir + \"\/\" + printHash32(hash);\n\n retry:\n    if (!pathExists(linkPath)) {\n        \/* Nope, create a hard link in the links directory. *\/\n        if (link(path.c_str(), linkPath.c_str()) == 0) {\n            inodeHash.insert(st.st_ino);\n            return;\n        }\n\n        switch (errno) {\n        case EEXIST:\n            \/* Fall through if another process created ‘linkPath’ before\n               we did. *\/\n            break;\n\n        case ENOSPC:\n            \/* On ext4, that probably means the directory index is\n               full.  When that happens, it's fine to ignore it: we\n               just effectively disable deduplication of this\n               file.  *\/\n            printInfo(\"cannot link ‘%s’ to ‘%s’: %s\", linkPath, path, strerror(errno));\n            return;\n\n        default:\n            throw SysError(\"cannot link ‘%1%’ to ‘%2%’\", linkPath, path);\n        }\n    }\n\n    \/* Yes!  We've seen a file with the same contents.  Replace the\n       current file with a hard link to that file. *\/\n    struct stat stLink;\n    if (lstat(linkPath.c_str(), &stLink))\n        throw SysError(format(\"getting attributes of path ‘%1%’\") % linkPath);\n\n    if (st.st_ino == stLink.st_ino) {\n        debug(format(\"‘%1%’ is already linked to ‘%2%’\") % path % linkPath);\n        return;\n    }\n\n    if (st.st_size != stLink.st_size) {\n        printError(format(\"removing corrupted link ‘%1%’\") % linkPath);\n        unlink(linkPath.c_str());\n        goto retry;\n    }\n\n    printMsg(lvlTalkative, format(\"linking ‘%1%’ to ‘%2%’\") % path % linkPath);\n\n    \/* Make the containing directory writable, but only if it's not\n       the store itself (we don't want or need to mess with its\n       permissions). *\/\n    bool mustToggle = dirOf(path) != realStoreDir;\n    if (mustToggle) makeWritable(dirOf(path));\n\n    \/* When we're done, make the directory read-only again and reset\n       its timestamp back to 0. *\/\n    MakeReadOnly makeReadOnly(mustToggle ? dirOf(path) : \"\");\n\n    Path tempLink = (format(\"%1%\/.tmp-link-%2%-%3%\")\n        % realStoreDir % getpid() % rand()).str();\n\n    if (link(linkPath.c_str(), tempLink.c_str()) == -1) {\n        if (errno == EMLINK) {\n            \/* Too many links to the same file (>= 32000 on most file\n               systems).  This is likely to happen with empty files.\n               Just shrug and ignore. *\/\n            if (st.st_size)\n                printInfo(format(\"‘%1%’ has maximum number of links\") % linkPath);\n            return;\n        }\n        throw SysError(\"cannot link ‘%1%’ to ‘%2%’\", tempLink, linkPath);\n    }\n\n    \/* Atomically replace the old file with the new hard link. *\/\n    if (rename(tempLink.c_str(), path.c_str()) == -1) {\n        if (unlink(tempLink.c_str()) == -1)\n            printError(format(\"unable to unlink ‘%1%’\") % tempLink);\n        if (errno == EMLINK) {\n            \/* Some filesystems generate too many links on the rename,\n               rather than on the original link.  (Probably it\n               temporarily increases the st_nlink field before\n               decreasing it again.) *\/\n            if (st.st_size)\n                printInfo(format(\"‘%1%’ has maximum number of links\") % linkPath);\n            return;\n        }\n        throw SysError(format(\"cannot rename ‘%1%’ to ‘%2%’\") % tempLink % path);\n    }\n\n    stats.filesLinked++;\n    stats.bytesFreed += st.st_size;\n    stats.blocksFreed += st.st_blocks;\n}\n\n\nvoid LocalStore::optimiseStore(OptimiseStats & stats)\n{\n    PathSet paths = queryAllValidPaths();\n    InodeHash inodeHash = loadInodeHash();\n\n    for (auto & i : paths) {\n        addTempRoot(i);\n        if (!isValidPath(i)) continue; \/* path was GC'ed, probably *\/\n        Activity act(*logger, lvlChatty, format(\"hashing files in ‘%1%’\") % i);\n        optimisePath_(stats, realStoreDir + \"\/\" + baseNameOf(i), inodeHash);\n    }\n}\n\nstatic string showBytes(unsigned long long bytes)\n{\n    return (format(\"%.2f MiB\") % (bytes \/ (1024.0 * 1024.0))).str();\n}\n\nvoid LocalStore::optimiseStore()\n{\n    OptimiseStats stats;\n\n    optimiseStore(stats);\n\n    printError(\n        format(\"%1% freed by hard-linking %2% files\")\n        % showBytes(stats.bytesFreed)\n        % stats.filesLinked);\n}\n\nvoid LocalStore::optimisePath(const Path & path)\n{\n    OptimiseStats stats;\n    InodeHash inodeHash;\n\n    if (settings.autoOptimiseStore) optimisePath_(stats, path, inodeHash);\n}\n\n\n}\n<commit_msg>Reduce severity of EMLINK warnings<commit_after>#include \"util.hh\"\n#include \"local-store.hh\"\n#include \"globals.hh\"\n\n#include <cstdlib>\n#include <cstring>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <errno.h>\n#include <stdio.h>\n\n\nnamespace nix {\n\n\nstatic void makeWritable(const Path & path)\n{\n    struct stat st;\n    if (lstat(path.c_str(), &st))\n        throw SysError(format(\"getting attributes of path ‘%1%’\") % path);\n    if (chmod(path.c_str(), st.st_mode | S_IWUSR) == -1)\n        throw SysError(format(\"changing writability of ‘%1%’\") % path);\n}\n\n\nstruct MakeReadOnly\n{\n    Path path;\n    MakeReadOnly(const Path & path) : path(path) { }\n    ~MakeReadOnly()\n    {\n        try {\n            \/* This will make the path read-only. *\/\n            if (path != \"\") canonicaliseTimestampAndPermissions(path);\n        } catch (...) {\n            ignoreException();\n        }\n    }\n};\n\n\nLocalStore::InodeHash LocalStore::loadInodeHash()\n{\n    debug(\"loading hash inodes in memory\");\n    InodeHash inodeHash;\n\n    AutoCloseDir dir(opendir(linksDir.c_str()));\n    if (!dir) throw SysError(format(\"opening directory ‘%1%’\") % linksDir);\n\n    struct dirent * dirent;\n    while (errno = 0, dirent = readdir(dir.get())) { \/* sic *\/\n        checkInterrupt();\n        \/\/ We don't care if we hit non-hash files, anything goes\n        inodeHash.insert(dirent->d_ino);\n    }\n    if (errno) throw SysError(format(\"reading directory ‘%1%’\") % linksDir);\n\n    printMsg(lvlTalkative, format(\"loaded %1% hash inodes\") % inodeHash.size());\n\n    return inodeHash;\n}\n\n\nStrings LocalStore::readDirectoryIgnoringInodes(const Path & path, const InodeHash & inodeHash)\n{\n    Strings names;\n\n    AutoCloseDir dir(opendir(path.c_str()));\n    if (!dir) throw SysError(format(\"opening directory ‘%1%’\") % path);\n\n    struct dirent * dirent;\n    while (errno = 0, dirent = readdir(dir.get())) { \/* sic *\/\n        checkInterrupt();\n\n        if (inodeHash.count(dirent->d_ino)) {\n            debug(format(\"‘%1%’ is already linked\") % dirent->d_name);\n            continue;\n        }\n\n        string name = dirent->d_name;\n        if (name == \".\" || name == \"..\") continue;\n        names.push_back(name);\n    }\n    if (errno) throw SysError(format(\"reading directory ‘%1%’\") % path);\n\n    return names;\n}\n\n\nvoid LocalStore::optimisePath_(OptimiseStats & stats, const Path & path, InodeHash & inodeHash)\n{\n    checkInterrupt();\n\n    struct stat st;\n    if (lstat(path.c_str(), &st))\n        throw SysError(format(\"getting attributes of path ‘%1%’\") % path);\n\n    if (S_ISDIR(st.st_mode)) {\n        Strings names = readDirectoryIgnoringInodes(path, inodeHash);\n        for (auto & i : names)\n            optimisePath_(stats, path + \"\/\" + i, inodeHash);\n        return;\n    }\n\n    \/* We can hard link regular files and maybe symlinks. *\/\n    if (!S_ISREG(st.st_mode)\n#if CAN_LINK_SYMLINK\n        && !S_ISLNK(st.st_mode)\n#endif\n        ) return;\n\n    \/* Sometimes SNAFUs can cause files in the Nix store to be\n       modified, in particular when running programs as root under\n       NixOS (example: $fontconfig\/var\/cache being modified).  Skip\n       those files.  FIXME: check the modification time. *\/\n    if (S_ISREG(st.st_mode) && (st.st_mode & S_IWUSR)) {\n        printError(format(\"skipping suspicious writable file ‘%1%’\") % path);\n        return;\n    }\n\n    \/* This can still happen on top-level files. *\/\n    if (st.st_nlink > 1 && inodeHash.count(st.st_ino)) {\n        debug(format(\"‘%1%’ is already linked, with %2% other file(s)\") % path % (st.st_nlink - 2));\n        return;\n    }\n\n    \/* Hash the file.  Note that hashPath() returns the hash over the\n       NAR serialisation, which includes the execute bit on the file.\n       Thus, executable and non-executable files with the same\n       contents *won't* be linked (which is good because otherwise the\n       permissions would be screwed up).\n\n       Also note that if `path' is a symlink, then we're hashing the\n       contents of the symlink (i.e. the result of readlink()), not\n       the contents of the target (which may not even exist). *\/\n    Hash hash = hashPath(htSHA256, path).first;\n    debug(format(\"‘%1%’ has hash ‘%2%’\") % path % printHash(hash));\n\n    \/* Check if this is a known hash. *\/\n    Path linkPath = linksDir + \"\/\" + printHash32(hash);\n\n retry:\n    if (!pathExists(linkPath)) {\n        \/* Nope, create a hard link in the links directory. *\/\n        if (link(path.c_str(), linkPath.c_str()) == 0) {\n            inodeHash.insert(st.st_ino);\n            return;\n        }\n\n        switch (errno) {\n        case EEXIST:\n            \/* Fall through if another process created ‘linkPath’ before\n               we did. *\/\n            break;\n\n        case ENOSPC:\n            \/* On ext4, that probably means the directory index is\n               full.  When that happens, it's fine to ignore it: we\n               just effectively disable deduplication of this\n               file.  *\/\n            printInfo(\"cannot link ‘%s’ to ‘%s’: %s\", linkPath, path, strerror(errno));\n            return;\n\n        default:\n            throw SysError(\"cannot link ‘%1%’ to ‘%2%’\", linkPath, path);\n        }\n    }\n\n    \/* Yes!  We've seen a file with the same contents.  Replace the\n       current file with a hard link to that file. *\/\n    struct stat stLink;\n    if (lstat(linkPath.c_str(), &stLink))\n        throw SysError(format(\"getting attributes of path ‘%1%’\") % linkPath);\n\n    if (st.st_ino == stLink.st_ino) {\n        debug(format(\"‘%1%’ is already linked to ‘%2%’\") % path % linkPath);\n        return;\n    }\n\n    if (st.st_size != stLink.st_size) {\n        printError(format(\"removing corrupted link ‘%1%’\") % linkPath);\n        unlink(linkPath.c_str());\n        goto retry;\n    }\n\n    printMsg(lvlTalkative, format(\"linking ‘%1%’ to ‘%2%’\") % path % linkPath);\n\n    \/* Make the containing directory writable, but only if it's not\n       the store itself (we don't want or need to mess with its\n       permissions). *\/\n    bool mustToggle = dirOf(path) != realStoreDir;\n    if (mustToggle) makeWritable(dirOf(path));\n\n    \/* When we're done, make the directory read-only again and reset\n       its timestamp back to 0. *\/\n    MakeReadOnly makeReadOnly(mustToggle ? dirOf(path) : \"\");\n\n    Path tempLink = (format(\"%1%\/.tmp-link-%2%-%3%\")\n        % realStoreDir % getpid() % rand()).str();\n\n    if (link(linkPath.c_str(), tempLink.c_str()) == -1) {\n        if (errno == EMLINK) {\n            \/* Too many links to the same file (>= 32000 on most file\n               systems).  This is likely to happen with empty files.\n               Just shrug and ignore. *\/\n            if (st.st_size)\n                printInfo(format(\"‘%1%’ has maximum number of links\") % linkPath);\n            return;\n        }\n        throw SysError(\"cannot link ‘%1%’ to ‘%2%’\", tempLink, linkPath);\n    }\n\n    \/* Atomically replace the old file with the new hard link. *\/\n    if (rename(tempLink.c_str(), path.c_str()) == -1) {\n        if (unlink(tempLink.c_str()) == -1)\n            printError(format(\"unable to unlink ‘%1%’\") % tempLink);\n        if (errno == EMLINK) {\n            \/* Some filesystems generate too many links on the rename,\n               rather than on the original link.  (Probably it\n               temporarily increases the st_nlink field before\n               decreasing it again.) *\/\n            debug(\"‘%s’ has reached maximum number of links\", linkPath);\n            return;\n        }\n        throw SysError(format(\"cannot rename ‘%1%’ to ‘%2%’\") % tempLink % path);\n    }\n\n    stats.filesLinked++;\n    stats.bytesFreed += st.st_size;\n    stats.blocksFreed += st.st_blocks;\n}\n\n\nvoid LocalStore::optimiseStore(OptimiseStats & stats)\n{\n    PathSet paths = queryAllValidPaths();\n    InodeHash inodeHash = loadInodeHash();\n\n    for (auto & i : paths) {\n        addTempRoot(i);\n        if (!isValidPath(i)) continue; \/* path was GC'ed, probably *\/\n        Activity act(*logger, lvlChatty, format(\"hashing files in ‘%1%’\") % i);\n        optimisePath_(stats, realStoreDir + \"\/\" + baseNameOf(i), inodeHash);\n    }\n}\n\nstatic string showBytes(unsigned long long bytes)\n{\n    return (format(\"%.2f MiB\") % (bytes \/ (1024.0 * 1024.0))).str();\n}\n\nvoid LocalStore::optimiseStore()\n{\n    OptimiseStats stats;\n\n    optimiseStore(stats);\n\n    printError(\n        format(\"%1% freed by hard-linking %2% files\")\n        % showBytes(stats.bytesFreed)\n        % stats.filesLinked);\n}\n\nvoid LocalStore::optimisePath(const Path & path)\n{\n    OptimiseStats stats;\n    InodeHash inodeHash;\n\n    if (settings.autoOptimiseStore) optimisePath_(stats, path, inodeHash);\n}\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *   Copyright (C) 2016 by Savoir-faire Linux                               *\n *   Author : Alexandre Lision <alexandre.lision@savoirfairelinux.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 General Public License      *\n *   along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.  *\n ***************************************************************************\/\n#include \"localprofilecollection.h\"\n\n\/\/Qt\n#include <QtCore\/QFile>\n#include <QtCore\/QDir>\n#include <QtCore\/QHash>\n#include <QtCore\/QStandardPaths>\n#include <QtCore\/QUrl>\n#include <QtCore\/QVector>\n#include <QtCore\/QDateTime>\n\n\/\/Ring\n#include \"profile.h\"\n#include \"private\/vcardutils.h\"\n#include \"account.h\"\n#include \"accountmodel.h\"\n#include \"person.h\"\n\nclass LocalProfileEditor final : public CollectionEditor<Profile>\n{\npublic:\n   LocalProfileEditor(CollectionMediator<Profile>* m, LocalProfileCollection* parent);\n   virtual bool save       ( const Profile* item ) override;\n   virtual bool remove     ( const Profile* item ) override;\n   virtual bool edit       ( Profile*       item ) override;\n   virtual bool addNew     ( Profile*       item ) override;\n   virtual bool addExisting( const Profile* item ) override;\n\nprivate:\n    virtual QVector<Profile*> items() const override;\n\n    \/\/Helpers\n    QString path(const Profile* p) const;\n\n    \/\/Attributes\n    QVector<Profile*> m_lItems;\n    LocalProfileCollection* m_pCollection;\n};\n\nLocalProfileEditor::LocalProfileEditor(CollectionMediator<Profile>* m, LocalProfileCollection* parent) :\nCollectionEditor<Profile>(m),m_pCollection(parent)\n{\n\n}\n\nLocalProfileCollection::LocalProfileCollection(CollectionMediator<Profile>* mediator) :\nCollectionInterface(new LocalProfileEditor(mediator,this))\n{\n\n}\n\nLocalProfileCollection::~LocalProfileCollection()\n{\n\n}\n\nbool LocalProfileEditor::save(const Profile* pro)\n{\n    const auto& filename = path(pro);\n    const auto& result = pro->person()->toVCard(pro->accounts().toList());\n\n    qDebug() << \"Saving profile in:\" << filename;\n    QFile file {filename};\n    file.open(QIODevice::WriteOnly);\n    file.write(result);\n    file.close();\n    return true;\n}\n\nbool LocalProfileEditor::remove(const Profile* item)\n{\n    if (QFile::remove(path(item))) {\n        mediator()->removeItem(item);\n        return true;\n    }\n\n    return false;\n}\n\nbool LocalProfileEditor::edit( Profile* item)\n{\n   Q_UNUSED(item)\n   return false;\n}\n\nbool LocalProfileEditor::addNew(Profile* pro)\n{\n    pro->person()->ensureUid();\n    qDebug() << \"Creating new profile\" << pro->person()->uid();\n    m_lItems << pro;\n    pro->setCollection(m_pCollection);\n    mediator()->addItem(pro);\n    save(pro);\n    return true;\n}\n\nbool LocalProfileEditor::addExisting(const Profile* item)\n{\n   m_lItems << const_cast<Profile*>(item);\n   mediator()->addItem(item);\n   return true;\n}\n\nQVector<Profile*> LocalProfileEditor::items() const\n{\n   return m_lItems;\n}\n\nQString LocalProfileEditor::path(const Profile* p) const\n{\n   const QDir profilesDir = (QStandardPaths::writableLocation(QStandardPaths::DataLocation)) + \"\/profiles\/\";\n   profilesDir.mkpath(profilesDir.path());\n   return QString(\"%1\/%2.vcf\")\n      .arg(profilesDir.absolutePath())\n      .arg(QString(p->person()->uid()));\n}\n\nQString LocalProfileCollection::name () const\n{\n   return QObject::tr(\"Local profiles\");\n}\n\nQString LocalProfileCollection::category () const\n{\n   return QObject::tr(\"Profile Collection\");\n}\n\nQVariant LocalProfileCollection::icon() const\n{\n   return QVariant();\n}\n\nbool LocalProfileCollection::isEnabled() const\n{\n   return true;\n}\n\nbool LocalProfileCollection::load()\n{\n    const QDir profilesDir = (QStandardPaths::writableLocation(QStandardPaths::DataLocation)) + \"\/profiles\/\";\n    qDebug() << \"Loading vcf from:\" << profilesDir;\n\n    const QStringList entries = profilesDir.entryList({QStringLiteral(\"*.vcf\")}, QDir::Files);\n    bool hasProfile = false;\n\n    foreach (const QString& item , entries) {\n        hasProfile = true;\n        auto personProfile = new Person(nullptr);\n        QList<Account*> accs;\n        VCardUtils::mapToPerson(personProfile,QUrl(profilesDir.path()+'\/'+item),&accs);\n        auto profile = new Profile(this, personProfile);\n        profile->setAccounts(accs.toVector());\n        editor<Profile>()->addExisting(profile);\n    }\n\n    if (!hasProfile) {\n        \/\/Ring needs at least one global profile\n        setupDefaultProfile();\n    }\n    return true;\n}\n\nbool LocalProfileCollection::reload()\n{\n    return true;\n}\n\nFlagPack<CollectionInterface::SupportedFeatures> LocalProfileCollection::supportedFeatures() const\n{\n   return\n      CollectionInterface::SupportedFeatures::NONE       |\n      CollectionInterface::SupportedFeatures::LOAD       |\n      CollectionInterface::SupportedFeatures::CLEAR      |\n      CollectionInterface::SupportedFeatures::REMOVE     |\n      CollectionInterface::SupportedFeatures::MANAGEABLE |\n      CollectionInterface::SupportedFeatures::ADD        ;\n}\n\nbool LocalProfileCollection::clear()\n{\n   QFile::remove((QStandardPaths::writableLocation(QStandardPaths::DataLocation)) + \"\/profiles\/\");\n   return true;\n}\n\nQByteArray LocalProfileCollection::id() const\n{\n   return \"lpc\";\n}\n\nvoid LocalProfileCollection::setupDefaultProfile()\n{\n   auto profile = new Profile(this, new Person());\n   profile->person()->setFormattedName(QObject::tr(\"Default\"));\n\n   for (int i = 0 ; i < AccountModel::instance().size() ; i++) {\n       profile->addAccount(AccountModel::instance()[i]);\n   }\n\n   editor<Profile>()->addNew(profile);\n}\n<commit_msg>localprofile: Check the result of `open()`<commit_after>\/****************************************************************************\n *   Copyright (C) 2016 by Savoir-faire Linux                               *\n *   Author : Alexandre Lision <alexandre.lision@savoirfairelinux.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 General Public License      *\n *   along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.  *\n ***************************************************************************\/\n#include \"localprofilecollection.h\"\n\n\/\/Qt\n#include <QtCore\/QFile>\n#include <QtCore\/QDir>\n#include <QtCore\/QHash>\n#include <QtCore\/QStandardPaths>\n#include <QtCore\/QUrl>\n#include <QtCore\/QVector>\n#include <QtCore\/QDateTime>\n\n\/\/Ring\n#include \"profile.h\"\n#include \"private\/vcardutils.h\"\n#include \"account.h\"\n#include \"accountmodel.h\"\n#include \"person.h\"\n\nclass LocalProfileEditor final : public CollectionEditor<Profile>\n{\npublic:\n   LocalProfileEditor(CollectionMediator<Profile>* m, LocalProfileCollection* parent);\n   virtual bool save       ( const Profile* item ) override;\n   virtual bool remove     ( const Profile* item ) override;\n   virtual bool edit       ( Profile*       item ) override;\n   virtual bool addNew     ( Profile*       item ) override;\n   virtual bool addExisting( const Profile* item ) override;\n\nprivate:\n    virtual QVector<Profile*> items() const override;\n\n    \/\/Helpers\n    QString path(const Profile* p) const;\n\n    \/\/Attributes\n    QVector<Profile*> m_lItems;\n    LocalProfileCollection* m_pCollection;\n};\n\nLocalProfileEditor::LocalProfileEditor(CollectionMediator<Profile>* m, LocalProfileCollection* parent) :\nCollectionEditor<Profile>(m),m_pCollection(parent)\n{\n\n}\n\nLocalProfileCollection::LocalProfileCollection(CollectionMediator<Profile>* mediator) :\nCollectionInterface(new LocalProfileEditor(mediator,this))\n{\n\n}\n\nLocalProfileCollection::~LocalProfileCollection()\n{\n\n}\n\nbool LocalProfileEditor::save(const Profile* pro)\n{\n    const auto& filename = path(pro);\n    const auto& result = pro->person()->toVCard(pro->accounts().toList());\n\n    qDebug() << \"Saving profile in:\" << filename;\n    QFile file {filename};\n\n    if (Q_UNLIKELY(!file.open(QIODevice::WriteOnly))) {\n        qWarning() << \"Can't write to\" << filename;\n        return false;\n    }\n\n    file.write(result);\n    file.close();\n    return true;\n}\n\nbool LocalProfileEditor::remove(const Profile* item)\n{\n    if (QFile::remove(path(item))) {\n        mediator()->removeItem(item);\n        return true;\n    }\n\n    return false;\n}\n\nbool LocalProfileEditor::edit( Profile* item)\n{\n   Q_UNUSED(item)\n   return false;\n}\n\nbool LocalProfileEditor::addNew(Profile* pro)\n{\n    pro->person()->ensureUid();\n    qDebug() << \"Creating new profile\" << pro->person()->uid();\n    m_lItems << pro;\n    pro->setCollection(m_pCollection);\n    mediator()->addItem(pro);\n    save(pro);\n    return true;\n}\n\nbool LocalProfileEditor::addExisting(const Profile* item)\n{\n   m_lItems << const_cast<Profile*>(item);\n   mediator()->addItem(item);\n   return true;\n}\n\nQVector<Profile*> LocalProfileEditor::items() const\n{\n   return m_lItems;\n}\n\nQString LocalProfileEditor::path(const Profile* p) const\n{\n   const QDir profilesDir = (QStandardPaths::writableLocation(QStandardPaths::DataLocation)) + \"\/profiles\/\";\n   profilesDir.mkpath(profilesDir.path());\n   return QString(\"%1\/%2.vcf\")\n      .arg(profilesDir.absolutePath())\n      .arg(QString(p->person()->uid()));\n}\n\nQString LocalProfileCollection::name () const\n{\n   return QObject::tr(\"Local profiles\");\n}\n\nQString LocalProfileCollection::category () const\n{\n   return QObject::tr(\"Profile Collection\");\n}\n\nQVariant LocalProfileCollection::icon() const\n{\n   return QVariant();\n}\n\nbool LocalProfileCollection::isEnabled() const\n{\n   return true;\n}\n\nbool LocalProfileCollection::load()\n{\n    const QDir profilesDir = (QStandardPaths::writableLocation(QStandardPaths::DataLocation)) + \"\/profiles\/\";\n    qDebug() << \"Loading vcf from:\" << profilesDir;\n\n    const QStringList entries = profilesDir.entryList({QStringLiteral(\"*.vcf\")}, QDir::Files);\n    bool hasProfile = false;\n\n    foreach (const QString& item , entries) {\n        hasProfile = true;\n        auto personProfile = new Person(nullptr);\n        QList<Account*> accs;\n        VCardUtils::mapToPerson(personProfile,QUrl(profilesDir.path()+'\/'+item),&accs);\n        auto profile = new Profile(this, personProfile);\n        profile->setAccounts(accs.toVector());\n        editor<Profile>()->addExisting(profile);\n    }\n\n    if (!hasProfile) {\n        \/\/Ring needs at least one global profile\n        setupDefaultProfile();\n    }\n    return true;\n}\n\nbool LocalProfileCollection::reload()\n{\n    return true;\n}\n\nFlagPack<CollectionInterface::SupportedFeatures> LocalProfileCollection::supportedFeatures() const\n{\n   return\n      CollectionInterface::SupportedFeatures::NONE       |\n      CollectionInterface::SupportedFeatures::LOAD       |\n      CollectionInterface::SupportedFeatures::CLEAR      |\n      CollectionInterface::SupportedFeatures::REMOVE     |\n      CollectionInterface::SupportedFeatures::MANAGEABLE |\n      CollectionInterface::SupportedFeatures::ADD        ;\n}\n\nbool LocalProfileCollection::clear()\n{\n   QFile::remove((QStandardPaths::writableLocation(QStandardPaths::DataLocation)) + \"\/profiles\/\");\n   return true;\n}\n\nQByteArray LocalProfileCollection::id() const\n{\n   return \"lpc\";\n}\n\nvoid LocalProfileCollection::setupDefaultProfile()\n{\n   auto profile = new Profile(this, new Person());\n   profile->person()->setFormattedName(QObject::tr(\"Default\"));\n\n   for (int i = 0 ; i < AccountModel::instance().size() ; i++) {\n       profile->addAccount(AccountModel::instance()[i]);\n   }\n\n   editor<Profile>()->addNew(profile);\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 <iostream>\n#include <boost\/optional.hpp>\n\n#include \"Utils.hpp\"\n#include \"PerfsTimer.hpp\"\n#include \"Options.hpp\"\n#include \"likely.hpp\"\n\n#include \"ltac\/PeepholeOptimizer.hpp\"\n#include \"ltac\/Printer.hpp\"\n\n#include \"mtac\/Utils.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\ntemplate<typename T>\ninline bool is_reg(T value){\n    return mtac::is<ltac::Register>(value);\n}\n\ninline bool transform_to_nop(std::shared_ptr<ltac::Instruction> instruction){\n    if(instruction->op == ltac::Operator::NOP){\n        return false;\n    }\n    \n    instruction->op = ltac::Operator::NOP;\n    instruction->arg1.reset();\n    instruction->arg2.reset();\n\n    return true;\n}\n\ninline bool optimize_statement(ltac::Statement& statement){\n    if(boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n        auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n        if(instruction->op == ltac::Operator::MOV){\n            \/\/MOV reg, 0 can be transformed into XOR reg, reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n                instruction->op = ltac::Operator::XOR;\n                instruction->arg2 = instruction->arg1;\n\n                return true;\n            }\n\n            if(is_reg(*instruction->arg1) && is_reg(*instruction->arg2)){\n                auto& reg1 = boost::get<ltac::Register>(*instruction->arg1); \n                auto& reg2 = boost::get<ltac::Register>(*instruction->arg2); \n            \n                \/\/MOV reg, reg is useless\n                if(reg1 == reg2){\n                    return transform_to_nop(instruction);\n                }\n            }\n        }\n\n        if(instruction->op == ltac::Operator::ADD){\n            \/\/ADD reg, 1 can be transformed into INC reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n                instruction->op = ltac::Operator::INC;\n                instruction->arg2.reset();\n\n                return true;\n            }\n            \n            \/\/ADD reg, -1 can be transformed into DEC reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n                instruction->op = ltac::Operator::DEC;\n                instruction->arg2.reset();\n\n                    return true;\n            }\n        }\n        \n        if(instruction->op == ltac::Operator::SUB){\n            \/\/SUB reg, 1 can be transformed into DEC reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n                instruction->op = ltac::Operator::DEC;\n                instruction->arg2.reset();\n\n                    return true;\n            }\n            \n            \/\/SUB reg, -1 can be transformed into INC reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n                instruction->op = ltac::Operator::INC;\n                instruction->arg2.reset();\n\n                    return true;\n            }\n        }\n\n        if(instruction->op == ltac::Operator::MUL){\n            \/\/Optimize multiplications with SHIFTs or LEAs\n            if(is_reg(*instruction->arg1) && mtac::is<int>(*instruction->arg2)){\n                int constant = boost::get<int>(*instruction->arg2);\n\n                auto reg = boost::get<ltac::Register>(*instruction->arg1);\n        \n                if(isPowerOfTwo(constant)){\n                    instruction->op = ltac::Operator::SHIFT_LEFT;\n                    instruction->arg2 = powerOfTwo(constant);\n\n                    return true;\n                } \n                \n                if(constant == 3){\n                    instruction->op = ltac::Operator::LEA;\n                    instruction->arg2 = ltac::Address(reg, reg, 2, 0);\n\n                    return true;\n                } \n                \n                if(constant == 5){\n                    instruction->op = ltac::Operator::LEA;\n                    instruction->arg2 = ltac::Address(reg, reg, 4, 0);\n\n                    return true;\n                } \n                \n                if(constant == 9){\n                    instruction->op = ltac::Operator::LEA;\n                    instruction->arg2 = ltac::Address(reg, reg, 8, 0);\n\n                    return true;\n                } \n            }\n        }\n\n        if(instruction->op == ltac::Operator::CMP_INT){\n            \/\/Optimize comparisons with 0 with or reg, reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n                instruction->op = ltac::Operator::OR;\n                instruction->arg2 = instruction->arg1;\n\n                    return true;\n            }\n        }\n    }\n\n    return false;\n}\n\ninline bool multiple_statement_optimizations(ltac::Statement& s1, ltac::Statement& s2){\n    if(mtac::is<std::shared_ptr<ltac::Instruction>>(s1) && mtac::is<std::shared_ptr<ltac::Instruction>>(s2)){\n        auto& i1 = boost::get<std::shared_ptr<ltac::Instruction>>(s1);\n        auto& i2 = boost::get<std::shared_ptr<ltac::Instruction>>(s2);\n\n        \/\/Statements after LEAVE are dead\n        if(i1->op == ltac::Operator::LEAVE){\n            return transform_to_nop(i2);\n        }\n\n        \/\/Combine two FREE STACK into one\n        if(i1->op == ltac::Operator::FREE_STACK && i2->op == ltac::Operator::FREE_STACK){\n            i1->arg1 = boost::get<int>(*i1->arg1) + boost::get<int>(*i2->arg1);\n            \n            return transform_to_nop(i2);\n        }\n\n        if(i1->op == ltac::Operator::MOV && i2->op == ltac::Operator::MOV){\n            if(is_reg(*i1->arg1) && is_reg(*i1->arg2) && is_reg(*i2->arg1) && is_reg(*i2->arg2)){\n                auto reg11 = boost::get<ltac::Register>(*i1->arg1);\n                auto reg12 = boost::get<ltac::Register>(*i1->arg2);\n                auto reg21 = boost::get<ltac::Register>(*i2->arg1);\n                auto reg22 = boost::get<ltac::Register>(*i2->arg2);\n\n                \/\/cross MOV (ir4 = ir5, ir5 = ir4), keep only the first\n                if (reg11 == reg22 && reg12 == reg21){\n                    return transform_to_nop(i2);\n                }\n            } else if(is_reg(*i1->arg1) && is_reg(*i2->arg1)){\n                auto reg11 = boost::get<ltac::Register>(*i1->arg1);\n                auto reg21 = boost::get<ltac::Register>(*i2->arg1);\n\n                \/\/Two MOV to the same register => keep only last MOV\n                if(reg11 == reg21){\n                    return transform_to_nop(i1);\n                }\n            } else if(is_reg(*i1->arg1) && is_reg(*i2->arg2)){\n                if(boost::get<ltac::Address>(&*i1->arg2) && boost::get<ltac::Address>(&*i2->arg1)){\n                    if(boost::get<ltac::Address>(*i1->arg2) == boost::get<ltac::Address>(*i2->arg1)){\n                        return transform_to_nop(i2);\n                    }\n                }\n            } else if(is_reg(*i1->arg2) && is_reg(*i2->arg1)){\n                if(boost::get<ltac::Address>(&*i1->arg1) && boost::get<ltac::Address>(&*i2->arg2)){\n                    if(boost::get<ltac::Address>(*i1->arg1) == boost::get<ltac::Address>(*i2->arg2)){\n                        return transform_to_nop(i2);\n                    }\n                }\n            }\n        }\n\n        if(i1->op == ltac::Operator::MOV && i2->op == ltac::Operator::ADD){\n            if(is_reg(*i1->arg1) && is_reg(*i2->arg1)){\n                if(boost::get<ltac::Register>(*i1->arg1) == boost::get<ltac::Register>(*i2->arg1)){\n                    if(boost::get<ltac::Register>(&*i1->arg2) && boost::get<int>(&*i2->arg2)){\n                        i2->op = ltac::Operator::LEA;\n                        i2->arg2 = ltac::Address(boost::get<ltac::Register>(*i1->arg2), boost::get<int>(*i2->arg2));\n\n                        return transform_to_nop(i1);\n                    } else if(boost::get<std::string>(&*i1->arg2) && boost::get<int>(&*i2->arg2)){\n                        i2->op = ltac::Operator::LEA;\n                        i2->arg2 = ltac::Address(boost::get<std::string>(*i1->arg2), boost::get<int>(*i2->arg2));\n\n                        return transform_to_nop(i1);\n                    }\n                }\n            }\n        }\n    }\n\n    return false;\n}\n\ninline bool is_nop(ltac::Statement& statement){\n    if(mtac::is<std::shared_ptr<ltac::Instruction>>(statement)){\n        auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n        if(instruction->op == ltac::Operator::NOP){\n            return true;\n        }\n    }\n\n    return false;\n}\n\nbool basic_optimizations(std::shared_ptr<ltac::Function> function){\n    auto& statements = function->getStatements();\n\n    auto it = statements.begin();\n    auto end = statements.end() - 1;\n\n    bool optimized = false;\n\n    while(it != end){\n        auto& s1 = *it;\n        auto& s2 = *(it + 1);\n\n        \/\/Optimizations that looks at only one statement\n        optimized |= optimize_statement(s1);\n        optimized |= optimize_statement(s2);\n\n        \/\/Optimizations that looks at several statements at once\n        optimized |= multiple_statement_optimizations(s1, s2);\n\n        if(unlikely(is_nop(s1))){\n            it = statements.erase(it);\n            end = statements.end() - 1;\n\n            continue;\n        }\n\n        ++it;\n    }\n\n    return optimized;\n}\n\nbool constant_propagation(std::shared_ptr<ltac::Function> function){\n    bool optimized = false;\n\n    auto& statements = function->getStatements();\n    \n    std::unordered_map<ltac::Register, int, ltac::RegisterHash> constants; \n\n    for(std::size_t i = 0; i < statements.size(); ++i){\n        auto statement = statements[i];\n\n        if(auto* ptr = boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n            auto instruction = *ptr;\n\n            \/\/Erase constant\n            if(instruction->arg1 && is_reg(*instruction->arg1)){\n                auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n\n                constants.erase(reg1);\n            }\n\n            \/\/Collect constants\n            if(instruction->op == ltac::Operator::XOR){\n                if(is_reg(*instruction->arg1) && is_reg(*instruction->arg2)){\n                    auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n                    auto reg2 = boost::get<ltac::Register>(*instruction->arg2);\n\n                    if(reg1 == reg2){\n                        constants[reg1] = 0;\n                    }\n                }\n            } else if(instruction->op == ltac::Operator::MOV){\n                if(is_reg(*instruction->arg1)){\n                    if (auto* valuePtr = boost::get<int>(&*instruction->arg2)){\n                        auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n                        constants[reg1] = *valuePtr;\n                    }\n                }\n            }\n\n            \/\/Optimize MOV\n            if(instruction->op == ltac::Operator::MOV){\n                if(is_reg(*instruction->arg2)){\n                    auto reg2 = boost::get<ltac::Register>(*instruction->arg2);\n\n                    if(constants.find(reg2) != constants.end()){\n                        instruction->arg2 = constants[reg2];\n                        optimized = true;\n                    }\n                }\n            }\n        } else {\n            \/\/At this point, the basic block is at its end\n            constants.clear();\n        }\n    }\n\n    return optimized;\n}\n\nbool debug(const std::string& name, bool b, std::shared_ptr<ltac::Function> function){\n    if(option_defined(\"dev\")){\n        if(b){\n            std::cout << \"optimization \" << name << \" returned true\" << std::endl;\n\n            \/\/Print the function\n            ltac::Printer printer;\n            printer.print(function);\n        } else {\n            std::cout << \"optimization \" << name << \" returned false\" << std::endl;\n        }\n    }\n\n    return b;\n}\n\n} \/\/end of anonymous namespace\n\nvoid eddic::ltac::optimize(std::shared_ptr<ltac::Program> program){\n    PerfsTimer timer(\"Peephole optimizations\");\n\n    for(auto& function : program->functions){\n        if(option_defined(\"dev\")){\n            std::cout << \"Start optimizations on \" << function->getName() << std::endl;\n\n            \/\/Print the function\n            ltac::Printer printer;\n            printer.print(function);\n        }\n\n        bool optimized;\n        do {\n            optimized = false;\n            \n            optimized |= debug(\"Basic optimizations\", basic_optimizations(function), function);\n            optimized |= debug(\"Constant propagation\", constant_propagation(function), function);\n        } while(optimized);\n    }\n}\n<commit_msg>Implement first prototype of dead-code-elimination<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 <iostream>\n#include <boost\/optional.hpp>\n\n#include \"Utils.hpp\"\n#include \"PerfsTimer.hpp\"\n#include \"Options.hpp\"\n#include \"likely.hpp\"\n#include \"Platform.hpp\"\n\n#include \"ltac\/PeepholeOptimizer.hpp\"\n#include \"ltac\/Printer.hpp\"\n\n#include \"mtac\/Utils.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\ntemplate<typename T>\ninline bool is_reg(T value){\n    return mtac::is<ltac::Register>(value);\n}\n\ninline bool transform_to_nop(std::shared_ptr<ltac::Instruction> instruction){\n    if(instruction->op == ltac::Operator::NOP){\n        return false;\n    }\n    \n    instruction->op = ltac::Operator::NOP;\n    instruction->arg1.reset();\n    instruction->arg2.reset();\n\n    return true;\n}\n\ninline bool optimize_statement(ltac::Statement& statement){\n    if(boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n        auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n        if(instruction->op == ltac::Operator::MOV){\n            \/\/MOV reg, 0 can be transformed into XOR reg, reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n                instruction->op = ltac::Operator::XOR;\n                instruction->arg2 = instruction->arg1;\n\n                return true;\n            }\n\n            if(is_reg(*instruction->arg1) && is_reg(*instruction->arg2)){\n                auto& reg1 = boost::get<ltac::Register>(*instruction->arg1); \n                auto& reg2 = boost::get<ltac::Register>(*instruction->arg2); \n            \n                \/\/MOV reg, reg is useless\n                if(reg1 == reg2){\n                    return transform_to_nop(instruction);\n                }\n            }\n        }\n\n        if(instruction->op == ltac::Operator::ADD){\n            \/\/ADD reg, 1 can be transformed into INC reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n                instruction->op = ltac::Operator::INC;\n                instruction->arg2.reset();\n\n                return true;\n            }\n            \n            \/\/ADD reg, -1 can be transformed into DEC reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n                instruction->op = ltac::Operator::DEC;\n                instruction->arg2.reset();\n\n                    return true;\n            }\n        }\n        \n        if(instruction->op == ltac::Operator::SUB){\n            \/\/SUB reg, 1 can be transformed into DEC reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n                instruction->op = ltac::Operator::DEC;\n                instruction->arg2.reset();\n\n                    return true;\n            }\n            \n            \/\/SUB reg, -1 can be transformed into INC reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n                instruction->op = ltac::Operator::INC;\n                instruction->arg2.reset();\n\n                    return true;\n            }\n        }\n\n        if(instruction->op == ltac::Operator::MUL){\n            \/\/Optimize multiplications with SHIFTs or LEAs\n            if(is_reg(*instruction->arg1) && mtac::is<int>(*instruction->arg2)){\n                int constant = boost::get<int>(*instruction->arg2);\n\n                auto reg = boost::get<ltac::Register>(*instruction->arg1);\n        \n                if(isPowerOfTwo(constant)){\n                    instruction->op = ltac::Operator::SHIFT_LEFT;\n                    instruction->arg2 = powerOfTwo(constant);\n\n                    return true;\n                } \n                \n                if(constant == 3){\n                    instruction->op = ltac::Operator::LEA;\n                    instruction->arg2 = ltac::Address(reg, reg, 2, 0);\n\n                    return true;\n                } \n                \n                if(constant == 5){\n                    instruction->op = ltac::Operator::LEA;\n                    instruction->arg2 = ltac::Address(reg, reg, 4, 0);\n\n                    return true;\n                } \n                \n                if(constant == 9){\n                    instruction->op = ltac::Operator::LEA;\n                    instruction->arg2 = ltac::Address(reg, reg, 8, 0);\n\n                    return true;\n                } \n            }\n        }\n\n        if(instruction->op == ltac::Operator::CMP_INT){\n            \/\/Optimize comparisons with 0 with or reg, reg\n            if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n                instruction->op = ltac::Operator::OR;\n                instruction->arg2 = instruction->arg1;\n\n                    return true;\n            }\n        }\n    }\n\n    return false;\n}\n\ninline bool multiple_statement_optimizations(ltac::Statement& s1, ltac::Statement& s2){\n    if(mtac::is<std::shared_ptr<ltac::Instruction>>(s1) && mtac::is<std::shared_ptr<ltac::Instruction>>(s2)){\n        auto& i1 = boost::get<std::shared_ptr<ltac::Instruction>>(s1);\n        auto& i2 = boost::get<std::shared_ptr<ltac::Instruction>>(s2);\n\n        \/\/Statements after LEAVE are dead\n        if(i1->op == ltac::Operator::LEAVE){\n            return transform_to_nop(i2);\n        }\n\n        \/\/Combine two FREE STACK into one\n        if(i1->op == ltac::Operator::FREE_STACK && i2->op == ltac::Operator::FREE_STACK){\n            i1->arg1 = boost::get<int>(*i1->arg1) + boost::get<int>(*i2->arg1);\n            \n            return transform_to_nop(i2);\n        }\n\n        if(i1->op == ltac::Operator::MOV && i2->op == ltac::Operator::MOV){\n            if(is_reg(*i1->arg1) && is_reg(*i1->arg2) && is_reg(*i2->arg1) && is_reg(*i2->arg2)){\n                auto reg11 = boost::get<ltac::Register>(*i1->arg1);\n                auto reg12 = boost::get<ltac::Register>(*i1->arg2);\n                auto reg21 = boost::get<ltac::Register>(*i2->arg1);\n                auto reg22 = boost::get<ltac::Register>(*i2->arg2);\n\n                \/\/cross MOV (ir4 = ir5, ir5 = ir4), keep only the first\n                if (reg11 == reg22 && reg12 == reg21){\n                    return transform_to_nop(i2);\n                }\n            } else if(is_reg(*i1->arg1) && is_reg(*i2->arg1)){\n                auto reg11 = boost::get<ltac::Register>(*i1->arg1);\n                auto reg21 = boost::get<ltac::Register>(*i2->arg1);\n\n                \/\/Two MOV to the same register => keep only last MOV\n                if(reg11 == reg21){\n                    return transform_to_nop(i1);\n                }\n            } else if(is_reg(*i1->arg1) && is_reg(*i2->arg2)){\n                if(boost::get<ltac::Address>(&*i1->arg2) && boost::get<ltac::Address>(&*i2->arg1)){\n                    if(boost::get<ltac::Address>(*i1->arg2) == boost::get<ltac::Address>(*i2->arg1)){\n                        return transform_to_nop(i2);\n                    }\n                }\n            } else if(is_reg(*i1->arg2) && is_reg(*i2->arg1)){\n                if(boost::get<ltac::Address>(&*i1->arg1) && boost::get<ltac::Address>(&*i2->arg2)){\n                    if(boost::get<ltac::Address>(*i1->arg1) == boost::get<ltac::Address>(*i2->arg2)){\n                        return transform_to_nop(i2);\n                    }\n                }\n            }\n        }\n\n        if(i1->op == ltac::Operator::MOV && i2->op == ltac::Operator::ADD){\n            if(is_reg(*i1->arg1) && is_reg(*i2->arg1)){\n                if(boost::get<ltac::Register>(*i1->arg1) == boost::get<ltac::Register>(*i2->arg1)){\n                    if(boost::get<ltac::Register>(&*i1->arg2) && boost::get<int>(&*i2->arg2)){\n                        i2->op = ltac::Operator::LEA;\n                        i2->arg2 = ltac::Address(boost::get<ltac::Register>(*i1->arg2), boost::get<int>(*i2->arg2));\n\n                        return transform_to_nop(i1);\n                    } else if(boost::get<std::string>(&*i1->arg2) && boost::get<int>(&*i2->arg2)){\n                        i2->op = ltac::Operator::LEA;\n                        i2->arg2 = ltac::Address(boost::get<std::string>(*i1->arg2), boost::get<int>(*i2->arg2));\n\n                        return transform_to_nop(i1);\n                    }\n                }\n            }\n        }\n    }\n\n    return false;\n}\n\ninline bool is_nop(ltac::Statement& statement){\n    if(mtac::is<std::shared_ptr<ltac::Instruction>>(statement)){\n        auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n        if(instruction->op == ltac::Operator::NOP){\n            return true;\n        }\n    }\n\n    return false;\n}\n\nbool basic_optimizations(std::shared_ptr<ltac::Function> function){\n    auto& statements = function->getStatements();\n\n    auto it = statements.begin();\n    auto end = statements.end() - 1;\n\n    bool optimized = false;\n\n    while(it != end){\n        auto& s1 = *it;\n        auto& s2 = *(it + 1);\n\n        \/\/Optimizations that looks at only one statement\n        optimized |= optimize_statement(s1);\n        optimized |= optimize_statement(s2);\n\n        \/\/Optimizations that looks at several statements at once\n        optimized |= multiple_statement_optimizations(s1, s2);\n\n        if(unlikely(is_nop(s1))){\n            it = statements.erase(it);\n            end = statements.end() - 1;\n\n            continue;\n        }\n\n        ++it;\n    }\n\n    return optimized;\n}\n\nbool constant_propagation(std::shared_ptr<ltac::Function> function){\n    bool optimized = false;\n\n    auto& statements = function->getStatements();\n    \n    std::unordered_map<ltac::Register, int, ltac::RegisterHash> constants; \n\n    for(std::size_t i = 0; i < statements.size(); ++i){\n        auto statement = statements[i];\n\n        if(auto* ptr = boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n            auto instruction = *ptr;\n\n            \/\/Erase constant\n            if(instruction->arg1 && is_reg(*instruction->arg1)){\n                auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n\n                constants.erase(reg1);\n            }\n\n            \/\/Collect constants\n            if(instruction->op == ltac::Operator::XOR){\n                if(is_reg(*instruction->arg1) && is_reg(*instruction->arg2)){\n                    auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n                    auto reg2 = boost::get<ltac::Register>(*instruction->arg2);\n\n                    if(reg1 == reg2){\n                        constants[reg1] = 0;\n                    }\n                }\n            } else if(instruction->op == ltac::Operator::MOV){\n                if(is_reg(*instruction->arg1)){\n                    if (auto* valuePtr = boost::get<int>(&*instruction->arg2)){\n                        auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n                        constants[reg1] = *valuePtr;\n                    }\n                }\n            }\n\n            \/\/Optimize MOV\n            if(instruction->op == ltac::Operator::MOV){\n                if(is_reg(*instruction->arg2)){\n                    auto reg2 = boost::get<ltac::Register>(*instruction->arg2);\n\n                    if(constants.find(reg2) != constants.end()){\n                        instruction->arg2 = constants[reg2];\n                        optimized = true;\n                    }\n                }\n            }\n        } else {\n            \/\/At this point, the basic block is at its end\n            constants.clear();\n        }\n    }\n\n    return optimized;\n}\n\ntypedef std::unordered_set<ltac::Register, ltac::RegisterHash> RegisterUsage;\n\n\/\/TODO This can be optimized by doing it context dependent to avoid saving each register\nvoid add_escaped_registers(RegisterUsage& usage){\n    auto descriptor = getPlatformDescriptor(platform);\n\n    usage.insert(ltac::Register(descriptor->int_return_register1()));\n    usage.insert(ltac::Register(descriptor->int_return_register2()));\n\n    for(unsigned int i = 1; i <= descriptor->numberOfIntParamRegisters(); ++i){\n        usage.insert(ltac::Register(descriptor->int_param_register(i)));\n    }\n}\n\nbool dead_code_elimination(std::shared_ptr<ltac::Function> function){\n    bool optimized = false;\n\n    auto& statements = function->getStatements();\n    \n    RegisterUsage usage; \n    add_escaped_registers(usage);\n\n    for(long i = statements.size() - 1; i >= 0; --i){\n        auto statement = statements[i];\n\n        if(auto* ptr = boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n            auto instruction = *ptr;\n\n            \/\/Optimize MOV and XOR\n            if(instruction->op == ltac::Operator::MOV){\n                if(is_reg(*instruction->arg1)){\n                    auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n\n                    if(usage.find(reg1) == usage.end()){\n                        optimized = transform_to_nop(instruction);\n                    }\n                }\n            } else if(instruction->op == ltac::Operator::XOR){\n                if(is_reg(*instruction->arg1) || is_reg(*instruction->arg2)){\n                    auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n                    auto reg2 = boost::get<ltac::Register>(*instruction->arg2);\n\n                    if(reg1 == reg2 && usage.find(reg1) == usage.end()){\n                        optimized = transform_to_nop(instruction);\n                    }\n                }\n            }\n            \n            \/\/Collect usage \n            if(instruction->arg1 && is_reg(*instruction->arg1)){\n                auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n                usage.insert(reg1);\n            }\n            \n            if(instruction->arg2 && is_reg(*instruction->arg2)){\n                auto reg2 = boost::get<ltac::Register>(*instruction->arg2);\n                usage.insert(reg2);\n            }\n            \n            if(instruction->arg3 && is_reg(*instruction->arg3)){\n                auto reg3 = boost::get<ltac::Register>(*instruction->arg3);\n                usage.insert(reg3);\n            }\n\n            \/\/Erase usage if the register gets written to\n            if(instruction->arg1 && is_reg(*instruction->arg1)){\n                auto reg1 = boost::get<ltac::Register>(*instruction->arg1);\n\n                usage.erase(reg1);\n            }\n        } else {\n            \/\/At this point, the basic block is at its end\n            usage.clear();\n            add_escaped_registers(usage);\n        }\n    }\n\n    return optimized;\n}\n\nbool debug(const std::string& name, bool b, std::shared_ptr<ltac::Function> function){\n    if(option_defined(\"dev\")){\n        if(b){\n            std::cout << \"optimization \" << name << \" returned true\" << std::endl;\n\n            \/\/Print the function\n            ltac::Printer printer;\n            printer.print(function);\n        } else {\n            std::cout << \"optimization \" << name << \" returned false\" << std::endl;\n        }\n    }\n\n    return b;\n}\n\n} \/\/end of anonymous namespace\n\nvoid eddic::ltac::optimize(std::shared_ptr<ltac::Program> program){\n    PerfsTimer timer(\"Peephole optimizations\");\n\n    for(auto& function : program->functions){\n        if(option_defined(\"dev\")){\n            std::cout << \"Start optimizations on \" << function->getName() << std::endl;\n\n            \/\/Print the function\n            ltac::Printer printer;\n            printer.print(function);\n        }\n\n        bool optimized;\n        do {\n            optimized = false;\n            \n            optimized |= debug(\"Basic optimizations\", basic_optimizations(function), function);\n            optimized |= debug(\"Constant propagation\", constant_propagation(function), function);\n            optimized |= debug(\"Dead-Code Elimination\", dead_code_elimination(function), function);\n        } while(optimized);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file   SieveOfEratosthenes.cpp\n\/\/\/ @brief  Implementation of the segmented sieve of Eratosthenes.\n\/\/\/\n\/\/\/ Copyright (C) 2013 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the New BSD License. See the\n\/\/\/ LICENSE file in the top level directory.\n\/\/\/\n\n#include \"config.h\"\n#include \"SieveOfEratosthenes.h\"\n#include \"PreSieve.h\"\n#include \"EratSmall.h\"\n#include \"EratMedium.h\"\n#include \"EratBig.h\"\n#include \"imath.h\"\n#include \"primesieve_error.h\"\n\n#include <stdint.h>\n#include <exception>\n#include <string>\n#include <cstdlib>\n\nnamespace soe {\n\nconst uint_t SieveOfEratosthenes::bitValues_[8] = { 7, 11, 13, 17, 19, 23, 29, 31 };\n\n\/\/\/ De Bruijn bitscan table\nconst uint_t SieveOfEratosthenes::bruijnBitValues_[64] =\n{\n    7,  47,  11,  49,  67, 113,  13,  53,\n   89,  71, 161, 101, 119, 187,  17, 233,\n   59,  79,  91,  73, 133, 139, 163, 103,\n  149, 121, 203, 169, 191, 217,  19, 239,\n   43,  61, 109,  83, 157,  97, 181, 229,\n   77, 131, 137, 143, 199, 167, 211,  41,\n  107, 151, 179, 227, 127, 197, 209,  37,\n  173, 223, 193,  31, 221,  29,  23, 241\n};\n\n\/\/\/ @param start      Sieve primes >= start.\n\/\/\/ @param stop       Sieve primes <= stop.\n\/\/\/ @param sieveSize  A sieve size in kilobytes.\n\/\/\/ @param preSieve   Pre-sieve multiples of small primes <= preSieve\n\/\/\/                   to speed up the sieve of Eratosthenes.\n\/\/\/ @pre   start      >= 7\n\/\/\/ @pre   stop       <= 2^64 - 2^32 * 10\n\/\/\/ @pre   sieveSize  >= 1 && <= 4096\n\/\/\/ @pre   preSieve   >= 13 && <= 23\n\/\/\/\nSieveOfEratosthenes::SieveOfEratosthenes(uint64_t start,\n                                         uint64_t stop,\n                                         uint_t sieveSize,\n                                         uint_t preSieve) :\n  start_(start),\n  stop_(stop),\n  sieve_(NULL),\n  preSieve_(NULL),\n  eratSmall_(NULL),\n  eratMedium_(NULL),\n  eratBig_(NULL)\n{\n  if (start_ < 7)\n    throw primesieve_error(\"SieveOfEratosthenes: start must be >= 7\");\n  if (start_ > stop_)\n    throw primesieve_error(\"SieveOfEratosthenes: start must be <= stop\");\n  \/\/ sieveSize_ must be a power of 2\n  sieveSize_ = getInBetween(1u, floorPowerOf2(sieveSize), 4096u);\n  sieveSize_ *= 1024; \/\/ convert to bytes\n  segmentLow_ = start_ - getByteRemainder(start_);\n  segmentHigh_ = segmentLow_ + sieveSize_ * NUMBERS_PER_BYTE + 1;\n  sqrtStop_ = static_cast<uint_t>(isqrt(stop_));\n  init(preSieve);\n}\n\nSieveOfEratosthenes::~SieveOfEratosthenes()\n{\n  cleanUp();\n}\n\nvoid SieveOfEratosthenes::cleanUp()\n{\n  delete[] sieve_;\n  delete preSieve_;\n  delete eratSmall_;\n  delete eratMedium_;\n  delete eratBig_;\n}\n\nvoid SieveOfEratosthenes::init(uint_t limitPreSieve)\n{\n  limitEratSmall_  = static_cast<uint_t>(sieveSize_ * config::FACTOR_ERATSMALL);\n  limitEratMedium_ = static_cast<uint_t>(sieveSize_ * config::FACTOR_ERATMEDIUM);\n  try {\n    \/\/ allocate the sieve of Eratosthenes array\n    sieve_ = new byte_t[sieveSize_];\n    preSieve_ = new PreSieve(limitPreSieve);\n\n    if (sqrtStop_ > getPreSieve())    eratSmall_  = new EratSmall (stop_, sieveSize_, limitEratSmall_);\n    if (sqrtStop_ > limitEratSmall_)  eratMedium_ = new EratMedium(stop_, sieveSize_, limitEratMedium_);\n    if (sqrtStop_ > limitEratMedium_) eratBig_    = new EratBig   (stop_, sieveSize_, sqrtStop_);\n  }\n  catch (const std::exception& e) {\n    cleanUp();\n    throw e;\n  }\n}\n\nuint_t SieveOfEratosthenes::getSqrtStop() const\n{\n  return sqrtStop_;\n}\n\nuint_t SieveOfEratosthenes::getPreSieve() const\n{\n  return preSieve_->getLimit();\n}\n\nstd::string SieveOfEratosthenes::getMaxStopString()\n{\n  return EratBig::getMaxStopString();\n}\n\nuint64_t SieveOfEratosthenes::getMaxStop()\n{\n  return EratBig::getMaxStop();\n}\n\nuint64_t SieveOfEratosthenes::getByteRemainder(uint64_t n)\n{\n  uint64_t r = n % NUMBERS_PER_BYTE;\n  if (r <= 1)\n    r += NUMBERS_PER_BYTE;\n  return r;\n}\n\nvoid SieveOfEratosthenes::sieveSegment()\n{\n  preSieve();\n  crossOffMultiples();\n  segmentProcessed(sieve_, sieveSize_);\n}\n\nvoid SieveOfEratosthenes::crossOffMultiples()\n{\n  if (eratSmall_)   eratSmall_->crossOff(sieve_, &sieve_[sieveSize_]);\n  if (eratMedium_) eratMedium_->crossOff(sieve_, sieveSize_);\n  if (eratBig_)       eratBig_->crossOff(sieve_);\n}\n\n\/\/\/ Pre-sieve multiples of small primes e.g. <= 19\n\/\/\/ to speed up the sieve of Eratosthenes.\n\/\/\/\nvoid SieveOfEratosthenes::preSieve()\n{\n  preSieve_->doIt(sieve_, sieveSize_, segmentLow_);\n  \/\/ unset bits (numbers) < start_\n  if (segmentLow_ <= start_) {\n    if (start_ <= preSieve_->getLimit())\n      sieve_[0] = 0xff;\n    int i = 0;\n    while (bitValues_[i] < getByteRemainder(start_)) i++;\n    sieve_[0] &= 0xff << i;\n  }\n}\n\n\/\/\/ Sieve the last segments remaining after that sieve(uint_t)\n\/\/\/ has been called for all primes up to sqrt(stop).\n\/\/\/\nvoid SieveOfEratosthenes::finish()\n{\n  \/\/ sieve all segments left except the last one\n  while (segmentHigh_ < stop_) {\n    sieveSegment();\n    segmentLow_  += sieveSize_ * NUMBERS_PER_BYTE;\n    segmentHigh_ += sieveSize_ * NUMBERS_PER_BYTE;\n  }\n  \/\/ sieve the last segment\n  uint64_t remainder = getByteRemainder(stop_);\n  sieveSize_ = static_cast<uint_t>((stop_ - remainder) - segmentLow_) \/ NUMBERS_PER_BYTE + 1;\n  segmentHigh_ = segmentLow_ + sieveSize_ * NUMBERS_PER_BYTE + 1;\n  preSieve();\n  crossOffMultiples();\n  int i;\n  \/\/ unset bits (numbers) > stop_\n  for (i = 0; i < 8; i++)\n    if (bitValues_[i] > remainder)\n      break;\n  sieve_[sieveSize_ - 1] &= ~(0xff << i);\n  for (uint_t j = sieveSize_; j % 8 != 0; j++)\n    sieve_[j] = 0;\n  segmentProcessed(sieve_, sieveSize_);\n}\n\n} \/\/ namespace soe\n<commit_msg>improved code readability<commit_after>\/\/\/\n\/\/\/ @file   SieveOfEratosthenes.cpp\n\/\/\/ @brief  Implementation of the segmented sieve of Eratosthenes.\n\/\/\/\n\/\/\/ Copyright (C) 2013 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the New BSD License. See the\n\/\/\/ LICENSE file in the top level directory.\n\/\/\/\n\n#include \"config.h\"\n#include \"SieveOfEratosthenes.h\"\n#include \"PreSieve.h\"\n#include \"EratSmall.h\"\n#include \"EratMedium.h\"\n#include \"EratBig.h\"\n#include \"imath.h\"\n#include \"primesieve_error.h\"\n\n#include <stdint.h>\n#include <exception>\n#include <string>\n#include <cstdlib>\n\nnamespace soe {\n\nconst uint_t SieveOfEratosthenes::bitValues_[8] = { 7, 11, 13, 17, 19, 23, 29, 31 };\n\n\/\/\/ De Bruijn bitscan table\nconst uint_t SieveOfEratosthenes::bruijnBitValues_[64] =\n{\n    7,  47,  11,  49,  67, 113,  13,  53,\n   89,  71, 161, 101, 119, 187,  17, 233,\n   59,  79,  91,  73, 133, 139, 163, 103,\n  149, 121, 203, 169, 191, 217,  19, 239,\n   43,  61, 109,  83, 157,  97, 181, 229,\n   77, 131, 137, 143, 199, 167, 211,  41,\n  107, 151, 179, 227, 127, 197, 209,  37,\n  173, 223, 193,  31, 221,  29,  23, 241\n};\n\n\/\/\/ @param start      Sieve primes >= start.\n\/\/\/ @param stop       Sieve primes <= stop.\n\/\/\/ @param sieveSize  A sieve size in kilobytes.\n\/\/\/ @param preSieve   Pre-sieve multiples of small primes <= preSieve\n\/\/\/                   to speed up the sieve of Eratosthenes.\n\/\/\/ @pre   start      >= 7\n\/\/\/ @pre   stop       <= 2^64 - 2^32 * 10\n\/\/\/ @pre   sieveSize  >= 1 && <= 4096\n\/\/\/ @pre   preSieve   >= 13 && <= 23\n\/\/\/\nSieveOfEratosthenes::SieveOfEratosthenes(uint64_t start,\n                                         uint64_t stop,\n                                         uint_t sieveSize,\n                                         uint_t preSieve) :\n  start_(start),\n  stop_(stop),\n  sieve_(NULL),\n  preSieve_(NULL),\n  eratSmall_(NULL),\n  eratMedium_(NULL),\n  eratBig_(NULL)\n{\n  if (start_ < 7)\n    throw primesieve_error(\"SieveOfEratosthenes: start must be >= 7\");\n  if (start_ > stop_)\n    throw primesieve_error(\"SieveOfEratosthenes: start must be <= stop\");\n  sqrtStop_ = static_cast<uint_t>(isqrt(stop_));\n  \/\/ sieveSize_ must be a power of 2\n  sieveSize_ = getInBetween(1u, floorPowerOf2(sieveSize), 4096u);\n  sieveSize_ *= 1024; \/\/ convert to bytes\n  segmentLow_ = start_ - getByteRemainder(start_);\n  segmentHigh_ = segmentLow_ + sieveSize_ * NUMBERS_PER_BYTE + 1;\n  \/\/ allocate the sieve of Eratosthenes array\n  sieve_ = new byte_t[sieveSize_];\n  init(preSieve);\n}\n\nSieveOfEratosthenes::~SieveOfEratosthenes()\n{\n  cleanUp();\n}\n\nvoid SieveOfEratosthenes::cleanUp()\n{\n  delete[] sieve_;\n  delete preSieve_;\n  delete eratSmall_;\n  delete eratMedium_;\n  delete eratBig_;\n}\n\nvoid SieveOfEratosthenes::init(uint_t preSieve)\n{\n  limitEratSmall_  = static_cast<uint_t>(sieveSize_ * config::FACTOR_ERATSMALL);\n  limitEratMedium_ = static_cast<uint_t>(sieveSize_ * config::FACTOR_ERATMEDIUM);\n  try {\n    preSieve_ = new PreSieve(preSieve);\n\n    if (sqrtStop_ > getPreSieve())    eratSmall_  = new EratSmall (stop_, sieveSize_, limitEratSmall_);\n    if (sqrtStop_ > limitEratSmall_)  eratMedium_ = new EratMedium(stop_, sieveSize_, limitEratMedium_);\n    if (sqrtStop_ > limitEratMedium_) eratBig_    = new EratBig   (stop_, sieveSize_, sqrtStop_);\n  }\n  catch (const std::exception& e) {\n    cleanUp();\n    throw e;\n  }\n}\n\nuint_t SieveOfEratosthenes::getSqrtStop() const\n{\n  return sqrtStop_;\n}\n\nuint_t SieveOfEratosthenes::getPreSieve() const\n{\n  return preSieve_->getLimit();\n}\n\nstd::string SieveOfEratosthenes::getMaxStopString()\n{\n  return EratBig::getMaxStopString();\n}\n\nuint64_t SieveOfEratosthenes::getMaxStop()\n{\n  return EratBig::getMaxStop();\n}\n\nuint64_t SieveOfEratosthenes::getByteRemainder(uint64_t n)\n{\n  uint64_t r = n % NUMBERS_PER_BYTE;\n  if (r <= 1)\n    r += NUMBERS_PER_BYTE;\n  return r;\n}\n\nvoid SieveOfEratosthenes::sieveSegment()\n{\n  preSieve();\n  crossOffMultiples();\n  segmentProcessed(sieve_, sieveSize_);\n}\n\nvoid SieveOfEratosthenes::crossOffMultiples()\n{\n  if (eratSmall_)   eratSmall_->crossOff(sieve_, &sieve_[sieveSize_]);\n  if (eratMedium_) eratMedium_->crossOff(sieve_, sieveSize_);\n  if (eratBig_)       eratBig_->crossOff(sieve_);\n}\n\n\/\/\/ Pre-sieve multiples of small primes e.g. <= 19\n\/\/\/ to speed up the sieve of Eratosthenes.\n\/\/\/\nvoid SieveOfEratosthenes::preSieve()\n{\n  preSieve_->doIt(sieve_, sieveSize_, segmentLow_);\n  \/\/ unset bits (numbers) < start_\n  if (segmentLow_ <= start_) {\n    if (start_ <= preSieve_->getLimit())\n      sieve_[0] = 0xff;\n    int i = 0;\n    while (bitValues_[i] < getByteRemainder(start_)) i++;\n    sieve_[0] &= 0xff << i;\n  }\n}\n\n\/\/\/ Sieve the last segments remaining after that sieve(uint_t)\n\/\/\/ has been called for all primes up to sqrt(stop).\n\/\/\/\nvoid SieveOfEratosthenes::finish()\n{\n  \/\/ sieve all segments left except the last one\n  while (segmentHigh_ < stop_) {\n    sieveSegment();\n    segmentLow_  += sieveSize_ * NUMBERS_PER_BYTE;\n    segmentHigh_ += sieveSize_ * NUMBERS_PER_BYTE;\n  }\n  \/\/ sieve the last segment\n  uint64_t remainder = getByteRemainder(stop_);\n  sieveSize_ = static_cast<uint_t>((stop_ - remainder) - segmentLow_) \/ NUMBERS_PER_BYTE + 1;\n  segmentHigh_ = segmentLow_ + sieveSize_ * NUMBERS_PER_BYTE + 1;\n  preSieve();\n  crossOffMultiples();\n  int i;\n  \/\/ unset bits (numbers) > stop_\n  for (i = 0; i < 8; i++)\n    if (bitValues_[i] > remainder)\n      break;\n  sieve_[sieveSize_ - 1] &= ~(0xff << i);\n  for (uint_t j = sieveSize_; j % 8 != 0; j++)\n    sieve_[j] = 0;\n  segmentProcessed(sieve_, sieveSize_);\n}\n\n} \/\/ namespace soe\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __STAN__IO__STAN_CSV_READER_HPP__\n#define __STAN__IO__STAN_CSV_READER_HPP__\n\n#include <istream>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <stan\/math\/matrix.hpp>\n\nnamespace stan {\n  namespace io {\n\n    \/\/ FIXME: should consolidate with the options from the command line in stan::gm\n    struct stan_csv_metadata {\n      int stan_version_major;\n      int stan_version_minor;\n      int stan_version_patch;\n      \n      std::string model;\n      std::string data;\n      std::string init;\n      bool append_samples;\n      bool save_warmup;\n      size_t seed;\n      bool random_seed;\n      size_t chain_id;\n      size_t iter;\n      size_t warmup;\n      size_t thin;\n      bool equal_step_sizes;\n      bool nondiag_mass;\n      int leapfrog_steps;\n      int max_treedepth;\n      double epsilon;\n      double epsilon_pm;\n      double delta;\n      double gamma;\n      std::string algorithm;\n    };\n\n    struct stan_csv_adaptation {\n      double step_size;\n      Eigen::MatrixXd metric;\n    };\n    \n    struct stan_csv_timing {\n      double warmup;\n      double sampling;\n    };\n\n    struct stan_csv {\n      stan_csv_metadata metadata;\n      Eigen::Matrix<std::string, Eigen::Dynamic, 1> header;\n      stan_csv_adaptation adaptation;\n      Eigen::MatrixXd samples;\n      stan_csv_timing timing;\n    };\n\n    \/**\n     * Reads from a Stan output csv file.\n     *\/\n    class stan_csv_reader {\n    \n    public:\n      \n      stan_csv_reader() {}\n      ~stan_csv_reader() {}\n\n      static bool read_metadata(std::istream& in, stan_csv_metadata& metadata) {\n\n        std::stringstream ss;\n        std::string line;\n\n        if (in.peek() != '#')\n          return false;\n        while (in.peek() == '#') {\n          std::getline(in, line);\n          ss << line << '\\n';\n        }\n        ss.seekg(std::ios_base::beg);  \n\n        char comment;\n        std::string lhs;\n\n        \/\/ Skip first two lines\n        std::getline(ss, line);\n        std::getline(ss, line);\n\n        while (ss.good()) {\n          \n          ss >> comment;\n          std::getline(ss, lhs, '=');\n          boost::trim(lhs);\n          \n          if (lhs.compare(\"\") == 0) { \/\/ no-op\n          } else if (lhs.compare(\"stan_version_major\") == 0) {\n            ss >> metadata.stan_version_major;\n          } else if (lhs.compare(\"stan_version_minor\") == 0) {\n            ss >> metadata.stan_version_minor;\n          } else if (lhs.compare(\"stan_version_patch\") == 0) {\n            ss >> metadata.stan_version_patch;\n          } else if (lhs.compare(\"model\") == 0) {\n            ss >> metadata.model;\n          } else if (lhs.compare(\"data\") == 0) {\n            ss >> metadata.data;      \n          } else if (lhs.compare(\"init\") == 0) {\n            std::getline(ss, metadata.init);\n            boost::trim(metadata.init);\n            ss.unget();\n          } else if (lhs.compare(\"append_samples\") == 0) {\n            ss >> metadata.append_samples;\n          } else if (lhs.compare(\"save_warmup\") == 0) {\n            ss >> metadata.save_warmup;\n          } else if (lhs.compare(\"seed\") == 0) {\n            ss >> metadata.seed;\n            metadata.random_seed = false;\n          } else if (lhs.compare(\"chain_id\") == 0) {\n            ss >> metadata.chain_id;\n          } else if (lhs.compare(\"iter\") == 0) {\n            ss >> metadata.iter;\n          } else if (lhs.compare(\"warmup\") == 0) {\n            ss >> metadata.warmup;\n          } else if (lhs.compare(\"thin\") == 0) {\n            ss >> metadata.thin;\n          } else if (lhs.compare(\"equal_step_sizes\") == 0) {\n            ss >> metadata.equal_step_sizes;\n                } else if (lhs.compare(\"nondiag_mass\") == 0) {\n            ss >> metadata.nondiag_mass;\n          } else if (lhs.compare(\"leapfrog_steps\") == 0) {\n            ss >> metadata.leapfrog_steps;\n          } else if (lhs.compare(\"max_treedepth\") == 0) {\n            ss >> metadata.max_treedepth;\n          } else if (lhs.compare(\"epsilon\") == 0) {\n            ss >> metadata.epsilon;\n          } else if (lhs.compare(\"epsilon_pm\") == 0) {\n            ss >> metadata.epsilon_pm;\n          } else if (lhs.compare(\"delta\") == 0) {\n            ss >> metadata.delta;\n          } else if (lhs.compare(\"gamma\") == 0) {\n            ss >> metadata.gamma;\n          } else if (lhs.compare(\"algorithm\") == 0) {\n            std::getline(ss, metadata.algorithm);\n            boost::trim(metadata.algorithm);\n            ss.unget();\n          } else {\n            std::cout << \"unused option: \" << lhs << std::endl;\n          }\n          \n          std::getline(ss, line);\n          \n        }\n        \n        if (ss.good() == true)\n          return false;\n        \n        return true;\n      \n      } \/\/ read_metadata\n  \n      static bool read_header(std::istream& in, Eigen::Matrix<std::string, Eigen::Dynamic, 1>& header) {\n        \n        std::string line;\n\n        if (in.peek() != 'l')\n          return false;\n  \n        std::getline(in, line);\n        std::stringstream ss(line);\n  \n        header.resize(std::count(line.begin(), line.end(), ',') + 1);\n        int idx = 0;\n        while (ss.good()) {\n          std::string token;\n          std::getline(ss, token, ',');\n          boost::trim(token);\n    \n          int pos = token.find('.');\n          if (pos > 0) {\n            token.replace(pos, 1, \"[\");\n            std::replace(token.begin(), token.end(), '.', ',');\n            token += \"]\";\n          }\n          header(idx++) = token;\n        }\n        return true;\n      }\n\n      static bool read_adaptation(std::istream& in, stan_csv_adaptation& adaptation) {\n  \n        std::stringstream ss;\n        std::string line;\n        int lines = 0;\n\n        if (in.peek() != '#' || in.good() == false)\n          return false;\n    \n        while (in.peek() == '#') {\n          std::getline(in, line);\n          ss << line << std::endl;\n          lines++;\n        }\n        ss.seekg(std::ios_base::beg);\n       \n        char comment; \/\/ Buffer for comment indicator, #\n    \n        \/\/ Skip first two lines\n        std::getline(ss, line);\n        \n        \/\/ Stepsize\n        std::getline(ss, line, '=');\n        boost::trim(line);\n        ss >> adaptation.step_size;\n        \n        \/\/ Metric parameters\n        std::getline(ss, line);\n        std::getline(ss, line);\n        std::getline(ss, line);\n        \n        int rows = lines - 3;\n        int cols = std::count(line.begin(), line.end(), ',') + 1;\n        adaptation.metric.resize(rows, cols);\n       \n        for (int row = 0; row < rows; row++) {\n          \n          std::stringstream line_ss;\n          line_ss.str(line);\n          line_ss >> comment;\n          \n          for (int col = 0; col < cols; col++) {\n            std::string token;\n            std::getline(line_ss, token, ',');\n            boost::trim(token);\n            adaptation.metric(row, col) = boost::lexical_cast<double>(token);\n          }\n          \n          std::getline(ss, line); \/\/ Read in next line\n          \n        }\n            \n        if (ss.good())\n          return false;\n        else\n          return true;\n\n      }\n      \n      static bool read_samples(std::istream& in, Eigen::MatrixXd& samples, stan_csv_timing& timing) {\n        \n        std::stringstream ss;\n        std::string line;\n\n        int rows = 0;  \n        int cols = -1;\n\n        if (in.peek() == '#' || in.good() == false)\n          return false;\n\n        while (in.good()) {\n          \n          bool comment_line = (in.peek() == '#');\n          bool empty_line   = (in.peek() == '\\n');\n\n          std::getline(in, line);\n          \n          if (empty_line) continue;\n          if (!line.length()) break;\n          \n          if (comment_line) {\n\n            if (line.find(\"(Warm-up)\") != std::string::npos) {\n              int left = 16;\n              int right = line.find(\" seconds\");\n              timing.warmup += boost::lexical_cast<double>(line.substr(left, right - left));\n            } else if (line.find(\"(Sampling)\") != std::string::npos) {\n              int left = 16;\n              int right = line.find(\" seconds\");\n              timing.sampling += boost::lexical_cast<double>(line.substr(left, right - left));\n            }\n            \n          }\n          else {\n\n            ss << line << '\\n';\n            \n            int current_cols = std::count(line.begin(), line.end(), ',') + 1;\n            if (cols == -1) {\n              cols = current_cols;\n            } else if (cols != current_cols) {\n              std::cout << \"Error: expected \" << cols << \" columns, but found \" \n                        << current_cols << \" instead for row \" << rows + 1 << std::endl;\n              return false;\n            }\n            rows++;\n            \n          }\n          \n          in.peek();\n        \n        }\n          \n        ss.seekg(std::ios_base::beg);\n\n        if (rows > 0) {\n          samples.resize(rows, cols);\n          for (int row = 0; row < rows; row++) {\n            std::getline(ss, line);\n            std::stringstream ls(line);\n            for (int col = 0; col < cols; col++) {\n              std::getline(ls, line, ',');\n              std::cout << row << \"\\t\" << col << \"\\t\" << line << std::endl;\n              samples(row, col) = boost::lexical_cast<double>(line);\n            }\n          }\n        }\n        return true;\n      }\n      \n      \/** \n       * Parses the file.\n       * \n       *\/\n      static stan_csv parse(std::istream& in) {\n        \n        stan_csv data;\n        \n        if (!read_metadata(in, data.metadata)) {\n          std::cout << \"Warning: non-fatal error reading metadata\" << std::endl;\n        }\n          \n        if (!read_header(in, data.header)) {\n          std::cout << \"Error: error reading header\" << std::endl;\n          throw std::invalid_argument(\"Error with header of input file in parse\");\n        }\n\n        if (!read_adaptation(in, data.adaptation)) {\n          std::cout << \"Warning: non-fatal error reading adapation data\" << std::endl;\n        }\n\n        data.timing.warmup = 0;\n        data.timing.sampling = 0;\n        \n        if (!read_samples(in, data.samples, data.timing)) {\n          std::cout << \"Warning: non-fatal error reading samples\" << std::endl;\n        }\n        \n        return data;\n        \n      }\n      \n    };\n    \n  } \/\/ io\n  \n} \/\/ stan\n\n#endif\n<commit_msg>Removed debug output line<commit_after>#ifndef __STAN__IO__STAN_CSV_READER_HPP__\n#define __STAN__IO__STAN_CSV_READER_HPP__\n\n#include <istream>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <stan\/math\/matrix.hpp>\n\nnamespace stan {\n  namespace io {\n\n    \/\/ FIXME: should consolidate with the options from the command line in stan::gm\n    struct stan_csv_metadata {\n      int stan_version_major;\n      int stan_version_minor;\n      int stan_version_patch;\n      \n      std::string model;\n      std::string data;\n      std::string init;\n      bool append_samples;\n      bool save_warmup;\n      size_t seed;\n      bool random_seed;\n      size_t chain_id;\n      size_t iter;\n      size_t warmup;\n      size_t thin;\n      bool equal_step_sizes;\n      bool nondiag_mass;\n      int leapfrog_steps;\n      int max_treedepth;\n      double epsilon;\n      double epsilon_pm;\n      double delta;\n      double gamma;\n      std::string algorithm;\n    };\n\n    struct stan_csv_adaptation {\n      double step_size;\n      Eigen::MatrixXd metric;\n    };\n    \n    struct stan_csv_timing {\n      double warmup;\n      double sampling;\n    };\n\n    struct stan_csv {\n      stan_csv_metadata metadata;\n      Eigen::Matrix<std::string, Eigen::Dynamic, 1> header;\n      stan_csv_adaptation adaptation;\n      Eigen::MatrixXd samples;\n      stan_csv_timing timing;\n    };\n\n    \/**\n     * Reads from a Stan output csv file.\n     *\/\n    class stan_csv_reader {\n    \n    public:\n      \n      stan_csv_reader() {}\n      ~stan_csv_reader() {}\n\n      static bool read_metadata(std::istream& in, stan_csv_metadata& metadata) {\n\n        std::stringstream ss;\n        std::string line;\n\n        if (in.peek() != '#')\n          return false;\n        while (in.peek() == '#') {\n          std::getline(in, line);\n          ss << line << '\\n';\n        }\n        ss.seekg(std::ios_base::beg);  \n\n        char comment;\n        std::string lhs;\n\n        \/\/ Skip first two lines\n        std::getline(ss, line);\n        std::getline(ss, line);\n\n        while (ss.good()) {\n          \n          ss >> comment;\n          std::getline(ss, lhs, '=');\n          boost::trim(lhs);\n          \n          if (lhs.compare(\"\") == 0) { \/\/ no-op\n          } else if (lhs.compare(\"stan_version_major\") == 0) {\n            ss >> metadata.stan_version_major;\n          } else if (lhs.compare(\"stan_version_minor\") == 0) {\n            ss >> metadata.stan_version_minor;\n          } else if (lhs.compare(\"stan_version_patch\") == 0) {\n            ss >> metadata.stan_version_patch;\n          } else if (lhs.compare(\"model\") == 0) {\n            ss >> metadata.model;\n          } else if (lhs.compare(\"data\") == 0) {\n            ss >> metadata.data;      \n          } else if (lhs.compare(\"init\") == 0) {\n            std::getline(ss, metadata.init);\n            boost::trim(metadata.init);\n            ss.unget();\n          } else if (lhs.compare(\"append_samples\") == 0) {\n            ss >> metadata.append_samples;\n          } else if (lhs.compare(\"save_warmup\") == 0) {\n            ss >> metadata.save_warmup;\n          } else if (lhs.compare(\"seed\") == 0) {\n            ss >> metadata.seed;\n            metadata.random_seed = false;\n          } else if (lhs.compare(\"chain_id\") == 0) {\n            ss >> metadata.chain_id;\n          } else if (lhs.compare(\"iter\") == 0) {\n            ss >> metadata.iter;\n          } else if (lhs.compare(\"warmup\") == 0) {\n            ss >> metadata.warmup;\n          } else if (lhs.compare(\"thin\") == 0) {\n            ss >> metadata.thin;\n          } else if (lhs.compare(\"equal_step_sizes\") == 0) {\n            ss >> metadata.equal_step_sizes;\n                } else if (lhs.compare(\"nondiag_mass\") == 0) {\n            ss >> metadata.nondiag_mass;\n          } else if (lhs.compare(\"leapfrog_steps\") == 0) {\n            ss >> metadata.leapfrog_steps;\n          } else if (lhs.compare(\"max_treedepth\") == 0) {\n            ss >> metadata.max_treedepth;\n          } else if (lhs.compare(\"epsilon\") == 0) {\n            ss >> metadata.epsilon;\n          } else if (lhs.compare(\"epsilon_pm\") == 0) {\n            ss >> metadata.epsilon_pm;\n          } else if (lhs.compare(\"delta\") == 0) {\n            ss >> metadata.delta;\n          } else if (lhs.compare(\"gamma\") == 0) {\n            ss >> metadata.gamma;\n          } else if (lhs.compare(\"algorithm\") == 0) {\n            std::getline(ss, metadata.algorithm);\n            boost::trim(metadata.algorithm);\n            ss.unget();\n          } else {\n            std::cout << \"unused option: \" << lhs << std::endl;\n          }\n          \n          std::getline(ss, line);\n          \n        }\n        \n        if (ss.good() == true)\n          return false;\n        \n        return true;\n      \n      } \/\/ read_metadata\n  \n      static bool read_header(std::istream& in, Eigen::Matrix<std::string, Eigen::Dynamic, 1>& header) {\n        \n        std::string line;\n\n        if (in.peek() != 'l')\n          return false;\n  \n        std::getline(in, line);\n        std::stringstream ss(line);\n  \n        header.resize(std::count(line.begin(), line.end(), ',') + 1);\n        int idx = 0;\n        while (ss.good()) {\n          std::string token;\n          std::getline(ss, token, ',');\n          boost::trim(token);\n    \n          int pos = token.find('.');\n          if (pos > 0) {\n            token.replace(pos, 1, \"[\");\n            std::replace(token.begin(), token.end(), '.', ',');\n            token += \"]\";\n          }\n          header(idx++) = token;\n        }\n        return true;\n      }\n\n      static bool read_adaptation(std::istream& in, stan_csv_adaptation& adaptation) {\n  \n        std::stringstream ss;\n        std::string line;\n        int lines = 0;\n\n        if (in.peek() != '#' || in.good() == false)\n          return false;\n    \n        while (in.peek() == '#') {\n          std::getline(in, line);\n          ss << line << std::endl;\n          lines++;\n        }\n        ss.seekg(std::ios_base::beg);\n       \n        char comment; \/\/ Buffer for comment indicator, #\n    \n        \/\/ Skip first two lines\n        std::getline(ss, line);\n        \n        \/\/ Stepsize\n        std::getline(ss, line, '=');\n        boost::trim(line);\n        ss >> adaptation.step_size;\n        \n        \/\/ Metric parameters\n        std::getline(ss, line);\n        std::getline(ss, line);\n        std::getline(ss, line);\n        \n        int rows = lines - 3;\n        int cols = std::count(line.begin(), line.end(), ',') + 1;\n        adaptation.metric.resize(rows, cols);\n       \n        for (int row = 0; row < rows; row++) {\n          \n          std::stringstream line_ss;\n          line_ss.str(line);\n          line_ss >> comment;\n          \n          for (int col = 0; col < cols; col++) {\n            std::string token;\n            std::getline(line_ss, token, ',');\n            boost::trim(token);\n            adaptation.metric(row, col) = boost::lexical_cast<double>(token);\n          }\n          \n          std::getline(ss, line); \/\/ Read in next line\n          \n        }\n            \n        if (ss.good())\n          return false;\n        else\n          return true;\n\n      }\n      \n      static bool read_samples(std::istream& in, Eigen::MatrixXd& samples, stan_csv_timing& timing) {\n        \n        std::stringstream ss;\n        std::string line;\n\n        int rows = 0;  \n        int cols = -1;\n\n        if (in.peek() == '#' || in.good() == false)\n          return false;\n\n        while (in.good()) {\n          \n          bool comment_line = (in.peek() == '#');\n          bool empty_line   = (in.peek() == '\\n');\n\n          std::getline(in, line);\n          \n          if (empty_line) continue;\n          if (!line.length()) break;\n          \n          if (comment_line) {\n\n            if (line.find(\"(Warm-up)\") != std::string::npos) {\n              int left = 16;\n              int right = line.find(\" seconds\");\n              timing.warmup += boost::lexical_cast<double>(line.substr(left, right - left));\n            } else if (line.find(\"(Sampling)\") != std::string::npos) {\n              int left = 16;\n              int right = line.find(\" seconds\");\n              timing.sampling += boost::lexical_cast<double>(line.substr(left, right - left));\n            }\n            \n          }\n          else {\n\n            ss << line << '\\n';\n            \n            int current_cols = std::count(line.begin(), line.end(), ',') + 1;\n            if (cols == -1) {\n              cols = current_cols;\n            } else if (cols != current_cols) {\n              std::cout << \"Error: expected \" << cols << \" columns, but found \" \n                        << current_cols << \" instead for row \" << rows + 1 << std::endl;\n              return false;\n            }\n            rows++;\n            \n          }\n          \n          in.peek();\n        \n        }\n          \n        ss.seekg(std::ios_base::beg);\n\n        if (rows > 0) {\n          samples.resize(rows, cols);\n          for (int row = 0; row < rows; row++) {\n            std::getline(ss, line);\n            std::stringstream ls(line);\n            for (int col = 0; col < cols; col++) {\n              std::getline(ls, line, ',');\n              samples(row, col) = boost::lexical_cast<double>(line);\n            }\n          }\n        }\n        return true;\n      }\n      \n      \/** \n       * Parses the file.\n       * \n       *\/\n      static stan_csv parse(std::istream& in) {\n        \n        stan_csv data;\n        \n        if (!read_metadata(in, data.metadata)) {\n          std::cout << \"Warning: non-fatal error reading metadata\" << std::endl;\n        }\n          \n        if (!read_header(in, data.header)) {\n          std::cout << \"Error: error reading header\" << std::endl;\n          throw std::invalid_argument(\"Error with header of input file in parse\");\n        }\n\n        if (!read_adaptation(in, data.adaptation)) {\n          std::cout << \"Warning: non-fatal error reading adapation data\" << std::endl;\n        }\n\n        data.timing.warmup = 0;\n        data.timing.sampling = 0;\n        \n        if (!read_samples(in, data.samples, data.timing)) {\n          std::cout << \"Warning: non-fatal error reading samples\" << std::endl;\n        }\n        \n        return data;\n        \n      }\n      \n    };\n    \n  } \/\/ io\n  \n} \/\/ stan\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of Strigi Desktop Search\n *\n * Copyright (C) 2009 Jos van den Oever <jos@vandenoever.info>\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#include \"lzmainputstream.h\"\nextern \"C\" {\n  #include \"lzma\/LzmaDec.h\"\n}\n#include \"textutils.h\"\n#include <iostream>\n\nusing namespace Strigi;\nusing namespace std;\n\nclass LZMAInputStream::Private {\npublic:\n    LZMAInputStream* const p;\n    CLzmaProps props;\n    CLzmaDec state;\n    InputStream *input;\n    const char* next_in;\n    int32_t avail_in;\n    int64_t bytesDecompressed;\n\n    Private(LZMAInputStream* p, InputStream* i);\n    ~Private();\n    void readFromStream();\n    int32_t fillBuffer(char* start, int32_t space);\n};\nbool\nLZMAInputStream::checkHeader(const char* data, int32_t datasize) {\n    if (datasize < LZMA_PROPS_SIZE + 8) return false;\n    \n    \/\/ lzma does not have magic bytes, but it has a function for parsing\n    \/\/ the header which contains the stream properties\n    \/\/ by limiting the range of sizes we support and doing a sanity check on the\n    \/\/ size of the dictionary, the number of files that are regarded as valid\n    \/\/ can be limited\n    CLzmaProps props;\n    SRes res = LzmaProps_Decode(&props, (const Byte*)data, LZMA_PROPS_SIZE);\n    int64_t size = readLittleEndianInt64(data + LZMA_PROPS_SIZE);\n    return res == SZ_OK && (size == -1 ||\n        (props.dicSize < size && size < 1099511627776LL)); \/\/ only support < 1Tb \n}\nLZMAInputStream::LZMAInputStream(InputStream* input)\n    :p(new Private(this, input)){\n}\nstatic void *SzAlloc(void *p, size_t size) { p = p; return malloc(size); }\nstatic void SzFree(void *p, void *address) { p = p; free(address); }\nstatic ISzAlloc g_Alloc = { SzAlloc, SzFree };\nLZMAInputStream::Private::Private(LZMAInputStream* bis, InputStream* i)\n        :p(bis), input(i) {\n\n    \/\/ check the header and read the size of the uncompressed stream\n    SRes res = SZ_ERROR_UNSUPPORTED;\n    LzmaDec_Construct(&state);\n    const char* data;\n    int32_t nread;\n    const int32_t headersize = LZMA_PROPS_SIZE+8;\n    nread = input->read(data, headersize, headersize);\n    if (nread == headersize && checkHeader(data, headersize)) {\n        \/\/ allocate the decompressor\n        res = LzmaDec_Allocate(&state, (const Byte*)data, LZMA_PROPS_SIZE,\n            &g_Alloc);\n        p->m_size = readLittleEndianInt64(data + LZMA_PROPS_SIZE);\n    }\n    if (res != SZ_OK || p->m_size < -1) {\n        p->m_error = \"LZMA header is not supported.\";\n        p->m_status = Error;\n        return;\n    }\n    LzmaDec_Init(&state);\n    bytesDecompressed = 0;\n\n    \/\/ signal that we need to read into the buffer\n    avail_in = 0;\n\n    \/\/ set the minimum size for the output buffer\n    p->setMinBufSize(262144);\n}\nLZMAInputStream::~LZMAInputStream() {\n    delete p;\n}\nLZMAInputStream::Private::~Private() {\n    LzmaDec_Free(&state, &g_Alloc);\n}\nvoid\nLZMAInputStream::Private::readFromStream() {\n    \/\/ read data from the input stream\n    avail_in = input->read(next_in, 1, 0);\n    if (avail_in <= -1) {\n        p->m_status = Error;\n        p->m_error = input->error();\n    } else if (avail_in < 1) {\n        p->m_status = Error;\n        p->m_error = \"unexpected end of stream\";\n    }\n}\nint32_t\nLZMAInputStream::fillBuffer(char* start, int32_t space) {\n    if (m_status != Ok) return -1;\n    if (m_size == p->bytesDecompressed) {\n        return -1;\n    }\n    return p->fillBuffer(start, space);\n}\nint32_t\nLZMAInputStream::Private::fillBuffer(char* start, int32_t space) {\n    \/\/ make sure there is data to decompress\n    if (avail_in == 0) {\n        readFromStream();\n        if (p->m_status != Ok) {\n            \/\/ no data was read\n            return -1;\n        }\n    }\n    \/\/ decompress\n    SizeT outProcessed = space;\n    SizeT inProcessed = avail_in;\n    ELzmaFinishMode finishMode = LZMA_FINISH_ANY;\n    int64_t bytesTodo = p->m_size - bytesDecompressed;\n    if (p->m_size != -1 && outProcessed > bytesTodo) {\n        outProcessed = (SizeT)bytesTodo;\n        finishMode = LZMA_FINISH_END;\n    }\n    ELzmaStatus status;\n    SRes res = LzmaDec_DecodeToBuf(&state, (Byte*)start, &outProcessed,\n        (const Byte*)next_in, &inProcessed, finishMode, &status);\n    avail_in -= inProcessed;\n    next_in += inProcessed;\n    bytesDecompressed += outProcessed;\n    if (res != SZ_OK) {\n        p->m_error = \"error decompressing\";\n        p->m_status = Error;\n        return -1;\n    }\n    if (inProcessed == 0 && outProcessed == 0) {\n        if (p->m_size != -1 || status != LZMA_STATUS_FINISHED_WITH_MARK) {\n            p->m_error = \"unexpected end\";\n            p->m_status = Error;\n            return -1;\n        }\n        p->m_size = bytesDecompressed;\n    } else if (status == LZMA_STATUS_FINISHED_WITH_MARK) {\n        p->m_size = bytesDecompressed;\n    }\n    return outProcessed;\n}\n<commit_msg>Add check on 'magic' and dicSize.<commit_after>\/* This file is part of Strigi Desktop Search\n *\n * Copyright (C) 2009 Jos van den Oever <jos@vandenoever.info>\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#include \"lzmainputstream.h\"\nextern \"C\" {\n  #include \"lzma\/LzmaDec.h\"\n}\n#include \"textutils.h\"\n#include <iostream>\n#include <sstream>\n\nusing namespace Strigi;\nusing namespace std;\n\nclass LZMAInputStream::Private {\npublic:\n    LZMAInputStream* const p;\n    CLzmaProps props;\n    CLzmaDec state;\n    InputStream *input;\n    const char* next_in;\n    int32_t avail_in;\n    int64_t bytesDecompressed;\n\n    Private(LZMAInputStream* p, InputStream* i);\n    ~Private();\n    void readFromStream();\n    int32_t fillBuffer(char* start, int32_t space);\n};\nbool\nLZMAInputStream::checkHeader(const char* data, int32_t datasize) {\n    if (datasize < LZMA_PROPS_SIZE + 8) return false;\n\n    \/\/ lzma does not have magic bytes, but it has a function for parsing\n    \/\/ the header which contains the stream properties\n    \/\/ nevertheless some use '5d 00' as the magic bytes\n    if (data[0] != 0x5d || data[1] != 0x00) return false;\n\n    \/\/ by limiting the range of sizes and doing a sanity check on the\n    \/\/ size of the dictionary, the number of files that are regarded as valid\n    \/\/ can be limited\n    CLzmaProps props;\n    SRes res = LzmaProps_Decode(&props, (const Byte*)data, LZMA_PROPS_SIZE);\n    int64_t size = readLittleEndianInt64(data + LZMA_PROPS_SIZE);\n    return res == SZ_OK && props.dicSize <= 8388608 && (size == -1 ||\n        (props.dicSize < size && size < 1099511627776LL)); \/\/ only support < 1Tb \n}\nLZMAInputStream::LZMAInputStream(InputStream* input)\n    :p(new Private(this, input)){\n}\nstatic void *SzAlloc(void *p, size_t size) { p = p; return malloc(size); }\nstatic void SzFree(void *p, void *address) { p = p; free(address); }\nstatic ISzAlloc g_Alloc = { SzAlloc, SzFree };\nLZMAInputStream::Private::Private(LZMAInputStream* bis, InputStream* i)\n        :p(bis), input(i) {\n\n    \/\/ check the header and read the size of the uncompressed stream\n    SRes res = SZ_ERROR_UNSUPPORTED;\n    LzmaDec_Construct(&state);\n    const char* data;\n    int32_t nread;\n    const int32_t headersize = LZMA_PROPS_SIZE+8;\n    nread = input->read(data, headersize, headersize);\n    if (nread == headersize && checkHeader(data, headersize)) {\n        \/\/ allocate the decompressor\n        res = LzmaDec_Allocate(&state, (const Byte*)data, LZMA_PROPS_SIZE,\n            &g_Alloc);\n        p->m_size = readLittleEndianInt64(data + LZMA_PROPS_SIZE);\n    }\n    if (res != SZ_OK || p->m_size < -1) {\n        p->m_error = \"LZMA header is not supported.\";\n        p->m_status = Error;\n        return;\n    }\n    LzmaDec_Init(&state);\n    bytesDecompressed = 0;\n\n    \/\/ signal that we need to read into the buffer\n    avail_in = 0;\n\n    \/\/ set the minimum size for the output buffer\n    p->setMinBufSize(262144);\n}\nLZMAInputStream::~LZMAInputStream() {\n    delete p;\n}\nLZMAInputStream::Private::~Private() {\n    LzmaDec_Free(&state, &g_Alloc);\n}\nvoid\nLZMAInputStream::Private::readFromStream() {\n    \/\/ read data from the input stream\n    avail_in = input->read(next_in, 1, 0);\n    if (avail_in <= -1) {\n        p->m_status = Error;\n        p->m_error = input->error();\n    } else if (avail_in < 1) {\n        p->m_status = Error;\n        p->m_error = \"unexpected end of stream\";\n    }\n}\nint32_t\nLZMAInputStream::fillBuffer(char* start, int32_t space) {\n    if (m_status != Ok) return -1;\n    if (m_size == p->bytesDecompressed) {\n        return -1;\n    }\n    return p->fillBuffer(start, space);\n}\nint32_t\nLZMAInputStream::Private::fillBuffer(char* start, int32_t space) {\n    \/\/ make sure there is data to decompress\n    if (avail_in == 0) {\n        readFromStream();\n        if (p->m_status != Ok) {\n            \/\/ no data was read\n            return -1;\n        }\n    }\n    \/\/ decompress\n    SizeT outProcessed = space;\n    SizeT inProcessed = avail_in;\n    ELzmaFinishMode finishMode = LZMA_FINISH_ANY;\n    int64_t bytesTodo = p->m_size - bytesDecompressed;\n    if (p->m_size != -1 && outProcessed > bytesTodo) {\n        outProcessed = (SizeT)bytesTodo;\n        finishMode = LZMA_FINISH_END;\n    }\n    ELzmaStatus status;\n    SRes res = LzmaDec_DecodeToBuf(&state, (Byte*)start, &outProcessed,\n        (const Byte*)next_in, &inProcessed, finishMode, &status);\n    avail_in -= inProcessed;\n    next_in += inProcessed;\n    bytesDecompressed += outProcessed;\n    if (res != SZ_OK) {\n        ostringstream str;\n        str << \"error decompressing dicsize: \" << props.dicSize\n            << \" size: \" << p->m_size\n            << \" decompressed: \" << bytesDecompressed;\n        p->m_error = str.str();\n        p->m_status = Error;\n        return -1;\n    }\n    if (inProcessed == 0 && outProcessed == 0) {\n        if (p->m_size != -1 || status != LZMA_STATUS_FINISHED_WITH_MARK) {\n            p->m_error = \"unexpected end\";\n            p->m_status = Error;\n            return -1;\n        }\n        p->m_size = bytesDecompressed;\n    } else if (status == LZMA_STATUS_FINISHED_WITH_MARK) {\n        p->m_size = bytesDecompressed;\n    }\n    return outProcessed;\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 <stdio.h>\n\n#include \"esnpapi.h\"\n\nnamespace\n{\n\nNPIdentifier getSpecialIdentifier(const Any& any)\n{\n    NPIdentifier id;\n\n    if (any.isString())\n    {\n        id =  NPN_GetStringIdentifier(static_cast<const std::string>(any).c_str());\n    }\n    else\n    {\n        id = NPN_GetIntIdentifier(static_cast<uint32_t>(any));\n    }\n    return id;\n}\n\ntemplate <typename T>\nvoid expandSequence(NPP npp, const Sequence<T> sequence, NPVariant* variantArray)\n{\n    for (unsigned i = 0; i < sequence.getLength(); ++i)\n    {\n        convertToVariant(npp, sequence[i], variantArray + i);\n    }\n}\n\nAny processResult(NPP npp, const NPVariant* variant)\n{\n    Any result = convertToAny(npp, variant);\n    if (NPVARIANT_IS_OBJECT(*variant))\n    {\n        if (!result.isObject())\n        {\n            NPN_ReleaseObject(NPVARIANT_TO_OBJECT(*variant));\n        }\n        else if (!isStub(NPVARIANT_TO_OBJECT(*variant)))\n        {\n            ProxyObject* proxy = interface_cast<ProxyObject*>(static_cast<Object*>(result));\n            if (proxy)\n            {\n                proxy->mark();\n            }\n        }\n    }\n    return result;\n}\n\n}  \/\/ namespace\n\nAny invoke(Object* object, unsigned interfaceNumber, unsigned methodNumber,\n           const char* meta, unsigned offset,\n           unsigned argumentCount, Any* arguments)\n{\n    ProxyObject* proxy = interface_cast<ProxyObject*>(object);\n    if (!proxy)\n    {\n        return Any();\n    }\n    Reflect::Interface interface = Reflect::Interface(meta);\n    Reflect::Method method = Reflect::Method(meta + offset);\n    Reflect::Type type = method.getReturnType();\n\n    printf(\"invoke %s::%s %p\\n\", interface.getName().c_str(), method.getName().c_str(), proxy->getNPObject());\n\n    NPIdentifier id;\n    NPVariant result;\n    VOID_TO_NPVARIANT(result);\n\n    if (method.isGetter())\n    {\n        id = NPN_GetStringIdentifier(method.getName().c_str());\n        if (NPN_GetProperty(proxy->getNPP(), proxy->getNPObject(), id, &result))\n        {\n            return processResult(proxy->getNPP(), &result);\n        }\n    }\n    else if (method.isSetter())\n    {\n        id = NPN_GetStringIdentifier(method.getName().c_str());\n        NPVariant value;\n        convertToVariant(proxy->getNPP(), arguments[argumentCount - 1], &value);\n        NPN_SetProperty(proxy->getNPP(), proxy->getNPObject(), id, &value);\n    }\n    else if (method.isSpecialGetter())\n    {\n        id = getSpecialIdentifier(arguments[argumentCount - 1]);\n        if (NPN_GetProperty(proxy->getNPP(), proxy->getNPObject(), id, &result))\n        {\n            return processResult(proxy->getNPP(), &result);\n        }\n    }\n    else if (method.isSpecialSetter() || method.isSpecialCreator())\n    {\n        id = getSpecialIdentifier(arguments[argumentCount - 2]);\n        NPVariant value;\n        convertToVariant(proxy->getNPP(), arguments[argumentCount - 1], &value);\n        NPN_SetProperty(proxy->getNPP(), proxy->getNPObject(), id, &value);\n    }\n    else if (method.isSpecialDeleter())\n    {\n        id = getSpecialIdentifier(arguments[argumentCount - 1]);\n        NPN_RemoveProperty(proxy->getNPP(), proxy->getNPObject(), id);\n    }\n    else\n    {\n        unsigned variadicCount = 0;\n        if (method.isVariadic())\n        {\n            --argumentCount;\n            Sequence<int> sequence(arguments[argumentCount]);  \/\/ TODO: make sure this works ignoring T\n            variadicCount = sequence.getLength();\n        }\n\n        unsigned variantCount = argumentCount + variadicCount;\n        NPVariant variantArray[variantCount];\n        for (int i = 0; i < argumentCount; ++i)\n        {\n            convertToVariant(proxy->getNPP(), arguments[i], &variantArray[i]);\n        }\n\n        if (0 < variadicCount)\n        {\n            Reflect::Parameter param = method.listParameter();\n            for (int i = 0; i < method.getParameterCount(); ++i)\n            {\n                param.next();\n            }\n            \/\/ TODO: Check Nullable, too.\n            switch (param.getType().getType())\n            {\n            case Reflect::kBoolean:\n                expandSequence(proxy->getNPP(), Sequence<bool>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kOctet:\n                expandSequence(proxy->getNPP(), Sequence<uint8_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kShort:\n                expandSequence(proxy->getNPP(), Sequence<int16_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kUnsignedShort:\n                expandSequence(proxy->getNPP(), Sequence<uint16_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kLong:\n                expandSequence(proxy->getNPP(), Sequence<int32_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kUnsignedLong:\n                expandSequence(proxy->getNPP(), Sequence<uint32_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kLongLong:\n                expandSequence(proxy->getNPP(), Sequence<int64_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kUnsignedLongLong:\n                expandSequence(proxy->getNPP(), Sequence<uint64_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kFloat:\n                expandSequence(proxy->getNPP(), Sequence<float>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kDouble:\n                expandSequence(proxy->getNPP(), Sequence<double>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kString:\n                expandSequence(proxy->getNPP(), Sequence<std::string>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kAny:\n                expandSequence(proxy->getNPP(), Sequence<Any>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            \/\/ TODO: kSequence???\n            case Reflect::kObject:\n            default:\n                expandSequence(proxy->getNPP(), Sequence<Object*>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            }\n        }\n\n        id = NPN_GetStringIdentifier(method.getName().c_str());\n        if (method.isOperation())\n        {\n            if (NPN_Invoke(proxy->getNPP(), proxy->getNPObject(), id, variantArray, variantCount, &result))\n            {\n                return processResult(proxy->getNPP(), &result);\n            }\n        }\n        else if (method.isConstructor())\n        {\n            \/\/ Chrome uses NPN_Construct()\n            if (NPN_Construct(proxy->getNPP(), proxy->getNPObject(), variantArray, variantCount, &result))\n            {\n                return processResult(proxy->getNPP(), &result);\n            }\n            \/\/ Firefox uses NPN_InvokeDefault()\n            if (NPN_InvokeDefault(proxy->getNPP(), proxy->getNPObject(), variantArray, variantCount, &result))\n            {\n                return processResult(proxy->getNPP(), &result);\n            }\n        }\n    }\n    return Any();\n}\n<commit_msg>(processResult) : Release the returned NPVariant value unless it is an NPObject to be used later.<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 <stdio.h>\n\n#include \"esnpapi.h\"\n\nnamespace\n{\n\nNPIdentifier getSpecialIdentifier(const Any& any)\n{\n    NPIdentifier id;\n\n    if (any.isString())\n    {\n        id =  NPN_GetStringIdentifier(static_cast<const std::string>(any).c_str());\n    }\n    else\n    {\n        id = NPN_GetIntIdentifier(static_cast<uint32_t>(any));\n    }\n    return id;\n}\n\ntemplate <typename T>\nvoid expandSequence(NPP npp, const Sequence<T> sequence, NPVariant* variantArray)\n{\n    for (unsigned i = 0; i < sequence.getLength(); ++i)\n    {\n        convertToVariant(npp, sequence[i], variantArray + i);\n    }\n}\n\nAny processResult(NPP npp, NPVariant* variant)\n{\n    Any result = convertToAny(npp, variant);\n    if (NPVARIANT_IS_OBJECT(*variant))\n    {\n        if (!result.isObject())\n        {\n            NPN_ReleaseObject(NPVARIANT_TO_OBJECT(*variant));\n        }\n        else if (!isStub(NPVARIANT_TO_OBJECT(*variant)))\n        {\n            ProxyObject* proxy = interface_cast<ProxyObject*>(static_cast<Object*>(result));\n            if (proxy)\n            {\n                proxy->mark();\n            }\n        }\n    }\n    else\n    {\n        NPN_ReleaseVariantValue(variant);\n    }\n    return result;\n}\n\n}  \/\/ namespace\n\nAny invoke(Object* object, unsigned interfaceNumber, unsigned methodNumber,\n           const char* meta, unsigned offset,\n           unsigned argumentCount, Any* arguments)\n{\n    ProxyObject* proxy = interface_cast<ProxyObject*>(object);\n    if (!proxy)\n    {\n        return Any();\n    }\n    Reflect::Interface interface = Reflect::Interface(meta);\n    Reflect::Method method = Reflect::Method(meta + offset);\n    Reflect::Type type = method.getReturnType();\n\n    printf(\"invoke %s::%s %p\\n\", interface.getName().c_str(), method.getName().c_str(), proxy->getNPObject());\n\n    NPIdentifier id;\n    NPVariant result;\n    VOID_TO_NPVARIANT(result);\n\n    if (method.isGetter())\n    {\n        id = NPN_GetStringIdentifier(method.getName().c_str());\n        if (NPN_GetProperty(proxy->getNPP(), proxy->getNPObject(), id, &result))\n        {\n            return processResult(proxy->getNPP(), &result);\n        }\n    }\n    else if (method.isSetter())\n    {\n        id = NPN_GetStringIdentifier(method.getName().c_str());\n        NPVariant value;\n        convertToVariant(proxy->getNPP(), arguments[argumentCount - 1], &value);\n        NPN_SetProperty(proxy->getNPP(), proxy->getNPObject(), id, &value);\n    }\n    else if (method.isSpecialGetter())\n    {\n        id = getSpecialIdentifier(arguments[argumentCount - 1]);\n        if (NPN_GetProperty(proxy->getNPP(), proxy->getNPObject(), id, &result))\n        {\n            return processResult(proxy->getNPP(), &result);\n        }\n    }\n    else if (method.isSpecialSetter() || method.isSpecialCreator())\n    {\n        id = getSpecialIdentifier(arguments[argumentCount - 2]);\n        NPVariant value;\n        convertToVariant(proxy->getNPP(), arguments[argumentCount - 1], &value);\n        NPN_SetProperty(proxy->getNPP(), proxy->getNPObject(), id, &value);\n    }\n    else if (method.isSpecialDeleter())\n    {\n        id = getSpecialIdentifier(arguments[argumentCount - 1]);\n        NPN_RemoveProperty(proxy->getNPP(), proxy->getNPObject(), id);\n    }\n    else\n    {\n        unsigned variadicCount = 0;\n        if (method.isVariadic())\n        {\n            --argumentCount;\n            Sequence<int> sequence(arguments[argumentCount]);  \/\/ TODO: make sure this works ignoring T\n            variadicCount = sequence.getLength();\n        }\n\n        unsigned variantCount = argumentCount + variadicCount;\n        NPVariant variantArray[variantCount];\n        for (int i = 0; i < argumentCount; ++i)\n        {\n            convertToVariant(proxy->getNPP(), arguments[i], &variantArray[i]);\n        }\n\n        if (0 < variadicCount)\n        {\n            Reflect::Parameter param = method.listParameter();\n            for (int i = 0; i < method.getParameterCount(); ++i)\n            {\n                param.next();\n            }\n            \/\/ TODO: Check Nullable, too.\n            switch (param.getType().getType())\n            {\n            case Reflect::kBoolean:\n                expandSequence(proxy->getNPP(), Sequence<bool>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kOctet:\n                expandSequence(proxy->getNPP(), Sequence<uint8_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kShort:\n                expandSequence(proxy->getNPP(), Sequence<int16_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kUnsignedShort:\n                expandSequence(proxy->getNPP(), Sequence<uint16_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kLong:\n                expandSequence(proxy->getNPP(), Sequence<int32_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kUnsignedLong:\n                expandSequence(proxy->getNPP(), Sequence<uint32_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kLongLong:\n                expandSequence(proxy->getNPP(), Sequence<int64_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kUnsignedLongLong:\n                expandSequence(proxy->getNPP(), Sequence<uint64_t>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kFloat:\n                expandSequence(proxy->getNPP(), Sequence<float>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kDouble:\n                expandSequence(proxy->getNPP(), Sequence<double>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kString:\n                expandSequence(proxy->getNPP(), Sequence<std::string>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            case Reflect::kAny:\n                expandSequence(proxy->getNPP(), Sequence<Any>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            \/\/ TODO: kSequence???\n            case Reflect::kObject:\n            default:\n                expandSequence(proxy->getNPP(), Sequence<Object*>(arguments[argumentCount]), &variantArray[argumentCount]);\n                break;\n            }\n        }\n\n        id = NPN_GetStringIdentifier(method.getName().c_str());\n        if (method.isOperation())\n        {\n            if (NPN_Invoke(proxy->getNPP(), proxy->getNPObject(), id, variantArray, variantCount, &result))\n            {\n                return processResult(proxy->getNPP(), &result);\n            }\n        }\n        else if (method.isConstructor())\n        {\n            \/\/ Chrome uses NPN_Construct()\n            if (NPN_Construct(proxy->getNPP(), proxy->getNPObject(), variantArray, variantCount, &result))\n            {\n                return processResult(proxy->getNPP(), &result);\n            }\n            \/\/ Firefox uses NPN_InvokeDefault()\n            if (NPN_InvokeDefault(proxy->getNPP(), proxy->getNPObject(), variantArray, variantCount, &result))\n            {\n                return processResult(proxy->getNPP(), &result);\n            }\n        }\n    }\n    return Any();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * qmqtt_frame.cpp - qmqtt frame\n *\n * Copyright (c) 2013  Ery Lee <ery.lee at gmail dot com>\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 mqttc nor the names of its contributors may be used\n *     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 *\/\n#include <QDataStream>\n#include \"qmqtt_frame.h\"\n\nnamespace QMQTT {\n\nFrame::Frame(quint8 header, QObject *parent) :\n    QObject(parent),\n    _header(header),\n    _data(QByteArray())\n{\n}\n\nFrame::Frame(quint8 header, QByteArray & data, QObject *parent) :\n    QObject(parent),\n    _header(header),\n    _data(data)\n{\n}\n\nFrame::~Frame()\n{\n\n}\n\nquint8 Frame::header()\n{\n    return _header;\n}\n\nQByteArray & Frame::data()\n{\n    return _data;\n}\n\nchar Frame::readChar()\n{\n    char c = _data.at(0);\n    _data.remove(0, 1);\n    return c;\n}\n\nint Frame::readInt()\n{\n    char msb = _data.at(0);\n    char lsb = _data.at(1);\n    _data.remove(0, 2);\n    return (msb << 8) + lsb;\n}\n\nQString Frame::readString()\n{\n    int len = readInt();\n    QString s(_data.left(len));\n    _data.remove(0, len);\n    return s;\n}\n\nvoid Frame::writeInt(int i)\n{\n    _data.append(MSB(i));\n    _data.append(LSB(i));\n}\n\nvoid Frame::writeString(const QString &string)\n{\n    writeInt(string.size());\n    _data.append(string);\n}\n\nvoid Frame::writeChar(char c)\n{\n    _data.append(c);\n}\n\nvoid Frame::writeRawData(const QByteArray &data)\n{\n    _data.append(data);\n}\n\nvoid Frame::write(QDataStream &stream)\n{\n    QByteArray lenbuf;\n    stream << (quint8)_header;\n    if(_data.size() == 0) {\n        stream << (QChar)0;\n        return;\n    }\n    qDebug(\"_data.size: %d\", _data.size());\n    encodeLength(lenbuf, _data.size());\n    stream.writeRawData(lenbuf.data(), lenbuf.size());\n    stream.writeRawData(_data.data(), _data.size());\n}\n\nvoid Frame::encodeLength(QByteArray &lenbuf, int length)\n{\n    char d;\n    do {\n        d = length % 128;\n        length \/= 128;\n        if (length > 0) {\n            d |= 0x80;\n        }\n        lenbuf.append(d);\n    } while (length > 0);\n}\n\n} \/\/ namespace QMQTT\n<commit_msg>QChar -> qunit8<commit_after>\/*\n * qmqtt_frame.cpp - qmqtt frame\n *\n * Copyright (c) 2013  Ery Lee <ery.lee at gmail dot com>\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 mqttc nor the names of its contributors may be used\n *     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 *\/\n#include <QDataStream>\n#include \"qmqtt_frame.h\"\n\nnamespace QMQTT {\n\nFrame::Frame(quint8 header, QObject *parent) :\n    QObject(parent),\n    _header(header),\n    _data(QByteArray())\n{\n}\n\nFrame::Frame(quint8 header, QByteArray & data, QObject *parent) :\n    QObject(parent),\n    _header(header),\n    _data(data)\n{\n}\n\nFrame::~Frame()\n{\n\n}\n\nquint8 Frame::header()\n{\n    return _header;\n}\n\nQByteArray & Frame::data()\n{\n    return _data;\n}\n\nchar Frame::readChar()\n{\n    char c = _data.at(0);\n    _data.remove(0, 1);\n    return c;\n}\n\nint Frame::readInt()\n{\n    char msb = _data.at(0);\n    char lsb = _data.at(1);\n    _data.remove(0, 2);\n    return (msb << 8) + lsb;\n}\n\nQString Frame::readString()\n{\n    int len = readInt();\n    QString s(_data.left(len));\n    _data.remove(0, len);\n    return s;\n}\n\nvoid Frame::writeInt(int i)\n{\n    _data.append(MSB(i));\n    _data.append(LSB(i));\n}\n\nvoid Frame::writeString(const QString &string)\n{\n    writeInt(string.size());\n    _data.append(string);\n}\n\nvoid Frame::writeChar(char c)\n{\n    _data.append(c);\n}\n\nvoid Frame::writeRawData(const QByteArray &data)\n{\n    _data.append(data);\n}\n\nvoid Frame::write(QDataStream &stream)\n{\n    QByteArray lenbuf;\n    stream << (quint8)_header;\n    if(_data.size() == 0) {\n        stream << (quint8)0;\n        return;\n    }\n    qDebug(\"_data.size: %d\", _data.size());\n    encodeLength(lenbuf, _data.size());\n    stream.writeRawData(lenbuf.data(), lenbuf.size());\n    stream.writeRawData(_data.data(), _data.size());\n}\n\nvoid Frame::encodeLength(QByteArray &lenbuf, int length)\n{\n    char d;\n    do {\n        d = length % 128;\n        length \/= 128;\n        if (length > 0) {\n            d |= 0x80;\n        }\n        lenbuf.append(d);\n    } while (length > 0);\n}\n\n} \/\/ namespace QMQTT\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2021 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\n\/\/ <h1> Systems Example 8 - \"Small-sliding\" contact. <\/h1>\n\/\/ \\author David Knezevic\n\/\/ \\date 2015\n\/\/\n\/\/ In this example, we consider a linear elastic model with contact. We restrict ourselves\n\/\/ to considering \"small sliding\", which means that we set the contact \"load transfer\" between\n\/\/ surfaces up front, based on the undeformed mesh, and retain that load transfer throughout\n\/\/ the solve. Even though we consider linear elasticity here, this is a nonlinear problem due\n\/\/ to the contact condition.\n\/\/\n\/\/ The contact condition is imposed using the augmented Lagrangian method, e.g. see\n\/\/ Simo & Laursen (1992). For the sake of simplicity, in this example we assume that contact\n\/\/ nodes are perfectly aligned (this assumption can be eliminated relatively easily).\n\/\/\n\/\/ The mesh in this example consists of two disconnected cylinders. We add edge elements into\n\/\/ the mesh in order to ensure correct parallel communication of data on contact surfaces,\n\/\/ and also so that we do not have to manually augment the sparsity pattern.\n\n\/\/  We impose a displacement boundary condition of -1 in the z-direction on the top cylinder\n\/\/ in order to impose contact.\n\n\/\/ C++ include files that we need\n#include <iostream>\n\n\/\/ libMesh includes\n#include \"libmesh\/libmesh.h\"\n#include \"libmesh\/replicated_mesh.h\"\n#include \"libmesh\/exodusII_io.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/getpot.h\"\n#include \"libmesh\/dirichlet_boundaries.h\"\n#include \"libmesh\/string_to_enum.h\"\n#include \"libmesh\/zero_function.h\"\n#include \"libmesh\/nonlinear_solver.h\"\n#include \"libmesh\/nonlinear_implicit_system.h\"\n#include \"libmesh\/petsc_macro.h\"\n#include \"libmesh\/enum_solver_package.h\"\n#include \"libmesh\/mesh_refinement.h\"\n\n\/\/ Local includes\n#include \"linear_elasticity_with_contact.h\"\n\nusing namespace libMesh;\n\nint main (int argc, char ** argv)\n{\n  LibMeshInit init (argc, argv);\n\n  \/\/ This example uses an ExodusII input file\n#ifndef LIBMESH_HAVE_EXODUS_API\n  libmesh_example_requires(false, \"--enable-exodus\");\n#endif\n\n  \/\/ We use a 3D domain.\n  libmesh_example_requires(LIBMESH_DIM > 2, \"--disable-1D-only --disable-2D-only\");\n\n  \/\/ We use Dirichlet boundary conditions here\n#ifndef LIBMESH_ENABLE_DIRICHLET\n  libmesh_example_requires(false, \"--enable-dirichlet\");\n#endif\n\n  \/\/ This example requires the PETSc nonlinear solvers\n  libmesh_example_requires(libMesh::default_solver_package() == PETSC_SOLVERS, \"--enable-petsc\");\n\n  GetPot infile(\"systems_of_equations_ex8.in\");\n  infile.parse_command_line(argc,argv);\n\n  const std::string approx_order = infile(\"approx_order\", \"FIRST\");\n  const std::string fe_family = infile(\"fe_family\", \"LAGRANGE\");\n\n  const Real young_modulus = infile(\"Young_modulus\", 1.0);\n  const Real poisson_ratio = infile(\"poisson_ratio\", 0.3);\n\n  const Real nonlinear_abs_tol = infile(\"nonlinear_abs_tol\", 1.e-8);\n  const Real nonlinear_rel_tol = infile(\"nonlinear_rel_tol\", 1.e-8);\n  const unsigned int nonlinear_max_its = infile(\"nonlinear_max_its\", 50);\n  const Real contact_penalty = infile(\"contact_penalty\", 1.e2);\n  const Real gap_function_tol = infile(\"gap_function_tol\", 1.e-8);\n\n  \/\/ This example code has not been written to cope with a distributed mesh\n  ReplicatedMesh mesh(init.comm());\n  mesh.read(\"systems_of_equations_ex8.exo\");\n\n  const unsigned int n_refinements = infile(\"n_refinements\", 0);\n  \/\/ Skip adaptive runs on a non-adaptive libMesh build\n#ifndef LIBMESH_ENABLE_AMR\n  libmesh_example_requires(n_refinements==0, \"--enable-amr\");\n#else\n  MeshRefinement mesh_refinement(mesh);\n  mesh_refinement.uniformly_refine(n_refinements);\n#endif\n\n  mesh.print_info();\n\n  EquationSystems equation_systems (mesh);\n\n  NonlinearImplicitSystem & system =\n    equation_systems.add_system<NonlinearImplicitSystem> (\"NonlinearElasticity\");\n\n  LinearElasticityWithContact le(system, contact_penalty);\n\n  unsigned int u_var =\n    system.add_variable(\"u\",\n                        Utility::string_to_enum<Order>   (approx_order),\n                        Utility::string_to_enum<FEFamily>(fe_family));\n\n  unsigned int v_var =\n    system.add_variable(\"v\",\n                        Utility::string_to_enum<Order>   (approx_order),\n                        Utility::string_to_enum<FEFamily>(fe_family));\n\n  unsigned int w_var =\n    system.add_variable(\"w\",\n                        Utility::string_to_enum<Order>   (approx_order),\n                        Utility::string_to_enum<FEFamily>(fe_family));\n\n  \/\/ Also, initialize an ExplicitSystem to store stresses\n  ExplicitSystem & stress_system =\n    equation_systems.add_system<ExplicitSystem> (\"StressSystem\");\n\n  stress_system.add_variable(\"sigma_00\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_01\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_02\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_11\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_12\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_22\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"vonMises\", CONSTANT, MONOMIAL);\n\n  equation_systems.parameters.set<Real> (\"nonlinear solver absolute residual tolerance\") = nonlinear_abs_tol;\n  equation_systems.parameters.set<Real> (\"nonlinear solver relative residual tolerance\") = nonlinear_rel_tol;\n  equation_systems.parameters.set<unsigned int> (\"nonlinear solver maximum iterations\") = nonlinear_max_its;\n\n  system.nonlinear_solver->residual_and_jacobian_object = &le;\n\n  equation_systems.parameters.set<Real>(\"young_modulus\") = young_modulus;\n  equation_systems.parameters.set<Real>(\"poisson_ratio\") = poisson_ratio;\n\n#ifdef LIBMESH_ENABLE_DIRICHLET\n  \/\/ Attach Dirichlet boundary conditions\n  {\n    std::set<boundary_id_type> clamped_boundaries;\n    clamped_boundaries.insert(MIN_Z_BOUNDARY);\n\n    std::vector<unsigned int> uvw;\n    uvw.push_back(u_var);\n    uvw.push_back(v_var);\n    uvw.push_back(w_var);\n\n    ZeroFunction<Number> zero;\n\n    \/\/ Most DirichletBoundary users will want to supply a \"locally\n    \/\/ indexed\" functor\n    system.get_dof_map().add_dirichlet_boundary\n      (DirichletBoundary (clamped_boundaries, uvw, zero,\n                          LOCAL_VARIABLE_ORDER));\n  }\n  {\n    std::set<boundary_id_type> clamped_boundaries;\n    clamped_boundaries.insert(MAX_Z_BOUNDARY);\n\n    std::vector<unsigned int> uv;\n    uv.push_back(u_var);\n    uv.push_back(v_var);\n\n    ZeroFunction<Number> zero;\n\n    system.get_dof_map().add_dirichlet_boundary\n      (DirichletBoundary (clamped_boundaries, uv, zero,\n                          LOCAL_VARIABLE_ORDER));\n  }\n  {\n    std::set<boundary_id_type> clamped_boundaries;\n    clamped_boundaries.insert(MAX_Z_BOUNDARY);\n\n    std::vector<unsigned int> w;\n    w.push_back(w_var);\n\n    ConstFunction<Number> neg_one(-1.);\n\n    system.get_dof_map().add_dirichlet_boundary\n      (DirichletBoundary (clamped_boundaries, w, neg_one,\n                          LOCAL_VARIABLE_ORDER));\n  }\n#else\n  libmesh_ignore(u_var, v_var, w_var);\n#endif \/\/ LIBMESH_ENABLE_DIRICHLET\n\n  le.initialize_contact_load_paths();\n\n  libMesh::out << \"Mesh before adding edge connectors\" << std::endl;\n  mesh.print_info();\n  le.add_contact_edge_elements();\n\n  libMesh::out << \"Mesh after adding edge connectors\" << std::endl;\n  mesh.print_info();\n\n  equation_systems.init();\n  equation_systems.print_info();\n\n  libMesh::out << \"Contact penalty: \" << contact_penalty  << std::endl << std::endl;\n\n  Real current_max_gap_function = std::numeric_limits<Real>::max();\n\n  const unsigned int max_outer_iterations = 10;\n  for (unsigned int outer_iteration = 0;\n       outer_iteration != max_outer_iterations; ++outer_iteration)\n    {\n      if (current_max_gap_function <= gap_function_tol)\n        {\n          libMesh::out << \"Outer loop converged\" << std::endl;\n          break;\n        }\n\n      libMesh::out << \"Starting outer iteration \" << outer_iteration << std::endl;\n\n      \/\/ Perform inner iteration (i.e. Newton's method loop)\n      system.solve();\n      system.nonlinear_solver->print_converged_reason();\n\n      \/\/ Perform augmented Lagrangian update\n      le.update_lambdas();\n\n      std::pair<Real, Real> least_and_max_gap_function = le.get_least_and_max_gap_function();\n      Real least_gap_fn = least_and_max_gap_function.first;\n      Real max_gap_fn = least_and_max_gap_function.second;\n\n      libMesh::out << \"Finished outer iteration, least gap function: \"\n                   << least_gap_fn\n                   << \", max gap function: \"\n                   << max_gap_fn\n                   << std::endl\n                   << std::endl;\n\n      current_max_gap_function = std::max(std::abs(least_gap_fn), std::abs(max_gap_fn));\n    }\n\n  libMesh::out << \"Computing stresses...\" << std::endl;\n\n  le.compute_stresses();\n\n  std::stringstream filename;\n  filename << \"solution.exo\";\n  ExodusII_IO (mesh).write_equation_systems(filename.str(),\n                                            equation_systems);\n\n  return 0;\n}\n<commit_msg>Fix BC issue in systems_of_equations_ex8<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2021 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\n\/\/ <h1> Systems Example 8 - \"Small-sliding\" contact. <\/h1>\n\/\/ \\author David Knezevic\n\/\/ \\date 2015\n\/\/\n\/\/ In this example, we consider a linear elastic model with contact. We restrict ourselves\n\/\/ to considering \"small sliding\", which means that we set the contact \"load transfer\" between\n\/\/ surfaces up front, based on the undeformed mesh, and retain that load transfer throughout\n\/\/ the solve. Even though we consider linear elasticity here, this is a nonlinear problem due\n\/\/ to the contact condition.\n\/\/\n\/\/ The contact condition is imposed using the augmented Lagrangian method, e.g. see\n\/\/ Simo & Laursen (1992). For the sake of simplicity, in this example we assume that contact\n\/\/ nodes are perfectly aligned (this assumption can be eliminated relatively easily).\n\/\/\n\/\/ The mesh in this example consists of two disconnected cylinders. We add edge elements into\n\/\/ the mesh in order to ensure correct parallel communication of data on contact surfaces,\n\/\/ and also so that we do not have to manually augment the sparsity pattern.\n\n\/\/  We impose a displacement boundary condition of -1 in the z-direction on the top cylinder\n\/\/ in order to impose contact.\n\n\/\/ C++ include files that we need\n#include <iostream>\n\n\/\/ libMesh includes\n#include \"libmesh\/libmesh.h\"\n#include \"libmesh\/replicated_mesh.h\"\n#include \"libmesh\/exodusII_io.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/getpot.h\"\n#include \"libmesh\/dirichlet_boundaries.h\"\n#include \"libmesh\/string_to_enum.h\"\n#include \"libmesh\/zero_function.h\"\n#include \"libmesh\/nonlinear_solver.h\"\n#include \"libmesh\/nonlinear_implicit_system.h\"\n#include \"libmesh\/petsc_macro.h\"\n#include \"libmesh\/enum_solver_package.h\"\n#include \"libmesh\/mesh_refinement.h\"\n\n\/\/ Local includes\n#include \"linear_elasticity_with_contact.h\"\n\nusing namespace libMesh;\n\nint main (int argc, char ** argv)\n{\n  LibMeshInit init (argc, argv);\n\n  \/\/ This example uses an ExodusII input file\n#ifndef LIBMESH_HAVE_EXODUS_API\n  libmesh_example_requires(false, \"--enable-exodus\");\n#endif\n\n  \/\/ We use a 3D domain.\n  libmesh_example_requires(LIBMESH_DIM > 2, \"--disable-1D-only --disable-2D-only\");\n\n  \/\/ We use Dirichlet boundary conditions here\n#ifndef LIBMESH_ENABLE_DIRICHLET\n  libmesh_example_requires(false, \"--enable-dirichlet\");\n#endif\n\n  \/\/ This example requires the PETSc nonlinear solvers\n  libmesh_example_requires(libMesh::default_solver_package() == PETSC_SOLVERS, \"--enable-petsc\");\n\n  GetPot infile(\"systems_of_equations_ex8.in\");\n  infile.parse_command_line(argc,argv);\n\n  const std::string approx_order = infile(\"approx_order\", \"FIRST\");\n  const std::string fe_family = infile(\"fe_family\", \"LAGRANGE\");\n\n  const Real young_modulus = infile(\"Young_modulus\", 1.0);\n  const Real poisson_ratio = infile(\"poisson_ratio\", 0.3);\n\n  const Real nonlinear_abs_tol = infile(\"nonlinear_abs_tol\", 1.e-8);\n  const Real nonlinear_rel_tol = infile(\"nonlinear_rel_tol\", 1.e-8);\n  const unsigned int nonlinear_max_its = infile(\"nonlinear_max_its\", 50);\n  const Real contact_penalty = infile(\"contact_penalty\", 1.e2);\n  const Real gap_function_tol = infile(\"gap_function_tol\", 1.e-8);\n\n  \/\/ This example code has not been written to cope with a distributed mesh\n  ReplicatedMesh mesh(init.comm());\n  mesh.read(\"systems_of_equations_ex8.exo\");\n\n  const unsigned int n_refinements = infile(\"n_refinements\", 0);\n  \/\/ Skip adaptive runs on a non-adaptive libMesh build\n#ifndef LIBMESH_ENABLE_AMR\n  libmesh_example_requires(n_refinements==0, \"--enable-amr\");\n#else\n  MeshRefinement mesh_refinement(mesh);\n  mesh_refinement.uniformly_refine(n_refinements);\n#endif\n\n  mesh.print_info();\n\n  EquationSystems equation_systems (mesh);\n\n  NonlinearImplicitSystem & system =\n    equation_systems.add_system<NonlinearImplicitSystem> (\"NonlinearElasticity\");\n\n  LinearElasticityWithContact le(system, contact_penalty);\n\n  unsigned int u_var =\n    system.add_variable(\"u\",\n                        Utility::string_to_enum<Order>   (approx_order),\n                        Utility::string_to_enum<FEFamily>(fe_family));\n\n  unsigned int v_var =\n    system.add_variable(\"v\",\n                        Utility::string_to_enum<Order>   (approx_order),\n                        Utility::string_to_enum<FEFamily>(fe_family));\n\n  unsigned int w_var =\n    system.add_variable(\"w\",\n                        Utility::string_to_enum<Order>   (approx_order),\n                        Utility::string_to_enum<FEFamily>(fe_family));\n\n  \/\/ Also, initialize an ExplicitSystem to store stresses\n  ExplicitSystem & stress_system =\n    equation_systems.add_system<ExplicitSystem> (\"StressSystem\");\n\n  stress_system.add_variable(\"sigma_00\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_01\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_02\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_11\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_12\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"sigma_22\", CONSTANT, MONOMIAL);\n  stress_system.add_variable(\"vonMises\", CONSTANT, MONOMIAL);\n\n  equation_systems.parameters.set<Real> (\"nonlinear solver absolute residual tolerance\") = nonlinear_abs_tol;\n  equation_systems.parameters.set<Real> (\"nonlinear solver relative residual tolerance\") = nonlinear_rel_tol;\n  equation_systems.parameters.set<unsigned int> (\"nonlinear solver maximum iterations\") = nonlinear_max_its;\n\n  system.nonlinear_solver->residual_and_jacobian_object = &le;\n\n  equation_systems.parameters.set<Real>(\"young_modulus\") = young_modulus;\n  equation_systems.parameters.set<Real>(\"poisson_ratio\") = poisson_ratio;\n\n#ifdef LIBMESH_ENABLE_DIRICHLET\n  \/\/ Attach Dirichlet boundary conditions\n  {\n    std::set<boundary_id_type> clamped_boundaries;\n    clamped_boundaries.insert(MIN_Z_BOUNDARY);\n\n    std::vector<unsigned int> uvw;\n    uvw.push_back(u_var);\n    uvw.push_back(v_var);\n    uvw.push_back(w_var);\n\n    ZeroFunction<Number> zero;\n\n    \/\/ Most DirichletBoundary users will want to supply a \"locally\n    \/\/ indexed\" functor\n    system.get_dof_map().add_dirichlet_boundary\n      (DirichletBoundary (clamped_boundaries, uvw, zero,\n                          LOCAL_VARIABLE_ORDER));\n  }\n  {\n    std::set<boundary_id_type> clamped_boundaries;\n    clamped_boundaries.insert(MAX_Z_BOUNDARY);\n\n    std::vector<unsigned int> uv;\n    uv.push_back(u_var);\n    uv.push_back(v_var);\n\n    ZeroFunction<Number> zero;\n\n    system.get_dof_map().add_dirichlet_boundary\n      (DirichletBoundary (clamped_boundaries, uv, zero,\n                          LOCAL_VARIABLE_ORDER));\n  }\n  {\n    std::set<boundary_id_type> clamped_boundaries;\n    clamped_boundaries.insert(MAX_Z_BOUNDARY);\n\n    std::vector<unsigned int> w;\n    w.push_back(w_var);\n\n    ConstFunction<Number> neg_one(-1.);\n\n    system.get_dof_map().add_dirichlet_boundary\n      (DirichletBoundary (clamped_boundaries, w, neg_one,\n                          LOCAL_VARIABLE_ORDER));\n  }\n#else\n  libmesh_ignore(u_var, v_var, w_var);\n#endif \/\/ LIBMESH_ENABLE_DIRICHLET\n\n  le.initialize_contact_load_paths();\n\n  libMesh::out << \"Mesh before adding edge connectors\" << std::endl;\n  mesh.print_info();\n  le.add_contact_edge_elements();\n\n  libMesh::out << \"Mesh after adding edge connectors\" << std::endl;\n  mesh.print_info();\n\n  equation_systems.init();\n  equation_systems.print_info();\n\n  libMesh::out << \"Contact penalty: \" << contact_penalty  << std::endl << std::endl;\n\n  Real current_max_gap_function = std::numeric_limits<Real>::max();\n\n  const unsigned int max_outer_iterations = 10;\n  for (unsigned int outer_iteration = 0;\n       outer_iteration != max_outer_iterations; ++outer_iteration)\n    {\n      if (current_max_gap_function <= gap_function_tol)\n        {\n          libMesh::out << \"Outer loop converged\" << std::endl;\n          break;\n        }\n\n      libMesh::out << \"Starting outer iteration \" << outer_iteration << std::endl;\n\n      \/\/ Perform inner iteration (i.e. Newton's method loop)\n      system.solve();\n      system.nonlinear_solver->print_converged_reason();\n\n      \/\/ Perform augmented Lagrangian update\n      le.update_lambdas();\n\n      std::pair<Real, Real> least_and_max_gap_function = le.get_least_and_max_gap_function();\n      Real least_gap_fn = least_and_max_gap_function.first;\n      Real max_gap_fn = least_and_max_gap_function.second;\n\n      libMesh::out << \"Finished outer iteration, least gap function: \"\n                   << least_gap_fn\n                   << \", max gap function: \"\n                   << max_gap_fn\n                   << std::endl\n                   << std::endl;\n\n      current_max_gap_function = std::max(std::abs(least_gap_fn), std::abs(max_gap_fn));\n    }\n\n  \/\/ Enforcing constraints imposes the non-zero Dirichlet constraints on the solution.\n  system.get_dof_map().enforce_constraints_exactly(system);\n  system.update();\n\n  libMesh::out << \"Computing stresses...\" << std::endl;\n\n  le.compute_stresses();\n\n  std::stringstream filename;\n  filename << \"solution.exo\";\n  ExodusII_IO (mesh).write_equation_systems(filename.str(),\n                                            equation_systems);\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 \"tmop.hpp\"\n#include \"linearform.hpp\"\n#include \"pgridfunc.hpp\"\n#include \"tmop_tools.hpp\"\n#include \"quadinterpolator.hpp\"\n#include \"..\/general\/forall.hpp\"\n#include \"..\/linalg\/kernels.hpp\"\n\nnamespace mfem\n{\n\n\nvoid TMOP_Integrator::SetupGradPA(const Vector &xe) const\n{\n   MFEM_VERIFY(PA.R, \"PA extension setup has not been done!\");\n   PA.setup_Grad = true;\n\n   if (PA.dim == 2)\n   {\n      AssembleGradPA_2D(xe);\n      if (coeff0) { AssembleGradPA_C0_2D(xe); }\n   }\n\n   if (PA.dim == 3)\n   {\n      AssembleGradPA_3D(xe);\n      if (coeff0) { AssembleGradPA_C0_3D(xe); }\n   }\n}\n\n\/\/ We might come here w\/o knowing that PA will be used.\n\/\/ It is the case when EnableLimiting is called before the Setup => AssemblePA.\nvoid TMOP_Integrator::EnableLimitingPA(const GridFunction &n0)\n{\n   MFEM_VERIFY(PA.enabled, \"EnableLimitingPA but PA is not enabled!\");\n   const ElementDofOrdering ordering = ElementDofOrdering::LEXICOGRAPHIC;\n\n   \/\/ Nodes0\n   const FiniteElementSpace *n0_fes = n0.FESpace();\n   const Operator *n0_R = n0_fes->GetElementRestriction(ordering);\n   PA.X0.SetSize(n0_R->Height(), Device::GetMemoryType());\n   PA.X0.UseDevice(true);\n   n0_R->Mult(n0, PA.X0);\n\n   \/\/ Get the 1D maps for the distance FE space.\n   const IntegrationRule &ir = EnergyIntegrationRule(*n0_fes->GetFE(0));\n   PA.maps_lim =\n      &lim_dist->FESpace()->GetFE(0)->GetDofToQuad(ir, DofToQuad::TENSOR);\n\n   \/\/ lim_dist & lim_func checks\n   MFEM_VERIFY(lim_dist, \"No lim_dist!\")\n   const FiniteElementSpace *ld_fes = lim_dist->FESpace();\n   const Operator *ld_R = ld_fes->GetElementRestriction(ordering);\n   MFEM_VERIFY(ld_R, \"No lim_dist restriction operator found!\");\n   PA.LD.SetSize(ld_R->Height(), Device::GetMemoryType());\n   PA.LD.UseDevice(true);\n   ld_R->Mult(*lim_dist, PA.LD);\n\n   \/\/ Only TMOP_QuadraticLimiter is supported\n   MFEM_VERIFY(lim_func, \"No lim_func!\")\n   MFEM_VERIFY(dynamic_cast<TMOP_QuadraticLimiter*>(lim_func),\n               \"Only TMOP_QuadraticLimiter is supported\");\n}\n\nbool TargetConstructor::ComputeElementTargetsPA(const FiniteElementSpace *fes,\n                                                const IntegrationRule *ir,\n                                                DenseTensor &Jtr,\n                                                const Vector &xe) const\n{\n   MFEM_VERIFY(Jtr.SizeI() == Jtr.SizeJ() && Jtr.SizeI() > 1, \"\");\n   const int dim = Jtr.SizeI();\n   if (dim == 2) { return ComputeElementTargetsPA<2>(fes, ir, Jtr, xe); }\n   if (dim == 3) { return ComputeElementTargetsPA<3>(fes, ir, Jtr, xe); }\n   return false;\n}\n\nbool AnalyticAdaptTC::ComputeElementTargetsPA(const FiniteElementSpace *fes,\n                                              const IntegrationRule *ir,\n                                              DenseTensor &Jtr,\n                                              const Vector &xe) const\n{\n   return false;\n}\n\n\n\/\/ Code paths leading to ComputeElementTargets:\n\/\/ - GetElementEnergy(elfun) which is done through GetGridFunctionEnergyPA(x)\n\/\/ - AssembleElementVectorExact(elfun)\n\/\/ - AssembleElementGradExact(elfun)\n\/\/ - EnableNormalization(x) -> ComputeNormalizationEnergies(x)\n\/\/ - (AssembleElementVectorFD(elfun))\n\/\/ - (AssembleElementGradFD(elfun))\n\/\/ ============================================================================\n\/\/      - TargetConstructor():\n\/\/          - IDEAL_SHAPE_UNIT_SIZE: Wideal\n\/\/          - IDEAL_SHAPE_EQUAL_SIZE: α * Wideal\n\/\/          - IDEAL_SHAPE_GIVEN_SIZE: β * Wideal\n\/\/          - GIVEN_SHAPE_AND_SIZE:   β * Wideal\n\/\/      - AnalyticAdaptTC(elfun):\n\/\/          - GIVEN_FULL: matrix_tspec->Eval(Jtr(elfun))\n\/\/      - DiscreteAdaptTC():\n\/\/          - IDEAL_SHAPE_GIVEN_SIZE: size^{1.0\/dim} * Jtr(i)  (size)\n\/\/          - GIVEN_SHAPE_AND_SIZE:   Jtr(i) *= D_rho          (ratio)\n\/\/                                    Jtr(i) *= Q_phi          (skew)\n\/\/                                    Jtr(i) *= R_theta        (orientation)\nvoid TMOP_Integrator::ComputeElementTargetsPA(const Vector &xe) const\n{\n   PA.setup_Jtr = false;\n   const FiniteElementSpace *fes = PA.fes;\n   const IntegrationRule &ir = EnergyIntegrationRule(*fes->GetFE(0));\n\n   {\n      \/\/ Try to use the TargetConstructor ComputeElementTargetsPA\n      PA.setup_Jtr = targetC->ComputeElementTargetsPA(fes, &ir, PA.Jtr);\n      if (PA.setup_Jtr) { return; }\n   }\n\n   \/\/ Defaulting to host version\n   PA.Jtr.HostWrite();\n\n   const int NE = PA.ne;\n   const int NQ = PA.nq;\n   const int dim = PA.dim;\n   DenseTensor &Jtr = PA.Jtr;\n\n   const TargetConstructor::TargetType &target_type = targetC->Type();\n\n   \/\/ Skip when TargetConstructor needs the nodes but have not been set\n   const bool tc_wn = target_type != TargetConstructor::IDEAL_SHAPE_UNIT_SIZE;\n   if (targetC && tc_wn && !targetC->GetNodes()) { return; }\n\n   Vector x;\n   const bool useable_input_vector = xe.Size() > 0;\n   const bool use_input_vector = target_type == TargetConstructor::GIVEN_FULL;\n\n   if (use_input_vector && !useable_input_vector) { return; }\n\n   DiscreteAdaptTC *discr_tc = GetDiscreteAdaptTC();\n   if (discr_tc && !discr_tc->GetTspecFesv()) { return; }\n\n   if (use_input_vector)\n   {\n      x.SetSize(PA.R->Width(), Device::GetMemoryType());\n      x.UseDevice(true);\n      PA.R->MultTranspose(xe, x);\n      \/\/ Scale by weights\n      const int N = PA.W.Size();\n      const auto W = Reshape(PA.W.Read(), N);\n      auto X = Reshape(x.ReadWrite(), N);\n      MFEM_FORALL(i, N, X(i) \/= W(i););\n   }\n\n   \/\/ Use TargetConstructor::ComputeElementTargets to fill the PA.Jtr\n   Vector elfun;\n   Array<int> vdofs;\n   DenseTensor J;\n   for (int e = 0; e < NE; e++)\n   {\n      const FiniteElement &fe = *fes->GetFE(e);\n      if (use_input_vector)\n      {\n         fes->GetElementVDofs(e, vdofs);\n         x.GetSubVector(vdofs, elfun);\n      }\n      J.UseExternalData(Jtr(e*NQ).Data(), dim, dim, NQ);\n      targetC->ComputeElementTargets(e, fe, ir, elfun, J);\n   }\n   PA.setup_Jtr = true;\n}\n\nvoid TMOP_Integrator::AssemblePA(const FiniteElementSpace &fes)\n{\n   PA.enabled = true;\n   MFEM_ASSERT(fes.GetMesh()->GetNE() > 0, \"\");\n   PA.ir = &EnergyIntegrationRule(*fes.GetFE(0));\n   const IntegrationRule &ir = *PA.ir;\n   MFEM_ASSERT(fes.GetOrdering() == Ordering::byNODES,\n               \"PA Only supports Ordering::byNODES!\");\n\n   PA.fes = &fes;\n   Mesh *mesh = fes.GetMesh();\n   const int nq = PA.nq = ir.GetNPoints();\n   const int ne = PA.ne = fes.GetMesh()->GetNE();\n   const int dim = PA.dim = mesh->Dimension();\n   MFEM_VERIFY(PA.dim == 2 || PA.dim == 3, \"Not yet implemented!\");\n\n   const DofToQuad::Mode mode = DofToQuad::TENSOR;\n   PA.maps = &fes.GetFE(0)->GetDofToQuad(ir, mode);\n   PA.geom = mesh->GetGeometricFactors(ir, GeometricFactors::JACOBIANS, mode);\n\n   \/\/ Energy vector\n   PA.E.UseDevice(true);\n   PA.E.SetSize(ne*nq, Device::GetDeviceMemoryType());\n\n   \/\/ Setup initialization\n   PA.setup_Jtr = false;\n   PA.setup_Grad = false;\n\n   \/\/ H for Grad\n   PA.H.UseDevice(true);\n   PA.H.SetSize(dim*dim * dim*dim * nq*ne, Device::GetDeviceMemoryType());\n   \/\/ H0 for coeff0\n   PA.H0.UseDevice(true);\n   PA.H0.SetSize(dim * dim * nq*ne, Device::GetDeviceMemoryType());\n\n   \/\/ Restriction setup\n   const ElementDofOrdering ordering = ElementDofOrdering::LEXICOGRAPHIC;\n   PA.R = fes.GetElementRestriction(ordering);\n   MFEM_VERIFY(PA.R, \"Not yet implemented!\");\n\n   \/\/ Weight of the R^t\n   PA.W.SetSize(PA.R->Width(), Device::GetDeviceMemoryType());\n   PA.W.UseDevice(true);\n   PA.O.SetSize(dim*ne*nq, Device::GetDeviceMemoryType());\n   PA.O.UseDevice(true);\n   PA.O = 1.0;\n   PA.R->MultTranspose(PA.O, PA.W);\n\n   \/\/ Scalar vector of '1'\n   PA.O.SetSize(ne*nq, Device::GetDeviceMemoryType());\n   PA.O = 1.0;\n\n   \/\/ TargetConstructor TargetType setup\n   PA.Jtr.SetSize(dim, dim, PA.ne*PA.nq);\n   ComputeElementTargetsPA();\n\n   \/\/ Coeff0 PA.C0\n   PA.C0.UseDevice(true);\n   if (coeff0 == nullptr)\n   {\n      PA.C0.SetSize(1, Device::GetMemoryType());\n      PA.C0.HostWrite();\n      PA.C0(0) = 0.0;\n   }\n   else if (ConstantCoefficient* cQ =\n               dynamic_cast<ConstantCoefficient*>(coeff0))\n   {\n      PA.C0.SetSize(1, Device::GetMemoryType());\n      PA.C0.HostWrite();\n      PA.C0(0) = cQ->constant;\n   }\n   else\n   {\n      PA.C0.SetSize(PA.nq * PA.ne, Device::GetMemoryType());\n      auto C0 = Reshape(PA.C0.HostWrite(), PA.nq, PA.ne);\n      for (int e = 0; e < ne; ++e)\n      {\n         ElementTransformation& T = *fes.GetElementTransformation(e);\n         for (int q = 0; q < nq; ++q)\n         {\n            C0(q,e) = coeff0->Eval(T, ir.IntPoint(q));\n         }\n      }\n   }\n\n   if (coeff0)\n   {\n      MFEM_VERIFY(nodes0, \"nodes0 has not been set!\");\n      EnableLimitingPA(*nodes0);\n   }\n}\n\nvoid TMOP_Integrator::AssembleGradientDiagonalPA(const Vector &xe,\n                                                 Vector &de) const\n{\n   MFEM_VERIFY(PA.R, \"PA extension setup has not been done!\");\n\n   if (!PA.setup_Jtr) { ComputeElementTargetsPA(xe); }\n\n   if (!PA.setup_Grad) { SetupGradPA(xe); }\n\n   if (PA.dim == 2)\n   {\n      AssembleDiagonalPA_2D(de);\n      if (coeff0) { AssembleDiagonalPA_C0_2D(de); }\n   }\n   else if (PA.dim == 3)\n   {\n      AssembleDiagonalPA_3D(de);\n      if (coeff0) { AssembleDiagonalPA_C0_3D(de); }\n   }\n   else\n   {\n      MFEM_ABORT(\"3D diagonal computation is WIP.\");\n   }\n}\n\nvoid TMOP_Integrator::AddMultPA(const Vector &xe, Vector &ye) const\n{\n   if (!PA.setup_Jtr) { ComputeElementTargetsPA(); }\n\n   if (PA.dim == 2)\n   {\n      AddMultPA_2D(xe,ye);\n      if (coeff0) { AddMultPA_C0_2D(xe,ye); }\n   }\n\n   if (PA.dim == 3)\n   {\n      AddMultPA_3D(xe,ye);\n      if (coeff0) { AddMultPA_C0_3D(xe,ye); }\n   }\n}\n\nvoid TMOP_Integrator::AddMultGradPA(const Vector &xe,\n                                    const Vector &re, Vector &ce) const\n{\n   if (!PA.setup_Jtr) { ComputeElementTargetsPA(xe); }\n\n   if (!PA.setup_Grad) { SetupGradPA(xe); }\n\n   if (PA.dim == 2)\n   {\n      AddMultGradPA_2D(re,ce);\n      if (coeff0) { AddMultGradPA_C0_2D(xe,re,ce); }\n   }\n\n   if (PA.dim == 3)\n   {\n      AddMultGradPA_3D(xe,re,ce);\n      if (coeff0) { AddMultGradPA_C0_3D(xe,re,ce); }\n   }\n}\n\ndouble TMOP_Integrator::GetGridFunctionEnergyPA(const Vector &xe) const\n{\n   double energy = 0.0;\n\n   ComputeElementTargetsPA(xe);\n\n   if (PA.dim == 2)\n   {\n      energy = GetGridFunctionEnergyPA_2D(xe);\n      if (coeff0) { energy += GetGridFunctionEnergyPA_C0_2D(xe); }\n   }\n\n   if (PA.dim == 3)\n   {\n      energy = GetGridFunctionEnergyPA_3D(xe);\n      if (coeff0) { energy += GetGridFunctionEnergyPA_C0_3D(xe); }\n   }\n\n   return energy;\n}\n\n} \/\/ namespace mfem\n<commit_msg>Move logic inside fem\/tmop_pa ComputeElementTargetsPA<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 \"tmop.hpp\"\n#include \"linearform.hpp\"\n#include \"pgridfunc.hpp\"\n#include \"tmop_tools.hpp\"\n#include \"quadinterpolator.hpp\"\n#include \"..\/general\/forall.hpp\"\n#include \"..\/linalg\/kernels.hpp\"\n\nnamespace mfem\n{\n\n\nvoid TMOP_Integrator::SetupGradPA(const Vector &xe) const\n{\n   MFEM_VERIFY(PA.R, \"PA extension setup has not been done!\");\n   PA.setup_Grad = true;\n\n   if (PA.dim == 2)\n   {\n      AssembleGradPA_2D(xe);\n      if (coeff0) { AssembleGradPA_C0_2D(xe); }\n   }\n\n   if (PA.dim == 3)\n   {\n      AssembleGradPA_3D(xe);\n      if (coeff0) { AssembleGradPA_C0_3D(xe); }\n   }\n}\n\n\/\/ We might come here w\/o knowing that PA will be used.\n\/\/ It is the case when EnableLimiting is called before the Setup => AssemblePA.\nvoid TMOP_Integrator::EnableLimitingPA(const GridFunction &n0)\n{\n   MFEM_VERIFY(PA.enabled, \"EnableLimitingPA but PA is not enabled!\");\n   const ElementDofOrdering ordering = ElementDofOrdering::LEXICOGRAPHIC;\n\n   \/\/ Nodes0\n   const FiniteElementSpace *n0_fes = n0.FESpace();\n   const Operator *n0_R = n0_fes->GetElementRestriction(ordering);\n   PA.X0.SetSize(n0_R->Height(), Device::GetMemoryType());\n   PA.X0.UseDevice(true);\n   n0_R->Mult(n0, PA.X0);\n\n   \/\/ Get the 1D maps for the distance FE space.\n   const IntegrationRule &ir = EnergyIntegrationRule(*n0_fes->GetFE(0));\n   PA.maps_lim =\n      &lim_dist->FESpace()->GetFE(0)->GetDofToQuad(ir, DofToQuad::TENSOR);\n\n   \/\/ lim_dist & lim_func checks\n   MFEM_VERIFY(lim_dist, \"No lim_dist!\")\n   const FiniteElementSpace *ld_fes = lim_dist->FESpace();\n   const Operator *ld_R = ld_fes->GetElementRestriction(ordering);\n   MFEM_VERIFY(ld_R, \"No lim_dist restriction operator found!\");\n   PA.LD.SetSize(ld_R->Height(), Device::GetMemoryType());\n   PA.LD.UseDevice(true);\n   ld_R->Mult(*lim_dist, PA.LD);\n\n   \/\/ Only TMOP_QuadraticLimiter is supported\n   MFEM_VERIFY(lim_func, \"No lim_func!\")\n   MFEM_VERIFY(dynamic_cast<TMOP_QuadraticLimiter*>(lim_func),\n               \"Only TMOP_QuadraticLimiter is supported\");\n}\n\nbool TargetConstructor::ComputeElementTargetsPA(const FiniteElementSpace *fes,\n                                                const IntegrationRule *ir,\n                                                DenseTensor &Jtr,\n                                                const Vector &xe) const\n{\n   MFEM_VERIFY(Jtr.SizeI() == Jtr.SizeJ() && Jtr.SizeI() > 1, \"\");\n   const int dim = Jtr.SizeI();\n   if (dim == 2) { return ComputeElementTargetsPA<2>(fes, ir, Jtr, xe); }\n   if (dim == 3) { return ComputeElementTargetsPA<3>(fes, ir, Jtr, xe); }\n   return false;\n}\n\nbool AnalyticAdaptTC::ComputeElementTargetsPA(const FiniteElementSpace *fes,\n                                              const IntegrationRule *ir,\n                                              DenseTensor &Jtr,\n                                              const Vector &xe) const\n{\n   return false;\n}\n\n\n\/\/ Code paths leading to ComputeElementTargets:\n\/\/ - GetElementEnergy(elfun) which is done through GetGridFunctionEnergyPA(x)\n\/\/ - AssembleElementVectorExact(elfun)\n\/\/ - AssembleElementGradExact(elfun)\n\/\/ - EnableNormalization(x) -> ComputeNormalizationEnergies(x)\n\/\/ - (AssembleElementVectorFD(elfun))\n\/\/ - (AssembleElementGradFD(elfun))\n\/\/ ============================================================================\n\/\/      - TargetConstructor():\n\/\/          - IDEAL_SHAPE_UNIT_SIZE: Wideal\n\/\/          - IDEAL_SHAPE_EQUAL_SIZE: α * Wideal\n\/\/          - IDEAL_SHAPE_GIVEN_SIZE: β * Wideal\n\/\/          - GIVEN_SHAPE_AND_SIZE:   β * Wideal\n\/\/      - AnalyticAdaptTC(elfun):\n\/\/          - GIVEN_FULL: matrix_tspec->Eval(Jtr(elfun))\n\/\/      - DiscreteAdaptTC():\n\/\/          - IDEAL_SHAPE_GIVEN_SIZE: size^{1.0\/dim} * Jtr(i)  (size)\n\/\/          - GIVEN_SHAPE_AND_SIZE:   Jtr(i) *= D_rho          (ratio)\n\/\/                                    Jtr(i) *= Q_phi          (skew)\n\/\/                                    Jtr(i) *= R_theta        (orientation)\nvoid TMOP_Integrator::ComputeElementTargetsPA(const Vector &xe) const\n{\n   PA.setup_Jtr = false;\n   const FiniteElementSpace *fes = PA.fes;\n   const IntegrationRule &ir = EnergyIntegrationRule(*fes->GetFE(0));\n   const TargetConstructor::TargetType &target_type = targetC->Type();\n\n   \/\/ Skip when TargetConstructor needs the nodes but have not been set\n   const bool tc_wn = target_type != TargetConstructor::IDEAL_SHAPE_UNIT_SIZE;\n   if (targetC && tc_wn && !targetC->GetNodes()) { return; }\n\n   \/\/ Try to use the TargetConstructor ComputeElementTargetsPA\n   PA.setup_Jtr = targetC->ComputeElementTargetsPA(fes, &ir, PA.Jtr);\n   if (PA.setup_Jtr) { return; }\n\n   \/\/ Defaulting to host version\n   PA.Jtr.HostWrite();\n\n   const int NE = PA.ne;\n   const int NQ = PA.nq;\n   const int dim = PA.dim;\n   DenseTensor &Jtr = PA.Jtr;\n\n   Vector x;\n   const bool useable_input_vector = xe.Size() > 0;\n   const bool use_input_vector = target_type == TargetConstructor::GIVEN_FULL;\n\n   if (use_input_vector && !useable_input_vector) { return; }\n\n   DiscreteAdaptTC *discr_tc = GetDiscreteAdaptTC();\n   if (discr_tc && !discr_tc->GetTspecFesv()) { return; }\n\n   if (use_input_vector)\n   {\n      x.SetSize(PA.R->Width(), Device::GetMemoryType());\n      x.UseDevice(true);\n      PA.R->MultTranspose(xe, x);\n      \/\/ Scale by weights\n      const int N = PA.W.Size();\n      const auto W = Reshape(PA.W.Read(), N);\n      auto X = Reshape(x.ReadWrite(), N);\n      MFEM_FORALL(i, N, X(i) \/= W(i););\n   }\n\n   \/\/ Use TargetConstructor::ComputeElementTargets to fill the PA.Jtr\n   Vector elfun;\n   Array<int> vdofs;\n   DenseTensor J;\n   for (int e = 0; e < NE; e++)\n   {\n      const FiniteElement &fe = *fes->GetFE(e);\n      if (use_input_vector)\n      {\n         fes->GetElementVDofs(e, vdofs);\n         x.GetSubVector(vdofs, elfun);\n      }\n      J.UseExternalData(Jtr(e*NQ).Data(), dim, dim, NQ);\n      targetC->ComputeElementTargets(e, fe, ir, elfun, J);\n   }\n   PA.setup_Jtr = true;\n}\n\nvoid TMOP_Integrator::AssemblePA(const FiniteElementSpace &fes)\n{\n   PA.enabled = true;\n   MFEM_ASSERT(fes.GetMesh()->GetNE() > 0, \"\");\n   PA.ir = &EnergyIntegrationRule(*fes.GetFE(0));\n   const IntegrationRule &ir = *PA.ir;\n   MFEM_ASSERT(fes.GetOrdering() == Ordering::byNODES,\n               \"PA Only supports Ordering::byNODES!\");\n\n   PA.fes = &fes;\n   Mesh *mesh = fes.GetMesh();\n   const int nq = PA.nq = ir.GetNPoints();\n   const int ne = PA.ne = fes.GetMesh()->GetNE();\n   const int dim = PA.dim = mesh->Dimension();\n   MFEM_VERIFY(PA.dim == 2 || PA.dim == 3, \"Not yet implemented!\");\n\n   const DofToQuad::Mode mode = DofToQuad::TENSOR;\n   PA.maps = &fes.GetFE(0)->GetDofToQuad(ir, mode);\n   PA.geom = mesh->GetGeometricFactors(ir, GeometricFactors::JACOBIANS, mode);\n\n   \/\/ Energy vector\n   PA.E.UseDevice(true);\n   PA.E.SetSize(ne*nq, Device::GetDeviceMemoryType());\n\n   \/\/ Setup initialization\n   PA.setup_Jtr = false;\n   PA.setup_Grad = false;\n\n   \/\/ H for Grad\n   PA.H.UseDevice(true);\n   PA.H.SetSize(dim*dim * dim*dim * nq*ne, Device::GetDeviceMemoryType());\n   \/\/ H0 for coeff0\n   PA.H0.UseDevice(true);\n   PA.H0.SetSize(dim * dim * nq*ne, Device::GetDeviceMemoryType());\n\n   \/\/ Restriction setup\n   const ElementDofOrdering ordering = ElementDofOrdering::LEXICOGRAPHIC;\n   PA.R = fes.GetElementRestriction(ordering);\n   MFEM_VERIFY(PA.R, \"Not yet implemented!\");\n\n   \/\/ Weight of the R^t\n   PA.W.SetSize(PA.R->Width(), Device::GetDeviceMemoryType());\n   PA.W.UseDevice(true);\n   PA.O.SetSize(dim*ne*nq, Device::GetDeviceMemoryType());\n   PA.O.UseDevice(true);\n   PA.O = 1.0;\n   PA.R->MultTranspose(PA.O, PA.W);\n\n   \/\/ Scalar vector of '1'\n   PA.O.SetSize(ne*nq, Device::GetDeviceMemoryType());\n   PA.O = 1.0;\n\n   \/\/ TargetConstructor TargetType setup\n   PA.Jtr.SetSize(dim, dim, PA.ne*PA.nq);\n   ComputeElementTargetsPA();\n\n   \/\/ Coeff0 PA.C0\n   PA.C0.UseDevice(true);\n   if (coeff0 == nullptr)\n   {\n      PA.C0.SetSize(1, Device::GetMemoryType());\n      PA.C0.HostWrite();\n      PA.C0(0) = 0.0;\n   }\n   else if (ConstantCoefficient* cQ =\n               dynamic_cast<ConstantCoefficient*>(coeff0))\n   {\n      PA.C0.SetSize(1, Device::GetMemoryType());\n      PA.C0.HostWrite();\n      PA.C0(0) = cQ->constant;\n   }\n   else\n   {\n      PA.C0.SetSize(PA.nq * PA.ne, Device::GetMemoryType());\n      auto C0 = Reshape(PA.C0.HostWrite(), PA.nq, PA.ne);\n      for (int e = 0; e < ne; ++e)\n      {\n         ElementTransformation& T = *fes.GetElementTransformation(e);\n         for (int q = 0; q < nq; ++q)\n         {\n            C0(q,e) = coeff0->Eval(T, ir.IntPoint(q));\n         }\n      }\n   }\n\n   if (coeff0)\n   {\n      MFEM_VERIFY(nodes0, \"nodes0 has not been set!\");\n      EnableLimitingPA(*nodes0);\n   }\n}\n\nvoid TMOP_Integrator::AssembleGradientDiagonalPA(const Vector &xe,\n                                                 Vector &de) const\n{\n   MFEM_VERIFY(PA.R, \"PA extension setup has not been done!\");\n\n   if (!PA.setup_Jtr) { ComputeElementTargetsPA(xe); }\n\n   if (!PA.setup_Grad) { SetupGradPA(xe); }\n\n   if (PA.dim == 2)\n   {\n      AssembleDiagonalPA_2D(de);\n      if (coeff0) { AssembleDiagonalPA_C0_2D(de); }\n   }\n   else if (PA.dim == 3)\n   {\n      AssembleDiagonalPA_3D(de);\n      if (coeff0) { AssembleDiagonalPA_C0_3D(de); }\n   }\n   else\n   {\n      MFEM_ABORT(\"3D diagonal computation is WIP.\");\n   }\n}\n\nvoid TMOP_Integrator::AddMultPA(const Vector &xe, Vector &ye) const\n{\n   if (!PA.setup_Jtr) { ComputeElementTargetsPA(); }\n\n   if (PA.dim == 2)\n   {\n      AddMultPA_2D(xe,ye);\n      if (coeff0) { AddMultPA_C0_2D(xe,ye); }\n   }\n\n   if (PA.dim == 3)\n   {\n      AddMultPA_3D(xe,ye);\n      if (coeff0) { AddMultPA_C0_3D(xe,ye); }\n   }\n}\n\nvoid TMOP_Integrator::AddMultGradPA(const Vector &xe,\n                                    const Vector &re, Vector &ce) const\n{\n   if (!PA.setup_Jtr) { ComputeElementTargetsPA(xe); }\n\n   if (!PA.setup_Grad) { SetupGradPA(xe); }\n\n   if (PA.dim == 2)\n   {\n      AddMultGradPA_2D(re,ce);\n      if (coeff0) { AddMultGradPA_C0_2D(xe,re,ce); }\n   }\n\n   if (PA.dim == 3)\n   {\n      AddMultGradPA_3D(xe,re,ce);\n      if (coeff0) { AddMultGradPA_C0_3D(xe,re,ce); }\n   }\n}\n\ndouble TMOP_Integrator::GetGridFunctionEnergyPA(const Vector &xe) const\n{\n   double energy = 0.0;\n\n   ComputeElementTargetsPA(xe);\n\n   if (PA.dim == 2)\n   {\n      energy = GetGridFunctionEnergyPA_2D(xe);\n      if (coeff0) { energy += GetGridFunctionEnergyPA_C0_2D(xe); }\n   }\n\n   if (PA.dim == 3)\n   {\n      energy = GetGridFunctionEnergyPA_3D(xe);\n      if (coeff0) { energy += GetGridFunctionEnergyPA_C0_3D(xe); }\n   }\n\n   return energy;\n}\n\n} \/\/ namespace mfem\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2015-2016, The Kovri I2P Router 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\n#include <cryptopp\/osrng.h>\n\n#include <chrono>\n#include <functional>\n#include <iostream>\n\n#include \"crypto\/Rand.h\"\n#include \"crypto\/Signature.h\"\n\ntypedef std::function<void(\n    uint8_t*,\n    uint8_t*)> KeyGenerator;\n\ntemplate<class Verifier, class Signer>\nvoid benchmark(\n    std::size_t count,\n    std::size_t public_key_size,\n    std::size_t private_key_size,\n    std::size_t signature_size,\n    KeyGenerator generator) {\n  typedef std::chrono::time_point<std::chrono::high_resolution_clock> TimePoint;\n\n  uint8_t private_key[private_key_size];\n  uint8_t public_key[public_key_size];\n  generator(private_key, public_key);\n  Verifier verifier(public_key);\n  Signer signer(private_key);\n  uint8_t message[512] = {};\n  uint8_t output[signature_size];\n  std::chrono::nanoseconds sign_duration(0);\n  std::chrono::nanoseconds verify_duration(0);\n  for (std::size_t i = 0; i < count; ++i) {\n    i2p::crypto::RandBytes(message, 512);\n    TimePoint begin1 = std::chrono::high_resolution_clock::now();\n    signer.Sign(message, 512, output);\n    TimePoint end1 = std::chrono::high_resolution_clock::now();\n    sign_duration +=\n      std::chrono::duration_cast<std::chrono::nanoseconds>(end1 - begin1);\n    TimePoint begin2 = std::chrono::high_resolution_clock::now();\n    verifier.Verify(message, 512, output);\n    TimePoint end2 = std::chrono::high_resolution_clock::now();\n    verify_duration +=\n      std::chrono::duration_cast<std::chrono::nanoseconds>(end2 - begin2);\n  }\n  std::cout << \"Conducted \" << count << \" experiments.\" << std::endl;\n  std::cout << \"Total sign time: \" <<\n    std::chrono::duration_cast<std::chrono::milliseconds>(\n        sign_duration).count() << std::endl;\n  std::cout << \"Total verify time: \" <<\n    std::chrono::duration_cast<std::chrono::milliseconds>(\n        verify_duration).count() << std::endl;\n}\n\n\nint main() {\n  \/\/ TODO(unassigned): don't use namespace using-directives\n  const size_t benchmark_count = 1000;\n  using namespace i2p::crypto;\n  std::cout << \"--------DSA---------\" << std::endl;\n  benchmark<DSAVerifier, DSASigner>(\n    benchmark_count, DSA_PUBLIC_KEY_LENGTH,\n    DSA_PRIVATE_KEY_LENGTH, DSA_SIGNATURE_LENGTH,\n    &CreateDSARandomKeys);\n  std::cout << \"-----ECDSAP256------\" << std::endl;\n  benchmark<ECDSAP256Verifier, ECDSAP256Signer>(\n    benchmark_count, ECDSAP256_KEY_LENGTH,\n    ECDSAP256_KEY_LENGTH, 64,\n    &CreateECDSAP256RandomKeys);\n  std::cout << \"-----ECDSAP384------\" << std::endl;\n  benchmark<ECDSAP384Verifier, ECDSAP384Signer>(\n    benchmark_count, ECDSAP384_KEY_LENGTH,\n    ECDSAP384_KEY_LENGTH, 64,\n    &CreateECDSAP384RandomKeys);\n  std::cout << \"-----ECDSAP521------\" << std::endl;\n  benchmark<ECDSAP521Verifier, ECDSAP521Signer>(\n    benchmark_count, ECDSAP521_KEY_LENGTH,\n    ECDSAP521_KEY_LENGTH, 64,\n    &CreateECDSAP521RandomKeys);\n  std::cout << \"-----EDDSA25519-----\" << std::endl;\n  benchmark<EDDSA25519Verifier, EDDSA25519Signer>(\n    benchmark_count, EDDSA25519_PUBLIC_KEY_LENGTH,\n    EDDSA25519_PRIVATE_KEY_LENGTH, 64,\n    &CreateEDDSARandomKeys);\n}\n<commit_msg>* use function pointers and NOT std::function in benchmarks as doing so crashes benchmarks occasionally<commit_after>\/**\n * Copyright (c) 2015-2016, The Kovri I2P Router 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\n#include <cryptopp\/osrng.h>\n\n#include <chrono>\n#include <iostream>\n\n#include \"crypto\/Rand.h\"\n#include \"crypto\/Signature.h\"\n\ntypedef void (*KeyGenerator)(uint8_t*,uint8_t*) ;\n\ntemplate<class Verifier, class Signer>\nvoid benchmark(\n    std::size_t count,\n    std::size_t public_key_size,\n    std::size_t private_key_size,\n    std::size_t signature_size,\n    KeyGenerator generator) {\n  typedef std::chrono::time_point<std::chrono::high_resolution_clock> TimePoint;\n\n  uint8_t private_key[private_key_size];\n  uint8_t public_key[public_key_size];\n  generator(private_key, public_key);\n  Verifier verifier(public_key);\n  Signer signer(private_key);\n  uint8_t message[512] = {};\n  uint8_t output[signature_size];\n  std::chrono::nanoseconds sign_duration(0);\n  std::chrono::nanoseconds verify_duration(0);\n  for (std::size_t i = 0; i < count; ++i) {\n    i2p::crypto::RandBytes(message, 512);\n    TimePoint begin1 = std::chrono::high_resolution_clock::now();\n    signer.Sign(message, 512, output);\n    TimePoint end1 = std::chrono::high_resolution_clock::now();\n    sign_duration +=\n      std::chrono::duration_cast<std::chrono::nanoseconds>(end1 - begin1);\n    TimePoint begin2 = std::chrono::high_resolution_clock::now();\n    verifier.Verify(message, 512, output);\n    TimePoint end2 = std::chrono::high_resolution_clock::now();\n    verify_duration +=\n      std::chrono::duration_cast<std::chrono::nanoseconds>(end2 - begin2);\n  }\n  std::cout << \"Conducted \" << count << \" experiments.\" << std::endl;\n  std::cout << \"Total sign time: \" <<\n    std::chrono::duration_cast<std::chrono::milliseconds>(\n        sign_duration).count() << std::endl;\n  std::cout << \"Total verify time: \" <<\n    std::chrono::duration_cast<std::chrono::milliseconds>(\n        verify_duration).count() << std::endl;\n}\n\n\nint main() {\n  \/\/ TODO(unassigned): don't use namespace using-directives\n  const size_t benchmark_count = 1000;\n  using namespace i2p::crypto;\n  std::cout << \"--------DSA---------\" << std::endl;\n  benchmark<DSAVerifier, DSASigner>(\n    benchmark_count, DSA_PUBLIC_KEY_LENGTH,\n    DSA_PRIVATE_KEY_LENGTH, DSA_SIGNATURE_LENGTH,\n    CreateDSARandomKeys);\n  std::cout << \"-----ECDSAP256------\" << std::endl;\n  benchmark<ECDSAP256Verifier, ECDSAP256Signer>(\n    benchmark_count, ECDSAP256_KEY_LENGTH,\n    ECDSAP256_KEY_LENGTH, 64,\n    CreateECDSAP256RandomKeys);\n  std::cout << \"-----ECDSAP384------\" << std::endl;\n  benchmark<ECDSAP384Verifier, ECDSAP384Signer>(\n    benchmark_count, ECDSAP384_KEY_LENGTH,\n    ECDSAP384_KEY_LENGTH, 64,\n    CreateECDSAP384RandomKeys);\n  std::cout << \"-----ECDSAP521------\" << std::endl;\n  benchmark<ECDSAP521Verifier, ECDSAP521Signer>(\n    benchmark_count, ECDSAP521_KEY_LENGTH,\n    ECDSAP521_KEY_LENGTH, 64,\n    CreateECDSAP521RandomKeys);\n  std::cout << \"-----EDDSA25519-----\" << std::endl;\n  benchmark<EDDSA25519Verifier, EDDSA25519Signer>(\n    benchmark_count, EDDSA25519_PUBLIC_KEY_LENGTH,\n    EDDSA25519_PRIVATE_KEY_LENGTH, 64,\n    CreateEDDSARandomKeys);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"acmacs-base\/layout.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nstd::pair<std::vector<size_t>, std::vector<size_t>> acmacs::Layout::min_max_point_indexes() const\n{\n    const auto num_dim = number_of_dimensions();\n    std::vector<size_t> min_points(*num_dim, 0), max_points(*num_dim, 0);\n    size_t point_no = 0;\n    for (; !operator[](point_no).exists(); ++point_no); \/\/ skip NaN points at the beginning\n    PointCoordinates min_coordinates(operator[](point_no));\n    PointCoordinates max_coordinates(min_coordinates);\n    ++point_no;\n    for (; point_no < number_of_points(); ++point_no) {\n        const auto point = operator[](point_no);\n        if (point.exists()) {\n            for (auto dim : range(num_dim)) {\n                if (point[dim] < min_coordinates[dim]) {\n                    min_coordinates[dim] = point[dim];\n                    min_points[*dim] = point_no;\n                }\n                if (point[dim] > max_coordinates[dim]) {\n                    max_coordinates[dim] = point[dim];\n                    max_points[*dim] = point_no;\n                }\n            }\n        }\n    }\n    return {min_points, max_points};\n\n} \/\/ acmacs::Layout::min_max_point_indexes\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::Area acmacs::Layout::area() const\n{\n    size_t point_no = 0;\n    for (; !operator[](point_no).exists(); ++point_no); \/\/ skip NaN points at the beginning\n    Area result(operator[](point_no));\n    ++point_no;\n    for (; point_no < number_of_points(); ++point_no) {\n        if (const auto point = operator[](point_no); point.exists())\n            result.extend(point);\n    }\n    return result;\n\n} \/\/ acmacs::Layout::boundaries\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::Area acmacs::Layout::area(const std::vector<size_t>& points) const \/\/ just for the specified point indexes\n{\n    Area result(operator[](points.front()));\n    for (auto point_no : points) {\n        if (const auto point = operator[](point_no); point.exists())\n            result.extend(point);\n    }\n    return result;\n\n} \/\/ acmacs::Layout::boundaries\n\n\/\/ ----------------------------------------------------------------------\n\nstd::shared_ptr<acmacs::Layout> acmacs::Layout::transform(const acmacs::Transformation& aTransformation) const\n{\n    auto result = std::make_shared<acmacs::Layout>(number_of_points(), number_of_dimensions());\n    for (size_t p_no = 0; p_no < number_of_points(); ++p_no)\n        (*result)[p_no] = aTransformation.transform(get(p_no));\n    return result;\n\n} \/\/ acmacs::Layout::transform\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::PointCoordinates acmacs::Layout::centroid() const\n{\n    PointCoordinates result(*number_of_dimensions(), 0.0);\n    size_t num_non_nan = number_of_points();\n    for (size_t p_no = 0; p_no < number_of_points(); ++p_no) {\n        if (const auto coord = get(p_no); coord.exists())\n            result += coord;\n        else\n            --num_non_nan;\n    }\n    result \/= num_non_nan;\n    return result;\n\n} \/\/ acmacs::Layout::centroid\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::Layout::Layout(const Layout& source, const std::vector<size_t>& indexes)\n    : Vec(indexes.size() * source.number_of_dimensions().get(), std::numeric_limits<double>::quiet_NaN()), number_of_dimensions_{source.number_of_dimensions()}\n{\n    auto target = Vec::begin();\n    for (auto index : indexes) {\n        const auto coord{source[index]};\n        std::copy(coord.begin(), coord.end(), target);\n        target += static_cast<decltype(target)::difference_type>(*number_of_dimensions_);\n    }\n\n} \/\/ acmacs::Layout::Layout\n\n\/\/ ----------------------------------------------------------------------\n\nstd::vector<std::pair<double, double>> acmacs::Layout::minmax() const\n{\n    std::vector<std::pair<double, double>> result(*number_of_dimensions_);\n    \/\/ using diff_t = decltype(result)::difference_type;\n    \/\/ Layout may contain NaNs (disconnected points), avoid them when finding minmax\n    auto it = Vec::begin();\n    while (it != Vec::end()) {\n        number_of_dimensions_t valid_dims{0};\n        for (auto dim : range(number_of_dimensions_)) {\n            if (!std::isnan(*it)) {\n                result[*dim] = std::pair(*it, *it);\n                ++valid_dims;\n            }\n            ++it;\n        }\n        if (valid_dims == number_of_dimensions_)\n            break;\n    }\n    while (it != Vec::end()) {\n        for (auto dim : range(number_of_dimensions_)) {\n            if (!std::isnan(*it)) {\n                result[*dim].first = std::min(result[*dim].first, *it);\n                result[*dim].second = std::max(result[*dim].second, *it);\n            }\n            ++it;\n        }\n    }\n    return result;\n\n} \/\/ acmacs::Layout::minmax\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>Layout interface improvements<commit_after>#include \"acmacs-base\/layout.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nstd::pair<std::vector<size_t>, std::vector<size_t>> acmacs::Layout::min_max_point_indexes() const\n{\n    const auto num_dim = number_of_dimensions();\n    std::vector<size_t> min_points(*num_dim, 0), max_points(*num_dim, 0);\n    size_t point_no = 0;\n    for (; !operator[](point_no).exists(); ++point_no); \/\/ skip NaN points at the beginning\n    PointCoordinates min_coordinates(operator[](point_no));\n    PointCoordinates max_coordinates(min_coordinates);\n    ++point_no;\n    for (; point_no < number_of_points(); ++point_no) {\n        const auto point = operator[](point_no);\n        if (point.exists()) {\n            for (auto dim : range(num_dim)) {\n                if (point[dim] < min_coordinates[dim]) {\n                    min_coordinates[dim] = point[dim];\n                    min_points[*dim] = point_no;\n                }\n                if (point[dim] > max_coordinates[dim]) {\n                    max_coordinates[dim] = point[dim];\n                    max_points[*dim] = point_no;\n                }\n            }\n        }\n    }\n    return {min_points, max_points};\n\n} \/\/ acmacs::Layout::min_max_point_indexes\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::Area acmacs::Layout::area() const\n{\n    size_t point_no = 0;\n    for (; !operator[](point_no).exists(); ++point_no); \/\/ skip NaN points at the beginning\n    Area result(operator[](point_no));\n    ++point_no;\n    for (; point_no < number_of_points(); ++point_no) {\n        if (const auto point = operator[](point_no); point.exists())\n            result.extend(point);\n    }\n    return result;\n\n} \/\/ acmacs::Layout::boundaries\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::Area acmacs::Layout::area(const std::vector<size_t>& points) const \/\/ just for the specified point indexes\n{\n    Area result(operator[](points.front()));\n    for (auto point_no : points) {\n        if (const auto point = operator[](point_no); point.exists())\n            result.extend(point);\n    }\n    return result;\n\n} \/\/ acmacs::Layout::boundaries\n\n\/\/ ----------------------------------------------------------------------\n\nstd::shared_ptr<acmacs::Layout> acmacs::Layout::transform(const acmacs::Transformation& aTransformation) const\n{\n    auto result = std::make_shared<acmacs::Layout>(number_of_points(), number_of_dimensions());\n    for (size_t p_no = 0; p_no < number_of_points(); ++p_no)\n        (*result)[p_no] = aTransformation.transform(at(p_no));\n    return result;\n\n} \/\/ acmacs::Layout::transform\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::PointCoordinates acmacs::Layout::centroid() const\n{\n    PointCoordinates result(*number_of_dimensions(), 0.0);\n    size_t num_non_nan = number_of_points();\n    for (size_t p_no = 0; p_no < number_of_points(); ++p_no) {\n        if (const auto coord = at(p_no); coord.exists())\n            result += coord;\n        else\n            --num_non_nan;\n    }\n    result \/= num_non_nan;\n    return result;\n\n} \/\/ acmacs::Layout::centroid\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::Layout::Layout(const Layout& source, const std::vector<size_t>& indexes)\n    : Vec(indexes.size() * source.number_of_dimensions().get(), std::numeric_limits<double>::quiet_NaN()), number_of_dimensions_{source.number_of_dimensions()}\n{\n    auto target = Vec::begin();\n    for (auto index : indexes) {\n        const auto coord{source[index]};\n        std::copy(coord.begin(), coord.end(), target);\n        target += static_cast<decltype(target)::difference_type>(*number_of_dimensions_);\n    }\n\n} \/\/ acmacs::Layout::Layout\n\n\/\/ ----------------------------------------------------------------------\n\nstd::vector<std::pair<double, double>> acmacs::Layout::minmax() const\n{\n    std::vector<std::pair<double, double>> result(*number_of_dimensions_);\n    \/\/ using diff_t = decltype(result)::difference_type;\n    \/\/ Layout may contain NaNs (disconnected points), avoid them when finding minmax\n    auto it = Vec::begin();\n    while (it != Vec::end()) {\n        number_of_dimensions_t valid_dims{0};\n        for (auto dim : range(number_of_dimensions_)) {\n            if (!std::isnan(*it)) {\n                result[*dim] = std::pair(*it, *it);\n                ++valid_dims;\n            }\n            ++it;\n        }\n        if (valid_dims == number_of_dimensions_)\n            break;\n    }\n    while (it != Vec::end()) {\n        for (auto dim : range(number_of_dimensions_)) {\n            if (!std::isnan(*it)) {\n                result[*dim].first = std::min(result[*dim].first, *it);\n                result[*dim].second = std::max(result[*dim].second, *it);\n            }\n            ++it;\n        }\n    }\n    return result;\n\n} \/\/ acmacs::Layout::minmax\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>#include <ncurses.h>\n\n#include \"display\/Interface.h\"\n\nInterface::Interface() : _next_window(0)\n{\n\t\/\/Initialized the screen\n\tinitscr();\n\t\/\/Start with a clean slate\n\tclear();\n\t\/\/Don't echo entered characters on the screen\n\tnoecho();\n\t\/\/Enable getting function keys\n\tkeypad(stdscr, true);\n\n\t\/\/Hide the cursor\n\tcurs_set(false);\n\n\t\/\/And finally start everything up\n\trefresh();\n\n\t\/\/Now store our initial screen size\n\t_current_screen_size = getScreenSize();\n}\n\nInterface::~Interface()\n{\n\t\/\/Close all Windows\n\tcloseWindows();\n\n\tendwin();\n}\n\nWindow Interface::addWindow(WindowGeometry geometry)\n{\n\t\/\/Just a basic window, no need to do anything fancy here\n\tWindowMeta window = newWindowMeta(geometry);\n\topenWindow(window);\n\n\t\/\/Now store the window on our \"stack\"\n\t_windows.push_back(window);\n\n\treturn window.id;\n}\n\nWindow Interface::addWindow(WindowGeometry window, WindowGeometry viewport)\n{\n\t\/\/First create the parent Window\n\tWindowMeta parent = newWindowMeta(window);\n\tparent.visible = false;\n\topenWindow(parent);\n\n\t\/\/Now store the window on our \"stack\"\n\t_windows.push_back(parent);\n\n\t\/\/Now create the subwindow\/viewport\n\tWindowMeta view = newWindowMeta(viewport);\n\tview.parent = parent.id;\n\topenWindow(view);\n\n\t\/\/Now store the window on our \"stack\"\n\t_windows.push_back(view);\n\n\treturn view.id;\n}\n\nWindow Interface::addWindow(Level& level, WindowGeometry viewport)\n{\n\t\/\/First create the geometry for our parent Window\n\tWindowGeometry window = { {0,0}, {level.getWidth(), level.getHeight()} };\n\t\/\/Now add our Windows\n\tWindow view_win = addWindow(window, viewport);\n\n\t\/\/Now we need to update the parent with its Level\n\tWindowMeta view_meta = getWindowMeta(view_win);\n\tint level_idx = getWindowIndex(view_meta.parent);\n\t_windows[level_idx].level = &level;\n\n\treturn view_win;\n}\n\nWindow Interface::getWindowParent(Window win)\n{\n\treturn getWindowMeta(win).parent;\n}\n\nvoid Interface::add(Window win, XYPair pos, char c)\n{\n\tWindowMeta win_m = getWindowMeta(win);\n\n\tif(NULL == win_m.win)\n\t{\n\t\t\/\/This Window doesn't exist\n\t\treturn;\n\t}\n\n\tXYPair size = calculateSize(win_m.geometry);\n\n\tif(pos.x < size.x && pos.y < size.y)\n\t{\n\t\tmvwaddch((WINDOW*)win_m.win, pos.y, pos.x, c);\n\t}\n}\n\nvoid Interface::add(Window win, XYPair pos, std::string str)\n{\n\tWindowMeta win_m = getWindowMeta(win);\n\n\tif(NULL == win_m.win)\n\t{\n\t\t\/\/This Window doesn't exist\n\t\treturn;\n\t}\n\n\tXYPair size = calculateSize(win_m.geometry);\n\n\tif(pos.x < size.x && pos.y < size.y)\n\t{\n\t\tmvwprintw((WINDOW*)win_m.win, pos.y, pos.x, str.c_str());\n\t}\n}\n\nvoid Interface::refresh()\n{\n\t\/\/Check screen size against what we've last drawn for\n\tXYPair screen = getScreenSize();\n\tif(screen.x != _current_screen_size.x || screen.y != _current_screen_size.y)\n\t{\n\t\t\/\/Screen size has changed, redraw our Windows\n\t\tredraw();\n\t\t\/\/And update our screen size\n\t\t_current_screen_size = screen;\n\t}\n\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(_windows[i].visible && NULL != _windows[i].win)\n\t\t{\n\t\t\twrefresh((WINDOW*)_windows[i].win);\n\t\t}\n\t}\n}\n\nvoid Interface::redraw()\n{\n\t\/\/Close and re-open all non-sub-Windows\n\t\/\/Need to make sure we've taken care of all the parents first, so we skip\n\t\/\/sub-Windows for now\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(NULL != _windows[i].win && _windows[i].parent == _windows[i].id)\n\t\t{\n\t\t\t\/\/This is not a sub-window, close and re-open it\n\t\t\tcloseWindow(_windows[i].id);\n\t\t\topenWindow(_windows[i]);\n\t\t}\n\t}\n\n\t\/\/Now we have to go back through and do the same for child Windows\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(NULL != _windows[i].win && _windows[i].parent != _windows[i].id)\n\t\t{\n\t\t\t\/\/This is a sub-window, close and re-open it\n\t\t\tcloseWindow(_windows[i].id);\n\t\t\topenWindow(_windows[i]);\n\t\t}\n\t}\n}\n\nvoid Interface::loadLevel(Window win)\n{\n\tWindowMeta window = getWindowMeta(win);\n\n\tif(NULL != window.level)\n\t{\n\t\tXYPair tile_pos = { 0, 0 };\n\t\tfor(int x = 0; x < window.level->getWidth(); x++)\n\t\t{\n\t\t\ttile_pos.x = x;\n\t\t\tfor(int y = 0; y < window.level->getHeight(); y++)\n\t\t\t{\n\t\t\t\ttile_pos.y = y;\n\t\t\t\tadd(win, tile_pos, window.level->getTile(x, y).getDisplay());\n\t\t\t}\n\t\t}\n\t} else if(window.parent != window.id) {\n\t\tloadLevel(window.parent);\n\t}\n}\n\nvoid Interface::loadLevels()\n{\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(NULL != _windows[i].level)\n\t\t{\n\t\t\tloadLevel(_windows[i].id);\n\t\t}\n\t}\n}\n\nXYPair Interface::getScreenSize()\n{\n\tXYPair screen;\n\tgetmaxyx(stdscr, screen.y, screen.x);\n\n\treturn screen;\n}\n\nvoid Interface::pause()\n{\n\t\/\/Save current tty modes\n\tdef_prog_mode();\n\t\/\/End ncurses mode\n\tendwin();\n}\n\nvoid Interface::resume()\n{\n\t\/\/Return to previous mode\n\treset_prog_mode();\n\t\/\/Refresh the screen to restore contents\n\trefresh();\n}\n\nXYPair Interface::calculateSize(WindowGeometry geometry)\n{\n\tXYPair size = geometry.size;\n\n\tXYPair screen = getScreenSize();\n\n\tif(size.x == AUTO_SIZE)\n\t{\n\t\t\/\/Fit the Window to the screen's width\n\t\tsize.x = screen.x - geometry.pos.x;\n\t}\n\tif(size.y == AUTO_SIZE)\n\t{\n\t\t\/\/Fit the Window to the screen's height\n\t\tsize.y = screen.y - geometry.pos.y;\n\t}\n\n\treturn size;\n}\n\nInterface::WindowMeta Interface::newWindowMeta(WindowGeometry geometry)\n{\n\tWindowMeta meta;\n\n\tmeta.id = _next_window++; \/\/Post-increment returns the \"old\" value first\n\tmeta.parent = meta.id; \/\/Not making a viewport here\n\tmeta.geometry = geometry;\n\tmeta.visible = true;\n\n\treturn meta;\n}\n\nvoid Interface::openWindow(Interface::WindowMeta& window)\n{\n\tXYPair size = calculateSize(window.geometry);\n\n\tif(window.parent == window.id)\n\t{\n\t\twindow.win = newwin(size.y, size.x, window.geometry.pos.y, window.geometry.pos.x);\n\t} else {\n\t\t\/\/Creating a sub-window; first get our parent\n\t\tWindowMeta parent = getWindowMeta(window.parent);\n\t\twindow.win = subwin((WINDOW*)parent.win, size.y, size.x,\n\t\t\twindow.geometry.pos.y, window.geometry.pos.x);\n\t}\n}\n\nvoid Interface::closeWindow(Window win)\n{\n\tint win_idx = getWindowIndex(win);\n\n\tif(NO_WIN == win_idx)\n\t{\n\t\t\/\/No Window to close\n\t\treturn;\n\t}\n\n\tif(_windows[win_idx].id != _windows[win_idx].parent)\n\t{\n\t\t\/\/Close parent Window first\n\t\tcloseWindow(_windows[win_idx].parent);\n\t}\n\n\tif(NULL != _windows[win_idx].win)\n\t{\n\t\t\/\/Close this Window\n\t\tdelwin((WINDOW*)_windows[win_idx].win);\n\t\t_windows[win_idx].win = NULL;\n\t}\n}\n\nvoid Interface::closeWindows()\n{\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tcloseWindow(_windows[i].id);\n\t}\n}\n\nint Interface::getWindowIndex(Window win)\n{\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(_windows[i].id == win)\n\t\t{\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn NO_WIN;\n}\n\nInterface::WindowMeta Interface::getWindowMeta(Window win)\n{\n\tint idx = getWindowIndex(win);\n\n\tif(0 <= idx)\n\t{\n\t\treturn _windows[idx];\n\t} else {\n\t\t\/\/Didn't find the Window, return a dummy one instead.\n\t\tWindowMeta meta = { NULL, win, FULLSCREEN_WINDOW, false, win, NULL };\n\t\treturn meta;\n\t}\n}\n\n<commit_msg>Store screen size on startup to avoid unnecessary redraws<commit_after>#include <ncurses.h>\n\n#include \"display\/Interface.h\"\n\nInterface::Interface() : _next_window(0)\n{\n\t\/\/Initialized the screen\n\tinitscr();\n\t\/\/Start with a clean slate\n\tclear();\n\t\/\/Don't echo entered characters on the screen\n\tnoecho();\n\t\/\/Enable getting function keys\n\tkeypad(stdscr, true);\n\n\t\/\/Hide the cursor\n\tcurs_set(false);\n\n\t\/\/Now store our initial screen size\n\t_current_screen_size = getScreenSize();\n\n\t\/\/And finally start everything up\n\trefresh();\n}\n\nInterface::~Interface()\n{\n\t\/\/Close all Windows\n\tcloseWindows();\n\n\tendwin();\n}\n\nWindow Interface::addWindow(WindowGeometry geometry)\n{\n\t\/\/Just a basic window, no need to do anything fancy here\n\tWindowMeta window = newWindowMeta(geometry);\n\topenWindow(window);\n\n\t\/\/Now store the window on our \"stack\"\n\t_windows.push_back(window);\n\n\treturn window.id;\n}\n\nWindow Interface::addWindow(WindowGeometry window, WindowGeometry viewport)\n{\n\t\/\/First create the parent Window\n\tWindowMeta parent = newWindowMeta(window);\n\tparent.visible = false;\n\topenWindow(parent);\n\n\t\/\/Now store the window on our \"stack\"\n\t_windows.push_back(parent);\n\n\t\/\/Now create the subwindow\/viewport\n\tWindowMeta view = newWindowMeta(viewport);\n\tview.parent = parent.id;\n\topenWindow(view);\n\n\t\/\/Now store the window on our \"stack\"\n\t_windows.push_back(view);\n\n\treturn view.id;\n}\n\nWindow Interface::addWindow(Level& level, WindowGeometry viewport)\n{\n\t\/\/First create the geometry for our parent Window\n\tWindowGeometry window = { {0,0}, {level.getWidth(), level.getHeight()} };\n\t\/\/Now add our Windows\n\tWindow view_win = addWindow(window, viewport);\n\n\t\/\/Now we need to update the parent with its Level\n\tWindowMeta view_meta = getWindowMeta(view_win);\n\tint level_idx = getWindowIndex(view_meta.parent);\n\t_windows[level_idx].level = &level;\n\n\treturn view_win;\n}\n\nWindow Interface::getWindowParent(Window win)\n{\n\treturn getWindowMeta(win).parent;\n}\n\nvoid Interface::add(Window win, XYPair pos, char c)\n{\n\tWindowMeta win_m = getWindowMeta(win);\n\n\tif(NULL == win_m.win)\n\t{\n\t\t\/\/This Window doesn't exist\n\t\treturn;\n\t}\n\n\tXYPair size = calculateSize(win_m.geometry);\n\n\tif(pos.x < size.x && pos.y < size.y)\n\t{\n\t\tmvwaddch((WINDOW*)win_m.win, pos.y, pos.x, c);\n\t}\n}\n\nvoid Interface::add(Window win, XYPair pos, std::string str)\n{\n\tWindowMeta win_m = getWindowMeta(win);\n\n\tif(NULL == win_m.win)\n\t{\n\t\t\/\/This Window doesn't exist\n\t\treturn;\n\t}\n\n\tXYPair size = calculateSize(win_m.geometry);\n\n\tif(pos.x < size.x && pos.y < size.y)\n\t{\n\t\tmvwprintw((WINDOW*)win_m.win, pos.y, pos.x, str.c_str());\n\t}\n}\n\nvoid Interface::refresh()\n{\n\t\/\/Check screen size against what we've last drawn for\n\tXYPair screen = getScreenSize();\n\tif(screen.x != _current_screen_size.x || screen.y != _current_screen_size.y)\n\t{\n\t\t\/\/Screen size has changed, redraw our Windows\n\t\tredraw();\n\t\t\/\/And update our screen size\n\t\t_current_screen_size = screen;\n\t}\n\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(_windows[i].visible && NULL != _windows[i].win)\n\t\t{\n\t\t\twrefresh((WINDOW*)_windows[i].win);\n\t\t}\n\t}\n}\n\nvoid Interface::redraw()\n{\n\t\/\/Close and re-open all non-sub-Windows\n\t\/\/Need to make sure we've taken care of all the parents first, so we skip\n\t\/\/sub-Windows for now\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(NULL != _windows[i].win && _windows[i].parent == _windows[i].id)\n\t\t{\n\t\t\t\/\/This is not a sub-window, close and re-open it\n\t\t\tcloseWindow(_windows[i].id);\n\t\t\topenWindow(_windows[i]);\n\t\t}\n\t}\n\n\t\/\/Now we have to go back through and do the same for child Windows\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(NULL != _windows[i].win && _windows[i].parent != _windows[i].id)\n\t\t{\n\t\t\t\/\/This is a sub-window, close and re-open it\n\t\t\tcloseWindow(_windows[i].id);\n\t\t\topenWindow(_windows[i]);\n\t\t}\n\t}\n}\n\nvoid Interface::loadLevel(Window win)\n{\n\tWindowMeta window = getWindowMeta(win);\n\n\tif(NULL != window.level)\n\t{\n\t\tXYPair tile_pos = { 0, 0 };\n\t\tfor(int x = 0; x < window.level->getWidth(); x++)\n\t\t{\n\t\t\ttile_pos.x = x;\n\t\t\tfor(int y = 0; y < window.level->getHeight(); y++)\n\t\t\t{\n\t\t\t\ttile_pos.y = y;\n\t\t\t\tadd(win, tile_pos, window.level->getTile(x, y).getDisplay());\n\t\t\t}\n\t\t}\n\t} else if(window.parent != window.id) {\n\t\tloadLevel(window.parent);\n\t}\n}\n\nvoid Interface::loadLevels()\n{\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(NULL != _windows[i].level)\n\t\t{\n\t\t\tloadLevel(_windows[i].id);\n\t\t}\n\t}\n}\n\nXYPair Interface::getScreenSize()\n{\n\tXYPair screen;\n\tgetmaxyx(stdscr, screen.y, screen.x);\n\n\treturn screen;\n}\n\nvoid Interface::pause()\n{\n\t\/\/Save current tty modes\n\tdef_prog_mode();\n\t\/\/End ncurses mode\n\tendwin();\n}\n\nvoid Interface::resume()\n{\n\t\/\/Return to previous mode\n\treset_prog_mode();\n\t\/\/Refresh the screen to restore contents\n\trefresh();\n}\n\nXYPair Interface::calculateSize(WindowGeometry geometry)\n{\n\tXYPair size = geometry.size;\n\n\tXYPair screen = getScreenSize();\n\n\tif(size.x == AUTO_SIZE)\n\t{\n\t\t\/\/Fit the Window to the screen's width\n\t\tsize.x = screen.x - geometry.pos.x;\n\t}\n\tif(size.y == AUTO_SIZE)\n\t{\n\t\t\/\/Fit the Window to the screen's height\n\t\tsize.y = screen.y - geometry.pos.y;\n\t}\n\n\treturn size;\n}\n\nInterface::WindowMeta Interface::newWindowMeta(WindowGeometry geometry)\n{\n\tWindowMeta meta;\n\n\tmeta.id = _next_window++; \/\/Post-increment returns the \"old\" value first\n\tmeta.parent = meta.id; \/\/Not making a viewport here\n\tmeta.geometry = geometry;\n\tmeta.visible = true;\n\n\treturn meta;\n}\n\nvoid Interface::openWindow(Interface::WindowMeta& window)\n{\n\tXYPair size = calculateSize(window.geometry);\n\n\tif(window.parent == window.id)\n\t{\n\t\twindow.win = newwin(size.y, size.x, window.geometry.pos.y, window.geometry.pos.x);\n\t} else {\n\t\t\/\/Creating a sub-window; first get our parent\n\t\tWindowMeta parent = getWindowMeta(window.parent);\n\t\twindow.win = subwin((WINDOW*)parent.win, size.y, size.x,\n\t\t\twindow.geometry.pos.y, window.geometry.pos.x);\n\t}\n}\n\nvoid Interface::closeWindow(Window win)\n{\n\tint win_idx = getWindowIndex(win);\n\n\tif(NO_WIN == win_idx)\n\t{\n\t\t\/\/No Window to close\n\t\treturn;\n\t}\n\n\tif(_windows[win_idx].id != _windows[win_idx].parent)\n\t{\n\t\t\/\/Close parent Window first\n\t\tcloseWindow(_windows[win_idx].parent);\n\t}\n\n\tif(NULL != _windows[win_idx].win)\n\t{\n\t\t\/\/Close this Window\n\t\tdelwin((WINDOW*)_windows[win_idx].win);\n\t\t_windows[win_idx].win = NULL;\n\t}\n}\n\nvoid Interface::closeWindows()\n{\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tcloseWindow(_windows[i].id);\n\t}\n}\n\nint Interface::getWindowIndex(Window win)\n{\n\tfor(std::vector<WindowMeta>::size_type i = 0; i < _windows.size(); ++i)\n\t{\n\t\tif(_windows[i].id == win)\n\t\t{\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn NO_WIN;\n}\n\nInterface::WindowMeta Interface::getWindowMeta(Window win)\n{\n\tint idx = getWindowIndex(win);\n\n\tif(0 <= idx)\n\t{\n\t\treturn _windows[idx];\n\t} else {\n\t\t\/\/Didn't find the Window, return a dummy one instead.\n\t\tWindowMeta meta = { NULL, win, FULLSCREEN_WINDOW, false, win, NULL };\n\t\treturn meta;\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  soundpicker.cpp  -  widget to select a sound file or a beep\n *  Program:  kalarm\n *  Copyright (C) 2002, 2004, 2005 by David Jarvie <software@astrojar.org.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 \"kalarm.h\"\n\n#include <qlayout.h>\n#include <qregexp.h>\n#include <qtooltip.h>\n#include <qtimer.h>\n#include <qhbox.h>\n#include <qwhatsthis.h>\n\n#include <kglobal.h>\n#include <klocale.h>\n#include <kfiledialog.h>\n#include <kstandarddirs.h>\n#include <kiconloader.h>\n#ifndef WITHOUT_ARTS\n#include <arts\/kplayobjectfactory.h>\n#endif\n#include <kdebug.h>\n\n#include \"buttongroup.h\"\n#include \"checkbox.h\"\n#include \"functions.h\"\n#include \"kalarmapp.h\"\n#include \"pushbutton.h\"\n#include \"radiobutton.h\"\n#include \"sounddlg.h\"\n#include \"soundpicker.moc\"\n\n\n\/\/ Collect these widget labels together to ensure consistent wording and\n\/\/ translations across different modules.\nQString SoundPicker::i18n_Sound()       { return i18n(\"An audio sound\", \"Sound\"); }\nQString SoundPicker::i18n_s_Sound()     { return i18n(\"An audio sound\", \"&Sound\"); }\nQString SoundPicker::i18n_Beep()        { return i18n(\"Beep\"); }\nQString SoundPicker::i18n_b_Beep()      { return i18n(\"&Beep\"); }\nQString SoundPicker::i18n_Speak()       { return i18n(\"Speak\"); }\nQString SoundPicker::i18n_p_Speak()     { return i18n(\"S&peak\"); }\nQString SoundPicker::i18n_File()        { return i18n(\"File\"); }\n\n\nSoundPicker::SoundPicker(QWidget* parent, const char* name)\n\t: QFrame(parent, name),\n\t  mRevertType(false)\n{\n\t\/\/ Sound checkbox\n\tsetFrameStyle(QFrame::NoFrame);\n\tQHBoxLayout* soundLayout = new QHBoxLayout(this, 0, 2*KDialog::spacingHint());\n\tsoundLayout->setAlignment(Qt::AlignVCenter);\n\tmCheckbox = new CheckBox(i18n_s_Sound(), this);\n\tmCheckbox->setFixedSize(mCheckbox->sizeHint());\n\tconnect(mCheckbox, SIGNAL(toggled(bool)), SLOT(slotSoundToggled(bool)));\n\tQWhatsThis::add(mCheckbox,\n\t      i18n(\"Check to enable sound when the message is displayed. Select the type of sound from the displayed options.\"));\n\tsoundLayout->addWidget(mCheckbox);\n\n\t\/\/ Sound type\n\tmTypeGroup = new ButtonGroup(this);\n\tmTypeGroup->hide();\n\tconnect(mTypeGroup, SIGNAL(buttonSet(int)), SLOT(slotTypeChanged(int)));\n\n\t\/\/ Beep radio button\n\tmBeepRadio = new RadioButton(i18n_Beep(), this, \"beepButton\");\n\tmBeepRadio->setFixedSize(mBeepRadio->sizeHint());\n\tQWhatsThis::add(mBeepRadio, i18n(\"If checked, a beep will sound when the alarm is displayed.\"));\n\tmTypeGroup->insert(mBeepRadio, BEEP);\n\tsoundLayout->addWidget(mBeepRadio);\n\n\t\/\/ File radio button\n\tQHBox* box = new QHBox(this);\n\tmFileRadio = new RadioButton(i18n_File(), box, \"audioFileButton\");\n\tmFileRadio->setFixedSize(mFileRadio->sizeHint());\n\tQWhatsThis::add(mFileRadio, i18n(\"If checked, a sound file will be played when the alarm is displayed.\"));\n\tmTypeGroup->insert(mFileRadio, PLAY_FILE);\n\n\t\/\/ Sound file picker button\n\tmFilePicker = new PushButton(box);\n\tmFilePicker->setPixmap(SmallIcon(\"playsound\"));\n\tmFilePicker->setFixedSize(mFilePicker->sizeHint());\n\tconnect(mFilePicker, SIGNAL(clicked()), SLOT(slotPickFile()));\n\tQWhatsThis::add(mFilePicker, i18n(\"Configure a sound file to play when the alarm is displayed.\"));\n\tbox->setFixedSize(box->sizeHint());\n\tsoundLayout->addWidget(box);\n\tbox->setFocusProxy(mFileRadio);\n\n\t\/\/ Speak radio button\n\tmSpeakRadio = new RadioButton(i18n_p_Speak(), this, \"speakButton\");\n\tmSpeakRadio->setFixedSize(mSpeakRadio->sizeHint());\n\tQWhatsThis::add(mSpeakRadio, i18n(\"If checked, the message will be spoken when the alarm is displayed.\"));\n\tmTypeGroup->insert(mSpeakRadio, SPEAK);\n\tsoundLayout->addWidget(mSpeakRadio);\n\n\tif (!theApp()->speechEnabled())\n\t\tmSpeakRadio->hide();     \/\/ speech capability is not installed\n\n\tsetTabOrder(mCheckbox, mBeepRadio);\n\tsetTabOrder(mBeepRadio, mFileRadio);\n\tsetTabOrder(mFileRadio, mFilePicker);\n\tsetTabOrder(mFilePicker, mSpeakRadio);\n\n\t\/\/ Initialise the file picker button state and tooltip\n\tslotSoundToggled(false);\n}\n\n\/******************************************************************************\n* Set the read-only status of the widget.\n*\/\nvoid SoundPicker::setReadOnly(bool readOnly)\n{\n\tmCheckbox->setReadOnly(readOnly);\n\tmBeepRadio->setReadOnly(readOnly);\n\tmFileRadio->setReadOnly(readOnly);\n#ifdef WITHOUT_ARTS\n\tmFilePicker->setReadOnly(readOnly);\n#endif\n\tmSpeakRadio->setReadOnly(readOnly);\n\tmReadOnly = readOnly;\n}\n\n\/******************************************************************************\n* Show or hide the Speak option.\n*\/\nvoid SoundPicker::showSpeak(bool show)\n{\n\tif (!theApp()->speechEnabled())\n\t\treturn;     \/\/ speech capability is not installed\n\n\tbool shown = !mSpeakRadio->isHidden();\n\tif (show  &&  !shown)\n\t\tmSpeakRadio->show();\n\telse if (!show  &&  shown)\n\t{\n\t\tif (mSpeakRadio->isOn())\n\t\t\tmCheckbox->setChecked(false);\n\t\tmSpeakRadio->hide();\n\t}\n}\n\n\/******************************************************************************\n* Return whether sound is selected.\n*\/\nbool SoundPicker::sound() const\n{\n\treturn mCheckbox->isChecked();\n}\n\n\/******************************************************************************\n* Return the currently selected option.\n*\/\nSoundPicker::Type SoundPicker::type() const\n{\n\treturn static_cast<SoundPicker::Type>(mTypeGroup->selectedId());\n}\n\n\/******************************************************************************\n* Return whether beep is selected.\n*\/\nbool SoundPicker::beep() const\n{\n\treturn mCheckbox->isChecked()  &&  mBeepRadio->isOn();\n}\n\n\/******************************************************************************\n* Return whether speech is selected.\n*\/\nbool SoundPicker::speak() const\n{\n\treturn mCheckbox->isChecked()  &&  !mSpeakRadio->isHidden()  &&  mSpeakRadio->isOn();\n}\n\n\/******************************************************************************\n* Return the selected sound file, if the main checkbox is checked.\n* Returns null string if beep is currently selected.\n*\/\nQString SoundPicker::file() const\n{\n\treturn mCheckbox->isChecked() && mFileRadio->isOn() ? mFile : QString::null;\n}\n\n\/******************************************************************************\n* Return the specified volumes (range 0 - 1).\n* Returns < 0 if beep is currently selected, or if 'set volume' is not selected.\n*\/\nfloat SoundPicker::volume(float& fadeVolume, int& fadeSeconds) const\n{\n\tif (mCheckbox->isChecked() && mFileRadio->isOn() && !mFile.isEmpty())\n\t{\n\t\tfadeVolume  = mFadeVolume;\n\t\tfadeSeconds = mFadeSeconds;\n\t\treturn mVolume;\n\t}\n\telse\n\t{\n\t\tfadeVolume  = -1;\n\t\tfadeSeconds = 0;\n\t\treturn -1;\n\t}\n}\n\n\/******************************************************************************\n* Return whether sound file repetition is selected, if the main checkbox is checked.\n* Returns false if beep is currently selected.\n*\/\nbool SoundPicker::repeat() const\n{\n\treturn mCheckbox->isChecked() && mFileRadio->isOn() && !mFile.isEmpty() && mRepeat;\n}\n\n\/******************************************************************************\n* Initialise the widget's state.\n*\/\nvoid SoundPicker::set(bool sound, SoundPicker::Type defaultType, const QString& f, float volume, float fadeVolume, int fadeSeconds, bool repeat)\n{\n\tif (defaultType == PLAY_FILE  &&  f.isEmpty())\n\t\tdefaultType = BEEP;\n\tmLastType    = static_cast<Type>(0);\n\tmFile        = f;\n\tmVolume      = volume;\n\tmFadeVolume  = fadeVolume;\n\tmFadeSeconds = fadeSeconds;\n\tmRepeat      = repeat;\n\tQToolTip::add(mFilePicker, mFile);\n\tmCheckbox->setChecked(sound);\n\tmTypeGroup->setButton(defaultType);\n}\n\n\/******************************************************************************\n* Called when the sound checkbox is toggled.\n*\/\nvoid SoundPicker::slotSoundToggled(bool on)\n{\n\tmBeepRadio->setEnabled(on);\n\tmSpeakRadio->setEnabled(on);\n\tmFileRadio->setEnabled(on);\n\tmFilePicker->setEnabled(on && mFileRadio->isOn());\n\tif (on  &&  mSpeakRadio->isHidden()  &&  mSpeakRadio->isOn())\n\t\tmBeepRadio->setChecked(true);\n\tif (on)\n\t\tmBeepRadio->setFocus();\n}\n\n\/******************************************************************************\n* Called when the sound option is changed.\n*\/\nvoid SoundPicker::slotTypeChanged(int id)\n{\n\tType newType = static_cast<Type>(id);\n\tif (newType == mLastType  ||  mRevertType)\n\t\treturn;\n\tif (mLastType == PLAY_FILE)\n\t\tmFilePicker->setEnabled(false);\n\telse if (newType == PLAY_FILE)\n\t{\n\t\tif (mFile.isEmpty())\n\t\t{\n\t\t\tslotPickFile();\n\t\t\tif (mFile.isEmpty())\n\t\t\t\treturn;    \/\/ revert to previously selected type\n\t\t}\n\t\tmFilePicker->setEnabled(mCheckbox->isChecked());\n\t}\n\tmLastType = newType;\n}\n\n\/******************************************************************************\n* Called when the file picker button is clicked.\n*\/\nvoid SoundPicker::slotPickFile()\n{\n#ifdef WITHOUT_ARTS\n\tQString url = browseFile(mDefaultDir, mFile);\n\tif (!url.isEmpty())\n\t\tmFile = url;\n#else\n\tQString file = mFile;\n\tSoundDlg dlg(mFile, mVolume, mFadeVolume, mFadeSeconds, mRepeat, i18n(\"Sound File\"), this, \"soundDlg\");\n\tdlg.setReadOnly(mReadOnly);\n\tbool accepted = (dlg.exec() == QDialog::Accepted);\n\tif (mReadOnly)\n\t\treturn;\n\tif (accepted)\n\t{\n\t\tfloat volume, fadeVolume;\n\t\tint   fadeTime;\n\t\tfile         = dlg.getFile();\n\t\tmRepeat      = dlg.getSettings(volume, fadeVolume, fadeTime);\n\t\tmVolume      = volume;\n\t\tmFadeVolume  = fadeVolume;\n\t\tmFadeSeconds = fadeTime;\n\t}\n\tif (!file.isEmpty())\n\t{\n\t\tmFile       = file;\n\t\tmDefaultDir = dlg.defaultDir();\n\t}\n#endif\n\tQToolTip::add(mFilePicker, mFile);\n\tif (mFile.isEmpty())\n\t{\n\t\t\/\/ No audio file is selected, so revert to 'beep'.\n\t\t\/\/ But wait a moment until setting the radio button, or it won't work.\n\t\tmRevertType = true;   \/\/ prevent sound dialogue popping up twice\n\t\tQTimer::singleShot(0, this, SLOT(setLastType()));\n\t}\n}\n\n\/******************************************************************************\n* Select the previously selected sound type.\n*\/\nvoid SoundPicker::setLastType()\n{\n\tmTypeGroup->setButton(mLastType);\n\tmRevertType = false;\n}\n\n\/******************************************************************************\n* Display a dialogue to choose a sound file, initially highlighting any\n* specified file. 'initialFile' must be a full path name or URL.\n* 'defaultDir' is updated to the directory containing the chosen file.\n* Reply = URL selected. If none is selected, URL.isEmpty() is true.\n*\/\nQString SoundPicker::browseFile(QString& defaultDir, const QString& initialFile)\n{\n\tstatic QString kdeSoundDir;     \/\/ directory containing KDE sound files\n\tif (defaultDir.isEmpty())\n\t{\n\t\tif (kdeSoundDir.isNull())\n\t\t\tkdeSoundDir = KGlobal::dirs()->findResourceDir(\"sound\", \"KDE_Notify.wav\");\n\t\tdefaultDir = kdeSoundDir;\n\t}\n#ifdef WITHOUT_ARTS\n\tQString filter = QString::fromLatin1(\"*.wav *.mp3 *.ogg|%1\\n*|%2\").arg(i18n(\"Sound Files\")).arg(i18n(\"All Files\"));\n#else\n\tQString filter = KDE::PlayObjectFactory::mimeTypes().join(\" \");\n#endif\n\treturn KAlarm::browseFile(i18n(\"Choose Sound File\"), defaultDir, initialFile, filter, KFile::ExistingOnly, 0, \"pickSoundFile\");\n}\n<commit_msg>fix compile --without-arts<commit_after>\/*\n *  soundpicker.cpp  -  widget to select a sound file or a beep\n *  Program:  kalarm\n *  Copyright (C) 2002, 2004, 2005 by David Jarvie <software@astrojar.org.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 <config.h>\n#include \"kalarm.h\"\n\n#include <qlayout.h>\n#include <qregexp.h>\n#include <qtooltip.h>\n#include <qtimer.h>\n#include <qhbox.h>\n#include <qwhatsthis.h>\n\n#include <kglobal.h>\n#include <klocale.h>\n#include <kfiledialog.h>\n#include <kstandarddirs.h>\n#include <kiconloader.h>\n#ifndef WITHOUT_ARTS\n#include <arts\/kplayobjectfactory.h>\n#endif\n#include <kdebug.h>\n\n#include \"buttongroup.h\"\n#include \"checkbox.h\"\n#include \"functions.h\"\n#include \"kalarmapp.h\"\n#include \"pushbutton.h\"\n#include \"radiobutton.h\"\n#include \"sounddlg.h\"\n#include \"soundpicker.moc\"\n\n\n\/\/ Collect these widget labels together to ensure consistent wording and\n\/\/ translations across different modules.\nQString SoundPicker::i18n_Sound()       { return i18n(\"An audio sound\", \"Sound\"); }\nQString SoundPicker::i18n_s_Sound()     { return i18n(\"An audio sound\", \"&Sound\"); }\nQString SoundPicker::i18n_Beep()        { return i18n(\"Beep\"); }\nQString SoundPicker::i18n_b_Beep()      { return i18n(\"&Beep\"); }\nQString SoundPicker::i18n_Speak()       { return i18n(\"Speak\"); }\nQString SoundPicker::i18n_p_Speak()     { return i18n(\"S&peak\"); }\nQString SoundPicker::i18n_File()        { return i18n(\"File\"); }\n\n\nSoundPicker::SoundPicker(QWidget* parent, const char* name)\n\t: QFrame(parent, name),\n\t  mRevertType(false)\n{\n\t\/\/ Sound checkbox\n\tsetFrameStyle(QFrame::NoFrame);\n\tQHBoxLayout* soundLayout = new QHBoxLayout(this, 0, 2*KDialog::spacingHint());\n\tsoundLayout->setAlignment(Qt::AlignVCenter);\n\tmCheckbox = new CheckBox(i18n_s_Sound(), this);\n\tmCheckbox->setFixedSize(mCheckbox->sizeHint());\n\tconnect(mCheckbox, SIGNAL(toggled(bool)), SLOT(slotSoundToggled(bool)));\n\tQWhatsThis::add(mCheckbox,\n\t      i18n(\"Check to enable sound when the message is displayed. Select the type of sound from the displayed options.\"));\n\tsoundLayout->addWidget(mCheckbox);\n\n\t\/\/ Sound type\n\tmTypeGroup = new ButtonGroup(this);\n\tmTypeGroup->hide();\n\tconnect(mTypeGroup, SIGNAL(buttonSet(int)), SLOT(slotTypeChanged(int)));\n\n\t\/\/ Beep radio button\n\tmBeepRadio = new RadioButton(i18n_Beep(), this, \"beepButton\");\n\tmBeepRadio->setFixedSize(mBeepRadio->sizeHint());\n\tQWhatsThis::add(mBeepRadio, i18n(\"If checked, a beep will sound when the alarm is displayed.\"));\n\tmTypeGroup->insert(mBeepRadio, BEEP);\n\tsoundLayout->addWidget(mBeepRadio);\n\n\t\/\/ File radio button\n\tQHBox* box = new QHBox(this);\n\tmFileRadio = new RadioButton(i18n_File(), box, \"audioFileButton\");\n\tmFileRadio->setFixedSize(mFileRadio->sizeHint());\n\tQWhatsThis::add(mFileRadio, i18n(\"If checked, a sound file will be played when the alarm is displayed.\"));\n\tmTypeGroup->insert(mFileRadio, PLAY_FILE);\n\n\t\/\/ Sound file picker button\n\tmFilePicker = new PushButton(box);\n\tmFilePicker->setPixmap(SmallIcon(\"playsound\"));\n\tmFilePicker->setFixedSize(mFilePicker->sizeHint());\n\tconnect(mFilePicker, SIGNAL(clicked()), SLOT(slotPickFile()));\n\tQWhatsThis::add(mFilePicker, i18n(\"Configure a sound file to play when the alarm is displayed.\"));\n\tbox->setFixedSize(box->sizeHint());\n\tsoundLayout->addWidget(box);\n\tbox->setFocusProxy(mFileRadio);\n\n\t\/\/ Speak radio button\n\tmSpeakRadio = new RadioButton(i18n_p_Speak(), this, \"speakButton\");\n\tmSpeakRadio->setFixedSize(mSpeakRadio->sizeHint());\n\tQWhatsThis::add(mSpeakRadio, i18n(\"If checked, the message will be spoken when the alarm is displayed.\"));\n\tmTypeGroup->insert(mSpeakRadio, SPEAK);\n\tsoundLayout->addWidget(mSpeakRadio);\n\n\tif (!theApp()->speechEnabled())\n\t\tmSpeakRadio->hide();     \/\/ speech capability is not installed\n\n\tsetTabOrder(mCheckbox, mBeepRadio);\n\tsetTabOrder(mBeepRadio, mFileRadio);\n\tsetTabOrder(mFileRadio, mFilePicker);\n\tsetTabOrder(mFilePicker, mSpeakRadio);\n\n\t\/\/ Initialise the file picker button state and tooltip\n\tslotSoundToggled(false);\n}\n\n\/******************************************************************************\n* Set the read-only status of the widget.\n*\/\nvoid SoundPicker::setReadOnly(bool readOnly)\n{\n\tmCheckbox->setReadOnly(readOnly);\n\tmBeepRadio->setReadOnly(readOnly);\n\tmFileRadio->setReadOnly(readOnly);\n#ifdef WITHOUT_ARTS\n\tmFilePicker->setReadOnly(readOnly);\n#endif\n\tmSpeakRadio->setReadOnly(readOnly);\n\tmReadOnly = readOnly;\n}\n\n\/******************************************************************************\n* Show or hide the Speak option.\n*\/\nvoid SoundPicker::showSpeak(bool show)\n{\n\tif (!theApp()->speechEnabled())\n\t\treturn;     \/\/ speech capability is not installed\n\n\tbool shown = !mSpeakRadio->isHidden();\n\tif (show  &&  !shown)\n\t\tmSpeakRadio->show();\n\telse if (!show  &&  shown)\n\t{\n\t\tif (mSpeakRadio->isOn())\n\t\t\tmCheckbox->setChecked(false);\n\t\tmSpeakRadio->hide();\n\t}\n}\n\n\/******************************************************************************\n* Return whether sound is selected.\n*\/\nbool SoundPicker::sound() const\n{\n\treturn mCheckbox->isChecked();\n}\n\n\/******************************************************************************\n* Return the currently selected option.\n*\/\nSoundPicker::Type SoundPicker::type() const\n{\n\treturn static_cast<SoundPicker::Type>(mTypeGroup->selectedId());\n}\n\n\/******************************************************************************\n* Return whether beep is selected.\n*\/\nbool SoundPicker::beep() const\n{\n\treturn mCheckbox->isChecked()  &&  mBeepRadio->isOn();\n}\n\n\/******************************************************************************\n* Return whether speech is selected.\n*\/\nbool SoundPicker::speak() const\n{\n\treturn mCheckbox->isChecked()  &&  !mSpeakRadio->isHidden()  &&  mSpeakRadio->isOn();\n}\n\n\/******************************************************************************\n* Return the selected sound file, if the main checkbox is checked.\n* Returns null string if beep is currently selected.\n*\/\nQString SoundPicker::file() const\n{\n\treturn mCheckbox->isChecked() && mFileRadio->isOn() ? mFile : QString::null;\n}\n\n\/******************************************************************************\n* Return the specified volumes (range 0 - 1).\n* Returns < 0 if beep is currently selected, or if 'set volume' is not selected.\n*\/\nfloat SoundPicker::volume(float& fadeVolume, int& fadeSeconds) const\n{\n\tif (mCheckbox->isChecked() && mFileRadio->isOn() && !mFile.isEmpty())\n\t{\n\t\tfadeVolume  = mFadeVolume;\n\t\tfadeSeconds = mFadeSeconds;\n\t\treturn mVolume;\n\t}\n\telse\n\t{\n\t\tfadeVolume  = -1;\n\t\tfadeSeconds = 0;\n\t\treturn -1;\n\t}\n}\n\n\/******************************************************************************\n* Return whether sound file repetition is selected, if the main checkbox is checked.\n* Returns false if beep is currently selected.\n*\/\nbool SoundPicker::repeat() const\n{\n\treturn mCheckbox->isChecked() && mFileRadio->isOn() && !mFile.isEmpty() && mRepeat;\n}\n\n\/******************************************************************************\n* Initialise the widget's state.\n*\/\nvoid SoundPicker::set(bool sound, SoundPicker::Type defaultType, const QString& f, float volume, float fadeVolume, int fadeSeconds, bool repeat)\n{\n\tif (defaultType == PLAY_FILE  &&  f.isEmpty())\n\t\tdefaultType = BEEP;\n\tmLastType    = static_cast<Type>(0);\n\tmFile        = f;\n\tmVolume      = volume;\n\tmFadeVolume  = fadeVolume;\n\tmFadeSeconds = fadeSeconds;\n\tmRepeat      = repeat;\n\tQToolTip::add(mFilePicker, mFile);\n\tmCheckbox->setChecked(sound);\n\tmTypeGroup->setButton(defaultType);\n}\n\n\/******************************************************************************\n* Called when the sound checkbox is toggled.\n*\/\nvoid SoundPicker::slotSoundToggled(bool on)\n{\n\tmBeepRadio->setEnabled(on);\n\tmSpeakRadio->setEnabled(on);\n\tmFileRadio->setEnabled(on);\n\tmFilePicker->setEnabled(on && mFileRadio->isOn());\n\tif (on  &&  mSpeakRadio->isHidden()  &&  mSpeakRadio->isOn())\n\t\tmBeepRadio->setChecked(true);\n\tif (on)\n\t\tmBeepRadio->setFocus();\n}\n\n\/******************************************************************************\n* Called when the sound option is changed.\n*\/\nvoid SoundPicker::slotTypeChanged(int id)\n{\n\tType newType = static_cast<Type>(id);\n\tif (newType == mLastType  ||  mRevertType)\n\t\treturn;\n\tif (mLastType == PLAY_FILE)\n\t\tmFilePicker->setEnabled(false);\n\telse if (newType == PLAY_FILE)\n\t{\n\t\tif (mFile.isEmpty())\n\t\t{\n\t\t\tslotPickFile();\n\t\t\tif (mFile.isEmpty())\n\t\t\t\treturn;    \/\/ revert to previously selected type\n\t\t}\n\t\tmFilePicker->setEnabled(mCheckbox->isChecked());\n\t}\n\tmLastType = newType;\n}\n\n\/******************************************************************************\n* Called when the file picker button is clicked.\n*\/\nvoid SoundPicker::slotPickFile()\n{\n#ifdef WITHOUT_ARTS\n\tQString url = browseFile(mDefaultDir, mFile);\n\tif (!url.isEmpty())\n\t\tmFile = url;\n#else\n\tQString file = mFile;\n\tSoundDlg dlg(mFile, mVolume, mFadeVolume, mFadeSeconds, mRepeat, i18n(\"Sound File\"), this, \"soundDlg\");\n\tdlg.setReadOnly(mReadOnly);\n\tbool accepted = (dlg.exec() == QDialog::Accepted);\n\tif (mReadOnly)\n\t\treturn;\n\tif (accepted)\n\t{\n\t\tfloat volume, fadeVolume;\n\t\tint   fadeTime;\n\t\tfile         = dlg.getFile();\n\t\tmRepeat      = dlg.getSettings(volume, fadeVolume, fadeTime);\n\t\tmVolume      = volume;\n\t\tmFadeVolume  = fadeVolume;\n\t\tmFadeSeconds = fadeTime;\n\t}\n\tif (!file.isEmpty())\n\t{\n\t\tmFile       = file;\n\t\tmDefaultDir = dlg.defaultDir();\n\t}\n#endif\n\tQToolTip::add(mFilePicker, mFile);\n\tif (mFile.isEmpty())\n\t{\n\t\t\/\/ No audio file is selected, so revert to 'beep'.\n\t\t\/\/ But wait a moment until setting the radio button, or it won't work.\n\t\tmRevertType = true;   \/\/ prevent sound dialogue popping up twice\n\t\tQTimer::singleShot(0, this, SLOT(setLastType()));\n\t}\n}\n\n\/******************************************************************************\n* Select the previously selected sound type.\n*\/\nvoid SoundPicker::setLastType()\n{\n\tmTypeGroup->setButton(mLastType);\n\tmRevertType = false;\n}\n\n\/******************************************************************************\n* Display a dialogue to choose a sound file, initially highlighting any\n* specified file. 'initialFile' must be a full path name or URL.\n* 'defaultDir' is updated to the directory containing the chosen file.\n* Reply = URL selected. If none is selected, URL.isEmpty() is true.\n*\/\nQString SoundPicker::browseFile(QString& defaultDir, const QString& initialFile)\n{\n\tstatic QString kdeSoundDir;     \/\/ directory containing KDE sound files\n\tif (defaultDir.isEmpty())\n\t{\n\t\tif (kdeSoundDir.isNull())\n\t\t\tkdeSoundDir = KGlobal::dirs()->findResourceDir(\"sound\", \"KDE_Notify.wav\");\n\t\tdefaultDir = kdeSoundDir;\n\t}\n#ifdef WITHOUT_ARTS\n\tQString filter = QString::fromLatin1(\"*.wav *.mp3 *.ogg|%1\\n*|%2\").arg(i18n(\"Sound Files\")).arg(i18n(\"All Files\"));\n#else\n\tQString filter = KDE::PlayObjectFactory::mimeTypes().join(\" \");\n#endif\n\treturn KAlarm::browseFile(i18n(\"Choose Sound File\"), defaultDir, initialFile, filter, KFile::ExistingOnly, 0, \"pickSoundFile\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/---------------------------------------------------------- -*- Mode: C++ -*-\n\/\/ $Id$ \n\/\/\n\/\/ Created 2007\/09\/05\n\/\/ Author: Sriram Rao (Kosmix Corp.) \n\/\/\n\/\/ Copyright 2007 Kosmix Corp.\n\/\/\n\/\/ This file is part of Kosmos File System (KFS).\n\/\/\n\/\/ Licensed 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\n\/\/ implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\/\/\n\/\/ \\brief A sample C++ program that demonstrates KFS APIs.  To run\n\/\/ this program, you need:\n\/\/   - link with libkfsClient.a\n\/\/   - a KFS deployment\n\/\/\n\/\/----------------------------------------------------------------------------\n\n#include <iostream>    \n#include <fstream>\n#include <cerrno>\n\nextern \"C\" {\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <string.h>\n#include <stdlib.h>\n#include <dirent.h>\n}\n\n#include \"libkfsClient\/KfsClient.h\"\n\nusing std::cout;\nusing std::endl;\nusing std::ifstream;\n\nKfsClient *gKfsClient;\n\n\/\/ Make the directory hierarchy in KFS defined by path.\nbool doMkdirs(const char *path);\n\n\/\/ generate sample data for testing\nvoid generateData(char *buf, int numBytes);\n\nint\nmain(int argc, char **argv)\n{\n    string serverHost = \"\";\n    int port = -1;\n    bool help = false;\n    char optchar;\n    struct stat statInfo;\n\n    while ((optchar = getopt(argc, argv, \"hp:s:\")) != -1) {\n        switch (optchar) {\n            case 'p':\n                port = atoi(optarg);\n                break;\n            case 's':\n                serverHost = optarg;\n                break;\n            case 'h':\n                help = true;\n                break;\n            default:\n                cout << \"Unrecognized flag \" << optchar << endl;\n                help = true;\n                break;\n        }\n    }\n\n    if (help || (serverHost == \"\") || (port < 0)) {\n        cout << \"Usage: \" << argv[0] << \" -s <meta server name> -p <port> \"\n             << endl;\n        exit(0);\n    }\n\n    \/\/\n    \/\/ Get a handle to the KFS client object.  This is our entry into\n    \/\/ the KFS namespace.\n    \/\/\n    gKfsClient = KfsClient::Instance();\n    gKfsClient->Init(serverHost, port);\n    if (!gKfsClient->IsInitialized()) {\n\tcout << \"kfs client failed to initialize...exiting\" << endl;\n        exit(0);\n    }\n\n    \/\/ Now that the client is init'ed, do some file-I\/O\n\n    \/\/ Make \/ctest\n    string basedir = \"ctest\";\n    if (!doMkdirs(basedir.c_str())) {\n        exit(0);\n    }\n\n    \/\/ What we just created better be a directory\n    if (!gKfsClient->isDirectory(basedir)) {\n        cout << \"KFS doesn't think: \" << basedir << \" is a dir!\" << endl;\n        exit(-1);\n    }\n\n    \/\/ Create a simple file with default replication (at most 3)\n    string tempFn = new String(basedir + \"\/foo.1\");\n    int fd;\n\n    \/\/ fd is our file-handle to the file we are creating; this\n    \/\/ file handle should be used in subsequent I\/O calls on\n    \/\/ the file.\n    if ((fd = gKfsClient->Create(path)) < 0) {\n        cout << \"Create failed: \" << ErrorCodeToStr(fd) << endl;\n        exit(-1);\n    }\n            \n    \/\/ Get the directory listings\n    vector<string> entries;\n    int res;\n\n    if ((res = gKfsClient->Readdir(basedir.c_str(), entries)) < 0) {\n        cout << \"Readdir failed! \" << ErrorCodeToStr(res) << endl;\n        exit(-1);\n    }\n\n    cout << \"Read dir returned: \";\n    for (int i = 0; i < entries.size(); i++) {\n        cout << entries[i] << endl;\n    }\n\n    \/\/ write something to the file\n    int numBytes = 2048;\n    char *dataBuf = new char[numBytes];\n            \n    generateData(dataBuf, numBytes);\n          \n    \/\/ make a copy and write out using the copy; we keep the original\n    \/\/ so we can validate what we get back is what we wrote.\n    char *d1 = new char[numBytes];\n    memcpy(d1, dataBuf, numBytes);\n\n    int res = gKfsClient->Write(fd, buf, numBytes);\n    if (res != numBytes) {\n        cout << \"Was able to write only: \" << res << \" instead of \" << numBytes << endl;\n    }\n\n    \/\/ flush out the changes\n    gKfsClient->Sync(fd);\n\n    \/\/ Close the file-handle\n    gKfsClient->Close(fd);\n            \n    \/\/ Determine the file-size\n    gKfsClient->Stat(path.c_str(), statInfo);\n    long sz = statInfo.st_size;\n\n    if (sz != numBytes) {\n        cout << \"KFS thinks the file's size is: \" << sz << \" instead of \" << numBytes << endl;\n    }\n\n    \/\/ rename the file\n    string npath = basedir + \"\/foo.2\";\n    gKfsClient->Rename(tempFn.c_str(), npath.c_str());\n\n    if (gKfsClient->Exists(tempFn)) {\n        cout << tempFn << \" still exists after rename!\" << endl;\n        exit(-1);\n    }\n\n    \/\/ Re-create the file and try a rename that should fail...\n    int fd1 = gKfsClient->Create(tempFn.c_str());\n    \n    if (!gKfsClient->Exists(tempFn.c_str())) {\n        cout << \" After rec-create..., \" << tempFn << \" doesn't exist!\" << endl;\n        exit(-1);\n    }\n\n    gKfsClient->Close(fd1);\n\n    \/\/ try to rename and don't allow overwrite\n    if (gKfsClient->Rename(npath.c_str(), tempFn.c_str(), false) == 0) {\n        cout << \"Rename  with overwrite disabled succeeded...error!\" << endl;\n        exit(-1);\n    }\n\n    \/\/ Remove the file\n    gKfsClient->Remove(tempFn.c_str());\n\n    \/\/ Re-open the file\n    if ((fd = gKfsClient->Open(npath.c_str(), O_RDWR)) < 0) {\n        cout << \"Open on : \" << npath << \" failed!\" << ErrorCodeToStr(fd) << endl;\n        exit(-1);\n    }\n            \n    \/\/ read some bytes\n    res = gKfsClient->Read(fd, d1, 128);\n\n    \/\/ Verify what we read matches what we wrote\n    for (int i = 0; i < 128; i++) {\n        if (dataBuf[i] != d1[i]) {\n            cout << \"Data mismatch at : \" << i << endl;\n        }\n    }\n            \n    \/\/ seek to offset 40\n    gKfsClient->Seek(fd, 40);\n\n    \/\/ Seek and verify that we are we think we are\n    sz = gKfsClient->Tell(fd);\n    if (sz != 40) {\n        cout << \"After seek, we are at: \" << sz << \" should be at 40 \" << endl;\n    }\n\n    gKfsClient->Close(fd);\n\n    \/\/ remove the file\n    gKfsClient->Remove(npath.c_str());\n\n    \/\/ remove the dir\n    if ((res = gKfsClient->Rmdir(basedir.c_str()) < 0) {\n        cout << \"Unable to remove: \" << basedir << \" : \" << ErrorCodeToStr(res) << endl;\n    } else {\n        cout << \"Testts passed!\" << endl;\n    }\n}\n\nbool\ndoMkdirs(const char *path)\n{\n    int res;\n\n    res = gKfsClient->Mkdirs((char *) path);\n    if ((res < 0) && (res != -EEXIST)) {\n        cout << \"Mkdir failed: \" << ErrorCodeToStr(res) << endl;\n        return false;\n    }\n    return true;\n}\n\n\nvoid generateData(char *buf, int numBytes)\n{\n    int i;\n    \n    srand(100);\n    for (i = 0; i < numBytes; i++) {\n        buf[i] = (char) ('a' + (rand() % 26));\n    }\n}\n<commit_msg> -- Fixed sample code so that it compiles with the client library.<commit_after>\/\/---------------------------------------------------------- -*- Mode: C++ -*-\n\/\/ $Id$ \n\/\/\n\/\/ Created 2007\/09\/05\n\/\/ Author: Sriram Rao (Kosmix Corp.) \n\/\/\n\/\/ Copyright 2007 Kosmix Corp.\n\/\/\n\/\/ This file is part of Kosmos File System (KFS).\n\/\/\n\/\/ Licensed 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\n\/\/ implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\/\/\n\/\/ \\brief A sample C++ program that demonstrates KFS APIs.  To run\n\/\/ this program, you need:\n\/\/   - link with libkfsClient.a\n\/\/   - a KFS deployment\n\/\/\n\/\/----------------------------------------------------------------------------\n\n#include <iostream>    \n#include <fstream>\n#include <cerrno>\n\nextern \"C\" {\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <string.h>\n#include <stdlib.h>\n#include <dirent.h>\n#include <fcntl.h>\n}\n\n#include \"libkfsClient\/KfsClient.h\"\n\nusing std::cout;\nusing std::endl;\nusing std::ifstream;\nusing namespace KFS;\n\nKfsClientPtr gKfsClient;\n\n\/\/ Make the directory hierarchy in KFS defined by path.\nbool doMkdirs(const char *path);\n\n\/\/ generate sample data for testing\nvoid generateData(char *buf, int numBytes);\n\nint\nmain(int argc, char **argv)\n{\n    string serverHost = \"\";\n    int port = -1;\n    bool help = false;\n    char optchar;\n    struct stat statInfo;\n\n    while ((optchar = getopt(argc, argv, \"hp:s:\")) != -1) {\n        switch (optchar) {\n            case 'p':\n                port = atoi(optarg);\n                break;\n            case 's':\n                serverHost = optarg;\n                break;\n            case 'h':\n                help = true;\n                break;\n            default:\n                cout << \"Unrecognized flag \" << optchar << endl;\n                help = true;\n                break;\n        }\n    }\n\n    if (help || (serverHost == \"\") || (port < 0)) {\n        cout << \"Usage: \" << argv[0] << \" -s <meta server name> -p <port> \"\n             << endl;\n        exit(0);\n    }\n\n    \/\/\n    \/\/ Get a handle to the KFS client object.  This is our entry into\n    \/\/ the KFS namespace.\n    \/\/\n    gKfsClient = getKfsClientFactory()->GetClient(serverHost, port);\n    if (!gKfsClient) {\n        cout << \"kfs client failed to initialize...exiting\" << endl;\n        exit(-1);\n    }\n\n    \/\/ Now that the client is init'ed, do some file-I\/O\n\n    \/\/ Make \/ctest\n    string basedir = \"ctest\";\n    if (!doMkdirs(basedir.c_str())) {\n        exit(0);\n    }\n\n    \/\/ What we just created better be a directory\n    if (!gKfsClient->IsDirectory(basedir.c_str())) {\n        cout << \"KFS doesn't think: \" << basedir << \" is a dir!\" << endl;\n        exit(-1);\n    }\n\n    \/\/ Create a simple file with default replication (at most 3)\n    string tempFn(basedir + \"\/foo.1\");\n    int fd;\n\n    \/\/ fd is our file-handle to the file we are creating; this\n    \/\/ file handle should be used in subsequent I\/O calls on\n    \/\/ the file.\n    if ((fd = gKfsClient->Create(tempFn.c_str())) < 0) {\n        cout << \"Create failed: \" << ErrorCodeToStr(fd) << endl;\n        exit(-1);\n    }\n            \n    \/\/ Get the directory listings\n    vector<string> entries;\n    int res;\n\n    if ((res = gKfsClient->Readdir(basedir.c_str(), entries)) < 0) {\n        cout << \"Readdir failed! \" << ErrorCodeToStr(res) << endl;\n        exit(-1);\n    }\n\n    cout << \"Read dir returned: \";\n    for (uint32_t i = 0; i < entries.size(); i++) {\n        cout << entries[i] << endl;\n    }\n\n    \/\/ write something to the file\n    int numBytes = 2048;\n    char *dataBuf = new char[numBytes];\n            \n    generateData(dataBuf, numBytes);\n          \n    \/\/ make a copy and write out using the copy; we keep the original\n    \/\/ so we can validate what we get back is what we wrote.\n    char *d1 = new char[numBytes];\n    memcpy(d1, dataBuf, numBytes);\n\n    res = gKfsClient->Write(fd, dataBuf, numBytes);\n    if (res != numBytes) {\n        cout << \"Was able to write only: \" << res << \" instead of \" << numBytes << endl;\n    }\n\n    \/\/ flush out the changes\n    gKfsClient->Sync(fd);\n\n    \/\/ Close the file-handle\n    gKfsClient->Close(fd);\n            \n    \/\/ Determine the file-size\n    gKfsClient->Stat(tempFn.c_str(), statInfo);\n    long sz = statInfo.st_size;\n\n    if (sz != numBytes) {\n        cout << \"KFS thinks the file's size is: \" << sz << \" instead of \" << numBytes << endl;\n    }\n\n    \/\/ rename the file\n    string npath = basedir + \"\/foo.2\";\n    gKfsClient->Rename(tempFn.c_str(), npath.c_str());\n\n    if (gKfsClient->Exists(tempFn.c_str())) {\n        cout << tempFn << \" still exists after rename!\" << endl;\n        exit(-1);\n    }\n\n    \/\/ Re-create the file and try a rename that should fail...\n    int fd1 = gKfsClient->Create(tempFn.c_str());\n    \n    if (!gKfsClient->Exists(tempFn.c_str())) {\n        cout << \" After rec-create..., \" << tempFn << \" doesn't exist!\" << endl;\n        exit(-1);\n    }\n\n    gKfsClient->Close(fd1);\n\n    \/\/ try to rename and don't allow overwrite\n    if (gKfsClient->Rename(npath.c_str(), tempFn.c_str(), false) == 0) {\n        cout << \"Rename  with overwrite disabled succeeded...error!\" << endl;\n        exit(-1);\n    }\n\n    \/\/ Remove the file\n    gKfsClient->Remove(tempFn.c_str());\n\n    \/\/ Re-open the file\n    if ((fd = gKfsClient->Open(npath.c_str(), O_RDWR)) < 0) {\n        cout << \"Open on : \" << npath << \" failed!\" << ErrorCodeToStr(fd) << endl;\n        exit(-1);\n    }\n            \n    \/\/ read some bytes\n    res = gKfsClient->Read(fd, d1, 128);\n\n    \/\/ Verify what we read matches what we wrote\n    for (int i = 0; i < 128; i++) {\n        if (dataBuf[i] != d1[i]) {\n            cout << \"Data mismatch at : \" << i << endl;\n        }\n    }\n            \n    \/\/ seek to offset 40\n    gKfsClient->Seek(fd, 40);\n\n    \/\/ Seek and verify that we are we think we are\n    sz = gKfsClient->Tell(fd);\n    if (sz != 40) {\n        cout << \"After seek, we are at: \" << sz << \" should be at 40 \" << endl;\n    }\n\n    gKfsClient->Close(fd);\n\n    \/\/ remove the file\n    gKfsClient->Remove(npath.c_str());\n\n    \/\/ remove the dir\n    if ((res = gKfsClient->Rmdir(basedir.c_str())) < 0) {\n        cout << \"Unable to remove: \" << basedir << \" : \" << ErrorCodeToStr(res) << endl;\n    } else {\n        cout << \"Testts passed!\" << endl;\n    }\n}\n\nbool\ndoMkdirs(const char *path)\n{\n    int res;\n\n    res = gKfsClient->Mkdirs((char *) path);\n    if ((res < 0) && (res != -EEXIST)) {\n        cout << \"Mkdir failed: \" << ErrorCodeToStr(res) << endl;\n        return false;\n    }\n    return true;\n}\n\n\nvoid generateData(char *buf, int numBytes)\n{\n    int i;\n    \n    srand(100);\n    for (i = 0; i < numBytes; i++) {\n        buf[i] = (char) ('a' + (rand() % 26));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include <iostream>\nusing namespace std;\nusing namespace cv;\n\nconst Scalar RED = Scalar(0,0,255);\nconst Scalar PINK = Scalar(230,130,255);\nconst Scalar BLUE = Scalar(255,0,0);\nconst Scalar LIGHTBLUE = Scalar(255,255,160);\nconst Scalar GREEN = Scalar(0,255,0);\n\nconst int BGD_KEY = CV_EVENT_FLAG_CTRLKEY;\nconst int FGD_KEY = CV_EVENT_FLAG_SHIFTKEY;\nint iterCount;\nstatic void getBinMask( const Mat& comMask, Mat& binMask )\n{\n      if( binMask.empty() || binMask.rows!=comMask.rows || binMask.cols!=comMask.cols )\n        binMask.create( comMask.size(), CV_8UC1 );\n    binMask = comMask & 1;\n}\n\nint main( int argc, char** argv )\n{\n   \tVideoCapture cap;\n\n   \tif(argc<=1)\n\t\tcap.open(0);\n \telse\n \t\tcap.open(argv[1]);\n    \tif( !cap.isOpened() )\n        \t\treturn -1;\n        \t\tconst string winName = \"image\";\n        \tMat image;\n\n\tcap>>image;\n\tif( image.empty() )\n\t\treturn -1;\n\tresize(image, image, Size (640,630*image.rows\/image.cols));\n\tMat mask,res,binMask;\n\tMat bgdModel, fgdModel;\n\tres.create(image.size(), CV_8UC3);\n\tres.setTo(Scalar(0,0,0));\n\timshow(winName, res );\n\tbinMask.setTo(0);\n\n\tmask.create( image.size(), CV_8UC1);\n    \tmask.setTo( GC_BGD );   \/\/GC_BGD == 0\n    \tint n=0;\n\tRect rect;\n\trect.x=60;\n\trect.y=40;\n\trect.width=image.cols-100;\n\trect.height=image.rows-80;\n    \t(mask(rect)).setTo( Scalar(GC_PR_FGD) );    \/\/GC_PR_FGD == 3£¬ \n\tgrabCut( image, mask, rect, bgdModel, fgdModel, 1,GC_INIT_WITH_RECT );\n\twhile(1)\n\t{\n\t\tcap>>image;\n\t\tresize(image, image, Size (640,630*image.rows\/image.cols));\n\t\t\/\/uncomment this line code the programe will be normal\t\t\n\t\t\/\/grabCut( image, mask, rect, bgdModel, fgdModel, 1,GC_INIT_WITH_RECT ); \n\t\tgrabCut( image, mask, rect, bgdModel, fgdModel, 2,GC_EVAL );\n\t\tgetBinMask( mask, binMask );\n\t\timage.copyTo( res, binMask );\n\t\t\/\/rectangle( res, Point( rect.x, rect.y ), Point(rect.x + rect.width, rect.y + rect.height ), GREEN, 2);\n\t\timshow( winName, res );\n\t\tchar kk=waitKey(1);\n\t\tif (kk == 'q')break;\n\t\telse if(kk=='n')\n\t\t{\n\t\t\tcout<<n++<< \"  \";\n\t\t}\n\n\t}\n\n\tdestroyWindow( winName );\n\treturn 0;\n}\n<commit_msg>Update grabCut.cpp<commit_after>\/\/ grubcut for video   \n\/\/ Author : reasonW  \n\/\/ Date   : 2016-12-29  \n\/\/ HomePage : http:\/\/github.com\/reasonW  \n\/\/ Email  :charlewander@gmail.com \n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include <iostream>\nusing namespace std;\nusing namespace cv;\n\nconst Scalar RED = Scalar(0,0,255);\nconst Scalar PINK = Scalar(230,130,255);\nconst Scalar BLUE = Scalar(255,0,0);\nconst Scalar LIGHTBLUE = Scalar(255,255,160);\nconst Scalar GREEN = Scalar(0,255,0);\n\nconst int BGD_KEY = CV_EVENT_FLAG_CTRLKEY;\nconst int FGD_KEY = CV_EVENT_FLAG_SHIFTKEY;\nint iterCount;\nstatic void getBinMask( const Mat& comMask, Mat& binMask )\n{\n      if( binMask.empty() || binMask.rows!=comMask.rows || binMask.cols!=comMask.cols )\n        binMask.create( comMask.size(), CV_8UC1 );\n    binMask = comMask & 1;\n}\n\nint main( int argc, char** argv )\n{\n   \tVideoCapture cap;\n\n   \tif(argc<=1)\n\t\tcap.open(0);\n \telse\n \t\tcap.open(argv[1]);\n    \tif( !cap.isOpened() )\n        \t\treturn -1;\n        \t\tconst string winName = \"image\";\n        \tMat image;\n\n\tcap>>image;\n\tif( image.empty() )\n\t\treturn -1;\n\tresize(image, image, Size (640,630*image.rows\/image.cols));\n\tMat mask,res,binMask;\n\tMat bgdModel, fgdModel;\n\tres.create(image.size(), CV_8UC3);\n\tres.setTo(Scalar(0,0,0));\n\timshow(winName, res );\n\tbinMask.setTo(0);\n\n\tmask.create( image.size(), CV_8UC1);\n    \tmask.setTo( GC_BGD );   \/\/GC_BGD == 0\n    \tint n=0;\n\tRect rect;\n\trect.x=60;\n\trect.y=40;\n\trect.width=image.cols-100;\n\trect.height=image.rows-80;\n    \t(mask(rect)).setTo( Scalar(GC_PR_FGD) );    \/\/GC_PR_FGD == 3£¬ \n\tgrabCut( image, mask, rect, bgdModel, fgdModel, 1,GC_INIT_WITH_RECT );\n\twhile(1)\n\t{\n\t\tcap>>image;\n\t\tresize(image, image, Size (640,630*image.rows\/image.cols));\n\t\t\/\/uncomment this line code the programe will be normal\t\t\n\t\t\/\/grabCut( image, mask, rect, bgdModel, fgdModel, 1,GC_INIT_WITH_RECT ); \n\t\tgrabCut( image, mask, rect, bgdModel, fgdModel, 2,GC_EVAL );\n\t\tgetBinMask( mask, binMask );\n\t\timage.copyTo( res, binMask );\n\t\t\/\/rectangle( res, Point( rect.x, rect.y ), Point(rect.x + rect.width, rect.y + rect.height ), GREEN, 2);\n\t\timshow( winName, res );\n\t\tchar kk=waitKey(1);\n\t\tif (kk == 'q')break;\n\t\telse if(kk=='n')\n\t\t{\n\t\t\tcout<<n++<< \"  \";\n\t\t}\n\n\t}\n\n\tdestroyWindow( winName );\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the CernVM File System.\n *\/\n\n#include \"cvmfs_config.h\"\n#include \"upload.h\"\n\n#include <vector>\n\n#include \"util_concurrency.h\"\n\nnamespace upload {\n\nSpooler* Spooler::Construct(const SpoolerDefinition &spooler_definition) {\n  Spooler *result = new Spooler(spooler_definition);\n  if (!result->Initialize()) {\n    delete result;\n    result = NULL;\n  }\n  return result;\n}\n\n\nSpooler::Spooler(const SpoolerDefinition &spooler_definition) :\n  spooler_definition_(spooler_definition)\n{}\n\n\nSpooler::~Spooler() {\n  uploader_->TearDown();\n}\n\n\nbool Spooler::Initialize() {\n  \/\/ configure the uploader environment\n  uploader_ = AbstractUploader::Construct(spooler_definition_);\n  if (!uploader_) {\n    LogCvmfs(kLogSpooler, kLogWarning, \"Failed to initialize backend upload \"\n                                       \"facility in Spooler.\");\n    return false;\n  }\n\n  \/\/ configure the file processor context\n  file_processor_ = new FileProcessor(uploader_.weak_ref(),\n                                      spooler_definition_);\n  file_processor_->RegisterListener(&Spooler::ProcessingCallback, this);\n\n  \/\/ all done...\n  return true;\n}\n\n\nvoid Spooler::Process(const std::string &local_path,\n                      const bool         allow_chunking) {\n  file_processor_->Process(local_path, allow_chunking);\n}\n\n\nvoid Spooler::ProcessCatalog(const std::string &local_path) {\n  file_processor_->Process(local_path, false, shash::kSuffixCatalog);\n}\n\nvoid Spooler::ProcessHistory(const std::string &local_path) {\n  file_processor_->Process(local_path, false, shash::kSuffixHistory);\n}\n\n\nvoid Spooler::Upload(const std::string &local_path,\n                     const std::string &remote_path) {\n  uploader_->Upload(local_path,\n                    remote_path,\n                    AbstractUploader::MakeCallback(&Spooler::UploadingCallback,\n                                                   this));\n}\n\n\nbool Spooler::Remove(const std::string &file_to_delete) {\n  return uploader_->Remove(file_to_delete);\n}\n\n\nbool Spooler::Peek(const std::string &path) const {\n  return uploader_->Peek(path);\n}\n\n\nvoid Spooler::ProcessingCallback(const SpoolerResult &data) {\n  NotifyListeners(data);\n}\n\n\nvoid Spooler::UploadingCallback(const UploaderResults &data) {\n  NotifyListeners(SpoolerResult(data.return_code,\n                                data.local_path));\n}\n\n\nvoid Spooler::WaitForUpload() const {\n  uploader_->WaitForUpload();\n  file_processor_->WaitForProcessing();\n}\n\n\nunsigned int Spooler::GetNumberOfErrors() const {\n  return uploader_->GetNumberOfErrors();\n}\n\n}  \/\/ namespace upload\n<commit_msg>FIX: segfault on malformed spooler d'tor<commit_after>\/**\n * This file is part of the CernVM File System.\n *\/\n\n#include \"cvmfs_config.h\"\n#include \"upload.h\"\n\n#include <vector>\n\n#include \"util_concurrency.h\"\n\nnamespace upload {\n\nSpooler* Spooler::Construct(const SpoolerDefinition &spooler_definition) {\n  Spooler *result = new Spooler(spooler_definition);\n  if (!result->Initialize()) {\n    delete result;\n    result = NULL;\n  }\n  return result;\n}\n\n\nSpooler::Spooler(const SpoolerDefinition &spooler_definition) :\n  spooler_definition_(spooler_definition)\n{}\n\n\nSpooler::~Spooler() {\n  if (uploader_) {\n    uploader_->TearDown();\n  }\n}\n\n\nbool Spooler::Initialize() {\n  \/\/ configure the uploader environment\n  uploader_ = AbstractUploader::Construct(spooler_definition_);\n  if (!uploader_) {\n    LogCvmfs(kLogSpooler, kLogWarning, \"Failed to initialize backend upload \"\n                                       \"facility in Spooler.\");\n    return false;\n  }\n\n  \/\/ configure the file processor context\n  file_processor_ = new FileProcessor(uploader_.weak_ref(),\n                                      spooler_definition_);\n  file_processor_->RegisterListener(&Spooler::ProcessingCallback, this);\n\n  \/\/ all done...\n  return true;\n}\n\n\nvoid Spooler::Process(const std::string &local_path,\n                      const bool         allow_chunking) {\n  file_processor_->Process(local_path, allow_chunking);\n}\n\n\nvoid Spooler::ProcessCatalog(const std::string &local_path) {\n  file_processor_->Process(local_path, false, shash::kSuffixCatalog);\n}\n\nvoid Spooler::ProcessHistory(const std::string &local_path) {\n  file_processor_->Process(local_path, false, shash::kSuffixHistory);\n}\n\n\nvoid Spooler::Upload(const std::string &local_path,\n                     const std::string &remote_path) {\n  uploader_->Upload(local_path,\n                    remote_path,\n                    AbstractUploader::MakeCallback(&Spooler::UploadingCallback,\n                                                   this));\n}\n\n\nbool Spooler::Remove(const std::string &file_to_delete) {\n  return uploader_->Remove(file_to_delete);\n}\n\n\nbool Spooler::Peek(const std::string &path) const {\n  return uploader_->Peek(path);\n}\n\n\nvoid Spooler::ProcessingCallback(const SpoolerResult &data) {\n  NotifyListeners(data);\n}\n\n\nvoid Spooler::UploadingCallback(const UploaderResults &data) {\n  NotifyListeners(SpoolerResult(data.return_code,\n                                data.local_path));\n}\n\n\nvoid Spooler::WaitForUpload() const {\n  uploader_->WaitForUpload();\n  file_processor_->WaitForProcessing();\n}\n\n\nunsigned int Spooler::GetNumberOfErrors() const {\n  return uploader_->GetNumberOfErrors();\n}\n\n}  \/\/ namespace upload\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 \"rpcnetwork.h\"\n#include \"rpcservicepool.h\"\n#include \"rpcsendv1.h\"\n#include \"rpcsendv2.h\"\n#include \"rpctargetpool.h\"\n#include \"rpcnetworkparams.h\"\n#include <vespa\/messagebus\/errorcode.h>\n#include <vespa\/messagebus\/iprotocol.h>\n#include <vespa\/messagebus\/emptyreply.h>\n#include <vespa\/messagebus\/routing\/routingnode.h>\n#include <vespa\/slobrok\/sbregister.h>\n#include <vespa\/slobrok\/sbmirror.h>\n#include <vespa\/vespalib\/component\/vtag.h>\n#include <vespa\/vespalib\/stllike\/asciistream.h>\n#include <vespa\/vespalib\/util\/stringfmt.h>\n#include <vespa\/fnet\/scheduler.h>\n#include <vespa\/fnet\/transport.h>\n#include <vespa\/fnet\/frt\/supervisor.h>\n#include <vespa\/fastos\/thread.h>\n#include <thread>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".rpcnetwork\");\n\nusing vespalib::make_string;\nusing namespace std::chrono_literals;\n\nnamespace {\n\n\/**\n * Implements a helper class for {@link RPCNetwork#sync()}. It provides a\n * blocking method {@link #await()} that will wait until the internal state\n * of this object is set to 'done'. By scheduling this task in the network\n * thread and then calling this method, we achieve handshaking with the network\n * thread.\n *\/\nclass SyncTask : public FNET_Task {\nprivate:\n    vespalib::Gate _gate;\n\npublic:\n    SyncTask(FNET_Scheduler &s) :\n        FNET_Task(&s),\n        _gate() {\n        ScheduleNow();\n    }\n    ~SyncTask() override = default;\n\n    void await() {\n        _gate.await();\n    }\n\n    void PerformTask() override {\n        _gate.countDown();\n    }\n};\n\n} \/\/ namespace <unnamed>\n\nnamespace mbus {\n\nRPCNetwork::SendContext::SendContext(RPCNetwork &net, const Message &msg,\n                                     const std::vector<RoutingNode*> &recipients)\n    : _net(net),\n      _msg(msg),\n      _traceLevel(msg.getTrace().getLevel()),\n      _recipients(recipients),\n      _hasError(false),\n      _pending(_recipients.size()),\n      _version(_net.getVersion())\n{ }\n\nvoid\nRPCNetwork::SendContext::handleVersion(const vespalib::Version *version)\n{\n    bool shouldSend = false;\n    {\n        vespalib::LockGuard guard(_lock);\n        if (version == nullptr) {\n            _hasError = true;\n        } else if (*version < _version) {\n            _version = *version;\n        }\n        if (--_pending == 0) {\n            shouldSend = true;\n        }\n    }\n    if (shouldSend) {\n        _net.send(*this);\n        delete this;\n    }\n}\n\nRPCNetwork::TargetPoolTask::TargetPoolTask(FNET_Scheduler &scheduler, RPCTargetPool &pool)\n    : FNET_Task(&scheduler),\n      _pool(pool)\n{\n    ScheduleNow();\n}\n\nvoid\nRPCNetwork::TargetPoolTask::PerformTask()\n{\n    _pool.flushTargets(false);\n    Schedule(1.0);\n}\n\nRPCNetwork::RPCNetwork(const RPCNetworkParams &params) :\n    _owner(nullptr),\n    _ident(params.getIdentity()),\n    _threadPool(std::make_unique<FastOS_ThreadPool>(128000, 0)),\n    _transport(std::make_unique<FNET_Transport>()),\n    _orb(std::make_unique<FRT_Supervisor>(_transport.get())),\n    _scheduler(*_transport->GetScheduler()),\n    _targetPool(std::make_unique<RPCTargetPool>(params.getConnectionExpireSecs())),\n    _targetPoolTask(_scheduler, *_targetPool),\n    _servicePool(std::make_unique<RPCServicePool>(*this, 4096)),\n    _slobrokCfgFactory(std::make_unique<slobrok::ConfiguratorFactory>(params.getSlobrokConfig())),\n    _mirror(std::make_unique<slobrok::api::MirrorAPI>(*_orb, *_slobrokCfgFactory)),\n    _regAPI(std::make_unique<slobrok::api::RegisterAPI>(*_orb, *_slobrokCfgFactory)),\n    _requestedPort(params.getListenPort()),\n    _executor(std::make_unique<vespalib::ThreadStackExecutor>(params.getNumThreads(), 65536)),\n    _sendV1(std::make_unique<RPCSendV1>()),\n    _sendV2(std::make_unique<RPCSendV2>()),\n    _sendAdapters(),\n    _compressionConfig(params.getCompressionConfig()),\n    _allowDispatchForEncode(params.getDispatchOnEncode()),\n    _allowDispatchForDecode(params.getDispatchOnDecode())\n{\n    _transport->SetMaxInputBufferSize(params.getMaxInputBufferSize());\n    _transport->SetMaxOutputBufferSize(params.getMaxOutputBufferSize());\n    _transport->SetTCPNoDelay(false);\n}\n\nRPCNetwork::~RPCNetwork()\n{\n    shutdown();\n}\n\nFRT_RPCRequest *\nRPCNetwork::allocRequest()\n{\n    return _orb->AllocRPCRequest();\n}\n\nRPCTarget::SP\nRPCNetwork::getTarget(const RPCServiceAddress &address)\n{\n    return _targetPool->getTarget(*_orb, address);\n}\n\nvoid\nRPCNetwork::replyError(const SendContext &ctx, uint32_t errCode, const string &errMsg)\n{\n    for (RoutingNode * rnode : ctx._recipients) {\n        Reply::UP reply(new EmptyReply());\n        reply->setTrace(Trace(ctx._traceLevel));\n        reply->addError(Error(errCode, errMsg));\n        _owner->deliverReply(std::move(reply), *rnode);\n    }\n}\n\nint RPCNetwork::getPort() const { return _orb->GetListenPort(); }\n\n\nvoid\nRPCNetwork::flushTargetPool()\n{\n    _targetPool->flushTargets(true);\n}\n\nconst vespalib::Version &\nRPCNetwork::getVersion() const\n{\n    return vespalib::Vtag::currentVersion;\n}\n\nvoid\nRPCNetwork::attach(INetworkOwner &owner)\n{\n    LOG_ASSERT(_owner == nullptr);\n    _owner = &owner;\n\n    _sendV1->attach(*this);\n    _sendV2->attach(*this);\n    _sendAdapters[vespalib::Version(5)] = _sendV1.get();\n    _sendAdapters[vespalib::Version(6, 149)] = _sendV2.get();\n\n    FRT_ReflectionBuilder builder(_orb.get());\n    builder.DefineMethod(\"mbus.getVersion\", \"\", \"s\", FRT_METHOD(RPCNetwork::invoke), this);\n    builder.MethodDesc(\"Retrieves the message bus version.\");\n    builder.ReturnDesc(\"version\", \"The message bus version.\");\n}\n\nvoid\nRPCNetwork::invoke(FRT_RPCRequest *req)\n{\n    req->GetReturn()->AddString(getVersion().toString().c_str());\n}\n\nconst string\nRPCNetwork::getConnectionSpec() const\n{\n    return make_string(\"tcp\/%s:%d\", _ident.getHostname().c_str(), _orb->GetListenPort());\n}\n\nRPCSendAdapter *\nRPCNetwork::getSendAdapter(const vespalib::Version &version)\n{\n    if (version < _sendAdapters.begin()->first) {\n        return nullptr;\n    }\n    return (--_sendAdapters.upper_bound(version))->second;\n}\n\nbool\nRPCNetwork::start()\n{\n    if (!_transport->Start(_threadPool.get())) {\n        return false;\n    }\n    if (!_orb->Listen(_requestedPort)) {\n        return false;\n    }\n    return true;\n}\n\nbool\nRPCNetwork::waitUntilReady(duration timeout) const\n{\n    slobrok::api::SlobrokList brokerList;\n    slobrok::Configurator::UP configurator = _slobrokCfgFactory->create(brokerList);\n    bool hasConfig = false;\n    for (int64_t i = 0; i < vespalib::count_ms(timeout)\/10; ++i) {\n        if (configurator->poll()) {\n            hasConfig = true;\n        }\n        if (_mirror->ready()) {\n            return true;\n        }\n        std::this_thread::sleep_for(10ms);\n    }\n    if (! hasConfig) {\n        LOG(error, \"failed to get config for slobroks in %2.2f seconds\", vespalib::to_s(timeout));\n    } else if (! _mirror->ready()) {\n        auto brokers = brokerList.logString();\n        LOG(error, \"mirror (of %s) failed to become ready in %2.2f seconds\", brokers.c_str(), vespalib::to_s(timeout));\n    }\n    return false;\n}\n\nvoid\nRPCNetwork::registerSession(const string &session)\n{\n    if (_ident.getServicePrefix().empty()) {\n        LOG(warning, \"The session (%s) will not be registered in the Slobrok since this network has no identity.\",\n            session.c_str());\n        return;\n    }\n    string name = _ident.getServicePrefix();\n    name += \"\/\";\n    name += session;\n    _regAPI->registerName(name);\n}\n\nvoid\nRPCNetwork::unregisterSession(const string &session)\n{\n    if (_ident.getServicePrefix().empty()) {\n        return;\n    }\n    string name = _ident.getServicePrefix();\n    name += \"\/\";\n    name += session;\n    _regAPI->unregisterName(name);\n}\n\nbool\nRPCNetwork::allocServiceAddress(RoutingNode &recipient)\n{\n    const Hop &hop = recipient.getRoute().getHop(0);\n    string service = hop.getServiceName();\n    Error error = resolveServiceAddress(recipient, service);\n    if (error.getCode() == ErrorCode::NONE) {\n        return true; \/\/ service address resolved\n    }\n    recipient.setError(error);\n    return false; \/\/ service adddress not resolved\n}\n\nError\nRPCNetwork::resolveServiceAddress(RoutingNode &recipient, const string &serviceName)\n{\n    RPCServiceAddress::UP ret = _servicePool->resolve(serviceName);\n    if ( ! ret) {\n        return Error(ErrorCode::NO_ADDRESS_FOR_SERVICE,\n                     make_string(\"The address of service '%s' could not be resolved. It is not currently \"\n                                 \"registered with the Vespa name server. \"\n                                 \"The service must be having problems, or the routing configuration is wrong. \"\n                                 \"Address resolution attempted from host '%s'\",\n                                 serviceName.c_str(), getIdentity().getHostname().c_str()));\n    }\n    RPCTarget::SP target = _targetPool->getTarget(*_orb, *ret);\n    if ( ! target) {\n        return Error(ErrorCode::CONNECTION_ERROR,\n                     make_string(\"Failed to connect to service '%s' from host '%s'.\",\n                                 serviceName.c_str(), getIdentity().getHostname().c_str()));\n    }\n    ret->setTarget(std::move(target)); \/\/ free by freeServiceAddress()\n    recipient.setServiceAddress(std::move(ret));\n    return Error();\n}\n\nvoid\nRPCNetwork::freeServiceAddress(RoutingNode &recipient)\n{\n    recipient.setServiceAddress(IServiceAddress::UP());\n}\n\nvoid\nRPCNetwork::send(const Message &msg, const std::vector<RoutingNode*> &recipients)\n{\n    SendContext &ctx = *(new SendContext(*this, msg, recipients)); \/\/ deletes self\n    duration timeout = ctx._msg.getTimeRemainingNow();\n    for (uint32_t i = 0, len = ctx._recipients.size(); i < len; ++i) {\n        RoutingNode *&recipient = ctx._recipients[i];\n\n        RPCServiceAddress &address = static_cast<RPCServiceAddress&>(recipient->getServiceAddress());\n        LOG_ASSERT(address.hasTarget());\n\n        address.getTarget().resolveVersion(timeout, ctx);\n    }\n}\n\nnamespace {\n\nvoid\nemit_recipient_endpoint(vespalib::asciistream& stream, const RoutingNode& recipient) {\n    if (recipient.hasServiceAddress()) {\n        \/\/ At this point the service addresses _should_ be RPCServiceAddress instances,\n        \/\/ but stay on the safe side of the tracks anyway.\n        const auto* rpc_addr = dynamic_cast<const RPCServiceAddress*>(&recipient.getServiceAddress());\n        if (rpc_addr) {\n            stream << rpc_addr->getServiceName() << \" at \" << rpc_addr->getConnectionSpec();\n        } else {\n            stream << \"<non-RPC service address>\";\n        }\n    } else {\n        stream << \"<unknown service address>\";\n    }\n}\n\n}\n\nvespalib::string\nRPCNetwork::buildRecipientListString(const SendContext& ctx) {\n    vespalib::asciistream s;\n    bool first = true;\n    for (const auto* recipient : ctx._recipients) {\n        if (!first) {\n            s << \", \";\n        }\n        first = false;\n        emit_recipient_endpoint(s, *recipient);\n    }\n    return s.str();\n}\n\nvoid\nRPCNetwork::send(RPCNetwork::SendContext &ctx)\n{\n    if (ctx._hasError) {\n        replyError(ctx, ErrorCode::HANDSHAKE_FAILED,\n                make_string(\"An error occurred while resolving version of recipient(s) [%s] from host '%s'.\",\n                            buildRecipientListString(ctx).c_str(), getIdentity().getHostname().c_str()));\n    } else {\n        duration timeRemaining = ctx._msg.getTimeRemainingNow();\n        Blob payload = _owner->getProtocol(ctx._msg.getProtocol())->encode(ctx._version, ctx._msg);\n        RPCSendAdapter *adapter = getSendAdapter(ctx._version);\n        if (adapter == nullptr) {\n            replyError(ctx, ErrorCode::INCOMPATIBLE_VERSION,\n                       make_string(\"Can not send to version '%s' recipient.\", ctx._version.toString().c_str()));\n        } else if (timeRemaining == 0ms) {\n            replyError(ctx, ErrorCode::TIMEOUT, \"Aborting transmission because zero time remains.\");\n        } else if (payload.size() == 0) {\n            replyError(ctx, ErrorCode::ENCODE_ERROR,\n                       make_string(\"Protocol '%s' failed to encode message.\", ctx._msg.getProtocol().c_str()));\n        } else if (ctx._recipients.size() == 1) {\n            adapter->sendByHandover(*ctx._recipients.front(), ctx._version, std::move(payload), timeRemaining);\n        } else {\n            for (auto & recipient : ctx._recipients) {\n                adapter->send(*recipient, ctx._version, payload, timeRemaining);\n            }\n        }\n    }\n}\n\nvoid\nRPCNetwork::sync()\n{\n    SyncTask task(_scheduler);\n    _executor->sync();\n    task.await();\n}\n\nvoid\nRPCNetwork::shutdown()\n{\n    _transport->ShutDown(true);\n    _threadPool->Close();\n    _executor->shutdown();\n    _executor->sync();\n}\n\nvoid\nRPCNetwork::postShutdownHook()\n{\n    _scheduler.CheckTasks();\n}\n\nconst slobrok::api::IMirrorAPI &\nRPCNetwork::getMirror() const\n{\n    return *_mirror;\n}\n\n} \/\/ namespace mbus\n<commit_msg>Not yet.<commit_after>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"rpcnetwork.h\"\n#include \"rpcservicepool.h\"\n#include \"rpcsendv1.h\"\n#include \"rpcsendv2.h\"\n#include \"rpctargetpool.h\"\n#include \"rpcnetworkparams.h\"\n#include <vespa\/messagebus\/errorcode.h>\n#include <vespa\/messagebus\/iprotocol.h>\n#include <vespa\/messagebus\/emptyreply.h>\n#include <vespa\/messagebus\/routing\/routingnode.h>\n#include <vespa\/slobrok\/sbregister.h>\n#include <vespa\/slobrok\/sbmirror.h>\n#include <vespa\/vespalib\/component\/vtag.h>\n#include <vespa\/vespalib\/stllike\/asciistream.h>\n#include <vespa\/vespalib\/util\/stringfmt.h>\n#include <vespa\/fnet\/scheduler.h>\n#include <vespa\/fnet\/transport.h>\n#include <vespa\/fnet\/frt\/supervisor.h>\n#include <vespa\/fastos\/thread.h>\n#include <thread>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".rpcnetwork\");\n\nusing vespalib::make_string;\nusing namespace std::chrono_literals;\n\nnamespace {\n\n\/**\n * Implements a helper class for {@link RPCNetwork#sync()}. It provides a\n * blocking method {@link #await()} that will wait until the internal state\n * of this object is set to 'done'. By scheduling this task in the network\n * thread and then calling this method, we achieve handshaking with the network\n * thread.\n *\/\nclass SyncTask : public FNET_Task {\nprivate:\n    vespalib::Gate _gate;\n\npublic:\n    SyncTask(FNET_Scheduler &s) :\n        FNET_Task(&s),\n        _gate() {\n        ScheduleNow();\n    }\n    ~SyncTask() override = default;\n\n    void await() {\n        _gate.await();\n    }\n\n    void PerformTask() override {\n        _gate.countDown();\n    }\n};\n\n} \/\/ namespace <unnamed>\n\nnamespace mbus {\n\nRPCNetwork::SendContext::SendContext(RPCNetwork &net, const Message &msg,\n                                     const std::vector<RoutingNode*> &recipients)\n    : _net(net),\n      _msg(msg),\n      _traceLevel(msg.getTrace().getLevel()),\n      _recipients(recipients),\n      _hasError(false),\n      _pending(_recipients.size()),\n      _version(_net.getVersion())\n{ }\n\nvoid\nRPCNetwork::SendContext::handleVersion(const vespalib::Version *version)\n{\n    bool shouldSend = false;\n    {\n        vespalib::LockGuard guard(_lock);\n        if (version == nullptr) {\n            _hasError = true;\n        } else if (*version < _version) {\n            _version = *version;\n        }\n        if (--_pending == 0) {\n            shouldSend = true;\n        }\n    }\n    if (shouldSend) {\n        _net.send(*this);\n        delete this;\n    }\n}\n\nRPCNetwork::TargetPoolTask::TargetPoolTask(FNET_Scheduler &scheduler, RPCTargetPool &pool)\n    : FNET_Task(&scheduler),\n      _pool(pool)\n{\n    ScheduleNow();\n}\n\nvoid\nRPCNetwork::TargetPoolTask::PerformTask()\n{\n    _pool.flushTargets(false);\n    Schedule(1.0);\n}\n\nRPCNetwork::RPCNetwork(const RPCNetworkParams &params) :\n    _owner(nullptr),\n    _ident(params.getIdentity()),\n    _threadPool(std::make_unique<FastOS_ThreadPool>(128000, 0)),\n    _transport(std::make_unique<FNET_Transport>()),\n    _orb(std::make_unique<FRT_Supervisor>(_transport.get())),\n    _scheduler(*_transport->GetScheduler()),\n    _targetPool(std::make_unique<RPCTargetPool>(params.getConnectionExpireSecs())),\n    _targetPoolTask(_scheduler, *_targetPool),\n    _servicePool(std::make_unique<RPCServicePool>(*this, 4096)),\n    _slobrokCfgFactory(std::make_unique<slobrok::ConfiguratorFactory>(params.getSlobrokConfig())),\n    _mirror(std::make_unique<slobrok::api::MirrorAPI>(*_orb, *_slobrokCfgFactory)),\n    _regAPI(std::make_unique<slobrok::api::RegisterAPI>(*_orb, *_slobrokCfgFactory)),\n    _requestedPort(params.getListenPort()),\n    _executor(std::make_unique<vespalib::ThreadStackExecutor>(params.getNumThreads(), 65536)),\n    _sendV1(std::make_unique<RPCSendV1>()),\n    _sendV2(std::make_unique<RPCSendV2>()),\n    _sendAdapters(),\n    _compressionConfig(params.getCompressionConfig()),\n    _allowDispatchForEncode(params.getDispatchOnEncode()),\n    _allowDispatchForDecode(params.getDispatchOnDecode())\n{\n    _transport->SetMaxInputBufferSize(params.getMaxInputBufferSize());\n    _transport->SetMaxOutputBufferSize(params.getMaxOutputBufferSize());\n}\n\nRPCNetwork::~RPCNetwork()\n{\n    shutdown();\n}\n\nFRT_RPCRequest *\nRPCNetwork::allocRequest()\n{\n    return _orb->AllocRPCRequest();\n}\n\nRPCTarget::SP\nRPCNetwork::getTarget(const RPCServiceAddress &address)\n{\n    return _targetPool->getTarget(*_orb, address);\n}\n\nvoid\nRPCNetwork::replyError(const SendContext &ctx, uint32_t errCode, const string &errMsg)\n{\n    for (RoutingNode * rnode : ctx._recipients) {\n        Reply::UP reply(new EmptyReply());\n        reply->setTrace(Trace(ctx._traceLevel));\n        reply->addError(Error(errCode, errMsg));\n        _owner->deliverReply(std::move(reply), *rnode);\n    }\n}\n\nint RPCNetwork::getPort() const { return _orb->GetListenPort(); }\n\n\nvoid\nRPCNetwork::flushTargetPool()\n{\n    _targetPool->flushTargets(true);\n}\n\nconst vespalib::Version &\nRPCNetwork::getVersion() const\n{\n    return vespalib::Vtag::currentVersion;\n}\n\nvoid\nRPCNetwork::attach(INetworkOwner &owner)\n{\n    LOG_ASSERT(_owner == nullptr);\n    _owner = &owner;\n\n    _sendV1->attach(*this);\n    _sendV2->attach(*this);\n    _sendAdapters[vespalib::Version(5)] = _sendV1.get();\n    _sendAdapters[vespalib::Version(6, 149)] = _sendV2.get();\n\n    FRT_ReflectionBuilder builder(_orb.get());\n    builder.DefineMethod(\"mbus.getVersion\", \"\", \"s\", FRT_METHOD(RPCNetwork::invoke), this);\n    builder.MethodDesc(\"Retrieves the message bus version.\");\n    builder.ReturnDesc(\"version\", \"The message bus version.\");\n}\n\nvoid\nRPCNetwork::invoke(FRT_RPCRequest *req)\n{\n    req->GetReturn()->AddString(getVersion().toString().c_str());\n}\n\nconst string\nRPCNetwork::getConnectionSpec() const\n{\n    return make_string(\"tcp\/%s:%d\", _ident.getHostname().c_str(), _orb->GetListenPort());\n}\n\nRPCSendAdapter *\nRPCNetwork::getSendAdapter(const vespalib::Version &version)\n{\n    if (version < _sendAdapters.begin()->first) {\n        return nullptr;\n    }\n    return (--_sendAdapters.upper_bound(version))->second;\n}\n\nbool\nRPCNetwork::start()\n{\n    if (!_transport->Start(_threadPool.get())) {\n        return false;\n    }\n    if (!_orb->Listen(_requestedPort)) {\n        return false;\n    }\n    return true;\n}\n\nbool\nRPCNetwork::waitUntilReady(duration timeout) const\n{\n    slobrok::api::SlobrokList brokerList;\n    slobrok::Configurator::UP configurator = _slobrokCfgFactory->create(brokerList);\n    bool hasConfig = false;\n    for (int64_t i = 0; i < vespalib::count_ms(timeout)\/10; ++i) {\n        if (configurator->poll()) {\n            hasConfig = true;\n        }\n        if (_mirror->ready()) {\n            return true;\n        }\n        std::this_thread::sleep_for(10ms);\n    }\n    if (! hasConfig) {\n        LOG(error, \"failed to get config for slobroks in %2.2f seconds\", vespalib::to_s(timeout));\n    } else if (! _mirror->ready()) {\n        auto brokers = brokerList.logString();\n        LOG(error, \"mirror (of %s) failed to become ready in %2.2f seconds\", brokers.c_str(), vespalib::to_s(timeout));\n    }\n    return false;\n}\n\nvoid\nRPCNetwork::registerSession(const string &session)\n{\n    if (_ident.getServicePrefix().empty()) {\n        LOG(warning, \"The session (%s) will not be registered in the Slobrok since this network has no identity.\",\n            session.c_str());\n        return;\n    }\n    string name = _ident.getServicePrefix();\n    name += \"\/\";\n    name += session;\n    _regAPI->registerName(name);\n}\n\nvoid\nRPCNetwork::unregisterSession(const string &session)\n{\n    if (_ident.getServicePrefix().empty()) {\n        return;\n    }\n    string name = _ident.getServicePrefix();\n    name += \"\/\";\n    name += session;\n    _regAPI->unregisterName(name);\n}\n\nbool\nRPCNetwork::allocServiceAddress(RoutingNode &recipient)\n{\n    const Hop &hop = recipient.getRoute().getHop(0);\n    string service = hop.getServiceName();\n    Error error = resolveServiceAddress(recipient, service);\n    if (error.getCode() == ErrorCode::NONE) {\n        return true; \/\/ service address resolved\n    }\n    recipient.setError(error);\n    return false; \/\/ service adddress not resolved\n}\n\nError\nRPCNetwork::resolveServiceAddress(RoutingNode &recipient, const string &serviceName)\n{\n    RPCServiceAddress::UP ret = _servicePool->resolve(serviceName);\n    if ( ! ret) {\n        return Error(ErrorCode::NO_ADDRESS_FOR_SERVICE,\n                     make_string(\"The address of service '%s' could not be resolved. It is not currently \"\n                                 \"registered with the Vespa name server. \"\n                                 \"The service must be having problems, or the routing configuration is wrong. \"\n                                 \"Address resolution attempted from host '%s'\",\n                                 serviceName.c_str(), getIdentity().getHostname().c_str()));\n    }\n    RPCTarget::SP target = _targetPool->getTarget(*_orb, *ret);\n    if ( ! target) {\n        return Error(ErrorCode::CONNECTION_ERROR,\n                     make_string(\"Failed to connect to service '%s' from host '%s'.\",\n                                 serviceName.c_str(), getIdentity().getHostname().c_str()));\n    }\n    ret->setTarget(std::move(target)); \/\/ free by freeServiceAddress()\n    recipient.setServiceAddress(std::move(ret));\n    return Error();\n}\n\nvoid\nRPCNetwork::freeServiceAddress(RoutingNode &recipient)\n{\n    recipient.setServiceAddress(IServiceAddress::UP());\n}\n\nvoid\nRPCNetwork::send(const Message &msg, const std::vector<RoutingNode*> &recipients)\n{\n    SendContext &ctx = *(new SendContext(*this, msg, recipients)); \/\/ deletes self\n    duration timeout = ctx._msg.getTimeRemainingNow();\n    for (uint32_t i = 0, len = ctx._recipients.size(); i < len; ++i) {\n        RoutingNode *&recipient = ctx._recipients[i];\n\n        RPCServiceAddress &address = static_cast<RPCServiceAddress&>(recipient->getServiceAddress());\n        LOG_ASSERT(address.hasTarget());\n\n        address.getTarget().resolveVersion(timeout, ctx);\n    }\n}\n\nnamespace {\n\nvoid\nemit_recipient_endpoint(vespalib::asciistream& stream, const RoutingNode& recipient) {\n    if (recipient.hasServiceAddress()) {\n        \/\/ At this point the service addresses _should_ be RPCServiceAddress instances,\n        \/\/ but stay on the safe side of the tracks anyway.\n        const auto* rpc_addr = dynamic_cast<const RPCServiceAddress*>(&recipient.getServiceAddress());\n        if (rpc_addr) {\n            stream << rpc_addr->getServiceName() << \" at \" << rpc_addr->getConnectionSpec();\n        } else {\n            stream << \"<non-RPC service address>\";\n        }\n    } else {\n        stream << \"<unknown service address>\";\n    }\n}\n\n}\n\nvespalib::string\nRPCNetwork::buildRecipientListString(const SendContext& ctx) {\n    vespalib::asciistream s;\n    bool first = true;\n    for (const auto* recipient : ctx._recipients) {\n        if (!first) {\n            s << \", \";\n        }\n        first = false;\n        emit_recipient_endpoint(s, *recipient);\n    }\n    return s.str();\n}\n\nvoid\nRPCNetwork::send(RPCNetwork::SendContext &ctx)\n{\n    if (ctx._hasError) {\n        replyError(ctx, ErrorCode::HANDSHAKE_FAILED,\n                make_string(\"An error occurred while resolving version of recipient(s) [%s] from host '%s'.\",\n                            buildRecipientListString(ctx).c_str(), getIdentity().getHostname().c_str()));\n    } else {\n        duration timeRemaining = ctx._msg.getTimeRemainingNow();\n        Blob payload = _owner->getProtocol(ctx._msg.getProtocol())->encode(ctx._version, ctx._msg);\n        RPCSendAdapter *adapter = getSendAdapter(ctx._version);\n        if (adapter == nullptr) {\n            replyError(ctx, ErrorCode::INCOMPATIBLE_VERSION,\n                       make_string(\"Can not send to version '%s' recipient.\", ctx._version.toString().c_str()));\n        } else if (timeRemaining == 0ms) {\n            replyError(ctx, ErrorCode::TIMEOUT, \"Aborting transmission because zero time remains.\");\n        } else if (payload.size() == 0) {\n            replyError(ctx, ErrorCode::ENCODE_ERROR,\n                       make_string(\"Protocol '%s' failed to encode message.\", ctx._msg.getProtocol().c_str()));\n        } else if (ctx._recipients.size() == 1) {\n            adapter->sendByHandover(*ctx._recipients.front(), ctx._version, std::move(payload), timeRemaining);\n        } else {\n            for (auto & recipient : ctx._recipients) {\n                adapter->send(*recipient, ctx._version, payload, timeRemaining);\n            }\n        }\n    }\n}\n\nvoid\nRPCNetwork::sync()\n{\n    SyncTask task(_scheduler);\n    _executor->sync();\n    task.await();\n}\n\nvoid\nRPCNetwork::shutdown()\n{\n    _transport->ShutDown(true);\n    _threadPool->Close();\n    _executor->shutdown();\n    _executor->sync();\n}\n\nvoid\nRPCNetwork::postShutdownHook()\n{\n    _scheduler.CheckTasks();\n}\n\nconst slobrok::api::IMirrorAPI &\nRPCNetwork::getMirror() const\n{\n    return *_mirror;\n}\n\n} \/\/ namespace mbus\n<|endoftext|>"}
{"text":"<commit_before>#include \"CommandRequestProcessor.h\"\n#include \"CommandRequest.h\"\n\n#include <sstream>\n\n#include <FileXMLBufferReader.h>\n#include <NMXmlParser.h>\n\nusing namespace opencog;\n\nCommandRequestProcessor::~CommandRequestProcessor() {\n}\n\nCommandRequestProcessor::CommandRequestProcessor() {\n}\n\nstd::string CommandRequestProcessor::load(std::string fileName)\n{\n    std::string msg = \"load successful\";\n    AtomSpace *atomSpace = CogServer::getAtomSpace();\n    std::vector<XMLBufferReader*> readers(1, new FileXMLBufferReader(fileName.c_str()));\n    try {\n        NMXmlParser::loadXML(readers, atomSpace);\n    }\n    catch (IOException &e)\n    {\n        msg = \"load failed: \";\n        msg += e.getMessage();\n    }\n    delete readers[0];\n    return msg;\n}\n\nstd::string CommandRequestProcessor::ls() {\n\n    AtomSpace *atomSpace = CogServer::getAtomSpace();;\n\n    ostringstream stream;\n    atomSpace->print(stream, NODE, true);\n    atomSpace->print(stream, LINK, true);\n    std::string answer = stream.str();\n\n    \/*\n    std::vector<Handle> nodes;\n    atomSpace->getHandleSet(back_inserter(nodes), NODE, true);\n\n    std::vector<Handle> links;\n    atomSpace->getHandleSet(back_inserter(links), LINK, true);\n\n    std::string answer;\n\n    for (unsigned int i = 0; i < nodes.size(); i++) {\n        answer.append(atomSpace->getName(atomSpace->getType(nodes[i])));\n        answer.append(\": \");\n        answer.append(atomSpace->getName(nodes[i]));\n        answer.append(\"\\n\");\n    }\n\n    for (unsigned int i = 0; i < links.size(); i++) {\n        answer.append(atomSpace->getName(links[i]));\n        answer.append(\"(\");\n        const HandleSeq &linkedAtoms = atomSpace->getOutgoing(links[i]);\n        for (unsigned int i = 0; i < linkedAtoms.size(); i++) {\n            if (atomSpace->isNode(linkedAtoms[i])) {\n                answer.append(atomSpace->getName(linkedAtoms[i]));\n            } else {\n                answer.append(\"<link>\");\n            }\n            if (i != (linkedAtoms.size() - 1)) {\n                answer.append(\" \");\n            }\n        }\n        answer.append(\")\");\n        answer.append(\"\\n\");\n    }\n    *\/\n\n    return answer;\n\n}\n\nvoid CommandRequestProcessor::processRequest(CogServerRequest *request)\n{\n    std::string command = ((CommandRequest *) request)->getCommand();\n    std::queue<std::string> args = ((CommandRequest *) request)->getArgs();\n    std::string answer;\n    \n    if (command == \"load\") {\n        if (args.size() != 1) {\n            answer = \"invalid command syntax\";\n        } else {\n            answer = load(args.front());\n        }\n    } else if (command == \"ls\") {\n        if (args.size() != 0) {\n            answer = \"invalid command syntax\";\n        } else {\n            answer = ls();\n        }\n    } else if (command == \"shutdown\") {\n        if (args.size() != 0) {\n            answer = \"invalid command syntax\";\n        } else {\n            exit(0);\n        }\n    } else {\n        answer = \"unknown command\\n\\tAvailable commands: load ls shutdown\";\n    }\n\n    ((CommandRequest *) request)->setAnswer(answer);\n    request->callBack();\n\n    \/*\n     \/\/ Debug code\n    answer = \"processed command \" + command + \"(\";\n    while (! args.empty()) {\n        answer.append(args.front());\n        args.pop();\n        if (! args.empty()) {\n            answer.append(\",\");\n        }\n    }\n    answer.append(\")\");\n    ((CommandRequest *) request)->setAnswer(answer);\n    request->callBack();\n    *\/\n}\n<commit_msg>broaden classes of exceptions that can be caught<commit_after>#include \"CommandRequestProcessor.h\"\n#include \"CommandRequest.h\"\n\n#include <sstream>\n\n#include <FileXMLBufferReader.h>\n#include <NMXmlParser.h>\n\nusing namespace opencog;\n\nCommandRequestProcessor::~CommandRequestProcessor() {\n}\n\nCommandRequestProcessor::CommandRequestProcessor() {\n}\n\nstd::string CommandRequestProcessor::load(std::string fileName)\n{\n    std::string msg = \"load successful\";\n    AtomSpace *atomSpace = CogServer::getAtomSpace();\n    std::vector<XMLBufferReader*> readers(1, new FileXMLBufferReader(fileName.c_str()));\n    try {\n        NMXmlParser::loadXML(readers, atomSpace);\n    }\n    \/\/ Can catch IOException, for file not found, or\n    \/\/ RuntimeException, for bad file format.\n    catch (StandardException &e)\n    {\n        msg = \"xload failed: \";\n        msg += e.getMessage();\n    }\n    delete readers[0];\n    return msg;\n}\n\nstd::string CommandRequestProcessor::ls() {\n\n    AtomSpace *atomSpace = CogServer::getAtomSpace();;\n\n    ostringstream stream;\n    atomSpace->print(stream, NODE, true);\n    atomSpace->print(stream, LINK, true);\n    std::string answer = stream.str();\n\n    \/*\n    std::vector<Handle> nodes;\n    atomSpace->getHandleSet(back_inserter(nodes), NODE, true);\n\n    std::vector<Handle> links;\n    atomSpace->getHandleSet(back_inserter(links), LINK, true);\n\n    std::string answer;\n\n    for (unsigned int i = 0; i < nodes.size(); i++) {\n        answer.append(atomSpace->getName(atomSpace->getType(nodes[i])));\n        answer.append(\": \");\n        answer.append(atomSpace->getName(nodes[i]));\n        answer.append(\"\\n\");\n    }\n\n    for (unsigned int i = 0; i < links.size(); i++) {\n        answer.append(atomSpace->getName(links[i]));\n        answer.append(\"(\");\n        const HandleSeq &linkedAtoms = atomSpace->getOutgoing(links[i]);\n        for (unsigned int i = 0; i < linkedAtoms.size(); i++) {\n            if (atomSpace->isNode(linkedAtoms[i])) {\n                answer.append(atomSpace->getName(linkedAtoms[i]));\n            } else {\n                answer.append(\"<link>\");\n            }\n            if (i != (linkedAtoms.size() - 1)) {\n                answer.append(\" \");\n            }\n        }\n        answer.append(\")\");\n        answer.append(\"\\n\");\n    }\n    *\/\n\n    return answer;\n\n}\n\nvoid CommandRequestProcessor::processRequest(CogServerRequest *request)\n{\n    std::string command = ((CommandRequest *) request)->getCommand();\n    std::queue<std::string> args = ((CommandRequest *) request)->getArgs();\n    std::string answer;\n    \n    if (command == \"load\") {\n        if (args.size() != 1) {\n            answer = \"invalid command syntax\";\n        } else {\n            answer = load(args.front());\n        }\n    } else if (command == \"ls\") {\n        if (args.size() != 0) {\n            answer = \"invalid command syntax\";\n        } else {\n            answer = ls();\n        }\n    } else if (command == \"shutdown\") {\n        if (args.size() != 0) {\n            answer = \"invalid command syntax\";\n        } else {\n            exit(0);\n        }\n    } else {\n        answer = \"unknown command\\n\\tAvailable commands: load ls shutdown\";\n    }\n\n    ((CommandRequest *) request)->setAnswer(answer);\n    request->callBack();\n\n    \/*\n     \/\/ Debug code\n    answer = \"processed command \" + command + \"(\";\n    while (! args.empty()) {\n        answer.append(args.front());\n        args.pop();\n        if (! args.empty()) {\n            answer.append(\",\");\n        }\n    }\n    answer.append(\")\");\n    ((CommandRequest *) request)->setAnswer(answer);\n    request->callBack();\n    *\/\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <GLUL\/Logger.h>\n#include <GLUL\/GL++\/Program.h>\n#include <GLUL\/GL++\/VertexArray.h>\n#include <GLUL\/GL++\/VertexBuffer.h>\n#include <GLUL\/GUI\/Font.h>\n#include <GLUL\/GUI\/Text.h>\n#include <GLUL\/GUI\/Window.h>\n\n#include <vector>\n\n\/**\n * Initialize functions\n *\/\n\nvoid initFont(GLUL::GUI::Font& font, const std::string& fontName, int size) {\n    glEnable(GL_BLEND);\n    glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n\n    font.load(\"assets\/fonts\/\" + fontName + \".ttf\", size);\n}\n\nvoid initVertices(std::vector<glm::vec4>& vertices, const GLUL::GUI::Font& font) {\n    \/\/ Display whole texture\n    float xS = 0.0f;\n    float xE = 1.0f;\n    float yS = 1.0f;\n    float yE = 0.0f;\n\n    (void) font;\n\n    \/*\n    \/\/ Display only one character\n    char character = '@';\n    float xS = font.getMetric(character).texPosStart.x;\n    float yS = font.getMetric(character).texPosStart.y;\n    float xE = font.getMetric(character).texPosEnd.x;\n    float yE = font.getMetric(character).texPosEnd.y;\n    *\/\n\n    vertices.push_back(glm::vec4(-0.9f, -0.3f, xS, yS));\n    vertices.push_back(glm::vec4( 0.9f, -0.3f, xE, yS));\n    vertices.push_back(glm::vec4(-0.9f,  0.3f, xS, yE));\n\n    vertices.push_back(glm::vec4(-0.9f,  0.3f, xS, yE));\n    vertices.push_back(glm::vec4( 0.9f, -0.3f, xE, yS));\n    vertices.push_back(glm::vec4( 0.9f,  0.3f, xE, yE));\n}\n\nvoid initProgram(GL::Program& program) {\n    program.load(\n        GL::Shader(\"assets\/shaders\/font.vp\", GL::Shader::Type::VertexShader),\n        GL::Shader(\"assets\/shaders\/font.fp\", GL::Shader::Type::FragmentShader)\n    );\n}\n\nvoid initVBO(GL::VertexBuffer& vbo, std::vector<glm::vec4>& vertices) {\n    GL::VertexBuffer::Data vertexData;\n\n    \/\/ VertexData\n    vertexData.data = vertices.data();\n    vertexData.size = sizeof(glm::vec4) * vertices.size();\n    vertexData.pointers.push_back(GL::VertexAttrib(0, 4, GL_FLOAT, 0, 0));\n\n    \/\/ VBO settings\n    vbo.bind();\n        vbo.setData(vertexData);\n    vbo.unbind();\n}\n\nvoid initVAO(GL::VertexArray& vao, const GL::VertexBuffer& vbo, const std::vector<glm::vec4>& vertices) {\n    vao.setDrawCount(vertices.size());\n    vao.setDrawTarget(GL::VertexArray::DrawTarget::Triangles);\n\n    vao.bind();\n        vao.attachVBO(&vbo);\n        vao.setAttribPointers();\n    vao.unbind();\n}\n\n\/**\n * Main loop\n *\/\nvoid run() {\n    GLUL::GUI::Window window(800, 600, \"Title\"); \/\/ Be advised - GUI-supporting Window is GLUL::GUI::Window, not GLUL::Window !\n\n    GL::Program program;\n    GL::VertexArray vao;\n    GL::VertexBuffer vbo;\n    std::vector<glm::vec4> vertices;\n\n    GLUL::GUI::Font fontAtlas;\n    GLUL::GUI::Font fontText1;\n    GLUL::GUI::Font fontText2;\n    GLUL::GUI::Text textHeader;\n    GLUL::GUI::Text textFooter1;\n    GLUL::GUI::Text textFooter2;\n\n    window.create();\n    window.getContext().setClearColor(glm::vec4(0.1f, 0.1, 0.1, 1.0f));\n\n    \/\/ loading fonts\n    initFont(fontAtlas, \"arial\", 128);\n    initFont(fontText1, \"verdanai\", 16);\n    initFont(fontText2, \"verdanai\", 32);\n\n    \/\/ set textHeader object\n    textHeader.setFont(fontText2);\n    textHeader.setText(\"Hello world!\\nSecond line. Tab: '\\t'\\n\\nTexture with font's glyphs:\");\n    textHeader.setColor(glm::vec4(1.0f, 0.7f, 0.3f, 1.0f));\n    textHeader.setPosition(glm::vec2(200.0f, 40.0f));\n    textHeader.bindTo(window);\n\n    \/\/ set textFooter1 object\n    textFooter1.setFont(fontText1);\n    textFooter1.setText(\"Text using font with size 16\");\n    textFooter1.setColor(glm::vec4(0.2f, 0.5f, 0.7f, 1.0f));\n    textFooter1.setPosition(glm::vec2(200.0f, 480.0f));\n    textFooter1.bindTo(window);\n    \n    \/\/ set textFooter2 object\n    textFooter2.setFont(fontText2);\n    textFooter2.setText(\"Text using font with size 32 scaled to 16\");\n    textFooter2.setColor(glm::vec4(0.2f, 0.5f, 0.7f, 1.0f));\n    textFooter2.setPosition(glm::vec2(200.0f, 500.0f));\n    textFooter2.setSize(16);\n    textFooter2.bindTo(window);\n\n\n    initVertices(vertices, fontAtlas);\n    initProgram(program);\n    initVBO(vbo, vertices);\n    initVAO(vao, vbo, vertices);\n\n    while(window.isCreated() && window.shouldClose() == false) {\n        window.getContext().clearBuffers(GL::Context::BufferMask::Color);\n\n        fontAtlas.getTexture().bind();\n\n        program.use();\n        program[\"texSampler\"].setSampler(0);\n\n            vao.bind();\n            vao.drawArrays();\n            vao.unbind();\n\n        program.unbind();\n        fontAtlas.getTexture().unbind();\n\n        window.render();\n        window.update();\n    }\n}\n\n\/**\n * Start of application\n *\/\nint main() {\n    try {\n        run();\n\n    } catch(const GLUL::Exception::FatalError& exception) {\n        GLUL::Log::Stream(\"Example\", \"logExample.log\") << \"Cought fatal error exception: \" + std::string(exception.what());\n        return 1;\n\n    } catch(const std::exception& exception) {\n        GLUL::Log::Stream(\"Example\", \"logExample.log\") << \"Cought std::exception: \" + std::string(exception.what());\n        return 1;\n\n    } catch(...) {\n        GLUL::Log::Stream(\"Example\", \"logExample.log\") << \"Cought unknown exception!\";\n        return 1;\n    }\n\n    return 0;\n}\n<commit_msg>Fixed ambiguous VertexAttrib constructor call.<commit_after>#include <GLUL\/Logger.h>\n#include <GLUL\/GL++\/Program.h>\n#include <GLUL\/GL++\/VertexArray.h>\n#include <GLUL\/GL++\/VertexBuffer.h>\n#include <GLUL\/GUI\/Font.h>\n#include <GLUL\/GUI\/Text.h>\n#include <GLUL\/GUI\/Window.h>\n\n#include <vector>\n\n\/**\n * Initialize functions\n *\/\n\nvoid initFont(GLUL::GUI::Font& font, const std::string& fontName, int size) {\n    glEnable(GL_BLEND);\n    glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n\n    font.load(\"assets\/fonts\/\" + fontName + \".ttf\", size);\n}\n\nvoid initVertices(std::vector<glm::vec4>& vertices, const GLUL::GUI::Font& font) {\n    \/\/ Display whole texture\n    float xS = 0.0f;\n    float xE = 1.0f;\n    float yS = 1.0f;\n    float yE = 0.0f;\n\n    (void) font;\n\n    \/*\n    \/\/ Display only one character\n    char character = '@';\n    float xS = font.getMetric(character).texPosStart.x;\n    float yS = font.getMetric(character).texPosStart.y;\n    float xE = font.getMetric(character).texPosEnd.x;\n    float yE = font.getMetric(character).texPosEnd.y;\n    *\/\n\n    vertices.push_back(glm::vec4(-0.9f, -0.3f, xS, yS));\n    vertices.push_back(glm::vec4( 0.9f, -0.3f, xE, yS));\n    vertices.push_back(glm::vec4(-0.9f,  0.3f, xS, yE));\n\n    vertices.push_back(glm::vec4(-0.9f,  0.3f, xS, yE));\n    vertices.push_back(glm::vec4( 0.9f, -0.3f, xE, yS));\n    vertices.push_back(glm::vec4( 0.9f,  0.3f, xE, yE));\n}\n\nvoid initProgram(GL::Program& program) {\n    program.load(\n        GL::Shader(\"assets\/shaders\/font.vp\", GL::Shader::Type::VertexShader),\n        GL::Shader(\"assets\/shaders\/font.fp\", GL::Shader::Type::FragmentShader)\n    );\n}\n\nvoid initVBO(GL::VertexBuffer& vbo, std::vector<glm::vec4>& vertices) {\n    GL::VertexBuffer::Data vertexData;\n\n    \/\/ VertexData\n    vertexData.data = vertices.data();\n    vertexData.size = sizeof(glm::vec4) * vertices.size();\n    vertexData.pointers.push_back(GL::VertexAttrib(0, 4, GL_FLOAT, 0, nullptr));\n\n    \/\/ VBO settings\n    vbo.bind();\n        vbo.setData(vertexData);\n    vbo.unbind();\n}\n\nvoid initVAO(GL::VertexArray& vao, const GL::VertexBuffer& vbo, const std::vector<glm::vec4>& vertices) {\n    vao.setDrawCount(vertices.size());\n    vao.setDrawTarget(GL::VertexArray::DrawTarget::Triangles);\n\n    vao.bind();\n        vao.attachVBO(&vbo);\n        vao.setAttribPointers();\n    vao.unbind();\n}\n\n\/**\n * Main loop\n *\/\nvoid run() {\n    GLUL::GUI::Window window(800, 600, \"Title\"); \/\/ Be advised - GUI-supporting Window is GLUL::GUI::Window, not GLUL::Window !\n\n    GL::Program program;\n    GL::VertexArray vao;\n    GL::VertexBuffer vbo;\n    std::vector<glm::vec4> vertices;\n\n    GLUL::GUI::Font fontAtlas;\n    GLUL::GUI::Font fontText1;\n    GLUL::GUI::Font fontText2;\n    GLUL::GUI::Text textHeader;\n    GLUL::GUI::Text textFooter1;\n    GLUL::GUI::Text textFooter2;\n\n    window.create();\n    window.getContext().setClearColor(glm::vec4(0.1f, 0.1, 0.1, 1.0f));\n\n    \/\/ loading fonts\n    initFont(fontAtlas, \"arial\", 128);\n    initFont(fontText1, \"verdanai\", 16);\n    initFont(fontText2, \"verdanai\", 32);\n\n    \/\/ set textHeader object\n    textHeader.setFont(fontText2);\n    textHeader.setText(\"Hello world!\\nSecond line. Tab: '\\t'\\n\\nTexture with font's glyphs:\");\n    textHeader.setColor(glm::vec4(1.0f, 0.7f, 0.3f, 1.0f));\n    textHeader.setPosition(glm::vec2(200.0f, 40.0f));\n    textHeader.bindTo(window);\n\n    \/\/ set textFooter1 object\n    textFooter1.setFont(fontText1);\n    textFooter1.setText(\"Text using font with size 16\");\n    textFooter1.setColor(glm::vec4(0.2f, 0.5f, 0.7f, 1.0f));\n    textFooter1.setPosition(glm::vec2(200.0f, 480.0f));\n    textFooter1.bindTo(window);\n    \n    \/\/ set textFooter2 object\n    textFooter2.setFont(fontText2);\n    textFooter2.setText(\"Text using font with size 32 scaled to 16\");\n    textFooter2.setColor(glm::vec4(0.2f, 0.5f, 0.7f, 1.0f));\n    textFooter2.setPosition(glm::vec2(200.0f, 500.0f));\n    textFooter2.setSize(16);\n    textFooter2.bindTo(window);\n\n\n    initVertices(vertices, fontAtlas);\n    initProgram(program);\n    initVBO(vbo, vertices);\n    initVAO(vao, vbo, vertices);\n\n    while(window.isCreated() && window.shouldClose() == false) {\n        window.getContext().clearBuffers(GL::Context::BufferMask::Color);\n\n        fontAtlas.getTexture().bind();\n\n        program.use();\n        program[\"texSampler\"].setSampler(0);\n\n            vao.bind();\n            vao.drawArrays();\n            vao.unbind();\n\n        program.unbind();\n        fontAtlas.getTexture().unbind();\n\n        window.render();\n        window.update();\n    }\n}\n\n\/**\n * Start of application\n *\/\nint main() {\n    try {\n        run();\n\n    } catch(const GLUL::Exception::FatalError& exception) {\n        GLUL::Log::Stream(\"Example\", \"logExample.log\") << \"Cought fatal error exception: \" + std::string(exception.what());\n        return 1;\n\n    } catch(const std::exception& exception) {\n        GLUL::Log::Stream(\"Example\", \"logExample.log\") << \"Cought std::exception: \" + std::string(exception.what());\n        return 1;\n\n    } catch(...) {\n        GLUL::Log::Stream(\"Example\", \"logExample.log\") << \"Cought unknown exception!\";\n        return 1;\n    }\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 \"chrome\/browser\/views\/location_bar\/page_action_image_view.h\"\n\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/extensions\/extension_browser_event_router.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"chrome\/browser\/views\/location_bar\/location_bar_view.h\"\n#include \"chrome\/browser\/platform_util.h\"\n#include \"chrome\/common\/extensions\/extension_action.h\"\n#include \"chrome\/common\/extensions\/extension_resource.h\"\n#include \"views\/controls\/menu\/menu_2.h\"\n\nPageActionImageView::PageActionImageView(LocationBarView* owner,\n                                         Profile* profile,\n                                         ExtensionAction* page_action)\n    : owner_(owner),\n      profile_(profile),\n      page_action_(page_action),\n      ALLOW_THIS_IN_INITIALIZER_LIST(tracker_(this)),\n      current_tab_id_(-1),\n      preview_enabled_(false),\n      popup_(NULL) {\n  const Extension* extension = profile->GetExtensionService()->\n      GetExtensionById(page_action->extension_id(), false);\n  DCHECK(extension);\n\n  \/\/ Load all the icons declared in the manifest. This is the contents of the\n  \/\/ icons array, plus the default_icon property, if any.\n  std::vector<std::string> icon_paths(*page_action->icon_paths());\n  if (!page_action_->default_icon_path().empty())\n    icon_paths.push_back(page_action_->default_icon_path());\n\n  for (std::vector<std::string>::iterator iter = icon_paths.begin();\n       iter != icon_paths.end(); ++iter) {\n    tracker_.LoadImage(extension, extension->GetResource(*iter),\n                       gfx::Size(Extension::kPageActionIconMaxSize,\n                                 Extension::kPageActionIconMaxSize),\n                       ImageLoadingTracker::DONT_CACHE);\n  }\n\n  set_accessibility_focusable(true);\n}\n\nPageActionImageView::~PageActionImageView() {\n  if (popup_)\n    HidePopup();\n}\n\nvoid PageActionImageView::ExecuteAction(int button,\n                                        bool inspect_with_devtools) {\n  if (current_tab_id_ < 0) {\n    NOTREACHED() << \"No current tab.\";\n    return;\n  }\n\n  if (page_action_->HasPopup(current_tab_id_)) {\n    \/\/ In tests, GetLastActive could return NULL, so we need to have\n    \/\/ a fallback.\n    \/\/ TODO(erikkay): Find a better way to get the Browser that this\n    \/\/ button is in.\n    Browser* browser = BrowserList::GetLastActiveWithProfile(profile_);\n    if (!browser)\n      browser = BrowserList::FindBrowserWithProfile(profile_);\n    DCHECK(browser);\n\n    bool popup_showing = popup_ != NULL;\n\n    \/\/ Always hide the current popup. Only one popup at a time.\n    HidePopup();\n\n    \/\/ If we were already showing, then treat this click as a dismiss.\n    if (popup_showing)\n      return;\n\n    gfx::Rect screen_bounds(GetImageBounds());\n    gfx::Point origin(screen_bounds.origin());\n    View::ConvertPointToScreen(this, &origin);\n    screen_bounds.set_origin(origin);\n\n    popup_ = ExtensionPopup::Show(\n        page_action_->GetPopupUrl(current_tab_id_),\n        browser,\n        browser->profile(),\n        browser->window()->GetNativeHandle(),\n        screen_bounds,\n        BubbleBorder::TOP_RIGHT,\n        true,  \/\/ Activate the popup window.\n        inspect_with_devtools,\n        ExtensionPopup::BUBBLE_CHROME,\n        this);  \/\/ ExtensionPopup::Observer\n  } else {\n    ExtensionBrowserEventRouter::GetInstance()->PageActionExecuted(\n        profile_, page_action_->extension_id(), page_action_->id(),\n        current_tab_id_, current_url_.spec(), button);\n  }\n}\n\nAccessibilityTypes::Role PageActionImageView::GetAccessibleRole() {\n  return AccessibilityTypes::ROLE_PUSHBUTTON;\n}\n\nbool PageActionImageView::OnMousePressed(const views::MouseEvent& event) {\n  \/\/ We want to show the bubble on mouse release; that is the standard behavior\n  \/\/ for buttons.  (Also, triggering on mouse press causes bugs like\n  \/\/ http:\/\/crbug.com\/33155.)\n  return true;\n}\n\nvoid PageActionImageView::OnMouseReleased(const views::MouseEvent& event,\n                                          bool canceled) {\n  if (canceled || !HitTest(event.location()))\n    return;\n\n  int button = -1;\n  if (event.IsLeftMouseButton()) {\n    button = 1;\n  } else if (event.IsMiddleMouseButton()) {\n    button = 2;\n  } else if (event.IsRightMouseButton()) {\n    \/\/ Get the top left point of this button in screen coordinates.\n    gfx::Point menu_origin;\n    ConvertPointToScreen(this, &menu_origin);\n    \/\/ Make the menu appear below the button.\n    menu_origin.Offset(0, height());\n    ShowContextMenu(menu_origin, true);\n    return;\n  }\n\n  ExecuteAction(button, false);  \/\/ inspect_with_devtools\n}\n\nbool PageActionImageView::OnKeyPressed(const views::KeyEvent& e) {\n  if (e.GetKeyCode() == app::VKEY_SPACE ||\n      e.GetKeyCode() == app::VKEY_RETURN) {\n    ExecuteAction(1, false);\n    return true;\n  }\n  return false;\n}\n\nvoid PageActionImageView::ShowContextMenu(const gfx::Point& p,\n                                          bool is_mouse_gesture) {\n  const Extension* extension = profile_->GetExtensionService()->\n      GetExtensionById(page_action()->extension_id(), false);\n  Browser* browser = BrowserView::GetBrowserViewForNativeWindow(\n      platform_util::GetTopLevel(GetWidget()->GetNativeView()))->browser();\n  context_menu_contents_ =\n      new ExtensionContextMenuModel(extension, browser, this);\n  context_menu_menu_.reset(new views::Menu2(context_menu_contents_.get()));\n  context_menu_menu_->RunContextMenuAt(p);\n}\n\nvoid PageActionImageView::OnImageLoaded(\n    SkBitmap* image, ExtensionResource resource, int index) {\n  \/\/ We loaded icons()->size() icons, plus one extra if the page action had\n  \/\/ a default icon.\n  int total_icons = static_cast<int>(page_action_->icon_paths()->size());\n  if (!page_action_->default_icon_path().empty())\n    total_icons++;\n  DCHECK(index < total_icons);\n\n  \/\/ Map the index of the loaded image back to its name. If we ever get an\n  \/\/ index greater than the number of icons, it must be the default icon.\n  if (image) {\n    if (index < static_cast<int>(page_action_->icon_paths()->size()))\n      page_action_icons_[page_action_->icon_paths()->at(index)] = *image;\n    else\n      page_action_icons_[page_action_->default_icon_path()] = *image;\n  }\n\n  \/\/ During object construction (before the parent has been set) we are already\n  \/\/ in a UpdatePageActions call, so we don't need to start another one (and\n  \/\/ doing so causes crash described in http:\/\/crbug.com\/57333).\n  if (GetParent())\n    owner_->UpdatePageActions();\n}\n\nvoid PageActionImageView::UpdateVisibility(TabContents* contents,\n                                           const GURL& url) {\n  \/\/ Save this off so we can pass it back to the extension when the action gets\n  \/\/ executed. See PageActionImageView::OnMousePressed.\n  current_tab_id_ = contents ? ExtensionTabUtil::GetTabId(contents) : -1;\n  current_url_ = url;\n\n  if (!contents ||\n      (!preview_enabled_ && !page_action_->GetIsVisible(current_tab_id_))) {\n    SetVisible(false);\n    return;\n  }\n\n  \/\/ Set the tooltip.\n  tooltip_ = page_action_->GetTitle(current_tab_id_);\n  SetTooltipText(UTF8ToWide(tooltip_));\n\n  \/\/ Set the image.\n  \/\/ It can come from three places. In descending order of priority:\n  \/\/ - The developer can set it dynamically by path or bitmap. It will be in\n  \/\/   page_action_->GetIcon().\n  \/\/ - The developer can set it dynamically by index. It will be in\n  \/\/   page_action_->GetIconIndex().\n  \/\/ - It can be set in the manifest by path. It will be in\n  \/\/   page_action_->default_icon_path().\n\n  \/\/ First look for a dynamically set bitmap.\n  SkBitmap icon = page_action_->GetIcon(current_tab_id_);\n  if (icon.isNull()) {\n    int icon_index = page_action_->GetIconIndex(current_tab_id_);\n    std::string icon_path = (icon_index < 0) ?\n        page_action_->default_icon_path() :\n        page_action_->icon_paths()->at(icon_index);\n    if (!icon_path.empty()) {\n      PageActionMap::iterator iter = page_action_icons_.find(icon_path);\n      if (iter != page_action_icons_.end())\n        icon = iter->second;\n    }\n  }\n  if (!icon.isNull())\n    SetImage(&icon);\n\n  SetVisible(true);\n}\n\nvoid PageActionImageView::InspectPopup(ExtensionAction* action) {\n  ExecuteAction(1,  \/\/ left-click\n                true);  \/\/ inspect_with_devtools\n}\n\nvoid PageActionImageView::ExtensionPopupIsClosing(ExtensionPopup* popup) {\n  DCHECK_EQ(popup_, popup);\n  \/\/ ExtensionPopup is ref-counted, so we don't need to delete it.\n  popup_ = NULL;\n}\n\nvoid PageActionImageView::HidePopup() {\n  if (popup_)\n    popup_->Close();\n}\n<commit_msg>Make Page Action popup bubble anchor its arrow on the left for RTL languages.<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\/views\/location_bar\/page_action_image_view.h\"\n\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/extensions\/extension_browser_event_router.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"chrome\/browser\/views\/location_bar\/location_bar_view.h\"\n#include \"chrome\/browser\/platform_util.h\"\n#include \"chrome\/common\/extensions\/extension_action.h\"\n#include \"chrome\/common\/extensions\/extension_resource.h\"\n#include \"views\/controls\/menu\/menu_2.h\"\n\nPageActionImageView::PageActionImageView(LocationBarView* owner,\n                                         Profile* profile,\n                                         ExtensionAction* page_action)\n    : owner_(owner),\n      profile_(profile),\n      page_action_(page_action),\n      ALLOW_THIS_IN_INITIALIZER_LIST(tracker_(this)),\n      current_tab_id_(-1),\n      preview_enabled_(false),\n      popup_(NULL) {\n  const Extension* extension = profile->GetExtensionService()->\n      GetExtensionById(page_action->extension_id(), false);\n  DCHECK(extension);\n\n  \/\/ Load all the icons declared in the manifest. This is the contents of the\n  \/\/ icons array, plus the default_icon property, if any.\n  std::vector<std::string> icon_paths(*page_action->icon_paths());\n  if (!page_action_->default_icon_path().empty())\n    icon_paths.push_back(page_action_->default_icon_path());\n\n  for (std::vector<std::string>::iterator iter = icon_paths.begin();\n       iter != icon_paths.end(); ++iter) {\n    tracker_.LoadImage(extension, extension->GetResource(*iter),\n                       gfx::Size(Extension::kPageActionIconMaxSize,\n                                 Extension::kPageActionIconMaxSize),\n                       ImageLoadingTracker::DONT_CACHE);\n  }\n\n  set_accessibility_focusable(true);\n}\n\nPageActionImageView::~PageActionImageView() {\n  if (popup_)\n    HidePopup();\n}\n\nvoid PageActionImageView::ExecuteAction(int button,\n                                        bool inspect_with_devtools) {\n  if (current_tab_id_ < 0) {\n    NOTREACHED() << \"No current tab.\";\n    return;\n  }\n\n  if (page_action_->HasPopup(current_tab_id_)) {\n    \/\/ In tests, GetLastActive could return NULL, so we need to have\n    \/\/ a fallback.\n    \/\/ TODO(erikkay): Find a better way to get the Browser that this\n    \/\/ button is in.\n    Browser* browser = BrowserList::GetLastActiveWithProfile(profile_);\n    if (!browser)\n      browser = BrowserList::FindBrowserWithProfile(profile_);\n    DCHECK(browser);\n\n    bool popup_showing = popup_ != NULL;\n\n    \/\/ Always hide the current popup. Only one popup at a time.\n    HidePopup();\n\n    \/\/ If we were already showing, then treat this click as a dismiss.\n    if (popup_showing)\n      return;\n\n    gfx::Rect screen_bounds(GetImageBounds());\n    gfx::Point origin(screen_bounds.origin());\n    View::ConvertPointToScreen(this, &origin);\n    screen_bounds.set_origin(origin);\n\n    BubbleBorder::ArrowLocation arrow_location = base::i18n::IsRTL() ?\n        BubbleBorder::TOP_LEFT : BubbleBorder::TOP_RIGHT;\n\n    popup_ = ExtensionPopup::Show(\n        page_action_->GetPopupUrl(current_tab_id_),\n        browser,\n        browser->profile(),\n        browser->window()->GetNativeHandle(),\n        screen_bounds,\n        arrow_location,\n        true,  \/\/ Activate the popup window.\n        inspect_with_devtools,\n        ExtensionPopup::BUBBLE_CHROME,\n        this);  \/\/ ExtensionPopup::Observer\n  } else {\n    ExtensionBrowserEventRouter::GetInstance()->PageActionExecuted(\n        profile_, page_action_->extension_id(), page_action_->id(),\n        current_tab_id_, current_url_.spec(), button);\n  }\n}\n\nAccessibilityTypes::Role PageActionImageView::GetAccessibleRole() {\n  return AccessibilityTypes::ROLE_PUSHBUTTON;\n}\n\nbool PageActionImageView::OnMousePressed(const views::MouseEvent& event) {\n  \/\/ We want to show the bubble on mouse release; that is the standard behavior\n  \/\/ for buttons.  (Also, triggering on mouse press causes bugs like\n  \/\/ http:\/\/crbug.com\/33155.)\n  return true;\n}\n\nvoid PageActionImageView::OnMouseReleased(const views::MouseEvent& event,\n                                          bool canceled) {\n  if (canceled || !HitTest(event.location()))\n    return;\n\n  int button = -1;\n  if (event.IsLeftMouseButton()) {\n    button = 1;\n  } else if (event.IsMiddleMouseButton()) {\n    button = 2;\n  } else if (event.IsRightMouseButton()) {\n    \/\/ Get the top left point of this button in screen coordinates.\n    gfx::Point menu_origin;\n    ConvertPointToScreen(this, &menu_origin);\n    \/\/ Make the menu appear below the button.\n    menu_origin.Offset(0, height());\n    ShowContextMenu(menu_origin, true);\n    return;\n  }\n\n  ExecuteAction(button, false);  \/\/ inspect_with_devtools\n}\n\nbool PageActionImageView::OnKeyPressed(const views::KeyEvent& e) {\n  if (e.GetKeyCode() == app::VKEY_SPACE ||\n      e.GetKeyCode() == app::VKEY_RETURN) {\n    ExecuteAction(1, false);\n    return true;\n  }\n  return false;\n}\n\nvoid PageActionImageView::ShowContextMenu(const gfx::Point& p,\n                                          bool is_mouse_gesture) {\n  const Extension* extension = profile_->GetExtensionService()->\n      GetExtensionById(page_action()->extension_id(), false);\n  Browser* browser = BrowserView::GetBrowserViewForNativeWindow(\n      platform_util::GetTopLevel(GetWidget()->GetNativeView()))->browser();\n  context_menu_contents_ =\n      new ExtensionContextMenuModel(extension, browser, this);\n  context_menu_menu_.reset(new views::Menu2(context_menu_contents_.get()));\n  context_menu_menu_->RunContextMenuAt(p);\n}\n\nvoid PageActionImageView::OnImageLoaded(\n    SkBitmap* image, ExtensionResource resource, int index) {\n  \/\/ We loaded icons()->size() icons, plus one extra if the page action had\n  \/\/ a default icon.\n  int total_icons = static_cast<int>(page_action_->icon_paths()->size());\n  if (!page_action_->default_icon_path().empty())\n    total_icons++;\n  DCHECK(index < total_icons);\n\n  \/\/ Map the index of the loaded image back to its name. If we ever get an\n  \/\/ index greater than the number of icons, it must be the default icon.\n  if (image) {\n    if (index < static_cast<int>(page_action_->icon_paths()->size()))\n      page_action_icons_[page_action_->icon_paths()->at(index)] = *image;\n    else\n      page_action_icons_[page_action_->default_icon_path()] = *image;\n  }\n\n  \/\/ During object construction (before the parent has been set) we are already\n  \/\/ in a UpdatePageActions call, so we don't need to start another one (and\n  \/\/ doing so causes crash described in http:\/\/crbug.com\/57333).\n  if (GetParent())\n    owner_->UpdatePageActions();\n}\n\nvoid PageActionImageView::UpdateVisibility(TabContents* contents,\n                                           const GURL& url) {\n  \/\/ Save this off so we can pass it back to the extension when the action gets\n  \/\/ executed. See PageActionImageView::OnMousePressed.\n  current_tab_id_ = contents ? ExtensionTabUtil::GetTabId(contents) : -1;\n  current_url_ = url;\n\n  if (!contents ||\n      (!preview_enabled_ && !page_action_->GetIsVisible(current_tab_id_))) {\n    SetVisible(false);\n    return;\n  }\n\n  \/\/ Set the tooltip.\n  tooltip_ = page_action_->GetTitle(current_tab_id_);\n  SetTooltipText(UTF8ToWide(tooltip_));\n\n  \/\/ Set the image.\n  \/\/ It can come from three places. In descending order of priority:\n  \/\/ - The developer can set it dynamically by path or bitmap. It will be in\n  \/\/   page_action_->GetIcon().\n  \/\/ - The developer can set it dynamically by index. It will be in\n  \/\/   page_action_->GetIconIndex().\n  \/\/ - It can be set in the manifest by path. It will be in\n  \/\/   page_action_->default_icon_path().\n\n  \/\/ First look for a dynamically set bitmap.\n  SkBitmap icon = page_action_->GetIcon(current_tab_id_);\n  if (icon.isNull()) {\n    int icon_index = page_action_->GetIconIndex(current_tab_id_);\n    std::string icon_path = (icon_index < 0) ?\n        page_action_->default_icon_path() :\n        page_action_->icon_paths()->at(icon_index);\n    if (!icon_path.empty()) {\n      PageActionMap::iterator iter = page_action_icons_.find(icon_path);\n      if (iter != page_action_icons_.end())\n        icon = iter->second;\n    }\n  }\n  if (!icon.isNull())\n    SetImage(&icon);\n\n  SetVisible(true);\n}\n\nvoid PageActionImageView::InspectPopup(ExtensionAction* action) {\n  ExecuteAction(1,  \/\/ left-click\n                true);  \/\/ inspect_with_devtools\n}\n\nvoid PageActionImageView::ExtensionPopupIsClosing(ExtensionPopup* popup) {\n  DCHECK_EQ(popup_, popup);\n  \/\/ ExtensionPopup is ref-counted, so we don't need to delete it.\n  popup_ = NULL;\n}\n\nvoid PageActionImageView::HidePopup() {\n  if (popup_)\n    popup_->Close();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ WinAPI\n\/\/ \n#define WIN32_LEAN_AND_MEAN\n#define NOMINMAX\n#include <Windows.h>\n#include <SetupAPI.h>\n#include <Shlwapi.h>\n#include <initguid.h>\n#include <winioctl.h>\n#include \"XUSB.h\"\n\n\/\/\n\/\/ STL\n\/\/ \n#include <string>\n#include <codecvt>\n#include <locale>\n#include <map>\n#include <iostream>\n#include <fstream>\n\n\/\/\n\/\/ JSON\n\/\/ \n#include <json\/json.h>\n\n\/\/\n\/\/ Hooking\n\/\/ \n#include <detours\/detours.h>\n\n\/\/\n\/\/ Logging\n\/\/ \n#include <spdlog\/spdlog.h>\n#include <spdlog\/sinks\/basic_file_sink.h>\n#include <spdlog\/fmt\/bin_to_hex.h>\n\nusing convert_t = std::codecvt_utf8<wchar_t>;\nstd::wstring_convert<convert_t, wchar_t> strconverter;\nstd::once_flag g_init;\nstd::string g_dllDir;\n\n\nstatic decltype(SetupDiEnumDeviceInterfaces) *real_SetupDiEnumDeviceInterfaces = SetupDiEnumDeviceInterfaces;\nstatic decltype(DeviceIoControl) *real_DeviceIoControl = DeviceIoControl;\nstatic decltype(CreateFileA) *real_CreateFileA = CreateFileA;\nstatic decltype(CreateFileW) *real_CreateFileW = CreateFileW;\nstatic decltype(WriteFile)* real_WriteFile = WriteFile;\n\nstatic std::map<HANDLE, std::string> g_handleToPath;\nstatic std::map<DWORD, std::string> g_ioctlMap;\n\n\n\/\/\n\/\/ Hooks SetupDiEnumDeviceInterfaces() API\n\/\/ \nBOOL WINAPI DetourSetupDiEnumDeviceInterfaces(\n\tHDEVINFO DeviceInfoSet,\n\tPSP_DEVINFO_DATA DeviceInfoData,\n\tconst GUID* InterfaceClassGuid,\n\tDWORD MemberIndex,\n\tPSP_DEVICE_INTERFACE_DATA DeviceInterfaceData\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"SetupDiEnumDeviceInterfaces\");\n\n\tauto retval = real_SetupDiEnumDeviceInterfaces(DeviceInfoSet, DeviceInfoData, InterfaceClassGuid, MemberIndex,\n\t                                               DeviceInterfaceData);\n\n\t_logger->info(\"InterfaceClassGuid = {{{0:X}-{1:X}-{2:X}-{3:X}{4:X}-{5:X}{6:X}{7:X}{8:X}{9:X}{10:X}}}, \"\n\t              \"return = 0x{11:X}, error = 0x{12:X}\",\n\t              InterfaceClassGuid->Data1, InterfaceClassGuid->Data2, InterfaceClassGuid->Data3,\n\t              InterfaceClassGuid->Data4[0], InterfaceClassGuid->Data4[1], InterfaceClassGuid->Data4[2],\n\t              InterfaceClassGuid->Data4[3],\n\t              InterfaceClassGuid->Data4[4], InterfaceClassGuid->Data4[5], InterfaceClassGuid->Data4[6],\n\t              InterfaceClassGuid->Data4[7],\n\t              retval, GetLastError());\n\n\treturn retval;\n}\n\n\/\/\n\/\/ Hooks CreateFileA() API\n\/\/ \nHANDLE WINAPI DetourCreateFileA(\n\tLPCSTR lpFileName,\n\tDWORD dwDesiredAccess,\n\tDWORD dwShareMode,\n\tLPSECURITY_ATTRIBUTES lpSecurityAttributes,\n\tDWORD dwCreationDisposition,\n\tDWORD dwFlagsAndAttributes,\n\tHANDLE hTemplateFile\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"CreateFileA\");\n\tstd::string path(lpFileName);\n\n\tconst bool isOfInterest = (path.rfind(\"\\\\\\\\\", 0) == 0);\n\n\tif (isOfInterest)\n\t\t_logger->info(\"lpFileName = {}\", path);\n\n\tconst auto handle = real_CreateFileA(\n\t\tlpFileName,\n\t\tdwDesiredAccess,\n\t\tdwShareMode,\n\t\tlpSecurityAttributes,\n\t\tdwCreationDisposition,\n\t\tdwFlagsAndAttributes,\n\t\thTemplateFile\n\t);\n\n\tif (handle != INVALID_HANDLE_VALUE)\n\t{\n\t\tg_handleToPath[handle] = path;\n\t\tif (isOfInterest)\n\t\t\t_logger->info(\"handle = {}, lpFileName = {}\", handle, path);\n\t}\n\n\treturn handle;\n}\n\n\/\/\n\/\/ Hooks CreateFileW() API\n\/\/ \nHANDLE WINAPI DetourCreateFileW(\n\tLPCWSTR lpFileName,\n\tDWORD dwDesiredAccess,\n\tDWORD dwShareMode,\n\tLPSECURITY_ATTRIBUTES lpSecurityAttributes,\n\tDWORD dwCreationDisposition,\n\tDWORD dwFlagsAndAttributes,\n\tHANDLE hTemplateFile\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"CreateFileW\");\n\tstd::string path(strconverter.to_bytes(lpFileName));\n\n\tconst bool isOfInterest = (path.rfind(\"\\\\\\\\\", 0) == 0);\n\n\tif (isOfInterest)\n\t\t_logger->info(\"lpFileName = {}\", path);\n\n\tconst auto handle = real_CreateFileW(\n\t\tlpFileName,\n\t\tdwDesiredAccess,\n\t\tdwShareMode,\n\t\tlpSecurityAttributes,\n\t\tdwCreationDisposition,\n\t\tdwFlagsAndAttributes,\n\t\thTemplateFile\n\t);\n\n\tif (handle != INVALID_HANDLE_VALUE)\n\t{\n\t\tg_handleToPath[handle] = path;\n\t\tif (isOfInterest)\n\t\t\t_logger->info(\"handle = {}, lpFileName = {}\", handle, path);\n\t}\n\n\treturn handle;\n}\n\n\/\/\n\/\/ Hooks WriteFile() API\n\/\/ \nBOOL WINAPI DetourWriteFile(\n\tHANDLE       hFile,\n\tLPCVOID      lpBuffer,\n\tDWORD        nNumberOfBytesToWrite,\n\tLPDWORD      lpNumberOfBytesWritten,\n\tLPOVERLAPPED lpOverlapped\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"WriteFile\");\n\n\tconst PUCHAR charInBuf = PUCHAR(lpBuffer);\n\tconst std::vector<char> inBuffer(charInBuf, charInBuf + nNumberOfBytesToWrite);\n\t\n\tconst auto ret =  real_WriteFile(hFile, lpBuffer, nNumberOfBytesToWrite, lpNumberOfBytesWritten, lpOverlapped);\n\tconst auto error = GetLastError();\n\t\n\t_logger->info(\"[I] ret={}, lastError={} ({:04d}) -> {:Xpn}\",\n\t\tret,\n\t\terror,\n\t\tnNumberOfBytesToWrite,\n\t\tspdlog::to_hex(inBuffer)\n\t);\n}\n\n\/\/\n\/\/ Hooks DeviceIoControl() API\n\/\/ \nBOOL WINAPI DetourDeviceIoControl(\n\tHANDLE hDevice,\n\tDWORD dwIoControlCode,\n\tLPVOID lpInBuffer,\n\tDWORD nInBufferSize,\n\tLPVOID lpOutBuffer,\n\tDWORD nOutBufferSize,\n\tLPDWORD lpBytesReturned,\n\tLPOVERLAPPED lpOverlapped\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"DeviceIoControl\");\n\n\tconst PUCHAR charInBuf = static_cast<PUCHAR>(lpInBuffer);\n\tconst std::vector<char> inBuffer(charInBuf, charInBuf + nInBufferSize);\n\n\tif (g_ioctlMap.count(dwIoControlCode))\n\t{\n\t\t_logger->info(\"[I] [{}] ({:04d}) -> {:Xpn}\",\n\t\t              g_ioctlMap[dwIoControlCode],\n\t\t              nInBufferSize,\n\t\t              spdlog::to_hex(inBuffer)\n\t\t);\n\t}\n\n\tDWORD tmpBytesReturned;\n\n\tconst auto retval = real_DeviceIoControl(\n\t\thDevice,\n\t\tdwIoControlCode,\n\t\tlpInBuffer,\n\t\tnInBufferSize,\n\t\tlpOutBuffer,\n\t\tnOutBufferSize,\n\t\t&tmpBytesReturned, \/\/ might be null, use our own variable\n\t\tlpOverlapped\n\t);\n\n\tif (lpBytesReturned)\n\t\t*lpBytesReturned = tmpBytesReturned;\n\n\tif (lpOutBuffer && nOutBufferSize > 0)\n\t{\n\t\tconst PUCHAR charOutBuf = static_cast<PUCHAR>(lpOutBuffer);\n\t\tconst auto bufSize = std::min(nOutBufferSize, tmpBytesReturned);\n\t\tconst std::vector<char> outBuffer(charOutBuf, charOutBuf + bufSize);\n\n\t\tif (g_ioctlMap.count(dwIoControlCode))\n\t\t{\n\t\t\t_logger->info(\"[O] [{}] ({:04d}) -> {:Xpn}\",\n\t\t\t              g_ioctlMap[dwIoControlCode],\n\t\t\t              bufSize,\n\t\t\t              spdlog::to_hex(outBuffer)\n\t\t\t);\n\t\t}\n\t}\n\n\treturn retval;\n}\n\nEXTERN_C IMAGE_DOS_HEADER __ImageBase;\n\nBOOL WINAPI DllMain(HINSTANCE dll_handle, DWORD reason, LPVOID reserved)\n{\n\tif (DetourIsHelperProcess())\n\t{\n\t\treturn TRUE;\n\t}\n\n\tswitch (reason)\n\t{\n\tcase DLL_PROCESS_ATTACH:\n\t\t{\n\t\t\tCHAR dllPath[MAX_PATH];\n\n\t\t\tGetModuleFileNameA((HINSTANCE)&__ImageBase, dllPath, MAX_PATH);\n\t\t\tPathRemoveFileSpecA(dllPath);\n\t\t\tg_dllDir = std::string(dllPath);\n\n\t\t\tauto logger = spdlog::basic_logger_mt(\n\t\t\t\t\"XInputHooker\",\n\t\t\t\tg_dllDir + \"\\\\XInputHooker.log\"\n\t\t\t);\n\n#if _DEBUG\n\t\t\tspdlog::set_level(spdlog::level::debug);\n\t\t\tlogger->flush_on(spdlog::level::debug);\n#else\n\t\tlogger->flush_on(spdlog::level::info);\n#endif\n\n\t\t\tset_default_logger(logger);\n\n\t\t\t\/\/\n\t\t\t\/\/ Load known IOCTL code definitions\n\t\t\t\/\/ \n\t\t\tJson::Value root;\n\t\t\tstd::ifstream ifs(g_dllDir + \"\\\\ioctls.json\");\n\t\t\tifs >> root;\n\n\t\t\tfor (auto& i : root)\n\t\t\t{\n\t\t\t\tg_ioctlMap[std::stoul(i[\"HexValue\"].asString(), nullptr, 16)] = i[\"Ioctl\"].asString();\n\t\t\t}\n\t\t}\n\n\t\tDisableThreadLibraryCalls(dll_handle);\n\t\tDetourRestoreAfterWith();\n\n\t\tDetourTransactionBegin();\n\t\tDetourUpdateThread(GetCurrentThread());\n\t\tDetourAttach(&static_cast<PVOID>(real_SetupDiEnumDeviceInterfaces), DetourSetupDiEnumDeviceInterfaces);\n\t\tDetourAttach(&static_cast<PVOID>(real_DeviceIoControl), DetourDeviceIoControl);\n\t\tDetourAttach(&static_cast<PVOID>(real_CreateFileA), DetourCreateFileA);\n\t\tDetourAttach(&static_cast<PVOID>(real_CreateFileW), DetourCreateFileW);\n\t\tDetourAttach(&static_cast<PVOID>(real_WriteFile), DetourWriteFile);\n\t\tDetourTransactionCommit();\n\n\t\tbreak;\n\n\tcase DLL_PROCESS_DETACH:\n\t\tDetourTransactionBegin();\n\t\tDetourUpdateThread(GetCurrentThread());\n\t\tDetourDetach(&static_cast<PVOID>(real_SetupDiEnumDeviceInterfaces), DetourSetupDiEnumDeviceInterfaces);\n\t\tDetourDetach(&static_cast<PVOID>(real_DeviceIoControl), DetourDeviceIoControl);\n\t\tDetourDetach(&static_cast<PVOID>(real_CreateFileA), DetourCreateFileA);\n\t\tDetourDetach(&static_cast<PVOID>(real_CreateFileW), DetourCreateFileW);\n\t\tDetourDetach(&static_cast<PVOID>(real_WriteFile), DetourWriteFile);\n\t\tDetourTransactionCommit();\n\t\tbreak;\n\t}\n\treturn TRUE;\n}\n<commit_msg>Added DetourWriteFile and DetourGetOverlappedResult<commit_after>\/\/\n\/\/ WinAPI\n\/\/ \n#define WIN32_LEAN_AND_MEAN\n#define NOMINMAX\n#include <Windows.h>\n#include <SetupAPI.h>\n#include <Shlwapi.h>\n#include <initguid.h>\n#include <winioctl.h>\n#include \"XUSB.h\"\n\n\/\/\n\/\/ STL\n\/\/ \n#include <string>\n#include <codecvt>\n#include <locale>\n#include <map>\n#include <iostream>\n#include <fstream>\n\n\/\/\n\/\/ JSON\n\/\/ \n#include <json\/json.h>\n\n\/\/\n\/\/ Hooking\n\/\/ \n#include <detours\/detours.h>\n\n\/\/\n\/\/ Logging\n\/\/ \n#include <spdlog\/spdlog.h>\n#include <spdlog\/sinks\/basic_file_sink.h>\n#include <spdlog\/fmt\/bin_to_hex.h>\n\nusing convert_t = std::codecvt_utf8<wchar_t>;\nstd::wstring_convert<convert_t, wchar_t> strconverter;\nstd::once_flag g_init;\nstd::string g_dllDir;\n\n\nstatic decltype(SetupDiEnumDeviceInterfaces) *real_SetupDiEnumDeviceInterfaces = SetupDiEnumDeviceInterfaces;\nstatic decltype(DeviceIoControl) *real_DeviceIoControl = DeviceIoControl;\nstatic decltype(CreateFileA) *real_CreateFileA = CreateFileA;\nstatic decltype(CreateFileW) *real_CreateFileW = CreateFileW;\nstatic decltype(WriteFile)* real_WriteFile = WriteFile;\nstatic decltype(GetOverlappedResult)* real_GetOverlappedResult = GetOverlappedResult;\n\nstatic std::map<HANDLE, std::string> g_handleToPath;\nstatic std::map<DWORD, std::string> g_ioctlMap;\n\n\n\/\/\n\/\/ Hooks SetupDiEnumDeviceInterfaces() API\n\/\/ \nBOOL WINAPI DetourSetupDiEnumDeviceInterfaces(\n\tHDEVINFO DeviceInfoSet,\n\tPSP_DEVINFO_DATA DeviceInfoData,\n\tconst GUID* InterfaceClassGuid,\n\tDWORD MemberIndex,\n\tPSP_DEVICE_INTERFACE_DATA DeviceInterfaceData\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"SetupDiEnumDeviceInterfaces\");\n\n\tauto retval = real_SetupDiEnumDeviceInterfaces(DeviceInfoSet, DeviceInfoData, InterfaceClassGuid, MemberIndex,\n\t                                               DeviceInterfaceData);\n\n\t_logger->info(\"InterfaceClassGuid = {{{0:X}-{1:X}-{2:X}-{3:X}{4:X}-{5:X}{6:X}{7:X}{8:X}{9:X}{10:X}}}, \"\n\t              \"return = 0x{11:X}, error = 0x{12:X}\",\n\t              InterfaceClassGuid->Data1, InterfaceClassGuid->Data2, InterfaceClassGuid->Data3,\n\t              InterfaceClassGuid->Data4[0], InterfaceClassGuid->Data4[1], InterfaceClassGuid->Data4[2],\n\t              InterfaceClassGuid->Data4[3],\n\t              InterfaceClassGuid->Data4[4], InterfaceClassGuid->Data4[5], InterfaceClassGuid->Data4[6],\n\t              InterfaceClassGuid->Data4[7],\n\t              retval, GetLastError());\n\n\treturn retval;\n}\n\n\/\/\n\/\/ Hooks CreateFileA() API\n\/\/ \nHANDLE WINAPI DetourCreateFileA(\n\tLPCSTR lpFileName,\n\tDWORD dwDesiredAccess,\n\tDWORD dwShareMode,\n\tLPSECURITY_ATTRIBUTES lpSecurityAttributes,\n\tDWORD dwCreationDisposition,\n\tDWORD dwFlagsAndAttributes,\n\tHANDLE hTemplateFile\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"CreateFileA\");\n\tstd::string path(lpFileName);\n\n\tconst bool isOfInterest = (path.rfind(\"\\\\\\\\\", 0) == 0);\n\n\tif (isOfInterest)\n\t\t_logger->info(\"lpFileName = {}\", path);\n\n\tconst auto handle = real_CreateFileA(\n\t\tlpFileName,\n\t\tdwDesiredAccess,\n\t\tdwShareMode,\n\t\tlpSecurityAttributes,\n\t\tdwCreationDisposition,\n\t\tdwFlagsAndAttributes,\n\t\thTemplateFile\n\t);\n\n\tif (handle != INVALID_HANDLE_VALUE)\n\t{\n\t\tg_handleToPath[handle] = path;\n\t\tif (isOfInterest)\n\t\t\t_logger->info(\"handle = {}, lpFileName = {}\", handle, path);\n\t}\n\n\treturn handle;\n}\n\n\/\/\n\/\/ Hooks CreateFileW() API\n\/\/ \nHANDLE WINAPI DetourCreateFileW(\n\tLPCWSTR lpFileName,\n\tDWORD dwDesiredAccess,\n\tDWORD dwShareMode,\n\tLPSECURITY_ATTRIBUTES lpSecurityAttributes,\n\tDWORD dwCreationDisposition,\n\tDWORD dwFlagsAndAttributes,\n\tHANDLE hTemplateFile\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"CreateFileW\");\n\tstd::string path(strconverter.to_bytes(lpFileName));\n\n\tconst bool isOfInterest = (path.rfind(\"\\\\\\\\\", 0) == 0);\n\n\tif (isOfInterest)\n\t\t_logger->info(\"lpFileName = {}\", path);\n\n\tconst auto handle = real_CreateFileW(\n\t\tlpFileName,\n\t\tdwDesiredAccess,\n\t\tdwShareMode,\n\t\tlpSecurityAttributes,\n\t\tdwCreationDisposition,\n\t\tdwFlagsAndAttributes,\n\t\thTemplateFile\n\t);\n\n\tif (handle != INVALID_HANDLE_VALUE)\n\t{\n\t\tg_handleToPath[handle] = path;\n\t\tif (isOfInterest)\n\t\t\t_logger->info(\"handle = {}, lpFileName = {}\", handle, path);\n\t}\n\n\treturn handle;\n}\n\n\/\/\n\/\/ Hooks WriteFile() API\n\/\/ \nBOOL WINAPI DetourWriteFile(\n\tHANDLE       hFile,\n\tLPCVOID      lpBuffer,\n\tDWORD        nNumberOfBytesToWrite,\n\tLPDWORD      lpNumberOfBytesWritten,\n\tLPOVERLAPPED lpOverlapped\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"WriteFile\");\n\n\tconst PUCHAR charInBuf = PUCHAR(lpBuffer);\n\tconst std::vector<char> inBuffer(charInBuf, charInBuf + nNumberOfBytesToWrite);\n\t\n\tconst auto ret =  real_WriteFile(hFile, lpBuffer, nNumberOfBytesToWrite, lpNumberOfBytesWritten, lpOverlapped);\n\tconst auto error = GetLastError();\n\t\n\t_logger->info(\"ret={}, lastError={} ({:04d}) -> {:Xpn}\",\n\t\tret,\n\t\terror,\n\t\tnNumberOfBytesToWrite,\n\t\tspdlog::to_hex(inBuffer)\n\t);\n\n\treturn ret;\n}\n\nBOOL WINAPI DetourGetOverlappedResult(\n\tHANDLE       hFile,\n\tLPOVERLAPPED lpOverlapped,\n\tLPDWORD      lpNumberOfBytesTransferred,\n\tBOOL         bWait\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"GetOverlappedResult\");\n\n\tconst auto ret = real_GetOverlappedResult(hFile, lpOverlapped, lpNumberOfBytesTransferred, bWait);\n\tconst auto error = GetLastError();\n\t\n\t_logger->info(\"ret={}, lastError={}, bytesWritten={}\",\n\t\tret,\n\t\terror,\n\t\t(lpNumberOfBytesTransferred) ? *lpNumberOfBytesTransferred : 0\n\t);\n\t\n\treturn ret;\n}\n\n\/\/\n\/\/ Hooks DeviceIoControl() API\n\/\/ \nBOOL WINAPI DetourDeviceIoControl(\n\tHANDLE hDevice,\n\tDWORD dwIoControlCode,\n\tLPVOID lpInBuffer,\n\tDWORD nInBufferSize,\n\tLPVOID lpOutBuffer,\n\tDWORD nOutBufferSize,\n\tLPDWORD lpBytesReturned,\n\tLPOVERLAPPED lpOverlapped\n)\n{\n\tstd::shared_ptr<spdlog::logger> _logger = spdlog::get(\"XInputHooker\")->clone(\"DeviceIoControl\");\n\n\tconst PUCHAR charInBuf = static_cast<PUCHAR>(lpInBuffer);\n\tconst std::vector<char> inBuffer(charInBuf, charInBuf + nInBufferSize);\n\n\tif (g_ioctlMap.count(dwIoControlCode))\n\t{\n\t\t_logger->info(\"[I] [{}] ({:04d}) -> {:Xpn}\",\n\t\t              g_ioctlMap[dwIoControlCode],\n\t\t              nInBufferSize,\n\t\t              spdlog::to_hex(inBuffer)\n\t\t);\n\t}\n\n\tDWORD tmpBytesReturned;\n\n\tconst auto retval = real_DeviceIoControl(\n\t\thDevice,\n\t\tdwIoControlCode,\n\t\tlpInBuffer,\n\t\tnInBufferSize,\n\t\tlpOutBuffer,\n\t\tnOutBufferSize,\n\t\t&tmpBytesReturned, \/\/ might be null, use our own variable\n\t\tlpOverlapped\n\t);\n\n\tif (lpBytesReturned)\n\t\t*lpBytesReturned = tmpBytesReturned;\n\n\tif (lpOutBuffer && nOutBufferSize > 0)\n\t{\n\t\tconst PUCHAR charOutBuf = static_cast<PUCHAR>(lpOutBuffer);\n\t\tconst auto bufSize = std::min(nOutBufferSize, tmpBytesReturned);\n\t\tconst std::vector<char> outBuffer(charOutBuf, charOutBuf + bufSize);\n\n\t\tif (g_ioctlMap.count(dwIoControlCode))\n\t\t{\n\t\t\t_logger->info(\"[O] [{}] ({:04d}) -> {:Xpn}\",\n\t\t\t              g_ioctlMap[dwIoControlCode],\n\t\t\t              bufSize,\n\t\t\t              spdlog::to_hex(outBuffer)\n\t\t\t);\n\t\t}\n\t}\n\n\treturn retval;\n}\n\nEXTERN_C IMAGE_DOS_HEADER __ImageBase;\n\nBOOL WINAPI DllMain(HINSTANCE dll_handle, DWORD reason, LPVOID reserved)\n{\n\tif (DetourIsHelperProcess())\n\t{\n\t\treturn TRUE;\n\t}\n\n\tswitch (reason)\n\t{\n\tcase DLL_PROCESS_ATTACH:\n\t\t{\n\t\t\tCHAR dllPath[MAX_PATH];\n\n\t\t\tGetModuleFileNameA((HINSTANCE)&__ImageBase, dllPath, MAX_PATH);\n\t\t\tPathRemoveFileSpecA(dllPath);\n\t\t\tg_dllDir = std::string(dllPath);\n\n\t\t\tauto logger = spdlog::basic_logger_mt(\n\t\t\t\t\"XInputHooker\",\n\t\t\t\tg_dllDir + \"\\\\XInputHooker.log\"\n\t\t\t);\n\n#if _DEBUG\n\t\t\tspdlog::set_level(spdlog::level::debug);\n\t\t\tlogger->flush_on(spdlog::level::debug);\n#else\n\t\tlogger->flush_on(spdlog::level::info);\n#endif\n\n\t\t\tset_default_logger(logger);\n\n\t\t\t\/\/\n\t\t\t\/\/ Load known IOCTL code definitions\n\t\t\t\/\/ \n\t\t\tJson::Value root;\n\t\t\tstd::ifstream ifs(g_dllDir + \"\\\\ioctls.json\");\n\t\t\tifs >> root;\n\n\t\t\tfor (auto& i : root)\n\t\t\t{\n\t\t\t\tg_ioctlMap[std::stoul(i[\"HexValue\"].asString(), nullptr, 16)] = i[\"Ioctl\"].asString();\n\t\t\t}\n\t\t}\n\n\t\tDisableThreadLibraryCalls(dll_handle);\n\t\tDetourRestoreAfterWith();\n\n\t\tDetourTransactionBegin();\n\t\tDetourUpdateThread(GetCurrentThread());\n\t\tDetourAttach(&static_cast<PVOID>(real_SetupDiEnumDeviceInterfaces), DetourSetupDiEnumDeviceInterfaces);\n\t\tDetourAttach(&static_cast<PVOID>(real_DeviceIoControl), DetourDeviceIoControl);\n\t\tDetourAttach(&static_cast<PVOID>(real_CreateFileA), DetourCreateFileA);\n\t\tDetourAttach(&static_cast<PVOID>(real_CreateFileW), DetourCreateFileW);\n\t\tDetourAttach(&static_cast<PVOID>(real_WriteFile), DetourWriteFile);\n\t\tDetourAttach(&static_cast<PVOID>(real_GetOverlappedResult), DetourGetOverlappedResult);\n\t\tDetourTransactionCommit();\n\n\t\tbreak;\n\n\tcase DLL_PROCESS_DETACH:\n\t\tDetourTransactionBegin();\n\t\tDetourUpdateThread(GetCurrentThread());\n\t\tDetourDetach(&static_cast<PVOID>(real_SetupDiEnumDeviceInterfaces), DetourSetupDiEnumDeviceInterfaces);\n\t\tDetourDetach(&static_cast<PVOID>(real_DeviceIoControl), DetourDeviceIoControl);\n\t\tDetourDetach(&static_cast<PVOID>(real_CreateFileA), DetourCreateFileA);\n\t\tDetourDetach(&static_cast<PVOID>(real_CreateFileW), DetourCreateFileW);\n\t\tDetourDetach(&static_cast<PVOID>(real_WriteFile), DetourWriteFile);\n\t\tDetourDetach(&static_cast<PVOID>(real_GetOverlappedResult), DetourGetOverlappedResult);\n\t\tDetourTransactionCommit();\n\t\tbreak;\n\t}\n\treturn TRUE;\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\/tab_contents\/tab_contents_container.h\"\n\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"chrome\/browser\/tab_contents\/interstitial_page.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/ui\/view_ids.h\"\n#include \"chrome\/browser\/ui\/views\/tab_contents\/native_tab_contents_container.h\"\n#include \"chrome\/common\/notification_details.h\"\n#include \"chrome\/common\/notification_source.h\"\n\n#if defined(TOUCH_UI)\n#include \"chrome\/browser\/ui\/views\/tab_contents\/native_tab_contents_container_gtk.h\"\n#include \"chrome\/browser\/ui\/views\/tab_contents\/tab_contents_view_views.h\"\n#include \"views\/border.h\"\n#include \"views\/fill_layout.h\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TabContentsContainer, public:\n\nTabContentsContainer::TabContentsContainer()\n    : native_container_(NULL),\n      tab_contents_(NULL),\n      reserved_area_delegate_(NULL) {\n  SetID(VIEW_ID_TAB_CONTAINER);\n}\n\nTabContentsContainer::~TabContentsContainer() {\n  if (tab_contents_)\n    RemoveObservers();\n}\n\nvoid TabContentsContainer::ChangeTabContents(TabContents* contents) {\n  if (tab_contents_) {\n#if !defined(TOUCH_UI)\n    native_container_->DetachContents(tab_contents_);\n#endif\n    tab_contents_->WasHidden();\n    RemoveObservers();\n  }\n#if !defined(TOUCH_UI)\n  TabContents* old_contents = tab_contents_;\n#endif\n  tab_contents_ = contents;\n  \/\/ When detaching the last tab of the browser ChangeTabContents is invoked\n  \/\/ with NULL. Don't attempt to do anything in that case.\n  if (tab_contents_) {\n#if defined(TOUCH_UI)\n    views::View *v = static_cast<TabContentsViewViews*>(contents->view());\n    \/\/ Guard against re-adding ourselves, which happens because the NULL\n    \/\/ value is ignored by the pre-existing if() above.\n    if (v->GetParent() != this) {\n      AddChildView(v);\n      SetLayoutManager(new views::FillLayout());\n      Layout();\n    }\n#else\n    RenderWidgetHostViewChanged(\n        old_contents ? old_contents->GetRenderWidgetHostView() : NULL,\n        tab_contents_->GetRenderWidgetHostView());\n    native_container_->AttachContents(tab_contents_);\n#endif\n    AddObservers();\n  }\n}\n\nvoid TabContentsContainer::TabContentsFocused(TabContents* tab_contents) {\n  if (native_container_)\n    native_container_->TabContentsFocused(tab_contents);\n}\n\nvoid TabContentsContainer::SetFastResize(bool fast_resize) {\n  if (native_container_)\n    native_container_->SetFastResize(fast_resize);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TabContentsContainer, NotificationObserver implementation:\n\nvoid TabContentsContainer::Observe(NotificationType type,\n                                   const NotificationSource& source,\n                                   const NotificationDetails& details) {\n  if (type == NotificationType::RENDER_VIEW_HOST_CHANGED) {\n    RenderViewHostSwitchedDetails* switched_details =\n        Details<RenderViewHostSwitchedDetails>(details).ptr();\n    RenderViewHostChanged(switched_details->old_host,\n                          switched_details->new_host);\n  } else if (type == NotificationType::TAB_CONTENTS_DESTROYED) {\n    TabContentsDestroyed(Source<TabContents>(source).ptr());\n  } else {\n    NOTREACHED();\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TabContentsContainer, View overrides:\n\nvoid TabContentsContainer::Layout() {\n#if defined(TOUCH_UI)\n  views::View::Layout();\n#else\n  if (native_container_) {\n    if (reserved_area_delegate_)\n      reserved_area_delegate_->UpdateReservedContentsRect(this);\n    native_container_->GetView()->SetBounds(0, 0, width(), height());\n    native_container_->GetView()->Layout();\n  }\n#endif\n}\n\nAccessibilityTypes::Role TabContentsContainer::GetAccessibleRole() {\n  return AccessibilityTypes::ROLE_WINDOW;\n}\n\nvoid TabContentsContainer::ViewHierarchyChanged(bool is_add,\n                                                views::View* parent,\n                                                views::View* child) {\n#if defined(TOUCH_UI)\n  views::View::ViewHierarchyChanged(is_add, parent, child);\n#else\n  if (is_add && child == this) {\n    native_container_ = NativeTabContentsContainer::CreateNativeContainer(this);\n    AddChildView(native_container_->GetView());\n  }\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TabContentsContainer, private:\n\nvoid TabContentsContainer::AddObservers() {\n  \/\/ TabContents can change their RenderViewHost and hence the HWND that is\n  \/\/ shown and getting focused.  We need to keep track of that so we install\n  \/\/ the focus subclass on the shown HWND so we intercept focus change events.\n  registrar_.Add(this,\n                 NotificationType::RENDER_VIEW_HOST_CHANGED,\n                 Source<NavigationController>(&tab_contents_->controller()));\n\n  registrar_.Add(this,\n                 NotificationType::TAB_CONTENTS_DESTROYED,\n                 Source<TabContents>(tab_contents_));\n}\n\nvoid TabContentsContainer::RemoveObservers() {\n  registrar_.RemoveAll();\n}\n\nvoid TabContentsContainer::RenderViewHostChanged(RenderViewHost* old_host,\n                                                 RenderViewHost* new_host) {\n#if defined(TOUCH_UI)\n  NOTIMPLEMENTED();  \/\/ TODO(anicolao)\n#else\n  if (new_host) {\n    RenderWidgetHostViewChanged(\n        old_host ? old_host->view() : NULL, new_host->view());\n  }\n  native_container_->RenderViewHostChanged(old_host, new_host);\n#endif\n}\n\nvoid TabContentsContainer::TabContentsDestroyed(TabContents* contents) {\n  \/\/ Sometimes, a TabContents is destroyed before we know about it. This allows\n  \/\/ us to clean up our state in case this happens.\n  DCHECK(contents == tab_contents_);\n  ChangeTabContents(NULL);\n}\n\nvoid TabContentsContainer::RenderWidgetHostViewChanged(\n    RenderWidgetHostView* old_view, RenderWidgetHostView* new_view) {\n  \/\/ Carry over the reserved rect, if possible.\n  if (old_view && new_view) {\n    new_view->set_reserved_contents_rect(old_view->reserved_contents_rect());\n  } else {\n    if (reserved_area_delegate_)\n      reserved_area_delegate_->UpdateReservedContentsRect(this);\n  }\n}\n<commit_msg>Remove undisplayed tabs from the views hierarchy because event delivery doesn't respect z-order.<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\/tab_contents\/tab_contents_container.h\"\n\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"chrome\/browser\/tab_contents\/interstitial_page.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/ui\/view_ids.h\"\n#include \"chrome\/browser\/ui\/views\/tab_contents\/native_tab_contents_container.h\"\n#include \"chrome\/common\/notification_details.h\"\n#include \"chrome\/common\/notification_source.h\"\n\n#if defined(TOUCH_UI)\n#include \"chrome\/browser\/ui\/views\/tab_contents\/native_tab_contents_container_gtk.h\"\n#include \"chrome\/browser\/ui\/views\/tab_contents\/tab_contents_view_views.h\"\n#include \"views\/border.h\"\n#include \"views\/fill_layout.h\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TabContentsContainer, public:\n\nTabContentsContainer::TabContentsContainer()\n    : native_container_(NULL),\n      tab_contents_(NULL),\n      reserved_area_delegate_(NULL) {\n  SetID(VIEW_ID_TAB_CONTAINER);\n}\n\nTabContentsContainer::~TabContentsContainer() {\n  if (tab_contents_)\n    RemoveObservers();\n}\n\nvoid TabContentsContainer::ChangeTabContents(TabContents* contents) {\n  if (tab_contents_) {\n#if !defined(TOUCH_UI)\n    native_container_->DetachContents(tab_contents_);\n#else\n    views::View *v = static_cast<TabContentsViewViews*>(tab_contents_->view());\n    RemoveChildView(v);\n#endif\n    tab_contents_->WasHidden();\n    RemoveObservers();\n  }\n#if !defined(TOUCH_UI)\n  TabContents* old_contents = tab_contents_;\n#endif\n  tab_contents_ = contents;\n  \/\/ When detaching the last tab of the browser ChangeTabContents is invoked\n  \/\/ with NULL. Don't attempt to do anything in that case.\n  if (tab_contents_) {\n#if defined(TOUCH_UI)\n    views::View *v = static_cast<TabContentsViewViews*>(contents->view());\n    \/\/ Guard against re-adding ourselves, which happens because the NULL\n    \/\/ value is ignored by the pre-existing if() above.\n    if (v->GetParent() != this) {\n      AddChildView(v);\n      SetLayoutManager(new views::FillLayout());\n      Layout();\n    }\n#else\n    RenderWidgetHostViewChanged(\n        old_contents ? old_contents->GetRenderWidgetHostView() : NULL,\n        tab_contents_->GetRenderWidgetHostView());\n    native_container_->AttachContents(tab_contents_);\n#endif\n    AddObservers();\n  }\n}\n\nvoid TabContentsContainer::TabContentsFocused(TabContents* tab_contents) {\n  if (native_container_)\n    native_container_->TabContentsFocused(tab_contents);\n}\n\nvoid TabContentsContainer::SetFastResize(bool fast_resize) {\n  if (native_container_)\n    native_container_->SetFastResize(fast_resize);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TabContentsContainer, NotificationObserver implementation:\n\nvoid TabContentsContainer::Observe(NotificationType type,\n                                   const NotificationSource& source,\n                                   const NotificationDetails& details) {\n  if (type == NotificationType::RENDER_VIEW_HOST_CHANGED) {\n    RenderViewHostSwitchedDetails* switched_details =\n        Details<RenderViewHostSwitchedDetails>(details).ptr();\n    RenderViewHostChanged(switched_details->old_host,\n                          switched_details->new_host);\n  } else if (type == NotificationType::TAB_CONTENTS_DESTROYED) {\n    TabContentsDestroyed(Source<TabContents>(source).ptr());\n  } else {\n    NOTREACHED();\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TabContentsContainer, View overrides:\n\nvoid TabContentsContainer::Layout() {\n#if defined(TOUCH_UI)\n  views::View::Layout();\n#else\n  if (native_container_) {\n    if (reserved_area_delegate_)\n      reserved_area_delegate_->UpdateReservedContentsRect(this);\n    native_container_->GetView()->SetBounds(0, 0, width(), height());\n    native_container_->GetView()->Layout();\n  }\n#endif\n}\n\nAccessibilityTypes::Role TabContentsContainer::GetAccessibleRole() {\n  return AccessibilityTypes::ROLE_WINDOW;\n}\n\nvoid TabContentsContainer::ViewHierarchyChanged(bool is_add,\n                                                views::View* parent,\n                                                views::View* child) {\n#if defined(TOUCH_UI)\n  views::View::ViewHierarchyChanged(is_add, parent, child);\n#else\n  if (is_add && child == this) {\n    native_container_ = NativeTabContentsContainer::CreateNativeContainer(this);\n    AddChildView(native_container_->GetView());\n  }\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TabContentsContainer, private:\n\nvoid TabContentsContainer::AddObservers() {\n  \/\/ TabContents can change their RenderViewHost and hence the HWND that is\n  \/\/ shown and getting focused.  We need to keep track of that so we install\n  \/\/ the focus subclass on the shown HWND so we intercept focus change events.\n  registrar_.Add(this,\n                 NotificationType::RENDER_VIEW_HOST_CHANGED,\n                 Source<NavigationController>(&tab_contents_->controller()));\n\n  registrar_.Add(this,\n                 NotificationType::TAB_CONTENTS_DESTROYED,\n                 Source<TabContents>(tab_contents_));\n}\n\nvoid TabContentsContainer::RemoveObservers() {\n  registrar_.RemoveAll();\n}\n\nvoid TabContentsContainer::RenderViewHostChanged(RenderViewHost* old_host,\n                                                 RenderViewHost* new_host) {\n#if defined(TOUCH_UI)\n  NOTIMPLEMENTED();  \/\/ TODO(anicolao)\n#else\n  if (new_host) {\n    RenderWidgetHostViewChanged(\n        old_host ? old_host->view() : NULL, new_host->view());\n  }\n  native_container_->RenderViewHostChanged(old_host, new_host);\n#endif\n}\n\nvoid TabContentsContainer::TabContentsDestroyed(TabContents* contents) {\n  \/\/ Sometimes, a TabContents is destroyed before we know about it. This allows\n  \/\/ us to clean up our state in case this happens.\n  DCHECK(contents == tab_contents_);\n  ChangeTabContents(NULL);\n}\n\nvoid TabContentsContainer::RenderWidgetHostViewChanged(\n    RenderWidgetHostView* old_view, RenderWidgetHostView* new_view) {\n  \/\/ Carry over the reserved rect, if possible.\n  if (old_view && new_view) {\n    new_view->set_reserved_contents_rect(old_view->reserved_contents_rect());\n  } else {\n    if (reserved_area_delegate_)\n      reserved_area_delegate_->UpdateReservedContentsRect(this);\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 *\/\n\n#ifndef PCL_KDTREE_KDTREE_IMPL_FLANN_H_\n#define PCL_KDTREE_KDTREE_IMPL_FLANN_H_\n\n#include \"pcl\/kdtree\/kdtree_flann.h\"\n#include <pcl\/console\/print.h>\n#include <flann\/flann.hpp>\n\nnamespace pcl\n{\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::setInputCloud (const PointCloudConstPtr &cloud, const IndicesConstPtr &indices)\n  {\n    cleanup ();   \/\/ Perform an automatic cleanup of structures\n\n    if (!initParameters())\n      return;\n\n    input_   = cloud;\n    indices_ = indices;\n    \n    if (input_ == NULL)\n      return;\n\n    m_lock_.lock ();\n    \/\/ Allocate enough data\n    if (!input_)\n    {\n      PCL_ERROR (\"[pcl::KdTreeANN::setInputCloud] Invalid input!\\n\");\n      return;\n    }\n    if (indices != NULL)\n      convertCloudToArray (*input_, *indices_);\n    else\n      convertCloudToArray (*input_);\n\n    initData ();\n    m_lock_.unlock ();\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT> int \n  KdTreeFLANN<PointT>::nearestKSearch (const PointT &point, int k, \n                                       std::vector<int> &k_indices, \n                                       std::vector<float> &k_distances)\n  {\n    if (!point_representation_->isValid (point))\n    {\n      \/\/PCL_ERROR_STREAM (\"[pcl::KdTreeFLANN::nearestKSearch] Invalid query point given!\" << point);\n      return (0);\n    }\n\n    if (k_indices.size() < (size_t)k) {\n        k_indices.resize(k);\n    }\n    if (k_distances.size() < (size_t)k) {\n        k_distances.resize(k);\n    }\n\n    std::vector<float> tmp (dim_);\n    point_representation_->vectorize ((PointT)point, tmp);\n\n    flann::Matrix<int> k_indices_mat (&k_indices[0], 1, k);\n    flann::Matrix<float> k_distances_mat (&k_distances[0], 1, k);\n    flann_index_->knnSearch (flann::Matrix<float>(&tmp[0], 1, dim_), k_indices_mat, k_distances_mat, k, flann::SearchParams (-1 ,epsilon_));\n\n    \/\/ Do mapping to original point cloud\n    if (!identity_mapping_) {\n      for (size_t i = 0; i < k_indices.size (); ++i)\n      {\n        int& neighbor_index = k_indices[i];\n        neighbor_index = index_mapping_[neighbor_index];\n      }\n    }\n\n    return (k);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  int KdTreeFLANN<PointT>::radiusSearch (const PointT &point, double radius, std::vector<int> &k_indices,\n                                          std::vector<float> &k_squared_distances, int max_nn) const\n  {\n    static flann::Matrix<int> indices_empty;\n    static flann::Matrix<float> dists_empty;\n\n    if (!point_representation_->isValid (point))\n    {\n      \/\/PCL_ERROR_STREAM (\"[pcl::KdTreeFLANN::radiusSearch] Invalid query point given!\" << point);\n      return 0;\n    }\n\n    std::vector<float> tmp(dim_);\n    point_representation_->vectorize ((PointT)point, tmp);\n    radius *= radius; \/\/ flann uses squared radius\n\n    size_t size;\n    if (indices_ == NULL) \/\/ no indices set, use full size of point cloud:\n      size = input_->points.size ();\n    else\n      size = indices_->size ();\n\n    int neighbors_in_radius = 0;\n    if (k_indices.size () == size && k_squared_distances.size () == size)  \/\/ preallocated vectors\n    {\n      \/\/ if using preallocated vectors we ignore max_nn as we are sure to have enought space\n      \/\/ to store all neighbors found in radius\n      flann::Matrix<int> k_indices_mat (&k_indices[0], 1, k_indices.size());\n      flann::Matrix<float> k_distances_mat (&k_squared_distances[0], 1, k_squared_distances.size());\n      neighbors_in_radius = flann_index_->radiusSearch (flann::Matrix<float>(&tmp[0], 1, dim_),\n          k_indices_mat, k_distances_mat, radius, flann::SearchParams (-1, epsilon_, sorted_));\n    }\n    else \/\/ need to do search twice, first to find how many neighbors and allocate the vectors\n    {\n      neighbors_in_radius = flann_index_->radiusSearch (flann::Matrix<float>(&tmp[0], 1, dim_),\n          indices_empty, dists_empty, radius, flann::SearchParams (-1, epsilon_, sorted_));\n      if (max_nn > 0) \n      {\n        neighbors_in_radius = std::min(neighbors_in_radius, max_nn); \n      }\n      k_indices.resize (neighbors_in_radius);\n      k_squared_distances.resize (neighbors_in_radius);\n      if (neighbors_in_radius == 0)\n      {\n        return (0);\n      }\n\n      flann::Matrix<int> k_indices_mat (&k_indices[0], 1, k_indices.size());\n      flann::Matrix<float> k_distances_mat (&k_squared_distances[0], 1, k_squared_distances.size());\n      flann_index_->radiusSearch (flann::Matrix<float>(&tmp[0], 1, dim_),\n          k_indices_mat, k_distances_mat, radius, flann::SearchParams (-1, epsilon_, sorted_));\n\n    }\n\n    \/\/ Do mapping to original point cloud\n    if (!identity_mapping_) {\n      for (int i = 0; i < neighbors_in_radius; ++i)\n      {\n        int& neighbor_index = k_indices[i];\n        neighbor_index = index_mapping_[neighbor_index];\n      }\n    }\n\n    return (neighbors_in_radius);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::cleanup ()\n  {\n    delete flann_index_;\n\n    m_lock_.lock ();\n    \/\/ Data array cleanup\n    free (cloud_);\n    cloud_ = NULL;\n    index_mapping_.clear();\n\n    if (indices_)\n      indices_.reset ();\n\n    m_lock_.unlock ();\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  bool KdTreeFLANN<PointT>::initParameters ()\n  {\n    epsilon_ = 0.0;   \/\/ default error bound value\n    dim_ = point_representation_->getNumberOfDimensions (); \/\/ Number of dimensions - default is 3 = xyz\n    \/\/ Create the kd_tree representation\n    return (true);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::initData ()\n  {\n    flann_index_ = new FLANNIndex(flann::Matrix<float>(cloud_, index_mapping_.size(), dim_),\n\t\t\t  \t  \t  \t  \t  \t  flann::KDTreeSingleIndexParams(15)); \/\/ max 15 points\/leaf\n    flann_index_->buildIndex();\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::convertCloudToArray (const PointCloud &ros_cloud)\n  {\n    \/\/ No point in doing anything if the array is empty\n    if (ros_cloud.points.empty ())\n    {\n      cloud_ = NULL;\n      return;\n    }\n\n    int original_no_of_points = ros_cloud.points.size();\n\n    cloud_ = (float*)malloc (original_no_of_points * dim_ * sizeof(float));\n    float* cloud_ptr = cloud_;\n    index_mapping_.reserve(original_no_of_points);\n    identity_mapping_ = true;\n\n    for (int cloud_index = 0; cloud_index < original_no_of_points; ++cloud_index)\n    {\n      const PointT point = ros_cloud.points[cloud_index];\n      \/\/ Check if the point is invalid\n      if (!point_representation_->isValid(point)) {\n        identity_mapping_ = false;\n        continue;\n      }\n\n      index_mapping_.push_back(cloud_index);\n\n      point_representation_->vectorize(point, cloud_ptr);\n      cloud_ptr += dim_;\n    }\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::convertCloudToArray (const PointCloud &ros_cloud, const std::vector<int> &indices)\n  {\n    \/\/ No point in doing anything if the array is empty\n    if (ros_cloud.points.empty ())\n    {\n      cloud_ = NULL;\n      return;\n    }\n\n    int original_no_of_points = indices.size();\n\n    cloud_ = (float*)malloc (original_no_of_points * dim_ * sizeof (float));\n    float* cloud_ptr = cloud_;\n    index_mapping_.reserve(original_no_of_points);\n    identity_mapping_ = true;\n\n    for (int indices_index = 0; indices_index < original_no_of_points; ++indices_index)\n    {\n      int cloud_index = indices[indices_index];\n      const PointT point = ros_cloud.points[cloud_index];\n      \/\/ Check if the point is invalid\n      if (!point_representation_->isValid(point)) {\n        identity_mapping_ = false;\n        continue;\n      }\n\n      index_mapping_.push_back(indices_index);  \/\/ If the returned index should be for the indices vector\n      \/\/index_mapping_.push_back(cloud_index);  \/\/ If the returned index should be for the ros cloud\n      \n      point_representation_->vectorize(point, cloud_ptr);\n      cloud_ptr += dim_;\n    }\n  }\n  \n\n}  \/\/ end namespace\n\n#define PCL_INSTANTIATE_KdTreeFLANN(T) template class PCL_EXPORTS pcl::KdTreeFLANN<T>;\n\n#endif  \/\/#ifndef _PCL_KDTREE_KDTREE_IMPL_FLANN_H_\n\n<commit_msg>Fixing brackets according to PCL code guidelines<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 *\/\n\n#ifndef PCL_KDTREE_KDTREE_IMPL_FLANN_H_\n#define PCL_KDTREE_KDTREE_IMPL_FLANN_H_\n\n#include \"pcl\/kdtree\/kdtree_flann.h\"\n#include <pcl\/console\/print.h>\n#include <flann\/flann.hpp>\n\nnamespace pcl\n{\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::setInputCloud (const PointCloudConstPtr &cloud, const IndicesConstPtr &indices)\n  {\n    cleanup ();   \/\/ Perform an automatic cleanup of structures\n\n    if (!initParameters())\n      return;\n\n    input_   = cloud;\n    indices_ = indices;\n    \n    if (input_ == NULL)\n      return;\n\n    m_lock_.lock ();\n    \/\/ Allocate enough data\n    if (!input_)\n    {\n      PCL_ERROR (\"[pcl::KdTreeANN::setInputCloud] Invalid input!\\n\");\n      return;\n    }\n    if (indices != NULL)\n      convertCloudToArray (*input_, *indices_);\n    else\n      convertCloudToArray (*input_);\n\n    initData ();\n    m_lock_.unlock ();\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT> int \n  KdTreeFLANN<PointT>::nearestKSearch (const PointT &point, int k, \n                                       std::vector<int> &k_indices, \n                                       std::vector<float> &k_distances)\n  {\n    if (!point_representation_->isValid (point))\n    {\n      \/\/PCL_ERROR_STREAM (\"[pcl::KdTreeFLANN::nearestKSearch] Invalid query point given!\" << point);\n      return (0);\n    }\n\n    if (k_indices.size() < (size_t)k)\n    {\n        k_indices.resize(k);\n    }\n    if (k_distances.size() < (size_t)k) \n    {\n        k_distances.resize(k);\n    }\n\n    std::vector<float> tmp (dim_);\n    point_representation_->vectorize ((PointT)point, tmp);\n\n    flann::Matrix<int> k_indices_mat (&k_indices[0], 1, k);\n    flann::Matrix<float> k_distances_mat (&k_distances[0], 1, k);\n    flann_index_->knnSearch (flann::Matrix<float>(&tmp[0], 1, dim_), k_indices_mat, k_distances_mat, k, flann::SearchParams (-1 ,epsilon_));\n\n    \/\/ Do mapping to original point cloud\n    if (!identity_mapping_) {\n      for (size_t i = 0; i < k_indices.size (); ++i)\n      {\n        int& neighbor_index = k_indices[i];\n        neighbor_index = index_mapping_[neighbor_index];\n      }\n    }\n\n    return (k);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  int KdTreeFLANN<PointT>::radiusSearch (const PointT &point, double radius, std::vector<int> &k_indices,\n                                          std::vector<float> &k_squared_distances, int max_nn) const\n  {\n    static flann::Matrix<int> indices_empty;\n    static flann::Matrix<float> dists_empty;\n\n    if (!point_representation_->isValid (point))\n    {\n      \/\/PCL_ERROR_STREAM (\"[pcl::KdTreeFLANN::radiusSearch] Invalid query point given!\" << point);\n      return 0;\n    }\n\n    std::vector<float> tmp(dim_);\n    point_representation_->vectorize ((PointT)point, tmp);\n    radius *= radius; \/\/ flann uses squared radius\n\n    size_t size;\n    if (indices_ == NULL) \/\/ no indices set, use full size of point cloud:\n      size = input_->points.size ();\n    else\n      size = indices_->size ();\n\n    int neighbors_in_radius = 0;\n    if (k_indices.size () == size && k_squared_distances.size () == size)  \/\/ preallocated vectors\n    {\n      \/\/ if using preallocated vectors we ignore max_nn as we are sure to have enought space\n      \/\/ to store all neighbors found in radius\n      flann::Matrix<int> k_indices_mat (&k_indices[0], 1, k_indices.size());\n      flann::Matrix<float> k_distances_mat (&k_squared_distances[0], 1, k_squared_distances.size());\n      neighbors_in_radius = flann_index_->radiusSearch (flann::Matrix<float>(&tmp[0], 1, dim_),\n          k_indices_mat, k_distances_mat, radius, flann::SearchParams (-1, epsilon_, sorted_));\n    }\n    else \/\/ need to do search twice, first to find how many neighbors and allocate the vectors\n    {\n      neighbors_in_radius = flann_index_->radiusSearch (flann::Matrix<float>(&tmp[0], 1, dim_),\n          indices_empty, dists_empty, radius, flann::SearchParams (-1, epsilon_, sorted_));\n      if (max_nn > 0) \n      {\n        neighbors_in_radius = std::min(neighbors_in_radius, max_nn); \n      }\n      k_indices.resize (neighbors_in_radius);\n      k_squared_distances.resize (neighbors_in_radius);\n      if (neighbors_in_radius == 0)\n      {\n        return (0);\n      }\n\n      flann::Matrix<int> k_indices_mat (&k_indices[0], 1, k_indices.size());\n      flann::Matrix<float> k_distances_mat (&k_squared_distances[0], 1, k_squared_distances.size());\n      flann_index_->radiusSearch (flann::Matrix<float>(&tmp[0], 1, dim_),\n          k_indices_mat, k_distances_mat, radius, flann::SearchParams (-1, epsilon_, sorted_));\n\n    }\n\n    \/\/ Do mapping to original point cloud\n    if (!identity_mapping_) {\n      for (int i = 0; i < neighbors_in_radius; ++i)\n      {\n        int& neighbor_index = k_indices[i];\n        neighbor_index = index_mapping_[neighbor_index];\n      }\n    }\n\n    return (neighbors_in_radius);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::cleanup ()\n  {\n    delete flann_index_;\n\n    m_lock_.lock ();\n    \/\/ Data array cleanup\n    free (cloud_);\n    cloud_ = NULL;\n    index_mapping_.clear();\n\n    if (indices_)\n      indices_.reset ();\n\n    m_lock_.unlock ();\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  bool KdTreeFLANN<PointT>::initParameters ()\n  {\n    epsilon_ = 0.0;   \/\/ default error bound value\n    dim_ = point_representation_->getNumberOfDimensions (); \/\/ Number of dimensions - default is 3 = xyz\n    \/\/ Create the kd_tree representation\n    return (true);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::initData ()\n  {\n    flann_index_ = new FLANNIndex(flann::Matrix<float>(cloud_, index_mapping_.size(), dim_),\n\t\t\t  \t  \t  \t  \t  \t  flann::KDTreeSingleIndexParams(15)); \/\/ max 15 points\/leaf\n    flann_index_->buildIndex();\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::convertCloudToArray (const PointCloud &ros_cloud)\n  {\n    \/\/ No point in doing anything if the array is empty\n    if (ros_cloud.points.empty ())\n    {\n      cloud_ = NULL;\n      return;\n    }\n\n    int original_no_of_points = ros_cloud.points.size();\n\n    cloud_ = (float*)malloc (original_no_of_points * dim_ * sizeof(float));\n    float* cloud_ptr = cloud_;\n    index_mapping_.reserve(original_no_of_points);\n    identity_mapping_ = true;\n\n    for (int cloud_index = 0; cloud_index < original_no_of_points; ++cloud_index)\n    {\n      const PointT point = ros_cloud.points[cloud_index];\n      \/\/ Check if the point is invalid\n      if (!point_representation_->isValid(point)) {\n        identity_mapping_ = false;\n        continue;\n      }\n\n      index_mapping_.push_back(cloud_index);\n\n      point_representation_->vectorize(point, cloud_ptr);\n      cloud_ptr += dim_;\n    }\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  template <typename PointT>\n  void KdTreeFLANN<PointT>::convertCloudToArray (const PointCloud &ros_cloud, const std::vector<int> &indices)\n  {\n    \/\/ No point in doing anything if the array is empty\n    if (ros_cloud.points.empty ())\n    {\n      cloud_ = NULL;\n      return;\n    }\n\n    int original_no_of_points = indices.size();\n\n    cloud_ = (float*)malloc (original_no_of_points * dim_ * sizeof (float));\n    float* cloud_ptr = cloud_;\n    index_mapping_.reserve(original_no_of_points);\n    identity_mapping_ = true;\n\n    for (int indices_index = 0; indices_index < original_no_of_points; ++indices_index)\n    {\n      int cloud_index = indices[indices_index];\n      const PointT point = ros_cloud.points[cloud_index];\n      \/\/ Check if the point is invalid\n      if (!point_representation_->isValid(point)) {\n        identity_mapping_ = false;\n        continue;\n      }\n\n      index_mapping_.push_back(indices_index);  \/\/ If the returned index should be for the indices vector\n      \/\/index_mapping_.push_back(cloud_index);  \/\/ If the returned index should be for the ros cloud\n      \n      point_representation_->vectorize(point, cloud_ptr);\n      cloud_ptr += dim_;\n    }\n  }\n  \n\n}  \/\/ end namespace\n\n#define PCL_INSTANTIATE_KdTreeFLANN(T) template class PCL_EXPORTS pcl::KdTreeFLANN<T>;\n\n#endif  \/\/#ifndef _PCL_KDTREE_KDTREE_IMPL_FLANN_H_\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2009-2020 Intel Corporation\n\/\/ SPDX-License-Identifier: Apache-2.0\n \n#include \"curve_intersector_virtual.h\"\n#include \"intersector_epilog.h\"\n\n#include \"..\/subdiv\/bezier_curve.h\"\n#include \"..\/subdiv\/bspline_curve.h\"\n#include \"..\/subdiv\/hermite_curve.h\"\n#include \"..\/subdiv\/catmullrom_curve.h\"\n\n#include \"spherei_intersector.h\"\n#include \"disci_intersector.h\"\n\n#include \"linei_intersector.h\"\n\n#include \"curveNi_intersector.h\"\n#include \"curveNv_intersector.h\"\n#include \"curveNi_mb_intersector.h\"\n\n#include \"curve_intersector_distance.h\"\n#include \"curve_intersector_ribbon.h\"\n#include \"curve_intersector_oriented.h\"\n#include \"curve_intersector_sweep.h\"\n\nnamespace embree\n{\n  namespace isa\n  {\n#if defined (__AVX__)\n    \n    VirtualCurveIntersector* VirtualCurveIntersector8i()\n    {\n      static VirtualCurveIntersector function_local_static_prim;\n      function_local_static_prim.vtbl[Geometry::GTY_SPHERE_POINT] = SphereNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_DISC_POINT] = DiscNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_DISC_POINT] = OrientedDiscNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_LINEAR_CURVE ] = LinearRoundConeNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_LINEAR_CURVE ] = LinearRibbonNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BEZIER_CURVE] = CurveNiIntersectors <BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BEZIER_CURVE ] = RibbonNiIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BEZIER_CURVE] = OrientedCurveNiIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BSPLINE_CURVE] = CurveNiIntersectors <BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BSPLINE_CURVE ] = RibbonNiIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BSPLINE_CURVE] = OrientedCurveNiIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_HERMITE_CURVE] = HermiteCurveNiIntersectors <HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_HERMITE_CURVE ] = HermiteRibbonNiIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_HERMITE_CURVE] = HermiteOrientedCurveNiIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_CATMULL_ROM_CURVE] = CurveNiIntersectors <CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_CATMULL_ROM_CURVE ] = RibbonNiIntersectors<CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_CATMULL_ROM_CURVE] = OrientedCurveNiIntersectors<CatmullRomCurveT,8>();\n      return &function_local_static_prim;\n    }\n\n    VirtualCurveIntersector* VirtualCurveIntersector8v()\n    {\n      static VirtualCurveIntersector function_local_static_prim;\n      function_local_static_prim.vtbl[Geometry::GTY_SPHERE_POINT] = SphereNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_DISC_POINT] = DiscNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_DISC_POINT] = OrientedDiscNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_LINEAR_CURVE ] = LinearRoundConeNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_LINEAR_CURVE ] = LinearRibbonNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BEZIER_CURVE] = CurveNvIntersectors <BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BEZIER_CURVE ] = RibbonNvIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BEZIER_CURVE] = OrientedCurveNiIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BSPLINE_CURVE] = CurveNvIntersectors <BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BSPLINE_CURVE ] = RibbonNvIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BSPLINE_CURVE] = OrientedCurveNiIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_HERMITE_CURVE] = HermiteCurveNiIntersectors <HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_HERMITE_CURVE ] = HermiteRibbonNiIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_HERMITE_CURVE] = HermiteOrientedCurveNiIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_CATMULL_ROM_CURVE] = CurveNiIntersectors <CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_CATMULL_ROM_CURVE ] = RibbonNiIntersectors<CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_CATMULL_ROM_CURVE] = OrientedCurveNiIntersectors<CatmullRomCurveT,8>();\n      return &function_local_static_prim;\n    }\n    \n    VirtualCurveIntersector* VirtualCurveIntersector8iMB()\n    {\n      static VirtualCurveIntersector function_local_static_prim;\n      function_local_static_prim.vtbl[Geometry::GTY_SPHERE_POINT] = SphereNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_DISC_POINT] = DiscNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_DISC_POINT] = OrientedDiscNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_LINEAR_CURVE ] = LinearRoundConeNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_LINEAR_CURVE ] = LinearRibbonNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BEZIER_CURVE] = CurveNiMBIntersectors <BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BEZIER_CURVE ] = RibbonNiMBIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BEZIER_CURVE] = OrientedCurveNiMBIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BSPLINE_CURVE] = CurveNiMBIntersectors <BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BSPLINE_CURVE ] = RibbonNiMBIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BSPLINE_CURVE] = OrientedCurveNiMBIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_HERMITE_CURVE] = HermiteCurveNiMBIntersectors <HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_HERMITE_CURVE ] = HermiteRibbonNiMBIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_HERMITE_CURVE] = HermiteOrientedCurveNiMBIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_CATMULL_ROM_CURVE] = CurveNiMBIntersectors <CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_CATMULL_ROM_CURVE ] = RibbonNiMBIntersectors<CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_CATMULL_ROM_CURVE] = OrientedCurveNiMBIntersectors<CatmullRomCurveT,8>();\n      return &function_local_static_prim;\n    }\n  \n#endif\n  }\n}\n<commit_msg>add intersectors for 8 wide<commit_after>\/\/ Copyright 2009-2020 Intel Corporation\n\/\/ SPDX-License-Identifier: Apache-2.0\n \n#include \"curve_intersector_virtual.h\"\n#include \"intersector_epilog.h\"\n\n#include \"..\/subdiv\/bezier_curve.h\"\n#include \"..\/subdiv\/bspline_curve.h\"\n#include \"..\/subdiv\/hermite_curve.h\"\n#include \"..\/subdiv\/catmullrom_curve.h\"\n\n#include \"spherei_intersector.h\"\n#include \"disci_intersector.h\"\n\n#include \"linei_intersector.h\"\n\n#include \"curveNi_intersector.h\"\n#include \"curveNv_intersector.h\"\n#include \"curveNi_mb_intersector.h\"\n\n#include \"curve_intersector_distance.h\"\n#include \"curve_intersector_ribbon.h\"\n#include \"curve_intersector_oriented.h\"\n#include \"curve_intersector_sweep.h\"\n\nnamespace embree\n{\n  namespace isa\n  {\n#if defined (__AVX__)\n    \n    VirtualCurveIntersector* VirtualCurveIntersector8i()\n    {\n      static VirtualCurveIntersector function_local_static_prim;\n      function_local_static_prim.vtbl[Geometry::GTY_SPHERE_POINT] = SphereNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_DISC_POINT] = DiscNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_DISC_POINT] = OrientedDiscNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_CONE_LINEAR_CURVE ] = LinearConeNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_LINEAR_CURVE ] = LinearRoundConeNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_LINEAR_CURVE ] = LinearRibbonNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BEZIER_CURVE] = CurveNiIntersectors <BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BEZIER_CURVE ] = RibbonNiIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BEZIER_CURVE] = OrientedCurveNiIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BSPLINE_CURVE] = CurveNiIntersectors <BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BSPLINE_CURVE ] = RibbonNiIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BSPLINE_CURVE] = OrientedCurveNiIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_HERMITE_CURVE] = HermiteCurveNiIntersectors <HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_HERMITE_CURVE ] = HermiteRibbonNiIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_HERMITE_CURVE] = HermiteOrientedCurveNiIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_CATMULL_ROM_CURVE] = CurveNiIntersectors <CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_CATMULL_ROM_CURVE ] = RibbonNiIntersectors<CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_CATMULL_ROM_CURVE] = OrientedCurveNiIntersectors<CatmullRomCurveT,8>();\n      return &function_local_static_prim;\n    }\n\n    VirtualCurveIntersector* VirtualCurveIntersector8v()\n    {\n      static VirtualCurveIntersector function_local_static_prim;\n      function_local_static_prim.vtbl[Geometry::GTY_SPHERE_POINT] = SphereNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_DISC_POINT] = DiscNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_DISC_POINT] = OrientedDiscNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_CONE_LINEAR_CURVE ] = LinearConeNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_LINEAR_CURVE ] = LinearRoundConeNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_LINEAR_CURVE ] = LinearRibbonNiIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BEZIER_CURVE] = CurveNvIntersectors <BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BEZIER_CURVE ] = RibbonNvIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BEZIER_CURVE] = OrientedCurveNiIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BSPLINE_CURVE] = CurveNvIntersectors <BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BSPLINE_CURVE ] = RibbonNvIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BSPLINE_CURVE] = OrientedCurveNiIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_HERMITE_CURVE] = HermiteCurveNiIntersectors <HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_HERMITE_CURVE ] = HermiteRibbonNiIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_HERMITE_CURVE] = HermiteOrientedCurveNiIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_CATMULL_ROM_CURVE] = CurveNiIntersectors <CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_CATMULL_ROM_CURVE ] = RibbonNiIntersectors<CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_CATMULL_ROM_CURVE] = OrientedCurveNiIntersectors<CatmullRomCurveT,8>();\n      return &function_local_static_prim;\n    }\n    \n    VirtualCurveIntersector* VirtualCurveIntersector8iMB()\n    {\n      static VirtualCurveIntersector function_local_static_prim;\n      function_local_static_prim.vtbl[Geometry::GTY_SPHERE_POINT] = SphereNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_DISC_POINT] = DiscNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_DISC_POINT] = OrientedDiscNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_CONE_LINEAR_CURVE ] = LinearConeNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_LINEAR_CURVE ] = LinearRoundConeNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_LINEAR_CURVE ] = LinearRibbonNiMBIntersectors<8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BEZIER_CURVE] = CurveNiMBIntersectors <BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BEZIER_CURVE ] = RibbonNiMBIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BEZIER_CURVE] = OrientedCurveNiMBIntersectors<BezierCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_BSPLINE_CURVE] = CurveNiMBIntersectors <BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_BSPLINE_CURVE ] = RibbonNiMBIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_BSPLINE_CURVE] = OrientedCurveNiMBIntersectors<BSplineCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_HERMITE_CURVE] = HermiteCurveNiMBIntersectors <HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_HERMITE_CURVE ] = HermiteRibbonNiMBIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_HERMITE_CURVE] = HermiteOrientedCurveNiMBIntersectors<HermiteCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ROUND_CATMULL_ROM_CURVE] = CurveNiMBIntersectors <CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_FLAT_CATMULL_ROM_CURVE ] = RibbonNiMBIntersectors<CatmullRomCurveT,8>();\n      function_local_static_prim.vtbl[Geometry::GTY_ORIENTED_CATMULL_ROM_CURVE] = OrientedCurveNiMBIntersectors<CatmullRomCurveT,8>();\n      return &function_local_static_prim;\n    }\n  \n#endif\n  }\n}\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 * Simple ranger example, using VL53L0X Time-of-flight range sensor I2C device.\n * This program uses FastArduino VL53L0X support API.\n * It checks conditions of use of GPIO pin.\n * \n * Wiring:\n * - on ATmega328P based boards (including Arduino UNO):\n *   - A4 (PC4, SDA): connected to VL53L0X SDA pin\n *   - A5 (PC5, SCL): connected to VL53L0X SCL pin\n *   - D2 (EXT0): connected to VL53L0X GPIO pin\n *\/\n\n#include <fastarduino\/gpio.h>\n#include <fastarduino\/int.h>\n#include <fastarduino\/realtime_timer.h>\n#include <fastarduino\/time.h>\n#include <fastarduino\/uart.h>\n#include <fastarduino\/i2c_handler.h>\n#include <fastarduino\/devices\/vl53l0x.h>\n\n\/\/ #define FORCE_SYNC\n\nstatic constexpr const i2c::I2CMode MODE = i2c::I2CMode::FAST;\nstatic constexpr const board::ExternalInterruptPin GPIO = board::ExternalInterruptPin::D2_PD2_EXT0;\n\nstatic constexpr const board::USART UART = board::USART::USART0;\nstatic constexpr const uint8_t OUTPUT_BUFFER_SIZE = 128;\nstatic char output_buffer[OUTPUT_BUFFER_SIZE];\n\nREGISTER_RTT_ISR(0)\nREGISTER_UATX_ISR(0)\n\n#if I2C_TRUE_ASYNC and not defined(FORCE_SYNC)\nusing MANAGER = i2c::I2CAsyncManager<MODE, i2c::I2CErrorPolicy::CLEAR_ALL_COMMANDS>;\nstatic constexpr const uint8_t I2C_BUFFER_SIZE = 32;\nstatic MANAGER::I2CCOMMAND i2c_buffer[I2C_BUFFER_SIZE];\nREGISTER_I2C_ISR(MANAGER)\n#else\nusing MANAGER = i2c::I2CSyncManager<MODE>;\n#endif\n\nusing streams::dec;\nusing streams::hex;\nusing streams::fixed;\nusing streams::endl;\nusing streams::flush;\n\nusing namespace devices::vl53l0x;\nusing TOF = VL53L0X<MANAGER>;\n\n#define CHECK_OK(STATEMENT) if (! STATEMENT) out << F(#STATEMENT) << F(\" ERROR!\") << endl\n\nclass ToFController\n{\npublic:\n\tToFController(TOF& tof) : tof_{tof}\n\t{\n\t\tinterrupt::register_handler(*this);\n\t\tsignal_.enable();\n\t}\n\n\tvoid await_gpio()\n\t{\n\t\twhile (!gpio_)\n\t\t{\n\t\t\ttime::yield();\n\t\t}\n\t\tgpio_ = false;\n\t}\n\nprivate:\n\tvoid gpio_raised()\n\t{\n\t\tgpio_ = true;\n\t}\n\n\tTOF& tof_;\n\tgpio::FAST_EXT_PIN<GPIO> gpio_pin_{gpio::PinMode::INPUT};\n\tinterrupt::INTSignal<GPIO> signal_{interrupt::InterruptTrigger::FALLING_EDGE};\n\tvolatile bool gpio_ = false;\n\n\tDECL_INT_ISR_HANDLERS_FRIEND\n};\n\nREGISTER_INT_ISR_METHOD(0, GPIO, ToFController, &ToFController::gpio_raised)\n\nstatic void loop_gpio(\n\tstreams::ostream& out, timer::RTT<board::Timer::TIMER0>& rtt, ToFController& controller, TOF& tof)\n{\n\tout << F(\"await GPIO\") << endl;\n\t\/\/ Limit loop to 1'\n\tfor (uint8_t i = 0; i < 60; ++i)\n\t{\n\t\tuint16_t range = 0;\n\t\trtt.millis(0);\n\t\tcontroller.await_gpio();\n\t\ttime::RTTTime time1 = rtt.time();\n\n\t\trtt.millis(0);\n\t\tCHECK_OK(tof.get_direct_range(range));\n\t\ttime::RTTTime time2 = rtt.time();\n\t\t\/\/ Clear interrupt\n\t\tCHECK_OK(tof.clear_interrupt());\n\n\t\tout << F(\"GPIO after \") << dec << time1.millis() << \"ms \" << time1.micros() << \"us\" << streams::endl;\n\t\tout << F(\"Range after \") << time2.millis() << \"ms \" << time2.micros() << \"us\" << streams::endl;\n\t\tout << F(\"range = \") << range << F(\"mm\") << endl;\n\t}\n}\n\nint main() __attribute__((OS_main));\nint main()\n{\n\tboard::init();\n\tsei();\n\n\t\/\/ open UART for traces\n\tserial::hard::UATX<UART> uart{output_buffer};\n\tstreams::ostream out = uart.out();\n\tuart.begin(115200);\n\tout << streams::boolalpha;\n\n\ttimer::RTT<board::Timer::TIMER0> rtt;\n\trtt.begin();\n\n\t\/\/ Initialize I2C async handler\n#if I2C_TRUE_ASYNC and not defined(FORCE_SYNC)\n\tMANAGER manager{i2c_buffer};\n#else\n\tMANAGER manager;\n#endif\n\n\tTOF tof{manager};\n\tmanager.begin();\n\tToFController controller{tof};\n\n\tuint8_t value = 0;\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\n\tCHECK_OK(tof.begin(Profile::STANDARD));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\n\tout << F(\"GPIOSettings::sample_ready()\") << endl;\n\tCHECK_OK(tof.set_GPIO_settings(GPIOSettings::sample_ready()));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\tCHECK_OK(tof.start_continuous_ranging(1000));\n\tloop_gpio(out, rtt, controller, tof);\n\n\tout << F(\"GPIOSettings::low_threshold(200)\") << endl;\n\tCHECK_OK(tof.set_GPIO_settings(GPIOSettings::low_threshold(200)));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\tCHECK_OK(tof.start_continuous_ranging(1000));\n\tloop_gpio(out, rtt, controller, tof);\n\n\tout << F(\"GPIOSettings::high_threshold(400)\") << endl;\n\tCHECK_OK(tof.set_GPIO_settings(GPIOSettings::high_threshold(400)));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\tCHECK_OK(tof.start_continuous_ranging(1000));\n\tloop_gpio(out, rtt, controller, tof);\n\n\tout << F(\"GPIOSettings::out_of_window(200, 400)\") << endl;\n\tCHECK_OK(tof.set_GPIO_settings(GPIOSettings::out_of_window(200, 400)));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\tCHECK_OK(tof.start_continuous_ranging(1000));\n\tloop_gpio(out, rtt, controller, tof);\n\n\ttof.stop_continuous_ranging();\n\tmanager.end();\n\n\tout << F(\"Finished!\") << endl;\n}\n<commit_msg>Shorten timing of VL53L0X example<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 * Simple ranger example, using VL53L0X Time-of-flight range sensor I2C device.\n * This program uses FastArduino VL53L0X support API.\n * It checks conditions of use of GPIO pin.\n * \n * Wiring:\n * - on ATmega328P based boards (including Arduino UNO):\n *   - A4 (PC4, SDA): connected to VL53L0X SDA pin\n *   - A5 (PC5, SCL): connected to VL53L0X SCL pin\n *   - D2 (EXT0): connected to VL53L0X GPIO pin\n *\/\n\n#include <fastarduino\/gpio.h>\n#include <fastarduino\/int.h>\n#include <fastarduino\/realtime_timer.h>\n#include <fastarduino\/time.h>\n#include <fastarduino\/uart.h>\n#include <fastarduino\/i2c_handler.h>\n#include <fastarduino\/devices\/vl53l0x.h>\n\n\/\/ #define FORCE_SYNC\n\nstatic constexpr const i2c::I2CMode MODE = i2c::I2CMode::FAST;\nstatic constexpr const board::ExternalInterruptPin GPIO = board::ExternalInterruptPin::D2_PD2_EXT0;\n\nstatic constexpr const board::USART UART = board::USART::USART0;\nstatic constexpr const uint8_t OUTPUT_BUFFER_SIZE = 128;\nstatic char output_buffer[OUTPUT_BUFFER_SIZE];\n\nREGISTER_RTT_ISR(0)\nREGISTER_UATX_ISR(0)\n\n#if I2C_TRUE_ASYNC and not defined(FORCE_SYNC)\nusing MANAGER = i2c::I2CAsyncManager<MODE, i2c::I2CErrorPolicy::CLEAR_ALL_COMMANDS>;\nstatic constexpr const uint8_t I2C_BUFFER_SIZE = 32;\nstatic MANAGER::I2CCOMMAND i2c_buffer[I2C_BUFFER_SIZE];\nREGISTER_I2C_ISR(MANAGER)\n#else\nusing MANAGER = i2c::I2CSyncManager<MODE>;\n#endif\n\nusing streams::dec;\nusing streams::hex;\nusing streams::fixed;\nusing streams::endl;\nusing streams::flush;\n\nusing namespace devices::vl53l0x;\nusing TOF = VL53L0X<MANAGER>;\n\n#define CHECK_OK(STATEMENT) if (! STATEMENT) out << F(#STATEMENT) << F(\" ERROR!\") << endl\n\nclass ToFController\n{\npublic:\n\tToFController(TOF& tof) : tof_{tof}\n\t{\n\t\tinterrupt::register_handler(*this);\n\t\tsignal_.enable();\n\t}\n\n\tvoid await_gpio()\n\t{\n\t\twhile (!gpio_)\n\t\t{\n\t\t\ttime::yield();\n\t\t}\n\t\tgpio_ = false;\n\t}\n\nprivate:\n\tvoid gpio_raised()\n\t{\n\t\tgpio_ = true;\n\t}\n\n\tTOF& tof_;\n\tgpio::FAST_EXT_PIN<GPIO> gpio_pin_{gpio::PinMode::INPUT};\n\tinterrupt::INTSignal<GPIO> signal_{interrupt::InterruptTrigger::FALLING_EDGE};\n\tvolatile bool gpio_ = false;\n\n\tDECL_INT_ISR_HANDLERS_FRIEND\n};\n\nREGISTER_INT_ISR_METHOD(0, GPIO, ToFController, &ToFController::gpio_raised)\n\nstatic void loop_gpio(\n\tstreams::ostream& out, timer::RTT<board::Timer::TIMER0>& rtt, ToFController& controller, TOF& tof)\n{\n\tout << F(\"await GPIO\") << endl;\n\t\/\/ Limit loop to 1'\n\tfor (uint8_t i = 0; i < 30; ++i)\n\t{\n\t\tuint16_t range = 0;\n\t\trtt.millis(0);\n\t\tcontroller.await_gpio();\n\t\ttime::RTTTime time1 = rtt.time();\n\n\t\trtt.millis(0);\n\t\tCHECK_OK(tof.get_direct_range(range));\n\t\ttime::RTTTime time2 = rtt.time();\n\t\t\/\/ Clear interrupt\n\t\tCHECK_OK(tof.clear_interrupt());\n\n\t\tout << F(\"GPIO after \") << dec << time1.millis() << \"ms \" << time1.micros() << \"us\" << streams::endl;\n\t\tout << F(\"Range after \") << time2.millis() << \"ms \" << time2.micros() << \"us\" << streams::endl;\n\t\tout << F(\"range = \") << range << F(\"mm\") << endl;\n\t}\n}\n\nint main() __attribute__((OS_main));\nint main()\n{\n\tboard::init();\n\tsei();\n\n\t\/\/ open UART for traces\n\tserial::hard::UATX<UART> uart{output_buffer};\n\tstreams::ostream out = uart.out();\n\tuart.begin(115200);\n\tout << streams::boolalpha;\n\n\ttimer::RTT<board::Timer::TIMER0> rtt;\n\trtt.begin();\n\n\t\/\/ Initialize I2C async handler\n#if I2C_TRUE_ASYNC and not defined(FORCE_SYNC)\n\tMANAGER manager{i2c_buffer};\n#else\n\tMANAGER manager;\n#endif\n\n\tTOF tof{manager};\n\tmanager.begin();\n\tToFController controller{tof};\n\n\tuint8_t value = 0;\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\n\tCHECK_OK(tof.begin(Profile::STANDARD));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\n\tout << F(\"GPIOSettings::sample_ready()\") << endl;\n\tCHECK_OK(tof.set_GPIO_settings(GPIOSettings::sample_ready()));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\tCHECK_OK(tof.start_continuous_ranging(1000));\n\tloop_gpio(out, rtt, controller, tof);\n\n\tout << F(\"GPIOSettings::low_threshold(200)\") << endl;\n\tCHECK_OK(tof.set_GPIO_settings(GPIOSettings::low_threshold(200)));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\tCHECK_OK(tof.start_continuous_ranging(1000));\n\tloop_gpio(out, rtt, controller, tof);\n\n\tout << F(\"GPIOSettings::high_threshold(400)\") << endl;\n\tCHECK_OK(tof.set_GPIO_settings(GPIOSettings::high_threshold(400)));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\tCHECK_OK(tof.start_continuous_ranging(1000));\n\tloop_gpio(out, rtt, controller, tof);\n\n\tout << F(\"GPIOSettings::out_of_window(200, 400)\") << endl;\n\tCHECK_OK(tof.set_GPIO_settings(GPIOSettings::out_of_window(200, 400)));\n\tCHECK_OK(tof.get_register<Register::GPIO_HV_MUX_ACTIVE_HIGH>(value));\n\tout << F(\"Register::GPIO_HV_MUX_ACTIVE_HIGH = \") << hex << value << endl;\n\tCHECK_OK(tof.start_continuous_ranging(1000));\n\tloop_gpio(out, rtt, controller, tof);\n\n\ttof.stop_continuous_ranging();\n\tmanager.end();\n\n\tout << F(\"Finished!\") << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkImageChangeInformation.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 \"vtkImageChangeInformation.h\"\n\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\nvtkCxxRevisionMacro(vtkImageChangeInformation, \"1.17\");\nvtkStandardNewMacro(vtkImageChangeInformation);\n\n\/\/----------------------------------------------------------------------------\nvtkImageChangeInformation::vtkImageChangeInformation()\n{\n  this->CenterImage = 0;\n\n  for (int i = 0; i < 3; i++)\n    {\n    this->OutputExtentStart[i] = VTK_INT_MAX;\n    this->ExtentTranslation[i] = 0;\n    this->FinalExtentTranslation[i] = VTK_INT_MAX;\n\n    this->OutputSpacing[i] = VTK_DOUBLE_MAX;\n    this->SpacingScale[i] = 1.0;\n\n    this->OutputOrigin[i] = VTK_DOUBLE_MAX;\n    this->OriginScale[i] = 1.0;\n    this->OriginTranslation[i] = 0.0;\n    }\n\n  \/\/ There is an optional second input.\n  this->SetNumberOfInputPorts(2);\n}\n\n\/\/ Specify a source object at a specified table location.\nvoid vtkImageChangeInformation::SetInformationInput(vtkImageData *pd)\n{\n  this->SetInput(1, pd);\n}\n\n\/\/ Get a pointer to a source object at a specified table location.\nvtkImageData *vtkImageChangeInformation::GetInformationInput()\n{\n  if (this->GetNumberOfInputConnections(1) < 1)\n    {\n    return 0;\n    }\n  return vtkImageData::SafeDownCast(this->GetExecutive()->GetInputData(1, 0));\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageChangeInformation::~vtkImageChangeInformation()\n{\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageChangeInformation::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  os << indent << \"CenterImage : \"\n     << (this->CenterImage ? \"On\":\"Off\") << endl;\n\n  os << indent << \"OutputExtentStart: (\" \n     << this->OutputExtentStart[0] << \",\"\n     << this->OutputExtentStart[1] << \",\"\n     << this->OutputExtentStart[2] << \")\" << endl;\n\n  os << indent << \"ExtentTranslation: (\" \n     << this->ExtentTranslation[0] << \",\"\n     << this->ExtentTranslation[1] << \",\"\n     << this->ExtentTranslation[2] << \")\" << endl;\n\n  os << indent << \"OutputSpacing: (\" \n     << this->OutputSpacing[0] << \",\"\n     << this->OutputSpacing[1] << \",\"\n     << this->OutputSpacing[2] << \")\" << endl;\n\n  os << indent << \"SpacingScale: (\" \n     << this->SpacingScale[0] << \",\"\n     << this->SpacingScale[1] << \",\"\n     << this->SpacingScale[2] << \")\" << endl;\n\n  os << indent << \"OutputOrigin: (\" \n     << this->OutputOrigin[0] << \",\"\n     << this->OutputOrigin[1] << \",\"\n     << this->OutputOrigin[2] << \")\" << endl;\n\n  os << indent << \"OriginScale: (\" \n     << this->OriginScale[0] << \",\"\n     << this->OriginScale[1] << \",\"\n     << this->OriginScale[2] << \")\" << endl;\n\n  os << indent << \"OriginTranslation: (\" \n     << this->OriginTranslation[0] << \",\"\n     << this->OriginTranslation[1] << \",\"\n     << this->OriginTranslation[2] << \")\" << endl;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Change the information\nvoid vtkImageChangeInformation::ExecuteInformation (\n  vtkInformation * vtkNotUsed(request),\n  vtkInformationVector **inputVector,\n  vtkInformationVector *outputVector)\n{\n  \/\/ get the info objects\n  vtkInformation *outInfo = outputVector->GetInformationObject(0);\n  vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n\n  int i;\n  int extent[6], inExtent[6];\n  double spacing[3], origin[3];\n  \n  inInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),inExtent);\n\n  if (this->GetInformationInput())\n    {\n    \/\/ If there is an InformationInput, it is set as a second input\n    vtkInformation *in2Info = inputVector[1]->GetInformationObject(0);\n    in2Info->Get(vtkDataObject::ORIGIN(),origin);\n    in2Info->Get(vtkDataObject::SPACING(),spacing);\n    in2Info->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),extent);\n    for (i = 0; i < 3; i++)\n      {\n      extent[2*i+1] = extent[2*i] - inExtent[2*i] + inExtent[2*i+1];\n      }\n    }\n  else\n    {\n    inInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),extent);\n    inInfo->Get(vtkDataObject::ORIGIN(),origin);\n    inInfo->Get(vtkDataObject::SPACING(),spacing);\n    }\n\n  for (i = 0; i < 3; i++)\n    {\n    if (this->OutputSpacing[i] != VTK_DOUBLE_MAX)\n      {\n      spacing[i] = this->OutputSpacing[i];\n      }\n\n    if (this->OutputOrigin[i] != VTK_DOUBLE_MAX)\n      {\n      origin[i] = this->OutputOrigin[i];\n      }\n\n    if (this->OutputExtentStart[i] != VTK_INT_MAX)\n      {\n      extent[2*i+1] += this->OutputExtentStart[i] - extent[2*i];\n      extent[2*i] = this->OutputExtentStart[i];\n      }\n    }\n\n  if (this->CenterImage)\n    {\n    for (i = 0; i < 3; i++)\n      {\n      origin[i] = -(extent[2*i] + extent[2*i+1])*spacing[i]\/2;\n      }\n    }\n\n  for (i = 0; i < 3; i++)\n    {\n    spacing[i] = spacing[i]*this->SpacingScale[i];\n    origin[i] = origin[i]*this->OriginScale[i] + this->OriginTranslation[i];\n    extent[2*i] = extent[2*i] + this->ExtentTranslation[i];\n    extent[2*i+1] = extent[2*i+1] + this->ExtentTranslation[i];\n    this->FinalExtentTranslation[i] = extent[2*i] - inExtent[2*i];\n    }\n\n  outInfo->Set(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),extent,6);\n  outInfo->Set(vtkDataObject::SPACING(),spacing,3);\n  outInfo->Set(vtkDataObject::ORIGIN(),origin,3);\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ This method simply copies by reference the input data to the output.\nvoid vtkImageChangeInformation::RequestData(\n  vtkInformation *vtkNotUsed(request),\n  vtkInformationVector **inputVector,\n  vtkInformationVector *outputVector)\n{\n  if (this->FinalExtentTranslation[0] == VTK_INT_MAX)\n    {\n    vtkErrorMacro(\"Bug in code, ExecuteInformation was not called\");\n    return;\n    }\n\n  vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n  vtkInformation *outInfo = outputVector->GetInformationObject(0);\n  int extent[6];\n  \n  vtkImageData *inData = vtkImageData::SafeDownCast(\n    inInfo->Get(vtkDataObject::DATA_OBJECT()));\n  vtkImageData *outData = vtkImageData::SafeDownCast(\n    outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n  \/\/ since inData can be larger than update extent.\n\/\/  inInfo->Get(vtkDataObject::DATA_EXTENT(),extent);\n  inData->GetExtent(extent);\n  for (int i = 0; i < 3; ++i)\n    {\n    extent[i*2] += this->FinalExtentTranslation[i];\n    extent[i*2+1] += this->FinalExtentTranslation[i];\n    }\n\/\/  outInfo->Set(vtkDataObject::DATA_EXTENT(),extent,6);\n  outData->SetExtent(extent);\n  outData->GetPointData()->PassData(inData->GetPointData());\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageChangeInformation::RequestUpdateExtent (\n  vtkInformation * vtkNotUsed(request),\n  vtkInformationVector **inputVector,\n  vtkInformationVector *outputVector)\n{\n  \/\/ get the info objects\n  vtkInformation* outInfo = outputVector->GetInformationObject(0);\n  vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n\n  if (this->FinalExtentTranslation[0] == VTK_INT_MAX)\n    {\n    vtkErrorMacro(\"Bug in code.\");\n    return;\n    }\n\n  int inExt[6];\n  outInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(), inExt);\n  \n  inExt[0] -= this->FinalExtentTranslation[0];\n  inExt[1] -= this->FinalExtentTranslation[0];\n  inExt[2] -= this->FinalExtentTranslation[1];\n  inExt[3] -= this->FinalExtentTranslation[1];\n  inExt[4] -= this->FinalExtentTranslation[2];\n  inExt[5] -= this->FinalExtentTranslation[2];\n\n  inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT(), inExt, 6);\n}\n\nint vtkImageChangeInformation::FillInputPortInformation(\n  int port, vtkInformation *info)\n{\n  info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkImageData\");\n  if (port == 1)\n    {\n    info->Set(vtkAlgorithm::INPUT_IS_OPTIONAL(), 1);\n    }\n\n  return 1;\n}\n<commit_msg>removing commented-out lines<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkImageChangeInformation.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 \"vtkImageChangeInformation.h\"\n\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\nvtkCxxRevisionMacro(vtkImageChangeInformation, \"1.18\");\nvtkStandardNewMacro(vtkImageChangeInformation);\n\n\/\/----------------------------------------------------------------------------\nvtkImageChangeInformation::vtkImageChangeInformation()\n{\n  this->CenterImage = 0;\n\n  for (int i = 0; i < 3; i++)\n    {\n    this->OutputExtentStart[i] = VTK_INT_MAX;\n    this->ExtentTranslation[i] = 0;\n    this->FinalExtentTranslation[i] = VTK_INT_MAX;\n\n    this->OutputSpacing[i] = VTK_DOUBLE_MAX;\n    this->SpacingScale[i] = 1.0;\n\n    this->OutputOrigin[i] = VTK_DOUBLE_MAX;\n    this->OriginScale[i] = 1.0;\n    this->OriginTranslation[i] = 0.0;\n    }\n\n  \/\/ There is an optional second input.\n  this->SetNumberOfInputPorts(2);\n}\n\n\/\/ Specify a source object at a specified table location.\nvoid vtkImageChangeInformation::SetInformationInput(vtkImageData *pd)\n{\n  this->SetInput(1, pd);\n}\n\n\/\/ Get a pointer to a source object at a specified table location.\nvtkImageData *vtkImageChangeInformation::GetInformationInput()\n{\n  if (this->GetNumberOfInputConnections(1) < 1)\n    {\n    return 0;\n    }\n  return vtkImageData::SafeDownCast(this->GetExecutive()->GetInputData(1, 0));\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageChangeInformation::~vtkImageChangeInformation()\n{\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageChangeInformation::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  os << indent << \"CenterImage : \"\n     << (this->CenterImage ? \"On\":\"Off\") << endl;\n\n  os << indent << \"OutputExtentStart: (\" \n     << this->OutputExtentStart[0] << \",\"\n     << this->OutputExtentStart[1] << \",\"\n     << this->OutputExtentStart[2] << \")\" << endl;\n\n  os << indent << \"ExtentTranslation: (\" \n     << this->ExtentTranslation[0] << \",\"\n     << this->ExtentTranslation[1] << \",\"\n     << this->ExtentTranslation[2] << \")\" << endl;\n\n  os << indent << \"OutputSpacing: (\" \n     << this->OutputSpacing[0] << \",\"\n     << this->OutputSpacing[1] << \",\"\n     << this->OutputSpacing[2] << \")\" << endl;\n\n  os << indent << \"SpacingScale: (\" \n     << this->SpacingScale[0] << \",\"\n     << this->SpacingScale[1] << \",\"\n     << this->SpacingScale[2] << \")\" << endl;\n\n  os << indent << \"OutputOrigin: (\" \n     << this->OutputOrigin[0] << \",\"\n     << this->OutputOrigin[1] << \",\"\n     << this->OutputOrigin[2] << \")\" << endl;\n\n  os << indent << \"OriginScale: (\" \n     << this->OriginScale[0] << \",\"\n     << this->OriginScale[1] << \",\"\n     << this->OriginScale[2] << \")\" << endl;\n\n  os << indent << \"OriginTranslation: (\" \n     << this->OriginTranslation[0] << \",\"\n     << this->OriginTranslation[1] << \",\"\n     << this->OriginTranslation[2] << \")\" << endl;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Change the information\nvoid vtkImageChangeInformation::ExecuteInformation (\n  vtkInformation * vtkNotUsed(request),\n  vtkInformationVector **inputVector,\n  vtkInformationVector *outputVector)\n{\n  \/\/ get the info objects\n  vtkInformation *outInfo = outputVector->GetInformationObject(0);\n  vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n\n  int i;\n  int extent[6], inExtent[6];\n  double spacing[3], origin[3];\n  \n  inInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),inExtent);\n\n  if (this->GetInformationInput())\n    {\n    \/\/ If there is an InformationInput, it is set as a second input\n    vtkInformation *in2Info = inputVector[1]->GetInformationObject(0);\n    in2Info->Get(vtkDataObject::ORIGIN(),origin);\n    in2Info->Get(vtkDataObject::SPACING(),spacing);\n    in2Info->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),extent);\n    for (i = 0; i < 3; i++)\n      {\n      extent[2*i+1] = extent[2*i] - inExtent[2*i] + inExtent[2*i+1];\n      }\n    }\n  else\n    {\n    inInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),extent);\n    inInfo->Get(vtkDataObject::ORIGIN(),origin);\n    inInfo->Get(vtkDataObject::SPACING(),spacing);\n    }\n\n  for (i = 0; i < 3; i++)\n    {\n    if (this->OutputSpacing[i] != VTK_DOUBLE_MAX)\n      {\n      spacing[i] = this->OutputSpacing[i];\n      }\n\n    if (this->OutputOrigin[i] != VTK_DOUBLE_MAX)\n      {\n      origin[i] = this->OutputOrigin[i];\n      }\n\n    if (this->OutputExtentStart[i] != VTK_INT_MAX)\n      {\n      extent[2*i+1] += this->OutputExtentStart[i] - extent[2*i];\n      extent[2*i] = this->OutputExtentStart[i];\n      }\n    }\n\n  if (this->CenterImage)\n    {\n    for (i = 0; i < 3; i++)\n      {\n      origin[i] = -(extent[2*i] + extent[2*i+1])*spacing[i]\/2;\n      }\n    }\n\n  for (i = 0; i < 3; i++)\n    {\n    spacing[i] = spacing[i]*this->SpacingScale[i];\n    origin[i] = origin[i]*this->OriginScale[i] + this->OriginTranslation[i];\n    extent[2*i] = extent[2*i] + this->ExtentTranslation[i];\n    extent[2*i+1] = extent[2*i+1] + this->ExtentTranslation[i];\n    this->FinalExtentTranslation[i] = extent[2*i] - inExtent[2*i];\n    }\n\n  outInfo->Set(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),extent,6);\n  outInfo->Set(vtkDataObject::SPACING(),spacing,3);\n  outInfo->Set(vtkDataObject::ORIGIN(),origin,3);\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ This method simply copies by reference the input data to the output.\nvoid vtkImageChangeInformation::RequestData(\n  vtkInformation *vtkNotUsed(request),\n  vtkInformationVector **inputVector,\n  vtkInformationVector *outputVector)\n{\n  if (this->FinalExtentTranslation[0] == VTK_INT_MAX)\n    {\n    vtkErrorMacro(\"Bug in code, ExecuteInformation was not called\");\n    return;\n    }\n\n  vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n  vtkInformation *outInfo = outputVector->GetInformationObject(0);\n  int extent[6];\n  \n  vtkImageData *inData = vtkImageData::SafeDownCast(\n    inInfo->Get(vtkDataObject::DATA_OBJECT()));\n  vtkImageData *outData = vtkImageData::SafeDownCast(\n    outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n  \/\/ since inData can be larger than update extent.\n  inData->GetExtent(extent);\n  for (int i = 0; i < 3; ++i)\n    {\n    extent[i*2] += this->FinalExtentTranslation[i];\n    extent[i*2+1] += this->FinalExtentTranslation[i];\n    }\n  outData->SetExtent(extent);\n  outData->GetPointData()->PassData(inData->GetPointData());\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageChangeInformation::RequestUpdateExtent (\n  vtkInformation * vtkNotUsed(request),\n  vtkInformationVector **inputVector,\n  vtkInformationVector *outputVector)\n{\n  \/\/ get the info objects\n  vtkInformation* outInfo = outputVector->GetInformationObject(0);\n  vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n\n  if (this->FinalExtentTranslation[0] == VTK_INT_MAX)\n    {\n    vtkErrorMacro(\"Bug in code.\");\n    return;\n    }\n\n  int inExt[6];\n  outInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(), inExt);\n  \n  inExt[0] -= this->FinalExtentTranslation[0];\n  inExt[1] -= this->FinalExtentTranslation[0];\n  inExt[2] -= this->FinalExtentTranslation[1];\n  inExt[3] -= this->FinalExtentTranslation[1];\n  inExt[4] -= this->FinalExtentTranslation[2];\n  inExt[5] -= this->FinalExtentTranslation[2];\n\n  inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT(), inExt, 6);\n}\n\nint vtkImageChangeInformation::FillInputPortInformation(\n  int port, vtkInformation *info)\n{\n  info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkImageData\");\n  if (port == 1)\n    {\n    info->Set(vtkAlgorithm::INPUT_IS_OPTIONAL(), 1);\n    }\n\n  return 1;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix file extension when renaming<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file SimpleWorkerStealer.cpp\n * \\date Jun 23, 2010\n * \\author samael\n *\/\n\n#include <ctime>\n#include <cstdlib>\n#include \"WaitCondition.h\"\n#include \"SimpleWorkerStealer.h\"\n\nusing namespace std;\nusing namespace cml;\n\nnamespace wfe\n{\n\nSimpleWorkerStealer::SimpleWorkerStealer(int n):\n\t\t_runner(NULL), _mx(), _stealing(false), _num(n)\n{\n\tsrand(time(NULL));\n}\n\nvoid SimpleWorkerStealer::workerMissed()\n{\n\tif (!isStealing()) {\n\t\tsetStealing(true);\n\t\tif (!_runner) {\n\t\t\tPERR(\"No runner has been set.\");\n\t\t} else {\n\t\t\tif (!_runner->runnerSocks().empty()) {\n\t\t\t\tint index = rand() % _runner->runnerSocks().size();\n\t\t\t\t_runner->sendWorkerSteal(_runner->runnerSocks()[index], 1);\n\t\t\t}\n\t\t}\n\t\tsetStealing(false);\n\t}\n}\n\n}\n<commit_msg><commit_after>\/**\n * \\file SimpleWorkerStealer.cpp\n * \\date Jun 23, 2010\n * \\author samael\n *\/\n\n#include <ctime>\n#include <cstdlib>\n#include \"WaitCondition.h\"\n#include \"SimpleWorkerStealer.h\"\n\nusing namespace std;\nusing namespace cml;\n\nnamespace wfe\n{\n\nSimpleWorkerStealer::SimpleWorkerStealer(int n):\n\t\t_runner(NULL), _mx(), _stealing(false), _num(n)\n{\n\tsrand(time(NULL));\n}\n\nvoid SimpleWorkerStealer::workerMissed()\n{\n\tif (!isStealing()) {\n\t\tsetStealing(true);\n\t\tif (!_runner) {\n\t\t\tPERR(\"No runner has been set.\");\n\t\t} else {\n\t\t\tif (!_runner->runnerSocks().empty()) {\n\t\t\t\tint index = rand() % _runner->runnerSocks().size();\n\t\t\t\t_runner->sendWorkerSteal(_runner->runnerSocks()[index], _num);\n\t\t\t}\n\t\t}\n\t\tsetStealing(false);\n\t}\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RTK includes\n#include \"rtkConfiguration.h\"\n#include <rtkFDKBackProjectionImageFilter.h>\n#include <rtkConstantImageSource.h>\n#include <rtkThreeDCircularProjectionGeometry.h>\n#include <rtkRayEllipsoidIntersectionImageFilter.h>\n#include <rtkDisplacedDetectorImageFilter.h>\n#include <rtkParkerShortScanImageFilter.h>\n#include <rtkFDKConeBeamReconstructionFilter.h>\n\n\/\/ ITK includes\n#include <itkImageFileWriter.h>\n#include <itkStreamingImageFilter.h>\n\nint main(int , char **)\n{\n  \/\/ Defines the image type\n  typedef itk::Image< float, 3 > ImageType;\n\n  \/\/ Defines the RTK geometry object\n  typedef rtk::ThreeDCircularProjectionGeometry GeometryType;\n  GeometryType::Pointer geometry = GeometryType::New();\n\n  \/\/ Projection matrices\n  unsigned int numberOfProjections = 360;\n  unsigned int firstAngle = 0;\n  unsigned int angularArc = 360;\n  unsigned int sid = 600; \/\/ source to isocenter distance in mm\n  unsigned int sdd = 1200; \/\/ source to detector distance in mm\n  int isox = 0; \/\/ X coordinate on the projection image of isocenter\n  int isoy = 0; \/\/ Y coordinate on the projection image of isocenter\n\n  for(unsigned int noProj=0; noProj<numberOfProjections; noProj++)\n    {\n    double angle = (float)firstAngle + (float)noProj * angularArc \/ (float)numberOfProjections;\n    geometry->AddProjection(sid,\n                            sdd,\n                            angle,\n                            isox,\n                            isoy);\n    }\n\n  \/\/ Create a stack of empty projection images\n  typedef rtk::ConstantImageSource< ImageType > ConstantImageSourceType;\n  ConstantImageSourceType::Pointer constantImageSource = ConstantImageSourceType::New();\n  ConstantImageSourceType::PointType origin;\n  ConstantImageSourceType::SpacingType spacing;\n  ConstantImageSourceType::SizeType sizeOutput;\n\n  origin[0] = -127.;\n  origin[1] = -127.;\n  origin[2] = -127.;\n\n  \/\/ Adjust size according to geometry\n  sizeOutput[0] = 256;\n  sizeOutput[1] = 256;\n  sizeOutput[2] = numberOfProjections;\n\n  spacing[0] = 1.;\n  spacing[1] = 1.;\n  spacing[2] = 1.;\n  constantImageSource->SetOrigin( origin );\n  constantImageSource->SetSpacing( spacing );\n  constantImageSource->SetSize( sizeOutput );\n  constantImageSource->SetConstant( 0. );\n  \n   \/\/ Create the projector\n  typedef rtk::RayEllipsoidIntersectionImageFilter<ImageType, ImageType> REIType;\n  REIType::Pointer rei = REIType::New();\n  REIType::VectorType semiprincipalaxis, center;\n  semiprincipalaxis.Fill(50.);\n  center.Fill(0.);\n  \/\/Set GrayScale value, axes, center...\n  rei->SetDensity(2.);\n  rei->SetAngle(0.);\n  rei->SetGeometry( geometry );\n  rei->SetInput( constantImageSource->GetOutput() );\n  rei->Update();\n\n  \/\/ Create reconstructed image\n  ConstantImageSourceType::Pointer constantImageSource2 = ConstantImageSourceType::New();\n\n  \/\/ Adjust size according to geometry\n  sizeOutput[0] = 256;\n  sizeOutput[1] = 256;\n  sizeOutput[2] = 256;\n\n  constantImageSource2->SetOrigin( origin );\n  constantImageSource2->SetSpacing( spacing );\n  constantImageSource2->SetSize( sizeOutput );\n  constantImageSource2->SetConstant( 0. );\n\n  \/\/ FDK reconstruction filtering\n  typedef rtk::FDKConeBeamReconstructionFilter< ImageType > FDKCPUType;\n  FDKCPUType::Pointer feldkamp = FDKCPUType::New();\n  feldkamp->SetInput( 0, constantImageSource2->GetOutput() );\n  feldkamp->SetInput( 1, rei->GetOutput() );\n  feldkamp->SetGeometry( geometry );\n  feldkamp->GetRampFilter()->SetTruncationCorrection(0.);\n  feldkamp->GetRampFilter()->SetHannCutFrequency(0.0);\n  feldkamp->Update();\n\n  \/\/ Writer\n  typedef itk::ImageFileWriter<ImageType> WriterType;\n  WriterType::Pointer writer = WriterType::New();\n  writer->SetFileName( \"output.mha\" );\n  writer->SetUseCompression(true);\n  writer->SetInput( feldkamp->GetOutput() );\n  writer->Update();\n  \n  return 0;\n}\n\n<commit_msg>BUG: Missing center and axis for the RayEllipsoidIntersectionImageFilter<commit_after>\/\/ RTK includes\n#include \"rtkConfiguration.h\"\n#include <rtkFDKBackProjectionImageFilter.h>\n#include <rtkConstantImageSource.h>\n#include <rtkThreeDCircularProjectionGeometry.h>\n#include <rtkRayEllipsoidIntersectionImageFilter.h>\n#include <rtkDisplacedDetectorImageFilter.h>\n#include <rtkParkerShortScanImageFilter.h>\n#include <rtkFDKConeBeamReconstructionFilter.h>\n\n\/\/ ITK includes\n#include <itkImageFileWriter.h>\n#include <itkStreamingImageFilter.h>\n\nint main(int , char **)\n{\n  \/\/ Defines the image type\n  typedef itk::Image< float, 3 > ImageType;\n\n  \/\/ Defines the RTK geometry object\n  typedef rtk::ThreeDCircularProjectionGeometry GeometryType;\n  GeometryType::Pointer geometry = GeometryType::New();\n\n  \/\/ Projection matrices\n  unsigned int numberOfProjections = 360;\n  unsigned int firstAngle = 0;\n  unsigned int angularArc = 360;\n  unsigned int sid = 600; \/\/ source to isocenter distance in mm\n  unsigned int sdd = 1200; \/\/ source to detector distance in mm\n  int isox = 0; \/\/ X coordinate on the projection image of isocenter\n  int isoy = 0; \/\/ Y coordinate on the projection image of isocenter\n\n  for(unsigned int noProj=0; noProj<numberOfProjections; noProj++)\n    {\n    double angle = (float)firstAngle + (float)noProj * angularArc \/ (float)numberOfProjections;\n    geometry->AddProjection(sid,\n                            sdd,\n                            angle,\n                            isox,\n                            isoy);\n    }\n\n  \/\/ Create a stack of empty projection images\n  typedef rtk::ConstantImageSource< ImageType > ConstantImageSourceType;\n  ConstantImageSourceType::Pointer constantImageSource = ConstantImageSourceType::New();\n  ConstantImageSourceType::PointType origin;\n  ConstantImageSourceType::SpacingType spacing;\n  ConstantImageSourceType::SizeType sizeOutput;\n\n  origin[0] = -127.;\n  origin[1] = -127.;\n  origin[2] = -127.;\n\n  \/\/ Adjust size according to geometry\n  sizeOutput[0] = 256;\n  sizeOutput[1] = 256;\n  sizeOutput[2] = numberOfProjections;\n\n  spacing[0] = 1.;\n  spacing[1] = 1.;\n  spacing[2] = 1.;\n  constantImageSource->SetOrigin( origin );\n  constantImageSource->SetSpacing( spacing );\n  constantImageSource->SetSize( sizeOutput );\n  constantImageSource->SetConstant( 0. );\n  \n   \/\/ Create the projector\n  typedef rtk::RayEllipsoidIntersectionImageFilter<ImageType, ImageType> REIType;\n  REIType::Pointer rei = REIType::New();\n  REIType::VectorType semiprincipalaxis, center;\n  semiprincipalaxis.Fill(50.);\n  center.Fill(0.);\n  \/\/Set GrayScale value, axes, center...\n  rei->SetDensity(2.);\n  rei->SetAngle(0.);\n  rei->SetCenter(center);\n  rei->SetAxis(semiprincipalaxis);\n  rei->SetGeometry( geometry );\n  rei->SetInput( constantImageSource->GetOutput() );\n  rei->Update();\n\n  \/\/ Create reconstructed image\n  ConstantImageSourceType::Pointer constantImageSource2 = ConstantImageSourceType::New();\n\n  \/\/ Adjust size according to geometry\n  sizeOutput[0] = 256;\n  sizeOutput[1] = 256;\n  sizeOutput[2] = 256;\n\n  constantImageSource2->SetOrigin( origin );\n  constantImageSource2->SetSpacing( spacing );\n  constantImageSource2->SetSize( sizeOutput );\n  constantImageSource2->SetConstant( 0. );\n\n  std::cout << \"Performing reconstruction\" << std::endl;\n\n  \/\/ FDK reconstruction filtering\n  typedef rtk::FDKConeBeamReconstructionFilter< ImageType > FDKCPUType;\n  FDKCPUType::Pointer feldkamp = FDKCPUType::New();\n  feldkamp->SetInput( 0, constantImageSource2->GetOutput() );\n  feldkamp->SetInput( 1, rei->GetOutput() );\n  feldkamp->SetGeometry( geometry );\n  feldkamp->GetRampFilter()->SetTruncationCorrection(0.);\n  feldkamp->GetRampFilter()->SetHannCutFrequency(0.0);\n  feldkamp->Update();\n\n  std::cout << \"Writing output image\" << std::endl;\n\n  \/\/ Writer\n  typedef itk::ImageFileWriter<ImageType> WriterType;\n  WriterType::Pointer writer = WriterType::New();\n  writer->SetFileName( \"output.mha\" );\n  writer->SetUseCompression(true);\n  writer->SetInput( feldkamp->GetOutput() );\n  writer->Update();\n\n  std::cout << \"Done\" << std::endl;\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode: c++; c-basic-offset:4 -*-\n    importcertificatecommand.cpp\n\n    This file is part of Kleopatra, the KDE keymanager\n    Copyright (c) 2007 Klarälvdalens 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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  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 \"importcertificatecommand.h\"\n\n#include <kleo\/cryptobackendfactory.h>\n#include <kleo\/importjob.h>\n\n#include <gpgme++\/global.h>\n#include <gpgme++\/importresult.h>\n\n#include <KLocale>\n#include <KMessageBox>\n#include <KJob>\n\n#include <QByteArray>\n#include <QFile>\n#include <QFileDialog>\n#include <QPointer>\n#include <QString>\n#include <QWidget>\n\n#include <memory>\n\nusing namespace GpgME;\nusing namespace Kleo;\n\nclass ImportCertificateCommand::Private {\n    friend class ::ImportCertificateCommand;\n    ImportCertificateCommand * const q;\npublic:\n    explicit Private( ImportCertificateCommand * qq );\n    ~Private();\n\n    bool ensureHaveFile();\n    void startImport( const QByteArray& data );\n    void importResult( const GpgME::ImportResult& );\n    GpgME::Protocol checkProtocol( const QByteArray& data, const QString& filename ) const;\n    void showError( const GpgME::Error& error );\n    void showDetails( const ImportResult& result );\n\nprivate:\n    QWidget* parent;\n    QPointer<ImportJob> importJob;\n    QString filename;\n};\n\n\nImportCertificateCommand::Private::Private( ImportCertificateCommand * qq )\n    : q( qq ), parent( 0 ), importJob( 0 )\n{\n    \n}\n\nImportCertificateCommand::Private::~Private() \n{\n    if ( importJob )\n        importJob->slotCancel();\n}\n\n\n\nImportCertificateCommand::ImportCertificateCommand( KeyListController * parent )\n  : Command( parent ), d( new Private( this ) )\n{\n    \n}\n\nImportCertificateCommand::~ImportCertificateCommand() {}\n\nvoid ImportCertificateCommand::setParentWidget( QWidget* parent )\n{\n    d->parent = parent;\n}\n\nQString ImportCertificateCommand::fileName() const\n{\n    return d->filename;\n}\n\nvoid ImportCertificateCommand::setFileName( const QString& fileName )\n{\n    d->filename = fileName;\n}\n\nvoid ImportCertificateCommand::doStart()\n{\n    if ( !d->ensureHaveFile() )\n    {\n        emit canceled();\n        return;\n    }\n    \/\/TODO: use KIO here\n    QFile in( d->filename );\n    if ( !in.open( QIODevice::ReadOnly ) )\n    {\n        KMessageBox::error( d->parent, i18n( \"Could not open file %1 for reading\", d->filename ), i18n( \"Certificate Import Failed\" ) );\n        \n        emit finished(); \/\/TODO: correct signal??\n        return;\n    }\n    d->startImport( in.readAll() ); \n    emit info( i18n( \"Importing certificate...\" ) );\n}\n\nbool ImportCertificateCommand::Private::ensureHaveFile()\n{\n   if ( filename.isNull() )\n        filename = QFileDialog::getOpenFileName( parent, i18n( \"Select Certificate File\" ), QString(), i18n( \"Certificates (*.asc *.pem *.der *.p7c *.p12)\" )  );\n   return !filename.isNull();\n}\n\nvoid ImportCertificateCommand::Private::showDetails( const ImportResult& res )\n{\n      const KLocalizedString normalLine = ki18n(\"<tr><td align=\\\"right\\\">%1<\/td><td>%2<\/td><\/tr>\");\n        const KLocalizedString boldLine = ki18n(\"<tr><td align=\\\"right\\\"><b>%1<\/b><\/td><td>%2<\/td><\/tr>\");\n\n        QStringList lines;\n        lines.push_back( normalLine.subs( i18n(\"Total number processed:\") )\n                         .subs( res.numConsidered() ).toString() );\n        lines.push_back( normalLine.subs( i18n(\"Imported:\") )\n                         .subs( res.numImported() ).toString() );\n        if ( res.newSignatures() )\n            lines.push_back( normalLine.subs( i18n(\"New signatures:\") )\n                             .subs( res.newSignatures() ).toString() );\n        if ( res.newUserIDs() )\n            lines.push_back( normalLine.subs( i18n(\"New user IDs:\") )\n                             .subs( res.newUserIDs() ).toString() );\n        if ( res.numKeysWithoutUserID() )\n            lines.push_back( normalLine.subs( i18n(\"Keys without user IDs:\") )\n                             .subs( res.numKeysWithoutUserID() ).toString() );\n        if ( res.newSubkeys() )\n            lines.push_back( normalLine.subs( i18n(\"New subkeys:\") )\n                             .subs( res.newSubkeys() ).toString() );\n        if ( res.newRevocations() )\n            lines.push_back( boldLine.subs( i18n(\"Newly revoked:\") )\n                             .subs( res.newRevocations() ).toString() );\n        if ( res.notImported() )\n            lines.push_back( boldLine.subs( i18n(\"Not imported:\") )\n                             .subs( res.notImported() ).toString() );\n        if ( res.numUnchanged() )\n            lines.push_back( normalLine.subs( i18n(\"Unchanged:\") )\n                             .subs( res.numUnchanged() ).toString() );\n        if ( res.numSecretKeysConsidered() )\n            lines.push_back( normalLine.subs( i18n(\"Secret keys processed:\") )\n                             .subs( res.numSecretKeysConsidered() ).toString() );\n        if ( res.numSecretKeysImported() )\n            lines.push_back( normalLine.subs( i18n(\"Secret keys imported:\") )\n                             .subs( res.numSecretKeysImported() ).toString() );\n        if ( res.numSecretKeysConsidered() - res.numSecretKeysImported() - res.numSecretKeysUnchanged() > 0 )\n            lines.push_back( boldLine.subs( i18n(\"Secret keys <em>not<\/em> imported:\") )\n                             .subs(  res.numSecretKeysConsidered()\n                                     - res.numSecretKeysImported()\n                                     - res.numSecretKeysUnchanged() ).toString() );\n        if ( res.numSecretKeysUnchanged() )\n            lines.push_back( normalLine.subs( i18n(\"Secret keys unchanged:\") )\n                             .subs( res.numSecretKeysUnchanged() ).toString() );\n        \n        KMessageBox::information( parent,\n                                  i18n( \"<qt><p>Detailed results of importing %1:<\/p>\"\n                                        \"<table>%2<\/table><\/qt>\" ,\n                                        filename, lines.join( QString() ) ),\n                                  i18n( \"Certificate Import Result\" ) );\n}\n\nvoid ImportCertificateCommand::Private::showError( const GpgME::Error& err )\n{\n  assert( err );\n  const QString msg = i18n( \"<qt><p>An error occurred while trying \"\n\t\t\t    \"to import the certificate %1:<\/p>\"\n\t\t\t    \"<p><b>%2<\/b><\/p><\/qt>\",\n                            filename,\n                            QString::fromLocal8Bit( err.asString() ) );\n  KMessageBox::error( parent, msg, i18n( \"Certificate Import Failed\" ) );\n}\n\nvoid ImportCertificateCommand::Private::importResult( const GpgME::ImportResult& result )\n{\n    if ( result.error().isCanceled() ) {\n        emit q->canceled();\n        return;\n    }\n\n    if ( result.error() ) { \n        showError( result.error() );\n        emit q->finished();\n        return;\n    }\n\n    showDetails( result );\n}\n\nGpgME::Protocol ImportCertificateCommand::Private::checkProtocol( const QByteArray& data, const QString& filename ) const\n{\n    QStringList smimeSuffixes;\n    smimeSuffixes << \".pem\" << \".der\", \".p7c\", \".p12\";\n    Q_FOREACH ( const QString& i, smimeSuffixes )\n        if ( filename.endsWith( i, Qt::CaseInsensitive ) )\n            return GpgME::CMS;\n    if ( filename.endsWith( \".asc\", Qt::CaseInsensitive ) )\n        return GpgME::OpenPGP;\n    return GpgME::UnknownProtocol;\n}\n\nvoid ImportCertificateCommand::Private::startImport( const QByteArray& data )\n{\n    const GpgME::Protocol protocol = checkProtocol( data, filename );\n    if ( protocol == GpgME::UnknownProtocol ) \/\/TODO: might use exceptions here\n    {\n        KMessageBox::error( parent, i18n( \"Could not determine certificate type.\", filename ), i18n( \"Certificate Import Failed\" ) );\n        emit q->canceled(); \/\/TODO: use correct signal\n        return;\n    }\n\n    std::auto_ptr<ImportJob> job( CryptoBackendFactory::instance()->protocol( protocol )->importJob() );\n    assert( job.get() );\n    connect( job.get(), SIGNAL(result( GpgME::ImportResult ) ),\n             q, SLOT( importResult( GpgME::ImportResult ) ) );\n    connect( job.get(), SIGNAL( process( QString, int, int ) ), \n             q, SIGNAL( process( QString, int, int ) ) );\n    const GpgME::Error err = job->start( data );\n\n    importJob = job.release();\n}\n\n\nvoid ImportCertificateCommand::doCancel()\n{\n    if ( d->importJob )\n        d->importJob->slotCancel();\n}\n\n#include \"moc_importcertificatecommand.cpp\"\n\n<commit_msg>++emit finished<commit_after>\/* -*- mode: c++; c-basic-offset:4 -*-\n    importcertificatecommand.cpp\n\n    This file is part of Kleopatra, the KDE keymanager\n    Copyright (c) 2007 Klarälvdalens 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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  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 \"importcertificatecommand.h\"\n\n#include <kleo\/cryptobackendfactory.h>\n#include <kleo\/importjob.h>\n\n#include <gpgme++\/global.h>\n#include <gpgme++\/importresult.h>\n\n#include <KLocale>\n#include <KMessageBox>\n#include <KJob>\n\n#include <QByteArray>\n#include <QFile>\n#include <QFileDialog>\n#include <QPointer>\n#include <QString>\n#include <QWidget>\n\n#include <memory>\n\nusing namespace GpgME;\nusing namespace Kleo;\n\nclass ImportCertificateCommand::Private {\n    friend class ::ImportCertificateCommand;\n    ImportCertificateCommand * const q;\npublic:\n    explicit Private( ImportCertificateCommand * qq );\n    ~Private();\n\n    bool ensureHaveFile();\n    void startImport( const QByteArray& data );\n    void importResult( const GpgME::ImportResult& );\n    GpgME::Protocol checkProtocol( const QByteArray& data, const QString& filename ) const;\n    void showError( const GpgME::Error& error );\n    void showDetails( const ImportResult& result );\n\nprivate:\n    QWidget* parent;\n    QPointer<ImportJob> importJob;\n    QString filename;\n};\n\n\nImportCertificateCommand::Private::Private( ImportCertificateCommand * qq )\n    : q( qq ), parent( 0 ), importJob( 0 )\n{\n    \n}\n\nImportCertificateCommand::Private::~Private() \n{\n    if ( importJob )\n        importJob->slotCancel();\n}\n\n\n\nImportCertificateCommand::ImportCertificateCommand( KeyListController * parent )\n  : Command( parent ), d( new Private( this ) )\n{\n    \n}\n\nImportCertificateCommand::~ImportCertificateCommand() {}\n\nvoid ImportCertificateCommand::setParentWidget( QWidget* parent )\n{\n    d->parent = parent;\n}\n\nQString ImportCertificateCommand::fileName() const\n{\n    return d->filename;\n}\n\nvoid ImportCertificateCommand::setFileName( const QString& fileName )\n{\n    d->filename = fileName;\n}\n\nvoid ImportCertificateCommand::doStart()\n{\n    if ( !d->ensureHaveFile() )\n    {\n        emit canceled();\n        return;\n    }\n    \/\/TODO: use KIO here\n    QFile in( d->filename );\n    if ( !in.open( QIODevice::ReadOnly ) )\n    {\n        KMessageBox::error( d->parent, i18n( \"Could not open file %1 for reading\", d->filename ), i18n( \"Certificate Import Failed\" ) );\n        \n        emit finished(); \/\/TODO: correct signal??\n        return;\n    }\n    d->startImport( in.readAll() ); \n    emit info( i18n( \"Importing certificate...\" ) );\n}\n\nbool ImportCertificateCommand::Private::ensureHaveFile()\n{\n   if ( filename.isNull() )\n        filename = QFileDialog::getOpenFileName( parent, i18n( \"Select Certificate File\" ), QString(), i18n( \"Certificates (*.asc *.pem *.der *.p7c *.p12)\" )  );\n   return !filename.isNull();\n}\n\nvoid ImportCertificateCommand::Private::showDetails( const ImportResult& res )\n{\n      const KLocalizedString normalLine = ki18n(\"<tr><td align=\\\"right\\\">%1<\/td><td>%2<\/td><\/tr>\");\n        const KLocalizedString boldLine = ki18n(\"<tr><td align=\\\"right\\\"><b>%1<\/b><\/td><td>%2<\/td><\/tr>\");\n\n        QStringList lines;\n        lines.push_back( normalLine.subs( i18n(\"Total number processed:\") )\n                         .subs( res.numConsidered() ).toString() );\n        lines.push_back( normalLine.subs( i18n(\"Imported:\") )\n                         .subs( res.numImported() ).toString() );\n        if ( res.newSignatures() )\n            lines.push_back( normalLine.subs( i18n(\"New signatures:\") )\n                             .subs( res.newSignatures() ).toString() );\n        if ( res.newUserIDs() )\n            lines.push_back( normalLine.subs( i18n(\"New user IDs:\") )\n                             .subs( res.newUserIDs() ).toString() );\n        if ( res.numKeysWithoutUserID() )\n            lines.push_back( normalLine.subs( i18n(\"Keys without user IDs:\") )\n                             .subs( res.numKeysWithoutUserID() ).toString() );\n        if ( res.newSubkeys() )\n            lines.push_back( normalLine.subs( i18n(\"New subkeys:\") )\n                             .subs( res.newSubkeys() ).toString() );\n        if ( res.newRevocations() )\n            lines.push_back( boldLine.subs( i18n(\"Newly revoked:\") )\n                             .subs( res.newRevocations() ).toString() );\n        if ( res.notImported() )\n            lines.push_back( boldLine.subs( i18n(\"Not imported:\") )\n                             .subs( res.notImported() ).toString() );\n        if ( res.numUnchanged() )\n            lines.push_back( normalLine.subs( i18n(\"Unchanged:\") )\n                             .subs( res.numUnchanged() ).toString() );\n        if ( res.numSecretKeysConsidered() )\n            lines.push_back( normalLine.subs( i18n(\"Secret keys processed:\") )\n                             .subs( res.numSecretKeysConsidered() ).toString() );\n        if ( res.numSecretKeysImported() )\n            lines.push_back( normalLine.subs( i18n(\"Secret keys imported:\") )\n                             .subs( res.numSecretKeysImported() ).toString() );\n        if ( res.numSecretKeysConsidered() - res.numSecretKeysImported() - res.numSecretKeysUnchanged() > 0 )\n            lines.push_back( boldLine.subs( i18n(\"Secret keys <em>not<\/em> imported:\") )\n                             .subs(  res.numSecretKeysConsidered()\n                                     - res.numSecretKeysImported()\n                                     - res.numSecretKeysUnchanged() ).toString() );\n        if ( res.numSecretKeysUnchanged() )\n            lines.push_back( normalLine.subs( i18n(\"Secret keys unchanged:\") )\n                             .subs( res.numSecretKeysUnchanged() ).toString() );\n        \n        KMessageBox::information( parent,\n                                  i18n( \"<qt><p>Detailed results of importing %1:<\/p>\"\n                                        \"<table>%2<\/table><\/qt>\" ,\n                                        filename, lines.join( QString() ) ),\n                                  i18n( \"Certificate Import Result\" ) );\n}\n\nvoid ImportCertificateCommand::Private::showError( const GpgME::Error& err )\n{\n  assert( err );\n  const QString msg = i18n( \"<qt><p>An error occurred while trying \"\n\t\t\t    \"to import the certificate %1:<\/p>\"\n\t\t\t    \"<p><b>%2<\/b><\/p><\/qt>\",\n                            filename,\n                            QString::fromLocal8Bit( err.asString() ) );\n  KMessageBox::error( parent, msg, i18n( \"Certificate Import Failed\" ) );\n}\n\nvoid ImportCertificateCommand::Private::importResult( const GpgME::ImportResult& result )\n{\n    if ( result.error().isCanceled() ) {\n        emit q->canceled();\n        return;\n    }\n\n    if ( result.error() ) { \n        showError( result.error() );\n        emit q->finished();\n        return;\n    }\n\n    showDetails( result );\n    emit q->finished();\n}\n\nGpgME::Protocol ImportCertificateCommand::Private::checkProtocol( const QByteArray& data, const QString& filename ) const\n{\n    QStringList smimeSuffixes;\n    smimeSuffixes << \".pem\" << \".der\", \".p7c\", \".p12\";\n    Q_FOREACH ( const QString& i, smimeSuffixes )\n        if ( filename.endsWith( i, Qt::CaseInsensitive ) )\n            return GpgME::CMS;\n    if ( filename.endsWith( \".asc\", Qt::CaseInsensitive ) )\n        return GpgME::OpenPGP;\n    return GpgME::UnknownProtocol;\n}\n\nvoid ImportCertificateCommand::Private::startImport( const QByteArray& data )\n{\n    const GpgME::Protocol protocol = checkProtocol( data, filename );\n    if ( protocol == GpgME::UnknownProtocol ) \/\/TODO: might use exceptions here\n    {\n        KMessageBox::error( parent, i18n( \"Could not determine certificate type.\", filename ), i18n( \"Certificate Import Failed\" ) );\n        emit q->canceled(); \/\/TODO: use correct signal\n        return;\n    }\n\n    std::auto_ptr<ImportJob> job( CryptoBackendFactory::instance()->protocol( protocol )->importJob() );\n    assert( job.get() );\n    connect( job.get(), SIGNAL(result( GpgME::ImportResult ) ),\n             q, SLOT( importResult( GpgME::ImportResult ) ) );\n    connect( job.get(), SIGNAL( process( QString, int, int ) ), \n             q, SIGNAL( process( QString, int, int ) ) );\n    const GpgME::Error err = job->start( data );\n\n    importJob = job.release();\n}\n\n\nvoid ImportCertificateCommand::doCancel()\n{\n    if ( d->importJob )\n        d->importJob->slotCancel();\n}\n\n#include \"moc_importcertificatecommand.cpp\"\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * CocircConn.cpp\n *\n *  Created on: Nov 10, 2008\n *      Author: rasmussn\n *\/\n\n#include \"GeislerConn.hpp\"\n#include \"..\/PetaVision\/src\/io\/io.h\"\n#include \"..\/PetaVision\/src\/utils\/conversions.h\"\n#include \"..\/PetaVision\/src\/include\/pv_types.h\"\n#include <assert.h>\n#include <string.h>\n\nnamespace PV {\n\nGeislerConn::GeislerConn()\n{\n   printf(\"GeislerConn::GeislerConn: running default constructor\\n\");\n   initialize_base();\n}\n\nGeislerConn::GeislerConn(const char * name, HyPerCol * hc, HyPerLayer * pre,\n      HyPerLayer * post, int channel)\n{\n   initialize_base();\n   initialize(name, hc, pre, post, channel);\n}\n\nGeislerConn::GeislerConn(const char * name, HyPerCol * hc, HyPerLayer * pre,\n      HyPerLayer * post)\n{\n   initialize_base();\n   initialize(name, hc, pre, post, channel, NULL); \/\/ use default channel\n}\n\n\/\/ provide filename or set to NULL\nGeislerConn::GeislerConn(const char * name, HyPerCol * hc, HyPerLayer * pre,\n      HyPerLayer * post, int channel, const char * filename)\n{\n   initialize_base();\n   initialize(name, hc, pre, post, channel, filename);\n}\n\nint GeislerConn::initialize_base()\n{\n\tnumUpdates = 0;\n\tavePreActivity = 0.0;\n\tavePostActivity = 0.0;\n\tgeislerPatches = NULL;\n\treturn KernelConn::initialize_base();\n}\n\n\nPVPatch ** GeislerConn::createWeights(PVPatch ** patches, int nPatches, int nxPatch,\n      int nyPatch, int nfPatch)\n{\n\tgeislerPatches = allocWeights(patches, nPatches, nxPatch, nyPatch, nfPatch);\n\treturn KernelConn::createWeights(patches, nPatches, nxPatch, nyPatch, nfPatch);\n}\n\nint GeislerConn::deleteWeights()\n{\n   const int arbor = 0;\n\n   for (int k = 0; k < numDataPatches(arbor); k++) {\n      pvpatch_inplace_delete(geislerPatches[k]);\n   }\n   free(geislerPatches);\n\n   return KernelConn::deleteWeights();\n}\n\nPVPatch ** GeislerConn::initializeDefaultWeights(PVPatch ** patches, int numPatches)\n{\n   \/\/ patches should already be initialized to zero\n   return patches;\n}\n\n\nint GeislerConn::updateState(float time, float dt)\n{\n\tint axonID = 0;\n\tnumUpdates++;\n\tint nPreEx = pre->clayer->numExtended;\n\tconst pvdata_t * aPre = pre->getLayerData();\n\tpvdata_t avePre = 0.0;\n\tfor (int kPre = 0; kPre < nPreEx; kPre++){\n\t\tavePre += aPre[kPre];\n\t}\n\tavePre \/= nPreEx;\n\tavePreActivity += avePre;\n\tint nPost = post->clayer->numNeurons;\n\tconst pvdata_t * aPost = post->getLayerData();\n\n\tpvdata_t avePost = 0.0;\n\tfor (int kPost = 0; kPost < nPost; kPost++){\n\t\tavePost += aPost[kPost];\n\t}\n\tavePost \/= nPost;\n\tavePostActivity += avePost;\n\n\t\/\/ initialize geislerPatches\n\tint numKernels = this->numDataPatches(axonID);\n\tint numWeights = nxp * nyp * nfp;\n\tfor (int iKernel = 0; iKernel < numKernels; iKernel++){\n\t\tpvdata_t * kernelWeights = kernelPatches[iKernel]->data;\n\t\tpvdata_t * geislerWeights = geislerPatches[iKernel]->data;\n\t\tfor (int iWeight = 0; iWeight < numWeights; iWeight++){\n\t\t\tkernelWeights[iWeight] = geislerWeights[iWeight];\n\t\t\tgeislerWeights[iWeight] = 0.0;\n\t\t}\n\t}\n\n\tint status = updateWeights(axonID);\n\n\t\/\/ normalize geislerPatches\n\tfor (int iKernel = 0; iKernel < numKernels; iKernel++){\n\t\tpvdata_t * kernelWeights = kernelPatches[iKernel]->data;\n\t\tpvdata_t * geislerWeights = geislerPatches[iKernel]->data;\n\t\tfor (int iWeight = 0; iWeight < numWeights; iWeight++){\n\t\t\tgeislerWeights[iWeight] \/= nPost;\n\t\t\tgeislerWeights[iWeight] += kernelWeights[iWeight];\n#ifdef APPLY_GEISLER_WEIGHTS\n\t\t\tkernelWeights[iWeight] \/= numUpdates;\n\t\t\tpvdata_t kernelNorm = (avePreActivity \/ numUpdates ) * (avePostActivity \/ numUpdates );\n\t\t\tkernelWeights[iWeight] -= kernelNorm;\n#else\n\t\t\tkernelWeights[iWeight] = 0.0;\n#endif\n\t\t}\n\t}\n#ifdef APPLY_GEISLER_WEIGHTS\n\tthis->normalizeWeights(this->kernelPatches, this->numDataPatches(axonID));\n#endif\n\treturn status;\n}\n\n\nint GeislerConn::updateWeights(int axonID)\n{\n\t\/\/ this stride is in extended space for post-synaptic activity and\n\t\/\/ STDP decrement variable\n\tconst int postStrideY = post->clayer->numFeatures\n                         * (post->clayer->loc.nx + 2 * post->clayer->loc.nPad);\n\n\tconst int numExtended = pre->clayer->numExtended;\n\tassert(numExtended == numWeightPatches(axonID));\n\n\tconst pvdata_t * preLayerData = pre->getLayerData();\n\n\tint numKernelPatches = numDataPatches(axonID);\n\n\tfor (int kPre = 0; kPre < numExtended; kPre++) {\n      PVAxonalArbor * arbor = axonalArbor(kPre, axonID);\n\n      const float aPre = preLayerData[kPre];\n\n      PVPatch * wPatch = arbor->weights;\n      size_t postOffset = arbor->offset;\n      const pvdata_t * aPost = &post->getLayerData()[postOffset];\n\n      int nk  = wPatch->nf * wPatch->nx; \/\/ one line in x at a time\n      int ny  = wPatch->ny;\n      int sy  = wPatch->sy;\n\n      const int nKernels = this->numDataPatches(axonID);\n      int kfPre = kPre % nKernels;\n      PVPatch * gPatch = geislerPatches[kfPre];\n\n      pvdata_t * data_head = (pvdata_t *) ((char*) wPatch + sizeof(PVPatch));\n      size_t data_offset = wPatch->data - data_head;\n      pvdata_t * gWeights = &gPatch->data[data_offset];\n\n      for (int y = 0; y < ny; y++) {\n         for (int k = 0; k < nk; k++) {\n             gWeights[k] += aPre  * aPost[k];\n         }\n          \/\/ advance pointers in y\n         gWeights += sy;\n         \/\/ postActivity and M are extended layer\n         aPost += postStrideY;\n     }\n   }\n\n   return 0;\n}\n\nint GeislerConn::writeWeights(float time, bool last)\n{\n#ifdef APPLY_GEISLER_WEIGHTS\n\t\/\/ do nothing, kernels are already up to date\n#else\n\t\/\/ copy geislerPatches to kernelPatches\n\tconst int axonID = 0;\n\tconst int numKernels = numDataPatches(axonID);\n\tconst int numWeights = nxp * nyp * nfp;\n\tfor (int iKernel = 0; iKernel < numKernels; iKernel++){\n\t\t\tpvdata_t * kernelWeights = kernelPatches[iKernel]->data;\n\t\t\tpvdata_t * geislerWeights = geislerPatches[iKernel]->data;\n\t\t\tfor (int iWeight = 0; iWeight < numWeights; iWeight++){\n\t\t\t\tkernelWeights[iWeight] = geislerWeights[iWeight];\n\t\t\t\tkernelWeights[iWeight] \/= numUpdates;\n\t\t\t\tpvdata_t kernelNorm = (avePreActivity \/ numUpdates ) * (avePostActivity \/ numUpdates );\n\t\t\t\tkernelWeights[iWeight] -= kernelNorm;\n\t\t\t}\n\t\t}\n\tthis->normalizeWeights(this->kernelPatches, this->numDataPatches(axonID));\n#endif\n\treturn KernelConn::writeWeights(time, last);\n}\n\n\n\n} \/\/ namespace PV\n<commit_msg>bug fixes<commit_after>\/*\n * CocircConn.cpp\n *\n *  Created on: Nov 10, 2008\n *      Author: rasmussn\n *\/\n\n#include \"GeislerConn.hpp\"\n#include \"..\/PetaVision\/src\/io\/io.h\"\n#include \"..\/PetaVision\/src\/utils\/conversions.h\"\n#include \"..\/PetaVision\/src\/include\/pv_types.h\"\n#include <assert.h>\n#include <string.h>\n\nnamespace PV {\n\nGeislerConn::GeislerConn()\n{\n   printf(\"GeislerConn::GeislerConn: running default constructor\\n\");\n   initialize_base();\n}\n\nGeislerConn::GeislerConn(const char * name, HyPerCol * hc, HyPerLayer * pre,\n      HyPerLayer * post, int channel)\n{\n   initialize_base();\n   initialize(name, hc, pre, post, channel);\n}\n\nGeislerConn::GeislerConn(const char * name, HyPerCol * hc, HyPerLayer * pre,\n      HyPerLayer * post)\n{\n   initialize_base();\n   initialize(name, hc, pre, post, channel, NULL); \/\/ use default channel\n}\n\n\/\/ provide filename or set to NULL\nGeislerConn::GeislerConn(const char * name, HyPerCol * hc, HyPerLayer * pre,\n      HyPerLayer * post, int channel, const char * filename)\n{\n   initialize_base();\n   initialize(name, hc, pre, post, channel, filename);\n}\n\nint GeislerConn::initialize_base()\n{\n\tnumUpdates = 0;\n\tavePreActivity = 0.0;\n\tavePostActivity = 0.0;\n\tgeislerPatches = NULL;\n\treturn KernelConn::initialize_base();\n}\n\n\nPVPatch ** GeislerConn::createWeights(PVPatch ** patches, int nPatches, int nxPatch,\n      int nyPatch, int nfPatch)\n{\n\tconst int arbor = 0;\n\tint numGeislerPatches = numDataPatches(arbor);\n\n\tgeislerPatches = (PVPatch**) calloc(sizeof(PVPatch*), numGeislerPatches);\n\tassert(geislerPatches != NULL);\n\n\tfor (int geislerIndex = 0; geislerIndex < numGeislerPatches; geislerIndex++) {\n\t\tgeislerPatches[geislerIndex] = pvpatch_inplace_new(nxPatch, nyPatch, nfPatch);\n\t\tassert(geislerPatches[geislerIndex] != NULL );\n\t}\n\n\treturn KernelConn::createWeights(patches, nPatches, nxPatch, nyPatch, nfPatch);\n}\n\nint GeislerConn::deleteWeights()\n{\n   const int arbor = 0;\n\n   for (int k = 0; k < numDataPatches(arbor); k++) {\n      pvpatch_inplace_delete(geislerPatches[k]);\n   }\n   free(geislerPatches);\n\n   return KernelConn::deleteWeights();\n}\n\nPVPatch ** GeislerConn::initializeDefaultWeights(PVPatch ** patches, int numPatches)\n{\n   \/\/ patches should already be initialized to zero\n   return patches;\n}\n\n\nint GeislerConn::updateState(float time, float dt)\n{\n\tint axonID = 0;\n\tnumUpdates++;\n\tint nPreEx = pre->clayer->numExtended;\n\tconst pvdata_t * aPre = pre->getLayerData();\n\tpvdata_t avePre = 0.0;\n\tfor (int kPre = 0; kPre < nPreEx; kPre++){\n\t\tavePre += aPre[kPre];\n\t}\n\tavePre \/= nPreEx;\n\tavePreActivity += avePre;\n\tint nPost = post->clayer->numNeurons;\n\tconst pvdata_t * aPost = post->getLayerData();\n\n\tpvdata_t avePost = 0.0;\n\tfor (int kPost = 0; kPost < nPost; kPost++){\n\t\tavePost += aPost[kPost];\n\t}\n\tavePost \/= nPost;\n\tavePostActivity += avePost;\n\n\t\/\/ initialize geislerPatches\n\tint numKernels = this->numDataPatches(axonID);\n\tint numWeights = nxp * nyp * nfp;\n\tfor (int iKernel = 0; iKernel < numKernels; iKernel++){\n\t\tpvdata_t * kernelWeights = kernelPatches[iKernel]->data;\n\t\tpvdata_t * geislerWeights = geislerPatches[iKernel]->data;\n\t\tfor (int iWeight = 0; iWeight < numWeights; iWeight++){\n\t\t\tkernelWeights[iWeight] = geislerWeights[iWeight];\n\t\t\tgeislerWeights[iWeight] = 0.0;\n\t\t}\n\t}\n\n\tint status = updateWeights(axonID);\n\n\t\/\/ normalize geislerPatches\n\tfor (int iKernel = 0; iKernel < numKernels; iKernel++){\n\t\tpvdata_t * kernelWeights = kernelPatches[iKernel]->data;\n\t\tpvdata_t * geislerWeights = geislerPatches[iKernel]->data;\n\t\tfor (int iWeight = 0; iWeight < numWeights; iWeight++){\n\t\t\tgeislerWeights[iWeight] \/= nPost;\n\t\t\tgeislerWeights[iWeight] += kernelWeights[iWeight];\n#ifdef APPLY_GEISLER_WEIGHTS\n\t\t\tkernelWeights[iWeight] \/= numUpdates;\n\t\t\tpvdata_t kernelNorm = (avePreActivity \/ numUpdates ) * (avePostActivity \/ numUpdates );\n\t\t\tkernelWeights[iWeight] -= kernelNorm;\n#else\n\t\t\tkernelWeights[iWeight] = 0.0;\n#endif\n\t\t}\n\t}\n#ifdef APPLY_GEISLER_WEIGHTS\n\tthis->normalizeWeights(this->kernelPatches, this->numDataPatches(axonID));\n#endif\n\treturn status;\n}\n\n\nint GeislerConn::updateWeights(int axonID)\n{\n\t\/\/ this stride is in extended space for post-synaptic activity and\n\t\/\/ STDP decrement variable\n\tint postStrideY = post->clayer->numFeatures\n                         * (post->clayer->loc.nx + 2 * post->clayer->loc.nPad);\n\n\tint numExtended = pre->clayer->numExtended;\n\tassert(numExtended == numWeightPatches(axonID));\n\n\tconst pvdata_t * preLayerData = pre->getLayerData();\n\n\tint nKernels = numDataPatches(axonID);\n\n\tfor (int kPre = 0; kPre < numExtended; kPre++) {\n      PVAxonalArbor * arbor = axonalArbor(kPre, axonID);\n\n      float aPre = preLayerData[kPre];\n      if (aPre == 0.0) continue;\n\n      PVPatch * wPatch = arbor->weights;\n      size_t postOffset = arbor->offset;\n      const pvdata_t * aPost = &post->getLayerData()[postOffset];\n\n      int nk  = wPatch->nf * wPatch->nx; \/\/ one line in x at a time\n      int ny  = wPatch->ny;\n      int sy  = wPatch->sy;\n\n      int kfPre = kPre % nKernels;\n      PVPatch * gPatch = geislerPatches[kfPre];\n      PVPatch * kPatch = kernelPatches[kfPre];\n\n      pvdata_t * data_head = (pvdata_t *) ((char*) kPatch + sizeof(PVPatch));\n      pvdata_t * data_begin = kPatch->data;\n      size_t data_offset = data_begin - data_head;\n      pvdata_t * gWeights = &gPatch->data[data_offset];\n\n      for (int y = 0; y < ny; y++) {\n         for (int k = 0; k < nk; k++) {\n             gWeights[k] += aPre  * aPost[k];\n         }\n          \/\/ advance pointers in y\n         gWeights += sy;\n         \/\/ postActivity and M are extended layer\n         aPost += postStrideY;\n     }\n   }\n\n   return 0;\n}\n\nint GeislerConn::writeWeights(float time, bool last)\n{\n#ifdef APPLY_GEISLER_WEIGHTS\n\t\/\/ do nothing, kernels are already up to date\n#else\n\t\/\/ copy geislerPatches to kernelPatches\n\tconst int axonID = 0;\n\tconst int numKernels = numDataPatches(axonID);\n\tconst int numWeights = nxp * nyp * nfp;\n\tfor (int iKernel = 0; iKernel < numKernels; iKernel++){\n\t\t\tpvdata_t * kernelWeights = kernelPatches[iKernel]->data;\n\t\t\tpvdata_t * geislerWeights = geislerPatches[iKernel]->data;\n\t\t\tfor (int iWeight = 0; iWeight < numWeights; iWeight++){\n\t\t\t\tkernelWeights[iWeight] = geislerWeights[iWeight];\n\t\t\t\tkernelWeights[iWeight] \/= numUpdates;\n\t\t\t\tpvdata_t kernelNorm = (avePreActivity \/ numUpdates ) * (avePostActivity \/ numUpdates );\n\t\t\t\tkernelWeights[iWeight] -= kernelNorm;\n\t\t\t}\n\t\t}\n\tthis->normalizeWeights(this->kernelPatches, this->numDataPatches(axonID));\n#endif\n\treturn KernelConn::writeWeights(time, last);\n}\n\n\n\n} \/\/ namespace PV\n<|endoftext|>"}
{"text":"<commit_before>\/*\n Implement wildcard pattern matching with support for '?' and '*'.\n\n'?' Matches any single character.\n'*' Matches any sequence of characters (including the empty sequence).\n\nThe matching should cover the entire input string (not partial).\n\nThe function prototype should be:\nbool isMatch(const char *s, const char *p)\n\nSome examples:\nisMatch(\"aa\",\"a\") → false\nisMatch(\"aa\",\"aa\") → true\nisMatch(\"aaa\",\"aa\") → false\nisMatch(\"aa\", \"*\") → true\nisMatch(\"aa\", \"a*\") → true\nisMatch(\"ab\", \"?*\") → true\nisMatch(\"aab\", \"c*a*b\") → false\n*\/\n\nclass Solution {\npublic:\n    bool isMatch(const char *s, const char *p) {\n        if(!s[0] && !p[0])\n            return true;\n        else if(!s[0])\n            return p[0] == '*' && !p[1];\n        else if(!p[0])\n            return false;\n\n        vector<vector<bool> > his;\n        int ssize = -1;\n\t\tint pcount = 0;\n\n        for(int i = 0; p[i]; ++i){\n            his.push_back(vector<bool>(pcount, false));\n            vector<bool> &res = his.back(); \n\n\t\t\tint j;\n            for(j = pcount; (ssize == -1 || j < ssize) && s[j]; ++j){\n                bool pmatch = (!j || !i) || his[i - 1][j - 1]; \/\/<! if his[i - 1][j - 1] matched\n                bool match = false;\n                if(p[i] == '*'){\n                    match = pmatch || (j > 0 && his[i][j - 1]) || (i > 0 && his[i - 1][j]);\n                }\n\t\t\t\telse if((p[i] == '?' || s[j] == p[i]) && (i || i == j)){\n                    match = pmatch;\n                }\n\n                res.push_back(match);\n            }\n\t\t\tssize = j;\n\n\t\t\tpcount += p[i] != '*';\n        }\n        \n        return his.back().back();\n    }\n};\n<commit_msg>add Yu Zhu wildcard solution<commit_after>\/*\n Implement wildcard pattern matching with support for '?' and '*'.\n\n'?' Matches any single character.\n'*' Matches any sequence of characters (including the empty sequence).\n\nThe matching should cover the entire input string (not partial).\n\nThe function prototype should be:\nbool isMatch(const char *s, const char *p)\n\nSome examples:\nisMatch(\"aa\",\"a\") → false\nisMatch(\"aa\",\"aa\") → true\nisMatch(\"aaa\",\"aa\") → false\nisMatch(\"aa\", \"*\") → true\nisMatch(\"aa\", \"a*\") → true\nisMatch(\"ab\", \"?*\") → true\nisMatch(\"aab\", \"c*a*b\") → false\n*\/\n\nclass Solution {\npublic:\n    bool isMatch(const char *s, const char *p) {\n        \/\/NOTE: copy from http:\/\/yucoding.blogspot.com\/2013\/02\/leetcode-question-123-wildcard-matching.html\n        \/\/ Start typing your C\/C++ solution below\n        \/\/ DO NOT write int main() function\n         \n        const char* star=NULL;\n        const char* ss=s; \n        while (*s){\n            if ((*p=='?')||(*p==*s)){s++;p++;continue;}\n            if (*p=='*'){star=p++; ss=s;continue;}\n            if (star){ p = star+1; s=++ss;continue;}\n            return false;\n        }\n        while (*p=='*'){p++;}\n        return !*p;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2019 pengjian.uestc @ gmail.com\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 seastar::sharded in the hope that it 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 \"redis\/options.hh\"\n#include \"redis\/protocol_parser.hh\"\n#include \"redis\/query_processor.hh\"\n#include \"redis\/reply.hh\"\n#include \"redis\/request.hh\"\n#include \"redis\/stats.hh\"\n\n#include \"auth\/authenticator.hh\"\n#include \"auth\/service.hh\"\n#include \"cql3\/values.hh\"\n#include \"service\/client_state.hh\"\n#include \"service\/storage_proxy.hh\"\n#include \"service_permit.hh\"\n#include \"timeout_config.hh\"\n#include \"utils\/estimated_histogram.hh\"\n#include \"utils\/fragmented_temporary_buffer.hh\"\n\n#include <seastar\/core\/seastar.hh>\n#include <seastar\/core\/semaphore.hh>\n#include <seastar\/core\/sharded.hh>\n#include <seastar\/net\/tls.hh>\n\n#include <memory>\n\ndb::consistency_level make_consistency_level(const sstring&);\n\nclass redis_exception;\n\nnamespace redis_transport {\n\nstruct redis_server_config {\n    ::timeout_config _timeout_config;\n    size_t _max_request_size;\n    db::consistency_level _read_consistency_level;\n    db::consistency_level _write_consistency_level;\n    size_t _total_redis_db_count;\n};\n\nclass redis_server {\n    std::vector<server_socket> _listeners;\n    seastar::sharded<service::storage_proxy>& _proxy;\n    seastar::sharded<redis::query_processor>& _query_processor;\n    redis_server_config _config;\n    size_t _max_request_size;\n    semaphore _memory_available;\n    redis::stats _stats;\n    uint64_t _requests_blocked_memory = 0;\n    auth::service& _auth_service;\n    size_t _total_redis_db_count;\n\npublic:\n    redis_server(seastar::sharded<service::storage_proxy>& proxy, seastar::sharded<redis::query_processor>& qp, auth::service& auth_service, redis_server_config config);\n    future<> listen(socket_address addr, std::shared_ptr<seastar::tls::credentials_builder> = {}, bool keepalive = false);\n    future<> do_accepts(int which, bool keepalive, socket_address server_addr);\n    future<> stop();\n\n    struct result {\n        result(redis::redis_message&& m) : _data(make_foreign(std::make_unique<redis::redis_message>(std::move(m)))) {}\n        foreign_ptr<std::unique_ptr<redis::redis_message>> _data;\n        inline lw_shared_ptr<scattered_message<char>> make_message()  {\n            return _data->message();\n        }\n    };\n    using response_type = result;\n\nprivate:\n    friend class connection;\n    class connection : public boost::intrusive::list_base_hook<> {\n        redis_server& _server;\n        socket_address _server_addr;\n        connected_socket _fd;\n        input_stream<char> _read_buf;\n        output_stream<char> _write_buf;\n        redis_protocol_parser _parser;\n        seastar::gate _pending_requests_gate;\n        redis::redis_options _options;\n        future<> _ready_to_respond = make_ready_future<>();\n    private:\n        enum class tracing_request_type : uint8_t {\n            not_requested,\n            no_write_on_close,\n            write_on_close\n        };  \n\n        using execution_stage_type = inheriting_concrete_execution_stage<\n                future<redis_server::result>,\n                redis_server::connection*,\n                redis::request&&,\n                redis::redis_options&,\n                service_permit\n        >;\n        static thread_local execution_stage_type _process_request_stage;\n    public:\n        connection(redis_server& server, socket_address server_addr, connected_socket&& fd, socket_address addr);\n        ~connection();\n        future<> process();\n        future<> process_request();\n        void write_reply(const redis_exception&);\n        void write_reply(redis_server::result result);\n        future<> shutdown();\n    private:\n        const ::timeout_config& timeout_config() { return _server.timeout_config(); }\n        friend class process_request_executor;\n        future<result> process_request_one(redis::request&& request, redis::redis_options&, service_permit permit);\n        future<result> process_request_internal();\n    };\n\n    bool _stopping = false;\n    promise<> _all_connections_stopped;\n    future<> _stopped = _all_connections_stopped.get_future();\n    boost::intrusive::list<connection> _connections_list;\n\n    void maybe_idle() {\n        if (_stopping && !_stats._connections_being_accepted && !_stats._current_connections) {\n            _all_connections_stopped.set_value();\n        }\n    }\n    const ::timeout_config& timeout_config() { return _config._timeout_config; }\n};\n}\n<commit_msg>redis: Remove unused process_request_executor friend declaration<commit_after>\/*\n * Copyright (C) 2019 pengjian.uestc @ gmail.com\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 seastar::sharded in the hope that it 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 \"redis\/options.hh\"\n#include \"redis\/protocol_parser.hh\"\n#include \"redis\/query_processor.hh\"\n#include \"redis\/reply.hh\"\n#include \"redis\/request.hh\"\n#include \"redis\/stats.hh\"\n\n#include \"auth\/authenticator.hh\"\n#include \"auth\/service.hh\"\n#include \"cql3\/values.hh\"\n#include \"service\/client_state.hh\"\n#include \"service\/storage_proxy.hh\"\n#include \"service_permit.hh\"\n#include \"timeout_config.hh\"\n#include \"utils\/estimated_histogram.hh\"\n#include \"utils\/fragmented_temporary_buffer.hh\"\n\n#include <seastar\/core\/seastar.hh>\n#include <seastar\/core\/semaphore.hh>\n#include <seastar\/core\/sharded.hh>\n#include <seastar\/net\/tls.hh>\n\n#include <memory>\n\ndb::consistency_level make_consistency_level(const sstring&);\n\nclass redis_exception;\n\nnamespace redis_transport {\n\nstruct redis_server_config {\n    ::timeout_config _timeout_config;\n    size_t _max_request_size;\n    db::consistency_level _read_consistency_level;\n    db::consistency_level _write_consistency_level;\n    size_t _total_redis_db_count;\n};\n\nclass redis_server {\n    std::vector<server_socket> _listeners;\n    seastar::sharded<service::storage_proxy>& _proxy;\n    seastar::sharded<redis::query_processor>& _query_processor;\n    redis_server_config _config;\n    size_t _max_request_size;\n    semaphore _memory_available;\n    redis::stats _stats;\n    uint64_t _requests_blocked_memory = 0;\n    auth::service& _auth_service;\n    size_t _total_redis_db_count;\n\npublic:\n    redis_server(seastar::sharded<service::storage_proxy>& proxy, seastar::sharded<redis::query_processor>& qp, auth::service& auth_service, redis_server_config config);\n    future<> listen(socket_address addr, std::shared_ptr<seastar::tls::credentials_builder> = {}, bool keepalive = false);\n    future<> do_accepts(int which, bool keepalive, socket_address server_addr);\n    future<> stop();\n\n    struct result {\n        result(redis::redis_message&& m) : _data(make_foreign(std::make_unique<redis::redis_message>(std::move(m)))) {}\n        foreign_ptr<std::unique_ptr<redis::redis_message>> _data;\n        inline lw_shared_ptr<scattered_message<char>> make_message()  {\n            return _data->message();\n        }\n    };\n    using response_type = result;\n\nprivate:\n    friend class connection;\n    class connection : public boost::intrusive::list_base_hook<> {\n        redis_server& _server;\n        socket_address _server_addr;\n        connected_socket _fd;\n        input_stream<char> _read_buf;\n        output_stream<char> _write_buf;\n        redis_protocol_parser _parser;\n        seastar::gate _pending_requests_gate;\n        redis::redis_options _options;\n        future<> _ready_to_respond = make_ready_future<>();\n    private:\n        enum class tracing_request_type : uint8_t {\n            not_requested,\n            no_write_on_close,\n            write_on_close\n        };  \n\n        using execution_stage_type = inheriting_concrete_execution_stage<\n                future<redis_server::result>,\n                redis_server::connection*,\n                redis::request&&,\n                redis::redis_options&,\n                service_permit\n        >;\n        static thread_local execution_stage_type _process_request_stage;\n    public:\n        connection(redis_server& server, socket_address server_addr, connected_socket&& fd, socket_address addr);\n        ~connection();\n        future<> process();\n        future<> process_request();\n        void write_reply(const redis_exception&);\n        void write_reply(redis_server::result result);\n        future<> shutdown();\n    private:\n        const ::timeout_config& timeout_config() { return _server.timeout_config(); }\n        future<result> process_request_one(redis::request&& request, redis::redis_options&, service_permit permit);\n        future<result> process_request_internal();\n    };\n\n    bool _stopping = false;\n    promise<> _all_connections_stopped;\n    future<> _stopped = _all_connections_stopped.get_future();\n    boost::intrusive::list<connection> _connections_list;\n\n    void maybe_idle() {\n        if (_stopping && !_stats._connections_being_accepted && !_stats._current_connections) {\n            _all_connections_stopped.set_value();\n        }\n    }\n    const ::timeout_config& timeout_config() { return _config._timeout_config; }\n};\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"GeneratedTypes.h\"\n#include \"MainRequest.h\"\n\nvoid app_init (MainRequestProxy* device) {\n  ForwardTableReqT key = {0, 0x000cc47aa32535};\n  ForwardTableRspT val = {1};\n  fprintf(stderr, \"insert table entry\\n\");\n  device->forward_table_add_entry(key, val);\n\n  TestTblReqT udp_key = {0, 0x9091};\n  TestTblRspT udp_val = {1};\n  device->test_tbl_add_entry(udp_key, udp_val);\n\n\/\/  SendFrameReqT sendFrame_key = {1};\n\/\/  SendFrameRspT sendFrame_val = {1, 0xaabbcceeddff};\n\/\/  device->send_frame_add_entry(sendFrame_key, sendFrame_val);\n}\n<commit_msg>benchmark clean up<commit_after>#include \"GeneratedTypes.h\"\n#include \"MainRequest.h\"\n\nvoid app_init (MainRequestProxy* device) {\n  ForwardTableReqT key = {0, 0x003417eb96bf1c};\n  ForwardTableRspT val = {1};\n  fprintf(stderr, \"insert table entry\\n\");\n  device->forward_table_add_entry(key, val);\n\n  sleep(1);\n\n  key = {0, 0x000cc47aa32535};\n  val = {1};\n  fprintf(stderr, \"insert table entry\\n\");\n  device->forward_table_add_entry(key, val);\n\n  TestTblReqT udp_key = {0, 0x4e20};\n  TestTblRspT udp_val = {1};\n  device->test_tbl_add_entry(udp_key, udp_val);\n\n  sleep(1);\n\n  udp_key = {0, 0x9091};\n  udp_val = {1};\n  device->test_tbl_add_entry(udp_key, udp_val);\n\n\n\/\/  SendFrameReqT sendFrame_key = {1};\n\/\/  SendFrameRspT sendFrame_val = {1, 0xaabbcceeddff};\n\/\/  device->send_frame_add_entry(sendFrame_key, sendFrame_val);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ License Agreement:\r\n\/\/\r\n\/\/ The following are Copyright  2007, Casey Langen\r\n\/\/\r\n\/\/ Sources and Binaries of: win32cpp\r\n\/\/\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 are met:\r\n\/\/\r\n\/\/    * Redistributions of source code must retain the above copyright notice,\r\n\/\/      this list of conditions and the following disclaimer.\r\n\/\/\r\n\/\/    * 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\/\/    * Neither the name of the author nor the names of other contributors may \r\n\/\/      be used to endorse or promote products derived from this software \r\n\/\/      without specific prior written permission. \r\n\/\/\r\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \r\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \r\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \r\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE \r\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR \r\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \r\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \r\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN \r\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \r\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \r\n\/\/ POSSIBILITY OF SUCH DAMAGE. \r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#pragma once\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include <win32cpp\/Win32Config.hpp>          \/\/ Must be first!\r\n\r\n#include <win32cpp\/Application.hpp>\r\n#include <win32cpp\/BarLayout.hpp>\r\n#include <win32cpp\/Button.hpp>\r\n#include <win32cpp\/Color.hpp>\r\n#include <win32cpp\/Config.hpp>\r\n#include <win32cpp\/Container.hpp>\r\n#include <win32cpp\/DeviceContext.hpp>\r\n#include <win32cpp\/EditView.hpp>\r\n#include <win32cpp\/FolderBrowseDialog.hpp>\r\n#include <win32cpp\/Font.hpp>\r\n#include <win32cpp\/Frame.hpp>\r\n#include <win32cpp\/Label.hpp>\r\n#include <win32cpp\/LinearLayout.hpp>\r\n#include <win32cpp\/ListView.hpp>\r\n#include <win32cpp\/Locale.hpp>\r\n#include <win32cpp\/MemoryDC.hpp>\r\n#include <win32cpp\/Menu.hpp>\r\n#include <win32cpp\/Panel.hpp>\r\n#include <win32cpp\/RedrawLock.hpp>\r\n#include <win32cpp\/Trackbar.hpp>\r\n#include <win32cpp\/Splitter.hpp>\r\n#include <win32cpp\/TabView.hpp>\r\n#include <win32cpp\/TopLevelWindow.hpp>\r\n#include <win32cpp\/Types.hpp>\r\n#include <win32cpp\/Utility.hpp>\r\n#include <win32cpp\/Window.hpp>\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\/\/\/\\brief\r\n\/\/\/namespace root\r\nnamespace win32cpp {\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/<commit_msg>Added some missing win32cpp headers.  Slightly improves build time.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ License Agreement:\r\n\/\/\r\n\/\/ The following are Copyright  2007, Casey Langen\r\n\/\/\r\n\/\/ Sources and Binaries of: win32cpp\r\n\/\/\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 are met:\r\n\/\/\r\n\/\/    * Redistributions of source code must retain the above copyright notice,\r\n\/\/      this list of conditions and the following disclaimer.\r\n\/\/\r\n\/\/    * 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\/\/    * Neither the name of the author nor the names of other contributors may \r\n\/\/      be used to endorse or promote products derived from this software \r\n\/\/      without specific prior written permission. \r\n\/\/\r\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \r\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \r\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \r\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE \r\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR \r\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \r\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \r\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN \r\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \r\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \r\n\/\/ POSSIBILITY OF SUCH DAMAGE. \r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#pragma once\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include <win32cpp\/Win32Config.hpp>          \/\/ Must be first!\r\n\r\n#include <win32cpp\/Application.hpp>\r\n#include <win32cpp\/ApplicationThread.hpp>\r\n#include <win32cpp\/BarLayout.hpp>\r\n#include <win32cpp\/Button.hpp>\r\n#include <win32cpp\/Color.hpp>\r\n#include <win32cpp\/Config.hpp>\r\n#include <win32cpp\/Container.hpp>\r\n#include <win32cpp\/DeviceContext.hpp>\r\n#include <win32cpp\/EditView.hpp>\r\n#include <win32cpp\/Exception.hpp>\r\n#include <win32cpp\/FolderBrowseDialog.hpp>\r\n#include <win32cpp\/Font.hpp>\r\n#include <win32cpp\/Frame.hpp>\r\n#include <win32cpp\/ILayout.hpp>\r\n#include <win32cpp\/Label.hpp>\r\n#include <win32cpp\/LinearLayout.hpp>\r\n#include <win32cpp\/ListView.hpp>\r\n#include <win32cpp\/Locale.hpp>\r\n#include <win32cpp\/MemoryDC.hpp>\r\n#include <win32cpp\/Menu.hpp>\r\n#include <win32cpp\/Panel.hpp>\r\n#include <win32cpp\/ProgressBar.hpp>\r\n#include <win32cpp\/RedrawLock.hpp>\r\n#include <win32cpp\/Splitter.hpp>\r\n#include <win32cpp\/Trackbar.hpp>\r\n#include <win32cpp\/TabView.hpp>\r\n#include <win32cpp\/Timer.hpp>\r\n#include <win32cpp\/TopLevelWindow.hpp>\r\n#include <win32cpp\/Types.hpp>\r\n#include <win32cpp\/Utility.hpp>\r\n#include <win32cpp\/Window.hpp>\r\n#include <win32cpp\/WindowGeometry.hpp>\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\/\/\/\\brief\r\n\/\/\/namespace root\r\nnamespace win32cpp {\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix off by one error in PCAN file loader<commit_after><|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\n#include \"mvdImageViewManipulator.h\"\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\/\/ ITK includes (sorted by alphabetic order)\n\n\/\/\n\/\/ OTB includes (sorted by alphabetic order)\n\n\/\/\n\/\/ Monteverdi includes (sorted by alphabetic order)\n\nnamespace mvd\n{\n\/*\n  TRANSLATOR mvd::ImageViewManipulator\n\n  Necessary for lupdate to be aware of C++ namespaces.\n\n  Context comment for translator.\n*\/\n\n\/*****************************************************************************\/\nImageViewManipulator\n::ImageViewManipulator( QObject* parent ) :\n  QObject( parent )\n{\n  this->InitializeContext(500,500);\n}\n\n\/*****************************************************************************\/\nImageViewManipulator\n::~ImageViewManipulator()\n{\n}\n\n\nvoid ImageViewManipulator::InitializeContext(int width, int height)\n{\n  ImageRegionType::SizeType  initialSize;\n  initialSize[0] = width;\n  initialSize[1] = height;\n  \n  \/\/ initialize with the given size\n  m_NavigationContext.bufferedRegion.SetSize(initialSize);\n}\n\n\nvoid ImageViewManipulator::mousePressEvent(  QMouseEvent * event)\n{\n  \/\/ Update the context with the pressed position\n  m_MouseContext.x = event->x();\n  m_MouseContext.y = event->y();\n}\n\nvoid ImageViewManipulator::mouseMoveEvent(  QMouseEvent * event)\n{\n  \/\/std::cout <<\" ImageViewManipulator::MouseMoveEvent\" << std::endl;\n\n  \/\/ Update the mouse context\n  m_MouseContext.dx = -event->x() + m_MouseContext.x;\n  m_MouseContext.dy = -event->y() + m_MouseContext.y;\n\n  \/\/ Update the navigation context\n  ImageRegionType & currentRegion = m_NavigationContext.bufferedRegion;\n\n  \/\/ print the region\n  \/\/std::cout << \"Region Before offset : \"<<   currentRegion << std::endl;\n\n  \/\/ Apply the offset to the (start) index of the stored region\n  ImageRegionType::OffsetType offset;\n  offset[0] = m_MouseContext.dx;\n  offset[1] = m_MouseContext.dy;\n \n  \/\/ Apply the offset to the (start) index of the stored region\n  IndexType    index = currentRegion.GetIndex() + offset;\n  currentRegion.SetIndex(index);\n\n  \/\/ print the region\n  \/\/std::cout << \"Region After offset : \"<< m_NavigationContext.bufferedRegion   << std::endl;    \n}\n\nvoid ImageViewManipulator::mouseReleaseEvent(  QMouseEvent * event)\n{\n  std::cout <<\" Not Implemented yet ...\" << std::endl;\n}\n\nvoid ImageViewManipulator::resizeEvent ( QResizeEvent * event )\n{\n  \/\/std::cout <<\" ImageViewManipulator::resizeEvent\" << std::endl;\n  \/\/std::cout <<\"Widget Resized with new size \"<< event->size().width() << \",\"\n            << event->size().height() << std::endl;\n\n  \/\/ Update the navigation context\n  ImageRegionType & currentRegion = m_NavigationContext.bufferedRegion;\n\n  \/\/ print the region\n  \/\/std::cout << \"Region Before offset : \"<<   currentRegion << std::endl;\n\n  \/\/ Get the new widget size\n  SizeType size;\n  size[0] = event->size().width();\n  size[1] = event->size().height();\n \n  \/\/ Update the stored region with the new size\n  currentRegion.SetSize(size);\n  \/\/std::cout << \"Region After Resize : \"<<   m_NavigationContext.bufferedRegion << std::endl;    \n\n  \/\/emit widgetResized(event->size().width(), event->size().height());\n}\n\n\n\/*****************************************************************************\/\n\/* SLOTS                                                                     *\/\n\/*****************************************************************************\/\n\n\/*****************************************************************************\/\n\n} \/\/ end namespace 'mvd'\n<commit_msg>COMP: forgotten uncommented line<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\n#include \"mvdImageViewManipulator.h\"\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\/\/ ITK includes (sorted by alphabetic order)\n\n\/\/\n\/\/ OTB includes (sorted by alphabetic order)\n\n\/\/\n\/\/ Monteverdi includes (sorted by alphabetic order)\n\nnamespace mvd\n{\n\/*\n  TRANSLATOR mvd::ImageViewManipulator\n\n  Necessary for lupdate to be aware of C++ namespaces.\n\n  Context comment for translator.\n*\/\n\n\/*****************************************************************************\/\nImageViewManipulator\n::ImageViewManipulator( QObject* parent ) :\n  QObject( parent )\n{\n  this->InitializeContext(500,500);\n}\n\n\/*****************************************************************************\/\nImageViewManipulator\n::~ImageViewManipulator()\n{\n}\n\n\nvoid ImageViewManipulator::InitializeContext(int width, int height)\n{\n  ImageRegionType::SizeType  initialSize;\n  initialSize[0] = width;\n  initialSize[1] = height;\n  \n  \/\/ initialize with the given size\n  m_NavigationContext.bufferedRegion.SetSize(initialSize);\n}\n\n\nvoid ImageViewManipulator::mousePressEvent(  QMouseEvent * event)\n{\n  \/\/ Update the context with the pressed position\n  m_MouseContext.x = event->x();\n  m_MouseContext.y = event->y();\n}\n\nvoid ImageViewManipulator::mouseMoveEvent(  QMouseEvent * event)\n{\n  \/\/std::cout <<\" ImageViewManipulator::MouseMoveEvent\" << std::endl;\n\n  \/\/ Update the mouse context\n  m_MouseContext.dx = -event->x() + m_MouseContext.x;\n  m_MouseContext.dy = -event->y() + m_MouseContext.y;\n\n  \/\/ Update the navigation context\n  ImageRegionType & currentRegion = m_NavigationContext.bufferedRegion;\n\n  \/\/ print the region\n  \/\/std::cout << \"Region Before offset : \"<<   currentRegion << std::endl;\n\n  \/\/ Apply the offset to the (start) index of the stored region\n  ImageRegionType::OffsetType offset;\n  offset[0] = m_MouseContext.dx;\n  offset[1] = m_MouseContext.dy;\n \n  \/\/ Apply the offset to the (start) index of the stored region\n  IndexType    index = currentRegion.GetIndex() + offset;\n  currentRegion.SetIndex(index);\n\n  \/\/ print the region\n  \/\/std::cout << \"Region After offset : \"<< m_NavigationContext.bufferedRegion   << std::endl;    \n}\n\nvoid ImageViewManipulator::mouseReleaseEvent(  QMouseEvent * event)\n{\n  std::cout <<\" Not Implemented yet ...\" << std::endl;\n}\n\nvoid ImageViewManipulator::resizeEvent ( QResizeEvent * event )\n{\n  \/\/std::cout <<\" ImageViewManipulator::resizeEvent\" << std::endl;\n  \/\/std::cout <<\"Widget Resized with new size \"<< event->size().width() << \",\"\n  \/\/<< event->size().height() << std::endl;\n\n  \/\/ Update the navigation context\n  ImageRegionType & currentRegion = m_NavigationContext.bufferedRegion;\n\n  \/\/ print the region\n  \/\/std::cout << \"Region Before offset : \"<<   currentRegion << std::endl;\n\n  \/\/ Get the new widget size\n  SizeType size;\n  size[0] = event->size().width();\n  size[1] = event->size().height();\n \n  \/\/ Update the stored region with the new size\n  currentRegion.SetSize(size);\n  \/\/std::cout << \"Region After Resize : \"<<   m_NavigationContext.bufferedRegion << std::endl;    \n\n  \/\/emit widgetResized(event->size().width(), event->size().height());\n}\n\n\n\/*****************************************************************************\/\n\/* SLOTS                                                                     *\/\n\/*****************************************************************************\/\n\n\/*****************************************************************************\/\n\n} \/\/ end namespace 'mvd'\n<|endoftext|>"}
{"text":"<commit_before>#include \"test_convertertopdf.hpp\"\n\n#include <QTest>\n#include <QMap>\n#include <QSqlDatabase>\n#include <QSqlError>\n#include <QFile>\n#include <QDebug>\n\n#include <qtreports\/engine.hpp>\n#include <qtreports\/..\/..\/src\/converters\/convertertopdf.hpp>\n\nTest_ConverterToPDF::Test_ConverterToPDF( QObject * parent ) :\n    QObject( parent )\n{}\n\nTest_ConverterToPDF::~Test_ConverterToPDF() {}\n\nvoid    Test_ConverterToPDF::convert()\n{\n    QString reportPath = QFINDTESTDATA( \"..\/samples\/reports\/tests-images\/test.full.qrxml\" );\n\n    qtreports::Engine engine;\n\n    QString dbPath = QFINDTESTDATA( \"..\/samples\/databases\/tests-images.db\" );\n\n    auto report = engine.getReport();\n    auto outPath = \"test.pdf\";\n    qtreports::detail::ConverterToPDF converter( report );\n\n    QCOMPARE(converter.convert(outPath), false);\n\n    QVERIFY2( engine.open( reportPath ), engine.getLastError().toStdString().c_str() );\n\n    QMap < QString, QVariant > map;\n    map[ \"title\" ] = \"Best Title in World\";\n\n    QVERIFY2( engine.setParameters( map ), engine.getLastError().toStdString().c_str() );\n\n    QSqlDatabase::removeDatabase( QSqlDatabase::defaultConnection );\n    auto db = QSqlDatabase::addDatabase( \"QSQLITE\" );\n    db.setDatabaseName( dbPath );\n    QVERIFY2( db.open(), db.lastError().text().toStdString().c_str() );\n    QVERIFY2( engine.setConnection( db ), engine.getLastError().toStdString().c_str() );\n    report = engine.getReport();\n\n    converter = qtreports::detail::ConverterToPDF( report );\n    QVERIFY2( converter.convert( outPath ), converter.getLastError().toStdString().c_str() );\n    QCOMPARE( converter.getDPI(), 75 );\n    QCOMPARE( converter.getLastError(), QString() );\n\n    QCOMPARE( QFile::exists( outPath ), true );\n    QFile file( outPath );\n    QVERIFY2( file.open( QIODevice::OpenModeFlag::ReadOnly ), file.errorString().toStdString().c_str() );\n    QVERIFY( file.size() != 0 );\n    file.close();\n    QCOMPARE( QFile::remove( outPath ), true );\n}\n\nvoid    Test_ConverterToPDF::setDPI()\n{\n    auto report = qtreports::detail::ReportPtr();\n    qtreports::detail::ConverterToPDF converter( report );\n\n    converter.setDPI( 500 );\n    QCOMPARE( converter.getDPI(), 500 );\n}\n\nvoid    Test_ConverterToPDF::getDPI()\n{\n    auto report = qtreports::detail::ReportPtr();\n    qtreports::detail::ConverterToPDF converter( report );\n\n    QCOMPARE( converter.getDPI(), 75 );\n}\n\nvoid    Test_ConverterToPDF::getLastError()\n{\n    auto report = qtreports::detail::ReportPtr();\n    qtreports::detail::ConverterToPDF converter( report );\n\n    QCOMPARE( converter.getLastError(), QString() );\n}\n<commit_msg>Update test_convertertopdf.cpp<commit_after>#include \"test_convertertopdf.hpp\"\n\n#include <QTest>\n#include <QMap>\n#include <QSqlDatabase>\n#include <QSqlError>\n#include <QFile>\n#include <QDebug>\n\n#include <qtreports\/engine.hpp>\n#include <qtreports\/..\/..\/src\/converters\/convertertopdf.hpp>\n\nTest_ConverterToPDF::Test_ConverterToPDF( QObject * parent ) :\n    QObject( parent )\n{}\n\nTest_ConverterToPDF::~Test_ConverterToPDF() {}\n\nvoid    Test_ConverterToPDF::convert()\n{\n    QString reportPath = QFINDTESTDATA( \"..\/samples\/reports\/tests-images\/test.withoutstyle.qrxml\" );\n\n    qtreports::Engine engine;\n\n    QString dbPath = QFINDTESTDATA( \"..\/samples\/databases\/tests-images.db\" );\n\n    auto report = engine.getReport();\n    auto outPath = \"test.pdf\";\n    qtreports::detail::ConverterToPDF converter( report );\n\n    QCOMPARE(converter.convert(outPath), false);\n\n    QVERIFY2( engine.open( reportPath ), engine.getLastError().toStdString().c_str() );\n\n    QMap < QString, QVariant > map;\n    map[ \"title\" ] = \"Best Title in World\";\n\n    QVERIFY2( engine.setParameters( map ), engine.getLastError().toStdString().c_str() );\n\n    QSqlDatabase::removeDatabase( QSqlDatabase::defaultConnection );\n    auto db = QSqlDatabase::addDatabase( \"QSQLITE\" );\n    db.setDatabaseName( dbPath );\n    QVERIFY2( db.open(), db.lastError().text().toStdString().c_str() );\n    QVERIFY2( engine.setConnection( db ), engine.getLastError().toStdString().c_str() );\n    report = engine.getReport();\n\n    converter = qtreports::detail::ConverterToPDF( report );\n    QVERIFY2( converter.convert( outPath ), converter.getLastError().toStdString().c_str() );\n    QCOMPARE( converter.getDPI(), 75 );\n    QCOMPARE( converter.getLastError(), QString() );\n\n    QCOMPARE( QFile::exists( outPath ), true );\n    QFile file( outPath );\n    QVERIFY2( file.open( QIODevice::OpenModeFlag::ReadOnly ), file.errorString().toStdString().c_str() );\n    QVERIFY( file.size() != 0 );\n    file.close();\n    QCOMPARE( QFile::remove( outPath ), true );\n}\n\nvoid    Test_ConverterToPDF::setDPI()\n{\n    auto report = qtreports::detail::ReportPtr();\n    qtreports::detail::ConverterToPDF converter( report );\n\n    converter.setDPI( 500 );\n    QCOMPARE( converter.getDPI(), 500 );\n}\n\nvoid    Test_ConverterToPDF::getDPI()\n{\n    auto report = qtreports::detail::ReportPtr();\n    qtreports::detail::ConverterToPDF converter( report );\n\n    QCOMPARE( converter.getDPI(), 75 );\n}\n\nvoid    Test_ConverterToPDF::getLastError()\n{\n    auto report = qtreports::detail::ReportPtr();\n    qtreports::detail::ConverterToPDF converter( report );\n\n    QCOMPARE( converter.getLastError(), QString() );\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 <QColorDialog>\n#include <QDebug>\n#include <QIcon>\n#include <QPainter>\n#include <QPixmap>\n#include <QStyle>\n#include <QStyleOptionButton>\n#include <QStylePainter>\n\n\/\/ CTK includes\n#include \"ctkColorDialog.h\"\n#include \"ctkColorPickerButton.h\"\n\nclass ctkColorPickerButtonPrivate\n{\n  Q_DECLARE_PUBLIC(ctkColorPickerButton);\nprotected:\n  ctkColorPickerButton* const q_ptr;\npublic:\n  ctkColorPickerButtonPrivate(ctkColorPickerButton& object);\n  void init();\n  void computeIcon();\n\n  QIcon  Icon;\n  QColor Color;\n  bool   DisplayColorName;\n  ctkColorPickerButton::ColorDialogOptions DialogOptions;\n};\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButtonPrivate::ctkColorPickerButtonPrivate(ctkColorPickerButton& object)\n  : q_ptr(&object)\n{\n  this->Color = Qt::black;\n  this->DisplayColorName = true;\n  this->DialogOptions = 0;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButtonPrivate::init()\n{\n  Q_Q(ctkColorPickerButton);\n  q->setCheckable(true);\n  QObject::connect(q, SIGNAL(toggled(bool)),\n                   q, SLOT(onToggled(bool)));\n  this->computeIcon();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButtonPrivate::computeIcon()\n{\n  Q_Q(ctkColorPickerButton);\n  int _iconSize = q->style()->pixelMetric(QStyle::PM_SmallIconSize);\n  QPixmap pix(_iconSize, _iconSize);\n  pix.fill(q->palette().button().color());\n  QPainter p(&pix);\n  p.setPen(QPen(Qt::gray));\n  p.setBrush(this->Color);\n  p.drawRect(2, 2, pix.width() - 5, pix.height() - 5);\n\n  this->Icon = QIcon(pix);\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::ctkColorPickerButton(QWidget* _parent)\n  : QPushButton(_parent)\n  , d_ptr(new ctkColorPickerButtonPrivate(*this))\n{\n  Q_D(ctkColorPickerButton);\n  d->init();\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::ctkColorPickerButton(const QString& _text, QWidget* _parent)\n  : QPushButton(_text, _parent)\n  , d_ptr(new ctkColorPickerButtonPrivate(*this))\n{\n  Q_D(ctkColorPickerButton);\n  d->init();\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::ctkColorPickerButton(const QColor& _color,\n                                           const QString& _text,\n                                           QWidget* _parent)\n  : QPushButton(_text, _parent)\n  , d_ptr(new ctkColorPickerButtonPrivate(*this))\n{\n  Q_D(ctkColorPickerButton);\n  d->init();\n  this->setColor(_color);\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::~ctkColorPickerButton()\n{\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::changeColor()\n{\n  Q_D(ctkColorPickerButton);\n  QColor res;\n    QColorDialog::ColorDialogOptions options;\n    options |= QColorDialog::ColorDialogOption(\n      static_cast<int>(d->DialogOptions & ShowAlphaChannel));\n    options |= QColorDialog::ColorDialogOption(\n      static_cast<int>(d->DialogOptions & NoButtons));\n    options |= QColorDialog::ColorDialogOption(\n      static_cast<int>(d->DialogOptions & DontUseNativeDialog));\n  if (d->DialogOptions & UseCTKColorDialog)\n    {\n    res = ctkColorDialog::getColor(d->Color, this, QString(\"\"),options);\n    }\n  else\n    {\n    res = QColorDialog::getColor(d->Color, this, QString(\"\"), options);\n    }\n  if (res.isValid())\n    {\n    this->setColor(res);\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::onToggled(bool change)\n{\n  if (change)\n    {\n    this->changeColor();\n    this->setChecked(false);\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::setDisplayColorName(bool displayColorName)\n{\n  Q_D(ctkColorPickerButton);\n  d->DisplayColorName = displayColorName;\n  this->update();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool ctkColorPickerButton::displayColorName()const\n{\n  Q_D(const ctkColorPickerButton);\n  return d->DisplayColorName;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::setDialogOptions(ColorDialogOptions options)\n{\n  Q_D(ctkColorPickerButton);\n  d->DialogOptions = options;\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::ColorDialogOptions ctkColorPickerButton::dialogOptions()const\n{\n  Q_D(const ctkColorPickerButton);\n  return d->DialogOptions;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::setColor(const QColor& newColor)\n{\n  Q_D(ctkColorPickerButton);\n  if (newColor == d->Color)\n    {\n    return;\n    }\n  \n  d->Color = newColor;\n  d->computeIcon();\n\n  this->update();\n  emit colorChanged(d->Color);\n}\n\n\/\/-----------------------------------------------------------------------------\nQColor ctkColorPickerButton::color()const\n{\n  Q_D(const ctkColorPickerButton);\n  return d->Color;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::paintEvent(QPaintEvent *)\n{\n  Q_D(ctkColorPickerButton);\n  QStylePainter p(this);\n  QStyleOptionButton option;\n  initStyleOption(&option);\n  if (d->DisplayColorName)\n    {\n    option.text = d->Color.name();\n    }\n  option.icon = d->Icon;\n  p.drawControl(QStyle::CE_PushButton, option);\n}\n<commit_msg>Register ColorDialogOptions property as metatype<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 <QColorDialog>\n#include <QDebug>\n#include <QIcon>\n#include <QPainter>\n#include <QPixmap>\n#include <QStyle>\n#include <QStyleOptionButton>\n#include <QStylePainter>\n\n\/\/ CTK includes\n#include \"ctkColorDialog.h\"\n#include \"ctkColorPickerButton.h\"\n\nclass ctkColorPickerButtonPrivate\n{\n  Q_DECLARE_PUBLIC(ctkColorPickerButton);\nprotected:\n  ctkColorPickerButton* const q_ptr;\npublic:\n  ctkColorPickerButtonPrivate(ctkColorPickerButton& object);\n  void init();\n  void computeIcon();\n\n  QIcon  Icon;\n  QColor Color;\n  bool   DisplayColorName;\n  ctkColorPickerButton::ColorDialogOptions DialogOptions;\n};\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButtonPrivate::ctkColorPickerButtonPrivate(ctkColorPickerButton& object)\n  : q_ptr(&object)\n{\n  qRegisterMetaType<ctkColorPickerButton::ColorDialogOptions>(\"ctkColorPickerButton::ColorDialogOptions\");\n  this->Color = Qt::black;\n  this->DisplayColorName = true;\n  this->DialogOptions = 0;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButtonPrivate::init()\n{\n  Q_Q(ctkColorPickerButton);\n  q->setCheckable(true);\n  QObject::connect(q, SIGNAL(toggled(bool)),\n                   q, SLOT(onToggled(bool)));\n  this->computeIcon();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButtonPrivate::computeIcon()\n{\n  Q_Q(ctkColorPickerButton);\n  int _iconSize = q->style()->pixelMetric(QStyle::PM_SmallIconSize);\n  QPixmap pix(_iconSize, _iconSize);\n  pix.fill(q->palette().button().color());\n  QPainter p(&pix);\n  p.setPen(QPen(Qt::gray));\n  p.setBrush(this->Color);\n  p.drawRect(2, 2, pix.width() - 5, pix.height() - 5);\n\n  this->Icon = QIcon(pix);\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::ctkColorPickerButton(QWidget* _parent)\n  : QPushButton(_parent)\n  , d_ptr(new ctkColorPickerButtonPrivate(*this))\n{\n  Q_D(ctkColorPickerButton);\n  d->init();\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::ctkColorPickerButton(const QString& _text, QWidget* _parent)\n  : QPushButton(_text, _parent)\n  , d_ptr(new ctkColorPickerButtonPrivate(*this))\n{\n  Q_D(ctkColorPickerButton);\n  d->init();\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::ctkColorPickerButton(const QColor& _color,\n                                           const QString& _text,\n                                           QWidget* _parent)\n  : QPushButton(_text, _parent)\n  , d_ptr(new ctkColorPickerButtonPrivate(*this))\n{\n  Q_D(ctkColorPickerButton);\n  d->init();\n  this->setColor(_color);\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::~ctkColorPickerButton()\n{\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::changeColor()\n{\n  Q_D(ctkColorPickerButton);\n  QColor res;\n    QColorDialog::ColorDialogOptions options;\n    options |= QColorDialog::ColorDialogOption(\n      static_cast<int>(d->DialogOptions & ShowAlphaChannel));\n    options |= QColorDialog::ColorDialogOption(\n      static_cast<int>(d->DialogOptions & NoButtons));\n    options |= QColorDialog::ColorDialogOption(\n      static_cast<int>(d->DialogOptions & DontUseNativeDialog));\n  if (d->DialogOptions & UseCTKColorDialog)\n    {\n    res = ctkColorDialog::getColor(d->Color, this, QString(\"\"),options);\n    }\n  else\n    {\n    res = QColorDialog::getColor(d->Color, this, QString(\"\"), options);\n    }\n  if (res.isValid())\n    {\n    this->setColor(res);\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::onToggled(bool change)\n{\n  if (change)\n    {\n    this->changeColor();\n    this->setChecked(false);\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::setDisplayColorName(bool displayColorName)\n{\n  Q_D(ctkColorPickerButton);\n  d->DisplayColorName = displayColorName;\n  this->update();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool ctkColorPickerButton::displayColorName()const\n{\n  Q_D(const ctkColorPickerButton);\n  return d->DisplayColorName;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::setDialogOptions(ColorDialogOptions options)\n{\n  Q_D(ctkColorPickerButton);\n  d->DialogOptions = options;\n}\n\n\/\/-----------------------------------------------------------------------------\nctkColorPickerButton::ColorDialogOptions ctkColorPickerButton::dialogOptions()const\n{\n  Q_D(const ctkColorPickerButton);\n  return d->DialogOptions;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::setColor(const QColor& newColor)\n{\n  Q_D(ctkColorPickerButton);\n  if (newColor == d->Color)\n    {\n    return;\n    }\n  \n  d->Color = newColor;\n  d->computeIcon();\n\n  this->update();\n  emit colorChanged(d->Color);\n}\n\n\/\/-----------------------------------------------------------------------------\nQColor ctkColorPickerButton::color()const\n{\n  Q_D(const ctkColorPickerButton);\n  return d->Color;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid ctkColorPickerButton::paintEvent(QPaintEvent *)\n{\n  Q_D(ctkColorPickerButton);\n  QStylePainter p(this);\n  QStyleOptionButton option;\n  initStyleOption(&option);\n  if (d->DisplayColorName)\n    {\n    option.text = d->Color.name();\n    }\n  option.icon = d->Icon;\n  p.drawControl(QStyle::CE_PushButton, option);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n@file CharBuf.hpp\n@brief Character buffer.\n\n@author Tim Howard\n@copyright 2010-2012 Tim Howard under the MIT license; see @ref index or the accompanying LICENSE file for full text.\n*\/\n\n#ifndef DUCT_CHARBUF_HPP_\n#define DUCT_CHARBUF_HPP_\n\n#include \".\/config.hpp\"\n#include \".\/stl.hpp\"\n#include \".\/char.hpp\"\n#include \".\/CharacterSet.hpp\"\n#include \".\/EncodingUtils.hpp\"\n#include \".\/StringUtils.hpp\"\n\n#include <cstdlib>\n#include <type_traits>\n\nnamespace duct {\n\n\/**\n\t@addtogroup string\n\t@{\n*\/\n\n\/\/ Forward declarations\nclass CharBuf;\n\n\/**\n\tCharacter buffer.\n*\/\nclass CharBuf \/*final*\/ {\npublic:\n\/** @name Types *\/ \/\/\/ @{\n\t\/** Internal character type. *\/\n\ttypedef char32 char_type;\n\/\/\/ @}\n\nprivate:\n\tduct::stl::vector<char_type>::type m_buffer;\n\tbool m_cached;\n\tu8string m_cache_string;\n\n\tDUCT_DISALLOW_COPY_AND_ASSIGN(CharBuf);\n\npublic:\n\/** @name Constructors *\/ \/\/\/ @{\n\t\/**\n\t\tConstruct empty.\n\t*\/\n\tCharBuf()\n\t\t: m_buffer()\n\t\t, m_cached(false)\n\t\t, m_cache_string()\n\t{}\n\t\/**\n\t\tConstruct with capacity.\n\t\t@param capacity Capacity of buffer.\n\t*\/\n\texplicit CharBuf(std::size_t const capacity)\n\t\t: m_buffer()\n\t\t, m_cached(false)\n\t\t, m_cache_string()\n\t{\n\t\tm_buffer.reserve(capacity);\n\t}\n\/\/\/ @}\n\n\/** @name Properties *\/ \/\/\/ @{\n\t\/**\n\t\tGet size.\n\t\t@returns The number of characters in the buffer.\n\t\t@sa get_capacity().\n\t*\/\n\tinline std::size_t get_size() const { return m_buffer.size(); }\n\t\/**\n\t\tGet capacity.\n\t\t@returns The reserved size of the buffer.\n\t\t@sa get_size().\n\t*\/\n\tinline std::size_t get_capacity() const { return m_buffer.capacity(); }\n\/\/\/ @}\n\n\/** @name Operations and comparison *\/ \/\/\/ @{\n\t\/**\n\t\tReset.\n\t*\/\n\tvoid reset() {\n\t\tm_cached=false;\n\t\tm_buffer.clear();\n\t}\n\n\t\/**\n\t\tCache buffer as string.\n\t\t@returns Reference to cached string.\n\t*\/\n\tu8string const& cache() {\n\t\tif (!m_cached) {\n\t\t\tStringUtils::convert<UTF32Utils>(m_cache_string, m_buffer.cbegin(), m_buffer.cend());\n\t\t\tm_cached=true;\n\t\t}\n\t\treturn m_cache_string;\n\t}\n\n\t\/**\n\t\tAppend code point to the end of the buffer.\n\t\t@warning Invalid code points are ignored.\n\t\t@warning An exception may be thrown by internal resizing.\n\t\t@note The cached string will be invalidated by this operation.\n\t\t@param cp Code point to insert.\n\t*\/\n\tvoid push_back(char_type const cp) {\n\t\tif (DUCT_UNI_IS_CP_VALID(cp)) {\n\t\t\tgrow();\n\t\t\tm_buffer.push_back(cp);\n\t\t\tm_cached=false;\n\t\t}\n\t}\n\n\t\/**\n\t\tCompare all characters in the buffer to a character.\n\t\t@returns @c true if all characters match the character; @c false otherwise.\n\t\t@tparam charT Character type; inferred from @a c.\n\t\t@param c Character to compare against.\n\t*\/\n\ttemplate<typename charT>\n\tbool compare(charT const c) const {\n\t\tfor (unsigned int i=0; get_size()>i; ++i) {\n\t\t\tif (m_buffer[i]!=c) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\/**\n\t\tCompare buffer to a character set.\n\t\t@returns @c true if all characters match a character from @a char_set; @c false otherwise.\n\t\t@param char_set Ccharacter set to compare against.\n\t*\/\n\tbool compare(CharacterSet const& char_set) const {\n\t\tfor (unsigned int i=0; get_size()>i; ++i) {\n\t\t\tif (!char_set.contains(m_buffer[i])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\/\/\/ @}\n\n\/** @name Output *\/ \/\/\/ @{\n\t\/**\n\t\tConvert buffer to a string.\n\t\t@returns Cache string converted to @a stringT.\n\t\t@tparam stringT String type to convert to. Encoding is inferred from the type's character size.\n\t*\/\n\ttemplate<class stringT>\n\tstringT to_string() {\n\t\tstringT str;\n\t\tStringUtils::convert<UTF32Utils>(str, m_buffer.cbegin(), m_buffer.cend(), true);\n\t\treturn str;\n\t}\n\t\/**\n\t\tConvert buffer to a @c u8string.\n\t\t@returns Cache string.\n\t*\/\n\tu8string to_string() {\n\t\treturn cache();\n\t}\n\t\/**\n\t\tConvert buffer to a string (by-ref).\n\t\t@param[out] str Output string.\n\t\t@param append Whether to append to @a str; defaults to @c false (@a str is cleared on entry).\n\t*\/\n\ttemplate<class stringT>\n\tvoid to_string(stringT& str, bool append=false) {\n\t\tStringUtils::convert<UTF32Utils>(str, m_buffer.cbegin(), m_buffer.cend(), append);\n\t}\n\n\t\/**\n\t\tConvert the buffer to an arithmetic type.\n\t\t@returns The buffer converted to arithmetic type @a T.\n\t\t@tparam T An arithmetic type.\n\t\t@sa to_arithmetic(T&)\n\t*\/\n\ttemplate<typename T>\n\tT to_arithmetic() {\n\t\tstatic_assert(std::is_arithmetic<T>::value, \"T must be arithmetic\");\n\t\tT val;\n\t\tto_arithmetic(val);\n\t\treturn val;\n\t}\n\t\/**\n\t\tConvert the buffer to a 32-bit integer with error return.\n\t\t@note @a value is guaranteed to be equal to @c T() if extraction failed.\n\t\t@returns @c true if the buffer was convertible to @a T (@a value is set); @c false otherwise (@a value equals @c T(0)).\n\t\t@tparam T An arithmetic type; inferred from @a value.\n\t\t@param[out] value Output value.\n\t*\/\n\ttemplate<typename T>\n\tbool to_arithmetic(T& value) {\n\t\tstatic_assert(std::is_arithmetic<T>::value, \"T must be arithmetic\");\n\t\tcache();\n\t\tduct::stl::istringstream stream(m_cache_string);\n\t\tstream>>value;\n\t\tif (stream.fail()) {\n\t\t\tvalue=T();\n\t\t\treturn false;\n\t\t} else {\n\t\t\treturn true;\n\t\t}\n\t}\n\/\/\/ @}\n\nprivate:\n\tvoid grow() {\n\t\tif (0==get_capacity()) {\n\t\t\tm_buffer.reserve(64u);\n\t\t} else if (get_size()+1>=get_capacity()) {\n\t\t\tm_buffer.reserve(2*get_capacity());\n\t\t}\n\t}\n};\n\n\/** @} *\/ \/\/ end of doc-group string\n\n} \/\/ namespace duct\n\n#endif \/\/ DUCT_CHARBUF_HPP_\n<commit_msg>CharBuf: saner capacity growing; doc correction.<commit_after>\/**\n@file CharBuf.hpp\n@brief Character buffer.\n\n@author Tim Howard\n@copyright 2010-2012 Tim Howard under the MIT license; see @ref index or the accompanying LICENSE file for full text.\n*\/\n\n#ifndef DUCT_CHARBUF_HPP_\n#define DUCT_CHARBUF_HPP_\n\n#include \".\/config.hpp\"\n#include \".\/stl.hpp\"\n#include \".\/char.hpp\"\n#include \".\/CharacterSet.hpp\"\n#include \".\/EncodingUtils.hpp\"\n#include \".\/StringUtils.hpp\"\n\n#include <cstdlib>\n#include <type_traits>\n\nnamespace duct {\n\n\/**\n\t@addtogroup string\n\t@{\n*\/\n\n\/\/ Forward declarations\nclass CharBuf;\n\n\/**\n\tCharacter buffer.\n*\/\nclass CharBuf \/*final*\/ {\npublic:\n\/** @name Types *\/ \/\/\/ @{\n\t\/** Internal character type. *\/\n\ttypedef char32 char_type;\n\/\/\/ @}\n\nprivate:\n\tduct::stl::vector<char_type>::type m_buffer;\n\tbool m_cached;\n\tu8string m_cache_string;\n\n\tDUCT_DISALLOW_COPY_AND_ASSIGN(CharBuf);\n\npublic:\n\/** @name Constructors *\/ \/\/\/ @{\n\t\/**\n\t\tConstruct empty.\n\t*\/\n\tCharBuf()\n\t\t: m_buffer()\n\t\t, m_cached(false)\n\t\t, m_cache_string()\n\t{}\n\t\/**\n\t\tConstruct with capacity.\n\t\t@param capacity Capacity of buffer.\n\t*\/\n\texplicit CharBuf(std::size_t const capacity)\n\t\t: m_buffer()\n\t\t, m_cached(false)\n\t\t, m_cache_string()\n\t{\n\t\tm_buffer.reserve(capacity);\n\t}\n\/\/\/ @}\n\n\/** @name Properties *\/ \/\/\/ @{\n\t\/**\n\t\tGet size.\n\t\t@returns The number of characters in the buffer.\n\t\t@sa get_capacity().\n\t*\/\n\tinline std::size_t get_size() const { return m_buffer.size(); }\n\t\/**\n\t\tGet capacity.\n\t\t@returns The reserved size of the buffer.\n\t\t@sa get_size().\n\t*\/\n\tinline std::size_t get_capacity() const { return m_buffer.capacity(); }\n\/\/\/ @}\n\n\/** @name Operations and comparison *\/ \/\/\/ @{\n\t\/**\n\t\tReset.\n\t*\/\n\tvoid reset() {\n\t\tm_cached=false;\n\t\tm_buffer.clear();\n\t}\n\n\t\/**\n\t\tCache buffer as string.\n\t\t@returns Reference to cached string.\n\t*\/\n\tu8string const& cache() {\n\t\tif (!m_cached) {\n\t\t\tStringUtils::convert<UTF32Utils>(m_cache_string, m_buffer.cbegin(), m_buffer.cend());\n\t\t\tm_cached=true;\n\t\t}\n\t\treturn m_cache_string;\n\t}\n\n\t\/**\n\t\tAppend code point to the end of the buffer.\n\t\t@warning Invalid code points are ignored.\n\t\t@warning An exception may be thrown by internal resizing.\n\t\t@note The cached string will be invalidated by this operation.\n\t\t@param cp Code point to insert.\n\t*\/\n\tvoid push_back(char_type const cp) {\n\t\tif (DUCT_UNI_IS_CP_VALID(cp)) {\n\t\t\tgrow();\n\t\t\tm_buffer.push_back(cp);\n\t\t\tm_cached=false;\n\t\t}\n\t}\n\n\t\/**\n\t\tCompare all characters in the buffer to a character.\n\t\t@returns @c true if all characters match the character; @c false otherwise.\n\t\t@tparam charT Character type; inferred from @a c.\n\t\t@param c Character to compare against.\n\t*\/\n\ttemplate<typename charT>\n\tbool compare(charT const c) const {\n\t\tfor (unsigned int i=0; get_size()>i; ++i) {\n\t\t\tif (m_buffer[i]!=c) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\/**\n\t\tCompare buffer to a character set.\n\t\t@returns @c true if all characters match a character from @a char_set; @c false otherwise.\n\t\t@param char_set Character set to compare against.\n\t*\/\n\tbool compare(CharacterSet const& char_set) const {\n\t\tfor (unsigned int i=0; get_size()>i; ++i) {\n\t\t\tif (!char_set.contains(m_buffer[i])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\/\/\/ @}\n\n\/** @name Output *\/ \/\/\/ @{\n\t\/**\n\t\tConvert buffer to a string.\n\t\t@returns Cache string converted to @a stringT.\n\t\t@tparam stringT String type to convert to. Encoding is inferred from the type's character size.\n\t*\/\n\ttemplate<class stringT>\n\tstringT to_string() {\n\t\tstringT str;\n\t\tStringUtils::convert<UTF32Utils>(str, m_buffer.cbegin(), m_buffer.cend(), true);\n\t\treturn str;\n\t}\n\t\/**\n\t\tConvert buffer to a @c u8string.\n\t\t@returns Cache string.\n\t*\/\n\tu8string to_string() {\n\t\treturn cache();\n\t}\n\t\/**\n\t\tConvert buffer to a string (by-ref).\n\t\t@param[out] str Output string.\n\t\t@param append Whether to append to @a str; defaults to @c false (@a str is cleared on entry).\n\t*\/\n\ttemplate<class stringT>\n\tvoid to_string(stringT& str, bool append=false) {\n\t\tStringUtils::convert<UTF32Utils>(str, m_buffer.cbegin(), m_buffer.cend(), append);\n\t}\n\n\t\/**\n\t\tConvert the buffer to an arithmetic type.\n\t\t@returns The buffer converted to arithmetic type @a T.\n\t\t@tparam T An arithmetic type.\n\t\t@sa to_arithmetic(T&)\n\t*\/\n\ttemplate<typename T>\n\tT to_arithmetic() {\n\t\tstatic_assert(std::is_arithmetic<T>::value, \"T must be arithmetic\");\n\t\tT val;\n\t\tto_arithmetic(val);\n\t\treturn val;\n\t}\n\t\/**\n\t\tConvert the buffer to a 32-bit integer with error return.\n\t\t@note @a value is guaranteed to be equal to @c T() if extraction failed.\n\t\t@returns @c true if the buffer was convertible to @a T (@a value is set); @c false otherwise (@a value equals @c T(0)).\n\t\t@tparam T An arithmetic type; inferred from @a value.\n\t\t@param[out] value Output value.\n\t*\/\n\ttemplate<typename T>\n\tbool to_arithmetic(T& value) {\n\t\tstatic_assert(std::is_arithmetic<T>::value, \"T must be arithmetic\");\n\t\tcache();\n\t\tduct::stl::istringstream stream(m_cache_string);\n\t\tstream>>value;\n\t\tif (stream.fail()) {\n\t\t\tvalue=T();\n\t\t\treturn false;\n\t\t} else {\n\t\t\treturn true;\n\t\t}\n\t}\n\/\/\/ @}\n\nprivate:\n\tvoid grow() {\n\t\tif (0==get_capacity()) {\n\t\t\tm_buffer.reserve(64u);\n\t\t} else if (get_size()+1>=get_capacity()) {\n\t\t\tm_buffer.reserve((16>=get_capacity()) ? 64 : 2*get_capacity());\n\t\t}\n\t}\n};\n\n\/** @} *\/ \/\/ end of doc-group string\n\n} \/\/ namespace duct\n\n#endif \/\/ DUCT_CHARBUF_HPP_\n<|endoftext|>"}
{"text":"<commit_before>#include <mtp\/ptp\/Device.h>\n#include <mtp\/ptp\/Response.h>\n#include <mtp\/ptp\/Container.h>\n#include <mtp\/ptp\/Messages.h>\n#include <mtp\/usb\/Context.h>\n#include <mtp\/ptp\/OperationRequest.h>\n\n\nnamespace mtp\n{\n\n\tmsg::DeviceInfo Device::GetDeviceInfo()\n\t{\n\t\tOperationRequest req(OperationCode::GetDeviceInfo, 0);\n\t\tContainer container(req);\n\t\t_packeter.Write(container.Data);\n\t\tByteArray data, response;\n\t\t_packeter.Read(data, response);\n\t\t\/\/HexDump(\"payload\", data);\n\n\t\tInputStream stream(data, 8); \/\/operation code + session id\n\t\tmsg::DeviceInfo gdi;\n\t\tgdi.Read(stream);\n\t\treturn gdi;\n\t}\n\n\tSessionPtr Device::OpenSession(u32 sessionId)\n\t{\n\t\tOperationRequest req(OperationCode::OpenSession, 0, sessionId);\n\t\tContainer container(req);\n\t\t_packeter.Write(container.Data);\n\t\tByteArray data, response;\n\t\t_packeter.Read(data, response);\n\t\t\/\/HexDump(\"payload\", data);\n\n\t\treturn std::make_shared<Session>(_packeter.GetPipe(), sessionId);\n\t}\n\n\tvoid PipePacketer::Write(const ByteArray &data, int timeout)\n\t{\n\t\t\/\/HexDump(\"send\", data);\n\t\t_pipe->Write(data, timeout);\n\t}\n\n\tByteArray PipePacketer::ReadMessage(int timeout)\n\t{\n\t\tByteArray result;\n\t\tu32 size = ~0u;\n\t\tsize_t offset = 0;\n\t\tsize_t packet_offset;\n\t\twhile(true)\n\t\t{\n\t\t\tByteArray data = _pipe->Read(timeout);\n\t\t\tif (size == ~0u)\n\t\t\t{\n\t\t\t\tInputStream stream(data);\n\t\t\t\tstream >> size;\n\t\t\t\tprintf(\"DATA SIZE = %u\\n\", size);\n\t\t\t\tif (size < 4)\n\t\t\t\t\tthrow std::runtime_error(\"invalid size\");\n\t\t\t\tpacket_offset = 4;\n\t\t\t\tresult.resize(size - 4);\n\t\t\t}\n\t\t\telse\n\t\t\t\tpacket_offset = 0;\n\t\t\t\/\/HexDump(\"recv\", data);\n\n\t\t\tsize_t src_n = std::min(data.size() - packet_offset, result.size() - offset);\n\t\t\tstd::copy(data.begin() + packet_offset, data.begin() + packet_offset + src_n, result.begin() + offset);\n\t\t\toffset += data.size();\n\t\t\tif (offset >= result.size())\n\t\t\t\tbreak;\n\t\t}\n\t\treturn result;\n\n\t}\n\n\tvoid PipePacketer::Read(ByteArray &data, ByteArray &response, int timeout)\n\t{\n\t\t_pipe->ReadInterrupt();\n\t\tdata.clear();\n\t\tresponse.clear();\n\t\tByteArray message = ReadMessage(timeout);\n\t\t\/\/HexDump(\"message\", message);\n\t\tInputStream stream(message);\n\t\tu16 raw_code;\n\t\tstream >> raw_code;\n\t\tContainerType type = ContainerType(raw_code);\n\t\tif (type == ContainerType::Data)\n\t\t{\n\t\t\tdata = std::move(message);\n\t\t\tresponse = ReadMessage(timeout);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresponse = std::move(message);\n\t\t}\n\n\t\t\/\/HexDump(\"response\", response);\n\t}\n\n\tDevicePtr Device::Find()\n\t{\n\t\tusing namespace mtp;\n\t\tusb::ContextPtr ctx(new usb::Context);\n\n\t\tfor (usb::DeviceDescriptorPtr desc : ctx->GetDevices())\n\t\t{\n\t\t\tusb::DevicePtr device = desc->TryOpen(ctx);\n\t\t\tif (!device)\n\t\t\t\tcontinue;\n\t\t\tint confs = desc->GetConfigurationsCount();\n\t\t\tprintf(\"configurations: %d\\n\", confs);\n\n\t\t\tfor(int i = 0; i < confs; ++i)\n\t\t\t{\n\t\t\t\tusb::ConfigurationPtr conf = desc->GetConfiguration(i);\n\t\t\t\tint interfaces = conf->GetInterfaceCount();\n\t\t\t\tprintf(\"interfaces: %d\\n\", interfaces);\n\t\t\t\tfor(int j = 0; j < interfaces; ++j)\n\t\t\t\t{\n\t\t\t\t\tusb::InterfacePtr iface = conf->GetInterface(conf, j, 0);\n\t\t\t\t\tprintf(\"%d:%d index %u, eps %u\\n\", i, j, iface->GetIndex(), iface->GetEndpointsCount());\n\t\t\t\t\tint name_idx = iface->GetNameIndex();\n\t\t\t\t\tif (!name_idx)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tstd::string name = device->GetString(name_idx);\n\t\t\t\t\tif (name == \"MTP\")\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/device->SetConfiguration(configuration->GetIndex());\n\t\t\t\t\t\tusb::BulkPipePtr pipe = usb::BulkPipe::Create(device, iface);\n\t\t\t\t\t\treturn std::make_shared<Device>(pipe);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn nullptr;\n\t}\n\n}\n<commit_msg>removed superfluos break<commit_after>#include <mtp\/ptp\/Device.h>\n#include <mtp\/ptp\/Response.h>\n#include <mtp\/ptp\/Container.h>\n#include <mtp\/ptp\/Messages.h>\n#include <mtp\/usb\/Context.h>\n#include <mtp\/ptp\/OperationRequest.h>\n\n\nnamespace mtp\n{\n\n\tmsg::DeviceInfo Device::GetDeviceInfo()\n\t{\n\t\tOperationRequest req(OperationCode::GetDeviceInfo, 0);\n\t\tContainer container(req);\n\t\t_packeter.Write(container.Data);\n\t\tByteArray data, response;\n\t\t_packeter.Read(data, response);\n\t\t\/\/HexDump(\"payload\", data);\n\n\t\tInputStream stream(data, 8); \/\/operation code + session id\n\t\tmsg::DeviceInfo gdi;\n\t\tgdi.Read(stream);\n\t\treturn gdi;\n\t}\n\n\tSessionPtr Device::OpenSession(u32 sessionId)\n\t{\n\t\tOperationRequest req(OperationCode::OpenSession, 0, sessionId);\n\t\tContainer container(req);\n\t\t_packeter.Write(container.Data);\n\t\tByteArray data, response;\n\t\t_packeter.Read(data, response);\n\t\t\/\/HexDump(\"payload\", data);\n\n\t\treturn std::make_shared<Session>(_packeter.GetPipe(), sessionId);\n\t}\n\n\tvoid PipePacketer::Write(const ByteArray &data, int timeout)\n\t{\n\t\t\/\/HexDump(\"send\", data);\n\t\t_pipe->Write(data, timeout);\n\t}\n\n\tByteArray PipePacketer::ReadMessage(int timeout)\n\t{\n\t\tByteArray result;\n\t\tu32 size = ~0u;\n\t\tsize_t offset = 0;\n\t\tsize_t packet_offset;\n\t\twhile(true)\n\t\t{\n\t\t\tByteArray data = _pipe->Read(timeout);\n\t\t\tif (size == ~0u)\n\t\t\t{\n\t\t\t\tInputStream stream(data);\n\t\t\t\tstream >> size;\n\t\t\t\tprintf(\"DATA SIZE = %u\\n\", size);\n\t\t\t\tif (size < 4)\n\t\t\t\t\tthrow std::runtime_error(\"invalid size\");\n\t\t\t\tpacket_offset = 4;\n\t\t\t\tresult.resize(size - 4);\n\t\t\t}\n\t\t\telse\n\t\t\t\tpacket_offset = 0;\n\t\t\t\/\/HexDump(\"recv\", data);\n\n\t\t\tsize_t src_n = std::min(data.size() - packet_offset, result.size() - offset);\n\t\t\tstd::copy(data.begin() + packet_offset, data.begin() + packet_offset + src_n, result.begin() + offset);\n\t\t\toffset += data.size();\n\t\t\tif (offset >= result.size())\n\t\t\t\tbreak;\n\t\t}\n\t\treturn result;\n\n\t}\n\n\tvoid PipePacketer::Read(ByteArray &data, ByteArray &response, int timeout)\n\t{\n\t\t_pipe->ReadInterrupt();\n\t\tdata.clear();\n\t\tresponse.clear();\n\t\tByteArray message = ReadMessage(timeout);\n\t\t\/\/HexDump(\"message\", message);\n\t\tInputStream stream(message);\n\t\tu16 raw_code;\n\t\tstream >> raw_code;\n\t\tContainerType type = ContainerType(raw_code);\n\t\tif (type == ContainerType::Data)\n\t\t{\n\t\t\tdata = std::move(message);\n\t\t\tresponse = ReadMessage(timeout);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresponse = std::move(message);\n\t\t}\n\n\t\t\/\/HexDump(\"response\", response);\n\t}\n\n\tDevicePtr Device::Find()\n\t{\n\t\tusing namespace mtp;\n\t\tusb::ContextPtr ctx(new usb::Context);\n\n\t\tfor (usb::DeviceDescriptorPtr desc : ctx->GetDevices())\n\t\t{\n\t\t\tusb::DevicePtr device = desc->TryOpen(ctx);\n\t\t\tif (!device)\n\t\t\t\tcontinue;\n\t\t\tint confs = desc->GetConfigurationsCount();\n\t\t\tprintf(\"configurations: %d\\n\", confs);\n\n\t\t\tfor(int i = 0; i < confs; ++i)\n\t\t\t{\n\t\t\t\tusb::ConfigurationPtr conf = desc->GetConfiguration(i);\n\t\t\t\tint interfaces = conf->GetInterfaceCount();\n\t\t\t\tprintf(\"interfaces: %d\\n\", interfaces);\n\t\t\t\tfor(int j = 0; j < interfaces; ++j)\n\t\t\t\t{\n\t\t\t\t\tusb::InterfacePtr iface = conf->GetInterface(conf, j, 0);\n\t\t\t\t\tprintf(\"%d:%d index %u, eps %u\\n\", i, j, iface->GetIndex(), iface->GetEndpointsCount());\n\t\t\t\t\tint name_idx = iface->GetNameIndex();\n\t\t\t\t\tif (!name_idx)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tstd::string name = device->GetString(name_idx);\n\t\t\t\t\tif (name == \"MTP\")\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/device->SetConfiguration(configuration->GetIndex());\n\t\t\t\t\t\tusb::BulkPipePtr pipe = usb::BulkPipe::Create(device, iface);\n\t\t\t\t\t\treturn std::make_shared<Device>(pipe);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn nullptr;\n\t}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>76166484-2d53-11e5-baeb-247703a38240<commit_msg>7616e184-2d53-11e5-baeb-247703a38240<commit_after>7616e184-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project                                 *\n ******************************************************************************\n * Copyright 2015 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\/ui\/file_picker.h\"\n\n#include \"xenia\/base\/assert.h\"\n#include \"xenia\/base\/platform_win.h\"\n\nnamespace xe {\nnamespace ui {\n\nclass Win32FilePicker : public FilePicker {\n public:\n  Win32FilePicker();\n  ~Win32FilePicker() override;\n\n  bool Show(void* parent_window_handle) override;\n\n private:\n};\n\nstd::unique_ptr<FilePicker> FilePicker::Create() {\n  return std::make_unique<Win32FilePicker>();\n}\n\nclass CDialogEventHandler : public IFileDialogEvents,\n                            public IFileDialogControlEvents {\n public:\n  \/\/ IUnknown methods\n  IFACEMETHODIMP QueryInterface(REFIID riid, void** ppv) {\n    static const QITAB qit[] = {\n        {&__uuidof(IFileDialogEvents),\n         OFFSETOFCLASS(IFileDialogEvents, CDialogEventHandler)},\n        {&__uuidof(IFileDialogControlEvents),\n         OFFSETOFCLASS(IFileDialogControlEvents, CDialogEventHandler)},\n        {0},\n    };\n    return QISearch(this, qit, riid, ppv);\n  }\n\n  IFACEMETHODIMP_(ULONG) AddRef() { return InterlockedIncrement(&_cRef); }\n\n  IFACEMETHODIMP_(ULONG) Release() {\n    long cRef = InterlockedDecrement(&_cRef);\n    if (!cRef) delete this;\n    return cRef;\n  }\n\n  \/\/ IFileDialogEvents methods\n  IFACEMETHODIMP OnFileOk(IFileDialog*) { return S_OK; }\n  IFACEMETHODIMP OnFolderChange(IFileDialog*) { return S_OK; }\n  IFACEMETHODIMP OnFolderChanging(IFileDialog*, IShellItem*) { return S_OK; }\n  IFACEMETHODIMP OnHelp(IFileDialog*) { return S_OK; }\n  IFACEMETHODIMP OnSelectionChange(IFileDialog*) { return S_OK; }\n  IFACEMETHODIMP OnShareViolation(IFileDialog*, IShellItem*,\n                                  FDE_SHAREVIOLATION_RESPONSE*) {\n    return S_OK;\n  }\n  IFACEMETHODIMP OnTypeChange(IFileDialog* pfd) { return S_OK; }\n  IFACEMETHODIMP OnOverwrite(IFileDialog*, IShellItem*,\n                             FDE_OVERWRITE_RESPONSE*) {\n    return S_OK;\n  }\n\n  \/\/ IFileDialogControlEvents methods\n  IFACEMETHODIMP OnItemSelected(IFileDialogCustomize* pfdc, DWORD dwIDCtl,\n                                DWORD dwIDItem) {\n    return S_OK;\n  }\n  IFACEMETHODIMP OnButtonClicked(IFileDialogCustomize*, DWORD) { return S_OK; }\n  IFACEMETHODIMP OnCheckButtonToggled(IFileDialogCustomize*, DWORD, BOOL) {\n    return S_OK;\n  }\n  IFACEMETHODIMP OnControlActivating(IFileDialogCustomize*, DWORD) {\n    return S_OK;\n  }\n\n  CDialogEventHandler() : _cRef(1) {}\n\n private:\n  virtual ~CDialogEventHandler() = default;\n  long _cRef;\n};\n\nHRESULT CDialogEventHandler_CreateInstance(REFIID riid, void** ppv) {\n  *ppv = NULL;\n  auto dialog_event_handler = new (std::nothrow) CDialogEventHandler();\n  HRESULT hr = dialog_event_handler ? S_OK : E_OUTOFMEMORY;\n  if (SUCCEEDED(hr)) {\n    hr = dialog_event_handler->QueryInterface(riid, ppv);\n    dialog_event_handler->Release();\n  }\n  return hr;\n}\n\nWin32FilePicker::Win32FilePicker() = default;\n\nWin32FilePicker::~Win32FilePicker() = default;\n\ntemplate <typename T>\nstruct com_ptr {\n  com_ptr() : value(nullptr) {}\n  ~com_ptr() { reset(); }\n  void reset() {\n    if (value) {\n      value->Release();\n      value = nullptr;\n    }\n  }\n  operator T*() { return value; }\n  T* operator->() const { return value; }\n  T** addressof() { return &value; }\n  T* value;\n};\n\nbool Win32FilePicker::Show(void* parent_window_handle) {\n  \/\/ TODO(benvanik): FileSaveDialog.\n  assert_true(mode() == Mode::kOpen);\n  \/\/ TODO(benvanik): folder dialogs.\n  assert_true(type() == Type::kFile);\n\n  com_ptr<IFileDialog> file_dialog;\n  HRESULT hr =\n      CoCreateInstance(CLSID_FileOpenDialog, NULL, CLSCTX_INPROC_SERVER,\n                       IID_PPV_ARGS(file_dialog.addressof()));\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  hr = file_dialog->SetTitle(title().c_str());\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  DWORD flags;\n  hr = file_dialog->GetOptions(&flags);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n  \/\/ FOS_PICKFOLDERS\n  \/\/ FOS_FILEMUSTEXIST\n  \/\/ FOS_PATHMUSTEXIST\n  flags |= FOS_FORCEFILESYSTEM;\n  if (multi_selection()) {\n    flags |= FOS_ALLOWMULTISELECT;\n  }\n  hr = file_dialog->SetOptions(flags);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ Set the file types to display only. Notice that this is a 1-based array.\n  std::vector<COMDLG_FILTERSPEC> save_types;\n  auto extensions = this->extensions();\n  for (auto& extension : extensions) {\n    save_types.push_back({extension.first.c_str(), extension.second.c_str()});\n  }\n  hr = file_dialog->SetFileTypes(static_cast<UINT>(save_types.size()),\n                                 save_types.data());\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  hr = file_dialog->SetFileTypeIndex(1);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ Create an event handling object, and hook it up to the dialog.\n  com_ptr<IFileDialogEvents> file_dialog_events;\n  hr = CDialogEventHandler_CreateInstance(\n      IID_PPV_ARGS(file_dialog_events.addressof()));\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n  DWORD cookie;\n  hr = file_dialog->Advise(file_dialog_events, &cookie);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ Show the dialog modally.\n  hr = file_dialog->Show(static_cast<HWND>(parent_window_handle));\n  file_dialog->Unadvise(cookie);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ Obtain the result once the user clicks the 'Open' button.\n  \/\/ The result is an IShellItem object.\n  com_ptr<IShellItem> shell_item;\n  hr = file_dialog->GetResult(shell_item.addressof());\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ We are just going to print out the name of the file for sample sake.\n  PWSTR file_path = nullptr;\n  hr = shell_item->GetDisplayName(SIGDN_FILESYSPATH, &file_path);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n  std::vector<std::wstring> selected_files;\n  selected_files.push_back(std::wstring(file_path));\n  set_selected_files(selected_files);\n  CoTaskMemFree(file_path);\n\n  return true;\n}\n\n}  \/\/ namespace ui\n}  \/\/ namespace xe\n<commit_msg>[UI] Undo warning fix in file_picker_win.cc<commit_after>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project                                 *\n ******************************************************************************\n * Copyright 2015 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\/ui\/file_picker.h\"\n\n#include \"xenia\/base\/assert.h\"\n#include \"xenia\/base\/platform_win.h\"\n\nnamespace xe {\nnamespace ui {\n\nclass Win32FilePicker : public FilePicker {\n public:\n  Win32FilePicker();\n  ~Win32FilePicker() override;\n\n  bool Show(void* parent_window_handle) override;\n\n private:\n};\n\nstd::unique_ptr<FilePicker> FilePicker::Create() {\n  return std::make_unique<Win32FilePicker>();\n}\n\nclass CDialogEventHandler : public IFileDialogEvents,\n                            public IFileDialogControlEvents {\n public:\n  \/\/ IUnknown methods\n  IFACEMETHODIMP QueryInterface(REFIID riid, void** ppv) {\n    static const QITAB qit[] = {\n        {&__uuidof(IFileDialogEvents),\n         (int)OFFSETOFCLASS(IFileDialogEvents, CDialogEventHandler)},\n        {&__uuidof(IFileDialogControlEvents),\n         (int)OFFSETOFCLASS(IFileDialogControlEvents, CDialogEventHandler)},\n        {0},\n    };\n    return QISearch(this, qit, riid, ppv);\n  }\n\n  IFACEMETHODIMP_(ULONG) AddRef() { return InterlockedIncrement(&_cRef); }\n\n  IFACEMETHODIMP_(ULONG) Release() {\n    long cRef = InterlockedDecrement(&_cRef);\n    if (!cRef) delete this;\n    return cRef;\n  }\n\n  \/\/ IFileDialogEvents methods\n  IFACEMETHODIMP OnFileOk(IFileDialog*) { return S_OK; }\n  IFACEMETHODIMP OnFolderChange(IFileDialog*) { return S_OK; }\n  IFACEMETHODIMP OnFolderChanging(IFileDialog*, IShellItem*) { return S_OK; }\n  IFACEMETHODIMP OnHelp(IFileDialog*) { return S_OK; }\n  IFACEMETHODIMP OnSelectionChange(IFileDialog*) { return S_OK; }\n  IFACEMETHODIMP OnShareViolation(IFileDialog*, IShellItem*,\n                                  FDE_SHAREVIOLATION_RESPONSE*) {\n    return S_OK;\n  }\n  IFACEMETHODIMP OnTypeChange(IFileDialog* pfd) { return S_OK; }\n  IFACEMETHODIMP OnOverwrite(IFileDialog*, IShellItem*,\n                             FDE_OVERWRITE_RESPONSE*) {\n    return S_OK;\n  }\n\n  \/\/ IFileDialogControlEvents methods\n  IFACEMETHODIMP OnItemSelected(IFileDialogCustomize* pfdc, DWORD dwIDCtl,\n                                DWORD dwIDItem) {\n    return S_OK;\n  }\n  IFACEMETHODIMP OnButtonClicked(IFileDialogCustomize*, DWORD) { return S_OK; }\n  IFACEMETHODIMP OnCheckButtonToggled(IFileDialogCustomize*, DWORD, BOOL) {\n    return S_OK;\n  }\n  IFACEMETHODIMP OnControlActivating(IFileDialogCustomize*, DWORD) {\n    return S_OK;\n  }\n\n  CDialogEventHandler() : _cRef(1) {}\n\n private:\n  virtual ~CDialogEventHandler() = default;\n  long _cRef;\n};\n\nHRESULT CDialogEventHandler_CreateInstance(REFIID riid, void** ppv) {\n  *ppv = NULL;\n  auto dialog_event_handler = new (std::nothrow) CDialogEventHandler();\n  HRESULT hr = dialog_event_handler ? S_OK : E_OUTOFMEMORY;\n  if (SUCCEEDED(hr)) {\n    hr = dialog_event_handler->QueryInterface(riid, ppv);\n    dialog_event_handler->Release();\n  }\n  return hr;\n}\n\nWin32FilePicker::Win32FilePicker() = default;\n\nWin32FilePicker::~Win32FilePicker() = default;\n\ntemplate <typename T>\nstruct com_ptr {\n  com_ptr() : value(nullptr) {}\n  ~com_ptr() { reset(); }\n  void reset() {\n    if (value) {\n      value->Release();\n      value = nullptr;\n    }\n  }\n  operator T*() { return value; }\n  T* operator->() const { return value; }\n  T** addressof() { return &value; }\n  T* value;\n};\n\nbool Win32FilePicker::Show(void* parent_window_handle) {\n  \/\/ TODO(benvanik): FileSaveDialog.\n  assert_true(mode() == Mode::kOpen);\n  \/\/ TODO(benvanik): folder dialogs.\n  assert_true(type() == Type::kFile);\n\n  com_ptr<IFileDialog> file_dialog;\n  HRESULT hr =\n      CoCreateInstance(CLSID_FileOpenDialog, NULL, CLSCTX_INPROC_SERVER,\n                       IID_PPV_ARGS(file_dialog.addressof()));\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  hr = file_dialog->SetTitle(title().c_str());\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  DWORD flags;\n  hr = file_dialog->GetOptions(&flags);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n  \/\/ FOS_PICKFOLDERS\n  \/\/ FOS_FILEMUSTEXIST\n  \/\/ FOS_PATHMUSTEXIST\n  flags |= FOS_FORCEFILESYSTEM;\n  if (multi_selection()) {\n    flags |= FOS_ALLOWMULTISELECT;\n  }\n  hr = file_dialog->SetOptions(flags);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ Set the file types to display only. Notice that this is a 1-based array.\n  std::vector<COMDLG_FILTERSPEC> save_types;\n  auto extensions = this->extensions();\n  for (auto& extension : extensions) {\n    save_types.push_back({extension.first.c_str(), extension.second.c_str()});\n  }\n  hr = file_dialog->SetFileTypes(static_cast<UINT>(save_types.size()),\n                                 save_types.data());\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  hr = file_dialog->SetFileTypeIndex(1);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ Create an event handling object, and hook it up to the dialog.\n  com_ptr<IFileDialogEvents> file_dialog_events;\n  hr = CDialogEventHandler_CreateInstance(\n      IID_PPV_ARGS(file_dialog_events.addressof()));\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n  DWORD cookie;\n  hr = file_dialog->Advise(file_dialog_events, &cookie);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ Show the dialog modally.\n  hr = file_dialog->Show(static_cast<HWND>(parent_window_handle));\n  file_dialog->Unadvise(cookie);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ Obtain the result once the user clicks the 'Open' button.\n  \/\/ The result is an IShellItem object.\n  com_ptr<IShellItem> shell_item;\n  hr = file_dialog->GetResult(shell_item.addressof());\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n\n  \/\/ We are just going to print out the name of the file for sample sake.\n  PWSTR file_path = nullptr;\n  hr = shell_item->GetDisplayName(SIGDN_FILESYSPATH, &file_path);\n  if (!SUCCEEDED(hr)) {\n    return false;\n  }\n  std::vector<std::wstring> selected_files;\n  selected_files.push_back(std::wstring(file_path));\n  set_selected_files(selected_files);\n  CoTaskMemFree(file_path);\n\n  return true;\n}\n\n}  \/\/ namespace ui\n}  \/\/ namespace xe\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by dar on 11\/27\/15.\n\/\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <gui\/GuiText.h>\n#include <gui\/GuiButton.h>\n#include \"Game.h\"\n#include \"..\/core\/Core.h\"\n#include \"..\/core\/map\/TiledTxtMapLoader.h\"\n#include \"render\/RenderManager.h\"\n#include \"InputManager.h\"\n#include <core\/map\/entity\/EntityBullet.h>\n#include <gui\/GuiTextBubble.h>\n#include <core\/map\/entity\/EntityDoor.h>\n#include <core\/map\/entity\/EntityFurniture.h>\n#include \"..\/logging.h\"\n\nGame::Game(ApplicationContext *applicationContext) : Window(applicationContext) {\n    initShapeDefinitions();\n    MapLoader *mapLoader = new TiledTxtMapLoader(\"test_map\");\n    Map *bmap = mapLoader->loadMap();\n    this->core = new Core(bmap);\n    delete mapLoader;\n\n    double ringScale = 2 * this->core->getBlockSize();\n    this->entityRotationRing = new GuiElement(GUI_TOP_LEFT, 0, 0, ringScale, ringScale, 6);\n    this->entityRotationRing->setVisible(false);\n    this->entityRotationRing->setAngle(2);\n    this->guiElements.push_back(this->entityRotationRing);\n\n    GuiText *t = new GuiText(string(\"Dev Build: \") + __DATE__ + \" \" + __TIME__, 15, 15, GUI_BOTTOM_LEFT, 32, 0xFFFFFFFF, 0);\n    this->guiElements.push_back(t);\n}\n\nvoid Game::reload(unsigned int windowWidth, unsigned int windowHeight) {\n    for (GuiElement *e : this->guiElements) {\n        e->reinit(windowWidth, windowHeight);\n    }\n\n    this->windowWidth = windowWidth;\n    this->windowHeight = windowHeight;\n    SDL_StartTextInput();\n}\n\nvoid Game::tick(double deltaTime) {\n    this->core->getMap()->update(deltaTime);\n    this->core->getMap()->getWorld()->Step(deltaTime, 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->getPlayer()->getX() + this->core->getPlayer()->getWidth() \/ 2 - 1);\n    this->core->setCamY(this->core->getPlayer()->getY() + this->core->getPlayer()->getHeight() \/ 2 - 1);\n}\n\nvoid Game::handleKeyboard(const Keypress *const keypress) {\n    if (keypress[SDLK_c].isPressed()) {\n        double angle = atan2(0, 0) + M_PI; \/\/TODO\n        EntityBullet *p = new EntityBullet(this->core->getMap(), angle, 1);\n        p->setX(this->core->getPlayer()->getX() - (p->getWidth()) + 0.5 * cos(angle));\n        p->setY(this->core->getPlayer()->getY() - (p->getHeight()) + 0.5 * sin(angle));\n        this->core->getMap()->addEntity(p);\n    }\n    if (keypress[SDLK_n].isPressed()) {\n        Entity *p;\n        switch (rand() % 6) {\n            case 0:\n                p = new EntityFridge(this->core->getMap());\n                break;\n            case 1:\n                p = new EntityTruck(this->core->getMap());\n                break;\n            case 2:\n                p = new EntityBulldozer(this->core->getMap());\n                break;\n            case 3:\n                p = new EntityWardrobe(this->core->getMap());\n                break;\n            case 4:\n                p = new EntityTable(this->core->getMap());\n                break;\n            case 5:\n                p = new EntityChair(this->core->getMap());\n                break;\n            default:\n                p = new EntityDoor(this->core->getMap(), 0);\n                break;\n        }\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    }\n    if (keypress[SDLK_m].isPressed()) {\n        SimpleShape *p = new SimpleShape(this->core->getMap(), (unsigned int) (rand() % 3));\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    }\n    if (keypress[SDLK_k].isPressed()) {\n        if (this->core->getPlayer()->getToy() == nullptr) {\n            this->core->getPlayer()->setToy();\n        } else {\n            this->core->getPlayer()->eject();\n        }\n    }\n    double playerSpeed = 1.0;\n    if (!this->entityRotationRing->isVisible()) {\n        if (keypress[SDLK_w].isDown()) {\n            this->core->getPlayer()->applyImpulse(0, -playerSpeed);\n        }\n        if (keypress[SDLK_s].isDown()) {\n            this->core->getPlayer()->applyImpulse(0, playerSpeed);\n        }\n        if (keypress[SDLK_a].isDown()) {\n            this->core->getPlayer()->applyImpulse(-playerSpeed, 0);\n        }\n        if (keypress[SDLK_d].isDown()) {\n            this->core->getPlayer()->applyImpulse(playerSpeed, 0);\n        }\n    }\n    if (keypress[SDLK_q].isPressed()) {\n        this->core->stop();\n    }\n    if (keypress[SDLK_p].isPressed()) {\n        this->core->getMap()->saveEntities();\n    }\n    if (keypress[SDLK_MINUS].isDown()) {\n        this->core->setBlockSize(this->core->getBlockSize() - 0.15);\n    }\n    if (keypress[SDLK_EQUALS].isDown()) {\n        this->core->setBlockSize(this->core->getBlockSize() + 0.15);\n    }\n}\n\nvoid Game::handleClick(const TouchPoint *const p) {\n    float x = (float) ((-this->core->getCamX() - ((double) this->windowWidth \/ (2.0) - p->x) \/ (this->core->getGeneralScale() * this->core->getBlockSize())) + 0.5);\n    float y = (float) ((-this->core->getCamY() - ((double) this->windowHeight \/ (2.0) - p->y) \/ (this->core->getGeneralScale() * this->core->getBlockSize())) + 0.5);\n    if (p->id == SDL_BUTTON_LEFT) {\n        if (p->state == 0) {\n            this->heldEntity = this->core->getMap()->getEntityAt<Entity>(x, y);\n            this->relXClicked = this->heldEntity->getX() - x;\n            this->relYClicked = this->heldEntity->getY() - y;\n        } else if (p->state == 2) {\n            if (this->heldEntity != nullptr && !this->entityRotationRing->isVisible()) {\n                Entity *e = this->heldEntity;\n                e->setX(x + relXClicked);\n                e->setY(y + relYClicked);\n            }\n        } else if (p->state == 1) {\n            if (this->heldEntity == nullptr) {\n                \/*SimpleShape *s = new SimpleShape(this->core->getMap(), (unsigned int) (rand() % 3));\n                s->setX(x + s->getWidth() \/ 2);\n                s->setY(y + s->getWidth() \/ 2);\n                this->core->getMap()->addEntity(s);*\/\n            } else {\n                this->heldEntity = nullptr;\n                if (this->entityRotationRing->isVisible()) {\n                    this->entityRotationRing->setVisible(false);\n                    SDL_ShowCursor(true);\n                    SDL_WarpMouseGlobal(this->mouseLockX, this->mouseLockY);\n                }\n            }\n        }\n    } else if (p->id == SDL_BUTTON_MIDDLE) {\n        if (p->state == 0) {\n            this->heldEntity = this->core->getMap()->getEntityAt<Entity>(x, y);\n        } else if (p->state == 1) {\n            if (this->heldEntity != nullptr && this->core->getMap()->getEntityAt<Entity>(x, y) == this->heldEntity) {\n                this->heldEntity->remove();\n            }\n        }\n    } else if (p->id == SDL_BUTTON_RIGHT) {\n        if (p->state == 0) {\n            if (this->heldEntity != nullptr) {\n                double scale = this->core->getGeneralScale() * this->core->getBlockSize();\n                double player_x = this->windowWidth \/ 2.0 + (this->heldEntity->getBody()->GetPosition().x + this->core->getCamX() - 0.5) * scale;\n                double player_y = this->windowHeight \/ 2.0 + (this->heldEntity->getBody()->GetPosition().y + this->core->getCamY() - 0.5) * scale;\n                this->entityRotationRing->setX(player_x - this->entityRotationRing->getWidth() \/ 2);\n                this->entityRotationRing->setY(player_y - this->entityRotationRing->getHeight() \/ 2);\n                this->defaultAngle = this->heldEntity->getAngle();\n                this->entityRotationRing->setVisible(true);\n                SDL_GetGlobalMouseState(&this->mouseLockX, &this->mouseLockY);\n                SDL_ShowCursor(false);\n            }\n        } else if (p->state == 2) {\n            if (this->heldEntity != nullptr) {\n                int x, y;\n                SDL_GetGlobalMouseState(&x, &y);\n                double angle = this->defaultAngle + 10.0 * (x - this->mouseLockX) \/ this->windowWidth;\n                this->entityRotationRing->setAngle(angle);\n                this->heldEntity->setAngle(angle);\n            }\n        } else if (p->state == 1) {\n            if (this->entityRotationRing->isVisible()) {\n                this->entityRotationRing->setVisible(false);\n                SDL_ShowCursor(true);\n                SDL_WarpMouseGlobal(this->mouseLockX, this->mouseLockY);\n            }\n        }\n    }\n}\n\nGame::~Game() {\n    SDL_StopTextInput();\n    delete this->core;\n}\n<commit_msg>Fixed segfault when no entity was selected upon LMB click<commit_after>\/\/\n\/\/ Created by dar on 11\/27\/15.\n\/\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <gui\/GuiText.h>\n#include <gui\/GuiButton.h>\n#include \"Game.h\"\n#include \"..\/core\/Core.h\"\n#include \"..\/core\/map\/TiledTxtMapLoader.h\"\n#include \"render\/RenderManager.h\"\n#include \"InputManager.h\"\n#include <core\/map\/entity\/EntityBullet.h>\n#include <gui\/GuiTextBubble.h>\n#include <core\/map\/entity\/EntityDoor.h>\n#include <core\/map\/entity\/EntityFurniture.h>\n#include \"..\/logging.h\"\n\nGame::Game(ApplicationContext *applicationContext) : Window(applicationContext) {\n    initShapeDefinitions();\n    MapLoader *mapLoader = new TiledTxtMapLoader(\"test_map\");\n    Map *bmap = mapLoader->loadMap();\n    this->core = new Core(bmap);\n    delete mapLoader;\n\n    double ringScale = 2 * this->core->getBlockSize();\n    this->entityRotationRing = new GuiElement(GUI_TOP_LEFT, 0, 0, ringScale, ringScale, 6);\n    this->entityRotationRing->setVisible(false);\n    this->entityRotationRing->setAngle(2);\n    this->guiElements.push_back(this->entityRotationRing);\n\n    GuiText *t = new GuiText(string(\"Dev Build: \") + __DATE__ + \" \" + __TIME__, 15, 15, GUI_BOTTOM_LEFT, 32, 0xFFFFFFFF, 0);\n    this->guiElements.push_back(t);\n}\n\nvoid Game::reload(unsigned int windowWidth, unsigned int windowHeight) {\n    for (GuiElement *e : this->guiElements) {\n        e->reinit(windowWidth, windowHeight);\n    }\n\n    this->windowWidth = windowWidth;\n    this->windowHeight = windowHeight;\n    SDL_StartTextInput();\n}\n\nvoid Game::tick(double deltaTime) {\n    this->core->getMap()->update(deltaTime);\n    this->core->getMap()->getWorld()->Step(deltaTime, 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->getPlayer()->getX() + this->core->getPlayer()->getWidth() \/ 2 - 1);\n    this->core->setCamY(this->core->getPlayer()->getY() + this->core->getPlayer()->getHeight() \/ 2 - 1);\n}\n\nvoid Game::handleKeyboard(const Keypress *const keypress) {\n    if (keypress[SDLK_c].isPressed()) {\n        double angle = atan2(0, 0) + M_PI; \/\/TODO\n        EntityBullet *p = new EntityBullet(this->core->getMap(), angle, 1);\n        p->setX(this->core->getPlayer()->getX() - (p->getWidth()) + 0.5 * cos(angle));\n        p->setY(this->core->getPlayer()->getY() - (p->getHeight()) + 0.5 * sin(angle));\n        this->core->getMap()->addEntity(p);\n    }\n    if (keypress[SDLK_n].isPressed()) {\n        Entity *p;\n        switch (rand() % 6) {\n            case 0:\n                p = new EntityFridge(this->core->getMap());\n                break;\n            case 1:\n                p = new EntityTruck(this->core->getMap());\n                break;\n            case 2:\n                p = new EntityBulldozer(this->core->getMap());\n                break;\n            case 3:\n                p = new EntityWardrobe(this->core->getMap());\n                break;\n            case 4:\n                p = new EntityTable(this->core->getMap());\n                break;\n            case 5:\n                p = new EntityChair(this->core->getMap());\n                break;\n            default:\n                p = new EntityDoor(this->core->getMap(), 0);\n                break;\n        }\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    }\n    if (keypress[SDLK_m].isPressed()) {\n        SimpleShape *p = new SimpleShape(this->core->getMap(), (unsigned int) (rand() % 3));\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    }\n    if (keypress[SDLK_k].isPressed()) {\n        if (this->core->getPlayer()->getToy() == nullptr) {\n            this->core->getPlayer()->setToy();\n        } else {\n            this->core->getPlayer()->eject();\n        }\n    }\n    double playerSpeed = 1.0;\n    if (!this->entityRotationRing->isVisible()) {\n        if (keypress[SDLK_w].isDown()) {\n            this->core->getPlayer()->applyImpulse(0, -playerSpeed);\n        }\n        if (keypress[SDLK_s].isDown()) {\n            this->core->getPlayer()->applyImpulse(0, playerSpeed);\n        }\n        if (keypress[SDLK_a].isDown()) {\n            this->core->getPlayer()->applyImpulse(-playerSpeed, 0);\n        }\n        if (keypress[SDLK_d].isDown()) {\n            this->core->getPlayer()->applyImpulse(playerSpeed, 0);\n        }\n    }\n    if (keypress[SDLK_q].isPressed()) {\n        this->core->stop();\n    }\n    if (keypress[SDLK_p].isPressed()) {\n        this->core->getMap()->saveEntities();\n    }\n    if (keypress[SDLK_MINUS].isDown()) {\n        this->core->setBlockSize(this->core->getBlockSize() - 0.15);\n    }\n    if (keypress[SDLK_EQUALS].isDown()) {\n        this->core->setBlockSize(this->core->getBlockSize() + 0.15);\n    }\n}\n\nvoid Game::handleClick(const TouchPoint *const p) {\n    float x = (float) ((-this->core->getCamX() - ((double) this->windowWidth \/ (2.0) - p->x) \/ (this->core->getGeneralScale() * this->core->getBlockSize())) + 0.5);\n    float y = (float) ((-this->core->getCamY() - ((double) this->windowHeight \/ (2.0) - p->y) \/ (this->core->getGeneralScale() * this->core->getBlockSize())) + 0.5);\n    if (p->id == SDL_BUTTON_LEFT) {\n        if (p->state == 0) {\n            this->heldEntity = this->core->getMap()->getEntityAt<Entity>(x, y);\n            if (this->heldEntity != nullptr) {\n                this->relXClicked = this->heldEntity->getX() - x;\n                this->relYClicked = this->heldEntity->getY() - y;\n            }\n        } else if (p->state == 2) {\n            if (this->heldEntity != nullptr && !this->entityRotationRing->isVisible()) {\n                Entity *e = this->heldEntity;\n                e->setX(x + relXClicked);\n                e->setY(y + relYClicked);\n            }\n        } else if (p->state == 1) {\n            if (this->heldEntity == nullptr) {\n                \/*SimpleShape *s = new SimpleShape(this->core->getMap(), (unsigned int) (rand() % 3));\n                s->setX(x + s->getWidth() \/ 2);\n                s->setY(y + s->getWidth() \/ 2);\n                this->core->getMap()->addEntity(s);*\/\n            } else {\n                this->heldEntity = nullptr;\n                if (this->entityRotationRing->isVisible()) {\n                    this->entityRotationRing->setVisible(false);\n                    SDL_ShowCursor(true);\n                    SDL_WarpMouseGlobal(this->mouseLockX, this->mouseLockY);\n                }\n            }\n        }\n    } else if (p->id == SDL_BUTTON_MIDDLE) {\n        if (p->state == 0) {\n            this->heldEntity = this->core->getMap()->getEntityAt<Entity>(x, y);\n        } else if (p->state == 1) {\n            if (this->heldEntity != nullptr && this->core->getMap()->getEntityAt<Entity>(x, y) == this->heldEntity) {\n                this->heldEntity->remove();\n            }\n        }\n    } else if (p->id == SDL_BUTTON_RIGHT) {\n        if (p->state == 0) {\n            if (this->heldEntity != nullptr) {\n                double scale = this->core->getGeneralScale() * this->core->getBlockSize();\n                double player_x = this->windowWidth \/ 2.0 + (this->heldEntity->getBody()->GetPosition().x + this->core->getCamX() - 0.5) * scale;\n                double player_y = this->windowHeight \/ 2.0 + (this->heldEntity->getBody()->GetPosition().y + this->core->getCamY() - 0.5) * scale;\n                this->entityRotationRing->setX(player_x - this->entityRotationRing->getWidth() \/ 2);\n                this->entityRotationRing->setY(player_y - this->entityRotationRing->getHeight() \/ 2);\n                this->defaultAngle = this->heldEntity->getAngle();\n                this->entityRotationRing->setVisible(true);\n                SDL_GetGlobalMouseState(&this->mouseLockX, &this->mouseLockY);\n                SDL_ShowCursor(false);\n            }\n        } else if (p->state == 2) {\n            if (this->heldEntity != nullptr) {\n                int x, y;\n                SDL_GetGlobalMouseState(&x, &y);\n                double angle = this->defaultAngle + 10.0 * (x - this->mouseLockX) \/ this->windowWidth;\n                this->entityRotationRing->setAngle(angle);\n                this->heldEntity->setAngle(angle);\n            }\n        } else if (p->state == 1) {\n            if (this->entityRotationRing->isVisible()) {\n                this->entityRotationRing->setVisible(false);\n                SDL_ShowCursor(true);\n                SDL_WarpMouseGlobal(this->mouseLockX, this->mouseLockY);\n            }\n        }\n    }\n}\n\nGame::~Game() {\n    SDL_StopTextInput();\n    delete this->core;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  Keyboard.h\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 08\/05\/2019.\n\/\/  Copyright © 2019 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef Apple_Macintosh_Keyboard_hpp\n#define Apple_Macintosh_Keyboard_hpp\n\n#include \"..\/..\/KeyboardMachine.hpp\"\n\n#include <mutex>\n#include <vector>\n\nnamespace Apple {\nnamespace Macintosh {\n\nclass Keyboard {\n\tpublic:\n\t\tvoid set_input(bool data) {\n\t\t\tswitch(mode_) {\n\t\t\t\tcase Mode::Waiting:\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"Only the computer can initiate communication over the keyboard lines. When the computer and keyboard\n\t\t\t\t\t\tare turned on, the computer is in charge of the keyboard interface and the keyboard is passive. The\n\t\t\t\t\t\tcomputer signals that it is ready to begin communication by pulling the Keyboard Data line low.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tif(!data) {\n\t\t\t\t\t\tmode_ = Mode::AcceptingCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t\tcommand_ = 0;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Mode::AcceptingCommand:\n\t\t\t\t\t\/* Note value, so that it can be latched upon a clock transition. *\/\n\t\t\t\t\tdata_input_ = data;\n\t\t\t\tbreak;\n\n\t\t\t\tcase Mode::AwaitingEndOfCommand:\n\t\t\t\t\t\/*\n\t\t\t\t\t\tThe last bit of the command leaves the Keyboard Data line low; the computer then indicates that it is ready\n\t\t\t\t\t\tto receive the keyboard's response by setting the Keyboard Data line high.\n\t\t\t\t\t*\/\n\t\t\t\t\tif(data) {\n\t\t\t\t\t\tmode_ = Mode::PerformingCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tdefault:\n\t\t\t\tcase Mode::SendingResponse:\n\t\t\t\t\t\/* This line isn't currently an input; do nothing. *\/\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tbool get_clock() {\n\t\t\treturn clock_output_;\n\t\t}\n\n\t\tbool get_data() {\n\t\t\treturn !!(response_ & 0x80);\n\t\t}\n\n\t\t\/*!\n\t\t\tThe keyboard expects ~10 µs-frequency ticks, i.e. a clock rate of just around 100 kHz.\n\t\t*\/\n\t\tvoid run_for(HalfCycles cycle) {\n\t\t\tswitch(mode_) {\n\t\t\t\tdefault:\n\t\t\t\tcase Mode::Waiting: return;\n\n\t\t\t\tcase Mode::AcceptingCommand: {\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"When the computer is sending data to the keyboard, the keyboard transmits eight cycles of 400 µS each (180 µS low,\n\t\t\t\t\t\t220 µS high) on the Keyboard Clock line. On the falling edge of each keyboard clock cycle, the Macintosh Plus places\n\t\t\t\t\t\ta data bit on the data line and holds it there for 400 µS. The keyboard reads the data bit 80 µS after the rising edge\n\t\t\t\t\t\tof the Keyboard Clock signal.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tconst auto offset = phase_ % 40;\n\t\t\t\t\tclock_output_ = offset >= 18;\n\n\t\t\t\t\tif(offset == 26) {\n\t\t\t\t\t\tcommand_ = (command_ << 1) | (data_input_ ? 1 : 0);\n\t\t\t\t\t}\n\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 8*40) {\n\t\t\t\t\t\tmode_ = Mode::AwaitingEndOfCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t\tclock_output_ = false;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\n\t\t\t\tcase Mode::AwaitingEndOfCommand:\n\t\t\t\t\t\/\/ Time out if the end-of-command seems not to be forthcoming.\n\t\t\t\t\t\/\/ This is an elaboration on my part; a guess.\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 1000) {\n\t\t\t\t\t\tclock_output_ = false;\n\t\t\t\t\t\tmode_ = Mode::Waiting;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\treturn;\n\n\t\t\t\tcase Mode::PerformingCommand: {\n\t\t\t\t\tresponse_ = perform_command(command_);\n\n\t\t\t\t\t\/\/ Inquiry has a 0.25-second timeout; everything else is instant.\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 25000 || command_ != 0x10 || response_ != 0x7b) {\n\t\t\t\t\t\tmode_ = Mode::SendingResponse;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\n\t\t\t\tcase Mode::SendingResponse: {\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"When sending data to the computer, the keyboard transmits eight cycles of 330 µS each (160 µS low, 170 µS high)\n\t\t\t\t\t\ton the normally high Keyboard Clock line. It places a data bit on the data line 40 µS before the falling edge of each\n\t\t\t\t\t\tclock cycle and maintains it for 330 µS. The VIA in the computer latches the data bit into its shift register on the\n\t\t\t\t\t\trising edge of the Keyboard Clock signal.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tconst auto offset = phase_ % 33;\n\t\t\t\t\tclock_output_ = offset >= 16;\n\n\t\t\t\t\tif(offset == 29) {\n\t\t\t\t\t\tresponse_ <<= 1;\n\t\t\t\t\t}\n\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 8*33) {\n\t\t\t\t\t\tclock_output_ = false;\n\t\t\t\t\t\tmode_ = Mode::Waiting;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\t\t\t}\n\t\t}\n\n\t\tvoid enqueue_key_state(uint16_t key, bool is_pressed) {\n\t\t\t\/\/ Front insert; messages will be pop_back'd.\n\t\t\tstd::lock_guard<decltype(key_queue_mutex_)> lock(key_queue_mutex_);\n\t\t\tkey_queue_.insert(key_queue_.begin(), (is_pressed ? 0x00 : 0x80) | uint8_t(key));\n\t\t}\n\n\tprivate:\n\n\t\tint perform_command(int command) {\n\t\t\tswitch(command) {\n\t\t\t\tcase 0x10:\t\t\/\/ Inquiry.\n\t\t\t\tcase 0x14: {\t\/\/ Instant.\n\t\t\t\t\tstd::lock_guard<decltype(key_queue_mutex_)> lock(key_queue_mutex_);\n\t\t\t\t\tif(!key_queue_.empty()) {\n\t\t\t\t\t\tconst auto new_message = key_queue_.back();\n\t\t\t\t\t\tkey_queue_.pop_back();\n\t\t\t\t\t\treturn new_message;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\n\t\t\t\tcase 0x16:\t\/\/ Model number.\n\t\t\t\treturn\n\t\t\t\t\t0x01 |\t\t\t\/\/ b0: always 1\n\t\t\t\t\t(1 << 1) |\t\t\/\/ keyboard model number\n\t\t\t\t\t(1 << 4);\t\t\/\/ next device number\n\t\t\t\t\t\t\t\t\t\/\/ (b7 not set => no next device)\n\n\t\t\t\tcase 0x36:\t\/\/ Test\n\t\t\t\treturn 0x7d;\t\t\/\/ 0x7d = ACK, 0x77 = not ACK.\n\t\t\t}\n\t\t\treturn 0x7b;\t\/\/ No key transition.\n\t\t}\n\n\t\tenum class Mode {\n\t\t\tWaiting,\n\t\t\tAcceptingCommand,\n\t\t\tAwaitingEndOfCommand,\n\t\t\tSendingResponse,\n\t\t\tPerformingCommand\n\t\t} mode_ = Mode::Waiting;\n\t\tint phase_ = 0;\n\t\tint command_ = 0;\n\t\tint response_ = 0;\n\n\t\tbool data_input_ = false;\n\t\tbool clock_output_ = false;\n\n\t\t\/\/ TODO: improve this very, very simple implementation.\n\t\tstd::mutex key_queue_mutex_;\n\t\tstd::vector<uint8_t> key_queue_;\n};\n\n\/*!\n\tProvides a mapping from idiomatic PC keys to Macintosh keys.\n*\/\nclass KeyboardMapper: public KeyboardMachine::MappedMachine::KeyboardMapper {\n\tuint16_t mapped_key_for_key(Inputs::Keyboard::Key key) override {\n\t\tusing Key = Inputs::Keyboard::Key;\n\t\tswitch(key) {\n\t\t\tdefault: return KeyboardMachine::MappedMachine::KeyNotMapped;\n\n\t\t\t\/*\n\t\t\t\tSee p284 of the Apple Guide to the Macintosh Family Hardware\n\t\t\t\tfor documentation of the mapping below.\n\t\t\t*\/\n\n\t\t\tcase Key::BackTick:\t\t\t\treturn 0x65;\n\t\t\tcase Key::k1:\t\t\t\t\treturn 0x25;\n\t\t\tcase Key::k2:\t\t\t\t\treturn 0x27;\n\t\t\tcase Key::k3:\t\t\t\t\treturn 0x29;\n\t\t\tcase Key::k4:\t\t\t\t\treturn 0x2b;\n\t\t\tcase Key::k5:\t\t\t\t\treturn 0x2f;\n\t\t\tcase Key::k6:\t\t\t\t\treturn 0x2d;\n\t\t\tcase Key::k7:\t\t\t\t\treturn 0x35;\n\t\t\tcase Key::k8:\t\t\t\t\treturn 0x39;\n\t\t\tcase Key::k9:\t\t\t\t\treturn 0x33;\n\t\t\tcase Key::k0:\t\t\t\t\treturn 0x3b;\n\t\t\tcase Key::Hyphen:\t\t\t\treturn 0x37;\n\t\t\tcase Key::Equals:\t\t\t\treturn 0x31;\n\t\t\tcase Key::BackSpace:\t\t\treturn 0x67;\n\n\t\t\tcase Key::Tab:\t\t\t\t\treturn 0x61;\n\t\t\tcase Key::Q:\t\t\t\t\treturn 0x19;\n\t\t\tcase Key::W:\t\t\t\t\treturn 0x1b;\n\t\t\tcase Key::E:\t\t\t\t\treturn 0x1d;\n\t\t\tcase Key::R:\t\t\t\t\treturn 0x1f;\n\t\t\tcase Key::T:\t\t\t\t\treturn 0x23;\n\t\t\tcase Key::Y:\t\t\t\t\treturn 0x21;\n\t\t\tcase Key::U:\t\t\t\t\treturn 0x41;\n\t\t\tcase Key::I:\t\t\t\t\treturn 0x45;\n\t\t\tcase Key::O:\t\t\t\t\treturn 0x3f;\n\t\t\tcase Key::P:\t\t\t\t\treturn 0x47;\n\t\t\tcase Key::OpenSquareBracket:\treturn 0x43;\n\t\t\tcase Key::CloseSquareBracket:\treturn 0x3d;\n\n\t\t\tcase Key::CapsLock:\t\t\t\treturn 0x73;\n\t\t\tcase Key::A:\t\t\t\t\treturn 0x01;\n\t\t\tcase Key::S:\t\t\t\t\treturn 0x03;\n\t\t\tcase Key::D:\t\t\t\t\treturn 0x05;\n\t\t\tcase Key::F:\t\t\t\t\treturn 0x07;\n\t\t\tcase Key::G:\t\t\t\t\treturn 0x0b;\n\t\t\tcase Key::H:\t\t\t\t\treturn 0x09;\n\t\t\tcase Key::J:\t\t\t\t\treturn 0x4d;\n\t\t\tcase Key::K:\t\t\t\t\treturn 0x51;\n\t\t\tcase Key::L:\t\t\t\t\treturn 0x4b;\n\t\t\tcase Key::Semicolon:\t\t\treturn 0x53;\n\t\t\tcase Key::Quote:\t\t\t\treturn 0x4f;\n\t\t\tcase Key::Enter:\t\t\t\treturn 0x49;\n\n\t\t\tcase Key::LeftShift:\t\t\treturn 0x71;\n\t\t\tcase Key::Z:\t\t\t\t\treturn 0x0d;\n\t\t\tcase Key::X:\t\t\t\t\treturn 0x0f;\n\t\t\tcase Key::C:\t\t\t\t\treturn 0x11;\n\t\t\tcase Key::V:\t\t\t\t\treturn 0x13;\n\t\t\tcase Key::B:\t\t\t\t\treturn 0x17;\n\t\t\tcase Key::N:\t\t\t\t\treturn 0x5b;\n\t\t\tcase Key::M:\t\t\t\t\treturn 0x5d;\n\t\t\tcase Key::Comma:\t\t\t\treturn 0x57;\n\t\t\tcase Key::FullStop:\t\t\t\treturn 0x5f;\n\t\t\tcase Key::ForwardSlash:\t\t\treturn 0x59;\n\t\t\tcase Key::RightShift:\t\t\treturn 0x71;\n\n\t\t\tcase Key::Left:\t\t\t\t\treturn 0x0d;\n\t\t\tcase Key::Right:\t\t\t\treturn 0x05;\n\t\t\tcase Key::Up:\t\t\t\t\treturn 0x1b;\n\t\t\tcase Key::Down:\t\t\t\t\treturn 0x11;\n\n\t\t\tcase Key::LeftOption:\n\t\t\tcase Key::RightOption:\t\t\treturn 0x75;\n\t\t\tcase Key::LeftMeta:\n\t\t\tcase Key::RightMeta:\t\t\treturn 0x6f;\n\n\t\t\tcase Key::Space:\t\t\t\treturn 0x63;\n\t\t\tcase Key::BackSlash:\t\t\treturn 0x55;\n\n\t\t\t\/* TODO: the numeric keypad. *\/\n\t\t}\n\t}\n\n};\n\n}\n}\n\n#endif \/* Apple_Macintosh_Keyboard_hpp *\/\n<commit_msg>Fixes keypad keys.<commit_after>\/\/\n\/\/  Keyboard.h\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 08\/05\/2019.\n\/\/  Copyright © 2019 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef Apple_Macintosh_Keyboard_hpp\n#define Apple_Macintosh_Keyboard_hpp\n\n#include \"..\/..\/KeyboardMachine.hpp\"\n\n#include <mutex>\n#include <vector>\n\nnamespace Apple {\nnamespace Macintosh {\n\nclass Keyboard {\n\tpublic:\n\t\tvoid set_input(bool data) {\n\t\t\tswitch(mode_) {\n\t\t\t\tcase Mode::Waiting:\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"Only the computer can initiate communication over the keyboard lines. When the computer and keyboard\n\t\t\t\t\t\tare turned on, the computer is in charge of the keyboard interface and the keyboard is passive. The\n\t\t\t\t\t\tcomputer signals that it is ready to begin communication by pulling the Keyboard Data line low.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tif(!data) {\n\t\t\t\t\t\tmode_ = Mode::AcceptingCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t\tcommand_ = 0;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Mode::AcceptingCommand:\n\t\t\t\t\t\/* Note value, so that it can be latched upon a clock transition. *\/\n\t\t\t\t\tdata_input_ = data;\n\t\t\t\tbreak;\n\n\t\t\t\tcase Mode::AwaitingEndOfCommand:\n\t\t\t\t\t\/*\n\t\t\t\t\t\tThe last bit of the command leaves the Keyboard Data line low; the computer then indicates that it is ready\n\t\t\t\t\t\tto receive the keyboard's response by setting the Keyboard Data line high.\n\t\t\t\t\t*\/\n\t\t\t\t\tif(data) {\n\t\t\t\t\t\tmode_ = Mode::PerformingCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tdefault:\n\t\t\t\tcase Mode::SendingResponse:\n\t\t\t\t\t\/* This line isn't currently an input; do nothing. *\/\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tbool get_clock() {\n\t\t\treturn clock_output_;\n\t\t}\n\n\t\tbool get_data() {\n\t\t\treturn !!(response_ & 0x80);\n\t\t}\n\n\t\t\/*!\n\t\t\tThe keyboard expects ~10 µs-frequency ticks, i.e. a clock rate of just around 100 kHz.\n\t\t*\/\n\t\tvoid run_for(HalfCycles cycle) {\n\t\t\tswitch(mode_) {\n\t\t\t\tdefault:\n\t\t\t\tcase Mode::Waiting: return;\n\n\t\t\t\tcase Mode::AcceptingCommand: {\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"When the computer is sending data to the keyboard, the keyboard transmits eight cycles of 400 µS each (180 µS low,\n\t\t\t\t\t\t220 µS high) on the Keyboard Clock line. On the falling edge of each keyboard clock cycle, the Macintosh Plus places\n\t\t\t\t\t\ta data bit on the data line and holds it there for 400 µS. The keyboard reads the data bit 80 µS after the rising edge\n\t\t\t\t\t\tof the Keyboard Clock signal.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tconst auto offset = phase_ % 40;\n\t\t\t\t\tclock_output_ = offset >= 18;\n\n\t\t\t\t\tif(offset == 26) {\n\t\t\t\t\t\tcommand_ = (command_ << 1) | (data_input_ ? 1 : 0);\n\t\t\t\t\t}\n\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 8*40) {\n\t\t\t\t\t\tmode_ = Mode::AwaitingEndOfCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t\tclock_output_ = false;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\n\t\t\t\tcase Mode::AwaitingEndOfCommand:\n\t\t\t\t\t\/\/ Time out if the end-of-command seems not to be forthcoming.\n\t\t\t\t\t\/\/ This is an elaboration on my part; a guess.\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 1000) {\n\t\t\t\t\t\tclock_output_ = false;\n\t\t\t\t\t\tmode_ = Mode::Waiting;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\treturn;\n\n\t\t\t\tcase Mode::PerformingCommand: {\n\t\t\t\t\tresponse_ = perform_command(command_);\n\n\t\t\t\t\t\/\/ Inquiry has a 0.25-second timeout; everything else is instant.\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 25000 || command_ != 0x10 || response_ != 0x7b) {\n\t\t\t\t\t\tmode_ = Mode::SendingResponse;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\n\t\t\t\tcase Mode::SendingResponse: {\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"When sending data to the computer, the keyboard transmits eight cycles of 330 µS each (160 µS low, 170 µS high)\n\t\t\t\t\t\ton the normally high Keyboard Clock line. It places a data bit on the data line 40 µS before the falling edge of each\n\t\t\t\t\t\tclock cycle and maintains it for 330 µS. The VIA in the computer latches the data bit into its shift register on the\n\t\t\t\t\t\trising edge of the Keyboard Clock signal.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tconst auto offset = phase_ % 33;\n\t\t\t\t\tclock_output_ = offset >= 16;\n\n\t\t\t\t\tif(offset == 29) {\n\t\t\t\t\t\tresponse_ <<= 1;\n\t\t\t\t\t}\n\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 8*33) {\n\t\t\t\t\t\tclock_output_ = false;\n\t\t\t\t\t\tmode_ = Mode::Waiting;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\t\t\t}\n\t\t}\n\n\t\tvoid enqueue_key_state(uint16_t key, bool is_pressed) {\n\t\t\t\/\/ Front insert; messages will be pop_back'd.\n\t\t\tstd::lock_guard<decltype(key_queue_mutex_)> lock(key_queue_mutex_);\n\n\t\t\t\/\/ Keys on the keypad are preceded by a $79 keycode; in the internal naming scheme\n\t\t\t\/\/ they are indicated by having bit 8 set. So add the $79 prefix if required.\n\t\t\tif(key & 0x100) {\n\t\t\t\tkey_queue_.insert(key_queue_.begin(), 0x79);\n\t\t\t}\n\t\t\tkey_queue_.insert(key_queue_.begin(), (is_pressed ? 0x00 : 0x80) | uint8_t(key));\n\t\t}\n\n\tprivate:\n\n\t\tint perform_command(int command) {\n\t\t\tswitch(command) {\n\t\t\t\tcase 0x10:\t\t\/\/ Inquiry.\n\t\t\t\tcase 0x14: {\t\/\/ Instant.\n\t\t\t\t\tstd::lock_guard<decltype(key_queue_mutex_)> lock(key_queue_mutex_);\n\t\t\t\t\tif(!key_queue_.empty()) {\n\t\t\t\t\t\tconst auto new_message = key_queue_.back();\n\t\t\t\t\t\tkey_queue_.pop_back();\n\t\t\t\t\t\treturn new_message;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\n\t\t\t\tcase 0x16:\t\/\/ Model number.\n\t\t\t\treturn\n\t\t\t\t\t0x01 |\t\t\t\/\/ b0: always 1\n\t\t\t\t\t(1 << 1) |\t\t\/\/ keyboard model number\n\t\t\t\t\t(1 << 4);\t\t\/\/ next device number\n\t\t\t\t\t\t\t\t\t\/\/ (b7 not set => no next device)\n\n\t\t\t\tcase 0x36:\t\/\/ Test\n\t\t\t\treturn 0x7d;\t\t\/\/ 0x7d = ACK, 0x77 = not ACK.\n\t\t\t}\n\t\t\treturn 0x7b;\t\/\/ No key transition.\n\t\t}\n\n\t\tenum class Mode {\n\t\t\tWaiting,\n\t\t\tAcceptingCommand,\n\t\t\tAwaitingEndOfCommand,\n\t\t\tSendingResponse,\n\t\t\tPerformingCommand\n\t\t} mode_ = Mode::Waiting;\n\t\tint phase_ = 0;\n\t\tint command_ = 0;\n\t\tint response_ = 0;\n\n\t\tbool data_input_ = false;\n\t\tbool clock_output_ = false;\n\n\t\t\/\/ TODO: improve this very, very simple implementation.\n\t\tstd::mutex key_queue_mutex_;\n\t\tstd::vector<uint8_t> key_queue_;\n};\n\n\/*!\n\tProvides a mapping from idiomatic PC keys to Macintosh keys.\n*\/\nclass KeyboardMapper: public KeyboardMachine::MappedMachine::KeyboardMapper {\n\tuint16_t mapped_key_for_key(Inputs::Keyboard::Key key) override {\n\t\tusing Key = Inputs::Keyboard::Key;\n\t\tswitch(key) {\n\t\t\tdefault: return KeyboardMachine::MappedMachine::KeyNotMapped;\n\n\t\t\t\/*\n\t\t\t\tSee p284 of the Apple Guide to the Macintosh Family Hardware\n\t\t\t\tfor documentation of the mapping below.\n\t\t\t*\/\n\n\t\t\tcase Key::BackTick:\t\t\t\treturn 0x65;\n\t\t\tcase Key::k1:\t\t\t\t\treturn 0x25;\n\t\t\tcase Key::k2:\t\t\t\t\treturn 0x27;\n\t\t\tcase Key::k3:\t\t\t\t\treturn 0x29;\n\t\t\tcase Key::k4:\t\t\t\t\treturn 0x2b;\n\t\t\tcase Key::k5:\t\t\t\t\treturn 0x2f;\n\t\t\tcase Key::k6:\t\t\t\t\treturn 0x2d;\n\t\t\tcase Key::k7:\t\t\t\t\treturn 0x35;\n\t\t\tcase Key::k8:\t\t\t\t\treturn 0x39;\n\t\t\tcase Key::k9:\t\t\t\t\treturn 0x33;\n\t\t\tcase Key::k0:\t\t\t\t\treturn 0x3b;\n\t\t\tcase Key::Hyphen:\t\t\t\treturn 0x37;\n\t\t\tcase Key::Equals:\t\t\t\treturn 0x31;\n\t\t\tcase Key::BackSpace:\t\t\treturn 0x67;\n\n\t\t\tcase Key::Tab:\t\t\t\t\treturn 0x61;\n\t\t\tcase Key::Q:\t\t\t\t\treturn 0x19;\n\t\t\tcase Key::W:\t\t\t\t\treturn 0x1b;\n\t\t\tcase Key::E:\t\t\t\t\treturn 0x1d;\n\t\t\tcase Key::R:\t\t\t\t\treturn 0x1f;\n\t\t\tcase Key::T:\t\t\t\t\treturn 0x23;\n\t\t\tcase Key::Y:\t\t\t\t\treturn 0x21;\n\t\t\tcase Key::U:\t\t\t\t\treturn 0x41;\n\t\t\tcase Key::I:\t\t\t\t\treturn 0x45;\n\t\t\tcase Key::O:\t\t\t\t\treturn 0x3f;\n\t\t\tcase Key::P:\t\t\t\t\treturn 0x47;\n\t\t\tcase Key::OpenSquareBracket:\treturn 0x43;\n\t\t\tcase Key::CloseSquareBracket:\treturn 0x3d;\n\n\t\t\tcase Key::CapsLock:\t\t\t\treturn 0x73;\n\t\t\tcase Key::A:\t\t\t\t\treturn 0x01;\n\t\t\tcase Key::S:\t\t\t\t\treturn 0x03;\n\t\t\tcase Key::D:\t\t\t\t\treturn 0x05;\n\t\t\tcase Key::F:\t\t\t\t\treturn 0x07;\n\t\t\tcase Key::G:\t\t\t\t\treturn 0x0b;\n\t\t\tcase Key::H:\t\t\t\t\treturn 0x09;\n\t\t\tcase Key::J:\t\t\t\t\treturn 0x4d;\n\t\t\tcase Key::K:\t\t\t\t\treturn 0x51;\n\t\t\tcase Key::L:\t\t\t\t\treturn 0x4b;\n\t\t\tcase Key::Semicolon:\t\t\treturn 0x53;\n\t\t\tcase Key::Quote:\t\t\t\treturn 0x4f;\n\t\t\tcase Key::Enter:\t\t\t\treturn 0x49;\n\n\t\t\tcase Key::LeftShift:\t\t\treturn 0x71;\n\t\t\tcase Key::Z:\t\t\t\t\treturn 0x0d;\n\t\t\tcase Key::X:\t\t\t\t\treturn 0x0f;\n\t\t\tcase Key::C:\t\t\t\t\treturn 0x11;\n\t\t\tcase Key::V:\t\t\t\t\treturn 0x13;\n\t\t\tcase Key::B:\t\t\t\t\treturn 0x17;\n\t\t\tcase Key::N:\t\t\t\t\treturn 0x5b;\n\t\t\tcase Key::M:\t\t\t\t\treturn 0x5d;\n\t\t\tcase Key::Comma:\t\t\t\treturn 0x57;\n\t\t\tcase Key::FullStop:\t\t\t\treturn 0x5f;\n\t\t\tcase Key::ForwardSlash:\t\t\treturn 0x59;\n\t\t\tcase Key::RightShift:\t\t\treturn 0x71;\n\n\t\t\tcase Key::Left:\t\t\t\t\treturn 0x100 | 0x0d;\n\t\t\tcase Key::Right:\t\t\t\treturn 0x100 | 0x05;\n\t\t\tcase Key::Up:\t\t\t\t\treturn 0x100 | 0x1b;\n\t\t\tcase Key::Down:\t\t\t\t\treturn 0x100 | 0x11;\n\n\t\t\tcase Key::LeftOption:\n\t\t\tcase Key::RightOption:\t\t\treturn 0x75;\n\t\t\tcase Key::LeftMeta:\n\t\t\tcase Key::RightMeta:\t\t\treturn 0x6f;\n\n\t\t\tcase Key::Space:\t\t\t\treturn 0x63;\n\t\t\tcase Key::BackSlash:\t\t\treturn 0x55;\n\n\t\t\t\/* TODO: the numeric keypad. *\/\n\t\t}\n\t}\n\n};\n\n}\n}\n\n#endif \/* Apple_Macintosh_Keyboard_hpp *\/\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 <boost\/thread\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/io\/openni_grabber.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/io\/openni_camera\/openni_driver.h>\n\n#define SHOW_FPS 1\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n    static unsigned count = 0;\\\n    static double last = pcl::getTime ();\\\n    if (++count == 100) \\\n    { \\\n      double now = pcl::getTime (); \\\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_) \\\ndo \\\n{ \\\n}while(false)\n#endif\n\ntemplate <typename PointType>\nclass SimpleOpenNIViewer\n{\n  public:\n    typedef pcl::PointCloud<PointType> Cloud;\n    typedef typename Cloud::ConstPtr CloudConstPtr;\n\n\n    SimpleOpenNIViewer (const std::string& device_id = \"\")\n    : viewer (\"PCL OpenNI Viewer\")\n    , device_id_(device_id)\n    {}\n\n    \n    void \n    cloud_cb_ (const CloudConstPtr& cloud)\n    {\n      FPS_CALC(\"callback\");\n      set(cloud);\n    }\n\n    void\n    set(const CloudConstPtr& cloud)\n    {\n      \/\/lock while we set our cloud;\n      boost::mutex::scoped_lock lock(mtx_);\n      cloud_  = cloud;\n    }\n\n    CloudConstPtr\n    get(){\n      \/\/lock while we swap our cloud and reset it.\n      boost::mutex::scoped_lock lock(mtx_);\n      CloudConstPtr temp_cloud;\n      temp_cloud.swap(cloud_);       \/\/here we set cloud_ to null, so that\n                                     \/\/it is safe to set it again from our\n                                     \/\/callback\n      return temp_cloud;\n    }\n\n    void\n    run ()\n    {\n      pcl::Grabber* interface = new pcl::OpenNIGrabber(device_id_);\n\n      boost::function<void (const CloudConstPtr&)> f =\n        boost::bind (&SimpleOpenNIViewer::cloud_cb_, this, _1);\n\n      boost::signals2::connection c = interface->registerCallback (f);\n      \n      interface->start ();\n      \n      while (!viewer.wasStopped ())\n      {\n        if(cloud_)\n        {\n          FPS_CALC(\"drawing\");\n          \/\/the call to get() sets the cloud_ to null;\n          viewer.showCloud ( get() );\n        }\n      }\n\n      interface->stop ();\n    }\n\n    pcl::visualization::CloudViewer viewer;\n    std::string device_id_;\n    boost::mutex mtx_;\n    CloudConstPtr cloud_;\n};\n\nvoid\nusage(char ** argv)\n{\n  std::cout << \"usage: \" << argv[0] << \" <device_id>\\n\";\n\n  openni_wrapper::OpenNIDriver& driver = openni_wrapper::OpenNIDriver::getInstance ();\n  if (driver.getNumberDevices () > 0)\n  {\n    for (unsigned deviceIdx = 0; deviceIdx < driver.getNumberDevices (); ++deviceIdx)\n    {\n      cout << \"Device: \" << deviceIdx + 1 << \", vendor: \" << driver.getVendorName (deviceIdx) << \", product: \" << driver.getProductName (deviceIdx)\n              << \", connected: \" << (int)driver.getBus (deviceIdx) << \" @ \" << (int)driver.getAddress (deviceIdx) << \", serial number: \\'\" << driver.getSerialNumber (deviceIdx) << \"\\'\" << endl;\n      cout << \"device_id may be #1, #2, ... for the first second etc device in the list or\" << endl\n           << \"                 bus@address for the device connected to a specific usb-bus \/ address combination (wotks only in Linux) or\" << endl\n           << \"                 <serial-number> (only in Linux and for devices which provide serial numbers)\"  << endl;\n    }\n  }\n  else\n    cout << \"No devices connected.\" << endl;\n}\n\nint \nmain (int argc, char ** argv)\n{\n  if(argc != 2)\n  {\n    usage(argv);\n    return 1;\n  }\n\n  std::string arg(argv[1]);\n  \n  if( arg == \"--help\" || arg == \"-h\")\n  {\n    usage(argv);\n    return 1;\n  }\n\n  pcl::OpenNIGrabber grabber(arg);\n  if (grabber.providesCallback<pcl::OpenNIGrabber::sig_cb_openni_point_cloud_rgb> ())\n  {\n    SimpleOpenNIViewer<pcl::PointXYZRGB> v(arg);\n    v.run ();\n  }\n  else\n  {\n    SimpleOpenNIViewer<pcl::PointXYZ> v(arg);\n    v.run ();\n  }\n\n  return (0);\n}\n<commit_msg>simple indents<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 <boost\/thread\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/io\/openni_grabber.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/io\/openni_camera\/openni_driver.h>\n\n#define SHOW_FPS 1\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n    static unsigned count = 0;\\\n    static double last = pcl::getTime ();\\\n    if (++count == 100) \\\n    { \\\n      double now = pcl::getTime (); \\\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_) \\\ndo \\\n{ \\\n}while(false)\n#endif\n\ntemplate <typename PointType>\nclass SimpleOpenNIViewer\n{\n  public:\n    typedef pcl::PointCloud<PointType> Cloud;\n    typedef typename Cloud::ConstPtr CloudConstPtr;\n\n    SimpleOpenNIViewer (const std::string& device_id = \"\")\n    : viewer (\"PCL OpenNI Viewer\")\n    , device_id_ (device_id)\n    {}\n\n    \n    void \n    cloud_cb_ (const CloudConstPtr& cloud)\n    {\n      FPS_CALC (\"callback\");\n      set (cloud);\n    }\n\n    void\n    set (const CloudConstPtr& cloud)\n    {\n      \/\/lock while we set our cloud;\n      boost::mutex::scoped_lock lock (mtx_);\n      cloud_  = cloud;\n    }\n\n    CloudConstPtr\n    get ()\n    {\n      \/\/lock while we swap our cloud and reset it.\n      boost::mutex::scoped_lock lock (mtx_);\n      CloudConstPtr temp_cloud;\n      temp_cloud.swap (cloud_);       \/\/here we set cloud_ to null, so that\n                                      \/\/it is safe to set it again from our\n                                      \/\/callback\n      return (temp_cloud);\n    }\n\n    void\n    run ()\n    {\n      pcl::Grabber* interface = new pcl::OpenNIGrabber (device_id_);\n\n      boost::function<void (const CloudConstPtr&)> f = boost::bind (&SimpleOpenNIViewer::cloud_cb_, this, _1);\n\n      boost::signals2::connection c = interface->registerCallback (f);\n      \n      interface->start ();\n      \n      while (!viewer.wasStopped ())\n      {\n        if(cloud_)\n        {\n          FPS_CALC (\"drawing\");\n          \/\/the call to get() sets the cloud_ to null;\n          viewer.showCloud (get ());\n        }\n      }\n\n      interface->stop ();\n    }\n\n    pcl::visualization::CloudViewer viewer;\n    std::string device_id_;\n    boost::mutex mtx_;\n    CloudConstPtr cloud_;\n};\n\nvoid\nusage (char ** argv)\n{\n  std::cout << \"usage: \" << argv[0] << \" <device_id>\\n\";\n\n  openni_wrapper::OpenNIDriver& driver = openni_wrapper::OpenNIDriver::getInstance ();\n  if (driver.getNumberDevices () > 0)\n  {\n    for (unsigned deviceIdx = 0; deviceIdx < driver.getNumberDevices (); ++deviceIdx)\n    {\n      cout << \"Device: \" << deviceIdx + 1 << \", vendor: \" << driver.getVendorName (deviceIdx) << \", product: \" << driver.getProductName (deviceIdx)\n              << \", connected: \" << (int)driver.getBus (deviceIdx) << \" @ \" << (int)driver.getAddress (deviceIdx) << \", serial number: \\'\" << driver.getSerialNumber (deviceIdx) << \"\\'\" << endl;\n      cout << \"device_id may be #1, #2, ... for the first second etc device in the list or\" << endl\n           << \"                 bus@address for the device connected to a specific usb-bus \/ address combination (wotks only in Linux) or\" << endl\n           << \"                 <serial-number> (only in Linux and for devices which provide serial numbers)\"  << endl;\n    }\n  }\n  else\n    cout << \"No devices connected.\" << endl;\n}\n\nint \nmain (int argc, char ** argv)\n{\n  if (argc != 2)\n  {\n    usage (argv);\n    return 1;\n  }\n\n  std::string arg (argv[1]);\n  \n  if (arg == \"--help\" || arg == \"-h\")\n  {\n    usage (argv);\n    return 1;\n  }\n\n  pcl::OpenNIGrabber grabber (arg);\n  if (grabber.providesCallback<pcl::OpenNIGrabber::sig_cb_openni_point_cloud_rgb> ())\n  {\n    SimpleOpenNIViewer<pcl::PointXYZRGB> v (arg);\n    v.run ();\n  }\n  else\n  {\n    SimpleOpenNIViewer<pcl::PointXYZ> v (arg);\n    v.run ();\n  }\n\n  return (0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ TEST my fast i\/o implementation\n\/\/ read and write 10^6 numbers took 120 milliseconds.\n\/\/ My PC: i3 2gb RAM  Centos 7, gcc 4.8.5  c++11 mode.\n\n\n#include <cstdio>\n#include <cstring>\n#include <chrono>\n#include <cstdlib>\n\n\n \nstatic const int N = 1<<20;\/\/10^6\n\n\nint a[N];\nint n;\n\n \nchar in[1<<23];\n\nchar out[1<<23];\n\nstruct scanner\n{\n    char const* o;\n    scanner(): o(in){\n        in[fread(in,1,sizeof(in)-4,stdin)] = 0;\n    }\n    int readInt()\n    { \n        unsigned u = 0, s=  0; \n        while(*o && *o <= 32)++o;\n        if (*o == '-')s = ~0,++o;else if (*o == '+')++o;\n        while(*o >='0' && *o <='9')u = (u << 3) + (u << 1) + (*o++ -'0'); \n        return (u^s) + !!s;\n    }\n    \n};\n\nstruct writer\n{\n    char * w; \n    writer() : w(out){}\n    ~writer(){ flush(); }\n    void writeInt( int u, char c)\n    { \n        if (u < 0){*w++ = '-'; u = -u;}\n        int v = u; \n        int n = 0,m; \n\n        do ++n; while(v\/=10); \n        m = n; \n        while(m-->0)w[m] = u%10 + '0',u\/=10; \n        w+=n;\n        *w++=c;\n    }\n    void flush(){ if (w != out) fwrite(out, 1, w - out, stdout), w  = out;}\n};\n\nstruct auto_cpu_timer\n{\n    typedef std::chrono::high_resolution_clock ct;\n    typedef ct::time_point tp;\n    \n    tp s,e;\n    \n    auto_cpu_timer(){ s = ct::now();}\n    ~auto_cpu_timer(){ e = ct::now(); \n    long int n = std::chrono::duration_cast< std::chrono::milliseconds > ( e - s).count();\n    \n    fprintf(stderr,\"\\nelapsed time: %ld ms.\\n\", n);\n    }\n};\n\nint test()\n{\n    auto_cpu_timer cpu_timer;\n    \n    scanner sc;\n    writer pw;\n    n = sc.readInt();\n    \n    for(int i = 0; i < n; ++i)a[i] = sc.readInt();\n    \n    \/\/sort(a, a + n);\n    \n    for(int i = 0; i < n; ++i)pw.writeInt(a[i], ' ');\n    \n    \n    return 0;\n}\n\n\nvoid writeMillionNumbers()\n{\n    FILE * f = fopen(\"input.txt\", \"w\");\n    if (f != NULL)\n    {\n        n = 1000*1000;\n        fprintf(f, \"%d\\n\", n);\n        srand(time(NULL));\n        for(int i = 0; i < n; ++i)fprintf(f, \"%d \", rand());\n        \n        fclose(f);\n    }\n}\n\nint main()\n{\n#ifndef ONLINE_JUDGE\n\tfreopen(\"input.txt\", \"r\", stdin);\n\tfreopen(\"output.txt\", \"w\", stdout);\n#endif \n        \n        \n        \/\/ uncomment for write 10^6 numbers\n        \n        writeMillionNumbers();\n        \n\ttest();\n\t\n\treturn 0;\n}\n<commit_msg>Update test.cpp<commit_after>\n\/\/ TEST my fast i\/o implementation\n\/\/ read and write 10^6 numbers took 120 milliseconds.\n\/\/ My PC: i3 2gb RAM  Centos 7, gcc 4.8.5  c++11 mode.\n\/\/ UPD:  printf \/ scanf  - took 600 milliseconds.\n\n#include <cstdio>\n#include <cstring>\n#include <chrono>\n#include <cstdlib>\n\n\n \nstatic const int N = 1<<20;\/\/10^6\n\n\nint a[N];\nint n;\n\n \nchar in[1<<23];\n\nchar out[1<<23];\n\nstruct scanner\n{\n    char const* o;\n    scanner(): o(in){\n        in[fread(in,1,sizeof(in)-4,stdin)] = 0;\n    }\n    int readInt()\n    { \n        unsigned u = 0, s=  0; \n        while(*o && *o <= 32)++o;\n        if (*o == '-')s = ~0,++o;else if (*o == '+')++o;\n        while(*o >='0' && *o <='9')u = (u << 3) + (u << 1) + (*o++ -'0'); \n        return (u^s) + !!s;\n    }\n    \n};\n\nstruct writer\n{\n    char * w; \n    writer() : w(out){}\n    ~writer(){ flush(); }\n    void writeInt( int u, char c)\n    { \n        if (u < 0){*w++ = '-'; u = -u;}\n        int v = u; \n        int n = 0,m; \n\n        do ++n; while(v\/=10); \n        m = n; \n        while(m-->0)w[m] = u%10 + '0',u\/=10; \n        w+=n;\n        *w++=c;\n    }\n    void flush(){ if (w != out) fwrite(out, 1, w - out, stdout), w  = out;}\n};\n\nstruct auto_cpu_timer\n{\n    typedef std::chrono::high_resolution_clock ct;\n    typedef ct::time_point tp;\n    \n    tp s,e;\n    \n    auto_cpu_timer(){ s = ct::now();}\n    ~auto_cpu_timer(){ e = ct::now(); \n    long int n = std::chrono::duration_cast< std::chrono::milliseconds > ( e - s).count();\n    \n    fprintf(stderr,\"\\nelapsed time: %ld ms.\\n\", n);\n    }\n};\n\nint test()\n{\n    auto_cpu_timer cpu_timer;\n    \n    scanner sc;\n    writer pw;\n    n = sc.readInt();\n    \n    for(int i = 0; i < n; ++i)a[i] = sc.readInt();\n    \n    \/\/sort(a, a + n);\n    \n    for(int i = 0; i < n; ++i)pw.writeInt(a[i], ' ');\n    \n    \n    return 0;\n}\n\nint test_c_i_o()\n{\n    auto_cpu_timer cpu_timer;\n    \n    scanf(\"%d\",&n);\n    for(int i = 0; i < n; ++i)scanf(\"%d\",a+i); \/\/.a[i] = sc.readInt();\n    \n    \/\/sort(a, a + n);\n    \n    for(int i = 0; i < n; ++i) printf(\"%d \", a[i]);\/\/pw.writeInt(a[i], ' ');\n    \n    \n    return 0;\n}\n\n\nvoid writeMillionNumbers()\n{\n    FILE * f = fopen(\"input.txt\", \"w\");\n    if (f != NULL)\n    {\n        n = 1000*1000;\n        fprintf(f, \"%d\\n\", n);\n        srand(time(NULL));\n        for(int i = 0; i < n; ++i)fprintf(f, \"%d \", rand());\n        \n        fclose(f);\n    }\n}\n\nint main()\n{\n#ifndef ONLINE_JUDGE\n\tfreopen(\"input.txt\", \"r\", stdin);\n\tfreopen(\"output.txt\", \"w\", stdout);\n#endif \n        \n        \n        \/\/ uncomment for write 10^6 numbers\n        \n        writeMillionNumbers();\n        \n\ttest();\n\t\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>21588978-2f67-11e5-af4f-6c40088e03e4<commit_msg>215f3c48-2f67-11e5-9457-6c40088e03e4<commit_after>215f3c48-2f67-11e5-9457-6c40088e03e4<|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 *         Radu Bogdan Rusu (rusu@willowgarage.com)\n *         Suat Gedikli (gedikli@willowgarage.com)\n *         Ethan Rublee (rublee@willowgarage.com)\n *\/\n\n#include <boost\/thread\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/io\/openni_grabber.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/io\/openni_camera\/openni_driver.h>\n#include <vector>\n\n#define SHOW_FPS 1\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n    static unsigned count = 0;\\\n    static double last = pcl::getTime ();\\\n    if (++count == 100) \\\n    { \\\n      double now = pcl::getTime (); \\\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_) \\\ndo \\\n{ \\\n}while(false)\n#endif\n\ntemplate <typename PointType>\nclass SimpleOpenNIViewer\n{\npublic:\n  typedef pcl::PointCloud<PointType> Cloud;\n  typedef typename Cloud::ConstPtr CloudConstPtr;\n\n  SimpleOpenNIViewer(pcl::OpenNIGrabber& grabber)\n    : viewer(\"PCL OpenNI Viewer\")\n    , grabber_(grabber)\n  {\n  }\n\n  void\n  cloud_cb_ (const CloudConstPtr& cloud)\n  {\n    FPS_CALC (\"callback\");\n    set (cloud);\n  }\n\n  void\n  set (const CloudConstPtr& cloud)\n  {\n    \/\/lock while we set our cloud;\n    boost::mutex::scoped_lock lock (mtx_);\n    cloud_ = cloud;\n  }\n\n  CloudConstPtr\n  get ()\n  {\n    \/\/lock while we swap our cloud and reset it.\n    boost::mutex::scoped_lock lock(mtx_);\n    CloudConstPtr temp_cloud;\n    temp_cloud.swap (cloud_); \/\/here we set cloud_ to null, so that\n    \/\/it is safe to set it again from our\n    \/\/callback\n    return (temp_cloud);\n  }\n\n  void\n  run()\n  {\n    \/\/pcl::Grabber* interface = new pcl::OpenNIGrabber(device_id_, pcl::OpenNIGrabber::OpenNI_QQVGA_30Hz, pcl::OpenNIGrabber::OpenNI_VGA_30Hz);\n\n    boost::function<void (const CloudConstPtr&) > f = boost::bind (&SimpleOpenNIViewer::cloud_cb_, this, _1);\n\n    boost::signals2::connection c = grabber_.registerCallback (f);\n\n    grabber_.start();\n\n    while (!viewer.wasStopped ())\n    {\n      if (cloud_)\n      {\n        FPS_CALC (\"drawing\");\n        \/\/the call to get() sets the cloud_ to null;\n        viewer.showCloud (get ());\n      }\n    }\n\n    grabber_.stop();\n  }\n\n  pcl::visualization::CloudViewer viewer;\n  pcl::OpenNIGrabber& grabber_;\n  boost::mutex mtx_;\n  CloudConstPtr cloud_;\n};\n\nvoid\nusage(char ** argv)\n{\n  cout << \"usage: \" << argv[0] << \" [<device_id> [<depth-mode> [<image-mode>] ] ]\\n\";\n  cout << argv[0] << \" -h | --help : shows this help\" << endl;\n  cout << argv[0] << \" -l : list all available devices\" << endl;\n  cout << argv[0] << \" -l <device-id> : list all available modes for specified device\" << endl;\n\n  cout << \"                 device_id may be #1, #2, ... for the first, second etc device in the list\"\n#ifndef _WIN32\n       << \" or\" << endl\n       << \"                 bus@address for the device connected to a specific usb-bus \/ address combination or\" << endl\n       << \"                 <serial-number>\"\n#endif\n       << endl;\n  cout << endl;\n  cout << \"examples:\" << endl;\n  cout << argv[0] << \" \\\"#1\\\"\" << endl;\n  cout << \"    uses the first device.\" << endl;\n  cout << argv[0] << \" -l\" << endl;\n  cout << \"    lists all available devices.\" << endl;\n  cout << argv[0] << \" -l \\\"#2\\\"\" << endl;\n  cout << \"    lists all available modes for the second device\" << endl;\n  #ifndef _WIN32\n  cout << argv[0] << \" A00361800903049A\" << endl;\n  cout << \"    uses the device with the serial number \\'A00361800903049A\\'.\" << endl;\n  cout << argv[0] << \" 1@16\" << endl;\n  cout << \"    uses the device on address 16 at usb bus 1.\" << endl;\n  #endif\n  return;\n}\n\nint\nmain(int argc, char ** argv)\n{\n  std::string arg(\"\");\n  pcl::OpenNIGrabber::Mode depth_mode = pcl::OpenNIGrabber::OpenNI_Default_Mode;\n  pcl::OpenNIGrabber::Mode image_mode = pcl::OpenNIGrabber::OpenNI_Default_Mode;\n\n  if (argc >= 2)\n  {\n    arg = argv[1];\n\n    if (arg == \"--help\" || arg == \"-h\")\n    {\n      usage(argv);\n      return 1;\n    }\n    else if (arg == \"-l\")\n    {\n      if (argc >= 3)\n      {\n        pcl::OpenNIGrabber grabber(argv[2]);\n        const openni_wrapper::OpenNIDevice& device = grabber.getDevice();\n        cout << \"Supported depth modes for device: \" << device.getVendorName() << \" , \" << device.getProductName() << endl;\n        std::vector<std::pair<int, XnMapOutputMode > > modes = grabber.getAvailableDepthModes();\n        for (std::vector<std::pair<int, XnMapOutputMode > >::const_iterator it = modes.begin(); it != modes.end(); ++it)\n        {\n          cout << it->first << \" = \" << it->second.nXRes << \" x \" << it->second.nYRes << \" @ \" << it->second.nFPS << endl;\n        }\n\n        cout << endl << \"Supported image modes for device: \" << device.getVendorName() << \" , \" << device.getProductName() << endl;\n        modes = grabber.getAvailableImageModes();\n        for (std::vector<std::pair<int, XnMapOutputMode > >::const_iterator it = modes.begin(); it != modes.end(); ++it)\n        {\n          cout << it->first << \" = \" << it->second.nXRes << \" x \" << it->second.nYRes << \" @ \" << it->second.nFPS << endl;\n        }\n        return 0;\n      }\n      else\n      {\n        openni_wrapper::OpenNIDriver& driver = openni_wrapper::OpenNIDriver::getInstance();\n        if (driver.getNumberDevices() > 0)\n        {\n          for (unsigned deviceIdx = 0; deviceIdx < driver.getNumberDevices(); ++deviceIdx)\n          {\n            cout << \"Device: \" << deviceIdx + 1 << \", vendor: \" << driver.getVendorName(deviceIdx) << \", product: \" << driver.getProductName(deviceIdx)\n              << \", connected: \" << (int) driver.getBus(deviceIdx) << \" @ \" << (int) driver.getAddress(deviceIdx) << \", serial number: \\'\" << driver.getSerialNumber(deviceIdx) << \"\\'\" << endl;\n          }\n\n        }\n        else\n          cout << \"No devices connected.\" << endl;\n        return 0;\n      }\n    }\n\n    if (argc >= 3)\n    {\n      depth_mode = (pcl::OpenNIGrabber::Mode) atoi(argv[2]);\n      if (argc == 4)\n      {\n        image_mode = (pcl::OpenNIGrabber::Mode) atoi(argv[3]);\n      }\n    }\n  }\n  else\n  {\n    openni_wrapper::OpenNIDriver& driver = openni_wrapper::OpenNIDriver::getInstance();\n    if (driver.getNumberDevices() > 0)\n      cout << \"Device Id not set, using first device.\" << endl;\n  }\n\n  pcl::OpenNIGrabber grabber(arg, depth_mode, image_mode);\n  if (grabber.providesCallback<pcl::OpenNIGrabber::sig_cb_openni_point_cloud_rgb > ())\n  {\n    SimpleOpenNIViewer<pcl::PointXYZRGB> v(grabber);\n    v.run();\n  }\n  else\n  {\n    SimpleOpenNIViewer<pcl::PointXYZI> v(grabber);\n    v.run();\n  }\n\n  return (0);\n}\n<commit_msg>added support for ONI playback<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 *         Radu Bogdan Rusu (rusu@willowgarage.com)\n *         Suat Gedikli (gedikli@willowgarage.com)\n *         Ethan Rublee (rublee@willowgarage.com)\n *\/\n\n#include <boost\/thread\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/io\/openni_grabber.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/io\/openni_camera\/openni_driver.h>\n#include <vector>\n\n#define SHOW_FPS 1\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n    static unsigned count = 0;\\\n    static double last = pcl::getTime ();\\\n    if (++count == 100) \\\n    { \\\n      double now = pcl::getTime (); \\\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_) \\\ndo \\\n{ \\\n}while(false)\n#endif\n\ntemplate <typename PointType>\nclass SimpleOpenNIViewer\n{\npublic:\n  typedef pcl::PointCloud<PointType> Cloud;\n  typedef typename Cloud::ConstPtr CloudConstPtr;\n\n  SimpleOpenNIViewer(pcl::OpenNIGrabber& grabber)\n    : viewer(\"PCL OpenNI Viewer\")\n    , grabber_(grabber)\n  {\n  }\n\n  \/**\n   * @brief Callback method for the grabber interface\n   * @param cloud The new point cloud from Grabber\n   *\/\n  void\n  cloud_cb_ (const CloudConstPtr& cloud)\n  {\n    FPS_CALC (\"callback\");\n    boost::mutex::scoped_lock lock (mtx_);\n    cloud_ = cloud;\n  }\n\n  \/**\n   * @brief swaps the pointer to the point cloud with Null pointer and returns the cloud pointer\n   * @return boost shared pointer to point cloud\n   *\/\n  CloudConstPtr\n  getLatestCloud ()\n  {\n    \/\/lock while we swap our cloud and reset it.\n    boost::mutex::scoped_lock lock(mtx_);\n    CloudConstPtr temp_cloud;\n    temp_cloud.swap (cloud_); \/\/here we set cloud_ to null, so that\n    \/\/it is safe to set it again from our\n    \/\/callback\n    return (temp_cloud);\n  }\n\n  \/**\n   * @brief starts the main loop\n   *\/\n  void\n  run()\n  {\n    \/\/pcl::Grabber* interface = new pcl::OpenNIGrabber(device_id_, pcl::OpenNIGrabber::OpenNI_QQVGA_30Hz, pcl::OpenNIGrabber::OpenNI_VGA_30Hz);\n\n    boost::function<void (const CloudConstPtr&) > f = boost::bind (&SimpleOpenNIViewer::cloud_cb_, this, _1);\n\n    boost::signals2::connection c = grabber_.registerCallback (f);\n\n    grabber_.start();\n\n    while (!viewer.wasStopped ())\n    {\n      if (cloud_)\n      {\n        FPS_CALC (\"drawing\");\n        \/\/the call to get() sets the cloud_ to null;\n        viewer.showCloud (getLatestCloud ());\n      }\n    }\n\n    grabber_.stop();\n  }\n\n  pcl::visualization::CloudViewer viewer;\n  pcl::OpenNIGrabber& grabber_;\n  boost::mutex mtx_;\n  CloudConstPtr cloud_;\n};\n\nvoid\nusage(char ** argv)\n{\n  cout << \"usage: \" << argv[0] << \" [<device_id> [<depth-mode> [<image-mode>] ] ] | [path-to-oni-file]\\n\";\n  cout << argv[0] << \" -h | --help : shows this help\" << endl;\n  cout << argv[0] << \" -l : list all available devices\" << endl;\n  cout << argv[0] << \" -l <device-id> : list all available modes for specified device\" << endl;\n\n  cout << \"                 device_id may be #1, #2, ... for the first, second etc device in the list\"\n#ifndef _WIN32\n       << \" or\" << endl\n       << \"                 bus@address for the device connected to a specific usb-bus \/ address combination or\" << endl\n       << \"                 <serial-number>\"\n#endif\n       << endl;\n  cout << endl;\n  cout << \"examples:\" << endl;\n  cout << argv[0] << \" \\\"#1\\\"\" << endl;\n  cout << \"    uses the first device.\" << endl;\n  cout << argv[0] << \" \\\".\/temp\/test.oni\\\"\" << endl;\n  cout << \"    uses the oni-player device to play back oni file given by path.\" << endl;\n  cout << argv[0] << \" -l\" << endl;\n  cout << \"    lists all available devices.\" << endl;\n  cout << argv[0] << \" -l \\\"#2\\\"\" << endl;\n  cout << \"    lists all available modes for the second device\" << endl;\n  #ifndef _WIN32\n  cout << argv[0] << \" A00361800903049A\" << endl;\n  cout << \"    uses the device with the serial number \\'A00361800903049A\\'.\" << endl;\n  cout << argv[0] << \" 1@16\" << endl;\n  cout << \"    uses the device on address 16 at usb bus 1.\" << endl;\n  #endif\n  return;\n}\n\nint\nmain(int argc, char ** argv)\n{\n  std::string arg(\"\");\n  pcl::OpenNIGrabber::Mode depth_mode = pcl::OpenNIGrabber::OpenNI_Default_Mode;\n  pcl::OpenNIGrabber::Mode image_mode = pcl::OpenNIGrabber::OpenNI_Default_Mode;\n\n  if (argc >= 2)\n  {\n    arg = argv[1];\n\n    if (arg == \"--help\" || arg == \"-h\")\n    {\n      usage(argv);\n      return 1;\n    }\n    else if (arg == \"-l\")\n    {\n      if (argc >= 3)\n      {\n        pcl::OpenNIGrabber grabber(argv[2]);\n        const openni_wrapper::OpenNIDevice& device = grabber.getDevice();\n        cout << \"Supported depth modes for device: \" << device.getVendorName() << \" , \" << device.getProductName() << endl;\n        std::vector<std::pair<int, XnMapOutputMode > > modes = grabber.getAvailableDepthModes();\n        for (std::vector<std::pair<int, XnMapOutputMode > >::const_iterator it = modes.begin(); it != modes.end(); ++it)\n        {\n          cout << it->first << \" = \" << it->second.nXRes << \" x \" << it->second.nYRes << \" @ \" << it->second.nFPS << endl;\n        }\n\n        cout << endl << \"Supported image modes for device: \" << device.getVendorName() << \" , \" << device.getProductName() << endl;\n        modes = grabber.getAvailableImageModes();\n        for (std::vector<std::pair<int, XnMapOutputMode > >::const_iterator it = modes.begin(); it != modes.end(); ++it)\n        {\n          cout << it->first << \" = \" << it->second.nXRes << \" x \" << it->second.nYRes << \" @ \" << it->second.nFPS << endl;\n        }\n        return 0;\n      }\n      else\n      {\n        openni_wrapper::OpenNIDriver& driver = openni_wrapper::OpenNIDriver::getInstance();\n        if (driver.getNumberDevices() > 0)\n        {\n          for (unsigned deviceIdx = 0; deviceIdx < driver.getNumberDevices(); ++deviceIdx)\n          {\n            cout << \"Device: \" << deviceIdx + 1 << \", vendor: \" << driver.getVendorName(deviceIdx) << \", product: \" << driver.getProductName(deviceIdx)\n              << \", connected: \" << (int) driver.getBus(deviceIdx) << \" @ \" << (int) driver.getAddress(deviceIdx) << \", serial number: \\'\" << driver.getSerialNumber(deviceIdx) << \"\\'\" << endl;\n          }\n\n        }\n        else\n          cout << \"No devices connected.\" << endl;\n        \n        cout <<\"Virtual Devices available: ONI player\" << endl;\n        return 0;\n      }\n    }\n\n    if (argc >= 3)\n    {\n      depth_mode = (pcl::OpenNIGrabber::Mode) atoi(argv[2]);\n      if (argc == 4)\n      {\n        image_mode = (pcl::OpenNIGrabber::Mode) atoi(argv[3]);\n      }\n    }\n  }\n  else\n  {\n    openni_wrapper::OpenNIDriver& driver = openni_wrapper::OpenNIDriver::getInstance();\n    if (driver.getNumberDevices() > 0)\n      cout << \"Device Id not set, using first device.\" << endl;\n  }\n\n  pcl::OpenNIGrabber grabber(arg, depth_mode, image_mode);\n  if (grabber.providesCallback<pcl::OpenNIGrabber::sig_cb_openni_point_cloud_rgb > ())\n  {\n    SimpleOpenNIViewer<pcl::PointXYZRGB> v(grabber);\n    v.run();\n  }\n  else\n  {\n    SimpleOpenNIViewer<pcl::PointXYZI> v(grabber);\n    v.run();\n  }\n\n  return (0);\n}\n<|endoftext|>"}
{"text":"<commit_before>e10a2747-2e4e-11e5-905d-28cfe91dbc4b<commit_msg>e1115611-2e4e-11e5-8a9b-28cfe91dbc4b<commit_after>e1115611-2e4e-11e5-8a9b-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#define CATCH_CONFIG_MAIN  \/\/ This tells Catch to provide a main() - only do this in one cpp file\n#include \"catch.hpp\"\n\n#include \"named_type.hpp\"\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <unordered_map>\n\n\/\/ Usage examples\n\ntemplate<typename T>\ndecltype(auto) tee(T&& value)\n{\n    std::cout << value << '\\n';\n    return std::forward<T>(value);\n}\n\nusing Meter = fluent::NamedType<double, struct MeterParameter, fluent::Addable, fluent::Comparable>;\nMeter operator\"\" _meter(unsigned long long value) { return Meter(value); }\n\/\/Meter operator\"\" _meter(long double value) { return Meter(value); }\n\nusing Width = fluent::NamedType<Meter, struct WidthParameter>;\nusing Height = fluent::NamedType<Meter, struct HeightParameter>;\n\nclass Rectangle\n{\npublic:\n    Rectangle(Width width, Height height) : width_(width.get()), height_(height.get()) {}\n    Meter getWidth() const { return width_; }\n    Meter getHeight() const { return height_; }\n\nprivate:\n    Meter width_;\n    Meter height_;\n};\n\nTEST_CASE(\"Basic usage\")\n{\n    Rectangle r(Width(10_meter), Height(12_meter));\n    REQUIRE(r.getWidth().get() == 10);\n    REQUIRE(r.getHeight().get() == 12);\n}\n\nusing NameRef = fluent::NamedType<std::string&, struct NameRefParameter>;\n\nvoid changeValue(const NameRef name)\n{\n    name.get() = \"value2\";\n}\n\nTEST_CASE(\"Passing a strong reference\")\n{\n    std::string value = \"value1\";\n    changeValue(NameRef(value));\n    REQUIRE(value == \"value2\");\n}\n\nTEST_CASE(\"Construction of NamedType::ref from the underlying type\")\n{\n    using StrongInt = fluent::NamedType<int, struct StrongIntTag>;\n    auto addOne = [](StrongInt::ref si) { ++(si.get()); };\n\n    int i = 42;\n    addOne(StrongInt::ref(i));\n    REQUIRE(i == 43);\n}\n\nTEST_CASE(\"Implicit conversion of NamedType to NamedType::ref\")\n{\n    using StrongInt = fluent::NamedType<int, struct StrongIntTag>;\n    auto addOne = [](StrongInt::ref si) { ++(si.get()); };\n\n    StrongInt i(42);\n    addOne(i);\n    REQUIRE(i.get() == 43);\n\n    StrongInt j(42);\n    addOne(StrongInt::ref(j));\n    REQUIRE(j.get() == 43);\n}\n\ntemplate<typename Function>\nusing Comparator = fluent::NamedType<Function, struct ComparatorParameter>;\n\ntemplate <typename Function>\nstd::string performAction(Comparator<Function> comp)\n{\n    return comp.get()();\n}\n\nTEST_CASE(\"Strong generic type\")\n{\n    REQUIRE(performAction(fluent::make_named<Comparator>([](){ return std::string(\"compare\"); })) == \"compare\");\n}\n\nTEST_CASE(\"Addable\")\n{\n    using AddableType = fluent::NamedType<int, struct AddableTag, fluent::Addable>;\n    AddableType s1(12);\n    AddableType s2(10);\n    REQUIRE((s1 + s2).get() == 22);\n}\n\nTEST_CASE(\"Subtractable\")\n{\n    using SubtractableType = fluent::NamedType<int, struct SubtractableTag, fluent::Subtractable>;\n    SubtractableType s1(12);\n    SubtractableType s2(10);\n    REQUIRE((s1 - s2).get() == 2);\n    s1 -= s2;\n    REQUIRE(s1.get() == 2);\n}\n\nTEST_CASE(\"Multiplicable\")\n{\n    using MultiplicableType = fluent::NamedType<int, struct MultiplicableTag, fluent::Multiplicable>;\n    MultiplicableType s1(12);\n    MultiplicableType s2(10);\n    REQUIRE((s1 * s2).get() == 120);\n    s1 *= s2;\n    REQUIRE(s1.get() == 120);\n}\n\nTEST_CASE(\"Divisible\")\n{\n    using DivisibleType = fluent::NamedType<int, struct DivisibleTag, fluent::Divisible>;\n    DivisibleType s1(120);\n    DivisibleType s2(10);\n    REQUIRE((s1 \/ s2).get() == 12);\n    s1 \/= s2;\n    REQUIRE(s1.get() == 12);\n}\n\nTEST_CASE(\"Negatable\")\n{\n  using NegatableType = fluent::NamedType<int, struct NegatableTag, fluent::Negatable>;\n  NegatableType value(10);\n  REQUIRE((-value).get() == -10);\n}\n\nTEST_CASE(\"Modulable\")\n{\n    using ModulableType = fluent::NamedType<int, struct ModulableTag, fluent::Modulable>;\n    ModulableType s1(5);\n    ModulableType s2(2);\n    CHECK((s1 % s2).get() == 1);\n    s1 %= s2;\n    CHECK(s1.get() == 1);\n}\n\nTEST_CASE(\"BitWiseInvertable\")\n{\n    using BitWiseInvertableType = fluent::NamedType<int, struct BitWiseInvertableTag, fluent::BitWiseInvertable>;\n    BitWiseInvertableType s1(13);\n    CHECK((~s1).get() == (~13));\n}\n\nTEST_CASE(\"Comparable\")\n{\n    REQUIRE((10_meter == 10_meter));\n    REQUIRE(!(10_meter == 11_meter));\n    REQUIRE((10_meter != 11_meter));\n    REQUIRE(!(10_meter != 10_meter));\n    REQUIRE((10_meter <  11_meter));\n    REQUIRE(!(10_meter <  10_meter));\n    REQUIRE((10_meter <= 10_meter));\n    REQUIRE((10_meter <= 11_meter));\n    REQUIRE(!(10_meter <= 9_meter));\n    REQUIRE((11_meter >  10_meter));\n    REQUIRE(!(10_meter > 11_meter));\n    REQUIRE((11_meter >= 10_meter));\n    REQUIRE((10_meter >= 10_meter));\n    REQUIRE(!(9_meter >= 10_meter));\n}\n\nTEST_CASE(\"ConvertibleWithOperator\")\n{\n    struct B\n    {\n        B(int x) : x(x) {}\n        int x;\n    };\n\n    struct A\n    {\n        A(int x) : x(x) {}\n        operator B () const { return B(x);}\n        int x;\n    };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::ImplicitlyConvertibleTo<B>::templ>;\n    StrongA strongA(A(42));\n    B b = strongA;\n    REQUIRE(b.x == 42);\n}\n\nTEST_CASE(\"ConvertibleWithConstructor\")\n{\n    struct A\n    {\n        A(int x) : x(x) {}\n        int x;\n    };\n\n    struct B\n    {\n        B(A a) : x(a.x) {}\n        int x;\n    };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::ImplicitlyConvertibleTo<B>::templ>;\n    StrongA strongA(A(42));\n    B b = strongA;\n    REQUIRE(b.x == 42);\n}\n\nTEST_CASE(\"ConvertibleToItself\")\n{\n    using MyInt = fluent::NamedType<int, struct MyIntTag, fluent::ImplicitlyConvertibleTo<int>::templ>;\n    MyInt myInt(42);\n    int i = myInt;\n    REQUIRE(i == 42);\n}\n\nTEST_CASE(\"Hash\")\n{\n    using SerialNumber = fluent::NamedType<std::string, struct SerialNumberTag, fluent::Comparable, fluent::Hashable>;\n\n    std::unordered_map<SerialNumber, int> hashMap = { {SerialNumber{\"AA11\"}, 10}, {SerialNumber{\"BB22\"}, 20} };\n    SerialNumber cc33{\"CC33\"};\n    hashMap[cc33] = 30;\n    REQUIRE(hashMap[SerialNumber{\"AA11\"}] == 10);\n    REQUIRE(hashMap[SerialNumber{\"BB22\"}] == 20);\n    REQUIRE(hashMap[cc33] == 30);\n}\n\nstruct testFunctionCallable_A\n{\n    testFunctionCallable_A(int x) : x(x) {}\n    testFunctionCallable_A(testFunctionCallable_A const&) = delete; \/\/ ensures that passing the argument to a function doesn't make a copy\n    testFunctionCallable_A(testFunctionCallable_A&&) = default;\n    testFunctionCallable_A& operator+=(testFunctionCallable_A const& other) { x += other.x; return *this; }\n    int x;\n};\n\ntestFunctionCallable_A operator+(testFunctionCallable_A const& a1, testFunctionCallable_A const& a2)\n{\n    return testFunctionCallable_A(a1.x + a2.x);\n}\n\nbool operator==(testFunctionCallable_A const& a1, testFunctionCallable_A const& a2)\n{\n    return a1.x == a2.x;\n}\n\nTEST_CASE(\"Function callable\")\n{\n    using A = testFunctionCallable_A;\n    auto functionTakingA = [](A const& a){ return a.x; };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::FunctionCallable>;\n    StrongA strongA(A(42));\n    const StrongA constStrongA(A(42));\n    REQUIRE(functionTakingA(strongA) == 42);\n    REQUIRE(functionTakingA(constStrongA) == 42);\n    REQUIRE(strongA + strongA == 84);\n}\n\nTEST_CASE(\"Method callable\")\n{\n    class A\n    {\n    public:\n        A(int x) : x(x) {}\n        A(A const&) = delete; \/\/ ensures that invoking a method doesn't make a copy\n        A(A&&) = default;\n\n        int method(){ return x; }\n        int constMethod() const{ return x; }\n    private:\n        int x;\n    };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::MethodCallable>;\n    StrongA strongA(A(42));\n    const StrongA constStrongA(A((42)));\n    REQUIRE(strongA->method() == 42);\n    REQUIRE(constStrongA->constMethod() == 42);\n}\n\nTEST_CASE(\"Callable\")\n{\n    class A\n    {\n    public:\n        A(int x) : x(x) {}\n        A(A const&) = delete; \/\/ ensures that invoking a method or function doesn't make a copy\n        A(A&&) = default;\n\n        int method(){ return x; }\n        int constMethod() const{ return x; }\n    private:\n        int x;\n    };\n\n    auto functionTakingA = [](A const& a){ return a.constMethod(); };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::Callable>;\n    StrongA strongA(A(42));\n    const StrongA constStrongA(A((42)));\n    REQUIRE(functionTakingA(strongA) == 42);\n    REQUIRE(strongA->method() == 42);\n    REQUIRE(constStrongA->constMethod() == 42);\n}\n\nTEST_CASE(\"Named arguments\")\n{\n    using FirstName = fluent::NamedType<std::string, struct FirstNameTag>;\n    using LastName = fluent::NamedType<std::string, struct LastNameTag>;\n    static const FirstName::argument firstName;\n    static const LastName::argument lastName;\n    auto getFullName = [](FirstName const& firstName, LastName const& lastName)\n    {\n        return firstName.get() + lastName.get();\n    };\n\n    auto fullName = getFullName(firstName = \"James\", lastName = \"Bond\");\n    REQUIRE(fullName == \"JamesBond\");\n}\n\nTEST_CASE(\"Empty base class optimization\")\n{\n    REQUIRE(sizeof(Meter) == sizeof(double));\n}\n\nusing strong_int = fluent::NamedType<int, struct IntTag>;\n\nTEST_CASE(\"Default constructible\")\n{\n    strong_int i1;\n    strong_int i2{};\n}\n\nTEST_CASE(\"constexpr\")\n{\n    using strong_bool = fluent::NamedType<bool, struct BoolTag>;\n\n    static_assert(strong_bool{ true }.get(), \"NamedType is not constexpr\");\n}\n\nstruct throw_on_construction\n{\n    throw_on_construction() { throw 42; }\n\n    throw_on_construction(int) { throw \"exception\"; }\n};\n\nusing C = fluent::NamedType<throw_on_construction, struct throwTag>;\n\nTEST_CASE(\"noexcept\")\n{\n    CHECK(noexcept(strong_int{}));\n    CHECK(!noexcept(C{}));\n\n    CHECK(noexcept(strong_int(3)));\n    CHECK(!noexcept(C{5}));\n}\n\nTEST_CASE(\"Arithmetic\")\n{\n    using strong_arithmetic = fluent::NamedType<int, struct ArithmeticTag, fluent::Arithmetic>;\n    strong_arithmetic a{ 1 };\n    strong_arithmetic b{ 2 };\n\n    CHECK((a + b).get() == 3);\n\n    a += b;\n    CHECK(a.get() == 3);\n\n    CHECK((a - b).get() == 1);\n\n    a -= b;\n    CHECK(a.get() == 1);\n\n    a.get() = 5;\n    CHECK((a * b).get() == 10);\n\n    a *= b;\n    CHECK(a.get() == 10);\n\n    CHECK((a \/ b).get() == 5);\n\n    a \/= b;\n    CHECK(a.get() == 5);\n}\n<commit_msg>Added test for BitWiseAndable<commit_after>#define CATCH_CONFIG_MAIN  \/\/ This tells Catch to provide a main() - only do this in one cpp file\n#include \"catch.hpp\"\n\n#include \"named_type.hpp\"\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <unordered_map>\n\n\/\/ Usage examples\n\ntemplate<typename T>\ndecltype(auto) tee(T&& value)\n{\n    std::cout << value << '\\n';\n    return std::forward<T>(value);\n}\n\nusing Meter = fluent::NamedType<double, struct MeterParameter, fluent::Addable, fluent::Comparable>;\nMeter operator\"\" _meter(unsigned long long value) { return Meter(value); }\n\/\/Meter operator\"\" _meter(long double value) { return Meter(value); }\n\nusing Width = fluent::NamedType<Meter, struct WidthParameter>;\nusing Height = fluent::NamedType<Meter, struct HeightParameter>;\n\nclass Rectangle\n{\npublic:\n    Rectangle(Width width, Height height) : width_(width.get()), height_(height.get()) {}\n    Meter getWidth() const { return width_; }\n    Meter getHeight() const { return height_; }\n\nprivate:\n    Meter width_;\n    Meter height_;\n};\n\nTEST_CASE(\"Basic usage\")\n{\n    Rectangle r(Width(10_meter), Height(12_meter));\n    REQUIRE(r.getWidth().get() == 10);\n    REQUIRE(r.getHeight().get() == 12);\n}\n\nusing NameRef = fluent::NamedType<std::string&, struct NameRefParameter>;\n\nvoid changeValue(const NameRef name)\n{\n    name.get() = \"value2\";\n}\n\nTEST_CASE(\"Passing a strong reference\")\n{\n    std::string value = \"value1\";\n    changeValue(NameRef(value));\n    REQUIRE(value == \"value2\");\n}\n\nTEST_CASE(\"Construction of NamedType::ref from the underlying type\")\n{\n    using StrongInt = fluent::NamedType<int, struct StrongIntTag>;\n    auto addOne = [](StrongInt::ref si) { ++(si.get()); };\n\n    int i = 42;\n    addOne(StrongInt::ref(i));\n    REQUIRE(i == 43);\n}\n\nTEST_CASE(\"Implicit conversion of NamedType to NamedType::ref\")\n{\n    using StrongInt = fluent::NamedType<int, struct StrongIntTag>;\n    auto addOne = [](StrongInt::ref si) { ++(si.get()); };\n\n    StrongInt i(42);\n    addOne(i);\n    REQUIRE(i.get() == 43);\n\n    StrongInt j(42);\n    addOne(StrongInt::ref(j));\n    REQUIRE(j.get() == 43);\n}\n\ntemplate<typename Function>\nusing Comparator = fluent::NamedType<Function, struct ComparatorParameter>;\n\ntemplate <typename Function>\nstd::string performAction(Comparator<Function> comp)\n{\n    return comp.get()();\n}\n\nTEST_CASE(\"Strong generic type\")\n{\n    REQUIRE(performAction(fluent::make_named<Comparator>([](){ return std::string(\"compare\"); })) == \"compare\");\n}\n\nTEST_CASE(\"Addable\")\n{\n    using AddableType = fluent::NamedType<int, struct AddableTag, fluent::Addable>;\n    AddableType s1(12);\n    AddableType s2(10);\n    REQUIRE((s1 + s2).get() == 22);\n}\n\nTEST_CASE(\"Subtractable\")\n{\n    using SubtractableType = fluent::NamedType<int, struct SubtractableTag, fluent::Subtractable>;\n    SubtractableType s1(12);\n    SubtractableType s2(10);\n    REQUIRE((s1 - s2).get() == 2);\n    s1 -= s2;\n    REQUIRE(s1.get() == 2);\n}\n\nTEST_CASE(\"Multiplicable\")\n{\n    using MultiplicableType = fluent::NamedType<int, struct MultiplicableTag, fluent::Multiplicable>;\n    MultiplicableType s1(12);\n    MultiplicableType s2(10);\n    REQUIRE((s1 * s2).get() == 120);\n    s1 *= s2;\n    REQUIRE(s1.get() == 120);\n}\n\nTEST_CASE(\"Divisible\")\n{\n    using DivisibleType = fluent::NamedType<int, struct DivisibleTag, fluent::Divisible>;\n    DivisibleType s1(120);\n    DivisibleType s2(10);\n    REQUIRE((s1 \/ s2).get() == 12);\n    s1 \/= s2;\n    REQUIRE(s1.get() == 12);\n}\n\nTEST_CASE(\"Negatable\")\n{\n  using NegatableType = fluent::NamedType<int, struct NegatableTag, fluent::Negatable>;\n  NegatableType value(10);\n  REQUIRE((-value).get() == -10);\n}\n\nTEST_CASE(\"Modulable\")\n{\n    using ModulableType = fluent::NamedType<int, struct ModulableTag, fluent::Modulable>;\n    ModulableType s1(5);\n    ModulableType s2(2);\n    CHECK((s1 % s2).get() == 1);\n    s1 %= s2;\n    CHECK(s1.get() == 1);\n}\n\nTEST_CASE(\"BitWiseInvertable\")\n{\n    using BitWiseInvertableType = fluent::NamedType<int, struct BitWiseInvertableTag, fluent::BitWiseInvertable>;\n    BitWiseInvertableType s1(13);\n    CHECK((~s1).get() == (~13));\n}\n\nTEST_CASE(\"BitWiseAndable\")\n{\n    using BitWiseAndableType = fluent::NamedType<int, struct BitWiseAndableTag, fluent::BitWiseAndable>;\n    BitWiseAndableType s1(2);\n    BitWiseAndableType s2(64);\n    CHECK((s1 & s2).get() == (2 & 64));\n    s1 &= s2;\n    CHECK(s1.get() == (2 & 64));\n}\n\nTEST_CASE(\"Comparable\")\n{\n    REQUIRE((10_meter == 10_meter));\n    REQUIRE(!(10_meter == 11_meter));\n    REQUIRE((10_meter != 11_meter));\n    REQUIRE(!(10_meter != 10_meter));\n    REQUIRE((10_meter <  11_meter));\n    REQUIRE(!(10_meter <  10_meter));\n    REQUIRE((10_meter <= 10_meter));\n    REQUIRE((10_meter <= 11_meter));\n    REQUIRE(!(10_meter <= 9_meter));\n    REQUIRE((11_meter >  10_meter));\n    REQUIRE(!(10_meter > 11_meter));\n    REQUIRE((11_meter >= 10_meter));\n    REQUIRE((10_meter >= 10_meter));\n    REQUIRE(!(9_meter >= 10_meter));\n}\n\nTEST_CASE(\"ConvertibleWithOperator\")\n{\n    struct B\n    {\n        B(int x) : x(x) {}\n        int x;\n    };\n\n    struct A\n    {\n        A(int x) : x(x) {}\n        operator B () const { return B(x);}\n        int x;\n    };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::ImplicitlyConvertibleTo<B>::templ>;\n    StrongA strongA(A(42));\n    B b = strongA;\n    REQUIRE(b.x == 42);\n}\n\nTEST_CASE(\"ConvertibleWithConstructor\")\n{\n    struct A\n    {\n        A(int x) : x(x) {}\n        int x;\n    };\n\n    struct B\n    {\n        B(A a) : x(a.x) {}\n        int x;\n    };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::ImplicitlyConvertibleTo<B>::templ>;\n    StrongA strongA(A(42));\n    B b = strongA;\n    REQUIRE(b.x == 42);\n}\n\nTEST_CASE(\"ConvertibleToItself\")\n{\n    using MyInt = fluent::NamedType<int, struct MyIntTag, fluent::ImplicitlyConvertibleTo<int>::templ>;\n    MyInt myInt(42);\n    int i = myInt;\n    REQUIRE(i == 42);\n}\n\nTEST_CASE(\"Hash\")\n{\n    using SerialNumber = fluent::NamedType<std::string, struct SerialNumberTag, fluent::Comparable, fluent::Hashable>;\n\n    std::unordered_map<SerialNumber, int> hashMap = { {SerialNumber{\"AA11\"}, 10}, {SerialNumber{\"BB22\"}, 20} };\n    SerialNumber cc33{\"CC33\"};\n    hashMap[cc33] = 30;\n    REQUIRE(hashMap[SerialNumber{\"AA11\"}] == 10);\n    REQUIRE(hashMap[SerialNumber{\"BB22\"}] == 20);\n    REQUIRE(hashMap[cc33] == 30);\n}\n\nstruct testFunctionCallable_A\n{\n    testFunctionCallable_A(int x) : x(x) {}\n    testFunctionCallable_A(testFunctionCallable_A const&) = delete; \/\/ ensures that passing the argument to a function doesn't make a copy\n    testFunctionCallable_A(testFunctionCallable_A&&) = default;\n    testFunctionCallable_A& operator+=(testFunctionCallable_A const& other) { x += other.x; return *this; }\n    int x;\n};\n\ntestFunctionCallable_A operator+(testFunctionCallable_A const& a1, testFunctionCallable_A const& a2)\n{\n    return testFunctionCallable_A(a1.x + a2.x);\n}\n\nbool operator==(testFunctionCallable_A const& a1, testFunctionCallable_A const& a2)\n{\n    return a1.x == a2.x;\n}\n\nTEST_CASE(\"Function callable\")\n{\n    using A = testFunctionCallable_A;\n    auto functionTakingA = [](A const& a){ return a.x; };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::FunctionCallable>;\n    StrongA strongA(A(42));\n    const StrongA constStrongA(A(42));\n    REQUIRE(functionTakingA(strongA) == 42);\n    REQUIRE(functionTakingA(constStrongA) == 42);\n    REQUIRE(strongA + strongA == 84);\n}\n\nTEST_CASE(\"Method callable\")\n{\n    class A\n    {\n    public:\n        A(int x) : x(x) {}\n        A(A const&) = delete; \/\/ ensures that invoking a method doesn't make a copy\n        A(A&&) = default;\n\n        int method(){ return x; }\n        int constMethod() const{ return x; }\n    private:\n        int x;\n    };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::MethodCallable>;\n    StrongA strongA(A(42));\n    const StrongA constStrongA(A((42)));\n    REQUIRE(strongA->method() == 42);\n    REQUIRE(constStrongA->constMethod() == 42);\n}\n\nTEST_CASE(\"Callable\")\n{\n    class A\n    {\n    public:\n        A(int x) : x(x) {}\n        A(A const&) = delete; \/\/ ensures that invoking a method or function doesn't make a copy\n        A(A&&) = default;\n\n        int method(){ return x; }\n        int constMethod() const{ return x; }\n    private:\n        int x;\n    };\n\n    auto functionTakingA = [](A const& a){ return a.constMethod(); };\n\n    using StrongA = fluent::NamedType<A, struct StrongATag, fluent::Callable>;\n    StrongA strongA(A(42));\n    const StrongA constStrongA(A((42)));\n    REQUIRE(functionTakingA(strongA) == 42);\n    REQUIRE(strongA->method() == 42);\n    REQUIRE(constStrongA->constMethod() == 42);\n}\n\nTEST_CASE(\"Named arguments\")\n{\n    using FirstName = fluent::NamedType<std::string, struct FirstNameTag>;\n    using LastName = fluent::NamedType<std::string, struct LastNameTag>;\n    static const FirstName::argument firstName;\n    static const LastName::argument lastName;\n    auto getFullName = [](FirstName const& firstName, LastName const& lastName)\n    {\n        return firstName.get() + lastName.get();\n    };\n\n    auto fullName = getFullName(firstName = \"James\", lastName = \"Bond\");\n    REQUIRE(fullName == \"JamesBond\");\n}\n\nTEST_CASE(\"Empty base class optimization\")\n{\n    REQUIRE(sizeof(Meter) == sizeof(double));\n}\n\nusing strong_int = fluent::NamedType<int, struct IntTag>;\n\nTEST_CASE(\"Default constructible\")\n{\n    strong_int i1;\n    strong_int i2{};\n}\n\nTEST_CASE(\"constexpr\")\n{\n    using strong_bool = fluent::NamedType<bool, struct BoolTag>;\n\n    static_assert(strong_bool{ true }.get(), \"NamedType is not constexpr\");\n}\n\nstruct throw_on_construction\n{\n    throw_on_construction() { throw 42; }\n\n    throw_on_construction(int) { throw \"exception\"; }\n};\n\nusing C = fluent::NamedType<throw_on_construction, struct throwTag>;\n\nTEST_CASE(\"noexcept\")\n{\n    CHECK(noexcept(strong_int{}));\n    CHECK(!noexcept(C{}));\n\n    CHECK(noexcept(strong_int(3)));\n    CHECK(!noexcept(C{5}));\n}\n\nTEST_CASE(\"Arithmetic\")\n{\n    using strong_arithmetic = fluent::NamedType<int, struct ArithmeticTag, fluent::Arithmetic>;\n    strong_arithmetic a{ 1 };\n    strong_arithmetic b{ 2 };\n\n    CHECK((a + b).get() == 3);\n\n    a += b;\n    CHECK(a.get() == 3);\n\n    CHECK((a - b).get() == 1);\n\n    a -= b;\n    CHECK(a.get() == 1);\n\n    a.get() = 5;\n    CHECK((a * b).get() == 10);\n\n    a *= b;\n    CHECK(a.get() == 10);\n\n    CHECK((a \/ b).get() == 5);\n\n    a \/= b;\n    CHECK(a.get() == 5);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <ege\/engine\/engine.hxx>\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n#include <thread>\n\n\nusing namespace ege;\n\n\nclass DefaultCanvas: public ege::graphic::Canvas\n{\n        public:\n                DefaultCanvas( size_t width, size_t height ): Canvas( true, width, height )\n                {\n\n                }\n\n                ~DefaultCanvas() {}\n};\n\n\nengine::Configuration ege::engine::configuration;\nengine::Resources ege::engine::resources;\nstatic GLFWwindow* win;\n\n\nvoid ege::engine::initialize()\n{\n        glfwInit();\n        glfwDefaultWindowHints();\n        glfwWindowHint( GLFW_CONTEXT_VERSION_MAJOR, 4 );\n        glfwWindowHint( GLFW_CONTEXT_VERSION_MINOR, 0 );\n        GLFWmonitor* primary = glfwGetPrimaryMonitor();\n        const GLFWvidmode* videoMode = glfwGetVideoMode( primary );\n        win = glfwCreateWindow( videoMode->width, videoMode->height, \"\", primary, NULL );\n        glfwMakeContextCurrent( win );\n        glewExperimental = GL_TRUE;\n        glewInit();\n        glGetError();\n        resources.screen = new DefaultCanvas( ( size_t ) videoMode->width, ( size_t ) videoMode->height );\n        resources.resourcesManager = new resource::Manager( &configuration.root );\n}\n\n\nvoid ege::engine::start( Scenario* initialScenario )\n{\n        Scenario* current = initialScenario;\n\n        while ( true )\n        {\n                glfwPollEvents();\n\n                if ( glfwWindowShouldClose( win ) )\n                {\n                        current->shouldClose();\n\n                        if ( current->isNextScenarioAvailable() )\n                                goto should_close_jump;\n                }\n\n                current->update();\n\n                if ( current->isNextScenarioAvailable() )\n                {\n                        should_close_jump:\n                        current = current->getNextScenario();\n\n                        if ( current == nullptr )\n                                break;\n                }\n\n                glfwSwapBuffers( win );\n                std::this_thread::sleep_for( std::chrono::milliseconds( 30 ) );\n        }\n}\n\n\nvoid ege::engine::destroy()\n{\n        glfwDestroyWindow( win );\n        delete resources.screen;\n        glfwTerminate();\n}\n<commit_msg>vsync enabled<commit_after>#include <ege\/engine\/engine.hxx>\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n#include <thread>\n\n\nusing namespace ege;\n\n\nclass DefaultCanvas: public ege::graphic::Canvas\n{\n        public:\n                DefaultCanvas( size_t width, size_t height ): Canvas( true, width, height )\n                {\n\n                }\n\n                ~DefaultCanvas() {}\n};\n\n\nengine::Configuration ege::engine::configuration;\nengine::Resources ege::engine::resources;\nstatic GLFWwindow* win;\n\n\nvoid ege::engine::initialize()\n{\n        glfwInit();\n        glfwDefaultWindowHints();\n        glfwWindowHint( GLFW_CONTEXT_VERSION_MAJOR, 4 );\n        glfwWindowHint( GLFW_CONTEXT_VERSION_MINOR, 0 );\n        GLFWmonitor* primary = glfwGetPrimaryMonitor();\n        const GLFWvidmode* videoMode = glfwGetVideoMode( primary );\n        win = glfwCreateWindow( videoMode->width, videoMode->height, \"\", primary, NULL );\n        glfwMakeContextCurrent( win );\n        glfwSwapInterval( 1 );\n        glewExperimental = GL_TRUE;\n        glewInit();\n        glGetError();\n        resources.screen = new DefaultCanvas( ( size_t ) videoMode->width, ( size_t ) videoMode->height );\n        resources.resourcesManager = new resource::Manager( &configuration.root );\n}\n\n\nvoid ege::engine::start( Scenario* initialScenario )\n{\n        Scenario* current = initialScenario;\n\n        while ( true )\n        {\n                glfwPollEvents();\n\n                if ( glfwWindowShouldClose( win ) )\n                {\n                        current->shouldClose();\n\n                        if ( current->isNextScenarioAvailable() )\n                                goto should_close_jump;\n                }\n\n                current->update();\n\n                if ( current->isNextScenarioAvailable() )\n                {\n                        should_close_jump:\n                        current = current->getNextScenario();\n\n                        if ( current == nullptr )\n                                break;\n                }\n\n                glfwSwapBuffers( win );\n                std::this_thread::sleep_for( std::chrono::milliseconds( 8 ) );\n        }\n}\n\n\nvoid ege::engine::destroy()\n{\n        glfwDestroyWindow( win );\n        delete resources.screen;\n        glfwTerminate();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* AFTER INPUTING THE YEAR USE GETLINE FOR THE REST OF INFO, ALLOWS FOR MULTIPLE STRING VALUES WHILE SIMUTANIOUSLY IGNORING COMMAS\n\n    goal(12\/25\/2015-12\/27\/2015)\n\n    \/\/format the output\n    \/\/get weekDay, month, day and year using cin()\n    \/\/and then compare them to pcWeek, pcMonth, pcDay, pcYear\n    \/\/thinking about leaving weekDay, month, day and year under one vairable using getline() and then adding pc string variables AND THEN comparing\n    \/\/example: getline(schedule, dates) which would containg something like Thu Oct 27 2015 and then adding pcWeek + pcMonth + pcDay + pcYear and comparing\n    \/\/dont really have to get the year since months dont repeat, just keep the file updated per season\n\n    \/\/function: converting system int dates to strings i.e switch case, data input from file\n\n    \/\/problems to fix: need to find a way to update the file via the internet that works on windows too\n\n*\/\n\n#include <iostream>\n#include <stdlib.h> \/\/for system() function\n#include <unistd.h> \/\/for changing directories\n#include <sys\/stat.h> \/\/for stat() function\n#include <fstream>\n#include <ctime>\n#include <sstream> \/\/for stringstream: convert int to string\n#include <vector>\n\nusing namespace std;\n\nvoid weekConvert(int &tempWeek_, string &pcWeek_); \/\/converts tempWeek\nvoid monthConvert(int &tempMonth_, string &pcMonth_); \/\/converts tempMonth\nvoid dataInput(ifstream &schedule_, vector<string> &weekDay_, vector<string> &time_, vector<string> &box_, vector<string> &team1_, vector<string> &team1Score_, vector<string> &team2_,\nvector<string> &team2Score_, vector<string> &OT_, vector<string> &notes_, string userString); \/\/gets data from file\nint main()\n{\n    int changeDir, newDir;\n    ifstream schedule;\n    string a, b, c, userString; \/\/to ignore first three lines\n    vector<string> weekDay, times, box, team1, team1Score, team2, team2Score, OT, notes;\n    string pcWeek, pcMonth, pcDay, pcYear; \/\/system dates\n    string pcDate; \/\/final string for system date\n    int tempMonth, tempYear, tempDay, tempWeek, i = 0;\n    stringstream convertYear, convertDay;\n\n    time_t t = time(0);   \/\/ get time now\n    struct tm *now = localtime( &t );\n\n    tempWeek = (now->tm_wday);\n    tempMonth = (now->tm_mon + 1);\n    tempDay = (now->tm_mday);\n    tempYear = (now->tm_year + 1900);\n\n    weekConvert(tempWeek, pcWeek); \/\/converts tempWeek\n    monthConvert(tempMonth, pcMonth); \/\/converts tempMonth\n\n    convertYear << tempYear; \/\/converts years to string\n    pcYear = convertYear.str();\n\n    convertDay << tempDay; \/\/converts days to string\n    pcDay = convertDay.str();\n\n    pcDate = pcWeek + \" \" + pcMonth + \" \" + pcDay + \" \" + pcYear;\n\n    \/\/newDir = system(\"mkdir NBAschedule\"); \/\/linux only command\n    \/\/changeDir = chdir(\"\/home\/dan\/NBAschedule\/\"); \/\/linux only command\n\n    schedule.open(\"schedule.csv\");\n\n    if (schedule.is_open())\n    {\n\n        getline(schedule, a);\n        getline(schedule, b);\n        getline(schedule, c);\n\n        dataInput(schedule, weekDay, times, box, team1, team1Score, team2, team2Score, OT, notes, userString); \/\/first read of the file\n\n        do\n        {\n            if (weekDay[i] != pcDate)\n            {\n                dataInput(schedule, weekDay, times, box, team1, team1Score, team2, team2Score, OT, notes, userString); \/\/calling the function if system date doesnt match\n            }\n            else\n            {\n                cout << weekDay[i] << endl;\n                cout << times[i] << endl;\n                cout << team1[i] << \" \" << team1Score[i] << endl;\n                cout << team2[i] << \" \" << team2Score[i] << endl;\n                cout << OT[i] << endl;\n                cout << notes[i] << endl;\n                cout << \"\\n\" << endl;\n\n                dataInput(schedule, weekDay, times, box, team1, team1Score, team2, team2Score, OT, notes, userString); \/\/calling the input function\n\n            }\n            i++;\n\n        }while(!schedule.eof());\n\n        schedule.close();\n    }\n    else\n    {\n        cout << \"Couldn't find the file, downloading now...please re-run the program\" << endl;\n        system(\"wget https:\/\/raw.githubusercontent.com\/dm117\/NBA-terminal\/master\/schedule.csv\");\n    }\n\n    cout << \"\\nEnd of program\" << endl;\n\n    return 0;\n}\n\nvoid weekConvert(int &tempWeek_, string &pcWeek_)\n{\n    switch ( tempWeek_ )\n    {\n    case 0:\n        pcWeek_ = \"Sun\";\n        break;\n    case 1:\n        pcWeek_ = \"Mon\";\n        break;\n    case 2:\n        pcWeek_ = \"Tue\";\n        break;\n    case 3:\n        pcWeek_ = \"Wed\";\n        break;\n    case 4:\n        pcWeek_ = \"Thu\";\n        break;\n    case 5:\n        pcWeek_ = \"Fri\";\n        break;\n    case 6:\n        pcWeek_ = \"Sat\";\n        break;\n    default:\n        cout<<\"ERROR GETTING DAY OF THE WEEK\\n\";\n        break;\n    }\n}\n\nvoid monthConvert(int &tempMonth_, string &pcMonth_)\n{\n    switch ( tempMonth_ )\n    {\n    case 1:\n        pcMonth_ = \"Jan\";\n        break;\n    case 2:\n        pcMonth_ = \"Feb\";\n        break;\n    case 3:\n        pcMonth_ = \"March\";\n        break;\n    case 4:\n        pcMonth_ = \"Apr\";\n        break;\n    case 5:\n        pcMonth_ = \"May\";\n        break;\n    case 6:\n        pcMonth_ = \"Jun\";\n        break;\n    case 7:\n        pcMonth_ = \"Jul\";\n        break;\n    case 8:\n        pcMonth_ = \"Aug\";\n        break;\n    case 9:\n        pcMonth_ = \"Sep\";\n        break;\n    case 10:\n        pcMonth_ = \"Oct\";\n        break;\n    case 11:\n        pcMonth_ = \"Nov\";\n        break;\n    case 12:\n        pcMonth_ = \"Dec\";\n        break;\n    default:\n        cout<<\"ERROR\\n\";\n        break;\n    }\n}\n\nvoid dataInput(ifstream &schedule_, vector<string> &weekDay_, vector<string> &time_, vector<string> &box_, vector<string> &team1_, vector<string> &team1Score_, vector<string> &team2_,\nvector<string> &team2Score_, vector<string> &OT_, vector<string> &notes_, string userString_) \/\/gets data from file\n{\n\n    getline(schedule_, userString_, ',');\n    weekDay_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    time_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    box_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    team1_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    team1Score_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    team2_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    team2Score_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    OT_.push_back(userString_);\n\n    getline(schedule_, userString_);\n    notes_.push_back(userString_);\n\n}\n\n\/*--------------------------------------------THIS WILL BE USE LATER TO CHECK IF THE DIRECTORY ALREADY EXISTS------------\nstruct stat statbuf;\nint isDir = 0;\nif (stat(\"\/NBAschedule\", &statbuf) != -1) {\n   if (S_ISDIR(statbuf.st_mode)) {\n      isDir = 1;\n   }\n} else {\n\n       here you might check errno for the reason, ENOENT will mean the path\n       was bad, ENOTDIR means part of the path is not a directory, EACCESS\n       would mean you can't access the path. Regardless, from the point of\n       view of your app, the path is not a directory if stat fails.\n\n}\n\n\/\/Source: https:\/\/www.quora.com\/How-do-I-check-if-a-directory-exists-in-Linux-using-C++\n--------------------------------------------THIS WILL BE USE LATER TO CHECK IF THE DIRECTORY ALREADY EXISTS------------*\/\n\n<commit_msg>2x2 formatting! need output function<commit_after>\/* AFTER INPUTING THE YEAR USE GETLINE FOR THE REST OF INFO, ALLOWS FOR MULTIPLE STRING VALUES WHILE SIMUTANIOUSLY IGNORING COMMAS\n\n    goal(12\/25\/2015-12\/27\/2015)\n\n    \/\/format the output\n    \/\/get weekDay, month, day and year using cin()\n    \/\/and then compare them to pcWeek, pcMonth, pcDay, pcYear\n    \/\/thinking about leaving weekDay, month, day and year under one vairable using getline() and then adding pc string variables AND THEN comparing\n    \/\/example: getline(schedule, dates) which would containg something like Thu Oct 27 2015 and then adding pcWeek + pcMonth + pcDay + pcYear and comparing\n    \/\/dont really have to get the year since months dont repeat, just keep the file updated per season\n\n    \/\/function: converting system int dates to strings i.e switch case, data input from file\n\n    \/\/problems to fix: need to find a way to update the file via the internet that works on windows too\n\n*\/\n\n#include <iostream>\n#include <stdlib.h> \/\/for system() function\n#include <unistd.h> \/\/for changing directories\n#include <sys\/stat.h> \/\/for stat() function\n#include <fstream>\n#include <ctime>\n#include <sstream> \/\/for stringstream: convert int to string\n#include <vector>\n#include <iomanip> \/\/output manipulators\n\nusing namespace std;\n\nvoid weekConvert(int &tempWeek_, string &pcWeek_); \/\/converts tempWeek\nvoid monthConvert(int &tempMonth_, string &pcMonth_); \/\/converts tempMonth\nvoid dataInput(ifstream &schedule_, vector<string> &weekDay_, vector<string> &time_, vector<string> &box_, vector<string> &team1_, vector<string> &team1Score_, vector<string> &team2_,\nvector<string> &team2Score_, vector<string> &OT_, vector<string> &notes_, string userString); \/\/gets data from file\nint main()\n{\n    int changeDir, newDir;\n    ifstream schedule;\n    string a, b, c, userString; \/\/to ignore first three lines\n    vector<string> weekDay, times, box, team1, team1Score, team2, team2Score, OT, notes;\n    vector<int> placeHolder;\n    string pcWeek, pcMonth, pcDay, pcYear; \/\/system dates\n    string pcDate; \/\/final string for system date\n    int tempMonth, tempYear, tempDay, tempWeek, i = 0;\n    stringstream convertYear, convertDay;\n\n    time_t t = time(0);   \/\/ get time now\n    struct tm *now = localtime( &t );\n\n    tempWeek = (now->tm_wday);\n    tempMonth = (now->tm_mon + 1);\n    tempDay = (now->tm_mday);\n    tempYear = (now->tm_year + 1900);\n\n    weekConvert(tempWeek, pcWeek); \/\/converts tempWeek\n    monthConvert(tempMonth, pcMonth); \/\/converts tempMonth\n\n    convertYear << tempYear; \/\/converts years to string\n    pcYear = convertYear.str();\n\n    convertDay << tempDay; \/\/converts days to string\n    pcDay = convertDay.str();\n\n    pcDate = pcWeek + \" \" + pcMonth + \" \" + pcDay + \" \" + pcYear;\n\n    \/\/newDir = system(\"mkdir NBAschedule\"); \/\/linux only command\n    \/\/changeDir = chdir(\"\/home\/dan\/NBAschedule\/\"); \/\/linux only command\n    int z = 0;\n\n    schedule.open(\"schedule.csv\");\n\n    if (schedule.is_open())\n    {\n\n        getline(schedule, a);\n        getline(schedule, b);\n        getline(schedule, c);\n\n        dataInput(schedule, weekDay, times, box, team1, team1Score, team2, team2Score, OT, notes, userString); \/\/first read of the file\n\n        do\n        {\n            if (weekDay[i] != pcDate)\n            {\n                dataInput(schedule, weekDay, times, box, team1, team1Score, team2, team2Score, OT, notes, userString); \/\/calling the function if system date doesnt match\n            }\n            else\n            {\n                placeHolder.push_back(i); \/\/holds the location of today's games\n\n                dataInput(schedule, weekDay, times, box, team1, team1Score, team2, team2Score, OT, notes, userString); \/\/calling the input function\n            }\n\n            i++; \/\/put this int the else statement and delete the output then print out formatted date after the loop\n\n        }while(!schedule.eof());\n\n        schedule.close();\n\n        int one = 0;\n        int two = 0;\n        int three = 0;\n        int four = 0;\n        int five = 0;\n        int six = 0;\n        int seven = 0;\n        int y = 0;\n        int i = 0;\n\n        z = 2;\n\n        for(i; i < placeHolder.size(); i++)\n        {\n            cout << setw(30) << left << weekDay[placeHolder[i]] << setw(5) << \" \";\/\/22\n\n            if (i == placeHolder.size() - 1)\n                {\n                    y = 1;\n                }\n\n            if(y == 1)\n            {\n\n                cout << endl;\n                for(int x = 0; x < z; x++) \/\/need to find a way to continue\n                {\n                    cout << setw(30) << left << times[placeHolder[one]] << setw(5) << \" \";\/\/29\n                    one++;\n                }\n                cout << endl;\n                for(int x = 0; x < z; x++)\n                {\n                    cout << setw(30) << left << team1[placeHolder[two]] << setw(5) << \" \";\/\/22\n                    two++;\n                }\n\n                for(int x = 0; x < z; x++)\n                {\n                    cout << team1Score[placeHolder[three]];\n                    three++;\n                }\n                cout << endl;\n                for(int x = 0; x < z; x++)\n                {\n                    cout << setw(30) << left << team2[placeHolder[four]] << setw(5) << \" \";\/\/23\n                    four++;\n                }\n\n                for(int x = 0; x < z; x++)\n                {\n                    cout << team2Score[placeHolder[five]];\n                    five++;\n                }\n                cout << endl;\n                for(int x = 0; x < z; x++)\n                {\n                    cout << OT[placeHolder[six]];\n                    six++;\n                }\n                cout << endl;\n                for(int x = 0; x < z; x++)\n                {\n                    cout << notes[placeHolder[seven]];\n                    seven++;\n                }\n\n                y = 0;\n\n                cout << \"\\n\\n\" << endl;\n            }\n            else\n            {\n                y++;\n            }\n        }\n\n       \/* i = 0;\n\n        do\n        {\n                \/\/going to write for loops to format output into columns and rows. ex: for(){ cout << vectorString << setw() }\n                cout << weekDay[placeHolder[i]] << endl;\n                cout << times[placeHolder[i]] << endl;\n                cout << team1[placeHolder[i]] << \" \" << team1Score[placeHolder[i]] << endl;\n                cout << team2[placeHolder[i]] << \" \" << team2Score[placeHolder[i]] << endl;\n                cout << OT[placeHolder[i]] << endl;\n                cout << notes[placeHolder[i]] << endl;\n\n                i++;\n\n        }while(i < placeHolder.size()); *\/\n\n    }\n    else\n    {\n        cout << \"Couldn't find the file, downloading now...please re-run the program\" << endl;\n        system(\"wget https:\/\/raw.githubusercontent.com\/dm117\/NBA-terminal\/master\/schedule.csv\");\n        cout << \"\\n\\nDownloaded file, re-run the program...\" << endl;\n    }\n\n    cout << \"\\nEnd of program\" << endl;\n\n    return 0;\n}\n\nvoid weekConvert(int &tempWeek_, string &pcWeek_)\n{\n    switch ( tempWeek_ )\n    {\n    case 0:\n        pcWeek_ = \"Sun\";\n        break;\n    case 1:\n        pcWeek_ = \"Mon\";\n        break;\n    case 2:\n        pcWeek_ = \"Tue\";\n        break;\n    case 3:\n        pcWeek_ = \"Wed\";\n        break;\n    case 4:\n        pcWeek_ = \"Thu\";\n        break;\n    case 5:\n        pcWeek_ = \"Fri\";\n        break;\n    case 6:\n        pcWeek_ = \"Sat\";\n        break;\n    default:\n        cout<<\"ERROR GETTING DAY OF THE WEEK\\n\";\n        break;\n    }\n}\n\nvoid monthConvert(int &tempMonth_, string &pcMonth_)\n{\n    switch ( tempMonth_ )\n    {\n    case 1:\n        pcMonth_ = \"Jan\";\n        break;\n    case 2:\n        pcMonth_ = \"Feb\";\n        break;\n    case 3:\n        pcMonth_ = \"March\";\n        break;\n    case 4:\n        pcMonth_ = \"Apr\";\n        break;\n    case 5:\n        pcMonth_ = \"May\";\n        break;\n    case 6:\n        pcMonth_ = \"Jun\";\n        break;\n    case 7:\n        pcMonth_ = \"Jul\";\n        break;\n    case 8:\n        pcMonth_ = \"Aug\";\n        break;\n    case 9:\n        pcMonth_ = \"Sep\";\n        break;\n    case 10:\n        pcMonth_ = \"Oct\";\n        break;\n    case 11:\n        pcMonth_ = \"Nov\";\n        break;\n    case 12:\n        pcMonth_ = \"Dec\";\n        break;\n    default:\n        cout<<\"ERROR\\n\";\n        break;\n    }\n}\n\nvoid dataInput(ifstream &schedule_, vector<string> &weekDay_, vector<string> &time_, vector<string> &box_, vector<string> &team1_, vector<string> &team1Score_, vector<string> &team2_,\nvector<string> &team2Score_, vector<string> &OT_, vector<string> &notes_, string userString_) \/\/gets data from file\n{\n\n    getline(schedule_, userString_, ',');\n    weekDay_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    time_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    box_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    team1_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    team1Score_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    team2_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    team2Score_.push_back(userString_);\n\n    getline(schedule_, userString_, ',');\n    OT_.push_back(userString_);\n\n    getline(schedule_, userString_);\n    notes_.push_back(userString_);\n\n}\n\n\/*--------------------------------------------THIS WILL BE USE LATER TO CHECK IF THE DIRECTORY ALREADY EXISTS------------\nstruct stat statbuf;\nint isDir = 0;\nif (stat(\"\/NBAschedule\", &statbuf) != -1) {\n   if (S_ISDIR(statbuf.st_mode)) {\n      isDir = 1;\n   }\n} else {\n\n       here you might check errno for the reason, ENOENT will mean the path\n       was bad, ENOTDIR means part of the path is not a directory, EACCESS\n       would mean you can't access the path. Regardless, from the point of\n       view of your app, the path is not a directory if stat fails.\n\n}\n\n\/\/Source: https:\/\/www.quora.com\/How-do-I-check-if-a-directory-exists-in-Linux-using-C++\n--------------------------------------------THIS WILL BE USE LATER TO CHECK IF THE DIRECTORY ALREADY EXISTS------------*\/\n\n<|endoftext|>"}
{"text":"<commit_before>f03b7826-585a-11e5-a005-6c40088e03e4<commit_msg>f042646c-585a-11e5-afe7-6c40088e03e4<commit_after>f042646c-585a-11e5-afe7-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>#include <fountain.h>\n\nftTime::Clock mainClock(60.0);\nftScene::SceneSelector SS;\nftRender::ShaderProgram SP(\"resources\/shader\/vs.vert\", \"resources\/shader\/fs.frag\");\nftType::FontMan fm;\n\n#include \"testscene.h\"\n#include <string>\n\nvoid fountain::setBasicVarible()\n{\n\tmainWin.setW(800);\n\tmainWin.setH(600);\n\tmainWin.title = std::string(\"fountain-prototype \") + std::string(FOUNTAIN_VERSION);\n\tmainWin.icon = \"fountain.ico\";\n\tmainWin.isFullScreen = false;\n\/\/\tmainWin.isFullScreen = true;\n\tmainWin.hideCursor = false;\n}\n\nvoid fountain::gameInit()\n{\n\tmainClock.init();\n\n\tSS.registerScene(&startScene, FT_StartScene);\n\tSS.registerScene(&gameScene, FT_Scene2);\n\tSS.registerScene(&modelScene, FT_Scene3);\n\n\tfm.loadFont(\"resources\/font\/wqy-microhei.ttc\");\n\tfm.genAsciiTable();\n\n\tSP.init();\n\tSP.setUniform(\"time\", 0.0f);\n\tSP.use();\n}\n\nvoid fountain::singleFrame()\n{\n\t\/\/TODO: move this internal(fountainMain)\n\tmainClock.tick();\n\n\tftVec2 mp = fountain::sysMouse.getPos();\n\tSP.setUniform(\"time\", mainClock.secondsFromInit());\n\tSP.setUniform(\"resolution\", fountain::getWinSize());\n\tSP.setUniform(\"mouse\", mp);\n\n\tif (fountain::sysKeyboard.getState(FT_S) == FT_KeyUp)\n\t\tSP.use();\n\tif (fountain::sysKeyboard.getState(FT_F) == FT_KeyUp)\n\t\tftRender::useFFP();\n\tif (fountain::sysKeyboard.getState(FT_R) == FT_KeyUp)\n\t\tSP.reload();\n\n\tSS.sceneSolve();\n\tSS.update();\n\tSS.draw();\n\n\tftRender::drawAlphaPic(fm.picID);\n}\n<commit_msg>change font file use<commit_after>#include <fountain.h>\n\nftTime::Clock mainClock(60.0);\nftScene::SceneSelector SS;\nftRender::ShaderProgram SP(\"resources\/shader\/vs.vert\", \"resources\/shader\/fs.frag\");\nftType::FontMan fm;\n\n#include \"testscene.h\"\n#include <string>\n\nvoid fountain::setBasicVarible()\n{\n\tmainWin.setW(800);\n\tmainWin.setH(600);\n\tmainWin.title = std::string(\"fountain-prototype \") + std::string(FOUNTAIN_VERSION);\n\tmainWin.icon = \"fountain.ico\";\n\tmainWin.isFullScreen = false;\n\/\/\tmainWin.isFullScreen = true;\n\tmainWin.hideCursor = false;\n}\n\nvoid fountain::gameInit()\n{\n\tmainClock.init();\n\n\tSS.registerScene(&startScene, FT_StartScene);\n\tSS.registerScene(&gameScene, FT_Scene2);\n\tSS.registerScene(&modelScene, FT_Scene3);\n\n\tfm.loadFont(\"\/usr\/share\/fonts\/truetype\/freefont\/FreeSans.ttf\");\n\tfm.genAsciiTable();\n\n\tSP.init();\n\tSP.setUniform(\"time\", 0.0f);\n\tSP.use();\n}\n\nvoid fountain::singleFrame()\n{\n\t\/\/TODO: move this internal(fountainMain)\n\tmainClock.tick();\n\n\tftVec2 mp = fountain::sysMouse.getPos();\n\tSP.setUniform(\"time\", mainClock.secondsFromInit());\n\tSP.setUniform(\"resolution\", fountain::getWinSize());\n\tSP.setUniform(\"mouse\", mp);\n\n\tif (fountain::sysKeyboard.getState(FT_S) == FT_KeyUp)\n\t\tSP.use();\n\tif (fountain::sysKeyboard.getState(FT_F) == FT_KeyUp)\n\t\tftRender::useFFP();\n\tif (fountain::sysKeyboard.getState(FT_R) == FT_KeyUp)\n\t\tSP.reload();\n\n\tSS.sceneSolve();\n\tSS.update();\n\tSS.draw();\n\n\tftRender::drawAlphaPic(fm.picID);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"DataThread.h\"\n#include \"exception\/Base.h\"\n\nnamespace blitzortung {\n\n  DataThread::DataThread(Queue<data::Event>& sampleQueue, const network::transfer::Base& transfer, output::Base& output) :\n    sampleQueue_(sampleQueue),\n    transfer_(transfer),\n    events_(new data::Events()),\n    output_(output),\n    logger_(\"DataThread\")\n  {\n    sleepTime_ = pt::seconds(20);\n    eventRateLimit_ = 1.0;\n\n    if (logger_.isDebugEnabled())\n      logger_.debugStream() << \"initalized( sleep: \" << sleepTime_ << \", eventRateLimit: \" << eventRateLimit_ << \")\";\n  }\n\n  DataThread::~DataThread() {\n    if (logger_.isDebugEnabled())\n      logger_.debugStream() << \"deleted\";\n  }\n\n  void DataThread::setSleepTime(const pt::time_duration& sleepTime) {\n    sleepTime_ = sleepTime;\n  }\n\n  void DataThread::setEventRateLimit(const double eventRateLimit) {\n    eventRateLimit_ = eventRateLimit;\n  }\n\n  data::Events::AP DataThread::prepareData(const pt::ptime& now, const pt::ptime& lastSent) {\n    data::Events::AP deletedEvents(new data::Events());\n\n    double secondsElapsed = ((now - lastSent).total_milliseconds() \/ 1000);\n    double eventRate = double(events_->size()) \/ secondsElapsed;\n\n    if (logger_.isDebugEnabled())\n      logger_.debugStream() << \"prepareData() \" << events_->size() << \" events (rate \" << eventRate << \" events\/second) at \" << now;\n\n    if (eventRate > eventRateLimit_) {\n      events_->sort(data::Event::CompareAmplitude());\n\n      int sampleLimit = eventRateLimit_ * secondsElapsed;\n\n      \/\/events_->transfer(events_->begin() + sampleLimit, events_->end());\n      deletedEvents->transfer(deletedEvents->end(), events_->begin(), events_->end(), *events_);\n\n      if (logger_.isInfoEnabled()) {\n\tlogger_.infoStream() << \"prepareData() limit \" << eventRateLimit_ << \" reached, interval seconds: \" << secondsElapsed << \", erasing to \" << sampleLimit << \" elements (new # of elements: \" << events_->size() << \")\";\n      }\n\n      \/\/ time sort events\n      events_->sort();\n    }\n\n    return deletedEvents;\n  }\n\n  void DataThread::operator()() {\n\n    pt::ptime lastSent = pt::second_clock::universal_time();\n\n    while (true) {\n      boost::xtime xt;\n      boost::xtime_get(&xt, boost::TIME_UTC);\n      xt.sec += 1;\n\n      if (logger_.isDebugEnabled())\n\tlogger_.debugStream() << \"() wait for data\";\n\n      \/\/ wait for next incoming sample\n      sampleQueue_.timed_wait(xt);\n\n      pt::ptime now = pt::second_clock::universal_time();\n\n      if (now - lastSent >= sleepTime_) {\n\n\tbool sendAgain = false;\n\n\tdo {\n\t  \/\/ get new events from queue until it is empty\n\t  while (! sampleQueue_.empty()) {\n\n\t    if (events_->size() != 0 && events_->getDate() != sampleQueue_.front().getWaveform().getTime().date()) {\n\t      if (logger_.isDebugEnabled())\n\t\tlogger_.debugStream() << \"() stopped reading queue at transition to next day\";\n\t      sendAgain = true;\n\t      break;\n\t    }\n\n\t    if (logger_.isDebugEnabled())\n\t      logger_.debugStream() << \"() pop from queue \" << sampleQueue_.front().getWaveform().getTime();\n\t    events_->add(sampleQueue_.pop());\n\t  }\n\n\t  if (events_->size() > 0) {\n\n\t    if (logger_.isDebugEnabled())\n\t      logger_.debug(\"() transmitting\/saving data\");\n\n\t    \/\/ prepare data for transmission\n\t    data::Events::AP deletedEvents = prepareData(now, lastSent);\n\n\t    logger_.infoStream() << \"transmit \" << events_->size() << \" events\";\n\t    \/\/ transmit data\n\t    transfer_.send(*events_);\n\t    logger_.infoStream() << \"transmit done\";\n\n\t    if (logger_.isDebugEnabled())\n\t      logger_.debugStream() << \"() recollect events \" << events_->size() << \" + \" << deletedEvents->size();\n\n\t    events_->transfer(events_->end(), *deletedEvents);\n\n\t    events_->sort();\n\n\t    if (logger_.isDebugEnabled())\n\t      logger_.debugStream() << \"() recollected \" << events_->size() << \" events \";\n\n\t    logger_.infoStream() << \"output \" << events_->size() << \" events\";\n\t    output_.output(*events_);\n\n\t    \/\/ delete all events\n\t    events_->clear();\n\t  }\n\t} while (sendAgain);\n\n\tlastSent = now;\n      }\n    }\n  }\n\n}\n<commit_msg>logging cleanup<commit_after>\n#include \"DataThread.h\"\n#include \"exception\/Base.h\"\n\nnamespace blitzortung {\n\n  DataThread::DataThread(Queue<data::Event>& sampleQueue, const network::transfer::Base& transfer, output::Base& output) :\n    sampleQueue_(sampleQueue),\n    transfer_(transfer),\n    events_(new data::Events()),\n    output_(output),\n    logger_(\"DataThread\")\n  {\n    sleepTime_ = pt::seconds(20);\n    eventRateLimit_ = 1.0;\n\n    if (logger_.isDebugEnabled())\n      logger_.debugStream() << \"initalized( sleep: \" << sleepTime_ << \", eventRateLimit: \" << eventRateLimit_ << \")\";\n  }\n\n  DataThread::~DataThread() {\n    if (logger_.isDebugEnabled())\n      logger_.debugStream() << \"deleted\";\n  }\n\n  void DataThread::setSleepTime(const pt::time_duration& sleepTime) {\n    sleepTime_ = sleepTime;\n  }\n\n  void DataThread::setEventRateLimit(const double eventRateLimit) {\n    eventRateLimit_ = eventRateLimit;\n  }\n\n  data::Events::AP DataThread::prepareData(const pt::ptime& now, const pt::ptime& lastSent) {\n    data::Events::AP deletedEvents(new data::Events());\n\n    double secondsElapsed = ((now - lastSent).total_milliseconds() \/ 1000);\n    double eventRate = double(events_->size()) \/ secondsElapsed;\n\n    if (logger_.isDebugEnabled())\n      logger_.debugStream() << \"prepareData() \" << events_->size() << \" events (rate \" << eventRate << \" events\/second) at \" << now;\n\n    if (eventRate > eventRateLimit_) {\n      events_->sort(data::Event::CompareAmplitude());\n\n      int sampleLimit = eventRateLimit_ * secondsElapsed;\n\n      \/\/events_->transfer(events_->begin() + sampleLimit, events_->end());\n      deletedEvents->transfer(deletedEvents->end(), events_->begin(), events_->end(), *events_);\n\n      if (logger_.isInfoEnabled()) {\n\tlogger_.infoStream() << \"prepareData() limit \" << eventRateLimit_ << \" reached, interval seconds: \" << secondsElapsed << \", erasing to \" << sampleLimit << \" elements (new # of elements: \" << events_->size() << \")\";\n      }\n\n      \/\/ time sort events\n      events_->sort();\n    }\n\n    return deletedEvents;\n  }\n\n  void DataThread::operator()() {\n\n    pt::ptime lastSent = pt::second_clock::universal_time();\n\n    while (true) {\n      boost::xtime xt;\n      boost::xtime_get(&xt, boost::TIME_UTC);\n      xt.sec += 1;\n\n      if (logger_.isDebugEnabled())\n\tlogger_.debugStream() << \"() wait for data\";\n\n      \/\/ wait for next incoming sample\n      sampleQueue_.timed_wait(xt);\n\n      pt::ptime now = pt::second_clock::universal_time();\n\n      if (now - lastSent >= sleepTime_) {\n\n\tbool sendAgain = false;\n\n\tdo {\n\t  \/\/ get new events from queue until it is empty\n\t  while (! sampleQueue_.empty()) {\n\n\t    if (events_->size() != 0 && events_->getDate() != sampleQueue_.front().getWaveform().getTime().date()) {\n\t      if (logger_.isDebugEnabled())\n\t\tlogger_.debugStream() << \"() stopped reading queue at transition to next day\";\n\t      sendAgain = true;\n\t      break;\n\t    }\n\n\t    if (logger_.isDebugEnabled())\n\t      logger_.debugStream() << \"() pop from queue \" << sampleQueue_.front().getWaveform().getTime();\n\t    events_->add(sampleQueue_.pop());\n\t  }\n\n\t  if (events_->size() > 0) {\n\n\t    if (logger_.isDebugEnabled())\n\t      logger_.debug(\"() transmitting\/saving data\");\n\n\t    \/\/ prepare data for transmission\n\t    data::Events::AP deletedEvents = prepareData(now, lastSent);\n\n\t    \/\/ transmit data\n\t    transfer_.send(*events_);\n\n\t    if (logger_.isDebugEnabled())\n\t      logger_.debugStream() << \"() recollect events \" << events_->size() << \" + \" << deletedEvents->size();\n\n\t    events_->transfer(events_->end(), *deletedEvents);\n\n\t    events_->sort();\n\n\t    if (logger_.isDebugEnabled())\n\t      logger_.debugStream() << \"() recollected \" << events_->size() << \" events \";\n\n\t    output_.output(*events_);\n\n\t    \/\/ delete all events\n\t    events_->clear();\n\t  }\n\t} while (sendAgain);\n\n\tlastSent = now;\n      }\n    }\n  }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>80d6a8cf-4b02-11e5-95b3-28cfe9171a43<commit_msg>having coffee<commit_after>80e233f8-4b02-11e5-97f3-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>#include <vexcl\/devlist.hpp>\n#include <vexcl\/spmat.hpp>\n#include <vexcl\/vector.hpp>\n\n#include <blaze\/math\/CompressedMatrix.h>\n#include <blaze\/math\/DynamicVector.h>\n#include <blaze\/math\/DenseSubvector.h>\n\n#include <blaze\/util\/serialization\/Archive.h>\n#include <blaze\/math\/serialization\/MatrixSerializer.h>\n#include <blaze\/math\/serialization\/VectorSerializer.h>\n\n#include <vector>\n#include <sstream>\n#include <string>\n#include <iostream>\n\nvoid ConvertSpMat(std::vector<size_t>& row, std::vector<size_t>& col, std::vector<double>& val, blaze::CompressedMatrix<double>& mat) {\n\tuint non_zeros = mat.nonZeros();\n\trow.clear();\n\tcol.clear();\n\tval.clear();\n\tuint count = 0;\n\tfor (int i = 0; i < mat.rows(); ++i) {\n\t\trow.push_back(count);\n\t\tfor (blaze::CompressedMatrix<double>::Iterator it = mat.begin(i); it != mat.end(i); ++it) {\n\t\t\tcol.push_back(it->index());\n\t\t\tval.push_back(it->value());\n\t\t\tcount++;\n\t\t}\n\t}\n\trow.push_back(count);\n}\n\n\nstd::string slurp(std::string fname){\n\tstd::ifstream file(fname.c_str());\n\tstd::string buffer((std::istreambuf_iterator<char>(file)), std::istreambuf_iterator<char>());\n\treturn buffer;\n}\n\n\nvoid readSPMAT(std::string & data, blaze::CompressedMatrix<double> & mat){\n\tstd::stringstream ss(data);\n\n\tuint rows, cols, nonzeros;\n\tss>>rows>>cols>>nonzeros;\n\t\/\/printf(\"INFO: rows: %d, columns: %d, non zeros: %d\\n\",rows, cols, nonzeros);\n\tmat.resize(rows,cols);\n\tmat.reserve(nonzeros);\n\tuint row_nonzeros;\n\tuint colval;\n\tdouble v;\n\n\tfor(int i=0; i<rows; i++){\n\t\tif(i%1000000==0){printf(\"%d, \",i);}\n\t\t\n\t\tss>>row_nonzeros;\n\n\t\tfor(int j=0; j<row_nonzeros; j++){\n\t\t\tss>>colval>>v;\n\t\t\tmat.append(i,colval,v);\n\t\t}\n\t\tmat.finalize(i);\n\t}\n\tprintf(\"\\n\");\n}\nvoid readVector(std::string & data, std::vector<double> & vec){\n\tstd::stringstream ss(data);\n\n\tuint size;\n\tss>>size;\n\tvec.resize(size);\n\n\t\/\/printf(\"INFO: size: %d\\n\",size);\n\tdouble v;\n\tfor(int i=0; i<size; i++){\n\t\tss>>v;\n\t\tvec[i] = v;\n\t}\n}\nint main(){\n\tprintf(\"start execution \\n\");\n\tvex::Context ctx(vex::Filter::Env && vex::Filter::DoublePrecision);\n\tstd::cout<<ctx<<std::endl;\n\tprintf(\"create context \\n\");\n\n\n\tblaze::CompressedMatrix<double> D_T, M_invD;\n\tstd::vector<double> g,b;\n\tprintf(\"read D^T \\n\");\n\t{\n\t\tstd::string data = slurp(\"D_T.mat\");\n\t\treadSPMAT(data, D_T);\n\t}\n\n\t{\n\t\tstd::string data = slurp(\"M_invD.mat\");\n\t\treadSPMAT(data, M_invD);\n\t}\n\t{\n\t\tstd::string data = slurp(\"gamma.vec\");\n\t\treadVector(data, g);\n\t}\n\n\t{\n\t\tstd::string data = slurp(\"b.vec\");\n\t\treadVector(data, b);\n\t}\n\n\n\tprintf(\"D_T: rows: %d, columns: %d, non zeros: %d\\n\", D_T.rows(), D_T.columns(), D_T.nonZeros());\n\tprintf(\"M_invD: rows: %d, columns: %d, non zeros: %d\\n\", M_invD.rows(), M_invD.columns(), M_invD.nonZeros());\n\tprintf(\"gamma: size: %d\\n\", g.size());\n\tprintf(\"b: size: %d\\n\", b.size());\n\n\tstd::vector<size_t> row;\n\tstd::vector<size_t> col;\n\tstd::vector<double> val;\n\n\tConvertSpMat(row, col, val, D_T);\n\tvex::SpMat<double> _D_T(ctx, D_T.rows(), D_T.columns(), row.data(), col.data(), val.data());\n\n\tConvertSpMat(row, col, val, M_invD);\n\tvex::SpMat<double> _M_invD(ctx, M_invD.rows(), M_invD.columns(), row.data(), col.data(), val.data());\n\n\tblaze::DynamicVector<double> gamma(g.size()),rhs(g.size());\n\n\tfor(int i=0; i<g.size(); i++){\n\t\tgamma[i] = g[i];\n\t\trhs[i] = b[i];\n\t}\n\tblaze::DynamicVector<double> tmp_cpu(g.size());\n\tblaze::DynamicVector<double> res_cpu(g.size());\n\tdouble start_cpu = omp_get_wtime();\n\tfor(size_t i = 0; i < 100; i++){\n\t\ttmp_cpu = M_invD*gamma;\n\t\tres_cpu += D_T*tmp_cpu;\n\t}\n\tdouble end_cpu = omp_get_wtime();\n\n\t\n\tvex::profiler<> prof;\n\n\tvex::vector<double> gamma_gpu(ctx,g.size());\n\tvex::vector<double> b_gpu(ctx,b.size());\n\tvex::copy(g,gamma_gpu);\n\tvex::copy(b,b_gpu);\n\tvex::vector<double> tmp_gpu(ctx,g.size());\n\tvex::vector<double> res_gpu(ctx,g.size());\n\n\n\ttmp_gpu += _M_invD*gamma_gpu;\n\ttmp_gpu = 0;\n\tres_gpu += _D_T*tmp_gpu;\n\tres_gpu = 0;\n\tprof.tic_cpu(\"GPU\");\n\tdouble start_gpu = omp_get_wtime();\n\tfor(size_t i = 0; i < 100; i++){\n\t\ttmp_gpu  = _M_invD*gamma_gpu;\n\t\tres_gpu  += _D_T*tmp_gpu;\n\t}\n\tctx.finish();\n\tdouble end_gpu = omp_get_wtime();\n\tdouble tot_time = prof.toc(\"GPU\");\n\tprintf(\"CPU took %f sec. time.\\n\", (end_cpu-start_cpu)\/100.0);\n\tprintf(\"GPU took %f sec. time, %f sec time.\\n\", (end_gpu-start_gpu)\/100.0, tot_time\/100.0);\n\tprintf(\"Speedup: %f\\n\", (end_cpu-start_cpu) \/(end_gpu-start_gpu));\n\n\t\/\/std::vector<double> res_host(g.size());\n\n\t\/\/vex::copy(res_gpu,res_host);\n\n\n\n\n\n\t\/\/printf(\"copy\\n\");\n\t\/\/ for(int i=0; i<g.size(); i++){\n\t\/\/ \tif(res_host[i]!=res_cpu[i]){\n\t\/\/ \t\tprintf(\"%f\\n\",res_host[i]-res_cpu[i]);\n\t\/\/ \t}\n\t\/\/ }\n\n\n\n\treturn 0;\n}<commit_msg>The number of runs is now a command line argument<commit_after>#include <vexcl\/devlist.hpp>\n#include <vexcl\/spmat.hpp>\n#include <vexcl\/vector.hpp>\n\n#include <blaze\/math\/CompressedMatrix.h>\n#include <blaze\/math\/DynamicVector.h>\n#include <blaze\/math\/DenseSubvector.h>\n\n#include <blaze\/util\/serialization\/Archive.h>\n#include <blaze\/math\/serialization\/MatrixSerializer.h>\n#include <blaze\/math\/serialization\/VectorSerializer.h>\n\n#include <vector>\n#include <sstream>\n#include <string>\n#include <iostream>\n\nvoid ConvertSpMat(std::vector<size_t>& row, std::vector<size_t>& col, std::vector<double>& val, blaze::CompressedMatrix<double>& mat) {\n\tuint non_zeros = mat.nonZeros();\n\trow.clear();\n\tcol.clear();\n\tval.clear();\n\tuint count = 0;\n\tfor (int i = 0; i < mat.rows(); ++i) {\n\t\trow.push_back(count);\n\t\tfor (blaze::CompressedMatrix<double>::Iterator it = mat.begin(i); it != mat.end(i); ++it) {\n\t\t\tcol.push_back(it->index());\n\t\t\tval.push_back(it->value());\n\t\t\tcount++;\n\t\t}\n\t}\n\trow.push_back(count);\n}\n\n\nstd::string slurp(std::string fname){\n\tstd::ifstream file(fname.c_str());\n\tstd::string buffer((std::istreambuf_iterator<char>(file)), std::istreambuf_iterator<char>());\n\treturn buffer;\n}\n\n\nvoid readSPMAT(std::string & data, blaze::CompressedMatrix<double> & mat){\n\tstd::stringstream ss(data);\n\n\tuint rows, cols, nonzeros;\n\tss>>rows>>cols>>nonzeros;\n\t\/\/printf(\"INFO: rows: %d, columns: %d, non zeros: %d\\n\",rows, cols, nonzeros);\n\tmat.resize(rows,cols);\n\tmat.reserve(nonzeros);\n\tuint row_nonzeros;\n\tuint colval;\n\tdouble v;\n\n\tfor(int i=0; i<rows; i++){\n\t\tif(i%1000000==0){printf(\"%d, \",i);}\n\t\t\n\t\tss>>row_nonzeros;\n\n\t\tfor(int j=0; j<row_nonzeros; j++){\n\t\t\tss>>colval>>v;\n\t\t\tmat.append(i,colval,v);\n\t\t}\n\t\tmat.finalize(i);\n\t}\n\tprintf(\"\\n\");\n}\nvoid readVector(std::string & data, std::vector<double> & vec){\n\tstd::stringstream ss(data);\n\n\tuint size;\n\tss>>size;\n\tvec.resize(size);\n\n\t\/\/printf(\"INFO: size: %d\\n\",size);\n\tdouble v;\n\tfor(int i=0; i<size; i++){\n\t\tss>>v;\n\t\tvec[i] = v;\n\t}\n}\nint main(int argc, char* argv[]){\n\tprintf(\"start execution \\n\");\n\tvex::Context ctx(vex::Filter::Env && vex::Filter::DoublePrecision);\n\tstd::cout<<ctx<<std::endl;\n\tprintf(\"create context \\n\");\n\n\n\tblaze::CompressedMatrix<double> D_T, M_invD;\n\tstd::vector<double> g,b;\n\tprintf(\"read D^T \\n\");\n\t{\n\t\tstd::string data = slurp(\"D_T.mat\");\n\t\treadSPMAT(data, D_T);\n\t}\n\n\t{\n\t\tstd::string data = slurp(\"M_invD.mat\");\n\t\treadSPMAT(data, M_invD);\n\t}\n\t{\n\t\tstd::string data = slurp(\"gamma.vec\");\n\t\treadVector(data, g);\n\t}\n\n\t{\n\t\tstd::string data = slurp(\"b.vec\");\n\t\treadVector(data, b);\n\t}\n\n\n\tprintf(\"D_T: rows: %d, columns: %d, non zeros: %d\\n\", D_T.rows(), D_T.columns(), D_T.nonZeros());\n\tprintf(\"M_invD: rows: %d, columns: %d, non zeros: %d\\n\", M_invD.rows(), M_invD.columns(), M_invD.nonZeros());\n\tprintf(\"gamma: size: %d\\n\", g.size());\n\tprintf(\"b: size: %d\\n\", b.size());\n\n\tstd::vector<size_t> row;\n\tstd::vector<size_t> col;\n\tstd::vector<double> val;\n\n\tConvertSpMat(row, col, val, D_T);\n\tvex::SpMat<double> _D_T(ctx, D_T.rows(), D_T.columns(), row.data(), col.data(), val.data());\n\n\tConvertSpMat(row, col, val, M_invD);\n\tvex::SpMat<double> _M_invD(ctx, M_invD.rows(), M_invD.columns(), row.data(), col.data(), val.data());\n\n\tblaze::DynamicVector<double> gamma(g.size()),rhs(g.size());\n\n\tfor(int i=0; i<g.size(); i++){\n\t\tgamma[i] = g[i];\n\t\trhs[i] = b[i];\n\t}\n\tblaze::DynamicVector<double> tmp_cpu(g.size());\n\tblaze::DynamicVector<double> res_cpu(g.size());\n\tdouble start_cpu = omp_get_wtime();\n\n\n\tdouble RUNS = 1;\n\tif(argc>1){\n\t\tRUNS=atoi(argv[1]);\n\t}\n\tfor(size_t i = 0; i < RUNS; i++){\n\t\ttmp_cpu = M_invD*gamma;\n\t\tres_cpu += D_T*tmp_cpu;\n\t}\n\tdouble end_cpu = omp_get_wtime();\n\n\t\n\tvex::profiler<> prof;\n\n\tvex::vector<double> gamma_gpu(ctx,g.size());\n\tvex::vector<double> b_gpu(ctx,b.size());\n\tvex::copy(g,gamma_gpu);\n\tvex::copy(b,b_gpu);\n\tvex::vector<double> tmp_gpu(ctx,g.size());\n\tvex::vector<double> res_gpu(ctx,g.size());\n\n\n\ttmp_gpu += _M_invD*gamma_gpu;\n\ttmp_gpu = 0;\n\tres_gpu += _D_T*tmp_gpu;\n\tres_gpu = 0;\n\tprof.tic_cpu(\"GPU\");\n\tdouble start_gpu = omp_get_wtime();\n\tfor(size_t i = 0; i < RUNS; i++){\n\t\ttmp_gpu  = _M_invD*gamma_gpu;\n\t\tres_gpu  += _D_T*tmp_gpu;\n\t}\n\tctx.finish();\n\tdouble end_gpu = omp_get_wtime();\n\tdouble tot_time = prof.toc(\"GPU\");\n\tprintf(\"CPU took %f sec. time.\\n\", (end_cpu-start_cpu)\/RUNS);\n\tprintf(\"GPU took %f sec. time, %f sec time.\\n\", (end_gpu-start_gpu)\/RUNS, tot_time\/RUNS);\n\tprintf(\"Speedup: %f\\n\", (end_cpu-start_cpu) \/(end_gpu-start_gpu));\n\n\t\/\/std::vector<double> res_host(g.size());\n\n\t\/\/vex::copy(res_gpu,res_host);\n\n\n\n\n\n\t\/\/printf(\"copy\\n\");\n\t\/\/ for(int i=0; i<g.size(); i++){\n\t\/\/ \tif(res_host[i]!=res_cpu[i]){\n\t\/\/ \t\tprintf(\"%f\\n\",res_host[i]-res_cpu[i]);\n\t\/\/ \t}\n\t\/\/ }\n\n\n\n\treturn 0;\n}<|endoftext|>"}
{"text":"<commit_before>91812676-35ca-11e5-b3a3-6c40088e03e4<commit_msg>918760c2-35ca-11e5-a867-6c40088e03e4<commit_after>918760c2-35ca-11e5-a867-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  main.cpp\n\/\/  lda\n\/\/\n\/\/  Created by WEI YE on 10\/7\/13.\n\/\/  Copyright (c) 2013 WEI YE. All rights reserved.\n\/\/\n\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <opencv2\/core\/core.hpp>\n#include \"decomposition.hpp\"\n\nusing namespace std;\nusing namespace cv;\n\nbool readData(string filename, Mat_<float>& data)\n{\n    ifstream dfile;\n    dfile.open(filename.c_str(), ios::binary);\n    if (!dfile.is_open()) \n        return false;\n\n    int rows, cols, i, j;\n    dfile.read((char*)&rows, sizeof(int));\n    dfile.read((char*)&cols, sizeof(int));\n\n    if (rows <= 0 || cols <= 0) {\n        return false;\n    }\n\n    data.create(rows, cols);\n    for (i = 0; i < rows; i++) {\n        for (j = 0; j < cols; j++) {\n            dfile.read((char*)(data.ptr<float>(i)+j), sizeof(float));\n        }\n    }\n    return true;\n}\n\n\/\/ -- Input  --\n\/\/ x  -  features(N x D)\n\/\/ y  -  labels  (N x 1)\n\/\/ w  -  weights (N x 1)\n\/\/\n\/\/ -- Output --\n\/\/ W  -  transformation matrix;\n\/\/ Mi -  means of each class\nvoid fisher_lda(const Mat_<float>& x, const Mat_<int>& y, const Mat_<float>& w, Mat_<float>& W, vector<Mat_<float>>& Mi)\n{\n    int n_point = x.rows;\n    int n_dim = x.cols;\n    int n_class = *max_element(y.begin(), y.end()) + 1;\n    if (n_dim < 1|| n_class < 2 || n_point <= 1 || n_point != y.rows || n_point != w.rows){\n        string error_msg = \"Invalid training set!\";\n        CV_Error(CV_StsBadArg, error_msg);\n    }\n\n    vector<float> numPoints(n_class, 0);\n    Mat_<float> M = Mat_<float>::zeros(1, n_dim); \/\/ mean of all points\n    Mi = vector<Mat_<float>>(n_class);            \/\/ means of each class\n\n    \/\/ compute means and covariances\n    int p, c;\n    for (c = 0; c < n_class; c++)\n        Mi[c] = Mat_<float>::zeros(1, n_dim);\n    \n    for (p = 0; p < n_point; p++) {\n        c = y(p,0);\n        numPoints[c] += w(p,0);\n        Mi[c] += (x.row(p)*w(p,0));\n        M += (x.row(p)*w(p,0));\n    }\n\n    for (c = 0; c < n_class; c++)\n        Mi[c] \/= numPoints[c];\n    M \/= n_point;\n    \n    \/\/ compute within-class scatter matrix Sw = sum{ Si }\n    Mat_<float> subMean(n_point, n_dim);\n    for (p = 0; p < n_point; p++) {\n        c = y(p,0);\n        subMean.row(p) = x.row(p) - Mi[c];\n    }\n    Mat_<float> Sw = subMean.t()*subMean;\n\n    \/\/ compute between-class scatter matrix Sb\n    Mat_<float> Sb(Mat_<float>::zeros(n_dim, n_dim));\n    for (c = 0; c < n_class; c++) {\n        Mat_<float> diff = Mi[c] - M;\n        Sb += numPoints[c]*(diff.t()*diff);\n    }\n\n    \/\/ compute eigen values\/vectors for Sw^-1*Sb\n    Mat_<float> eigenValues;\n    if (abs(determinant(Sw)) > 1e-3) {\n        \/\/ eigen(Sw.inv()*Sb, eigenValues, W); \/\/ Wrong! OpenCV's \"eigen\" function only apply for symmetric matrix\n        EigenvalueDecomposition eig(Sw.inv()*Sb);\n        Mat eigVal = eig.eigenvalues();\n        Mat eigVec = eig.eigenvectors();\n        eigVal = eigVal.reshape(1, 1);\n        Mat order_des;\n        sortIdx(eigVal, order_des, CV_SORT_EVERY_ROW + CV_SORT_DESCENDING);\n        W = Mat_<float>(n_dim, n_dim);\n        for (int i = 0; i < n_dim; i++) {\n            eigVec.col(order_des.at<int>(0,i)).copyTo(W.col(i));\n        }\n    }else{ \/\/ Sw is a singular matrix\n        string err_msg = \"Sw is invertible!\";\n        CV_Error(CV_StsError, err_msg);\n    }\n}\n\n\n\n\/\/ -- Input  --\n\/\/ X    -  single test data point\n\/\/ Mi_p -  projected means of each class\n\/\/\n\/\/ -- Return --\n\/\/ label of X\n\nint predict(const Mat_<float>& X, const vector<Mat_<float>>& Mi_p)\n{\n    double min_dist = norm(X - Mi_p[0]);\n    int label = 0;\n    for (int c = 1; c < Mi_p.size(); c++) {\n        double dist = norm(X - Mi_p[c]);\n        if (dist < min_dist) {\n            min_dist = dist;\n            label = c;\n        }\n    }\n    return label;\n}\n\nint main()\n{\n    Mat_<float> data, W;\n    vector<Mat_<float>> Mi;\n    if (!readData(\"\/Users\/weiye\/Documents\/YEWEI\/practice\/LDA\/0_CEHOG1-B16.featbin\", data))\n        return 1;\n\/\/    data = (Mat_<float>(11,2) << 1,2,2,3,3,3,4,5,5,5,1,0,2,1,3,1,3,2,5,3,6,5);\n\n    Mat_<int> labels(data.rows, 1);\n    labels.rowRange(0, 1816).setTo(0);\n    labels.rowRange(1816, data.rows).setTo(1);\n    \n    Mat_<float> weights(Mat_<float>::ones(data.rows, 1));\n    \n    fisher_lda(data, labels, weights, W, Mi);\n    \n    vector<Mat_<float>> Mi_p(2);\n    int N = 1;\n    Mat_<float> w = W.colRange(0, N);\n    for (int c = 0; c < Mi.size(); c++) \n        Mi_p[c] = Mi[c]*w;\n\n    double n_correct = 0.0;\n    for (int p = 0; p < data.rows; p++)\n        if (predict(data.row(p)*w, Mi_p) == labels(p,0))\n            n_correct++;\n\n    cout<<Mi_p[0]<<Mi_p[1]<<endl;\n    double accuracy = n_correct\/data.rows;\n    cout<<\"Accuracy = \"<<accuracy*100.0<<\"%\"<<endl;\n    return 0;\n}\n<commit_msg>Minor fix<commit_after>\/\/\n\/\/  main.cpp\n\/\/  lda\n\/\/\n\/\/  Created by WEI YE on 10\/7\/13.\n\/\/  Copyright (c) 2013 WEI YE. All rights reserved.\n\/\/\n\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <opencv2\/core\/core.hpp>\n#include \"decomposition.hpp\"\n\nusing namespace std;\nusing namespace cv;\n\nbool readData(string filename, Mat_<float>& data)\n{\n    ifstream dfile;\n    dfile.open(filename.c_str(), ios::binary);\n    if (!dfile.is_open()) \n        return false;\n\n    int rows, cols, i, j;\n    dfile.read((char*)&rows, sizeof(int));\n    dfile.read((char*)&cols, sizeof(int));\n\n    if (rows <= 0 || cols <= 0) {\n        return false;\n    }\n\n    data.create(rows, cols);\n    for (i = 0; i < rows; i++) {\n        for (j = 0; j < cols; j++) {\n            dfile.read((char*)(data.ptr<float>(i)+j), sizeof(float));\n        }\n    }\n    return true;\n}\n\n\/\/ -- Input  --\n\/\/ x  -  features(N x D)\n\/\/ y  -  labels  (N x 1)\n\/\/ w  -  weights (N x 1)\n\/\/\n\/\/ -- Output --\n\/\/ W  -  transformation matrix;\n\/\/ Mi -  means of each class\nvoid fisher_lda(const Mat_<float>& x, const Mat_<int>& y, const Mat_<float>& w, Mat_<float>& W, vector<Mat_<float>>& Mi)\n{\n    int n_point = x.rows;\n    int n_dim = x.cols;\n    int n_class = *max_element(y.begin(), y.end()) + 1;\n    if (n_dim < 1|| n_class < 2 || n_point <= 1 || n_point != y.rows || n_point != w.rows){\n        string error_msg = \"Invalid training set!\";\n        CV_Error(CV_StsBadArg, error_msg);\n    }\n\n    vector<float> numPoints(n_class, 0);\n    Mat_<float> M = Mat_<float>::zeros(1, n_dim); \/\/ mean of all points\n    Mi = vector<Mat_<float>>(n_class);            \/\/ means of each class\n\n    \/\/ compute means and covariances\n    int p, c;\n    for (c = 0; c < n_class; c++)\n        Mi[c] = Mat_<float>::zeros(1, n_dim);\n    \n    for (p = 0; p < n_point; p++) {\n        c = y(p,0);\n        numPoints[c] += w(p,0);\n        Mi[c] += (x.row(p)*w(p,0));\n        M += (x.row(p)*w(p,0));\n    }\n\n    for (c = 0; c < n_class; c++)\n        Mi[c] \/= numPoints[c];\n    M \/= n_point;\n    \n    \/\/ compute within-class scatter matrix Sw = sum{ Si }\n    Mat_<float> subMean(n_point, n_dim);\n    for (p = 0; p < n_point; p++) {\n        c = y(p,0);\n        subMean.row(p) = x.row(p) - Mi[c];\n    }\n    Mat_<float> Sw = subMean.t()*subMean;\n\n    \/\/ compute between-class scatter matrix Sb\n    Mat_<float> Sb(Mat_<float>::zeros(n_dim, n_dim));\n    for (c = 0; c < n_class; c++) {\n        Mat_<float> diff = Mi[c] - M;\n        Sb += numPoints[c]*(diff.t()*diff);\n    }\n\n    \/\/ compute eigen values\/vectors for Sw^-1*Sb\n    Mat_<float> eigenValues;\n    if (abs(determinant(Sw)) > 1e-3) {\n        \/\/ eigen(Sw.inv()*Sb, eigenValues, W); \/\/ Wrong! OpenCV's \"eigen\" function only apply for symmetric matrix\n        EigenvalueDecomposition eig(Sw.inv()*Sb);\n        Mat eigVal = eig.eigenvalues();\n        Mat eigVec = eig.eigenvectors();\n        eigVal = eigVal.reshape(1, 1);\n        Mat order_des;\n        sortIdx(eigVal, order_des, CV_SORT_EVERY_ROW + CV_SORT_DESCENDING);\n        W = Mat_<float>(n_dim, n_dim);\n        for (int i = 0; i < n_dim; i++) {\n            eigVec.col(order_des.at<int>(0,i)).copyTo(W.col(i));\n        }\n    }else{ \/\/ Sw is a singular matrix\n        string err_msg = \"Sw is invertible!\";\n        CV_Error(CV_StsError, err_msg);\n    }\n}\n\n\n\n\/\/ -- Input  --\n\/\/ X    -  single test data point\n\/\/ Mi_p -  projected means of each class\n\/\/\n\/\/ -- Return --\n\/\/ label of X\n\nint predict(const Mat_<float>& X, const vector<Mat_<float>>& Mi_p)\n{\n    double min_dist = norm(X - Mi_p[0]);\n    int label = 0;\n    for (int c = 1; c < Mi_p.size(); c++) {\n        double dist = norm(X - Mi_p[c]);\n        if (dist < min_dist) {\n            min_dist = dist;\n            label = c;\n        }\n    }\n    return label;\n}\n\nint main()\n{\n    Mat_<float> data, W;\n    vector<Mat_<float>> Mi;\n    if (!readData(\"~\/Documents\/LDA\/0_CEHOG1-B16.featbin\", data))\n        return 1;\n\/\/    data = (Mat_<float>(11,2) << 1,2,2,3,3,3,4,5,5,5,1,0,2,1,3,1,3,2,5,3,6,5);\n\n    Mat_<int> labels(data.rows, 1);\n    labels.rowRange(0, 1816).setTo(0);\n    labels.rowRange(1816, data.rows).setTo(1);\n    \n    Mat_<float> weights(Mat_<float>::ones(data.rows, 1));\n    \n    fisher_lda(data, labels, weights, W, Mi);\n    \n    vector<Mat_<float>> Mi_p(2);\n    int N = 1;\n    Mat_<float> w = W.colRange(0, N);\n    for (int c = 0; c < Mi.size(); c++) \n        Mi_p[c] = Mi[c]*w;\n\n    double n_correct = 0.0;\n    for (int p = 0; p < data.rows; p++)\n        if (predict(data.row(p)*w, Mi_p) == labels(p,0))\n            n_correct++;\n\n    cout<<Mi_p[0]<<Mi_p[1]<<endl;\n    double accuracy = n_correct\/data.rows;\n    cout<<\"Accuracy = \"<<accuracy*100.0<<\"%\"<<endl;\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * Copyright 2013 KanMemo Project.\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#include \"mainwindow.h\"\r\n#include <QApplication>\r\n#include <QtCore\/QTranslator>\r\n#include <QtCore\/QLocale>\r\n#include <QQmlEngine>\r\n\r\n#include \"operatingsystem.h\"\r\n#include \"clipcursor.h\"\r\n#include \"qmlfile.h\"\r\n\r\n#include <QDebug>\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n    QApplication app(argc, argv);\r\n\r\n#if defined(Q_OS_MAC)\r\n    \/\/Mac OS X 用のパスを作成する\r\n    QString dir = QString(\"%1\/i18n\")\r\n            .arg(QCoreApplication::applicationDirPath());\r\n#else\r\n    \/\/Windows とLinux 用のパスを作成する\r\n    QString dir(\"i18n\");\r\n#endif\r\n    QTranslator translator;\r\n    \/\/言語ファイルの読み込み\r\n    translator.load(QString(\"qt_%1\" ).arg(QLocale::system().name()), dir);\r\n    \/\/言語データを登録する\r\n    app.installTranslator(&translator);\r\n    \/\/Qt標準機能の日本語化(QWebPageとか)\r\n    QTranslator translator2;\r\n    translator2.load(QString(\"qt_ja\" ), dir);\r\n    app.installTranslator(&translator2);\r\n\r\n    qmlRegisterType<OperatingSystem>(\"jp.relog.plugin.operatingsystem\"\r\n                                     , 1, 0, \"OperatingSystem\");\r\n    qmlRegisterType<ClipCursor>(\"jp.relog.plugin.clipcursor\"\r\n                                , 1, 0, \"ClipCursor\");\r\n    qmlRegisterType<QMLFile>(\"jp.relog.plugin.qmlfile\", 1, 0, \"QMLFile\");\r\n\r\n    MainWindow w;\r\n    w.show();\r\n    \r\n    return app.exec();\r\n}\r\n<commit_msg>Updated to pre-create the save folder of user data<commit_after>\/*\r\n * Copyright 2013 KanMemo Project.\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#include \"mainwindow.h\"\r\n#include <QApplication>\r\n#include <QtCore\/QTranslator>\r\n#include <QtCore\/QLocale>\r\n#include <QQmlEngine>\r\n#include <QStandardPaths>\r\n#include <QDir>\r\n\r\n#include \"operatingsystem.h\"\r\n#include \"clipcursor.h\"\r\n#include \"qmlfile.h\"\r\n\r\n#include <QDebug>\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n    QApplication app(argc, argv);\r\n\r\n#if defined(Q_OS_MAC)\r\n    \/\/Mac OS X 用のパスを作成する\r\n    QString dir = QString(\"%1\/i18n\")\r\n            .arg(QCoreApplication::applicationDirPath());\r\n#else\r\n    \/\/Windows とLinux 用のパスを作成する\r\n    QString dir(\"i18n\");\r\n#endif\r\n    QTranslator translator;\r\n    \/\/言語ファイルの読み込み\r\n    translator.load(QString(\"qt_%1\" ).arg(QLocale::system().name()), dir);\r\n    \/\/言語データを登録する\r\n    app.installTranslator(&translator);\r\n    \/\/Qt標準機能の日本語化(QWebPageとか)\r\n    QTranslator translator2;\r\n    translator2.load(QString(\"qt_ja\" ), dir);\r\n    app.installTranslator(&translator2);\r\n\r\n    qmlRegisterType<OperatingSystem>(\"jp.relog.plugin.operatingsystem\"\r\n                                     , 1, 0, \"OperatingSystem\");\r\n    qmlRegisterType<ClipCursor>(\"jp.relog.plugin.clipcursor\"\r\n                                , 1, 0, \"ClipCursor\");\r\n    qmlRegisterType<QMLFile>(\"jp.relog.plugin.qmlfile\", 1, 0, \"QMLFile\");\r\n\r\n    \/\/ダウンロードデータなどの保存場所のディレクトリを作成しておく\r\n    QDir location(QStandardPaths::writableLocation(QStandardPaths::DataLocation));\r\n    if(!location.exists()){\r\n        location.mkdir(QStandardPaths::writableLocation(QStandardPaths::DataLocation));\r\n    }\r\n\r\n    MainWindow w;\r\n    w.show();\r\n    \r\n    return app.exec();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>92323ba3-2d14-11e5-af21-0401358ea401<commit_msg>92323ba4-2d14-11e5-af21-0401358ea401<commit_after>92323ba4-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <stdexcept>\n#include <sstream>\n#include <string>\n#include <map>\n\n\n#include \"vm\/context.hpp\"\n#include \"renderer\/sdl2_renderer.hpp\"\n#include \"serializer\/serializer.hpp\"\n\n#ifdef __EMSCRIPTEN__\n#include <emscripten.h>\n#endif\nusing namespace yagbe;\n\ncontext ctx;\nsdl2_renderer renderer(gpu::screen_size());\n\n#ifdef __EMSCRIPTEN__\nemscripten_serializer saves(ctx);\n#else\nfilesave_serializer saves(ctx);\n#endif\n\n\nbool loaded_rom = false;\n\n\n\nvoid one_iter()\n{\n\tif (!loaded_rom)\n\t\treturn;\n\trenderer.next_frame();\n\twhile (renderer.step() && !renderer.frame_drawn())\n\t{\n\t\tfor(int i = 0; i < 10; i ++)\n\t\t\tctx.cpu_step();\n\t}\n}\n\nint main(int argc, char * argv[])\n{\n\n\tstd::map<SDL_Keycode, key_handler::key> keys = {\n\t\t{ SDLK_LEFT, key_handler::key::Left },\n\t\t{ SDLK_RIGHT, key_handler::key::Right },\n\t\t{ SDLK_UP, key_handler::key::Up },\n\t\t{ SDLK_DOWN, key_handler::key::Down },\n\n\t\t{ SDLK_a, key_handler::key::Select },\n\t\t{ SDLK_s, key_handler::key::Start },\n\t\t{ SDLK_z, key_handler::key::A },\n\t\t{ SDLK_x, key_handler::key::B },\n\t};\n\n\tstd::string path = YAGBE_ROMS;\n\n\t\/\/path += \"..\/test_roms\/individual\/01-special.gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/individual\/02-interrupts.gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/individual\/03-op sp,hl.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/04-op r,imm.gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/individual\/05-op rp.gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/individual\/06-ld r,r.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/07-jr,jp,call,ret,rst.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/08-misc instrs.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/09-op r,r.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/10-bit ops.gb\"; \/\/PASSED\n\t\n\t\/\/path += \"..\/test_roms\/individual\/11-op a,(hl).gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/instr_timing.gb\"; \/\/FAILED, timer doesn't work properly\n\n\n\t\/\/path += \"hangman.gb\";\n\t\/\/path += \"sml.gb\";\n\n\tpath += \"adjtris.gb\";\n\n\trenderer.initialize(ctx);\n\n\trenderer.onKeyChanged = [&](SDL_Keycode c, bool v, const sdl2_renderer::key_info& info)\n\t{\n\t\tif (c >= SDLK_0 && c <= SDLK_9 && v)\n\t\t{\n\t\t\tint index = c - SDLK_0;\n\t\t\tif (info.shift)\n\t\t\t\tsaves.save_state(index);\n\t\t\telse\n\t\t\t\tsaves.load_state(index);\n\t\t}\n\n\t\tauto it = keys.find(c);\n\t\tif (it != keys.end())\n\t\t\tctx.key_handler.set_key(it->second, v);\n\t};\n\n\t\n#ifdef __EMSCRIPTEN__\n\tint raw_url = EM_ASM_INT({\n\t\tvar getQueryString = function(field, url) {\n\t\t\tvar href = url ? url : window.location.href;\n\t\t\tvar reg = new RegExp('[?&]' + field + '=([^&#]*)', 'i');\n\t\t\tvar string = reg.exec(href);\n\t\t\treturn string ? string[1] : null;\n\t\t};\n\n\t\tvar url = getQueryString(\"url\") || \"\";\n\t\treturn allocate(intArrayFromString(url), 'i8', ALLOC_NORMAL);\n\t});\n\n\tstd::cout << \"Starting emulator...\" << std::endl;\n\tstd::string url = (const char*)raw_url;\n\tfree(raw_url);\n\tif (!url.empty())\n\t{\n\t\tstd::cout << \"Getting rom from: \" << url << std::endl;\n\n\t\tauto onLoad = [](void*, void* b, int s)\n\t\t{\n\t\t\tstd::cout << \"Done.\" << std::endl;\n\t\t\tauto rom_info = ctx.load_rom((uint8_t*)b, s);\n\t\t\tif (rom_info)\n\t\t\t{\n\t\t\t\tloaded_rom = true;\n\t\t\t\tstd::cout << \"Loaded OK, name: \" << rom_info->game_title() << std::endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tstd::cout << \"Loading failed\" << std::endl;\n\t\t};\n\n\t\tauto onError = [](void*)\n\t\t{\n\t\t\tstd::cout << \"Error.\" << std::endl;\n\t\t};\n\n\n\t\temscripten_async_wget_data(url.c_str(), nullptr, onLoad, onError);\n\t}\n\telse\n\t{\n\t\tstd::cout << \"Loading built-in rom\" << std::endl;\n\t\tauto rom_info = ctx.load_rom(path);\n\t\tif (!rom_info)\n\t\t\treturn -1;\n\t\tstd::cout << \"Loaded built-in OK, name: \" << rom_info->game_title() << std::endl;\n\t\tloaded_rom = ctx.load_rom(path);\n\t}\n\t\t\n\n\n\temscripten_set_main_loop(one_iter, 0, 1);\n#else\n\tauto rom_info = ctx.load_rom(path);\n\tif (!rom_info)\n\t\treturn -1;\n\tloaded_rom = true;\n\n\twhile (renderer.running())\n\t\tone_iter();\n#endif\n\n\treturn 0;\n}\n\n\n\/*\nLeft to do:\n- 16h sprites\n- RAM & timers in MBC1-3\n\n-sound\n*\/<commit_msg>Fix compilation.<commit_after>#include <iostream>\n#include <stdexcept>\n#include <sstream>\n#include <string>\n#include <map>\n\n\n#include \"vm\/context.hpp\"\n#include \"renderer\/sdl2_renderer.hpp\"\n#include \"serializer\/serializer.hpp\"\n\n#ifdef __EMSCRIPTEN__\n#include <emscripten.h>\n#endif\nusing namespace yagbe;\n\ncontext ctx;\nsdl2_renderer renderer(gpu::screen_size());\n\n#ifdef __EMSCRIPTEN__\nemscripten_serializer saves(ctx);\n#else\nfilesave_serializer saves(ctx);\n#endif\n\n\nbool loaded_rom = false;\n\n\n\nvoid one_iter()\n{\n\tif (!loaded_rom)\n\t\treturn;\n\trenderer.next_frame();\n\twhile (renderer.step() && !renderer.frame_drawn())\n\t{\n\t\tfor(int i = 0; i < 10; i ++)\n\t\t\tctx.cpu_step();\n\t}\n}\n\nint main(int argc, char * argv[])\n{\n\n\tstd::map<SDL_Keycode, key_handler::key> keys = {\n\t\t{ SDLK_LEFT, key_handler::key::Left },\n\t\t{ SDLK_RIGHT, key_handler::key::Right },\n\t\t{ SDLK_UP, key_handler::key::Up },\n\t\t{ SDLK_DOWN, key_handler::key::Down },\n\n\t\t{ SDLK_a, key_handler::key::Select },\n\t\t{ SDLK_s, key_handler::key::Start },\n\t\t{ SDLK_z, key_handler::key::A },\n\t\t{ SDLK_x, key_handler::key::B },\n\t};\n\n\tstd::string path = YAGBE_ROMS;\n\n\t\/\/path += \"..\/test_roms\/individual\/01-special.gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/individual\/02-interrupts.gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/individual\/03-op sp,hl.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/04-op r,imm.gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/individual\/05-op rp.gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/individual\/06-ld r,r.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/07-jr,jp,call,ret,rst.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/08-misc instrs.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/09-op r,r.gb\"; \/\/PASSED\n\n\t\/\/path += \"..\/test_roms\/individual\/10-bit ops.gb\"; \/\/PASSED\n\t\n\t\/\/path += \"..\/test_roms\/individual\/11-op a,(hl).gb\"; \/\/PASSED\n\t\/\/path += \"..\/test_roms\/instr_timing.gb\"; \/\/FAILED, timer doesn't work properly\n\n\n\t\/\/path += \"hangman.gb\";\n\t\/\/path += \"sml.gb\";\n\n\tpath += \"adjtris.gb\";\n\n\trenderer.initialize(ctx);\n\n\trenderer.onKeyChanged = [&](SDL_Keycode c, bool v, const sdl2_renderer::key_info& info)\n\t{\n\t\tif (c >= SDLK_0 && c <= SDLK_9 && v)\n\t\t{\n\t\t\tint index = c - SDLK_0;\n\t\t\tif (info.shift)\n\t\t\t\tsaves.save_state(index);\n\t\t\telse\n\t\t\t\tsaves.load_state(index);\n\t\t}\n\n\t\tauto it = keys.find(c);\n\t\tif (it != keys.end())\n\t\t\tctx.key_handler.set_key(it->second, v);\n\t};\n\n\t\n#ifdef __EMSCRIPTEN__\n\tint raw_url = EM_ASM_INT({\n\t\tvar getQueryString = function(field, url) {\n\t\t\tvar href = url ? url : window.location.href;\n\t\t\tvar reg = new RegExp('[?&]' + field + '=([^&#]*)', 'i');\n\t\t\tvar string = reg.exec(href);\n\t\t\treturn string ? string[1] : null;\n\t\t};\n\n\t\tvar url = getQueryString(\"url\") || \"\";\n\t\treturn allocate(intArrayFromString(url), 'i8', ALLOC_NORMAL);\n\t});\n\n\tstd::cout << \"Starting emulator...\" << std::endl;\n\tstd::string url = (const char*)raw_url;\n\tfree((void*)raw_url);\n\tif (!url.empty())\n\t{\n\t\tstd::cout << \"Getting rom from: \" << url << std::endl;\n\n\t\tauto onLoad = [](void*, void* b, int s)\n\t\t{\n\t\t\tstd::cout << \"Done.\" << std::endl;\n\t\t\tauto rom_info = ctx.load_rom((uint8_t*)b, s);\n\t\t\tif (rom_info)\n\t\t\t{\n\t\t\t\tloaded_rom = true;\n\t\t\t\tstd::cout << \"Loaded OK, name: \" << rom_info->game_title() << std::endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tstd::cout << \"Loading failed\" << std::endl;\n\t\t};\n\n\t\tauto onError = [](void*)\n\t\t{\n\t\t\tstd::cout << \"Error.\" << std::endl;\n\t\t};\n\n\n\t\temscripten_async_wget_data(url.c_str(), nullptr, onLoad, onError);\n\t}\n\telse\n\t{\n\t\tstd::cout << \"Loading built-in rom\" << std::endl;\n\t\tauto rom_info = ctx.load_rom(path);\n\t\tif (!rom_info)\n\t\t\treturn -1;\n\t\tstd::cout << \"Loaded built-in OK, name: \" << rom_info->game_title() << std::endl;\n\t\tloaded_rom = ctx.load_rom(path);\n\t}\n\t\t\n\n\n\temscripten_set_main_loop(one_iter, 0, 1);\n#else\n\tauto rom_info = ctx.load_rom(path);\n\tif (!rom_info)\n\t\treturn -1;\n\tloaded_rom = true;\n\n\twhile (renderer.running())\n\t\tone_iter();\n#endif\n\n\treturn 0;\n}\n\n\n\/*\nLeft to do:\n- 16h sprites\n- RAM & timers in MBC1-3\n\n-sound\n*\/<|endoftext|>"}
{"text":"<commit_before>2f60baa4-5216-11e5-b4b9-6c40088e03e4<commit_msg>2f679a66-5216-11e5-8887-6c40088e03e4<commit_after>2f679a66-5216-11e5-8887-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>1bf3e51e-585b-11e5-800e-6c40088e03e4<commit_msg>1bfc0ca2-585b-11e5-8ee7-6c40088e03e4<commit_after>1bfc0ca2-585b-11e5-8ee7-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>748909b3-2749-11e6-b589-e0f84713e7b8<commit_msg>Finished?<commit_after>7499e340-2749-11e6-9961-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>ea32ede2-585a-11e5-97c0-6c40088e03e4<commit_msg>ea39948a-585a-11e5-8090-6c40088e03e4<commit_after>ea39948a-585a-11e5-8090-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n#include \"Signal.hpp\"\n\nclass Foo\n{\n    public:\n    \n\tFoo() {}\n\n    void bar(int x, int y)\n    {\n        printf(\"Foo::bar(%d, %d)\\n\", x, y);\n    }\n};\n\nvoid foobar(int x, int y)\n{\n    printf(\"foobar(%d, %d)\\n\", x, y);\n}\n\nint main(void)\n{\n\tFoo foo;\n    Signal<int, int> s;\n\t\n\t\/\/ Connect a function\n    s.connect(foobar);\n    \n    \/\/ Connect a class method\n    s.connect(&foo, &Foo::bar);\n    \n    \/\/ Create and connect some lambda expression\n    s.connect([&foo](int x, int y){ \n        printf(\"lambda::\"); foo.bar(x, y); \n    });\n    \n    \/\/ Emit the signal !\n    s.emit(4, 2);\n    \n    return 0;\n}\n<commit_msg>correct indentation<commit_after>#include <cstdio>\n#include \"Signal.hpp\"\n\nclass Foo\n{\n    public:\n    \n\tFoo() {}\n\n    void bar(int x, int y)\n    {\n        printf(\"Foo::bar(%d, %d)\\n\", x, y);\n    }\n};\n\nvoid foobar(int x, int y)\n{\n    printf(\"foobar(%d, %d)\\n\", x, y);\n}\n\nint main(void)\n{\n    Foo foo;\n    Signal<int, int> s;\n\t\n    \/\/ Connect a function\n    s.connect(foobar);\n    \n    \/\/ Connect a class method\n    s.connect(&foo, &Foo::bar);\n    \n    \/\/ Create and connect some lambda expression\n    s.connect([&foo](int x, int y){ \n        printf(\"lambda::\"); foo.bar(x, y); \n    });\n    \n    \/\/ Emit the signal !\n    s.emit(4, 2);\n    \n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>5d286673-2d16-11e5-af21-0401358ea401<commit_msg>5d286674-2d16-11e5-af21-0401358ea401<commit_after>5d286674-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>3fab1475-2e4f-11e5-b25b-28cfe91dbc4b<commit_msg>3fb17026-2e4f-11e5-932d-28cfe91dbc4b<commit_after>3fb17026-2e4f-11e5-932d-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>5e58949d-2d16-11e5-af21-0401358ea401<commit_msg>5e58949e-2d16-11e5-af21-0401358ea401<commit_after>5e58949e-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>c7f4c83d-327f-11e5-862c-9cf387a8033e<commit_msg>c7fb7aba-327f-11e5-bea6-9cf387a8033e<commit_after>c7fb7aba-327f-11e5-bea6-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>d87eba7a-35ca-11e5-975e-6c40088e03e4<commit_msg>d8885648-35ca-11e5-bd69-6c40088e03e4<commit_after>d8885648-35ca-11e5-bd69-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>78ebb88a-2d53-11e5-baeb-247703a38240<commit_msg>78ec380a-2d53-11e5-baeb-247703a38240<commit_after>78ec380a-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>27c42287-2e4f-11e5-b2ab-28cfe91dbc4b<commit_msg>27caafae-2e4f-11e5-ac8c-28cfe91dbc4b<commit_after>27caafae-2e4f-11e5-ac8c-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>31d35312-5216-11e5-ab2a-6c40088e03e4<commit_msg>31da2c8c-5216-11e5-bb3f-6c40088e03e4<commit_after>31da2c8c-5216-11e5-bb3f-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>10ee4b42-2e4f-11e5-a137-28cfe91dbc4b<commit_msg>10f5e245-2e4f-11e5-9c0a-28cfe91dbc4b<commit_after>10f5e245-2e4f-11e5-9c0a-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <map>\n#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include \"document.h\"\n\nextern FILE * xmlin;\nextern int xmlparse(Document **);\n\nstatic std::string help_message = \"Available commands are:\\n\\\n..\/xmltool -p file.xml : parse and display the xml file\\n\\\n..\/xmltool -v file.xml file.xsd : parse both xml and xsd files and display the validation result\\n\\\n..\/xmltool -t file.xml file.xsl : parse both xml and xsl files and display de transformation result of file.xml by the stylesheet file.xsl\\n\\\n..\/xmltool -h : displays this help\\n\";\n\nstatic int handle_help(int, const char **);\nstatic int handle_validate(int, const char **);\nstatic int handle_process(int, const char **);\nstatic int handle_transform(int, const char **);\n\n\/\/ Valid commands (no dash character)\ntypedef int (*command_handler)(int, const char **) ;\nstatic std::map<std::string, command_handler> command_map = {\n  { \"h\", handle_help},\n  { \"v\", handle_validate },\n  { \"p\", handle_process },\n  { \"t\", handle_transform }\n};\n\nint main(int argc, const char ** argv)\n{\n  \/\/ Command must be given\n  if (argc < 2)\n  {\n    std::cerr << \"Missing option parameter!\" << std::endl\n      \/\/<< help_message << std::endl\n    ;\n    return EXIT_FAILURE;\n  }\n\n  \/\/ Command must be handled\n  std::string cmd(argv[1] + 1);\n  std::map<std::string, command_handler>::const_iterator it;\n  if ((it = command_map.find(cmd)) == command_map.end())\n  {\n    std::cerr << \"Bad option parameter!\" << std::endl\n      << help_message << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  \/\/ Call command handler, making argc and argv correspond\n  int nb_ignored = 2;\n  argc -= nb_ignored;\n  argv += nb_ignored;\n  return it->second(argc, argv);\n}\n\nint handle_help(int, const char **)\n{\n  std::cerr << help_message;\n  return 1;\n}\n\nstatic Document * read_document(const char * fname)\n{\n  \/\/ Change xmlparse input\n  FILE * fp = fopen(fname, \"r\");\n  if (fp == nullptr)\n  {\n    return nullptr;\n  }\n  xmlin = fp;\n\n  \/\/ Construct document\n  Document * doc = nullptr;\n  xmlparse(&doc); \/\/ who gives a f**k about the return code ?\n\n  \/\/ TODO semantic analysis\n\n  return doc;\n}\n\nint handle_process(int argc, const char ** argv)\n{\n  if (argc < 1)\n  {\n    std::cerr << \"Filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  \/\/ XML\n  Document * doc = read_document(argv[0]);\n  if (doc == nullptr) { return EXIT_FAILURE; }\n  std::cout << doc->str() << std::endl;\n  delete doc;\n\n  return EXIT_SUCCESS;\n}\n\nint handle_validate(int argc, const char ** argv)\n{\n  if (argc < 1)\n  {\n    std::cerr << \"XML filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n  else if (argc < 2)\n  {\n    std::cerr << \"XSD filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  \/\/ XML\/XSD\n  Document * xml_doc = read_document(argv[0]);\n  Document * xsd_doc = read_document(argv[1]);\n\n  \/\/ TODO\n\n  delete xml_doc;\n  delete xsd_doc;\n\n  return EXIT_SUCCESS;\n}\n\nint handle_transform(int argc, const char ** argv)\n{\n  if (argc < 1)\n  {\n    std::cerr << \"XML filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n  else if (argc < 2)\n  {\n    std::cerr << \"XSL filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  \/\/ XML\/XSL\n  Document * xml_doc = read_document(argv[0]);\n  Document * xsl_doc = read_document(argv[1]);\n\n  \/\/ TODO\n\n  delete xsl_doc;\n  delete xml_doc;\n\n  return EXIT_FAILURE;\n}\n\n\/\/ vim:ft=cpp et sw=2 sts=2:\n<commit_msg>2 tests !<commit_after>#include <algorithm>\n#include <map>\n#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include \"document.h\"\n\nextern FILE * xmlin;\nextern int xmlparse(Document **);\n\nstatic std::string help_message = \"Available commands are:\\n\\\n..\/xmltool -p file.xml : parse and display the xml file\\n\\\n..\/xmltool -v file.xml file.xsd : parse both xml and xsd files and display the validation result\\n\\\n..\/xmltool -t file.xml file.xsl : parse both xml and xsl files and display de transformation result of file.xml by the stylesheet file.xsl\\n\\\n..\/xmltool -h : displays this help\\n\";\n\nstatic int handle_help(int, const char **);\nstatic int handle_validate(int, const char **);\nstatic int handle_process(int, const char **);\nstatic int handle_transform(int, const char **);\n\n\/\/ Valid commands (no dash character)\ntypedef int (*command_handler)(int, const char **) ;\nstatic std::map<std::string, command_handler> command_map = {\n  { \"h\", handle_help},\n  { \"v\", handle_validate },\n  { \"p\", handle_process },\n  { \"t\", handle_transform }\n};\n\nint main(int argc, const char ** argv)\n{\n  \/\/ Command must be given\n  if (argc < 2)\n  {\n    std::cerr << \"No argument given\" << std::endl;\n    return handle_help(argc, argv);\n  }\n\n  \/\/ Command must be handled\n  std::string cmd(argv[1] + 1);\n  std::map<std::string, command_handler>::const_iterator it;\n  if ((it = command_map.find(cmd)) == command_map.end())\n  {\n    return handle_help(argc, argv);\n  }\n\n  \/\/ Call command handler, making argc and argv correspond\n  int nb_ignored = 2;\n  argc -= nb_ignored;\n  argv += nb_ignored;\n  return it->second(argc, argv);\n}\n\nint handle_help(int, const char **)\n{\n  std::cerr << help_message;\n  return 1;\n}\n\nstatic Document * read_document(const char * fname)\n{\n  \/\/ Change xmlparse input\n  FILE * fp = fopen(fname, \"r\");\n  if (fp == nullptr)\n  {\n    return nullptr;\n  }\n  xmlin = fp;\n\n  \/\/ Construct document\n  Document * doc = nullptr;\n  xmlparse(&doc); \/\/ who gives a f**k about the return code ?\n\n  \/\/ TODO semantic analysis\n\n  return doc;\n}\n\nint handle_process(int argc, const char ** argv)\n{\n  if (argc < 1)\n  {\n    std::cerr << \"Filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  \/\/ XML\n  Document * doc = read_document(argv[0]);\n  if (doc == nullptr) { return EXIT_FAILURE; }\n  std::cout << doc->str() << std::endl;\n  delete doc;\n\n  return EXIT_SUCCESS;\n}\n\nint handle_validate(int argc, const char ** argv)\n{\n  if (argc < 1)\n  {\n    std::cerr << \"XML filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n  else if (argc < 2)\n  {\n    std::cerr << \"XSD filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  \/\/ XML\/XSD\n  Document * xml_doc = read_document(argv[0]);\n  Document * xsd_doc = read_document(argv[1]);\n\n  \/\/ TODO\n\n  delete xml_doc;\n  delete xsd_doc;\n\n  return EXIT_SUCCESS;\n}\n\nint handle_transform(int argc, const char ** argv)\n{\n  if (argc < 1)\n  {\n    std::cerr << \"XML filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n  else if (argc < 2)\n  {\n    std::cerr << \"XSL filename argument required\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  \/\/ XML\/XSL\n  Document * xml_doc = read_document(argv[0]);\n  Document * xsl_doc = read_document(argv[1]);\n\n  \/\/ TODO\n\n  delete xsl_doc;\n  delete xml_doc;\n\n  return EXIT_FAILURE;\n}\n\n\/\/ vim:ft=cpp et sw=2 sts=2:\n<|endoftext|>"}
{"text":"<commit_before>984a2419-327f-11e5-b49c-9cf387a8033e<commit_msg>984ffdae-327f-11e5-ba54-9cf387a8033e<commit_after>984ffdae-327f-11e5-ba54-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>007c891c-585b-11e5-837f-6c40088e03e4<commit_msg>0083d03e-585b-11e5-9517-6c40088e03e4<commit_after>0083d03e-585b-11e5-9517-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>5899de8a-ad59-11e7-a4d4-ac87a332f658<commit_msg>Did ANOTHER thing<commit_after>590b76e3-ad59-11e7-8a6c-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>b0d2d426-327f-11e5-8d3b-9cf387a8033e<commit_msg>b0d882ae-327f-11e5-8535-9cf387a8033e<commit_after>b0d882ae-327f-11e5-8535-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>a36d173a-327f-11e5-8913-9cf387a8033e<commit_msg>a3734b0a-327f-11e5-8ab5-9cf387a8033e<commit_after>a3734b0a-327f-11e5-8ab5-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>392ce5dc-2e4f-11e5-8d20-28cfe91dbc4b<commit_msg>39336894-2e4f-11e5-96ee-28cfe91dbc4b<commit_after>39336894-2e4f-11e5-96ee-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>8c3d2057-2d14-11e5-af21-0401358ea401<commit_msg>8c3d2058-2d14-11e5-af21-0401358ea401<commit_after>8c3d2058-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>69de1454-5216-11e5-93e1-6c40088e03e4<commit_msg>69e7e6ac-5216-11e5-8441-6c40088e03e4<commit_after>69e7e6ac-5216-11e5-8441-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>1eaade45-2e4f-11e5-b141-28cfe91dbc4b<commit_msg>1eb3ad42-2e4f-11e5-a0d7-28cfe91dbc4b<commit_after>1eb3ad42-2e4f-11e5-a0d7-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>7922188a-2d53-11e5-baeb-247703a38240<commit_msg>792298d2-2d53-11e5-baeb-247703a38240<commit_after>792298d2-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>c099eacc-4b02-11e5-9fcb-28cfe9171a43<commit_msg>Nooooooooooooooooooooooooooooooooooooo<commit_after>c0a6c7c5-4b02-11e5-8d00-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>6e69b92e-2e3a-11e5-a820-c03896053bdd<commit_msg>6e775034-2e3a-11e5-8980-c03896053bdd<commit_after>6e775034-2e3a-11e5-8980-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>92323b8b-2d14-11e5-af21-0401358ea401<commit_msg>92323b8c-2d14-11e5-af21-0401358ea401<commit_after>92323b8c-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>d5840133-313a-11e5-83d5-3c15c2e10482<commit_msg>d589f333-313a-11e5-953f-3c15c2e10482<commit_after>d589f333-313a-11e5-953f-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>3e740175-ad5d-11e7-8ca6-ac87a332f658<commit_msg>Fixed that one bug<commit_after>3ef4c799-ad5d-11e7-87f8-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>d6810c4c-327f-11e5-8265-9cf387a8033e<commit_msg>d686ac11-327f-11e5-b5eb-9cf387a8033e<commit_after>d686ac11-327f-11e5-b5eb-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>ba4ea291-2e4f-11e5-80b1-28cfe91dbc4b<commit_msg>ba553edc-2e4f-11e5-8bb8-28cfe91dbc4b<commit_after>ba553edc-2e4f-11e5-8bb8-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>b8caea42-327f-11e5-ad3d-9cf387a8033e<commit_msg>b8d2608a-327f-11e5-a960-9cf387a8033e<commit_after>b8d2608a-327f-11e5-a960-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>92323b3f-2d14-11e5-af21-0401358ea401<commit_msg>92323b40-2d14-11e5-af21-0401358ea401<commit_after>92323b40-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>7c451bf8-4b02-11e5-887d-28cfe9171a43<commit_msg>Did ANOTHER thing<commit_after>7c598907-4b02-11e5-bf34-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>63ba20c6-2fa5-11e5-b75d-00012e3d3f12<commit_msg>63bbf586-2fa5-11e5-9614-00012e3d3f12<commit_after>63bbf586-2fa5-11e5-9614-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>0600f535-2e4f-11e5-9b5d-28cfe91dbc4b<commit_msg>06075033-2e4f-11e5-9544-28cfe91dbc4b<commit_after>06075033-2e4f-11e5-9544-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-\n\/\/\n\/\/ This code is public domain\n\/\/ (but note, that the led-matrix library this depends on is GPL v2)\n\n#include \"led-matrix.h\"\n#include \"threaded-canvas-manipulator.h\"\n\n#include <getopt.h>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <bass.h>\n\n#include <algorithm>\n\n#define SPECWIDTH 64 \/\/ display width (should be multiple of 4)\n#define SPECHEIGHT 32  \/\/ height (changing requires palette adjustments too)\n#define BANDS 64\n\n#define MAX(x,y) ((x > y) ? x : y)\n\n#pragma pack(1)\ntypedef struct {\n  BYTE rgbRed,rgbGreen,rgbBlue;\n} RGB;\n#pragma pack()\n\nusing namespace rgb_matrix;\n\nDWORD chan;\n\nRGB palette[] = {\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {200, 0, 0},\n  {200, 0, 0},\n  {200, 0, 0},\n  {200, 0, 0},\n  {200, 0, 0}\n};\n\nclass VolumeBars : public ThreadedCanvasManipulator {\npublic:\n  VolumeBars(Canvas *m, int delay_ms=50)\n    : ThreadedCanvasManipulator(m), delay_ms_(delay_ms),\n      numBars_(BANDS), t_(0) {\n        printf(\"I constructed\\n\");\n  }\n\n  void Run() {\n    printf(\"I started\\n\");\n    int numBars_ = BANDS;\n    int x,y,y1,y2;\n    const int width = canvas()->width();\n    height_ = canvas()->height();\n    barWidth_ = 2; \/\/width\/numBars_;\n\n    \/\/ Start the loop\n    while (running()) {\n      float fft[1024];\n      BASS_ChannelGetData(chan,fft,BASS_DATA_FFT2048); \/\/ get the FFT data\n      for (x=0;x<SPECWIDTH;x++) {\n        y=sqrt(fft[x+1])*3*SPECHEIGHT-4; \/\/ scale it (sqrt to make low values more visible)\n        \/\/ printf(\"x: %d, y: %d, y1: %d, y2: %d\\n\", x, y, y1, y2);\n        if (y>SPECHEIGHT) y=SPECHEIGHT; \/\/ cap it\n        y2 = SPECHEIGHT + 1;\n        while (--y2>MAX(y,y1)) drawBarRow(x, y2, {0,0,0});\n        if (x && (y1=(y+y1)\/2)) \/\/ interpolate from previous to make the display smoother\n          while (--y1>=0) drawBarRow(x, y1, palette[y1]);\n        y1=y;\n        while (--y>=0) drawBarRow(x, y, palette[y]); \/\/ draw level\n      }\n      usleep(delay_ms_ * 1000);\n    }\n  }\n\nprivate:\n  void drawBarRow(int bar, uint8_t y, RGB color) {\n    for (uint8_t x=bar*barWidth_; x<(bar+1)*barWidth_; ++x) {\n      canvas()->SetPixel(x, height_-1-y, color.rgbRed, color.rgbGreen, color.rgbBlue);\n    }\n  }\n\n  int delay_ms_;\n  int numBars_;\n  int barWidth_;\n  int height_;\n  int heightGreen_;\n  int heightYellow_;\n  int heightOrange_;\n  int heightRed_;\n  int t_;\n};\n\nstatic int usage(const char *progname) {\n  fprintf(stderr, \"usage: %s <options> -D <demo-nr> [optional parameter]\\n\",\n          progname);\n  fprintf(stderr, \"Options:\\n\"\n          \"\\t-r <rows>     : Display rows. 16 for 16x32, 32 for 32x32. \"\n          \"Default: 32\\n\"\n          \"\\t-c <chained>  : Daisy-chained boards. Default: 1.\\n\"\n          \"\\t-L            : 'Large' display, composed out of 4 times 32x32\\n\"\n          \"\\t-p <pwm-bits> : Bits used for PWM. Something between 1..11\\n\"\n          \"\\t-l            : Don't do luminance correction (CIE1931)\\n\"\n          \"\\t-D <demo-nr>  : Always needs to be set\\n\"\n          \"\\t-d            : run as daemon. Use this when starting in\\n\"\n          \"\\t                \/etc\/init.d, but also when running without\\n\"\n          \"\\t                terminal (e.g. cron).\\n\"\n          \"\\t-t <seconds>  : Run for these number of seconds, then exit.\\n\"\n          \"\\t       (if neither -d nor -t are supplied, waits for <RETURN>)\\n\"\n          \"\\t-w <count>    : Wait states (to throttle I\/O speed)\\n\");\n  fprintf(stderr, \"Example:\\n\\t%s -t 10 -D 1 runtext.ppm\\n\"\n          \"Scrolls the runtext for 10 seconds\\n\", progname);\n  return 1;\n}\n\nint main(int argc, char *argv[]) {\n  bool as_daemon = false;\n  int runtime_seconds = -1;\n  int demo = -1;\n  int rows = 32;\n  int chain = 1;\n  int scroll_ms = 30;\n  int pwm_bits = -1;\n  bool large_display = false;\n  bool do_luminance_correct = true;\n  uint8_t w = 0; \/\/ Use default # of write cycles\n\n  const char *demo_parameter = NULL;\n\n  int opt;\n  while ((opt = getopt(argc, argv, \"dl:t:r:p:c:m:w:L\")) != -1) {\n    switch (opt) {\n    case 'd':\n      as_daemon = true;\n      break;\n\n    case 't':\n      runtime_seconds = atoi(optarg);\n      break;\n\n    case 'r':\n      rows = atoi(optarg);\n      break;\n\n    case 'c':\n      chain = atoi(optarg);\n      break;\n\n    case 'm':\n      scroll_ms = atoi(optarg);\n      break;\n\n    case 'p':\n      pwm_bits = atoi(optarg);\n      break;\n\n    case 'l':\n      do_luminance_correct = !do_luminance_correct;\n      break;\n\n    case 'L':\n      \/\/ The 'large' display assumes a chain of four displays with 32x32\n      chain = 4;\n      rows = 32;\n      large_display = true;\n      break;\n\n    case 'w':\n      w = atoi(optarg);\n      break;\n\n    default: \/* '?' *\/\n      return usage(argv[0]);\n    }\n  }\n\n  if (optind < argc) {\n    demo_parameter = argv[optind];\n  }\n\n  if (getuid() != 0) {\n    fprintf(stderr, \"Must run as root to be able to access \/dev\/mem\\n\"\n            \"Prepend 'sudo' to the command:\\n\\tsudo %s ...\\n\", argv[0]);\n    return 1;\n  }\n\n  if (rows != 16 && rows != 32) {\n    fprintf(stderr, \"Rows can either be 16 or 32\\n\");\n    return 1;\n  }\n\n  if (chain < 1) {\n    fprintf(stderr, \"Chain outside usable range\\n\");\n    return 1;\n  }\n  if (chain > 8) {\n    fprintf(stderr, \"That is a long chain. Expect some flicker.\\n\");\n  }\n\n  \/\/ Initialize GPIO pins. This might fail when we don't have permissions.\n  GPIO io;\n  if (!io.Init())\n    return 1;\n  if(w) io.writeCycles = w;\n\n  \/\/ The matrix, our 'frame buffer' and display updater.\n  RGBMatrix *matrix = new RGBMatrix(&io, rows, chain);\n  matrix->set_luminance_correct(do_luminance_correct);\n  if (pwm_bits >= 0 && !matrix->SetPWMBits(pwm_bits)) {\n    fprintf(stderr, \"Invalid range of pwm-bits\\n\");\n    return 1;\n  }\n\n  Canvas *canvas = matrix;\n\n  \/\/ The ThreadedCanvasManipulator objects are filling\n  \/\/ the matrix continuously.\n  ThreadedCanvasManipulator *image_gen = image_gen = new VolumeBars(canvas, scroll_ms);\n\n  \/\/ initialize BASS\n  if (!BASS_Init(-1,44100,0,NULL,NULL)) {\n    printf(\"Can't initialize device\\n\");\n    return 0;\n  }\n\n  BASS_SetConfig(BASS_CONFIG_NET_PLAYLIST,1); \/\/ enable playlist processing\n  BASS_SetConfig(BASS_CONFIG_NET_PREBUF,0); \/\/ minimize automatic pre-buffering, so we can do it (and display it) instead\n\n  BASS_PluginLoad(\"libbass_aac.so\",0); \/\/ load BASS_AAC (if present) for AAC support\n\n  \/\/ Image generating demo is crated. Now start the thread.\n  image_gen->Start();\n\n  char url[1000];\n  DWORD r;\n  while (true)\n  {\n    fgets(url, sizeof(url), stdin);\n    url[strcspn(url, \"\\n\")] = 0;\n    BASS_StreamFree(chan); \/\/ close old stream\n    if (!(chan=BASS_StreamCreateURL(url,0,BASS_STREAM_BLOCK|BASS_STREAM_STATUS|BASS_STREAM_AUTOFREE,NULL,(void*)r))) {\n      printf(\"BASS Error: %d\\n\", BASS_ErrorGetCode());\n      break; \/\/TODO add proper error handling here\n    } else {\n      BASS_ChannelPlay(chan,FALSE);\n    }\n  }\n\n  BASS_Free();\n\n  \/\/ Stop image generating thread.\n  delete image_gen;\n  delete canvas;\n\n  return 0;\n}\n<commit_msg>clean up warnings<commit_after>\/\/ -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-\n\/\/\n\/\/ This code is public domain\n\/\/ (but note, that the led-matrix library this depends on is GPL v2)\n\n#include \"led-matrix.h\"\n#include \"threaded-canvas-manipulator.h\"\n\n#include <getopt.h>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <bass.h>\n\n#include <algorithm>\n\n#define SPECWIDTH 64 \/\/ display width (should be multiple of 4)\n#define SPECHEIGHT 32  \/\/ height (changing requires palette adjustments too)\n#define BANDS 64\n\n#define CHAIN 4\n#define ROWS 32\n#define REFRESH_RATE 30\n\n#define MAX(x,y) ((x > y) ? x : y)\n\n#pragma pack(1)\ntypedef struct {\n  BYTE rgbRed,rgbGreen,rgbBlue;\n} RGB;\n#pragma pack()\n\nusing namespace rgb_matrix;\n\nDWORD chan;\n\nRGB palette[] = {\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {0, 200, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {150, 150, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {250, 100, 0},\n  {200, 0, 0},\n  {200, 0, 0},\n  {200, 0, 0},\n  {200, 0, 0},\n  {200, 0, 0}\n};\n\nclass VolumeBars : public ThreadedCanvasManipulator {\npublic:\n  VolumeBars(Canvas *m, int delay_ms=50)\n    : ThreadedCanvasManipulator(m), delay_ms_(delay_ms),\n      numBars_(BANDS), t_(0) {\n  }\n\n  void Run() {\n    int x,y,y1,y2;\n    y1 = 0;\n    height_ = canvas()->height();\n    barWidth_ = 2; \/\/width\/numBars_;\n\n    \/\/ Start the loop\n    while (running()) {\n      float fft[1024];\n      BASS_ChannelGetData(chan,fft,BASS_DATA_FFT2048); \/\/ get the FFT data\n      for (x=0;x<SPECWIDTH;x++) {\n        y=sqrt(fft[x+1])*3*SPECHEIGHT-4; \/\/ scale it (sqrt to make low values more visible)\n        \/\/ printf(\"x: %d, y: %d, y1: %d, y2: %d\\n\", x, y, y1, y2);\n        if (y>SPECHEIGHT) y=SPECHEIGHT; \/\/ cap it\n        y2 = SPECHEIGHT + 1;\n        while (--y2>MAX(y,y1)) drawBarRow(x, y2, {0,0,0});\n        if (x && (y1=(y+y1)\/2)) \/\/ interpolate from previous to make the display smoother\n          while (--y1>=0) drawBarRow(x, y1, palette[y1]);\n        y1=y;\n        while (--y>=0) drawBarRow(x, y, palette[y]); \/\/ draw level\n      }\n      usleep(delay_ms_ * 1000);\n    }\n  }\n\nprivate:\n  void drawBarRow(int bar, uint8_t y, RGB color) {\n    for (uint8_t x=bar*barWidth_; x<(bar+1)*barWidth_; ++x) {\n      canvas()->SetPixel(x, height_-1-y, color.rgbRed, color.rgbGreen, color.rgbBlue);\n    }\n  }\n\n  int delay_ms_;\n  int numBars_;\n  int barWidth_;\n  int height_;\n  int heightGreen_;\n  int heightYellow_;\n  int heightOrange_;\n  int heightRed_;\n  int t_;\n};\n\nint main(int argc, char *argv[])\n{\n  if (getuid() != 0) {\n    fprintf(stderr, \"Must run as root to be able to access \/dev\/mem\\n\"\n            \"Prepend 'sudo' to the command:\\n\\tsudo %s ...\\n\", argv[0]);\n    return 1;\n  }\n\n\n  \/\/ Initialize GPIO pins. This might fail when we don't have permissions.\n  GPIO io;\n  if (!io.Init())\n    return 1;\n\n  \/\/ The matrix, our 'frame buffer' and display updater.\n  RGBMatrix *matrix = new RGBMatrix(&io, ROWS, CHAIN);\n\n  Canvas *canvas = matrix;\n\n  \/\/ The ThreadedCanvasManipulator objects are filling\n  \/\/ the matrix continuously.\n  ThreadedCanvasManipulator *image_gen = image_gen = new VolumeBars(canvas, REFRESH_RATE);\n\n  \/\/ initialize BASS\n  if (!BASS_Init(-1,44100,0,NULL,NULL)) {\n    printf(\"Can't initialize device\\n\");\n    return 0;\n  }\n\n  BASS_SetConfig(BASS_CONFIG_NET_PLAYLIST,1); \/\/ enable playlist processing\n  BASS_SetConfig(BASS_CONFIG_NET_PREBUF,0); \/\/ minimize automatic pre-buffering, so we can do it (and display it) instead\n\n  BASS_PluginLoad(\"libbass_aac.so\",0); \/\/ load BASS_AAC (if present) for AAC support\n\n  \/\/ Image generating demo is crated. Now start the thread.\n  image_gen->Start();\n\n  char url[1000];\n  DWORD r;\n  while (true)\n  {\n    fgets(url, sizeof(url), stdin);\n    url[strcspn(url, \"\\n\")] = 0;\n    BASS_StreamFree(chan); \/\/ close old stream\n    if (!(chan=BASS_StreamCreateURL(url,0,BASS_STREAM_BLOCK|BASS_STREAM_STATUS|BASS_STREAM_AUTOFREE,NULL,(void*)r))) {\n      printf(\"BASS Error: %d\\n\", BASS_ErrorGetCode());\n      break; \/\/TODO add proper error handling here\n    } else {\n      BASS_ChannelPlay(chan,FALSE);\n    }\n  }\n\n  BASS_Free();\n\n  \/\/ Stop image generating thread.\n  delete image_gen;\n  delete canvas;\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>e2e9a85e-313a-11e5-ad56-3c15c2e10482<commit_msg>e2ef9fb5-313a-11e5-83f6-3c15c2e10482<commit_after>e2ef9fb5-313a-11e5-83f6-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>6fee4ff3-2e4f-11e5-8edb-28cfe91dbc4b<commit_msg>6ff4d070-2e4f-11e5-acad-28cfe91dbc4b<commit_after>6ff4d070-2e4f-11e5-acad-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>1636859c-2e4f-11e5-a4c9-28cfe91dbc4b<commit_msg>163d754f-2e4f-11e5-b9c6-28cfe91dbc4b<commit_after>163d754f-2e4f-11e5-b9c6-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>ae2ef640-327f-11e5-9868-9cf387a8033e<commit_msg>ae391447-327f-11e5-98c8-9cf387a8033e<commit_after>ae391447-327f-11e5-98c8-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>784a11d8-2d53-11e5-baeb-247703a38240<commit_msg>784a9284-2d53-11e5-baeb-247703a38240<commit_after>784a9284-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>4d65e338-5216-11e5-8386-6c40088e03e4<commit_msg>4d6ca9c0-5216-11e5-a357-6c40088e03e4<commit_after>4d6ca9c0-5216-11e5-a357-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>d366d97a-2747-11e6-b11e-e0f84713e7b8<commit_msg>updated some files<commit_after>d38c04ae-2747-11e6-8e83-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>8350bb78-2e4f-11e5-88db-28cfe91dbc4b<commit_msg>8357668c-2e4f-11e5-b5e4-28cfe91dbc4b<commit_after>8357668c-2e4f-11e5-b5e4-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#include \"layouterXHTML.h\"\n#include \"layouterSDL.h\"\n\n#define TXT_WIDTH 700\n#define WIN_WIDTH 800\n\nint main ()\n{\n  textStyleSheet_c styleSheet;\n\n  \/\/ setze default sprache des textes\n  styleSheet.language=\"en-Engl\";\n\n  \/\/ alle Fonts, die so genutzt werden: familie heißt sans, und dann der bold Font dazu\n  styleSheet.font(\"sans\", \"\/usr\/share\/fonts\/freefont\/FreeSans.ttf\");\n  styleSheet.font(\"sans\", \"\/usr\/share\/fonts\/freefont\/FreeSansBold.ttf\", \"normal\", \"normal\", \"bold\");\n\n  \/\/ CSS regeln, immer Selector, attribut, wert\n  styleSheet.addRule(\"body\", \"color\", \"#ffffff\");\n  styleSheet.addRule(\"body\", \"font-family\", \"sans\");\n  styleSheet.addRule(\"body\", \"font-style\", \"normal\");\n  styleSheet.addRule(\"body\", \"font-size\", \"30px\");\n  styleSheet.addRule(\"body\", \"font-variant\", \"normal\");\n  styleSheet.addRule(\"body\", \"font-weight\", \"normal\");\n  styleSheet.addRule(\"body\", \"text-align\", \"justify\");\n  styleSheet.addRule(\".BigFont\", \"font-size\", \"35px\");\n  styleSheet.addRule(\".BoldFont\", \"font-weight\", \"bold\");\n  styleSheet.addRule(\"i\", \"color\", \"#ff0000\");\n  styleSheet.addRule(\"h1\", \"font-weight\", \"bold\");\n  styleSheet.addRule(\"h1\", \"font-size\", \"60px\");\n  styleSheet.addRule(\"h1\", \"text-align\", \"center\");\n\n  \/\/ der zu formatierende text\n  std::string text = u8\"<html><body>\"\n    \"<h1>Überschrift<\/h1>\"\n    \"<p>Test <i>Text<\/i> more and some \"\n    \"<div class='BoldFont'>more text so<\/div> that the pa\\u00ADra\\u00ADgraph is at least \"\n    \"<div>long<\/div> enough to span some lines on the screen let us \"\n    \"also <i>i<\/i>nclude sm hebrew נייה, העגורן הוא and back to english<\/p>\"\n    \"<p>2nd Paragraph<div class='BigFont'> with <div class='BoldFont'>a\\ndivision<\/div>\"\n    \"<\/div>.<\/p>\"\n    \"<p>a b c andnowone<i>very<\/i>longwordthatdoesntfitononelineandmight d e f °C<\/p>\"\n    \"<ul><li>First long text in an ul list of html sdfsd fsd fs dfsd f gobble di gock and\"\n    \"even more<\/li><li>Second with just a bit<\/li><\/ul>\"\n    \"<p>Margaret­Are­You­Grieving­Over­Goldengrove­Unleaving­Leaves­Like­The­Things­Of­Man­You­With­Your­Fresh­Thoughts­Care­For­Can­You­Ah­As­The­Heart­Grows­Older­It­Will­Come­To­Such­Sights­Colder­By­And­By­Nor­Spare­A­Sigh­Though­Worlds­Of­Wanwood­Leafmeal­Lie­And­Yet­You­Will­Weep­And­Know­Why­Now­No­Matter­Child­The­Name­Sorrows­Springs­Are­The­Same­Nor­Mouth­Had­No­Nor­Mind­Expressed­What­Heart­Heard­Of­Ghost­Guessed­It­Is­The­Blight­Man­Was­Born­For­It­Is­Margaret­You­Mourn­For<\/p>\"\n    \"<\/body><\/html>\";\n\n  \/\/ Vektor mit auszugebenden Text layouts, besteht immer aus einem layoute\n  \/\/ und dessen Position auf dem Bildschirm\n  std::vector<layoutInfo_c> l;\n\n  \/\/ grauer Hintergrund, damit ich sehen kann, ob der Text die korrekte Breite hat\n  \/\/ erzeuge ein künstliches Layout nur mit einem Rechteck drin... so etwas wird später\n  \/\/ nicht mehr benötigt, ist nur für den Test\n  textLayout_c la;\n  textLayout_c::commandData c;\n  c.command = textLayout_c::commandData::CMD_RECT;\n  c.x = c.y = 0;\n  c.w = TXT_WIDTH;\n  c.h = 600;\n  c.r = c.g = c.b = 50;\n  la.addCommand(c);\n  l.emplace_back(layoutInfo_c(la, (WIN_WIDTH-TXT_WIDTH)\/2, 20));\n\n  \/\/ das eigentliche Layout\n  \/\/ layoutXHTML macht die Arbeit, übergeben wird der Text, das Stylesheet und eine Klasse,\n  \/\/ die die Form des Textes beinhaltet (für nicht rechteckiges Layout\n  l.emplace_back(layoutInfo_c(layoutXHTML(text, styleSheet, rectangleShape_c(TXT_WIDTH)),\n                              (WIN_WIDTH-TXT_WIDTH)\/2, 20));\n\n  \/\/ Ausgabe mittels SDL\n  showLayoutsSelf(WIN_WIDTH, 600, l);\n}\n<commit_msg>update the test program<commit_after>#include \"layouterXHTML.h\"\n#include \"layouterSDL.h\"\n#include <boost\/concept_check.hpp>\n\n#include <fstream>\n\n#define TXT_WIDTH 700\n#define WIN_WIDTH 800\n\nusing namespace STLL;\n\nclass niftyShape_c : public shape_c\n{\npublic:\n  niftyShape_c(void) {}\n\n  virtual int32_t getLeft(int32_t top, int32_t \/*bottom*\/) const { return top\/4; }\n  virtual int32_t getRight(int32_t top, int32_t \/*bottom*\/) const { return TXT_WIDTH-top\/8; }\n};\n\nstd::pair<std::shared_ptr<uint8_t>, size_t> loadFile(const std::string & fn)\n{\n  std::ifstream f(fn.c_str());\n\n  f.seekg(0, std::ios_base::end);\n\n  auto size = f.tellg();\n\n  uint8_t * dat = new uint8_t[size];\n\n  f.seekg(0, std::ios_base::beg);\n\n  f.read((char*)dat, size);\n\n  return std::make_pair(std::shared_ptr<uint8_t>(dat, std::default_delete<uint8_t[]>()), size);\n}\n\nvoid showLayoutsSelf(int w, int h, const std::vector<layoutInfo_c> & data)\n{\n  \/* Initialize our SDL window *\/\n  if(SDL_Init(SDL_INIT_VIDEO) < 0)   {\n    fprintf(stderr, \"Failed to initialize SDL\");\n    return;\n  }\n\n  SDL_Surface *screen;\n  screen = SDL_SetVideoMode(w, h, 32, SDL_SWSURFACE | SDL_DOUBLEBUF);\n\n  \/* Enable key repeat, just makes it so we don't have to worry about fancy\n   * scanboard keyboard input and such *\/\n  SDL_EnableKeyRepeat(300, 130);\n  SDL_EnableUNICODE(1);\n\n  \/* Clear our surface *\/\n  SDL_FillRect(screen, NULL, 0 );\n\n  for (auto & a : data)\n    showLayoutSDL(a.layout, a.sx, a.sy, screen);\n\n  SDL_Flip(screen);\n\n  \/* Our main event\/draw loop *\/\n  int done = 0;\n\n  while (!done)\n  {\n\n    \/* Handle SDL events *\/\n    SDL_Event event;\n    while(SDL_PollEvent(&event))\n    {\n      switch (event.type)\n      {\n        case SDL_KEYDOWN:\n        case SDL_QUIT:\n          done = 1;\n          break;\n      }\n    }\n\n    SDL_Delay(150);\n  }\n\n  SDL_Quit();\n}\n\n\nint main ()\n{\n  textStyleSheet_c styleSheet;\n\n  \/\/ alle Fonts, die so genutzt werden: familie heißt sans, und dann der bold Font dazu\n  styleSheet.font(\"sans\", fontResource_c(\"\/usr\/share\/fonts\/freefont\/FreeSans.ttf\"));\n  styleSheet.font(\"sans\", fontResource_c(\"\/usr\/share\/fonts\/freefont\/FreeSansBold.ttf\"), \"normal\", \"normal\", \"bold\");\n  styleSheet.font(\"sans-ar\", fontResource_c(loadFile(\"fonts\/amiri-0.104\/amiri-regular.ttf\"), \"arabic\"));\n\n  \/\/ CSS regeln, immer Selector, attribut, wert\n  styleSheet.addRule(\"body\", \"color\", \"#ffffff\");\n  styleSheet.addRule(\"body\", \"font-size\", \"18px\");\n  styleSheet.addRule(\"body\", \"text-align\", \"justify\");\n  styleSheet.addRule(\"p\", \"text-indent\", \"10px\");\n  styleSheet.addRule(\"body\", \"padding\", \"10px\");\n  styleSheet.addRule(\"body\", \"background-color\", \"#303030\");\n\/\/  styleSheet.addRule(\"p\", \"padding\", \"10px\");\n\/\/  styleSheet.addRule(\"ul\", \"padding\", \"10px\");\n\/\/  styleSheet.addRule(\"li\", \"padding\", \"10px\");\n  styleSheet.addRule(\".BigFont\", \"font-size\", \"25px\");\n  styleSheet.addRule(\".BoldFont\", \"font-weight\", \"bold\");\n  styleSheet.addRule(\".RTL\", \"text-align-last\", \"right\");\n  styleSheet.addRule(\"i\", \"color\", \"#ff0000\");\n  styleSheet.addRule(\"h1\", \"font-weight\", \"bold\");\n  styleSheet.addRule(\"h1\", \"font-size\", \"60px\");\n  styleSheet.addRule(\"h1\", \"text-align\", \"center\");\n  styleSheet.addRule(\"h1\", \"text-decoration\", \"underline\");\n  styleSheet.addRule(\".und\", \"text-decoration\", \"underline\");\n  styleSheet.addRule(\"p[lang|=he]\", \"direction\", \"rtl\");\n  styleSheet.addRule(\"ul[lang|=he]\", \"direction\", \"rtl\");\n  styleSheet.addRule(\"p[lang|=ar]\", \"direction\", \"rtl\");\n  styleSheet.addRule(\"p[lang|=ar]\", \"font-family\", \"sans-ar\");\n  styleSheet.addRule(\".framed\", \"border-width\", \"3px\");\n  styleSheet.addRule(\".framed\", \"padding\", \"10px\");\n  styleSheet.addRule(\".framed\", \"border-color\", \"#ff0000\");\n  styleSheet.addRule(\".framed\", \"background-color\", \"#ff8080\");\n  styleSheet.addRule(\".framed\", \"margin\", \"10px\");\n\n  \/\/ der zu formatierende text\n  std::string text = u8\"<html><body>\"\n    \"<h1 lang='de'>Überschrift mit<\/h1>\"\n    \"<p class='und'>Test <i class='BigFont' class='und'>Text<\/i> more and some \"\n    \"<div class='BoldFont' class='und'>more text so<\/div> that the pa\\u00ADra\\u00ADgraph is at least \"\n    \"<div>long<\/div> enough to span some lines on the screen let us \"\n    \"also <i>i<\/i>nclude some more hebrew נייה, העגורן הוא and back to english <\/p>\"\n    \"<p lang='he' class='framed'>אברהם בן שמואל אבולעפיה (1240 - 1291 בערך), רב ומקובל שראה עצמו כנביא וכמשיח, \"\n    \"נחשב לרוב כנציג הבולט של זרם הקבלה האקסטטית. היה בין הראשונים שהחלו במסע לגילוי עשרת \"\n    \"השבטים האבודים. עקב חרם שהוטל עליו על ידי הרשבא בעקבות הכרזתו על עצמו כמשיח, נשתכח אבולעפיה \"\n    \" מלב, עד השינוי שהחל במאה השש-עשרה בו החלו הרמק ורבי חיים ויטאל להתייחס לכתביו. להכרה מלאה \"\n    \"זכה, במאה השמונה-עשרה, עם התייחסותו החיובית של החידא לספרו הקבלי של אבולעפיה, חיי העולם הבא. \"\n    \"אבולעפיה חיבר עשרות ספרי קבלה, שזכו להתייחסות נרחבת גם בקרב קהיליית החוקרים המדעית. חלקם יצאו \"\n    \"לאור לאחרונה במהדורות מחודשות.<\/p>\"\n    \"<p lang='ar-arab'>كأس الأمم الأفريقية لكرة القدم 2008، ,عرفت أيضاً باسم إم.تي.إن كأس الأمم الأفريقية \"\n    \"لكرة <div class='und'>القدم بسبب الشركة<\/div> القدم بسبب الشركة الراعية للبطولة إم.تي.إن، كانت النسخة السادسة والعشرون من كأس الأمم الأفريقية، \"\n    \"وهي البطولة الرئيسية لمنتخبات الاتحاد الأفريقي لكرة القدم (كاف) والتي تقام كل سنتين منذ سنة \"\n    \"1957. نظمت المسابقة في أربعة مدن في جميع أنحاء غانا بين 20 يناير و 10 فبراير 2008. وبحضور 16 منتخبا \"\n    \"أفريقيا مقسمين على 4 مجموعات ويتأهل أول فريقين لكل مجموعة إلى دور الثمانية حيث الأدوار الإقصائية، \"\n    \"وكانت مباراة الأفتتاح بين غانا وغينيا والتي انتهت بفوز غانا 2-1، وانتهت البطولة بفوز مصر بالبطولة \"\n    \"القارية، بعد أن هزمت الكاميرون 1–0 في النهائي الذي أقيم علي ملعب أوهين دجان بمدينة أكرا، بينما فاز \"\n    \"منخب غانا بالمركز الثالث عقب تغلبه على فريق ساحل العاج بأربعة أهداف مقابل هدفين. (تابع القراءة)<\/p>\"\n    \"<p>2nd Paragraph<div class='BigFont'> with <div class='BoldFont'>a\\ndivision<\/div>\"\n    \"<\/div>.<\/p>\"\n    \"<p class='und'>a b c andnowone<i>very<\/i>longwordthatdoesntfitononelineandmight d e f °C<\/p>\"\n    \"<ul class='framed'><li>First <div class='und'>long<\/div> text in an ul list of html sdfsd fsd fs dfsd f gobble di gock and \"\n    \"even more<\/li><li>Second with just a bit<\/li><\/ul>\"\n    \"<ul lang='he' class='framed'><li>First long text in an ul list of html sdfsd fsd fs dfsd f gobble di gock and \"\n    \"even more<\/li><li>Second with just a bit<\/li><\/ul>\"\n    \"<p>Margaret­Are­You­Grieving­Over­Goldengrove­Unleaving­Leaves­Like­The­Things­Of­Man­You­With­Your­F\"\n    \"resh­Thoughts­Care­For­Can­You­Ah­As­The­Heart­Grows­Older­It­Will­Come­To­Such­Sights­Colder­By­And­By­Nor\"\n    \"­Spare­A­Sigh­Though­Worlds­Of­Wanwood­Leafmeal­Lie­And­Yet­You­Will­Weep­And­Know­Why­Now­No­Matter­Child\"\n    \"­The­Name­Sorrows­Springs­Are­The­Same­Nor­Mouth­Had­No­Nor­Mind­Expressed­What­Heart­Heard­Of­Ghost­Gues\"\n    \"sed­It­Is­The­Blight­Man­Was­Born­For­It­Is­Margaret­You­Mourn­For<\/p>\"\n    \"<\/body><\/html>\";\n\n  \/\/ Vektor mit auszugebenden Text layouts, besteht immer aus einem layoute\n  \/\/ und dessen Position auf dem Bildschirm\n  std::vector<layoutInfo_c> l;\n\n  \/\/ grauer Hintergrund, damit ich sehen kann, ob der Text die korrekte Breite hat\n  \/\/ erzeuge ein künstliches Layout nur mit einem Rechteck drin... so etwas wird später\n  \/\/ nicht mehr benötigt, ist nur für den Test\n  textLayout_c la;\n  textLayout_c::commandData c;\n  c.command = textLayout_c::commandData::CMD_RECT;\n  c.x = c.y = 0;\n  c.w = TXT_WIDTH;\n  c.h = 600;\n  c.r = c.g = c.b = 50;\n  la.addCommand(c);\n  l.emplace_back(layoutInfo_c(la, (WIN_WIDTH-TXT_WIDTH)\/2, 10));\n\n  try {\n    \/\/ das eigentliche Layout\n    \/\/ layoutXHTML macht die Arbeit, übergeben wird der Text, das Stylesheet und eine Klasse,\n    \/\/ die die Form des Textes beinhaltet (für nicht rechteckiges Layout\n    l.emplace_back(layoutInfo_c(layoutXHTML(text, styleSheet, rectangleShape_c(TXT_WIDTH)),\n                                (WIN_WIDTH-TXT_WIDTH)\/2, 10));\n\n    l[0].layout.data[0].h = l[1].layout.getHeight();\n\n    \/\/ Ausgabe mittels SDL\n    showLayoutsSelf(WIN_WIDTH, 1000, l);\n  }\n  catch (XhtmlException_c & e)\n  {\n    printf(\"Xhtml Exception: %s\\n\", e.what());\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>28968624-2f67-11e5-ad8b-6c40088e03e4<commit_msg>289d0776-2f67-11e5-9da4-6c40088e03e4<commit_after>289d0776-2f67-11e5-9da4-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>b5302d91-2e4f-11e5-8d63-28cfe91dbc4b<commit_msg>b536f226-2e4f-11e5-a28f-28cfe91dbc4b<commit_after>b536f226-2e4f-11e5-a28f-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>77815cfc-2d53-11e5-baeb-247703a38240<commit_msg>7781da92-2d53-11e5-baeb-247703a38240<commit_after>7781da92-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>c2fd3d70-35ca-11e5-8532-6c40088e03e4<commit_msg>c303ab80-35ca-11e5-ab1c-6c40088e03e4<commit_after>c303ab80-35ca-11e5-ab1c-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>55ca5af8-2748-11e6-90da-e0f84713e7b8<commit_msg>My Life for Auir<commit_after>55d75a59-2748-11e6-9c64-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>9fc9949c-2d3d-11e5-99b0-c82a142b6f9b<commit_msg>a10d2705-2d3d-11e5-b285-c82a142b6f9b<commit_after>a10d2705-2d3d-11e5-b285-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>2853eaf8-2e4f-11e5-ad7a-28cfe91dbc4b<commit_msg>285a8a51-2e4f-11e5-ac5c-28cfe91dbc4b<commit_after>285a8a51-2e4f-11e5-ac5c-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/*\r\n** This source file is part of framepacker\r\n**\r\n** For the latest info, see https:\/\/github.com\/paladin-t\/framepacker\/\r\n**\r\n** Copyright (C) 2015 Wang Renxin\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\r\n#include \"framepacker.hpp\"\r\n#include <list>\r\n#include <string>\r\n#include <Windows.h>\r\n#include \"freeimage.h\"\r\n\r\nusing namespace framepacker;\r\n\r\nnamespace framepacker {\r\n\r\nstruct color {\r\n\tcolor() : r(0), g(0), b(0), a(0) {\r\n\t}\r\n\tcolor(unsigned char _r, unsigned char _g, unsigned char _b, unsigned char _a) : r(_r), g(_g), b(_b), a(_a) {\r\n\t}\r\n\r\n\tbool is_transparent(void) const {\r\n\t\treturn a == 0;\r\n\t}\r\n\r\n\tunsigned char r;\r\n\tunsigned char g;\r\n\tunsigned char b;\r\n\tunsigned char a;\r\n};\r\n\r\nclass freeimage {\r\n\r\npublic:\r\n\tfreeimage() : handle(NULL), w(0), h(0) {\r\n\t}\r\n\tfreeimage(const char* p) {\r\n\t\tload_file(p);\r\n\t}\r\n\t~freeimage() {\r\n\t\tunload();\r\n\t}\r\n\r\n\tconst char* get_path(void) const { return path.c_str(); }\r\n\r\n\tint width(void) const { return w; }\r\n\tint height(void) const { return h; }\r\n\r\n\tBYTE* bytes(void) const { return FreeImage_GetBits(handle); }\r\n\r\n\tcolor pixel(unsigned x, unsigned y) const {\r\n\t\tRGBQUAD col;\r\n\t\tFreeImage_GetPixelColor(handle, x, y, &col);\r\n\t\tcolor ret;\r\n\t\tret.r = col.rgbRed;\r\n\t\tret.g = col.rgbGreen;\r\n\t\tret.b = col.rgbBlue;\r\n\t\tret.a = col.rgbReserved;\r\n\r\n\t\treturn ret;\r\n\t}\r\n\tvoid pixel(unsigned x, unsigned y, color &c) {\r\n\t\tRGBQUAD col;\r\n\t\tcol.rgbRed = c.r;\r\n\t\tcol.rgbGreen = c.g;\r\n\t\tcol.rgbBlue = c.b;\r\n\t\tcol.rgbReserved = c.a;\r\n\t\tFreeImage_SetPixelColor(handle, x, y, &col);\r\n\t}\r\n\r\n\tvoid copy_from(freeimage &src, unsigned left, unsigned top, unsigned width, unsigned height, unsigned x, unsigned y) {\r\n\t\tFIBITMAP* fib = FreeImage_Copy(src.handle, left, top, left + width, top + height);\r\n\t\tFreeImage_Paste(handle, fib, x, y, 255);\r\n\t\tFreeImage_Unload(fib);\r\n\t}\r\n\r\n\tbool is_transparent(unsigned x, unsigned y) const {\r\n\t\tcolor c = pixel(x, y);\r\n\r\n\t\treturn c.is_transparent();\r\n\t}\r\n\r\n\tbool resize(int _w, int _h) {\r\n\t\tunload();\r\n\t\thandle = FreeImage_Allocate(_w, _h, 32);\r\n\t\tw = _w;\r\n\t\th = _h;\r\n\r\n\t\treturn true;\r\n\t}\r\n\r\n\tbool load_file(const char* p) {\r\n\t\tpath = p;\r\n\r\n\t\thandle = NULL;\r\n\t\tw = 0;\r\n\t\th = 0;\r\n\r\n\t\tFREE_IMAGE_FORMAT fif = FreeImage_GetFIFFromFilename(path.c_str());\r\n\t\tif(fif != FIF_UNKNOWN) {\r\n\t\t\thandle = FreeImage_Load(fif, path.c_str());\r\n\t\t\tif (FreeImage_GetBPP(handle) != 32)  {\r\n\t\t\t\tFIBITMAP* tmp = handle;\r\n\t\t\t\thandle = FreeImage_ConvertTo32Bits(tmp);\r\n\t\t\t}\r\n\r\n\t\t\tw = FreeImage_GetWidth(handle);\r\n\t\t\th = FreeImage_GetHeight(handle);\r\n\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\t\treturn false;\r\n\t}\r\n\r\n\tvoid unload(void) {\r\n\t\tif(!handle)\r\n\t\t\treturn;\r\n\r\n\t\tFreeImage_Unload(handle);\r\n\t\thandle = NULL;\r\n\t}\r\n\r\n\tvoid save(const char* p) {\r\n\t\tFreeImage_Save(FIF_PNG, handle, p);\r\n\t}\r\n\r\nprivate:\r\n\tstd::string path;\r\n\tFIBITMAP* handle;\r\n\tunsigned w;\r\n\tunsigned h;\r\n\r\n};\r\n\r\n}\r\n\r\ntypedef packer<freeimage> packer_type;\r\n\r\n#define _BIN_FILE_NAME \"framepacker\"\r\n\r\n#define _CHECK_ARG(__c, __i, __e) \\\r\n\tdo { \\\r\n\t\tif(__c <= __i + 1) { \\\r\n\t\t\tprintf(__e); \\\r\n\t\t\treturn; \\\r\n\t\t} \\\r\n\t} while(0)\r\n\r\nstatic unsigned short _set_console_color(unsigned short col) {\r\n\tCONSOLE_SCREEN_BUFFER_INFO csbiInfo;\r\n\tif(!GetConsoleScreenBufferInfo(GetStdHandle(STD_OUTPUT_HANDLE), &csbiInfo)) {\r\n\t\tprintf(\"GetConsoleScreenBufferInfo error!\\n\");\r\n\r\n\t\treturn 0;\r\n\t}\r\n\tif(!SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), col)) {\r\n\t\tprintf(\"SetConsoleTextAttribute error!\\n\");\r\n\r\n\t\treturn 0;\r\n\t}\r\n\r\n\treturn csbiInfo.wAttributes;\r\n}\r\n\r\nstruct ConsoleColor {\r\n\tConsoleColor(unsigned short col) {\r\n\t\told = _set_console_color(col);\r\n\t}\r\n\t~ConsoleColor() {\r\n\t\t_set_console_color(old);\r\n\t}\r\n\r\n\tunsigned short old;\r\n};\r\n\r\n#define CONSOLE_COLOR(C) ConsoleColor __##__FUNCTION__##__LINE__(C);\r\n\r\nstatic void _show_tip(void) {\r\n\tprintf(\"[Usage]\\n\");\r\n\tprintf(\"  %s FILE_LIST [-o output_file] [OPTIONS] - Packs some images\\n\", _BIN_FILE_NAME);\r\n\tprintf(\"\\n\");\r\n\tprintf(\"  FILE_LIST := file*\\n\");\r\n\tprintf(\"  OPTIONS   := -p n    : Padding, 1 as default\\n\");\r\n\tprintf(\"            := -s mxn  : Expected texture size, eg. 256x512, may enlarge result\\n\");\r\n\tprintf(\"            := -t      : Disable rotation\\n\");\r\n\tprintf(\"            := -w      : Disable forcing texture to POT (Power of 2)\\n\");\r\n\tprintf(\"            := -m      : Disable alpha trim\\n\");\r\n}\r\n\r\nstatic void _process_parameters(int argc, char* argv[]) {\r\n\tint i = 1;\r\n\tstd::string m = \"\\0\";\r\n\tint padding = 1;\r\n\tint w = 0, h = 0;\r\n\tbool allow_rotate = true;\r\n\tbool power_of_2 = true;\r\n\tbool alpha_trim = true;\r\n\r\n\tstd::list<std::string> inputs;\r\n\tstd::list<std::pair<std::string, std::string> > options;\r\n\r\n\t\/\/ Parses arguments.\r\n\twhile(i < argc) {\r\n\t\tif(!memcmp(argv[i], \"-\", 1)) {\r\n\t\t\tif(!memcmp(argv[i] + 1, \"o\", 1)) {\r\n\t\t\t\tm = 'o';\r\n\t\t\t\t_CHECK_ARG(argc, i, \"-o: File name expected.\\n\");\r\n\t\t\t\toptions.push_back(std::make_pair(m, argv[++i]));\r\n\t\t\t\t++i;\r\n\t\t\t} else if(!memcmp(argv[i] + 1, \"p\", 1)) {\r\n\t\t\t\t_CHECK_ARG(argc, i, \"-p: Padding size expected.\\n\");\r\n\t\t\t\tpadding = max(std::atoi(argv[++i]), 0);\r\n\t\t\t} else if(!memcmp(argv[i] + 1, \"s\", 1)) {\r\n\t\t\t\t_CHECK_ARG(argc, i, \"-s: Size expected.\\n\");\r\n\t\t\t\tchar buf[256];\r\n\t\t\t\t_snprintf_s(buf, sizeof(buf), argv[++i]);\r\n\t\t\t\tchar* ctx = NULL;\r\n\t\t\t\tchar* tmp = strtok_s(buf, \"x\", &ctx);\r\n\t\t\t\tw = std::atoi(tmp);\r\n\t\t\t\th = std::atoi(ctx);\r\n\t\t\t\t++i;\r\n\t\t\t} else if(!memcmp(argv[i] + 1, \"t\", 1)) {\r\n\t\t\t\tallow_rotate = false;\r\n\t\t\t\t++i;\r\n\t\t\t} else if(!memcmp(argv[i] + 1, \"w\", 1)) {\r\n\t\t\t\tpower_of_2 = false;\r\n\t\t\t\t++i;\r\n\t\t\t} else if(!memcmp(argv[i] + 1, \"m\", 1)) {\r\n\t\t\t\talpha_trim = false;\r\n\t\t\t\t++i;\r\n\t\t\t} else {\r\n\t\t\t\tprintf(\"Unknown argument: %s.\\n\", argv[i++]);\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tinputs.push_back(argv[i++]);\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ Tells output path.\r\n\tstd::string outpath = \"output.png\";\r\n\tfor(auto it = options.begin(); it != options.end(); ++it) {\r\n\t\tif(it->first == \"o\")\r\n\t\t\toutpath = it->second;\r\n\t}\r\n\r\n\t\/\/ Prepares packing.\r\n\tDWORD time = GetTickCount();\r\n\r\n\tpacker_type packer;\r\n\tpacker.padding = padding;\r\n\tpacker.output_texture_size = vec2(w, h);\r\n\tpacker.allow_rotate = allow_rotate;\r\n\tpacker.power_of_2 = power_of_2;\r\n\tpacker.alpha_trim = alpha_trim;\r\n\tpacker.comparer = packer_type::compare_area;\r\n\r\n\tfor(auto it = inputs.begin(); it != inputs.end(); ++it) {\r\n\t\tpacker_type::texture_type img(new freeimage(it->c_str()));\r\n\r\n\t\tpacker.add(it->c_str(), img);\r\n\t}\r\n\r\n\tDWORD load_time = GetTickCount() - time;\r\n\ttime = GetTickCount();\r\n\r\n\t\/\/ Packs it.\r\n\tpacker_type::texture_type result(new freeimage);\r\n\tpacker_type::texture_coll_type packed;\r\n\tpacker_type::texture_coll_type failed;\r\n\tpacker.pack(result, packed, failed);\r\n\r\n\tDWORD pack_time = GetTickCount() - time;\r\n\r\n\t\/\/ Prompts.\r\n\t{\r\n\t\tCONSOLE_COLOR(FOREGROUND_INTENSITY);\r\n\t\tprintf(\"Packed %d:\\n\", packed.size());\r\n\t\tfor(auto it = packed.begin(); it != packed.end(); ++it) {\r\n\t\t\tpacker_type::block_type &blk = it->second;\r\n\t\t\tprintf(\"  %s [%d, %d] - [%d, %d]\\n\", it->first.c_str(), blk.fit->min_x(), blk.fit->min_y(), blk.fit->min_x() + blk.fit->width(), blk.fit->min_y() + blk.fit->height());\r\n\t\t}\r\n\t}\r\n\tif(failed.size()) {\r\n\t\tCONSOLE_COLOR(FOREGROUND_RED | FOREGROUND_GREEN);\r\n\t\tprintf(\"Failed %d:\\n\", failed.size());\r\n\t\tfor(auto it = failed.begin(); it != failed.end(); ++it) {\r\n\t\t\tpacker_type::block_type &blk = it->second;\r\n\t\t\tprintf(\"  %s\\n\", it->first.c_str());\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tCONSOLE_COLOR(FOREGROUND_INTENSITY);\r\n\t\tprintf(\"Cost time: %gs loading; %gs packing.\\n\", (float)load_time \/ 1000.0f, (float)pack_time \/ 1000.0f);\r\n\t}\r\n\r\n\t\/\/ Serializes.\r\n\t{\r\n\t\tCONSOLE_COLOR(FOREGROUND_INTENSITY);\r\n\t\tstd::string out_tex = outpath + \".png\";\r\n\t\tresult->save(out_tex.c_str());\r\n\t\tprintf(\"Texture written: %s.\\n\", out_tex.c_str());\r\n\t}\r\n\t{\r\n\t\tCONSOLE_COLOR(FOREGROUND_INTENSITY);\r\n\t\tstd::string out_meta = outpath + \".json\";\r\n\t\tstd::ofstream fs(out_meta);\r\n\t\tpacker.write_meta(fs, packed, result, outpath.c_str());\r\n\t\tfs.close();\r\n\t\tprintf(\"Meta data written: %s.\\n\", out_meta.c_str());\r\n\t}\r\n}\r\n\r\nstatic void _on_startup(void) {\r\n\tFreeImage_Initialise();\r\n}\r\n\r\nstatic void _on_exit(void) {\r\n\tFreeImage_DeInitialise();\r\n}\r\n\r\nint main(int argc, char* argv[]) {\r\n\tatexit(_on_exit);\r\n\r\n\t_on_startup();\r\n\r\n\tif(argc == 1)\r\n\t\t_show_tip();\r\n\telse if(argc >= 2)\r\n\t\t_process_parameters(argc, argv);\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>-removed main.cpp, not all builds share the only framepacker.cpp unit.<commit_after><|endoftext|>"}
{"text":"<commit_before>6a2a13c2-2fa5-11e5-8547-00012e3d3f12<commit_msg>6a2bc176-2fa5-11e5-ad04-00012e3d3f12<commit_after>6a2bc176-2fa5-11e5-ad04-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n\r\nusing namespace std;\r\n\r\n#define ELEMENTS_PER_BUY_OPTION 2\r\n#define STORE_ID_OFFSET 0\r\n#define PRICE_OFFSET 1\r\n\r\n#define NUM_PRODUCTS 2\r\n#define NUM_BUY_OPTIONS 2\r\n\r\n#define NUM_THREADS 512 \/\/ El número mínimo de threads es 32 (por el tamaño de warp) y el maximo 1024\r\n\r\nvoid initAllProductsBuyOptions(int *all_products_buy_options);\r\n\r\nvoid printAllProductsAllBuyOptions(int *all_products_buy_options);\r\nvoid getBestBuyOptions(int *all_products_buy_options, int *best_buy_options);\r\nvoid printBestBuyOptions(int *best_buy_options);\r\n\r\nint main(int argc, char** argv)\r\n{\r\n    \/\/ Buy options in host and device\r\n    int *host_all_products_buy_options = (int *) malloc( NUM_PRODUCTS * NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION * sizeof(int) );\r\n    int *best_buy_options = (int *) malloc( NUM_PRODUCTS * ELEMENTS_PER_BUY_OPTION * sizeof(int) );\r\n\r\n    initAllProductsBuyOptions(host_all_products_buy_options);\r\n\r\n    \/\/ DEBUG\r\n    printAllProductsAllBuyOptions(host_all_products_buy_options);\r\n    getBestBuyOptions(host_all_products_buy_options, best_buy_options);\r\n    printBestBuyOptions(best_buy_options);\r\n    \/\/ END DEBUG\r\n}\r\n\r\nvoid initAllProductsBuyOptions(int *all_products_buy_options)\r\n{\r\n    \/\/ START Vector all the buy options for the product 1\r\n\r\n    \/\/ product_1_store_1_buy_option;\r\n    all_products_buy_options[0] = 11; \/\/ store_id\r\n    all_products_buy_options[1] = 11;  \/\/ price\r\n\r\n    \/\/ product_1_store_2_buy_option;\r\n    all_products_buy_options[2] = 12; \/\/ store_id\r\n    all_products_buy_options[3] = 12;  \/\/ price\r\n\r\n    \/\/ END Vector all the buy options for the product 1\r\n\r\n    \/\/ START Vector all the buy options for the product 2\r\n\r\n    \/\/ product_1_store_1_buy_option;\r\n    all_products_buy_options[4] = 21; \/\/ store_id\r\n    all_products_buy_options[5] = 21;  \/\/ price\r\n\r\n    \/\/ product_1_store_2_buy_option;\r\n    all_products_buy_options[6] = 22; \/\/ store_id\r\n    all_products_buy_options[7] = 2;  \/\/ price\r\n\r\n    \/\/ END Vector all the buy options for the product 2\r\n}\r\n\r\nvoid printAllProductsAllBuyOptions(int *all_products_buy_options)\r\n{\r\n    cout << \"All products buy options:\" << endl;\r\n    for (int i = 0; i < NUM_PRODUCTS; ++i){\r\n        cout << endl << \"\\tproduct_id: \" << i << endl;\r\n        for (int j = 0; j < NUM_BUY_OPTIONS*2; j += 2){\r\n            cout << \"Buy option:\" << endl;\r\n            cout << \"\\tstore_id: \" << all_products_buy_options[i*NUM_BUY_OPTIONS*2+j] << endl;\r\n            cout << \"\\tprice: \" << all_products_buy_options[i*NUM_BUY_OPTIONS*2+j+1] << endl;\r\n        }\r\n    }\r\n}\r\n\r\nvoid getBestBuyOptions(int *all_products_buy_options, int *best_buy_options)\r\n{\r\n    for(int product_iteration = 0; product_iteration < NUM_PRODUCTS; ++product_iteration)\r\n    {\r\n        int current_product_position = product_iteration * NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION;\r\n        int current_product_store_position = current_product_position + STORE_ID_OFFSET;\r\n        int current_product_price_position = current_product_position + PRICE_OFFSET;\r\n\r\n        int best_store = all_products_buy_options[current_product_store_position];\r\n        int best_price = all_products_buy_options[current_product_price_position];\r\n\r\n        for(int product_to_compare = ELEMENTS_PER_BUY_OPTION; product_to_compare < NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION; product_to_compare += ELEMENTS_PER_BUY_OPTION)\r\n        {\r\n            if (all_products_buy_options[current_product_position + product_to_compare + PRICE_OFFSET] < best_price)\r\n            {\r\n               best_store = all_products_buy_options[product_iteration * NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION + product_to_compare + STORE_ID_OFFSET];\r\n               best_price = all_products_buy_options[product_iteration * NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION + product_to_compare + PRICE_OFFSET];\r\n            }\r\n        }\r\n        best_buy_options[product_iteration * ELEMENTS_PER_BUY_OPTION + STORE_ID_OFFSET] = best_store;\r\n        best_buy_options[product_iteration * ELEMENTS_PER_BUY_OPTION + PRICE_OFFSET] = best_price;\r\n    }\r\n}\r\n\r\nvoid printBestBuyOptions(int *best_buy_options)\r\n{\r\n    cout << endl <<\"Best products buy options:\" << endl;\r\n    for (int i = 0; i < NUM_PRODUCTS * ELEMENTS_PER_BUY_OPTION; i += ELEMENTS_PER_BUY_OPTION)\r\n    {\r\n        cout << \"Best buy option for product_id: \" << i \/ ELEMENTS_PER_BUY_OPTION << endl;\r\n        cout << \"\\tstore_id: \" << best_buy_options[i + STORE_ID_OFFSET] << endl;\r\n        cout << \"\\tprice: \" << best_buy_options[i + PRICE_OFFSET] << endl;\r\n    }\r\n}\r\n<commit_msg>[WIP] Implement initAllProductsBuyOptions() with random values. Bug inside.<commit_after>#include <iostream>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n\r\nusing namespace std;\r\n\r\n#define ELEMENTS_PER_BUY_OPTION 2\r\n#define STORE_ID_OFFSET 0\r\n#define PRICE_OFFSET 1\r\n\r\n#define NUM_PRODUCTS 2\r\n#define NUM_BUY_OPTIONS 2\r\n\r\n#define NUM_THREADS 512 \/\/ El número mínimo de threads es 32 (por el tamaño de warp) y el maximo 1024\r\n\r\nvoid initAllProductsBuyOptions(int *all_products_buy_options);\r\n\r\nvoid printAllProductsAllBuyOptions(int *all_products_buy_options);\r\nvoid getBestBuyOptions(int *all_products_buy_options, int *best_buy_options);\r\nvoid printBestBuyOptions(int *best_buy_options);\r\n\r\nint main(int argc, char** argv)\r\n{\r\n    \/\/ Buy options in host and device\r\n    int *host_all_products_buy_options = (int *) malloc( NUM_PRODUCTS * NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION * sizeof(int) );\r\n    int *best_buy_options = (int *) malloc( NUM_PRODUCTS * ELEMENTS_PER_BUY_OPTION * sizeof(int) );\r\n\r\n    initAllProductsBuyOptions(host_all_products_buy_options);\r\n\r\n    \/\/ DEBUG\r\n    printAllProductsAllBuyOptions(host_all_products_buy_options);\r\n    getBestBuyOptions(host_all_products_buy_options, best_buy_options);\r\n    printBestBuyOptions(best_buy_options);\r\n    \/\/ END DEBUG\r\n}\r\n\r\nvoid initAllProductsBuyOptions(int *all_products_buy_options)\r\n{\r\n    for(int product_iteration = 0; product_iteration < NUM_PRODUCTS; ++product_iteration)\r\n    {\r\n        int current_product_position = product_iteration * NUM_BUY_OPTIONS;\r\n\r\n        for(int buy_option_iteration = 0; buy_option_iteration < NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION; buy_option_iteration += ELEMENTS_PER_BUY_OPTION)\r\n        {\r\n            int current_product_store_position = current_product_position + buy_option_iteration * ELEMENTS_PER_BUY_OPTION + STORE_ID_OFFSET;\r\n            int current_product_price_position = current_product_position + buy_option_iteration * ELEMENTS_PER_BUY_OPTION + PRICE_OFFSET;\r\n\r\n            cout << \"product_iteration: \" << product_iteration << endl;\r\n            cout << \"buy_option_iteration: \" << buy_option_iteration << endl;\r\n            cout << \"current_product_position: \" << current_product_position << endl;\r\n            cout << \"current_product_store_position: \" << current_product_store_position << endl;\r\n            cout << \"current_product_price_position: \" << current_product_price_position << endl;\r\n            cout << \"NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION: \" << NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION << endl << endl;\r\n\r\n            \/\/ Set the current product buy option to the store with the same id as the current iteration in order to do not duplicate buy options.\r\n            all_products_buy_options[current_product_store_position] = buy_option_iteration;\r\n\r\n            \/\/ Set the price with a random value between 0 and 100.\r\n            all_products_buy_options[current_product_price_position] = rand() % 100;\r\n        }\r\n    }\r\n}\r\n\r\nvoid printAllProductsAllBuyOptions(int *all_products_buy_options)\r\n{\r\n    cout << \"*** All products buy options ***\" << endl;\r\n    for (int i = 0; i < NUM_PRODUCTS; ++i){\r\n        cout << endl << \"Buy options for product_id: \" << i << endl;\r\n        for (int j = 0; j < NUM_BUY_OPTIONS*2; j += 2){\r\n            cout << \"\\tstore_id: \" << all_products_buy_options[i*NUM_BUY_OPTIONS*2+j] << endl;\r\n            cout << \"\\tprice: \" << all_products_buy_options[i*NUM_BUY_OPTIONS*2+j+1] << endl << endl;\r\n        }\r\n    }\r\n}\r\n\r\nvoid getBestBuyOptions(int *all_products_buy_options, int *best_buy_options)\r\n{\r\n    for(int product_iteration = 0; product_iteration < NUM_PRODUCTS; ++product_iteration)\r\n    {\r\n        int current_product_position = product_iteration * NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION;\r\n        int current_product_store_position = current_product_position + STORE_ID_OFFSET;\r\n        int current_product_price_position = current_product_position + PRICE_OFFSET;\r\n\r\n        int best_store = all_products_buy_options[current_product_store_position];\r\n        int best_price = all_products_buy_options[current_product_price_position];\r\n\r\n        for(int product_to_compare = ELEMENTS_PER_BUY_OPTION; product_to_compare < NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION; product_to_compare += ELEMENTS_PER_BUY_OPTION)\r\n        {\r\n            if (all_products_buy_options[current_product_position + product_to_compare + PRICE_OFFSET] < best_price)\r\n            {\r\n               best_store = all_products_buy_options[product_iteration * NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION + product_to_compare + STORE_ID_OFFSET];\r\n               best_price = all_products_buy_options[product_iteration * NUM_BUY_OPTIONS * ELEMENTS_PER_BUY_OPTION + product_to_compare + PRICE_OFFSET];\r\n            }\r\n        }\r\n        best_buy_options[product_iteration * ELEMENTS_PER_BUY_OPTION + STORE_ID_OFFSET] = best_store;\r\n        best_buy_options[product_iteration * ELEMENTS_PER_BUY_OPTION + PRICE_OFFSET] = best_price;\r\n    }\r\n}\r\n\r\nvoid printBestBuyOptions(int *best_buy_options)\r\n{\r\n    cout << endl <<\"*** Best products buy options ***\" << endl << endl;\r\n    for (int i = 0; i < NUM_PRODUCTS * ELEMENTS_PER_BUY_OPTION; i += ELEMENTS_PER_BUY_OPTION)\r\n    {\r\n        cout << \"Best buy option for product_id: \" << i \/ ELEMENTS_PER_BUY_OPTION << endl;\r\n        cout << \"\\tstore_id: \" << best_buy_options[i + STORE_ID_OFFSET] << endl;\r\n        cout << \"\\tprice: \" << best_buy_options[i + PRICE_OFFSET] << endl << endl;\r\n    }\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>d891b25c-327f-11e5-b8a5-9cf387a8033e<commit_msg>d898e3bd-327f-11e5-b7cc-9cf387a8033e<commit_after>d898e3bd-327f-11e5-b7cc-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>a4235b30-35ca-11e5-ab19-6c40088e03e4<commit_msg>a42a919a-35ca-11e5-8f39-6c40088e03e4<commit_after>a42a919a-35ca-11e5-8f39-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>83000e95-2d15-11e5-af21-0401358ea401<commit_msg>83000e96-2d15-11e5-af21-0401358ea401<commit_after>83000e96-2d15-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>83000db6-2d15-11e5-af21-0401358ea401<commit_msg>83000db7-2d15-11e5-af21-0401358ea401<commit_after>83000db7-2d15-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>#include <glib.h>\n#include<libnotify\/notify.h>\n#include <gtk\/gtk.h>\n#include \"logging.h\"\n#include \"totimer.h\"\n\nint main(int argc, char** argv)\n{\n    if (argc<2)\n        return 0;\n    gtk_init(&argc, &argv);\n    notify_init(\"pomodori\");\n    tres lastres;\n    lastres.time=0;\n    lastres.reason=argv[1];\n    settimer(&lastres,1);\n    gtk_main();\n    return 0;\n}<commit_msg>revert to original time<commit_after>#include <glib.h>\n#include<libnotify\/notify.h>\n#include <gtk\/gtk.h>\n#include \"logging.h\"\n#include \"totimer.h\"\n\nint main(int argc, char** argv)\n{\n    if (argc<2)\n        return 0;\n    gtk_init(&argc, &argv);\n    notify_init(\"pomodori\");\n    tres lastres;\n    lastres.time=0;\n    lastres.reason=argv[1];\n    settimer(&lastres,POTIME);\n    gtk_main();\n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before>8c3d2153-2d14-11e5-af21-0401358ea401<commit_msg>8c3d2154-2d14-11e5-af21-0401358ea401<commit_after>8c3d2154-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>5b5a89a3-2d3f-11e5-a9f3-c82a142b6f9b<commit_msg>5bcd17d9-2d3f-11e5-8b43-c82a142b6f9b<commit_after>5bcd17d9-2d3f-11e5-8b43-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>856278b4-2d15-11e5-af21-0401358ea401<commit_msg>856278b5-2d15-11e5-af21-0401358ea401<commit_after>856278b5-2d15-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>f4208bf8-327f-11e5-aa59-9cf387a8033e<commit_msg>f4263f45-327f-11e5-a7ea-9cf387a8033e<commit_after>f4263f45-327f-11e5-a7ea-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>ffeab628-2e4e-11e5-8c3b-28cfe91dbc4b<commit_msg>fff171ca-2e4e-11e5-9a2f-28cfe91dbc4b<commit_after>fff171ca-2e4e-11e5-9a2f-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>38fc8cf8-2d3d-11e5-8a7e-c82a142b6f9b<commit_msg>39857105-2d3d-11e5-acd4-c82a142b6f9b<commit_after>39857105-2d3d-11e5-acd4-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>6f6425ee-2e3a-11e5-a12f-c03896053bdd<commit_msg>6f762b5c-2e3a-11e5-a74a-c03896053bdd<commit_after>6f762b5c-2e3a-11e5-a74a-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>06b0415a-2f67-11e5-8bfd-6c40088e03e4<commit_msg>06b72234-2f67-11e5-bc5c-6c40088e03e4<commit_after>06b72234-2f67-11e5-bc5c-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>74f33c80-2749-11e6-9d29-e0f84713e7b8<commit_msg>Bug fixes and performance improvements<commit_after>7501904f-2749-11e6-bc2c-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>557362ee-5216-11e5-8e27-6c40088e03e4<commit_msg>5579d540-5216-11e5-bb90-6c40088e03e4<commit_after>5579d540-5216-11e5-bb90-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>46ae0a40-2e4f-11e5-8e1f-28cfe91dbc4b<commit_msg>46b54dca-2e4f-11e5-8074-28cfe91dbc4b<commit_after>46b54dca-2e4f-11e5-8074-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>cb039dd1-4b02-11e5-aa3c-28cfe9171a43<commit_msg>#BUG723 uncommitted code found on my computer Monday morning<commit_after>cb0d688a-4b02-11e5-83b9-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>d28746a3-2e4e-11e5-bb49-28cfe91dbc4b<commit_msg>d2951e82-2e4e-11e5-b966-28cfe91dbc4b<commit_after>d2951e82-2e4e-11e5-b966-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>7e791947-2d15-11e5-af21-0401358ea401<commit_msg>7e791948-2d15-11e5-af21-0401358ea401<commit_after>7e791948-2d15-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>6d73c2e6-2e4f-11e5-a3a5-28cfe91dbc4b<commit_msg>6d7ab7a6-2e4f-11e5-aa1c-28cfe91dbc4b<commit_after>6d7ab7a6-2e4f-11e5-aa1c-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>325a1174-5216-11e5-9da4-6c40088e03e4<commit_msg>3260ce2c-5216-11e5-bac6-6c40088e03e4<commit_after>3260ce2c-5216-11e5-bac6-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>dbb6f92e-2e4e-11e5-b1b3-28cfe91dbc4b<commit_msg>dbbea7ab-2e4e-11e5-8a40-28cfe91dbc4b<commit_after>dbbea7ab-2e4e-11e5-8a40-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>79ee917a-5216-11e5-9a2d-6c40088e03e4<commit_msg>79f53f98-5216-11e5-890b-6c40088e03e4<commit_after>79f53f98-5216-11e5-890b-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  return 0\n}\n<commit_msg>Added testing comment<commit_after>#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n    \/\/ test\n    \/\/ still testing\n  return 0\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"cppEvolve\/cppEvolve.hpp\"\n#include \"cppEvolve\/Genome\/List1D\/List1D.hpp\"\n#include \"cppEvolve\/Genome\/Tree\/Tree.hpp\"\n#include \"cppEvolve\/Genome\/Tree\/Mutator.hpp\"\n#include \"cppEvolve\/Genome\/Tree\/Crossover.hpp\"\n#include <ctime>\n#include <cstdlib>\n#include <deque>\n#include <array>\n#include <map>\n#include <set>\n#include <list>\n\nusing namespace evolve;\n\n\nnamespace functions\n{\n    int x =100;\n\n    int sum(int x, int y)\n    {\n        return x + y;\n    }\n\n    int get5()\n    {\n        return 5;\n    };\n\n    int getX()\n    {\n        return functions::x;\n    }\n}\n\nusing namespace functions;\nint main()\n{\n\n    srand(time(NULL));\n    \/*\n    typedef std::vector<int> genome;\n\n    Generator<genome> generator(foo, 5);\n\n    SimpleGA<genome, 400> ga(generator,\n                             List1DGenome::Evaluator::sum<genome>,\n                             List1DGenome::Crossover::singlePoint<genome>,\n                             List1DGenome::Mutator::swap<genome>,\n                             Selector::top<genome, 30>,\n                             10);\n\n    ga.run();\n    *\/\n    Tree::TreeFactory<int> factory;\n    factory.addNode(sum, \"sum\");\n    factory.addTerminator(get5, \"5\");\n    factory.addTerminator(getX, \"X\");\n\n    auto tree = factory.make();\n    auto tree2 = factory.make();\n\n    std::cout << *tree << std::endl;\n\n    std::cout << \"Eval: \" << tree->eval() << std::endl;\n\n    auto result = Tree::Crossover::singlePointCrossover(tree, tree2, factory);\n\n    std::cout << *result << std::endl;\n\n    std::cout << \"Eval: \" << result->eval() << std::endl;\n    std::cout << result->getDepth();\n\n    return 0;\n}\n<commit_msg>Added additional demonstrations to main<commit_after>\n#include \"cppEvolve\/cppEvolve.hpp\"\n#include \"cppEvolve\/TreeGA.hpp\"\n#include \"cppEvolve\/Genome\/List1D\/List1D.hpp\"\n#include \"cppEvolve\/Genome\/Tree\/Tree.hpp\"\n#include \"cppEvolve\/Genome\/Tree\/Mutator.hpp\"\n#include \"cppEvolve\/Genome\/Tree\/Crossover.hpp\"\n#include <ctime>\n#include <cstdlib>\n#include <deque>\n#include <array>\n#include <map>\n#include <set>\n#include <list>\n\nusing namespace evolve;\n\n\nnamespace functions\n{\n    int x =100;\n\n    int sum(int x, int y)\n    {\n        return x + y;\n    }\n\n    int average(int x, int y)\n    {\n        return (x+y)\/2;\n    }\n\n    int get5()\n    {\n        return 5;\n    };\n\n    int getX()\n    {\n        return functions::x;\n    }\n\n    template<typename T>\n    float fitness(const Tree::Tree<T>* tree)\n    {\n        x=2;\n        return tree->eval();\n    }\n\n\n}\n\nusing namespace functions;\n\nint main()\n{\n\n    srand(time(NULL));\n\/*\n    typedef std::vector<int> genome;\n\n    Generator<genome> generator(get5, 5);\n\n    SimpleGA<genome, 400> ga(generator,\n                             List1DGenome::Evaluator::sum<genome>,\n                             List1DGenome::Crossover::singlePoint<genome>,\n                             List1DGenome::Mutator::swap<genome>,\n                             Selector::top<genome, 30>,\n                             10);\n\n    ga.run();\n\n\n*\/\n    Tree::TreeFactory<int> factory(6);\n    factory.addNode(sum, \"sum\");\n    factory.addNode(average, \"average\");\n    factory.addTerminator(get5, \"5\");\n    factory.addTerminator(getX, \"X\");\n\n    TreeGA<int> ga(factory,\n                 fitness<int>,\n                 Tree::Crossover::singlePointCrossover<int>,\n                 Tree::Mutator::randomNode<int>,\n                 Selector::top<Tree::Tree<int>*, 30>,\n                 1000);\n\n    ga.run();\n\n\n\/*\n    Tree::TreeFactory<int> factory(6);\n    factory.addNode(sum, \"sum\");\n    factory.addNode(average, \"average\");\n    factory.addTerminator(get5, \"5\");\n    factory.addTerminator(getX, \"X\");\n    auto tree = factory.make();\n    auto tree2 = factory.make();\n\n    std::cout << *tree << std::endl;\n\n    std::cout << \"Eval: \" << tree->eval() << std::endl;\n\n    auto result = Tree::Crossover::singlePointCrossover(tree, tree2, factory);\n    Tree::Mutator::randomNode(result, factory);\n\n    std::cout << *result << std::endl;\n\n    std::cout << \"Eval: \" << result->eval() << std::endl;\n    std::cout << result->getDepth();\n    *\/\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>15cd2902-585b-11e5-aeb2-6c40088e03e4<commit_msg>15d44722-585b-11e5-bc0f-6c40088e03e4<commit_after>15d44722-585b-11e5-bc0f-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>#include \"main.h\"\n#include <iostream>\n\n\/**\n\n*\/\nMainWindow::MainWindow()\n{\n  \/\/set variables\n\tstarted = false;\n\tfinished = true;\n\tscore_ = 0;\n\tlives_ = 0;\n\texecutions = 0;\n\tspeed = 15;\n\tcanLose = true;\n\tlen = 3500;\n\t\n  \/\/create Pixmap images\n  \tas1 = new QPixmap(\"images\/airsoldier1.png\",\"png\");\n  \tas2 = new QPixmap(\"images\/airsoldier2.png\",\"png\");\n  \tat = new QPixmap(\"images\/aquatank.png\",\"png\");\n  \tg1 = new QPixmap(\"images\/gargoyle1.png\",\"png\");\n  \tg2 = new QPixmap(\"images\/gargoyle2.png\",\"png\");\n  \trn1 = new QPixmap(\"images\/rednocturne1.png\",\"png\");\n  \trn2 = new QPixmap(\"images\/rednocturne2.png\",\"png\");\n  \tts1 = new QPixmap(\"images\/tornadostep1.png\",\"png\");\n  \tts2 = new QPixmap(\"images\/tornadostep2.png\",\"png\");\n  \twm1 = new QPixmap(\"images\/whitemushroom1.png\",\"png\");\n  \twm2 = new QPixmap(\"images\/whitemushroom2.png\",\"png\");\n  \tl = new QPixmap(\"images\/life.png\",\"png\");\n  \tbg = new QPixmap(\"images\/background.png\",\"png\");\n  \tbgs = new QPixmap(\"images\/startbackground.png\",\"png\");\n  \/\/create overall layout\n\tthis->setGeometry(1,0,20,20);\n\t\n\twindow = new QWidget;\n\tsetCentralWidget(window);\n\tlayout = new QVBoxLayout(window);\n\twindow->setLayout(layout);\n\t\n  \/\/create options sidebar \n\toptions = new QHBoxLayout();\n\tlayout->addLayout(options);\n  \/\/create gamespace\n\tscene = new QGraphicsScene();\n\tscene->setSceneRect(0,0,650,350);\n\tview = new QGraphicsView(scene);\n\tview->setFixedSize(675,375);\n\tQRect r(0,0,675,375);\n\tQColor c(Qt::black);\n\tQBrush b(c,*bgs);\n\tview->setBackgroundBrush(b);\n \tlayout->addWidget(view);\n\n  \/\/create start button\n  \tstart = new QPushButton(\"Start Game\");\n\toptions->addWidget(start);\n\tQObject::connect(start,SIGNAL(clicked()),this,SLOT(startGame()));\n\n  \/\/create pause button\n  \tpause = new QPushButton(\"Pause Game\");\n  \toptions->addWidget(pause);\n  \tQObject::connect(pause,SIGNAL(clicked()),this,SLOT(pauseGame()));\n  \/\/create quit button\n\tquit = new QPushButton(\"Quit Game\");\n\toptions->addWidget(quit);\n\tQObject::connect(quit,SIGNAL(clicked()),qApp,SLOT(quit()));\n  \/\/create invincibility option\n  \tinvincible = new QRadioButton(\"Invincible Mode?\",this);\n  \toptions->addWidget(invincible);\n  \t\n  \/\/create message text\n  \tmessage = new Message();\n  \tmessage->setStart();\n  \tscene->addItem(message);\n  \n  \/\/create input for name\n\tname_ = new QLineEdit();\n\tname_->setGeometry(300,250,190,30);\n \tscene->addWidget(name_);\n \t\n  \/\/create timer\n  \ttimer = new QTimer();\n\ttimer->setInterval(speed);\n\tQObject::connect(timer,SIGNAL(timeout()),this,SLOT(handleTimer()));\n}\n\n\/**\nDeletes the timer. \n*\/\nMainWindow::~MainWindow()\n{\n\tdelete timer;\n\tdelete window;\n}\n\n\/**\nStarts or restarts the game. If a game hasn't been started, it checks for a user name input and, if valid, starts a game.\n\nIf a game is in the middle of gameplay, the current items are deleted and values\/items are reset to their initialized state.\n\nIf a game has ended, initial items are created.\n\nThe game timer is started in this function.\n*\/\nvoid MainWindow::startGame()\n{\n\tif(!started)\n\t{\n\t\t\/\/grab username\n\t\tQString n = name_->text();\n\t\t\/\/if empty, the game won't start;\n\t\tif(n == \"\")\n\t\t\treturn;\n\t\t\n\t\t\/\/create username and score output\n\t\tn = n + \" Score\";\n\t\ts = new QFormLayout();\n \t \tscore = new QLineEdit(QString::number(score_));\n \t \tscore->setReadOnly(true);\n  \t\tscore->setFixedWidth(100);\n  \t\ts->addRow(n,score);\n  \t\toptions->addLayout(s);\n  \t\toptions->setStretch(3,0.5);\n  \t\t\n\t\t\/\/make welcome screen invisible and unaccessible\n\t\tname_->setEnabled(false);\n\t\tname_->setHidden(true);\n\t\tname_->setReadOnly(true);\n\t\n\t\tstarted = true;\n\t\tlives_ = 3;\n\t}\n\telse\n\t{\n\t\t\/\/reset values\n\t\ttimer->stop();\n\t\tspeed = 15;\n\t\ttimer->setInterval(speed);\n\t\tscore_ = 0;\n\t\tlives_ = 3;\n\t\texecutions = 0;\n\t\tlose = 0;\n\t\tcanLose = true;\n\t\tlen = 3500;\n\t\t\n\t\t\/\/delete items if not already deleted\n\t\tif(!finished)\n\t\t\t{\n\t\t\t\/\/delete player\n\t\t\tdelete player;\n\t\t\t\n\t\t\t\/\/delete enemies\n\t\t\tfor(QVector<Item*>::iterator it = items.begin(); it != items.end(); ++it)\n\t\t\t{\n\t\t\t\tItem* temp = *it;\n\t\t\t\tscene->removeItem(temp);\n\t\t\t\tdelete temp;\n\t\t\t}\n\t\t\titems.clear();\n\t\t\n\t\t\t\/\/delete lives\n\t\t\tfor(QVector<Life*>::iterator it = lives.begin(); it != lives.end(); ++ it)\n\t\t\t{\n\t\t\t\tLife* temp = *it;\n\t\t\t\tscene->removeItem(temp);\n\t\t\t\tdelete temp;\n\t\t\t}\n\t\t\tlives.clear();\n\t\t\t}\n\t\t}\n\t\t\n\t\tfinished = false;\n\t\t\/\/hide message\n\t\tmessage->setVisible(false);\n\t\t\n\t\t\/\/create new player\n\t\tplayer = new Player();\n\t\tscene->addItem(player);\n\t\t\n\t\t\/\/create lives\n\t\tint x = 5;\n\t\tfor(int i=0;i<3;i++)\n\t\t{\n\t\t\tlife = new Life(x,5,l);\n\t\t\tscene->addItem(life);\n\t\t\tlives.push_back(life);\n\t\t\tx = x+15;\n\t\t}\n\t\t\n\t\t\/\/start timer\n\t\ttimer->start();\n}\n\n\/**\nPauses the game. Only applicable if the game has already been started. When pressed, the game timer is stopped and the button text changed to \"Continue\". If pressed again, the text is changed back and the timer started.\n*\/\nvoid MainWindow::pauseGame()\n{\n\tif(started)\n\t{\n\t\tif(timer->isActive())\n\t\t{\n\t\t\ttimer->stop();\n\t\t\tpause->setText(\"Continue\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttimer->start();\n\t\t\tpause->setText(\"Pause\");\n\t\t}\n\t}\n}\n\n\/**\nHandles the timer every time it timesout. If invincible mode is checked, no collisions will be checked. Otherwise it will first check against the walls and then against the items.\n\nIf a player holds no lives, endGame() is called. If not, Items are then moved.\n\nhandleTimer() also checks if new enemies should be spawned or if the game should be sped up.\n*\/\nvoid MainWindow::handleTimer()\n{\n  if(!invincible->isChecked())\n  {\n\t\/\/check collisions against wall if not invincible\n\tif(canLose)\n\t{\n\t\tif((player->getY() <= 0) || ((player->getY() + 50) >= 350))\n\t\t{\n\t\t\tloseLife();\n\t\t\treturn;\n\t\t}\n\t}\n\telse if(lose == 51)\n\t{\n\t\tcanLose = true;\n\t\tlose = 0;\n\t\tplayer->setVisible(true);\n\t}\n\telse\n\t{\n\t\tif(lose % 2)\n\t\t\tplayer->setVisible(false);\n\t\telse\n\t\t\tplayer->setVisible(true);\n\t\tlose++;\n\t}\n\t\n\t\/\/check collisions against enemies if not invincible\n\tfor(QVector<Item*>::iterator it = items.begin(); it != items.end(); ++it)\n\t{\n\t  Item* temp = *it;\n\t  temp->collide();\n\t}\n\n\t\/\/check if dead\n\tif(!lives_)\n\t{\n\t\tendGame();\n\t\treturn;\n\t}\n  }\n\t\/\/check if items left the scene\n\tdeleteEnemies();\n\t\n\t\/\/move items\n\tfor(QVector<Item*>::iterator it = items.begin(); it != items.end(); ++it)\n\t{\n\t\tItem* temp = *it;\n\t\ttemp->move();\n\t}\n\n\t\/\/move player and checkes mousePress for player velocity\n\tint v;\n\tif(qApp->mouseButtons() == Qt::LeftButton)\t\n\t\tv = 0;\n\telse\n\t\tv = 1;\n\tplayer->move(v);\n\n\t\/\/create enemies\n\tif(!(executions % (len\/50)))\n\t{\n\t\tcreateEnemies();\n\t}\n\n\t\/\/increase score and executions\n\tscore_++;\n\tscore->setText(QString::number(score_));\n\texecutions++;\n\t\n\t\/\/check if game requires speeding up\n\tif(!(executions % len) && (len <= 15000))\n\t{\n\t\tspeed = speed \/ 2;\n\t\ttimer->setInterval(speed);\n\t\tlen = len + 5000;\n\t}\n}\n\n\/**\nCreates a new item. The new item is randomized. For WhiteMushrooms and TornadoSteps, they must also be selected by a second random statement.\n*\/\nvoid MainWindow::createEnemies()\n{\n\t\/\/randomly create enemies\n\tsrand(time(0));\n\tint a = rand() % 7;\n\tint b = rand() % 300;\n\t\n\tswitch(a)\n\t{\n\t\t\/\/create red nocture\n\t\tcase 1:\n\t\t{\n\t\t\tnewItem = new RedNocturne(b,rn1,rn2,player,this);\n\t\t\tscene->addItem(newItem);\n\t\t\titems.push_back(newItem);\n\t\t\treturn;\n\t\t}\n\t\t\/\/create aquatank\n\t\tcase 2:\n\t\t{\n\t\t\tnewItem = new Aquatank(b,at,player,this);\n\t\t\tscene->addItem(newItem);\n\t\t\titems.push_back(newItem);\n\t\t\treturn;\n\t\t}\n\t\t\/\/chance to create white mushroom\n\t\tcase 3:\n\t\t{\n\t\t\tint c = rand() % 3;\n\t\t\t\/\/create gem\n\t\t\tif(!c)\n\t\t\t{\n\t\t\t\tnewItem = new WhiteMushroom(b,player,wm1,wm2,this);\n\t\t\t\tscene->addItem(newItem);\n\t\t\t\titems.push_back(newItem);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t\/\/chance to create tornado step\n\t\tcase 4:\n\t\t{\n\t\t\tint c = rand() % 3;\n\t\t\t\/\/create gem\n\t\t\tif(!c)\n\t\t\t{\n\t\t\t\t\/\/make sure b is in boundaries\n\t\t\t\tif(b > 250)\n\t\t\t\t\tb = 200;\n\t\t\t\tnewItem = new TornadoStep(b,ts1,ts2,player,this);\n\t\t\t\tscene->addItem(newItem);\n\t\t\t\titems.push_back(newItem);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t\/\/create air soldier\n\t\tcase 5:\n\t\t{\n\t\t\tnewItem = new AirSoldier(as1,as2,player,this);\n\t\t\tscene->addItem(newItem);\n\t\t\titems.push_back(newItem);\n\t\t\treturn;\n\t\t}\n\t\t\/\/create gargoyle\n\t\tcase 6:\n\t\t{\n\t\t\tnewItem = new Gargoyle(player->getY(),g1,g2,player,this);\n\t\t\tscene->addItem(newItem);\n\t\t\titems.push_back(newItem);\n\t\t\treturn;\n\t\t}\n\t}\n\n}\n\n\/**\nCalled when a player loses a life. Decreases the count and delets a Life image in the corner. Starts the canLose buffer so that a user can avoid the object that just killed them.\n*\/\nvoid MainWindow::loseLife()\n{\n\tlives_--;\n\tlife = lives.back();\n\tscene->removeItem(life);\n\tlives.pop_back();\n\tplayer->setVisible(false);\n\tlose = 0;\n\tcanLose = false;\n}\n\n\/**\nEnds the game. Stops the timer and sets the finished flag. Removes and deletes the player and the items. Also sets the GameOver message.\n*\/\nvoid MainWindow::endGame()\n{\n\ttimer->stop();\n\tfinished = true;\n\tscene->removeItem(player);\n\n\/*\tQVector<Life*>::iterator it = lives.begin();\n\twhile(it != lives.end())\n\t{\n\t\tLife* temp = *it;\n\t\tscene->removeItem(temp);\n\t\tdelete temp;\n\t\t++it;\n\t}\n\t\n\tfor(QVector<Item*>::iterator it = items.begin(); it != items.end(); ++it)\n\t{\n\t\tItem* temp = *it;\n\t\tscene->removeItem(temp);\n\t\tdelete temp;\n\t}\n\titems.clear();\n*\/\t\n\t\/\/set gameover message\n\tmessage->setEnd();\n\tmessage->setVisible(true);\n}\n\n\/**\nCalled by WhiteMushroom. Gives the user an additional life.\n*\/\nvoid MainWindow::gainLife()\n{\n\tlives_++;\n\t\n\t\n\tLife* end = lives.back();\n\tlife = new Life((end->getX()+15),5,l);\n\tscene->addItem(life);\n\tlives.push_back(life);\n}\n\n\/**\nCalled by TornadoStep. Gives the user 100 additional points.\n*\/\nvoid MainWindow::gainPoints()\n{\n\tscore_ = score_ + 100;\n\tscore->setText(QString::number(score_));\n}\n\n\/**\nIterates through the vector of items. If the item has moved past the left boundary, it is deleted.\n*\/\nvoid MainWindow::deleteEnemies()\n{\n\tQVector<Item*>::iterator it = items.begin();\n\t\n\twhile(it != items.end())\n\t{\n\t\tItem* temp = *it;\n\t\tif(temp->getX() <= -20)\n\t \t {\n\t\t\tit = items.erase(it);\n\t\t\tscene->removeItem(temp);\n\t\t\tdelete temp;\n\t\t}\n\t  \telse\n\t\t  ++it;\n\t}\n}\n\n\/**\n@param x number of lives to set lives_ to\nCalled by Aquatank. Sets the number of lives to x.\n*\/\nvoid MainWindow::setLife(int x)\n{\n\tlives_ = x;\n}\n<commit_msg>Finalized enemy spawning.<commit_after>#include \"main.h\"\n#include <iostream>\n\n\/**\n\n*\/\nMainWindow::MainWindow()\n{\n  \/\/set variables\n\tstarted = false;\n\tfinished = true;\n\tscore_ = 0;\n\tlives_ = 0;\n\texecutions = 0;\n\tspeed = 15;\n\tcanLose = true;\n\tlen = 3500;\n\t\n  \/\/create Pixmap images\n  \tas1 = new QPixmap(\"images\/airsoldier1.png\",\"png\");\n  \tas2 = new QPixmap(\"images\/airsoldier2.png\",\"png\");\n  \tat = new QPixmap(\"images\/aquatank.png\",\"png\");\n  \tg1 = new QPixmap(\"images\/gargoyle1.png\",\"png\");\n  \tg2 = new QPixmap(\"images\/gargoyle2.png\",\"png\");\n  \trn1 = new QPixmap(\"images\/rednocturne1.png\",\"png\");\n  \trn2 = new QPixmap(\"images\/rednocturne2.png\",\"png\");\n  \tts1 = new QPixmap(\"images\/tornadostep1.png\",\"png\");\n  \tts2 = new QPixmap(\"images\/tornadostep2.png\",\"png\");\n  \twm1 = new QPixmap(\"images\/whitemushroom1.png\",\"png\");\n  \twm2 = new QPixmap(\"images\/whitemushroom2.png\",\"png\");\n  \tl = new QPixmap(\"images\/life.png\",\"png\");\n  \tbg = new QPixmap(\"images\/background.png\",\"png\");\n  \tbgs = new QPixmap(\"images\/startbackground.png\",\"png\");\n  \/\/create overall layout\n\tthis->setGeometry(1,0,20,20);\n\t\n\twindow = new QWidget;\n\tsetCentralWidget(window);\n\tlayout = new QVBoxLayout(window);\n\twindow->setLayout(layout);\n\t\n  \/\/create options sidebar \n\toptions = new QHBoxLayout();\n\tlayout->addLayout(options);\n  \/\/create gamespace\n\tscene = new QGraphicsScene();\n\tscene->setSceneRect(0,0,650,350);\n\tview = new QGraphicsView(scene);\n\tview->setFixedSize(675,375);\n\tQRect r(0,0,675,375);\n\tQColor c(Qt::black);\n\tQBrush b(c,*bgs);\n\tview->setBackgroundBrush(b);\n \tlayout->addWidget(view);\n\n  \/\/create start button\n  \tstart = new QPushButton(\"Start Game\");\n\toptions->addWidget(start);\n\tQObject::connect(start,SIGNAL(clicked()),this,SLOT(startGame()));\n\n  \/\/create pause button\n  \tpause = new QPushButton(\"Pause Game\");\n  \toptions->addWidget(pause);\n  \tQObject::connect(pause,SIGNAL(clicked()),this,SLOT(pauseGame()));\n  \/\/create quit button\n\tquit = new QPushButton(\"Quit Game\");\n\toptions->addWidget(quit);\n\tQObject::connect(quit,SIGNAL(clicked()),qApp,SLOT(quit()));\n  \/\/create invincibility option\n  \tinvincible = new QRadioButton(\"Invincible Mode?\",this);\n  \toptions->addWidget(invincible);\n  \t\n  \/\/create message text\n  \tmessage = new Message();\n  \tmessage->setStart();\n  \tscene->addItem(message);\n  \n  \/\/create input for name\n\tname_ = new QLineEdit();\n\tname_->setGeometry(300,250,190,30);\n \tscene->addWidget(name_);\n \t\n  \/\/create timer\n  \ttimer = new QTimer();\n\ttimer->setInterval(speed);\n\tQObject::connect(timer,SIGNAL(timeout()),this,SLOT(handleTimer()));\n}\n\n\/**\nDeletes the timer. \n*\/\nMainWindow::~MainWindow()\n{\n\tdelete timer;\n\tdelete window;\n}\n\n\/**\nStarts or restarts the game. If a game hasn't been started, it checks for a user name input and, if valid, starts a game.\n\nIf a game is in the middle of gameplay, the current items are deleted and values\/items are reset to their initialized state.\n\nIf a game has ended, initial items are created.\n\nThe game timer is started in this function.\n*\/\nvoid MainWindow::startGame()\n{\n\tif(!started)\n\t{\n\t\t\/\/grab username\n\t\tQString n = name_->text();\n\t\t\/\/if empty, the game won't start;\n\t\tif(n == \"\")\n\t\t\treturn;\n\t\t\n\t\t\/\/create username and score output\n\t\tn = n + \" Score\";\n\t\ts = new QFormLayout();\n \t \tscore = new QLineEdit(QString::number(score_));\n \t \tscore->setReadOnly(true);\n  \t\tscore->setFixedWidth(100);\n  \t\ts->addRow(n,score);\n  \t\toptions->addLayout(s);\n  \t\toptions->setStretch(3,0.5);\n  \t\t\n\t\t\/\/make welcome screen invisible and unaccessible\n\t\tname_->setEnabled(false);\n\t\tname_->setHidden(true);\n\t\tname_->setReadOnly(true);\n\t\n\t\tstarted = true;\n\t\tlives_ = 3;\n\t}\n\telse\n\t{\n\t\t\/\/reset values\n\t\ttimer->stop();\n\t\tspeed = 15;\n\t\ttimer->setInterval(speed);\n\t\tscore_ = 0;\n\t\tlives_ = 3;\n\t\texecutions = 0;\n\t\tlose = 0;\n\t\tcanLose = true;\n\t\tlen = 3500;\n\t\t\n\t\t\/\/delete items if not already deleted\n\t\tif(!finished)\n\t\t\t{\n\t\t\t\/\/delete player\n\t\t\tdelete player;\n\t\t\t\n\t\t\t\/\/delete enemies\n\t\t\tfor(QVector<Item*>::iterator it = items.begin(); it != items.end(); ++it)\n\t\t\t{\n\t\t\t\tItem* temp = *it;\n\t\t\t\tscene->removeItem(temp);\n\t\t\t\tdelete temp;\n\t\t\t}\n\t\t\titems.clear();\n\t\t\n\t\t\t\/\/delete lives\n\t\t\tfor(QVector<Life*>::iterator it = lives.begin(); it != lives.end(); ++ it)\n\t\t\t{\n\t\t\t\tLife* temp = *it;\n\t\t\t\tscene->removeItem(temp);\n\t\t\t\tdelete temp;\n\t\t\t}\n\t\t\tlives.clear();\n\t\t\t}\n\t\t}\n\t\t\n\t\tfinished = false;\n\t\t\/\/hide message\n\t\tmessage->setVisible(false);\n\t\t\n\t\t\/\/create new player\n\t\tplayer = new Player();\n\t\tscene->addItem(player);\n\t\t\n\t\t\/\/create lives\n\t\tint x = 5;\n\t\tfor(int i=0;i<3;i++)\n\t\t{\n\t\t\tlife = new Life(x,5,l);\n\t\t\tscene->addItem(life);\n\t\t\tlives.push_back(life);\n\t\t\tx = x+15;\n\t\t}\n\t\t\n\t\t\/\/start timer\n\t\ttimer->start();\n}\n\n\/**\nPauses the game. Only applicable if the game has already been started. When pressed, the game timer is stopped and the button text changed to \"Continue\". If pressed again, the text is changed back and the timer started.\n*\/\nvoid MainWindow::pauseGame()\n{\n\tif(started)\n\t{\n\t\tif(timer->isActive())\n\t\t{\n\t\t\ttimer->stop();\n\t\t\tpause->setText(\"Continue\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttimer->start();\n\t\t\tpause->setText(\"Pause\");\n\t\t}\n\t}\n}\n\n\/**\nHandles the timer every time it timesout. If invincible mode is checked, no collisions will be checked. Otherwise it will first check against the walls and then against the items.\n\nIf a player holds no lives, endGame() is called. If not, Items are then moved.\n\nhandleTimer() also checks if new enemies should be spawned or if the game should be sped up.\n*\/\nvoid MainWindow::handleTimer()\n{\n  if(!invincible->isChecked())\n  {\n\t\/\/check collisions against wall if not invincible\n\tif(canLose)\n\t{\n\t\tif((player->getY() <= 0) || ((player->getY() + 50) >= 350))\n\t\t{\n\t\t\tloseLife();\n\t\t\treturn;\n\t\t}\n\t}\n\telse if(lose == 51)\n\t{\n\t\tcanLose = true;\n\t\tlose = 0;\n\t\tplayer->setVisible(true);\n\t}\n\telse\n\t{\n\t\tif(lose % 2)\n\t\t\tplayer->setVisible(false);\n\t\telse\n\t\t\tplayer->setVisible(true);\n\t\tlose++;\n\t}\n\t\n\t\/\/check collisions against enemies if not invincible\n\tfor(QVector<Item*>::iterator it = items.begin(); it != items.end(); ++it)\n\t{\n\t  Item* temp = *it;\n\t  temp->collide();\n\t}\n\n\t\/\/check if dead\n\tif(!lives_)\n\t{\n\t\tendGame();\n\t\treturn;\n\t}\n  }\n\t\/\/check if items left the scene\n\tdeleteEnemies();\n\t\n\t\/\/move items\n\tfor(QVector<Item*>::iterator it = items.begin(); it != items.end(); ++it)\n\t{\n\t\tItem* temp = *it;\n\t\ttemp->move();\n\t}\n\n\t\/\/move player and checkes mousePress for player velocity\n\tint v;\n\tif(qApp->mouseButtons() == Qt::LeftButton)\t\n\t\tv = 0;\n\telse\n\t\tv = 1;\n\tplayer->move(v);\n\n\t\/\/create enemies\n\tif(!(executions % 100))\n\t{\n\t\tcreateEnemies();\n\t}\n\n\t\/\/increase score and executions\n\tscore_++;\n\tscore->setText(QString::number(score_));\n\texecutions++;\n\t\n\t\/\/check if game requires speeding up\n\tif(!(executions % len) && (len <= 15000))\n\t{\n\t\tspeed = speed \/ 2;\n\t\ttimer->setInterval(speed);\n\t\tlen = len + 5000;\n\t}\n}\n\n\/**\nCreates a new item. The new item is randomized. For WhiteMushrooms and TornadoSteps, they must also be selected by a second random statement.\n*\/\nvoid MainWindow::createEnemies()\n{\n\t\/\/randomly create enemies\n\tsrand(time(0));\n\tint a = rand() % 7;\n\tint b = rand() % 300;\n\t\n\tswitch(a)\n\t{\n\t\t\/\/create red nocture\n\t\tcase 1:\n\t\t{\n\t\t\tnewItem = new RedNocturne(b,rn1,rn2,player,this);\n\t\t\tscene->addItem(newItem);\n\t\t\titems.push_back(newItem);\n\t\t\treturn;\n\t\t}\n\t\t\/\/create aquatank\n\t\tcase 2:\n\t\t{\n\t\t\tnewItem = new Aquatank(b,at,player,this);\n\t\t\tscene->addItem(newItem);\n\t\t\titems.push_back(newItem);\n\t\t\treturn;\n\t\t}\n\t\t\/\/chance to create white mushroom\n\t\tcase 3:\n\t\t{\n\t\t\tint c = rand() % 3;\n\t\t\t\/\/create gem\n\t\t\tif(!c)\n\t\t\t{\n\t\t\t\tnewItem = new WhiteMushroom(b,player,wm1,wm2,this);\n\t\t\t\tscene->addItem(newItem);\n\t\t\t\titems.push_back(newItem);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t\/\/chance to create tornado step\n\t\tcase 4:\n\t\t{\n\t\t\tint c = rand() % 3;\n\t\t\t\/\/create gem\n\t\t\tif(!c)\n\t\t\t{\n\t\t\t\t\/\/make sure b is in boundaries\n\t\t\t\tif(b > 250)\n\t\t\t\t\tb = 200;\n\t\t\t\tnewItem = new TornadoStep(b,ts1,ts2,player,this);\n\t\t\t\tscene->addItem(newItem);\n\t\t\t\titems.push_back(newItem);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t\/\/create air soldier\n\t\tcase 5:\n\t\t{\n\t\t\tnewItem = new AirSoldier(as1,as2,player,this);\n\t\t\tscene->addItem(newItem);\n\t\t\titems.push_back(newItem);\n\t\t\treturn;\n\t\t}\n\t\t\/\/create gargoyle\n\t\tcase 6:\n\t\t{\n\t\t\tnewItem = new Gargoyle(player->getY(),g1,g2,player,this);\n\t\t\tscene->addItem(newItem);\n\t\t\titems.push_back(newItem);\n\t\t\treturn;\n\t\t}\n\t}\n\n}\n\n\/**\nCalled when a player loses a life. Decreases the count and delets a Life image in the corner. Starts the canLose buffer so that a user can avoid the object that just killed them.\n*\/\nvoid MainWindow::loseLife()\n{\n\tlives_--;\n\tlife = lives.back();\n\tscene->removeItem(life);\n\tlives.pop_back();\n\tplayer->setVisible(false);\n\tlose = 0;\n\tcanLose = false;\n}\n\n\/**\nEnds the game. Stops the timer and sets the finished flag. Removes and deletes the player and the items. Also sets the GameOver message.\n*\/\nvoid MainWindow::endGame()\n{\n\ttimer->stop();\n\tfinished = true;\n\tscene->removeItem(player);\n\n\tQVector<Life*>::iterator it = lives.begin();\n\twhile(it != lives.end())\n\t{\n\t\tLife* temp = *it;\n\t\tscene->removeItem(temp);\n\t\tdelete temp;\n\t\t++it;\n\t}\n\t\n\tfor(QVector<Item*>::iterator it = items.begin(); it != items.end(); ++it)\n\t{\n\t\tItem* temp = *it;\n\t\tscene->removeItem(temp);\n\t\tdelete temp;\n\t}\n\titems.clear();\n\n\t\/\/set gameover message\n\tmessage->setEnd();\n\tmessage->setVisible(true);\n}\n\n\/**\nCalled by WhiteMushroom. Gives the user an additional life.\n*\/\nvoid MainWindow::gainLife()\n{\n\tlives_++;\n\t\n\t\n\tLife* end = lives.back();\n\tlife = new Life((end->getX()+15),5,l);\n\tscene->addItem(life);\n\tlives.push_back(life);\n}\n\n\/**\nCalled by TornadoStep. Gives the user 100 additional points.\n*\/\nvoid MainWindow::gainPoints()\n{\n\tscore_ = score_ + 100;\n\tscore->setText(QString::number(score_));\n}\n\n\/**\nIterates through the vector of items. If the item has moved past the left boundary, it is deleted.\n*\/\nvoid MainWindow::deleteEnemies()\n{\n\tQVector<Item*>::iterator it = items.begin();\n\t\n\twhile(it != items.end())\n\t{\n\t\tItem* temp = *it;\n\t\tif(temp->getX() <= -20)\n\t \t {\n\t\t\tit = items.erase(it);\n\t\t\tscene->removeItem(temp);\n\t\t\tdelete temp;\n\t\t}\n\t  \telse\n\t\t  ++it;\n\t}\n}\n\n\/**\n@param x number of lives to set lives_ to\nCalled by Aquatank. Sets the number of lives to x.\n*\/\nvoid MainWindow::setLife(int x)\n{\n\tlives_ = x;\n}\n<|endoftext|>"}
{"text":"<commit_before>20dfa487-2e4f-11e5-b903-28cfe91dbc4b<commit_msg>20e6e5c0-2e4f-11e5-a542-28cfe91dbc4b<commit_after>20e6e5c0-2e4f-11e5-a542-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>809e91a0-2d15-11e5-af21-0401358ea401<commit_msg>809e91a1-2d15-11e5-af21-0401358ea401<commit_after>809e91a1-2d15-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>5e5893e3-2d16-11e5-af21-0401358ea401<commit_msg>5e5893e4-2d16-11e5-af21-0401358ea401<commit_after>5e5893e4-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>e2f416f3-2e4e-11e5-a40a-28cfe91dbc4b<commit_msg>e2fc6551-2e4e-11e5-8060-28cfe91dbc4b<commit_after>e2fc6551-2e4e-11e5-8060-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>9101ad0c-2d14-11e5-af21-0401358ea401<commit_msg>9101ad0d-2d14-11e5-af21-0401358ea401<commit_after>9101ad0d-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>90345a35-2e4f-11e5-acfe-28cfe91dbc4b<commit_msg>90407adc-2e4f-11e5-ab55-28cfe91dbc4b<commit_after>90407adc-2e4f-11e5-ab55-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>11b5d794-585b-11e5-b3dc-6c40088e03e4<commit_msg>11bd6ba8-585b-11e5-b00c-6c40088e03e4<commit_after>11bd6ba8-585b-11e5-b00c-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>1c8f9e91-2e4f-11e5-9bfe-28cfe91dbc4b<commit_msg>1c9d137d-2e4f-11e5-bf1e-28cfe91dbc4b<commit_after>1c9d137d-2e4f-11e5-bf1e-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>b74f7d6b-2e4f-11e5-9d3d-28cfe91dbc4b<commit_msg>b756aa07-2e4f-11e5-935c-28cfe91dbc4b<commit_after>b756aa07-2e4f-11e5-935c-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before><commit_msg>For G3 use included origin from log<commit_after><|endoftext|>"}
{"text":"<commit_before>3aeea3c0-5216-11e5-9b10-6c40088e03e4<commit_msg>3af58a64-5216-11e5-a23c-6c40088e03e4<commit_after>3af58a64-5216-11e5-a23c-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>1086830c-2f67-11e5-a8c2-6c40088e03e4<commit_msg>108d90a4-2f67-11e5-9b11-6c40088e03e4<commit_after>108d90a4-2f67-11e5-9b11-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>69c5b186-5216-11e5-9cc2-6c40088e03e4<commit_msg>69d480da-5216-11e5-9d9d-6c40088e03e4<commit_after>69d480da-5216-11e5-9d9d-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>f33e2e61-2747-11e6-8999-e0f84713e7b8<commit_msg>Really doesn't crash if X, now<commit_after>f34d34fa-2747-11e6-9e0b-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>fd91d28a-2e4e-11e5-9db1-28cfe91dbc4b<commit_msg>fd9962d1-2e4e-11e5-8ceb-28cfe91dbc4b<commit_after>fd9962d1-2e4e-11e5-8ceb-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file RNTupleDS.cxx\n\/\/\/ \\ingroup NTuple ROOT7\n\/\/\/ \\author Jakob Blomer <jblomer@cern.ch>\n\/\/\/ \\date 2018-10-04\n\/\/\/ \\warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback\n\/\/\/ is welcome!\n\n\/*************************************************************************\n * Copyright (C) 1995-2019, 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#include <ROOT\/RField.hxx>\n#include <ROOT\/RFieldValue.hxx>\n#include <ROOT\/RNTupleDescriptor.hxx>\n#include <ROOT\/RNTupleDS.hxx>\n#include <ROOT\/RNTupleUtil.hxx>\n#include <ROOT\/RPageStorage.hxx>\n#include <ROOT\/RStringView.hxx>\n\n#include <TError.h>\n\n#include <string>\n#include <vector>\n#include <typeinfo>\n#include <utility>\n\nnamespace ROOT {\nnamespace Experimental {\n\nvoid ROOT::Experimental::RNTupleDS::AddFields(const RNTupleDescriptor &desc, DescriptorId_t parentId)\n{\n   for (const auto& f : desc.GetFieldRange(parentId)) {\n      fColumnNames.emplace_back(desc.GetQualifiedFieldName(f.GetId()));\n      fColumnTypes.emplace_back(f.GetTypeName());\n      fColumnFieldIds.emplace_back(f.GetId());\n      if (f.GetStructure() == ENTupleStructure::kRecord)\n         AddFields(desc, f.GetId());\n   }\n}\n\n\nROOT::Experimental::RNTupleDS::RNTupleDS(std::unique_ptr<Detail::RPageSource> pageSource)\n{\n   pageSource->Attach();\n   const auto &descriptor = pageSource->GetDescriptor();\n\n   AddFields(descriptor, descriptor.GetFieldZeroId());\n\n   fSources.emplace_back(std::move(pageSource));\n}\n\n\nRDF::RDataSource::Record_t RNTupleDS::GetColumnReadersImpl(std::string_view name, const std::type_info& \/* ti *\/)\n{\n   const auto colIdx = std::distance(\n      fColumnNames.begin(), std::find(fColumnNames.begin(), fColumnNames.end(), name));\n   \/\/ TODO(jblomer): check expected type info like in, e.g., RRootDS.cxx\n\n   std::vector<void*> ptrs;\n   for (unsigned int slot = 0; slot < fNSlots; ++slot) {\n      if (!fValuePtrs[slot][colIdx]) {\n         const auto &descriptor = fSources[slot]->GetDescriptor();\n         auto colName = fColumnNames[colIdx];\n         auto typeName = fColumnTypes[colIdx];\n         auto fieldId = descriptor.FindFieldId(colName);\n         fFields[slot][colIdx] = std::unique_ptr<Detail::RFieldBase>(\n            Detail::RFieldBase::Create(descriptor.GetFieldDescriptor(fieldId).GetFieldName(), typeName));\n         Detail::RFieldFuse::ConnectRecursively(fieldId, *fSources[slot], *fFields[slot][colIdx]);\n         fValues[slot][colIdx] = fFields[slot][colIdx]->GenerateValue();\n         fValuePtrs[slot][colIdx] = fValues[slot][colIdx].GetRawPtr();\n         if (slot == 0)\n            fActiveColumns.emplace_back(colIdx);\n      }\n      ptrs.push_back(&fValuePtrs[slot][colIdx]);\n   }\n\n   return ptrs;\n}\n\nbool RNTupleDS::SetEntry(unsigned int slot, ULong64_t entryIndex)\n{\n   for (auto colIdx : fActiveColumns) {\n      fFields[slot][colIdx]->Read(entryIndex, &fValues[slot][colIdx]);\n   }\n   return true;\n}\n\nstd::vector<std::pair<ULong64_t, ULong64_t>> RNTupleDS::GetEntryRanges()\n{\n   \/\/ TODO(jblomer): use cluster boundaries for the entry ranges\n   std::vector<std::pair<ULong64_t, ULong64_t>> ranges;\n   if (fHasSeenAllRanges) return ranges;\n\n   auto nEntries = fSources[0]->GetNEntries();\n   const auto chunkSize = nEntries \/ fNSlots;\n   const auto reminder = 1U == fNSlots ? 0 : nEntries % fNSlots;\n   auto start = 0UL;\n   auto end = 0UL;\n   for (auto i : ROOT::TSeqU(fNSlots)) {\n      start = end;\n      end += chunkSize;\n      ranges.emplace_back(start, end);\n      (void)i;\n   }\n   ranges.back().second += reminder;\n   fHasSeenAllRanges = true;\n   return ranges;\n}\n\n\nstd::string RNTupleDS::GetTypeName(std::string_view colName) const\n{\n   const auto index = std::distance(\n      fColumnNames.begin(), std::find(fColumnNames.begin(), fColumnNames.end(), colName));\n   return fColumnTypes[index];\n}\n\n\nbool RNTupleDS::HasColumn(std::string_view colName) const\n{\n   return std::find(fColumnNames.begin(), fColumnNames.end(), colName) !=\n          fColumnNames.end();\n}\n\n\nvoid RNTupleDS::Initialise()\n{\n   fHasSeenAllRanges = false;\n}\n\n\nvoid RNTupleDS::Finalise()\n{\n}\n\n\nvoid RNTupleDS::SetNSlots(unsigned int nSlots)\n{\n   R__ASSERT(fNSlots == 0);\n   R__ASSERT(nSlots > 0);\n   fNSlots = nSlots;\n\n   fFields.resize(fNSlots);\n   fValues.resize(fNSlots);\n   fValuePtrs.resize(fNSlots);\n   for (unsigned int i = 1; i < fNSlots; ++i) {\n      fSources.emplace_back(fSources[0]->Clone());\n      R__ASSERT(i == (fSources.size() - 1));\n      fSources[i]->Attach();\n   }\n\n   auto nColumns = fColumnNames.size();\n   for (unsigned int i = 0; i < fNSlots; ++i) {\n      fFields[i].resize(nColumns);\n      fValues[i].resize(nColumns);\n      fValuePtrs[i].resize(nColumns, nullptr);\n   }\n}\n\n\nRDataFrame MakeNTupleDataFrame(std::string_view ntupleName, std::string_view fileName)\n{\n   auto pageSource = Detail::RPageSource::Create(ntupleName, fileName);\n   ROOT::RDataFrame rdf(std::make_unique<RNTupleDS>(std::move(pageSource)));\n   return rdf;\n}\n\n} \/\/ ns Experimental\n} \/\/ ns ROOT\n<commit_msg>[RNTupleDS][NFC] Use fully qualified name for free function definition<commit_after>\/\/\/ \\file RNTupleDS.cxx\n\/\/\/ \\ingroup NTuple ROOT7\n\/\/\/ \\author Jakob Blomer <jblomer@cern.ch>\n\/\/\/ \\date 2018-10-04\n\/\/\/ \\warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback\n\/\/\/ is welcome!\n\n\/*************************************************************************\n * Copyright (C) 1995-2019, 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#include <ROOT\/RField.hxx>\n#include <ROOT\/RFieldValue.hxx>\n#include <ROOT\/RNTupleDescriptor.hxx>\n#include <ROOT\/RNTupleDS.hxx>\n#include <ROOT\/RNTupleUtil.hxx>\n#include <ROOT\/RPageStorage.hxx>\n#include <ROOT\/RStringView.hxx>\n\n#include <TError.h>\n\n#include <string>\n#include <vector>\n#include <typeinfo>\n#include <utility>\n\nnamespace ROOT {\nnamespace Experimental {\n\nvoid RNTupleDS::AddFields(const RNTupleDescriptor &desc, DescriptorId_t parentId)\n{\n   for (const auto& f : desc.GetFieldRange(parentId)) {\n      fColumnNames.emplace_back(desc.GetQualifiedFieldName(f.GetId()));\n      fColumnTypes.emplace_back(f.GetTypeName());\n      fColumnFieldIds.emplace_back(f.GetId());\n      if (f.GetStructure() == ENTupleStructure::kRecord)\n         AddFields(desc, f.GetId());\n   }\n}\n\n\nRNTupleDS::RNTupleDS(std::unique_ptr<Detail::RPageSource> pageSource)\n{\n   pageSource->Attach();\n   const auto &descriptor = pageSource->GetDescriptor();\n\n   AddFields(descriptor, descriptor.GetFieldZeroId());\n\n   fSources.emplace_back(std::move(pageSource));\n}\n\n\nRDF::RDataSource::Record_t RNTupleDS::GetColumnReadersImpl(std::string_view name, const std::type_info& \/* ti *\/)\n{\n   const auto colIdx = std::distance(\n      fColumnNames.begin(), std::find(fColumnNames.begin(), fColumnNames.end(), name));\n   \/\/ TODO(jblomer): check expected type info like in, e.g., RRootDS.cxx\n\n   std::vector<void*> ptrs;\n   for (unsigned int slot = 0; slot < fNSlots; ++slot) {\n      if (!fValuePtrs[slot][colIdx]) {\n         const auto &descriptor = fSources[slot]->GetDescriptor();\n         auto colName = fColumnNames[colIdx];\n         auto typeName = fColumnTypes[colIdx];\n         auto fieldId = descriptor.FindFieldId(colName);\n         fFields[slot][colIdx] = std::unique_ptr<Detail::RFieldBase>(\n            Detail::RFieldBase::Create(descriptor.GetFieldDescriptor(fieldId).GetFieldName(), typeName));\n         Detail::RFieldFuse::ConnectRecursively(fieldId, *fSources[slot], *fFields[slot][colIdx]);\n         fValues[slot][colIdx] = fFields[slot][colIdx]->GenerateValue();\n         fValuePtrs[slot][colIdx] = fValues[slot][colIdx].GetRawPtr();\n         if (slot == 0)\n            fActiveColumns.emplace_back(colIdx);\n      }\n      ptrs.push_back(&fValuePtrs[slot][colIdx]);\n   }\n\n   return ptrs;\n}\n\nbool RNTupleDS::SetEntry(unsigned int slot, ULong64_t entryIndex)\n{\n   for (auto colIdx : fActiveColumns) {\n      fFields[slot][colIdx]->Read(entryIndex, &fValues[slot][colIdx]);\n   }\n   return true;\n}\n\nstd::vector<std::pair<ULong64_t, ULong64_t>> RNTupleDS::GetEntryRanges()\n{\n   \/\/ TODO(jblomer): use cluster boundaries for the entry ranges\n   std::vector<std::pair<ULong64_t, ULong64_t>> ranges;\n   if (fHasSeenAllRanges) return ranges;\n\n   auto nEntries = fSources[0]->GetNEntries();\n   const auto chunkSize = nEntries \/ fNSlots;\n   const auto reminder = 1U == fNSlots ? 0 : nEntries % fNSlots;\n   auto start = 0UL;\n   auto end = 0UL;\n   for (auto i : ROOT::TSeqU(fNSlots)) {\n      start = end;\n      end += chunkSize;\n      ranges.emplace_back(start, end);\n      (void)i;\n   }\n   ranges.back().second += reminder;\n   fHasSeenAllRanges = true;\n   return ranges;\n}\n\n\nstd::string RNTupleDS::GetTypeName(std::string_view colName) const\n{\n   const auto index = std::distance(\n      fColumnNames.begin(), std::find(fColumnNames.begin(), fColumnNames.end(), colName));\n   return fColumnTypes[index];\n}\n\n\nbool RNTupleDS::HasColumn(std::string_view colName) const\n{\n   return std::find(fColumnNames.begin(), fColumnNames.end(), colName) !=\n          fColumnNames.end();\n}\n\n\nvoid RNTupleDS::Initialise()\n{\n   fHasSeenAllRanges = false;\n}\n\n\nvoid RNTupleDS::Finalise()\n{\n}\n\n\nvoid RNTupleDS::SetNSlots(unsigned int nSlots)\n{\n   R__ASSERT(fNSlots == 0);\n   R__ASSERT(nSlots > 0);\n   fNSlots = nSlots;\n\n   fFields.resize(fNSlots);\n   fValues.resize(fNSlots);\n   fValuePtrs.resize(fNSlots);\n   for (unsigned int i = 1; i < fNSlots; ++i) {\n      fSources.emplace_back(fSources[0]->Clone());\n      R__ASSERT(i == (fSources.size() - 1));\n      fSources[i]->Attach();\n   }\n\n   auto nColumns = fColumnNames.size();\n   for (unsigned int i = 0; i < fNSlots; ++i) {\n      fFields[i].resize(nColumns);\n      fValues[i].resize(nColumns);\n      fValuePtrs[i].resize(nColumns, nullptr);\n   }\n}\n} \/\/ ns Experimental\n} \/\/ ns ROOT\n\n\nROOT::RDataFrame ROOT::Experimental::MakeNTupleDataFrame(std::string_view ntupleName, std::string_view fileName)\n{\n   auto pageSource = ROOT::Experimental::Detail::RPageSource::Create(ntupleName, fileName);\n   ROOT::RDataFrame rdf(std::make_unique<RNTupleDS>(std::move(pageSource)));\n   return rdf;\n}\n<|endoftext|>"}
{"text":"<commit_before>3479802b-2e4f-11e5-a71e-28cfe91dbc4b<commit_msg>34840538-2e4f-11e5-b6b8-28cfe91dbc4b<commit_after>34840538-2e4f-11e5-b6b8-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n\n#ifdef _WIN32\n#\tinclude <windows.h>\n#else\n#\tinclude <sys\/time.h>\n#endif\n\n#include <GL\/gl.h>\n#include <GL\/glut.h>\n\n#define KEY_ESCAPE 27\n\nint width = 640;\nint height = 480;\nfloat field_of_view_angle = 45;\nfloat z_near = 1;\nfloat z_far = 500;\n\nvoid display() {\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tglLoadIdentity();\n  gluLookAt(20, -10, 10, 10, 10, 0, 0.0, 0.0, 1.0);\n\n  \/\/ GRID\n  glColor3f(1.0f, 1.0f, 1.0f);\n  for (int i=1; i<100; i++) {\n    glBegin(GL_LINES);\n      glVertex3f(i,   0, 0);\n      glVertex3f(i, 100, 0);\n    glEnd();\n    glBegin(GL_LINES);\n      glVertex3f(0,   i, 0);\n      glVertex3f(100, i, 0);\n    glEnd();\n  }\n\n  \/\/ AXIS\n  glColor3f(1, 0, 0);\n  glBegin(GL_LINES);\n    glVertex3f(0, 0, 0);\n    glVertex3f(100, 0, 0);\n  glEnd();\n  glColor3f(0, 1, 0);\n  glBegin(GL_LINES);\n    glVertex3f(0, 0, 0);\n    glVertex3f(0, 100, 0);\n  glEnd();\n  glColor3f(0, 0, 1);\n  glBegin(GL_LINES);\n    glVertex3f(0, 0, 0);\n    glVertex3f(0, 0, 100);\n  glEnd();\n\n\tglutSwapBuffers();\n}\n\n\nvoid initialize ()  {\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_RGB | GLUT_DOUBLE | GLUT_DEPTH );\n\tglutInitWindowSize(width, height);\n\tglutCreateWindow(\"Darwin's dream\");\n\tglutDisplayFunc(display);\n\tglutIdleFunc( display );\n  glutKeyboardFunc(keyboard);\n\n  glMatrixMode(GL_PROJECTION);\n  glViewport(0, 0, width, height);\n  glMatrixMode(GL_PROJECTION);\n  glLoadIdentity();\n  GLfloat aspect = (GLfloat) width \/ height;\n  gluPerspective(45, aspect, 1, 500);\n  glMatrixMode(GL_MODELVIEW);\n  glShadeModel( GL_SMOOTH );\n  glClearDepth( 1.0f );\n  glEnable( GL_DEPTH_TEST );\n  glDepthFunc( GL_LEQUAL );\n  glHint( GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST );\n  glClearColor(0.0, 0.0, 0.0, 1.0);\n}\n\n\nvoid keyboard ( unsigned char key, int mouseX, int mouseY ) { \n  switch ( key ) {\n    case KEY_ESCAPE:        \n      exit ( 0 );   \n      break;      \n    default:      \n      break;\n  }\n}\n\nint main(int argc, char **argv) {\n\tinitialize();\n\tglutMainLoop();\n\n\treturn 0;\n}\n\n\n<commit_msg>Drawing cubes<commit_after>#include <stdio.h>\n\n#ifdef _WIN32\n#\tinclude <windows.h>\n#else\n#\tinclude <sys\/time.h>\n#endif\n\n#include <GL\/gl.h>\n#include <GL\/glut.h>\n\n#define KEY_ESCAPE 27\n\nint width = 640;\nint height = 480;\n\nvoid drawCube(float x, float y, float z) {\n  glPushMatrix();\n  glTranslatef(x, y, z);\n\n  glBegin(GL_QUADS); \n  glVertex3f(0,0 ,0);\n  glVertex3f(1.0f, 0, 0);\n  glVertex3f(1.0f, 1.0f, 0);\n  glVertex3f(0, 1.0f, 0);\n\n  glVertex3f(0, 0, 0);\n  glVertex3f(0, 0, 1.0f);\n  glVertex3f(0, 1.0f, 0);\n  glVertex3f(0, 1.0f, 1.0f);\n\n  glVertex3f(0, 0, 0);\n  glVertex3f(0, 0, 1.0f);\n  glVertex3f(1.0f, 0, 1.0f);\n  glVertex3f(1.0f, 0, 0);\n\n  glVertex3f(0, 0, 1.0f);\n  glVertex3f(1.0f, 0, 1.0f);\n  glVertex3f(1.0f, 1.0f, 1.0f);\n  glVertex3f(0, 1.0f, 1.0f);\n\n  glVertex3f(0,0 ,1.0f );\n  glVertex3f(1.0f, 0, 1.0f);\n  glVertex3f(1.0f, 1.0f, 1.0f);\n  glVertex3f(0, 1.0f, 1.0f);\n\n  glVertex3f(0, 1.0f, 0);\n  glVertex3f(0, 1.0f, 1.0f);\n  glVertex3f(1.0f, 1.0f, 1.0f);\n  glVertex3f(1.0f, 1.0f, 0);\n  glEnd();\n\n  glPopMatrix();\n}\n\nvoid display() {\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tglLoadIdentity();\n  gluLookAt(20, -10, 10, 10, 0, 0, 0.0, 0.0, 1.0);\n\n  \/\/ GRID\n  glColor3f(1.0f, 1.0f, 1.0f);\n  for (int i=1; i<100; i++) {\n    glBegin(GL_LINES);\n      glVertex3f(i,   0, 0);\n      glVertex3f(i, 100, 0);\n    glEnd();\n    glBegin(GL_LINES);\n      glVertex3f(0,   i, 0);\n      glVertex3f(100, i, 0);\n    glEnd();\n  }\n\n  \/\/ AXIS\n  glColor3f(1, 0, 0);\n  glBegin(GL_LINES);\n    glVertex3f(0, 0, 0);\n    glVertex3f(100, 0, 0);\n  glEnd();\n  glColor3f(0, 1, 0);\n  glBegin(GL_LINES);\n    glVertex3f(0, 0, 0);\n    glVertex3f(0, 100, 0);\n  glEnd();\n  glColor3f(0, 0, 1);\n  glBegin(GL_LINES);\n    glVertex3f(0, 0, 0);\n    glVertex3f(0, 0, 100);\n  glEnd();\n\n  glColor3f(.5, .2, .8);\n  drawCube(0,0,0);\n\n\tglutSwapBuffers();\n}\n\nvoid keyboard ( unsigned char key, int mouseX, int mouseY ) { \n  switch ( key ) {\n    case KEY_ESCAPE:        \n      exit ( 0 );   \n      break;      \n    default:      \n      break;\n  }\n}\n\n\nvoid initialize()  {\n\tglutInitDisplayMode(GLUT_RGB | GLUT_DOUBLE | GLUT_DEPTH );\n\tglutInitWindowSize(width, height);\n\tglutCreateWindow(\"Darwin's dream\");\n\tglutDisplayFunc(display);\n\tglutIdleFunc( display );\n  glutKeyboardFunc(keyboard);\n\n  glMatrixMode(GL_PROJECTION);\n  glViewport(0, 0, width, height);\n  glMatrixMode(GL_PROJECTION);\n  glLoadIdentity();\n  GLfloat aspect = (GLfloat) width \/ height;\n  gluPerspective(45, aspect, 1, 500);\n  glMatrixMode(GL_MODELVIEW);\n  glShadeModel( GL_SMOOTH );\n  glClearDepth( 1.0f );\n  glEnable( GL_DEPTH_TEST );\n  glDepthFunc( GL_LEQUAL );\n  glHint( GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST );\n  glClearColor(0.0, 0.0, 0.0, 1.0);\n}\n\n\nint main(int argc, char **argv) {\n\tglutInit(&argc, argv);\n\tinitialize();\n\tglutMainLoop();\n\n\treturn 0;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  libavg - Media Playback Engine. \n\/\/  Copyright (C) 2003-2008 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\nvoid export_bitmap();\nvoid export_raster();\nvoid export_event();\n#ifndef WIN32\nvoid export_devices();\n#endif\n\n#include \"WrapHelper.h\"\n\n#include \"..\/base\/Logger.h\"\n#include \"..\/base\/Exception.h\"\n#include \"..\/player\/Player.h\"\n#include \"..\/player\/AVGNode.h\"\n#include \"..\/player\/DivNode.h\"\n#include \"..\/player\/PanoImage.h\"\n#include \"..\/player\/Sound.h\"\n\n#include <boost\/version.hpp>\n#include <boost\/shared_ptr.hpp>\n\nusing namespace boost::python;\nusing namespace avg;\n\nvoid export_node()\n{\n    class_<Node, boost::shared_ptr<Node>, boost::noncopyable>(\"Node\",\n            \"Base class for all elements in the avg tree.\",\n            no_init)\n        .def(self == self)\n        .def(self != self)\n        .def(\"__hash__\", &Node::getHash)\n        .def(\"getParent\", &Node::getParent,\n                \"getParent() -> node\\n\"\n                \"Returns the container (AVGNode or DivNode) the node is in. For\\n\"\n                \"the root node, returns None.\\n\")\n        .def(\"unlink\", &Node::unlink,\n                \"unlink() -> None\\n\"\n                \"Removes a node from it's parent container. Equivalent to\\n\"\n                \"node.getParent().removeChild(node.getParent().indexOf(node)).\")\n        .def(\"setEventCapture\", &Node::setMouseEventCapture,\n                \"setEventCapture(cursorid)\\n\"\n                \"Sets up event capturing so that cursor events are sent to this node\\n\"\n                \"regardless of the cursor position. cursorid is optional; if left out,\\n\"\n                \"the mouse cursor is captured. If not, events from a specific tracker\\n\"\n                \"cursor are captured. If the node doesn't handle the event, it\\n\"\n                \"propagates to its parent normally. This function is useful for the\\n\"\n                \"implementation of user interface elements such as scroll bars. Only one\\n\"\n                \"node can capture a cursor at any one time. Normal operation can\\n\"\n                \"be restored by calling releaseEventCapture().\\n\"\n                \"@param cursorid: The id of the tracker cursor to capture (optional).\\n\")\n        .def(\"setEventCapture\", &Node::setEventCapture)\n        .def(\"releaseEventCapture\", &Node::releaseMouseEventCapture,\n                \"releaseEventCapture(cursorid)\\n\"\n                \"Restores normal mouse operation after a call to setEventCapture().\\n\"\n                \"@param cursorid: The id of the tracker cursor to release (optional).\\n\")\n        .def(\"releaseEventCapture\", &Node::releaseEventCapture)\n        .def(\"setEventHandler\", &Node::setEventHandler,\n                \"setEventHandler(type, source, pyfunc)\\n\"\n                \"Sets a callback function that is invoked whenever an event of the\\n\"\n                \"specified type from the specified source occurs. This function is\\n\"\n                \"similar to the event handler node attributes (e.g. oncursordown).\\n\"\n                \"It is more specific since it takes the event source as a parameter\\n\"\n                \"and allows the use of any python callable as callback function.\\n\"\n                \"@param type: One of the event types KEYUP, KEYDOWN, CURSORMOTION,\\n\"\n                \"CURSORUP, CURSORDOWN, CURSOROVER, CURSOROUT, RESIZE or QUIT.\\n\"\n                \"@param source: MOUSE for mouse events, TOUCH for multitouch touch\\n\"\n                \"events, TRACK for multitouch track events or other tracking, \\n\"\n                \"NONE for keyboard events. Sources can be or'ed together to set a\\n\"\n                \"handler for several sources at once.\\n\"\n                \"@param pyfunc: The python callable to invoke.\\n\")\n        .def(\"getAbsPos\", &Node::getAbsPos,\n                \"getAbsPos(relpos) -> abspos\\n\"\n                \"Transforms a position in coordinates relative to the node to a\\n\"\n                \"position in window coordinates.\\n\"\n                \"@param relpos: Relative coordinate to transform.\")\n        .def(\"getRelPos\", &Node::getRelPos,\n                \"getRelPos(abspos) -> relpos\\n\"\n                \"Transforms a position in window coordinates to a position\\n\"\n                \"in coordinates relative to the node.\\n\"\n                \"@param abspos: Absolute coordinate to transform.\")\n        .def(\"getMediaSize\", &Node::getMediaSize,\n                \"getMediaSize() -> mediasize\\n\"\n                \"Returns the size in pixels of the media in the node. Image nodes\\n\"\n                \"return the bitmap size, Camera nodes\\n\"\n                \"the size of a camera frame and Words nodes the amount of space\\n\"\n                \"the text takes. Video nodes the video size if decoding has started\\n\"\n                \"or (0,0) if not.\")\n        .add_property(\"id\", make_function(&Node::getID,\n                return_value_policy<copy_const_reference>()), &Node::setID,\n                \"A unique identifier that can be used to reference the node.\\n\")\n        .add_property(\"x\", &Node::getX, &Node::setX,\n                \"The position of the node's left edge relative to it's parent node.\\n\")\n        .add_property(\"y\", &Node::getY, &Node::setY,\n                \"The position of the node's top edge relative to it's parent node.\\n\")\n        .add_property(\"pos\", make_function(&Node::getPos,\n                return_value_policy<copy_const_reference>()), &Node::setPos,\n                \"The position of the node's top left corner relative to it's parent node.\\n\")\n        .add_property(\"width\", &Node::getWidth, &Node::setWidth)\n        .add_property(\"height\", &Node::getHeight, &Node::setHeight)\n        .add_property(\"size\", &Node::getSize, &Node::setSize)\n        .add_property(\"angle\", &Node::getAngle, &Node::setAngle,\n                \"The angle that the node is rotated to in radians. 0 is\\n\"\n                \"unchanged, 3.14 is upside-down.\\n\")\n        .add_property(\"pivotx\", &Node::getPivotX, &Node::setPivotX,\n                \"x coordinate of the point that the node is rotated around.\\n\"\n                \"Default is the center of the node.\\n\")\n        .add_property(\"pivoty\", &Node::getPivotY, &Node::setPivotY,\n                \"y coordinate of the point that the node is rotated around.\\n\"\n                \"Default is the center of the node.\\n\")\n        .add_property(\"opacity\", &Node::getOpacity, &Node::setOpacity,\n                      \"A measure of the node's transparency. 0.0 is completely\\n\"\n                      \"transparent, 1.0 is completely opaque. Opacity is relative to\\n\"\n                      \"the parent node's opacity.\\n\")\n        .add_property(\"active\", &Node::getActive, &Node::setActive,\n                      \"If this attribute is true, the node behaves as usual. If not, it\\n\"\n                      \"is neither drawn nor does it react to events. Videos are paused.\\n\")\n        .add_property(\"sensitive\", &Node::getSensitive, &Node::setSensitive,\n                      \"A node only reacts to events if sensitive is true.\")\n    ;\n\n    export_bitmap();\n    export_raster();\n   \n    class_<DivNode, bases<Node>, boost::noncopyable>(\"DivNode\", \n            \"A div node is a node that groups other nodes logically and visually.\\n\"\n            \"Its upper left corner is used as point of origin for the coordinates\\n\"\n            \"of its child nodes. Its extents are used to clip the children. Its\\n\"\n            \"opacity is used as base opacity for the child nodes' opacities.\\n\"\n            \"The children of a div node are drawn in the order they are found\\n\"\n            \"in the avg file.\",\n            no_init)\n        .add_property(\"mediadir\", make_function(&DivNode::getMediaDir,\n                return_value_policy<copy_const_reference>()), &DivNode::setMediaDir,\n                \"The directory that the media files for the children of this node are in.\\n\")\n        .add_property(\"crop\", &DivNode::getCrop, &DivNode::setCrop,\n                \"Turns clipping on or off. Default is True.\\n\")\n        .def(\"getNumChildren\", &DivNode::getNumChildren,\n                \"getNumChildren() -> numchildren\\n\"\n                \"Returns the number of immediate children that this div contains.\")\n        .def(\"getChild\", &DivNode::getChild, \n                \"getChild(pos) -> node\\n\"\n                \"Returns the child at position pos.\")\n        .def(\"appendChild\", &DivNode::appendChild,\n                \"appendChild(node)\\n\"\n                \"Adds a new child to the container behind the last existing child.\")\n        .def(\"insertChildBefore\", &DivNode::insertChildBefore,\n                \"insertChildBefore(newNode, oldChild)\\n\"\n                \"Adds a new child to the container in front of the existing node oldChild.\")\n        .def(\"insertChild\", &DivNode::insertChild,\n                \"insertChild(node, pos)\\n\"\n                \"Adds a new child to the container at position pos.\")\n        .def(\"removeChild\", (void (DivNode::*)(NodePtr))(&DivNode::removeChild),\n                \"removeChild(node)\\n\"\n                \"Removes the child given by pNode.\")\n        .def(\"removeChild\", (void (DivNode::*)(unsigned))(&DivNode::removeChild),\n                \"removeChild(pos)\\n\"\n                \"Removes the child at index pos.\")\n        .def(\"reorderChild\", (void (DivNode::*)(unsigned, unsigned))(&DivNode::reorderChild),\n                \"reorderChild(oldPos, newPos)\\n\"\n                \"Moves the child at index pos so it's at index newPos. This function\\n\"\n                \"can be used to change the order in which the children are drawn.\")\n        .def(\"reorderChild\", (void (DivNode::*)(NodePtr, unsigned))(&DivNode::reorderChild),\n                \"reorderChild(node, newPos)\\n\"\n                \"Moves the child node so it's at index newPos. This function\\n\"\n                \"can be used to change the order in which the children are drawn.\")\n        .def(\"indexOf\", &DivNode::indexOf,\n                \"indexOf(childnode)\\n\"\n                \"Returns the index of the child given or -1 if childnode isn't a\\n\"\n                \"child of the container. This function does a linear search through\\n\"\n                \"the list of children until the child is found.\")\n    ;\n    \n    class_<AVGNode, bases<DivNode> >(\"AVGNode\",\n            \"Root node of any avg tree. Defines the properties of the display and\\n\"\n            \"handles key press events. The AVGNode's width and height define the\\n\"\n            \"coordinate system for the display and are the default for the window\\n\"\n            \"size used (i.e. by default, the coordinate system is pixel-based.)\\n\",\n            no_init)\n        .def(\"getCropSetting\", &AVGNode::getCropSetting,\n                \"getCropSetting() -> isCropActive\\n\\n\"\n                \"Returns true if cropping is active. Cropping can be turned off globally\\n\"\n                \"in the avg file. (Deprecated. This attribute is only nessesary because\\n\"\n                \"of certain buggy display drivers that don't work with cropping.)\")\n    ;\n\n    class_<Sound, bases<Node> >(\"Sound\",\n            \"A sound played from a file.\\n\",\n            no_init)\n        .def(\"play\", &Sound::play,\n                \"play()\\n\"\n                \"Starts audio playback.\")\n        .def(\"stop\", &Sound::stop,\n                \"stop()\\n\"\n                \"Stops audio playback. Closes the object and 'rewinds' the playback\\n\"\n                \"cursor.\")\n        .def(\"pause\", &Sound::pause,\n                \"pause()\\n\"\n                \"Stops audio playback but doesn't close the object. The playback\\n\"\n                \"cursor stays at the same position.\")\n        .def(\"setEOFCallback\", &Sound::setEOFCallback,\n                \"setEOFCallback(pyfunc)\\n\"\n                \"Sets a python callable to be invoked when the video reaches end of file.\")\n        .add_property(\"href\", make_function(&Sound::getHRef, \n                return_value_policy<copy_const_reference>()), &Sound::setHRef,\n                \"The source filename of the sound.\\n\")\n        .add_property(\"loop\", &Sound::getLoop,\n                \"Whether to start the sound again when it has ended (ro).\\n\")\n    ;\n    class_<PanoImage, bases<Node> >(\"PanoImage\",\n            \"A panorama image displayed in cylindrical projection.\\n\",\n            no_init)\n        .def(\"getScreenPosFromPanoPos\", &PanoImage::getScreenPosFromPanoPos,\n                \"getScreenPosFromPanoPos(panoPos) -> pos\\n\"\n                \"Converts a position in panorama image pixels to pixels in coordinates\\n\"\n                \"relative to the node, taking into account the current rotation angle.\\n\")\n        .def(\"getScreenPosFromAngle\", &PanoImage::getScreenPosFromAngle,\n                \"getScreenPosFromAngle(angle) -> pos\\n\"\n                \"Converts panorama angle to pixels in coordinates\\n\"\n                \"relative to the node, taking into account the current rotation angle.\\n\")\n        .add_property(\"href\", make_function(&PanoImage::getHRef, \n                return_value_policy<copy_const_reference>()), &PanoImage::setHRef,\n                \"The source filename of the image.\\n\")\n        .add_property(\"sensorwidth\", &PanoImage::getSensorWidth, \n                &PanoImage::setSensorWidth,\n                \"The width of the sensor used to make the image. This value\\n\"\n                \"is used together with sensorheight and focallength to\\n\"\n                \"determine the projection to use.\\n\")\n        .add_property(\"sensorheight\", &PanoImage::getSensorHeight, \n                &PanoImage::setSensorHeight,\n                \"The height of the sensor used to make the image.\\n\")\n        .add_property(\"focallength\", &PanoImage::getFocalLength, \n                &PanoImage::setFocalLength,\n                \"The focal length of the lens in millimeters.\\n\")\n        .add_property(\"hue\", &PanoImage::getHue,\n                \"A hue to color the image in. (ro, deprecated)\\n\")\n        .add_property(\"saturation\", &PanoImage::getSaturation,\n                \"The saturation the image should have. (ro, deprecated)\\n\")\n        .add_property(\"rotation\", &PanoImage::getRotation, &PanoImage::setRotation,\n                \"The current angle the viewer is looking at in radians.\\n\")\n        .add_property(\"maxrotation\", &PanoImage::getMaxRotation,\n                \"The maximum angle the viewer can look at.\\n\")\n    ;\n\n}\n<commit_msg>Added duration property to Sound nodes.<commit_after>\/\/\n\/\/  libavg - Media Playback Engine. \n\/\/  Copyright (C) 2003-2008 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\nvoid export_bitmap();\nvoid export_raster();\nvoid export_event();\n#ifndef WIN32\nvoid export_devices();\n#endif\n\n#include \"WrapHelper.h\"\n\n#include \"..\/base\/Logger.h\"\n#include \"..\/base\/Exception.h\"\n#include \"..\/player\/Player.h\"\n#include \"..\/player\/AVGNode.h\"\n#include \"..\/player\/DivNode.h\"\n#include \"..\/player\/PanoImage.h\"\n#include \"..\/player\/Sound.h\"\n\n#include <boost\/version.hpp>\n#include <boost\/shared_ptr.hpp>\n\nusing namespace boost::python;\nusing namespace avg;\n\nvoid export_node()\n{\n    class_<Node, boost::shared_ptr<Node>, boost::noncopyable>(\"Node\",\n            \"Base class for all elements in the avg tree.\",\n            no_init)\n        .def(self == self)\n        .def(self != self)\n        .def(\"__hash__\", &Node::getHash)\n        .def(\"getParent\", &Node::getParent,\n                \"getParent() -> node\\n\"\n                \"Returns the container (AVGNode or DivNode) the node is in. For\\n\"\n                \"the root node, returns None.\\n\")\n        .def(\"unlink\", &Node::unlink,\n                \"unlink() -> None\\n\"\n                \"Removes a node from it's parent container. Equivalent to\\n\"\n                \"node.getParent().removeChild(node.getParent().indexOf(node)).\")\n        .def(\"setEventCapture\", &Node::setMouseEventCapture,\n                \"setEventCapture(cursorid)\\n\"\n                \"Sets up event capturing so that cursor events are sent to this node\\n\"\n                \"regardless of the cursor position. cursorid is optional; if left out,\\n\"\n                \"the mouse cursor is captured. If not, events from a specific tracker\\n\"\n                \"cursor are captured. If the node doesn't handle the event, it\\n\"\n                \"propagates to its parent normally. This function is useful for the\\n\"\n                \"implementation of user interface elements such as scroll bars. Only one\\n\"\n                \"node can capture a cursor at any one time. Normal operation can\\n\"\n                \"be restored by calling releaseEventCapture().\\n\"\n                \"@param cursorid: The id of the tracker cursor to capture (optional).\\n\")\n        .def(\"setEventCapture\", &Node::setEventCapture)\n        .def(\"releaseEventCapture\", &Node::releaseMouseEventCapture,\n                \"releaseEventCapture(cursorid)\\n\"\n                \"Restores normal mouse operation after a call to setEventCapture().\\n\"\n                \"@param cursorid: The id of the tracker cursor to release (optional).\\n\")\n        .def(\"releaseEventCapture\", &Node::releaseEventCapture)\n        .def(\"setEventHandler\", &Node::setEventHandler,\n                \"setEventHandler(type, source, pyfunc)\\n\"\n                \"Sets a callback function that is invoked whenever an event of the\\n\"\n                \"specified type from the specified source occurs. This function is\\n\"\n                \"similar to the event handler node attributes (e.g. oncursordown).\\n\"\n                \"It is more specific since it takes the event source as a parameter\\n\"\n                \"and allows the use of any python callable as callback function.\\n\"\n                \"@param type: One of the event types KEYUP, KEYDOWN, CURSORMOTION,\\n\"\n                \"CURSORUP, CURSORDOWN, CURSOROVER, CURSOROUT, RESIZE or QUIT.\\n\"\n                \"@param source: MOUSE for mouse events, TOUCH for multitouch touch\\n\"\n                \"events, TRACK for multitouch track events or other tracking, \\n\"\n                \"NONE for keyboard events. Sources can be or'ed together to set a\\n\"\n                \"handler for several sources at once.\\n\"\n                \"@param pyfunc: The python callable to invoke.\\n\")\n        .def(\"getAbsPos\", &Node::getAbsPos,\n                \"getAbsPos(relpos) -> abspos\\n\"\n                \"Transforms a position in coordinates relative to the node to a\\n\"\n                \"position in window coordinates.\\n\"\n                \"@param relpos: Relative coordinate to transform.\")\n        .def(\"getRelPos\", &Node::getRelPos,\n                \"getRelPos(abspos) -> relpos\\n\"\n                \"Transforms a position in window coordinates to a position\\n\"\n                \"in coordinates relative to the node.\\n\"\n                \"@param abspos: Absolute coordinate to transform.\")\n        .def(\"getMediaSize\", &Node::getMediaSize,\n                \"getMediaSize() -> mediasize\\n\"\n                \"Returns the size in pixels of the media in the node. Image nodes\\n\"\n                \"return the bitmap size, Camera nodes\\n\"\n                \"the size of a camera frame and Words nodes the amount of space\\n\"\n                \"the text takes. Video nodes the video size if decoding has started\\n\"\n                \"or (0,0) if not.\")\n        .add_property(\"id\", make_function(&Node::getID,\n                return_value_policy<copy_const_reference>()), &Node::setID,\n                \"A unique identifier that can be used to reference the node.\\n\")\n        .add_property(\"x\", &Node::getX, &Node::setX,\n                \"The position of the node's left edge relative to it's parent node.\\n\")\n        .add_property(\"y\", &Node::getY, &Node::setY,\n                \"The position of the node's top edge relative to it's parent node.\\n\")\n        .add_property(\"pos\", make_function(&Node::getPos,\n                return_value_policy<copy_const_reference>()), &Node::setPos,\n                \"The position of the node's top left corner relative to it's parent node.\\n\")\n        .add_property(\"width\", &Node::getWidth, &Node::setWidth)\n        .add_property(\"height\", &Node::getHeight, &Node::setHeight)\n        .add_property(\"size\", &Node::getSize, &Node::setSize)\n        .add_property(\"angle\", &Node::getAngle, &Node::setAngle,\n                \"The angle that the node is rotated to in radians. 0 is\\n\"\n                \"unchanged, 3.14 is upside-down.\\n\")\n        .add_property(\"pivotx\", &Node::getPivotX, &Node::setPivotX,\n                \"x coordinate of the point that the node is rotated around.\\n\"\n                \"Default is the center of the node.\\n\")\n        .add_property(\"pivoty\", &Node::getPivotY, &Node::setPivotY,\n                \"y coordinate of the point that the node is rotated around.\\n\"\n                \"Default is the center of the node.\\n\")\n        .add_property(\"opacity\", &Node::getOpacity, &Node::setOpacity,\n                      \"A measure of the node's transparency. 0.0 is completely\\n\"\n                      \"transparent, 1.0 is completely opaque. Opacity is relative to\\n\"\n                      \"the parent node's opacity.\\n\")\n        .add_property(\"active\", &Node::getActive, &Node::setActive,\n                      \"If this attribute is true, the node behaves as usual. If not, it\\n\"\n                      \"is neither drawn nor does it react to events. Videos are paused.\\n\")\n        .add_property(\"sensitive\", &Node::getSensitive, &Node::setSensitive,\n                      \"A node only reacts to events if sensitive is true.\")\n    ;\n\n    export_bitmap();\n    export_raster();\n   \n    class_<DivNode, bases<Node>, boost::noncopyable>(\"DivNode\", \n            \"A div node is a node that groups other nodes logically and visually.\\n\"\n            \"Its upper left corner is used as point of origin for the coordinates\\n\"\n            \"of its child nodes. Its extents are used to clip the children. Its\\n\"\n            \"opacity is used as base opacity for the child nodes' opacities.\\n\"\n            \"The children of a div node are drawn in the order they are found\\n\"\n            \"in the avg file.\",\n            no_init)\n        .add_property(\"mediadir\", make_function(&DivNode::getMediaDir,\n                return_value_policy<copy_const_reference>()), &DivNode::setMediaDir,\n                \"The directory that the media files for the children of this node are in.\\n\")\n        .add_property(\"crop\", &DivNode::getCrop, &DivNode::setCrop,\n                \"Turns clipping on or off. Default is True.\\n\")\n        .def(\"getNumChildren\", &DivNode::getNumChildren,\n                \"getNumChildren() -> numchildren\\n\"\n                \"Returns the number of immediate children that this div contains.\")\n        .def(\"getChild\", &DivNode::getChild, \n                \"getChild(pos) -> node\\n\"\n                \"Returns the child at position pos.\")\n        .def(\"appendChild\", &DivNode::appendChild,\n                \"appendChild(node)\\n\"\n                \"Adds a new child to the container behind the last existing child.\")\n        .def(\"insertChildBefore\", &DivNode::insertChildBefore,\n                \"insertChildBefore(newNode, oldChild)\\n\"\n                \"Adds a new child to the container in front of the existing node oldChild.\")\n        .def(\"insertChild\", &DivNode::insertChild,\n                \"insertChild(node, pos)\\n\"\n                \"Adds a new child to the container at position pos.\")\n        .def(\"removeChild\", (void (DivNode::*)(NodePtr))(&DivNode::removeChild),\n                \"removeChild(node)\\n\"\n                \"Removes the child given by pNode.\")\n        .def(\"removeChild\", (void (DivNode::*)(unsigned))(&DivNode::removeChild),\n                \"removeChild(pos)\\n\"\n                \"Removes the child at index pos.\")\n        .def(\"reorderChild\", (void (DivNode::*)(unsigned, unsigned))(&DivNode::reorderChild),\n                \"reorderChild(oldPos, newPos)\\n\"\n                \"Moves the child at index pos so it's at index newPos. This function\\n\"\n                \"can be used to change the order in which the children are drawn.\")\n        .def(\"reorderChild\", (void (DivNode::*)(NodePtr, unsigned))(&DivNode::reorderChild),\n                \"reorderChild(node, newPos)\\n\"\n                \"Moves the child node so it's at index newPos. This function\\n\"\n                \"can be used to change the order in which the children are drawn.\")\n        .def(\"indexOf\", &DivNode::indexOf,\n                \"indexOf(childnode)\\n\"\n                \"Returns the index of the child given or -1 if childnode isn't a\\n\"\n                \"child of the container. This function does a linear search through\\n\"\n                \"the list of children until the child is found.\")\n    ;\n    \n    class_<AVGNode, bases<DivNode> >(\"AVGNode\",\n            \"Root node of any avg tree. Defines the properties of the display and\\n\"\n            \"handles key press events. The AVGNode's width and height define the\\n\"\n            \"coordinate system for the display and are the default for the window\\n\"\n            \"size used (i.e. by default, the coordinate system is pixel-based.)\\n\",\n            no_init)\n        .def(\"getCropSetting\", &AVGNode::getCropSetting,\n                \"getCropSetting() -> isCropActive\\n\\n\"\n                \"Returns true if cropping is active. Cropping can be turned off globally\\n\"\n                \"in the avg file. (Deprecated. This attribute is only nessesary because\\n\"\n                \"of certain buggy display drivers that don't work with cropping.)\")\n    ;\n\n    class_<Sound, bases<Node> >(\"Sound\",\n            \"A sound played from a file.\\n\",\n            no_init)\n        .def(\"play\", &Sound::play,\n                \"play()\\n\"\n                \"Starts audio playback.\")\n        .def(\"stop\", &Sound::stop,\n                \"stop()\\n\"\n                \"Stops audio playback. Closes the object and 'rewinds' the playback\\n\"\n                \"cursor.\")\n        .def(\"pause\", &Sound::pause,\n                \"pause()\\n\"\n                \"Stops audio playback but doesn't close the object. The playback\\n\"\n                \"cursor stays at the same position.\")\n        .def(\"setEOFCallback\", &Sound::setEOFCallback,\n                \"setEOFCallback(pyfunc)\\n\"\n                \"Sets a python callable to be invoked when the video reaches end of file.\")\n        .add_property(\"href\", make_function(&Sound::getHRef, \n                return_value_policy<copy_const_reference>()), &Sound::setHRef,\n                \"The source filename of the sound.\\n\")\n        .add_property(\"loop\", &Sound::getLoop,\n                \"Whether to start the sound again when it has ended (ro).\\n\")\n        .add_property(\"duration\", &Sound::getDuration,\n                \"The duration of the sound file in milliseconds (ro).\\n\")\n    ;\n\n    class_<PanoImage, bases<Node> >(\"PanoImage\",\n            \"A panorama image displayed in cylindrical projection.\\n\",\n            no_init)\n        .def(\"getScreenPosFromPanoPos\", &PanoImage::getScreenPosFromPanoPos,\n                \"getScreenPosFromPanoPos(panoPos) -> pos\\n\"\n                \"Converts a position in panorama image pixels to pixels in coordinates\\n\"\n                \"relative to the node, taking into account the current rotation angle.\\n\")\n        .def(\"getScreenPosFromAngle\", &PanoImage::getScreenPosFromAngle,\n                \"getScreenPosFromAngle(angle) -> pos\\n\"\n                \"Converts panorama angle to pixels in coordinates\\n\"\n                \"relative to the node, taking into account the current rotation angle.\\n\")\n        .add_property(\"href\", make_function(&PanoImage::getHRef, \n                return_value_policy<copy_const_reference>()), &PanoImage::setHRef,\n                \"The source filename of the image.\\n\")\n        .add_property(\"sensorwidth\", &PanoImage::getSensorWidth, \n                &PanoImage::setSensorWidth,\n                \"The width of the sensor used to make the image. This value\\n\"\n                \"is used together with sensorheight and focallength to\\n\"\n                \"determine the projection to use.\\n\")\n        .add_property(\"sensorheight\", &PanoImage::getSensorHeight, \n                &PanoImage::setSensorHeight,\n                \"The height of the sensor used to make the image.\\n\")\n        .add_property(\"focallength\", &PanoImage::getFocalLength, \n                &PanoImage::setFocalLength,\n                \"The focal length of the lens in millimeters.\\n\")\n        .add_property(\"hue\", &PanoImage::getHue,\n                \"A hue to color the image in. (ro, deprecated)\\n\")\n        .add_property(\"saturation\", &PanoImage::getSaturation,\n                \"The saturation the image should have. (ro, deprecated)\\n\")\n        .add_property(\"rotation\", &PanoImage::getRotation, &PanoImage::setRotation,\n                \"The current angle the viewer is looking at in radians.\\n\")\n        .add_property(\"maxrotation\", &PanoImage::getMaxRotation,\n                \"The maximum angle the viewer can look at.\\n\")\n    ;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>5d28667c-2d16-11e5-af21-0401358ea401<commit_msg>5d28667d-2d16-11e5-af21-0401358ea401<commit_after>5d28667d-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n#include <cstdio>\n#include <stack>\n\n#include <llvm\/IR\/LLVMContext.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/IR\/IRBuilder.h>\n#include <llvm\/Support\/raw_ostream.h>\n\nusing namespace llvm;\n\nstatic const uint64_t DATA_SIZE = 30000;\nstatic const char *DATA_NAME = \"data\";\nstatic const char *PTR_NAME = \"ptr\";\n\nstruct Loop {\n  BasicBlock *Entry, *Body, *Exit;\n  PHINode *DataPtrBody, *DataPtrExit;\n};\n\nint main() {\n  \/\/ LLVM context.\n  LLVMContext &Context = getGlobalContext();\n  Module MainModule(\"brainfuck program\", Context);\n  IRBuilder<> Builder(Context);\n\n  \/\/ Some useful constants.\n  Type *CellType = Type::getInt8Ty(Context);\n  Constant *One = ConstantInt::get(CellType, 1);\n\n  \/\/ Function prototypes for the shim.\n  FunctionType *PutFunctionType = FunctionType::get(\n      Type::getVoidTy(Context) \/* return type *\/,\n      std::vector<Type *>(1, CellType) \/* argument types *\/,\n      false \/* var args *\/);\n  Function *PutFunction = Function::Create(PutFunctionType,\n      Function::ExternalLinkage, \"brainfuck_put\", &MainModule);\n  FunctionType *GetFunctionType = FunctionType::get(\n      CellType \/* return type *\/,\n      std::vector<Type *>() \/* argument types *\/,\n      false \/* var args *\/);\n  Function *GetFunction = Function::Create(GetFunctionType,\n      Function::ExternalLinkage, \"brainfuck_get\", &MainModule);\n\n  \/\/ Global data for a brainfuck program.\n  ArrayType *DataType = ArrayType::get(CellType, DATA_SIZE);\n  GlobalVariable *Data = new GlobalVariable(\n      MainModule, DataType, false \/* constant *\/,\n      GlobalVariable::InternalLinkage, Constant::getNullValue(DataType),\n      DATA_NAME);\n  Value *DataPtr = Builder.CreateConstInBoundsGEP2_32(Data, 0, 0, PTR_NAME);\n\n  \/\/ Main function definition.\n  FunctionType *MainFunctionType = FunctionType::get(\n      Type::getVoidTy(Context) \/* return type *\/,\n      std::vector<Type *>() \/* argument types *\/,\n      false \/* var args *\/);\n  Function *MainFunction = Function::Create(MainFunctionType,\n      Function::ExternalLinkage, \"brainfuck_main\", &MainModule);\n  BasicBlock *MainBlock = BasicBlock::Create(Context, \"entry\", MainFunction);\n  Builder.SetInsertPoint(MainBlock);\n\n  \/\/ Code generation.\n  int c;\n  Value *Value;\n  std::stack<Loop> Loops;\n  Loop ThisLoop;\n  while ((c = getchar()) != EOF) {\n    switch (c) {\n      case '>':\n        DataPtr = Builder.CreateConstGEP1_32(DataPtr, 1, PTR_NAME);\n        break;\n      case '<':\n        DataPtr = Builder.CreateConstGEP1_32(DataPtr, -1, PTR_NAME);\n        break;\n      case '+':\n        Value = Builder.CreateLoad(DataPtr);\n        Value = Builder.CreateAdd(Value, One);\n        Builder.CreateStore(Value, DataPtr);\n        break;\n      case '-':\n        Value = Builder.CreateLoad(DataPtr);\n        Value = Builder.CreateSub(Value, One);\n        Builder.CreateStore(Value, DataPtr);\n        break;\n      case '.':\n        Value = Builder.CreateLoad(DataPtr);\n        Builder.CreateCall(PutFunction, Value);\n        break;\n      case ',':\n        Value = Builder.CreateCall(GetFunction);\n        Builder.CreateStore(Value, DataPtr);\n        break;\n\n      case '[':\n        \/\/ Prepare data for the stack.\n        ThisLoop.Entry = Builder.GetInsertBlock();\n        ThisLoop.Body = BasicBlock::Create(Context, \"loop\", MainFunction);\n        ThisLoop.Exit = BasicBlock::Create(Context, \"exit\", MainFunction);\n\n        \/\/ Emit the beginning conditional branch.\n        Value = Builder.CreateLoad(DataPtr);\n        Value = Builder.CreateIsNotNull(Value);\n        Builder.CreateCondBr(Value, ThisLoop.Body, ThisLoop.Exit);\n\n        \/\/ Define the pointer after the loop.\n        Builder.SetInsertPoint(ThisLoop.Exit);\n        ThisLoop.DataPtrExit = Builder.CreatePHI(DataPtr->getType(), 2,\n            PTR_NAME);\n        ThisLoop.DataPtrExit->addIncoming(DataPtr, ThisLoop.Entry);\n\n        \/\/ Define the pointer within the loop.\n        Builder.SetInsertPoint(ThisLoop.Body);\n        ThisLoop.DataPtrBody = Builder.CreatePHI(DataPtr->getType(), 2,\n            PTR_NAME);\n        ThisLoop.DataPtrBody->addIncoming(DataPtr, ThisLoop.Entry);\n\n        \/\/ Continue generating code within the loop.\n        DataPtr = ThisLoop.DataPtrBody;\n        Loops.push(ThisLoop);\n        break;\n\n      case ']':\n        \/\/ Pop data off the stack.\n        if (Loops.empty()) {\n          fputs(\"] requires matching [\\n\", stderr);\n          abort();\n        }\n        ThisLoop = Loops.top();\n        Loops.pop();\n\n        \/\/ Finish off the phi nodes.\n        ThisLoop.DataPtrBody->addIncoming(DataPtr, Builder.GetInsertBlock());\n        ThisLoop.DataPtrExit->addIncoming(DataPtr, Builder.GetInsertBlock());\n\n        \/\/ Emit the ending conditional branch.\n        Value = Builder.CreateLoad(DataPtr);\n        Value = Builder.CreateIsNotNull(Value);\n        Builder.CreateCondBr(Value, ThisLoop.Body, ThisLoop.Exit);\n\n        \/\/ Move insertion after the loop.\n        ThisLoop.Exit->moveAfter(Builder.GetInsertBlock());\n        DataPtr = ThisLoop.DataPtrExit;\n        Builder.SetInsertPoint(ThisLoop.Exit);\n        break;\n    }\n  }\n\n  \/\/ Ensure all loops have been closed.\n  if (!Loops.empty()) {\n    fputs(\"[ requires matching ]\\n\", stderr);\n    abort();\n  }\n\n  \/\/ Finish off brainfuck_main and dump.\n  Builder.CreateRetVoid();\n  MainModule.print(outs(), NULL \/* assembly annotation writer *\/);\n}\n<commit_msg>Alphabetize the llvm headers.<commit_after>#include <cassert>\n#include <cstdio>\n#include <stack>\n\n#include <llvm\/IR\/IRBuilder.h>\n#include <llvm\/IR\/LLVMContext.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/Support\/raw_ostream.h>\n\nusing namespace llvm;\n\nstatic const uint64_t DATA_SIZE = 30000;\nstatic const char *DATA_NAME = \"data\";\nstatic const char *PTR_NAME = \"ptr\";\n\nstruct Loop {\n  BasicBlock *Entry, *Body, *Exit;\n  PHINode *DataPtrBody, *DataPtrExit;\n};\n\nint main() {\n  \/\/ LLVM context.\n  LLVMContext &Context = getGlobalContext();\n  Module MainModule(\"brainfuck program\", Context);\n  IRBuilder<> Builder(Context);\n\n  \/\/ Some useful constants.\n  Type *CellType = Type::getInt8Ty(Context);\n  Constant *One = ConstantInt::get(CellType, 1);\n\n  \/\/ Function prototypes for the shim.\n  FunctionType *PutFunctionType = FunctionType::get(\n      Type::getVoidTy(Context) \/* return type *\/,\n      std::vector<Type *>(1, CellType) \/* argument types *\/,\n      false \/* var args *\/);\n  Function *PutFunction = Function::Create(PutFunctionType,\n      Function::ExternalLinkage, \"brainfuck_put\", &MainModule);\n  FunctionType *GetFunctionType = FunctionType::get(\n      CellType \/* return type *\/,\n      std::vector<Type *>() \/* argument types *\/,\n      false \/* var args *\/);\n  Function *GetFunction = Function::Create(GetFunctionType,\n      Function::ExternalLinkage, \"brainfuck_get\", &MainModule);\n\n  \/\/ Global data for a brainfuck program.\n  ArrayType *DataType = ArrayType::get(CellType, DATA_SIZE);\n  GlobalVariable *Data = new GlobalVariable(\n      MainModule, DataType, false \/* constant *\/,\n      GlobalVariable::InternalLinkage, Constant::getNullValue(DataType),\n      DATA_NAME);\n  Value *DataPtr = Builder.CreateConstInBoundsGEP2_32(Data, 0, 0, PTR_NAME);\n\n  \/\/ Main function definition.\n  FunctionType *MainFunctionType = FunctionType::get(\n      Type::getVoidTy(Context) \/* return type *\/,\n      std::vector<Type *>() \/* argument types *\/,\n      false \/* var args *\/);\n  Function *MainFunction = Function::Create(MainFunctionType,\n      Function::ExternalLinkage, \"brainfuck_main\", &MainModule);\n  BasicBlock *MainBlock = BasicBlock::Create(Context, \"entry\", MainFunction);\n  Builder.SetInsertPoint(MainBlock);\n\n  \/\/ Code generation.\n  int c;\n  Value *Value;\n  std::stack<Loop> Loops;\n  Loop ThisLoop;\n  while ((c = getchar()) != EOF) {\n    switch (c) {\n      case '>':\n        DataPtr = Builder.CreateConstGEP1_32(DataPtr, 1, PTR_NAME);\n        break;\n      case '<':\n        DataPtr = Builder.CreateConstGEP1_32(DataPtr, -1, PTR_NAME);\n        break;\n      case '+':\n        Value = Builder.CreateLoad(DataPtr);\n        Value = Builder.CreateAdd(Value, One);\n        Builder.CreateStore(Value, DataPtr);\n        break;\n      case '-':\n        Value = Builder.CreateLoad(DataPtr);\n        Value = Builder.CreateSub(Value, One);\n        Builder.CreateStore(Value, DataPtr);\n        break;\n      case '.':\n        Value = Builder.CreateLoad(DataPtr);\n        Builder.CreateCall(PutFunction, Value);\n        break;\n      case ',':\n        Value = Builder.CreateCall(GetFunction);\n        Builder.CreateStore(Value, DataPtr);\n        break;\n\n      case '[':\n        \/\/ Prepare data for the stack.\n        ThisLoop.Entry = Builder.GetInsertBlock();\n        ThisLoop.Body = BasicBlock::Create(Context, \"loop\", MainFunction);\n        ThisLoop.Exit = BasicBlock::Create(Context, \"exit\", MainFunction);\n\n        \/\/ Emit the beginning conditional branch.\n        Value = Builder.CreateLoad(DataPtr);\n        Value = Builder.CreateIsNotNull(Value);\n        Builder.CreateCondBr(Value, ThisLoop.Body, ThisLoop.Exit);\n\n        \/\/ Define the pointer after the loop.\n        Builder.SetInsertPoint(ThisLoop.Exit);\n        ThisLoop.DataPtrExit = Builder.CreatePHI(DataPtr->getType(), 2,\n            PTR_NAME);\n        ThisLoop.DataPtrExit->addIncoming(DataPtr, ThisLoop.Entry);\n\n        \/\/ Define the pointer within the loop.\n        Builder.SetInsertPoint(ThisLoop.Body);\n        ThisLoop.DataPtrBody = Builder.CreatePHI(DataPtr->getType(), 2,\n            PTR_NAME);\n        ThisLoop.DataPtrBody->addIncoming(DataPtr, ThisLoop.Entry);\n\n        \/\/ Continue generating code within the loop.\n        DataPtr = ThisLoop.DataPtrBody;\n        Loops.push(ThisLoop);\n        break;\n\n      case ']':\n        \/\/ Pop data off the stack.\n        if (Loops.empty()) {\n          fputs(\"] requires matching [\\n\", stderr);\n          abort();\n        }\n        ThisLoop = Loops.top();\n        Loops.pop();\n\n        \/\/ Finish off the phi nodes.\n        ThisLoop.DataPtrBody->addIncoming(DataPtr, Builder.GetInsertBlock());\n        ThisLoop.DataPtrExit->addIncoming(DataPtr, Builder.GetInsertBlock());\n\n        \/\/ Emit the ending conditional branch.\n        Value = Builder.CreateLoad(DataPtr);\n        Value = Builder.CreateIsNotNull(Value);\n        Builder.CreateCondBr(Value, ThisLoop.Body, ThisLoop.Exit);\n\n        \/\/ Move insertion after the loop.\n        ThisLoop.Exit->moveAfter(Builder.GetInsertBlock());\n        DataPtr = ThisLoop.DataPtrExit;\n        Builder.SetInsertPoint(ThisLoop.Exit);\n        break;\n    }\n  }\n\n  \/\/ Ensure all loops have been closed.\n  if (!Loops.empty()) {\n    fputs(\"[ requires matching ]\\n\", stderr);\n    abort();\n  }\n\n  \/\/ Finish off brainfuck_main and dump.\n  Builder.CreateRetVoid();\n  MainModule.print(outs(), NULL \/* assembly annotation writer *\/);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\nLanguage:  C++\nDate:      $Date: 2008-02-25 17:27:17 +0100 (Mo, 25 Feb 2008) $\nVersion:   $Revision: 7837 $\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 \"mitkTestingMacros.h\"\n\n#include \"mitkDataNodeFactory.h\"\n#include \"mitkStandaloneDataStorage.h\"\n\n#include <vtkImageData.h>\n#include <vtkSmartPointer.h>\n#include <vtkPNGWriter.h>\n#include <vtkRegressionTestImage.h> \/\/ nice one\n\n#include <vector>\n#include <algorithm>\n\n#include \"mitkRenderingTestHelper.h\"\n#include <mitkLevelWindow.h>\n\nclass mitkRenderingTestHelperClass\n{\n\npublic:\n\n    static mitk::BaseData::Pointer AddToStorage(const std::string& filename)\n    {\n        mitk::DataNodeFactory::Pointer reader = mitk::DataNodeFactory::New();\n        try\n        {\n            reader->SetFileName( filename );\n            reader->Update();\n\n            if(reader->GetNumberOfOutputs()<1)\n            {\n                MITK_TEST_FAILED_MSG(<< \"Could not find test data '\" << filename << \"'\");\n            }\n\n            mitk::DataNode::Pointer node = reader->GetOutput( 0 );\n            mitkRenderingTestHelperClass::s_DataStorage->Add(node);\n            return node->GetData();\n        }\n        catch ( itk::ExceptionObject & e )\n        {\n            MITK_TEST_FAILED_MSG(<< \"Failed loading test data '\" << filename << \"': \" << e.what());\n        }\n    }\n\n    static mitk::DataStorage::Pointer s_DataStorage;\n\n}; \/\/ end test helper class\n\nmitk::DataStorage::Pointer mitkRenderingTestHelperClass::s_DataStorage;\n\nint mitkRenderingTest(int argc, char* argv[])\n{\n    \/\/ load all arguments into a datastorage, take last argument as reference rendering\n    \/\/ setup a renderwindow of fixed size X*Y\n    \/\/ render the datastorage\n    \/\/ compare rendering to reference image\n    MITK_TEST_BEGIN(\"RenderingTest\")\n\n            \/\/ enough parameters?\n            if ( argc < 2 )\n    {\n        MITK_TEST_OUTPUT( << \"Usage: \" << std::string(*argv) << \" [file1 file2 ...] outputfile\" )\n                MITK_TEST_OUTPUT( << \"Will render a central transversal slice of all given files into outputfile\" )\n                exit( EXIT_SUCCESS );\n    }\n\n    \/\/ parse parameters\n    std::vector<std::string> inputFileNames;\n    for (int i = 1; i < argc-1; ++i)\n    {\n        \/\/add everything to a list but -T and -V\n        std::string tmp = argv[i];\n        if((tmp.compare(\"-T\")) && (tmp.compare(\"-V\")))\n        {\n            inputFileNames.push_back( tmp );\n        }\n    }\n    \/\/    std::string outputFileName( argv[argc-1] );\n\n    \/\/ load all input into a data storage\n    mitkRenderingTestHelperClass::s_DataStorage = mitk::StandaloneDataStorage::New().GetPointer();\n    MITK_TEST_CONDITION_REQUIRED(mitkRenderingTestHelperClass::s_DataStorage.IsNotNull(),\"StandaloneDataStorage instantiation\");\n\n    std::for_each( inputFileNames.begin(), inputFileNames.end(), mitkRenderingTestHelperClass::AddToStorage );\n\n    \/\/ create a QmitkRenderWindow, let it render the scene and get the vtkRenderWindow\n    mitkRenderingTestHelper renderingHelper( 640, 480, mitkRenderingTestHelperClass::s_DataStorage );\n    \/\/use this to generate a reference screenshot or save the file:\n    renderingHelper.SaveAsPNG(\"\/home\/kilgus\/Pictures\/RenderingTestData\/output.png\");\n    int retVal = vtkRegressionTestImage( renderingHelper.GetVtkRenderWindow() );\n\n    \/\/retVal meanings: (see VTK\/Rendering\/vtkTesting.h)\n    \/\/0 = test failed\n    \/\/1 = test passed\n    \/\/2 = test not run\n    \/\/3 = something with vtkInteraction\n    MITK_TEST_CONDITION( retVal == 1, \"VTK test result positive\" );\n\n    MITK_TEST_END();\n}\n\n<commit_msg>Added boolean variable to save the reference screenshot<commit_after>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\nLanguage:  C++\nDate:      $Date: 2008-02-25 17:27:17 +0100 (Mo, 25 Feb 2008) $\nVersion:   $Revision: 7837 $\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 \"mitkTestingMacros.h\"\n\n#include \"mitkDataNodeFactory.h\"\n#include \"mitkStandaloneDataStorage.h\"\n\n#include <vtkImageData.h>\n#include <vtkSmartPointer.h>\n#include <vtkPNGWriter.h>\n#include <vtkRegressionTestImage.h> \/\/ nice one\n\n#include <vector>\n#include <algorithm>\n\n#include \"mitkRenderingTestHelper.h\"\n#include <mitkLevelWindow.h>\n\nclass mitkRenderingTestHelperClass\n{\n\npublic:\n\n    static mitk::BaseData::Pointer AddToStorage(const std::string& filename)\n    {\n        mitk::DataNodeFactory::Pointer reader = mitk::DataNodeFactory::New();\n        try\n        {\n            reader->SetFileName( filename );\n            reader->Update();\n\n            if(reader->GetNumberOfOutputs()<1)\n            {\n                MITK_TEST_FAILED_MSG(<< \"Could not find test data '\" << filename << \"'\");\n            }\n\n            mitk::DataNode::Pointer node = reader->GetOutput( 0 );\n            mitkRenderingTestHelperClass::s_DataStorage->Add(node);\n            return node->GetData();\n        }\n        catch ( itk::ExceptionObject & e )\n        {\n            MITK_TEST_FAILED_MSG(<< \"Failed loading test data '\" << filename << \"': \" << e.what());\n        }\n    }\n\n    static mitk::DataStorage::Pointer s_DataStorage;\n\n}; \/\/ end test helper class\n\nmitk::DataStorage::Pointer mitkRenderingTestHelperClass::s_DataStorage;\n\nint mitkRenderingTest(int argc, char* argv[])\n{\n    \/\/ load all arguments into a datastorage, take last argument as reference rendering\n    \/\/ setup a renderwindow of fixed size X*Y\n    \/\/ render the datastorage\n    \/\/ compare rendering to reference image\n    MITK_TEST_BEGIN(\"RenderingTest\")\n\n            \/\/ enough parameters?\n            if ( argc < 2 )\n    {\n        MITK_TEST_OUTPUT( << \"Usage: \" << std::string(*argv) << \" [file1 file2 ...] outputfile\" )\n                MITK_TEST_OUTPUT( << \"Will render a central transversal slice of all given files into outputfile\" )\n                exit( EXIT_SUCCESS );\n    }\n\n    \/\/ parse parameters\n    std::vector<std::string> inputFileNames;\n    for (int i = 1; i < argc-1; ++i)\n    {\n        \/\/add everything to a list but -T and -V\n        std::string tmp = argv[i];\n        if((tmp.compare(\"-T\")) && (tmp.compare(\"-V\")))\n        {\n            inputFileNames.push_back( tmp );\n        }\n    }\n    \/\/    std::string outputFileName( argv[argc-1] );\n\n    \/\/ load all input into a data storage\n    mitkRenderingTestHelperClass::s_DataStorage = mitk::StandaloneDataStorage::New().GetPointer();\n    MITK_TEST_CONDITION_REQUIRED(mitkRenderingTestHelperClass::s_DataStorage.IsNotNull(),\"StandaloneDataStorage instantiation\");\n\n    std::for_each( inputFileNames.begin(), inputFileNames.end(), mitkRenderingTestHelperClass::AddToStorage );\n\n    \/\/ create a mitkRenderWindow, let it render the scene and get the vtkRenderWindow\n    mitkRenderingTestHelper renderingHelper( 640, 480, mitkRenderingTestHelperClass::s_DataStorage );\n\n    \/\/use this to generate a reference screenshot or save the file:\n    bool generateReferenceScreenshot = false;\n    if(generateReferenceScreenshot)\n    {\n        renderingHelper.SaveAsPNG(\"\/home\/kilgus\/Pictures\/RenderingTestData\/output.png\");\n    }\n    int retVal = vtkRegressionTestImage( renderingHelper.GetVtkRenderWindow() );\n\n    \/\/retVal meanings: (see VTK\/Rendering\/vtkTesting.h)\n    \/\/0 = test failed\n    \/\/1 = test passed\n    \/\/2 = test not run\n    \/\/3 = something with vtkInteraction\n    MITK_TEST_CONDITION( retVal == 1, \"VTK test result positive\" );\n\n    MITK_TEST_END();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>d746a8e1-2747-11e6-be20-e0f84713e7b8<commit_msg>Boyaaah!<commit_after>d766d50f-2747-11e6-b672-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>9101ad69-2d14-11e5-af21-0401358ea401<commit_msg>9101ad6a-2d14-11e5-af21-0401358ea401<commit_after>9101ad6a-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>6a79ba64-2fa5-11e5-9e25-00012e3d3f12<commit_msg>6ab2a4b4-2fa5-11e5-97bf-00012e3d3f12<commit_after>6ab2a4b4-2fa5-11e5-97bf-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>#include<cstdio>\n#include<cstring>\n#include\"serv.h\"\nint main(int argc, char **argv) {\n  unsigned int i, port = 65637, id = 257;\n  bool topo = false;\n  Server serv;\n  for (i = 1; i + 1 < argc; ++i) {\n    if (!strcmp(argv[i], \"-p\"))\n      sscanf(argv[++i], \"%u\", &port);\n    else if (!strcmp(argv[i], \"-t\"))\n      topo |= serv.Load(argv[++i]);\n    else if (!strcmp(argv[i], \"-d\"))\n      sscanf(argv[++i], \"%u\", &id);\n  }\n  if (!topo || !serv.Init(id, port))\n    return 0;\n  while (1) {\n    printf(\"> \");\n    serv.Wait();\n    char cmd[64];\n    if (!strcmp(cmd, \"send\"))\n      serv.Send();\n    else if (!strcmp(cmd, \"update\")) {\n      unsigned id, cost;\n      scanf(\"%u %u\", &id, &cost);\n      serv.Update(id, cost);\n    }\n    else if (!strcmp(cmd, \"display\"))\n      serv.Display();\n  }\n}\n<commit_msg>忘了scanf指令<commit_after>#include<cstdio>\n#include<cstring>\n#include\"serv.h\"\nint main(int argc, char **argv) {\n  unsigned int i, port = 65637, id = 257;\n  bool topo = false;\n  Server serv;\n  for (i = 1; i + 1 < argc; ++i) {\n    if (!strcmp(argv[i], \"-p\"))\n      sscanf(argv[++i], \"%u\", &port);\n    else if (!strcmp(argv[i], \"-t\"))\n      topo |= serv.Load(argv[++i]);\n    else if (!strcmp(argv[i], \"-d\"))\n      sscanf(argv[++i], \"%u\", &id);\n  }\n  if (!topo || !serv.Init(id, port)){\n\t  fprintf(stderr, \"Usage: DV_routing -p <port> -t <topo-file> -d <server-id>\\n\");\n    return 0;\n  }\n  while (1) {\n    printf(\"> \");\n\tfflush(stdout);\n    serv.Wait();\n    char cmd[64];\n\tscanf(\"%s\", cmd);\n    if (!strcmp(cmd, \"send\"))\n      serv.Send();\n    else if (!strcmp(cmd, \"update\")) {\n      unsigned id, cost;\n      scanf(\"%u %u\", &id, &cost);\n      serv.Update(id, cost);\n    }\n    else if (!strcmp(cmd, \"display\"))\n      serv.Display();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>d1f303cc-2747-11e6-8c37-e0f84713e7b8<commit_msg>No longer crashes if X<commit_after>d2007066-2747-11e6-b40a-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>d44e87e8-585a-11e5-a0e5-6c40088e03e4<commit_msg>d455edd0-585a-11e5-b98e-6c40088e03e4<commit_after>d455edd0-585a-11e5-b98e-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>6a42a65c-2e4f-11e5-97e2-28cfe91dbc4b<commit_msg>6a4a0f1e-2e4f-11e5-8ea1-28cfe91dbc4b<commit_after>6a4a0f1e-2e4f-11e5-8ea1-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>dd596f63-2e4e-11e5-9cbf-28cfe91dbc4b<commit_msg>dd61a60a-2e4e-11e5-9af0-28cfe91dbc4b<commit_after>dd61a60a-2e4e-11e5-9af0-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/\/ Platform Specific Code\r\n#include \"Standard.h\"\r\n\r\n\/\/ Sub-System Components\r\n#include \"component\/entities\/entities.h\"\r\n#include \"component\/gameai\/gameai.h\"\r\n#include \"component\/enemyai\/enemyai.h\"\r\n#include \"component\/rendering\/rendering.h\"\r\n#include \"component\/physics\/physics.h\"\r\n#include \"component\/input\/input.h\"\r\n#ifdef _WIN32\r\n#include \"component\/audio\/audio.h\"\r\n#endif\r\n\r\n#define PLAYAUDIO 0\r\n\r\nint main( int argc, char** argv )\r\n{\r\n\t\/\/ -- Platfor Specific Init -----------------------------------------------\r\n\tINIT_PLATFORM();\r\n\r\n\t\/\/ -- Init components -----------------------------------------------------\r\n\t\/\/ Register Events\r\n\tRenderer *renderer = new Renderer();\r\n\tinit_inventory();\r\n\tPhysics::Simulation *simulation = new Physics::Simulation();\r\n\tInput *input = new Input();\r\n#if (PLAYAUDIO)\r\n\tAudio *audio = new Audio();  \r\n#endif\r\n\r\n\tGameAi *gameai = new GameAi();\r\n\tEnemyAi *enemyai = new EnemyAi();\r\n\r\n\t\/\/ Act on events\r\n\tgameai->setup();\r\n\trenderer->setup();\r\n\tsimulation->loadWorld();\r\n\tinput->setup();\r\n\tenemyai->setup();\r\n#if (PLAYAUDIO)\r\n\taudio->setup();\r\n#endif\r\n\r\n\r\n\t\/\/ -- Main Loop -----------------------------------------------------------\r\n\twhile (gameai->planFrame())\r\n\t{\r\n\t\tReal elapsed_time = gameai->getElapsedTime();\r\n\r\n\t\tinput->HandleEvents();\r\n\t\tenemyai->update(elapsed_time);\r\n\r\n\t\tsimulation->step(elapsed_time);\r\n\r\n#if (PLAYAUDIO)\r\n\t\taudio->update(elapsed_time);\r\n#endif\r\n\t\trenderer->render(elapsed_time);\r\n\t}\r\n\r\n\t\/\/ -- Cleanup & Exit ------------------------------------------------------\r\n\tdelete enemyai;\r\n\tdelete input;\r\n\tdelete simulation;\r\n\tdelete gameai;\r\n#if (PLAYAUDIO)\r\n\tdelete audio;\r\n#endif\r\n\tdelete renderer;\r\n\tshutdown_inventory();\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>turned sound on<commit_after>\/\/ Platform Specific Code\r\n#include \"Standard.h\"\r\n\r\n\/\/ Sub-System Components\r\n#include \"component\/entities\/entities.h\"\r\n#include \"component\/gameai\/gameai.h\"\r\n#include \"component\/enemyai\/enemyai.h\"\r\n#include \"component\/rendering\/rendering.h\"\r\n#include \"component\/physics\/physics.h\"\r\n#include \"component\/input\/input.h\"\r\n#ifdef _WIN32\r\n#include \"component\/audio\/audio.h\"\r\n#endif\r\n\r\n#define PLAYAUDIO 1\r\n\r\nint main( int argc, char** argv )\r\n{\r\n\t\/\/ -- Platfor Specific Init -----------------------------------------------\r\n\tINIT_PLATFORM();\r\n\r\n\t\/\/ -- Init components -----------------------------------------------------\r\n\t\/\/ Register Events\r\n\tRenderer *renderer = new Renderer();\r\n\tinit_inventory();\r\n\tPhysics::Simulation *simulation = new Physics::Simulation();\r\n\tInput *input = new Input();\r\n#if (PLAYAUDIO)\r\n\tAudio *audio = new Audio();  \r\n#endif\r\n\r\n\tGameAi *gameai = new GameAi();\r\n\tEnemyAi *enemyai = new EnemyAi();\r\n\r\n\t\/\/ Act on events\r\n\tgameai->setup();\r\n\trenderer->setup();\r\n\tsimulation->loadWorld();\r\n\tinput->setup();\r\n\tenemyai->setup();\r\n#if (PLAYAUDIO)\r\n\taudio->setup();\r\n#endif\r\n\r\n\r\n\t\/\/ -- Main Loop -----------------------------------------------------------\r\n\twhile (gameai->planFrame())\r\n\t{\r\n\t\tReal elapsed_time = gameai->getElapsedTime();\r\n\r\n\t\tinput->HandleEvents();\r\n\t\tenemyai->update(elapsed_time);\r\n\r\n\t\tsimulation->step(elapsed_time);\r\n\r\n#if (PLAYAUDIO)\r\n\t\taudio->update(elapsed_time);\r\n#endif\r\n\t\trenderer->render(elapsed_time);\r\n\t}\r\n\r\n\t\/\/ -- Cleanup & Exit ------------------------------------------------------\r\n\tdelete enemyai;\r\n\tdelete input;\r\n\tdelete simulation;\r\n\tdelete gameai;\r\n#if (PLAYAUDIO)\r\n\tdelete audio;\r\n#endif\r\n\tdelete renderer;\r\n\tshutdown_inventory();\r\n\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>86936fde-2d15-11e5-af21-0401358ea401<commit_msg>86936fdf-2d15-11e5-af21-0401358ea401<commit_after>86936fdf-2d15-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>1be0fecc-585b-11e5-a64e-6c40088e03e4<commit_msg>1be9b652-585b-11e5-8754-6c40088e03e4<commit_after>1be9b652-585b-11e5-8754-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>2e8790a8-2e4f-11e5-a2ec-28cfe91dbc4b<commit_msg>2e90105e-2e4f-11e5-ab4e-28cfe91dbc4b<commit_after>2e90105e-2e4f-11e5-ab4e-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>7663ce9a-2d53-11e5-baeb-247703a38240<commit_msg>76644f64-2d53-11e5-baeb-247703a38240<commit_after>76644f64-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: document.hxx,v $\n *\n *  $Revision: 1.32 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 12:39:43 $\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 DOCUMENT_HXX\n#define DOCUMENT_HXX\n\n#define SMDLL   1\n\n#ifndef _SOT_STORAGE_HXX\n#include <sot\/storage.hxx>\n#endif\n#ifndef _SOT_SOTREF_HXX \/\/autogen\n#include <sot\/sotref.hxx>\n#endif\n#ifndef _SFX_OBJSH_HXX \/\/autogen\n#include <sfx2\/objsh.hxx>\n#endif\n#ifndef _SFXLSTNER_HXX \/\/autogen\n#include <svtools\/lstner.hxx>\n#endif\n#ifndef _SFX_OBJFAC_HXX \/\/autogen\n#include <sfx2\/docfac.hxx>\n#endif\n#ifndef _SV_VIRDEV_HXX \/\/autogen\n#include <vcl\/virdev.hxx>\n#endif\n\n#ifndef _FORMAT_HXX\n#include \"format.hxx\"\n#endif\n#ifndef PARSE_HXX\n#include \"parse.hxx\"\n#endif\n#ifndef SMMOD_HXX\n#include \"smmod.hxx\"\n#endif\n\n#include <vcl\/jobset.hxx>\n\nclass SmNode;\nclass SfxMenuBarManager;\nclass SfxPrinter;\nclass Printer;\n\n#define HINT_DATACHANGED    1004\n\n#define SM30BIDENT   ((ULONG)0x534D3033L)\n#define SM30IDENT    ((ULONG)0x30334d53L)\n#define SM304AIDENT  ((ULONG)0x34303330L)\n#define SM30VERSION  ((ULONG)0x00010000L)\n#define SM50VERSION  ((ULONG)0x00010001L)   \/\/Unterschied zur SM30VERSION ist\n                                            \/\/der neue Border im Format.\n\n#define FRMIDENT    ((ULONG)0x03031963L)\n#define FRMVERSION  ((ULONG)0x00010001L)\n\n#define STAROFFICE_XML  \"StarOffice XML (Math)\"\n#define MATHML_XML      \"MathML XML (Math)\"\n\n\/* Zugriff auf den Drucker sollte ausschliesslich ueber diese Klasse erfolgen\n * ==========================================================================\n *\n * Der Drucker kann dem Dokument oder auch dem OLE-Container gehoeren. Wenn\n * das Dokument also eine OLE-Dokument ist, so gehoert der Drucker auch\n * grundsaetzlich dem Container. Der Container arbeitet aber eventuell mit\n * einer anderen MapUnit als der Server. Der Drucker wird bezueglich des MapMode\n * im Konstruktor entsprechend eingestellt und im Destruktor wieder restauriert.\n * Das bedingt natuerlich, das diese Klasse immer nur kurze Zeit existieren darf\n * (etwa waehrend des Paints).\n * Die Kontrolle darueber ob der Drucker selbst angelegt, vom Server besorgt\n * oder dann auch NULL ist, uebernimmt die DocShell in der Methode GetPrt(),\n * fuer die der Access auch Friend der DocShell ist.\n*\/\n\nclass SmDocShell;\nclass EditEngine;\n\nclass SmPrinterAccess\n{\n    Printer* pPrinter;\n    OutputDevice* pRefDev;\npublic:\n    SmPrinterAccess( SmDocShell &rDocShell );\n    ~SmPrinterAccess();\n    Printer* GetPrinter()  { return pPrinter; }\n    OutputDevice* GetRefDev()  { return pRefDev; }\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SetEditEngineDefaultFonts(\n        EditEngine &rEditEngine,\n        SfxItemPool &rEditEngineItemPool );\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass SmDocShell : public SfxObjectShell, public SfxListener\n{\n    friend class SmPrinterAccess;\n    friend class SmModel;\n\n    String              aText;\n    SmFormat            aFormat;\n    SmParser            aInterpreter;\n    String              aAccText;\n    SmNode             *pTree;\n    SfxMenuBarManager  *pMenuMgr;\n    SfxItemPool        *pEditEngineItemPool;\n    EditEngine         *pEditEngine;\n    SfxPrinter         *pPrinter;       \/\/Siehe Kommentar zum SmPrinter Access!\n    Printer            *pTmpPrinter;    \/\/ebenfalls\n    long                nLeftBorder,\n                        nRightBorder,\n                        nTopBorder,\n                        nBottomBorder;\n    USHORT              nModifyCount;\n    BOOL                bIsFormulaArranged;\n\n\n\n    virtual void SFX_NOTIFY(SfxBroadcaster& rBC, const TypeId& rBCType,\n                        const SfxHint& rHint, const TypeId& rHintType);\n\n    BOOL        WriteAsMathType3( SfxMedium& );\n\n    virtual void        Draw(OutputDevice *pDevice,\n                             const JobSetup & rSetup,\n                             USHORT nAspect = ASPECT_CONTENT);\n\n    virtual void        FillClass(SvGlobalName* pClassName,\n                                  sal_uInt32*  pFormat,\n                                  String* pAppName,\n                                  String* pFullTypeName,\n                                  String* pShortTypeName,\n                                  sal_Int32 nFileFormat ) const;\n\n    virtual BOOL        SetData( const String& rData );\n    virtual ULONG       GetMiscStatus() const;\n    virtual void        OnDocumentPrinterChanged( Printer * );\n    virtual sal_Bool    InitNew( const ::com::sun::star::uno::Reference< ::com::sun::star::embed::XStorage >& xStorage );\n    virtual BOOL        Load( SfxMedium& rMedium );\n            void        ImplSave(  SvStorageStreamRef xStrm  );\n    virtual BOOL        Save();\n    virtual BOOL        SaveAs( SfxMedium& rMedium );\n    virtual BOOL        ConvertTo( SfxMedium &rMedium );\n    virtual BOOL        SaveCompleted( const ::com::sun::star::uno::Reference< ::com::sun::star::embed::XStorage >& xStorage );\n\n    Printer             *GetPrt();\n    OutputDevice*       GetRefDev();\n\n    BOOL                IsFormulaArranged() const { return bIsFormulaArranged; }\n    void                SetFormulaArranged(BOOL bVal) { bIsFormulaArranged = bVal; }\n\n    virtual BOOL        ConvertFrom(SfxMedium &rMedium);\n\npublic:\n    TYPEINFO();\n    SFX_DECL_INTERFACE(SFX_INTERFACE_SMA_START+1)\n    using SotObject::GetInterface;\n    SFX_DECL_OBJECTFACTORY();\n\n                SmDocShell(SfxObjectCreateMode eMode = SFX_CREATE_MODE_EMBEDDED);\n    virtual     ~SmDocShell();\n\n    void        LoadSymbols();\n    void        SaveSymbols();\n\n    void        ArrangeFormula();\n\n    \/\/Zugriff fuer die View. Diese Zugriffe sind nur fuer den nicht OLE-Fall!\n    \/\/und fuer die Kommunikation mit dem SFX!\n    \/\/Alle internen Verwendungen des Printers sollten ausschlieslich uber\n    \/\/den SmPrinterAccess funktionieren.\n    BOOL        HasPrinter()    { return 0 != pPrinter; }\n    SfxPrinter *GetPrinter()    { GetPrt(); return pPrinter; }\n    void        SetPrinter( SfxPrinter * );\n\n    const String &GetComment() const;\n\n    \/\/ to replace chars that can not be saved with the document...\n    sal_Bool    ReplaceBadChars();\n\n    void        UpdateText();\n    void        SetText(const String& rBuffer);\n    String&     GetText() { return (aText); }\n    void        SetFormat(SmFormat& rFormat);\n    const SmFormat&  GetFormat() { return (aFormat); }\n\n    void            Parse();\n    SmParser &      GetParser() { return aInterpreter; }\n    const SmNode *  GetFormulaTree() const  { return pTree; }\n    void            SetFormulaTree(SmNode *&rTree) { pTree = rTree; }\n\n    String          GetAccessibleText();\n\n    EditEngine &    GetEditEngine();\n    SfxItemPool &   GetEditEngineItemPool();\n\n    void        Draw(OutputDevice &rDev, Point &rPosition);\n    Size        GetSize();\n\n    void        Repaint();\n\n    virtual     SfxUndoManager *GetUndoManager ();\n\n    virtual     SfxItemPool& GetPool() const;\n\n    void        Execute( SfxRequest& rReq );\n    void        GetState(SfxItemSet &);\n\n    virtual void SetVisArea (const Rectangle & rVisArea);\n    virtual void SetModified(BOOL bModified);\n};\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS custommeta (1.32.54); FILE MERGED 2008\/01\/23 17:11:39 mst 1.32.54.1: - starmath\/inc\/document.hxx, starmath\/source\/document.cxx:   + use XDocumentProperties instead of SfxDocumentInfo   + SmDocShell::GetComment returns String instead of String&   + fix bug: GetComment used a static variable to store document-specific data<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: document.hxx,v $\n *\n *  $Revision: 1.33 $\n *\n *  last change: $Author: obo $ $Date: 2008-02-26 14:43: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#ifndef DOCUMENT_HXX\n#define DOCUMENT_HXX\n\n#define SMDLL   1\n\n#ifndef _SOT_STORAGE_HXX\n#include <sot\/storage.hxx>\n#endif\n#ifndef _SOT_SOTREF_HXX \/\/autogen\n#include <sot\/sotref.hxx>\n#endif\n#ifndef _SFX_OBJSH_HXX \/\/autogen\n#include <sfx2\/objsh.hxx>\n#endif\n#ifndef _SFXLSTNER_HXX \/\/autogen\n#include <svtools\/lstner.hxx>\n#endif\n#ifndef _SFX_OBJFAC_HXX \/\/autogen\n#include <sfx2\/docfac.hxx>\n#endif\n#ifndef _SV_VIRDEV_HXX \/\/autogen\n#include <vcl\/virdev.hxx>\n#endif\n\n#ifndef _FORMAT_HXX\n#include \"format.hxx\"\n#endif\n#ifndef PARSE_HXX\n#include \"parse.hxx\"\n#endif\n#ifndef SMMOD_HXX\n#include \"smmod.hxx\"\n#endif\n\n#include <vcl\/jobset.hxx>\n\nclass SmNode;\nclass SfxMenuBarManager;\nclass SfxPrinter;\nclass Printer;\n\n#define HINT_DATACHANGED    1004\n\n#define SM30BIDENT   ((ULONG)0x534D3033L)\n#define SM30IDENT    ((ULONG)0x30334d53L)\n#define SM304AIDENT  ((ULONG)0x34303330L)\n#define SM30VERSION  ((ULONG)0x00010000L)\n#define SM50VERSION  ((ULONG)0x00010001L)   \/\/Unterschied zur SM30VERSION ist\n                                            \/\/der neue Border im Format.\n\n#define FRMIDENT    ((ULONG)0x03031963L)\n#define FRMVERSION  ((ULONG)0x00010001L)\n\n#define STAROFFICE_XML  \"StarOffice XML (Math)\"\n#define MATHML_XML      \"MathML XML (Math)\"\n\n\/* Zugriff auf den Drucker sollte ausschliesslich ueber diese Klasse erfolgen\n * ==========================================================================\n *\n * Der Drucker kann dem Dokument oder auch dem OLE-Container gehoeren. Wenn\n * das Dokument also eine OLE-Dokument ist, so gehoert der Drucker auch\n * grundsaetzlich dem Container. Der Container arbeitet aber eventuell mit\n * einer anderen MapUnit als der Server. Der Drucker wird bezueglich des MapMode\n * im Konstruktor entsprechend eingestellt und im Destruktor wieder restauriert.\n * Das bedingt natuerlich, das diese Klasse immer nur kurze Zeit existieren darf\n * (etwa waehrend des Paints).\n * Die Kontrolle darueber ob der Drucker selbst angelegt, vom Server besorgt\n * oder dann auch NULL ist, uebernimmt die DocShell in der Methode GetPrt(),\n * fuer die der Access auch Friend der DocShell ist.\n*\/\n\nclass SmDocShell;\nclass EditEngine;\n\nclass SmPrinterAccess\n{\n    Printer* pPrinter;\n    OutputDevice* pRefDev;\npublic:\n    SmPrinterAccess( SmDocShell &rDocShell );\n    ~SmPrinterAccess();\n    Printer* GetPrinter()  { return pPrinter; }\n    OutputDevice* GetRefDev()  { return pRefDev; }\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SetEditEngineDefaultFonts(\n        EditEngine &rEditEngine,\n        SfxItemPool &rEditEngineItemPool );\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass SmDocShell : public SfxObjectShell, public SfxListener\n{\n    friend class SmPrinterAccess;\n    friend class SmModel;\n\n    String              aText;\n    SmFormat            aFormat;\n    SmParser            aInterpreter;\n    String              aAccText;\n    SmNode             *pTree;\n    SfxMenuBarManager  *pMenuMgr;\n    SfxItemPool        *pEditEngineItemPool;\n    EditEngine         *pEditEngine;\n    SfxPrinter         *pPrinter;       \/\/Siehe Kommentar zum SmPrinter Access!\n    Printer            *pTmpPrinter;    \/\/ebenfalls\n    long                nLeftBorder,\n                        nRightBorder,\n                        nTopBorder,\n                        nBottomBorder;\n    USHORT              nModifyCount;\n    BOOL                bIsFormulaArranged;\n\n\n\n    virtual void SFX_NOTIFY(SfxBroadcaster& rBC, const TypeId& rBCType,\n                        const SfxHint& rHint, const TypeId& rHintType);\n\n    BOOL        WriteAsMathType3( SfxMedium& );\n\n    virtual void        Draw(OutputDevice *pDevice,\n                             const JobSetup & rSetup,\n                             USHORT nAspect = ASPECT_CONTENT);\n\n    virtual void        FillClass(SvGlobalName* pClassName,\n                                  sal_uInt32*  pFormat,\n                                  String* pAppName,\n                                  String* pFullTypeName,\n                                  String* pShortTypeName,\n                                  sal_Int32 nFileFormat ) const;\n\n    virtual BOOL        SetData( const String& rData );\n    virtual ULONG       GetMiscStatus() const;\n    virtual void        OnDocumentPrinterChanged( Printer * );\n    virtual sal_Bool    InitNew( const ::com::sun::star::uno::Reference< ::com::sun::star::embed::XStorage >& xStorage );\n    virtual BOOL        Load( SfxMedium& rMedium );\n            void        ImplSave(  SvStorageStreamRef xStrm  );\n    virtual BOOL        Save();\n    virtual BOOL        SaveAs( SfxMedium& rMedium );\n    virtual BOOL        ConvertTo( SfxMedium &rMedium );\n    virtual BOOL        SaveCompleted( const ::com::sun::star::uno::Reference< ::com::sun::star::embed::XStorage >& xStorage );\n\n    Printer             *GetPrt();\n    OutputDevice*       GetRefDev();\n\n    BOOL                IsFormulaArranged() const { return bIsFormulaArranged; }\n    void                SetFormulaArranged(BOOL bVal) { bIsFormulaArranged = bVal; }\n\n    virtual BOOL        ConvertFrom(SfxMedium &rMedium);\n\npublic:\n    TYPEINFO();\n    SFX_DECL_INTERFACE(SFX_INTERFACE_SMA_START+1)\n    using SotObject::GetInterface;\n    SFX_DECL_OBJECTFACTORY();\n\n                SmDocShell(SfxObjectCreateMode eMode = SFX_CREATE_MODE_EMBEDDED);\n    virtual     ~SmDocShell();\n\n    void        LoadSymbols();\n    void        SaveSymbols();\n\n    void        ArrangeFormula();\n\n    \/\/Zugriff fuer die View. Diese Zugriffe sind nur fuer den nicht OLE-Fall!\n    \/\/und fuer die Kommunikation mit dem SFX!\n    \/\/Alle internen Verwendungen des Printers sollten ausschlieslich uber\n    \/\/den SmPrinterAccess funktionieren.\n    BOOL        HasPrinter()    { return 0 != pPrinter; }\n    SfxPrinter *GetPrinter()    { GetPrt(); return pPrinter; }\n    void        SetPrinter( SfxPrinter * );\n\n    const String GetComment() const;\n\n    \/\/ to replace chars that can not be saved with the document...\n    sal_Bool    ReplaceBadChars();\n\n    void        UpdateText();\n    void        SetText(const String& rBuffer);\n    String&     GetText() { return (aText); }\n    void        SetFormat(SmFormat& rFormat);\n    const SmFormat&  GetFormat() { return (aFormat); }\n\n    void            Parse();\n    SmParser &      GetParser() { return aInterpreter; }\n    const SmNode *  GetFormulaTree() const  { return pTree; }\n    void            SetFormulaTree(SmNode *&rTree) { pTree = rTree; }\n\n    String          GetAccessibleText();\n\n    EditEngine &    GetEditEngine();\n    SfxItemPool &   GetEditEngineItemPool();\n\n    void        Draw(OutputDevice &rDev, Point &rPosition);\n    Size        GetSize();\n\n    void        Repaint();\n\n    virtual     SfxUndoManager *GetUndoManager ();\n\n    virtual     SfxItemPool& GetPool() const;\n\n    void        Execute( SfxRequest& rReq );\n    void        GetState(SfxItemSet &);\n\n    virtual void SetVisArea (const Rectangle & rVisArea);\n    virtual void SetModified(BOOL bModified);\n};\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>7f408ccc-2e4f-11e5-a804-28cfe91dbc4b<commit_msg>7f4c26f3-2e4f-11e5-a447-28cfe91dbc4b<commit_after>7f4c26f3-2e4f-11e5-a447-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/\/===-- ExecutionEngineBindings.cpp - C bindings for EEs ------------------===\/\/\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 C bindings for the ExecutionEngine library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"jit\"\n#include \"llvm-c\/ExecutionEngine.h\"\n#include \"llvm\/ExecutionEngine\/GenericValue.h\"\n#include \"llvm\/ExecutionEngine\/ExecutionEngine.h\"\n#include <cstring>\n\nusing namespace llvm;\n\n\/*===-- Operations on generic values --------------------------------------===*\/\n\nLLVMGenericValueRef LLVMCreateGenericValueOfInt(LLVMTypeRef Ty,\n                                                unsigned long long N,\n                                                int IsSigned) {\n  GenericValue *GenVal = new GenericValue();\n  GenVal->IntVal = APInt(unwrap<IntegerType>(Ty)->getBitWidth(), N, IsSigned);\n  return wrap(GenVal);\n}\n\nLLVMGenericValueRef LLVMCreateGenericValueOfPointer(void *P) {\n  GenericValue *GenVal = new GenericValue();\n  GenVal->PointerVal = P;\n  return wrap(GenVal);\n}\n\nLLVMGenericValueRef LLVMCreateGenericValueOfFloat(LLVMTypeRef TyRef, double N) {\n  GenericValue *GenVal = new GenericValue();\n  switch (unwrap(TyRef)->getTypeID()) {\n  case Type::FloatTyID:\n    GenVal->FloatVal = N;\n    break;\n  case Type::DoubleTyID:\n    GenVal->DoubleVal = N;\n    break;\n  default:\n    assert(0 && \"LLVMGenericValueToFloat supports only float and double.\");\n    break;\n  }\n  return wrap(GenVal);\n}\n\nunsigned LLVMGenericValueIntWidth(LLVMGenericValueRef GenValRef) {\n  return unwrap(GenValRef)->IntVal.getBitWidth();\n}\n\nunsigned long long LLVMGenericValueToInt(LLVMGenericValueRef GenValRef,\n                                         int IsSigned) {\n  GenericValue *GenVal = unwrap(GenValRef);\n  if (IsSigned)\n    return GenVal->IntVal.getSExtValue();\n  else\n    return GenVal->IntVal.getZExtValue();\n}\n\nvoid *LLVMGenericValueToPointer(LLVMGenericValueRef GenVal) {\n  return unwrap(GenVal)->PointerVal;\n}\n\ndouble LLVMGenericValueToFloat(LLVMTypeRef TyRef, LLVMGenericValueRef GenVal) {\n  switch (unwrap(TyRef)->getTypeID()) {\n  case Type::FloatTyID:\n    return unwrap(GenVal)->FloatVal;\n  case Type::DoubleTyID:\n    return unwrap(GenVal)->DoubleVal;\n  default:\n    assert(0 && \"LLVMGenericValueToFloat supports only float and double.\");\n    break;\n  }\n  return 0; \/\/ Not reached\n}\n\nvoid LLVMDisposeGenericValue(LLVMGenericValueRef GenVal) {\n  delete unwrap(GenVal);\n}\n\n\/*===-- Operations on execution engines -----------------------------------===*\/\n\nint LLVMCreateExecutionEngine(LLVMExecutionEngineRef *OutEE,\n                              LLVMModuleProviderRef MP,\n                              char **OutError) {\n  std::string Error;\n  if (ExecutionEngine *EE = ExecutionEngine::create(unwrap(MP), false, &Error)){\n    *OutEE = wrap(EE);\n    return 0;\n  }\n  *OutError = strdup(Error.c_str());\n  return 1;\n}\n\nint LLVMCreateInterpreter(LLVMExecutionEngineRef *OutInterp,\n                          LLVMModuleProviderRef MP,\n                          char **OutError) {\n  std::string Error;\n  if (ExecutionEngine *Interp =\n      ExecutionEngine::create(unwrap(MP), true, &Error)) {\n    *OutInterp = wrap(Interp);\n    return 0;\n  }\n  *OutError = strdup(Error.c_str());\n  return 1;\n}\n\nint LLVMCreateJITCompiler(LLVMExecutionEngineRef *OutJIT,\n                          LLVMModuleProviderRef MP,\n                          unsigned OptLevel,\n                          char **OutError) {\n  std::string Error;\n  if (ExecutionEngine *JIT =\n      ExecutionEngine::createJIT(unwrap(MP), &Error, 0,\n                                 (CodeGenOpt::Level)OptLevel)) {\n    *OutJIT = wrap(JIT);\n    return 0;\n  }\n  *OutError = strdup(Error.c_str());\n  return 1;\n}\n\nvoid LLVMDisposeExecutionEngine(LLVMExecutionEngineRef EE) {\n  delete unwrap(EE);\n}\n\nvoid LLVMRunStaticConstructors(LLVMExecutionEngineRef EE) {\n  unwrap(EE)->runStaticConstructorsDestructors(false);\n}\n\nvoid LLVMRunStaticDestructors(LLVMExecutionEngineRef EE) {\n  unwrap(EE)->runStaticConstructorsDestructors(true);\n}\n\nint LLVMRunFunctionAsMain(LLVMExecutionEngineRef EE, LLVMValueRef F,\n                          unsigned ArgC, const char * const *ArgV,\n                          const char * const *EnvP) {\n  std::vector<std::string> ArgVec;\n  for (unsigned I = 0; I != ArgC; ++I)\n    ArgVec.push_back(ArgV[I]);\n  \n  return unwrap(EE)->runFunctionAsMain(unwrap<Function>(F), ArgVec, EnvP);\n}\n\nLLVMGenericValueRef LLVMRunFunction(LLVMExecutionEngineRef EE, LLVMValueRef F,\n                                    unsigned NumArgs,\n                                    LLVMGenericValueRef *Args) {\n  std::vector<GenericValue> ArgVec;\n  ArgVec.reserve(NumArgs);\n  for (unsigned I = 0; I != NumArgs; ++I)\n    ArgVec.push_back(*unwrap(Args[I]));\n  \n  GenericValue *Result = new GenericValue();\n  *Result = unwrap(EE)->runFunction(unwrap<Function>(F), ArgVec);\n  return wrap(Result);\n}\n\nvoid LLVMFreeMachineCodeForFunction(LLVMExecutionEngineRef EE, LLVMValueRef F) {\n  unwrap(EE)->freeMachineCodeForFunction(unwrap<Function>(F));\n}\n\nvoid LLVMAddModuleProvider(LLVMExecutionEngineRef EE, LLVMModuleProviderRef MP){\n  unwrap(EE)->addModuleProvider(unwrap(MP));\n}\n\nint LLVMRemoveModuleProvider(LLVMExecutionEngineRef EE,\n                             LLVMModuleProviderRef MP,\n                             LLVMModuleRef *OutMod, char **OutError) {\n  std::string Error;\n  if (Module *Gone = unwrap(EE)->removeModuleProvider(unwrap(MP), &Error)) {\n    *OutMod = wrap(Gone);\n    return 0;\n  }\n  if (OutError)\n    *OutError = strdup(Error.c_str());\n  return 1;\n}\n\nint LLVMFindFunction(LLVMExecutionEngineRef EE, const char *Name,\n                     LLVMValueRef *OutFn) {\n  if (Function *F = unwrap(EE)->FindFunctionNamed(Name)) {\n    *OutFn = wrap(F);\n    return 0;\n  }\n  return 1;\n}\n\nLLVMTargetDataRef LLVMGetExecutionEngineTargetData(LLVMExecutionEngineRef EE) {\n  return wrap(unwrap(EE)->getTargetData());\n}\n\nvoid LLVMAddGlobalMapping(LLVMExecutionEngineRef EE, LLVMValueRef Global,\n                          void* Addr) {\n  unwrap(EE)->addGlobalMapping(unwrap<GlobalValue>(Global), Addr);\n}\n\nvoid *LLVMGetPointerToGlobal(LLVMExecutionEngineRef EE, LLVMValueRef Global) {\n  return unwrap(EE)->getPointerToGlobal(unwrap<GlobalValue>(Global));\n}\n<commit_msg>Fix the EE bindings to use the proper EE interfaces for creating a JIT. Calling into createJIT directly creates a circular dependency between libjit and lib ee.<commit_after>\/\/===-- ExecutionEngineBindings.cpp - C bindings for EEs ------------------===\/\/\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 C bindings for the ExecutionEngine library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"jit\"\n#include \"llvm-c\/ExecutionEngine.h\"\n#include \"llvm\/ExecutionEngine\/GenericValue.h\"\n#include \"llvm\/ExecutionEngine\/ExecutionEngine.h\"\n#include <cstring>\n\nusing namespace llvm;\n\n\/*===-- Operations on generic values --------------------------------------===*\/\n\nLLVMGenericValueRef LLVMCreateGenericValueOfInt(LLVMTypeRef Ty,\n                                                unsigned long long N,\n                                                int IsSigned) {\n  GenericValue *GenVal = new GenericValue();\n  GenVal->IntVal = APInt(unwrap<IntegerType>(Ty)->getBitWidth(), N, IsSigned);\n  return wrap(GenVal);\n}\n\nLLVMGenericValueRef LLVMCreateGenericValueOfPointer(void *P) {\n  GenericValue *GenVal = new GenericValue();\n  GenVal->PointerVal = P;\n  return wrap(GenVal);\n}\n\nLLVMGenericValueRef LLVMCreateGenericValueOfFloat(LLVMTypeRef TyRef, double N) {\n  GenericValue *GenVal = new GenericValue();\n  switch (unwrap(TyRef)->getTypeID()) {\n  case Type::FloatTyID:\n    GenVal->FloatVal = N;\n    break;\n  case Type::DoubleTyID:\n    GenVal->DoubleVal = N;\n    break;\n  default:\n    assert(0 && \"LLVMGenericValueToFloat supports only float and double.\");\n    break;\n  }\n  return wrap(GenVal);\n}\n\nunsigned LLVMGenericValueIntWidth(LLVMGenericValueRef GenValRef) {\n  return unwrap(GenValRef)->IntVal.getBitWidth();\n}\n\nunsigned long long LLVMGenericValueToInt(LLVMGenericValueRef GenValRef,\n                                         int IsSigned) {\n  GenericValue *GenVal = unwrap(GenValRef);\n  if (IsSigned)\n    return GenVal->IntVal.getSExtValue();\n  else\n    return GenVal->IntVal.getZExtValue();\n}\n\nvoid *LLVMGenericValueToPointer(LLVMGenericValueRef GenVal) {\n  return unwrap(GenVal)->PointerVal;\n}\n\ndouble LLVMGenericValueToFloat(LLVMTypeRef TyRef, LLVMGenericValueRef GenVal) {\n  switch (unwrap(TyRef)->getTypeID()) {\n  case Type::FloatTyID:\n    return unwrap(GenVal)->FloatVal;\n  case Type::DoubleTyID:\n    return unwrap(GenVal)->DoubleVal;\n  default:\n    assert(0 && \"LLVMGenericValueToFloat supports only float and double.\");\n    break;\n  }\n  return 0; \/\/ Not reached\n}\n\nvoid LLVMDisposeGenericValue(LLVMGenericValueRef GenVal) {\n  delete unwrap(GenVal);\n}\n\n\/*===-- Operations on execution engines -----------------------------------===*\/\n\nint LLVMCreateExecutionEngine(LLVMExecutionEngineRef *OutEE,\n                              LLVMModuleProviderRef MP,\n                              char **OutError) {\n  std::string Error;\n  if (ExecutionEngine *EE = ExecutionEngine::create(unwrap(MP), false, &Error)){\n    *OutEE = wrap(EE);\n    return 0;\n  }\n  *OutError = strdup(Error.c_str());\n  return 1;\n}\n\nint LLVMCreateInterpreter(LLVMExecutionEngineRef *OutInterp,\n                          LLVMModuleProviderRef MP,\n                          char **OutError) {\n  std::string Error;\n  if (ExecutionEngine *Interp =\n      ExecutionEngine::create(unwrap(MP), true, &Error)) {\n    *OutInterp = wrap(Interp);\n    return 0;\n  }\n  *OutError = strdup(Error.c_str());\n  return 1;\n}\n\nint LLVMCreateJITCompiler(LLVMExecutionEngineRef *OutJIT,\n                          LLVMModuleProviderRef MP,\n                          unsigned OptLevel,\n                          char **OutError) {\n  std::string Error;\n  if (ExecutionEngine *JIT =\n      ExecutionEngine::create(unwrap(MP), false, &Error,\n                                 (CodeGenOpt::Level)OptLevel)) {\n    *OutJIT = wrap(JIT);\n    return 0;\n  }\n  *OutError = strdup(Error.c_str());\n  return 1;\n}\n\nvoid LLVMDisposeExecutionEngine(LLVMExecutionEngineRef EE) {\n  delete unwrap(EE);\n}\n\nvoid LLVMRunStaticConstructors(LLVMExecutionEngineRef EE) {\n  unwrap(EE)->runStaticConstructorsDestructors(false);\n}\n\nvoid LLVMRunStaticDestructors(LLVMExecutionEngineRef EE) {\n  unwrap(EE)->runStaticConstructorsDestructors(true);\n}\n\nint LLVMRunFunctionAsMain(LLVMExecutionEngineRef EE, LLVMValueRef F,\n                          unsigned ArgC, const char * const *ArgV,\n                          const char * const *EnvP) {\n  std::vector<std::string> ArgVec;\n  for (unsigned I = 0; I != ArgC; ++I)\n    ArgVec.push_back(ArgV[I]);\n  \n  return unwrap(EE)->runFunctionAsMain(unwrap<Function>(F), ArgVec, EnvP);\n}\n\nLLVMGenericValueRef LLVMRunFunction(LLVMExecutionEngineRef EE, LLVMValueRef F,\n                                    unsigned NumArgs,\n                                    LLVMGenericValueRef *Args) {\n  std::vector<GenericValue> ArgVec;\n  ArgVec.reserve(NumArgs);\n  for (unsigned I = 0; I != NumArgs; ++I)\n    ArgVec.push_back(*unwrap(Args[I]));\n  \n  GenericValue *Result = new GenericValue();\n  *Result = unwrap(EE)->runFunction(unwrap<Function>(F), ArgVec);\n  return wrap(Result);\n}\n\nvoid LLVMFreeMachineCodeForFunction(LLVMExecutionEngineRef EE, LLVMValueRef F) {\n  unwrap(EE)->freeMachineCodeForFunction(unwrap<Function>(F));\n}\n\nvoid LLVMAddModuleProvider(LLVMExecutionEngineRef EE, LLVMModuleProviderRef MP){\n  unwrap(EE)->addModuleProvider(unwrap(MP));\n}\n\nint LLVMRemoveModuleProvider(LLVMExecutionEngineRef EE,\n                             LLVMModuleProviderRef MP,\n                             LLVMModuleRef *OutMod, char **OutError) {\n  std::string Error;\n  if (Module *Gone = unwrap(EE)->removeModuleProvider(unwrap(MP), &Error)) {\n    *OutMod = wrap(Gone);\n    return 0;\n  }\n  if (OutError)\n    *OutError = strdup(Error.c_str());\n  return 1;\n}\n\nint LLVMFindFunction(LLVMExecutionEngineRef EE, const char *Name,\n                     LLVMValueRef *OutFn) {\n  if (Function *F = unwrap(EE)->FindFunctionNamed(Name)) {\n    *OutFn = wrap(F);\n    return 0;\n  }\n  return 1;\n}\n\nLLVMTargetDataRef LLVMGetExecutionEngineTargetData(LLVMExecutionEngineRef EE) {\n  return wrap(unwrap(EE)->getTargetData());\n}\n\nvoid LLVMAddGlobalMapping(LLVMExecutionEngineRef EE, LLVMValueRef Global,\n                          void* Addr) {\n  unwrap(EE)->addGlobalMapping(unwrap<GlobalValue>(Global), Addr);\n}\n\nvoid *LLVMGetPointerToGlobal(LLVMExecutionEngineRef EE, LLVMValueRef Global) {\n  return unwrap(EE)->getPointerToGlobal(unwrap<GlobalValue>(Global));\n}\n<|endoftext|>"}
{"text":"<commit_before>4f2b4ee6-2e4f-11e5-800f-28cfe91dbc4b<commit_msg>4f32a43d-2e4f-11e5-9b63-28cfe91dbc4b<commit_after>4f32a43d-2e4f-11e5-9b63-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#include \"marketMaker.h\"\r\nint main(int argc, char** argv)\r\n{\r\n\tMarketMaker marketMaker(argc, argv);\r\n\tcout << \"Succefully Initiated!\" << endl << endl;\r\n\tmarketMaker.start();\r\n}<commit_msg>Delete main.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>b67b7cba-2e4f-11e5-a357-28cfe91dbc4b<commit_msg>b682d942-2e4f-11e5-9816-28cfe91dbc4b<commit_after>b682d942-2e4f-11e5-9816-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <netdb.h>\n#include <arpa\/inet.h>\n#include <cstring>\n#include <unistd.h>\n\nusing namespace std;\n\nchar const * const SERVER_PORT = \"2000\";\nsize_t const MAX_BUF_LEN = 250;\nint const TIMEOUT_DURATION = 1;\n\nint\nmain()\n{\n    addrinfo hints, *server_addrinfo;\n    memset(&hints, 0, sizeof(hints));\n    hints.ai_family = AF_INET;\n    hints.ai_socktype = SOCK_DGRAM;\n    hints.ai_flags = AI_PASSIVE;\n\n    int status = getaddrinfo(\"localhost\", SERVER_PORT, &hints, &server_addrinfo);\n    if (status < 0)\n    {\n        cerr << \"getaddrinfo() failed, \" << gai_strerror(status) << endl;\n        return EXIT_FAILURE;\n    }\n\n    int server_socket = -1;\n    for (addrinfo *p = server_addrinfo; p != NULL; p = p->ai_next)\n    {\n        server_socket = socket(p->ai_family, p->ai_socktype, p->ai_protocol);\n        if (server_socket < 0)\n        {\n            cerr << \"Couldn't create socket, continuing...\" << endl;\n            continue;\n        }\n        timeval duration;\n        duration.tv_sec = TIMEOUT_DURATION;\n        duration.tv_usec = 0;\n        if (setsockopt(server_socket, SOL_SOCKET, SO_RCVTIMEO, &duration, sizeof(duration)) < 0)\n        {\n            close(server_socket);\n            server_socket = -1;\n            cerr << \"setsockout() failed to set SO_RCVTIMEO, continuing...\" << endl;\n            continue;\n        }\n        if (bind(server_socket, p->ai_addr, p->ai_addrlen) < 0)\n        {\n            close(server_socket);\n            server_socket = -1;\n            cerr << \"bind() failed, continuing...\" << endl;\n            continue;\n        }\n        sockaddr_in * server_sockaddr = reinterpret_cast< sockaddr_in *> (p->ai_addr);\n        char server_name[INET_ADDRSTRLEN];\n        inet_ntop(p->ai_family, &(server_sockaddr->sin_addr), server_name, INET_ADDRSTRLEN);\n        cout << \"Bound to socket at \" << server_name << \":\" << ntohs(server_sockaddr->sin_port) << endl;\n        break;\n    }\n\n    freeaddrinfo(server_addrinfo);\n    if (server_socket == -1)\n    {\n        cerr << \"bind() failed\" << endl;\n    }\n\n    char buffer[MAX_BUF_LEN];\n    sockaddr client_addr;\n    socklen_t client_addrlen;\n    ssize_t num_bytes = recvfrom(server_socket, buffer, sizeof(buffer), 0, &client_addr, &client_addrlen);\n    if (num_bytes < 0)\n    {\n        int err_no = errno;\n        if (err_no == EAGAIN || errno == EWOULDBLOCK)\n        {\n            cerr << \"No data recieved in \" << TIMEOUT_DURATION << \" seconds.\" << endl;\n        }\n        else\n        {\n            cerr << \"recvfrom() failed.\" << endl;\n        }\n    }\n\n    close(server_socket);\n    return 0;\n}<commit_msg>Added poll(2) to wait<commit_after>#include <iostream>\n#include <netdb.h>\n#include <arpa\/inet.h>\n#include <cstring>\n#include <unistd.h>\n#include <sys\/poll.h>\n\nusing namespace std;\n\nchar const *const SERVER_PORT = \"2000\";\n\nsize_t const MAX_BUF_LEN = 250;\n\nint const TIMEOUT_DURATION = 5; \/* Seconds *\/\n\nint\nmain()\n{\n    addrinfo hints, *server_addrinfo;\n    memset(&hints, 0, sizeof(hints));\n    hints.ai_family = AF_INET;\n    hints.ai_socktype = SOCK_DGRAM;\n    hints.ai_flags = AI_PASSIVE;\n\n    int status = getaddrinfo(\"localhost\", SERVER_PORT, &hints, &server_addrinfo);\n    if (status < 0)\n    {\n        cerr << \"getaddrinfo() failed, \" << gai_strerror(status) << endl;\n        return EXIT_FAILURE;\n    }\n\n    int server_socket = -1;\n    for (addrinfo *p = server_addrinfo; p != NULL; p = p->ai_next)\n    {\n        server_socket = socket(p->ai_family, p->ai_socktype, p->ai_protocol);\n        if (server_socket < 0)\n        {\n            cerr << \"Couldn't create socket, continuing...\" << endl;\n            continue;\n        }\n\n        int yes = 1;\n        if (setsockopt(server_socket, SOL_SOCKET, SO_REUSEADDR, &yes, sizeof(yes)) < 0)\n        {\n            close(server_socket);\n            server_socket = -1;\n            cerr << \"setsockopt() failed to set SO_REUSEADDR, continuing...\" << endl;\n            continue;\n        }\n\n\/\/        timeval duration;\n\/\/        duration.tv_sec = TIMEOUT_DURATION;\n\/\/        duration.tv_usec = 0;\n\/\/        if (setsockopt(server_socket, SOL_SOCKET, SO_RCVTIMEO, &duration, sizeof(duration)) < 0)\n\/\/        {\n\/\/            close(server_socket);\n\/\/            server_socket = -1;\n\/\/            cerr << \"setsockopt() failed to set SO_RCVTIMEO, continuing...\" << endl;\n\/\/            continue;\n\/\/        }\n\n        if (bind(server_socket, p->ai_addr, p->ai_addrlen) < 0)\n        {\n            close(server_socket);\n            server_socket = -1;\n            cerr << \"bind() failed, continuing...\" << endl;\n            continue;\n        }\n        sockaddr_in *server_sockaddr = reinterpret_cast< sockaddr_in *> (p->ai_addr);\n        char server_name[INET_ADDRSTRLEN];\n        inet_ntop(p->ai_family, &(server_sockaddr->sin_addr), server_name, INET_ADDRSTRLEN);\n        cout << \"Bound to socket at \" << server_name << \":\" << ntohs(server_sockaddr->sin_port) << endl;\n        break;\n    }\n\n    freeaddrinfo(server_addrinfo);\n    if (server_socket == -1)\n    {\n        cerr << \"bind() failed\" << endl;\n        return EXIT_FAILURE;\n    }\n\n    \/* Now poll for already existing server on the network *\/\n    pollfd server_pollfds[1];\n    memset(&server_pollfds[0], 0, sizeof(pollfd));\n    server_pollfds[0].fd = server_socket;\n    server_pollfds[0].events = POLLIN | POLLPRI | POLLHUP;\n    status = poll(server_pollfds, sizeof(server_pollfds) \/ sizeof(server_pollfds[0]), TIMEOUT_DURATION * 1000);\n\n    \/* Read data from server, if available *\/\n    char buffer[MAX_BUF_LEN];\n    sockaddr client_addr;\n    socklen_t client_addrlen;\n    ssize_t num_bytes = -1;\n    switch (status)\n    {\n        case -1:cerr << \"poll() failed, \" << status << endl;\n            return EXIT_FAILURE;\n        case 0:cerr << \"No data received in \" << TIMEOUT_DURATION << \" seconds.\" << endl;\n        default:\n            if (server_pollfds[0].revents & POLLIN)\n            {\n                num_bytes = recvfrom(server_socket, buffer, sizeof(buffer), 0, &client_addr, &client_addrlen);\n            }\n            else if (server_pollfds[0].revents & POLLPRI)\n            {\n                num_bytes = recvfrom(server_socket, buffer, sizeof(buffer), MSG_OOB, &client_addr, &client_addrlen);\n            }\n            else if (server_pollfds[0].revents & POLLHUP)\n            {\n                cerr << \"Remote server ended, continuing...\" << endl;\n            }\n    }\n\n    if (num_bytes > 0)\n    {\n        cout << \"Data received: <\" << buffer << \">\" << endl;\n    }\n    else\n    {\n        cout << \"No data received.\" << endl;\n    }\n\n    close(server_socket);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * meego-handset-pin\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\/* Qt includes *\/\n#include <QtGui\/QApplication>\n#include <QDBusConnection>\n#include <QtDebug>\n\n\/* oFono DBus interfaces *\/\n#include \"mgrif.h\"\n#include \"simif.h\"\n\n\/* oFono utilities*\/\n#include \"ofonoutils.h\"\n\n\/* oFono DBus types *\/\n#include \"ofonodbustypes.h\"\n\n\/* PinApplication *\/\n#include \"pinapplication.h\"\n\nint main(int argc, char *argv[])\n{\n    int mainErr = -1;\n    PinApplication a(argc, argv);\n\n    \/\/ Register meta types defined in ofonodbustypes.h\"\n    registerOfonoDbusTypes();\n\n    \/\/ DBus Connection systemBus\n    QDBusConnection systemBus = QDBusConnection::systemBus();\n    if( !systemBus.isConnected() ) {\n        QDBusError dbusError = systemBus.lastError();\n        qDebug() << \"Error:\" << dbusError.name() << \":\" << dbusError.message();\n        return mainErr;\n    }\n\n    \/\/ Instanciate proxy for org.ofono.Manager interface\n    MgrIf mgrIf(\"org.ofono\",\"\/\",systemBus,NULL);\n\n    \/\/ find org.ofono.SimManager interfaces for all modems\n    QList<SimIf*> simIfs = OfonoUtils::findSimInterfaces(systemBus,&mgrIf);\n    if (simIfs.isEmpty()) {\n        qDebug() << \"No  org.ofono.SimManager interface found, exiting\";\n        return mainErr;\n    }\n\n    \/\/ use just the first element of SimManager interfaces list\n    SimIf *firstSimIf = simIfs.first();\n\n    \/\/ Run SimToolkit application\n    mainErr = a.exec();\n\n    \/\/ delete all org.ofono.SimManager interfaces\n    while (!simIfs.isEmpty()) {\n        delete simIfs.first();\n        simIfs.removeFirst();\n    }\n\n    return mainErr;\n}\n\n<commit_msg>meego-handset-pin: fix property changes registration<commit_after>\/*\n * meego-handset-pin\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\/* Qt includes *\/\n#include <QtGui\/QApplication>\n#include <QDBusConnection>\n#include <QtDebug>\n\n\/* oFono DBus interfaces *\/\n#include \"mgrif.h\"\n#include \"simif.h\"\n\n\/* oFono utilities*\/\n#include \"ofonoutils.h\"\n\n\/* oFono DBus types *\/\n#include \"ofonodbustypes.h\"\n\n\/* PinApplication *\/\n#include \"pinapplication.h\"\n\nint main(int argc, char *argv[])\n{\n    int mainErr = -1;\n    PinApplication a(argc, argv);\n\n    \/\/ Register meta types defined in ofonodbustypes.h\"\n    registerOfonoDbusTypes();\n\n    \/\/ DBus Connection systemBus\n    QDBusConnection systemBus = QDBusConnection::systemBus();\n    if( !systemBus.isConnected() ) {\n        QDBusError dbusError = systemBus.lastError();\n        qDebug() << \"Error:\" << dbusError.name() << \":\" << dbusError.message();\n        return mainErr;\n    }\n\n    \/\/ Instanciate proxy for org.ofono.Manager interface\n    MgrIf mgrIf(\"org.ofono\",\"\/\",systemBus,NULL);\n\n    \/\/ find org.ofono.SimManager interfaces for all modems\n    QList<SimIf*> simIfs = OfonoUtils::findSimInterfaces(systemBus,&mgrIf);\n    if (simIfs.isEmpty()) {\n        qDebug() << \"No  org.ofono.SimManager interface found, exiting\";\n        return mainErr;\n    }\n\n    \/\/ use just the first element of SimManager interfaces list\n    SimIf *firstSimIf = simIfs.first();\n\n    \/\/ register app to track changes on \"PinRequired\" property\n    a.registerPinPropertyChanged(firstSimIf);\n\n    \/\/ Run SimToolkit application\n    mainErr = a.exec();\n\n    \/\/ delete all org.ofono.SimManager interfaces\n    while (!simIfs.isEmpty()) {\n        delete simIfs.first();\n        simIfs.removeFirst();\n    }\n\n    return mainErr;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>589c4b18-2e3a-11e5-bf79-c03896053bdd<commit_msg>58aa0936-2e3a-11e5-a3b9-c03896053bdd<commit_after>58aa0936-2e3a-11e5-a3b9-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>63db8b76-2fa5-11e5-809e-00012e3d3f12<commit_msg>63dd6034-2fa5-11e5-9d3b-00012e3d3f12<commit_after>63dd6034-2fa5-11e5-9d3b-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>85d9af3d-2e4f-11e5-9d80-28cfe91dbc4b<commit_msg>85e1a354-2e4f-11e5-8270-28cfe91dbc4b<commit_after>85e1a354-2e4f-11e5-8270-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>d2ff1a21-313a-11e5-802b-3c15c2e10482<commit_msg>d304c4de-313a-11e5-81a1-3c15c2e10482<commit_after>d304c4de-313a-11e5-81a1-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>84e585de-4b02-11e5-833f-28cfe9171a43<commit_msg>update testing<commit_after>84f29bf3-4b02-11e5-a751-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>8fd048f4-2d14-11e5-af21-0401358ea401<commit_msg>8fd048f5-2d14-11e5-af21-0401358ea401<commit_after>8fd048f5-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>f25cbc23-327f-11e5-bfcd-9cf387a8033e<commit_msg>f263539c-327f-11e5-8d0a-9cf387a8033e<commit_after>f263539c-327f-11e5-8d0a-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>87426205-2e4f-11e5-871b-28cfe91dbc4b<commit_msg>8749050c-2e4f-11e5-8421-28cfe91dbc4b<commit_after>8749050c-2e4f-11e5-8421-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>fc062523-2e4e-11e5-9383-28cfe91dbc4b<commit_msg>fc0c8ffd-2e4e-11e5-b5ce-28cfe91dbc4b<commit_after>fc0c8ffd-2e4e-11e5-b5ce-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#ifdef QT_QML_DEBUG\n#include <QtQuick>\n#endif\n\n#include <QQuickView>\n#include <QQmlContext>\n#include <sailfishapp.h>\n#include \"servercomm.h\"\n\nint main(int argc, char *argv[])\n{\n    QScopedPointer<QQuickView> view(SailfishApp::createView());\n    ServerComm sc;\n    view->rootContext()->setContextProperty(\"serverComm\", &sc);\n    view->setSource(SailfishApp::pathTo(\"main.qml\"));\n    view->show();\n}\n<commit_msg>More fixes to main.cpp<commit_after>#ifdef QT_QML_DEBUG\n#include <QtQuick>\n#endif\n\n#include <QGuiApplication>\n#include <QQuickView>\n#include <QQmlContext>\n#include <sailfishapp.h>\n#include \"servercomm.h\"\n\nint main(int argc, char *argv[])\n{\n    QScopedPointer<QGuiApplication> app(SailfishApp::application(argc, argv));\n    QScopedPointer<QQuickView> view(SailfishApp::createView());\n    ServerComm sc;\n    view->rootContext()->setContextProperty(\"serverComm\", &sc);\n    view->setSource(SailfishApp::pathTo(\"main.qml\"));\n    view->showFullScreen();\n    return app->exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>c30f7966-4b02-11e5-ba97-28cfe9171a43<commit_msg>Gapjgjchguagdmg<commit_after>c31a4182-4b02-11e5-bdc0-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>a482cc47-327f-11e5-bc10-9cf387a8033e<commit_msg>a488ae7d-327f-11e5-8a25-9cf387a8033e<commit_after>a488ae7d-327f-11e5-8a25-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>0d55cc17-2d3d-11e5-b520-c82a142b6f9b<commit_msg>0dc03a38-2d3d-11e5-bb0a-c82a142b6f9b<commit_after>0dc03a38-2d3d-11e5-bb0a-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>d2700f8c-585a-11e5-9d9e-6c40088e03e4<commit_msg>d2768f54-585a-11e5-9106-6c40088e03e4<commit_after>d2768f54-585a-11e5-9106-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>afe6f56e-327f-11e5-af00-9cf387a8033e<commit_msg>afef09e3-327f-11e5-a1e4-9cf387a8033e<commit_after>afef09e3-327f-11e5-a1e4-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>1ec99a47-2e4f-11e5-8254-28cfe91dbc4b<commit_msg>1ed120f3-2e4f-11e5-940b-28cfe91dbc4b<commit_after>1ed120f3-2e4f-11e5-940b-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>f3e420de-585a-11e5-b953-6c40088e03e4<commit_msg>f3ebef28-585a-11e5-8036-6c40088e03e4<commit_after>f3ebef28-585a-11e5-8036-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>297ab2f4-2f67-11e5-a16e-6c40088e03e4<commit_msg>2980ed0c-2f67-11e5-9571-6c40088e03e4<commit_after>2980ed0c-2f67-11e5-9571-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>9fffe135-327f-11e5-8f87-9cf387a8033e<commit_msg>a0059d6b-327f-11e5-bd1f-9cf387a8033e<commit_after>a0059d6b-327f-11e5-bd1f-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>e7d12af5-313a-11e5-99a0-3c15c2e10482<commit_msg>e7d76747-313a-11e5-a793-3c15c2e10482<commit_after>e7d76747-313a-11e5-a793-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>25bdb717-ad5c-11e7-8655-ac87a332f658<commit_msg>bug fix<commit_after>263e9585-ad5c-11e7-989d-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>e5f22cf8-313a-11e5-b98f-3c15c2e10482<commit_msg>e5f8e4ba-313a-11e5-95f6-3c15c2e10482<commit_after>e5f8e4ba-313a-11e5-95f6-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>#include <igl\/circulation.h>\n#include <igl\/collapse_edge.h>\n#include <igl\/edge_flaps.h>\n#include <igl\/read_triangle_mesh.h>\n#include <igl\/Viewer\/viewer.h>\n#include <Eigen\/Core>\n#include <iostream>\n#include <set>\n\nint main(int argc, char * argv[])\n{\n  using namespace std;\n  using namespace Eigen;\n  using namespace igl;\n  cout<<\"Usage: .\/progressive_hulls [filename.(off|obj|ply)]\"<<endl;\n  cout<<\"  [space]  toggle animation.\"<<endl;\n  cout<<\"  'r'  reset.\"<<endl;\n  \/\/ Load a closed manifold mesh\n  string filename(\"..\/shared\/fertility.off\");\n  if(argc>=2)\n  {\n    filename = argv[1];\n  }\n  MatrixXd V,OV;\n  MatrixXi F,OF;\n  read_triangle_mesh(filename,OV,OF);\n\n  igl::viewer::Viewer viewer;\n\n  \/\/ Prepare array-based edge data structures and priority queue\n  VectorXi EMAP;\n  MatrixXi E,EF,EI;\n  typedef std::set<std::pair<double,int> > PriorityQueue;\n  PriorityQueue Q;\n  std::vector<PriorityQueue::iterator > Qit;\n  \/\/ If an edge were collapsed, we'd collapse it to these points:\n  MatrixXd C;\n  int num_collapsed;\n\n  \/\/ Function for computing cost of collapsing edge (lenght) and placement\n  \/\/ (midpoint)\n  const auto & shortest_edge_and_midpoint = [](\n    const int e,\n    const Eigen::MatrixXd & V,\n    const Eigen::MatrixXi & \/*F*\/,\n    const Eigen::MatrixXi & E,\n    const Eigen::VectorXi & \/*EMAP*\/,\n    const Eigen::MatrixXi & \/*EF*\/,\n    const Eigen::MatrixXi & \/*EI*\/,\n    double & cost,\n    RowVectorXd & p)\n  {\n    cost = (V.row(E(e,0))-V.row(E(e,1))).norm();\n    p = 0.5*(V.row(E(e,0))+V.row(E(e,1)));\n  };\n\n\n  \/\/ Function to reset original mesh and data structures\n  const auto & reset = [&]()\n  {\n    F = OF;\n    V = OV;\n    edge_flaps(F,E,EMAP,EF,EI);\n    Qit.resize(E.rows());\n\n    C.resize(E.rows(),V.cols());\n    VectorXd costs(E.rows());\n    for(int e = 0;e<E.rows();e++)\n    {\n      double cost = e;\n      RowVectorXd p(1,3);\n      shortest_edge_and_midpoint(e,V,F,E,EMAP,EF,EI,cost,p);\n      C.row(e) = p;\n      Qit[e] = Q.insert(std::pair<double,int>(cost,e)).first;\n    }\n    num_collapsed = 0;\n    viewer.data.clear();\n    viewer.data.set_mesh(V,F);\n    viewer.data.set_face_based(true);\n  };\n\n  const auto &pre_draw = [&](igl::viewer::Viewer & viewer)->bool\n  {\n    \/\/ If animating then collapse 10% of edges\n    if(viewer.core.is_animating && !Q.empty())\n    {\n      bool something_collapsed = false;\n      \/\/ collapse edge \n      const int max_iter = std::ceil(0.01*Q.size());\n      for(int j = 0;j<max_iter;j++)\n      {\n        if(!collapse_edge(shortest_edge_and_midpoint,V,F,E,EMAP,EF,EI,Q,Qit,C))\n        {\n          break;\n        }\n        something_collapsed = true;\n        num_collapsed++;\n      }\n\n      if(something_collapsed)\n      {\n        viewer.data.clear();\n        viewer.data.set_mesh(V,F);\n        viewer.data.set_face_based(true);\n      }\n    }\n    return false;\n  };\n\n  const auto &key_down = \n    [&](igl::viewer::Viewer &viewer,unsigned char key,int mod)->bool\n  {\n    switch(key)\n    {\n      case ' ':\n        viewer.core.is_animating ^= 1;\n        break;\n      case 'R':\n      case 'r':\n        reset();\n        break;\n      default:\n        return false;\n    }\n    return true;\n  };\n\n  reset();\n  viewer.core.is_animating = true;\n  viewer.callback_key_down = key_down;\n  viewer.callback_pre_draw = pre_draw;\n  return viewer.launch();\n}\n<commit_msg>fixed wrong include in 701<commit_after>#include <igl\/circulation.h>\n#include <igl\/collapse_edge.h>\n#include <igl\/edge_flaps.h>\n#include <igl\/read_triangle_mesh.h>\n#include <igl\/viewer\/Viewer.h>\n#include <Eigen\/Core>\n#include <iostream>\n#include <set>\n\nint main(int argc, char * argv[])\n{\n  using namespace std;\n  using namespace Eigen;\n  using namespace igl;\n  cout<<\"Usage: .\/progressive_hulls [filename.(off|obj|ply)]\"<<endl;\n  cout<<\"  [space]  toggle animation.\"<<endl;\n  cout<<\"  'r'  reset.\"<<endl;\n  \/\/ Load a closed manifold mesh\n  string filename(\"..\/shared\/fertility.off\");\n  if(argc>=2)\n  {\n    filename = argv[1];\n  }\n  MatrixXd V,OV;\n  MatrixXi F,OF;\n  read_triangle_mesh(filename,OV,OF);\n\n  igl::viewer::Viewer viewer;\n\n  \/\/ Prepare array-based edge data structures and priority queue\n  VectorXi EMAP;\n  MatrixXi E,EF,EI;\n  typedef std::set<std::pair<double,int> > PriorityQueue;\n  PriorityQueue Q;\n  std::vector<PriorityQueue::iterator > Qit;\n  \/\/ If an edge were collapsed, we'd collapse it to these points:\n  MatrixXd C;\n  int num_collapsed;\n\n  \/\/ Function for computing cost of collapsing edge (lenght) and placement\n  \/\/ (midpoint)\n  const auto & shortest_edge_and_midpoint = [](\n    const int e,\n    const Eigen::MatrixXd & V,\n    const Eigen::MatrixXi & \/*F*\/,\n    const Eigen::MatrixXi & E,\n    const Eigen::VectorXi & \/*EMAP*\/,\n    const Eigen::MatrixXi & \/*EF*\/,\n    const Eigen::MatrixXi & \/*EI*\/,\n    double & cost,\n    RowVectorXd & p)\n  {\n    cost = (V.row(E(e,0))-V.row(E(e,1))).norm();\n    p = 0.5*(V.row(E(e,0))+V.row(E(e,1)));\n  };\n\n\n  \/\/ Function to reset original mesh and data structures\n  const auto & reset = [&]()\n  {\n    F = OF;\n    V = OV;\n    edge_flaps(F,E,EMAP,EF,EI);\n    Qit.resize(E.rows());\n\n    C.resize(E.rows(),V.cols());\n    VectorXd costs(E.rows());\n    for(int e = 0;e<E.rows();e++)\n    {\n      double cost = e;\n      RowVectorXd p(1,3);\n      shortest_edge_and_midpoint(e,V,F,E,EMAP,EF,EI,cost,p);\n      C.row(e) = p;\n      Qit[e] = Q.insert(std::pair<double,int>(cost,e)).first;\n    }\n    num_collapsed = 0;\n    viewer.data.clear();\n    viewer.data.set_mesh(V,F);\n    viewer.data.set_face_based(true);\n  };\n\n  const auto &pre_draw = [&](igl::viewer::Viewer & viewer)->bool\n  {\n    \/\/ If animating then collapse 10% of edges\n    if(viewer.core.is_animating && !Q.empty())\n    {\n      bool something_collapsed = false;\n      \/\/ collapse edge\n      const int max_iter = std::ceil(0.01*Q.size());\n      for(int j = 0;j<max_iter;j++)\n      {\n        if(!collapse_edge(shortest_edge_and_midpoint,V,F,E,EMAP,EF,EI,Q,Qit,C))\n        {\n          break;\n        }\n        something_collapsed = true;\n        num_collapsed++;\n      }\n\n      if(something_collapsed)\n      {\n        viewer.data.clear();\n        viewer.data.set_mesh(V,F);\n        viewer.data.set_face_based(true);\n      }\n    }\n    return false;\n  };\n\n  const auto &key_down =\n    [&](igl::viewer::Viewer &viewer,unsigned char key,int mod)->bool\n  {\n    switch(key)\n    {\n      case ' ':\n        viewer.core.is_animating ^= 1;\n        break;\n      case 'R':\n      case 'r':\n        reset();\n        break;\n      default:\n        return false;\n    }\n    return true;\n  };\n\n  reset();\n  viewer.core.is_animating = true;\n  viewer.callback_key_down = key_down;\n  viewer.callback_pre_draw = pre_draw;\n  return viewer.launch();\n}\n<|endoftext|>"}
{"text":"<commit_before>af508b0f-4b02-11e5-9ac4-28cfe9171a43<commit_msg>This'll fix that<commit_after>af5e1128-4b02-11e5-8d98-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>class CfgVehicles {\n\tclass Logic;\n\tclass Module_F: Logic {\n\t\tclass ArgumentsBaseUnits {\n\t\t\tclass Units;\n\t\t};\n\t\tclass ModuleDescription {\n\t\t\tclass AnyBrain;\n\t\t};\n\t};\n\n\tclass thingX;\n\n\tclass HEHU_MF_Module: Module_F\n\t{\n\t\tscope = 0;\n\t\tauthor = \"Magnus Bergmark\";\n\t\tcategory = \"HEHU_MF_Modules\";\n\t};\n\n\tclass HEHU_MF_ModuleCQBSpawner: HEHU_MF_Module\n\t{\n\t\tdisplayName = \"CQB Spawner\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\t\tfunction = \"HEHU_MF_fnc_moduleCQBSpawner\";\n\t\t\/\/ Execution priority, modules with lower number are executed first. 0 is used when the attribute is undefined\n\t\tfunctionPriority = 1;\n\n\t\t\/\/ 0 for server only execution, 1 for remote execution on all clients upon mission start, 2 for persistent execution\n\t\tisGlobal = 0;\n\n\t\tisTriggerActivated = 0;\n\t\tisDisposable = 1;\n\n\t\tclass Arguments\n\t\t{\n\t\t\t\/\/ Module specific arguments\n\t\t\tclass NumberOfUnits\n  \t\t\t{\n\t\t\t\tdisplayName = \"Number of units\";\n\t\t\t\tdescription = \"0 means choose from global config \/ script variable.\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tdefaultValue = \"0\";\n\t\t\t};\n\t\t\tclass UnitAlertness\n  \t\t\t{\n\t\t\t\tdisplayName = \"Unit alertness\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass UseDefault\t\t{name = \"Use global config\"; value = -1; default = 1;};\n\t\t\t\t\tclass StandStill\t\t{name = \"Stand still\"; value = 0;};\n\t\t\t\t\tclass RespondThreats\t{name = \"Respond to threats\"; value = 1;};\n\t\t\t\t\tclass SomePatrol\t\t{name = \"Some will patrol\"; value = 2;};\n\t\t\t\t\tclass MostPatrol\t\t{name = \"Most will patrol\"; value = 3;};\n\t\t\t\t\tclass AllPatrol\t\t\t{name = \"Everyone patrols\"; value = 4;};\n\t\t\t\t};\n\t\t\t};\n\t\t};\n\n\t\tclass ModuleDescription: ModuleDescription\n\t\t{\n\t\t\tdescription = \"Spawns units in random building positions.\";\n\t\t\tsync[] = {\"LocationArea_F\", \"LocationBase_F\"};\n\n\t\t\tclass LocationArea_F\n\t\t\t{\n\t\t\t\tdescription[] = { \/\/ Multi-line descriptions are supported\n\t\t\t\t\t\"CQB area, with independent unit combinations and positions.\",\n\t\t\t\t\t\"Positions will be of building positions of buildings inside the triggers.\"\n\t\t\t\t};\n\t\t\t\tposition = 0; \/\/ Position is taken into effect\n\t\t\t\tdirection = 0; \/\/ Direction is taken into effect\n\t\t\t\toptional = 0; \/\/ Synced entity is optional\n\t\t\t\tduplicate = 1; \/\/ Multiple entities of this type can be synced\n\t\t\t\tsync[] = {\"EmptyDetector\", \"AnyAI\"};\n\t\t\t};\n\n\t\t\tclass LocationBase_F\n\t\t\t{\n\t\t\t\tdescription[] = { \/\/ Multi-line descriptions are supported\n\t\t\t\t\t\"CQB area, with independent unit combinations and positions.\",\n\t\t\t\t\t\"Positions will be of random places in the triggers.\"\n\t\t\t\t};\n\t\t\t\tposition = 0; \/\/ Position is taken into effect\n\t\t\t\tdirection = 0; \/\/ Direction is taken into effect\n\t\t\t\toptional = 0; \/\/ Synced entity is optional\n\t\t\t\tduplicate = 1; \/\/ Multiple entities of this type can be synced\n\t\t\t\tsync[] = {\"EmptyDetector\", \"AnyAI\"};\n\t\t\t};\n\n\t\t\tclass EmptyDetector\n\t\t\t{\n\t\t\t\tdescription[] = {\n\t\t\t\t\t\"Trigger areas\",\n\t\t\t\t\t\"Buildings inside the areas will be candidates for unit placements.\"\n\t\t\t\t};\n\t\t\t\tposition = 1; \/\/ Position is taken into effect\n\t\t\t\tdirection = 1; \/\/ Direction is taken into effect\n\t\t\t\toptional = 0; \/\/ Synced entity is optional\n\t\t\t\tduplicate = 1; \/\/ Multiple entities of this type can be synced\n\t\t\t};\n\t\t};\n\t};\n\n\tclass HEHU_MF_ModuleTargetCounter: HEHU_MF_Module\n\t{\n\t\tdisplayName = \"Target counter\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\n\t\tfunction = \"HEHU_MF_fnc_moduleTargetCounter\";\n\t\t\/\/ Execution priority, modules with lower number are executed first. 0 is used when the attribute is undefined\n\t\tfunctionPriority = 100;\n\n\t\t\/\/ 0 for server only execution, 1 for remote execution on all clients upon mission start, 2 for persistent execution\n\t\tisGlobal = 2;\n\n\t\tisTriggerActivated = 0;\n\t\tisDisposable = 1;\n\n\t\tclass Arguments: ArgumentsBaseUnits\n\t\t{\n\t\t\tclass Units: Units {};\n\n\t\t\t\/\/ Module specific arguments\n\t\t\tclass Precision\n  \t\t\t{\n\t\t\t\tdisplayName = \"Precision\";\n\t\t\t\tdescription = \"How accurate the counter will be.\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass Exact\t\t{name = \"Exact (number of enemies)\"; value = 1; default = 1};\n\t\t\t\t\tclass Inexact\t{name = \"Inexact (few, many, etc.)\"; value = 2;};\n\t\t\t\t\tclass Unhelpful\t{name = \"Unhelpful (enemies left, no enemies left)\"; value = 3;};\n\t\t\t\t};\n\t\t\t};\n\t\t\tclass RefreshInterval\n  \t\t\t{\n\t\t\t\tdisplayName = \"Refresh interval\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass 100ms\t{name = \"100ms\"; value = 0.1;};\n\t\t\t\t\tclass 1s\t{name = \"1s\"; value = 1;};\n\t\t\t\t\tclass 2s\t{name = \"2s\"; value = 2; default = 1};\n\t\t\t\t\tclass 3s\t{name = \"3s\"; value = 3;};\n\t\t\t\t\tclass 4s\t{name = \"4s\"; value = 4;};\n\t\t\t\t\tclass 5s\t{name = \"5s\"; value = 5;};\n\t\t\t\t};\n\t\t\t};\n\t\t\tclass AutoHide\n  \t\t\t{\n\t\t\t\tdisplayName = \"Stop when no enemies left\";\n\t\t\t\tdescription = \"Should target counter disappear when no enemies are left?\";\n\t\t\t\ttypeName = \"BOOL\";\n\t\t\t\tdefaultValue = false;\n\t\t\t};\n\t\t};\n\n\t\tclass ModuleDescription: ModuleDescription\n\t\t{\n\t\t\tdescription = \"Shows number of enemies left to synchronized (or all) players.\";\n\t\t\tsync[] = {\"AnyPlayer\"};\n\t\t};\n\t};\n\n\tclass HEHU_MF_ModuleUnitLocator: HEHU_MF_Module\n\t{\n\t\tdisplayName = \"Unit locator\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\n\t\tfunction = \"HEHU_MF_fnc_moduleUnitLocator\";\n\t\t\/\/ Execution priority, modules with lower number are executed first. 0 is used when the attribute is undefined\n\t\tfunctionPriority = 100;\n\n\t\t\/\/ 0 for server only execution, 1 for remote execution on all clients upon mission start, 2 for persistent execution\n\t\tisGlobal = 2;\n\n\t\tisTriggerActivated = 1;\n\t\tisDisposable = 0;\n\n\t\tclass Arguments: ArgumentsBaseUnits\n\t\t{\n\t\t\tclass Units: Units {};\n\n\t\t\t\/\/ Module specific arguments\n\t\t\tclass Precision\n  \t\t\t{\n\t\t\t\tdisplayName = \"Precision\";\n\t\t\t\tdescription = \"How precise should the locator be.\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\t\/*\n\t\t\t\t\t\tNote that the value is the RADIUS of the circle; \"20m\" precision sounds\n\t\t\t\t\t\tlike 20m DIAMETER so value is half that of the description says.\n\t\t\t\t\t\t\"I know you precision within 20 meters\" sound like +- 10 meters, as the\n\t\t\t\t\t\tsearch span is 20 meters.\n\t\t\t\t\t*\/\n\t\t\t\t\tclass Exact          {name = \"Exact\"; value = 0;};\n\t\t\t\t\tclass Accurate       {name = \"Accurate (5m)\"; value = 2.5; default = 1};\n\t\t\t\t\tclass Inaccurate     {name = \"Inaccurate (20m)\"; value = 10;};\n\t\t\t\t\tclass VeryInaccurate {name = \"Very inaccurate (50m)\"; value = 25;};\n\t\t\t\t\tclass WayOff         {name = \"Way off (500m)\"; value = 250;};\n\t\t\t\t};\n\t\t\t};\n\t\t\tclass RefreshInterval\n  \t\t\t{\n\t\t\t\tdisplayName = \"Refresh interval\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass 250ms\t{name = \"250ms\"; value = 0.25;};\n\t\t\t\t\tclass 500ms\t{name = \"500ms\"; value = 0.5;};\n\t\t\t\t\tclass 1s\t{name = \"1s\"; value = 1;};\n\t\t\t\t\tclass 2s\t{name = \"2s\"; value = 2; default = 1};\n\t\t\t\t\tclass 3s\t{name = \"3s\"; value = 3;};\n\t\t\t\t\tclass 4s\t{name = \"4s\"; value = 4;};\n\t\t\t\t\tclass 5s\t{name = \"5s\"; value = 5;};\n\t\t\t\t};\n\t\t\t};\n\n\t\t\tclass NumberOfUnits\n  \t\t\t{\n\t\t\t\tdisplayName = \"Maximum units alive\";\n\t\t\t\tdescription = \"Only display after this amount of units are alive. (Counts all selected unit types; enter 0 for Always)\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tdefaultValue = 2;\n\t\t\t};\n\n\t\t\tclass LocatorType\n  \t\t\t{\n\t\t\t\tdisplayName = \"Type\";\n\t\t\t\tdescription = \"How should the enemies be located?\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass Markers {name = \"Markers\"; value = 1; default = 1};\n\t\t\t\t\t\/\/ TODO: Add more locator types\n\t\t\t\t};\n\t\t\t};\n\n\t\t\tclass LocateUnits\n  \t\t\t{\n\t\t\t\tdisplayName = \"Units to locate\";\n\t\t\t\tdescription = \"What kinds of units should be located?\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass NonPlayers {name = \"Non-players\"; value = 1;};\n\t\t\t\t\tclass Players    {name = \"Players\"; value = 2;};\n\t\t\t\t\tclass Enemies    {name = \"Enemies\"; value = 3; default = 1};\n\t\t\t\t\tclass Civilians  {name = \"Civilians\"; value = 4;};\n\t\t\t\t\tclass West       {name = \"BLUFOR\"; value = 5;};\n\t\t\t\t\tclass East       {name = \"OPFOR\"; value = 6;};\n\t\t\t\t\tclass Ind        {name = \"Idenpendent\"; value = 7;};\n\t\t\t\t\tclass Everyone   {name = \"Everyone\"; value = 8;};\n\t\t\t\t};\n\t\t\t};\n\t\t};\n\n\t\tclass ModuleDescription: ModuleDescription\n\t\t{\n\t\t\tdescription = \"Shows alive units to synchronized (or all) players.\";\n\t\t\tsync[] = {\"AnyPlayer\"};\n\t\t};\n\t};\n\n\tclass HEHU_MF_ModuleAutomaticEndGame: HEHU_MF_Module\n\t{\n\t\tdisplayName = \"Automatic end game\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\n\t\tfunction = \"HEHU_MF_fnc_moduleAutomaticEndGame\";\n\t\t\/\/ Execution priority, modules with lower number are executed first. 0 is used when the attribute is undefined\n\t\tfunctionPriority = 100;\n\n\t\t\/\/ 0 for server only execution, 1 for remote execution on all clients upon mission start, 2 for persistent execution\n\t\tisGlobal = 2;\n\n\t\tisTriggerActivated = 1;\n\t\tisDisposable = 1;\n\n\t\tclass ModuleDescription: ModuleDescription\n\t\t{\n\t\t\tdescription = \"Ends the mission when all enemies are dead (and optional triggers are activated).\";\n\t\t\tsync[] = {};\n\t\t};\n\t};\n\n\tclass HEHU_MF_ArsenalBox: thingX\n\t{\n\t\t\/\/ Don't inherit from a real ammo box to remove the vanilla inventory from them.\n\t\t\/\/ You can only interact with this box as a Virtual Arsenal object.\n\t\t\/\/\n\t\t\/\/ class thingX;\n\t\t\/\/   class ReammoBox_F;\n\t\t\/\/      class Box_NATO_Wps_F;\n\t\t\/\/\n\t\t\/\/ TODO: Make it possible to sling load this box, or make a variant that is.\n\n\t\tvehicleclass = \"Ammo\";  \/\/ ReammoBox_F\n\t\tanimated = 0;           \/\/ ReammoBox_F\n\t\taccuracy = 0.2;         \/\/ ReammoBox_F\n\t\ticon = \"iconCrateWpns\"; \/\/ Box_NATO_Wps_F\n\t\tmapsize = 1.81;         \/\/ Box_NATO_Wps_F\n\t\tmodel = \"\\A3\\weapons_F\\AmmoBoxes\\WpnsBox_F\"; \/\/ Box_NATO_Wps_F\n\n\t\tdisplayName = \"HEHU Ammo box\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\t\tclass Eventhandlers\n\t\t{\n\t\t\tinit = \"[\"\"AmmoboxInit\"\",[(_this select 0), true]] spawn BIS_fnc_arsenal;\";\n\t\t};\n\t};\n};\n<commit_msg>Fix Zero Divisor error<commit_after>class CfgVehicles {\n\tclass Logic;\n\tclass Module_F: Logic {\n\t\tclass ArgumentsBaseUnits {\n\t\t\tclass Units;\n\t\t};\n\t\tclass ModuleDescription {\n\t\t\tclass AnyBrain;\n\t\t};\n\t};\n\n\tclass thingX;\n\n\tclass HEHU_MF_Module: Module_F\n\t{\n\t\tscope = 0;\n\t\tauthor = \"Magnus Bergmark\";\n\t\tcategory = \"HEHU_MF_Modules\";\n\t};\n\n\tclass HEHU_MF_ModuleCQBSpawner: HEHU_MF_Module\n\t{\n\t\tdisplayName = \"CQB Spawner\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\t\tfunction = \"HEHU_MF_fnc_moduleCQBSpawner\";\n\t\t\/\/ Execution priority, modules with lower number are executed first. 0 is used when the attribute is undefined\n\t\tfunctionPriority = 1;\n\n\t\t\/\/ 0 for server only execution, 1 for remote execution on all clients upon mission start, 2 for persistent execution\n\t\tisGlobal = 0;\n\n\t\tisTriggerActivated = 0;\n\t\tisDisposable = 0;\n\n\t\tclass Arguments\n\t\t{\n\t\t\t\/\/ Module specific arguments\n\t\t\tclass NumberOfUnits\n  \t\t\t{\n\t\t\t\tdisplayName = \"Number of units\";\n\t\t\t\tdescription = \"0 means choose from global config \/ script variable.\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tdefaultValue = \"0\";\n\t\t\t};\n\t\t\tclass UnitAlertness\n  \t\t\t{\n\t\t\t\tdisplayName = \"Unit alertness\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass UseDefault\t\t{name = \"Use global config\"; value = -1; default = 1;};\n\t\t\t\t\tclass StandStill\t\t{name = \"Stand still\"; value = 0;};\n\t\t\t\t\tclass RespondThreats\t{name = \"Respond to threats\"; value = 1;};\n\t\t\t\t\tclass SomePatrol\t\t{name = \"Some will patrol\"; value = 2;};\n\t\t\t\t\tclass MostPatrol\t\t{name = \"Most will patrol\"; value = 3;};\n\t\t\t\t\tclass AllPatrol\t\t\t{name = \"Everyone patrols\"; value = 4;};\n\t\t\t\t};\n\t\t\t};\n\t\t};\n\n\t\tclass ModuleDescription: ModuleDescription\n\t\t{\n\t\t\tdescription = \"Spawns units in random building positions.\";\n\t\t\tsync[] = {\"LocationArea_F\", \"LocationBase_F\"};\n\n\t\t\tclass LocationArea_F\n\t\t\t{\n\t\t\t\tdescription[] = { \/\/ Multi-line descriptions are supported\n\t\t\t\t\t\"CQB area, with independent unit combinations and positions.\",\n\t\t\t\t\t\"Positions will be of building positions of buildings inside the triggers.\"\n\t\t\t\t};\n\t\t\t\tposition = 0; \/\/ Position is taken into effect\n\t\t\t\tdirection = 0; \/\/ Direction is taken into effect\n\t\t\t\toptional = 0; \/\/ Synced entity is optional\n\t\t\t\tduplicate = 1; \/\/ Multiple entities of this type can be synced\n\t\t\t\tsync[] = {\"EmptyDetector\", \"AnyAI\"};\n\t\t\t};\n\n\t\t\tclass LocationBase_F\n\t\t\t{\n\t\t\t\tdescription[] = { \/\/ Multi-line descriptions are supported\n\t\t\t\t\t\"CQB area, with independent unit combinations and positions.\",\n\t\t\t\t\t\"Positions will be of random places in the triggers.\"\n\t\t\t\t};\n\t\t\t\tposition = 0; \/\/ Position is taken into effect\n\t\t\t\tdirection = 0; \/\/ Direction is taken into effect\n\t\t\t\toptional = 0; \/\/ Synced entity is optional\n\t\t\t\tduplicate = 1; \/\/ Multiple entities of this type can be synced\n\t\t\t\tsync[] = {\"EmptyDetector\", \"AnyAI\"};\n\t\t\t};\n\n\t\t\tclass EmptyDetector\n\t\t\t{\n\t\t\t\tdescription[] = {\n\t\t\t\t\t\"Trigger areas\",\n\t\t\t\t\t\"Buildings inside the areas will be candidates for unit placements.\"\n\t\t\t\t};\n\t\t\t\tposition = 1; \/\/ Position is taken into effect\n\t\t\t\tdirection = 1; \/\/ Direction is taken into effect\n\t\t\t\toptional = 0; \/\/ Synced entity is optional\n\t\t\t\tduplicate = 1; \/\/ Multiple entities of this type can be synced\n\t\t\t};\n\t\t};\n\t};\n\n\tclass HEHU_MF_ModuleTargetCounter: HEHU_MF_Module\n\t{\n\t\tdisplayName = \"Target counter\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\n\t\tfunction = \"HEHU_MF_fnc_moduleTargetCounter\";\n\t\t\/\/ Execution priority, modules with lower number are executed first. 0 is used when the attribute is undefined\n\t\tfunctionPriority = 100;\n\n\t\t\/\/ 0 for server only execution, 1 for remote execution on all clients upon mission start, 2 for persistent execution\n\t\tisGlobal = 2;\n\n\t\tisTriggerActivated = 0;\n\t\tisDisposable = 0;\n\n\t\tclass Arguments: ArgumentsBaseUnits\n\t\t{\n\t\t\tclass Units: Units {};\n\n\t\t\t\/\/ Module specific arguments\n\t\t\tclass Precision\n  \t\t\t{\n\t\t\t\tdisplayName = \"Precision\";\n\t\t\t\tdescription = \"How accurate the counter will be.\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass Exact\t\t{name = \"Exact (number of enemies)\"; value = 1; default = 1};\n\t\t\t\t\tclass Inexact\t{name = \"Inexact (few, many, etc.)\"; value = 2;};\n\t\t\t\t\tclass Unhelpful\t{name = \"Unhelpful (enemies left, no enemies left)\"; value = 3;};\n\t\t\t\t};\n\t\t\t};\n\t\t\tclass RefreshInterval\n  \t\t\t{\n\t\t\t\tdisplayName = \"Refresh interval\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass 100ms\t{name = \"100ms\"; value = 0.1;};\n\t\t\t\t\tclass 1s\t{name = \"1s\"; value = 1;};\n\t\t\t\t\tclass 2s\t{name = \"2s\"; value = 2; default = 1};\n\t\t\t\t\tclass 3s\t{name = \"3s\"; value = 3;};\n\t\t\t\t\tclass 4s\t{name = \"4s\"; value = 4;};\n\t\t\t\t\tclass 5s\t{name = \"5s\"; value = 5;};\n\t\t\t\t};\n\t\t\t};\n\t\t\tclass AutoHide\n  \t\t\t{\n\t\t\t\tdisplayName = \"Stop when no enemies left\";\n\t\t\t\tdescription = \"Should target counter disappear when no enemies are left?\";\n\t\t\t\ttypeName = \"BOOL\";\n\t\t\t\tdefaultValue = false;\n\t\t\t};\n\t\t};\n\n\t\tclass ModuleDescription: ModuleDescription\n\t\t{\n\t\t\tdescription = \"Shows number of enemies left to synchronized (or all) players.\";\n\t\t\tsync[] = {\"AnyPlayer\"};\n\t\t};\n\t};\n\n\tclass HEHU_MF_ModuleUnitLocator: HEHU_MF_Module\n\t{\n\t\tdisplayName = \"Unit locator\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\n\t\tfunction = \"HEHU_MF_fnc_moduleUnitLocator\";\n\t\t\/\/ Execution priority, modules with lower number are executed first. 0 is used when the attribute is undefined\n\t\tfunctionPriority = 100;\n\n\t\t\/\/ 0 for server only execution, 1 for remote execution on all clients upon mission start, 2 for persistent execution\n\t\tisGlobal = 2;\n\n\t\tisTriggerActivated = 1;\n\t\tisDisposable = 0;\n\n\t\tclass Arguments: ArgumentsBaseUnits\n\t\t{\n\t\t\tclass Units: Units {};\n\n\t\t\t\/\/ Module specific arguments\n\t\t\tclass Precision\n  \t\t\t{\n\t\t\t\tdisplayName = \"Precision\";\n\t\t\t\tdescription = \"How precise should the locator be.\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\t\/*\n\t\t\t\t\t\tNote that the value is the RADIUS of the circle; \"20m\" precision sounds\n\t\t\t\t\t\tlike 20m DIAMETER so value is half that of the description says.\n\t\t\t\t\t\t\"I know you precision within 20 meters\" sound like +- 10 meters, as the\n\t\t\t\t\t\tsearch span is 20 meters.\n\t\t\t\t\t*\/\n\t\t\t\t\tclass Exact          {name = \"Exact\"; value = 0;};\n\t\t\t\t\tclass Accurate       {name = \"Accurate (5m)\"; value = 2.5; default = 1};\n\t\t\t\t\tclass Inaccurate     {name = \"Inaccurate (20m)\"; value = 10;};\n\t\t\t\t\tclass VeryInaccurate {name = \"Very inaccurate (50m)\"; value = 25;};\n\t\t\t\t\tclass WayOff         {name = \"Way off (500m)\"; value = 250;};\n\t\t\t\t};\n\t\t\t};\n\t\t\tclass RefreshInterval\n  \t\t\t{\n\t\t\t\tdisplayName = \"Refresh interval\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass 250ms\t{name = \"250ms\"; value = 0.25;};\n\t\t\t\t\tclass 500ms\t{name = \"500ms\"; value = 0.5;};\n\t\t\t\t\tclass 1s\t{name = \"1s\"; value = 1;};\n\t\t\t\t\tclass 2s\t{name = \"2s\"; value = 2; default = 1};\n\t\t\t\t\tclass 3s\t{name = \"3s\"; value = 3;};\n\t\t\t\t\tclass 4s\t{name = \"4s\"; value = 4;};\n\t\t\t\t\tclass 5s\t{name = \"5s\"; value = 5;};\n\t\t\t\t};\n\t\t\t};\n\n\t\t\tclass NumberOfUnits\n  \t\t\t{\n\t\t\t\tdisplayName = \"Maximum units alive\";\n\t\t\t\tdescription = \"Only display after this amount of units are alive. (Counts all selected unit types; enter 0 for Always)\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tdefaultValue = 2;\n\t\t\t};\n\n\t\t\tclass LocatorType\n  \t\t\t{\n\t\t\t\tdisplayName = \"Type\";\n\t\t\t\tdescription = \"How should the enemies be located?\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass Markers {name = \"Markers\"; value = 1; default = 1};\n\t\t\t\t\t\/\/ TODO: Add more locator types\n\t\t\t\t};\n\t\t\t};\n\n\t\t\tclass LocateUnits\n  \t\t\t{\n\t\t\t\tdisplayName = \"Units to locate\";\n\t\t\t\tdescription = \"What kinds of units should be located?\";\n\t\t\t\ttypeName = \"NUMBER\";\n\t\t\t\tclass values\n\t\t\t\t{\n\t\t\t\t\tclass NonPlayers {name = \"Non-players\"; value = 1;};\n\t\t\t\t\tclass Players    {name = \"Players\"; value = 2;};\n\t\t\t\t\tclass Enemies    {name = \"Enemies\"; value = 3; default = 1};\n\t\t\t\t\tclass Civilians  {name = \"Civilians\"; value = 4;};\n\t\t\t\t\tclass West       {name = \"BLUFOR\"; value = 5;};\n\t\t\t\t\tclass East       {name = \"OPFOR\"; value = 6;};\n\t\t\t\t\tclass Ind        {name = \"Idenpendent\"; value = 7;};\n\t\t\t\t\tclass Everyone   {name = \"Everyone\"; value = 8;};\n\t\t\t\t};\n\t\t\t};\n\t\t};\n\n\t\tclass ModuleDescription: ModuleDescription\n\t\t{\n\t\t\tdescription = \"Shows alive units to synchronized (or all) players.\";\n\t\t\tsync[] = {\"AnyPlayer\"};\n\t\t};\n\t};\n\n\tclass HEHU_MF_ModuleAutomaticEndGame: HEHU_MF_Module\n\t{\n\t\tdisplayName = \"Automatic end game\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\n\t\tfunction = \"HEHU_MF_fnc_moduleAutomaticEndGame\";\n\t\t\/\/ Execution priority, modules with lower number are executed first. 0 is used when the attribute is undefined\n\t\tfunctionPriority = 100;\n\n\t\t\/\/ 0 for server only execution, 1 for remote execution on all clients upon mission start, 2 for persistent execution\n\t\tisGlobal = 2;\n\n\t\tisTriggerActivated = 1;\n\t\tisDisposable = 0;\n\n\t\tclass ModuleDescription: ModuleDescription\n\t\t{\n\t\t\tdescription = \"Ends the mission when all enemies are dead (and optional triggers are activated).\";\n\t\t\tsync[] = {};\n\t\t};\n\t};\n\n\tclass HEHU_MF_ArsenalBox: thingX\n\t{\n\t\t\/\/ Don't inherit from a real ammo box to remove the vanilla inventory from them.\n\t\t\/\/ You can only interact with this box as a Virtual Arsenal object.\n\t\t\/\/\n\t\t\/\/ class thingX;\n\t\t\/\/   class ReammoBox_F;\n\t\t\/\/      class Box_NATO_Wps_F;\n\t\t\/\/\n\t\t\/\/ TODO: Make it possible to sling load this box, or make a variant that is.\n\n\t\tvehicleclass = \"Ammo\";  \/\/ ReammoBox_F\n\t\tanimated = 0;           \/\/ ReammoBox_F\n\t\taccuracy = 0.2;         \/\/ ReammoBox_F\n\t\ticon = \"iconCrateWpns\"; \/\/ Box_NATO_Wps_F\n\t\tmapsize = 1.81;         \/\/ Box_NATO_Wps_F\n\t\tmodel = \"\\A3\\weapons_F\\AmmoBoxes\\WpnsBox_F\"; \/\/ Box_NATO_Wps_F\n\n\t\tdisplayName = \"HEHU Ammo box\";\n\t\tauthor = \"Magnus Bergmark\";\n\t\tscope = 2;\n\t\tclass Eventhandlers\n\t\t{\n\t\t\tinit = \"[\"\"AmmoboxInit\"\",[(_this select 0), true]] spawn BIS_fnc_arsenal;\";\n\t\t};\n\t};\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * DelayTestProbe.cpp\n *\n *  Created on: October 1, 2013\n *      Author: wchavez\n *\/\n\n#include \"DelayTestProbe.hpp\"\n#include <include\/pv_arch.h> \n#include <layers\/HyPerLayer.hpp>\n#include <string.h>\n#include <assert.h>\n\nnamespace PV {\n\nDelayTestProbe::DelayTestProbe(const char * filename, HyPerLayer * layer, const char * msg)\n: StatsProbe(filename, layer, msg)\n{\n}\n\nDelayTestProbe::DelayTestProbe(HyPerLayer * layer, const char * msg)\n: StatsProbe(layer, msg)\n{\n}\n\nDelayTestProbe::~DelayTestProbe() {}\n\n\nint DelayTestProbe::outputState(double timed)\n{\n\tint status = StatsProbe::outputState(timed);\n#ifdef PV_USE_MPI\n   InterColComm * icComm = getTargetLayer()->getParent()->icCommunicator();\n   const int rcvProc = 0;\n   if( icComm->commRank() != rcvProc ) {\n      return 0;\n   }\n#endif \/\/ PV_USE_MPI\n   const PVLayerLoc * loc = getTargetLayer()->getLayerLoc();\n   const int rows = getTargetLayer()->getParent()->icCommunicator()->numCommRows();\n   const int cols = getTargetLayer()->getParent()->icCommunicator()->numCommColumns();\n\n      int nx = loc->nx;\n      int ny = loc->ny;\n      int nf = loc->nf;\n\n      assert((avg == timed\/nf)&&(avg == double(nnz)\/((nx*rows)*(ny*cols)*nf)));\n\n      return status;\n}\n\n\n} \/* namespace PV *\/\n<commit_msg>Changed assertions to match Movie layer update. (Line 52: timed-1 instead of timed)<commit_after>\/*\n * DelayTestProbe.cpp\n *\n *  Created on: October 1, 2013\n *      Author: wchavez\n *\/\n\n#include \"DelayTestProbe.hpp\"\n#include <include\/pv_arch.h> \n#include <layers\/HyPerLayer.hpp>\n#include <string.h>\n#include <assert.h>\n\nnamespace PV {\n\nDelayTestProbe::DelayTestProbe(const char * filename, HyPerLayer * layer, const char * msg)\n: StatsProbe(filename, layer, msg)\n{\n}\n\nDelayTestProbe::DelayTestProbe(HyPerLayer * layer, const char * msg)\n: StatsProbe(layer, msg)\n{\n}\n\nDelayTestProbe::~DelayTestProbe() {}\n\n\nint DelayTestProbe::outputState(double timed)\n{\n\tint status = StatsProbe::outputState(timed);\n#ifdef PV_USE_MPI\n   InterColComm * icComm = getTargetLayer()->getParent()->icCommunicator();\n   const int rcvProc = 0;\n   if( icComm->commRank() != rcvProc ) {\n      return 0;\n   }\n#endif \/\/ PV_USE_MPI\n   const PVLayerLoc * loc = getTargetLayer()->getLayerLoc();\n   const int rows = getTargetLayer()->getParent()->icCommunicator()->numCommRows();\n   const int cols = getTargetLayer()->getParent()->icCommunicator()->numCommColumns();\n\n      int nx = loc->nx;\n      int ny = loc->ny;\n      int nf = loc->nf;\n    \n    if (timed==0) {\n        assert((avg == (timed)\/nf)&&(avg == double(nnz)\/((nx*rows)*(ny*cols)*nf)));\n    }\n    \n    else {\n        assert((avg == (timed-1)\/nf)&&(avg == double(nnz)\/((nx*rows)*(ny*cols)*nf)));\n    }\n      return status;\n}\n\n\n} \/* namespace PV *\/\n<|endoftext|>"}
{"text":"<commit_before>b58b641e-2e4f-11e5-9413-28cfe91dbc4b<commit_msg>b5aacade-2e4f-11e5-a57a-28cfe91dbc4b<commit_after>b5aacade-2e4f-11e5-a57a-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>12c2367e-2f67-11e5-ac48-6c40088e03e4<commit_msg>12c94e58-2f67-11e5-8360-6c40088e03e4<commit_after>12c94e58-2f67-11e5-8360-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>f36184f0-2d3d-11e5-9055-c82a142b6f9b<commit_msg>f3c62c99-2d3d-11e5-a5b4-c82a142b6f9b<commit_after>f3c62c99-2d3d-11e5-a5b4-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>db614cc2-327f-11e5-bfda-9cf387a8033e<commit_msg>db6b0821-327f-11e5-88ea-9cf387a8033e<commit_after>db6b0821-327f-11e5-88ea-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>c3dabcfa-4b02-11e5-b1b2-28cfe9171a43<commit_msg>I'm done<commit_after>c3e7979c-4b02-11e5-9645-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>715f6c7a-2d3e-11e5-b834-c82a142b6f9b<commit_msg>71b23fe1-2d3e-11e5-883a-c82a142b6f9b<commit_after>71b23fe1-2d3e-11e5-883a-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>ee3a8066-2e4e-11e5-924a-28cfe91dbc4b<commit_msg>ee441f4a-2e4e-11e5-b69c-28cfe91dbc4b<commit_after>ee441f4a-2e4e-11e5-b69c-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>c8dcb7ba-2e4e-11e5-95d4-28cfe91dbc4b<commit_msg>c8e3d9a1-2e4e-11e5-9c2b-28cfe91dbc4b<commit_after>c8e3d9a1-2e4e-11e5-9c2b-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>5e287535-2e4f-11e5-a9f7-28cfe91dbc4b<commit_msg>5e2f5626-2e4f-11e5-b762-28cfe91dbc4b<commit_after>5e2f5626-2e4f-11e5-b762-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>8a037fde-2e4f-11e5-a306-28cfe91dbc4b<commit_msg>8a0a579e-2e4f-11e5-95a3-28cfe91dbc4b<commit_after>8a0a579e-2e4f-11e5-95a3-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>64591fe4-2fa5-11e5-97c4-00012e3d3f12<commit_msg>645b1bb6-2fa5-11e5-91c1-00012e3d3f12<commit_after>645b1bb6-2fa5-11e5-91c1-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>72b72521-ad5c-11e7-9a12-ac87a332f658<commit_msg>Fixed that one bug<commit_after>732dd6c2-ad5c-11e7-b662-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>f811769e-2e4e-11e5-a0f6-28cfe91dbc4b<commit_msg>f8182980-2e4e-11e5-b0ec-28cfe91dbc4b<commit_after>f8182980-2e4e-11e5-b0ec-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>a69342a3-4b02-11e5-9c0c-28cfe9171a43<commit_msg>No longer crashes if X<commit_after>a6a372f8-4b02-11e5-98d1-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>c7d2e9cc-2e4e-11e5-92d1-28cfe91dbc4b<commit_msg>c7d9c328-2e4e-11e5-bc79-28cfe91dbc4b<commit_after>c7d9c328-2e4e-11e5-bc79-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>7901d50a-2749-11e6-8a83-e0f84713e7b8<commit_msg>add file<commit_after>7910a833-2749-11e6-8d31-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>5ae7ecad-2d16-11e5-af21-0401358ea401<commit_msg>5ae7ecae-2d16-11e5-af21-0401358ea401<commit_after>5ae7ecae-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>753f811c-2749-11e6-86fe-e0f84713e7b8<commit_msg>my cat is cute<commit_after>754fc4fa-2749-11e6-be65-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>eba97c33-313a-11e5-b97c-3c15c2e10482<commit_msg>ebaf7b97-313a-11e5-bb24-3c15c2e10482<commit_after>ebaf7b97-313a-11e5-bb24-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>67b172a4-2fa5-11e5-83a0-00012e3d3f12<commit_msg>67b36e76-2fa5-11e5-9551-00012e3d3f12<commit_after>67b36e76-2fa5-11e5-9551-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>1885c130-2e4f-11e5-8f52-28cfe91dbc4b<commit_msg>188c7c14-2e4f-11e5-a605-28cfe91dbc4b<commit_after>188c7c14-2e4f-11e5-a605-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>e74898f8-327f-11e5-80c2-9cf387a8033e<commit_msg>e74e633a-327f-11e5-b866-9cf387a8033e<commit_after>e74e633a-327f-11e5-b866-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>de212f42-327f-11e5-a926-9cf387a8033e<commit_msg>de2706eb-327f-11e5-ab67-9cf387a8033e<commit_after>de2706eb-327f-11e5-ab67-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>941b37ee-327f-11e5-9175-9cf387a8033e<commit_msg>94216435-327f-11e5-b9d1-9cf387a8033e<commit_after>94216435-327f-11e5-b9d1-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>21db216e-2f67-11e5-99ae-6c40088e03e4<commit_msg>21e1d748-2f67-11e5-84e2-6c40088e03e4<commit_after>21e1d748-2f67-11e5-84e2-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>ec7dbb3a-327f-11e5-abf7-9cf387a8033e<commit_msg>ec848aab-327f-11e5-8c95-9cf387a8033e<commit_after>ec848aab-327f-11e5-8c95-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>a307bfca-327f-11e5-b0a9-9cf387a8033e<commit_msg>a30de6fd-327f-11e5-8a0a-9cf387a8033e<commit_after>a30de6fd-327f-11e5-8a0a-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\n * jacobian_cpp.cpp\n *\n * Copyright (c) 2017, ISCI \/ National Chiao Tung University (NCTU)\n *\n * Author: Howard Chen (s880367@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#include <iostream>\n#include <eigen3\/Eigen\/Dense>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cmath>\n#include <math.h>\n#include <vector>\n#include \"tm_kinematics\/include\/tm_kinematics\/tm_kin.h\"\n#include <unistd.h>\n#include <sys\/time.h>\n\n\n#define D1 0.1451\n#define D2 0\n#define D3 0\n#define D4 -0.1222\n#define D5 0.106\n#define D6 0.1144\n\n#define A1 0\n#define A2 0.329\n#define A3 0.3115\n#define A4 0\n#define A5 0\n#define A6 0\n\n\n#define ALPHA1 -90\n#define ALPHA2 0\n#define ALPHA3 0 \n#define ALPHA4 90\n#define ALPHA5 90\n#define ALPHA6 0\n\n#define PI 3.141592654\n#define DEG2RAD 0.01745329252\n#define RAD2DEG 57.29577951\n\nusing namespace std;\n\nvoid help()\n{\n    printf(\"\\n\");\n\tprintf(\"* PLease enter the argument in the following format : \\n\");\n\tprintf(\"* option : IJ = inverse jacobian\\n\");\n\tprintf(\"*          IK = inverse kinematics\\n\");\n\tprintf(\"*          FJ = forward jacobian\\n\");\n\tprintf(\"*          FK = forward kinematics\\n\");\n\tprintf(\"*          FJG = forward jacobian with gripper\\n\");\n\tprintf(\"*          FKG = forward kinematics with gripper\\n\");\n\tprintf(\"* IJ: .\/tm_jacobian IJ q1 q2 q3 q4 q5 q6 x' y' z' a' b' c' \\n\");\n\tprintf(\"* IK: .\/tm_jacobian IK x y z a b c\\n\");\n\tprintf(\"* FJ: .\/tm_jacobian FJ q1 q2 q3 q4 q5 q6 qd1 qd2 qd3 qd4 qd5 qd6 \\n\");\n\tprintf(\"* FK: .\/tm_jacobian FK q1 q2 q3 q4 q5 q6 \\n\");\n\tprintf(\"* Input  dim: joint(radius), cartesian(m)\\n\");\n\tprintf(\"* Output dim: joint(radius), cartesian(m)\\n\");\n\tprintf(\"\\n\");\n}\n\n\nint main(int argc, char const *argv[])\n{\n\tdouble *q_inv, *q_forward, *T;\n\n\tq_inv = new double[48];\n\tq_forward = new double[6];\n\tT = new double[16]; \n\n\tEigen::Matrix<float, 6, 1> jointspd = Eigen::Matrix<float, 6, 1>::Zero();\n\tEigen::Matrix<float, 6, 1> effspd = Eigen::Matrix<float, 6, 1>::Zero();\n\tEigen::Matrix<float, 6, 1> q_AfterHomeOffset, q_BeforeHomeOffset;\n\tEigen::Matrix<float, 6, 1> home;\n\n\n\thome << 0, -PI*0.5, 0, PI*0.5, 0, 0;\n\/*\n\tdouble *q_test = new double [2];\n\tq_test[0] = 45*DEG2RAD;\n\tq_test[1] = 45*DEG2RAD;\n\n\ttm_jacobian::Forward_Kinematics_3(q_test, T);\n\tcout << \">>>> forward T\" << endl;\n\ttm_jacobian::printMatrix(T,4,16);\n\n\tdelete [] q_test;\t\n*\/\n\n\tif(strncmp(argv[1],\"--help\",6) == 0)\n\t{\n\t\thelp();\n\t\treturn 0;\n\t}\n\n\n\tq_BeforeHomeOffset << \tstrtod(argv[2],NULL),\n\t\t\t\t\t\t\tstrtod(argv[3],NULL),\n\t\t\t\t\t\t\tstrtod(argv[4],NULL),\n\t\t\t\t\t\t\tstrtod(argv[5],NULL),\n\t\t\t\t\t\t\tstrtod(argv[6],NULL),\n\t\t\t\t\t\t\tstrtod(argv[7],NULL);\n\n\tq_AfterHomeOffset = q_BeforeHomeOffset + home;\n\t\n\n\tif(strncmp(argv[1],\"IJ\",2) == 0) \/\/ inverse jacobian \n\t{\n\t\teffspd << \t\t\tstrtod(argv[8],NULL),\n\t\t\t\t\t\t\tstrtod(argv[9],NULL),\n\t\t\t\t\t\t\tstrtod(argv[10],NULL),\n\t\t\t\t\t\t\tstrtod(argv[11],NULL),\n\t\t\t\t\t\t\tstrtod(argv[12],NULL),\n\t\t\t\t\t\t\tstrtod(argv[13],NULL);\n\n\t\tEigen::Matrix<float, 6, 6> Inverse_Jacobian = tm_jacobian::Inverse_Jacobian(q_AfterHomeOffset);\n\t\tjointspd = Inverse_Jacobian*effspd;\n\t\tcout << \">>>> Inverse jacobian\" << endl;\n\t\ttm_jacobian::printMatrix(Inverse_Jacobian);\n\n\t\tcout << \">>>> joint speed\" << endl;\n\t\ttm_jacobian::printMatrix(jointspd);\n\t}\n\telse if(strncmp(argv[1],\"IK\",2) == 0)    \/\/ inverse kinematics \n\t{\n\t\tEigen::Matrix<float, 6, 1>CartesianPosition = q_BeforeHomeOffset;\n\t\tEigen::Matrix<float, 4, 4> T_;\n\t    Eigen::AngleAxisf rollAngle (CartesianPosition(3), Eigen::Vector3f::UnitZ());\n\t    Eigen::AngleAxisf yawAngle  (CartesianPosition(4), Eigen::Vector3f::UnitY());\n\t    Eigen::AngleAxisf pitchAngle(CartesianPosition(5), Eigen::Vector3f::UnitX());\n\t    Eigen::Quaternion<float> quaternion_matrix = rollAngle * yawAngle * pitchAngle;\n\t    Eigen::Matrix<float,3,3> RotationMatrix    = quaternion_matrix.matrix();\n\t    int num_sol;\n\t    \n\t    T_ <<   0., 0., 0., CartesianPosition(0),\n\t            0., 0., 0., CartesianPosition(1),\n\t            0., 0., 0., CartesianPosition(2),\n\t            0., 0., 0., 1.;\n\t    T_.block<3,3>(0,0) = RotationMatrix.block<3,3>(0,0);\n\n\t    if(strncmp(argv[1],\"IKG\",3) == 0)\n\t    {\n\t\t    Eigen::Matrix<float,4,4> T67, T06;\n\t\t\tT67 <<  1, 0, 0, 0,\n\t\t\t\t\t0, 1, 0, 0,\n\t\t\t\t\t0, 0, 1, 0.235,\n\t\t\t\t\t0, 0, 0, 1;\n\n\t\t\tT06 = T_*T67.inverse();\n\t\t    tm_jacobian::Matrix2DoubleArray(T06,T);\n\t\t   \tnum_sol =  tm_kinematics::inverse(T, q_inv);\n\t\t   \tcout << \">>>> T07 \" << endl;\n\t    \ttm_jacobian::printMatrix(T_);\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttm_jacobian::Matrix2DoubleArray(T_,T);\n\t\t\tnum_sol =  tm_kinematics::inverse(T, q_inv);\n\t\t}\n\t   \t\n\t    cout << \">>>> T06 \" << endl;\n\t    tm_jacobian::printMatrix(T,4,16);\n\t    cout << \">>>> inverse q number of sols T06 : \" << num_sol << endl;\n\t\ttm_jacobian::printMatrix(q_inv, 6, 6*(num_sol));\n\t}\n\telse if(strncmp(argv[1],\"FJ\",2) == 0)    \/\/ forward jacobian \n\t{\n\t\tif(strncmp(argv[1],\"FJG\",3) == 0)\n\t\t{\n\t\t\tEigen::Matrix<double, 6, 1> JointVelocity    = Eigen::Matrix<double, 6, 1>::Zero();\n\t\t\tEigen::Matrix<double, 6, 1> EFFVelocity      = Eigen::Matrix<double, 6, 1>::Zero();\n\t\t\tEigen::Matrix<double, 6, 6> Jacobian_gripper = tm_jacobian::Forward_Jacobian_gripper(q_AfterHomeOffset);\n\t\t\tJointVelocity << \tstrtod(argv[8],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[9],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[10],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[11],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[12],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[13],NULL);\n\t\t\tEFFVelocity = Jacobian_gripper*JointVelocity;\n\n\t\t\tcout << \">>>> jacobian\" << endl;\n\t\t\ttm_jacobian::printMatrixd(Jacobian_gripper);\n\t\t\tcout << \">>>> effspd speed\" << endl;\n\t\t\ttm_jacobian::printMatrixd(EFFVelocity);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tjointspd << \t\tstrtod(argv[8],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[9],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[10],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[11],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[12],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[13],NULL);\n\n\t\t\tEigen::Matrix<float, 6, 6> Jacobian = tm_jacobian::Forward_Jacobian(q_AfterHomeOffset);\n\t\t\teffspd = Jacobian*jointspd;\n\t\t\tcout << \">>>> jacobian\" << endl;\n\t\t\ttm_jacobian::printMatrix(Jacobian);\n\n\t\t\tcout << \">>>> effspd speed\" << endl;\n\t\t\ttm_jacobian::printMatrix(effspd);\n\t\t}\n\t}\n\telse if(strncmp(argv[1],\"FK\",2) == 0)    \/\/ forward kinematics \n\t{\n\t\tif(strncmp(argv[1],\"FKG\",3) == 0)\n\t\t{\n\t\t\tEigen::Matrix<double,4,4> T07, T67, T06;\n\t\t\tT67 <<  1, 0, 0, 0,\n\t\t\t\t\t0, 1, 0, 0,\n\t\t\t\t\t0, 0, 1, 0.235,\n\t\t\t\t\t0, 0, 0, 1;\n\n\t\t\ttm_jacobian::Matrix2DoubleArray(q_BeforeHomeOffset, q_forward);\n\t\t\ttm_jacobian::Forward_Kinematics_gripper(q_forward,T);\t\n\n\t\t\tfor (int i = 0; i < 4; ++i)\n\t\t\t\tfor (int j = 0; j < 4; ++j)\n\t\t\t\t\tT07(i,j) = T[4*i+j];\n\n\t\t\tT06 = T07*T67.inverse();\n\n\t\t\tfor (int i = 0; i < 4; ++i)\n\t\t\t\tfor (int j = 0; j < 4; ++j)\n\t\t\t\t\tT[4*i+j] = T06(i,j);\n\n\t\t\tint num_sol = tm_kinematics::inverse(T, q_inv, q_forward);\n\n\t\t\tcout << \">>>> T07 \" << endl;\n\t    \ttm_jacobian::printMatrixd(T07);\n\t    \tcout << \">>>> T06 \" << endl;\n\t    \ttm_jacobian::printMatrixd(T06);\n\t\t\tcout << \">>>> inverse q number of sols for T06 : \" << num_sol << endl;\n\t\t\ttm_jacobian::printMatrix(q_inv, 6, 6*(num_sol));\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttm_jacobian::Matrix2DoubleArray(q_BeforeHomeOffset, q_forward);\n\t\t\ttm_kinematics::forward(q_forward, T);\n\t\t\tint num_sol = tm_kinematics::inverse(T, q_inv, q_forward);\n\n\t\t\tcout << \">>>> T06\" << endl;\n\t\t\ttm_jacobian::printMatrix(T,4,16);\t\n\t\t\tcout << \">>>> inverse q number of sols : \" << num_sol << endl;\n\t\t\ttm_jacobian::printMatrix(q_inv, 6, 6*(num_sol));\n\t\t}\n\t}\n\telse if(strncmp(argv[1],\"TT\",2) == 0)\n\t{\n\t\tdouble *q_test = new double [3];\n\t\tq_test[0] = 0;\n\t\tq_test[1] = 0;\n\t\tq_test[2] = 0;\n\n\t\ttm_jacobian::Forward_Kinematics_3(q_test, T);\n\t\tcout << \">>>> forward T\" << endl;\n\t\ttm_jacobian::printMatrix(T,4,16);\n\t\t\n\t\tdelete [] q_test;\n\n\t}\n\n\tdelete [] T;\n\tdelete [] q_inv;\n\tdelete [] q_forward;\n\treturn 0;\n}\n<commit_msg>change IK input format<commit_after>\/*********************************************************************\n * jacobian_cpp.cpp\n *\n * Copyright (c) 2017, ISCI \/ National Chiao Tung University (NCTU)\n *\n * Author: Howard Chen (s880367@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#include <iostream>\n#include <eigen3\/Eigen\/Dense>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cmath>\n#include <math.h>\n#include <vector>\n#include \"tm_kinematics\/include\/tm_kinematics\/tm_kin.h\"\n#include <unistd.h>\n#include <sys\/time.h>\n\n\n#define D1 0.1451\n#define D2 0\n#define D3 0\n#define D4 -0.1222\n#define D5 0.106\n#define D6 0.1144\n\n#define A1 0\n#define A2 0.329\n#define A3 0.3115\n#define A4 0\n#define A5 0\n#define A6 0\n\n\n#define ALPHA1 -90\n#define ALPHA2 0\n#define ALPHA3 0 \n#define ALPHA4 90\n#define ALPHA5 90\n#define ALPHA6 0\n\n#define PI 3.141592654\n#define DEG2RAD 0.01745329252\n#define RAD2DEG 57.29577951\n\nusing namespace std;\n\nvoid help()\n{\n    printf(\"\\n\");\n\tprintf(\"* PLease enter the argument in the following format : \\n\");\n\tprintf(\"* option : IJ = inverse jacobian\\n\");\n\tprintf(\"*          IK = inverse kinematics\\n\");\n\tprintf(\"*          FJ = forward jacobian\\n\");\n\tprintf(\"*          FK = forward kinematics\\n\");\n\tprintf(\"*          FJG = forward jacobian with gripper\\n\");\n\tprintf(\"*          FKG = forward kinematics with gripper\\n\");\n\tprintf(\"* IJ: .\/tm_jacobian IJ q1 q2 q3 q4 q5 q6 x' y' z' a' b' c' \\n\");\n\tprintf(\"* IK: .\/tm_jacobian IK x y z rz ry rx\\n\");\n\tprintf(\"* FJ: .\/tm_jacobian FJ q1 q2 q3 q4 q5 q6 qd1 qd2 qd3 qd4 qd5 qd6 \\n\");\n\tprintf(\"* FK: .\/tm_jacobian FK q1 q2 q3 q4 q5 q6 \\n\");\n\tprintf(\"* Input  dim: joint(radius), cartesian(m)\\n\");\n\tprintf(\"* Output dim: joint(radius), cartesian(m)\\n\");\n\tprintf(\"\\n\");\n}\n\n\nint main(int argc, char const *argv[])\n{\n\tdouble *q_inv, *q_forward, *T;\n\n\tq_inv = new double[48];\n\tq_forward = new double[6];\n\tT = new double[16]; \n\n\tEigen::Matrix<float, 6, 1> jointspd = Eigen::Matrix<float, 6, 1>::Zero();\n\tEigen::Matrix<float, 6, 1> effspd = Eigen::Matrix<float, 6, 1>::Zero();\n\tEigen::Matrix<float, 6, 1> q_AfterHomeOffset, q_BeforeHomeOffset;\n\tEigen::Matrix<float, 6, 1> home;\n\n\n\thome << 0, -PI*0.5, 0, PI*0.5, 0, 0;\n\/*\n\tdouble *q_test = new double [2];\n\tq_test[0] = 45*DEG2RAD;\n\tq_test[1] = 45*DEG2RAD;\n\n\ttm_jacobian::Forward_Kinematics_3(q_test, T);\n\tcout << \">>>> forward T\" << endl;\n\ttm_jacobian::printMatrix(T,4,16);\n\n\tdelete [] q_test;\t\n*\/\n\n\tif(strncmp(argv[1],\"--help\",6) == 0)\n\t{\n\t\thelp();\n\t\treturn 0;\n\t}\n\n\n\tq_BeforeHomeOffset << \tstrtod(argv[2],NULL),\n\t\t\t\t\t\t\tstrtod(argv[3],NULL),\n\t\t\t\t\t\t\tstrtod(argv[4],NULL),\n\t\t\t\t\t\t\tstrtod(argv[5],NULL),\n\t\t\t\t\t\t\tstrtod(argv[6],NULL),\n\t\t\t\t\t\t\tstrtod(argv[7],NULL);\n\n\tq_AfterHomeOffset = q_BeforeHomeOffset + home;\n\t\n\n\tif(strncmp(argv[1],\"IJ\",2) == 0) \/\/ inverse jacobian \n\t{\n\t\teffspd << \t\t\tstrtod(argv[8],NULL),\n\t\t\t\t\t\t\tstrtod(argv[9],NULL),\n\t\t\t\t\t\t\tstrtod(argv[10],NULL),\n\t\t\t\t\t\t\tstrtod(argv[11],NULL),\n\t\t\t\t\t\t\tstrtod(argv[12],NULL),\n\t\t\t\t\t\t\tstrtod(argv[13],NULL);\n\n\t\tEigen::Matrix<float, 6, 6> Inverse_Jacobian = tm_jacobian::Inverse_Jacobian(q_AfterHomeOffset);\n\t\tjointspd = Inverse_Jacobian*effspd;\n\t\tcout << \">>>> Inverse jacobian\" << endl;\n\t\ttm_jacobian::printMatrix(Inverse_Jacobian);\n\n\t\tcout << \">>>> joint speed\" << endl;\n\t\ttm_jacobian::printMatrix(jointspd);\n\t}\n\telse if(strncmp(argv[1],\"IK\",2) == 0)    \/\/ inverse kinematics \n\t{\n\t\tEigen::Matrix<float, 6, 1>CartesianPosition = q_BeforeHomeOffset;\n\t\tEigen::Matrix<float, 4, 4> T_;\n\t    Eigen::AngleAxisf rollAngle (CartesianPosition(3), Eigen::Vector3f::UnitZ());\n\t    Eigen::AngleAxisf yawAngle  (CartesianPosition(4), Eigen::Vector3f::UnitY());\n\t    Eigen::AngleAxisf pitchAngle(CartesianPosition(5), Eigen::Vector3f::UnitX());\n\t    Eigen::Quaternion<float> quaternion_matrix = rollAngle * yawAngle * pitchAngle;\n\t    Eigen::Matrix<float,3,3> RotationMatrix    = quaternion_matrix.matrix();\n\t    int num_sol;\n\t    \n\t    T_ <<   0., 0., 0., CartesianPosition(0),\n\t            0., 0., 0., CartesianPosition(1),\n\t            0., 0., 0., CartesianPosition(2),\n\t            0., 0., 0., 1.;\n\t    T_.block<3,3>(0,0) = RotationMatrix.block<3,3>(0,0);\n\n\t    if(strncmp(argv[1],\"IKG\",3) == 0)\n\t    {\n\t\t    Eigen::Matrix<float,4,4> T67, T06;\n\t\t\tT67 <<  1, 0, 0, 0,\n\t\t\t\t\t0, 1, 0, 0,\n\t\t\t\t\t0, 0, 1, 0.235,\n\t\t\t\t\t0, 0, 0, 1;\n\n\t\t\tT06 = T_*T67.inverse();\n\t\t    tm_jacobian::Matrix2DoubleArray(T06,T);\n\t\t   \tnum_sol =  tm_kinematics::inverse(T, q_inv);\n\t\t   \tcout << \">>>> T07 \" << endl;\n\t    \ttm_jacobian::printMatrix(T_);\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttm_jacobian::Matrix2DoubleArray(T_,T);\n\t\t\tnum_sol =  tm_kinematics::inverse(T, q_inv);\n\t\t}\n\t   \t\n\t    cout << \">>>> T06 \" << endl;\n\t    tm_jacobian::printMatrix(T,4,16);\n\t    cout << \">>>> inverse q number of sols T06 : \" << num_sol << endl;\n\t\ttm_jacobian::printMatrix(q_inv, 6, 6*(num_sol));\n\t}\n\telse if(strncmp(argv[1],\"FJ\",2) == 0)    \/\/ forward jacobian \n\t{\n\t\tif(strncmp(argv[1],\"FJG\",3) == 0)\n\t\t{\n\t\t\tEigen::Matrix<double, 6, 1> JointVelocity    = Eigen::Matrix<double, 6, 1>::Zero();\n\t\t\tEigen::Matrix<double, 6, 1> EFFVelocity      = Eigen::Matrix<double, 6, 1>::Zero();\n\t\t\tEigen::Matrix<double, 6, 6> Jacobian_gripper = tm_jacobian::Forward_Jacobian_gripper(q_AfterHomeOffset);\n\t\t\tJointVelocity << \tstrtod(argv[8],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[9],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[10],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[11],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[12],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[13],NULL);\n\t\t\tEFFVelocity = Jacobian_gripper*JointVelocity;\n\n\t\t\tcout << \">>>> jacobian\" << endl;\n\t\t\ttm_jacobian::printMatrixd(Jacobian_gripper);\n\t\t\tcout << \">>>> effspd speed\" << endl;\n\t\t\ttm_jacobian::printMatrixd(EFFVelocity);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tjointspd << \t\tstrtod(argv[8],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[9],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[10],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[11],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[12],NULL),\n\t\t\t\t\t\t\t\tstrtod(argv[13],NULL);\n\n\t\t\tEigen::Matrix<float, 6, 6> Jacobian = tm_jacobian::Forward_Jacobian(q_AfterHomeOffset);\n\t\t\teffspd = Jacobian*jointspd;\n\t\t\tcout << \">>>> jacobian\" << endl;\n\t\t\ttm_jacobian::printMatrix(Jacobian);\n\n\t\t\tcout << \">>>> effspd speed\" << endl;\n\t\t\ttm_jacobian::printMatrix(effspd);\n\t\t}\n\t}\n\telse if(strncmp(argv[1],\"FK\",2) == 0)    \/\/ forward kinematics \n\t{\n\t\tif(strncmp(argv[1],\"FKG\",3) == 0)\n\t\t{\n\t\t\tEigen::Matrix<double,4,4> T07, T67, T06;\n\t\t\tT67 <<  1, 0, 0, 0,\n\t\t\t\t\t0, 1, 0, 0,\n\t\t\t\t\t0, 0, 1, 0.235,\n\t\t\t\t\t0, 0, 0, 1;\n\n\t\t\ttm_jacobian::Matrix2DoubleArray(q_BeforeHomeOffset, q_forward);\n\t\t\ttm_jacobian::Forward_Kinematics_gripper(q_forward,T);\t\n\n\t\t\tfor (int i = 0; i < 4; ++i)\n\t\t\t\tfor (int j = 0; j < 4; ++j)\n\t\t\t\t\tT07(i,j) = T[4*i+j];\n\n\t\t\tT06 = T07*T67.inverse();\n\n\t\t\tfor (int i = 0; i < 4; ++i)\n\t\t\t\tfor (int j = 0; j < 4; ++j)\n\t\t\t\t\tT[4*i+j] = T06(i,j);\n\n\t\t\tint num_sol = tm_kinematics::inverse(T, q_inv, q_forward);\n\n\t\t\tcout << \">>>> T07 \" << endl;\n\t    \ttm_jacobian::printMatrixd(T07);\n\t    \tcout << \">>>> T06 \" << endl;\n\t    \ttm_jacobian::printMatrixd(T06);\n\t\t\tcout << \">>>> inverse q number of sols for T06 : \" << num_sol << endl;\n\t\t\ttm_jacobian::printMatrix(q_inv, 6, 6*(num_sol));\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttm_jacobian::Matrix2DoubleArray(q_BeforeHomeOffset, q_forward);\n\t\t\ttm_kinematics::forward(q_forward, T);\n\t\t\tint num_sol = tm_kinematics::inverse(T, q_inv, q_forward);\n\n\t\t\tcout << \">>>> T06\" << endl;\n\t\t\ttm_jacobian::printMatrix(T,4,16);\t\n\t\t\tcout << \">>>> inverse q number of sols : \" << num_sol << endl;\n\t\t\ttm_jacobian::printMatrix(q_inv, 6, 6*(num_sol));\n\t\t}\n\t}\n\telse if(strncmp(argv[1],\"TT\",2) == 0)\n\t{\n\t\tdouble *q_test = new double [3];\n\t\tq_test[0] = 0;\n\t\tq_test[1] = 0;\n\t\tq_test[2] = 0;\n\n\t\ttm_jacobian::Forward_Kinematics_3(q_test, T);\n\t\tcout << \">>>> forward T\" << endl;\n\t\ttm_jacobian::printMatrix(T,4,16);\n\t\t\n\t\tdelete [] q_test;\n\n\t}\n\n\tdelete [] T;\n\tdelete [] q_inv;\n\tdelete [] q_forward;\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>78dac557-2d3e-11e5-b536-c82a142b6f9b<commit_msg>793a1a6b-2d3e-11e5-9fae-c82a142b6f9b<commit_after>793a1a6b-2d3e-11e5-9fae-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>964b6ffd-2e4f-11e5-9d98-28cfe91dbc4b<commit_msg>965387de-2e4f-11e5-a18b-28cfe91dbc4b<commit_after>965387de-2e4f-11e5-a18b-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>f6c1dff3-2747-11e6-8e02-e0f84713e7b8<commit_msg>Nope, didn't work, now it does<commit_after>f6d1fa0f-2747-11e6-a28d-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>da2ca56e-ad5a-11e7-8db3-ac87a332f658<commit_msg>Bug fixes and performance improvements<commit_after>dac120e8-ad5a-11e7-a1f6-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>4c1cb442-ad58-11e7-8c61-ac87a332f658<commit_msg>gsghfklghjsad<commit_after>4c9ba880-ad58-11e7-989e-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>f866462e-2e4e-11e5-833e-28cfe91dbc4b<commit_msg>f86c6d19-2e4e-11e5-a408-28cfe91dbc4b<commit_after>f86c6d19-2e4e-11e5-a408-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>d8ddd382-4b02-11e5-922b-28cfe9171a43<commit_msg>I'm done<commit_after>d8ea5451-4b02-11e5-a9e9-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>d7270e1e-327f-11e5-bee9-9cf387a8033e<commit_msg>d72e796b-327f-11e5-95da-9cf387a8033e<commit_after>d72e796b-327f-11e5-95da-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>76f15db4-2d53-11e5-baeb-247703a38240<commit_msg>76f1e004-2d53-11e5-baeb-247703a38240<commit_after>76f1e004-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>98cca96e-2e4f-11e5-b887-28cfe91dbc4b<commit_msg>98d51005-2e4f-11e5-ba5a-28cfe91dbc4b<commit_after>98d51005-2e4f-11e5-ba5a-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>d3bbaf45-313a-11e5-94c3-3c15c2e10482<commit_msg>d3c1a463-313a-11e5-acbf-3c15c2e10482<commit_after>d3c1a463-313a-11e5-acbf-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>76f05ff4-2d53-11e5-baeb-247703a38240<commit_msg>76f0deca-2d53-11e5-baeb-247703a38240<commit_after>76f0deca-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AdabasStatDlg.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 07:03:54 $\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 DBAUI_ADABASSTATDLG_HXX\n#include \"AdabasStatDlg.hxx\"\n#endif\n#ifndef DBAUI_ADABASSTATDLG_HRC\n#include \"AdabasStatDlg.hrc\"\n#endif\n#ifndef _DBU_DLG_HRC_\n#include \"dbu_dlg.hrc\"\n#endif\n#ifndef _DBAUI_MODULE_DBU_HXX_\n#include \"moduledbu.hxx\"\n#endif\n#ifndef _DBAUI_DATASOURCEITEMS_HXX_\n#include \"dsitems.hxx\"\n#endif\n#ifndef _SFXSTRITEM_HXX\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _VCL_STDTEXT_HXX\n#include <vcl\/stdtext.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _DBAUI_DATASOURCEITEMS_HXX_\n#include \"dsitems.hxx\"\n#endif\n#ifndef DBAUI_DRIVERSETTINGS_HXX\n#include \"DriverSettings.hxx\"\n#endif\n#ifndef _DBAUI_DBADMINIMPL_HXX_\n#include \"DbAdminImpl.hxx\"\n#endif\n#ifndef _DBAUI_PROPERTYSETITEM_HXX_\n#include \"propertysetitem.hxx\"\n#endif\n#ifndef _DBAUI_ADMINPAGES_HXX_\n#include \"adminpages.hxx\"\n#endif\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::beans;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::sdbc;\n\n    \/\/========================================================================\n    \/\/= OAdabasStatPageDlg\nDBG_NAME(OAdabasStatPageDlg)\n\/\/========================================================================\n    OAdabasStatPageDlg::OAdabasStatPageDlg(Window* _pParent\n                                            , SfxItemSet* _pItems\n                                            ,const Reference< XMultiServiceFactory >& _rxORB\n                                            ,const ::com::sun::star::uno::Any& _aDataSourceName)\n        :SfxTabDialog(_pParent, ModuleRes(DLG_DATABASE_ADABASADMIN), _pItems)\n    {\n        DBG_CTOR(OAdabasStatPageDlg,NULL);\n\n        m_pImpl = ::std::auto_ptr<ODbDataSourceAdministrationHelper>(new ODbDataSourceAdministrationHelper(_rxORB,_pParent,this));\n        m_pImpl->setDataSourceOrName(_aDataSourceName);\n        Reference< XPropertySet > xDatasource = m_pImpl->getCurrentDataSource();\n        m_pImpl->translateProperties(xDatasource, *GetInputSetImpl());\n        SetInputSet(GetInputSetImpl());\n        \/\/ propagate this set as our new input set and reset the example set\n        delete pExampleSet;\n        pExampleSet = new SfxItemSet(*GetInputSetImpl());\n\n        DATASOURCE_TYPE eType = m_pImpl->getDatasourceType(*GetInputSetImpl());\n\n        switch ( eType )\n        {\n            case DST_ADABAS:\n                AddTabPage(TAB_PAG_ADABAS_SETTINGS, String(ResId(STR_PAGETITLE_ADABAS_STATISTIC)), ODriversSettings::CreateAdabas,0, sal_False, 1);\n                break;\n            default:\n                OSL_ENSURE(0,\"Not supported for other types thasn adabas!\");\n                break;\n        }\n\n        \/\/ remove the reset button - it's meaning is much too ambiguous in this dialog\n        RemoveResetButton();\n        FreeResource();\n    }\n\n    \/\/ -----------------------------------------------------------------------\n    OAdabasStatPageDlg::~OAdabasStatPageDlg()\n    {\n        SetInputSet(NULL);\n        DELETEZ(pExampleSet);\n\n        DBG_DTOR(OAdabasStatPageDlg,NULL);\n    }\n    \/\/ -----------------------------------------------------------------------\n    short OAdabasStatPageDlg::Execute()\n    {\n        short nRet = SfxTabDialog::Execute();\n        if ( nRet == RET_OK )\n        {\n            pExampleSet->Put(*GetOutputItemSet());\n            m_pImpl->saveChanges(*pExampleSet);\n        }\n        return nRet;\n    }\n    \/\/-------------------------------------------------------------------------\n    void OAdabasStatPageDlg::PageCreated(USHORT _nId, SfxTabPage& _rPage)\n    {\n        \/\/ register ourself as modified listener\n        static_cast<OGenericAdministrationPage&>(_rPage).SetServiceFactory(m_pImpl->getORB());\n        static_cast<OGenericAdministrationPage&>(_rPage).SetAdminDialog(this,this);\n\n        AdjustLayout();\n        Window *pWin = GetViewWindow();\n        if(pWin)\n            pWin->Invalidate();\n\n        SfxTabDialog::PageCreated(_nId, _rPage);\n    }\n    \/\/ -----------------------------------------------------------------------------\n    const SfxItemSet* OAdabasStatPageDlg::getOutputSet() const\n    {\n        return GetExampleSet();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    SfxItemSet* OAdabasStatPageDlg::getWriteOutputSet()\n    {\n        return pExampleSet;\n    }\n    \/\/ -----------------------------------------------------------------------------\n    ::std::pair< Reference<XConnection>,sal_Bool> OAdabasStatPageDlg::createConnection()\n    {\n        return m_pImpl->createConnection();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    Reference< XMultiServiceFactory > OAdabasStatPageDlg::getORB()\n    {\n        return m_pImpl->getORB();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    Reference< XDriver > OAdabasStatPageDlg::getDriver()\n    {\n        return m_pImpl->getDriver();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    DATASOURCE_TYPE OAdabasStatPageDlg::getDatasourceType(const SfxItemSet& _rSet) const\n    {\n        return m_pImpl->getDatasourceType(_rSet);\n    }\n    \/\/ -----------------------------------------------------------------------------\n    void OAdabasStatPageDlg::clearPassword()\n    {\n        m_pImpl->clearPassword();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    void OAdabasStatPageDlg::setTitle(const ::rtl::OUString& _sTitle)\n    {\n        SetText(_sTitle);\n    }\n    \/\/-------------------------------------------------------------------------\n    sal_Bool OAdabasStatPageDlg::saveDatasource()\n    {\n        return PrepareLeaveCurrentPage();\n    }\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n<commit_msg>INTEGRATION: CWS residcleanup (1.10.80); FILE MERGED 2007\/02\/26 22:58:45 pl 1.10.80.1: #i74635# no more ResMgr default<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AdabasStatDlg.cxx,v $\n *\n *  $Revision: 1.11 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-26 07:55:00 $\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 DBAUI_ADABASSTATDLG_HXX\n#include \"AdabasStatDlg.hxx\"\n#endif\n#ifndef DBAUI_ADABASSTATDLG_HRC\n#include \"AdabasStatDlg.hrc\"\n#endif\n#ifndef _DBU_DLG_HRC_\n#include \"dbu_dlg.hrc\"\n#endif\n#ifndef _DBAUI_MODULE_DBU_HXX_\n#include \"moduledbu.hxx\"\n#endif\n#ifndef _DBAUI_DATASOURCEITEMS_HXX_\n#include \"dsitems.hxx\"\n#endif\n#ifndef _SFXSTRITEM_HXX\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _VCL_STDTEXT_HXX\n#include <vcl\/stdtext.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _DBAUI_DATASOURCEITEMS_HXX_\n#include \"dsitems.hxx\"\n#endif\n#ifndef DBAUI_DRIVERSETTINGS_HXX\n#include \"DriverSettings.hxx\"\n#endif\n#ifndef _DBAUI_DBADMINIMPL_HXX_\n#include \"DbAdminImpl.hxx\"\n#endif\n#ifndef _DBAUI_PROPERTYSETITEM_HXX_\n#include \"propertysetitem.hxx\"\n#endif\n#ifndef _DBAUI_ADMINPAGES_HXX_\n#include \"adminpages.hxx\"\n#endif\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::beans;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::sdbc;\n\n    \/\/========================================================================\n    \/\/= OAdabasStatPageDlg\nDBG_NAME(OAdabasStatPageDlg)\n\/\/========================================================================\n    OAdabasStatPageDlg::OAdabasStatPageDlg(Window* _pParent\n                                            , SfxItemSet* _pItems\n                                            ,const Reference< XMultiServiceFactory >& _rxORB\n                                            ,const ::com::sun::star::uno::Any& _aDataSourceName)\n        :SfxTabDialog(_pParent, ModuleRes(DLG_DATABASE_ADABASADMIN), _pItems)\n    {\n        DBG_CTOR(OAdabasStatPageDlg,NULL);\n\n        m_pImpl = ::std::auto_ptr<ODbDataSourceAdministrationHelper>(new ODbDataSourceAdministrationHelper(_rxORB,_pParent,this));\n        m_pImpl->setDataSourceOrName(_aDataSourceName);\n        Reference< XPropertySet > xDatasource = m_pImpl->getCurrentDataSource();\n        m_pImpl->translateProperties(xDatasource, *GetInputSetImpl());\n        SetInputSet(GetInputSetImpl());\n        \/\/ propagate this set as our new input set and reset the example set\n        delete pExampleSet;\n        pExampleSet = new SfxItemSet(*GetInputSetImpl());\n\n        DATASOURCE_TYPE eType = m_pImpl->getDatasourceType(*GetInputSetImpl());\n\n        switch ( eType )\n        {\n            case DST_ADABAS:\n                AddTabPage(TAB_PAG_ADABAS_SETTINGS, String(ModuleRes(STR_PAGETITLE_ADABAS_STATISTIC)), ODriversSettings::CreateAdabas,0, sal_False, 1);\n                break;\n            default:\n                OSL_ENSURE(0,\"Not supported for other types thasn adabas!\");\n                break;\n        }\n\n        \/\/ remove the reset button - it's meaning is much too ambiguous in this dialog\n        RemoveResetButton();\n        FreeResource();\n    }\n\n    \/\/ -----------------------------------------------------------------------\n    OAdabasStatPageDlg::~OAdabasStatPageDlg()\n    {\n        SetInputSet(NULL);\n        DELETEZ(pExampleSet);\n\n        DBG_DTOR(OAdabasStatPageDlg,NULL);\n    }\n    \/\/ -----------------------------------------------------------------------\n    short OAdabasStatPageDlg::Execute()\n    {\n        short nRet = SfxTabDialog::Execute();\n        if ( nRet == RET_OK )\n        {\n            pExampleSet->Put(*GetOutputItemSet());\n            m_pImpl->saveChanges(*pExampleSet);\n        }\n        return nRet;\n    }\n    \/\/-------------------------------------------------------------------------\n    void OAdabasStatPageDlg::PageCreated(USHORT _nId, SfxTabPage& _rPage)\n    {\n        \/\/ register ourself as modified listener\n        static_cast<OGenericAdministrationPage&>(_rPage).SetServiceFactory(m_pImpl->getORB());\n        static_cast<OGenericAdministrationPage&>(_rPage).SetAdminDialog(this,this);\n\n        AdjustLayout();\n        Window *pWin = GetViewWindow();\n        if(pWin)\n            pWin->Invalidate();\n\n        SfxTabDialog::PageCreated(_nId, _rPage);\n    }\n    \/\/ -----------------------------------------------------------------------------\n    const SfxItemSet* OAdabasStatPageDlg::getOutputSet() const\n    {\n        return GetExampleSet();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    SfxItemSet* OAdabasStatPageDlg::getWriteOutputSet()\n    {\n        return pExampleSet;\n    }\n    \/\/ -----------------------------------------------------------------------------\n    ::std::pair< Reference<XConnection>,sal_Bool> OAdabasStatPageDlg::createConnection()\n    {\n        return m_pImpl->createConnection();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    Reference< XMultiServiceFactory > OAdabasStatPageDlg::getORB()\n    {\n        return m_pImpl->getORB();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    Reference< XDriver > OAdabasStatPageDlg::getDriver()\n    {\n        return m_pImpl->getDriver();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    DATASOURCE_TYPE OAdabasStatPageDlg::getDatasourceType(const SfxItemSet& _rSet) const\n    {\n        return m_pImpl->getDatasourceType(_rSet);\n    }\n    \/\/ -----------------------------------------------------------------------------\n    void OAdabasStatPageDlg::clearPassword()\n    {\n        m_pImpl->clearPassword();\n    }\n    \/\/ -----------------------------------------------------------------------------\n    void OAdabasStatPageDlg::setTitle(const ::rtl::OUString& _sTitle)\n    {\n        SetText(_sTitle);\n    }\n    \/\/-------------------------------------------------------------------------\n    sal_Bool OAdabasStatPageDlg::saveDatasource()\n    {\n        return PrepareLeaveCurrentPage();\n    }\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n<|endoftext|>"}
{"text":"<commit_before>9f1dc470-327f-11e5-bfa3-9cf387a8033e<commit_msg>9f2370f0-327f-11e5-8236-9cf387a8033e<commit_after>9f2370f0-327f-11e5-8236-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>2c89f97e-5216-11e5-859b-6c40088e03e4<commit_msg>2c90fe40-5216-11e5-8b22-6c40088e03e4<commit_after>2c90fe40-5216-11e5-8b22-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before><commit_msg>Remove unused variables (#16070)<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef ENTT_SIGNAL_EMITTER_HPP\n#define ENTT_SIGNAL_EMITTER_HPP\n\n\n#include <algorithm>\n#include <functional>\n#include <iterator>\n#include <list>\n#include <memory>\n#include <type_traits>\n#include <utility>\n#include <vector>\n#include \"..\/config\/config.h\"\n#include \"..\/core\/fwd.hpp\"\n#include \"..\/core\/type_info.hpp\"\n\n\nnamespace entt {\n\n\n\/**\n * @brief General purpose event emitter.\n *\n * The emitter class template follows the CRTP idiom. To create a custom emitter\n * type, derived classes must inherit directly from the base class as:\n *\n * @code{.cpp}\n * struct my_emitter: emitter<my_emitter> {\n *     \/\/ ...\n * }\n * @endcode\n *\n * Pools for the type of events are created internally on the fly. It's not\n * required to specify in advance the full list of accepted types.<br\/>\n * Moreover, whenever an event is published, an emitter provides the listeners\n * with a reference to itself along with a const reference to the event.\n * Therefore listeners have an handy way to work with it without incurring in\n * the need of capturing a reference to the emitter.\n *\n * @tparam Derived Actual type of emitter that extends the class template.\n *\/\ntemplate<typename Derived>\nclass emitter {\n    struct basic_pool {\n        virtual ~basic_pool() = default;\n        virtual bool empty() const ENTT_NOEXCEPT = 0;\n        virtual void clear() ENTT_NOEXCEPT = 0;\n    };\n\n    template<typename Event>\n    struct pool_handler final: basic_pool {\n        using listener_type = std::function<void(const Event &, Derived &)>;\n        using element_type = std::pair<bool, listener_type>;\n        using container_type = std::list<element_type>;\n        using connection_type = typename container_type::iterator;\n\n        bool empty() const ENTT_NOEXCEPT override {\n            auto pred = [](auto &&element) { return element.first; };\n\n            return std::all_of(once_list.cbegin(), once_list.cend(), pred) &&\n                    std::all_of(on_list.cbegin(), on_list.cend(), pred);\n        }\n\n        void clear() ENTT_NOEXCEPT override {\n            if(publishing) {\n                for(auto &&element: once_list) {\n                    element.first = true;\n                }\n\n                for(auto &&element: on_list) {\n                    element.first = true;\n                }\n            } else {\n                once_list.clear();\n                on_list.clear();\n            }\n        }\n\n        connection_type once(listener_type listener) {\n            return once_list.emplace(once_list.cend(), false, std::move(listener));\n        }\n\n        connection_type on(listener_type listener) {\n            return on_list.emplace(on_list.cend(), false, std::move(listener));\n        }\n\n        void erase(connection_type conn) {\n            conn->first = true;\n\n            if(!publishing) {\n                auto pred = [](auto &&element) { return element.first; };\n                once_list.remove_if(pred);\n                on_list.remove_if(pred);\n            }\n        }\n\n        void publish(const Event &event, Derived &ref) {\n            container_type swap_list;\n            once_list.swap(swap_list);\n\n            publishing = true;\n\n            for(auto &&element: on_list) {\n                element.first ? void() : element.second(event, ref);\n            }\n\n            for(auto &&element: swap_list) {\n                element.first ? void() : element.second(event, ref);\n            }\n\n            publishing = false;\n\n            on_list.remove_if([](auto &&element) { return element.first; });\n        }\n\n    private:\n        bool publishing{false};\n        container_type once_list{};\n        container_type on_list{};\n    };\n\n    template<typename Event>\n    const pool_handler<Event> & assure() const {\n        static_assert(std::is_same_v<Event, std::decay_t<Event>>);\n        const auto index = type_index<Event>::value();\n\n        if(!(index < pools.size())) {\n            pools.resize(index+1);\n        }\n\n        if(!pools[index]) {\n            pools[index].reset(new pool_handler<Event>{});\n        }\n\n        return static_cast<pool_handler<Event> &>(*pools[index]);\n    }\n\n    template<typename Event>\n    pool_handler<Event> & assure() {\n        return const_cast<pool_handler<Event> &>(std::as_const(*this).template assure<Event>());\n    }\n\npublic:\n    \/** @brief Type of listeners accepted for the given event. *\/\n    template<typename Event>\n    using listener = typename pool_handler<Event>::listener_type;\n\n    \/**\n     * @brief Generic connection type for events.\n     *\n     * Type of the connection object returned by the event emitter whenever a\n     * listener for the given type is registered.<br\/>\n     * It can be used to break connections still in use.\n     *\n     * @tparam Event Type of event for which the connection is created.\n     *\/\n    template<typename Event>\n    struct connection: private pool_handler<Event>::connection_type {\n        \/** @brief Event emitters are friend classes of connections. *\/\n        friend class emitter;\n\n        \/*! @brief Default constructor. *\/\n        connection() = default;\n\n        \/**\n         * @brief Creates a connection that wraps its underlying instance.\n         * @param conn A connection object to wrap.\n         *\/\n        connection(typename pool_handler<Event>::connection_type conn)\n            : pool_handler<Event>::connection_type{std::move(conn)}\n        {}\n    };\n\n    \/*! @brief Default constructor. *\/\n    emitter() = default;\n\n    \/*! @brief Default destructor. *\/\n    virtual ~emitter() {\n        static_assert(std::is_base_of_v<emitter<Derived>, Derived>);\n    }\n\n    \/*! @brief Default move constructor. *\/\n    emitter(emitter &&) = default;\n\n    \/*! @brief Default move assignment operator. @return This emitter. *\/\n    emitter & operator=(emitter &&) = default;\n\n    \/**\n     * @brief Emits the given event.\n     *\n     * All the listeners registered for the specific event type are invoked with\n     * the given event. The event type must either have a proper constructor for\n     * the arguments provided or be an aggregate type.\n     *\n     * @tparam Event Type of event to publish.\n     * @tparam Args Types of arguments to use to construct the event.\n     * @param args Parameters to use to initialize the event.\n     *\/\n    template<typename Event, typename... Args>\n    void publish(Args &&... args) {\n        assure<Event>().publish(Event{std::forward<Args>(args)...}, *static_cast<Derived *>(this));\n    }\n\n    \/**\n     * @brief Registers a long-lived listener with the event emitter.\n     *\n     * This method can be used to register a listener designed to be invoked\n     * more than once for the given event type.<br\/>\n     * The connection returned by the method can be freely discarded. It's meant\n     * to be used later to disconnect the listener if required.\n     *\n     * The listener is as a callable object that can be moved and the type of\n     * which is `void(const Event &, Derived &)`.\n     *\n     * @note\n     * Whenever an event is emitted, the emitter provides the listener with a\n     * reference to the derived class. Listeners don't have to capture those\n     * instances for later uses.\n     *\n     * @tparam Event Type of event to which to connect the listener.\n     * @param instance The listener to register.\n     * @return Connection object that can be used to disconnect the listener.\n     *\/\n    template<typename Event>\n    connection<Event> on(listener<Event> instance) {\n        return assure<Event>().on(std::move(instance));\n    }\n\n    \/**\n     * @brief Registers a short-lived listener with the event emitter.\n     *\n     * This method can be used to register a listener designed to be invoked\n     * only once for the given event type.<br\/>\n     * The connection returned by the method can be freely discarded. It's meant\n     * to be used later to disconnect the listener if required.\n     *\n     * The listener is as a callable object that can be moved and the type of\n     * which is `void(const Event &, Derived &)`.\n     *\n     * @note\n     * Whenever an event is emitted, the emitter provides the listener with a\n     * reference to the derived class. Listeners don't have to capture those\n     * instances for later uses.\n     *\n     * @tparam Event Type of event to which to connect the listener.\n     * @param instance The listener to register.\n     * @return Connection object that can be used to disconnect the listener.\n     *\/\n    template<typename Event>\n    connection<Event> once(listener<Event> instance) {\n        return assure<Event>().once(std::move(instance));\n    }\n\n    \/**\n     * @brief Disconnects a listener from the event emitter.\n     *\n     * Do not use twice the same connection to disconnect a listener, it results\n     * in undefined behavior. Once used, discard the connection object.\n     *\n     * @tparam Event Type of event of the connection.\n     * @param conn A valid connection.\n     *\/\n    template<typename Event>\n    void erase(connection<Event> conn) {\n        assure<Event>().erase(std::move(conn));\n    }\n\n    \/**\n     * @brief Disconnects all the listeners for the given event type.\n     *\n     * All the connections previously returned for the given event are\n     * invalidated. Using them results in undefined behavior.\n     *\n     * @tparam Event Type of event to reset.\n     *\/\n    template<typename Event>\n    void clear() {\n        assure<Event>().clear();\n    }\n\n    \/**\n     * @brief Disconnects all the listeners.\n     *\n     * All the connections previously returned are invalidated. Using them\n     * results in undefined behavior.\n     *\/\n    void clear() ENTT_NOEXCEPT {\n        for(auto &&cpool: pools) {\n            if(cpool) {\n                cpool->clear();\n            }\n        }\n    }\n\n    \/**\n     * @brief Checks if there are listeners registered for the specific event.\n     * @tparam Event Type of event to test.\n     * @return True if there are no listeners registered, false otherwise.\n     *\/\n    template<typename Event>\n    bool empty() const {\n        return assure<Event>().empty();\n    }\n\n    \/**\n     * @brief Checks if there are listeners registered with the event emitter.\n     * @return True if there are no listeners registered, false otherwise.\n     *\/\n    bool empty() const ENTT_NOEXCEPT {\n        return std::all_of(pools.cbegin(), pools.cend(), [](auto &&cpool) {\n            return !cpool || cpool->empty();\n        });\n    }\n\nprivate:\n    mutable std::vector<std::unique_ptr<basic_pool>> pools{};\n};\n\n\n}\n\n\n#endif\n<commit_msg>emitter: reintroduced type_id for the internal pool<commit_after>#ifndef ENTT_SIGNAL_EMITTER_HPP\n#define ENTT_SIGNAL_EMITTER_HPP\n\n\n#include <algorithm>\n#include <functional>\n#include <iterator>\n#include <list>\n#include <memory>\n#include <type_traits>\n#include <utility>\n#include <vector>\n#include \"..\/config\/config.h\"\n#include \"..\/core\/fwd.hpp\"\n#include \"..\/core\/type_info.hpp\"\n\n\nnamespace entt {\n\n\n\/**\n * @brief General purpose event emitter.\n *\n * The emitter class template follows the CRTP idiom. To create a custom emitter\n * type, derived classes must inherit directly from the base class as:\n *\n * @code{.cpp}\n * struct my_emitter: emitter<my_emitter> {\n *     \/\/ ...\n * }\n * @endcode\n *\n * Pools for the type of events are created internally on the fly. It's not\n * required to specify in advance the full list of accepted types.<br\/>\n * Moreover, whenever an event is published, an emitter provides the listeners\n * with a reference to itself along with a const reference to the event.\n * Therefore listeners have an handy way to work with it without incurring in\n * the need of capturing a reference to the emitter.\n *\n * @tparam Derived Actual type of emitter that extends the class template.\n *\/\ntemplate<typename Derived>\nclass emitter {\n    struct basic_pool {\n        virtual ~basic_pool() = default;\n        virtual bool empty() const ENTT_NOEXCEPT = 0;\n        virtual void clear() ENTT_NOEXCEPT = 0;\n        virtual id_type type_id() const ENTT_NOEXCEPT = 0;\n    };\n\n    template<typename Event>\n    struct pool_handler final: basic_pool {\n        using listener_type = std::function<void(const Event &, Derived &)>;\n        using element_type = std::pair<bool, listener_type>;\n        using container_type = std::list<element_type>;\n        using connection_type = typename container_type::iterator;\n\n        bool empty() const ENTT_NOEXCEPT override {\n            auto pred = [](auto &&element) { return element.first; };\n\n            return std::all_of(once_list.cbegin(), once_list.cend(), pred) &&\n                    std::all_of(on_list.cbegin(), on_list.cend(), pred);\n        }\n\n        void clear() ENTT_NOEXCEPT override {\n            if(publishing) {\n                for(auto &&element: once_list) {\n                    element.first = true;\n                }\n\n                for(auto &&element: on_list) {\n                    element.first = true;\n                }\n            } else {\n                once_list.clear();\n                on_list.clear();\n            }\n        }\n\n        connection_type once(listener_type listener) {\n            return once_list.emplace(once_list.cend(), false, std::move(listener));\n        }\n\n        connection_type on(listener_type listener) {\n            return on_list.emplace(on_list.cend(), false, std::move(listener));\n        }\n\n        void erase(connection_type conn) {\n            conn->first = true;\n\n            if(!publishing) {\n                auto pred = [](auto &&element) { return element.first; };\n                once_list.remove_if(pred);\n                on_list.remove_if(pred);\n            }\n        }\n\n        void publish(const Event &event, Derived &ref) {\n            container_type swap_list;\n            once_list.swap(swap_list);\n\n            publishing = true;\n\n            for(auto &&element: on_list) {\n                element.first ? void() : element.second(event, ref);\n            }\n\n            for(auto &&element: swap_list) {\n                element.first ? void() : element.second(event, ref);\n            }\n\n            publishing = false;\n\n            on_list.remove_if([](auto &&element) { return element.first; });\n        }\n\n        id_type type_id() const ENTT_NOEXCEPT override {\n            return type_info<Event>::id();\n        }\n\n    private:\n        bool publishing{false};\n        container_type once_list{};\n        container_type on_list{};\n    };\n\n    template<typename Event>\n    const pool_handler<Event> & assure() const {\n        static_assert(std::is_same_v<Event, std::decay_t<Event>>);\n        const auto index = type_index<Event>::value();\n\n        if(!(index < pools.size())) {\n            pools.resize(index+1);\n        }\n\n        if(!pools[index]) {\n            pools[index].reset(new pool_handler<Event>{});\n        }\n\n        return static_cast<pool_handler<Event> &>(*pools[index]);\n    }\n\n    template<typename Event>\n    pool_handler<Event> & assure() {\n        return const_cast<pool_handler<Event> &>(std::as_const(*this).template assure<Event>());\n    }\n\npublic:\n    \/** @brief Type of listeners accepted for the given event. *\/\n    template<typename Event>\n    using listener = typename pool_handler<Event>::listener_type;\n\n    \/**\n     * @brief Generic connection type for events.\n     *\n     * Type of the connection object returned by the event emitter whenever a\n     * listener for the given type is registered.<br\/>\n     * It can be used to break connections still in use.\n     *\n     * @tparam Event Type of event for which the connection is created.\n     *\/\n    template<typename Event>\n    struct connection: private pool_handler<Event>::connection_type {\n        \/** @brief Event emitters are friend classes of connections. *\/\n        friend class emitter;\n\n        \/*! @brief Default constructor. *\/\n        connection() = default;\n\n        \/**\n         * @brief Creates a connection that wraps its underlying instance.\n         * @param conn A connection object to wrap.\n         *\/\n        connection(typename pool_handler<Event>::connection_type conn)\n            : pool_handler<Event>::connection_type{std::move(conn)}\n        {}\n    };\n\n    \/*! @brief Default constructor. *\/\n    emitter() = default;\n\n    \/*! @brief Default destructor. *\/\n    virtual ~emitter() {\n        static_assert(std::is_base_of_v<emitter<Derived>, Derived>);\n    }\n\n    \/*! @brief Default move constructor. *\/\n    emitter(emitter &&) = default;\n\n    \/*! @brief Default move assignment operator. @return This emitter. *\/\n    emitter & operator=(emitter &&) = default;\n\n    \/**\n     * @brief Emits the given event.\n     *\n     * All the listeners registered for the specific event type are invoked with\n     * the given event. The event type must either have a proper constructor for\n     * the arguments provided or be an aggregate type.\n     *\n     * @tparam Event Type of event to publish.\n     * @tparam Args Types of arguments to use to construct the event.\n     * @param args Parameters to use to initialize the event.\n     *\/\n    template<typename Event, typename... Args>\n    void publish(Args &&... args) {\n        assure<Event>().publish(Event{std::forward<Args>(args)...}, *static_cast<Derived *>(this));\n    }\n\n    \/**\n     * @brief Registers a long-lived listener with the event emitter.\n     *\n     * This method can be used to register a listener designed to be invoked\n     * more than once for the given event type.<br\/>\n     * The connection returned by the method can be freely discarded. It's meant\n     * to be used later to disconnect the listener if required.\n     *\n     * The listener is as a callable object that can be moved and the type of\n     * which is `void(const Event &, Derived &)`.\n     *\n     * @note\n     * Whenever an event is emitted, the emitter provides the listener with a\n     * reference to the derived class. Listeners don't have to capture those\n     * instances for later uses.\n     *\n     * @tparam Event Type of event to which to connect the listener.\n     * @param instance The listener to register.\n     * @return Connection object that can be used to disconnect the listener.\n     *\/\n    template<typename Event>\n    connection<Event> on(listener<Event> instance) {\n        return assure<Event>().on(std::move(instance));\n    }\n\n    \/**\n     * @brief Registers a short-lived listener with the event emitter.\n     *\n     * This method can be used to register a listener designed to be invoked\n     * only once for the given event type.<br\/>\n     * The connection returned by the method can be freely discarded. It's meant\n     * to be used later to disconnect the listener if required.\n     *\n     * The listener is as a callable object that can be moved and the type of\n     * which is `void(const Event &, Derived &)`.\n     *\n     * @note\n     * Whenever an event is emitted, the emitter provides the listener with a\n     * reference to the derived class. Listeners don't have to capture those\n     * instances for later uses.\n     *\n     * @tparam Event Type of event to which to connect the listener.\n     * @param instance The listener to register.\n     * @return Connection object that can be used to disconnect the listener.\n     *\/\n    template<typename Event>\n    connection<Event> once(listener<Event> instance) {\n        return assure<Event>().once(std::move(instance));\n    }\n\n    \/**\n     * @brief Disconnects a listener from the event emitter.\n     *\n     * Do not use twice the same connection to disconnect a listener, it results\n     * in undefined behavior. Once used, discard the connection object.\n     *\n     * @tparam Event Type of event of the connection.\n     * @param conn A valid connection.\n     *\/\n    template<typename Event>\n    void erase(connection<Event> conn) {\n        assure<Event>().erase(std::move(conn));\n    }\n\n    \/**\n     * @brief Disconnects all the listeners for the given event type.\n     *\n     * All the connections previously returned for the given event are\n     * invalidated. Using them results in undefined behavior.\n     *\n     * @tparam Event Type of event to reset.\n     *\/\n    template<typename Event>\n    void clear() {\n        assure<Event>().clear();\n    }\n\n    \/**\n     * @brief Disconnects all the listeners.\n     *\n     * All the connections previously returned are invalidated. Using them\n     * results in undefined behavior.\n     *\/\n    void clear() ENTT_NOEXCEPT {\n        for(auto &&cpool: pools) {\n            if(cpool) {\n                cpool->clear();\n            }\n        }\n    }\n\n    \/**\n     * @brief Checks if there are listeners registered for the specific event.\n     * @tparam Event Type of event to test.\n     * @return True if there are no listeners registered, false otherwise.\n     *\/\n    template<typename Event>\n    bool empty() const {\n        return assure<Event>().empty();\n    }\n\n    \/**\n     * @brief Checks if there are listeners registered with the event emitter.\n     * @return True if there are no listeners registered, false otherwise.\n     *\/\n    bool empty() const ENTT_NOEXCEPT {\n        return std::all_of(pools.cbegin(), pools.cend(), [](auto &&cpool) {\n            return !cpool || cpool->empty();\n        });\n    }\n\nprivate:\n    mutable std::vector<std::unique_ptr<basic_pool>> pools{};\n};\n\n\n}\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>8e9faca1-2d14-11e5-af21-0401358ea401<commit_msg>8e9faca2-2d14-11e5-af21-0401358ea401<commit_after>8e9faca2-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>30bd6557-ad5b-11e7-a88f-ac87a332f658<commit_msg>more bug fix<commit_after>313264dc-ad5b-11e7-b101-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>\/*\n * libcpu: i386_decoder.cpp\n *\/\n\n#include <llvm\/MC\/MCAsmInfo.h>\n#include <llvm\/MC\/MCDisassembler.h>\n#include <llvm\/MC\/MCInst.h>\n#include <llvm\/MC\/MCInstPrinter.h>\n#include <llvm\/MC\/MCInstrInfo.h>\n#include <llvm\/MC\/MCRegisterInfo.h>\n#include <llvm\/MC\/MCSubtargetInfo.h>\n#include <llvm\/ADT\/OwningPtr.h>\n#include <llvm\/ADT\/Triple.h>\n#include <llvm\/Support\/MemoryObject.h>\n#include <llvm\/Support\/Host.h>\n#include <llvm\/Support\/TargetRegistry.h>\n#include <llvm\/Support\/raw_ostream.h>\n\n#include \"i386_arch.h\"\n\n\n\nextern \"C\"\n{\n\t void LLVMInitializeX86Disassembler();\n}\n\n\nstatic const MCDisassembler *DisAsm = NULL;\nstatic MCInstPrinter *InstPrinter = NULL;\n\n\n\/*\n\/\/ A subclass of LLVM's MemoryObject that wraps a pointer as an unbounded array\n\/\/ of bytes.\n\/\/ \n\/\/ When we have an MCDisassembler object, we'll point it into this MemoryObject\n\/\/ to decode an instruction. \n*\/\t \nnamespace {\n\tclass DirectMemoryObject : public MemoryObject {\n\tprivate:\n\t\tconst uint8_t *Bytes;\n\tpublic:\n\t\tDirectMemoryObject(const uint8_t *bytes) : Bytes(bytes) {}\n\n\t\tuint64_t getBase() const { return 0; }\n\t\tuint64_t getExtent() const { return 0; }\n\n\t\tint readByte(uint64_t Addr, uint8_t *Byte) const {\n\t\t\t*Byte = Bytes[Addr];\n\t\t\treturn 0;\n\t\t}\n\t};\n}\n\n\n\/*\n\/\/ Initializes our global disassembler and printer.\n\/\/ Largely ripped out of llvm-mc.\n*\/\nstatic void InitializeGlobals()\n{\n\t\/\/ Initialize the X86 disassembler\n\tLLVMInitializeX86Disassembler();\n\t\n\t\/\/ We need to make a target triple for i386\n\tTriple triple(sys::getDefaultTargetTriple());\n\ttriple.setArch(Triple::getArchTypeForLLVMName(\"x86\"));\n\t\n\t\/\/ Look up this target in LLVM's registry\n\tstd::string Err;\n\tconst Target *T = TargetRegistry::lookupTarget(triple.getTriple(), Err);\n\tif (!T)\n\t{\n\t\terrs() << \"Failed to get target for \" << triple.getTriple() << \"\\n\";\n\t\tabort();\n\t}\n\t\n\tOwningPtr<const MCAsmInfo> AsmInfo(T->createMCAsmInfo(triple.getTriple()));\n\tif (!AsmInfo) {\n\t\terrs() << \"Failed to get target for target\\n\";\n\t\tabort();\n\t}\n\t\n\tOwningPtr<const MCSubtargetInfo> STI(T->createMCSubtargetInfo(triple.getTriple(), \"\", \"\"));\n\tif (!STI) {\n\t\terrs() << \"Failed to get subtarget for target\\n\";\n\t\tabort();\n\t}\n\t\n\tDisAsm = T->createMCDisassembler(*STI);\n\tif (!DisAsm) {\n\t\terrs() << \"Failed to get disassembler for target\\n\";\n\t\tabort();\n\t}\n\t\n\tOwningPtr<const MCRegisterInfo> MRI(T->createMCRegInfo(triple.getTriple()));\n\tif (!MRI) {\n\t\terrs() << \"Failed to get register info for target\\n\";\n\t\tabort();\n\t}\n\t\n\tOwningPtr<const MCInstrInfo> MII(T->createMCInstrInfo());\n\tif (!MII) {\n\t\terrs() << \"Failed to get instruction info for target\\n\";\n\t\tabort();\n\t}\n\t\n\t\n\tint AsmPrinterVariant = AsmInfo->getAssemblerDialect();\n\tInstPrinter = T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo,\n\t\t                                 *MII, *MRI, *STI);\n\tif (!InstPrinter) {\n\t\terrs() << \"Failed to get instruction printer for target\\n\";\n\t\tabort();\n\t}\n}\n\n\n\/*\n\/\/ Vends a shared MCDisassembler object.\n*\/\nstatic const MCDisassembler *GetDisassembler()\n{\n\tif (!DisAsm)\n\t\tInitializeGlobals();\n\t\n\treturn DisAsm;\n}\n\n\n\/*\n\/\/ Vends a shared MCInstPrinter object.\n*\/\nstatic MCInstPrinter *GetInstPrinter()\n{\n\tif (!InstPrinter)\n\t\tInitializeGlobals();\n\t\n\treturn InstPrinter;\n}\n\n\n\/*\n\/\/ Decodes one instruction from the buffer.\n*\/\nMCInst DecodeInstruction(cpu_t *cpu, addr_t pc, uint64_t *_size)\n{\n\tuint64_t size = 0;\n\tuint64_t index = pc;\n\tMCInst insn;\n\t\n\t\/\/ Decode the instruction\n\tDirectMemoryObject memoryObject(cpu->RAM);\n\t\n\tMCDisassembler::DecodeStatus S;\n    S = GetDisassembler()->getInstruction(insn, size, memoryObject, index,\n                                          nulls(), nulls());\n\t\n\tswitch (S)\n\t{\n\t\tcase MCDisassembler::Fail:\n\t\t\terrs() << \"Warning: Invalid instruction encoding\\n\";\n\t\t\tif (size == 0)\n\t\t\t\tsize = 1;\n\t\t\tbreak;\n\t\t\n\t\tcase MCDisassembler::SoftFail:\n\t\t\terrs() << \"Warning: Potentially undefined instruction encoding\\n\";\n\t\t\t\/\/ Fall through\n\t\t\n\t\tcase MCDisassembler::Success:\n\t\t\tbreak;\n\t}\n\t\n\tif (_size)\n\t\t*_size = size;\n\t\n\treturn insn;\n}\n\n\n\/*\n\/\/ Returns a human-readable version of the instruction.\n*\/\nstd::string DisasmInstruction(MCInst insn)\n{\n\tstd::string output;\n\traw_string_ostream sos(output);\n\tGetInstPrinter()->printInst(&insn, sos, \"\");\n\treturn sos.str();\n}\n\n\nint arch_i386_disasm_instr(cpu_t *cpu, addr_t pc, char *line, unsigned int max_line)\n{\n\tuint64_t size;\n\tMCInst insn = DecodeInstruction(cpu, pc, &size);\n\tstrlcpy(line, DisasmInstruction(insn).c_str(), max_line);\n\treturn size;\n}<commit_msg>Add the correct #import for this function.<commit_after>\/*\n * libcpu: i386_decoder.cpp\n *\/\n\n#include <llvm\/MC\/MCAsmInfo.h>\n#include <llvm\/MC\/MCDisassembler.h>\n#include <llvm\/MC\/MCInst.h>\n#include <llvm\/MC\/MCInstPrinter.h>\n#include <llvm\/MC\/MCInstrInfo.h>\n#include <llvm\/MC\/MCRegisterInfo.h>\n#include <llvm\/MC\/MCSubtargetInfo.h>\n#include <llvm\/ADT\/OwningPtr.h>\n#include <llvm\/ADT\/Triple.h>\n#include <llvm\/Support\/MemoryObject.h>\n#include <llvm\/Support\/Host.h>\n#include <llvm\/Support\/TargetRegistry.h>\n#include <llvm\/Support\/TargetSelect.h>\n#include <llvm\/Support\/raw_ostream.h>\n\n#include \"i386_arch.h\"\n\n\nstatic const MCDisassembler *DisAsm = NULL;\nstatic MCInstPrinter *InstPrinter = NULL;\n\n\n\/*\n\/\/ A subclass of LLVM's MemoryObject that wraps a pointer as an unbounded array\n\/\/ of bytes.\n\/\/ \n\/\/ When we have an MCDisassembler object, we'll point it into this MemoryObject\n\/\/ to decode an instruction. \n*\/\t \nnamespace {\n\tclass DirectMemoryObject : public MemoryObject {\n\tprivate:\n\t\tconst uint8_t *Bytes;\n\tpublic:\n\t\tDirectMemoryObject(const uint8_t *bytes) : Bytes(bytes) {}\n\n\t\tuint64_t getBase() const { return 0; }\n\t\tuint64_t getExtent() const { return 0; }\n\n\t\tint readByte(uint64_t Addr, uint8_t *Byte) const {\n\t\t\t*Byte = Bytes[Addr];\n\t\t\treturn 0;\n\t\t}\n\t};\n}\n\n\n\/*\n\/\/ Initializes our global disassembler and printer.\n\/\/ Largely ripped out of llvm-mc.\n*\/\nstatic void InitializeGlobals()\n{\n\t\/\/ Initialize the X86 disassembler\n\tLLVMInitializeX86Disassembler();\n\t\n\t\/\/ We need to make a target triple for i386\n\tTriple triple(sys::getDefaultTargetTriple());\n\ttriple.setArch(Triple::getArchTypeForLLVMName(\"x86\"));\n\t\n\t\/\/ Look up this target in LLVM's registry\n\tstd::string Err;\n\tconst Target *T = TargetRegistry::lookupTarget(triple.getTriple(), Err);\n\tif (!T)\n\t{\n\t\terrs() << \"Failed to get target for \" << triple.getTriple() << \"\\n\";\n\t\tabort();\n\t}\n\t\n\tOwningPtr<const MCAsmInfo> AsmInfo(T->createMCAsmInfo(triple.getTriple()));\n\tif (!AsmInfo) {\n\t\terrs() << \"Failed to get target for target\\n\";\n\t\tabort();\n\t}\n\t\n\tOwningPtr<const MCSubtargetInfo> STI(T->createMCSubtargetInfo(triple.getTriple(), \"\", \"\"));\n\tif (!STI) {\n\t\terrs() << \"Failed to get subtarget for target\\n\";\n\t\tabort();\n\t}\n\t\n\tDisAsm = T->createMCDisassembler(*STI);\n\tif (!DisAsm) {\n\t\terrs() << \"Failed to get disassembler for target\\n\";\n\t\tabort();\n\t}\n\t\n\tOwningPtr<const MCRegisterInfo> MRI(T->createMCRegInfo(triple.getTriple()));\n\tif (!MRI) {\n\t\terrs() << \"Failed to get register info for target\\n\";\n\t\tabort();\n\t}\n\t\n\tOwningPtr<const MCInstrInfo> MII(T->createMCInstrInfo());\n\tif (!MII) {\n\t\terrs() << \"Failed to get instruction info for target\\n\";\n\t\tabort();\n\t}\n\t\n\t\n\tint AsmPrinterVariant = AsmInfo->getAssemblerDialect();\n\tInstPrinter = T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo,\n\t\t                                 *MII, *MRI, *STI);\n\tif (!InstPrinter) {\n\t\terrs() << \"Failed to get instruction printer for target\\n\";\n\t\tabort();\n\t}\n}\n\n\n\/*\n\/\/ Vends a shared MCDisassembler object.\n*\/\nstatic const MCDisassembler *GetDisassembler()\n{\n\tif (!DisAsm)\n\t\tInitializeGlobals();\n\t\n\treturn DisAsm;\n}\n\n\n\/*\n\/\/ Vends a shared MCInstPrinter object.\n*\/\nstatic MCInstPrinter *GetInstPrinter()\n{\n\tif (!InstPrinter)\n\t\tInitializeGlobals();\n\t\n\treturn InstPrinter;\n}\n\n\n\/*\n\/\/ Decodes one instruction from the buffer.\n*\/\nMCInst DecodeInstruction(cpu_t *cpu, addr_t pc, uint64_t *_size)\n{\n\tuint64_t size = 0;\n\tuint64_t index = pc;\n\tMCInst insn;\n\t\n\t\/\/ Decode the instruction\n\tDirectMemoryObject memoryObject(cpu->RAM);\n\t\n\tMCDisassembler::DecodeStatus S;\n    S = GetDisassembler()->getInstruction(insn, size, memoryObject, index,\n                                          nulls(), nulls());\n\t\n\tswitch (S)\n\t{\n\t\tcase MCDisassembler::Fail:\n\t\t\terrs() << \"Warning: Invalid instruction encoding\\n\";\n\t\t\tif (size == 0)\n\t\t\t\tsize = 1;\n\t\t\tbreak;\n\t\t\n\t\tcase MCDisassembler::SoftFail:\n\t\t\terrs() << \"Warning: Potentially undefined instruction encoding\\n\";\n\t\t\t\/\/ Fall through\n\t\t\n\t\tcase MCDisassembler::Success:\n\t\t\tbreak;\n\t}\n\t\n\tif (_size)\n\t\t*_size = size;\n\t\n\treturn insn;\n}\n\n\n\/*\n\/\/ Returns a human-readable version of the instruction.\n*\/\nstd::string DisasmInstruction(MCInst insn)\n{\n\tstd::string output;\n\traw_string_ostream sos(output);\n\tGetInstPrinter()->printInst(&insn, sos, \"\");\n\treturn sos.str();\n}\n\n\nint arch_i386_disasm_instr(cpu_t *cpu, addr_t pc, char *line, unsigned int max_line)\n{\n\tuint64_t size;\n\tMCInst insn = DecodeInstruction(cpu, pc, &size);\n\tstrlcpy(line, DisasmInstruction(insn).c_str(), max_line);\n\treturn size;\n}\n<|endoftext|>"}
{"text":"<commit_before>feb17abd-2e4e-11e5-8364-28cfe91dbc4b<commit_msg>feb9218f-2e4e-11e5-bf1d-28cfe91dbc4b<commit_after>feb9218f-2e4e-11e5-bf1d-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>93432f0f-2d3f-11e5-8da1-c82a142b6f9b<commit_msg>939d2ab8-2d3f-11e5-b2ff-c82a142b6f9b<commit_after>939d2ab8-2d3f-11e5-b2ff-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>338c17ac-5216-11e5-8244-6c40088e03e4<commit_msg>3392e890-5216-11e5-a77f-6c40088e03e4<commit_after>3392e890-5216-11e5-a77f-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>764cf764-5216-11e5-8144-6c40088e03e4<commit_msg>76533e4c-5216-11e5-a4c2-6c40088e03e4<commit_after>76533e4c-5216-11e5-a4c2-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>e952e63e-585a-11e5-af17-6c40088e03e4<commit_msg>e9596194-585a-11e5-ac70-6c40088e03e4<commit_after>e9596194-585a-11e5-ac70-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>5e58942a-2d16-11e5-af21-0401358ea401<commit_msg>5e58942b-2d16-11e5-af21-0401358ea401<commit_after>5e58942b-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>e06fdf59-313a-11e5-9e5d-3c15c2e10482<commit_msg>e075b205-313a-11e5-86f8-3c15c2e10482<commit_after>e075b205-313a-11e5-86f8-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>6f91b42b-4b02-11e5-8db3-28cfe9171a43<commit_msg>oh my, I hate charles<commit_after>6f9e93c0-4b02-11e5-bd32-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: idlc.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2004-06-03 15:06: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 _IDLC_IDLC_HXX_\n#define _IDLC_IDLC_HXX_\n\n#ifndef _IDLC_IDLCTYPES_HXX_\n#include <idlc\/idlctypes.hxx>\n#endif\n#ifndef _IDLC_ASTSTACK_HXX_\n#include <idlc\/aststack.hxx>\n#endif\n#ifndef _IDLC_OPTIONS_HXX_\n#include <idlc\/options.hxx>\n#endif\n\n#ifdef SAL_UNX\n#define SEPARATOR '\/'\n#define PATH_SEPARATOR \"\/\"\n#else\n#define SEPARATOR '\\\\'\n#define PATH_SEPARATOR \"\\\\\"\n#endif\n\nclass AstInterface;\nclass AstModule;\nclass AstType;\nclass Options;\nclass ErrorHandler;\n\nclass Idlc\n{\npublic:\n    Idlc(Options* pOptions);\n    virtual ~Idlc();\n\n    void init();\n\n    Options* getOptions()\n        { return m_pOptions; }\n    AstStack* scopes()\n        { return m_pScopes; }\n    AstModule* getRoot()\n        { return m_pRoot; }\n    ErrorHandler* error()\n        { return m_pErrorHandler; }\n    const ::rtl::OString& getFileName()\n        { return m_fileName; }\n    void setFileName(const ::rtl::OString& fileName)\n        { m_fileName = fileName; }\n    const ::rtl::OString& getMainFileName()\n        { return m_mainFileName; }\n    void setMainFileName(const ::rtl::OString& mainFileName)\n        { m_mainFileName = mainFileName; }\n    const ::rtl::OString& getRealFileName()\n        { return m_realFileName; }\n    void setRealFileName(const ::rtl::OString& realFileName)\n        { m_realFileName = realFileName; }\n    const ::rtl::OString& getDocumentation()\n        {\n            m_bIsDocValid = sal_False;\n            return m_documentation;\n        }\n    void setDocumentation(const ::rtl::OString& documentation)\n        {\n            m_documentation = documentation;\n            m_bIsDocValid = sal_True;\n        }\n    sal_Bool isDocValid();\n    sal_Bool isInMainFile()\n        { return m_bIsInMainfile; }\n    void setInMainfile(sal_Bool bInMainfile)\n        { m_bIsInMainfile = bInMainfile; }\n    sal_uInt32 getErrorCount()\n        { return m_errorCount; }\n    void setErrorCount(sal_uInt32 errorCount)\n        { m_errorCount = errorCount; }\n    void incErrorCount()\n        { m_errorCount++; }\n    sal_uInt32 getWarningCount()\n        { return m_warningCount; }\n    void setWarningCount(sal_uInt32 warningCount)\n        { m_warningCount = warningCount; }\n    void incWarningCount()\n        { m_warningCount++; }\n    sal_uInt32 getLineNumber()\n        { return m_lineNumber; }\n    void setLineNumber(sal_uInt32 lineNumber)\n        { m_lineNumber = lineNumber; }\n    void incLineNumber()\n        { m_lineNumber++; }\n    ParseState getParseState()\n        { return m_parseState; }\n    void setParseState(ParseState parseState)\n        { m_parseState = parseState; }\n\n    void insertInclude(const ::rtl::OString& inc)\n        { m_includes.insert(inc); }\n    StringSet* getIncludes()\n        { return &m_includes; }\n\n    void setPublished(bool published) { m_published = published; }\n    bool isPublished() const { return m_published; }\n\n    void reset();\nprivate:\n    Options*            m_pOptions;\n    AstStack*           m_pScopes;\n    AstModule*          m_pRoot;\n    ErrorHandler*       m_pErrorHandler;\n    ::rtl::OString      m_fileName;\n    ::rtl::OString      m_mainFileName;\n    ::rtl::OString      m_realFileName;\n    ::rtl::OString      m_documentation;\n    sal_Bool            m_bIsDocValid;\n    sal_Bool            m_bGenerateDoc;\n    sal_Bool            m_bIsInMainfile;\n    bool                m_published;\n    sal_uInt32          m_errorCount;\n    sal_uInt32          m_warningCount;\n    sal_uInt32          m_lineNumber;\n    ParseState          m_parseState;\n    StringSet           m_includes;\n};\n\nsal_Int32 compileFile(const ::rtl::OString * pathname);\n    \/\/ a null pathname means stdin\nsal_Int32 produceFile(const ::rtl::OString& filenameBase);\n    \/\/ filenameBase is filename without \".idl\"\nvoid removeIfExists(const ::rtl::OString& pathname);\n\n::rtl::OString makeTempName(const ::rtl::OString& prefix, const ::rtl::OString& postfix);\nsal_Bool copyFile(const ::rtl::OString* source, const ::rtl::OString& target);\n    \/\/ a null source means stdin\n\nsal_Bool isFileUrl(const ::rtl::OString& fileName);\n::rtl::OString convertToAbsoluteSystemPath(const ::rtl::OString& fileName);\n::rtl::OString convertToFileUrl(const ::rtl::OString& fileName);\n\nIdlc* SAL_CALL idlc();\nIdlc* SAL_CALL setIdlc(Options* pOptions);\n\nAstDeclaration const * resolveTypedefs(AstDeclaration const * type);\n\nAstInterface const * resolveInterfaceTypedefs(AstType const * type);\n\n#endif \/\/ _IDLC_IDLC_HXX_\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.5.32); FILE MERGED 2005\/09\/05 17:39:35 rt 1.5.32.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: idlc.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 18:04: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 _IDLC_IDLC_HXX_\n#define _IDLC_IDLC_HXX_\n\n#ifndef _IDLC_IDLCTYPES_HXX_\n#include <idlc\/idlctypes.hxx>\n#endif\n#ifndef _IDLC_ASTSTACK_HXX_\n#include <idlc\/aststack.hxx>\n#endif\n#ifndef _IDLC_OPTIONS_HXX_\n#include <idlc\/options.hxx>\n#endif\n\n#ifdef SAL_UNX\n#define SEPARATOR '\/'\n#define PATH_SEPARATOR \"\/\"\n#else\n#define SEPARATOR '\\\\'\n#define PATH_SEPARATOR \"\\\\\"\n#endif\n\nclass AstInterface;\nclass AstModule;\nclass AstType;\nclass Options;\nclass ErrorHandler;\n\nclass Idlc\n{\npublic:\n    Idlc(Options* pOptions);\n    virtual ~Idlc();\n\n    void init();\n\n    Options* getOptions()\n        { return m_pOptions; }\n    AstStack* scopes()\n        { return m_pScopes; }\n    AstModule* getRoot()\n        { return m_pRoot; }\n    ErrorHandler* error()\n        { return m_pErrorHandler; }\n    const ::rtl::OString& getFileName()\n        { return m_fileName; }\n    void setFileName(const ::rtl::OString& fileName)\n        { m_fileName = fileName; }\n    const ::rtl::OString& getMainFileName()\n        { return m_mainFileName; }\n    void setMainFileName(const ::rtl::OString& mainFileName)\n        { m_mainFileName = mainFileName; }\n    const ::rtl::OString& getRealFileName()\n        { return m_realFileName; }\n    void setRealFileName(const ::rtl::OString& realFileName)\n        { m_realFileName = realFileName; }\n    const ::rtl::OString& getDocumentation()\n        {\n            m_bIsDocValid = sal_False;\n            return m_documentation;\n        }\n    void setDocumentation(const ::rtl::OString& documentation)\n        {\n            m_documentation = documentation;\n            m_bIsDocValid = sal_True;\n        }\n    sal_Bool isDocValid();\n    sal_Bool isInMainFile()\n        { return m_bIsInMainfile; }\n    void setInMainfile(sal_Bool bInMainfile)\n        { m_bIsInMainfile = bInMainfile; }\n    sal_uInt32 getErrorCount()\n        { return m_errorCount; }\n    void setErrorCount(sal_uInt32 errorCount)\n        { m_errorCount = errorCount; }\n    void incErrorCount()\n        { m_errorCount++; }\n    sal_uInt32 getWarningCount()\n        { return m_warningCount; }\n    void setWarningCount(sal_uInt32 warningCount)\n        { m_warningCount = warningCount; }\n    void incWarningCount()\n        { m_warningCount++; }\n    sal_uInt32 getLineNumber()\n        { return m_lineNumber; }\n    void setLineNumber(sal_uInt32 lineNumber)\n        { m_lineNumber = lineNumber; }\n    void incLineNumber()\n        { m_lineNumber++; }\n    ParseState getParseState()\n        { return m_parseState; }\n    void setParseState(ParseState parseState)\n        { m_parseState = parseState; }\n\n    void insertInclude(const ::rtl::OString& inc)\n        { m_includes.insert(inc); }\n    StringSet* getIncludes()\n        { return &m_includes; }\n\n    void setPublished(bool published) { m_published = published; }\n    bool isPublished() const { return m_published; }\n\n    void reset();\nprivate:\n    Options*            m_pOptions;\n    AstStack*           m_pScopes;\n    AstModule*          m_pRoot;\n    ErrorHandler*       m_pErrorHandler;\n    ::rtl::OString      m_fileName;\n    ::rtl::OString      m_mainFileName;\n    ::rtl::OString      m_realFileName;\n    ::rtl::OString      m_documentation;\n    sal_Bool            m_bIsDocValid;\n    sal_Bool            m_bGenerateDoc;\n    sal_Bool            m_bIsInMainfile;\n    bool                m_published;\n    sal_uInt32          m_errorCount;\n    sal_uInt32          m_warningCount;\n    sal_uInt32          m_lineNumber;\n    ParseState          m_parseState;\n    StringSet           m_includes;\n};\n\nsal_Int32 compileFile(const ::rtl::OString * pathname);\n    \/\/ a null pathname means stdin\nsal_Int32 produceFile(const ::rtl::OString& filenameBase);\n    \/\/ filenameBase is filename without \".idl\"\nvoid removeIfExists(const ::rtl::OString& pathname);\n\n::rtl::OString makeTempName(const ::rtl::OString& prefix, const ::rtl::OString& postfix);\nsal_Bool copyFile(const ::rtl::OString* source, const ::rtl::OString& target);\n    \/\/ a null source means stdin\n\nsal_Bool isFileUrl(const ::rtl::OString& fileName);\n::rtl::OString convertToAbsoluteSystemPath(const ::rtl::OString& fileName);\n::rtl::OString convertToFileUrl(const ::rtl::OString& fileName);\n\nIdlc* SAL_CALL idlc();\nIdlc* SAL_CALL setIdlc(Options* pOptions);\n\nAstDeclaration const * resolveTypedefs(AstDeclaration const * type);\n\nAstInterface const * resolveInterfaceTypedefs(AstType const * type);\n\n#endif \/\/ _IDLC_IDLC_HXX_\n\n<|endoftext|>"}
{"text":"<commit_before>758dd3d0-2d53-11e5-baeb-247703a38240<commit_msg>758e5256-2d53-11e5-baeb-247703a38240<commit_after>758e5256-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>7320e64c-2e4f-11e5-8fae-28cfe91dbc4b<commit_msg>7327758f-2e4f-11e5-998d-28cfe91dbc4b<commit_after>7327758f-2e4f-11e5-998d-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>a1d4fbfa-2747-11e6-9e6b-e0f84713e7b8<commit_msg>We apologise for the previous fix. Those responsible have been sacked<commit_after>a1efb397-2747-11e6-9417-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>eeeceb4a-327f-11e5-bce8-9cf387a8033e<commit_msg>eef679bd-327f-11e5-95c6-9cf387a8033e<commit_after>eef679bd-327f-11e5-95c6-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>158d89c0-585b-11e5-8338-6c40088e03e4<commit_msg>15948b62-585b-11e5-847c-6c40088e03e4<commit_after>15948b62-585b-11e5-847c-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>c8282bc5-2747-11e6-94c7-e0f84713e7b8<commit_msg>( ͡° ͜ʖ ͡°)<commit_after>c8449294-2747-11e6-8d2c-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>646cf602-2fa5-11e5-b5bf-00012e3d3f12<commit_msg>646ecac6-2fa5-11e5-957d-00012e3d3f12<commit_after>646ecac6-2fa5-11e5-957d-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>1a011606-2f67-11e5-b9e1-6c40088e03e4<commit_msg>1a07df0c-2f67-11e5-a032-6c40088e03e4<commit_after>1a07df0c-2f67-11e5-a032-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>5f894a1f-2d16-11e5-af21-0401358ea401<commit_msg>5f894a20-2d16-11e5-af21-0401358ea401<commit_after>5f894a20-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>5ae7ec31-2d16-11e5-af21-0401358ea401<commit_msg>5ae7ec32-2d16-11e5-af21-0401358ea401<commit_after>5ae7ec32-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>3b2b3d30-5216-11e5-87bc-6c40088e03e4<commit_msg>3b320c14-5216-11e5-8bb4-6c40088e03e4<commit_after>3b320c14-5216-11e5-8bb4-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>35079951-2e4f-11e5-9261-28cfe91dbc4b<commit_msg>350fd32e-2e4f-11e5-ae35-28cfe91dbc4b<commit_after>350fd32e-2e4f-11e5-ae35-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>5ef0e094-2e3a-11e5-9764-c03896053bdd<commit_msg>5f01d3a4-2e3a-11e5-924a-c03896053bdd<commit_after>5f01d3a4-2e3a-11e5-924a-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>a56e4b00-4b02-11e5-b240-28cfe9171a43<commit_msg>Put the thingie in the thingie<commit_after>a57a2157-4b02-11e5-b536-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>e40a6f68-313a-11e5-82c9-3c15c2e10482<commit_msg>e4105373-313a-11e5-b6f9-3c15c2e10482<commit_after>e4105373-313a-11e5-b6f9-3c15c2e10482<|endoftext|>"}
{"text":"<commit_before>#ifndef CUSTOMPROJECTION_HH\n#define CUSTOMPROJECTION_HH\n\n#include <dune\/fem\/quadrature\/cachingquadrature.hh>\n#include <dune\/fem\/operator\/common\/operator.hh>\n#include <dune\/fem\/function\/common\/discretefunction.hh>\n#include <dune\/fem\/function\/common\/discretefunctionadapter.hh>\n#include <dune\/fem\/operator\/1order\/localmassmatrix.hh>\n\nnamespace Stuff {\n\n\/** A custom projection of an analytical function that uses a non-standard evalute signature:\\n\n\t\t<pre>template < class IntersectionIteratorType >\\n\n\t\tvoid evaluate( const DomainType& arg, RangeType& ret, const IntersectionIteratorType& faceIter ) const<pre>\\n\n\t\\note example being our boundary functions\n\t\\note output currently somewhat meaningless\n\t\\see analyticaldata.hh\n**\/\n\nclass CustomProjection {\n\npublic:\n\ttemplate < class OriginFunctionType, class DestinationFunctionType >\n\tstatic void project (const OriginFunctionType& f, DestinationFunctionType& discFunc)\n\t{\n\t\ttypedef typename DestinationFunctionType::FunctionSpaceType\n\t\t\tDiscreteFunctionSpace;\n\t\ttypedef typename DiscreteFunctionSpace::GridPartType\n\t\t\tGridPart;\n\t\ttypedef typename GridPart::template Codim< 0 >::IteratorType\n\t\t\tEntityIteratorType;\n\t\ttypedef typename GridPart::GridType::template Codim< 0 >::Entity\n\t\t\tEntityType;\n\t\ttypedef typename GridPart::IntersectionIteratorType\n\t\t\tIntersectionIteratorType;\n\t\ttypedef typename IntersectionIteratorType::EntityPointer\n\t\t\tEntityPointer;\n\t\ttypedef typename DestinationFunctionType::LocalFunctionType\n\t\t\tLocalFunctionType;\n\t\ttypedef Dune::CachingQuadrature< GridPart, 1 >\n\t\t\tFaceQuadratureType;\n\t\ttypedef typename DiscreteFunctionSpace::BaseFunctionSetType\n\t\t\tBaseFunctionSetType;\n\t\ttypedef typename DiscreteFunctionSpace::RangeType\n\t\t\tRangeType;\n\t\tconst DiscreteFunctionSpace& space_ = discFunc.space();\n\t\tconst GridPart& gridPart_ = space_.gridPart();\n\t\tRangeType phi (0.0);\n\t\tEntityIteratorType entityItEndLog = space_.end();\n\t\tfor (   EntityIteratorType it = space_.begin();\n\t\t\t\tit != entityItEndLog;\n\t\t\t\t++it )\n\t\t{\n\t\t\tEntityType& e = *it;\n\t\t\tLocalFunctionType lf = discFunc.localFunction( e );\n\t\t\tBaseFunctionSetType baseFunctionset = space_.baseFunctionSet( *it );\n\t\t\tunsigned int intersection_count = 0;\n\t\t\tIntersectionIteratorType intItEnd = gridPart_.iend( *it );\n\t\t\tfor (   IntersectionIteratorType intIt = gridPart_.ibegin( *it );\n\t\t\t\t\tintIt != intItEnd;\n\t\t\t\t\t++intIt ) {\n\t\t\t\tintersection_count++;\n\t\t\t\tFaceQuadratureType faceQuadrature( gridPart_,\n\t\t\t\t\t\t\t\t\t\t\t\t   intIt,\n\t\t\t\t\t\t\t\t\t\t\t\t   ( 4 * space_.order() ) + 1,\n\t\t\t\t\t\t\t\t\t\t\t\t   FaceQuadratureType::INSIDE );\n\t\t\t\ttypename DestinationFunctionType::RangeType ret;\n\t\t\t\tfor ( int qP = 0; qP < faceQuadrature.nop(); ++qP ) {\n\t\t\t\t\tconst double intel =\n\t\t\t\t\t\t faceQuadrature.weight(qP) * e.geometry().integrationElement( faceQuadrature.point(qP) ); \/\/ general case\n\n\t\t\t\t\tif ( intIt.boundary() )\n\t\t\t\t\t{\n\t\t\t\t\t\tf.evaluate( faceQuadrature.point(qP), ret, intIt );\n\n\t\t\t\t\t\tfor ( int i = 0; i < baseFunctionset.numBaseFunctions(); ++i ) {\n\t\t\t\t\t\t\tbaseFunctionset.evaluate(i, faceQuadrature[qP], phi);\n\t\t\t\t\t\t\tlf[i] += intel * (ret * phi) ;\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}\n};\n\n}\/\/end namespace Stuff\n#endif \/\/ CUSTOMPROJECTION_HH\n<commit_msg>fix custom projection compile (still logical not functioning)<commit_after>#ifndef CUSTOMPROJECTION_HH\n#define CUSTOMPROJECTION_HH\n\n#include <dune\/fem\/quadrature\/cachingquadrature.hh>\n#include <dune\/fem\/operator\/common\/operator.hh>\n#include <dune\/fem\/function\/common\/discretefunction.hh>\n#include <dune\/fem\/function\/common\/discretefunctionadapter.hh>\n#include <dune\/fem\/operator\/1order\/localmassmatrix.hh>\n\nnamespace Stuff {\n\n\/** A custom projection of an analytical function that uses a non-standard evalute signature:\\n\n\t\t<pre>template < class IntersectionIteratorType >\\n\n\t\tvoid evaluate( const DomainType& arg, RangeType& ret, const IntersectionIteratorType& faceIter ) const<pre>\\n\n\t\\note example being our boundary functions\n\t\\note output currently somewhat meaningless\n\t\\see analyticaldata.hh\n**\/\n\nclass CustomProjection {\n\npublic:\n\ttemplate < class OriginFunctionType, class DestinationFunctionType >\n\tstatic void project (const OriginFunctionType& f, DestinationFunctionType& discFunc)\n\t{\n\t\tconst double time = 0.0;\n\t\ttypedef typename DestinationFunctionType::FunctionSpaceType\n\t\t\tDiscreteFunctionSpace;\n\t\ttypedef typename DiscreteFunctionSpace::GridPartType\n\t\t\tGridPart;\n\t\ttypedef typename GridPart::template Codim< 0 >::IteratorType\n\t\t\tEntityIteratorType;\n\t\ttypedef typename GridPart::GridType::template Codim< 0 >::Entity\n\t\t\tEntityType;\n\t\ttypedef typename GridPart::IntersectionIteratorType\n\t\t\tIntersectionIteratorType;\n\t\ttypedef typename IntersectionIteratorType::EntityPointer\n\t\t\tEntityPointer;\n\t\ttypedef typename DestinationFunctionType::LocalFunctionType\n\t\t\tLocalFunctionType;\n\t\ttypedef Dune::CachingQuadrature< GridPart, 1 >\n\t\t\tFaceQuadratureType;\n\t\ttypedef typename DiscreteFunctionSpace::BaseFunctionSetType\n\t\t\tBaseFunctionSetType;\n\t\ttypedef typename DiscreteFunctionSpace::RangeType\n\t\t\tRangeType;\n\t\tconst DiscreteFunctionSpace& space_ = discFunc.space();\n\t\tconst GridPart& gridPart_ = space_.gridPart();\n\t\tRangeType phi (0.0);\n\t\tEntityIteratorType entityItEndLog = space_.end();\n\t\tfor (   EntityIteratorType it = space_.begin();\n\t\t\t\tit != entityItEndLog;\n\t\t\t\t++it )\n\t\t{\n\t\t\tEntityType& e = *it;\n\t\t\tLocalFunctionType lf = discFunc.localFunction( e );\n\t\t\tBaseFunctionSetType baseFunctionset = space_.baseFunctionSet( *it );\n\t\t\tunsigned int intersection_count = 0;\n\t\t\tIntersectionIteratorType intItEnd = gridPart_.iend( *it );\n\t\t\tfor (   IntersectionIteratorType intIt = gridPart_.ibegin( *it );\n\t\t\t\t\tintIt != intItEnd;\n\t\t\t\t\t++intIt ) {\n\t\t\t\tintersection_count++;\n\t\t\t\tFaceQuadratureType faceQuadrature( gridPart_,\n\t\t\t\t\t\t\t\t\t\t\t\t   *intIt,\n\t\t\t\t\t\t\t\t\t\t\t\t   ( 4 * space_.order() ) + 1,\n\t\t\t\t\t\t\t\t\t\t\t\t   FaceQuadratureType::INSIDE );\n\t\t\t\ttypename DestinationFunctionType::RangeType ret;\n\t\t\t\tfor ( size_t qP = 0; qP < faceQuadrature.nop(); ++qP ) {\n\t\t\t\t\tconst double intel =\n\t\t\t\t\t\t faceQuadrature.weight(qP) * e.geometry().integrationElement( faceQuadrature.point(qP) ); \/\/ general case\n\n\t\t\t\t\tif ( intIt->boundary() )\n\t\t\t\t\t{\n\t\t\t\t\t\tf.evaluate( faceQuadrature.point(qP), ret, *intIt );\n\n\t\t\t\t\t\tfor ( int i = 0; i < baseFunctionset.numBaseFunctions(); ++i ) {\n\t\t\t\t\t\t\tbaseFunctionset.evaluate(i, faceQuadrature[qP], phi);\n\t\t\t\t\t\t\tlf[i] += intel * (ret * phi) ;\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}\n};\n\n}\/\/end namespace Stuff\n#endif \/\/ CUSTOMPROJECTION_HH\n<|endoftext|>"}
{"text":"<commit_before>a239c6b8-327f-11e5-8d36-9cf387a8033e<commit_msg>a23fbb75-327f-11e5-87f4-9cf387a8033e<commit_after>a23fbb75-327f-11e5-87f4-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>\/* ux++ - ux implementation for C++ *\/\n\n\/* LICENSE - The MIT License (MIT)\n\nCopyright (c) 2013 Tomona Nanase\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject 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, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#ifndef HANDLETYPE_HPP\n#define\tHANDLETYPE_HPP\n\nnamespace uxpp {\n\n  \/**\n   * 内部で扱われるハンドルのタイプを表す列挙体です。\n   *\/\n  enum class HandleType {\n    \/**\n     * ゼロのゲートを持ち、発音されないノートを表します。\n     *\/\n    zeroGate = 0,\n\n    \/**\n     * パートまたはマスターの各パラメータをリセットします。\n     *\/\n    reset = 1,\n\n    \/**\n     * ノートのエンベロープをサイレンス状態に移行させ、無音状態にします。\n     *\/\n    silence = 2,\n\n    \/**\n     * ノートのエンベロープをリリース状態に移行させます。\n     *\/\n    noteOff = 3,\n\n    \/**\n     * ボリューム (音量) を変更します。\n     *\/\n    volume = 4,\n\n    \/**\n     * パンポット (定位) を変更します。\n     *\/\n    panpot = 5,\n\n    \/**\n     * ビブラートに関するパラメータを設定します。\n     *\/\n    vibrate = 6,\n\n    \/**\n     * パートに波形を割り当てます。\n     *\/\n    waveform = 7,\n\n    \/**\n     * 波形のパラメータを編集します。\n     *\/\n    editWaveform = 8,\n    \n    \/**\n     * パートの音量エンベロープを変更します。\n     *\/\n    envelope = 9,\n\n    \/**\n     * パートのファインチューン値を変更します。\n     *\/\n    fineTune = 10,\n\n    \/**\n     * パートの発音ノートキーをシフトします。\n     *\/\n    keyShift = 11,\n\n    \/**\n     * ポルタメント効果に関するパラメータを設定します。\n     *\/\n    portament = 12,\n\n    \/**\n     * パートを指定されたノートまたは周波数でアタック状態にします。\n     *\/\n    noteOn = 13,\n  };\n}\n\n#endif\t\/* HANDLETYPE_HPP *\/\n\n<commit_msg>HandleType列挙体に対する文字列マップオブジェクトを追加<commit_after>\/* ux++ - ux implementation for C++ *\/\n\n\/* LICENSE - The MIT License (MIT)\n\nCopyright (c) 2013 Tomona Nanase\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject 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, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#ifndef HANDLETYPE_HPP\n#define\tHANDLETYPE_HPP\n\nnamespace uxpp {\n\n  \/**\n   * 内部で扱われるハンドルのタイプを表す列挙体です。\n   *\/\n  enum class HandleType {\n    \/**\n     * ゼロのゲートを持ち、発音されないノートを表します。\n     *\/\n    zeroGate = 0,\n\n    \/**\n     * パートまたはマスターの各パラメータをリセットします。\n     *\/\n    reset = 1,\n\n    \/**\n     * ノートのエンベロープをサイレンス状態に移行させ、無音状態にします。\n     *\/\n    silence = 2,\n\n    \/**\n     * ノートのエンベロープをリリース状態に移行させます。\n     *\/\n    noteOff = 3,\n\n    \/**\n     * ボリューム (音量) を変更します。\n     *\/\n    volume = 4,\n\n    \/**\n     * パンポット (定位) を変更します。\n     *\/\n    panpot = 5,\n\n    \/**\n     * ビブラートに関するパラメータを設定します。\n     *\/\n    vibrate = 6,\n\n    \/**\n     * パートに波形を割り当てます。\n     *\/\n    waveform = 7,\n\n    \/**\n     * 波形のパラメータを編集します。\n     *\/\n    editWaveform = 8,\n    \n    \/**\n     * パートの音量エンベロープを変更します。\n     *\/\n    envelope = 9,\n\n    \/**\n     * パートのファインチューン値を変更します。\n     *\/\n    fineTune = 10,\n\n    \/**\n     * パートの発音ノートキーをシフトします。\n     *\/\n    keyShift = 11,\n\n    \/**\n     * ポルタメント効果に関するパラメータを設定します。\n     *\/\n    portament = 12,\n\n    \/**\n     * パートを指定されたノートまたは周波数でアタック状態にします。\n     *\/\n    noteOn = 13,\n  };\n  \n  const std::unordered_map<std::string, HandleType>\n          HandleTypeString = {\n    {\"zeroGate\", HandleType::zeroGate},\n    {\"reset\", HandleType::reset},\n    {\"silence\", HandleType::silence},\n    {\"noteOff\", HandleType::noteOff},\n    {\"volume\", HandleType::volume},\n    {\"panpot\", HandleType::panpot},\n    {\"vibrate\", HandleType::vibrate},\n    {\"waveform\", HandleType::waveform},\n    {\"editWaveform\", HandleType::editWaveform},\n    {\"envelope\", HandleType::envelope},\n    {\"fineTune\", HandleType::fineTune},\n    {\"keyShift\", HandleType::keyShift},\n    {\"portament\", HandleType::portament},\n    {\"noteOn\", HandleType::noteOn},\n  };\n}\n\n#endif\t\/* HANDLETYPE_HPP *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\nCopyright (c) 2014, Vlad Mesco\r\nAll rights reserved.\r\n\r\nRedistribution and use in source and binary forms, with or without\r\nmodification, are permitted provided that the following conditions are met:\r\n\r\n* Redistributions of source code must retain the above copyright notice, this\r\n  list of conditions and the following disclaimer.\r\n\r\n* Redistributions in binary form must reproduce the above copyright notice,\r\n  this list of conditions and the following disclaimer in the documentation\r\n  and\/or other materials provided with the distribution.\r\n\r\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\r\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\r\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\r\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\r\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\r\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n*\/\n\n\/\/ DISCLAIMER: this is pretty much prototype\/test code :D\n#include <cstdlib>\n#include <cmath>\n#include <iostream>\n#include \"core.hxx\"\n#include \"drawing.hxx\"\n\nstatic bool moving = false, moving2 = false;\nstatic float dlta = 0.1, dlta2 = 0.f;\n\nstatic float jx = 0, jy = 0, jz = 0;\n\nstatic float rx = 0, ry = 0;\nstatic Point3D ppos(0, 0.5, -2);\n\nstatic enum {\n    FLY,\n    GRAVITY\n} mvmntType = FLY;\n\n#define ngmap (10)\n#define mgmap (10)\nstatic float gmap[mgmap][ngmap] = {\n    { -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -6.f, -6.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -6.f, -7.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -5.f, -6.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -5.f, -5.f, -5.f, -5.f, -6.f, -6.f, -6.f, -6.f, -6.f },\n    { -4.f, -4.f, -5.f, -5.f, -6.f, -6.f, -7.f, -7.f, -7.f, -7.f },\n    { -3.f, -4.f, -4.f, -5.f, -6.f, -7.f, -7.f, -8.f, -8.f, -8.f },\n    { -3.f, -3.f, -4.f, -5.f, -6.f, -7.f, -8.f, -8.f, -8.f, -8.f },\n    { -2.f, -3.f, -4.f, -5.f, -6.f, -7.f, -8.f, -8.f, -8.f, -8.f },\n};\n\nstatic void drawMap(Drawing& dwg)\n{\n    struct {\n        float first;\n        float step;\n    } \n    nn = { -((float)ngmap) \/ 2.f, 1.f },\n    mm = { -((float)mgmap) \/ 2.f, 1.f };\n\n    dwg.SetColor(Drawing::WHITE);\n    for(size_t i = 0; i < ngmap - 1; ++i) {\n        for(size_t j = 0; j < mgmap - 1; ++j) {\n            dwg.MoveTo(Point3D(nn.first + i * nn.step, gmap[i][j], mm.first + j * mm.step));\n            dwg.LineTo(Point3D(nn.first + i * nn.step, gmap[i][j + 1], mm.first + (j + 1) * mm.step));\n            dwg.LineTo(Point3D(nn.first + (i + 1) * nn.step, gmap[i + 1][j + 1], mm.first + (j + 1) * mm.step));\n            dwg.LineTo(Point3D(nn.first + (i + 1) * nn.step, gmap[i + 1][j], mm.first + j * mm.step));\n            dwg.LineTo(Point3D(nn.first + i * nn.step, gmap[i][j], mm.first + j * mm.step));\n        }\n    }\n}\n\nstatic void drawScene(Drawing& dwg)\n{\n    dwg.MoveCamera(\n        ppos,\n        -ry,\n        -rx);\n\n    dwg.SetColor(Drawing::WHITE);\n    dwg.SetRotations(jx, jy, jz);\n    dwg.MoveTo(Point3D(0, 1, -5));\n    dwg.WireCube(1);\n    dwg.SetRotations(-jx, -jy, -jz);\n    dwg.SetColor(Drawing::YELLOW);\n    dwg.WireCube(0.5);\n\n    dwg.SetColor(Drawing::CYAN);\n    dwg.MoveTo(Point3D(-5, 0, 0));\n    dwg.LineTo(Point3D(5, 0, 0));\n    dwg.SetColor(Drawing::YELLOW);\n    dwg.MoveTo(Point3D(0, -5, 0));\n    dwg.LineTo(Point3D(0, 5, 0));\n    dwg.SetColor(Drawing::CYAN);\n    dwg.MoveTo(Point3D(0, 0, -5));\n    dwg.LineTo(Point3D(0, 0, 5));\n\n    dwg.MoveTo(Point3D(0, 0, 0));\n    dwg.SetColor(Drawing::SEABLUE);\n    dwg.SetRotations(0, 0, 45);\n    dwg.Quad(1, 1);\n    dwg.SetColor(Drawing::CYAN);\n    dwg.WireQuad(1, 1);\n    \n    dwg.MoveTo(Point3D(0, 0, 0));\n    dwg.SetColor(Drawing::SEAGREEN);\n    dwg.SetRotations(90, 0, 0);\n    dwg.Quad(0.7, 0.7);\n    dwg.SetColor(Drawing::LIME);\n    dwg.WireQuad(0.7, 0.7);\n    \n    dwg.MoveTo(Point3D(0, 0, 0));\n    dwg.SetColor(Drawing::SEAYELLOW);\n    dwg.SetRotations(0, 90, 0);\n    dwg.Quad(0.4, 0.4);\n    dwg.SetColor(Drawing::YELLOW);\n    dwg.WireQuad(0.4, 0.4);\n\n    dwg.MoveTo(Point3D(0, 0, 2));\n    dwg.SetTexture(1);\n    dwg.SetTextureScale(0, 0);\n    dwg.SetRotations(0, 90, 90);\n    dwg.TextureQuad(10, 5);\n\n    dwg.SetTexture(0);\n    dwg.MoveTo(Point3D(0, 0, 4));\n    dwg.SetTextureScale(1, 1);\n    dwg.SetRotations(0, 0, 0);\n    dwg.TextureQuad(10, 1);\n    dwg.MoveTo(Point3D(5, 0, 4));\n    dwg.SetTextureScale(1, 1);\n    dwg.SetRotations(0, 0, 0);\n    dwg.TextureQuad(10, 1);\n    \n    dwg.SetTexture(1);\n    dwg.MoveTo(Point3D(10, 0, 5.5));\n    dwg.SetTextureScale(1, 1);\n    dwg.SetRotations(0, 0, 0);\n    dwg.TextureQuad(10, 1);\n    dwg.SetColor(Drawing::WHITE);\n    dwg.WireQuad(10, 1);\n\n    dwg.MoveTo(Point3D(20, 0, 5.5));\n    dwg.SetTextureScale(1, 1);\n    dwg.SetRotations(0, 0, 0);\n    dwg.TextureQuad(10, 1);\n    dwg.SetColor(Drawing::WHITE);\n    dwg.WireQuad(10, 1);\n\n    \/\/ camera facing sprites\n    dwg.MoveTo(Point3D(-10, 1, -1));\n    dwg.SetTextureScale(0, 0);\n    dwg.SetTexture(0);\n    dwg.SpriteQuad(1, 1);\n    \n    dwg.MoveTo(Point3D(-10, 1, -3));\n    dwg.SetTexture(1);\n    dwg.SpriteQuad(1, 1);\n\n    \/\/ cylindrical billboard\n    dwg.MoveTo(Point3D(-10, 1, 3));\n    dwg.SetTexture(0);\n    dwg.SetRotations(90, 0, -ry);\n    dwg.TextureQuad(1, 1);\n\n    \/\/ in case texture's missing\n    dwg.MoveTo(Point3D(-10, 1, -5));\n    dwg.SetTexture(-1);\n    dwg.SpriteQuad(1, 2);\n\n    drawMap(dwg);\n\n    if(mvmntType == GRAVITY) {\n        dwg.SetRotations(0, 0, 0);\n        dwg.SetColor(Drawing::LIME);\n        Point3D p(-ppos.x, ppos.y - 1.f, -ppos.z);\n        dwg.MoveTo(p);\n        dwg.Quad(0.05, 0.05);\n    }\n}\n\nstatic void onmousedown(int x, int y, int btn)\n{\n    if(btn == 1) {\n    }\n    if(btn == 2) {\n    }\n    if(btn == 3) {\n    }\n}\n\nstatic void onmouseup(int x, int y, int btn)\n{\n}\n\nstatic void onmousemove(int dx, int dy)\n{\n    ry += dx * 0.1;\n    rx += dy * 0.1;\n    if(rx > 90.f) rx = 90.f;\n    if(rx < -90.f) rx = -90.f;\n}\n\nstatic bool computeZ()\n{\n    float x = -ppos.z;\n    float y = -ppos.x;\n    if(x == (float)(int)x) x += 1.e-5f;\n    if(y == (float)(int)y) y += 1.e-5f;\n    struct {\n        int x1, x2;\n        float w1, w2;\n    }\n    X = {\n        (int)floorf(x) + 5, (int)ceilf(x) + 5,\n        x - floorf(x), ceilf(x) - x\n    },\n    Y = {\n        (int)floorf(y) + 5, (int)ceilf(y) + 5,\n        y - floorf(y), ceilf(y) - y\n    };\n\n    if(X.x1 < 0 || X.x2 > 9 || Y.x1 < 0 || Y.x2 > 9) return false;\n\n#define OP(A, B) ((1.f\/A + 1.f\/B) \/ 2.f)\n    float z =\n          gmap[Y.x1][X.x1] * OP(Y.w1, X.w1)\n        + gmap[Y.x1][X.x2] * OP(Y.w1, X.w2)\n        + gmap[Y.x2][X.x2] * OP(Y.w2, X.w2)\n        + gmap[Y.x2][X.x1] * OP(Y.w2, X.w1);\n    z \/= \n          OP(X.w1, Y.w1)\n        + OP(X.w2, Y.w1)\n        + OP(X.w2, Y.w2)\n        + OP(X.w1, Y.w2);\n#undef OP\n\n    ppos.y = z + 2.f;\n\n    return true;\n}\n\nstatic void updateScene()\n{\n#define ACTUAL_FRAMES_PER_ANIMATION_FRAME 30\n    static size_t frameCounter = 0;\n\n\n    if(moving || moving2) {\n        switch(mvmntType) {\n            case GRAVITY: {\n                Point3D dir(dlta2, 0, dlta);\n                dir = Drawing::UtilityHelpers::normalizeVector(dir);\n                dir.x \/= 10.f;\n                dir.y \/= 10.f;\n                dir.z \/= 10.f;\n                dir = Drawing::UtilityHelpers::RotateDeltaVector(dir, -ry, 0);\n                Point3D oldPpos = ppos;\n                ppos = Drawing::UtilityHelpers::Translate(ppos, dir);\n                if(!computeZ())\n                {\n                    ppos = oldPpos;\n                }\n                break; }\n            case FLY: {\n                Point3D dir(dlta2, 0, dlta);\n                dir = Drawing::UtilityHelpers::normalizeVector(dir);\n                dir.x \/= 10.f;\n                dir.y \/= 10.f;\n                dir.z \/= 10.f;\n                dir = Drawing::UtilityHelpers::RotateDeltaVector(dir, -ry, -rx);\n                ppos = Drawing::UtilityHelpers::Translate(ppos, dir);\n                break; }\n        }\n    }\n\n    jx += 5;\n    jy += 3;\n    jz += 2;\n    if(jx > 360) jx -= 360;\n    if(jy > 360) jy -= 360;\n    if(jz > 360) jz -= 360;\n}\n\nstatic void onkeyup(char key)\n{\n    if(key == 27) exit(0);\n    switch(key) {\n    case 'd':\n    case 'a':\n        moving2 = false;\n        dlta2 = 0.f;\n        break;\n    case 'w':\n    case 's':\n        moving = false;\n        dlta = 0.f;\n        break;\n    case 'm':\n        if(mvmntType == GRAVITY) {\n            mvmntType = FLY;\n            break;\n        }\n        if(mvmntType == FLY &&\n                ppos.x >= -((float)mgmap)\/2.f &&\n                ppos.x <= ((float)mgmap)\/2.f &&\n                ppos.z >= -((float)ngmap)\/2.f &&\n                ppos.z <= ((float)ngmap)\/2.f)\n        {\n            mvmntType = GRAVITY;\n            computeZ();\n        }\n        break;\n    }\n}\n\nstatic void onkeydown(char key)\n{\n    switch(key) {\n    case 'w':\n        moving = true;\n        dlta = 0.1;\n        break;\n    case 's':\n        moving = true;\n        dlta = -0.1;\n        break;\n    case 'a':\n        moving2 = true;\n        dlta2 = -0.1;\n        break;\n    case 'd':\n        moving2 = true;\n        dlta2 = 0.1;\n    }\n}\n\nint main(int argc, char* argv[])\n{\n    Drawing::Init(&argc, argv);\n    Drawing::SetWindowSize(728, 500);\n    Drawing::SetOnMouseDown(onmousedown);\n    Drawing::SetOnMouseUp(onmouseup);\n    Drawing::SetOnMouseMove(onmousemove);\n    Drawing::SetOnKeyUp(onkeyup);\n    Drawing::SetOnKeyDown(onkeydown);\n\n    Drawing::LoadBitmapTexture(\"sample.bmp\");\n    \n    Drawing::LoadBitmapTexture(\"sample.bmp\", 34 + 256 * 177 + 256 * 256 * 76);\n    \n    Drawing::Loop(updateScene, drawScene);\n\n    return 0;\n}\n<commit_msg>use params<commit_after>\/*\r\nCopyright (c) 2014, Vlad Mesco\r\nAll rights reserved.\r\n\r\nRedistribution and use in source and binary forms, with or without\r\nmodification, are permitted provided that the following conditions are met:\r\n\r\n* Redistributions of source code must retain the above copyright notice, this\r\n  list of conditions and the following disclaimer.\r\n\r\n* Redistributions in binary form must reproduce the above copyright notice,\r\n  this list of conditions and the following disclaimer in the documentation\r\n  and\/or other materials provided with the distribution.\r\n\r\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\r\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\r\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\r\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\r\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\r\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n*\/\n\n\/\/ DISCLAIMER: this is pretty much prototype\/test code :D\n#include <cstdlib>\n#include <cmath>\n#include <iostream>\n#include \"core.hxx\"\n#include \"drawing.hxx\"\n\nstatic bool moving = false, moving2 = false;\nstatic float dlta = 0.1, dlta2 = 0.f;\n\nstatic float jx = 0, jy = 0, jz = 0;\n\nstatic float rx = 0, ry = 0;\nstatic Point3D ppos(0, 0.5, -2);\n\nstatic enum {\n    FLY,\n    GRAVITY\n} mvmntType = FLY;\n\n#define ngmap (10)\n#define mgmap (10)\nstatic float gmap[mgmap][ngmap] = {\n    { -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -6.f, -6.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -6.f, -7.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -5.f, -6.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f, -5.f },\n    { -5.f, -5.f, -5.f, -5.f, -5.f, -6.f, -6.f, -6.f, -6.f, -6.f },\n    { -4.f, -4.f, -5.f, -5.f, -6.f, -6.f, -7.f, -7.f, -7.f, -7.f },\n    { -3.f, -4.f, -4.f, -5.f, -6.f, -7.f, -7.f, -8.f, -8.f, -8.f },\n    { -3.f, -3.f, -4.f, -5.f, -6.f, -7.f, -8.f, -8.f, -8.f, -8.f },\n    { -2.f, -3.f, -4.f, -5.f, -6.f, -7.f, -8.f, -8.f, -8.f, -8.f },\n};\n\nstatic void drawMap(Drawing& dwg)\n{\n    struct {\n        float first;\n        float step;\n    } \n    nn = { -((float)ngmap) \/ 2.f, 1.f },\n    mm = { -((float)mgmap) \/ 2.f, 1.f };\n\n    dwg.SetColor(Drawing::WHITE);\n    for(size_t i = 0; i < ngmap - 1; ++i) {\n        for(size_t j = 0; j < mgmap - 1; ++j) {\n            dwg.MoveTo(Point3D(nn.first + i * nn.step, gmap[i][j], mm.first + j * mm.step));\n            dwg.LineTo(Point3D(nn.first + i * nn.step, gmap[i][j + 1], mm.first + (j + 1) * mm.step));\n            dwg.LineTo(Point3D(nn.first + (i + 1) * nn.step, gmap[i + 1][j + 1], mm.first + (j + 1) * mm.step));\n            dwg.LineTo(Point3D(nn.first + (i + 1) * nn.step, gmap[i + 1][j], mm.first + j * mm.step));\n            dwg.LineTo(Point3D(nn.first + i * nn.step, gmap[i][j], mm.first + j * mm.step));\n        }\n    }\n}\n\nstatic void drawScene(Drawing& dwg)\n{\n    dwg.MoveCamera(\n        ppos,\n        -ry,\n        -rx);\n\n    dwg.SetColor(Drawing::WHITE);\n    dwg.SetRotations(jx, jy, jz);\n    dwg.MoveTo(Point3D(0, 1, -5));\n    dwg.WireCube(1);\n    dwg.SetRotations(-jx, -jy, -jz);\n    dwg.SetColor(Drawing::YELLOW);\n    dwg.WireCube(0.5);\n\n    dwg.SetColor(Drawing::CYAN);\n    dwg.MoveTo(Point3D(-5, 0, 0));\n    dwg.LineTo(Point3D(5, 0, 0));\n    dwg.SetColor(Drawing::YELLOW);\n    dwg.MoveTo(Point3D(0, -5, 0));\n    dwg.LineTo(Point3D(0, 5, 0));\n    dwg.SetColor(Drawing::CYAN);\n    dwg.MoveTo(Point3D(0, 0, -5));\n    dwg.LineTo(Point3D(0, 0, 5));\n\n    dwg.MoveTo(Point3D(0, 0, 0));\n    dwg.SetColor(Drawing::SEABLUE);\n    dwg.SetRotations(0, 0, 45);\n    dwg.Quad(1, 1);\n    dwg.SetColor(Drawing::CYAN);\n    dwg.WireQuad(1, 1);\n    \n    dwg.MoveTo(Point3D(0, 0, 0));\n    dwg.SetColor(Drawing::SEAGREEN);\n    dwg.SetRotations(90, 0, 0);\n    dwg.Quad(0.7, 0.7);\n    dwg.SetColor(Drawing::LIME);\n    dwg.WireQuad(0.7, 0.7);\n    \n    dwg.MoveTo(Point3D(0, 0, 0));\n    dwg.SetColor(Drawing::SEAYELLOW);\n    dwg.SetRotations(0, 90, 0);\n    dwg.Quad(0.4, 0.4);\n    dwg.SetColor(Drawing::YELLOW);\n    dwg.WireQuad(0.4, 0.4);\n\n    dwg.MoveTo(Point3D(0, 0, 2));\n    dwg.SetTexture(1);\n    dwg.SetTextureScale(0, 0);\n    dwg.SetRotations(0, 90, 90);\n    dwg.TextureQuad(10, 5);\n\n    dwg.SetTexture(0);\n    dwg.MoveTo(Point3D(0, 0, 4));\n    dwg.SetTextureScale(1, 1);\n    dwg.SetRotations(0, 0, 0);\n    dwg.TextureQuad(10, 1);\n    dwg.MoveTo(Point3D(5, 0, 4));\n    dwg.SetTextureScale(1, 1);\n    dwg.SetRotations(0, 0, 0);\n    dwg.TextureQuad(10, 1);\n    \n    dwg.SetTexture(1);\n    dwg.MoveTo(Point3D(10, 0, 5.5));\n    dwg.SetTextureScale(1, 1);\n    dwg.SetRotations(0, 0, 0);\n    dwg.TextureQuad(10, 1);\n    dwg.SetColor(Drawing::WHITE);\n    dwg.WireQuad(10, 1);\n\n    dwg.MoveTo(Point3D(20, 0, 5.5));\n    dwg.SetTextureScale(1, 1);\n    dwg.SetRotations(0, 0, 0);\n    dwg.TextureQuad(10, 1);\n    dwg.SetColor(Drawing::WHITE);\n    dwg.WireQuad(10, 1);\n\n    \/\/ camera facing sprites\n    dwg.MoveTo(Point3D(-10, 1, -1));\n    dwg.SetTextureScale(0, 0);\n    dwg.SetTexture(0);\n    dwg.SpriteQuad(1, 1);\n    \n    dwg.MoveTo(Point3D(-10, 1, -3));\n    dwg.SetTexture(1);\n    dwg.SpriteQuad(1, 1);\n\n    \/\/ cylindrical billboard\n    dwg.MoveTo(Point3D(-10, 1, 3));\n    dwg.SetTexture(0);\n    dwg.SetRotations(90, 0, -ry);\n    dwg.TextureQuad(1, 1);\n\n    \/\/ in case texture's missing\n    dwg.MoveTo(Point3D(-10, 1, -5));\n    dwg.SetTexture(-1);\n    dwg.SpriteQuad(1, 2);\n\n    drawMap(dwg);\n\n    if(mvmntType == GRAVITY) {\n        dwg.SetRotations(0, 0, 0);\n        dwg.SetColor(Drawing::LIME);\n        Point3D p(-ppos.x, ppos.y - 1.f, -ppos.z);\n        dwg.MoveTo(p);\n        dwg.Quad(0.05, 0.05);\n    }\n}\n\nstatic void onmousedown(int x, int y, int btn)\n{\n    if(btn == 1) {\n    }\n    if(btn == 2) {\n    }\n    if(btn == 3) {\n    }\n}\n\nstatic void onmouseup(int x, int y, int btn)\n{\n}\n\nstatic void onmousemove(int dx, int dy)\n{\n    ry += dx * 0.1;\n    rx += dy * 0.1;\n    if(rx > 90.f) rx = 90.f;\n    if(rx < -90.f) rx = -90.f;\n}\n\nstatic bool computeZ()\n{\n    float x = -ppos.z;\n    float y = -ppos.x;\n    if(x == (float)(int)x) x += 1.e-5f;\n    if(y == (float)(int)y) y += 1.e-5f;\n    struct {\n        int x1, x2;\n        float w1, w2;\n    }\n    X = {\n        (int)floorf(x) + mgmap\/2, (int)ceilf(x) + mgmap\/2,\n        x - floorf(x), ceilf(x) - x\n    },\n    Y = {\n        (int)floorf(y) + ngmap\/2, (int)ceilf(y) + ngmap\/2,\n        y - floorf(y), ceilf(y) - y\n    };\n\n    if(X.x1 < 0 || X.x2 >= mgmap || Y.x1 < 0 || Y.x2 >= ngmap) return false;\n\n#define OP(A, B) ((1.f\/A + 1.f\/B) \/ 2.f)\n    float z =\n          gmap[Y.x1][X.x1] * OP(Y.w1, X.w1)\n        + gmap[Y.x1][X.x2] * OP(Y.w1, X.w2)\n        + gmap[Y.x2][X.x2] * OP(Y.w2, X.w2)\n        + gmap[Y.x2][X.x1] * OP(Y.w2, X.w1);\n    z \/= \n          OP(X.w1, Y.w1)\n        + OP(X.w2, Y.w1)\n        + OP(X.w2, Y.w2)\n        + OP(X.w1, Y.w2);\n#undef OP\n\n    ppos.y = z + 2.f;\n\n    return true;\n}\n\nstatic void updateScene()\n{\n#define ACTUAL_FRAMES_PER_ANIMATION_FRAME 30\n    static size_t frameCounter = 0;\n\n\n    if(moving || moving2) {\n        switch(mvmntType) {\n            case GRAVITY: {\n                Point3D dir(dlta2, 0, dlta);\n                dir = Drawing::UtilityHelpers::normalizeVector(dir);\n                dir.x \/= 10.f;\n                dir.y \/= 10.f;\n                dir.z \/= 10.f;\n                dir = Drawing::UtilityHelpers::RotateDeltaVector(dir, -ry, 0);\n                Point3D oldPpos = ppos;\n                ppos = Drawing::UtilityHelpers::Translate(ppos, dir);\n                if(!computeZ())\n                {\n                    ppos = oldPpos;\n                }\n                break; }\n            case FLY: {\n                Point3D dir(dlta2, 0, dlta);\n                dir = Drawing::UtilityHelpers::normalizeVector(dir);\n                dir.x \/= 10.f;\n                dir.y \/= 10.f;\n                dir.z \/= 10.f;\n                dir = Drawing::UtilityHelpers::RotateDeltaVector(dir, -ry, -rx);\n                ppos = Drawing::UtilityHelpers::Translate(ppos, dir);\n                break; }\n        }\n    }\n\n    jx += 5;\n    jy += 3;\n    jz += 2;\n    if(jx > 360) jx -= 360;\n    if(jy > 360) jy -= 360;\n    if(jz > 360) jz -= 360;\n}\n\nstatic void onkeyup(char key)\n{\n    if(key == 27) exit(0);\n    switch(key) {\n    case 'd':\n    case 'a':\n        moving2 = false;\n        dlta2 = 0.f;\n        break;\n    case 'w':\n    case 's':\n        moving = false;\n        dlta = 0.f;\n        break;\n    case 'm':\n        if(mvmntType == GRAVITY) {\n            mvmntType = FLY;\n            break;\n        }\n        if(mvmntType == FLY &&\n                ppos.x >= -((float)mgmap)\/2.f &&\n                ppos.x <= ((float)mgmap)\/2.f &&\n                ppos.z >= -((float)ngmap)\/2.f &&\n                ppos.z <= ((float)ngmap)\/2.f)\n        {\n            mvmntType = GRAVITY;\n            computeZ();\n        }\n        break;\n    }\n}\n\nstatic void onkeydown(char key)\n{\n    switch(key) {\n    case 'w':\n        moving = true;\n        dlta = 0.1;\n        break;\n    case 's':\n        moving = true;\n        dlta = -0.1;\n        break;\n    case 'a':\n        moving2 = true;\n        dlta2 = -0.1;\n        break;\n    case 'd':\n        moving2 = true;\n        dlta2 = 0.1;\n    }\n}\n\nint main(int argc, char* argv[])\n{\n    Drawing::Init(&argc, argv);\n    Drawing::SetWindowSize(728, 500);\n    Drawing::SetOnMouseDown(onmousedown);\n    Drawing::SetOnMouseUp(onmouseup);\n    Drawing::SetOnMouseMove(onmousemove);\n    Drawing::SetOnKeyUp(onkeyup);\n    Drawing::SetOnKeyDown(onkeydown);\n\n    Drawing::LoadBitmapTexture(\"sample.bmp\");\n    \n    Drawing::LoadBitmapTexture(\"sample.bmp\", 34 + 256 * 177 + 256 * 256 * 76);\n    \n    Drawing::Loop(updateScene, drawScene);\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This File is part of Davix, The IO library for HTTP based protocols\n * Copyright (C) CERN 2013\n * Author: Adrien Devresse <adrien.devresse@cern.ch>\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#ifndef HTTPIOCHAIN_HPP\n#define HTTPIOCHAIN_HPP\n\n#include <davix_internal.hpp>\n\nnamespace Davix{\n\nclass HttpIOChain;\n\n\n#define CHAIN_FORWARD(X) \\\n        do{ \\\n        if(_next.get() != NULL){ \\\n            return _next->X; \\\n        } \\\n        throw DavixException(davix_scope_io_buff(), StatusCode::OperationNonSupported, \"I\/O operation not supported\"); \\\n    }while(0)\n\n\n\/\/ stores state for readToFd operations - necessary, so as not to write the same\n\/\/ data again to an fd after a retry \/ metalink recovery.\nstruct FdHandler {\n    int fd = -1;\n    dav_ssize_t bytes_written_to_fd = 0;\n};\n\n\n\/\/ parameter handler for any IO Chain operation\nstruct IOChainContext{\n    IOChainContext(Context & c, const Uri & u, const RequestParams * p): _context(c), _uri(u), _reqparams(p), _end_time() {\n        if(_reqparams->getOperationTimeout()->tv_sec > 0){\n            _end_time = Chrono::Clock(Chrono::Clock::Monolitic).now();\n            _end_time += Chrono::Duration(_reqparams->getOperationTimeout()->tv_sec);\n        }\n    }\n\n\n    void checkTimeout(){\n        if( _end_time.isValid() && _end_time < Chrono::Clock(Chrono::Clock::Monolitic).now()){\n            std::ostringstream ss;\n            ss << \"operation timeout of \" << _reqparams->getOperationTimeout()->tv_sec << \"s expired\";\n            throw DavixException(davix_scope_io_buff(), StatusCode::OperationTimeout, ss.str());\n        }\n    }\n\n\n\n\n    \/\/ context parameter\n    Context& _context;\n    Uri const & _uri;\n    RequestParams const * _reqparams;\n\n    \/\/ Operation parameter\n    Chrono::TimePoint _end_time;\n\n    \/\/ Keep track of how many bytes we've written to an fd, so as to avoid\n    \/\/ writing the same bytes again in an event of retries \/ metalink recovery\n    FdHandler fdHandler;\n};\n\n\/\/ Davix IO chain\n\/\/ Complete I\/O Stack implementation of Davix\nclass HttpIOChain : NonCopyable{\npublic:\n\n    HttpIOChain();\n    virtual ~HttpIOChain();\n\n    HttpIOChain* add(HttpIOChain* elem);\n\n    \/*\n     *   Meta data opts\n     *\n     **\/\n    \/\/ calculate hecksum\n    virtual void checksum(IOChainContext & iocontext, std::string & checksm, const std::string & chk_algo);\n\n    \/\/ calc replica\n    virtual std::vector<DavFile> & getReplicas(IOChainContext & iocontext, std::vector<DavFile> & vec);\n\n    \/\/ delete resource\n    virtual void deleteResource(IOChainContext & iocontext);\n\n    \/\/ make collection\n    virtual void makeCollection(IOChainContext & iocontext);\n\n    \/\/ move\/rename resource\n    virtual void move(IOChainContext & iocontext, const std::string & target_url);\n\n    \/\/ get statInfo\n    virtual StatInfo & statInfo(IOChainContext & iocontext, StatInfo & st_info);\n\n    \/\/ get quota info\n    virtual QuotaInfo & quotaInfo(IOChainContext & iocontext, QuotaInfo & info);\n\n    \/\/ listing\n    \/\/ return false if end of directory is reached\n    virtual bool nextSubItem(IOChainContext & iocontext, std::string & entry_name, StatInfo & info);\n\n\n    \/*\n     *     I\/O Layer\n     **\/\n    virtual bool open(IOChainContext & iocontext, int flags);\n\n    virtual void prefetchInfo(IOChainContext & iocontext, off_t offset, dav_size_t size_read, advise_t adv);\n\n    virtual dav_ssize_t readFull(IOChainContext & iocontext, std::vector<char> & buffer);\n\n    \/\/ overloaded version for string content\n    virtual dav_ssize_t readFull(IOChainContext & iocontext, std::string & buffer);\n\n    \/\/ read to fd\n    virtual dav_ssize_t readToFd(IOChainContext & iocontext, int fd, dav_size_t size);\n\n    virtual dav_ssize_t preadVec(IOChainContext & iocontext, const DavIOVecInput * input_vec,\n                              DavIOVecOuput * output_vec,\n                              const dav_size_t count_vec);\n\n    \/\/ reset file position and status\n    virtual void resetIO(IOChainContext & iocontext);\n\n    \/\/ position independant read operation,\n    \/\/ similar to pread except that does not need open() before\n    virtual dav_ssize_t pread(IOChainContext & iocontext, void* buf, dav_size_t count, dav_off_t offset);\n\n    \/\/ sequential read of a file from begining to the end\n    virtual dav_ssize_t read(IOChainContext & iocontext, void* buf, dav_size_t count);\n\n    \/\/ lseek prototype\n    virtual dav_off_t lseek(IOChainContext & iocontext, dav_off_t offset, int flags);\n\n\n    \/\/ write the entire content from a file descriptor\n    virtual dav_ssize_t writeFromFd(IOChainContext & iocontext, int fd, dav_size_t size);\n\n\n    \/\/ wirte the entire content from a defined callback\n    virtual dav_ssize_t writeFromCb(IOChainContext & iocontext, const DataProviderFun & func, dav_size_t size);\n\n    \/\/ sequential write\n    virtual dav_ssize_t write(IOChainContext & iocontext, const void* buf, dav_size_t count);\n\n\nprotected:\n    Ptr::Scoped<HttpIOChain> _next;\n    HttpIOChain* _start;\n\n\n};\n\n\n}\n\n#endif \/\/ HTTPIOCHAIN_HPP\n<commit_msg>DMC-958 Fix SLC6 build<commit_after>\/*\n * This File is part of Davix, The IO library for HTTP based protocols\n * Copyright (C) CERN 2013\n * Author: Adrien Devresse <adrien.devresse@cern.ch>\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#ifndef HTTPIOCHAIN_HPP\n#define HTTPIOCHAIN_HPP\n\n#include <davix_internal.hpp>\n\nnamespace Davix{\n\nclass HttpIOChain;\n\n\n#define CHAIN_FORWARD(X) \\\n        do{ \\\n        if(_next.get() != NULL){ \\\n            return _next->X; \\\n        } \\\n        throw DavixException(davix_scope_io_buff(), StatusCode::OperationNonSupported, \"I\/O operation not supported\"); \\\n    }while(0)\n\n\n\/\/ stores state for readToFd operations - necessary, so as not to write the same\n\/\/ data again to an fd after a retry \/ metalink recovery.\nstruct FdHandler {\n    FdHandler() : fd(-1), bytes_written_to_fd(0) { }\n  \n    int fd;\n    dav_ssize_t bytes_written_to_fd;\n};\n\n\n\/\/ parameter handler for any IO Chain operation\nstruct IOChainContext{\n    IOChainContext(Context & c, const Uri & u, const RequestParams * p): _context(c), _uri(u), _reqparams(p), _end_time() {\n        if(_reqparams->getOperationTimeout()->tv_sec > 0){\n            _end_time = Chrono::Clock(Chrono::Clock::Monolitic).now();\n            _end_time += Chrono::Duration(_reqparams->getOperationTimeout()->tv_sec);\n        }\n    }\n\n\n    void checkTimeout(){\n        if( _end_time.isValid() && _end_time < Chrono::Clock(Chrono::Clock::Monolitic).now()){\n            std::ostringstream ss;\n            ss << \"operation timeout of \" << _reqparams->getOperationTimeout()->tv_sec << \"s expired\";\n            throw DavixException(davix_scope_io_buff(), StatusCode::OperationTimeout, ss.str());\n        }\n    }\n\n\n\n\n    \/\/ context parameter\n    Context& _context;\n    Uri const & _uri;\n    RequestParams const * _reqparams;\n\n    \/\/ Operation parameter\n    Chrono::TimePoint _end_time;\n\n    \/\/ Keep track of how many bytes we've written to an fd, so as to avoid\n    \/\/ writing the same bytes again in an event of retries \/ metalink recovery\n    FdHandler fdHandler;\n};\n\n\/\/ Davix IO chain\n\/\/ Complete I\/O Stack implementation of Davix\nclass HttpIOChain : NonCopyable{\npublic:\n\n    HttpIOChain();\n    virtual ~HttpIOChain();\n\n    HttpIOChain* add(HttpIOChain* elem);\n\n    \/*\n     *   Meta data opts\n     *\n     **\/\n    \/\/ calculate hecksum\n    virtual void checksum(IOChainContext & iocontext, std::string & checksm, const std::string & chk_algo);\n\n    \/\/ calc replica\n    virtual std::vector<DavFile> & getReplicas(IOChainContext & iocontext, std::vector<DavFile> & vec);\n\n    \/\/ delete resource\n    virtual void deleteResource(IOChainContext & iocontext);\n\n    \/\/ make collection\n    virtual void makeCollection(IOChainContext & iocontext);\n\n    \/\/ move\/rename resource\n    virtual void move(IOChainContext & iocontext, const std::string & target_url);\n\n    \/\/ get statInfo\n    virtual StatInfo & statInfo(IOChainContext & iocontext, StatInfo & st_info);\n\n    \/\/ get quota info\n    virtual QuotaInfo & quotaInfo(IOChainContext & iocontext, QuotaInfo & info);\n\n    \/\/ listing\n    \/\/ return false if end of directory is reached\n    virtual bool nextSubItem(IOChainContext & iocontext, std::string & entry_name, StatInfo & info);\n\n\n    \/*\n     *     I\/O Layer\n     **\/\n    virtual bool open(IOChainContext & iocontext, int flags);\n\n    virtual void prefetchInfo(IOChainContext & iocontext, off_t offset, dav_size_t size_read, advise_t adv);\n\n    virtual dav_ssize_t readFull(IOChainContext & iocontext, std::vector<char> & buffer);\n\n    \/\/ overloaded version for string content\n    virtual dav_ssize_t readFull(IOChainContext & iocontext, std::string & buffer);\n\n    \/\/ read to fd\n    virtual dav_ssize_t readToFd(IOChainContext & iocontext, int fd, dav_size_t size);\n\n    virtual dav_ssize_t preadVec(IOChainContext & iocontext, const DavIOVecInput * input_vec,\n                              DavIOVecOuput * output_vec,\n                              const dav_size_t count_vec);\n\n    \/\/ reset file position and status\n    virtual void resetIO(IOChainContext & iocontext);\n\n    \/\/ position independant read operation,\n    \/\/ similar to pread except that does not need open() before\n    virtual dav_ssize_t pread(IOChainContext & iocontext, void* buf, dav_size_t count, dav_off_t offset);\n\n    \/\/ sequential read of a file from begining to the end\n    virtual dav_ssize_t read(IOChainContext & iocontext, void* buf, dav_size_t count);\n\n    \/\/ lseek prototype\n    virtual dav_off_t lseek(IOChainContext & iocontext, dav_off_t offset, int flags);\n\n\n    \/\/ write the entire content from a file descriptor\n    virtual dav_ssize_t writeFromFd(IOChainContext & iocontext, int fd, dav_size_t size);\n\n\n    \/\/ wirte the entire content from a defined callback\n    virtual dav_ssize_t writeFromCb(IOChainContext & iocontext, const DataProviderFun & func, dav_size_t size);\n\n    \/\/ sequential write\n    virtual dav_ssize_t write(IOChainContext & iocontext, const void* buf, dav_size_t count);\n\n\nprotected:\n    Ptr::Scoped<HttpIOChain> _next;\n    HttpIOChain* _start;\n\n\n};\n\n\n}\n\n#endif \/\/ HTTPIOCHAIN_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include \"threadedParsers.hh\"\n\nusing namespace khmer;\nusing namespace khmer:: threaded_parsers;\n\n\/* This function returns the proper parser factory for a given\n * file type\n *\/\nThreadedIParserFactory* ThreadedIParserFactory::get_parser(const std::string &inputfile, long int chunkSize)\n{\n   std::string filename(inputfile);\n   int found = filename.find_last_of(\".\");\n\n   std::string type = filename.substr(found+1);\n\n   if (type == \"fq\" || type == \"fastq\") {\n      return new ThreadedFastqParserFactory(inputfile, chunkSize);\n   } else if (type == \"fa\" || type == \"fasta\") {\n      return new ThreadedFastaParserFactory(inputfile, chunkSize);\n   } else {\n      return new ThreadedFastaParserFactory(inputfile, chunkSize);\n   }\n}\n\n\/* Constructer for ThreadedFastaParserFactory *\/\nThreadedFastaParserFactory::ThreadedFastaParserFactory(\n    const std::string &inputfile, long int size)\n{\n    \/* Save off the filename and chunk size *\/\n    filename = inputfile;\n    chunkSize = size;\n    curPos = 0;\n\n    \/* Get the file size *\/\n    std::ifstream myFile;\n    myFile.open(filename.c_str(), std::ifstream::in);\n    myFile.seekg (0, std::ios::end);\n\n    \/* Subtract off one so that if there is only one\n     * byte left (which is the case since we call unget)\n     * we will still indicate that we have reached the end\n     * of the file *\/\n    fileSize = (long int)myFile.tellg() - 1;\n    myFile.close();\n}\n\nThreadedIParser* ThreadedFastaParserFactory::get_next_parser()\n{\n    \/* Open the file *\/\n    std::ifstream myFile;\n    myFile.open(filename.c_str(), std::ifstream::in);\n    long int myCurPos, endPos;\n\n    do {\n        \/* Save off the current curPos so that we can use it in the compare\n         * and swap later, to make this call threadsafe *\/\n        myCurPos = curPos;\n\n        \/* Start the end position off at the current position + the chunk size *\/\n        endPos = myCurPos + chunkSize;\n\n        if (endPos > fileSize)\n            endPos = fileSize;\n\n        \/* Read until we see\n         * a '>', which indicates the start of the next read, or we reach EOF\n         *\/\n        myFile.seekg(endPos, std::ios::beg);\n\n        while (!myFile.eof() && myFile.get() != '>');\n\n        \/* We get here as soon as we read a '>' *\/\n        \/* Put the '>' back *\/\n        myFile.unget();\n        endPos = myFile.tellg();\n\n        if (endPos == -1)\n            endPos = fileSize;\n\n    } while(!__sync_bool_compare_and_swap(&curPos, myCurPos, endPos));\n    \n\n    myFile.close();\n    return new ThreadedFastaParser(filename, myCurPos, endPos);\n}\n\n\n\/* Constructer for ThreadedFastqParserFactory *\/\nThreadedFastqParserFactory::ThreadedFastqParserFactory(\n    const std::string &inputfile, long int size)\n{\n    \/* Save off the filename and chunk size *\/\n    filename = inputfile;\n    chunkSize = size;\n    curPos = 0;\n\n    \/* Get the file size *\/\n    std::ifstream myFile;\n    myFile.open(filename.c_str(), std::ifstream::in);\n    myFile.seekg (0, std::ios::end);\n    \/* Subtract off one so that if there is only one\n     * byte left (which is the case since we call unget)\n     * we will still indicate that we have reached the end\n     * of the file *\/\n    fileSize = (long int)myFile.tellg() - 1;\n    myFile.close();\n}\n\nThreadedIParser* ThreadedFastqParserFactory::get_next_parser()\n{\n    \/* Open the file *\/\n    std::ifstream myFile;\n    myFile.open(filename.c_str(), std::ifstream::in);\n    long int myCurPos, endPos;\n\n    do {\n        \/* Save off the current curPos so that we can use it in the compare\n         * and swap later, to make this call threadsafe *\/\n        myCurPos = curPos;\n\n        \/* Start the end position off at the current position + the chunk size *\/\n        endPos = myCurPos + chunkSize;\n\n        if (endPos > fileSize)\n            endPos = fileSize;\n\n        \/* Read until we see\n         * a '@', which indicates the start of the next read, or we reach EOF\n         * We have to be careful - a '@' can show up in the quality scores too\n         * so watch for that\n         *\/\n        myFile.seekg(endPos, std::ios::beg);\n\n        char prevChar = myFile.get();\n        while (!myFile.eof())\n        {\n            char curChar = myFile.get();\n            if (curChar == '@' && prevChar == '\\n')\n                break;\n            prevChar = curChar;\n        }\n\n        \/* We get here as soon as we read a '@' *\/\n        \/* Put the '@' back *\/\n        if (!myFile.eof())\n            myFile.unget();\n        endPos = myFile.tellg();\n\n        if (endPos == -1)\n            endPos = fileSize;\n\n    } while(!__sync_bool_compare_and_swap(&curPos, myCurPos, endPos));\n    \n    myFile.close();\n    return new ThreadedFastqParser(filename, myCurPos, endPos);\n}\n\n\n\nThreadedFastaParser::ThreadedFastaParser(const std::string &inputfile, \n    long int startPos, long int end) : \n                         infile(inputfile.c_str())\n{\n\n    assert(infile.is_open());\n\n    \/* Lay the start pointer down in the right location *\/\n    infile.seekg(startPos, std::ios::beg);\n\n    \/* Set the end ptr *\/\n    endPos = end;\n}\n\nRead ThreadedFastaParser::get_next_read()\n{\n   std::string line = \"\", seq = \"\";\n   Read read;\n\n   bool valid_read = 0;\n\n   while (!valid_read)  {\n      getline(infile, line);\n\n      assert(line[0] == '>');\n      read.name = line.substr(1);\n\n      \/* Get all the lines that are sequence data *\/\n      while(infile.get() != '>' && !infile.eof())\n      {\n         infile.unget();\n         getline(infile, line);\n         seq += line;\n      }\n      \/* Put the character back if we are not at EOF *\/\n      if (!infile.eof())\n          infile.unget();\n\n      if ((int)seq.find_first_of(\"Nn\") == -1)  {\n         valid_read = 1;\n      } \n\n      read.seq = seq;\n      seq = \"\";\n\n   }\n\n   return read;\n}\n\nThreadedFastqParser::ThreadedFastqParser(const std::string &inputfile, \n                long int startPos, long int end) :\n                         infile(inputfile.c_str())\n{\n    assert(infile.is_open());\n\n    \/* Lay the start pointer down in the right location *\/\n    infile.seekg(startPos, std::ios::beg);\n\n    \/* Set the end ptr *\/\n    endPos = end;\n}\n\nRead ThreadedFastqParser::get_next_read()\n{\n   Read read;\n   std::string line_three, quality_scores;\n\n   bool valid_read = 0;\n\n   while (!valid_read && !infile.eof())  {\n\n      getline(infile, read.name);\n      getline(infile, read.seq);\n      getline(infile, line_three);\n      getline(infile, quality_scores);\n   \n      assert(read.name[0] == '@');\n      assert(line_three[0] == '+' || line_three[0] == '#');\n      assert(quality_scores.length() == read.seq.length());\n\n      read.name = read.name.substr(1);\n\n      if ((int)read.seq.find_first_of(\"Nn\") == -1)  {\n         valid_read = 1;\n      }\n   }\n\n   return read;\n}\n\n\/\/ vim: set sts=2 sw=2:\n<commit_msg>Bug fix to multi-threaded parser. Only assert that a valid read name was found if not at end of file. (Technically, one could question rather this should be an assert or whether it should throw an exception.)<commit_after>#include \"threadedParsers.hh\"\n\nusing namespace khmer;\nusing namespace khmer:: threaded_parsers;\n\n\/* This function returns the proper parser factory for a given\n * file type\n *\/\nThreadedIParserFactory* ThreadedIParserFactory::get_parser(const std::string &inputfile, long int chunkSize)\n{\n   std::string filename(inputfile);\n   int found = filename.find_last_of(\".\");\n\n   std::string type = filename.substr(found+1);\n\n   if (type == \"fq\" || type == \"fastq\") {\n      return new ThreadedFastqParserFactory(inputfile, chunkSize);\n   } else if (type == \"fa\" || type == \"fasta\") {\n      return new ThreadedFastaParserFactory(inputfile, chunkSize);\n   } else {\n      return new ThreadedFastaParserFactory(inputfile, chunkSize);\n   }\n}\n\n\/* Constructer for ThreadedFastaParserFactory *\/\nThreadedFastaParserFactory::ThreadedFastaParserFactory(\n    const std::string &inputfile, long int size)\n{\n    \/* Save off the filename and chunk size *\/\n    filename = inputfile;\n    chunkSize = size;\n    curPos = 0;\n\n    \/* Get the file size *\/\n    std::ifstream myFile;\n    myFile.open(filename.c_str(), std::ifstream::in);\n    myFile.seekg (0, std::ios::end);\n\n    \/* Subtract off one so that if there is only one\n     * byte left (which is the case since we call unget)\n     * we will still indicate that we have reached the end\n     * of the file *\/\n    fileSize = (long int)myFile.tellg() - 1;\n    myFile.close();\n}\n\nThreadedIParser* ThreadedFastaParserFactory::get_next_parser()\n{\n    \/* Open the file *\/\n    std::ifstream myFile;\n    myFile.open(filename.c_str(), std::ifstream::in);\n    long int myCurPos, endPos;\n\n    do {\n        \/* Save off the current curPos so that we can use it in the compare\n         * and swap later, to make this call threadsafe *\/\n        myCurPos = curPos;\n\n        \/* Start the end position off at the current position + the chunk size *\/\n        endPos = myCurPos + chunkSize;\n\n        if (endPos > fileSize)\n            endPos = fileSize;\n\n        \/* Read until we see\n         * a '>', which indicates the start of the next read, or we reach EOF\n         *\/\n        myFile.seekg(endPos, std::ios::beg);\n\n        while (!myFile.eof() && myFile.get() != '>');\n\n        \/* We get here as soon as we read a '>' *\/\n        \/* Put the '>' back *\/\n        myFile.unget();\n        endPos = myFile.tellg();\n\n        if (endPos == -1)\n            endPos = fileSize;\n\n    } while(!__sync_bool_compare_and_swap(&curPos, myCurPos, endPos));\n    \n\n    myFile.close();\n    return new ThreadedFastaParser(filename, myCurPos, endPos);\n}\n\n\n\/* Constructer for ThreadedFastqParserFactory *\/\nThreadedFastqParserFactory::ThreadedFastqParserFactory(\n    const std::string &inputfile, long int size)\n{\n    \/* Save off the filename and chunk size *\/\n    filename = inputfile;\n    chunkSize = size;\n    curPos = 0;\n\n    \/* Get the file size *\/\n    std::ifstream myFile;\n    myFile.open(filename.c_str(), std::ifstream::in);\n    myFile.seekg (0, std::ios::end);\n    \/* Subtract off one so that if there is only one\n     * byte left (which is the case since we call unget)\n     * we will still indicate that we have reached the end\n     * of the file *\/\n    fileSize = (long int)myFile.tellg() - 1;\n    myFile.close();\n}\n\nThreadedIParser* ThreadedFastqParserFactory::get_next_parser()\n{\n    \/* Open the file *\/\n    std::ifstream myFile;\n    myFile.open(filename.c_str(), std::ifstream::in);\n    long int myCurPos, endPos;\n\n    do {\n        \/* Save off the current curPos so that we can use it in the compare\n         * and swap later, to make this call threadsafe *\/\n        myCurPos = curPos;\n\n        \/* Start the end position off at the current position + the chunk size *\/\n        endPos = myCurPos + chunkSize;\n\n        if (endPos > fileSize)\n            endPos = fileSize;\n\n        \/* Read until we see\n         * a '@', which indicates the start of the next read, or we reach EOF\n         * We have to be careful - a '@' can show up in the quality scores too\n         * so watch for that\n         *\/\n        myFile.seekg(endPos, std::ios::beg);\n\n        char prevChar = myFile.get();\n        while (!myFile.eof())\n        {\n            char curChar = myFile.get();\n            if (curChar == '@' && prevChar == '\\n')\n                break;\n            prevChar = curChar;\n        }\n\n        \/* We get here as soon as we read a '@' *\/\n        \/* Put the '@' back *\/\n        if (!myFile.eof())\n            myFile.unget();\n        endPos = myFile.tellg();\n\n        if (endPos == -1)\n            endPos = fileSize;\n\n    } while(!__sync_bool_compare_and_swap(&curPos, myCurPos, endPos));\n    \n    myFile.close();\n    return new ThreadedFastqParser(filename, myCurPos, endPos);\n}\n\n\n\nThreadedFastaParser::ThreadedFastaParser(const std::string &inputfile, \n    long int startPos, long int end) : \n                         infile(inputfile.c_str())\n{\n\n    assert(infile.is_open());\n\n    \/* Lay the start pointer down in the right location *\/\n    infile.seekg(startPos, std::ios::beg);\n\n    \/* Set the end ptr *\/\n    endPos = end;\n}\n\nRead ThreadedFastaParser::get_next_read()\n{\n   std::string line = \"\", seq = \"\";\n   Read read;\n\n   bool valid_read = 0;\n\n   while (!valid_read)  {\n      getline(infile, line);\n\n      if (!infile.eof( ))\n\tassert(line[0] == '>');\n      read.name = line.substr(1);\n\n      \/* Get all the lines that are sequence data *\/\n      while(infile.get() != '>' && !infile.eof())\n      {\n         infile.unget();\n         getline(infile, line);\n         seq += line;\n      }\n      \/* Put the character back if we are not at EOF *\/\n      if (!infile.eof())\n          infile.unget();\n\n      if ((int)seq.find_first_of(\"Nn\") == -1)  {\n          valid_read = 1;\n      }\n\n      read.seq = seq;\n      seq = \"\";\n\n   }\n\n   return read;\n}\n\nThreadedFastqParser::ThreadedFastqParser(const std::string &inputfile, \n                long int startPos, long int end) :\n                         infile(inputfile.c_str())\n{\n    assert(infile.is_open());\n\n    \/* Lay the start pointer down in the right location *\/\n    infile.seekg(startPos, std::ios::beg);\n\n    \/* Set the end ptr *\/\n    endPos = end;\n}\n\nRead ThreadedFastqParser::get_next_read()\n{\n   Read read;\n   std::string line_three, quality_scores;\n\n   bool valid_read = 0;\n\n   while (!valid_read && !infile.eof())  {\n\n      getline(infile, read.name);\n      getline(infile, read.seq);\n      getline(infile, line_three);\n      getline(infile, quality_scores);\n   \n      assert(read.name[0] == '@');\n      assert(line_three[0] == '+' || line_three[0] == '#');\n      assert(quality_scores.length() == read.seq.length());\n\n      read.name = read.name.substr(1);\n\n      if ((int)read.seq.find_first_of(\"Nn\") == -1)  {\n         valid_read = 1;\n      }\n   }\n\n   return read;\n}\n\n\/\/ vim: set sts=2 sw=2:\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 = -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      if (_headingHoldEnabled) {\n        Serial.print(tgt_Hdg);\n      } else {\n        Serial.print(DISABLED);\n      }\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 = 0;\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      if (_depthHoldEnabled) {\n        Serial.print(target_depth);\n      } else {\n        Serial.print(DISABLED);\n      }\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 \"Fix spelling in Arduino 2\"<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      if (_headingHoldEnabled) {\n        Serial.print(tgt_Hdg);\n      } else {\n        Serial.print(DISABLED);\n      }\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 = 0;\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      if (_depthHoldEnabled) {\n        Serial.print(target_depth);\n      } else {\n        Serial.pitnt(DISABLED);\n      }\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>\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      if (_headingHoldEnabled) {\n        Serial.print(tgt_Hdg);\n      } else {\n        Serial.print(DISABLED);\n      }\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 = 0;\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      if (_depthHoldEnabled) {\n        Serial.print(target_depth);\n      } else {\n        Serial.pitnt(DISABLED);\n      }\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>Fix spelling in Arduino 2<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      if (_headingHoldEnabled) {\n        Serial.print(tgt_Hdg);\n      } else {\n        Serial.print(DISABLED);\n      }\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 = 0;\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      if (_depthHoldEnabled) {\n        Serial.print(target_depth);\n      } else {\n        Serial.print(DISABLED);\n      }\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>\/*=========================================================================\n\nProgram:   BlueBerry Platform\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 \"berryWorkbenchWindowAdvisor.h\"\n\n#include <Poco\/Bugcheck.h>\n\n#include <berryWorkbenchPreferenceConstants.h>\n#include <berryObjects.h>\n#include <berryIPreferences.h>\n\n#include \"..\/internal\/berryWorkbenchWindowConfigurer.h\"\n#include \"..\/internal\/berryWorkbenchPlugin.h\"\n\nnamespace berry\n{\n\nIWorkbenchWindowConfigurer::Pointer WorkbenchWindowAdvisor::GetWindowConfigurer()\n{\n  return windowConfigurer;\n}\n\nWorkbenchWindowAdvisor::WorkbenchWindowAdvisor(\n    IWorkbenchWindowConfigurer::Pointer configurer)\n{\n  poco_assert(configurer.IsNotNull());\n  this->windowConfigurer = configurer;\n}\n\nWorkbenchWindowAdvisor::~WorkbenchWindowAdvisor()\n{\n}\n\nvoid WorkbenchWindowAdvisor::PreWindowOpen()\n{\n  \/\/ do nothing\n}\n\nActionBarAdvisor::Pointer WorkbenchWindowAdvisor::CreateActionBarAdvisor(\n    IActionBarConfigurer::Pointer configurer)\n{\n  ActionBarAdvisor::Pointer actionBarAdvisor(new ActionBarAdvisor(configurer));\n  return actionBarAdvisor;\n}\n\nvoid WorkbenchWindowAdvisor::PostWindowRestore()\n{\n  \/\/ do nothing\n}\n\nvoid WorkbenchWindowAdvisor::OpenIntro()\n{\n  \/\/ TODO: Refactor this into an IIntroManager.openIntro(IWorkbenchWindow) call\n\n  \/\/ introOpened flag needs to be global\n  IWorkbenchConfigurer::Pointer wbConfig = GetWindowConfigurer()->GetWorkbenchConfigurer();\n  std::string key = \"introOpened\"; \/\/$NON-NLS-1$\n  ObjectBool::Pointer introOpened = wbConfig->GetData(key).Cast<ObjectBool>();\n  if (introOpened && introOpened->GetValue())\n  {\n    return;\n  }\n\n  wbConfig->SetData(key, ObjectBool::Pointer(new ObjectBool(true)));\n\n  IPreferences::Pointer workbenchPrefs = WorkbenchPlugin::GetDefault()->GetPreferencesService()->GetSystemPreferences();\n\n  bool showIntro = workbenchPrefs->GetBool(WorkbenchPreferenceConstants::SHOW_INTRO, true);\n\n  IIntroManager* introManager = wbConfig->GetWorkbench()->GetIntroManager();\n\n  bool hasIntro = introManager->HasIntro();\n  bool isNewIntroContentAvailable = introManager->IsNewContentAvailable();\n\n  if (hasIntro && (showIntro || isNewIntroContentAvailable))\n  {\n    introManager\n    ->ShowIntro(GetWindowConfigurer()->GetWindow(), false);\n\n    workbenchPrefs->PutBool(WorkbenchPreferenceConstants::SHOW_INTRO, false);\n    workbenchPrefs->Flush();\n  }\n}\n\nvoid WorkbenchWindowAdvisor::PostWindowCreate()\n{\n  \/\/ do nothing\n}\n\nvoid WorkbenchWindowAdvisor::PostWindowOpen()\n{\n  \/\/ do nothing\n}\n\nbool WorkbenchWindowAdvisor::PreWindowShellClose()\n{\n  \/\/ do nothing, but allow the close() to proceed\n  return true;\n}\n\nvoid WorkbenchWindowAdvisor::PostWindowClose()\n{\n  \/\/ do nothing\n}\n\nvoid WorkbenchWindowAdvisor::CreateWindowContents(Shell::Pointer shell)\n{\n  this->GetWindowConfigurer().Cast<WorkbenchWindowConfigurer>()->CreateDefaultContents(shell);\n}\n\nvoid* WorkbenchWindowAdvisor::CreateEmptyWindowContents(void*  \/*parent*\/)\n{\n  return 0;\n}\n\nbool WorkbenchWindowAdvisor::SaveState(IMemento::Pointer  \/*memento*\/)\n{\n  \/\/ do nothing\n  return true;\n}\n\nbool WorkbenchWindowAdvisor::RestoreState(IMemento::Pointer  \/*memento*\/)\n{\n  \/\/ do nothing\n  return true;\n}\n\n}\n<commit_msg>FIX (#5498): Now welcome screen is shown at every startup by standard. Only when it is closed explicitly (close view), it stops showing up. Help->Welcome brings it back.<commit_after>\/*=========================================================================\n\nProgram:   BlueBerry Platform\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 \"berryWorkbenchWindowAdvisor.h\"\n\n#include <Poco\/Bugcheck.h>\n\n#include <berryWorkbenchPreferenceConstants.h>\n#include <berryObjects.h>\n#include <berryIPreferences.h>\n\n#include \"..\/internal\/berryWorkbenchWindowConfigurer.h\"\n#include \"..\/internal\/berryWorkbenchPlugin.h\"\n\nnamespace berry\n{\n\nIWorkbenchWindowConfigurer::Pointer WorkbenchWindowAdvisor::GetWindowConfigurer()\n{\n  return windowConfigurer;\n}\n\nWorkbenchWindowAdvisor::WorkbenchWindowAdvisor(\n    IWorkbenchWindowConfigurer::Pointer configurer)\n{\n  poco_assert(configurer.IsNotNull());\n  this->windowConfigurer = configurer;\n}\n\nWorkbenchWindowAdvisor::~WorkbenchWindowAdvisor()\n{\n}\n\nvoid WorkbenchWindowAdvisor::PreWindowOpen()\n{\n  \/\/ do nothing\n}\n\nActionBarAdvisor::Pointer WorkbenchWindowAdvisor::CreateActionBarAdvisor(\n    IActionBarConfigurer::Pointer configurer)\n{\n  ActionBarAdvisor::Pointer actionBarAdvisor(new ActionBarAdvisor(configurer));\n  return actionBarAdvisor;\n}\n\nvoid WorkbenchWindowAdvisor::PostWindowRestore()\n{\n  \/\/ do nothing\n}\n\nvoid WorkbenchWindowAdvisor::OpenIntro()\n{\n  \/\/ TODO: Refactor this into an IIntroManager.openIntro(IWorkbenchWindow) call\n\n  \/\/ introOpened flag needs to be global\n  IWorkbenchConfigurer::Pointer wbConfig = GetWindowConfigurer()->GetWorkbenchConfigurer();\n  std::string key = \"introOpened\"; \/\/$NON-NLS-1$\n  ObjectBool::Pointer introOpened = wbConfig->GetData(key).Cast<ObjectBool>();\n  if (introOpened && introOpened->GetValue())\n  {\n    return;\n  }\n\n  wbConfig->SetData(key, ObjectBool::Pointer(new ObjectBool(true)));\n\n  IPreferences::Pointer workbenchPrefs = WorkbenchPlugin::GetDefault()->GetPreferencesService()->GetSystemPreferences();\n\n  bool showIntro = workbenchPrefs->GetBool(WorkbenchPreferenceConstants::SHOW_INTRO, true);\n\n  IIntroManager* introManager = wbConfig->GetWorkbench()->GetIntroManager();\n\n  bool hasIntro = introManager->HasIntro();\n  bool isNewIntroContentAvailable = introManager->IsNewContentAvailable();\n\n  if (hasIntro && (showIntro || isNewIntroContentAvailable))\n  {\n    introManager\n    ->ShowIntro(GetWindowConfigurer()->GetWindow(), false);\n\n   \/* workbenchPrefs->PutBool(WorkbenchPreferenceConstants::SHOW_INTRO, false);\n    workbenchPrefs->Flush();*\/\n  }\n}\n\nvoid WorkbenchWindowAdvisor::PostWindowCreate()\n{\n  \/\/ do nothing\n}\n\nvoid WorkbenchWindowAdvisor::PostWindowOpen()\n{\n  \/\/ do nothing\n}\n\nbool WorkbenchWindowAdvisor::PreWindowShellClose()\n{\n  \/\/ do nothing, but allow the close() to proceed\n  return true;\n}\n\nvoid WorkbenchWindowAdvisor::PostWindowClose()\n{\n  \/\/ do nothing\n}\n\nvoid WorkbenchWindowAdvisor::CreateWindowContents(Shell::Pointer shell)\n{\n  this->GetWindowConfigurer().Cast<WorkbenchWindowConfigurer>()->CreateDefaultContents(shell);\n}\n\nvoid* WorkbenchWindowAdvisor::CreateEmptyWindowContents(void*  \/*parent*\/)\n{\n  return 0;\n}\n\nbool WorkbenchWindowAdvisor::SaveState(IMemento::Pointer  \/*memento*\/)\n{\n  \/\/ do nothing\n  return true;\n}\n\nbool WorkbenchWindowAdvisor::RestoreState(IMemento::Pointer  \/*memento*\/)\n{\n  \/\/ do nothing\n  return true;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: XMLEmbeddedObjectExportFilter.hxx,v $\n *\n *  $Revision: 1.1 $\n *\n *  last change: $Author: mib $ $Date: 2001-05-09 12:06: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#ifndef _XMLOFF_XMLEMBEDDEDOBJECTEXPORTFILTER_HXX\n#define _XMLOFF_XMLEMBEDDEDOBJECTEXPORTFILTER_HXX\n\n#ifndef _COM_SUN_STAR_XML_SAX_XEXTENDEDDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XExtendedDocumentHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase3.hxx>\n#endif\n\nclass XMLEmbeddedObjectExportFilter : public ::cppu::WeakImplHelper3<\n             ::com::sun::star::xml::sax::XExtendedDocumentHandler,\n             ::com::sun::star::lang::XServiceInfo,\n             ::com::sun::star::lang::XInitialization>\n{\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::xml::sax::XDocumentHandler > xHandler;\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::xml::sax::XExtendedDocumentHandler > xExtHandler;\n\npublic:\n    XMLEmbeddedObjectExportFilter() throw();\n    XMLEmbeddedObjectExportFilter( const ::com::sun::star::uno::Reference<\n        ::com::sun::star::xml::sax::XDocumentHandler > & rHandler ) throw();\n    virtual ~XMLEmbeddedObjectExportFilter () throw();\n\n    \/\/ ::com::sun::star::xml::sax::XDocumentHandler\n    virtual void SAL_CALL startDocument(void)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL endDocument(void)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL startElement(const ::rtl::OUString& aName,\n                              const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList > & xAttribs)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL endElement(const ::rtl::OUString& aName)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL characters(const ::rtl::OUString& aChars)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL ignorableWhitespace(const ::rtl::OUString& aWhitespaces)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL processingInstruction(const ::rtl::OUString& aTarget,\n                                       const ::rtl::OUString& aData)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL setDocumentLocator(const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XLocator > & xLocator)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n\n    \/\/ ::com::sun::star::xml::sax::XExtendedDocumentHandler\n    virtual void SAL_CALL startCDATA(void) throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL endCDATA(void) throw( ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL comment(const ::rtl::OUString& sComment)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL allowLineBreak(void)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL unknown(const ::rtl::OUString& sString)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n\n    \/\/ XInitialization\n    virtual void SAL_CALL initialize( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& aArguments ) throw(::com::sun::star::uno::Exception, ::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};\n\n#endif  \/\/  _XMLOFF_XMLEMBEDDEDOBJECTEXPORTFILTER_HXX\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.640); FILE MERGED 2005\/09\/05 14:37:54 rt 1.1.640.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLEmbeddedObjectExportFilter.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 12:48:00 $\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_XMLEMBEDDEDOBJECTEXPORTFILTER_HXX\n#define _XMLOFF_XMLEMBEDDEDOBJECTEXPORTFILTER_HXX\n\n#ifndef _COM_SUN_STAR_XML_SAX_XEXTENDEDDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XExtendedDocumentHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase3.hxx>\n#endif\n\nclass XMLEmbeddedObjectExportFilter : public ::cppu::WeakImplHelper3<\n             ::com::sun::star::xml::sax::XExtendedDocumentHandler,\n             ::com::sun::star::lang::XServiceInfo,\n             ::com::sun::star::lang::XInitialization>\n{\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::xml::sax::XDocumentHandler > xHandler;\n    ::com::sun::star::uno::Reference<\n        ::com::sun::star::xml::sax::XExtendedDocumentHandler > xExtHandler;\n\npublic:\n    XMLEmbeddedObjectExportFilter() throw();\n    XMLEmbeddedObjectExportFilter( const ::com::sun::star::uno::Reference<\n        ::com::sun::star::xml::sax::XDocumentHandler > & rHandler ) throw();\n    virtual ~XMLEmbeddedObjectExportFilter () throw();\n\n    \/\/ ::com::sun::star::xml::sax::XDocumentHandler\n    virtual void SAL_CALL startDocument(void)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL endDocument(void)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL startElement(const ::rtl::OUString& aName,\n                              const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList > & xAttribs)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL endElement(const ::rtl::OUString& aName)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL characters(const ::rtl::OUString& aChars)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL ignorableWhitespace(const ::rtl::OUString& aWhitespaces)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL processingInstruction(const ::rtl::OUString& aTarget,\n                                       const ::rtl::OUString& aData)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL setDocumentLocator(const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XLocator > & xLocator)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n\n    \/\/ ::com::sun::star::xml::sax::XExtendedDocumentHandler\n    virtual void SAL_CALL startCDATA(void) throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL endCDATA(void) throw( ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL comment(const ::rtl::OUString& sComment)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL allowLineBreak(void)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL unknown(const ::rtl::OUString& sString)\n        throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n\n    \/\/ XInitialization\n    virtual void SAL_CALL initialize( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& aArguments ) throw(::com::sun::star::uno::Exception, ::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};\n\n#endif  \/\/  _XMLOFF_XMLEMBEDDEDOBJECTEXPORTFILTER_HXX\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2018 Red Hat, Inc.\n *\n * Licensed under the GNU Lesser General Public License Version 2.1\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#ifndef _LIBDNF_OPTION_HPP\n#define _LIBDNF_OPTION_HPP\n\n#ifdef LIBDNF_UNSTABLE_API\n\n#include <stdexcept>\n#include <string>\n\nnamespace libdnf {\n\nclass Option {\npublic:\n    enum class Priority {\n        EMPTY = 0,\n        DEFAULT = 10,\n        MAINCONFIG = 20,\n        AUTOMATICCONFIG = 30,\n        REPOCONFIG = 40,\n        PLUGINDEFAULT = 50,\n        PLUGINCONFIG = 60,\n        COMMANDLINE = 70,\n        RUNTIME = 80\n    };\n\n    struct Exception : public std::runtime_error {\n        Exception(const std::string & msg) : runtime_error(msg) {}\n        Exception(const char * msg) : runtime_error(msg) {}\n    };\n    struct InvalidValue : Exception {\n        InvalidValue(const std::string & msg) : Exception(msg) {}\n        InvalidValue(const char * msg) : Exception(msg) {}\n    };\n    struct ValueNotSet : Exception {\n        ValueNotSet(const std::string & msg) : Exception(msg) {}\n        ValueNotSet(const char * msg) : Exception(msg) {}\n    };\n\n    Option(Priority priority = Priority::EMPTY);\n    virtual Option * clone() const = 0;\n    virtual Priority getPriority() const;\n    virtual void set(Priority priority, const std::string & value) = 0;\n    virtual std::string getValueString() const = 0;\n    virtual bool empty() const noexcept;\n    virtual ~Option() = default;\n\nprotected:\n    Priority priority;\n};\n\ninline Option::Option(Priority priority)\n: priority(priority) {}\n\ninline Option::Priority Option::getPriority() const\n{\n    return priority;\n}\n\ninline bool Option::empty() const noexcept\n{\n    return priority == Priority::EMPTY;\n}\n\n}\n\n#endif\n\n#endif\n<commit_msg>set priority of dnf.conf.d drop-ins<commit_after>\/*\n * Copyright (C) 2018 Red Hat, Inc.\n *\n * Licensed under the GNU Lesser General Public License Version 2.1\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#ifndef _LIBDNF_OPTION_HPP\n#define _LIBDNF_OPTION_HPP\n\n#ifdef LIBDNF_UNSTABLE_API\n\n#include <stdexcept>\n#include <string>\n\nnamespace libdnf {\n\nclass Option {\npublic:\n    enum class Priority {\n        EMPTY = 0,\n        DEFAULT = 10,\n        MAINCONFIG = 20,\n        AUTOMATICCONFIG = 30,\n        REPOCONFIG = 40,\n        PLUGINDEFAULT = 50,\n        PLUGINCONFIG = 60,\n        DROPINCONFIG = 65,\n        COMMANDLINE = 70,\n        RUNTIME = 80\n    };\n\n    struct Exception : public std::runtime_error {\n        Exception(const std::string & msg) : runtime_error(msg) {}\n        Exception(const char * msg) : runtime_error(msg) {}\n    };\n    struct InvalidValue : Exception {\n        InvalidValue(const std::string & msg) : Exception(msg) {}\n        InvalidValue(const char * msg) : Exception(msg) {}\n    };\n    struct ValueNotSet : Exception {\n        ValueNotSet(const std::string & msg) : Exception(msg) {}\n        ValueNotSet(const char * msg) : Exception(msg) {}\n    };\n\n    Option(Priority priority = Priority::EMPTY);\n    virtual Option * clone() const = 0;\n    virtual Priority getPriority() const;\n    virtual void set(Priority priority, const std::string & value) = 0;\n    virtual std::string getValueString() const = 0;\n    virtual bool empty() const noexcept;\n    virtual ~Option() = default;\n\nprotected:\n    Priority priority;\n};\n\ninline Option::Option(Priority priority)\n: priority(priority) {}\n\ninline Option::Priority Option::getPriority() const\n{\n    return priority;\n}\n\ninline bool Option::empty() const noexcept\n{\n    return priority == Priority::EMPTY;\n}\n\n}\n\n#endif\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"Arith256.h\"\n#include \"Runtime.h\"\n#include \"Type.h\"\n\n#include <llvm\/IR\/Function.h>\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nArith256::Arith256(llvm::IRBuilder<>& _builder) :\n\tCompilerHelper(_builder)\n{\n\tusing namespace llvm;\n\n\tm_result = m_builder.CreateAlloca(Type::Word, nullptr, \"arith.result\");\n\tm_arg1 = m_builder.CreateAlloca(Type::Word, nullptr, \"arith.arg1\");\n\tm_arg2 = m_builder.CreateAlloca(Type::Word, nullptr, \"arith.arg2\");\n\tm_arg3 = m_builder.CreateAlloca(Type::Word, nullptr, \"arith.arg3\");\n\n\tusing Linkage = GlobalValue::LinkageTypes;\n\n\tllvm::Type* arg2Types[] = {Type::WordPtr, Type::WordPtr, Type::WordPtr};\n\tllvm::Type* arg3Types[] = {Type::WordPtr, Type::WordPtr, Type::WordPtr, Type::WordPtr};\n\n\tm_mul = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_mul\", getModule());\n\tm_div = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_div\", getModule());\n\tm_mod = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_mod\", getModule());\n\tm_sdiv = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_sdiv\", getModule());\n\tm_smod = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_smod\", getModule());\n\tm_exp = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_exp\", getModule());\n\tm_addmod = Function::Create(FunctionType::get(Type::Void, arg3Types, false), Linkage::ExternalLinkage, \"arith_addmod\", getModule());\n\tm_mulmod = Function::Create(FunctionType::get(Type::Void, arg3Types, false), Linkage::ExternalLinkage, \"arith_mulmod\", getModule());\n}\n\nArith256::~Arith256()\n{}\n\nllvm::Value* Arith256::binaryOp(llvm::Function* _op, llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\tm_builder.CreateStore(_arg1, m_arg1);\n\tm_builder.CreateStore(_arg2, m_arg2);\n\tm_builder.CreateCall3(_op, m_arg1, m_arg2, m_result);\n\treturn m_builder.CreateLoad(m_result);\n}\n\nllvm::Value* Arith256::ternaryOp(llvm::Function* _op, llvm::Value* _arg1, llvm::Value* _arg2, llvm::Value* _arg3)\n{\n\tm_builder.CreateStore(_arg1, m_arg1);\n\tm_builder.CreateStore(_arg2, m_arg2);\n\tm_builder.CreateStore(_arg3, m_arg3);\n\tm_builder.CreateCall4(_op, m_arg1, m_arg2, m_arg3, m_result);\n\treturn m_builder.CreateLoad(m_result);\n}\n\nllvm::Value* Arith256::mul(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_mul, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::div(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_div, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::mod(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_mod, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::sdiv(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_sdiv, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::smod(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_smod, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::exp(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_exp, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::addmod(llvm::Value* _arg1, llvm::Value* _arg2, llvm::Value* _arg3)\n{\n\treturn ternaryOp(m_addmod, _arg1, _arg2, _arg3);\n}\n\nllvm::Value* Arith256::mulmod(llvm::Value* _arg1, llvm::Value* _arg2, llvm::Value* _arg3)\n{\n\treturn ternaryOp(m_mulmod, _arg1, _arg2, _arg3);\n}\n\n\n}\n}\n}\n\n\nextern \"C\"\n{\n\n\tusing namespace dev::eth::jit;\n\tusing s256 = boost::multiprecision::int256_t;\n\n\tEXPORT void arith_mul(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg1 * arg2);\n\t}\n\n\tEXPORT void arith_div(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg2 == 0 ? arg2 : arg1 \/ arg2);\n\t}\n\n\tEXPORT void arith_mod(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg2 == 0 ? arg2 : arg1 % arg2);\n\t}\n\n\tEXPORT void arith_sdiv(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg2 == 0 ? arg2 : (arg1.convert_to<s256>() \/ arg2.convert_to<s256>()).convert_to<u256>());\n\t}\n\n\tEXPORT void arith_smod(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg2 == 0 ? arg2 : (arg1.convert_to<s256>() % arg2.convert_to<s256>()).convert_to<u256>());\n\t}\n\n\tEXPORT void arith_exp(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tbigint left = llvm2eth(*_arg1);\n\t\tbigint right = llvm2eth(*_arg2);\n\t\tauto ret = static_cast<u256>(boost::multiprecision::powm(left, right, bigint(2) << 256));\n\t\t*o_result = eth2llvm(ret);\n\t}\n\n\tEXPORT void arith_mulmod(i256* _arg1, i256* _arg2, i256* _arg3, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\tauto arg3 = llvm2eth(*_arg3);\n\t\t*o_result = eth2llvm(u256((bigint(arg1) * bigint(arg2)) % arg3));\n\t}\n\n\tEXPORT void arith_addmod(i256* _arg1, i256* _arg2, i256* _arg3, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\tauto arg3 = llvm2eth(*_arg3);\n\t\t*o_result = eth2llvm(u256((bigint(arg1) + bigint(arg2)) % arg3));\n\t}\n\n}\n\n\n<commit_msg>SDIV & SMOD fixed<commit_after>#include \"Arith256.h\"\n#include \"Runtime.h\"\n#include \"Type.h\"\n\n#include <llvm\/IR\/Function.h>\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nArith256::Arith256(llvm::IRBuilder<>& _builder) :\n\tCompilerHelper(_builder)\n{\n\tusing namespace llvm;\n\n\tm_result = m_builder.CreateAlloca(Type::Word, nullptr, \"arith.result\");\n\tm_arg1 = m_builder.CreateAlloca(Type::Word, nullptr, \"arith.arg1\");\n\tm_arg2 = m_builder.CreateAlloca(Type::Word, nullptr, \"arith.arg2\");\n\tm_arg3 = m_builder.CreateAlloca(Type::Word, nullptr, \"arith.arg3\");\n\n\tusing Linkage = GlobalValue::LinkageTypes;\n\n\tllvm::Type* arg2Types[] = {Type::WordPtr, Type::WordPtr, Type::WordPtr};\n\tllvm::Type* arg3Types[] = {Type::WordPtr, Type::WordPtr, Type::WordPtr, Type::WordPtr};\n\n\tm_mul = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_mul\", getModule());\n\tm_div = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_div\", getModule());\n\tm_mod = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_mod\", getModule());\n\tm_sdiv = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_sdiv\", getModule());\n\tm_smod = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_smod\", getModule());\n\tm_exp = Function::Create(FunctionType::get(Type::Void, arg2Types, false), Linkage::ExternalLinkage, \"arith_exp\", getModule());\n\tm_addmod = Function::Create(FunctionType::get(Type::Void, arg3Types, false), Linkage::ExternalLinkage, \"arith_addmod\", getModule());\n\tm_mulmod = Function::Create(FunctionType::get(Type::Void, arg3Types, false), Linkage::ExternalLinkage, \"arith_mulmod\", getModule());\n}\n\nArith256::~Arith256()\n{}\n\nllvm::Value* Arith256::binaryOp(llvm::Function* _op, llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\tm_builder.CreateStore(_arg1, m_arg1);\n\tm_builder.CreateStore(_arg2, m_arg2);\n\tm_builder.CreateCall3(_op, m_arg1, m_arg2, m_result);\n\treturn m_builder.CreateLoad(m_result);\n}\n\nllvm::Value* Arith256::ternaryOp(llvm::Function* _op, llvm::Value* _arg1, llvm::Value* _arg2, llvm::Value* _arg3)\n{\n\tm_builder.CreateStore(_arg1, m_arg1);\n\tm_builder.CreateStore(_arg2, m_arg2);\n\tm_builder.CreateStore(_arg3, m_arg3);\n\tm_builder.CreateCall4(_op, m_arg1, m_arg2, m_arg3, m_result);\n\treturn m_builder.CreateLoad(m_result);\n}\n\nllvm::Value* Arith256::mul(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_mul, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::div(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_div, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::mod(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_mod, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::sdiv(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_sdiv, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::smod(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_smod, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::exp(llvm::Value* _arg1, llvm::Value* _arg2)\n{\n\treturn binaryOp(m_exp, _arg1, _arg2);\n}\n\nllvm::Value* Arith256::addmod(llvm::Value* _arg1, llvm::Value* _arg2, llvm::Value* _arg3)\n{\n\treturn ternaryOp(m_addmod, _arg1, _arg2, _arg3);\n}\n\nllvm::Value* Arith256::mulmod(llvm::Value* _arg1, llvm::Value* _arg2, llvm::Value* _arg3)\n{\n\treturn ternaryOp(m_mulmod, _arg1, _arg2, _arg3);\n}\n\nnamespace\n{\n\tusing s256 = boost::multiprecision::int256_t;\n\n\tinline s256 u2s(u256 _u)\n\t{\n\t\tstatic const bigint c_end = (bigint)1 << 256;\n\t\tstatic const u256 c_send = (u256)1 << 255;\n\t\tif (_u < c_send)\n\t\t\treturn (s256)_u;\n\t\telse\n\t\t\treturn (s256)-(c_end - _u);\n\t}\n\n\tinline u256 s2u(s256 _u)\n\t{\n\t\tstatic const bigint c_end = (bigint)1 << 256;\n\t\tif (_u >= 0)\n\t\t\treturn (u256)_u;\n\t\telse\n\t\t\treturn (u256)(c_end + _u);\n\t}\n}\n\n}\n}\n}\n\n\nextern \"C\"\n{\n\n\tusing namespace dev::eth::jit;\n\n\tEXPORT void arith_mul(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg1 * arg2);\n\t}\n\n\tEXPORT void arith_div(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg2 == 0 ? arg2 : arg1 \/ arg2);\n\t}\n\n\tEXPORT void arith_mod(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg2 == 0 ? arg2 : arg1 % arg2);\n\t}\n\n\tEXPORT void arith_sdiv(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg2 == 0 ? arg2 : s2u(u2s(arg1) \/ u2s(arg2)));\n\t}\n\n\tEXPORT void arith_smod(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\t*o_result = eth2llvm(arg2 == 0 ? arg2 : s2u(u2s(arg1) % u2s(arg2)));\n\t}\n\n\tEXPORT void arith_exp(i256* _arg1, i256* _arg2, i256* o_result)\n\t{\n\t\tbigint left = llvm2eth(*_arg1);\n\t\tbigint right = llvm2eth(*_arg2);\n\t\tauto ret = static_cast<u256>(boost::multiprecision::powm(left, right, bigint(2) << 256));\n\t\t*o_result = eth2llvm(ret);\n\t}\n\n\tEXPORT void arith_mulmod(i256* _arg1, i256* _arg2, i256* _arg3, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\tauto arg3 = llvm2eth(*_arg3);\n\t\t*o_result = eth2llvm(u256((bigint(arg1) * bigint(arg2)) % arg3));\n\t}\n\n\tEXPORT void arith_addmod(i256* _arg1, i256* _arg2, i256* _arg3, i256* o_result)\n\t{\n\t\tauto arg1 = llvm2eth(*_arg1);\n\t\tauto arg2 = llvm2eth(*_arg2);\n\t\tauto arg3 = llvm2eth(*_arg3);\n\t\t*o_result = eth2llvm(u256((bigint(arg1) + bigint(arg2)) % arg3));\n\t}\n\n}\n\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 \"net\/quic\/quic_flags.h\"\n\n\/\/ TODO(rtenneti): Remove this.\n\/\/ Do not flip this flag until the flakiness of the\n\/\/ net\/tools\/quic\/end_to_end_test is fixed.\n\/\/ If true, then QUIC connections will track the retransmission history of a\n\/\/ packet so that an ack of a previous transmission will ack the data of all\n\/\/ other transmissions.\nbool FLAGS_track_retransmission_history = false;\n\n\/\/ Do not remove this flag until the Finch-trials described in b\/11706275\n\/\/ are complete.\n\/\/ If true, QUIC connections will support the use of a pacing algorithm when\n\/\/ sending packets, in an attempt to reduce packet loss.  The client must also\n\/\/ request pacing for the server to enable it.\nbool FLAGS_enable_quic_pacing = true;\n\n\/\/ Do not remove this flag until b\/11792453 is marked as Fixed.\n\/\/ If true, turns on stream flow control in QUIC.\n\/\/ If this is disabled, all in flight QUIC connections talking QUIC_VERSION_17\n\/\/ or higher will timeout. New connections will be fine.\n\/\/ If disabling this flag, also disable enable_quic_connection_flow_control.\nbool FLAGS_enable_quic_stream_flow_control_2 = true;\n\n\/\/ Do not remove this flag until b\/11792453 is marked as Fixed.\n\/\/ If true, turns on connection level flow control in QUIC.\n\/\/ If this is disabled, all in flight QUIC connections talking QUIC_VERSION_19\n\/\/ or higher will timeout. New connections will be fine.\nbool FLAGS_enable_quic_connection_flow_control = true;\n\nbool FLAGS_quic_allow_oversized_packets_for_test = false;\n\n\/\/ When true, the use time based loss detection instead of nack.\nbool FLAGS_quic_use_time_loss_detection = false;\n\n\/\/ If true, allow peer port migration of established QUIC connections.\nbool FLAGS_quic_allow_port_migration = true;\n<commit_msg>Rollback FLAGS_enable_quic_connection_flow_control due to bug in latest internal server.<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 \"net\/quic\/quic_flags.h\"\n\n\/\/ TODO(rtenneti): Remove this.\n\/\/ Do not flip this flag until the flakiness of the\n\/\/ net\/tools\/quic\/end_to_end_test is fixed.\n\/\/ If true, then QUIC connections will track the retransmission history of a\n\/\/ packet so that an ack of a previous transmission will ack the data of all\n\/\/ other transmissions.\nbool FLAGS_track_retransmission_history = false;\n\n\/\/ Do not remove this flag until the Finch-trials described in b\/11706275\n\/\/ are complete.\n\/\/ If true, QUIC connections will support the use of a pacing algorithm when\n\/\/ sending packets, in an attempt to reduce packet loss.  The client must also\n\/\/ request pacing for the server to enable it.\nbool FLAGS_enable_quic_pacing = true;\n\n\/\/ Do not remove this flag until b\/11792453 is marked as Fixed.\n\/\/ If true, turns on stream flow control in QUIC.\n\/\/ If this is disabled, all in flight QUIC connections talking QUIC_VERSION_17\n\/\/ or higher will timeout. New connections will be fine.\n\/\/ If disabling this flag, also disable enable_quic_connection_flow_control.\nbool FLAGS_enable_quic_stream_flow_control_2 = true;\n\n\/\/ Do not remove this flag until b\/11792453 is marked as Fixed.\n\/\/ If true, turns on connection level flow control in QUIC.\n\/\/ If this is disabled, all in flight QUIC connections talking QUIC_VERSION_19\n\/\/ or higher will timeout. New connections will be fine.\n\/\/ Disabled due to b\/15084203.\nbool FLAGS_enable_quic_connection_flow_control = false;\n\nbool FLAGS_quic_allow_oversized_packets_for_test = false;\n\n\/\/ When true, the use time based loss detection instead of nack.\nbool FLAGS_quic_use_time_loss_detection = false;\n\n\/\/ If true, allow peer port migration of established QUIC connections.\nbool FLAGS_quic_allow_port_migration = true;\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <type_traits>\n#include <tuple>\n#include <agency\/detail\/tuple.hpp>\n#include <agency\/detail\/shape_cast.hpp>\n#include <agency\/coordinate.hpp>\n#include <agency\/detail\/tuple_utility.hpp>\n#include <agency\/detail\/point_size.hpp>\n\nnamespace agency\n{\nnamespace detail\n{\n\n\ntemplate<class Index, class Size>\n__AGENCY_ANNOTATION\nauto project_index_helper(const Index& idx, Size size_of_second_to_last_dimension)\n  -> typename std::decay<\n       decltype(\n         unwrap_single_element_tuple(__tu::tuple_drop_last(idx))\n       )\n     >::type\n{\n  auto result = detail::tuple_drop_last(idx);\n\n  \/\/ multiply the index by the size of the second to last dimension and add\n  \/\/ that to the second to last index\n  __tu::tuple_last(result) += size_of_second_to_last_dimension * __tu::tuple_last(idx);\n\n  return unwrap_single_element_tuple(result);\n}\n\n\ntemplate<class Index, class Shape>\n__AGENCY_ANNOTATION\nauto project_index(const Index& idx, const Shape& shape)\n  -> decltype(\n       detail::make_tuple(\n         project_index_helper(idx, __tu::tuple_last(shape)),\n         project_shape(shape)\n       )\n     )\n{\n  \/\/ to project an index into the next lower dimension,\n  \/\/ we combine the last two dimensions into one\n\n  \/\/ for a 2D example, consider finding the 1D rank of element (2,2) \n  \/\/ in a 5 x 4-shaped grid.\n  \/\/ element (2,2)'s rank is 12 in this grid\n  \/\/ given idx = (x,y) = (2,2) and shape = (width,height) = (5,4)\n  \/\/ (2,2)'s 1D rank is computed as\n  \/\/ y * width + x\n\n  auto size_of_second_to_last_dimension = __tu::tuple_last(detail::tuple_drop_last(shape));\n\n  auto projected_index = project_index_helper(idx, size_of_second_to_last_dimension);\n\n  \/\/ project the shape\n  \/\/ this creates a lower dimensional grid with\n  \/\/ the same number of cells\n  \/\/ for the shape = (5,4) example, this will compute\n  \/\/ a 1D shape of 20\n  auto projected_shape = project_shape(shape);\n\n  return detail::make_tuple(projected_index, projected_shape);\n}\n\n\ntemplate<class Tuple,\n         class = typename std::enable_if<\n           !std::is_integral<\n              typename std::decay<Tuple>::type\n            >::value\n         >::type>\n__AGENCY_ANNOTATION\nauto wrap_scalar(Tuple&& t)\n  -> decltype(std::forward<Tuple>(t))\n{\n  return std::forward<Tuple>(t);\n}\n\n\ntemplate<class T,\n         class = typename std::enable_if<\n           std::is_integral<\n             typename std::decay<T>::type\n           >::value\n         >::type>\n__AGENCY_ANNOTATION\nauto wrap_scalar(T&& x)\n  -> decltype(\n       rebind_point_size_t<\n         typename std::decay<T>::type,\n         1\n       >{std::forward<T>(x)}\n     )\n{\n  return rebind_point_size_t<\n    typename std::decay<T>::type,\n    1\n  >{std::forward<T>(x)};\n}\n\n\nnamespace index_cast_detail\n{\n\n\n\/\/ to lift a point-like type, add a dimension\ntemplate<class Index>\nstruct lift_t_impl\n{\n  using type = rebind_point_size_t<Index, point_size<Index>::value + 1>;\n};\n\n\n\/\/ to lift a heterogeneous Tuple-like type, repeat the type of the last element\ntemplate<template<class...> class tuple, class T, class... Types>\nstruct lift_t_impl<tuple<T,Types...>>\n{\n  using last_type = typename std::tuple_element<sizeof...(Types)-1, std::tuple<Types...>>::type;\n  using type = tuple<T,Types...,last_type>;\n};\n\n\ntemplate<class T>\nstruct make\n{\n  template<class... Args>\n  __AGENCY_ANNOTATION\n  T operator()(Args&&... args) const\n  {\n    return T{std::forward<Args>(args)...};\n  }\n};\n\n\n} \/\/ end index_cast_detail\n\n\ntemplate<class Point>\nusing lift_t = typename index_cast_detail::lift_t_impl<Point>::type;\n\n\ntemplate<class Index, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ndetail::tuple<lift_t<Index>, lift_t<FromShape>>\n  lift_index(const Index& idx, const FromShape& from_shape, const ToShape& to_shape)\n{\n  \/\/ to lift idx into to_shape,\n  \/\/ take the last element of idx and divide by the corresponding element of to_shape\n  \/\/ replace the last element of idx with the remainder and append the quotient\n  const auto i = index_size<Index>::value - 1;\n\n  auto idx_tuple = wrap_scalar(idx);\n\n  auto intermediate_result = idx_tuple;\n  __tu::tuple_last(intermediate_result) %= detail::get<i>(to_shape);\n\n  auto index_maker = index_cast_detail::make<lift_t<Index>>{};\n\n  auto lifted_index = __tu::tuple_append_invoke(intermediate_result, __tu::tuple_last(idx_tuple) \/ detail::get<i>(to_shape), index_maker);\n\n  \/\/ to lift from_shape, simply append the element of to_shape we just divided by\n  auto shape_maker = index_cast_detail::make<lift_t<FromShape>>{};\n  auto lifted_shape = __tu::tuple_append_invoke(wrap_scalar(from_shape), detail::get<i>(to_shape), shape_maker);\n\n  return detail::make_tuple(lifted_index, lifted_shape);\n}\n\n\n\/\/ index_cast is recursive and has various overloads\n\/\/ declare them here before their definitions\n\n\/\/ scalar -> scalar (base case)\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value == index_size<ToIndex>::value) &&\n  (index_size<FromIndex>::value == 1),\n  ToShape\n>::type\n  index_cast(const FromIndex& from_idx, const FromShape& from_shape, const ToShape& to_shape);\n\n\n\/\/ recursive case for casting two indices of equal size\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value == index_size<ToIndex>::value) &&\n  (index_size<FromIndex>::value > 1),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape& to_shape);\n\n\n\/\/ upcast (recursive)\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value < index_size<ToIndex>::value),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape&   to_shape);\n\n\n\/\/ downcast (recursive)\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value > index_size<ToIndex>::value),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape& to_shape);\n\n\n\/\/ definitions of index_cast follow\n\n\n\/\/ terminal case for casting indices of size 1\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value == index_size<ToIndex>::value) &&\n  (index_size<FromIndex>::value == 1),\n  ToShape\n>::type\n  index_cast(const FromIndex& from_idx, const FromShape&, const ToShape&)\n{\n  \/\/ from_idx might not be a tuple, but instead a scalar type\n  \/\/ to ensure we can get the 0th value from from_idx in a uniform way, wrap it first\n  return static_cast<ToIndex>(detail::get<0>(wrap_scalar(from_idx)));\n}\n\n\nstruct index_cast_functor\n{\n  template<class ToIndex, class FromIndex, class FromShape, class ToShape>\n  __AGENCY_ANNOTATION\n  auto operator()(const ToIndex&, const FromIndex& from_idx, const FromShape& from_shape, const ToShape& to_shape)\n    -> decltype(\n          index_cast<ToIndex>(from_idx, from_shape, to_shape)\n       )\n  {\n    return index_cast<ToIndex>(from_idx, from_shape, to_shape);\n  }\n};\n\n\n\n\/\/ when both index types are the same size, index_cast recursively maps itself across the tuples\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value == index_size<ToIndex>::value) &&\n  (index_size<FromIndex>::value > 1),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape& to_shape)\n{\n  return __tu::tuple_map_with_make(index_cast_functor{}, index_cast_detail::make<ToIndex>{}, ToIndex{}, from_idx, from_shape, to_shape);\n}\n\n\n\/\/ when FromIndex has fewer elements than ToIndex, we lift it and then cast\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value < index_size<ToIndex>::value),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape&   to_shape)\n{\n  auto lifted_idx_and_shape = lift_index(from_idx, from_shape, to_shape);\n  return index_cast<ToIndex>(detail::get<0>(lifted_idx_and_shape), detail::get<1>(lifted_idx_and_shape), to_shape);\n}\n\n\n\/\/ when FromIndex has more elements than ToIndex, we project it and then cast\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value > index_size<ToIndex>::value),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape& to_shape)\n{\n  auto projected_idx_and_shape = project_index(from_idx, from_shape);\n  return index_cast<ToIndex>(detail::get<0>(projected_idx_and_shape), detail::get<1>(projected_idx_and_shape), to_shape);\n}\n\n                     \n} \/\/ end detail\n} \/\/ end agency\n\n<commit_msg>Diffentiate between project_index() & project_index_and_shape()<commit_after>#pragma once\n\n#include <type_traits>\n#include <tuple>\n#include <agency\/detail\/tuple.hpp>\n#include <agency\/detail\/shape_cast.hpp>\n#include <agency\/coordinate.hpp>\n#include <agency\/detail\/tuple_utility.hpp>\n#include <agency\/detail\/point_size.hpp>\n\nnamespace agency\n{\nnamespace detail\n{\n\n\ntemplate<class Tuple,\n         class = typename std::enable_if<\n           !std::is_integral<\n              typename std::decay<Tuple>::type\n            >::value\n         >::type>\n__AGENCY_ANNOTATION\nauto wrap_scalar(Tuple&& t)\n  -> decltype(std::forward<Tuple>(t))\n{\n  return std::forward<Tuple>(t);\n}\n\n\ntemplate<class T,\n         class = typename std::enable_if<\n           std::is_integral<\n             typename std::decay<T>::type\n           >::value\n         >::type>\n__AGENCY_ANNOTATION\nauto wrap_scalar(T&& x)\n  -> decltype(\n       rebind_point_size_t<\n         typename std::decay<T>::type,\n         1\n       >{std::forward<T>(x)}\n     )\n{\n  return rebind_point_size_t<\n    typename std::decay<T>::type,\n    1\n  >{std::forward<T>(x)};\n}\n\n\ntemplate<class IndexTuple, class Size>\n__AGENCY_ANNOTATION\nauto project_index_and_shape_helper(const IndexTuple& idx, Size size_of_second_to_last_dimension)\n  -> typename std::decay<\n       decltype(\n         unwrap_single_element_tuple(__tu::tuple_drop_last(idx))\n       )\n     >::type\n{\n  auto result = detail::tuple_drop_last(idx);\n\n  \/\/ multiply the index by the size of the second to last dimension and add\n  \/\/ that to the second to last index\n  __tu::tuple_last(result) += size_of_second_to_last_dimension * __tu::tuple_last(idx);\n\n  return unwrap_single_element_tuple(result);\n}\n\n\ntemplate<class IndexTuple, class ShapeTuple>\n__AGENCY_ANNOTATION\nauto project_index(const IndexTuple& idx, const ShapeTuple& shape)\n  -> decltype(\n       project_index_and_shape_helper(idx, __tu::tuple_last(detail::tuple_drop_last(shape)))\n     )\n{\n  \/\/ to project an index into the next lower dimension,\n  \/\/ we combine the last two dimensions into one\n\n  \/\/ for a 2D example, consider finding the 1D rank of element (2,2) \n  \/\/ in a 5 x 4-shaped grid.\n  \/\/ element (2,2)'s rank is 12 in this grid\n  \/\/ given idx = (x,y) = (2,2) and shape = (width,height) = (5,4)\n  \/\/ (2,2)'s 1D rank is computed as\n  \/\/ y * width + x\n\n  auto size_of_second_to_last_dimension = __tu::tuple_last(detail::tuple_drop_last(shape));\n\n  return project_index_and_shape_helper(idx, size_of_second_to_last_dimension);\n}\n\n\ntemplate<class IndexTuple, class ShapeTuple>\n__AGENCY_ANNOTATION\nauto project_index_and_shape(const IndexTuple& idx, const ShapeTuple& shape)\n  -> decltype(\n       detail::make_tuple(\n         project_index(idx, shape),\n         project_shape(shape)\n       )\n     )\n{\n  \/\/ to project an index into the next lower dimension,\n  \/\/ we combine the last two dimensions into one\n\n  \/\/ for a 2D example, consider finding the 1D rank of element (2,2) \n  \/\/ in a 5 x 4-shaped grid.\n  \/\/ element (2,2)'s rank is 12 in this grid\n  \/\/ given idx = (x,y) = (2,2) and shape = (width,height) = (5,4)\n  \/\/ (2,2)'s 1D rank is computed as\n  \/\/ y * width + x\n  auto projected_index = project_index(idx, shape);\n\n  \/\/ project the shape\n  \/\/ this creates a lower dimensional grid with\n  \/\/ the same number of cells\n  \/\/ for the shape = (5,4) example, this will compute\n  \/\/ a 1D shape of 20\n  auto projected_shape = project_shape(shape);\n\n  return detail::make_tuple(projected_index, projected_shape);\n}\n\n\nnamespace index_cast_detail\n{\n\n\n\/\/ to lift a point-like type, add a dimension\ntemplate<class Index>\nstruct lift_t_impl\n{\n  using type = rebind_point_size_t<Index, point_size<Index>::value + 1>;\n};\n\n\n\/\/ to lift a heterogeneous Tuple-like type, repeat the type of the last element\ntemplate<template<class...> class tuple, class T, class... Types>\nstruct lift_t_impl<tuple<T,Types...>>\n{\n  using last_type = typename std::tuple_element<sizeof...(Types)-1, std::tuple<Types...>>::type;\n  using type = tuple<T,Types...,last_type>;\n};\n\n\ntemplate<class T>\nstruct make\n{\n  template<class... Args>\n  __AGENCY_ANNOTATION\n  T operator()(Args&&... args) const\n  {\n    return T{std::forward<Args>(args)...};\n  }\n};\n\n\n} \/\/ end index_cast_detail\n\n\ntemplate<class Point>\nusing lift_t = typename index_cast_detail::lift_t_impl<Point>::type;\n\n\ntemplate<class Index, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ndetail::tuple<lift_t<Index>, lift_t<FromShape>>\n  lift_index(const Index& idx, const FromShape& from_shape, const ToShape& to_shape)\n{\n  \/\/ to lift idx into to_shape,\n  \/\/ take the last element of idx and divide by the corresponding element of to_shape\n  \/\/ replace the last element of idx with the remainder and append the quotient\n  const auto i = index_size<Index>::value - 1;\n\n  auto idx_tuple = wrap_scalar(idx);\n\n  auto intermediate_result = idx_tuple;\n  __tu::tuple_last(intermediate_result) %= detail::get<i>(to_shape);\n\n  auto index_maker = index_cast_detail::make<lift_t<Index>>{};\n\n  auto lifted_index = __tu::tuple_append_invoke(intermediate_result, __tu::tuple_last(idx_tuple) \/ detail::get<i>(to_shape), index_maker);\n\n  \/\/ to lift from_shape, simply append the element of to_shape we just divided by\n  auto shape_maker = index_cast_detail::make<lift_t<FromShape>>{};\n  auto lifted_shape = __tu::tuple_append_invoke(wrap_scalar(from_shape), detail::get<i>(to_shape), shape_maker);\n\n  return detail::make_tuple(lifted_index, lifted_shape);\n}\n\n\n\/\/ index_cast is recursive and has various overloads\n\/\/ declare them here before their definitions\n\n\/\/ scalar -> scalar (base case)\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value == index_size<ToIndex>::value) &&\n  (index_size<FromIndex>::value == 1),\n  ToShape\n>::type\n  index_cast(const FromIndex& from_idx, const FromShape& from_shape, const ToShape& to_shape);\n\n\n\/\/ recursive case for casting two indices of equal size\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value == index_size<ToIndex>::value) &&\n  (index_size<FromIndex>::value > 1),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape& to_shape);\n\n\n\/\/ upcast (recursive)\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value < index_size<ToIndex>::value),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape&   to_shape);\n\n\n\/\/ downcast (recursive)\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value > index_size<ToIndex>::value),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape& to_shape);\n\n\n\/\/ definitions of index_cast follow\n\n\n\/\/ terminal case for casting indices of size 1\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value == index_size<ToIndex>::value) &&\n  (index_size<FromIndex>::value == 1),\n  ToShape\n>::type\n  index_cast(const FromIndex& from_idx, const FromShape&, const ToShape&)\n{\n  \/\/ from_idx might not be a tuple, but instead a scalar type\n  \/\/ to ensure we can get the 0th value from from_idx in a uniform way, wrap it first\n  return static_cast<ToIndex>(detail::get<0>(wrap_scalar(from_idx)));\n}\n\n\nstruct index_cast_functor\n{\n  template<class ToIndex, class FromIndex, class FromShape, class ToShape>\n  __AGENCY_ANNOTATION\n  auto operator()(const ToIndex&, const FromIndex& from_idx, const FromShape& from_shape, const ToShape& to_shape)\n    -> decltype(\n          index_cast<ToIndex>(from_idx, from_shape, to_shape)\n       )\n  {\n    return index_cast<ToIndex>(from_idx, from_shape, to_shape);\n  }\n};\n\n\n\n\/\/ when both index types are the same size, index_cast recursively maps itself across the tuples\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value == index_size<ToIndex>::value) &&\n  (index_size<FromIndex>::value > 1),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape& to_shape)\n{\n  return __tu::tuple_map_with_make(index_cast_functor{}, index_cast_detail::make<ToIndex>{}, ToIndex{}, from_idx, from_shape, to_shape);\n}\n\n\n\/\/ when FromIndex has fewer elements than ToIndex, we lift it and then cast\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value < index_size<ToIndex>::value),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape&   to_shape)\n{\n  auto lifted_idx_and_shape = lift_index(from_idx, from_shape, to_shape);\n  return index_cast<ToIndex>(detail::get<0>(lifted_idx_and_shape), detail::get<1>(lifted_idx_and_shape), to_shape);\n}\n\n\n\/\/ when FromIndex has more elements than ToIndex, we project it and then cast\ntemplate<class ToIndex, class FromIndex, class FromShape, class ToShape>\n__AGENCY_ANNOTATION\ntypename std::enable_if<\n  (index_size<FromIndex>::value > index_size<ToIndex>::value),\n  ToIndex\n>::type\n  index_cast(const FromIndex& from_idx,\n             const FromShape& from_shape,\n             const ToShape& to_shape)\n{\n  auto projected_idx_and_shape = project_index_and_shape(from_idx, from_shape);\n  return index_cast<ToIndex>(detail::get<0>(projected_idx_and_shape), detail::get<1>(projected_idx_and_shape), to_shape);\n}\n\n                     \n} \/\/ end detail\n} \/\/ end agency\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>loplugin:simplifybool<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* *****************************************************************\n *\n * Copyright 2015 Samsung Electronics All Rights Reserved.\n *\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 implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * *****************************************************************\/\n\n#include <ocstack.h>\n#include <oic_malloc.h>\n#include <OCApi.h>\n#include <OCPlatform_impl.h>\n#include <oxmjustworks.h>\n#include <oxmrandompin.h>\n#include <srmutility.h>\n#include <OCProvisioningManager.hpp>\n#include <gtest\/gtest.h>\n\n#define TIMEOUT 5\n\nnamespace OCProvisioningTest\n{\n    using namespace OC;\n\n    void resultCallback(PMResultList_t *result, int hasError)\n    {\n        (void)result;\n        (void)hasError;\n    }\n\n    TEST(ProvisionInitTest, TestWithEmptyPath)\n    {\n        std::string dbPath(\"\");\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionInit(dbPath));\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionClose());\n    }\n\n    TEST(ProvisionInitTest, TestValidPath)\n    {\n        std::string dbPath(\".\/dbPath.tmp\");\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionInit(dbPath));\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionClose());\n    }\n\n    TEST(DiscoveryTest, SecureResource)\n    {\n        std::shared_ptr< OC::OCSecureResource > secureResource;\n        OicUuid_t uuid;\n        ConvertStrToUuid(\"11111111-1111-1111-1111-111111111111\", &uuid);\n\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverSingleDevice(TIMEOUT, &uuid, secureResource));\n    }\n\n    TEST(DiscoveryTest, SecureResourceZeroTimeout)\n    {\n        std::shared_ptr< OC::OCSecureResource > secureResource;\n        OicUuid_t uuid;\n        ConvertStrToUuid(\"11111111-1111-1111-1111-111111111111\", &uuid);\n\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverSingleDevice(0, &uuid, secureResource));\n    }\n\n    TEST(DiscoveryTest, UnownedDevices)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverUnownedDevices(TIMEOUT, list));\n    }\n\n    TEST(DiscoveryTest, UnownedDevicesZeroTimeout)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverUnownedDevices(0, list));\n    }\n\n#ifdef MULTIPLE_OWNER\n    TEST(MOTDiscoveryTest, MultipleOwnerEnabledDevices)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverMultipleOwnerEnabledDevices(TIMEOUT, list));\n    }\n\n    TEST(MOTDiscoveryTest, MultipleOwnerEnabledDevicesZeroTimeOut)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverMultipleOwnerEnabledDevices(0, list));\n    }\n\n    TEST(MOTDiscoveryTest, MultipleOwnedDevices)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverMultipleOwnedDevices(TIMEOUT, list));\n    }\n\n    TEST(MOTDiscoveryTest, MultipleOwnedDevicesZeroTimeOut)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverMultipleOwnedDevices(0, list));\n    }\n#endif\n\n    TEST(DiscoveryTest, OwnedDevices)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverOwnedDevices(TIMEOUT, list));\n    }\n\n    TEST(DiscoveryTest, OwnedDevicesZeroTimeout)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverOwnedDevices(0, list));\n    }\n\n    TEST(OwnershipTest, OwnershipTransferNullCallback)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.doOwnershipTransfer(nullptr));\n    }\n\n#ifdef MULTIPLE_OWNER\n    TEST(MOTOwnershipTest, MOTOwnershipTransferNullCallback)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.doMultipleOwnershipTransfer(nullptr));\n    }\n\n    TEST(selectMOTMethodTest, selectMOTMethodNullCallback)\n    {\n        OCSecureResource device;\n        const OicSecOxm_t stsecOxm = OIC_PRECONFIG_PIN;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.selectMOTMethod(stsecOxm, nullptr));\n    }\n\n    TEST(changeMOTModeTest, changeMOTModeNullCallback)\n    {\n        OCSecureResource device;\n        const OicSecMomType_t momType = OIC_MULTIPLE_OWNER_ENABLE;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.changeMOTMode(momType, nullptr));\n    }\n\n    TEST(addPreconfigPINTest, addPreconfigPINNullPin)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, device.addPreconfigPIN(nullptr, 0));\n    }\n\n    TEST(provisionPreconfPinTest, provisionPreconfPinNullCallback)\n    {\n        OCSecureResource device;\n        const char *pin = \"test\";\n        size_t PinLength = 4;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.provisionPreconfPin(pin, PinLength, nullptr));\n    }\n\n    TEST(isMOTEnabledTest, isMOTEnabledWithoutDeviceInst)\n    {\n        OCSecureResource device;\n        EXPECT_FALSE(device.isMOTEnabled());\n    }\n\n    TEST(isMOTSupportedTest, isMOTSupportedWithoutDeviceInst)\n    {\n        OCSecureResource device;\n        EXPECT_FALSE(device.isMOTSupported());\n    }\n\n    TEST(getMOTMethodTest, getMOTMethodNullOxM)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, device.getMOTMethod(nullptr));\n    }\n#endif\n\n    TEST(DeviceInfoTest, DevInfoFromNetwork)\n    {\n        std::string dbPath(\".\/dbPath\");\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionInit(dbPath));\n        DeviceList_t owned, unowned;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::getDevInfoFromNetwork(TIMEOUT,\n                    owned, unowned));\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionClose());\n    }\n\n    TEST(SetDisplayPinCBTest, SetDisplayPinCBTestNullCB)\n    {\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::setDisplayPinCB(nullptr));\n    }\n\n    TEST(ProvisionAclTest, ProvisionAclTestNullAcl)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, device.provisionACL(nullptr, resultCallback));\n    }\n\n    TEST(ProvisionAclTest, ProvisionAclTestNullCallback)\n    {\n        OCSecureResource device;\n        OicSecAcl_t *acl = (OicSecAcl_t *)OICCalloc(1,sizeof(OicSecAcl_t));\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.provisionACL(acl, nullptr));\n        OICFree(acl);\n    }\n\n    TEST(ProvisionAclTest, ProvisionAclTestNullCallbackNUllAcl)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, device.provisionACL(nullptr, nullptr));\n    }\n\n    TEST(ProvisionCredTest, ProvisionCredTestNullCallback)\n    {\n        OCSecureResource device, dev2;\n        Credential cred;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.provisionCredentials(cred, dev2, nullptr));\n    }\n\n    TEST(ProvisionPairwiseTest, ProvisionPairwiseTestNullCallback)\n    {\n        OCSecureResource device, dev2;\n        Credential cred;\n        OicSecAcl_t *acl1 = (OicSecAcl_t *)OICCalloc(1,sizeof(OicSecAcl_t));\n        OicSecAcl_t *acl2 = (OicSecAcl_t *)OICCalloc(1,sizeof(OicSecAcl_t));\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.provisionPairwiseDevices(cred, acl1,\n                    dev2, acl2, nullptr));\n        OICFree(acl1);\n        OICFree(acl2);\n    }\n\n#if defined(__WITH_DTLS__) || defined(__WITH_TLS__)\n    TEST(setDeviceIdSeed, NullParam)\n    {\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::setDeviceIdSeed(NULL, 0));\n    }\n\n    TEST(setDeviceIdSeed, InvalidParam)\n    {\n        uint8_t seed[1024] = {0};\n\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::setDeviceIdSeed(seed, 0));\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::setDeviceIdSeed(seed, sizeof(seed)));\n    }\n\n    TEST(setDeviceIdSeed, ValidValue)\n    {\n        uint8_t seed[16] = {0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,\n                            0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10};\n        EXPECT_EQ(OC_STACK_OK, OCSecure::setDeviceIdSeed(seed, sizeof(seed)));\n    }\n#endif \/\/ __WITH_DTLS__ || __WITH_TLS__\n}\n<commit_msg>IOT-2848 Fix for intermitent read error<commit_after>\/* *****************************************************************\n *\n * Copyright 2015 Samsung Electronics All Rights Reserved.\n *\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 implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * *****************************************************************\/\n\n#include <ocstack.h>\n#include <oic_malloc.h>\n#include <OCApi.h>\n#include <OCPlatform_impl.h>\n#include <oxmjustworks.h>\n#include <oxmrandompin.h>\n#include <srmutility.h>\n#include <OCProvisioningManager.hpp>\n#include <gtest\/gtest.h>\n\n#define TIMEOUT 5\n#define DB_FILE \".\/dbPath.tmp\"\n\nnamespace OCProvisioningTest\n{\n    using namespace OC;\n\n    void resultCallback(PMResultList_t *result, int hasError)\n    {\n        (void)result;\n        (void)hasError;\n    }\n\n    TEST(ProvisionInitTest, TestWithEmptyPath)\n    {\n        std::string dbPath(\"\");\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionInit(dbPath));\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionClose());\n    }\n\n    TEST(ProvisionInitTest, TestValidPath)\n    {\n        std::string dbPath(DB_FILE);\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionInit(dbPath));\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionClose());\n    }\n\n    TEST(DiscoveryTest, SecureResource)\n    {\n        std::shared_ptr< OC::OCSecureResource > secureResource;\n        OicUuid_t uuid;\n        ConvertStrToUuid(\"11111111-1111-1111-1111-111111111111\", &uuid);\n\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverSingleDevice(TIMEOUT, &uuid, secureResource));\n    }\n\n    TEST(DiscoveryTest, SecureResourceZeroTimeout)\n    {\n        std::shared_ptr< OC::OCSecureResource > secureResource;\n        OicUuid_t uuid;\n        ConvertStrToUuid(\"11111111-1111-1111-1111-111111111111\", &uuid);\n\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverSingleDevice(0, &uuid, secureResource));\n    }\n\n    TEST(DiscoveryTest, UnownedDevices)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverUnownedDevices(TIMEOUT, list));\n    }\n\n    TEST(DiscoveryTest, UnownedDevicesZeroTimeout)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverUnownedDevices(0, list));\n    }\n\n#ifdef MULTIPLE_OWNER\n    TEST(MOTDiscoveryTest, MultipleOwnerEnabledDevices)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverMultipleOwnerEnabledDevices(TIMEOUT, list));\n    }\n\n    TEST(MOTDiscoveryTest, MultipleOwnerEnabledDevicesZeroTimeOut)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverMultipleOwnerEnabledDevices(0, list));\n    }\n\n    TEST(MOTDiscoveryTest, MultipleOwnedDevices)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverMultipleOwnedDevices(TIMEOUT, list));\n    }\n\n    TEST(MOTDiscoveryTest, MultipleOwnedDevicesZeroTimeOut)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverMultipleOwnedDevices(0, list));\n    }\n#endif\n\n    TEST(DiscoveryTest, OwnedDevices)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::discoverOwnedDevices(TIMEOUT, list));\n    }\n\n    TEST(DiscoveryTest, OwnedDevicesZeroTimeout)\n    {\n        DeviceList_t list;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::discoverOwnedDevices(0, list));\n    }\n\n    TEST(OwnershipTest, OwnershipTransferNullCallback)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.doOwnershipTransfer(nullptr));\n    }\n\n#ifdef MULTIPLE_OWNER\n    TEST(MOTOwnershipTest, MOTOwnershipTransferNullCallback)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.doMultipleOwnershipTransfer(nullptr));\n    }\n\n    TEST(selectMOTMethodTest, selectMOTMethodNullCallback)\n    {\n        OCSecureResource device;\n        const OicSecOxm_t stsecOxm = OIC_PRECONFIG_PIN;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.selectMOTMethod(stsecOxm, nullptr));\n    }\n\n    TEST(changeMOTModeTest, changeMOTModeNullCallback)\n    {\n        OCSecureResource device;\n        const OicSecMomType_t momType = OIC_MULTIPLE_OWNER_ENABLE;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.changeMOTMode(momType, nullptr));\n    }\n\n    TEST(addPreconfigPINTest, addPreconfigPINNullPin)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, device.addPreconfigPIN(nullptr, 0));\n    }\n\n    TEST(provisionPreconfPinTest, provisionPreconfPinNullCallback)\n    {\n        OCSecureResource device;\n        const char *pin = \"test\";\n        size_t PinLength = 4;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.provisionPreconfPin(pin, PinLength, nullptr));\n    }\n\n    TEST(isMOTEnabledTest, isMOTEnabledWithoutDeviceInst)\n    {\n        OCSecureResource device;\n        EXPECT_FALSE(device.isMOTEnabled());\n    }\n\n    TEST(isMOTSupportedTest, isMOTSupportedWithoutDeviceInst)\n    {\n        OCSecureResource device;\n        EXPECT_FALSE(device.isMOTSupported());\n    }\n\n    TEST(getMOTMethodTest, getMOTMethodNullOxM)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, device.getMOTMethod(nullptr));\n    }\n#endif\n\n    TEST(DeviceInfoTest, DevInfoFromNetwork)\n    {\n        std::string dbPath(DB_FILE);\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionInit(dbPath));\n        DeviceList_t owned, unowned;\n        EXPECT_EQ(OC_STACK_OK, OCSecure::getDevInfoFromNetwork(TIMEOUT,\n                    owned, unowned));\n        EXPECT_EQ(OC_STACK_OK, OCSecure::provisionClose());\n    }\n\n    TEST(SetDisplayPinCBTest, SetDisplayPinCBTestNullCB)\n    {\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::setDisplayPinCB(nullptr));\n    }\n\n    TEST(ProvisionAclTest, ProvisionAclTestNullAcl)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, device.provisionACL(nullptr, resultCallback));\n    }\n\n    TEST(ProvisionAclTest, ProvisionAclTestNullCallback)\n    {\n        OCSecureResource device;\n        OicSecAcl_t *acl = (OicSecAcl_t *)OICCalloc(1,sizeof(OicSecAcl_t));\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.provisionACL(acl, nullptr));\n        OICFree(acl);\n    }\n\n    TEST(ProvisionAclTest, ProvisionAclTestNullCallbackNUllAcl)\n    {\n        OCSecureResource device;\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, device.provisionACL(nullptr, nullptr));\n    }\n\n    TEST(ProvisionCredTest, ProvisionCredTestNullCallback)\n    {\n        OCSecureResource device, dev2;\n        Credential cred;\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.provisionCredentials(cred, dev2, nullptr));\n    }\n\n    TEST(ProvisionPairwiseTest, ProvisionPairwiseTestNullCallback)\n    {\n        OCSecureResource device, dev2;\n        Credential cred;\n        OicSecAcl_t *acl1 = (OicSecAcl_t *)OICCalloc(1,sizeof(OicSecAcl_t));\n        OicSecAcl_t *acl2 = (OicSecAcl_t *)OICCalloc(1,sizeof(OicSecAcl_t));\n        EXPECT_EQ(OC_STACK_INVALID_CALLBACK, device.provisionPairwiseDevices(cred, acl1,\n                    dev2, acl2, nullptr));\n        OICFree(acl1);\n        OICFree(acl2);\n    }\n\n#if defined(__WITH_DTLS__) || defined(__WITH_TLS__)\n    TEST(setDeviceIdSeed, NullParam)\n    {\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::setDeviceIdSeed(NULL, 0));\n    }\n\n    TEST(setDeviceIdSeed, InvalidParam)\n    {\n        uint8_t seed[1024] = {0};\n\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::setDeviceIdSeed(seed, 0));\n        EXPECT_EQ(OC_STACK_INVALID_PARAM, OCSecure::setDeviceIdSeed(seed, sizeof(seed)));\n    }\n\n    TEST(setDeviceIdSeed, ValidValue)\n    {\n        uint8_t seed[16] = {0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,\n                            0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10};\n        EXPECT_EQ(OC_STACK_OK, OCSecure::setDeviceIdSeed(seed, sizeof(seed)));\n    }\n#endif \/\/ __WITH_DTLS__ || __WITH_TLS__\n}\n<|endoftext|>"}
{"text":"<commit_before>#undef _FORTIFY_SOURCE\n\n#include \"reader.h\"\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <assert.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <zlib.h>\n#include <sys\/time.h>\n\nreader::reader(const char *fname)\n{\n  char msg[4096];\n  sprintf(msg, \"Open %s\", fname);\n  int fd = open(fname, O_RDONLY);\n  if(fd<0) {\n    perror(msg);\n    exit(2);\n  }\n\n  int size = lseek(fd, 0, SEEK_END);\n  lseek(fd, 0, SEEK_SET);\n\n  data = (char *)malloc(size+1);\n  read(fd, data, size);\n  data[size] = 0;\n  close(fd);\n\n  pos = data;\n  has_nl = false;\n}\n\nreader::~reader()\n{\n  free((void *)data);\n}\n\nconst char *reader::gw()\n{\n  assert(!has_nl);\n  while(*pos == ' ')\n    pos++;\n  const char *r = pos;\n  while(*pos != ' ' && *pos != '\\n')\n    pos++;\n  assert(pos != r);\n  has_nl = *pos == '\\n';\n  *pos++ = 0;\n  return r;\n}\n\nconst char *reader::gwnl()\n{\n  assert(!has_nl);\n  while(*pos == ' ')\n    pos++;\n  const char *r = pos;\n  while(*pos && *pos != '\\n')\n    pos++;\n  if(*pos) {\n    has_nl = true;\n    *pos++ = 0;\n  } else\n    has_nl = false;\n  return r;\n}\n\nvoid reader::nl()\n{\n  if(!has_nl) {\n    while(*pos && *pos != '\\n')\n      pos++;\n    if(*pos)\n      pos++;\n  }\n  has_nl = false;\n}\n\nint reader::gi()\n{\n  return strtol(gw(), 0, 10);\n}\n\ndouble reader::gd()\n{\n  return strtod(gw(), 0);\n}\n\nbool reader::eof()\n{\n  return !*pos;\n}\n\nbool reader::eol()\n{\n  return has_nl;\n}\n\nchar reader::peek()\n{\n  return *pos;\n}\n<commit_msg>lseek is an upper bound on Windows- fix to get number of chars.<commit_after>#undef _FORTIFY_SOURCE\n\n#include \"reader.h\"\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <assert.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <zlib.h>\n#include <sys\/time.h>\n\nreader::reader(const char *fname)\n{\n  char msg[4096];\n  sprintf(msg, \"Open %s\", fname);\n  int fd = open(fname, O_RDONLY);\n  if(fd<0) {\n    perror(msg);\n    exit(2);\n  }\n\n  \/\/ On Windows, lseek is upper bound for text files, thanks to\n  \/\/ CLRF translation.\n  int size = lseek(fd, 0, SEEK_END);\n  lseek(fd, 0, SEEK_SET);\n\n  data = (char *)malloc(size+1);\n  #ifdef _WIN32\n    \/\/ Full read of file will get number of characters. If not buffering\n    \/\/ full file, getc in for loop might be better.\n    int char_size = read(fd, data, size);\n    assert(char_size <= size);\n    data[char_size] = 0;\n  #else\n    read(fd, data, size);\n    data[size] = 0;\n  #endif\n  close(fd);\n\n  pos = data;\n  has_nl = false;\n}\n\nreader::~reader()\n{\n  free((void *)data);\n}\n\nconst char *reader::gw()\n{\n  assert(!has_nl);\n  while(*pos == ' ')\n    pos++;\n  const char *r = pos;\n  while(*pos != ' ' && *pos != '\\n')\n    pos++;\n  assert(pos != r);\n  has_nl = *pos == '\\n';\n  *pos++ = 0;\n  return r;\n}\n\nconst char *reader::gwnl()\n{\n  assert(!has_nl);\n  while(*pos == ' ')\n    pos++;\n  const char *r = pos;\n  while(*pos && *pos != '\\n')\n    pos++;\n  if(*pos) {\n    has_nl = true;\n    *pos++ = 0;\n  } else\n    has_nl = false;\n  return r;\n}\n\nvoid reader::nl()\n{\n  if(!has_nl) {\n    while(*pos && *pos != '\\n')\n      pos++;\n    if(*pos)\n      pos++;\n  }\n  has_nl = false;\n}\n\nint reader::gi()\n{\n  return strtol(gw(), 0, 10);\n}\n\ndouble reader::gd()\n{\n  return strtod(gw(), 0);\n}\n\nbool reader::eof()\n{\n  return !*pos;\n}\n\nbool reader::eol()\n{\n  return has_nl;\n}\n\nchar reader::peek()\n{\n  return *pos;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2013 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) 2009 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: Lisa Hsu\n *\/\n\n\/**\n * @file\n * Declaration of an associative set\n *\/\n\n#ifndef __CACHESET_HH__\n#define __CACHESET_HH__\n\n#include <cassert>\n\n#include \"mem\/cache\/blk.hh\" \/\/ base class\n\n\/**\n * An associative set of cache blocks.\n *\/\ntemplate <class Blktype>\nclass CacheSet\n{\n  public:\n    \/** The associativity of this set. *\/\n    int assoc;\n\n    \/** Cache blocks in this set, maintained in LRU order 0 = MRU. *\/\n    Blktype **blks;\n\n    \/**\n     * Find a block matching the tag in this set.\n     * @param way_id The id of the way that matches the tag.\n     * @param tag The Tag to find.\n     * @param is_secure True if the target memory space is secure.\n     * @return Pointer to the block if found. Set way_id to assoc if none found\n     *\/\n    Blktype* findBlk(Addr tag, bool is_secure, int& way_id) const ;\n    Blktype* findBlk(Addr tag, bool is_secure) const ;\n\n    \/**\n     * Move the given block to the head of the list.\n     * @param blk The block to move.\n     *\/\n    void moveToHead(Blktype *blk);\n\n    \/**\n     * Move the given block to the tail of the list.\n     * @param blk The block to move\n     *\/\n    void moveToTail(Blktype *blk);\n\n};\n\ntemplate <class Blktype>\nBlktype*\nCacheSet<Blktype>::findBlk(Addr tag, bool is_secure, int& way_id) const\n{\n    \/**\n     * Way_id returns the id of the way that matches the block\n     * If no block is found way_id is set to assoc.\n     *\/\n    way_id = assoc;\n    for (int i = 0; i < assoc; ++i) {\n        if (blks[i]->tag == tag && blks[i]->isValid() &&\n            blks[i]->isSecure() == is_secure) {\n            way_id = i;\n            return blks[i];\n        }\n    }\n    return NULL;\n}\n\ntemplate <class Blktype>\nBlktype*\nCacheSet<Blktype>::findBlk(Addr tag, bool is_secure) const\n{\n    int ignored_way_id;\n    return findBlk(tag, is_secure, ignored_way_id);\n}\n\ntemplate <class Blktype>\nvoid\nCacheSet<Blktype>::moveToHead(Blktype *blk)\n{\n    \/\/ nothing to do if blk is already head\n    if (blks[0] == blk)\n        return;\n\n    \/\/ write 'next' block into blks[i], moving up from MRU toward LRU\n    \/\/ until we overwrite the block we moved to head.\n\n    \/\/ start by setting up to write 'blk' into blks[0]\n    int i = 0;\n    Blktype *next = blk;\n\n    do {\n        assert(i < assoc);\n        \/\/ swap blks[i] and next\n        Blktype *tmp = blks[i];\n        blks[i] = next;\n        next = tmp;\n        ++i;\n    } while (next != blk);\n}\n\ntemplate <class Blktype>\nvoid\nCacheSet<Blktype>::moveToTail(Blktype *blk)\n{\n    \/\/ nothing to do if blk is already tail\n    if (blks[assoc - 1] == blk)\n        return;\n\n    \/\/ write 'next' block into blks[i], moving from LRU to MRU\n    \/\/ until we overwrite the block we moved to tail.\n\n    \/\/ start by setting up to write 'blk' into tail\n    int i = assoc - 1;\n    Blktype *next = blk;\n\n    do {\n        assert(i >= 0);\n        \/\/ swap blks[i] and next\n        Blktype *tmp = blks[i];\n        blks[i] = next;\n        next = tmp;\n        --i;\n    } while (next != blk);\n}\n\n#endif\n<commit_msg>mem: Tidy up CacheSet<commit_after>\/*\n * Copyright (c) 2013 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) 2009 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: Lisa Hsu\n *\/\n\n\/**\n * @file\n * Declaration of an associative set\n *\/\n\n#ifndef __MEM_CACHE_TAGS_CACHESET_HH__\n#define __MEM_CACHE_TAGS_CACHESET_HH__\n\n#include <cassert>\n\n\n\/**\n * An associative set of cache blocks.\n *\/\ntemplate <class Blktype>\nclass CacheSet\n{\n  public:\n    \/** The associativity of this set. *\/\n    int assoc;\n\n    \/** Cache blocks in this set, maintained in LRU order 0 = MRU. *\/\n    Blktype **blks;\n\n    \/**\n     * Find a block matching the tag in this set.\n     * @param way_id The id of the way that matches the tag.\n     * @param tag The Tag to find.\n     * @param is_secure True if the target memory space is secure.\n     * @return Pointer to the block if found. Set way_id to assoc if none found\n     *\/\n    Blktype* findBlk(Addr tag, bool is_secure, int& way_id) const ;\n    Blktype* findBlk(Addr tag, bool is_secure) const ;\n\n    \/**\n     * Move the given block to the head of the list.\n     * @param blk The block to move.\n     *\/\n    void moveToHead(Blktype *blk);\n\n    \/**\n     * Move the given block to the tail of the list.\n     * @param blk The block to move\n     *\/\n    void moveToTail(Blktype *blk);\n\n};\n\ntemplate <class Blktype>\nBlktype*\nCacheSet<Blktype>::findBlk(Addr tag, bool is_secure, int& way_id) const\n{\n    \/**\n     * Way_id returns the id of the way that matches the block\n     * If no block is found way_id is set to assoc.\n     *\/\n    way_id = assoc;\n    for (int i = 0; i < assoc; ++i) {\n        if (blks[i]->tag == tag && blks[i]->isValid() &&\n            blks[i]->isSecure() == is_secure) {\n            way_id = i;\n            return blks[i];\n        }\n    }\n    return NULL;\n}\n\ntemplate <class Blktype>\nBlktype*\nCacheSet<Blktype>::findBlk(Addr tag, bool is_secure) const\n{\n    int ignored_way_id;\n    return findBlk(tag, is_secure, ignored_way_id);\n}\n\ntemplate <class Blktype>\nvoid\nCacheSet<Blktype>::moveToHead(Blktype *blk)\n{\n    \/\/ nothing to do if blk is already head\n    if (blks[0] == blk)\n        return;\n\n    \/\/ write 'next' block into blks[i], moving up from MRU toward LRU\n    \/\/ until we overwrite the block we moved to head.\n\n    \/\/ start by setting up to write 'blk' into blks[0]\n    int i = 0;\n    Blktype *next = blk;\n\n    do {\n        assert(i < assoc);\n        std::swap(blks[i], next);\n        ++i;\n    } while (next != blk);\n}\n\ntemplate <class Blktype>\nvoid\nCacheSet<Blktype>::moveToTail(Blktype *blk)\n{\n    \/\/ nothing to do if blk is already tail\n    if (blks[assoc - 1] == blk)\n        return;\n\n    \/\/ write 'next' block into blks[i], moving from LRU to MRU\n    \/\/ until we overwrite the block we moved to tail.\n\n    \/\/ start by setting up to write 'blk' into tail\n    int i = assoc - 1;\n    Blktype *next = blk;\n\n    do {\n        assert(i >= 0);\n        std::swap(blks[i], next);\n        --i;\n    } while (next != blk);\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"ortools\/base\/commandlineflags.h\"\n#include \"ortools\/base\/logging.h\"\n#include \"ortools\/linear_solver\/linear_solver.h\"\n\nnamespace operations_research {\nvoid SolveLP() {\n  MPSolver solver(\"test\", MPSolver::CBC_MIXED_INTEGER_PROGRAMMING);\n  const double kInfinity = solver.infinity();\n  MPVariable* const x = solver.MakeNumVar(-kInfinity, kInfinity, \"x\");\n\n  MPObjective* const objective = solver.MutableObjective();\n  objective->SetMaximization();\n  objective->SetCoefficient(x, 1);\n\n  MPConstraint* const constraint = solver.MakeRowConstraint(0, 5);\n  constraint->SetCoefficient(x, 1);\n\n  solver.Solve();\n}\n\nvoid BreakLoop() {\n  for (int i = 0; i < 500; i++) {\n    SolveLP();\n  }\n}\n}  \/\/ namespace operations_research\n\nint main(int argc, char** argv) {\n  absl::ParseCommandLine(argc, argv);\n  operations_research::BreakLoop();\n  return 0;\n}\n<commit_msg>cpp(test): Fix tests when SCIP and COINOR are disabled (#3261)<commit_after>#include \"ortools\/base\/commandlineflags.h\"\n#include \"ortools\/base\/logging.h\"\n#include \"ortools\/linear_solver\/linear_solver.h\"\n\nnamespace operations_research {\nvoid SolveLP() {\n  \/\/ Create the linear solver with the GLOP backend.\n  std::unique_ptr<MPSolver> solver(MPSolver::CreateSolver(\"CBC\"));\n  if (!solver) {\n    return;\n  }\n  const double kInfinity = solver->infinity();\n  MPVariable* const x = solver->MakeNumVar(-kInfinity, kInfinity, \"x\");\n\n  MPObjective* const objective = solver->MutableObjective();\n  objective->SetMaximization();\n  objective->SetCoefficient(x, 1);\n\n  MPConstraint* const constraint = solver->MakeRowConstraint(0, 5);\n  constraint->SetCoefficient(x, 1);\n\n  solver->Solve();\n}\n\nvoid BreakLoop() {\n  for (int i = 0; i < 500; i++) {\n    SolveLP();\n  }\n}\n}  \/\/ namespace operations_research\n\nint main(int argc, char** argv) {\n  absl::ParseCommandLine(argc, argv);\n  operations_research::BreakLoop();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by martin on 11\/02\/19.\n\/\/\n#include <iostream>\n#include <gtest\/gtest.h>\n#include <ros\/package.h>\n#include \"ros\/ros.h\"\n#include \"std_msgs\/String.h\"\n\n#include \"rosplan_planning_system\/PlannerInterface\/POPFPlannerInterface.h\"\n#include \"rosplan_planning_system\/PlannerInterface\/PlannerInterface.h\"\n#include \"rosplan_dispatch_msgs\/PlanningService.h\"\n#include <cstdlib>\n\n\n    bool plan_received;\n    std::string last_plan;\n\n    void testCallback(const std_msgs::String::ConstPtr &plan) {\n        ROS_INFO(\"I heard: [%s]\", plan->data.c_str());\n        last_plan = plan->data;\n        plan_received = true;\n    }\n\n\n    GTEST_TEST(PlannerInterfaceTests, Test1_plan_found) {\n\n        ros::NodeHandle n(\"~\");\n\n        ros::ServiceClient client1 = n.serviceClient<rosplan_dispatch_msgs::PlanningService>(\"\/rosplan_planner_interface\/planning_server_params\");\n        rosplan_dispatch_msgs::PlanningService srv;\n\n        std::string rosplan_demos_path = ros::package::getPath(\"rosplan_demos\");\n        std::string rosplan_planning_system_path = ros::package::getPath(\"rosplan_planning_system\");\n\n        srv.request.use_problem_topic = false;\n        srv.request.data_path = rosplan_demos_path + \"\/common\/\";\n        srv.request.domain_path = rosplan_demos_path + \"\/common\/test_domain.pddl\";\n        srv.request.problem_path = rosplan_demos_path + \"\/common\/test_problem.pddl\";\n        srv.request.planner_command = \"timeout 10 \" + rosplan_planning_system_path + \"\/common\/bin\/popf -n DOMAIN PROBLEM\";\n\n        ASSERT_EQ(1, client1.call(srv));\n        ASSERT_EQ(1, srv.response.plan_found);\n\n    }\n\n\n    GTEST_TEST(PlannerInterfaceTests, Test2_planner_output_against_known_plan) {\n\n        ros::NodeHandle n(\"~\");\n\n        ros::Subscriber sub = n.subscribe<std_msgs::String>(\"\/rosplan_planner_interface\/planner_output\", 1000, &testCallback);\n        ros::Publisher pub = n.advertise<std_msgs::String>(\"\/rosplan_problem_interface\/problem_instance\", 1000);\n\n        ros::ServiceClient client1 = n.serviceClient<rosplan_dispatch_msgs::PlanningService>(\"\/rosplan_planner_interface\/planning_server_params\");\n        rosplan_dispatch_msgs::PlanningService srv;\n\n        std::string rosplan_demos_path = ros::package::getPath(\"rosplan_demos\");\n        std::string rosplan_planning_system_path = ros::package::getPath(\"rosplan_planning_system\");\n\n        srv.request.use_problem_topic = false;\n        srv.request.data_path = rosplan_demos_path + \"\/common\/\";\n        srv.request.domain_path = rosplan_demos_path + \"\/common\/test_domain.pddl\";\n        srv.request.problem_path = rosplan_demos_path + \"\/common\/test_problem.pddl\";\n        srv.request.planner_command = \"timeout 10 \" + rosplan_planning_system_path + \"\/common\/bin\/popf -n DOMAIN PROBLEM\";\n\n\n        std::ifstream t(rosplan_demos_path + \"\/common\/test_problem.pddl\");\n        std::stringstream ss;\n        ss << t.rdbuf();\n\n        std_msgs::String msg;\n        msg.data = ss.str();\n        pub.publish(msg);\n\n        ros::spinOnce();\n\n        \/\/ call service to generate plan\n        client1.call(srv);\n\n        \/\/ wait to receive the planner output\n        ros::Rate loop_rate = 10;\n        plan_received = false;\n        while (!plan_received && ros::ok()) {\n            loop_rate.sleep();\n            ros::spinOnce();\n\n        }\n        std::string known_plan = \"0.000: (movetob ball)  [0.001]\\n\";\n\n        \/\/ checking the plan\n        ASSERT_EQ(1, srv.response.plan_found);\n        ASSERT_EQ(last_plan, known_plan);\n\n    }\n\n\n    GTEST_TEST(PlannerInterfaceTests, Test3_problem_without_solution) {\n        ros::NodeHandle n(\"~\");\n\n        ros::Subscriber sub = n.subscribe<std_msgs::String>(\"\/rosplan_planner_interface\/planner_output\", 1000, &testCallback);\n        ros::Publisher pub = n.advertise<std_msgs::String>(\"\/rosplan_problem_interface\/problem_instance\", 1000);\n\n        ros::ServiceClient client1 = n.serviceClient<rosplan_dispatch_msgs::PlanningService>(\"\/rosplan_planner_interface\/planning_server_params\");\n        rosplan_dispatch_msgs::PlanningService srv;\n\n        std::string rosplan_demos_path = ros::package::getPath(\"rosplan_demos\");\n        std::string rosplan_planning_system_path = ros::package::getPath(\"rosplan_planning_system\");\n\n        srv.request.use_problem_topic = false;\n        srv.request.data_path = rosplan_demos_path + \"\/common\/\";\n        srv.request.domain_path = rosplan_demos_path + \"\/common\/test_domain.pddl\";\n        srv.request.problem_path = rosplan_demos_path + \"\/common\/test_problem_no_solution.pddl\";\n        srv.request.planner_command = \"timeout 10 \" + rosplan_planning_system_path + \"\/common\/bin\/popf -n DOMAIN PROBLEM\";\n\n        std::ifstream t(rosplan_demos_path + \"\/common\/test_problem_no_solution.pddl\");\n        std::stringstream ss;\n        ss << t.rdbuf();\n\n        std_msgs::String msg;\n        msg.data = ss.str();\n        pub.publish(msg);\n\n        ros::spinOnce();\n\n        \/\/ call service to generate plan\n        bool call_answer = client1.call(srv);\n\n        ASSERT_EQ(1, call_answer);\n        ASSERT_EQ(0, srv.response.plan_found);\n\n    }\n\n\n    GTEST_TEST(PlannerInterfaceTests, Test4_invalid_pddl_syntax) {\n\n        ros::NodeHandle n(\"~\");\n\n        ros::Subscriber sub = n.subscribe<std_msgs::String>(\"\/rosplan_planner_interface\/planner_output\", 1000, &testCallback);\n        ros::Publisher pub = n.advertise<std_msgs::String>(\"\/rosplan_problem_interface\/problem_instance\", 1000);\n\n        ros::ServiceClient client1 = n.serviceClient<rosplan_dispatch_msgs::PlanningService>(\"\/rosplan_planner_interface\/planning_server_params\");\n        rosplan_dispatch_msgs::PlanningService srv;\n\n        std::string rosplan_demos_path = ros::package::getPath(\"rosplan_demos\");\n        std::string rosplan_planning_system_path = ros::package::getPath(\"rosplan_planning_system\");\n\n        srv.request.use_problem_topic = false;\n        srv.request.data_path = rosplan_demos_path + \"\/common\/\";\n        srv.request.domain_path = rosplan_demos_path + \"\/common\/test_domain.pddl\";\n        srv.request.problem_path = rosplan_demos_path + \"\/common\/test_problem_invalid_syntax.pddl\";\n        srv.request.planner_command = \"timeout 10 \" + rosplan_planning_system_path + \"\/common\/bin\/popf -n DOMAIN PROBLEM\";\n\n        std::ifstream t(rosplan_demos_path + \"\/common\/test_problem_invalid_syntax.pddl\");\n        std::stringstream ss;\n        ss << t.rdbuf();\n\n        std_msgs::String msg;\n        msg.data = ss.str();\n        pub.publish(msg);\n\n        ros::spinOnce();\n\n        \/\/ call service to generate plan\n        bool call_answer = client1.call(srv);\n\n        ASSERT_EQ(1, call_answer);\n        ASSERT_EQ(0, srv.response.plan_found);\n\n    }\n\n\n\n    int main(int argc, char **argv) {\n\n            ::testing::InitGoogleTest(&argc, argv);\n            ros::init(argc, argv, \"PlannerInterfaceTests\");\n\n            ros::NodeHandle n(\"~\");\n\n            return RUN_ALL_TESTS();\n    }<commit_msg>First commit in unit-tests branch<commit_after>\/\/\n\/\/ Created by martin on 11\/02\/19.\n\/\/\n#include <iostream>\n#include <gtest\/gtest.h>\n#include <ros\/package.h>\n#include \"ros\/ros.h\"\n#include \"std_msgs\/String.h\"\n\n#include \"rosplan_planning_system\/PlannerInterface\/POPFPlannerInterface.h\"\n#include \"rosplan_planning_system\/PlannerInterface\/PlannerInterface.h\"\n#include \"rosplan_dispatch_msgs\/PlanningService.h\"\n#include <cstdlib>\n\n    bool plan_received;\n    std::string last_plan;\n\n    void testCallback(const std_msgs::String::ConstPtr &plan) {\n        ROS_INFO(\"I heard: [%s]\", plan->data.c_str());\n        last_plan = plan->data;\n        plan_received = true;\n    }\n\n\n    GTEST_TEST(PlannerInterfaceTests, Test1_plan_found) {\n\n        ros::NodeHandle n(\"~\");\n\n        ros::ServiceClient client1 = n.serviceClient<rosplan_dispatch_msgs::PlanningService>(\"\/rosplan_planner_interface\/planning_server_params\");\n        rosplan_dispatch_msgs::PlanningService srv;\n\n        std::string rosplan_demos_path = ros::package::getPath(\"rosplan_demos\");\n        std::string rosplan_planning_system_path = ros::package::getPath(\"rosplan_planning_system\");\n\n        srv.request.use_problem_topic = false;\n        srv.request.data_path = rosplan_demos_path + \"\/common\/\";\n        srv.request.domain_path = rosplan_demos_path + \"\/common\/test_domain.pddl\";\n        srv.request.problem_path = rosplan_demos_path + \"\/common\/test_problem.pddl\";\n        srv.request.planner_command = \"timeout 10 \" + rosplan_planning_system_path + \"\/common\/bin\/popf -n DOMAIN PROBLEM\";\n\n        ASSERT_EQ(1, client1.call(srv));\n        ASSERT_EQ(1, srv.response.plan_found);\n\n    }\n\n\n    GTEST_TEST(PlannerInterfaceTests, Test2_planner_output_against_known_plan) {\n\n        ros::NodeHandle n(\"~\");\n\n        ros::Subscriber sub = n.subscribe<std_msgs::String>(\"\/rosplan_planner_interface\/planner_output\", 1000, &testCallback);\n        ros::Publisher pub = n.advertise<std_msgs::String>(\"\/rosplan_problem_interface\/problem_instance\", 1000);\n\n        ros::ServiceClient client1 = n.serviceClient<rosplan_dispatch_msgs::PlanningService>(\"\/rosplan_planner_interface\/planning_server_params\");\n        rosplan_dispatch_msgs::PlanningService srv;\n\n        std::string rosplan_demos_path = ros::package::getPath(\"rosplan_demos\");\n        std::string rosplan_planning_system_path = ros::package::getPath(\"rosplan_planning_system\");\n\n        srv.request.use_problem_topic = false;\n        srv.request.data_path = rosplan_demos_path + \"\/common\/\";\n        srv.request.domain_path = rosplan_demos_path + \"\/common\/test_domain.pddl\";\n        srv.request.problem_path = rosplan_demos_path + \"\/common\/test_problem.pddl\";\n        srv.request.planner_command = \"timeout 10 \" + rosplan_planning_system_path + \"\/common\/bin\/popf -n DOMAIN PROBLEM\";\n\n\n        std::ifstream t(rosplan_demos_path + \"\/common\/test_problem.pddl\");\n        std::stringstream ss;\n        ss << t.rdbuf();\n\n        std_msgs::String msg;\n        msg.data = ss.str();\n        pub.publish(msg);\n\n        ros::spinOnce();\n\n        \/\/ call service to generate plan\n        client1.call(srv);\n\n        \/\/ wait to receive the planner output\n        ros::Rate loop_rate = 10;\n        plan_received = false;\n        while (!plan_received && ros::ok()) {\n            loop_rate.sleep();\n            ros::spinOnce();\n\n        }\n        std::string known_plan = \"0.000: (movetob ball)  [0.001]\\n\";\n\n        \/\/ checking the plan\n        ASSERT_EQ(1, srv.response.plan_found);\n        ASSERT_EQ(last_plan, known_plan);\n\n    }\n\n\n    GTEST_TEST(PlannerInterfaceTests, Test3_problem_without_solution) {\n        ros::NodeHandle n(\"~\");\n\n        ros::Subscriber sub = n.subscribe<std_msgs::String>(\"\/rosplan_planner_interface\/planner_output\", 1000, &testCallback);\n        ros::Publisher pub = n.advertise<std_msgs::String>(\"\/rosplan_problem_interface\/problem_instance\", 1000);\n\n        ros::ServiceClient client1 = n.serviceClient<rosplan_dispatch_msgs::PlanningService>(\"\/rosplan_planner_interface\/planning_server_params\");\n        rosplan_dispatch_msgs::PlanningService srv;\n\n        std::string rosplan_demos_path = ros::package::getPath(\"rosplan_demos\");\n        std::string rosplan_planning_system_path = ros::package::getPath(\"rosplan_planning_system\");\n\n        srv.request.use_problem_topic = false;\n        srv.request.data_path = rosplan_demos_path + \"\/common\/\";\n        srv.request.domain_path = rosplan_demos_path + \"\/common\/test_domain.pddl\";\n        srv.request.problem_path = rosplan_demos_path + \"\/common\/test_problem_no_solution.pddl\";\n        srv.request.planner_command = \"timeout 10 \" + rosplan_planning_system_path + \"\/common\/bin\/popf -n DOMAIN PROBLEM\";\n\n        std::ifstream t(rosplan_demos_path + \"\/common\/test_problem_no_solution.pddl\");\n        std::stringstream ss;\n        ss << t.rdbuf();\n\n        std_msgs::String msg;\n        msg.data = ss.str();\n        pub.publish(msg);\n\n        ros::spinOnce();\n\n        \/\/ call service to generate plan\n        bool call_answer = client1.call(srv);\n\n        ASSERT_EQ(1, call_answer);\n        ASSERT_EQ(0, srv.response.plan_found);\n\n    }\n\n\n    GTEST_TEST(PlannerInterfaceTests, Test4_invalid_pddl_syntax) {\n\n        ros::NodeHandle n(\"~\");\n\n        ros::Subscriber sub = n.subscribe<std_msgs::String>(\"\/rosplan_planner_interface\/planner_output\", 1000, &testCallback);\n        ros::Publisher pub = n.advertise<std_msgs::String>(\"\/rosplan_problem_interface\/problem_instance\", 1000);\n\n        ros::ServiceClient client1 = n.serviceClient<rosplan_dispatch_msgs::PlanningService>(\"\/rosplan_planner_interface\/planning_server_params\");\n        rosplan_dispatch_msgs::PlanningService srv;\n\n        std::string rosplan_demos_path = ros::package::getPath(\"rosplan_demos\");\n        std::string rosplan_planning_system_path = ros::package::getPath(\"rosplan_planning_system\");\n\n        srv.request.use_problem_topic = false;\n        srv.request.data_path = rosplan_demos_path + \"\/common\/\";\n        srv.request.domain_path = rosplan_demos_path + \"\/common\/test_domain.pddl\";\n        srv.request.problem_path = rosplan_demos_path + \"\/common\/test_problem_invalid_syntax.pddl\";\n        srv.request.planner_command = \"timeout 10 \" + rosplan_planning_system_path + \"\/common\/bin\/popf -n DOMAIN PROBLEM\";\n\n        std::ifstream t(rosplan_demos_path + \"\/common\/test_problem_invalid_syntax.pddl\");\n        std::stringstream ss;\n        ss << t.rdbuf();\n\n        std_msgs::String msg;\n        msg.data = ss.str();\n        pub.publish(msg);\n\n        ros::spinOnce();\n\n        \/\/ call service to generate plan\n        bool call_answer = client1.call(srv);\n\n        ASSERT_EQ(1, call_answer);\n        ASSERT_EQ(0, srv.response.plan_found);\n\n    }\n\n\n\n    int main(int argc, char **argv) {\n\n            ::testing::InitGoogleTest(&argc, argv);\n            ros::init(argc, argv, \"PlannerInterfaceTests\");\n\n            ros::NodeHandle n(\"~\");\n\n            return RUN_ALL_TESTS();\n    }<|endoftext|>"}
{"text":"<commit_before>\/\/https:\/\/code.google.com\/p\/nya-engine\/\r\n\r\n#include \"dds.h\"\r\n#include \"memory\/memory_reader.h\"\r\n#include \"memory\/tmp_buffer.h\"\r\n#include \"resources\/resources.h\"\r\n\r\n\/\/ToDo: mipmaps, cubemaps\r\n\r\nnamespace nya_formats\r\n{\r\n\r\nstruct dds_pixel_format\r\n{\r\n    typedef unsigned int uint;\r\n\r\n    uint size;\r\n    uint flags;\r\n    uint four_cc;\r\n    uint bpp;\r\n    uint bit_mask[4]; \/\/rgba\r\n};\r\n\r\nsize_t dds::decode_header(const void *data,size_t size)\r\n{\r\n    *this=dds();\r\n\r\n    if(!data || size<128)\r\n        return 0;\r\n\r\n    typedef unsigned int uint;\r\n\r\n    nya_memory::memory_reader reader(data,size);\r\n    if(!reader.test(\"DDS \",4))\r\n        return 0;\r\n\r\n    if(reader.read<uint>()!=124)\r\n        return 0;\r\n\r\n    const uint dds_pixelformat=0x00001000;\r\n    const uint dds_caps=0x00000001;\r\n\r\n    const uint flags=reader.read<uint>();\r\n    if(!(flags & dds_pixelformat) || !(flags & dds_caps))\r\n        return 0;\r\n\r\n    height=reader.read<uint>();\r\n    width=reader.read<uint>();\r\n    reader.skip(4); \/\/const uint pitch=reader.read<uint>();\r\n    const uint depth=reader.read<uint>();\r\n    if(depth>0) \/\/ToDo\r\n        return 0;\r\n\r\n    mipmap_count=reader.read<uint>();\r\n    if(!mipmap_count)\r\n    {\r\n        need_generate_mipmaps=true;\r\n        mipmap_count=1;\r\n    }\r\n\r\n    reader.skip(44);\r\n\r\n    const uint dds_fourcc=0x00000004;\r\n    const uint dds_rgb=0x00000040;\r\n    const uint dds_alpha=0x00000001;\r\n    const uint dds_cubemap=0x00000200;\r\n\r\n    const dds_pixel_format pf=reader.read<dds_pixel_format>();\r\n    if(pf.flags & dds_fourcc)\r\n    {\r\n        switch(pf.four_cc)\r\n        {\r\n            case '1TXD': this->pf=dxt1; break;\r\n            case '2TXD': this->pf=dxt2; break;\r\n            case '3TXD': this->pf=dxt3; break;\r\n            case '4TXD':this->pf=dxt4; break;\r\n            case '5TXD': this->pf=dxt5; break;\r\n            default: return 0;\r\n        };\r\n\r\n        for(uint i=0,w=width,h=height;i<mipmap_count;++i,w\/=2,h\/=2)\r\n        {\r\n            uint s=(w>4?w:4)\/4 * (h>4?h:4)\/4 * (this->pf==dxt1?8:16);\r\n            if(i==0) this->mip0_data_size=s;\r\n            this->data_size+=s;\r\n        }\r\n    }\r\n    else if(pf.flags & dds_rgb)\r\n    {\r\n        if(pf.bit_mask[0]!=0xff0000 || pf.bit_mask[1]!=0xff00 || pf.bit_mask[2]!=0xff )\r\n            return 0;\r\n\r\n        if(pf.flags & dds_alpha)\r\n        {\r\n            if(pf.bpp!=32 || pf.bit_mask[3]!=0xff000000U)\r\n                return 0;\r\n\r\n            this->pf=bgra;\r\n        }\r\n        else if(pf.bpp==24)\r\n            this->pf=bgr;\r\n        else\r\n            return 0;\r\n\r\n        this->mip0_data_size=width*height*pf.bpp\/4;\r\n        for(uint i=0,s=uint(mip0_data_size);i<mipmap_count;++i,s\/=4)\r\n            this->data_size+=s;\r\n    }\r\n    else\r\n        return 0;\r\n\r\n    unsigned int caps1=reader.read<unsigned int>();\r\n    unsigned int caps2=reader.read<unsigned int>();\r\n\r\n    type=texture_2d;\r\n    if(caps2 & dds_cubemap)\r\n    {\r\n        type=texture_cube;\r\n        this->data_size*=6;\r\n    }\r\n\r\n    reader.seek(128);\r\n    if(!reader.check_remained(this->data_size))\r\n        return 0;\r\n\r\n    this->data=reader.get_data();\r\n\r\n    return reader.get_offset();\r\n}\r\n\r\n}\r\n<commit_msg>dds load fix<commit_after>\/\/https:\/\/code.google.com\/p\/nya-engine\/\r\n\r\n#include \"dds.h\"\r\n#include \"memory\/memory_reader.h\"\r\n#include \"memory\/tmp_buffer.h\"\r\n#include \"resources\/resources.h\"\r\n\r\n\/\/ToDo: mipmaps, cubemaps\r\n\r\nnamespace nya_formats\r\n{\r\n\r\nstruct dds_pixel_format\r\n{\r\n    typedef unsigned int uint;\r\n\r\n    uint size;\r\n    uint flags;\r\n    uint four_cc;\r\n    uint bpp;\r\n    uint bit_mask[4]; \/\/rgba\r\n};\r\n\r\nsize_t dds::decode_header(const void *data,size_t size)\r\n{\r\n    *this=dds();\r\n\r\n    if(!data || size<128)\r\n        return 0;\r\n\r\n    typedef unsigned int uint;\r\n\r\n    nya_memory::memory_reader reader(data,size);\r\n    if(!reader.test(\"DDS \",4))\r\n        return 0;\r\n\r\n    if(reader.read<uint>()!=124)\r\n        return 0;\r\n\r\n    const uint dds_pixelformat=0x00001000;\r\n    const uint dds_caps=0x00000001;\r\n\r\n    const uint flags=reader.read<uint>();\r\n    if(!(flags & dds_pixelformat) || !(flags & dds_caps))\r\n        return 0;\r\n\r\n    height=reader.read<uint>();\r\n    width=reader.read<uint>();\r\n    reader.skip(4); \/\/const uint pitch=reader.read<uint>();\r\n    const uint depth=reader.read<uint>();\r\n    if(depth>0) \/\/ToDo\r\n        return 0;\r\n\r\n    mipmap_count=reader.read<uint>();\r\n    if(!mipmap_count)\r\n    {\r\n        need_generate_mipmaps=true;\r\n        mipmap_count=1;\r\n    }\r\n\r\n    reader.skip(44);\r\n\r\n    const uint dds_fourcc=0x00000004;\r\n    const uint dds_rgb=0x00000040;\r\n    const uint dds_alpha=0x00000001;\r\n    const uint dds_cubemap=0x00000200;\r\n\r\n    const dds_pixel_format pf=reader.read<dds_pixel_format>();\r\n    if(pf.flags & dds_fourcc)\r\n    {\r\n        switch(pf.four_cc)\r\n        {\r\n            case '1TXD': this->pf=dxt1; break;\r\n            case '2TXD': this->pf=dxt2; break;\r\n            case '3TXD': this->pf=dxt3; break;\r\n            case '4TXD':this->pf=dxt4; break;\r\n            case '5TXD': this->pf=dxt5; break;\r\n            default: return 0;\r\n        };\r\n\r\n        for(uint i=0,w=width,h=height;i<mipmap_count;++i,w\/=2,h\/=2)\r\n        {\r\n            uint s=(w>4?w:4)\/4 * (h>4?h:4)\/4 * (this->pf==dxt1?8:16);\r\n            if(i==0) this->mip0_data_size=s;\r\n            this->data_size+=s;\r\n        }\r\n    }\r\n    else if(pf.flags & dds_rgb)\r\n    {\r\n        if(pf.bit_mask[0]!=0xff0000 || pf.bit_mask[1]!=0xff00 || pf.bit_mask[2]!=0xff )\r\n            return 0;\r\n\r\n        if(pf.flags & dds_alpha)\r\n        {\r\n            if(pf.bpp!=32 || pf.bit_mask[3]!=0xff000000U)\r\n                return 0;\r\n\r\n            this->pf=bgra;\r\n        }\r\n        else if(pf.bpp==24)\r\n            this->pf=bgr;\r\n        else\r\n            return 0;\r\n\r\n        this->mip0_data_size=width*height*(pf.bpp\/4);\r\n        for(uint i=0,w=width,h=height;i<mipmap_count;++i,w>1?w\/=2:1,h>1?h\/=2:1)\r\n            this->data_size+=w*h*(pf.bpp\/4);\r\n    }\r\n    else\r\n        return 0;\r\n\r\n    unsigned int caps1=reader.read<unsigned int>();\r\n    unsigned int caps2=reader.read<unsigned int>();\r\n\r\n    type=texture_2d;\r\n    if(caps2 & dds_cubemap)\r\n    {\r\n        type=texture_cube;\r\n        this->data_size*=6;\r\n    }\r\n\r\n    reader.seek(128);\r\n    if(!reader.check_remained(this->data_size))\r\n        return 0;\r\n\r\n    this->data=reader.get_data();\r\n\r\n    return reader.get_offset();\r\n}\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity#708499 Uninitialized scalar field<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: shdwcrsr.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-27 12:46:43 $\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#include <com\/sun\/star\/text\/HoriOrientation.hpp>\n\n#ifndef _SV_WINDOW_HXX \/\/autogen\n#include <vcl\/window.hxx>\n#endif\n\n#include \"swtypes.hxx\"\n#include \"shdwcrsr.hxx\"\n\nusing namespace ::com::sun::star;\n\n\nSwShadowCursor::~SwShadowCursor()\n{\n    if( USHRT_MAX != nOldMode )\n        DrawCrsr( aOldPt, nOldHeight, nOldMode );\n}\n\nvoid SwShadowCursor::SetPos( const Point& rPt, long nHeight, USHORT nMode )\n{\n    Point aPt( pWin->LogicToPixel( rPt ));\n    nHeight = pWin->LogicToPixel( Size( 0, nHeight )).Height();\n    if( aOldPt != aPt || nOldHeight != nHeight || nOldMode != nMode )\n    {\n        if( USHRT_MAX != nOldMode )\n            DrawCrsr( aOldPt, nOldHeight, nOldMode );\n\n        DrawCrsr( aPt, nHeight, nMode );\n        nOldMode = nMode;\n        nOldHeight = nHeight;\n        aOldPt = aPt;\n    }\n}\n\nvoid SwShadowCursor::DrawTri( const Point& rPt, long nHeight, BOOL bLeft )\n{\n    long nLineDiff = ( nHeight \/ 2 );\n    long nLineDiffHalf = nLineDiff \/ 2;\n\n    \/\/ Punkt oben\n    Point aPt1( (bLeft ? rPt.X() - 3 : rPt.X() + 3),\n                rPt.Y() + nLineDiffHalf );\n    \/\/ Punkt unten\n    Point aPt2( aPt1.X(), aPt1.Y() + nHeight - nLineDiff - 1 );\n    long nDiff = bLeft ? -1 : 1;\n    while( aPt1.Y() <= aPt2.Y() )\n    {\n        pWin->DrawLine( aPt1, aPt2 );\n        aPt1.Y()++, aPt2.Y()--;\n        aPt2.X() = aPt1.X() += nDiff;\n    }\n}\n\nvoid SwShadowCursor::DrawCrsr( const Point& rPt, long nHeight, USHORT nMode )\n{\n    nHeight = (((nHeight \/ 4)+1) * 4) + 1;\n\n    pWin->Push();\n\n    pWin->SetMapMode( MAP_PIXEL );\n    pWin->SetRasterOp( ROP_XOR );\n\n    pWin->SetLineColor( Color( aCol.GetColor() ^ COL_WHITE ) );\n\n    \/\/ 1. der Strich:\n    pWin->DrawLine( Point( rPt.X(), rPt.Y() + 1),\n              Point( rPt.X(), rPt.Y() - 2 + nHeight ));\n\n    \/\/ 2. das Dreieck\n    if( text::HoriOrientation::LEFT == nMode || text::HoriOrientation::CENTER == nMode )    \/\/ Pfeil nach rechts\n        DrawTri( rPt, nHeight, FALSE );\n    if( text::HoriOrientation::RIGHT == nMode || text::HoriOrientation::CENTER == nMode )   \/\/ Pfeil nach links\n        DrawTri( rPt, nHeight, TRUE );\n\n    pWin->Pop();\n}\n\nvoid SwShadowCursor::Paint()\n{\n    if( USHRT_MAX != nOldMode )\n        DrawCrsr( aOldPt, nOldHeight, nOldMode );\n}\n\nRectangle SwShadowCursor::GetRect() const\n{\n    long nH = nOldHeight;\n    Point aPt( aOldPt );\n\n    nH = (((nH \/ 4)+1) * 4) + 1;\n    long nWidth = nH \/ 4 + 3 + 1;\n\n    Size aSz( nWidth, nH );\n\n    if( text::HoriOrientation::RIGHT == nOldMode )\n        aPt.X() -= aSz.Width();\n    else if( text::HoriOrientation::CENTER == nOldMode )\n    {\n        aPt.X() -= aSz.Width();\n        aSz.Width() *= 2;\n    }\n\n    return pWin->PixelToLogic( Rectangle( aPt, aSz ) );\n}\n\n\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.242); FILE MERGED 2008\/04\/01 15:59:51 thb 1.6.242.2: #i85898# Stripping all external header guards 2008\/03\/31 16:59:54 rt 1.6.242.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: shdwcrsr.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_sw.hxx\"\n\n\n#include <com\/sun\/star\/text\/HoriOrientation.hpp>\n#include <vcl\/window.hxx>\n\n#include \"swtypes.hxx\"\n#include \"shdwcrsr.hxx\"\n\nusing namespace ::com::sun::star;\n\n\nSwShadowCursor::~SwShadowCursor()\n{\n    if( USHRT_MAX != nOldMode )\n        DrawCrsr( aOldPt, nOldHeight, nOldMode );\n}\n\nvoid SwShadowCursor::SetPos( const Point& rPt, long nHeight, USHORT nMode )\n{\n    Point aPt( pWin->LogicToPixel( rPt ));\n    nHeight = pWin->LogicToPixel( Size( 0, nHeight )).Height();\n    if( aOldPt != aPt || nOldHeight != nHeight || nOldMode != nMode )\n    {\n        if( USHRT_MAX != nOldMode )\n            DrawCrsr( aOldPt, nOldHeight, nOldMode );\n\n        DrawCrsr( aPt, nHeight, nMode );\n        nOldMode = nMode;\n        nOldHeight = nHeight;\n        aOldPt = aPt;\n    }\n}\n\nvoid SwShadowCursor::DrawTri( const Point& rPt, long nHeight, BOOL bLeft )\n{\n    long nLineDiff = ( nHeight \/ 2 );\n    long nLineDiffHalf = nLineDiff \/ 2;\n\n    \/\/ Punkt oben\n    Point aPt1( (bLeft ? rPt.X() - 3 : rPt.X() + 3),\n                rPt.Y() + nLineDiffHalf );\n    \/\/ Punkt unten\n    Point aPt2( aPt1.X(), aPt1.Y() + nHeight - nLineDiff - 1 );\n    long nDiff = bLeft ? -1 : 1;\n    while( aPt1.Y() <= aPt2.Y() )\n    {\n        pWin->DrawLine( aPt1, aPt2 );\n        aPt1.Y()++, aPt2.Y()--;\n        aPt2.X() = aPt1.X() += nDiff;\n    }\n}\n\nvoid SwShadowCursor::DrawCrsr( const Point& rPt, long nHeight, USHORT nMode )\n{\n    nHeight = (((nHeight \/ 4)+1) * 4) + 1;\n\n    pWin->Push();\n\n    pWin->SetMapMode( MAP_PIXEL );\n    pWin->SetRasterOp( ROP_XOR );\n\n    pWin->SetLineColor( Color( aCol.GetColor() ^ COL_WHITE ) );\n\n    \/\/ 1. der Strich:\n    pWin->DrawLine( Point( rPt.X(), rPt.Y() + 1),\n              Point( rPt.X(), rPt.Y() - 2 + nHeight ));\n\n    \/\/ 2. das Dreieck\n    if( text::HoriOrientation::LEFT == nMode || text::HoriOrientation::CENTER == nMode )    \/\/ Pfeil nach rechts\n        DrawTri( rPt, nHeight, FALSE );\n    if( text::HoriOrientation::RIGHT == nMode || text::HoriOrientation::CENTER == nMode )   \/\/ Pfeil nach links\n        DrawTri( rPt, nHeight, TRUE );\n\n    pWin->Pop();\n}\n\nvoid SwShadowCursor::Paint()\n{\n    if( USHRT_MAX != nOldMode )\n        DrawCrsr( aOldPt, nOldHeight, nOldMode );\n}\n\nRectangle SwShadowCursor::GetRect() const\n{\n    long nH = nOldHeight;\n    Point aPt( aOldPt );\n\n    nH = (((nH \/ 4)+1) * 4) + 1;\n    long nWidth = nH \/ 4 + 3 + 1;\n\n    Size aSz( nWidth, nH );\n\n    if( text::HoriOrientation::RIGHT == nOldMode )\n        aPt.X() -= aSz.Width();\n    else if( text::HoriOrientation::CENTER == nOldMode )\n    {\n        aPt.X() -= aSz.Width();\n        aSz.Width() *= 2;\n    }\n\n    return pWin->PixelToLogic( Rectangle( aPt, aSz ) );\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\n *                    _______    _                                     *\n *                   (  ____ \\  ( \\     |\\     \/|                      * \n *                   | (    \\\/  | (     ( \\   \/ )                      *\n *                   | (__      | |      \\ (_) \/                       *\n *                   |  __)     | |       \\   \/                        *\n *                   | (        | |        ) (                         *\n *                   | )        | (____\/\\  | |                         *\n *                   |\/         (_______\/  \\_\/                         *\n *                                                                     *\n *                                                                     *\n *     fly is an awesome c++11 network library.                        *\n *                                                                     *\n *   @author: lichuan                                                  *\n *   @qq: 308831759                                                    *\n *   @email: 308831759@qq.com                                          *\n *   @github: https:\/\/github.com\/lichuan\/fly                           *\n *   @date: 2015-06-24 20:43:56                                        *\n *                                                                     *\n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\/\n\n#include <sys\/epoll.h>\n#include <sys\/eventfd.h>\n#include <unistd.h>\n#include \"fly\/base\/logger.hpp\"\n#include \"fly\/net\/poller_task.hpp\"\n\nnamespace fly {\nnamespace net {\n\ntemplate<typename T>\nPoller_Task<T>::Poller_Task(uint64 seq) : Loop_Task(seq)\n{\n    m_fd = epoll_create1(0);\n    \n    if(m_fd < 0)\n    {\n        LOG_FATAL(\"epoll_create1 failed in Poller_Task::Poller_Task %s\", strerror(errno));\n        return;\n    }\n    \n    m_close_event_fd = eventfd(0, 0);\n    \n    if(m_close_event_fd < 0)\n    {\n        LOG_FATAL(\"close event eventfd failed in Poller_Task::Poller_Task\");\n        return; \n    }\n\n    m_write_event_fd = eventfd(0, 0);\n\n    if(m_write_event_fd < 0)\n    {\n        LOG_FATAL(\"write event eventfd failed in Poller_Task::Poller_Task\");\n        return; \n    }\n\n    m_stop_event_fd = eventfd(0, 0);\n\n    if(m_stop_event_fd < 0)\n    {\n        LOG_FATAL(\"stop event eventfd failed in Poller_Task::Poller_Task\");\n        return; \n    }\n\n    struct epoll_event event;\n    m_close_udata.reset(new Connection<T>(m_close_event_fd, Addr(\"close_event\", 0)));\n    event.data.ptr = m_close_udata.get();\n    event.events = EPOLLIN;\n    int32 ret = epoll_ctl(m_fd, EPOLL_CTL_ADD, m_close_event_fd, &event);\n    \n    if(ret < 0)\n    {\n        LOG_FATAL(\"close event epoll_ctl failed in Poller_Task::Poller_Task\");\n        return; \n    }\n\n    m_write_udata.reset(new Connection<T>(m_write_event_fd, Addr(\"write_event\", 0)));\n    event.data.ptr = m_write_udata.get();\n    ret = epoll_ctl(m_fd, EPOLL_CTL_ADD, m_write_event_fd, &event);\n    \n    if(ret < 0)\n    {\n        LOG_FATAL(\"write event epoll_ctl failed in Poller_Task::Poller_Task\");\n        return; \n    }\n    \n    m_stop_udata.reset(new Connection<T>(m_stop_event_fd, Addr(\"stop_event\", 0)));\n    event.data.ptr = m_stop_udata.get();\n    ret = epoll_ctl(m_fd, EPOLL_CTL_ADD, m_stop_event_fd, &event);\n    \n    if(ret < 0)\n    {\n        LOG_FATAL(\"stop event epoll_ctl failed in Poller_Task::Poller_Task\");\n    }\n}\n\ntemplate<typename T>\nbool Poller_Task<T>::register_connection(std::shared_ptr<Connection<T>> connection)\n{\n    struct epoll_event event;\n    event.data.ptr = connection.get();\n    event.events = EPOLLIN | EPOLLOUT | EPOLLRDHUP | EPOLLET;\n    connection->m_poller_task = this;\n    connection->m_self = connection;\n    connection->m_init_cb(connection);\n    int32 ret = epoll_ctl(m_fd, EPOLL_CTL_ADD, connection->m_fd, &event);\n\n    if(ret < 0)\n    {\n        LOG_FATAL(\"epoll_ctl failed in Poller_Task::register_connection: %s\", strerror(errno));\n        close(connection->m_fd);\n        connection->m_closed.store(true, std::memory_order_relaxed);\n        connection->m_be_closed_cb(connection->shared_from_this());\n        connection->m_self.reset();\n        \n        return false;\n    }\n\n    return true;\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::close_connection(std::shared_ptr<Connection<T>> connection)\n{\n    m_close_queue.push(connection);\n    uint64 data = 1;\n    int32 num = write(m_close_event_fd, &data, sizeof(uint64));\n\n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"write m_close_event_fd failed in Poller_Task::close_connection\");\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::stop()\n{\n    uint64 data = 1;\n    int32 num = write(m_stop_event_fd, &data, sizeof(uint64));\n    \n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"write m_stop_event_fd failed in Poller_Task::stop\");\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::write_connection(std::shared_ptr<Connection<T>> connection)\n{\n    m_write_queue.push(connection);\n    uint64 data = 1;\n    int32 num = write(m_write_event_fd, &data, sizeof(uint64));\n    \n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"write m_write_event_fd failed in Poller_Task::write_connection\");\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::do_write(std::shared_ptr<Connection<T>> connection)\n{\n    int32 fd = connection->m_fd;\n    Message_Chunk_Queue &send_queue = connection->m_send_msg_queue;\n    \n    while(Message_Chunk *message_chunk = send_queue.pop())\n    {\n        int32 message_length = message_chunk->length();\n        int32 num = write(fd, message_chunk->read_ptr(), message_length);\n\n        if(num < 0)\n        {\n            if(errno == EAGAIN || errno == EWOULDBLOCK)\n            {\n                send_queue.push_front(message_chunk);\n                \n                break;\n            }\n        }\n\n        if(num == 0)\n        {\n            LOG_FATAL(\"write return 0, it's impossible, in Poller_Task::do_write(arg)\");\n        }\n        \n        if(num <= 0)\n        {\n            epoll_ctl(m_fd, EPOLL_CTL_DEL, fd, NULL);\n            close(fd);\n            connection->m_self.reset();\n            connection->m_closed.store(true, std::memory_order_relaxed);\n            connection->m_be_closed_cb(connection);\n            \n            break;\n        }\n                \n        if(num < message_length)\n        {\n            message_chunk->read_ptr(num);\n            send_queue.push_front(message_chunk);\n\n            break;\n        }\n        else\n        {\n            delete message_chunk;\n        }\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::do_write()\n{\n    uint64 data = 0;\n    int32 num = read(m_write_event_fd, &data, sizeof(uint64));\n\n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"read m_write_event_fd failed in Poller_Task::do_write\");\n        \n        return;\n    }\n    \n    std::list<std::shared_ptr<Connection<T>>> write_queue;\n\n    if(m_write_queue.pop(write_queue))\n    {\n        for(auto &connection : write_queue)\n        {\n            if(!connection->m_closed.load(std::memory_order_relaxed))\n            {\n                do_write(connection);\n            }\n        }\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::do_close()\n{\n    uint64 data = 0;\n    int32 num = read(m_close_event_fd, &data, sizeof(uint64));\n    \n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"read m_close_event_fd failed in Poller_Task::do_close\");\n        \n        return;\n    }\n\n    std::list<std::shared_ptr<Connection<T>>> close_queue;\n\n    if(m_close_queue.pop(close_queue))\n    {\n        for(auto &connection : close_queue)\n        {\n            if(!connection->m_closed.load(std::memory_order_relaxed))\n            {\n                int32 fd = connection->m_fd;\n                int ret = epoll_ctl(m_fd, EPOLL_CTL_DEL, fd, NULL);\n\n                if(ret < 0)\n                {\n                    LOG_FATAL(\"epoll_ctl EPOLL_CTL_DEL failed in Poller_Task::do_close: %s\", strerror(errno));\n                }\n                \n                close(fd);\n                connection->m_self.reset();\n                connection->m_closed.store(true, std::memory_order_relaxed);\n                connection->m_close_cb(connection);\n            }\n        }\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::run_in_loop()\n{\n    struct epoll_event events[2048];\n    int32 fd_num = epoll_wait(m_fd, events, 2048, -1);\n    \n    if(fd_num < 0)\n    {\n        LOG_FATAL(\"epoll_wait failed in Poller_Task::run_in_loop %s\", strerror(errno));\n\n        return;\n    }\n\n    for(auto i = 0; i < fd_num; ++i)\n    {\n        Connection<T> *connection = static_cast<Connection<T>*>(events[i].data.ptr);\n        int32 fd = connection->m_fd;\n        uint32 event = events[i].events;\n\n        if(event & (EPOLLERR | EPOLLHUP | EPOLLRDHUP))\n        {\n            if(connection->m_closed.load(std::memory_order_relaxed))\n            {\n                continue;\n            }\n\n            int ret = epoll_ctl(m_fd, EPOLL_CTL_DEL, fd, NULL);\n\n            if(ret < 0)\n            {\n                LOG_FATAL(\"epoll_ctl EPOLL_CTL_DEL failed in Poller_Task::run_in_loop: %s\", strerror(errno));\n            }\n\n            close(fd);\n            connection->m_closed.store(true, std::memory_order_relaxed);\n            connection->m_be_closed_cb(connection->shared_from_this());\n            connection->m_self.reset();\n        }\n        else if(event & EPOLLIN)\n        {\n            if(fd == m_close_event_fd)\n            {\n                do_close();\n            }\n            else if(fd == m_write_event_fd)\n            {\n                do_write();\n            }\n            else if(fd == m_stop_event_fd)\n            {\n                Loop_Task::stop();\n                close(m_fd);\n                break;\n            }\n            else\n            {\n                if(connection->m_closed.load(std::memory_order_relaxed))\n                {\n                    continue;\n                }\n                \n                while(true)\n                {\n                    const uint32 REQ_SIZE = 100 * 1024;\n                    Message_Chunk_Queue &recv_queue = connection->m_recv_msg_queue;\n                    std::unique_ptr<Message_Chunk> message_chunk(new Message_Chunk(REQ_SIZE));\n                    int32 num = read(fd, message_chunk->read_ptr(), REQ_SIZE);\n\n                    if(num < 0)\n                    {\n                        if(errno == EAGAIN || errno == EWOULDBLOCK)\n                        {\n                            break;\n                        }\n                    }\n                \n                    if(num <= 0)\n                    {\n                        epoll_ctl(m_fd, EPOLL_CTL_DEL, fd, NULL);\n                        close(fd);\n                        connection->m_closed.store(true, std::memory_order_relaxed);\n                        connection->m_be_closed_cb(connection->shared_from_this());\n                        connection->m_self.reset();\n\n                        break;\n                    }\n                    \n                    message_chunk->write_ptr(num);\n                    recv_queue.push(message_chunk.release());\n                    connection->parse();\n\n                    if(num < REQ_SIZE)\n                    {\n                        break;\n                    }\n                }\n            }\n        }\n        else if(event & EPOLLOUT)\n        {\n            if(connection->m_closed.load(std::memory_order_relaxed))\n            {\n                continue;\n            }\n            \n            do_write(connection->shared_from_this());\n        }\n    }\n}\n\ntemplate class Poller_Task<Json>;\ntemplate class Poller_Task<Wsock>;\ntemplate class Poller_Task<Proto>;\n    \n}\n}\n<commit_msg>fix epoll EPOLLOUT event<commit_after>\/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\n *                    _______    _                                     *\n *                   (  ____ \\  ( \\     |\\     \/|                      * \n *                   | (    \\\/  | (     ( \\   \/ )                      *\n *                   | (__      | |      \\ (_) \/                       *\n *                   |  __)     | |       \\   \/                        *\n *                   | (        | |        ) (                         *\n *                   | )        | (____\/\\  | |                         *\n *                   |\/         (_______\/  \\_\/                         *\n *                                                                     *\n *                                                                     *\n *     fly is an awesome c++11 network library.                        *\n *                                                                     *\n *   @author: lichuan                                                  *\n *   @qq: 308831759                                                    *\n *   @email: 308831759@qq.com                                          *\n *   @github: https:\/\/github.com\/lichuan\/fly                           *\n *   @date: 2015-06-24 20:43:56                                        *\n *                                                                     *\n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\/\n\n#include <sys\/epoll.h>\n#include <sys\/eventfd.h>\n#include <unistd.h>\n#include \"fly\/base\/logger.hpp\"\n#include \"fly\/net\/poller_task.hpp\"\n\nnamespace fly {\nnamespace net {\n\ntemplate<typename T>\nPoller_Task<T>::Poller_Task(uint64 seq) : Loop_Task(seq)\n{\n    m_fd = epoll_create1(0);\n    \n    if(m_fd < 0)\n    {\n        LOG_FATAL(\"epoll_create1 failed in Poller_Task::Poller_Task %s\", strerror(errno));\n        return;\n    }\n    \n    m_close_event_fd = eventfd(0, 0);\n    \n    if(m_close_event_fd < 0)\n    {\n        LOG_FATAL(\"close event eventfd failed in Poller_Task::Poller_Task\");\n        return; \n    }\n\n    m_write_event_fd = eventfd(0, 0);\n\n    if(m_write_event_fd < 0)\n    {\n        LOG_FATAL(\"write event eventfd failed in Poller_Task::Poller_Task\");\n        return; \n    }\n\n    m_stop_event_fd = eventfd(0, 0);\n\n    if(m_stop_event_fd < 0)\n    {\n        LOG_FATAL(\"stop event eventfd failed in Poller_Task::Poller_Task\");\n        return; \n    }\n\n    struct epoll_event event;\n    m_close_udata.reset(new Connection<T>(m_close_event_fd, Addr(\"close_event\", 0)));\n    event.data.ptr = m_close_udata.get();\n    event.events = EPOLLIN;\n    int32 ret = epoll_ctl(m_fd, EPOLL_CTL_ADD, m_close_event_fd, &event);\n    \n    if(ret < 0)\n    {\n        LOG_FATAL(\"close event epoll_ctl failed in Poller_Task::Poller_Task\");\n        return; \n    }\n\n    m_write_udata.reset(new Connection<T>(m_write_event_fd, Addr(\"write_event\", 0)));\n    event.data.ptr = m_write_udata.get();\n    ret = epoll_ctl(m_fd, EPOLL_CTL_ADD, m_write_event_fd, &event);\n    \n    if(ret < 0)\n    {\n        LOG_FATAL(\"write event epoll_ctl failed in Poller_Task::Poller_Task\");\n        return; \n    }\n    \n    m_stop_udata.reset(new Connection<T>(m_stop_event_fd, Addr(\"stop_event\", 0)));\n    event.data.ptr = m_stop_udata.get();\n    ret = epoll_ctl(m_fd, EPOLL_CTL_ADD, m_stop_event_fd, &event);\n    \n    if(ret < 0)\n    {\n        LOG_FATAL(\"stop event epoll_ctl failed in Poller_Task::Poller_Task\");\n    }\n}\n\ntemplate<typename T>\nbool Poller_Task<T>::register_connection(std::shared_ptr<Connection<T>> connection)\n{\n    struct epoll_event event;\n    event.data.ptr = connection.get();\n    event.events = EPOLLIN | EPOLLOUT | EPOLLRDHUP | EPOLLET;\n    connection->m_poller_task = this;\n    connection->m_self = connection;\n    connection->m_init_cb(connection);\n    int32 ret = epoll_ctl(m_fd, EPOLL_CTL_ADD, connection->m_fd, &event);\n\n    if(ret < 0)\n    {\n        LOG_FATAL(\"epoll_ctl failed in Poller_Task::register_connection: %s\", strerror(errno));\n        close(connection->m_fd);\n        connection->m_closed.store(true, std::memory_order_relaxed);\n        connection->m_be_closed_cb(connection->shared_from_this());\n        connection->m_self.reset();\n        \n        return false;\n    }\n\n    return true;\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::close_connection(std::shared_ptr<Connection<T>> connection)\n{\n    m_close_queue.push(connection);\n    uint64 data = 1;\n    int32 num = write(m_close_event_fd, &data, sizeof(uint64));\n\n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"write m_close_event_fd failed in Poller_Task::close_connection\");\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::stop()\n{\n    uint64 data = 1;\n    int32 num = write(m_stop_event_fd, &data, sizeof(uint64));\n    \n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"write m_stop_event_fd failed in Poller_Task::stop\");\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::write_connection(std::shared_ptr<Connection<T>> connection)\n{\n    m_write_queue.push(connection);\n    uint64 data = 1;\n    int32 num = write(m_write_event_fd, &data, sizeof(uint64));\n    \n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"write m_write_event_fd failed in Poller_Task::write_connection\");\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::do_write(std::shared_ptr<Connection<T>> connection)\n{\n    int32 fd = connection->m_fd;\n    Message_Chunk_Queue &send_queue = connection->m_send_msg_queue;\n    \n    while(Message_Chunk *message_chunk = send_queue.pop())\n    {\n        int32 message_length = message_chunk->length();\n        int32 num = write(fd, message_chunk->read_ptr(), message_length);\n\n        if(num < 0)\n        {\n            if(errno == EAGAIN || errno == EWOULDBLOCK)\n            {\n                send_queue.push_front(message_chunk);\n                \n                break;\n            }\n        }\n\n        if(num == 0)\n        {\n            LOG_FATAL(\"write return 0, it's impossible, in Poller_Task::do_write(arg)\");\n        }\n        \n        if(num <= 0)\n        {\n            epoll_ctl(m_fd, EPOLL_CTL_DEL, fd, NULL);\n            close(fd);\n            connection->m_self.reset();\n            connection->m_closed.store(true, std::memory_order_relaxed);\n            connection->m_be_closed_cb(connection);\n            \n            break;\n        }\n                \n        if(num < message_length)\n        {\n            message_chunk->read_ptr(num);\n            send_queue.push_front(message_chunk);\n\n            break;\n        }\n        else\n        {\n            delete message_chunk;\n        }\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::do_write()\n{\n    uint64 data = 0;\n    int32 num = read(m_write_event_fd, &data, sizeof(uint64));\n\n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"read m_write_event_fd failed in Poller_Task::do_write\");\n        \n        return;\n    }\n    \n    std::list<std::shared_ptr<Connection<T>>> write_queue;\n\n    if(m_write_queue.pop(write_queue))\n    {\n        for(auto &connection : write_queue)\n        {\n            if(!connection->m_closed.load(std::memory_order_relaxed))\n            {\n                do_write(connection);\n            }\n        }\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::do_close()\n{\n    uint64 data = 0;\n    int32 num = read(m_close_event_fd, &data, sizeof(uint64));\n    \n    if(num != sizeof(uint64))\n    {\n        LOG_FATAL(\"read m_close_event_fd failed in Poller_Task::do_close\");\n        \n        return;\n    }\n\n    std::list<std::shared_ptr<Connection<T>>> close_queue;\n\n    if(m_close_queue.pop(close_queue))\n    {\n        for(auto &connection : close_queue)\n        {\n            if(!connection->m_closed.load(std::memory_order_relaxed))\n            {\n                int32 fd = connection->m_fd;\n                int ret = epoll_ctl(m_fd, EPOLL_CTL_DEL, fd, NULL);\n\n                if(ret < 0)\n                {\n                    LOG_FATAL(\"epoll_ctl EPOLL_CTL_DEL failed in Poller_Task::do_close: %s\", strerror(errno));\n                }\n                \n                close(fd);\n                connection->m_self.reset();\n                connection->m_closed.store(true, std::memory_order_relaxed);\n                connection->m_close_cb(connection);\n            }\n        }\n    }\n}\n\ntemplate<typename T>\nvoid Poller_Task<T>::run_in_loop()\n{\n    struct epoll_event events[2048];\n    int32 fd_num = epoll_wait(m_fd, events, 2048, -1);\n    \n    if(fd_num < 0)\n    {\n        LOG_FATAL(\"epoll_wait failed in Poller_Task::run_in_loop %s\", strerror(errno));\n\n        return;\n    }\n\n    for(auto i = 0; i < fd_num; ++i)\n    {\n        Connection<T> *connection = static_cast<Connection<T>*>(events[i].data.ptr);\n        int32 fd = connection->m_fd;\n        uint32 event = events[i].events;\n\n        if(event & (EPOLLERR | EPOLLHUP | EPOLLRDHUP))\n        {\n            if(connection->m_closed.load(std::memory_order_relaxed))\n            {\n                continue;\n            }\n\n            int ret = epoll_ctl(m_fd, EPOLL_CTL_DEL, fd, NULL);\n\n            if(ret < 0)\n            {\n                LOG_FATAL(\"epoll_ctl EPOLL_CTL_DEL failed in Poller_Task::run_in_loop: %s\", strerror(errno));\n            }\n\n            close(fd);\n            connection->m_closed.store(true, std::memory_order_relaxed);\n            connection->m_be_closed_cb(connection->shared_from_this());\n            connection->m_self.reset();\n        }\n        else if(event & EPOLLIN)\n        {\n            if(fd == m_close_event_fd)\n            {\n                do_close();\n            }\n            else if(fd == m_write_event_fd)\n            {\n                do_write();\n            }\n            else if(fd == m_stop_event_fd)\n            {\n                Loop_Task::stop();\n                close(m_fd);\n                break;\n            }\n            else\n            {\n                if(connection->m_closed.load(std::memory_order_relaxed))\n                {\n                    continue;\n                }\n                \n                while(true)\n                {\n                    const uint32 REQ_SIZE = 100 * 1024;\n                    Message_Chunk_Queue &recv_queue = connection->m_recv_msg_queue;\n                    std::unique_ptr<Message_Chunk> message_chunk(new Message_Chunk(REQ_SIZE));\n                    int32 num = read(fd, message_chunk->read_ptr(), REQ_SIZE);\n\n                    if(num < 0)\n                    {\n                        if(errno == EAGAIN || errno == EWOULDBLOCK)\n                        {\n                            break;\n                        }\n                    }\n                \n                    if(num <= 0)\n                    {\n                        epoll_ctl(m_fd, EPOLL_CTL_DEL, fd, NULL);\n                        close(fd);\n                        connection->m_closed.store(true, std::memory_order_relaxed);\n                        connection->m_be_closed_cb(connection->shared_from_this());\n                        connection->m_self.reset();\n\n                        break;\n                    }\n                    \n                    message_chunk->write_ptr(num);\n                    recv_queue.push(message_chunk.release());\n                    connection->parse();\n\n                    if(num < REQ_SIZE)\n                    {\n                        break;\n                    }\n                }\n            }\n        }\n\n        if(event & EPOLLOUT)\n        {\n            if(connection->m_closed.load(std::memory_order_relaxed))\n            {\n                continue;\n            }\n            \n            do_write(connection->shared_from_this());\n        }\n    }\n}\n\ntemplate class Poller_Task<Json>;\ntemplate class Poller_Task<Wsock>;\ntemplate class Poller_Task<Proto>;\n    \n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2016 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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"tri-zip.h\"\n\n#include \"Basics\/files.h\"\n#include \"Basics\/FileUtils.h\"\n#include \"Basics\/tri-strings.h\"\n#include \"Zip\/unzip.h\"\n#include \"Zip\/zip.h\"\n\n#ifdef _WIN32\n#define USEWIN32IOAPI\n#include \"Zip\/iowin32.h\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief extracts the current file\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic int ExtractCurrentFile(unzFile uf, void* buffer, size_t const bufferSize,\n                              char const* outPath, bool const skipPaths,\n                              bool const overwrite, char const* password,\n                              std::string& errorMessage) {\n  char filenameInZip[256];\n  char* filenameWithoutPath;\n  char* fullPath;\n  char* p;\n  unz_file_info64 fileInfo;\n  long systemError;\n  int err;\n\n  \/\/ cppcheck-suppress *\n  FILE* fout;\n\n  filenameInZip[0] = '\\0';\n  err = unzGetCurrentFileInfo64(uf, &fileInfo, filenameInZip,\n                                sizeof(filenameInZip), NULL, 0, NULL, 0);\n  if (err != UNZ_OK) {\n    errorMessage = std::string(\"Failed to get file info for \") + filenameInZip +\n                   \": \" + std::to_string(err);\n    return TRI_ERROR_INTERNAL;\n  }\n\n  \/\/ adjust file name\n  p = filenameInZip;\n  while (*p != '\\0') {\n#ifdef WIN32\n    if (*p == '\/') {\n      *p = '\\\\';\n    }\n#else\n    if (*p == '\\\\') {\n      *p = '\/';\n    }\n#endif\n    ++p;\n  }\n\n  p = filenameWithoutPath = filenameInZip;\n\n  \/\/ get the file name without any path prefix\n  while (*p != '\\0') {\n    if (*p == '\/' || *p == '\\\\' || *p == ':') {\n      filenameWithoutPath = p + 1;\n    }\n\n    p++;\n  }\n\n  \/\/ found a directory\n  if (*filenameWithoutPath == '\\0') {\n    if (!skipPaths) {\n      fullPath = TRI_Concatenate2File(outPath, filenameInZip);\n      int res =\n          TRI_CreateRecursiveDirectory(fullPath, systemError, errorMessage);\n\n      if (res != TRI_ERROR_NO_ERROR) {\n        TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n        return res;\n      }\n\n      TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n    }\n  }\n\n  \/\/ found a file\n  else {\n    char const* writeFilename;\n\n    if (!skipPaths) {\n      writeFilename = filenameInZip;\n    } else {\n      writeFilename = filenameWithoutPath;\n    }\n\n    err = unzOpenCurrentFilePassword(uf, password);\n    if (err != UNZ_OK) {\n      errorMessage = \"failed to authenticate the password in the zip: \" +\n                     std::to_string(err);\n      return TRI_ERROR_INTERNAL;\n    }\n\n    \/\/ prefix the name from the zip file with the path specified\n    fullPath = TRI_Concatenate2File(outPath, writeFilename);\n\n    if (!overwrite && TRI_ExistsFile(fullPath)) {\n      TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n      errorMessage = std::string(\"not allowed to overwrite file \") + fullPath;\n      return TRI_ERROR_CANNOT_OVERWRITE_FILE;\n    }\n\n    \/\/ try to write the outfile\n    fout = fopen(fullPath, \"wb\");\n\n    \/\/ cannot write to outfile. this may be due to the target directory missing\n    if (fout == nullptr && !skipPaths &&\n        filenameWithoutPath != (char*)filenameInZip) {\n      char c = *(filenameWithoutPath - 1);\n      *(filenameWithoutPath - 1) = '\\0';\n\n      \/\/ create target directory recursively\n      char* d = TRI_Concatenate2File(outPath, filenameInZip);\n      int res = TRI_CreateRecursiveDirectory(d, systemError, errorMessage);\n\n      if (res != TRI_ERROR_NO_ERROR) {\n        TRI_Free(TRI_CORE_MEM_ZONE, d);\n        return res;\n      }\n\n      TRI_Free(TRI_CORE_MEM_ZONE, d);\n\n      *(filenameWithoutPath - 1) = c;\n\n      \/\/ try again\n      fout = fopen(fullPath, \"wb\");\n    } else if (fout == nullptr) {\n      \/\/ try to create the target directory recursively\n      char* d = TRI_Concatenate2File(outPath, filenameInZip);\n      \/\/ strip filename so we only have the directory name\n      char* dir = TRI_Dirname(d);\n      int res = TRI_CreateRecursiveDirectory(dir, systemError, errorMessage);\n\n      if (res != TRI_ERROR_NO_ERROR) {\n        TRI_Free(TRI_CORE_MEM_ZONE, d);\n        TRI_Free(TRI_CORE_MEM_ZONE, dir);\n        return res;\n      }\n\n      TRI_Free(TRI_CORE_MEM_ZONE, d);\n      TRI_Free(TRI_CORE_MEM_ZONE, dir);\n      \/\/ try again\n      fout = fopen(fullPath, \"wb\");\n    }\n\n    if (fout == NULL) {\n      errorMessage = std::string(\"failed to open file for writing: \") +\n                     fullPath + \" - \" + strerror(errno);\n      TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n      return TRI_ERROR_CANNOT_WRITE_FILE;\n    }\n\n    while (true) {\n      int result = unzReadCurrentFile(uf, buffer, (unsigned int)bufferSize);\n\n      if (result < 0) {\n        errorMessage = std::string(\"failed to write file \") + fullPath + \" - \" +\n                       strerror(errno);\n        fclose(fout);\n        TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n        return TRI_ERROR_CANNOT_WRITE_FILE;\n      }\n\n      if (result > 0) {\n        if (fwrite(buffer, result, 1, fout) != 1) {\n          errorMessage = std::string(\"failed to write file \") + fullPath +\n                         \" - \" + strerror(errno);\n          TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n          fclose(fout);\n          return TRI_set_errno(TRI_ERROR_SYS_ERROR);\n        }\n      } else {\n        TRI_ASSERT(result == 0);\n        break;\n      }\n    }\n    TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n\n    fclose(fout);\n  }\n\n  unzCloseCurrentFile(uf);\n\n  return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief unzips a single file\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic int UnzipFile(unzFile uf, void* buffer, size_t const bufferSize,\n                     char const* outPath, bool const skipPaths,\n                     bool const overwrite, char const* password,\n                     std::string& errorMessage) {\n  unz_global_info64 gi;\n  uLong i;\n  int res = TRI_ERROR_NO_ERROR;\n  int err;\n\n  err = unzGetGlobalInfo64(uf, &gi);\n  if (err != UNZ_OK) {\n    errorMessage = \"Failed to get info: \" + std::to_string(err);\n    return TRI_ERROR_INTERNAL;\n  }\n\n  for (i = 0; i < gi.number_entry; i++) {\n    res = ExtractCurrentFile(uf, buffer, bufferSize, outPath, skipPaths,\n                             overwrite, password, errorMessage);\n\n    if (res != TRI_ERROR_NO_ERROR) {\n      break;\n    }\n\n    if ((i + 1) < gi.number_entry) {\n      err = unzGoToNextFile(uf);\n      if (err == UNZ_END_OF_LIST_OF_FILE) {\n        break;\n      } else if (err != UNZ_OK) {\n        errorMessage = \"Failed to jump to next file: \" + std::to_string(err);\n        res = TRI_ERROR_INTERNAL;\n        break;\n      }\n    }\n  }\n\n  return res;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief zips a file\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint TRI_ZipFile(char const* filename, char const* dir,\n                std::vector<std::string> const& files, char const* password) {\n  void* buffer;\n#ifdef USEWIN32IOAPI\n  zlib_filefunc64_def ffunc;\n#endif\n\n  if (TRI_ExistsFile(filename)) {\n    return TRI_ERROR_CANNOT_OVERWRITE_FILE;\n  }\n\n  int bufferSize = 16384;\n  buffer = TRI_Allocate(TRI_UNKNOWN_MEM_ZONE, (size_t)bufferSize, false);\n\n  if (buffer == nullptr) {\n    return TRI_ERROR_OUT_OF_MEMORY;\n  }\n\n#ifdef USEWIN32IOAPI\n  fill_win32_filefunc64A(&ffunc);\n  zipFile zf = zipOpen2_64(filename, 0, NULL, &ffunc);\n#else\n  zipFile zf = zipOpen64(filename, 0);\n#endif\n\n  if (zf == nullptr) {\n    TRI_Free(TRI_UNKNOWN_MEM_ZONE, buffer);\n\n    return ZIP_ERRNO;\n  }\n\n  int res = TRI_ERROR_NO_ERROR;\n\n  size_t n = files.size();\n  for (size_t i = 0; i < n; ++i) {\n    std::string fullfile;\n\n    if (*dir == '\\0') {\n      fullfile = files[i];\n    } else {\n      fullfile = arangodb::basics::FileUtils::buildFilename(dir, files[i]);\n    }\n\n    zip_fileinfo zi;\n    memset(&zi, 0, sizeof(zi));\n\n    uint32_t crc;\n    res = TRI_Crc32File(fullfile.c_str(), &crc);\n\n    if (res != TRI_ERROR_NO_ERROR) {\n      break;\n    }\n\n    int isLarge = (TRI_SizeFile(files[i].c_str()) > 0xFFFFFFFFLL);\n\n    char const* saveName = files[i].c_str();\n\n    while (*saveName == '\\\\' || *saveName == '\/') {\n      ++saveName;\n    }\n\n    if (zipOpenNewFileInZip3_64(\n            zf, saveName, &zi, NULL, 0, NULL, 0, NULL, \/* comment*\/\n            Z_DEFLATED, Z_DEFAULT_COMPRESSION, 0, -MAX_WBITS, DEF_MEM_LEVEL,\n            Z_DEFAULT_STRATEGY, password, (unsigned long)crc,\n            isLarge) != ZIP_OK) {\n      res = TRI_ERROR_INTERNAL;\n      break;\n    }\n\n    FILE* fin = fopen(fullfile.c_str(), \"rb\");\n\n    if (fin == nullptr) {\n      break;\n    }\n\n    while (true) {\n      int sizeRead = (int)fread(buffer, 1, bufferSize, fin);\n      if (sizeRead < bufferSize) {\n        if (feof(fin) == 0) {\n          res = TRI_set_errno(TRI_ERROR_SYS_ERROR);\n          break;\n        }\n      }\n\n      if (sizeRead > 0) {\n        res = zipWriteInFileInZip(zf, buffer, sizeRead);\n        if (res != 0) {\n          break;\n        }\n      } else \/* if (sizeRead <= 0) *\/ {\n        break;\n      }\n    }\n\n    fclose(fin);\n\n    zipCloseFileInZip(zf);\n\n    if (res != TRI_ERROR_NO_ERROR) {\n      break;\n    }\n  }\n\n  zipClose(zf, NULL);\n\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, buffer);\n\n  return res;\n}\n\nint TRI_Adler32(char const* filename, uint32_t& checksum) {\n  checksum = 0;\n\n  if (!TRI_IsRegularFile(filename) && !TRI_IsSymbolicLink(filename)) {\n    return TRI_ERROR_FILE_NOT_FOUND;\n  }\n\n  int fd = TRI_OPEN(filename, O_RDONLY);\n  if (fd < 0) {\n    return TRI_ERROR_FILE_NOT_FOUND;\n  }\n  TRI_DEFER(TRI_CLOSE(fd));\n\n  struct TRI_STAT statbuf;\n  TRI_FSTAT(fd, &statbuf);\n\n  ssize_t chunkRemain = static_cast<TRI_read_t>(statbuf.st_size);\n  char* buf =\n      static_cast<char*>(TRI_Allocate(TRI_UNKNOWN_MEM_ZONE, 131072, false));\n\n  if (buf == nullptr) {\n    return TRI_ERROR_OUT_OF_MEMORY;\n  }\n\n  uLong adler = adler32(0L, Z_NULL, 0);\n  while (chunkRemain > 0) {\n    TRI_read_t readChunk;\n    if (chunkRemain > 131072) {\n      readChunk = 131072;\n    } else {\n      readChunk = chunkRemain;\n    }\n\n    ssize_t nRead = TRI_READ(fd, buf, readChunk);\n\n    if (nRead < 0) {\n      TRI_Free(TRI_UNKNOWN_MEM_ZONE, buf);\n      return TRI_ERROR_INTERNAL;\n    }\n    \n    adler = adler32(adler, reinterpret_cast<const unsigned char *>(buf), static_cast<uInt>(nRead));\n    chunkRemain -= nRead;\n  }\n\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, buf);\n\n  checksum = static_cast<uint32_t>(adler);\n  return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief unzips a file\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint TRI_UnzipFile(char const* filename, char const* outPath,\n                  bool skipPaths, bool overwrite,\n                  char const* password, std::string& errorMessage) {\n#ifdef USEWIN32IOAPI\n  zlib_filefunc64_def ffunc;\n#endif\n  size_t bufferSize = 16384;\n  void* buffer = (void*)TRI_Allocate(TRI_UNKNOWN_MEM_ZONE, bufferSize, false);\n\n  if (buffer == nullptr) {\n    return TRI_ERROR_OUT_OF_MEMORY;\n  }\n\n#ifdef USEWIN32IOAPI\n  fill_win32_filefunc64A(&ffunc);\n  unzFile uf = unzOpen2_64(filename, &ffunc);\n#else\n  unzFile uf = unzOpen64(filename);\n#endif\n  if (uf == nullptr) {\n    TRI_Free(TRI_UNKNOWN_MEM_ZONE, buffer);\n    errorMessage = std::string(\"unable to open zip file \") + filename;\n    return TRI_ERROR_INTERNAL;\n  }\n\n  int res = UnzipFile(uf, buffer, bufferSize, outPath, skipPaths, overwrite,\n                      password, errorMessage);\n\n  unzClose(uf);\n\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, buffer);\n\n  return res;\n}\n<commit_msg>honor result of stat() call<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2016 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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"tri-zip.h\"\n\n#include \"Basics\/files.h\"\n#include \"Basics\/FileUtils.h\"\n#include \"Basics\/tri-strings.h\"\n#include \"Zip\/unzip.h\"\n#include \"Zip\/zip.h\"\n\n#ifdef _WIN32\n#define USEWIN32IOAPI\n#include \"Zip\/iowin32.h\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief extracts the current file\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic int ExtractCurrentFile(unzFile uf, void* buffer, size_t const bufferSize,\n                              char const* outPath, bool const skipPaths,\n                              bool const overwrite, char const* password,\n                              std::string& errorMessage) {\n  char filenameInZip[256];\n  char* filenameWithoutPath;\n  char* fullPath;\n  char* p;\n  unz_file_info64 fileInfo;\n  long systemError;\n  int err;\n\n  \/\/ cppcheck-suppress *\n  FILE* fout;\n\n  filenameInZip[0] = '\\0';\n  err = unzGetCurrentFileInfo64(uf, &fileInfo, filenameInZip,\n                                sizeof(filenameInZip), NULL, 0, NULL, 0);\n  if (err != UNZ_OK) {\n    errorMessage = std::string(\"Failed to get file info for \") + filenameInZip +\n                   \": \" + std::to_string(err);\n    return TRI_ERROR_INTERNAL;\n  }\n\n  \/\/ adjust file name\n  p = filenameInZip;\n  while (*p != '\\0') {\n#ifdef WIN32\n    if (*p == '\/') {\n      *p = '\\\\';\n    }\n#else\n    if (*p == '\\\\') {\n      *p = '\/';\n    }\n#endif\n    ++p;\n  }\n\n  p = filenameWithoutPath = filenameInZip;\n\n  \/\/ get the file name without any path prefix\n  while (*p != '\\0') {\n    if (*p == '\/' || *p == '\\\\' || *p == ':') {\n      filenameWithoutPath = p + 1;\n    }\n\n    p++;\n  }\n\n  \/\/ found a directory\n  if (*filenameWithoutPath == '\\0') {\n    if (!skipPaths) {\n      fullPath = TRI_Concatenate2File(outPath, filenameInZip);\n      int res =\n          TRI_CreateRecursiveDirectory(fullPath, systemError, errorMessage);\n\n      if (res != TRI_ERROR_NO_ERROR) {\n        TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n        return res;\n      }\n\n      TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n    }\n  }\n\n  \/\/ found a file\n  else {\n    char const* writeFilename;\n\n    if (!skipPaths) {\n      writeFilename = filenameInZip;\n    } else {\n      writeFilename = filenameWithoutPath;\n    }\n\n    err = unzOpenCurrentFilePassword(uf, password);\n    if (err != UNZ_OK) {\n      errorMessage = \"failed to authenticate the password in the zip: \" +\n                     std::to_string(err);\n      return TRI_ERROR_INTERNAL;\n    }\n\n    \/\/ prefix the name from the zip file with the path specified\n    fullPath = TRI_Concatenate2File(outPath, writeFilename);\n\n    if (!overwrite && TRI_ExistsFile(fullPath)) {\n      TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n      errorMessage = std::string(\"not allowed to overwrite file \") + fullPath;\n      return TRI_ERROR_CANNOT_OVERWRITE_FILE;\n    }\n\n    \/\/ try to write the outfile\n    fout = fopen(fullPath, \"wb\");\n\n    \/\/ cannot write to outfile. this may be due to the target directory missing\n    if (fout == nullptr && !skipPaths &&\n        filenameWithoutPath != (char*)filenameInZip) {\n      char c = *(filenameWithoutPath - 1);\n      *(filenameWithoutPath - 1) = '\\0';\n\n      \/\/ create target directory recursively\n      char* d = TRI_Concatenate2File(outPath, filenameInZip);\n      int res = TRI_CreateRecursiveDirectory(d, systemError, errorMessage);\n\n      if (res != TRI_ERROR_NO_ERROR) {\n        TRI_Free(TRI_CORE_MEM_ZONE, d);\n        return res;\n      }\n\n      TRI_Free(TRI_CORE_MEM_ZONE, d);\n\n      *(filenameWithoutPath - 1) = c;\n\n      \/\/ try again\n      fout = fopen(fullPath, \"wb\");\n    } else if (fout == nullptr) {\n      \/\/ try to create the target directory recursively\n      char* d = TRI_Concatenate2File(outPath, filenameInZip);\n      \/\/ strip filename so we only have the directory name\n      char* dir = TRI_Dirname(d);\n      int res = TRI_CreateRecursiveDirectory(dir, systemError, errorMessage);\n\n      if (res != TRI_ERROR_NO_ERROR) {\n        TRI_Free(TRI_CORE_MEM_ZONE, d);\n        TRI_Free(TRI_CORE_MEM_ZONE, dir);\n        return res;\n      }\n\n      TRI_Free(TRI_CORE_MEM_ZONE, d);\n      TRI_Free(TRI_CORE_MEM_ZONE, dir);\n      \/\/ try again\n      fout = fopen(fullPath, \"wb\");\n    }\n\n    if (fout == NULL) {\n      errorMessage = std::string(\"failed to open file for writing: \") +\n                     fullPath + \" - \" + strerror(errno);\n      TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n      return TRI_ERROR_CANNOT_WRITE_FILE;\n    }\n\n    while (true) {\n      int result = unzReadCurrentFile(uf, buffer, (unsigned int)bufferSize);\n\n      if (result < 0) {\n        errorMessage = std::string(\"failed to write file \") + fullPath + \" - \" +\n                       strerror(errno);\n        fclose(fout);\n        TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n        return TRI_ERROR_CANNOT_WRITE_FILE;\n      }\n\n      if (result > 0) {\n        if (fwrite(buffer, result, 1, fout) != 1) {\n          errorMessage = std::string(\"failed to write file \") + fullPath +\n                         \" - \" + strerror(errno);\n          TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n          fclose(fout);\n          return TRI_set_errno(TRI_ERROR_SYS_ERROR);\n        }\n      } else {\n        TRI_ASSERT(result == 0);\n        break;\n      }\n    }\n    TRI_Free(TRI_CORE_MEM_ZONE, fullPath);\n\n    fclose(fout);\n  }\n\n  unzCloseCurrentFile(uf);\n\n  return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief unzips a single file\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic int UnzipFile(unzFile uf, void* buffer, size_t const bufferSize,\n                     char const* outPath, bool const skipPaths,\n                     bool const overwrite, char const* password,\n                     std::string& errorMessage) {\n  unz_global_info64 gi;\n  uLong i;\n  int res = TRI_ERROR_NO_ERROR;\n  int err;\n\n  err = unzGetGlobalInfo64(uf, &gi);\n  if (err != UNZ_OK) {\n    errorMessage = \"Failed to get info: \" + std::to_string(err);\n    return TRI_ERROR_INTERNAL;\n  }\n\n  for (i = 0; i < gi.number_entry; i++) {\n    res = ExtractCurrentFile(uf, buffer, bufferSize, outPath, skipPaths,\n                             overwrite, password, errorMessage);\n\n    if (res != TRI_ERROR_NO_ERROR) {\n      break;\n    }\n\n    if ((i + 1) < gi.number_entry) {\n      err = unzGoToNextFile(uf);\n      if (err == UNZ_END_OF_LIST_OF_FILE) {\n        break;\n      } else if (err != UNZ_OK) {\n        errorMessage = \"Failed to jump to next file: \" + std::to_string(err);\n        res = TRI_ERROR_INTERNAL;\n        break;\n      }\n    }\n  }\n\n  return res;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief zips a file\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint TRI_ZipFile(char const* filename, char const* dir,\n                std::vector<std::string> const& files, char const* password) {\n  void* buffer;\n#ifdef USEWIN32IOAPI\n  zlib_filefunc64_def ffunc;\n#endif\n\n  if (TRI_ExistsFile(filename)) {\n    return TRI_ERROR_CANNOT_OVERWRITE_FILE;\n  }\n\n  int bufferSize = 16384;\n  buffer = TRI_Allocate(TRI_UNKNOWN_MEM_ZONE, (size_t)bufferSize, false);\n\n  if (buffer == nullptr) {\n    return TRI_ERROR_OUT_OF_MEMORY;\n  }\n\n#ifdef USEWIN32IOAPI\n  fill_win32_filefunc64A(&ffunc);\n  zipFile zf = zipOpen2_64(filename, 0, NULL, &ffunc);\n#else\n  zipFile zf = zipOpen64(filename, 0);\n#endif\n\n  if (zf == nullptr) {\n    TRI_Free(TRI_UNKNOWN_MEM_ZONE, buffer);\n\n    return ZIP_ERRNO;\n  }\n\n  int res = TRI_ERROR_NO_ERROR;\n\n  size_t n = files.size();\n  for (size_t i = 0; i < n; ++i) {\n    std::string fullfile;\n\n    if (*dir == '\\0') {\n      fullfile = files[i];\n    } else {\n      fullfile = arangodb::basics::FileUtils::buildFilename(dir, files[i]);\n    }\n\n    zip_fileinfo zi;\n    memset(&zi, 0, sizeof(zi));\n\n    uint32_t crc;\n    res = TRI_Crc32File(fullfile.c_str(), &crc);\n\n    if (res != TRI_ERROR_NO_ERROR) {\n      break;\n    }\n\n    int isLarge = (TRI_SizeFile(files[i].c_str()) > 0xFFFFFFFFLL);\n\n    char const* saveName = files[i].c_str();\n\n    while (*saveName == '\\\\' || *saveName == '\/') {\n      ++saveName;\n    }\n\n    if (zipOpenNewFileInZip3_64(\n            zf, saveName, &zi, NULL, 0, NULL, 0, NULL, \/* comment*\/\n            Z_DEFLATED, Z_DEFAULT_COMPRESSION, 0, -MAX_WBITS, DEF_MEM_LEVEL,\n            Z_DEFAULT_STRATEGY, password, (unsigned long)crc,\n            isLarge) != ZIP_OK) {\n      res = TRI_ERROR_INTERNAL;\n      break;\n    }\n\n    FILE* fin = fopen(fullfile.c_str(), \"rb\");\n\n    if (fin == nullptr) {\n      break;\n    }\n\n    while (true) {\n      int sizeRead = (int)fread(buffer, 1, bufferSize, fin);\n      if (sizeRead < bufferSize) {\n        if (feof(fin) == 0) {\n          res = TRI_set_errno(TRI_ERROR_SYS_ERROR);\n          break;\n        }\n      }\n\n      if (sizeRead > 0) {\n        res = zipWriteInFileInZip(zf, buffer, sizeRead);\n        if (res != 0) {\n          break;\n        }\n      } else \/* if (sizeRead <= 0) *\/ {\n        break;\n      }\n    }\n\n    fclose(fin);\n\n    zipCloseFileInZip(zf);\n\n    if (res != TRI_ERROR_NO_ERROR) {\n      break;\n    }\n  }\n\n  zipClose(zf, NULL);\n\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, buffer);\n\n  return res;\n}\n\nint TRI_Adler32(char const* filename, uint32_t& checksum) {\n  checksum = 0;\n\n  if (!TRI_IsRegularFile(filename) && !TRI_IsSymbolicLink(filename)) {\n    return TRI_ERROR_FILE_NOT_FOUND;\n  }\n\n  int fd = TRI_OPEN(filename, O_RDONLY);\n  if (fd < 0) {\n    return TRI_ERROR_FILE_NOT_FOUND;\n  }\n  TRI_DEFER(TRI_CLOSE(fd));\n\n  struct TRI_STAT statbuf;\n  int res = TRI_FSTAT(fd, &statbuf);\n  if (res < 0) {\n    TRI_SYSTEM_ERROR();\n    return TRI_set_errno(TRI_ERROR_SYS_ERROR);\n  }\n\n  ssize_t chunkRemain = static_cast<TRI_read_t>(statbuf.st_size);\n  char* buf =\n      static_cast<char*>(TRI_Allocate(TRI_UNKNOWN_MEM_ZONE, 131072, false));\n\n  if (buf == nullptr) {\n    return TRI_ERROR_OUT_OF_MEMORY;\n  }\n\n  uLong adler = adler32(0L, Z_NULL, 0);\n  while (chunkRemain > 0) {\n    TRI_read_t readChunk;\n    if (chunkRemain > 131072) {\n      readChunk = 131072;\n    } else {\n      readChunk = chunkRemain;\n    }\n\n    ssize_t nRead = TRI_READ(fd, buf, readChunk);\n\n    if (nRead < 0) {\n      TRI_Free(TRI_UNKNOWN_MEM_ZONE, buf);\n      return TRI_ERROR_INTERNAL;\n    }\n    \n    adler = adler32(adler, reinterpret_cast<const unsigned char *>(buf), static_cast<uInt>(nRead));\n    chunkRemain -= nRead;\n  }\n\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, buf);\n\n  checksum = static_cast<uint32_t>(adler);\n  return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief unzips a file\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint TRI_UnzipFile(char const* filename, char const* outPath,\n                  bool skipPaths, bool overwrite,\n                  char const* password, std::string& errorMessage) {\n#ifdef USEWIN32IOAPI\n  zlib_filefunc64_def ffunc;\n#endif\n  size_t bufferSize = 16384;\n  void* buffer = (void*)TRI_Allocate(TRI_UNKNOWN_MEM_ZONE, bufferSize, false);\n\n  if (buffer == nullptr) {\n    return TRI_ERROR_OUT_OF_MEMORY;\n  }\n\n#ifdef USEWIN32IOAPI\n  fill_win32_filefunc64A(&ffunc);\n  unzFile uf = unzOpen2_64(filename, &ffunc);\n#else\n  unzFile uf = unzOpen64(filename);\n#endif\n  if (uf == nullptr) {\n    TRI_Free(TRI_UNKNOWN_MEM_ZONE, buffer);\n    errorMessage = std::string(\"unable to open zip file \") + filename;\n    return TRI_ERROR_INTERNAL;\n  }\n\n  int res = UnzipFile(uf, buffer, bufferSize, outPath, skipPaths, overwrite,\n                      password, errorMessage);\n\n  unzClose(uf);\n\n  TRI_Free(TRI_UNKNOWN_MEM_ZONE, buffer);\n\n  return res;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\nHighly Optimized Object-oriented Many-particle Dynamics -- Blue Edition\r\n(HOOMD-blue) Open Source Software License Copyright 2008, 2009 Ames Laboratory\r\nIowa State University and The Regents of the University of Michigan All rights\r\nreserved.\r\n\r\nHOOMD-blue may contain modifications (\"Contributions\") provided, and to which\r\ncopyright is held, by various Contributors who have granted The Regents of the\r\nUniversity of Michigan the right to modify and\/or distribute such Contributions.\r\n\r\nRedistribution and use of HOOMD-blue, in source and binary forms, with or\r\nwithout modification, are permitted, provided that the following conditions are\r\nmet:\r\n\r\n* Redistributions of source code must retain the above copyright notice, this\r\nlist of conditions, and the following disclaimer.\r\n\r\n* Redistributions in binary form must reproduce the above copyright notice, this\r\nlist of conditions, and the following disclaimer in the documentation and\/or\r\nother materials provided with the distribution.\r\n\r\n* Neither the name of the copyright holder nor the names of HOOMD-blue's\r\ncontributors may be used to endorse or promote products derived from this\r\nsoftware without specific prior written permission.\r\n\r\nDisclaimer\r\n\r\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS''\r\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\nIMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND\/OR\r\nANY WARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.\r\n\r\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\r\nINDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\r\nBUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\r\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\r\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\r\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\r\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n*\/\r\n\r\n\/\/ $Id: FIREEnergyMinimizerGPU.cc 2587 2010-01-08 17:02:54Z joaander $\r\n\/\/ $URL: https:\/\/codeblue.umich.edu\/hoomd-blue\/svn\/trunk\/libhoomd\/updaters\/FIREEnergyMinimizerGPU.cc $\r\n\/\/ Maintainer: joaander\r\n\r\n#ifdef WIN32\r\n#pragma warning( push )\r\n#pragma warning( disable : 4244 )\r\n#endif\r\n\r\n#include <boost\/python.hpp>\r\nusing namespace boost::python;\r\n#include <boost\/bind.hpp>\r\nusing namespace boost;\r\n\r\n#include \"FIREEnergyMinimizerGPU.h\"\r\n#include \"FIREEnergyMinimizerGPU.cuh\"\r\n#include \"TwoStepNVEGPU.h\"\r\n\r\n\/*! \\file FIREEnergyMinimizerGPU.h\r\n    \\brief Contains code for the FIREEnergyMinimizerGPU class\r\n*\/\r\n\r\n\/*! \\param sysdef SystemDefinition this method will act on. Must not be NULL.\r\n    \\param group The group of particles this integration method is to work on\r\n    \\post The method is constructed with the given particle data and a NULL profiler.\r\n*\/\r\nFIREEnergyMinimizerGPU::FIREEnergyMinimizerGPU(boost::shared_ptr<SystemDefinition> sysdef, boost::shared_ptr<ParticleGroup> group, Scalar dt)\r\n    :   FIREEnergyMinimizer(sysdef, group, dt, false)\r\n    {\r\n    const ParticleDataArraysConst& arrays = m_pdata->acquireReadOnly();\r\n    m_nparticles = arrays.nparticles;\r\n    m_pdata->release();\r\n\r\n    \/\/ only one GPU is supported\r\n    if (exec_conf.gpu.size() != 1)\r\n        {\r\n        cerr << endl << \"***Error! Creating a FIREEnergyMinimizer with 0 or more than one GPUs\" << endl << endl;\r\n        throw std::runtime_error(\"Error initializing FIREEnergyMinimizer\");\r\n        }\r\n    \r\n    \/\/ allocate the sum arrays\r\n    GPUArray<float> sum(1, m_pdata->getExecConf());\r\n    m_sum.swap(sum);\r\n    GPUArray<float> sum3(3, m_pdata->getExecConf());\r\n    m_sum3.swap(sum3);\r\n    \r\n    \/\/ initialize the partial sum arrays\r\n    m_block_size = 256; \/\/128;\r\n    m_num_blocks = m_nparticles \/ m_block_size + 1;\r\n    GPUArray<float> partial_sum1(m_num_blocks, m_pdata->getExecConf());\r\n    m_partial_sum1.swap(partial_sum1);\r\n    GPUArray<float> partial_sum2(m_num_blocks, m_pdata->getExecConf());\r\n    m_partial_sum2.swap(partial_sum2);\r\n    GPUArray<float> partial_sum3(m_num_blocks, m_pdata->getExecConf());\r\n    m_partial_sum3.swap(partial_sum3);\r\n    \r\n    reset();\r\n    createIntegrator();\r\n    }\r\n\r\nvoid FIREEnergyMinimizerGPU::createIntegrator()\r\n    {\r\n    boost::shared_ptr<ParticleSelector> selector_all(new ParticleSelectorTag(m_sysdef, 0, m_pdata->getN()-1));\r\n    boost::shared_ptr<ParticleGroup> group_all(new ParticleGroup(m_sysdef, selector_all));\r\n    boost::shared_ptr<TwoStepNVEGPU> integrator(new TwoStepNVEGPU(m_sysdef, group_all));\r\n    addIntegrationMethod(integrator);\r\n    setDeltaT(m_deltaT);\r\n    }\r\n\r\nvoid FIREEnergyMinimizerGPU::reset()\r\n    {\r\n    m_converged = false;\r\n    m_n_since_negative = 0;\r\n    m_alpha = m_alpha_start;\r\n    m_was_reset = true;\r\n    vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadWriteGPU();\r\n    exec_conf.gpu[0]->call(bind(gpu_fire_zero_v, d_pdata[0]));\r\n    m_pdata->release();\r\n    setDeltaT(m_deltaT_set);\r\n    }\r\n\r\n\/*! \\param timesteps is the iteration number\r\n*\/\r\nvoid FIREEnergyMinimizerGPU::update(unsigned int timesteps)\r\n    {\r\n        \r\n    if (m_converged)\r\n        return;\r\n        \r\n    IntegratorTwoStep::update(timesteps);\r\n        \r\n    Scalar P(0.0);\r\n    Scalar vnorm(0.0);\r\n    Scalar fnorm(0.0);\r\n    Scalar energy(0.0);\r\n\r\n    \/\/ compute the total energy on the GPU\r\n    \/\/ CPU version is Scalar energy = computePotentialEnergy(timesteps)\/Scalar(n);\r\n    {\r\n    if (m_prof)\r\n        m_prof->push(exec_conf, \"FIRE compute total energy\");\r\n    \r\n    vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadOnlyGPU();\r\n    ArrayHandle<Scalar4> d_net_force(m_pdata->getNetForce(), access_location::device, access_mode::read);\r\n    ArrayHandle<float> d_partial_sumE(m_partial_sum1, access_location::device, access_mode::overwrite);\r\n    ArrayHandle<float> d_sumE(m_sum, access_location::device, access_mode::overwrite);\r\n    exec_conf.gpu[0]->call(bind(gpu_fire_compute_sum_pe, d_pdata[0], d_net_force.data, d_sumE.data, d_partial_sumE.data, m_block_size, m_num_blocks));\r\n    }\r\n    {\r\n    ArrayHandle<float> h_sumE(m_sum, access_location::host, access_mode::read);\r\n    energy = h_sumE.data[0]\/Scalar(m_nparticles);    \r\n    \r\n    m_pdata->release();\r\n\r\n    if (m_prof)\r\n        m_prof->pop(exec_conf);\r\n\r\n    }\r\n\r\n    if (m_was_reset)\r\n        {\r\n        m_was_reset = false;\r\n        m_old_energy = energy + Scalar(100000)*m_etol;\r\n        }\r\n    \r\n    \/\/sum P, vnorm, fnorm\r\n    {\r\n    if (m_prof)\r\n        m_prof->push(exec_conf, \"FIRE P, vnorm, fnorm\");\r\n    \r\n    vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadOnlyGPU();\r\n    ArrayHandle<float> d_partial_sum_P(m_partial_sum1, access_location::device, access_mode::overwrite);\r\n    ArrayHandle<float> d_partial_sum_vsq(m_partial_sum2, access_location::device, access_mode::overwrite);\r\n    ArrayHandle<float> d_partial_sum_fsq(m_partial_sum3, access_location::device, access_mode::overwrite);\r\n    ArrayHandle<float> d_sum(m_sum3, access_location::device, access_mode::overwrite);\r\n    exec_conf.gpu[0]->call(bind(gpu_fire_compute_sum_all, d_pdata[0], d_sum.data, d_partial_sum_P.data, d_partial_sum_vsq.data, d_partial_sum_fsq.data, m_block_size, m_num_blocks));\r\n    }\r\n    {\r\n    ArrayHandle<float> h_sum(m_sum3, access_location::host, access_mode::read);\r\n    P = h_sum.data[0];\r\n    vnorm = sqrt(h_sum.data[1]);\r\n    fnorm = sqrt(h_sum.data[2]);\r\n    \r\n    m_pdata->release();\r\n\r\n    if (m_prof)\r\n        m_prof->pop(exec_conf);            \r\n    }\r\n    \r\n    if (fnorm\/sqrt(m_sysdef->getNDimensions()*m_nparticles) < m_ftol || fabs(energy-m_old_energy) < m_etol)\r\n        {\r\n        m_converged = true;\r\n        return;\r\n        }\r\n\r\n    \/\/update velocities\r\n    {\r\n    if (m_prof)\r\n        m_prof->push(exec_conf, \"FIRE update velocities\");\r\n\r\n    Scalar invfnorm = 1.0\/fnorm;        \r\n    vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadWriteGPU();\r\n    exec_conf.gpu[0]->call(bind(gpu_fire_update_v, d_pdata[0], m_alpha, vnorm, invfnorm));\r\n    m_pdata->release();\r\n\r\n    if (m_prof)\r\n        m_prof->pop(exec_conf);                \r\n    }\r\n        \r\n    if (P > Scalar(0.0))\r\n        {\r\n        m_n_since_negative++;\r\n        if (m_n_since_negative > m_nmin)\r\n            {\r\n            IntegratorTwoStep::setDeltaT(std::min(m_deltaT*m_finc, m_deltaT_max));\r\n            m_alpha *= m_falpha;\r\n            }\r\n        }\r\n    else if (P <= Scalar(0.0))\r\n        {\r\n        IntegratorTwoStep::setDeltaT(m_deltaT*m_fdec);\r\n        m_alpha = m_alpha_start;\r\n        m_n_since_negative = 0;\r\n        if (m_prof)\r\n            m_prof->push(exec_conf, \"FIRE zero velocities\");\r\n        vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadWriteGPU();\r\n        exec_conf.gpu[0]->call(bind(gpu_fire_zero_v, d_pdata[0]));\r\n        m_pdata->release();\r\n        if (m_prof)\r\n            m_prof->pop(exec_conf);        \r\n        }\r\n    m_old_energy = energy;\r\n    }\r\n\r\n\r\nvoid export_FIREEnergyMinimizerGPU()\r\n    {\r\n    class_<FIREEnergyMinimizerGPU, boost::shared_ptr<FIREEnergyMinimizerGPU>,  bases<IntegratorTwoStep>, boost::noncopyable>\r\n        (\"FIREEnergyMinimizerGPU\", init< boost::shared_ptr<SystemDefinition>, boost::shared_ptr<ParticleGroup>, Scalar >())\r\n        ;\r\n    }\r\n\r\n#ifdef WIN32\r\n#pragma warning( pop )\r\n#endif\r\n\r\n<commit_msg>fixed GPU base class<commit_after>\/*\r\nHighly Optimized Object-oriented Many-particle Dynamics -- Blue Edition\r\n(HOOMD-blue) Open Source Software License Copyright 2008, 2009 Ames Laboratory\r\nIowa State University and The Regents of the University of Michigan All rights\r\nreserved.\r\n\r\nHOOMD-blue may contain modifications (\"Contributions\") provided, and to which\r\ncopyright is held, by various Contributors who have granted The Regents of the\r\nUniversity of Michigan the right to modify and\/or distribute such Contributions.\r\n\r\nRedistribution and use of HOOMD-blue, in source and binary forms, with or\r\nwithout modification, are permitted, provided that the following conditions are\r\nmet:\r\n\r\n* Redistributions of source code must retain the above copyright notice, this\r\nlist of conditions, and the following disclaimer.\r\n\r\n* Redistributions in binary form must reproduce the above copyright notice, this\r\nlist of conditions, and the following disclaimer in the documentation and\/or\r\nother materials provided with the distribution.\r\n\r\n* Neither the name of the copyright holder nor the names of HOOMD-blue's\r\ncontributors may be used to endorse or promote products derived from this\r\nsoftware without specific prior written permission.\r\n\r\nDisclaimer\r\n\r\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS''\r\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\nIMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND\/OR\r\nANY WARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.\r\n\r\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\r\nINDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\r\nBUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\r\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\r\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\r\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\r\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n*\/\r\n\r\n\/\/ $Id: FIREEnergyMinimizerGPU.cc 2587 2010-01-08 17:02:54Z joaander $\r\n\/\/ $URL: https:\/\/codeblue.umich.edu\/hoomd-blue\/svn\/trunk\/libhoomd\/updaters\/FIREEnergyMinimizerGPU.cc $\r\n\/\/ Maintainer: joaander\r\n\r\n#ifdef WIN32\r\n#pragma warning( push )\r\n#pragma warning( disable : 4244 )\r\n#endif\r\n\r\n#include <boost\/python.hpp>\r\nusing namespace boost::python;\r\n#include <boost\/bind.hpp>\r\nusing namespace boost;\r\n\r\n#include \"FIREEnergyMinimizerGPU.h\"\r\n#include \"FIREEnergyMinimizerGPU.cuh\"\r\n#include \"TwoStepNVEGPU.h\"\r\n\r\n\/*! \\file FIREEnergyMinimizerGPU.h\r\n    \\brief Contains code for the FIREEnergyMinimizerGPU class\r\n*\/\r\n\r\n\/*! \\param sysdef SystemDefinition this method will act on. Must not be NULL.\r\n    \\param group The group of particles this integration method is to work on\r\n    \\post The method is constructed with the given particle data and a NULL profiler.\r\n*\/\r\nFIREEnergyMinimizerGPU::FIREEnergyMinimizerGPU(boost::shared_ptr<SystemDefinition> sysdef, boost::shared_ptr<ParticleGroup> group, Scalar dt)\r\n    :   FIREEnergyMinimizer(sysdef, group, dt, false)\r\n    {\r\n    const ParticleDataArraysConst& arrays = m_pdata->acquireReadOnly();\r\n    m_nparticles = arrays.nparticles;\r\n    m_pdata->release();\r\n\r\n    \/\/ only one GPU is supported\r\n    if (exec_conf.gpu.size() != 1)\r\n        {\r\n        cerr << endl << \"***Error! Creating a FIREEnergyMinimizer with 0 or more than one GPUs\" << endl << endl;\r\n        throw std::runtime_error(\"Error initializing FIREEnergyMinimizer\");\r\n        }\r\n    \r\n    \/\/ allocate the sum arrays\r\n    GPUArray<float> sum(1, m_pdata->getExecConf());\r\n    m_sum.swap(sum);\r\n    GPUArray<float> sum3(3, m_pdata->getExecConf());\r\n    m_sum3.swap(sum3);\r\n    \r\n    \/\/ initialize the partial sum arrays\r\n    m_block_size = 256; \/\/128;\r\n    m_num_blocks = m_nparticles \/ m_block_size + 1;\r\n    GPUArray<float> partial_sum1(m_num_blocks, m_pdata->getExecConf());\r\n    m_partial_sum1.swap(partial_sum1);\r\n    GPUArray<float> partial_sum2(m_num_blocks, m_pdata->getExecConf());\r\n    m_partial_sum2.swap(partial_sum2);\r\n    GPUArray<float> partial_sum3(m_num_blocks, m_pdata->getExecConf());\r\n    m_partial_sum3.swap(partial_sum3);\r\n    \r\n    reset();\r\n    createIntegrator();\r\n    }\r\n\r\nvoid FIREEnergyMinimizerGPU::createIntegrator()\r\n    {\r\n    boost::shared_ptr<ParticleSelector> selector_all(new ParticleSelectorTag(m_sysdef, 0, m_pdata->getN()-1));\r\n    boost::shared_ptr<ParticleGroup> group_all(new ParticleGroup(m_sysdef, selector_all));\r\n    boost::shared_ptr<TwoStepNVEGPU> integrator(new TwoStepNVEGPU(m_sysdef, group_all));\r\n    addIntegrationMethod(integrator);\r\n    setDeltaT(m_deltaT);\r\n    }\r\n\r\nvoid FIREEnergyMinimizerGPU::reset()\r\n    {\r\n    m_converged = false;\r\n    m_n_since_negative = 0;\r\n    m_alpha = m_alpha_start;\r\n    m_was_reset = true;\r\n    vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadWriteGPU();\r\n    exec_conf.gpu[0]->call(bind(gpu_fire_zero_v, d_pdata[0]));\r\n    m_pdata->release();\r\n    setDeltaT(m_deltaT_set);\r\n    }\r\n\r\n\/*! \\param timesteps is the iteration number\r\n*\/\r\nvoid FIREEnergyMinimizerGPU::update(unsigned int timesteps)\r\n    {\r\n        \r\n    if (m_converged)\r\n        return;\r\n        \r\n    IntegratorTwoStep::update(timesteps);\r\n        \r\n    Scalar P(0.0);\r\n    Scalar vnorm(0.0);\r\n    Scalar fnorm(0.0);\r\n    Scalar energy(0.0);\r\n\r\n    \/\/ compute the total energy on the GPU\r\n    \/\/ CPU version is Scalar energy = computePotentialEnergy(timesteps)\/Scalar(n);\r\n    {\r\n    if (m_prof)\r\n        m_prof->push(exec_conf, \"FIRE compute total energy\");\r\n    \r\n    vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadOnlyGPU();\r\n    ArrayHandle<Scalar4> d_net_force(m_pdata->getNetForce(), access_location::device, access_mode::read);\r\n    ArrayHandle<float> d_partial_sumE(m_partial_sum1, access_location::device, access_mode::overwrite);\r\n    ArrayHandle<float> d_sumE(m_sum, access_location::device, access_mode::overwrite);\r\n    exec_conf.gpu[0]->call(bind(gpu_fire_compute_sum_pe, d_pdata[0], d_net_force.data, d_sumE.data, d_partial_sumE.data, m_block_size, m_num_blocks));\r\n    }\r\n    {\r\n    ArrayHandle<float> h_sumE(m_sum, access_location::host, access_mode::read);\r\n    energy = h_sumE.data[0]\/Scalar(m_nparticles);    \r\n    \r\n    m_pdata->release();\r\n\r\n    if (m_prof)\r\n        m_prof->pop(exec_conf);\r\n\r\n    }\r\n\r\n    if (m_was_reset)\r\n        {\r\n        m_was_reset = false;\r\n        m_old_energy = energy + Scalar(100000)*m_etol;\r\n        }\r\n    \r\n    \/\/sum P, vnorm, fnorm\r\n    {\r\n    if (m_prof)\r\n        m_prof->push(exec_conf, \"FIRE P, vnorm, fnorm\");\r\n    \r\n    vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadOnlyGPU();\r\n    ArrayHandle<float> d_partial_sum_P(m_partial_sum1, access_location::device, access_mode::overwrite);\r\n    ArrayHandle<float> d_partial_sum_vsq(m_partial_sum2, access_location::device, access_mode::overwrite);\r\n    ArrayHandle<float> d_partial_sum_fsq(m_partial_sum3, access_location::device, access_mode::overwrite);\r\n    ArrayHandle<float> d_sum(m_sum3, access_location::device, access_mode::overwrite);\r\n    exec_conf.gpu[0]->call(bind(gpu_fire_compute_sum_all, d_pdata[0], d_sum.data, d_partial_sum_P.data, d_partial_sum_vsq.data, d_partial_sum_fsq.data, m_block_size, m_num_blocks));\r\n    }\r\n    {\r\n    ArrayHandle<float> h_sum(m_sum3, access_location::host, access_mode::read);\r\n    P = h_sum.data[0];\r\n    vnorm = sqrt(h_sum.data[1]);\r\n    fnorm = sqrt(h_sum.data[2]);\r\n    \r\n    m_pdata->release();\r\n\r\n    if (m_prof)\r\n        m_prof->pop(exec_conf);            \r\n    }\r\n    \r\n    if (fnorm\/sqrt(m_sysdef->getNDimensions()*m_nparticles) < m_ftol || fabs(energy-m_old_energy) < m_etol)\r\n        {\r\n        m_converged = true;\r\n        return;\r\n        }\r\n\r\n    \/\/update velocities\r\n    {\r\n    if (m_prof)\r\n        m_prof->push(exec_conf, \"FIRE update velocities\");\r\n\r\n    Scalar invfnorm = 1.0\/fnorm;        \r\n    vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadWriteGPU();\r\n    exec_conf.gpu[0]->call(bind(gpu_fire_update_v, d_pdata[0], m_alpha, vnorm, invfnorm));\r\n    m_pdata->release();\r\n\r\n    if (m_prof)\r\n        m_prof->pop(exec_conf);                \r\n    }\r\n        \r\n    if (P > Scalar(0.0))\r\n        {\r\n        m_n_since_negative++;\r\n        if (m_n_since_negative > m_nmin)\r\n            {\r\n            IntegratorTwoStep::setDeltaT(std::min(m_deltaT*m_finc, m_deltaT_max));\r\n            m_alpha *= m_falpha;\r\n            }\r\n        }\r\n    else if (P <= Scalar(0.0))\r\n        {\r\n        IntegratorTwoStep::setDeltaT(m_deltaT*m_fdec);\r\n        m_alpha = m_alpha_start;\r\n        m_n_since_negative = 0;\r\n        if (m_prof)\r\n            m_prof->push(exec_conf, \"FIRE zero velocities\");\r\n        vector<gpu_pdata_arrays>& d_pdata = m_pdata->acquireReadWriteGPU();\r\n        exec_conf.gpu[0]->call(bind(gpu_fire_zero_v, d_pdata[0]));\r\n        m_pdata->release();\r\n        if (m_prof)\r\n            m_prof->pop(exec_conf);        \r\n        }\r\n    m_old_energy = energy;\r\n    }\r\n\r\n\r\nvoid export_FIREEnergyMinimizerGPU()\r\n    {\r\n    class_<FIREEnergyMinimizerGPU, boost::shared_ptr<FIREEnergyMinimizerGPU>,  bases<FIREEnergyMinimizer>, boost::noncopyable>\r\n        (\"FIREEnergyMinimizerGPU\", init< boost::shared_ptr<SystemDefinition>, boost::shared_ptr<ParticleGroup>, Scalar >())\r\n        ;\r\n    }\r\n\r\n#ifdef WIN32\r\n#pragma warning( pop )\r\n#endif\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *\/\n\n\/*\n *  Main authors:\n *     Guido Tack <guido.tack@monash.edu>\n *\/\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 __MINIZINC_GC_HH__\n#define __MINIZINC_GC_HH__\n\n#include <cstdlib>\n#include <cassert>\n#include <new>\n\nnamespace MiniZinc {\n  \n  \/**\n   * \\brief Base class for abstract syntax tree nodes\n   *\/\n  class ASTNode {\n    friend class GC;\n  protected:\n    \/\/\/ Mark for garbage collection\n    unsigned int _gc_mark : 1;\n    \/\/\/ Id of the node\n    unsigned int _id : 7;\n    \/\/\/ Secondary id\n    unsigned int _sec_id : 7;\n    \/\/\/ Flag\n    unsigned int _flag_1 : 1;\n    \/\/\/ Flag\n    unsigned int _flag_2 : 1;\n    \n    enum BaseNodes { NID_FL, NID_CHUNK, NID_VEC, NID_END = NID_VEC };\n\n    \/\/\/ Constructor\n    ASTNode(unsigned int id) : _gc_mark(0), _id(id) {}\n\n    \/\/\/ Allocate node\n    void* operator new(size_t size) throw (std::bad_alloc);\n\n    \/\/\/ Placement-new\n    void* operator new(size_t, void* n) throw() {\n      return n;\n    }\n\n    \/\/\/ Delete node (no-op)\n    void operator delete(void*, size_t) throw() { }\n    \/\/\/ Delete node (no-op)\n    void operator delete(void*, void*) throw() { }\n\n    \/\/\/ Delete node (no-op)\n    void operator delete(void*) throw() {}\n  };\n    \n  \/**\n   * \\brief Base class for unstructured garbage collected data\n   *\/\n  class ASTChunk : public ASTNode {\n    friend class GC;\n  protected:\n    ASTChunk* _next;\n    size_t _size;\n    char _data[4];\n    ASTChunk(size_t size);\n    size_t memsize(void) const {\n      size_t s = sizeof(ASTChunk)+(_size<=4?0:_size-4)*sizeof(char);\n      s += ((8 - (s & 7)) & 7);\n      return s;\n    }\n    static void* alloc(size_t size);\n  };\n\n\n  \/**\n   * \\brief Base class for structured garbage collected data\n   *\/\n  class ASTVec : public ASTNode {\n    friend class GC;\n  protected:\n    ASTVec* _next;\n    size_t _size;\n    void* _data[2];\n    ASTVec(size_t size);\n    size_t memsize(void) const {\n      size_t s = sizeof(ASTVec)+(_size<=2?0:_size-2)*sizeof(void*);\n      s += ((8 - (s & 7)) & 7);\n      return s;\n    }\n    static void* alloc(size_t size);\n  };\n\n  class Model;\n  class Expression;\n\n  class ASTRootSetIter {\n  public:\n    virtual Expression** begin(void) = 0;\n    virtual Expression** end(void) = 0;\n    virtual ~ASTRootSetIter(void) {}\n  };\n  class ASTRootSet {\n  public:\n    virtual ASTRootSetIter* rootSet(void) = 0;\n  };\n\n  \/\/\/ Garbage collector\n  class GC {\n    friend class ASTNode;\n    friend class ASTVec;\n    friend class ASTChunk;\n  private:\n    class Heap;\n    \/\/\/ The memory controlled by the collector\n    Heap* _heap;\n    \/\/\/ Count how many locks are currently active\n    unsigned int _lock_count;\n    \/\/\/ Return thread-local GC object\n    static GC*& gc(void);\n    \/\/\/ Constructor\n    GC(void);\n\n    \/\/\/ Allocate garbage collected memory\n    void* alloc(size_t size);\n\n  public:\n    \/**\n     * \\brief Initialize thread-local GC object\n     *\n     * Must be called at least once per thread\n     *\/\n    static void init(void);\n    \/\/\/ Acquire garbage collector lock for this thread\n    static void lock(void);\n    \/\/\/ Release garbage collector lock for this thread\n    static void unlock(void);\n    \/\/\/ Test if garbage collector is locked\n    static bool locked(void);\n    \/\/\/ Add model \\a m to root set\n    static void add(Model* m);\n    \/\/\/ Remove model \\a m from root set\n    static void remove(Model* m);\n    \n    \/\/\/ Put a mark on the trail\n    static void mark(void);\n    \/\/\/ Add a trail entry\n    static void trail(void**,void*);\n    \/\/\/ Untrail to previous mark\n    static void untrail(void);\n    \n    \/\/\/ Add external root set\n    static void addRootSet(ASTRootSet* rs);\n    \/\/\/ Remove external root set\n    static void removeRootSet(ASTRootSet* rs);\n  };\n\n  \/\/\/ Automatic garbage collection lock\n  class GCLock {\n  public:\n    \/\/\/ Acquire lock\n    GCLock(void);\n    \/\/\/ Release lock upon destruction\n    ~GCLock(void);\n  };\n\n}\n\n#endif\n<commit_msg>Remove unused fields<commit_after>\/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *\/\n\n\/*\n *  Main authors:\n *     Guido Tack <guido.tack@monash.edu>\n *\/\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 __MINIZINC_GC_HH__\n#define __MINIZINC_GC_HH__\n\n#include <cstdlib>\n#include <cassert>\n#include <new>\n\nnamespace MiniZinc {\n  \n  \/**\n   * \\brief Base class for abstract syntax tree nodes\n   *\/\n  class ASTNode {\n    friend class GC;\n  protected:\n    \/\/\/ Mark for garbage collection\n    unsigned int _gc_mark : 1;\n    \/\/\/ Id of the node\n    unsigned int _id : 7;\n    \/\/\/ Secondary id\n    unsigned int _sec_id : 7;\n    \/\/\/ Flag\n    unsigned int _flag_1 : 1;\n    \/\/\/ Flag\n    unsigned int _flag_2 : 1;\n    \n    enum BaseNodes { NID_FL, NID_CHUNK, NID_VEC, NID_END = NID_VEC };\n\n    \/\/\/ Constructor\n    ASTNode(unsigned int id) : _gc_mark(0), _id(id) {}\n\n    \/\/\/ Allocate node\n    void* operator new(size_t size) throw (std::bad_alloc);\n\n    \/\/\/ Placement-new\n    void* operator new(size_t, void* n) throw() {\n      return n;\n    }\n\n    \/\/\/ Delete node (no-op)\n    void operator delete(void*, size_t) throw() { }\n    \/\/\/ Delete node (no-op)\n    void operator delete(void*, void*) throw() { }\n\n    \/\/\/ Delete node (no-op)\n    void operator delete(void*) throw() {}\n  };\n    \n  \/**\n   * \\brief Base class for unstructured garbage collected data\n   *\/\n  class ASTChunk : public ASTNode {\n    friend class GC;\n  protected:\n    size_t _size;\n    char _data[4];\n    ASTChunk(size_t size);\n    size_t memsize(void) const {\n      size_t s = sizeof(ASTChunk)+(_size<=4?0:_size-4)*sizeof(char);\n      s += ((8 - (s & 7)) & 7);\n      return s;\n    }\n    static void* alloc(size_t size);\n  };\n\n\n  \/**\n   * \\brief Base class for structured garbage collected data\n   *\/\n  class ASTVec : public ASTNode {\n    friend class GC;\n  protected:\n    size_t _size;\n    void* _data[2];\n    ASTVec(size_t size);\n    size_t memsize(void) const {\n      size_t s = sizeof(ASTVec)+(_size<=2?0:_size-2)*sizeof(void*);\n      s += ((8 - (s & 7)) & 7);\n      return s;\n    }\n    static void* alloc(size_t size);\n  };\n\n  class Model;\n  class Expression;\n\n  class ASTRootSetIter {\n  public:\n    virtual Expression** begin(void) = 0;\n    virtual Expression** end(void) = 0;\n    virtual ~ASTRootSetIter(void) {}\n  };\n  class ASTRootSet {\n  public:\n    virtual ASTRootSetIter* rootSet(void) = 0;\n  };\n\n  \/\/\/ Garbage collector\n  class GC {\n    friend class ASTNode;\n    friend class ASTVec;\n    friend class ASTChunk;\n  private:\n    class Heap;\n    \/\/\/ The memory controlled by the collector\n    Heap* _heap;\n    \/\/\/ Count how many locks are currently active\n    unsigned int _lock_count;\n    \/\/\/ Return thread-local GC object\n    static GC*& gc(void);\n    \/\/\/ Constructor\n    GC(void);\n\n    \/\/\/ Allocate garbage collected memory\n    void* alloc(size_t size);\n\n  public:\n    \/**\n     * \\brief Initialize thread-local GC object\n     *\n     * Must be called at least once per thread\n     *\/\n    static void init(void);\n    \/\/\/ Acquire garbage collector lock for this thread\n    static void lock(void);\n    \/\/\/ Release garbage collector lock for this thread\n    static void unlock(void);\n    \/\/\/ Test if garbage collector is locked\n    static bool locked(void);\n    \/\/\/ Add model \\a m to root set\n    static void add(Model* m);\n    \/\/\/ Remove model \\a m from root set\n    static void remove(Model* m);\n    \n    \/\/\/ Put a mark on the trail\n    static void mark(void);\n    \/\/\/ Add a trail entry\n    static void trail(void**,void*);\n    \/\/\/ Untrail to previous mark\n    static void untrail(void);\n    \n    \/\/\/ Add external root set\n    static void addRootSet(ASTRootSet* rs);\n    \/\/\/ Remove external root set\n    static void removeRootSet(ASTRootSet* rs);\n  };\n\n  \/\/\/ Automatic garbage collection lock\n  class GCLock {\n  public:\n    \/\/\/ Acquire lock\n    GCLock(void);\n    \/\/\/ Release lock upon destruction\n    ~GCLock(void);\n  };\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file   primesieve.hpp\n\/\/\/ @brief  primesieve C++ API. primesieve is a library for fast prime\n\/\/\/         number generation. In case an error occurs the functions\n\/\/\/         declared in this header will throw a\n\/\/\/         primesieve::primesieve_error exception (derived form\n\/\/\/         std::runtime_error).\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#ifndef PRIMESIEVE_HPP\n#define PRIMESIEVE_HPP\n\n#define PRIMESIEVE_VERSION \"5.5.0\"\n#define PRIMESIEVE_VERSION_MAJOR 5\n#define PRIMESIEVE_VERSION_MINOR 5\n#define PRIMESIEVE_VERSION_PATCH 0\n\n#include \"primesieve\/PrimeSieve.hpp\"\n#include \"primesieve\/ParallelPrimeSieve.hpp\"\n#include \"primesieve\/Callback.hpp\"\n#include \"primesieve\/cancel_callback.hpp\"\n#include \"primesieve\/iterator.hpp\"\n#include \"primesieve\/PushBackPrimes.hpp\"\n#include \"primesieve\/primesieve_error.hpp\"\n\n#include <stdint.h>\n#include <vector>\n#include <string>\n\n\/\/\/ All of primesieve's C++ functions and classes are declared\n\/\/\/ inside this namespace.\n\/\/\/\nnamespace primesieve\n{\n  enum {\n    \/\/\/ Use all CPU cores for prime sieving.\n    MAX_THREADS = -1\n  };\n\n  \/\/\/ Store the primes <= stop in the primes vector.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  template <typename T>\n  inline void generate_primes(uint64_t stop, std::vector<T>* primes)\n  {\n    if (primes)\n    {\n      PushBackPrimes<T> pb(*primes);\n      pb.pushBackPrimes(0, stop);\n    }\n  }\n\n  \/\/\/ Store the primes within the interval [start, stop]\n  \/\/\/ in the primes vector.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  template <typename T>\n  inline void generate_primes(uint64_t start, uint64_t stop, std::vector<T>* primes)\n  {\n    if (primes)\n    {\n      PushBackPrimes<T> pb(*primes);\n      pb.pushBackPrimes(start, stop);\n    }\n  }\n\n  \/\/\/ Store the first n primes in the primes vector.\n  template <typename T>\n  inline void generate_n_primes(uint64_t n, std::vector<T>* primes)\n  {\n    if (primes)\n    {\n      PushBack_N_Primes<T> pb(*primes);\n      pb.pushBack_N_Primes(n, 0);\n    }\n  }\n\n  \/\/\/ Store the first n primes >= start in the primes vector.\n  \/\/\/ @pre start <= 2^64 - 2^32 * 10.\n  \/\/\/\n  template <typename T>\n  inline void generate_n_primes(uint64_t n, uint64_t start, std::vector<T>* primes)\n  {\n    if (primes)\n    {\n      PushBack_N_Primes<T> pb(*primes);\n      pb.pushBack_N_Primes(n, start);\n    }\n  }\n\n  \/\/\/ Find the nth prime.\n  \/\/\/ @param n  if n = 0 finds the 1st prime >= start, <br\/>\n  \/\/\/           if n > 0 finds the nth prime > start, <br\/>\n  \/\/\/           if n < 0 finds the nth prime < start (backwards).\n  \/\/\/ @pre   start <= 2^64 - 2^32 * 11.\n  \/\/\/\n  uint64_t nth_prime(int64_t n, uint64_t start = 0);\n\n  \/\/\/ Find the nth prime in parallel.\n  \/\/\/ By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @param n  if n = 0 finds the 1st prime >= start, <br\/>\n  \/\/\/           if n > 0 finds the nth prime > start, <br\/>\n  \/\/\/           if n < 0 finds the nth prime < start (backwards).\n  \/\/\/ @pre   start <= 2^64 - 2^32 * 11.\n  \/\/\/\n  uint64_t parallel_nth_prime(int64_t n, uint64_t start = 0);\n\n  \/\/\/ Count the primes within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_primes(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the twin primes within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_twins(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime triplets within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_triplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime quadruplets within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_quadruplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime quintuplets within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_quintuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime sextuplets within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_sextuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the primes within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_primes(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the twin primes within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_twins(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime triplets within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_triplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime quadruplets within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_quadruplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime quintuplets within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_quintuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime sextuplets within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_sextuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the primes within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_primes(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the twin primes within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_twins(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the prime triplets within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_triplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the prime quadruplets within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_quadruplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the prime quintuplets within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_quintuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the prime sextuplets within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_sextuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ @param callback  A callback function.\n  \/\/\/ @pre   stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void callback_primes(uint64_t start, uint64_t stop, void (*callback)(uint64_t prime));\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ @param callback  An object derived from primesieve::Callback<uint64_t>.\n  \/\/\/ @pre   stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void callback_primes(uint64_t start, uint64_t stop, primesieve::Callback<uint64_t>* callback);\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ This function is synchronized, only one thread at a time calls\n  \/\/\/ back primes. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @warning         Primes are not called back in arithmetic order.\n  \/\/\/ @param callback  A callback function.\n  \/\/\/ @pre   stop      <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void parallel_callback_primes(uint64_t start, uint64_t stop, void (*callback)(uint64_t prime));\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ This function is synchronized, only one thread at a time calls\n  \/\/\/ back primes. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @warning         Primes are not called back in arithmetic order.\n  \/\/\/ @param callback  An object derived from primesieve::Callback<uint64_t>.\n  \/\/\/ @pre   stop      <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void parallel_callback_primes(uint64_t start, uint64_t stop, primesieve::Callback<uint64_t>* callback);\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ This function is not synchronized, multiple threads call back\n  \/\/\/ primes in parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @warning         Primes are not called back in arithmetic order.\n  \/\/\/ @param callback  A callback function.\n  \/\/\/ @pre   stop      <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void parallel_callback_primes(uint64_t start, uint64_t stop, void (*callback)(uint64_t prime, int thread_id));\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ This function is not synchronized, multiple threads call back\n  \/\/\/ primes in parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @warning         Primes are not called back in arithmetic order.\n  \/\/\/ @param callback  An object derived from primesieve::Callback<uint64_t, int>.\n  \/\/\/ @pre   stop      <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void parallel_callback_primes(uint64_t start, uint64_t stop, primesieve::Callback<uint64_t, int>* callback);\n\n  \/\/\/ Get the current set sieve size in kilobytes.\n  int get_sieve_size();\n\n  \/\/\/ Get the current set number of threads.\n  \/\/\/ @note By default MAX_THREADS (-1) is returned.\n  \/\/\/\n  int get_num_threads();\n\n  \/\/\/ Returns the largest valid stop number for primesieve.\n  \/\/\/ @return (2^64-1) - (2^32-1) * 10.\n  \/\/\/\n  uint64_t get_max_stop();\n\n  \/\/\/ Set the sieve size in kilobytes.\n  \/\/\/ The best sieving performance is achieved with a sieve size of\n  \/\/\/ your CPU's L1 data cache size (per core). For sieving >= 10^17 a\n  \/\/\/ sieve size of your CPU's L2 cache size sometimes performs\n  \/\/\/ better.\n  \/\/\/ @param sieve_size Sieve size in kilobytes.\n  \/\/\/ @pre   sieve_size >= 1 && sieve_size <= 2048.\n  \/\/\/\n  void set_sieve_size(int sieve_size);\n\n  \/\/\/ Set the number of threads for use in subsequent\n  \/\/\/ primesieve::parallel_* function calls. Note that this only\n  \/\/\/ changes the number of threads for the current process.\n  \/\/\/ @param num_threads  Number of threads for sieving\n  \/\/\/                     or MAX_THREADS to use all CPU cores.\n  \/\/\/\n  void set_num_threads(int num_threads);\n\n  \/\/\/ Run extensive correctness tests.\n  \/\/\/ The tests last about one minute on a quad core CPU from\n  \/\/\/ 2013 and use up to 1 gigabyte of memory.\n  \/\/\/ @return true if success else false.\n  \/\/\/\n  bool primesieve_test();\n\n  \/\/\/ Get the primesieve version number, in the form “i.j.k”.\n  std::string primesieve_version();\n}\n\n#endif\n<commit_msg>Remove COPYING comment<commit_after>\/\/\/\n\/\/\/ @file   primesieve.hpp\n\/\/\/ @brief  primesieve C++ API. primesieve is a library for fast prime\n\/\/\/         number generation, in case an error occurs a\n\/\/\/         primesieve::primesieve_error exception (derived form\n\/\/\/         std::runtime_error) will be thrown.\n\/\/\/\n\/\/\/ Copyright (C) 2015 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the BSD License.\n\/\/\/\n\n#ifndef PRIMESIEVE_HPP\n#define PRIMESIEVE_HPP\n\n#define PRIMESIEVE_VERSION \"5.5.0\"\n#define PRIMESIEVE_VERSION_MAJOR 5\n#define PRIMESIEVE_VERSION_MINOR 5\n#define PRIMESIEVE_VERSION_PATCH 0\n\n#include \"primesieve\/PrimeSieve.hpp\"\n#include \"primesieve\/ParallelPrimeSieve.hpp\"\n#include \"primesieve\/Callback.hpp\"\n#include \"primesieve\/cancel_callback.hpp\"\n#include \"primesieve\/iterator.hpp\"\n#include \"primesieve\/PushBackPrimes.hpp\"\n#include \"primesieve\/primesieve_error.hpp\"\n\n#include <stdint.h>\n#include <vector>\n#include <string>\n\n\/\/\/ All of primesieve's C++ functions and classes are declared\n\/\/\/ inside this namespace.\n\/\/\/\nnamespace primesieve\n{\n  enum {\n    \/\/\/ Use all CPU cores for prime sieving.\n    MAX_THREADS = -1\n  };\n\n  \/\/\/ Store the primes <= stop in the primes vector.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  template <typename T>\n  inline void generate_primes(uint64_t stop, std::vector<T>* primes)\n  {\n    if (primes)\n    {\n      PushBackPrimes<T> pb(*primes);\n      pb.pushBackPrimes(0, stop);\n    }\n  }\n\n  \/\/\/ Store the primes within the interval [start, stop]\n  \/\/\/ in the primes vector.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  template <typename T>\n  inline void generate_primes(uint64_t start, uint64_t stop, std::vector<T>* primes)\n  {\n    if (primes)\n    {\n      PushBackPrimes<T> pb(*primes);\n      pb.pushBackPrimes(start, stop);\n    }\n  }\n\n  \/\/\/ Store the first n primes in the primes vector.\n  template <typename T>\n  inline void generate_n_primes(uint64_t n, std::vector<T>* primes)\n  {\n    if (primes)\n    {\n      PushBack_N_Primes<T> pb(*primes);\n      pb.pushBack_N_Primes(n, 0);\n    }\n  }\n\n  \/\/\/ Store the first n primes >= start in the primes vector.\n  \/\/\/ @pre start <= 2^64 - 2^32 * 10.\n  \/\/\/\n  template <typename T>\n  inline void generate_n_primes(uint64_t n, uint64_t start, std::vector<T>* primes)\n  {\n    if (primes)\n    {\n      PushBack_N_Primes<T> pb(*primes);\n      pb.pushBack_N_Primes(n, start);\n    }\n  }\n\n  \/\/\/ Find the nth prime.\n  \/\/\/ @param n  if n = 0 finds the 1st prime >= start, <br\/>\n  \/\/\/           if n > 0 finds the nth prime > start, <br\/>\n  \/\/\/           if n < 0 finds the nth prime < start (backwards).\n  \/\/\/ @pre   start <= 2^64 - 2^32 * 11.\n  \/\/\/\n  uint64_t nth_prime(int64_t n, uint64_t start = 0);\n\n  \/\/\/ Find the nth prime in parallel.\n  \/\/\/ By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @param n  if n = 0 finds the 1st prime >= start, <br\/>\n  \/\/\/           if n > 0 finds the nth prime > start, <br\/>\n  \/\/\/           if n < 0 finds the nth prime < start (backwards).\n  \/\/\/ @pre   start <= 2^64 - 2^32 * 11.\n  \/\/\/\n  uint64_t parallel_nth_prime(int64_t n, uint64_t start = 0);\n\n  \/\/\/ Count the primes within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_primes(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the twin primes within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_twins(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime triplets within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_triplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime quadruplets within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_quadruplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime quintuplets within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_quintuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime sextuplets within the interval [start, stop].\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t count_sextuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the primes within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_primes(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the twin primes within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_twins(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime triplets within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_triplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime quadruplets within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_quadruplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime quintuplets within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_quintuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Count the prime sextuplets within the interval [start, stop] in\n  \/\/\/ parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  uint64_t parallel_count_sextuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the primes within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_primes(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the twin primes within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_twins(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the prime triplets within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_triplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the prime quadruplets within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_quadruplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the prime quintuplets within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_quintuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Print the prime sextuplets within the interval [start, stop]\n  \/\/\/ to the standard output.\n  \/\/\/ @pre stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void print_sextuplets(uint64_t start, uint64_t stop);\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ @param callback  A callback function.\n  \/\/\/ @pre   stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void callback_primes(uint64_t start, uint64_t stop, void (*callback)(uint64_t prime));\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ @param callback  An object derived from primesieve::Callback<uint64_t>.\n  \/\/\/ @pre   stop <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void callback_primes(uint64_t start, uint64_t stop, primesieve::Callback<uint64_t>* callback);\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ This function is synchronized, only one thread at a time calls\n  \/\/\/ back primes. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @warning         Primes are not called back in arithmetic order.\n  \/\/\/ @param callback  A callback function.\n  \/\/\/ @pre   stop      <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void parallel_callback_primes(uint64_t start, uint64_t stop, void (*callback)(uint64_t prime));\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ This function is synchronized, only one thread at a time calls\n  \/\/\/ back primes. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @warning         Primes are not called back in arithmetic order.\n  \/\/\/ @param callback  An object derived from primesieve::Callback<uint64_t>.\n  \/\/\/ @pre   stop      <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void parallel_callback_primes(uint64_t start, uint64_t stop, primesieve::Callback<uint64_t>* callback);\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ This function is not synchronized, multiple threads call back\n  \/\/\/ primes in parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @warning         Primes are not called back in arithmetic order.\n  \/\/\/ @param callback  A callback function.\n  \/\/\/ @pre   stop      <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void parallel_callback_primes(uint64_t start, uint64_t stop, void (*callback)(uint64_t prime, int thread_id));\n\n  \/\/\/ Call back the primes within the interval [start, stop].\n  \/\/\/ This function is not synchronized, multiple threads call back\n  \/\/\/ primes in parallel. By default all CPU cores are used, use\n  \/\/\/ primesieve::set_num_threads(int) to change the number of\n  \/\/\/ threads.\n  \/\/\/ @warning         Primes are not called back in arithmetic order.\n  \/\/\/ @param callback  An object derived from primesieve::Callback<uint64_t, int>.\n  \/\/\/ @pre   stop      <= 2^64 - 2^32 * 10.\n  \/\/\/\n  void parallel_callback_primes(uint64_t start, uint64_t stop, primesieve::Callback<uint64_t, int>* callback);\n\n  \/\/\/ Get the current set sieve size in kilobytes.\n  int get_sieve_size();\n\n  \/\/\/ Get the current set number of threads.\n  \/\/\/ @note By default MAX_THREADS (-1) is returned.\n  \/\/\/\n  int get_num_threads();\n\n  \/\/\/ Returns the largest valid stop number for primesieve.\n  \/\/\/ @return (2^64-1) - (2^32-1) * 10.\n  \/\/\/\n  uint64_t get_max_stop();\n\n  \/\/\/ Set the sieve size in kilobytes.\n  \/\/\/ The best sieving performance is achieved with a sieve size of\n  \/\/\/ your CPU's L1 data cache size (per core). For sieving >= 10^17 a\n  \/\/\/ sieve size of your CPU's L2 cache size sometimes performs\n  \/\/\/ better.\n  \/\/\/ @param sieve_size Sieve size in kilobytes.\n  \/\/\/ @pre   sieve_size >= 1 && sieve_size <= 2048.\n  \/\/\/\n  void set_sieve_size(int sieve_size);\n\n  \/\/\/ Set the number of threads for use in subsequent\n  \/\/\/ primesieve::parallel_* function calls. Note that this only\n  \/\/\/ changes the number of threads for the current process.\n  \/\/\/ @param num_threads  Number of threads for sieving\n  \/\/\/                     or MAX_THREADS to use all CPU cores.\n  \/\/\/\n  void set_num_threads(int num_threads);\n\n  \/\/\/ Run extensive correctness tests.\n  \/\/\/ The tests last about one minute on a quad core CPU from\n  \/\/\/ 2013 and use up to 1 gigabyte of memory.\n  \/\/\/ @return true if success else false.\n  \/\/\/\n  bool primesieve_test();\n\n  \/\/\/ Get the primesieve version number, in the form “i.j.k”.\n  std::string primesieve_version();\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/  http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 __STOUT_OS_CONSTANTS_HPP__\n#define __STOUT_OS_CONSTANTS_HPP__\n\n#include <string>\n\nnamespace os {\n\nconstexpr char WINDOWS_PATH_SEPARATOR = '\\\\';\nconstexpr char POSIX_PATH_SEPARATOR = '\/';\n\n#ifndef __WINDOWS__\nconstexpr char PATH_SEPARATOR = POSIX_PATH_SEPARATOR;\n#else\nconstexpr char PATH_SEPARATOR = WINDOWS_PATH_SEPARATOR;\n#endif \/\/ __WINDOWS__\n\n#ifndef __WINDOWS__\nconstexpr char DEV_NULL[] = \"\/dev\/null\";\n#else\nconstexpr char DEV_NULL[] = \"NUL\";\n#endif \/\/ __WINDOWS__\n\n} \/\/ namespace os {\n\n#endif \/\/ __STOUT_OS_CONSTANTS_HPP__\n<commit_msg>Windows: Added `os::LONGPATH_PREFIX` constant.<commit_after>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/  http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 __STOUT_OS_CONSTANTS_HPP__\n#define __STOUT_OS_CONSTANTS_HPP__\n\n#include <string>\n\nnamespace os {\n\nconstexpr char WINDOWS_PATH_SEPARATOR = '\\\\';\nconstexpr char POSIX_PATH_SEPARATOR = '\/';\n\n#ifndef __WINDOWS__\nconstexpr char PATH_SEPARATOR = POSIX_PATH_SEPARATOR;\n#else\nconstexpr char PATH_SEPARATOR = WINDOWS_PATH_SEPARATOR;\n#endif \/\/ __WINDOWS__\n\n#ifndef __WINDOWS__\nconstexpr char DEV_NULL[] = \"\/dev\/null\";\n#else\nconstexpr char DEV_NULL[] = \"NUL\";\n#endif \/\/ __WINDOWS__\n\n#ifdef __WINDOWS__\n\/\/ This prefix is prepended to absolute paths on Windows to indicate the path\n\/\/ may be greater than 255 characters.\n\/\/\n\/\/ NOTE: We do not use a R\"raw string\" here because syntax highlighters do not\n\/\/ handle mismatched backslashes well.\nconstexpr char LONGPATH_PREFIX[] = \"\\\\\\\\?\\\\\";\n#endif \/\/ __WINDOWS__\n\n} \/\/ namespace os {\n\n#endif \/\/ __STOUT_OS_CONSTANTS_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 \"sync\/util\/immutable.h\"\n\n#include <algorithm>\n#include <cstddef>\n#include <deque>\n#include <list>\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"base\/basictypes.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace browser_sync {\n\n\/\/ Helper class that keeps track of the token passed in at\n\/\/ construction and how many times that token is copied.\nclass TokenCore : public base::RefCounted<TokenCore> {\n public:\n  explicit TokenCore(const char* token) : token_(token), copy_count_(0) {}\n\n  const char* GetToken() const { return token_; }\n\n  void RecordCopy() { ++copy_count_; }\n\n  int GetCopyCount() const { return copy_count_; }\n\n private:\n  friend class base::RefCounted<TokenCore>;\n\n  ~TokenCore() {}\n\n  const char* const token_;\n  int copy_count_;\n};\n\nenum SwapBehavior {\n  USE_DEFAULT_SWAP,\n  USE_FAST_SWAP_VIA_ADL,\n  USE_FAST_SWAP_VIA_SPECIALIZATION\n};\n\nconst char kEmptyToken[] = \"<empty token>\";\n\n\/\/ Base class for various token classes, differing in swap behavior.\ntemplate <SwapBehavior>\nclass TokenBase {\n public:\n  TokenBase() : core_(new TokenCore(kEmptyToken)) {}\n\n  explicit TokenBase(const char* token) : core_(new TokenCore(token)) {}\n\n  TokenBase(const TokenBase& other) : core_(other.core_) {\n    core_->RecordCopy();\n  }\n\n  TokenBase& operator=(const TokenBase& other) {\n    core_ = other.core_;\n    core_->RecordCopy();\n    return *this;\n  }\n\n  const char* GetToken() const {\n    return core_->GetToken();\n  }\n\n  int GetCopyCount() const {\n    return core_->GetCopyCount();\n  }\n\n  \/\/ For associative containers.\n  bool operator<(const TokenBase& other) const {\n    return std::string(GetToken()) < std::string(other.GetToken());\n  }\n\n  \/\/ STL-style swap.\n  void swap(TokenBase& other) {\n    using std::swap;\n    swap(other.core_, core_);\n  }\n\n  \/\/ Google-style swap.\n  void Swap(TokenBase* other) {\n    using std::swap;\n    swap(other->core_, core_);\n  }\n\n private:\n  scoped_refptr<TokenCore> core_;\n};\n\ntypedef TokenBase<USE_DEFAULT_SWAP> Token;\ntypedef TokenBase<USE_FAST_SWAP_VIA_ADL> ADLToken;\ntypedef TokenBase<USE_FAST_SWAP_VIA_SPECIALIZATION> SpecializationToken;\n\nvoid swap(ADLToken& t1, ADLToken& t2) {\n  t1.Swap(&t2);\n}\n\n}  \/\/ namespace browser_sync\n\n\/\/ Allowed by the standard (17.4.3.1\/1).\nnamespace std {\n\ntemplate <>\nvoid swap(browser_sync::SpecializationToken& t1,\n          browser_sync::SpecializationToken& t2) {\n  t1.Swap(&t2);\n}\n\n}  \/\/ namespace\n\nnamespace browser_sync {\nnamespace {\n\nclass ImmutableTest : public ::testing::Test {};\n\nTEST_F(ImmutableTest, Int) {\n  int x = 5;\n  Immutable<int> ix(&x);\n  EXPECT_EQ(5, ix.Get());\n  EXPECT_EQ(0, x);\n}\n\nTEST_F(ImmutableTest, IntCopy) {\n  int x = 5;\n  Immutable<int> ix = Immutable<int>(&x);\n  EXPECT_EQ(5, ix.Get());\n  EXPECT_EQ(0, x);\n}\n\nTEST_F(ImmutableTest, IntAssign) {\n  int x = 5;\n  Immutable<int> ix;\n  EXPECT_EQ(0, ix.Get());\n  ix = Immutable<int>(&x);\n  EXPECT_EQ(5, ix.Get());\n  EXPECT_EQ(0, x);\n}\n\nTEST_F(ImmutableTest, IntMakeImmutable) {\n  int x = 5;\n  Immutable<int> ix = MakeImmutable(&x);\n  EXPECT_EQ(5, ix.Get());\n  EXPECT_EQ(0, x);\n}\n\ntemplate <typename T, typename ImmutableT>\nvoid RunTokenTest(const char* token, bool expect_copies) {\n  SCOPED_TRACE(token);\n  T t(token);\n  EXPECT_EQ(token, t.GetToken());\n  EXPECT_EQ(0, t.GetCopyCount());\n\n  ImmutableT immutable_t(&t);\n  EXPECT_EQ(token, immutable_t.Get().GetToken());\n  EXPECT_EQ(kEmptyToken, t.GetToken());\n  EXPECT_EQ(expect_copies, immutable_t.Get().GetCopyCount() > 0);\n  EXPECT_EQ(expect_copies, t.GetCopyCount() > 0);\n}\n\nTEST_F(ImmutableTest, Token) {\n  RunTokenTest<Token, Immutable<Token> >(\"Token\", true \/* expect_copies *\/);\n}\n\nTEST_F(ImmutableTest, TokenSwapMemFnByRef) {\n  RunTokenTest<Token, Immutable<Token, HasSwapMemFnByRef<Token> > >(\n      \"TokenSwapMemFnByRef\", false \/* expect_copies *\/);\n}\n\nTEST_F(ImmutableTest, TokenSwapMemFnByPtr) {\n  RunTokenTest<Token, Immutable<Token, HasSwapMemFnByPtr<Token> > >(\n      \"TokenSwapMemFnByPtr\", false \/* expect_copies *\/);\n}\n\nTEST_F(ImmutableTest, ADLToken) {\n  RunTokenTest<ADLToken, Immutable<ADLToken> >(\n      \"ADLToken\", false \/* expect_copies *\/);\n}\n\nTEST_F(ImmutableTest, SpecializationToken) {\n  RunTokenTest<SpecializationToken, Immutable<SpecializationToken> >(\n      \"SpecializationToken\", false \/* expect_copies *\/);\n}\n\ntemplate <typename C, typename ImmutableC>\nvoid RunTokenContainerTest(const char* token) {\n  SCOPED_TRACE(token);\n  const Token tokens[] = { Token(), Token(token) };\n  const size_t token_count = arraysize(tokens);\n  C c(tokens, tokens + token_count);\n  const int copy_count = c.begin()->GetCopyCount();\n  EXPECT_GT(copy_count, 0);\n  for (typename C::const_iterator it = c.begin(); it != c.end(); ++it) {\n    EXPECT_EQ(copy_count, it->GetCopyCount());\n  }\n\n  \/\/ Make sure that making the container immutable doesn't incur any\n  \/\/ copies of the tokens.\n  ImmutableC immutable_c(&c);\n  EXPECT_TRUE(c.empty());\n  ASSERT_EQ(token_count, immutable_c.Get().size());\n  int i = 0;\n  for (typename C::const_iterator it = c.begin(); it != c.end(); ++it) {\n    EXPECT_EQ(tokens[i].GetToken(), it->GetToken());\n    EXPECT_EQ(copy_count, it->GetCopyCount());\n    ++i;\n  }\n}\n\nTEST_F(ImmutableTest, Vector) {\n  RunTokenContainerTest<std::vector<Token>, Immutable<std::vector<Token> > >(\n      \"Vector\");\n}\n\nTEST_F(ImmutableTest, VectorSwapMemFnByRef) {\n  RunTokenContainerTest<\n    std::vector<Token>,\n    Immutable<std::vector<Token>, HasSwapMemFnByRef<std::vector<Token> > > >(\n        \"VectorSwapMemFnByRef\");\n}\n\nTEST_F(ImmutableTest, Deque) {\n  RunTokenContainerTest<std::deque<Token>, Immutable<std::deque<Token> > >(\n      \"Deque\");\n}\n\nTEST_F(ImmutableTest, List) {\n  RunTokenContainerTest<std::list<Token>, Immutable<std::list<Token> > >(\n      \"List\");\n}\n\nTEST_F(ImmutableTest, Set) {\n  RunTokenContainerTest<std::set<Token>, Immutable<std::set<Token> > >(\n      \"Set\");\n}\n\n}  \/\/ namespace\n}  \/\/ namespace browser_sync\n<commit_msg>Disable failing test ImmutableTest.Deque on Windows<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 \"sync\/util\/immutable.h\"\n\n#include <algorithm>\n#include <cstddef>\n#include <deque>\n#include <list>\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"base\/basictypes.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace browser_sync {\n\n\/\/ Helper class that keeps track of the token passed in at\n\/\/ construction and how many times that token is copied.\nclass TokenCore : public base::RefCounted<TokenCore> {\n public:\n  explicit TokenCore(const char* token) : token_(token), copy_count_(0) {}\n\n  const char* GetToken() const { return token_; }\n\n  void RecordCopy() { ++copy_count_; }\n\n  int GetCopyCount() const { return copy_count_; }\n\n private:\n  friend class base::RefCounted<TokenCore>;\n\n  ~TokenCore() {}\n\n  const char* const token_;\n  int copy_count_;\n};\n\nenum SwapBehavior {\n  USE_DEFAULT_SWAP,\n  USE_FAST_SWAP_VIA_ADL,\n  USE_FAST_SWAP_VIA_SPECIALIZATION\n};\n\nconst char kEmptyToken[] = \"<empty token>\";\n\n\/\/ Base class for various token classes, differing in swap behavior.\ntemplate <SwapBehavior>\nclass TokenBase {\n public:\n  TokenBase() : core_(new TokenCore(kEmptyToken)) {}\n\n  explicit TokenBase(const char* token) : core_(new TokenCore(token)) {}\n\n  TokenBase(const TokenBase& other) : core_(other.core_) {\n    core_->RecordCopy();\n  }\n\n  TokenBase& operator=(const TokenBase& other) {\n    core_ = other.core_;\n    core_->RecordCopy();\n    return *this;\n  }\n\n  const char* GetToken() const {\n    return core_->GetToken();\n  }\n\n  int GetCopyCount() const {\n    return core_->GetCopyCount();\n  }\n\n  \/\/ For associative containers.\n  bool operator<(const TokenBase& other) const {\n    return std::string(GetToken()) < std::string(other.GetToken());\n  }\n\n  \/\/ STL-style swap.\n  void swap(TokenBase& other) {\n    using std::swap;\n    swap(other.core_, core_);\n  }\n\n  \/\/ Google-style swap.\n  void Swap(TokenBase* other) {\n    using std::swap;\n    swap(other->core_, core_);\n  }\n\n private:\n  scoped_refptr<TokenCore> core_;\n};\n\ntypedef TokenBase<USE_DEFAULT_SWAP> Token;\ntypedef TokenBase<USE_FAST_SWAP_VIA_ADL> ADLToken;\ntypedef TokenBase<USE_FAST_SWAP_VIA_SPECIALIZATION> SpecializationToken;\n\nvoid swap(ADLToken& t1, ADLToken& t2) {\n  t1.Swap(&t2);\n}\n\n}  \/\/ namespace browser_sync\n\n\/\/ Allowed by the standard (17.4.3.1\/1).\nnamespace std {\n\ntemplate <>\nvoid swap(browser_sync::SpecializationToken& t1,\n          browser_sync::SpecializationToken& t2) {\n  t1.Swap(&t2);\n}\n\n}  \/\/ namespace\n\nnamespace browser_sync {\nnamespace {\n\nclass ImmutableTest : public ::testing::Test {};\n\nTEST_F(ImmutableTest, Int) {\n  int x = 5;\n  Immutable<int> ix(&x);\n  EXPECT_EQ(5, ix.Get());\n  EXPECT_EQ(0, x);\n}\n\nTEST_F(ImmutableTest, IntCopy) {\n  int x = 5;\n  Immutable<int> ix = Immutable<int>(&x);\n  EXPECT_EQ(5, ix.Get());\n  EXPECT_EQ(0, x);\n}\n\nTEST_F(ImmutableTest, IntAssign) {\n  int x = 5;\n  Immutable<int> ix;\n  EXPECT_EQ(0, ix.Get());\n  ix = Immutable<int>(&x);\n  EXPECT_EQ(5, ix.Get());\n  EXPECT_EQ(0, x);\n}\n\nTEST_F(ImmutableTest, IntMakeImmutable) {\n  int x = 5;\n  Immutable<int> ix = MakeImmutable(&x);\n  EXPECT_EQ(5, ix.Get());\n  EXPECT_EQ(0, x);\n}\n\ntemplate <typename T, typename ImmutableT>\nvoid RunTokenTest(const char* token, bool expect_copies) {\n  SCOPED_TRACE(token);\n  T t(token);\n  EXPECT_EQ(token, t.GetToken());\n  EXPECT_EQ(0, t.GetCopyCount());\n\n  ImmutableT immutable_t(&t);\n  EXPECT_EQ(token, immutable_t.Get().GetToken());\n  EXPECT_EQ(kEmptyToken, t.GetToken());\n  EXPECT_EQ(expect_copies, immutable_t.Get().GetCopyCount() > 0);\n  EXPECT_EQ(expect_copies, t.GetCopyCount() > 0);\n}\n\nTEST_F(ImmutableTest, Token) {\n  RunTokenTest<Token, Immutable<Token> >(\"Token\", true \/* expect_copies *\/);\n}\n\nTEST_F(ImmutableTest, TokenSwapMemFnByRef) {\n  RunTokenTest<Token, Immutable<Token, HasSwapMemFnByRef<Token> > >(\n      \"TokenSwapMemFnByRef\", false \/* expect_copies *\/);\n}\n\nTEST_F(ImmutableTest, TokenSwapMemFnByPtr) {\n  RunTokenTest<Token, Immutable<Token, HasSwapMemFnByPtr<Token> > >(\n      \"TokenSwapMemFnByPtr\", false \/* expect_copies *\/);\n}\n\nTEST_F(ImmutableTest, ADLToken) {\n  RunTokenTest<ADLToken, Immutable<ADLToken> >(\n      \"ADLToken\", false \/* expect_copies *\/);\n}\n\nTEST_F(ImmutableTest, SpecializationToken) {\n  RunTokenTest<SpecializationToken, Immutable<SpecializationToken> >(\n      \"SpecializationToken\", false \/* expect_copies *\/);\n}\n\ntemplate <typename C, typename ImmutableC>\nvoid RunTokenContainerTest(const char* token) {\n  SCOPED_TRACE(token);\n  const Token tokens[] = { Token(), Token(token) };\n  const size_t token_count = arraysize(tokens);\n  C c(tokens, tokens + token_count);\n  const int copy_count = c.begin()->GetCopyCount();\n  EXPECT_GT(copy_count, 0);\n  for (typename C::const_iterator it = c.begin(); it != c.end(); ++it) {\n    EXPECT_EQ(copy_count, it->GetCopyCount());\n  }\n\n  \/\/ Make sure that making the container immutable doesn't incur any\n  \/\/ copies of the tokens.\n  ImmutableC immutable_c(&c);\n  EXPECT_TRUE(c.empty());\n  ASSERT_EQ(token_count, immutable_c.Get().size());\n  int i = 0;\n  for (typename C::const_iterator it = c.begin(); it != c.end(); ++it) {\n    EXPECT_EQ(tokens[i].GetToken(), it->GetToken());\n    EXPECT_EQ(copy_count, it->GetCopyCount());\n    ++i;\n  }\n}\n\nTEST_F(ImmutableTest, Vector) {\n  RunTokenContainerTest<std::vector<Token>, Immutable<std::vector<Token> > >(\n      \"Vector\");\n}\n\nTEST_F(ImmutableTest, VectorSwapMemFnByRef) {\n  RunTokenContainerTest<\n    std::vector<Token>,\n    Immutable<std::vector<Token>, HasSwapMemFnByRef<std::vector<Token> > > >(\n        \"VectorSwapMemFnByRef\");\n}\n\n\/\/ http:\/\/crbug.com\/129128\n#if defined(OS_WIN)\n#define MAYBE_Deque DISABLED_Deque\n#else\n#define MAYBE_Deque Deque\n#endif\nTEST_F(ImmutableTest, MAYBE_Deque) {\n  RunTokenContainerTest<std::deque<Token>, Immutable<std::deque<Token> > >(\n      \"Deque\");\n}\n\nTEST_F(ImmutableTest, List) {\n  RunTokenContainerTest<std::list<Token>, Immutable<std::list<Token> > >(\n      \"List\");\n}\n\nTEST_F(ImmutableTest, Set) {\n  RunTokenContainerTest<std::set<Token>, Immutable<std::set<Token> > >(\n      \"Set\");\n}\n\n}  \/\/ namespace\n}  \/\/ namespace browser_sync\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009 Chris Pickel <sfiera@gmail.com>\n\/\/\n\/\/ This file is part of libsfz, a free software project.  You can redistribute it and\/or modify it\n\/\/ under the terms of the MIT License.\n\n#ifndef SFZ_FORMAT_HPP_\n#define SFZ_FORMAT_HPP_\n\n#include \"sfz\/PrintItem.hpp\"\n#include \"sfz\/PrintTarget.hpp\"\n\nnamespace sfz {\n\ntemplate <size_t size> class Format;\n\ninline Format<16> format(\n        const char* format_string,\n        const PrintItem& item0 = PrintItem(), const PrintItem& item1 = PrintItem(),\n        const PrintItem& item2 = PrintItem(), const PrintItem& item3 = PrintItem(),\n        const PrintItem& item4 = PrintItem(), const PrintItem& item5 = PrintItem(),\n        const PrintItem& item6 = PrintItem(), const PrintItem& item7 = PrintItem(),\n        const PrintItem& item8 = PrintItem(), const PrintItem& item9 = PrintItem(),\n        const PrintItem& item10 = PrintItem(), const PrintItem& item11 = PrintItem(),\n        const PrintItem& item12 = PrintItem(), const PrintItem& item13 = PrintItem(),\n        const PrintItem& item14 = PrintItem(), const PrintItem& item15 = PrintItem());\n\ntemplate <size_t size>\nstruct Format {\n    const char* format_string;\n    const PrintItem* items[size];\n};\n\nvoid print_format_to(\n        PrintTarget out, const char* format_string, const PrintItem* const* items, size_t size);\n\ntemplate <size_t size>\ninline void print_to(PrintTarget out, const Format<size>& format) {\n    print_format_to(out, format.format_string, format.items, size);\n}\n\nFormat<16> format(\n        const char* format_string,\n        const PrintItem& item0, const PrintItem& item1,\n        const PrintItem& item2, const PrintItem& item3,\n        const PrintItem& item4, const PrintItem& item5,\n        const PrintItem& item6, const PrintItem& item7,\n        const PrintItem& item8, const PrintItem& item9,\n        const PrintItem& item10, const PrintItem& item11,\n        const PrintItem& item12, const PrintItem& item13,\n        const PrintItem& item14, const PrintItem& item15) {\n    Format<16> result = {\n        format_string,\n        {\n            &item0, &item1, &item2, &item3, &item4, &item5, &item6, &item7,\n            &item8, &item9, &item10, &item11, &item12, &item13, &item14, &item15,\n        },\n    };\n    return result;\n}\n\n}  \/\/ namespace sfz\n\n#endif  \/\/ SFZ_FORMAT_HPP_\n<commit_msg>Use compound literals in Format.hpp.<commit_after>\/\/ Copyright (c) 2009 Chris Pickel <sfiera@gmail.com>\n\/\/\n\/\/ This file is part of libsfz, a free software project.  You can redistribute it and\/or modify it\n\/\/ under the terms of the MIT License.\n\n#ifndef SFZ_FORMAT_HPP_\n#define SFZ_FORMAT_HPP_\n\n#include \"sfz\/PrintItem.hpp\"\n#include \"sfz\/PrintTarget.hpp\"\n\nnamespace sfz {\n\ntemplate <size_t size> class Format;\n\nFormat<16> format(\n        const char* format_string,\n        const PrintItem& item0 = PrintItem(), const PrintItem& item1 = PrintItem(),\n        const PrintItem& item2 = PrintItem(), const PrintItem& item3 = PrintItem(),\n        const PrintItem& item4 = PrintItem(), const PrintItem& item5 = PrintItem(),\n        const PrintItem& item6 = PrintItem(), const PrintItem& item7 = PrintItem(),\n        const PrintItem& item8 = PrintItem(), const PrintItem& item9 = PrintItem(),\n        const PrintItem& item10 = PrintItem(), const PrintItem& item11 = PrintItem(),\n        const PrintItem& item12 = PrintItem(), const PrintItem& item13 = PrintItem(),\n        const PrintItem& item14 = PrintItem(), const PrintItem& item15 = PrintItem());\n\ntemplate <size_t size>\nstruct Format {\n    const char* format_string;\n    const PrintItem* items[size];\n};\n\nvoid print_format_to(\n        PrintTarget out, const char* format_string, const PrintItem* const* items, size_t size);\n\ntemplate <size_t size>\ninline void print_to(PrintTarget out, const Format<size>& format) {\n    print_format_to(out, format.format_string, format.items, size);\n}\n\ninline Format<16> format(\n        const char* format_string,\n        const PrintItem& item0, const PrintItem& item1,\n        const PrintItem& item2, const PrintItem& item3,\n        const PrintItem& item4, const PrintItem& item5,\n        const PrintItem& item6, const PrintItem& item7,\n        const PrintItem& item8, const PrintItem& item9,\n        const PrintItem& item10, const PrintItem& item11,\n        const PrintItem& item12, const PrintItem& item13,\n        const PrintItem& item14, const PrintItem& item15) {\n    return (Format<16>){\n        format_string,\n        {\n            &item0, &item1, &item2, &item3, &item4, &item5, &item6, &item7,\n            &item8, &item9, &item10, &item11, &item12, &item13, &item14, &item15,\n        },\n    };\n}\n\n}  \/\/ namespace sfz\n\n#endif  \/\/ SFZ_FORMAT_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- Mangler.cpp - Self-contained c\/asm llvm name mangler --------------===\/\/\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\/\/ Unified name mangler for CWriter and assembly backends.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Support\/Mangler.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\nusing namespace llvm;\n\nstatic char HexDigit(int V) {\n  return V < 10 ? V+'0' : V+'A'-10;\n}\n\nstatic std::string MangleLetter(unsigned char C) {\n  char Result[] = { '_', HexDigit(C >> 4), HexDigit(C & 15), '_', 0 };\n  return Result;\n}\n\n\/\/\/ makeNameProper - We don't want identifier names non-C-identifier characters\n\/\/\/ in them, so mangle them as appropriate.\n\/\/\/\nstd::string Mangler::makeNameProper(const std::string &X, const char *Prefix) {\n  std::string Result;\n  if (X.empty()) return X;  \/\/ Empty names are uniqued by the caller.\n  \n  if (!UseQuotes) {\n    \/\/ If X does not start with (char)1, add the prefix.\n    std::string::const_iterator I = X.begin();\n    if (*I != 1)\n      Result = Prefix;\n    else\n      ++I;  \/\/ Skip over the marker.\n    \n    \/\/ Mangle the first letter specially, don't allow numbers.\n    if (*I >= '0' && *I <= '9')\n      Result += MangleLetter(*I++);\n\n    for (std::string::const_iterator E = X.end(); I != E; ++I) {\n      if (!isCharAcceptable(*I))\n        Result += MangleLetter(*I);\n      else\n        Result += *I;\n    }\n  } else {\n    bool NeedsQuotes = false;\n    \n    \/\/ If X does not start with (char)1, add the prefix.\n    std::string::const_iterator I = X.begin();\n    if (*I != 1)\n      Result = Prefix;\n    else\n      ++I;  \/\/ Skip over the marker.\n    \n    \/\/ If the first character is a number, we need quotes.\n    if (*I >= '0' && *I <= '9')\n      NeedsQuotes = true;\n    \n    \/\/ Do an initial scan of the string, checking to see if we need quotes or\n    \/\/ to escape a '\"' or not.\n    if (!NeedsQuotes)\n      for (std::string::const_iterator E = X.end(); I != E; ++I)\n        if (!isCharAcceptable(*I)) {\n          NeedsQuotes = true;\n          break;\n        }\n    \n    \/\/ In the common case, we don't need quotes.  Handle this quickly.\n    if (!NeedsQuotes)\n      return Result + X;\n    \n    \/\/ Otherwise, construct the string the expensive way.\n    I = X.begin();\n    if (*I == 1) ++I;   \/\/ Skip the marker if present.\n    for (std::string::const_iterator E = X.end(); I != E; ++I) {\n      if (*I == '\"')\n        Result += \"_QQ_\";\n      else\n        Result += *I;\n    }\n    Result = '\"' + Result + '\"';\n  }\n  return Result;\n}\n\n\/\/\/ getTypeID - Return a unique ID for the specified LLVM type.\n\/\/\/\nunsigned Mangler::getTypeID(const Type *Ty) {\n  unsigned &E = TypeMap[Ty];\n  if (E == 0) E = ++TypeCounter;\n  return E;\n}\n\nstd::string Mangler::getValueName(const Value *V) {\n  if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))\n    return getValueName(GV);\n  \n  std::string &Name = Memo[V];\n  if (!Name.empty())\n    return Name;       \/\/ Return the already-computed name for V.\n  \n  \/\/ Always mangle local names.\n  Name = \"ltmp_\" + utostr(Count++) + \"_\" + utostr(getTypeID(V->getType()));\n  return Name;\n}\n\n\nstd::string Mangler::getValueName(const GlobalValue *GV) {\n  \/\/ Check to see whether we've already named V.\n  std::string &Name = Memo[GV];\n  if (!Name.empty())\n    return Name;       \/\/ Return the already-computed name for V.\n\n  \/\/ Name mangling occurs as follows:\n  \/\/ - If V is an intrinsic function, do not change name at all\n  \/\/ - Otherwise, mangling occurs if global collides with existing name.\n  if (isa<Function>(GV) && cast<Function>(GV)->getIntrinsicID()) {\n    Name = GV->getName(); \/\/ Is an intrinsic function\n  } else if (!MangledGlobals.count(GV)) {\n    Name = makeNameProper(GV->getName(), Prefix);\n  } else {\n    unsigned TypeUniqueID = getTypeID(GV->getType());\n    Name = \"l\" + utostr(TypeUniqueID) + \"_\" + makeNameProper(GV->getName());\n  }\n\n  return Name;\n}\n\nvoid Mangler::InsertName(GlobalValue *GV,\n                         std::map<std::string, GlobalValue*> &Names) {\n  if (!GV->hasName()) {   \/\/ We must mangle unnamed globals.\n    MangledGlobals.insert(GV);\n    return;\n  }\n\n  \/\/ Figure out if this is already used.\n  GlobalValue *&ExistingValue = Names[GV->getName()];\n  if (!ExistingValue) {\n    ExistingValue = GV;\n  } else {\n    \/\/ If GV is external but the existing one is static, mangle the existing one\n    if (GV->hasExternalLinkage() && !ExistingValue->hasExternalLinkage()) {\n      MangledGlobals.insert(ExistingValue);\n      ExistingValue = GV;\n    } else {\n      \/\/ Otherwise, mangle GV\n      MangledGlobals.insert(GV);\n    }\n  }\n}\n\n\nMangler::Mangler(Module &M, const char *prefix)\n  : Prefix(prefix), UseQuotes(false), Count(0), TypeCounter(0) {\n  std::fill(AcceptableChars, \n          AcceptableChars+sizeof(AcceptableChars)\/sizeof(AcceptableChars[0]),\n            0);\n\n  \/\/ Letters and numbers are acceptable.\n  for (unsigned char X = 'a'; X <= 'z'; ++X)\n    markCharAcceptable(X);\n  for (unsigned char X = 'A'; X <= 'Z'; ++X)\n    markCharAcceptable(X);\n  for (unsigned char X = '0'; X <= '9'; ++X)\n    markCharAcceptable(X);\n  \n  \/\/ These chars are acceptable.\n  markCharAcceptable('_');\n  markCharAcceptable('$');\n  markCharAcceptable('.');\n    \n  \/\/ Calculate which global values have names that will collide when we throw\n  \/\/ away type information.\n  std::map<std::string, GlobalValue*> Names;\n  for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n    InsertName(I, Names);\n  for (Module::global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)\n    InsertName(I, Names);\n}\n<commit_msg>Fix the optimized code handling of user asm strings<commit_after>\/\/===-- Mangler.cpp - Self-contained c\/asm llvm name mangler --------------===\/\/\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\/\/ Unified name mangler for CWriter and assembly backends.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Support\/Mangler.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\nusing namespace llvm;\n\nstatic char HexDigit(int V) {\n  return V < 10 ? V+'0' : V+'A'-10;\n}\n\nstatic std::string MangleLetter(unsigned char C) {\n  char Result[] = { '_', HexDigit(C >> 4), HexDigit(C & 15), '_', 0 };\n  return Result;\n}\n\n\/\/\/ makeNameProper - We don't want identifier names non-C-identifier characters\n\/\/\/ in them, so mangle them as appropriate.\n\/\/\/\nstd::string Mangler::makeNameProper(const std::string &X, const char *Prefix) {\n  std::string Result;\n  if (X.empty()) return X;  \/\/ Empty names are uniqued by the caller.\n  \n  if (!UseQuotes) {\n    \/\/ If X does not start with (char)1, add the prefix.\n    std::string::const_iterator I = X.begin();\n    if (*I != 1)\n      Result = Prefix;\n    else\n      ++I;  \/\/ Skip over the marker.\n    \n    \/\/ Mangle the first letter specially, don't allow numbers.\n    if (*I >= '0' && *I <= '9')\n      Result += MangleLetter(*I++);\n\n    for (std::string::const_iterator E = X.end(); I != E; ++I) {\n      if (!isCharAcceptable(*I))\n        Result += MangleLetter(*I);\n      else\n        Result += *I;\n    }\n  } else {\n    bool NeedsQuotes = false;\n    \n    std::string::const_iterator I = X.begin();\n    if (*I == 1)\n      ++I;  \/\/ Skip over the marker.\n\n    \/\/ If the first character is a number, we need quotes.\n    if (*I >= '0' && *I <= '9')\n      NeedsQuotes = true;\n    \n    \/\/ Do an initial scan of the string, checking to see if we need quotes or\n    \/\/ to escape a '\"' or not.\n    if (!NeedsQuotes)\n      for (std::string::const_iterator E = X.end(); I != E; ++I)\n        if (!isCharAcceptable(*I)) {\n          NeedsQuotes = true;\n          break;\n        }\n    \n    \/\/ In the common case, we don't need quotes.  Handle this quickly.\n    if (!NeedsQuotes) {\n      if (*X.begin() != 1)\n        return Prefix+X;\n      else\n        return X.substr(1);\n    }\n    \n    \/\/ Otherwise, construct the string the expensive way.\n    I = X.begin();\n    \n    \/\/ If X does not start with (char)1, add the prefix.\n    if (*I != 1)\n      Result = Prefix;\n    else\n      ++I;   \/\/ Skip the marker if present.\n      \n    for (std::string::const_iterator E = X.end(); I != E; ++I) {\n      if (*I == '\"')\n        Result += \"_QQ_\";\n      else\n        Result += *I;\n    }\n    Result = '\"' + Result + '\"';\n  }\n  return Result;\n}\n\n\/\/\/ getTypeID - Return a unique ID for the specified LLVM type.\n\/\/\/\nunsigned Mangler::getTypeID(const Type *Ty) {\n  unsigned &E = TypeMap[Ty];\n  if (E == 0) E = ++TypeCounter;\n  return E;\n}\n\nstd::string Mangler::getValueName(const Value *V) {\n  if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))\n    return getValueName(GV);\n  \n  std::string &Name = Memo[V];\n  if (!Name.empty())\n    return Name;       \/\/ Return the already-computed name for V.\n  \n  \/\/ Always mangle local names.\n  Name = \"ltmp_\" + utostr(Count++) + \"_\" + utostr(getTypeID(V->getType()));\n  return Name;\n}\n\n\nstd::string Mangler::getValueName(const GlobalValue *GV) {\n  \/\/ Check to see whether we've already named V.\n  std::string &Name = Memo[GV];\n  if (!Name.empty())\n    return Name;       \/\/ Return the already-computed name for V.\n\n  \/\/ Name mangling occurs as follows:\n  \/\/ - If V is an intrinsic function, do not change name at all\n  \/\/ - Otherwise, mangling occurs if global collides with existing name.\n  if (isa<Function>(GV) && cast<Function>(GV)->getIntrinsicID()) {\n    Name = GV->getName(); \/\/ Is an intrinsic function\n  } else if (!MangledGlobals.count(GV)) {\n    Name = makeNameProper(GV->getName(), Prefix);\n  } else {\n    unsigned TypeUniqueID = getTypeID(GV->getType());\n    Name = \"l\" + utostr(TypeUniqueID) + \"_\" + makeNameProper(GV->getName());\n  }\n\n  return Name;\n}\n\nvoid Mangler::InsertName(GlobalValue *GV,\n                         std::map<std::string, GlobalValue*> &Names) {\n  if (!GV->hasName()) {   \/\/ We must mangle unnamed globals.\n    MangledGlobals.insert(GV);\n    return;\n  }\n\n  \/\/ Figure out if this is already used.\n  GlobalValue *&ExistingValue = Names[GV->getName()];\n  if (!ExistingValue) {\n    ExistingValue = GV;\n  } else {\n    \/\/ If GV is external but the existing one is static, mangle the existing one\n    if (GV->hasExternalLinkage() && !ExistingValue->hasExternalLinkage()) {\n      MangledGlobals.insert(ExistingValue);\n      ExistingValue = GV;\n    } else {\n      \/\/ Otherwise, mangle GV\n      MangledGlobals.insert(GV);\n    }\n  }\n}\n\n\nMangler::Mangler(Module &M, const char *prefix)\n  : Prefix(prefix), UseQuotes(false), Count(0), TypeCounter(0) {\n  std::fill(AcceptableChars, \n          AcceptableChars+sizeof(AcceptableChars)\/sizeof(AcceptableChars[0]),\n            0);\n\n  \/\/ Letters and numbers are acceptable.\n  for (unsigned char X = 'a'; X <= 'z'; ++X)\n    markCharAcceptable(X);\n  for (unsigned char X = 'A'; X <= 'Z'; ++X)\n    markCharAcceptable(X);\n  for (unsigned char X = '0'; X <= '9'; ++X)\n    markCharAcceptable(X);\n  \n  \/\/ These chars are acceptable.\n  markCharAcceptable('_');\n  markCharAcceptable('$');\n  markCharAcceptable('.');\n    \n  \/\/ Calculate which global values have names that will collide when we throw\n  \/\/ away type information.\n  std::map<std::string, GlobalValue*> Names;\n  for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n    InsertName(I, Names);\n  for (Module::global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)\n    InsertName(I, Names);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\n\n<commit_msg>Removing unnecesary file<commit_after><|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_METRIC_HXX\n#define INCLUDED_VCL_METRIC_HXX\n\n#include <vcl\/dllapi.h>\n#include <vcl\/font.hxx>\n#include <vcl\/outdev.hxx>\n\nclass ImplFontMetric;\nclass ImplFontCharMap;\n\ntypedef sal_uInt32 sal_UCS4;\n\nnamespace vcl {\n\n\/\/ avoid problems where poppler's FontInfo is picked up\nclass VCL_DLLPUBLIC FontInfo : public Font\n{\n    friend class OutputDevice;\n\nprotected:\n\npublic:\n                        FontInfo();\n                        FontInfo( const FontInfo& );\n                        ~FontInfo();\n\n    FontType            GetType() const;\n\n    FontInfo&           operator=( const FontInfo& );\n    bool                operator==( const FontInfo& ) const;\n    bool                operator!=( const FontInfo& rInfo ) const\n                            { return !operator==( rInfo ); }\n    ImplFontMetric*     mpImplMetric;    \/\/ Implementation\n};\n\n}\n\nclass VCL_DLLPUBLIC FontMetric : public vcl::FontInfo\n{\npublic:\n                        FontMetric() {}\n                        FontMetric( const FontMetric& );\n                        ~FontMetric() {}\n\n    long                GetAscent() const;\n    long                GetDescent() const;\n    long                GetIntLeading() const;\n    long                GetExtLeading() const;\n    long                GetLineHeight() const;\n    long                GetSlant() const;\n\n    FontMetric&         operator=( const FontMetric& rMetric );\n    bool                operator==( const FontMetric& rMetric ) const;\n    bool                operator!=( const FontMetric& rMetric ) const\n                            { return !operator==( rMetric ); }\n};\n\ntemplate< typename charT, typename traits >\ninline std::basic_ostream<charT, traits> & operator <<(\n    std::basic_ostream<charT, traits> & stream, const FontMetric& rMetric )\n{\n    stream << \"{\"\n           << \"name=\" << \"\\\"\" << rMetric.GetName() << \"\\\"\"\n           << \",size=(\" << rMetric.GetSize().Width() << \",\" << rMetric.GetSize().Height() << \")\"\n           << \",ascent=\" << rMetric.GetAscent()\n           << \",descent=\" << rMetric.GetDescent()\n           << \",intLeading=\" << rMetric.GetIntLeading()\n           << \",extLeading=\" << rMetric.GetExtLeading()\n           << \",lineHeight=\" << rMetric.GetLineHeight()\n           << \",slant=\" << rMetric.GetSlant()\n           << \"}\";\n    return stream;\n}\n\nclass VCL_DLLPUBLIC FontCharMap\n{\nprivate:\n    const ImplFontCharMap* mpImpl;\n\npublic:\n                        FontCharMap();\n                        ~FontCharMap();\n\n    bool                IsDefaultMap( void ) const;\n    bool                HasChar( sal_UCS4 ) const;\n    int                 CountCharsInRange( sal_UCS4 cMin, sal_UCS4 cMax ) const;\n    int                 GetCharCount( void ) const;\n\n    sal_UCS4            GetFirstChar() const;\n\n    sal_UCS4            GetNextChar( sal_UCS4 ) const;\n    sal_UCS4            GetPrevChar( sal_UCS4 ) const;\n\n    int                 GetIndexFromChar( sal_UCS4 ) const;\n    sal_UCS4            GetCharFromIndex( int ) const;\n\n\nprivate:\n    friend class OutputDevice;\n    void                Reset( const ImplFontCharMap* pNewMap = NULL );\n\n    \/\/ prevent assignment and copy construction\n                        FontCharMap( const FontCharMap& );\n    void                operator=( const FontCharMap& );\n};\n\nclass VCL_DLLPUBLIC TextRectInfo\n{\n    friend class OutputDevice;\n\nprivate:\n    long            mnMaxWidth;\n    sal_uInt16          mnLineCount;\n    bool            mbEllipsis;\n\npublic:\n                    TextRectInfo();\n\n    sal_uInt16          GetLineCount() const { return mnLineCount; }\n    long            GetMaxLineWidth() const { return mnMaxWidth; }\n    bool            IsEllipses() const { return mbEllipsis; }\n\n    bool            operator ==( const TextRectInfo& rInfo ) const\n                        { return ((mnMaxWidth   == rInfo.mnMaxWidth)    &&\n                                  (mnLineCount  == rInfo.mnLineCount)   &&\n                                  (mbEllipsis   == rInfo.mbEllipsis)); }\n    bool            operator !=( const TextRectInfo& rInfo ) const\n                        { return !(TextRectInfo::operator==( rInfo )); }\n};\n\ninline TextRectInfo::TextRectInfo()\n{\n    mnMaxWidth      = 0;\n    mnLineCount     = 0;\n    mbEllipsis      = false;\n}\n\n#endif \/\/ INCLUDED_VCL_METRIC_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>make that variable protected again<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_METRIC_HXX\n#define INCLUDED_VCL_METRIC_HXX\n\n#include <vcl\/dllapi.h>\n#include <vcl\/font.hxx>\n#include <vcl\/outdev.hxx>\n\nclass ImplFontMetric;\nclass ImplFontCharMap;\n\ntypedef sal_uInt32 sal_UCS4;\n\nnamespace vcl {\n\n\/\/ avoid problems where poppler's FontInfo is picked up\nclass VCL_DLLPUBLIC FontInfo : public Font\n{\n    friend class ::OutputDevice;\n\nprotected:\n    ImplFontMetric*     mpImplMetric;    \/\/ Implementation\n\npublic:\n                        FontInfo();\n                        FontInfo( const FontInfo& );\n                        ~FontInfo();\n\n    FontType            GetType() const;\n\n    FontInfo&           operator=( const FontInfo& );\n    bool                operator==( const FontInfo& ) const;\n    bool                operator!=( const FontInfo& rInfo ) const\n                            { return !operator==( rInfo ); }\n};\n\n}\n\nclass VCL_DLLPUBLIC FontMetric : public vcl::FontInfo\n{\npublic:\n                        FontMetric() {}\n                        FontMetric( const FontMetric& );\n                        ~FontMetric() {}\n\n    long                GetAscent() const;\n    long                GetDescent() const;\n    long                GetIntLeading() const;\n    long                GetExtLeading() const;\n    long                GetLineHeight() const;\n    long                GetSlant() const;\n\n    FontMetric&         operator=( const FontMetric& rMetric );\n    bool                operator==( const FontMetric& rMetric ) const;\n    bool                operator!=( const FontMetric& rMetric ) const\n                            { return !operator==( rMetric ); }\n};\n\ntemplate< typename charT, typename traits >\ninline std::basic_ostream<charT, traits> & operator <<(\n    std::basic_ostream<charT, traits> & stream, const FontMetric& rMetric )\n{\n    stream << \"{\"\n           << \"name=\" << \"\\\"\" << rMetric.GetName() << \"\\\"\"\n           << \",size=(\" << rMetric.GetSize().Width() << \",\" << rMetric.GetSize().Height() << \")\"\n           << \",ascent=\" << rMetric.GetAscent()\n           << \",descent=\" << rMetric.GetDescent()\n           << \",intLeading=\" << rMetric.GetIntLeading()\n           << \",extLeading=\" << rMetric.GetExtLeading()\n           << \",lineHeight=\" << rMetric.GetLineHeight()\n           << \",slant=\" << rMetric.GetSlant()\n           << \"}\";\n    return stream;\n}\n\nclass VCL_DLLPUBLIC FontCharMap\n{\nprivate:\n    const ImplFontCharMap* mpImpl;\n\npublic:\n                        FontCharMap();\n                        ~FontCharMap();\n\n    bool                IsDefaultMap( void ) const;\n    bool                HasChar( sal_UCS4 ) const;\n    int                 CountCharsInRange( sal_UCS4 cMin, sal_UCS4 cMax ) const;\n    int                 GetCharCount( void ) const;\n\n    sal_UCS4            GetFirstChar() const;\n\n    sal_UCS4            GetNextChar( sal_UCS4 ) const;\n    sal_UCS4            GetPrevChar( sal_UCS4 ) const;\n\n    int                 GetIndexFromChar( sal_UCS4 ) const;\n    sal_UCS4            GetCharFromIndex( int ) const;\n\n\nprivate:\n    friend class OutputDevice;\n    void                Reset( const ImplFontCharMap* pNewMap = NULL );\n\n    \/\/ prevent assignment and copy construction\n                        FontCharMap( const FontCharMap& );\n    void                operator=( const FontCharMap& );\n};\n\nclass VCL_DLLPUBLIC TextRectInfo\n{\n    friend class OutputDevice;\n\nprivate:\n    long            mnMaxWidth;\n    sal_uInt16          mnLineCount;\n    bool            mbEllipsis;\n\npublic:\n                    TextRectInfo();\n\n    sal_uInt16          GetLineCount() const { return mnLineCount; }\n    long            GetMaxLineWidth() const { return mnMaxWidth; }\n    bool            IsEllipses() const { return mbEllipsis; }\n\n    bool            operator ==( const TextRectInfo& rInfo ) const\n                        { return ((mnMaxWidth   == rInfo.mnMaxWidth)    &&\n                                  (mnLineCount  == rInfo.mnLineCount)   &&\n                                  (mbEllipsis   == rInfo.mbEllipsis)); }\n    bool            operator !=( const TextRectInfo& rInfo ) const\n                        { return !(TextRectInfo::operator==( rInfo )); }\n};\n\ninline TextRectInfo::TextRectInfo()\n{\n    mnMaxWidth      = 0;\n    mnLineCount     = 0;\n    mbEllipsis      = false;\n}\n\n#endif \/\/ INCLUDED_VCL_METRIC_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkRenderer.hh\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1995 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\/\/ .NAME vtkRenderer - abstract specification for renderers\n\/\/ .SECTION Description\n\/\/ vtkRenderer provides an abstract specification for renderers. A renderer\n\/\/ is an object that controls the rendering process for objects. Rendering\n\/\/ is the process of converting geometry, a specification for lights, and \n\/\/ a camera view into an image. vtkRenderer also performs coordinate \n\/\/ transformation between world coordinates, view coordinates (the computer\n\/\/ graphics rendering coordinate system), and display coordinates (the \n\/\/ actual screen coordinates on the display device). Certain advanced \n\/\/ rendering features such as two-sided lighting can also be controlled.\n\n\/\/ .SECTION See Also\n\/\/ vtkRenderWindow vtkActor vtkCamera vtkLight\n\n#ifndef __vtkRenderer_hh\n#define __vtkRenderer_hh\n\n#include \"vtkMatrix4x4.hh\"\n#include \"vtkLightCollection.hh\"\n#include \"vtkCamera.hh\"\n#include \"vtkActor.hh\"\n\nclass vtkRenderWindow;\nclass vtkVolumeRenderer;\n\nclass vtkRenderer : public vtkObject\n{\npublic:\n  vtkRenderer();\n  ~vtkRenderer();\n  char *GetClassName() {return \"vtkRenderer\";};\n  void PrintSelf(ostream& os, vtkIndent indent);\n\n  void AddLights(vtkLight *);\n  void AddActors(vtkActor *);\n  void RemoveLights(vtkLight *);\n  void RemoveActors(vtkActor *);\n  vtkLightCollection *GetLights();\n  vtkActorCollection *GetActors();\n  void SetActiveCamera(vtkCamera *);\n  vtkCamera *GetActiveCamera();\n  void SetVolumeRenderer(vtkVolumeRenderer *);\n  vtkVolumeRenderer *GetVolumeRenderer();\n\n  \/\/ Description:\n  \/\/ Set\/Get the background color of the rendering screen using an rgb color\n  \/\/ specification.\n  vtkSetVector3Macro(Background,float);\n  vtkGetVectorMacro(Background,float,3);\n\n  \/\/ Description:\n  \/\/ Set the aspect ratio of the rendered image. This is computed \n  \/\/ automatically and should not be set by the user.\n  vtkSetVector2Macro(Aspect,float);\n  vtkGetVectorMacro(Aspect,float,2);\n\n  \/\/ Description:\n  \/\/ Set the intensity of ambient lighting.\n  vtkSetVector3Macro(Ambient,float);\n  vtkGetVectorMacro(Ambient,float,3);\n\n  \/\/ Description:\n  \/\/ Set\/Get the amount of time this renderer is allowed to spend\n  \/\/ rendering its scene. Zero indicates an infinite amount of time.\n  \/\/ This is used by vtkLODActor's.\n  vtkSetMacro(AllocatedRenderTime,float);\n  vtkGetMacro(AllocatedRenderTime,float);\n\n  \/\/ Description:\n  \/\/ Create an image. Subclasses of vtkRenderer must implement this method.\n  virtual void Render() = 0;\n\n  \/\/ Description:\n  \/\/ Ask all actors to build and draw themselves.\n  virtual int UpdateActors(void) = 0;\n\n  \/\/ Description:\n  \/\/ Ask the active camera to do whatever it needs to do prior to rendering.\n  \/\/ This method returns one if there was an active camera and it \n  \/\/ was on. It returns zero otherwise.\n  virtual int UpdateCameras(void) = 0;\n\n  \/\/ Description:\n  \/\/ Ask all lights to load themselves into rendering pipeline.\n  \/\/ This method will return the actual number of lights that were on.\n  virtual int UpdateLights(void) = 0;\n\n  void DoCameras();\n  void DoLights();\n  void DoActors();\n  void ResetCamera();\n  void ResetCamera(float bounds[6]);\n\n  void SetRenderWindow(vtkRenderWindow *);\n  vtkRenderWindow *GetRenderWindow() {return RenderWindow;};\n  \n  \/\/ Description:\n  \/\/ Set\/get a point location in display (or screen) coordinates.\n  \/\/ The lower left corner of the window is the origin and y increases\n  \/\/ as you go up the screen.\n  vtkSetVector3Macro(DisplayPoint,float);\n  vtkGetVectorMacro(DisplayPoint,float,3);\n\n  \/\/ Description:\n  \/\/ Specify a point location in view coordinates. The origin is in the \n  \/\/ middle of the viewport and it extends from -1 to 1 in all three\n  \/\/ dimensions.\n  vtkSetVector3Macro(ViewPoint,float);\n  vtkGetVectorMacro(ViewPoint,float,3);\n\n  \/\/ Description:\n  \/\/ Specify a point location in world coordinates. This method takes \n  \/\/ homogeneous coordinates. \n  vtkSetVector4Macro(WorldPoint,float);\n  vtkGetVectorMacro(WorldPoint,float,4);\n\n  \/\/ Description:\n  \/\/ Specify the viewport for the renderer to draw in the rendering window. \n  \/\/ Coordinates are expressed as (xmin,ymin,xmax,ymax), where each\n  \/\/ coordinate is 0 <= coordinate <= 1.0.\n  vtkSetVector4Macro(Viewport,float);\n  vtkGetVectorMacro(Viewport,float,4);\n\n  \/\/ Description:\n  \/\/ Turn on\/off two-sided lighting of surfaces. If two-sided lighting is\n  \/\/ off, then only the side of the surface facing the light(s) will be lit,\n  \/\/ and the other side dark. If two-sided lighting on, both sides of the \n  \/\/ surface will be lit.\n  vtkGetMacro(TwoSidedLighting,int);\n  vtkSetMacro(TwoSidedLighting,int);\n  vtkBooleanMacro(TwoSidedLighting,int);\n\n  virtual float *GetCenter();\n\n  virtual void DisplayToView(); \/\/ these get modified in subclasses\n  virtual void ViewToDisplay(); \/\/ to handle stereo rendering\n  virtual int  IsInViewport(int x,int y); \n  void WorldToView();\n  void ViewToWorld();\n  void DisplayToWorld();\n  void WorldToDisplay();\n\n  void SetStartRenderMethod(void (*f)(void *), void *arg);\n  void SetEndRenderMethod(void (*f)(void *), void *arg);\n  void SetStartRenderMethodArgDelete(void (*f)(void *));\n  void SetEndRenderMethodArgDelete(void (*f)(void *));\n\nprotected:\n  vtkVolumeRenderer *VolumeRenderer;\n  vtkCamera *ActiveCamera;\n  vtkLight  *CreatedLight;\n  vtkLightCollection Lights;\n  vtkActorCollection Actors;\n  float Ambient[3];  \n  float Background[3];  \n  vtkRenderWindow *RenderWindow;\n  float DisplayPoint[3];\n  float ViewPoint[3];\n  float WorldPoint[4];\n  float Viewport[4];\n  float Aspect[2];\n  float Center[2];\n  int   SelfCreatedCamera;\n  int   SelfCreatedLight;\n  float AllocatedRenderTime;\n  int   TwoSidedLighting;\n  \n  void (*StartRenderMethod)(void *);\n  void (*StartRenderMethodArgDelete)(void *);\n  void *StartRenderMethodArg;\n  void (*EndRenderMethod)(void *);\n  void (*EndRenderMethodArgDelete)(void *);\n  void *EndRenderMethodArg;\n};\n\n\/\/ Description:\n\/\/ Get the list of lights for this renderer.\ninline vtkLightCollection *vtkRenderer::GetLights() {return &(this->Lights);};\n\n\/\/ Description:\n\/\/ Get the list of actors for this renderer.\ninline vtkActorCollection *vtkRenderer::GetActors() {return &(this->Actors);};\n\n\/\/ Description:\n\/\/ Convert display (or screen) coordinates to world coordinates.\ninline void vtkRenderer::DisplayToWorld() {DisplayToView(); ViewToWorld();};\n\n\/\/ Description:\n\/\/ Convert world point coordinates to display (or screen) coordinates.\ninline void vtkRenderer::WorldToDisplay() {WorldToView(); ViewToDisplay();};\n\n#endif\n<commit_msg>Added a vtkNewVolumeRenderer<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkRenderer.hh\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1995 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\/\/ .NAME vtkRenderer - abstract specification for renderers\n\/\/ .SECTION Description\n\/\/ vtkRenderer provides an abstract specification for renderers. A renderer\n\/\/ is an object that controls the rendering process for objects. Rendering\n\/\/ is the process of converting geometry, a specification for lights, and \n\/\/ a camera view into an image. vtkRenderer also performs coordinate \n\/\/ transformation between world coordinates, view coordinates (the computer\n\/\/ graphics rendering coordinate system), and display coordinates (the \n\/\/ actual screen coordinates on the display device). Certain advanced \n\/\/ rendering features such as two-sided lighting can also be controlled.\n\n\/\/ .SECTION See Also\n\/\/ vtkRenderWindow vtkActor vtkCamera vtkLight\n\n#ifndef __vtkRenderer_hh\n#define __vtkRenderer_hh\n\n#include \"vtkMatrix4x4.hh\"\n#include \"vtkLightCollection.hh\"\n#include \"vtkCamera.hh\"\n#include \"vtkActor.hh\"\n\nclass vtkRenderWindow;\nclass vtkVolumeRenderer;\nclass vtkNewVolumeRenderer;\n\nclass vtkRenderer : public vtkObject\n{\npublic:\n  vtkRenderer();\n  ~vtkRenderer();\n  char *GetClassName() {return \"vtkRenderer\";};\n  void PrintSelf(ostream& os, vtkIndent indent);\n\n  void AddLights(vtkLight *);\n  void AddActors(vtkActor *);\n  void RemoveLights(vtkLight *);\n  void RemoveActors(vtkActor *);\n  vtkLightCollection *GetLights();\n  vtkActorCollection *GetActors();\n  void SetActiveCamera(vtkCamera *);\n  vtkCamera *GetActiveCamera();\n  void SetVolumeRenderer(vtkVolumeRenderer *);\n  vtkVolumeRenderer *GetVolumeRenderer();\n\n  void SetNewVolumeRenderer(vtkNewVolumeRenderer *);\n  vtkNewVolumeRenderer *GetNewVolumeRenderer();\n\n  \/\/ Description:\n  \/\/ Set\/Get the background color of the rendering screen using an rgb color\n  \/\/ specification.\n  vtkSetVector3Macro(Background,float);\n  vtkGetVectorMacro(Background,float,3);\n\n  \/\/ Description:\n  \/\/ Set the aspect ratio of the rendered image. This is computed \n  \/\/ automatically and should not be set by the user.\n  vtkSetVector2Macro(Aspect,float);\n  vtkGetVectorMacro(Aspect,float,2);\n\n  \/\/ Description:\n  \/\/ Set the intensity of ambient lighting.\n  vtkSetVector3Macro(Ambient,float);\n  vtkGetVectorMacro(Ambient,float,3);\n\n  \/\/ Description:\n  \/\/ Set\/Get the amount of time this renderer is allowed to spend\n  \/\/ rendering its scene. Zero indicates an infinite amount of time.\n  \/\/ This is used by vtkLODActor's.\n  vtkSetMacro(AllocatedRenderTime,float);\n  vtkGetMacro(AllocatedRenderTime,float);\n\n  \/\/ Description:\n  \/\/ Create an image. Subclasses of vtkRenderer must implement this method.\n  virtual void Render() = 0;\n\n  \/\/ Description:\n  \/\/ Ask all actors to build and draw themselves.\n  virtual int UpdateActors(void) = 0;\n\n  \/\/ Description:\n  \/\/ Ask the active camera to do whatever it needs to do prior to rendering.\n  \/\/ This method returns one if there was an active camera and it \n  \/\/ was on. It returns zero otherwise.\n  virtual int UpdateCameras(void) = 0;\n\n  \/\/ Description:\n  \/\/ Ask all lights to load themselves into rendering pipeline.\n  \/\/ This method will return the actual number of lights that were on.\n  virtual int UpdateLights(void) = 0;\n\n  void DoCameras();\n  void DoLights();\n  void DoActors();\n  void ResetCamera();\n  void ResetCamera(float bounds[6]);\n\n  void SetRenderWindow(vtkRenderWindow *);\n  vtkRenderWindow *GetRenderWindow() {return RenderWindow;};\n  \n  \/\/ Description:\n  \/\/ Set\/get a point location in display (or screen) coordinates.\n  \/\/ The lower left corner of the window is the origin and y increases\n  \/\/ as you go up the screen.\n  vtkSetVector3Macro(DisplayPoint,float);\n  vtkGetVectorMacro(DisplayPoint,float,3);\n\n  \/\/ Description:\n  \/\/ Specify a point location in view coordinates. The origin is in the \n  \/\/ middle of the viewport and it extends from -1 to 1 in all three\n  \/\/ dimensions.\n  vtkSetVector3Macro(ViewPoint,float);\n  vtkGetVectorMacro(ViewPoint,float,3);\n\n  \/\/ Description:\n  \/\/ Specify a point location in world coordinates. This method takes \n  \/\/ homogeneous coordinates. \n  vtkSetVector4Macro(WorldPoint,float);\n  vtkGetVectorMacro(WorldPoint,float,4);\n\n  \/\/ Description:\n  \/\/ Specify the viewport for the renderer to draw in the rendering window. \n  \/\/ Coordinates are expressed as (xmin,ymin,xmax,ymax), where each\n  \/\/ coordinate is 0 <= coordinate <= 1.0.\n  vtkSetVector4Macro(Viewport,float);\n  vtkGetVectorMacro(Viewport,float,4);\n\n  \/\/ Description:\n  \/\/ Turn on\/off two-sided lighting of surfaces. If two-sided lighting is\n  \/\/ off, then only the side of the surface facing the light(s) will be lit,\n  \/\/ and the other side dark. If two-sided lighting on, both sides of the \n  \/\/ surface will be lit.\n  vtkGetMacro(TwoSidedLighting,int);\n  vtkSetMacro(TwoSidedLighting,int);\n  vtkBooleanMacro(TwoSidedLighting,int);\n\n  virtual float *GetCenter();\n\n  virtual void DisplayToView(); \/\/ these get modified in subclasses\n  virtual void ViewToDisplay(); \/\/ to handle stereo rendering\n  virtual int  IsInViewport(int x,int y); \n  void WorldToView();\n  void ViewToWorld();\n  void DisplayToWorld();\n  void WorldToDisplay();\n\n  void SetStartRenderMethod(void (*f)(void *), void *arg);\n  void SetEndRenderMethod(void (*f)(void *), void *arg);\n  void SetStartRenderMethodArgDelete(void (*f)(void *));\n  void SetEndRenderMethodArgDelete(void (*f)(void *));\n\nprotected:\n  vtkVolumeRenderer *VolumeRenderer;\n  vtkNewVolumeRenderer *NewVolumeRenderer;\n  vtkCamera *ActiveCamera;\n  vtkLight  *CreatedLight;\n  vtkLightCollection Lights;\n  vtkActorCollection Actors;\n  float Ambient[3];  \n  float Background[3];  \n  vtkRenderWindow *RenderWindow;\n  float DisplayPoint[3];\n  float ViewPoint[3];\n  float WorldPoint[4];\n  float Viewport[4];\n  float Aspect[2];\n  float Center[2];\n  int   SelfCreatedCamera;\n  int   SelfCreatedLight;\n  float AllocatedRenderTime;\n  int   TwoSidedLighting;\n  \n  void (*StartRenderMethod)(void *);\n  void (*StartRenderMethodArgDelete)(void *);\n  void *StartRenderMethodArg;\n  void (*EndRenderMethod)(void *);\n  void (*EndRenderMethodArgDelete)(void *);\n  void *EndRenderMethodArg;\n};\n\n\/\/ Description:\n\/\/ Get the list of lights for this renderer.\ninline vtkLightCollection *vtkRenderer::GetLights() {return &(this->Lights);};\n\n\/\/ Description:\n\/\/ Get the list of actors for this renderer.\ninline vtkActorCollection *vtkRenderer::GetActors() {return &(this->Actors);};\n\n\/\/ Description:\n\/\/ Convert display (or screen) coordinates to world coordinates.\ninline void vtkRenderer::DisplayToWorld() {DisplayToView(); ViewToWorld();};\n\n\/\/ Description:\n\/\/ Convert world point coordinates to display (or screen) coordinates.\ninline void vtkRenderer::WorldToDisplay() {WorldToView(); ViewToDisplay();};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2019 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 \"src\/gpu\/dawn\/GrDawnCaps.h\"\n\n#include \"src\/gpu\/GrProgramDesc.h\"\n#include \"src\/gpu\/GrProgramInfo.h\"\n#include \"src\/gpu\/GrRenderTarget.h\"\n#include \"src\/gpu\/GrRenderTargetPriv.h\"\n#include \"src\/gpu\/GrStencilSettings.h\"\n\nGrDawnCaps::GrDawnCaps(const GrContextOptions& contextOptions) : INHERITED(contextOptions) {\n    fMipMapSupport = true;\n    fBufferMapThreshold = SK_MaxS32;  \/\/ FIXME: get this from Dawn?\n    fShaderCaps.reset(new GrShaderCaps(contextOptions));\n    fMaxTextureSize = fMaxRenderTargetSize = 4096; \/\/ FIXME\n    fMaxVertexAttributes = 16; \/\/ FIXME\n    fClampToBorderSupport = false;\n    fPerformPartialClearsAsDraws = true;\n    fDynamicStateArrayGeometryProcessorTextureSupport = true;\n\n    fShaderCaps->fFlatInterpolationSupport = true;\n    fShaderCaps->fIntegerSupport = true;\n    \/\/ FIXME: each fragment sampler takes two binding slots in Dawn (sampler + texture). Limit to\n    \/\/ 6 * 2 = 12, since kMaxBindingsPerGroup is 16 in Dawn, and we need to keep a few for\n    \/\/ non-texture bindings. Eventually, we may be able to increase kMaxBindingsPerGroup in Dawn.\n    fShaderCaps->fMaxFragmentSamplers = 6;\n    fShaderCaps->fShaderDerivativeSupport = true;\n\n    this->finishInitialization(contextOptions);\n}\n\nbool GrDawnCaps::isFormatSRGB(const GrBackendFormat& format) const {\n    return false;\n}\n\nSkImage::CompressionType GrDawnCaps::compressionType(const GrBackendFormat& format) const {\n    return SkImage::CompressionType::kNone;\n}\n\nbool GrDawnCaps::isFormatTexturable(const GrBackendFormat& format) const {\n    \/\/ Currently, all the formats in GrDawnFormatToPixelConfig are texturable.\n    wgpu::TextureFormat dawnFormat;\n    return format.asDawnFormat(&dawnFormat);\n}\n\nstatic GrSwizzle get_swizzle(const GrBackendFormat& format, GrColorType colorType,\n                             bool forOutput) {\n    switch (colorType) {\n        case GrColorType::kAlpha_8: \/\/ fall through\n        case GrColorType::kAlpha_F16:\n            if (forOutput) {\n                return GrSwizzle::AAAA();\n            } else {\n                return GrSwizzle::RRRR();\n            }\n        case GrColorType::kGray_8:\n            if (!forOutput) {\n                return GrSwizzle::RRRA();\n            }\n            break;\n        case GrColorType::kRGB_888x:\n            if (!forOutput) {\n                return GrSwizzle::RGB1();\n            }\n        default:\n            return GrSwizzle::RGBA();\n    }\n    return GrSwizzle::RGBA();\n}\n\nbool GrDawnCaps::isFormatTexturableAndUploadable(GrColorType ct,\n                                                 const GrBackendFormat& format) const {\n    wgpu::TextureFormat dawnFormat;\n    if (!format.asDawnFormat(&dawnFormat)) {\n        return false;\n    }\n    switch (ct) {\n        case GrColorType::kAlpha_8:\n            return wgpu::TextureFormat::R8Unorm == dawnFormat;\n        case GrColorType::kRGBA_8888:\n        case GrColorType::kRGB_888x:\n        case GrColorType::kBGRA_8888:\n            return wgpu::TextureFormat::RGBA8Unorm == dawnFormat ||\n                   wgpu::TextureFormat::BGRA8Unorm == dawnFormat;\n        default:\n            return false;\n    }\n}\n\nbool GrDawnCaps::isFormatRenderable(const GrBackendFormat& format,\n                                    int sampleCount) const {\n    wgpu::TextureFormat dawnFormat;\n    if (!format.isValid() || sampleCount > 1 || !format.asDawnFormat(&dawnFormat)) {\n        return false;\n    }\n\n    return GrDawnFormatIsRenderable(dawnFormat);\n}\n\nbool GrDawnCaps::isFormatAsColorTypeRenderable(GrColorType ct, const GrBackendFormat& format,\n                                               int sampleCount) const {\n    return isFormatRenderable(format, sampleCount);\n}\n\nsize_t GrDawnCaps::bytesPerPixel(const GrBackendFormat& backendFormat) const {\n    wgpu::TextureFormat dawnFormat;\n    if (!backendFormat.asDawnFormat(&dawnFormat)) {\n        return 0;\n    }\n    return GrDawnBytesPerPixel(dawnFormat);\n}\n\nint GrDawnCaps::getRenderTargetSampleCount(int requestedCount,\n                                           const GrBackendFormat& backendFormat) const {\n    wgpu::TextureFormat dawnFormat;\n    if (!backendFormat.asDawnFormat(&dawnFormat)) {\n        return 0;\n    }\n    return GrDawnFormatIsRenderable(dawnFormat) ? 1 : 0;\n}\n\nint GrDawnCaps::maxRenderTargetSampleCount(const GrBackendFormat& format) const {\n    return format.isValid() ? 1 : 0;\n}\n\nGrBackendFormat GrDawnCaps::onGetDefaultBackendFormat(GrColorType ct,\n                                                      GrRenderable renderable) const {\n    wgpu::TextureFormat format;\n    if (!GrColorTypeToDawnFormat(ct, &format)) {\n        return GrBackendFormat();\n    }\n    return GrBackendFormat::MakeDawn(format);\n}\n\nGrBackendFormat GrDawnCaps::getBackendFormatFromCompressionType(SkImage::CompressionType type) const\n{\n    return GrBackendFormat();\n}\n\nGrSwizzle GrDawnCaps::getReadSwizzle(const GrBackendFormat& format, GrColorType colorType) const\n{\n    return get_swizzle(format, colorType, false);\n}\n\nGrSwizzle GrDawnCaps::getOutputSwizzle(const GrBackendFormat& format, GrColorType colorType) const\n{\n    return get_swizzle(format, colorType, true);\n}\n\nuint64_t GrDawnCaps::computeFormatKey(const GrBackendFormat& format) const {\n    wgpu::TextureFormat dawnFormat;\n    SkAssertResult(format.asDawnFormat(&dawnFormat));\n\n    \/\/ Dawn max enum value should always fit in 32 bits.\n\n    \/\/ disabled: no member named 'WGPUTextureFormat_Force32' in namespace 'wgpu'\n    \/\/SkASSERT(dawnFormat <= wgpu::WGPUTextureFormat_Force32);\n    return (uint64_t)dawnFormat;\n}\n\nbool GrDawnCaps::onAreColorTypeAndFormatCompatible(GrColorType ct,\n                                                   const GrBackendFormat& format) const {\n    return true;\n}\n\nGrColorType GrDawnCaps::getYUVAColorTypeFromBackendFormat(const GrBackendFormat& backendFormat,\n                                                          bool isAlphaChannel) const {\n    wgpu::TextureFormat textureFormat;\n    if (!backendFormat.asDawnFormat(&textureFormat)) {\n        return GrColorType::kUnknown;\n    }\n    switch (textureFormat) {\n        case wgpu::TextureFormat::R8Unorm:     return isAlphaChannel ? GrColorType::kAlpha_8\n                                                                     : GrColorType::kGray_8;\n        case wgpu::TextureFormat::RGBA8Unorm:  return GrColorType::kRGBA_8888;\n        case wgpu::TextureFormat::BGRA8Unorm:  return GrColorType::kBGRA_8888;\n        default:                               return GrColorType::kUnknown;\n    }\n}\n\n\/\/ FIXME: taken from GrVkPipelineState; refactor.\nstatic uint32_t get_blend_info_key(const GrPipeline& pipeline) {\n    GrXferProcessor::BlendInfo blendInfo = pipeline.getXferProcessor().getBlendInfo();\n\n    static const uint32_t kBlendWriteShift = 1;\n    static const uint32_t kBlendCoeffShift = 5;\n    static_assert(kLast_GrBlendCoeff < (1 << kBlendCoeffShift));\n    static_assert(kFirstAdvancedGrBlendEquation - 1 < 4);\n\n    uint32_t key = blendInfo.fWriteColor;\n    key |= (blendInfo.fSrcBlend << kBlendWriteShift);\n    key |= (blendInfo.fDstBlend << (kBlendWriteShift + kBlendCoeffShift));\n    key |= (blendInfo.fEquation << (kBlendWriteShift + 2 * kBlendCoeffShift));\n\n    return key;\n}\n\nGrProgramDesc GrDawnCaps::makeDesc(const GrRenderTarget* rt,\n                                   const GrProgramInfo& programInfo) const {\n    GrProgramDesc desc;\n    if (!GrProgramDesc::Build(&desc, rt, programInfo, *this)) {\n        SkASSERT(!desc.isValid());\n        return desc;\n    }\n\n    wgpu::TextureFormat format;\n    if (!programInfo.backendFormat().asDawnFormat(&format)) {\n        desc.key().reset();\n        SkASSERT(!desc.isValid());\n        return desc;\n    }\n\n    GrProcessorKeyBuilder b(&desc.key());\n\n    GrStencilSettings stencil = programInfo.nonGLStencilSettings();\n    stencil.genKey(&b);\n\n    \/\/ TODO: remove this reliance on the renderTarget\n    bool hasDepthStencil = rt->renderTargetPriv().getStencilAttachment() != nullptr;\n\n    b.add32(static_cast<uint32_t>(format));\n    b.add32(static_cast<int32_t>(hasDepthStencil));\n    b.add32(get_blend_info_key(programInfo.pipeline()));\n    b.add32(programInfo.primitiveTypeKey());\n    return desc;\n}\n\n#if GR_TEST_UTILS\nstd::vector<GrCaps::TestFormatColorTypeCombination> GrDawnCaps::getTestingCombinations() const {\n    std::vector<GrCaps::TestFormatColorTypeCombination> combos = {\n        { GrColorType::kAlpha_8,   GrBackendFormat::MakeDawn(wgpu::TextureFormat::R8Unorm)    },\n        { GrColorType::kRGBA_8888, GrBackendFormat::MakeDawn(wgpu::TextureFormat::RGBA8Unorm) },\n        { GrColorType::kRGBA_8888, GrBackendFormat::MakeDawn(wgpu::TextureFormat::BGRA8Unorm) },\n        { GrColorType::kRGB_888x,  GrBackendFormat::MakeDawn(wgpu::TextureFormat::RGBA8Unorm) },\n        { GrColorType::kRGB_888x,  GrBackendFormat::MakeDawn(wgpu::TextureFormat::BGRA8Unorm) },\n        { GrColorType::kBGRA_8888, GrBackendFormat::MakeDawn(wgpu::TextureFormat::BGRA8Unorm) },\n        { GrColorType::kBGRA_8888, GrBackendFormat::MakeDawn(wgpu::TextureFormat::RGBA8Unorm) },\n    };\n\n#ifdef SK_DEBUG\n    for (auto combo : combos) {\n        SkASSERT(this->onAreColorTypeAndFormatCompatible(combo.fColorType, combo.fFormat));\n    }\n#endif\n    return combos;\n}\n#endif\n<commit_msg>Turn off mip map support in GrDawnCaps<commit_after>\/*\n * Copyright 2019 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 \"src\/gpu\/dawn\/GrDawnCaps.h\"\n\n#include \"src\/gpu\/GrProgramDesc.h\"\n#include \"src\/gpu\/GrProgramInfo.h\"\n#include \"src\/gpu\/GrRenderTarget.h\"\n#include \"src\/gpu\/GrRenderTargetPriv.h\"\n#include \"src\/gpu\/GrStencilSettings.h\"\n\nGrDawnCaps::GrDawnCaps(const GrContextOptions& contextOptions) : INHERITED(contextOptions) {\n    fMipMapSupport = false;  \/\/ FIXME: implement onRegenerateMipMapLevels in GrDawnGpu.\n    fBufferMapThreshold = SK_MaxS32;  \/\/ FIXME: get this from Dawn?\n    fShaderCaps.reset(new GrShaderCaps(contextOptions));\n    fMaxTextureSize = fMaxRenderTargetSize = 4096; \/\/ FIXME\n    fMaxVertexAttributes = 16; \/\/ FIXME\n    fClampToBorderSupport = false;\n    fPerformPartialClearsAsDraws = true;\n    fDynamicStateArrayGeometryProcessorTextureSupport = true;\n\n    fShaderCaps->fFlatInterpolationSupport = true;\n    fShaderCaps->fIntegerSupport = true;\n    \/\/ FIXME: each fragment sampler takes two binding slots in Dawn (sampler + texture). Limit to\n    \/\/ 6 * 2 = 12, since kMaxBindingsPerGroup is 16 in Dawn, and we need to keep a few for\n    \/\/ non-texture bindings. Eventually, we may be able to increase kMaxBindingsPerGroup in Dawn.\n    fShaderCaps->fMaxFragmentSamplers = 6;\n    fShaderCaps->fShaderDerivativeSupport = true;\n\n    this->finishInitialization(contextOptions);\n}\n\nbool GrDawnCaps::isFormatSRGB(const GrBackendFormat& format) const {\n    return false;\n}\n\nSkImage::CompressionType GrDawnCaps::compressionType(const GrBackendFormat& format) const {\n    return SkImage::CompressionType::kNone;\n}\n\nbool GrDawnCaps::isFormatTexturable(const GrBackendFormat& format) const {\n    \/\/ Currently, all the formats in GrDawnFormatToPixelConfig are texturable.\n    wgpu::TextureFormat dawnFormat;\n    return format.asDawnFormat(&dawnFormat);\n}\n\nstatic GrSwizzle get_swizzle(const GrBackendFormat& format, GrColorType colorType,\n                             bool forOutput) {\n    switch (colorType) {\n        case GrColorType::kAlpha_8: \/\/ fall through\n        case GrColorType::kAlpha_F16:\n            if (forOutput) {\n                return GrSwizzle::AAAA();\n            } else {\n                return GrSwizzle::RRRR();\n            }\n        case GrColorType::kGray_8:\n            if (!forOutput) {\n                return GrSwizzle::RRRA();\n            }\n            break;\n        case GrColorType::kRGB_888x:\n            if (!forOutput) {\n                return GrSwizzle::RGB1();\n            }\n        default:\n            return GrSwizzle::RGBA();\n    }\n    return GrSwizzle::RGBA();\n}\n\nbool GrDawnCaps::isFormatTexturableAndUploadable(GrColorType ct,\n                                                 const GrBackendFormat& format) const {\n    wgpu::TextureFormat dawnFormat;\n    if (!format.asDawnFormat(&dawnFormat)) {\n        return false;\n    }\n    switch (ct) {\n        case GrColorType::kAlpha_8:\n            return wgpu::TextureFormat::R8Unorm == dawnFormat;\n        case GrColorType::kRGBA_8888:\n        case GrColorType::kRGB_888x:\n        case GrColorType::kBGRA_8888:\n            return wgpu::TextureFormat::RGBA8Unorm == dawnFormat ||\n                   wgpu::TextureFormat::BGRA8Unorm == dawnFormat;\n        default:\n            return false;\n    }\n}\n\nbool GrDawnCaps::isFormatRenderable(const GrBackendFormat& format,\n                                    int sampleCount) const {\n    wgpu::TextureFormat dawnFormat;\n    if (!format.isValid() || sampleCount > 1 || !format.asDawnFormat(&dawnFormat)) {\n        return false;\n    }\n\n    return GrDawnFormatIsRenderable(dawnFormat);\n}\n\nbool GrDawnCaps::isFormatAsColorTypeRenderable(GrColorType ct, const GrBackendFormat& format,\n                                               int sampleCount) const {\n    return isFormatRenderable(format, sampleCount);\n}\n\nsize_t GrDawnCaps::bytesPerPixel(const GrBackendFormat& backendFormat) const {\n    wgpu::TextureFormat dawnFormat;\n    if (!backendFormat.asDawnFormat(&dawnFormat)) {\n        return 0;\n    }\n    return GrDawnBytesPerPixel(dawnFormat);\n}\n\nint GrDawnCaps::getRenderTargetSampleCount(int requestedCount,\n                                           const GrBackendFormat& backendFormat) const {\n    wgpu::TextureFormat dawnFormat;\n    if (!backendFormat.asDawnFormat(&dawnFormat)) {\n        return 0;\n    }\n    return GrDawnFormatIsRenderable(dawnFormat) ? 1 : 0;\n}\n\nint GrDawnCaps::maxRenderTargetSampleCount(const GrBackendFormat& format) const {\n    return format.isValid() ? 1 : 0;\n}\n\nGrBackendFormat GrDawnCaps::onGetDefaultBackendFormat(GrColorType ct,\n                                                      GrRenderable renderable) const {\n    wgpu::TextureFormat format;\n    if (!GrColorTypeToDawnFormat(ct, &format)) {\n        return GrBackendFormat();\n    }\n    return GrBackendFormat::MakeDawn(format);\n}\n\nGrBackendFormat GrDawnCaps::getBackendFormatFromCompressionType(SkImage::CompressionType type) const\n{\n    return GrBackendFormat();\n}\n\nGrSwizzle GrDawnCaps::getReadSwizzle(const GrBackendFormat& format, GrColorType colorType) const\n{\n    return get_swizzle(format, colorType, false);\n}\n\nGrSwizzle GrDawnCaps::getOutputSwizzle(const GrBackendFormat& format, GrColorType colorType) const\n{\n    return get_swizzle(format, colorType, true);\n}\n\nuint64_t GrDawnCaps::computeFormatKey(const GrBackendFormat& format) const {\n    wgpu::TextureFormat dawnFormat;\n    SkAssertResult(format.asDawnFormat(&dawnFormat));\n\n    \/\/ Dawn max enum value should always fit in 32 bits.\n\n    \/\/ disabled: no member named 'WGPUTextureFormat_Force32' in namespace 'wgpu'\n    \/\/SkASSERT(dawnFormat <= wgpu::WGPUTextureFormat_Force32);\n    return (uint64_t)dawnFormat;\n}\n\nbool GrDawnCaps::onAreColorTypeAndFormatCompatible(GrColorType ct,\n                                                   const GrBackendFormat& format) const {\n    return true;\n}\n\nGrColorType GrDawnCaps::getYUVAColorTypeFromBackendFormat(const GrBackendFormat& backendFormat,\n                                                          bool isAlphaChannel) const {\n    wgpu::TextureFormat textureFormat;\n    if (!backendFormat.asDawnFormat(&textureFormat)) {\n        return GrColorType::kUnknown;\n    }\n    switch (textureFormat) {\n        case wgpu::TextureFormat::R8Unorm:     return isAlphaChannel ? GrColorType::kAlpha_8\n                                                                     : GrColorType::kGray_8;\n        case wgpu::TextureFormat::RGBA8Unorm:  return GrColorType::kRGBA_8888;\n        case wgpu::TextureFormat::BGRA8Unorm:  return GrColorType::kBGRA_8888;\n        default:                               return GrColorType::kUnknown;\n    }\n}\n\n\/\/ FIXME: taken from GrVkPipelineState; refactor.\nstatic uint32_t get_blend_info_key(const GrPipeline& pipeline) {\n    GrXferProcessor::BlendInfo blendInfo = pipeline.getXferProcessor().getBlendInfo();\n\n    static const uint32_t kBlendWriteShift = 1;\n    static const uint32_t kBlendCoeffShift = 5;\n    static_assert(kLast_GrBlendCoeff < (1 << kBlendCoeffShift));\n    static_assert(kFirstAdvancedGrBlendEquation - 1 < 4);\n\n    uint32_t key = blendInfo.fWriteColor;\n    key |= (blendInfo.fSrcBlend << kBlendWriteShift);\n    key |= (blendInfo.fDstBlend << (kBlendWriteShift + kBlendCoeffShift));\n    key |= (blendInfo.fEquation << (kBlendWriteShift + 2 * kBlendCoeffShift));\n\n    return key;\n}\n\nGrProgramDesc GrDawnCaps::makeDesc(const GrRenderTarget* rt,\n                                   const GrProgramInfo& programInfo) const {\n    GrProgramDesc desc;\n    if (!GrProgramDesc::Build(&desc, rt, programInfo, *this)) {\n        SkASSERT(!desc.isValid());\n        return desc;\n    }\n\n    wgpu::TextureFormat format;\n    if (!programInfo.backendFormat().asDawnFormat(&format)) {\n        desc.key().reset();\n        SkASSERT(!desc.isValid());\n        return desc;\n    }\n\n    GrProcessorKeyBuilder b(&desc.key());\n\n    GrStencilSettings stencil = programInfo.nonGLStencilSettings();\n    stencil.genKey(&b);\n\n    \/\/ TODO: remove this reliance on the renderTarget\n    bool hasDepthStencil = rt->renderTargetPriv().getStencilAttachment() != nullptr;\n\n    b.add32(static_cast<uint32_t>(format));\n    b.add32(static_cast<int32_t>(hasDepthStencil));\n    b.add32(get_blend_info_key(programInfo.pipeline()));\n    b.add32(programInfo.primitiveTypeKey());\n    return desc;\n}\n\n#if GR_TEST_UTILS\nstd::vector<GrCaps::TestFormatColorTypeCombination> GrDawnCaps::getTestingCombinations() const {\n    std::vector<GrCaps::TestFormatColorTypeCombination> combos = {\n        { GrColorType::kAlpha_8,   GrBackendFormat::MakeDawn(wgpu::TextureFormat::R8Unorm)    },\n        { GrColorType::kRGBA_8888, GrBackendFormat::MakeDawn(wgpu::TextureFormat::RGBA8Unorm) },\n        { GrColorType::kRGBA_8888, GrBackendFormat::MakeDawn(wgpu::TextureFormat::BGRA8Unorm) },\n        { GrColorType::kRGB_888x,  GrBackendFormat::MakeDawn(wgpu::TextureFormat::RGBA8Unorm) },\n        { GrColorType::kRGB_888x,  GrBackendFormat::MakeDawn(wgpu::TextureFormat::BGRA8Unorm) },\n        { GrColorType::kBGRA_8888, GrBackendFormat::MakeDawn(wgpu::TextureFormat::BGRA8Unorm) },\n        { GrColorType::kBGRA_8888, GrBackendFormat::MakeDawn(wgpu::TextureFormat::RGBA8Unorm) },\n    };\n\n#ifdef SK_DEBUG\n    for (auto combo : combos) {\n        SkASSERT(this->onAreColorTypeAndFormatCompatible(combo.fColorType, combo.fFormat));\n    }\n#endif\n    return combos;\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n*\n* MIT License\n*\n* Copyright (c) 2019 Advanced Micro Devices, Inc.\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\n#include <miopen\/hip_build_utils.hpp>\n#include <miopen\/stringutils.hpp>\n#include <miopen\/exec_utils.hpp>\n#include <miopen\/logger.hpp>\n#include <miopen\/env.hpp>\n#include <boost\/optional.hpp>\n#include <sstream>\n#include <string>\n\nMIOPEN_DECLARE_ENV_VAR(MIOPEN_DEBUG_HIP_ENFORCE_COV3)\n\nnamespace miopen {\n\nnamespace {\n\ninline bool IsHccCompiler()\n{\n    static const auto isHcc = EndsWith(MIOPEN_HIP_COMPILER, \"hcc\");\n    return isHcc;\n}\n\ninline bool ProduceCoV3()\n{\n    \/\/ If env.var is set, then let's follow it.\n    if(IsEnabled(MIOPEN_DEBUG_HIP_ENFORCE_COV3{}))\n        return true;\n    if(IsDisabled(MIOPEN_DEBUG_HIP_ENFORCE_COV3{}))\n        return false;\n    \/\/ Otherwise, let's enable CO v3 for HIP kernels since ROCm 3.0.\n    return (HipGetHccVersion() >= external_tool_version_t{3, 0, -1});\n}\n\n\/\/\/ Returns option for enabling\/disabling CO v3 generation for the compiler\n\/\/\/ that builds HIP kernels, depending on compiler version etc.\ninline const std::string& GetCoV3Option(const bool enable)\n{\n    \/\/\/ \\note PR #2166 uses the \"--hcc-cov3\" option when isHCC is true.\n    \/\/\/ It's unclear why... HCC included in ROCm 2.8 does not support it,\n    \/\/\/ perhaps it suits for some older HCC?\n    \/\/\/\n    \/\/\/ These options are Ok for ROCm 3.0:\n    static const std::string option_enable{\"-mcode-object-v3\"};\n    static const std::string no_option{};\n    if(enable)\n        return option_enable;\n    else\n        return no_option;\n}\n} \/\/ namespace\n\nboost::filesystem::path HipBuild(boost::optional<TmpDir>& tmp_dir,\n                                 const std::string& filename,\n                                 std::string src,\n                                 std::string params,\n                                 const std::string& dev_name)\n{\n#ifdef __linux__\n    \/\/ write out the include files\n    auto inc_list = GetKernelIncList();\n    auto inc_path = tmp_dir->path;\n    boost::filesystem::create_directories(inc_path);\n    for(auto inc_file : inc_list)\n    {\n        auto inc_src = GetKernelInc(inc_file);\n        WriteFile(inc_src, inc_path \/ inc_file);\n    }\n    src += \"\\nint main() {}\\n\";\n    WriteFile(src, tmp_dir->path \/ filename);\n    if(IsHccCompiler())\n    {\n        params += \" -amdgpu-target=\" + dev_name;\n    }\n    else\n    {\n        if(params.find(\"-std=\") == std::string::npos)\n            params += \" --std=c++11\";\n        params += \" --cuda-gpu-arch=\" + dev_name;\n        params += \" --cuda-device-only -c\";\n        params += \" -O3 -mllvm -amdgpu-early-inline-all=true -mllvm -amdgpu-function-calls=false\";\n    }\n    params += \" \" + GetCoV3Option(ProduceCoV3());\n\n    \/\/ params += \" -Wno-unused-command-line-argument -c -fno-gpu-rdc -I. \";\n    params += \" -Wno-unused-command-line-argument -I. \";\n    params += MIOPEN_STRINGIZE(HIP_COMPILER_FLAGS);\n    params += \" \";\n    auto bin_file = tmp_dir->path \/ (filename + \".o\");\n    \/\/ compile\n    auto env = std::string(\"KMOPTLLC=\\\"-mattr=+enable-ds128 -amdgpu-enable-global-sgpr-addr\");\n    if(miopen::HipGetHccVersion() >= external_tool_version_t{2, 8, 0})\n        env += \" --amdgpu-spill-vgpr-to-agpr=0\";\n    env += '\\\"';\n    tmp_dir->Execute(env + std::string(\" \") + MIOPEN_HIP_COMPILER,\n                     params + filename + \" -o \" + bin_file.string());\n    if(!boost::filesystem::exists(bin_file))\n        MIOPEN_THROW(filename + \" failed to compile\");\n#ifdef EXTRACTKERNEL_BIN\n    if(IsHccCompiler())\n    {\n        \/\/ call extract kernel\n        tmp_dir->Execute(EXTRACTKERNEL_BIN, \" -i \" + bin_file.string());\n        auto hsaco =\n            std::find_if(boost::filesystem::directory_iterator{tmp_dir->path},\n                         {},\n                         [](auto entry) { return (entry.path().extension() == \".hsaco\"); });\n\n        if(hsaco == boost::filesystem::directory_iterator{})\n        {\n            MIOPEN_LOG_E(\"failed to find *.hsaco in \" << hsaco->path().string());\n        }\n\n        return hsaco->path();\n    }\n    else\n#endif\n    {\n        return bin_file;\n    }\n#else\n    (void)filename;\n    (void)params;\n    MIOPEN_THROW(\"HIP kernels are only supported in Linux\");\n#endif\n}\n\nvoid bin_file_to_str(const boost::filesystem::path& file, std::string& buf)\n{\n    std::ifstream bin_file_ptr(file.string().c_str(), std::ios::binary);\n    std::ostringstream bin_file_strm;\n    bin_file_strm << bin_file_ptr.rdbuf();\n    buf = bin_file_strm.str();\n}\n\nstatic external_tool_version_t HipGetHccVersionImpl()\n{\n    external_tool_version_t hcc_version;\n    const std::string path(MIOPEN_HIP_COMPILER);\n    const std::string mandatory_prefix(\"(based on HCC \");\n    do\n    {\n        if(path.empty() || !std::ifstream(path).good())\n            break;\n\n        std::stringstream out;\n        MIOPEN_LOG_NQI2(\"Running: \" << '\\'' << path << \" --version\" << '\\'');\n        if(miopen::exec::Run(path + \" --version\", nullptr, &out) != 0)\n            break;\n\n        std::string line;\n        while(!out.eof())\n        {\n            std::getline(out, line);\n            MIOPEN_LOG_NQI2(line);\n            auto begin = line.find(mandatory_prefix);\n            if(begin == std::string::npos)\n                continue;\n\n            begin += mandatory_prefix.size();\n            int v3, v2, v1 = v2 = v3 = -1;\n            char c2, c1 = c2 = 'X';\n            std::istringstream iss(line.substr(begin));\n            iss >> v1 >> c1 >> v2 >> c2 >> v3;\n            if(!iss.fail() && v1 >= 0)\n            {\n                hcc_version.major = v1;\n                if(c1 == '.' && v2 >= 0)\n                {\n                    hcc_version.minor = v2;\n                    if(c2 == '.' && v3 >= 0)\n                        hcc_version.patch = v3;\n                }\n            }\n            break;\n        }\n    } while(false);\n    MIOPEN_LOG_NQI(\"HCC base: \" << hcc_version.major << '.' << hcc_version.minor << '.'\n                                << hcc_version.patch);\n    return hcc_version;\n}\n\nexternal_tool_version_t HipGetHccVersion()\n{\n    static auto once = HipGetHccVersionImpl();\n    return once;\n}\n\nbool external_tool_version_t::operator>=(const external_tool_version_t& rhs) const\n{\n    if(major > rhs.major)\n        return true;\n    else if(major == rhs.major)\n    {\n        if(minor > rhs.minor)\n            return true;\n        else if(minor == rhs.minor)\n            return (patch >= rhs.patch);\n        else\n            return false;\n    }\n    else\n        return false;\n}\n\n} \/\/ namespace miopen\n<commit_msg>Remove hip-clang internal flags (#2508)<commit_after>\/*******************************************************************************\n*\n* MIT License\n*\n* Copyright (c) 2019 Advanced Micro Devices, Inc.\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\n#include <miopen\/hip_build_utils.hpp>\n#include <miopen\/stringutils.hpp>\n#include <miopen\/exec_utils.hpp>\n#include <miopen\/logger.hpp>\n#include <miopen\/env.hpp>\n#include <boost\/optional.hpp>\n#include <sstream>\n#include <string>\n\nMIOPEN_DECLARE_ENV_VAR(MIOPEN_DEBUG_HIP_ENFORCE_COV3)\n\nnamespace miopen {\n\nnamespace {\n\ninline bool IsHccCompiler()\n{\n    static const auto isHcc = EndsWith(MIOPEN_HIP_COMPILER, \"hcc\");\n    return isHcc;\n}\n\ninline bool ProduceCoV3()\n{\n    \/\/ If env.var is set, then let's follow it.\n    if(IsEnabled(MIOPEN_DEBUG_HIP_ENFORCE_COV3{}))\n        return true;\n    if(IsDisabled(MIOPEN_DEBUG_HIP_ENFORCE_COV3{}))\n        return false;\n    \/\/ Otherwise, let's enable CO v3 for HIP kernels since ROCm 3.0.\n    return (HipGetHccVersion() >= external_tool_version_t{3, 0, -1});\n}\n\n\/\/\/ Returns option for enabling\/disabling CO v3 generation for the compiler\n\/\/\/ that builds HIP kernels, depending on compiler version etc.\ninline const std::string& GetCoV3Option(const bool enable)\n{\n    \/\/\/ \\note PR #2166 uses the \"--hcc-cov3\" option when isHCC is true.\n    \/\/\/ It's unclear why... HCC included in ROCm 2.8 does not support it,\n    \/\/\/ perhaps it suits for some older HCC?\n    \/\/\/\n    \/\/\/ These options are Ok for ROCm 3.0:\n    static const std::string option_enable{\"-mcode-object-v3\"};\n    static const std::string no_option{};\n    if(enable)\n        return option_enable;\n    else\n        return no_option;\n}\n} \/\/ namespace\n\nboost::filesystem::path HipBuild(boost::optional<TmpDir>& tmp_dir,\n                                 const std::string& filename,\n                                 std::string src,\n                                 std::string params,\n                                 const std::string& dev_name)\n{\n#ifdef __linux__\n    \/\/ write out the include files\n    auto inc_list = GetKernelIncList();\n    auto inc_path = tmp_dir->path;\n    boost::filesystem::create_directories(inc_path);\n    for(auto inc_file : inc_list)\n    {\n        auto inc_src = GetKernelInc(inc_file);\n        WriteFile(inc_src, inc_path \/ inc_file);\n    }\n    src += \"\\nint main() {}\\n\";\n    WriteFile(src, tmp_dir->path \/ filename);\n    if(IsHccCompiler())\n    {\n        params += \" -amdgpu-target=\" + dev_name;\n    }\n    else\n    {\n        if(params.find(\"-std=\") == std::string::npos)\n            params += \" --std=c++11\";\n        params += \" --cuda-gpu-arch=\" + dev_name;\n        params += \" --cuda-device-only -c\";\n        params += \" -O3 \";\n    }\n    params += \" \" + GetCoV3Option(ProduceCoV3());\n\n    \/\/ params += \" -Wno-unused-command-line-argument -c -fno-gpu-rdc -I. \";\n    params += \" -Wno-unused-command-line-argument -I. \";\n    params += MIOPEN_STRINGIZE(HIP_COMPILER_FLAGS);\n    params += \" \";\n    auto bin_file = tmp_dir->path \/ (filename + \".o\");\n    \/\/ compile\n    auto env = std::string(\"KMOPTLLC=\\\"-mattr=+enable-ds128 -amdgpu-enable-global-sgpr-addr\");\n    if(miopen::HipGetHccVersion() >= external_tool_version_t{2, 8, 0})\n        env += \" --amdgpu-spill-vgpr-to-agpr=0\";\n    env += '\\\"';\n    tmp_dir->Execute(env + std::string(\" \") + MIOPEN_HIP_COMPILER,\n                     params + filename + \" -o \" + bin_file.string());\n    if(!boost::filesystem::exists(bin_file))\n        MIOPEN_THROW(filename + \" failed to compile\");\n#ifdef EXTRACTKERNEL_BIN\n    if(IsHccCompiler())\n    {\n        \/\/ call extract kernel\n        tmp_dir->Execute(EXTRACTKERNEL_BIN, \" -i \" + bin_file.string());\n        auto hsaco =\n            std::find_if(boost::filesystem::directory_iterator{tmp_dir->path},\n                         {},\n                         [](auto entry) { return (entry.path().extension() == \".hsaco\"); });\n\n        if(hsaco == boost::filesystem::directory_iterator{})\n        {\n            MIOPEN_LOG_E(\"failed to find *.hsaco in \" << hsaco->path().string());\n        }\n\n        return hsaco->path();\n    }\n    else\n#endif\n    {\n        return bin_file;\n    }\n#else\n    (void)filename;\n    (void)params;\n    MIOPEN_THROW(\"HIP kernels are only supported in Linux\");\n#endif\n}\n\nvoid bin_file_to_str(const boost::filesystem::path& file, std::string& buf)\n{\n    std::ifstream bin_file_ptr(file.string().c_str(), std::ios::binary);\n    std::ostringstream bin_file_strm;\n    bin_file_strm << bin_file_ptr.rdbuf();\n    buf = bin_file_strm.str();\n}\n\nstatic external_tool_version_t HipGetHccVersionImpl()\n{\n    external_tool_version_t hcc_version;\n    const std::string path(MIOPEN_HIP_COMPILER);\n    const std::string mandatory_prefix(\"(based on HCC \");\n    do\n    {\n        if(path.empty() || !std::ifstream(path).good())\n            break;\n\n        std::stringstream out;\n        MIOPEN_LOG_NQI2(\"Running: \" << '\\'' << path << \" --version\" << '\\'');\n        if(miopen::exec::Run(path + \" --version\", nullptr, &out) != 0)\n            break;\n\n        std::string line;\n        while(!out.eof())\n        {\n            std::getline(out, line);\n            MIOPEN_LOG_NQI2(line);\n            auto begin = line.find(mandatory_prefix);\n            if(begin == std::string::npos)\n                continue;\n\n            begin += mandatory_prefix.size();\n            int v3, v2, v1 = v2 = v3 = -1;\n            char c2, c1 = c2 = 'X';\n            std::istringstream iss(line.substr(begin));\n            iss >> v1 >> c1 >> v2 >> c2 >> v3;\n            if(!iss.fail() && v1 >= 0)\n            {\n                hcc_version.major = v1;\n                if(c1 == '.' && v2 >= 0)\n                {\n                    hcc_version.minor = v2;\n                    if(c2 == '.' && v3 >= 0)\n                        hcc_version.patch = v3;\n                }\n            }\n            break;\n        }\n    } while(false);\n    MIOPEN_LOG_NQI(\"HCC base: \" << hcc_version.major << '.' << hcc_version.minor << '.'\n                                << hcc_version.patch);\n    return hcc_version;\n}\n\nexternal_tool_version_t HipGetHccVersion()\n{\n    static auto once = HipGetHccVersionImpl();\n    return once;\n}\n\nbool external_tool_version_t::operator>=(const external_tool_version_t& rhs) const\n{\n    if(major > rhs.major)\n        return true;\n    else if(major == rhs.major)\n    {\n        if(minor > rhs.minor)\n            return true;\n        else if(minor == rhs.minor)\n            return (patch >= rhs.patch);\n        else\n            return false;\n    }\n    else\n        return false;\n}\n\n} \/\/ namespace miopen\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <stdint.h>\n\n\/* Comment out this line for a non-test network *\/\n\/\/ #define BTS_TEST_NETWORK\n\/\/ #define BTS_TEST_NETWORK_VERSION                            10 \/\/ autogenerated\n\n\/** @file bts\/blockchain\/config.hpp\n *  @brief Defines global constants that determine blockchain behavior\n *\/\n#define BTS_TEST_NETWORK_VERSION                            21 \/\/ autogenerated\n#define BTS_BLOCKCHAIN_DATABASE_VERSION                     11\n\n\/**\n *  The address prepended to string representation of\n *  addresses.\n *\n *  Changing these parameters will result in a hard fork.\n *\/\n#define BTS_ADDRESS_PREFIX                                  \"PLS\"\n#define BTS_BLOCKCHAIN_SYMBOL                               \"PLS\"\n#define BTS_BLOCKCHAIN_NAME                                 \"BitShares PLAY\"\n#define BTS_BLOCKCHAIN_DESCRIPTION                          \"BitShares PLAY DryRun Network\"\n\n#define BTS_BLOCKCHAIN_PRECISION                            100000\n\n#define BTS_BLOCKCHAIN_MAX_UIA_MARKET_FEE                   10000\n#define BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC                   int64_t(10)\n#define BTS_BLOCKCHAIN_BLOCKS_PER_HOUR                      ((60*60)\/BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n#define BTS_BLOCKCHAIN_BLOCKS_PER_DAY                       (BTS_BLOCKCHAIN_BLOCKS_PER_HOUR*int64_t(24))\n#define BTS_BLOCKCHAIN_BLOCKS_PER_YEAR                      (BTS_BLOCKCHAIN_BLOCKS_PER_DAY*int64_t(365))\n\n#define BTS_BLOCKCHAIN_NUM_DELEGATES                        uint32_t(101)\n#define BTS_MAX_DELEGATE_PAY_PER_BLOCK                      int64_t( 50 * BTS_BLOCKCHAIN_PRECISION ) \/\/ 50 XTS\n#define BTS_BLOCKCHAIN_MAX_UNDO_HISTORY                     BTS_BLOCKCHAIN_BLOCKS_PER_HOUR\n\n#define BTS_BLOCKCHAIN_MAX_SLATE_SIZE                       (BTS_BLOCKCHAIN_NUM_DELEGATES + (BTS_BLOCKCHAIN_NUM_DELEGATES\/10))\n#define BTS_BLOCKCHAIN_MAX_TRANSACTION_EXPIRATION_SEC       (60*60*24*2)\n#define BTS_BLOCKCHAIN_MAX_MEMO_SIZE                        19 \/\/ bytes\n#define BTS_BLOCKCHAIN_EXTENDED_MEMO_SIZE                   32 \/\/ bytes\n#define BTS_BLOCKCHAIN_MAX_EXTENDED_MEMO_SIZE               (BTS_BLOCKCHAIN_MAX_MEMO_SIZE + BTS_BLOCKCHAIN_EXTENDED_MEMO_SIZE)\n\n\/**\n *  The maximum amount that can be issued for user assets.\n *\n *  10^18 \/ 2^63 < 1  however, to support representing all share values as a double in\n *  languages like java script, we must stay within the epsilon so\n *\n *  10^15 \/ 2^53 < 1 allows all values to be represented as a double or an int64\n *\/\n#define BTS_BLOCKCHAIN_MAX_SHARES                           (1000*1000*int64_t(1000)*1000*int64_t(1000))\n\n#define BTS_BLOCKCHAIN_MIN_NAME_SIZE                        1\n#define BTS_BLOCKCHAIN_MAX_NAME_SIZE                        63\n#define BTS_BLOCKCHAIN_MAX_NAME_DATA_SIZE                   (1024*64)\n\n#define BTS_BLOCKCHAIN_MAX_SUB_SYMBOL_SIZE                  8 \/\/ characters\n#define BTS_BLOCKCHAIN_MIN_SYMBOL_SIZE                      3 \/\/ characters\n#define BTS_BLOCKCHAIN_MAX_SYMBOL_SIZE                      12 \/\/ characters\n\n#define BTS_BLOCKCHAIN_MIN_BURN_FEE                         BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               10\n#else\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               (60*60) \/\/ 1 hour\n#endif\n\n#define BTS_BLOCKCHAIN_MIN_FEEDS                            ((BTS_BLOCKCHAIN_NUM_DELEGATES\/2) + 1)\n#define BTS_BLOCKCHAIN_MINIMUM_SHORT_ORDER_SIZE             (BTS_BLOCKCHAIN_PRECISION*100)\n#define BTS_BLOCKCHAIN_MIN_YIELD_PERIOD_SEC                 (60*60*24) \/\/ 24 hours\n#define BTS_BLOCKCHAIN_MAX_YIELD_PERIOD_SEC                 (BTS_BLOCKCHAIN_BLOCKS_PER_YEAR * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC) \/\/ 1 year\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (2*60*60) \/\/ 2 hours\n#else\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (30*24*60*60) \/\/ 1 month\n#endif\n\n#define BTS_BLOCKCHAIN_MCALL_D2C_NUMERATOR                  1\n#define BTS_BLOCKCHAIN_MCALL_D2C_DENOMINATOR                2\n\n\/\/ TODO: This stuff only matters for propagation throttling; should go somewhere else\n#define BTS_BLOCKCHAIN_DEFAULT_RELAY_FEE                    10000 \/\/ XTS\n#define BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND                   1  \/\/ (10)\n#define BTS_BLOCKCHAIN_MAX_PENDING_QUEUE_SIZE               10 \/\/ (BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n<commit_msg>update BTS_BLOCKCHAIN_VERSION<commit_after>#pragma once\n\n#include <stdint.h>\n\n\/* Comment out this line for a non-test network *\/\n\/\/ #define BTS_TEST_NETWORK\n\/\/ #define BTS_TEST_NETWORK_VERSION                            10 \/\/ autogenerated\n\n\/** @file bts\/blockchain\/config.hpp\n *  @brief Defines global constants that determine blockchain behavior\n *\/\n#define BTS_BLOCKCHAIN_VERSION                            21 \/\/ autogenerated\n#define BTS_BLOCKCHAIN_DATABASE_VERSION                     11\n\n\/**\n *  The address prepended to string representation of\n *  addresses.\n *\n *  Changing these parameters will result in a hard fork.\n *\/\n#define BTS_ADDRESS_PREFIX                                  \"PLS\"\n#define BTS_BLOCKCHAIN_SYMBOL                               \"PLS\"\n#define BTS_BLOCKCHAIN_NAME                                 \"BitShares PLAY\"\n#define BTS_BLOCKCHAIN_DESCRIPTION                          \"BitShares PLAY DryRun Network\"\n\n#define BTS_BLOCKCHAIN_PRECISION                            100000\n\n#define BTS_BLOCKCHAIN_MAX_UIA_MARKET_FEE                   10000\n#define BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC                   int64_t(10)\n#define BTS_BLOCKCHAIN_BLOCKS_PER_HOUR                      ((60*60)\/BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\n#define BTS_BLOCKCHAIN_BLOCKS_PER_DAY                       (BTS_BLOCKCHAIN_BLOCKS_PER_HOUR*int64_t(24))\n#define BTS_BLOCKCHAIN_BLOCKS_PER_YEAR                      (BTS_BLOCKCHAIN_BLOCKS_PER_DAY*int64_t(365))\n\n#define BTS_BLOCKCHAIN_NUM_DELEGATES                        uint32_t(101)\n#define BTS_MAX_DELEGATE_PAY_PER_BLOCK                      int64_t( 50 * BTS_BLOCKCHAIN_PRECISION ) \/\/ 50 XTS\n#define BTS_BLOCKCHAIN_MAX_UNDO_HISTORY                     BTS_BLOCKCHAIN_BLOCKS_PER_HOUR\n\n#define BTS_BLOCKCHAIN_MAX_SLATE_SIZE                       (BTS_BLOCKCHAIN_NUM_DELEGATES + (BTS_BLOCKCHAIN_NUM_DELEGATES\/10))\n#define BTS_BLOCKCHAIN_MAX_TRANSACTION_EXPIRATION_SEC       (60*60*24*2)\n#define BTS_BLOCKCHAIN_MAX_MEMO_SIZE                        19 \/\/ bytes\n#define BTS_BLOCKCHAIN_EXTENDED_MEMO_SIZE                   32 \/\/ bytes\n#define BTS_BLOCKCHAIN_MAX_EXTENDED_MEMO_SIZE               (BTS_BLOCKCHAIN_MAX_MEMO_SIZE + BTS_BLOCKCHAIN_EXTENDED_MEMO_SIZE)\n\n\/**\n *  The maximum amount that can be issued for user assets.\n *\n *  10^18 \/ 2^63 < 1  however, to support representing all share values as a double in\n *  languages like java script, we must stay within the epsilon so\n *\n *  10^15 \/ 2^53 < 1 allows all values to be represented as a double or an int64\n *\/\n#define BTS_BLOCKCHAIN_MAX_SHARES                           (1000*1000*int64_t(1000)*1000*int64_t(1000))\n\n#define BTS_BLOCKCHAIN_MIN_NAME_SIZE                        1\n#define BTS_BLOCKCHAIN_MAX_NAME_SIZE                        63\n#define BTS_BLOCKCHAIN_MAX_NAME_DATA_SIZE                   (1024*64)\n\n#define BTS_BLOCKCHAIN_MAX_SUB_SYMBOL_SIZE                  8 \/\/ characters\n#define BTS_BLOCKCHAIN_MIN_SYMBOL_SIZE                      3 \/\/ characters\n#define BTS_BLOCKCHAIN_MAX_SYMBOL_SIZE                      12 \/\/ characters\n\n#define BTS_BLOCKCHAIN_MIN_BURN_FEE                         BTS_BLOCKCHAIN_PRECISION * 1 \/\/ 1 XTS\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               10\n#else\n#define BTS_BLOCKCHAIN_VOTE_UPDATE_PERIOD_SEC               (60*60) \/\/ 1 hour\n#endif\n\n#define BTS_BLOCKCHAIN_MIN_FEEDS                            ((BTS_BLOCKCHAIN_NUM_DELEGATES\/2) + 1)\n#define BTS_BLOCKCHAIN_MINIMUM_SHORT_ORDER_SIZE             (BTS_BLOCKCHAIN_PRECISION*100)\n#define BTS_BLOCKCHAIN_MIN_YIELD_PERIOD_SEC                 (60*60*24) \/\/ 24 hours\n#define BTS_BLOCKCHAIN_MAX_YIELD_PERIOD_SEC                 (BTS_BLOCKCHAIN_BLOCKS_PER_YEAR * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC) \/\/ 1 year\n\n#ifdef BTS_TEST_NETWORK\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (2*60*60) \/\/ 2 hours\n#else\n#define BTS_BLOCKCHAIN_MAX_SHORT_PERIOD_SEC                 (30*24*60*60) \/\/ 1 month\n#endif\n\n#define BTS_BLOCKCHAIN_MCALL_D2C_NUMERATOR                  1\n#define BTS_BLOCKCHAIN_MCALL_D2C_DENOMINATOR                2\n\n\/\/ TODO: This stuff only matters for propagation throttling; should go somewhere else\n#define BTS_BLOCKCHAIN_DEFAULT_RELAY_FEE                    10000 \/\/ XTS\n#define BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND                   1  \/\/ (10)\n#define BTS_BLOCKCHAIN_MAX_PENDING_QUEUE_SIZE               10 \/\/ (BTS_BLOCKCHAIN_MAX_TRX_PER_SECOND * BTS_BLOCKCHAIN_BLOCK_INTERVAL_SEC)\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\/\/ CLASS  HEADER\n#include <dali\/internal\/text\/text-abstraction\/bidirectional-support-impl.h>\n\n\/\/ INTERNAL INCLUDES\n#include <dali\/internal\/system\/common\/singleton-service-impl.h>\n\n\/\/ EXTERNAL INCLUDES\n#include <memory.h>\n#include <fribidi\/fribidi.h>\n#include <dali\/integration-api\/debug.h>\n\nnamespace Dali\n{\n\nnamespace TextAbstraction\n{\n\nnamespace Internal\n{\n\nnamespace\n{\n  typedef unsigned char BidiDirection;\n\n  \/\/ Internal charcter's direction.\n  const BidiDirection LEFT_TO_RIGHT = 0u;\n  const BidiDirection NEUTRAL = 1u;\n  const BidiDirection RIGHT_TO_LEFT = 2u;\n\n  \/**\n   * @param[in] paragraphDirection The FriBiDi paragraph's direction.\n   *\n   * @return Whether the paragraph is right to left.\n   *\/\n  bool GetBidiParagraphDirection( FriBidiParType paragraphDirection )\n  {\n    switch( paragraphDirection )\n    {\n      case FRIBIDI_PAR_RTL:  \/\/ Right-To-Left paragraph.\n      case FRIBIDI_PAR_WRTL: \/\/ Weak Right To Left paragraph.\n      {\n        return true;\n      }\n      case FRIBIDI_PAR_LTR:  \/\/ Left-To-Right paragraph.\n      case FRIBIDI_PAR_ON:   \/\/ DirectiOn-Neutral paragraph.\n      case FRIBIDI_PAR_WLTR: \/\/ Weak Left To Right paragraph.\n      {\n        return false;\n      }\n    }\n\n    return false;\n  }\n\n  BidiDirection GetBidiCharacterDirection( FriBidiCharType characterDirection )\n  {\n    switch( characterDirection )\n    {\n      case FRIBIDI_TYPE_LTR: \/\/ Left-To-Right letter.\n      case FRIBIDI_TYPE_EN:  \/\/ European Numeral.\n      case FRIBIDI_TYPE_AN:  \/\/ Arabic Numeral.\n      case FRIBIDI_TYPE_ES:  \/\/ European number Separator.\n      case FRIBIDI_TYPE_ET:  \/\/ European number Terminator.\n      {\n        return LEFT_TO_RIGHT;\n      }\n      case FRIBIDI_TYPE_RTL: \/\/ Right-To-Left letter.\n      case FRIBIDI_TYPE_AL:  \/\/ Arabic Letter.\n      {\n        return RIGHT_TO_LEFT;\n      }\n    }\n\n    return NEUTRAL;\n  }\n}\n\nstruct BidirectionalSupport::Plugin\n{\n  \/**\n   * Stores bidirectional info per paragraph.\n   *\/\n  struct BidirectionalInfo\n  {\n    FriBidiCharType* characterTypes;      \/\/\/< The type of each character (right, left, neutral, ...)\n    FriBidiLevel*    embeddedLevels;      \/\/\/< Embedded levels.\n    FriBidiParType   paragraphDirection;  \/\/\/< The paragraph's direction.\n  };\n\n  Plugin()\n  : mParagraphBidirectionalInfo(),\n    mFreeIndices()\n  {}\n\n  ~Plugin()\n  {\n    \/\/ free all resources.\n    for( Vector<BidirectionalInfo*>::Iterator it = mParagraphBidirectionalInfo.Begin(),\n           endIt = mParagraphBidirectionalInfo.End();\n         it != endIt;\n         ++it )\n    {\n      BidirectionalInfo* info = *it;\n\n      free( info->embeddedLevels );\n      free( info->characterTypes );\n      delete info;\n    }\n  }\n\n  BidiInfoIndex CreateInfo( const Character* const paragraph,\n                            Length numberOfCharacters )\n  {\n    \/\/ Reserve memory for the paragraph's bidirectional info.\n    BidirectionalInfo* bidirectionalInfo = new BidirectionalInfo();\n\n    bidirectionalInfo->characterTypes = reinterpret_cast<FriBidiCharType*>( malloc( numberOfCharacters * sizeof( FriBidiCharType ) ) );\n    if( !bidirectionalInfo->characterTypes )\n    {\n      delete bidirectionalInfo;\n      return 0;\n    }\n\n    bidirectionalInfo->embeddedLevels = reinterpret_cast<FriBidiLevel*>( malloc( numberOfCharacters * sizeof( FriBidiLevel ) ) );\n    if( !bidirectionalInfo->embeddedLevels )\n    {\n      free( bidirectionalInfo->characterTypes );\n      delete bidirectionalInfo;\n      return 0;\n    }\n\n    \/\/ Retrieve the type of each character..\n    fribidi_get_bidi_types( paragraph, numberOfCharacters, bidirectionalInfo->characterTypes );\n\n    \/\/ Retrieve the paragraph's direction.\n    bidirectionalInfo->paragraphDirection = fribidi_get_par_direction( bidirectionalInfo->characterTypes, numberOfCharacters );\n\n    \/\/ Retrieve the embedding levels.\n    if (fribidi_get_par_embedding_levels( bidirectionalInfo->characterTypes, numberOfCharacters, &bidirectionalInfo->paragraphDirection, bidirectionalInfo->embeddedLevels ) == 0)\n    {\n      free( bidirectionalInfo->characterTypes );\n      delete bidirectionalInfo;\n      return 0;\n    }\n\n    \/\/ Store the bidirectional info and return the index.\n    BidiInfoIndex index = 0u;\n    if( 0u != mFreeIndices.Count() )\n    {\n      Vector<BidiInfoIndex>::Iterator it = mFreeIndices.End() - 1u;\n\n      index = *it;\n\n      mFreeIndices.Remove( it );\n\n      *( mParagraphBidirectionalInfo.Begin() + index ) = bidirectionalInfo;\n    }\n    else\n    {\n      index = static_cast<BidiInfoIndex>( mParagraphBidirectionalInfo.Count() );\n\n      mParagraphBidirectionalInfo.PushBack( bidirectionalInfo );\n    }\n\n    return index;\n  }\n\n  void DestroyInfo( BidiInfoIndex bidiInfoIndex )\n  {\n    if( bidiInfoIndex >= mParagraphBidirectionalInfo.Count() )\n    {\n      return;\n    }\n\n    \/\/ Retrieve the paragraph's bidirectional info.\n    Vector<BidirectionalInfo*>::Iterator it = mParagraphBidirectionalInfo.Begin() + bidiInfoIndex;\n    BidirectionalInfo* bidirectionalInfo = *it;\n\n    if( NULL != bidirectionalInfo )\n    {\n      \/\/ Free resources and destroy the container.\n      free( bidirectionalInfo->embeddedLevels );\n      free( bidirectionalInfo->characterTypes );\n      delete bidirectionalInfo;\n\n      *it = NULL;\n    }\n\n    \/\/ Add the index to the free indices vector.\n    mFreeIndices.PushBack( bidiInfoIndex );\n  }\n\n  void Reorder( BidiInfoIndex bidiInfoIndex,\n                CharacterIndex firstCharacterIndex,\n                Length numberOfCharacters,\n                CharacterIndex* visualToLogicalMap )\n  {\n    const FriBidiFlags flags = FRIBIDI_FLAGS_DEFAULT | FRIBIDI_FLAGS_ARABIC;\n\n    \/\/ Retrieve the paragraph's bidirectional info.\n    const BidirectionalInfo* const bidirectionalInfo = *( mParagraphBidirectionalInfo.Begin() + bidiInfoIndex );\n\n    \/\/ Initialize the visual to logical mapping table to the identity. Otherwise fribidi_reorder_line fails to retrieve a valid mapping table.\n    for( CharacterIndex index = 0u; index < numberOfCharacters; ++index )\n    {\n      visualToLogicalMap[ index ] = index;\n    }\n\n    \/\/ Copy embedded levels as fribidi_reorder_line() may change them.\n    const uint32_t embeddedLevelsSize = numberOfCharacters * sizeof( FriBidiLevel );\n    FriBidiLevel* embeddedLevels = reinterpret_cast<FriBidiLevel*>( malloc( embeddedLevelsSize ) );\n    if( embeddedLevels )\n    {\n      memcpy( embeddedLevels, bidirectionalInfo->embeddedLevels + firstCharacterIndex,  embeddedLevelsSize );\n\n      \/\/ Reorder the line.\n      if (fribidi_reorder_line( flags,\n                                bidirectionalInfo->characterTypes + firstCharacterIndex,\n                                numberOfCharacters,\n                                0u,\n                                bidirectionalInfo->paragraphDirection,\n                                embeddedLevels,\n                                NULL,\n                                reinterpret_cast<FriBidiStrIndex*>( visualToLogicalMap ) ) == 0)\n      {\n        DALI_LOG_ERROR(\"fribidi_reorder_line is failed\\n\");\n      }\n\n      \/\/ Free resources.\n      free( embeddedLevels );\n    }\n  }\n\n  bool GetMirroredText( Character* text,\n                        CharacterDirection* directions,\n                        Length numberOfCharacters ) const\n  {\n    bool updated = false;\n\n    for( CharacterIndex index = 0u; index < numberOfCharacters; ++index )\n    {\n      \/\/ Get a reference to the character inside the text.\n      Character& character = *( text + index );\n\n      \/\/ Retrieve the mirrored character.\n      FriBidiChar mirroredCharacter = character;\n      bool mirrored = false;\n      if( *( directions + index ) )\n      {\n        mirrored = fribidi_get_mirror_char( character, &mirroredCharacter );\n      }\n      updated = updated || mirrored;\n\n      \/\/ Update the character inside the text.\n      character = mirroredCharacter;\n    }\n\n    return updated;\n  }\n\n  bool GetParagraphDirection( BidiInfoIndex bidiInfoIndex ) const\n  {\n    \/\/ Retrieve the paragraph's bidirectional info.\n    const BidirectionalInfo* const bidirectionalInfo = *( mParagraphBidirectionalInfo.Begin() + bidiInfoIndex );\n\n    return GetBidiParagraphDirection( bidirectionalInfo->paragraphDirection );\n  }\n\n  void GetCharactersDirection( BidiInfoIndex bidiInfoIndex,\n                               CharacterDirection* directions,\n                               Length numberOfCharacters )\n  {\n    const BidirectionalInfo* const bidirectionalInfo = *( mParagraphBidirectionalInfo.Begin() + bidiInfoIndex );\n\n    const CharacterDirection paragraphDirection = GetBidiParagraphDirection( bidirectionalInfo->paragraphDirection );\n    CharacterDirection previousDirection = paragraphDirection;\n\n    for( CharacterIndex index = 0u; index < numberOfCharacters; ++index )\n    {\n      CharacterDirection& characterDirection = *( directions + index );\n      characterDirection = false;\n\n      \/\/ Get the bidi direction.\n      const BidiDirection bidiDirection = GetBidiCharacterDirection( *( bidirectionalInfo->characterTypes + index ) );\n\n      if( RIGHT_TO_LEFT == bidiDirection )\n      {\n        characterDirection = true;\n      }\n      else if( NEUTRAL == bidiDirection )\n      {\n        \/\/ For neutral characters it check's the next and previous directions.\n        \/\/ If they are equals set that direction. If they are not, sets the paragraph's direction.\n        \/\/ If there is no next, sets the paragraph's direction.\n\n        CharacterDirection nextDirection = paragraphDirection;\n\n        \/\/ Look for the next non-neutral character.\n        Length nextIndex = index + 1u;\n        for( ; nextIndex < numberOfCharacters; ++nextIndex )\n        {\n          BidiDirection nextBidiDirection = GetBidiCharacterDirection( *( bidirectionalInfo->characterTypes + nextIndex ) );\n          if( nextBidiDirection != NEUTRAL )\n          {\n            nextDirection = RIGHT_TO_LEFT == nextBidiDirection;\n            break;\n          }\n        }\n\n        \/\/ Calculate the direction for all the neutral characters.\n        characterDirection = previousDirection == nextDirection ? previousDirection : paragraphDirection;\n\n        \/\/ Set the direction to all the neutral characters.\n        ++index;\n        for( ; index < nextIndex; ++index )\n        {\n          CharacterDirection& nextCharacterDirection = *( directions + index );\n          nextCharacterDirection = characterDirection;\n        }\n\n        \/\/ Set the direction of the next non-neutral character.\n        if( nextIndex < numberOfCharacters )\n        {\n          *( directions + nextIndex ) = nextDirection;\n        }\n      }\n\n      previousDirection = characterDirection;\n    }\n  }\n\n  Vector<BidirectionalInfo*> mParagraphBidirectionalInfo; \/\/\/< Stores the bidirectional info per paragraph.\n  Vector<BidiInfoIndex>      mFreeIndices;                \/\/\/< Stores indices of free positions in the bidirectional info vector.\n};\n\nBidirectionalSupport::BidirectionalSupport()\n: mPlugin( NULL )\n{\n}\n\nBidirectionalSupport::~BidirectionalSupport()\n{\n  delete mPlugin;\n}\n\nTextAbstraction::BidirectionalSupport BidirectionalSupport::Get()\n{\n  TextAbstraction::BidirectionalSupport bidirectionalSupportHandle;\n\n  SingletonService service( SingletonService::Get() );\n  if( service )\n  {\n    \/\/ Check whether the singleton is already created\n    BaseHandle handle = service.GetSingleton( typeid( TextAbstraction::BidirectionalSupport ) );\n    if(handle)\n    {\n      \/\/ If so, downcast the handle\n      BidirectionalSupport* impl = dynamic_cast< Internal::BidirectionalSupport* >( handle.GetObjectPtr() );\n      bidirectionalSupportHandle = TextAbstraction::BidirectionalSupport( impl );\n    }\n    else \/\/ create and register the object\n    {\n      bidirectionalSupportHandle = TextAbstraction::BidirectionalSupport( new BidirectionalSupport );\n      service.Register( typeid( bidirectionalSupportHandle ), bidirectionalSupportHandle );\n    }\n  }\n\n  return bidirectionalSupportHandle;\n}\n\nBidiInfoIndex BidirectionalSupport::CreateInfo( const Character* const paragraph,\n                                                Length numberOfCharacters )\n{\n  CreatePlugin();\n\n  return mPlugin->CreateInfo( paragraph,\n                              numberOfCharacters );\n}\n\nvoid BidirectionalSupport::DestroyInfo( BidiInfoIndex bidiInfoIndex )\n{\n  CreatePlugin();\n\n  mPlugin->DestroyInfo( bidiInfoIndex );\n}\n\nvoid BidirectionalSupport::Reorder( BidiInfoIndex bidiInfoIndex,\n                                    CharacterIndex firstCharacterIndex,\n                                    Length numberOfCharacters,\n                                    CharacterIndex* visualToLogicalMap )\n{\n  CreatePlugin();\n\n  mPlugin->Reorder( bidiInfoIndex,\n                    firstCharacterIndex,\n                    numberOfCharacters,\n                    visualToLogicalMap );\n}\n\nbool BidirectionalSupport::GetMirroredText( Character* text,\n                                            CharacterDirection* directions,\n                                            Length numberOfCharacters )\n{\n  CreatePlugin();\n\n  return mPlugin->GetMirroredText( text, directions, numberOfCharacters );\n}\n\nbool BidirectionalSupport::GetParagraphDirection( BidiInfoIndex bidiInfoIndex ) const\n{\n  if( !mPlugin )\n  {\n    return false;\n  }\n\n  return mPlugin->GetParagraphDirection( bidiInfoIndex );\n}\n\nvoid BidirectionalSupport::GetCharactersDirection( BidiInfoIndex bidiInfoIndex,\n                                                   CharacterDirection* directions,\n                                                   Length numberOfCharacters )\n{\n  CreatePlugin();\n\n  mPlugin->GetCharactersDirection( bidiInfoIndex,\n                                   directions,\n                                   numberOfCharacters );\n}\n\nvoid BidirectionalSupport::CreatePlugin()\n{\n  if( !mPlugin )\n  {\n    mPlugin = new Plugin();\n  }\n}\n\n} \/\/ namespace Internal\n\n} \/\/ namespace TextAbstraction\n\n} \/\/ namespace Dali\n<commit_msg>Fix bidirection text issue<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\/\/ CLASS  HEADER\n#include <dali\/internal\/text\/text-abstraction\/bidirectional-support-impl.h>\n\n\/\/ INTERNAL INCLUDES\n#include <dali\/internal\/system\/common\/singleton-service-impl.h>\n\n\/\/ EXTERNAL INCLUDES\n#include <memory.h>\n#include <fribidi\/fribidi.h>\n#include <dali\/integration-api\/debug.h>\n\nnamespace Dali\n{\n\nnamespace TextAbstraction\n{\n\nnamespace Internal\n{\n\nnamespace\n{\n  typedef unsigned char BidiDirection;\n\n  \/\/ Internal charcter's direction.\n  const BidiDirection LEFT_TO_RIGHT = 0u;\n  const BidiDirection NEUTRAL = 1u;\n  const BidiDirection RIGHT_TO_LEFT = 2u;\n\n  \/**\n   * @param[in] paragraphDirection The FriBiDi paragraph's direction.\n   *\n   * @return Whether the paragraph is right to left.\n   *\/\n  bool GetBidiParagraphDirection( FriBidiParType paragraphDirection )\n  {\n    switch( paragraphDirection )\n    {\n      case FRIBIDI_PAR_RTL:  \/\/ Right-To-Left paragraph.\n      case FRIBIDI_PAR_WRTL: \/\/ Weak Right To Left paragraph.\n      {\n        return true;\n      }\n      case FRIBIDI_PAR_LTR:  \/\/ Left-To-Right paragraph.\n      case FRIBIDI_PAR_ON:   \/\/ DirectiOn-Neutral paragraph.\n      case FRIBIDI_PAR_WLTR: \/\/ Weak Left To Right paragraph.\n      {\n        return false;\n      }\n    }\n\n    return false;\n  }\n\n  BidiDirection GetBidiCharacterDirection( FriBidiCharType characterDirection )\n  {\n    switch( characterDirection )\n    {\n      case FRIBIDI_TYPE_LTR: \/\/ Left-To-Right letter.\n      case FRIBIDI_TYPE_EN:  \/\/ European Numeral.\n      case FRIBIDI_TYPE_AN:  \/\/ Arabic Numeral.\n      case FRIBIDI_TYPE_ES:  \/\/ European number Separator.\n      case FRIBIDI_TYPE_ET:  \/\/ European number Terminator.\n      {\n        return LEFT_TO_RIGHT;\n      }\n      case FRIBIDI_TYPE_RTL: \/\/ Right-To-Left letter.\n      case FRIBIDI_TYPE_AL:  \/\/ Arabic Letter.\n      {\n        return RIGHT_TO_LEFT;\n      }\n    }\n\n    return NEUTRAL;\n  }\n}\n\nstruct BidirectionalSupport::Plugin\n{\n  \/**\n   * Stores bidirectional info per paragraph.\n   *\/\n  struct BidirectionalInfo\n  {\n    FriBidiCharType* characterTypes;      \/\/\/< The type of each character (right, left, neutral, ...)\n    FriBidiLevel*    embeddedLevels;      \/\/\/< Embedded levels.\n    FriBidiParType   paragraphDirection;  \/\/\/< The paragraph's direction.\n  };\n\n  Plugin()\n  : mParagraphBidirectionalInfo(),\n    mFreeIndices()\n  {}\n\n  ~Plugin()\n  {\n    \/\/ free all resources.\n    for( Vector<BidirectionalInfo*>::Iterator it = mParagraphBidirectionalInfo.Begin(),\n           endIt = mParagraphBidirectionalInfo.End();\n         it != endIt;\n         ++it )\n    {\n      BidirectionalInfo* info = *it;\n\n      free( info->embeddedLevels );\n      free( info->characterTypes );\n      delete info;\n    }\n  }\n\n  BidiInfoIndex CreateInfo( const Character* const paragraph,\n                            Length numberOfCharacters )\n  {\n    \/\/ Reserve memory for the paragraph's bidirectional info.\n    BidirectionalInfo* bidirectionalInfo = new BidirectionalInfo();\n\n    bidirectionalInfo->characterTypes = reinterpret_cast<FriBidiCharType*>( malloc( numberOfCharacters * sizeof( FriBidiCharType ) ) );\n    if( !bidirectionalInfo->characterTypes )\n    {\n      delete bidirectionalInfo;\n      return 0;\n    }\n\n    bidirectionalInfo->embeddedLevels = reinterpret_cast<FriBidiLevel*>( malloc( numberOfCharacters * sizeof( FriBidiLevel ) ) );\n    if( !bidirectionalInfo->embeddedLevels )\n    {\n      free( bidirectionalInfo->characterTypes );\n      delete bidirectionalInfo;\n      return 0;\n    }\n\n    \/\/ Retrieve the type of each character..\n    fribidi_get_bidi_types( paragraph, numberOfCharacters, bidirectionalInfo->characterTypes );\n\n    \/\/ Retrieve the paragraph's direction.\n    bidirectionalInfo->paragraphDirection = fribidi_get_par_direction( bidirectionalInfo->characterTypes, numberOfCharacters );\n\n    \/\/ Retrieve the embedding levels.\n    if (fribidi_get_par_embedding_levels( bidirectionalInfo->characterTypes, numberOfCharacters, &bidirectionalInfo->paragraphDirection, bidirectionalInfo->embeddedLevels ) == 0)\n    {\n      free( bidirectionalInfo->characterTypes );\n      delete bidirectionalInfo;\n      return 0;\n    }\n\n    \/\/ Store the bidirectional info and return the index.\n    BidiInfoIndex index = 0u;\n    if( 0u != mFreeIndices.Count() )\n    {\n      Vector<BidiInfoIndex>::Iterator it = mFreeIndices.End() - 1u;\n\n      index = *it;\n\n      mFreeIndices.Remove( it );\n\n      *( mParagraphBidirectionalInfo.Begin() + index ) = bidirectionalInfo;\n    }\n    else\n    {\n      index = static_cast<BidiInfoIndex>( mParagraphBidirectionalInfo.Count() );\n\n      mParagraphBidirectionalInfo.PushBack( bidirectionalInfo );\n    }\n\n    return index;\n  }\n\n  void DestroyInfo( BidiInfoIndex bidiInfoIndex )\n  {\n    if( bidiInfoIndex >= mParagraphBidirectionalInfo.Count() )\n    {\n      return;\n    }\n\n    \/\/ Retrieve the paragraph's bidirectional info.\n    Vector<BidirectionalInfo*>::Iterator it = mParagraphBidirectionalInfo.Begin() + bidiInfoIndex;\n    BidirectionalInfo* bidirectionalInfo = *it;\n\n    if( NULL != bidirectionalInfo )\n    {\n      \/\/ Free resources and destroy the container.\n      free( bidirectionalInfo->embeddedLevels );\n      free( bidirectionalInfo->characterTypes );\n      delete bidirectionalInfo;\n\n      *it = NULL;\n    }\n\n    \/\/ Add the index to the free indices vector.\n    mFreeIndices.PushBack( bidiInfoIndex );\n  }\n\n  void Reorder( BidiInfoIndex bidiInfoIndex,\n                CharacterIndex firstCharacterIndex,\n                Length numberOfCharacters,\n                CharacterIndex* visualToLogicalMap )\n  {\n    const FriBidiFlags flags = FRIBIDI_FLAGS_DEFAULT | FRIBIDI_FLAGS_ARABIC;\n\n    \/\/ Retrieve the paragraph's bidirectional info.\n    const BidirectionalInfo* const bidirectionalInfo = *( mParagraphBidirectionalInfo.Begin() + bidiInfoIndex );\n\n    \/\/ Initialize the visual to logical mapping table to the identity. Otherwise fribidi_reorder_line fails to retrieve a valid mapping table.\n    for( CharacterIndex index = 0u; index < numberOfCharacters; ++index )\n    {\n      visualToLogicalMap[ index ] = index;\n    }\n\n    \/\/ Copy embedded levels as fribidi_reorder_line() may change them.\n    const uint32_t embeddedLevelsSize = numberOfCharacters * sizeof( FriBidiLevel );\n    FriBidiLevel* embeddedLevels = reinterpret_cast<FriBidiLevel*>( malloc( embeddedLevelsSize ) );\n    if( embeddedLevels )\n    {\n      memcpy( embeddedLevels, bidirectionalInfo->embeddedLevels + firstCharacterIndex,  embeddedLevelsSize );\n\n      \/\/ Reorder the line.\n      if (fribidi_reorder_line( flags,\n                                bidirectionalInfo->characterTypes + firstCharacterIndex,\n                                numberOfCharacters,\n                                0u,\n                                bidirectionalInfo->paragraphDirection,\n                                embeddedLevels,\n                                NULL,\n                                reinterpret_cast<FriBidiStrIndex*>( visualToLogicalMap ) ) == 0)\n      {\n        DALI_LOG_ERROR(\"fribidi_reorder_line is failed\\n\");\n      }\n\n      \/\/ Free resources.\n      free( embeddedLevels );\n    }\n  }\n\n  bool GetMirroredText( Character* text,\n                        CharacterDirection* directions,\n                        Length numberOfCharacters ) const\n  {\n    bool updated = false;\n\n    for( CharacterIndex index = 0u; index < numberOfCharacters; ++index )\n    {\n      \/\/ Get a reference to the character inside the text.\n      Character& character = *( text + index );\n\n      \/\/ Retrieve the mirrored character.\n      FriBidiChar mirroredCharacter = character;\n      bool mirrored = false;\n      if( *( directions + index ) )\n      {\n        mirrored = fribidi_get_mirror_char( character, &mirroredCharacter );\n      }\n      updated = updated || mirrored;\n\n      \/\/ Update the character inside the text.\n      character = mirroredCharacter;\n    }\n\n    return updated;\n  }\n\n  bool GetParagraphDirection( BidiInfoIndex bidiInfoIndex ) const\n  {\n    \/\/ Retrieve the paragraph's bidirectional info.\n    const BidirectionalInfo* const bidirectionalInfo = *( mParagraphBidirectionalInfo.Begin() + bidiInfoIndex );\n\n    return GetBidiParagraphDirection( bidirectionalInfo->paragraphDirection );\n  }\n\n  void GetCharactersDirection( BidiInfoIndex bidiInfoIndex,\n                               CharacterDirection* directions,\n                               Length numberOfCharacters )\n  {\n    const BidirectionalInfo* const bidirectionalInfo = *( mParagraphBidirectionalInfo.Begin() + bidiInfoIndex );\n\n    const CharacterDirection paragraphDirection = GetBidiParagraphDirection( bidirectionalInfo->paragraphDirection );\n    CharacterDirection previousDirection = paragraphDirection;\n\n    for( CharacterIndex index = 0u; index < numberOfCharacters; ++index )\n    {\n      CharacterDirection& characterDirection = *( directions + index );\n      CharacterDirection nextDirection = false;\n\n      characterDirection = false;\n\n      \/\/ Get the bidi direction.\n      const BidiDirection bidiDirection = GetBidiCharacterDirection( *( bidirectionalInfo->characterTypes + index ) );\n\n      if( RIGHT_TO_LEFT == bidiDirection )\n      {\n        characterDirection = true;\n        nextDirection = true;\n      }\n      else if( NEUTRAL == bidiDirection )\n      {\n        \/\/ For neutral characters it check's the next and previous directions.\n        \/\/ If they are equals set that direction. If they are not, sets the paragraph's direction.\n        \/\/ If there is no next, sets the paragraph's direction.\n        nextDirection = paragraphDirection;\n\n        \/\/ Look for the next non-neutral character.\n        Length nextIndex = index + 1u;\n        for( ; nextIndex < numberOfCharacters; ++nextIndex )\n        {\n          BidiDirection nextBidiDirection = GetBidiCharacterDirection( *( bidirectionalInfo->characterTypes + nextIndex ) );\n          if( nextBidiDirection != NEUTRAL )\n          {\n            nextDirection = RIGHT_TO_LEFT == nextBidiDirection;\n            break;\n          }\n        }\n\n        \/\/ Calculate the direction for all the neutral characters.\n        characterDirection = previousDirection == nextDirection ? previousDirection : paragraphDirection;\n\n        \/\/ Set the direction to all the neutral characters.\n        \/\/ The indices from currentIndex + 1u to nextIndex - 1u are neutral characters.\n        ++index;\n\n        for( ; index < nextIndex; ++index )\n        {\n          CharacterDirection& nextCharacterDirection = *( directions + index );\n          nextCharacterDirection = characterDirection;\n        }\n\n        \/\/ Set the direction of the next non-neutral character.\n        if( nextIndex < numberOfCharacters )\n        {\n          *( directions + nextIndex ) = nextDirection;\n        }\n      }\n\n      previousDirection = nextDirection;\n    }\n  }\n\n  Vector<BidirectionalInfo*> mParagraphBidirectionalInfo; \/\/\/< Stores the bidirectional info per paragraph.\n  Vector<BidiInfoIndex>      mFreeIndices;                \/\/\/< Stores indices of free positions in the bidirectional info vector.\n};\n\nBidirectionalSupport::BidirectionalSupport()\n: mPlugin( NULL )\n{\n}\n\nBidirectionalSupport::~BidirectionalSupport()\n{\n  delete mPlugin;\n}\n\nTextAbstraction::BidirectionalSupport BidirectionalSupport::Get()\n{\n  TextAbstraction::BidirectionalSupport bidirectionalSupportHandle;\n\n  SingletonService service( SingletonService::Get() );\n  if( service )\n  {\n    \/\/ Check whether the singleton is already created\n    BaseHandle handle = service.GetSingleton( typeid( TextAbstraction::BidirectionalSupport ) );\n    if(handle)\n    {\n      \/\/ If so, downcast the handle\n      BidirectionalSupport* impl = dynamic_cast< Internal::BidirectionalSupport* >( handle.GetObjectPtr() );\n      bidirectionalSupportHandle = TextAbstraction::BidirectionalSupport( impl );\n    }\n    else \/\/ create and register the object\n    {\n      bidirectionalSupportHandle = TextAbstraction::BidirectionalSupport( new BidirectionalSupport );\n      service.Register( typeid( bidirectionalSupportHandle ), bidirectionalSupportHandle );\n    }\n  }\n\n  return bidirectionalSupportHandle;\n}\n\nBidiInfoIndex BidirectionalSupport::CreateInfo( const Character* const paragraph,\n                                                Length numberOfCharacters )\n{\n  CreatePlugin();\n\n  return mPlugin->CreateInfo( paragraph,\n                              numberOfCharacters );\n}\n\nvoid BidirectionalSupport::DestroyInfo( BidiInfoIndex bidiInfoIndex )\n{\n  CreatePlugin();\n\n  mPlugin->DestroyInfo( bidiInfoIndex );\n}\n\nvoid BidirectionalSupport::Reorder( BidiInfoIndex bidiInfoIndex,\n                                    CharacterIndex firstCharacterIndex,\n                                    Length numberOfCharacters,\n                                    CharacterIndex* visualToLogicalMap )\n{\n  CreatePlugin();\n\n  mPlugin->Reorder( bidiInfoIndex,\n                    firstCharacterIndex,\n                    numberOfCharacters,\n                    visualToLogicalMap );\n}\n\nbool BidirectionalSupport::GetMirroredText( Character* text,\n                                            CharacterDirection* directions,\n                                            Length numberOfCharacters )\n{\n  CreatePlugin();\n\n  return mPlugin->GetMirroredText( text, directions, numberOfCharacters );\n}\n\nbool BidirectionalSupport::GetParagraphDirection( BidiInfoIndex bidiInfoIndex ) const\n{\n  if( !mPlugin )\n  {\n    return false;\n  }\n\n  return mPlugin->GetParagraphDirection( bidiInfoIndex );\n}\n\nvoid BidirectionalSupport::GetCharactersDirection( BidiInfoIndex bidiInfoIndex,\n                                                   CharacterDirection* directions,\n                                                   Length numberOfCharacters )\n{\n  CreatePlugin();\n\n  mPlugin->GetCharactersDirection( bidiInfoIndex,\n                                   directions,\n                                   numberOfCharacters );\n}\n\nvoid BidirectionalSupport::CreatePlugin()\n{\n  if( !mPlugin )\n  {\n    mPlugin = new Plugin();\n  }\n}\n\n} \/\/ namespace Internal\n\n} \/\/ namespace TextAbstraction\n\n} \/\/ namespace Dali\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <sstream> \/\/ std::ostringstream\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/test\/parameterized_test.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/foreach.hpp>\n\n#include <glog\/logging.h>\n\n#include \"IndexerTestFixture.h\"\n#include \"t_IndexReader.h\"\n#include \"t_BarrelsInfo.h\"\n#include \"t_TermDocFreqs.h\"\n\nusing namespace std;\nusing namespace boost::unit_test;\nnamespace po = boost::program_options;\n\nnamespace {\n\/** the parameters for each test case *\/\nconst IndexerTestConfig INDEXER_TEST_CONFIGS[] = {\n    {0, 1, 1, \"default\", true},\n    {1, 1, 1, \"realtime\", true},\n    {2, 5, 3, \"default\", true},\n    {3, 5, 3, \"realtime\", true},\n    {4, 10, 6, \"default\", true},\n    {5, 10, 6, \"realtime\", true},\n    {6, 100, 23, \"default\", true},\n    {7, 100, 23, \"realtime\", true},\n    {8, 1000, 10, \"default\", true},\n    {9, 1000, 10, \"realtime\", true},\n};\n\n\/** the parameter number *\/\nconst int INDEXER_TEST_CONFIG_NUM = sizeof(INDEXER_TEST_CONFIGS) \/ sizeof(IndexerTestConfig);\n\n\/** if the command options of \"--run_config_list\" or \"--run_config_range\" are not specified, run configs of range [0, DEFAULT_CONFIG_RANGE] *\/\nconst int DEFAULT_CONFIG_RANGE = 5;\n\n\/** the command option to specify a list of config numbers, such as \"--run_config_list 0 1 2 3\" *\/\nconst char* OPTION_CONFIG_LIST = \"run_config_list\";\n\n\/** the command option to specify a range of config numbers, such as \"--run_config_range 4 7\" *\/\nconst char* OPTION_CONFIG_RANGE = \"run_config_range\";\n}\n\n\/**\n * Load command line option \"run_config_list\" or \"run_config_range\" to decide which configs to run.\n * @param configVec the loaded configs to run\n * @return true for load success, false for fail\n *\/\nbool loadConfigOption(vector<IndexerTestConfig>& configVec)\n{\n    try\n    {\n        vector<int> runConfigListVec;\n        vector<int> runConfigRangeVec;\n        po::options_description desp(\"Allowed options\");\n        desp.add_options()\n            (OPTION_CONFIG_LIST, po::value<std::vector<int> >(&runConfigListVec)->multitoken(), \"specify the list of config parameters to run\")\n            (OPTION_CONFIG_RANGE, po::value<std::vector<int> >(&runConfigRangeVec)->multitoken(), \"specify the range of config parameters to run\")\n            ;\n\n        po::options_description cmdline_options;\n        cmdline_options.add(desp);\n\n        po::variables_map vm;\n        store(po::command_line_parser(framework::master_test_suite().argc, framework::master_test_suite().argv).options(cmdline_options).run(), vm);\n        po::notify(vm);    \n\n        if(vm.count(OPTION_CONFIG_LIST))\n        {\n            cout << OPTION_CONFIG_LIST << \": \";\n            BOOST_FOREACH(int i, runConfigListVec)\n            {\n                cout << i << \", \";\n                if(i >= 0 && i < INDEXER_TEST_CONFIG_NUM)\n                    configVec.push_back(INDEXER_TEST_CONFIGS[i]);\n                else\n                {\n                    cout << endl;\n                    ostringstream oss;\n                    oss << \"unknown config number \" << i;\n                    throw std::runtime_error(oss.str());\n                }\n            }\n            cout << endl;\n        }\n        else if(vm.count(OPTION_CONFIG_RANGE))\n        {\n            cout << OPTION_CONFIG_RANGE << \": \";\n            BOOST_FOREACH(int i, runConfigRangeVec)\n                cout << i << \", \";\n            cout << endl;\n\n            if(runConfigRangeVec.size() == 2\n                    && runConfigRangeVec[0] >= 0\n                    && runConfigRangeVec[0] <= runConfigRangeVec[1]\n                    && runConfigRangeVec[1] < INDEXER_TEST_CONFIG_NUM)\n                configVec.insert(configVec.begin(), INDEXER_TEST_CONFIGS + runConfigRangeVec[0],\n                                                    INDEXER_TEST_CONFIGS + runConfigRangeVec[1] + 1);\n            else\n            {\n                ostringstream oss;\n                oss << \"the config range is invalid\";\n                throw std::runtime_error(oss.str());\n            }\n        }\n        else\n        {\n            cout << \"run default configs range: [0, \" << DEFAULT_CONFIG_RANGE << \"]\" << endl;\n            configVec.insert(configVec.begin(), INDEXER_TEST_CONFIGS,\n                                                INDEXER_TEST_CONFIGS + DEFAULT_CONFIG_RANGE + 1);\n        }\n    }\n    catch(std::exception& e)\n    {\n        cerr << \"error: \" << e.what() << endl;\n        return false;\n    }\n\n    return true;\n}\n\n\/**\n * Boost test module initialize function, it regsiters the test cases to run.\n * @return true for success, false for failure\n *\/\nbool my_init_unit_test()\n{\n    vector<IndexerTestConfig> configVec;\n    if(! loadConfigOption(configVec))\n        return false;\n\n    const IndexerTestConfig* const pConfigStart = &configVec[0];\n    const IndexerTestConfig* const pConfigEnd = pConfigStart + configVec.size();\n\n    test_suite* tsIndexManager = BOOST_TEST_SUITE(\"index_manager\");\n\n    test_suite* tsIndexReader = BOOST_TEST_SUITE(\"t_IndexReader\");\n    tsIndexReader->add(BOOST_PARAM_TEST_CASE(&t_IndexReader::index, pConfigStart, pConfigEnd));\n    tsIndexReader->add(BOOST_PARAM_TEST_CASE(&t_IndexReader::update, pConfigStart, pConfigEnd));\n    tsIndexReader->add(BOOST_PARAM_TEST_CASE(&t_IndexReader::remove, pConfigStart, pConfigEnd));\n    tsIndexManager->add(tsIndexReader);\n\n    test_suite* tsBarrelsInfo = BOOST_TEST_SUITE(\"t_BarrelsInfo\");\n    tsBarrelsInfo->add(BOOST_PARAM_TEST_CASE(&t_BarrelsInfo::index, pConfigStart, pConfigEnd));\n    tsBarrelsInfo->add(BOOST_PARAM_TEST_CASE(&t_BarrelsInfo::optimize, pConfigStart, pConfigEnd));\n    tsBarrelsInfo->add(BOOST_PARAM_TEST_CASE(&t_BarrelsInfo::createAfterOptimize, pConfigStart, pConfigEnd));\n    tsBarrelsInfo->add(BOOST_PARAM_TEST_CASE(&t_BarrelsInfo::pauseResumeMerge, pConfigStart, pConfigEnd));\n    tsIndexManager->add(tsBarrelsInfo);\n\n    test_suite* tsTermDocFreqs = BOOST_TEST_SUITE(\"t_TermDocFreqs\");\n    tsTermDocFreqs->add(BOOST_PARAM_TEST_CASE(&t_TermDocFreqs::index, pConfigStart, pConfigEnd));\n    tsTermDocFreqs->add(BOOST_PARAM_TEST_CASE(&t_TermDocFreqs::update, pConfigStart, pConfigEnd));\n    tsTermDocFreqs->add(BOOST_PARAM_TEST_CASE(&t_TermDocFreqs::remove, pConfigStart, pConfigEnd));\n    tsIndexManager->add(tsTermDocFreqs);\n\n    framework::master_test_suite().add(tsIndexManager);\n    return true;\n}\n\nint main( int argc, char* argv[] )\n{\n    google::InitGoogleLogging(argv[0]);\n\n    return ::boost::unit_test::unit_test_main( &my_init_unit_test, argc, argv );\n}\n<commit_msg>in \"t_integration_Indexer\", update master test suite name to \"index_manager\".<commit_after>#include <vector>\n#include <sstream> \/\/ std::ostringstream\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/test\/parameterized_test.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/foreach.hpp>\n\n#include <glog\/logging.h>\n\n#include \"IndexerTestFixture.h\"\n#include \"t_IndexReader.h\"\n#include \"t_BarrelsInfo.h\"\n#include \"t_TermDocFreqs.h\"\n\nusing namespace std;\nusing namespace boost::unit_test;\nnamespace po = boost::program_options;\n\nnamespace {\n\/** the parameters for each test case *\/\nconst IndexerTestConfig INDEXER_TEST_CONFIGS[] = {\n    {0, 1, 1, \"default\", true},\n    {1, 1, 1, \"realtime\", true},\n    {2, 5, 3, \"default\", true},\n    {3, 5, 3, \"realtime\", true},\n    {4, 10, 6, \"default\", true},\n    {5, 10, 6, \"realtime\", true},\n    {6, 100, 23, \"default\", true},\n    {7, 100, 23, \"realtime\", true},\n    {8, 1000, 10, \"default\", true},\n    {9, 1000, 10, \"realtime\", true},\n};\n\n\/** the parameter number *\/\nconst int INDEXER_TEST_CONFIG_NUM = sizeof(INDEXER_TEST_CONFIGS) \/ sizeof(IndexerTestConfig);\n\n\/** if the command options of \"--run_config_list\" or \"--run_config_range\" are not specified, run configs of range [0, DEFAULT_CONFIG_RANGE] *\/\nconst int DEFAULT_CONFIG_RANGE = 5;\n\n\/** the command option to specify a list of config numbers, such as \"--run_config_list 0 1 2 3\" *\/\nconst char* OPTION_CONFIG_LIST = \"run_config_list\";\n\n\/** the command option to specify a range of config numbers, such as \"--run_config_range 4 7\" *\/\nconst char* OPTION_CONFIG_RANGE = \"run_config_range\";\n}\n\n\/**\n * Load command line option \"run_config_list\" or \"run_config_range\" to decide which configs to run.\n * @param configVec the loaded configs to run\n * @return true for load success, false for fail\n *\/\nbool loadConfigOption(vector<IndexerTestConfig>& configVec)\n{\n    try\n    {\n        vector<int> runConfigListVec;\n        vector<int> runConfigRangeVec;\n        po::options_description desp(\"Allowed options\");\n        desp.add_options()\n            (OPTION_CONFIG_LIST, po::value<std::vector<int> >(&runConfigListVec)->multitoken(), \"specify the list of config parameters to run\")\n            (OPTION_CONFIG_RANGE, po::value<std::vector<int> >(&runConfigRangeVec)->multitoken(), \"specify the range of config parameters to run\")\n            ;\n\n        po::options_description cmdline_options;\n        cmdline_options.add(desp);\n\n        po::variables_map vm;\n        store(po::command_line_parser(framework::master_test_suite().argc, framework::master_test_suite().argv).options(cmdline_options).run(), vm);\n        po::notify(vm);    \n\n        if(vm.count(OPTION_CONFIG_LIST))\n        {\n            cout << OPTION_CONFIG_LIST << \": \";\n            BOOST_FOREACH(int i, runConfigListVec)\n            {\n                cout << i << \", \";\n                if(i >= 0 && i < INDEXER_TEST_CONFIG_NUM)\n                    configVec.push_back(INDEXER_TEST_CONFIGS[i]);\n                else\n                {\n                    cout << endl;\n                    ostringstream oss;\n                    oss << \"unknown config number \" << i;\n                    throw std::runtime_error(oss.str());\n                }\n            }\n            cout << endl;\n        }\n        else if(vm.count(OPTION_CONFIG_RANGE))\n        {\n            cout << OPTION_CONFIG_RANGE << \": \";\n            BOOST_FOREACH(int i, runConfigRangeVec)\n                cout << i << \", \";\n            cout << endl;\n\n            if(runConfigRangeVec.size() == 2\n                    && runConfigRangeVec[0] >= 0\n                    && runConfigRangeVec[0] <= runConfigRangeVec[1]\n                    && runConfigRangeVec[1] < INDEXER_TEST_CONFIG_NUM)\n                configVec.insert(configVec.begin(), INDEXER_TEST_CONFIGS + runConfigRangeVec[0],\n                                                    INDEXER_TEST_CONFIGS + runConfigRangeVec[1] + 1);\n            else\n            {\n                ostringstream oss;\n                oss << \"the config range is invalid\";\n                throw std::runtime_error(oss.str());\n            }\n        }\n        else\n        {\n            cout << \"run default configs range: [0, \" << DEFAULT_CONFIG_RANGE << \"]\" << endl;\n            configVec.insert(configVec.begin(), INDEXER_TEST_CONFIGS,\n                                                INDEXER_TEST_CONFIGS + DEFAULT_CONFIG_RANGE + 1);\n        }\n    }\n    catch(std::exception& e)\n    {\n        cerr << \"error: \" << e.what() << endl;\n        return false;\n    }\n\n    return true;\n}\n\n\/**\n * Boost test module initialize function, it regsiters the test cases to run.\n * @return true for success, false for failure\n *\/\nbool my_init_unit_test()\n{\n    vector<IndexerTestConfig> configVec;\n    if(! loadConfigOption(configVec))\n        return false;\n\n    framework::master_test_suite().p_name.value = \"index_manager\";\n\n    const IndexerTestConfig* const pConfigStart = &configVec[0];\n    const IndexerTestConfig* const pConfigEnd = pConfigStart + configVec.size();\n\n    test_suite* tsIndexReader = BOOST_TEST_SUITE(\"t_IndexReader\");\n    tsIndexReader->add(BOOST_PARAM_TEST_CASE(&t_IndexReader::index, pConfigStart, pConfigEnd));\n    tsIndexReader->add(BOOST_PARAM_TEST_CASE(&t_IndexReader::update, pConfigStart, pConfigEnd));\n    tsIndexReader->add(BOOST_PARAM_TEST_CASE(&t_IndexReader::remove, pConfigStart, pConfigEnd));\n    framework::master_test_suite().add(tsIndexReader);\n\n    test_suite* tsBarrelsInfo = BOOST_TEST_SUITE(\"t_BarrelsInfo\");\n    tsBarrelsInfo->add(BOOST_PARAM_TEST_CASE(&t_BarrelsInfo::index, pConfigStart, pConfigEnd));\n    tsBarrelsInfo->add(BOOST_PARAM_TEST_CASE(&t_BarrelsInfo::optimize, pConfigStart, pConfigEnd));\n    tsBarrelsInfo->add(BOOST_PARAM_TEST_CASE(&t_BarrelsInfo::createAfterOptimize, pConfigStart, pConfigEnd));\n    tsBarrelsInfo->add(BOOST_PARAM_TEST_CASE(&t_BarrelsInfo::pauseResumeMerge, pConfigStart, pConfigEnd));\n    framework::master_test_suite().add(tsBarrelsInfo);\n\n    test_suite* tsTermDocFreqs = BOOST_TEST_SUITE(\"t_TermDocFreqs\");\n    tsTermDocFreqs->add(BOOST_PARAM_TEST_CASE(&t_TermDocFreqs::index, pConfigStart, pConfigEnd));\n    tsTermDocFreqs->add(BOOST_PARAM_TEST_CASE(&t_TermDocFreqs::update, pConfigStart, pConfigEnd));\n    tsTermDocFreqs->add(BOOST_PARAM_TEST_CASE(&t_TermDocFreqs::remove, pConfigStart, pConfigEnd));\n    framework::master_test_suite().add(tsTermDocFreqs);\n\n    return true;\n}\n\nint main( int argc, char* argv[] )\n{\n    google::InitGoogleLogging(argv[0]);\n\n    return ::boost::unit_test::unit_test_main( &my_init_unit_test, argc, argv );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"analyzer_good_kf.h\"\n\n#include \"util.h\"\n#include \"analyzer_util.h\"\n\nbool Analyzer_Good_KF::configure(INIReader *config) {\n    if (!Analyzer::configure(config)) {\n\treturn false;\n    }\n\n    for (std::map<const std::string, kf_variance>::const_iterator it = _variances.begin();\n         it != _variances.end();\n         ++it) {\n        std::string name = (*it).first;\n\n        _variances[name].threshold_warn = config->GetReal(\n            \"loganalyzer\",\n            string_format(\"%s::variance::%s::threshold_warn\",\n                          shortname_lc().c_str(),\n                          name.c_str()),\n            0.5f);\n        _variances[name].threshold_fail = config->GetReal(\n            \"loganalyzer\",\n            string_format(\"%s::variance::%s::threshold_fail\",\n                          shortname_lc().c_str(),\n                          name.c_str()),\n            1.0f);\n    }\n\n    return true;\n}\n\nvoid Analyzer_Good_KF::end_of_log(uint32_t packet_count UNUSED)\n{\n    std::map<const std::string, double> my_variances = variances();\n\n    for (std::map<const std::string, double>::const_iterator it = my_variances.begin();\n         it != my_variances.end();\n         ++it) {\n        \/\/ ::fprintf(stderr, \"would evaluate (%s)\\n\", (*it).first.c_str());\n        std::string name = (*it).first;\n        if (_results[name] != NULL) {\n            close_variance_result(name);\n        }\n    }\n    if (_result_flags != NULL) {\n        close_result_flags();\n    }\n\n    for (std::map<const std::string, double>::const_iterator it = my_variances.begin();\n         it != my_variances.end();\n         ++it) {\n        std::string name = (*it).first;\n        if (!variance_T(name)) {\n            Analyzer_Result_Summary *summary = new Analyzer_Result_Summary();\n            summary->set_status(analyzer_status_warn);\n            summary->set_reason(string_format(\"%s was never updated\", name.c_str()));\n            summary->add_source(_data_sources.get(\n                                    string_format(\"%s_VARIANCES_%s\",\n                                                  shortname().c_str(),\n                                                  name.c_str())));\n            add_result(summary);\n        }\n    }\n\n    if (!flags_T()) {\n        Analyzer_Result_Summary *summary = new Analyzer_Result_Summary();\n        summary->set_status(analyzer_status_warn);\n        summary->set_reason(string_format(\"%s flags were never updated\",\n                                          shortname().c_str()));\n        summary->add_source(_data_sources.get(string_format(\"%s_FLAGS\",\n                                                            shortname().c_str())));\n        add_result(summary);\n    }\n\n}\n\nbool Analyzer_Good_KF::flags_bad(uint16_t flags)\n{\n    for (uint16_t i=1; i<EKF_STATUS_FLAGS_ENUM_END; i<<=1) {\n        if (!(flags & i)) {\n            return true;\n        }\n    }\n    return false;\n}\n\nvoid Analyzer_Good_KF::close_variance_result(const std::string name)\n{\n    Analyzer_Good_KF_Result_Variance *result = _results[name];\n    kf_variance *variance = result->variance();\n\n    result->set_T_stop(_vehicle->T());\n    result->add_evidence(string_format(\"max-variance=%f\", result->max()));\n    if (result->max() > variance->threshold_fail) {\n        result->set_status(analyzer_status_fail);\n        result->set_reason(string_format(\"%s exceeds fail threshold\", name.c_str()));\n        result->add_evidence(string_format(\"threshold=%f\", variance->threshold_fail));\n        result->increase_severity_score(10);\n    } else if (result->max() > variance->threshold_warn) {\n        result->set_status(analyzer_status_warn);\n        result->set_reason(string_format(\"%s exceeds warn threshold\", name.c_str()));\n        result->add_evidence(string_format(\"threshold=%f\", variance->threshold_warn));\n        result->increase_severity_score(4);\n    } else {\n        \/\/ should not happen\n        ::fprintf(stderr, \"Have a result with max less than threshold?!\\n\");\n    }\n    if (_vehicle->any_acc_clipping()) {\n        result->add_evidence(\"Vehicle Accelerometers Clipping\");\n    }\n    add_result(result);\n    _results[name] = NULL;\n}\n\nvoid Analyzer_Good_KF::evaluate_variance(kf_variance &variance, double value)\n{\n\n    Analyzer_Good_KF_Result_Variance *result = _results[variance.name];\n\n    if (result == NULL) {\n        if (value > variance.threshold_warn) {\n            \/\/ we have exceeeded a threshold\n            result = new Analyzer_Good_KF_Result_Variance();\n            result->add_source(_data_sources.get(string_format(\"%s_VARIANCES_%s\", shortname().c_str(), variance.name)));\n            result->set_variance(&variance);\n            result->set_T_start(_vehicle->T());\n            result->set_max(value);\n            _results[variance.name] = result;\n        }\n    } else {\n        \/\/ event is underway\n        if (value > result->max()) {\n            \/\/ a new record!\n            result->set_max(value);\n        } else if (value > variance.threshold_warn) {\n            \/\/ we continue to exceed variances...\n        } else {\n            \/\/ our variances have come down sufficiently to close this instance\n            close_variance_result(variance.name);\n        }\n    }\n}\n\nvoid Analyzer_Good_KF::evaluate_variances()\n{\n    std::map<const std::string, double> my_variances = variances();\n    \n    for (std::map<const std::string, double>::const_iterator it = my_variances.begin();\n         it != my_variances.end();\n         ++it) {\n        std::string name = (*it).first;\n        if (_variances.count(name) == 0) {\n            \/\/ set a flag and warn?\n            fprintf(stderr, \"Unknown variance %s\\n\", name.c_str());\n            continue;\n        }\n        kf_variance &variance = _variances[name];\n        evaluate_variance(variance, (*it).second);\n    }\n}\n\nvoid Analyzer_Good_KF::close_result_flags()\n{\n    _result_flags->set_T_stop(_vehicle->T());\n    add_result(_result_flags);\n    _result_flags = NULL;\n}\n\nvoid Analyzer_Good_KF::open_result_flags(uint16_t flags)\n{\n    _result_flags = new Analyzer_Good_KF_Result_Flags();\n    _result_flags->set_T_start(_vehicle->T()); \n    _result_flags->set_status(analyzer_status_fail);\n    _result_flags->set_flags(flags);\n    _result_flags->add_source(_data_sources.get(string_format(\"%s_FLAGS\", shortname().c_str())));\n    _result_flags->set_reason(string_format(\"The %s status report indicates a problem with the EKF\", shortname().c_str()));\n    _result_flags->set_flags(this->flags());\n\n    _result_flags->add_evidence(string_format(\"flags=%d\", flags));\n    \/\/ TODO: put the flags and the \"bad\" descrption into a structure\n    _result_flags->increase_severity_score(10);\n    if (!(flags & EKF_ATTITUDE)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"attitude estimate bad\");\n    }\n    if (!(flags & EKF_VELOCITY_HORIZ)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"horizontal velocity estimate bad\");\n    }\n    if (!(flags & EKF_VELOCITY_VERT)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"vertical velocity estimate bad\");\n    }\n    if (!(flags & EKF_POS_HORIZ_REL)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"horizontal position (relative) estimate bad\");\n    }\n    if (!(flags & EKF_POS_HORIZ_ABS)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"horizontal position (absolute) estimate bad\");\n    }\n    if (!(flags & EKF_POS_VERT_ABS)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"vertical position (absolute) estimate bad\");\n    }\n    if (!(flags & EKF_POS_VERT_AGL)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"vertical position (above ground) estimate bad\");\n    }\n    if (!(flags & EKF_CONST_POS_MODE)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"In constant position mode (no abs or rel position)\");\n    }\n    if (!(flags & EKF_PRED_POS_HORIZ_REL)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"Predicted horizontal position (relative) bad\");\n    }\n    if (!(flags & EKF_PRED_POS_HORIZ_ABS)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"Predicted horizontal position (absolute) bad\");\n    }\n\n    if (_vehicle->any_acc_clipping()) {\n        _result_flags->add_evidence(\"Vehicle Accelerometers Clipping\");\n    }\n}\n\n\n\/\/ FIXME: should be taking timestamps from ekf_flags_t rather than\n\/\/ _vehicle->T()\nvoid Analyzer_Good_KF::evaluate_flags()\n{\n    if (_result_flags == NULL) {\n        if (flags_T()) {\n            if (flags_bad(flags())) {\n                \/\/ start a new incident\n                open_result_flags(flags());\n            }\n        }\n    } else {\n        \/\/ ::fprintf(stderr, \"flags: %d\\n\", _vehicle->ekf_flags());\n        \/\/ incident is under way\n        if (_result_flags->flags() != flags()) {\n            \/\/ close off the old one\n            close_result_flags();\n            _result_flags = NULL;\n            if (flags_bad(flags())) {\n                \/\/ new flags are also bad!\n                open_result_flags(flags());\n            }\n        }\n    }\n}\n\n\nvoid Analyzer_Good_KF::evaluate()\n{\n    evaluate_variances();\n    evaluate_flags();\n}\n<commit_msg>analyzer_good_kf: correct checking of constant-position-mode flag<commit_after>#include \"analyzer_good_kf.h\"\n\n#include \"util.h\"\n#include \"analyzer_util.h\"\n\nbool Analyzer_Good_KF::configure(INIReader *config) {\n    if (!Analyzer::configure(config)) {\n\treturn false;\n    }\n\n    for (std::map<const std::string, kf_variance>::const_iterator it = _variances.begin();\n         it != _variances.end();\n         ++it) {\n        std::string name = (*it).first;\n\n        _variances[name].threshold_warn = config->GetReal(\n            \"loganalyzer\",\n            string_format(\"%s::variance::%s::threshold_warn\",\n                          shortname_lc().c_str(),\n                          name.c_str()),\n            0.5f);\n        _variances[name].threshold_fail = config->GetReal(\n            \"loganalyzer\",\n            string_format(\"%s::variance::%s::threshold_fail\",\n                          shortname_lc().c_str(),\n                          name.c_str()),\n            1.0f);\n    }\n\n    return true;\n}\n\nvoid Analyzer_Good_KF::end_of_log(uint32_t packet_count UNUSED)\n{\n    std::map<const std::string, double> my_variances = variances();\n\n    for (std::map<const std::string, double>::const_iterator it = my_variances.begin();\n         it != my_variances.end();\n         ++it) {\n        \/\/ ::fprintf(stderr, \"would evaluate (%s)\\n\", (*it).first.c_str());\n        std::string name = (*it).first;\n        if (_results[name] != NULL) {\n            close_variance_result(name);\n        }\n    }\n    if (_result_flags != NULL) {\n        close_result_flags();\n    }\n\n    for (std::map<const std::string, double>::const_iterator it = my_variances.begin();\n         it != my_variances.end();\n         ++it) {\n        std::string name = (*it).first;\n        if (!variance_T(name)) {\n            Analyzer_Result_Summary *summary = new Analyzer_Result_Summary();\n            summary->set_status(analyzer_status_warn);\n            summary->set_reason(string_format(\"%s was never updated\", name.c_str()));\n            summary->add_source(_data_sources.get(\n                                    string_format(\"%s_VARIANCES_%s\",\n                                                  shortname().c_str(),\n                                                  name.c_str())));\n            add_result(summary);\n        }\n    }\n\n    if (!flags_T()) {\n        Analyzer_Result_Summary *summary = new Analyzer_Result_Summary();\n        summary->set_status(analyzer_status_warn);\n        summary->set_reason(string_format(\"%s flags were never updated\",\n                                          shortname().c_str()));\n        summary->add_source(_data_sources.get(string_format(\"%s_FLAGS\",\n                                                            shortname().c_str())));\n        add_result(summary);\n    }\n\n}\n\nbool Analyzer_Good_KF::flags_bad(uint16_t flags)\n{\n    for (uint16_t i=1; i<EKF_STATUS_FLAGS_ENUM_END; i<<=1) {\n        if (!(flags & i)) {\n            return true;\n        }\n    }\n    return false;\n}\n\nvoid Analyzer_Good_KF::close_variance_result(const std::string name)\n{\n    Analyzer_Good_KF_Result_Variance *result = _results[name];\n    kf_variance *variance = result->variance();\n\n    result->set_T_stop(_vehicle->T());\n    result->add_evidence(string_format(\"max-variance=%f\", result->max()));\n    if (result->max() > variance->threshold_fail) {\n        result->set_status(analyzer_status_fail);\n        result->set_reason(string_format(\"%s exceeds fail threshold\", name.c_str()));\n        result->add_evidence(string_format(\"threshold=%f\", variance->threshold_fail));\n        result->increase_severity_score(10);\n    } else if (result->max() > variance->threshold_warn) {\n        result->set_status(analyzer_status_warn);\n        result->set_reason(string_format(\"%s exceeds warn threshold\", name.c_str()));\n        result->add_evidence(string_format(\"threshold=%f\", variance->threshold_warn));\n        result->increase_severity_score(4);\n    } else {\n        \/\/ should not happen\n        ::fprintf(stderr, \"Have a result with max less than threshold?!\\n\");\n    }\n    if (_vehicle->any_acc_clipping()) {\n        result->add_evidence(\"Vehicle Accelerometers Clipping\");\n    }\n    add_result(result);\n    _results[name] = NULL;\n}\n\nvoid Analyzer_Good_KF::evaluate_variance(kf_variance &variance, double value)\n{\n\n    Analyzer_Good_KF_Result_Variance *result = _results[variance.name];\n\n    if (result == NULL) {\n        if (value > variance.threshold_warn) {\n            \/\/ we have exceeeded a threshold\n            result = new Analyzer_Good_KF_Result_Variance();\n            result->add_source(_data_sources.get(string_format(\"%s_VARIANCES_%s\", shortname().c_str(), variance.name)));\n            result->set_variance(&variance);\n            result->set_T_start(_vehicle->T());\n            result->set_max(value);\n            _results[variance.name] = result;\n        }\n    } else {\n        \/\/ event is underway\n        if (value > result->max()) {\n            \/\/ a new record!\n            result->set_max(value);\n        } else if (value > variance.threshold_warn) {\n            \/\/ we continue to exceed variances...\n        } else {\n            \/\/ our variances have come down sufficiently to close this instance\n            close_variance_result(variance.name);\n        }\n    }\n}\n\nvoid Analyzer_Good_KF::evaluate_variances()\n{\n    std::map<const std::string, double> my_variances = variances();\n    \n    for (std::map<const std::string, double>::const_iterator it = my_variances.begin();\n         it != my_variances.end();\n         ++it) {\n        std::string name = (*it).first;\n        if (_variances.count(name) == 0) {\n            \/\/ set a flag and warn?\n            fprintf(stderr, \"Unknown variance %s\\n\", name.c_str());\n            continue;\n        }\n        kf_variance &variance = _variances[name];\n        evaluate_variance(variance, (*it).second);\n    }\n}\n\nvoid Analyzer_Good_KF::close_result_flags()\n{\n    _result_flags->set_T_stop(_vehicle->T());\n    add_result(_result_flags);\n    _result_flags = NULL;\n}\n\nvoid Analyzer_Good_KF::open_result_flags(uint16_t flags)\n{\n    _result_flags = new Analyzer_Good_KF_Result_Flags();\n    _result_flags->set_T_start(_vehicle->T()); \n    _result_flags->set_status(analyzer_status_fail);\n    _result_flags->set_flags(flags);\n    _result_flags->add_source(_data_sources.get(string_format(\"%s_FLAGS\", shortname().c_str())));\n    _result_flags->set_reason(string_format(\"The %s status report indicates a problem with the EKF\", shortname().c_str()));\n    _result_flags->set_flags(this->flags());\n\n    _result_flags->add_evidence(string_format(\"flags=%d\", flags));\n    \/\/ TODO: put the flags and the \"bad\" descrption into a structure\n    _result_flags->increase_severity_score(10);\n    if (!(flags & EKF_ATTITUDE)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"attitude estimate bad\");\n    }\n    if (!(flags & EKF_VELOCITY_HORIZ)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"horizontal velocity estimate bad\");\n    }\n    if (!(flags & EKF_VELOCITY_VERT)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"vertical velocity estimate bad\");\n    }\n    if (!(flags & EKF_POS_HORIZ_REL)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"horizontal position (relative) estimate bad\");\n    }\n    if (!(flags & EKF_POS_HORIZ_ABS)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"horizontal position (absolute) estimate bad\");\n    }\n    if (!(flags & EKF_POS_VERT_ABS)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"vertical position (absolute) estimate bad\");\n    }\n    if (!(flags & EKF_POS_VERT_AGL)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"vertical position (above ground) estimate bad\");\n    }\n    if (flags & EKF_CONST_POS_MODE) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"In constant position mode (no abs or rel position)\");\n    }\n    if (!(flags & EKF_PRED_POS_HORIZ_REL)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"Predicted horizontal position (relative) bad\");\n    }\n    if (!(flags & EKF_PRED_POS_HORIZ_ABS)) {\n        _result_flags->increase_severity_score(1);\n        _result_flags->add_evidence(\"Predicted horizontal position (absolute) bad\");\n    }\n\n    if (_vehicle->any_acc_clipping()) {\n        _result_flags->add_evidence(\"Vehicle Accelerometers Clipping\");\n    }\n}\n\n\n\/\/ FIXME: should be taking timestamps from ekf_flags_t rather than\n\/\/ _vehicle->T()\nvoid Analyzer_Good_KF::evaluate_flags()\n{\n    if (_result_flags == NULL) {\n        if (flags_T()) {\n            if (flags_bad(flags())) {\n                \/\/ start a new incident\n                open_result_flags(flags());\n            }\n        }\n    } else {\n        \/\/ ::fprintf(stderr, \"flags: %d\\n\", _vehicle->ekf_flags());\n        \/\/ incident is under way\n        if (_result_flags->flags() != flags()) {\n            \/\/ close off the old one\n            close_result_flags();\n            _result_flags = NULL;\n            if (flags_bad(flags())) {\n                \/\/ new flags are also bad!\n                open_result_flags(flags());\n            }\n        }\n    }\n}\n\n\nvoid Analyzer_Good_KF::evaluate()\n{\n    evaluate_variances();\n    evaluate_flags();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"native_handler.h\"\n#include \"include\/cef_base.h\"\n#include \"client_handler.h\"\n#include <iostream>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <dirent.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <stdlib.h>\n#include <vector>\n\nusing namespace std;\n\nNativeHandler::NativeHandler() :\n\t\tCefV8Handler() {\n\tobject = CefV8Value::CreateObject(NULL, NULL);\n\n\tconst char *functionNames[] = { \"exists\", \"alert\", \"read\", \"write\",\n\t\t\t\"absolute\", \"list\", \"isFile\", \"isDirectory\", \"remove\", \"asyncList\",\n\t\t\t\"open\", \"openDialog\", \"quit\", \"writeToPasteboard\",\n\t\t\t\"readFromPasteboard\", \"showDevTools\", \"newWindow\", \"saveDialog\",\n\t\t\t\"exit\", \"watchPath\", \"unwatchPath\", \"makeDirectory\", \"move\",\n\t\t\t\"moveToTrash\" };\n\tint arrayLength = sizeof(functionNames) \/ sizeof(const char *);\n\tfor (int i = 0; i < arrayLength; i++) {\n\t\tconst char *functionName = functionNames[i];\n\t\tCefRefPtr<CefV8Value> function = CefV8Value::CreateFunction(\n\t\t\t\tfunctionName, this);\n\t\tobject->SetValue(functionName, function, V8_PROPERTY_ATTRIBUTE_NONE);\n\t}\n}\n\nvoid NativeHandler::Exists(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tstruct stat sbuf;\n\tint result = stat(path.c_str(), &sbuf);\n\tretval = CefV8Value::CreateBool(result == 0);\n}\n\nvoid NativeHandler::Read(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tint fd = open(path.c_str(), O_RDONLY);\n\tif (fd < 0)\n\t\treturn;\n\n\tchar buffer[8192];\n\tint r;\n\tstring value;\n\twhile ((r = read(fd, buffer, sizeof buffer)) > 0)\n\t\tvalue.append(buffer, 0, r);\n\tclose(fd);\n\tretval = CefV8Value::CreateString(value);\n}\n\nvoid NativeHandler::Absolute(const CefString& name,\n\t\tCefRefPtr<CefV8Value> object, const CefV8ValueList& arguments,\n\t\tCefRefPtr<CefV8Value>& retval, CefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tif (path[0] == '~') {\n\t\tstring resolved = getenv(\"HOME\");\n\t\tresolved.append(path.substr(1));\n\t\tretval = CefV8Value::CreateString(resolved);\n\t} else\n\t\tretval = CefV8Value::CreateString(path);\n}\n\nvoid NativeHandler::List(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tDIR *dir;\n\tif ((dir = opendir(path.c_str())) == NULL)\n\t\treturn;\n\n\tvector < string > paths;\n\tdirent *entry;\n\n\twhile ((entry = readdir(dir)) != NULL) {\n\t\tif (strcmp(entry->d_name, \".\") == 0)\n\t\t\tcontinue;\n\t\tif (strcmp(entry->d_name, \"..\") == 0)\n\t\t\tcontinue;\n\t\tpaths.push_back(entry->d_name);\n\t}\n\n\tclosedir(dir);\n\n\tretval = CefV8Value::CreateArray();\n\tfor (uint i = 0; i < paths.size(); i++)\n\t\tretval->SetValue(i, CefV8Value::CreateString(path + \"\/\" + paths[i]));\n}\n\nvoid NativeHandler::IsFile(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tstruct stat sbuf;\n\tint result = stat(path.c_str(), &sbuf);\n\tretval = CefV8Value::CreateBool(result == 0 && S_ISREG(sbuf.st_mode));\n}\n\nvoid NativeHandler::IsDirectory(const CefString& name,\n\t\tCefRefPtr<CefV8Value> object, const CefV8ValueList& arguments,\n\t\tCefRefPtr<CefV8Value>& retval, CefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tstruct stat sbuf;\n\tint result = stat(path.c_str(), &sbuf);\n\tretval = CefV8Value::CreateBool(result == 0 && S_ISDIR(sbuf.st_mode));\n}\n\nvoid NativeHandler::OpenDialog(const CefString& name,\n\t\tCefRefPtr<CefV8Value> object, const CefV8ValueList& arguments,\n\t\tCefRefPtr<CefV8Value>& retval, CefString& exception) {\n\tGtkWidget *dialog;\n\tdialog = gtk_file_chooser_dialog_new(\"Open File\", GTK_WINDOW(window),\n\t\t\tGTK_FILE_CHOOSER_ACTION_OPEN, GTK_STOCK_CANCEL, GTK_RESPONSE_CANCEL,\n\t\t\tGTK_STOCK_OPEN, GTK_RESPONSE_ACCEPT, NULL);\n\tif (gtk_dialog_run(GTK_DIALOG(dialog)) == GTK_RESPONSE_ACCEPT) {\n\t\tchar *filename;\n\t\tfilename = gtk_file_chooser_get_filename(GTK_FILE_CHOOSER(dialog));\n\t\tretval = CefV8Value::CreateString(filename);\n\t\tg_free(filename);\n\t} else\n\t\tretval = CefV8Value::CreateNull();\n\n\tgtk_widget_destroy(dialog);\n}\n\nvoid NativeHandler::Open(const CefString& name,\n\t\tCefRefPtr<CefV8Value> object, const CefV8ValueList& arguments,\n\t\tCefRefPtr<CefV8Value>& retval, CefString& exception) {\n\tpath = arguments[0]->GetStringValue().ToString();\n\tCefV8Context::GetCurrentContext()->GetBrowser()->Reload();\n}\n\nbool NativeHandler::Execute(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\n\tif (name == \"exists\")\n\t\tExists(name, object, arguments, retval, exception);\n\telse if (name == \"read\")\n\t\tRead(name, object, arguments, retval, exception);\n\telse if (name == \"absolute\")\n\t\tAbsolute(name, object, arguments, retval, exception);\n\telse if (name == \"list\")\n\t\tList(name, object, arguments, retval, exception);\n\telse if (name == \"isFile\")\n\t\tIsFile(name, object, arguments, retval, exception);\n\telse if (name == \"isDirectory\")\n\t\tIsDirectory(name, object, arguments, retval, exception);\n\telse if (name == \"showDevTools\")\n\t\tCefV8Context::GetCurrentContext()->GetBrowser()->ShowDevTools();\n\telse if (name == \"openDialog\")\n\t\tOpenDialog(name, object, arguments, retval, exception);\n\telse if(name ==\"open\")\n\t\tOpen(name, object, arguments, retval, exception);\n\telse\n\t\tcout << \"Unhandled -> \" + name.ToString() << \" : \"\n\t\t\t\t<< arguments[0]->GetStringValue().ToString() << endl;\n\treturn true;\n}\n<commit_msg>Add support for recursive directory listing<commit_after>#include \"native_handler.h\"\n#include \"include\/cef_base.h\"\n#include \"client_handler.h\"\n#include <iostream>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <dirent.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <stdlib.h>\n#include <vector>\n\nusing namespace std;\n\nNativeHandler::NativeHandler() :\n\t\tCefV8Handler() {\n\tobject = CefV8Value::CreateObject(NULL, NULL);\n\n\tconst char *functionNames[] = { \"exists\", \"alert\", \"read\", \"write\",\n\t\t\t\"absolute\", \"list\", \"isFile\", \"isDirectory\", \"remove\", \"asyncList\",\n\t\t\t\"open\", \"openDialog\", \"quit\", \"writeToPasteboard\",\n\t\t\t\"readFromPasteboard\", \"showDevTools\", \"newWindow\", \"saveDialog\",\n\t\t\t\"exit\", \"watchPath\", \"unwatchPath\", \"makeDirectory\", \"move\",\n\t\t\t\"moveToTrash\" };\n\tint arrayLength = sizeof(functionNames) \/ sizeof(const char *);\n\tfor (int i = 0; i < arrayLength; i++) {\n\t\tconst char *functionName = functionNames[i];\n\t\tCefRefPtr<CefV8Value> function = CefV8Value::CreateFunction(\n\t\t\t\tfunctionName, this);\n\t\tobject->SetValue(functionName, function, V8_PROPERTY_ATTRIBUTE_NONE);\n\t}\n}\n\nvoid NativeHandler::Exists(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tstruct stat sbuf;\n\tint result = stat(path.c_str(), &sbuf);\n\tretval = CefV8Value::CreateBool(result == 0);\n}\n\nvoid NativeHandler::Read(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tint fd = open(path.c_str(), O_RDONLY);\n\tif (fd < 0)\n\t\treturn;\n\n\tchar buffer[8192];\n\tint r;\n\tstring value;\n\twhile ((r = read(fd, buffer, sizeof buffer)) > 0)\n\t\tvalue.append(buffer, 0, r);\n\tclose(fd);\n\tretval = CefV8Value::CreateString(value);\n}\n\nvoid NativeHandler::Absolute(const CefString& name,\n\t\tCefRefPtr<CefV8Value> object, const CefV8ValueList& arguments,\n\t\tCefRefPtr<CefV8Value>& retval, CefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tif (path[0] == '~') {\n\t\tstring resolved = getenv(\"HOME\");\n\t\tresolved.append(path.substr(1));\n\t\tretval = CefV8Value::CreateString(resolved);\n\t} else\n\t\tretval = CefV8Value::CreateString(path);\n}\n\nvoid ListDirectory(string path, vector<string>* paths, bool recursive) {\n\tDIR *dir;\n\tif ((dir = opendir(path.c_str())) == NULL)\n\t\treturn;\n\n\tdirent *entry;\n\n\twhile ((entry = readdir(dir)) != NULL) {\n\t\tif (strcmp(entry->d_name, \".\") == 0)\n\t\t\tcontinue;\n\t\tif (strcmp(entry->d_name, \"..\") == 0)\n\t\t\tcontinue;\n\t\tstring entryPath;\n\t\tentryPath = path + \"\/\" + entry->d_name;\n\t\tpaths->push_back(entryPath);\n\t\tif (recursive)\n\t\t\tListDirectory(entryPath, paths, recursive);\n\t}\n\n\tclosedir(dir);\n}\n\nvoid NativeHandler::List(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tbool recursive = arguments[1]->GetBoolValue();\n\tvector < string > *paths = new vector<string>;\n\tListDirectory(path, paths, recursive);\n\n\tretval = CefV8Value::CreateArray();\n\tfor (uint i = 0; i < paths->size(); i++)\n\t\tretval->SetValue(i, CefV8Value::CreateString(paths->at(i)));\n\tfree (paths);\n}\n\nvoid NativeHandler::IsFile(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tstruct stat sbuf;\n\tint result = stat(path.c_str(), &sbuf);\n\tretval = CefV8Value::CreateBool(result == 0 && S_ISREG(sbuf.st_mode));\n}\n\nvoid NativeHandler::IsDirectory(const CefString& name,\n\t\tCefRefPtr<CefV8Value> object, const CefV8ValueList& arguments,\n\t\tCefRefPtr<CefV8Value>& retval, CefString& exception) {\n\tstring path = arguments[0]->GetStringValue().ToString();\n\tstruct stat sbuf;\n\tint result = stat(path.c_str(), &sbuf);\n\tretval = CefV8Value::CreateBool(result == 0 && S_ISDIR(sbuf.st_mode));\n}\n\nvoid NativeHandler::OpenDialog(const CefString& name,\n\t\tCefRefPtr<CefV8Value> object, const CefV8ValueList& arguments,\n\t\tCefRefPtr<CefV8Value>& retval, CefString& exception) {\n\tGtkWidget *dialog;\n\tdialog = gtk_file_chooser_dialog_new(\"Open File\", GTK_WINDOW(window),\n\t\t\tGTK_FILE_CHOOSER_ACTION_OPEN, GTK_STOCK_CANCEL, GTK_RESPONSE_CANCEL,\n\t\t\tGTK_STOCK_OPEN, GTK_RESPONSE_ACCEPT, NULL);\n\tif (gtk_dialog_run(GTK_DIALOG(dialog)) == GTK_RESPONSE_ACCEPT) {\n\t\tchar *filename;\n\t\tfilename = gtk_file_chooser_get_filename(GTK_FILE_CHOOSER(dialog));\n\t\tretval = CefV8Value::CreateString(filename);\n\t\tg_free(filename);\n\t} else\n\t\tretval = CefV8Value::CreateNull();\n\n\tgtk_widget_destroy(dialog);\n}\n\nvoid NativeHandler::Open(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\tpath = arguments[0]->GetStringValue().ToString();\n\tCefV8Context::GetCurrentContext()->GetBrowser()->Reload();\n}\n\nbool NativeHandler::Execute(const CefString& name, CefRefPtr<CefV8Value> object,\n\t\tconst CefV8ValueList& arguments, CefRefPtr<CefV8Value>& retval,\n\t\tCefString& exception) {\n\n\tif (name == \"exists\")\n\t\tExists(name, object, arguments, retval, exception);\n\telse if (name == \"read\")\n\t\tRead(name, object, arguments, retval, exception);\n\telse if (name == \"absolute\")\n\t\tAbsolute(name, object, arguments, retval, exception);\n\telse if (name == \"list\")\n\t\tList(name, object, arguments, retval, exception);\n\telse if (name == \"isFile\")\n\t\tIsFile(name, object, arguments, retval, exception);\n\telse if (name == \"isDirectory\")\n\t\tIsDirectory(name, object, arguments, retval, exception);\n\telse if (name == \"showDevTools\")\n\t\tCefV8Context::GetCurrentContext()->GetBrowser()->ShowDevTools();\n\telse if (name == \"openDialog\")\n\t\tOpenDialog(name, object, arguments, retval, exception);\n\telse if (name == \"open\")\n\t\tOpen(name, object, arguments, retval, exception);\n\telse\n\t\tcout << \"Unhandled -> \" + name.ToString() << \" : \"\n\t\t\t\t<< arguments[0]->GetStringValue().ToString() << endl;\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2013-2021 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\/fontrendering\/processors\/textoverlaygl.h>\n#include <modules\/fontrendering\/util\/fontutils.h>\n\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/datastructures\/image\/image.h>\n#include <modules\/opengl\/inviwoopengl.h>\n#include <modules\/opengl\/texture\/textureutils.h>\n#include <modules\/opengl\/openglutils.h>\n#include <modules\/opengl\/shader\/shaderutils.h>\n#include <modules\/opengl\/image\/imagegl.h>\n#include <inviwo\/core\/util\/assertion.h>\n#include <inviwo\/core\/util\/rendercontext.h>\n#include <inviwo\/core\/util\/zip.h>\n#include <inviwo\/core\/io\/serialization\/versionconverter.h>\n\n#include <cctype>\n#include <locale>\n\n#include <fmt\/format.h>\n#include <fmt\/args.h>\n\nnamespace inviwo {\n\nconst std::string TextOverlayProperty::classIdentifier = \"org.inviwo.TextOverlayProperty\";\nstd::string TextOverlayProperty::getClassIdentifier() const { return classIdentifier; }\n\nTextOverlayProperty::TextOverlayProperty(std::string_view identifier, std::string_view displayName,\n                                         InvalidationLevel invalidationLevel,\n                                         PropertySemantics semantics)\n    : CompositeProperty(identifier, displayName, invalidationLevel, semantics)\n    , text(\"text\", \"Text\", \"Lorem ipsum etc.\", InvalidationLevel::InvalidOutput,\n           PropertySemantics::TextEditor)\n    , position(\"position\", \"Position\", vec2(0.0f), vec2(0.0f), vec2(1.0f), vec2(0.01f))\n    , offset(\"offset\", \"Offset (Pixel)\", ivec2(0), ivec2(-100), ivec2(100)) {\n    addProperties(text, position, offset);\n}\nTextOverlayProperty::TextOverlayProperty(const TextOverlayProperty& rhs)\n    : CompositeProperty(rhs), text{rhs.text}, position{rhs.position}, offset{rhs.offset} {\n    addProperties(text, position, offset);\n}\nTextOverlayProperty* TextOverlayProperty::clone() const { return new TextOverlayProperty(*this); }\n\nconst ProcessorInfo TextOverlayGL::processorInfo_{\n    \"org.inviwo.TextOverlayGL\",  \/\/ Class identifier\n    \"Text Overlay\",              \/\/ Display name\n    \"Drawing\",                   \/\/ Category\n    CodeState::Stable,           \/\/ Code state\n    \"GL, Font, Text\",            \/\/ Tags\n};\nconst ProcessorInfo TextOverlayGL::getProcessorInfo() const { return processorInfo_; }\n\nTextOverlayGL::TextOverlayGL()\n    : Processor()\n    , inport_(\"inport\")\n    , outport_(\"outport\")\n    , enable_(\"enable\", \"Enabled\", true)\n    , texts_{\"texts\", \"Texts\", std::make_unique<TextOverlayProperty>(\"text0\", \"Text 0\"), 0,\n             ListPropertyUIFlag::Add | ListPropertyUIFlag::Remove}\n    , color_(\"color\", \"Color\", vec4(1.0f), vec4(0.0f), vec4(1.0f), vec4(0.01f),\n             InvalidationLevel::InvalidOutput, PropertySemantics::Color)\n    , font_(\"font\", \"Font Settings\")\n    , args_{\"args\", \"Arguments\",\n            []() {\n                std::vector<std::unique_ptr<Property>> props;\n                props.emplace_back(std::make_unique<StringProperty>(\"arg0\", \"String Arg 0\"));\n                props.emplace_back(std::make_unique<IntProperty>(\"arg0\", \"Int Arg 0\"));\n                props.emplace_back(std::make_unique<DoubleProperty>(\"arg0\", \"Double Arg 0\"));\n                return props;\n            }(),\n            0, ListPropertyUIFlag::Add | ListPropertyUIFlag::Remove}\n    , textRenderer_{[]() {\n        \/\/ ensure the default context is active when creating the TextRenderer\n        RenderContext::getPtr()->activateDefaultRenderContext();\n        return TextRenderer{};\n    }()} {\n\n    addPorts(inport_, outport_);\n    addProperties(enable_, font_, texts_, args_);\n    font_.addProperties(color_);\n    inport_.setOptional(true);\n\n    texts_.constructProperty(0);\n    font_.fontFace_.setSelectedIdentifier(\"arial\");\n    font_.fontSize_.set(14);\n\n    setAllPropertiesCurrentStateAsDefault();\n}\n\nvoid TextOverlayGL::process() {\n    if (!enable_.get()) {\n        outport_.setData(inport_.getData());\n        return;\n    }\n\n    if (font_.fontFace_.isModified()) {\n        textRenderer_.setFont(font_.fontFace_.get());\n    }\n\n    \/\/ check whether a property was modified\n    if (textObjects_.size() != texts_.size() || texts_.isModified() || color_.isModified() ||\n        font_.isModified() || util::any_of(args_.getProperties(), &Property::isModified)) {\n        updateCache();\n    }\n\n    \/\/ draw cached overlay on top of the input image\n    if (inport_.isReady()) {\n        utilgl::activateTargetAndCopySource(outport_, inport_, ImageType::ColorDepth);\n    } else {\n        utilgl::activateAndClearTarget(outport_, ImageType::ColorDepth);\n    }\n\n    utilgl::DepthFuncState depthFunc(GL_ALWAYS);\n    utilgl::BlendModeState blending(GL_ONE, GL_ONE_MINUS_SRC_ALPHA);\n\n    for (auto&& [item, tex] : util::zip(texts_, textObjects_)) {\n        if (auto tp = dynamic_cast<const TextOverlayProperty*>(item)) {\n            \/\/ use integer position for best results\n            vec2 size(tex.bbox.textExtent);\n            vec2 shift = 0.5f * size * (font_.anchorPos_.get() + vec2(1.0f, 1.0f));\n\n            ivec2 pos(tp->position.get() * vec2(outport_.getDimensions()));\n            pos += tp->offset.get() - ivec2(shift);\n\n            \/\/ render texture containing the text onto the current canvas\n            textureRenderer_.render(tex.texture, pos + tex.bbox.glyphsOrigin,\n                                    outport_.getDimensions());\n        }\n    }\n\n    utilgl::deactivateCurrentTarget();\n}\n\nvoid TextOverlayGL::updateCache() {\n    textRenderer_.setFontSize(font_.fontSize_.get());\n    textRenderer_.setLineSpacing(font_.lineSpacing_.get());\n\n    auto store = fmt::dynamic_format_arg_store<fmt::format_context>();\n    for (auto item : args_) {\n        if (auto sp = dynamic_cast<const StringProperty*>(item)) {\n            store.push_back(fmt::arg(sp->getIdentifier().c_str(), sp->get()));\n        } else if (auto ip = dynamic_cast<const IntProperty*>(item)) {\n            store.push_back(fmt::arg(ip->getIdentifier().c_str(), ip->get()));\n        } else if (auto dp = dynamic_cast<const DoubleProperty*>(item)) {\n            store.push_back(fmt::arg(dp->getIdentifier().c_str(), dp->get()));\n        }\n    }\n\n    textObjects_.resize(texts_.size());\n    for (auto&& [item, tex] : util::zip(texts_, textObjects_)) {\n        if (auto tp = dynamic_cast<const TextOverlayProperty*>(item)) {\n            std::string text;\n            try {\n                text = fmt::vformat(tp->text.get(), store);\n            } catch (const fmt::format_error&) {\n                LogWarn(\n                    fmt::format(\"Invalid formatting string {}:'{}'\\nFormat uses fmt syntax, args \"\n                                \"can be named by index {{0}} or by name {{arg0}}\",\n                                tp->getPath(), tp->text.get()));\n                text = \"<Invalid Format!>\";\n            }\n            tex = util::createTextTextureObject(textRenderer_, text, color_.get(), tex.texture);\n        }\n    }\n}\n\n}  \/\/ namespace inviwo\n<commit_msg>Fontrendering: fmt fix<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2013-2021 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\/fontrendering\/processors\/textoverlaygl.h>\n#include <modules\/fontrendering\/util\/fontutils.h>\n\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/datastructures\/image\/image.h>\n#include <modules\/opengl\/inviwoopengl.h>\n#include <modules\/opengl\/texture\/textureutils.h>\n#include <modules\/opengl\/openglutils.h>\n#include <modules\/opengl\/shader\/shaderutils.h>\n#include <modules\/opengl\/image\/imagegl.h>\n#include <inviwo\/core\/util\/assertion.h>\n#include <inviwo\/core\/util\/rendercontext.h>\n#include <inviwo\/core\/util\/zip.h>\n#include <inviwo\/core\/io\/serialization\/versionconverter.h>\n\n#include <cctype>\n#include <locale>\n\n#include <fmt\/format.h>\n\n#if __has_include(<fmt\/args.h>) \/\/ New in fmt v8\n#include <fmt\/args.h>\n#endif\n\nnamespace inviwo {\n\nconst std::string TextOverlayProperty::classIdentifier = \"org.inviwo.TextOverlayProperty\";\nstd::string TextOverlayProperty::getClassIdentifier() const { return classIdentifier; }\n\nTextOverlayProperty::TextOverlayProperty(std::string_view identifier, std::string_view displayName,\n                                         InvalidationLevel invalidationLevel,\n                                         PropertySemantics semantics)\n    : CompositeProperty(identifier, displayName, invalidationLevel, semantics)\n    , text(\"text\", \"Text\", \"Lorem ipsum etc.\", InvalidationLevel::InvalidOutput,\n           PropertySemantics::TextEditor)\n    , position(\"position\", \"Position\", vec2(0.0f), vec2(0.0f), vec2(1.0f), vec2(0.01f))\n    , offset(\"offset\", \"Offset (Pixel)\", ivec2(0), ivec2(-100), ivec2(100)) {\n    addProperties(text, position, offset);\n}\nTextOverlayProperty::TextOverlayProperty(const TextOverlayProperty& rhs)\n    : CompositeProperty(rhs), text{rhs.text}, position{rhs.position}, offset{rhs.offset} {\n    addProperties(text, position, offset);\n}\nTextOverlayProperty* TextOverlayProperty::clone() const { return new TextOverlayProperty(*this); }\n\nconst ProcessorInfo TextOverlayGL::processorInfo_{\n    \"org.inviwo.TextOverlayGL\",  \/\/ Class identifier\n    \"Text Overlay\",              \/\/ Display name\n    \"Drawing\",                   \/\/ Category\n    CodeState::Stable,           \/\/ Code state\n    \"GL, Font, Text\",            \/\/ Tags\n};\nconst ProcessorInfo TextOverlayGL::getProcessorInfo() const { return processorInfo_; }\n\nTextOverlayGL::TextOverlayGL()\n    : Processor()\n    , inport_(\"inport\")\n    , outport_(\"outport\")\n    , enable_(\"enable\", \"Enabled\", true)\n    , texts_{\"texts\", \"Texts\", std::make_unique<TextOverlayProperty>(\"text0\", \"Text 0\"), 0,\n             ListPropertyUIFlag::Add | ListPropertyUIFlag::Remove}\n    , color_(\"color\", \"Color\", vec4(1.0f), vec4(0.0f), vec4(1.0f), vec4(0.01f),\n             InvalidationLevel::InvalidOutput, PropertySemantics::Color)\n    , font_(\"font\", \"Font Settings\")\n    , args_{\"args\", \"Arguments\",\n            []() {\n                std::vector<std::unique_ptr<Property>> props;\n                props.emplace_back(std::make_unique<StringProperty>(\"arg0\", \"String Arg 0\"));\n                props.emplace_back(std::make_unique<IntProperty>(\"arg0\", \"Int Arg 0\"));\n                props.emplace_back(std::make_unique<DoubleProperty>(\"arg0\", \"Double Arg 0\"));\n                return props;\n            }(),\n            0, ListPropertyUIFlag::Add | ListPropertyUIFlag::Remove}\n    , textRenderer_{[]() {\n        \/\/ ensure the default context is active when creating the TextRenderer\n        RenderContext::getPtr()->activateDefaultRenderContext();\n        return TextRenderer{};\n    }()} {\n\n    addPorts(inport_, outport_);\n    addProperties(enable_, font_, texts_, args_);\n    font_.addProperties(color_);\n    inport_.setOptional(true);\n\n    texts_.constructProperty(0);\n    font_.fontFace_.setSelectedIdentifier(\"arial\");\n    font_.fontSize_.set(14);\n\n    setAllPropertiesCurrentStateAsDefault();\n}\n\nvoid TextOverlayGL::process() {\n    if (!enable_.get()) {\n        outport_.setData(inport_.getData());\n        return;\n    }\n\n    if (font_.fontFace_.isModified()) {\n        textRenderer_.setFont(font_.fontFace_.get());\n    }\n\n    \/\/ check whether a property was modified\n    if (textObjects_.size() != texts_.size() || texts_.isModified() || color_.isModified() ||\n        font_.isModified() || util::any_of(args_.getProperties(), &Property::isModified)) {\n        updateCache();\n    }\n\n    \/\/ draw cached overlay on top of the input image\n    if (inport_.isReady()) {\n        utilgl::activateTargetAndCopySource(outport_, inport_, ImageType::ColorDepth);\n    } else {\n        utilgl::activateAndClearTarget(outport_, ImageType::ColorDepth);\n    }\n\n    utilgl::DepthFuncState depthFunc(GL_ALWAYS);\n    utilgl::BlendModeState blending(GL_ONE, GL_ONE_MINUS_SRC_ALPHA);\n\n    for (auto&& [item, tex] : util::zip(texts_, textObjects_)) {\n        if (auto tp = dynamic_cast<const TextOverlayProperty*>(item)) {\n            \/\/ use integer position for best results\n            vec2 size(tex.bbox.textExtent);\n            vec2 shift = 0.5f * size * (font_.anchorPos_.get() + vec2(1.0f, 1.0f));\n\n            ivec2 pos(tp->position.get() * vec2(outport_.getDimensions()));\n            pos += tp->offset.get() - ivec2(shift);\n\n            \/\/ render texture containing the text onto the current canvas\n            textureRenderer_.render(tex.texture, pos + tex.bbox.glyphsOrigin,\n                                    outport_.getDimensions());\n        }\n    }\n\n    utilgl::deactivateCurrentTarget();\n}\n\nvoid TextOverlayGL::updateCache() {\n    textRenderer_.setFontSize(font_.fontSize_.get());\n    textRenderer_.setLineSpacing(font_.lineSpacing_.get());\n\n    auto store = fmt::dynamic_format_arg_store<fmt::format_context>();\n    for (auto item : args_) {\n        if (auto sp = dynamic_cast<const StringProperty*>(item)) {\n            store.push_back(fmt::arg(sp->getIdentifier().c_str(), sp->get()));\n        } else if (auto ip = dynamic_cast<const IntProperty*>(item)) {\n            store.push_back(fmt::arg(ip->getIdentifier().c_str(), ip->get()));\n        } else if (auto dp = dynamic_cast<const DoubleProperty*>(item)) {\n            store.push_back(fmt::arg(dp->getIdentifier().c_str(), dp->get()));\n        }\n    }\n\n    textObjects_.resize(texts_.size());\n    for (auto&& [item, tex] : util::zip(texts_, textObjects_)) {\n        if (auto tp = dynamic_cast<const TextOverlayProperty*>(item)) {\n            std::string text;\n            try {\n                text = fmt::vformat(tp->text.get(), store);\n            } catch (const fmt::format_error&) {\n                LogWarn(\n                    fmt::format(\"Invalid formatting string {}:'{}'\\nFormat uses fmt syntax, args \"\n                                \"can be named by index {{0}} or by name {{arg0}}\",\n                                tp->getPath(), tp->text.get()));\n                text = \"<Invalid Format!>\";\n            }\n            tex = util::createTextTextureObject(textRenderer_, text, color_.get(), tex.texture);\n        }\n    }\n}\n\n}  \/\/ namespace inviwo\n<|endoftext|>"}
{"text":"<commit_before>#include \"solve_mcf.h\"\n\nvoid cacheAlg(std::vector<trEntry> & trace, uint64_t cacheSize) {\n    std::unordered_map<std::pair<uint64_t, uint64_t>, trEntry*> cacheState;\n    uint64_t currentSize = 0;\n\n    for(size_t i=0; i<trace.size(); i++) {\n        trEntry *cur = &trace[i];\n        \/\/ check in cache\n        if(cacheState.count(std::make_pair(cur->id,cur->size)) > 0) {\n            \/\/ cache hit\n            cur->hit = true;\n        } else {\n            \/\/ cache miss\n            \/\/ admit if hasNext\n            if(cur->hasNext && cur->size < cacheSize) {\n                cacheState[std::make_pair(cur->id,cur->size)] = cur;\n                currentSize += cur->size;\n                LOG(\"admitted\",cur->id,cur->size,currentSize);\n                \n                \/\/ evict if needed\n                while(currentSize > cacheSize) {\n                    \/\/                    LOG(\"eviction needed\",currentSize,cacheSize,0);\n                    \n                    int64_t maxDistance = -1, curDistance;\n                    trEntry * evictVictim = &trace[0];\n                    for(auto & it: cacheState) {\n                        trEntry * cand = it.second;\n                        \/\/LOG(\"cache Scan id\",cand->id,cand->size,cand->nextSeen);\n                        if(cand->nextSeen > i)\n                            curDistance = (cand->nextSeen - i) * cand->size;\n                        else\n                            curDistance = (i - cand->nextSeen) * cand->size;\n                        if(curDistance > maxDistance) {\n                            maxDistance = curDistance;\n                            evictVictim = cand;\n                            \/\/LOG(\"max dist\",maxDistance,cand->id,cand->size);\n                        }\n                    }\n                    LOG(\"vict\",maxDistance,evictVictim->id,evictVictim->size);\n                    cacheState.erase(std::make_pair(evictVictim->id, evictVictim->size));\n                    currentSize -= evictVictim->size;\n                }\n            }\n        }\n    }\n}\n\nvoid printRes(std::vector<trEntry> & trace, std::string algName) {\n    uint64_t hitc = 0, reqc = 0;\n    for(auto & it: trace) {\n        reqc++;\n        if(it.hit)\n            hitc++;\n        LOG(\"tr\",it.id,it.nextSeen,it.hit);\n    }\n    std::cout << algName << \" hitc \" << hitc << \" reqc \" << reqc << \" ohr \" << double(hitc)\/reqc << std::endl;\n}\n<commit_msg>Belady2Size ex. fix<commit_after>#include \"solve_mcf.h\"\n\nvoid cacheAlg(std::vector<trEntry> & trace, uint64_t cacheSize) {\n    std::unordered_map<std::pair<uint64_t, uint64_t>, trEntry*> cacheState;\n    uint64_t currentSize = 0;\n\n    for(size_t i=0; i<trace.size(); i++) {\n        trEntry *cur = &trace[i];\n        \/\/ check in cache\n        if(cacheState.count(std::make_pair(cur->id,cur->size)) > 0) {\n            \/\/ cache hit\n            cur->hit = true;\n            cacheState[std::make_pair(cur->id,cur->size)] = cur;\n        } else {\n            \/\/ cache miss\n            \/\/ admit if hasNext\n            if(cur->hasNext && cur->size < cacheSize) {\n                cacheState[std::make_pair(cur->id,cur->size)] = cur;\n                currentSize += cur->size;\n                LOG(\"admitted\",cur->id,cur->size,currentSize);\n                \n                \/\/ evict if needed\n                while(currentSize > cacheSize) {\n                    \/\/                    LOG(\"eviction needed\",currentSize,cacheSize,0);\n                    \n                    int64_t maxDistance = -1, curDistance;\n                    trEntry * evictVictim = &trace[0];\n                    for(auto & it: cacheState) {\n                        trEntry * cand = it.second;\n                        \/\/LOG(\"cache Scan id\",cand->id,cand->size,cand->nextSeen);\n                        if(cand->nextSeen > i)\n                            curDistance = (cand->nextSeen - i) * cand->size;\n                        else\n                            curDistance = (i - cand->nextSeen) * cand->size;\n                        if(curDistance > maxDistance) {\n                            maxDistance = curDistance;\n                            evictVictim = cand;\n                            \/\/LOG(\"max dist\",maxDistance,cand->id,cand->size);\n                        }\n                    }\n                    LOG(\"vict\",maxDistance,evictVictim->id,evictVictim->size);\n                    cacheState.erase(std::make_pair(evictVictim->id, evictVictim->size));\n                    currentSize -= evictVictim->size;\n                }\n            }\n        }\n    }\n}\n\nvoid printRes(std::vector<trEntry> & trace, std::string algName) {\n    uint64_t hitc = 0, reqc = 0;\n    for(auto & it: trace) {\n        reqc++;\n        if(it.hit)\n            hitc++;\n        LOG(\"tr\",it.id,it.nextSeen,it.hit);\n    }\n    std::cout << algName << \" hitc \" << hitc << \" reqc \" << reqc << \" ohr \" << double(hitc)\/reqc << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"CueDetector.h\"\n\nCueDetector::CueDetector()\n{\n\tcueLine.resize(2);\n}\n\nCueDetector::~CueDetector()\n{\n}\n\ncv::vector<cv::Vec2i> CueDetector::detect(cv::Mat frame)\n{\n\t\/\/ Reset cueLines.\n\tcueLine[0] = cv::Vec2i(0, 0);\n\tcueLine[1] = cv::Vec2i(0, 0);\n\n\tcv::Mat croppedFrame = frame.clone(); \/\/ copy so we don't overwrite the user's view with GaussianBlur's blur call.\n\tcroppedFrame = croppedFrame(cv::Rect(CROP_X, CROP_Y, CROP_WIDTH, CROP_HEIGHT)); \/\/ Crop the image for the typical location of the cue.\n\tGaussianBlur(croppedFrame);\n\thsiSegment(croppedFrame);\n\tskeleton(croppedFrame);\n\t\/\/regHoughLines(croppedFrame, 120);\n\tprobHoughLinesCueSegments(croppedFrame);\n\n\tcv::line(frame, cv::Point(cueLine[0][0], cueLine[0][1]), cv::Point(cueLine[1][0], cueLine[1][1]), cv::Scalar(0, 0, 255), 3, CV_AA);\n\n\treturn cueLine;\n}\n\nvoid CueDetector::probHoughLinesCueSegments(cv::Mat& frame) {\n\t\/\/ Finds segments of a cue interrupted by a hand.\n\tcv::vector<cv::Vec4i> lines;\n\tHoughLinesP(frame, lines, 1, CV_PI \/ 180, HOUGH_THRESHOLD, CUE_SEGMENT_MIN_LENGTH, CUE_SEGMENT_MAX_GAP);\n\n\tcv::Mat houghMap(frame.size(), CV_8UC1, cv::Scalar(0));\n\n\tfor (size_t i = 0; i < lines.size(); i++)\n\t{\n\t\tline(houghMap, cv::Point(lines[i][0], lines[i][1]), cv::Point(lines[i][2], lines[i][3]), cv::Scalar(255), 1, CV_AA);\n\t}\n\n\tmergeCueSegments(houghMap);\n\n\timshow(\"Cue Segments\", houghMap);\n\n\tframe = houghMap.clone();\n}\n\nvoid CueDetector::mergeCueSegments(cv::Mat& frame)\n{\n\t\/\/kmeansDemo();\n\n\t\/\/ combines two cue segments into a single line segment.\n\tcv::vector<cv::Vec4i> lines;\n\tcv::Mat ptsmat;\n\tHoughLinesP(frame, lines , 1, CV_PI \/ 180, 50, 18, 100);\n\n\n\tif (lines.size() > 0)\n\t{\n\t\tcv::Mat linesMatrix = cv::Mat(lines);\n\t\tstd::cout << \"linesMatrix = \" << linesMatrix << std::endl << std::endl;\n\t\tstd::cout << \"linesMatrix_13 = \" << linesMatrix.at<int>(1, 3) << std::endl << std::endl;\n\t\t\/\/cv::Mat leftLinesMatrix = linesMatrix(cv::Rect(0, 0, 0, 0));\n\t\t\/\/std::cout << \"leftLinesMatrix = \" << linesMatrix << std::endl << std::endl;\n\t\t\/\/cv::Mat rightLinesMatrix = linesMatrix(cv::Rect(2, 0, 2, lines.size()));\n\t\t\/\/std::cout << \"rightLinesMatrix = \" << rightLinesMatrix << std::endl << std::endl;\n\n\t\t\/\/ Convert vector 'lines' to Mat 'points'.\n\t\tcv::Mat points(lines.size()*2, 2, CV_32FC1);\n\t\tcv::Mat startPoints(lines.size(), 2, CV_32FC1);\n\t\tcv::Mat endPoints(lines.size(), 2, CV_32FC1);\n\t\tpoints = cv::Scalar(0);\n\t\t\/\/ points(2 * lines.size(), 2, CV_32F);\n\t\tfor (int i = 0; i < lines.size(); i = i++)\n\t\t{\n\t\t\tfor (int j = 0; j <= 1; j++)\n\t\t\t{\n\t\t\t\tstd::cout << \"startPoint (\" << i << \", \" << j << \") = \" << lines[i][j] << std::endl;\n\t\t\t\tstartPoints.at<float>(i, j) = lines[i][j];\n\n\t\t\t\tstd::cout << \"endPoint (\" << i << \", \" << j << \") = \" << lines[i][j+2] << std::endl;\n\t\t\t\tendPoints.at<float>(i, j) = lines[i][j+2];\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Debug\n\n\t\tstd::cout << \"startPoints = \" << startPoints << std::endl;\n\t\tstd::cout << \"endPoints = \" << endPoints << std::endl;\n\n\t\t\/\/ Vertically concatenate startPoints and endPoints (undocumented, see http:\/\/answers.opencv.org\/question\/1368\/concatenating-matrices\/)\n\t\tcv::vconcat(startPoints, endPoints, points);\n\n\t\tstd::cout << \"points = \" << points << std::endl;\n\n\t\t\/\/ Calculate the mean cue endpoints.\n\t\tint K = 2;\n\t\tcv::Mat labels;\n\t\tcv::Mat centers(K, 2, points.type());\n\t\tcv::kmeans(points, K, labels, cv::TermCriteria(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER, 10, 1.0), 50, cv::KMEANS_PP_CENTERS, centers);\n\n\t\tfor (int i = 0; i < 2*lines.size(); i++)\n\t\t{\n\t\t\tint clusterIdx = labels.at<int>(i);\n\t\t\tstd::cout << \"point \" << i << \" = \" << \"class \" << clusterIdx << std::endl;\n\t\t\t\n\t\t}\n\n\t\tfor (int i = 0; i < 2; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < 2; j++)\n\t\t\t{\n\t\t\t\tint cell = centers.at<float>(i, j);\n\t\t\t\tstd::cout << \"center (\" << i << \", \" << j << \") = \" << cell << std::endl;\n\t\t\t}\n\n\t\t}\n\t}\n\n\tcv::Mat houghMap(frame.size(), CV_8UC3, cv::Scalar(0));\n\tcv::Vec4i cueCandidatesSum;\n\tcueCandidatesSum = cv::Vec4i(0, 0, 0, 0);\n\tfor (size_t i = 0; i < lines.size(); i++)\n\t{\n\t\tline(houghMap, cv::Point(lines[i][0], lines[i][1]), cv::Point(lines[i][2], lines[i][3]), cv::Scalar(255, 255, 255), 1, CV_AA);\n\t\tcueCandidatesSum += cv::Vec4i(lines[i][0], lines[i][1], lines[i][2], lines[i][3]);\n\t}\n\tfloat cueCandidatesMean[4];\n\tfor (int i = 0; i < 4; i++)\n\t{\n\t\tcueCandidatesMean[i] = cueCandidatesSum[i] \/ lines.size();\n\t}\n\n\t\/\/ Convert cropped coords to global coords.\n\tcueLine[0] = cv::Vec2i(cueCandidatesMean[0] + CROP_X, cueCandidatesMean[1] + CROP_Y);\n\tcueLine[1] = cv::Vec2i(cueCandidatesMean[2] + CROP_X, cueCandidatesMean[3] + CROP_Y);\n\n\timshow(\"Cue Lines\", houghMap);\n}\n\nvoid CueDetector::hsiSegment(cv::Mat& frame)\n{\n\t\/\/Can be used to control with trackbars the values\n\tint minH = 10;\n\tint maxH = 40;\n\n\tint minS = 1;\n\tint maxS = 170;\n\n\tint minV = 175;\n\tint maxV = 255;\n\n\tcv::Mat hsvFrame;\n\n\tcvtColor(frame, hsvFrame, cv::COLOR_BGR2HSV); \/\/Convert the captured frame from BGR to HSV\n\n\tcv::Mat hsvMask;\n\n\tinRange(hsvFrame, cv::Scalar(minH, minS, minV), cv::Scalar(maxH, maxS, maxV), hsvMask); \/\/Threshold the image\n\n\t\/\/Used to make the mask bigger (For our specific situation we want to make sure the mask\n\t\/\/includes the whole pool table, having it a bit bigger thant he pool table is not an issue.\n\tdilate(hsvMask, hsvMask, getStructuringElement(cv::MORPH_ELLIPSE, cv::Size(4, 4)));\n\n\tcv::Mat maskedFrame;\n\tframe.copyTo(maskedFrame, hsvMask);\n\tframe = maskedFrame.clone();\n\n\timshow(\"HSI Cue\", frame);\n}\n\nvoid CueDetector::GaussianBlur(cv::Mat& frame)\n{\n\t\/\/int display_dst(int delay);\n\tfor (int i = 1; i < 7; i = i + 2)\n\t{\n\t\tcv::blur(frame, frame, cv::Size(i, i), cv::Point(-1, -1));\n\t}\n}\n\nvoid CueDetector::skeleton(cv::Mat& frame)\n{\n\t\/\/ http:\/\/stackoverflow.com\/questions\/16665742\/a-good-approach-for-detecting-lines-in-an-image\n\t\/\/ http:\/\/felix.abecassis.me\/2011\/09\/opencv-morphological-skeleton\/\n\n\tcvtColor(frame, frame, cv::COLOR_BGR2GRAY); \/\/Convert the captured frame from BGR to greyscale\n\n\tcv::threshold(frame, frame, 127, 255, cv::THRESH_BINARY);\n\tcv::Mat skel(frame.size(), CV_8UC1, cv::Scalar(0));\n\tcv::Mat temp;\n\tcv::Mat eroded;\n\n\tcv::Mat element = cv::getStructuringElement(cv::MORPH_CROSS, cv::Size(3, 3));\n\n\tbool done;\n\tdo\n\t{\n\t\tcv::erode(frame, eroded, element);\n\t\tcv::dilate(eroded, temp, element); \/\/ temp = open(img)\n\t\tcv::subtract(frame, temp, temp);\n\t\tcv::bitwise_or(skel, temp, skel);\n\t\teroded.copyTo(frame);\n\n\t\tdone = (cv::countNonZero(frame) == 0);\n\t} while (!done);\n\n\tframe = skel.clone();\n}\n\nvoid CueDetector::kmeansDemo()\n{\n\tconst int MAX_CLUSTERS = 5;\n\tcv::Scalar colorTab[] =\n\t{\n\t\tcv::Scalar(0, 0, 255),\n\t\tcv::Scalar(0, 255, 0),\n\t\tcv::Scalar(255, 100, 100),\n\t\tcv::Scalar(255, 0, 255),\n\t\tcv::Scalar(0, 255, 255)\n\t};\n\n\tcv::Mat img(500, 500, CV_8UC3);\n\tcv::RNG rng(12345);\n\n\tfor (;;)\n\t{\n\t\tint k, clusterCount = rng.uniform(2, MAX_CLUSTERS + 1);\n\t\tint i, sampleCount = rng.uniform(1, 1001);\n\t\tcv::Mat points(sampleCount, 2, CV_32F), labels;\n\n\t\tclusterCount = MIN(clusterCount, sampleCount);\n\t\tcv::Mat centers;\n\n\t\t\/* generate random sample from multigaussian distribution *\/\n\t\tfor (k = 0; k < clusterCount; k++)\n\t\t{\n\t\t\tcv::Point center;\n\t\t\tcenter.x = rng.uniform(0, img.cols);\n\t\t\tcenter.y = rng.uniform(0, img.rows);\n\t\t\tcv::Mat pointChunk = points.rowRange(k*sampleCount \/ clusterCount,\n\t\t\t\tk == clusterCount - 1 ? sampleCount :\n\t\t\t\t(k + 1)*sampleCount \/ clusterCount);\n\t\t\trng.fill(pointChunk, CV_RAND_NORMAL, cv::Scalar(center.x, center.y), cv::Scalar(img.cols*0.05, img.rows*0.05));\n\t\t}\n\n\t\trandShuffle(points, 1, &rng);\n\n\t\tkmeans(points, clusterCount, labels,\n\t\t\tcv::TermCriteria(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER, 10, 1.0),\n\t\t\t3, cv::KMEANS_PP_CENTERS, centers);\n\n\t\timg = cv::Scalar::all(0);\n\n\t\tfor (i = 0; i < sampleCount; i++)\n\t\t{\n\t\t\tint clusterIdx = labels.at<int>(i);\n\t\t\tcv::Point ipt = points.at<cv::Point2f>(i);\n\t\t\tcircle(img, ipt, 2, colorTab[clusterIdx], CV_FILLED, CV_AA);\n\t\t}\n\n\t\timshow(\"clusters\", img);\n\n\t\tchar key = (char)cv::waitKey();\n\t\tif (key == 27 || key == 'q' || key == 'Q') \/\/ 'ESC'\n\t\t\tbreak;\n\t}\n}<commit_msg>Fully enabled and documented k-means cue clustering  - actually returns class centers as cue endpoints  - commented function  - TODO- remove debug messages     - left in for demonstration to team members using this version, remove for 'production'<commit_after>#include \"CueDetector.h\"\n\nCueDetector::CueDetector()\n{\n\tcueLine.resize(2);\n}\n\nCueDetector::~CueDetector()\n{\n}\n\ncv::vector<cv::Vec2i> CueDetector::detect(cv::Mat frame)\n{\n\t\/\/ Reset cueLines.\n\tcueLine[0] = cv::Vec2i(0, 0);\n\tcueLine[1] = cv::Vec2i(0, 0);\n\n\tcv::Mat croppedFrame = frame.clone(); \/\/ copy so we don't overwrite the user's view with GaussianBlur's blur call.\n\tcroppedFrame = croppedFrame(cv::Rect(CROP_X, CROP_Y, CROP_WIDTH, CROP_HEIGHT)); \/\/ Crop the image for the typical location of the cue.\n\tGaussianBlur(croppedFrame);\n\thsiSegment(croppedFrame);\n\tskeleton(croppedFrame);\n\t\/\/regHoughLines(croppedFrame, 120);\n\tprobHoughLinesCueSegments(croppedFrame);\n\n\tcv::line(frame, cv::Point(cueLine[0][0], cueLine[0][1]), cv::Point(cueLine[1][0], cueLine[1][1]), cv::Scalar(0, 0, 255), 3, CV_AA);\n\n\treturn cueLine;\n}\n\nvoid CueDetector::probHoughLinesCueSegments(cv::Mat& frame) {\n\t\/\/ Finds segments of a cue interrupted by a hand.\n\tcv::vector<cv::Vec4i> lines;\n\tHoughLinesP(frame, lines, 1, CV_PI \/ 180, HOUGH_THRESHOLD, CUE_SEGMENT_MIN_LENGTH, CUE_SEGMENT_MAX_GAP);\n\n\tcv::Mat houghMap(frame.size(), CV_8UC1, cv::Scalar(0));\n\n\tfor (size_t i = 0; i < lines.size(); i++)\n\t{\n\t\tline(houghMap, cv::Point(lines[i][0], lines[i][1]), cv::Point(lines[i][2], lines[i][3]), cv::Scalar(255), 1, CV_AA);\n\t}\n\n\tmergeCueSegments(houghMap);\n\n\timshow(\"Cue Segments\", houghMap);\n\n\tframe = houghMap.clone();\n}\n\nvoid CueDetector::mergeCueSegments(cv::Mat& frame)\n{\n\t\/\/ combines two cue segments into a single line segment.\n\tcv::vector<cv::Vec4i> lines;\n\tHoughLinesP(frame, lines , 1, CV_PI \/ 180, 50, 18, 100);\n\n\tif (lines.size() > 0)\n\t{\n\t\t\/\/ Convert vector 'lines' to Mat 'points'.\n\n\t\t\/\/ Declare startPoints and endPoints to hold respective points of detected HoughLines.\n\t\tcv::Mat startPoints(lines.size(), 2, CV_32FC1);\n\t\tcv::Mat endPoints(lines.size(), 2, CV_32FC1);\n\n\t\t\/\/ Declare allPoints to be the vertical concatenation of startPoints and endPoints.\n\t\t\/\/ Twice the length of lines because HoughLines contain two points.\n\t\tcv::Mat allPoints(lines.size()*2, 2, CV_32FC1);\n\t\tallPoints = cv::Scalar(0);\n\n\t\t\/\/ Convert n-length vector of 4-integer length vector of line boundary points to nx2 Mats.\n\t\tfor (int i = 0; i < lines.size(); i = i++)\n\t\t{\n\t\t\tfor (int j = 0; j <= 1; j++)\n\t\t\t{\n\t\t\t\t\/\/ Debug messages\n\t\t\t\tstd::cout << \"startPoint (\" << i << \", \" << j << \") = \" << lines[i][j] << std::endl;\n\t\t\t\tstartPoints.at<float>(i, j) = lines[i][j];\n\n\t\t\t\tstd::cout << \"endPoint (\" << i << \", \" << j << \") = \" << lines[i][j+2] << std::endl;\n\t\t\t\tendPoints.at<float>(i, j) = lines[i][j+2];\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Vertically concatenate startPoints and endPoints (undocumented, see http:\/\/answers.opencv.org\/question\/1368\/concatenating-matrices\/)\n\t\tcv::vconcat(startPoints, endPoints, allPoints);\n\n\t\t\/\/ Debug messages\n\t\tstd::cout << \"startPoints = \" << startPoints << std::endl;\n\t\tstd::cout << \"endPoints = \" << endPoints << std::endl;\n\t\tstd::cout << \"points = \" << allPoints << std::endl;\n\n\t\t\/\/ Calculate the mean cue endpoints using K=2-means clustering. See http:\/\/www.aishack.in\/tutorials\/kmeans-clustering-in-opencv\/\n\t\tint K = 2;\n\t\tcv::Mat labels;\n\t\tcv::Mat centers(K, 2, allPoints.type());\n\t\tcv::kmeans(allPoints, K, labels, cv::TermCriteria(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER, 10, 1.0), 50, cv::KMEANS_PP_CENTERS, centers);\n\n\t\t\/\/ Debug messages for point classifications\n\t\tfor (int i = 0; i < 2*lines.size(); i++)\n\t\t{\n\t\t\tint clusterIdx = labels.at<int>(i);\n\t\t\tstd::cout << \"point \" << i << \" = \" << \"class \" << clusterIdx << std::endl;\n\t\t\t\n\t\t}\n\n\n\t\t\/\/ Debug messages for class centres\n\t\tfor (int i = 0; i < 2; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < 2; j++)\n\t\t\t{\n\t\t\t\tint cell = centers.at<float>(i, j);\n\t\t\t\tstd::cout << \"center (\" << i << \", \" << j << \") = \" << cell << std::endl;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Convert cropped coords to global coords.\n\t\tcueLine[0] = cv::Vec2i(centers.at<float>(0, 0) + CROP_X, centers.at<float>(0, 1) + CROP_Y);\n\t\tcueLine[1] = cv::Vec2i(centers.at<float>(1, 0) + CROP_X, centers.at<float>(1, 1) + CROP_Y);\n\t}\n\telse \/\/ no lines detected\n\t{\n\t\t\/\/ Set cueLines to initial (negligable) values.\n\t\tcueLine[0] = cv::Vec2i(0, 0);\n\t\tcueLine[1] = cv::Vec2i(0, 0);\n\t}\n\n\t\/\/ Debug video display.\n\tcv::Mat houghMap(frame.size(), CV_8UC3, cv::Scalar(0));\n\tcv::Vec4i cueCandidatesSum;\n\tcueCandidatesSum = cv::Vec4i(0, 0, 0, 0);\n\tfor (size_t i = 0; i < lines.size(); i++)\n\t{\n\t\tline(houghMap, cv::Point(lines[i][0], lines[i][1]), cv::Point(lines[i][2], lines[i][3]), cv::Scalar(255, 255, 255), 1, CV_AA);\n\t}\n\n\tfloat cueCandidatesMean[4];\n\tfor (int i = 0; i < 4; i++)\n\t{\n\t\tcueCandidatesMean[i] = cueCandidatesSum[i] \/ lines.size();\n\t}\n\n\timshow(\"Cue Lines\", houghMap);\n}\n\nvoid CueDetector::hsiSegment(cv::Mat& frame)\n{\n\t\/\/Can be used to control with trackbars the values\n\tint minH = 10;\n\tint maxH = 40;\n\n\tint minS = 1;\n\tint maxS = 170;\n\n\tint minV = 175;\n\tint maxV = 255;\n\n\tcv::Mat hsvFrame;\n\n\tcvtColor(frame, hsvFrame, cv::COLOR_BGR2HSV); \/\/Convert the captured frame from BGR to HSV\n\n\tcv::Mat hsvMask;\n\n\tinRange(hsvFrame, cv::Scalar(minH, minS, minV), cv::Scalar(maxH, maxS, maxV), hsvMask); \/\/Threshold the image\n\n\t\/\/Used to make the mask bigger (For our specific situation we want to make sure the mask\n\t\/\/includes the whole pool table, having it a bit bigger thant he pool table is not an issue.\n\tdilate(hsvMask, hsvMask, getStructuringElement(cv::MORPH_ELLIPSE, cv::Size(4, 4)));\n\n\tcv::Mat maskedFrame;\n\tframe.copyTo(maskedFrame, hsvMask);\n\tframe = maskedFrame.clone();\n\n\timshow(\"HSI Cue\", frame);\n}\n\nvoid CueDetector::GaussianBlur(cv::Mat& frame)\n{\n\t\/\/int display_dst(int delay);\n\tfor (int i = 1; i < 7; i = i + 2)\n\t{\n\t\tcv::blur(frame, frame, cv::Size(i, i), cv::Point(-1, -1));\n\t}\n}\n\nvoid CueDetector::skeleton(cv::Mat& frame)\n{\n\t\/\/ http:\/\/stackoverflow.com\/questions\/16665742\/a-good-approach-for-detecting-lines-in-an-image\n\t\/\/ http:\/\/felix.abecassis.me\/2011\/09\/opencv-morphological-skeleton\/\n\n\tcvtColor(frame, frame, cv::COLOR_BGR2GRAY); \/\/Convert the captured frame from BGR to greyscale\n\n\tcv::threshold(frame, frame, 127, 255, cv::THRESH_BINARY);\n\tcv::Mat skel(frame.size(), CV_8UC1, cv::Scalar(0));\n\tcv::Mat temp;\n\tcv::Mat eroded;\n\n\tcv::Mat element = cv::getStructuringElement(cv::MORPH_CROSS, cv::Size(3, 3));\n\n\tbool done;\n\tdo\n\t{\n\t\tcv::erode(frame, eroded, element);\n\t\tcv::dilate(eroded, temp, element); \/\/ temp = open(img)\n\t\tcv::subtract(frame, temp, temp);\n\t\tcv::bitwise_or(skel, temp, skel);\n\t\teroded.copyTo(frame);\n\n\t\tdone = (cv::countNonZero(frame) == 0);\n\t} while (!done);\n\n\tframe = skel.clone();\n}\n\nvoid CueDetector::kmeansDemo()\n{\n\tconst int MAX_CLUSTERS = 5;\n\tcv::Scalar colorTab[] =\n\t{\n\t\tcv::Scalar(0, 0, 255),\n\t\tcv::Scalar(0, 255, 0),\n\t\tcv::Scalar(255, 100, 100),\n\t\tcv::Scalar(255, 0, 255),\n\t\tcv::Scalar(0, 255, 255)\n\t};\n\n\tcv::Mat img(500, 500, CV_8UC3);\n\tcv::RNG rng(12345);\n\n\tfor (;;)\n\t{\n\t\tint k, clusterCount = rng.uniform(2, MAX_CLUSTERS + 1);\n\t\tint i, sampleCount = rng.uniform(1, 1001);\n\t\tcv::Mat points(sampleCount, 2, CV_32F), labels;\n\n\t\tclusterCount = MIN(clusterCount, sampleCount);\n\t\tcv::Mat centers;\n\n\t\t\/* generate random sample from multigaussian distribution *\/\n\t\tfor (k = 0; k < clusterCount; k++)\n\t\t{\n\t\t\tcv::Point center;\n\t\t\tcenter.x = rng.uniform(0, img.cols);\n\t\t\tcenter.y = rng.uniform(0, img.rows);\n\t\t\tcv::Mat pointChunk = points.rowRange(k*sampleCount \/ clusterCount,\n\t\t\t\tk == clusterCount - 1 ? sampleCount :\n\t\t\t\t(k + 1)*sampleCount \/ clusterCount);\n\t\t\trng.fill(pointChunk, CV_RAND_NORMAL, cv::Scalar(center.x, center.y), cv::Scalar(img.cols*0.05, img.rows*0.05));\n\t\t}\n\n\t\trandShuffle(points, 1, &rng);\n\n\t\tkmeans(points, clusterCount, labels,\n\t\t\tcv::TermCriteria(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER, 10, 1.0),\n\t\t\t3, cv::KMEANS_PP_CENTERS, centers);\n\n\t\timg = cv::Scalar::all(0);\n\n\t\tfor (i = 0; i < sampleCount; i++)\n\t\t{\n\t\t\tint clusterIdx = labels.at<int>(i);\n\t\t\tcv::Point ipt = points.at<cv::Point2f>(i);\n\t\t\tcircle(img, ipt, 2, colorTab[clusterIdx], CV_FILLED, CV_AA);\n\t\t}\n\n\t\timshow(\"clusters\", img);\n\n\t\tchar key = (char)cv::waitKey();\n\t\tif (key == 27 || key == 'q' || key == 'Q') \/\/ 'ESC'\n\t\t\tbreak;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/       SKIRT -- an advanced radiative transfer code         \/\/\/\/\n\/\/\/\/       © Astronomical Observatory, Ghent University         \/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QFile>\n#include <QFileInfo>\n#include <QSharedPointer>\n#include <QHostInfo>\n#include \"AllCellsDustLib.hpp\"\n#include \"Array.hpp\"\n#include \"CommandLineArguments.hpp\"\n#include \"Console.hpp\"\n#include \"ConsoleHierarchyCreator.hpp\"\n#include \"FatalError.hpp\"\n#include \"FileLog.hpp\"\n#include \"FilePaths.hpp\"\n#include \"LatexHierarchyWriter.hpp\"\n#include \"MemoryStatistics.hpp\"\n#include \"MonteCarloSimulation.hpp\"\n#include \"PanDustSystem.hpp\"\n#include \"Parallel.hpp\"\n#include \"ParallelFactory.hpp\"\n#include \"PeerToPeerCommunicator.hpp\"\n#include \"ProcessManager.hpp\"\n#include \"Simulation.hpp\"\n#include \"SmileSchemaWriter.hpp\"\n#include \"SkirtCommandLineHandler.hpp\"\n#include \"StopWatch.hpp\"\n#include \"TimeLogger.hpp\"\n#include \"XmlHierarchyCreator.hpp\"\n#include \"XmlHierarchyWriter.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace\n{\n    \/\/ the allowed options list, in the format consumed by the CommandLineArguments constructor\n    static const char* allowedOptions = \"-t* -s* -d -b -v -m -l* -e -k -i* -o* -r -x\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkirtCommandLineHandler::SkirtCommandLineHandler(QStringList cmdlineargs)\n    : _args(cmdlineargs, allowedOptions), _hasError(false), _parallelSims(0)\n{\n    \/\/ get the host name\n    _hostname = QHostInfo::localHostName();\n    if (_hostname.isEmpty()) _username = \"unknown host\";\n\n    \/\/ get the user name\n    _username = qgetenv(\"USER\");\n    if (_username.isEmpty()) _username = qgetenv(\"USERNAME\");\n    if (_username.isEmpty()) _username = \"unknown user\";\n\n    \/\/ issue welcome message\n    _console.info(\"Welcome to \" + QCoreApplication::applicationName() + \" \" + QCoreApplication::applicationVersion());\n    _console.info(\"Running on \" + _hostname + \" for \" + _username);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkirtCommandLineHandler::perform()\n{\n    \/\/ catch and properly report any exceptions\n    try\n    {\n        \/\/ if there are no arguments at all --> interactive mode\n        \/\/ if there is at least one file path argument --> batch mode\n        \/\/ if the -x option is present --> export smile schema (undocumented option)\n        \/\/ otherwise --> error\n        if (_args.isValid() && !_args.hasOptions() && !_args.hasFilepaths()) return doInteractive();\n        if (_args.hasFilepaths()) return doBatch();\n        if (_args.isPresent(\"-x\")) return doSmileSchema();\n        _console.error(\"Invalid command line arguments\");\n        printHelp();\n    }\n    catch (FatalError& error)\n    {\n        foreach (QString line, error.message()) _console.error(line);\n    }\n    return EXIT_FAILURE;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkirtCommandLineHandler::doInteractive()\n{\n    if (ProcessManager::isMultiProc()) throw FATALERROR(\"Interactive mode cannot be run with multiple processes\");\n\n    _console.info(\"Interactively constructing a simulation...\");\n\n    \/\/ ask for the name of the ski file in which to save the result\n    QString filename;\n    while (true)\n    {\n        filename = _console.promptForInput(\"Enter the name of the ski file to be created\");\n\n        \/\/ reject empty strings\n        if (!filename.isEmpty())\n        {\n            \/\/ add .ski extension if needed\n            if (!filename.toLower().endsWith(\".ski\")) filename += \".ski\";\n\n            \/\/ reject name if file already exists\n            if (!QFile::exists(filename))\n            {\n                \/\/ accept the filename\n                break;\n            }\n            else _console.error(\"This file already exists; enter another name\");\n        }\n        else _console.error(\"Enter a nonempty string\");\n    }\n\n    \/\/ interactively construct the simulation; use shared pointer for automatic clean-up\n    ConsoleHierarchyCreator creator;\n    QSharedPointer<Simulation> simulation( creator.createHierarchy<Simulation>() );\n\n    \/\/ create the ski file reflecting this simulation\n    XmlHierarchyWriter writer;\n    writer.writeHierarchy(simulation.data(), filename);\n    _console.info(\"Successfully created ski file '\" + filename + \"'.\");\n    _console.info(\"To run the simulation use the command: skirt \" + filename.left(filename.length()-4));\n\n    return EXIT_SUCCESS;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkirtCommandLineHandler::doBatch()\n{\n    \/\/ build a list of filenames for existing ski files\n    _hasError = false;\n    foreach (QString filepath, _args.filepaths()) _skifiles << skifilesFor(filepath);\n\n    \/\/ exit if there were any problems with the file paths\n    if (_hasError || _skifiles.isEmpty())\n    {\n        if (!_args.isPresent(\"-b\")) printHelp();\n        return EXIT_FAILURE;\n    }\n\n    \/\/ if there is only one ski file, simply perform the single simulation\n    if (_skifiles.size() == 1)\n    {\n        doSimulation(0); \/\/ memory statistics are reported in doSimulation()\n    }\n    else\n    {\n        \/\/ determine the number of parallel simulations\n        _parallelSims = std::max(_args.intValue(\"-s\"), 1);\n\n        \/\/ prevent different simulations to be launched at once while MPI parallelization is used\n        if (ProcessManager::isMultiProc() && _parallelSims > 1)\n            throw FATALERROR(\"You cannot run different simulations in parallel whilst parallelizing them with MPI. \"\n                             \"Retry with -s set to 1 or consider launching different SKIRT instances.\");\n\n        \/\/ perform a simulation for each ski file\n        TimeLogger logger(&_console, \"a set of \" + QString::number(_skifiles.size()) + \" simulations\"\n                          + (_parallelSims > 1 ? \", \" + QString::number(_parallelSims) + \" in parallel\" : \"\"));\n        ParallelFactory factory;\n        factory.setMaxThreadCount(_parallelSims);\n        factory.parallel()->call(this, &SkirtCommandLineHandler::doSimulation, _skifiles.size());\n    }\n\n    \/\/ report memory statistics for the complete run\n    _console.info(MemoryStatistics::reportAvailable(true) + \" -- \" + MemoryStatistics::reportPeak(true));\n\n    \/\/ report stopwatch results, if any\n    foreach (QString line, StopWatch::report()) _console.warning(line);\n    return EXIT_SUCCESS;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkirtCommandLineHandler::doSmileSchema()\n{\n    SmileSchemaWriter writer;\n    writer.writeSmileSchema();\n    _console.info(\"Successfully created SMILE schema file 'skirt.smile'.\");\n    return EXIT_SUCCESS;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQStringList SkirtCommandLineHandler::skifilesFor(QString filepath)\n{\n    QStringList result;\n    QFileInfo info(filepath);\n    QString name = info.fileName();\n\n    \/\/ no recursion and no wildcards -> expect a single result\n    if (!_args.isPresent(\"-r\") && !name.contains('?') && !name.contains('*'))\n    {\n        \/\/ if the file does not exist as specified, try adding the .ski extension\n        if (!QFile::exists(filepath) && !filepath.toLower().endsWith(\".ski\")) filepath += \".ski\";\n        if (!QFile::exists(filepath))\n        {\n            _hasError = true;\n            _console.error(\"This ski file does not exist: \" + filepath);\n        }\n        else result << filepath;\n    }\n\n    \/\/ recursion and\/or wildcards -> multiple results possible\n    else\n    {\n        \/\/ find matching files in this directory, possibly recursively (depending on -r option);\n        \/\/ in this case do not automatically add the .ski extension; it leads to trouble with patterns\n        \/\/ like \"test*\" which are automatically expanded by the shell before invoking the application\n        result << skifilesFor(info.absoluteDir(), name);\n\n        if (result.isEmpty())\n        {\n            _hasError = true;\n            _console.error(\"No ski file matches the pattern: \" + filepath);\n        }\n    }\n\n    return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQStringList SkirtCommandLineHandler::skifilesFor(const QDir& dir, QString name)\n{\n    QStringList result;\n\n    \/\/ add matching files at the current directory level\n    foreach (QString entry, dir.entryList(QStringList() << name,\n                                          QDir::Files|QDir::Readable|QDir::NoDotAndDotDot,\n                                          QDir::Name|QDir::IgnoreCase) )\n    {\n        result << dir.absoluteFilePath(entry);\n    }\n\n    \/\/ if recursion is requested, call ourselves for all directories at this level\n    if (_args.isPresent(\"-r\"))\n    {\n        foreach (QString entry, dir.entryList(QDir::AllDirs|QDir::Readable|QDir::NoDotAndDotDot,\n                                              QDir::Name|QDir::IgnoreCase) )\n        {\n            QDir subdir(dir);\n            subdir.cd(entry);\n            result << skifilesFor(subdir, name);\n        }\n    }\n\n    return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SkirtCommandLineHandler::doSimulation(size_t index)\n{\n    QString filename = _skifiles[index];\n    if (_skifiles.size() > 1) _console.warning(\"Performing simulation #\" + QString::number(index+1) +\n                                               \" of \" + QString::number(_skifiles.size()));\n    _console.info(\"Constructing a simulation from ski file '\" + filename + \"'...\");\n\n    \/\/ Construct the simulation from the ski file; use shared pointer for automatic clean-up\n    XmlHierarchyCreator creator;\n    QSharedPointer<Simulation> simulation( creator.createHierarchy<Simulation>(filename) );\n\n    \/\/ Check whether emulation mode if enabled\n    bool emulation = _args.isPresent(\"-e\");\n    if (emulation)\n    {\n        \/\/ Change the number of photon packages to 1 (we don't care about actually performing it)\n        simulation->find<MonteCarloSimulation>(false)->setPackages(1);\n\n        \/\/ Disable dust self-absorption (does not lead to additional memory usage, would not converge anyway)\n        try {simulation->find<PanDustSystem>(false)->setSelfAbsorption(false);}\n        catch (FatalError&) {}\n\n        \/\/ Limit the number of self-absorption cycles to avoid the convergence loop (does not work?)\n        \/\/try {simulation->find<PanDustSystem>(false)->setCycles(1);}\n        \/\/catch (FatalError&) {}\n    }\n\n    \/\/ Check whether memory (de)allocation logging is enabled\n    bool memoryalloc = _args.isPresent(\"-l\");\n    #ifndef BUILDING_MEMORY\n    if (memoryalloc) throw FATALERROR(\"Enable BUILDING_MEMORY in the build options to use the -l option\");\n    #endif\n\n    \/\/ Set up any simulation attributes that are not loaded from the ski file:\n    \/\/  - the paths for input and output files\n    QFileInfo skiinfo(filename);\n    simulation->filePaths()->setOutputPrefix(skiinfo.completeBaseName());\n    QString base = _args.isPresent(\"-k\") ? skiinfo.absolutePath() : QDir::currentPath();\n    simulation->filePaths()->setInputPath((_args.value(\"-i\").startsWith('\/') ? \"\" : base + \"\/\") + _args.value(\"-i\"));\n    simulation->filePaths()->setOutputPath((_args.value(\"-o\").startsWith('\/') ? \"\" : base + \"\/\") + _args.value(\"-o\"));\n\n    \/\/  - the number of parallel threads\n    if (_args.intValue(\"-t\") > 0) simulation->parallelFactory()->setMaxThreadCount(_args.intValue(\"-t\"));\n    if (memoryalloc)\n    {\n        if (_args.intValue(\"-t\") > 0)\n            simulation->log()->warning(\"You cannot use multiple threads when logging memory (de)allocation. Setting \"\n                                       \"the number of threads to 1.\");\n        simulation->parallelFactory()->setMaxThreadCount(1); \/\/ memory (de)allocation logging requires singlethreading\n    }\n\n    \/\/  - the multiprocessing environment\n    PeerToPeerCommunicator* comm = simulation->communicator();\n    comm->setup();\n\n    \/\/  - the activation of data parallelization\n    if (_args.isPresent(\"-d\") && comm->isMultiProc())\n    {\n        PanDustSystem* pds = nullptr;\n        try {pds = simulation->find<PanDustSystem>(false);}\n        catch (FatalError&) {}\n\n        if (pds && pds->dustemission())\n        {\n            try {pds->find<AllCellsDustLib>();}\n            catch(FatalError&)\n            {\n                throw FATALERROR(\"When using -d, the dust emission can only be calculated using an AllCellsDustLib\");\n            }\n        }\n        \/\/ no PanDustSystem -> true,\n        \/\/ pds but no dust emission -> true,\n        \/\/ pds with dust emission -> error when no AllCellsDustLib\n        comm->setDataParallel(true);\n    }\n\n    \/\/  - the console and the file log (and memory (de)allocation logging)\n    FileLog* log = new FileLog();\n    simulation->log()->setLinkedLog(log);\n    simulation->log()->setVerbose(_args.isPresent(\"-v\"));\n    simulation->log()->setMemoryLogging(_args.isPresent(\"-m\"));\n    if (emulation) simulation->log()->setLowestLevel(Log::Error); \/\/ in emulation mode, only log errors to the console\n    if (_parallelSims > 1 || _args.isPresent(\"-b\")) simulation->log()->setLowestLevel(Log::Success);\n    #ifdef BUILDING_MEMORY\n    if (memoryalloc)\n    {\n        \/\/ enable memory logging for each log message when memory (de)allocation logging is enabled\n        simulation->log()->setMemoryLogging(true);\n        \/\/ set the lower limit for memory (de)allocation logging\n        log->setLimit(_args.doubleValue(\"-l\"));\n        Array::setLogger(log);\n    }\n    #endif\n\n    \/\/ Output a ski file and a latex file reflecting this simulation for later reference\n    if (comm->isRoot())\n    {\n        XmlHierarchyWriter writer1;\n        writer1.writeHierarchy(simulation.data(), simulation->filePaths()->output(\"parameters.xml\"));\n        LatexHierarchyWriter writer2;\n        writer2.writeHierarchy(simulation.data(), simulation->filePaths()->output(\"parameters.tex\"));\n    }\n\n    \/\/ Run the simulation; catch and rethrow exceptions so they are also logged to file\n    try\n    {\n        log->setup();\n        log->info(QCoreApplication::applicationName() + \" \" + QCoreApplication::applicationVersion());\n        log->info(\"Running on \" + _hostname + \" for \" + _username);\n        if (emulation) _console.info(\"Emulating the simulation steps and monitoring memory usage...\");\n        simulation->setupAndRun();\n\n        \/\/ if this is the only or first simulation in the run, report memory statistics in the simulation's log file\n        if (_skifiles.size() == 1 || (_parallelSims==1 && index==0))\n            log->info(MemoryStatistics::reportAvailable(true) + \" -- \" + MemoryStatistics::reportPeak(true));\n\n        #ifdef BUILDING_MEMORY\n        \/\/ disable memory (de)allocation logging after the simulation finished\n        if (memoryalloc) Array::setLogger(nullptr);\n        #endif\n    }\n    catch (FatalError& error)\n    {\n        foreach (QString line, error.message()) log->error(line);\n        throw error;\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SkirtCommandLineHandler::printHelp()\n{\n    _console.warning(\"\");\n    _console.warning(\"To create a new ski file interactively:    skirt\");\n    _console.warning(\"To run a simulation with default options:  skirt <ski-filename>\");\n    _console.warning(\"\");\n    _console.warning(\"  skirt [-t <threads>] [-s <simulations>] [-d]\");\n    _console.warning(\"        [-b] [-v] [-m] [-l <limit>] [-e]\");\n    _console.warning(\"        [-k] [-i <dirpath>] [-o <dirpath>]\");\n    _console.warning(\"        [-r] {<filepath>}*\");\n    _console.warning(\"\");\n    _console.warning(\"  -t <threads> : the number of parallel threads for each simulation\");\n    _console.warning(\"  -s <simulations> : the number of parallel simulations per process\");\n    _console.warning(\"  -d : enable data parallelization mode for multiple processes\");\n    _console.warning(\"  -b : force brief console logging\");\n    _console.warning(\"  -v : force verbose logging for multiple processes\");\n    _console.warning(\"  -m : state the amount of used memory at the start of each log message\");\n    _console.warning(\"  -l <limit> : enable memory (de)allocation logging (lower limit in GB)\");\n    _console.warning(\"  -e : run the simulation in 'emulation' mode to get an estimate of the memory consumption\");\n    _console.warning(\"  -k : make the input\/output paths relative to the ski file being processed\");\n    _console.warning(\"  -i <dirpath> : the relative or absolute path for simulation input files\");\n    _console.warning(\"  -o <dirpath> : the relative or absolute path for simulation output files\");\n    _console.warning(\"  -r : cause recursive directory descent for all specified ski file paths\");\n    _console.warning(\"  <filepath> : the relative or absolute file path for a ski file\");\n    _console.warning(\"               (the filename may contain ? and * wildcards)\");\n    _console.warning(\"\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>-d: Throw an error when there are more processes than wavelengths.<commit_after>\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/       SKIRT -- an advanced radiative transfer code         \/\/\/\/\n\/\/\/\/       © Astronomical Observatory, Ghent University         \/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QFile>\n#include <QFileInfo>\n#include <QSharedPointer>\n#include <QHostInfo>\n#include \"AllCellsDustLib.hpp\"\n#include \"Array.hpp\"\n#include \"CommandLineArguments.hpp\"\n#include \"Console.hpp\"\n#include \"ConsoleHierarchyCreator.hpp\"\n#include \"FatalError.hpp\"\n#include \"FileLog.hpp\"\n#include \"FilePaths.hpp\"\n#include \"LatexHierarchyWriter.hpp\"\n#include \"MemoryStatistics.hpp\"\n#include \"MonteCarloSimulation.hpp\"\n#include \"PanDustSystem.hpp\"\n#include \"Parallel.hpp\"\n#include \"ParallelFactory.hpp\"\n#include \"PeerToPeerCommunicator.hpp\"\n#include \"ProcessManager.hpp\"\n#include \"Simulation.hpp\"\n#include \"SmileSchemaWriter.hpp\"\n#include \"SkirtCommandLineHandler.hpp\"\n#include \"StopWatch.hpp\"\n#include \"TimeLogger.hpp\"\n#include \"WavelengthGrid.hpp\"\n#include \"XmlHierarchyCreator.hpp\"\n#include \"XmlHierarchyWriter.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace\n{\n    \/\/ the allowed options list, in the format consumed by the CommandLineArguments constructor\n    static const char* allowedOptions = \"-t* -s* -d -b -v -m -l* -e -k -i* -o* -r -x\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkirtCommandLineHandler::SkirtCommandLineHandler(QStringList cmdlineargs)\n    : _args(cmdlineargs, allowedOptions), _hasError(false), _parallelSims(0)\n{\n    \/\/ get the host name\n    _hostname = QHostInfo::localHostName();\n    if (_hostname.isEmpty()) _username = \"unknown host\";\n\n    \/\/ get the user name\n    _username = qgetenv(\"USER\");\n    if (_username.isEmpty()) _username = qgetenv(\"USERNAME\");\n    if (_username.isEmpty()) _username = \"unknown user\";\n\n    \/\/ issue welcome message\n    _console.info(\"Welcome to \" + QCoreApplication::applicationName() + \" \" + QCoreApplication::applicationVersion());\n    _console.info(\"Running on \" + _hostname + \" for \" + _username);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkirtCommandLineHandler::perform()\n{\n    \/\/ catch and properly report any exceptions\n    try\n    {\n        \/\/ if there are no arguments at all --> interactive mode\n        \/\/ if there is at least one file path argument --> batch mode\n        \/\/ if the -x option is present --> export smile schema (undocumented option)\n        \/\/ otherwise --> error\n        if (_args.isValid() && !_args.hasOptions() && !_args.hasFilepaths()) return doInteractive();\n        if (_args.hasFilepaths()) return doBatch();\n        if (_args.isPresent(\"-x\")) return doSmileSchema();\n        _console.error(\"Invalid command line arguments\");\n        printHelp();\n    }\n    catch (FatalError& error)\n    {\n        foreach (QString line, error.message()) _console.error(line);\n    }\n    return EXIT_FAILURE;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkirtCommandLineHandler::doInteractive()\n{\n    if (ProcessManager::isMultiProc()) throw FATALERROR(\"Interactive mode cannot be run with multiple processes\");\n\n    _console.info(\"Interactively constructing a simulation...\");\n\n    \/\/ ask for the name of the ski file in which to save the result\n    QString filename;\n    while (true)\n    {\n        filename = _console.promptForInput(\"Enter the name of the ski file to be created\");\n\n        \/\/ reject empty strings\n        if (!filename.isEmpty())\n        {\n            \/\/ add .ski extension if needed\n            if (!filename.toLower().endsWith(\".ski\")) filename += \".ski\";\n\n            \/\/ reject name if file already exists\n            if (!QFile::exists(filename))\n            {\n                \/\/ accept the filename\n                break;\n            }\n            else _console.error(\"This file already exists; enter another name\");\n        }\n        else _console.error(\"Enter a nonempty string\");\n    }\n\n    \/\/ interactively construct the simulation; use shared pointer for automatic clean-up\n    ConsoleHierarchyCreator creator;\n    QSharedPointer<Simulation> simulation( creator.createHierarchy<Simulation>() );\n\n    \/\/ create the ski file reflecting this simulation\n    XmlHierarchyWriter writer;\n    writer.writeHierarchy(simulation.data(), filename);\n    _console.info(\"Successfully created ski file '\" + filename + \"'.\");\n    _console.info(\"To run the simulation use the command: skirt \" + filename.left(filename.length()-4));\n\n    return EXIT_SUCCESS;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkirtCommandLineHandler::doBatch()\n{\n    \/\/ build a list of filenames for existing ski files\n    _hasError = false;\n    foreach (QString filepath, _args.filepaths()) _skifiles << skifilesFor(filepath);\n\n    \/\/ exit if there were any problems with the file paths\n    if (_hasError || _skifiles.isEmpty())\n    {\n        if (!_args.isPresent(\"-b\")) printHelp();\n        return EXIT_FAILURE;\n    }\n\n    \/\/ if there is only one ski file, simply perform the single simulation\n    if (_skifiles.size() == 1)\n    {\n        doSimulation(0); \/\/ memory statistics are reported in doSimulation()\n    }\n    else\n    {\n        \/\/ determine the number of parallel simulations\n        _parallelSims = std::max(_args.intValue(\"-s\"), 1);\n\n        \/\/ prevent different simulations to be launched at once while MPI parallelization is used\n        if (ProcessManager::isMultiProc() && _parallelSims > 1)\n            throw FATALERROR(\"You cannot run different simulations in parallel whilst parallelizing them with MPI. \"\n                             \"Retry with -s set to 1 or consider launching different SKIRT instances.\");\n\n        \/\/ perform a simulation for each ski file\n        TimeLogger logger(&_console, \"a set of \" + QString::number(_skifiles.size()) + \" simulations\"\n                          + (_parallelSims > 1 ? \", \" + QString::number(_parallelSims) + \" in parallel\" : \"\"));\n        ParallelFactory factory;\n        factory.setMaxThreadCount(_parallelSims);\n        factory.parallel()->call(this, &SkirtCommandLineHandler::doSimulation, _skifiles.size());\n    }\n\n    \/\/ report memory statistics for the complete run\n    _console.info(MemoryStatistics::reportAvailable(true) + \" -- \" + MemoryStatistics::reportPeak(true));\n\n    \/\/ report stopwatch results, if any\n    foreach (QString line, StopWatch::report()) _console.warning(line);\n    return EXIT_SUCCESS;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkirtCommandLineHandler::doSmileSchema()\n{\n    SmileSchemaWriter writer;\n    writer.writeSmileSchema();\n    _console.info(\"Successfully created SMILE schema file 'skirt.smile'.\");\n    return EXIT_SUCCESS;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQStringList SkirtCommandLineHandler::skifilesFor(QString filepath)\n{\n    QStringList result;\n    QFileInfo info(filepath);\n    QString name = info.fileName();\n\n    \/\/ no recursion and no wildcards -> expect a single result\n    if (!_args.isPresent(\"-r\") && !name.contains('?') && !name.contains('*'))\n    {\n        \/\/ if the file does not exist as specified, try adding the .ski extension\n        if (!QFile::exists(filepath) && !filepath.toLower().endsWith(\".ski\")) filepath += \".ski\";\n        if (!QFile::exists(filepath))\n        {\n            _hasError = true;\n            _console.error(\"This ski file does not exist: \" + filepath);\n        }\n        else result << filepath;\n    }\n\n    \/\/ recursion and\/or wildcards -> multiple results possible\n    else\n    {\n        \/\/ find matching files in this directory, possibly recursively (depending on -r option);\n        \/\/ in this case do not automatically add the .ski extension; it leads to trouble with patterns\n        \/\/ like \"test*\" which are automatically expanded by the shell before invoking the application\n        result << skifilesFor(info.absoluteDir(), name);\n\n        if (result.isEmpty())\n        {\n            _hasError = true;\n            _console.error(\"No ski file matches the pattern: \" + filepath);\n        }\n    }\n\n    return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQStringList SkirtCommandLineHandler::skifilesFor(const QDir& dir, QString name)\n{\n    QStringList result;\n\n    \/\/ add matching files at the current directory level\n    foreach (QString entry, dir.entryList(QStringList() << name,\n                                          QDir::Files|QDir::Readable|QDir::NoDotAndDotDot,\n                                          QDir::Name|QDir::IgnoreCase) )\n    {\n        result << dir.absoluteFilePath(entry);\n    }\n\n    \/\/ if recursion is requested, call ourselves for all directories at this level\n    if (_args.isPresent(\"-r\"))\n    {\n        foreach (QString entry, dir.entryList(QDir::AllDirs|QDir::Readable|QDir::NoDotAndDotDot,\n                                              QDir::Name|QDir::IgnoreCase) )\n        {\n            QDir subdir(dir);\n            subdir.cd(entry);\n            result << skifilesFor(subdir, name);\n        }\n    }\n\n    return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SkirtCommandLineHandler::doSimulation(size_t index)\n{\n    QString filename = _skifiles[index];\n    if (_skifiles.size() > 1) _console.warning(\"Performing simulation #\" + QString::number(index+1) +\n                                               \" of \" + QString::number(_skifiles.size()));\n    _console.info(\"Constructing a simulation from ski file '\" + filename + \"'...\");\n\n    \/\/ Construct the simulation from the ski file; use shared pointer for automatic clean-up\n    XmlHierarchyCreator creator;\n    QSharedPointer<Simulation> simulation( creator.createHierarchy<Simulation>(filename) );\n\n    \/\/ Check whether emulation mode if enabled\n    bool emulation = _args.isPresent(\"-e\");\n    if (emulation)\n    {\n        \/\/ Change the number of photon packages to 1 (we don't care about actually performing it)\n        simulation->find<MonteCarloSimulation>(false)->setPackages(1);\n\n        \/\/ Disable dust self-absorption (does not lead to additional memory usage, would not converge anyway)\n        try {simulation->find<PanDustSystem>(false)->setSelfAbsorption(false);}\n        catch (FatalError&) {}\n\n        \/\/ Limit the number of self-absorption cycles to avoid the convergence loop (does not work?)\n        \/\/try {simulation->find<PanDustSystem>(false)->setCycles(1);}\n        \/\/catch (FatalError&) {}\n    }\n\n    \/\/ Check whether memory (de)allocation logging is enabled\n    bool memoryalloc = _args.isPresent(\"-l\");\n    #ifndef BUILDING_MEMORY\n    if (memoryalloc) throw FATALERROR(\"Enable BUILDING_MEMORY in the build options to use the -l option\");\n    #endif\n\n    \/\/ Set up any simulation attributes that are not loaded from the ski file:\n    \/\/  - the paths for input and output files\n    QFileInfo skiinfo(filename);\n    simulation->filePaths()->setOutputPrefix(skiinfo.completeBaseName());\n    QString base = _args.isPresent(\"-k\") ? skiinfo.absolutePath() : QDir::currentPath();\n    simulation->filePaths()->setInputPath((_args.value(\"-i\").startsWith('\/') ? \"\" : base + \"\/\") + _args.value(\"-i\"));\n    simulation->filePaths()->setOutputPath((_args.value(\"-o\").startsWith('\/') ? \"\" : base + \"\/\") + _args.value(\"-o\"));\n\n    \/\/  - the number of parallel threads\n    if (_args.intValue(\"-t\") > 0) simulation->parallelFactory()->setMaxThreadCount(_args.intValue(\"-t\"));\n    if (memoryalloc)\n    {\n        if (_args.intValue(\"-t\") > 0)\n            simulation->log()->warning(\"You cannot use multiple threads when logging memory (de)allocation. Setting \"\n                                       \"the number of threads to 1.\");\n        simulation->parallelFactory()->setMaxThreadCount(1); \/\/ memory (de)allocation logging requires singlethreading\n    }\n\n    \/\/  - the multiprocessing environment\n    PeerToPeerCommunicator* comm = simulation->communicator();\n    comm->setup();\n\n    \/\/  - the activation of data parallelization\n    if (_args.isPresent(\"-d\") && comm->isMultiProc())\n    {\n        if (simulation->find<WavelengthGrid>(false)->Nlambda() < comm->size())\n            throw FATALERROR(\"When using -d, the number of wavelengths must be larger than the number of processes.\");\n\n        PanDustSystem* pds = nullptr;\n        try {pds = simulation->find<PanDustSystem>(false);}\n        catch (FatalError&) {}\n\n        if (pds && pds->dustemission())\n        {\n            try {pds->find<AllCellsDustLib>();}\n            catch(FatalError&)\n            {\n                throw FATALERROR(\"When using -d, the dust emission can only be calculated using an AllCellsDustLib\");\n            }\n        }\n        \/\/ no PanDustSystem -> true,\n        \/\/ pds but no dust emission -> true,\n        \/\/ pds with dust emission -> error when no AllCellsDustLib\n        comm->setDataParallel(true);\n    }\n\n    \/\/  - the console and the file log (and memory (de)allocation logging)\n    FileLog* log = new FileLog();\n    simulation->log()->setLinkedLog(log);\n    simulation->log()->setVerbose(_args.isPresent(\"-v\"));\n    simulation->log()->setMemoryLogging(_args.isPresent(\"-m\"));\n    if (emulation) simulation->log()->setLowestLevel(Log::Error); \/\/ in emulation mode, only log errors to the console\n    if (_parallelSims > 1 || _args.isPresent(\"-b\")) simulation->log()->setLowestLevel(Log::Success);\n    #ifdef BUILDING_MEMORY\n    if (memoryalloc)\n    {\n        \/\/ enable memory logging for each log message when memory (de)allocation logging is enabled\n        simulation->log()->setMemoryLogging(true);\n        \/\/ set the lower limit for memory (de)allocation logging\n        log->setLimit(_args.doubleValue(\"-l\"));\n        Array::setLogger(log);\n    }\n    #endif\n\n    \/\/ Output a ski file and a latex file reflecting this simulation for later reference\n    if (comm->isRoot())\n    {\n        XmlHierarchyWriter writer1;\n        writer1.writeHierarchy(simulation.data(), simulation->filePaths()->output(\"parameters.xml\"));\n        LatexHierarchyWriter writer2;\n        writer2.writeHierarchy(simulation.data(), simulation->filePaths()->output(\"parameters.tex\"));\n    }\n\n    \/\/ Run the simulation; catch and rethrow exceptions so they are also logged to file\n    try\n    {\n        log->setup();\n        log->info(QCoreApplication::applicationName() + \" \" + QCoreApplication::applicationVersion());\n        log->info(\"Running on \" + _hostname + \" for \" + _username);\n        if (emulation) _console.info(\"Emulating the simulation steps and monitoring memory usage...\");\n        simulation->setupAndRun();\n\n        \/\/ if this is the only or first simulation in the run, report memory statistics in the simulation's log file\n        if (_skifiles.size() == 1 || (_parallelSims==1 && index==0))\n            log->info(MemoryStatistics::reportAvailable(true) + \" -- \" + MemoryStatistics::reportPeak(true));\n\n        #ifdef BUILDING_MEMORY\n        \/\/ disable memory (de)allocation logging after the simulation finished\n        if (memoryalloc) Array::setLogger(nullptr);\n        #endif\n    }\n    catch (FatalError& error)\n    {\n        foreach (QString line, error.message()) log->error(line);\n        throw error;\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SkirtCommandLineHandler::printHelp()\n{\n    _console.warning(\"\");\n    _console.warning(\"To create a new ski file interactively:    skirt\");\n    _console.warning(\"To run a simulation with default options:  skirt <ski-filename>\");\n    _console.warning(\"\");\n    _console.warning(\"  skirt [-t <threads>] [-s <simulations>] [-d]\");\n    _console.warning(\"        [-b] [-v] [-m] [-l <limit>] [-e]\");\n    _console.warning(\"        [-k] [-i <dirpath>] [-o <dirpath>]\");\n    _console.warning(\"        [-r] {<filepath>}*\");\n    _console.warning(\"\");\n    _console.warning(\"  -t <threads> : the number of parallel threads for each simulation\");\n    _console.warning(\"  -s <simulations> : the number of parallel simulations per process\");\n    _console.warning(\"  -d : enable data parallelization mode for multiple processes\");\n    _console.warning(\"  -b : force brief console logging\");\n    _console.warning(\"  -v : force verbose logging for multiple processes\");\n    _console.warning(\"  -m : state the amount of used memory at the start of each log message\");\n    _console.warning(\"  -l <limit> : enable memory (de)allocation logging (lower limit in GB)\");\n    _console.warning(\"  -e : run the simulation in 'emulation' mode to get an estimate of the memory consumption\");\n    _console.warning(\"  -k : make the input\/output paths relative to the ski file being processed\");\n    _console.warning(\"  -i <dirpath> : the relative or absolute path for simulation input files\");\n    _console.warning(\"  -o <dirpath> : the relative or absolute path for simulation output files\");\n    _console.warning(\"  -r : cause recursive directory descent for all specified ski file paths\");\n    _console.warning(\"  <filepath> : the relative or absolute file path for a ski file\");\n    _console.warning(\"               (the filename may contain ? and * wildcards)\");\n    _console.warning(\"\");\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\/**\n * @file\n **\/\n\n#include \"modules\/planning\/tasks\/dp_poly_path\/trajectory_cost.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <utility>\n\n#include \"modules\/common\/proto\/pnc_point.pb.h\"\n\n#include \"modules\/common\/configs\/vehicle_config_helper.h\"\n#include \"modules\/common\/math\/vec2d.h\"\n#include \"modules\/common\/util\/util.h\"\n#include \"modules\/planning\/common\/planning_gflags.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing apollo::common::math::Box2d;\nusing apollo::common::math::Vec2d;\nusing apollo::common::TrajectoryPoint;\n\nTrajectoryCost::TrajectoryCost(\n    const DpPolyPathConfig &config, const ReferenceLine &reference_line,\n    const std::vector<const PathObstacle *> &obstacles,\n    const common::VehicleParam &vehicle_param,\n    const SpeedData &heuristic_speed_data, const common::SLPoint &init_sl_point)\n    : config_(config),\n      reference_line_(&reference_line),\n      vehicle_param_(vehicle_param),\n      heuristic_speed_data_(heuristic_speed_data),\n      init_sl_point_(init_sl_point) {\n  const double total_time =\n      std::min(heuristic_speed_data_.TotalTime(), FLAGS_prediction_total_time);\n\n  num_of_time_stamps_ = static_cast<uint32_t>(\n      std::floor(total_time \/ config.eval_time_interval()));\n\n  for (const auto ptr_path_obstacle : obstacles) {\n    if (ptr_path_obstacle->IsIgnore()) {\n      continue;\n    }\n    const auto ptr_obstacle = ptr_path_obstacle->obstacle();\n    if (Obstacle::IsVirtualObstacle(ptr_obstacle->Perception())) {\n      \/\/ Virtual obstacle\n      continue;\n    } else if (Obstacle::IsStaticObstacle(ptr_obstacle->Perception())) {\n      auto sl_boundary = ptr_path_obstacle->perception_sl_boundary();\n      const double kDefaultLaneWidth = 1.5;\n      const auto &vehicle_config =\n          common::VehicleConfigHelper::instance()->GetConfig();\n      const double width = vehicle_config.vehicle_param().width();\n\n      if (sl_boundary.start_l() + kDefaultLaneWidth < width &&\n          kDefaultLaneWidth - sl_boundary.end_l() < width) {\n        \/\/ lane blocking obstacle\n        continue;\n      }\n\n      const double length = vehicle_config.vehicle_param().length();\n      if (sl_boundary.start_s() - init_sl_point_.s() < 2.0 * length) {\n        \/\/ if too close, we treat the obstacle as non-nudgable\n        continue;\n      }\n\n      TrajectoryPoint trajectory_point = ptr_obstacle->GetPointAtTime(0.0);\n      constexpr double kBuff = 0.2;\n      Box2d obstacle_box = ptr_obstacle->GetBoundingBox(trajectory_point);\n      Box2d expanded_obstacle_box =\n          Box2d(obstacle_box.center(), obstacle_box.heading(),\n                obstacle_box.length() + kBuff, obstacle_box.width() + kBuff);\n      static_obstacle_boxes_.push_back(std::move(expanded_obstacle_box));\n    } else {\n      std::vector<Box2d> box_by_time;\n      for (uint32_t t = 0; t <= num_of_time_stamps_; ++t) {\n        TrajectoryPoint trajectory_point =\n            ptr_obstacle->GetPointAtTime(t * config.eval_time_interval());\n\n        Box2d obstacle_box = ptr_obstacle->GetBoundingBox(trajectory_point);\n        constexpr double kBuff = 0.5;\n        Box2d expanded_obstacle_box =\n            Box2d(obstacle_box.center(), obstacle_box.heading(),\n                  obstacle_box.length() + kBuff, obstacle_box.width() + kBuff);\n        box_by_time.push_back(expanded_obstacle_box);\n      }\n      dynamic_obstacle_boxes_.push_back(std::move(box_by_time));\n    }\n  }\n}\n\ndouble TrajectoryCost::CalculatePathCost(const QuinticPolynomialCurve1d &curve,\n                                         const double start_s,\n                                         const double end_s) const {\n  double path_cost = 0.0;\n  for (double path_s = 0.0; path_s < (end_s - start_s);\n       path_s += config_.path_resolution()) {\n    const double l = curve.Evaluate(0, path_s);\n\n    std::function<double(const double)> quasi_softmax = [this](const double x) {\n      const double l0 = this->config_.path_l_cost_param_l0();\n      const double b = this->config_.path_l_cost_param_b();\n      const double k = this->config_.path_l_cost_param_k();\n      return (b + std::exp(-k * (x - l0))) \/ (1.0 + std::exp(-k * (x - l0)));\n    };\n\n    path_cost += l * l * config_.path_l_cost() * quasi_softmax(std::fabs(l));\n\n    double left_width = 0.0;\n    double right_width = 0.0;\n    reference_line_->GetLaneWidth(path_s, &left_width, &right_width);\n\n    const auto &vehicle_config =\n        common::VehicleConfigHelper::instance()->GetConfig();\n    const double width = vehicle_config.vehicle_param().width();\n\n    constexpr double kBuff = 0.2;\n    if (std::fabs(l) > std::fabs(init_sl_point_.l()) &&\n        (l + width + kBuff > left_width || l - width - kBuff < right_width)) {\n      path_cost += config_.path_out_lane_cost();\n    }\n\n    const double dl = std::fabs(curve.Evaluate(1, path_s));\n    path_cost += dl * dl * config_.path_dl_cost();\n\n    const double ddl = std::fabs(curve.Evaluate(2, path_s));\n    path_cost += ddl * ddl * config_.path_ddl_cost();\n  }\n  return path_cost * config_.path_resolution();\n}\n\ndouble TrajectoryCost::CalculateStaticObstacleCost(\n    const QuinticPolynomialCurve1d &curve, const double start_s,\n    const double end_s) const {\n  double obstacle_cost = 0.0;\n\n  for (double curr_s = start_s; curr_s <= end_s;\n       curr_s += config_.path_resolution()) {\n    const double s = curr_s - start_s;  \/\/ spline curve s\n    const double l = curve.Evaluate(0, s);\n    const double dl = curve.Evaluate(1, s);\n\n    const common::SLPoint sl =\n        common::util::MakeSLPoint(curr_s, l);  \/\/ ego vehicle sl point\n    const Box2d ego_box = GetBoxFromSLPoint(sl, dl);\n    for (const auto &obstacle_box : static_obstacle_boxes_) {\n      obstacle_cost += GetCostBetweenObsBoxes(ego_box, obstacle_box);\n    }\n  }\n  return obstacle_cost * config_.path_resolution();\n}\n\ndouble TrajectoryCost::CalculateDynamicObstacleCost(\n    const QuinticPolynomialCurve1d &curve, const double start_s,\n    const double end_s) const {\n  double obstacle_cost = 0.0;\n  double time_stamp = 0.0;\n\n  for (size_t index = 0; index < num_of_time_stamps_;\n       ++index, time_stamp += config_.eval_time_interval()) {\n    common::SpeedPoint speed_point;\n    heuristic_speed_data_.EvaluateByTime(time_stamp, &speed_point);\n    if (speed_point.s() < start_s - init_sl_point_.s()) {\n      continue;\n    }\n    if (speed_point.s() > end_s - init_sl_point_.s()) {\n      break;\n    }\n\n    const double s =\n        init_sl_point_.s() + speed_point.s() - start_s;  \/\/ s on spline curve\n    const double l = curve.Evaluate(0, s);\n    const double dl = curve.Evaluate(1, s);\n\n    const common::SLPoint sl =\n        common::util::MakeSLPoint(init_sl_point_.s() + speed_point.s(), l);\n    const Box2d ego_box = GetBoxFromSLPoint(sl, dl);\n    for (const auto &obstacle_trajectory : dynamic_obstacle_boxes_) {\n      obstacle_cost +=\n          GetCostBetweenObsBoxes(ego_box, obstacle_trajectory.at(index));\n    }\n  }\n  constexpr double kDynamicObsWeight = 1e-3;\n  return obstacle_cost * config_.eval_time_interval() * kDynamicObsWeight;\n}\n\ndouble TrajectoryCost::GetCostBetweenObsBoxes(const Box2d &ego_box,\n                                              const Box2d &obstacle_box) const {\n  \/\/ Simple version: calculate obstacle cost by distance\n  const double distance = obstacle_box.DistanceTo(ego_box);\n  if (distance > config_.obstacle_ignore_distance()) {\n    return 0.0;\n  }\n\n  std::function<double(const double, const double)> softmax = [](\n      const double x, const double x0) {\n    return std::exp(-(x - x0)) \/ (1.0 + std::exp(-(x - x0)));\n  };\n\n  double obstacle_cost = 0.0;\n  obstacle_cost += config_.obstacle_collision_cost() *\n                   softmax(distance, config_.obstacle_collision_distance());\n  obstacle_cost += 20.0 * softmax(distance, config_.obstacle_risk_distance());\n  return obstacle_cost;\n}\n\nBox2d TrajectoryCost::GetBoxFromSLPoint(const common::SLPoint &sl,\n                                        const double dl) const {\n  Vec2d xy_point;\n  reference_line_->SLToXY(sl, &xy_point);\n\n  ReferencePoint reference_point = reference_line_->GetReferencePoint(sl.s());\n\n  const double one_minus_kappa_r_d = 1 - reference_point.kappa() * sl.l();\n  const double delta_theta = std::atan2(dl, one_minus_kappa_r_d);\n  const double theta =\n      common::math::NormalizeAngle(delta_theta + reference_point.heading());\n  return Box2d(xy_point, theta, vehicle_param_.length(),\n               vehicle_param_.width());\n}\n\n\/\/ TODO(All): optimize obstacle cost calculation time\ndouble TrajectoryCost::Calculate(const QuinticPolynomialCurve1d &curve,\n                                 const double start_s,\n                                 const double end_s) const {\n  double total_cost = 0.0;\n  \/\/ path cost\n  total_cost += CalculatePathCost(curve, start_s, end_s);\n\n  \/\/ static obstacle cost\n  total_cost += CalculateStaticObstacleCost(curve, start_s, end_s);\n\n  \/\/ dynamic obstacle cost\n  total_cost += CalculateDynamicObstacleCost(curve, start_s, end_s);\n  return total_cost;\n}\n\ndouble TrajectoryCost::RiskDistanceCost(const double distance) const {\n  return (5.0 - distance) * ((5.0 - distance)) * 10;\n}\n\ndouble TrajectoryCost::RegularDistanceCost(const double distance) const {\n  return std::max(20.0 - distance, 0.0);\n}\n\n}  \/\/ namespace planning\n}  \/\/ namespace apollo\n<commit_msg>Update trajectory_cost.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\/**\n * @file\n **\/\n\n#include \"modules\/planning\/tasks\/dp_poly_path\/trajectory_cost.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <utility>\n\n#include \"modules\/common\/proto\/pnc_point.pb.h\"\n\n#include \"modules\/common\/configs\/vehicle_config_helper.h\"\n#include \"modules\/common\/math\/vec2d.h\"\n#include \"modules\/common\/util\/util.h\"\n#include \"modules\/planning\/common\/planning_gflags.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing apollo::common::math::Box2d;\nusing apollo::common::math::Vec2d;\nusing apollo::common::TrajectoryPoint;\n\nTrajectoryCost::TrajectoryCost(\n    const DpPolyPathConfig &config, const ReferenceLine &reference_line,\n    const std::vector<const PathObstacle *> &obstacles,\n    const common::VehicleParam &vehicle_param,\n    const SpeedData &heuristic_speed_data, const common::SLPoint &init_sl_point)\n    : config_(config),\n      reference_line_(&reference_line),\n      vehicle_param_(vehicle_param),\n      heuristic_speed_data_(heuristic_speed_data),\n      init_sl_point_(init_sl_point) {\n  const double total_time =\n      std::min(heuristic_speed_data_.TotalTime(), FLAGS_prediction_total_time);\n\n  num_of_time_stamps_ = static_cast<uint32_t>(\n      std::floor(total_time \/ config.eval_time_interval()));\n\n  for (const auto ptr_path_obstacle : obstacles) {\n    if (ptr_path_obstacle->IsIgnore()) {\n      continue;\n    }\n    const auto ptr_obstacle = ptr_path_obstacle->obstacle();\n    if (Obstacle::IsVirtualObstacle(ptr_obstacle->Perception())) {\n      \/\/ Virtual obstacle\n      continue;\n    } else if (Obstacle::IsStaticObstacle(ptr_obstacle->Perception())) {\n      auto sl_boundary = ptr_path_obstacle->perception_sl_boundary();\n      const double kDefaultLaneWidth = 1.5;\n      const auto &vehicle_config =\n          common::VehicleConfigHelper::instance()->GetConfig();\n      const double width = vehicle_config.vehicle_param().width();\n\n      if (sl_boundary.start_l() + kDefaultLaneWidth < width &&\n          kDefaultLaneWidth - sl_boundary.end_l() < width) {\n        \/\/ lane blocking obstacle\n        continue;\n      }\n\n      const double length = vehicle_config.vehicle_param().length();\n      if (sl_boundary.start_s() - init_sl_point_.s() < 2.0 * length) {\n        \/\/ if too close, we treat the obstacle as non-nudgable\n        continue;\n      }\n\n      TrajectoryPoint trajectory_point = ptr_obstacle->GetPointAtTime(0.0);\n      constexpr double kBuff = 0.2;\n      Box2d obstacle_box = ptr_obstacle->GetBoundingBox(trajectory_point);\n      Box2d expanded_obstacle_box =\n          Box2d(obstacle_box.center(), obstacle_box.heading(),\n                obstacle_box.length() + kBuff, obstacle_box.width() + kBuff);\n      static_obstacle_boxes_.push_back(std::move(expanded_obstacle_box));\n    } else {\n      std::vector<Box2d> box_by_time;\n      for (uint32_t t = 0; t <= num_of_time_stamps_; ++t) {\n        TrajectoryPoint trajectory_point =\n            ptr_obstacle->GetPointAtTime(t * config.eval_time_interval());\n\n        Box2d obstacle_box = ptr_obstacle->GetBoundingBox(trajectory_point);\n        constexpr double kBuff = 0.5;\n        Box2d expanded_obstacle_box =\n            Box2d(obstacle_box.center(), obstacle_box.heading(),\n                  obstacle_box.length() + kBuff, obstacle_box.width() + kBuff);\n        box_by_time.push_back(expanded_obstacle_box);\n      }\n      dynamic_obstacle_boxes_.push_back(std::move(box_by_time));\n    }\n  }\n}\n\ndouble TrajectoryCost::CalculatePathCost(const QuinticPolynomialCurve1d &curve,\n                                         const double start_s,\n                                         const double end_s) const {\n  double path_cost = 0.0;\n  for (double path_s = 0.0; path_s < (end_s - start_s);\n       path_s += config_.path_resolution()) {\n    const double l = curve.Evaluate(0, path_s);\n\n    std::function<double(const double)> quasi_softmax = [this](const double x) {\n      const double l0 = this->config_.path_l_cost_param_l0();\n      const double b = this->config_.path_l_cost_param_b();\n      const double k = this->config_.path_l_cost_param_k();\n      return (b + std::exp(-k * (x - l0))) \/ (1.0 + std::exp(-k * (x - l0)));\n    };\n\n    path_cost += l * l * config_.path_l_cost() * quasi_softmax(std::fabs(l));\n\n    double left_width = 0.0;\n    double right_width = 0.0;\n    reference_line_->GetLaneWidth(path_s, &left_width, &right_width);\n\n    const auto &vehicle_config =\n        common::VehicleConfigHelper::instance()->GetConfig();\n    const double width = vehicle_config.vehicle_param().width();\n\n    constexpr double kBuff = 0.2;\n    if (std::fabs(l) > std::fabs(init_sl_point_.l()) &&\n        (l + width \/ 2.0 + kBuff > left_width || l - width \/ 2.0 - kBuff < right_width)) {\n      path_cost += config_.path_out_lane_cost();\n    }\n\n    const double dl = std::fabs(curve.Evaluate(1, path_s));\n    path_cost += dl * dl * config_.path_dl_cost();\n\n    const double ddl = std::fabs(curve.Evaluate(2, path_s));\n    path_cost += ddl * ddl * config_.path_ddl_cost();\n  }\n  return path_cost * config_.path_resolution();\n}\n\ndouble TrajectoryCost::CalculateStaticObstacleCost(\n    const QuinticPolynomialCurve1d &curve, const double start_s,\n    const double end_s) const {\n  double obstacle_cost = 0.0;\n\n  for (double curr_s = start_s; curr_s <= end_s;\n       curr_s += config_.path_resolution()) {\n    const double s = curr_s - start_s;  \/\/ spline curve s\n    const double l = curve.Evaluate(0, s);\n    const double dl = curve.Evaluate(1, s);\n\n    const common::SLPoint sl =\n        common::util::MakeSLPoint(curr_s, l);  \/\/ ego vehicle sl point\n    const Box2d ego_box = GetBoxFromSLPoint(sl, dl);\n    for (const auto &obstacle_box : static_obstacle_boxes_) {\n      obstacle_cost += GetCostBetweenObsBoxes(ego_box, obstacle_box);\n    }\n  }\n  return obstacle_cost * config_.path_resolution();\n}\n\ndouble TrajectoryCost::CalculateDynamicObstacleCost(\n    const QuinticPolynomialCurve1d &curve, const double start_s,\n    const double end_s) const {\n  double obstacle_cost = 0.0;\n  double time_stamp = 0.0;\n\n  for (size_t index = 0; index < num_of_time_stamps_;\n       ++index, time_stamp += config_.eval_time_interval()) {\n    common::SpeedPoint speed_point;\n    heuristic_speed_data_.EvaluateByTime(time_stamp, &speed_point);\n    if (speed_point.s() < start_s - init_sl_point_.s()) {\n      continue;\n    }\n    if (speed_point.s() > end_s - init_sl_point_.s()) {\n      break;\n    }\n\n    const double s =\n        init_sl_point_.s() + speed_point.s() - start_s;  \/\/ s on spline curve\n    const double l = curve.Evaluate(0, s);\n    const double dl = curve.Evaluate(1, s);\n\n    const common::SLPoint sl =\n        common::util::MakeSLPoint(init_sl_point_.s() + speed_point.s(), l);\n    const Box2d ego_box = GetBoxFromSLPoint(sl, dl);\n    for (const auto &obstacle_trajectory : dynamic_obstacle_boxes_) {\n      obstacle_cost +=\n          GetCostBetweenObsBoxes(ego_box, obstacle_trajectory.at(index));\n    }\n  }\n  constexpr double kDynamicObsWeight = 1e-3;\n  return obstacle_cost * config_.eval_time_interval() * kDynamicObsWeight;\n}\n\ndouble TrajectoryCost::GetCostBetweenObsBoxes(const Box2d &ego_box,\n                                              const Box2d &obstacle_box) const {\n  \/\/ Simple version: calculate obstacle cost by distance\n  const double distance = obstacle_box.DistanceTo(ego_box);\n  if (distance > config_.obstacle_ignore_distance()) {\n    return 0.0;\n  }\n\n  std::function<double(const double, const double)> softmax = [](\n      const double x, const double x0) {\n    return std::exp(-(x - x0)) \/ (1.0 + std::exp(-(x - x0)));\n  };\n\n  double obstacle_cost = 0.0;\n  obstacle_cost += config_.obstacle_collision_cost() *\n                   softmax(distance, config_.obstacle_collision_distance());\n  obstacle_cost += 20.0 * softmax(distance, config_.obstacle_risk_distance());\n  return obstacle_cost;\n}\n\nBox2d TrajectoryCost::GetBoxFromSLPoint(const common::SLPoint &sl,\n                                        const double dl) const {\n  Vec2d xy_point;\n  reference_line_->SLToXY(sl, &xy_point);\n\n  ReferencePoint reference_point = reference_line_->GetReferencePoint(sl.s());\n\n  const double one_minus_kappa_r_d = 1 - reference_point.kappa() * sl.l();\n  const double delta_theta = std::atan2(dl, one_minus_kappa_r_d);\n  const double theta =\n      common::math::NormalizeAngle(delta_theta + reference_point.heading());\n  return Box2d(xy_point, theta, vehicle_param_.length(),\n               vehicle_param_.width());\n}\n\n\/\/ TODO(All): optimize obstacle cost calculation time\ndouble TrajectoryCost::Calculate(const QuinticPolynomialCurve1d &curve,\n                                 const double start_s,\n                                 const double end_s) const {\n  double total_cost = 0.0;\n  \/\/ path cost\n  total_cost += CalculatePathCost(curve, start_s, end_s);\n\n  \/\/ static obstacle cost\n  total_cost += CalculateStaticObstacleCost(curve, start_s, end_s);\n\n  \/\/ dynamic obstacle cost\n  total_cost += CalculateDynamicObstacleCost(curve, start_s, end_s);\n  return total_cost;\n}\n\ndouble TrajectoryCost::RiskDistanceCost(const double distance) const {\n  return (5.0 - distance) * ((5.0 - distance)) * 10;\n}\n\ndouble TrajectoryCost::RegularDistanceCost(const double distance) const {\n  return std::max(20.0 - distance, 0.0);\n}\n\n}  \/\/ namespace planning\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"Common.h\"\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <type_traits>\n\nnamespace Core\n{\n\ttemplate <typename Key, class Map>\n\tclass Bookmark\n\t{\n\tpublic:\n\t\tvoid Add(const Key& key, uint markValue)\n\t\t{\n\t\t\t_map.insert(std::make_pair(key, markValue));\n\t\t}\n\n\t\tuint Find(const Key& key) const\n\t\t{\n\t\t\tconst auto& iter = _map.find(key);\n\n\t\t\tbool found = iter != _map.end();\n\t\t\treturn found ? iter->second : -1;\/\/std::numeric_limits<uint>::max();\n\t\t}\n\n\t\tbool Has(const Key& key) const\n\t\t{\n\t\t\treturn _map.find(key) != _map.end();\n\t\t}\n\n\t\tvoid Delete(const Key& key)\n\t\t{\n\t\t\tauto found = _map.find(key);\t\t\t\n\t\t\tif (found != _map.end())\n\t\t\t\t_map.erase(found);\n\t\t}\n\n\t\tvoid DeleteAll()\n\t\t{\n\t\t\t_map.clear();\n\t\t}\n\n\t\tstatic constexpr uint Fail() { return -1; }\/\/std::numeric_limits<uint>::max(); }\n\n\tprivate:\n\t\tMap\t_map;\n\t};\n\n\ttemplate<typename Key>\n\tusing BookHashMapmark = Bookmark<Key, std::unordered_map<Key, uint>>;\n\n\ttemplate<typename Key>\n\tusing BookMapmark = Bookmark<Key, std::map<Key, uint>>;\n}<commit_msg>Bookmark - markValue이 uint가 고정이 아닌 다른 타입도 쓸 수 있도록 수정<commit_after>#pragma once\n\n#include \"Common.h\"\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <type_traits>\n#include <limits>\n\nnamespace Core\n{\n\ttemplate <typename Key, class Map>\n\tclass Bookmark\n\t{\n\tpublic:\n\t\tvoid Add(const Key& key, Map::mapped_type markValue)\n\t\t{\n\t\t\t_map.insert(std::make_pair(key, markValue));\n\t\t}\n\n\t\tuint Find(const Key& key) const\n\t\t{\n\t\t\tconst auto& iter = _map.find(key);\n\n\t\t\tbool found = iter != _map.end();\n\t\t\treturn found ? iter->second : std::numeric_limits<Map::mapped_type>::max();\n\t\t}\n\n\t\tbool Has(const Key& key) const\n\t\t{\n\t\t\treturn _map.find(key) != _map.end();\n\t\t}\n\n\t\tvoid Delete(const Key& key)\n\t\t{\n\t\t\tauto found = _map.find(key);\t\t\t\n\t\t\tif (found != _map.end())\n\t\t\t\t_map.erase(found);\n\t\t}\n\n\t\tvoid DeleteAll()\n\t\t{\n\t\t\t_map.clear();\n\t\t}\n\n\t\tstatic constexpr uint Fail() { return std::numeric_limits<Map::mapped_type>::max(); }\n\n\tprivate:\n\t\tMap\t_map;\n\t};\n\n\ttemplate<typename Key, typename MarkValueType = uint>\n\tusing BookHashMapmark = Bookmark<Key, std::unordered_map<Key, MarkValueType>>;\n\n\ttemplate<typename Key, typename MarkValueType = uint>\n\tusing BookMapmark = Bookmark<Key, std::map<Key, MarkValueType>>;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <mbed.h>\n#include <cmsis_os.h>\n#include <memory>\n\n#include \"SharedSPI.hpp\"\n#include \"CC1201Radio.hpp\"\n#include \"logger.hpp\"\n#include \"pins.hpp\"\n#include \"usb-interface.hpp\"\n#include \"watchdog.hpp\"\n#include \"RJBaseUSBDevice.hpp\"\n\n#define RJ_WATCHDOG_TIMER_VALUE 2  \/\/ seconds\n\nusing namespace std;\n\n\/\/ USBHID interface.  The false at the end tells it not to connect initially\nRJBaseUSBDevice usbLink(RJ_BASE2015_VENDOR_ID, RJ_BASE2015_PRODUCT_ID,\n                        RJ_BASE2015_RELEASE);\n\nbool initRadio() {\n    \/\/\/ A shared spi bus used for the fpga and cc1201 radio\n    shared_ptr<SharedSPI> sharedSPI =\n        make_shared<SharedSPI>(RJ_SPI_MOSI, RJ_SPI_MISO, RJ_SPI_SCK);\n    sharedSPI->format(8, 0);  \/\/ 8 bits per transfer\n\n    \/\/ RX\/TX leds\n    auto rxTimeoutLED =\n        make_shared<FlashingTimeoutLED>(DigitalOut(LED1, OpenDrain));\n    auto txTimeoutLED =\n        make_shared<FlashingTimeoutLED>(DigitalOut(LED2, OpenDrain));\n\n    \/\/ Startup the CommModule interface\n    CommModule::Instance = make_shared<CommModule>(rxTimeoutLED, txTimeoutLED);\n    shared_ptr<CommModule> commModule = CommModule::Instance;\n\n    \/\/ Create a new physical hardware communication link\n    global_radio =\n        new CC1201(sharedSPI, RJ_RADIO_nCS, RJ_RADIO_INT, preferredSettings,\n                   sizeof(preferredSettings) \/ sizeof(registerSetting_t));\n\n    return global_radio->isConnected();\n}\n\nvoid radioRxHandler(rtp::packet* pkt) {\n    \/\/ write packet content out to endpoint 1\n    vector<uint8_t> buffer;\n    pkt->pack(&buffer);\n    bool success = usbLink.writeNB(1, buffer.data(), buffer.size(),\n                                   MAX_PACKET_SIZE_EPBULK);\n\n    if (!success) {\n        LOG(WARN, \"Failed to transfer received packet over usb\");\n    }\n}\n\nint main() {\n    \/\/ set baud rate to higher value than the default for faster terminal\n    Serial s(RJ_SERIAL_RXTX);\n    s.baud(57600);\n\n    \/\/ Set the default logging configurations\n    isLogging = RJ_LOGGING_EN;\n    rjLogLevel = INIT;\n\n    LOG(INIT, \"Base station starting...\");\n\n    if (initRadio()) {\n        LOG(INIT, \"Radio interface ready on %3.2fMHz!\", global_radio->freq());\n\n        CommModule::Instance->setRxHandler(&radioRxHandler, rtp::port::CONTROL);\n        CommModule::Instance->setTxHandler(\n            (CommLink*)global_radio, &CommLink::sendPacket, rtp::port::CONTROL);\n    } else {\n        LOG(FATAL, \"No radio interface found!\");\n    }\n\n    DigitalOut radioStatusLed(LED4, global_radio->isConnected());\n\n    \/\/ set callbacks for usb control transfers\n    usbLink.writeRegisterCallback = [](uint8_t reg, uint8_t val) {\n        global_radio->writeReg(reg, val);\n    };\n    usbLink.readRegisterCallback = [](uint8_t reg) {\n        return global_radio->readReg(reg);\n    };\n    usbLink.strobeCallback = [](uint8_t strobe) {\n        global_radio->strobe(strobe);\n    };\n\n    LOG(INIT, \"Initializing USB interface...\");\n    usbLink.connect();  \/\/ note: this blocks until the link is connected\n    LOG(INIT, \"Initialized USB interface!\");\n\n    \/\/ Set the watdog timer's initial config\n    Watchdog::Set(RJ_WATCHDOG_TIMER_VALUE);\n\n    LOG(INIT, \"Listening for commands over USB\");\n\n    uint8_t buf[MAX_PACKET_SIZE_EPBULK];\n    uint32_t bufSize;\n\n    while (true) {\n        \/\/ make sure we can always reach back to main by renewing the watchdog\n        \/\/ timer periodically\n        Watchdog::Renew();\n\n        \/\/ attempt to read data from endpoint 2\n        \/\/ if data is available, write it into @pkt and send it\n        if (usbLink.readEP_NB(2, buf, &bufSize, sizeof(buf))) {\n            \/\/ TODO: header data?  port?\n\n            \/\/ construct packet from buffer received over USB\n            rtp::packet pkt;\n            pkt.recv(buf, bufSize);\n\n            \/\/ transmit!\n            CommModule::Instance->send(pkt);\n        }\n    }\n}\n<commit_msg>register handlers for more ports in base station<commit_after>#include <mbed.h>\n#include <cmsis_os.h>\n#include <memory>\n\n#include \"SharedSPI.hpp\"\n#include \"CC1201Radio.hpp\"\n#include \"logger.hpp\"\n#include \"pins.hpp\"\n#include \"usb-interface.hpp\"\n#include \"watchdog.hpp\"\n#include \"RJBaseUSBDevice.hpp\"\n\n#define RJ_WATCHDOG_TIMER_VALUE 2  \/\/ seconds\n\nusing namespace std;\n\n\/\/ USBHID interface.  The false at the end tells it not to connect initially\nRJBaseUSBDevice usbLink(RJ_BASE2015_VENDOR_ID, RJ_BASE2015_PRODUCT_ID,\n                        RJ_BASE2015_RELEASE);\n\nbool initRadio() {\n    \/\/\/ A shared spi bus used for the fpga and cc1201 radio\n    shared_ptr<SharedSPI> sharedSPI =\n        make_shared<SharedSPI>(RJ_SPI_MOSI, RJ_SPI_MISO, RJ_SPI_SCK);\n    sharedSPI->format(8, 0);  \/\/ 8 bits per transfer\n\n    \/\/ RX\/TX leds\n    auto rxTimeoutLED =\n        make_shared<FlashingTimeoutLED>(DigitalOut(LED1, OpenDrain));\n    auto txTimeoutLED =\n        make_shared<FlashingTimeoutLED>(DigitalOut(LED2, OpenDrain));\n\n    \/\/ Startup the CommModule interface\n    CommModule::Instance = make_shared<CommModule>(rxTimeoutLED, txTimeoutLED);\n    shared_ptr<CommModule> commModule = CommModule::Instance;\n\n    \/\/ Create a new physical hardware communication link\n    global_radio =\n        new CC1201(sharedSPI, RJ_RADIO_nCS, RJ_RADIO_INT, preferredSettings,\n                   sizeof(preferredSettings) \/ sizeof(registerSetting_t));\n\n    return global_radio->isConnected();\n}\n\nvoid radioRxHandler(rtp::packet* pkt) {\n    \/\/ write packet content out to endpoint 1\n    vector<uint8_t> buffer;\n    pkt->pack(&buffer);\n    bool success = usbLink.writeNB(1, buffer.data(), buffer.size(),\n                                   MAX_PACKET_SIZE_EPBULK);\n\n    if (!success) {\n        LOG(WARN, \"Failed to transfer received packet over usb\");\n    }\n}\n\nint main() {\n    \/\/ set baud rate to higher value than the default for faster terminal\n    Serial s(RJ_SERIAL_RXTX);\n    s.baud(57600);\n\n    \/\/ Set the default logging configurations\n    isLogging = RJ_LOGGING_EN;\n    rjLogLevel = INIT;\n\n    LOG(INIT, \"Base station starting...\");\n\n    if (initRadio()) {\n        LOG(INIT, \"Radio interface ready on %3.2fMHz!\", global_radio->freq());\n\n        \/\/ register handlers for any ports we might use\n        for (rtp::port port :\n             {rtp::port::CONTROL, rtp::port::PING, rtp::port::LEGACY}) {\n            CommModule::Instance->setRxHandler(&radioRxHandler, port);\n            CommModule::Instance->setTxHandler((CommLink*)global_radio,\n                                               &CommLink::sendPacket, port);\n        }\n    } else {\n        LOG(FATAL, \"No radio interface found!\");\n    }\n\n    DigitalOut radioStatusLed(LED4, global_radio->isConnected());\n\n    \/\/ set callbacks for usb control transfers\n    usbLink.writeRegisterCallback = [](uint8_t reg, uint8_t val) {\n        global_radio->writeReg(reg, val);\n    };\n    usbLink.readRegisterCallback = [](uint8_t reg) {\n        return global_radio->readReg(reg);\n    };\n    usbLink.strobeCallback = [](uint8_t strobe) {\n        global_radio->strobe(strobe);\n    };\n\n    LOG(INIT, \"Initializing USB interface...\");\n    usbLink.connect();  \/\/ note: this blocks until the link is connected\n    LOG(INIT, \"Initialized USB interface!\");\n\n    \/\/ Set the watdog timer's initial config\n    Watchdog::Set(RJ_WATCHDOG_TIMER_VALUE);\n\n    LOG(INIT, \"Listening for commands over USB\");\n\n    uint8_t buf[MAX_PACKET_SIZE_EPBULK];\n    uint32_t bufSize;\n\n    while (true) {\n        \/\/ make sure we can always reach back to main by renewing the watchdog\n        \/\/ timer periodically\n        Watchdog::Renew();\n\n        \/\/ attempt to read data from endpoint 2\n        \/\/ if data is available, write it into @pkt and send it\n        if (usbLink.readEP_NB(2, buf, &bufSize, sizeof(buf))) {\n            \/\/ TODO: header data?  port?\n\n            \/\/ construct packet from buffer received over USB\n            rtp::packet pkt;\n            pkt.recv(buf, bufSize);\n\n            \/\/ transmit!\n            CommModule::Instance->send(pkt);\n        }\n    }\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 \"renderInstance\/renderPassManager.h\"\n\n#include \"materials\/sceneData.h\"\n#include \"materials\/matInstance.h\"\n#include \"materials\/customMaterialDefinition.h\"\n#include \"materials\/materialManager.h\"\n#include \"scene\/sceneManager.h\"\n#include \"scene\/sceneObject.h\"\n#include \"gfx\/primBuilder.h\"\n#include \"platform\/profiler.h\"\n#include \"renderInstance\/renderBinManager.h\"\n#include \"renderInstance\/renderObjectMgr.h\"\n#include \"renderInstance\/renderMeshMgr.h\"\n#include \"renderInstance\/renderTranslucentMgr.h\"\n#include \"renderInstance\/renderGlowMgr.h\"\n#include \"renderInstance\/renderTerrainMgr.h\"\n#include \"core\/util\/safeDelete.h\"\n#include \"math\/util\/matrixSet.h\"\n#include \"console\/engineAPI.h\"\n\n\nconst RenderInstType RenderInstType::Invalid( \"\" );\n\nconst RenderInstType RenderPassManager::RIT_Mesh(\"Mesh\");\nconst RenderInstType RenderPassManager::RIT_Shadow(\"Shadow\");\nconst RenderInstType RenderPassManager::RIT_Sky(\"Sky\");\nconst RenderInstType RenderPassManager::RIT_Terrain(\"Terrain\");\nconst RenderInstType RenderPassManager::RIT_Object(\"Object\");      \nconst RenderInstType RenderPassManager::RIT_ObjectTranslucent(\"ObjectTranslucent\");\nconst RenderInstType RenderPassManager::RIT_Decal(\"Decal\");\nconst RenderInstType RenderPassManager::RIT_DecalRoad(\"DecalRoad\");\nconst RenderInstType RenderPassManager::RIT_Water(\"Water\");\nconst RenderInstType RenderPassManager::RIT_Foliage(\"Foliage\");\nconst RenderInstType RenderPassManager::RIT_VolumetricFog(\"ObjectVolumetricFog\");\nconst RenderInstType RenderPassManager::RIT_Translucent(\"Translucent\");\nconst RenderInstType RenderPassManager::RIT_Begin(\"Begin\");\nconst RenderInstType RenderPassManager::RIT_Custom(\"Custom\");\nconst RenderInstType RenderPassManager::RIT_Particle(\"Particle\");\nconst RenderInstType RenderPassManager::RIT_Occluder(\"Occluder\");\nconst RenderInstType RenderPassManager::RIT_Editor(\"Editor\");\n\n\n\/\/*****************************************************************************\n\/\/ RenderInstance\n\/\/*****************************************************************************\n\nvoid RenderInst::clear()\n{\n   dMemset( this, 0, sizeof(RenderInst) );\n}\n\nvoid MeshRenderInst::clear()\n{\n   dMemset( this, 0, sizeof(MeshRenderInst) );\n   visibility = 1.0f;\n}\n\nvoid ParticleRenderInst::clear()\n{\n   dMemset( this, 0, sizeof(ParticleRenderInst) );\n}\n\nvoid ObjectRenderInst::clear()\n{\n   userData = NULL;\n\n   dMemset( this, 0, sizeof( ObjectRenderInst ) );\n\n   \/\/ The memset here is kinda wrong... it clears the\n   \/\/ state initialized by the delegate constructor.\n   \/\/\n   \/\/ This fixes it... but we probably need to have a\n   \/\/ real constructor for RenderInsts.\n   renderDelegate.clear();\n}\n\nvoid OccluderRenderInst::clear()\n{\n   dMemset( this, 0, sizeof(OccluderRenderInst) );\n}\n\n\nIMPLEMENT_CONOBJECT(RenderPassManager);\n\n\nConsoleDocClass( RenderPassManager, \n   \"@brief A grouping of render bin managers which forms a render pass.\\n\\n\"\n   \"The render pass is used to order a set of RenderBinManager objects which are used \"\n   \"when rendering a scene.  This class does little work itself other than managing \"\n   \"its list of render bins.\\n\\n\"\n   \"In 'core\/scripts\/client\/renderManager.cs' you will find the DiffuseRenderPassManager \"\n   \"which is used by the C++ engine to render the scene.\\n\\n\"\n   \"@see RenderBinManager\\n\"\n   \"@ingroup RenderBin\\n\" );\n\nRenderPassManager::RenderBinEventSignal& RenderPassManager::getRenderBinSignal()\n{\n   static RenderBinEventSignal theSignal;\n   return theSignal;\n}\n\nvoid RenderPassManager::initPersistFields()\n{\n}\n\nRenderPassManager::RenderPassManager()\n{   \n   mSceneManager = NULL;\n   VECTOR_SET_ASSOCIATION( mRenderBins );\n\n   mMatrixSet = reinterpret_cast<MatrixSet *>(dMalloc_aligned(sizeof(MatrixSet), 16));\n   constructInPlace(mMatrixSet);\n}\n\nRenderPassManager::~RenderPassManager()\n{\n   dFree_aligned(mMatrixSet);\n\n   \/\/ Any bins left need to be deleted.\n   for ( U32 i=0; i<mRenderBins.size(); i++ )\n   {\n      RenderBinManager *bin = mRenderBins[i];\n\n      \/\/ Clear the parent first, so that RenderBinManager::onRemove()\n      \/\/ won't call removeManager() and break this loop.\n      bin->setRenderPass( NULL );\n      bin->deleteObject();\n   }\n}\n\nvoid RenderPassManager::_insertSort(Vector<RenderBinManager*>& list, RenderBinManager* mgr, bool renderOrder)\n{\n   U32 i;\n   for (i = 0; i < list.size(); i++)\n   {\n      bool renderCompare = mgr->getRenderOrder() < list[i]->getRenderOrder();\n      bool processAddCompare = mgr->getProcessAddOrder() < list[i]->getProcessAddOrder();\n      if ((renderOrder && renderCompare) || (!renderOrder && processAddCompare))      \n      {\n         list.insert(i);\n         list[i] = mgr;\n         return;\n      }\n   }\n\n   list.push_back(mgr);\n}\n\nvoid RenderPassManager::addManager(RenderBinManager* mgr)\n{\n   if ( !mgr->isProperlyAdded() )\n      mgr->registerObject();\n\n   AssertFatal( mgr->getRenderPass() == NULL, \"RenderPassManager::addManager() - Bin is still part of another pass manager!\" );\n   mgr->setRenderPass( this );\n\n   _insertSort(mRenderBins, mgr, true);\n}\n\nvoid RenderPassManager::removeManager(RenderBinManager* mgr)\n{\n   AssertFatal( mgr->getRenderPass() == this, \"RenderPassManager::removeManager() - We do not own this bin!\" );\n\n   mgr->setRenderPass( NULL );\n   mRenderBins.remove( mgr );\n}\n\nRenderBinManager* RenderPassManager::getManager(S32 i) const\n{\n   if (i >= 0 && i < mRenderBins.size())\n      return mRenderBins[i];\n   else\n      return NULL;\n}\n\nvoid RenderPassManager::addInst( RenderInst *inst )\n{\n   PROFILE_SCOPE( RenderPassManager_addInst );\n\n   AssertFatal( inst != NULL, \"RenderPassManager::addInst - Got null instance!\" );\n\n   AddInstTable::Iterator iter = mAddInstSignals.find( inst->type );\n   if ( iter == mAddInstSignals.end() )\n      return;\n\n   iter->value.trigger( inst );\n}\n\nvoid RenderPassManager::sort()\n{\n   PROFILE_SCOPE( RenderPassManager_Sort );\n\n   for (Vector<RenderBinManager *>::iterator itr = mRenderBins.begin();\n      itr != mRenderBins.end(); itr++)\n   {\n      AssertFatal(*itr, \"Render manager invalid!\");\n      (*itr)->sort();\n   }\n}\n\nvoid RenderPassManager::clear()\n{\n   PROFILE_SCOPE( RenderPassManager_Clear );\n\n   mChunker.clear();\n\n   for (Vector<RenderBinManager *>::iterator itr = mRenderBins.begin();\n      itr != mRenderBins.end(); itr++)\n   {\n      AssertFatal(*itr, \"Invalid render manager!\");\n      (*itr)->clear();\n   }\n}\n\nvoid RenderPassManager::render(SceneRenderState * state)\n{\n   PROFILE_SCOPE( RenderPassManager_Render );\n\n   GFX->pushWorldMatrix();\n   MatrixF proj = GFX->getProjectionMatrix();\n\n   \n   for (Vector<RenderBinManager *>::iterator itr = mRenderBins.begin();\n      itr != mRenderBins.end(); itr++)\n   {\n      RenderBinManager *curBin = *itr;\n      AssertFatal(curBin, \"Invalid render manager!\");\n      getRenderBinSignal().trigger(curBin, state, true);\n      curBin->render(state);\n      getRenderBinSignal().trigger(curBin, state, false);\n   }\n\n   GFX->popWorldMatrix();\n   GFX->setProjectionMatrix( proj );\n      \n   \/\/ Restore a clean state for subsequent rendering.\n   GFX->setupGenericShaders();\n   for(S32 i = 0; i < GFX->getNumSamplers(); ++i)\n      GFX->setTexture(i, NULL);\n}\n\nvoid RenderPassManager::renderPass(SceneRenderState * state)\n{\n   PROFILE_SCOPE( RenderPassManager_RenderPass );\n   sort();\n   render(state);\n   clear();\n}\n\nGFXTextureObject *RenderPassManager::getDepthTargetTexture()\n{\n   \/\/ If this is OpenGL, or something else has set the depth buffer, return the pointer\n   if( mDepthBuff.isValid() )\n   {\n      \/\/ If this is OpenGL, make sure the depth target matches up\n      \/\/ with the active render target.  Otherwise recreate.\n      \n      if( GFX->getAdapterType() == OpenGL )\n      {\n         GFXTarget* activeRT = GFX->getActiveRenderTarget();\n         AssertFatal( activeRT, \"Must be an active render target to call 'getDepthTargetTexture'\" );\n         \n         Point2I activeRTSize = activeRT->getSize();\n         if( mDepthBuff.getWidth() == activeRTSize.x &&\n             mDepthBuff.getHeight() == activeRTSize.y )\n            return mDepthBuff.getPointer();\n      }\n      else\n         return mDepthBuff.getPointer();\n   }\n\n   if(GFX->getAdapterType() == OpenGL)\n   {\n      AssertFatal(GFX->getActiveRenderTarget(), \"Must be an active render target to call 'getDepthTargetTexture'\");\n\n      const Point2I rtSize = GFX->getActiveRenderTarget()->getSize();\n      mDepthBuff.set(rtSize.x, rtSize.y, GFXFormatD24S8, \n         &GFXDefaultZTargetProfile, avar(\"%s() - mDepthBuff (line %d)\", __FUNCTION__, __LINE__));\n      return mDepthBuff.getPointer();\n   }\n\n   \/\/ Default return value\n   return GFXTextureTarget::sDefaultDepthStencil;\n}\n\nvoid RenderPassManager::setDepthTargetTexture( GFXTextureObject *zTarget )\n{\n   mDepthBuff = zTarget;\n}\n\nconst MatrixF* RenderPassManager::allocSharedXform( SharedTransformType stt )\n{\n   AssertFatal(stt == View || stt == Projection, \"Bad shared transform type\");\n\n   \/\/ Enable this to simulate non-shared transform performance\n   \/\/#define SIMULATE_NON_SHARED_TRANSFORMS\n#ifdef SIMULATE_NON_SHARED_TRANSFORMS\n   return allocUniqueXform(stt == View ? mMatrixSet->getWorldToCamera() : mMatrixSet->getCameraToScreen());\n#else\n   return &(stt == View ? mMatrixSet->getWorldToCamera() : mMatrixSet->getCameraToScreen());\n#endif\n}\n\nvoid RenderPassManager::assignSharedXform( SharedTransformType stt, const MatrixF &xfm )\n{\n   AssertFatal(stt == View || stt == Projection, \"Bad shared transform type\");\n   if(stt == View)\n      mMatrixSet->setSceneView(xfm);\n   else\n      mMatrixSet->setSceneProjection(xfm);\n}\n\n\/\/ Script interface\n\nDefineEngineMethod(RenderPassManager, getManagerCount, S32, (),, \n   \"Returns the total number of bin managers.\" )\n{\n   return object->getManagerCount();\n}\n\nDefineEngineMethod( RenderPassManager, getManager, RenderBinManager*, ( S32 index ),,\n   \"Returns the render bin manager at the index or null if the index is out of range.\" )\n{\n   if(index < 0 || index >= object->getManagerCount())\n      return NULL;\n\n   return object->getManager(index);\n}\n\nDefineEngineMethod( RenderPassManager, addManager, void, ( RenderBinManager *renderBin ),, \n   \"Add as a render bin manager to the pass.\" )\n{\n   if ( renderBin )\n      object->addManager( renderBin );\n}\n\nDefineEngineMethod( RenderPassManager, removeManager, void, ( RenderBinManager *renderBin ),, \n   \"Removes a render bin manager.\" )\n{\n   if ( renderBin )\n      object->removeManager( renderBin );\n}\n\n<commit_msg>Make RenderPassManager call Parent::InitPersistFields<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 \"renderInstance\/renderPassManager.h\"\n\n#include \"materials\/sceneData.h\"\n#include \"materials\/matInstance.h\"\n#include \"materials\/customMaterialDefinition.h\"\n#include \"materials\/materialManager.h\"\n#include \"scene\/sceneManager.h\"\n#include \"scene\/sceneObject.h\"\n#include \"gfx\/primBuilder.h\"\n#include \"platform\/profiler.h\"\n#include \"renderInstance\/renderBinManager.h\"\n#include \"renderInstance\/renderObjectMgr.h\"\n#include \"renderInstance\/renderMeshMgr.h\"\n#include \"renderInstance\/renderTranslucentMgr.h\"\n#include \"renderInstance\/renderGlowMgr.h\"\n#include \"renderInstance\/renderTerrainMgr.h\"\n#include \"core\/util\/safeDelete.h\"\n#include \"math\/util\/matrixSet.h\"\n#include \"console\/engineAPI.h\"\n\n\nconst RenderInstType RenderInstType::Invalid( \"\" );\n\nconst RenderInstType RenderPassManager::RIT_Mesh(\"Mesh\");\nconst RenderInstType RenderPassManager::RIT_Shadow(\"Shadow\");\nconst RenderInstType RenderPassManager::RIT_Sky(\"Sky\");\nconst RenderInstType RenderPassManager::RIT_Terrain(\"Terrain\");\nconst RenderInstType RenderPassManager::RIT_Object(\"Object\");      \nconst RenderInstType RenderPassManager::RIT_ObjectTranslucent(\"ObjectTranslucent\");\nconst RenderInstType RenderPassManager::RIT_Decal(\"Decal\");\nconst RenderInstType RenderPassManager::RIT_DecalRoad(\"DecalRoad\");\nconst RenderInstType RenderPassManager::RIT_Water(\"Water\");\nconst RenderInstType RenderPassManager::RIT_Foliage(\"Foliage\");\nconst RenderInstType RenderPassManager::RIT_VolumetricFog(\"ObjectVolumetricFog\");\nconst RenderInstType RenderPassManager::RIT_Translucent(\"Translucent\");\nconst RenderInstType RenderPassManager::RIT_Begin(\"Begin\");\nconst RenderInstType RenderPassManager::RIT_Custom(\"Custom\");\nconst RenderInstType RenderPassManager::RIT_Particle(\"Particle\");\nconst RenderInstType RenderPassManager::RIT_Occluder(\"Occluder\");\nconst RenderInstType RenderPassManager::RIT_Editor(\"Editor\");\n\n\n\/\/*****************************************************************************\n\/\/ RenderInstance\n\/\/*****************************************************************************\n\nvoid RenderInst::clear()\n{\n   dMemset( this, 0, sizeof(RenderInst) );\n}\n\nvoid MeshRenderInst::clear()\n{\n   dMemset( this, 0, sizeof(MeshRenderInst) );\n   visibility = 1.0f;\n}\n\nvoid ParticleRenderInst::clear()\n{\n   dMemset( this, 0, sizeof(ParticleRenderInst) );\n}\n\nvoid ObjectRenderInst::clear()\n{\n   userData = NULL;\n\n   dMemset( this, 0, sizeof( ObjectRenderInst ) );\n\n   \/\/ The memset here is kinda wrong... it clears the\n   \/\/ state initialized by the delegate constructor.\n   \/\/\n   \/\/ This fixes it... but we probably need to have a\n   \/\/ real constructor for RenderInsts.\n   renderDelegate.clear();\n}\n\nvoid OccluderRenderInst::clear()\n{\n   dMemset( this, 0, sizeof(OccluderRenderInst) );\n}\n\n\nIMPLEMENT_CONOBJECT(RenderPassManager);\n\n\nConsoleDocClass( RenderPassManager, \n   \"@brief A grouping of render bin managers which forms a render pass.\\n\\n\"\n   \"The render pass is used to order a set of RenderBinManager objects which are used \"\n   \"when rendering a scene.  This class does little work itself other than managing \"\n   \"its list of render bins.\\n\\n\"\n   \"In 'core\/scripts\/client\/renderManager.cs' you will find the DiffuseRenderPassManager \"\n   \"which is used by the C++ engine to render the scene.\\n\\n\"\n   \"@see RenderBinManager\\n\"\n   \"@ingroup RenderBin\\n\" );\n\nRenderPassManager::RenderBinEventSignal& RenderPassManager::getRenderBinSignal()\n{\n   static RenderBinEventSignal theSignal;\n   return theSignal;\n}\n\nvoid RenderPassManager::initPersistFields()\n{\n   Parent::initPersistFields();\n}\n\nRenderPassManager::RenderPassManager()\n{   \n   mSceneManager = NULL;\n   VECTOR_SET_ASSOCIATION( mRenderBins );\n\n   mMatrixSet = reinterpret_cast<MatrixSet *>(dMalloc_aligned(sizeof(MatrixSet), 16));\n   constructInPlace(mMatrixSet);\n}\n\nRenderPassManager::~RenderPassManager()\n{\n   dFree_aligned(mMatrixSet);\n\n   \/\/ Any bins left need to be deleted.\n   for ( U32 i=0; i<mRenderBins.size(); i++ )\n   {\n      RenderBinManager *bin = mRenderBins[i];\n\n      \/\/ Clear the parent first, so that RenderBinManager::onRemove()\n      \/\/ won't call removeManager() and break this loop.\n      bin->setRenderPass( NULL );\n      bin->deleteObject();\n   }\n}\n\nvoid RenderPassManager::_insertSort(Vector<RenderBinManager*>& list, RenderBinManager* mgr, bool renderOrder)\n{\n   U32 i;\n   for (i = 0; i < list.size(); i++)\n   {\n      bool renderCompare = mgr->getRenderOrder() < list[i]->getRenderOrder();\n      bool processAddCompare = mgr->getProcessAddOrder() < list[i]->getProcessAddOrder();\n      if ((renderOrder && renderCompare) || (!renderOrder && processAddCompare))      \n      {\n         list.insert(i);\n         list[i] = mgr;\n         return;\n      }\n   }\n\n   list.push_back(mgr);\n}\n\nvoid RenderPassManager::addManager(RenderBinManager* mgr)\n{\n   if ( !mgr->isProperlyAdded() )\n      mgr->registerObject();\n\n   AssertFatal( mgr->getRenderPass() == NULL, \"RenderPassManager::addManager() - Bin is still part of another pass manager!\" );\n   mgr->setRenderPass( this );\n\n   _insertSort(mRenderBins, mgr, true);\n}\n\nvoid RenderPassManager::removeManager(RenderBinManager* mgr)\n{\n   AssertFatal( mgr->getRenderPass() == this, \"RenderPassManager::removeManager() - We do not own this bin!\" );\n\n   mgr->setRenderPass( NULL );\n   mRenderBins.remove( mgr );\n}\n\nRenderBinManager* RenderPassManager::getManager(S32 i) const\n{\n   if (i >= 0 && i < mRenderBins.size())\n      return mRenderBins[i];\n   else\n      return NULL;\n}\n\nvoid RenderPassManager::addInst( RenderInst *inst )\n{\n   PROFILE_SCOPE( RenderPassManager_addInst );\n\n   AssertFatal( inst != NULL, \"RenderPassManager::addInst - Got null instance!\" );\n\n   AddInstTable::Iterator iter = mAddInstSignals.find( inst->type );\n   if ( iter == mAddInstSignals.end() )\n      return;\n\n   iter->value.trigger( inst );\n}\n\nvoid RenderPassManager::sort()\n{\n   PROFILE_SCOPE( RenderPassManager_Sort );\n\n   for (Vector<RenderBinManager *>::iterator itr = mRenderBins.begin();\n      itr != mRenderBins.end(); itr++)\n   {\n      AssertFatal(*itr, \"Render manager invalid!\");\n      (*itr)->sort();\n   }\n}\n\nvoid RenderPassManager::clear()\n{\n   PROFILE_SCOPE( RenderPassManager_Clear );\n\n   mChunker.clear();\n\n   for (Vector<RenderBinManager *>::iterator itr = mRenderBins.begin();\n      itr != mRenderBins.end(); itr++)\n   {\n      AssertFatal(*itr, \"Invalid render manager!\");\n      (*itr)->clear();\n   }\n}\n\nvoid RenderPassManager::render(SceneRenderState * state)\n{\n   PROFILE_SCOPE( RenderPassManager_Render );\n\n   GFX->pushWorldMatrix();\n   MatrixF proj = GFX->getProjectionMatrix();\n\n   \n   for (Vector<RenderBinManager *>::iterator itr = mRenderBins.begin();\n      itr != mRenderBins.end(); itr++)\n   {\n      RenderBinManager *curBin = *itr;\n      AssertFatal(curBin, \"Invalid render manager!\");\n      getRenderBinSignal().trigger(curBin, state, true);\n      curBin->render(state);\n      getRenderBinSignal().trigger(curBin, state, false);\n   }\n\n   GFX->popWorldMatrix();\n   GFX->setProjectionMatrix( proj );\n      \n   \/\/ Restore a clean state for subsequent rendering.\n   GFX->setupGenericShaders();\n   for(S32 i = 0; i < GFX->getNumSamplers(); ++i)\n      GFX->setTexture(i, NULL);\n}\n\nvoid RenderPassManager::renderPass(SceneRenderState * state)\n{\n   PROFILE_SCOPE( RenderPassManager_RenderPass );\n   sort();\n   render(state);\n   clear();\n}\n\nGFXTextureObject *RenderPassManager::getDepthTargetTexture()\n{\n   \/\/ If this is OpenGL, or something else has set the depth buffer, return the pointer\n   if( mDepthBuff.isValid() )\n   {\n      \/\/ If this is OpenGL, make sure the depth target matches up\n      \/\/ with the active render target.  Otherwise recreate.\n      \n      if( GFX->getAdapterType() == OpenGL )\n      {\n         GFXTarget* activeRT = GFX->getActiveRenderTarget();\n         AssertFatal( activeRT, \"Must be an active render target to call 'getDepthTargetTexture'\" );\n         \n         Point2I activeRTSize = activeRT->getSize();\n         if( mDepthBuff.getWidth() == activeRTSize.x &&\n             mDepthBuff.getHeight() == activeRTSize.y )\n            return mDepthBuff.getPointer();\n      }\n      else\n         return mDepthBuff.getPointer();\n   }\n\n   if(GFX->getAdapterType() == OpenGL)\n   {\n      AssertFatal(GFX->getActiveRenderTarget(), \"Must be an active render target to call 'getDepthTargetTexture'\");\n\n      const Point2I rtSize = GFX->getActiveRenderTarget()->getSize();\n      mDepthBuff.set(rtSize.x, rtSize.y, GFXFormatD24S8, \n         &GFXDefaultZTargetProfile, avar(\"%s() - mDepthBuff (line %d)\", __FUNCTION__, __LINE__));\n      return mDepthBuff.getPointer();\n   }\n\n   \/\/ Default return value\n   return GFXTextureTarget::sDefaultDepthStencil;\n}\n\nvoid RenderPassManager::setDepthTargetTexture( GFXTextureObject *zTarget )\n{\n   mDepthBuff = zTarget;\n}\n\nconst MatrixF* RenderPassManager::allocSharedXform( SharedTransformType stt )\n{\n   AssertFatal(stt == View || stt == Projection, \"Bad shared transform type\");\n\n   \/\/ Enable this to simulate non-shared transform performance\n   \/\/#define SIMULATE_NON_SHARED_TRANSFORMS\n#ifdef SIMULATE_NON_SHARED_TRANSFORMS\n   return allocUniqueXform(stt == View ? mMatrixSet->getWorldToCamera() : mMatrixSet->getCameraToScreen());\n#else\n   return &(stt == View ? mMatrixSet->getWorldToCamera() : mMatrixSet->getCameraToScreen());\n#endif\n}\n\nvoid RenderPassManager::assignSharedXform( SharedTransformType stt, const MatrixF &xfm )\n{\n   AssertFatal(stt == View || stt == Projection, \"Bad shared transform type\");\n   if(stt == View)\n      mMatrixSet->setSceneView(xfm);\n   else\n      mMatrixSet->setSceneProjection(xfm);\n}\n\n\/\/ Script interface\n\nDefineEngineMethod(RenderPassManager, getManagerCount, S32, (),, \n   \"Returns the total number of bin managers.\" )\n{\n   return object->getManagerCount();\n}\n\nDefineEngineMethod( RenderPassManager, getManager, RenderBinManager*, ( S32 index ),,\n   \"Returns the render bin manager at the index or null if the index is out of range.\" )\n{\n   if(index < 0 || index >= object->getManagerCount())\n      return NULL;\n\n   return object->getManager(index);\n}\n\nDefineEngineMethod( RenderPassManager, addManager, void, ( RenderBinManager *renderBin ),, \n   \"Add as a render bin manager to the pass.\" )\n{\n   if ( renderBin )\n      object->addManager( renderBin );\n}\n\nDefineEngineMethod( RenderPassManager, removeManager, void, ( RenderBinManager *renderBin ),, \n   \"Removes a render bin manager.\" )\n{\n   if ( renderBin )\n      object->removeManager( renderBin );\n}\n\n<|endoftext|>"}
{"text":"<commit_before> \/* NEEDED??\n\n *\/\n \n#include \"SensorizerServer.h\"\n\n\nSensorizerServer::SensorizerServer() {\n\t\/\/manually init array\n\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\tsensorInputs[i] = NULL;\n\t}\n\n\tthis->midiDevice = new MidiDevice(); \n\n\tthis->loadPreset();\n}\n\nSensorizerServer::~SensorizerServer() {\n\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\tif (sensorInputs[i] != NULL)\n\t\t\tdelete sensorInputs[i];\n\t}\n\n\tdelete this->midiDevice;\n}\n\n\nvoid SensorizerServer::init() {\n\tthis->midiDevice->setup();\n\t\n\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\tif (sensorInputs[i] != NULL)\n\t\t\tsensorInputs[i]->init();\n\t}\n\n}\n\n\/\/reads all input devices values into the sensorInput objects.\n\/\/also sends all values from sensor inputs.\n\/*\nvoid SensorizerServer::readAll() {\n\t\/\/if (arduino != null) {\n\t\t\/\/arduino bindings\n\t\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\/\/\t\tif (sensorInputs[i].deviceName == \"arduino\") {\n\t\t\t\t\/\/float v = (float)arduino.analogRead(sensorInputs[i].getDeviceInputIdx()) \/ 1023.0f;\n\t\t\t\t\/\/float v = arduino.read(sensorInputs[i].getDeviceInputIdx());\n\t\t\t\tfloat v = analogRead(i);\n\t\t\t\t\n\t\t\t\t\/\/if (v > 0)\n\t\t\t\t\/\/\tDebug.print(Debug.DEBUG, \"ardunio input \" + i + \": \" + v);\t\t\n\t\t\t\t\n\t\t\t\tsensorInputs[i]->setValue(v);\n\t\t\t\tsensorInputs[i]->send();\n\t\/\/\t\t}\n\t\t}\n\t\/\/}\n}\n*\/\n\nvoid SensorizerServer::readPin(int pinIdx, int pinValue) {\n\tif (pinIdx >= SENSOR_INPUTS_LENGTH)\n\t\treturn;\n\n\tfloat v = pinValue \/ 1024.0;\n\n\/\/DEBUG_PRINT_NUM(\"readPin pin: \", pinIdx)\n\/\/DEBUG_PRINT_NUM(\"readPin val: \", v)\n  \n\tsensorInputs[pinIdx]->setValue(v);\n\tsensorInputs[pinIdx]->send();\n}\n\nvoid SensorizerServer::loadPreset() {\n\tint i = 0;\n\tSensorOutput* s;\n\tMidiMapping* m;\n\t\n\t\/\/arduino 0\ns = new SensorOutput();\ns->inRange.low = 0.028571429;\ns->inRange.high = 0.35;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.014285714;\ns->cutoffRange.high = 0.95;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\n\/\/ m = new MidiMapping(this->midiDevice);\n\/\/ m->channel = 0;\n\/\/ m->note = 60 + i;\n\/\/ s->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 1\ns = new SensorOutput();\ns->inRange.low = 0.021428572;\ns->inRange.high = 0.44285715;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.057142872;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 57;\/\/60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 2\ns = new SensorOutput();\ns->inRange.low = 0;\ns->inRange.high = 0.47142863;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.1;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 3\ns = new SensorOutput();\ns->inRange.low = 0;\ns->inRange.high = 0.5;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.07;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 4\ns = new SensorOutput();\ns->inRange.low = 0;\ns->inRange.high = 0.5;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.1;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 5\ns = new SensorOutput();\ns->inRange.low = 0;\ns->inRange.high = 1;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.1;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n}\n\n\nvoid SensorizerServer::loadNotes(byte notes[]) {\n\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\tif (sensorInputs[i] != NULL) {\n\t\t\tif (sensorInputs[i]->dropdownMidiMappings[0] != NULL)\n\t\t\t\tsensorInputs[i]->dropdownMidiMappings[0]->note = notes[i];\n\t\t}\n\t}\n}\n<commit_msg>fixed cutoff range<commit_after> \/* NEEDED??\n\n *\/\n \n#include \"SensorizerServer.h\"\n\n\nSensorizerServer::SensorizerServer() {\n\t\/\/manually init array\n\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\tsensorInputs[i] = NULL;\n\t}\n\n\tthis->midiDevice = new MidiDevice(); \n\n\tthis->loadPreset();\n}\n\nSensorizerServer::~SensorizerServer() {\n\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\tif (sensorInputs[i] != NULL)\n\t\t\tdelete sensorInputs[i];\n\t}\n\n\tdelete this->midiDevice;\n}\n\n\nvoid SensorizerServer::init() {\n\tthis->midiDevice->setup();\n\t\n\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\tif (sensorInputs[i] != NULL)\n\t\t\tsensorInputs[i]->init();\n\t}\n\n}\n\n\/\/reads all input devices values into the sensorInput objects.\n\/\/also sends all values from sensor inputs.\n\/*\nvoid SensorizerServer::readAll() {\n\t\/\/if (arduino != null) {\n\t\t\/\/arduino bindings\n\t\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\/\/\t\tif (sensorInputs[i].deviceName == \"arduino\") {\n\t\t\t\t\/\/float v = (float)arduino.analogRead(sensorInputs[i].getDeviceInputIdx()) \/ 1023.0f;\n\t\t\t\t\/\/float v = arduino.read(sensorInputs[i].getDeviceInputIdx());\n\t\t\t\tfloat v = analogRead(i);\n\t\t\t\t\n\t\t\t\t\/\/if (v > 0)\n\t\t\t\t\/\/\tDebug.print(Debug.DEBUG, \"ardunio input \" + i + \": \" + v);\t\t\n\t\t\t\t\n\t\t\t\tsensorInputs[i]->setValue(v);\n\t\t\t\tsensorInputs[i]->send();\n\t\/\/\t\t}\n\t\t}\n\t\/\/}\n}\n*\/\n\nvoid SensorizerServer::readPin(int pinIdx, int pinValue) {\n\tif (pinIdx >= SENSOR_INPUTS_LENGTH)\n\t\treturn;\n\n\tfloat v = pinValue \/ 1024.0;\n\n\/\/DEBUG_PRINT_NUM(\"readPin pin: \", pinIdx)\n\/\/DEBUG_PRINT_NUM(\"readPin val: \", v)\n  \n\tsensorInputs[pinIdx]->setValue(v);\n\tsensorInputs[pinIdx]->send();\n}\n\nvoid SensorizerServer::loadPreset() {\n\tint i = 0;\n\tSensorOutput* s;\n\tMidiMapping* m;\n\t\n\t\/\/arduino 0\ns = new SensorOutput();\ns->inRange.low = 0.028571429;\ns->inRange.high = 0.35;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.014285714;\ns->cutoffRange.high = 0.95;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\n\/\/ m = new MidiMapping(this->midiDevice);\n\/\/ m->channel = 0;\n\/\/ m->note = 60 + i;\n\/\/ s->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 1\ns = new SensorOutput();\ns->inRange.low = 0.021428572;\ns->inRange.high = 0.44285715;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.057142872;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 57;\/\/60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 2\ns = new SensorOutput();\ns->inRange.low = 0;\ns->inRange.high = 0.47142863;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.1;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 3\ns = new SensorOutput();\ns->inRange.low = 0;\ns->inRange.high = 0.5;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.1;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 4\ns = new SensorOutput();\ns->inRange.low = 0;\ns->inRange.high = 0.5;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.1;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n\n\n\/\/arduino 5\ns = new SensorOutput();\ns->inRange.low = 0;\ns->inRange.high = 1;\ns->outRange.low = 0;\ns->outRange.high = 1;\ns->cutoffRange.low = 0.1;\ns->cutoffRange.high = 1;\ns->setCutoffType(3); \/\/Nullable\ns->multiplyVal = 1;\ns->addVal = 0;\ns->isInvert = false;\n\nm = new MidiMapping(this->midiDevice);\nm->channel = 0;\nm->note = 60 + i;\nm->setMsgType(MidiMapping::NOTE_ONE_ONLY);\ns->addMidiMapping(m);\n\nsensorInputs[i++] = s;\n}\n\n\nvoid SensorizerServer::loadNotes(byte notes[]) {\n\tfor (int i = 0; i < SENSOR_INPUTS_LENGTH; i++) {\n\t\tif (sensorInputs[i] != NULL) {\n\t\t\tif (sensorInputs[i]->dropdownMidiMappings[0] != NULL)\n\t\t\t\tsensorInputs[i]->dropdownMidiMappings[0]->note = notes[i];\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * AtmoExternalCaptureInput.cpp: Datasource which gets its data via a COM object call\n * or some other external method.\n *\n *\n * See the README.txt file for copyright information and how to reach the author(s).\n *\n * $Id$\n *\/\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"AtmoExternalCaptureInput.h\"\n#include \"AtmoTools.h\"\n\n\n#if defined(_ATMO_VLC_PLUGIN_)\n\n\n#ifndef INT64_C\n#define INT64_C(c)  c ## LL\n#endif\n\nCAtmoExternalCaptureInput::CAtmoExternalCaptureInput(CAtmoDynData *pAtmoDynData) :\n                           CAtmoInput(pAtmoDynData)\n{\n    vlc_cond_init( &m_WakeupCond );\n    vlc_mutex_init( &m_WakeupLock );\n    m_pCurrentFramePixels = NULL;\n    m_pLog = pAtmoDynData->getAtmoFilter();\n}\n\n#else\n\nCAtmoExternalCaptureInput::CAtmoExternalCaptureInput(CAtmoDynData *pAtmoDynData) :\n                           CAtmoInput(pAtmoDynData)\n{\n    m_hWakeupEvent = CreateEvent(NULL,0,0,NULL);\n    InitializeCriticalSection( &m_BufferLock );\n    m_pCurrentFramePixels = NULL;\n}\n\n#endif\n\nCAtmoExternalCaptureInput::~CAtmoExternalCaptureInput(void)\n{\n   \/* if there is still an unprocessed bufferpicture do kill it *\/\n#if defined(_ATMO_VLC_PLUGIN_)\n   vlc_mutex_lock( &m_WakeupLock );\n   free( m_pCurrentFramePixels );\n   vlc_mutex_unlock( &m_WakeupLock );\n\n   vlc_cond_destroy( &m_WakeupCond );\n   vlc_mutex_destroy( &m_WakeupLock );\n#else\n   EnterCriticalSection( &m_BufferLock );\n   free( m_pCurrentFramePixels );\n   LeaveCriticalSection( &m_BufferLock );\n   CloseHandle(m_hWakeupEvent);\n   DeleteCriticalSection( &m_BufferLock );\n#endif\n}\n\nATMO_BOOL CAtmoExternalCaptureInput::Open()\n{\n    this->Run();\n    return ATMO_TRUE;\n}\n\n\/\/ Closes the input-device.\n\/\/ Returns true if the input-device was closed successfully.\nATMO_BOOL CAtmoExternalCaptureInput::Close(void)\n{\n    this->Terminate();\n    return ATMO_TRUE;\n}\n\n\n\/*\n  this method will be called from another thread or possible the COM Server to feed\n  new pixeldata into the calculation process it doest just the following:\n  1: check if last buffer was allready processed (!m_pCurrentFramePixels)\n  2. copy the bitmap info structure into the threads own one\n  3. alloc memory for frame\n  4. copy sourcepixeldata into own buffer...\n  5. let the thread wake up and return imediately to the caller\n  so that the real videoout wouldn't be stop for a too long time\n*\/\nvoid CAtmoExternalCaptureInput::DeliverNewSourceDataPaket(VLC_BITMAPINFOHEADER *bmpInfoHeader,void *pixelData)\n{\n    \/*\n       normaly we should protect this area of code by critical_section or a mutex,\n       but I think we can omit this here because the timing this method is called\n       is really slow (in terms of the speed of a modern computer?)\n       so it's nearly impossible that two frames are delivert in the same time\n       the test needs and malloc needs...\n    *\/\n#if defined(_ATMO_VLC_PLUGIN_)\n\/\/    msg_Dbg( m_pLog, \"DeliverNewSourceDataPaket start...\");\n    vlc_mutex_lock( &m_WakeupLock );\n#else\n    EnterCriticalSection( &m_BufferLock );\n#endif\n    if( !m_pCurrentFramePixels )\n    {\n        \/\/ Last Frame was processed... take this one...\n        memcpy(&m_CurrentFrameHeader,bmpInfoHeader,bmpInfoHeader->biSize);\n        int PixelDataSize = m_CurrentFrameHeader.biHeight * m_CurrentFrameHeader.biWidth;\n        switch(m_CurrentFrameHeader.biBitCount) {\n            case 8:  \/* PixelDataSize = PixelDataSize; *\/ break;\n            case 16: PixelDataSize = PixelDataSize * 2; break;\n            case 24: PixelDataSize = PixelDataSize * 3; break;\n            case 32: PixelDataSize = PixelDataSize * 4; break;\n        }\n        m_pCurrentFramePixels = malloc(PixelDataSize);\n        memcpy(m_pCurrentFramePixels,pixelData,PixelDataSize);\n    }\n#if defined(_ATMO_VLC_PLUGIN_)\n    vlc_cond_signal( &m_WakeupCond );\n    vlc_mutex_unlock( &m_WakeupLock );\n    \/\/ msg_Dbg( m_pLog, \"DeliverNewSourceDataPaket done.\");\n#else\n    SetEvent(m_hWakeupEvent);\n    LeaveCriticalSection( &m_BufferLock );\n#endif\n}\n\n\n\n\/*\n the real thread Method which is processing the pixeldata into the hardware channel\n values - which are used by the thread AtmoLiveView...\n*\/\n#if defined (_ATMO_VLC_PLUGIN_)\n\nDWORD CAtmoExternalCaptureInput::Execute(void)\n{\n    while ((this->m_bTerminated == ATMO_FALSE)) {\n          vlc_mutex_lock( &m_WakeupLock );\n          vlc_cond_timedwait(&m_WakeupCond, &m_WakeupLock, mdate() + 75000 );\n\n          \/* DeliverNewSourceDataPaket delivered new work for me... get it! *\/\n          if(m_pCurrentFramePixels)\n             CalcColors(); \/\/ read picture and calculate colors\n          vlc_mutex_unlock( &m_WakeupLock );\n    }\n\n    msg_Dbg( m_pLog, \"DWORD CAtmoExternalCaptureInput::Execute(void) bailed out?\");\n\n    return 0;\n}\n\n#else\n\nDWORD CAtmoExternalCaptureInput::Execute(void) {\n    HANDLE handles[2];\n    handles[0] = this->m_hTerminateEvent;\n    handles[1] = m_hWakeupEvent;\n\n    while (this->m_bTerminated == ATMO_FALSE) {\n           DWORD event = WaitForMultipleObjects(2, &handles[0], FALSE, INFINITE);\n           if(event == WAIT_OBJECT_0) {\n              \/\/ Terminate Thread Event was set... say good bye...!\n              break;\n           }\n           if(event == (WAIT_OBJECT_0+1)) {\n              EnterCriticalSection( &m_BufferLock );\n              if(m_pCurrentFramePixels)\n                 CalcColors(); \/\/ read picture and calculate colors\n              LeaveCriticalSection( &m_BufferLock );\n           }\n    }\n    return 0;\n}\n\n#endif\n\n\nvoid CAtmoExternalCaptureInput::CalcColors()\n{\n     \/\/ take data from m_CurrentFrameHeader and m_pCurrentFramePixels .. process for atmo ...\n    tHSVColor HSV_Img[IMAGE_SIZE];\n    tRGBColor pixelColor;\n    int srcIndex,index = 0;\n    memset(&HSV_Img,0,sizeof(HSV_Img));\n\n    \/\/ msg_Dbg( m_pLog, \"CalcColors start...\");\n\n    if((m_CurrentFrameHeader.biWidth == CAP_WIDTH) && (m_CurrentFrameHeader.biHeight == CAP_HEIGHT))\n    {\n\n        \/\/ HSVI = HSV Image allready in right format just copy the easiest task\n        \/\/ und weiterverarbeiten lassen\n#ifdef _ATMO_VLC_PLUGIN_\n        if(m_CurrentFrameHeader.biCompression ==  VLC_FOURCC('H','S','V','I'))\n#else\n        if(m_CurrentFrameHeader.biCompression ==  MakeDword('H','S','V','I'))\n#endif\n        {\n            memcpy( &HSV_Img, m_pCurrentFramePixels, CAP_WIDTH * CAP_HEIGHT * sizeof(tHSVColor));\n        }\n        else if(m_CurrentFrameHeader.biCompression == BI_RGB)\n        {\n            if(m_CurrentFrameHeader.biBitCount == 16)\n            {\n                unsigned short *buffer = (unsigned short *)m_pCurrentFramePixels;\n\n                for(int y=0;y<CAP_HEIGHT;y++)\n                {\n                    srcIndex = y * CAP_WIDTH;\n                    for(int x=0;x<CAP_WIDTH;x++)\n                    {\n                        pixelColor.b = (buffer[srcIndex] & 31) << 3;\n                        pixelColor.g = ((buffer[srcIndex] >> 5) & 31) << 3;\n                        pixelColor.r = ((buffer[srcIndex] >> 10) & 63) << 2;\n                        srcIndex++;\n                        HSV_Img[index++] = RGB2HSV(pixelColor);\n                    }\n                }\n            }\n            else if(m_CurrentFrameHeader.biBitCount == 24)\n            {\n                for(int y=0;y<CAP_HEIGHT;y++)\n                {\n                    srcIndex = y * (CAP_WIDTH*3);\n                    for(int x=0;x<CAP_WIDTH;x++)\n                    {\n                        pixelColor.b = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        pixelColor.g = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        pixelColor.r = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        HSV_Img[index++] = RGB2HSV(pixelColor);\n                    }\n                }\n            }\n            else if(m_CurrentFrameHeader.biBitCount == 32)\n            {\n                for(int y=0;y<CAP_HEIGHT;y++)\n                {\n                    srcIndex = y * (CAP_WIDTH*4);\n                    for(int x=0;x<CAP_WIDTH;x++)\n                    {\n                        pixelColor.b = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        pixelColor.g = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        pixelColor.r = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        srcIndex++;\n                        HSV_Img[index++] = RGB2HSV(pixelColor);\n                    }\n                }\n            }\n        }\n    }\n    \/*\n      else {\n        if the image color format wasn't recognized - the output\n        will be black (memset)\n        }\n    *\/\n\n    \/* remove the source buffer *\/\n    free( m_pCurrentFramePixels );\n    m_pCurrentFramePixels = NULL;\n\n    \/*\n        now convert the pixeldata into one RGB trippel for each channel,\n        this is done by some very sophisticated methods and statistics ...\n\n        the only thing I know - the pixel priority is controled by some\n        gradients for each edge of the picture\n\n        (sorry I don't know how it exactly works because the formulas\n        are done by some one else...)\n    *\/\n    \/\/msg_Dbg( m_pLog, \"CalcColors ende AddPacket...\");\n    m_pAtmoDynData->getLivePacketQueue()->AddPacket( m_pAtmoColorCalculator->AnalyzeHSV( HSV_Img ) );\n    \/\/msg_Dbg( m_pLog, \"CalcColors ende AddPacket...done.\");\n}\n\n<commit_msg>atmo: remove extraneous parentheses<commit_after>\/*\n * AtmoExternalCaptureInput.cpp: Datasource which gets its data via a COM object call\n * or some other external method.\n *\n *\n * See the README.txt file for copyright information and how to reach the author(s).\n *\n * $Id$\n *\/\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"AtmoExternalCaptureInput.h\"\n#include \"AtmoTools.h\"\n\n\n#if defined(_ATMO_VLC_PLUGIN_)\n\n\n#ifndef INT64_C\n#define INT64_C(c)  c ## LL\n#endif\n\nCAtmoExternalCaptureInput::CAtmoExternalCaptureInput(CAtmoDynData *pAtmoDynData) :\n                           CAtmoInput(pAtmoDynData)\n{\n    vlc_cond_init( &m_WakeupCond );\n    vlc_mutex_init( &m_WakeupLock );\n    m_pCurrentFramePixels = NULL;\n    m_pLog = pAtmoDynData->getAtmoFilter();\n}\n\n#else\n\nCAtmoExternalCaptureInput::CAtmoExternalCaptureInput(CAtmoDynData *pAtmoDynData) :\n                           CAtmoInput(pAtmoDynData)\n{\n    m_hWakeupEvent = CreateEvent(NULL,0,0,NULL);\n    InitializeCriticalSection( &m_BufferLock );\n    m_pCurrentFramePixels = NULL;\n}\n\n#endif\n\nCAtmoExternalCaptureInput::~CAtmoExternalCaptureInput(void)\n{\n   \/* if there is still an unprocessed bufferpicture do kill it *\/\n#if defined(_ATMO_VLC_PLUGIN_)\n   vlc_mutex_lock( &m_WakeupLock );\n   free( m_pCurrentFramePixels );\n   vlc_mutex_unlock( &m_WakeupLock );\n\n   vlc_cond_destroy( &m_WakeupCond );\n   vlc_mutex_destroy( &m_WakeupLock );\n#else\n   EnterCriticalSection( &m_BufferLock );\n   free( m_pCurrentFramePixels );\n   LeaveCriticalSection( &m_BufferLock );\n   CloseHandle(m_hWakeupEvent);\n   DeleteCriticalSection( &m_BufferLock );\n#endif\n}\n\nATMO_BOOL CAtmoExternalCaptureInput::Open()\n{\n    this->Run();\n    return ATMO_TRUE;\n}\n\n\/\/ Closes the input-device.\n\/\/ Returns true if the input-device was closed successfully.\nATMO_BOOL CAtmoExternalCaptureInput::Close(void)\n{\n    this->Terminate();\n    return ATMO_TRUE;\n}\n\n\n\/*\n  this method will be called from another thread or possible the COM Server to feed\n  new pixeldata into the calculation process it doest just the following:\n  1: check if last buffer was allready processed (!m_pCurrentFramePixels)\n  2. copy the bitmap info structure into the threads own one\n  3. alloc memory for frame\n  4. copy sourcepixeldata into own buffer...\n  5. let the thread wake up and return imediately to the caller\n  so that the real videoout wouldn't be stop for a too long time\n*\/\nvoid CAtmoExternalCaptureInput::DeliverNewSourceDataPaket(VLC_BITMAPINFOHEADER *bmpInfoHeader,void *pixelData)\n{\n    \/*\n       normaly we should protect this area of code by critical_section or a mutex,\n       but I think we can omit this here because the timing this method is called\n       is really slow (in terms of the speed of a modern computer?)\n       so it's nearly impossible that two frames are delivert in the same time\n       the test needs and malloc needs...\n    *\/\n#if defined(_ATMO_VLC_PLUGIN_)\n\/\/    msg_Dbg( m_pLog, \"DeliverNewSourceDataPaket start...\");\n    vlc_mutex_lock( &m_WakeupLock );\n#else\n    EnterCriticalSection( &m_BufferLock );\n#endif\n    if( !m_pCurrentFramePixels )\n    {\n        \/\/ Last Frame was processed... take this one...\n        memcpy(&m_CurrentFrameHeader,bmpInfoHeader,bmpInfoHeader->biSize);\n        int PixelDataSize = m_CurrentFrameHeader.biHeight * m_CurrentFrameHeader.biWidth;\n        switch(m_CurrentFrameHeader.biBitCount) {\n            case 8:  \/* PixelDataSize = PixelDataSize; *\/ break;\n            case 16: PixelDataSize = PixelDataSize * 2; break;\n            case 24: PixelDataSize = PixelDataSize * 3; break;\n            case 32: PixelDataSize = PixelDataSize * 4; break;\n        }\n        m_pCurrentFramePixels = malloc(PixelDataSize);\n        memcpy(m_pCurrentFramePixels,pixelData,PixelDataSize);\n    }\n#if defined(_ATMO_VLC_PLUGIN_)\n    vlc_cond_signal( &m_WakeupCond );\n    vlc_mutex_unlock( &m_WakeupLock );\n    \/\/ msg_Dbg( m_pLog, \"DeliverNewSourceDataPaket done.\");\n#else\n    SetEvent(m_hWakeupEvent);\n    LeaveCriticalSection( &m_BufferLock );\n#endif\n}\n\n\n\n\/*\n the real thread Method which is processing the pixeldata into the hardware channel\n values - which are used by the thread AtmoLiveView...\n*\/\n#if defined (_ATMO_VLC_PLUGIN_)\n\nDWORD CAtmoExternalCaptureInput::Execute(void)\n{\n    while (this->m_bTerminated == ATMO_FALSE) {\n          vlc_mutex_lock( &m_WakeupLock );\n          vlc_cond_timedwait(&m_WakeupCond, &m_WakeupLock, mdate() + 75000 );\n\n          \/* DeliverNewSourceDataPaket delivered new work for me... get it! *\/\n          if(m_pCurrentFramePixels)\n             CalcColors(); \/\/ read picture and calculate colors\n          vlc_mutex_unlock( &m_WakeupLock );\n    }\n\n    msg_Dbg( m_pLog, \"DWORD CAtmoExternalCaptureInput::Execute(void) bailed out?\");\n\n    return 0;\n}\n\n#else\n\nDWORD CAtmoExternalCaptureInput::Execute(void) {\n    HANDLE handles[2];\n    handles[0] = this->m_hTerminateEvent;\n    handles[1] = m_hWakeupEvent;\n\n    while (this->m_bTerminated == ATMO_FALSE) {\n           DWORD event = WaitForMultipleObjects(2, &handles[0], FALSE, INFINITE);\n           if(event == WAIT_OBJECT_0) {\n              \/\/ Terminate Thread Event was set... say good bye...!\n              break;\n           }\n           if(event == (WAIT_OBJECT_0+1)) {\n              EnterCriticalSection( &m_BufferLock );\n              if(m_pCurrentFramePixels)\n                 CalcColors(); \/\/ read picture and calculate colors\n              LeaveCriticalSection( &m_BufferLock );\n           }\n    }\n    return 0;\n}\n\n#endif\n\n\nvoid CAtmoExternalCaptureInput::CalcColors()\n{\n     \/\/ take data from m_CurrentFrameHeader and m_pCurrentFramePixels .. process for atmo ...\n    tHSVColor HSV_Img[IMAGE_SIZE];\n    tRGBColor pixelColor;\n    int srcIndex,index = 0;\n    memset(&HSV_Img,0,sizeof(HSV_Img));\n\n    \/\/ msg_Dbg( m_pLog, \"CalcColors start...\");\n\n    if((m_CurrentFrameHeader.biWidth == CAP_WIDTH) && (m_CurrentFrameHeader.biHeight == CAP_HEIGHT))\n    {\n\n        \/\/ HSVI = HSV Image allready in right format just copy the easiest task\n        \/\/ und weiterverarbeiten lassen\n#ifdef _ATMO_VLC_PLUGIN_\n        if(m_CurrentFrameHeader.biCompression ==  VLC_FOURCC('H','S','V','I'))\n#else\n        if(m_CurrentFrameHeader.biCompression ==  MakeDword('H','S','V','I'))\n#endif\n        {\n            memcpy( &HSV_Img, m_pCurrentFramePixels, CAP_WIDTH * CAP_HEIGHT * sizeof(tHSVColor));\n        }\n        else if(m_CurrentFrameHeader.biCompression == BI_RGB)\n        {\n            if(m_CurrentFrameHeader.biBitCount == 16)\n            {\n                unsigned short *buffer = (unsigned short *)m_pCurrentFramePixels;\n\n                for(int y=0;y<CAP_HEIGHT;y++)\n                {\n                    srcIndex = y * CAP_WIDTH;\n                    for(int x=0;x<CAP_WIDTH;x++)\n                    {\n                        pixelColor.b = (buffer[srcIndex] & 31) << 3;\n                        pixelColor.g = ((buffer[srcIndex] >> 5) & 31) << 3;\n                        pixelColor.r = ((buffer[srcIndex] >> 10) & 63) << 2;\n                        srcIndex++;\n                        HSV_Img[index++] = RGB2HSV(pixelColor);\n                    }\n                }\n            }\n            else if(m_CurrentFrameHeader.biBitCount == 24)\n            {\n                for(int y=0;y<CAP_HEIGHT;y++)\n                {\n                    srcIndex = y * (CAP_WIDTH*3);\n                    for(int x=0;x<CAP_WIDTH;x++)\n                    {\n                        pixelColor.b = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        pixelColor.g = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        pixelColor.r = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        HSV_Img[index++] = RGB2HSV(pixelColor);\n                    }\n                }\n            }\n            else if(m_CurrentFrameHeader.biBitCount == 32)\n            {\n                for(int y=0;y<CAP_HEIGHT;y++)\n                {\n                    srcIndex = y * (CAP_WIDTH*4);\n                    for(int x=0;x<CAP_WIDTH;x++)\n                    {\n                        pixelColor.b = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        pixelColor.g = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        pixelColor.r = ((unsigned char *)m_pCurrentFramePixels)[srcIndex++];\n                        srcIndex++;\n                        HSV_Img[index++] = RGB2HSV(pixelColor);\n                    }\n                }\n            }\n        }\n    }\n    \/*\n      else {\n        if the image color format wasn't recognized - the output\n        will be black (memset)\n        }\n    *\/\n\n    \/* remove the source buffer *\/\n    free( m_pCurrentFramePixels );\n    m_pCurrentFramePixels = NULL;\n\n    \/*\n        now convert the pixeldata into one RGB trippel for each channel,\n        this is done by some very sophisticated methods and statistics ...\n\n        the only thing I know - the pixel priority is controled by some\n        gradients for each edge of the picture\n\n        (sorry I don't know how it exactly works because the formulas\n        are done by some one else...)\n    *\/\n    \/\/msg_Dbg( m_pLog, \"CalcColors ende AddPacket...\");\n    m_pAtmoDynData->getLivePacketQueue()->AddPacket( m_pAtmoColorCalculator->AnalyzeHSV( HSV_Img ) );\n    \/\/msg_Dbg( m_pLog, \"CalcColors ende AddPacket...done.\");\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2011 by Iowa State University\n *\n * Original Authors:\n *   Allen Bierbaum, Christopher Just,\n *   Patrick Hartling, Kevin Meinert,\n *   Carolina Cruz-Neira, Albert Baker\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., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301, USA.\n *\n *************** <auto-copyright.pl END do not edit this line> ***************\/\n\n#include <vrj\/Draw\/Direct3D\/Config.h>\n\n#include <gmtl\/Matrix.h>\n#include <gmtl\/Generate.h>\n#include <gmtl\/MatrixOps.h>\n#include <gmtl\/Vec.h>\n#include <gmtl\/VecOps.h>\n#include <gmtl\/Xforms.h>\n#include <gmtl\/Output.h>\n\n#include <jccl\/Config\/ConfigElement.h>\n\n#include <vrj\/Kernel\/User.h>\n\n#include <vrj\/Draw\/Direct3D\/DrawManager.h>\n\n#include <vrj\/Display\/DisplayManager.h>\n#include <vrj\/Display\/Display.h>\n#include <vrj\/Display\/Projection.h>\n#include <vrj\/Display\/Viewport.h>\n#include <vrj\/Display\/SimViewport.h>\n#include <vrj\/Display\/SurfaceViewport.h>\n\n#include <vrj\/Draw\/Direct3D\/SimInterfaceFactory.h>\n#include <vrj\/Draw\/Direct3D\/BasicSimulator.h>\n\n\nnamespace vrj\n{\n\nnamespace direct3d\n{\n\nVRJ_REGISTER_D3D_SIM_INTERFACE_CREATOR(BasicSimulator);\n\nBasicSimulator::BasicSimulator()\n{;}\n\nBasicSimulator::~BasicSimulator()\n{;}\n\n\/*\n* Configure the basic simulator config\n* @pre element is a valid configuration element.\n* @post It should be configured\n*\/\nbool BasicSimulator::config(jccl::ConfigElementPtr element)\n{\n   vprASSERT(element.get() != NULL);\n   vprASSERT(element->getID() == std::string(\"default_simulator\"));\n\n   std::string camera_proxy_str = element->getProperty<std::string>(\"camera_pos\");\n   std::string wand_proxy_str = element->getProperty<std::string>(\"wand_pos\");\n\n   mCamera.init(camera_proxy_str);\n   mWand.init(wand_proxy_str);      \/\/ Configure the wand to use\n\n   if(!mCamera.isConnected())\n   {\n      vprDEBUG(vprDBG_ERROR, vprDBG_CRITICAL_LVL)\n         << clrOutNORM(clrRED, \"ERROR:\")\n         << \"[vrj::direct3d::BasicSimulator::config()] Fatal Error: Camera \"\n         << \"not found named: \" << camera_proxy_str << vprDEBUG_FLUSH;\n      vprASSERT(false);\n   }\n\n   \/\/ Get drawing parameters\n   mDrawProjections = element->getProperty<bool>(\"draw_projections\");\n   mSurfaceColor[0] = element->getProperty<float>(\"surface_color\", 0);\n   mSurfaceColor[1] = element->getProperty<float>(\"surface_color\", 1);\n   mSurfaceColor[2] = element->getProperty<float>(\"surface_color\", 2);\n\n   return true;\n}\n\n\/**\n * Draws this sim device using the given information about the Window it\n * will be drawing into.\n *\/\nvoid BasicSimulator::draw(const float scaleFactor)\n{\n   drawSimulator(scaleFactor);\n}\n\n\/**\n * Sets the keyboard\/mouse device the simulator can use to get input from the\n * user.\n *\/\nvoid BasicSimulator::setKeyboardMouse(gadget::KeyboardMouseInterface)\n{\n}\n\nvoid BasicSimulator::updateProjectionData(const float positionScale,\n                                          ProjectionPtr leftProj,\n                                          ProjectionPtr rightProj)\n{\n   updateInternalData(positionScale);\n\n   gmtl::Matrix44f camera_pos = getCameraPos();\n   gmtl::Vec3f camera_trans = gmtl::makeTrans<gmtl::Vec3f>(camera_pos);\n\n   \/\/ -- Calculate camera (eye) Positions -- \/\/\n   vprDEBUG(vprDBG_ALL, vprDBG_HEX_LVL)\n      << \"[vrj::direct3d::BasicSimulator::updateProjectionData()] Getting \"\n      << \"camera position\" << std::endl << vprDEBUG_FLUSH;\n   vprDEBUG(vprDBG_ALL, vprDBG_HEX_LVL) << \"CamPos:\" << camera_trans\n                                        << std::endl << vprDEBUG_FLUSH;\n\n   \/\/ Compute location of left and right eyes\n   float interocular_dist = mSimViewport->getUser()->getInterocularDistance();\n   interocular_dist *= positionScale;               \/\/ Scale into correct units\n   float eye_offset = interocular_dist \/ 2.0f;      \/\/ Distance to move eye\n\n   \/\/ NOTE: Eye coord system is -z forward, x-right, y-up\n   const gmtl::Point3f left_eye_pos(\n      camera_pos * gmtl::Point3f(-eye_offset, 0.0f, 0.0f)\n   );\n   const gmtl::Point3f right_eye_pos(\n      camera_pos * gmtl::Point3f(eye_offset, 0.0f, 0.0f)\n   );\n\n   leftProj->calcViewMatrix(left_eye_pos, positionScale);\n   rightProj->calcViewMatrix(right_eye_pos, positionScale);\n}\n\n\/**  Update internal simulator data *\/\nvoid BasicSimulator::updateInternalData(float positionScale)\n{\n   mHeadPos = mSimViewport->getUser()->getHeadPosProxy()->getData(positionScale);\n   mWandPos = mWand->getData(positionScale);\n\n   mCameraPos = mCamera->getData(positionScale);\n   gmtl::invert(mCameraPos);\n}\n\n\/\/ Draw any objects that we need to display in the scene\n\/\/ from the system.  (i.e. Gloves, etc)\nvoid BasicSimulator::drawObjects()\n{\n   \/\/ XXX: Not implemented\n}\n\n\/**\n * Draw the projections.\n *\n * @post Draws the projections.\n *       If withApex, then it draws the frustums with different colors.\n *       If !withApex, then just draws the surfaces in all white.\n *\/\nvoid BasicSimulator::drawProjections(const bool drawFrustum,\n                                     const gmtl::Vec3f& surfColor,\n                                     const float scaleFactor)\n{\n   const float ALPHA_VALUE(0.25f);\n\n   DisplayManager* display_man =\n      vrj::direct3d::DrawManager::instance()->getDisplayManager();\n   display_man->updateProjections(scaleFactor);                     \/\/ Update all projections for drawing\n\n   \/\/ XXX: Not implemented\n}\n\n\/**\n * Draws a simulator using OpenGL commands.\n * @note This is called internally by the library.\n *\/\nvoid BasicSimulator::drawSimulator(const float scaleFactor)\n{\n   \/\/ XXX: Not implemented\n}\n\n}\n\n}\n<commit_msg>Update the Direct3D Draw Manager for interface changes.<commit_after>\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2011 by Iowa State University\n *\n * Original Authors:\n *   Allen Bierbaum, Christopher Just,\n *   Patrick Hartling, Kevin Meinert,\n *   Carolina Cruz-Neira, Albert Baker\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., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301, USA.\n *\n *************** <auto-copyright.pl END do not edit this line> ***************\/\n\n#include <vrj\/Draw\/Direct3D\/Config.h>\n\n#include <gmtl\/Matrix.h>\n#include <gmtl\/Generate.h>\n#include <gmtl\/MatrixOps.h>\n#include <gmtl\/Vec.h>\n#include <gmtl\/VecOps.h>\n#include <gmtl\/Xforms.h>\n#include <gmtl\/Output.h>\n\n#include <jccl\/Config\/ConfigElement.h>\n\n#include <vrj\/Kernel\/User.h>\n\n#include <vrj\/Draw\/Direct3D\/DrawManager.h>\n\n#include <vrj\/Display\/DisplayManager.h>\n#include <vrj\/Display\/Display.h>\n#include <vrj\/Display\/Projection.h>\n#include <vrj\/Display\/Viewport.h>\n#include <vrj\/Display\/SimViewport.h>\n#include <vrj\/Display\/SurfaceViewport.h>\n\n#include <vrj\/Draw\/Direct3D\/SimInterfaceFactory.h>\n#include <vrj\/Draw\/Direct3D\/BasicSimulator.h>\n\n\nnamespace vrj\n{\n\nnamespace direct3d\n{\n\nVRJ_REGISTER_D3D_SIM_INTERFACE_CREATOR(BasicSimulator);\n\nBasicSimulator::BasicSimulator()\n{;}\n\nBasicSimulator::~BasicSimulator()\n{;}\n\n\/*\n* Configure the basic simulator config\n* @pre element is a valid configuration element.\n* @post It should be configured\n*\/\nbool BasicSimulator::config(jccl::ConfigElementPtr element)\n{\n   vprASSERT(element.get() != NULL);\n   vprASSERT(element->getID() == std::string(\"default_simulator\"));\n\n   std::string camera_proxy_str = element->getProperty<std::string>(\"camera_pos\");\n   std::string wand_proxy_str = element->getProperty<std::string>(\"wand_pos\");\n\n   mCamera.init(camera_proxy_str);\n   mWand.init(wand_proxy_str);      \/\/ Configure the wand to use\n\n   if(!mCamera.isConnected())\n   {\n      vprDEBUG(vprDBG_ERROR, vprDBG_CRITICAL_LVL)\n         << clrOutNORM(clrRED, \"ERROR:\")\n         << \"[vrj::direct3d::BasicSimulator::config()] Fatal Error: Camera \"\n         << \"not found named: \" << camera_proxy_str << vprDEBUG_FLUSH;\n      vprASSERT(false);\n   }\n\n   \/\/ Get drawing parameters\n   mDrawProjections = element->getProperty<bool>(\"draw_projections\");\n   mSurfaceColor[0] = element->getProperty<float>(\"surface_color\", 0);\n   mSurfaceColor[1] = element->getProperty<float>(\"surface_color\", 1);\n   mSurfaceColor[2] = element->getProperty<float>(\"surface_color\", 2);\n\n   return true;\n}\n\n\/**\n * Draws this sim device using the given information about the Window it\n * will be drawing into.\n *\/\nvoid BasicSimulator::draw(const float scaleFactor)\n{\n   drawSimulator(scaleFactor);\n}\n\n\/**\n * Sets the keyboard\/mouse device the simulator can use to get input from the\n * user.\n *\/\nvoid BasicSimulator::setKeyboardMouse(gadget::KeyboardMouseInterface)\n{\n}\n\nvoid BasicSimulator::updateProjectionData(const float positionScale,\n                                          ProjectionPtr leftProj,\n                                          ProjectionPtr rightProj)\n{\n   updateInternalData(positionScale);\n\n   gmtl::Matrix44f camera_pos = getCameraPos();\n   gmtl::Vec3f camera_trans = gmtl::makeTrans<gmtl::Vec3f>(camera_pos);\n\n   \/\/ -- Calculate camera (eye) Positions -- \/\/\n   vprDEBUG(vprDBG_ALL, vprDBG_HEX_LVL)\n      << \"[vrj::direct3d::BasicSimulator::updateProjectionData()] Getting \"\n      << \"camera position\" << std::endl << vprDEBUG_FLUSH;\n   vprDEBUG(vprDBG_ALL, vprDBG_HEX_LVL) << \"CamPos:\" << camera_trans\n                                        << std::endl << vprDEBUG_FLUSH;\n\n   \/\/ Compute location of left and right eyes\n   float interocular_dist = mSimViewport->getUser()->getInterocularDistance();\n   interocular_dist *= positionScale;               \/\/ Scale into correct units\n   float eye_offset = interocular_dist \/ 2.0f;      \/\/ Distance to move eye\n\n   gmtl::Matrix44f left_eye_pos, right_eye_pos;     \/\/ NOTE: Eye coord system is -z forward, x-right, y-up\n   left_eye_pos = camera_pos * gmtl::makeTrans<gmtl::Matrix44f>( gmtl::Vec3f(-eye_offset, 0.0f, 0.0f) );\n   right_eye_pos = camera_pos * gmtl::makeTrans<gmtl::Matrix44f>( gmtl::Vec3f(eye_offset, 0.0f, 0.0f) );\n\n   \/\/ NOTE: Eye coord system is -z forward, x-right, y-up\n   const gmtl::Point3f left_eye_pt(\n      gmtl::makeTrans<gmtl::Point3f>(left_eye_pos)\n   );\n   const gmtl::Point3f right_eye_pt(\n      gmtl::makeTrans<gmtl::Point3f>(right_eye_pos)\n   );\n   leftProj->calcViewMatrix(left_eye_pos, left_eye_pt, positionScale);\n   rightProj->calcViewMatrix(right_eye_pos, right_eye_pt, positionScale);\n}\n\n\/**  Update internal simulator data *\/\nvoid BasicSimulator::updateInternalData(float positionScale)\n{\n   mHeadPos = mSimViewport->getUser()->getHeadPosProxy()->getData(positionScale);\n   mWandPos = mWand->getData(positionScale);\n\n   mCameraPos = mCamera->getData(positionScale);\n   gmtl::invert(mCameraPos);\n}\n\n\/\/ Draw any objects that we need to display in the scene\n\/\/ from the system.  (i.e. Gloves, etc)\nvoid BasicSimulator::drawObjects()\n{\n   \/\/ XXX: Not implemented\n}\n\n\/**\n * Draw the projections.\n *\n * @post Draws the projections.\n *       If withApex, then it draws the frustums with different colors.\n *       If !withApex, then just draws the surfaces in all white.\n *\/\nvoid BasicSimulator::drawProjections(const bool drawFrustum,\n                                     const gmtl::Vec3f& surfColor,\n                                     const float scaleFactor)\n{\n   const float ALPHA_VALUE(0.25f);\n\n   DisplayManager* display_man =\n      vrj::direct3d::DrawManager::instance()->getDisplayManager();\n   display_man->updateProjections(scaleFactor);                     \/\/ Update all projections for drawing\n\n   \/\/ XXX: Not implemented\n}\n\n\/**\n * Draws a simulator using OpenGL commands.\n * @note This is called internally by the library.\n *\/\nvoid BasicSimulator::drawSimulator(const float scaleFactor)\n{\n   \/\/ XXX: Not implemented\n}\n\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*  -*- c++ -*-\n    kmservertest.cpp\n\n    This file is part of KMail, the KDE mail client.\n    Copyright (c) 2001-2002 Michael Haeckel <haeckel@kde.org>\n    Copyright (c) 2003 Marc Mutz <mutz@kde.org>\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 <config.h>\n\n#include \"kmservertest.h\"\n\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kdebug.h>\n#include <kurl.h>\n#include <kapplication.h>\n#include <kio\/scheduler.h>\n#include <kio\/slave.h>\n#include <kio\/job.h>\n#include <kio\/global.h>\n\n\/\/-----------------------------------------------------------------------------\nKMServerTest::KMServerTest( const QString & protocol, const QString & host, int port )\n  : QObject(),\n    mProtocol( protocol ), mHost( host ),\n    mSSL( false ), mJob( 0 ), mSlave( 0 ), mConnectionErrorCount( 0 )\n{\n  KIO::Scheduler::connect(\n    SIGNAL(slaveError(KIO::Slave *, int, const QString &)),\n    this, SLOT(slotSlaveResult(KIO::Slave *, int, const QString &)));\n\n  if ( port == 993 || port == 995 || port == 465 )\n    port = 0;\n\n  startOffSlave( port );\n}\n\n\/\/-----------------------------------------------------------------------------\nKMServerTest::~KMServerTest()\n{\n  if (mJob) mJob->kill(TRUE);\n}\n\n\nKIO::MetaData KMServerTest::slaveConfig() const {\n  KIO::MetaData md;\n  md.insert( \"nologin\", \"on\" );\n  return md;\n}\n\nvoid KMServerTest::startOffSlave( int port ) {\n  KURL url;\n  url.setProtocol( mSSL ? mProtocol + 's' : mProtocol );\n  url.setHost( mHost );\n  if ( port )\n    url.setPort( port );\n\n  mSlave = KIO::Scheduler::getConnectedSlave( url, slaveConfig() );\n  if ( !mSlave ) {\n    slotSlaveResult( 0, 1 );\n    return;\n  }\n  connect( mSlave, SIGNAL(metaData(const KIO::MetaData&)),\n\t   SLOT(slotMetaData(const KIO::MetaData&)) );\n\n  QByteArray packedArgs;\n  QDataStream stream( packedArgs, IO_WriteOnly );\n\n  stream << (int) 'c';\n\n  mJob = KIO::special( url, packedArgs, false );\n  KIO::Scheduler::assignJobToSlave( mSlave, mJob );\n  connect( mJob, SIGNAL(result(KIO::Job*)), SLOT(slotResult(KIO::Job*)) );\n  connect( mJob, SIGNAL(infoMessage(KIO::Job*,const QString&)),\n\t   SLOT(slotData(KIO::Job*,const QString&)) );\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMServerTest::slotData(KIO::Job *, const QString &data)\n{\n  if ( mSSL )\n    mListSSL = QStringList::split(' ', data);\n  else\n    mListNormal = QStringList::split(' ', data);\n}\n\n\nvoid KMServerTest::slotMetaData( const KIO::MetaData & md ) {\n  KIO::MetaData::const_iterator it = md.find( \"PLAIN AUTH METHODS\" );\n  if ( it != md.end() ) {\n    mAuthNone = it.data();\n    kdDebug(5006) << \"mAuthNone: \" << mAuthNone << endl;\n  }\n  it = md.find( \"TLS AUTH METHODS\" );\n  if ( it != md.end() ) {\n    mAuthTLS = it.data();\n    kdDebug(5006) << \"mAuthTLS: \" << mAuthTLS << endl;\n  }\n  it = md.find( \"SSL AUTH METHODS\" );\n  if ( it != md.end() ) {\n    mAuthSSL = it.data();\n    kdDebug(5006) << \"mAuthSSL: \" << mAuthSSL << endl;\n  }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMServerTest::slotResult(KIO::Job *job)\n{\n  slotSlaveResult(mSlave, job->error());\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMServerTest::slotSlaveResult(KIO::Slave *aSlave, int error,\n  const QString &errorText)\n{\n  if (aSlave != mSlave) return;\n  if (error != KIO::ERR_SLAVE_DIED && mSlave)\n  {\n    \/\/ disconnect slave after every connect\n    KIO::Scheduler::disconnectSlave(mSlave);\n    mSlave = 0;\n  }\n  if ( error == KIO::ERR_COULD_NOT_CONNECT )\n  {\n    \/\/ if one of the two connection tests fails we ignore the error\n    \/\/ if both fail the host is probably not correct so we display the error\n    if ( mConnectionErrorCount == 0 )\n    {\n      error = 0;\n    }\n    ++mConnectionErrorCount;\n  }\n  if ( error )\n  {\n    mJob = 0;\n    KMessageBox::error( kapp->activeWindow(), \n        KIO::buildErrorString( error, errorText ),\n        i18n(\"Error\") );\n    emit capabilities( mListNormal, mListSSL );\n    emit capabilities( mListNormal, mListSSL, mAuthNone, mAuthSSL, mAuthTLS );\n    return;\n  }\n  if (!mSSL) {\n    mSSL = true;\n    mListNormal.append(\"NORMAL-CONNECTION\");\n    startOffSlave();\n  } else {\n    \/\/mListSSL.append(\"SSL\");\n    mJob = 0;\n\n    emit capabilities( mListNormal, mListSSL );\n    emit capabilities( mListNormal, mListSSL, mAuthNone, mAuthSSL, mAuthTLS );\n  }\n}\n\n\n#include \"kmservertest.moc\"\n<commit_msg>The dummy entry is needed because the server might respond with an empty string to the CAPA command although SSL (without additional capabilities) works. Since we check for the stringlist being empty to find out whether SSL is supported the stringlist must only be empty if SSL is not supported.<commit_after>\/*  -*- c++ -*-\n    kmservertest.cpp\n\n    This file is part of KMail, the KDE mail client.\n    Copyright (c) 2001-2002 Michael Haeckel <haeckel@kde.org>\n    Copyright (c) 2003 Marc Mutz <mutz@kde.org>\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 <config.h>\n\n#include \"kmservertest.h\"\n\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kdebug.h>\n#include <kurl.h>\n#include <kapplication.h>\n#include <kio\/scheduler.h>\n#include <kio\/slave.h>\n#include <kio\/job.h>\n#include <kio\/global.h>\n\n\/\/-----------------------------------------------------------------------------\nKMServerTest::KMServerTest( const QString & protocol, const QString & host, int port )\n  : QObject(),\n    mProtocol( protocol ), mHost( host ),\n    mSSL( false ), mJob( 0 ), mSlave( 0 ), mConnectionErrorCount( 0 )\n{\n  KIO::Scheduler::connect(\n    SIGNAL(slaveError(KIO::Slave *, int, const QString &)),\n    this, SLOT(slotSlaveResult(KIO::Slave *, int, const QString &)));\n\n  if ( port == 993 || port == 995 || port == 465 )\n    port = 0;\n\n  startOffSlave( port );\n}\n\n\/\/-----------------------------------------------------------------------------\nKMServerTest::~KMServerTest()\n{\n  if (mJob) mJob->kill(TRUE);\n}\n\n\nKIO::MetaData KMServerTest::slaveConfig() const {\n  KIO::MetaData md;\n  md.insert( \"nologin\", \"on\" );\n  return md;\n}\n\nvoid KMServerTest::startOffSlave( int port ) {\n  KURL url;\n  url.setProtocol( mSSL ? mProtocol + 's' : mProtocol );\n  url.setHost( mHost );\n  if ( port )\n    url.setPort( port );\n\n  mSlave = KIO::Scheduler::getConnectedSlave( url, slaveConfig() );\n  if ( !mSlave ) {\n    slotSlaveResult( 0, 1 );\n    return;\n  }\n  connect( mSlave, SIGNAL(metaData(const KIO::MetaData&)),\n\t   SLOT(slotMetaData(const KIO::MetaData&)) );\n\n  QByteArray packedArgs;\n  QDataStream stream( packedArgs, IO_WriteOnly );\n\n  stream << (int) 'c';\n\n  mJob = KIO::special( url, packedArgs, false );\n  KIO::Scheduler::assignJobToSlave( mSlave, mJob );\n  connect( mJob, SIGNAL(result(KIO::Job*)), SLOT(slotResult(KIO::Job*)) );\n  connect( mJob, SIGNAL(infoMessage(KIO::Job*,const QString&)),\n\t   SLOT(slotData(KIO::Job*,const QString&)) );\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMServerTest::slotData(KIO::Job *, const QString &data)\n{\n  if ( mSSL )\n    mListSSL = QStringList::split(' ', data);\n  else\n    mListNormal = QStringList::split(' ', data);\n}\n\n\nvoid KMServerTest::slotMetaData( const KIO::MetaData & md ) {\n  KIO::MetaData::const_iterator it = md.find( \"PLAIN AUTH METHODS\" );\n  if ( it != md.end() ) {\n    mAuthNone = it.data();\n    kdDebug(5006) << \"mAuthNone: \" << mAuthNone << endl;\n  }\n  it = md.find( \"TLS AUTH METHODS\" );\n  if ( it != md.end() ) {\n    mAuthTLS = it.data();\n    kdDebug(5006) << \"mAuthTLS: \" << mAuthTLS << endl;\n  }\n  it = md.find( \"SSL AUTH METHODS\" );\n  if ( it != md.end() ) {\n    mAuthSSL = it.data();\n    kdDebug(5006) << \"mAuthSSL: \" << mAuthSSL << endl;\n  }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMServerTest::slotResult(KIO::Job *job)\n{\n  slotSlaveResult(mSlave, job->error());\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMServerTest::slotSlaveResult(KIO::Slave *aSlave, int error,\n  const QString &errorText)\n{\n  if (aSlave != mSlave) return;\n  if ( mSSL && error == 0 ) {\n    \/\/ add a dummy entry to the list of SSL capabilities so that the receiver\n    \/\/ of the capabilities signal can use mListSSL.isEmpty() in order to find\n    \/\/ out whether SSL is supported\n    mListSSL.append(\"SSL\");\n  }\n\n  if (error != KIO::ERR_SLAVE_DIED && mSlave)\n  {\n    \/\/ disconnect slave after every connect\n    KIO::Scheduler::disconnectSlave(mSlave);\n    mSlave = 0;\n  }\n  if ( error == KIO::ERR_COULD_NOT_CONNECT )\n  {\n    \/\/ if one of the two connection tests fails we ignore the error\n    \/\/ if both fail the host is probably not correct so we display the error\n    if ( mConnectionErrorCount == 0 )\n    {\n      error = 0;\n    }\n    ++mConnectionErrorCount;\n  }\n  if ( error )\n  {\n    mJob = 0;\n    KMessageBox::error( kapp->activeWindow(),\n        KIO::buildErrorString( error, errorText ),\n        i18n(\"Error\") );\n    emit capabilities( mListNormal, mListSSL );\n    emit capabilities( mListNormal, mListSSL, mAuthNone, mAuthSSL, mAuthTLS );\n    return;\n  }\n  if (!mSSL) {\n    mSSL = true;\n    mListNormal.append(\"NORMAL-CONNECTION\");\n    startOffSlave();\n  } else {\n    mJob = 0;\n\n    emit capabilities( mListNormal, mListSSL );\n    emit capabilities( mListNormal, mListSSL, mAuthNone, mAuthSSL, mAuthTLS );\n  }\n}\n\n\n#include \"kmservertest.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n                          kmsystemtray.cpp  -  description\n                             -------------------\n    begin                : Fri Aug 31 22:38:44 EDT 2001\n    copyright            : (C) 2001 by Ryan Breen\n    email                : ryan@porivo.com\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#ifdef HAVE_CONFIG_H\n  #include <config.h>\n#endif\n\n#include <kapp.h>\n#include <kpopupmenu.h>\n#include <kdebug.h>\n#include <kiconloader.h>\n#include <kwin.h>\n\n#include <qevent.h>\n#include <qfontmetrics.h>\n#include <qlistview.h>\n#include <qstring.h>\n#include <qtooltip.h>\n#include <qlabel.h>\n#include <qwidgetlist.h>\n\n#include <kglobalsettings.h>\n#include <kiconeffect.h>\n#include <qpainter.h>\n\n#include <math.h>\n\n#include \"kaction.h\"\n#include \"kmmainwidget.h\"\n#include \"kmsystemtray.h\"\n#include \"kmfolder.h\"\n#include \"kmfoldertree.h\"\n#include \"kmkernel.h\"\n#include \"kmfoldermgr.h\"\n#include \"kmfolderimap.h\"\n#include \"kmmainwidget.h\"\n\n\/**\n * Construct a KSystemTray icon to be displayed when new mail\n * has arrived in a non-system folder.  The KMSystemTray listens\n * for updateNewMessageNotification events from each non-system\n * KMFolder and maintains a store of all folders with unread\n * messages.\n *\n * The KMSystemTray also provides a popup menu listing each folder\n * with its count of unread messages, allowing the user to jump\n * to the first unread message in each folder.\n *\/\nKMSystemTray::KMSystemTray(QWidget *parent, const char *name) : KSystemTray(parent, name),\nmNewMessagePopupId(-1), mPopupMenu(0)\n{\n  setAlignment( AlignCenter );\n  kdDebug(5006) << \"Initting systray\" << endl;\n\n  mDefaultIcon = SmallIcon( \"kmail\" );\n  mTransparentIcon = SmallIcon( \"kmail\" );\n  KIconEffect::semiTransparent( mTransparentIcon );\n\n  setPixmap(mDefaultIcon);\n  mParentVisible = true;\n  mMode = OnNewMail;\n\n  \/** Initiate connections between folders and this object *\/\n  foldersChanged();\n\n  connect( kernel->folderMgr(), SIGNAL(changed()), SLOT(foldersChanged()));\n  connect( kernel->imapFolderMgr(), SIGNAL(changed()), SLOT(foldersChanged()));\n  connect( kernel->searchFolderMgr(), SIGNAL(changed()), SLOT(foldersChanged()));\n}\n\nvoid KMSystemTray::buildPopupMenu()\n{\n  \/\/ Delete any previously created popup menu\n  delete mPopupMenu;\n  mPopupMenu = 0;\n  \n  mPopupMenu = new KPopupMenu();\n  if (!getKMMainWidget())\n    return;\n\n  mPopupMenu->insertTitle(*(this->pixmap()), \"KMail\");\n  getKMMainWidget()->action(\"check_mail\")->plug(mPopupMenu);\n  getKMMainWidget()->action(\"check_mail_in\")->plug(mPopupMenu);\n  mPopupMenu->insertSeparator();\n  getKMMainWidget()->action(\"new_message\")->plug(mPopupMenu);\n  getKMMainWidget()->action(\"kmail_configure_kmail\")->plug(mPopupMenu);\n  mPopupMenu->insertSeparator();\n  getKMMainWidget()->action(\"file_quit\")->plug(mPopupMenu);\n}\n\nKMSystemTray::~KMSystemTray()\n{\n  delete mPopupMenu;\n  mPopupMenu = 0;\n}\n\nvoid KMSystemTray::setMode(int newMode)\n{\n  if(newMode == mMode) return;\n\n  kdDebug(5006) << \"Setting systray mMode to \" << newMode << endl;\n  mMode = newMode;\n\n  if(mMode == AlwaysOn)\n  {\n    kdDebug(5006) << \"Initting alwayson mMode\" << endl;\n\n    if(isHidden()) show();\n  } else\n  {\n    if(mCount == 0)\n    {\n      hide();\n    }\n  }\n}\n\n\/**\n * Update the count of unread messages.  If there are unread messages,\n * overlay the count on top of a transparent version of the KMail icon.\n * If there is no unread mail, restore the normal KMail icon.\n *\/\nvoid KMSystemTray::updateCount()\n{\n  if(mCount != 0)\n  {\n\n    int oldPixmapWidth = pixmap()->size().width();\n    int oldPixmapHeight = pixmap()->size().height();\n\n    \/** Scale the font size down with each increase in the number\n     * of digits in the count, to a minimum point size of 6 *\/\n    int numDigits = ((int) log10((double) mCount) + 1);\n    QFont countFont = KGlobalSettings::generalFont();\n    countFont.setBold(true);\n\n    int countFontSize = countFont.pointSize();\n    while(countFontSize > 5)\n    {\n      QFontMetrics qfm( countFont );\n      int fontWidth = qfm.width( QChar( '0' ) );\n      if((fontWidth * numDigits) > oldPixmapWidth)\n      {\n        --countFontSize;\n        countFont.setPointSize(countFontSize);\n      } else break;\n    }\n\n    QPixmap bg(oldPixmapWidth, oldPixmapHeight);\n    bg.fill(this, 0, 0);\n\n    \/** Overlay count on transparent icon *\/\n    QPainter p(&bg);\n    p.drawPixmap(0, 0, mTransparentIcon);\n    p.setFont(countFont);\n    p.setPen(Qt::blue);\n    p.drawText(pixmap()->rect(), Qt::AlignCenter, QString::number(mCount));\n\n    setPixmap(bg);\n  } else\n  {\n    setPixmap(mDefaultIcon);\n  }\n}\n\n\/**\n * Refreshes the list of folders we are monitoring.  This is called on\n * startup and is also connected to the 'changed' signal on the KMFolderMgr.\n *\/\nvoid KMSystemTray::foldersChanged()\n{\n  \/**\n   * Hide and remove all unread mappings to cover the case where the only\n   * unread message was in a folder that was just removed.\n   *\/\n  mFoldersWithUnread.clear();\n  mCount = 0;\n\n  if(mMode == OnNewMail)\n  {\n    hide();\n  }\n\n  \/** Disconnect all previous connections *\/\n  disconnect(this, SLOT(updateNewMessageNotification(KMFolder *)));\n\n  QStringList folderNames;\n  QValueList<QGuardedPtr<KMFolder> > folderList;\n  kernel->folderMgr()->createFolderList(&folderNames, &folderList);\n  kernel->imapFolderMgr()->createFolderList(&folderNames, &folderList);\n  kernel->searchFolderMgr()->createFolderList(&folderNames, &folderList);\n\n  QStringList::iterator strIt = folderNames.begin();\n\n  for(QValueList<QGuardedPtr<KMFolder> >::iterator it = folderList.begin();\n     it != folderList.end() && strIt != folderNames.end(); ++it, ++strIt)\n  {\n    KMFolder * currentFolder = *it;\n    QString currentName = *strIt;\n\n    if((!currentFolder->isSystemFolder() || (currentFolder->name().lower() == \"inbox\")) ||\n       (currentFolder->protocol() == \"imap\"))\n    {\n      \/** If this is a new folder, start listening for messages *\/\n      connect(currentFolder, SIGNAL(numUnreadMsgsChanged(KMFolder *)),\n              this, SLOT(updateNewMessageNotification(KMFolder *)));\n\n      \/** Check all new folders to see if we started with any new messages *\/\n      updateNewMessageNotification(currentFolder);\n    }\n  }\n}\n\n\/**\n * On left mouse click, switch focus to the first KMMainWidget.  On right \n * click, bring up a list of all folders with a count of unread messages.\n *\/\nvoid KMSystemTray::mousePressEvent(QMouseEvent *e)\n{\n  \/\/ switch to kmail on left mouse button\n  if( e->button() == LeftButton )\n  {\n    if( mParentVisible )\n      hideKMail();\n    else\n      showKMail();\n  }\n\n  \/\/ open popup menu on right mouse button\n  if( e->button() == RightButton )\n  {\n    mPopupFolders.clear();\n    mPopupFolders.resize(mFoldersWithUnread.count());\n\n    \/\/ Rebuild popup menu at click time to minimize race condition if\n    \/\/ the base KMainWidget is closed.\n    buildPopupMenu();\n\n    if(mNewMessagePopupId != -1)\n    {\n      mPopupMenu->removeItem(mNewMessagePopupId);\n    }\n\n    if(mFoldersWithUnread.count() > 0)\n    {\n      KPopupMenu *newMessagesPopup = new KPopupMenu();\n\n      QMap<QGuardedPtr<KMFolder>, int>::Iterator it = mFoldersWithUnread.begin();\n      for(uint i=0; it != mFoldersWithUnread.end(); ++i)\n      {\n        kdDebug(5006) << \"Adding folder\" << endl;\n        if(i > mPopupFolders.size()) mPopupFolders.resize(i * 2);\n        mPopupFolders.insert(i, it.key());\n        QString item = prettyName(it.key()) + \"(\" + QString::number(it.data()) + \")\";\n        newMessagesPopup->insertItem(item, this, SLOT(selectedAccount(int)), 0, i);\n        ++it;\n      }\n\n      mNewMessagePopupId = mPopupMenu->insertItem(i18n(\"New messages in...\"),\n                                                  newMessagesPopup, mNewMessagePopupId, 3);\n\n      kdDebug(5006) << \"Folders added\" << endl;\n    }\n\n    mPopupMenu->popup(e->globalPos());\n  }\n\n}\n\n\/**\n * Return the name of the folder in which the mail is deposited, prepended\n * with the account name if the folder is IMAP.\n *\/\nQString KMSystemTray::prettyName(KMFolder * fldr)\n{\n  QString rvalue = fldr->label();\n  if(fldr->protocol() == \"imap\")\n  {\n    KMFolderImap * imap = dynamic_cast<KMFolderImap*> (fldr);\n    assert(imap);\n\n    if((imap->account() != 0) &&\n       (imap->account()->name() != 0) )\n    {\n      kdDebug(5006) << \"IMAP folder, prepend label with type\" << endl;\n      rvalue = imap->account()->name() + \"->\" + rvalue;\n    }\n  }\n\n  kdDebug(5006) << \"Got label \" << rvalue << endl;\n\n  return rvalue;\n}\n\n\/**\n * Shows and raises the first KMMainWidget and\n * switches to the appropriate virtual desktop.\n *\/\nvoid KMSystemTray::showKMail()\n{\n  if (!getKMMainWidget())\n    return;\n  QWidget *mainWin = getKMMainWidget()->topLevelWidget();\n  assert(mainWin);\n  if(mainWin)\n  {\n    \/** Force window to grab focus *\/\n    mainWin->show();\n    mainWin->raise();\n    mParentVisible = true;\n    \/** Switch to appropriate desktop *\/\n    int desk = KWin::info(mainWin->winId()).desktop;\n    KWin::setCurrentDesktop(desk);\n  }\n}\n\nvoid KMSystemTray::hideKMail()\n{\n  if (!getKMMainWidget())\n    return;\n  QWidget *mainWin = getKMMainWidget()->topLevelWidget();\n  assert(mainWin);\n  if(mainWin)\n  {\n    mainWin->hide();\n    mParentVisible = false;\n  }\n}\n\n\/**\n * Grab a pointer to the first KMMainWidget.\n *\/\nKMMainWidget * KMSystemTray::getKMMainWidget()\n{\n  QWidgetList *l = kapp->topLevelWidgets();\n  QWidgetListIt it( *l );\n  QWidget *wid;\n\n  while ( (wid = it.current()) != 0 ) {\n    ++it;\n    QObjectList *l2 = wid->topLevelWidget()->queryList(\"KMMainWidget\");\n    if (l2->first())\n      return dynamic_cast<KMMainWidget *>(l2->first());\n  }\t\n  return 0;\n}\n\n\/**\n * Called on startup of the KMSystemTray and when the numUnreadMsgsChanged signal\n * is emitted for one of the watched folders.  Shows the system tray icon if there\n * are new messages and the icon was hidden, or hides the system tray icon if there\n * are no more new messages.\n *\/\nvoid KMSystemTray::updateNewMessageNotification(KMFolder * fldr)\n{\n\n  if(!fldr)\n  {\n    kdDebug(5006) << \"Null folder, can't mess with that\" << endl;\n    return;\n  }\n\n  \/** The number of unread messages in that folder *\/\n  int unread = fldr->countUnread();\n\n  QMap<QGuardedPtr<KMFolder>, int>::Iterator it =\n  mFoldersWithUnread.find(fldr);\n  bool unmapped = (it == mFoldersWithUnread.end());\n\n  \/** If the folder is not mapped yet, increment count by numUnread\n      in folder *\/\n  if(unmapped) mCount += unread;\n  \/* Otherwise, get the difference between the numUnread in the folder and\n   * our last known version, and adjust mCount with that difference *\/\n  else\n  {\n    int diff = unread - it.data();\n    mCount += diff;\n  }\n\n  if(unread > 0)\n  {\n    \/** Add folder to our internal store, or update unread count if already mapped *\/\n    mFoldersWithUnread.insert(fldr, unread);\n    kdDebug(5006) << \"There are now \" << mFoldersWithUnread.count() << \" folders with unread\" << endl;\n  }\n\n  \/**\n   * Look for folder in the list of folders already represented.  If there are\n   * unread messages and the system tray icon is hidden, show it.  If there are\n   * no unread messages, remove the folder from the mapping.\n   *\/\n  if(unmapped)\n  {\n    \/** Spurious notification, ignore *\/\n    if(unread == 0) return;\n\n    \/** Make sure the icon will be displayed *\/\n    if(mMode == OnNewMail)\n    {\n      if(isHidden()) show();\n    }\n\n  } else\n  {\n\n    if(unread == 0)\n    {\n      kdDebug(5006) << \"Removing folder \" << fldr->name() << endl;\n\n      \/** Remove the folder from the internal store *\/\n      mFoldersWithUnread.remove(fldr);\n\n      \/** if this was the last folder in the dictionary, hide the systemtray icon *\/\n      if(mFoldersWithUnread.count() == 0)\n      {\n        mPopupFolders.clear();\n        disconnect(this, SLOT(selectedAccount(int)));\n\n        mCount = 0;\n\n        if(mMode == OnNewMail)\n          hide();\n      }\n    }\n  }\n\n  updateCount();\n\n  \/** Update tooltip to reflect count of unread messages *\/\n  QToolTip::add(this, i18n(\"There is 1 unread message.\",\n                           \"There are %n unread messages.\",\n                           mCount));\n}\n\n\/**\n * Called when user selects a folder name from the popup menu.  Shows\n * the first KMMainWin in the memberlist and jumps to the first unread\n * message in the selected folder.\n *\/\nvoid KMSystemTray::selectedAccount(int id)\n{\n  showKMail();\n\n  KMMainWidget * mainWidget = getKMMainWidget();\n  assert(mainWidget);\n\n  \/** Select folder *\/\n  KMFolder * fldr = mPopupFolders.at(id);\n  if(!fldr) return;\n  KMFolderTree * ft = mainWidget->folderTree();\n  if(!ft) return;\n  QListViewItem * fldrIdx = ft->indexOfFolder(fldr);\n  if(!fldrIdx) return;\n\n  ft->setCurrentItem(fldrIdx);\n  ft->selectCurrentFolder();\n  mainWidget->folderSelectedUnread(fldr);\n}\n\n\n#include \"kmsystemtray.moc\"\n<commit_msg>*slap*<commit_after>\/***************************************************************************\n                          kmsystemtray.cpp  -  description\n                             -------------------\n    begin                : Fri Aug 31 22:38:44 EDT 2001\n    copyright            : (C) 2001 by Ryan Breen\n    email                : ryan@porivo.com\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#ifdef HAVE_CONFIG_H\n  #include <config.h>\n#endif\n\n#include <kapp.h>\n#include <kpopupmenu.h>\n#include <kdebug.h>\n#include <kiconloader.h>\n#include <kwin.h>\n\n#include <qevent.h>\n#include <qfontmetrics.h>\n#include <qlistview.h>\n#include <qstring.h>\n#include <qtooltip.h>\n#include <qlabel.h>\n#include <qwidgetlist.h>\n\n#include <kglobalsettings.h>\n#include <kiconeffect.h>\n#include <qpainter.h>\n\n#include <math.h>\n\n#include \"kaction.h\"\n#include \"kmmainwidget.h\"\n#include \"kmsystemtray.h\"\n#include \"kmfolder.h\"\n#include \"kmfoldertree.h\"\n#include \"kmkernel.h\"\n#include \"kmfoldermgr.h\"\n#include \"kmfolderimap.h\"\n#include \"kmmainwidget.h\"\n\n\/**\n * Construct a KSystemTray icon to be displayed when new mail\n * has arrived in a non-system folder.  The KMSystemTray listens\n * for updateNewMessageNotification events from each non-system\n * KMFolder and maintains a store of all folders with unread\n * messages.\n *\n * The KMSystemTray also provides a popup menu listing each folder\n * with its count of unread messages, allowing the user to jump\n * to the first unread message in each folder.\n *\/\nKMSystemTray::KMSystemTray(QWidget *parent, const char *name) : KSystemTray(parent, name),\nmNewMessagePopupId(-1), mPopupMenu(0)\n{\n  setAlignment( AlignCenter );\n  kdDebug(5006) << \"Initting systray\" << endl;\n\n  mDefaultIcon = SmallIcon( \"kmail\" );\n  mTransparentIcon = SmallIcon( \"kmail\" );\n  KIconEffect::semiTransparent( mTransparentIcon );\n\n  setPixmap(mDefaultIcon);\n  mParentVisible = true;\n  mMode = OnNewMail;\n\n  \/** Initiate connections between folders and this object *\/\n  foldersChanged();\n\n  connect( kernel->folderMgr(), SIGNAL(changed()), SLOT(foldersChanged()));\n  connect( kernel->imapFolderMgr(), SIGNAL(changed()), SLOT(foldersChanged()));\n  connect( kernel->searchFolderMgr(), SIGNAL(changed()), SLOT(foldersChanged()));\n}\n\nvoid KMSystemTray::buildPopupMenu()\n{\n  \/\/ Delete any previously created popup menu\n  delete mPopupMenu;\n  mPopupMenu = 0;\n  \n  mPopupMenu = new KPopupMenu();\n  if (!getKMMainWidget())\n    return;\n\n  mPopupMenu->insertTitle(*(this->pixmap()), \"KMail\");\n  getKMMainWidget()->action(\"check_mail\")->plug(mPopupMenu);\n  getKMMainWidget()->action(\"check_mail_in\")->plug(mPopupMenu);\n  mPopupMenu->insertSeparator();\n  getKMMainWidget()->action(\"new_message\")->plug(mPopupMenu);\n  getKMMainWidget()->action(\"kmail_configure_kmail\")->plug(mPopupMenu);\n  mPopupMenu->insertSeparator();\n  if (getKMMainWidget()->action(\"file_quit\"))\n    getKMMainWidget()->action(\"file_quit\")->plug(mPopupMenu);\n}\n\nKMSystemTray::~KMSystemTray()\n{\n  delete mPopupMenu;\n  mPopupMenu = 0;\n}\n\nvoid KMSystemTray::setMode(int newMode)\n{\n  if(newMode == mMode) return;\n\n  kdDebug(5006) << \"Setting systray mMode to \" << newMode << endl;\n  mMode = newMode;\n\n  if(mMode == AlwaysOn)\n  {\n    kdDebug(5006) << \"Initting alwayson mMode\" << endl;\n\n    if(isHidden()) show();\n  } else\n  {\n    if(mCount == 0)\n    {\n      hide();\n    }\n  }\n}\n\n\/**\n * Update the count of unread messages.  If there are unread messages,\n * overlay the count on top of a transparent version of the KMail icon.\n * If there is no unread mail, restore the normal KMail icon.\n *\/\nvoid KMSystemTray::updateCount()\n{\n  if(mCount != 0)\n  {\n\n    int oldPixmapWidth = pixmap()->size().width();\n    int oldPixmapHeight = pixmap()->size().height();\n\n    \/** Scale the font size down with each increase in the number\n     * of digits in the count, to a minimum point size of 6 *\/\n    int numDigits = ((int) log10((double) mCount) + 1);\n    QFont countFont = KGlobalSettings::generalFont();\n    countFont.setBold(true);\n\n    int countFontSize = countFont.pointSize();\n    while(countFontSize > 5)\n    {\n      QFontMetrics qfm( countFont );\n      int fontWidth = qfm.width( QChar( '0' ) );\n      if((fontWidth * numDigits) > oldPixmapWidth)\n      {\n        --countFontSize;\n        countFont.setPointSize(countFontSize);\n      } else break;\n    }\n\n    QPixmap bg(oldPixmapWidth, oldPixmapHeight);\n    bg.fill(this, 0, 0);\n\n    \/** Overlay count on transparent icon *\/\n    QPainter p(&bg);\n    p.drawPixmap(0, 0, mTransparentIcon);\n    p.setFont(countFont);\n    p.setPen(Qt::blue);\n    p.drawText(pixmap()->rect(), Qt::AlignCenter, QString::number(mCount));\n\n    setPixmap(bg);\n  } else\n  {\n    setPixmap(mDefaultIcon);\n  }\n}\n\n\/**\n * Refreshes the list of folders we are monitoring.  This is called on\n * startup and is also connected to the 'changed' signal on the KMFolderMgr.\n *\/\nvoid KMSystemTray::foldersChanged()\n{\n  \/**\n   * Hide and remove all unread mappings to cover the case where the only\n   * unread message was in a folder that was just removed.\n   *\/\n  mFoldersWithUnread.clear();\n  mCount = 0;\n\n  if(mMode == OnNewMail)\n  {\n    hide();\n  }\n\n  \/** Disconnect all previous connections *\/\n  disconnect(this, SLOT(updateNewMessageNotification(KMFolder *)));\n\n  QStringList folderNames;\n  QValueList<QGuardedPtr<KMFolder> > folderList;\n  kernel->folderMgr()->createFolderList(&folderNames, &folderList);\n  kernel->imapFolderMgr()->createFolderList(&folderNames, &folderList);\n  kernel->searchFolderMgr()->createFolderList(&folderNames, &folderList);\n\n  QStringList::iterator strIt = folderNames.begin();\n\n  for(QValueList<QGuardedPtr<KMFolder> >::iterator it = folderList.begin();\n     it != folderList.end() && strIt != folderNames.end(); ++it, ++strIt)\n  {\n    KMFolder * currentFolder = *it;\n    QString currentName = *strIt;\n\n    if((!currentFolder->isSystemFolder() || (currentFolder->name().lower() == \"inbox\")) ||\n       (currentFolder->protocol() == \"imap\"))\n    {\n      \/** If this is a new folder, start listening for messages *\/\n      connect(currentFolder, SIGNAL(numUnreadMsgsChanged(KMFolder *)),\n              this, SLOT(updateNewMessageNotification(KMFolder *)));\n\n      \/** Check all new folders to see if we started with any new messages *\/\n      updateNewMessageNotification(currentFolder);\n    }\n  }\n}\n\n\/**\n * On left mouse click, switch focus to the first KMMainWidget.  On right \n * click, bring up a list of all folders with a count of unread messages.\n *\/\nvoid KMSystemTray::mousePressEvent(QMouseEvent *e)\n{\n  \/\/ switch to kmail on left mouse button\n  if( e->button() == LeftButton )\n  {\n    if( mParentVisible )\n      hideKMail();\n    else\n      showKMail();\n  }\n\n  \/\/ open popup menu on right mouse button\n  if( e->button() == RightButton )\n  {\n    mPopupFolders.clear();\n    mPopupFolders.resize(mFoldersWithUnread.count());\n\n    \/\/ Rebuild popup menu at click time to minimize race condition if\n    \/\/ the base KMainWidget is closed.\n    buildPopupMenu();\n\n    if(mNewMessagePopupId != -1)\n    {\n      mPopupMenu->removeItem(mNewMessagePopupId);\n    }\n\n    if(mFoldersWithUnread.count() > 0)\n    {\n      KPopupMenu *newMessagesPopup = new KPopupMenu();\n\n      QMap<QGuardedPtr<KMFolder>, int>::Iterator it = mFoldersWithUnread.begin();\n      for(uint i=0; it != mFoldersWithUnread.end(); ++i)\n      {\n        kdDebug(5006) << \"Adding folder\" << endl;\n        if(i > mPopupFolders.size()) mPopupFolders.resize(i * 2);\n        mPopupFolders.insert(i, it.key());\n        QString item = prettyName(it.key()) + \"(\" + QString::number(it.data()) + \")\";\n        newMessagesPopup->insertItem(item, this, SLOT(selectedAccount(int)), 0, i);\n        ++it;\n      }\n\n      mNewMessagePopupId = mPopupMenu->insertItem(i18n(\"New messages in...\"),\n                                                  newMessagesPopup, mNewMessagePopupId, 3);\n\n      kdDebug(5006) << \"Folders added\" << endl;\n    }\n\n    mPopupMenu->popup(e->globalPos());\n  }\n\n}\n\n\/**\n * Return the name of the folder in which the mail is deposited, prepended\n * with the account name if the folder is IMAP.\n *\/\nQString KMSystemTray::prettyName(KMFolder * fldr)\n{\n  QString rvalue = fldr->label();\n  if(fldr->protocol() == \"imap\")\n  {\n    KMFolderImap * imap = dynamic_cast<KMFolderImap*> (fldr);\n    assert(imap);\n\n    if((imap->account() != 0) &&\n       (imap->account()->name() != 0) )\n    {\n      kdDebug(5006) << \"IMAP folder, prepend label with type\" << endl;\n      rvalue = imap->account()->name() + \"->\" + rvalue;\n    }\n  }\n\n  kdDebug(5006) << \"Got label \" << rvalue << endl;\n\n  return rvalue;\n}\n\n\/**\n * Shows and raises the first KMMainWidget and\n * switches to the appropriate virtual desktop.\n *\/\nvoid KMSystemTray::showKMail()\n{\n  if (!getKMMainWidget())\n    return;\n  QWidget *mainWin = getKMMainWidget()->topLevelWidget();\n  assert(mainWin);\n  if(mainWin)\n  {\n    \/** Force window to grab focus *\/\n    mainWin->show();\n    mainWin->raise();\n    mParentVisible = true;\n    \/** Switch to appropriate desktop *\/\n    int desk = KWin::info(mainWin->winId()).desktop;\n    KWin::setCurrentDesktop(desk);\n  }\n}\n\nvoid KMSystemTray::hideKMail()\n{\n  if (!getKMMainWidget())\n    return;\n  QWidget *mainWin = getKMMainWidget()->topLevelWidget();\n  assert(mainWin);\n  if(mainWin)\n  {\n    mainWin->hide();\n    mParentVisible = false;\n  }\n}\n\n\/**\n * Grab a pointer to the first KMMainWidget.\n *\/\nKMMainWidget * KMSystemTray::getKMMainWidget()\n{\n  QWidgetList *l = kapp->topLevelWidgets();\n  QWidgetListIt it( *l );\n  QWidget *wid;\t\n\n  while ( (wid = it.current()) != 0 ) {\n    ++it;\n    QObjectList *l2 = wid->topLevelWidget()->queryList(\"KMMainWidget\");\n    if (l2->first())\n      return dynamic_cast<KMMainWidget *>(l2->first());\n  }\t\n  return 0;\n}\n\n\/**\n * Called on startup of the KMSystemTray and when the numUnreadMsgsChanged signal\n * is emitted for one of the watched folders.  Shows the system tray icon if there\n * are new messages and the icon was hidden, or hides the system tray icon if there\n * are no more new messages.\n *\/\nvoid KMSystemTray::updateNewMessageNotification(KMFolder * fldr)\n{\n\n  if(!fldr)\n  {\n    kdDebug(5006) << \"Null folder, can't mess with that\" << endl;\n    return;\n  }\n\n  \/** The number of unread messages in that folder *\/\n  int unread = fldr->countUnread();\n\n  QMap<QGuardedPtr<KMFolder>, int>::Iterator it =\n  mFoldersWithUnread.find(fldr);\n  bool unmapped = (it == mFoldersWithUnread.end());\n\n  \/** If the folder is not mapped yet, increment count by numUnread\n      in folder *\/\n  if(unmapped) mCount += unread;\n  \/* Otherwise, get the difference between the numUnread in the folder and\n   * our last known version, and adjust mCount with that difference *\/\n  else\n  {\n    int diff = unread - it.data();\n    mCount += diff;\n  }\n\n  if(unread > 0)\n  {\n    \/** Add folder to our internal store, or update unread count if already mapped *\/\n    mFoldersWithUnread.insert(fldr, unread);\n    kdDebug(5006) << \"There are now \" << mFoldersWithUnread.count() << \" folders with unread\" << endl;\n  }\n\n  \/**\n   * Look for folder in the list of folders already represented.  If there are\n   * unread messages and the system tray icon is hidden, show it.  If there are\n   * no unread messages, remove the folder from the mapping.\n   *\/\n  if(unmapped)\n  {\n    \/** Spurious notification, ignore *\/\n    if(unread == 0) return;\n\n    \/** Make sure the icon will be displayed *\/\n    if(mMode == OnNewMail)\n    {\n      if(isHidden()) show();\n    }\n\n  } else\n  {\n\n    if(unread == 0)\n    {\n      kdDebug(5006) << \"Removing folder \" << fldr->name() << endl;\n\n      \/** Remove the folder from the internal store *\/\n      mFoldersWithUnread.remove(fldr);\n\n      \/** if this was the last folder in the dictionary, hide the systemtray icon *\/\n      if(mFoldersWithUnread.count() == 0)\n      {\n        mPopupFolders.clear();\n        disconnect(this, SLOT(selectedAccount(int)));\n\n        mCount = 0;\n\n        if(mMode == OnNewMail)\n          hide();\n      }\n    }\n  }\n\n  updateCount();\n\n  \/** Update tooltip to reflect count of unread messages *\/\n  QToolTip::add(this, i18n(\"There is 1 unread message.\",\n                           \"There are %n unread messages.\",\n                           mCount));\n}\n\n\/**\n * Called when user selects a folder name from the popup menu.  Shows\n * the first KMMainWin in the memberlist and jumps to the first unread\n * message in the selected folder.\n *\/\nvoid KMSystemTray::selectedAccount(int id)\n{\n  showKMail();\n\n  KMMainWidget * mainWidget = getKMMainWidget();\n  assert(mainWidget);\n\n  \/** Select folder *\/\n  KMFolder * fldr = mPopupFolders.at(id);\n  if(!fldr) return;\n  KMFolderTree * ft = mainWidget->folderTree();\n  if(!ft) return;\n  QListViewItem * fldrIdx = ft->indexOfFolder(fldr);\n  if(!fldrIdx) return;\n\n  ft->setCurrentItem(fldrIdx);\n  ft->selectCurrentFolder();\n  mainWidget->folderSelectedUnread(fldr);\n}\n\n\n#include \"kmsystemtray.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MATH_HPP\n#define MATH_HPP\n\n#include <algorithm>\n#include <cmath>\n#include <math.h>\n\n#define PI 3.14159265358979323846f\n#define TAU 6.28318530717958647692f\n#define KAPPA90 0.5522847493f\n\n\/\/ KAPPA90 = (4\/3 * (sqrt(2) - 1))\n\/\/ https:\/\/de.wikipedia.org\/wiki\/Datei:Circle-cbezier-method2.svg\n\n#define OE_FLOAT_INFINITY std::numeric_limits<float>::infinity()\n\n#define ARRAY_COUNT(arr) (sizeof(arr) \/ sizeof(0[arr]))\n\nnamespace OrbitEngine { namespace Math {\n\n\tinline double deg2rad(double deg)\n\t{\n\t\treturn deg * PI \/ 180.f;\n\t}\n\n\tinline double rad2deg(double rad)\n\t{\n\t\treturn rad * 180.f \/ PI;\n\t}\n\t\n\tinline unsigned int nextPowerOfTwo(unsigned int x)\n\t{\n\t\tx--;\n\t\tx |= x >> 1;\n\t\tx |= x >> 2;\n\t\tx |= x >> 4;\n\t\tx |= x >> 8;\n\t\tx |= x >> 16;\n\t\tx++;\n\t\treturn x;\n\t}\n\n\tinline bool isPowerOfTwo(unsigned int x) {\n\t\treturn x == 0 || (x & (x - 1)) == 0;\n\t}\n\n\ttemplate<typename T>\n\tinline T approximatelyEqual(T a, T b, T epsilon)\n\t{\n\t\treturn std::abs(a - b) <= ((std::abs(a) < std::abs(b) ? std::abs(b) : std::abs(a)) * epsilon);\n\t}\n\n\ttemplate<typename T>\n\tinline T lerp(T v0, T v1, float t) {\n\t\treturn v0 + (v1 - v0) * t;\n\t}\n\n\ttemplate<typename T>\n\tinline T clamp(T input, T min_, T max_) {\n\t\treturn (std::max)(min_, (std::min)(input, max_));\n\t}\n\n\ttemplate<typename T>\n\tinline T sign(T input)\n\t{\n\t\treturn input >= (T)0 ? (T)1 : (T)-1;\n\t};\n\n\ttemplate<typename A, typename B>\n\tA castMinMax(B in)\n\t{\n\t\t\/\/ only integer types\n\n\t\tA retVal = 0;\n\n\t\tif (in > 0)\n\t\t\tretVal = static_cast<A>(in & std::numeric_limits<A>::max());\n\t\telse if (in < 0)\n\t\t\tretVal = static_cast<A>(in | std::numeric_limits<A>::min());\n\n\t\treturn retVal;\n\t}\n} }\n\n#endif<commit_msg>Math doc<commit_after>#ifndef MATH_HPP\n#define MATH_HPP\n\n#include <algorithm>\n#include <cmath>\n#include <math.h>\n\n\/\/\/ PI value\n#define PI 3.14159265358979323846f\n\/\/\/ TAU value (2 * PI)\n#define TAU 6.28318530717958647692f\n\/\/\/ @brief KAPPA90 = (4\/3 * (sqrt(2) - 1))\n\/\/\/ @see https:\/\/de.wikipedia.org\/wiki\/Datei:Circle-cbezier-method2.svg\n#define KAPPA90 0.5522847493f\n\n\n\/\/\/ Max float value\n#define OE_FLOAT_INFINITY std::numeric_limits<float>::infinity()\n\n\/\/\/ Count the number of elements in a C array\n#define ARRAY_COUNT(arr) (sizeof(arr) \/ sizeof(0[arr]))\n\nnamespace OrbitEngine { namespace Math {\n\n\t\/\/\/ Convert degrees to radians\n\tinline double deg2rad(double deg)\n\t{\n\t\treturn deg * PI \/ 180.f;\n\t}\n\n\t\/\/\/ Convert radians to degrees\n\tinline double rad2deg(double rad)\n\t{\n\t\treturn rad * 180.f \/ PI;\n\t}\n\t\n\t\/\/\/ Get the next power of two\n\tinline unsigned int nextPowerOfTwo(unsigned int x)\n\t{\n\t\tx--;\n\t\tx |= x >> 1;\n\t\tx |= x >> 2;\n\t\tx |= x >> 4;\n\t\tx |= x >> 8;\n\t\tx |= x >> 16;\n\t\tx++;\n\t\treturn x;\n\t}\n\n\t\/\/\/ Check if a number is a power of two\n\tinline bool isPowerOfTwo(unsigned int x) {\n\t\treturn x == 0 || (x & (x - 1)) == 0;\n\t}\n\n\t\/\/\/ Check if two values are 'equal' by at most \\p epsilon\n\ttemplate<typename T>\n\tinline T approximatelyEqual(T a, T b, T epsilon)\n\t{\n\t\treturn std::abs(a - b) <= ((std::abs(a) < std::abs(b) ? std::abs(b) : std::abs(a)) * epsilon);\n\t}\n\n\t\/\/\/ Linearly interpolates two elements\n\ttemplate<typename T>\n\tinline T lerp(T v0, T v1, float t) {\n\t\treturn v0 + (v1 - v0) * t;\n\t}\n\n\t\/\/\/ Constrain a value between two others\n\ttemplate<typename T>\n\tinline T clamp(T input, T min_, T max_) {\n\t\treturn (std::max)(min_, (std::min)(input, max_));\n\t}\n\n\t\/\/\/ Extract the sign of the parameter\n\ttemplate<typename T>\n\tinline T sign(T input)\n\t{\n\t\treturn input >= (T)0 ? (T)1 : (T)-1;\n\t};\n\n\ttemplate<typename A, typename B>\n\tA castMinMax(B in)\n\t{\n\t\t\/\/ only integer types\n\n\t\tA retVal = 0;\n\n\t\tif (in > 0)\n\t\t\tretVal = static_cast<A>(in & std::numeric_limits<A>::max());\n\t\telse if (in < 0)\n\t\t\tretVal = static_cast<A>(in | std::numeric_limits<A>::min());\n\n\t\treturn retVal;\n\t}\n} }\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\n#include \"..\/Flare.h\"\n#include \"FlareFleet.h\"\n#include \"FlareCompany.h\"\n#include \"FlareGame.h\"\n#include \"..\/Player\/FlarePlayerController.h\"\n#include \"FlareSimulatedSector.h\"\n\n\n#define LOCTEXT_NAMESPACE \"FlareFleet\"\n\n\n\/*----------------------------------------------------\n\tConstructor\n----------------------------------------------------*\/\n\nUFlareFleet::UFlareFleet(const FObjectInitializer& ObjectInitializer)\n\t: Super(ObjectInitializer)\n{\n}\n\nvoid UFlareFleet::Load(const FFlareFleetSave& Data)\n{\n\tFleetCompany = Cast<UFlareCompany>(GetOuter());\n\tGame = FleetCompany->GetGame();\n\tFleetData = Data;\n\tIsShipListLoaded = false;\n}\n\nFFlareFleetSave* UFlareFleet::Save()\n{\n\treturn &FleetData;\n}\n\n\n\/*----------------------------------------------------\n\tGameplay\n----------------------------------------------------*\/\n\nFText UFlareFleet::GetName()\n{\n\tif (GetShips().Num() > 0)\n\t{\n\t\treturn FText::FromString(GetShips()[0]->GetImmatriculation().ToString());\/\/ TODO Clean with GetFleetName\n\t}\n\telse\n\t{\n\t\treturn GetFleetName();\n\t}\n}\n\nFText  UFlareFleet::GetFleetName() const\n{\n\tif(Game->GetPC()->GetPlayerFleet() == this)\n\t{\n\t\treturn LOCTEXT(\"PlayerFleetName\", \"Player Fleet\");\n\t}\n\n\treturn FleetData.Name;\n}\n\nbool UFlareFleet::IsTraveling() const\n{\n\treturn CurrentTravel != NULL;\n}\n\nbool UFlareFleet::IsTrading() const\n{\n\treturn GetTradingShipCount() > 0;\n}\n\n\nbool UFlareFleet::CanTravel()\n{\n\tif (IsTraveling() && !GetCurrentTravel()->CanChangeDestination())\n\t{\n\t\treturn false;\n\t}\n\n\tif (GetImmobilizedShipCount() == FleetShips.Num())\n\t{\n\t\t\/\/ All ship are immobilized\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool UFlareFleet::CanTravel(FText& OutInfo)\n{\n\tif (IsTraveling() && !GetCurrentTravel()->CanChangeDestination())\n\t{\n\t\tOutInfo = LOCTEXT(\"TravellingFormat\", \"Can't change destination\");\n\t\treturn false;\n\t}\n\n\tif (GetImmobilizedShipCount() == FleetShips.Num())\n\t{\n\t\tOutInfo = LOCTEXT(\"Travelling\", \"Some ships are trading or stranded\");\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nuint32 UFlareFleet::GetImmobilizedShipCount()\n{\n\tuint32 ImmobilizedShip = 0;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tif (!FleetShips[ShipIndex]->CanTravel())\n\t\t{\n\t\t\tImmobilizedShip++;\n\t\t}\n\t}\n\treturn ImmobilizedShip;\n}\n\nuint32 UFlareFleet::GetTradingShipCount() const\n{\n\tuint32 TradingShip = 0;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tif (FleetShips[ShipIndex]->IsTrading())\n\t\t{\n\t\t\tTradingShip++;\n\t\t}\n\t}\n\treturn TradingShip;\n}\n\nuint32 UFlareFleet::GetShipCount() const\n{\n\treturn FleetShips.Num();\n}\n\nuint32 UFlareFleet::GetMaxShipCount()\n{\n\treturn 20;\n}\n\nFText UFlareFleet::GetStatusInfo() const\n{\n\tif (IsTraveling())\n\t{\n\t\tint64 RemainingDuration = CurrentTravel->GetRemainingTravelDuration();\n\t\treturn FText::Format(LOCTEXT(\"TravelTextFormat\", \"Travelling to {0} ({1} left)\"),\n\t\t\tCurrentTravel->GetDestinationSector()->GetSectorName(),\n\t\t\tFText::FromString(*UFlareGameTools::FormatDate(RemainingDuration, 1))); \/\/FString needed here\n\t}\n\telse if (IsTrading())\n\t{\n\t\tif(GetTradingShipCount() == GetShipCount())\n\t\t{\n\t\t\treturn FText::Format(LOCTEXT(\"FleetTrading\", \"Trading in {0}\"), GetCurrentSector()->GetSectorName());\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn FText::Format(LOCTEXT(\"FleetPartialTrading\", \"{0} of {1} ships are trading in {2}\"), FText::AsNumber(GetTradingShipCount()), FText::AsNumber(GetShipCount()), GetCurrentSector()->GetSectorName());\n\t\t}\n\t}\n\telse\n\t{\n\t\treturn FText::Format(LOCTEXT(\"FleetIdle\", \"Idle in {0}\"), GetCurrentSector()->GetSectorName());\n\t}\n\n\treturn FText();\n}\n\n\nint32 UFlareFleet::GetFleetCapacity() const\n{\n\tint32 FreeCargoSpace = 0;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tFreeCargoSpace += FleetShips[ShipIndex]->GetCargoBay()->GetCapacity();\n\t}\n\treturn FreeCargoSpace;\n}\n\nint32 UFlareFleet::GetFleetFreeCargoSpace() const\n{\n\tint32 FreeCargoSpace = 0;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tFreeCargoSpace += FleetShips[ShipIndex]->GetCargoBay()->GetFreeCargoSpace();\n\t}\n\treturn FreeCargoSpace;\n}\n\nvoid UFlareFleet::RemoveImmobilizedShips()\n{\n\tTArray<UFlareSimulatedSpacecraft*> ShipToRemove;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tif (!FleetShips[ShipIndex]->CanTravel())\n\t\t{\n\t\t\tShipToRemove.Add(FleetShips[ShipIndex]);\n\t\t}\n\t}\n\n\tfor (int ShipIndex = 0; ShipIndex < ShipToRemove.Num(); ShipIndex++)\n\t{\n\t\tRemoveShip(ShipToRemove[ShipIndex]);\n\t}\n}\n\nvoid UFlareFleet::AddShip(UFlareSimulatedSpacecraft* Ship)\n{\n\tif (IsTraveling())\n\t{\n\t\tFLOGV(\"Fleet Disband fail: '%s' is travelling\", *GetFleetName().ToString());\n\t\treturn;\n\t}\n\n\tif (GetCurrentSector() != Ship->GetCurrentSector())\n\t{\n\t\tFLOGV(\"Fleet Merge fail: '%s' is the sector '%s' but '%s' is the sector '%s'\",\n\t\t\t  *GetFleetName().ToString(),\n\t\t\t  *GetCurrentSector()->GetSectorName().ToString(),\n\t\t\t  *Ship->GetImmatriculation().ToString(),\n\t\t\t  *Ship->GetCurrentSector()->GetSectorName().ToString());\n\t\treturn;\n\t}\n\n\tUFlareFleet* OldFleet = Ship->GetCurrentFleet();\n\tif (OldFleet)\n\t{\n\t\tOldFleet->RemoveShip(Ship);\n\t}\n\n\tFleetData.ShipImmatriculations.Add(Ship->GetImmatriculation());\n\tFleetShips.AddUnique(Ship);\n\tShip->SetCurrentFleet(this);\n}\n\nvoid UFlareFleet::RemoveShip(UFlareSimulatedSpacecraft* Ship, bool destroyed)\n{\n\tif (IsTraveling())\n\t{\n\t\tFLOGV(\"Fleet RemoveShip fail: '%s' is travelling\", *GetFleetName().ToString());\n\t\treturn;\n\t}\n\n\tFleetData.ShipImmatriculations.Remove(Ship->GetImmatriculation());\n\tFleetShips.Remove(Ship);\n\tShip->SetCurrentFleet(NULL);\n\n\tif (!destroyed)\n\t{\n\t\tShip->GetCompany()->CreateAutomaticFleet(Ship);\n\t}\n\n\tif(FleetShips.Num() == 0)\n\t{\n\t\tDisband();\n\t}\n}\n\n\/** Remove all ship from the fleet and delete it. Not possible during travel *\/\nvoid UFlareFleet::Disband()\n{\n\tif (IsTraveling())\n\t{\n\t\tFLOGV(\"Fleet Disband fail: '%s' is travelling\", *GetFleetName().ToString());\n\t\treturn;\n\t}\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tFleetShips[ShipIndex]->SetCurrentFleet(NULL);\n\t}\n\n\tif (GetCurrentTradeRoute())\n\t{\n\t\tGetCurrentTradeRoute()->RemoveFleet(this);\n\t}\n\tGetCurrentSector()->DisbandFleet(this);\n\tFleetCompany->RemoveFleet(this);\n}\n\nbool UFlareFleet::CanMerge(UFlareFleet* Fleet, FText& OutInfo)\n{\n\tif (GetShipCount() + Fleet->GetShipCount() > GetMaxShipCount())\n\t{\n\t\tOutInfo = LOCTEXT(\"MergeFleetMaxShips\", \"Can't add, max ships reached\");\n\t\treturn false;\n\t}\n\n\tif (IsTraveling())\n\t{\n\t\tOutInfo = LOCTEXT(\"MergeFleetTravel\", \"Can't add during travel\");\n\t\treturn false;\n\t}\n\n\tif (Fleet->IsTraveling())\n\t{\n\t\tOutInfo = LOCTEXT(\"MergeOtherFleetTravel\", \"Can't add travelling ships\");\n\t\treturn false;\n\t}\n\n\tif (GetCurrentSector() != Fleet->GetCurrentSector())\n\t{\n\t\tOutInfo = LOCTEXT(\"MergeFleetDifferenSector\", \"Can't add from a different sector\");\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nvoid UFlareFleet::Merge(UFlareFleet* Fleet)\n{\n\tFText Unused;\n\tif (!CanMerge(Fleet, Unused))\n\t{\n\t\tFLOGV(\"Fleet Merge fail: '%s' is not mergeable\", *Fleet->GetFleetName().ToString());\n\t\treturn;\n\t}\n\n\tTArray<UFlareSimulatedSpacecraft*> Ships = Fleet->GetShips();\n\tFleet->Disband();\n\tfor (int ShipIndex = 0; ShipIndex < Ships.Num(); ShipIndex++)\n\t{\n\t\tAddShip(Ships[ShipIndex]);\n\t}\n}\n\nvoid UFlareFleet::SetCurrentSector(UFlareSimulatedSector* Sector)\n{\n\tCurrentSector = Sector;\n\tif(!Sector->IsTravelSector())\n\t{\n\t\tCurrentTravel = NULL;\n\t}\n\tInitShipList();\n}\n\nvoid UFlareFleet::SetCurrentTravel(UFlareTravel* Travel)\n{\n\tCurrentSector = Travel->GetTravelSector();\n\tCurrentTravel = Travel;\n\tInitShipList();\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tFleetShips[ShipIndex]->SetSpawnMode(EFlareSpawnMode::Travel);\n\t}\n}\n\nvoid UFlareFleet::InitShipList()\n{\n\tif (!IsShipListLoaded)\n\t{\n\t\tIsShipListLoaded = true;\n\t\tFleetShips.Empty();\n\t\tfor (int ShipIndex = 0; ShipIndex < FleetData.ShipImmatriculations.Num(); ShipIndex++)\n\t\t{\n\t\t\tUFlareSimulatedSpacecraft* Ship = FleetCompany->FindSpacecraft(FleetData.ShipImmatriculations[ShipIndex]);\n\t\t\tif (!Ship)\n\t\t\t{\n\t\t\t\tFLOGV(\"WARNING: Fail to find ship with id %s in company %s for fleet %s (%d ships)\",\n\t\t\t\t\t\t*FleetData.ShipImmatriculations[ShipIndex].ToString(),\n\t\t\t\t\t\t*FleetCompany->GetCompanyName().ToString(),\n\t\t\t\t\t\t*GetFleetName().ToString(),\n\t\t\t\t\t\tFleetData.ShipImmatriculations.Num());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tShip->SetCurrentFleet(this);\n\t\t\tFleetShips.Add(Ship);\n\t\t}\n\t}\n}\n\n\n\/*----------------------------------------------------\n\tGetters\n----------------------------------------------------*\/\n\nTArray<UFlareSimulatedSpacecraft*>& UFlareFleet::GetShips()\n{\n\tInitShipList();\n\n\treturn FleetShips;\n}\n\n#undef LOCTEXT_NAMESPACE\n<commit_msg>#527 Forgid travel if player ship is stranded<commit_after>\n#include \"..\/Flare.h\"\n#include \"FlareFleet.h\"\n#include \"FlareCompany.h\"\n#include \"FlareGame.h\"\n#include \"..\/Player\/FlarePlayerController.h\"\n#include \"FlareSimulatedSector.h\"\n\n\n#define LOCTEXT_NAMESPACE \"FlareFleet\"\n\n\n\/*----------------------------------------------------\n\tConstructor\n----------------------------------------------------*\/\n\nUFlareFleet::UFlareFleet(const FObjectInitializer& ObjectInitializer)\n\t: Super(ObjectInitializer)\n{\n}\n\nvoid UFlareFleet::Load(const FFlareFleetSave& Data)\n{\n\tFleetCompany = Cast<UFlareCompany>(GetOuter());\n\tGame = FleetCompany->GetGame();\n\tFleetData = Data;\n\tIsShipListLoaded = false;\n}\n\nFFlareFleetSave* UFlareFleet::Save()\n{\n\treturn &FleetData;\n}\n\n\n\/*----------------------------------------------------\n\tGameplay\n----------------------------------------------------*\/\n\nFText UFlareFleet::GetName()\n{\n\tif (GetShips().Num() > 0)\n\t{\n\t\treturn FText::FromString(GetShips()[0]->GetImmatriculation().ToString());\/\/ TODO Clean with GetFleetName\n\t}\n\telse\n\t{\n\t\treturn GetFleetName();\n\t}\n}\n\nFText  UFlareFleet::GetFleetName() const\n{\n\tif(Game->GetPC()->GetPlayerFleet() == this)\n\t{\n\t\treturn LOCTEXT(\"PlayerFleetName\", \"Player Fleet\");\n\t}\n\n\treturn FleetData.Name;\n}\n\nbool UFlareFleet::IsTraveling() const\n{\n\treturn CurrentTravel != NULL;\n}\n\nbool UFlareFleet::IsTrading() const\n{\n\treturn GetTradingShipCount() > 0;\n}\n\n\nbool UFlareFleet::CanTravel()\n{\n\tif (IsTraveling() && !GetCurrentTravel()->CanChangeDestination())\n\t{\n\t\treturn false;\n\t}\n\n\tif (GetImmobilizedShipCount() == FleetShips.Num())\n\t{\n\t\t\/\/ All ship are immobilized\n\t\treturn false;\n\t}\n\n\tif(Game->GetPC()->GetPlayerFleet() == this && Game->GetPC()->GetPlayerShip()->GetDamageSystem()->IsStranded())\n\t{\n\t\t\/\/ The player ship is stranded\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool UFlareFleet::CanTravel(FText& OutInfo)\n{\n\tif (IsTraveling() && !GetCurrentTravel()->CanChangeDestination())\n\t{\n\t\tOutInfo = LOCTEXT(\"TravellingFormat\", \"Can't change destination\");\n\t\treturn false;\n\t}\n\n\tif (GetImmobilizedShipCount() == FleetShips.Num())\n\t{\n\t\tOutInfo = LOCTEXT(\"Travelling\", \"Some ships are trading or stranded\");\n\t\treturn false;\n\t}\n\n\tif(Game->GetPC()->GetPlayerFleet() == this && Game->GetPC()->GetPlayerShip()->GetDamageSystem()->IsStranded())\n\t{\n\t\tOutInfo = LOCTEXT(\"PlayerShipStranded\", \"The ship you are piloting is stranded\");\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nuint32 UFlareFleet::GetImmobilizedShipCount()\n{\n\tuint32 ImmobilizedShip = 0;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tif (!FleetShips[ShipIndex]->CanTravel())\n\t\t{\n\t\t\tImmobilizedShip++;\n\t\t}\n\t}\n\treturn ImmobilizedShip;\n}\n\nuint32 UFlareFleet::GetTradingShipCount() const\n{\n\tuint32 TradingShip = 0;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tif (FleetShips[ShipIndex]->IsTrading())\n\t\t{\n\t\t\tTradingShip++;\n\t\t}\n\t}\n\treturn TradingShip;\n}\n\nuint32 UFlareFleet::GetShipCount() const\n{\n\treturn FleetShips.Num();\n}\n\nuint32 UFlareFleet::GetMaxShipCount()\n{\n\treturn 20;\n}\n\nFText UFlareFleet::GetStatusInfo() const\n{\n\tif (IsTraveling())\n\t{\n\t\tint64 RemainingDuration = CurrentTravel->GetRemainingTravelDuration();\n\t\treturn FText::Format(LOCTEXT(\"TravelTextFormat\", \"Travelling to {0} ({1} left)\"),\n\t\t\tCurrentTravel->GetDestinationSector()->GetSectorName(),\n\t\t\tFText::FromString(*UFlareGameTools::FormatDate(RemainingDuration, 1))); \/\/FString needed here\n\t}\n\telse if (IsTrading())\n\t{\n\t\tif(GetTradingShipCount() == GetShipCount())\n\t\t{\n\t\t\treturn FText::Format(LOCTEXT(\"FleetTrading\", \"Trading in {0}\"), GetCurrentSector()->GetSectorName());\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn FText::Format(LOCTEXT(\"FleetPartialTrading\", \"{0} of {1} ships are trading in {2}\"), FText::AsNumber(GetTradingShipCount()), FText::AsNumber(GetShipCount()), GetCurrentSector()->GetSectorName());\n\t\t}\n\t}\n\telse\n\t{\n\t\treturn FText::Format(LOCTEXT(\"FleetIdle\", \"Idle in {0}\"), GetCurrentSector()->GetSectorName());\n\t}\n\n\treturn FText();\n}\n\n\nint32 UFlareFleet::GetFleetCapacity() const\n{\n\tint32 FreeCargoSpace = 0;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tFreeCargoSpace += FleetShips[ShipIndex]->GetCargoBay()->GetCapacity();\n\t}\n\treturn FreeCargoSpace;\n}\n\nint32 UFlareFleet::GetFleetFreeCargoSpace() const\n{\n\tint32 FreeCargoSpace = 0;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tFreeCargoSpace += FleetShips[ShipIndex]->GetCargoBay()->GetFreeCargoSpace();\n\t}\n\treturn FreeCargoSpace;\n}\n\nvoid UFlareFleet::RemoveImmobilizedShips()\n{\n\tTArray<UFlareSimulatedSpacecraft*> ShipToRemove;\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tif (!FleetShips[ShipIndex]->CanTravel())\n\t\t{\n\t\t\tShipToRemove.Add(FleetShips[ShipIndex]);\n\t\t}\n\t}\n\n\tfor (int ShipIndex = 0; ShipIndex < ShipToRemove.Num(); ShipIndex++)\n\t{\n\t\tRemoveShip(ShipToRemove[ShipIndex]);\n\t}\n}\n\nvoid UFlareFleet::AddShip(UFlareSimulatedSpacecraft* Ship)\n{\n\tif (IsTraveling())\n\t{\n\t\tFLOGV(\"Fleet Disband fail: '%s' is travelling\", *GetFleetName().ToString());\n\t\treturn;\n\t}\n\n\tif (GetCurrentSector() != Ship->GetCurrentSector())\n\t{\n\t\tFLOGV(\"Fleet Merge fail: '%s' is the sector '%s' but '%s' is the sector '%s'\",\n\t\t\t  *GetFleetName().ToString(),\n\t\t\t  *GetCurrentSector()->GetSectorName().ToString(),\n\t\t\t  *Ship->GetImmatriculation().ToString(),\n\t\t\t  *Ship->GetCurrentSector()->GetSectorName().ToString());\n\t\treturn;\n\t}\n\n\tUFlareFleet* OldFleet = Ship->GetCurrentFleet();\n\tif (OldFleet)\n\t{\n\t\tOldFleet->RemoveShip(Ship);\n\t}\n\n\tFleetData.ShipImmatriculations.Add(Ship->GetImmatriculation());\n\tFleetShips.AddUnique(Ship);\n\tShip->SetCurrentFleet(this);\n}\n\nvoid UFlareFleet::RemoveShip(UFlareSimulatedSpacecraft* Ship, bool destroyed)\n{\n\tif (IsTraveling())\n\t{\n\t\tFLOGV(\"Fleet RemoveShip fail: '%s' is travelling\", *GetFleetName().ToString());\n\t\treturn;\n\t}\n\n\tFleetData.ShipImmatriculations.Remove(Ship->GetImmatriculation());\n\tFleetShips.Remove(Ship);\n\tShip->SetCurrentFleet(NULL);\n\n\tif (!destroyed)\n\t{\n\t\tShip->GetCompany()->CreateAutomaticFleet(Ship);\n\t}\n\n\tif(FleetShips.Num() == 0)\n\t{\n\t\tDisband();\n\t}\n}\n\n\/** Remove all ship from the fleet and delete it. Not possible during travel *\/\nvoid UFlareFleet::Disband()\n{\n\tif (IsTraveling())\n\t{\n\t\tFLOGV(\"Fleet Disband fail: '%s' is travelling\", *GetFleetName().ToString());\n\t\treturn;\n\t}\n\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tFleetShips[ShipIndex]->SetCurrentFleet(NULL);\n\t}\n\n\tif (GetCurrentTradeRoute())\n\t{\n\t\tGetCurrentTradeRoute()->RemoveFleet(this);\n\t}\n\tGetCurrentSector()->DisbandFleet(this);\n\tFleetCompany->RemoveFleet(this);\n}\n\nbool UFlareFleet::CanMerge(UFlareFleet* Fleet, FText& OutInfo)\n{\n\tif (GetShipCount() + Fleet->GetShipCount() > GetMaxShipCount())\n\t{\n\t\tOutInfo = LOCTEXT(\"MergeFleetMaxShips\", \"Can't add, max ships reached\");\n\t\treturn false;\n\t}\n\n\tif (IsTraveling())\n\t{\n\t\tOutInfo = LOCTEXT(\"MergeFleetTravel\", \"Can't add during travel\");\n\t\treturn false;\n\t}\n\n\tif (Fleet->IsTraveling())\n\t{\n\t\tOutInfo = LOCTEXT(\"MergeOtherFleetTravel\", \"Can't add travelling ships\");\n\t\treturn false;\n\t}\n\n\tif (GetCurrentSector() != Fleet->GetCurrentSector())\n\t{\n\t\tOutInfo = LOCTEXT(\"MergeFleetDifferenSector\", \"Can't add from a different sector\");\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nvoid UFlareFleet::Merge(UFlareFleet* Fleet)\n{\n\tFText Unused;\n\tif (!CanMerge(Fleet, Unused))\n\t{\n\t\tFLOGV(\"Fleet Merge fail: '%s' is not mergeable\", *Fleet->GetFleetName().ToString());\n\t\treturn;\n\t}\n\n\tTArray<UFlareSimulatedSpacecraft*> Ships = Fleet->GetShips();\n\tFleet->Disband();\n\tfor (int ShipIndex = 0; ShipIndex < Ships.Num(); ShipIndex++)\n\t{\n\t\tAddShip(Ships[ShipIndex]);\n\t}\n}\n\nvoid UFlareFleet::SetCurrentSector(UFlareSimulatedSector* Sector)\n{\n\tCurrentSector = Sector;\n\tif(!Sector->IsTravelSector())\n\t{\n\t\tCurrentTravel = NULL;\n\t}\n\tInitShipList();\n}\n\nvoid UFlareFleet::SetCurrentTravel(UFlareTravel* Travel)\n{\n\tCurrentSector = Travel->GetTravelSector();\n\tCurrentTravel = Travel;\n\tInitShipList();\n\tfor (int ShipIndex = 0; ShipIndex < FleetShips.Num(); ShipIndex++)\n\t{\n\t\tFleetShips[ShipIndex]->SetSpawnMode(EFlareSpawnMode::Travel);\n\t}\n}\n\nvoid UFlareFleet::InitShipList()\n{\n\tif (!IsShipListLoaded)\n\t{\n\t\tIsShipListLoaded = true;\n\t\tFleetShips.Empty();\n\t\tfor (int ShipIndex = 0; ShipIndex < FleetData.ShipImmatriculations.Num(); ShipIndex++)\n\t\t{\n\t\t\tUFlareSimulatedSpacecraft* Ship = FleetCompany->FindSpacecraft(FleetData.ShipImmatriculations[ShipIndex]);\n\t\t\tif (!Ship)\n\t\t\t{\n\t\t\t\tFLOGV(\"WARNING: Fail to find ship with id %s in company %s for fleet %s (%d ships)\",\n\t\t\t\t\t\t*FleetData.ShipImmatriculations[ShipIndex].ToString(),\n\t\t\t\t\t\t*FleetCompany->GetCompanyName().ToString(),\n\t\t\t\t\t\t*GetFleetName().ToString(),\n\t\t\t\t\t\tFleetData.ShipImmatriculations.Num());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tShip->SetCurrentFleet(this);\n\t\t\tFleetShips.Add(Ship);\n\t\t}\n\t}\n}\n\n\n\/*----------------------------------------------------\n\tGetters\n----------------------------------------------------*\/\n\nTArray<UFlareSimulatedSpacecraft*>& UFlareFleet::GetShips()\n{\n\tInitShipList();\n\n\treturn FleetShips;\n}\n\n#undef LOCTEXT_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\n#define TRACE_SYMPLECTIC_PARTITIONED_RUNGE_KUTTA_INTEGRATOR\n\n#include \"integrators\/symplectic_partitioned_runge_kutta_integrator.hpp\"\n\n#include <algorithm>\n#include <vector>\n#include <string>\n\n#include \"geometry\/sign.hpp\"\n#include \"glog\/logging.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"quantities\/dimensionless.hpp\"\n#include \"testing_utilities\/numerics.hpp\"\n#include \"testing_utilities\/statistics.hpp\"\n\nusing principia::testing_utilities::AbsoluteError;\nusing testing::AllOf;\nusing testing::Gt;\nusing testing::Lt;\nusing principia::testing_utilities::Slope;\nusing principia::testing_utilities::PearsonProductMomentCorrelationCoefficient;\n\nnamespace principia {\nnamespace integrators {\n\nnamespace {\n\nusing quantities::Dimensionless;\n\ninline void compute_harmonic_oscillator_force(double const t,\n                                              std::vector<double> const& q,\n                                              std::vector<double>* result) {\n  (*result)[0] = -q[0];\n}\n\ninline void compute_harmonic_oscillator_velocity(std::vector<double> const& p,\n                                                  std::vector<double>* result) {\n  (*result)[0] = p[0];\n}\n\n}  \/\/ namespace\n\nclass SPRKTest : public testing::Test {\n public:\n  static void SetUpTestCase() {\n    google::LogToStderr();\n  }\n\n protected:\n  void SetUp() override {}\n\n  SPRKIntegrator             integrator_;\n  SPRKIntegrator::Parameters parameters_;\n  SPRKIntegrator::Solution   solution_;\n};\n\nTEST_F(SPRKTest, HarmonicOscillator) {\n  parameters_.q0 = {1.0};\n  parameters_.p0 = {0.0};\n  parameters_.t0 = 0.0;\n#ifdef _DEBUG\n  parameters_.tmax = 100.0;\n#else\n  parameters_.tmax = 1000.0;\n#endif\n  parameters_.Δt = 1.0E-4;\n  parameters_.coefficients = integrator_.Order5Optimal();\n  parameters_.sampling_period = 1;\n  integrator_.Solve(&compute_harmonic_oscillator_force,\n                    &compute_harmonic_oscillator_velocity,\n                    parameters_, &solution_);\n  double q_error = 0;\n  double p_error = 0;\n  for (size_t i = 0; i < solution_.time.quantities.size(); ++i) {\n    q_error = std::max(q_error,\n                       std::abs(solution_.position[0].quantities[i] -\n                                std::cos(solution_.time.quantities[i])));\n    p_error = std::max(p_error,\n                       std::abs(solution_.momentum[0].quantities[i] +\n                                std::sin(solution_.time.quantities[i])));\n  }\n  LOG(INFO) << \"q_error = \" << q_error;\n  LOG(INFO) << \"p_error = \" << p_error;\n  EXPECT_THAT(q_error, Lt(2E-16 * parameters_.tmax));\n  EXPECT_THAT(p_error, Lt(2E-16 * parameters_.tmax));\n}\n\nTEST_F(SPRKTest, Convergence) {\n  parameters_.q0 = {1.0};\n  parameters_.p0 = {0.0};\n  parameters_.t0 = 0.0;\n  parameters_.tmax = 100;\n  parameters_.coefficients = integrator_.Order5Optimal();\n  parameters_.sampling_period = 0;\n  \/\/ For 1.1⁻²¹ < |Δt| < 0.2 , the correlation between step size and error is\n  \/\/ very strong. It the step is small enough to converge and large enough to\n  \/\/ stay clear of floating point inaccuracy.\n  parameters_.Δt = 0.2;\n  int const step_sizes = 22;\n  double const step_reduction = 1.1;\n  std::vector<Dimensionless> log_step_sizes(step_sizes);\n  std::vector<Dimensionless> log_q_errors(step_sizes);\n  std::vector<Dimensionless> log_p_errors(step_sizes);\n  for (int i = 0; i < step_sizes; ++i, parameters_.Δt \/= step_reduction) {\n    solution_ = SPRKIntegrator::Solution();\n    integrator_.Solve(&compute_harmonic_oscillator_force,\n                      &compute_harmonic_oscillator_velocity,\n                      parameters_, &solution_);\n    log_step_sizes[i] = std::log10(parameters_.Δt);\n    log_q_errors[i] = std::log10(\n        std::abs(solution_.position[0].quantities[0] -\n                 std::cos(solution_.time.quantities[0])));\n    log_p_errors[i] = std::log10(\n        std::abs(solution_.momentum[0].quantities[0] +\n                 std::sin(solution_.time.quantities[0])));\n  }\n  std::string mathematica_out = \"ToExpression[StringReplace[\\\"\\n{\";\n  for (int i = 0; i < step_sizes; ++i) {\n    mathematica_out += \"{\";\n    mathematica_out += ToString(log_step_sizes[i]);\n    mathematica_out += \",\";\n    mathematica_out += ToString(log_q_errors[i]);\n    mathematica_out += \"}\";\n    if (i + 1 < step_sizes) {\n      mathematica_out += \",\\n\";\n    }\n  }\n  mathematica_out += \"}\\\",\\n{\\\"e\\\"->\\\"*^\\\", \\\"\\\\n\\\"->\\\"\\\", \\\" \\\"->\\\"\\\"}]];\";\n  google::LogToStderr();\n  Dimensionless const q_convergence_order = Slope(log_step_sizes, log_q_errors);\n  Dimensionless const q_correlation =\n      PearsonProductMomentCorrelationCoefficient(log_step_sizes, log_q_errors);\n  LOG(INFO) << \"Convergence order in q : \" << q_convergence_order;\n  LOG(INFO) << \"Correlation            : \" << q_correlation;\n  LOG(INFO) << \"Convergence data for q :\\n\" << mathematica_out;\n  EXPECT_THAT(q_convergence_order, AllOf(Gt(4.9), Lt(5.1)));\n  EXPECT_THAT(q_correlation, AllOf(Gt(0.999), Lt(1.01)));\n  mathematica_out = \"ToExpression[StringReplace[\\\"\\n{\";\n  for (int i = 0; i < step_sizes; ++i) {\n    mathematica_out += \"{\";\n    mathematica_out += ToString(log_step_sizes[i]);\n    mathematica_out += \",\";\n    mathematica_out += ToString(log_p_errors[i]);\n    mathematica_out += \"}\";\n    if (i + 1 < step_sizes) {\n      mathematica_out += \",\\n \";\n    }\n  }\n  mathematica_out += \"}\\\",\\n{\\\"e\\\"->\\\"*^\\\", \\\"\\\\n\\\"->\\\"\\\", \\\" \\\"->\\\"\\\"}]];\";\n  Dimensionless const p_convergence_order = Slope(log_step_sizes, log_p_errors);\n  Dimensionless const p_correlation =\n      PearsonProductMomentCorrelationCoefficient(log_step_sizes, log_p_errors);\n  LOG(INFO) << \"Convergence order in p : \" << p_convergence_order;\n  LOG(INFO) << \"Correlation            : \" << p_correlation;\n  LOG(INFO) << \"Convergence data for p :\\n\" << mathematica_out;\n  EXPECT_THAT(p_convergence_order, AllOf(Gt(5.9), Lt(6.1)));\n  EXPECT_THAT(p_correlation, AllOf(Gt(0.999), Lt(1.01)));\n}\n\n}  \/\/ namespace integrators\n}  \/\/ namespace principia\n<commit_msg>Fix comment, two lines in a row ending at 80 characters. :-)<commit_after>\n#define TRACE_SYMPLECTIC_PARTITIONED_RUNGE_KUTTA_INTEGRATOR\n\n#include \"integrators\/symplectic_partitioned_runge_kutta_integrator.hpp\"\n\n#include <algorithm>\n#include <vector>\n#include <string>\n\n#include \"geometry\/sign.hpp\"\n#include \"glog\/logging.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"quantities\/dimensionless.hpp\"\n#include \"testing_utilities\/numerics.hpp\"\n#include \"testing_utilities\/statistics.hpp\"\n\nusing principia::testing_utilities::AbsoluteError;\nusing testing::AllOf;\nusing testing::Gt;\nusing testing::Lt;\nusing principia::testing_utilities::Slope;\nusing principia::testing_utilities::PearsonProductMomentCorrelationCoefficient;\n\nnamespace principia {\nnamespace integrators {\n\nnamespace {\n\nusing quantities::Dimensionless;\n\ninline void compute_harmonic_oscillator_force(double const t,\n                                              std::vector<double> const& q,\n                                              std::vector<double>* result) {\n  (*result)[0] = -q[0];\n}\n\ninline void compute_harmonic_oscillator_velocity(std::vector<double> const& p,\n                                                  std::vector<double>* result) {\n  (*result)[0] = p[0];\n}\n\n}  \/\/ namespace\n\nclass SPRKTest : public testing::Test {\n public:\n  static void SetUpTestCase() {\n    google::LogToStderr();\n  }\n\n protected:\n  void SetUp() override {}\n\n  SPRKIntegrator             integrator_;\n  SPRKIntegrator::Parameters parameters_;\n  SPRKIntegrator::Solution   solution_;\n};\n\nTEST_F(SPRKTest, HarmonicOscillator) {\n  parameters_.q0 = {1.0};\n  parameters_.p0 = {0.0};\n  parameters_.t0 = 0.0;\n#ifdef _DEBUG\n  parameters_.tmax = 100.0;\n#else\n  parameters_.tmax = 1000.0;\n#endif\n  parameters_.Δt = 1.0E-4;\n  parameters_.coefficients = integrator_.Order5Optimal();\n  parameters_.sampling_period = 1;\n  integrator_.Solve(&compute_harmonic_oscillator_force,\n                    &compute_harmonic_oscillator_velocity,\n                    parameters_, &solution_);\n  double q_error = 0;\n  double p_error = 0;\n  for (size_t i = 0; i < solution_.time.quantities.size(); ++i) {\n    q_error = std::max(q_error,\n                       std::abs(solution_.position[0].quantities[i] -\n                                std::cos(solution_.time.quantities[i])));\n    p_error = std::max(p_error,\n                       std::abs(solution_.momentum[0].quantities[i] +\n                                std::sin(solution_.time.quantities[i])));\n  }\n  LOG(INFO) << \"q_error = \" << q_error;\n  LOG(INFO) << \"p_error = \" << p_error;\n  EXPECT_THAT(q_error, Lt(2E-16 * parameters_.tmax));\n  EXPECT_THAT(p_error, Lt(2E-16 * parameters_.tmax));\n}\n\nTEST_F(SPRKTest, Convergence) {\n  parameters_.q0 = {1.0};\n  parameters_.p0 = {0.0};\n  parameters_.t0 = 0.0;\n  parameters_.tmax = 100;\n  parameters_.coefficients = integrator_.Order5Optimal();\n  parameters_.sampling_period = 0;\n  \/\/ For 0.2 * 1.1⁻²¹ < |Δt| < 0.2 , the correlation between step size and error\n  \/\/ is very strong. It the step is small enough to converge and large enough to\n  \/\/ stay clear of floating point inaccuracy.\n  parameters_.Δt = 0.2;\n  int const step_sizes = 22;\n  double const step_reduction = 1.1;\n  std::vector<Dimensionless> log_step_sizes(step_sizes);\n  std::vector<Dimensionless> log_q_errors(step_sizes);\n  std::vector<Dimensionless> log_p_errors(step_sizes);\n  for (int i = 0; i < step_sizes; ++i, parameters_.Δt \/= step_reduction) {\n    solution_ = SPRKIntegrator::Solution();\n    integrator_.Solve(&compute_harmonic_oscillator_force,\n                      &compute_harmonic_oscillator_velocity,\n                      parameters_, &solution_);\n    log_step_sizes[i] = std::log10(parameters_.Δt);\n    log_q_errors[i] = std::log10(\n        std::abs(solution_.position[0].quantities[0] -\n                 std::cos(solution_.time.quantities[0])));\n    log_p_errors[i] = std::log10(\n        std::abs(solution_.momentum[0].quantities[0] +\n                 std::sin(solution_.time.quantities[0])));\n  }\n  std::string mathematica_out = \"ToExpression[StringReplace[\\\"\\n{\";\n  for (int i = 0; i < step_sizes; ++i) {\n    mathematica_out += \"{\";\n    mathematica_out += ToString(log_step_sizes[i]);\n    mathematica_out += \",\";\n    mathematica_out += ToString(log_q_errors[i]);\n    mathematica_out += \"}\";\n    if (i + 1 < step_sizes) {\n      mathematica_out += \",\\n\";\n    }\n  }\n  mathematica_out += \"}\\\",\\n{\\\"e\\\"->\\\"*^\\\", \\\"\\\\n\\\"->\\\"\\\", \\\" \\\"->\\\"\\\"}]];\";\n  google::LogToStderr();\n  Dimensionless const q_convergence_order = Slope(log_step_sizes, log_q_errors);\n  Dimensionless const q_correlation =\n      PearsonProductMomentCorrelationCoefficient(log_step_sizes, log_q_errors);\n  LOG(INFO) << \"Convergence order in q : \" << q_convergence_order;\n  LOG(INFO) << \"Correlation            : \" << q_correlation;\n  LOG(INFO) << \"Convergence data for q :\\n\" << mathematica_out;\n  EXPECT_THAT(q_convergence_order, AllOf(Gt(4.9), Lt(5.1)));\n  EXPECT_THAT(q_correlation, AllOf(Gt(0.999), Lt(1.01)));\n  mathematica_out = \"ToExpression[StringReplace[\\\"\\n{\";\n  for (int i = 0; i < step_sizes; ++i) {\n    mathematica_out += \"{\";\n    mathematica_out += ToString(log_step_sizes[i]);\n    mathematica_out += \",\";\n    mathematica_out += ToString(log_p_errors[i]);\n    mathematica_out += \"}\";\n    if (i + 1 < step_sizes) {\n      mathematica_out += \",\\n \";\n    }\n  }\n  mathematica_out += \"}\\\",\\n{\\\"e\\\"->\\\"*^\\\", \\\"\\\\n\\\"->\\\"\\\", \\\" \\\"->\\\"\\\"}]];\";\n  Dimensionless const p_convergence_order = Slope(log_step_sizes, log_p_errors);\n  Dimensionless const p_correlation =\n      PearsonProductMomentCorrelationCoefficient(log_step_sizes, log_p_errors);\n  LOG(INFO) << \"Convergence order in p : \" << p_convergence_order;\n  LOG(INFO) << \"Correlation            : \" << p_correlation;\n  LOG(INFO) << \"Convergence data for p :\\n\" << mathematica_out;\n  EXPECT_THAT(p_convergence_order, AllOf(Gt(5.9), Lt(6.1)));\n  EXPECT_THAT(p_correlation, AllOf(Gt(0.999), Lt(1.01)));\n}\n\n}  \/\/ namespace integrators\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"integrators\/symplectic_partitioned_runge_kutta_integrator.hpp\"\n\n#include <algorithm>\n#include <vector>\n\n#include \"geometry\/sign.hpp\"\n#include \"glog\/logging.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"testing_utilities\/numerics.hpp\"\n\nusing principia::testing_utilities::AbsoluteError;\nusing testing::Lt;\n\nnamespace principia {\nnamespace integrators {\n\nnamespace {\n\ninline void compute_harmonic_oscillator_force(double const t,\n                                              std::vector<double> const& q,\n                                              std::vector<double>* result) {\n  (*result)[0] = -q[0];\n}\n\ninline void compute_harmonice_oscillator_velocity(std::vector<double> const& p,\n                                                  std::vector<double>* result) {\n  (*result)[0] = p[0];\n}\n\n}  \/\/ namespace\n\n\nclass SPRKTest : public testing::Test {\n protected:\n  void SetUp() override {\n    integrator_.reset(new SPRKIntegrator);\n    parameters_.reset(new SPRKIntegrator::Parameters);\n    solution_.reset(new SPRKIntegrator::Solution);\n  }\n\n  std::unique_ptr<SPRKIntegrator> integrator_;\n  std::unique_ptr<SPRKIntegrator::Parameters> parameters_;\n  std::unique_ptr<SPRKIntegrator::Solution> solution_;\n};\n\nTEST_F(SPRKTest, HarmonicOscillator) {\n  parameters_->q0 = {1.0};\n  parameters_->p0 = {0.0};\n  parameters_->t0 = 0.0;\n#ifdef _DEBUG\n  parameters_->tmax = 100.0;\n#else\n  parameters_->tmax = 1000.0;\n#endif\n  parameters_->Δt = 1.0E-4;\n  parameters_->coefficients = integrator_->Order5Optimal();\n  parameters_->sampling_period = 1;\n  integrator_->Solve(&compute_harmonic_oscillator_force,\n                         &compute_harmonice_oscillator_velocity,\n                         *parameters_,\n                         solution_.get());\n  double q_error = 0;\n  double p_error = 0;\n  for (size_t i = 0; i < solution_->time.quantities.size(); ++i) {\n    q_error = std::max(q_error,\n                       std::abs(solution_->position[0].quantities[i] -\n                                std::cos(solution_->time.quantities[i])));\n    p_error = std::max(p_error,\n                       std::abs(solution_->momentum[0].quantities[i] +\n                                std::sin(solution_->time.quantities[i])));\n  }\n  LOG(ERROR) << \"q_error = \" << q_error;\n  LOG(ERROR) << \"p_error = \" << p_error;\n  EXPECT_THAT(AbsoluteError(0, q_error), Lt(2E-16 * parameters_->tmax));\n  EXPECT_THAT(AbsoluteError(0, p_error), Lt(2E-16 * parameters_->tmax));\n}\n\n}  \/\/ namespace integrators\n}  \/\/ namespace principia\n<commit_msg>Empty line.<commit_after>\n#include \"integrators\/symplectic_partitioned_runge_kutta_integrator.hpp\"\n\n#include <algorithm>\n#include <vector>\n\n#include \"geometry\/sign.hpp\"\n#include \"glog\/logging.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"testing_utilities\/numerics.hpp\"\n\nusing principia::testing_utilities::AbsoluteError;\nusing testing::Lt;\n\nnamespace principia {\nnamespace integrators {\n\nnamespace {\n\ninline void compute_harmonic_oscillator_force(double const t,\n                                              std::vector<double> const& q,\n                                              std::vector<double>* result) {\n  (*result)[0] = -q[0];\n}\n\ninline void compute_harmonice_oscillator_velocity(std::vector<double> const& p,\n                                                  std::vector<double>* result) {\n  (*result)[0] = p[0];\n}\n\n}  \/\/ namespace\n\nclass SPRKTest : public testing::Test {\n protected:\n  void SetUp() override {\n    integrator_.reset(new SPRKIntegrator);\n    parameters_.reset(new SPRKIntegrator::Parameters);\n    solution_.reset(new SPRKIntegrator::Solution);\n  }\n\n  std::unique_ptr<SPRKIntegrator> integrator_;\n  std::unique_ptr<SPRKIntegrator::Parameters> parameters_;\n  std::unique_ptr<SPRKIntegrator::Solution> solution_;\n};\n\nTEST_F(SPRKTest, HarmonicOscillator) {\n  parameters_->q0 = {1.0};\n  parameters_->p0 = {0.0};\n  parameters_->t0 = 0.0;\n#ifdef _DEBUG\n  parameters_->tmax = 100.0;\n#else\n  parameters_->tmax = 1000.0;\n#endif\n  parameters_->Δt = 1.0E-4;\n  parameters_->coefficients = integrator_->Order5Optimal();\n  parameters_->sampling_period = 1;\n  integrator_->Solve(&compute_harmonic_oscillator_force,\n                         &compute_harmonice_oscillator_velocity,\n                         *parameters_,\n                         solution_.get());\n  double q_error = 0;\n  double p_error = 0;\n  for (size_t i = 0; i < solution_->time.quantities.size(); ++i) {\n    q_error = std::max(q_error,\n                       std::abs(solution_->position[0].quantities[i] -\n                                std::cos(solution_->time.quantities[i])));\n    p_error = std::max(p_error,\n                       std::abs(solution_->momentum[0].quantities[i] +\n                                std::sin(solution_->time.quantities[i])));\n  }\n  LOG(ERROR) << \"q_error = \" << q_error;\n  LOG(ERROR) << \"p_error = \" << p_error;\n  EXPECT_THAT(AbsoluteError(0, q_error), Lt(2E-16 * parameters_->tmax));\n  EXPECT_THAT(AbsoluteError(0, p_error), Lt(2E-16 * parameters_->tmax));\n}\n\n}  \/\/ namespace integrators\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>{##############################################################################}\n{% macro generate_method(method, world_suffix) %}\n{% filter conditional(method.conditional_string) %}\nstatic void {{method.name}}{{method.overload_index}}Method{{world_suffix}}(const v8::FunctionCallbackInfo<v8::Value>& info)\n{\n    {% if method.name in ['addEventListener', 'removeEventListener'] %}\n    {{add_remove_event_listener_method(method.name) | indent}}\n    {% else %}\n    {% if method.number_of_required_arguments %}\n    if (UNLIKELY(info.Length() < {{method.number_of_required_arguments}})) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", ExceptionMessages::notEnoughArguments({{method.number_of_required_arguments}}, info.Length())), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    {% if not method.is_static %}\n    {{cpp_class_name}}* imp = {{v8_class_name}}::toNative(info.Holder());\n    {% endif %}\n    {% if method.is_custom_element_callbacks %}\n    CustomElementCallbackDispatcher::CallbackDeliveryScope deliveryScope;\n    {% endif %}\n    {% if method.is_raises_exception %}\n    ExceptionState exceptionState(info.Holder(), info.GetIsolate());\n    {% endif %}\n    {% if method.is_check_security_for_node %}\n    if (!BindingSecurity::shouldAllowAccessToNode(imp->{{method.name}}(exceptionState), exceptionState)) {\n        v8SetReturnValueNull(info);\n        exceptionState.throwIfNeeded();\n        return;\n    }\n    {% endif %}\n    {% for argument in method.arguments %}\n    {% if argument.is_optional and not argument.has_default and\n          argument.idl_type != 'Dictionary' %}\n    {# Optional arguments without a default value generate an early call with\n       fewer arguments if they are omitted.\n       Optional Dictionary arguments default to empty dictionary. #}\n    if (UNLIKELY(info.Length() <= {{argument.index}})) {\n        {{cpp_method_call(method, argument.v8_set_return_value, argument.cpp_value) | indent(8)}}\n        return;\n    }\n    {% endif %}\n    {% if method.is_strict_type_checking and argument.is_wrapper_type %}\n    {# Type checking for wrapper interface types (if interface not implemented,\n       throw TypeError), per http:\/\/www.w3.org\/TR\/WebIDL\/#es-interface #}\n    if (info.Length() > {{argument.index}} && !isUndefinedOrNull(info[{{argument.index}}]) && !V8{{argument.idl_type}}::hasInstance(info[{{argument.index}}], info.GetIsolate(), worldType(info.GetIsolate()))) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", \"parameter {{argument.index + 1}} is not of type '{{argument.idl_type}}'.\"), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    {% if argument.is_clamp %}\n    {# NaN is treated as 0: http:\/\/www.w3.org\/TR\/WebIDL\/#es-type-mapping #}\n    {{argument.cpp_type}} {{argument.name}} = 0;\n    V8TRYCATCH_VOID(double, {{argument.name}}NativeValue, info[{{argument.index}}]->NumberValue());\n    if (!std::isnan({{argument.name}}NativeValue))\n        {# IDL type is used for clamping, for the right bounds, since different\n           IDL integer types have same internal C++ type (int or unsigned) #}\n        {{argument.name}} = clampTo<{{argument.idl_type}}>({{argument.name}}NativeValue);\n    {% elif argument.idl_type == 'SerializedScriptValue' %}\n    bool {{argument.name}}DidThrow = false;\n    {{argument.cpp_type}} {{argument.name}} = SerializedScriptValue::create(info[{{argument.index}}], 0, 0, {{argument.name}}DidThrow, info.GetIsolate());\n    if ({{argument.name}}DidThrow)\n        return;\n    {% elif argument.is_variadic_wrapper_type %}\n    Vector<{{argument.cpp_type}} > {{argument.name}};\n    for (int i = {{argument.index}}; i < info.Length(); ++i) {\n        if (!V8{{argument.idl_type}}::hasInstance(info[i], info.GetIsolate(), worldType(info.GetIsolate()))) {\n            throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", \"parameter {{argument.index + 1}} is not of type '{{argument.idl_type}}'.\"), info.GetIsolate());\n            return;\n        }\n        {{argument.name}}.append(V8{{argument.idl_type}}::toNative(v8::Handle<v8::Object>::Cast(info[i])));\n    }\n    {% else %}\n    {{argument.v8_value_to_local_cpp_value}};\n    {% endif %}\n    {% if argument.enum_validation_expression %}\n    {# Methods throw on invalid enum values: http:\/\/www.w3.org\/TR\/WebIDL\/#idl-enums #}\n    String string = {{argument.name}};\n    if (!({{argument.enum_validation_expression}})) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", \"parameter {{argument.index + 1}} ('\" + string + \"') is not a valid enum value.\"), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    {% if argument.idl_type in ['Dictionary', 'Promise'] %}\n    if (!{{argument.name}}.isUndefinedOrNull() && !{{argument.name}}.isObject()) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", \"parameter {{argument.index + 1}} ('{{argument.name}}') is not an object.\"), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    {% endfor %}{# arguments #}\n    {{cpp_method_call(method, method.v8_set_return_value, method.cpp_value) | indent}}\n    {% endif %}{# addEventListener, removeEventListener #}\n}\n{% endfilter %}\n{% endmacro %}\n\n\n{######################################}\n{% macro add_remove_event_listener_method(method_name) %}\n{# Set template values for addEventListener vs. removeEventListener #}\n{% set listener_lookup_type, listener, hidden_dependency_action =\n    ('ListenerFindOrCreate', 'listener', 'createHiddenDependency')\n    if method_name == 'addEventListener' else\n    ('ListenerFindOnly', 'listener.get()', 'removeHiddenDependency')\n%}\nEventTarget* impl = {{v8_class_name}}::toNative(info.Holder());\nif (DOMWindow* window = impl->toDOMWindow()) {\n    ExceptionState exceptionState(info.GetIsolate());\n    if (!BindingSecurity::shouldAllowAccessToFrame(window->frame(), exceptionState)) {\n        exceptionState.throwIfNeeded();\n        return;\n    }\n    if (!window->document())\n        return;\n}\nRefPtr<EventListener> listener = V8EventListenerList::getEventListener(info[1], false, {{listener_lookup_type}});\nif (listener) {\n    V8TRYCATCH_FOR_V8STRINGRESOURCE_VOID(V8StringResource<WithNullCheck>, eventName, info[0]);\n    impl->{{method_name}}(eventName, {{listener}}, info[2]->BooleanValue());\n    if (!impl->toNode())\n        {{hidden_dependency_action}}(info.Holder(), info[1], {{v8_class_name}}::eventListenerCacheIndex, info.GetIsolate());\n}\n{% endmacro %}\n\n\n{######################################}\n{% macro cpp_method_call(method, v8_set_return_value, cpp_value) %}\n{% if method.is_call_with_script_state %}\nScriptState* currentState = ScriptState::current();\nif (!currentState)\n    return;\nScriptState& state = *currentState;\n{% endif %}\n{% if method.is_call_with_execution_context %}\nExecutionContext* scriptContext = getExecutionContext();\n{% endif %}\n{% if method.is_call_with_script_arguments %}\nRefPtr<ScriptArguments> scriptArguments(createScriptArguments(info, {{method.number_of_arguments}}));\n{% endif %}\n{% if method.idl_type == 'void' %}\n{{cpp_value}};\n{% elif method.is_call_with_script_state %}\n{# FIXME: consider always using a local variable #}\n{{method.cpp_type}} result = {{cpp_value}};\n{% endif %}\n{% if method.is_raises_exception %}\nif (exceptionState.throwIfNeeded())\n    return;\n{% endif %}\n{% if method.is_call_with_script_state %}\nif (state.hadException()) {\n    v8::Local<v8::Value> exception = state.exception();\n    state.clearException();\n    throwError(exception, info.GetIsolate());\n    return;\n}\n{% endif %}\n{% if v8_set_return_value %}{{v8_set_return_value}};{% endif %}{# None for void #}\n{% endmacro %}\n\n\n{##############################################################################}\n{% macro overload_resolution_method(overloads, world_suffix) %}\nstatic void {{overloads.name}}Method{{world_suffix}}(const v8::FunctionCallbackInfo<v8::Value>& info)\n{\n    {% for method in overloads.methods %}\n    if ({{method.overload_resolution_expression}}) {\n        {{method.name}}{{method.overload_index}}Method{{world_suffix}}(info);\n        return;\n    }\n    {% endfor %}\n    {% if overloads.minimum_number_of_required_arguments %}\n    if (UNLIKELY(info.Length() < {{overloads.minimum_number_of_required_arguments}})) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{overloads.name}}\", \"{{interface_name}}\", ExceptionMessages::notEnoughArguments({{overloads.minimum_number_of_required_arguments}}, info.Length())), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    throwUninformativeAndGenericTypeError(info.GetIsolate());\n}\n{% endmacro %}\n\n\n{##############################################################################}\n{% macro method_callback(method, world_suffix) %}\n{% filter conditional(method.conditional_string) %}\nstatic void {{method.name}}MethodCallback{{world_suffix}}(const v8::FunctionCallbackInfo<v8::Value>& info)\n{\n    TRACE_EVENT_SET_SAMPLING_STATE(\"Blink\", \"DOMMethod\");\n    {% if method.measure_as %}\n    UseCounter::count(activeDOMWindow(), UseCounter::{{method.measure_as}});\n    {% endif %}\n    {% if method.deprecate_as %}\n    UseCounter::countDeprecation(activeExecutionContext(), UseCounter::{{method.deprecate_as}});\n    {% endif %}\n    {% if world_suffix in method.activity_logging_world_list %}\n    V8PerContextData* contextData = V8PerContextData::from(info.GetIsolate()->GetCurrentContext());\n    if (contextData && contextData->activityLogger()) {\n        {# FIXME: replace toVectorOfArguments with toNativeArguments(info, 0)\n           and delete toVectorOfArguments #}\n        Vector<v8::Handle<v8::Value> > loggerArgs = toVectorOfArguments(info);\n        contextData->activityLogger()->log(\"{{interface_name}}.{{method.name}}\", info.Length(), loggerArgs.data(), \"Method\");\n    }\n    {% endif %}\n    {% if method.is_custom %}\n    {{v8_class_name}}::{{method.name}}MethodCustom(info);\n    {% else %}\n    {{cpp_class_name}}V8Internal::{{method.name}}Method{{world_suffix}}(info);\n    {% endif %}\n    TRACE_EVENT_SET_SAMPLING_STATE(\"V8\", \"Execution\");\n}\n{% endfilter %}\n{% endmacro %}\n<commit_msg>Sync Python IDL compiler to r162010<commit_after>{##############################################################################}\n{% macro generate_method(method, world_suffix) %}\n{% filter conditional(method.conditional_string) %}\nstatic void {{method.name}}{{method.overload_index}}Method{{world_suffix}}(const v8::FunctionCallbackInfo<v8::Value>& info)\n{\n    {% if method.name in ['addEventListener', 'removeEventListener'] %}\n    {{add_remove_event_listener_method(method.name) | indent}}\n    {% else %}\n    {% if method.number_of_required_arguments %}\n    if (UNLIKELY(info.Length() < {{method.number_of_required_arguments}})) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", ExceptionMessages::notEnoughArguments({{method.number_of_required_arguments}}, info.Length())), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    {% if not method.is_static %}\n    {{cpp_class_name}}* imp = {{v8_class_name}}::toNative(info.Holder());\n    {% endif %}\n    {% if method.is_custom_element_callbacks %}\n    CustomElementCallbackDispatcher::CallbackDeliveryScope deliveryScope;\n    {% endif %}\n    {% if method.is_raises_exception %}\n    ExceptionState exceptionState(info.Holder(), info.GetIsolate());\n    {% endif %}\n    {% if method.is_check_security_for_node %}\n    if (!BindingSecurity::shouldAllowAccessToNode(imp->{{method.name}}(exceptionState), exceptionState)) {\n        v8SetReturnValueNull(info);\n        exceptionState.throwIfNeeded();\n        return;\n    }\n    {% endif %}\n    {% for argument in method.arguments %}\n    {% if argument.is_optional and not argument.has_default and\n          argument.idl_type != 'Dictionary' %}\n    {# Optional arguments without a default value generate an early call with\n       fewer arguments if they are omitted.\n       Optional Dictionary arguments default to empty dictionary. #}\n    if (UNLIKELY(info.Length() <= {{argument.index}})) {\n        {{cpp_method_call(method, argument.v8_set_return_value, argument.cpp_value) | indent(8)}}\n        return;\n    }\n    {% endif %}\n    {% if method.is_strict_type_checking and argument.is_wrapper_type %}\n    {# Type checking for wrapper interface types (if interface not implemented,\n       throw TypeError), per http:\/\/www.w3.org\/TR\/WebIDL\/#es-interface #}\n    if (info.Length() > {{argument.index}} && !isUndefinedOrNull(info[{{argument.index}}]) && !V8{{argument.idl_type}}::hasInstance(info[{{argument.index}}], info.GetIsolate(), worldType(info.GetIsolate()))) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", \"parameter {{argument.index + 1}} is not of type '{{argument.idl_type}}'.\"), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    {% if argument.is_clamp %}\n    {# NaN is treated as 0: http:\/\/www.w3.org\/TR\/WebIDL\/#es-type-mapping #}\n    {{argument.cpp_type}} {{argument.name}} = 0;\n    V8TRYCATCH_VOID(double, {{argument.name}}NativeValue, info[{{argument.index}}]->NumberValue());\n    if (!std::isnan({{argument.name}}NativeValue))\n        {# IDL type is used for clamping, for the right bounds, since different\n           IDL integer types have same internal C++ type (int or unsigned) #}\n        {{argument.name}} = clampTo<{{argument.idl_type}}>({{argument.name}}NativeValue);\n    {% elif argument.idl_type == 'SerializedScriptValue' %}\n    bool {{argument.name}}DidThrow = false;\n    {{argument.cpp_type}} {{argument.name}} = SerializedScriptValue::create(info[{{argument.index}}], 0, 0, {{argument.name}}DidThrow, info.GetIsolate());\n    if ({{argument.name}}DidThrow)\n        return;\n    {% elif argument.is_variadic_wrapper_type %}\n    Vector<{{argument.cpp_type}} > {{argument.name}};\n    for (int i = {{argument.index}}; i < info.Length(); ++i) {\n        if (!V8{{argument.idl_type}}::hasInstance(info[i], info.GetIsolate(), worldType(info.GetIsolate()))) {\n            throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", \"parameter {{argument.index + 1}} is not of type '{{argument.idl_type}}'.\"), info.GetIsolate());\n            return;\n        }\n        {{argument.name}}.append(V8{{argument.idl_type}}::toNative(v8::Handle<v8::Object>::Cast(info[i])));\n    }\n    {% else %}\n    {{argument.v8_value_to_local_cpp_value}};\n    {% endif %}\n    {% if argument.enum_validation_expression %}\n    {# Methods throw on invalid enum values: http:\/\/www.w3.org\/TR\/WebIDL\/#idl-enums #}\n    String string = {{argument.name}};\n    if (!({{argument.enum_validation_expression}})) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", \"parameter {{argument.index + 1}} ('\" + string + \"') is not a valid enum value.\"), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    {% if argument.idl_type in ['Dictionary', 'Promise'] %}\n    if (!{{argument.name}}.isUndefinedOrNull() && !{{argument.name}}.isObject()) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{method.name}}\", \"{{interface_name}}\", \"parameter {{argument.index + 1}} ('{{argument.name}}') is not an object.\"), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    {% endfor %}{# arguments #}\n    {{cpp_method_call(method, method.v8_set_return_value, method.cpp_value) | indent}}\n    {% endif %}{# addEventListener, removeEventListener #}\n}\n{% endfilter %}\n{% endmacro %}\n\n\n{######################################}\n{% macro add_remove_event_listener_method(method_name) %}\n{# Set template values for addEventListener vs. removeEventListener #}\n{% set listener_lookup_type, listener, hidden_dependency_action =\n    ('ListenerFindOrCreate', 'listener', 'createHiddenDependency')\n    if method_name == 'addEventListener' else\n    ('ListenerFindOnly', 'listener.get()', 'removeHiddenDependency')\n%}\nEventTarget* impl = {{v8_class_name}}::toNative(info.Holder());\nif (DOMWindow* window = impl->toDOMWindow()) {\n    ExceptionState exceptionState(info.Holder(), info.GetIsolate());\n    if (!BindingSecurity::shouldAllowAccessToFrame(window->frame(), exceptionState)) {\n        exceptionState.throwIfNeeded();\n        return;\n    }\n    if (!window->document())\n        return;\n}\nRefPtr<EventListener> listener = V8EventListenerList::getEventListener(info[1], false, {{listener_lookup_type}});\nif (listener) {\n    V8TRYCATCH_FOR_V8STRINGRESOURCE_VOID(V8StringResource<WithNullCheck>, eventName, info[0]);\n    impl->{{method_name}}(eventName, {{listener}}, info[2]->BooleanValue());\n    if (!impl->toNode())\n        {{hidden_dependency_action}}(info.Holder(), info[1], {{v8_class_name}}::eventListenerCacheIndex, info.GetIsolate());\n}\n{% endmacro %}\n\n\n{######################################}\n{% macro cpp_method_call(method, v8_set_return_value, cpp_value) %}\n{% if method.is_call_with_script_state %}\nScriptState* currentState = ScriptState::current();\nif (!currentState)\n    return;\nScriptState& state = *currentState;\n{% endif %}\n{% if method.is_call_with_execution_context %}\nExecutionContext* scriptContext = getExecutionContext();\n{% endif %}\n{% if method.is_call_with_script_arguments %}\nRefPtr<ScriptArguments> scriptArguments(createScriptArguments(info, {{method.number_of_arguments}}));\n{% endif %}\n{% if method.idl_type == 'void' %}\n{{cpp_value}};\n{% elif method.is_call_with_script_state %}\n{# FIXME: consider always using a local variable #}\n{{method.cpp_type}} result = {{cpp_value}};\n{% endif %}\n{% if method.is_raises_exception %}\nif (exceptionState.throwIfNeeded())\n    return;\n{% endif %}\n{% if method.is_call_with_script_state %}\nif (state.hadException()) {\n    v8::Local<v8::Value> exception = state.exception();\n    state.clearException();\n    throwError(exception, info.GetIsolate());\n    return;\n}\n{% endif %}\n{% if v8_set_return_value %}{{v8_set_return_value}};{% endif %}{# None for void #}\n{% endmacro %}\n\n\n{##############################################################################}\n{% macro overload_resolution_method(overloads, world_suffix) %}\nstatic void {{overloads.name}}Method{{world_suffix}}(const v8::FunctionCallbackInfo<v8::Value>& info)\n{\n    {% for method in overloads.methods %}\n    if ({{method.overload_resolution_expression}}) {\n        {{method.name}}{{method.overload_index}}Method{{world_suffix}}(info);\n        return;\n    }\n    {% endfor %}\n    {% if overloads.minimum_number_of_required_arguments %}\n    if (UNLIKELY(info.Length() < {{overloads.minimum_number_of_required_arguments}})) {\n        throwTypeError(ExceptionMessages::failedToExecute(\"{{overloads.name}}\", \"{{interface_name}}\", ExceptionMessages::notEnoughArguments({{overloads.minimum_number_of_required_arguments}}, info.Length())), info.GetIsolate());\n        return;\n    }\n    {% endif %}\n    throwUninformativeAndGenericTypeError(info.GetIsolate());\n}\n{% endmacro %}\n\n\n{##############################################################################}\n{% macro method_callback(method, world_suffix) %}\n{% filter conditional(method.conditional_string) %}\nstatic void {{method.name}}MethodCallback{{world_suffix}}(const v8::FunctionCallbackInfo<v8::Value>& info)\n{\n    TRACE_EVENT_SET_SAMPLING_STATE(\"Blink\", \"DOMMethod\");\n    {% if method.measure_as %}\n    UseCounter::count(activeDOMWindow(), UseCounter::{{method.measure_as}});\n    {% endif %}\n    {% if method.deprecate_as %}\n    UseCounter::countDeprecation(activeExecutionContext(), UseCounter::{{method.deprecate_as}});\n    {% endif %}\n    {% if world_suffix in method.activity_logging_world_list %}\n    V8PerContextData* contextData = V8PerContextData::from(info.GetIsolate()->GetCurrentContext());\n    if (contextData && contextData->activityLogger()) {\n        {# FIXME: replace toVectorOfArguments with toNativeArguments(info, 0)\n           and delete toVectorOfArguments #}\n        Vector<v8::Handle<v8::Value> > loggerArgs = toVectorOfArguments(info);\n        contextData->activityLogger()->log(\"{{interface_name}}.{{method.name}}\", info.Length(), loggerArgs.data(), \"Method\");\n    }\n    {% endif %}\n    {% if method.is_custom %}\n    {{v8_class_name}}::{{method.name}}MethodCustom(info);\n    {% else %}\n    {{cpp_class_name}}V8Internal::{{method.name}}Method{{world_suffix}}(info);\n    {% endif %}\n    TRACE_EVENT_SET_SAMPLING_STATE(\"V8\", \"Execution\");\n}\n{% endfilter %}\n{% endmacro %}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef BINDING_UTILS_HPP\n#define BINDING_UTILS_HPP\n\n#include <stddef.h>\n#include <iostream>\n#include <boost\/numeric\/bindings\/size.hpp>\n#include <boost\/numeric\/bindings\/begin.hpp>\n#include <boost\/numeric\/bindings\/value_type.hpp>\n#include \"random.hpp\"\n\n\/* \\file binding_utils.hpp \n   Some useful functions to handle ublas matrices and vectors.\n   Source = boost bindings examples.\n*\/\n\nnamespace Siconos {\n  namespace algebra {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ vectors\n\n\/\/ element access:\n    template <typename V>\n    struct vct_access_traits {\n      typedef typename \n      boost::numeric::bindings::value_type<V>::type val_t;\n      typedef val_t& ref_t; \n      static ref_t elem (V& v, size_t i) { return v[i]; }\n    };\n\n    template <typename V>\n    struct vct_access_traits<V const> {\n      typedef typename \n      boost::numeric::bindings::value_type<V>::type val_t;\n      typedef val_t ref_t; \n      static ref_t elem (V const& v, size_t i) { return v[i]; }\n    };\n\n    template <typename V>\n    inline\n    typename vct_access_traits<V>::ref_t elem_v (V& v, size_t i) {\n      return vct_access_traits<V>::elem (v, i); \n    }\n\n\/\/ initialization:\n    struct ident {\n      size_t operator() (size_t i) const { return i; } \n    }; \n    struct iplus1 {\n      size_t operator() (size_t i) const { return i + 1; } \n    }; \n    template <typename T>\n    struct const_val {\n      T val;\n      const_val (T v = T()) : val (v) {}\n      T operator() (size_t) const { return val; } \n      T operator() (size_t, size_t) const { return val; } \n    };  \n    struct kpp {\n      size_t val; \n      kpp (size_t v = 0) : val (v) {}\n      size_t operator() (size_t) { \n        size_t tmp = val;\n        ++val; \n        return tmp; \n      } \n      size_t operator() (size_t, size_t) { \n        size_t tmp = val;\n        ++val; \n        return tmp; \n      } \n    }; \n    template <typename T>\n    struct times_plus { \n      T s, a, b; \n      times_plus (T ss, T aa = T(), T bb = T()) : s (ss), a (aa), b (bb) {} \n      T operator() (size_t i) const { \n        return s * (T) i + a; \n      } \n      T operator() (size_t i, size_t j) const { \n        return s * ((T) i + a) + (T) j + b; \n      } \n    }; \n\n    template <typename F, typename V>\n    void init_v (V& v, F f = F()) {\n      size_t sz \n        = boost::numeric::bindings::size( v );\n      for (std::size_t i = 0; i < sz; ++i) \n        elem_v (v, i) = f (i); \n    }\n\n\/\/ printing: \n    template <typename V>\n    void print_v (V const& v, char const* ch = 0) {\n      if (ch)\n        std::cout << ch << \": \"; \n      size_t sz \n        = boost::numeric::bindings::size( v );\n      for (std::size_t i = 0; i < sz; ++i)\n        std::cout << elem_v (v, i) << \" \";\n      std::cout << std::endl; \n    }\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ matrices\n\n\/\/ element access:\n    template <typename M>\n    struct matr_access_traits {\n      typedef M mat_t;\n      typedef typename boost::numeric::bindings::value_type<mat_t>::type val_t;\n      typedef typename mat_t::reference ref_t;\n      static ref_t elem (mat_t& m, size_t i, size_t j) { return m (i, j); }\n    };\n\n#ifdef EIGEN_FORWARDDECLARATIONS_H\n    template<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\n    struct matr_access_traits<Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > {\n      typedef Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> mat_t;\n      typedef typename boost::numeric::bindings::value_type<mat_t>::type val_t;\n      typedef val_t& ref_t;\n      static ref_t elem (mat_t& m, size_t i, size_t j) { return m (i, j); }\n    };\n#endif\n\n    template <typename M>\n    struct matr_access_traits<M const> {\n      typedef M const mat_t;\n      typedef typename boost::numeric::bindings::value_type<mat_t>::type val_t;\n      typedef val_t ref_t; \n      static ref_t elem (mat_t& m, size_t i, size_t j) { return m (i, j); }\n    };\n\n    template <typename M>\n    inline\n    typename matr_access_traits<M>::ref_t elem_m (M& m, size_t i, size_t j) {\n      return matr_access_traits<M>::elem (m, i, j); \n    }\n\n\/\/ initialization: \n    struct rws {\n      size_t operator() (size_t i, size_t) const { return i; } \n    }; \n    struct rws1 {\n      size_t operator() (size_t i, size_t) const { return i + 1; } \n    }; \n    struct cls {\n      size_t operator() (size_t, size_t j) const { return j; } \n    }; \n    struct cls1 {\n      size_t operator() (size_t, size_t j) const { return j + 1; } \n    }; \n\n    template <typename F, typename M>\n    void init_m (M& m, F f = F()) {\n      size_t sz1 \n        = boost::numeric::bindings::size_row( m );\n      size_t sz2\n        = boost::numeric::bindings::size_column( m );\n      for (std::size_t i = 0; i < sz1; ++i) \n        for (std::size_t j = 0; j < sz2; ++j) \n          elem_m (m, i, j) = f (i, j); \n    }\n\n    template <typename M>\n    void init_symm (M& m, char uplo = 'f') {\n      size_t n \n        = boost::numeric::bindings::size_row( m );\n      for (size_t i = 0; i < n; ++i) {\n        elem_m (m, i, i) = n;\n        for (size_t j = i + 1; j < n; ++j) {\n          if (uplo == 'u' || uplo == 'U')\n            elem_m (m, i, j) = n - (j - i);\n          else if (uplo == 'l' || uplo == 'L')\n            elem_m (m, j, i) = n - (j - i);\n          else \n            elem_m (m, i, j) = elem_m (m, j, i) = n - (j - i);\n        }\n      }\n    }\n\n\/** Print a boost-ublas matrix\n *\/\n    template <typename M>\n    void print_m (M const& m, char const* ch = 0) {\n      if (ch)\n        std::cout << ch << \":\\n\"; \n      size_t sz1 \n        = boost::numeric::bindings::size_row( m );\n      size_t sz2\n        = boost::numeric::bindings::size_column( m );\n      for (std::size_t i = 0 ; i < sz1 ; ++i) {\n        for (std::size_t j = 0 ; j < sz2 ; ++j) \n          std::cout << elem_m (m, i, j) << \", \";\n        std::cout << std::endl; \n      }\n      \/\/  std::cout << std::endl; \n    }\n\n    template <typename M>\n    void print_m_data (M const& m, char const* ch = 0) {\n      if (ch)\n        std::cout << ch << \" data:\\n\"; \n      using namespace boost::numeric::bindings;\n      std::copy( begin_value( m ), end_value( m ), std::ostream_iterator\n                 < typename value_type< const M >::type >( std::cout, \" \" ) );\n      std::cout << std::endl; \n    }\n\n\/\/ Below are functions from boost bindings tests (see ublas_heev.hpp).\n\n    inline float conj(float v) { return v; }\n    inline double conj(double v) { return v; }\n    inline float real(float v) { return v; }\n    inline double real(double v) { return v; }\n\n\/** Fill a banded matrix with random values\n *\/\n    template <typename M>\n    void fill_banded(M& m) {\n      typedef typename M::size_type  size_type ;\n      typedef typename M::value_type value_type ;\n\n      int size = m.size2() ;\n      int band = m.upper() ;\n\n      for (int i=0; i<size; ++i) {\n        for (int j=std::max(0,i-band); j<i; ++j) m(j,i) = random_value<value_type>();\n        m(i,i) = real( random_value<value_type>() );\n      }\n    } \/\/ randomize()\n\n\/** Fill a symmetric matrix with random values\n *\/\n    template <typename M>\n    void fill_sym(M& m) {\n      typedef typename M::size_type  size_type ;\n      typedef typename M::value_type value_type ;\n\n      int size = m.size2() ;\n\n      for (int i=0; i<size; ++i) {\n        for (int j=0; j<i; ++j) {\n          m(j,i) = random_value<value_type>();\n          m(i,j) = conj( m(j,i) ) ;\n        }\n        m(i,i) = real( random_value<value_type>() );\n      }\n    } \/\/ randomize()\n\n\/** Fill a  matrix with random values\n *\/\n    template <typename M>\n    void fill(M& m) {\n      typedef typename M::size_type  size_type ;\n      typedef typename M::value_type value_type ;\n\n      for (int i=0; i<m.size1(); ++i) {\n        for (int j=0; j<m.size2(); ++j) {\n          m(i,j) = random_value<value_type>();\n        }\n      }\n    } \/\/ randomize()\n\n  } \/\/ Algebra namespace\n} \/\/ Siconos namespace\n#endif\n<commit_msg>silent a warning on wrong type comparison<commit_after>#ifndef BINDING_UTILS_HPP\n#define BINDING_UTILS_HPP\n\n#include <stddef.h>\n#include <iostream>\n#include <boost\/numeric\/bindings\/size.hpp>\n#include <boost\/numeric\/bindings\/begin.hpp>\n#include <boost\/numeric\/bindings\/value_type.hpp>\n#include \"random.hpp\"\n\n\/* \\file binding_utils.hpp \n   Some useful functions to handle ublas matrices and vectors.\n   Source = boost bindings examples.\n*\/\n\nnamespace Siconos {\n  namespace algebra {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ vectors\n\n\/\/ element access:\n    template <typename V>\n    struct vct_access_traits {\n      typedef typename \n      boost::numeric::bindings::value_type<V>::type val_t;\n      typedef val_t& ref_t; \n      static ref_t elem (V& v, size_t i) { return v[i]; }\n    };\n\n    template <typename V>\n    struct vct_access_traits<V const> {\n      typedef typename \n      boost::numeric::bindings::value_type<V>::type val_t;\n      typedef val_t ref_t; \n      static ref_t elem (V const& v, size_t i) { return v[i]; }\n    };\n\n    template <typename V>\n    inline\n    typename vct_access_traits<V>::ref_t elem_v (V& v, size_t i) {\n      return vct_access_traits<V>::elem (v, i); \n    }\n\n\/\/ initialization:\n    struct ident {\n      size_t operator() (size_t i) const { return i; } \n    }; \n    struct iplus1 {\n      size_t operator() (size_t i) const { return i + 1; } \n    }; \n    template <typename T>\n    struct const_val {\n      T val;\n      const_val (T v = T()) : val (v) {}\n      T operator() (size_t) const { return val; } \n      T operator() (size_t, size_t) const { return val; } \n    };  \n    struct kpp {\n      size_t val; \n      kpp (size_t v = 0) : val (v) {}\n      size_t operator() (size_t) { \n        size_t tmp = val;\n        ++val; \n        return tmp; \n      } \n      size_t operator() (size_t, size_t) { \n        size_t tmp = val;\n        ++val; \n        return tmp; \n      } \n    }; \n    template <typename T>\n    struct times_plus { \n      T s, a, b; \n      times_plus (T ss, T aa = T(), T bb = T()) : s (ss), a (aa), b (bb) {} \n      T operator() (size_t i) const { \n        return s * (T) i + a; \n      } \n      T operator() (size_t i, size_t j) const { \n        return s * ((T) i + a) + (T) j + b; \n      } \n    }; \n\n    template <typename F, typename V>\n    void init_v (V& v, F f = F()) {\n      size_t sz \n        = boost::numeric::bindings::size( v );\n      for (std::size_t i = 0; i < sz; ++i) \n        elem_v (v, i) = f (i); \n    }\n\n\/\/ printing: \n    template <typename V>\n    void print_v (V const& v, char const* ch = 0) {\n      if (ch)\n        std::cout << ch << \": \"; \n      size_t sz \n        = boost::numeric::bindings::size( v );\n      for (std::size_t i = 0; i < sz; ++i)\n        std::cout << elem_v (v, i) << \" \";\n      std::cout << std::endl; \n    }\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ matrices\n\n\/\/ element access:\n    template <typename M>\n    struct matr_access_traits {\n      typedef M mat_t;\n      typedef typename boost::numeric::bindings::value_type<mat_t>::type val_t;\n      typedef typename mat_t::reference ref_t;\n      static ref_t elem (mat_t& m, size_t i, size_t j) { return m (i, j); }\n    };\n\n#ifdef EIGEN_FORWARDDECLARATIONS_H\n    template<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\n    struct matr_access_traits<Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > {\n      typedef Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> mat_t;\n      typedef typename boost::numeric::bindings::value_type<mat_t>::type val_t;\n      typedef val_t& ref_t;\n      static ref_t elem (mat_t& m, size_t i, size_t j) { return m (i, j); }\n    };\n#endif\n\n    template <typename M>\n    struct matr_access_traits<M const> {\n      typedef M const mat_t;\n      typedef typename boost::numeric::bindings::value_type<mat_t>::type val_t;\n      typedef val_t ref_t; \n      static ref_t elem (mat_t& m, size_t i, size_t j) { return m (i, j); }\n    };\n\n    template <typename M>\n    inline\n    typename matr_access_traits<M>::ref_t elem_m (M& m, size_t i, size_t j) {\n      return matr_access_traits<M>::elem (m, i, j); \n    }\n\n\/\/ initialization: \n    struct rws {\n      size_t operator() (size_t i, size_t) const { return i; } \n    }; \n    struct rws1 {\n      size_t operator() (size_t i, size_t) const { return i + 1; } \n    }; \n    struct cls {\n      size_t operator() (size_t, size_t j) const { return j; } \n    }; \n    struct cls1 {\n      size_t operator() (size_t, size_t j) const { return j + 1; } \n    }; \n\n    template <typename F, typename M>\n    void init_m (M& m, F f = F()) {\n      size_t sz1 \n        = boost::numeric::bindings::size_row( m );\n      size_t sz2\n        = boost::numeric::bindings::size_column( m );\n      for (std::size_t i = 0; i < sz1; ++i) \n        for (std::size_t j = 0; j < sz2; ++j) \n          elem_m (m, i, j) = f (i, j); \n    }\n\n    template <typename M>\n    void init_symm (M& m, char uplo = 'f') {\n      size_t n \n        = boost::numeric::bindings::size_row( m );\n      for (size_t i = 0; i < n; ++i) {\n        elem_m (m, i, i) = n;\n        for (size_t j = i + 1; j < n; ++j) {\n          if (uplo == 'u' || uplo == 'U')\n            elem_m (m, i, j) = n - (j - i);\n          else if (uplo == 'l' || uplo == 'L')\n            elem_m (m, j, i) = n - (j - i);\n          else \n            elem_m (m, i, j) = elem_m (m, j, i) = n - (j - i);\n        }\n      }\n    }\n\n\/** Print a boost-ublas matrix\n *\/\n    template <typename M>\n    void print_m (M const& m, char const* ch = 0) {\n      if (ch)\n        std::cout << ch << \":\\n\"; \n      size_t sz1 \n        = boost::numeric::bindings::size_row( m );\n      size_t sz2\n        = boost::numeric::bindings::size_column( m );\n      for (std::size_t i = 0 ; i < sz1 ; ++i) {\n        for (std::size_t j = 0 ; j < sz2 ; ++j) \n          std::cout << elem_m (m, i, j) << \", \";\n        std::cout << std::endl; \n      }\n      \/\/  std::cout << std::endl; \n    }\n\n    template <typename M>\n    void print_m_data (M const& m, char const* ch = 0) {\n      if (ch)\n        std::cout << ch << \" data:\\n\"; \n      using namespace boost::numeric::bindings;\n      std::copy( begin_value( m ), end_value( m ), std::ostream_iterator\n                 < typename value_type< const M >::type >( std::cout, \" \" ) );\n      std::cout << std::endl; \n    }\n\n\/\/ Below are functions from boost bindings tests (see ublas_heev.hpp).\n\n    inline float conj(float v) { return v; }\n    inline double conj(double v) { return v; }\n    inline float real(float v) { return v; }\n    inline double real(double v) { return v; }\n\n\/** Fill a banded matrix with random values\n *\/\n    template <typename M>\n    void fill_banded(M& m) {\n      typedef typename M::size_type  size_type ;\n      typedef typename M::value_type value_type ;\n\n      int size = m.size2() ;\n      int band = m.upper() ;\n\n      for (int i=0; i<size; ++i) {\n        for (int j=std::max(0,i-band); j<i; ++j) m(j,i) = random_value<value_type>();\n        m(i,i) = real( random_value<value_type>() );\n      }\n    } \/\/ randomize()\n\n\/** Fill a symmetric matrix with random values\n *\/\n    template <typename M>\n    void fill_sym(M& m) {\n      typedef typename M::size_type  size_type ;\n      typedef typename M::value_type value_type ;\n\n      int size = m.size2() ;\n\n      for (int i=0; i<size; ++i) {\n        for (int j=0; j<i; ++j) {\n          m(j,i) = random_value<value_type>();\n          m(i,j) = conj( m(j,i) ) ;\n        }\n        m(i,i) = real( random_value<value_type>() );\n      }\n    } \/\/ randomize()\n\n\/** Fill a  matrix with random values\n *\/\n    template <typename M>\n    void fill(M& m) {\n      typedef typename M::size_type  size_type ;\n      typedef typename M::value_type value_type ;\n\n      for (size_type i=0; i<m.size1(); ++i) {\n        for (size_type j=0; j<m.size2(); ++j) {\n          m(i,j) = random_value<value_type>();\n        }\n      }\n    } \/\/ randomize()\n\n  } \/\/ Algebra namespace\n} \/\/ Siconos namespace\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n ********************************************************************************\n ***************************** Implementation Details ***************************\n ********************************************************************************\n *\/\n#ifndef _Stroika_Foundation_Debug_Trace_inl_\n#define _Stroika_Foundation_Debug_Trace_inl_ 1\n\n#if qTraceToFile\n#include <filesystem>\n#endif\n\nCompileTimeFlagChecker_HEADER (Stroika::Foundation::Debug, qTraceToFile, qTraceToFile);\nCompileTimeFlagChecker_HEADER (Stroika::Foundation::Debug, qDefaultTracingOn, qDefaultTracingOn);\n\nnamespace Stroika::Foundation::Debug {\n\n    \/*\n     ********************************************************************************\n     ******************************* Trace::Emitter *********************************\n     ********************************************************************************\n     *\/\n    template <typename CHARTYPE>\n    inline void Emitter::EmitUnadornedText (const CHARTYPE* p)\n    {\n        DoEmit_ (p);\n    }\n\n    \/*\n     ********************************************************************************\n     ******************************* TraceContextBumper *****************************\n     ********************************************************************************\n     *\/\n    inline TraceContextBumper::TraceContextBumper () noexcept\n#if qDefaultTracingOn\n        : fDoEndMarker (false)\n#endif\n    {\n#if qDefaultTracingOn\n        IncCount_ ();\n#endif\n    }\n#if !qDefaultTracingOn\n    inline TraceContextBumper::TraceContextBumper ([[maybe_unused]] const wchar_t* contextName) noexcept\n    {\n    }\n    inline TraceContextBumper::TraceContextBumper ([[maybe_unused]] const wchar_t* contextName, [[maybe_unused]] const wchar_t* extraFmt, ...) noexcept\n    {\n    }\n    inline TraceContextBumper::TraceContextBumper ([[maybe_unused]] const char* contextName) noexcept\n    {\n    }\n    inline TraceContextBumper::~TraceContextBumper ()\n    {\n    }\n#endif\n\n\n    namespace Private_ {\n        struct TraceModuleData_ {\n            TraceModuleData_ ();\n            ~TraceModuleData_ ();\n\n            Emitter fEmitter;\n#if qTraceToFile\n            filesystem::path fTraceFileName;\n#endif\n        };\n    }\n\n}\n\nnamespace {\n    Stroika::Foundation::Execution::ModuleInitializer<Stroika::Foundation::Debug::Private_::TraceModuleData_> _Stroika_Foundation_Debug_Trace_ModuleData_; \/\/ this object constructed for the CTOR\/DTOR per-module side-effects\n}\n\ninline Stroika::Foundation::Debug::Emitter& Stroika::Foundation::Debug::Emitter::Get () noexcept\n{\n    return Execution::ModuleInitializer<Private_::TraceModuleData_>::Actual ().fEmitter;\n}\n#endif \/*_Stroika_Foundation_Debug_Trace_inl_*\/\n<commit_msg>cosmetic<commit_after>\n\/*\n ********************************************************************************\n ***************************** Implementation Details ***************************\n ********************************************************************************\n *\/\n#ifndef _Stroika_Foundation_Debug_Trace_inl_\n#define _Stroika_Foundation_Debug_Trace_inl_ 1\n\n#if qTraceToFile\n#include <filesystem>\n#endif\n\nCompileTimeFlagChecker_HEADER (Stroika::Foundation::Debug, qTraceToFile, qTraceToFile);\nCompileTimeFlagChecker_HEADER (Stroika::Foundation::Debug, qDefaultTracingOn, qDefaultTracingOn);\n\nnamespace Stroika::Foundation::Debug {\n\n    \/*\n     ********************************************************************************\n     ******************************* Trace::Emitter *********************************\n     ********************************************************************************\n     *\/\n    template <typename CHARTYPE>\n    inline void Emitter::EmitUnadornedText (const CHARTYPE* p)\n    {\n        DoEmit_ (p);\n    }\n\n    \/*\n     ********************************************************************************\n     ******************************* TraceContextBumper *****************************\n     ********************************************************************************\n     *\/\n    inline TraceContextBumper::TraceContextBumper () noexcept\n#if qDefaultTracingOn\n        : fDoEndMarker (false)\n#endif\n    {\n#if qDefaultTracingOn\n        IncCount_ ();\n#endif\n    }\n#if !qDefaultTracingOn\n    inline TraceContextBumper::TraceContextBumper ([[maybe_unused]] const wchar_t* contextName) noexcept\n    {\n    }\n    inline TraceContextBumper::TraceContextBumper ([[maybe_unused]] const wchar_t* contextName, [[maybe_unused]] const wchar_t* extraFmt, ...) noexcept\n    {\n    }\n    inline TraceContextBumper::TraceContextBumper ([[maybe_unused]] const char* contextName) noexcept\n    {\n    }\n    inline TraceContextBumper::~TraceContextBumper ()\n    {\n    }\n#endif\n\n    namespace Private_ {\n        struct TraceModuleData_ {\n            TraceModuleData_ ();\n            ~TraceModuleData_ ();\n\n            Emitter fEmitter;\n#if qTraceToFile\n            filesystem::path fTraceFileName;\n#endif\n        };\n    }\n\n}\n\nnamespace {\n    Stroika::Foundation::Execution::ModuleInitializer<Stroika::Foundation::Debug::Private_::TraceModuleData_> _Stroika_Foundation_Debug_Trace_ModuleData_; \/\/ this object constructed for the CTOR\/DTOR per-module side-effects\n}\n\ninline Stroika::Foundation::Debug::Emitter& Stroika::Foundation::Debug::Emitter::Get () noexcept\n{\n    return Execution::ModuleInitializer<Private_::TraceModuleData_>::Actual ().fEmitter;\n}\n#endif \/*_Stroika_Foundation_Debug_Trace_inl_*\/\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\/\/#define _USE_MATH_DEFINES\n#include <QmitkUSNewVideoDeviceWidget.h>\n\n\/\/QT headers\n\n\n\/\/mitk headers\n\n\n\/\/itk headers\n\n\nconst std::string QmitkUSNewVideoDeviceWidget::VIEW_ID = \"org.mitk.views.QmitkUSNewVideoDeviceWidget\";\n\nQmitkUSNewVideoDeviceWidget::QmitkUSNewVideoDeviceWidget(QWidget* parent, Qt::WindowFlags f): QWidget(parent, f)\n{\n  m_Controls = NULL;\n  CreateQtPartControl(this);\n}\n\nQmitkUSNewVideoDeviceWidget::~QmitkUSNewVideoDeviceWidget()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ INITIALIZATION \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid QmitkUSNewVideoDeviceWidget::CreateQtPartControl(QWidget *parent)\n{\n  if (!m_Controls)\n  {\n    \/\/ create GUI widgets\n    m_Controls = new Ui::QmitkUSNewVideoDeviceWidgetControls;\n    m_Controls->setupUi(parent);\n    this->CreateConnections();\n  }\n}\n\nvoid QmitkUSNewVideoDeviceWidget::CreateConnections()\n{\n  if ( m_Controls )\n  {\n    connect( m_Controls->m_BtnDone,   SIGNAL(clicked()), this, SLOT(OnClickedDone()) );\n    connect( m_Controls->m_BtnCancel, SIGNAL(clicked()), this, SLOT(OnClickedCancel()) );\n    connect( m_Controls->m_RadioDeviceSource, SIGNAL(clicked()), this, SLOT(OnDeviceTypeSelection()) );\n    connect( m_Controls->m_RadioFileSource,   SIGNAL(clicked()), this, SLOT(OnDeviceTypeSelection()) );\n\n  }\n  \/\/ Hide & show stuff\n  m_Controls->m_FilePathSelector->setVisible(false);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/ Methods & Slots Handling Direct Interaction \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid QmitkUSNewVideoDeviceWidget::OnClickedDone(){\n   m_Active = false;\n  MITK_INFO << \"NewDeviceWidget: ClickedDone()\";\n  \n  \/\/ Assemble Metadata\n  mitk::USImageMetadata::Pointer metadata = mitk::USImageMetadata::New();\n  metadata->SetDeviceComment(m_Controls->m_Comment->text().toStdString());\n  metadata->SetDeviceModel(m_Controls->m_Model->text().toStdString());\n  metadata->SetDeviceManufacturer(m_Controls->m_Manufacturer->text().toStdString());\n  metadata->SetProbeName(m_Controls->m_Probe->text().toStdString());\n  metadata->SetZoom(m_Controls->m_Zoom->text().toStdString());\n\n\n  \/\/ Create Device\n  mitk::USVideoDevice::Pointer newDevice;\n  if (m_Controls->m_RadioDeviceSource->isChecked()){\n    int deviceID = m_Controls->m_DeviceSelector->value();\n    newDevice = mitk::USVideoDevice::New(deviceID, metadata);\n  } else {\n    std::string filepath = m_Controls->m_FilePathSelector->text().toStdString();\n    newDevice = mitk::USVideoDevice::New(filepath, metadata);\n  }\n\n  newDevice->Connect();\n\n  emit Finished();\n}\n\nvoid QmitkUSNewVideoDeviceWidget::OnClickedCancel(){\n  m_TargetDevice = 0;\n  m_Active = false;\n   MITK_INFO << \"NewDeviceWidget: OnClickedCancel()\";\n  emit Finished();\n\n}\n\nvoid QmitkUSNewVideoDeviceWidget::OnDeviceTypeSelection(){\n  m_Controls->m_FilePathSelector->setVisible(m_Controls->m_RadioFileSource->isChecked());\n  m_Controls->m_DeviceSelector->setVisible(m_Controls->m_RadioDeviceSource->isChecked());\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Methods & Slots Handling Logic \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid QmitkUSNewVideoDeviceWidget::EditDevice(mitk::USDevice::Pointer device)\n{\n  \/\/ If no VideoDevice is given, throw an exception\n  if (device->GetClassName().compare(\"org.mitk.modules.us.USVideoDevice\") != 0){\n    \/\/ TODO Alert if bad path\n    mitkThrow() << \"NewVideoDevcieWidget recieved an incompatible Device Type to edit. Devicetype was: \" << device->GetClassName();\n  }\n  MITK_INFO << \"NewDeviceWidget: EditDevice()\";\n  m_TargetDevice = static_cast<mitk::USVideoDevice*> (device.GetPointer());\n  m_Active = true;\n}\n\n\nvoid QmitkUSNewVideoDeviceWidget::CreateNewDevice()\n{\n  MITK_INFO << \"NewDeviceWidget: CreateNewDevice()\";\n  m_TargetDevice = 0;\n  InitFields(mitk::USImageMetadata::New());\n  m_Active = true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ HOUSEHOLDING CODE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQListWidgetItem* QmitkUSNewVideoDeviceWidget::ConstructItemFromDevice(mitk::USDevice::Pointer device){\n  QListWidgetItem *result = new QListWidgetItem;\n  std::string text = device->GetDeviceManufacturer() + \"|\" + device->GetDeviceModel();\n  result->setText(text.c_str());\n  return result;\n}\n\nvoid QmitkUSNewVideoDeviceWidget::InitFields(mitk::USImageMetadata::Pointer metadata){\n  this->m_Controls->m_Manufacturer->setText (metadata->GetDeviceManufacturer().c_str());\n  this->m_Controls->m_Model->setText (metadata->GetDeviceModel().c_str());\n  this->m_Controls->m_Comment->setText (metadata->GetDeviceComment().c_str());\n  this->m_Controls->m_Probe->setText (metadata->GetProbeName().c_str());\n  this->m_Controls->m_Zoom->setText (metadata->GetZoom().c_str());\n}\n<commit_msg>Fixing DeviceClass behaviour in NewVideoDeviceWidget<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\/\/#define _USE_MATH_DEFINES\n#include <QmitkUSNewVideoDeviceWidget.h>\n\n\/\/QT headers\n\n\n\/\/mitk headers\n\n\n\/\/itk headers\n\n\nconst std::string QmitkUSNewVideoDeviceWidget::VIEW_ID = \"org.mitk.views.QmitkUSNewVideoDeviceWidget\";\n\nQmitkUSNewVideoDeviceWidget::QmitkUSNewVideoDeviceWidget(QWidget* parent, Qt::WindowFlags f): QWidget(parent, f)\n{\n  m_Controls = NULL;\n  CreateQtPartControl(this);\n}\n\nQmitkUSNewVideoDeviceWidget::~QmitkUSNewVideoDeviceWidget()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ INITIALIZATION \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid QmitkUSNewVideoDeviceWidget::CreateQtPartControl(QWidget *parent)\n{\n  if (!m_Controls)\n  {\n    \/\/ create GUI widgets\n    m_Controls = new Ui::QmitkUSNewVideoDeviceWidgetControls;\n    m_Controls->setupUi(parent);\n    this->CreateConnections();\n  }\n}\n\nvoid QmitkUSNewVideoDeviceWidget::CreateConnections()\n{\n  if ( m_Controls )\n  {\n    connect( m_Controls->m_BtnDone,   SIGNAL(clicked()), this, SLOT(OnClickedDone()) );\n    connect( m_Controls->m_BtnCancel, SIGNAL(clicked()), this, SLOT(OnClickedCancel()) );\n    connect( m_Controls->m_RadioDeviceSource, SIGNAL(clicked()), this, SLOT(OnDeviceTypeSelection()) );\n    connect( m_Controls->m_RadioFileSource,   SIGNAL(clicked()), this, SLOT(OnDeviceTypeSelection()) );\n\n  }\n  \/\/ Hide & show stuff\n  m_Controls->m_FilePathSelector->setVisible(false);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/ Methods & Slots Handling Direct Interaction \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid QmitkUSNewVideoDeviceWidget::OnClickedDone(){\n   m_Active = false;\n  MITK_INFO << \"NewDeviceWidget: ClickedDone()\";\n  \n  \/\/ Assemble Metadata\n  mitk::USImageMetadata::Pointer metadata = mitk::USImageMetadata::New();\n  metadata->SetDeviceComment(m_Controls->m_Comment->text().toStdString());\n  metadata->SetDeviceModel(m_Controls->m_Model->text().toStdString());\n  metadata->SetDeviceManufacturer(m_Controls->m_Manufacturer->text().toStdString());\n  metadata->SetProbeName(m_Controls->m_Probe->text().toStdString());\n  metadata->SetZoom(m_Controls->m_Zoom->text().toStdString());\n\n\n  \/\/ Create Device\n  mitk::USVideoDevice::Pointer newDevice;\n  if (m_Controls->m_RadioDeviceSource->isChecked()){\n    int deviceID = m_Controls->m_DeviceSelector->value();\n    newDevice = mitk::USVideoDevice::New(deviceID, metadata);\n  } else {\n    std::string filepath = m_Controls->m_FilePathSelector->text().toStdString();\n    newDevice = mitk::USVideoDevice::New(filepath, metadata);\n  }\n\n  newDevice->Connect();\n\n  emit Finished();\n}\n\nvoid QmitkUSNewVideoDeviceWidget::OnClickedCancel(){\n  m_TargetDevice = 0;\n  m_Active = false;\n   MITK_INFO << \"NewDeviceWidget: OnClickedCancel()\";\n  emit Finished();\n\n}\n\nvoid QmitkUSNewVideoDeviceWidget::OnDeviceTypeSelection(){\n  m_Controls->m_FilePathSelector->setVisible(m_Controls->m_RadioFileSource->isChecked());\n  m_Controls->m_DeviceSelector->setVisible(m_Controls->m_RadioDeviceSource->isChecked());\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Methods & Slots Handling Logic \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid QmitkUSNewVideoDeviceWidget::EditDevice(mitk::USDevice::Pointer device)\n{\n  \/\/ If no VideoDevice is given, throw an exception\n  if (device->GetDeviceClass().compare(\"org.mitk.modules.us.USVideoDevice\") != 0){\n    \/\/ TODO Alert if bad path\n    mitkThrow() << \"NewVideoDevcieWidget recieved an incompatible Device Type to edit. Devicetype was: \" << device->GetDeviceClass();\n  }\n  MITK_INFO << \"NewDeviceWidget: EditDevice()\";\n  m_TargetDevice = static_cast<mitk::USVideoDevice*> (device.GetPointer());\n  m_Active = true;\n}\n\n\nvoid QmitkUSNewVideoDeviceWidget::CreateNewDevice()\n{\n  MITK_INFO << \"NewDeviceWidget: CreateNewDevice()\";\n  m_TargetDevice = 0;\n  InitFields(mitk::USImageMetadata::New());\n  m_Active = true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ HOUSEHOLDING CODE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQListWidgetItem* QmitkUSNewVideoDeviceWidget::ConstructItemFromDevice(mitk::USDevice::Pointer device){\n  QListWidgetItem *result = new QListWidgetItem;\n  std::string text = device->GetDeviceManufacturer() + \"|\" + device->GetDeviceModel();\n  result->setText(text.c_str());\n  return result;\n}\n\nvoid QmitkUSNewVideoDeviceWidget::InitFields(mitk::USImageMetadata::Pointer metadata){\n  this->m_Controls->m_Manufacturer->setText (metadata->GetDeviceManufacturer().c_str());\n  this->m_Controls->m_Model->setText (metadata->GetDeviceModel().c_str());\n  this->m_Controls->m_Comment->setText (metadata->GetDeviceComment().c_str());\n  this->m_Controls->m_Probe->setText (metadata->GetProbeName().c_str());\n  this->m_Controls->m_Zoom->setText (metadata->GetZoom().c_str());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"SoundService.h\"\r\n#include \"..\/Logger.h\"\r\n#include \"..\/Helpers\/Helpers.h\"\r\n\r\n\r\n#ifdef ANDROID\r\n#include \"..\/Assets\/Resource.h\"\r\n#endif\r\n\r\nnamespace star\r\n{\r\n\tSoundService * SoundService::mSoundService = nullptr;\r\n\tbool SoundService::mbIsInitialized = false;\r\n\r\n\tSoundService * SoundService::GetInstance()\r\n\t{\r\n\t\tif(mSoundService == nullptr)\r\n\t\t{\r\n\t\t\tmSoundService = new SoundService();\r\n\t\t}\r\n\t\treturn mSoundService;\r\n\t}\r\n\r\n\tSoundService::SoundService()\r\n#ifdef ANDROID\r\n\t\t:mEngine(NULL),\r\n\t\tmEngineObj(NULL),\r\n\t\tmOutputMixObj(NULL),\r\n\t\tm_CurrentSoundEffect(nullptr),\r\n\t\tm_CurrentSoundFile(nullptr)\r\n#endif\r\n\t{\r\n\t\tmQueueIterator = mBackgroundQueue.begin();\r\n\t}\r\n\r\n\tSoundService::~SoundService()\r\n\t{\r\n\t\tfor(auto music : mMusicList)\r\n\t\t{\r\n\t\t\tdelete music.second;\r\n\t\t\tmusic.second = nullptr;\r\n\t\t}\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\tdelete effect.second;\r\n\t\t\teffect.second = nullptr;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::Start()\r\n\t{\r\n\t\tif(mbIsInitialized) return;\r\n\r\n\t\tmbIsInitialized = true;\r\n\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : Started making Audio Engine\"));\r\n\r\n#ifdef DESKTOP\r\n\t\tint32 audio_rate(44100);\r\n\t\tuint16 audio_format(MIX_DEFAULT_FORMAT);\r\n\t\tint32 audio_channels(2);\r\n\t\tint32 audio_buffers(4096);\r\n\r\n\t\tSDL_Init(SDL_INIT_AUDIO);\r\n\t\tint flags = MIX_INIT_OGG | MIX_INIT_MP3;\r\n\t\tint innited = Mix_Init(flags);\r\n\t\tif((innited & flags) != flags)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, \r\n\t\t\t\t_T(\"Audio :Could not init Ogg and Mp3, reason : \") + string_cast<tstring>(Mix_GetError()));\r\n\t\t}\r\n\r\n\t\tif(Mix_OpenAudio(audio_rate, audio_format,audio_channels,audio_buffers))\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : Could Not open Audio Mix SDL\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\t\/\/check What we got\r\n\t\tint32 actual_rate, actual_channels;\r\n\t\tuint16 actual_format;\r\n\r\n\t\tMix_QuerySpec(&actual_rate,&actual_format,&actual_channels);\r\n\t\ttstringstream buffer;\r\n\t\tbuffer << \"Actual Rate : \" << actual_rate << \", Actual Format : \" << actual_format \r\n\t\t\t<< \", Actual Channels : \" << actual_channels << std::endl;\r\n\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : SDL specs : \")+buffer.str());\r\n\t\tMix_Volume(-1,100);\r\n#else\r\n\t\t\r\n\t\tSLresult lRes;\r\n\t\tconst SLuint32 lEngineMixIIDCount =1;\r\n\t\tconst SLInterfaceID lEngineMixIIDs[]={SL_IID_ENGINE};\r\n\t\tconst SLboolean lEngineMixReqs[]={SL_BOOLEAN_TRUE};\r\n\t\tconst SLuint32 lOutputMixIIDCount=0;\r\n\t\tconst SLInterfaceID lOutputMixIIDs[]={};\r\n\t\tconst SLboolean lOutputMixReqs[]={};\r\n\r\n\t\tlRes = slCreateEngine(&mEngineObj, 0, NULL, lEngineMixIIDCount, lEngineMixIIDs, lEngineMixReqs);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't make Audio Engine\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlRes = (*mEngineObj)->Realize(mEngineObj, SL_BOOLEAN_FALSE);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't realize Engine\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlRes = (*mEngineObj)->GetInterface(mEngineObj,SL_IID_ENGINE, &mEngine);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't fetch engine interface\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlRes = (*mEngine)->CreateOutputMix(mEngine, &mOutputMixObj, lOutputMixIIDCount, lOutputMixIIDs,lOutputMixReqs);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't create outputmix\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlRes = (*mOutputMixObj)->Realize(mOutputMixObj,SL_BOOLEAN_FALSE);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't realise output object\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : Succesfull made Audio Engine\"));\r\n#endif\r\n\t}\r\n\r\n\tvoid SoundService::Stop()\r\n\t{\r\n\t\tStopAllSound();\r\n\t\tDeleteAllSound();\r\n\r\n#ifdef DESKTOP\r\n\t\tMix_CloseAudio();\r\n\t\tMix_Quit();\r\n\t\tSDL_Quit();\r\n#else\r\n\t\tif(mOutputMixObj != NULL)\r\n\t\t{\r\n\t\t\t(*mOutputMixObj)->Destroy(mOutputMixObj);\r\n\t\t\tmOutputMixObj = NULL;\r\n\t\t}\r\n\t\tif(mEngineObj != NULL)\r\n\t\t{\r\n\t\t\t(*mEngineObj)->Destroy(mEngineObj);\r\n\t\t\tmEngineObj = NULL;\r\n\t\t\tmEngine = NULL;\r\n\t\t}\r\n#endif\r\n\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : Stopped audio Engine\"));\r\n\t}\r\n\r\n\tvoid SoundService::LoadMusic(const tstring& path, const tstring& name)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tif(mMusicList.find(name) != mMusicList.end())\r\n\t\t{\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tauto pathit = mMusicPathList.find(path);\r\n\t\tif(pathit != mMusicPathList.end())\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(LogLevel::Warning,_T(\"Sound Service : Sound File Path Already Exists\"));\r\n\t\t\ttstring nameold = pathit->second;\r\n\t\t\tauto nameit = mMusicList.find(nameold);\r\n\t\t\tif(nameit != mMusicList.end())\r\n\t\t\t{\r\n\t\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Found sound file of old path, making copy for new name\"));\r\n\t\t\t\tmMusicList[name]=nameit->second;\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\tmMusicPathList.erase(pathit);\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tSoundFile* music = new SoundFile(path);\r\n\t\tmMusicList[name] = music;\r\n\t\tmMusicPathList[path]=name;\r\n\t\treturn;\r\n\t}\r\n\r\n\tvoid SoundService::LoadSoundEffect(const tstring& path, const tstring& name)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tif(mEffectsList.find(name) != mEffectsList.end())\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(LogLevel::Warning,_T(\"Sound Service : That effect already excists.\"));\r\n\t\t}\r\n\r\n\t\tauto pathit = mSoundEffectPathList.find(path);\r\n\t\tif(pathit != mSoundEffectPathList.end())\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(LogLevel::Warning,_T(\"Sound Service : Sound Effect Path Already Exists\"));\r\n\t\t\ttstring nameold = pathit->second;\r\n\t\t\tauto nameit = mMusicList.find(nameold);\r\n\t\t\tif(nameit!= mMusicList.end())\r\n\t\t\t{\r\n\t\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Found Sound Effect of old path, making copy for new name\"));\r\n\t\t\t\tmMusicList[name] = nameit->second;\r\n\t\t\t}\r\n\t\t\tmSoundEffectPathList.erase(pathit);\r\n\t\t}\r\n\r\n\t\tSoundEffect* effect = new SoundEffect(path);\r\n\t\tmEffectsList[name] = effect;\r\n\t\tmSoundEffectPathList[path] = name;\r\n\t}\r\n\r\n\tvoid SoundService::PlaySoundFile(const tstring& path, const tstring& name, int loopTimes)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tif(mMusicList.find(name) == mMusicList.end())\r\n\t\t{\r\n\t\t\tLoadMusic(path,name);\r\n\t\t}\r\n\t\treturn PlaySoundFile(name,loopTimes);\r\n\t}\r\n\r\n\tvoid SoundService::PlaySoundFile(const tstring& name, int loopTimes)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tauto it = mMusicList.find(name);\r\n\t\tif(it != mMusicList.end())\r\n\t\t{\r\n\t\t\tif(m_CurrentSoundFile != nullptr) m_CurrentSoundFile->Stop();\r\n\t\t\tm_CurrentSoundFile = mMusicList[name];\r\n\t\t\tm_CurrentSoundFile->Play(loopTimes);\r\n\t\t\treturn;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tm_CurrentSoundFile = nullptr;\r\n\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Couldn't find song '\") + name + _T(\"'.\"));\r\n\t\t}\r\n\t\t\r\n\t}\r\n\r\n\tvoid SoundService::PlaySoundEffect(const tstring& path, const tstring& name, int loopTimes=0)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tif(mEffectsList.find(name) == mEffectsList.end())\r\n\t\t{\r\n\t\t\tLoadSoundEffect(path,name);\r\n\t\t}\r\n\t\tPlaySoundEffect(name,loopTimes);\r\n\t}\r\n\r\n\tvoid SoundService::PlaySoundEffect(const tstring& name, int loopTimes=0)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tauto it = mEffectsList.find(name);\r\n\t\tif(it != mEffectsList.end())\r\n\t\t{\r\n\t\t\tm_CurrentSoundEffect = mEffectsList[name];\r\n\t\t\tmEffectsList[name]->Play(loopTimes);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Couldn't find effect '\") + name + _T(\"'.\"));\r\n\t\t}\r\n\t\t\r\n\t}\r\n\r\n\tvoid SoundService::AddToBackgroundQueue(const tstring& name)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tauto it = mMusicList.find(name);\r\n\t\tif(it != mMusicList.end())\r\n\t\t{\r\n\t\t\tmBackgroundQueue.push_back(mMusicList[name]);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Couldn't find background song '\") + name + _T(\"'.\"));\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::PlayBackgroundQueue()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tmQueueIterator = mBackgroundQueue.begin();\r\n\t\tif(mQueueIterator != mBackgroundQueue.end())\r\n\t\t{\r\n\t\t\t(*mQueueIterator)->PlayQueued(0);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(LogLevel::Warning,_T(\"Sound Service : No song in background queue.\"));\t\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::PlayNextSongInQueue()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\t\tif(mBackgroundQueue.size() == 0) return;\r\n\r\n\t\t++mQueueIterator;\r\n\t\tif(mQueueIterator != mBackgroundQueue.end())\r\n\t\t{\r\n\t\t\t(*mQueueIterator)->PlayQueued(0);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tmQueueIterator==mBackgroundQueue.begin();\r\n\t\t\t(*mQueueIterator)->PlayQueued(0);\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::StopSound(const tstring& name)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tauto it = mMusicList.find(name);\r\n\t\tif(it != mMusicList.end())\r\n\t\t{\r\n\t\t\tmMusicList[name]->Stop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tauto it2 = mEffectsList.find(name);\r\n\t\tif(it2 != mEffectsList.end())\r\n\t\t{\r\n\t\t\tmEffectsList[name]->Stop();\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::StopAllSound()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tfor(auto song : mMusicList)\r\n\t\t{\r\n\t\t\tsong.second->Stop();\r\n\t\t}\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\teffect.second->Stop();\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::PauseAllSound()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tfor(auto song : mMusicList)\r\n\t\t{\r\n\t\t\tsong.second->Pause();\r\n\t\t}\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\teffect.second->Pause();\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::ResumeAllSound()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tfor(auto song : mMusicList)\r\n\t\t{\r\n\t\t\tsong.second->Resume();\r\n\t\t}\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\teffect.second->Resume();\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::DeleteAllSound()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tfor(auto song : mMusicList)\r\n\t\t{\r\n\t\t\tdelete song.second;\r\n\t\t}\r\n\t\tmMusicList.clear();\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\tdelete effect.second;\r\n\t\t}\t\r\n\t\tmEffectsList.clear();\r\n\t\t\r\n\t}\r\n\r\n#ifdef ANDROID\r\n\tconst SLEngineItf& SoundService::GetEngine() const\r\n\t{\r\n\t\treturn mEngine;\r\n\t}\r\n\r\n\tconst SLObjectItf& SoundService::GetOutputMixObject() const\r\n\t{\r\n\t\treturn mOutputMixObj;\r\n\t}\r\n#endif\r\n}\r\n<commit_msg>small fix<commit_after>#include \"SoundService.h\"\r\n#include \"..\/Logger.h\"\r\n#include \"..\/Helpers\/Helpers.h\"\r\n\r\n\r\n#ifdef ANDROID\r\n#include \"..\/Assets\/Resource.h\"\r\n#endif\r\n\r\nnamespace star\r\n{\r\n\tSoundService * SoundService::mSoundService = nullptr;\r\n\tbool SoundService::mbIsInitialized = false;\r\n\r\n\tSoundService * SoundService::GetInstance()\r\n\t{\r\n\t\tif(mSoundService == nullptr)\r\n\t\t{\r\n\t\t\tmSoundService = new SoundService();\r\n\t\t}\r\n\t\treturn mSoundService;\r\n\t}\r\n\r\n\tSoundService::SoundService()\r\n#ifdef ANDROID\r\n\t\t:mEngine(NULL),\r\n\t\tmEngineObj(NULL),\r\n\t\tmOutputMixObj(NULL),\r\n\t\tm_CurrentSoundEffect(nullptr),\r\n\t\tm_CurrentSoundFile(nullptr)\r\n#endif\r\n\t{\r\n\t\tmQueueIterator = mBackgroundQueue.begin();\r\n\t}\r\n\r\n\tSoundService::~SoundService()\r\n\t{\r\n\t\tfor(auto music : mMusicList)\r\n\t\t{\r\n\t\t\tdelete music.second;\r\n\t\t\tmusic.second = nullptr;\r\n\t\t}\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\tdelete effect.second;\r\n\t\t\teffect.second = nullptr;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::Start()\r\n\t{\r\n\t\tif(mbIsInitialized) return;\r\n\r\n\t\tmbIsInitialized = true;\r\n\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : Started making Audio Engine\"));\r\n\r\n#ifdef DESKTOP\r\n\t\tint32 audio_rate(44100);\r\n\t\tuint16 audio_format(MIX_DEFAULT_FORMAT);\r\n\t\tint32 audio_channels(2);\r\n\t\tint32 audio_buffers(4096);\r\n\r\n\t\tSDL_Init(SDL_INIT_AUDIO);\r\n\t\tint flags = MIX_INIT_OGG | MIX_INIT_MP3;\r\n\t\tint innited = Mix_Init(flags);\r\n\t\tif((innited & flags) != flags)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, \r\n\t\t\t\t_T(\"Audio :Could not init Ogg and Mp3, reason : \") + string_cast<tstring>(Mix_GetError()));\r\n\t\t}\r\n\r\n\t\tif(Mix_OpenAudio(audio_rate, audio_format,audio_channels,audio_buffers))\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : Could Not open Audio Mix SDL\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\t\/\/check What we got\r\n\t\tint32 actual_rate, actual_channels;\r\n\t\tuint16 actual_format;\r\n\r\n\t\tMix_QuerySpec(&actual_rate,&actual_format,&actual_channels);\r\n\t\ttstringstream buffer;\r\n\t\tbuffer << \"Actual Rate : \" << actual_rate << \", Actual Format : \" << actual_format \r\n\t\t\t<< \", Actual Channels : \" << actual_channels << std::endl;\r\n\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : SDL specs : \")+buffer.str());\r\n\t\tMix_Volume(-1,100);\r\n#else\r\n\t\t\r\n\t\tSLresult lRes;\r\n\t\tconst SLuint32 lEngineMixIIDCount =1;\r\n\t\tconst SLInterfaceID lEngineMixIIDs[]={SL_IID_ENGINE};\r\n\t\tconst SLboolean lEngineMixReqs[]={SL_BOOLEAN_TRUE};\r\n\t\tconst SLuint32 lOutputMixIIDCount=0;\r\n\t\tconst SLInterfaceID lOutputMixIIDs[]={};\r\n\t\tconst SLboolean lOutputMixReqs[]={};\r\n\r\n\t\tlRes = slCreateEngine(&mEngineObj, 0, NULL, lEngineMixIIDCount, lEngineMixIIDs, lEngineMixReqs);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't make Audio Engine\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlRes = (*mEngineObj)->Realize(mEngineObj, SL_BOOLEAN_FALSE);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't realize Engine\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlRes = (*mEngineObj)->GetInterface(mEngineObj,SL_IID_ENGINE, &mEngine);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't fetch engine interface\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlRes = (*mEngine)->CreateOutputMix(mEngine, &mOutputMixObj, lOutputMixIIDCount, lOutputMixIIDs,lOutputMixReqs);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't create outputmix\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlRes = (*mOutputMixObj)->Realize(mOutputMixObj,SL_BOOLEAN_FALSE);\r\n\t\tif(lRes != SL_RESULT_SUCCESS)\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Error, _T(\"Audio : Can't realise output object\"));\r\n\t\t\tStop();\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : Succesfull made Audio Engine\"));\r\n#endif\r\n\t}\r\n\r\n\tvoid SoundService::Stop()\r\n\t{\r\n\t\tStopAllSound();\r\n\t\tDeleteAllSound();\r\n\r\n#ifdef DESKTOP\r\n\t\tMix_CloseAudio();\r\n\t\tMix_Quit();\r\n\t\tSDL_Quit();\r\n#else\r\n\t\tif(mOutputMixObj != NULL)\r\n\t\t{\r\n\t\t\t(*mOutputMixObj)->Destroy(mOutputMixObj);\r\n\t\t\tmOutputMixObj = NULL;\r\n\t\t}\r\n\t\tif(mEngineObj != NULL)\r\n\t\t{\r\n\t\t\t(*mEngineObj)->Destroy(mEngineObj);\r\n\t\t\tmEngineObj = NULL;\r\n\t\t\tmEngine = NULL;\r\n\t\t}\r\n#endif\r\n\t\tstar::Logger::GetInstance()->Log(star::LogLevel::Info, _T(\"Audio : Stopped audio Engine\"));\r\n\t}\r\n\r\n\tvoid SoundService::LoadMusic(const tstring& path, const tstring& name)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tif(mMusicList.find(name) != mMusicList.end())\r\n\t\t{\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tauto pathit = mMusicPathList.find(path);\r\n\t\tif(pathit != mMusicPathList.end())\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(LogLevel::Warning,_T(\"Sound Service : Sound File Path Already Exists\"));\r\n\t\t\ttstring nameold = pathit->second;\r\n\t\t\tauto nameit = mMusicList.find(nameold);\r\n\t\t\tif(nameit != mMusicList.end())\r\n\t\t\t{\r\n\t\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Found sound file of old path, making copy for new name\"));\r\n\t\t\t\tmMusicList[name]=nameit->second;\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\tmMusicPathList.erase(pathit);\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tSoundFile* music = new SoundFile(path);\r\n\t\tmMusicList[name] = music;\r\n\t\tmMusicPathList[path]=name;\r\n\t\treturn;\r\n\t}\r\n\r\n\tvoid SoundService::LoadSoundEffect(const tstring& path, const tstring& name)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tif(mEffectsList.find(name) != mEffectsList.end())\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(LogLevel::Warning,_T(\"Sound Service : That effect already excists.\"));\r\n\t\t}\r\n\r\n\t\tauto pathit = mSoundEffectPathList.find(path);\r\n\t\tif(pathit != mSoundEffectPathList.end())\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(LogLevel::Warning,_T(\"Sound Service : Sound Effect Path Already Exists\"));\r\n\t\t\ttstring nameold = pathit->second;\r\n\t\t\tauto nameit = mMusicList.find(nameold);\r\n\t\t\tif(nameit!= mMusicList.end())\r\n\t\t\t{\r\n\t\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Found Sound Effect of old path, making copy for new name\"));\r\n\t\t\t\tmMusicList[name] = nameit->second;\r\n\t\t\t}\r\n\t\t\tmSoundEffectPathList.erase(pathit);\r\n\t\t}\r\n\r\n\t\tSoundEffect* effect = new SoundEffect(path);\r\n\t\tmEffectsList[name] = effect;\r\n\t\tmSoundEffectPathList[path] = name;\r\n\t}\r\n\r\n\tvoid SoundService::PlaySoundFile(const tstring& path, const tstring& name, int loopTimes)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tif(mMusicList.find(name) == mMusicList.end())\r\n\t\t{\r\n\t\t\tLoadMusic(path,name);\r\n\t\t}\r\n\t\treturn PlaySoundFile(name,loopTimes);\r\n\t}\r\n\r\n\tvoid SoundService::PlaySoundFile(const tstring& name, int loopTimes)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tauto it = mMusicList.find(name);\r\n\t\tif(it != mMusicList.end())\r\n\t\t{\r\n\t\t\tif(m_CurrentSoundFile != nullptr) m_CurrentSoundFile->Stop();\r\n\t\t\tm_CurrentSoundFile = mMusicList[name];\r\n\t\t\tm_CurrentSoundFile->Play(loopTimes);\r\n\t\t\treturn;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tm_CurrentSoundFile = nullptr;\r\n\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Couldn't find song '\") + name + _T(\"'.\"));\r\n\t\t}\r\n\t\t\r\n\t}\r\n\r\n\tvoid SoundService::PlaySoundEffect(const tstring& path, const tstring& name, int loopTimes)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tif(mEffectsList.find(name) == mEffectsList.end())\r\n\t\t{\r\n\t\t\tLoadSoundEffect(path,name);\r\n\t\t}\r\n\t\tPlaySoundEffect(name,loopTimes);\r\n\t}\r\n\r\n\tvoid SoundService::PlaySoundEffect(const tstring& name, int loopTimes)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tauto it = mEffectsList.find(name);\r\n\t\tif(it != mEffectsList.end())\r\n\t\t{\r\n\t\t\tm_CurrentSoundEffect = mEffectsList[name];\r\n\t\t\tmEffectsList[name]->Play(loopTimes);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Couldn't find effect '\") + name + _T(\"'.\"));\r\n\t\t}\r\n\t\t\r\n\t}\r\n\r\n\tvoid SoundService::AddToBackgroundQueue(const tstring& name)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tauto it = mMusicList.find(name);\r\n\t\tif(it != mMusicList.end())\r\n\t\t{\r\n\t\t\tmBackgroundQueue.push_back(mMusicList[name]);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->\r\n\t\t\t\tLog(LogLevel::Warning,_T(\"Sound Service : Couldn't find background song '\") + name + _T(\"'.\"));\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::PlayBackgroundQueue()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tmQueueIterator = mBackgroundQueue.begin();\r\n\t\tif(mQueueIterator != mBackgroundQueue.end())\r\n\t\t{\r\n\t\t\t(*mQueueIterator)->PlayQueued(0);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tstar::Logger::GetInstance()->Log(LogLevel::Warning,_T(\"Sound Service : No song in background queue.\"));\t\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::PlayNextSongInQueue()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\t\tif(mBackgroundQueue.size() == 0) return;\r\n\r\n\t\t++mQueueIterator;\r\n\t\tif(mQueueIterator != mBackgroundQueue.end())\r\n\t\t{\r\n\t\t\t(*mQueueIterator)->PlayQueued(0);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tmQueueIterator==mBackgroundQueue.begin();\r\n\t\t\t(*mQueueIterator)->PlayQueued(0);\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::StopSound(const tstring& name)\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tauto it = mMusicList.find(name);\r\n\t\tif(it != mMusicList.end())\r\n\t\t{\r\n\t\t\tmMusicList[name]->Stop();\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tauto it2 = mEffectsList.find(name);\r\n\t\tif(it2 != mEffectsList.end())\r\n\t\t{\r\n\t\t\tmEffectsList[name]->Stop();\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::StopAllSound()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tfor(auto song : mMusicList)\r\n\t\t{\r\n\t\t\tsong.second->Stop();\r\n\t\t}\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\teffect.second->Stop();\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::PauseAllSound()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tfor(auto song : mMusicList)\r\n\t\t{\r\n\t\t\tsong.second->Pause();\r\n\t\t}\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\teffect.second->Pause();\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::ResumeAllSound()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tfor(auto song : mMusicList)\r\n\t\t{\r\n\t\t\tsong.second->Resume();\r\n\t\t}\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\teffect.second->Resume();\r\n\t\t}\r\n\t}\r\n\r\n\tvoid SoundService::DeleteAllSound()\r\n\t{\r\n\t\tASSERT(mSoundService != nullptr, _T(\"Sound Service is invalid.\"));\r\n\r\n\t\tfor(auto song : mMusicList)\r\n\t\t{\r\n\t\t\tdelete song.second;\r\n\t\t}\r\n\t\tmMusicList.clear();\r\n\r\n\t\tfor(auto effect : mEffectsList)\r\n\t\t{\r\n\t\t\tdelete effect.second;\r\n\t\t}\t\r\n\t\tmEffectsList.clear();\r\n\t\t\r\n\t}\r\n\r\n#ifdef ANDROID\r\n\tconst SLEngineItf& SoundService::GetEngine() const\r\n\t{\r\n\t\treturn mEngine;\r\n\t}\r\n\r\n\tconst SLObjectItf& SoundService::GetOutputMixObject() const\r\n\t{\r\n\t\treturn mOutputMixObj;\r\n\t}\r\n#endif\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\/\n\n#include \"Color.h\"\n#include <cassert>\n\nnamespace facebook {\nnamespace react {\n\nSharedColor colorFromComponents(ColorComponents components) {\n  const CGFloat componentsArray[] = {\n      components.red, components.green, components.blue, components.alpha};\n\n  auto color = CGColorCreate(CGColorSpaceCreateDeviceRGB(), componentsArray);\n\n  return SharedColor(color, CFRelease);\n}\n\nColorComponents colorComponentsFromColor(SharedColor color) {\n  if (!color) {\n    \/\/ Empty color object can be considered as `clear` (black, fully\n    \/\/ transparent) color.\n    return ColorComponents{0, 0, 0, 0};\n  }\n\n  auto numberOfComponents __unused = CGColorGetNumberOfComponents(color.get());\n  assert(numberOfComponents == 4);\n  const CGFloat *components = CGColorGetComponents(color.get());\n  return ColorComponents{(float)components[0],\n                         (float)components[1],\n                         (float)components[2],\n                         (float)components[3]};\n}\n\nSharedColor clearColor() {\n  static SharedColor color = colorFromComponents(ColorComponents{0, 0, 0, 0});\n  return color;\n}\n\nSharedColor blackColor() {\n  static SharedColor color = colorFromComponents(ColorComponents{0, 0, 0, 1});\n  return color;\n}\n\nSharedColor whiteColor() {\n  static SharedColor color = colorFromComponents(ColorComponents{1, 1, 1, 1});\n  return color;\n}\n\n} \/\/ namespace react\n} \/\/ namespace facebook\n<commit_msg>Use CGColorRelease instead of CGRelease<commit_after>\/*\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\/\n\n#include \"Color.h\"\n#include <cassert>\n\nnamespace facebook {\nnamespace react {\n\nSharedColor colorFromComponents(ColorComponents components) {\n  const CGFloat componentsArray[] = {\n      components.red, components.green, components.blue, components.alpha};\n\n  auto color = CGColorCreate(CGColorSpaceCreateDeviceRGB(), componentsArray);\n\n  return SharedColor(color, CGColorRelease);\n}\n\nColorComponents colorComponentsFromColor(SharedColor color) {\n  if (!color) {\n    \/\/ Empty color object can be considered as `clear` (black, fully\n    \/\/ transparent) color.\n    return ColorComponents{0, 0, 0, 0};\n  }\n\n  auto numberOfComponents __unused = CGColorGetNumberOfComponents(color.get());\n  assert(numberOfComponents == 4);\n  const CGFloat *components = CGColorGetComponents(color.get());\n  return ColorComponents{(float)components[0],\n                         (float)components[1],\n                         (float)components[2],\n                         (float)components[3]};\n}\n\nSharedColor clearColor() {\n  static SharedColor color = colorFromComponents(ColorComponents{0, 0, 0, 0});\n  return color;\n}\n\nSharedColor blackColor() {\n  static SharedColor color = colorFromComponents(ColorComponents{0, 0, 0, 1});\n  return color;\n}\n\nSharedColor whiteColor() {\n  static SharedColor color = colorFromComponents(ColorComponents{1, 1, 1, 1});\n  return color;\n}\n\n} \/\/ namespace react\n} \/\/ namespace facebook\n<|endoftext|>"}
{"text":"<commit_before>#include \"TChain.h\"\n#include \"TTree.h\"\n#include \"TList.h\"\n#include \"TH1F.h\"\n#include \"TH2F.h\"\n#include \"TCanvas.h\"\n#include \"TMath.h\"\n#include \"TObjString.h\"\n\n#include \"AliAnalysisTask.h\"\n#include \"AliAnalysisManager.h\"\n\n#include \"AliESDEvent.h\"\n#include \"AliESDTZERO.h\"\n#include \"AliESDfriend.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliESDTZEROfriend.h\"\n#include \"AliT0CalibAnalysisTask.h\"\n#include \"AliESDVZERO.h\"\n#include \"AliMultiplicity.h\"\n#include \"AliESDpid.h\"\n#include \"AliESDtrackCuts.h\"\n#include \"AliCentrality.h\"\n#include \"AliVEvent.h\"\n\nClassImp(AliT0CalibAnalysisTask)\n\n\/\/________________________________________________________________________\nAliT0CalibAnalysisTask::AliT0CalibAnalysisTask(const char *name) \n  : AliAnalysisTaskSE(name), fESD(0), fOutputList(0), \n  fT0OutTree(0x0), fEvent(-99999),   fOrbit(-99999), fBC(-99999),\n  fTrackletSPD(-99999), fNcont(-99999),\n  fVertex(-99999), fVertexSPD(-99999), \n  fMeanAC(-99999), fMeanA(-99999),fMeanC(-99999), \n  fMultV0A(-99999), fMultV0C(-99999),fTimeV0A(-99999),fTimeV0C(-99999), fSumampA(-99999), fSumampC(-99999),\n  ftimestamp(0), fSep2(0),\n  fZDCcut(kFALSE), fT0Trigger(0), fpileup(kFALSE), fTrigger(0x0),\n  fT0_amplitude(0x0), fT0_time(0x0),\n  fcentralityV0M(0), fcentralityZDC(0), fcentralityTRK(0),\n  fESDtracks(0),\n  fMultiplicity(-99999),\n  fTriggerinput(0x0), fZDCbg(kFALSE),\n  fTOFtracks(0), fT0tofTrack(0),\n  fESDpid(new AliESDpid()), fPFPbit(0)\n{\n  \/\/ Constructor\n\n  \/\/ Define input and output slots here\n  \/\/ Input slot #0 works with a TChain\n  DefineInput(0, TChain::Class());\n  \/\/ Output slot #0 id reserved by the base class for AOD\n  \/\/ Output slot #1 writes into a TH1 container\n  DefineOutput(1, TList::Class());\n}\n\n\/\/________________________________________________________________________\nAliT0CalibAnalysisTask::~AliT0CalibAnalysisTask() \n{\n\/\/ Destructor\n   if (fT0OutTree) delete fT0OutTree ;\n}\n\n\/\/_____________________________________________________________________________\nBool_t AliT0CalibAnalysisTask::UserNotify()\n{\n\/\/\n\/\/ Calls the mother class Notify()\n\/\/\n\n\/\/  AliDebug(AliLog::kDebug,\"<-\");\n  \/\/ AliDebug(AliLog::kDebug,\"->\");\n\n  return AliAnalysisTaskSE::UserNotify();\n}\n\n\/\/________________________________________________________________________\nvoid AliT0CalibAnalysisTask::UserCreateOutputObjects()\n{\n  \/\/ Create histograms\n  \/\/ Called once\n   fOutputList = new TList();\n  fOutputList->SetOwner(); \/\/ Will delete the histos on cleanup\n\n  fT0OutTree=new TTree(\"t0tree\",\"None here\");\n  fT0OutTree->Branch(\"fNevent\", &fEvent);\n  fT0OutTree->Branch(\"fOrbit\", &fOrbit);\n  fT0OutTree->Branch(\"fBC\", &fBC);\n  fT0OutTree->Branch(\"fNcont\", &fNcont, \"fNcont\/I\");\n  fT0OutTree->Branch(\"vertexT0\", &fVertex, \"fVertex\/F\");\n  fT0OutTree->Branch(\"vertexSPD\", &fVertexSPD, \"vertexSPD\/F\");\n  fT0OutTree->Branch(\"meanAC\", &fMeanAC,\"meanAC\/F\");\n  fT0OutTree->Branch(\"meanA\", &fMeanA,\"meanA\/F\");\n  fT0OutTree->Branch(\"meanC\", &fMeanC,\"meanC\/F\");\n  fT0OutTree->Branch(\"trackletSPD\", &fTrackletSPD,\"trackletSPD\/I\");\n  fT0OutTree->Branch(\"TOFtracks\", &fTOFtracks);\n  fT0OutTree->Branch(\"ESDtracks\", &fESDtracks);\n  fT0OutTree->Branch(\"multV0A\", &fMultV0A,\"multV0A\/F\");\n  fT0OutTree->Branch(\"multV0C\", &fMultV0C,\"multV0C\/F\");\n  fT0OutTree->Branch(\"timeV0A\", &fTimeV0A,\"timeV0A\/F\");\n  fT0OutTree->Branch(\"timeV0C\", &fTimeV0C,\"timeV0C\/F\");\n  fT0OutTree->Branch(\"sumampA\", &fSumampA);\n  fT0OutTree->Branch(\"sumampC\", &fSumampC);\n  fT0OutTree->Branch(\"pileup\", &fpileup);\n  fT0OutTree->Branch(\"trigger\", &fTrigger);\n  fT0OutTree->Branch(\"triggerinput\", &fTriggerinput);\n  fT0OutTree->Branch(\"T0trigger\", &fT0Trigger);\n  fT0OutTree->Branch(\"t0tofTrack\",  &fT0tofTrack);\n  fT0OutTree->Branch(\"ZDCcut\", &fZDCcut);\n  fT0OutTree->Branch(\"ftimestamp\", &ftimestamp);\n  fT0OutTree->Branch(\"centralityV0M\", &fcentralityV0M);\n  fT0OutTree->Branch(\"centralityZDC\", &fcentralityZDC);\n  fT0OutTree->Branch(\"centralityTRK\", &fcentralityTRK);\n  for ( Int_t i=0; i<24; i++) {\n    fT0OutTree->Branch(Form(\"amp%i\", i+1), &famp[i]);\n    fT0OutTree->Branch(Form(\"amp%i_new\", i+1), &famp_new[i]);\n    fT0OutTree->Branch(Form(\"time%i\", i+1), &ftime[i]);\n    fT0OutTree->Branch(Form(\"fRawTime%i\", i+1), &fRawTime[i]);\n  } \n  for ( Int_t i=0; i<5; i++) {\n    fT0OutTree->Branch(Form(\"fOrA%i\", i+1), &fOrA[i]);\n    fT0OutTree->Branch(Form(\"fOrC%i\", i+1), &fOrC[i]);\n    fT0OutTree->Branch(Form(\"fTVDC%i\", i+1), &fTVDC[i]);  \n  }\n  TString pilename[3] = {\"T0pileup\", \"T0background\", \"T0satellite\"};\n  for ( Int_t i=0; i<3; i++) \n    fT0OutTree->Branch(pilename[i].Data(), &fT0pileup[i]);\n  fT0OutTree->Branch(\"multEstimator\", &fMultiplicity);\n  \/\/ZDC background\n fT0OutTree->Branch(\"zbg\", &fZDCbg);\n fESDpid = new AliESDpid();\n \/\/PFP\n fT0OutTree->Branch(\"bitPFP\", &fPFPbit);\n\n  fOutputList->Add(fT0OutTree);\n \n   PostData(1, fOutputList);\n  \n}\n\n\/\/________________________________________________________________________\nvoid AliT0CalibAnalysisTask::UserExec(Option_t *) \n{\n  \/\/ Main loop\n  \/\/ Called for each event\n  fVertex= fVertexSPD =  fMeanAC = fMeanA =  fMeanC =  fTrackletSPD = fNcont = -99999;\n  fMultV0A=fMultV0C=fTimeV0A=fTimeV0C=fMultiplicity = -99999;\n  \n  for (Int_t i=0; i<24; i++)\t{\n    famp[i] = famp_new[i] = ftime[i] = fRawTime[i] = -9999;\n  }\n  for ( Int_t i0=0; i0<5; i0++) {\n    fTVDC[i0]=-9999;\n    fOrC[i0]=-9999;\n    fOrA[i0]=-9999;\n  }\n  \n  Float_t orA , orC, tvdc;\n  orA = orC = tvdc = -9999;\n  fBC = -9999;\n  \/\/ Post output data.\n  fESD = dynamic_cast<AliESDEvent*>(InputEvent());\n  if (!fESD) {\n    printf(\"ERROR: fESD not available\\n\");\n    return;\n  }\n  \n  if(fESD)\n    {\n      \/\/    if(fIsSelected) \n      {\n\tfZDCbg = kFALSE;\n\t\/*\n\t  AliTriggerAnalysis *fTriggerAnalysis;\n\t  Bool_t\tfZDCbgA = fTriggerAnalysis->IsOfflineTriggerFired(fESD, AliTriggerAnalysis::kZNABG);\n\t  Bool_t\tfZDCbgC =  fTriggerAnalysis->IsOfflineTriggerFired(fESD, AliTriggerAnalysis::kZNCBG);\n\t  fZDCbg = (fZDCbgA);\n\t  cout<<\" ZDC back \"<<fZDCbgA<<endl;\n\t*\/\n\tAliESDVZERO* esdV0 = fESD->GetVZEROData();\n\tconst AliMultiplicity *mult = fESD->GetMultiplicity();\n\t\/\/ printf(\" VZERO MULT \\n\");\n\tAliESDTZERO* tz= (AliESDTZERO*) fESD->GetESDTZERO();\n\t\n\tconst Double32_t *amp, *time, *mean,*amp_new ;\n\tfVertex= fVertexSPD =  fMeanAC = fMeanA =  fMeanC = fTrackletSPD = fNcont =-99999;\n\tfMultV0A=fMultV0C=fTimeV0A=fTimeV0C=fMultiplicity = -99999;\n\t\n\tfSumampA=0;\n\tfSumampC=0;\n\tfNcont=0;\n\tTString triggers = fESD->GetFiredTriggerClasses();\n\tfTrigger.SetString(triggers.Data());\n\tTString inputtriggers =fESD-> GetHeader()->GetFiredTriggerInputs();\n\tfTriggerinput.SetString(inputtriggers.Data());\n\tfEvent=fESD->GetEventNumberInFile();\n\tfT0Trigger=fESD->GetT0Trig();\n\t\n\tfESDtracks=fESD->GetNumberOfTracks();\n\tftimestamp=fESD->GetTimeStamp(); \/\/ - 1301217882; \n\t\/\/\t  printf (\" timestamp %d \\n\", ftimestamp);\n\t\n\tfMultiplicity =  AliESDtrackCuts::GetReferenceMultiplicity(fESD);\n\t\/\/\t  cout<<\" fMultiplicity \"<<fMultiplicity<<endl;\n\tfOrbit=fESD->GetOrbitNumber();\n\tfBC=fESD->GetBunchCrossNumber();\n\tfNcont = fESD->GetPrimaryVertexSPD()->GetNContributors();\n\tif(fNcont>=0 ) {\n\t  fVertexSPD = fESD->GetPrimaryVertex()->GetZ();\n\t}\n\tfTrackletSPD = mult->GetNumberOfTracklets();\n\tfMultV0A =  esdV0->GetMTotV0A();\n\tfMultV0C =  esdV0->GetMTotV0C();\n\t\/\/TOF hit  \n\tInt_t ntracksMatchedToTOF = 0; \n\tInt_t ntracks = fESD->GetNumberOfTracks();\n\tfor(Int_t itrk=0;itrk<ntracks;itrk++){\n\t  AliESDtrack* track = fESD->GetTrack(itrk);\n\t  if (!track) {\n\t    Printf(\"ERROR: Could not receive track %d\", itrk);\n\t    continue;\n\t  }\n\t  \/\/no track selection just TOF hit\n\t  if (track->IsOn(AliESDtrack::kTOFout)) ntracksMatchedToTOF++;\n\t}\n\t\n\tfTOFtracks = ntracksMatchedToTOF;\n\tif(fESDpid){ \/\/get T0_TOF \n\t  fESDpid->SetTOFResponse(fESD,AliESDpid::kTOF_T0);\n\t  fT0tofTrack =(Float_t) (fESDpid->GetTOFResponse().GetStartTime(10.0)); \/\/Get start time \"from all tracks \n\t  \/\/   printf(\"@@TOF T0 %f\\n\",fT0tofTrack);\n\t}\t\n\tfpileup = fESD->IsPileupFromSPD();\n\tfTimeV0C = esdV0->GetV0CTime();\n\tfTimeV0A = esdV0->GetV0ATime();\n\t\/\/T0 info\n\tmean = fESD->GetT0TOF();\n\tfVertex=fESD->GetT0zVertex();\n\tfMeanA = mean[1];\n\tfMeanC = mean[2];\n\tif (TMath::Abs(fMeanA)<9999 && TMath::Abs(fMeanC)<9999) \n\t  fMeanAC = mean[0] ;\n\tfSumampC = tz->GetMultC();\n\tfSumampA = tz->GetMultA();\n\tamp=fESD->GetT0amplitude();\n\tamp_new = tz->GetT0NewAmplitude();\n\ttime=fESD->GetT0time();\n\tfor (Int_t i=0; i<24; i++){ \n\t  if( time[i]>100 ) {\n\t    ftime[i] = time[i];\n\t    if( amp[i]>0.1)  famp[i] = amp[i];\n\t    if(amp_new)famp_new[i] = amp_new[i];\t\n\t  }\n\t}\n\t\/\/new raw OrA OrC TVDC all CFD\n\tfor (Int_t ii=0; ii<5; ii++){ \n\t  orA   = tz->GetOrA(ii);\n\t  orC   = tz->GetOrC(ii);\n\t  tvdc  = tz->GetTVDC(ii);\n\t  if(ii==0) {\n\t    fOrA[ii] = orA;\n\t    fOrC[ii] = orC;\n\t    fTVDC[ii] = tvdc;\n\t  } else {\n\t    if ( ii>0 && fOrA[ii-1] !=orA)\tfOrA[ii] = orA;\n\t    else fOrA[ii]=-9999;\n\t    if ( ii>0 && fOrC[ii-1] !=orC)\tfOrC[ii] = orC;\n\t    else fOrC[ii]=-9999;\n\t  if ( ii>0 && fTVDC[ii-1] != tvdc)\tfTVDC[ii] = tvdc;\n\t  else fTVDC[ii]=-9999;\n\t  }\n\t}\n\tfor (Int_t iii=0; iii<24; iii++)\n\t  fRawTime[iii] =  tz->GetTimeFull(iii,0);\n\t\n\tfT0pileup[0] = tz->GetPileupFlag();\n\tfT0pileup[1] = tz->GetBackgroundFlag();\n\tfT0pileup[2] = tz->GetSatellite();\n\t\n\tAliCentrality *centrality = fESD->GetCentrality();\n\t\/\/The centrality function you can use\n\tif(centrality) {\n\t  fcentralityV0M = centrality->GetCentralityPercentile(\"V0M\"); \/\/ returns the centrality \n\t  fcentralityTRK = centrality->GetCentralityPercentile(\"TRK\"); \/\/ returns the centrality \n\t  fcentralityZDC = centrality->GetCentralityPercentile(\"ZEMvsZDC\"); \/\/ returns the \n\t}\t\n\t\/\/ PFP bit\n\tfPFPbit = tz->GetT0PileupBits();\n       \n      } \/\/selected\n    } \/\/ESD\n\n  fT0OutTree->Fill();\n    \n  PostData(1, fOutputList);\n  \n}      \n\n\/\/________________________________________________________________________\nvoid AliT0CalibAnalysisTask::Terminate(Option_t *) \n{\n  \/\/ Draw result to the screen\n  \/\/ Called once at the end of the query\n\n  \/* fOutputList = dynamic_cast<TList*> (GetOutputData(1));\n  if (!fOutputList) {\n    printf(\"ERROR: Output list not available\\n\");\n    return;\n  }\n    *\/  \n\n}\n<commit_msg>typo fixed<commit_after>#include \"TChain.h\"\n#include \"TTree.h\"\n#include \"TList.h\"\n#include \"TH1F.h\"\n#include \"TH2F.h\"\n#include \"TCanvas.h\"\n#include \"TMath.h\"\n#include \"TObjString.h\"\n\n#include \"AliAnalysisTask.h\"\n#include \"AliAnalysisManager.h\"\n\n#include \"AliESDEvent.h\"\n#include \"AliESDTZERO.h\"\n#include \"AliESDfriend.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliESDTZEROfriend.h\"\n#include \"AliT0CalibAnalysisTask.h\"\n#include \"AliESDVZERO.h\"\n#include \"AliMultiplicity.h\"\n#include \"AliESDpid.h\"\n#include \"AliESDtrackCuts.h\"\n#include \"AliCentrality.h\"\n#include \"AliVEvent.h\"\n\nClassImp(AliT0CalibAnalysisTask)\n\n\/\/________________________________________________________________________\nAliT0CalibAnalysisTask::AliT0CalibAnalysisTask(const char *name) \n  : AliAnalysisTaskSE(name), fESD(0), fOutputList(0), \n  fT0OutTree(0x0), fEvent(-99999),   fOrbit(-99999), fBC(-99999),\n  fTrackletSPD(-99999), fNcont(-99999),\n  fVertex(-99999), fVertexSPD(-99999), \n  fMeanAC(-99999), fMeanA(-99999),fMeanC(-99999), \n  fMultV0A(-99999), fMultV0C(-99999),fTimeV0A(-99999),fTimeV0C(-99999), fSumampA(-99999), fSumampC(-99999),\n  ftimestamp(0), fSep2(0),\n  fZDCcut(kFALSE), fT0Trigger(0), fpileup(kFALSE), fTrigger(0x0),\n  fT0_amplitude(0x0), fT0_time(0x0),\n  fcentralityV0M(0), fcentralityZDC(0), fcentralityTRK(0),\n  fESDtracks(0),\n  fMultiplicity(-99999),\n  fTriggerinput(0x0), fZDCbg(kFALSE),\n  fTOFtracks(0), fT0tofTrack(0),\n  fESDpid(new AliESDpid()), fPFPbit(0)\n{\n  \/\/ Constructor\n\n  \/\/ Define input and output slots here\n  \/\/ Input slot #0 works with a TChain\n  DefineInput(0, TChain::Class());\n  \/\/ Output slot #0 id reserved by the base class for AOD\n  \/\/ Output slot #1 writes into a TH1 container\n  DefineOutput(1, TList::Class());\n}\n\n\/\/________________________________________________________________________\nAliT0CalibAnalysisTask::~AliT0CalibAnalysisTask() \n{\n\/\/ Destructor\n   if (fT0OutTree) delete fT0OutTree ;\n}\n\n\/\/_____________________________________________________________________________\nBool_t AliT0CalibAnalysisTask::UserNotify()\n{\n\/\/\n\/\/ Calls the mother class Notify()\n\/\/\n\n\/\/  AliDebug(AliLog::kDebug,\"<-\");\n  \/\/ AliDebug(AliLog::kDebug,\"->\");\n\n  return AliAnalysisTaskSE::UserNotify();\n}\n\n\/\/________________________________________________________________________\nvoid AliT0CalibAnalysisTask::UserCreateOutputObjects()\n{\n  \/\/ Create histograms\n  \/\/ Called once\n   fOutputList = new TList();\n  fOutputList->SetOwner(); \/\/ Will delete the histos on cleanup\n\n  fT0OutTree=new TTree(\"t0tree\",\"None here\");\n  fT0OutTree->Branch(\"fNevent\", &fEvent);\n  fT0OutTree->Branch(\"fOrbit\", &fOrbit);\n  fT0OutTree->Branch(\"fBC\", &fBC);\n  fT0OutTree->Branch(\"fNcont\", &fNcont, \"fNcont\/I\");\n  fT0OutTree->Branch(\"vertexT0\", &fVertex, \"fVertex\/F\");\n  fT0OutTree->Branch(\"vertexSPD\", &fVertexSPD, \"vertexSPD\/F\");\n  fT0OutTree->Branch(\"meanAC\", &fMeanAC,\"meanAC\/F\");\n  fT0OutTree->Branch(\"meanA\", &fMeanA,\"meanA\/F\");\n  fT0OutTree->Branch(\"meanC\", &fMeanC,\"meanC\/F\");\n  fT0OutTree->Branch(\"trackletSPD\", &fTrackletSPD,\"trackletSPD\/I\");\n  fT0OutTree->Branch(\"TOFtracks\", &fTOFtracks);\n  fT0OutTree->Branch(\"ESDtracks\", &fESDtracks);\n  fT0OutTree->Branch(\"multV0A\", &fMultV0A,\"multV0A\/F\");\n  fT0OutTree->Branch(\"multV0C\", &fMultV0C,\"multV0C\/F\");\n  fT0OutTree->Branch(\"timeV0A\", &fTimeV0A,\"timeV0A\/F\");\n  fT0OutTree->Branch(\"timeV0C\", &fTimeV0C,\"timeV0C\/F\");\n  fT0OutTree->Branch(\"sumampA\", &fSumampA);\n  fT0OutTree->Branch(\"sumampC\", &fSumampC);\n  fT0OutTree->Branch(\"pileup\", &fpileup);\n  fT0OutTree->Branch(\"trigger\", &fTrigger);\n  fT0OutTree->Branch(\"triggerinput\", &fTriggerinput);\n  fT0OutTree->Branch(\"T0trigger\", &fT0Trigger);\n  fT0OutTree->Branch(\"t0tofTrack\",  &fT0tofTrack);\n  fT0OutTree->Branch(\"ZDCcut\", &fZDCcut);\n  fT0OutTree->Branch(\"ftimestamp\", &ftimestamp);\n  fT0OutTree->Branch(\"centralityV0M\", &fcentralityV0M);\n  fT0OutTree->Branch(\"centralityZDC\", &fcentralityZDC);\n  fT0OutTree->Branch(\"centralityTRK\", &fcentralityTRK);\n  for ( Int_t i=0; i<24; i++) {\n    fT0OutTree->Branch(Form(\"amp%i\", i+1), &famp[i]);\n    fT0OutTree->Branch(Form(\"amp%i_new\", i+1), &famp_new[i]);\n    fT0OutTree->Branch(Form(\"time%i\", i+1), &ftime[i]);\n    fT0OutTree->Branch(Form(\"fRawTime%i\", i+1), &fRawTime[i]);\n  } \n  for ( Int_t i=0; i<5; i++) {\n    fT0OutTree->Branch(Form(\"fOrA%i\", i+1), &fOrA[i]);\n    fT0OutTree->Branch(Form(\"fOrC%i\", i+1), &fOrC[i]);\n    fT0OutTree->Branch(Form(\"fTVDC%i\", i+1), &fTVDC[i]);  \n  }\n  TString pilename[3] = {\"T0pileup\", \"T0background\", \"T0satellite\"};\n  for ( Int_t i=0; i<3; i++) \n    fT0OutTree->Branch(pilename[i].Data(), &fT0pileup[i]);\n  fT0OutTree->Branch(\"multEstimator\", &fMultiplicity);\n  \/\/ZDC background\n fT0OutTree->Branch(\"zbg\", &fZDCbg);\n fESDpid = new AliESDpid();\n \/\/PFP\n fT0OutTree->Branch(\"bitPFP\", &fPFPbit);\n\n  fOutputList->Add(fT0OutTree);\n \n   PostData(1, fOutputList);\n  \n}\n\n\/\/________________________________________________________________________\nvoid AliT0CalibAnalysisTask::UserExec(Option_t *) \n{\n  \/\/ Main loop\n  \/\/ Called for each event\n  fVertex= fVertexSPD =  fMeanAC = fMeanA =  fMeanC =  fTrackletSPD = fNcont = -99999;\n  fMultV0A=fMultV0C=fTimeV0A=fTimeV0C=fMultiplicity = -99999;\n  \n  for (Int_t i=0; i<24; i++)\t{\n    famp[i] = famp_new[i] = ftime[i] = fRawTime[i] = -9999;\n  }\n  for ( Int_t i0=0; i0<5; i0++) {\n    fTVDC[i0]=-9999;\n    fOrC[i0]=-9999;\n    fOrA[i0]=-9999;\n  }\n  \n  Float_t orA , orC, tvdc;\n  orA = orC = tvdc = -9999;\n  fBC = -9999;\n  \/\/ Post output data.\n  fESD = dynamic_cast<AliESDEvent*>(InputEvent());\n  if (!fESD) {\n    printf(\"ERROR: fESD not available\\n\");\n    return;\n  }\n  \n  if(fESD)\n    {\n      \/\/    if(fIsSelected) \n      {\n\tfZDCbg = kFALSE;\n\t\/*\n\t  AliTriggerAnalysis *fTriggerAnalysis;\n\t  Bool_t\tfZDCbgA = fTriggerAnalysis->IsOfflineTriggerFired(fESD, AliTriggerAnalysis::kZNABG);\n\t  Bool_t\tfZDCbgC =  fTriggerAnalysis->IsOfflineTriggerFired(fESD, AliTriggerAnalysis::kZNCBG);\n\t  fZDCbg = (fZDCbgA);\n\t  cout<<\" ZDC back \"<<fZDCbgA<<endl;\n\t*\/\n\tAliESDVZERO* esdV0 = fESD->GetVZEROData();\n\tconst AliMultiplicity *mult = fESD->GetMultiplicity();\n\t\/\/ printf(\" VZERO MULT \\n\");\n\tAliESDTZERO* tz= (AliESDTZERO*) fESD->GetESDTZERO();\n\t\n\tconst Double32_t *amp, *time, *mean,*amp_new ;\n\tfVertex= fVertexSPD =  fMeanAC = fMeanA =  fMeanC = fTrackletSPD = fNcont =-99999;\n\tfMultV0A=fMultV0C=fTimeV0A=fTimeV0C=fMultiplicity = -99999;\n\t\n\tfSumampA=0;\n\tfSumampC=0;\n\tfNcont=0;\n\tTString triggers = fESD->GetFiredTriggerClasses();\n\tfTrigger.SetString(triggers.Data());\n\tTString inputtriggers =fESD-> GetHeader()->GetFiredTriggerInputs();\n\tfTriggerinput.SetString(inputtriggers.Data());\n\tfEvent=fESD->GetEventNumberInFile();\n\tfT0Trigger=fESD->GetT0Trig();\n\t\n\tfESDtracks=fESD->GetNumberOfTracks();\n\tftimestamp=fESD->GetTimeStamp(); \/\/ - 1301217882; \n\t\/\/\t  printf (\" timestamp %d \\n\", ftimestamp);\n\t\n\tfMultiplicity =  AliESDtrackCuts::GetReferenceMultiplicity(fESD);\n\t\/\/\t  cout<<\" fMultiplicity \"<<fMultiplicity<<endl;\n\tfOrbit=fESD->GetOrbitNumber();\n\tfBC=fESD->GetBunchCrossNumber();\n\tfNcont = fESD->GetPrimaryVertexSPD()->GetNContributors();\n\tif(fNcont>=0 ) {\n\t  fVertexSPD = fESD->GetPrimaryVertex()->GetZ();\n\t}\n\tfTrackletSPD = mult->GetNumberOfTracklets();\n\tfMultV0A =  esdV0->GetMTotV0A();\n\tfMultV0C =  esdV0->GetMTotV0C();\n\t\/\/TOF hit  \n\tInt_t ntracksMatchedToTOF = 0; \n\tInt_t ntracks = fESD->GetNumberOfTracks();\n\tfor(Int_t itrk=0;itrk<ntracks;itrk++){\n\t  AliESDtrack* track = fESD->GetTrack(itrk);\n\t  if (!track) {\n\t    Printf(\"ERROR: Could not receive track %d\", itrk);\n\t    continue;\n\t  }\n\t  \/\/no track selection just TOF hit\n\t  if (track->IsOn(AliESDtrack::kTOFout)) ntracksMatchedToTOF++;\n\t}\n\t\n\tfTOFtracks = ntracksMatchedToTOF;\n\tif(fESDpid){ \/\/get T0_TOF \n\t  fESDpid->SetTOFResponse(fESD,AliESDpid::kTOF_T0);\n\t  fT0tofTrack =(Float_t) (fESDpid->GetTOFResponse().GetStartTime(10.0)); \/\/Get start time \"from all tracks \n\t  \/\/   printf(\"@@TOF T0 %f\\n\",fT0tofTrack);\n\t}\t\n\tfpileup = fESD->IsPileupFromSPD();\n\tfTimeV0C = esdV0->GetV0CTime();\n\tfTimeV0A = esdV0->GetV0ATime();\n\t\/\/T0 info\n\tmean = fESD->GetT0TOF();\n\tfVertex=fESD->GetT0zVertex();\n\tfMeanA = mean[1];\n\tfMeanC = mean[2];\n\tif (TMath::Abs(fMeanA)<9999 && TMath::Abs(fMeanC)<9999) \n\t  fMeanAC = mean[0] ;\n\tfSumampC = tz->GetMultC();\n\tfSumampA = tz->GetMultA();\n\tamp=fESD->GetT0amplitude();\n\tamp_new = tz->GetT0NewAmplitude();\n\ttime=fESD->GetT0time();\n\tfor (Int_t i=0; i<24; i++){ \n\t  if( time[i]>!=0 ) {\n\t    ftime[i] = time[i];\n\t    if( amp[i]>0.1)  famp[i] = amp[i];\n\t    if(amp_new[i]>0) famp_new[i] = amp_new[i];\t\n\t  }\n\t}\n\t\/\/new raw OrA OrC TVDC all CFD\n\tfor (Int_t ii=0; ii<5; ii++){ \n\t  orA   = tz->GetOrA(ii);\n\t  orC   = tz->GetOrC(ii);\n\t  tvdc  = tz->GetTVDC(ii);\n\t  if(ii==0) {\n\t    fOrA[ii] = orA;\n\t    fOrC[ii] = orC;\n\t    fTVDC[ii] = tvdc;\n\t  } else {\n\t    if ( ii>0 && fOrA[ii-1] !=orA)\tfOrA[ii] = orA;\n\t    else fOrA[ii]=-9999;\n\t    if ( ii>0 && fOrC[ii-1] !=orC)\tfOrC[ii] = orC;\n\t    else fOrC[ii]=-9999;\n\t  if ( ii>0 && fTVDC[ii-1] != tvdc)\tfTVDC[ii] = tvdc;\n\t  else fTVDC[ii]=-9999;\n\t  }\n\t}\n\tfor (Int_t iii=0; iii<24; iii++)\n\t  fRawTime[iii] =  tz->GetTimeFull(iii,0);\n\t\n\tfT0pileup[0] = tz->GetPileupFlag();\n\tfT0pileup[1] = tz->GetBackgroundFlag();\n\tfT0pileup[2] = tz->GetSatellite();\n\t\n\tAliCentrality *centrality = fESD->GetCentrality();\n\t\/\/The centrality function you can use\n\tif(centrality) {\n\t  fcentralityV0M = centrality->GetCentralityPercentile(\"V0M\"); \/\/ returns the centrality \n\t  fcentralityTRK = centrality->GetCentralityPercentile(\"TRK\"); \/\/ returns the centrality \n\t  fcentralityZDC = centrality->GetCentralityPercentile(\"ZEMvsZDC\"); \/\/ returns the \n\t}\t\n\t\/\/ PFP bit\n\tfPFPbit = tz->GetT0PileupBits();\n       \n      } \/\/selected\n    } \/\/ESD\n\n  fT0OutTree->Fill();\n    \n  PostData(1, fOutputList);\n  \n}      \n\n\/\/________________________________________________________________________\nvoid AliT0CalibAnalysisTask::Terminate(Option_t *) \n{\n  \/\/ Draw result to the screen\n  \/\/ Called once at the end of the query\n\n  \/* fOutputList = dynamic_cast<TList*> (GetOutputData(1));\n  if (!fOutputList) {\n    printf(\"ERROR: Output list not available\\n\");\n    return;\n  }\n    *\/  \n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <functional>\n\ntemplate<int depth>\nstruct Repeat\n{\n\ttemplate <typename F>\n\tstatic void Do(F f)\n\t{\n\t\tf();\n\t\tRepeat<depth-1>::Do(f);\n\t}\n};\n\ntemplate<>\nstruct Repeat <0>\n{\n\ttemplate <typename F>\n\tstatic void Do(F f)\n\t{\n\t\treturn;\n\t}\n};\n\n\nint main(int argc, char* argv[])\n{              \n\tRepeat<5>::Do([]{std::cout << \"Hello\" << std::endl; });\n}\n\n<commit_msg>Templated iteration using iteration count<commit_after>#include <iostream>\n#include <functional>\n\ntemplate<int depth>\nstruct Repeat\n{\n\ttemplate <typename F>\n\tstatic void Do(F f)\n\t{\n\t\tf();\n\t\tRepeat<depth-1>::Do(f);\n\t}\n\t\n\ttemplate <typename F>\n\tstatic void DoWithN(F f)\n\t{\n\t\tf(depth);\n\t\tRepeat<depth-1>::DoWithN(f);\n\t}\n};\n\ntemplate<>\nstruct Repeat <0>\n{\n\ttemplate <typename F>\n\tstatic void Do(F f)\n\t{\n\t\treturn;\n\t}\n\t\n\ttemplate <typename F>\n\tstatic void DoWithN(F f)\n\t{\n\t\treturn;\n\t}\n};\n\n\nint main(int argc, char* argv[])\n{              \n\tRepeat<5>::Do([]{std::cout << \"Hello\" << std::endl; });\n\tRepeat<5>::DoWithN([](int N){std::cout << \"Goodbye \" << N << std::endl; });\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ StructLayer.cpp\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"Frame.h\"\n#include \"StructLayer.h\"\n#include \"ScaledView.h\"\n#include \"BuildingDlg.h\"\n\n#ifndef _MSC_VER\t\/\/ for non-MSVC\n#include <string.h>\n#define stricmp strcasecmp\n#endif\n\nwxPen orangePen;\nwxPen yellowPen;\nstatic bool g_bInitializedPens = false;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvtStructureLayer::vtStructureLayer() : vtLayer(LT_STRUCTURE)\n{\n\tm_strFilename = \"Untitled.xml\";\n\n\tif (!g_bInitializedPens)\n\t{\n\t\tg_bInitializedPens = true;\n\t\torangePen.SetColour(255,128,0);\n\t\tyellowPen.SetColour(255,255,0);\n\t}\n}\n\nbool vtStructureLayer::GetExtent(DRECT &rect)\n{\n\tif (IsEmpty())\n\t\treturn false;\n\n\tGetExtents(rect);\n\n\t\/\/ expand by 10 meters\n\trect.left -= 10.0f;\n\trect.right += 10.0f;\n\trect.bottom -= 10.0f;\n\trect.top += 10.0f;\n\n\treturn true;\n}\n\n#define BLENGTH 5\n\nvoid vtStructureLayer::DrawLayer(wxDC* pDC, vtScaledView *pView)\n{\n\tint structs = GetSize();\n\tif (!structs)\n\t\treturn;\n\n\tpDC->SetPen(orangePen);\n\tpDC->SetBrush(*wxTRANSPARENT_BRUSH);\n\tbool bSel = false;\n\n\tm_size = pView->sdx(20);\n\tif (m_size > 5) m_size = 5;\n\tif (m_size < 1) m_size = 1;\n\n\tfor (int i = 0; i < structs; i++)\n\t{\n\t\t\/\/ draw each building\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (bld)\n\t\t{\n\t\t\tif (str->IsSelected())\n\t\t\t{\n\t\t\t\tif (!bSel)\n\t\t\t\t{\n\t\t\t\t\tpDC->SetPen(yellowPen);\n\t\t\t\t\tbSel = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (bSel)\n\t\t\t\t{\n\t\t\t\t\tpDC->SetPen(orangePen);\n\t\t\t\t\tbSel = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tDrawBuilding(pDC, pView, bld);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvtFence *fen = str->GetFence();\n\t\t\tif (fen)\n\t\t\t{\n\t\t\t\t\/\/ TODO\n\t\t\t}\n\t\t}\n\t}\n}\n\n#define MAX_SIDES\t100\nstatic wxPoint array[MAX_SIDES];\n\nvoid vtStructureLayer::DrawBuilding(wxDC* pDC, vtScaledView *pView, vtBuilding *bld)\n{\n\tDPoint2 corner[4];\n\tfloat fWidth, fDepth, fRotation;\n\tint j;\n\n\twxPoint origin;\n\tpView->screen(bld->GetLocation(), origin);\n\n\tpDC->DrawLine(origin.x-m_size, origin.y, origin.x+m_size+1, origin.y);\n\tpDC->DrawLine(origin.x, origin.y-m_size, origin.x, origin.y+m_size+1);\n\n\tif (bld->GetShape() == SHAPE_POLY)\n\t{\n\t\tDLine2 &dl = bld->GetFootprint();\n\t\tint size = dl.GetSize();\n\t\tfor (j = 0; j < size && j < MAX_SIDES-1; j++)\n\t\t\tpView->screen(dl.GetAt(j), array[j]);\n\t\tpView->screen(dl.GetAt(0), array[j++]);\n\n\t\tpDC->DrawLines(j, array);\n\t}\n\tif (bld->GetShape() == SHAPE_CIRCLE)\n\t{\n\t\tint size = pView->sdx(bld->GetRadius());\n\t\tpDC->DrawEllipse(origin.x-size, origin.y-size,\n\t\t\tsize<<1, size<<1);\n\t}\n\tif (bld->GetShape() == SHAPE_RECTANGLE)\n\t{\n\t\tbld->GetRectangle(fWidth, fDepth);\n\t\tbld->GetRotation(fRotation);\n\t\tif (fRotation == -1.0f) fRotation = 0.0f;\n\t\tDPoint2 pt(fWidth \/ 2.0, fDepth \/ 2.0);\n\t\tcorner[0].Set(-pt.x, pt.y);\n\t\tcorner[1].Set(pt.x, pt.y);\n\t\tcorner[2].Set(pt.x, -pt.y);\n\t\tcorner[3].Set(-pt.x, -pt.y);\n\t\tcorner[0].Rotate(fRotation);\n\t\tcorner[1].Rotate(fRotation);\n\t\tcorner[2].Rotate(fRotation);\n\t\tcorner[3].Rotate(fRotation);\n\t\tarray[0] = origin + pView->screen_delta(corner[0]);\n\t\tarray[1] = origin + pView->screen_delta(corner[1]);\n\t\tarray[2] = origin + pView->screen_delta(corner[2]);\n\t\tarray[3] = origin + pView->screen_delta(corner[3]);\n\t\tarray[4] = array[0];\n\t\tpDC->DrawLines(5, array);\n\t}\n}\n\nbool vtStructureLayer::OnSave()\n{\n\treturn WriteXML(m_strFilename);\n}\n\nbool vtStructureLayer::OnLoad()\n{\n\treturn ReadXML(m_strFilename);\n}\n\nvoid vtStructureLayer::GetProjection(vtProjection &proj)\n{\n\tproj = m_proj;\n}\n\nbool vtStructureLayer::ConvertProjection(vtProjection &proj)\n{\n\tif (proj == m_proj)\n\t\treturn true;\n\n\t\/\/ Create conversion object\n\tvtProjection Source;\n\tGetProjection(Source);\n\tOCT *trans = OGRCreateCoordinateTransformation(&Source, &proj);\n\tif (!trans)\n\t\treturn false;\t\t\/\/ inconvertible projections\n\n\tDPoint2 loc;\n\tint i;\n\tint count = GetSize();\n\tfor (i = 0; i < count; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (bld)\n\t\t{\n\t\t\tloc = bld->GetLocation();\n\t\t\ttrans->Transform(1, &loc.x, &loc.y);\n\t\t\tbld->SetLocation(loc);\n\t\t}\n\t\tvtFence *fen = str->GetFence();\n\t\tif (fen)\n\t\t{\n\t\t\t\/\/ TODO\n\t\t}\n\t}\n\n\tdelete trans;\n\treturn false;\n}\n\nbool vtStructureLayer::AppendDataFrom(vtLayer *pL)\n{\n\t\/\/ safety check\n\tif (pL->GetType() != LT_STRUCTURE)\n\t\treturn false;\n\n\tvtStructureLayer *pFrom = (vtStructureLayer *)pL;\n\n\tint count = pFrom->GetSize();\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tvtStructure *str = pFrom->GetAt(i);\n\t\tAppend(str);\n\t}\n\treturn true;\n}\n\nvoid vtStructureLayer::Offset(const DPoint2 &p)\n{\n\tint npoints = GetSize();\n\tif (!npoints)\n\t\treturn;\n\n\tDPoint2 temp;\n\tfor (int i = 0; i < npoints; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (bld)\n\t\t\tbld->Offset(p);\n\t\tvtFence *fen = str->GetFence();\n\t\tif (fen)\n\t\t{\n\t\t\t\/\/ TODO\n\t\t}\n\t}\n}\n\n\/\/\n\/\/ Locate the closest building that is no more than epsilon units in either\n\/\/ dimension away from point.\n\/\/\n\/\/ Return NULL if there is no building.\n\/\/\nvtStructure *vtStructureLayer::FindBuilding(DPoint2 &point, double epsilon)\n{\n\tint count = GetSize();\n\tDPoint2 loc, diff;\n\tdouble dist2, closest = 1.0E10f, eps2 = epsilon * epsilon;\n\n\tvtStructure *best_bld = NULL;\n\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (!bld)\n\t\t\tcontinue;\n\t\tloc = bld->GetLocation();\n\t\tdiff = loc - point;\n\t\tdist2 = diff.x*diff.x + diff.y*diff.y;\n\t\tif (dist2 < eps2)\n\t\t{\n\t\t\tif (dist2 < closest)\n\t\t\t{\n\t\t\t\tclosest = dist2;\n\t\t\t\tbest_bld = str;\n\t\t\t}\n\t\t}\n\t}\n\treturn best_bld;\n}\n\nbool vtStructureLayer::EditBuildingProperties()\n{\n\tint count = 0;\n\tvtBuilding *bld_selected;\n\n\tint size = GetSize();\n\tfor (int i = 0; i < size; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (bld && str->IsSelected())\n\t\t{\n\t\t\tcount++;\n\t\t\tbld_selected = bld;\n\t\t}\n\t}\n\tif (count != 1)\n\t\treturn false;\n\n\t\/\/ for now, assume they will change something (pessimistic)\n\tSetModified(true);\n\n\tBuildingDlg dlg(NULL, -1, \"Building Properties\", wxDefaultPosition);\n\t\tdlg.Setup(bld_selected);\n\treturn (dlg.ShowModal() == wxID_OK);\n}\n\nvoid vtStructureLayer::InvertSelection()\n{\n\tint i, size = GetSize();\n\tfor (i = 0; i < size; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tstr->Select(!str->IsSelected());\n\t}\n}\n\n\/\/\n\/\/ Helper: find the index of a field in a DBF file, given the name of the field.\n\/\/ Returns -1 if not found.\n\/\/\nint FindDBField(DBFHandle db, const char *field_name)\n{\n\tint count = DBFGetFieldCount(db);\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint pnWidth, pnDecimals;\n\t\tchar pszFieldName[80];\n\t\tDBFFieldType fieldtype = DBFGetFieldInfo(db, i,\n\t\t\tpszFieldName, &pnWidth, &pnDecimals );\n\t\tif (!stricmp(field_name, pszFieldName))\n\t\t\treturn i;\n\t}\n\treturn -1;\n}\n\nvoid vtStructureLayer::AddElementsFromSHP(const char *filename, vtProjection &proj)\n{\n\t\/\/Open the SHP File & Get Info from SHP:\n\tSHPHandle hSHP = SHPOpen(filename, \"rb\");\n\tif (hSHP == NULL)\n\t\treturn;\n\n\t\/\/  Get number of polys (m_iNumPolys) and type of data (nShapeType)\n\tint\t\tnElem;\n\tint\t\tnShapeType;\n    double\tadfMinBound[4], adfMaxBound[4];\n\tSHPGetInfo(hSHP, &nElem, &nShapeType, adfMinBound, adfMaxBound);\n\n\t\/\/  Check Shape Type, Building outlines should be Poly data\n\tif (nShapeType == SHPT_POINT)\n\t\tAddElementsFromSHPPoints(hSHP, nElem);\n\telse if (nShapeType == SHPT_POLYGON)\n\t\tAddElementsFromSHPPolygons(filename, hSHP, nElem);\n\n\tm_proj = proj;\t\/\/ Set projection\n\n\tSHPClose(hSHP);\n}\n\nvoid vtStructureLayer::AddElementsFromSHPPoints(SHPHandle hSHP, int nElem)\n{\n\t\/\/ Initialize arrays\n\tSetMaxSize(nElem);\n\n\t\/\/ Read Points from SHP\n\tint i;\n\tSHPObject *psShape;\n\tfor (i = 0; i < nElem; i++)\n\t{\n\t\t\/\/ Get the i-th Point in the SHP file\n\t\tpsShape = SHPReadObject(hSHP, i);\n\n\t\tvtBuilding *new_bld = new vtBuilding();\n\t\tnew_bld->SetShape(SHAPE_RECTANGLE);\n\t\tnew_bld->SetLocation(DPoint2(psShape->padfX[0], psShape->padfY[0]));\n\t\tnew_bld->SetStories(1);\n\t\tAddBuilding(new_bld);\n\n\t\tSHPDestroyObject(psShape);\n\t}\n}\n\nvoid vtStructureLayer::AddElementsFromSHPPolygons(const char *filename,\n\t\t\t\t\t\t\t\t\t\t\t\t SHPHandle hSHP, int nElem)\n{\n\t\/\/ Open DBF File & Get DBF Info:\n\tDBFHandle db = DBFOpen(filename, \"rb\");\n\tif (db == NULL)\n\t\treturn;\n\n\t\/\/ Check for field with number of stories\n\tint stories_field = FindDBField(db, \"Stories\");\n\n\t\/\/ Initialize arrays\n\tSetMaxSize(nElem);\n\n\t\/\/ Read Polys from SHP\n\tint i;\n\tSHPObject *psShape;\n\tfor (i = 0; i < nElem; i++)\n\t{\n\t\t\/\/ Get the i-th Poly in the SHP file\n\t\tpsShape = SHPReadObject(hSHP, i);\n\n\t\t\/\/ Store each SHP Poly as Building Footprint\n\n\t\t\/\/ The SHP appears to repeat the first point as the last, so ignore\n\t\t\/\/ the last point.\n\t\tint num_points = psShape->nVertices-1;\n\n\t\tvtBuilding *new_bld = new vtBuilding();\n\t\tnew_bld->SetShape(SHAPE_POLY);\n\n\t\tDLine2 foot;\n\t\tfoot.SetSize(num_points);\n\n\t\tint j, k;\n\t\tfor (j = 0; j < num_points; j++)\n\t\t{\n\t\t\t\/\/ The SHP polygons appear to be clockwise - but the vtBuilding\n\t\t\t\/\/  convention is counter-clockwise, so reverse the order.\n\t\t\tk = num_points-1-j;\n\n\t\t\tfoot.SetAt(j, DPoint2(psShape->padfX[k], psShape->padfY[k]));\n\t\t}\n\t\tnew_bld->SetFootprint(foot);\n\t\tnew_bld->SetCenterFromPoly();\n\n\t\tint num_stories = 1;\n\t\tif (stories_field != -1)\n\t\t{\n\t\t\t\/\/ attempt to get number of stories from the DBF\n\t\t\tnum_stories = DBFReadIntegerAttribute(db, i, stories_field);\n\t\t\tif (num_stories < 1)\n\t\t\t\tnum_stories = 1;\n\t\t}\n\t\tnew_bld->SetStories(num_stories);\n\n\t\tAddBuilding(new_bld);\n\n\t\tSHPDestroyObject(psShape);\n\t}\n\tDBFClose(db);\n}\n\n<commit_msg>fixed setting of Projection<commit_after>\/\/\n\/\/ StructLayer.cpp\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"Frame.h\"\n#include \"StructLayer.h\"\n#include \"ScaledView.h\"\n#include \"BuildingDlg.h\"\n\n#ifndef _MSC_VER\t\/\/ for non-MSVC\n#include <string.h>\n#define stricmp strcasecmp\n#endif\n\nwxPen orangePen;\nwxPen yellowPen;\nstatic bool g_bInitializedPens = false;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvtStructureLayer::vtStructureLayer() : vtLayer(LT_STRUCTURE)\n{\n\tm_strFilename = \"Untitled.xml\";\n\n\tif (!g_bInitializedPens)\n\t{\n\t\tg_bInitializedPens = true;\n\t\torangePen.SetColour(255,128,0);\n\t\tyellowPen.SetColour(255,255,0);\n\t}\n}\n\nbool vtStructureLayer::GetExtent(DRECT &rect)\n{\n\tif (IsEmpty())\n\t\treturn false;\n\n\tGetExtents(rect);\n\n\t\/\/ expand by 10 meters\n\trect.left -= 10.0f;\n\trect.right += 10.0f;\n\trect.bottom -= 10.0f;\n\trect.top += 10.0f;\n\n\treturn true;\n}\n\n#define BLENGTH 5\n\nvoid vtStructureLayer::DrawLayer(wxDC* pDC, vtScaledView *pView)\n{\n\tint structs = GetSize();\n\tif (!structs)\n\t\treturn;\n\n\tpDC->SetPen(orangePen);\n\tpDC->SetBrush(*wxTRANSPARENT_BRUSH);\n\tbool bSel = false;\n\n\tm_size = pView->sdx(20);\n\tif (m_size > 5) m_size = 5;\n\tif (m_size < 1) m_size = 1;\n\n\tfor (int i = 0; i < structs; i++)\n\t{\n\t\t\/\/ draw each building\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (bld)\n\t\t{\n\t\t\tif (str->IsSelected())\n\t\t\t{\n\t\t\t\tif (!bSel)\n\t\t\t\t{\n\t\t\t\t\tpDC->SetPen(yellowPen);\n\t\t\t\t\tbSel = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (bSel)\n\t\t\t\t{\n\t\t\t\t\tpDC->SetPen(orangePen);\n\t\t\t\t\tbSel = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tDrawBuilding(pDC, pView, bld);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvtFence *fen = str->GetFence();\n\t\t\tif (fen)\n\t\t\t{\n\t\t\t\t\/\/ TODO\n\t\t\t}\n\t\t}\n\t}\n}\n\n#define MAX_SIDES\t100\nstatic wxPoint array[MAX_SIDES];\n\nvoid vtStructureLayer::DrawBuilding(wxDC* pDC, vtScaledView *pView, vtBuilding *bld)\n{\n\tDPoint2 corner[4];\n\tfloat fWidth, fDepth, fRotation;\n\tint j;\n\n\twxPoint origin;\n\tpView->screen(bld->GetLocation(), origin);\n\n\tpDC->DrawLine(origin.x-m_size, origin.y, origin.x+m_size+1, origin.y);\n\tpDC->DrawLine(origin.x, origin.y-m_size, origin.x, origin.y+m_size+1);\n\n\tif (bld->GetShape() == SHAPE_POLY)\n\t{\n\t\tDLine2 &dl = bld->GetFootprint();\n\t\tint size = dl.GetSize();\n\t\tfor (j = 0; j < size && j < MAX_SIDES-1; j++)\n\t\t\tpView->screen(dl.GetAt(j), array[j]);\n\t\tpView->screen(dl.GetAt(0), array[j++]);\n\n\t\tpDC->DrawLines(j, array);\n\t}\n\tif (bld->GetShape() == SHAPE_CIRCLE)\n\t{\n\t\tint size = pView->sdx(bld->GetRadius());\n\t\tpDC->DrawEllipse(origin.x-size, origin.y-size,\n\t\t\tsize<<1, size<<1);\n\t}\n\tif (bld->GetShape() == SHAPE_RECTANGLE)\n\t{\n\t\tbld->GetRectangle(fWidth, fDepth);\n\t\tbld->GetRotation(fRotation);\n\t\tif (fRotation == -1.0f) fRotation = 0.0f;\n\t\tDPoint2 pt(fWidth \/ 2.0, fDepth \/ 2.0);\n\t\tcorner[0].Set(-pt.x, pt.y);\n\t\tcorner[1].Set(pt.x, pt.y);\n\t\tcorner[2].Set(pt.x, -pt.y);\n\t\tcorner[3].Set(-pt.x, -pt.y);\n\t\tcorner[0].Rotate(fRotation);\n\t\tcorner[1].Rotate(fRotation);\n\t\tcorner[2].Rotate(fRotation);\n\t\tcorner[3].Rotate(fRotation);\n\t\tarray[0] = origin + pView->screen_delta(corner[0]);\n\t\tarray[1] = origin + pView->screen_delta(corner[1]);\n\t\tarray[2] = origin + pView->screen_delta(corner[2]);\n\t\tarray[3] = origin + pView->screen_delta(corner[3]);\n\t\tarray[4] = array[0];\n\t\tpDC->DrawLines(5, array);\n\t}\n}\n\nbool vtStructureLayer::OnSave()\n{\n\treturn WriteXML(m_strFilename);\n}\n\nbool vtStructureLayer::OnLoad()\n{\n\treturn ReadXML(m_strFilename);\n}\n\nvoid vtStructureLayer::GetProjection(vtProjection &proj)\n{\n\tproj = m_proj;\n}\n\nbool vtStructureLayer::ConvertProjection(vtProjection &proj)\n{\n\tif (proj == m_proj)\n\t\treturn true;\n\n\t\/\/ Create conversion object\n\tvtProjection Source;\n\tGetProjection(Source);\n\tOCT *trans = OGRCreateCoordinateTransformation(&Source, &proj);\n\tif (!trans)\n\t\treturn false;\t\t\/\/ inconvertible projections\n\n\tDPoint2 loc;\n\tint i;\n\tint count = GetSize();\n\tfor (i = 0; i < count; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (bld)\n\t\t{\n\t\t\tloc = bld->GetLocation();\n\t\t\ttrans->Transform(1, &loc.x, &loc.y);\n\t\t\tbld->SetLocation(loc);\n\t\t}\n\t\tvtFence *fen = str->GetFence();\n\t\tif (fen)\n\t\t{\n\t\t\t\/\/ TODO\n\t\t}\n\t}\n\n\t\/\/ set the projection\n\tm_proj = proj;\n\n\tdelete trans;\n\treturn true;\n}\n\nbool vtStructureLayer::AppendDataFrom(vtLayer *pL)\n{\n\t\/\/ safety check\n\tif (pL->GetType() != LT_STRUCTURE)\n\t\treturn false;\n\n\tvtStructureLayer *pFrom = (vtStructureLayer *)pL;\n\n\tint count = pFrom->GetSize();\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tvtStructure *str = pFrom->GetAt(i);\n\t\tAppend(str);\n\t}\n\treturn true;\n}\n\nvoid vtStructureLayer::Offset(const DPoint2 &p)\n{\n\tint npoints = GetSize();\n\tif (!npoints)\n\t\treturn;\n\n\tDPoint2 temp;\n\tfor (int i = 0; i < npoints; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (bld)\n\t\t\tbld->Offset(p);\n\t\tvtFence *fen = str->GetFence();\n\t\tif (fen)\n\t\t{\n\t\t\t\/\/ TODO\n\t\t}\n\t}\n}\n\n\/\/\n\/\/ Locate the closest building that is no more than epsilon units in either\n\/\/ dimension away from point.\n\/\/\n\/\/ Return NULL if there is no building.\n\/\/\nvtStructure *vtStructureLayer::FindBuilding(DPoint2 &point, double epsilon)\n{\n\tint count = GetSize();\n\tDPoint2 loc, diff;\n\tdouble dist2, closest = 1.0E10f, eps2 = epsilon * epsilon;\n\n\tvtStructure *best_bld = NULL;\n\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (!bld)\n\t\t\tcontinue;\n\t\tloc = bld->GetLocation();\n\t\tdiff = loc - point;\n\t\tdist2 = diff.x*diff.x + diff.y*diff.y;\n\t\tif (dist2 < eps2)\n\t\t{\n\t\t\tif (dist2 < closest)\n\t\t\t{\n\t\t\t\tclosest = dist2;\n\t\t\t\tbest_bld = str;\n\t\t\t}\n\t\t}\n\t}\n\treturn best_bld;\n}\n\nbool vtStructureLayer::EditBuildingProperties()\n{\n\tint count = 0;\n\tvtBuilding *bld_selected;\n\n\tint size = GetSize();\n\tfor (int i = 0; i < size; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tvtBuilding *bld = str->GetBuilding();\n\t\tif (bld && str->IsSelected())\n\t\t{\n\t\t\tcount++;\n\t\t\tbld_selected = bld;\n\t\t}\n\t}\n\tif (count != 1)\n\t\treturn false;\n\n\t\/\/ for now, assume they will change something (pessimistic)\n\tSetModified(true);\n\n\tBuildingDlg dlg(NULL, -1, \"Building Properties\", wxDefaultPosition);\n\t\tdlg.Setup(bld_selected);\n\treturn (dlg.ShowModal() == wxID_OK);\n}\n\nvoid vtStructureLayer::InvertSelection()\n{\n\tint i, size = GetSize();\n\tfor (i = 0; i < size; i++)\n\t{\n\t\tvtStructure *str = GetAt(i);\n\t\tstr->Select(!str->IsSelected());\n\t}\n}\n\n\/\/\n\/\/ Helper: find the index of a field in a DBF file, given the name of the field.\n\/\/ Returns -1 if not found.\n\/\/\nint FindDBField(DBFHandle db, const char *field_name)\n{\n\tint count = DBFGetFieldCount(db);\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint pnWidth, pnDecimals;\n\t\tchar pszFieldName[80];\n\t\tDBFFieldType fieldtype = DBFGetFieldInfo(db, i,\n\t\t\tpszFieldName, &pnWidth, &pnDecimals );\n\t\tif (!stricmp(field_name, pszFieldName))\n\t\t\treturn i;\n\t}\n\treturn -1;\n}\n\nvoid vtStructureLayer::AddElementsFromSHP(const char *filename, vtProjection &proj)\n{\n\t\/\/Open the SHP File & Get Info from SHP:\n\tSHPHandle hSHP = SHPOpen(filename, \"rb\");\n\tif (hSHP == NULL)\n\t\treturn;\n\n\t\/\/  Get number of polys (m_iNumPolys) and type of data (nShapeType)\n\tint\t\tnElem;\n\tint\t\tnShapeType;\n    double\tadfMinBound[4], adfMaxBound[4];\n\tSHPGetInfo(hSHP, &nElem, &nShapeType, adfMinBound, adfMaxBound);\n\n\t\/\/  Check Shape Type, Building outlines should be Poly data\n\tif (nShapeType == SHPT_POINT)\n\t\tAddElementsFromSHPPoints(hSHP, nElem);\n\telse if (nShapeType == SHPT_POLYGON)\n\t\tAddElementsFromSHPPolygons(filename, hSHP, nElem);\n\n\tm_proj = proj;\t\/\/ Set projection\n\n\tSHPClose(hSHP);\n}\n\nvoid vtStructureLayer::AddElementsFromSHPPoints(SHPHandle hSHP, int nElem)\n{\n\t\/\/ Initialize arrays\n\tSetMaxSize(nElem);\n\n\t\/\/ Read Points from SHP\n\tint i;\n\tSHPObject *psShape;\n\tfor (i = 0; i < nElem; i++)\n\t{\n\t\t\/\/ Get the i-th Point in the SHP file\n\t\tpsShape = SHPReadObject(hSHP, i);\n\n\t\tvtBuilding *new_bld = new vtBuilding();\n\t\tnew_bld->SetShape(SHAPE_RECTANGLE);\n\t\tnew_bld->SetLocation(DPoint2(psShape->padfX[0], psShape->padfY[0]));\n\t\tnew_bld->SetStories(1);\n\t\tAddBuilding(new_bld);\n\n\t\tSHPDestroyObject(psShape);\n\t}\n}\n\nvoid vtStructureLayer::AddElementsFromSHPPolygons(const char *filename,\n\t\t\t\t\t\t\t\t\t\t\t\t SHPHandle hSHP, int nElem)\n{\n\t\/\/ Open DBF File & Get DBF Info:\n\tDBFHandle db = DBFOpen(filename, \"rb\");\n\tif (db == NULL)\n\t\treturn;\n\n\t\/\/ Check for field with number of stories\n\tint stories_field = FindDBField(db, \"Stories\");\n\n\t\/\/ Initialize arrays\n\tSetMaxSize(nElem);\n\n\t\/\/ Read Polys from SHP\n\tint i;\n\tSHPObject *psShape;\n\tfor (i = 0; i < nElem; i++)\n\t{\n\t\t\/\/ Get the i-th Poly in the SHP file\n\t\tpsShape = SHPReadObject(hSHP, i);\n\n\t\t\/\/ Store each SHP Poly as Building Footprint\n\n\t\t\/\/ The SHP appears to repeat the first point as the last, so ignore\n\t\t\/\/ the last point.\n\t\tint num_points = psShape->nVertices-1;\n\n\t\tvtBuilding *new_bld = new vtBuilding();\n\t\tnew_bld->SetShape(SHAPE_POLY);\n\n\t\tDLine2 foot;\n\t\tfoot.SetSize(num_points);\n\n\t\tint j, k;\n\t\tfor (j = 0; j < num_points; j++)\n\t\t{\n\t\t\t\/\/ The SHP polygons appear to be clockwise - but the vtBuilding\n\t\t\t\/\/  convention is counter-clockwise, so reverse the order.\n\t\t\tk = num_points-1-j;\n\n\t\t\tfoot.SetAt(j, DPoint2(psShape->padfX[k], psShape->padfY[k]));\n\t\t}\n\t\tnew_bld->SetFootprint(foot);\n\t\tnew_bld->SetCenterFromPoly();\n\n\t\tint num_stories = 1;\n\t\tif (stories_field != -1)\n\t\t{\n\t\t\t\/\/ attempt to get number of stories from the DBF\n\t\t\tnum_stories = DBFReadIntegerAttribute(db, i, stories_field);\n\t\t\tif (num_stories < 1)\n\t\t\t\tnum_stories = 1;\n\t\t}\n\t\tnew_bld->SetStories(num_stories);\n\n\t\tAddBuilding(new_bld);\n\n\t\tSHPDestroyObject(psShape);\n\t}\n\tDBFClose(db);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <ContentForgeTool.h>\n#include <Render\/ShaderMetaCommon.h>\n#include <Utils.h>\n#include <ParamsUtils.h>\n#include <Subprocess.h>\n#include <CLI11.hpp>\n\nnamespace fs = std::filesystem;\n\n\/\/ Set working directory to $(TargetDir)\n\/\/ Example args:\n\/\/ -s src\/sky --path Data ..\/..\/..\/content --ibl -b -t\n\nclass CSkyboxTool : public CContentForgeTool\n{\nprotected:\n\n\tData::CSchemeSet _SceneSchemes;\n\n\tstd::map<std::string, std::string> _EffectsByType;\n\tstd::map<std::string, std::string> _EffectParamAliases;\n\n\tstd::string _ResourceRoot;\n\tstd::string _SchemeFile;\n\tstd::string _SettingsFile;\n\tbool        _CalcIBL = false;\n\tbool        _OutputBin = false;\n\tbool        _OutputHRD = false; \/\/ For debug purposes, saves scene hierarchies in a human-readable format\n\npublic:\n\n\tCSkyboxTool(const std::string& Name, const std::string& Desc, CVersion Version)\n\t\t: CContentForgeTool(Name, Desc, Version)\n\t\t, _ResourceRoot(\"Data:\")\n\t{\n\t\t\/\/ Set default before parsing command line\n\t\t_SchemeFile = \"..\/schemes\/scene.dss\";\n\t\t_SettingsFile = \"..\/schemes\/settings.hrd\";\n\t}\n\n\tvirtual bool SupportsMultithreading() const override\n\t{\n\t\t\/\/ FIXME: must handle duplicate targets (for example 2 metafiles writing the same resulting file, like depth_atest_ps)\n\t\t\/\/ FIXME: CStrID\n\t\treturn false;\n\t}\n\n\tvirtual int Init() override\n\t{\n\t\tif (_ResourceRoot.empty())\n\t\t\tif (_LogVerbosity >= EVerbosity::Warnings)\n\t\t\t\tstd::cout << \"Resource root is empty, external references may not be resolved from the game!\";\n\n\t\tif (!_OutputHRD) _OutputBin = true;\n\n\t\tif (_OutputBin)\n\t\t{\n\t\t\tif (!ParamsUtils::LoadSchemes(_SchemeFile.c_str(), _SceneSchemes))\n\t\t\t{\n\t\t\t\tstd::cout << \"Couldn't load scene binary serialization scheme from \" << _SchemeFile;\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t}\n\n\t\t{\n\t\t\tData::CParams EffectSettings;\n\t\t\tif (!ParamsUtils::LoadParamsFromHRD(_SettingsFile.c_str(), EffectSettings))\n\t\t\t{\n\t\t\t\tstd::cout << \"Couldn't load effect settings from \" << _SettingsFile;\n\t\t\t\treturn 3;\n\t\t\t}\n\n\t\t\tconst Data::CParams* pMap;\n\t\t\tif (ParamsUtils::TryGetParam(pMap, EffectSettings, \"Effects\"))\n\t\t\t{\n\t\t\t\tfor (const auto& Pair : *pMap)\n\t\t\t\t\t_EffectsByType.emplace(Pair.first.ToString(), Pair.second.GetValue<std::string>());\n\t\t\t}\n\t\t\tif (ParamsUtils::TryGetParam(pMap, EffectSettings, \"Params\"))\n\t\t\t{\n\t\t\t\tfor (const auto& Pair : *pMap)\n\t\t\t\t\t_EffectParamAliases.emplace(Pair.first.ToString(), Pair.second.GetValue<std::string>());\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\tvirtual void ProcessCommandLine(CLI::App& CLIApp) override\n\t{\n\t\t\/\/???use --project-file instead of --res-root + --settings?\n\t\tCContentForgeTool::ProcessCommandLine(CLIApp);\n\t\tCLIApp.add_option(\"--res-root\", _ResourceRoot, \"Resource root prefix for referencing external subresources by path\");\n\t\tCLIApp.add_option(\"--scheme,--schema\", _SchemeFile, \"Scene binary serialization scheme file path\");\n\t\tCLIApp.add_option(\"--settings\", _SettingsFile, \"Settings file path\");\n\t\tCLIApp.add_flag(\"-t,--txt\", _OutputHRD, \"Output scenes in a human-readable format, suitable for debugging only\");\n\t\tCLIApp.add_flag(\"-b,--bin\", _OutputBin, \"Output scenes in a binary format, suitable for loading into the engine\");\n\t\tCLIApp.add_flag(\"--ibl\", _CalcIBL, \"Calculate image-based lighting resources (IEM, PMREM)\");\n\t}\n\n\tfs::path GetPath(const Data::CParams& TaskParams, const char* pPathID)\n\t{\n\t\tfs::path Result;\n\n\t\tstd::string PathValue;\n\t\tif (ParamsUtils::TryGetParam(PathValue, TaskParams, pPathID))\n\t\t\tResult = PathValue;\n\t\telse if (ParamsUtils::TryGetParam(PathValue, TaskParams, \"Output\"))\n\t\t\tResult = PathValue;\n\t\telse return Result;\n\n\t\tif (!_RootDir.empty() && Result.is_relative())\n\t\t\tResult = fs::path(_RootDir) \/ Result;\n\n\t\treturn Result;\n\t}\n\n\tconst std::string& GetEffectParamID(const std::string& Alias)\n\t{\n\t\tauto It = _EffectParamAliases.find(Alias);\n\t\treturn (It == _EffectParamAliases.cend()) ? Alias : It->second;\n\t}\n\n\tvirtual bool ProcessTask(CContentForgeTask& Task) override\n\t{\n\t\t\/\/ TODO: check whether the metafile can be processed by this tool\n\n\t\tconst std::string TaskName = Task.TaskID.ToString();\n\n\t\tstd::string SkyboxFileName = Task.SrcFilePath.filename().generic_string();\n\t\tToLower(SkyboxFileName);\n\n\t\t\/\/ Generate material\n\n\t\tstd::string MaterialID;\n\n\t\tconst auto TexturePath = GetPath(Task.Params, \"TextureOutput\");\n\n\t\tauto EffectIt = _EffectsByType.find(\"MetallicRoughnessSkybox\");\n\t\tif (EffectIt == _EffectsByType.cend() || EffectIt->second.empty())\n\t\t{\n\t\t\tTask.Log.LogError(\"Material type MetallicRoughnessTerrain has no mapped DEM effect file in effect settings\");\n\t\t\treturn false;\n\t\t}\n\n\t\tCMaterialParams MtlParamTable;\n\t\tauto Path = ResolvePathAliases(EffectIt->second).generic_string();\n\t\tTask.Log.LogDebug(\"Opening effect \" + Path);\n\t\tif (!GetEffectMaterialParams(MtlParamTable, Path, Task.Log))\n\t\t{\n\t\t\tTask.Log.LogError(\"Error reading material param table for effect \" + Path);\n\t\t\treturn false;\n\t\t}\n\n\t\tData::CParams MtlParams;\n\n\t\tconst auto& SkyboxTextureID = GetEffectParamID(\"SkyboxTexture\");\n\t\tif (MtlParamTable.HasResource(SkyboxTextureID))\n\t\t{\n\t\t\tauto DestPath = TexturePath \/ SkyboxFileName;\n\t\t\tfs::create_directories(DestPath.parent_path());\n\t\t\tstd::error_code ec;\n\t\t\tif (!fs::copy_file(Task.SrcFilePath, DestPath, fs::copy_options::overwrite_existing, ec))\n\t\t\t{\n\t\t\t\tTask.Log.LogError(\"Error copying texture from \" + Task.SrcFilePath.generic_string() + \" to \" + DestPath.generic_string() + \": \" + ec.message());\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tMtlParams.emplace_back(CStrID(SkyboxTextureID), _ResourceRoot + fs::relative(DestPath, _RootDir).generic_string());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tTask.Log.LogError(\"No SkyboxTexture (\" + SkyboxTextureID + \") parameter found in a material\");\n\t\t\treturn false;\n\t\t}\n\n\t\t{\n\t\t\tauto DestPath = GetPath(Task.Params, \"MaterialOutput\") \/ (TaskName + \".mtl\");\n\n\t\t\tfs::create_directories(DestPath.parent_path());\n\n\t\t\tstd::ofstream File(DestPath, std::ios_base::binary | std::ios_base::trunc);\n\n\t\t\tif (!SaveMaterial(File, EffectIt->second, MtlParamTable, MtlParams, Task.Log)) return false;\n\n\t\t\tMaterialID = _ResourceRoot + fs::relative(DestPath, _RootDir).generic_string();\n\t\t}\n\n\t\t\/\/ Calculate IBL resources\n\n\t\tstd::string IEMID, PMREMID;\n\n\t\tif (_CalcIBL)\n\t\t{\n\t\t\t\/\/ See https:\/\/seblagarde.wordpress.com\/2012\/06\/10\/amd-cubemapgen-for-physically-based-rendering\/\n\n\t\t\t\/\/ Calculate IEM\n\n\t\t\tauto IEMPath = TexturePath \/ (fs::path(SkyboxFileName).filename().replace_extension().string() + \"_iem.dds\");\n\t\t\tconst int IEMDimensionSize = ParamsUtils::GetParam(Task.Params, \"IEMDimensionSize\", 128);\n\t\t\tconst std::string IEMFormat = ParamsUtils::GetParam(Task.Params, \"IEMFormat\", std::string(\"A8R8G8B8\"));\n\n\t\t\tconst std::string IEMCmdLine = \"cubemapgen\/mcmg.exe -IrradianceCubemap -importCubeDDS:\\\"\" + Task.SrcFilePath.string() +\n\t\t\t\t\"\\\" -exportCubeDDS -exportFilename:\\\"\" + IEMPath.string() + \"\\\" -exportSize:\" + std::to_string(IEMDimensionSize) +\n\t\t\t\t\" -exportPixelFormat:\" + IEMFormat + \" -consoleErrorOutput -exit\";\n\t\t\tif (RunSubprocess(IEMCmdLine, &Task.Log) == 0)\n\t\t\t{\n\t\t\t\tIEMID = _ResourceRoot + fs::relative(IEMPath, _RootDir).generic_string();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tTask.Log.LogError(\"Error generating irradiance environment map (IEM)\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ Calculate PMREM (Mipmap mode)\n\n\t\t\tauto PMREMPath = TexturePath \/ (fs::path(SkyboxFileName).filename().replace_extension().string() + \"_pmrem.dds\");\n\t\t\tconst int PMREMDimensionSize = ParamsUtils::GetParam(Task.Params, \"PMREMDimensionSize\", 256);\n\t\t\tconst std::string PMREMFormat = ParamsUtils::GetParam(Task.Params, \"PMREMFormat\", std::string(\"A8R8G8B8\"));\n\t\t\tconst int PMREMMipCount = ParamsUtils::GetParam(Task.Params, \"PMREMMipCount\", 7);\n\t\t\tconst float PMREMGlossScale = ParamsUtils::GetParam(Task.Params, \"PMREMGlossScale\", 10.f);\n\t\t\tconst float PMREMGlossBias = ParamsUtils::GetParam(Task.Params, \"PMREMGlossBias\", 1.f);\n\n\t\t\tconst std::string PMREMCmdLine = \"cubemapgen\/mcmg.exe -filterTech:CosinePower -CosinePowerMipmapChainMode:Mipmap\"\n\t\t\t\t\" -NumMipmap:\" + std::to_string(PMREMMipCount) +\n\t\t\t\t\" -GlossScale:\" + std::to_string(PMREMGlossScale) +\n\t\t\t\t\" -GlossBias:\" + std::to_string(PMREMGlossBias) +\n\t\t\t\t\" -importCubeDDS:\\\"\" + Task.SrcFilePath.string() + \"\\\"\"\n\t\t\t\t\" -LightingModel:PhongBRDF -ExcludeBase -solidAngleWeighting -edgeFixupTech:Warp -importDegamma:1.0 -exportGamma:1.0 \"\n\t\t\t\t\" -exportCubeDDS -exportFilename:\\\"\" + PMREMPath.string() + \"\\\" -exportSize:\" + std::to_string(PMREMDimensionSize) +\n\t\t\t\t\" -exportPixelFormat:A8R8G8B8 -exportMipChain -consoleErrorOutput -exit\";\n\t\t\tif (RunSubprocess(PMREMCmdLine, &Task.Log) == 0)\n\t\t\t{\n\t\t\t\tPMREMID = _ResourceRoot + fs::relative(PMREMPath, _RootDir).generic_string();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tTask.Log.LogError(\"Error generating prefiltered mipmaped radiance environment map (PMREM)\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Write scene file\n\n\t\tData::CParams Result;\n\n\t\tData::CDataArray Attributes;\n\n\t\t{\n\t\t\tData::CParams Attribute;\n\t\t\tAttribute.emplace_back(CStrID(\"Class\"), 'SKBA'); \/\/ Frame::CSkyboxAttribute\n\t\t\tAttribute.emplace_back(CStrID(\"Material\"), MaterialID);\n\t\t\tAttributes.push_back(std::move(Attribute));\n\t\t}\n\n\t\tif (_CalcIBL)\n\t\t{\n\t\t\tData::CParams Attribute;\n\t\t\tAttribute.emplace_back(CStrID(\"Class\"), 'NAAL'); \/\/ Frame::CAmbientLightAttribute\n\t\t\tAttribute.emplace_back(CStrID(\"IrradianceMap\"), IEMID);\n\t\t\tAttribute.emplace_back(CStrID(\"RadianceEnvMap\"), PMREMID);\n\t\t\tAttributes.push_back(std::move(Attribute));\n\t\t}\n\n\t\tResult.emplace_back(CStrID(\"Attrs\"), std::move(Attributes));\n\n\t\tconst fs::path OutPath = GetPath(Task.Params, \"Output\");\n\n\t\tif (_OutputHRD)\n\t\t{\n\t\t\tconst auto DestPath = OutPath \/ (TaskName + \".hrd\");\n\t\t\tif (!ParamsUtils::SaveParamsToHRD(DestPath.string().c_str(), Result))\n\t\t\t{\n\t\t\t\tTask.Log.LogError(\"Error serializing \" + TaskName + \" to text\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tif (_OutputBin)\n\t\t{\n\t\t\tconst auto DestPath = OutPath \/ (Task.TaskID.ToString() + \".scn\");\n\t\t\tif (!ParamsUtils::SaveParamsByScheme(DestPath.string().c_str(), Result, CStrID(\"SceneNode\"), _SceneSchemes))\n\t\t\t{\n\t\t\t\tTask.Log.LogError(\"Error serializing \" + TaskName + \" to binary\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n};\n\nint main(int argc, const char** argv)\n{\n\tCSkyboxTool Tool(\"cf-skybox\", \"Cubemap to DeusExMachina skybox asset converter\", { 0, 1, 0 });\n\treturn Tool.Execute(argc, argv);\n}\n<commit_msg>cf-skybox less aggressive recalculation of IBL resources. Version 1.0.0.<commit_after>#include <ContentForgeTool.h>\n#include <Render\/ShaderMetaCommon.h>\n#include <Utils.h>\n#include <ParamsUtils.h>\n#include <Subprocess.h>\n#include <CLI11.hpp>\n\nnamespace fs = std::filesystem;\n\n\/\/ Set working directory to $(TargetDir)\n\/\/ Example args:\n\/\/ -s src\/sky --path Data ..\/..\/..\/content --ibl -b -t\n\nclass CSkyboxTool : public CContentForgeTool\n{\nprotected:\n\n\tData::CSchemeSet _SceneSchemes;\n\n\tstd::map<std::string, std::string> _EffectsByType;\n\tstd::map<std::string, std::string> _EffectParamAliases;\n\n\tstd::string _ResourceRoot;\n\tstd::string _SchemeFile;\n\tstd::string _SettingsFile;\n\tbool        _IBL = false;\n\tbool        _RecalcIBL = false;\n\tbool        _OutputBin = false;\n\tbool        _OutputHRD = false; \/\/ For debug purposes, saves scene hierarchies in a human-readable format\n\npublic:\n\n\tCSkyboxTool(const std::string& Name, const std::string& Desc, CVersion Version)\n\t\t: CContentForgeTool(Name, Desc, Version)\n\t\t, _ResourceRoot(\"Data:\")\n\t{\n\t\t\/\/ Set default before parsing command line\n\t\t_SchemeFile = \"..\/schemes\/scene.dss\";\n\t\t_SettingsFile = \"..\/schemes\/settings.hrd\";\n\t}\n\n\tvirtual bool SupportsMultithreading() const override\n\t{\n\t\t\/\/ FIXME: must handle duplicate targets (for example 2 metafiles writing the same resulting file, like depth_atest_ps)\n\t\t\/\/ FIXME: CStrID\n\t\treturn false;\n\t}\n\n\tvirtual int Init() override\n\t{\n\t\tif (_ResourceRoot.empty())\n\t\t\tif (_LogVerbosity >= EVerbosity::Warnings)\n\t\t\t\tstd::cout << \"Resource root is empty, external references may not be resolved from the game!\";\n\n\t\tif (!_OutputHRD) _OutputBin = true;\n\n\t\tif (_OutputBin)\n\t\t{\n\t\t\tif (!ParamsUtils::LoadSchemes(_SchemeFile.c_str(), _SceneSchemes))\n\t\t\t{\n\t\t\t\tstd::cout << \"Couldn't load scene binary serialization scheme from \" << _SchemeFile;\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t}\n\n\t\t{\n\t\t\tData::CParams EffectSettings;\n\t\t\tif (!ParamsUtils::LoadParamsFromHRD(_SettingsFile.c_str(), EffectSettings))\n\t\t\t{\n\t\t\t\tstd::cout << \"Couldn't load effect settings from \" << _SettingsFile;\n\t\t\t\treturn 3;\n\t\t\t}\n\n\t\t\tconst Data::CParams* pMap;\n\t\t\tif (ParamsUtils::TryGetParam(pMap, EffectSettings, \"Effects\"))\n\t\t\t{\n\t\t\t\tfor (const auto& Pair : *pMap)\n\t\t\t\t\t_EffectsByType.emplace(Pair.first.ToString(), Pair.second.GetValue<std::string>());\n\t\t\t}\n\t\t\tif (ParamsUtils::TryGetParam(pMap, EffectSettings, \"Params\"))\n\t\t\t{\n\t\t\t\tfor (const auto& Pair : *pMap)\n\t\t\t\t\t_EffectParamAliases.emplace(Pair.first.ToString(), Pair.second.GetValue<std::string>());\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\tvirtual void ProcessCommandLine(CLI::App& CLIApp) override\n\t{\n\t\t\/\/???use --project-file instead of --res-root + --settings?\n\t\tCContentForgeTool::ProcessCommandLine(CLIApp);\n\t\tCLIApp.add_option(\"--res-root\", _ResourceRoot, \"Resource root prefix for referencing external subresources by path\");\n\t\tCLIApp.add_option(\"--scheme,--schema\", _SchemeFile, \"Scene binary serialization scheme file path\");\n\t\tCLIApp.add_option(\"--settings\", _SettingsFile, \"Settings file path\");\n\t\tCLIApp.add_flag(\"-t,--txt\", _OutputHRD, \"Output scenes in a human-readable format, suitable for debugging only\");\n\t\tCLIApp.add_flag(\"-b,--bin\", _OutputBin, \"Output scenes in a binary format, suitable for loading into the engine\");\n\t\tCLIApp.add_flag(\"--ibl\", _IBL, \"Add image-based lighting resources (IEM, PMREM) to the asset\");\n\t\tCLIApp.add_flag(\"-r\", _RecalcIBL, \"Recalculate image-based lighting resources (IEM, PMREM) even if they exist\");\n\t}\n\n\tfs::path GetPath(const Data::CParams& TaskParams, const char* pPathID)\n\t{\n\t\tfs::path Result;\n\n\t\tstd::string PathValue;\n\t\tif (ParamsUtils::TryGetParam(PathValue, TaskParams, pPathID))\n\t\t\tResult = PathValue;\n\t\telse if (ParamsUtils::TryGetParam(PathValue, TaskParams, \"Output\"))\n\t\t\tResult = PathValue;\n\t\telse return Result;\n\n\t\tif (!_RootDir.empty() && Result.is_relative())\n\t\t\tResult = fs::path(_RootDir) \/ Result;\n\n\t\treturn Result;\n\t}\n\n\tconst std::string& GetEffectParamID(const std::string& Alias)\n\t{\n\t\tauto It = _EffectParamAliases.find(Alias);\n\t\treturn (It == _EffectParamAliases.cend()) ? Alias : It->second;\n\t}\n\n\tvirtual bool ProcessTask(CContentForgeTask& Task) override\n\t{\n\t\t\/\/ TODO: check whether the metafile can be processed by this tool\n\n\t\tconst std::string TaskName = Task.TaskID.ToString();\n\n\t\tstd::string SkyboxFileName = Task.SrcFilePath.filename().generic_string();\n\t\tToLower(SkyboxFileName);\n\n\t\t\/\/ Generate material\n\n\t\tstd::string MaterialID;\n\n\t\tconst auto TexturePath = GetPath(Task.Params, \"TextureOutput\");\n\n\t\tauto EffectIt = _EffectsByType.find(\"MetallicRoughnessSkybox\");\n\t\tif (EffectIt == _EffectsByType.cend() || EffectIt->second.empty())\n\t\t{\n\t\t\tTask.Log.LogError(\"Material type MetallicRoughnessTerrain has no mapped DEM effect file in effect settings\");\n\t\t\treturn false;\n\t\t}\n\n\t\tCMaterialParams MtlParamTable;\n\t\tauto Path = ResolvePathAliases(EffectIt->second).generic_string();\n\t\tTask.Log.LogDebug(\"Opening effect \" + Path);\n\t\tif (!GetEffectMaterialParams(MtlParamTable, Path, Task.Log))\n\t\t{\n\t\t\tTask.Log.LogError(\"Error reading material param table for effect \" + Path);\n\t\t\treturn false;\n\t\t}\n\n\t\tData::CParams MtlParams;\n\n\t\tconst auto& SkyboxTextureID = GetEffectParamID(\"SkyboxTexture\");\n\t\tif (MtlParamTable.HasResource(SkyboxTextureID))\n\t\t{\n\t\t\tauto DestPath = TexturePath \/ SkyboxFileName;\n\t\t\tfs::create_directories(DestPath.parent_path());\n\t\t\tstd::error_code ec;\n\t\t\tif (!fs::copy_file(Task.SrcFilePath, DestPath, fs::copy_options::overwrite_existing, ec))\n\t\t\t{\n\t\t\t\tTask.Log.LogError(\"Error copying texture from \" + Task.SrcFilePath.generic_string() + \" to \" + DestPath.generic_string() + \": \" + ec.message());\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tMtlParams.emplace_back(CStrID(SkyboxTextureID), _ResourceRoot + fs::relative(DestPath, _RootDir).generic_string());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tTask.Log.LogError(\"No SkyboxTexture (\" + SkyboxTextureID + \") parameter found in a material\");\n\t\t\treturn false;\n\t\t}\n\n\t\t{\n\t\t\tauto DestPath = GetPath(Task.Params, \"MaterialOutput\") \/ (TaskName + \".mtl\");\n\n\t\t\tfs::create_directories(DestPath.parent_path());\n\n\t\t\tstd::ofstream File(DestPath, std::ios_base::binary | std::ios_base::trunc);\n\n\t\t\tif (!SaveMaterial(File, EffectIt->second, MtlParamTable, MtlParams, Task.Log)) return false;\n\n\t\t\tMaterialID = _ResourceRoot + fs::relative(DestPath, _RootDir).generic_string();\n\t\t}\n\n\t\t\/\/ Calculate IBL resources\n\n\t\tstd::string IEMID, PMREMID;\n\n\t\tif (_IBL)\n\t\t{\n\t\t\t\/\/ See https:\/\/seblagarde.wordpress.com\/2012\/06\/10\/amd-cubemapgen-for-physically-based-rendering\/\n\n\t\t\t\/\/ Calculate IEM\n\n\t\t\tauto IEMPath = TexturePath \/ (fs::path(SkyboxFileName).filename().replace_extension().string() + \"_iem.dds\");\n\t\t\tIEMID = _ResourceRoot + fs::relative(IEMPath, _RootDir).generic_string();\n\t\t\tif (_RecalcIBL || !fs::exists(IEMPath))\n\t\t\t{\n\t\t\t\tconst int IEMDimensionSize = ParamsUtils::GetParam(Task.Params, \"IEMDimensionSize\", 128);\n\t\t\t\tconst std::string IEMFormat = ParamsUtils::GetParam(Task.Params, \"IEMFormat\", std::string(\"A8R8G8B8\"));\n\n\t\t\t\tconst std::string IEMCmdLine = \"cubemapgen\/mcmg.exe -IrradianceCubemap -importCubeDDS:\\\"\" + Task.SrcFilePath.string() +\n\t\t\t\t\t\"\\\" -exportCubeDDS -exportFilename:\\\"\" + IEMPath.string() + \"\\\" -exportSize:\" + std::to_string(IEMDimensionSize) +\n\t\t\t\t\t\" -exportPixelFormat:\" + IEMFormat + \" -consoleErrorOutput -exit\";\n\t\t\t\tif (RunSubprocess(IEMCmdLine, &Task.Log) != 0)\n\t\t\t\t{\n\t\t\t\t\tTask.Log.LogError(\"Error generating irradiance environment map (IEM)\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Calculate PMREM (Mipmap mode)\n\n\t\t\tauto PMREMPath = TexturePath \/ (fs::path(SkyboxFileName).filename().replace_extension().string() + \"_pmrem.dds\");\n\t\t\tPMREMID = _ResourceRoot + fs::relative(PMREMPath, _RootDir).generic_string();\n\t\t\tif (_RecalcIBL || !fs::exists(PMREMPath))\n\t\t\t{\n\t\t\t\tconst int PMREMDimensionSize = ParamsUtils::GetParam(Task.Params, \"PMREMDimensionSize\", 256);\n\t\t\t\tconst std::string PMREMFormat = ParamsUtils::GetParam(Task.Params, \"PMREMFormat\", std::string(\"A8R8G8B8\"));\n\t\t\t\tconst int PMREMMipCount = ParamsUtils::GetParam(Task.Params, \"PMREMMipCount\", 7);\n\t\t\t\tconst float PMREMGlossScale = ParamsUtils::GetParam(Task.Params, \"PMREMGlossScale\", 10.f);\n\t\t\t\tconst float PMREMGlossBias = ParamsUtils::GetParam(Task.Params, \"PMREMGlossBias\", 1.f);\n\n\t\t\t\tconst std::string PMREMCmdLine = \"cubemapgen\/mcmg.exe -filterTech:CosinePower -CosinePowerMipmapChainMode:Mipmap\"\n\t\t\t\t\t\" -NumMipmap:\" + std::to_string(PMREMMipCount) +\n\t\t\t\t\t\" -GlossScale:\" + std::to_string(PMREMGlossScale) +\n\t\t\t\t\t\" -GlossBias:\" + std::to_string(PMREMGlossBias) +\n\t\t\t\t\t\" -importCubeDDS:\\\"\" + Task.SrcFilePath.string() + \"\\\"\"\n\t\t\t\t\t\" -LightingModel:PhongBRDF -ExcludeBase -solidAngleWeighting -edgeFixupTech:Warp -importDegamma:1.0 -exportGamma:1.0 \"\n\t\t\t\t\t\" -exportCubeDDS -exportFilename:\\\"\" + PMREMPath.string() + \"\\\" -exportSize:\" + std::to_string(PMREMDimensionSize) +\n\t\t\t\t\t\" -exportPixelFormat:A8R8G8B8 -exportMipChain -consoleErrorOutput -exit\";\n\t\t\t\tif (RunSubprocess(PMREMCmdLine, &Task.Log) != 0)\n\t\t\t\t{\n\t\t\t\t\tTask.Log.LogError(\"Error generating prefiltered mipmaped radiance environment map (PMREM)\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Write scene file\n\n\t\tData::CParams Result;\n\n\t\tData::CDataArray Attributes;\n\n\t\t{\n\t\t\tData::CParams Attribute;\n\t\t\tAttribute.emplace_back(CStrID(\"Class\"), 'SKBA'); \/\/ Frame::CSkyboxAttribute\n\t\t\tAttribute.emplace_back(CStrID(\"Material\"), MaterialID);\n\t\t\tAttributes.push_back(std::move(Attribute));\n\t\t}\n\n\t\tif (_IBL)\n\t\t{\n\t\t\tData::CParams Attribute;\n\t\t\tAttribute.emplace_back(CStrID(\"Class\"), 'NAAL'); \/\/ Frame::CAmbientLightAttribute\n\t\t\tAttribute.emplace_back(CStrID(\"IrradianceMap\"), IEMID);\n\t\t\tAttribute.emplace_back(CStrID(\"RadianceEnvMap\"), PMREMID);\n\t\t\tAttributes.push_back(std::move(Attribute));\n\t\t}\n\n\t\tResult.emplace_back(CStrID(\"Attrs\"), std::move(Attributes));\n\n\t\tconst fs::path OutPath = GetPath(Task.Params, \"Output\");\n\n\t\tif (_OutputHRD)\n\t\t{\n\t\t\tconst auto DestPath = OutPath \/ (TaskName + \".hrd\");\n\t\t\tif (!ParamsUtils::SaveParamsToHRD(DestPath.string().c_str(), Result))\n\t\t\t{\n\t\t\t\tTask.Log.LogError(\"Error serializing \" + TaskName + \" to text\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tif (_OutputBin)\n\t\t{\n\t\t\tconst auto DestPath = OutPath \/ (Task.TaskID.ToString() + \".scn\");\n\t\t\tif (!ParamsUtils::SaveParamsByScheme(DestPath.string().c_str(), Result, CStrID(\"SceneNode\"), _SceneSchemes))\n\t\t\t{\n\t\t\t\tTask.Log.LogError(\"Error serializing \" + TaskName + \" to binary\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n};\n\nint main(int argc, const char** argv)\n{\n\tCSkyboxTool Tool(\"cf-skybox\", \"Cubemap to DeusExMachina skybox asset converter\", { 1, 0, 0 });\n\treturn Tool.Execute(argc, argv);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************************************************\n* Copyright (C) *   2017, peterwinzell\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 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 <QThread>\n#include <QJsonDocument>\n#include <QJsonObject>\n#include <QJsonArray>\n#include <QDateTime>\n#include \"subscribehandler.h\"\n#include \"subscriptions.h\"\n\nconst int SubscribeHandler::m_defaultIntervalMs = 1000;\n\nSubscribeHandler::SubscribeHandler(QObject* parent,VISSRequest* vissrequest,QWebSocket *client):\n    RequestHandler(parent,vissrequest,client),m_dosubscription(true)\n{\n}\n\nvoid SubscribeHandler::processRequest()\n{\n    connect(p_client, &QWebSocket::disconnected, this, &SubscribeHandler::socketDisconnected);\n\n    \/\/Add to subscriptions and store subscriptions ID\n    Subscriptions* subscriptions = Subscriptions::getInstance();\n    m_subId = subscriptions -> addSubcription(this);\n\n    qDebug() << \" processing get handler requests\";\n\n    \/\/Setup filter params\n    initializeFilter();\n\n    \/\/Send subscription response\n    \/\/Format response on JSON format\n    QString successMessage = getSubscriptionSuccessJson();\n\n    \/\/Send message to client\n    p_client->sendTextMessage(successMessage);\n\n    while (m_dosubscription)\n    {\n        \/\/Get latest value of subscribed signal\n        QString value = getSignalValue(p_vissrequest->getSignalPath());\n\n\/\/        qDebug() << \"Unfiltered value: \" << value;\n\n        if (isFilterPass(value))\n        {\n            \/\/Format response on JSON format\n            QString message = getSubscriptionNotificationJson(value);\n\n            qDebug() << \"Sending message:\" << message;\n\n            \/\/Send message to client\n            p_client->sendTextMessage(message);\n        }\n\n        \/\/Sleep for the period defined by filter\n        QThread::currentThread()->msleep(m_filter.intervalMs);\n    }\n\n    qDebug() << \" subscription cancelled \";\n}\n\nvoid SubscribeHandler::socketDisconnected()\n{\n    m_dosubscription = false;\n}\n\nvoid SubscribeHandler::unsubscribe()\n{\n    m_dosubscription = false;\n}\n\nQWebSocket* SubscribeHandler::getSocketClient()\n{\n    return p_client;\n}\n\nQString SubscribeHandler::getSubscriptionNotificationJson(QString signalValue)\n{\n    QJsonObject jsonObject;\n    jsonObject.insert(\"action\", \"subscribing\");\n    jsonObject.insert(\"subscriptionId\", m_subId);\n    jsonObject.insert(\"value\", signalValue);\n    jsonObject.insert(\"timestamp\", QString::number(QDateTime::currentDateTime().toTime_t() ));\n\n    QJsonDocument jsonDoc(jsonObject);\n    return jsonDoc.toJson();\n}\n\nQString SubscribeHandler::getSubscriptionSuccessJson()\n{\n    QJsonObject jsonObject;\n    jsonObject.insert(\"action\", \"subscribe\");\n    jsonObject.insert(\"requestId\", p_vissrequest->getRequestId());\n    jsonObject.insert(\"subscriptionId\", m_subId);\n    jsonObject.insert(\"timestamp\", QString::number(QDateTime::currentDateTime().toTime_t() ));\n\n    QJsonDocument jsonDoc(jsonObject);\n    return jsonDoc.toJson();\n}\n\nbool SubscribeHandler::isFilterPass(QString valueString)\n{\n    int value = valueString.toInt();\n    int diff = abs(value - m_lastValue);\n    m_lastValue = value;\n\/*\n    qDebug() << \" isFilterPass(): value = \" << value << \" isFilterPass(): diff = \" << diff;;\n\n    qDebug() << \" isFilterPass(): m_filter.rangeMin = \" << m_filter.rangeMin\n             << \" isFilterPass(): m_filter.rangeMax = \" << m_filter.rangeMax\n             << \" isFilterPass(): m_filter.minChange = \" << m_filter.minChange;\n*\/\n    \/\/Check whether value is within range and from last value is big enough\n    return ((value >= m_filter.rangeMin) &&\n            (value <= m_filter.rangeMax) &&\n            (diff >= m_filter.minChange));\n}\n\nvoid SubscribeHandler::initializeFilter()\n{\n    qDebug() << \"initializeFilter(): Enter\";\n    qDebug() << \"std::numeric_limits<int>::max() = \" << std::numeric_limits<int>::max();\n    qDebug() << \"m_defaultIntervalMs = \" << m_defaultIntervalMs;\n\n    m_filter.intervalMs = m_defaultIntervalMs;\n\n    qDebug() << \"m_filter.intervalMs = \" << m_filter.intervalMs;\n\n    m_filter.rangeMin = 0;\n    m_filter.rangeMax = std::numeric_limits<int>::max();\n    m_filter.minChange = 0;\n\n    \/\/Parse filter from request\n    QJsonObject jsonObject = p_vissrequest->getJsonObject();\n\n\n    qDebug() << \"jsonObject = \" << jsonObject;\n    qDebug() << \"jsonObject[filters] = \" << jsonObject[\"filters\"];\n    qDebug() << \"jsonObject[filters].isUndefined() = \" << jsonObject[\"filters\"].isUndefined();\n\n\n    \/\/First, check that filter is included in the request\n    if(!jsonObject[\"filters\"].isUndefined())\n    {\n        qDebug() << \"initializeFilter(): filters found\";\n\n        \/\/Filter can be one or more tags, where supported tags are:\n        \/\/\n        \/\/ \"interval\" , for example:\n        \/\/          \"filters\": { \"interval\": 100 }\n        \/\/\n        \/\/ \"range\" , for example:\n        \/\/          \"filters\": { \"range\": { \"above\": 100, \"below\": 200 } }\n        \/\/          \"filters\": { \"range\": { \"below\": 100 } }\n        \/\/\n        \/\/ \"minChange\" , for example:\n        \/\/          \"filters\": { \"minChange\": 100 }\n        \/\/          \"filters\": { \"range\": { \"below\": 200 }, \"minChange\": 20}\n\n        QJsonObject filterList = jsonObject[\"filters\"].toObject();\n\n        \/\/ Handle interval\n        if(!filterList[\"interval\"].isUndefined())\n        {\n            m_filter.intervalMs = filterList[\"interval\"].toInt();\n\n            qDebug() << \"initializeFilter(): interval = \" << m_filter.intervalMs;\n        }\n\n        \/\/ Handle range\n        if(!filterList[\"range\"].isUndefined())\n        {\n            qDebug() << \"initializeFilter(): range found\";\n\n            \/\/ Range can consist of \"above\", \"below\" or both\n            QJsonObject range = filterList[\"range\"].toObject();\n\n            if(!range[\"above\"].isUndefined())\n            {\n                m_filter.rangeMin = range[\"above\"].toInt();\n\n                qDebug() << \"initializeFilter(): above = \" << m_filter.rangeMin;\n            }\n            if(!range[\"below\"].isUndefined())\n            {\n                m_filter.rangeMax = range[\"below\"].toInt();\n\n                qDebug() << \"initializeFilter(): below = \" << m_filter.rangeMax;\n            }\n        }\n\n        \/\/ Handle minchange\n        if(!filterList[\"minChange\"].isUndefined())\n        {\n            m_filter.minChange = filterList[\"minChange\"].toInt();\n\n            qDebug() << \"initializeFilter(): minChange = \" << m_filter.minChange;\n        }\n\n        \/*\n        QJsonObject::const_iterator it;\n        for (it = filterList.constBegin(); it != filterList.constEnd(); it++)\n        {\n          QString filter = it;\n        }\n         *\/\n\n    }\n}\n\nQString SubscribeHandler::getSignalValue(QString path)\n{\n    \/\/Dummy function, just return a random number 0 - 320\n    (void)path;\n    return QString::number(qrand() % 320);\n}\n\n\n\n<commit_msg>Filter implemented.<commit_after>\/**************************************************************************************************************\n* Copyright (C) *   2017, peterwinzell\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 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 <QThread>\n#include <QJsonDocument>\n#include <QJsonObject>\n#include <QJsonArray>\n#include <QDateTime>\n#include \"subscribehandler.h\"\n#include \"subscriptions.h\"\n\nconst int SubscribeHandler::m_defaultIntervalMs = 1000;\n\nSubscribeHandler::SubscribeHandler(QObject* parent,VISSRequest* vissrequest,QWebSocket *client):\n    RequestHandler(parent,vissrequest,client),m_dosubscription(true)\n{\n}\n\nvoid SubscribeHandler::processRequest()\n{\n    connect(p_client, &QWebSocket::disconnected, this, &SubscribeHandler::socketDisconnected);\n\n    \/\/Add to subscriptions and store subscriptions ID\n    Subscriptions* subscriptions = Subscriptions::getInstance();\n    m_subId = subscriptions -> addSubcription(this);\n\n    qDebug() << \" processing get handler requests\";\n\n    \/\/Setup filter params\n    initializeFilter();\n\n    \/\/Send subscription response\n    \/\/Format response on JSON format\n    QString successMessage = getSubscriptionSuccessJson();\n\n    \/\/Send message to client\n    p_client->sendTextMessage(successMessage);\n\n    while (m_dosubscription)\n    {\n        \/\/Get latest value of subscribed signal\n        QString value = getSignalValue(p_vissrequest->getSignalPath());\n\n        if (isFilterPass(value))\n        {\n            m_lastValue = value.toInt();\n\n            \/\/Format response on JSON format\n            QString message = getSubscriptionNotificationJson(value);\n\n            qDebug() << \"Sending message:\" << message;\n\n            \/\/Send message to client\n            p_client->sendTextMessage(message);\n        }\n\n        \/\/Sleep for the period defined by filter\n        QThread::currentThread()->msleep(m_filter.intervalMs);\n    }\n\n    qDebug() << \" subscription cancelled \";\n}\n\nvoid SubscribeHandler::socketDisconnected()\n{\n    m_dosubscription = false;\n}\n\nvoid SubscribeHandler::unsubscribe()\n{\n    m_dosubscription = false;\n}\n\nQWebSocket* SubscribeHandler::getSocketClient()\n{\n    return p_client;\n}\n\nQString SubscribeHandler::getSubscriptionNotificationJson(QString signalValue)\n{\n    QJsonObject jsonObject;\n    jsonObject.insert(\"action\", \"subscribing\");\n    jsonObject.insert(\"subscriptionId\", m_subId);\n    jsonObject.insert(\"value\", signalValue);\n    jsonObject.insert(\"timestamp\", QString::number(QDateTime::currentDateTime().toTime_t() ));\n\n    QJsonDocument jsonDoc(jsonObject);\n    return jsonDoc.toJson();\n}\n\nQString SubscribeHandler::getSubscriptionSuccessJson()\n{\n    QJsonObject jsonObject;\n    jsonObject.insert(\"action\", \"subscribe\");\n    jsonObject.insert(\"requestId\", p_vissrequest->getRequestId());\n    jsonObject.insert(\"subscriptionId\", m_subId);\n    jsonObject.insert(\"timestamp\", QString::number(QDateTime::currentDateTime().toTime_t() ));\n\n    QJsonDocument jsonDoc(jsonObject);\n    return jsonDoc.toJson();\n}\n\nbool SubscribeHandler::isFilterPass(QString valueString)\n{\n    int value = valueString.toInt();\n    int diff = abs(value - m_lastValue);\n\n    \/\/Check whether value is within range and from last value is big enough\n    return ((value >= m_filter.rangeMin) &&\n            (value <= m_filter.rangeMax) &&\n            (diff >= m_filter.minChange));\n}\n\nvoid SubscribeHandler::initializeFilter()\n{\n    qDebug() << \"initializeFilter(): Enter\";\n\n    m_filter.intervalMs = m_defaultIntervalMs;\n    m_filter.rangeMin = 0;\n    m_filter.rangeMax = std::numeric_limits<int>::max();\n    m_filter.minChange = 0;\n    m_lastValue = 0;\n\n    \/\/Parse filter from request\n    QJsonObject jsonObject = p_vissrequest->getJsonObject();\n\n    \/\/First, check that filter is included in the request\n    if(!jsonObject[\"filters\"].isNull())\n    {\n        qDebug() << \"initializeFilter(): filters found\";\n\n        \/\/Filter can be one or more tags, where supported tags are:\n        \/\/\n        \/\/ \"interval\" , for example:\n        \/\/          \"filters\": { \"interval\": 100 }\n        \/\/\n        \/\/ \"range\" , for example:\n        \/\/          \"filters\": { \"range\": { \"above\": 100, \"below\": 200 } }\n        \/\/          \"filters\": { \"range\": { \"below\": 100 } }\n        \/\/\n        \/\/ \"minChange\" , for example:\n        \/\/          \"filters\": { \"minChange\": 100 }\n        \/\/          \"filters\": { \"range\": { \"below\": 200 }, \"minChange\": 20}\n\n        QJsonObject filterList = jsonObject[\"filters\"].toObject();\n\n        \/\/ Handle interval\n        if(!filterList[\"interval\"].isNull())\n        {\n            m_filter.intervalMs = filterList[\"interval\"].toString().toInt();\n\n            qDebug() << \"initializeFilter(): interval = \" << m_filter.intervalMs;\n        }\n\n        \/\/ Handle range\n        if(!filterList[\"range\"].isNull())\n        {\n            qDebug() << \"initializeFilter(): range found\";\n\n            \/\/ Range can consist of \"above\", \"below\" or both\n            QJsonObject range = filterList[\"range\"].toObject();\n\n            if(!range[\"above\"].isNull())\n            {\n                m_filter.rangeMin = range[\"above\"].toString().toInt();\n\n                qDebug() << \"initializeFilter(): above = \" << m_filter.rangeMin;\n            }\n            if(!range[\"below\"].isNull())\n            {\n                m_filter.rangeMax = range[\"below\"].toString().toInt();\n\n                qDebug() << \"initializeFilter(): below = \" << m_filter.rangeMax;\n            }\n        }\n\n        \/\/ Handle minchange\n        if(!filterList[\"minChange\"].isNull())\n        {\n            m_filter.minChange = filterList[\"minChange\"].toString().toInt();\n\n            qDebug() << \"initializeFilter(): minChange = \" << m_filter.minChange;\n        }\n    }\n}\n\nQString SubscribeHandler::getSignalValue(QString path)\n{\n    \/\/Dummy function, just return a random number 0 - 320\n    (void)path;\n    return QString::number(qrand() % 320);\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/* +---------------------------------------------------------------------------+\n   |                     Mobile Robot Programming Toolkit (MRPT)               |\n   |                          http:\/\/www.mrpt.org\/                             |\n   |                                                                           |\n   | Copyright (c) 2005-2017, 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\n#include <mrpt\/utils\/CObject.h>\n\n#include <map>\n#include <cstdarg>\n#include <mutex>\n#include <atomic>\n\n#include \"internal_class_registry.h\"\n\nusing namespace mrpt;\nusing namespace mrpt::utils;\nusing namespace mrpt::synch;\nusing namespace mrpt::system;\nusing namespace std;\n\n\n\/*---------------------------------------------------------------\n\t\t\t\t\tSTATIC GLOBAL VARIABLES\n ---------------------------------------------------------------*\/\nvolatile bool mrpt::utils::pending_class_registers_modified = false;\n\n\/\/ Creation on first call pattern:\nCAtomicCounter\t& mrpt::utils::pending_class_registers_count()\n{\n\tstatic CAtomicCounter cnt(0);\n\treturn cnt;\n}\n\n\/\/ Creation on first call pattern:\nCThreadSafeQueue<TRegisterFunction>\t &mrpt::utils::pending_class_registers()\n{\n\tpending_class_registers_modified = true;\n\tstatic CThreadSafeQueue<TRegisterFunction> lst;\n\treturn lst;\n}\n\n\nnamespace mrpt\n{\n\tnamespace utils\n\t{\n\t\ttypedef std::map<std::string,const TRuntimeClassId*> TClassnameToRuntimeId;\n\n\t\t\/** A singleton with the central registry for CSerializable run-time classes: users do not use this class in any direct way.\n\t      * \\note Class is thread-safe.\n\t\t  *\/\n\t\tclass BASE_IMPEXP CClassRegistry\n\t\t{\n\t\tpublic:\n\t\t\t\/**  The unique access point point to the singleton instance.\n\t\t\t  *\/\n\t\t\tstatic CClassRegistry& Instance()\n\t\t\t{\n\t\t\t\tstatic CClassRegistry obj;\n\t\t\t\treturn obj;\n\t\t\t}\n\n\t\t\tvoid Add( const std::string &className, const TRuntimeClassId &id )\n\t\t\t{\n\t\t\t\tm_being_modified=true;\n\t\t\t\t{\n\t\t\t\t\tstd::unique_lock<std::mutex> lk(m_cs);\n\n\t\t\t\t\t\/\/ Sanity check: don't allow registering twice the same class name!\n\t\t\t\t\tconst auto it = registeredClasses.find(className);\n\t\t\t\t\tif (it != registeredClasses.cend()) {\n\t\t\t\t\t\tif (it->second != &id) {\n\t\t\t\t\t\t\tTHROW_EXCEPTION_FMT(\"[MRPT class registry] Error: trying to register twice className=`%s` with different `TRuntimeClassId`!\", className.c_str());\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tregisteredClasses[className] = &id;\n\t\t\t\t}\n\t\t\t\tm_being_modified=false;\n\t\t\t}\n\n\t\t\tconst TRuntimeClassId *Get(const std::string &className)\n\t\t\t{\n\t\t\t\t\/\/ Optimization to avoid the costly lock() in virtually all situations:\n\t\t\t\tbool has_to_unlock = false;\n\t\t\t\tif (m_being_modified)\n\t\t\t\t{\n\t\t\t\t\tm_cs.lock();\n\t\t\t\t\thas_to_unlock = true;\n\t\t\t\t}\n\t\t\t\tconst TRuntimeClassId *ret = registeredClasses[className];\n\t\t\t\tif (has_to_unlock) m_cs.unlock();\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\tstd::vector<const TRuntimeClassId*> getListOfAllRegisteredClasses()\n\t\t\t{\n\t\t\t\tstd::unique_lock<std::mutex> lk(m_cs);\n\n\t\t\t\tstd::vector<const TRuntimeClassId*> ret;\n\t\t\t\tfor (TClassnameToRuntimeId::iterator it=registeredClasses.begin();it!=registeredClasses.end();++it)\n\t\t\t\t\tret.push_back( it->second );\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\tprivate:\n\t\t\t\/\/ PRIVATE constructor\n\t\t\tCClassRegistry() : m_being_modified(false)\n\t\t\t{\n\t\t\t}\n\t\t\t\/\/ PRIVATE destructor\n\t\t\t~CClassRegistry() { }\n\n\t\t\t\/\/ This must be static since we can be called from C startup\n\t\t\t\/\/ functions and it cannot be assured that classesKeeper will be\n\t\t\t\/\/ initialized before other classes that call it...\n\t\t\tTClassnameToRuntimeId\t\t\tregisteredClasses;\n\t\t\tstd::mutex        m_cs;\n\t\t\tstd::atomic<bool> m_being_modified;\n\n\t\t};\n\n\t}\t\/\/ End of namespace\n}\t\/\/ End of namespace\n\n\n\/** Register all pending classes - to be called just before de-serializing an object, for example.\n*\/\nvoid mrpt::utils::registerAllPendingClasses()\n{\n\tif (!pending_class_registers_modified) return; \/\/ Quick return\n\n\twhile( pending_class_registers_count()!=0 )\n\t{\n\t\tTRegisterFunction *ptrToPtr = pending_class_registers().get();\n\t\t--pending_class_registers_count();\n\n\t\t\/\/ Call it:\n\t\tif((*ptrToPtr)!=NULL)\n\t\t{\n\t\t\t(*(*ptrToPtr)) ();\n\t\t\tdelete ptrToPtr;\n\t\t}\n\t}\n\tpending_class_registers_modified = false;\n}\n\n\n\n\/*---------------------------------------------------------------\n\t\t\t\t\tRegisterClass\n ---------------------------------------------------------------*\/\nvoid utils::registerClass(const TRuntimeClassId* pNewClass)\n{\n\t\/\/ Register it:\n\tCClassRegistry::Instance().Add( std::string( pNewClass->className ), *pNewClass);\n\n\t\/\/ Automatically register all classes when the first one is registered.\n\tregisterAllPendingClasses();\n}\n\n\/** For internal use within mrpt sources, and only in exceptional cases (CMultiMetricMaps, CImage,...)\n  *\/\nvoid utils::registerClassCustomName(const char*customName, const TRuntimeClassId* pNewClass)\n{\n\t\/\/ Register it:\n\tCClassRegistry::Instance().Add( customName, *pNewClass);\n\n\t\/\/ Automatically register all classes when the first one is registered.\n\tregisterAllPendingClasses();\n}\n\n\/*---------------------------------------------------------------\n\t\t\t\t\tgetAllRegisteredClasses\n ---------------------------------------------------------------*\/\nstd::vector<const TRuntimeClassId*> utils::getAllRegisteredClasses()\n{\n\treturn CClassRegistry::Instance().getListOfAllRegisteredClasses();\n}\n\nstd::vector<const TRuntimeClassId*> utils::getAllRegisteredClassesChildrenOf(const TRuntimeClassId* parent_id)\n{\n\tstd::vector<const TRuntimeClassId*> res;\n\tconst auto lst = mrpt::utils::getAllRegisteredClasses();\n\tfor (const auto &c : lst) {\n\t\tif (c->derivedFrom(parent_id) && c!=parent_id) {\n\t\t\tres.push_back(c);\n\t\t}\n\t}\n\treturn res;\n}\n\n\/*---------------------------------------------------------------\n\t\t\t\t\tfindRegisteredClass\n ---------------------------------------------------------------*\/\nconst TRuntimeClassId *mrpt::utils::findRegisteredClass(const std::string &className)\n{\n\treturn CClassRegistry::Instance().Get( className );\n}\n\n<commit_msg>error to warning<commit_after>\/* +---------------------------------------------------------------------------+\n   |                     Mobile Robot Programming Toolkit (MRPT)               |\n   |                          http:\/\/www.mrpt.org\/                             |\n   |                                                                           |\n   | Copyright (c) 2005-2017, 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\n#include <mrpt\/utils\/CObject.h>\n\n#include <map>\n#include <cstdarg>\n#include <mutex>\n#include <atomic>\n#include <iostream>\n\n#include \"internal_class_registry.h\"\n\nusing namespace mrpt;\nusing namespace mrpt::utils;\nusing namespace mrpt::synch;\nusing namespace mrpt::system;\nusing namespace std;\n\n\n\/*---------------------------------------------------------------\n\t\t\t\t\tSTATIC GLOBAL VARIABLES\n ---------------------------------------------------------------*\/\nvolatile bool mrpt::utils::pending_class_registers_modified = false;\n\n\/\/ Creation on first call pattern:\nCAtomicCounter\t& mrpt::utils::pending_class_registers_count()\n{\n\tstatic CAtomicCounter cnt(0);\n\treturn cnt;\n}\n\n\/\/ Creation on first call pattern:\nCThreadSafeQueue<TRegisterFunction>\t &mrpt::utils::pending_class_registers()\n{\n\tpending_class_registers_modified = true;\n\tstatic CThreadSafeQueue<TRegisterFunction> lst;\n\treturn lst;\n}\n\n\nnamespace mrpt\n{\n\tnamespace utils\n\t{\n\t\ttypedef std::map<std::string,const TRuntimeClassId*> TClassnameToRuntimeId;\n\n\t\t\/** A singleton with the central registry for CSerializable run-time classes: users do not use this class in any direct way.\n\t      * \\note Class is thread-safe.\n\t\t  *\/\n\t\tclass BASE_IMPEXP CClassRegistry\n\t\t{\n\t\tpublic:\n\t\t\t\/**  The unique access point point to the singleton instance.\n\t\t\t  *\/\n\t\t\tstatic CClassRegistry& Instance()\n\t\t\t{\n\t\t\t\tstatic CClassRegistry obj;\n\t\t\t\treturn obj;\n\t\t\t}\n\n\t\t\tvoid Add( const std::string &className, const TRuntimeClassId &id )\n\t\t\t{\n\t\t\t\tm_being_modified=true;\n\t\t\t\t{\n\t\t\t\t\tstd::unique_lock<std::mutex> lk(m_cs);\n\n\t\t\t\t\t\/\/ Sanity check: don't allow registering twice the same class name!\n\t\t\t\t\tconst auto it = registeredClasses.find(className);\n\t\t\t\t\tif (it != registeredClasses.cend()) {\n\t\t\t\t\t\tif (it->second != &id) {\n\t\t\t\t\t\t\tstd::cerr << mrpt::format(\"[MRPT class registry] Warning: overwriting already registered className=`%s` with different `TRuntimeClassId`!\\n\", className.c_str());\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tregisteredClasses[className] = &id;\n\t\t\t\t}\n\t\t\t\tm_being_modified=false;\n\t\t\t}\n\n\t\t\tconst TRuntimeClassId *Get(const std::string &className)\n\t\t\t{\n\t\t\t\t\/\/ Optimization to avoid the costly lock() in virtually all situations:\n\t\t\t\tbool has_to_unlock = false;\n\t\t\t\tif (m_being_modified)\n\t\t\t\t{\n\t\t\t\t\tm_cs.lock();\n\t\t\t\t\thas_to_unlock = true;\n\t\t\t\t}\n\t\t\t\tconst TRuntimeClassId *ret = registeredClasses[className];\n\t\t\t\tif (has_to_unlock) m_cs.unlock();\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\tstd::vector<const TRuntimeClassId*> getListOfAllRegisteredClasses()\n\t\t\t{\n\t\t\t\tstd::unique_lock<std::mutex> lk(m_cs);\n\n\t\t\t\tstd::vector<const TRuntimeClassId*> ret;\n\t\t\t\tfor (TClassnameToRuntimeId::iterator it=registeredClasses.begin();it!=registeredClasses.end();++it)\n\t\t\t\t\tret.push_back( it->second );\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\tprivate:\n\t\t\t\/\/ PRIVATE constructor\n\t\t\tCClassRegistry() : m_being_modified(false)\n\t\t\t{\n\t\t\t}\n\t\t\t\/\/ PRIVATE destructor\n\t\t\t~CClassRegistry() { }\n\n\t\t\t\/\/ This must be static since we can be called from C startup\n\t\t\t\/\/ functions and it cannot be assured that classesKeeper will be\n\t\t\t\/\/ initialized before other classes that call it...\n\t\t\tTClassnameToRuntimeId\t\t\tregisteredClasses;\n\t\t\tstd::mutex        m_cs;\n\t\t\tstd::atomic<bool> m_being_modified;\n\n\t\t};\n\n\t}\t\/\/ End of namespace\n}\t\/\/ End of namespace\n\n\n\/** Register all pending classes - to be called just before de-serializing an object, for example.\n*\/\nvoid mrpt::utils::registerAllPendingClasses()\n{\n\tif (!pending_class_registers_modified) return; \/\/ Quick return\n\n\twhile( pending_class_registers_count()!=0 )\n\t{\n\t\tTRegisterFunction *ptrToPtr = pending_class_registers().get();\n\t\t--pending_class_registers_count();\n\n\t\t\/\/ Call it:\n\t\tif((*ptrToPtr)!=NULL)\n\t\t{\n\t\t\t(*(*ptrToPtr)) ();\n\t\t\tdelete ptrToPtr;\n\t\t}\n\t}\n\tpending_class_registers_modified = false;\n}\n\n\n\n\/*---------------------------------------------------------------\n\t\t\t\t\tRegisterClass\n ---------------------------------------------------------------*\/\nvoid utils::registerClass(const TRuntimeClassId* pNewClass)\n{\n\t\/\/ Register it:\n\tCClassRegistry::Instance().Add( std::string( pNewClass->className ), *pNewClass);\n\n\t\/\/ Automatically register all classes when the first one is registered.\n\tregisterAllPendingClasses();\n}\n\n\/** For internal use within mrpt sources, and only in exceptional cases (CMultiMetricMaps, CImage,...)\n  *\/\nvoid utils::registerClassCustomName(const char*customName, const TRuntimeClassId* pNewClass)\n{\n\t\/\/ Register it:\n\tCClassRegistry::Instance().Add( customName, *pNewClass);\n\n\t\/\/ Automatically register all classes when the first one is registered.\n\tregisterAllPendingClasses();\n}\n\n\/*---------------------------------------------------------------\n\t\t\t\t\tgetAllRegisteredClasses\n ---------------------------------------------------------------*\/\nstd::vector<const TRuntimeClassId*> utils::getAllRegisteredClasses()\n{\n\treturn CClassRegistry::Instance().getListOfAllRegisteredClasses();\n}\n\nstd::vector<const TRuntimeClassId*> utils::getAllRegisteredClassesChildrenOf(const TRuntimeClassId* parent_id)\n{\n\tstd::vector<const TRuntimeClassId*> res;\n\tconst auto lst = mrpt::utils::getAllRegisteredClasses();\n\tfor (const auto &c : lst) {\n\t\tif (c->derivedFrom(parent_id) && c!=parent_id) {\n\t\t\tres.push_back(c);\n\t\t}\n\t}\n\treturn res;\n}\n\n\/*---------------------------------------------------------------\n\t\t\t\t\tfindRegisteredClass\n ---------------------------------------------------------------*\/\nconst TRuntimeClassId *mrpt::utils::findRegisteredClass(const std::string &className)\n{\n\treturn CClassRegistry::Instance().Get( className );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <stack>\n#include <string>\n#include <string.h>\n\nusing namespace std;\n\nbool IsOp(const char ch)\n{\n\treturn ch == '+' || ch == '-' || ch == '*' || ch == '\/';\n}\nbool IsOp(const string &str)\n{\n\treturn str == \"+\" || str == \"-\" || str == \"*\" || str == \"\/\";\n}\nbool IsEqualOrGreat(char ch1, char ch2)\n{\n\tif(ch1 == '+' || ch1 == '-')\n\t{\n\t\tif(ch2 == '+' || ch2 == '-')\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nvoid CalculatePrefix(stack<string> &prefix)\n{\n\tstack<int> cal;\n\twhile(prefix.empty() == false)\n\t{\n\t\tstring str = prefix.top();\n\t\tprefix.pop();\n\t\tif(IsOp(str) == false)\n\t\t{\n\t\t\tcal.push(atoi(str.data()));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint lhs = cal.top();\n\t\t\tcal.pop();\n\t\t\tint rhs = cal.top();\n\t\t\tcal.pop();\n\t\t\tswitch(*str.data())\n\t\t\t{\n\t\t\tcase '+':\n\t\t\t\tlhs += rhs;\n\t\t\t\tbreak;\n\t\t\tcase '-':\n\t\t\t\tlhs -= rhs;\n\t\t\t\tbreak;\n\t\t\tcase '*':\n\t\t\t\tlhs *= rhs;\n\t\t\t\tbreak;\n\t\t\tcase '\/':\n\t\t\t\tlhs \/= rhs;\n\t\t\t}\n\t\t\tcal.push(lhs);\n\t\t}\n\t}\n\tprintf(\"\\nResult is: %d\\n\", cal.top());\n}\nvoid InfixToPrefix(const char *infix)\n{\n\tstack<char> op;\n\tstack<string> prefix;\n\tint input_size = static_cast<int>(strlen(infix));\n\tfor(int index = input_size - 1; index >= 0; )\n\t{\n\t\tif(isdigit(infix[index]))\n\t\t{\n\t\t\tint begin_index = index - 1;\n\t\t\tfor(; begin_index >= 0 && isdigit(infix[begin_index]); --begin_index);\n\t\t\tif(begin_index < 0)\n\t\t\t{\n\t\t\t\tprefix.push(string(infix, index + 1));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if(begin_index == 0)\n\t\t\t{\n\t\t\t\tif(infix[0] != '-')\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(infix + 1, index));\n\t\t\t\t\tindex = 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(infix, index + 1));\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\tif(IsOp(infix[begin_index - 1]) && infix[begin_index] == '-')\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(infix + begin_index, index - begin_index + 1));\n\t\t\t\t\tindex = begin_index - 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(infix + begin_index + 1, index - begin_index));\n\t\t\t\t\tindex = begin_index;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if(IsOp(infix[index]))\n\t\t{\n\t\t\tif(op.empty() == true || op.top() == ')' || IsEqualOrGreat(infix[index], op.top()))\n\t\t\t{\n\t\t\t\top.push(infix[index]);\n\t\t\t\t--index;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprefix.push(string(&op.top(), 1));\n\t\t\t\top.pop();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(infix[index] == ')')\n\t\t\t{\n\t\t\t\top.push(infix[index]);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\twhile(op.top() != ')')\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(&op.top(), 1));\n\t\t\t\t\top.pop();\n\t\t\t\t}\n\t\t\t\top.pop();\n\t\t\t}\n\t\t\t--index;\n\t\t}\n\t}\n\twhile(op.empty() == false)\n\t{\n\t\tprefix.push(string(&op.top(), 1));\n\t\top.pop();\n\t}\n\tstack<string> temp;\n\tprintf(\"Prefix is: \");\n\twhile(prefix.empty() == false)\n\t{\n\t\ttemp.push(prefix.top());\n\t\tprintf(\"%s,\", prefix.top().data());\n\t\tprefix.pop();\n\t}\n\tCalculatePrefix(temp);\n}\n\nint main()\n{\n\tconst int kInputSize = 1024;\n\tchar infix[kInputSize];\n\twhile(scanf(\"%s\", infix) == 1)\n\t{\n\t\tInfixToPrefix(infix);\n\t}\n}\n\/*\n-23+((4+56)*78)+-5+6*-78+123\n**********************************\nPrefix is: +,+,+,+,-23,*,+,4,56,78,-5,*,6,-78,123,\nResult is: 4307\n*\/\n<commit_msg>feat: impl GetValueOfInfix<commit_after>#include <stack>\n#include <string>\n#include <string.h>\n\nusing namespace std;\n\nbool IsOp(const char ch)\n{\n\treturn ch == '+' || ch == '-' || ch == '*' || ch == '\/';\n}\nbool IsOp(const string &str)\n{\n\treturn str == \"+\" || str == \"-\" || str == \"*\" || str == \"\/\";\n}\nbool IsEqualOrGreat(char ch1, char ch2)\n{\n\tif(ch1 == '+' || ch1 == '-')\n\t{\n\t\tif(ch2 == '+' || ch2 == '-')\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\treturn true;\n}\nvoid CalculatePrefix(stack<string> &prefix)\n{\n\tstack<int> cal;\n\twhile(prefix.empty() == false)\n\t{\n\t\tstring str = prefix.top();\n\t\tprefix.pop();\n\t\tif(IsOp(str) == false)\n\t\t{\n\t\t\tcal.push(atoi(str.data()));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint lhs = cal.top();\n\t\t\tcal.pop();\n\t\t\tint rhs = cal.top();\n\t\t\tcal.pop();\n\t\t\tswitch(*str.data())\n\t\t\t{\n\t\t\tcase '+':\n\t\t\t\tlhs += rhs;\n\t\t\t\tbreak;\n\t\t\tcase '-':\n\t\t\t\tlhs -= rhs;\n\t\t\t\tbreak;\n\t\t\tcase '*':\n\t\t\t\tlhs *= rhs;\n\t\t\t\tbreak;\n\t\t\tcase '\/':\n\t\t\t\tlhs \/= rhs;\n\t\t\t}\n\t\t\tcal.push(lhs);\n\t\t}\n\t}\n\tprintf(\"\\nResult is: %d\\n\", cal.top());\n}\nvoid InfixToPrefix(const char *infix)\n{\n\tstack<char> op;\n\tstack<string> prefix;\n\tint input_size = static_cast<int>(strlen(infix));\n\tfor(int index = input_size - 1; index >= 0; )\n\t{\n\t\tif(isdigit(infix[index]))\n\t\t{\n\t\t\tint begin_index = index - 1;\n\t\t\tfor(; begin_index >= 0 && isdigit(infix[begin_index]); --begin_index);\n\t\t\tif(begin_index < 0)\n\t\t\t{\n\t\t\t\tprefix.push(string(infix, index + 1));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if(begin_index == 0)\n\t\t\t{\n\t\t\t\tif(infix[0] != '-')\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(infix + 1, index));\n\t\t\t\t\tindex = 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(infix, index + 1));\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\tif(IsOp(infix[begin_index - 1]) && infix[begin_index] == '-')\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(infix + begin_index, index - begin_index + 1));\n\t\t\t\t\tindex = begin_index - 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(infix + begin_index + 1, index - begin_index));\n\t\t\t\t\tindex = begin_index;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if(IsOp(infix[index]))\n\t\t{\n\t\t\tif(op.empty() == true || op.top() == ')' || IsEqualOrGreat(infix[index], op.top()))\n\t\t\t{\n\t\t\t\top.push(infix[index]);\n\t\t\t\t--index;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprefix.push(string(&op.top(), 1));\n\t\t\t\top.pop();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(infix[index] == ')')\n\t\t\t{\n\t\t\t\top.push(infix[index]);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\twhile(op.top() != ')')\n\t\t\t\t{\n\t\t\t\t\tprefix.push(string(&op.top(), 1));\n\t\t\t\t\top.pop();\n\t\t\t\t}\n\t\t\t\top.pop();\n\t\t\t}\n\t\t\t--index;\n\t\t}\n\t}\n\twhile(op.empty() == false)\n\t{\n\t\tprefix.push(string(&op.top(), 1));\n\t\top.pop();\n\t}\n\tstack<string> temp;\n\tprintf(\"Prefix is: \");\n\twhile(prefix.empty() == false)\n\t{\n\t\ttemp.push(prefix.top());\n\t\tprintf(\"%s,\", prefix.top().data());\n\t\tprefix.pop();\n\t}\n\tCalculatePrefix(temp);\n}\n\/*\n\nint main()\n{\n\tconst int kInputSize = 1024;\n\tchar infix[kInputSize];\n\twhile(scanf(\"%s\", infix) == 1)\n\t{\n\t\tInfixToPrefix(infix);\n\t}\n}\n(-23)+(4+56)*78+(-5)+6*(-78)+123#\n**********************************\nPrefix is: +,+,+,+,-23,*,+,4,56,78,-5,*,6,-78,123,\nResult is: 4307\n*\/\n\n\/*   数据结构分析与学习专栏\n*   Copyright (c) 2015, 山东大学 计算机科学与技术专业 学生\n*   All rights reserved.\n*   作    者：   高祥\n*   完成日期：  2015 年 4 月 5 日\n*   版 本 号：011\n\n*任务：使用栈实现表达式求值\n\n*算法思想：判断运算符的优先级并执行相应的操作\n\n*功能：\n1.对负数、浮点数均有效\n2.可进行多括号的复杂运算\n\n*主要函数：\n*   1.void InitNumberStack(Number &NumberStack);\/\/初始化数字栈\n*   2.void InitOperatorStack(Operator &OperatorStack);\/\/初始化运算符栈\n*   3.void NumberPush(Number &NumberStack,double number);\/\/压入数字栈\n*   4.void NumberPop(Number &NumberStack);\/\/弹出数字栈\n*   5.void OperatorPush(Operator &OperatorStack,char op);\/\/压入运算符栈\n*   6.void OperatorPop(Operator &OperatorStack);\/\/弹出运算符栈\n*   7.char GetTopOperator(Operator &OperatorStack);\/\/得到运算符栈栈顶元素\n*   8.double GetTopNumber(Number &NumberStack);\/\/得到数字栈栈顶元素\n*   9.double ToNumber(string s);\/\/字符串转换成数字函数\n*   10.char Precede(char stacktop,char willpush);\/\/判断运算符的优先级\n*   11.double calculate(double a,double b,char op);\/\/计算\n*   12.int IsDigit(char ch);\/\/判断字符是否为数字\n\n*运行示例：\n请输入运算表达式（表达时应当合法且不含空格且负数必须使用括号括起来且以‘#’结尾，仅输入‘#’表示退出）：\n1+2-3+4-5#\n运算结果为：-1\n请输入运算表达式（表达时应当合法且不含空格且负数必须使用括号括起来且以‘#’结尾，仅输入‘#’表示退出）：\n1.23+3.45-6.78+9.01#\n运算结果为：6.91\n请输入运算表达式（表达时应当合法且不含空格且负数必须使用括号括起来且以‘#’结尾，仅输入‘#’表示退出）：\n1+2*3+4\/5-6#\n运算结果为：1.8\n请输入运算表达式（表达时应当合法且不含空格且负数必须使用括号括起来且以‘#’结尾，仅输入‘#’表示退出）：\n1+((-3)*3+7.2*5\/9)\/((-4)*6+25-7\/2)+23.9#\n运算结果为：26.9\n请输入运算表达式（表达时应当合法且不含空格且负数必须使用括号括起来且以‘#’结尾，仅输入‘#’表示退出）：\n#\n\n*\/\n#include<iostream>\n#include<cstdlib>\nusing namespace std;\n\n#define MAXSIZE 100\n\ntypedef struct\n{\n\tdouble *top;\n\tdouble *base;\n} Number; \/\/数字栈类型\n\ntypedef struct\n{\n\tchar *top;\n\tchar *base;\n} Operator;\/\/运算符栈类型\n\nvoid InitNumberStack(Number &NumberStack);\/\/初始化数字栈\nvoid InitOperatorStack(Operator &OperatorStack);\/\/初始化运算符栈\nvoid NumberPush(Number &NumberStack,double number);\/\/压入数字栈\nvoid  NumberPop(Number &NumberStack);\/\/弹出数字栈\nvoid OperatorPush(Operator &OperatorStack,char op);\/\/压入运算符栈\nvoid OperatorPop(Operator &OperatorStack);\/\/弹出运算符栈\nchar GetTopOperator(Operator &OperatorStack);\/\/得到运算符栈栈顶元素\ndouble GetTopNumber(Number &NumberStack);\/\/得到数字栈栈顶元素\ndouble ToNumber(string s);\/\/字符串转换成数字函数\nchar Precede(char stacktop,char willpush);\/\/判断运算符的优先级\ndouble calculate(double a,double b,char op);\/\/计算\nint IsDigit(char ch);\/\/判断字符是否为数字\n\nint main()\n{\n\tstring str;\n\tcout<<\"请输入运算表达式（表达时应当合法且不含空格且负数必须使用括号括起来且以‘#’结尾，仅输入‘#’表示退出）：\\n\";\n\n\twhile(getline(cin,str)&&str!=\"#\")\n\t{\n\t\tOperator OperatorStack;\n\t\tNumber NumberStack;\n\n\t\tInitNumberStack(NumberStack);\/\/初始化两个栈\n\t\tInitOperatorStack(OperatorStack);\n\n\t\tOperatorPush(OperatorStack,'#');\/\/运算符栈中预存一个‘#’便于判断运算符的优先级\n\n\t\tfor(int i=0; i<static_cast<int>(str.size()); i++)\/\/遍历表达式\n\t\t{\n\t\t\tif(IsDigit(str[i]))\/\/若当前字符为数字，将该数字全部截取出来\n\t\t\t{\n\t\t\t\tint j=i;\/\/数字字符串的起点索引\n\n\t\t\t\twhile(i<str.size()&&(IsDigit(str[i])||str[i]=='.'))\n\t\t\t\t\t\/\/当不越界且字符为数字或小数点时，数字字符串未结束\n\t\t\t\t{\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\t\/\/利用转换函数将截取的数字字符串转换为数字并压入数字栈中\n\t\t\t\tNumberPush(NumberStack,ToNumber(str.substr(j,i-j)));\n\t\t\t\ti--;\/\/索引减1\n\t\t\t}\n\t\t\telse if(str[i]=='('&&str[i+1]=='-')\/\/若遇到负数\n\t\t\t{\n\t\t\t\tint j=i;\n\n\t\t\t\ti++;\/\/细节\n\t\t\t\twhile(i<str.size()&&(IsDigit(str[i])||str[i]=='.'||str[i]=='-'||str[i]==')'))\n\t\t\t\t\t\/\/注意连同负数的左右括号一同截取，防止对后续的判断造成影响\n\t\t\t\t{\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\tNumberPush(NumberStack,ToNumber(str.substr(j,i-j)));\n\t\t\t\ti--;\n\t\t\t}\n\t\t\telse\/\/不是数字\n\t\t\t{\n\t\t\t\tswitch(Precede(GetTopOperator(OperatorStack),str[i]))\n\t\t\t\t\t\/\/Precede函数判断运算符栈栈顶运算符和将要压入的运算符的优先级，以此来决定操作\n\t\t\t\t{\n\t\t\t\tcase '<':\/\/栈顶运算符优先级低\n\t\t\t\t\tOperatorPush(OperatorStack,str[i]);\/\/压入优先级高的运算符\n\t\t\t\t\tbreak;\n\t\t\t\tcase '=':\/\/优先级相同：表明括号内运算完成\n\t\t\t\t\tOperatorPop(OperatorStack);\/\/弹出栈顶的括号\n\t\t\t\t\tbreak;\n\t\t\t\tcase '>':\/\/栈顶运算符优先级高：执行栈顶运算符代表的运算\n\t\t\t\t\tchar op=GetTopOperator(OperatorStack);\/\/得到栈顶运算符\n\t\t\t\t\tOperatorPop(OperatorStack);\/\/删除运算符栈栈顶运算符\n\n\t\t\t\t\tdouble b=GetTopNumber(NumberStack);\/\/得到第二个运算数字，注意是后进先出\n\t\t\t\t\tNumberPop(NumberStack);\/\/删除数字栈栈顶数字\n\t\t\t\t\tdouble a=GetTopNumber(NumberStack);\/\/得到第一个运算数字\n\t\t\t\t\tNumberPop(NumberStack);\/\/删除数字栈栈顶数字\n\t\t\t\t\tNumberPush(NumberStack,calculate(a,b,op));\/\/执行运算并将结果压入数字栈\n\n\t\t\t\t\ti--;\/\/推迟压入运算符栈中，避免运算符栈内出现能运算但未运算的运算符\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout<<\"运算结果为：\"<<GetTopNumber(NumberStack)<<endl;\n\t\tcout<<\"请输入运算表达式（表达时应当合法且不含空格且负数必须使用括号括起来且以‘#’结尾，仅输入‘#’表示退出）：\\n\";\n\t}\n\treturn 0;\n}\n\ndouble ToNumber(string s)\/\/字符串转换成数字函数\n{\n\tstring s1;\/\/去掉括号的部分\n\tif(s[0]=='(')\n\t{\n\t\ts1=s.substr(2,s.size()-3);\n\t}\n\telse\n\t{\n\t\ts1=s;\n\t}\n\n\tdouble num=0.0;\/\/返回值\n\tint i;\n\tfor(i=0; i<s1.size(); i++)\n\t{\n\t\tif(s1[i]=='.')\/\/整数部分转换完成\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tnum=num*10+s1[i]-'0';\n\t}\n\n\t\/\/转换小数部分\n\tdouble j=0.1;\n\tfor(i=i+1; i<s1.size(); i++)\n\t{\n\t\tnum=num+(s1[i]-'0')*j;\n\t\tj=j*0.1;\n\t}\n\n\tif(s1==s)\/\/非负数\n\t{\n\t\treturn num;\n\t}\n\treturn -1*num;\/\/负数添负号再返回\n}\n\nchar Precede(char stacktop,char willpush)\/\/判断运算符的优先级\n{\n\tswitch(stacktop)\n\t{\n\tcase '#':\n\t\tif(willpush=='#')\n\t\t{\n\t\t\treturn '=';\n\t\t}\n\t\treturn '<';\n\n\tcase '+':\n\tcase '-':\n\t\tif(willpush=='+'||willpush=='-'||willpush==')'||willpush=='#')\n\t\t{\n\t\t\treturn '>';\n\t\t}\n\t\treturn '<';\n\n\tcase '*':\n\tcase '\/':\n\t\tif(willpush=='(')\n\t\t{\n\t\t\treturn '<';\n\t\t}\n\t\treturn '>';\n\n\tcase '(':\n\t\tif(willpush==')')\n\t\t{\n\t\t\treturn '=';\n\t\t}\n\t\treturn '<';\n\n\tcase ')':\n\t\treturn '>';\n\t}\n}\n\ndouble calculate(double a,double b,char op)\/\/计算\n{\n\tswitch(op)\n\t{\n\tcase '+':\n\t\treturn a+b;\n\tcase '-':\n\t\treturn a-b;\n\tcase '*':\n\t\treturn a*b;\n\tcase '\/':\n\t\treturn a\/b;\n\t}\n}\n\nvoid InitNumberStack(Number &NumberStack)\/\/初始化数字栈\n{\n\tNumberStack.base=(double*)malloc(MAXSIZE*sizeof(double));\n\tNumberStack.top=NumberStack.base;\n}\n\nvoid InitOperatorStack(Operator &OperatorStack)\/\/初始化运算符栈\n{\n\tOperatorStack.base=(char*)malloc(MAXSIZE*sizeof(char));\n\tOperatorStack.top=OperatorStack.base;\n}\n\nvoid NumberPush(Number &NumberStack,double number)\/\/压入数字栈\n{\n\t*NumberStack.top=number;\n\tNumberStack.top++;\n}\n\nvoid  NumberPop(Number &NumberStack)\/\/弹出数字栈\n{\n\tNumberStack.top--;\n}\n\nvoid OperatorPush(Operator &OperatorStack,char op)\/\/压入运算符栈\n{\n\t*OperatorStack.top=op;\n\tOperatorStack.top++;\n}\n\nvoid OperatorPop(Operator &OperatorStack)\/\/弹出运算符栈\n{\n\tOperatorStack.top--;\n}\n\nchar GetTopOperator(Operator &OperatorStack)\/\/得到运算符栈栈顶元素\n{\n\treturn *(OperatorStack.top-1);\n}\n\ndouble GetTopNumber(Number &NumberStack)\/\/得到数字栈栈顶元素\n{\n\treturn *(NumberStack.top-1);\n}\n\nint IsDigit(char ch)\/\/判断字符是否为数字\n{\n\tif(ch>='0'&&ch<='9')\n\t{\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2019, NVIDIA CORPORATION. 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 <stdexcept>\n#include \"instanceNormalizationPlugin.h\"\n\nusing namespace nvinfer1;\nusing nvinfer1::plugin::InstanceNormalizationPlugin;\nusing nvinfer1::plugin::InstanceNormalizationPluginCreator;\n\n#define CHECK_CUDA(call)                                                                                               \\\n    do                                                                                                                 \\\n    {                                                                                                                  \\\n        cudaError_t status = call;                                                                                     \\\n        if (status != cudaSuccess)                                                                                     \\\n        {                                                                                                              \\\n            return status;                                                                                             \\\n        }                                                                                                              \\\n    } while (0)\n\n#define CHECK_CUDNN(call)                                                                                              \\\n    do                                                                                                                 \\\n    {                                                                                                                  \\\n        cudnnStatus_t status = call;                                                                                   \\\n        if (status != CUDNN_STATUS_SUCCESS)                                                                            \\\n        {                                                                                                              \\\n            return status;                                                                                             \\\n        }                                                                                                              \\\n    } while (0)\n\ninline bool is_CHW(nvinfer1::Dims const& dims)\n{\n    return (dims.nbDims == 3 && dims.type[0] == nvinfer1::DimensionType::kCHANNEL\n        && dims.type[1] == nvinfer1::DimensionType::kSPATIAL && dims.type[2] == nvinfer1::DimensionType::kSPATIAL);\n}\n\n\/\/ This is derived from: https:\/\/fgiesen.wordpress.com\/2012\/03\/28\/half-to-float-done-quic\/\ninline float half_to_float_fast(unsigned short value)\n{\n    union F32\n    {\n        unsigned int u;\n        float f;\n    };\n    static const F32 magic = {(254 - 15) << 23};\n    static const F32 was_infnan = {(127 + 16) << 23};\n    F32 result;\n    result.u = (value & 0x7fff) << 13; \/\/ exponent\/mantissa bits\n    result.f *= magic.f;               \/\/ exponent adjust\n    if (result.f >= was_infnan.f)\n    { \/\/ make sure Inf\/NaN survive\n        result.u |= 255 << 23;\n    }\n    result.u |= (value & 0x8000) << 16; \/\/ sign bit\n    return result.f;\n}\n\ncudnnStatus_t convert_trt2cudnn_dtype(nvinfer1::DataType trt_dtype, cudnnDataType_t* cudnn_dtype)\n{\n    switch (trt_dtype)\n    {\n    case nvinfer1::DataType::kFLOAT: *cudnn_dtype = CUDNN_DATA_FLOAT; break;\n    case nvinfer1::DataType::kHALF: *cudnn_dtype = CUDNN_DATA_HALF; break;\n    default: return CUDNN_STATUS_BAD_PARAM;\n    }\n    return CUDNN_STATUS_SUCCESS;\n}\n\nnamespace {\n    constexpr const char* INSTANCE_PLUGIN_VERSION{\"001\"};\n    constexpr const char* INSTANCE_PLUGIN_NAME{\"InstanceNormalization_TRT\"};\n}\n\nPluginFieldCollection InstanceNormalizationPluginCreator::mFC{};\nstd::vector<PluginField> InstanceNormalizationPluginCreator::mPluginAttributes;\n\n\nInstanceNormalizationPlugin::InstanceNormalizationPlugin(\n    float epsilon, const std::vector<float>& scale, const std::vector<float>& bias)\n    : _epsilon(epsilon)\n    , _nchan(scale.size())\n    , _h_scale(scale)\n    , _h_bias(bias)\n    , _initialized(false)\n{\n    ASSERT(scale.size() == bias.size());\n}\n\nInstanceNormalizationPlugin::InstanceNormalizationPlugin(\n    float epsilon, nvinfer1::Weights const& scale, nvinfer1::Weights const& bias)\n    : _epsilon(epsilon)\n    , _nchan(scale.count)\n    , _initialized(false)\n{\n    ASSERT(scale.count == bias.count);\n    if (scale.type == nvinfer1::DataType::kFLOAT)\n    {\n        _h_scale.assign((float*) scale.values, (float*) scale.values + scale.count);\n    }\n    else if (scale.type == nvinfer1::DataType::kHALF)\n    {\n        _h_scale.reserve(_nchan);\n        for (int c = 0; c < _nchan; ++c)\n        {\n            unsigned short value = ((unsigned short*) scale.values)[c];\n            _h_scale.push_back(half_to_float_fast(value));\n        }\n    }\n    else\n    {\n        throw std::runtime_error(\"Unsupported scale dtype\");\n    }\n    if (bias.type == nvinfer1::DataType::kFLOAT)\n    {\n        _h_bias.assign((float*) bias.values, (float*) bias.values + bias.count);\n    }\n    else if (bias.type == nvinfer1::DataType::kHALF)\n    {\n        _h_bias.reserve(_nchan);\n        for (int c = 0; c < _nchan; ++c)\n        {\n            unsigned short value = ((unsigned short*) bias.values)[c];\n            _h_bias.push_back(half_to_float_fast(value));\n        }\n    }\n    else\n    {\n        throw std::runtime_error(\"Unsupported bias dtype\");\n    }\n}\n\nInstanceNormalizationPlugin::InstanceNormalizationPlugin(void const* serialData, size_t serialLength) : _initialized(false)\n{\n    deserialize_value(&serialData, &serialLength, &_epsilon);\n    deserialize_value(&serialData, &serialLength, &_nchan);\n    deserialize_value(&serialData, &serialLength, &_h_scale);\n    deserialize_value(&serialData, &serialLength, &_h_bias);\n}\n\nInstanceNormalizationPlugin::~InstanceNormalizationPlugin()\n{\n    terminate();\n}\n\n\/\/ InstanceNormalizationPlugin returns one output.\nint InstanceNormalizationPlugin::getNbOutputs() const\n{\n    return 1;\n}\n\nDimsExprs InstanceNormalizationPlugin::getOutputDimensions(\n    int outputIndex, const nvinfer1::DimsExprs* inputs, int nbInputs, nvinfer1::IExprBuilder& exprBuilder)\n{\n    nvinfer1::DimsExprs output(inputs[0]);\n    return output;\n}\n\nint InstanceNormalizationPlugin::initialize()\n{\n    _initialized = true;\n    CHECK_CUDNN(cudnnCreate(&_cudnn_handle));\n    CHECK_CUDNN(cudnnCreateTensorDescriptor(&_b_desc));\n    CHECK_CUDNN(cudnnCreateTensorDescriptor(&_x_desc));\n    CHECK_CUDNN(cudnnCreateTensorDescriptor(&_y_desc));\n    return 0;\n}\n\nvoid InstanceNormalizationPlugin::terminate()\n{\n    if (!_initialized)\n    {\n        return;\n    }\n    cudnnDestroyTensorDescriptor(_y_desc);\n    cudnnDestroyTensorDescriptor(_x_desc);\n    cudnnDestroyTensorDescriptor(_b_desc);\n    cudnnDestroy(_cudnn_handle);\n    _initialized = false;\n}\n\nsize_t InstanceNormalizationPlugin::getWorkspaceSize(const nvinfer1::PluginTensorDesc* inputs, int nbInputs, const nvinfer1::PluginTensorDesc* outputs, int nbOutputs) const \n{ \n    return 0; \n}\n\n\nint InstanceNormalizationPlugin::enqueue(const nvinfer1::PluginTensorDesc* inputDesc,\n    const nvinfer1::PluginTensorDesc* outputDesc, const void* const* inputs, void* const* outputs, void* workspace,\n    cudaStream_t stream)\n{\n    nvinfer1::Dims input_dims = inputDesc[0].dims;\n    int n = input_dims.d[0];\n    int c = input_dims.d[1];\n    int h = input_dims.d[2];\n    int w = input_dims.d[3];\n    size_t nchan_bytes = c * sizeof(float);\n\n    \/\/ Note: We repeat the data for each batch entry so that we can do the full\n    \/\/       computation in a single CUDNN call in enqueue().\n    CHECK_CUDA(cudaMalloc((void**) &_d_scale, n * nchan_bytes));\n    CHECK_CUDA(cudaMalloc((void**) &_d_bias, n * nchan_bytes));\n    for (int i = 0; i < n; ++i)\n    {\n        CHECK_CUDA(cudaMemcpy(_d_scale + i * c, _h_scale.data(), nchan_bytes, cudaMemcpyHostToDevice));\n        CHECK_CUDA(cudaMemcpy(_d_bias + i * c, _h_bias.data(), nchan_bytes, cudaMemcpyHostToDevice));\n    }\n\n    CHECK_CUDNN(cudnnSetTensor4dDescriptor(_b_desc, CUDNN_TENSOR_NCHW, CUDNN_DATA_FLOAT, 1, n * c, 1, 1));\n    cudnnDataType_t cudnn_dtype;\n    CHECK_CUDNN(convert_trt2cudnn_dtype(inputDesc[0].type, &cudnn_dtype));\n    CHECK_CUDNN(cudnnSetTensor4dDescriptor(_x_desc, CUDNN_TENSOR_NCHW, cudnn_dtype, 1, n * c, h, w));\n    CHECK_CUDNN(cudnnSetTensor4dDescriptor(_y_desc, CUDNN_TENSOR_NCHW, cudnn_dtype, 1, n * c, h, w));\n    float alpha = 1;\n    float beta = 0;\n    void const* x_ptr = inputs[0];\n    void* y_ptr = outputs[0];\n    CHECK_CUDNN(cudnnSetStream(_cudnn_handle, stream));\n    \/\/ Note: Use of CUDNN_BATCHNORM_SPATIAL_PERSISTENT can cause numerical\n    \/\/       overflows (NaNs) for fp32 data in some circumstances. The lower-\n    \/\/       performance CUDNN_BATCHNORM_SPATIAL should be used if this is not\n    \/\/       acceptable.\n    CHECK_CUDNN(cudnnBatchNormalizationForwardTraining(_cudnn_handle, CUDNN_BATCHNORM_SPATIAL_PERSISTENT, &alpha, &beta,\n        _x_desc, x_ptr, _y_desc, y_ptr, _b_desc, _d_scale, _d_bias, 1., nullptr, nullptr, _epsilon, nullptr, nullptr));\n    cudaFree(_d_bias);\n    cudaFree(_d_scale);\n    return 0;\n}\n\nsize_t InstanceNormalizationPlugin::getSerializationSize() const\n{\n    return (serialized_size(_epsilon) +\n            serialized_size(_nchan) +\n            serialized_size(_h_scale) +\n            serialized_size(_h_bias));\n}\n\nvoid InstanceNormalizationPlugin::serialize(void *buffer) const\n{\n    serialize_value(&buffer, _epsilon);\n    serialize_value(&buffer, _nchan);\n    serialize_value(&buffer, _h_scale);\n    serialize_value(&buffer, _h_bias);\n}\n\nbool InstanceNormalizationPlugin::supportsFormatCombination(\n    int pos, const nvinfer1::PluginTensorDesc* inOut, int nbInputs, int nbOutputs)\n{\n    ASSERT(inOut && pos < (nbInputs + nbOutputs));\n    return ((inOut[pos].type == nvinfer1::DataType::kFLOAT || inOut[pos].type == nvinfer1::DataType::kHALF)\n        && inOut[pos].format == nvinfer1::PluginFormat::kNCHW);\n}\n\nconst char* InstanceNormalizationPlugin::getPluginType() const\n{\n    return INSTANCE_PLUGIN_NAME;\n}\n\nconst char* InstanceNormalizationPlugin::getPluginVersion() const\n{\n    return INSTANCE_PLUGIN_VERSION;\n}\n\nvoid InstanceNormalizationPlugin::destroy()\n{ \n    delete this;\n}\n\nIPluginV2DynamicExt* InstanceNormalizationPlugin::clone() const\n{ \n    return new InstanceNormalizationPlugin{_epsilon, _h_scale, _h_bias};\n}\n\n\/\/ Set plugin namespace\nvoid InstanceNormalizationPlugin::setPluginNamespace(const char* pluginNamespace)\n{\n    mPluginNamespace = pluginNamespace;\n}\n\nconst char* InstanceNormalizationPlugin::getPluginNamespace() const\n{\n    return mPluginNamespace;\n}\n\nnvinfer1::DataType InstanceNormalizationPlugin::getOutputDataType(\n    int index, const nvinfer1::DataType* inputTypes, int nbInputs) const\n{\n    ASSERT(inputTypes && nbInputs > 0 && index == 0);\n    return inputTypes[0];\n}\n\n\/\/ Attach the plugin object to an execution context and grant the plugin the access to some context resource.\nvoid InstanceNormalizationPlugin::attachToContext(cudnnContext* cudnnContext, cublasContext* cublasContext, IGpuAllocator* gpuAllocator)\n{\n}\n\n\/\/ Detach the plugin object from its execution context.\nvoid InstanceNormalizationPlugin::detachFromContext() {}\n\nvoid InstanceNormalizationPlugin::configurePlugin(const nvinfer1::DynamicPluginTensorDesc* in, int nbInputs,\n    const nvinfer1::DynamicPluginTensorDesc* out, int nbOutputs)\n{\n    for (int i = 0; i < nbInputs; i++)\n    {\n      for (int j = 0; j < in[0].desc.dims.nbDims; j++)\n      {\n        \/\/ Do not support dynamic dimensions\n        ASSERT(in[0].desc.dims.d[j] != -1);\n      }\n    }\n}\n\n\/\/ InstanceNormalizationPluginCreator methods\nInstanceNormalizationPluginCreator::InstanceNormalizationPluginCreator()\n{\n    mPluginAttributes.emplace_back(PluginField(\"epsilon\", nullptr, PluginFieldType::kFLOAT32, 1));\n    mPluginAttributes.emplace_back(PluginField(\"scales\", nullptr, PluginFieldType::kFLOAT32, 1));\n    mPluginAttributes.emplace_back(PluginField(\"bias\", nullptr, PluginFieldType::kFLOAT32, 1));\n\n    mFC.nbFields = mPluginAttributes.size();\n    mFC.fields = mPluginAttributes.data();\n}\n\nconst char* InstanceNormalizationPluginCreator::getPluginName() const\n{\n    return INSTANCE_PLUGIN_NAME;\n}\n\nconst char* InstanceNormalizationPluginCreator::getPluginVersion() const\n{\n    return INSTANCE_PLUGIN_VERSION;\n}\n\nconst PluginFieldCollection* InstanceNormalizationPluginCreator::getFieldNames()\n{\n    return &mFC;\n}\n\nIPluginV2DynamicExt* InstanceNormalizationPluginCreator::createPlugin(const char* name, const nvinfer1::PluginFieldCollection* fc)\n{\n    std::vector<float> scaleValues;\n    std::vector<float> biasValues;\n    float epsilon {};\n    const PluginField* fields = fc->fields;\n    for (int i = 0; i < fc->nbFields; ++i)\n    {\n        const char* attrName = fields[i].name;\n        if (!strcmp(attrName, \"epsilon\"))\n        {\n            ASSERT(fields[i].type == PluginFieldType::kFLOAT32);\n            epsilon= *(static_cast<const float*>(fields[i].data));\n        }\n        else if (!strcmp(attrName, \"scales\"))\n        {\n            ASSERT(fields[i].type == PluginFieldType::kFLOAT32);\n            int size = fields[i].length;\n            scaleValues.reserve(size);\n            const auto* w = static_cast<const float*>(fields[i].data);\n            for (int j = 0; j < size; j++)\n            {\n                scaleValues.push_back(*w);\n                w++;\n            }\n        }\n        else if (!strcmp(attrName, \"bias\"))\n        {\n            ASSERT(fields[i].type == PluginFieldType::kFLOAT32);\n            int size = fields[i].length;\n            biasValues.reserve(size);\n            const auto* w = static_cast<const float*>(fields[i].data);\n            for (int j = 0; j < size; j++)\n            {\n                biasValues.push_back(*w);\n                w++;\n            }\n        }\n    }\n\n    Weights scaleWeights{DataType::kFLOAT, scaleValues.data(), (int64_t) scaleValues.size()};\n    Weights biasWeights{DataType::kFLOAT, biasValues.data(), (int64_t) biasValues.size()};\n\n    InstanceNormalizationPlugin* obj = new InstanceNormalizationPlugin(epsilon, scaleWeights, biasWeights);\n    obj->setPluginNamespace(mNamespace.c_str());\n    return obj;\n}\n\nIPluginV2DynamicExt* InstanceNormalizationPluginCreator::deserializePlugin(const char* name, const void* serialData, size_t serialLength)\n{\n    InstanceNormalizationPlugin* obj = new InstanceNormalizationPlugin{serialData, serialLength}; \n    obj->setPluginNamespace(mNamespace.c_str());\n    return obj;\n}\n<commit_msg>Correctly set namespace when doing clone in instanceNormalizationPlugin (#318)<commit_after>\/*\n * Copyright (c) 2019, NVIDIA CORPORATION. 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 <stdexcept>\n#include \"instanceNormalizationPlugin.h\"\n\nusing namespace nvinfer1;\nusing nvinfer1::plugin::InstanceNormalizationPlugin;\nusing nvinfer1::plugin::InstanceNormalizationPluginCreator;\n\n#define CHECK_CUDA(call)                                                                                               \\\n    do                                                                                                                 \\\n    {                                                                                                                  \\\n        cudaError_t status = call;                                                                                     \\\n        if (status != cudaSuccess)                                                                                     \\\n        {                                                                                                              \\\n            return status;                                                                                             \\\n        }                                                                                                              \\\n    } while (0)\n\n#define CHECK_CUDNN(call)                                                                                              \\\n    do                                                                                                                 \\\n    {                                                                                                                  \\\n        cudnnStatus_t status = call;                                                                                   \\\n        if (status != CUDNN_STATUS_SUCCESS)                                                                            \\\n        {                                                                                                              \\\n            return status;                                                                                             \\\n        }                                                                                                              \\\n    } while (0)\n\ninline bool is_CHW(nvinfer1::Dims const& dims)\n{\n    return (dims.nbDims == 3 && dims.type[0] == nvinfer1::DimensionType::kCHANNEL\n        && dims.type[1] == nvinfer1::DimensionType::kSPATIAL && dims.type[2] == nvinfer1::DimensionType::kSPATIAL);\n}\n\n\/\/ This is derived from: https:\/\/fgiesen.wordpress.com\/2012\/03\/28\/half-to-float-done-quic\/\ninline float half_to_float_fast(unsigned short value)\n{\n    union F32\n    {\n        unsigned int u;\n        float f;\n    };\n    static const F32 magic = {(254 - 15) << 23};\n    static const F32 was_infnan = {(127 + 16) << 23};\n    F32 result;\n    result.u = (value & 0x7fff) << 13; \/\/ exponent\/mantissa bits\n    result.f *= magic.f;               \/\/ exponent adjust\n    if (result.f >= was_infnan.f)\n    { \/\/ make sure Inf\/NaN survive\n        result.u |= 255 << 23;\n    }\n    result.u |= (value & 0x8000) << 16; \/\/ sign bit\n    return result.f;\n}\n\ncudnnStatus_t convert_trt2cudnn_dtype(nvinfer1::DataType trt_dtype, cudnnDataType_t* cudnn_dtype)\n{\n    switch (trt_dtype)\n    {\n    case nvinfer1::DataType::kFLOAT: *cudnn_dtype = CUDNN_DATA_FLOAT; break;\n    case nvinfer1::DataType::kHALF: *cudnn_dtype = CUDNN_DATA_HALF; break;\n    default: return CUDNN_STATUS_BAD_PARAM;\n    }\n    return CUDNN_STATUS_SUCCESS;\n}\n\nnamespace {\n    constexpr const char* INSTANCE_PLUGIN_VERSION{\"001\"};\n    constexpr const char* INSTANCE_PLUGIN_NAME{\"InstanceNormalization_TRT\"};\n}\n\nPluginFieldCollection InstanceNormalizationPluginCreator::mFC{};\nstd::vector<PluginField> InstanceNormalizationPluginCreator::mPluginAttributes;\n\n\nInstanceNormalizationPlugin::InstanceNormalizationPlugin(\n    float epsilon, const std::vector<float>& scale, const std::vector<float>& bias)\n    : _epsilon(epsilon)\n    , _nchan(scale.size())\n    , _h_scale(scale)\n    , _h_bias(bias)\n    , _initialized(false)\n{\n    ASSERT(scale.size() == bias.size());\n}\n\nInstanceNormalizationPlugin::InstanceNormalizationPlugin(\n    float epsilon, nvinfer1::Weights const& scale, nvinfer1::Weights const& bias)\n    : _epsilon(epsilon)\n    , _nchan(scale.count)\n    , _initialized(false)\n{\n    ASSERT(scale.count == bias.count);\n    if (scale.type == nvinfer1::DataType::kFLOAT)\n    {\n        _h_scale.assign((float*) scale.values, (float*) scale.values + scale.count);\n    }\n    else if (scale.type == nvinfer1::DataType::kHALF)\n    {\n        _h_scale.reserve(_nchan);\n        for (int c = 0; c < _nchan; ++c)\n        {\n            unsigned short value = ((unsigned short*) scale.values)[c];\n            _h_scale.push_back(half_to_float_fast(value));\n        }\n    }\n    else\n    {\n        throw std::runtime_error(\"Unsupported scale dtype\");\n    }\n    if (bias.type == nvinfer1::DataType::kFLOAT)\n    {\n        _h_bias.assign((float*) bias.values, (float*) bias.values + bias.count);\n    }\n    else if (bias.type == nvinfer1::DataType::kHALF)\n    {\n        _h_bias.reserve(_nchan);\n        for (int c = 0; c < _nchan; ++c)\n        {\n            unsigned short value = ((unsigned short*) bias.values)[c];\n            _h_bias.push_back(half_to_float_fast(value));\n        }\n    }\n    else\n    {\n        throw std::runtime_error(\"Unsupported bias dtype\");\n    }\n}\n\nInstanceNormalizationPlugin::InstanceNormalizationPlugin(void const* serialData, size_t serialLength) : _initialized(false)\n{\n    deserialize_value(&serialData, &serialLength, &_epsilon);\n    deserialize_value(&serialData, &serialLength, &_nchan);\n    deserialize_value(&serialData, &serialLength, &_h_scale);\n    deserialize_value(&serialData, &serialLength, &_h_bias);\n}\n\nInstanceNormalizationPlugin::~InstanceNormalizationPlugin()\n{\n    terminate();\n}\n\n\/\/ InstanceNormalizationPlugin returns one output.\nint InstanceNormalizationPlugin::getNbOutputs() const\n{\n    return 1;\n}\n\nDimsExprs InstanceNormalizationPlugin::getOutputDimensions(\n    int outputIndex, const nvinfer1::DimsExprs* inputs, int nbInputs, nvinfer1::IExprBuilder& exprBuilder)\n{\n    nvinfer1::DimsExprs output(inputs[0]);\n    return output;\n}\n\nint InstanceNormalizationPlugin::initialize()\n{\n    _initialized = true;\n    CHECK_CUDNN(cudnnCreate(&_cudnn_handle));\n    CHECK_CUDNN(cudnnCreateTensorDescriptor(&_b_desc));\n    CHECK_CUDNN(cudnnCreateTensorDescriptor(&_x_desc));\n    CHECK_CUDNN(cudnnCreateTensorDescriptor(&_y_desc));\n    return 0;\n}\n\nvoid InstanceNormalizationPlugin::terminate()\n{\n    if (!_initialized)\n    {\n        return;\n    }\n    cudnnDestroyTensorDescriptor(_y_desc);\n    cudnnDestroyTensorDescriptor(_x_desc);\n    cudnnDestroyTensorDescriptor(_b_desc);\n    cudnnDestroy(_cudnn_handle);\n    _initialized = false;\n}\n\nsize_t InstanceNormalizationPlugin::getWorkspaceSize(const nvinfer1::PluginTensorDesc* inputs, int nbInputs, const nvinfer1::PluginTensorDesc* outputs, int nbOutputs) const \n{ \n    return 0; \n}\n\n\nint InstanceNormalizationPlugin::enqueue(const nvinfer1::PluginTensorDesc* inputDesc,\n    const nvinfer1::PluginTensorDesc* outputDesc, const void* const* inputs, void* const* outputs, void* workspace,\n    cudaStream_t stream)\n{\n    nvinfer1::Dims input_dims = inputDesc[0].dims;\n    int n = input_dims.d[0];\n    int c = input_dims.d[1];\n    int h = input_dims.d[2];\n    int w = input_dims.d[3];\n    size_t nchan_bytes = c * sizeof(float);\n\n    \/\/ Note: We repeat the data for each batch entry so that we can do the full\n    \/\/       computation in a single CUDNN call in enqueue().\n    CHECK_CUDA(cudaMalloc((void**) &_d_scale, n * nchan_bytes));\n    CHECK_CUDA(cudaMalloc((void**) &_d_bias, n * nchan_bytes));\n    for (int i = 0; i < n; ++i)\n    {\n        CHECK_CUDA(cudaMemcpy(_d_scale + i * c, _h_scale.data(), nchan_bytes, cudaMemcpyHostToDevice));\n        CHECK_CUDA(cudaMemcpy(_d_bias + i * c, _h_bias.data(), nchan_bytes, cudaMemcpyHostToDevice));\n    }\n\n    CHECK_CUDNN(cudnnSetTensor4dDescriptor(_b_desc, CUDNN_TENSOR_NCHW, CUDNN_DATA_FLOAT, 1, n * c, 1, 1));\n    cudnnDataType_t cudnn_dtype;\n    CHECK_CUDNN(convert_trt2cudnn_dtype(inputDesc[0].type, &cudnn_dtype));\n    CHECK_CUDNN(cudnnSetTensor4dDescriptor(_x_desc, CUDNN_TENSOR_NCHW, cudnn_dtype, 1, n * c, h, w));\n    CHECK_CUDNN(cudnnSetTensor4dDescriptor(_y_desc, CUDNN_TENSOR_NCHW, cudnn_dtype, 1, n * c, h, w));\n    float alpha = 1;\n    float beta = 0;\n    void const* x_ptr = inputs[0];\n    void* y_ptr = outputs[0];\n    CHECK_CUDNN(cudnnSetStream(_cudnn_handle, stream));\n    \/\/ Note: Use of CUDNN_BATCHNORM_SPATIAL_PERSISTENT can cause numerical\n    \/\/       overflows (NaNs) for fp32 data in some circumstances. The lower-\n    \/\/       performance CUDNN_BATCHNORM_SPATIAL should be used if this is not\n    \/\/       acceptable.\n    CHECK_CUDNN(cudnnBatchNormalizationForwardTraining(_cudnn_handle, CUDNN_BATCHNORM_SPATIAL_PERSISTENT, &alpha, &beta,\n        _x_desc, x_ptr, _y_desc, y_ptr, _b_desc, _d_scale, _d_bias, 1., nullptr, nullptr, _epsilon, nullptr, nullptr));\n    cudaFree(_d_bias);\n    cudaFree(_d_scale);\n    return 0;\n}\n\nsize_t InstanceNormalizationPlugin::getSerializationSize() const\n{\n    return (serialized_size(_epsilon) +\n            serialized_size(_nchan) +\n            serialized_size(_h_scale) +\n            serialized_size(_h_bias));\n}\n\nvoid InstanceNormalizationPlugin::serialize(void *buffer) const\n{\n    serialize_value(&buffer, _epsilon);\n    serialize_value(&buffer, _nchan);\n    serialize_value(&buffer, _h_scale);\n    serialize_value(&buffer, _h_bias);\n}\n\nbool InstanceNormalizationPlugin::supportsFormatCombination(\n    int pos, const nvinfer1::PluginTensorDesc* inOut, int nbInputs, int nbOutputs)\n{\n    ASSERT(inOut && pos < (nbInputs + nbOutputs));\n    return ((inOut[pos].type == nvinfer1::DataType::kFLOAT || inOut[pos].type == nvinfer1::DataType::kHALF)\n        && inOut[pos].format == nvinfer1::PluginFormat::kNCHW);\n}\n\nconst char* InstanceNormalizationPlugin::getPluginType() const\n{\n    return INSTANCE_PLUGIN_NAME;\n}\n\nconst char* InstanceNormalizationPlugin::getPluginVersion() const\n{\n    return INSTANCE_PLUGIN_VERSION;\n}\n\nvoid InstanceNormalizationPlugin::destroy()\n{ \n    delete this;\n}\n\nIPluginV2DynamicExt* InstanceNormalizationPlugin::clone() const\n{ \n    auto plugin = new InstanceNormalizationPlugin{_epsilon, _h_scale, _h_bias};\n    plugin->setPluginNamespace(mPluginNamespace);\n    return plugin;\n}\n\n\/\/ Set plugin namespace\nvoid InstanceNormalizationPlugin::setPluginNamespace(const char* pluginNamespace)\n{\n    mPluginNamespace = pluginNamespace;\n}\n\nconst char* InstanceNormalizationPlugin::getPluginNamespace() const\n{\n    return mPluginNamespace;\n}\n\nnvinfer1::DataType InstanceNormalizationPlugin::getOutputDataType(\n    int index, const nvinfer1::DataType* inputTypes, int nbInputs) const\n{\n    ASSERT(inputTypes && nbInputs > 0 && index == 0);\n    return inputTypes[0];\n}\n\n\/\/ Attach the plugin object to an execution context and grant the plugin the access to some context resource.\nvoid InstanceNormalizationPlugin::attachToContext(cudnnContext* cudnnContext, cublasContext* cublasContext, IGpuAllocator* gpuAllocator)\n{\n}\n\n\/\/ Detach the plugin object from its execution context.\nvoid InstanceNormalizationPlugin::detachFromContext() {}\n\nvoid InstanceNormalizationPlugin::configurePlugin(const nvinfer1::DynamicPluginTensorDesc* in, int nbInputs,\n    const nvinfer1::DynamicPluginTensorDesc* out, int nbOutputs)\n{\n    for (int i = 0; i < nbInputs; i++)\n    {\n      for (int j = 0; j < in[0].desc.dims.nbDims; j++)\n      {\n        \/\/ Do not support dynamic dimensions\n        ASSERT(in[0].desc.dims.d[j] != -1);\n      }\n    }\n}\n\n\/\/ InstanceNormalizationPluginCreator methods\nInstanceNormalizationPluginCreator::InstanceNormalizationPluginCreator()\n{\n    mPluginAttributes.emplace_back(PluginField(\"epsilon\", nullptr, PluginFieldType::kFLOAT32, 1));\n    mPluginAttributes.emplace_back(PluginField(\"scales\", nullptr, PluginFieldType::kFLOAT32, 1));\n    mPluginAttributes.emplace_back(PluginField(\"bias\", nullptr, PluginFieldType::kFLOAT32, 1));\n\n    mFC.nbFields = mPluginAttributes.size();\n    mFC.fields = mPluginAttributes.data();\n}\n\nconst char* InstanceNormalizationPluginCreator::getPluginName() const\n{\n    return INSTANCE_PLUGIN_NAME;\n}\n\nconst char* InstanceNormalizationPluginCreator::getPluginVersion() const\n{\n    return INSTANCE_PLUGIN_VERSION;\n}\n\nconst PluginFieldCollection* InstanceNormalizationPluginCreator::getFieldNames()\n{\n    return &mFC;\n}\n\nIPluginV2DynamicExt* InstanceNormalizationPluginCreator::createPlugin(const char* name, const nvinfer1::PluginFieldCollection* fc)\n{\n    std::vector<float> scaleValues;\n    std::vector<float> biasValues;\n    float epsilon {};\n    const PluginField* fields = fc->fields;\n    for (int i = 0; i < fc->nbFields; ++i)\n    {\n        const char* attrName = fields[i].name;\n        if (!strcmp(attrName, \"epsilon\"))\n        {\n            ASSERT(fields[i].type == PluginFieldType::kFLOAT32);\n            epsilon= *(static_cast<const float*>(fields[i].data));\n        }\n        else if (!strcmp(attrName, \"scales\"))\n        {\n            ASSERT(fields[i].type == PluginFieldType::kFLOAT32);\n            int size = fields[i].length;\n            scaleValues.reserve(size);\n            const auto* w = static_cast<const float*>(fields[i].data);\n            for (int j = 0; j < size; j++)\n            {\n                scaleValues.push_back(*w);\n                w++;\n            }\n        }\n        else if (!strcmp(attrName, \"bias\"))\n        {\n            ASSERT(fields[i].type == PluginFieldType::kFLOAT32);\n            int size = fields[i].length;\n            biasValues.reserve(size);\n            const auto* w = static_cast<const float*>(fields[i].data);\n            for (int j = 0; j < size; j++)\n            {\n                biasValues.push_back(*w);\n                w++;\n            }\n        }\n    }\n\n    Weights scaleWeights{DataType::kFLOAT, scaleValues.data(), (int64_t) scaleValues.size()};\n    Weights biasWeights{DataType::kFLOAT, biasValues.data(), (int64_t) biasValues.size()};\n\n    InstanceNormalizationPlugin* obj = new InstanceNormalizationPlugin(epsilon, scaleWeights, biasWeights);\n    obj->setPluginNamespace(mNamespace.c_str());\n    return obj;\n}\n\nIPluginV2DynamicExt* InstanceNormalizationPluginCreator::deserializePlugin(const char* name, const void* serialData, size_t serialLength)\n{\n    InstanceNormalizationPlugin* obj = new InstanceNormalizationPlugin{serialData, serialLength}; \n    obj->setPluginNamespace(mNamespace.c_str());\n    return obj;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ContactManager.h\"\n\n#include <storage\/Directory.h>\n#include <storage\/Entry.h>\n#include <storage\/FindDirectory.h>\n#include <storage\/NodeMonitor.h>\n#include <storage\/Query.h>\n#include <storage\/VolumeRoster.h>\n#include <support\/Autolock.h>\n#include <support\/Locker.h>\n\n#include <libim\/Constants.h>\n#include <libim\/Contact.h>\n#include <libim\/Helpers.h>\n\n#include \"ContactCachedConnections.h\"\n#include \"ContactListener.h\"\n#include \"common\/SpecificationFinder.h\"\n\n\/\/#pragma mark Definitions\n\nusing namespace IM;\n\nclass QueryStore : public GenericListStore<BQuery *> {\n};\n\nclass ContactStore : public GenericMapStore<entry_ref, ContactCachedConnections *>,  public SpecificationFinder<ContactCachedConnections *> {\n\tpublic:\n\t\tContactStore(void)\n\t\t\t: GenericMapStore<entry_ref, ContactCachedConnections *>(),\n\t\t\tfLock(new BLocker()) {\n\t\t};\n\t\t\n\t\tvirtual ~ContactStore(void) {\n\t\t\tdelete fLock;\n\t\t};\n\n\t\tvirtual bool FindFirstNoLock(ContactSpecification *specification, ContactCachedConnections **firstMatch, bool deleteSpec = true) {\n\t\t\tbool result = false;\n\t\t\tGenericMapStore<entry_ref, ContactCachedConnections *>::Iterator it;\n\n\t\t\tfor (it = Start(); it != End(); it++) {\n\t\t\t\tContactCachedConnections *current = it->second;\n\t\t\t\t\n\t\t\t\tif (specification->IsSatisfiedBy(current) == true) {\n\t\t\t\t\t*firstMatch = current;\n\t\t\t\t\tresult = true;\n\t\t\t\t\tbreak;\n\t\t\t\t};\n\t\t\t};\n\n\t\t\tif (deleteSpec == true) {\n\t\t\t\tdelete specification;\n\t\t\t};\n\n\t\t\treturn result;\n\t\t};\n\t\t\n\t\tvirtual bool FindFirst(ContactSpecification *specification, ContactCachedConnections **firstMatch, bool deleteSpec = true) {\n\t\t\tBAutolock lock(fLock);\n\t\t\tbool result = false;\n\t\t\t\n\t\t\tif (lock.IsLocked() == true) {\n\t\t\t\tresult = FindFirstNoLock(specification, firstMatch, deleteSpec);\n\t\t\t};\n\t\t\t\n\t\t\t\n\t\t\treturn result;\n\t\t};\n\n\t\tvirtual GenericListStore<ContactCachedConnections *> FindAll(ContactSpecification *specification, bool deleteSpec = true) {\n\t\t\tGenericListStore<ContactCachedConnections *> contacts(false);\n\t\t\tBAutolock lock(fLock);\n\t\t\t\n\t\t\tif (lock.IsLocked() == true) {\n\t\t\t\tGenericMapStore<entry_ref, ContactCachedConnections *>::Iterator it;\n\t\t\t\tfor (it = Start(); it != End(); it++) {\n\t\t\t\t\tContactCachedConnections *current = it->second;\n\t\t\t\t\t\n\t\t\t\t\tif (specification->IsSatisfiedBy(current) == true) {\n\t\t\t\t\t\tcontacts.Add(current);\n\t\t\t\t\t};\n\t\t\t\t};\n\t\t\t};\n\t\t\t\n\t\t\tif (deleteSpec == true) {\n\t\t\t\tdelete specification;\n\t\t\t};\n\t\t\t\n\t\t\treturn contacts;\n\t\t};\n\t\n\t\tBLocker *GetLock(void) const {\n\t\t\treturn fLock;\n\t\t};\n\tprivate:\n\t\tBLocker\t*fLock;\n};\n\n\/\/#pragma mark Constants\n\nconst char *kContactMIMEType = \"application\/x-person\";\nextern char *kAppName;\n\n\/\/#pragma mark Constructor\n\nContactManager::ContactManager(ContactListener *listener)\n\t: BLooper(\"ContactManager\", B_LOW_PRIORITY),\n\tfContactListener(listener),\n\tfContact(new ContactStore()), \n\tfQuery(new QueryStore()) {\n\t\n\tRun();\n};\n\nContactManager::~ContactManager(void) {\n\tdelete fQuery;\n};\n\n\/\/#pragma mark BLooper Hooks\n\nvoid ContactManager::MessageReceived(BMessage *msg) {\n\tswitch (msg->what) {\n\t\t\/\/ Contact messages. Both query and node monitor.\n\t\tcase B_QUERY_UPDATE: {\n\t\t\tint32 opcode = B_ERROR;\n\t\t\t\n\t\t\tif (msg->FindInt32(\"opcode\", &opcode) != B_OK) {\n\t\t\t\treturn;\n\t\t\t};\n\t\t\t\n\t\t\tContactHandle handle;\n\t\t\tconst char *name = NULL;\n\t\t\t\n\t\t\tswitch (opcode) {\n\t\t\t\tcase B_ENTRY_CREATED: {\n\t\t\t\t\t\/\/ Add to contact list\n\t\t\t\t\tmsg->FindString(\"name\", &name );\n\t\t\t\t\thandle.entry.set_name(name);\n\t\t\t\t\tmsg->FindInt64(\"directory\", &handle.entry.directory);\n\t\t\t\t\tmsg->FindInt32(\"device\", &handle.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &handle.node);\n\t\t\t\t\t\n\t\t\t\t\tif (fContact->Contains(handle.entry) == false) {\n\t\t\t\t\t\tContactAdded(handle);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLOG(kAppName, liDebug, \"Got a B_ENTRY_CREATED for a Contact we already know about - possibly due to live query notification catching up with a call to CreateContact\");\n\t\t\t\t\t};\n\t\t\t\t} break;\n\t\t\t\t\n\t\t\t\tdefault: {\n\t\t\t\t} break;\n\t\t\t}\n\t\t} break;\n\t\t\n\t\tcase B_NODE_MONITOR: {\n\t\t\tint32 opcode = 0;\n\t\n\t\t\t\/\/ Malformed message, skip\n\t\t\tif (msg->FindInt32(\"opcode\", &opcode) != B_OK) {\n\t\t\t\treturn;\n\t\t\t};\n\n\t\t\tContactHandle handle;\n\t\t\tContactHandle from;\n\t\t\tContactHandle to;\n\t\t\tconst char *name = NULL;\n\t\n\t\t\tswitch (opcode) {\n\t\t\t\tcase B_ENTRY_CREATED: {\n\t\t\t\t\t\/\/ Add to contact list\n\t\t\t\t\tmsg->FindString(\"name\", &name );\n\t\t\t\t\thandle.entry.set_name(name);\n\t\t\t\t\tmsg->FindInt64(\"directory\", &handle.entry.directory);\n\t\t\t\t\tmsg->FindInt32(\"device\", &handle.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &handle.node);\n\n\t\t\t\t\tif (fContact->Contains(handle.entry) == false) {\t\t\t\t\t\n\t\t\t\t\t\tContactAdded(handle);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLOG(kAppName, liDebug, \"Got a B_ENTRY_CREATED for a Contact we already know about - possibly due to live query notification catching up with a call to CreateContact\");\n\t\t\t\t\t};\n\t\t\t\t} break;\n\t\t\t\tcase B_ENTRY_MOVED: {\n\t\t\t\t\t\/\/ Contact moved\n\t\t\t\t\tmsg->FindString(\"name\", &name );\n\t\t\t\t\tfrom.entry.set_name(name);\n\t\t\t\t\tto.entry.set_name(name);\n\t\t\t\t\tmsg->FindInt64(\"from directory\", &from.entry.directory);\n\t\t\t\t\tmsg->FindInt64(\"to directory\", &to.entry.directory);\n\t\t\t\t\tmsg->FindInt32(\"device\", &from.entry.device);\n\t\t\t\t\tmsg->FindInt32(\"device\", &to.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &from.node);\n\t\t\t\t\tmsg->FindInt64(\"node\", &to.node);\n\t\t\t\t\t\n\t\t\t\t\tContactMoved(from, to);\n\t\t\t\t} break;\n\t\t\t\tcase B_ATTR_CHANGED: {\n\t\t\t\t\t\/\/ Add to contact list\n\t\t\t\t\tmsg->FindInt32(\"device\", &handle.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &handle.node);\n\t\t\t\t\t\t\n\t\t\t\t\tContactCachedConnections *cached = NULL;\n\t\t\t\t\tif (fContact->FindFirst(new ContactHandleSpecification(handle), &cached) == true) {\n\t\t\t\t\t\tContactModified(cached->Handle());\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLOG(kAppName, liDebug, \"Got a B_ATTR_CHANGED request for a Contact we cannot match\");\n\t\t\t\t\t};\n\t\t\t\t} break;\n\t\t\t\t\n\t\t\t\tcase B_ENTRY_REMOVED: {\n\t\t\t\t\t\/\/ Remove from contact list\n\t\t\t\t\tmsg->FindInt64(\"directory\", &handle.entry.directory);\n\t\t\t\t\tmsg->FindInt32(\"device\", &handle.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &handle.node);\n\n\t\t\t\t\tContactCachedConnections *cached = NULL;\n\t\t\t\t\tif (fContact->FindFirst(new ContactHandleSpecification(handle), &cached) == true) {\n\t\t\t\t\t\tContactRemoved(handle);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLOG(kAppName, liDebug, \"Got a B_ENTRY_REMOVED request for a Contact we cannot match\");\n\t\t\t\t\t};\n\t\t\t\t} break;\n\t\t\t}\n\t\t} break;\n\t\n\t\tdefault: {\n\t\t\tBLooper::MessageReceived(msg);\n\t\t} break;\n\t};\n};\n\n\/\/#pragma mark SpecificationFinder<Contact *> Hooks\n\nbool ContactManager::FindFirst(ContactSpecification *spec, ContactCachedConnections **firstMatch, bool canDelete = true) {\n\treturn fContact->FindFirst(spec, firstMatch, canDelete);\n};\n\nGenericListStore<ContactCachedConnections *> ContactManager::FindAll(ContactSpecification *spec, bool canDelete = true) {\n\treturn fContact->FindAll(spec, canDelete);\n};\n\n\/\/#pragma mark Public\n\nstatus_t ContactManager::Init(void) {\n\tBMessage msg;\n\tContactHandle handle;\n\tBVolumeRoster vroster;\n\tBVolume vol;\n\tchar volName[B_FILE_NAME_LENGTH];\n\t\n\tvroster.Rewind();\n\t\t\n\t\/\/ Query for all contacts on all drives\n\twhile (vroster.GetNextVolume(&vol) == B_OK) {\n\t\tif ((vol.InitCheck() != B_OK) || (vol.KnowsQuery() != true)) {\n\t\t\tcontinue;\n\t\t};\n\t\t\n\t\tvol.GetName(volName);\n\t\tLOG(kAppName, liLow, \"ContactManager::Init(): Getting contacts on %s\", volName);\n\t\t\n\t\tBQuery *query = new BQuery();\n\t\tquery->SetTarget(BMessenger(this));\n\t\tquery->SetPredicate(\"IM:connections=*\");\n\t\tquery->SetVolume(&vol);\n\t\tquery->Fetch();\n\t\t\n\t\tfQuery->Add(query);\n\t\t\n\t\twhile (query->GetNextRef(&handle.entry) == B_OK) {\n\t\t\tnode_ref nref;\n\t\t\t\n\t\t\tBNode node(&handle.entry);\n\t\t\tif (node.GetNodeRef(&nref) == B_OK) {\n\t\t\t\thandle.node = nref.node;\t\t\n\t\t\t\tContactAdded(handle);\n\t\t\t};\n\t\t};\n\t};\n\n\treturn B_OK;\n};\n\n\/**\n\tCreate a new People file with a unique name on the form \"Unknown contact X\"\n\tand add the specified connection to it\n\t\n\t@param connection The Connection object of the new contact\n\t@param namebase The name to save the file as (will be appended with an integer if it already exists)\n*\/\n\nContactCachedConnections *ContactManager::CreateContact(Connection connection, const char *namebase) {\n\tContactCachedConnections *result = NULL;\n\t\n\tBAutolock lock(fContact->GetLock());\n\tif (lock.IsLocked() == false) {\n\t\tLOG(kAppName, liHigh,\n\t\t\t\"ContactManager::CreateContact: Unable to acquire storage lock\");\n\t\treturn result;\n\t};\n\n\tif (fContact->FindFirstNoLock(new ConnectionContactSpecification(connection), &result) == true) {\n\t\tLOG(kAppName, liHigh,\n\t\t\t\"CreateContact for a connection that already exists - returning existing item\");\n\t\tLOG(kAppName, liHigh, \"    %s\", result->EntryRef().name);\n\t\treturn result;\n\t};\n\n\tBPath path;\n\n\tif (find_directory(B_USER_DIRECTORY, &path, true, NULL) != B_OK) {\n\t\tLOG(kAppName, liHigh, \"Unable to find B_USER_DIRECTORY\");\n\t\treturn result;\n\t};\n\n\tpath.Append(\"people\");\n\n\t\/\/ make sure that the target directory exists before we try to create new files\n\tcreate_directory(path.Path(), 0777);\n\n\tBDirectory dir(path.Path());\n\tBFile file;\n\tBEntry entry;\n\tchar filename[512];\n\n\t\/\/ Make sure we have a decent namebase\n\tif ((namebase == NULL) || (strlen(namebase) == 0)) {\n\t\tnamebase = \"Unknown contact\";\n\t};\n\n\tstrcpy(filename, namebase);\n\n\t\/\/ Attempt to create the contact\n\tdir.CreateFile(filename, &file, true);\n\n\tfor (int i = 1; file.InitCheck() != B_OK; i++) {\n\t\tsprintf(filename, \"%s %d\", namebase, i);\n\t\t\n\t\tdir.CreateFile(filename, &file, true);\n\t};\n\n\tif (dir.FindEntry(filename,&entry) != B_OK) {\n\t\tLOG(kAppName, liHigh,\n\t\t\t\"Error: While creating a new contact, dir.FindEntry() failed. filename was [%s]\",\n\t\t\tfilename);\n\t\treturn result;\n\t};\n\n\t\/\/ File created - set the type\n\tif (file.WriteAttr(\"BEOS:TYPE\", B_MIME_STRING_TYPE, 0, kContactMIMEType, strlen(kContactMIMEType)) != strlen(kContactMIMEType)) {\n\t\t\/\/ Error writing type\n\t\tentry.Remove();\n\t\t\n\t\tLOG(kAppName, liHigh, \"ERROR: Unable to write MIME type for newly created contact\");\n\t\treturn result;\n\t};\n\n\t\/\/ File created. set type and add connection\n\tresult = new ContactCachedConnections(entry);\n\tif (result->AddConnection(connection.String()) != B_OK) {\n\t\tdelete result;\n\t\tresult = NULL;\n\t\t\n\t\treturn result;\n\t};\n\n\tif (result->SetStatus(OFFLINE_TEXT) != B_OK) {\n\t\tdelete result;\n\n\t\tresult = NULL;\n\t\treturn result;\n\t};\n\n\t\/\/ Ensure the cached contacts are up to date\n\tresult->ReloadConnections();\n\n\tfContact->Add(result->EntryRef(), result);\n\n\treturn result;\n};\n\n\/\/#pragma mark Private\n\nvoid ContactManager::ContactAdded(ContactHandle handle) {\n\t\/\/ Check if the Contact already exists\n\tif (fContact->Contains(handle.entry) == true) {\n\t\treturn;\n\t};\n\n\t\/\/ Set up node monitoring\n\tnode_ref nref;\n\tnref.device = handle.entry.device;\n\tnref.node = handle.node;\n\twatch_node(&nref, B_WATCH_ALL, BMessenger(this));\n\n\t\/\/ Save the Contact\n\tContactCachedConnections *contact = new ContactCachedConnections(handle.entry);\n\tcontact->ReloadConnections();\n\tfContact->Add(handle.entry, contact);\n\t\n\t\/\/ Notify the listener\n\tfContactListener->ContactAdded(contact);\n};\n\nvoid ContactManager::ContactModified(ContactHandle handle) {\n\tContactCachedConnections *contact = NULL;\n\n\tif (fContact->FindFirst(new ContactHandleSpecification(handle), &contact) == true) {\n\t\tConnectionStore *temp = contact->CachedConnections();\n\t\t\/\/ Copy the previous connections\n\t\tConnectionStore prevCons;\n\t\tfor (ConnectionStore::Iterator it = temp->Start(); it != temp->End(); it++) {\n\t\t\tConnection con = (*it);\n\t\t\tprevCons.Add(con);\n\t\t};\n\n\t\ttemp = NULL;\n\t\tcontact->ReloadConnections();\n\t\tConnectionStore *newCons = contact->CachedConnections();\n\n\t\t\/\/ Notify the listener\n\t\tfContactListener->ContactModified(contact, &prevCons, newCons);\n\t} else {\n\t\tLOG(kAppName, liHigh, \"ContactManager::ContactModified: %s is an unknown contact\", handle.entry.name);\n\t};\n};\n\nvoid ContactManager::ContactMoved(ContactHandle from, ContactHandle to) {\n\/\/\tfor ( list< pair<ContactHandle, list<string>* > >::iterator i = fContacts.begin(); i != fContacts.end(); i++ )\n\/\/\t{\n\/\/\t\tif ( (*i).first == from )\n\/\/\t\t{\n\/\/\t\t\t(*i).first = to;\n\/\/\t\t\treturn;\n\/\/\t\t}\n\/\/\t}\n};\n\nvoid ContactManager::ContactRemoved(ContactHandle handle) {\n\t\/\/ Stop node monitoring\n\tnode_ref nref;\n\tnref.device = handle.entry.device;\n\tnref.node = handle.node;\t\n\twatch_node(&nref, B_STOP_WATCHING, BMessenger(this));\n\n\tContactCachedConnections *contact = NULL;\n\tif (fContact->FindFirst(new ContactHandleSpecification(handle), &contact) == true) {\n\t\tConnectionStore *prevCons = contact->CachedConnections();\n\t\n\t\t\/\/ Notify the listener\n\t\tfContactListener->ContactRemoved(contact, prevCons);\n\t\n\t\t\/\/ Remove the Contact\n\t\tif (fContact->Contains(handle.entry) == true) {\n\t\t\tfContact->Remove(handle.entry);\n\t\t};\n\t} else {\n\t\tLOG(kAppName, liHigh, \"ContactManager::ContactRemoved: %s is an unknown contact\", handle.entry.name);\n\t};\n};\n<commit_msg>Moving constants on top of the file.<commit_after>#include \"ContactManager.h\"\n\n#include <storage\/Directory.h>\n#include <storage\/Entry.h>\n#include <storage\/FindDirectory.h>\n#include <storage\/NodeMonitor.h>\n#include <storage\/Query.h>\n#include <storage\/VolumeRoster.h>\n#include <support\/Autolock.h>\n#include <support\/Locker.h>\n\n#include <libim\/Constants.h>\n#include <libim\/Contact.h>\n#include <libim\/Helpers.h>\n\n#include \"ContactCachedConnections.h\"\n#include \"ContactListener.h\"\n#include \"common\/SpecificationFinder.h\"\n\n\/\/#pragma mark Definitions\n\n\/\/#pragma mark Constants\n\nconst char *kContactMIMEType = \"application\/x-person\";\nextern char *kAppName;\n\nusing namespace IM;\n\nclass QueryStore : public GenericListStore<BQuery *> {\n};\n\nclass ContactStore : public GenericMapStore<entry_ref, ContactCachedConnections *>,  public SpecificationFinder<ContactCachedConnections *> {\n\tpublic:\n\t\tContactStore(void)\n\t\t\t: GenericMapStore<entry_ref, ContactCachedConnections *>(),\n\t\t\tfLock(new BLocker()) {\n\t\t};\n\t\t\n\t\tvirtual ~ContactStore(void) {\n\t\t\tdelete fLock;\n\t\t};\n\n\t\tvirtual bool FindFirstNoLock(ContactSpecification *specification, ContactCachedConnections **firstMatch, bool deleteSpec = true) {\n\t\t\tbool result = false;\n\t\t\tGenericMapStore<entry_ref, ContactCachedConnections *>::Iterator it;\n\n\t\t\tfor (it = Start(); it != End(); it++) {\n\t\t\t\tContactCachedConnections *current = it->second;\n\t\t\t\t\n\t\t\t\tif (specification->IsSatisfiedBy(current) == true) {\n\t\t\t\t\t*firstMatch = current;\n\t\t\t\t\tresult = true;\n\t\t\t\t\tbreak;\n\t\t\t\t};\n\t\t\t};\n\n\t\t\tif (deleteSpec == true) {\n\t\t\t\tdelete specification;\n\t\t\t};\n\n\t\t\treturn result;\n\t\t};\n\t\t\n\t\tvirtual bool FindFirst(ContactSpecification *specification, ContactCachedConnections **firstMatch, bool deleteSpec = true) {\n\t\t\tBAutolock lock(fLock);\n\t\t\tbool result = false;\n\t\t\t\n\t\t\tif (lock.IsLocked() == true) {\n\t\t\t\tresult = FindFirstNoLock(specification, firstMatch, deleteSpec);\n\t\t\t};\n\t\t\t\n\t\t\t\n\t\t\treturn result;\n\t\t};\n\n\t\tvirtual GenericListStore<ContactCachedConnections *> FindAll(ContactSpecification *specification, bool deleteSpec = true) {\n\t\t\tGenericListStore<ContactCachedConnections *> contacts(false);\n\t\t\tBAutolock lock(fLock);\n\t\t\t\n\t\t\tif (lock.IsLocked() == true) {\n\t\t\t\tGenericMapStore<entry_ref, ContactCachedConnections *>::Iterator it;\n\t\t\t\tfor (it = Start(); it != End(); it++) {\n\t\t\t\t\tContactCachedConnections *current = it->second;\n\t\t\t\t\t\n\t\t\t\t\tif (specification->IsSatisfiedBy(current) == true) {\n\t\t\t\t\t\tcontacts.Add(current);\n\t\t\t\t\t};\n\t\t\t\t};\n\t\t\t};\n\t\t\t\n\t\t\tif (deleteSpec == true) {\n\t\t\t\tdelete specification;\n\t\t\t};\n\t\t\t\n\t\t\treturn contacts;\n\t\t};\n\t\n\t\tBLocker *GetLock(void) const {\n\t\t\treturn fLock;\n\t\t};\n\tprivate:\n\t\tBLocker\t*fLock;\n};\n\n\/\/#pragma mark Constructor\n\nContactManager::ContactManager(ContactListener *listener)\n\t: BLooper(\"ContactManager\", B_LOW_PRIORITY),\n\tfContactListener(listener),\n\tfContact(new ContactStore()), \n\tfQuery(new QueryStore()) {\n\t\n\tRun();\n};\n\nContactManager::~ContactManager(void) {\n\tdelete fQuery;\n};\n\n\/\/#pragma mark BLooper Hooks\n\nvoid ContactManager::MessageReceived(BMessage *msg) {\n\tswitch (msg->what) {\n\t\t\/\/ Contact messages. Both query and node monitor.\n\t\tcase B_QUERY_UPDATE: {\n\t\t\tint32 opcode = B_ERROR;\n\t\t\t\n\t\t\tif (msg->FindInt32(\"opcode\", &opcode) != B_OK) {\n\t\t\t\treturn;\n\t\t\t};\n\t\t\t\n\t\t\tContactHandle handle;\n\t\t\tconst char *name = NULL;\n\t\t\t\n\t\t\tswitch (opcode) {\n\t\t\t\tcase B_ENTRY_CREATED: {\n\t\t\t\t\t\/\/ Add to contact list\n\t\t\t\t\tmsg->FindString(\"name\", &name );\n\t\t\t\t\thandle.entry.set_name(name);\n\t\t\t\t\tmsg->FindInt64(\"directory\", &handle.entry.directory);\n\t\t\t\t\tmsg->FindInt32(\"device\", &handle.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &handle.node);\n\t\t\t\t\t\n\t\t\t\t\tif (fContact->Contains(handle.entry) == false) {\n\t\t\t\t\t\tContactAdded(handle);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLOG(kAppName, liDebug, \"Got a B_ENTRY_CREATED for a Contact we already know about - possibly due to live query notification catching up with a call to CreateContact\");\n\t\t\t\t\t};\n\t\t\t\t} break;\n\t\t\t\t\n\t\t\t\tdefault: {\n\t\t\t\t} break;\n\t\t\t}\n\t\t} break;\n\t\t\n\t\tcase B_NODE_MONITOR: {\n\t\t\tint32 opcode = 0;\n\t\n\t\t\t\/\/ Malformed message, skip\n\t\t\tif (msg->FindInt32(\"opcode\", &opcode) != B_OK) {\n\t\t\t\treturn;\n\t\t\t};\n\n\t\t\tContactHandle handle;\n\t\t\tContactHandle from;\n\t\t\tContactHandle to;\n\t\t\tconst char *name = NULL;\n\t\n\t\t\tswitch (opcode) {\n\t\t\t\tcase B_ENTRY_CREATED: {\n\t\t\t\t\t\/\/ Add to contact list\n\t\t\t\t\tmsg->FindString(\"name\", &name );\n\t\t\t\t\thandle.entry.set_name(name);\n\t\t\t\t\tmsg->FindInt64(\"directory\", &handle.entry.directory);\n\t\t\t\t\tmsg->FindInt32(\"device\", &handle.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &handle.node);\n\n\t\t\t\t\tif (fContact->Contains(handle.entry) == false) {\t\t\t\t\t\n\t\t\t\t\t\tContactAdded(handle);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLOG(kAppName, liDebug, \"Got a B_ENTRY_CREATED for a Contact we already know about - possibly due to live query notification catching up with a call to CreateContact\");\n\t\t\t\t\t};\n\t\t\t\t} break;\n\t\t\t\tcase B_ENTRY_MOVED: {\n\t\t\t\t\t\/\/ Contact moved\n\t\t\t\t\tmsg->FindString(\"name\", &name );\n\t\t\t\t\tfrom.entry.set_name(name);\n\t\t\t\t\tto.entry.set_name(name);\n\t\t\t\t\tmsg->FindInt64(\"from directory\", &from.entry.directory);\n\t\t\t\t\tmsg->FindInt64(\"to directory\", &to.entry.directory);\n\t\t\t\t\tmsg->FindInt32(\"device\", &from.entry.device);\n\t\t\t\t\tmsg->FindInt32(\"device\", &to.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &from.node);\n\t\t\t\t\tmsg->FindInt64(\"node\", &to.node);\n\t\t\t\t\t\n\t\t\t\t\tContactMoved(from, to);\n\t\t\t\t} break;\n\t\t\t\tcase B_ATTR_CHANGED: {\n\t\t\t\t\t\/\/ Add to contact list\n\t\t\t\t\tmsg->FindInt32(\"device\", &handle.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &handle.node);\n\t\t\t\t\t\t\n\t\t\t\t\tContactCachedConnections *cached = NULL;\n\t\t\t\t\tif (fContact->FindFirst(new ContactHandleSpecification(handle), &cached) == true) {\n\t\t\t\t\t\tContactModified(cached->Handle());\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLOG(kAppName, liDebug, \"Got a B_ATTR_CHANGED request for a Contact we cannot match\");\n\t\t\t\t\t};\n\t\t\t\t} break;\n\t\t\t\t\n\t\t\t\tcase B_ENTRY_REMOVED: {\n\t\t\t\t\t\/\/ Remove from contact list\n\t\t\t\t\tmsg->FindInt64(\"directory\", &handle.entry.directory);\n\t\t\t\t\tmsg->FindInt32(\"device\", &handle.entry.device);\n\t\t\t\t\tmsg->FindInt64(\"node\", &handle.node);\n\n\t\t\t\t\tContactCachedConnections *cached = NULL;\n\t\t\t\t\tif (fContact->FindFirst(new ContactHandleSpecification(handle), &cached) == true) {\n\t\t\t\t\t\tContactRemoved(handle);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLOG(kAppName, liDebug, \"Got a B_ENTRY_REMOVED request for a Contact we cannot match\");\n\t\t\t\t\t};\n\t\t\t\t} break;\n\t\t\t}\n\t\t} break;\n\t\n\t\tdefault: {\n\t\t\tBLooper::MessageReceived(msg);\n\t\t} break;\n\t};\n};\n\n\/\/#pragma mark SpecificationFinder<Contact *> Hooks\n\nbool ContactManager::FindFirst(ContactSpecification *spec, ContactCachedConnections **firstMatch, bool canDelete = true) {\n\treturn fContact->FindFirst(spec, firstMatch, canDelete);\n};\n\nGenericListStore<ContactCachedConnections *> ContactManager::FindAll(ContactSpecification *spec, bool canDelete = true) {\n\treturn fContact->FindAll(spec, canDelete);\n};\n\n\/\/#pragma mark Public\n\nstatus_t ContactManager::Init(void) {\n\tBMessage msg;\n\tContactHandle handle;\n\tBVolumeRoster vroster;\n\tBVolume vol;\n\tchar volName[B_FILE_NAME_LENGTH];\n\t\n\tvroster.Rewind();\n\t\t\n\t\/\/ Query for all contacts on all drives\n\twhile (vroster.GetNextVolume(&vol) == B_OK) {\n\t\tif ((vol.InitCheck() != B_OK) || (vol.KnowsQuery() != true)) {\n\t\t\tcontinue;\n\t\t};\n\t\t\n\t\tvol.GetName(volName);\n\t\tLOG(kAppName, liLow, \"ContactManager::Init(): Getting contacts on %s\", volName);\n\t\t\n\t\tBQuery *query = new BQuery();\n\t\tquery->SetTarget(BMessenger(this));\n\t\tquery->SetPredicate(\"IM:connections=*\");\n\t\tquery->SetVolume(&vol);\n\t\tquery->Fetch();\n\t\t\n\t\tfQuery->Add(query);\n\t\t\n\t\twhile (query->GetNextRef(&handle.entry) == B_OK) {\n\t\t\tnode_ref nref;\n\t\t\t\n\t\t\tBNode node(&handle.entry);\n\t\t\tif (node.GetNodeRef(&nref) == B_OK) {\n\t\t\t\thandle.node = nref.node;\t\t\n\t\t\t\tContactAdded(handle);\n\t\t\t};\n\t\t};\n\t};\n\n\treturn B_OK;\n};\n\n\/**\n\tCreate a new People file with a unique name on the form \"Unknown contact X\"\n\tand add the specified connection to it\n\t\n\t@param connection The Connection object of the new contact\n\t@param namebase The name to save the file as (will be appended with an integer if it already exists)\n*\/\n\nContactCachedConnections *ContactManager::CreateContact(Connection connection, const char *namebase) {\n\tContactCachedConnections *result = NULL;\n\n\tBAutolock lock(fContact->GetLock());\n\tif (lock.IsLocked() == false) {\n\t\tLOG(kAppName, liHigh,\n\t\t\t\"ContactManager::CreateContact: Unable to acquire storage lock\");\n\t\treturn result;\n\t};\n\n\tif (fContact->FindFirstNoLock(new ConnectionContactSpecification(connection), &result) == true) {\n\t\tLOG(kAppName, liHigh,\n\t\t\t\"CreateContact for a connection that already exists - returning existing item\");\n\t\tLOG(kAppName, liHigh, \"    %s\", result->EntryRef().name);\n\t\treturn result;\n\t};\n\n\tBPath path;\n\n\tif (find_directory(B_USER_DIRECTORY, &path, true, NULL) != B_OK) {\n\t\tLOG(kAppName, liHigh, \"Unable to find B_USER_DIRECTORY\");\n\t\treturn result;\n\t};\n\n\tpath.Append(\"people\");\n\n\t\/\/ make sure that the target directory exists before we try to create new files\n\tcreate_directory(path.Path(), 0777);\n\n\tBDirectory dir(path.Path());\n\tBFile file;\n\tBEntry entry;\n\tchar filename[512];\n\n\t\/\/ Make sure we have a decent namebase\n\tif ((namebase == NULL) || (strlen(namebase) == 0)) {\n\t\tnamebase = \"Unknown contact\";\n\t};\n\n\tstrcpy(filename, namebase);\n\n\t\/\/ Attempt to create the contact\n\tdir.CreateFile(filename, &file, true);\n\n\tfor (int i = 1; file.InitCheck() != B_OK; i++) {\n\t\tsprintf(filename, \"%s %d\", namebase, i);\n\t\t\n\t\tdir.CreateFile(filename, &file, true);\n\t};\n\n\tif (dir.FindEntry(filename,&entry) != B_OK) {\n\t\tLOG(kAppName, liHigh,\n\t\t\t\"Error: While creating a new contact, dir.FindEntry() failed. filename was [%s]\",\n\t\t\tfilename);\n\t\treturn result;\n\t};\n\n\t\/\/ File created - set the type\n\tif (file.WriteAttr(\"BEOS:TYPE\", B_MIME_STRING_TYPE, 0, kContactMIMEType, strlen(kContactMIMEType)) != strlen(kContactMIMEType)) {\n\t\t\/\/ Error writing type\n\t\tentry.Remove();\n\t\t\n\t\tLOG(kAppName, liHigh, \"ERROR: Unable to write MIME type for newly created contact\");\n\t\treturn result;\n\t};\n\n\t\/\/ File created. set type and add connection\n\tresult = new ContactCachedConnections(entry);\n\tif (result->AddConnection(connection.String()) != B_OK) {\n\t\tdelete result;\n\t\tresult = NULL;\n\t\t\n\t\treturn result;\n\t};\n\n\tif (result->SetStatus(OFFLINE_TEXT) != B_OK) {\n\t\tdelete result;\n\n\t\tresult = NULL;\n\t\treturn result;\n\t};\n\n\t\/\/ Ensure the cached contacts are up to date\n\tresult->ReloadConnections();\n\n\tfContact->Add(result->EntryRef(), result);\n\n\treturn result;\n};\n\n\/\/#pragma mark Private\n\nvoid ContactManager::ContactAdded(ContactHandle handle) {\n\t\/\/ Check if the Contact already exists\n\tif (fContact->Contains(handle.entry) == true) {\n\t\treturn;\n\t};\n\n\t\/\/ Set up node monitoring\n\tnode_ref nref;\n\tnref.device = handle.entry.device;\n\tnref.node = handle.node;\n\twatch_node(&nref, B_WATCH_ALL, BMessenger(this));\n\n\t\/\/ Save the Contact\n\tContactCachedConnections *contact = new ContactCachedConnections(handle.entry);\n\tcontact->ReloadConnections();\n\tfContact->Add(handle.entry, contact);\n\t\n\t\/\/ Notify the listener\n\tfContactListener->ContactAdded(contact);\n};\n\nvoid ContactManager::ContactModified(ContactHandle handle) {\n\tContactCachedConnections *contact = NULL;\n\n\tif (fContact->FindFirst(new ContactHandleSpecification(handle), &contact) == true) {\n\t\tConnectionStore *temp = contact->CachedConnections();\n\t\t\/\/ Copy the previous connections\n\t\tConnectionStore prevCons;\n\t\tfor (ConnectionStore::Iterator it = temp->Start(); it != temp->End(); it++) {\n\t\t\tConnection con = (*it);\n\t\t\tprevCons.Add(con);\n\t\t};\n\n\t\ttemp = NULL;\n\t\tcontact->ReloadConnections();\n\t\tConnectionStore *newCons = contact->CachedConnections();\n\n\t\t\/\/ Notify the listener\n\t\tfContactListener->ContactModified(contact, &prevCons, newCons);\n\t} else {\n\t\tLOG(kAppName, liHigh, \"ContactManager::ContactModified: %s is an unknown contact\", handle.entry.name);\n\t};\n};\n\nvoid ContactManager::ContactMoved(ContactHandle from, ContactHandle to) {\n\/\/\tfor ( list< pair<ContactHandle, list<string>* > >::iterator i = fContacts.begin(); i != fContacts.end(); i++ )\n\/\/\t{\n\/\/\t\tif ( (*i).first == from )\n\/\/\t\t{\n\/\/\t\t\t(*i).first = to;\n\/\/\t\t\treturn;\n\/\/\t\t}\n\/\/\t}\n};\n\nvoid ContactManager::ContactRemoved(ContactHandle handle) {\n\t\/\/ Stop node monitoring\n\tnode_ref nref;\n\tnref.device = handle.entry.device;\n\tnref.node = handle.node;\t\n\twatch_node(&nref, B_STOP_WATCHING, BMessenger(this));\n\n\tContactCachedConnections *contact = NULL;\n\tif (fContact->FindFirst(new ContactHandleSpecification(handle), &contact) == true) {\n\t\tConnectionStore *prevCons = contact->CachedConnections();\n\t\n\t\t\/\/ Notify the listener\n\t\tfContactListener->ContactRemoved(contact, prevCons);\n\t\n\t\t\/\/ Remove the Contact\n\t\tif (fContact->Contains(handle.entry) == true) {\n\t\t\tfContact->Remove(handle.entry);\n\t\t};\n\t} else {\n\t\tLOG(kAppName, liHigh, \"ContactManager::ContactRemoved: %s is an unknown contact\", handle.entry.name);\n\t};\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 \"..\/Interface\/Database.h\"\r\n#include \"..\/Interface\/Server.h\"\r\n#include \"..\/Interface\/File.h\"\r\n#include \"..\/Interface\/DatabaseCursor.h\"\r\n#include \"database.h\"\r\n#include \"..\/stringtools.h\"\r\n#include <iostream>\r\n#include <fstream>\r\n#include \"..\/urbackupcommon\/sha2\/sha2.h\"\r\n#include \"..\/urbackupcommon\/os_functions.h\"\r\n#include <memory.h>\r\n#include <memory>\r\n#include \"dao\/ServerFilesDao.h\"\r\n#include \"FileIndex.h\"\r\n#include \"create_files_index.h\"\r\n#include \"server_hash.h\"\r\n#include \"serverinterface\/helper.h\"\r\n\r\nconst _u32 c_read_blocksize=4096;\r\nconst size_t draw_segments=30;\r\nconst size_t c_speed_size=15;\r\nconst size_t c_max_l_length=80;\r\n\r\nvoid draw_progress(std::string curr_fn, _i64 curr_verified, _i64 verify_size)\r\n{\r\n\tstatic _i64 last_progress_bytes=0;\r\n\tstatic int64 last_time=0;\r\n\tstatic size_t max_line_length=0;\r\n\r\n\tint64 passed_time=Server->getTimeMS()-last_time;\r\n\tif(passed_time>1000)\r\n\t{\r\n\t\t_i64 new_bytes=curr_verified-last_progress_bytes;\r\n\r\n\t\tfloat pc_done=(float)curr_verified\/(float)verify_size;\r\n\r\n\t\tsize_t segments=(size_t)(pc_done*draw_segments);\r\n\r\n\t\tstd::string toc=\"\\r[\";\r\n\t\tfor(size_t i=0;i<draw_segments;++i)\r\n\t\t{\r\n\t\t\tif(i<segments)\r\n\t\t\t{\r\n\t\t\t\ttoc+=\"=\";\r\n\t\t\t}\r\n\t\t\telse if(i==segments)\r\n\t\t\t{\r\n\t\t\t\ttoc+=\">\";\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttoc+=\" \";\r\n\t\t\t}\r\n\t\t}\r\n\t\tstd::string speed_str=PrettyPrintSpeed((size_t)((new_bytes*1000)\/passed_time));\r\n\t\twhile(speed_str.size()<c_speed_size)\r\n\t\t\tspeed_str+=\" \";\r\n\t\tstd::string pcdone=convert((int)(pc_done*100.f));\r\n\t\tif(pcdone.size()==1)\r\n\t\t\tpcdone=\" \"+pcdone;\r\n\r\n\t\ttoc+=\"] \"+pcdone+\"% \"+speed_str+\" \"+(curr_fn);\r\n\t\t\r\n\t\tif(toc.size()>=c_max_l_length)\r\n\t\t    toc=toc.substr(0, c_max_l_length);\r\n\t\t\r\n\t\tif(toc.size()>max_line_length)\r\n\t\t    max_line_length=toc.size();\r\n\t\t    \r\n\t\twhile(toc.size()<max_line_length)\r\n\t\t    toc+=\" \";\r\n\r\n\t\tstd::cout << toc;\r\n\t\tstd::cout.flush();\r\n\r\n\t\tlast_progress_bytes=curr_verified;\r\n\t\tlast_time=Server->getTimeMS();\r\n\t}\r\n}\r\n\r\nbool verify_file(db_single_result &res, _i64 &curr_verified, _i64 verify_size, bool& missing)\r\n{\r\n\tstd::string fp=res[\"fullpath\"];\r\n\tIFile *f=Server->openFile(os_file_prefix(fp), MODE_READ);\r\n\tif( f==NULL )\r\n\t{\r\n\t\tServer->Log(\"Error opening file \\\"\"+fp+\"\\\"\", LL_ERROR);\r\n\t\tmissing = true;\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif(watoi64(res[\"filesize\"])!=f->Size())\r\n\t{\r\n\t\tServer->Log(\"Filesize of \\\"\"+fp+\"\\\" is wrong\", LL_ERROR);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tstd::string f_name=ExtractFileName(fp);\r\n\r\n\tsha_def_ctx shactx;\r\n\tsha_def_init(&shactx);\r\n\r\n\t_u32 r;\r\n\tchar buf[c_read_blocksize];\r\n\tint64 curr_verified_start=curr_verified;\r\n\tdo\r\n\t{\r\n\t\tr=f->Read(buf, c_read_blocksize);\r\n\t\tif(r>0)\r\n\t\t{\r\n\t\t\tsha_def_update(&shactx, (unsigned char*) buf, r);\r\n\t\t}\r\n\t\tcurr_verified+=r;\r\n\r\n\t\tdraw_progress(f_name, curr_verified, verify_size);\r\n\t}\r\n\twhile(r>0);\r\n\t\r\n\tServer->destroy(f);\r\n\r\n\tif(curr_verified-curr_verified_start!=watoi64(res[\"filesize\"]))\r\n\t{\r\n\t\tServer->Log(\"Could not read all bytes of file \\\"\"+fp+\"\\\"\", LL_ERROR);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tconst unsigned char * db_sha=(unsigned char*)res[\"shahash\"].c_str();\r\n\tunsigned char calc_dig[SHA_DEF_DIGEST_SIZE];\r\n\tsha_def_final(&shactx, calc_dig);\r\n\r\n\tif(memcmp(db_sha, calc_dig, SHA_DEF_DIGEST_SIZE)!=0)\r\n\t{\r\n\t\tServer->Log(\"Hash of \\\"\"+fp+\"\\\" is wrong\", LL_ERROR);\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool verify_hashes(std::string arg)\r\n{\r\n\tIDatabase *db=Server->getDatabase(Server->getThreadID(), URBACKUPDB_SERVER);\r\n\r\n\tstd::string working_dir=(Server->getServerWorkingDir());\r\n\tstd::string v_output_fn=working_dir+os_file_sep()+\"urbackup\"+os_file_sep()+\"verification_result.txt\";\r\n\tstd::fstream v_failure;\r\n\tv_failure.open(v_output_fn.c_str(), std::ios::out|std::ios::binary);\r\n\tif( !v_failure.is_open() )\r\n\t\tServer->Log(\"Could not open \\\"\"+v_output_fn+\"\\\" for writing\", LL_ERROR);\r\n\telse\r\n\t\tServer->Log(\"Writing verification results to \\\"\"+v_output_fn+\"\\\"\", LL_INFO);\r\n\r\n\tstd::string clientname;\r\n\tstd::string backupname;\r\n\r\n\tif(arg!=\"true\")\r\n\t{\r\n\t\tif(arg.find(\"\/\")==std::string::npos)\r\n\t\t{\r\n\t\t\tclientname=arg;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tclientname=getuntil(\"\/\", arg);\r\n\t\t\tbackupname=getafter(\"\/\", arg);\r\n\t\t\t\r\n\t\t}\r\n\t}\r\n\r\n\tbool delete_failed = Server->getServerParameter(\"delete_verify_failed\")==\"true\";\r\n\r\n\tint cid=0;\r\n\tint backupid=0;\r\n\tstd::string filter;\r\n\r\n\tif(!clientname.empty())\r\n\t{\r\n\t\tif(clientname!=\"*\")\r\n\t\t{\r\n\t\t\tIQuery *q=db->Prepare(\"SELECT id FROM clients WHERE name=?\");\r\n\t\t\tq->Bind(clientname);\r\n\t\t\tdb_results res=q->Read();\r\n\t\t\tif(!res.empty())\r\n\t\t\t{\r\n\t\t\t\tcid=watoi(res[0][\"id\"]);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Client \\\"\"+clientname+\"\\\" not found\", LL_ERROR);\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tfilter=\" WHERE clientid=\"+convert(cid);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tfilter+=\" WHERE 1=1\";\r\n\t\t}\r\n\t\t\r\n\r\n\t\tif(!backupname.empty())\r\n\t\t{\r\n\t\t\tstd::string backupid_filter;\r\n\t\t\tif(backupname==\"last\")\r\n\t\t\t{\r\n\t\t\t\tif(clientname!=\"*\")\r\n\t\t\t\t{\r\n\t\t\t\t\tIQuery* q=db->Prepare(\"SELECT id,path FROM backups WHERE clientid=? AND complete=1 ORDER BY backuptime DESC LIMIT 1\");\r\n\t\t\t\t\tq->Bind(cid);\r\n\t\t\t\t\tdb_results res=q->Read();\r\n\t\t\t\t\tif(!res.empty())\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tbackupid_filter=\"= \"+res[0][\"id\"];\r\n\t\t\t\t\t\tServer->Log(\"Last backup: \"+res[0][\"path\"], LL_INFO);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tServer->Log(\"Last backup not found\", LL_ERROR);\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tbackupid_filter=\" IN (SELECT id FROM backups b WHERE NOT EXISTS (SELECT id FROM backups c WHERE complete=1 AND c.backuptime > b.backuptime AND b.clientid=c.clientid))\";\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\telse if(backupname==\"*\")\r\n\t\t\t{\r\n\t\t\t\tbackupid_filter=\" IN (SELECT id FROM backups WHERE clientid=\"+convert(cid)+\")\";\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\t\t\r\n\t\t\t\tIQuery* q=db->Prepare(\"SELECT id FROM backups WHERE path=? AND clientid=?\");\r\n\t\t\t\tq->Bind(backupname);\r\n\t\t\t\tq->Bind(cid);\r\n\t\t\t\tdb_results res=q->Read();\r\n\t\t\t\tif(!res.empty())\r\n\t\t\t\t{\r\n\t\t\t\t\tbackupid_filter=\"= \"+res[0][\"id\"];\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Backup \\\"\"+backupname+\"\\\" not found\", LL_ERROR);\r\n\t\t\t\t\t\r\n\t\t\t\t\treturn false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif(backupname!=\"*\" || clientname!=\"*\")\r\n\t\t\t{\r\n\t\t\t\tfilter+=\" AND backupid \"+backupid_filter;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tstd::cout << \"Calculating filesize...\" << std::endl;\r\n\tIQuery *q_num_files=db->Prepare(\"SELECT SUM(filesize) AS c FROM files\"+filter);\r\n\tdb_results res=q_num_files->Read();\r\n\tif(res.empty())\r\n\t{\r\n\t\tServer->Log(\"Error during filesize calculation.\", LL_ERROR);\r\n\t\treturn false;\r\n\t}\r\n\r\n\t_i64 verify_size=watoi64(res[0][\"c\"]);\r\n\t_i64 curr_verified=0;\r\n\r\n\tstd::cout << \"To be verified: \" << PrettyPrintBytes(verify_size) << \" of files\" << std::endl;\r\n\r\n\t_i64 crowid=0;\r\n\r\n\tIQuery *q_get_files=db->Prepare(\"SELECT id, fullpath, shahash, filesize FROM files\"+filter, false);\r\n\r\n\tbool is_okay=true;\r\n\r\n\tIDatabaseCursor* cursor = q_get_files->Cursor();\r\n\r\n\tstd::vector<int64> todelete;\r\n\tstd::vector<int64> missing_files;\r\n\r\n\tdb_single_result res_single;\r\n\twhile(cursor->next(res_single))\r\n\t{\r\n\t\tbool is_missing=false;\r\n\t\tif(! verify_file( res_single, curr_verified, verify_size, is_missing) )\r\n\t\t{\r\n\t\t\tif(!is_missing)\r\n\t\t\t{\r\n\t\t\t\tv_failure << \"Verification of \\\"\" << (res_single[\"fullpath\"]) << \"\\\" failed\\r\\n\";\r\n\t\t\t\tis_okay=false;\r\n\r\n\t\t\t\tif(delete_failed)\r\n\t\t\t\t{\r\n\t\t\t\t\ttodelete.push_back(watoi64(res_single[\"id\"]));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tmissing_files.push_back(watoi64(res_single[\"id\"]));\r\n\t\t\t}\t\t\t\r\n\t\t}\r\n\t}\r\n\t\r\n\tif(v_failure.is_open() && is_okay)\r\n\t{\r\n\t\tv_failure.close();\r\n\t\tServer->deleteFile(v_output_fn);\r\n\t}\r\n\r\n\tdb->destroyQuery(q_get_files);\r\n\r\n\tIQuery* q_get_file = db->Prepare(\"SELECT id, fullpath, shahash, filesize FROM files WHERE id=?\");\r\n\r\n\tstd::cout << missing_files.size() << \" could not be opened during verification. Checking now if they have been deleted from the database...\" << std::endl;\r\n\r\n\tfor(size_t i=0;i<missing_files.size();++i)\r\n\t{\r\n\t\tq_get_file->Bind(missing_files[i]);\r\n\t\tdb_results res = q_get_file->Read();\r\n\t\tq_get_file->Reset();\r\n\t\t\r\n\t\tif(!res.empty())\r\n\t\t{\r\n\t\t\tbool is_missing=false;\r\n\t\t\tdb_single_result& res_single = res[0];\r\n\t\t\tif(!verify_file(res_single, curr_verified, verify_size, is_missing))\r\n\t\t\t{\r\n\t\t\t\tv_failure << \"Verification of file \\\"\" << (res_single[\"fullpath\"]) << \"\\\" failed (during rechecking previously missing files)\\r\\n\";\r\n\t\t\t\tis_okay=false;\r\n\r\n\t\t\t\tif(delete_failed)\r\n\t\t\t\t{\r\n\t\t\t\t\ttodelete.push_back(watoi64(res_single[\"id\"]));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tstd::cout << std::endl;\r\n\r\n\tif(delete_failed)\r\n\t{\r\n\t\tstd::cout << \"Deleting \" << todelete.size() << \" file entries with failed verification from database...\" << std::endl;\r\n\r\n\t\tSStartupStatus status;\r\n\t\tif(!create_files_index(status))\r\n\t\t{\r\n\t\t\tstd::cout << \"Error opening file index -1\" << std::endl;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tServerFilesDao backupdao(db);\r\n\t\t\tstd::auto_ptr<FileIndex> fileindex(create_lmdb_files_index());\r\n\r\n\t\t\tif(fileindex.get()==NULL)\r\n\t\t\t{\r\n\t\t\t\tstd::cout << \"Error opening file index -2\" << std::endl;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\r\n\t\t\t\tfor(size_t i=0;i<todelete.size();++i)\r\n\t\t\t\t{\r\n\t\t\t\t\tBackupServerHash::deleteFileSQL(backupdao, *fileindex, todelete[i]);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tstd::cout << \"done.\" << std::endl;\r\n\t\t\t}\r\n\t\t}\t\t\r\n\t}\r\n\t\r\n\r\n\treturn is_okay;\r\n}<commit_msg>Fixed verification via command line<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 \"..\/Interface\/Database.h\"\r\n#include \"..\/Interface\/Server.h\"\r\n#include \"..\/Interface\/File.h\"\r\n#include \"..\/Interface\/DatabaseCursor.h\"\r\n#include \"database.h\"\r\n#include \"..\/stringtools.h\"\r\n#include <iostream>\r\n#include <fstream>\r\n#include \"..\/urbackupcommon\/sha2\/sha2.h\"\r\n#include \"..\/urbackupcommon\/os_functions.h\"\r\n#include <memory.h>\r\n#include <memory>\r\n#include \"dao\/ServerFilesDao.h\"\r\n#include \"FileIndex.h\"\r\n#include \"create_files_index.h\"\r\n#include \"server_hash.h\"\r\n#include \"serverinterface\/helper.h\"\r\n\r\nconst _u32 c_read_blocksize=4096;\r\nconst size_t draw_segments=30;\r\nconst size_t c_speed_size=15;\r\nconst size_t c_max_l_length=80;\r\n\r\nvoid draw_progress(std::string curr_fn, _i64 curr_verified, _i64 verify_size)\r\n{\r\n\tstatic _i64 last_progress_bytes=0;\r\n\tstatic int64 last_time=0;\r\n\tstatic size_t max_line_length=0;\r\n\r\n\tint64 passed_time=Server->getTimeMS()-last_time;\r\n\tif(passed_time>1000)\r\n\t{\r\n\t\t_i64 new_bytes=curr_verified-last_progress_bytes;\r\n\r\n\t\tfloat pc_done=(float)curr_verified\/(float)verify_size;\r\n\r\n\t\tsize_t segments=(size_t)(pc_done*draw_segments);\r\n\r\n\t\tstd::string toc=\"\\r[\";\r\n\t\tfor(size_t i=0;i<draw_segments;++i)\r\n\t\t{\r\n\t\t\tif(i<segments)\r\n\t\t\t{\r\n\t\t\t\ttoc+=\"=\";\r\n\t\t\t}\r\n\t\t\telse if(i==segments)\r\n\t\t\t{\r\n\t\t\t\ttoc+=\">\";\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttoc+=\" \";\r\n\t\t\t}\r\n\t\t}\r\n\t\tstd::string speed_str=PrettyPrintSpeed((size_t)((new_bytes*1000)\/passed_time));\r\n\t\twhile(speed_str.size()<c_speed_size)\r\n\t\t\tspeed_str+=\" \";\r\n\t\tstd::string pcdone=convert((int)(pc_done*100.f));\r\n\t\tif(pcdone.size()==1)\r\n\t\t\tpcdone=\" \"+pcdone;\r\n\r\n\t\ttoc+=\"] \"+pcdone+\"% \"+speed_str+\" \"+(curr_fn);\r\n\t\t\r\n\t\tif(toc.size()>=c_max_l_length)\r\n\t\t    toc=toc.substr(0, c_max_l_length);\r\n\t\t\r\n\t\tif(toc.size()>max_line_length)\r\n\t\t    max_line_length=toc.size();\r\n\t\t    \r\n\t\twhile(toc.size()<max_line_length)\r\n\t\t    toc+=\" \";\r\n\r\n\t\tstd::cout << toc;\r\n\t\tstd::cout.flush();\r\n\r\n\t\tlast_progress_bytes=curr_verified;\r\n\t\tlast_time=Server->getTimeMS();\r\n\t}\r\n}\r\n\r\nbool verify_file(db_single_result &res, _i64 &curr_verified, _i64 verify_size, bool& missing)\r\n{\r\n\tstd::string fp=res[\"fullpath\"];\r\n\tIFsFile *f=Server->openFile(os_file_prefix(fp), MODE_READ);\r\n\tif( f==NULL )\r\n\t{\r\n\t\tServer->Log(\"Error opening file \\\"\"+fp+\"\\\"\", LL_ERROR);\r\n\t\tmissing = true;\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif(watoi64(res[\"filesize\"])!=f->Size())\r\n\t{\r\n\t\tServer->Log(\"Filesize of \\\"\"+fp+\"\\\" is wrong\", LL_ERROR);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tstd::string f_name=ExtractFileName(fp);\r\n\t\r\n\tFsExtentIterator extent_iterator(f, 32768);\r\n\tstd::string calc_dig = BackupServerPrepareHash::hash_sha(f, &extent_iterator, true);\r\n\tcurr_verified += f->Size();\r\n\r\n\tif(calc_dig.empty())\r\n\t{\r\n\t\tServer->Log(\"Could not read all bytes of file \\\"\"+fp+\"\\\"\", LL_ERROR);\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif(res[\"shahash\"]!=calc_dig)\r\n\t{\r\n\t\tServer->Log(\"Hash of \\\"\"+fp+\"\\\" is wrong\", LL_ERROR);\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool verify_hashes(std::string arg)\r\n{\r\n\tIDatabase *db=Server->getDatabase(Server->getThreadID(), URBACKUPDB_SERVER);\r\n\r\n\tstd::string working_dir=(Server->getServerWorkingDir());\r\n\tstd::string v_output_fn=working_dir+os_file_sep()+\"urbackup\"+os_file_sep()+\"verification_result.txt\";\r\n\tstd::fstream v_failure;\r\n\tv_failure.open(v_output_fn.c_str(), std::ios::out|std::ios::binary);\r\n\tif( !v_failure.is_open() )\r\n\t\tServer->Log(\"Could not open \\\"\"+v_output_fn+\"\\\" for writing\", LL_ERROR);\r\n\telse\r\n\t\tServer->Log(\"Writing verification results to \\\"\"+v_output_fn+\"\\\"\", LL_INFO);\r\n\r\n\tstd::string clientname;\r\n\tstd::string backupname;\r\n\r\n\tif(arg!=\"true\")\r\n\t{\r\n\t\tif(arg.find(\"\/\")==std::string::npos)\r\n\t\t{\r\n\t\t\tclientname=arg;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tclientname=getuntil(\"\/\", arg);\r\n\t\t\tbackupname=getafter(\"\/\", arg);\r\n\t\t\t\r\n\t\t}\r\n\t}\r\n\r\n\tbool delete_failed = Server->getServerParameter(\"delete_verify_failed\")==\"true\";\r\n\r\n\tint cid=0;\r\n\tint backupid=0;\r\n\tstd::string filter;\r\n\r\n\tIDatabase *files_db = Server->getDatabase(Server->getThreadID(), URBACKUPDB_SERVER);\r\n\r\n\tif(!clientname.empty())\r\n\t{\r\n\t\tif(clientname!=\"*\")\r\n\t\t{\r\n\t\t\tIQuery *q=db->Prepare(\"SELECT id FROM clients WHERE name=?\");\r\n\t\t\tq->Bind(clientname);\r\n\t\t\tdb_results res=q->Read();\r\n\t\t\tif(!res.empty())\r\n\t\t\t{\r\n\t\t\t\tcid=watoi(res[0][\"id\"]);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Client \\\"\"+clientname+\"\\\" not found\", LL_ERROR);\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tfilter=\" WHERE clientid=\"+convert(cid);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tfilter+=\" WHERE 1=1\";\r\n\t\t}\r\n\t\t\r\n\r\n\t\tif(!backupname.empty())\r\n\t\t{\r\n\t\t\tstd::string backupid_filter;\r\n\t\t\tstd::string temp_create_query;\r\n\t\t\tif(backupname==\"last\")\r\n\t\t\t{\r\n\t\t\t\tif(clientname!=\"*\")\r\n\t\t\t\t{\r\n\t\t\t\t\tIQuery* q=db->Prepare(\"SELECT id,path FROM backups WHERE clientid=? AND complete=1 ORDER BY backuptime DESC LIMIT 1\");\r\n\t\t\t\t\tq->Bind(cid);\r\n\t\t\t\t\tdb_results res=q->Read();\r\n\t\t\t\t\tif(!res.empty())\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tbackupid_filter=\"= \"+res[0][\"id\"];\r\n\t\t\t\t\t\tServer->Log(\"Last backup: \"+res[0][\"path\"], LL_INFO);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tServer->Log(\"Last backup not found\", LL_ERROR);\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tbackupid_filter = \" IN (SELECT id FROM backups)\";\r\n\t\t\t\t\ttemp_create_query = \"SELECT id FROM backups b WHERE NOT EXISTS (SELECT id FROM backups c WHERE complete=1 AND c.backuptime > b.backuptime AND b.clientid=c.clientid)\";\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\telse if(backupname==\"*\")\r\n\t\t\t{\r\n\t\t\t\tbackupid_filter=\" IN (SELECT id FROM backups)\";\r\n\t\t\t\ttemp_create_query = \"SELECT id FROM backups WHERE clientid=\" + convert(cid);\t\t\t\t\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\t\t\r\n\t\t\t\tIQuery* q=db->Prepare(\"SELECT id FROM backups WHERE path=? AND clientid=?\");\r\n\t\t\t\tq->Bind(backupname);\r\n\t\t\t\tq->Bind(cid);\r\n\t\t\t\tdb_results res=q->Read();\r\n\t\t\t\tif(!res.empty())\r\n\t\t\t\t{\r\n\t\t\t\t\tbackupid_filter=\"= \"+res[0][\"id\"];\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Backup \\\"\"+backupname+\"\\\" not found\", LL_ERROR);\r\n\t\t\t\t\t\r\n\t\t\t\t\treturn false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif(backupname!=\"*\" || clientname!=\"*\")\r\n\t\t\t{\r\n\t\t\t\tfilter+=\" AND backupid \"+backupid_filter;\r\n\t\t\t}\r\n\r\n\t\t\tif (!temp_create_query.empty())\r\n\t\t\t{\r\n\t\t\t\tfiles_db->Write(\"CREATE TEMPORARY TABLE backups (id INTEGER PRIMARY KEY)\");\r\n\r\n\t\t\t\tIQuery* q_insert = files_db->Prepare(\"INSERT INTO backups (id) VALUES (?)\", false);\r\n\t\t\t\tIQuery* q_backup_ids = db->Prepare(temp_create_query, false);\r\n\t\t\t\tIDatabaseCursor* cur = q_backup_ids->Cursor();\r\n\r\n\t\t\t\tdb_single_result res;\r\n\t\t\t\twhile (cur->next(res))\r\n\t\t\t\t{\r\n\t\t\t\t\tq_insert->Bind(res[\"id\"]);\r\n\t\t\t\t\tq_insert->Write();\r\n\t\t\t\t\tq_insert->Reset();\r\n\t\t\t\t}\r\n\r\n\t\t\t\tdb->destroyQuery(q_backup_ids);\r\n\t\t\t\tfiles_db->destroyQuery(q_insert);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\tstd::cout << \"Calculating filesize...\" << std::endl;\r\n\tIQuery *q_num_files=db->Prepare(\"SELECT SUM(filesize) AS c FROM files\"+filter);\r\n\tdb_results res=q_num_files->Read();\r\n\tif(res.empty())\r\n\t{\r\n\t\tServer->Log(\"Error during filesize calculation.\", LL_ERROR);\r\n\t\treturn false;\r\n\t}\r\n\r\n\t_i64 verify_size=watoi64(res[0][\"c\"]);\r\n\t_i64 curr_verified=0;\r\n\r\n\tstd::cout << \"To be verified: \" << PrettyPrintBytes(verify_size) << \" of files\" << std::endl;\r\n\r\n\t_i64 crowid=0;\r\n\r\n\tIQuery *q_get_files=db->Prepare(\"SELECT id, fullpath, shahash, filesize FROM files\"+filter, false);\r\n\r\n\tbool is_okay=true;\r\n\r\n\tIDatabaseCursor* cursor = q_get_files->Cursor();\r\n\r\n\tstd::vector<int64> todelete;\r\n\tstd::vector<int64> missing_files;\r\n\r\n\tdb_single_result res_single;\r\n\twhile(cursor->next(res_single))\r\n\t{\r\n\t\tbool is_missing=false;\r\n\t\tif(! verify_file( res_single, curr_verified, verify_size, is_missing) )\r\n\t\t{\r\n\t\t\tif(!is_missing)\r\n\t\t\t{\r\n\t\t\t\tv_failure << \"Verification of \\\"\" << (res_single[\"fullpath\"]) << \"\\\" failed\\r\\n\";\r\n\t\t\t\tis_okay=false;\r\n\r\n\t\t\t\tif(delete_failed)\r\n\t\t\t\t{\r\n\t\t\t\t\ttodelete.push_back(watoi64(res_single[\"id\"]));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tmissing_files.push_back(watoi64(res_single[\"id\"]));\r\n\t\t\t}\t\t\t\r\n\t\t}\r\n\t}\r\n\t\r\n\tif(v_failure.is_open() && is_okay)\r\n\t{\r\n\t\tv_failure.close();\r\n\t\tServer->deleteFile(v_output_fn);\r\n\t}\r\n\r\n\tdb->destroyQuery(q_get_files);\r\n\r\n\tIQuery* q_get_file = db->Prepare(\"SELECT id, fullpath, shahash, filesize FROM files WHERE id=?\");\r\n\r\n\tstd::cout << missing_files.size() << \" could not be opened during verification. Checking now if they have been deleted from the database...\" << std::endl;\r\n\r\n\tfor(size_t i=0;i<missing_files.size();++i)\r\n\t{\r\n\t\tq_get_file->Bind(missing_files[i]);\r\n\t\tdb_results res = q_get_file->Read();\r\n\t\tq_get_file->Reset();\r\n\t\t\r\n\t\tif(!res.empty())\r\n\t\t{\r\n\t\t\tbool is_missing=false;\r\n\t\t\tdb_single_result& res_single = res[0];\r\n\t\t\tif(!verify_file(res_single, curr_verified, verify_size, is_missing))\r\n\t\t\t{\r\n\t\t\t\tv_failure << \"Verification of file \\\"\" << (res_single[\"fullpath\"]) << \"\\\" failed (during rechecking previously missing files)\\r\\n\";\r\n\t\t\t\tis_okay=false;\r\n\r\n\t\t\t\tif(delete_failed)\r\n\t\t\t\t{\r\n\t\t\t\t\ttodelete.push_back(watoi64(res_single[\"id\"]));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tstd::cout << std::endl;\r\n\r\n\tif(delete_failed)\r\n\t{\r\n\t\tstd::cout << \"Deleting \" << todelete.size() << \" file entries with failed verification from database...\" << std::endl;\r\n\r\n\t\tSStartupStatus status;\r\n\t\tif(!create_files_index(status))\r\n\t\t{\r\n\t\t\tstd::cout << \"Error opening file index -1\" << std::endl;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tServerFilesDao backupdao(db);\r\n\t\t\tstd::auto_ptr<FileIndex> fileindex(create_lmdb_files_index());\r\n\r\n\t\t\tif(fileindex.get()==NULL)\r\n\t\t\t{\r\n\t\t\t\tstd::cout << \"Error opening file index -2\" << std::endl;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\r\n\t\t\t\tfor(size_t i=0;i<todelete.size();++i)\r\n\t\t\t\t{\r\n\t\t\t\t\tBackupServerHash::deleteFileSQL(backupdao, *fileindex, todelete[i]);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tstd::cout << \"done.\" << std::endl;\r\n\t\t\t}\r\n\t\t}\t\t\r\n\t}\r\n\t\r\n\r\n\treturn is_okay;\r\n}<|endoftext|>"}
{"text":"<commit_before>\n\/\/#define LOKI_CLASS_LEVEL_THREADING\n\/\/#define LOKI_OBJECT_LEVEL_THREADING\n\n\/\/ Uncomment this to test new [] and delete [].\n\/\/ #define LOKI_SMALL_OBJECT_USE_NEW_ARRAY\n\n#include \"SmallObj.h\"\n#include \"timer.h\"\n\n#include <string>\n\nusing namespace std;\n\t\n\t\n\t\t\nclass ThisIsASmallObject\n{\n\tint i;\n\tdouble d;\n\t\/\/std::string s;\n};\t\n\ntemplate<class T>\t\t\nstruct Base : public ThisIsASmallObject, public T {};\ntemplate<>\t\t\nstruct Base<void> : public ThisIsASmallObject {};\n\ntypedef Base<void> \nA;\ntypedef Base<Loki::SmallObject<> > \nB;\ntypedef Base<Loki::SmallValueObject<> > \nC;\n\n\n\/*\nclass A \n{ int i; int* p;};\nclass B : public Loki::SmallObject<>\n{ int i; int* p;};\nclass C : public Loki::SmallValueObject<> \n{ int i; int* p;};\n*\/\n\n\ntemplate<class T>\nint run_new_delete(int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\n\t{\t\t\n\t\tT* p = new T;\n\t\tdelete p;\n\t}\n\t\/****************************************************************\/\t \n\tt.stop();\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\ntemplate<class T>\nint run_new_delete(T** array, int N, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\n\t\tfor (int n=0; n<N; n++)\n\t\t{\t\n\t\t\tarray[n] = new T;\n\t\t\tdelete array[n];\n\t\t}\n\t\/****************************************************************\/\t \n\tt.stop();\t\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\ntemplate<class T>\nint run_new(T** array, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\t\n\t\tarray[i] = new T;\n\t\/****************************************************************\/\t \n\tt.stop();\t\n\tt.print(t.t(),s);\n\treturn t.t();\n}\ntemplate<class T>\nint run_delete(T** array, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\t\n\t\tdelete array[i];\n\t\/****************************************************************\/\t \n\tt.stop();\t\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\n\ntemplate<class T>\nint run_new_delete_array(int N, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\n\t{\t\t\n\t\tT* p = new T[N];\n\t\tdelete [] p;\n\t}\n\t\/****************************************************************\/\t \n\tt.stop();\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\n\nint main()\n{\t\n\tint loop = 1000000\n\t;\n\t\n\tTimer t;\n\n\tt.t100 = 0;\n\tt.t100 = run_new_delete<A>(loop,t,\"new & delete A : \");\n\trun_new_delete<B>(loop,t,\"new & delete B : \");\n\trun_new_delete<C>(loop,t,\"new & delete C : \");\n\t\n\tcout << endl << endl;\n\/\/    Loki::AllocatorSingleton<>::ClearExtraMemory();\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\n\tint N = 100000;\n\tint loop2 = loop\/N*10;\n\t\n\tA** a = new A*[N];\n\tB** b = new B*[N];\n\tC** c = new C*[N];\n\t\n\tfor(int i=0; i<N; i++)\n\t{\n\t\ta[i]=0;\n\t\tb[i]=0;\n\t\tc[i]=0;\n\t}\n\t\n\tt.t100 = 0;\n\tt.t100 = run_new_delete(a,N,loop2,t,\"new & delete A on array : \");\n\trun_new_delete(b,N,loop2,t,\"new & delete B on array : \");\n\trun_new_delete(c,N,loop2,t,\"new & delete C on array : \");\n\n\tcout << endl << endl;\n\/\/    Loki::AllocatorSingleton<>::ClearExtraMemory();\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\tt.t100 = 0;\n\tt.t100 = run_new(a,N,t,\"new A on array : \");\n\trun_new(b,N,t,\"new B on array : \");\n\trun_new(c,N,t,\"new C on array : \");\n\n\tcout << endl;\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\tt.t100 = 0;\n\tt.t100 = run_delete(a,N,t,\"delete A on array : \");\n\trun_delete(b,N,t,\"delete B on array : \");\n\trun_delete(c,N,t,\"delete C on array : \");\n\n\n\tdelete [] a;\n\tdelete [] b;\n\tdelete [] c;\n\t\n\tcout << endl << endl;\n\/\/    Loki::AllocatorSingleton<>::ClearExtraMemory();\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\tN = 5;\n\t\n\tt.t100 = 0;\n\tt.t100 = run_new_delete_array<A>(N,loop,t,\"new & delete [] A : \");\n\trun_new_delete_array<B>(N,loop,t,\"new & delete [] B : \");\n\trun_new_delete_array<C>(N,loop,t,\"new & delete [] C : \");\n\t\n\tcout << endl << endl;\n    Loki::AllocatorSingleton<>::ClearExtraMemory();\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\tcout << endl;\n\tsystem(\"PAUSE\");\n\treturn 0;\n}\n\n<commit_msg>Added tests for new [] and delete [].<commit_after>\n\/\/#define LOKI_CLASS_LEVEL_THREADING\n\/\/#define LOKI_OBJECT_LEVEL_THREADING\n\n\/\/ Uncomment this to test new [] and delete [].\n\/\/#define LOKI_SMALL_OBJECT_USE_NEW_ARRAY\n\n#include \"SmallObj.h\"\n#include \"timer.h\"\n\n#include <string>\n\nusing namespace std;\n\t\n\t\n\t\t\nclass ThisIsASmallObject\n{\n\tint i;\n\tdouble d;\n\t\/\/std::string s;\n};\t\n\ntemplate<class T>\t\t\nstruct Base : public ThisIsASmallObject, public T {};\ntemplate<>\t\t\nstruct Base<void> : public ThisIsASmallObject {};\n\ntypedef Base<void> \nA;\ntypedef Base<Loki::SmallObject<> > \nB;\ntypedef Base<Loki::SmallValueObject<> > \nC;\n\n\n\/*\nclass A \n{ int i; int* p;};\nclass B : public Loki::SmallObject<>\n{ int i; int* p;};\nclass C : public Loki::SmallValueObject<> \n{ int i; int* p;};\n*\/\n\n\ntemplate<class T>\nint run_new_delete(int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\n\t{\t\t\n\t\tT* p = new T;\n\t\tdelete p;\n\t}\n\t\/****************************************************************\/\t \n\tt.stop();\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\ntemplate<class T>\nint run_new_delete(T** array, int N, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\n\t\tfor (int n=0; n<N; n++)\n\t\t{\t\n\t\t\tarray[n] = new T;\n\t\t\tdelete array[n];\n\t\t}\n\t\/****************************************************************\/\t \n\tt.stop();\t\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\ntemplate<class T>\nint run_new(T** array, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\t\n\t\tarray[i] = new T;\n\t\/****************************************************************\/\t \n\tt.stop();\t\n\tt.print(t.t(),s);\n\treturn t.t();\n}\ntemplate<class T>\nint run_delete(T** array, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\t\n\t\tdelete array[i];\n\t\/****************************************************************\/\t \n\tt.stop();\t\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\n\ntemplate<class T>\nint run_new_delete_array(int N, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\t \n\tfor (int i=0; i<loop; ++i)\n\t{\t\t\n\t\tT* p = new T[N];\n\t\tdelete [] p;\n\t}\n\t\/****************************************************************\/\t \n\tt.stop();\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\ntemplate<class T>\nint run_new_array( int N, T** array, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\n\tfor (int i=0; i<loop; ++i)\t\n\t\tarray[i] = new T[N];\n\t\/****************************************************************\/\n\tt.stop();\n\tt.print(t.t(),s);\n\treturn t.t();\n}\ntemplate<class T>\nint run_delete_array( T** array, int loop, Timer& t, char* s)\n{\n\tt.start();\n\t\/****************************************************************\/\n\tfor (int i=0; i<loop; ++i)\t\n\t\tdelete [] array[i];\n\t\/****************************************************************\/\n\tt.stop();\n\tt.print(t.t(),s);\n\treturn t.t();\n}\n\n\n\nint main()\n{\t\n\tint loop = 1000000\n\t;\n\t\n\tTimer t;\n\n\tt.t100 = 0;\n\tt.t100 = run_new_delete<A>(loop,t,\"new & delete A : \");\n\trun_new_delete<B>(loop,t,\"new & delete B : \");\n\trun_new_delete<C>(loop,t,\"new & delete C : \");\n\t\n\tcout << endl << endl;\n\/\/    Loki::AllocatorSingleton<>::ClearExtraMemory();\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\n\tint N = 100000;\n\tint loop2 = loop\/N*10;\n\t\n\tA** a = new A*[N];\n\tB** b = new B*[N];\n\tC** c = new C*[N];\n\t\n\tfor(int i=0; i<N; i++)\n\t{\n\t\ta[i]=0;\n\t\tb[i]=0;\n\t\tc[i]=0;\n\t}\n\t\n\tt.t100 = 0;\n\tt.t100 = run_new_delete(a,N,loop2,t,\"new & delete A on array : \");\n\trun_new_delete(b,N,loop2,t,\"new & delete B on array : \");\n\trun_new_delete(c,N,loop2,t,\"new & delete C on array : \");\n\n\tcout << endl << endl;\n\/\/    Loki::AllocatorSingleton<>::ClearExtraMemory();\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\tt.t100 = 0;\n\tt.t100 = run_new(a,N,t,\"new A on array : \");\n\trun_new(b,N,t,\"new B on array : \");\n\trun_new(c,N,t,\"new C on array : \");\n\n\tcout << endl;\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\tt.t100 = 0;\n\tt.t100 = run_delete(a,N,t,\"delete A on array : \");\n\trun_delete(b,N,t,\"delete B on array : \");\n\trun_delete(c,N,t,\"delete C on array : \");\n\n\tcout << endl << endl;\n\/\/    Loki::AllocatorSingleton<>::ClearExtraMemory();\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\tN = 5;\n\t\n\tt.t100 = 0;\n\tt.t100 = run_new_delete_array<A>(N,loop,t,\"new & delete [] A : \");\n\trun_new_delete_array<B>(N,loop,t,\"new & delete [] B : \");\n\trun_new_delete_array<C>(N,loop,t,\"new & delete [] C : \");\n\n\tcout << endl << endl;\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n    int count = 1000;\n\tt.t100 = 0;\n\tt.t100 = run_new_array(N,a,count,t,\"new [] A on array : \");\n\trun_new_array(N,b,count,t,\"new [] B on array : \");\n\trun_new_array(N,c,count,t,\"new [] C on array : \");\n\n\tcout << endl;\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\tt.t100 = 0;\n\tt.t100 = run_delete_array(a,count,t,\"delete [] A on array : \");\n\trun_delete_array(b,count,t,\"delete [] B on array : \");\n\trun_delete_array(c,count,t,\"delete [] C on array : \");\n\n\n\tdelete [] a;\n\tdelete [] b;\n\tdelete [] c;\n\t\n\tcout << endl << endl;\n    Loki::AllocatorSingleton<>::ClearExtraMemory();\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\tcout << endl;\n\tsystem(\"PAUSE\");\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef NNXX_MESSAGE_SREAMBUF_HPP\n#define NNXX_MESSAGE_SREAMBUF_HPP\n\n#include <algorithm>\n\nnamespace nnxx {\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  basic_message_streambuf(size_type base_size) noexcept:\n    base_type(),\n    m_base_size(base_size),\n    m_msg()\n  { }\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  basic_message_streambuf(size_type size, int type):\n    base_type(),\n    m_base_size(size),\n    m_msg(size * sizeof(char_type), type)\n  { clear(); }\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  basic_message_streambuf(message &&msg) noexcept:\n    base_type(),\n    m_base_size(msg.empty() ? 1000 : msg.size()),\n    m_msg(std::move(msg))\n  { clear(); }\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  ~basic_message_streambuf()\n  { }\n\n  template < typename Char, typename Traits >\n  void basic_message_streambuf<Char, Traits>::clear() noexcept\n  {\n    const auto b = reinterpret_cast<char_type *>(m_msg.data());\n    const auto e = reinterpret_cast<char_type *>(m_msg.data()) + m_msg.size();\n    this->setg(b, b, e);\n    this->setp(b, e);\n  }\n\n  template < typename Char, typename Traits >\n  void basic_message_streambuf<Char, Traits>::msg(message &&m) noexcept\n  {\n    m_msg = std::move(m);\n    clear();\n  }\n\n  template < typename Char, typename Traits >\n  message basic_message_streambuf<Char, Traits>::msg(int type)\n  { return copy(m_msg, this->pptr() - this->pbase(), type); }\n\n  template < typename Char, typename Traits >\n  message basic_message_streambuf<Char, Traits>::move_msg()\n  {\n    message m;\n    m_msg.resize(this->pptr() - this->pbase());\n    m_msg.swap(m);\n    clear();\n    return m;\n  }\n\n  template < typename Char, typename Traits >\n  typename\n  basic_message_streambuf<Char, Traits>::streamsize\n  basic_message_streambuf<Char, Traits>::xsputn(const char_type *s, streamsize n)\n  {\n    using std::copy;\n\n    if (n > static_cast<streamsize>(this->epptr() - this->pptr())) {\n      overflow(traits_type::eof());\n    }\n\n    copy(s, s + n, this->pptr());\n    this->pbump(n);\n    return n;\n  }\n\n  template < typename Char, typename Traits >\n  typename\n  basic_message_streambuf<Char, Traits>::int_type\n  basic_message_streambuf<Char, Traits>::overflow(int_type c)\n  {\n    const auto n = m_msg.size();\n\n    if (!m_msg) {\n      m_msg = message{ m_base_size * sizeof(char_type) };\n    }\n    else {\n      m_msg.resize(2 * sizeof(char_type) * m_msg.size());\n    }\n\n    const auto b = reinterpret_cast<char_type *>(m_msg.data());\n    const auto e = reinterpret_cast<char_type *>(m_msg.data()) + m_msg.size();\n    this->setp(b, e);\n    this->pbump(n);\n\n    if (!traits_type::eq_int_type(c, traits_type::eof())) {\n      *(this->pptr()) = char_type(c);\n      this->pbump(1);\n    }\n\n    return ~traits_type::eof();\n  }\n\n#if NNXX_LIBCPP\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  basic_message_streambuf(basic_message_streambuf &&m) noexcept:\n    base_type(std::move(m)),\n    m_base_size(m.m_base_size),\n    m_msg(std::move(m.m_msg))\n  { m.clear(); }\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits> &\n  basic_message_streambuf<Char, Traits>::\n  operator=(basic_message_streambuf &&m) noexcept\n  {\n    m.swap(*this);\n    return *this;\n  }\n\n  template < typename Char, typename Traits >\n  void basic_message_streambuf<Char, Traits>::\n  swap(basic_message_streambuf &m) noexcept\n  {\n    using std::swap;\n    base_type::swap(m);\n    swap(m_base_size, m.m_base_size);\n    swap(m_msg, m.m_msg);\n  }\n#endif \/\/ NNXX_LIBCPP\n\n}\n\n#endif \/\/ NNXX_MESSAGE_SREAMBUF_H\n<commit_msg>implement nnxx::message::resize through nn_reallocmsg and fix nnxx::message_streambuf::move_msg to return a message of the correct size<commit_after>#ifndef NNXX_MESSAGE_SREAMBUF_HPP\n#define NNXX_MESSAGE_SREAMBUF_HPP\n\n#include <algorithm>\n\nnamespace nnxx {\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  basic_message_streambuf(size_type base_size) noexcept:\n    base_type(),\n    m_base_size(base_size),\n    m_msg()\n  { }\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  basic_message_streambuf(size_type size, int type):\n    base_type(),\n    m_base_size(size),\n    m_msg(size * sizeof(char_type), type)\n  { clear(); }\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  basic_message_streambuf(message &&msg) noexcept:\n    base_type(),\n    m_base_size(msg.empty() ? 1000 : msg.size()),\n    m_msg(std::move(msg))\n  { clear(); }\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  ~basic_message_streambuf()\n  { }\n\n  template < typename Char, typename Traits >\n  void basic_message_streambuf<Char, Traits>::clear() noexcept\n  {\n    const auto b = reinterpret_cast<char_type *>(m_msg.data());\n    const auto e = reinterpret_cast<char_type *>(m_msg.data()) + m_msg.size();\n    this->setg(b, b, e);\n    this->setp(b, e);\n  }\n\n  template < typename Char, typename Traits >\n  void basic_message_streambuf<Char, Traits>::msg(message &&m) noexcept\n  {\n    m_msg = std::move(m);\n    clear();\n  }\n\n  template < typename Char, typename Traits >\n  message basic_message_streambuf<Char, Traits>::msg(int type)\n  { return copy(m_msg, this->pptr() - this->pbase(), type); }\n\n  template < typename Char, typename Traits >\n  message basic_message_streambuf<Char, Traits>::move_msg()\n  {\n    message m;\n    m_msg.resize(this->pptr() - this->pbase());\n    m_msg.swap(m);\n    clear();\n    return m;\n  }\n\n  template < typename Char, typename Traits >\n  typename\n  basic_message_streambuf<Char, Traits>::streamsize\n  basic_message_streambuf<Char, Traits>::xsputn(const char_type *s, streamsize n)\n  {\n    using std::copy;\n\n    if (n > static_cast<streamsize>(this->epptr() - this->pptr())) {\n      overflow(traits_type::eof());\n    }\n\n    copy(s, s + n, this->pptr());\n    this->pbump(n);\n    return n;\n  }\n\n  template < typename Char, typename Traits >\n  typename\n  basic_message_streambuf<Char, Traits>::int_type\n  basic_message_streambuf<Char, Traits>::overflow(int_type c)\n  {\n    const auto n = m_msg.size();\n\n    if (!m_msg) {\n      m_msg = message{ m_base_size * sizeof(char_type) };\n    }\n    else {\n      m_msg.resize(2 * m_msg.size());\n    }\n\n    const auto b = reinterpret_cast<char_type *>(m_msg.data());\n    const auto e = reinterpret_cast<char_type *>(m_msg.data()) + m_msg.size();\n    this->setp(b, e);\n    this->pbump(n);\n\n    if (!traits_type::eq_int_type(c, traits_type::eof())) {\n      *(this->pptr()) = char_type(c);\n      this->pbump(1);\n    }\n\n    return ~traits_type::eof();\n  }\n\n#if NNXX_LIBCPP\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits>::\n  basic_message_streambuf(basic_message_streambuf &&m) noexcept:\n    base_type(std::move(m)),\n    m_base_size(m.m_base_size),\n    m_msg(std::move(m.m_msg))\n  { m.clear(); }\n\n  template < typename Char, typename Traits >\n  basic_message_streambuf<Char, Traits> &\n  basic_message_streambuf<Char, Traits>::\n  operator=(basic_message_streambuf &&m) noexcept\n  {\n    m.swap(*this);\n    return *this;\n  }\n\n  template < typename Char, typename Traits >\n  void basic_message_streambuf<Char, Traits>::\n  swap(basic_message_streambuf &m) noexcept\n  {\n    using std::swap;\n    base_type::swap(m);\n    swap(m_base_size, m.m_base_size);\n    swap(m_msg, m.m_msg);\n  }\n#endif \/\/ NNXX_LIBCPP\n\n}\n\n#endif \/\/ NNXX_MESSAGE_SREAMBUF_H\n<|endoftext|>"}
{"text":"<commit_before>#include <array>\r\n#include <cstdio>\r\n#include <unistd.h>\r\n#include \"base\/os.h\"\r\n#include \"fs\/fs.h\"\r\n#include \"utils.h\"\r\n\r\n#ifndef O_BINARY\r\n#define O_BINARY 0x0004\r\n#endif\r\n\r\nusing namespace services::fs;\r\n\r\nextern \"C\" {\r\nextern void initialise_monitor_handles(void);\r\nextern void __libc_init_array(void);\r\nextern int kill(pid_t, int);\r\n}\r\n\r\nclass PosixFileSystem : public IFileSystem\r\n{\r\n  public:\r\n    virtual FileOpenResult Open(const char* path, FileOpen openFlag, FileAccess accessMode) override\r\n    {\r\n        auto f = open(path, num(openFlag) | O_BINARY, num(accessMode));\r\n\r\n        if (f == -1)\r\n        {\r\n            return FileOpenResult(static_cast<OSResult>(errno), -1);\r\n        }\r\n        else\r\n        {\r\n            return FileOpenResult(OSResult::Success, f);\r\n        }\r\n    }\r\n\r\n    virtual OSResult Unlink(const char* \/*path*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual OSResult Move(const char* \/*from*\/, const char* \/*to*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual OSResult TruncateFile(FileHandle \/*file*\/, FileSize \/*length*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual IOResult Write(FileHandle file, gsl::span<const std::uint8_t> buffer) override\r\n    {\r\n        auto r = write(file, buffer.data(), buffer.size());\r\n\r\n        if (r == -1)\r\n        {\r\n            return IOResult(static_cast<OSResult>(errno), {});\r\n        }\r\n        else\r\n        {\r\n            return IOResult(OSResult::Success, buffer.subspan(0, r));\r\n        }\r\n    }\r\n\r\n    virtual IOResult Read(FileHandle file, gsl::span<std::uint8_t> buffer) override\r\n    {\r\n        auto r = read(file, buffer.data(), buffer.size());\r\n\r\n        if (r == -1)\r\n        {\r\n            return IOResult(static_cast<OSResult>(errno), {});\r\n        }\r\n        else\r\n        {\r\n            return IOResult(OSResult::Success, buffer.subspan(0, r));\r\n        }\r\n    }\r\n\r\n    virtual OSResult Close(FileHandle file) override\r\n    {\r\n        return static_cast<OSResult>(close(file));\r\n    }\r\n\r\n    virtual DirectoryOpenResult OpenDirectory(const char* \/*dirname*\/) override\r\n    {\r\n        return DirectoryOpenResult(OSResult::NotSupported, 0);\r\n    }\r\n\r\n    virtual char* ReadDirectory(DirectoryHandle \/*directory*\/) override\r\n    {\r\n        return nullptr;\r\n    }\r\n\r\n    virtual OSResult CloseDirectory(DirectoryHandle \/*directory*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual OSResult Format(const char* \/*mountPoint*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual OSResult MakeDirectory(const char* \/*path*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual bool Exists(const char* \/*path*\/) override\r\n    {\r\n        return false;\r\n    }\r\n\r\n    virtual FileSize GetFileSize(FileHandle \/*file*\/) override\r\n    {\r\n        return 0;\r\n    }\r\n\r\n    virtual FileSize GetFileSize(const char* \/*dir*\/, const char* \/*file*\/) override\r\n    {\r\n        return 0;\r\n    }\r\n\r\n    virtual OSResult Seek(FileHandle file, SeekOrigin origin, FileSize offset) override\r\n    {\r\n        return static_cast<OSResult>(lseek(file, offset, num(origin)));\r\n    }\r\n\r\n    virtual std::uint32_t GetFreeSpace(const char* \/*devicePath*\/) override\r\n    {\r\n        return 0;\r\n    }\r\n};\r\n\r\nvoid GenerateSunSData(IFileSystem& fs);\r\nvoid GenerateSailData(IFileSystem& fs);\r\nvoid GenerateDetumblingData(IFileSystem& fs);\r\nvoid GenerateCameraCommissioningData(IFileSystem& fs);\r\nvoid GeneratePayloadCommissioningData(IFileSystem& fs);\r\nvoid GenerateLeopData(IFileSystem& fs);\r\nvoid GenerateRadfetData(IFileSystem& fs);\r\n\r\nint main()\r\n{\r\n    __libc_init_array();\r\n\r\n    initialise_monitor_handles();\r\n\r\n    PosixFileSystem fs;\r\n\r\n    GenerateSunSData(fs);\r\n    GenerateSailData(fs);\r\n    GenerateDetumblingData(fs);\r\n    GenerateCameraCommissioningData(fs);\r\n    GeneratePayloadCommissioningData(fs);\r\n    GenerateLeopData(fs);\r\n    GenerateRadfetData(fs);\r\n\r\n    kill(-1, 0);\r\n\r\n    return 0;\r\n}\r\n<commit_msg>[Experiment File Generator Update] Standard O_BINARY flag.<commit_after>#include <array>\r\n#include <cstdio>\r\n#include <fcntl.h>\r\n#include <unistd.h>\r\n#include \"base\/os.h\"\r\n#include \"fs\/fs.h\"\r\n#include \"utils.h\"\r\n\r\nusing namespace services::fs;\r\n\r\nextern \"C\" {\r\nextern void initialise_monitor_handles(void);\r\nextern void __libc_init_array(void);\r\nextern int kill(pid_t, int);\r\n}\r\n\r\nclass PosixFileSystem : public IFileSystem\r\n{\r\n  public:\r\n    virtual FileOpenResult Open(const char* path, FileOpen openFlag, FileAccess accessMode) override\r\n    {\r\n        auto f = open(path, num(openFlag) | O_BINARY, num(accessMode));\r\n\r\n        if (f == -1)\r\n        {\r\n            return FileOpenResult(static_cast<OSResult>(errno), -1);\r\n        }\r\n        else\r\n        {\r\n            return FileOpenResult(OSResult::Success, f);\r\n        }\r\n    }\r\n\r\n    virtual OSResult Unlink(const char* \/*path*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual OSResult Move(const char* \/*from*\/, const char* \/*to*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual OSResult TruncateFile(FileHandle \/*file*\/, FileSize \/*length*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual IOResult Write(FileHandle file, gsl::span<const std::uint8_t> buffer) override\r\n    {\r\n        auto r = write(file, buffer.data(), buffer.size());\r\n\r\n        if (r == -1)\r\n        {\r\n            return IOResult(static_cast<OSResult>(errno), {});\r\n        }\r\n        else\r\n        {\r\n            return IOResult(OSResult::Success, buffer.subspan(0, r));\r\n        }\r\n    }\r\n\r\n    virtual IOResult Read(FileHandle file, gsl::span<std::uint8_t> buffer) override\r\n    {\r\n        auto r = read(file, buffer.data(), buffer.size());\r\n\r\n        if (r == -1)\r\n        {\r\n            return IOResult(static_cast<OSResult>(errno), {});\r\n        }\r\n        else\r\n        {\r\n            return IOResult(OSResult::Success, buffer.subspan(0, r));\r\n        }\r\n    }\r\n\r\n    virtual OSResult Close(FileHandle file) override\r\n    {\r\n        return static_cast<OSResult>(close(file));\r\n    }\r\n\r\n    virtual DirectoryOpenResult OpenDirectory(const char* \/*dirname*\/) override\r\n    {\r\n        return DirectoryOpenResult(OSResult::NotSupported, 0);\r\n    }\r\n\r\n    virtual char* ReadDirectory(DirectoryHandle \/*directory*\/) override\r\n    {\r\n        return nullptr;\r\n    }\r\n\r\n    virtual OSResult CloseDirectory(DirectoryHandle \/*directory*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual OSResult Format(const char* \/*mountPoint*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual OSResult MakeDirectory(const char* \/*path*\/) override\r\n    {\r\n        return OSResult::NotSupported;\r\n    }\r\n\r\n    virtual bool Exists(const char* \/*path*\/) override\r\n    {\r\n        return false;\r\n    }\r\n\r\n    virtual FileSize GetFileSize(FileHandle \/*file*\/) override\r\n    {\r\n        return 0;\r\n    }\r\n\r\n    virtual FileSize GetFileSize(const char* \/*dir*\/, const char* \/*file*\/) override\r\n    {\r\n        return 0;\r\n    }\r\n\r\n    virtual OSResult Seek(FileHandle file, SeekOrigin origin, FileSize offset) override\r\n    {\r\n        return static_cast<OSResult>(lseek(file, offset, num(origin)));\r\n    }\r\n\r\n    virtual std::uint32_t GetFreeSpace(const char* \/*devicePath*\/) override\r\n    {\r\n        return 0;\r\n    }\r\n};\r\n\r\nvoid GenerateSunSData(IFileSystem& fs);\r\nvoid GenerateSailData(IFileSystem& fs);\r\nvoid GenerateDetumblingData(IFileSystem& fs);\r\nvoid GenerateCameraCommissioningData(IFileSystem& fs);\r\nvoid GeneratePayloadCommissioningData(IFileSystem& fs);\r\nvoid GenerateLeopData(IFileSystem& fs);\r\nvoid GenerateRadfetData(IFileSystem& fs);\r\n\r\nint main()\r\n{\r\n    __libc_init_array();\r\n\r\n    initialise_monitor_handles();\r\n\r\n    PosixFileSystem fs;\r\n\r\n    GenerateSunSData(fs);\r\n    GenerateSailData(fs);\r\n    GenerateDetumblingData(fs);\r\n    GenerateCameraCommissioningData(fs);\r\n    GeneratePayloadCommissioningData(fs);\r\n    GenerateLeopData(fs);\r\n    GenerateRadfetData(fs);\r\n\r\n    kill(-1, 0);\r\n\r\n    return 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"MethodDeclHandler.h\"\n\n#include <regex>\n\nnamespace typegrind\n{\n\n      MethodDeclHandler::MethodDeclHandler(clang::Rewriter*& rewriter, MethodMatcher const& matchers)\n              : mRewriter(rewriter)\n              , mMatchers(matchers)\n      {\n      }\n\n      clang::StringRef MethodDeclHandler::getID() const {\n          return \"typegrind\";\n      }\n\n      void MethodDeclHandler::run(const clang::ast_matchers::MatchFinder::MatchResult &result)\n      {\n        const clang::CXXMethodDecl* decl = result.Nodes.getNodeAs<clang::CXXMethodDecl>(\"decl\");\n        if(!decl) return;\n        if (!decl->hasBody()) return;\n\n        if(decl->getTemplateSpecializationKind() == clang::TSK_ImplicitInstantiation) return;\n\n        \/\/llvm::outs() << decl->getNameInfo().getAsString() << \"\\n\";\n        std::string prettyName;\n        {\n          llvm::raw_string_ostream prettyNameStream(prettyName);\n          decl->getCanonicalDecl()->getNameForDiagnostic(prettyNameStream, clang::PrintingPolicy(result.Context->getPrintingPolicy()), true);\n          prettyNameStream.flush();\n        }\n\n        auto match = mMatchers.matches(prettyName);\n        if(!match) return;\n\n        \/\/if(mVisited.find(prettyName) != mVisited.end()) return;\n        \/\/mVisited.insert(prettyName);\n\n        auto& sm = result.Context->getSourceManager();\n        auto ploc = sm.getPresumedLoc(decl->getLocEnd());\n        std::string locStr = \"'\";\n        locStr += ploc.getFilename();\n        locStr += \":\";\n        locStr += std::to_string(ploc.getLine());\n        locStr += \"'\";\n\n        clang::Stmt *funcBody = decl->getBody();\n        mRewriter->InsertTextAfterToken(funcBody->getSourceRange().getBegin(), \" TYPEGRIND_LOG_METHOD_ENTER(\\\"\"+prettyName+\"\\\", \"+locStr+\", \\\"\"+match->custom_name+\"\\\", \"+std::to_string(match->flags)+\") \");\n\n        \/\/ if constructor - initializer lists\n        {\n          const clang::CXXConstructorDecl* constrDecl = result.Nodes.getNodeAs<clang::CXXConstructorDecl>(\"decl\");\n          if(constrDecl)\n          {\n            for(auto initer: constrDecl->inits())\n            {\n              if(!initer->isMemberInitializer()) continue;\n              mRewriter->InsertTextAfterToken(initer->getLParenLoc(), \"TYPEGRIND_LOG_METHOD_INITIALIZER(\\\"\"+prettyName+\"\\\", \"+locStr+\", \\\"\"+match->custom_name+\"\\\", \"+std::to_string(match->flags)+\", (\");\n              mRewriter->InsertTextBefore(initer->getRParenLoc(), \"))\");\n            }\n          }\n        }\n      }\n}\n<commit_msg>using \" instead of '<commit_after>\n#include \"MethodDeclHandler.h\"\n\n#include <regex>\n\nnamespace typegrind\n{\n\n      MethodDeclHandler::MethodDeclHandler(clang::Rewriter*& rewriter, MethodMatcher const& matchers)\n              : mRewriter(rewriter)\n              , mMatchers(matchers)\n      {\n      }\n\n      clang::StringRef MethodDeclHandler::getID() const {\n          return \"typegrind\";\n      }\n\n      void MethodDeclHandler::run(const clang::ast_matchers::MatchFinder::MatchResult &result)\n      {\n        const clang::CXXMethodDecl* decl = result.Nodes.getNodeAs<clang::CXXMethodDecl>(\"decl\");\n        if(!decl) return;\n        if (!decl->hasBody()) return;\n\n        if(decl->getTemplateSpecializationKind() == clang::TSK_ImplicitInstantiation) return;\n\n        \/\/llvm::outs() << decl->getNameInfo().getAsString() << \"\\n\";\n        std::string prettyName;\n        {\n          llvm::raw_string_ostream prettyNameStream(prettyName);\n          decl->getCanonicalDecl()->getNameForDiagnostic(prettyNameStream, clang::PrintingPolicy(result.Context->getPrintingPolicy()), true);\n          prettyNameStream.flush();\n        }\n\n        auto match = mMatchers.matches(prettyName);\n        if(!match) return;\n\n        \/\/if(mVisited.find(prettyName) != mVisited.end()) return;\n        \/\/mVisited.insert(prettyName);\n\n        auto& sm = result.Context->getSourceManager();\n        auto ploc = sm.getPresumedLoc(decl->getLocEnd());\n        std::string locStr = \"\\\"\";\n        locStr += ploc.getFilename();\n        locStr += \":\";\n        locStr += std::to_string(ploc.getLine());\n        locStr += \"\\\"\";\n\n        clang::Stmt *funcBody = decl->getBody();\n        mRewriter->InsertTextAfterToken(funcBody->getSourceRange().getBegin(), \" TYPEGRIND_LOG_METHOD_ENTER(\\\"\"+prettyName+\"\\\", \"+locStr+\", \\\"\"+match->custom_name+\"\\\", \"+std::to_string(match->flags)+\") \");\n\n        \/\/ if constructor - initializer lists\n        {\n          const clang::CXXConstructorDecl* constrDecl = result.Nodes.getNodeAs<clang::CXXConstructorDecl>(\"decl\");\n          if(constrDecl)\n          {\n            for(auto initer: constrDecl->inits())\n            {\n              if(!initer->isMemberInitializer()) continue;\n              mRewriter->InsertTextAfterToken(initer->getLParenLoc(), \"TYPEGRIND_LOG_METHOD_INITIALIZER(\\\"\"+prettyName+\"\\\", \"+locStr+\", \\\"\"+match->custom_name+\"\\\", \"+std::to_string(match->flags)+\", (\");\n              mRewriter->InsertTextBefore(initer->getRParenLoc(), \"))\");\n            }\n          }\n        }\n      }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n#include \"condor_common.h\"\n#include \"condor_debug.h\"\n#include \"condor_config.h\"\n#include \"condor_string.h\"\n#include \"daemon_list.h\"\n#include \"dc_collector.h\"\n#include \"internet.h\"\n#include \"ipv6_hostname.h\"\n#include <vector>\n\nDaemonList::DaemonList()\n{\n}\n\n\nDaemonList::~DaemonList( void )\n{\n\tDaemon* tmp;\n\tlist.Rewind();\n\twhile( list.Next(tmp) ) {\n\t\tdelete tmp;\n\t}\n}\n\n\nvoid\nDaemonList::init( daemon_t type, const char* host_list, const char* pool_list )\n{\n\tDaemon* tmp;\n\tchar* host;\n\tchar const *pool = NULL;\n\tStringList foo;\n\tStringList pools;\n\tif( host_list ) {\n\t\tfoo.initializeFromString( host_list );\n\t\tfoo.rewind();\n\t}\n\tif( pool_list ) {\n\t\tpools.initializeFromString( pool_list );\n\t\tpools.rewind();\n\t}\n\twhile( true ) {\n\t\thost = foo.next();\n\t\tpool = pools.next();\n\t\tif( !host && !pool ) {\n\t\t\tbreak;\n\t\t}\n\t\ttmp = buildDaemon( type, host, pool );\n\t\tappend( tmp );\n\t}\n}\n\n\nDaemon*\nDaemonList::buildDaemon( daemon_t type, const char* host, char const *pool )\n{\n\tDaemon* tmp;\n\tswitch( type ) {\n\tcase DT_COLLECTOR:\n\t\ttmp = new DCCollector( host );\n\t\tbreak;\n\tdefault:\n\t\ttmp = new Daemon( type, host, pool );\n\t\tbreak;\n\t}\n\treturn tmp;\n}\n\n\n\/*************************************************************\n ** SimpleList API\n ************************************************************\/\n\n\nbool\nDaemonList::append( Daemon* d) { return list.Append(d); }\n\nbool\nDaemonList::Append( Daemon* d) { return list.Append(d); }\n\nbool\nDaemonList::isEmpty( void ) { return list.IsEmpty(); } \n\nbool\nDaemonList::IsEmpty( void ) { return list.IsEmpty(); } \n\nint\nDaemonList::number( void ) { return list.Number(); } \n\nint\nDaemonList::Number( void ) { return list.Number(); } \n\nvoid\nDaemonList::rewind( void ) { list.Rewind(); } \n\nvoid\nDaemonList::Rewind( void ) { list.Rewind(); } \n\nbool\nDaemonList::current( Daemon* & d ) { return list.Current(d); } \n\nbool\nDaemonList::Current( Daemon* & d ) { return list.Current(d); } \n\nbool\nDaemonList::next( Daemon* & d ) { return list.Next(d); } \n\nbool\nDaemonList::Next( Daemon* & d ) { return list.Next(d); } \n\nbool\nDaemonList::atEnd() { return list.AtEnd(); } \n\nbool\nDaemonList::AtEnd() { return list.AtEnd(); } \n\nvoid\nDaemonList::deleteCurrent() { this->DeleteCurrent(); }\n\n\/*\n  NOTE: SimpleList does NOT delete the Daemon objects themselves,\n  DeleteCurrent() is only going to delete the pointer itself.  Since\n  we're responsible for all this memory (we create the Daemon objects \n  in DaemonList::init() and DaemonList::buildDaemon()), we have to be\n  responsbile to deallocate it when we're done.  We're already doing\n  this correctly in the DaemonList destructor, and we have to do it\n  here in the DeleteCurrent() interface, too.\n*\/\nvoid\nDaemonList::DeleteCurrent() {\n\tDaemon* cur = NULL;\n\tif( list.Current(cur) && cur ) {\n\t\tdelete cur;\n\t}\n\tlist.DeleteCurrent();\n}\n\n\nCollectorList::CollectorList() {\n}\n\nCollectorList::~CollectorList() {\n}\n\n\nCollectorList *\nCollectorList::create( const char * pool )\n{\n\tCollectorList * result = new CollectorList();\n\tDCCollector * collector = NULL;\n\n\tif (pool) {\n\t\t\t\/\/ Eventually we might want to query this collector\n\t\t\t\/\/ for all the other collectors in the pool....\n\t\tresult->append (new DCCollector (pool));\n\t\treturn result;\n\t}\n\n\t\t\/\/ Read the new names from config file\n\tStringList collector_name_list;\n\tchar * collector_name_param = NULL;\n\tcollector_name_param = getCmHostFromConfig( \"COLLECTOR\" );\n\tif( collector_name_param ) {\n\t\tcollector_name_list.initializeFromString(collector_name_param);\n\t\n\t\t\t\/\/ Create collector objects\n\t\tcollector_name_list.rewind();\n\t\tchar * collector_name = NULL;\n\t\twhile ((collector_name = collector_name_list.next()) != NULL) {\n\t\t\tcollector = new DCCollector (collector_name);\n\t\t\tresult->append (collector);\n\t\t}\n\t} else {\n\t\t\t\/\/ Otherwise, just return an empty list\n\t\tdprintf( D_ALWAYS, \"Warning: Collector information was not found in the configuration file. ClassAds will not be sent to the collector and this daemon will not join a larger Condor pool.\\n\");\n\t}\n\tif( collector_name_param ) {\n\t\tfree( collector_name_param );\n\t}\n\treturn result;\n}\n\n\n\/***\n * \n * Resort a collector list for locality;\n * prioritize the collector that is best suited for the negotiator\n * running on this machine. This minimizes the delay for fetching\n * ads from the Collector by the Negotiator, which some people\n * consider more critical.\n *\n ***\/\n\nint\nCollectorList::resortLocal( const char *preferred_collector )\n{\n\t\t\/\/ Find the collector in the list that is best suited for \n\t\t\/\/ this host. This is determined either by\n\t\t\/\/ a) preferred_collector passed in\n        \/\/ b) the collector that has the same hostname as this negotiator\n\tchar * tmp_preferred_collector = NULL;\n\n\tif ( !preferred_collector ) {\n        \/\/ figure out our hostname for plan b) above\n\t\tMyString _hostname_str = get_local_fqdn();\n\t\tconst char * _hostname = _hostname_str.Value();\n\t\tif (!(*_hostname)) {\n\t\t\t\t\/\/ Can't get our hostname??? fuck off\n\t\t\treturn -1;\n\t\t}\n\n\t\ttmp_preferred_collector = strdup(_hostname);\n\t\tpreferred_collector = tmp_preferred_collector; \/\/ So we know to free later\n\t}\n\n\n\t\t\/\/ First, pick out collector(s) that is on this host\n\tDaemon *daemon;\n\tSimpleList<Daemon*> prefer_list;\n\tthis->list.Rewind();\n\twhile ( this->list.Next(daemon) ) {\n\t\tif ( same_host (preferred_collector, daemon->fullHostname()) ) {\n\t\t\tthis->list.DeleteCurrent();\n\t\t\tprefer_list.Prepend( daemon );\n\t\t}\n\t}\n\n\t\t\/\/ Walk through the list of preferred collectors,\n\t\t\/\/ stuff 'em in the main \"list\"\n\tthis->list.Rewind();\n\tprefer_list.Rewind();\n\twhile ( prefer_list.Next(daemon) ) {\n\t\tthis->list.Prepend( daemon );\n\t}\n\t\n\tfree(tmp_preferred_collector); \/\/ Warning, preferred_collector (may have) just became invalid, so do this just before returning.\n\treturn 0;\n}\n\n\nint\nCollectorList::sendUpdates (int cmd, ClassAd * ad1, ClassAd* ad2, bool nonblocking) {\n\tint success_count = 0;\n\n\tthis->rewind();\n\tDCCollector * daemon;\n\twhile (this->next(daemon)) {\n\t\tdprintf( D_FULLDEBUG, \n\t\t\t\t \"Trying to update collector %s\\n\", \n\t\t\t\t daemon->addr() );\n\t\tif( daemon->sendUpdate(cmd, ad1, ad2, nonblocking) ) {\n\t\t\tsuccess_count++;\n\t\t} \n\t}\n\n\treturn success_count;\n}\n\nQueryResult\nCollectorList::query(CondorQuery & cQuery, ClassAdList & adList, CondorError *errstack) {\n\n\tint num_collectors = this->number();\n\tif (num_collectors < 1) {\n\t\treturn Q_NO_COLLECTOR_HOST;\n\t}\n\n\tstd::vector<DCCollector *> vCollectors;\n\tDCCollector * daemon;\n\tQueryResult result;\n\n\tbool problems_resolving = false;\n\n\t\n\t\/\/ switch containers for easier random access.\n\tthis->rewind();\n\twhile (this->next(daemon)) {\n\t\tvCollectors.push_back(daemon);\n\t}\n\t\n\n        while ( vCollectors.size() ) \n        {\n            \/\/ choose a random collector in the list to query.\n            unsigned int idx = get_random_int() % vCollectors.size() ;\n            daemon = vCollectors[idx];\n\n\t    if ( !daemon->isBlacklisted() )\n\t    {\n\t\tif ( ! daemon->addr() ) {\n\t\t\tif ( daemon->name() ) {\n\t\t\t\tdprintf( D_ALWAYS,\n\t\t\t\t\t\t \"Can't resolve collector %s; skipping\\n\",\n\t\t\t\t\t\t daemon->name() );\n\t\t\t} else {\n\t\t\t\tdprintf( D_ALWAYS,\n\t\t\t\t\t\t \"Can't resolve nameless collector; skipping\\n\" );\n\t\t\t}\n\t\t\tproblems_resolving = true;\n\t\t\t\n\t\t}\n\t\telse\n                {\n\n                    dprintf (D_FULLDEBUG, \n                                    \"Trying to query collector %s\\n\", \n                                    daemon->addr());\n\n                    if( num_collectors > 1 ) {\n                            daemon->blacklistMonitorQueryStarted();\n                    }\n\n                    result = \n                            cQuery.fetchAds (adList, daemon->addr(), errstack);\n\n                    if( num_collectors > 1 ) {\n                            daemon->blacklistMonitorQueryFinished( result == Q_OK );\n                    }\n\n                    if (result == Q_OK) {\n                            return result;\n                    }\n                }\n\t    }\n\t    else\n\t    {\n\t      dprintf( D_ALWAYS,\"Collector %s blacklisted; skipping\\n\", daemon->name() );\n\t    }\n\n\t    \/\/ if you got here remove it from the list of potential candidates.\n\t    vCollectors.erase( vCollectors.begin()+idx );\n\t}\n\t\t\t\n\t\/\/ only push an error if the error stack exists and is currently empty\n\tif(problems_resolving && errstack && !errstack->code(0)) {\n\t\tchar* tmplist = getCmHostFromConfig( \"COLLECTOR\" );\n\t\terrstack->pushf(\"CONDOR_STATUS\",1,\"Unable to resolve COLLECTOR_HOST (%s).\",tmplist?tmplist:\"(null)\");\n\t}\n\n\t\t\/\/ If we've gotten here, there are no good collectors\n\treturn Q_COMMUNICATION_ERROR;\n}\n\n\n\nbool\nCollectorList::next( DCCollector* & d )\n{\n\treturn DaemonList::Next( (Daemon*&)d );\n}\n\n\nbool\nCollectorList::Next( DCCollector* & d )\n{\n\treturn next( d );\n}\n\n\nbool\nCollectorList::next( Daemon* & d )\n{\n\treturn DaemonList::Next( d );\n}\n\n\nbool\nCollectorList::Next( Daemon* & d )\n{\n\treturn next( d );\n}\n<commit_msg>Don't crash when querying a collector whose name doesn't resolve. #3946<commit_after>\/***************************************************************\n *\n * Copyright (C) 1990-2007, 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\n#include \"condor_common.h\"\n#include \"condor_debug.h\"\n#include \"condor_config.h\"\n#include \"condor_string.h\"\n#include \"daemon_list.h\"\n#include \"dc_collector.h\"\n#include \"internet.h\"\n#include \"ipv6_hostname.h\"\n#include <vector>\n\nDaemonList::DaemonList()\n{\n}\n\n\nDaemonList::~DaemonList( void )\n{\n\tDaemon* tmp;\n\tlist.Rewind();\n\twhile( list.Next(tmp) ) {\n\t\tdelete tmp;\n\t}\n}\n\n\nvoid\nDaemonList::init( daemon_t type, const char* host_list, const char* pool_list )\n{\n\tDaemon* tmp;\n\tchar* host;\n\tchar const *pool = NULL;\n\tStringList foo;\n\tStringList pools;\n\tif( host_list ) {\n\t\tfoo.initializeFromString( host_list );\n\t\tfoo.rewind();\n\t}\n\tif( pool_list ) {\n\t\tpools.initializeFromString( pool_list );\n\t\tpools.rewind();\n\t}\n\twhile( true ) {\n\t\thost = foo.next();\n\t\tpool = pools.next();\n\t\tif( !host && !pool ) {\n\t\t\tbreak;\n\t\t}\n\t\ttmp = buildDaemon( type, host, pool );\n\t\tappend( tmp );\n\t}\n}\n\n\nDaemon*\nDaemonList::buildDaemon( daemon_t type, const char* host, char const *pool )\n{\n\tDaemon* tmp;\n\tswitch( type ) {\n\tcase DT_COLLECTOR:\n\t\ttmp = new DCCollector( host );\n\t\tbreak;\n\tdefault:\n\t\ttmp = new Daemon( type, host, pool );\n\t\tbreak;\n\t}\n\treturn tmp;\n}\n\n\n\/*************************************************************\n ** SimpleList API\n ************************************************************\/\n\n\nbool\nDaemonList::append( Daemon* d) { return list.Append(d); }\n\nbool\nDaemonList::Append( Daemon* d) { return list.Append(d); }\n\nbool\nDaemonList::isEmpty( void ) { return list.IsEmpty(); } \n\nbool\nDaemonList::IsEmpty( void ) { return list.IsEmpty(); } \n\nint\nDaemonList::number( void ) { return list.Number(); } \n\nint\nDaemonList::Number( void ) { return list.Number(); } \n\nvoid\nDaemonList::rewind( void ) { list.Rewind(); } \n\nvoid\nDaemonList::Rewind( void ) { list.Rewind(); } \n\nbool\nDaemonList::current( Daemon* & d ) { return list.Current(d); } \n\nbool\nDaemonList::Current( Daemon* & d ) { return list.Current(d); } \n\nbool\nDaemonList::next( Daemon* & d ) { return list.Next(d); } \n\nbool\nDaemonList::Next( Daemon* & d ) { return list.Next(d); } \n\nbool\nDaemonList::atEnd() { return list.AtEnd(); } \n\nbool\nDaemonList::AtEnd() { return list.AtEnd(); } \n\nvoid\nDaemonList::deleteCurrent() { this->DeleteCurrent(); }\n\n\/*\n  NOTE: SimpleList does NOT delete the Daemon objects themselves,\n  DeleteCurrent() is only going to delete the pointer itself.  Since\n  we're responsible for all this memory (we create the Daemon objects \n  in DaemonList::init() and DaemonList::buildDaemon()), we have to be\n  responsbile to deallocate it when we're done.  We're already doing\n  this correctly in the DaemonList destructor, and we have to do it\n  here in the DeleteCurrent() interface, too.\n*\/\nvoid\nDaemonList::DeleteCurrent() {\n\tDaemon* cur = NULL;\n\tif( list.Current(cur) && cur ) {\n\t\tdelete cur;\n\t}\n\tlist.DeleteCurrent();\n}\n\n\nCollectorList::CollectorList() {\n}\n\nCollectorList::~CollectorList() {\n}\n\n\nCollectorList *\nCollectorList::create( const char * pool )\n{\n\tCollectorList * result = new CollectorList();\n\tDCCollector * collector = NULL;\n\n\tif (pool) {\n\t\t\t\/\/ Eventually we might want to query this collector\n\t\t\t\/\/ for all the other collectors in the pool....\n\t\tresult->append (new DCCollector (pool));\n\t\treturn result;\n\t}\n\n\t\t\/\/ Read the new names from config file\n\tStringList collector_name_list;\n\tchar * collector_name_param = NULL;\n\tcollector_name_param = getCmHostFromConfig( \"COLLECTOR\" );\n\tif( collector_name_param ) {\n\t\tcollector_name_list.initializeFromString(collector_name_param);\n\t\n\t\t\t\/\/ Create collector objects\n\t\tcollector_name_list.rewind();\n\t\tchar * collector_name = NULL;\n\t\twhile ((collector_name = collector_name_list.next()) != NULL) {\n\t\t\tcollector = new DCCollector (collector_name);\n\t\t\tresult->append (collector);\n\t\t}\n\t} else {\n\t\t\t\/\/ Otherwise, just return an empty list\n\t\tdprintf( D_ALWAYS, \"Warning: Collector information was not found in the configuration file. ClassAds will not be sent to the collector and this daemon will not join a larger Condor pool.\\n\");\n\t}\n\tif( collector_name_param ) {\n\t\tfree( collector_name_param );\n\t}\n\treturn result;\n}\n\n\n\/***\n * \n * Resort a collector list for locality;\n * prioritize the collector that is best suited for the negotiator\n * running on this machine. This minimizes the delay for fetching\n * ads from the Collector by the Negotiator, which some people\n * consider more critical.\n *\n ***\/\n\nint\nCollectorList::resortLocal( const char *preferred_collector )\n{\n\t\t\/\/ Find the collector in the list that is best suited for \n\t\t\/\/ this host. This is determined either by\n\t\t\/\/ a) preferred_collector passed in\n        \/\/ b) the collector that has the same hostname as this negotiator\n\tchar * tmp_preferred_collector = NULL;\n\n\tif ( !preferred_collector ) {\n        \/\/ figure out our hostname for plan b) above\n\t\tMyString _hostname_str = get_local_fqdn();\n\t\tconst char * _hostname = _hostname_str.Value();\n\t\tif (!(*_hostname)) {\n\t\t\t\t\/\/ Can't get our hostname??? fuck off\n\t\t\treturn -1;\n\t\t}\n\n\t\ttmp_preferred_collector = strdup(_hostname);\n\t\tpreferred_collector = tmp_preferred_collector; \/\/ So we know to free later\n\t}\n\n\n\t\t\/\/ First, pick out collector(s) that is on this host\n\tDaemon *daemon;\n\tSimpleList<Daemon*> prefer_list;\n\tthis->list.Rewind();\n\twhile ( this->list.Next(daemon) ) {\n\t\tif ( same_host (preferred_collector, daemon->fullHostname()) ) {\n\t\t\tthis->list.DeleteCurrent();\n\t\t\tprefer_list.Prepend( daemon );\n\t\t}\n\t}\n\n\t\t\/\/ Walk through the list of preferred collectors,\n\t\t\/\/ stuff 'em in the main \"list\"\n\tthis->list.Rewind();\n\tprefer_list.Rewind();\n\twhile ( prefer_list.Next(daemon) ) {\n\t\tthis->list.Prepend( daemon );\n\t}\n\t\n\tfree(tmp_preferred_collector); \/\/ Warning, preferred_collector (may have) just became invalid, so do this just before returning.\n\treturn 0;\n}\n\n\nint\nCollectorList::sendUpdates (int cmd, ClassAd * ad1, ClassAd* ad2, bool nonblocking) {\n\tint success_count = 0;\n\n\tthis->rewind();\n\tDCCollector * daemon;\n\twhile (this->next(daemon)) {\n\t\tdprintf( D_FULLDEBUG, \n\t\t\t\t \"Trying to update collector %s\\n\", \n\t\t\t\t daemon->addr() );\n\t\tif( daemon->sendUpdate(cmd, ad1, ad2, nonblocking) ) {\n\t\t\tsuccess_count++;\n\t\t} \n\t}\n\n\treturn success_count;\n}\n\nQueryResult\nCollectorList::query(CondorQuery & cQuery, ClassAdList & adList, CondorError *errstack) {\n\n\tint num_collectors = this->number();\n\tif (num_collectors < 1) {\n\t\treturn Q_NO_COLLECTOR_HOST;\n\t}\n\n\tstd::vector<DCCollector *> vCollectors;\n\tDCCollector * daemon;\n\tQueryResult result;\n\n\tbool problems_resolving = false;\n\n\t\n\t\/\/ switch containers for easier random access.\n\tthis->rewind();\n\twhile (this->next(daemon)) {\n\t\tvCollectors.push_back(daemon);\n\t}\n\t\n\n\twhile ( vCollectors.size() ) {\n\t\t\/\/ choose a random collector in the list to query.\n\t\tunsigned int idx = get_random_int() % vCollectors.size() ;\n\t\tdaemon = vCollectors[idx];\n\n\t\tif ( ! daemon->addr() ) {\n\t\t\tif ( daemon->name() ) {\n\t\t\t\tdprintf( D_ALWAYS,\n\t\t\t\t\t\t \"Can't resolve collector %s; skipping\\n\",\n\t\t\t\t\t\t daemon->name() );\n\t\t\t} else {\n\t\t\t\tdprintf( D_ALWAYS,\n\t\t\t\t\t\t \"Can't resolve nameless collector; skipping\\n\" );\n\t\t\t}\n\t\t\tproblems_resolving = true;\n\t\t} else if ( daemon->isBlacklisted() ) {\n\t\t\tdprintf( D_ALWAYS,\"Collector %s blacklisted; skipping\\n\",\n\t\t\t\t\t daemon->name() );\n\t\t} else {\n\t\t\tdprintf (D_FULLDEBUG,\n\t\t\t\t\t \"Trying to query collector %s\\n\",\n\t\t\t\t\t daemon->addr());\n\n\t\t\tif( num_collectors > 1 ) {\n\t\t\t\tdaemon->blacklistMonitorQueryStarted();\n\t\t\t}\n\n\t\t\tresult = cQuery.fetchAds (adList, daemon->addr(), errstack);\n\n\t\t\tif( num_collectors > 1 ) {\n\t\t\t\tdaemon->blacklistMonitorQueryFinished( result == Q_OK );\n\t\t\t}\n\n\t\t\tif (result == Q_OK) {\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ if you got here remove it from the list of potential candidates.\n\t\tvCollectors.erase( vCollectors.begin()+idx );\n\t}\n\n\t\/\/ only push an error if the error stack exists and is currently empty\n\tif(problems_resolving && errstack && !errstack->code(0)) {\n\t\tchar* tmplist = getCmHostFromConfig( \"COLLECTOR\" );\n\t\terrstack->pushf(\"CONDOR_STATUS\",1,\"Unable to resolve COLLECTOR_HOST (%s).\",tmplist?tmplist:\"(null)\");\n\t}\n\n\t\t\/\/ If we've gotten here, there are no good collectors\n\treturn Q_COMMUNICATION_ERROR;\n}\n\n\n\nbool\nCollectorList::next( DCCollector* & d )\n{\n\treturn DaemonList::Next( (Daemon*&)d );\n}\n\n\nbool\nCollectorList::Next( DCCollector* & d )\n{\n\treturn next( d );\n}\n\n\nbool\nCollectorList::next( Daemon* & d )\n{\n\treturn DaemonList::Next( d );\n}\n\n\nbool\nCollectorList::Next( Daemon* & d )\n{\n\treturn next( d );\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 \"src\/cpp\/thread_manager\/thread_manager.h\"\n\n#include <climits>\n#include <mutex>\n#include <thread>\n\n#include <grpc\/support\/log.h>\n\nnamespace grpc {\n\nThreadManager::WorkerThread::WorkerThread(ThreadManager* thd_mgr)\n    : thd_mgr_(thd_mgr) {\n  \/\/ Make thread creation exclusive with respect to its join happening in\n  \/\/ ~WorkerThread().\n  std::lock_guard<std::mutex> lock(wt_mu_);\n  thd_ = std::thread(&ThreadManager::WorkerThread::Run, this);\n}\n\nvoid ThreadManager::WorkerThread::Run() {\n  thd_mgr_->MainWorkLoop();\n  thd_mgr_->MarkAsCompleted(this);\n}\n\nThreadManager::WorkerThread::~WorkerThread() {\n  \/\/ Don't join until the thread is fully constructed.\n  std::lock_guard<std::mutex> lock(wt_mu_);\n  thd_.join();\n}\n\nThreadManager::ThreadManager(int min_pollers, int max_pollers)\n    : shutdown_(false),\n      num_pollers_(0),\n      min_pollers_(min_pollers),\n      max_pollers_(max_pollers == -1 ? INT_MAX : max_pollers),\n      num_threads_(0) {}\n\nThreadManager::~ThreadManager() {\n  {\n    std::lock_guard<std::mutex> lock(mu_);\n    GPR_ASSERT(num_threads_ == 0);\n  }\n\n  CleanupCompletedThreads();\n}\n\nvoid ThreadManager::Wait() {\n  std::unique_lock<std::mutex> lock(mu_);\n  while (num_threads_ != 0) {\n    shutdown_cv_.wait(lock);\n  }\n}\n\nvoid ThreadManager::Shutdown() {\n  std::lock_guard<std::mutex> lock(mu_);\n  shutdown_ = true;\n}\n\nbool ThreadManager::IsShutdown() {\n  std::lock_guard<std::mutex> lock(mu_);\n  return shutdown_;\n}\n\nvoid ThreadManager::MarkAsCompleted(WorkerThread* thd) {\n  {\n    std::lock_guard<std::mutex> list_lock(list_mu_);\n    completed_threads_.push_back(thd);\n  }\n\n  std::lock_guard<std::mutex> lock(mu_);\n  num_threads_--;\n  if (num_threads_ == 0) {\n    shutdown_cv_.notify_one();\n  }\n}\n\nvoid ThreadManager::CleanupCompletedThreads() {\n  std::list<WorkerThread*> completed_threads;\n  {\n    \/\/ swap out the completed threads list: allows other threads to clean up\n    \/\/ more quickly\n    std::unique_lock<std::mutex> lock(list_mu_);\n    completed_threads.swap(completed_threads_);\n  }\n  for (auto thd : completed_threads) delete thd;\n}\n\nvoid ThreadManager::Initialize() {\n  {\n    std::unique_lock<std::mutex> lock(mu_);\n    num_pollers_ = min_pollers_;\n    num_threads_ = min_pollers_;\n  }\n\n  for (int i = 0; i < min_pollers_; i++) {\n    \/\/ Create a new thread (which ends up calling the MainWorkLoop() function\n    new WorkerThread(this);\n  }\n}\n\nvoid ThreadManager::MainWorkLoop() {\n  while (true) {\n    void* tag;\n    bool ok;\n    WorkStatus work_status = PollForWork(&tag, &ok);\n\n    std::unique_lock<std::mutex> lock(mu_);\n    \/\/ Reduce the number of pollers by 1 and check what happened with the poll\n    num_pollers_--;\n    bool done = false;\n    switch (work_status) {\n      case TIMEOUT:\n        \/\/ If we timed out and we have more pollers than we need (or we are\n        \/\/ shutdown), finish this thread\n        if (shutdown_ || num_pollers_ > max_pollers_) done = true;\n        break;\n      case SHUTDOWN:\n        \/\/ If the thread manager is shutdown, finish this thread\n        done = true;\n        break;\n      case WORK_FOUND:\n        \/\/ If we got work and there are now insufficient pollers, start a new\n        \/\/ one\n        if (!shutdown_ && num_pollers_ < min_pollers_) {\n          num_pollers_++;\n          num_threads_++;\n          \/\/ Drop lock before spawning thread to avoid contention\n          lock.unlock();\n          new WorkerThread(this);\n        } else {\n          \/\/ Drop lock for consistency with above branch\n          lock.unlock();\n        }\n        \/\/ Lock is always released at this point - do the application work\n        DoWork(tag, ok);\n        \/\/ Take the lock again to check post conditions\n        lock.lock();\n        \/\/ If we're shutdown, we should finish at this point.\n        if (shutdown_) done = true;\n        break;\n    }\n    \/\/ If we decided to finish the thread, break out of the while loop\n    if (done) break;\n    \/\/ ... otherwise increase poller count and continue\n    \/\/ There's a chance that we'll exceed the max poller count: that is\n    \/\/ explicitly ok - we'll decrease after one poll timeout, and prevent\n    \/\/ some thrashing starting up and shutting down threads\n    num_pollers_++;\n  };\n\n  CleanupCompletedThreads();\n\n  \/\/ If we are here, either ThreadManager is shutting down or it already has\n  \/\/ enough threads.\n}\n\n}  \/\/ namespace grpc\n<commit_msg>Fix thread avalances in thread manager<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 \"src\/cpp\/thread_manager\/thread_manager.h\"\n\n#include <climits>\n#include <mutex>\n#include <thread>\n\n#include <grpc\/support\/log.h>\n\nnamespace grpc {\n\nThreadManager::WorkerThread::WorkerThread(ThreadManager* thd_mgr)\n    : thd_mgr_(thd_mgr) {\n  \/\/ Make thread creation exclusive with respect to its join happening in\n  \/\/ ~WorkerThread().\n  std::lock_guard<std::mutex> lock(wt_mu_);\n  thd_ = std::thread(&ThreadManager::WorkerThread::Run, this);\n}\n\nvoid ThreadManager::WorkerThread::Run() {\n  thd_mgr_->MainWorkLoop();\n  thd_mgr_->MarkAsCompleted(this);\n}\n\nThreadManager::WorkerThread::~WorkerThread() {\n  \/\/ Don't join until the thread is fully constructed.\n  std::lock_guard<std::mutex> lock(wt_mu_);\n  thd_.join();\n}\n\nThreadManager::ThreadManager(int min_pollers, int max_pollers)\n    : shutdown_(false),\n      num_pollers_(0),\n      min_pollers_(min_pollers),\n      max_pollers_(max_pollers == -1 ? INT_MAX : max_pollers),\n      num_threads_(0) {}\n\nThreadManager::~ThreadManager() {\n  {\n    std::lock_guard<std::mutex> lock(mu_);\n    GPR_ASSERT(num_threads_ == 0);\n  }\n\n  CleanupCompletedThreads();\n}\n\nvoid ThreadManager::Wait() {\n  std::unique_lock<std::mutex> lock(mu_);\n  while (num_threads_ != 0) {\n    shutdown_cv_.wait(lock);\n  }\n}\n\nvoid ThreadManager::Shutdown() {\n  std::lock_guard<std::mutex> lock(mu_);\n  shutdown_ = true;\n}\n\nbool ThreadManager::IsShutdown() {\n  std::lock_guard<std::mutex> lock(mu_);\n  return shutdown_;\n}\n\nvoid ThreadManager::MarkAsCompleted(WorkerThread* thd) {\n  {\n    std::lock_guard<std::mutex> list_lock(list_mu_);\n    completed_threads_.push_back(thd);\n  }\n\n  std::lock_guard<std::mutex> lock(mu_);\n  num_threads_--;\n  if (num_threads_ == 0) {\n    shutdown_cv_.notify_one();\n  }\n}\n\nvoid ThreadManager::CleanupCompletedThreads() {\n  std::list<WorkerThread*> completed_threads;\n  {\n    \/\/ swap out the completed threads list: allows other threads to clean up\n    \/\/ more quickly\n    std::unique_lock<std::mutex> lock(list_mu_);\n    completed_threads.swap(completed_threads_);\n  }\n  for (auto thd : completed_threads) delete thd;\n}\n\nvoid ThreadManager::Initialize() {\n  {\n    std::unique_lock<std::mutex> lock(mu_);\n    num_pollers_ = min_pollers_;\n    num_threads_ = min_pollers_;\n  }\n\n  for (int i = 0; i < min_pollers_; i++) {\n    \/\/ Create a new thread (which ends up calling the MainWorkLoop() function\n    new WorkerThread(this);\n  }\n}\n\nvoid ThreadManager::MainWorkLoop() {\n  while (true) {\n    void* tag;\n    bool ok;\n    WorkStatus work_status = PollForWork(&tag, &ok);\n\n    std::unique_lock<std::mutex> lock(mu_);\n    \/\/ Reduce the number of pollers by 1 and check what happened with the poll\n    num_pollers_--;\n    bool done = false;\n    switch (work_status) {\n      case TIMEOUT:\n        \/\/ If we timed out and we have more pollers than we need (or we are\n        \/\/ shutdown), finish this thread\n        if (shutdown_ || num_pollers_ > max_pollers_) done = true;\n        break;\n      case SHUTDOWN:\n        \/\/ If the thread manager is shutdown, finish this thread\n        done = true;\n        break;\n      case WORK_FOUND:\n        \/\/ If we got work and there are now insufficient pollers, start a new\n        \/\/ one\n        if (!shutdown_ && num_pollers_ < min_pollers_) {\n          num_pollers_++;\n          num_threads_++;\n          \/\/ Drop lock before spawning thread to avoid contention\n          lock.unlock();\n          new WorkerThread(this);\n        } else {\n          \/\/ Drop lock for consistency with above branch\n          lock.unlock();\n        }\n        \/\/ Lock is always released at this point - do the application work\n        DoWork(tag, ok);\n        \/\/ Take the lock again to check post conditions\n        lock.lock();\n        \/\/ If we're shutdown, we should finish at this point.\n        if (shutdown_) done = true;\n        break;\n    }\n    \/\/ If we decided to finish the thread, break out of the while loop\n    if (done) break;\n\n    \/\/ Otherwise go back to polling as long as it doesn't exceed max_pollers_\n    \/\/\n    \/\/ **WARNING**:\n    \/\/ There is a possibility of threads thrashing here (i.e excessive thread\n    \/\/ shutdowns and creations than the ideal case). This happens if max_poller_\n    \/\/ count is small and the rate of incoming requests is also small. In such\n    \/\/ scenarios we can possibly configure max_pollers_ to a higher value and\/or\n    \/\/ increase the cq timeout.\n    \/\/\n    \/\/ However, not doing this check here and unconditionally incrementing\n    \/\/ num_pollers (and hoping that the system will eventually settle down) has\n    \/\/ far worse consequences i.e huge number of threads getting created to the\n    \/\/ point of thread-exhaustion. For example: if the incoming request rate is\n    \/\/ very high, all the polling threads will return very quickly from\n    \/\/ PollForWork() with WORK_FOUND. They all briefly decrement num_pollers_\n    \/\/ counter thereby possibly - and briefly - making it go below min_pollers;\n    \/\/ This will most likely result in the creation of a new poller since\n    \/\/ num_pollers_ dipped below min_pollers_.\n    \/\/\n    \/\/ Now, If we didn't do the max_poller_ check here, all these threads will\n    \/\/ go back to doing PollForWork() and the whole cycle repeats (with a new\n    \/\/ thread being added in each cycle). Once the total number of threads in\n    \/\/ the system crosses a certain threshold (around ~1500), there is heavy\n    \/\/ contention on mutexes (the mu_ here or the mutexes in gRPC core like the\n    \/\/ pollset mutex) that makes DoWork() take longer to finish thereby causing\n    \/\/ new poller threads to be created even faster. This results in a thread\n    \/\/ avalanche.\n    if (num_pollers_ < max_pollers_) {\n      num_pollers_++;\n    } else {\n      break;\n    }\n  };\n\n  CleanupCompletedThreads();\n\n  \/\/ If we are here, either ThreadManager is shutting down or it already has\n  \/\/ enough threads.\n}\n\n}  \/\/ namespace grpc\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n#include <unordered_map>\n#include <boost\/algorithm\/string.hpp>\n#include <vector>\n#include <Galois\/Galois.h>\n#include <Galois\/Graph\/Graph.h>\n\n#include <cstring>\n#include <string>\n#include <fstream>\nusing namespace std;\nusing namespace boost;\n#define MAX_NODES 10000\n\ntypedef enum{pi,po,nd} node_type;\n\nstruct Node {\n string label_type;\/\/a0,b0...\n node_type type;\/\/ pi,po,nd\n int fanins;\n bool fanout; \n int level;\n };\n\nint main() {\n\n\tunordered_map <string, int> map;\n\t\/\/unordered_map<string, int> map;\n\tint node_index = 0;\n\n\ttypedef Galois::Graph::FirstGraph<Node,int,true> Graph;\n\n\tGraph g;\n\tNode nodes[MAX_NODES];\n\tGraph::GraphNode gnodes[MAX_NODES];\n\n\tvector<string> fields;\n\n\tifstream fin;\n\tfin.open(\"\/home\/aditya\/CS_220\/alan-abc\/examples\/sk\"); \/\/ open a file\n\tif (!fin.good()){\n\t\tcout << \"file not found\\n\";\n\t    return 1; \/\/ exit if file not found\n\t}\n\t  \/\/ read each line of the file\n\t  while (!fin.eof())\n\t  {\n\t    \/\/ read an entire line into memory\n\t    string line;\n\t    getline(fin,line);\n\t    trim(line);\n\t    split(fields, line, is_any_of(\" \"));\n\n\t    if(fields[0].compare(\"input\") == 0 || fields[0].compare(\"output\") == 0||fields[0].compare(\"wire\") == 0)\n\t    {\n\t    \tfor(unsigned i =1;i<fields.size();i++){\n\t    \t\t\/\/add to hash map to index to corresponding node in array\n\t    \t\tif(fields[i].size()>1)\n\t    \t\t{\n\t\t\t\t\/\/Add data to each node for level and type of input\n \t\t\t\tif(fields[0].compare(\"input\") == 0)\n\t\t\t\t{\n\t\t\t\t\tnodes[node_index].type = pi;\n\t\t\t\t\tnodes[node_index].level = 0;\n\t\t\t\t\tnodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\tif(fields[0].compare(\"output\") == 0)\n\t\t\t\t{\n\t\t\t\t\tnodes[node_index].type = po;\n\t\t\t\t\tnodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\tif(fields[0].compare(\"wire\") == 0)\n\t\t\t\t{\n\t\t\t\t\tnodes[node_index].type = nd;\n\t\t\t\t\tnodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t    \t\t\t\/\/remove last char b\/c its ',' or ';'\n\t    \t\t\tmap[fields[i].substr(0,fields[i].length()-1)] = node_index;\n\t    \t\t\tgnodes[node_index] = g.createNode(nodes[node_index]);\n\t\t\t\t\n\n\t    \t\t\tnode_index++;\n\t    \t\t}\n\n\t    \t}\n\t    }\n\t    if(fields[0].compare(\"assign\") == 0)\n\t    {\n\t    \tsize_t invert = fields[3].find_first_of(\"~\");\n\t\tif(fields[4].compare(\"|\") == 0)\n\t\t{\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[fields[3].substr(1,fields[3].length())]],gnodes[map[fields[1]]])) = 2;\/\/Edge weight: 2- Negative 1 - Positive\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[fields[5].substr(1,fields[3].length()-1)]],gnodes[map[fields[1]]])) = 2;\n\t\t\tnodes[map[fields[1]]].fanout = 0;\/\/ TO DO: Negated output: Try using getData() \n\t\t}\n\n\t\telse{\t\n\t    \tif (invert != string::npos){\n\t    \t\t\/\/addEdge(src,dest)\n\t    \t\t\/\/remove the '~' from the start of string\n\t    \t\t\/\/map[string] returns node index to find which node \n\t    \t\tg.getEdgeData(g.addEdge(gnodes[map[fields[3].substr(1,fields[3].length())]],gnodes[map[fields[1]]])) = 2;\/\/ \n\t    \t\t\/\/TODO add edge weights\n\t    \t}\n\t\telse \n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[fields[3].substr(1,fields[3].length())]],gnodes[map[fields[1]]])) = 1;\n\n\t    \tinvert = fields[5].find_first_of(\"~\");\n\t    \tif (invert != string::npos){\n\t    \t\t\/\/remove first and last char b\/c '~' to start and ';' at th\n\t    \t\tg.getEdgeData(g.addEdge(gnodes[map[fields[5].substr(1,fields[3].length()-1)]],gnodes[map[fields[1]]])) = 2;\n\t    \t}\n\t\telse\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[fields[5].substr(1,fields[3].length()-1)]],gnodes[map[fields[1]]])) = 1;\n\t\t}\n\n\t    }\n\n\t  }\n\n\tcout << g.getData(gnodes[0]).label_type << endl;\n\t\/\/ Traverse graph\n \tfor (Graph::iterator ii = g.begin(), ei = g.end(); ii != ei; ++ii) {\n   \t\tGraph::GraphNode src = *ii;\n\t\tcout << g.getData(src).label_type << endl;\n\t   \t\/\/for (Graph::edge_iterator jj = g.edge_begin(src), ej = g.edge_end(src); ++jj) {\n     \t\t\/\/Graph::GraphNode dst = graph.getEdgeDst(jj);\n     \t\t\/\/int edgeData = g.getEdgeData(jj);\n     \t\t\/\/assert(edgeData == 5);\n   \t\t\/\/}\n \t}\n\/*\n\tfor (Graph::GraphNode src : g) {\n   \tfor (Graph::edge_iterator edge : g.out_edges(src)) {\n     \t\tGraph::GraphNode dst = g.getEdgeDst(edge);\n     \t\tint edgeData = g.getEdgeData(edge);\n     \t\tcout << (g.getData(src)).label_type << \"\\n\";\n   \t\t}\n \t}\t\n*\/\n\n\n\/*\n\t  for(unsigned i = 0; i<map.bucket_count();i++){\n\t\t  std::cout << \"bucket #\" << i << \" contains:\";\n\t\t      for ( auto local_it = map.begin(i); local_it!= map.end(i); ++local_it )\n\t\t        std::cout << \" \" << local_it->first << \":\" << local_it->second;\n\t\t      std::cout << std::endl;\n\t  }\n\t  *\/\n\t  \/\/cout << map[\"n12,\"]<<\"\\n\"<<map[\"n11,\"];\n\n\treturn 0;\n}\n<commit_msg>Label printing corrected in galoisparse<commit_after>\n#include <iostream>\n#include <unordered_map>\n#include <boost\/algorithm\/string.hpp>\n#include <vector>\n#include <Galois\/Galois.h>\n#include <Galois\/Graph\/Graph.h>\n\n#include <cstring>\n#include <string>\n#include <fstream>\nusing namespace std;\nusing namespace boost;\n#define MAX_NODES 10000\n\ntypedef enum{pi,po,nd} node_type;\n\nstruct Node {\n string label_type;\/\/a0,b0...\n node_type type;\/\/ pi,po,nd\n int fanins;\n bool fanout; \n int level;\n };\n\nint main() {\n\n\tunordered_map <string, int> map;\n\t\/\/unordered_map<string, int> map;\n\tint node_index = 0;\n\n\ttypedef Galois::Graph::FirstGraph<Node,int,true> Graph;\n\n\tGraph g;\n\tNode nodes[MAX_NODES];\n\tGraph::GraphNode gnodes[MAX_NODES];\n\n\tvector<string> fields;\n\n\tifstream fin;\n\tfin.open(\"\/home\/aditya\/CS_220\/alan-abc\/examples\/sk\"); \/\/ open a file\n\tif (!fin.good()){\n\t\tcout << \"file not found\\n\";\n\t    return 1; \/\/ exit if file not found\n\t}\n\t  \/\/ read each line of the file\n\t  while (!fin.eof())\n\t  {\n\t    \/\/ read an entire line into memory\n\t    string line;\n\t    getline(fin,line);\n\t    trim(line);\n\t    split(fields, line, is_any_of(\" \"));\n\n\t    if(fields[0].compare(\"input\") == 0 || fields[0].compare(\"output\") == 0||fields[0].compare(\"wire\") == 0)\n\t    {\n\t    \tfor(unsigned i =1;i<fields.size();i++){\n\t    \t\t\/\/add to hash map to index to corresponding node in array\n\t    \t\tif(fields[i].size()>1)\n\t    \t\t{\n\t\t\t\t\/\/Add data to each node for level and type of input\n \t\t\t\tif(fields[0].compare(\"input\") == 0)\n\t\t\t\t{\n\t\t\t\t\tnodes[node_index].type = pi;\n\t\t\t\t\tnodes[node_index].level = 0;\n\t\t\t\t\tnodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\tif(fields[0].compare(\"output\") == 0)\n\t\t\t\t{\n\t\t\t\t\tnodes[node_index].type = po;\n\t\t\t\t\tnodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\tif(fields[0].compare(\"wire\") == 0)\n\t\t\t\t{\n\t\t\t\t\tnodes[node_index].type = nd;\n\t\t\t\t\tnodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t    \t\t\t\/\/remove last char b\/c its ',' or ';'\n\t    \t\t\tmap[fields[i].substr(0,fields[i].length()-1)] = node_index;\n\t    \t\t\tgnodes[node_index] = g.createNode(nodes[node_index]);\n\t\t\t\tg.addNode(gnodes[node_index]);\t\t\t\t\n\n\t    \t\t\tnode_index++;\n\t    \t\t}\n\n\t    \t}\n\t    }\n\t    if(fields[0].compare(\"assign\") == 0)\n\t    {\n\t    \tsize_t invert = fields[3].find_first_of(\"~\");\n\t\tif(fields[4].compare(\"|\") == 0)\n\t\t{\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[fields[3].substr(1,fields[3].length())]],gnodes[map[fields[1]]])) = 2;\/\/Edge weight: 2- Negative 1 - Positive\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[fields[5].substr(1,fields[3].length()-1)]],gnodes[map[fields[1]]])) = 2;\n\t\t\tnodes[map[fields[1]]].fanout = 0;\/\/ TO DO: Negated output: Try using getData() \n\t\t}\n\n\t\telse{\t\n\t    \tif (invert != string::npos){\n\t    \t\t\/\/addEdge(src,dest)\n\t    \t\t\/\/remove the '~' from the start of string\n\t    \t\t\/\/map[string] returns node index to find which node \n\t    \t\tg.getEdgeData(g.addEdge(gnodes[map[fields[3].substr(1,fields[3].length())]],gnodes[map[fields[1]]])) = 2;\/\/ \n\t    \t\t\/\/TODO add edge weights\n\t    \t}\n\t\telse \n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[fields[3].substr(1,fields[3].length())]],gnodes[map[fields[1]]])) = 1;\n\n\t    \tinvert = fields[5].find_first_of(\"~\");\n\t    \tif (invert != string::npos){\n\t    \t\t\/\/remove first and last char b\/c '~' to start and ';' at th\n\t    \t\tg.getEdgeData(g.addEdge(gnodes[map[fields[5].substr(1,fields[3].length()-1)]],gnodes[map[fields[1]]])) = 2;\n\t    \t}\n\t\telse\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[fields[5].substr(1,fields[3].length()-1)]],gnodes[map[fields[1]]])) = 1;\n\t\t}\n\n\t    }\n\n\t  }\n\n\t\/\/cout << g.getData(gnodes[0]).label_type << endl;\n\t\/\/ Traverse graph\n \tfor (Graph::iterator ii = g.begin(), ei = g.end(); ii != ei; ++ii) {\n   \t\tGraph::GraphNode src = *ii;\n\t\tcout << g.getData(src).label_type << endl;\n\t   \t\/\/for (Graph::edge_iterator jj = g.edge_begin(src), ej = g.edge_end(src); ++jj) {\n     \t\t\/\/Graph::GraphNode dst = graph.getEdgeDst(jj);\n     \t\t\/\/int edgeData = g.getEdgeData(jj);\n     \t\t\/\/assert(edgeData == 5);\n   \t\t\/\/}\n \t}\n\/*\n\tfor (Graph::GraphNode src : g) {\n   \tfor (Graph::edge_iterator edge : g.out_edges(src)) {\n     \t\tGraph::GraphNode dst = g.getEdgeDst(edge);\n     \t\tint edgeData = g.getEdgeData(edge);\n     \t\tcout << (g.getData(src)).label_type << \"\\n\";\n   \t\t}\n \t}\t\n*\/\n\n\n\/*\n\t  for(unsigned i = 0; i<map.bucket_count();i++){\n\t\t  std::cout << \"bucket #\" << i << \" contains:\";\n\t\t      for ( auto local_it = map.begin(i); local_it!= map.end(i); ++local_it )\n\t\t        std::cout << \" \" << local_it->first << \":\" << local_it->second;\n\t\t      std::cout << std::endl;\n\t  }\n\t  *\/\n\t  \/\/cout << map[\"n12,\"]<<\"\\n\"<<map[\"n11,\"];\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n#include <unordered_map>\n#include <boost\/algorithm\/string.hpp>\n#include <vector>\n#include <Galois\/Galois.h>\n#include <Galois\/Graph\/Graph.h>\n\n\/\/#include <cstring>\n#include <string>\n#include <fstream>\nusing namespace std;\nusing namespace boost;\n\ntypedef enum{pi,po,nd} node_type;\n\nstruct Node {\n string label_type;\/\/a0,b0...\n node_type type;\/\/ pi,po,nd\n int fanins; \/\/ Not required as of now\n bool fanout; \/\/Not required as of now\n int level;\n };\n\ntypedef Galois::Graph::FirstGraph<Node,int,true> Graph;\n\nGraph g;\n\nint node_index = 0;\nvector<Graph::GraphNode> gnodes;\n\nvector<string> fields;\n\nbool checkWorkability(Graph::GraphNode gnode){\n\tint count = 0;\n\tfor (Graph::edge_iterator edge : g.out_edges(gnode)) {\n\t\tint edgedata = g.getEdgeData(edge);\n\t   \tif(edgedata == 1|| edgedata ==2)\n\t   \t\tcount++;\n\t   \t}\n\tif (count > 1)\n\t\treturn false;\n\telse\n\t\treturn true;\n}\n\nvoid parseFileintoGraph(string inFile, unordered_map <string, int> &map){\n\tifstream fin;\n\tfin.open(inFile); \/\/ open a file\n\tif (!fin.good()){\n\t\tcout << \"file not found\\n\";\n\n\t}\n\telse\n\t\/\/ read each line of the file\n\twhile (!fin.eof())\n\t{\n\t\/\/ read an entire line into memory\n\tstring line;\n\tgetline(fin,line);\n\ttrim(line);\n\tsplit(fields, line, is_any_of(\" \"));\n\tNode n;\n\tif(fields[0].compare(\"input\") == 0 || fields[0].compare(\"output\") == 0||fields[0].compare(\"wire\") == 0)\n\t{\n\t\tfor(unsigned i =1;i<fields.size();i++){\n\t\t\t\/\/add to hash map to index to corresponding node in array\n\t\t\tif(fields[i].size()>1)\n\t\t\t{\n\t\t\t\t\/\/Add data to each node for level and type of input\n\t\t\t\tif(fields[0].compare(\"input\") == 0)\n\t\t\t\t{\n\t\t\t\t\tn.type = pi;\n\t\t\t\t\tn.level = 0;\n\t\t\t\t\tn.label_type = fields[i].substr(0,fields[i].length()-1);\n\n\t\t\t\t\t\/\/nodes[node_index].type = pi;\n\t\t\t\t\t\/\/nodes[node_index].level = 0;\n\t\t\t\t\t\/\/nodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\tif(fields[0].compare(\"output\") == 0)\n\t\t\t\t{\n\t\t\t\t\tn.type = po;\n\t\t\t\t\tn.level = -1;\n\t\t\t\t\tn.label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t\t\/\/nodes[node_index].type = po;\n\t\t\t\t\t\/\/nodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\tif(fields[0].compare(\"wire\") == 0)\n\t\t\t\t{\n\t\t\t\t\tn.type = nd;\n\t\t\t\t\tn.level = -2;\n\t\t\t\t\tn.label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t\t\/\/nodes[node_index].type = nd;\n\t\t\t\t\t\/\/nodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\t\/\/remove last char b\/c its ',' or ';'\n\t\t\t\tmap[fields[i].substr(0,fields[i].length()-1)] = node_index;\n\t\t\t\t\/\/gnodes[node_index] = g.createNode(nodes[node_index]);\n\t\t\t\tgnodes.push_back(g.createNode(n));\n\n\t\t\t\tg.addNode(gnodes[gnodes.size()-1]);\n\t\t\t\t\/\/cout << \"node index: \"<< node_index<<endl;\n\t\t\t\tnode_index++;\n\t\t\t}\n\n\t\t}\n\t}\n\t\/\/cout <<\"compare assign\"<<endl;\n\tif(fields[0].compare(\"assign\") == 0)\n\t{\n\t\tint level1,level2;\n\t\tstring f1,f3,f5;\n\t\tf1 = fields[1];\n\t\tf3 = fields[3];\n\t\tf5 = fields[5];\n\t\tif(fields[4].compare(\"|\") == 0)\n\t\t{\t\/\/Edge weight: 2- Negative 1 - Positive\n\t\t\tf3 = f3.substr(0,f3.length());\n\t\t\tf5 = f5.substr(0,f5.length()-1);\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f3]]\/\/src\n\t\t\t\t\t\t\t\t\t\t   ,gnodes[map[f1]])) = 2;\/\/dest\n\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f5]]\n\t\t\t\t\t\t\t\t\t\t   ,gnodes[map[f1]])) = 2;\n\n\t\t\tlevel1 = g.getData(gnodes[map[f3]]).level;\n\t\t\tlevel2 = g.getData(gnodes[map[f5]]).level;\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t  gnodes[map[f3]])) = 3;\/\/back edges to determine fanins -> wt. = 3\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t  gnodes[map[f5]])) = 3;\/\/back edges to determins fanins -> wt. = 3\n\t\t}\n\t\n\t\telse\n\t\t{\tsize_t invert = fields[3].find_first_of(\"~\");\n\t\t\tif (invert != string::npos){\n\t\t\t\tf3 = f3.substr(1,f3.length());\n\t\t\t\t\/\/addEdge(src,dest)\n\t\t\t\t\/\/remove the '~' from the start of string\n\t\t\t\t\/\/map[string] returns node index to find which node\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f3]],gnodes[map[f1]])) = 2;\/\/\n\t\t\t\tlevel1 = g.getData(gnodes[map[f3]]).level;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t\t\t  gnodes[map[f3]])) = 3;\/\/ Back edges to determine fanins -> wt. = 3\n\t\t\t}\n\t\t\telse{\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f3]],gnodes[map[f1]])) = 1;\n\t\t\t\tlevel1 = g.getData(gnodes[map[f3]]).level;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t\t  gnodes[map[f3]])) = 3;\/\/ Back edges to determine fanins -> wt. = 3\n\n\t\t\t}\n\t\t\tinvert = fields[5].find_first_of(\"~\");\n\t\t\tif (invert != string::npos){\n\t\t\t\tf5 = f5.substr(1,f5.length()-2);\n\t\t\t\t\/\/remove first and last char b\/c '~' to start and ';' at th\n\t\t\t\t\/\/cout <<fields[5] << \" substr\"<<fields[5].substr(1,fields[5].length()-1)<<\" \"<<map[fields[5].substr(1,fields[5].length()-1)]<< \" \"<< nodes[map[fields[5].substr(1,fields[5].length()-1)]].label_type <<endl;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f5]],gnodes[map[f1]])) = 2;\n\t\t\t\tlevel2 = g.getData(gnodes[map[f5]]).level;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t\t  gnodes[map[f5]])) = 3;\/\/ Back edges to determine fanins -> wt. = 3\n\t\t\t}\n\t\t\telse{\n\t\t\t\tf5 = f5.substr(0,f5.length()-1);\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f5]],gnodes[map[f1]])) = 1;\n\t\t\t\tlevel2 = g.getData(gnodes[map[f5]]).level;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t\t  gnodes[map[f5]])) = 3;\/\/ Back edges to determine fanins -> wt. = 3\n\t\t\t}\n\t\t}\n\n\tif(level1>=level2)\n\t\tg.getData(gnodes[map[fields[1]]]).level= level1+1;\n\telse\n\t\tg.getData(gnodes[map[fields[1]]]).level= level2+1;\n\t}\n\n\t}\n}\n\nint main(int argc, char *argv[]) {\n\tunordered_map <string, int> map;\n\tif ( argc != 2 )\n    \t\tcout<<\"usage: \"<< argv[0] <<\" <filename>\\n\";\n  \telse\n  \t\t\tparseFileintoGraph(argv[1],map);\n\n\t\/\/cout << g.getData(gnodes[0]).label_type << endl;\n\t\/\/ Traverse graph\n \t\/\/for (Graph::iterator ii = g.begin(), ei = g.end(); ii != ei; ++ii) {\n\tfor ( Graph::GraphNode src : g){\n   \t\t\/\/Graph::GraphNode src = *ii;\n\t\tcout <<\"src: \"<< g.getData(src).label_type;\n\t\tcout <<\" level: \"<<g.getData(src).level;\n\n\t\tfor (Graph::edge_iterator edge : g.out_edges(src)) {\n   \t\t\tGraph::GraphNode dst = g.getEdgeDst(edge);\n     \t\tcout <<\" dest: \"<< g.getData(dst).label_type;\n     \t\tint edgeData = g.getEdgeData(edge);\n     \t\tcout << \" edge data \" << edgeData;\n     \t\t\/\/assert(edgeData == 5);\n   \t\t}\n\t   \tcout <<endl;\n \t}\n \tif(checkWorkability(gnodes[map[\"n15\"]]))\n \t\tcout << \"1 output\"<<endl;\n \telse\n \t\tcout <<\"more than 1 output\"<<endl;\n\n\treturn 0;\n}\n<commit_msg>Added function:find_cut - returns the child nodes which are part of the cut TO DO: Use check_workability<commit_after>\n#include <iostream>\n#include <unordered_map>\n#include <boost\/algorithm\/string.hpp>\n#include <vector>\n#include <Galois\/Galois.h>\n#include <Galois\/Graph\/Graph.h>\n\n\/\/#include <cstring>\n#include <string>\n#include <fstream>\nusing namespace std;\nusing namespace boost;\n\ntypedef enum{pi,po,nd} node_type;\n\nstruct Node {\n string label_type;\/\/a0,b0...\n node_type type;\/\/ pi,po,nd\n int fanins; \/\/ Not required as of now\n bool fanout; \/\/Not required as of now\n int level;\n };\n\ntypedef Galois::Graph::FirstGraph<Node,int,true> Graph;\n\nGraph g;\n\nint node_index = 0;\nvector<Graph::GraphNode> gnodes;\n\nvector<string> fields;\n\nbool checkWorkability(Graph::GraphNode gnode){\n\tint count = 0;\n\tfor (Graph::edge_iterator edge : g.out_edges(gnode)) {\n\t\tint edgedata = g.getEdgeData(edge);\n\t   \tif(edgedata == 1|| edgedata ==2)\n\t   \t\tcount++;\n\t   \t}\n\tif (count > 1)\n\t\treturn false;\n\telse\n\t\treturn true;\n}\n\nbool find_cut(Graph::GraphNode &top,Graph::GraphNode &child_left,Graph::GraphNode &child_right)\n{\n\tif ( g.getData(top).level != 0 && g.getData(top).level != 1) {\n\t\tfor (Graph::edge_iterator edge : g.out_edges(top)){\n\t\t\tGraph::GraphNode dst = g.getEdgeDst(edge);\n\t\t\tif(g.getEdgeData(edge) == 3){\t\n\t\t\t\tif(child_left==NULL){\n\t\t\t\t\tchild_left=dst;\n\t\t\t\t}\t\n\t\t\t\telse{\n\t\t\t\t\tchild_right=dst;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn true;\t\t\t\n\t}\n\telse \n\t\treturn false;\n}\n\nvoid parseFileintoGraph(string inFile, unordered_map <string, int> &map){\n\tifstream fin;\n\tfin.open(inFile); \/\/ open a file\n\tif (!fin.good()){\n\t\tcout << \"file not found\\n\";\n\n\t}\n\telse\n\t\/\/ read each line of the file\n\twhile (!fin.eof())\n\t{\n\t\/\/ read an entire line into memory\n\tstring line;\n\tgetline(fin,line);\n\ttrim(line);\n\tsplit(fields, line, is_any_of(\" \"));\n\tNode n;\n\tif(fields[0].compare(\"input\") == 0 || fields[0].compare(\"output\") == 0||fields[0].compare(\"wire\") == 0)\n\t{\n\t\tfor(unsigned i =1;i<fields.size();i++){\n\t\t\t\/\/add to hash map to index to corresponding node in array\n\t\t\tif(fields[i].size()>1)\n\t\t\t{\n\t\t\t\t\/\/Add data to each node for level and type of input\n\t\t\t\tif(fields[0].compare(\"input\") == 0)\n\t\t\t\t{\n\t\t\t\t\tn.type = pi;\n\t\t\t\t\tn.level = 0;\n\t\t\t\t\tn.label_type = fields[i].substr(0,fields[i].length()-1);\n\n\t\t\t\t\t\/\/nodes[node_index].type = pi;\n\t\t\t\t\t\/\/nodes[node_index].level = 0;\n\t\t\t\t\t\/\/nodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\tif(fields[0].compare(\"output\") == 0)\n\t\t\t\t{\n\t\t\t\t\tn.type = po;\n\t\t\t\t\tn.level = -1;\n\t\t\t\t\tn.label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t\t\/\/nodes[node_index].type = po;\n\t\t\t\t\t\/\/nodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\tif(fields[0].compare(\"wire\") == 0)\n\t\t\t\t{\n\t\t\t\t\tn.type = nd;\n\t\t\t\t\tn.level = -2;\n\t\t\t\t\tn.label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t\t\/\/nodes[node_index].type = nd;\n\t\t\t\t\t\/\/nodes[node_index].label_type = fields[i].substr(0,fields[i].length()-1);\n\t\t\t\t}\n\t\t\t\t\/\/remove last char b\/c its ',' or ';'\n\t\t\t\tmap[fields[i].substr(0,fields[i].length()-1)] = node_index;\n\t\t\t\t\/\/gnodes[node_index] = g.createNode(nodes[node_index]);\n\t\t\t\tgnodes.push_back(g.createNode(n));\n\n\t\t\t\tg.addNode(gnodes[gnodes.size()-1]);\n\t\t\t\t\/\/cout << \"node index: \"<< node_index<<endl;\n\t\t\t\tnode_index++;\n\t\t\t}\n\n\t\t}\n\t}\n\t\/\/cout <<\"compare assign\"<<endl;\n\tif(fields[0].compare(\"assign\") == 0)\n\t{\n\t\tint level1,level2;\n\t\tstring f1,f3,f5;\n\t\tf1 = fields[1];\n\t\tf3 = fields[3];\n\t\tf5 = fields[5];\n\t\tif(fields[4].compare(\"|\") == 0)\n\t\t{\t\/\/Edge weight: 2- Negative 1 - Positive\n\t\t\tf3 = f3.substr(0,f3.length());\n\t\t\tf5 = f5.substr(0,f5.length()-1);\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f3]]\/\/src\n\t\t\t\t\t\t\t\t\t\t   ,gnodes[map[f1]])) = 2;\/\/dest\n\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f5]]\n\t\t\t\t\t\t\t\t\t\t   ,gnodes[map[f1]])) = 2;\n\n\t\t\tlevel1 = g.getData(gnodes[map[f3]]).level;\n\t\t\tlevel2 = g.getData(gnodes[map[f5]]).level;\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t  gnodes[map[f3]])) = 3;\/\/back edges to determine fanins -> wt. = 3\n\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t  gnodes[map[f5]])) = 3;\/\/back edges to determins fanins -> wt. = 3\n\t\t}\n\t\n\t\telse\n\t\t{\tsize_t invert = fields[3].find_first_of(\"~\");\n\t\t\tif (invert != string::npos){\n\t\t\t\tf3 = f3.substr(1,f3.length());\n\t\t\t\t\/\/addEdge(src,dest)\n\t\t\t\t\/\/remove the '~' from the start of string\n\t\t\t\t\/\/map[string] returns node index to find which node\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f3]],gnodes[map[f1]])) = 2;\/\/\n\t\t\t\tlevel1 = g.getData(gnodes[map[f3]]).level;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t\t\t  gnodes[map[f3]])) = 3;\/\/ Back edges to determine fanins -> wt. = 3\n\t\t\t}\n\t\t\telse{\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f3]],gnodes[map[f1]])) = 1;\n\t\t\t\tlevel1 = g.getData(gnodes[map[f3]]).level;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t\t  gnodes[map[f3]])) = 3;\/\/ Back edges to determine fanins -> wt. = 3\n\n\t\t\t}\n\t\t\tinvert = fields[5].find_first_of(\"~\");\n\t\t\tif (invert != string::npos){\n\t\t\t\tf5 = f5.substr(1,f5.length()-2);\n\t\t\t\t\/\/remove first and last char b\/c '~' to start and ';' at th\n\t\t\t\t\/\/cout <<fields[5] << \" substr\"<<fields[5].substr(1,fields[5].length()-1)<<\" \"<<map[fields[5].substr(1,fields[5].length()-1)]<< \" \"<< nodes[map[fields[5].substr(1,fields[5].length()-1)]].label_type <<endl;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f5]],gnodes[map[f1]])) = 2;\n\t\t\t\tlevel2 = g.getData(gnodes[map[f5]]).level;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t\t  gnodes[map[f5]])) = 3;\/\/ Back edges to determine fanins -> wt. = 3\n\t\t\t}\n\t\t\telse{\n\t\t\t\tf5 = f5.substr(0,f5.length()-1);\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f5]],gnodes[map[f1]])) = 1;\n\t\t\t\tlevel2 = g.getData(gnodes[map[f5]]).level;\n\t\t\t\tg.getEdgeData(g.addEdge(gnodes[map[f1]],\n\t\t\t\t\t\t  gnodes[map[f5]])) = 3;\/\/ Back edges to determine fanins -> wt. = 3\n\t\t\t}\n\t\t}\n\n\tif(level1>=level2)\n\t\tg.getData(gnodes[map[fields[1]]]).level= level1+1;\n\telse\n\t\tg.getData(gnodes[map[fields[1]]]).level= level2+1;\n\t}\n\n\t}\n}\n\nint main(int argc, char *argv[]) {\n\tunordered_map <string, int> map;\n\tif ( argc != 2 )\n    \t\tcout<<\"usage: \"<< argv[0] <<\" <filename>\\n\";\n  \telse\n  \t\t\tparseFileintoGraph(argv[1],map);\n\n\t\/\/cout << g.getData(gnodes[0]).label_type << endl;\n\t\/\/ Traverse graph\n \t\/\/for (Graph::iterator ii = g.begin(), ei = g.end(); ii != ei; ++ii) {\n\tfor ( Graph::GraphNode src : g){\n   \t\t\/\/Graph::GraphNode src = *ii;\n\t\tcout <<\"src: \"<< g.getData(src).label_type;\n\t\tcout <<\" level: \"<<g.getData(src).level;\n\n\t\tfor (Graph::edge_iterator edge : g.out_edges(src)) {\n   \t\t\tGraph::GraphNode dst = g.getEdgeDst(edge);\n     \t\tcout <<\" dest: \"<< g.getData(dst).label_type;\n     \t\tint edgeData = g.getEdgeData(edge);\n     \t\tcout << \" edge data \" << edgeData;\n     \t\t\/\/assert(edgeData == 5);\n   \t\t}\n\t   \tcout <<endl;\n \t}\n \tif(checkWorkability(gnodes[map[\"n15\"]]))\n \t\tcout << \"1 output\"<<endl;\n \telse\n \t\tcout <<\"more than 1 output\"<<endl;\n\n\tbool out;\n\tGraph::GraphNode child_left=NULL,child_right=NULL;\n\tif(find_cut(gnodes[map[\"s0\"]],child_left,child_right)){\n\t\tcout<<\"Src node:\"<<g.getData(gnodes[map[\"s0\"]]).label_type << endl;\n\t\tcout<<\"Child node 1:\"<<g.getData(child_left).label_type << endl;\n\t\tcout<<\"Child node 2:\"<<g.getData(child_right).label_type << endl;\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/..\/..\/..\/..\/platform\/http_thread_callback.hpp\"\n\n#include \"..\/core\/jni_helper.hpp\"\n\n#include \"..\/maps\/DownloadUI.hpp\"\n\n#include \"Platform.hpp\"\n\nclass HttpThread\n{\nprivate:\n  jobject m_self;\n\npublic:\n  HttpThread(string const & url,\n             downloader::IHttpThreadCallback & cb,\n             int64_t beg,\n             int64_t end,\n             int64_t expectedFileSize,\n             string const & pb)\n  {\n    \/\/\/ should create java object here.\n    JNIEnv * env = jni::GetEnv();\n\n    jclass klass = env->FindClass(\"com\/mapswithme\/maps\/downloader\/DownloadChunkTask\");\n    ASSERT(klass, (\"Can't find java class com\/mapswithme\/maps\/downloader\/DownloadChunkTask\"));\n\n    jmethodID methodId = env->GetMethodID(klass, \"<init>\", \"(JLjava\/lang\/String;JJJLjava\/lang\/String;Ljava\/lang\/String;)V\");\n    ASSERT(methodId, (\"Can't find java constructor in com\/mapswithme\/maps\/downloader\/DownloadChunkTask\"));\n\n    \/\/ User id is always the same, so do not waste time on every chunk call\n    static string uniqueUserId = GetPlatform().UniqueClientId();\n\n    m_self = env->NewGlobalRef(env->NewObject(klass, methodId, reinterpret_cast<jlong>(&cb),\n        env->NewStringUTF(url.c_str()), beg, end, expectedFileSize, env->NewStringUTF(pb.c_str()),\n        env->NewStringUTF(uniqueUserId.c_str())));\n\n    methodId = env->GetMethodID(klass, \"start\", \"()V\");\n    ASSERT(methodId, (\"Can't find java method 'start' in com\/mapswithme\/maps\/downloader\/DownloadChunkTask\"));\n\n    env->CallVoidMethod(m_self, methodId);\n  }\n\n  ~HttpThread()\n  {\n    JNIEnv * env = jni::GetEnv();\n    jmethodID methodId = jni::GetJavaMethodID(env, m_self, \"cancel\", \"(Z)Z\");\n    ASSERT(methodId, (\"Can't find java method 'cancel' in com\/mapswithme\/maps\/downloader\/DownloadChunkTask\"));\n\n    env->CallBooleanMethod(m_self, methodId, false);\n    env->DeleteGlobalRef(m_self);\n  }\n};\n\nnamespace downloader\n{\n  HttpThread * CreateNativeHttpThread(string const & url,\n                                      downloader::IHttpThreadCallback & cb,\n                                      int64_t beg,\n                                      int64_t end,\n                                      int64_t size,\n                                      string const & pb)\n  {\n    return new HttpThread(url, cb, beg, end, size, pb);\n  }\n\n  void DeleteNativeHttpThread(HttpThread * request)\n  {\n    delete request;\n  }\n\n} \/\/ namespace downloader\n\nextern \"C\"\n{\n  JNIEXPORT void JNICALL\n  Java_com_mapswithme_maps_downloader_DownloadChunkTask_onWrite(JNIEnv * env, jobject thiz,\n      jlong httpCallbackID, jlong beg, jbyteArray data, jlong size)\n  {\n    downloader::IHttpThreadCallback * cb = reinterpret_cast<downloader::IHttpThreadCallback*>(httpCallbackID);\n    jbyte * buf = env->GetByteArrayElements(data, 0);\n    cb->OnWrite(beg, buf, size);\n    env->ReleaseByteArrayElements(data, buf, 0);\n  }\n\n  JNIEXPORT void JNICALL\n  Java_com_mapswithme_maps_downloader_DownloadChunkTask_onFinish(JNIEnv * env, jobject thiz,\n      jlong httpCallbackID, jlong httpCode, jlong beg, jlong end)\n  {\n    downloader::IHttpThreadCallback * cb = reinterpret_cast<downloader::IHttpThreadCallback*>(httpCallbackID);\n    cb->OnFinish(httpCode, beg, end);\n  }\n}\n<commit_msg>fixed compilation error.<commit_after>#include \"..\/..\/..\/..\/..\/platform\/http_thread_callback.hpp\"\n\n#include \"..\/core\/jni_helper.hpp\"\n\n#include \"Platform.hpp\"\n\nclass HttpThread\n{\nprivate:\n  jobject m_self;\n\npublic:\n  HttpThread(string const & url,\n             downloader::IHttpThreadCallback & cb,\n             int64_t beg,\n             int64_t end,\n             int64_t expectedFileSize,\n             string const & pb)\n  {\n    \/\/\/ should create java object here.\n    JNIEnv * env = jni::GetEnv();\n\n    jclass klass = env->FindClass(\"com\/mapswithme\/maps\/downloader\/DownloadChunkTask\");\n    ASSERT(klass, (\"Can't find java class com\/mapswithme\/maps\/downloader\/DownloadChunkTask\"));\n\n    jmethodID methodId = env->GetMethodID(klass, \"<init>\", \"(JLjava\/lang\/String;JJJLjava\/lang\/String;Ljava\/lang\/String;)V\");\n    ASSERT(methodId, (\"Can't find java constructor in com\/mapswithme\/maps\/downloader\/DownloadChunkTask\"));\n\n    \/\/ User id is always the same, so do not waste time on every chunk call\n    static string uniqueUserId = GetPlatform().UniqueClientId();\n\n    m_self = env->NewGlobalRef(env->NewObject(klass, methodId, reinterpret_cast<jlong>(&cb),\n        env->NewStringUTF(url.c_str()), beg, end, expectedFileSize, env->NewStringUTF(pb.c_str()),\n        env->NewStringUTF(uniqueUserId.c_str())));\n\n    methodId = env->GetMethodID(klass, \"start\", \"()V\");\n    ASSERT(methodId, (\"Can't find java method 'start' in com\/mapswithme\/maps\/downloader\/DownloadChunkTask\"));\n\n    env->CallVoidMethod(m_self, methodId);\n  }\n\n  ~HttpThread()\n  {\n    JNIEnv * env = jni::GetEnv();\n    jmethodID methodId = jni::GetJavaMethodID(env, m_self, \"cancel\", \"(Z)Z\");\n    ASSERT(methodId, (\"Can't find java method 'cancel' in com\/mapswithme\/maps\/downloader\/DownloadChunkTask\"));\n\n    env->CallBooleanMethod(m_self, methodId, false);\n    env->DeleteGlobalRef(m_self);\n  }\n};\n\nnamespace downloader\n{\n  HttpThread * CreateNativeHttpThread(string const & url,\n                                      downloader::IHttpThreadCallback & cb,\n                                      int64_t beg,\n                                      int64_t end,\n                                      int64_t size,\n                                      string const & pb)\n  {\n    return new HttpThread(url, cb, beg, end, size, pb);\n  }\n\n  void DeleteNativeHttpThread(HttpThread * request)\n  {\n    delete request;\n  }\n\n} \/\/ namespace downloader\n\nextern \"C\"\n{\n  JNIEXPORT void JNICALL\n  Java_com_mapswithme_maps_downloader_DownloadChunkTask_onWrite(JNIEnv * env, jobject thiz,\n      jlong httpCallbackID, jlong beg, jbyteArray data, jlong size)\n  {\n    downloader::IHttpThreadCallback * cb = reinterpret_cast<downloader::IHttpThreadCallback*>(httpCallbackID);\n    jbyte * buf = env->GetByteArrayElements(data, 0);\n    cb->OnWrite(beg, buf, size);\n    env->ReleaseByteArrayElements(data, buf, 0);\n  }\n\n  JNIEXPORT void JNICALL\n  Java_com_mapswithme_maps_downloader_DownloadChunkTask_onFinish(JNIEnv * env, jobject thiz,\n      jlong httpCallbackID, jlong httpCode, jlong beg, jlong end)\n  {\n    downloader::IHttpThreadCallback * cb = reinterpret_cast<downloader::IHttpThreadCallback*>(httpCallbackID);\n    cb->OnFinish(httpCode, beg, end);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\/\n\/*  Copyright (c) 2015, Karl Pauwels                                         *\/\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\/*                                                                           *\/\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. 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      *\/\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 <d_multiple_rigid_pose_sparse.h>\n#include <GL\/gl.h>\n#include <sys\/time.h>\n#include <cstdio>\n#include <stdexcept>\n#include <H5Cpp.h>\n#include <hdf5_file.h>\n#include <utilities.h>\n#include <Eigen\/Dense>\n#include <opencv2\/calib3d\/calib3d.hpp>\n\nnamespace pose {\n\nD_MultipleRigidPoseSparse::D_MultipleRigidPoseSparse(\n    int n_cols, int n_rows, float nodal_point_x, float nodal_point_y,\n    float focal_length_x, float focal_length_y, int device_id, int vec_size,\n    int num_iter_ransac)\n    : _running{true}, _n_objects{0}, _num_iter_ransac{num_iter_ransac},\n      _max_matches{50000}, _DESCRIPTOR_LENGTH{128},\n      _siftEngine{std::unique_ptr<SiftGPU>{new SiftGPU()}},\n      _matcherEngine{\n          std::unique_ptr<SiftMatchGPU>{new SiftMatchGPU(4096 * vec_size)}} {\n  _camera_mat.create(3, 3, CV_32F);\n  updateCalibration(n_cols, n_rows, nodal_point_x, nodal_point_y,\n                    focal_length_x, focal_length_y);\n\n  char device_id_str[2];\n  sprintf(device_id_str, \"%d\", device_id);\n\n  \/\/ allow for full hd with upscaling (2*1920 = 3840)\n  \/\/ allow for 3K with upscaling (2*2304 = 4608)\n  const char *argv_template[] = {\"-m\",          \"-fo\",   \"-1\",    \"-s\",\n                                 \"-v\",          \"0\",     \"-pack\", \"-cuda\",\n                                 device_id_str, \"-maxd\", \"4608\"};\n  int argc = sizeof(argv_template) \/ sizeof(char *);\n\n  char *argv[argc];\n  for (int i = 0; i < argc; i++)\n    argv[i] = strdup(argv_template[i]);\n\n  _siftEngine->ParseParam(argc, argv);\n\n  for (int i = 0; i < argc; i++)\n    free(argv[i]);\n\n  if (_siftEngine->CreateContextGL() != SiftGPU::SIFTGPU_FULL_SUPPORTED)\n    throw std::runtime_error(\"D_MultipleRigidPoseSparse::D_\"\n                             \"MultipleRigidPoseSparse: SiftGPU cannot create \"\n                             \"GL contex\\n\");\n\n  _matcherEngine->VerifyContextGL();\n  _match_buffer.resize(_max_matches * 2);\n}\n\nvoid D_MultipleRigidPoseSparse::updateCalibration(int n_cols, int n_rows,\n                                                  float nodal_point_x,\n                                                  float nodal_point_y,\n                                                  float focal_length_x,\n                                                  float focal_length_y) {\n  _n_cols = n_cols;\n  _n_rows = n_rows;\n\n  \/\/ probably wrong!\n  _camera_mat.at<float>(0, 0) = focal_length_x;\n  _camera_mat.at<float>(0, 1) = 0.f;\n  _camera_mat.at<float>(0, 2) = nodal_point_x - _n_cols \/ 2.0;\n\n  _camera_mat.at<float>(1, 0) = 0.f;\n  _camera_mat.at<float>(1, 1) = focal_length_y;\n  _camera_mat.at<float>(1, 2) = nodal_point_y - _n_rows \/ 2.0;\n\n  _camera_mat.at<float>(2, 0) = 0.f;\n  _camera_mat.at<float>(2, 1) = 0.f;\n  _camera_mat.at<float>(2, 2) = 1.f;\n}\n\nvoid D_MultipleRigidPoseSparse::addModel(const char *obj_filename) {\n  _n_objects++;\n\n  \/\/ Read from HDF5-file\n  std::vector<float> descriptors, positions;\n  std::vector<int> d_size, p_size;\n  util::HDF5File f(obj_filename);\n  f.readArray(\"descriptors\", descriptors, d_size);\n  f.readArray(\"positions\", positions, p_size);\n\n  if (d_size.size() != 2)\n    throw std::runtime_error(\"D_MultipleRigidPoseSparse::addModel: descriptors \"\n                             \"field should be 2D\\n\");\n  if (d_size.at(1) != _DESCRIPTOR_LENGTH)\n    throw std::runtime_error(std::string(\n        \"D_MultipleRigidPoseSparse::addModel: descriptors should be \" +\n        std::to_string(_DESCRIPTOR_LENGTH) + \"-dimensional\\n\"));\n  if (p_size.size() != 2)\n    throw std::runtime_error(\n        \"D_MultipleRigidPoseSparse::addModel: positions field should be 2D\\n\");\n  if (p_size.at(1) != 3)\n    throw std::runtime_error(\"D_MultipleRigidPoseSparse::addModel: positions \"\n                             \"should be 3-dimensional\\n\");\n  if (d_size.at(0) != p_size.at(0))\n    throw std::runtime_error(\"D_MultipleRigidPoseSparse::addModel: different \"\n                             \"number of positions and descriptors\\n\");\n\n  ModelAssets model;\n  model.model_size = d_size.at(0);\n\n  for (int i = 0; i < model.model_size; i++) {\n    SiftGPU::SiftKeypoint position;\n    position.x = positions.at(i * 3);\n    position.y = positions.at(i * 3 + 1);\n    position.s = positions.at(i * 3 + 2);\n    position.o = 0;\n    model.positions.push_back(position);\n  }\n\n  model.descriptors = descriptors;\n\n  _allModels.push_back(model);\n}\n\nvoid D_MultipleRigidPoseSparse::removeAllModels() {\n  _allModels.clear();\n  _n_objects = 0;\n}\n\nTranslationRotation3D\nD_MultipleRigidPoseSparse::estimatePoseSpecificObject(const cv::Mat &image,\n                                                      const int object) {\n  return estimatePose(image, object);\n}\n\nTranslationRotation3D\nD_MultipleRigidPoseSparse::estimatePoseRandomObject(const cv::Mat &image,\n                                                    int &object) {\n  double obj_probabilities[_n_objects];\n  for (int i = 0; i < _n_objects; i++)\n    obj_probabilities[i] = 1.0 \/ (double)_n_objects;\n\n  double r = ((double)rand() \/ double(RAND_MAX));\n\n  object = 0;\n  double prob_ulim = obj_probabilities[object];\n\n  while (r > prob_ulim) {\n    object++;\n    prob_ulim += obj_probabilities[object];\n  }\n\n  \/\/  printf(\"%d -- %2.4f -- %2.4f %2.4f\n  \/\/ %d!!!!\\n\",_n_objects,r,obj_probabilities[0],obj_probabilities[1],object);\n\n  return estimatePose(image, object);\n}\n\nTranslationRotation3D\nD_MultipleRigidPoseSparse::estimatePose(const cv::Mat &image, int object) {\n\n  TranslationRotation3D currPose;\n\n  if (_running) {\n\n    ModelAssets &model = _allModels.at(object);\n\n    _siftEngine->RunSIFT(_n_cols, _n_rows, image.data, GL_LUMINANCE,\n                         GL_UNSIGNED_BYTE);\n\n    int n_image_features = _siftEngine->GetFeatureNum();\n\n    std::vector<float> img_feature_descriptors(_DESCRIPTOR_LENGTH *\n                                               n_image_features);\n    std::vector<SiftGPU::SiftKeypoint> img_positions(n_image_features);\n\n    _siftEngine->GetFeatureVector(img_positions.data(),\n                                  img_feature_descriptors.data());\n\n    const unsigned long long one_d_texture_limit = 134217728;\n    if (static_cast<unsigned long long>(model.model_size) *\n            static_cast<unsigned long long>(n_image_features) >\n        one_d_texture_limit) {\n\n      \/\/ shuffling and downsampling image keypoints\n      int max_n_image_features = one_d_texture_limit \/ model.model_size - 1;\n\n      \/\/      std::cout << \"going to match \" << model.model_size << \" model to \"\n      \/\/                << n_image_features << \" image features - max allowed\n      \/\/ image = \"\n      \/\/                << max_n_image_features << std::endl;\n\n      std::vector<int> shuffle_inds(n_image_features);\n      std::iota(shuffle_inds.begin(), shuffle_inds.end(), 0);\n      std::random_shuffle(shuffle_inds.begin(), shuffle_inds.end());\n\n      Eigen::Map<Eigen::VectorXi> shuffle_inds_eig(shuffle_inds.data(),\n                                                   n_image_features);\n      Eigen::Map<Eigen::MatrixXf> all_keypoints_eig(\n          (float *)img_positions.data(), 4, n_image_features);\n      Eigen::Map<Eigen::MatrixXf> all_descriptors_eig(\n          img_feature_descriptors.data(), _DESCRIPTOR_LENGTH, n_image_features);\n\n      Eigen::PermutationMatrix<Eigen::Dynamic, Eigen::Dynamic, int> p(\n          shuffle_inds_eig);\n      all_keypoints_eig = all_keypoints_eig * p;\n      all_descriptors_eig = all_descriptors_eig * p;\n\n      n_image_features = max_n_image_features;\n    }\n\n    _matcherEngine->SetDescriptors(0, model.model_size,\n                                   model.descriptors.data()); \/\/ model\n    _matcherEngine->SetDescriptors(1, n_image_features,\n                                   img_feature_descriptors.data()); \/\/ image\n\n    \/\/ match and get result\n    int num_match = _matcherEngine->GetSiftMatch(\n        _max_matches, (int(*)[2])_match_buffer.data());\n\n    \/\/ compute pnp\n    std::vector<cv::Point3f> objectPoints;\n    std::vector<cv::Point2f> imagePoints;\n\n    for (int i = 0; i < num_match; i++) {\n      SiftGPU::SiftKeypoint &objectKey =\n          model.positions[_match_buffer.at(i * 2)];\n      SiftGPU::SiftKeypoint &imageKey =\n          img_positions[_match_buffer.at(i * 2 + 1)];\n\n      cv::Point2f imagePoint(imageKey.x - _n_cols \/ 2,\n                             imageKey.y - _n_rows \/ 2);\n      cv::Point3f objectPoint(objectKey.x, objectKey.y, objectKey.s);\n\n      objectPoints.push_back(objectPoint);\n      imagePoints.push_back(imagePoint);\n    }\n\n    const float max_dist = 1.0; \/\/ 1.0F\n\n    cv::Mat rvec, tvec;\n    std::vector<int> inliers_cpu;\n    if (objectPoints.size() > 4) {\n      cv::solvePnPRansac(objectPoints, imagePoints, _camera_mat,\n                         cv::Mat::zeros(1, 8, CV_32F), rvec, tvec, false,\n                         _num_iter_ransac, max_dist, objectPoints.size(),\n                         inliers_cpu, CV_P3P);\n      double T[] = {tvec.at<double>(0, 0), tvec.at<double>(0, 1),\n                    tvec.at<double>(0, 2)};\n      double R[] = {rvec.at<double>(0, 0), rvec.at<double>(0, 1),\n                    rvec.at<double>(0, 2)};\n      currPose = TranslationRotation3D(T, R);\n    }\n\n    \/\/ require at least one inlier for the estimate to be valid (apart from the\n    \/\/ four points used to estimate pose)\n    currPose.setValid(currPose.isFinite() && (inliers_cpu.size() >= 5));\n\n    \/\/ if (currPose.isValid()) {\n    \/\/   currPose.showCompact();\n    \/\/   std::cout << \"inliers: \" << inliers_cpu.size() << \"\/\"\n    \/\/             << objectPoints.size() << std::endl << std::endl;\n    \/\/ }\n\n    \/\/    double pnp_time = timer.read();\n\n    \/\/    std::cout << std::setprecision(2);\n    \/\/    std::cout << \"extract: \" << extract_time << \" match: \" << match_time\n    \/\/              << \" pnp: \" << pnp_time << std::endl;\n  }\n\n  return (currPose);\n}\n}\n<commit_msg>Fixed issue with opencv3 solvePnPRansac<commit_after>\/*****************************************************************************\/\n\/*  Copyright (c) 2015, Karl Pauwels                                         *\/\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\/*                                                                           *\/\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. 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      *\/\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 <d_multiple_rigid_pose_sparse.h>\n#include <GL\/gl.h>\n#include <sys\/time.h>\n#include <cstdio>\n#include <stdexcept>\n#include <H5Cpp.h>\n#include <hdf5_file.h>\n#include <utilities.h>\n#include <Eigen\/Dense>\n#include <opencv2\/calib3d\/calib3d.hpp>\n\nnamespace pose {\n\nD_MultipleRigidPoseSparse::D_MultipleRigidPoseSparse(\n    int n_cols, int n_rows, float nodal_point_x, float nodal_point_y,\n    float focal_length_x, float focal_length_y, int device_id, int vec_size,\n    int num_iter_ransac)\n    : _running{true}, _n_objects{0}, _num_iter_ransac{num_iter_ransac},\n      _max_matches{50000}, _DESCRIPTOR_LENGTH{128},\n      _siftEngine{std::unique_ptr<SiftGPU>{new SiftGPU()}},\n      _matcherEngine{\n          std::unique_ptr<SiftMatchGPU>{new SiftMatchGPU(4096 * vec_size)}} {\n  _camera_mat.create(3, 3, CV_64F);\n  updateCalibration(n_cols, n_rows, nodal_point_x, nodal_point_y,\n                    focal_length_x, focal_length_y);\n\n  char device_id_str[2];\n  sprintf(device_id_str, \"%d\", device_id);\n\n  \/\/ allow for full hd with upscaling (2*1920 = 3840)\n  \/\/ allow for 3K with upscaling (2*2304 = 4608)\n  const char *argv_template[] = {\"-m\",          \"-fo\",   \"-1\",    \"-s\",\n                                 \"-v\",          \"0\",     \"-pack\", \"-cuda\",\n                                 device_id_str, \"-maxd\", \"4608\"};\n  int argc = sizeof(argv_template) \/ sizeof(char *);\n\n  char *argv[argc];\n  for (int i = 0; i < argc; i++)\n    argv[i] = strdup(argv_template[i]);\n\n  _siftEngine->ParseParam(argc, argv);\n\n  for (int i = 0; i < argc; i++)\n    free(argv[i]);\n\n  if (_siftEngine->CreateContextGL() != SiftGPU::SIFTGPU_FULL_SUPPORTED)\n    throw std::runtime_error(\"D_MultipleRigidPoseSparse::D_\"\n                             \"MultipleRigidPoseSparse: SiftGPU cannot create \"\n                             \"GL contex\\n\");\n\n  _matcherEngine->VerifyContextGL();\n  _match_buffer.resize(_max_matches * 2);\n}\n\nvoid D_MultipleRigidPoseSparse::updateCalibration(int n_cols, int n_rows,\n                                                  float nodal_point_x,\n                                                  float nodal_point_y,\n                                                  float focal_length_x,\n                                                  float focal_length_y) {\n  _n_cols = n_cols;\n  _n_rows = n_rows;\n\n  _camera_mat.at<double>(0, 0) = focal_length_x;\n  _camera_mat.at<double>(0, 1) = 0.f;\n  _camera_mat.at<double>(0, 2) = nodal_point_x;\n\n  _camera_mat.at<double>(1, 0) = 0.f;\n  _camera_mat.at<double>(1, 1) = focal_length_y;\n  _camera_mat.at<double>(1, 2) = nodal_point_y;\n\n  _camera_mat.at<double>(2, 0) = 0.f;\n  _camera_mat.at<double>(2, 1) = 0.f;\n  _camera_mat.at<double>(2, 2) = 1.f;\n}\n\nvoid D_MultipleRigidPoseSparse::addModel(const char *obj_filename) {\n  _n_objects++;\n\n  \/\/ Read from HDF5-file\n  std::vector<float> descriptors, positions;\n  std::vector<int> d_size, p_size;\n  util::HDF5File f(obj_filename);\n  f.readArray(\"descriptors\", descriptors, d_size);\n  f.readArray(\"positions\", positions, p_size);\n\n  if (d_size.size() != 2)\n    throw std::runtime_error(\"D_MultipleRigidPoseSparse::addModel: descriptors \"\n                             \"field should be 2D\\n\");\n  if (d_size.at(1) != _DESCRIPTOR_LENGTH)\n    throw std::runtime_error(std::string(\n        \"D_MultipleRigidPoseSparse::addModel: descriptors should be \" +\n        std::to_string(_DESCRIPTOR_LENGTH) + \"-dimensional\\n\"));\n  if (p_size.size() != 2)\n    throw std::runtime_error(\n        \"D_MultipleRigidPoseSparse::addModel: positions field should be 2D\\n\");\n  if (p_size.at(1) != 3)\n    throw std::runtime_error(\"D_MultipleRigidPoseSparse::addModel: positions \"\n                             \"should be 3-dimensional\\n\");\n  if (d_size.at(0) != p_size.at(0))\n    throw std::runtime_error(\"D_MultipleRigidPoseSparse::addModel: different \"\n                             \"number of positions and descriptors\\n\");\n\n  ModelAssets model;\n  model.model_size = d_size.at(0);\n\n  for (int i = 0; i < model.model_size; i++) {\n    SiftGPU::SiftKeypoint position;\n    position.x = positions.at(i * 3);\n    position.y = positions.at(i * 3 + 1);\n    position.s = positions.at(i * 3 + 2);\n    position.o = 0;\n    model.positions.push_back(position);\n  }\n\n  model.descriptors = descriptors;\n\n  _allModels.push_back(model);\n}\n\nvoid D_MultipleRigidPoseSparse::removeAllModels() {\n  _allModels.clear();\n  _n_objects = 0;\n}\n\nTranslationRotation3D\nD_MultipleRigidPoseSparse::estimatePoseSpecificObject(const cv::Mat &image,\n                                                      const int object) {\n  return estimatePose(image, object);\n}\n\nTranslationRotation3D\nD_MultipleRigidPoseSparse::estimatePoseRandomObject(const cv::Mat &image,\n                                                    int &object) {\n  double obj_probabilities[_n_objects];\n  for (int i = 0; i < _n_objects; i++)\n    obj_probabilities[i] = 1.0 \/ (double)_n_objects;\n\n  double r = ((double)rand() \/ double(RAND_MAX));\n\n  object = 0;\n  double prob_ulim = obj_probabilities[object];\n\n  while (r > prob_ulim) {\n    object++;\n    prob_ulim += obj_probabilities[object];\n  }\n\n  \/\/  printf(\"%d -- %2.4f -- %2.4f %2.4f\n  \/\/ %d!!!!\\n\",_n_objects,r,obj_probabilities[0],obj_probabilities[1],object);\n\n  return estimatePose(image, object);\n}\n\nTranslationRotation3D\nD_MultipleRigidPoseSparse::estimatePose(const cv::Mat &image, int object) {\n\n  TranslationRotation3D currPose;\n\n  if (_running) {\n\n    ModelAssets &model = _allModels.at(object);\n\n    _siftEngine->RunSIFT(_n_cols, _n_rows, image.data, GL_LUMINANCE,\n                         GL_UNSIGNED_BYTE);\n\n    int n_image_features = _siftEngine->GetFeatureNum();\n\n    std::vector<float> img_feature_descriptors(_DESCRIPTOR_LENGTH *\n                                               n_image_features);\n    std::vector<SiftGPU::SiftKeypoint> img_positions(n_image_features);\n\n    _siftEngine->GetFeatureVector(img_positions.data(),\n                                  img_feature_descriptors.data());\n\n    const unsigned long long one_d_texture_limit = 134217728;\n    if (static_cast<unsigned long long>(model.model_size) *\n            static_cast<unsigned long long>(n_image_features) >\n        one_d_texture_limit) {\n\n      \/\/ shuffling and downsampling image keypoints\n      int max_n_image_features = one_d_texture_limit \/ model.model_size - 1;\n\n      \/\/      std::cout << \"going to match \" << model.model_size << \" model to \"\n      \/\/                << n_image_features << \" image features - max allowed\n      \/\/ image = \"\n      \/\/                << max_n_image_features << std::endl;\n\n      std::vector<int> shuffle_inds(n_image_features);\n      std::iota(shuffle_inds.begin(), shuffle_inds.end(), 0);\n      std::random_shuffle(shuffle_inds.begin(), shuffle_inds.end());\n\n      Eigen::Map<Eigen::VectorXi> shuffle_inds_eig(shuffle_inds.data(),\n                                                   n_image_features);\n      Eigen::Map<Eigen::MatrixXf> all_keypoints_eig(\n          (float *)img_positions.data(), 4, n_image_features);\n      Eigen::Map<Eigen::MatrixXf> all_descriptors_eig(\n          img_feature_descriptors.data(), _DESCRIPTOR_LENGTH, n_image_features);\n\n      Eigen::PermutationMatrix<Eigen::Dynamic, Eigen::Dynamic, int> p(\n          shuffle_inds_eig);\n      all_keypoints_eig = all_keypoints_eig * p;\n      all_descriptors_eig = all_descriptors_eig * p;\n\n      n_image_features = max_n_image_features;\n    }\n\n    _matcherEngine->SetDescriptors(0, model.model_size,\n                                   model.descriptors.data()); \/\/ model\n    _matcherEngine->SetDescriptors(1, n_image_features,\n                                   img_feature_descriptors.data()); \/\/ image\n\n    \/\/ match and get result\n    int num_match = _matcherEngine->GetSiftMatch(\n        _max_matches, (int(*)[2])_match_buffer.data());\n\n    \/\/ compute pnp\n    std::vector<cv::Point3f> objectPoints;\n    std::vector<cv::Point2f> imagePoints;\n\n    for (int i = 0; i < num_match; i++) {\n      SiftGPU::SiftKeypoint &objectKey =\n          model.positions[_match_buffer.at(i * 2)];\n      SiftGPU::SiftKeypoint &imageKey =\n          img_positions[_match_buffer.at(i * 2 + 1)];\n\n      cv::Point2f imagePoint(imageKey.x, imageKey.y);\n      cv::Point3f objectPoint(objectKey.x, objectKey.y, objectKey.s);\n\n      objectPoints.push_back(objectPoint);\n      imagePoints.push_back(imagePoint);\n    }\n\n    const float max_dist = 1.0; \/\/ 1.0F\n\n    std::vector<int> inliers_cpu;\n    cv::Mat rvec = cv::Mat::zeros(3, 1, CV_64FC1);\n    cv::Mat tvec = cv::Mat::zeros(3, 1, CV_64FC1);\n    if (objectPoints.size() > 4) {\n      cv::solvePnPRansac(objectPoints, imagePoints, _camera_mat,\n                         cv::Mat::zeros(4, 1, CV_64FC1), rvec, tvec, false,\n                         _num_iter_ransac, max_dist, .99,\n                         inliers_cpu, cv::SOLVEPNP_P3P);\n      double T[] = {tvec.at<double>(0), tvec.at<double>(1),\n                    tvec.at<double>(2)};\n      double R[] = {rvec.at<double>(0), rvec.at<double>(1),\n                    rvec.at<double>(2)};\n      currPose = TranslationRotation3D(T, R);\n    }\n\n    \/\/ require at least one inlier for the estimate to be valid (apart from the\n    \/\/ four points used to estimate pose)\n    currPose.setValid(currPose.isFinite() && (inliers_cpu.size() >= 5));\n\n    \/\/ if (currPose.isValid()) {\n    \/\/   currPose.showCompact();\n    \/\/   std::cout << \"inliers: \" << inliers_cpu.size() << \"\/\"\n    \/\/             << objectPoints.size() << std::endl << std::endl;\n    \/\/ }\n\n    \/\/    double pnp_time = timer.read();\n\n    \/\/    std::cout << std::setprecision(2);\n    \/\/    std::cout << \"extract: \" << extract_time << \" match: \" << match_time\n    \/\/              << \" pnp: \" << pnp_time << std::endl;\n  }\n\n  return (currPose);\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n        AtlasXMLEncoder.cpp\r\n        ----------------\r\n        begin           : 1999.11.29\r\n        copyright       : (C) 1999 by John Barrett (ZW)\r\n        email           : jbarrett@box100.com\r\n*\/\r\n\r\n#include \"AtlasXMLEncoder.h\"\r\n\r\n#include <map.h>\r\n#include <memory.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <stdio.h>\r\n\r\n#include <string>\r\n\r\n\r\nvoid AXMLEncoder::walkTree(int nest, string name, AObject& list)\r\n{\r\n\tint\ti;\r\n\tstring\tbuf;\r\n\tstring\tpre;\r\n\r\n\tfor (int j=0; j<nest; j++) {\r\n\t\tpre.append(\"    \");\r\n\t}\r\n\r\n\r\n\tif (list.isList()) {\r\n\t\t\/\/ precheck types here\r\n\t\tstring pfix(\"\");\r\n\r\n\t\tif (list.getListType() == AObject::AIntList)\t\tpfix.append(\"int_\");\r\n\t\telse if (list.getListType() == AObject::AFloatList)\tpfix.append(\"float_\");\r\n\t\telse if (list.getListType() == AObject::AStringList)\tpfix.append(\"string_\");\r\n\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<%slist name=\\\"%s\\\">\\n\", pre.c_str(), pfix.c_str(), name.c_str());\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<%slist>\\n\", pre.c_str(), pfix.c_str());\r\n\t\t}\r\n\t\tfor (i=0; i<list.length(); i++) {\r\n\t\t\tAObject tmp;\r\n\t\t\tlist.get(i, tmp);\r\n\t\t\twalkTree(nest+1, \"\", tmp);\r\n\t\t}\r\n\t\tprintf(\"%s<\/list>\\n\",pre.c_str());\r\n\t} \r\n\tif (list.isMap()) {\r\n\t\tAObject keys = list.keys();\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<map name=\\\"%s\\\">\\n\",pre.c_str(), name.c_str());\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<map>\\n\", pre.c_str());\r\n\t\t}\r\n\t\tfor (i=0; i<keys.length(); i++) {\r\n\t\t\tAObject key;\r\n\t\t\tkeys.get(i, key);\r\n\t\t\tAObject tmp;\r\n\t\t\tlist.get(key.asString(), tmp);\r\n\t\t\twalkTree(nest+1, key.asString(), tmp);\r\n\t\t}\r\n\t\tprintf(\"%s<\/map>\\n\",pre.c_str());\r\n\t} \r\n\r\n\tif (list.isString()) {\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<string name=\\\"%s\\\">%s<\/str>\\n\",\r\n\t\t\t\tpre.c_str(), name.c_str(),list.asString().c_str()\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<string>%s<\/str>\\n\",pre.c_str(), list.asString().c_str());\r\n\t\t}\r\n\t}\r\n\tif (list.isLong()) {\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<int name=\\\"%s\\\">%li<\/int>\\n\",\r\n\t\t\t\tpre.c_str(), name.c_str(),list.asLong()\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<int>%li<\/int>\\n\", pre.c_str(), list.asLong());\r\n\t\t}\r\n\t}\r\n\tif (list.isFloat()) {\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<float name=\\\"%s\\\">%.2f<\/float>\\n\",\r\n\t\t\t\tpre.c_str(), name.c_str(),list.asFloat()\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<float>%.2f<\/float>\\n\",pre.c_str(), list.asFloat());\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\n\r\nstring AXMLEncoder::encodeMessage(AObject& msg)\r\n{\r\n\tint\ti;\r\n\r\n\t\/\/ start a new message\r\n\tbuffer = \"\";\r\n\t\/\/ format the message header\r\n\tprintf(\"<obj>\\n\");\r\n\twalkTree(1, \"\", msg);\r\n\t\/\/ and close off the message\r\n\tprintf(\"<\/obj>\\n\");\r\n\t\/\/ return result\r\n\treturn buffer;\r\n}\r\n\r\n\r\n\r\n\r\n\r\n<commit_msg><\/str> -> <\/string><commit_after>\/*\r\n        AtlasXMLEncoder.cpp\r\n        ----------------\r\n        begin           : 1999.11.29\r\n        copyright       : (C) 1999 by John Barrett (ZW)\r\n        email           : jbarrett@box100.com\r\n*\/\r\n\r\n#include \"AtlasXMLEncoder.h\"\r\n\r\n#include <map.h>\r\n#include <memory.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <stdio.h>\r\n\r\n#include <string>\r\n\r\n\r\nvoid AXMLEncoder::walkTree(int nest, string name, AObject& list)\r\n{\r\n\tint\ti;\r\n\tstring\tbuf;\r\n\tstring\tpre;\r\n\r\n\tfor (int j=0; j<nest; j++) {\r\n\t\tpre.append(\"    \");\r\n\t}\r\n\r\n\r\n\tif (list.isList()) {\r\n\t\t\/\/ precheck types here\r\n\t\tstring pfix(\"\");\r\n\r\n\t\tif (list.getListType() == AObject::AIntList)\t\tpfix.append(\"int_\");\r\n\t\telse if (list.getListType() == AObject::AFloatList)\tpfix.append(\"float_\");\r\n\t\telse if (list.getListType() == AObject::AStringList)\tpfix.append(\"string_\");\r\n\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<%slist name=\\\"%s\\\">\\n\", pre.c_str(), pfix.c_str(), name.c_str());\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<%slist>\\n\", pre.c_str(), pfix.c_str());\r\n\t\t}\r\n\t\tfor (i=0; i<list.length(); i++) {\r\n\t\t\tAObject tmp;\r\n\t\t\tlist.get(i, tmp);\r\n\t\t\twalkTree(nest+1, \"\", tmp);\r\n\t\t}\r\n\t\tprintf(\"%s<\/list>\\n\",pre.c_str());\r\n\t} \r\n\tif (list.isMap()) {\r\n\t\tAObject keys = list.keys();\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<map name=\\\"%s\\\">\\n\",pre.c_str(), name.c_str());\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<map>\\n\", pre.c_str());\r\n\t\t}\r\n\t\tfor (i=0; i<keys.length(); i++) {\r\n\t\t\tAObject key;\r\n\t\t\tkeys.get(i, key);\r\n\t\t\tAObject tmp;\r\n\t\t\tlist.get(key.asString(), tmp);\r\n\t\t\twalkTree(nest+1, key.asString(), tmp);\r\n\t\t}\r\n\t\tprintf(\"%s<\/map>\\n\",pre.c_str());\r\n\t} \r\n\r\n\tif (list.isString()) {\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<string name=\\\"%s\\\">%s<\/string>\\n\",\r\n\t\t\t\tpre.c_str(), name.c_str(),list.asString().c_str()\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<string>%s<\/string>\\n\",pre.c_str(), list.asString().c_str());\r\n\t\t}\r\n\t}\r\n\tif (list.isLong()) {\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<int name=\\\"%s\\\">%li<\/int>\\n\",\r\n\t\t\t\tpre.c_str(), name.c_str(),list.asLong()\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<int>%li<\/int>\\n\", pre.c_str(), list.asLong());\r\n\t\t}\r\n\t}\r\n\tif (list.isFloat()) {\r\n\t\tif (name.length() > 0) {\r\n\t\t\tprintf(\"%s<float name=\\\"%s\\\">%.2f<\/float>\\n\",\r\n\t\t\t\tpre.c_str(), name.c_str(),list.asFloat()\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\tprintf(\"%s<float>%.2f<\/float>\\n\",pre.c_str(), list.asFloat());\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\n\r\nstring AXMLEncoder::encodeMessage(AObject& msg)\r\n{\r\n\tint\ti;\r\n\r\n\t\/\/ start a new message\r\n\tbuffer = \"\";\r\n\t\/\/ format the message header\r\n\tprintf(\"<obj>\\n\");\r\n\twalkTree(1, \"\", msg);\r\n\t\/\/ and close off the message\r\n\tprintf(\"<\/obj>\\n\");\r\n\t\/\/ return result\r\n\treturn buffer;\r\n}\r\n\r\n\r\n\r\n\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * Copyright (c) 2012, Dougal J. Sutherland (dsutherl@cs.cmu.edu).             *\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 *                                                                             *\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 Carnegie Mellon University nor the                *\n *       names of the 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#ifndef NPDIVS_DIV_PARAMS_HPP_\n#define NPDIVS_DIV_PARAMS_HPP_\n#include \"np-divs\/basics.hpp\"\n#include \"np-divs\/div_params.hpp\"\n\n#include <stdexcept>\n#include <boost\/throw_exception.hpp>\n\n#include <flann\/flann.hpp>\n\nnamespace npdivs {\n\n\/\/ TODO: more index types, support arguments\nflann::IndexParams index_params_from_str(const std::string &spec) {\n    \/\/ even though this looks like object slicing, it's not, i promise\n    if (spec == \"linear\" || spec == \"brute\") {\n        flann::LinearIndexParams ps;\n        return ps;\n    } else if (spec == \"kdtree\" || spec == \"kd\") {\n        flann::KDTreeSingleIndexParams ps;\n        return ps;\n    } else {\n        BOOST_THROW_EXCEPTION(std::domain_error(\"unknown index type \" + spec));\n    }\n}\n\n}\n#endif\n<commit_msg>undo some silliness<commit_after>\/*******************************************************************************\n * Copyright (c) 2012, Dougal J. Sutherland (dsutherl@cs.cmu.edu).             *\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 *                                                                             *\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 Carnegie Mellon University nor the                *\n *       names of the 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#include \"np-divs\/div_params.hpp\"\n\n#include <stdexcept>\n#include <boost\/throw_exception.hpp>\n\n#include <flann\/flann.hpp>\n\nnamespace npdivs {\n\n\/\/ TODO: more index types, support arguments\nflann::IndexParams index_params_from_str(const std::string &spec) {\n    \/\/ even though this looks like object slicing, it's not, i promise\n    if (spec == \"linear\" || spec == \"brute\") {\n        flann::LinearIndexParams ps;\n        return ps;\n    } else if (spec == \"kdtree\" || spec == \"kd\") {\n        flann::KDTreeSingleIndexParams ps;\n        return ps;\n    } else {\n        BOOST_THROW_EXCEPTION(std::domain_error(\"unknown index type \" + spec));\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/******************************************************************\n\/\/\n\/\/ Copyright 2016 Samsung Electronics All Rights Reserved.\n\/\/\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 implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n\n#include \"UnitTestHelper.h\"\n\n#include \"ocstack.h\"\n#include \"OCPlatform.h\"\n#include \"OCApi.h\"\n#include \"oic_string.h\"\n#include \"logger.h\"\n\n#include \"EasySetup.h\"\n#include \"RemoteEnrollee.h\"\n#include \"ESException.h\"\n\n#include <iostream>\n#include <functional>\n#include <pthread.h>\n#include <condition_variable>\n\nusing namespace OIC::Service;\n\nconst std::string  ipaddress = \"1.1.1.1\";\nconst std::string  ssid = \"test\";\nconst std::string  pwd = \"test@123\";\n\nclass MediatorRichTest: public TestWithMock\n{\n    protected:\n        void SetUp()\n        {\n            TestWithMock::SetUp();\n        }\n\n        void TearDown()\n        {\n            TestWithMock::TearDown();\n        }\n};\n\n\/\/callbacks\nvoid easySetupStatusCallback (std::shared_ptr< EasySetupStatus > \/*easySetupStatus*\/)\n{\n}\n\n\/* Test cases for easysetyup class*\/\n\n\/\/getInstance\nTEST_F(MediatorRichTest, testGetInstance)\n{\n    EasySetup *easySetupIntance1 = EasySetup::getInstance();\n    EasySetup *easySetupIntance2 = EasySetup::getInstance();\n\n    EXPECT_EQ(easySetupIntance1, easySetupIntance2);\n}\n\n\/\/createEnrolleeDevice [positive]\nTEST_F(MediatorRichTest, testCreateEnrolleeDevice)\n{\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    EXPECT_TRUE(remoteEnrollee != NULL);\n}\n\n\/\/createEnrolleeDevice [Negative]\nTEST_F(MediatorRichTest, testCreateEnrolleeDeviceNegative)\n{\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo ;\n    WiFiOnboadingConnection onboardingConn;\n    EasySetup *easysetupInstance = EasySetup::getInstance();\n\n    \/\/calling the createEnrolleeDevice\n    remoteEnrollee = easysetupInstance->createEnrolleeDevice(netInfo, onboardingConn);\n    \/\/calling again the createEnrolleeDevice with same config & connection info [API throws the exception]\n    EXPECT_ANY_THROW(easysetupInstance->createEnrolleeDevice(netInfo, onboardingConn));\n}\n\n\/\/createEnrolleeDevice [positive (creating the two RemoteEnrolleeDevice with different config)]\nTEST_F(MediatorRichTest, testCreateEnrolleeMultipleDevice)\n{\n    RemoteEnrollee::shared_ptr remoteEnrollee1 = NULL;\n    RemoteEnrollee::shared_ptr remoteEnrollee2 = NULL;\n    WiFiOnboadingConnection onboardingConn1;\n    WiFiOnboadingConnection onboardingConn2;\n    ProvConfig netInfo1;\n    ProvConfig netInfo2;\n    std::string  ipaddress2 = \"0.0.0.0\";\n\n    \/\/calling the API for the first device\n    netInfo1.connType = CT_ADAPTER_IP;\n    OICStrcpy(netInfo1.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo1.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn1.isSecured = false;\n    OICStrcpy(onboardingConn1.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n    remoteEnrollee1 = EasySetup::getInstance()->createEnrolleeDevice(netInfo1, onboardingConn1);\n\n    \/\/calling the API for the second device\n    netInfo1.connType = CT_ADAPTER_IP;\n    OICStrcpy(netInfo1.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo1.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn1.isSecured = false;\n    OICStrcpy(onboardingConn1.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress2.c_str());\n    remoteEnrollee2 = EasySetup::getInstance()->createEnrolleeDevice(netInfo2, onboardingConn2);\n\n    EXPECT_TRUE(remoteEnrollee1 != NULL);\n    EXPECT_TRUE(remoteEnrollee2 != NULL);\n}\n\n\/*Test cases for RemoteEnrollee class*\/\n\n\/\/registerEasySetupStatusHandler [positive]\nTEST_F(MediatorRichTest, testRegisterEasySetupStatusHandler)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    \/\/calling the API\n    EXPECT_NO_THROW( remoteEnrollee->registerEasySetupStatusHandler(&easySetupStatusCallback));\n}\n\n\/\/registerEasySetupStatusHandler [Negative]\nTEST_F(MediatorRichTest, testRegisterEasySetupStatusHandlerNegative)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    \/\/calling the API\n    EXPECT_ANY_THROW( remoteEnrollee->registerEasySetupStatusHandler(NULL));\n}\n\n\/\/isEnrolleeProvisioned\nTEST_F(MediatorRichTest, testIsEnrolleeProvisioned)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    \/\/calling the API\n    bool isEnrolleeProvisioned = remoteEnrollee->isEnrolleeProvisioned();\n\n    EXPECT_TRUE(false == isEnrolleeProvisioned);\n}\n\n\/\/startProvisioning [positive]\nTEST_F(MediatorRichTest, testStartProvisioning)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n    remoteEnrollee->registerEasySetupStatusHandler(&easySetupStatusCallback);\n\n    \/\/calling the APIs\n    EXPECT_NO_THROW(remoteEnrollee->startProvisioning());\n}\n\n\/\/startProvisioning [Negative]\nTEST_F(MediatorRichTest, testStartProvisioningNegative)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    \/*We are not registering the EasySetupStatusHandler that is why startProvisioning\n       will throw the Exception &  we are checking the same\n    *\/\n    EXPECT_ANY_THROW(remoteEnrollee->startProvisioning());\n}\n\n\/\/stopProvisioning [positive]\nTEST_F(MediatorRichTest, testStopProvisioning)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n    remoteEnrollee->registerEasySetupStatusHandler(&easySetupStatusCallback);\n\n    remoteEnrollee->startProvisioning();\n\n    EXPECT_NO_THROW(remoteEnrollee->stopProvisioning());\n}\n\n\/\/stopProvisioning [Negative]\nTEST_F(MediatorRichTest, testStopProvisioningNegative)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n    remoteEnrollee->registerEasySetupStatusHandler(&easySetupStatusCallback);\n\n    \/* we didn't call the start provisioning API and directly calling stopProvisioning API.\n         In this case API will throw the exception & we are checking the same.\n    *\/\n    EXPECT_ANY_THROW(remoteEnrollee->stopProvisioning());\n}\n\n<commit_msg>[Easy-setup] Unit test case fixes for Mediator SDK<commit_after>\/\/******************************************************************\n\/\/\n\/\/ Copyright 2016 Samsung Electronics All Rights Reserved.\n\/\/\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 implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n\n#include \"UnitTestHelper.h\"\n\n#include \"ocstack.h\"\n#include \"OCPlatform.h\"\n#include \"OCApi.h\"\n#include \"oic_string.h\"\n#include \"logger.h\"\n\n#include \"EasySetup.h\"\n#include \"RemoteEnrollee.h\"\n#include \"ESException.h\"\n\n#include <iostream>\n#include <functional>\n#include <pthread.h>\n#include <condition_variable>\n\nusing namespace OIC::Service;\n\nconst std::string  ipaddress = \"1.1.1.1\";\nconst std::string  ssid = \"test\";\nconst std::string  pwd = \"test@123\";\n\nclass MediatorRichTest: public TestWithMock\n{\n    protected:\n        void SetUp()\n        {\n            TestWithMock::SetUp();\n        }\n\n        void TearDown()\n        {\n            TestWithMock::TearDown();\n        }\n};\n\n\/\/callbacks\nvoid easySetupStatusCallback (std::shared_ptr< EasySetupStatus > \/*easySetupStatus*\/)\n{\n}\n\n\/* Test cases for easysetyup class*\/\n\n\/\/getInstance\nTEST_F(MediatorRichTest, testGetInstance)\n{\n    EasySetup *easySetupIntance1 = EasySetup::getInstance();\n    EasySetup *easySetupIntance2 = EasySetup::getInstance();\n\n    EXPECT_EQ(easySetupIntance1, easySetupIntance2);\n}\n\n\/\/createEnrolleeDevice [positive]\nTEST_F(MediatorRichTest, testCreateEnrolleeDevice)\n{\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    EXPECT_TRUE(remoteEnrollee != NULL);\n}\n\n\/\/createEnrolleeDevice [Negative]\nTEST_F(MediatorRichTest, testCreateEnrolleeDeviceNegative)\n{\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo ;\n    WiFiOnboadingConnection onboardingConn;\n    EasySetup *easysetupInstance = EasySetup::getInstance();\n\n    \/\/calling the createEnrolleeDevice\n    remoteEnrollee = easysetupInstance->createEnrolleeDevice(netInfo, onboardingConn);\n    \/\/calling again the createEnrolleeDevice with same config & connection info [API throws the exception]\n    EXPECT_ANY_THROW(easysetupInstance->createEnrolleeDevice(netInfo, onboardingConn));\n}\n\n\/\/createEnrolleeDevice [positive (creating the two RemoteEnrolleeDevice with different config)]\nTEST_F(MediatorRichTest, testCreateEnrolleeMultipleDevice)\n{\n    RemoteEnrollee::shared_ptr remoteEnrollee1 = NULL;\n    RemoteEnrollee::shared_ptr remoteEnrollee2 = NULL;\n    WiFiOnboadingConnection onboardingConn1;\n    WiFiOnboadingConnection onboardingConn2;\n    ProvConfig netInfo1;\n    ProvConfig netInfo2;\n    std::string  ipaddress2 = \"0.0.0.0\";\n\n    \/\/calling the API for the first device\n    netInfo1.connType = CT_ADAPTER_IP;\n    OICStrcpy(netInfo1.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo1.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn1.isSecured = false;\n    OICStrcpy(onboardingConn1.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n    remoteEnrollee1 = EasySetup::getInstance()->createEnrolleeDevice(netInfo1, onboardingConn1);\n\n    \/\/calling the API for the second device\n    netInfo1.connType = CT_ADAPTER_IP;\n    OICStrcpy(netInfo1.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo1.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn1.isSecured = false;\n    OICStrcpy(onboardingConn1.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress2.c_str());\n    remoteEnrollee2 = EasySetup::getInstance()->createEnrolleeDevice(netInfo2, onboardingConn2);\n\n    EXPECT_TRUE(remoteEnrollee1 != NULL);\n    EXPECT_TRUE(remoteEnrollee2 != NULL);\n}\n\n\/*Test cases for RemoteEnrollee class*\/\n\n\/\/registerEasySetupStatusHandler [positive]\nTEST_F(MediatorRichTest, testRegisterEasySetupStatusHandler)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    \/\/calling the API\n    EXPECT_NO_THROW( remoteEnrollee->registerEasySetupStatusHandler(&easySetupStatusCallback));\n}\n\n\/\/registerEasySetupStatusHandler [Negative]\nTEST_F(MediatorRichTest, testRegisterEasySetupStatusHandlerNegative)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    \/\/calling the API\n    EXPECT_ANY_THROW( remoteEnrollee->registerEasySetupStatusHandler(NULL));\n}\n\n\/\/isEnrolleeProvisioned\nTEST_F(MediatorRichTest, testIsEnrolleeProvisioned)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    \/\/calling the API\n    bool isEnrolleeProvisioned = remoteEnrollee->isEnrolleeProvisioned();\n\n    EXPECT_TRUE(false == isEnrolleeProvisioned);\n}\n\n\/\/startProvisioning [positive]\nTEST_F(MediatorRichTest, testStartProvisioning)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n    remoteEnrollee->registerEasySetupStatusHandler(&easySetupStatusCallback);\n\n#ifdef REMOTE_ARDUINO_ENROLEE\n    EXPECT_NO_THROW(remoteEnrollee->startProvisioning());\n\n#else\n    \/* It will throw the exception\n     * as it will not able to discover the provisioning resource in the network\n     *\/\n    EXPECT_ANY_THROW(remoteEnrollee->startProvisioning());\n#endif\n}\n\n\/\/startProvisioning [Negative]\nTEST_F(MediatorRichTest, testStartProvisioningNegative)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n\n    \/* We are not registering the EasySetupStatusHandler, so startProvisioning\n     * will throw the Exception &  we are checking the same\n     *\/\n    EXPECT_ANY_THROW(remoteEnrollee->startProvisioning());\n}\n\n\/\/stopProvisioning [positive]\nTEST_F(MediatorRichTest, testStopProvisioning)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n    remoteEnrollee->registerEasySetupStatusHandler(&easySetupStatusCallback);\n\n#ifdef REMOTE_ARDUINO_ENROLEE\n        EXPECT_NO_THROW(remoteEnrollee->startProvisioning());\n        EXPECT_NO_THROW(remoteEnrollee->stopProvisioning());\n\n#else\n    \/* It will throw the exception as\n     * it will not able to discover the provisioning resource in the network\n     *\/\n     EXPECT_ANY_THROW(remoteEnrollee->startProvisioning());\n\n    \/* It will throw an exception\n     * as internally resource will be empty [startProvisioning is not succeed]\n     *\/\n    EXPECT_ANY_THROW(remoteEnrollee->stopProvisioning());\n#endif\n}\n\n\/\/stopProvisioning [Negative]\nTEST_F(MediatorRichTest, testStopProvisioningNegative)\n{\n    \/\/creation of the Remote Enrollee Device\n    RemoteEnrollee::shared_ptr remoteEnrollee = NULL;\n    ProvConfig netInfo;\n    WiFiOnboadingConnection onboardingConn;\n\n    netInfo.connType = CT_ADAPTER_IP;\n\n    OICStrcpy(netInfo.provData.WIFI.ssid, NET_WIFI_SSID_SIZE - 1, ssid.c_str());\n    OICStrcpy(netInfo.provData.WIFI.pwd, NET_WIFI_PWD_SIZE - 1, pwd.c_str());\n\n    onboardingConn.isSecured = false;\n    OICStrcpy(onboardingConn.ipAddress, IPV4_ADDR_SIZE - 1, ipaddress.c_str());\n\n    remoteEnrollee = EasySetup::getInstance()->createEnrolleeDevice(netInfo, onboardingConn);\n    remoteEnrollee->registerEasySetupStatusHandler(&easySetupStatusCallback);\n\n    \/* we didn't call the start provisioning API and directly calling stopProvisioning API.\n     * In this case API will throw the exception & we are checking the same.\n     *\/\n    EXPECT_ANY_THROW(remoteEnrollee->stopProvisioning());\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* dtkComposerSceneEdge.cpp --- \n * \n * Author: Julien Wintz\n * Copyright (C) 2008-2011 - Julien Wintz, Inria.\n * Created: Fri Feb  3 14:00:23 2012 (+0100)\n * Version: $Id$\n * Last-Updated: Tue Feb  7 12:39:55 2012 (+0100)\n *           By: Julien Wintz\n *     Update #: 30\n *\/\n\n\/* Commentary: \n * \n *\/\n\n\/* Change log:\n * \n *\/\n\n#include \"dtkComposerSceneEdge.h\"\n#include \"dtkComposerSceneNode.h\"\n#include \"dtkComposerSceneNodeComposite.h\"\n#include \"dtkComposerScenePort.h\"\n\nclass dtkComposerSceneEdgePrivate\n{\npublic:\n    dtkComposerSceneNodeComposite *parent;\n\npublic:\n    dtkComposerScenePort *source;\n    dtkComposerScenePort *destination;\n\npublic:\n    QPainterPath path;\n};\n\ndtkComposerSceneEdge::dtkComposerSceneEdge(void) : QGraphicsItem(), d(new dtkComposerSceneEdgePrivate)\n{\n    d->source = NULL;\n    d->destination = NULL;\n\n    d->parent = NULL;\n\n    this->setZValue(-1);\n}\n\ndtkComposerSceneEdge::~dtkComposerSceneEdge(void)\n{\n    delete d;\n\n    d = NULL;\n}\n\nQRectF dtkComposerSceneEdge::boundingRect(void) const\n{\n    return d->path.boundingRect();\n}\n\nvoid dtkComposerSceneEdge::paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget)\n{\n    Q_UNUSED(option);\n    Q_UNUSED(widget);\n\n    painter->save();\n\n    painter->setPen(QPen(Qt::black, 1));\n    painter->setBrush(Qt::gray);\n\n    painter->drawPath(d->path);\n\n    painter->restore();\n}\n\ndtkComposerScenePort *dtkComposerSceneEdge::source(void)\n{\n    return d->source;\n}\n\ndtkComposerScenePort *dtkComposerSceneEdge::destination(void)\n{\n    return d->destination;\n}\n\nvoid dtkComposerSceneEdge::setSource(dtkComposerScenePort *port)\n{\n    d->source = port;\n\n    this->adjust();\n}\n\nvoid dtkComposerSceneEdge::setDestination(dtkComposerScenePort *port)\n{\n    d->destination = port;\n\n    this->adjust();\n}\n\nvoid dtkComposerSceneEdge::adjust(void)\n{\n    if (!d->source || !d->destination)\n        return;\n\n    if (!this->isVisible())\n        return;\n\n    QRectF rect;\n    rect = d->source->boundingRect();\n    QPointF start = d->source->mapToScene(rect.center());\n    rect = d->destination->boundingRect();\n    QPointF end = d->destination->mapToScene(rect.center());\n\n    this->adjust(start, end);\n}\n\nvoid dtkComposerSceneEdge::adjust(const QPointF& start, const QPointF& end)\n{\n    this->prepareGeometryChange();\n    \n    QPointF midPoint = (start + end) \/ 2;\n\n    qreal halfMid = (midPoint.x() - start.x())\/2;\n\n    QPainterPath path;\n    path.moveTo(start);\n    path.cubicTo(QPointF(end.x() - halfMid, start.y()), QPointF(start.x() + halfMid, end.y()), end);\n\n    QPainterPathStroker stroker;\n    stroker.setWidth(3);\n    stroker.setCapStyle(Qt::RoundCap);\n    d->path = stroker.createStroke(path);\n\n    this->update();\n}\n\nbool dtkComposerSceneEdge::link(bool anyway)\n{\n    Q_UNUSED(anyway);\n    \n    if(!d->source || !d->destination)\n        return false;\n\n    d->source->node()->addOutputEdge(this);\n    d->destination->node()->addInputEdge(this);\n\n    return true;\n}\n\nbool dtkComposerSceneEdge::unlink(void)\n{\n    if(!d->source || !d->destination)\n        return false;\n\n    d->source->node()->removeOutputEdge(this);\n    d->destination->node()->removeInputEdge(this);\n\n    return true;\n}\n\ndtkComposerSceneNodeComposite *dtkComposerSceneEdge::parent(void)\n{\n    return d->parent;\n}\n\nvoid dtkComposerSceneEdge::setParent(dtkComposerSceneNodeComposite *parent)\n{\n    d->parent = parent;\n}\n<commit_msg>Prevent connecting a node to itself.<commit_after>\/* dtkComposerSceneEdge.cpp --- \n * \n * Author: Julien Wintz\n * Copyright (C) 2008-2011 - Julien Wintz, Inria.\n * Created: Fri Feb  3 14:00:23 2012 (+0100)\n * Version: $Id$\n * Last-Updated: Tue Feb  7 12:54:31 2012 (+0100)\n *           By: Julien Wintz\n *     Update #: 32\n *\/\n\n\/* Commentary: \n * \n *\/\n\n\/* Change log:\n * \n *\/\n\n#include \"dtkComposerSceneEdge.h\"\n#include \"dtkComposerSceneNode.h\"\n#include \"dtkComposerSceneNodeComposite.h\"\n#include \"dtkComposerScenePort.h\"\n\nclass dtkComposerSceneEdgePrivate\n{\npublic:\n    dtkComposerSceneNodeComposite *parent;\n\npublic:\n    dtkComposerScenePort *source;\n    dtkComposerScenePort *destination;\n\npublic:\n    QPainterPath path;\n};\n\ndtkComposerSceneEdge::dtkComposerSceneEdge(void) : QGraphicsItem(), d(new dtkComposerSceneEdgePrivate)\n{\n    d->source = NULL;\n    d->destination = NULL;\n\n    d->parent = NULL;\n\n    this->setZValue(-1);\n}\n\ndtkComposerSceneEdge::~dtkComposerSceneEdge(void)\n{\n    delete d;\n\n    d = NULL;\n}\n\nQRectF dtkComposerSceneEdge::boundingRect(void) const\n{\n    return d->path.boundingRect();\n}\n\nvoid dtkComposerSceneEdge::paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget)\n{\n    Q_UNUSED(option);\n    Q_UNUSED(widget);\n\n    painter->save();\n\n    painter->setPen(QPen(Qt::black, 1));\n    painter->setBrush(Qt::gray);\n\n    painter->drawPath(d->path);\n\n    painter->restore();\n}\n\ndtkComposerScenePort *dtkComposerSceneEdge::source(void)\n{\n    return d->source;\n}\n\ndtkComposerScenePort *dtkComposerSceneEdge::destination(void)\n{\n    return d->destination;\n}\n\nvoid dtkComposerSceneEdge::setSource(dtkComposerScenePort *port)\n{\n    d->source = port;\n\n    this->adjust();\n}\n\nvoid dtkComposerSceneEdge::setDestination(dtkComposerScenePort *port)\n{\n    d->destination = port;\n\n    this->adjust();\n}\n\nvoid dtkComposerSceneEdge::adjust(void)\n{\n    if (!d->source || !d->destination)\n        return;\n\n    if (!this->isVisible())\n        return;\n\n    QRectF rect;\n    rect = d->source->boundingRect();\n    QPointF start = d->source->mapToScene(rect.center());\n    rect = d->destination->boundingRect();\n    QPointF end = d->destination->mapToScene(rect.center());\n\n    this->adjust(start, end);\n}\n\nvoid dtkComposerSceneEdge::adjust(const QPointF& start, const QPointF& end)\n{\n    this->prepareGeometryChange();\n    \n    QPointF midPoint = (start + end) \/ 2;\n\n    qreal halfMid = (midPoint.x() - start.x())\/2;\n\n    QPainterPath path;\n    path.moveTo(start);\n    path.cubicTo(QPointF(end.x() - halfMid, start.y()), QPointF(start.x() + halfMid, end.y()), end);\n\n    QPainterPathStroker stroker;\n    stroker.setWidth(3);\n    stroker.setCapStyle(Qt::RoundCap);\n    d->path = stroker.createStroke(path);\n\n    this->update();\n}\n\nbool dtkComposerSceneEdge::link(bool anyway)\n{\n    Q_UNUSED(anyway);\n    \n    if(!d->source || !d->destination)\n        return false;\n\n    if(d->source == d->destination)\n        return false;\n\n    if(d->source->node() == d->destination->node())\n        return false;\n\n    d->source->node()->addOutputEdge(this);\n    d->destination->node()->addInputEdge(this);\n\n    return true;\n}\n\nbool dtkComposerSceneEdge::unlink(void)\n{\n    if(!d->source || !d->destination)\n        return false;\n\n    d->source->node()->removeOutputEdge(this);\n    d->destination->node()->removeInputEdge(this);\n\n    return true;\n}\n\ndtkComposerSceneNodeComposite *dtkComposerSceneEdge::parent(void)\n{\n    return d->parent;\n}\n\nvoid dtkComposerSceneEdge::setParent(dtkComposerSceneNodeComposite *parent)\n{\n    d->parent = parent;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: tabwin.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: vg $ $Date: 2005-02-17 10:59:04 $\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 _SVX_TABWIN_HXX\n#define _SVX_TABWIN_HXX\n\n#ifndef _SVTREEBOX_HXX \/\/autogen\n#include <svtools\/svtreebx.hxx>\n#endif\n\n#ifndef _SV_FLOATWIN_HXX \/\/autogen\n#include <vcl\/floatwin.hxx>\n#endif\n\n#ifndef _BASEDLGS_HXX \/\/autogen\n#include <sfx2\/basedlgs.hxx>\n#endif\n\n#ifndef _SFX_CHILDWIN_HXX \/\/autogen\n#include <sfx2\/childwin.hxx>\n#endif\n\n#ifndef _SFXCTRLITEM_HXX \/\/autogen\n#include <sfx2\/ctrlitem.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_FORM_XFORM_HPP_\n#include <com\/sun\/star\/form\/XForm.hpp>\n#endif\n\n\/\/#ifndef _SVX_FMTOOLS_HXX\n\/\/#include \"fmtools.hxx\"\n\/\/#endif\n\n#ifndef _COMPHELPER_PROPERTY_MULTIPLEX_HXX_\n#include <comphelper\/propmultiplex.hxx>\n#endif\n#ifndef _TRANSFER_HXX\n#include <svtools\/transfer.hxx>\n#endif\n#ifndef SVX_DBTOOLSCLIENT_HXX\n#include \"dbtoolsclient.hxx\"\n#endif\n\n\/\/==================================================================\nclass FmFieldWin;\nclass SAL_DLLPRIVATE FmFieldWinListBox\n                    :public SvTreeListBox\n{\n    FmFieldWin* pTabWin;\n\nprotected:\n\/\/  virtual void Command( const CommandEvent& rEvt );\n\npublic:\n    FmFieldWinListBox( FmFieldWin* pParent );\n    virtual ~FmFieldWinListBox();\n\n    sal_Int8 AcceptDrop( const AcceptDropEvent& rEvt );\n    sal_Int8 ExecuteDrop( const ExecuteDropEvent& rEvt );\n\nprotected:\n    \/\/ DragSourceHelper\n    virtual void StartDrag( sal_Int8 nAction, const Point& rPosPixel );\n\n    \/\/ SvLBox\n    virtual BOOL DoubleClickHdl();\n};\n\n\/\/========================================================================\nclass FmFormShell;\nclass SAL_DLLPRIVATE FmFieldWinData\n{\npublic:\n    FmFieldWinData();\n    ~FmFieldWinData();\n};\n\n\/\/========================================================================\nclass SAL_DLLPRIVATE FmFieldWin :public SfxFloatingWindow\n                    ,public SfxControllerItem\n                    ,public ::comphelper::OPropertyChangeListener\n                    ,public ::svxform::OStaticDataAccessTools\n{\n    ::osl::Mutex        m_aMutex;\n    FmFieldWinListBox* pListBox;\n    FmFieldWinData*    pData;\n    ::rtl::OUString    m_aDatabaseName,\n                       m_aObjectName;\n    sal_Int32          m_nObjectType;\n\n    ::comphelper::OPropertyChangeMultiplexer*   m_pChangeListener;\n\npublic:\n    FmFieldWin(SfxBindings *pBindings,\n               SfxChildWindow *pMgr, Window* pParent);\n\n    virtual ~FmFieldWin();\n    virtual void Resize();\n    virtual sal_Bool Close();\n    virtual void GetFocus();\n    virtual long PreNotify( NotifyEvent& _rNEvt );\n    virtual void StateChanged(sal_uInt16 nSID, SfxItemState eState,\n                              const SfxPoolItem* pState);\n\n    FmFieldWinData* GetData()  const {return pData;}\n\n    sal_Bool Update(FmFormShell*);\n    sal_Bool Update(const ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm > &);\n    void FillInfo( SfxChildWinInfo& rInfo ) const;\n\n    const ::rtl::OUString&  GetDatabaseName() const { return m_aDatabaseName; }\n    const ::rtl::OUString&  GetObjectName() const { return m_aObjectName; }\n    sal_Int32               GetObjectType() const { return m_nObjectType; }\n\n    sal_Bool    createSelectionControls( );\n\nprotected:\n    \/\/ FmXChangeListener\n    virtual void _propertyChanged(const ::com::sun::star::beans::PropertyChangeEvent& evt) throw( ::com::sun::star::uno::RuntimeException );\n\nprotected:\n    inline          SfxBindings&    GetBindings()       { return SfxControllerItem::GetBindings(); }\n    inline  const   SfxBindings&    GetBindings() const { return SfxControllerItem::GetBindings(); }\n};\n\n\/\/========================================================================\nclass SAL_DLLPRIVATE FmFieldWinMgr : public SfxChildWindow\n{\npublic:\n    FmFieldWinMgr(Window *pParent, sal_uInt16 nId,\n        SfxBindings *pBindings, SfxChildWinInfo *pInfo);\n    SFX_DECL_CHILDWINDOW(FmFieldWinMgr);\n};\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.9.346); FILE MERGED 2005\/09\/05 14:25:20 rt 1.9.346.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: tabwin.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 23:27: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 _SVX_TABWIN_HXX\n#define _SVX_TABWIN_HXX\n\n#ifndef _SVTREEBOX_HXX \/\/autogen\n#include <svtools\/svtreebx.hxx>\n#endif\n\n#ifndef _SV_FLOATWIN_HXX \/\/autogen\n#include <vcl\/floatwin.hxx>\n#endif\n\n#ifndef _BASEDLGS_HXX \/\/autogen\n#include <sfx2\/basedlgs.hxx>\n#endif\n\n#ifndef _SFX_CHILDWIN_HXX \/\/autogen\n#include <sfx2\/childwin.hxx>\n#endif\n\n#ifndef _SFXCTRLITEM_HXX \/\/autogen\n#include <sfx2\/ctrlitem.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_FORM_XFORM_HPP_\n#include <com\/sun\/star\/form\/XForm.hpp>\n#endif\n\n\/\/#ifndef _SVX_FMTOOLS_HXX\n\/\/#include \"fmtools.hxx\"\n\/\/#endif\n\n#ifndef _COMPHELPER_PROPERTY_MULTIPLEX_HXX_\n#include <comphelper\/propmultiplex.hxx>\n#endif\n#ifndef _TRANSFER_HXX\n#include <svtools\/transfer.hxx>\n#endif\n#ifndef SVX_DBTOOLSCLIENT_HXX\n#include \"dbtoolsclient.hxx\"\n#endif\n\n\/\/==================================================================\nclass FmFieldWin;\nclass SAL_DLLPRIVATE FmFieldWinListBox\n                    :public SvTreeListBox\n{\n    FmFieldWin* pTabWin;\n\nprotected:\n\/\/  virtual void Command( const CommandEvent& rEvt );\n\npublic:\n    FmFieldWinListBox( FmFieldWin* pParent );\n    virtual ~FmFieldWinListBox();\n\n    sal_Int8 AcceptDrop( const AcceptDropEvent& rEvt );\n    sal_Int8 ExecuteDrop( const ExecuteDropEvent& rEvt );\n\nprotected:\n    \/\/ DragSourceHelper\n    virtual void StartDrag( sal_Int8 nAction, const Point& rPosPixel );\n\n    \/\/ SvLBox\n    virtual BOOL DoubleClickHdl();\n};\n\n\/\/========================================================================\nclass FmFormShell;\nclass SAL_DLLPRIVATE FmFieldWinData\n{\npublic:\n    FmFieldWinData();\n    ~FmFieldWinData();\n};\n\n\/\/========================================================================\nclass SAL_DLLPRIVATE FmFieldWin :public SfxFloatingWindow\n                    ,public SfxControllerItem\n                    ,public ::comphelper::OPropertyChangeListener\n                    ,public ::svxform::OStaticDataAccessTools\n{\n    ::osl::Mutex        m_aMutex;\n    FmFieldWinListBox* pListBox;\n    FmFieldWinData*    pData;\n    ::rtl::OUString    m_aDatabaseName,\n                       m_aObjectName;\n    sal_Int32          m_nObjectType;\n\n    ::comphelper::OPropertyChangeMultiplexer*   m_pChangeListener;\n\npublic:\n    FmFieldWin(SfxBindings *pBindings,\n               SfxChildWindow *pMgr, Window* pParent);\n\n    virtual ~FmFieldWin();\n    virtual void Resize();\n    virtual sal_Bool Close();\n    virtual void GetFocus();\n    virtual long PreNotify( NotifyEvent& _rNEvt );\n    virtual void StateChanged(sal_uInt16 nSID, SfxItemState eState,\n                              const SfxPoolItem* pState);\n\n    FmFieldWinData* GetData()  const {return pData;}\n\n    sal_Bool Update(FmFormShell*);\n    sal_Bool Update(const ::com::sun::star::uno::Reference< ::com::sun::star::form::XForm > &);\n    void FillInfo( SfxChildWinInfo& rInfo ) const;\n\n    const ::rtl::OUString&  GetDatabaseName() const { return m_aDatabaseName; }\n    const ::rtl::OUString&  GetObjectName() const { return m_aObjectName; }\n    sal_Int32               GetObjectType() const { return m_nObjectType; }\n\n    sal_Bool    createSelectionControls( );\n\nprotected:\n    \/\/ FmXChangeListener\n    virtual void _propertyChanged(const ::com::sun::star::beans::PropertyChangeEvent& evt) throw( ::com::sun::star::uno::RuntimeException );\n\nprotected:\n    inline          SfxBindings&    GetBindings()       { return SfxControllerItem::GetBindings(); }\n    inline  const   SfxBindings&    GetBindings() const { return SfxControllerItem::GetBindings(); }\n};\n\n\/\/========================================================================\nclass SAL_DLLPRIVATE FmFieldWinMgr : public SfxChildWindow\n{\npublic:\n    FmFieldWinMgr(Window *pParent, sal_uInt16 nId,\n        SfxBindings *pBindings, SfxChildWinInfo *pInfo);\n    SFX_DECL_CHILDWINDOW(FmFieldWinMgr);\n};\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/********************************\n** Tsunagari Tile Engine       **\n** os\/windows-mapped-file.cpp  **\n** Copyright 2019 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 \"os\/windows-mapped-file.h\"\n\n#include \"os\/c.h\"\n#include \"util\/string.h\"\n\nextern \"C\" {\ntypedef struct {\n    DWORD nLength;\n    LPVOID lpSecurityDescriptor;\n    BOOL bInheritHandle;\n} SECURITY_ATTRIBUTES, *PSECURITY_ATTRIBUTES, *LPSECURITY_ATTRIBUTES;\n\nWINBASEAPI BOOL WINAPI CloseHandle(HANDLE hObject) noexcept;\nWINBASEAPI HANDLE WINAPI CreateFileA(LPCSTR lpFileName,\n                                     DWORD dwDesiredAccess,\n                                     DWORD dwShareMode,\n                                     LPSECURITY_ATTRIBUTES lpSecurityAttributes,\n                                     DWORD dwCreationDisposition,\n                                     DWORD dwFlagsAndAttributes,\n                                     HANDLE hTemplateFile) noexcept;\nWINBASEAPI HANDLE WINAPI\nCreateFileMappingA(HANDLE hFile,\n                   LPSECURITY_ATTRIBUTES lpFileMappingAttributes,\n                   DWORD flProtect,\n                   DWORD dwMaximumSizeHigh,\n                   DWORD dwMaximumSizeLow,\n                   LPCSTR lpName) noexcept;\nWINBASEAPI LPVOID WINAPI MapViewOfFile(HANDLE hFileMappingObject,\n                                       DWORD dwDesiredAccess,\n                                       DWORD dwFileOffsetHigh,\n                                       DWORD dwFileOffsetLow,\n                                       SIZE_T dwNumberOfBytesToMap) noexcept;\nWINBASEAPI BOOL WINAPI UnmapViewOfFile(LPCVOID lpBaseAddress) noexcept;\n\n#define CreateFile CreateFileA\n#define CreateFileMapping CreateFileMappingA\n\n#define FILE_ATTRIBUTE_NORMAL 0x00000080\n#define FILE_MAP_READ SECTION_MAP_READ\n#define GENERIC_READ 0x80000000L\n#define INVALID_HANDLE_VALUE ((HANDLE)(LONG_PTR)-1)\n#define OPEN_ALWAYS 4\n#define PAGE_READONLY 0x02\n#define SECTION_MAP_READ 0x0004\n}\n\nOptional<MappedFile>\nMappedFile::fromPath(StringView path) noexcept {\n    HANDLE file = CreateFile(String(path).null(),\n                             GENERIC_READ,\n                             0,\n                             nullptr,\n                             OPEN_ALWAYS,\n                             FILE_ATTRIBUTE_NORMAL,\n                             nullptr);\n    if (file == INVALID_HANDLE_VALUE) {\n        return Optional<MappedFile>();\n    }\n\n    HANDLE mapping =\n            CreateFileMapping(file, nullptr, PAGE_READONLY, 0, 0, nullptr);\n    if (mapping == nullptr) {\n        CloseHandle(file);\n        return Optional<MappedFile>();\n    }\n\n    void* data = MapViewOfFile(mapping, FILE_MAP_READ, 0, 0, 0);\n    if (data == nullptr) {\n        CloseHandle(mapping);\n        CloseHandle(file);\n        return Optional<MappedFile>();\n    }\n\n    MappedFile m;\n    m.file = file;\n    m.mapping = mapping;\n    m.data = static_cast<char*>(data);\n    return Optional<MappedFile>(move_(m));\n}\n\nMappedFile::MappedFile() noexcept\n        : file(INVALID_HANDLE_VALUE), mapping(nullptr), data(nullptr) {}\n\nMappedFile::MappedFile(MappedFile&& other) noexcept\n        : file(INVALID_HANDLE_VALUE), mapping(nullptr), data(nullptr) {\n    *this = move_(other);\n}\n\nMappedFile::~MappedFile() noexcept {\n    if (data) {\n        UnmapViewOfFile(static_cast<void*>(data));\n    }\n    if (mapping) {\n        CloseHandle(mapping);\n    }\n    if (file != INVALID_HANDLE_VALUE) {\n        CloseHandle(file);\n    }\n}\n\nMappedFile&\nMappedFile::operator=(MappedFile&& other) noexcept {\n    file = other.file;\n    mapping = other.mapping;\n    data = other.data;\n    other.file = INVALID_HANDLE_VALUE;\n    other.mapping = nullptr;\n    other.data = nullptr;\n    return *this;\n}\n<commit_msg>os\/windows: Don't create missing mapped files<commit_after>\/********************************\n** Tsunagari Tile Engine       **\n** os\/windows-mapped-file.cpp  **\n** Copyright 2019 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 \"os\/windows-mapped-file.h\"\n\n#include \"os\/c.h\"\n#include \"util\/string.h\"\n\nextern \"C\" {\ntypedef struct {\n    DWORD nLength;\n    LPVOID lpSecurityDescriptor;\n    BOOL bInheritHandle;\n} SECURITY_ATTRIBUTES, *PSECURITY_ATTRIBUTES, *LPSECURITY_ATTRIBUTES;\n\nWINBASEAPI BOOL WINAPI CloseHandle(HANDLE hObject) noexcept;\nWINBASEAPI HANDLE WINAPI CreateFileA(LPCSTR lpFileName,\n                                     DWORD dwDesiredAccess,\n                                     DWORD dwShareMode,\n                                     LPSECURITY_ATTRIBUTES lpSecurityAttributes,\n                                     DWORD dwCreationDisposition,\n                                     DWORD dwFlagsAndAttributes,\n                                     HANDLE hTemplateFile) noexcept;\nWINBASEAPI HANDLE WINAPI\nCreateFileMappingA(HANDLE hFile,\n                   LPSECURITY_ATTRIBUTES lpFileMappingAttributes,\n                   DWORD flProtect,\n                   DWORD dwMaximumSizeHigh,\n                   DWORD dwMaximumSizeLow,\n                   LPCSTR lpName) noexcept;\nWINBASEAPI LPVOID WINAPI MapViewOfFile(HANDLE hFileMappingObject,\n                                       DWORD dwDesiredAccess,\n                                       DWORD dwFileOffsetHigh,\n                                       DWORD dwFileOffsetLow,\n                                       SIZE_T dwNumberOfBytesToMap) noexcept;\nWINBASEAPI BOOL WINAPI UnmapViewOfFile(LPCVOID lpBaseAddress) noexcept;\n\n#define CreateFile CreateFileA\n#define CreateFileMapping CreateFileMappingA\n\n#define FILE_ATTRIBUTE_NORMAL 0x00000080\n#define FILE_MAP_READ SECTION_MAP_READ\n#define GENERIC_READ 0x80000000L\n#define INVALID_HANDLE_VALUE ((HANDLE)(LONG_PTR)-1)\n#define OPEN_EXISTING 3\n#define PAGE_READONLY 0x02\n#define SECTION_MAP_READ 0x0004\n}\n\nOptional<MappedFile>\nMappedFile::fromPath(StringView path) noexcept {\n    HANDLE file = CreateFile(String(path).null(),\n                             GENERIC_READ,\n                             0,\n                             nullptr,\n                             OPEN_EXISTING,\n                             FILE_ATTRIBUTE_NORMAL,\n                             nullptr);\n    if (file == INVALID_HANDLE_VALUE) {\n        return Optional<MappedFile>();\n    }\n\n    HANDLE mapping =\n            CreateFileMapping(file, nullptr, PAGE_READONLY, 0, 0, nullptr);\n    if (mapping == nullptr) {\n        CloseHandle(file);\n        return Optional<MappedFile>();\n    }\n\n    void* data = MapViewOfFile(mapping, FILE_MAP_READ, 0, 0, 0);\n    if (data == nullptr) {\n        CloseHandle(mapping);\n        CloseHandle(file);\n        return Optional<MappedFile>();\n    }\n\n    MappedFile m;\n    m.file = file;\n    m.mapping = mapping;\n    m.data = static_cast<char*>(data);\n    return Optional<MappedFile>(move_(m));\n}\n\nMappedFile::MappedFile() noexcept\n        : file(INVALID_HANDLE_VALUE), mapping(nullptr), data(nullptr) {}\n\nMappedFile::MappedFile(MappedFile&& other) noexcept\n        : file(INVALID_HANDLE_VALUE), mapping(nullptr), data(nullptr) {\n    *this = move_(other);\n}\n\nMappedFile::~MappedFile() noexcept {\n    if (data) {\n        UnmapViewOfFile(static_cast<void*>(data));\n    }\n    if (mapping) {\n        CloseHandle(mapping);\n    }\n    if (file != INVALID_HANDLE_VALUE) {\n        CloseHandle(file);\n    }\n}\n\nMappedFile&\nMappedFile::operator=(MappedFile&& other) noexcept {\n    file = other.file;\n    mapping = other.mapping;\n    data = other.data;\n    other.file = INVALID_HANDLE_VALUE;\n    other.mapping = nullptr;\n    other.data = nullptr;\n    return *this;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <osg\/Texture>\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 Texture_readLocalData(Object& obj, Input& fr);\nbool Texture_writeLocalData(const Object& obj, Output& fw);\n\nbool Texture_matchWrapStr(const char* str,Texture::WrapMode& wrap);\nconst char* Texture_getWrapStr(Texture::WrapMode wrap);\nbool Texture_matchFilterStr(const char* str,Texture::FilterMode& filter);\nconst char* Texture_getFilterStr(Texture::FilterMode filter);\nbool Texture_matchInternalFormatModeStr(const char* str,Texture::InternalFormatMode& mode);\nconst char* Texture_getInternalFormatModeStr(Texture::InternalFormatMode mode);\nbool Texture_matchInternalFormatStr(const char* str,int& value);\nconst char* Texture_getInternalFormatStr(int value);\n\n\/\/ register the read and write functions with the osgDB::Registry.\nRegisterDotOsgWrapperProxy g_TextureProxy\n(\n    0,\n    \"TextureBase\",\n    \"Object StateAttribute TextureBase\",\n    &Texture_readLocalData,\n    &Texture_writeLocalData\n);\n\n\nbool Texture_readLocalData(Object& obj, Input& fr)\n{\n    bool iteratorAdvanced = false;\n\n    Texture& texture = static_cast<Texture&>(obj);\n\n    Texture::WrapMode wrap;\n    if (fr[0].matchWord(\"wrap_s\") && Texture_matchWrapStr(fr[1].getStr(),wrap))\n    {\n        texture.setWrap(Texture::WRAP_S,wrap);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"wrap_t\") && Texture_matchWrapStr(fr[1].getStr(),wrap))\n    {\n        texture.setWrap(Texture::WRAP_T,wrap);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"wrap_r\") && Texture_matchWrapStr(fr[1].getStr(),wrap))\n    {\n        texture.setWrap(Texture::WRAP_R,wrap);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    Texture::FilterMode filter;\n    if (fr[0].matchWord(\"min_filter\") && Texture_matchFilterStr(fr[1].getStr(),filter))\n    {\n        texture.setFilter(Texture::MIN_FILTER,filter);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"mag_filter\") && Texture_matchFilterStr(fr[1].getStr(),filter))\n    {\n        texture.setFilter(Texture::MAG_FILTER,filter);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr.matchSequence(\"maxAnisotropy %f\"))\n    {\n        float anis=1.0f;\n        fr[1].getFloat(anis);\n        texture.setMaxAnisotropy(anis);\n        fr +=2 ;\n        iteratorAdvanced = true;\n    }\n\n    if (fr.matchSequence(\"borderWidth %f %f %f %f\"))\n    {\n        Vec4 color;\n        fr[1].getFloat(color[0]);\n        fr[2].getFloat(color[1]);\n        fr[3].getFloat(color[2]);\n        fr[4].getFloat(color[3]);\n        texture.setBorderColor(color);\n        fr +=5 ;\n        iteratorAdvanced = true;\n    }\n\n    if (fr.matchSequence(\"borderWidth %i\"))\n    {\n        int width=0;\n        fr[1].getInt(width);\n        texture.setBorderWidth(width);\n        fr +=2 ;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"useHardwareMipMapGeneration\"))\n    {\n        if (fr[1].matchWord(\"TRUE\")) \n        {\n            texture.setUseHardwareMipMapGeneration(true);\n            fr +=2 ;\n            iteratorAdvanced = true;\n        }\n        else if (fr[1].matchWord(\"FALSE\")) \n        {\n            texture.setUseHardwareMipMapGeneration(false);\n            fr +=2 ;\n            iteratorAdvanced = true;\n        }\n    }\n\n    if (fr[0].matchWord(\"unRefImageDataAfterApply\"))\n    {\n        if (fr[1].matchWord(\"TRUE\")) \n        {\n            texture.setUnRefImageDataAfterApply(true);\n            fr +=2 ;\n            iteratorAdvanced = true;\n        }\n        else if (fr[1].matchWord(\"FALSE\")) \n        {\n            texture.setUnRefImageDataAfterApply(false);\n            fr +=2 ;\n            iteratorAdvanced = true;\n        }\n    }\n\n\n    Texture::InternalFormatMode mode;\n    if (fr[0].matchWord(\"internalFormatMode\") && Texture_matchInternalFormatModeStr(fr[1].getStr(),mode))\n    {\n        texture.setInternalFormatMode(mode);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"internalFormatValue\"))\n    {\n        int value;\n        if (Texture_matchInternalFormatStr(fr[1].getStr(),value) || fr[1].getInt(value))\n        {\n            texture.setInternalFormat(value);\n            fr+=2;\n            iteratorAdvanced = true;\n        }\n    }\n\n    return iteratorAdvanced;\n}\n\n\nbool Texture_writeLocalData(const Object& obj, Output& fw)\n{\n    const Texture& texture = static_cast<const Texture&>(obj);\n\n    fw.indent() << \"wrap_s \" << Texture_getWrapStr(texture.getWrap(Texture::WRAP_S)) << std::endl;\n    fw.indent() << \"wrap_t \" << Texture_getWrapStr(texture.getWrap(Texture::WRAP_T)) << std::endl;\n    fw.indent() << \"wrap_r \" << Texture_getWrapStr(texture.getWrap(Texture::WRAP_R)) << std::endl;\n\n    fw.indent() << \"min_filter \" << Texture_getFilterStr(texture.getFilter(Texture::MIN_FILTER)) << std::endl;\n    fw.indent() << \"mag_filter \" << Texture_getFilterStr(texture.getFilter(Texture::MAG_FILTER)) << std::endl;\n    fw.indent() << \"maxAnisotropy \" << texture.getMaxAnisotropy() << std::endl;\n    \n    fw.indent() << \"borderColor \" << texture.getBorderColor() << std::endl;\n    fw.indent() << \"borderWidth \" << texture.getBorderWidth() << std::endl;\n\n    fw.indent() << \"useHardwareMipMapGeneration \"<< (texture.getUseHardwareMipMapGeneration()?\"TRUE\":\"FALSE\") << std::endl;\n    fw.indent() << \"unRefImageDataAfterApply \"<< (texture.getUnRefImageDataAfterApply()?\"TRUE\":\"FALSE\") << std::endl;\n            \n    fw.indent() << \"internalFormatMode \" << Texture_getInternalFormatModeStr(texture.getInternalFormatMode()) << std::endl;\n\n    if (texture.getInternalFormatMode()==Texture::USE_USER_DEFINED_FORMAT)\n    {\n        const char* str = Texture_getInternalFormatStr(texture.getInternalFormat());\n        if (str) fw.indent() << \"internalFormat \" << str << std::endl;\n        else fw.indent() << \"internalFormat \" << texture.getInternalFormat() << std::endl;\n    }\n\n    return true;\n}\n\n\nbool Texture_matchWrapStr(const char* str,Texture::WrapMode& wrap)\n{\n    if (strcmp(str,\"CLAMP\")==0) wrap = Texture::CLAMP;\n    else if (strcmp(str,\"CLAMP_TO_EDGE\")==0) wrap = Texture::CLAMP_TO_EDGE;\n    else if (strcmp(str,\"CLAMP_TO_BORDER\")==0) wrap = Texture::CLAMP_TO_BORDER;\n    else if (strcmp(str,\"REPEAT\")==0) wrap = Texture::REPEAT;\n    else if (strcmp(str,\"MIRROR\")==0) wrap = Texture::MIRROR;\n    else return false;\n    return true;\n}\n\n\nconst char* Texture_getWrapStr(Texture::WrapMode wrap)\n{\n    switch(wrap)\n    {\n        case(Texture::CLAMP): return \"CLAMP\";\n        case(Texture::CLAMP_TO_EDGE): return \"CLAMP_TO_EDGE\";\n        case(Texture::CLAMP_TO_BORDER): return \"CLAMP_TO_BORDER\";\n        case(Texture::REPEAT): return \"REPEAT\";\n        case(Texture::MIRROR): return \"MIRROR\";\n    }\n    return \"\";\n}\n\n\nbool Texture_matchFilterStr(const char* str,Texture::FilterMode& filter)\n{\n    if (strcmp(str,\"NEAREST\")==0) filter = Texture::NEAREST;\n    else if (strcmp(str,\"LINEAR\")==0) filter = Texture::LINEAR;\n    else if (strcmp(str,\"NEAREST_MIPMAP_NEAREST\")==0) filter = Texture::NEAREST_MIPMAP_NEAREST;\n    else if (strcmp(str,\"LINEAR_MIPMAP_NEAREST\")==0) filter = Texture::LINEAR_MIPMAP_NEAREST;\n    else if (strcmp(str,\"NEAREST_MIPMAP_LINEAR\")==0) filter = Texture::NEAREST_MIPMAP_LINEAR;\n    else if (strcmp(str,\"LINEAR_MIPMAP_LINEAR\")==0) filter = Texture::LINEAR_MIPMAP_LINEAR;\n    else if (strcmp(str,\"ANISOTROPIC\")==0) filter = Texture::LINEAR;\n    else return false;\n    return true;\n}\n\n\nconst char* Texture_getFilterStr(Texture::FilterMode filter)\n{\n    switch(filter)\n    {\n        case(Texture::NEAREST): return \"NEAREST\";\n        case(Texture::LINEAR): return \"LINEAR\";\n        case(Texture::NEAREST_MIPMAP_NEAREST): return \"NEAREST_MIPMAP_NEAREST\";\n        case(Texture::LINEAR_MIPMAP_NEAREST): return \"LINEAR_MIPMAP_NEAREST\";\n        case(Texture::NEAREST_MIPMAP_LINEAR): return \"NEAREST_MIPMAP_LINEAR\";\n        case(Texture::LINEAR_MIPMAP_LINEAR): return \"LINEAR_MIPMAP_LINEAR\";\n    }\n    return \"\";\n}\n\nbool Texture_matchInternalFormatModeStr(const char* str,Texture::InternalFormatMode& mode)\n{\n    if (strcmp(str,\"USE_IMAGE_DATA_FORMAT\")==0)          mode = Texture::USE_IMAGE_DATA_FORMAT;\n    else if (strcmp(str,\"USE_USER_DEFINED_FORMAT\")==0)   mode = Texture::USE_USER_DEFINED_FORMAT;\n    else if (strcmp(str,\"USE_ARB_COMPRESSION\")==0)       mode = Texture::USE_ARB_COMPRESSION;\n    else if (strcmp(str,\"USE_S3TC_DXT1_COMPRESSION\")==0) mode = Texture::USE_S3TC_DXT1_COMPRESSION;\n    else if (strcmp(str,\"USE_S3TC_DXT3_COMPRESSION\")==0) mode = Texture::USE_S3TC_DXT3_COMPRESSION;\n    else if (strcmp(str,\"USE_S3TC_DXT5_COMPRESSION\")==0) mode = Texture::USE_S3TC_DXT5_COMPRESSION;\n    else return false;\n    return true;\n}\n\n\nconst char* Texture_getInternalFormatModeStr(Texture::InternalFormatMode mode)\n{\n    switch(mode)\n    {\n        case(Texture::USE_IMAGE_DATA_FORMAT):        return \"USE_IMAGE_DATA_FORMAT\";\n        case(Texture::USE_USER_DEFINED_FORMAT):      return \"USE_USER_DEFINED_FORMAT\";\n        case(Texture::USE_ARB_COMPRESSION):          return \"USE_ARB_COMPRESSION\";\n        case(Texture::USE_S3TC_DXT1_COMPRESSION):    return \"USE_S3TC_DXT1_COMPRESSION\";\n        case(Texture::USE_S3TC_DXT3_COMPRESSION):    return \"USE_S3TC_DXT3_COMPRESSION\";\n        case(Texture::USE_S3TC_DXT5_COMPRESSION):    return \"USE_S3TC_DXT5_COMPRESSION\";\n    }\n    return \"\";\n}\n\n\nbool Texture_matchInternalFormatStr(const char* str,int& value)\n{\n\n    if (     strcmp(str,\"GL_INTENSITY\")==0) value = GL_INTENSITY;\n    else if (strcmp(str,\"GL_LUMINANCE\")==0) value = GL_LUMINANCE;\n    else if (strcmp(str,\"GL_ALPHA\")==0) value = GL_ALPHA;\n    else if (strcmp(str,\"GL_LUMINANCE_ALPHA\")==0) value = GL_LUMINANCE_ALPHA;\n    else if (strcmp(str,\"GL_RGB\")==0) value = GL_RGB;\n    else if (strcmp(str,\"GL_RGBA\")==0) value = GL_RGBA;\n    else if (strcmp(str,\"GL_COMPRESSED_ALPHA_ARB\")==0) value = GL_COMPRESSED_ALPHA_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_LUMINANCE_ARB\")==0) value = GL_COMPRESSED_LUMINANCE_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_INTENSITY_ARB\")==0) value = GL_COMPRESSED_INTENSITY_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_LUMINANCE_ALPHA_ARB\")==0) value = GL_COMPRESSED_LUMINANCE_ALPHA_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_RGB_ARB\")==0) value = GL_COMPRESSED_RGB_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_RGBA_ARB\")==0) value = GL_COMPRESSED_RGBA_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_RGB_S3TC_DXT1_EXT\")==0) value = GL_COMPRESSED_RGB_S3TC_DXT1_EXT;\n    else if (strcmp(str,\"GL_COMPRESSED_RGBA_S3TC_DXT1_EXT\")==0) value = GL_COMPRESSED_RGBA_S3TC_DXT1_EXT;\n    else if (strcmp(str,\"GL_COMPRESSED_RGBA_S3TC_DXT3_EXT\")==0) value = GL_COMPRESSED_RGBA_S3TC_DXT3_EXT;\n    else if (strcmp(str,\"GL_COMPRESSED_RGBA_S3TC_DXT5_EXT\")==0) value = GL_COMPRESSED_RGBA_S3TC_DXT5_EXT;\n    else return false;\n    return true;\n}\n\n\nconst char* Texture_getInternalFormatStr(int value)\n{\n    switch(value)\n    {\n        case(GL_INTENSITY): return \"GL_INTENSITY\";\n        case(GL_LUMINANCE): return \"GL_LUMINANCE\";\n        case(GL_ALPHA): return \"GL_ALPHA\";\n        case(GL_LUMINANCE_ALPHA): return \"GL_LUMINANCE_ALPHA\";\n        case(GL_RGB): return \"GL_RGB\";\n        case(GL_RGBA): return \"GL_RGBA\";\n        case(GL_COMPRESSED_ALPHA_ARB): return \"GL_COMPRESSED_ALPHA_ARB\";\n        case(GL_COMPRESSED_LUMINANCE_ARB): return \"GL_COMPRESSED_LUMINANCE_ARB\";\n        case(GL_COMPRESSED_INTENSITY_ARB): return \"GL_COMPRESSED_INTENSITY_ARB\";\n        case(GL_COMPRESSED_LUMINANCE_ALPHA_ARB): return \"GL_COMPRESSED_LUMINANCE_ALPHA_ARB\";\n        case(GL_COMPRESSED_RGB_ARB): return \"GL_COMPRESSED_RGB_ARB\";\n        case(GL_COMPRESSED_RGBA_ARB): return \"GL_COMPRESSED_RGBA_ARB\";\n        case(GL_COMPRESSED_RGB_S3TC_DXT1_EXT): return \"GL_COMPRESSED_RGB_S3TC_DXT1_EXT\";\n        case(GL_COMPRESSED_RGBA_S3TC_DXT1_EXT): return \"GL_COMPRESSED_RGBA_S3TC_DXT1_EXT\";\n        case(GL_COMPRESSED_RGBA_S3TC_DXT3_EXT): return \"GL_COMPRESSED_RGBA_S3TC_DXT3_EXT\";\n        case(GL_COMPRESSED_RGBA_S3TC_DXT5_EXT): return \"GL_COMPRESSED_RGBA_S3TC_DXT5_EXT\";\n    }\n\n    return NULL;\n}\n<commit_msg>From Joran Jessurun, fixed \"borderColor\" typo.<commit_after>#include <osg\/Texture>\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 Texture_readLocalData(Object& obj, Input& fr);\nbool Texture_writeLocalData(const Object& obj, Output& fw);\n\nbool Texture_matchWrapStr(const char* str,Texture::WrapMode& wrap);\nconst char* Texture_getWrapStr(Texture::WrapMode wrap);\nbool Texture_matchFilterStr(const char* str,Texture::FilterMode& filter);\nconst char* Texture_getFilterStr(Texture::FilterMode filter);\nbool Texture_matchInternalFormatModeStr(const char* str,Texture::InternalFormatMode& mode);\nconst char* Texture_getInternalFormatModeStr(Texture::InternalFormatMode mode);\nbool Texture_matchInternalFormatStr(const char* str,int& value);\nconst char* Texture_getInternalFormatStr(int value);\n\n\/\/ register the read and write functions with the osgDB::Registry.\nRegisterDotOsgWrapperProxy g_TextureProxy\n(\n    0,\n    \"TextureBase\",\n    \"Object StateAttribute TextureBase\",\n    &Texture_readLocalData,\n    &Texture_writeLocalData\n);\n\n\nbool Texture_readLocalData(Object& obj, Input& fr)\n{\n    bool iteratorAdvanced = false;\n\n    Texture& texture = static_cast<Texture&>(obj);\n\n    Texture::WrapMode wrap;\n    if (fr[0].matchWord(\"wrap_s\") && Texture_matchWrapStr(fr[1].getStr(),wrap))\n    {\n        texture.setWrap(Texture::WRAP_S,wrap);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"wrap_t\") && Texture_matchWrapStr(fr[1].getStr(),wrap))\n    {\n        texture.setWrap(Texture::WRAP_T,wrap);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"wrap_r\") && Texture_matchWrapStr(fr[1].getStr(),wrap))\n    {\n        texture.setWrap(Texture::WRAP_R,wrap);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    Texture::FilterMode filter;\n    if (fr[0].matchWord(\"min_filter\") && Texture_matchFilterStr(fr[1].getStr(),filter))\n    {\n        texture.setFilter(Texture::MIN_FILTER,filter);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"mag_filter\") && Texture_matchFilterStr(fr[1].getStr(),filter))\n    {\n        texture.setFilter(Texture::MAG_FILTER,filter);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr.matchSequence(\"maxAnisotropy %f\"))\n    {\n        float anis=1.0f;\n        fr[1].getFloat(anis);\n        texture.setMaxAnisotropy(anis);\n        fr +=2 ;\n        iteratorAdvanced = true;\n    }\n\n    if (fr.matchSequence(\"borderColor %f %f %f %f\"))\n    {\n        Vec4 color;\n        fr[1].getFloat(color[0]);\n        fr[2].getFloat(color[1]);\n        fr[3].getFloat(color[2]);\n        fr[4].getFloat(color[3]);\n        texture.setBorderColor(color);\n        fr +=5 ;\n        iteratorAdvanced = true;\n    }\n\n    if (fr.matchSequence(\"borderWidth %i\"))\n    {\n        int width=0;\n        fr[1].getInt(width);\n        texture.setBorderWidth(width);\n        fr +=2 ;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"useHardwareMipMapGeneration\"))\n    {\n        if (fr[1].matchWord(\"TRUE\")) \n        {\n            texture.setUseHardwareMipMapGeneration(true);\n            fr +=2 ;\n            iteratorAdvanced = true;\n        }\n        else if (fr[1].matchWord(\"FALSE\")) \n        {\n            texture.setUseHardwareMipMapGeneration(false);\n            fr +=2 ;\n            iteratorAdvanced = true;\n        }\n    }\n\n    if (fr[0].matchWord(\"unRefImageDataAfterApply\"))\n    {\n        if (fr[1].matchWord(\"TRUE\")) \n        {\n            texture.setUnRefImageDataAfterApply(true);\n            fr +=2 ;\n            iteratorAdvanced = true;\n        }\n        else if (fr[1].matchWord(\"FALSE\")) \n        {\n            texture.setUnRefImageDataAfterApply(false);\n            fr +=2 ;\n            iteratorAdvanced = true;\n        }\n    }\n\n\n    Texture::InternalFormatMode mode;\n    if (fr[0].matchWord(\"internalFormatMode\") && Texture_matchInternalFormatModeStr(fr[1].getStr(),mode))\n    {\n        texture.setInternalFormatMode(mode);\n        fr+=2;\n        iteratorAdvanced = true;\n    }\n\n    if (fr[0].matchWord(\"internalFormatValue\"))\n    {\n        int value;\n        if (Texture_matchInternalFormatStr(fr[1].getStr(),value) || fr[1].getInt(value))\n        {\n            texture.setInternalFormat(value);\n            fr+=2;\n            iteratorAdvanced = true;\n        }\n    }\n\n    return iteratorAdvanced;\n}\n\n\nbool Texture_writeLocalData(const Object& obj, Output& fw)\n{\n    const Texture& texture = static_cast<const Texture&>(obj);\n\n    fw.indent() << \"wrap_s \" << Texture_getWrapStr(texture.getWrap(Texture::WRAP_S)) << std::endl;\n    fw.indent() << \"wrap_t \" << Texture_getWrapStr(texture.getWrap(Texture::WRAP_T)) << std::endl;\n    fw.indent() << \"wrap_r \" << Texture_getWrapStr(texture.getWrap(Texture::WRAP_R)) << std::endl;\n\n    fw.indent() << \"min_filter \" << Texture_getFilterStr(texture.getFilter(Texture::MIN_FILTER)) << std::endl;\n    fw.indent() << \"mag_filter \" << Texture_getFilterStr(texture.getFilter(Texture::MAG_FILTER)) << std::endl;\n    fw.indent() << \"maxAnisotropy \" << texture.getMaxAnisotropy() << std::endl;\n    \n    fw.indent() << \"borderColor \" << texture.getBorderColor() << std::endl;\n    fw.indent() << \"borderWidth \" << texture.getBorderWidth() << std::endl;\n\n    fw.indent() << \"useHardwareMipMapGeneration \"<< (texture.getUseHardwareMipMapGeneration()?\"TRUE\":\"FALSE\") << std::endl;\n    fw.indent() << \"unRefImageDataAfterApply \"<< (texture.getUnRefImageDataAfterApply()?\"TRUE\":\"FALSE\") << std::endl;\n            \n    fw.indent() << \"internalFormatMode \" << Texture_getInternalFormatModeStr(texture.getInternalFormatMode()) << std::endl;\n\n    if (texture.getInternalFormatMode()==Texture::USE_USER_DEFINED_FORMAT)\n    {\n        const char* str = Texture_getInternalFormatStr(texture.getInternalFormat());\n        if (str) fw.indent() << \"internalFormat \" << str << std::endl;\n        else fw.indent() << \"internalFormat \" << texture.getInternalFormat() << std::endl;\n    }\n\n    return true;\n}\n\n\nbool Texture_matchWrapStr(const char* str,Texture::WrapMode& wrap)\n{\n    if (strcmp(str,\"CLAMP\")==0) wrap = Texture::CLAMP;\n    else if (strcmp(str,\"CLAMP_TO_EDGE\")==0) wrap = Texture::CLAMP_TO_EDGE;\n    else if (strcmp(str,\"CLAMP_TO_BORDER\")==0) wrap = Texture::CLAMP_TO_BORDER;\n    else if (strcmp(str,\"REPEAT\")==0) wrap = Texture::REPEAT;\n    else if (strcmp(str,\"MIRROR\")==0) wrap = Texture::MIRROR;\n    else return false;\n    return true;\n}\n\n\nconst char* Texture_getWrapStr(Texture::WrapMode wrap)\n{\n    switch(wrap)\n    {\n        case(Texture::CLAMP): return \"CLAMP\";\n        case(Texture::CLAMP_TO_EDGE): return \"CLAMP_TO_EDGE\";\n        case(Texture::CLAMP_TO_BORDER): return \"CLAMP_TO_BORDER\";\n        case(Texture::REPEAT): return \"REPEAT\";\n        case(Texture::MIRROR): return \"MIRROR\";\n    }\n    return \"\";\n}\n\n\nbool Texture_matchFilterStr(const char* str,Texture::FilterMode& filter)\n{\n    if (strcmp(str,\"NEAREST\")==0) filter = Texture::NEAREST;\n    else if (strcmp(str,\"LINEAR\")==0) filter = Texture::LINEAR;\n    else if (strcmp(str,\"NEAREST_MIPMAP_NEAREST\")==0) filter = Texture::NEAREST_MIPMAP_NEAREST;\n    else if (strcmp(str,\"LINEAR_MIPMAP_NEAREST\")==0) filter = Texture::LINEAR_MIPMAP_NEAREST;\n    else if (strcmp(str,\"NEAREST_MIPMAP_LINEAR\")==0) filter = Texture::NEAREST_MIPMAP_LINEAR;\n    else if (strcmp(str,\"LINEAR_MIPMAP_LINEAR\")==0) filter = Texture::LINEAR_MIPMAP_LINEAR;\n    else if (strcmp(str,\"ANISOTROPIC\")==0) filter = Texture::LINEAR;\n    else return false;\n    return true;\n}\n\n\nconst char* Texture_getFilterStr(Texture::FilterMode filter)\n{\n    switch(filter)\n    {\n        case(Texture::NEAREST): return \"NEAREST\";\n        case(Texture::LINEAR): return \"LINEAR\";\n        case(Texture::NEAREST_MIPMAP_NEAREST): return \"NEAREST_MIPMAP_NEAREST\";\n        case(Texture::LINEAR_MIPMAP_NEAREST): return \"LINEAR_MIPMAP_NEAREST\";\n        case(Texture::NEAREST_MIPMAP_LINEAR): return \"NEAREST_MIPMAP_LINEAR\";\n        case(Texture::LINEAR_MIPMAP_LINEAR): return \"LINEAR_MIPMAP_LINEAR\";\n    }\n    return \"\";\n}\n\nbool Texture_matchInternalFormatModeStr(const char* str,Texture::InternalFormatMode& mode)\n{\n    if (strcmp(str,\"USE_IMAGE_DATA_FORMAT\")==0)          mode = Texture::USE_IMAGE_DATA_FORMAT;\n    else if (strcmp(str,\"USE_USER_DEFINED_FORMAT\")==0)   mode = Texture::USE_USER_DEFINED_FORMAT;\n    else if (strcmp(str,\"USE_ARB_COMPRESSION\")==0)       mode = Texture::USE_ARB_COMPRESSION;\n    else if (strcmp(str,\"USE_S3TC_DXT1_COMPRESSION\")==0) mode = Texture::USE_S3TC_DXT1_COMPRESSION;\n    else if (strcmp(str,\"USE_S3TC_DXT3_COMPRESSION\")==0) mode = Texture::USE_S3TC_DXT3_COMPRESSION;\n    else if (strcmp(str,\"USE_S3TC_DXT5_COMPRESSION\")==0) mode = Texture::USE_S3TC_DXT5_COMPRESSION;\n    else return false;\n    return true;\n}\n\n\nconst char* Texture_getInternalFormatModeStr(Texture::InternalFormatMode mode)\n{\n    switch(mode)\n    {\n        case(Texture::USE_IMAGE_DATA_FORMAT):        return \"USE_IMAGE_DATA_FORMAT\";\n        case(Texture::USE_USER_DEFINED_FORMAT):      return \"USE_USER_DEFINED_FORMAT\";\n        case(Texture::USE_ARB_COMPRESSION):          return \"USE_ARB_COMPRESSION\";\n        case(Texture::USE_S3TC_DXT1_COMPRESSION):    return \"USE_S3TC_DXT1_COMPRESSION\";\n        case(Texture::USE_S3TC_DXT3_COMPRESSION):    return \"USE_S3TC_DXT3_COMPRESSION\";\n        case(Texture::USE_S3TC_DXT5_COMPRESSION):    return \"USE_S3TC_DXT5_COMPRESSION\";\n    }\n    return \"\";\n}\n\n\nbool Texture_matchInternalFormatStr(const char* str,int& value)\n{\n\n    if (     strcmp(str,\"GL_INTENSITY\")==0) value = GL_INTENSITY;\n    else if (strcmp(str,\"GL_LUMINANCE\")==0) value = GL_LUMINANCE;\n    else if (strcmp(str,\"GL_ALPHA\")==0) value = GL_ALPHA;\n    else if (strcmp(str,\"GL_LUMINANCE_ALPHA\")==0) value = GL_LUMINANCE_ALPHA;\n    else if (strcmp(str,\"GL_RGB\")==0) value = GL_RGB;\n    else if (strcmp(str,\"GL_RGBA\")==0) value = GL_RGBA;\n    else if (strcmp(str,\"GL_COMPRESSED_ALPHA_ARB\")==0) value = GL_COMPRESSED_ALPHA_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_LUMINANCE_ARB\")==0) value = GL_COMPRESSED_LUMINANCE_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_INTENSITY_ARB\")==0) value = GL_COMPRESSED_INTENSITY_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_LUMINANCE_ALPHA_ARB\")==0) value = GL_COMPRESSED_LUMINANCE_ALPHA_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_RGB_ARB\")==0) value = GL_COMPRESSED_RGB_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_RGBA_ARB\")==0) value = GL_COMPRESSED_RGBA_ARB;\n    else if (strcmp(str,\"GL_COMPRESSED_RGB_S3TC_DXT1_EXT\")==0) value = GL_COMPRESSED_RGB_S3TC_DXT1_EXT;\n    else if (strcmp(str,\"GL_COMPRESSED_RGBA_S3TC_DXT1_EXT\")==0) value = GL_COMPRESSED_RGBA_S3TC_DXT1_EXT;\n    else if (strcmp(str,\"GL_COMPRESSED_RGBA_S3TC_DXT3_EXT\")==0) value = GL_COMPRESSED_RGBA_S3TC_DXT3_EXT;\n    else if (strcmp(str,\"GL_COMPRESSED_RGBA_S3TC_DXT5_EXT\")==0) value = GL_COMPRESSED_RGBA_S3TC_DXT5_EXT;\n    else return false;\n    return true;\n}\n\n\nconst char* Texture_getInternalFormatStr(int value)\n{\n    switch(value)\n    {\n        case(GL_INTENSITY): return \"GL_INTENSITY\";\n        case(GL_LUMINANCE): return \"GL_LUMINANCE\";\n        case(GL_ALPHA): return \"GL_ALPHA\";\n        case(GL_LUMINANCE_ALPHA): return \"GL_LUMINANCE_ALPHA\";\n        case(GL_RGB): return \"GL_RGB\";\n        case(GL_RGBA): return \"GL_RGBA\";\n        case(GL_COMPRESSED_ALPHA_ARB): return \"GL_COMPRESSED_ALPHA_ARB\";\n        case(GL_COMPRESSED_LUMINANCE_ARB): return \"GL_COMPRESSED_LUMINANCE_ARB\";\n        case(GL_COMPRESSED_INTENSITY_ARB): return \"GL_COMPRESSED_INTENSITY_ARB\";\n        case(GL_COMPRESSED_LUMINANCE_ALPHA_ARB): return \"GL_COMPRESSED_LUMINANCE_ALPHA_ARB\";\n        case(GL_COMPRESSED_RGB_ARB): return \"GL_COMPRESSED_RGB_ARB\";\n        case(GL_COMPRESSED_RGBA_ARB): return \"GL_COMPRESSED_RGBA_ARB\";\n        case(GL_COMPRESSED_RGB_S3TC_DXT1_EXT): return \"GL_COMPRESSED_RGB_S3TC_DXT1_EXT\";\n        case(GL_COMPRESSED_RGBA_S3TC_DXT1_EXT): return \"GL_COMPRESSED_RGBA_S3TC_DXT1_EXT\";\n        case(GL_COMPRESSED_RGBA_S3TC_DXT3_EXT): return \"GL_COMPRESSED_RGBA_S3TC_DXT3_EXT\";\n        case(GL_COMPRESSED_RGBA_S3TC_DXT5_EXT): return \"GL_COMPRESSED_RGBA_S3TC_DXT5_EXT\";\n    }\n\n    return NULL;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* mbed Microcontroller Library\n * Copyright (c) 2006-2012 ARM 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 THE\n * SOFTWARE.\n *\/\n#include \"rtos\/Thread.h\"\n\n#include \"mbed.h\"\n#include \"rtos\/rtos_idle.h\"\n#include \"mbed_assert.h\"\n\n#define ALIGN_UP(pos, align) ((pos) % (align) ? (pos) +  ((align) - (pos) % (align)) : (pos))\nMBED_STATIC_ASSERT(ALIGN_UP(0, 8) == 0, \"ALIGN_UP macro error\");\nMBED_STATIC_ASSERT(ALIGN_UP(1, 8) == 8, \"ALIGN_UP macro error\");\n\n#define ALIGN_DOWN(pos, align) ((pos) - ((pos) % (align)))\nMBED_STATIC_ASSERT(ALIGN_DOWN(7, 8) == 0, \"ALIGN_DOWN macro error\");\nMBED_STATIC_ASSERT(ALIGN_DOWN(8, 8) == 8, \"ALIGN_DOWN macro error\");\n\nstatic void (*terminate_hook)(osThreadId_t id) = 0;\nextern \"C\" void thread_terminate_hook(osThreadId_t id)\n{\n    if (terminate_hook != (void (*)(osThreadId_t))NULL) {\n        terminate_hook(id);\n    }\n}\n\nnamespace rtos {\n\nvoid Thread::constructor(osPriority priority,\n        uint32_t stack_size, unsigned char *stack_mem, const char *name) {\n\n    const uintptr_t unaligned_mem = reinterpret_cast<uintptr_t>(stack_mem);\n    const uintptr_t aligned_mem = ALIGN_UP(unaligned_mem, 8);\n    const uint32_t offset = aligned_mem - unaligned_mem;\n    const uint32_t aligned_size = ALIGN_DOWN(stack_size - offset, 8);\n\n    _tid = 0;\n    _dynamic_stack = (stack_mem == NULL);\n    _finished = false;\n    memset(&_obj_mem, 0, sizeof(_obj_mem));\n    memset(&_attr, 0, sizeof(_attr));\n    _attr.priority = priority;\n    _attr.stack_size = aligned_size;\n    _attr.name = name ? name : \"application_unnamed_thread\";\n    _attr.stack_mem = reinterpret_cast<uint32_t*>(aligned_mem);\n}\n\nvoid Thread::constructor(Callback<void()> task,\n        osPriority priority, uint32_t stack_size, unsigned char *stack_mem, const char *name) {\n    constructor(priority, stack_size, stack_mem, name);\n\n    switch (start(task)) {\n        case osErrorResource:\n            error(\"OS ran out of threads!\\n\");\n            break;\n        case osErrorParameter:\n            error(\"Thread already running!\\n\");\n            break;\n        case osErrorNoMemory:\n            error(\"Error allocating the stack memory\\n\");\n        default:\n            break;\n    }\n}\n\nosStatus Thread::start(Callback<void()> task) {\n    _mutex.lock();\n\n    if ((_tid != 0) || _finished) {\n        _mutex.unlock();\n        return osErrorParameter;\n    }\n\n    if (_attr.stack_mem == NULL) {\n        _attr.stack_mem = new uint32_t[_attr.stack_size\/sizeof(uint32_t)];\n        MBED_ASSERT(_attr.stack_mem != NULL);\n    }\n\n    \/\/Fill the stack with a magic word for maximum usage checking\n    for (uint32_t i = 0; i < (_attr.stack_size \/ sizeof(uint32_t)); i++) {\n        ((uint32_t *)_attr.stack_mem)[i] = 0xE25A2EA5;\n    }\n\n    memset(&_obj_mem, 0, sizeof(_obj_mem));\n    _attr.cb_size = sizeof(_obj_mem);\n    _attr.cb_mem = &_obj_mem;\n    _task = task;\n    _tid = osThreadNew(Thread::_thunk, this, &_attr);\n    if (_tid == NULL) {\n        if (_dynamic_stack) {\n            delete[] (uint32_t *)(_attr.stack_mem);\n            _attr.stack_mem = (uint32_t*)NULL;\n        }\n        _mutex.unlock();\n        _join_sem.release();\n        return osErrorResource;\n    }\n\n    _mutex.unlock();\n    return osOK;\n}\n\nosStatus Thread::terminate() {\n    osStatus_t ret = osOK;\n    _mutex.lock();\n\n    \/\/ Set the Thread's tid to NULL and\n    \/\/ release the semaphore before terminating\n    \/\/ since this thread could be terminating itself\n    osThreadId_t local_id = _tid;\n    _join_sem.release();\n    _tid = (osThreadId_t)NULL;\n    if (!_finished) {\n        _finished = true;\n        \/\/ if local_id == 0 Thread was not started in first place\n        \/\/ and does not have to be terminated\n        if(local_id != 0) {\n            ret = osThreadTerminate(local_id);\n        }\n    }\n    _mutex.unlock();\n    return ret;\n}\n\nosStatus Thread::join() {\n    int32_t ret = _join_sem.wait();\n    if (ret < 0) {\n        return osError;\n    }\n\n    \/\/ The semaphore has been released so this thread is being\n    \/\/ terminated or has been terminated. Once the mutex has\n    \/\/ been locked it is ensured that the thread is deleted.\n    _mutex.lock();\n    MBED_ASSERT(NULL == _tid);\n    _mutex.unlock();\n\n    \/\/ Release sem so any other threads joining this thread wake up\n    _join_sem.release();\n    return osOK;\n}\n\nosStatus Thread::set_priority(osPriority priority) {\n    osStatus_t ret;\n    _mutex.lock();\n\n    ret = osThreadSetPriority(_tid, priority);\n\n    _mutex.unlock();\n    return ret;\n}\n\nosPriority Thread::get_priority() {\n    osPriority_t ret;\n    _mutex.lock();\n\n    ret = osThreadGetPriority(_tid);\n\n    _mutex.unlock();\n    return ret;\n}\n\nint32_t Thread::signal_set(int32_t flags) {\n    return osThreadFlagsSet(_tid, flags);\n}\n\nThread::State Thread::get_state() {\n    uint8_t state = osThreadTerminated;\n\n    _mutex.lock();\n\n    if (_tid != NULL) {\n#if defined(MBED_OS_BACKEND_RTX5)\n        state = _obj_mem.state;\n#else\n        state = osThreadGetState(_tid);\n#endif\n    }\n\n    _mutex.unlock();\n\n    State user_state;\n\n    switch(state) {\n        case osThreadInactive:\n            user_state = Inactive;\n            break;\n        case osThreadReady:\n            user_state = Ready;\n            break;\n        case osThreadRunning:\n            user_state = Running;\n            break;\n#if defined(MBED_OS_BACKEND_RTX5)\n        case osRtxThreadWaitingDelay:\n            user_state = WaitingDelay;\n            break;\n        case osRtxThreadWaitingJoin:\n            user_state = WaitingJoin;\n            break;\n        case osRtxThreadWaitingThreadFlags:\n            user_state = WaitingThreadFlag;\n            break;\n        case osRtxThreadWaitingEventFlags:\n            user_state = WaitingEventFlag;\n            break;\n        case osRtxThreadWaitingMutex:\n            user_state = WaitingMutex;\n            break;\n        case osRtxThreadWaitingSemaphore:\n            user_state = WaitingSemaphore;\n            break;\n        case osRtxThreadWaitingMemoryPool:\n            user_state = WaitingMemoryPool;\n            break;\n        case osRtxThreadWaitingMessageGet:\n            user_state = WaitingMessageGet;\n            break;\n        case osRtxThreadWaitingMessagePut:\n            user_state = WaitingMessagePut;\n            break;\n#endif\n        case osThreadTerminated:\n        default:\n            user_state = Deleted;\n            break;\n    }\n\n    return user_state;\n}\n\nuint32_t Thread::stack_size() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n    if (_tid != NULL) {\n        size = osThreadGetStackSize(_tid);\n    }\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::free_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n#if defined(MBED_OS_BACKEND_RTX5)\n    if (_tid != NULL) {\n        os_thread_t *thread = (os_thread_t *)_tid;\n        size = (uint32_t)thread->sp - (uint32_t)thread->stack_mem;\n    }\n#endif\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::used_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n#if defined(MBED_OS_BACKEND_RTX5)\n    if (_tid != NULL) {\n        os_thread_t *thread = (os_thread_t *)_tid;\n        size = ((uint32_t)thread->stack_mem + thread->stack_size) - thread->sp;\n    }\n#endif\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::max_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n    if (_tid != NULL) {\n#if defined(MBED_OS_BACKEND_RTX5)\n        os_thread_t *thread = (os_thread_t *)_tid;\n        uint32_t high_mark = 0;\n        while (((uint32_t *)(thread->stack_mem))[high_mark] == 0xE25A2EA5)\n            high_mark++;\n        size = thread->stack_size - (high_mark * sizeof(uint32_t));\n#else\n        size = osThreadGetStackSize(_tid) - osThreadGetStackSpace(_tid);\n#endif\n    }\n\n    _mutex.unlock();\n    return size;\n}\n\nconst char *Thread::get_name() {\n    return _attr.name;\n}\n\nint32_t Thread::signal_clr(int32_t flags) {\n    return osThreadFlagsClear(flags);\n}\n\nosEvent Thread::signal_wait(int32_t signals, uint32_t millisec) {\n    uint32_t res;\n    osEvent evt;\n    uint32_t options = osFlagsWaitAll;\n    if (signals == 0) {\n        options = osFlagsWaitAny;\n        signals = 0x7FFFFFFF;\n    }\n    res = osThreadFlagsWait(signals, options, millisec);\n    if (res & osFlagsError) {\n        switch (res) {\n            case osFlagsErrorISR:\n                evt.status = osErrorISR;\n                break;\n            case osFlagsErrorResource:\n                evt.status = osOK;\n                break;\n            case osFlagsErrorTimeout:\n                evt.status = (osStatus)osEventTimeout;\n                break;\n            case osFlagsErrorParameter:\n            default:\n                evt.status = (osStatus)osErrorValue;\n                break;\n        }\n    } else {\n        evt.status = (osStatus)osEventSignal;\n        evt.value.signals = res;\n    }\n\n    return evt;\n}\n\nosStatus Thread::wait(uint32_t millisec) {\n    return osDelay(millisec);\n}\n\nosStatus Thread::yield() {\n    return osThreadYield();\n}\n\nosThreadId Thread::gettid() {\n    return osThreadGetId();\n}\n\nvoid Thread::attach_idle_hook(void (*fptr)(void)) {\n    rtos_attach_idle_hook(fptr);\n}\n\nvoid Thread::attach_terminate_hook(void (*fptr)(osThreadId_t id)) {\n    terminate_hook = fptr;\n}\n\nThread::~Thread() {\n    \/\/ terminate is thread safe\n    terminate();\n    if (_dynamic_stack) {\n        delete[] (uint32_t*)(_attr.stack_mem);\n        _attr.stack_mem = (uint32_t*)NULL;\n    }\n}\n\nvoid Thread::_thunk(void * thread_ptr)\n{\n    Thread *t = (Thread*)thread_ptr;\n    t->_task();\n    t->_mutex.lock();\n    t->_tid = (osThreadId)NULL;\n    t->_finished = true;\n    t->_join_sem.release();\n    \/\/ rtos will release the mutex automatically\n}\n\n}\n<commit_msg>Fixed whitespace<commit_after>\/* mbed Microcontroller Library\n * Copyright (c) 2006-2012 ARM 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 THE\n * SOFTWARE.\n *\/\n#include \"rtos\/Thread.h\"\n\n#include \"mbed.h\"\n#include \"rtos\/rtos_idle.h\"\n#include \"mbed_assert.h\"\n\n#define ALIGN_UP(pos, align) ((pos) % (align) ? (pos) +  ((align) - (pos) % (align)) : (pos))\nMBED_STATIC_ASSERT(ALIGN_UP(0, 8) == 0, \"ALIGN_UP macro error\");\nMBED_STATIC_ASSERT(ALIGN_UP(1, 8) == 8, \"ALIGN_UP macro error\");\n\n#define ALIGN_DOWN(pos, align) ((pos) - ((pos) % (align)))\nMBED_STATIC_ASSERT(ALIGN_DOWN(7, 8) == 0, \"ALIGN_DOWN macro error\");\nMBED_STATIC_ASSERT(ALIGN_DOWN(8, 8) == 8, \"ALIGN_DOWN macro error\");\n\nstatic void (*terminate_hook)(osThreadId_t id) = 0;\nextern \"C\" void thread_terminate_hook(osThreadId_t id)\n{\n    if (terminate_hook != (void (*)(osThreadId_t))NULL) {\n        terminate_hook(id);\n    }\n}\n\nnamespace rtos {\n\nvoid Thread::constructor(osPriority priority,\n        uint32_t stack_size, unsigned char *stack_mem, const char *name) {\n\n    const uintptr_t unaligned_mem = reinterpret_cast<uintptr_t>(stack_mem);\n    const uintptr_t aligned_mem = ALIGN_UP(unaligned_mem, 8);\n    const uint32_t offset = aligned_mem - unaligned_mem;\n    const uint32_t aligned_size = ALIGN_DOWN(stack_size - offset, 8);\n\n    _tid = 0;\n    _dynamic_stack = (stack_mem == NULL);\n    _finished = false;\n    memset(&_obj_mem, 0, sizeof(_obj_mem));\n    memset(&_attr, 0, sizeof(_attr));\n    _attr.priority = priority;\n    _attr.stack_size = aligned_size;\n    _attr.name = name ? name : \"application_unnamed_thread\";\n    _attr.stack_mem = reinterpret_cast<uint32_t*>(aligned_mem);\n}\n\nvoid Thread::constructor(Callback<void()> task,\n        osPriority priority, uint32_t stack_size, unsigned char *stack_mem, const char *name) {\n    constructor(priority, stack_size, stack_mem, name);\n\n    switch (start(task)) {\n        case osErrorResource:\n            error(\"OS ran out of threads!\\n\");\n            break;\n        case osErrorParameter:\n            error(\"Thread already running!\\n\");\n            break;\n        case osErrorNoMemory:\n            error(\"Error allocating the stack memory\\n\");\n        default:\n            break;\n    }\n}\n\nosStatus Thread::start(Callback<void()> task) {\n    _mutex.lock();\n\n    if ((_tid != 0) || _finished) {\n        _mutex.unlock();\n        return osErrorParameter;\n    }\n\n    if (_attr.stack_mem == NULL) {\n        _attr.stack_mem = new uint32_t[_attr.stack_size\/sizeof(uint32_t)];\n        MBED_ASSERT(_attr.stack_mem != NULL);\n    }\n\n    \/\/Fill the stack with a magic word for maximum usage checking\n    for (uint32_t i = 0; i < (_attr.stack_size \/ sizeof(uint32_t)); i++) {\n        ((uint32_t *)_attr.stack_mem)[i] = 0xE25A2EA5;\n    }\n\n    memset(&_obj_mem, 0, sizeof(_obj_mem));\n    _attr.cb_size = sizeof(_obj_mem);\n    _attr.cb_mem = &_obj_mem;\n    _task = task;\n    _tid = osThreadNew(Thread::_thunk, this, &_attr);\n    if (_tid == NULL) {\n        if (_dynamic_stack) {\n            delete[] (uint32_t *)(_attr.stack_mem);\n            _attr.stack_mem = (uint32_t*)NULL;\n        }\n        _mutex.unlock();\n        _join_sem.release();\n        return osErrorResource;\n    }\n\n    _mutex.unlock();\n    return osOK;\n}\n\nosStatus Thread::terminate() {\n    osStatus_t ret = osOK;\n    _mutex.lock();\n\n    \/\/ Set the Thread's tid to NULL and\n    \/\/ release the semaphore before terminating\n    \/\/ since this thread could be terminating itself\n    osThreadId_t local_id = _tid;\n    _join_sem.release();\n    _tid = (osThreadId_t)NULL;\n    if (!_finished) {\n        _finished = true;\n        \/\/ if local_id == 0 Thread was not started in first place\n        \/\/ and does not have to be terminated\n        if (local_id != 0) {\n            ret = osThreadTerminate(local_id);\n        }\n    }\n    _mutex.unlock();\n    return ret;\n}\n\nosStatus Thread::join() {\n    int32_t ret = _join_sem.wait();\n    if (ret < 0) {\n        return osError;\n    }\n\n    \/\/ The semaphore has been released so this thread is being\n    \/\/ terminated or has been terminated. Once the mutex has\n    \/\/ been locked it is ensured that the thread is deleted.\n    _mutex.lock();\n    MBED_ASSERT(NULL == _tid);\n    _mutex.unlock();\n\n    \/\/ Release sem so any other threads joining this thread wake up\n    _join_sem.release();\n    return osOK;\n}\n\nosStatus Thread::set_priority(osPriority priority) {\n    osStatus_t ret;\n    _mutex.lock();\n\n    ret = osThreadSetPriority(_tid, priority);\n\n    _mutex.unlock();\n    return ret;\n}\n\nosPriority Thread::get_priority() {\n    osPriority_t ret;\n    _mutex.lock();\n\n    ret = osThreadGetPriority(_tid);\n\n    _mutex.unlock();\n    return ret;\n}\n\nint32_t Thread::signal_set(int32_t flags) {\n    return osThreadFlagsSet(_tid, flags);\n}\n\nThread::State Thread::get_state() {\n    uint8_t state = osThreadTerminated;\n\n    _mutex.lock();\n\n    if (_tid != NULL) {\n#if defined(MBED_OS_BACKEND_RTX5)\n        state = _obj_mem.state;\n#else\n        state = osThreadGetState(_tid);\n#endif\n    }\n\n    _mutex.unlock();\n\n    State user_state;\n\n    switch(state) {\n        case osThreadInactive:\n            user_state = Inactive;\n            break;\n        case osThreadReady:\n            user_state = Ready;\n            break;\n        case osThreadRunning:\n            user_state = Running;\n            break;\n#if defined(MBED_OS_BACKEND_RTX5)\n        case osRtxThreadWaitingDelay:\n            user_state = WaitingDelay;\n            break;\n        case osRtxThreadWaitingJoin:\n            user_state = WaitingJoin;\n            break;\n        case osRtxThreadWaitingThreadFlags:\n            user_state = WaitingThreadFlag;\n            break;\n        case osRtxThreadWaitingEventFlags:\n            user_state = WaitingEventFlag;\n            break;\n        case osRtxThreadWaitingMutex:\n            user_state = WaitingMutex;\n            break;\n        case osRtxThreadWaitingSemaphore:\n            user_state = WaitingSemaphore;\n            break;\n        case osRtxThreadWaitingMemoryPool:\n            user_state = WaitingMemoryPool;\n            break;\n        case osRtxThreadWaitingMessageGet:\n            user_state = WaitingMessageGet;\n            break;\n        case osRtxThreadWaitingMessagePut:\n            user_state = WaitingMessagePut;\n            break;\n#endif\n        case osThreadTerminated:\n        default:\n            user_state = Deleted;\n            break;\n    }\n\n    return user_state;\n}\n\nuint32_t Thread::stack_size() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n    if (_tid != NULL) {\n        size = osThreadGetStackSize(_tid);\n    }\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::free_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n#if defined(MBED_OS_BACKEND_RTX5)\n    if (_tid != NULL) {\n        os_thread_t *thread = (os_thread_t *)_tid;\n        size = (uint32_t)thread->sp - (uint32_t)thread->stack_mem;\n    }\n#endif\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::used_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n#if defined(MBED_OS_BACKEND_RTX5)\n    if (_tid != NULL) {\n        os_thread_t *thread = (os_thread_t *)_tid;\n        size = ((uint32_t)thread->stack_mem + thread->stack_size) - thread->sp;\n    }\n#endif\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::max_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n    if (_tid != NULL) {\n#if defined(MBED_OS_BACKEND_RTX5)\n        os_thread_t *thread = (os_thread_t *)_tid;\n        uint32_t high_mark = 0;\n        while (((uint32_t *)(thread->stack_mem))[high_mark] == 0xE25A2EA5)\n            high_mark++;\n        size = thread->stack_size - (high_mark * sizeof(uint32_t));\n#else\n        size = osThreadGetStackSize(_tid) - osThreadGetStackSpace(_tid);\n#endif\n    }\n\n    _mutex.unlock();\n    return size;\n}\n\nconst char *Thread::get_name() {\n    return _attr.name;\n}\n\nint32_t Thread::signal_clr(int32_t flags) {\n    return osThreadFlagsClear(flags);\n}\n\nosEvent Thread::signal_wait(int32_t signals, uint32_t millisec) {\n    uint32_t res;\n    osEvent evt;\n    uint32_t options = osFlagsWaitAll;\n    if (signals == 0) {\n        options = osFlagsWaitAny;\n        signals = 0x7FFFFFFF;\n    }\n    res = osThreadFlagsWait(signals, options, millisec);\n    if (res & osFlagsError) {\n        switch (res) {\n            case osFlagsErrorISR:\n                evt.status = osErrorISR;\n                break;\n            case osFlagsErrorResource:\n                evt.status = osOK;\n                break;\n            case osFlagsErrorTimeout:\n                evt.status = (osStatus)osEventTimeout;\n                break;\n            case osFlagsErrorParameter:\n            default:\n                evt.status = (osStatus)osErrorValue;\n                break;\n        }\n    } else {\n        evt.status = (osStatus)osEventSignal;\n        evt.value.signals = res;\n    }\n\n    return evt;\n}\n\nosStatus Thread::wait(uint32_t millisec) {\n    return osDelay(millisec);\n}\n\nosStatus Thread::yield() {\n    return osThreadYield();\n}\n\nosThreadId Thread::gettid() {\n    return osThreadGetId();\n}\n\nvoid Thread::attach_idle_hook(void (*fptr)(void)) {\n    rtos_attach_idle_hook(fptr);\n}\n\nvoid Thread::attach_terminate_hook(void (*fptr)(osThreadId_t id)) {\n    terminate_hook = fptr;\n}\n\nThread::~Thread() {\n    \/\/ terminate is thread safe\n    terminate();\n    if (_dynamic_stack) {\n        delete[] (uint32_t*)(_attr.stack_mem);\n        _attr.stack_mem = (uint32_t*)NULL;\n    }\n}\n\nvoid Thread::_thunk(void * thread_ptr)\n{\n    Thread *t = (Thread*)thread_ptr;\n    t->_task();\n    t->_mutex.lock();\n    t->_tid = (osThreadId)NULL;\n    t->_finished = true;\n    t->_join_sem.release();\n    \/\/ rtos will release the mutex automatically\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the CernVM File System.\n *\/\n\n#include <gtest\/gtest.h>\n\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include \"..\/..\/cvmfs\/catalog.h\"\n#include \"..\/..\/cvmfs\/catalog_mgr.h\"\n#include \"..\/..\/cvmfs\/catalog_rw.h\"\n#include \"..\/..\/cvmfs\/hash.h\"\n#include \"..\/..\/cvmfs\/shortstring.h\"\n#include \"..\/..\/cvmfs\/util.h\"\n#include \"testutil.h\"\n\nusing namespace std;  \/\/ NOLINT\n\n\nnamespace catalog {\n\nclass T_CatalogManager : public ::testing::Test {\n protected:\n  void SetUp() {\n    catalog_mgr_ = new MockCatalogManager(&statistics_);\n    catalog_mgr_->Init();\n  }\n\n  void TearDown() {\n    delete catalog_mgr_;\n  }\n\n private:\n  MockCatalogManager *catalog_mgr_;\n  perf::Statistics statistics_;\n};\n\nTEST_F(T_CatalogManager, ) {\n\n}\n\n}\n<commit_msg>TEST: Added LoopUp text to t_catalog_mgr.cc<commit_after>\/**\n * This file is part of the CernVM File System.\n *\/\n\n#include <gtest\/gtest.h>\n\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include \"..\/..\/cvmfs\/catalog.h\"\n#include \"..\/..\/cvmfs\/catalog_mgr.h\"\n#include \"..\/..\/cvmfs\/hash.h\"\n#include \"..\/..\/cvmfs\/shortstring.h\"\n#include \"..\/..\/cvmfs\/util.h\"\n#include \"testutil.h\"\n\nusing namespace std;  \/\/ NOLINT\n\n\nnamespace catalog {\n\nclass T_CatalogManager : public ::testing::Test {\n protected:\n  void SetUp() {\n    catalog_mgr_ = new MockCatalogManager(&statistics_);\n  }\n\n  void TearDown() {\n    delete catalog_mgr_;\n  }\n\n  void AddTree() {\n    const shash::Any empty_hash = shash::Any();\n    const int size = 32;\n    const size_t file_size = 4096;\n    const char suffix = shash::kSha1;\n    ASSERT_TRUE(catalog_mgr_->Init());\n    shash::Any hash;\n    shash::Any empty_content;\n    \/\/ adding \"\"\n    MockCatalog *root_catalog = catalog_mgr_->RetrieveRootCatalog();\n    root_catalog->AddFile(empty_content, file_size, \"\", \"\");\n    \/\/ adding \"\/dir\"\n    root_catalog->AddFile(empty_content, file_size, \"\", \"dir\");\n    \/\/ adding \"\/file1\"\n    hash = shash::Any(shash::kSha1,\n                      reinterpret_cast<const unsigned char*>(hashes[1]),\n                      size, suffix);\n    root_catalog->AddFile(hash, file_size, \"\", \"file1\");\n    \/\/ adding \"\/dir\/dir\"\n    root_catalog->AddFile(empty_content, file_size, \"\/dir\", \"dir\");\n    \/\/ adding \"\/dir\/dir\/file2\"\n    hash = shash::Any(shash::kSha1,\n                      reinterpret_cast<const unsigned char*>(hashes[1]),\n                      size, suffix);\n    root_catalog->AddFile(hash, file_size, \"\/dir\/dir\", \"file1\");\n    \/\/ adding \"\/dir\/dir\/dir\"\n    root_catalog->AddFile(empty_content, file_size, \"\/dir\/dir\", \"dir\");\n    \/\/ adding a nested catalog in \"\/dir\/dir\/dir\"\n    string catalog_path_str = \"\/dir\/dir\/dir\";\n    PathString catalog_path(catalog_path_str.c_str(),\n                            catalog_path_str.length());\n    MockCatalog *new_catalog = catalog_mgr_->CreateCatalog(\n        catalog_path, shash::Any(), root_catalog);\n    ASSERT_NE(static_cast<MockCatalog*>(NULL), new_catalog);\n    ASSERT_EQ(1u, root_catalog->GetChildren().size());\n    \/\/ adding \"\/dir\/dir\/dir\/file3\" to the new nested catalog\n    hash = shash::Any(shash::kSha1,\n                          reinterpret_cast<const unsigned char*>(hashes[2]),\n                          size, suffix);\n    new_catalog->AddFile(hash, file_size, \"\/dir\/dir\/dir\", \"file3\");\n    \/\/ adding \"\/dir\/dir\/dir\/file4\" to the new nested catalog\n    hash = shash::Any(shash::kSha1,\n                          reinterpret_cast<const unsigned char*>(hashes[3]),\n                          size, suffix);\n    new_catalog->AddFile(hash, file_size, \"\/dir\/dir\/dir\", \"file4\");\n    \/\/ detach the recently created catalog\n    catalog_mgr_->DetachNested();\n    ASSERT_EQ(0u, root_catalog->GetChildren().size());\n    ASSERT_EQ(1, catalog_mgr_->GetNumCatalogs());\n  }\n\n protected:\n  const static char *hashes[];\n  MockCatalogManager *catalog_mgr_;\n  perf::Statistics statistics_;\n};\n\nconst char *T_CatalogManager::hashes[] = {\n     \"b026324c6904b2a9cb4b88d6d61c81d1000000\",\n     \"26ab0db90d72e28ad0ba1e22ee510510000000\",\n     \"6d7fce9fee471194aa8b5b6e47267f03000000\",\n     \"48a24b70a0b376535542b996af517398000000\",\n     \"1dcca23355272056f04fe8bf20edfce0000000\"\n};\n\n\n\nTEST_F(T_CatalogManager, InitialConfiguration) {\n  EXPECT_TRUE(catalog_mgr_->Init());\n  EXPECT_EQ(1, catalog_mgr_->GetNumCatalogs());\n  EXPECT_EQ(1u, catalog_mgr_->GetRevision());\n  EXPECT_FALSE(catalog_mgr_->GetVolatileFlag());\n  EXPECT_EQ(0u, catalog_mgr_->GetTTL());\n}\n\nTEST_F(T_CatalogManager, Statistics) {\n  EXPECT_TRUE(catalog_mgr_->Init());\n  Statistics st = catalog_mgr_->statistics();\n  EXPECT_EQ(0u, st.n_listing->Get());\n  EXPECT_EQ(0u, st.n_lookup_inode->Get());\n  EXPECT_EQ(0u, st.n_lookup_path->Get());\n  EXPECT_EQ(0u, st.n_lookup_path_negative->Get());\n  EXPECT_EQ(0u, st.n_lookup_xattrs->Get());\n  EXPECT_EQ(0u, st.n_nested_listing->Get());\n}\n\nTEST_F(T_CatalogManager, InodeConfiguration) {\n  InodeGenerationAnnotation annotation;\n  catalog_mgr_->SetInodeAnnotation(&annotation);\n  EXPECT_TRUE(catalog_mgr_->Init());\n}\n\nTEST_F(T_CatalogManager, Lookup) {\n  AddTree();\n  catalog::DirectoryEntry dirent;\n  LookupOptions option = kLookupSole;\n  EXPECT_TRUE(catalog_mgr_->LookupPath(\"\/dir\", option, &dirent));\n}\n\nTEST_F(T_CatalogManager, Remount) {\n  EXPECT_TRUE(catalog_mgr_->Init());\n  EXPECT_EQ(kLoadNew, catalog_mgr_->Remount(true));\n}\n\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#ifndef ROSETTASTONE_TRIGGER_ENUMS_HPP\n#define ROSETTASTONE_TRIGGER_ENUMS_HPP\n\nnamespace RosettaStone\n{\n\/\/! \\brief An enumerator for identifying trigger type.\nenum class TriggerType\n{\n    NONE,        \/\/!< The effect has nothing.\n    TURN_START,  \/\/!< The effect will be triggered at the start of turn.\n    TURN_END,    \/\/!< The effect will be triggered at the end of turn.\n    HEAL,        \/\/!< The effect will be triggered when characters are healed.\n};\n\n\/\/! \\brief An enumerator for identifying trigger source.\nenum class TriggerSource\n{\n    NONE,\n    ALL_MINIONS,\n};\n\n\/\/! \\brief An enumerator for identifying sequence type.\nenum class SequenceType\n{\n    NONE,\n};\n}  \/\/ namespace RosettaStone\n\n#endif  \/\/ ROSETTASTONE_TRIGGER_ENUMS_HPP\n<commit_msg>feat(card-impl): Add 'ATTACK' to enum 'TriggerType'<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#ifndef ROSETTASTONE_TRIGGER_ENUMS_HPP\n#define ROSETTASTONE_TRIGGER_ENUMS_HPP\n\nnamespace RosettaStone\n{\n\/\/! \\brief An enumerator for identifying trigger type.\nenum class TriggerType\n{\n    NONE,        \/\/!< The effect has nothing.\n    TURN_START,  \/\/!< The effect will be triggered at the start of turn.\n    TURN_END,    \/\/!< The effect will be triggered at the end of turn.\n    HEAL,        \/\/!< The effect will be triggered when characters are healed.\n    ATTACK,      \/\/!< The effect will be triggered when characters attack.\n};\n\n\/\/! \\brief An enumerator for identifying trigger source.\nenum class TriggerSource\n{\n    NONE,\n    HERO,\n    ALL_MINIONS,\n};\n\n\/\/! \\brief An enumerator for identifying sequence type.\nenum class SequenceType\n{\n    NONE,\n};\n}  \/\/ namespace RosettaStone\n\n#endif  \/\/ ROSETTASTONE_TRIGGER_ENUMS_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2017 The Regents of the University of Michigan\n\/\/ This file is part of the HOOMD-blue project, released under the BSD 3-Clause License.\n\n\n\/\/ Maintainer: joaander All developers are free to add the calls needed to export their modules\n\n#include \"HOOMDMath.h\"\n#include \"ExecutionConfiguration.h\"\n#include \"ClockSource.h\"\n#include \"Profiler.h\"\n#include \"ParticleData.h\"\n#include \"SystemDefinition.h\"\n#include \"BondedGroupData.h\"\n#include \"Initializers.h\"\n#include \"GetarInitializer.h\"\n#include \"GSDReader.h\"\n#include \"Compute.h\"\n#include \"ComputeThermo.h\"\n#include \"CellList.h\"\n#include \"CellListStencil.h\"\n#include \"ForceCompute.h\"\n#include \"ForceConstraint.h\"\n#include \"ConstForceCompute.h\"\n#include \"Analyzer.h\"\n#include \"IMDInterface.h\"\n#include \"DCDDumpWriter.h\"\n#include \"GetarDumpWriter.h\"\n#include \"GSDDumpWriter.h\"\n#include \"Logger.h\"\n#include \"LogPlainTXT.h\"\n#include \"LogMatrix.h\"\n#include \"LogHDF5.h\"\n#include \"CallbackAnalyzer.h\"\n#include \"Updater.h\"\n#include \"Integrator.h\"\n#include \"SFCPackUpdater.h\"\n#include \"BoxResizeUpdater.h\"\n#include \"System.h\"\n#include \"Variant.h\"\n#include \"Messenger.h\"\n#include \"SnapshotSystemData.h\"\n\n\/\/ include GPU classes\n#ifdef ENABLE_CUDA\n#include <cuda.h>\n#include \"CellListGPU.h\"\n#include \"ComputeThermoGPU.h\"\n#include \"SFCPackUpdaterGPU.h\"\n\n#include <cuda_profiler_api.h>\n#endif\n\n\/\/ include MPI classes\n#ifdef ENABLE_MPI\n#include \"Communicator.h\"\n#include \"DomainDecomposition.h\"\n#include \"LoadBalancer.h\"\n\n#ifdef ENABLE_CUDA\n#include \"CommunicatorGPU.h\"\n#include \"LoadBalancerGPU.h\"\n#endif \/\/ ENABLE_CUDA\n#endif \/\/ ENABLE_MPI\n\n#include \"SignalHandler.h\"\n\n#include \"HOOMDVersion.h\"\n#include \"hoomd\/extern\/num_util.h\"\n\n#include <hoomd\/extern\/pybind\/include\/pybind11\/pybind11.h>\n#include <hoomd\/extern\/pybind\/include\/pybind11\/stl_bind.h>\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\nusing namespace std;\n\n\/*! \\file hoomd_module.cc\n    \\brief Brings all of the export_* functions together to export the hoomd python module\n*\/\n\n\/* numpy is terrible (see \/opt\/local\/Library\/Frameworks\/Python.framework\/Versions\/2.7\/\nlib\/python2.7\/site-packages\/numpy\/core\/generate_numpy_array.py)\nThe following #defines help get around this\n*\/\n\n#if PY_VERSION_HEX >= 0x03000000\n#define MY_PY_VER_3x\n#else\n#define MY_PY_VER_2x\n#endif\n\n#ifdef MY_PY_VER_3x\nvoid *my_import_array()\n    {\n    import_array();\n    return NULL;\n    }\n#endif\n#ifdef MY_PY_VER_2x\nvoid my_import_array()\n    {\n    import_array();\n    }\n#endif\n\n\/\/! Method for getting the current version of HOOMD\n\/*! \\returns Current HOOMD version identification string\n*\/\nstring get_hoomd_version()\n    {\n    ostringstream ver;\n    \/\/ always outputting main version number: #402\n    ver << \"HOOMD-blue \" << HOOMD_VERSION << endl;\n\n    return ver.str();\n    }\n\n\/\/! Layer for omp_get_num_procs()\nint get_num_procs()\n    {\n    return 1;\n    }\n\n\/\/! Get the hoomd version as a tuple\npybind11::object get_hoomd_version_tuple()\n    {\n    return pybind11::make_tuple(HOOMD_VERSION_MAJOR, HOOMD_VERSION_MINOR, HOOMD_VERSION_PATCH);\n    }\n\n\/\/! Get the CUDA version as a tuple\npybind11::object get_cuda_version_tuple()\n    {\n    #ifdef ENABLE_CUDA\n    int major = CUDA_VERSION \/ 1000;\n    int minor = CUDA_VERSION \/ 10 % 100;\n    return pybind11::make_tuple(major, minor);\n    #else\n    return pybind11::make_tuple(0,0);\n    #endif\n    }\n\n\/\/! Get the compiler version\nstring get_compiler_version()\n    {\n    #if defined(__GNUC__) && !(defined(__clang__) || defined(__INTEL_COMPILER))\n    ostringstream o;\n    o << \"gcc \" << __GNUC__ << \".\" << __GNUC_MINOR__ << \".\" <<  __GNUC_PATCHLEVEL__;\n    return o.str();\n\n    #elif defined(__clang__)\n    ostringstream o;\n    o << \"clang \" << __clang_major__ << \".\" << __clang_minor__ << \".\" <<  __clang_patchlevel__;\n    return o.str();\n\n    #elif defined(__INTEL_COMPILER)\n    ostringstream o;\n    o << \"icc \" << __INTEL_COMPILER;\n    return o.str();\n\n    #else\n    return string(\"unknown\");\n\n    #endif\n    }\n\n\/\/! Determine availability of MPI support\nbool is_MPI_available()\n   {\n   return\n#ifdef ENABLE_MPI\n       true;\n#else\n       false;\n#endif\n    }\n\nvoid mpi_barrier_world()\n    {\n    #ifdef ENABLE_MPI\n    MPI_Barrier(MPI_COMM_WORLD);\n    #endif\n    }\n\n\/\/! Start the CUDA profiler\nvoid cuda_profile_start()\n    {\n    #ifdef ENABLE_CUDA\n    cudaDeviceSynchronize();\n    cudaProfilerStart();\n    #endif\n    }\n\n\/\/! Stop the CUDA profiler\nvoid cuda_profile_stop()\n    {\n    #ifdef ENABLE_CUDA\n    cudaDeviceSynchronize();\n    cudaProfilerStop();\n    #endif\n    }\n\n\/\/ values used in measuring hoomd launch timing\nunsigned int hoomd_launch_time, hoomd_start_time, hoomd_mpi_init_time;\nbool hoomd_launch_timing=false;\n\n#ifdef ENABLE_MPI\n\/\/! Environment variables needed for setting up MPI\nchar env_enable_mpi_cuda[] = \"MV2_USE_CUDA=1\";\n\n\/\/! Initialize the MPI environment\nvoid initialize_mpi()\n    {\n    #ifdef ENABLE_MPI_CUDA\n    \/\/ if we are using an MPI-CUDA implementation, enable this feature\n    \/\/ before the MPI_Init\n    putenv(env_enable_mpi_cuda);\n    #endif\n\n    \/\/ benchmark hoomd launch times\n    if (getenv(\"HOOMD_LAUNCH_TIME\"))\n        {\n        \/\/ get the time that mpirun was called\n        hoomd_launch_time = atoi(getenv(\"HOOMD_LAUNCH_TIME\"));\n\n        \/\/ compute the number of seconds to get here\n        timeval t;\n        gettimeofday(&t, NULL);\n        hoomd_start_time = t.tv_sec - hoomd_launch_time;\n        hoomd_launch_timing = true;\n        }\n\n    \/\/ initalize MPI\n    MPI_Init(0, (char ***) NULL);\n\n    if (hoomd_launch_timing)\n        {\n        \/\/ compute the number of seconds to get past mpi_init\n        timeval t;\n        gettimeofday(&t, NULL);\n        hoomd_mpi_init_time = t.tv_sec - hoomd_launch_time;\n        }\n    }\n\n\/\/! Get the processor name associated to this rank\nstring get_mpi_proc_name()\n    {\n    char proc_name[MPI_MAX_PROCESSOR_NAME];\n    int name_len;\n    MPI_Get_processor_name(proc_name, &name_len);\n    return string(proc_name);\n    }\n\n\/\/! Finalize MPI environment\nvoid finalize_mpi()\n    {\n    MPI_Finalize();\n    }\n#endif\n\n\/\/! Abort MPI runs\nvoid abort_mpi(std::shared_ptr<ExecutionConfiguration> exec_conf)\n    {\n    #ifdef ENABLE_MPI\n    if(exec_conf->getNRanksGlobal() > 1)\n        {\n        MPI_Abort(exec_conf->getMPICommunicator(), MPI_ERR_OTHER);\n        }\n    #endif\n    }\n\n\/\/! broadcast string from root rank to all other ranks\nstd::string mpi_bcast_str(const std::string& s, std::shared_ptr<ExecutionConfiguration> exec_conf)\n    {\n    #ifdef ENABLE_MPI\n    std::string result = s;\n    bcast(result, 0, exec_conf->getMPICommunicator());\n    return result;\n    #else\n    return s;\n    #endif\n    }\n\n\/\/! Create the python module\n\/*! each class setup their own python exports in a function export_ClassName\n    create the hoomd python module and define the exports here.\n*\/\nPYBIND11_PLUGIN(_hoomd)\n    {\n    pybind11::module m(\"_hoomd\");\n\n    #ifdef ENABLE_MPI\n    \/\/ initialize MPI early\n    initialize_mpi();\n\n    \/\/ register clean-up function\n    Py_AtExit(finalize_mpi);\n    m.def(\"get_mpi_proc_name\", get_mpi_proc_name);\n    #endif\n\n    \/\/ setup needed for numpy\n    my_import_array();\n\n    m.def(\"abort_mpi\", abort_mpi);\n    m.def(\"mpi_barrier_world\", mpi_barrier_world);\n    m.def(\"mpi_bcast_str\", mpi_bcast_str);\n\n    m.def(\"hoomd_compile_flags\", &hoomd_compile_flags);\n    m.def(\"output_version_info\", &output_version_info);\n    m.def(\"get_hoomd_version\", &get_hoomd_version);\n\n    m.def(\"get_num_procs\", &get_num_procs);\n    m.attr(\"__version__\") = get_hoomd_version_tuple();\n    m.attr(\"__git_sha1__\") = pybind11::str(HOOMD_GIT_SHA1);\n    m.attr(\"__git_refspec__\") = pybind11::str(HOOMD_GIT_REFSPEC);\n    m.attr(\"__cuda_version__\") = get_cuda_version_tuple();\n    m.attr(\"__compiler_version__\") = pybind11::str(get_compiler_version());\n\n    m.def(\"is_MPI_available\", &is_MPI_available);\n\n    m.def(\"cuda_profile_start\", &cuda_profile_start);\n    m.def(\"cuda_profile_stop\", &cuda_profile_stop);\n\n    pybind11::bind_vector<Scalar>(m,\"std_vector_scalar\");\n    pybind11::bind_vector<string>(m,\"std_vector_string\");\n    pybind11::bind_vector<unsigned int>(m,\"std_vector_uint\");\n    pybind11::bind_vector<int>(m,\"std_vector_int\");\n    pybind11::bind_vector<Scalar3>(m,\"std_vector_scalar3\");\n    pybind11::bind_vector<Scalar4>(m,\"std_vector_scalar4\");\n\n    InstallSIGINTHandler();\n\n    \/\/ utils\n    export_hoomd_math_functions(m);\n    export_ClockSource(m);\n    export_Profiler(m);\n\n    \/\/ data structures\n    export_BoxDim(m);\n    export_ParticleData(m);\n    export_SnapshotParticleData(m);\n    export_ExecutionConfiguration(m);\n    export_SystemDefinition(m);\n    export_SnapshotSystemData(m);\n    export_BondedGroupData<BondData,Bond>(m,\"BondData\",\"BondDataSnapshot\");\n    export_BondedGroupData<AngleData,Angle>(m,\"AngleData\",\"AngleDataSnapshot\");\n    export_BondedGroupData<DihedralData,Dihedral>(m,\"DihedralData\",\"DihedralDataSnapshot\");\n    export_BondedGroupData<ImproperData,Dihedral>(m,\"ImproperData\",\"ImproperDataSnapshot\",false);\n    export_BondedGroupData<ConstraintData,Constraint>(m,\"ConstraintData\",\"ConstraintDataSnapshot\");\n    export_BondedGroupData<PairData,Bond>(m,\"PairData\",\"PairDataSnapshot\",false);\n\n    \/\/ initializers\n    export_GSDReader(m);\n    getardump::export_GetarInitializer(m);\n\n    \/\/ computes\n    export_Compute(m);\n    export_ComputeThermo(m);\n    export_CellList(m);\n    export_CellListStencil(m);\n    export_ForceCompute(m);\n    export_ForceConstraint(m);\n    export_ConstForceCompute(m);\n\n#ifdef ENABLE_CUDA\n    export_CellListGPU(m);\n    export_ComputeThermoGPU(m);\n#endif\n\n    \/\/ analyzers\n    export_Analyzer(m);\n    export_IMDInterface(m);\n    export_DCDDumpWriter(m);\n    getardump::export_GetarDumpWriter(m);\n    export_GSDDumpWriter(m);\n    export_Logger(m);\n    export_LogPlainTXT(m);\n    export_LogMatrix(m);\n    export_LogHDF5(m);\n    export_CallbackAnalyzer(m);\n    export_ParticleGroup(m);\n\n    \/\/ updaters\n    export_Updater(m);\n    export_Integrator(m);\n    export_BoxResizeUpdater(m);\n    export_SFCPackUpdater(m);\n#ifdef ENABLE_CUDA\n    export_SFCPackUpdaterGPU(m);\n#endif\n\n#ifdef ENABLE_MPI\n    export_Communicator(m);\n    export_DomainDecomposition(m);\n    export_LoadBalancer(m);\n#ifdef ENABLE_CUDA\n    export_CommunicatorGPU(m);\n    export_LoadBalancerGPU(m);\n#endif \/\/ ENABLE_CUDA\n#endif \/\/ ENABLE_MPI\n\n    \/\/ system\n    export_System(m);\n\n    \/\/ variant\n    export_Variant(m);\n\n    \/\/ messenger\n    export_Messenger(m);\n\n    return m.ptr();\n    }\n<commit_msg>Validate pybind11 version<commit_after>\/\/ Copyright (c) 2009-2017 The Regents of the University of Michigan\n\/\/ This file is part of the HOOMD-blue project, released under the BSD 3-Clause License.\n\n\n\/\/ Maintainer: joaander All developers are free to add the calls needed to export their modules\n\n#include \"HOOMDMath.h\"\n#include \"ExecutionConfiguration.h\"\n#include \"ClockSource.h\"\n#include \"Profiler.h\"\n#include \"ParticleData.h\"\n#include \"SystemDefinition.h\"\n#include \"BondedGroupData.h\"\n#include \"Initializers.h\"\n#include \"GetarInitializer.h\"\n#include \"GSDReader.h\"\n#include \"Compute.h\"\n#include \"ComputeThermo.h\"\n#include \"CellList.h\"\n#include \"CellListStencil.h\"\n#include \"ForceCompute.h\"\n#include \"ForceConstraint.h\"\n#include \"ConstForceCompute.h\"\n#include \"Analyzer.h\"\n#include \"IMDInterface.h\"\n#include \"DCDDumpWriter.h\"\n#include \"GetarDumpWriter.h\"\n#include \"GSDDumpWriter.h\"\n#include \"Logger.h\"\n#include \"LogPlainTXT.h\"\n#include \"LogMatrix.h\"\n#include \"LogHDF5.h\"\n#include \"CallbackAnalyzer.h\"\n#include \"Updater.h\"\n#include \"Integrator.h\"\n#include \"SFCPackUpdater.h\"\n#include \"BoxResizeUpdater.h\"\n#include \"System.h\"\n#include \"Variant.h\"\n#include \"Messenger.h\"\n#include \"SnapshotSystemData.h\"\n\n\/\/ include GPU classes\n#ifdef ENABLE_CUDA\n#include <cuda.h>\n#include \"CellListGPU.h\"\n#include \"ComputeThermoGPU.h\"\n#include \"SFCPackUpdaterGPU.h\"\n\n#include <cuda_profiler_api.h>\n#endif\n\n\/\/ include MPI classes\n#ifdef ENABLE_MPI\n#include \"Communicator.h\"\n#include \"DomainDecomposition.h\"\n#include \"LoadBalancer.h\"\n\n#ifdef ENABLE_CUDA\n#include \"CommunicatorGPU.h\"\n#include \"LoadBalancerGPU.h\"\n#endif \/\/ ENABLE_CUDA\n#endif \/\/ ENABLE_MPI\n\n#include \"SignalHandler.h\"\n\n#include \"HOOMDVersion.h\"\n#include \"hoomd\/extern\/num_util.h\"\n\n#include <hoomd\/extern\/pybind\/include\/pybind11\/pybind11.h>\n#include <hoomd\/extern\/pybind\/include\/pybind11\/stl_bind.h>\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\nusing namespace std;\n\n\/*! \\file hoomd_module.cc\n    \\brief Brings all of the export_* functions together to export the hoomd python module\n*\/\n\n\/* numpy is terrible (see \/opt\/local\/Library\/Frameworks\/Python.framework\/Versions\/2.7\/\nlib\/python2.7\/site-packages\/numpy\/core\/generate_numpy_array.py)\nThe following #defines help get around this\n*\/\n\n#if (PYBIND11_VERSION_MAJOR) != 1 || (PYBIND11_VERSION_MINOR) != 8\n#error HOOMD-blue requires pybind11 1.8.x\n#endif\n\n#if PY_VERSION_HEX >= 0x03000000\n#define MY_PY_VER_3x\n#else\n#define MY_PY_VER_2x\n#endif\n\n#ifdef MY_PY_VER_3x\nvoid *my_import_array()\n    {\n    import_array();\n    return NULL;\n    }\n#endif\n#ifdef MY_PY_VER_2x\nvoid my_import_array()\n    {\n    import_array();\n    }\n#endif\n\n\/\/! Method for getting the current version of HOOMD\n\/*! \\returns Current HOOMD version identification string\n*\/\nstring get_hoomd_version()\n    {\n    ostringstream ver;\n    \/\/ always outputting main version number: #402\n    ver << \"HOOMD-blue \" << HOOMD_VERSION << endl;\n\n    return ver.str();\n    }\n\n\/\/! Layer for omp_get_num_procs()\nint get_num_procs()\n    {\n    return 1;\n    }\n\n\/\/! Get the hoomd version as a tuple\npybind11::object get_hoomd_version_tuple()\n    {\n    return pybind11::make_tuple(HOOMD_VERSION_MAJOR, HOOMD_VERSION_MINOR, HOOMD_VERSION_PATCH);\n    }\n\n\/\/! Get the CUDA version as a tuple\npybind11::object get_cuda_version_tuple()\n    {\n    #ifdef ENABLE_CUDA\n    int major = CUDA_VERSION \/ 1000;\n    int minor = CUDA_VERSION \/ 10 % 100;\n    return pybind11::make_tuple(major, minor);\n    #else\n    return pybind11::make_tuple(0,0);\n    #endif\n    }\n\n\/\/! Get the compiler version\nstring get_compiler_version()\n    {\n    #if defined(__GNUC__) && !(defined(__clang__) || defined(__INTEL_COMPILER))\n    ostringstream o;\n    o << \"gcc \" << __GNUC__ << \".\" << __GNUC_MINOR__ << \".\" <<  __GNUC_PATCHLEVEL__;\n    return o.str();\n\n    #elif defined(__clang__)\n    ostringstream o;\n    o << \"clang \" << __clang_major__ << \".\" << __clang_minor__ << \".\" <<  __clang_patchlevel__;\n    return o.str();\n\n    #elif defined(__INTEL_COMPILER)\n    ostringstream o;\n    o << \"icc \" << __INTEL_COMPILER;\n    return o.str();\n\n    #else\n    return string(\"unknown\");\n\n    #endif\n    }\n\n\/\/! Determine availability of MPI support\nbool is_MPI_available()\n   {\n   return\n#ifdef ENABLE_MPI\n       true;\n#else\n       false;\n#endif\n    }\n\nvoid mpi_barrier_world()\n    {\n    #ifdef ENABLE_MPI\n    MPI_Barrier(MPI_COMM_WORLD);\n    #endif\n    }\n\n\/\/! Start the CUDA profiler\nvoid cuda_profile_start()\n    {\n    #ifdef ENABLE_CUDA\n    cudaDeviceSynchronize();\n    cudaProfilerStart();\n    #endif\n    }\n\n\/\/! Stop the CUDA profiler\nvoid cuda_profile_stop()\n    {\n    #ifdef ENABLE_CUDA\n    cudaDeviceSynchronize();\n    cudaProfilerStop();\n    #endif\n    }\n\n\/\/ values used in measuring hoomd launch timing\nunsigned int hoomd_launch_time, hoomd_start_time, hoomd_mpi_init_time;\nbool hoomd_launch_timing=false;\n\n#ifdef ENABLE_MPI\n\/\/! Environment variables needed for setting up MPI\nchar env_enable_mpi_cuda[] = \"MV2_USE_CUDA=1\";\n\n\/\/! Initialize the MPI environment\nvoid initialize_mpi()\n    {\n    #ifdef ENABLE_MPI_CUDA\n    \/\/ if we are using an MPI-CUDA implementation, enable this feature\n    \/\/ before the MPI_Init\n    putenv(env_enable_mpi_cuda);\n    #endif\n\n    \/\/ benchmark hoomd launch times\n    if (getenv(\"HOOMD_LAUNCH_TIME\"))\n        {\n        \/\/ get the time that mpirun was called\n        hoomd_launch_time = atoi(getenv(\"HOOMD_LAUNCH_TIME\"));\n\n        \/\/ compute the number of seconds to get here\n        timeval t;\n        gettimeofday(&t, NULL);\n        hoomd_start_time = t.tv_sec - hoomd_launch_time;\n        hoomd_launch_timing = true;\n        }\n\n    \/\/ initalize MPI\n    MPI_Init(0, (char ***) NULL);\n\n    if (hoomd_launch_timing)\n        {\n        \/\/ compute the number of seconds to get past mpi_init\n        timeval t;\n        gettimeofday(&t, NULL);\n        hoomd_mpi_init_time = t.tv_sec - hoomd_launch_time;\n        }\n    }\n\n\/\/! Get the processor name associated to this rank\nstring get_mpi_proc_name()\n    {\n    char proc_name[MPI_MAX_PROCESSOR_NAME];\n    int name_len;\n    MPI_Get_processor_name(proc_name, &name_len);\n    return string(proc_name);\n    }\n\n\/\/! Finalize MPI environment\nvoid finalize_mpi()\n    {\n    MPI_Finalize();\n    }\n#endif\n\n\/\/! Abort MPI runs\nvoid abort_mpi(std::shared_ptr<ExecutionConfiguration> exec_conf)\n    {\n    #ifdef ENABLE_MPI\n    if(exec_conf->getNRanksGlobal() > 1)\n        {\n        MPI_Abort(exec_conf->getMPICommunicator(), MPI_ERR_OTHER);\n        }\n    #endif\n    }\n\n\/\/! broadcast string from root rank to all other ranks\nstd::string mpi_bcast_str(const std::string& s, std::shared_ptr<ExecutionConfiguration> exec_conf)\n    {\n    #ifdef ENABLE_MPI\n    std::string result = s;\n    bcast(result, 0, exec_conf->getMPICommunicator());\n    return result;\n    #else\n    return s;\n    #endif\n    }\n\n\/\/! Create the python module\n\/*! each class setup their own python exports in a function export_ClassName\n    create the hoomd python module and define the exports here.\n*\/\nPYBIND11_PLUGIN(_hoomd)\n    {\n    pybind11::module m(\"_hoomd\");\n\n    #ifdef ENABLE_MPI\n    \/\/ initialize MPI early\n    initialize_mpi();\n\n    \/\/ register clean-up function\n    Py_AtExit(finalize_mpi);\n    m.def(\"get_mpi_proc_name\", get_mpi_proc_name);\n    #endif\n\n    \/\/ setup needed for numpy\n    my_import_array();\n\n    m.def(\"abort_mpi\", abort_mpi);\n    m.def(\"mpi_barrier_world\", mpi_barrier_world);\n    m.def(\"mpi_bcast_str\", mpi_bcast_str);\n\n    m.def(\"hoomd_compile_flags\", &hoomd_compile_flags);\n    m.def(\"output_version_info\", &output_version_info);\n    m.def(\"get_hoomd_version\", &get_hoomd_version);\n\n    m.def(\"get_num_procs\", &get_num_procs);\n    m.attr(\"__version__\") = get_hoomd_version_tuple();\n    m.attr(\"__git_sha1__\") = pybind11::str(HOOMD_GIT_SHA1);\n    m.attr(\"__git_refspec__\") = pybind11::str(HOOMD_GIT_REFSPEC);\n    m.attr(\"__cuda_version__\") = get_cuda_version_tuple();\n    m.attr(\"__compiler_version__\") = pybind11::str(get_compiler_version());\n\n    m.def(\"is_MPI_available\", &is_MPI_available);\n\n    m.def(\"cuda_profile_start\", &cuda_profile_start);\n    m.def(\"cuda_profile_stop\", &cuda_profile_stop);\n\n    pybind11::bind_vector<Scalar>(m,\"std_vector_scalar\");\n    pybind11::bind_vector<string>(m,\"std_vector_string\");\n    pybind11::bind_vector<unsigned int>(m,\"std_vector_uint\");\n    pybind11::bind_vector<int>(m,\"std_vector_int\");\n    pybind11::bind_vector<Scalar3>(m,\"std_vector_scalar3\");\n    pybind11::bind_vector<Scalar4>(m,\"std_vector_scalar4\");\n\n    InstallSIGINTHandler();\n\n    \/\/ utils\n    export_hoomd_math_functions(m);\n    export_ClockSource(m);\n    export_Profiler(m);\n\n    \/\/ data structures\n    export_BoxDim(m);\n    export_ParticleData(m);\n    export_SnapshotParticleData(m);\n    export_ExecutionConfiguration(m);\n    export_SystemDefinition(m);\n    export_SnapshotSystemData(m);\n    export_BondedGroupData<BondData,Bond>(m,\"BondData\",\"BondDataSnapshot\");\n    export_BondedGroupData<AngleData,Angle>(m,\"AngleData\",\"AngleDataSnapshot\");\n    export_BondedGroupData<DihedralData,Dihedral>(m,\"DihedralData\",\"DihedralDataSnapshot\");\n    export_BondedGroupData<ImproperData,Dihedral>(m,\"ImproperData\",\"ImproperDataSnapshot\",false);\n    export_BondedGroupData<ConstraintData,Constraint>(m,\"ConstraintData\",\"ConstraintDataSnapshot\");\n    export_BondedGroupData<PairData,Bond>(m,\"PairData\",\"PairDataSnapshot\",false);\n\n    \/\/ initializers\n    export_GSDReader(m);\n    getardump::export_GetarInitializer(m);\n\n    \/\/ computes\n    export_Compute(m);\n    export_ComputeThermo(m);\n    export_CellList(m);\n    export_CellListStencil(m);\n    export_ForceCompute(m);\n    export_ForceConstraint(m);\n    export_ConstForceCompute(m);\n\n#ifdef ENABLE_CUDA\n    export_CellListGPU(m);\n    export_ComputeThermoGPU(m);\n#endif\n\n    \/\/ analyzers\n    export_Analyzer(m);\n    export_IMDInterface(m);\n    export_DCDDumpWriter(m);\n    getardump::export_GetarDumpWriter(m);\n    export_GSDDumpWriter(m);\n    export_Logger(m);\n    export_LogPlainTXT(m);\n    export_LogMatrix(m);\n    export_LogHDF5(m);\n    export_CallbackAnalyzer(m);\n    export_ParticleGroup(m);\n\n    \/\/ updaters\n    export_Updater(m);\n    export_Integrator(m);\n    export_BoxResizeUpdater(m);\n    export_SFCPackUpdater(m);\n#ifdef ENABLE_CUDA\n    export_SFCPackUpdaterGPU(m);\n#endif\n\n#ifdef ENABLE_MPI\n    export_Communicator(m);\n    export_DomainDecomposition(m);\n    export_LoadBalancer(m);\n#ifdef ENABLE_CUDA\n    export_CommunicatorGPU(m);\n    export_LoadBalancerGPU(m);\n#endif \/\/ ENABLE_CUDA\n#endif \/\/ ENABLE_MPI\n\n    \/\/ system\n    export_System(m);\n\n    \/\/ variant\n    export_Variant(m);\n\n    \/\/ messenger\n    export_Messenger(m);\n\n    return m.ptr();\n    }\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*-mode: c++; indent-tabs-mode: nil; -*-\n\n#include <iostream>\n#include <fstream>\n\n#include <sys\/types.h> \/\/ opendir\n#include <dirent.h>    \/\/ opendir\n\n#include <sys\/types.h> \/\/ stat\n#include <sys\/stat.h>  \/\/ stat\n#include <unistd.h>    \/\/ stat\n\n#include <set>\n#include <vector>\n\n#include <limits.h>    \/\/ realpath\n#include <stdlib.h>    \/\/ realpath\n\n#include <string.h>    \/\/ strerror_r\n#include <errno.h>     \/\/ errno\n\n\n#include <limits.h> \/\/ PATH_MAX http:\/\/stackoverflow.com\/a\/9449307\/257924\n\nnamespace VerboseNS {\n  \n  enum VerbosityLevel {\n    E_NONE      = 0\n    , E_VERBOSE = 1 << 0\n    , E_DEBUG   = 1 << 1\n  };\n\n  class VerbosityTracker\n  {\n  public:\n\n    VerbosityTracker() : _verbosity(E_NONE) {}\n\n    bool isAtVerbosity(int level) { return (_verbosity & level) != 0; }\n\n    void setVerbosity(int value)\n    {\n      _verbosity = value;\n    }\n\n#define DEFINE_SET_VERBOSITY_METHOD(TYPE)       \\\n  TYPE & setVerbosity(int value) \\\n  { \\\n    _verbosity.setVerbosity(value); \\\n    return *this; \\\n  }\n  \n  \n  private:\n    int _verbosity;\n  };\n\n};\n\nclass UniqueFileVisitor\n{\npublic:\n  virtual bool visit(const std::string & absPath) = 0;\n};\n\nclass UniqueFileScanner\n{\npublic:\n  UniqueFileScanner()\n    : _visitor(NULL)\n  {}\n\n\n  UniqueFileScanner & setVisitor(UniqueFileVisitor * visitor)\n  {\n    _visitor = visitor;\n    return *this;\n  }\n\n  DEFINE_SET_VERBOSITY_METHOD(UniqueFileScanner);\n\n  bool scan(const std::string & inDir)\n  {\n    DIR * dirfp = opendir(inDir.c_str());\n\n    if (!dirfp) {\n      std::cerr << \"ERROR: Failed to open directory: \" << inDir << std::endl;\n      return false;\n    }\n\n    struct dirent entry;\n    struct dirent *result = NULL;\n    int readdir_retval = 0;\n    struct stat statbuf;\n    std::string absPath;\n    char realpathBuf[PATH_MAX];\n    const char * realPath = NULL;\n    while ((readdir_retval = readdir_r(dirfp, &entry, &result)) == 0 && result) {\n\n      std::string basename = entry.d_name;\n\n      \/\/ Skip directories we obviously should not traverse into:\n      if (basename == \".\" || basename == \"..\" || basename == \".git\")\n        continue;\n\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << std::endl;\n      }\n\n      \/\/ Fully-qualify the directory entry in preparation for calling stat:\n      absPath = inDir;\n      absPath += \"\/\";\n      absPath += basename;\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << \"absPath  \" << absPath << std::endl;\n      }\n\n      \/\/ Identify the type of file it is:\n      int status = stat(absPath.c_str(), &statbuf);\n      if (status == 0) { \/\/ stat succeeded\n\n        \/\/ Get the realPath for duplicate detection.\n        realPath = realpath(absPath.c_str(), realpathBuf);\n        \/\/ Warn about bad links:\n        if (!realPath) {\n          char strbuf[1024];\n          const char * errstring = strerror_r(errno, strbuf, sizeof(strbuf));\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cerr << \"WARNING: Failed resolve link: \" << absPath << \" : \" << errstring << std::endl;\n          }\n          continue;\n        }\n        realPath = realPath;\n        if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n          std::cout << \"realPath \" << realPath << std::endl;\n        }\n\n        \/\/ Avoid parsing the same file or directory twice (can happen via symbolic links):\n        SetT::iterator iter = _seen.find(realPath);\n        if(iter != _seen.end()) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cout << \"Skipping previously processed file or directory: \" << realPath << std::endl;\n          }\n          continue;\n        }\n        _seen.insert(realPath);\n          \n        if ( S_ISDIR(statbuf.st_mode) ) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n            std::cout << \"directory absPath \" << absPath << std::endl;\n          }\n          \/\/ recurse:\n          if (!scan(absPath)) {\n            return false;\n          }\n        } else if ( S_ISREG(statbuf.st_mode) || S_ISLNK(statbuf.st_mode) ) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n            std::cout << \"parsable absPath \" << absPath << std::endl;\n          }\n          if (!_visitor->visit(absPath))\n            return false;\n        } else {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cout << \"Skipping non-regular file: \" << absPath << std::endl;\n          }\n          continue;\n        }\n      } else { \/\/ stat failed\n        if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n          std::cerr << \"WARNING: Failed to stat: \" << absPath << std::endl;\n        }\n        continue;\n      }\n\n    }\n\n    if (readdir_retval) {\n      std::cerr << \"ERROR: Failed to read from directory: \" << inDir << std::endl;\n      return false;\n    }\n\n    closedir(dirfp);\n    return true;\n  }\n\nprivate:\n  typedef std::set<std::string> SetT;\n  SetT _seen;\n  UniqueFileVisitor * _visitor; \/\/ not owned by this object.\n  VerboseNS::VerbosityTracker _verbosity;\n};\n\nclass OrgIDParser : public UniqueFileVisitor\n{\npublic:\n OrgIDParser() {}\n\n  virtual bool visit(const std::string & absPath)\n  {\n\n    \/\/ Only work on Org-mode files:\n    static const char * orgExtension = \".org\";\n    std::size_t pos;\n    if ( (pos = absPath.rfind(orgExtension)) != std::string::npos ) {\n      if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n        std::cout << \"Processing \" << absPath << std::endl;\n      }\n\n      \/\/ Parse the file:\n      return parse(absPath);\n      \n    }\n    return true;\n  }\n\n  bool parse(const std::string & absPath)\n  {\n    std::ifstream stream(absPath.c_str(), std::ifstream::binary);\n    if (!stream) {\n      std::cerr << \"ERROR: Failed to open: \" << absPath << std::endl;\n      return false;\n    }\n\n    \/\/ Get length of file:\n    stream.seekg (0, stream.end);\n    std::streampos length = stream.tellg();\n    stream.seekg (0, stream.beg);\n\n    \/\/ Allocate memory:\n    std::vector<char> buffer(length);\n\n    \/\/ Read data as a block:\n    stream.read(&(buffer[0]), length);\n\n    stream.close();\n\n    \/\/ Print content:\n    std::cout.write(&(buffer[0]), length);\n\n    return true;\n  }\n\n\n  DEFINE_SET_VERBOSITY_METHOD(OrgIDParser);\n\nprivate:\n  VerboseNS::VerbosityTracker _verbosity;\n};\n\nint main(int argc, char *argv[], char *const envp[])\n{\n  int verbosity = VerboseNS::E_NONE;\n  bool readingDirectories = false;\n  typedef std::vector<std::string> DirectoryListT;\n  DirectoryListT directories;\n  for (int i = 0; i < argc; i++)\n  {\n    std::string arg = argv[i];\n    if (arg.empty()) break;\n    if (readingDirectories) {\n      directories.push_back(arg);\n    } else {\n      if (arg == \"--\") {\n        readingDirectories = true;\n      } else if (arg == \"-verbose\") {\n        verbosity |= VerboseNS::E_VERBOSE;\n      } else if (arg == \"-debug\") {\n        verbosity |= VerboseNS::E_DEBUG;\n      }\n    }\n  }\n\n  if (directories.empty()) {\n    std::cerr << \"ERROR: No directories specified.\" << std::endl;\n    return 1;\n  }\n\n  \/\/ OrgIDParser will house the results:\n  OrgIDParser parser;\n  parser.setVerbosity(verbosity);\n\n  \/\/ UniqueFileScanner scans for files and removes duplicates, visiting each\n  \/\/ with the parser:\n  UniqueFileScanner scanner;\n  scanner\n    .setVerbosity(verbosity)\n    .setVisitor(&parser);\n  for (DirectoryListT::iterator cur = directories.begin(); cur != directories.end(); ++cur)\n  {\n    int success = scanner.scan(*cur);\n    if (!success) {\n      return 1;\n    }\n  }\n  \/\/ Write out the org id file:\n  \n  return 0;\n} \/\/ end main\n\n<commit_msg>change buffer type from std::vector to std::string<commit_after>\/\/ -*-mode: c++; indent-tabs-mode: nil; -*-\n\n#include <iostream>\n#include <fstream>\n\n#include <sys\/types.h> \/\/ opendir\n#include <dirent.h>    \/\/ opendir\n\n#include <sys\/types.h> \/\/ stat\n#include <sys\/stat.h>  \/\/ stat\n#include <unistd.h>    \/\/ stat\n\n#include <set>\n#include <vector>\n\n#include <limits.h>    \/\/ realpath\n#include <stdlib.h>    \/\/ realpath\n\n#include <string.h>    \/\/ strerror_r\n#include <errno.h>     \/\/ errno\n\n\n#include <limits.h> \/\/ PATH_MAX http:\/\/stackoverflow.com\/a\/9449307\/257924\n\nnamespace VerboseNS {\n  \n  enum VerbosityLevel {\n    E_NONE      = 0\n    , E_VERBOSE = 1 << 0\n    , E_DEBUG   = 1 << 1\n  };\n\n  class VerbosityTracker\n  {\n  public:\n\n    VerbosityTracker() : _verbosity(E_NONE) {}\n\n    bool isAtVerbosity(int level) { return (_verbosity & level) != 0; }\n\n    void setVerbosity(int value)\n    {\n      _verbosity = value;\n    }\n\n#define DEFINE_SET_VERBOSITY_METHOD(TYPE)       \\\n  TYPE & setVerbosity(int value) \\\n  { \\\n    _verbosity.setVerbosity(value); \\\n    return *this; \\\n  }\n  \n  \n  private:\n    int _verbosity;\n  };\n\n};\n\nclass UniqueFileVisitor\n{\npublic:\n  virtual bool visit(const std::string & absPath) = 0;\n};\n\nclass UniqueFileScanner\n{\npublic:\n  UniqueFileScanner()\n    : _visitor(NULL)\n  {}\n\n\n  UniqueFileScanner & setVisitor(UniqueFileVisitor * visitor)\n  {\n    _visitor = visitor;\n    return *this;\n  }\n\n  DEFINE_SET_VERBOSITY_METHOD(UniqueFileScanner);\n\n  bool scan(const std::string & inDir)\n  {\n    DIR * dirfp = opendir(inDir.c_str());\n\n    if (!dirfp) {\n      std::cerr << \"ERROR: Failed to open directory: \" << inDir << std::endl;\n      return false;\n    }\n\n    struct dirent entry;\n    struct dirent *result = NULL;\n    int readdir_retval = 0;\n    struct stat statbuf;\n    std::string absPath;\n    char realpathBuf[PATH_MAX];\n    const char * realPath = NULL;\n    while ((readdir_retval = readdir_r(dirfp, &entry, &result)) == 0 && result) {\n\n      std::string basename = entry.d_name;\n\n      \/\/ Skip directories we obviously should not traverse into:\n      if (basename == \".\" || basename == \"..\" || basename == \".git\")\n        continue;\n\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << std::endl;\n      }\n\n      \/\/ Fully-qualify the directory entry in preparation for calling stat:\n      absPath = inDir;\n      absPath += \"\/\";\n      absPath += basename;\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << \"absPath  \" << absPath << std::endl;\n      }\n\n      \/\/ Identify the type of file it is:\n      int status = stat(absPath.c_str(), &statbuf);\n      if (status == 0) { \/\/ stat succeeded\n\n        \/\/ Get the realPath for duplicate detection.\n        realPath = realpath(absPath.c_str(), realpathBuf);\n        \/\/ Warn about bad links:\n        if (!realPath) {\n          char strbuf[1024];\n          const char * errstring = strerror_r(errno, strbuf, sizeof(strbuf));\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cerr << \"WARNING: Failed resolve link: \" << absPath << \" : \" << errstring << std::endl;\n          }\n          continue;\n        }\n        realPath = realPath;\n        if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n          std::cout << \"realPath \" << realPath << std::endl;\n        }\n\n        \/\/ Avoid parsing the same file or directory twice (can happen via symbolic links):\n        SetT::iterator iter = _seen.find(realPath);\n        if(iter != _seen.end()) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cout << \"Skipping previously processed file or directory: \" << realPath << std::endl;\n          }\n          continue;\n        }\n        _seen.insert(realPath);\n          \n        if ( S_ISDIR(statbuf.st_mode) ) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n            std::cout << \"directory absPath \" << absPath << std::endl;\n          }\n          \/\/ recurse:\n          if (!scan(absPath)) {\n            return false;\n          }\n        } else if ( S_ISREG(statbuf.st_mode) || S_ISLNK(statbuf.st_mode) ) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n            std::cout << \"parsable absPath \" << absPath << std::endl;\n          }\n          if (!_visitor->visit(absPath))\n            return false;\n        } else {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cout << \"Skipping non-regular file: \" << absPath << std::endl;\n          }\n          continue;\n        }\n      } else { \/\/ stat failed\n        if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n          std::cerr << \"WARNING: Failed to stat: \" << absPath << std::endl;\n        }\n        continue;\n      }\n\n    }\n\n    if (readdir_retval) {\n      std::cerr << \"ERROR: Failed to read from directory: \" << inDir << std::endl;\n      return false;\n    }\n\n    closedir(dirfp);\n    return true;\n  }\n\nprivate:\n  typedef std::set<std::string> SetT;\n  SetT _seen;\n  UniqueFileVisitor * _visitor; \/\/ not owned by this object.\n  VerboseNS::VerbosityTracker _verbosity;\n};\n\nclass OrgIDParser : public UniqueFileVisitor\n{\npublic:\n OrgIDParser() {}\n\n  virtual bool visit(const std::string & absPath)\n  {\n\n    \/\/ Only work on Org-mode files:\n    static const char * orgExtension = \".org\";\n    std::size_t pos;\n    if ( (pos = absPath.rfind(orgExtension)) != std::string::npos ) {\n      if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n        std::cout << \"Processing \" << absPath << std::endl;\n      }\n\n      \/\/ Parse the file:\n      return parse(absPath);\n      \n    }\n    return true;\n  }\n\n  bool parse(const std::string & absPath)\n  {\n    std::ifstream stream(absPath.c_str(), std::ifstream::binary);\n    if (!stream) {\n      std::cerr << \"ERROR: Failed to open: \" << absPath << std::endl;\n      return false;\n    }\n\n    \/\/ Get length of file:\n    stream.seekg (0, stream.end);\n    std::streampos length = stream.tellg();\n    stream.seekg (0, stream.beg);\n\n    \/\/ Allocate memory:\n    std::string buffer(length, 0);\n\n    \/\/ Read data as a block:\n    stream.read(&(buffer[0]), length);\n\n    stream.close();\n\n    \/\/ Print content:\n    \/\/ std::cout.write(&(buffer[0]), length);\n    std::cout << \"<<<\" << buffer << \">>>\" << std::endl;\n\n    return true;\n  }\n\n\n  DEFINE_SET_VERBOSITY_METHOD(OrgIDParser);\n\nprivate:\n  VerboseNS::VerbosityTracker _verbosity;\n};\n\nint main(int argc, char *argv[], char *const envp[])\n{\n  int verbosity = VerboseNS::E_NONE;\n  bool readingDirectories = false;\n  typedef std::vector<std::string> DirectoryListT;\n  DirectoryListT directories;\n  for (int i = 0; i < argc; i++)\n  {\n    std::string arg = argv[i];\n    if (arg.empty()) break;\n    if (readingDirectories) {\n      directories.push_back(arg);\n    } else {\n      if (arg == \"--\") {\n        readingDirectories = true;\n      } else if (arg == \"-verbose\") {\n        verbosity |= VerboseNS::E_VERBOSE;\n      } else if (arg == \"-debug\") {\n        verbosity |= VerboseNS::E_DEBUG;\n      }\n    }\n  }\n\n  if (directories.empty()) {\n    std::cerr << \"ERROR: No directories specified.\" << std::endl;\n    return 1;\n  }\n\n  \/\/ OrgIDParser will house the results:\n  OrgIDParser parser;\n  parser.setVerbosity(verbosity);\n\n  \/\/ UniqueFileScanner scans for files and removes duplicates, visiting each\n  \/\/ with the parser:\n  UniqueFileScanner scanner;\n  scanner\n    .setVerbosity(verbosity)\n    .setVisitor(&parser);\n  for (DirectoryListT::iterator cur = directories.begin(); cur != directories.end(); ++cur)\n  {\n    int success = scanner.scan(*cur);\n    if (!success) {\n      return 1;\n    }\n  }\n  \/\/ Write out the org id file:\n  \n  return 0;\n} \/\/ end main\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*-mode: c++; indent-tabs-mode: nil; -*-\n\n#include <iostream>\n#include <fstream>\n\n#include <sys\/types.h> \/\/ opendir\n#include <dirent.h>    \/\/ opendir\n\n#include <sys\/types.h> \/\/ stat\n#include <sys\/stat.h>  \/\/ stat\n#include <unistd.h>    \/\/ stat\n\n#include <limits.h>    \/\/ realpath\n#include <stdlib.h>    \/\/ realpath\n\n#include <string.h>    \/\/ strerror_r\n#include <errno.h>     \/\/ errno\n\n#include <set>\n#include <vector>\n#include <map>\n\n\n#include <limits.h> \/\/ PATH_MAX http:\/\/stackoverflow.com\/a\/9449307\/257924\n\nbool realPathToString(const std::string & inPath, std::string & realPath, bool verbose)\n{\n  realPath.resize(PATH_MAX);\n  \/\/ Get the realPath for duplicate detection.\n  const char * tmp = realpath(inPath.c_str(), &(realPath[0]));\n  \/\/ Warn about bad links:\n  if (!tmp) {\n    char strbuf[1024];\n    const char * errstring = strerror_r(errno, strbuf, sizeof(strbuf));\n    if (verbose) {\n      std::cerr << \"WARNING: Failed resolve: \" << inPath << \" : \" << errstring << std::endl;\n    }\n    realPath = \"\";\n    return false;\n  }\n  realPath.resize(strlen(&(realPath[0])));\n  return true;\n}\n\nnamespace VerboseNS {\n  \n  enum VerbosityLevel {\n    E_NONE      = 0\n    , E_VERBOSE = 1 << 0\n    , E_DEBUG   = 1 << 1\n  };\n\n  class VerbosityTracker\n  {\n  public:\n\n    VerbosityTracker() : _verbosity(E_NONE) {}\n\n    bool isAtVerbosity(int level) { return (_verbosity & level) != 0; }\n\n    void setVerbosity(int value)\n    {\n      _verbosity = value;\n    }\n\n#define DEFINE_SET_VERBOSITY_METHOD(TYPE)       \\\n  TYPE & setVerbosity(int value) \\\n  { \\\n    _verbosity.setVerbosity(value); \\\n    return *this; \\\n  }\n  \n  \n  private:\n    int _verbosity;\n  };\n\n};\n\nclass UniqueFileVisitor\n{\npublic:\n  virtual bool visit(const std::string & absPath) = 0;\n};\n\nclass UniqueFileScanner\n{\npublic:\n  UniqueFileScanner()\n    : _visitor(NULL)\n  {}\n\n\n  UniqueFileScanner & setVisitor(UniqueFileVisitor * visitor)\n  {\n    _visitor = visitor;\n    return *this;\n  }\n\n  DEFINE_SET_VERBOSITY_METHOD(UniqueFileScanner);\n\n  bool scan(const std::string & inDir)\n  {\n    DIR * dirfp = opendir(inDir.c_str());\n\n    if (!dirfp) {\n      std::cerr << \"ERROR: Failed to open directory: \" << inDir << std::endl;\n      return false;\n    }\n\n    struct dirent entry;\n    struct dirent *result = NULL;\n    int readdir_retval = 0;\n    struct stat statbuf;\n    std::string absPath;\n    std::string realPath;\n    while ((readdir_retval = readdir_r(dirfp, &entry, &result)) == 0 && result) {\n\n      std::string basename = entry.d_name;\n\n      \/\/ Skip directories we obviously should not traverse into:\n      if (basename == \".\" || basename == \"..\" || basename == \".git\")\n        continue;\n\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << std::endl;\n      }\n\n      \/\/ Fully-qualify the directory entry in preparation for calling stat:\n      absPath = inDir;\n      absPath += \"\/\";\n      absPath += basename;\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << \"absPath  \" << absPath << std::endl;\n      }\n\n      \/\/ Identify the type of file it is:\n      int status = stat(absPath.c_str(), &statbuf);\n      if (status == 0) { \/\/ stat succeeded\n\n        \/\/ Get the realPath for duplicate detection.\n        if (!realPathToString(absPath, realPath, _verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)))\n          continue;\n\n        if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n          std::cout << \"realPath \" << realPath << std::endl;\n        }\n\n        \/\/ Avoid parsing the same file or directory twice (can happen via symbolic links):\n        SetT::iterator iter = _seen.find(realPath);\n        if(iter != _seen.end()) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cout << \"Skipping previously processed file or directory: \" << realPath << std::endl;\n          }\n          continue;\n        }\n        _seen.insert(realPath);\n          \n        if ( S_ISDIR(statbuf.st_mode) ) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n            std::cout << \"directory absPath \" << absPath << std::endl;\n          }\n          \/\/ recurse:\n          if (!scan(absPath)) {\n            return false;\n          }\n        } else if ( S_ISREG(statbuf.st_mode) || S_ISLNK(statbuf.st_mode) ) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n            std::cout << \"parsable absPath \" << absPath << std::endl;\n          }\n          if (!_visitor->visit(absPath))\n            return false;\n        } else {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cout << \"Skipping non-regular file: \" << absPath << std::endl;\n          }\n          continue;\n        }\n      } else { \/\/ stat failed\n        if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n          std::cerr << \"WARNING: Failed to stat: \" << absPath << std::endl;\n        }\n        continue;\n      }\n\n    }\n\n    if (readdir_retval) {\n      std::cerr << \"ERROR: Failed to read from directory: \" << inDir << std::endl;\n      return false;\n    }\n\n    closedir(dirfp);\n    return true;\n  }\n\nprivate:\n  typedef std::set<std::string> SetT;\n  SetT _seen;\n  UniqueFileVisitor * _visitor; \/\/ not owned by this object.\n  VerboseNS::VerbosityTracker _verbosity;\n};\n\nclass OrgIDParser : public UniqueFileVisitor\n{\npublic:\n OrgIDParser() {}\n\n  virtual bool visit(const std::string & absPath)\n  {\n\n    \/\/ Only work on Org-mode files:\n    static const char * orgExtension = \".org\";\n    std::size_t pos;\n    if ( (pos = absPath.rfind(orgExtension)) != std::string::npos ) {\n      if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n        std::cout << \"Processing \" << absPath << std::endl;\n      }\n\n      \/\/ Parse the file:\n      return parse(absPath);\n      \n    }\n    return true;\n  }\n\n  bool parse(const std::string & absPath)\n  {\n    std::ifstream stream(absPath.c_str(), std::ifstream::binary);\n    if (!stream) {\n      std::cerr << \"ERROR: Failed to open: \" << absPath << std::endl;\n      return false;\n    }\n\n    \/\/ Get length of file:\n    stream.seekg (0, stream.end);\n    std::streampos length = stream.tellg();\n    stream.seekg (0, stream.beg);\n\n    \/\/ Allocate memory:\n    std::string buffer(length, 0);\n\n    \/\/ Read data as a block:\n    stream.read(&(buffer[0]), length);\n\n    stream.close();\n\n    \/\/ Print content:\n    \/\/ std::cout.write(&(buffer[0]), length);\n    \/\/ std::cout << \"<<<\" << buffer << \">>>\" << std::endl;\n\n     \/\/ :PROPERTIES:\n     \/\/ :ID:       subdir_t-est1-note-2d73-dd0f5b698f14\n     \/\/ :END:\n    std::size_t propBegPos = 0;\n    std::size_t propEndPos = std::string::npos;\n    std::size_t idLabelBegPos = std::string::npos;\n    std::size_t idValueBegPos = std::string::npos;\n    std::size_t idValueEndPos = std::string::npos;\n    for ( ; (propBegPos = buffer.find(\":PROPERTIES:\\n\", propBegPos)) != std::string::npos; propBegPos++) {\n      if ((propEndPos = buffer.find(\":END:\\n\", propBegPos)) == std::string::npos) {\n        std::cerr << \"ERROR: Lacking :END: starting at position \" << propBegPos << \" in file \" << absPath << std::endl;\n        return false;\n      }\n\n      static const char * idLabel = \":ID:\";\n      if ((idLabelBegPos = buffer.find(idLabel, propBegPos)) == std::string::npos || idLabelBegPos > propEndPos) {\n        \/\/ No id found within this current property list, so move on.\n        continue;\n      }\n\n      if ((idValueBegPos = buffer.find_first_not_of(\" \\t\", idLabelBegPos + sizeof(idLabel))) == std::string::npos || idValueBegPos > propEndPos) {\n        std::cerr << \"ERROR: ID lacks a value starting at position \" << idLabelBegPos << \" in file \" << absPath << std::endl;\n        return false;\n      }\n\n      if ((idValueEndPos = buffer.find_first_of(\" \\t\\n\", idValueBegPos)) == std::string::npos || idValueEndPos > propEndPos) {\n        std::cerr << \"ERROR: ID value premature termination at position \" << idValueBegPos << \" in file \" << absPath << std::endl;\n        return false;\n      }\n\n      std::string id = buffer.substr(idValueBegPos, idValueEndPos - idValueBegPos);\n\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << \"absPath \" << absPath << \" id \" << id << std::endl;\n      }\n      \n      IdSetT & ids = _map[absPath]; \/\/ Create a IdSetT if one does not exist\n      if (ids.find(id) != ids.end()) {\n        std::cerr << \"ERROR: Duplicate ID value \" << id << \" at position \" << idValueBegPos << \" in file \" << absPath << std::endl;\n        return false;\n      }\n      ids.insert(id);\n\n    }\n      \n    return true;\n  }\n\n  bool writeIdAlistFile(const std::string & alistPath)\n  {\n    std::ofstream stream(alistPath.c_str());\n    if (!stream) {\n      std::cerr << \"ERROR: Cannot open \" << alistPath << \" for writing.\" << std::endl;\n      return false;\n    }\n\n    bool first = true;\n    stream << \"(\";\n    for (FileToIdSetT::iterator cur = _map.begin(); cur != _map.end(); ++cur)\n    {\n      const std::string & absPath = cur->first;\n\n      if (!first) {\n        stream << std::endl << \" \";\n      }\n\n      stream << \"(\\\"\" << absPath << \"\\\"\";\n      IdSetT & ids = cur->second;\n\n      for (IdSetT::iterator cur = ids.begin(); cur != ids.end(); ++cur)\n      {\n        stream << \" \\\"\" << *cur << \"\\\"\";\n      }\n\n      stream << \")\";\n\n      first = false;\n    }\n    stream << \")\" << std::endl;\n\n    return true;\n  }\n\n\n\n  DEFINE_SET_VERBOSITY_METHOD(OrgIDParser);\n\nprivate:\n  VerboseNS::VerbosityTracker _verbosity;\n  typedef std::set<std::string> IdSetT;\n  typedef std::map<std::string, IdSetT > FileToIdSetT;\n  FileToIdSetT _map;\n};\n\nint main(int argc, char *argv[], char *const envp[])\n{\n  int verbosity = VerboseNS::E_NONE;\n  bool readingDirectories = false;\n  typedef std::vector<std::string> DirectoryListT;\n  DirectoryListT directories;\n  std::string idAlistPath;\n  for (int i = 1; i < argc; i++)\n  {\n    std::string arg = argv[i];\n    if (arg.empty()) break;\n    if (readingDirectories) {\n      \/\/ Get the realPath for things like \".\":\n      std::string realPath;\n      if (!realPathToString(arg, realPath, true))\n        continue;\n      directories.push_back(arg);\n    } else {\n      if (arg == \"--\") {\n        readingDirectories = true;\n      } else if (arg == \"-verbose\") {\n        verbosity |= VerboseNS::E_VERBOSE;\n      } else if (arg == \"-debug\") {\n        verbosity |= VerboseNS::E_DEBUG;\n      } else if (arg == \"-o\") {\n        if (i + 1 >= argc) {\n          std::cerr << \"ERROR: -o requires a value.\" << std::endl;\n          return 1;\n        }\n        idAlistPath = argv[++i];\n      } else {\n        std::cerr << \"ERROR: Unrecognized option \" << arg << std::endl;\n        return 1;\n      }\n    }\n  }\n\n  if (directories.empty()) {\n    std::cerr << \"ERROR: No directories specified.\" << std::endl;\n    return 1;\n  }\n\n  if (idAlistPath.empty()) {\n    std::cerr << \"ERROR: No alistfile specified.\" << std::endl;\n    return 1;\n  }\n\n  \/\/ OrgIDParser will house the results:\n  OrgIDParser parser;\n  parser.setVerbosity(verbosity);\n\n  \/\/ UniqueFileScanner scans for files and removes duplicates, visiting each\n  \/\/ with the parser:\n  UniqueFileScanner scanner;\n  scanner\n    .setVerbosity(verbosity)\n    .setVisitor(&parser);\n  for (DirectoryListT::iterator cur = directories.begin(); cur != directories.end(); ++cur)\n  {\n    int success = scanner.scan(*cur);\n    if (!success) {\n      return 1;\n    }\n  }\n\n  \/\/ Write out the alist file:\n  parser.writeIdAlistFile(idAlistPath);\n  \n  return 0;\n} \/\/ end main\n\n<commit_msg>use realPath in the input directory list<commit_after>\/\/ -*-mode: c++; indent-tabs-mode: nil; -*-\n\n#include <iostream>\n#include <fstream>\n\n#include <sys\/types.h> \/\/ opendir\n#include <dirent.h>    \/\/ opendir\n\n#include <sys\/types.h> \/\/ stat\n#include <sys\/stat.h>  \/\/ stat\n#include <unistd.h>    \/\/ stat\n\n#include <limits.h>    \/\/ realpath\n#include <stdlib.h>    \/\/ realpath\n\n#include <string.h>    \/\/ strerror_r\n#include <errno.h>     \/\/ errno\n\n#include <set>\n#include <vector>\n#include <map>\n\n\n#include <limits.h> \/\/ PATH_MAX http:\/\/stackoverflow.com\/a\/9449307\/257924\n\nbool realPathToString(const std::string & inPath, std::string & realPath, bool verbose)\n{\n  realPath.resize(PATH_MAX);\n  \/\/ Get the realPath for duplicate detection.\n  const char * tmp = realpath(inPath.c_str(), &(realPath[0]));\n  \/\/ Warn about bad links:\n  if (!tmp) {\n    char strbuf[1024];\n    const char * errstring = strerror_r(errno, strbuf, sizeof(strbuf));\n    if (verbose) {\n      std::cerr << \"WARNING: Failed resolve: \" << inPath << \" : \" << errstring << std::endl;\n    }\n    realPath = \"\";\n    return false;\n  }\n  realPath.resize(strlen(&(realPath[0])));\n  return true;\n}\n\nnamespace VerboseNS {\n  \n  enum VerbosityLevel {\n    E_NONE      = 0\n    , E_VERBOSE = 1 << 0\n    , E_DEBUG   = 1 << 1\n  };\n\n  class VerbosityTracker\n  {\n  public:\n\n    VerbosityTracker() : _verbosity(E_NONE) {}\n\n    bool isAtVerbosity(int level) { return (_verbosity & level) != 0; }\n\n    void setVerbosity(int value)\n    {\n      _verbosity = value;\n    }\n\n#define DEFINE_SET_VERBOSITY_METHOD(TYPE)       \\\n  TYPE & setVerbosity(int value) \\\n  { \\\n    _verbosity.setVerbosity(value); \\\n    return *this; \\\n  }\n  \n  \n  private:\n    int _verbosity;\n  };\n\n};\n\nclass UniqueFileVisitor\n{\npublic:\n  virtual bool visit(const std::string & absPath) = 0;\n};\n\nclass UniqueFileScanner\n{\npublic:\n  UniqueFileScanner()\n    : _visitor(NULL)\n  {}\n\n\n  UniqueFileScanner & setVisitor(UniqueFileVisitor * visitor)\n  {\n    _visitor = visitor;\n    return *this;\n  }\n\n  DEFINE_SET_VERBOSITY_METHOD(UniqueFileScanner);\n\n  bool scan(const std::string & inDir)\n  {\n    DIR * dirfp = opendir(inDir.c_str());\n\n    if (!dirfp) {\n      std::cerr << \"ERROR: Failed to open directory: \" << inDir << std::endl;\n      return false;\n    }\n\n    struct dirent entry;\n    struct dirent *result = NULL;\n    int readdir_retval = 0;\n    struct stat statbuf;\n    std::string absPath;\n    std::string realPath;\n    while ((readdir_retval = readdir_r(dirfp, &entry, &result)) == 0 && result) {\n\n      std::string basename = entry.d_name;\n\n      \/\/ Skip directories we obviously should not traverse into:\n      if (basename == \".\" || basename == \"..\" || basename == \".git\")\n        continue;\n\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << std::endl;\n      }\n\n      \/\/ Fully-qualify the directory entry in preparation for calling stat:\n      absPath = inDir;\n      absPath += \"\/\";\n      absPath += basename;\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << \"absPath  \" << absPath << std::endl;\n      }\n\n      \/\/ Identify the type of file it is:\n      int status = stat(absPath.c_str(), &statbuf);\n      if (status == 0) { \/\/ stat succeeded\n\n        \/\/ Get the realPath for duplicate detection.\n        if (!realPathToString(absPath, realPath, _verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)))\n          continue;\n\n        if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n          std::cout << \"realPath \" << realPath << std::endl;\n        }\n\n        \/\/ Avoid parsing the same file or directory twice (can happen via symbolic links):\n        SetT::iterator iter = _seen.find(realPath);\n        if(iter != _seen.end()) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cout << \"Skipping previously processed file or directory: \" << realPath << std::endl;\n          }\n          continue;\n        }\n        _seen.insert(realPath);\n          \n        if ( S_ISDIR(statbuf.st_mode) ) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n            std::cout << \"directory absPath \" << absPath << std::endl;\n          }\n          \/\/ recurse:\n          if (!scan(absPath)) {\n            return false;\n          }\n        } else if ( S_ISREG(statbuf.st_mode) || S_ISLNK(statbuf.st_mode) ) {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n            std::cout << \"parsable absPath \" << absPath << std::endl;\n          }\n          if (!_visitor->visit(absPath))\n            return false;\n        } else {\n          if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n            std::cout << \"Skipping non-regular file: \" << absPath << std::endl;\n          }\n          continue;\n        }\n      } else { \/\/ stat failed\n        if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n          std::cerr << \"WARNING: Failed to stat: \" << absPath << std::endl;\n        }\n        continue;\n      }\n\n    }\n\n    if (readdir_retval) {\n      std::cerr << \"ERROR: Failed to read from directory: \" << inDir << std::endl;\n      return false;\n    }\n\n    closedir(dirfp);\n    return true;\n  }\n\nprivate:\n  typedef std::set<std::string> SetT;\n  SetT _seen;\n  UniqueFileVisitor * _visitor; \/\/ not owned by this object.\n  VerboseNS::VerbosityTracker _verbosity;\n};\n\nclass OrgIDParser : public UniqueFileVisitor\n{\npublic:\n OrgIDParser() {}\n\n  virtual bool visit(const std::string & absPath)\n  {\n\n    \/\/ Only work on Org-mode files:\n    static const char * orgExtension = \".org\";\n    std::size_t pos;\n    if ( (pos = absPath.rfind(orgExtension)) != std::string::npos ) {\n      if (_verbosity.isAtVerbosity(VerboseNS::E_VERBOSE)) {\n        std::cout << \"Processing \" << absPath << std::endl;\n      }\n\n      \/\/ Parse the file:\n      return parse(absPath);\n      \n    }\n    return true;\n  }\n\n  bool parse(const std::string & absPath)\n  {\n    std::ifstream stream(absPath.c_str(), std::ifstream::binary);\n    if (!stream) {\n      std::cerr << \"ERROR: Failed to open: \" << absPath << std::endl;\n      return false;\n    }\n\n    \/\/ Get length of file:\n    stream.seekg (0, stream.end);\n    std::streampos length = stream.tellg();\n    stream.seekg (0, stream.beg);\n\n    \/\/ Allocate memory:\n    std::string buffer(length, 0);\n\n    \/\/ Read data as a block:\n    stream.read(&(buffer[0]), length);\n\n    stream.close();\n\n    \/\/ Print content:\n    \/\/ std::cout.write(&(buffer[0]), length);\n    \/\/ std::cout << \"<<<\" << buffer << \">>>\" << std::endl;\n\n     \/\/ :PROPERTIES:\n     \/\/ :ID:       subdir_t-est1-note-2d73-dd0f5b698f14\n     \/\/ :END:\n    std::size_t propBegPos = 0;\n    std::size_t propEndPos = std::string::npos;\n    std::size_t idLabelBegPos = std::string::npos;\n    std::size_t idValueBegPos = std::string::npos;\n    std::size_t idValueEndPos = std::string::npos;\n    for ( ; (propBegPos = buffer.find(\":PROPERTIES:\\n\", propBegPos)) != std::string::npos; propBegPos++) {\n      if ((propEndPos = buffer.find(\":END:\\n\", propBegPos)) == std::string::npos) {\n        std::cerr << \"ERROR: Lacking :END: starting at position \" << propBegPos << \" in file \" << absPath << std::endl;\n        return false;\n      }\n\n      static const char * idLabel = \":ID:\";\n      if ((idLabelBegPos = buffer.find(idLabel, propBegPos)) == std::string::npos || idLabelBegPos > propEndPos) {\n        \/\/ No id found within this current property list, so move on.\n        continue;\n      }\n\n      if ((idValueBegPos = buffer.find_first_not_of(\" \\t\", idLabelBegPos + sizeof(idLabel))) == std::string::npos || idValueBegPos > propEndPos) {\n        std::cerr << \"ERROR: ID lacks a value starting at position \" << idLabelBegPos << \" in file \" << absPath << std::endl;\n        return false;\n      }\n\n      if ((idValueEndPos = buffer.find_first_of(\" \\t\\n\", idValueBegPos)) == std::string::npos || idValueEndPos > propEndPos) {\n        std::cerr << \"ERROR: ID value premature termination at position \" << idValueBegPos << \" in file \" << absPath << std::endl;\n        return false;\n      }\n\n      std::string id = buffer.substr(idValueBegPos, idValueEndPos - idValueBegPos);\n\n      if (_verbosity.isAtVerbosity(VerboseNS::E_DEBUG)) {\n        std::cout << \"absPath \" << absPath << \" id \" << id << std::endl;\n      }\n      \n      IdSetT & ids = _map[absPath]; \/\/ Create a IdSetT if one does not exist\n      if (ids.find(id) != ids.end()) {\n        std::cerr << \"ERROR: Duplicate ID value \" << id << \" at position \" << idValueBegPos << \" in file \" << absPath << std::endl;\n        return false;\n      }\n      ids.insert(id);\n\n    }\n      \n    return true;\n  }\n\n  bool writeIdAlistFile(const std::string & alistPath)\n  {\n    std::ofstream stream(alistPath.c_str());\n    if (!stream) {\n      std::cerr << \"ERROR: Cannot open \" << alistPath << \" for writing.\" << std::endl;\n      return false;\n    }\n\n    bool first = true;\n    stream << \"(\";\n    for (FileToIdSetT::iterator cur = _map.begin(); cur != _map.end(); ++cur)\n    {\n      const std::string & absPath = cur->first;\n\n      if (!first) {\n        stream << std::endl << \" \";\n      }\n\n      stream << \"(\\\"\" << absPath << \"\\\"\";\n      IdSetT & ids = cur->second;\n\n      for (IdSetT::iterator cur = ids.begin(); cur != ids.end(); ++cur)\n      {\n        stream << \" \\\"\" << *cur << \"\\\"\";\n      }\n\n      stream << \")\";\n\n      first = false;\n    }\n    stream << \")\" << std::endl;\n\n    return true;\n  }\n\n\n\n  DEFINE_SET_VERBOSITY_METHOD(OrgIDParser);\n\nprivate:\n  VerboseNS::VerbosityTracker _verbosity;\n  typedef std::set<std::string> IdSetT;\n  typedef std::map<std::string, IdSetT > FileToIdSetT;\n  FileToIdSetT _map;\n};\n\nint main(int argc, char *argv[], char *const envp[])\n{\n  int verbosity = VerboseNS::E_NONE;\n  bool readingDirectories = false;\n  typedef std::vector<std::string> DirectoryListT;\n  DirectoryListT directories;\n  std::string idAlistPath;\n  for (int i = 1; i < argc; i++)\n  {\n    std::string arg = argv[i];\n    if (arg.empty()) break;\n    if (readingDirectories) {\n      \/\/ Get the realPath for things like \".\":\n      std::string realPath;\n      if (!realPathToString(arg, realPath, true))\n        continue;\n      directories.push_back(realPath);\n    } else {\n      if (arg == \"--\") {\n        readingDirectories = true;\n      } else if (arg == \"-verbose\") {\n        verbosity |= VerboseNS::E_VERBOSE;\n      } else if (arg == \"-debug\") {\n        verbosity |= VerboseNS::E_DEBUG;\n      } else if (arg == \"-o\") {\n        if (i + 1 >= argc) {\n          std::cerr << \"ERROR: -o requires a value.\" << std::endl;\n          return 1;\n        }\n        idAlistPath = argv[++i];\n      } else {\n        std::cerr << \"ERROR: Unrecognized option \" << arg << std::endl;\n        return 1;\n      }\n    }\n  }\n\n  if (directories.empty()) {\n    std::cerr << \"ERROR: No directories specified.\" << std::endl;\n    return 1;\n  }\n\n  if (idAlistPath.empty()) {\n    std::cerr << \"ERROR: No alistfile specified.\" << std::endl;\n    return 1;\n  }\n\n  \/\/ OrgIDParser will house the results:\n  OrgIDParser parser;\n  parser.setVerbosity(verbosity);\n\n  \/\/ UniqueFileScanner scans for files and removes duplicates, visiting each\n  \/\/ with the parser:\n  UniqueFileScanner scanner;\n  scanner\n    .setVerbosity(verbosity)\n    .setVisitor(&parser);\n  for (DirectoryListT::iterator cur = directories.begin(); cur != directories.end(); ++cur)\n  {\n    int success = scanner.scan(*cur);\n    if (!success) {\n      return 1;\n    }\n  }\n\n  \/\/ Write out the alist file:\n  parser.writeIdAlistFile(idAlistPath);\n  \n  return 0;\n} \/\/ end main\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Related fdo#61272: Revert \"wmf-mm-text-1.diff: Fix WMF rendering, n#417818\"<commit_after><|endoftext|>"}
{"text":"<commit_before>\n#include \"catch.hpp\"\n#include \"CStringBuilder.hpp\"\n\n\nusing namespace tcsb;\n\nSCENARIO( \"Create and use simple CStringBuilder\", \"[CStringBuilder]\" ) {\n    GIVEN( \"A vector with some items\" ) {\n        const size_t bufferSize = 100;\n        char buffer[bufferSize];\n\n        CStringBuilder sb(buffer, bufferSize);\n\n        REQUIRE(sb.size() == 0);\n        REQUIRE(sb.bufferSize());\n\n        WHEN(\"Add another string\") {\n            sb.add(\"ha!\");\n\n            THEN(\"the size and capacity change\") {\n                REQUIRE(sb.size() == 3);\n            }\n\n            THEN(\"ha! should be there and 0 terminated\") {\n                REQUIRE(sb.cStr() == std::string(\"ha!\"));\n                REQUIRE(sb.cStr()[3] == '\\0');\n            }\n        }\n\n        WHEN(\"Append by 0 digit int\") {\n            sb.add(0);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"0\"));\n                REQUIRE(sb.cStr()[1] == '\\0');\n            }\n        }\n\n        WHEN(\"Add many digits int is passed\") {\n            sb.add(-1234);\n\n            THEN(\"it should be properly displayed\") {\n\n                REQUIRE(sb.cStr()[0] == '-');\n                REQUIRE(sb.cStr()[1] == '1');\n                REQUIRE(sb.cStr()[2] == '2');\n                REQUIRE(sb.cStr()[3] == '3');\n                REQUIRE(sb.cStr()[4] == '4');\n                REQUIRE(sb.cStr()[5] == '\\0');\n            }\n        }\n\n        WHEN(\"Add int8_t\") {\n            sb.add((int8_t) -3);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"-3\"));\n            }\n        }\n        WHEN(\"Add uint8_t\") {\n            sb.add((uint8_t) 250);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"250\"));\n            }\n        }\n        WHEN(\"Add int16_t\") {\n            sb.add((int16_t) -30000);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"-30000\"));\n            }\n        }\n        WHEN(\"Add uint16_t\") {\n            sb.add((uint16_t) 60000);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"60000\"));\n            }\n        }\n        WHEN(\"Add int32_t\") {\n            sb.add((int32_t) -2147483600);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"-2147483600\"));\n            }\n        }\n        WHEN(\"Add uint32_t\") {\n            sb.add((uint32_t) 4294967295U);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"4294967295\"));\n            }\n        }\n\n        WHEN(\"Add int64_t\") {\n            sb.add((int64_t) -9223372036854775800);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"-9223372036854775800\"));\n            }\n        }\n\n        WHEN(\"Add uint64_t\") {\n            uint64_t value = 18446744073709551614U;\n            sb.add(value);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"18446744073709551614\"));\n            }\n        }\n\n        WHEN(\"Add string and value\") {\n            uint64_t value = 18446744073709551614U;\n            sb.add(\"haha! \", value);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"haha! 18446744073709551614\"));\n            }\n        }\n\n        WHEN(\"Add string as array and value\") {\n            uint64_t value = 18446744073709551614U;\n            char haha[100]=\"haha! \";\n            sb.add(haha, 100, value);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"haha! 18446744073709551614\"));\n            }\n        }\n    }\n}\n\nSCENARIO( \"Insufficient buffer\", \"[CStringBuilder]\" ) {\n\n    GIVEN(\"A vector with some items\") {\n        const size_t bufferSize = 5;\n        char buffer[bufferSize];\n        CStringBuilder sb(buffer, bufferSize);\n\n        WHEN(\"Add long string\") {\n            sb.add(\"123456789\");\n\n            THEN(\"It should be truncated\") {\n                REQUIRE(sb.cStr() == std::string(\"1234\"));\n                REQUIRE(sb.cStr()[4] == '\\0');\n\n            }\n        }\n        AND_WHEN(\"We add integer to it\"){\n            THEN(\"It should not fall over the edges\") {\n                REQUIRE_NOTHROW(sb.add(55));\n            }\n        }\n\n\n        WHEN(\"Add long integer\") {\n            sb.add(123456789);\n\n            THEN(\"It should be truncated\") {\n                \/\/TODO REQUIRE(sb.cStr() == std::string(\"1234\"));\n                REQUIRE(sb.cStr()[4] == '\\0');\n            }\n        }\n    }\n}\n\n<commit_msg>CStringBuilder tests update<commit_after>\n#include \"catch.hpp\"\n#include \"CStringBuilder.hpp\"\n\n\nusing namespace tcsb;\n\nSCENARIO( \"Create and use simple CStringBuilder\", \"[CStringBuilder]\" ) {\n    GIVEN( \"A vector with some items\" ) {\n        const size_t bufferSize = 100;\n        char buffer[bufferSize];\n\n        CStringBuilder sb(buffer, bufferSize);\n\n        REQUIRE(sb.size() == 0);\n        REQUIRE(sb.bufferSize());\n\n        WHEN(\"Add another string\") {\n            sb.add(\"ha!\");\n            sb.add(\" \");\n            sb.add(5);\n\n            THEN(\"the size and capacity change\") {\n                REQUIRE(sb.size() == 5);\n            }\n\n            THEN(\"ha! should be there and 0 terminated\") {\n                REQUIRE(sb.cStr() == std::string(\"ha! 5\"));\n                REQUIRE(sb.cStr()[5] == '\\0');\n            }\n        }\n\n        WHEN(\"Append by 0 digit int\") {\n            sb.add(0);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"0\"));\n                REQUIRE(sb.cStr()[1] == '\\0');\n            }\n        }\n\n        WHEN(\"Add many digits int is passed\") {\n            sb.add(-1234);\n\n            THEN(\"it should be properly displayed\") {\n\n                REQUIRE(sb.cStr()[0] == '-');\n                REQUIRE(sb.cStr()[1] == '1');\n                REQUIRE(sb.cStr()[2] == '2');\n                REQUIRE(sb.cStr()[3] == '3');\n                REQUIRE(sb.cStr()[4] == '4');\n                REQUIRE(sb.cStr()[5] == '\\0');\n            }\n        }\n\n        WHEN(\"Add int8_t\") {\n            sb.add((int8_t) -3);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"-3\"));\n            }\n        }\n        WHEN(\"Add uint8_t\") {\n            sb.add((uint8_t) 250);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"250\"));\n            }\n        }\n        WHEN(\"Add int16_t\") {\n            sb.add((int16_t) -30000);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"-30000\"));\n            }\n        }\n        WHEN(\"Add uint16_t\") {\n            sb.add((uint16_t) 60000);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"60000\"));\n            }\n        }\n        WHEN(\"Add int32_t\") {\n            sb.add((int32_t) -2147483600);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"-2147483600\"));\n            }\n        }\n        WHEN(\"Add uint32_t\") {\n            sb.add((uint32_t) 4294967295U);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"4294967295\"));\n            }\n        }\n\n        WHEN(\"Add int64_t\") {\n            sb.add((int64_t) -9223372036854775800);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"-9223372036854775800\"));\n            }\n        }\n\n        WHEN(\"Add uint64_t\") {\n            uint64_t value = 18446744073709551614U;\n            sb.add(value);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"18446744073709551614\"));\n            }\n        }\n\n        WHEN(\"Add string and value\") {\n            uint64_t value = 18446744073709551614U;\n            sb.add(\"haha! \", value);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"haha! 18446744073709551614\"));\n            }\n        }\n\n        WHEN(\"Add string as array and value\") {\n            uint64_t value = 18446744073709551614U;\n            char haha[100]=\"haha! \";\n            sb.add(haha, 100, value);\n\n            THEN(\"it should be properly displayed\") {\n                REQUIRE(sb.cStr() == std::string(\"haha! 18446744073709551614\"));\n            }\n        }\n    }\n}\n\nSCENARIO( \"Insufficient buffer\", \"[CStringBuilder]\" ) {\n\n    GIVEN(\"A vector with some items\") {\n        const size_t bufferSize = 5;\n        char buffer[bufferSize];\n        CStringBuilder sb(buffer, bufferSize);\n\n        WHEN(\"Add long string\") {\n            sb.add(\"123456789\");\n\n            THEN(\"It should be truncated\") {\n                REQUIRE(sb.cStr() == std::string(\"1234\"));\n                REQUIRE(sb.cStr()[4] == '\\0');\n\n            }\n        }\n        AND_WHEN(\"We add integer to it\"){\n            THEN(\"It should not fall over the edges\") {\n                REQUIRE_NOTHROW(sb.add(55));\n            }\n        }\n\n\n        WHEN(\"Add long integer\") {\n            sb.add(123456789);\n\n            THEN(\"It should be truncated\") {\n                \/\/TODO REQUIRE(sb.cStr() == std::string(\"1234\"));\n                REQUIRE(sb.cStr()[4] == '\\0');\n            }\n        }\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>no message<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n *  For conditions of distribution and use, see copyright notice in license.txt\n *\n *  @file   JavascriptInstance.cpp\n *  @brief  Javascript script instance used wit EC_Script.\n *\/\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n#include \"JavascriptInstance.h\"\n#include \"JavascriptModule.h\"\n#include \"ScriptMetaTypeDefines.h\"\n#include \"NaaliCoreTypeDefines.h\"\n#include \"EC_Script.h\"\n#include \"IModule.h\"\n#include \"AssetAPI.h\"\n#include \"IAssetProvider.h\" \/\/to check if the code was loaded from a local or remote storage\n\n#include \"LoggingFunctions.h\"\nDEFINE_POCO_LOGGING_FUNCTIONS(\"JavascriptInstance\")\n\n#include <QFile>\n\n#include \"MemoryLeakCheck.h\"\n\nJavascriptInstance::JavascriptInstance(const QString &fileName, JavascriptModule *module)\n:engine_(0),\nsourceFile(fileName),\nmodule_(module),\nevaluated(false)\n{\n    CreateEngine();\n    Load();\n}\n\n\nJavascriptInstance::JavascriptInstance(ScriptAssetPtr scriptRef, JavascriptModule *module)\n:engine_(0),\nscriptRef_(scriptRef),\nmodule_(module),\nevaluated(false)\n{\n    CreateEngine();\n    Load();\n}\n\nJavascriptInstance::~JavascriptInstance()\n{\n    DeleteEngine();\n}\n\nvoid JavascriptInstance::Load()\n{\n    if (!engine_)\n        CreateEngine();\n\n    \/\/ Can't specify both a file source and an Asset API source.\n    assert(sourceFile.isEmpty() || scriptRef_.get() == 0);\n\n    \/\/determine based on code origin whether it can be trusted with system access or not\n    if (scriptRef_.get()) \n    {\n        AssetProviderPtr provider = scriptRef_.get()->GetAssetProvider();\n        if (provider->Name() == \"Local\")\n            trusted_ = true;\n        else\n            trusted_ = false;\n    }\n    \n\n    if (sourceFile.length() > 0)\n    {\n        program_ = LoadScript(sourceFile);\n        trusted_ = true; \/\/this is a local file directly, right?\n    }\n\n    \/\/ Do we even have a script to execute?\n    if (program_.isEmpty() && (!scriptRef_.get() || scriptRef_->scriptContent.isEmpty()))\n    {\n        LogError(\"JavascriptInstance::Load: No script content to load!\");\n        return;\n    }\n\n    QString scriptSourceFilename = (scriptRef_.get() ? scriptRef_->Name() : sourceFile);\n    QString &scriptContent = (scriptRef_.get() ? scriptRef_->scriptContent : program_);\n\n    QScriptSyntaxCheckResult syntaxResult = engine_->checkSyntax(scriptContent);\n    if (syntaxResult.state() != QScriptSyntaxCheckResult::Valid)\n    {\n        LogError(\"Syntax error in script \" + scriptSourceFilename.toStdString() + \",\" + QString::number(syntaxResult.errorLineNumber()).toStdString() +\n            \": \" + syntaxResult.errorMessage().toStdString());\n\n        \/\/ Delete our loaded script content (if any exists).\n        program_ == \"\";\n    }\n}\n\nQString JavascriptInstance::LoadScript(const QString &fileName)\n{\n    QString filename = fileName.trimmed();\n\n    \/\/ First check if the include was supposed to go through the Asset API.\n    if (module_)\n    {\n        ScriptAssetPtr asset = boost::dynamic_pointer_cast<ScriptAsset>(module_->GetFramework()->Asset()->GetAsset(fileName));\n        if (asset)\n            return asset->scriptContent;\n    }\n\n    \/\/ Otherwise, treat fileName as a local file to load up.\n\n    QFile scriptFile(filename);\n    if (!scriptFile.open(QIODevice::ReadOnly))\n    {\n        LogError((\"JavascriptInstance::LoadScript: Failed to load script from file \" + filename + \"!\").toStdString());\n        return \"\";\n    }\n\n    QString result = scriptFile.readAll();\n    scriptFile.close();\n\n    QString trimmedResult = result.trimmed();\n    if (trimmedResult.isEmpty())\n    {\n        LogWarning((\"JavascriptInstance::LoadScript: Warning Loaded script from file \" + filename + \", but the content was empty.\").toStdString());\n        return \"\";\n    }\n    return result;\n}\n\nvoid JavascriptInstance::Unload()\n{\n    DeleteEngine();\n}\n\nvoid JavascriptInstance::Run()\n{\n    \/\/ Need to have either absolute file path source or an Asset API source.\n    if (!scriptRef_.get() && program_.isEmpty())\n    {\n        LogError(\"JavascriptInstance::Run: Cannot run, no script reference loaded.\");\n        return;\n    }\n\n    \/\/ Can't specify both a file source and an Asset API source.\n    assert(sourceFile.isEmpty() || scriptRef_.get() == 0);\n\n    \/\/ If we've already evaluated this script once before, create a new script engine to run it again, or otherwise\n    \/\/ the effects would stack (we'd possibly register into signals twice, or other odd side effects).\n    \/\/ We never allow a script to be run twice in this kind of \"stacking\" manner.\n    if (evaluated)\n    {\n        Unload();\n        Load();\n    }\n\n    if (!engine_)\n    {\n        LogError(\"JavascriptInstance::Run: Cannot run, script engine not loaded.\");\n        return;\n    }\n\n    \/\/ If no script specified at all, we'll have to abort.\n    if (!scriptRef_.get() && program_.isEmpty())\n        return;\n\n    QString scriptSourceFilename = (scriptRef_.get() ? scriptRef_->Name() : sourceFile);\n    QString &scriptContent = (scriptRef_.get() ? scriptRef_->scriptContent : program_);\n\n    included_files_.clear();\n    QScriptValue result = engine_->evaluate(scriptContent, scriptSourceFilename);\n    if (engine_->hasUncaughtException())\n        LogError(result.toString().toStdString());\n\n    evaluated = true;\n}\n\nvoid JavascriptInstance::RegisterService(QObject *serviceObject, const QString &name)\n{\n    if (!engine_)\n    {\n        LogError(\"JavascriptInstance::RegisterService: No Qt script engine created when trying to register service to js script instance.\");\n        return;\n    }\n    if (!serviceObject)\n    {\n        LogError(\"JavascriptInstance::RegisterService: Trying to pass a null service object pointer to RegisterService!\");\n        return;\n    }\n\n    QScriptValue scriptValue = engine_->newQObject(serviceObject);\n    engine_->globalObject().setProperty(name, scriptValue);\n}\n\nvoid JavascriptInstance::IncludeFile(const QString &path)\n{\n    for (uint i = 0; i < included_files_.size(); ++i)\n    {\n        if (included_files_[i].toLower() == path.toLower())\n        {\n            LogDebug(\"JavascriptInstance::IncludeFile: Not including already included file \" + path.toStdString());\n            return;\n        }\n    }\n    \n    QString script = LoadScript(path);\n\n    QScriptContext *context = engine_->currentContext();\n    assert(context);\n    if (!context)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: QScriptEngine::currentContext() returned null!\");\n        return;\n    }\n\n    QScriptContext *parent = context->parentContext();\n    if (!parent)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: QScriptEngine::parentContext() returned null!\");\n        return;\n    }\n\n    context->setActivationObject(context->parentContext()->activationObject());\n    context->setThisObject(context->parentContext()->thisObject());\n\n    QScriptSyntaxCheckResult syntaxResult = engine_->checkSyntax(script);\n    if(syntaxResult.state() != QScriptSyntaxCheckResult::Valid)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: Syntax error in \" + path.toStdString() + syntaxResult.errorMessage().toStdString()\n            + \" In line:\" + QString::number(syntaxResult.errorLineNumber()).toStdString());\n        return;\n    }\n\n    QScriptValue result = engine_->evaluate(script);\n\n    included_files_.push_back(path);\n    \n    if (engine_->hasUncaughtException())\n        LogError(result.toString().toStdString());\n}\n\nvoid JavascriptInstance::ImportExtension(const QString &scriptExtensionName)\n{\n    assert(engine_);\n    if (!engine_)\n    {\n        LogWarning((\"JavascriptInstance::ImportExtension(\" + scriptExtensionName + \") failed, QScriptEngine==null!\").toStdString());\n        return;\n    }\n\n    QScriptValue success = engine_->importExtension(scriptExtensionName);\n    if (!success.isUndefined()) \/\/ Yes, importExtension returns undefinedValue if the import succeeds. http:\/\/doc.qt.nokia.com\/4.7\/qscriptengine.html#importExtension\n        LogWarning(std::string(\"JavascriptInstance::ImportExtension: Failed to load \") + scriptExtensionName.toStdString() + \" plugin for QtScript!\");\n    \n    if (!trusted_)\n    {\n        QScriptValue exposed;\n        exposed = engine_->globalObject().property(\"QDir\");\n        if (exposed.isValid())\n        {\n          engine_->globalObject().setProperty(\"QDir\", QScriptValue::QScriptValue()); \/\/passing an invalid val removes the property, http:\/\/doc.qt.nokia.com\/4.6\/qscriptvalue.html#setProperty\n          LogInfo(\"JavascriptInstance::ImportExtension: removed QDir from the untrusted context.\");\n        }\n    }\n}\n\nvoid JavascriptInstance::CreateEngine()\n{\n    if (engine_)\n        DeleteEngine();\n    engine_ = new QScriptEngine;\n    connect(engine_, SIGNAL(signalHandlerException(const QScriptValue &)), SLOT(OnSignalHandlerException(const QScriptValue &)));\n\n    ExposeQtMetaTypes(engine_);\n    ExposeNaaliCoreTypes(engine_);\n    ExposeCoreApiMetaTypes(engine_);\n\n    EC_Script *ec = dynamic_cast<EC_Script *>(owner_.lock().get());\n    module_->PrepareScriptInstance(this, ec);\n    evaluated = false;\n}\n\nvoid JavascriptInstance::DeleteEngine()\n{\n    if (!engine_)\n        return;\n\n    program_ = \"\";\n    engine_->abortEvaluation();\n\n    \/\/ As a convention, we call a function 'OnScriptDestroyed' for each JS script\n    \/\/ so that they can clean up their data before the script is removed from the object,\n    \/\/ or when the system is unloading.\n    \n    QScriptValue destructor = engine_->globalObject().property(\"OnScriptDestroyed\");\n    if (!destructor.isUndefined())\n        destructor.call();\n    SAFE_DELETE(engine_);\n}\n\nvoid JavascriptInstance::OnSignalHandlerException(const QScriptValue& exception)\n{\n    LogError(exception.toString().toStdString());\n}\n\n<commit_msg>two blacklists: 1) for qt extensions (dll\/so) and 2) for system access types in qt.core<commit_after>\/**\n *  For conditions of distribution and use, see copyright notice in license.txt\n *\n *  @file   JavascriptInstance.cpp\n *  @brief  Javascript script instance used wit EC_Script.\n *\/\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n#include \"JavascriptInstance.h\"\n#include \"JavascriptModule.h\"\n#include \"ScriptMetaTypeDefines.h\"\n#include \"NaaliCoreTypeDefines.h\"\n#include \"EC_Script.h\"\n#include \"IModule.h\"\n#include \"AssetAPI.h\"\n#include \"IAssetProvider.h\" \/\/to check if the code was loaded from a local or remote storage\n\n#include \"LoggingFunctions.h\"\nDEFINE_POCO_LOGGING_FUNCTIONS(\"JavascriptInstance\")\n\n#include <QFile>\n\n#include \"MemoryLeakCheck.h\"\n\nJavascriptInstance::JavascriptInstance(const QString &fileName, JavascriptModule *module)\n:engine_(0),\nsourceFile(fileName),\nmodule_(module),\nevaluated(false)\n{\n    CreateEngine();\n    Load();\n}\n\n\nJavascriptInstance::JavascriptInstance(ScriptAssetPtr scriptRef, JavascriptModule *module)\n:engine_(0),\nscriptRef_(scriptRef),\nmodule_(module),\nevaluated(false)\n{\n    CreateEngine();\n    Load();\n}\n\nJavascriptInstance::~JavascriptInstance()\n{\n    DeleteEngine();\n}\n\nvoid JavascriptInstance::Load()\n{\n    if (!engine_)\n        CreateEngine();\n\n    \/\/ Can't specify both a file source and an Asset API source.\n    assert(sourceFile.isEmpty() || scriptRef_.get() == 0);\n\n    \/\/determine based on code origin whether it can be trusted with system access or not\n    if (scriptRef_.get()) \n    {\n        AssetProviderPtr provider = scriptRef_.get()->GetAssetProvider();\n        if (provider->Name() == \"Local\")\n            trusted_ = true;\n        else\n            trusted_ = false;\n    }\n    \n\n    if (sourceFile.length() > 0)\n    {\n        program_ = LoadScript(sourceFile);\n        trusted_ = true; \/\/this is a local file directly, right?\n    }\n\n    \/\/ Do we even have a script to execute?\n    if (program_.isEmpty() && (!scriptRef_.get() || scriptRef_->scriptContent.isEmpty()))\n    {\n        LogError(\"JavascriptInstance::Load: No script content to load!\");\n        return;\n    }\n\n    QString scriptSourceFilename = (scriptRef_.get() ? scriptRef_->Name() : sourceFile);\n    QString &scriptContent = (scriptRef_.get() ? scriptRef_->scriptContent : program_);\n\n    QScriptSyntaxCheckResult syntaxResult = engine_->checkSyntax(scriptContent);\n    if (syntaxResult.state() != QScriptSyntaxCheckResult::Valid)\n    {\n        LogError(\"Syntax error in script \" + scriptSourceFilename.toStdString() + \",\" + QString::number(syntaxResult.errorLineNumber()).toStdString() +\n            \": \" + syntaxResult.errorMessage().toStdString());\n\n        \/\/ Delete our loaded script content (if any exists).\n        program_ == \"\";\n    }\n}\n\nQString JavascriptInstance::LoadScript(const QString &fileName)\n{\n    QString filename = fileName.trimmed();\n\n    \/\/ First check if the include was supposed to go through the Asset API.\n    if (module_)\n    {\n        ScriptAssetPtr asset = boost::dynamic_pointer_cast<ScriptAsset>(module_->GetFramework()->Asset()->GetAsset(fileName));\n        if (asset)\n            return asset->scriptContent;\n    }\n\n    \/\/ Otherwise, treat fileName as a local file to load up.\n\n    QFile scriptFile(filename);\n    if (!scriptFile.open(QIODevice::ReadOnly))\n    {\n        LogError((\"JavascriptInstance::LoadScript: Failed to load script from file \" + filename + \"!\").toStdString());\n        return \"\";\n    }\n\n    QString result = scriptFile.readAll();\n    scriptFile.close();\n\n    QString trimmedResult = result.trimmed();\n    if (trimmedResult.isEmpty())\n    {\n        LogWarning((\"JavascriptInstance::LoadScript: Warning Loaded script from file \" + filename + \", but the content was empty.\").toStdString());\n        return \"\";\n    }\n    return result;\n}\n\nvoid JavascriptInstance::Unload()\n{\n    DeleteEngine();\n}\n\nvoid JavascriptInstance::Run()\n{\n    \/\/ Need to have either absolute file path source or an Asset API source.\n    if (!scriptRef_.get() && program_.isEmpty())\n    {\n        LogError(\"JavascriptInstance::Run: Cannot run, no script reference loaded.\");\n        return;\n    }\n\n    \/\/ Can't specify both a file source and an Asset API source.\n    assert(sourceFile.isEmpty() || scriptRef_.get() == 0);\n\n    \/\/ If we've already evaluated this script once before, create a new script engine to run it again, or otherwise\n    \/\/ the effects would stack (we'd possibly register into signals twice, or other odd side effects).\n    \/\/ We never allow a script to be run twice in this kind of \"stacking\" manner.\n    if (evaluated)\n    {\n        Unload();\n        Load();\n    }\n\n    if (!engine_)\n    {\n        LogError(\"JavascriptInstance::Run: Cannot run, script engine not loaded.\");\n        return;\n    }\n\n    \/\/ If no script specified at all, we'll have to abort.\n    if (!scriptRef_.get() && program_.isEmpty())\n        return;\n\n    QString scriptSourceFilename = (scriptRef_.get() ? scriptRef_->Name() : sourceFile);\n    QString &scriptContent = (scriptRef_.get() ? scriptRef_->scriptContent : program_);\n\n    included_files_.clear();\n    QScriptValue result = engine_->evaluate(scriptContent, scriptSourceFilename);\n    if (engine_->hasUncaughtException())\n        LogError(result.toString().toStdString());\n\n    evaluated = true;\n}\n\nvoid JavascriptInstance::RegisterService(QObject *serviceObject, const QString &name)\n{\n    if (!engine_)\n    {\n        LogError(\"JavascriptInstance::RegisterService: No Qt script engine created when trying to register service to js script instance.\");\n        return;\n    }\n    if (!serviceObject)\n    {\n        LogError(\"JavascriptInstance::RegisterService: Trying to pass a null service object pointer to RegisterService!\");\n        return;\n    }\n\n    QScriptValue scriptValue = engine_->newQObject(serviceObject);\n    engine_->globalObject().setProperty(name, scriptValue);\n}\n\nvoid JavascriptInstance::IncludeFile(const QString &path)\n{\n    for (uint i = 0; i < included_files_.size(); ++i)\n    {\n        if (included_files_[i].toLower() == path.toLower())\n        {\n            LogDebug(\"JavascriptInstance::IncludeFile: Not including already included file \" + path.toStdString());\n            return;\n        }\n    }\n    \n    QString script = LoadScript(path);\n\n    QScriptContext *context = engine_->currentContext();\n    assert(context);\n    if (!context)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: QScriptEngine::currentContext() returned null!\");\n        return;\n    }\n\n    QScriptContext *parent = context->parentContext();\n    if (!parent)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: QScriptEngine::parentContext() returned null!\");\n        return;\n    }\n\n    context->setActivationObject(context->parentContext()->activationObject());\n    context->setThisObject(context->parentContext()->thisObject());\n\n    QScriptSyntaxCheckResult syntaxResult = engine_->checkSyntax(script);\n    if(syntaxResult.state() != QScriptSyntaxCheckResult::Valid)\n    {\n        LogError(\"JavascriptInstance::IncludeFile: Syntax error in \" + path.toStdString() + syntaxResult.errorMessage().toStdString()\n            + \" In line:\" + QString::number(syntaxResult.errorLineNumber()).toStdString());\n        return;\n    }\n\n    QScriptValue result = engine_->evaluate(script);\n\n    included_files_.push_back(path);\n    \n    if (engine_->hasUncaughtException())\n        LogError(result.toString().toStdString());\n}\n\nvoid JavascriptInstance::ImportExtension(const QString &scriptExtensionName)\n{\n    assert(engine_);\n    if (!engine_)\n    {\n        LogWarning((\"JavascriptInstance::ImportExtension(\" + scriptExtensionName + \") failed, QScriptEngine==null!\").toStdString());\n        return;\n    }\n\n    QStringList extension_blacklist;\n    extension_blacklist << \"qt.network\" << \"qt.webkit\"; \/\/webkit to not allow scripts to open hidden browsers to do malicious stuff.\n\n    QStringList qtcore_blacklist; \/\/the types in qt.core which are not safe\n    qtcore_blacklist << \"QDir\" << \"QFile\" << \"QFileSystemWatcher\" << \"QFileInfo\" << \"QLibrary\" << \"QPluginLoader\";\n\n    if (!trusted_ && extension_blacklist.contains(scriptExtensionName, Qt::CaseInsensitive))\n    {\n        LogWarning(\"JavascriptInstance::ImportExtension: refusing to load a QtScript plugin for an untrusted instance: \" + scriptExtensionName.toStdString());\n        return;\n    }\n\n    QScriptValue success = engine_->importExtension(scriptExtensionName);\n    if (!success.isUndefined()) \/\/ Yes, importExtension returns undefinedValue if the import succeeds. http:\/\/doc.qt.nokia.com\/4.7\/qscriptengine.html#importExtension\n        LogWarning(std::string(\"JavascriptInstance::ImportExtension: Failed to load \") + scriptExtensionName.toStdString() + \" plugin for QtScript!\");\n    \n    if (!trusted_)\n    {\n        QScriptValue exposed;\n        foreach (const QString &blacktype, qtcore_blacklist)\n        {\n            exposed = engine_->globalObject().property(blacktype);\n            if (exposed.isValid())\n            {\n                engine_->globalObject().setProperty(blacktype, QScriptValue::QScriptValue()); \/\/passing an invalid val removes the property, http:\/\/doc.qt.nokia.com\/4.6\/qscriptvalue.html#setProperty\n                \/\/LogInfo(\"JavascriptInstance::ImportExtension: removed a type from the untrusted context: \" + blacktype.toStdString());\n            }\n        }\n    }\n}\n\nvoid JavascriptInstance::CreateEngine()\n{\n    if (engine_)\n        DeleteEngine();\n    engine_ = new QScriptEngine;\n    connect(engine_, SIGNAL(signalHandlerException(const QScriptValue &)), SLOT(OnSignalHandlerException(const QScriptValue &)));\n\n    ExposeQtMetaTypes(engine_);\n    ExposeNaaliCoreTypes(engine_);\n    ExposeCoreApiMetaTypes(engine_);\n\n    EC_Script *ec = dynamic_cast<EC_Script *>(owner_.lock().get());\n    module_->PrepareScriptInstance(this, ec);\n    evaluated = false;\n}\n\nvoid JavascriptInstance::DeleteEngine()\n{\n    if (!engine_)\n        return;\n\n    program_ = \"\";\n    engine_->abortEvaluation();\n\n    \/\/ As a convention, we call a function 'OnScriptDestroyed' for each JS script\n    \/\/ so that they can clean up their data before the script is removed from the object,\n    \/\/ or when the system is unloading.\n    \n    QScriptValue destructor = engine_->globalObject().property(\"OnScriptDestroyed\");\n    if (!destructor.isUndefined())\n        destructor.call();\n    SAFE_DELETE(engine_);\n}\n\nvoid JavascriptInstance::OnSignalHandlerException(const QScriptValue& exception)\n{\n    LogError(exception.toString().toStdString());\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2011, Mathieu Labbe - IntRoLab - Universite de Sherbrooke\n *\/\n\n#include <stdio.h>\n\n\/\/ Qt stuff\n#include <QtCore\/QTime>\n#include <QtCore\/QTimer>\n#include <QtGui\/QApplication>\n#include <QtGui\/QGraphicsRectItem>\n#include <QtGui\/QPen>\n#include <QtGui\/QColor>\n\n\/\/ OpenCV stuff\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/features2d\/features2d.hpp>\n#include <opencv2\/nonfree\/features2d.hpp>\n#include <opencv2\/calib3d\/calib3d.hpp> \/\/ for homography\n\n\/\/ From this project (see src folder)\n#include \"ObjWidget.h\"\n#include \"QtOpenCV.h\"\n\nvoid showUsage()\n{\n\tprintf(\"\\n\");\n\tprintf(\"Usage :\\n\");\n\tprintf(\"  .\/example object.png scene.png\\n\");\n\texit(1);\n}\n\nint main(int argc, char * argv[])\n{\n\tif(argc<3)\n\t{\n\t\tshowUsage();\n\t}\n\tQTime time;\n\ttime.start();\n\n\t\/\/ GUI stuff\n\tQApplication app(argc, argv);\n\tObjWidget objWidget;\n\tObjWidget sceneWidget;\n\n\t\/\/Load as grayscale\n\tcv::Mat objectImg = cv::imread(argv[1], cv::IMREAD_GRAYSCALE);\n\tcv::Mat sceneImg = cv::imread(argv[2], cv::IMREAD_GRAYSCALE);\n\n\tif(!objectImg.empty() && !sceneImg.empty())\n\t{\n\t\tstd::vector<cv::KeyPoint> objectKeypoints;\n\t\tstd::vector<cv::KeyPoint> sceneKeypoints;\n\t\tcv::Mat objectDescriptors;\n\t\tcv::Mat sceneDescriptors;\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ EXTRACT KEYPOINTS\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ The detector can be any of (see OpenCV features2d.hpp):\n\t\t\/\/ cv::FeatureDetector * detector = new cv::DenseFeatureDetector();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::FastFeatureDetector();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::GFTTDetector();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::MSER();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::ORB();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::SIFT();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::StarFeatureDetector();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::SURF();\n\t\tcv::FeatureDetector * detector = new cv::SURF(600.0);\n\t\tdetector->detect(objectImg, objectKeypoints);\n\t\tprintf(\"Object: %d keypoints detected in %d ms\\n\", (int)objectKeypoints.size(), time.restart());\n\t\tdetector->detect(sceneImg, sceneKeypoints);\n\t\tprintf(\"Scene: %d keypoints detected in %d ms\\n\", (int)sceneKeypoints.size(), time.restart());\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ EXTRACT DESCRIPTORS\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ The extractor can be any of (see OpenCV features2d.hpp):\n\t\t\/\/ cv::DescriptorExtractor * extractor = new cv::BriefDescriptorExtractor();\n\t\t\/\/ cv::DescriptorExtractor * extractor = new cv::ORB();\n\t\t\/\/ cv::DescriptorExtractor * extractor = new cv::SIFT();\n\t\t\/\/ cv::DescriptorExtractor * extractor = new cv::SURF();\n\t\tcv::DescriptorExtractor * extractor = new cv::SURF(600.0);\n\t\textractor->compute(objectImg, objectKeypoints, objectDescriptors);\n\t\tprintf(\"Object: %d descriptors extracted in %d ms\\n\", objectDescriptors.rows, time.restart());\n\t\textractor->compute(sceneImg, sceneKeypoints, sceneDescriptors);\n\t\tprintf(\"Scene: %d descriptors extracted in %d ms\\n\", sceneDescriptors.rows, time.restart());\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ NEAREST NEIGHBOR MATCHING USING FLANN LIBRARY (included in OpenCV)\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ Format descriptors for Flann\n\t\tcv::Mat objectData;\n\t\tcv::Mat sceneData;\n\t\tif(objectDescriptors.type()!=CV_32F) {\n\t\t\tobjectDescriptors.convertTo(objectData, CV_32F); \/\/ make sure it's CV_32F\n\t\t}\n\t\telse {\n\t\t\tobjectData = objectDescriptors;\n\t\t}\n\t\tif(sceneDescriptors.type()!=CV_32F) {\n\t\t\tsceneDescriptors.convertTo(sceneData, CV_32F); \/\/ make sure it's CV_32F\n\t\t}\n\t\telse {\n\t\t\tsceneData = sceneDescriptors;\n\t\t}\n\n\t\t\/\/ Create Flann index\n\t\tcv::flann::Index treeFlannIndex(sceneData, cv::flann::KDTreeIndexParams());\n\t\tprintf(\"Time creating FLANN index = %d ms\\n\", time.restart());\n\n\t\t\/\/ search (nearest neighbor)\n\t\tint k=2; \/\/ find the 2 nearest neighbors\n\t\tcv::Mat results(objectData.rows, k, CV_32SC1); \/\/ Results index\n\t\tcv::Mat dists(objectData.rows, k, CV_32FC1); \/\/ Distance results are CV_32FC1\n\t\ttreeFlannIndex.knnSearch(objectData, results, dists, k, cv::flann::SearchParams() ); \/\/ maximum number of leafs checked\n\t\tprintf(\"Time nearest neighbor search = %d ms\\n\", time.restart());\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ PROCESS NEAREST NEIGHBOR RESULTS\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ Set gui data\n\t\tobjWidget.setData(objectKeypoints, objectDescriptors, objectImg, \"SURF\", \"SURF\");\n\t\tsceneWidget.setData(sceneKeypoints, sceneDescriptors, sceneImg, \"SURF\", \"SURF\");\n\n\t\t\/\/ Find correspondences by NNDR (Nearest Neighbor Distance Ratio)\n\t\tfloat nndrRatio = 0.6;\n\t\tstd::vector<cv::Point2f> mpts_1, mpts_2; \/\/ Used for homography\n\t\tstd::vector<int> indexes_1, indexes_2; \/\/ Used for homography\n\t\tstd::vector<uchar> outlier_mask;  \/\/ Used for homography\n\t\tfor(int i=0; i<objectData.rows; ++i)\n\t\t{\n\t\t\t\/\/ Check if this descriptor matches with those of the objects\n\t\t\t\/\/ Apply NNDR\n\t\t\tif(dists.at<float>(i,0) <= nndrRatio * dists.at<float>(i,1))\n\t\t\t{\n\t\t\t\tmpts_1.push_back(objectKeypoints.at(i).pt);\n\t\t\t\tindexes_1.push_back(i);\n\n\t\t\t\tmpts_2.push_back(sceneKeypoints.at(results.at<int>(i,0)).pt);\n\t\t\t\tindexes_2.push_back(results.at<int>(i,0));\n\t\t\t}\n\t\t}\n\n\t\t\/\/ FIND HOMOGRAPHY\n\t\tunsigned int minInliers = 8;\n\t\tif(mpts_1.size() >= minInliers)\n\t\t{\n\t\t\ttime.start();\n\t\t\tcv::Mat H = findHomography(mpts_1,\n\t\t\t\t\tmpts_2,\n\t\t\t\t\tcv::RANSAC,\n\t\t\t\t\t1.0,\n\t\t\t\t\toutlier_mask);\n\t\t\tprintf(\"Time finding homography = %d ms\\n\", time.restart());\n\t\t\tint inliers=0, outliers=0;\n\t\t\tfor(unsigned int k=0; k<mpts_1.size();++k)\n\t\t\t{\n\t\t\t\tif(outlier_mask.at(k))\n\t\t\t\t{\n\t\t\t\t\t++inliers;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t++outliers;\n\t\t\t\t}\n\t\t\t}\n\t\t\tQTransform hTransform(\n\t\t\tH.at<double>(0,0), H.at<double>(1,0), H.at<double>(2,0),\n\t\t\tH.at<double>(0,1), H.at<double>(1,1), H.at<double>(2,1),\n\t\t\tH.at<double>(0,2), H.at<double>(1,2), H.at<double>(2,2));\n\n\t\t\t\/\/ GUI : Change color and add homography rectangle\n\t\t\tQColor color(Qt::green);\n\t\t\tint alpha = 130;\n\t\t\tcolor.setAlpha(alpha);\n\t\t\tfor(unsigned int k=0; k<mpts_1.size();++k)\n\t\t\t{\n\t\t\t\tif(outlier_mask.at(k))\n\t\t\t\t{\n\t\t\t\t\tobjWidget.setKptColor(indexes_1.at(k), color);\n\t\t\t\t\tsceneWidget.setKptColor(indexes_2.at(k), color);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tobjWidget.setKptColor(indexes_1.at(k), QColor(255,0,0,alpha));\n\t\t\t\t\tsceneWidget.setKptColor(indexes_2.at(k), QColor(255,0,0,alpha));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQPen rectPen(color);\n\t\t\trectPen.setWidth(4);\n\t\t\tQGraphicsRectItem * rectItem = new QGraphicsRectItem(objWidget.pixmap().rect());\n\t\t\trectItem->setPen(rectPen);\n\t\t\trectItem->setTransform(hTransform);\n\t\t\tsceneWidget.addRect(rectItem);\n\t\t\tprintf(\"Inliers=%d Outliers=%d\\n\", inliers, outliers);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"Not enough matches (%d) for homography...\\n\", (int)mpts_1.size());\n\t\t}\n\n\t\t\/\/ Wait for gui\n\t\tobjWidget.setGraphicsViewMode(false);\n\t\tobjWidget.setWindowTitle(\"Object\");\n\t\tif(objWidget.pixmap().width() <= 800)\n\t\t{\n\t\t\tobjWidget.setMinimumSize(objWidget.pixmap().width(), objWidget.pixmap().height());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tobjWidget.setMinimumSize(800, 600);\n\t\t\tobjWidget.setAutoScale(false);\n\t\t}\n\n\t\tsceneWidget.setGraphicsViewMode(false);\n\t\tsceneWidget.setWindowTitle(\"Scene\");\n\t\tif(sceneWidget.pixmap().width() <= 800)\n\t\t{\n\t\t\tsceneWidget.setMinimumSize(sceneWidget.pixmap().width(), sceneWidget.pixmap().height());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsceneWidget.setMinimumSize(800, 600);\n\t\t\tsceneWidget.setAutoScale(false);\n\t\t}\n\n\t\tsceneWidget.show();\n\t\tobjWidget.show();\n\n\t\tint r = app.exec();\n\t\tprintf(\"Closing...\\n\");\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/Cleanup\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\tdelete detector;\n\t\tdelete extractor;\n\n\t\treturn r;\n\t}\n\telse\n\t{\n\t\tprintf(\"Images are not valid!\\n\");\n\t\tshowUsage();\n\t}\n\n\treturn 1;\n}\n<commit_msg>Added loading images time in example<commit_after>\/*\n * Copyright (C) 2011, Mathieu Labbe - IntRoLab - Universite de Sherbrooke\n *\/\n\n#include <stdio.h>\n\n\/\/ Qt stuff\n#include <QtCore\/QTime>\n#include <QtCore\/QTimer>\n#include <QtGui\/QApplication>\n#include <QtGui\/QGraphicsRectItem>\n#include <QtGui\/QPen>\n#include <QtGui\/QColor>\n\n\/\/ OpenCV stuff\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/features2d\/features2d.hpp>\n#include <opencv2\/nonfree\/features2d.hpp>\n#include <opencv2\/calib3d\/calib3d.hpp> \/\/ for homography\n\n\/\/ From this project (see src folder)\n#include \"ObjWidget.h\"\n#include \"QtOpenCV.h\"\n\nvoid showUsage()\n{\n\tprintf(\"\\n\");\n\tprintf(\"Usage :\\n\");\n\tprintf(\"  .\/example object.png scene.png\\n\");\n\texit(1);\n}\n\nint main(int argc, char * argv[])\n{\n\tif(argc<3)\n\t{\n\t\tshowUsage();\n\t}\n\tQTime time;\n\n\t\/\/ GUI stuff\n\tQApplication app(argc, argv);\n\tObjWidget objWidget;\n\tObjWidget sceneWidget;\n\n\ttime.start();\n\t\/\/Load as grayscale\n\tcv::Mat objectImg = cv::imread(argv[1], cv::IMREAD_GRAYSCALE);\n\tcv::Mat sceneImg = cv::imread(argv[2], cv::IMREAD_GRAYSCALE);\n\n\tif(!objectImg.empty() && !sceneImg.empty())\n\t{\n\t\tprintf(\"Loading images: %d ms\\n\", time.restart());\n\t\tstd::vector<cv::KeyPoint> objectKeypoints;\n\t\tstd::vector<cv::KeyPoint> sceneKeypoints;\n\t\tcv::Mat objectDescriptors;\n\t\tcv::Mat sceneDescriptors;\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ EXTRACT KEYPOINTS\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ The detector can be any of (see OpenCV features2d.hpp):\n\t\t\/\/ cv::FeatureDetector * detector = new cv::DenseFeatureDetector();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::FastFeatureDetector();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::GFTTDetector();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::MSER();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::ORB();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::SIFT();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::StarFeatureDetector();\n\t\t\/\/ cv::FeatureDetector * detector = new cv::SURF();\n\t\tcv::FeatureDetector * detector = new cv::SURF(600.0);\n\t\tdetector->detect(objectImg, objectKeypoints);\n\t\tprintf(\"Object: %d keypoints detected in %d ms\\n\", (int)objectKeypoints.size(), time.restart());\n\t\tdetector->detect(sceneImg, sceneKeypoints);\n\t\tprintf(\"Scene: %d keypoints detected in %d ms\\n\", (int)sceneKeypoints.size(), time.restart());\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ EXTRACT DESCRIPTORS\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ The extractor can be any of (see OpenCV features2d.hpp):\n\t\t\/\/ cv::DescriptorExtractor * extractor = new cv::BriefDescriptorExtractor();\n\t\t\/\/ cv::DescriptorExtractor * extractor = new cv::ORB();\n\t\t\/\/ cv::DescriptorExtractor * extractor = new cv::SIFT();\n\t\t\/\/ cv::DescriptorExtractor * extractor = new cv::SURF();\n\t\tcv::DescriptorExtractor * extractor = new cv::SURF(600.0);\n\t\textractor->compute(objectImg, objectKeypoints, objectDescriptors);\n\t\tprintf(\"Object: %d descriptors extracted in %d ms\\n\", objectDescriptors.rows, time.restart());\n\t\textractor->compute(sceneImg, sceneKeypoints, sceneDescriptors);\n\t\tprintf(\"Scene: %d descriptors extracted in %d ms\\n\", sceneDescriptors.rows, time.restart());\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ NEAREST NEIGHBOR MATCHING USING FLANN LIBRARY (included in OpenCV)\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ Format descriptors for Flann\n\t\tcv::Mat objectData;\n\t\tcv::Mat sceneData;\n\t\tif(objectDescriptors.type()!=CV_32F) {\n\t\t\tobjectDescriptors.convertTo(objectData, CV_32F); \/\/ make sure it's CV_32F\n\t\t}\n\t\telse {\n\t\t\tobjectData = objectDescriptors;\n\t\t}\n\t\tif(sceneDescriptors.type()!=CV_32F) {\n\t\t\tsceneDescriptors.convertTo(sceneData, CV_32F); \/\/ make sure it's CV_32F\n\t\t}\n\t\telse {\n\t\t\tsceneData = sceneDescriptors;\n\t\t}\n\n\t\t\/\/ Create Flann index\n\t\tcv::flann::Index treeFlannIndex(sceneData, cv::flann::KDTreeIndexParams());\n\t\tprintf(\"Time creating FLANN index = %d ms\\n\", time.restart());\n\n\t\t\/\/ search (nearest neighbor)\n\t\tint k=2; \/\/ find the 2 nearest neighbors\n\t\tcv::Mat results(objectData.rows, k, CV_32SC1); \/\/ Results index\n\t\tcv::Mat dists(objectData.rows, k, CV_32FC1); \/\/ Distance results are CV_32FC1\n\t\ttreeFlannIndex.knnSearch(objectData, results, dists, k, cv::flann::SearchParams() ); \/\/ maximum number of leafs checked\n\t\tprintf(\"Time nearest neighbor search = %d ms\\n\", time.restart());\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ PROCESS NEAREST NEIGHBOR RESULTS\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/ Set gui data\n\t\tobjWidget.setData(objectKeypoints, objectDescriptors, objectImg, \"SURF\", \"SURF\");\n\t\tsceneWidget.setData(sceneKeypoints, sceneDescriptors, sceneImg, \"SURF\", \"SURF\");\n\n\t\t\/\/ Find correspondences by NNDR (Nearest Neighbor Distance Ratio)\n\t\tfloat nndrRatio = 0.6;\n\t\tstd::vector<cv::Point2f> mpts_1, mpts_2; \/\/ Used for homography\n\t\tstd::vector<int> indexes_1, indexes_2; \/\/ Used for homography\n\t\tstd::vector<uchar> outlier_mask;  \/\/ Used for homography\n\t\tfor(int i=0; i<objectData.rows; ++i)\n\t\t{\n\t\t\t\/\/ Check if this descriptor matches with those of the objects\n\t\t\t\/\/ Apply NNDR\n\t\t\tif(dists.at<float>(i,0) <= nndrRatio * dists.at<float>(i,1))\n\t\t\t{\n\t\t\t\tmpts_1.push_back(objectKeypoints.at(i).pt);\n\t\t\t\tindexes_1.push_back(i);\n\n\t\t\t\tmpts_2.push_back(sceneKeypoints.at(results.at<int>(i,0)).pt);\n\t\t\t\tindexes_2.push_back(results.at<int>(i,0));\n\t\t\t}\n\t\t}\n\n\t\t\/\/ FIND HOMOGRAPHY\n\t\tunsigned int minInliers = 8;\n\t\tif(mpts_1.size() >= minInliers)\n\t\t{\n\t\t\ttime.start();\n\t\t\tcv::Mat H = findHomography(mpts_1,\n\t\t\t\t\tmpts_2,\n\t\t\t\t\tcv::RANSAC,\n\t\t\t\t\t1.0,\n\t\t\t\t\toutlier_mask);\n\t\t\tprintf(\"Time finding homography = %d ms\\n\", time.restart());\n\t\t\tint inliers=0, outliers=0;\n\t\t\tfor(unsigned int k=0; k<mpts_1.size();++k)\n\t\t\t{\n\t\t\t\tif(outlier_mask.at(k))\n\t\t\t\t{\n\t\t\t\t\t++inliers;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t++outliers;\n\t\t\t\t}\n\t\t\t}\n\t\t\tQTransform hTransform(\n\t\t\tH.at<double>(0,0), H.at<double>(1,0), H.at<double>(2,0),\n\t\t\tH.at<double>(0,1), H.at<double>(1,1), H.at<double>(2,1),\n\t\t\tH.at<double>(0,2), H.at<double>(1,2), H.at<double>(2,2));\n\n\t\t\t\/\/ GUI : Change color and add homography rectangle\n\t\t\tQColor color(Qt::green);\n\t\t\tint alpha = 130;\n\t\t\tcolor.setAlpha(alpha);\n\t\t\tfor(unsigned int k=0; k<mpts_1.size();++k)\n\t\t\t{\n\t\t\t\tif(outlier_mask.at(k))\n\t\t\t\t{\n\t\t\t\t\tobjWidget.setKptColor(indexes_1.at(k), color);\n\t\t\t\t\tsceneWidget.setKptColor(indexes_2.at(k), color);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tobjWidget.setKptColor(indexes_1.at(k), QColor(255,0,0,alpha));\n\t\t\t\t\tsceneWidget.setKptColor(indexes_2.at(k), QColor(255,0,0,alpha));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQPen rectPen(color);\n\t\t\trectPen.setWidth(4);\n\t\t\tQGraphicsRectItem * rectItem = new QGraphicsRectItem(objWidget.pixmap().rect());\n\t\t\trectItem->setPen(rectPen);\n\t\t\trectItem->setTransform(hTransform);\n\t\t\tsceneWidget.addRect(rectItem);\n\t\t\tprintf(\"Inliers=%d Outliers=%d\\n\", inliers, outliers);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"Not enough matches (%d) for homography...\\n\", (int)mpts_1.size());\n\t\t}\n\n\t\t\/\/ Wait for gui\n\t\tobjWidget.setGraphicsViewMode(false);\n\t\tobjWidget.setWindowTitle(\"Object\");\n\t\tif(objWidget.pixmap().width() <= 800)\n\t\t{\n\t\t\tobjWidget.setMinimumSize(objWidget.pixmap().width(), objWidget.pixmap().height());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tobjWidget.setMinimumSize(800, 600);\n\t\t\tobjWidget.setAutoScale(false);\n\t\t}\n\n\t\tsceneWidget.setGraphicsViewMode(false);\n\t\tsceneWidget.setWindowTitle(\"Scene\");\n\t\tif(sceneWidget.pixmap().width() <= 800)\n\t\t{\n\t\t\tsceneWidget.setMinimumSize(sceneWidget.pixmap().width(), sceneWidget.pixmap().height());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsceneWidget.setMinimumSize(800, 600);\n\t\t\tsceneWidget.setAutoScale(false);\n\t\t}\n\n\t\tsceneWidget.show();\n\t\tobjWidget.show();\n\n\t\tint r = app.exec();\n\t\tprintf(\"Closing...\\n\");\n\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/Cleanup\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\tdelete detector;\n\t\tdelete extractor;\n\n\t\treturn r;\n\t}\n\telse\n\t{\n\t\tprintf(\"Images are not valid!\\n\");\n\t\tshowUsage();\n\t}\n\n\treturn 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2008 Advanced Micro Devices, Inc. All rights reserved.\n\/\/\n\n#ifndef TOP_HPP_\n#define TOP_HPP_\n\n#if defined(ATI_ARCH_ARM)\n# define __EXPORTED_HEADERS__ 1\n#endif \/*ATI_ARCH_ARM*\/\n\n#ifdef _WIN32\n\/\/ Disable unneeded features of <windows.h> for efficiency.\n# define NOGDICAPMASKS\n# define NOVIRTUALKEYCODES\n# define NOWINMESSAGES\n# define NOWINSTYLES\n# define NOSYSMETRICS\n# define NOMENUS\n# define NOICONS\n# define NOKEYSTATES\n# define NOSYSCOMMANDS\n# define NORASTEROPS\n# define NOSHOWWINDOW\n# define OEMRESOURCE\n# define NOATOM\n# define NOCLIPBOARD\n# define NOCOLOR\n# define NOCTLMGR\n# define NODRAWTEXT\n# define NOGDI\n# define NOKERNEL\n# define NOMB\n# define NOMEMMGR\n# define NOMETAFILE\n# define NOMINMAX\n# define NOOPENFILE\n# define NOSCROLL\n# define NOSERVICE\n# define NOSOUND\n# define NOTEXTMETRIC\n# define NOWH\n# define NOWINOFFSETS\n# define NOCOMM\n# define NOKANJI\n# define NOHELP\n# define NOPROFILER\n# define NODEFERWINDOWPOS\n# define NOMCX\n# ifndef NOCRYPT\n#  define NOCRYPT\n# endif\n# define WIN32_LEAN_AND_MEAN 1\n#endif \/*_WIN32*\/\n\n#include \"utils\/macros.hpp\"\n#include \"CL\/opencl.h\"\n\n#if defined(CL_VERSION_2_0)\n\/* Deprecated in OpenCL 2.0 *\/\n# define CL_DEVICE_QUEUE_PROPERTIES     0x102A\n# define CL_DEVICE_HOST_UNIFIED_MEMORY  0x1035\n#endif\n\n#if !defined(ATI_ARCH_ARM)\n#include <xmmintrin.h>\n#endif \/*!ATI_ARCH_ARM*\/\n\n#include <cstdint>\n#include <cstddef>\n#include <new>\n\ntypedef unsigned char* address;\ntypedef const unsigned char* const_address;\ntypedef void * pointer;\ntypedef const void * const_pointer;\ntypedef unsigned int uint;\ntypedef unsigned long ulong;\ntypedef const char* cstring;\n\n#if defined(_WIN32)\n# if defined(_WIN64)\ntypedef __int64 ssize_t;\n# else \/\/ !_WIN64\ntypedef __int32 ssize_t;\n# endif \/\/ !_WIN64\n#endif \/*_WIN32*\/\n\n#ifdef _WIN32\n# define SIZE_T_FMT \"%Iu\"\n# define PTR_FMT    \"0x%p\"\n# if _MSC_VER < 1900\n#  define snprintf sprintf_s\n# endif\n#else \/*!_WIN32*\/\n# define SIZE_T_FMT \"%zu\"\n# define PTR_FMT    \"%p\"\n#endif \/*!_WIN32*\/\n\ntypedef uint32_t cl_mem_fence_flags;\n\n\/\/! \\cond ignore\n#define _BAD_INT32  0xBAADBAAD\n#define _BAD_INT64  0XBAADBAADBAADBAADLL\n#define _BAD_INTPTR LP64_SWITCH(_BAD_INT32,_BAD_INT64)\n\nconst pointer badPointer = (pointer)(intptr_t) _BAD_INTPTR;\nconst address badAddress = (address)(intptr_t) _BAD_INTPTR;\n\/\/! \\endcond\n\nconst size_t Ki = 1024;\nconst size_t Mi = Ki*Ki;\nconst size_t Gi = Ki*Ki*Ki;\n\nconst size_t K = 1000;\nconst size_t M = K*K;\nconst size_t G = K*K*K;\n\n#include \"utils\/debug.hpp\"\n\n\/\/! \\addtogroup Utils\n\n\/\/! Namespace for AMD's OpenCL platform\nnamespace amd {\/*@{*\/\n\n\/\/! \\brief The default Null object type (!= void*);\nstruct Null {};\n\n\/\/! \\brief Return a const Null object (null)\ninline const Null null() { return Null(); }\n\n\/*! \\brief Equivalent to a namespace (All member functions are static).\n *\/\nclass AllStatic\n{\nWINDOWS_SWITCH(public,private):\n    AllStatic() { ShouldNotCallThis(); }\n    AllStatic(const AllStatic&) { ShouldNotCallThis(); }\n    ~AllStatic() { ShouldNotCallThis(); }\n};\n\n\/*! \\brief For embedded objects.\n *\/\nclass EmbeddedObject\n{\nWINDOWS_SWITCH(public,private):\n    void* operator new(size_t) { ShouldNotCallThis(); return badPointer;  }\n    void operator delete(void *) { ShouldNotCallThis(); }\n};\n\n\/*! \\brief For stack allocated objects.\n *\/\nclass StackObject\n{\nWINDOWS_SWITCH(public,private):\n    void* operator new(size_t) { ShouldNotCallThis(); return badPointer;  }\n    void operator delete(void *) { ShouldNotCallThis(); }\n};\n\n\/*! \\brief for objects allocated in a dedicate memory pool.\n  the standard 'new' should not be called, \n  only the in place version 'new (allocation_pointer) <class>()'\n  , delete should only invoke the destructors and not release memory\n *\/\nclass MemoryPoolObject\n{\npublic:\n\tvoid* operator new(size_t) { ShouldNotCallThis(); return badPointer;  }\n\tvoid* operator new(size_t size,void * address) { return address; }\n\tvoid operator delete(void *) {  }\n\tvoid operator delete( void *,void * address) { }\n};\n\n\/*! \\brief For objects allocated on the C-heap.\n *\/\nclass HeapObject\n{\npublic:\n    void* operator new(size_t size);\n    void operator delete(void* obj);\n    void* operator new(size_t size, size_t extSize)\n        { return HeapObject::operator new (size + extSize); };\n    void operator delete(void* obj, size_t extSize)\n        { HeapObject::operator delete (obj); }\n};\n\n\/*! \\brief For all reference counted objects.\n *\/\nclass ReferenceCountedObject\n{\n    volatile uint referenceCount_;\n\nprotected:\n    virtual ~ReferenceCountedObject() { }\n    virtual bool terminate() { return true; }\n\npublic:\n    ReferenceCountedObject() : referenceCount_(1) { }\n\n    void* operator new(size_t size) { return ::operator new(size); }\n    void operator delete(void* p) { return ::operator delete(p); }\n    void* operator new(size_t size, size_t extSize)\n        { return ReferenceCountedObject::operator new (size + extSize); };\n    void operator delete(void* obj, size_t extSize)\n        { ReferenceCountedObject::operator delete (obj); }\n\n    uint referenceCount() const { return referenceCount_; }\n\n    uint retain();\n    uint release();\n};\n\n\/*@}*\/} \/\/ namespace amd\n\n#undef min \/\/ using std::min\n#undef max \/\/ using std::max\n\n#endif \/*TOP_HPP_*\/\n\n<commit_msg>P4 to Git Change 1330418 by lmoriche@lmoriche_opencl_dev on 2016\/10\/24 01:43:34<commit_after>\/\/\n\/\/ Copyright (c) 2008 Advanced Micro Devices, Inc. All rights reserved.\n\/\/\n\n#ifndef TOP_HPP_\n#define TOP_HPP_\n\n#if defined(ATI_ARCH_ARM)\n# define __EXPORTED_HEADERS__ 1\n#endif \/*ATI_ARCH_ARM*\/\n\n#ifdef _WIN32\n\/\/ Disable unneeded features of <windows.h> for efficiency.\n# define NODRAWTEXT 1\n# define NOMINMAX 1\n# define WIN32_LEAN_AND_MEAN 1\n#endif \/*_WIN32*\/\n\n#include \"utils\/macros.hpp\"\n#include \"CL\/opencl.h\"\n\n#if defined(CL_VERSION_2_0)\n\/* Deprecated in OpenCL 2.0 *\/\n# define CL_DEVICE_QUEUE_PROPERTIES     0x102A\n# define CL_DEVICE_HOST_UNIFIED_MEMORY  0x1035\n#endif\n\n#if !defined(ATI_ARCH_ARM)\n#include <xmmintrin.h>\n#endif \/*!ATI_ARCH_ARM*\/\n\n#include <cstdint>\n#include <cstddef>\n#include <new>\n\ntypedef unsigned char* address;\ntypedef const unsigned char* const_address;\ntypedef void * pointer;\ntypedef const void * const_pointer;\ntypedef unsigned int uint;\ntypedef unsigned long ulong;\ntypedef const char* cstring;\n\n#if defined(_WIN32)\n# if defined(_WIN64)\ntypedef __int64 ssize_t;\n# else \/\/ !_WIN64\ntypedef __int32 ssize_t;\n# endif \/\/ !_WIN64\n#endif \/*_WIN32*\/\n\n#ifdef _WIN32\n# define SIZE_T_FMT \"%Iu\"\n# define PTR_FMT    \"0x%p\"\n# if _MSC_VER < 1900\n#  define snprintf sprintf_s\n# endif\n#else \/*!_WIN32*\/\n# define SIZE_T_FMT \"%zu\"\n# define PTR_FMT    \"%p\"\n#endif \/*!_WIN32*\/\n\ntypedef uint32_t cl_mem_fence_flags;\n\n\/\/! \\cond ignore\n#define _BAD_INT32  0xBAADBAAD\n#define _BAD_INT64  0XBAADBAADBAADBAADLL\n#define _BAD_INTPTR LP64_SWITCH(_BAD_INT32,_BAD_INT64)\n\nconst pointer badPointer = (pointer)(intptr_t) _BAD_INTPTR;\nconst address badAddress = (address)(intptr_t) _BAD_INTPTR;\n\/\/! \\endcond\n\nconst size_t Ki = 1024;\nconst size_t Mi = Ki*Ki;\nconst size_t Gi = Ki*Ki*Ki;\n\nconst size_t K = 1000;\nconst size_t M = K*K;\nconst size_t G = K*K*K;\n\n#include \"utils\/debug.hpp\"\n\n\/\/! \\addtogroup Utils\n\n\/\/! Namespace for AMD's OpenCL platform\nnamespace amd {\/*@{*\/\n\n\/\/! \\brief The default Null object type (!= void*);\nstruct Null {};\n\n\/\/! \\brief Return a const Null object (null)\ninline const Null null() { return Null(); }\n\n\/*! \\brief Equivalent to a namespace (All member functions are static).\n *\/\nclass AllStatic\n{\nWINDOWS_SWITCH(public,private):\n    AllStatic() { ShouldNotCallThis(); }\n    AllStatic(const AllStatic&) { ShouldNotCallThis(); }\n    ~AllStatic() { ShouldNotCallThis(); }\n};\n\n\/*! \\brief For embedded objects.\n *\/\nclass EmbeddedObject\n{\nWINDOWS_SWITCH(public,private):\n    void* operator new(size_t) { ShouldNotCallThis(); return badPointer;  }\n    void operator delete(void *) { ShouldNotCallThis(); }\n};\n\n\/*! \\brief For stack allocated objects.\n *\/\nclass StackObject\n{\nWINDOWS_SWITCH(public,private):\n    void* operator new(size_t) { ShouldNotCallThis(); return badPointer;  }\n    void operator delete(void *) { ShouldNotCallThis(); }\n};\n\n\/*! \\brief for objects allocated in a dedicate memory pool.\n  the standard 'new' should not be called, \n  only the in place version 'new (allocation_pointer) <class>()'\n  , delete should only invoke the destructors and not release memory\n *\/\nclass MemoryPoolObject\n{\npublic:\n\tvoid* operator new(size_t) { ShouldNotCallThis(); return badPointer;  }\n\tvoid* operator new(size_t size,void * address) { return address; }\n\tvoid operator delete(void *) {  }\n\tvoid operator delete( void *,void * address) { }\n};\n\n\/*! \\brief For objects allocated on the C-heap.\n *\/\nclass HeapObject\n{\npublic:\n    void* operator new(size_t size);\n    void operator delete(void* obj);\n    void* operator new(size_t size, size_t extSize)\n        { return HeapObject::operator new (size + extSize); };\n    void operator delete(void* obj, size_t extSize)\n        { HeapObject::operator delete (obj); }\n};\n\n\/*! \\brief For all reference counted objects.\n *\/\nclass ReferenceCountedObject\n{\n    volatile uint referenceCount_;\n\nprotected:\n    virtual ~ReferenceCountedObject() { }\n    virtual bool terminate() { return true; }\n\npublic:\n    ReferenceCountedObject() : referenceCount_(1) { }\n\n    void* operator new(size_t size) { return ::operator new(size); }\n    void operator delete(void* p) { return ::operator delete(p); }\n    void* operator new(size_t size, size_t extSize)\n        { return ReferenceCountedObject::operator new (size + extSize); };\n    void operator delete(void* obj, size_t extSize)\n        { ReferenceCountedObject::operator delete (obj); }\n\n    uint referenceCount() const { return referenceCount_; }\n\n    uint retain();\n    uint release();\n};\n\n\/*@}*\/} \/\/ namespace amd\n\n#undef min \/\/ using std::min\n#undef max \/\/ using std::max\n\n#endif \/*TOP_HPP_*\/\n\n<|endoftext|>"}
{"text":"<commit_before>#include <benchmark\/benchmark.h>\n#include \"generated.hpp\"\n#include <silicium\/error_or.hpp>\n#include <test\/checkpoint.hpp>\n#include <boost\/asio\/io_service.hpp>\n#include <queue>\n\nnamespace\n{\n    struct in_process_pipe\n    {\n        boost::asio::io_service &dispatcher;\n        boost::asio::const_buffer writing;\n        boost::asio::mutable_buffer reading;\n        std::function<void(boost::system::error_code, std::size_t)> write_callback;\n        std::function<void(boost::system::error_code, std::size_t)> read_callback;\n\n        explicit in_process_pipe(boost::asio::io_service &dispatcher)\n            : dispatcher(dispatcher)\n        {\n        }\n\n        template <class ConstBufferSequence, class CompletionToken>\n        auto async_write_some(ConstBufferSequence const &buffers, CompletionToken &&token)\n        {\n            assert(!write_callback);\n            assert(!boost::empty(buffers));\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(boost::system::error_code, std::size_t)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            using boost::begin;\n            writing = *begin(buffers);\n            write_callback = std::move(handler);\n            pump();\n            return result.get();\n        }\n\n        template <class MutableBufferSequence, class CompletionToken>\n        auto async_read_some(MutableBufferSequence const &buffers, CompletionToken &&token)\n        {\n            assert(!read_callback);\n            assert(!boost::empty(buffers));\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(boost::system::error_code, std::size_t)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            using boost::begin;\n            reading = *begin(buffers);\n            read_callback = std::move(handler);\n            pump();\n            return result.get();\n        }\n\n    private:\n        void pump()\n        {\n            if (write_callback && read_callback)\n            {\n                std::size_t const copied = boost::asio::buffer_copy(reading, writing);\n                dispatcher.post([\n                    write_callback = Si::exchange(write_callback, nullptr),\n                    read_callback = Si::exchange(read_callback, nullptr),\n                    copied\n                ]()\n                                {\n                                    write_callback({}, copied);\n                                    read_callback({}, copied);\n                                });\n            }\n        }\n    };\n\n    template <class AsyncStream>\n    struct byte_counter\n    {\n        AsyncStream underlying;\n        std::uint64_t written = 0;\n        std::uint64_t read = 0;\n\n        template <class... Args>\n        explicit byte_counter(Args &&... args)\n            : underlying(std::forward<Args>(args)...)\n        {\n        }\n\n        template <class ConstBufferSequence, class CompletionToken>\n        auto async_write_some(ConstBufferSequence const &buffers, CompletionToken &&token)\n        {\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(boost::system::error_code, std::size_t)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            underlying.async_write_some(buffers, warpcoil::cpp::wrap_handler(\n                                                     [this](boost::system::error_code ec, std::size_t bytes_transferred,\n                                                            decltype(handler) &handler)\n                                                     {\n                                                         written += bytes_transferred;\n                                                         handler(ec, bytes_transferred);\n                                                     },\n                                                     std::move(handler)));\n            return result.get();\n        }\n\n        template <class MutableBufferSequence, class CompletionToken>\n        auto async_read_some(MutableBufferSequence const &buffers, CompletionToken &&token)\n        {\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(boost::system::error_code, std::size_t)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            underlying.async_read_some(buffers, warpcoil::cpp::wrap_handler(\n                                                    [this](boost::system::error_code ec, std::size_t bytes_transferred,\n                                                           decltype(handler) &handler)\n                                                    {\n                                                        read += bytes_transferred;\n                                                        handler(ec, bytes_transferred);\n                                                    },\n                                                    std::move(handler)));\n            return result.get();\n        }\n    };\n\n    struct my_hello_service : async_binary_integer_function\n    {\n        void evaluate(std::tuple<std::uint64_t, std::uint64_t> argument,\n                      std::function<void(boost::system::error_code, std::uint64_t)> on_result) override\n        {\n            on_result({}, std::get<0>(argument) * std::get<1>(argument));\n        }\n    };\n\n    void RequestAndResponseOverInProcessPipe(benchmark::State &state)\n    {\n        boost::asio::io_service io;\n        byte_counter<in_process_pipe> client_to_server(io);\n        byte_counter<in_process_pipe> server_to_client(io);\n        my_hello_service server_impl;\n        warpcoil::cpp::message_splitter<decltype(client_to_server)> server_splitter(client_to_server);\n        warpcoil::cpp::buffered_writer<decltype(server_to_client)> server_writer(server_to_client);\n        async_binary_integer_function_server<decltype(server_impl), decltype(client_to_server),\n                                             decltype(server_to_client)> server(server_impl, server_splitter,\n                                                                                server_writer);\n\n        warpcoil::cpp::message_splitter<decltype(server_to_client)> client_splitter(server_to_client);\n        warpcoil::cpp::buffered_writer<decltype(client_to_server)> client_writer(client_to_server);\n        async_binary_integer_function_client<decltype(server_to_client), decltype(client_to_server)> client(\n            client_writer, client_splitter);\n\n        while (state.KeepRunning())\n        {\n            warpcoil::checkpoint client_side;\n            client.evaluate(std::make_tuple(34, 45), [&client_side](boost::system::error_code ec, std::uint64_t result)\n                            {\n                                client_side.enter();\n                                Si::throw_if_error(ec);\n                                if (result != (34u * 45u))\n                                {\n                                    boost::throw_exception(std::logic_error(\"wrong result\"));\n                                }\n                            });\n            warpcoil::checkpoint server_side;\n            server.serve_one_request([&server_side](boost::system::error_code ec)\n                                     {\n                                         server_side.enter();\n                                         Si::throw_if_error(ec);\n                                     });\n            server_side.enable();\n            client_side.enable();\n            io.reset();\n            io.run();\n        }\n\n        std::uint64_t const total_transferred = client_to_server.read + client_to_server.written;\n        if (total_transferred > (std::numeric_limits<std::size_t>::max)())\n        {\n            boost::throw_exception(std::logic_error(\"Transferred bytes overflowed\"));\n        }\n        state.SetBytesProcessed(static_cast<size_t>(total_transferred));\n    }\n    BENCHMARK(RequestAndResponseOverInProcessPipe);\n}\n<commit_msg>prepare benchmark of different messages sizes<commit_after>#include <benchmark\/benchmark.h>\n#include \"generated.hpp\"\n#include <silicium\/error_or.hpp>\n#include <test\/checkpoint.hpp>\n#include <boost\/asio\/io_service.hpp>\n#include <queue>\n\nnamespace\n{\n    struct in_process_pipe\n    {\n        boost::asio::io_service &dispatcher;\n        boost::asio::const_buffer writing;\n        boost::asio::mutable_buffer reading;\n        std::function<void(boost::system::error_code, std::size_t)> write_callback;\n        std::function<void(boost::system::error_code, std::size_t)> read_callback;\n\n        explicit in_process_pipe(boost::asio::io_service &dispatcher)\n            : dispatcher(dispatcher)\n        {\n        }\n\n        template <class ConstBufferSequence, class CompletionToken>\n        auto async_write_some(ConstBufferSequence const &buffers, CompletionToken &&token)\n        {\n            assert(!write_callback);\n            assert(!boost::empty(buffers));\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(boost::system::error_code, std::size_t)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            using boost::begin;\n            writing = *begin(buffers);\n            write_callback = std::move(handler);\n            pump();\n            return result.get();\n        }\n\n        template <class MutableBufferSequence, class CompletionToken>\n        auto async_read_some(MutableBufferSequence const &buffers, CompletionToken &&token)\n        {\n            assert(!read_callback);\n            assert(!boost::empty(buffers));\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(boost::system::error_code, std::size_t)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            using boost::begin;\n            reading = *begin(buffers);\n            read_callback = std::move(handler);\n            pump();\n            return result.get();\n        }\n\n    private:\n        void pump()\n        {\n            if (write_callback && read_callback)\n            {\n                std::size_t const copied = boost::asio::buffer_copy(reading, writing);\n                dispatcher.post([\n                    write_callback = Si::exchange(write_callback, nullptr),\n                    read_callback = Si::exchange(read_callback, nullptr),\n                    copied\n                ]()\n                                {\n                                    write_callback({}, copied);\n                                    read_callback({}, copied);\n                                });\n            }\n        }\n    };\n\n    template <class AsyncStream>\n    struct byte_counter\n    {\n        AsyncStream underlying;\n        std::uint64_t written = 0;\n        std::uint64_t read = 0;\n\n        template <class... Args>\n        explicit byte_counter(Args &&... args)\n            : underlying(std::forward<Args>(args)...)\n        {\n        }\n\n        template <class ConstBufferSequence, class CompletionToken>\n        auto async_write_some(ConstBufferSequence const &buffers, CompletionToken &&token)\n        {\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(boost::system::error_code, std::size_t)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            underlying.async_write_some(buffers, warpcoil::cpp::wrap_handler(\n                                                     [this](boost::system::error_code ec, std::size_t bytes_transferred,\n                                                            decltype(handler) &handler)\n                                                     {\n                                                         written += bytes_transferred;\n                                                         handler(ec, bytes_transferred);\n                                                     },\n                                                     std::move(handler)));\n            return result.get();\n        }\n\n        template <class MutableBufferSequence, class CompletionToken>\n        auto async_read_some(MutableBufferSequence const &buffers, CompletionToken &&token)\n        {\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(boost::system::error_code, std::size_t)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            underlying.async_read_some(buffers, warpcoil::cpp::wrap_handler(\n                                                    [this](boost::system::error_code ec, std::size_t bytes_transferred,\n                                                           decltype(handler) &handler)\n                                                    {\n                                                        read += bytes_transferred;\n                                                        handler(ec, bytes_transferred);\n                                                    },\n                                                    std::move(handler)));\n            return result.get();\n        }\n    };\n\n    struct my_hello_service : async_binary_integer_function\n    {\n        void evaluate(std::tuple<std::uint64_t, std::uint64_t> argument,\n                      std::function<void(boost::system::error_code, std::uint64_t)> on_result) override\n        {\n            on_result({}, std::get<0>(argument) * std::get<1>(argument));\n        }\n    };\n\n    template <class LoopBody>\n    void BenchmarkWithInProcessPipe(benchmark::State &state, LoopBody const &body)\n    {\n        boost::asio::io_service io;\n        byte_counter<in_process_pipe> client_to_server(io);\n        byte_counter<in_process_pipe> server_to_client(io);\n        my_hello_service server_impl;\n        warpcoil::cpp::message_splitter<decltype(client_to_server)> server_splitter(client_to_server);\n        warpcoil::cpp::buffered_writer<decltype(server_to_client)> server_writer(server_to_client);\n        async_binary_integer_function_server<decltype(server_impl), decltype(client_to_server),\n                                             decltype(server_to_client)> server(server_impl, server_splitter,\n                                                                                server_writer);\n\n        warpcoil::cpp::message_splitter<decltype(server_to_client)> client_splitter(server_to_client);\n        warpcoil::cpp::buffered_writer<decltype(client_to_server)> client_writer(client_to_server);\n        async_binary_integer_function_client<decltype(server_to_client), decltype(client_to_server)> client(\n            client_writer, client_splitter);\n\n        while (state.KeepRunning())\n        {\n            body(io, client, server);\n        }\n\n        std::uint64_t const total_transferred = client_to_server.read + client_to_server.written;\n        if (total_transferred > (std::numeric_limits<std::size_t>::max)())\n        {\n            boost::throw_exception(std::logic_error(\"Transferred bytes overflowed\"));\n        }\n        state.SetBytesProcessed(static_cast<size_t>(total_transferred));\n    }\n\n    void TinyRequestAndResponseOverInProcessPipe(benchmark::State &state)\n    {\n        BenchmarkWithInProcessPipe(state, [](boost::asio::io_service &io, auto &client, auto &server)\n                                   {\n                                       warpcoil::checkpoint client_side;\n                                       client.evaluate(\n                                           std::make_tuple(34, 45),\n                                           [&client_side](boost::system::error_code ec, std::uint64_t result)\n                                           {\n                                               client_side.enter();\n                                               Si::throw_if_error(ec);\n                                               if (result != (34u * 45u))\n                                               {\n                                                   boost::throw_exception(std::logic_error(\"wrong result\"));\n                                               }\n                                           });\n                                       warpcoil::checkpoint server_side;\n                                       server.serve_one_request([&server_side](boost::system::error_code ec)\n                                                                {\n                                                                    server_side.enter();\n                                                                    Si::throw_if_error(ec);\n                                                                });\n                                       server_side.enable();\n                                       client_side.enable();\n                                       io.reset();\n                                       io.run();\n                                   });\n    }\n    BENCHMARK(TinyRequestAndResponseOverInProcessPipe);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"DraggableView.h\"\r\n\r\n#include \"cinder\/app\/App.h\"\r\n#include \"poScene\/ShapeView.h\"\r\n\r\nnamespace po\r\n{\r\n\tnamespace scene\r\n\t{\r\n\t\t\/\/ Drag And Drop View\r\n\t\tDraggableViewRef DraggableView::create()\r\n\t\t{\r\n\t\t\tDraggableViewRef ref( new DraggableView() );\r\n\t\t\tref->setup();\r\n\t\t\treturn ref;\r\n\t\t}\r\n\r\n\t\tDraggableViewRef DraggableView::create( ci::vec2 snapBackPosition )\r\n\t\t{\r\n\t\t\tDraggableViewRef ref( new DraggableView( snapBackPosition ) );\r\n\t\t\tref->setup();\r\n\t\t\treturn ref;\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::startHoverTimer( float seconds )\r\n\t\t{\r\n\t\t\tif( !mIsUsingTimer ) {\r\n\t\t\t\tmPreviousTime = ci::app::getElapsedSeconds();\r\n\t\t\t\tmIsUsingTimer = true;\r\n\t\t\t}\r\n\r\n\t\t\tmTimerDuration = seconds;\r\n\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::stopHoverTimer()\r\n\t\t{\r\n\t\t\tif( mIsUsingTimer ) {\r\n\t\t\t\tmIsUsingTimer = false;\r\n\t\t\t}\r\n\r\n\t\t\tmHoverLastedTime = 0.f;\r\n\t\t}\r\n\r\n\t\tDraggableView::DraggableView()\r\n\t\t\t: mIsDragging( false )\r\n\t\t\t, mDraggingEventId( DraggableView::DRAGGING_EVENT_ID_NONE )\r\n\t\t\t, mSnapsBack( false )\r\n\t\t\t, mIsUsingTimer( false )\r\n\t\t{\r\n\t\t}\r\n\r\n\t\tDraggableView::DraggableView( ci::vec2 snapBackPosition )\r\n\t\t\t: mIsDragging( false )\r\n\t\t\t, mDraggingEventId( DraggableView::DRAGGING_EVENT_ID_NONE )\r\n\t\t\t, mSnapsBack( true )\r\n\t\t\t, mSnapPosition( snapBackPosition )\r\n\t\t{\r\n\t\t\tsetPosition( snapBackPosition );\r\n\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::setup()\r\n\t\t{\r\n\t\t\tconnectEvents();\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::update()\r\n\t\t{\r\n\t\t\tpo::scene::View::update();\r\n\r\n\t\t\tif( !mIsUsingTimer ) {\r\n\t\t\t\tmPreviousTime = ci::app::getElapsedSeconds();\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tmHoverLastedTime = ci::app::getElapsedSeconds() - mPreviousTime;\r\n\t\t\t}\r\n\r\n\t\t\tif( mHoverLastedTime > 1.f ) {\r\n\t\t\t\tstopHoverTimer();\r\n\t\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\t\tmSignalDragHoverTimersUp.emit( ref );\r\n\t\t\t\tmIsDragging = false;\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ci::app::console() << mHoverLastedTime << std::endl;\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::setSnapBackPosition( ci::vec2 snapBackPosition )\r\n\t\t{\r\n\t\t\tmSnapPosition = snapBackPosition;\r\n\t\t\tmSnapsBack = true;\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::connectEvents()\r\n\t\t{\r\n\t\t\t\/\/ Attach drag events\r\n\t\t\tmConnections += getSignal( po::scene::MouseEvent::DOWN_INSIDE ).connect( std::bind( &DraggableView::mouseEventHandler, this, std::placeholders::_1 ) );\r\n\t\t\tmConnections += getSignal( po::scene::MouseEvent::DRAG ).connect( std::bind( &DraggableView::mouseEventHandler, this, std::placeholders::_1 ) );\r\n\t\t\tmConnections += getSignal( po::scene::MouseEvent::UP ).connect( std::bind( &DraggableView::mouseEventHandler, this, std::placeholders::_1 ) );\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::setInteractionEnabled( bool enabled )\r\n\t\t{\r\n\t\t\tbool isEnabled = isInteractionEnabled();\r\n\r\n\t\t\tif( isEnabled == enabled ) {\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tpo::scene::View::setInteractionEnabled( enabled );\r\n\r\n\t\t\tif( !enabled ) {\r\n\t\t\t\tbool isDragging = mIsDragging;\r\n\t\t\t\tmIsDragging = false;\r\n\r\n\t\t\t\tif( isDragging ) {\r\n\t\t\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\t\t\tmSignalDragCancelled.emit( ref );\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::handleDragStartEvent( ci::vec2 localPos, ci::vec2 windowPos, int eventId )\r\n\t\t{\r\n\t\t\tci::vec2 parentPos = getSuperview()->windowToLocal( windowPos );\r\n\r\n\t\t\tmPrevDragPosition = parentPos;\r\n\t\t\tmWindowDragPosition = windowPos;\r\n\t\t\tmDraggingEventId = eventId;\r\n\r\n\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\tmSignalDragBegan.emit( ref );\r\n\r\n\t\t\tmIsDragging = true;\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::handleDragEvent( ci::vec2 localPos, ci::vec2 windowPos, int eventId )\r\n\t\t{\r\n\t\t\tif( mIsDragging && mDraggingEventId == eventId ) {\r\n\t\t\t\tci::vec2 parentPos = getSuperview()->windowToLocal( windowPos );\r\n\r\n\t\t\t\tsetPosition( getPosition() + ( parentPos - mPrevDragPosition ) );\r\n\t\t\t\tmPrevDragPosition = parentPos;\r\n\t\t\t\tmWindowDragPosition = windowPos;\r\n\r\n\t\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\t\tmSignalDragged.emit( ref );\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::handleDragEndEvent( ci::vec2 localPos, ci::vec2 windowPos, int eventId )\r\n\t\t{\r\n\t\t\tif( mIsDragging ) {\r\n\t\t\t\tmIsDragging = false;\r\n\t\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\t\tmSignalDragEnded.emit( ref );\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::mouseEventHandler( po::scene::MouseEvent& event )\r\n\t\t{\r\n\t\t\tswitch( event.getType() ) {\r\n\t\t\t\t\/\/ Start Dragging\r\n\t\t\t\tcase po::scene::MouseEvent::DOWN_INSIDE:\r\n\t\t\t\t\thandleDragStartEvent( event.getLocalPos(), event.getWindowPos(), 0 );\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\/\/ Move if we are dragging\r\n\t\t\t\tcase po::scene::MouseEvent::DRAG:\r\n\t\t\t\t\thandleDragEvent( event.getLocalPos(), event.getWindowPos(), 0 );\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\/\/ Stop any dragging\r\n\t\t\t\tcase po::scene::MouseEvent::UP:\r\n\t\t\t\t\thandleDragEndEvent( event.getLocalPos(), event.getWindowPos(), 0 );\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::touchEventHandler( po::scene::TouchEvent& event )\r\n\t\t{\r\n\t\t\tswitch( event.getType() ) {\r\n\t\t\t\t\/\/ Start Dragging\r\n\t\t\t\tcase po::scene::TouchEvent::BEGAN_INSIDE:\r\n\t\t\t\t\thandleDragStartEvent( event.getLocalPos(), event.getWindowPos(), event.getId() );\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\/\/ Move if we are dragging\r\n\t\t\t\tcase po::scene::TouchEvent::MOVED:\r\n\t\t\t\t\thandleDragEvent( event.getLocalPos(), event.getWindowPos(), event.getId() );\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\/\/ Stop any dragging\r\n\t\t\t\tcase po::scene::TouchEvent::ENDED:\r\n\t\t\t\t\thandleDragEndEvent( event.getLocalPos(), event.getWindowPos(), event.getId() );\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n<commit_msg>fixed hover drag not ending bug<commit_after>#include \"DraggableView.h\"\r\n\r\n#include \"cinder\/app\/App.h\"\r\n#include \"poScene\/ShapeView.h\"\r\n\r\nnamespace po\r\n{\r\n\tnamespace scene\r\n\t{\r\n\t\t\/\/ Drag And Drop View\r\n\t\tDraggableViewRef DraggableView::create()\r\n\t\t{\r\n\t\t\tDraggableViewRef ref( new DraggableView() );\r\n\t\t\tref->setup();\r\n\t\t\treturn ref;\r\n\t\t}\r\n\r\n\t\tDraggableViewRef DraggableView::create( ci::vec2 snapBackPosition )\r\n\t\t{\r\n\t\t\tDraggableViewRef ref( new DraggableView( snapBackPosition ) );\r\n\t\t\tref->setup();\r\n\t\t\treturn ref;\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::startHoverTimer( float seconds )\r\n\t\t{\r\n\t\t\tif( !mIsUsingTimer ) {\r\n\t\t\t\tmPreviousTime = ci::app::getElapsedSeconds();\r\n\t\t\t\tmIsUsingTimer = true;\r\n\t\t\t}\r\n\r\n\t\t\tmTimerDuration = seconds;\r\n\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::stopHoverTimer()\r\n\t\t{\r\n\t\t\tif( mIsUsingTimer ) {\r\n\t\t\t\tmIsUsingTimer = false;\r\n\t\t\t}\r\n\r\n\t\t\tmHoverLastedTime = 0.f;\r\n\t\t}\r\n\r\n\t\tDraggableView::DraggableView()\r\n\t\t\t: mIsDragging( false )\r\n\t\t\t, mDraggingEventId( DraggableView::DRAGGING_EVENT_ID_NONE )\r\n\t\t\t, mSnapsBack( false )\r\n\t\t\t, mIsUsingTimer( false )\r\n\t\t{\r\n\t\t}\r\n\r\n\t\tDraggableView::DraggableView( ci::vec2 snapBackPosition )\r\n\t\t\t: mIsDragging( false )\r\n\t\t\t, mDraggingEventId( DraggableView::DRAGGING_EVENT_ID_NONE )\r\n\t\t\t, mSnapsBack( true )\r\n\t\t\t, mSnapPosition( snapBackPosition )\r\n\t\t{\r\n\t\t\tsetPosition( snapBackPosition );\r\n\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::setup()\r\n\t\t{\r\n\t\t\tconnectEvents();\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::update()\r\n\t\t{\r\n\t\t\tpo::scene::View::update();\r\n\r\n\t\t\tif( !mIsUsingTimer ) {\r\n\t\t\t\tmPreviousTime = ci::app::getElapsedSeconds();\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tmHoverLastedTime = ci::app::getElapsedSeconds() - mPreviousTime;\r\n\t\t\t}\r\n\r\n\t\t\tif( mHoverLastedTime > 1.f ) {\r\n\t\t\t\tstopHoverTimer();\r\n\t\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\t\tmSignalDragHoverTimersUp.emit( ref );\r\n\t\t\t\tmSignalDragEnded.emit( ref );\r\n\t\t\t\tmIsDragging = false;\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ci::app::console() << mHoverLastedTime << std::endl;\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::setSnapBackPosition( ci::vec2 snapBackPosition )\r\n\t\t{\r\n\t\t\tmSnapPosition = snapBackPosition;\r\n\t\t\tmSnapsBack = true;\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::connectEvents()\r\n\t\t{\r\n\t\t\t\/\/ Attach drag events\r\n\t\t\tmConnections += getSignal( po::scene::MouseEvent::DOWN_INSIDE ).connect( std::bind( &DraggableView::mouseEventHandler, this, std::placeholders::_1 ) );\r\n\t\t\tmConnections += getSignal( po::scene::MouseEvent::DRAG ).connect( std::bind( &DraggableView::mouseEventHandler, this, std::placeholders::_1 ) );\r\n\t\t\tmConnections += getSignal( po::scene::MouseEvent::UP ).connect( std::bind( &DraggableView::mouseEventHandler, this, std::placeholders::_1 ) );\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::setInteractionEnabled( bool enabled )\r\n\t\t{\r\n\t\t\tbool isEnabled = isInteractionEnabled();\r\n\r\n\t\t\tif( isEnabled == enabled ) {\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tpo::scene::View::setInteractionEnabled( enabled );\r\n\r\n\t\t\tif( !enabled ) {\r\n\t\t\t\tbool isDragging = mIsDragging;\r\n\t\t\t\tmIsDragging = false;\r\n\r\n\t\t\t\tif( isDragging ) {\r\n\t\t\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\t\t\tmSignalDragCancelled.emit( ref );\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::handleDragStartEvent( ci::vec2 localPos, ci::vec2 windowPos, int eventId )\r\n\t\t{\r\n\t\t\tci::vec2 parentPos = getSuperview()->windowToLocal( windowPos );\r\n\r\n\t\t\tmPrevDragPosition = parentPos;\r\n\t\t\tmWindowDragPosition = windowPos;\r\n\t\t\tmDraggingEventId = eventId;\r\n\r\n\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\tmSignalDragBegan.emit( ref );\r\n\r\n\t\t\tmIsDragging = true;\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::handleDragEvent( ci::vec2 localPos, ci::vec2 windowPos, int eventId )\r\n\t\t{\r\n\t\t\tif( mIsDragging && mDraggingEventId == eventId ) {\r\n\t\t\t\tci::vec2 parentPos = getSuperview()->windowToLocal( windowPos );\r\n\r\n\t\t\t\tsetPosition( getPosition() + ( parentPos - mPrevDragPosition ) );\r\n\t\t\t\tmPrevDragPosition = parentPos;\r\n\t\t\t\tmWindowDragPosition = windowPos;\r\n\r\n\t\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\t\tmSignalDragged.emit( ref );\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::handleDragEndEvent( ci::vec2 localPos, ci::vec2 windowPos, int eventId )\r\n\t\t{\r\n\t\t\tif( mIsDragging ) {\r\n\t\t\t\tmIsDragging = false;\r\n\t\t\t\tDraggableViewRef ref = std::static_pointer_cast<DraggableView>( shared_from_this() );\r\n\t\t\t\tmSignalDragEnded.emit( ref );\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::mouseEventHandler( po::scene::MouseEvent& event )\r\n\t\t{\r\n\t\t\tswitch( event.getType() ) {\r\n\t\t\t\t\/\/ Start Dragging\r\n\t\t\t\tcase po::scene::MouseEvent::DOWN_INSIDE:\r\n\t\t\t\t\thandleDragStartEvent( event.getLocalPos(), event.getWindowPos(), 0 );\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\/\/ Move if we are dragging\r\n\t\t\t\tcase po::scene::MouseEvent::DRAG:\r\n\t\t\t\t\thandleDragEvent( event.getLocalPos(), event.getWindowPos(), 0 );\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\/\/ Stop any dragging\r\n\t\t\t\tcase po::scene::MouseEvent::UP:\r\n\t\t\t\t\thandleDragEndEvent( event.getLocalPos(), event.getWindowPos(), 0 );\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvoid DraggableView::touchEventHandler( po::scene::TouchEvent& event )\r\n\t\t{\r\n\t\t\tswitch( event.getType() ) {\r\n\t\t\t\t\/\/ Start Dragging\r\n\t\t\t\tcase po::scene::TouchEvent::BEGAN_INSIDE:\r\n\t\t\t\t\thandleDragStartEvent( event.getLocalPos(), event.getWindowPos(), event.getId() );\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\/\/ Move if we are dragging\r\n\t\t\t\tcase po::scene::TouchEvent::MOVED:\r\n\t\t\t\t\thandleDragEvent( event.getLocalPos(), event.getWindowPos(), event.getId() );\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\/\/ Stop any dragging\r\n\t\t\t\tcase po::scene::TouchEvent::ENDED:\r\n\t\t\t\t\thandleDragEndEvent( event.getLocalPos(), event.getWindowPos(), event.getId() );\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * bridge.cpp\n *\n *  Created on: Jun 11, 2015\n *      Author: parallels\n *\/\n\nextern \"C\"{\n#include \"postgres.h\"\n\n#include \"access\/heapam.h\"\n#include \"utils\/rel.h\"\n#include \"utils\/ruleutils.h\"\n#include \"utils\/builtins.h\"\n#include \"utils\/lsyscache.h\"\n}\n\nclass Bridge {\n\n public:\n\n  \/**\n   * @brief Getting the relation name.\n   * @param relation id relation id\n   *\/\n  static char* GetRelationName(Oid relation_id) {\n      Relation relation;\n      char *relation_name;\n\n      relation = relation_open(relation_id, NoLock);\n\n      \/\/ Get name for given relation\n      relation_name = quote_qualified_identifier(get_namespace_name(RelationGetNamespace(relation)), RelationGetRelationName(relation));\n\n      relation_close(relation, NoLock);\n\n      return relation_name;\n   }\n\n};\n\n\n<commit_msg>Minor fix<commit_after>\/*\n * bridge.cpp\n *\n *  Created on: Jun 11, 2015\n *      Author: Jinwoong Kim\n *\/\n\nextern \"C\"{\n#include \"postgres.h\"\n\n#include \"access\/heapam.h\"\n#include \"utils\/rel.h\"\n#include \"utils\/ruleutils.h\"\n#include \"utils\/builtins.h\"\n#include \"utils\/lsyscache.h\"\n}\n\nclass Bridge {\n\n public:\n\n  \/**\n   * @brief Getting the relation name.\n   * @param relation id relation id\n   *\/\n  static char* GetRelationName(Oid relation_id) {\n      Relation relation;\n      char *relation_name;\n\n      relation = relation_open(relation_id, NoLock);\n\n      \/\/ Get name for given relation\n      relation_name = quote_qualified_identifier(get_namespace_name(RelationGetNamespace(relation)), RelationGetRelationName(relation));\n\n      relation_close(relation, NoLock);\n\n      return relation_name;\n   }\n\n};\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * bridge.cpp\n *\n *  Created on: Jun 11, 2015\n *      Author: parallels\n *\/\n\nextern \"C\"{\n#include \"postgres.h\"\n\n#include \"access\/heapam.h\"\n#include \"utils\/rel.h\"\n#include \"utils\/ruleutils.h\"\n#include \"utils\/builtins.h\"\n#include \"utils\/lsyscache.h\"\n}\n\nclass Bridge {\n\n public:\n\n  \/**\n   * @brief Getting the relation name.\n   * @param relation id relation id\n   *\/\n  static char* GetRelationName(Oid relation_id) {\n      Relation relation;\n      char *relation_name;\n\n      relation = relation_open(relation_id, NoLock);\n\n      \/\/ Get name for given relation\n      relation_name = quote_qualified_identifier(get_namespace_name(RelationGetNamespace(relation)), RelationGetRelationName(relation));\n\n      relation_close(relation, NoLock);\n\n      return relation_name;\n   }\n\n};\n\n\n<commit_msg>Minor fix<commit_after>\/*\n * bridge.cpp\n *\n *  Created on: Jun 11, 2015\n *      Author: Jinwoong Kim\n *\/\n\nextern \"C\"{\n#include \"postgres.h\"\n\n#include \"access\/heapam.h\"\n#include \"utils\/rel.h\"\n#include \"utils\/ruleutils.h\"\n#include \"utils\/builtins.h\"\n#include \"utils\/lsyscache.h\"\n}\n\nclass Bridge {\n\n public:\n\n  \/**\n   * @brief Getting the relation name.\n   * @param relation id relation id\n   *\/\n  static char* GetRelationName(Oid relation_id) {\n      Relation relation;\n      char *relation_name;\n\n      relation = relation_open(relation_id, NoLock);\n\n      \/\/ Get name for given relation\n      relation_name = quote_qualified_identifier(get_namespace_name(RelationGetNamespace(relation)), RelationGetRelationName(relation));\n\n      relation_close(relation, NoLock);\n\n      return relation_name;\n   }\n\n};\n\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <warpcoil\/cpp\/buffered_writer.hpp>\n#include <map>\n\nnamespace warpcoil\n{\n    namespace cpp\n    {\n        enum class client_pipeline_request_status\n        {\n            ok,\n            failure\n        };\n\n        template <class AsyncWriteStream, class AsyncReadStream>\n        struct client_pipeline\n        {\n            explicit client_pipeline(AsyncWriteStream &requests, AsyncReadStream &responses)\n                : writer(requests)\n                , responses(responses)\n                , response_buffer_used(0)\n                , state(response_state::not_expecting_response)\n            {\n            }\n\n            template <class ResultParser, class RequestBuilder, class ResultHandler>\n            void request(RequestBuilder build_request, ResultHandler &handler)\n            {\n                if (!writer.is_running())\n                {\n                    writer.async_run([this](boost::system::error_code ec)\n                                     {\n                                         on_error(ec);\n                                     });\n                }\n                auto sink = Si::Sink<std::uint8_t>::erase(writer.buffer_sink());\n                request_id const current_id = next_request_id;\n                ++next_request_id;\n                write_integer(sink, current_id);\n                switch (build_request(sink))\n                {\n                case client_pipeline_request_status::ok:\n                    break;\n\n                case client_pipeline_request_status::failure:\n                    return;\n                }\n                writer.send_buffer();\n                expected_responses.insert(std::make_pair(\n                    current_id,\n                    expected_response{[handler](boost::system::error_code const error) mutable\n                                      {\n                                          handler(error, typename ResultParser::result_type{});\n                                      },\n                                      [this, handler]() mutable\n                                      {\n                                          assert(state == response_state::parsing_result);\n                                          begin_parse_value(\n                                              responses, boost::asio::buffer(response_buffer), response_buffer_used,\n                                              ResultParser(),\n                                              parse_result_operation<ResultHandler, typename ResultParser::result_type>(\n                                                  *this, std::move(handler)));\n                                      }}));\n                switch (state)\n                {\n                case response_state::not_expecting_response:\n                    parse_header(handler);\n                    break;\n\n                case response_state::parsing_header:\n                case response_state::parsing_result:\n                    break;\n                }\n            }\n\n        private:\n            enum response_state\n            {\n                not_expecting_response,\n                parsing_header,\n                parsing_result\n            };\n\n            struct expected_response\n            {\n                std::function<void(boost::system::error_code)> on_error;\n                std::function<void()> parse_result;\n            };\n\n            buffered_writer<AsyncWriteStream> writer;\n            std::array<std::uint8_t, 512> response_buffer;\n            AsyncReadStream &responses;\n            std::size_t response_buffer_used;\n            request_id next_request_id = 0;\n            response_state state;\n            std::map<request_id, expected_response> expected_responses;\n\n            template <class DummyHandler>\n            void parse_header(DummyHandler &handler)\n            {\n                begin_parse_value(responses, boost::asio::buffer(response_buffer), response_buffer_used,\n                                  integer_parser<request_id>(), parse_header_operation<DummyHandler>(*this, handler));\n                state = response_state::parsing_header;\n            }\n\n            void on_error(boost::system::error_code ec)\n            {\n                std::map<request_id, expected_response> local_expected_responses = std::move(expected_responses);\n                assert(expected_responses.empty());\n                state = response_state::not_expecting_response;\n                for (auto const &entry : local_expected_responses)\n                {\n                    entry.second.on_error(ec);\n                }\n            }\n\n            template <class DummyHandler>\n            struct parse_header_operation\n            {\n                client_pipeline &pipeline;\n                DummyHandler handler;\n\n                explicit parse_header_operation(client_pipeline &pipeline, DummyHandler handler)\n                    : pipeline(pipeline)\n                    , handler(std::move(handler))\n                {\n                }\n\n                void operator()(boost::system::error_code ec, request_id const id) const\n                {\n                    assert(pipeline.state == response_state::parsing_header);\n                    if (!!ec)\n                    {\n                        pipeline.on_error(ec);\n                        return;\n                    }\n                    auto const entry_found = pipeline.expected_responses.find(id);\n                    if (entry_found == pipeline.expected_responses.end())\n                    {\n                        pipeline.state = response_state::not_expecting_response;\n                        throw std::logic_error(\"TODO handle protocol violation\");\n                    }\n                    std::function<void()> parse_result = std::move(entry_found->second.parse_result);\n                    pipeline.expected_responses.erase(entry_found);\n                    pipeline.state = response_state::parsing_result;\n                    parse_result();\n                }\n\n                template <class Function>\n                friend void asio_handler_invoke(Function &&f, parse_header_operation *operation)\n                {\n                    using boost::asio::asio_handler_invoke;\n                    asio_handler_invoke(f, &operation->handler);\n                }\n            };\n\n            template <class ResultHandler, class Result>\n            struct parse_result_operation\n            {\n                client_pipeline &pipeline;\n                ResultHandler handler;\n\n                explicit parse_result_operation(client_pipeline &pipeline, ResultHandler handler)\n                    : pipeline(pipeline)\n                    , handler(std::move(handler))\n                {\n                }\n\n                void operator()(boost::system::error_code ec, Result result)\n                {\n                    assert(pipeline.state == response_state::parsing_result);\n                    if (!!ec)\n                    {\n                        pipeline.on_error(ec);\n                        return;\n                    }\n                    if (pipeline.expected_responses.empty())\n                    {\n                        pipeline.state = response_state::not_expecting_response;\n                    }\n                    else\n                    {\n                        pipeline.parse_header(handler);\n                        assert(pipeline.state == response_state::parsing_header);\n                    }\n                    handler(ec, std::move(result));\n                }\n\n                template <class Function>\n                friend void asio_handler_invoke(Function &&f, parse_result_operation *operation)\n                {\n                    using boost::asio::asio_handler_invoke;\n                    asio_handler_invoke(f, &operation->handler);\n                }\n            };\n        };\n    }\n}\n<commit_msg>try to support immediate completion of begin_parse_value in client_pipeline<commit_after>#pragma once\n\n#include <warpcoil\/cpp\/buffered_writer.hpp>\n#include <map>\n\nnamespace warpcoil\n{\n    namespace cpp\n    {\n        enum class client_pipeline_request_status\n        {\n            ok,\n            failure\n        };\n\n        template <class AsyncWriteStream, class AsyncReadStream>\n        struct client_pipeline\n        {\n            explicit client_pipeline(AsyncWriteStream &requests, AsyncReadStream &responses)\n                : writer(requests)\n                , responses(responses)\n                , response_buffer_used(0)\n                , state(response_state::not_expecting_response)\n            {\n            }\n\n            template <class ResultParser, class RequestBuilder, class ResultHandler>\n            void request(RequestBuilder build_request, ResultHandler &handler)\n            {\n                if (!writer.is_running())\n                {\n                    writer.async_run([this](boost::system::error_code ec)\n                                     {\n                                         on_error(ec);\n                                     });\n                }\n                auto sink = Si::Sink<std::uint8_t>::erase(writer.buffer_sink());\n                request_id const current_id = next_request_id;\n                ++next_request_id;\n                write_integer(sink, current_id);\n                switch (build_request(sink))\n                {\n                case client_pipeline_request_status::ok:\n                    break;\n\n                case client_pipeline_request_status::failure:\n                    return;\n                }\n                writer.send_buffer();\n                expected_responses.insert(std::make_pair(\n                    current_id,\n                    expected_response{[handler](boost::system::error_code const error) mutable\n                                      {\n                                          handler(error, typename ResultParser::result_type{});\n                                      },\n                                      [this, handler]() mutable\n                                      {\n                                          assert(state == response_state::parsing_result);\n                                          begin_parse_value(\n                                              responses, boost::asio::buffer(response_buffer), response_buffer_used,\n                                              ResultParser(),\n                                              parse_result_operation<ResultHandler, typename ResultParser::result_type>(\n                                                  *this, std::move(handler)));\n                                      }}));\n                switch (state)\n                {\n                case response_state::not_expecting_response:\n                    parse_header(handler);\n                    break;\n\n                case response_state::parsing_header:\n                case response_state::parsing_result:\n                    break;\n                }\n            }\n\n        private:\n            enum response_state\n            {\n                not_expecting_response,\n                parsing_header,\n                parsing_result\n            };\n\n            struct expected_response\n            {\n                std::function<void(boost::system::error_code)> on_error;\n                std::function<void()> parse_result;\n            };\n\n            buffered_writer<AsyncWriteStream> writer;\n            std::array<std::uint8_t, 512> response_buffer;\n            AsyncReadStream &responses;\n            std::size_t response_buffer_used;\n            request_id next_request_id = 0;\n            response_state state;\n            std::map<request_id, expected_response> expected_responses;\n\n            template <class DummyHandler>\n            void parse_header(DummyHandler &handler)\n            {\n                state = response_state::parsing_header;\n                begin_parse_value(responses, boost::asio::buffer(response_buffer), response_buffer_used,\n                                  integer_parser<request_id>(), parse_header_operation<DummyHandler>(*this, handler));\n            }\n\n            void on_error(boost::system::error_code ec)\n            {\n                std::map<request_id, expected_response> local_expected_responses = std::move(expected_responses);\n                assert(expected_responses.empty());\n                state = response_state::not_expecting_response;\n                for (auto const &entry : local_expected_responses)\n                {\n                    entry.second.on_error(ec);\n                }\n            }\n\n            template <class DummyHandler>\n            struct parse_header_operation\n            {\n                client_pipeline &pipeline;\n                DummyHandler handler;\n\n                explicit parse_header_operation(client_pipeline &pipeline, DummyHandler handler)\n                    : pipeline(pipeline)\n                    , handler(std::move(handler))\n                {\n                }\n\n                void operator()(boost::system::error_code ec, request_id const id) const\n                {\n                    assert(pipeline.state == response_state::parsing_header);\n                    if (!!ec)\n                    {\n                        pipeline.on_error(ec);\n                        return;\n                    }\n                    auto const entry_found = pipeline.expected_responses.find(id);\n                    if (entry_found == pipeline.expected_responses.end())\n                    {\n                        pipeline.state = response_state::not_expecting_response;\n                        throw std::logic_error(\"TODO handle protocol violation\");\n                    }\n                    std::function<void()> parse_result = std::move(entry_found->second.parse_result);\n                    pipeline.expected_responses.erase(entry_found);\n                    pipeline.state = response_state::parsing_result;\n                    parse_result();\n                }\n\n                template <class Function>\n                friend void asio_handler_invoke(Function &&f, parse_header_operation *operation)\n                {\n                    using boost::asio::asio_handler_invoke;\n                    asio_handler_invoke(f, &operation->handler);\n                }\n            };\n\n            template <class ResultHandler, class Result>\n            struct parse_result_operation\n            {\n                client_pipeline &pipeline;\n                ResultHandler handler;\n\n                explicit parse_result_operation(client_pipeline &pipeline, ResultHandler handler)\n                    : pipeline(pipeline)\n                    , handler(std::move(handler))\n                {\n                }\n\n                void operator()(boost::system::error_code ec, Result result)\n                {\n                    assert(pipeline.state == response_state::parsing_result);\n                    if (!!ec)\n                    {\n                        pipeline.on_error(ec);\n                        return;\n                    }\n                    if (pipeline.expected_responses.empty())\n                    {\n                        pipeline.state = response_state::not_expecting_response;\n                    }\n                    else\n                    {\n                        pipeline.parse_header(handler);\n                        assert(pipeline.state == response_state::parsing_header);\n                    }\n                    handler(ec, std::move(result));\n                }\n\n                template <class Function>\n                friend void asio_handler_invoke(Function &&f, parse_result_operation *operation)\n                {\n                    using boost::asio::asio_handler_invoke;\n                    asio_handler_invoke(f, &operation->handler);\n                }\n            };\n        };\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* TLS v1.0 and v1.2 PRFs\n* (C) 2004-2010 Jack Lloyd\n*\n* Distributed under the terms of the Botan license\n*\/\n\n#include <botan\/prf_tls.h>\n#include <botan\/internal\/xor_buf.h>\n#include <botan\/hmac.h>\n#include <botan\/md5.h>\n#include <botan\/sha160.h>\n\nnamespace Botan {\n\nnamespace {\n\n\/*\n* TLS PRF P_hash function\n*\/\nvoid P_hash(MemoryRegion<byte>& output,\n            MessageAuthenticationCode* mac,\n            const byte secret[], size_t secret_len,\n            const byte seed[], size_t seed_len)\n   {\n   try\n      {\n      mac->set_key(secret, secret_len);\n      }\n   catch(Invalid_Key_Length)\n      {\n      throw Internal_Error(\"The premaster secret is too long for the PRF\");\n      }\n\n   SecureVector<byte> A(seed, seed_len);\n\n   size_t offset = 0;\n\n   while(offset != output.size())\n      {\n      const size_t this_block_len =\n         std::min<size_t>(mac->output_length(), output.size() - offset);\n\n      A = mac->process(A);\n\n      mac->update(A);\n      mac->update(seed, seed_len);\n      SecureVector<byte> block = mac->final();\n\n      xor_buf(&output[offset], &block[0], this_block_len);\n      offset += this_block_len;\n      }\n   }\n\n}\n\n\/*\n* TLS PRF Constructor and Destructor\n*\/\nTLS_PRF::TLS_PRF()\n   {\n   hmac_md5 = new HMAC(new MD5);\n   hmac_sha1 = new HMAC(new SHA_160);\n   }\n\nTLS_PRF::~TLS_PRF()\n   {\n   delete hmac_md5;\n   delete hmac_sha1;\n   }\n\n\/*\n* TLS PRF\n*\/\nSecureVector<byte> TLS_PRF::derive(size_t key_len,\n                                   const byte secret[], size_t secret_len,\n                                   const byte seed[], size_t seed_len) const\n   {\n   SecureVector<byte> output(key_len);\n\n   size_t S1_len = (secret_len + 1) \/ 2,\n          S2_len = (secret_len + 1) \/ 2;\n   const byte* S1 = secret;\n   const byte* S2 = secret + (secret_len - S2_len);\n\n   P_hash(output, hmac_md5,  S1, S1_len, seed, seed_len);\n   P_hash(output, hmac_sha1, S2, S2_len, seed, seed_len);\n\n   return output;\n   }\n\n\/*\n* TLS v1.2 PRF Constructor and Destructor\n*\/\nTLS_12_PRF::TLS_12_PRF(MessageAuthenticationCode* mac) : hmac(mac)\n   {\n   }\n\nTLS_12_PRF::~TLS_12_PRF()\n   {\n   delete hmac;\n   }\n\nSecureVector<byte> TLS_12_PRF::derive(size_t key_len,\n                                      const byte secret[], size_t secret_len,\n                                      const byte seed[], size_t seed_len) const\n   {\n   SecureVector<byte> output(key_len);\n\n   P_hash(output, hmac, secret, secret_len, seed, seed_len);\n\n   return output;\n   }\n\n}\n<commit_msg>Report the length of the pre master secret. Who knows if when this happens it'll be reproductible, etc, might as well have the information immediately.<commit_after>\/*\n* TLS v1.0 and v1.2 PRFs\n* (C) 2004-2010 Jack Lloyd\n*\n* Distributed under the terms of the Botan license\n*\/\n\n#include <botan\/prf_tls.h>\n#include <botan\/internal\/xor_buf.h>\n#include <botan\/hmac.h>\n#include <botan\/md5.h>\n#include <botan\/sha160.h>\n\nnamespace Botan {\n\nnamespace {\n\n\/*\n* TLS PRF P_hash function\n*\/\nvoid P_hash(MemoryRegion<byte>& output,\n            MessageAuthenticationCode* mac,\n            const byte secret[], size_t secret_len,\n            const byte seed[], size_t seed_len)\n   {\n   try\n      {\n      mac->set_key(secret, secret_len);\n      }\n   catch(Invalid_Key_Length)\n      {\n      throw Internal_Error(\"The premaster secret of \" + to_string(secret_len) +\n                           \" bytes is too long for the PRF\");\n      }\n\n   SecureVector<byte> A(seed, seed_len);\n\n   size_t offset = 0;\n\n   while(offset != output.size())\n      {\n      const size_t this_block_len =\n         std::min<size_t>(mac->output_length(), output.size() - offset);\n\n      A = mac->process(A);\n\n      mac->update(A);\n      mac->update(seed, seed_len);\n      SecureVector<byte> block = mac->final();\n\n      xor_buf(&output[offset], &block[0], this_block_len);\n      offset += this_block_len;\n      }\n   }\n\n}\n\n\/*\n* TLS PRF Constructor and Destructor\n*\/\nTLS_PRF::TLS_PRF()\n   {\n   hmac_md5 = new HMAC(new MD5);\n   hmac_sha1 = new HMAC(new SHA_160);\n   }\n\nTLS_PRF::~TLS_PRF()\n   {\n   delete hmac_md5;\n   delete hmac_sha1;\n   }\n\n\/*\n* TLS PRF\n*\/\nSecureVector<byte> TLS_PRF::derive(size_t key_len,\n                                   const byte secret[], size_t secret_len,\n                                   const byte seed[], size_t seed_len) const\n   {\n   SecureVector<byte> output(key_len);\n\n   size_t S1_len = (secret_len + 1) \/ 2,\n          S2_len = (secret_len + 1) \/ 2;\n   const byte* S1 = secret;\n   const byte* S2 = secret + (secret_len - S2_len);\n\n   P_hash(output, hmac_md5,  S1, S1_len, seed, seed_len);\n   P_hash(output, hmac_sha1, S2, S2_len, seed, seed_len);\n\n   return output;\n   }\n\n\/*\n* TLS v1.2 PRF Constructor and Destructor\n*\/\nTLS_12_PRF::TLS_12_PRF(MessageAuthenticationCode* mac) : hmac(mac)\n   {\n   }\n\nTLS_12_PRF::~TLS_12_PRF()\n   {\n   delete hmac;\n   }\n\nSecureVector<byte> TLS_12_PRF::derive(size_t key_len,\n                                      const byte secret[], size_t secret_len,\n                                      const byte seed[], size_t seed_len) const\n   {\n   SecureVector<byte> output(key_len);\n\n   P_hash(output, hmac, secret, secret_len, seed, seed_len);\n\n   return output;\n   }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/----------------------------  sparse_matrix_01a.cc  ---------------------------\n\/\/    $Id$\n\/\/    Version: $Name$ \n\/\/\n\/\/    Copyright (C) 2004, 2005 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\/\/----------------------------  sparse_matrix_01a.cc  ---------------------------\n\n\n\/\/ check setting elements in a sparse matrix using SparseMatrix::set(). make\n\/\/ sure they are correct, and make sure that for the nonexisting entries\n\/\/ SparseMatrix::el() returns zero and operator() throws an exception\n\n#include \"..\/tests.h\"\n#include <lac\/sparse_matrix.h>    \n#include <fstream>\n#include <iomanip>\n\n\nvoid test ()\n{\n  SparsityPattern sp (5,5,3,false);\n  for (unsigned int i=0; i<5; ++i)\n    for (unsigned int j=0; j<5; ++j)\n      if ((i+2*j+1) % 3 == 0)\n        sp.add (i,j);\n  sp.compress ();\n\n  SparseMatrix<double> m(sp);\n  \n                                   \/\/ first set a few entries\n  for (unsigned int i=0; i<m.m(); ++i)\n    for (unsigned int j=0; j<m.n(); ++j)\n      if ((i+2*j+1) % 3 == 0)\n        m.set (i,j, i*j*.5+.5);\n\n                                   \/\/ then make sure we retrieve the same ones\n  for (unsigned int i=0; i<m.m(); ++i)\n    for (unsigned int j=0; j<m.n(); ++j)\n      if ((i+2*j+1) % 3 == 0)\n        {\n          Assert (m(i,j) == i*j*.5+.5, ExcInternalError());\n          Assert (m.el(i,j) == i*j*.5+.5, ExcInternalError());\n        }\n      else\n        {\n          Assert (m.el(i,j) == 0, ExcInternalError());\n          bool exc_thrown = false;\n          double d;\n          try\n            {\n              d = m(i,j);\n            }\n          catch (const std::exception &)\n            {\n              exc_thrown = true;\n            }\n          Assert (exc_thrown == true, ExcInternalError());\n        }\n\n  deallog << \"OK\" << std::endl;\n}\n\n\n\nint main ()\n{\n  std::ofstream logfile(\"sparse_matrix_01a\/output\");\n  deallog.attach(logfile);\n  deallog.depth_console(0);\n  deallog.threshold_double(1.e-10);\n\n  try\n    {\n      test ();\n    }\n  catch (std::exception &exc)\n    {\n      deallog << std::endl << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n      deallog << \"Exception on processing: \" << std::endl\n\t\t<< exc.what() << std::endl\n\t\t<< \"Aborting!\" << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n      \n      return 1;\n    }\n  catch (...) \n    {\n      deallog << std::endl << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n      deallog << \"Unknown exception!\" << std::endl\n\t\t<< \"Aborting!\" << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n      return 1;\n    };\n}\n<commit_msg>Fix one test. Explanation in the comment at the top.<commit_after>\/\/----------------------------  sparse_matrix_01a.cc  ---------------------------\n\/\/    $Id$\n\/\/    Version: $Name$ \n\/\/\n\/\/    Copyright (C) 2004, 2005, 2010 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\/\/----------------------------  sparse_matrix_01a.cc  ---------------------------\n\n\n\/\/ check setting elements in a sparse matrix using SparseMatrix::set(). make\n\/\/ sure they are correct, and make sure that for the nonexisting entries\n\/\/ SparseMatrix::el() returns zero (operator() terminates with an exception\n\/\/ since sometime in the first half of 2010).\n\n#include \"..\/tests.h\"\n#include <lac\/sparse_matrix.h>    \n#include <fstream>\n#include <iomanip>\n\n\nvoid test ()\n{\n  SparsityPattern sp (5,5,3,false);\n  for (unsigned int i=0; i<5; ++i)\n    for (unsigned int j=0; j<5; ++j)\n      if ((i+2*j+1) % 3 == 0)\n        sp.add (i,j);\n  sp.compress ();\n\n  SparseMatrix<double> m(sp);\n  \n                                   \/\/ first set a few entries\n  for (unsigned int i=0; i<m.m(); ++i)\n    for (unsigned int j=0; j<m.n(); ++j)\n      if ((i+2*j+1) % 3 == 0)\n        m.set (i,j, i*j*.5+.5);\n\n                                   \/\/ then make sure we retrieve the same ones\n  for (unsigned int i=0; i<m.m(); ++i)\n    for (unsigned int j=0; j<m.n(); ++j)\n      if ((i+2*j+1) % 3 == 0)\n        {\n          Assert (m(i,j) == i*j*.5+.5, ExcInternalError());\n          Assert (m.el(i,j) == i*j*.5+.5, ExcInternalError());\n        }\n      else\n        {\n          Assert (m.el(i,j) == 0, ExcInternalError());\n        }\n\n  deallog << \"OK\" << std::endl;\n}\n\n\n\nint main ()\n{\n  std::ofstream logfile(\"sparse_matrix_01a\/output\");\n  deallog.attach(logfile);\n  deallog.depth_console(0);\n  deallog.threshold_double(1.e-10);\n\n  try\n    {\n      test ();\n    }\n  catch (std::exception &exc)\n    {\n      deallog << std::endl << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n      deallog << \"Exception on processing: \" << std::endl\n\t\t<< exc.what() << std::endl\n\t\t<< \"Aborting!\" << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n      \n      return 1;\n    }\n  catch (...) \n    {\n      deallog << std::endl << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n      deallog << \"Unknown exception!\" << std::endl\n\t\t<< \"Aborting!\" << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n      return 1;\n    };\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) 2011 Gael Guennebaud <gael.guennebaud@inria.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#include \"common.h\"\n#include <Eigen\/Eigenvalues>\n\n\/\/ computes an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges\nEIGEN_LAPACK_FUNC(syev,(char *jobz, char *uplo, int* n, Scalar* a, int *lda, Scalar* w, Scalar* work, int* lwork, int *info))\n{\n  bool query_size = *lwork==-1;\n  \n  *info = 0;\n        if(*jobz!='N' && *jobz!='V')                    *info = -1;\n  else  if(UPLO(*uplo)==INVALID)                        *info = -2;\n  else  if(*n<0)                                        *info = -3;\n  else  if(*lda<std::max(1,*n))                         *info = -5;\n  else  if((!query_size) && *lwork<std::max(1,3**n-1))  *info = -8;\n  \n\/\/   if(*info==0)\n\/\/   {\n\/\/     int nb = ILAENV( 1, 'SSYTRD', UPLO, N, -1, -1, -1 )\n\/\/          LWKOPT = MAX( 1, ( NB+2 )*N )\n\/\/          WORK( 1 ) = LWKOPT\n\/\/ *\n\/\/          IF( LWORK.LT.MAX( 1, 3*N-1 ) .AND. .NOT.LQUERY )\n\/\/      $      INFO = -8\n\/\/       END IF\n\/\/ *\n\/\/       IF( INFO.NE.0 ) THEN\n\/\/          CALL XERBLA( 'SSYEV ', -INFO )\n\/\/          RETURN\n\/\/       ELSE IF( LQUERY ) THEN\n\/\/          RETURN\n\/\/       END IF\n  \n  if(*info!=0)\n  {\n    int e = -*info;\n    return xerbla_(SCALAR_SUFFIX_UP\"SYEV \", &e, 6);\n  }\n  \n  if(query_size)\n  {\n    *lwork = 0;\n    return 0;\n  }\n  \n  if(*n==0)\n    return 0;\n  \n  PlainMatrixType mat(*n,*n);\n  if(UPLO(*uplo)==UP) mat = matrix(a,*n,*n,*lda).adjoint();\n  else                mat = matrix(a,*n,*n,*lda);\n  \n  bool computeVectors = *jobz=='V' || *jobz=='v';\n  SelfAdjointEigenSolver<PlainMatrixType> eig(mat,computeVectors?ComputeEigenvectors:EigenvaluesOnly);\n  \n  if(eig.info()==NoConvergence)\n  {\n    vector(w,*n).setZero();\n    if(computeVectors)\n      matrix(a,*n,*n,*lda).setIdentity();\n    \/\/*info = 1;\n    return 0;\n  }\n  \n  vector(w,*n) = eig.eigenvalues();\n  if(computeVectors)\n    matrix(a,*n,*n,*lda) = eig.eigenvectors();\n  \n  return 0;\n}\n<commit_msg>suppress unused warning<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2011 Gael Guennebaud <gael.guennebaud@inria.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#include \"common.h\"\n#include <Eigen\/Eigenvalues>\n\n\/\/ computes an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges\nEIGEN_LAPACK_FUNC(syev,(char *jobz, char *uplo, int* n, Scalar* a, int *lda, Scalar* w, Scalar* \/*work*\/, int* lwork, int *info))\n{\n  \/\/ TODO exploit the work buffer\n  bool query_size = *lwork==-1;\n  \n  *info = 0;\n        if(*jobz!='N' && *jobz!='V')                    *info = -1;\n  else  if(UPLO(*uplo)==INVALID)                        *info = -2;\n  else  if(*n<0)                                        *info = -3;\n  else  if(*lda<std::max(1,*n))                         *info = -5;\n  else  if((!query_size) && *lwork<std::max(1,3**n-1))  *info = -8;\n  \n\/\/   if(*info==0)\n\/\/   {\n\/\/     int nb = ILAENV( 1, 'SSYTRD', UPLO, N, -1, -1, -1 )\n\/\/          LWKOPT = MAX( 1, ( NB+2 )*N )\n\/\/          WORK( 1 ) = LWKOPT\n\/\/ *\n\/\/          IF( LWORK.LT.MAX( 1, 3*N-1 ) .AND. .NOT.LQUERY )\n\/\/      $      INFO = -8\n\/\/       END IF\n\/\/ *\n\/\/       IF( INFO.NE.0 ) THEN\n\/\/          CALL XERBLA( 'SSYEV ', -INFO )\n\/\/          RETURN\n\/\/       ELSE IF( LQUERY ) THEN\n\/\/          RETURN\n\/\/       END IF\n  \n  if(*info!=0)\n  {\n    int e = -*info;\n    return xerbla_(SCALAR_SUFFIX_UP\"SYEV \", &e, 6);\n  }\n  \n  if(query_size)\n  {\n    *lwork = 0;\n    return 0;\n  }\n  \n  if(*n==0)\n    return 0;\n  \n  PlainMatrixType mat(*n,*n);\n  if(UPLO(*uplo)==UP) mat = matrix(a,*n,*n,*lda).adjoint();\n  else                mat = matrix(a,*n,*n,*lda);\n  \n  bool computeVectors = *jobz=='V' || *jobz=='v';\n  SelfAdjointEigenSolver<PlainMatrixType> eig(mat,computeVectors?ComputeEigenvectors:EigenvaluesOnly);\n  \n  if(eig.info()==NoConvergence)\n  {\n    vector(w,*n).setZero();\n    if(computeVectors)\n      matrix(a,*n,*n,*lda).setIdentity();\n    \/\/*info = 1;\n    return 0;\n  }\n  \n  vector(w,*n) = eig.eigenvalues();\n  if(computeVectors)\n    matrix(a,*n,*n,*lda) = eig.eigenvectors();\n  \n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ Copyright 2010-2012 University of Washington. All Rights Reserved.\n\/\/ LICENSE_PLACEHOLDER\n\/\/ This software was created with Government support under DE\n\/\/ AC05-76RL01830 awarded by the United States Department of\n\/\/ Energy. The Government has certain rights in the software.\n\n#include \"ParallelLoop.hpp\"\n\n#include <boost\/test\/unit_test.hpp>\n\n#include \"Grappa.hpp\"\n#include \"Message.hpp\"\n#include \"MessagePool.hpp\"\n#include \"CompletionEvent.hpp\"\n#include \"ConditionVariable.hpp\"\n#include \"Delegate.hpp\"\n#include \"Tasking.hpp\"\n#include \"GlobalAllocator.hpp\"\n\nBOOST_AUTO_TEST_SUITE( New_loop_tests );\n\nusing namespace Grappa;\nusing Grappa::wait;\n\nstatic bool touched = false;\n\nvoid test_on_all_cores() {\n  BOOST_MESSAGE(\"Testing on_all_cores...\");\n  \n  on_all_cores([] {\n    BOOST_MESSAGE(\"hello world from \" << mycore() << \"!\");\n    touched = true;\n  });\n  \n  BOOST_CHECK_EQUAL(delegate::read(make_global(&touched,1)), true);\n  BOOST_CHECK_EQUAL(touched, true);\n}\n\nvoid test_loop_decomposition() {\n  int N = 16;\n  \n  CompletionEvent ce(N);\n  \n  impl::loop_decomposition_private<2>(0, N, [&ce](int64_t start, int64_t iters) {\n    VLOG(1) << \"loop(\" << start << \", \" << iters << \")\";\n    ce.complete(iters);\n  });\n  ce.wait();\n}\n\nvoid test_loop_decomposition_global() {\n  int N = 16;\n  \n  CompletionEvent ce(N);\n  auto ce_addr = make_global(&ce);\n  \n  impl::loop_decomposition_public(0, N, [ce_addr](int64_t start, int64_t iters) {\n    VLOG(1) << \"loop(\" << start << \", \" << iters << \")\";\n    complete(ce_addr,iters);\n  });\n  ce.wait();\n}\n\nCompletionEvent my_ce;\n\nvoid test_forall_here() {\n  BOOST_MESSAGE(\"Testing forall_here...\");\n  const int N = 15;\n  \n  {\n    int x = 0;\n    forall_here(0, N, [&x](int64_t start, int64_t iters) {\n      CHECK(mycore() == 0);\n      for (int64_t i=0; i<iters; i++) {\n        x++;\n      }\n    });\n    BOOST_CHECK_EQUAL(x, N);\n  }\n  \n  {\n    int x = 0;\n    forall_here<&my_ce,2>(0, N, [&x](int64_t start, int64_t iters) {\n      CHECK(mycore() == 0);\n      for (int64_t i=0; i<iters; i++) {\n        x++;\n      }\n    });\n    BOOST_CHECK_EQUAL(x, N);\n  }\n  \n}\n\nstatic int test_global = 0;\nCompletionEvent test_global_ce;\n\nvoid test_forall_global() {\n  BOOST_MESSAGE(\"Testing forall_global...\");\n  const int64_t N = 1 << 8;\n  \n  forall_global_private(0, N, [](int64_t start, int64_t iters) {\n    for (int i=0; i<iters; i++) {\n      test_global++;\n    }\n  });\n  \n  on_all_cores([]{\n    BOOST_CHECK_EQUAL(test_global, N\/cores());\n    test_global = 0;\n  });\n  \n  forall_global_private<&test_global_ce>(0, N, [](int64_t start, int64_t iters) {\n    for (int i=0; i<iters; i++) {\n      test_global++;\n    }\n  });\n  \n}\n\n\nvoid test_forall_localized() {\n  BOOST_MESSAGE(\"Testing forall_localized...\");\n  const int64_t N = 1 << 8;\n  \n  auto array = Grappa_typed_malloc<int64_t>(N);\n  \n  forall_localized(array, N, [](int64_t i, int64_t& e){\n    e = 1;\n  });\n  \n  forall_here(0, N, [array](int64_t s, int64_t n) {\n    for (int i=s; i<s+n; i++) { BOOST_CHECK_EQUAL(delegate::read(array+i), 1); }\n  });\n}\n\nvoid user_main(void * args) {\n  CHECK(Grappa::cores() >= 2); \/\/ at least 2 nodes for these tests...\n\n  test_on_all_cores();\n  \n  test_loop_decomposition();\n  test_loop_decomposition_global();\n  \n  test_forall_here();\n  test_forall_global();\n  \n  test_forall_localized();\n}\n\nBOOST_AUTO_TEST_CASE( test1 ) {\n\n  Grappa_init( &(boost::unit_test::framework::master_test_suite().argc),\n\t       &(boost::unit_test::framework::master_test_suite().argv)\n\t       );\n\n  Grappa_activate();\n\n  Grappa_run_user_main( &user_main, (void*)NULL );\n\n  Grappa_finish( 0 );\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<commit_msg>Add test for forall_global_public<commit_after>\n\/\/ Copyright 2010-2012 University of Washington. All Rights Reserved.\n\/\/ LICENSE_PLACEHOLDER\n\/\/ This software was created with Government support under DE\n\/\/ AC05-76RL01830 awarded by the United States Department of\n\/\/ Energy. The Government has certain rights in the software.\n\n#include \"ParallelLoop.hpp\"\n\n#include <boost\/test\/unit_test.hpp>\n\n#include \"Grappa.hpp\"\n#include \"Message.hpp\"\n#include \"MessagePool.hpp\"\n#include \"CompletionEvent.hpp\"\n#include \"ConditionVariable.hpp\"\n#include \"Delegate.hpp\"\n#include \"Tasking.hpp\"\n#include \"GlobalAllocator.hpp\"\n\nBOOST_AUTO_TEST_SUITE( New_loop_tests );\n\nusing namespace Grappa;\nusing Grappa::wait;\n\nstatic bool touched = false;\n\nvoid test_on_all_cores() {\n  BOOST_MESSAGE(\"Testing on_all_cores...\");\n  \n  on_all_cores([] {\n    BOOST_MESSAGE(\"hello world from \" << mycore() << \"!\");\n    touched = true;\n  });\n  \n  BOOST_CHECK_EQUAL(delegate::read(make_global(&touched,1)), true);\n  BOOST_CHECK_EQUAL(touched, true);\n}\n\nvoid test_loop_decomposition() {\n  int N = 16;\n  \n  CompletionEvent ce(N);\n  \n  impl::loop_decomposition_private<2>(0, N, [&ce](int64_t start, int64_t iters) {\n    VLOG(1) << \"loop(\" << start << \", \" << iters << \")\";\n    ce.complete(iters);\n  });\n  ce.wait();\n}\n\nvoid test_loop_decomposition_global() {\n  int N = 16;\n  \n  CompletionEvent ce(N);\n  auto ce_addr = make_global(&ce);\n  \n  impl::loop_decomposition_public(0, N, [ce_addr](int64_t start, int64_t iters) {\n    VLOG(1) << \"loop(\" << start << \", \" << iters << \")\";\n    complete(ce_addr,iters);\n  });\n  ce.wait();\n}\n\nCompletionEvent my_ce;\n\nvoid test_forall_here() {\n  BOOST_MESSAGE(\"Testing forall_here...\");\n  const int N = 15;\n  \n  {\n    int x = 0;\n    forall_here(0, N, [&x](int64_t start, int64_t iters) {\n      CHECK(mycore() == 0);\n      for (int64_t i=0; i<iters; i++) {\n        x++;\n      }\n    });\n    BOOST_CHECK_EQUAL(x, N);\n  }\n  \n  {\n    int x = 0;\n    forall_here<&my_ce,2>(0, N, [&x](int64_t start, int64_t iters) {\n      CHECK(mycore() == 0);\n      for (int64_t i=0; i<iters; i++) {\n        x++;\n      }\n    });\n    BOOST_CHECK_EQUAL(x, N);\n  }\n  \n}\n\nstatic int test_global = 0;\nCompletionEvent test_global_ce;\nGlobalCompletionEvent my_gce;\n\nvoid test_forall_global_private() {\n  BOOST_MESSAGE(\"Testing forall_global...\");\n  const int64_t N = 1 << 8;\n  \n  BOOST_MESSAGE(\"  private\");\n  forall_global_private(0, N, [](int64_t start, int64_t iters) {\n    for (int i=0; i<iters; i++) {\n      test_global++;\n    }\n  });\n  \n  on_all_cores([]{\n    BOOST_CHECK_EQUAL(test_global, N\/cores());\n    test_global = 0;\n  });\n  \n  forall_global_private<&test_global_ce>(0, N, [](int64_t start, int64_t iters) {\n    for (int i=0; i<iters; i++) {\n      test_global++;\n    }\n  });\n  \n  on_all_cores([]{\n    BOOST_CHECK_EQUAL(test_global, N\/cores());\n    test_global = 0;\n  });\n  \n}\n\nvoid test_forall_global_public() {\n  BOOST_MESSAGE(\"Testing forall_global_public...\");\n  const int64_t N = 1 << 8;\n  \n  on_all_cores([]{ test_global = 0; });\n  \n  forall_global_public(0, N, [](int64_t s, int64_t n) {\n    test_global += n;\n  });\n  \n  int total = 0;\n  for (Core c = 0; c < cores(); c++) {\n    total += delegate::read(make_global(&test_global, c));\n  }\n  BOOST_CHECK_EQUAL(total, N);\n}\n\nvoid test_forall_localized() {\n  BOOST_MESSAGE(\"Testing forall_localized...\");\n  const int64_t N = 1 << 8;\n  \n  auto array = Grappa_typed_malloc<int64_t>(N);\n  \n  forall_localized(array, N, [](int64_t i, int64_t& e){\n    e = 1;\n  });\n  \n  forall_here(0, N, [array](int64_t s, int64_t n) {\n    for (int i=s; i<s+n; i++) { BOOST_CHECK_EQUAL(delegate::read(array+i), 1); }\n  });\n}\n\nvoid user_main(void * args) {\n  CHECK(Grappa::cores() >= 2); \/\/ at least 2 nodes for these tests...\n\n  test_on_all_cores();\n  \n  test_loop_decomposition();\n  test_loop_decomposition_global();\n  \n  test_forall_here();\n  test_forall_global_private();\n  test_forall_global_public();\n  \n  test_forall_localized();\n}\n\nBOOST_AUTO_TEST_CASE( test1 ) {\n\n  Grappa_init( &(boost::unit_test::framework::master_test_suite().argc),\n\t       &(boost::unit_test::framework::master_test_suite().argv)\n\t       );\n\n  Grappa_activate();\n\n  Grappa_run_user_main( &user_main, (void*)NULL );\n\n  Grappa_finish( 0 );\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<|endoftext|>"}
{"text":"<commit_before>LCOLLIS.cpp<commit_msg>Added a new solution.<commit_after>#include \"bits\/stdc++.h\"\nusing namespace std;\n\n# define MOD 1000000007\n# define GETCHAR getchar_unlocked\ntypedef long long ll;\n\ninline ll  readllInt() {\n    ll  n = 0;\n    char c;\n    while (1){ \n      c=GETCHAR();\n      if(c=='\\n'||c==' ') break;\n       n = n * 10 + c - '0';\n    }\n    return n;\n}\n\ninline int readInt() {\n    int n = 0;\n    char c;\n    while (1){ \n      c=GETCHAR();\n      if(c=='\\n'||c==' ') break;\n       n = n * 10 + c - '0';\n    }\n    return n;\n}\n\nint main()\n{\n  int t=readInt();\n  while(t--){\n  \tint n,m;\n  \tcin >> n >> m;\n  \tint a[n][m];\n  \tfor(int i=0;i<n;i++){\n  \t\tfor(int j=0;j<m;j++){\n  \t\t\tscanf(\"%1d\",&a[i][j]);\n  \t\t}\n  \t}\n  \/*\tfor(int i=0;i<n;i++)\n  \t{\n  \t\tfor(int j=0;j<m;j++){\n  \t\t\tprintf(\"%d \",a[i][j] );\n  \t\t}\n  \t\tprintf(\"\\n\");\n  \t}*\/\n  \tint count=0,ans=0;\n  \tfor(int j=0;j<m;j++){\n  \t\tint count=0;\n  \t\tfor(int i=0;i<n;i++){\n  \t\t\t\tif(a[i][j]==1)\n  \t\t\t\t\tcount++;\n  \t\t}\n  \t\tif(count>1)\n  \t\t\tans+=(count*(count-1))\/2; \/\/ nc2 == n(n-1)\/!2!\n  \t}\n  \tprintf(\"%d\\n\", ans);\n  }\n\t\n\treturn 0;\n}\n\t<|endoftext|>"}
{"text":"<commit_before>\/\/ Quantum operations\n\/\/ Source: .\/examples\/ex4.cpp\n#include <qpp.h>\nusing namespace qpp;\n\nint main()\n{\n    cmat rho = st.pb00; \/\/ projector onto the Bell state (|00>+|11>)\/sqrt(2)\n    std::cout << \"Initial state:\\n\";\n    std::cout << disp(rho) << std::endl;\n\n    \/\/ partial transpose of first subsystem\n    cmat rhoTA = ptranspose(rho, {0});\n    std::cout << \"Eigenvalues of the partial transpose of Bell-0 state are:\\n\";\n    std::cout << disp(transpose(hevals(rhoTA))) << std::endl;\n\n    std::cout << \"Measurement channel with 2 Kraus operators:\\n\";\n    std::vector<cmat> Ks {st.pz0, st.pz1}; \/\/ 2 Kraus operators\n    std::cout << disp(Ks[0]) << \"\\n    and \\n\" << disp(Ks[1]) << std::endl;\n\n    std::cout << \"Superoperator matrix of the channel:\\n\";\n    std::cout << disp(super(Ks)) << std::endl;\n\n    std::cout << \"Choi matrix of the channel:\\n\";\n    std::cout << disp(choi(Ks)) << std::endl;\n\n    \/\/ apply the channel onto the first subsystem\n    cmat rhoOut = apply(rho, Ks, {0});\n    std::cout << \"After applying the measurement channel on the first qubit:\\n\";\n    std::cout << disp(rhoOut) << std::endl;\n\n    \/\/ take the partial trace over the second subsystem\n    cmat rhoA = ptrace(rhoOut, {1});\n    std::cout << \"After partially tracing down the second subsystem:\\n\";\n    std::cout << disp(rhoA) << std::endl;\n\n    \/\/ compute the vonNeumann entropy\n    double ent = entropy(rhoA);\n    std::cout << \"Entropy: \" << ent << std::endl;\n}<commit_msg>commit<commit_after>\/\/ Quantum operations\n\/\/ Source: .\/examples\/ex4.cpp\n#include <qpp.h>\nusing namespace qpp;\n\nint main()\n{\n    cmat rho = st.pb00; \/\/ projector onto the Bell state (|00>+|11>)\/sqrt(2)\n    std::cout << \"Initial state:\\n\";\n    std::cout << disp(rho) << std::endl;\n\n    \/\/ partial transpose of first subsystem\n    cmat rhoTA = ptranspose(rho, {0});\n    std::cout << \"Eigenvalues of the partial transpose of Bell-0 state are:\\n\";\n    std::cout << disp(transpose(hevals(rhoTA))) << std::endl;\n\n    std::cout << \"Measurement channel with 2 Kraus operators:\\n\";\n    std::vector<cmat> Ks {st.pz0, st.pz1}; \/\/ 2 Kraus operators\n    std::cout << disp(Ks[0]) << \"\\n    and \\n\" << disp(Ks[1]) << std::endl;\n\n    std::cout << \"Superoperator matrix of the channel:\\n\";\n    std::cout << disp(super(Ks)) << std::endl;\n\n    std::cout << \"Choi matrix of the channel:\\n\";\n    std::cout << disp(choi(Ks)) << std::endl;\n\n    \/\/ apply the channel onto the first subsystem\n    cmat rhoOut = apply(rho, Ks, {0});\n    std::cout << \"After applying the measurement channel on the first qubit:\\n\";\n    std::cout << disp(rhoOut) << std::endl;\n\n    \/\/ take the partial trace over the second subsystem\n    cmat rhoA = ptrace(rhoOut, {1});\n    std::cout << \"After partially tracing down the second subsystem:\\n\";\n    std::cout << disp(rhoA) << std::endl;\n\n    \/\/ compute the von-Neumann entropy\n    double ent = entropy(rhoA);\n    std::cout << \"Entropy: \" << ent << std::endl;\n}<|endoftext|>"}
{"text":"<commit_before>#include \"PPWindow.h\"\n\nPPWindow::PPWindow(ParametersContainer pc, Generator g):\n\toutputLabel(g.getPPConversion(pc.getInput())),\n\ttranslateButton(\"Translate\")\n{\n\tgen = g;\n\n\tset_title(\"PP-Converter\");\n\tset_border_width(5);\n\n\tadd(v_box);\n\tadd(outputLabel);\n\n\tv_box.pack_start(entryField);\n\tv_box.pack_start(translateButton);\n\tv_box.pack_start(outputLabel);\n\n\ttranslateButton.signal_clicked().connect(sigc::mem_fun(*this,\n              &PPWindow::on_button_clicked));\n\n\n\tshow_all_children();\n}\n\nPPWindow::~PPWindow(){\n\n}\n\nvoid PPWindow::on_button_clicked(){\n\toutputLabel.set_text(gen.getPPConversion(entryField.get_text()));\n}<commit_msg>removed obsolete statement<commit_after>#include \"PPWindow.h\"\n\nPPWindow::PPWindow(ParametersContainer pc, Generator g):\n\toutputLabel(g.getPPConversion(pc.getInput())),\n\ttranslateButton(\"Translate\")\n{\n\tgen = g;\n\n\tset_title(\"PP-Converter\");\n\tset_border_width(5);\n\n\tadd(v_box);\n\n\tv_box.pack_start(entryField);\n\tv_box.pack_start(translateButton);\n\tv_box.pack_start(outputLabel);\n\n\ttranslateButton.signal_clicked().connect(sigc::mem_fun(*this,\n              &PPWindow::on_button_clicked));\n\n\n\tshow_all_children();\n}\n\nPPWindow::~PPWindow(){\n\n}\n\nvoid PPWindow::on_button_clicked(){\n\toutputLabel.set_text(gen.getPPConversion(entryField.get_text()));\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 \"gfx\/font.h\"\n\n#include <windows.h>\n#include <math.h>\n\n#include <algorithm>\n\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n#include \"base\/win_util.h\"\n#include \"gfx\/canvas_skia.h\"\n\nnamespace gfx {\n\n\/\/ static\nFont::HFontRef* Font::base_font_ref_;\n\n\/\/ static\nFont::AdjustFontCallback Font::adjust_font_callback = NULL;\nFont::GetMinimumFontSizeCallback Font::get_minimum_font_size_callback = NULL;\n\n\/\/ If the tmWeight field of a TEXTMETRIC structure has a value >= this, the\n\/\/ font is bold.\nstatic const int kTextMetricWeightBold = 700;\n\n\/\/ Returns either minimum font allowed for a current locale or\n\/\/ lf_height + size_delta value.\nstatic int AdjustFontSize(int lf_height, int size_delta) {\n  if (lf_height < 0) {\n    lf_height -= size_delta;\n  } else {\n    lf_height += size_delta;\n  }\n  int min_font_size = 0;\n  if (Font::get_minimum_font_size_callback)\n    min_font_size = Font::get_minimum_font_size_callback();\n  \/\/ Make sure lf_height is not smaller than allowed min font size for current\n  \/\/ locale.\n  if (abs(lf_height) < min_font_size) {\n    return lf_height < 0 ? -min_font_size : min_font_size;\n  } else {\n    return lf_height;\n  }\n}\n\n\/\/\n\/\/ Font\n\/\/\n\nFont::Font()\n    : font_ref_(GetBaseFontRef()) {\n}\n\nint Font::height() const {\n  return font_ref_->height();\n}\n\nint Font::baseline() const {\n  return font_ref_->baseline();\n}\n\nint Font::ave_char_width() const {\n  return font_ref_->ave_char_width();\n}\n\nint Font::GetExpectedTextWidth(int length) const {\n  return length * std::min(font_ref_->dlu_base_x(), ave_char_width());\n}\n\nint Font::style() const {\n  return font_ref_->style();\n}\n\nNativeFont Font::nativeFont() const {\n  return hfont();\n}\n\n\/\/ static\nFont Font::CreateFont(HFONT font) {\n  DCHECK(font);\n  LOGFONT font_info;\n  GetObject(font, sizeof(LOGFONT), &font_info);\n  return Font(CreateHFontRef(CreateFontIndirect(&font_info)));\n}\n\nFont Font::CreateFont(const std::wstring& font_name, int font_size) {\n  HDC hdc = GetDC(NULL);\n  long lf_height = -MulDiv(font_size, GetDeviceCaps(hdc, LOGPIXELSY), 72);\n  ReleaseDC(NULL, hdc);\n  HFONT hf = ::CreateFont(lf_height, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n                    font_name.c_str());\n  return Font::CreateFont(hf);\n}\n\n\/\/ static\nFont::HFontRef* Font::GetBaseFontRef() {\n  if (base_font_ref_ == NULL) {\n    NONCLIENTMETRICS metrics;\n    win_util::GetNonClientMetrics(&metrics);\n\n    if (adjust_font_callback)\n      adjust_font_callback(&metrics.lfMessageFont);\n    metrics.lfMessageFont.lfHeight =\n        AdjustFontSize(metrics.lfMessageFont.lfHeight, 0);\n    HFONT font = CreateFontIndirect(&metrics.lfMessageFont);\n    DLOG_ASSERT(font);\n    base_font_ref_ = Font::CreateHFontRef(font);\n    \/\/ base_font_ref_ is global, up the ref count so it's never deleted.\n    base_font_ref_->AddRef();\n  }\n  return base_font_ref_;\n}\n\nconst std::wstring& Font::FontName() const {\n  return font_ref_->font_name();\n}\n\nint Font::FontSize() {\n  LOGFONT font_info;\n  GetObject(hfont(), sizeof(LOGFONT), &font_info);\n  long lf_height = font_info.lfHeight;\n  HDC hdc = GetDC(NULL);\n  int device_caps = GetDeviceCaps(hdc, LOGPIXELSY);\n  int font_size = 0;\n  if (device_caps != 0) {\n    float font_size_float = -static_cast<float>(lf_height)*72\/device_caps;\n    font_size = static_cast<int>(::ceil(font_size_float - 0.5));\n  }\n  ReleaseDC(NULL, hdc);\n  return font_size;\n}\n\nFont::HFontRef::HFontRef(HFONT hfont,\n         int height,\n         int baseline,\n         int ave_char_width,\n         int style,\n         int dlu_base_x)\n    : hfont_(hfont),\n      height_(height),\n      baseline_(baseline),\n      ave_char_width_(ave_char_width),\n      style_(style),\n      dlu_base_x_(dlu_base_x) {\n  DLOG_ASSERT(hfont);\n\n  LOGFONT font_info;\n  GetObject(hfont_, sizeof(LOGFONT), &font_info);\n  font_name_ = std::wstring(font_info.lfFaceName);\n}\n\nFont::HFontRef::~HFontRef() {\n  DeleteObject(hfont_);\n}\n\nFont Font::DeriveFont(int size_delta, int style) const {\n  LOGFONT font_info;\n  GetObject(hfont(), sizeof(LOGFONT), &font_info);\n  font_info.lfHeight = AdjustFontSize(font_info.lfHeight, size_delta);\n  font_info.lfUnderline = ((style & UNDERLINED) == UNDERLINED);\n  font_info.lfItalic = ((style & ITALIC) == ITALIC);\n  font_info.lfWeight = (style & BOLD) ? FW_BOLD : FW_NORMAL;\n\n  HFONT hfont = CreateFontIndirect(&font_info);\n  return Font(CreateHFontRef(hfont));\n}\n\nint Font::GetStringWidth(const std::wstring& text) const {\n  int width = 0;\n  HDC dc = GetDC(NULL);\n  HFONT previous_font = static_cast<HFONT>(SelectObject(dc, hfont()));\n  SIZE size;\n  if (GetTextExtentPoint32(dc, text.c_str(), static_cast<int>(text.size()),\n                           &size)) {\n    width = size.cx;\n  } else {\n    width = 0;\n  }\n  SelectObject(dc, previous_font);\n  ReleaseDC(NULL, dc);\n  return width;\n}\n\nFont::HFontRef* Font::CreateHFontRef(HFONT font) {\n  TEXTMETRIC font_metrics;\n  HDC screen_dc = GetDC(NULL);\n  HFONT previous_font = static_cast<HFONT>(SelectObject(screen_dc, font));\n  int last_map_mode = SetMapMode(screen_dc, MM_TEXT);\n  GetTextMetrics(screen_dc, &font_metrics);\n  \/\/ Yes, this is how Microsoft recommends calculating the dialog unit\n  \/\/ conversions.\n  SIZE ave_text_size;\n  GetTextExtentPoint32(screen_dc,\n                       L\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n                       52, &ave_text_size);\n  const int dlu_base_x = (ave_text_size.cx \/ 26 + 1) \/ 2;\n  \/\/ To avoid the DC referencing font_handle_, select the previous font.\n  SelectObject(screen_dc, previous_font);\n  SetMapMode(screen_dc, last_map_mode);\n  ReleaseDC(NULL, screen_dc);\n\n  const int height = std::max(1, static_cast<int>(font_metrics.tmHeight));\n  const int baseline = std::max(1, static_cast<int>(font_metrics.tmAscent));\n  const int ave_char_width =\n      std::max(1, static_cast<int>(font_metrics.tmAveCharWidth));\n  int style = 0;\n  if (font_metrics.tmItalic) {\n    style |= Font::ITALIC;\n  }\n  if (font_metrics.tmUnderlined) {\n    style |= Font::UNDERLINED;\n  }\n  if (font_metrics.tmWeight >= kTextMetricWeightBold) {\n    style |= Font::BOLD;\n  }\n\n  return new HFontRef(font, height, baseline, ave_char_width, style,\n                      dlu_base_x);\n}\n\n}  \/\/ namespace gfx\n<commit_msg>Revert 52441 - Revert Win specific elements of 46492 to look for perf impact<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 \"gfx\/font.h\"\n\n#include <windows.h>\n#include <math.h>\n\n#include <algorithm>\n\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n#include \"base\/win_util.h\"\n#include \"gfx\/canvas_skia.h\"\n\nnamespace gfx {\n\n\/\/ static\nFont::HFontRef* Font::base_font_ref_;\n\n\/\/ static\nFont::AdjustFontCallback Font::adjust_font_callback = NULL;\nFont::GetMinimumFontSizeCallback Font::get_minimum_font_size_callback = NULL;\n\n\/\/ If the tmWeight field of a TEXTMETRIC structure has a value >= this, the\n\/\/ font is bold.\nstatic const int kTextMetricWeightBold = 700;\n\n\/\/ Returns either minimum font allowed for a current locale or\n\/\/ lf_height + size_delta value.\nstatic int AdjustFontSize(int lf_height, int size_delta) {\n  if (lf_height < 0) {\n    lf_height -= size_delta;\n  } else {\n    lf_height += size_delta;\n  }\n  int min_font_size = 0;\n  if (Font::get_minimum_font_size_callback)\n    min_font_size = Font::get_minimum_font_size_callback();\n  \/\/ Make sure lf_height is not smaller than allowed min font size for current\n  \/\/ locale.\n  if (abs(lf_height) < min_font_size) {\n    return lf_height < 0 ? -min_font_size : min_font_size;\n  } else {\n    return lf_height;\n  }\n}\n\n\/\/\n\/\/ Font\n\/\/\n\nFont::Font()\n    : font_ref_(GetBaseFontRef()) {\n}\n\nint Font::height() const {\n  return font_ref_->height();\n}\n\nint Font::baseline() const {\n  return font_ref_->baseline();\n}\n\nint Font::ave_char_width() const {\n  return font_ref_->ave_char_width();\n}\n\nint Font::GetExpectedTextWidth(int length) const {\n  return length * std::min(font_ref_->dlu_base_x(), ave_char_width());\n}\n\nint Font::style() const {\n  return font_ref_->style();\n}\n\nNativeFont Font::nativeFont() const {\n  return hfont();\n}\n\n\/\/ static\nFont Font::CreateFont(HFONT font) {\n  DCHECK(font);\n  LOGFONT font_info;\n  GetObject(font, sizeof(LOGFONT), &font_info);\n  return Font(CreateHFontRef(CreateFontIndirect(&font_info)));\n}\n\nFont Font::CreateFont(const std::wstring& font_name, int font_size) {\n  HDC hdc = GetDC(NULL);\n  long lf_height = -MulDiv(font_size, GetDeviceCaps(hdc, LOGPIXELSY), 72);\n  ReleaseDC(NULL, hdc);\n  HFONT hf = ::CreateFont(lf_height, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n                    font_name.c_str());\n  return Font::CreateFont(hf);\n}\n\n\/\/ static\nFont::HFontRef* Font::GetBaseFontRef() {\n  if (base_font_ref_ == NULL) {\n    NONCLIENTMETRICS metrics;\n    win_util::GetNonClientMetrics(&metrics);\n\n    if (adjust_font_callback)\n      adjust_font_callback(&metrics.lfMessageFont);\n    metrics.lfMessageFont.lfHeight =\n        AdjustFontSize(metrics.lfMessageFont.lfHeight, 0);\n    HFONT font = CreateFontIndirect(&metrics.lfMessageFont);\n    DLOG_ASSERT(font);\n    base_font_ref_ = Font::CreateHFontRef(font);\n    \/\/ base_font_ref_ is global, up the ref count so it's never deleted.\n    base_font_ref_->AddRef();\n  }\n  return base_font_ref_;\n}\n\nconst std::wstring& Font::FontName() const {\n  return font_ref_->font_name();\n}\n\nint Font::FontSize() {\n  LOGFONT font_info;\n  GetObject(hfont(), sizeof(LOGFONT), &font_info);\n  long lf_height = font_info.lfHeight;\n  HDC hdc = GetDC(NULL);\n  int device_caps = GetDeviceCaps(hdc, LOGPIXELSY);\n  int font_size = 0;\n  if (device_caps != 0) {\n    float font_size_float = -static_cast<float>(lf_height)*72\/device_caps;\n    font_size = static_cast<int>(::ceil(font_size_float - 0.5));\n  }\n  ReleaseDC(NULL, hdc);\n  return font_size;\n}\n\nFont::HFontRef::HFontRef(HFONT hfont,\n         int height,\n         int baseline,\n         int ave_char_width,\n         int style,\n         int dlu_base_x)\n    : hfont_(hfont),\n      height_(height),\n      baseline_(baseline),\n      ave_char_width_(ave_char_width),\n      style_(style),\n      dlu_base_x_(dlu_base_x) {\n  DLOG_ASSERT(hfont);\n\n  LOGFONT font_info;\n  GetObject(hfont_, sizeof(LOGFONT), &font_info);\n  font_name_ = std::wstring(font_info.lfFaceName);\n}\n\nFont::HFontRef::~HFontRef() {\n  DeleteObject(hfont_);\n}\n\nFont Font::DeriveFont(int size_delta, int style) const {\n  LOGFONT font_info;\n  GetObject(hfont(), sizeof(LOGFONT), &font_info);\n  font_info.lfHeight = AdjustFontSize(font_info.lfHeight, size_delta);\n  font_info.lfUnderline = ((style & UNDERLINED) == UNDERLINED);\n  font_info.lfItalic = ((style & ITALIC) == ITALIC);\n  font_info.lfWeight = (style & BOLD) ? FW_BOLD : FW_NORMAL;\n\n  HFONT hfont = CreateFontIndirect(&font_info);\n  return Font(CreateHFontRef(hfont));\n}\n\nint Font::GetStringWidth(const std::wstring& text) const {\n  int width = 0, height = 0;\n  CanvasSkia::SizeStringInt(text, *this, &width, &height,\n                            gfx::Canvas::NO_ELLIPSIS);\n  return width;\n}\n\nFont::HFontRef* Font::CreateHFontRef(HFONT font) {\n  TEXTMETRIC font_metrics;\n  HDC screen_dc = GetDC(NULL);\n  HFONT previous_font = static_cast<HFONT>(SelectObject(screen_dc, font));\n  int last_map_mode = SetMapMode(screen_dc, MM_TEXT);\n  GetTextMetrics(screen_dc, &font_metrics);\n  \/\/ Yes, this is how Microsoft recommends calculating the dialog unit\n  \/\/ conversions.\n  SIZE ave_text_size;\n  GetTextExtentPoint32(screen_dc,\n                       L\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n                       52, &ave_text_size);\n  const int dlu_base_x = (ave_text_size.cx \/ 26 + 1) \/ 2;\n  \/\/ To avoid the DC referencing font_handle_, select the previous font.\n  SelectObject(screen_dc, previous_font);\n  SetMapMode(screen_dc, last_map_mode);\n  ReleaseDC(NULL, screen_dc);\n\n  const int height = std::max(1, static_cast<int>(font_metrics.tmHeight));\n  const int baseline = std::max(1, static_cast<int>(font_metrics.tmAscent));\n  const int ave_char_width =\n      std::max(1, static_cast<int>(font_metrics.tmAveCharWidth));\n  int style = 0;\n  if (font_metrics.tmItalic) {\n    style |= Font::ITALIC;\n  }\n  if (font_metrics.tmUnderlined) {\n    style |= Font::UNDERLINED;\n  }\n  if (font_metrics.tmWeight >= kTextMetricWeightBold) {\n    style |= Font::BOLD;\n  }\n\n  return new HFontRef(font, height, baseline, ave_char_width, style,\n                      dlu_base_x);\n}\n\n}  \/\/ namespace gfx\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n\n#include <string>\n#include <set>\n#include <vector>\n\n#include \"mock_facility.h\"\n#include \"request.h\"\n#include \"request_portfolio.h\"\n#include \"bid.h\"\n#include \"bid_portfolio.h\"\n#include \"resource.h\"\n#include \"test_context.h\"\n#include \"trader.h\"\n\n#include \"exchange_context.h\"\n\nusing std::string;\nusing std::set;\nusing std::vector;\n\nusing cyclus::ExchangeContext;\nusing cyclus::Request;\nusing cyclus::RequestPortfolio;\nusing cyclus::Bid;\nusing cyclus::BidPortfolio;\nusing cyclus::PrefMap;\nusing cyclus::Resource;\nusing cyclus::TestContext;\nusing cyclus::Trader;\n  \n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nclass ExchangeContextTests: public ::testing::Test {\n protected:\n  TestContext tc;\n  MockFacility* fac1;\n  MockFacility* fac2;\n  Request<Resource>::Ptr req1, req2;\n  RequestPortfolio<Resource> rp1, rp2;\n  string commod1, commod2;\n  \n  virtual void SetUp() {\n    fac1 = new MockFacility(tc.get());\n    fac2 = new MockFacility(tc.get());\n\n    commod1 = \"commod1\";\n    req1 = Request<Resource>::Ptr(new Request<Resource>());\n    req1->commodity = commod1;\n    req1->requester = fac1;\n    \n    req2 = Request<Resource>::Ptr(new Request<Resource>());\n    req2->commodity = commod1;\n    req2->requester = fac2;\n\n    rp1.AddRequest(req1);    \n    rp2.AddRequest(req2);\n  };\n  \n  virtual void TearDown() {\n    rp1.Clear();\n    rp2.Clear();\n    delete fac1;\n    delete fac2;\n  };\n};\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, Empty) {\n  ExchangeContext<Resource> context;\n  EXPECT_TRUE(context.requests().empty());\n  EXPECT_TRUE(context.RequestsForCommod(commod2).empty());\n  EXPECT_TRUE(context.RequestsForCommod(commod2).empty());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddRequest1) {\n  \/\/ 1 request for 1 commod\n  ExchangeContext<Resource> context;\n    \n  context.AddRequestPortfolio(rp1);\n\n  std::vector<RequestPortfolio<Resource> > vp;\n  vp.push_back(rp1);\n  EXPECT_EQ(vp, context.requests());\n  \n  EXPECT_EQ(1, context.RequestsForCommod(commod1).size());  \n  std::vector<Request<Resource>::Ptr> vr;\n  vr.push_back(req1);\n  EXPECT_EQ(vr, context.RequestsForCommod(commod1));\n\n  EXPECT_EQ(1, context.requesters().size());  \n  std::set<const Trader*> requesters;\n  requesters.insert(fac1);\n  EXPECT_EQ(requesters, context.requesters());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddRequest2) {\n  \/\/ 2 requests for 1 commod\n  ExchangeContext<Resource> context;\n    \n  context.AddRequestPortfolio(rp1);\n  context.AddRequestPortfolio(rp2);\n\n  std::vector<RequestPortfolio<Resource> > vp;\n  vp.push_back(rp1);\n  vp.push_back(rp2);\n  EXPECT_EQ(vp, context.requests());\n  \n  EXPECT_EQ(2, context.RequestsForCommod(commod1).size());  \n  std::vector<Request<Resource>::Ptr> vr;\n  vr.push_back(req1);\n  vr.push_back(req2);\n  EXPECT_EQ(vr, context.RequestsForCommod(commod1));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddRequest3) {\n  \/\/ 2 requests for 2 commod\n  Request<Resource>::Ptr req = Request<Resource>::Ptr(new Request<Resource>());\n  req->commodity = commod2;\n  req->requester = fac1;\n  rp1.AddRequest(req);\n  \n  ExchangeContext<Resource> context;\n    \n  context.AddRequestPortfolio(rp1);\n  \n  EXPECT_EQ(1, context.RequestsForCommod(commod1).size());\n  EXPECT_EQ(1, context.RequestsForCommod(commod2).size());\n  \n  std::vector<Request<Resource>::Ptr> vr;\n  vr.push_back(req1);\n  EXPECT_EQ(vr, context.RequestsForCommod(commod1));\n\n  vr.clear();\n  vr.push_back(req);\n  EXPECT_EQ(vr, context.RequestsForCommod(commod2));  \n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddBid1) {\n  \/\/ bid bid for a request\n  ExchangeContext<Resource> context;\n  context.AddRequestPortfolio(rp1);\n\n  EXPECT_TRUE(context.BidsForRequest(req1).empty());\n  \n  Bid<Resource>::Ptr bid = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid->request = req1;\n  bid->bidder = fac1;\n  BidPortfolio<Resource> bp1;\n  bp1.AddBid(bid);\n\n  context.AddBidPortfolio(bp1);\n\n  std::vector<BidPortfolio<Resource> > vp;\n  vp.push_back(bp1);\n  EXPECT_EQ(vp, context.bids());\n\n  EXPECT_EQ(1, context.BidsForRequest(req1).size());\n  \n  std::vector<Bid<Resource>::Ptr> vr;\n  vr.push_back(bid);\n  EXPECT_EQ(vr, context.BidsForRequest(req1));\n\n  EXPECT_EQ(1, context.bidders().size());  \n  std::set<const Trader*> bidders;\n  bidders.insert(fac1);\n  EXPECT_EQ(bidders, context.bidders());\n\n  PrefMap<Resource>::type obs;\n  obs[req1].push_back(std::make_pair(bid, req1->preference));\n  EXPECT_EQ(context.Prefs(req1->requester), obs);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddBid2) {\n  \/\/ multiple bids for multiple requests\n  ExchangeContext<Resource> context;\n  context.AddRequestPortfolio(rp1);\n  context.AddRequestPortfolio(rp2);\n\n  EXPECT_TRUE(context.BidsForRequest(req1).empty());\n  EXPECT_TRUE(context.BidsForRequest(req2).empty());\n\n  \/\/ bid1 and bid2 are from one bidder (fac1)\n  BidPortfolio<Resource> bp1;\n  Bid<Resource>::Ptr bid1 = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid1->request = req1;\n  bid1->bidder = fac1;\n  bp1.AddBid(bid1);\n  Bid<Resource>::Ptr bid2 = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid2->request = req2;\n  bid2->bidder = fac1;\n  bp1.AddBid(bid2);\n  \n  \/\/ bid3 and bid4 are from one bidder (fac2)\n  BidPortfolio<Resource> bp2;\n  Bid<Resource>::Ptr bid3 = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid3->request = req1;\n  bid3->bidder = fac2;\n  bp2.AddBid(bid3);\n  Bid<Resource>::Ptr bid4 = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid4->request = req2;\n  bid4->bidder = fac2;\n  bp2.AddBid(bid4);\n\n  std::vector<BidPortfolio<Resource> > vp;\n  std::vector<Bid<Resource>::Ptr> vreq1;\n  std::vector<Bid<Resource>::Ptr> vreq2;\n\n  \/\/ add bids from first bidder\n  context.AddBidPortfolio(bp1);\n\n  vp.push_back(bp1);\n  EXPECT_EQ(vp, context.bids());\n  \n  vreq1.push_back(bid1);\n  vreq2.push_back(bid2);\n  EXPECT_EQ(1, context.BidsForRequest(req1).size());\n  EXPECT_EQ(1, context.BidsForRequest(req2).size());\n  EXPECT_EQ(vreq1, context.BidsForRequest(req1));\n  EXPECT_EQ(vreq2, context.BidsForRequest(req2));\n  \n  \/\/ add bids from second bidder\n  context.AddBidPortfolio(bp2);\n\n  vp.push_back(bp2);\n  EXPECT_EQ(vp, context.bids());\n  \n  vreq1.push_back(bid3);\n  vreq2.push_back(bid4);\n  EXPECT_EQ(2, context.BidsForRequest(req1).size());\n  EXPECT_EQ(2, context.BidsForRequest(req2).size());\n  EXPECT_EQ(vreq1, context.BidsForRequest(req1));\n  EXPECT_EQ(vreq2, context.BidsForRequest(req2));\n\n  EXPECT_EQ(2, context.bidders().size());  \n  std::set<const Trader*> bidders;\n  bidders.insert(fac1);\n  bidders.insert(fac2);\n  EXPECT_EQ(bidders, context.bidders());\n}\n<commit_msg>added a test for non equality of pref maps<commit_after>#include <gtest\/gtest.h>\n\n#include <string>\n#include <set>\n#include <vector>\n\n#include \"mock_facility.h\"\n#include \"request.h\"\n#include \"request_portfolio.h\"\n#include \"bid.h\"\n#include \"bid_portfolio.h\"\n#include \"resource.h\"\n#include \"test_context.h\"\n#include \"trader.h\"\n\n#include \"exchange_context.h\"\n\nusing std::string;\nusing std::set;\nusing std::vector;\n\nusing cyclus::ExchangeContext;\nusing cyclus::Request;\nusing cyclus::RequestPortfolio;\nusing cyclus::Bid;\nusing cyclus::BidPortfolio;\nusing cyclus::PrefMap;\nusing cyclus::Resource;\nusing cyclus::TestContext;\nusing cyclus::Trader;\n  \n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nclass ExchangeContextTests: public ::testing::Test {\n protected:\n  TestContext tc;\n  MockFacility* fac1;\n  MockFacility* fac2;\n  Request<Resource>::Ptr req1, req2;\n  RequestPortfolio<Resource> rp1, rp2;\n  string commod1, commod2;\n  double pref;\n  \n  virtual void SetUp() {\n    fac1 = new MockFacility(tc.get());\n    fac2 = new MockFacility(tc.get());\n\n    pref = 0.5;\n    commod1 = \"commod1\";\n    req1 = Request<Resource>::Ptr(new Request<Resource>());\n    req1->commodity = commod1;\n    req1->requester = fac1;\n    req1->preference = pref;\n    \n    req2 = Request<Resource>::Ptr(new Request<Resource>());\n    req2->commodity = commod1;\n    req2->requester = fac2;\n    req2->preference = pref;\n\n    rp1.AddRequest(req1);    \n    rp2.AddRequest(req2);\n  };\n  \n  virtual void TearDown() {\n    rp1.Clear();\n    rp2.Clear();\n    delete fac1;\n    delete fac2;\n  };\n};\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, Empty) {\n  ExchangeContext<Resource> context;\n  EXPECT_TRUE(context.requests().empty());\n  EXPECT_TRUE(context.RequestsForCommod(commod2).empty());\n  EXPECT_TRUE(context.RequestsForCommod(commod2).empty());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddRequest1) {\n  \/\/ 1 request for 1 commod\n  ExchangeContext<Resource> context;\n    \n  context.AddRequestPortfolio(rp1);\n\n  std::vector<RequestPortfolio<Resource> > vp;\n  vp.push_back(rp1);\n  EXPECT_EQ(vp, context.requests());\n  \n  EXPECT_EQ(1, context.RequestsForCommod(commod1).size());  \n  std::vector<Request<Resource>::Ptr> vr;\n  vr.push_back(req1);\n  EXPECT_EQ(vr, context.RequestsForCommod(commod1));\n\n  EXPECT_EQ(1, context.requesters().size());  \n  std::set<const Trader*> requesters;\n  requesters.insert(fac1);\n  EXPECT_EQ(requesters, context.requesters());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddRequest2) {\n  \/\/ 2 requests for 1 commod\n  ExchangeContext<Resource> context;\n    \n  context.AddRequestPortfolio(rp1);\n  context.AddRequestPortfolio(rp2);\n\n  std::vector<RequestPortfolio<Resource> > vp;\n  vp.push_back(rp1);\n  vp.push_back(rp2);\n  EXPECT_EQ(vp, context.requests());\n  \n  EXPECT_EQ(2, context.RequestsForCommod(commod1).size());  \n  std::vector<Request<Resource>::Ptr> vr;\n  vr.push_back(req1);\n  vr.push_back(req2);\n  EXPECT_EQ(vr, context.RequestsForCommod(commod1));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddRequest3) {\n  \/\/ 2 requests for 2 commod\n  Request<Resource>::Ptr req = Request<Resource>::Ptr(new Request<Resource>());\n  req->commodity = commod2;\n  req->requester = fac1;\n  rp1.AddRequest(req);\n  \n  ExchangeContext<Resource> context;\n    \n  context.AddRequestPortfolio(rp1);\n  \n  EXPECT_EQ(1, context.RequestsForCommod(commod1).size());\n  EXPECT_EQ(1, context.RequestsForCommod(commod2).size());\n  \n  std::vector<Request<Resource>::Ptr> vr;\n  vr.push_back(req1);\n  EXPECT_EQ(vr, context.RequestsForCommod(commod1));\n\n  vr.clear();\n  vr.push_back(req);\n  EXPECT_EQ(vr, context.RequestsForCommod(commod2));  \n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddBid1) {\n  \/\/ bid bid for a request\n  ExchangeContext<Resource> context;\n  context.AddRequestPortfolio(rp1);\n\n  EXPECT_TRUE(context.BidsForRequest(req1).empty());\n  \n  Bid<Resource>::Ptr bid = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid->request = req1;\n  bid->bidder = fac1;\n  BidPortfolio<Resource> bp1;\n  bp1.AddBid(bid);\n\n  context.AddBidPortfolio(bp1);\n\n  std::vector<BidPortfolio<Resource> > vp;\n  vp.push_back(bp1);\n  EXPECT_EQ(vp, context.bids());\n\n  EXPECT_EQ(1, context.BidsForRequest(req1).size());\n  \n  std::vector<Bid<Resource>::Ptr> vr;\n  vr.push_back(bid);\n  EXPECT_EQ(vr, context.BidsForRequest(req1));\n\n  EXPECT_EQ(1, context.bidders().size());  \n  std::set<const Trader*> bidders;\n  bidders.insert(fac1);\n  EXPECT_EQ(bidders, context.bidders());\n\n  PrefMap<Resource>::type obs;\n  obs[req1].push_back(std::make_pair(bid, req1->preference));\n  EXPECT_EQ(context.Prefs(req1->requester), obs);\n  obs.clear();\n  obs[req1].push_back(std::make_pair(bid, req1->preference * 0.1));\n  EXPECT_NE(context.Prefs(req1->requester), obs);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(ExchangeContextTests, AddBid2) {\n  \/\/ multiple bids for multiple requests\n  ExchangeContext<Resource> context;\n  context.AddRequestPortfolio(rp1);\n  context.AddRequestPortfolio(rp2);\n\n  EXPECT_TRUE(context.BidsForRequest(req1).empty());\n  EXPECT_TRUE(context.BidsForRequest(req2).empty());\n\n  \/\/ bid1 and bid2 are from one bidder (fac1)\n  BidPortfolio<Resource> bp1;\n  Bid<Resource>::Ptr bid1 = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid1->request = req1;\n  bid1->bidder = fac1;\n  bp1.AddBid(bid1);\n  Bid<Resource>::Ptr bid2 = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid2->request = req2;\n  bid2->bidder = fac1;\n  bp1.AddBid(bid2);\n  \n  \/\/ bid3 and bid4 are from one bidder (fac2)\n  BidPortfolio<Resource> bp2;\n  Bid<Resource>::Ptr bid3 = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid3->request = req1;\n  bid3->bidder = fac2;\n  bp2.AddBid(bid3);\n  Bid<Resource>::Ptr bid4 = Bid<Resource>::Ptr(new Bid<Resource>());\n  bid4->request = req2;\n  bid4->bidder = fac2;\n  bp2.AddBid(bid4);\n\n  std::vector<BidPortfolio<Resource> > vp;\n  std::vector<Bid<Resource>::Ptr> vreq1;\n  std::vector<Bid<Resource>::Ptr> vreq2;\n\n  \/\/ add bids from first bidder\n  context.AddBidPortfolio(bp1);\n\n  vp.push_back(bp1);\n  EXPECT_EQ(vp, context.bids());\n  \n  vreq1.push_back(bid1);\n  vreq2.push_back(bid2);\n  EXPECT_EQ(1, context.BidsForRequest(req1).size());\n  EXPECT_EQ(1, context.BidsForRequest(req2).size());\n  EXPECT_EQ(vreq1, context.BidsForRequest(req1));\n  EXPECT_EQ(vreq2, context.BidsForRequest(req2));\n  \n  \/\/ add bids from second bidder\n  context.AddBidPortfolio(bp2);\n\n  vp.push_back(bp2);\n  EXPECT_EQ(vp, context.bids());\n  \n  vreq1.push_back(bid3);\n  vreq2.push_back(bid4);\n  EXPECT_EQ(2, context.BidsForRequest(req1).size());\n  EXPECT_EQ(2, context.BidsForRequest(req2).size());\n  EXPECT_EQ(vreq1, context.BidsForRequest(req1));\n  EXPECT_EQ(vreq2, context.BidsForRequest(req2));\n\n  EXPECT_EQ(2, context.bidders().size());  \n  std::set<const Trader*> bidders;\n  bidders.insert(fac1);\n  bidders.insert(fac2);\n  EXPECT_EQ(bidders, context.bidders());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\/\/ Category: plane\n\/\/\n\/\/ Class AliMpPlaneSegmentation\n\/\/ ----------------------------\n\/\/ Class describing the segmentation of the plane.\n\/\/\n\/\/ Transformation of pad characteristics according to sectors:\n\/\/\n\/\/   I.  ( posId,  Guassi ), ( i, j), ( x, y)         II. |  I.\n\/\/  II.  ( posId', Guassi'), (-i, j), (-x, y)       _____ | ____\n\/\/ III.  (-posId,  Guassi),  (-i,-j), (-x,-y)             |\n\/\/  IV.  (-posId', Guassi'), ( i,-j), ( x,-y)        III. |  IV.\n\/\/   \n\/\/ Where (posId', Guassi') is the location of the pad\n\/\/ in the clipped sector.\n\/\/\n\/\/ Authors: David Guez, Ivana Hrivnacova; IPN Orsay\n\n#include <Riostream.h>\n#include <TMath.h>\n\n#include \"AliMpPlaneSegmentation.h\"\n#include \"AliMpPlaneAreaPadIterator.h\"\n#include \"AliMpPlane.h\"\n#include \"AliMpSectorPosition.h\"\n#include \"AliMpSectorSegmentation.h\"\n\nClassImp(AliMpPlaneSegmentation)\n\n\/\/_____________________________________________________________________________\nAliMpPlaneSegmentation::AliMpPlaneSegmentation(const AliMpPlane* plane) \n  : AliMpVSegmentation(),\n    fkPlane(plane),\n    fFrontSectorSegmentation(0),\n    fBackSectorSegmentation(0)\n{\n\/\/\n  fFrontSectorSegmentation = new AliMpSectorSegmentation(plane->GetFrontSector());\n  fBackSectorSegmentation = new AliMpSectorSegmentation(plane->GetBackSector());\n  \n  for (Int_t i=0; i<fkPlane->GetNofSectorPositions(); i++) {\n    fTransformers.push_back(\n      new AliMpTransformer(fkPlane->GetSectorPosition(i)->GetOffset(),\n                           fkPlane->GetSectorPosition(i)->GetScale()));\n  }\t\t       \n}\n\n\/\/\/_____________________________________________________________________________\nAliMpPlaneSegmentation::AliMpPlaneSegmentation() \n  : AliMpVSegmentation(),\n    fkPlane(0),\n    fFrontSectorSegmentation(0),\n    fBackSectorSegmentation(0)\n{\n\/\/\n}\n\n\/\/_____________________________________________________________________________\nAliMpPlaneSegmentation::~AliMpPlaneSegmentation() {\n\/\/ \n  delete fFrontSectorSegmentation;\n  delete fBackSectorSegmentation;\n\n  for (Int_t i=0; i<GetNofTransformers(); i++) \n    delete GetTransformer(i);\n}\n\n\/\/\n\/\/ private methods\n\/\/\n\n\/\/_____________________________________________________________________________\nconst AliMpTransformer* \nAliMpPlaneSegmentation::GetTransformer(const AliMpIntPair& scale) const\n{\n\/\/ Returns the sector position specified by scale.\n\/\/ ---\n\n  for (UInt_t i=0; i<fTransformers.size(); i++) \n    if (fTransformers[i]->GetScale() == scale) return fTransformers[i];\n\n  Fatal(\"GetTransformer\", \"Wrong scale\");\n  return 0; \n}\n\n\/\/_____________________________________________________________________________\nAliMpIntPair AliMpPlaneSegmentation::GetScale(const AliMpIntPair& pair) const\n{\n\/\/ Returns pair of the signs of the values of the given pair.\n\/\/ ---\n\n  AliMpIntPair scale(1, 1);\n  \n  if (pair.GetFirst() < 0)  scale.SetFirst(-1);\n  if (pair.GetSecond() < 0) scale.SetSecond(-1);\n  \n  return scale;\n}\n\n\/\/_____________________________________________________________________________\nAliMpIntPair AliMpPlaneSegmentation::GetScale(const TVector2& vector) const\n{\n\/\/ Returns pair of the signs of the values of the given vector.\n\/\/ ---\n\n  AliMpIntPair scale(1, 1);\n  \n  if (vector.X() < 0) scale.SetFirst(-1);\n  if (vector.Y() < 0) scale.SetSecond(-1);\n  \n  return scale;\n}\n\n\/\/_____________________________________________________________________________\nAliMpIntPair \nAliMpPlaneSegmentation::GetLocationScale(const AliMpIntPair& location) const\n{\n\/\/ Returns the scale transformation of the specified location. \n\/\/ ---\n\n  \/\/ Find the sector\n  Bool_t inFront;\n  if (fFrontSectorSegmentation\n        ->HasMotifPosition(TMath::Abs(location.GetFirst())))\n    inFront = true;\n  else if (fBackSectorSegmentation\n             ->HasMotifPosition(TMath::Abs(location.GetFirst())))  \n    inFront = false;\n  else {\n    Fatal(\"GetLocationScale\", \"Motif position not found.\");\n    return AliMpIntPair();\n  }  \n    \n  if      (inFront  && location.GetFirst() > 0) return  AliMpIntPair(1, 1); \n  else if (inFront  && location.GetFirst() < 0) return  AliMpIntPair(-1, -1);\n  else if (!inFront && location.GetFirst() > 0) return  AliMpIntPair(-1, 1);\n  else if (!inFront && location.GetFirst() < 0) return  AliMpIntPair( 1,-1);  \n\n  \/\/ cannot get there\n  Fatal(\"GetLocationScale\", \"Condition failed.\");\n  return AliMpIntPair();\n}\n\n\n\/\/_____________________________________________________________________________\nAliMpSectorSegmentation* \nAliMpPlaneSegmentation::GetSectorSegmentation(const AliMpIntPair& scale) const\n{    \n\/\/ Returns front sector or back sector segmentation\n\/\/ according to quadrant specified by scale.\n\/\/ ---\n\n  if (scale.GetFirst()*scale.GetSecond() > 0) {\n    \/\/ quadrant I or III\n    return fFrontSectorSegmentation;\n  }  \n  else  {\n    \/\/ quadrant II or IV\n    return fBackSectorSegmentation;\n  }  \n}\n\n\/\/_____________________________________________________________________________\nAliMpSectorSegmentation* \nAliMpPlaneSegmentation::GetSectorSegmentation(Int_t motifPositionId) const\n{    \n\/\/ Returns front sector or back sector segmentation\n\/\/ according to specified motifPositionId\n\/\/ ---\n\n  if (fFrontSectorSegmentation->HasMotifPosition(motifPositionId))\n    return fFrontSectorSegmentation;\n  else if (fBackSectorSegmentation->HasMotifPosition(motifPositionId)) \n    return fBackSectorSegmentation;\n  else {\n    Fatal(\"GetSectorSegmentation\", \"Motif position not found.\");\n    return 0;\n  }\n}\n\n\/\/\n\/\/ public methods\n\/\/\n\n\/\/_____________________________________________________________________________\nAliMpVPadIterator* \nAliMpPlaneSegmentation::CreateIterator(const AliMpArea& area) const\n{\n\/\/ Creates the are iterator. \n\/\/ (The inherited method cannot be used)\n\/\/ ---\n\n  return new AliMpPlaneAreaPadIterator(this, area);  \n}   \n  \n\/\/______________________________________________________________________________\nAliMpPad AliMpPlaneSegmentation::PadByLocation(const AliMpIntPair& location, \n                                       Bool_t warning) const\n{\n\/\/ Find the pad which corresponds to the given location\n\/\/ ---\n\n  \/\/ Get segmentation\n  AliMpSectorSegmentation* segmentation \n    = GetSectorSegmentation(TMath::Abs(location.GetFirst()));\n\n  \/\/ Get pad in the segmentation\n  AliMpPad pad\n     = segmentation\n       ->PadByLocation(\n           AliMpIntPair(TMath::Abs(location.GetFirst()),location.GetSecond()));\n\n\n  \/\/ Get transformation\n  AliMpIntPair scale  = GetLocationScale(location);\n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n  \n  \/\/ Transform pad characteristics\n  return kTransformer->Transform(pad);\t      \n}\n\n\/\/______________________________________________________________________________\nAliMpPad AliMpPlaneSegmentation::PadByIndices (const AliMpIntPair& indices,\n                                               Bool_t warning ) const\n{\n\/\/ Find the pad which corresponds to the given indices  \n\/\/\n\n  AliMpIntPair scale = GetScale(indices);\n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n\n  AliMpIntPair scaledIndices = kTransformer->Scale(indices);\n  AliMpPad pad \n    = GetSectorSegmentation(scale)->PadByIndices(scaledIndices, warning);\n    \n  return kTransformer->Transform(pad);\t      \n}\n\n\/\/_____________________________________________________________________________\nAliMpPad AliMpPlaneSegmentation::PadByPosition(const TVector2& position,\n                                               Bool_t warning) const\n{\n\/\/ Find the pad which corresponds to the given position\n\/\/ ---\n\n  AliMpIntPair scale = GetScale(position);\n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n\n  TVector2 scaledPosition = kTransformer->ITransform(position);  \n  AliMpPad pad \n    = GetSectorSegmentation(scale)->PadByPosition(scaledPosition, warning);\n  \n  return kTransformer->Transform(pad);\t      \n}\n\n\/\/_____________________________________________________________________________\nBool_t AliMpPlaneSegmentation::HasPad(const AliMpIntPair& indices) const\n{\n\/\/ Does the pad located by <indices> exists ?\n\/\/ ---\n\n  AliMpIntPair scale = GetScale(indices);\n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n\n  AliMpIntPair scaledIndices = kTransformer->Scale(indices);\n\n  return GetSectorSegmentation(scale)->HasPad(scaledIndices);\n}\n\n\/\/_____________________________________________________________________________\nInt_t AliMpPlaneSegmentation::Zone(const AliMpPad& pad, Bool_t warning) const\n{\n\/\/ Returns the zone index of the zone containing the specified pad.\n\/\/ This zone index is different from the zone ID,\n\/\/ as it is unique for each pad dimensions.\n\/\/ It is composed in this way:\n\/\/   sectorID*100 + zoneID*10 + specific index \n\/\/ Where sectorID = 0,1 for front\/back sector.\n\/\/ Specific index is present only for zones containing special motifs.\n\/\/ ---\n\n  if (!pad.IsValid()) {\n    if (warning) Warning(\"Zone(AliMpPad)\", \"Invalid pad\");\n    return 0;\n  }  \n\n  AliMpIntPair scale = GetScale(pad.GetIndices());  \n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n\n  AliMpPad scaledPad = kTransformer->ITransform(pad);\n  \n  AliMpSectorSegmentation* segmentation = GetSectorSegmentation(scale);\n  Int_t zoneID = segmentation->Zone(scaledPad, warning);\n  \n  \/\/ Distinguish zones from front\/back sector\n  \/\/ For back sector - add 10\n  if (segmentation == fBackSectorSegmentation) zoneID += 100;\n\n  return zoneID;\n}  \n\n\/\/_____________________________________________________________________________\nTVector2 \nAliMpPlaneSegmentation::PadDimensions(Int_t zone, Bool_t warning) const\n{\n\/\/ Returns the pad dimensions for the zone with the specified zone index.\n\/\/ ---\n\n  if (zone < 100)\n    return fFrontSectorSegmentation->PadDimensions(zone, warning);\n  else  \n    return fBackSectorSegmentation->PadDimensions(zone - 100, warning);\n}  \n\n\/\/_____________________________________________________________________________\nBool_t AliMpPlaneSegmentation::CircleTest(const AliMpIntPair& indices) const\n{\n\/\/ Verifies that all methods for retrieving pads are consistents between them.\n\/\/ Returns true if the pad with specified indices was found and verified,\n\/\/ false otherwise.\n\/\/ ---\n\n  if (!HasPad(indices)) return false;\n\n  \/\/ Verify the indice->location->position->indice way\n  AliMpIntPair location = PadByIndices(indices).GetLocation();\n  TVector2 position = PadByLocation(location).Position();\n  AliMpIntPair retIndices = PadByPosition(position).GetIndices();\n    \n  if (retIndices != indices) {\n    cout << \"Pad \" << indices << \" lead to inconsistency\" << endl;\n    cout << \"in indice->location->position->indice way...\" << endl;\n    cout << \"starting from \" << indices << \"-->\" << location << \"-->\" \n         << '(' << position.X() << ',' << position.Y() << ')'\n         << \" and retIndices: \" << retIndices << endl;\n  }\n    \n    \n  \/\/ Verify the indice->position->location->indice way    \n  position = PadByIndices(indices).Position();\n  location = PadByPosition(position).GetLocation();\n  retIndices = PadByLocation(location).GetIndices();\n\n  if (retIndices != indices) {\n    cout << \"Pad \" << indices << \" lead to inconsistency\" << endl;\n    cout << \"in indice->position->location->indice way...\" <<endl;\n    cout << \"starting from \" << indices \n         << \" and retIndices: \" << retIndices << endl;\n  }\n  \n  return true;\n\n}\n\n\/\/_____________________________________________________________________________\nInt_t AliMpPlaneSegmentation::GetNofTransformers() const\n{\n\/\/ Returns number of transformers.\n\/\/ ---\n\n  return fTransformers.size();\n}  \n\n\n\/\/_____________________________________________________________________________\nAliMpTransformer* AliMpPlaneSegmentation::GetTransformer(Int_t i) const\n{\n\/\/ Returns i-th transformer.\n\/\/ ---\n \n  return  fTransformers[i];\n}     \n\n\n<commit_msg>PadByLocation() - pass warning parameter to sector segmentation (I.Hrivnacova)<commit_after>\/\/ $Id$\n\/\/ Category: plane\n\/\/\n\/\/ Class AliMpPlaneSegmentation\n\/\/ ----------------------------\n\/\/ Class describing the segmentation of the plane.\n\/\/\n\/\/ Transformation of pad characteristics according to sectors:\n\/\/\n\/\/   I.  ( posId,  Guassi ), ( i, j), ( x, y)         II. |  I.\n\/\/  II.  ( posId', Guassi'), (-i, j), (-x, y)       _____ | ____\n\/\/ III.  (-posId,  Guassi),  (-i,-j), (-x,-y)             |\n\/\/  IV.  (-posId', Guassi'), ( i,-j), ( x,-y)        III. |  IV.\n\/\/   \n\/\/ Where (posId', Guassi') is the location of the pad\n\/\/ in the clipped sector.\n\/\/\n\/\/ Authors: David Guez, Ivana Hrivnacova; IPN Orsay\n\n#include <Riostream.h>\n#include <TMath.h>\n\n#include \"AliMpPlaneSegmentation.h\"\n#include \"AliMpPlaneAreaPadIterator.h\"\n#include \"AliMpPlane.h\"\n#include \"AliMpSectorPosition.h\"\n#include \"AliMpSectorSegmentation.h\"\n\nClassImp(AliMpPlaneSegmentation)\n\n\/\/_____________________________________________________________________________\nAliMpPlaneSegmentation::AliMpPlaneSegmentation(const AliMpPlane* plane) \n  : AliMpVSegmentation(),\n    fkPlane(plane),\n    fFrontSectorSegmentation(0),\n    fBackSectorSegmentation(0)\n{\n\/\/\n  fFrontSectorSegmentation = new AliMpSectorSegmentation(plane->GetFrontSector());\n  fBackSectorSegmentation = new AliMpSectorSegmentation(plane->GetBackSector());\n  \n  for (Int_t i=0; i<fkPlane->GetNofSectorPositions(); i++) {\n    fTransformers.push_back(\n      new AliMpTransformer(fkPlane->GetSectorPosition(i)->GetOffset(),\n                           fkPlane->GetSectorPosition(i)->GetScale()));\n  }\t\t       \n}\n\n\/\/\/_____________________________________________________________________________\nAliMpPlaneSegmentation::AliMpPlaneSegmentation() \n  : AliMpVSegmentation(),\n    fkPlane(0),\n    fFrontSectorSegmentation(0),\n    fBackSectorSegmentation(0)\n{\n\/\/\n}\n\n\/\/_____________________________________________________________________________\nAliMpPlaneSegmentation::~AliMpPlaneSegmentation() {\n\/\/ \n  delete fFrontSectorSegmentation;\n  delete fBackSectorSegmentation;\n\n  for (Int_t i=0; i<GetNofTransformers(); i++) \n    delete GetTransformer(i);\n}\n\n\/\/\n\/\/ private methods\n\/\/\n\n\/\/_____________________________________________________________________________\nconst AliMpTransformer* \nAliMpPlaneSegmentation::GetTransformer(const AliMpIntPair& scale) const\n{\n\/\/ Returns the sector position specified by scale.\n\/\/ ---\n\n  for (UInt_t i=0; i<fTransformers.size(); i++) \n    if (fTransformers[i]->GetScale() == scale) return fTransformers[i];\n\n  Fatal(\"GetTransformer\", \"Wrong scale\");\n  return 0; \n}\n\n\/\/_____________________________________________________________________________\nAliMpIntPair AliMpPlaneSegmentation::GetScale(const AliMpIntPair& pair) const\n{\n\/\/ Returns pair of the signs of the values of the given pair.\n\/\/ ---\n\n  AliMpIntPair scale(1, 1);\n  \n  if (pair.GetFirst() < 0)  scale.SetFirst(-1);\n  if (pair.GetSecond() < 0) scale.SetSecond(-1);\n  \n  return scale;\n}\n\n\/\/_____________________________________________________________________________\nAliMpIntPair AliMpPlaneSegmentation::GetScale(const TVector2& vector) const\n{\n\/\/ Returns pair of the signs of the values of the given vector.\n\/\/ ---\n\n  AliMpIntPair scale(1, 1);\n  \n  if (vector.X() < 0) scale.SetFirst(-1);\n  if (vector.Y() < 0) scale.SetSecond(-1);\n  \n  return scale;\n}\n\n\/\/_____________________________________________________________________________\nAliMpIntPair \nAliMpPlaneSegmentation::GetLocationScale(const AliMpIntPair& location) const\n{\n\/\/ Returns the scale transformation of the specified location. \n\/\/ ---\n\n  \/\/ Find the sector\n  Bool_t inFront;\n  if (fFrontSectorSegmentation\n        ->HasMotifPosition(TMath::Abs(location.GetFirst())))\n    inFront = true;\n  else if (fBackSectorSegmentation\n             ->HasMotifPosition(TMath::Abs(location.GetFirst())))  \n    inFront = false;\n  else {\n    Fatal(\"GetLocationScale\", \"Motif position not found.\");\n    return AliMpIntPair();\n  }  \n    \n  if      (inFront  && location.GetFirst() > 0) return  AliMpIntPair(1, 1); \n  else if (inFront  && location.GetFirst() < 0) return  AliMpIntPair(-1, -1);\n  else if (!inFront && location.GetFirst() > 0) return  AliMpIntPair(-1, 1);\n  else if (!inFront && location.GetFirst() < 0) return  AliMpIntPair( 1,-1);  \n\n  \/\/ cannot get there\n  Fatal(\"GetLocationScale\", \"Condition failed.\");\n  return AliMpIntPair();\n}\n\n\n\/\/_____________________________________________________________________________\nAliMpSectorSegmentation* \nAliMpPlaneSegmentation::GetSectorSegmentation(const AliMpIntPair& scale) const\n{    \n\/\/ Returns front sector or back sector segmentation\n\/\/ according to quadrant specified by scale.\n\/\/ ---\n\n  if (scale.GetFirst()*scale.GetSecond() > 0) {\n    \/\/ quadrant I or III\n    return fFrontSectorSegmentation;\n  }  \n  else  {\n    \/\/ quadrant II or IV\n    return fBackSectorSegmentation;\n  }  \n}\n\n\/\/_____________________________________________________________________________\nAliMpSectorSegmentation* \nAliMpPlaneSegmentation::GetSectorSegmentation(Int_t motifPositionId) const\n{    \n\/\/ Returns front sector or back sector segmentation\n\/\/ according to specified motifPositionId\n\/\/ ---\n\n  if (fFrontSectorSegmentation->HasMotifPosition(motifPositionId))\n    return fFrontSectorSegmentation;\n  else if (fBackSectorSegmentation->HasMotifPosition(motifPositionId)) \n    return fBackSectorSegmentation;\n  else {\n    Fatal(\"GetSectorSegmentation\", \"Motif position not found.\");\n    return 0;\n  }\n}\n\n\/\/\n\/\/ public methods\n\/\/\n\n\/\/_____________________________________________________________________________\nAliMpVPadIterator* \nAliMpPlaneSegmentation::CreateIterator(const AliMpArea& area) const\n{\n\/\/ Creates the are iterator. \n\/\/ (The inherited method cannot be used)\n\/\/ ---\n\n  return new AliMpPlaneAreaPadIterator(this, area);  \n}   \n  \n\/\/______________________________________________________________________________\nAliMpPad AliMpPlaneSegmentation::PadByLocation(const AliMpIntPair& location, \n                                       Bool_t warning) const\n{\n\/\/ Find the pad which corresponds to the given location\n\/\/ ---\n\n  \/\/ Get segmentation\n  AliMpSectorSegmentation* segmentation \n    = GetSectorSegmentation(TMath::Abs(location.GetFirst()));\n\n  \/\/ Get pad in the segmentation\n  AliMpPad pad\n     = segmentation\n       ->PadByLocation(\n           AliMpIntPair(TMath::Abs(location.GetFirst()),location.GetSecond()), \n\t                warning);\n\n  \/\/ Get transformation\n  AliMpIntPair scale  = GetLocationScale(location);\n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n  \n  \/\/ Transform pad characteristics\n  return kTransformer->Transform(pad);\t      \n}\n\n\/\/______________________________________________________________________________\nAliMpPad AliMpPlaneSegmentation::PadByIndices (const AliMpIntPair& indices,\n                                               Bool_t warning ) const\n{\n\/\/ Find the pad which corresponds to the given indices  \n\/\/\n\n  AliMpIntPair scale = GetScale(indices);\n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n\n  AliMpIntPair scaledIndices = kTransformer->Scale(indices);\n  AliMpPad pad \n    = GetSectorSegmentation(scale)->PadByIndices(scaledIndices, warning);\n    \n  return kTransformer->Transform(pad);\t      \n}\n\n\/\/_____________________________________________________________________________\nAliMpPad AliMpPlaneSegmentation::PadByPosition(const TVector2& position,\n                                               Bool_t warning) const\n{\n\/\/ Find the pad which corresponds to the given position\n\/\/ ---\n\n  AliMpIntPair scale = GetScale(position);\n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n\n  TVector2 scaledPosition = kTransformer->ITransform(position);  \n  AliMpPad pad \n    = GetSectorSegmentation(scale)->PadByPosition(scaledPosition, warning);\n  \n  return kTransformer->Transform(pad);\t      \n}\n\n\/\/_____________________________________________________________________________\nBool_t AliMpPlaneSegmentation::HasPad(const AliMpIntPair& indices) const\n{\n\/\/ Does the pad located by <indices> exists ?\n\/\/ ---\n\n  AliMpIntPair scale = GetScale(indices);\n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n\n  AliMpIntPair scaledIndices = kTransformer->Scale(indices);\n\n  return GetSectorSegmentation(scale)->HasPad(scaledIndices);\n}\n\n\/\/_____________________________________________________________________________\nInt_t AliMpPlaneSegmentation::Zone(const AliMpPad& pad, Bool_t warning) const\n{\n\/\/ Returns the zone index of the zone containing the specified pad.\n\/\/ This zone index is different from the zone ID,\n\/\/ as it is unique for each pad dimensions.\n\/\/ It is composed in this way:\n\/\/   sectorID*100 + zoneID*10 + specific index \n\/\/ Where sectorID = 0,1 for front\/back sector.\n\/\/ Specific index is present only for zones containing special motifs.\n\/\/ ---\n\n  if (!pad.IsValid()) {\n    if (warning) Warning(\"Zone(AliMpPad)\", \"Invalid pad\");\n    return 0;\n  }  \n\n  AliMpIntPair scale = GetScale(pad.GetIndices());  \n  const AliMpTransformer* kTransformer = GetTransformer(scale);\n\n  AliMpPad scaledPad = kTransformer->ITransform(pad);\n  \n  AliMpSectorSegmentation* segmentation = GetSectorSegmentation(scale);\n  Int_t zoneID = segmentation->Zone(scaledPad, warning);\n  \n  \/\/ Distinguish zones from front\/back sector\n  \/\/ For back sector - add 10\n  if (segmentation == fBackSectorSegmentation) zoneID += 100;\n\n  return zoneID;\n}  \n\n\/\/_____________________________________________________________________________\nTVector2 \nAliMpPlaneSegmentation::PadDimensions(Int_t zone, Bool_t warning) const\n{\n\/\/ Returns the pad dimensions for the zone with the specified zone index.\n\/\/ ---\n\n  if (zone < 100)\n    return fFrontSectorSegmentation->PadDimensions(zone, warning);\n  else  \n    return fBackSectorSegmentation->PadDimensions(zone - 100, warning);\n}  \n\n\/\/_____________________________________________________________________________\nBool_t AliMpPlaneSegmentation::CircleTest(const AliMpIntPair& indices) const\n{\n\/\/ Verifies that all methods for retrieving pads are consistents between them.\n\/\/ Returns true if the pad with specified indices was found and verified,\n\/\/ false otherwise.\n\/\/ ---\n\n  if (!HasPad(indices)) return false;\n\n  \/\/ Verify the indice->location->position->indice way\n  AliMpIntPair location = PadByIndices(indices).GetLocation();\n  TVector2 position = PadByLocation(location).Position();\n  AliMpIntPair retIndices = PadByPosition(position).GetIndices();\n    \n  if (retIndices != indices) {\n    cout << \"Pad \" << indices << \" lead to inconsistency\" << endl;\n    cout << \"in indice->location->position->indice way...\" << endl;\n    cout << \"starting from \" << indices << \"-->\" << location << \"-->\" \n         << '(' << position.X() << ',' << position.Y() << ')'\n         << \" and retIndices: \" << retIndices << endl;\n  }\n    \n    \n  \/\/ Verify the indice->position->location->indice way    \n  position = PadByIndices(indices).Position();\n  location = PadByPosition(position).GetLocation();\n  retIndices = PadByLocation(location).GetIndices();\n\n  if (retIndices != indices) {\n    cout << \"Pad \" << indices << \" lead to inconsistency\" << endl;\n    cout << \"in indice->position->location->indice way...\" <<endl;\n    cout << \"starting from \" << indices \n         << \" and retIndices: \" << retIndices << endl;\n  }\n  \n  return true;\n\n}\n\n\/\/_____________________________________________________________________________\nInt_t AliMpPlaneSegmentation::GetNofTransformers() const\n{\n\/\/ Returns number of transformers.\n\/\/ ---\n\n  return fTransformers.size();\n}  \n\n\n\/\/_____________________________________________________________________________\nAliMpTransformer* AliMpPlaneSegmentation::GetTransformer(Int_t i) const\n{\n\/\/ Returns i-th transformer.\n\/\/ ---\n \n  return  fTransformers[i];\n}     \n\n\n<|endoftext|>"}
{"text":"<commit_before>\n<commit_msg>Delete 1.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*ckwg +5\n * Copyright 2011 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 <boost\/python\/def.hpp>\n#include <boost\/python\/module.hpp>\n\n#include <vil\/vil_image_view.h>\n\n\/**\n * \\file test_image.cxx\n *\n * \\brief Python bindings for image testing pipelines.\n *\/\n\nusing namespace boost::python;\n\ntemplate <typename T>\nstatic vil_image_view<T> make_image(size_t width, size_t height, size_t planes);\ntemplate <typename T>\nstatic size_t take_image(vil_image_view<T> const& img);\n\nBOOST_PYTHON_MODULE(test_image)\n{\n#define DEFINE_FUNCTIONS(type)                       \\\n  do                                                 \\\n  {                                                  \\\n    def(\"make_image_\" #type, &make_image<type>       \\\n      , (arg(\"width\"), arg(\"height\"), arg(\"planes\")) \\\n      , \"Create a \" #type \" image.\");                \\\n    def(\"take_image_\" #type, &take_image<type>       \\\n      , (arg(\"image\")) \\\n      , \"Take a \" #type \" image and return its size.\");                \\\n  } while (false)\n\n  DEFINE_FUNCTIONS(bool);\n  DEFINE_FUNCTIONS(uint8_t);\n  DEFINE_FUNCTIONS(float);\n  DEFINE_FUNCTIONS(double);\n\n#undef DEFINE_FUNCTIONS\n}\n\ntemplate <typename T>\nvil_image_view<T>\nmake_image(size_t width, size_t height, size_t planes)\n{\n  return vil_image_view<T>(width, height, planes);\n}\n\ntemplate <typename T>\nsize_t\ntake_image(vil_image_view<T> const& img)\n{\n  size_t const ni = img.ni();\n  size_t const nj = img.nj();\n  size_t const np = img.nplanes();\n\n  return (ni * nj * np);\n}\n<commit_msg>Add a wrapper for saving images<commit_after>\/*ckwg +5\n * Copyright 2011 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 <boost\/python\/def.hpp>\n#include <boost\/python\/module.hpp>\n\n#include <vil\/vil_image_view.h>\n#include <vil\/vil_save.h>\n\n\/**\n * \\file test_image.cxx\n *\n * \\brief Python bindings for image testing pipelines.\n *\/\n\nusing namespace boost::python;\n\ntemplate <typename T>\nstatic vil_image_view<T> make_image(size_t width, size_t height, size_t planes);\ntemplate <typename T>\nstatic size_t take_image(vil_image_view<T> const& img);\ntemplate <typename T>\nstatic bool save_image(vil_image_view<T> const& img, std::string const& path);\n\nBOOST_PYTHON_MODULE(test_image)\n{\n#define DEFINE_FUNCTIONS(type)                             \\\n  do                                                       \\\n  {                                                        \\\n    def(\"make_image_\" #type, &make_image<type>             \\\n      , (arg(\"width\"), arg(\"height\"), arg(\"planes\"))       \\\n      , \"Create a \" #type \" image.\");                      \\\n    def(\"take_image_\" #type, &take_image<type>             \\\n      , (arg(\"image\"))                                     \\\n      , \"Take a \" #type \" image and return its size.\");    \\\n    def(\"save_image_\" #type, &save_image<type>             \\\n      , (arg(\"image\"), arg(\"path\"))                        \\\n      , \"Take a \" #type \" image and write it to a file.\"); \\\n  } while (false)\n\n  DEFINE_FUNCTIONS(bool);\n  DEFINE_FUNCTIONS(uint8_t);\n  DEFINE_FUNCTIONS(float);\n  DEFINE_FUNCTIONS(double);\n\n#undef DEFINE_FUNCTIONS\n}\n\ntemplate <typename T>\nvil_image_view<T>\nmake_image(size_t width, size_t height, size_t planes)\n{\n  return vil_image_view<T>(width, height, planes);\n}\n\ntemplate <typename T>\nsize_t\ntake_image(vil_image_view<T> const& img)\n{\n  size_t const ni = img.ni();\n  size_t const nj = img.nj();\n  size_t const np = img.nplanes();\n\n  return (ni * nj * np);\n}\n\ntemplate <typename T>\nbool\nsave_image(vil_image_view<T> const& img, std::string const& path)\n{\n  return vil_save(img, path.c_str());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"askpassphrasedialog.h\"\n#include \"ui_askpassphrasedialog.h\"\n\n#include \"guiconstants.h\"\n#include \"walletmodel.h\"\n\n#include <QMessageBox>\n#include <QPushButton>\n#include <QKeyEvent>\n\nextern bool fWalletUnlockStakingOnly;\n\nAskPassphraseDialog::AskPassphraseDialog(Mode mode, QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::AskPassphraseDialog),\n    mode(mode),\n    model(0),\n    fCapsLock(false)\n{\n    ui->setupUi(this);\n    ui->passEdit1->setMaxLength(MAX_PASSPHRASE_SIZE);\n    ui->passEdit2->setMaxLength(MAX_PASSPHRASE_SIZE);\n    ui->passEdit3->setMaxLength(MAX_PASSPHRASE_SIZE);\n    \n    \/\/ Setup Caps Lock detection.\n    ui->passEdit1->installEventFilter(this);\n    ui->passEdit2->installEventFilter(this);\n    ui->passEdit3->installEventFilter(this);\n\n    ui->stakingCheckBox->setChecked(fWalletUnlockStakingOnly);\n\n    switch(mode)\n    {\n        case Encrypt: \/\/ Ask passphrase x2\n            ui->passLabel1->hide();\n            ui->passEdit1->hide();\n            ui->warningLabel->setText(tr(\"Enter the new passphrase to the wallet.<br\/>Please use a passphrase of <b>10 or more random characters<\/b>, or <b>eight or more words<\/b>.\"));\n            setWindowTitle(tr(\"Encrypt wallet\"));\n            break;\n        case UnlockStaking:\n            ui->stakingCheckBox->setChecked(true);\n            ui->stakingCheckBox->show();\n            \/\/ fallthru\n        case Unlock: \/\/ Ask passphrase\n            ui->warningLabel->setText(tr(\"This operation needs your wallet passphrase to unlock the wallet.\"));\n            ui->passLabel2->hide();\n            ui->passEdit2->hide();\n            ui->passLabel3->hide();\n            ui->passEdit3->hide();\n            setWindowTitle(tr(\"Unlock wallet\"));\n            break;\n        case Decrypt:   \/\/ Ask passphrase\n            ui->warningLabel->setText(tr(\"This operation needs your wallet passphrase to decrypt the wallet.\"));\n            ui->passLabel2->hide();\n            ui->passEdit2->hide();\n            ui->passLabel3->hide();\n            ui->passEdit3->hide();\n            setWindowTitle(tr(\"Decrypt wallet\"));\n            break;\n        case ChangePass: \/\/ Ask old passphrase + new passphrase x2\n            setWindowTitle(tr(\"Change passphrase\"));\n            ui->warningLabel->setText(tr(\"Enter the old and new passphrase to the wallet.\"));\n            break;\n    }\n\n    textChanged();\n    connect(ui->passEdit1, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n    connect(ui->passEdit2, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n    connect(ui->passEdit3, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n}\n\nAskPassphraseDialog::~AskPassphraseDialog()\n{\n    secureClearPassFields();\n    delete ui;\n}\n\nvoid AskPassphraseDialog::setModel(WalletModel *model)\n{\n    this->model = model;\n}\n\nvoid AskPassphraseDialog::accept()\n{\n    SecureString oldpass, newpass1, newpass2;\n    if(!model)\n        return;\n    oldpass.reserve(MAX_PASSPHRASE_SIZE);\n    newpass1.reserve(MAX_PASSPHRASE_SIZE);\n    newpass2.reserve(MAX_PASSPHRASE_SIZE);\n    \/\/ TODO: get rid of this .c_str() by implementing SecureString::operator=(std::string)\n    \/\/ Alternately, find a way to make this input mlock()'d to begin with.\n    oldpass.assign(ui->passEdit1->text().toStdString().c_str());\n    newpass1.assign(ui->passEdit2->text().toStdString().c_str());\n    newpass2.assign(ui->passEdit3->text().toStdString().c_str());\n\n    secureClearPassFields();\n\n    switch(mode)\n    {\n    case Encrypt: {\n        if(newpass1.empty() || newpass2.empty())\n        {\n            \/\/ Cannot encrypt with empty passphrase\n            break;\n        }\n        QMessageBox::StandardButton retval = QMessageBox::question(this, tr(\"Confirm wallet encryption\"),\n                 tr(\"Warning: If you encrypt your wallet and lose your passphrase, you will <b>LOSE ALL OF YOUR COINS<\/b>!\") + \"<br><br>\" + tr(\"Are you sure you wish to encrypt your wallet?\"),\n                 QMessageBox::Yes|QMessageBox::Cancel,\n                 QMessageBox::Cancel);\n        if(retval == QMessageBox::Yes)\n        {\n            if(newpass1 == newpass2)\n            {\n                if(model->setWalletEncrypted(true, newpass1))\n                {\n                    QMessageBox::warning(this, tr(\"Wallet encrypted\"),\n                                         \"<qt>\" + \n                                         tr(\"Munne will close now to finish the encryption process. \"\n                                         \"Remember that encrypting your wallet cannot fully protect \"\n                                         \"your coins from being stolen by malware infecting your computer.\") + \n                                         \"<br><br><b>\" + \n                                         tr(\"IMPORTANT: Any previous backups you have made of your wallet file \"\n                                         \"should be replaced with the newly generated, encrypted wallet file. \"\n                                         \"For security reasons, previous backups of the unencrypted wallet file \"\n                                         \"will become useless as soon as you start using the new, encrypted wallet.\") + \n                                         \"<\/b><\/qt>\");\n                    QApplication::quit();\n                }\n                else\n                {\n                    QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n                                         tr(\"Wallet encryption failed due to an internal error. Your wallet was not encrypted.\"));\n                }\n                QDialog::accept(); \/\/ Success\n            }\n            else\n            {\n                QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n                                     tr(\"The supplied passphrases do not match.\"));\n            }\n        }\n        else\n        {\n            QDialog::reject(); \/\/ Cancelled\n        }\n        } break;\n    case UnlockStaking:\n    case Unlock:\n        if(!model->setWalletLocked(false, oldpass))\n        {\n            QMessageBox::critical(this, tr(\"Wallet unlock failed\"),\n                                  tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n        }\n        else\n        {\n            fWalletUnlockStakingOnly = ui->stakingCheckBox->isChecked();\n            QDialog::accept(); \/\/ Success\n        }\n        break;\n    case Decrypt:\n        if(!model->setWalletEncrypted(false, oldpass))\n        {\n            QMessageBox::critical(this, tr(\"Wallet decryption failed\"),\n                                  tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n        }\n        else\n        {\n            QDialog::accept(); \/\/ Success\n        }\n        break;\n    case ChangePass:\n        if(newpass1 == newpass2)\n        {\n            if(model->changePassphrase(oldpass, newpass1))\n            {\n                QMessageBox::information(this, tr(\"Wallet encrypted\"),\n                                     tr(\"Wallet passphrase was successfully changed.\"));\n                QDialog::accept(); \/\/ Success\n            }\n            else\n            {\n                QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n                                     tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n            }\n        }\n        else\n        {\n            QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n                                 tr(\"The supplied passphrases do not match.\"));\n        }\n        break;\n    }\n}\n\nvoid AskPassphraseDialog::textChanged()\n{\n    \/\/ Validate input, set Ok button to enabled when acceptable\n    bool acceptable = false;\n    switch(mode)\n    {\n    case Encrypt: \/\/ New passphrase x2\n        acceptable = !ui->passEdit2->text().isEmpty() && !ui->passEdit3->text().isEmpty();\n        break;\n    case UnlockStaking:\n    case Unlock: \/\/ Old passphrase x1\n    case Decrypt:\n        acceptable = !ui->passEdit1->text().isEmpty();\n        break;\n    case ChangePass: \/\/ Old passphrase x1, new passphrase x2\n        acceptable = !ui->passEdit1->text().isEmpty() && !ui->passEdit2->text().isEmpty() && !ui->passEdit3->text().isEmpty();\n        break;\n    }\n    ui->buttonBox->button(QDialogButtonBox::Ok)->setEnabled(acceptable);\n}\n\nbool AskPassphraseDialog::event(QEvent *event)\n{\n    \/\/ Detect Caps Lock key press.\n    if (event->type() == QEvent::KeyPress) {\n        QKeyEvent *ke = static_cast<QKeyEvent *>(event);\n        if (ke->key() == Qt::Key_CapsLock) {\n            fCapsLock = !fCapsLock;\n        }\n        if (fCapsLock) {\n            ui->capsLabel->setText(tr(\"Warning: The Caps Lock key is on!\"));\n        } else {\n            ui->capsLabel->clear();\n        }\n    }\n    return QWidget::event(event);\n}\n\nbool AskPassphraseDialog::eventFilter(QObject *object, QEvent *event)\n{\n    \/* Detect Caps Lock.\n     * There is no good OS-independent way to check a key state in Qt, but we\n     * can detect Caps Lock by checking for the following condition:\n     * Shift key is down and the result is a lower case character, or\n     * Shift key is not down and the result is an upper case character.\n     *\/\n    if (event->type() == QEvent::KeyPress) {\n        QKeyEvent *ke = static_cast<QKeyEvent *>(event);\n        QString str = ke->text();\n        if (str.length() != 0) {\n            const QChar *psz = str.unicode();\n            bool fShift = (ke->modifiers() & Qt::ShiftModifier) != 0;\n            if ((fShift && psz->isLower()) || (!fShift && psz->isUpper())) {\n                fCapsLock = true;\n                ui->capsLabel->setText(tr(\"Warning: The Caps Lock key is on!\"));\n            } else if (psz->isLetter()) {\n                fCapsLock = false;\n                ui->capsLabel->clear();\n            }\n        }\n    }\n    return QDialog::eventFilter(object, event);\n}\n\nvoid AskPassphraseDialog::secureClearPassFields()\n{\n    \/\/ Attempt to overwrite text so that they do not linger around in memory\n    ui->passEdit1->setText(QString(\" \").repeated(ui->passEdit1->text().size()));\n    ui->passEdit2->setText(QString(\" \").repeated(ui->passEdit2->text().size()));\n    ui->passEdit3->setText(QString(\" \").repeated(ui->passEdit3->text().size()));\n\n    ui->passEdit1->clear();\n    ui->passEdit2->clear();\n    ui->passEdit3->clear();\n}\n<commit_msg>Consistent lettering<commit_after>#include \"askpassphrasedialog.h\"\n#include \"ui_askpassphrasedialog.h\"\n\n#include \"guiconstants.h\"\n#include \"walletmodel.h\"\n\n#include <QMessageBox>\n#include <QPushButton>\n#include <QKeyEvent>\n\nextern bool fWalletUnlockStakingOnly;\n\nAskPassphraseDialog::AskPassphraseDialog(Mode mode, QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::AskPassphraseDialog),\n    mode(mode),\n    model(0),\n    fCapsLock(false)\n{\n    ui->setupUi(this);\n    ui->passEdit1->setMaxLength(MAX_PASSPHRASE_SIZE);\n    ui->passEdit2->setMaxLength(MAX_PASSPHRASE_SIZE);\n    ui->passEdit3->setMaxLength(MAX_PASSPHRASE_SIZE);\n    \n    \/\/ Setup Caps Lock detection.\n    ui->passEdit1->installEventFilter(this);\n    ui->passEdit2->installEventFilter(this);\n    ui->passEdit3->installEventFilter(this);\n\n    ui->stakingCheckBox->setChecked(fWalletUnlockStakingOnly);\n\n    switch(mode)\n    {\n        case Encrypt: \/\/ Ask passphrase x2\n            ui->passLabel1->hide();\n            ui->passEdit1->hide();\n            ui->warningLabel->setText(tr(\"Enter the new passphrase to the wallet.<br\/>Please use a passphrase of <b>ten or more random characters<\/b>, or <b>eight or more words<\/b>.\"));\n            setWindowTitle(tr(\"Encrypt wallet\"));\n            break;\n        case UnlockStaking:\n            ui->stakingCheckBox->setChecked(true);\n            ui->stakingCheckBox->show();\n            \/\/ fallthru\n        case Unlock: \/\/ Ask passphrase\n            ui->warningLabel->setText(tr(\"This operation needs your wallet passphrase to unlock the wallet.\"));\n            ui->passLabel2->hide();\n            ui->passEdit2->hide();\n            ui->passLabel3->hide();\n            ui->passEdit3->hide();\n            setWindowTitle(tr(\"Unlock wallet\"));\n            break;\n        case Decrypt:   \/\/ Ask passphrase\n            ui->warningLabel->setText(tr(\"This operation needs your wallet passphrase to decrypt the wallet.\"));\n            ui->passLabel2->hide();\n            ui->passEdit2->hide();\n            ui->passLabel3->hide();\n            ui->passEdit3->hide();\n            setWindowTitle(tr(\"Decrypt wallet\"));\n            break;\n        case ChangePass: \/\/ Ask old passphrase + new passphrase x2\n            setWindowTitle(tr(\"Change passphrase\"));\n            ui->warningLabel->setText(tr(\"Enter the old and new passphrase to the wallet.\"));\n            break;\n    }\n\n    textChanged();\n    connect(ui->passEdit1, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n    connect(ui->passEdit2, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n    connect(ui->passEdit3, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n}\n\nAskPassphraseDialog::~AskPassphraseDialog()\n{\n    secureClearPassFields();\n    delete ui;\n}\n\nvoid AskPassphraseDialog::setModel(WalletModel *model)\n{\n    this->model = model;\n}\n\nvoid AskPassphraseDialog::accept()\n{\n    SecureString oldpass, newpass1, newpass2;\n    if(!model)\n        return;\n    oldpass.reserve(MAX_PASSPHRASE_SIZE);\n    newpass1.reserve(MAX_PASSPHRASE_SIZE);\n    newpass2.reserve(MAX_PASSPHRASE_SIZE);\n    \/\/ TODO: get rid of this .c_str() by implementing SecureString::operator=(std::string)\n    \/\/ Alternately, find a way to make this input mlock()'d to begin with.\n    oldpass.assign(ui->passEdit1->text().toStdString().c_str());\n    newpass1.assign(ui->passEdit2->text().toStdString().c_str());\n    newpass2.assign(ui->passEdit3->text().toStdString().c_str());\n\n    secureClearPassFields();\n\n    switch(mode)\n    {\n    case Encrypt: {\n        if(newpass1.empty() || newpass2.empty())\n        {\n            \/\/ Cannot encrypt with empty passphrase\n            break;\n        }\n        QMessageBox::StandardButton retval = QMessageBox::question(this, tr(\"Confirm wallet encryption\"),\n                 tr(\"Warning: If you encrypt your wallet and lose your passphrase, you will <b>LOSE ALL OF YOUR COINS<\/b>!\") + \"<br><br>\" + tr(\"Are you sure you wish to encrypt your wallet?\"),\n                 QMessageBox::Yes|QMessageBox::Cancel,\n                 QMessageBox::Cancel);\n        if(retval == QMessageBox::Yes)\n        {\n            if(newpass1 == newpass2)\n            {\n                if(model->setWalletEncrypted(true, newpass1))\n                {\n                    QMessageBox::warning(this, tr(\"Wallet encrypted\"),\n                                         \"<qt>\" + \n                                         tr(\"Munne will close now to finish the encryption process. \"\n                                         \"Remember that encrypting your wallet cannot fully protect \"\n                                         \"your coins from being stolen by malware infecting your computer.\") + \n                                         \"<br><br><b>\" + \n                                         tr(\"IMPORTANT: Any previous backups you have made of your wallet file \"\n                                         \"should be replaced with the newly generated, encrypted wallet file. \"\n                                         \"For security reasons, previous backups of the unencrypted wallet file \"\n                                         \"will become useless as soon as you start using the new, encrypted wallet.\") + \n                                         \"<\/b><\/qt>\");\n                    QApplication::quit();\n                }\n                else\n                {\n                    QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n                                         tr(\"Wallet encryption failed due to an internal error. Your wallet was not encrypted.\"));\n                }\n                QDialog::accept(); \/\/ Success\n            }\n            else\n            {\n                QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n                                     tr(\"The supplied passphrases do not match.\"));\n            }\n        }\n        else\n        {\n            QDialog::reject(); \/\/ Cancelled\n        }\n        } break;\n    case UnlockStaking:\n    case Unlock:\n        if(!model->setWalletLocked(false, oldpass))\n        {\n            QMessageBox::critical(this, tr(\"Wallet unlock failed\"),\n                                  tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n        }\n        else\n        {\n            fWalletUnlockStakingOnly = ui->stakingCheckBox->isChecked();\n            QDialog::accept(); \/\/ Success\n        }\n        break;\n    case Decrypt:\n        if(!model->setWalletEncrypted(false, oldpass))\n        {\n            QMessageBox::critical(this, tr(\"Wallet decryption failed\"),\n                                  tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n        }\n        else\n        {\n            QDialog::accept(); \/\/ Success\n        }\n        break;\n    case ChangePass:\n        if(newpass1 == newpass2)\n        {\n            if(model->changePassphrase(oldpass, newpass1))\n            {\n                QMessageBox::information(this, tr(\"Wallet encrypted\"),\n                                     tr(\"Wallet passphrase was successfully changed.\"));\n                QDialog::accept(); \/\/ Success\n            }\n            else\n            {\n                QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n                                     tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n            }\n        }\n        else\n        {\n            QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n                                 tr(\"The supplied passphrases do not match.\"));\n        }\n        break;\n    }\n}\n\nvoid AskPassphraseDialog::textChanged()\n{\n    \/\/ Validate input, set Ok button to enabled when acceptable\n    bool acceptable = false;\n    switch(mode)\n    {\n    case Encrypt: \/\/ New passphrase x2\n        acceptable = !ui->passEdit2->text().isEmpty() && !ui->passEdit3->text().isEmpty();\n        break;\n    case UnlockStaking:\n    case Unlock: \/\/ Old passphrase x1\n    case Decrypt:\n        acceptable = !ui->passEdit1->text().isEmpty();\n        break;\n    case ChangePass: \/\/ Old passphrase x1, new passphrase x2\n        acceptable = !ui->passEdit1->text().isEmpty() && !ui->passEdit2->text().isEmpty() && !ui->passEdit3->text().isEmpty();\n        break;\n    }\n    ui->buttonBox->button(QDialogButtonBox::Ok)->setEnabled(acceptable);\n}\n\nbool AskPassphraseDialog::event(QEvent *event)\n{\n    \/\/ Detect Caps Lock key press.\n    if (event->type() == QEvent::KeyPress) {\n        QKeyEvent *ke = static_cast<QKeyEvent *>(event);\n        if (ke->key() == Qt::Key_CapsLock) {\n            fCapsLock = !fCapsLock;\n        }\n        if (fCapsLock) {\n            ui->capsLabel->setText(tr(\"Warning: The Caps Lock key is on!\"));\n        } else {\n            ui->capsLabel->clear();\n        }\n    }\n    return QWidget::event(event);\n}\n\nbool AskPassphraseDialog::eventFilter(QObject *object, QEvent *event)\n{\n    \/* Detect Caps Lock.\n     * There is no good OS-independent way to check a key state in Qt, but we\n     * can detect Caps Lock by checking for the following condition:\n     * Shift key is down and the result is a lower case character, or\n     * Shift key is not down and the result is an upper case character.\n     *\/\n    if (event->type() == QEvent::KeyPress) {\n        QKeyEvent *ke = static_cast<QKeyEvent *>(event);\n        QString str = ke->text();\n        if (str.length() != 0) {\n            const QChar *psz = str.unicode();\n            bool fShift = (ke->modifiers() & Qt::ShiftModifier) != 0;\n            if ((fShift && psz->isLower()) || (!fShift && psz->isUpper())) {\n                fCapsLock = true;\n                ui->capsLabel->setText(tr(\"Warning: The Caps Lock key is on!\"));\n            } else if (psz->isLetter()) {\n                fCapsLock = false;\n                ui->capsLabel->clear();\n            }\n        }\n    }\n    return QDialog::eventFilter(object, event);\n}\n\nvoid AskPassphraseDialog::secureClearPassFields()\n{\n    \/\/ Attempt to overwrite text so that they do not linger around in memory\n    ui->passEdit1->setText(QString(\" \").repeated(ui->passEdit1->text().size()));\n    ui->passEdit2->setText(QString(\" \").repeated(ui->passEdit2->text().size()));\n    ui->passEdit3->setText(QString(\" \").repeated(ui->passEdit3->text().size()));\n\n    ui->passEdit1->clear();\n    ui->passEdit2->clear();\n    ui->passEdit3->clear();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/                            MFEM Example 30+\n\/\/\n\/\/ Compile with: make osc\n\/\/\n\/\/ Sample runs:  osc -m ..\/data\/square-disc.mesh -o 1\n\/\/               osc -m ..\/data\/square-disc.mesh -o 2\n\/\/               osc -m ..\/data\/square-disc.mesh -o 2 -me 1e3\n\/\/               osc -m ..\/data\/square-disc-nurbs.mesh -o 2\n\/\/               osc -m ..\/data\/star.mesh -o 2 -eo 4\n\/\/               osc -m ..\/data\/fichera.mesh -o 2 -me 1e4\n\/\/               osc -m ..\/data\/disc-nurbs.mesh -o 2\n\/\/               osc -m ..\/data\/ball-nurbs.mesh -o 2 -eo 3 -e 1e-2 -me 1e4\n\/\/               osc -m ..\/data\/star-surf.mesh -o 2\n\/\/               osc -m ..\/data\/square-disc-surf.mesh -o 2\n\/\/               osc -m ..\/data\/amr-quad.mesh -l 2\n\/\/\n\/\/ Description:  This is an example of adaptive mesh refinement preprocessing\n\/\/               which lowers the data oscillation [1] to a user-defined\n\/\/               relative threshold. There is no PDE being solved.\n\/\/\n\/\/               MFEM's capability to work with both conforming and\n\/\/               nonconforming meshes is demonstrated in example 6. In some\n\/\/               problems, the material data or loading data is not sufficiently\n\/\/               resolved on the initial mesh. This missing fine scale data\n\/\/               reduces the accuracy of the solution as well as the accuracy\n\/\/               of some local error estimators. By preprocessing the mesh\n\/\/               before the solving the PDE, many issues can be avoided.\n\/\/\n\/\/               [1] Morin, P., Nochetto, R. H., & Siebert, K. G. (2000).\n\/\/                   Data oscillation and convergence of adaptive FEM. SIAM\n\/\/                   Journal on Numerical Analysis, 38(2), 466-488.\n\/\/\n\/\/               [2] Mitchell, W. F. (2013). A collection of 2D elliptic\n\/\/                   problems for testing adaptive grid refinement algorithms.\n\/\/                   Applied mathematics and computation, 220, 350-364.\n\n\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace std;\nusing namespace mfem;\n\n\/\/ Piecewise-affine function which is sometimes mesh-conforming\ndouble affine_function(const Vector &p)\n{\n   double x = p(0), y = p(1);\n   if (x < 0.0)\n   {\n      return 1.0 + x + y;\n   }\n   else\n   {\n      return 1.0;\n   }\n}\n\n\/\/ Piecewise-constant function which is never mesh-conforming\ndouble jump_function(const Vector &p)\n{\n   if (p.Normlp(2.0) > 0.4 && p.Normlp(2.0) < 0.6) { return 1; }\n   if (p.Normlp(2.0) < 0.4 || p.Normlp(2.0) > 0.6) { return 5; }\n   return 0;\n}\n\n\/\/ Singular function derived from the Laplacian of the \"steep wavefront\"\n\/\/ problem in [2].\ndouble singular_function(const Vector &p)\n{\n   double x = p(0), y = p(1);\n   double alpha = 1000.0;\n   double xc = 0.75, yc = 0.5;\n   double r0 = 0.7;\n   double r = sqrt(pow(x - xc,2.0) + pow(y - yc,2.0));\n   double num = - ( alpha - pow(alpha,3) * (pow(r,2) - pow(r0,2)) );\n   double denom = pow(r * ( pow(alpha,2) * pow(r0,2) + pow(alpha,2) * pow(r,2) \\\n                            - 2 * pow(alpha,2) * r0 * r + 1.0 ),2);\n   denom = max(denom,1e-8);\n   return num \/ denom;\n}\n\nint main(int argc, char *argv[])\n{\n   \/\/ 1. Parse command-line options.\n   const char *mesh_file = \"..\/data\/star.mesh\";\n   int order = 1;\n   int nc_limit = 1;\n   int max_elems = 1e5;\n   double double_max_elems = double(max_elems);\n   bool visualization = true;\n   double osc_threshold = 1e-3;\n   int enriched_order = 5;\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                  \"Finite element order (polynomial degree).\");\n   args.AddOption(&nc_limit, \"-l\", \"--nc-limit\",\n                  \"Maximum level of hanging nodes.\");\n   args.AddOption(&double_max_elems, \"-me\", \"--max-elems\",\n                  \"Stop after reaching this many elements.\");\n   args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n                  \"--no-visualization\",\n                  \"Enable or disable GLVis visualization.\");\n   args.AddOption(&osc_threshold, \"-e\", \"--error\",\n                  \"relative data oscillation threshold\");\n   args.AddOption(&enriched_order, \"-eo\", \"--enriched_order\",\n                  \"Enriched quadrature order.\");\n\n   args.Parse();\n   if (!args.Good())\n   {\n      args.PrintUsage(cout);\n      return 1;\n   }\n   args.PrintOptions(cout);\n\n   max_elems = int(double_max_elems);\n   Mesh mesh(mesh_file, 1, 1);\n\n   \/\/ 2. Since a NURBS mesh can currently only be refined uniformly, we need to\n   \/\/    convert it to a piecewise-polynomial curved mesh. First we refine the\n   \/\/    NURBS mesh a bit more and then project the curvature to quadratic Nodes.\n   if (mesh.NURBSext)\n   {\n      for (int i = 0; i < 2; i++)\n      {\n         mesh.UniformRefinement();\n      }\n      mesh.SetCurvature(2);\n   }\n\n   \/\/ 3. Define functions and refiner.\n   FunctionCoefficient affine_coeff(affine_function);\n   FunctionCoefficient jump_coeff(jump_function);\n   FunctionCoefficient singular_coeff(singular_function);\n   CoefficientRefiner coeffrefiner(order);\n\n   \/\/ 4. Connect to GLVis.\n   char vishost[] = \"localhost\";\n   int  visport   = 19916;\n   socketstream sol_sock;\n   if (visualization)\n   {\n      sol_sock.open(vishost, visport);\n   }\n\n   \/\/ 5. Define custom integration rule (optional).\n   const IntegrationRule *irs[Geometry::NumGeom];\n   int order_quad = 2*order + enriched_order;\n   for (int i=0; i < Geometry::NumGeom; ++i)\n   {\n      irs[i] = &(IntRules.Get(i, order_quad));\n   }\n\n   \/\/ 6. Apply custom refiner settings.\n   coeffrefiner.SetIntRule(irs);\n   coeffrefiner.SetMaxElements( (long) max_elems);\n   coeffrefiner.SetThreshold(osc_threshold);\n   coeffrefiner.SetNCLimit(nc_limit);\n\n   \/\/ 7. Preprocess mesh to control osc (piecewise-affine function).\n   \/\/    This is mostly just a verification check. The oscillation should\n   \/\/    be zero if the function is mesh-conforming and order > 0.\n   coeffrefiner.SetCoefficient(affine_coeff);\n   coeffrefiner.PreprocessMesh(mesh);\n\n   mfem::out  << \"\\n\";\n   mfem::out << \"Function 0 (affine) \\n\";\n   mfem::out << \"Number of Elements \" << mesh.GetNE() << \"\\n\";\n   mfem::out << \"Osc error \" << coeffrefiner.GetOsc() << \"\\n\";\n\n   \/\/ 8. Preprocess mesh to control osc (jump function).\n   coeffrefiner.SetCoefficient(jump_coeff);\n   coeffrefiner.PreprocessMesh(mesh);\n\n   mfem::out  << \"\\n\";\n   mfem::out << \"Function 1 (discontinuous) \\n\";\n   mfem::out << \"Number of Elements \" << mesh.GetNE() << \"\\n\";\n   mfem::out << \"Osc error \" << coeffrefiner.GetOsc() << \"\\n\";\n\n   \/\/ 9. Preprocess mesh to control osc (singular function).\n   coeffrefiner.SetCoefficient(singular_coeff);\n   coeffrefiner.PreprocessMesh(mesh);\n\n   mfem::out  << \"\\n\";\n   mfem::out << \"Function 2 (singular) \\n\";\n   mfem::out << \"Number of Elements \" << mesh.GetNE() << \"\\n\";\n   mfem::out << \"Osc error \" << coeffrefiner.GetOsc() << \"\\n\";\n\n   sol_sock.precision(8);\n   sol_sock << \"mesh\\n\" << mesh << flush;\n\n\n   return 0;\n}\n<commit_msg>Addressing comments: Added period for conformity.<commit_after>\/\/                            MFEM Example 30+\n\/\/\n\/\/ Compile with: make osc\n\/\/\n\/\/ Sample runs:  osc -m ..\/data\/square-disc.mesh -o 1\n\/\/               osc -m ..\/data\/square-disc.mesh -o 2\n\/\/               osc -m ..\/data\/square-disc.mesh -o 2 -me 1e3\n\/\/               osc -m ..\/data\/square-disc-nurbs.mesh -o 2\n\/\/               osc -m ..\/data\/star.mesh -o 2 -eo 4\n\/\/               osc -m ..\/data\/fichera.mesh -o 2 -me 1e4\n\/\/               osc -m ..\/data\/disc-nurbs.mesh -o 2\n\/\/               osc -m ..\/data\/ball-nurbs.mesh -o 2 -eo 3 -e 1e-2 -me 1e4\n\/\/               osc -m ..\/data\/star-surf.mesh -o 2\n\/\/               osc -m ..\/data\/square-disc-surf.mesh -o 2\n\/\/               osc -m ..\/data\/amr-quad.mesh -l 2\n\/\/\n\/\/ Description:  This is an example of adaptive mesh refinement preprocessing\n\/\/               which lowers the data oscillation [1] to a user-defined\n\/\/               relative threshold. There is no PDE being solved.\n\/\/\n\/\/               MFEM's capability to work with both conforming and\n\/\/               nonconforming meshes is demonstrated in example 6. In some\n\/\/               problems, the material data or loading data is not sufficiently\n\/\/               resolved on the initial mesh. This missing fine scale data\n\/\/               reduces the accuracy of the solution as well as the accuracy\n\/\/               of some local error estimators. By preprocessing the mesh\n\/\/               before the solving the PDE, many issues can be avoided.\n\/\/\n\/\/               [1] Morin, P., Nochetto, R. H., & Siebert, K. G. (2000).\n\/\/                   Data oscillation and convergence of adaptive FEM. SIAM\n\/\/                   Journal on Numerical Analysis, 38(2), 466-488.\n\/\/\n\/\/               [2] Mitchell, W. F. (2013). A collection of 2D elliptic\n\/\/                   problems for testing adaptive grid refinement algorithms.\n\/\/                   Applied mathematics and computation, 220, 350-364.\n\n\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace std;\nusing namespace mfem;\n\n\/\/ Piecewise-affine function which is sometimes mesh-conforming\ndouble affine_function(const Vector &p)\n{\n   double x = p(0), y = p(1);\n   if (x < 0.0)\n   {\n      return 1.0 + x + y;\n   }\n   else\n   {\n      return 1.0;\n   }\n}\n\n\/\/ Piecewise-constant function which is never mesh-conforming\ndouble jump_function(const Vector &p)\n{\n   if (p.Normlp(2.0) > 0.4 && p.Normlp(2.0) < 0.6) { return 1; }\n   if (p.Normlp(2.0) < 0.4 || p.Normlp(2.0) > 0.6) { return 5; }\n   return 0;\n}\n\n\/\/ Singular function derived from the Laplacian of the \"steep wavefront\"\n\/\/ problem in [2].\ndouble singular_function(const Vector &p)\n{\n   double x = p(0), y = p(1);\n   double alpha = 1000.0;\n   double xc = 0.75, yc = 0.5;\n   double r0 = 0.7;\n   double r = sqrt(pow(x - xc,2.0) + pow(y - yc,2.0));\n   double num = - ( alpha - pow(alpha,3) * (pow(r,2) - pow(r0,2)) );\n   double denom = pow(r * ( pow(alpha,2) * pow(r0,2) + pow(alpha,2) * pow(r,2) \\\n                            - 2 * pow(alpha,2) * r0 * r + 1.0 ),2);\n   denom = max(denom,1e-8);\n   return num \/ denom;\n}\n\nint main(int argc, char *argv[])\n{\n   \/\/ 1. Parse command-line options.\n   const char *mesh_file = \"..\/data\/star.mesh\";\n   int order = 1;\n   int nc_limit = 1;\n   int max_elems = 1e5;\n   double double_max_elems = double(max_elems);\n   bool visualization = true;\n   double osc_threshold = 1e-3;\n   int enriched_order = 5;\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                  \"Finite element order (polynomial degree).\");\n   args.AddOption(&nc_limit, \"-l\", \"--nc-limit\",\n                  \"Maximum level of hanging nodes.\");\n   args.AddOption(&double_max_elems, \"-me\", \"--max-elems\",\n                  \"Stop after reaching this many elements.\");\n   args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n                  \"--no-visualization\",\n                  \"Enable or disable GLVis visualization.\");\n   args.AddOption(&osc_threshold, \"-e\", \"--error\",\n                  \"relative data oscillation threshold.\");\n   args.AddOption(&enriched_order, \"-eo\", \"--enriched_order\",\n                  \"Enriched quadrature order.\");\n\n   args.Parse();\n   if (!args.Good())\n   {\n      args.PrintUsage(cout);\n      return 1;\n   }\n   args.PrintOptions(cout);\n\n   max_elems = int(double_max_elems);\n   Mesh mesh(mesh_file, 1, 1);\n\n   \/\/ 2. Since a NURBS mesh can currently only be refined uniformly, we need to\n   \/\/    convert it to a piecewise-polynomial curved mesh. First we refine the\n   \/\/    NURBS mesh a bit more and then project the curvature to quadratic Nodes.\n   if (mesh.NURBSext)\n   {\n      for (int i = 0; i < 2; i++)\n      {\n         mesh.UniformRefinement();\n      }\n      mesh.SetCurvature(2);\n   }\n\n   \/\/ 3. Define functions and refiner.\n   FunctionCoefficient affine_coeff(affine_function);\n   FunctionCoefficient jump_coeff(jump_function);\n   FunctionCoefficient singular_coeff(singular_function);\n   CoefficientRefiner coeffrefiner(order);\n\n   \/\/ 4. Connect to GLVis.\n   char vishost[] = \"localhost\";\n   int  visport   = 19916;\n   socketstream sol_sock;\n   if (visualization)\n   {\n      sol_sock.open(vishost, visport);\n   }\n\n   \/\/ 5. Define custom integration rule (optional).\n   const IntegrationRule *irs[Geometry::NumGeom];\n   int order_quad = 2*order + enriched_order;\n   for (int i=0; i < Geometry::NumGeom; ++i)\n   {\n      irs[i] = &(IntRules.Get(i, order_quad));\n   }\n\n   \/\/ 6. Apply custom refiner settings.\n   coeffrefiner.SetIntRule(irs);\n   coeffrefiner.SetMaxElements( (long) max_elems);\n   coeffrefiner.SetThreshold(osc_threshold);\n   coeffrefiner.SetNCLimit(nc_limit);\n\n   \/\/ 7. Preprocess mesh to control osc (piecewise-affine function).\n   \/\/    This is mostly just a verification check. The oscillation should\n   \/\/    be zero if the function is mesh-conforming and order > 0.\n   coeffrefiner.SetCoefficient(affine_coeff);\n   coeffrefiner.PreprocessMesh(mesh);\n\n   mfem::out  << \"\\n\";\n   mfem::out << \"Function 0 (affine) \\n\";\n   mfem::out << \"Number of Elements \" << mesh.GetNE() << \"\\n\";\n   mfem::out << \"Osc error \" << coeffrefiner.GetOsc() << \"\\n\";\n\n   \/\/ 8. Preprocess mesh to control osc (jump function).\n   coeffrefiner.SetCoefficient(jump_coeff);\n   coeffrefiner.PreprocessMesh(mesh);\n\n   mfem::out  << \"\\n\";\n   mfem::out << \"Function 1 (discontinuous) \\n\";\n   mfem::out << \"Number of Elements \" << mesh.GetNE() << \"\\n\";\n   mfem::out << \"Osc error \" << coeffrefiner.GetOsc() << \"\\n\";\n\n   \/\/ 9. Preprocess mesh to control osc (singular function).\n   coeffrefiner.SetCoefficient(singular_coeff);\n   coeffrefiner.PreprocessMesh(mesh);\n\n   mfem::out  << \"\\n\";\n   mfem::out << \"Function 2 (singular) \\n\";\n   mfem::out << \"Number of Elements \" << mesh.GetNE() << \"\\n\";\n   mfem::out << \"Osc error \" << coeffrefiner.GetOsc() << \"\\n\";\n\n   sol_sock.precision(8);\n   sol_sock << \"mesh\\n\" << mesh << flush;\n\n\n   return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <ctype.h>\n#include <vector>\n#include <string>\n#include <errno.h>\n#include <string.h>\n#include <sstream>\n#include <cstdlib>\n#include <assert.h>\n\n#include \"PhnReader.hh\"\n#include \"str.hh\"\n\n\nPhnReader::Phn::Phn()\n  : start(0), end(0)\n{\n}\n\nPhnReader::PhnReader(HmmSet *model)\n  : m_file(NULL), m_model(model),\n    m_state_num_labels(false), m_relative_sample_numbers(false)\n{\n  Segmentator::IndexProbPair p(-1, 1);\n  set_frame_rate(125); \/\/ Default frame rate\n\n  \/\/ Initialize the current state and its probability\n  m_cur_pdf.push_back(p);\n}\n\nPhnReader::~PhnReader()\n{\n  close();\n}\n\nvoid\nPhnReader::open(std::string filename) \n{\n  m_current_line = 0;\n  m_first_line = 0;\n  m_last_line = 0;\n  m_first_frame = 0;\n  m_last_frame = 0;\n  m_current_frame = -1;\n  m_eof_flag = false;\n\n  close();\n\n  m_file = fopen(filename.c_str(), \"r\");\n  if (!m_file) {\n    fprintf(stderr, \"PhnReader::open(): could not open %s\\n\", \n\t    filename.c_str());\n    perror(\"error\");\n    exit(1);\n  }\n}\n\nvoid\nPhnReader::close()\n{\n  if (m_file)\n    fclose(m_file);\n  m_file = NULL;\n}\n\nvoid\nPhnReader::reset(void)\n{\n  assert( m_file != NULL );\n  fseek(m_file, 0, SEEK_SET);\n\n  m_current_line = 0;\n  m_current_frame = -1;\n  m_eof_flag = false;\n  if (m_first_frame > 0)\n    set_frame_limits(m_first_frame, m_last_frame);\n  if (m_first_line > 0)\n    set_line_limits(m_first_line, m_last_line, NULL);\n}\n\n\nvoid\nPhnReader::set_line_limits(int first_line, int last_line, \n                           int *first_frame) \n{\n  Phn phn;\n  m_first_line = first_line;\n  m_last_line = last_line;\n\n  while (m_current_line < m_first_line) \n    next_phn_line(phn);\n  \n  if (first_frame != NULL)\n  {\n    *first_frame = phn.start;\n    if (m_relative_sample_numbers)\n      (*first_frame) += m_first_frame;\n  }\n}\n\nvoid\nPhnReader::set_frame_limits(int first_frame, int last_frame) \n{\n  Phn phn;\n  \n  m_first_frame = first_frame;\n  m_last_frame = last_frame;\n  if (!m_relative_sample_numbers)\n  {\n    long oldpos = ftell(m_file);\n    long curpos = oldpos;\n    \n    while (next_phn_line(phn)) {\n      oldpos = curpos;\n      curpos = ftell(m_file);\n      if (phn.end < 0 || phn.end > m_first_frame)\n      {\n        fseek(m_file, oldpos, SEEK_SET);\n        m_current_line--;\n        return;\n      }\n    }\n  }\n}\n\n\nbool\nPhnReader::init_utterance_segmentation(void)\n{\n  m_eof_flag = false;\n  if (!next_phn_line(m_cur_phn))\n    m_eof_flag = true;\n  return !m_eof_flag;\n}\n\n\nbool\nPhnReader::next_frame(void)\n{\n  int cur_state_index = -1;\n\n  assert( m_model != NULL );\n  \n  if (m_eof_flag)\n    return false;\n\n  \/\/ Segmentator object must reset the model cache during next_frame()\n  m_model->reset_cache();\n  \n  if (m_current_frame == -1)\n  {\n    \/\/ Initialize the current frame to the beginning of the file\n    m_current_frame = m_cur_phn.start;\n    assert( m_cur_phn.end >= m_current_frame );\n  }\n  else\n  {\n    m_current_frame++;\n  }\n\n  assert( m_current_frame >= m_cur_phn.start );\n  assert( m_current_frame <= m_cur_phn.end );\n\n  if (m_state_num_labels)\n  {\n    cur_state_index = m_cur_phn.state;\n  }\n  else\n  {\n    if (m_cur_phn.state < 0)\n      throw std::string(\"PhnReader::next_frame(): A state segmented phn file is required\");\n    Hmm &hmm = m_model->hmm(m_model->hmm_index(m_cur_phn.label[0]));\n    cur_state_index = hmm.state(m_cur_phn.state);\n  }\n  m_cur_pdf.back().index = m_model->emission_pdf_index(cur_state_index);\n\n  bool new_phn_loaded = false;\n  Phn prev_phn = m_cur_phn;\n\n  \/\/ Do we need to load more phn lines?\n  while (m_current_frame+1 >= m_cur_phn.end)\n  {\n    if (!next_phn_line(m_cur_phn))\n    {\n      m_eof_flag = true; \/\/ For the next call\n      break;\n    }\n    new_phn_loaded = true;\n  }\n\n  if (m_collect_transitions)\n  {\n    m_transition_info.clear();\n    if (!m_eof_flag) \/\/ Not the last frame\n    {\n      std::vector<int> &tr_index=m_model->state(cur_state_index).transitions();\n      int transition_index = -1;\n      \n      if (new_phn_loaded)\n      {\n        \/\/ Out transition\n        if (m_state_num_labels)\n        {\n          \/\/ We don't have information which transition it is, select the first\n          \/\/ out transition\n          for (int i = 0; i < (int)tr_index.size(); i++)\n            if (m_model->transition(tr_index[i]).target_offset != 0)\n            {\n              transition_index = tr_index[i];\n              break;\n            }\n        }\n        else\n        {\n          int cur_state = prev_phn.state;\n          Hmm &cur_hmm = m_model->hmm(m_model->hmm_index(prev_phn.label[0]));\n\n          \/\/ Find the correct transition\n          for (int i = 0; i < (int)tr_index.size(); i++)\n          {\n            int next_state =\n              m_model->transition(tr_index[i]).target_offset+cur_state;\n\n            if ((next_state >= cur_hmm.num_states() &&\n                 m_cur_phn.state == 0) ||\n                (next_state == m_cur_phn.state))\n            {\n              transition_index = tr_index[i];\n              break;\n            }\n          }\n        }\n      }\n      else\n      {\n        \/\/ Self transition\n        for (int i = 0; i < (int)tr_index.size(); i++)\n          if (m_model->transition(tr_index[i]).target_offset == 0)\n          {\n            transition_index = tr_index[i];\n            break;\n          }\n      }\n      if (transition_index == -1)\n      {\n        throw std::string(\"PhnReader::next_frame(): Correct transition was not found\");\n      }\n      if (transition_index != -1)\n      {\n        Segmentator::IndexProbPair new_transition(transition_index, 1);\n        m_transition_info.push_back(new_transition);\n      }\n    }\n  }\n\n  return true;\n}\n\n\nbool\nPhnReader::next_phn_line(Phn &phn)\n{  \n  \/\/ Read line at time\n  if (!str::read_line(&m_line, m_file)) {\n    if (ferror(m_file)) {\n      throw str::fmt(1024,\n                     \"PhnReader::next_phn_line(): read error on line %d: %s\\n\",\n                     m_current_line, strerror(errno));\n    }\n\n    if (feof(m_file))\n      return false;\n    \n    assert(false);\n  }\n\n  if (m_last_line > 0 && m_current_line >= m_last_line)\n    return false; \n\n  \/\/ Parse the line in fields.\n  str::chomp(&m_line);\n  std::vector<std::string> fields;\n\n  \/\/ If the first char is digit, we have start and end fields.\n  if (isdigit(m_line[0])) {\n    str::split(&m_line, \" \\t\", true, &fields, 4);\n    bool ok = true;\n\n    if (fields.size() > 2) {\n\n      \/\/ read start & end\n\n      phn.start = (int)(str::str2long(&fields[0], &ok)\/m_samples_per_frame);\n      phn.end = (int)(str::str2long(&fields[1], &ok)\/m_samples_per_frame);\n\n      \/\/ read state\n\n      phn.state = -1; \/\/ state default value !\n\n      if (strchr(fields[2].c_str(), '.') != NULL){\n\tphn.state = atoi( (const char*)(strchr(fields[2].c_str(), '.') + 1) );\n\tfields[2].erase(fields[2].find('.', 0), 2);\n      }\n\n    }\n    else\n      ok = false;\n\n    if (!ok || phn.start > phn.end) {\n      throw str::fmt(\n        1024,\n        \"PhnReader::next_phn_line(): invalid start or end time on line %d:\\n\"\n        \"%s\\n\", m_current_line, m_line.c_str());\n    }\n\n    fields.erase(fields.begin(), fields.begin() + 2);\n  }\n\n  \/\/ Otherwise we have just label and comments.\n  else {\n    str::split(&m_line, \" \\t\", true, &fields, 2);\n    phn.start = -1;\n    phn.end = -1;\n  }\n\n  if (m_relative_sample_numbers && phn.start >= 0)\n  {\n    phn.start += m_first_frame;\n    phn.end += m_first_frame;\n  }\n  \n  \/\/ Is the current starting time out of requested range?\n  if (m_last_frame > 0)\n  {\n    if (phn.start >= m_last_frame)\n      return false;\n    if (phn.end >= m_last_frame)\n      phn.end = m_last_frame;\n  }\n\n  if (m_first_frame > 0 && phn.start < m_first_frame && phn.start >= 0)\n  {\n    phn.start = m_first_frame;\n    assert( phn.start > phn.end );\n  }\n\n  \/\/ Read label and comments\n  phn.label.clear();\n  if (m_state_num_labels)\n  {\n    phn.state = atoi(fields[0].c_str()); \/\/ State number instead of label\n  }\n  else\n  {\n    str::split(&fields[0], \",\", false, &phn.label);\n  }\n\n  if ((int)fields.size() > 1)\n    phn.comment = fields[1];\n  else\n    phn.comment = \"\";\n  \n  m_current_line++;\n  return true;\n}\n\n<commit_msg>Moved state number initialization in next_phn_line()<commit_after>#include <ctype.h>\n#include <vector>\n#include <string>\n#include <errno.h>\n#include <string.h>\n#include <sstream>\n#include <cstdlib>\n#include <assert.h>\n\n#include \"PhnReader.hh\"\n#include \"str.hh\"\n\n\nPhnReader::Phn::Phn()\n  : start(0), end(0)\n{\n}\n\nPhnReader::PhnReader(HmmSet *model)\n  : m_file(NULL), m_model(model),\n    m_state_num_labels(false), m_relative_sample_numbers(false)\n{\n  Segmentator::IndexProbPair p(-1, 1);\n  set_frame_rate(125); \/\/ Default frame rate\n\n  \/\/ Initialize the current state and its probability\n  m_cur_pdf.push_back(p);\n}\n\nPhnReader::~PhnReader()\n{\n  close();\n}\n\nvoid\nPhnReader::open(std::string filename) \n{\n  m_current_line = 0;\n  m_first_line = 0;\n  m_last_line = 0;\n  m_first_frame = 0;\n  m_last_frame = 0;\n  m_current_frame = -1;\n  m_eof_flag = false;\n\n  close();\n\n  m_file = fopen(filename.c_str(), \"r\");\n  if (!m_file) {\n    fprintf(stderr, \"PhnReader::open(): could not open %s\\n\", \n\t    filename.c_str());\n    perror(\"error\");\n    exit(1);\n  }\n}\n\nvoid\nPhnReader::close()\n{\n  if (m_file)\n    fclose(m_file);\n  m_file = NULL;\n}\n\nvoid\nPhnReader::reset(void)\n{\n  assert( m_file != NULL );\n  fseek(m_file, 0, SEEK_SET);\n\n  m_current_line = 0;\n  m_current_frame = -1;\n  m_eof_flag = false;\n  if (m_first_frame > 0)\n    set_frame_limits(m_first_frame, m_last_frame);\n  if (m_first_line > 0)\n    set_line_limits(m_first_line, m_last_line, NULL);\n}\n\n\nvoid\nPhnReader::set_line_limits(int first_line, int last_line, \n                           int *first_frame) \n{\n  Phn phn;\n  m_first_line = first_line;\n  m_last_line = last_line;\n\n  while (m_current_line < m_first_line) \n    next_phn_line(phn);\n  \n  if (first_frame != NULL)\n  {\n    *first_frame = phn.start;\n    if (m_relative_sample_numbers)\n      (*first_frame) += m_first_frame;\n  }\n}\n\nvoid\nPhnReader::set_frame_limits(int first_frame, int last_frame) \n{\n  Phn phn;\n  \n  m_first_frame = first_frame;\n  m_last_frame = last_frame;\n  if (!m_relative_sample_numbers)\n  {\n    long oldpos = ftell(m_file);\n    long curpos = oldpos;\n    \n    while (next_phn_line(phn)) {\n      oldpos = curpos;\n      curpos = ftell(m_file);\n      if (phn.end < 0 || phn.end > m_first_frame)\n      {\n        fseek(m_file, oldpos, SEEK_SET);\n        m_current_line--;\n        return;\n      }\n    }\n  }\n}\n\n\nbool\nPhnReader::init_utterance_segmentation(void)\n{\n  m_eof_flag = false;\n  if (!next_phn_line(m_cur_phn))\n    m_eof_flag = true;\n  return !m_eof_flag;\n}\n\n\nbool\nPhnReader::next_frame(void)\n{\n  int cur_state_index = -1;\n\n  assert( m_model != NULL );\n  \n  if (m_eof_flag)\n    return false;\n\n  \/\/ Segmentator object must reset the model cache during next_frame()\n  m_model->reset_cache();\n  \n  if (m_current_frame == -1)\n  {\n    \/\/ Initialize the current frame to the beginning of the file\n    m_current_frame = m_cur_phn.start;\n    assert( m_cur_phn.end >= m_current_frame );\n  }\n  else\n  {\n    m_current_frame++;\n  }\n\n  assert( m_current_frame >= m_cur_phn.start );\n  assert( m_current_frame <= m_cur_phn.end );\n\n  if (m_state_num_labels)\n  {\n    cur_state_index = m_cur_phn.state;\n  }\n  else\n  {\n    if (m_cur_phn.state < 0)\n      throw std::string(\"PhnReader::next_frame(): A state segmented phn file is required\");\n    Hmm &hmm = m_model->hmm(m_model->hmm_index(m_cur_phn.label[0]));\n    cur_state_index = hmm.state(m_cur_phn.state);\n  }\n  m_cur_pdf.back().index = m_model->emission_pdf_index(cur_state_index);\n\n  bool new_phn_loaded = false;\n  Phn prev_phn = m_cur_phn;\n\n  \/\/ Do we need to load more phn lines?\n  while (m_current_frame+1 >= m_cur_phn.end)\n  {\n    if (!next_phn_line(m_cur_phn))\n    {\n      m_eof_flag = true; \/\/ For the next call\n      break;\n    }\n    new_phn_loaded = true;\n  }\n\n  if (m_collect_transitions)\n  {\n    m_transition_info.clear();\n    if (!m_eof_flag) \/\/ Not the last frame\n    {\n      std::vector<int> &tr_index=m_model->state(cur_state_index).transitions();\n      int transition_index = -1;\n      \n      if (new_phn_loaded)\n      {\n        \/\/ Out transition\n        if (m_state_num_labels)\n        {\n          \/\/ We don't have information which transition it is, select the first\n          \/\/ out transition\n          for (int i = 0; i < (int)tr_index.size(); i++)\n            if (m_model->transition(tr_index[i]).target_offset != 0)\n            {\n              transition_index = tr_index[i];\n              break;\n            }\n        }\n        else\n        {\n          int cur_state = prev_phn.state;\n          Hmm &cur_hmm = m_model->hmm(m_model->hmm_index(prev_phn.label[0]));\n\n          \/\/ Find the correct transition\n          for (int i = 0; i < (int)tr_index.size(); i++)\n          {\n            int next_state =\n              m_model->transition(tr_index[i]).target_offset+cur_state;\n\n            if ((next_state >= cur_hmm.num_states() &&\n                 m_cur_phn.state == 0) ||\n                (next_state == m_cur_phn.state))\n            {\n              transition_index = tr_index[i];\n              break;\n            }\n          }\n        }\n      }\n      else\n      {\n        \/\/ Self transition\n        for (int i = 0; i < (int)tr_index.size(); i++)\n          if (m_model->transition(tr_index[i]).target_offset == 0)\n          {\n            transition_index = tr_index[i];\n            break;\n          }\n      }\n      if (transition_index == -1)\n      {\n        throw std::string(\"PhnReader::next_frame(): Correct transition was not found\");\n      }\n      if (transition_index != -1)\n      {\n        Segmentator::IndexProbPair new_transition(transition_index, 1);\n        m_transition_info.push_back(new_transition);\n      }\n    }\n  }\n\n  return true;\n}\n\n\nbool\nPhnReader::next_phn_line(Phn &phn)\n{  \n  \/\/ Read line at time\n  if (!str::read_line(&m_line, m_file)) {\n    if (ferror(m_file)) {\n      throw str::fmt(1024,\n                     \"PhnReader::next_phn_line(): read error on line %d: %s\\n\",\n                     m_current_line, strerror(errno));\n    }\n\n    if (feof(m_file))\n      return false;\n    \n    assert(false);\n  }\n\n  if (m_last_line > 0 && m_current_line >= m_last_line)\n    return false; \n\n  \/\/ Parse the line in fields.\n  str::chomp(&m_line);\n  std::vector<std::string> fields;\n\n  phn.state = -1; \/\/ state default value !\n  \n  \/\/ If the first char is digit, we have start and end fields.\n  if (isdigit(m_line[0])) {\n    str::split(&m_line, \" \\t\", true, &fields, 4);\n    bool ok = true;\n\n    if (fields.size() > 2) {\n\n      \/\/ read start & end\n\n      phn.start = (int)(str::str2long(&fields[0], &ok)\/m_samples_per_frame);\n      phn.end = (int)(str::str2long(&fields[1], &ok)\/m_samples_per_frame);\n\n      \/\/ read state\n      if (strchr(fields[2].c_str(), '.') != NULL){\n\tphn.state = atoi( (const char*)(strchr(fields[2].c_str(), '.') + 1) );\n\tfields[2].erase(fields[2].find('.', 0), 2);\n      }\n\n    }\n    else\n      ok = false;\n\n    if (!ok || phn.start > phn.end) {\n      throw str::fmt(\n        1024,\n        \"PhnReader::next_phn_line(): invalid start or end time on line %d:\\n\"\n        \"%s\\n\", m_current_line, m_line.c_str());\n    }\n\n    fields.erase(fields.begin(), fields.begin() + 2);\n  }\n\n  \/\/ Otherwise we have just label and comments.\n  else {\n    str::split(&m_line, \" \\t\", true, &fields, 2);\n    phn.start = -1;\n    phn.end = -1;\n  }\n\n  if (m_relative_sample_numbers && phn.start >= 0)\n  {\n    phn.start += m_first_frame;\n    phn.end += m_first_frame;\n  }\n  \n  \/\/ Is the current starting time out of requested range?\n  if (m_last_frame > 0)\n  {\n    if (phn.start >= m_last_frame)\n      return false;\n    if (phn.end >= m_last_frame)\n      phn.end = m_last_frame;\n  }\n\n  if (m_first_frame > 0 && phn.start < m_first_frame && phn.start >= 0)\n  {\n    phn.start = m_first_frame;\n    assert( phn.start > phn.end );\n  }\n\n  \/\/ Read label and comments\n  phn.label.clear();\n  if (m_state_num_labels)\n  {\n    phn.state = atoi(fields[0].c_str()); \/\/ State number instead of label\n  }\n  else\n  {\n    str::split(&fields[0], \",\", false, &phn.label);\n  }\n\n  if ((int)fields.size() > 1)\n    phn.comment = fields[1];\n  else\n    phn.comment = \"\";\n  \n  m_current_line++;\n  return true;\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 <atlbase.h>\n#include <atlapp.h>\n#include <atlmisc.h>\n\n#include \"app\/gfx\/icon_util.h\"\n#include \"base\/gfx\/size.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"skia\/include\/SkBitmap.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\n  static const wchar_t* const kSmallIconName = L\"icon_util\\\\16_X_16_icon.ico\";\n  static const wchar_t* const kLargeIconName = L\"icon_util\\\\128_X_128_icon.ico\";\n  static const wchar_t* const kTempIconFilename = L\"temp_test_icon.ico\";\n\n  class IconUtilTest : public testing::Test {\n   public:\n    IconUtilTest() {\n      PathService::Get(chrome::DIR_TEST_DATA, &test_data_directory_);\n    }\n    ~IconUtilTest() {}\n\n    static const int kSmallIconWidth = 16;\n    static const int kSmallIconHeight = 16;\n    static const int kLargeIconWidth = 128;\n    static const int kLargeIconHeight = 128;\n\n    \/\/ Given a file name for an .ico file and an image dimentions, this\n    \/\/ function loads the icon and returns an HICON handle.\n    HICON LoadIconFromFile(const std::wstring& filename,\n                           int width,\n                           int height) {\n      HICON icon =\n          static_cast<HICON>(LoadImage(NULL,\n                                       filename.c_str(),\n                                       IMAGE_ICON,\n                                       width,\n                                       height,\n                                       LR_LOADTRANSPARENT | LR_LOADFROMFILE));\n      return icon;\n    }\n\n   protected:\n    \/\/ The root directory for test files.\n    std::wstring test_data_directory_;\n\n   private:\n    DISALLOW_EVIL_CONSTRUCTORS(IconUtilTest);\n  };\n};\n\n\/\/ The following test case makes sure IconUtil::SkBitmapFromHICON fails\n\/\/ gracefully when called with invalid input parameters.\nTEST_F(IconUtilTest, TestIconToBitmapInvalidParameters) {\n  std::wstring icon_filename(test_data_directory_);\n  file_util::AppendToPath(&icon_filename, kSmallIconName);\n  gfx::Size icon_size(kSmallIconWidth, kSmallIconHeight);\n  HICON icon = LoadIconFromFile(icon_filename,\n                                icon_size.width(),\n                                icon_size.height());\n  ASSERT_TRUE(icon != NULL);\n\n  \/\/ Invalid size parameter.\n  gfx::Size invalid_icon_size(kSmallIconHeight, 0);\n  EXPECT_EQ(IconUtil::CreateSkBitmapFromHICON(icon, invalid_icon_size),\n            static_cast<SkBitmap*>(NULL));\n\n  \/\/ Invalid icon.\n  EXPECT_EQ(IconUtil::CreateSkBitmapFromHICON(NULL, icon_size),\n            static_cast<SkBitmap*>(NULL));\n\n  \/\/ The following code should succeed.\n  scoped_ptr<SkBitmap> bitmap;\n  bitmap.reset(IconUtil::CreateSkBitmapFromHICON(icon, icon_size));\n  EXPECT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  ::DestroyIcon(icon);\n}\n\n\/\/ The following test case makes sure IconUtil::CreateHICONFromSkBitmap fails\n\/\/ gracefully when called with invalid input parameters.\nTEST_F(IconUtilTest, TestBitmapToIconInvalidParameters) {\n  HICON icon = NULL;\n  scoped_ptr<SkBitmap> bitmap;\n\n  \/\/ Wrong bitmap format.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kA8_Config, kSmallIconWidth, kSmallIconHeight);\n  icon = IconUtil::CreateHICONFromSkBitmap(*bitmap);\n  EXPECT_EQ(icon, static_cast<HICON>(NULL));\n\n  \/\/ Invalid bitmap size.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config, 0, 0);\n  icon = IconUtil::CreateHICONFromSkBitmap(*bitmap);\n  EXPECT_EQ(icon, static_cast<HICON>(NULL));\n\n  \/\/ Valid bitmap configuration but no pixels allocated.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config,\n                    kSmallIconWidth,\n                    kSmallIconHeight);\n  icon = IconUtil::CreateHICONFromSkBitmap(*bitmap);\n  EXPECT_TRUE(icon == NULL);\n}\n\n\/\/ The following test case makes sure IconUtil::CreateIconFileFromSkBitmap\n\/\/ fails gracefully when called with invalid input parameters.\nTEST_F(IconUtilTest, TestCreateIconFileInvalidParameters) {\n  scoped_ptr<SkBitmap> bitmap;\n  std::wstring valid_icon_filename(test_data_directory_);\n  file_util::AppendToPath(&valid_icon_filename, kSmallIconName);\n  std::wstring invalid_icon_filename(L\"C:\\\\<>?.ico\");\n\n  \/\/ Wrong bitmap format.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kA8_Config, kSmallIconWidth, kSmallIconHeight);\n  EXPECT_FALSE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                    valid_icon_filename));\n\n  \/\/ Invalid bitmap size.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config, 0, 0);\n  EXPECT_FALSE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                    valid_icon_filename));\n\n  \/\/ Bitmap with no allocated pixels.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config,\n                    kSmallIconWidth,\n                    kSmallIconHeight);\n  EXPECT_FALSE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                    valid_icon_filename));\n\n  \/\/ Invalid file name.\n  bitmap->allocPixels();\n  \/\/ Setting the pixels to black.\n  memset(bitmap->getPixels(), 0, bitmap->width() * bitmap->height() * 4);\n  EXPECT_FALSE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                    invalid_icon_filename));\n}\n\n\/\/ This test case makes sure that when we load an icon from disk and convert\n\/\/ the HICON into a bitmap, the bitmap has the expected format and dimentions.\nTEST_F(IconUtilTest, TestCreateSkBitmapFromHICON) {\n  scoped_ptr<SkBitmap> bitmap;\n  std::wstring small_icon_filename(test_data_directory_);\n  file_util::AppendToPath(&small_icon_filename, kSmallIconName);\n  gfx::Size small_icon_size(kSmallIconWidth, kSmallIconHeight);\n  HICON small_icon = LoadIconFromFile(small_icon_filename,\n                                      small_icon_size.width(),\n                                      small_icon_size.height());\n  ASSERT_NE(small_icon, static_cast<HICON>(NULL));\n  bitmap.reset(IconUtil::CreateSkBitmapFromHICON(small_icon, small_icon_size));\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  EXPECT_EQ(bitmap->width(), small_icon_size.width());\n  EXPECT_EQ(bitmap->height(), small_icon_size.height());\n  EXPECT_EQ(bitmap->config(), SkBitmap::kARGB_8888_Config);\n  ::DestroyIcon(small_icon);\n\n  std::wstring large_icon_filename(test_data_directory_);\n  file_util::AppendToPath(&large_icon_filename, kLargeIconName);\n  gfx::Size large_icon_size(kLargeIconWidth, kLargeIconHeight);\n  HICON large_icon = LoadIconFromFile(large_icon_filename,\n                                      large_icon_size.width(),\n                                      large_icon_size.height());\n  ASSERT_NE(large_icon, static_cast<HICON>(NULL));\n  bitmap.reset(IconUtil::CreateSkBitmapFromHICON(large_icon, large_icon_size));\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  EXPECT_EQ(bitmap->width(), large_icon_size.width());\n  EXPECT_EQ(bitmap->height(), large_icon_size.height());\n  EXPECT_EQ(bitmap->config(), SkBitmap::kARGB_8888_Config);\n  ::DestroyIcon(large_icon);\n}\n\n\/\/ This test case makes sure that when an HICON is created from an SkBitmap,\n\/\/ the returned handle is valid and refers to an icon with the expected\n\/\/ dimentions color depth etc.\nTEST_F(IconUtilTest, TestBasicCreateHICONFromSkBitmap) {\n  scoped_ptr<SkBitmap> bitmap;\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config,\n                    kSmallIconWidth,\n                    kSmallIconHeight);\n  bitmap->allocPixels();\n  HICON icon = IconUtil::CreateHICONFromSkBitmap(*bitmap);\n  EXPECT_NE(icon, static_cast<HICON>(NULL));\n  ICONINFO icon_info;\n  ASSERT_TRUE(::GetIconInfo(icon, &icon_info));\n  EXPECT_TRUE(icon_info.fIcon);\n\n  \/\/ Now that have the icon information, we should obtain the specification of\n  \/\/ the icon's bitmap and make sure it matches the specification of the\n  \/\/ SkBitmap we started with.\n  \/\/\n  \/\/ The bitmap handle contained in the icon information is a handle to a\n  \/\/ compatible bitmap so we need to call ::GetDIBits() in order to retrieve\n  \/\/ the bitmap's header information.\n  BITMAPINFO bitmap_info;\n  ::ZeroMemory(&bitmap_info, sizeof(BITMAPINFO));\n  bitmap_info.bmiHeader.biSize = sizeof(BITMAPINFO);\n  HDC hdc = ::GetDC(NULL);\n  int result = ::GetDIBits(hdc,\n                           icon_info.hbmColor,\n                           0,\n                           kSmallIconWidth,\n                           NULL,\n                           &bitmap_info,\n                           DIB_RGB_COLORS);\n  ASSERT_GT(result, 0);\n  EXPECT_EQ(bitmap_info.bmiHeader.biWidth, kSmallIconWidth);\n  EXPECT_EQ(bitmap_info.bmiHeader.biHeight, kSmallIconHeight);\n  EXPECT_EQ(bitmap_info.bmiHeader.biPlanes, 1);\n  EXPECT_EQ(bitmap_info.bmiHeader.biBitCount, 32);\n  ::ReleaseDC(NULL, hdc);\n  ::DestroyIcon(icon);\n}\n\n\/\/ The following test case makes sure IconUtil::CreateIconFileFromSkBitmap\n\/\/ creates a valid .ico file given an SkBitmap.\nTEST_F(IconUtilTest, TestCreateIconFile) {\n  scoped_ptr<SkBitmap> bitmap;\n  std::wstring icon_filename(test_data_directory_);\n  file_util::AppendToPath(&icon_filename, kTempIconFilename);\n\n  \/\/ Allocating the bitmap.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config,\n                    kSmallIconWidth,\n                    kSmallIconHeight);\n  bitmap->allocPixels();\n\n  \/\/ Setting the pixels to black.\n  memset(bitmap->getPixels(), 0, bitmap->width() * bitmap->height() * 4);\n\n  EXPECT_TRUE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                   icon_filename));\n\n  \/\/ We are currently only testing that it is possible to load an icon from\n  \/\/ the .ico file we just created. We don't really check the additional icon\n  \/\/ images created by IconUtil::CreateIconFileFromSkBitmap.\n  HICON icon = LoadIconFromFile(icon_filename,\n                                kSmallIconWidth,\n                                kSmallIconHeight);\n  EXPECT_NE(icon, static_cast<HICON>(NULL));\n  if (icon != NULL) {\n    ::DestroyIcon(icon);\n  }\n}\n<commit_msg>Remove unneeded ATL header includes.<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 \"app\/gfx\/icon_util.h\"\n#include \"base\/gfx\/size.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"skia\/include\/SkBitmap.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\n  static const wchar_t* const kSmallIconName = L\"icon_util\\\\16_X_16_icon.ico\";\n  static const wchar_t* const kLargeIconName = L\"icon_util\\\\128_X_128_icon.ico\";\n  static const wchar_t* const kTempIconFilename = L\"temp_test_icon.ico\";\n\n  class IconUtilTest : public testing::Test {\n   public:\n    IconUtilTest() {\n      PathService::Get(chrome::DIR_TEST_DATA, &test_data_directory_);\n    }\n    ~IconUtilTest() {}\n\n    static const int kSmallIconWidth = 16;\n    static const int kSmallIconHeight = 16;\n    static const int kLargeIconWidth = 128;\n    static const int kLargeIconHeight = 128;\n\n    \/\/ Given a file name for an .ico file and an image dimentions, this\n    \/\/ function loads the icon and returns an HICON handle.\n    HICON LoadIconFromFile(const std::wstring& filename,\n                           int width,\n                           int height) {\n      HICON icon =\n          static_cast<HICON>(LoadImage(NULL,\n                                       filename.c_str(),\n                                       IMAGE_ICON,\n                                       width,\n                                       height,\n                                       LR_LOADTRANSPARENT | LR_LOADFROMFILE));\n      return icon;\n    }\n\n   protected:\n    \/\/ The root directory for test files.\n    std::wstring test_data_directory_;\n\n   private:\n    DISALLOW_EVIL_CONSTRUCTORS(IconUtilTest);\n  };\n};\n\n\/\/ The following test case makes sure IconUtil::SkBitmapFromHICON fails\n\/\/ gracefully when called with invalid input parameters.\nTEST_F(IconUtilTest, TestIconToBitmapInvalidParameters) {\n  std::wstring icon_filename(test_data_directory_);\n  file_util::AppendToPath(&icon_filename, kSmallIconName);\n  gfx::Size icon_size(kSmallIconWidth, kSmallIconHeight);\n  HICON icon = LoadIconFromFile(icon_filename,\n                                icon_size.width(),\n                                icon_size.height());\n  ASSERT_TRUE(icon != NULL);\n\n  \/\/ Invalid size parameter.\n  gfx::Size invalid_icon_size(kSmallIconHeight, 0);\n  EXPECT_EQ(IconUtil::CreateSkBitmapFromHICON(icon, invalid_icon_size),\n            static_cast<SkBitmap*>(NULL));\n\n  \/\/ Invalid icon.\n  EXPECT_EQ(IconUtil::CreateSkBitmapFromHICON(NULL, icon_size),\n            static_cast<SkBitmap*>(NULL));\n\n  \/\/ The following code should succeed.\n  scoped_ptr<SkBitmap> bitmap;\n  bitmap.reset(IconUtil::CreateSkBitmapFromHICON(icon, icon_size));\n  EXPECT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  ::DestroyIcon(icon);\n}\n\n\/\/ The following test case makes sure IconUtil::CreateHICONFromSkBitmap fails\n\/\/ gracefully when called with invalid input parameters.\nTEST_F(IconUtilTest, TestBitmapToIconInvalidParameters) {\n  HICON icon = NULL;\n  scoped_ptr<SkBitmap> bitmap;\n\n  \/\/ Wrong bitmap format.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kA8_Config, kSmallIconWidth, kSmallIconHeight);\n  icon = IconUtil::CreateHICONFromSkBitmap(*bitmap);\n  EXPECT_EQ(icon, static_cast<HICON>(NULL));\n\n  \/\/ Invalid bitmap size.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config, 0, 0);\n  icon = IconUtil::CreateHICONFromSkBitmap(*bitmap);\n  EXPECT_EQ(icon, static_cast<HICON>(NULL));\n\n  \/\/ Valid bitmap configuration but no pixels allocated.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config,\n                    kSmallIconWidth,\n                    kSmallIconHeight);\n  icon = IconUtil::CreateHICONFromSkBitmap(*bitmap);\n  EXPECT_TRUE(icon == NULL);\n}\n\n\/\/ The following test case makes sure IconUtil::CreateIconFileFromSkBitmap\n\/\/ fails gracefully when called with invalid input parameters.\nTEST_F(IconUtilTest, TestCreateIconFileInvalidParameters) {\n  scoped_ptr<SkBitmap> bitmap;\n  std::wstring valid_icon_filename(test_data_directory_);\n  file_util::AppendToPath(&valid_icon_filename, kSmallIconName);\n  std::wstring invalid_icon_filename(L\"C:\\\\<>?.ico\");\n\n  \/\/ Wrong bitmap format.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kA8_Config, kSmallIconWidth, kSmallIconHeight);\n  EXPECT_FALSE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                    valid_icon_filename));\n\n  \/\/ Invalid bitmap size.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config, 0, 0);\n  EXPECT_FALSE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                    valid_icon_filename));\n\n  \/\/ Bitmap with no allocated pixels.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config,\n                    kSmallIconWidth,\n                    kSmallIconHeight);\n  EXPECT_FALSE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                    valid_icon_filename));\n\n  \/\/ Invalid file name.\n  bitmap->allocPixels();\n  \/\/ Setting the pixels to black.\n  memset(bitmap->getPixels(), 0, bitmap->width() * bitmap->height() * 4);\n  EXPECT_FALSE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                    invalid_icon_filename));\n}\n\n\/\/ This test case makes sure that when we load an icon from disk and convert\n\/\/ the HICON into a bitmap, the bitmap has the expected format and dimentions.\nTEST_F(IconUtilTest, TestCreateSkBitmapFromHICON) {\n  scoped_ptr<SkBitmap> bitmap;\n  std::wstring small_icon_filename(test_data_directory_);\n  file_util::AppendToPath(&small_icon_filename, kSmallIconName);\n  gfx::Size small_icon_size(kSmallIconWidth, kSmallIconHeight);\n  HICON small_icon = LoadIconFromFile(small_icon_filename,\n                                      small_icon_size.width(),\n                                      small_icon_size.height());\n  ASSERT_NE(small_icon, static_cast<HICON>(NULL));\n  bitmap.reset(IconUtil::CreateSkBitmapFromHICON(small_icon, small_icon_size));\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  EXPECT_EQ(bitmap->width(), small_icon_size.width());\n  EXPECT_EQ(bitmap->height(), small_icon_size.height());\n  EXPECT_EQ(bitmap->config(), SkBitmap::kARGB_8888_Config);\n  ::DestroyIcon(small_icon);\n\n  std::wstring large_icon_filename(test_data_directory_);\n  file_util::AppendToPath(&large_icon_filename, kLargeIconName);\n  gfx::Size large_icon_size(kLargeIconWidth, kLargeIconHeight);\n  HICON large_icon = LoadIconFromFile(large_icon_filename,\n                                      large_icon_size.width(),\n                                      large_icon_size.height());\n  ASSERT_NE(large_icon, static_cast<HICON>(NULL));\n  bitmap.reset(IconUtil::CreateSkBitmapFromHICON(large_icon, large_icon_size));\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  EXPECT_EQ(bitmap->width(), large_icon_size.width());\n  EXPECT_EQ(bitmap->height(), large_icon_size.height());\n  EXPECT_EQ(bitmap->config(), SkBitmap::kARGB_8888_Config);\n  ::DestroyIcon(large_icon);\n}\n\n\/\/ This test case makes sure that when an HICON is created from an SkBitmap,\n\/\/ the returned handle is valid and refers to an icon with the expected\n\/\/ dimentions color depth etc.\nTEST_F(IconUtilTest, TestBasicCreateHICONFromSkBitmap) {\n  scoped_ptr<SkBitmap> bitmap;\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config,\n                    kSmallIconWidth,\n                    kSmallIconHeight);\n  bitmap->allocPixels();\n  HICON icon = IconUtil::CreateHICONFromSkBitmap(*bitmap);\n  EXPECT_NE(icon, static_cast<HICON>(NULL));\n  ICONINFO icon_info;\n  ASSERT_TRUE(::GetIconInfo(icon, &icon_info));\n  EXPECT_TRUE(icon_info.fIcon);\n\n  \/\/ Now that have the icon information, we should obtain the specification of\n  \/\/ the icon's bitmap and make sure it matches the specification of the\n  \/\/ SkBitmap we started with.\n  \/\/\n  \/\/ The bitmap handle contained in the icon information is a handle to a\n  \/\/ compatible bitmap so we need to call ::GetDIBits() in order to retrieve\n  \/\/ the bitmap's header information.\n  BITMAPINFO bitmap_info;\n  ::ZeroMemory(&bitmap_info, sizeof(BITMAPINFO));\n  bitmap_info.bmiHeader.biSize = sizeof(BITMAPINFO);\n  HDC hdc = ::GetDC(NULL);\n  int result = ::GetDIBits(hdc,\n                           icon_info.hbmColor,\n                           0,\n                           kSmallIconWidth,\n                           NULL,\n                           &bitmap_info,\n                           DIB_RGB_COLORS);\n  ASSERT_GT(result, 0);\n  EXPECT_EQ(bitmap_info.bmiHeader.biWidth, kSmallIconWidth);\n  EXPECT_EQ(bitmap_info.bmiHeader.biHeight, kSmallIconHeight);\n  EXPECT_EQ(bitmap_info.bmiHeader.biPlanes, 1);\n  EXPECT_EQ(bitmap_info.bmiHeader.biBitCount, 32);\n  ::ReleaseDC(NULL, hdc);\n  ::DestroyIcon(icon);\n}\n\n\/\/ The following test case makes sure IconUtil::CreateIconFileFromSkBitmap\n\/\/ creates a valid .ico file given an SkBitmap.\nTEST_F(IconUtilTest, TestCreateIconFile) {\n  scoped_ptr<SkBitmap> bitmap;\n  std::wstring icon_filename(test_data_directory_);\n  file_util::AppendToPath(&icon_filename, kTempIconFilename);\n\n  \/\/ Allocating the bitmap.\n  bitmap.reset(new SkBitmap);\n  ASSERT_NE(bitmap.get(), static_cast<SkBitmap*>(NULL));\n  bitmap->setConfig(SkBitmap::kARGB_8888_Config,\n                    kSmallIconWidth,\n                    kSmallIconHeight);\n  bitmap->allocPixels();\n\n  \/\/ Setting the pixels to black.\n  memset(bitmap->getPixels(), 0, bitmap->width() * bitmap->height() * 4);\n\n  EXPECT_TRUE(IconUtil::CreateIconFileFromSkBitmap(*bitmap,\n                                                   icon_filename));\n\n  \/\/ We are currently only testing that it is possible to load an icon from\n  \/\/ the .ico file we just created. We don't really check the additional icon\n  \/\/ images created by IconUtil::CreateIconFileFromSkBitmap.\n  HICON icon = LoadIconFromFile(icon_filename,\n                                kSmallIconWidth,\n                                kSmallIconHeight);\n  EXPECT_NE(icon, static_cast<HICON>(NULL));\n  if (icon != NULL) {\n    ::DestroyIcon(icon);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ testIK.cpp\r\n\/\/ Author: Ayman Habib based on Peter Loan's version\r\n\/* Copyright (c) 2005, Stanford University and Peter Loan.\r\n* \r\n* Permission is hereby granted, free of charge, to any person obtaining\r\n* a copy of this software and associated documentation files (the\r\n* \"Software\"), to deal in the Software without restriction, including \r\n* without limitation the rights to use, copy, modify, merge, publish, \r\n* distribute, sublicense, and\/or sell copies of the Software, and to\r\n* permit persons to whom the Software is furnished to do so, subject\r\n* to the following conditions:\r\n* \r\n* The above copyright notice and this permission notice shall be included \r\n* in all copies or substantial portions of the Software.\r\n* \r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r\n* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n\r\n\/\/ INCLUDES\r\n#include <string>\r\n#include <OpenSim\/Tools\/rdTools.h>\r\n#include <OpenSim\/Tools\/Storage.h>\r\n#include <OpenSim\/Tools\/ScaleSet.h>\r\n#include <OpenSim\/Tools\/IO.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmModel.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmKinematicsEngine.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmMarkerSet.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmSubject.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmMarkerData.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmMotionData.h>\r\n#include <OpenSim\/Applications\/IK\/SimmIKSolverImpl.h>\r\n#include <OpenSim\/Applications\/Scale\/SimmScalerImpl.h>\r\n#include <OpenSim\/Applications\/IK\/SimmInverseKinematicsTarget.h>\r\n\r\n\r\n\r\nusing namespace OpenSim;\r\nusing namespace std;\r\n\r\nstring filesToCompare[] = {\r\n\t\"subject_trial_ik.mot\"\r\n};\r\n\/\/______________________________________________________________________________\r\n\/**\r\n* Test program to read SIMM model elements from an XML file.\r\n*\r\n* @param argc Number of command line arguments (should be 1).\r\n* @param argv Command line arguments:  simmReadXML inFile\r\n*\/\r\nint main(int argc,char **argv)\r\n{\r\n\r\n\t\/\/ Construct model and read parameters file\r\n\tSimmSubject* subject = new SimmSubject(\"subject_ik_setup.xml\");\r\n\tSimmModel* model = subject->createModel();\r\n\tmodel->setup();\r\n\r\n\t\/\/--------------------- IK proper section\r\n\t{\r\n\t\ttry \r\n\t\t{\t\r\n\t\t\t\/* CLAY- Commented out until we fix, so things would compile...\r\n\r\n\t\t\t\/\/ Update markers to correspond to those specified in IKParams block, potentially adding new ones\r\n\t\t\tmodel->updateMarkers(subject->getIKParams().getMarkerSet());\r\n\t\t\t\/\/ Initialize coordinates based on user input\r\n\t\t\tmodel->updateCoordinates(subject->getIKParams().getCoordinateSet());\r\n\r\n\t\t\t\/\/ Get trial params\r\n\t\t\tSimmIKTrialParams& trialParams = subject->getIKParams().getTrialParams(0);\r\n\t\t\t\/\/ Handle coordinates file\r\n\t\t\tSimmMotionData* coordinateValues = trialParams.getCoordinateValues(*model);\r\n\r\n\t\t\t\/\/ Setup IK problem for trial\r\n\t\t\t\/\/ We need SimmInverseKinematicsTarget, iksolver (SimmIKSolverImpl)\r\n\t\t\t\/\/ Create SimmMarkerData Object from trc file of experimental motion data\r\n\t\t\tSimmMarkerData motionTrialData(trialParams.getMarkerDataFilename());\r\n\t\t\tmotionTrialData.convertToUnits(model->getLengthUnits());\r\n\t\t\tStorage inputStorage;\r\n\t\t\t\/\/ Convert read trc fil into \"common\" rdStroage format\r\n\t\t\tmotionTrialData.makeRdStorage(inputStorage);\r\n\r\n\t\t\tif (coordinateValues != 0) {\r\n\t\t\t\t\/\/ Adjust the user-defined start and end times to make sure they are in the\r\n\t\t\t\t\/\/ range of the marker data. This must be done so that you only look in the\r\n\t\t\t\t\/\/ coordinate data for rows that will actually be solved.\r\n\t\t\t\tdouble firstStateTime = inputStorage.getFirstTime();\r\n\t\t\t\tdouble lastStateTime = inputStorage.getLastTime();\r\n\t\t\t\tdouble startTime = (firstStateTime>trialParams.getStartTime()) ? firstStateTime : trialParams.getStartTime();\r\n\t\t\t\tdouble endTime =  (lastStateTime<trialParams.getEndTime()) ? lastStateTime : trialParams.getEndTime();\r\n\r\n\t\t\t\t\/\/ Add the coordinate data to the marker data. There must be a row of\r\n\t\t\t\t\/\/ corresponding coordinate data for every row of marker data that will\r\n\t\t\t\t\/\/ be solved, or it is a fatal error.\r\n\t\t\t\tcoordinateValues->addToRdStorage(inputStorage, startTime, endTime);\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ Create target\r\n\t\t\tSimmInverseKinematicsTarget *target = new SimmInverseKinematicsTarget(*model, inputStorage);\r\n\t\t\t\/\/ Create solver\r\n\t\t\tSimmIKSolverImpl *ikSolver = new SimmIKSolverImpl(*target);\r\n\t\t\t\/\/ Solve\r\n\t\t\tStorage\toutputStorage; \r\n\t\t\tikSolver->solveFrames(trialParams, inputStorage, outputStorage);\r\n\r\n\t\t\tOpenSim::IO::SetPrecision(6);\r\n\t\t\toutputStorage.setWriteSIMMHeader(true);\r\n\t\t\toutputStorage.print(trialParams.getOutputMotionFilename().c_str());\r\n\r\n\t\t\tdelete coordinateValues;\r\n\t\t\tdelete ikSolver;\r\n\t\t\tdelete target;\r\n\r\n\t\t\tCLAY *\/\r\n\t\t}\r\n\t\tcatch (Exception &x)\r\n\t\t{\r\n\t\t\tx.print(cout);\r\n\t\t\tcout << \"Press Return to continue.\" << endl;\r\n\t\t\tcout.flush();\r\n\t\t\tint c = getc( stdin );\r\n\t\t\treturn 1;\r\n\t\t}\r\n\t}\r\n\tdelete subject;\r\n\r\n\t\/* Compare results with standard*\/\r\n\tbool success = true;\r\n\tfor (int i=0; i < 1 && success; i++){\r\n\t\tstring command = \"cmp \"+filesToCompare[i]+\" \"+\"std_\"+filesToCompare[i];\r\n\t\tsuccess = success && (system(command.c_str())==0);\r\n\t}\r\n\r\n\treturn (success?0:1);\r\n}\r\n\r\n<commit_msg>Commented out a few lines to make testIK compile.<commit_after>\/\/ testIK.cpp\r\n\/\/ Author: Ayman Habib based on Peter Loan's version\r\n\/* Copyright (c) 2005, Stanford University and Peter Loan.\r\n* \r\n* Permission is hereby granted, free of charge, to any person obtaining\r\n* a copy of this software and associated documentation files (the\r\n* \"Software\"), to deal in the Software without restriction, including \r\n* without limitation the rights to use, copy, modify, merge, publish, \r\n* distribute, sublicense, and\/or sell copies of the Software, and to\r\n* permit persons to whom the Software is furnished to do so, subject\r\n* to the following conditions:\r\n* \r\n* The above copyright notice and this permission notice shall be included \r\n* in all copies or substantial portions of the Software.\r\n* \r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r\n* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n\r\n\/\/ INCLUDES\r\n#include <string>\r\n#include <OpenSim\/Tools\/rdTools.h>\r\n#include <OpenSim\/Tools\/Storage.h>\r\n#include <OpenSim\/Tools\/ScaleSet.h>\r\n#include <OpenSim\/Tools\/IO.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmModel.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmKinematicsEngine.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmMarkerSet.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmSubject.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmMarkerData.h>\r\n#include <OpenSim\/Simulation\/SIMM\/SimmMotionData.h>\r\n#include <OpenSim\/Applications\/IK\/SimmIKSolverImpl.h>\r\n#include <OpenSim\/Applications\/Scale\/SimmScalerImpl.h>\r\n#include <OpenSim\/Applications\/IK\/SimmInverseKinematicsTarget.h>\r\n\r\n\r\n\r\nusing namespace OpenSim;\r\nusing namespace std;\r\n\r\nstring filesToCompare[] = {\r\n\t\"subject_trial_ik.mot\"\r\n};\r\n\/\/______________________________________________________________________________\r\n\/**\r\n* Test program to read SIMM model elements from an XML file.\r\n*\r\n* @param argc Number of command line arguments (should be 1).\r\n* @param argv Command line arguments:  simmReadXML inFile\r\n*\/\r\nint main(int argc,char **argv)\r\n{\r\n\r\n\t\/\/ Construct model and read parameters file\r\n\tSimmSubject* subject = new SimmSubject(\"subject_ik_setup.xml\");\r\n\tSimmModel* model = subject->createModel();\r\n\tmodel->setup();\r\n\r\n\t\/\/--------------------- IK proper section\r\n\t{\r\n\t\ttry\r\n\t\t{\t\r\n\t\t\t\/* CLAY- Commented out until we fix, so things would compile...\r\n\r\n\t\t\t\/\/ Update markers to correspond to those specified in IKParams block, potentially adding new ones\r\n\t\t\tmodel->updateMarkers(subject->getIKParams().getMarkerSet());\r\n\t\t\t\/\/ Initialize coordinates based on user input\r\n\t\t\tmodel->updateCoordinates(subject->getIKParams().getCoordinateSet());\r\n\r\n\t\t\t\/\/ Get trial params\r\n\t\t\tSimmIKTrialParams& trialParams = subject->getIKParams().getTrialParams(0);\r\n\t\t\t\/\/ Handle coordinates file\r\n\t\t\tSimmMotionData* coordinateValues = trialParams.getCoordinateValues(*model);\r\n\r\n\t\t\t\/\/ Setup IK problem for trial\r\n\t\t\t\/\/ We need SimmInverseKinematicsTarget, iksolver (SimmIKSolverImpl)\r\n\t\t\t\/\/ Create SimmMarkerData Object from trc file of experimental motion data\r\n\t\t\tSimmMarkerData motionTrialData(trialParams.getMarkerDataFilename());\r\n\t\t\tmotionTrialData.convertToUnits(model->getLengthUnits());\r\n\t\t\tStorage inputStorage;\r\n\t\t\t\/\/ Convert read trc fil into \"common\" rdStroage format\r\n\t\t\tmotionTrialData.makeRdStorage(inputStorage);\r\n\r\n\t\t\tif (coordinateValues != 0) {\r\n\t\t\t\t\/\/ Adjust the user-defined start and end times to make sure they are in the\r\n\t\t\t\t\/\/ range of the marker data. This must be done so that you only look in the\r\n\t\t\t\t\/\/ coordinate data for rows that will actually be solved.\r\n\t\t\t\tdouble firstStateTime = inputStorage.getFirstTime();\r\n\t\t\t\tdouble lastStateTime = inputStorage.getLastTime();\r\n\t\t\t\tdouble startTime = (firstStateTime>trialParams.getStartTime()) ? firstStateTime : trialParams.getStartTime();\r\n\t\t\t\tdouble endTime =  (lastStateTime<trialParams.getEndTime()) ? lastStateTime : trialParams.getEndTime();\r\n\r\n\t\t\t\t\/\/ Add the coordinate data to the marker data. There must be a row of\r\n\t\t\t\t\/\/ corresponding coordinate data for every row of marker data that will\r\n\t\t\t\t\/\/ be solved, or it is a fatal error.\r\n\t\t\t\tcoordinateValues->addToRdStorage(inputStorage, startTime, endTime);\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ Create target\r\n\t\t\tSimmInverseKinematicsTarget *target = new SimmInverseKinematicsTarget(*model, inputStorage);\r\n\t\t\t\/\/ Create solver\r\n\t\t\tSimmIKSolverImpl *ikSolver = new SimmIKSolverImpl(*target);\r\n\t\t\t\/\/ Solve\r\n\t\t\tStorage\toutputStorage; \r\n\t\t\tikSolver->solveFrames(trialParams, inputStorage, outputStorage);\r\n\r\n\t\t\tOpenSim::IO::SetPrecision(6);\r\n\t\t\toutputStorage.setWriteSIMMHeader(true);\r\n\t\t\toutputStorage.print(trialParams.getOutputMotionFilename().c_str());\r\n\r\n\t\t\tdelete coordinateValues;\r\n\t\t\tdelete ikSolver;\r\n\t\t\tdelete target;\r\n\r\n\t\t\tCLAY- Commented out so things would compile. *\/\r\n\t\t}\r\n\t\tcatch (Exception &x)\r\n\t\t{\r\n\t\t\tx.print(cout);\r\n\t\t\tcout << \"Press Return to continue.\" << endl;\r\n\t\t\tcout.flush();\r\n\t\t\tint c = getc( stdin );\r\n\t\t\treturn 1;\r\n\t\t}\r\n\t}\r\n\tdelete subject;\r\n\r\n\t\/* Compare results with standard*\/\r\n\tbool success = true;\r\n\tfor (int i=0; i < 1 && success; i++){\r\n\t\tstring command = \"cmp \"+filesToCompare[i]+\" \"+\"std_\"+filesToCompare[i];\r\n\t\tsuccess = success && (system(command.c_str())==0);\r\n\t}\r\n\r\n\treturn (success?0:1);\r\n}\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2009-2010 Sony Pictures Imageworks Inc., et al.\nAll Rights Reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\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 Sony Pictures Imageworks 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.\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\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\file\n\/\/\/\n\/\/\/ Shader interpreter implementation of string functions\n\/\/\/ such as format, concat, printf, etc.\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <cstdarg>\n\n#include <OpenImageIO\/strutil.h>\n#include <OpenImageIO\/filesystem.h>\n#include <OpenImageIO\/fmath.h>\n\n#include \"oslexec_pvt.h\"\n\n\n#define USTR(cstr) (*((ustring *)&cstr))\n\nOSL_NAMESPACE_ENTER\nnamespace pvt {\n\n\n\/\/ Only define 2-arg version of concat, sort it out upstream\nOSL_SHADEOP const char *\nosl_concat_sss (const char *s, const char *t)\n{\n    size_t sl = USTR(s).length();\n    size_t tl = USTR(t).length();\n    size_t len = sl + tl;\n    std::unique_ptr<char[]> heap_buf;\n    char local_buf[256];\n    char* buf = local_buf;\n    if (len > sizeof(local_buf)) {\n        heap_buf.reset(new char[len]);\n        buf = heap_buf.get();\n    }\n    memcpy(buf     , s, sl);\n    memcpy(buf + sl, t, tl);\n    return ustring(local_buf, len).c_str();\n}\n\nOSL_SHADEOP int\nosl_strlen_is (const char *s)\n{\n    return (int) USTR(s).length();\n}\n\nOSL_SHADEOP int\nosl_hash_is (const char *s)\n{\n    return (int) USTR(s).hash();\n}\n\nOSL_SHADEOP int\nosl_getchar_isi (const char *str, int index)\n{\n    return str && unsigned(index) < USTR(str).length() ? str[index] : 0;\n}\n\n\n    OSL_SHADEOP int\nosl_startswith_iss (const char *s_, const char *substr_)\n{\n    ustring substr (USTR(substr_));\n    size_t substr_len = substr.length();\n    if (substr_len == 0)         \/\/ empty substr always matches\n        return 1;\n    ustring s (USTR(s_));\n    size_t s_len = s.length();\n    if (substr_len > s_len)      \/\/ longer needle than haystack can't\n        return 0;                \/\/ match (including empty s)\n    return strncmp (s.c_str(), substr.c_str(), substr_len) == 0;\n}\n\nOSL_SHADEOP int\nosl_endswith_iss (const char *s_, const char *substr_)\n{\n    ustring substr (USTR(substr_));\n    size_t substr_len = substr.length();\n    if (substr_len == 0)         \/\/ empty substr always matches\n        return 1;\n    ustring s (USTR(s_));\n    size_t s_len = s.length();\n    if (substr_len > s_len)      \/\/ longer needle than haystack can't\n        return 0;                \/\/ match (including empty s)\n    return strncmp (s.c_str()+s_len-substr_len, substr.c_str(), substr_len) == 0;\n}\n\nOSL_SHADEOP int\nosl_stoi_is (const char *str)\n{\n    return str ? Strutil::from_string<int>(str) : 0;\n}\n\nOSL_SHADEOP float\nosl_stof_fs (const char *str)\n{\n    return str ? Strutil::from_string<float>(str) : 0.0f;\n}\n\nOSL_SHADEOP const char *\nosl_substr_ssii (const char *s_, int start, int length)\n{\n    ustring s (USTR(s_));\n    int slen = int (s.length());\n    if (slen == 0)\n        return NULL;  \/\/ No substring of empty string\n    int b = start;\n    if (b < 0)\n        b += slen;\n    b = Imath::clamp (b, 0, slen);\n    return ustring(s, b, Imath::clamp (length, 0, slen)).c_str();\n}\n\n\nOSL_SHADEOP int\nosl_regex_impl (void *sg_, const char *subject_, void *results, int nresults,\n                const char *pattern, int fullmatch)\n{\n    ShaderGlobals *sg = (ShaderGlobals *)sg_;\n    ShadingContext *ctx = sg->context;\n    const std::string &subject (ustring::from_unique(subject_).string());\n    match_results<std::string::const_iterator> mresults;\n    const regex &regex (ctx->find_regex (USTR(pattern)));\n    if (nresults > 0) {\n        std::string::const_iterator start = subject.begin();\n        int res = fullmatch ? regex_match (subject, mresults, regex)\n                            : regex_search (subject, mresults, regex);\n        int *m = (int *)results;\n        for (int r = 0;  r < nresults;  ++r) {\n            if (r\/2 < (int)mresults.size()) {\n                if ((r & 1) == 0)\n                    m[r] = mresults[r\/2].first - start;\n                else\n                    m[r] = mresults[r\/2].second - start;\n            } else {\n                m[r] = USTR(pattern).length();\n            }\n        }\n        return res;\n    } else {\n        return fullmatch ? regex_match (subject, regex)\n                         : regex_search (subject, regex);\n    }\n}\n\n\nOSL_SHADEOP const char *\nosl_format (const char* format_str, ...)\n{\n    va_list args;\n    va_start (args, format_str);\n    std::string s = Strutil::vformat (format_str, args);\n    va_end (args);\n    return ustring(s).c_str();\n}\n\n\nOSL_SHADEOP void\nosl_printf (ShaderGlobals *sg, const char* format_str, ...)\n{\n    va_list args;\n    va_start (args, format_str);\n#if 0\n    \/\/ Make super sure we know we are excuting LLVM-generated code!\n    std::string newfmt = std::string(\"llvm: \") + format_str;\n    format_str = newfmt.c_str();\n#endif\n    std::string s = Strutil::vformat (format_str, args);\n    va_end (args);\n    sg->context->messagef(\"%s\", s);\n}\n\n\nOSL_SHADEOP void\nosl_error (ShaderGlobals *sg, const char* format_str, ...)\n{\n    va_list args;\n    va_start (args, format_str);\n    std::string s = Strutil::vformat (format_str, args);\n    va_end (args);\n    sg->context->errorf(\"%s\", s);\n}\n\n\nOSL_SHADEOP void\nosl_warning (ShaderGlobals *sg, const char* format_str, ...)\n{\n    if (sg->context->allow_warnings()) {\n        va_list args;\n        va_start (args, format_str);\n        std::string s = Strutil::vformat (format_str, args);\n        va_end (args);\n        sg->context->warningf(\"%s\", s);\n    }\n}\n\n\n\nOSL_SHADEOP void\nosl_fprintf (ShaderGlobals *sg, const char *filename,\n             const char* format_str, ...)\n{\n    va_list args;\n    va_start (args, format_str);\n    std::string s = Strutil::vformat (format_str, args);\n    va_end (args);\n\n    static OIIO::mutex fprintf_mutex;\n    OIIO::lock_guard lock (fprintf_mutex);\n    FILE *file = OIIO::Filesystem::fopen (filename, \"a\");\n    fputs (s.c_str(), file);\n    fclose (file);\n}\n\n\n\nOSL_SHADEOP int\nosl_split (const char *str, ustring *results, const char *sep,\n           int maxsplit, int resultslen)\n{\n    maxsplit = OIIO::clamp (maxsplit, 0, resultslen);\n    std::vector<std::string> splits;\n    Strutil::split (USTR(str).string(), splits, USTR(sep).string(), maxsplit);\n    int n = std::min (maxsplit, (int)splits.size());\n    for (int i = 0;  i < n;  ++i)\n        results[i] = ustring(splits[i]);\n    return n;\n}\n\n\n} \/\/ end namespace pvt\nOSL_NAMESPACE_EXIT\n<commit_msg>Fix bug in recent string patch 1104 (#1105)<commit_after>\/*\nCopyright (c) 2009-2010 Sony Pictures Imageworks Inc., et al.\nAll Rights Reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\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 Sony Pictures Imageworks 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.\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\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\file\n\/\/\/\n\/\/\/ Shader interpreter implementation of string functions\n\/\/\/ such as format, concat, printf, etc.\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <cstdarg>\n\n#include <OpenImageIO\/strutil.h>\n#include <OpenImageIO\/filesystem.h>\n#include <OpenImageIO\/fmath.h>\n\n#include \"oslexec_pvt.h\"\n\n\n#define USTR(cstr) (*((ustring *)&cstr))\n\nOSL_NAMESPACE_ENTER\nnamespace pvt {\n\n\n\/\/ Only define 2-arg version of concat, sort it out upstream\nOSL_SHADEOP const char *\nosl_concat_sss (const char *s, const char *t)\n{\n    size_t sl = USTR(s).length();\n    size_t tl = USTR(t).length();\n    size_t len = sl + tl;\n    std::unique_ptr<char[]> heap_buf;\n    char local_buf[256];\n    char* buf = local_buf;\n    if (len > sizeof(local_buf)) {\n        heap_buf.reset(new char[len]);\n        buf = heap_buf.get();\n    }\n    memcpy(buf     , s, sl);\n    memcpy(buf + sl, t, tl);\n    return ustring(buf, len).c_str();\n}\n\nOSL_SHADEOP int\nosl_strlen_is (const char *s)\n{\n    return (int) USTR(s).length();\n}\n\nOSL_SHADEOP int\nosl_hash_is (const char *s)\n{\n    return (int) USTR(s).hash();\n}\n\nOSL_SHADEOP int\nosl_getchar_isi (const char *str, int index)\n{\n    return str && unsigned(index) < USTR(str).length() ? str[index] : 0;\n}\n\n\n    OSL_SHADEOP int\nosl_startswith_iss (const char *s_, const char *substr_)\n{\n    ustring substr (USTR(substr_));\n    size_t substr_len = substr.length();\n    if (substr_len == 0)         \/\/ empty substr always matches\n        return 1;\n    ustring s (USTR(s_));\n    size_t s_len = s.length();\n    if (substr_len > s_len)      \/\/ longer needle than haystack can't\n        return 0;                \/\/ match (including empty s)\n    return strncmp (s.c_str(), substr.c_str(), substr_len) == 0;\n}\n\nOSL_SHADEOP int\nosl_endswith_iss (const char *s_, const char *substr_)\n{\n    ustring substr (USTR(substr_));\n    size_t substr_len = substr.length();\n    if (substr_len == 0)         \/\/ empty substr always matches\n        return 1;\n    ustring s (USTR(s_));\n    size_t s_len = s.length();\n    if (substr_len > s_len)      \/\/ longer needle than haystack can't\n        return 0;                \/\/ match (including empty s)\n    return strncmp (s.c_str()+s_len-substr_len, substr.c_str(), substr_len) == 0;\n}\n\nOSL_SHADEOP int\nosl_stoi_is (const char *str)\n{\n    return str ? Strutil::from_string<int>(str) : 0;\n}\n\nOSL_SHADEOP float\nosl_stof_fs (const char *str)\n{\n    return str ? Strutil::from_string<float>(str) : 0.0f;\n}\n\nOSL_SHADEOP const char *\nosl_substr_ssii (const char *s_, int start, int length)\n{\n    ustring s (USTR(s_));\n    int slen = int (s.length());\n    if (slen == 0)\n        return NULL;  \/\/ No substring of empty string\n    int b = start;\n    if (b < 0)\n        b += slen;\n    b = Imath::clamp (b, 0, slen);\n    return ustring(s, b, Imath::clamp (length, 0, slen)).c_str();\n}\n\n\nOSL_SHADEOP int\nosl_regex_impl (void *sg_, const char *subject_, void *results, int nresults,\n                const char *pattern, int fullmatch)\n{\n    ShaderGlobals *sg = (ShaderGlobals *)sg_;\n    ShadingContext *ctx = sg->context;\n    const std::string &subject (ustring::from_unique(subject_).string());\n    match_results<std::string::const_iterator> mresults;\n    const regex &regex (ctx->find_regex (USTR(pattern)));\n    if (nresults > 0) {\n        std::string::const_iterator start = subject.begin();\n        int res = fullmatch ? regex_match (subject, mresults, regex)\n                            : regex_search (subject, mresults, regex);\n        int *m = (int *)results;\n        for (int r = 0;  r < nresults;  ++r) {\n            if (r\/2 < (int)mresults.size()) {\n                if ((r & 1) == 0)\n                    m[r] = mresults[r\/2].first - start;\n                else\n                    m[r] = mresults[r\/2].second - start;\n            } else {\n                m[r] = USTR(pattern).length();\n            }\n        }\n        return res;\n    } else {\n        return fullmatch ? regex_match (subject, regex)\n                         : regex_search (subject, regex);\n    }\n}\n\n\nOSL_SHADEOP const char *\nosl_format (const char* format_str, ...)\n{\n    va_list args;\n    va_start (args, format_str);\n    std::string s = Strutil::vformat (format_str, args);\n    va_end (args);\n    return ustring(s).c_str();\n}\n\n\nOSL_SHADEOP void\nosl_printf (ShaderGlobals *sg, const char* format_str, ...)\n{\n    va_list args;\n    va_start (args, format_str);\n#if 0\n    \/\/ Make super sure we know we are excuting LLVM-generated code!\n    std::string newfmt = std::string(\"llvm: \") + format_str;\n    format_str = newfmt.c_str();\n#endif\n    std::string s = Strutil::vformat (format_str, args);\n    va_end (args);\n    sg->context->messagef(\"%s\", s);\n}\n\n\nOSL_SHADEOP void\nosl_error (ShaderGlobals *sg, const char* format_str, ...)\n{\n    va_list args;\n    va_start (args, format_str);\n    std::string s = Strutil::vformat (format_str, args);\n    va_end (args);\n    sg->context->errorf(\"%s\", s);\n}\n\n\nOSL_SHADEOP void\nosl_warning (ShaderGlobals *sg, const char* format_str, ...)\n{\n    if (sg->context->allow_warnings()) {\n        va_list args;\n        va_start (args, format_str);\n        std::string s = Strutil::vformat (format_str, args);\n        va_end (args);\n        sg->context->warningf(\"%s\", s);\n    }\n}\n\n\n\nOSL_SHADEOP void\nosl_fprintf (ShaderGlobals *sg, const char *filename,\n             const char* format_str, ...)\n{\n    va_list args;\n    va_start (args, format_str);\n    std::string s = Strutil::vformat (format_str, args);\n    va_end (args);\n\n    static OIIO::mutex fprintf_mutex;\n    OIIO::lock_guard lock (fprintf_mutex);\n    FILE *file = OIIO::Filesystem::fopen (filename, \"a\");\n    fputs (s.c_str(), file);\n    fclose (file);\n}\n\n\n\nOSL_SHADEOP int\nosl_split (const char *str, ustring *results, const char *sep,\n           int maxsplit, int resultslen)\n{\n    maxsplit = OIIO::clamp (maxsplit, 0, resultslen);\n    std::vector<std::string> splits;\n    Strutil::split (USTR(str).string(), splits, USTR(sep).string(), maxsplit);\n    int n = std::min (maxsplit, (int)splits.size());\n    for (int i = 0;  i < n;  ++i)\n        results[i] = ustring(splits[i]);\n    return n;\n}\n\n\n} \/\/ end namespace pvt\nOSL_NAMESPACE_EXIT\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <cstdint>\n#include <vector>\n\n#include \"ExeUnpacker.h\"\n\n#include \"..\/Utilities\/Bytes.h\"\n#include \"..\/Utilities\/Debug.h\"\n#include \"..\/Utilities\/String.h\"\n\n#include \"components\/vfs\/manager.hpp\"\n\nExeUnpacker::ExeUnpacker(const std::string &filename)\n{\n\tVFS::IStreamPtr stream = VFS::Manager::get().open(filename.c_str());\n\tDebug::check(stream != nullptr, \"Exe Unpacker\", \"Could not open \\\"\" + filename + \"\\\".\");\n\n\tstream->seekg(0, std::ios::end);\n\tconst auto fileSize = stream->tellg();\n\tstream->seekg(0, std::ios::beg);\n\n\tstd::vector<uint8_t> srcData(fileSize);\n\tstream->read(reinterpret_cast<char*>(srcData.data()), srcData.size());\n\n\t\/\/ Beginning and end of compressed data in the executable.\n\tconst uint8_t *compressedStart = srcData.data() + 752;\n\tconst uint8_t *compressedEnd = srcData.data() + (srcData.size() - 8);\n\n\t\/\/ Last word of compressed data must be 0xFFFF.\n\tconst uint16_t lastCompWord = Bytes::getLE16(compressedEnd - 2);\n\tDebug::check(lastCompWord == 0xFFFF, \"Exe Unpacker\", \n\t\t\"Invalid last compressed word \\\"\" + String::toHexString(lastCompWord) + \"\\\".\");\n\n\t\/\/ Calculate length of decompressed data -- more precise method (for A.EXE).\n\tconst size_t decompLen = [compressedEnd]()\n\t{\n\t\tconst uint16_t segment = Bytes::getLE16(compressedEnd);\n\t\tconst uint16_t offset = Bytes::getLE16(compressedEnd + 2);\n\t\treturn (segment * 16) + offset;\n\t}();\n\n\t\/\/ Buffer for the decompressed data (also little endian).\n\tstd::vector<uint8_t> decomp(decompLen);\n\t\n\tconst size_t compressedByteCount = compressedEnd - compressedStart;\n\tfor (size_t i = 0; i < compressedByteCount; i += 2)\n\t{\n\t\tconst uint16_t bitArray = Bytes::getLE16(compressedStart + i);\n\n\t\t\/\/ Loop over each bit in the bit array.\n\t\tfor (int bitIndex = 0; bitIndex < 16; ++bitIndex)\n\t\t{\n\t\t\tconst bool bit = (bitArray & (1 << bitIndex)) != 0;\n\n\t\t\t\/\/ Default mode...\n\n\t\t\t\/\/ Decrypt mode...\n\n\t\t\t\/\/ Copy mode...\n\n\t\t\t\/\/ Maybe make lambdas for each mode, perhaps? Or private class methods?\n\t\t\t\/\/ A \"DecompressionMode\" enum class?\n\t\t}\n\t}\n\n\t\/\/ Keep this until the decompressor works.\n\tDebug::crash(\"Exe Unpacker\", \"Not implemented.\");\n}\n\nExeUnpacker::~ExeUnpacker()\n{\n\n}\n\nconst std::string &ExeUnpacker::getText() const\n{\n\treturn this->text;\n}\n<commit_msg>Added default and decrypt modes to A.EXE unpacker.<commit_after>#include <algorithm>\n#include <array>\n#include <cstdint>\n#include <vector>\n\n#include \"ExeUnpacker.h\"\n\n#include \"..\/Utilities\/Bytes.h\"\n#include \"..\/Utilities\/Debug.h\"\n#include \"..\/Utilities\/String.h\"\n\n#include \"components\/vfs\/manager.hpp\"\n\nenum class DecompressionMode\n{\n\tDefault,\n\tDecrypt,\n\tCopy\n};\n\nExeUnpacker::ExeUnpacker(const std::string &filename)\n{\n\tVFS::IStreamPtr stream = VFS::Manager::get().open(filename.c_str());\n\tDebug::check(stream != nullptr, \"Exe Unpacker\", \"Could not open \\\"\" + filename + \"\\\".\");\n\n\tstream->seekg(0, std::ios::end);\n\tconst auto fileSize = stream->tellg();\n\tstream->seekg(0, std::ios::beg);\n\n\tstd::vector<uint8_t> srcData(fileSize);\n\tstream->read(reinterpret_cast<char*>(srcData.data()), srcData.size());\n\n\t\/\/ Beginning and end of compressed data in the executable.\n\tconst uint8_t *compressedStart = srcData.data() + 752;\n\tconst uint8_t *compressedEnd = srcData.data() + (srcData.size() - 8);\n\n\t\/\/ Last word of compressed data must be 0xFFFF.\n\tconst uint16_t lastCompWord = Bytes::getLE16(compressedEnd - 2);\n\tDebug::check(lastCompWord == 0xFFFF, \"Exe Unpacker\", \n\t\t\"Invalid last compressed word \\\"\" + String::toHexString(lastCompWord) + \"\\\".\");\n\n\t\/\/ Calculate length of decompressed data -- more precise method (for A.EXE).\n\tconst size_t decompLen = [compressedEnd]()\n\t{\n\t\tconst uint16_t segment = Bytes::getLE16(compressedEnd);\n\t\tconst uint16_t offset = Bytes::getLE16(compressedEnd + 2);\n\t\treturn (segment * 16) + offset;\n\t}();\n\n\t\/\/ Buffer for the decompressed data (also little endian).\n\tstd::vector<uint8_t> decomp(decompLen);\n\n\t\/\/ Current position for inserting decompressed data.\n\tsize_t decompIndex = 0;\n\n\t\/\/ The decompression mode determines how bits are interpreted.\n\tauto mode = DecompressionMode::Default;\n\t\n\tconst size_t compressedByteCount = compressedEnd - compressedStart;\n\tfor (size_t i = 0; i < (compressedByteCount - 1); i += 2)\n\t{\n\t\tconst uint16_t bitArray = Bytes::getLE16(compressedStart + i);\n\n\t\t\/\/ Loop over each bit in the bit array.\n\t\tfor (int bitIndex = 0; bitIndex < 16; ++bitIndex)\n\t\t{\n\t\t\tconst bool bit = (bitArray & (1 << bitIndex)) != 0;\n\n\t\t\tif (mode == DecompressionMode::Default)\n\t\t\t{\n\t\t\t\t\/\/ The value of the bit determines the next mode.\n\t\t\t\t\/\/ - I'm thinking that a decompression \"mode\" is unnecessary, and the\n\t\t\t\t\/\/   code can simply branch on the bit itself for copying or decrypting.\n\t\t\t\t\/\/   Additionally, the mode check above is always true.\n\t\t\t\tmode = bit ? DecompressionMode::Copy : DecompressionMode::Decrypt;\n\t\t\t}\n\n\t\t\tif (mode == DecompressionMode::Decrypt)\n\t\t\t{\n\t\t\t\t\/\/ Read the next byte from the compressed data (after the bit array).\n\t\t\t\tconst uint8_t encryptedByte = compressedStart[i + 2];\n\t\t\t\ti++;\n\n\t\t\t\t\/\/ Retrieve the XOR key based on the current bit index.\n\t\t\t\tconst std::array<uint8_t, 16> keys =\n\t\t\t\t{\n\t\t\t\t\t15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 16\n\t\t\t\t};\n\n\t\t\t\tconst uint8_t key = keys.at(bitIndex);\n\t\t\t\tconst uint8_t decryptedByte = encryptedByte ^ key;\n\n\t\t\t\t\/\/ Insert the decrypted byte into the decompressed data.\n\t\t\t\tdecomp.at(decompIndex) = decryptedByte;\n\t\t\t\tdecompIndex++;\n\t\t\t}\n\t\t\telse if (mode == DecompressionMode::Copy)\n\t\t\t{\n\t\t\t\t\n\t\t\t}\n\n\t\t\t\/\/ Change back to default mode.\n\t\t\tmode = DecompressionMode::Default;\n\t\t}\n\t}\n\n\t\/\/ Keep this until the decompressor works.\n\tDebug::crash(\"Exe Unpacker\", \"Not implemented.\");\n}\n\nExeUnpacker::~ExeUnpacker()\n{\n\n}\n\nconst std::string &ExeUnpacker::getText() const\n{\n\treturn this->text;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"path_renderer.hpp\"\n#include \"resource.hpp\"\n#include \"pen.hpp\"\n#include \"resource_cache.hpp\"\n\n#include \"opengl\/base_texture.hpp\"\n\n#include \"..\/base\/logging.hpp\"\n\nnamespace graphics\n{\n  PathRenderer::Params::Params()\n    : m_drawPathes(true),\n      m_fastSolidPath(true)\n  {}\n\n  PathRenderer::PathRenderer(Params const & params)\n    : base_t(params),\n      m_drawPathes(params.m_drawPathes),\n      m_fastSolidPath(params.m_fastSolidPath)\n  {}\n\n  void PathRenderer::drawPath(m2::PointD const * pts, size_t ptsCount, double offset, uint32_t resID, double depth)\n  {\n    ++m_pathCount;\n    m_pointsCount += ptsCount;\n\n    if (!m_drawPathes)\n      return;\n\n    ASSERT_GREATER_OR_EQUAL(ptsCount, 2, ());\n    ASSERT_NOT_EQUAL(resID, uint32_t(-1), ());\n\n    Resource const * res = base_t::fromID(resID);\n\n    if (res == 0)\n    {\n      LOG(LINFO, (\"drawPath: resID=\", resID, \"wasn't found on current skin\"));\n      return;\n    }\n\n    ASSERT(res->m_cat == Resource::EPen, ());\n\n    Pen const * pen = static_cast<Pen const *>(res);\n\n    if (!pen->m_info.m_symbol.empty())\n      drawSymbolPath(pts, ptsCount, offset, pen, depth);\n    else\n      if (m_fastSolidPath && pen->m_isSolid)\n        drawSolidPath(pts, ptsCount, offset, pen, depth);\n      else\n        drawStipplePath(pts, ptsCount, offset, pen, depth);\n  }\n\n  void PathRenderer::drawSymbolPath(m2::PointD const * pts, size_t ptsCount, double offset, Pen const * pen, double depth)\n  {\n    LOG(LINFO, (\"drawSymbolPath is unimplemented. symbolName=\", pen->m_info.m_symbol));\n  }\n\n  void PathRenderer::drawStipplePath(m2::PointD const * points, size_t pointsCount, double offset, Pen const * pen, double depth)\n  {\n    float rawTileStartLen = 0;\n\n    float rawTileLen = (float)pen->rawTileLen();\n\n    if ((offset < 0) && (!pen->m_isWrapped))\n      offset = offset - rawTileLen * ceil(offset \/ rawTileLen);\n\n    bool skipToOffset = true;\n\n    for (size_t i = 0; i < pointsCount - 1; ++i)\n    {\n      m2::PointD dir = points[i + 1] - points[i];\n      dir *= 1.0 \/ dir.Length(m2::PointD(0, 0));\n      m2::PointD norm(-dir.y, dir.x);\n\n      \/\/\/ The length of the current segment.\n      float segLen = points[i + 1].Length(points[i]);\n      \/\/\/ The remaining length of the segment\n      float segLenRemain = segLen;\n\n      if (skipToOffset)\n      {\n        offset -= segLen;\n        if (offset >= 0)\n          continue;\n        else\n        {\n          skipToOffset = false;\n          segLenRemain = -offset;\n        }\n      }\n\n      \/\/\/ Geometry width. It's 1px wider than the pattern width.\n      int geomWidth = static_cast<int>(pen->m_info.m_w) + 4 - 2 * aaShift();\n      float geomHalfWidth =  geomWidth \/ 2.0;\n\n      \/\/\/ Starting point of the tiles on this segment\n      m2::PointF rawTileStartPt = points[i] + dir * (segLen - segLenRemain);\n\n      \/\/\/ Tiling procedes as following :\n      \/\/\/ The leftmost tile goes antialiased at left and non-antialiased at right.\n      \/\/\/ The inner tiles goes non-antialiased at both sides.\n      \/\/\/ The rightmost tile goes non-antialised at left and antialiased at right side.\n\n      \/\/\/ Length of the actual pattern data being tiling(without antialiasing zones).\n      rawTileLen = 0;\n\n      GeometryPipeline & p = pipeline(pen->m_pipelineID);\n\n      shared_ptr<gl::BaseTexture> texture = p.texture();\n\n      if (!texture)\n      {\n        LOG(LDEBUG, (\"returning as no texture is reserved\"));\n        return;\n      }\n\n      float texMaxY = pen->m_texRect.maxY() - aaShift();\n      float texMinY = pen->m_texRect.minY() + aaShift();\n\n      m2::PointF const fNorm = norm * geomHalfWidth;  \/\/ enough to calc it once\n\n      while (segLenRemain > 0)\n      {\n        rawTileLen = pen->m_isWrapped\n            ? segLen\n            : std::min(((float)pen->rawTileLen() - rawTileStartLen), segLenRemain);\n\n\n        float texMinX = pen->m_isWrapped ? 0 : pen->m_texRect.minX() + 2 + rawTileStartLen;\n        float texMaxX = texMinX + rawTileLen;\n\n        rawTileStartLen += rawTileLen;\n        if (rawTileStartLen >= pen->rawTileLen())\n          rawTileStartLen -= pen->rawTileLen();\n        ASSERT(rawTileStartLen < pen->rawTileLen(), ());\n\n        m2::PointF rawTileEndPt(rawTileStartPt.x + dir.x * rawTileLen, rawTileStartPt.y + dir.y * rawTileLen);\n\n        m2::PointF coords[4] =\n        {\n          rawTileStartPt + fNorm,\n          rawTileStartPt - fNorm,\n          rawTileEndPt - fNorm,\n          rawTileEndPt + fNorm\n        };\n\n        m2::PointF texCoords[4] =\n        {\n          texture->mapPixel(m2::PointF(texMinX, texMinY)),\n          texture->mapPixel(m2::PointF(texMinX, texMaxY)),\n          texture->mapPixel(m2::PointF(texMaxX, texMaxY)),\n          texture->mapPixel(m2::PointF(texMaxX, texMinY))\n        };\n\n        m2::PointF normals[4] =\n        {\n          m2::PointF(0, 0),\n          m2::PointF(0, 0),\n          m2::PointF(0, 0),\n          m2::PointF(0, 0)\n        };\n\n        addTexturedFan(coords,\n                       normals,\n                       texCoords,\n                       4,\n                       depth,\n                       pen->m_pipelineID);\n\n        segLenRemain -= rawTileLen;\n\n        rawTileStartPt = rawTileEndPt;\n      }\n\n      bool isColorJoin = pen->m_isSolid ? true : pen->m_info.atDashOffset(rawTileLen);\n\n      \/\/\/ Adding geometry for a line join between previous and current segment.\n      if ((i != pointsCount - 2) && (isColorJoin))\n      {\n        m2::PointD nextDir = points[i + 2] - points[i + 1];\n        nextDir *= 1.0 \/ nextDir.Length(m2::PointD(0, 0));\n        m2::PointD nextNorm(-nextDir.y, nextDir.x);\n\n        \/\/\/ Computing the sin of angle between directions.\n        double alphaSin = dir.x * nextDir.y - dir.y * nextDir.x;\n        double alphaCos = dir.x * nextDir.x + dir.y * nextDir.y;\n        double alpha = atan2(alphaSin, alphaCos);\n        int angleSegCount = int(ceil(fabs(alpha) \/ (math::pi \/ 6)));\n        double angleStep = alpha \/ angleSegCount;\n\n        m2::PointD startVec;\n\n        if (alpha > 0)\n        {\n          \/\/\/ The outer site is on the prevNorm direction.\n          startVec = -norm;\n        }\n        else\n        {\n          \/\/\/ The outer site is on the -prevNorm direction\n          startVec = norm;\n        }\n\n        GeometryPipeline & p = pipeline(pen->m_pipelineID);\n\n        shared_ptr<gl::BaseTexture> texture = p.texture();\n\n        if (!texture)\n        {\n          LOG(LDEBUG, (\"returning as no texture is reserved\"));\n          return;\n        }\n\n        m2::PointF joinSegTex[3] =\n        {\n          texture->mapPixel(pen->m_centerColorPixel),\n          texture->mapPixel(pen->m_borderColorPixel),\n          texture->mapPixel(pen->m_borderColorPixel)\n        };\n\n        m2::PointD prevStartVec = startVec;\n        for (int j = 0; j < angleSegCount; ++j)\n        {\n          \/\/\/ Rotate start vector to find another point on a join.\n          startVec.Rotate(angleStep);\n\n          \/\/\/ Computing three points of a join segment.\n          m2::PointF joinSeg[3] =\n          {\n            m2::PointF(points[i + 1]),\n            m2::PointF(points[i + 1] + startVec * geomHalfWidth),\n            m2::PointF(points[i + 1] + prevStartVec * geomHalfWidth)\n          };\n\n          m2::PointF joinSegNormals[3] =\n          {\n            m2::PointF(0, 0),\n            m2::PointF(0, 0),\n            m2::PointF(0, 0)\n          };\n\n          addTexturedFan(joinSeg,\n                         joinSegNormals,\n                         joinSegTex,\n                         3,\n                         depth,\n                         pen->m_pipelineID);\n\n          prevStartVec = startVec;\n        }\n      }\n    }\n  }\n\n\n  void PathRenderer::drawSolidPath(m2::PointD const * points, size_t pointsCount, double offset, Pen const * pen, double depth)\n  {\n    ASSERT(pen->m_isSolid, ());\n\n    bool const hasRoundCap = (pen->m_info.m_cap == pen->m_info.ERoundCap);\n    bool const hasSquareCap = (pen->m_info.m_cap == pen->m_info.ESquareCap);\n    bool const hasRoundJoin = (pen->m_info.m_join == pen->m_info.ERoundJoin);\n    bool const hasBevelJoin = (pen->m_info.m_join == pen->m_info.EBevelJoin);\n\n    float geomHalfWidth = (pen->m_info.m_w + 4 - aaShift() * 2) \/ 2.0;\n\n\n    m2::PointD dir = points[1] - points[0];\n    double len = dir.Length(m2::PointD(0, 0));\n    dir *= 1.0 \/ len;\n    m2::PointD const norm(-dir.y, dir.x);\n    m2::PointD fNorm = norm * geomHalfWidth;\n    m2::PointD fDir(fNorm.y, -fNorm.x);\n\n    m2::PointD fNormNextSeg;\n    m2::PointD fDirNextSeg;\n\n    for (size_t i = 0; i < pointsCount - 1; ++i)\n    {      \n      bool const leftIsCap  = i == 0;\n      bool const rightIsCap = i == (pointsCount - 2);\n\n      if (!leftIsCap)\n      {\n        fNorm = fNormNextSeg;\n        fDir = fDirNextSeg;\n      }\n\n      m2::PointD const & nextPt = points[i + 1];\n\n      if (!rightIsCap)\n      {\n        m2::PointD dirNextSeg = points[i + 2] - points[i + 1];\n        double lenNextSeg = dirNextSeg.Length(m2::PointD(0, 0));\n        dirNextSeg *= 1.0 \/ lenNextSeg;\n        m2::PointD normNextSeg(-dirNextSeg.y, dirNextSeg.x);\n        fNormNextSeg = normNextSeg * geomHalfWidth;\n        fDirNextSeg = m2::PointD(fNormNextSeg.y, -fNormNextSeg.x);\n      }\n\n      float texMinX = pen->m_texRect.minX() + 1;\n      float texMaxX = pen->m_texRect.maxX() - 1;\n\n      float texMinY = pen->m_texRect.maxY() - aaShift();\n      float texMaxY = pen->m_texRect.minY() + aaShift();\n\n      float texCenterX = (texMinX + texMaxX) \/ 2;\n\n      int numPoints = 4;\n\n      if (leftIsCap && (hasRoundCap || hasSquareCap))\n        numPoints += 2;\n      if ((rightIsCap && (hasRoundCap || hasSquareCap))\n       || (!rightIsCap && (hasRoundJoin || hasBevelJoin)))\n        numPoints += 2;\n\n      int cur = 0;\n\n      m2::PointF coords[numPoints];\n\n      if (leftIsCap && (hasRoundCap || hasSquareCap))\n      {\n        coords[cur++] = points[i] - fDir + fNorm;\n        coords[cur++] = points[i] - fDir - fNorm;\n      }\n\n      coords[cur++] = points[i] + fNorm;\n      coords[cur++] = points[i] - fNorm;\n      coords[cur++] = nextPt + fNorm;\n      coords[cur++] = nextPt - fNorm;\n\n      if ((rightIsCap && (hasRoundCap || hasSquareCap))\n       || (!rightIsCap && hasRoundJoin))\n      {\n        coords[cur++] = nextPt + fDir + fNorm;\n        coords[cur++] = nextPt + fDir - fNorm;\n      }\n      else if (!rightIsCap && hasBevelJoin)\n      {\n        coords[cur++] = points[i + 1] + fNormNextSeg;\n        coords[cur++] = points[i + 1] - fNormNextSeg;\n      }\n\n      GeometryPipeline & p = pipeline(pen->m_pipelineID);\n\n      shared_ptr<gl::BaseTexture> texture = p.texture();\n\n      if (!texture)\n      {\n        LOG(LDEBUG, (\"returning as no texture is reserved\"));\n        return;\n      }\n\n      m2::PointF texCoords[numPoints];\n      cur = 0;\n\n      if (leftIsCap && hasRoundCap)\n      {\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texMinX, texMinY));\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texMinX, texMaxY));\n      }\n      else if (leftIsCap && hasSquareCap)\n      {\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMinY));\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMaxY));\n      }\n\n      texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMinY));\n      texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMaxY));\n      texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMinY));\n      texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMaxY));\n\n      if ((rightIsCap && hasRoundCap)\n       || (!rightIsCap && hasRoundJoin))\n      {\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texMaxX, texMinY));\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texMaxX, texMaxY));\n      }\n      else if ((rightIsCap && hasSquareCap)\n            || (!rightIsCap && hasBevelJoin))\n      {\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMinY));\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMaxY));\n      }\n\n      m2::PointF normal(0, 0);\n\n      addTexturedStripStrided(coords, sizeof(m2::PointF),\n                              &normal, 0,\n                              texCoords, sizeof(m2::PointF),\n                              numPoints,\n                              depth,\n                              pen->m_pipelineID);\n    }\n  }\n\n  void PathRenderer::beginFrame()\n  {\n    base_t::beginFrame();\n    m_pathCount = 0;\n    m_pointsCount = 0;\n  }\n\n  void PathRenderer::endFrame()\n  {\n    if (isDebugging())\n    {\n      LOG(LINFO, (\"drawing \", m_pathCount, \" pathes, \", m_pointsCount, \" points total\"));\n    }\n    base_t::endFrame();\n  }\n}\n\n<commit_msg>clang compile fix<commit_after>#include \"path_renderer.hpp\"\n#include \"resource.hpp\"\n#include \"pen.hpp\"\n#include \"resource_cache.hpp\"\n\n#include \"opengl\/base_texture.hpp\"\n\n#include \"..\/base\/logging.hpp\"\n\nnamespace graphics\n{\n  PathRenderer::Params::Params()\n    : m_drawPathes(true),\n      m_fastSolidPath(true)\n  {}\n\n  PathRenderer::PathRenderer(Params const & params)\n    : base_t(params),\n      m_drawPathes(params.m_drawPathes),\n      m_fastSolidPath(params.m_fastSolidPath)\n  {}\n\n  void PathRenderer::drawPath(m2::PointD const * pts, size_t ptsCount, double offset, uint32_t resID, double depth)\n  {\n    ++m_pathCount;\n    m_pointsCount += ptsCount;\n\n    if (!m_drawPathes)\n      return;\n\n    ASSERT_GREATER_OR_EQUAL(ptsCount, 2, ());\n    ASSERT_NOT_EQUAL(resID, uint32_t(-1), ());\n\n    Resource const * res = base_t::fromID(resID);\n\n    if (res == 0)\n    {\n      LOG(LINFO, (\"drawPath: resID=\", resID, \"wasn't found on current skin\"));\n      return;\n    }\n\n    ASSERT(res->m_cat == Resource::EPen, ());\n\n    Pen const * pen = static_cast<Pen const *>(res);\n\n    if (!pen->m_info.m_symbol.empty())\n      drawSymbolPath(pts, ptsCount, offset, pen, depth);\n    else\n      if (m_fastSolidPath && pen->m_isSolid)\n        drawSolidPath(pts, ptsCount, offset, pen, depth);\n      else\n        drawStipplePath(pts, ptsCount, offset, pen, depth);\n  }\n\n  void PathRenderer::drawSymbolPath(m2::PointD const * pts, size_t ptsCount, double offset, Pen const * pen, double depth)\n  {\n    LOG(LINFO, (\"drawSymbolPath is unimplemented. symbolName=\", pen->m_info.m_symbol));\n  }\n\n  void PathRenderer::drawStipplePath(m2::PointD const * points, size_t pointsCount, double offset, Pen const * pen, double depth)\n  {\n    float rawTileStartLen = 0;\n\n    float rawTileLen = (float)pen->rawTileLen();\n\n    if ((offset < 0) && (!pen->m_isWrapped))\n      offset = offset - rawTileLen * ceil(offset \/ rawTileLen);\n\n    bool skipToOffset = true;\n\n    for (size_t i = 0; i < pointsCount - 1; ++i)\n    {\n      m2::PointD dir = points[i + 1] - points[i];\n      dir *= 1.0 \/ dir.Length(m2::PointD(0, 0));\n      m2::PointD norm(-dir.y, dir.x);\n\n      \/\/\/ The length of the current segment.\n      float segLen = points[i + 1].Length(points[i]);\n      \/\/\/ The remaining length of the segment\n      float segLenRemain = segLen;\n\n      if (skipToOffset)\n      {\n        offset -= segLen;\n        if (offset >= 0)\n          continue;\n        else\n        {\n          skipToOffset = false;\n          segLenRemain = -offset;\n        }\n      }\n\n      \/\/\/ Geometry width. It's 1px wider than the pattern width.\n      int geomWidth = static_cast<int>(pen->m_info.m_w) + 4 - 2 * aaShift();\n      float geomHalfWidth =  geomWidth \/ 2.0;\n\n      \/\/\/ Starting point of the tiles on this segment\n      m2::PointF rawTileStartPt = points[i] + dir * (segLen - segLenRemain);\n\n      \/\/\/ Tiling procedes as following :\n      \/\/\/ The leftmost tile goes antialiased at left and non-antialiased at right.\n      \/\/\/ The inner tiles goes non-antialiased at both sides.\n      \/\/\/ The rightmost tile goes non-antialised at left and antialiased at right side.\n\n      \/\/\/ Length of the actual pattern data being tiling(without antialiasing zones).\n      rawTileLen = 0;\n\n      GeometryPipeline & p = pipeline(pen->m_pipelineID);\n\n      shared_ptr<gl::BaseTexture> texture = p.texture();\n\n      if (!texture)\n      {\n        LOG(LDEBUG, (\"returning as no texture is reserved\"));\n        return;\n      }\n\n      float texMaxY = pen->m_texRect.maxY() - aaShift();\n      float texMinY = pen->m_texRect.minY() + aaShift();\n\n      m2::PointF const fNorm = norm * geomHalfWidth;  \/\/ enough to calc it once\n\n      while (segLenRemain > 0)\n      {\n        rawTileLen = pen->m_isWrapped\n            ? segLen\n            : std::min(((float)pen->rawTileLen() - rawTileStartLen), segLenRemain);\n\n\n        float texMinX = pen->m_isWrapped ? 0 : pen->m_texRect.minX() + 2 + rawTileStartLen;\n        float texMaxX = texMinX + rawTileLen;\n\n        rawTileStartLen += rawTileLen;\n        if (rawTileStartLen >= pen->rawTileLen())\n          rawTileStartLen -= pen->rawTileLen();\n        ASSERT(rawTileStartLen < pen->rawTileLen(), ());\n\n        m2::PointF rawTileEndPt(rawTileStartPt.x + dir.x * rawTileLen, rawTileStartPt.y + dir.y * rawTileLen);\n\n        m2::PointF coords[4] =\n        {\n          rawTileStartPt + fNorm,\n          rawTileStartPt - fNorm,\n          rawTileEndPt - fNorm,\n          rawTileEndPt + fNorm\n        };\n\n        m2::PointF texCoords[4] =\n        {\n          texture->mapPixel(m2::PointF(texMinX, texMinY)),\n          texture->mapPixel(m2::PointF(texMinX, texMaxY)),\n          texture->mapPixel(m2::PointF(texMaxX, texMaxY)),\n          texture->mapPixel(m2::PointF(texMaxX, texMinY))\n        };\n\n        m2::PointF normals[4] =\n        {\n          m2::PointF(0, 0),\n          m2::PointF(0, 0),\n          m2::PointF(0, 0),\n          m2::PointF(0, 0)\n        };\n\n        addTexturedFan(coords,\n                       normals,\n                       texCoords,\n                       4,\n                       depth,\n                       pen->m_pipelineID);\n\n        segLenRemain -= rawTileLen;\n\n        rawTileStartPt = rawTileEndPt;\n      }\n\n      bool isColorJoin = pen->m_isSolid ? true : pen->m_info.atDashOffset(rawTileLen);\n\n      \/\/\/ Adding geometry for a line join between previous and current segment.\n      if ((i != pointsCount - 2) && (isColorJoin))\n      {\n        m2::PointD nextDir = points[i + 2] - points[i + 1];\n        nextDir *= 1.0 \/ nextDir.Length(m2::PointD(0, 0));\n        m2::PointD nextNorm(-nextDir.y, nextDir.x);\n\n        \/\/\/ Computing the sin of angle between directions.\n        double alphaSin = dir.x * nextDir.y - dir.y * nextDir.x;\n        double alphaCos = dir.x * nextDir.x + dir.y * nextDir.y;\n        double alpha = atan2(alphaSin, alphaCos);\n        int angleSegCount = int(ceil(fabs(alpha) \/ (math::pi \/ 6)));\n        double angleStep = alpha \/ angleSegCount;\n\n        m2::PointD startVec;\n\n        if (alpha > 0)\n        {\n          \/\/\/ The outer site is on the prevNorm direction.\n          startVec = -norm;\n        }\n        else\n        {\n          \/\/\/ The outer site is on the -prevNorm direction\n          startVec = norm;\n        }\n\n        GeometryPipeline & p = pipeline(pen->m_pipelineID);\n\n        shared_ptr<gl::BaseTexture> texture = p.texture();\n\n        if (!texture)\n        {\n          LOG(LDEBUG, (\"returning as no texture is reserved\"));\n          return;\n        }\n\n        m2::PointF joinSegTex[3] =\n        {\n          texture->mapPixel(pen->m_centerColorPixel),\n          texture->mapPixel(pen->m_borderColorPixel),\n          texture->mapPixel(pen->m_borderColorPixel)\n        };\n\n        m2::PointD prevStartVec = startVec;\n        for (int j = 0; j < angleSegCount; ++j)\n        {\n          \/\/\/ Rotate start vector to find another point on a join.\n          startVec.Rotate(angleStep);\n\n          \/\/\/ Computing three points of a join segment.\n          m2::PointF joinSeg[3] =\n          {\n            m2::PointF(points[i + 1]),\n            m2::PointF(points[i + 1] + startVec * geomHalfWidth),\n            m2::PointF(points[i + 1] + prevStartVec * geomHalfWidth)\n          };\n\n          m2::PointF joinSegNormals[3] =\n          {\n            m2::PointF(0, 0),\n            m2::PointF(0, 0),\n            m2::PointF(0, 0)\n          };\n\n          addTexturedFan(joinSeg,\n                         joinSegNormals,\n                         joinSegTex,\n                         3,\n                         depth,\n                         pen->m_pipelineID);\n\n          prevStartVec = startVec;\n        }\n      }\n    }\n  }\n\n\n  void PathRenderer::drawSolidPath(m2::PointD const * points, size_t pointsCount, double offset, Pen const * pen, double depth)\n  {\n    ASSERT(pen->m_isSolid, ());\n\n    bool const hasRoundCap = (pen->m_info.m_cap == pen->m_info.ERoundCap);\n    bool const hasSquareCap = (pen->m_info.m_cap == pen->m_info.ESquareCap);\n    bool const hasRoundJoin = (pen->m_info.m_join == pen->m_info.ERoundJoin);\n    bool const hasBevelJoin = (pen->m_info.m_join == pen->m_info.EBevelJoin);\n\n    float geomHalfWidth = (pen->m_info.m_w + 4 - aaShift() * 2) \/ 2.0;\n\n    m2::PointD dir = points[1] - points[0];\n    double len = dir.Length(m2::PointD(0, 0));\n    dir *= 1.0 \/ len;\n    m2::PointD const norm(-dir.y, dir.x);\n    m2::PointD fNorm = norm * geomHalfWidth;\n    m2::PointD fDir(fNorm.y, -fNorm.x);\n\n    m2::PointD fNormNextSeg;\n    m2::PointD fDirNextSeg;\n\n    for (size_t i = 0; i < pointsCount - 1; ++i)\n    {      \n      bool const leftIsCap  = i == 0;\n      bool const rightIsCap = i == (pointsCount - 2);\n\n      if (!leftIsCap)\n      {\n        fNorm = fNormNextSeg;\n        fDir = fDirNextSeg;\n      }\n\n      m2::PointD const & nextPt = points[i + 1];\n\n      if (!rightIsCap)\n      {\n        m2::PointD dirNextSeg = points[i + 2] - points[i + 1];\n        double lenNextSeg = dirNextSeg.Length(m2::PointD(0, 0));\n        dirNextSeg *= 1.0 \/ lenNextSeg;\n        m2::PointD normNextSeg(-dirNextSeg.y, dirNextSeg.x);\n        fNormNextSeg = normNextSeg * geomHalfWidth;\n        fDirNextSeg = m2::PointD(fNormNextSeg.y, -fNormNextSeg.x);\n      }\n\n      float texMinX = pen->m_texRect.minX() + 1;\n      float texMaxX = pen->m_texRect.maxX() - 1;\n\n      float texMinY = pen->m_texRect.maxY() - aaShift();\n      float texMaxY = pen->m_texRect.minY() + aaShift();\n\n      float texCenterX = (texMinX + texMaxX) \/ 2;\n\n      int numPoints = 4;\n\n      if (leftIsCap && (hasRoundCap || hasSquareCap))\n        numPoints += 2;\n      if ((rightIsCap && (hasRoundCap || hasSquareCap))\n       || (!rightIsCap && (hasRoundJoin || hasBevelJoin)))\n        numPoints += 2;\n\n      int cur = 0;\n\n      ASSERT(numPoints <= 8, (\"numPoints is more than 8, won't fit in array\"));\n      m2::PointF coords[8];\n\n      if (leftIsCap && (hasRoundCap || hasSquareCap))\n      {\n        coords[cur++] = points[i] - fDir + fNorm;\n        coords[cur++] = points[i] - fDir - fNorm;\n      }\n\n      coords[cur++] = points[i] + fNorm;\n      coords[cur++] = points[i] - fNorm;\n      coords[cur++] = nextPt + fNorm;\n      coords[cur++] = nextPt - fNorm;\n\n      if ((rightIsCap && (hasRoundCap || hasSquareCap))\n       || (!rightIsCap && hasRoundJoin))\n      {\n        coords[cur++] = nextPt + fDir + fNorm;\n        coords[cur++] = nextPt + fDir - fNorm;\n      }\n      else if (!rightIsCap && hasBevelJoin)\n      {\n        coords[cur++] = points[i + 1] + fNormNextSeg;\n        coords[cur++] = points[i + 1] - fNormNextSeg;\n      }\n\n      GeometryPipeline & p = pipeline(pen->m_pipelineID);\n\n      shared_ptr<gl::BaseTexture> texture = p.texture();\n\n      if (!texture)\n      {\n        LOG(LDEBUG, (\"returning as no texture is reserved\"));\n        return;\n      }\n\n      m2::PointF texCoords[8];\n      cur = 0;\n\n      if (leftIsCap && hasRoundCap)\n      {\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texMinX, texMinY));\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texMinX, texMaxY));\n      }\n      else if (leftIsCap && hasSquareCap)\n      {\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMinY));\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMaxY));\n      }\n\n      texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMinY));\n      texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMaxY));\n      texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMinY));\n      texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMaxY));\n\n      if ((rightIsCap && hasRoundCap)\n       || (!rightIsCap && hasRoundJoin))\n      {\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texMaxX, texMinY));\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texMaxX, texMaxY));\n      }\n      else if ((rightIsCap && hasSquareCap)\n            || (!rightIsCap && hasBevelJoin))\n      {\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMinY));\n        texCoords[cur++] = texture->mapPixel(m2::PointF(texCenterX, texMaxY));\n      }\n\n      m2::PointF normal(0, 0);\n\n      addTexturedStripStrided(coords, sizeof(m2::PointF),\n                              &normal, 0,\n                              texCoords, sizeof(m2::PointF),\n                              numPoints,\n                              depth,\n                              pen->m_pipelineID);\n    }\n  }\n\n  void PathRenderer::beginFrame()\n  {\n    base_t::beginFrame();\n    m_pathCount = 0;\n    m_pointsCount = 0;\n  }\n\n  void PathRenderer::endFrame()\n  {\n    if (isDebugging())\n    {\n      LOG(LINFO, (\"drawing \", m_pathCount, \" pathes, \", m_pointsCount, \" points total\"));\n    }\n    base_t::endFrame();\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"savesaccess.h\"\n\n#include <QtWidgets\/QApplication>\n#include <QtWidgets\/QFileDialog>\n#include <QtWidgets\/QWidget>\n#include <QDebug>\n\nSavesAccess::SavesAccess(QObject *parent) :\n    QObject(parent),\n    savedGameModel(Q_NULLPTR),\n    resourceModel(Q_NULLPTR)\n{\n}\n\n\/\/ Sets the path and loads the game.\nvoid SavesAccess::loadSavedGame(QString gameName)\n{\n    \/\/ Set the game name.\n    selectedSaveName = gameName;\n\n    \/\/ Pull the resources into the list.\n    loadResourceFile();\n    loadUnitFile();\n}\n\nvoid SavesAccess::saveSavedGame()\n{\n    saveResourceFile();\n    \/\/saveUnitsToFile();\n    \/\/saveTimeToFile();\n    \/\/saveGameOverviewToFile();\n}\n\nvoid SavesAccess::openFileDialog()\n{\n\n    \/\/ TODO: Set the parent of this dialog so it returns properly.\n    \/\/ Not sure if this is the cause of the weird Windows behavior\n    \/\/ or not. Something to try.\n    QFileDialog fileDialog(0,\"Timber and Stone saves.sav file\");\n    fileDialog.setDirectory(rootSavesDirectory);\n    fileDialog.setNameFilter(\"Saves File (saves.sav)\");\n\n    \/\/ Open the file dialog so the user can select the saves.sav file.\n    if (fileDialog.exec())\n    {\n        rootSavesDirectory.setPath(fileDialog.selectedFiles().first());\n        rootSavesDirectory.cdUp(); \/\/ This trims off the saves.sav file.\n    }\n}\n\n\n\/\/ NOTE: Qml access this for types that are explicitly typed in.\nvoid SavesAccess::setFilePath(QString path)\n{\n    \/\/ Save the path to the file.\n    rootSavesDirectory.setPath(path);\n    rootSavesDirectory.cdUp();\n}\n\nQString SavesAccess::getSavesPath()\n{\n    return (rootSavesDirectory.absolutePath() + \"\/\" + \"saves.sav\");\n}\n\nbool SavesAccess::pathIsValid()\n{\n    \/\/ Return True if both the directory path is valid\n    \/\/ and the saves.sav file exists.\n    QFile savedGameFile(getSavesPath());\n    QFileInfo fileInfo(savedGameFile);\n    if (savedGameFile.exists() && (fileInfo.fileName() == \"saves.sav\"))\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nvoid SavesAccess::loadGamesList()\n{\n    \/\/ Save the file name.\n    QFile savedGameFile(rootSavesDirectory.absolutePath()\n                        + \"\/\" + \"saves.sav\");\n\n    if (savedGameModel == Q_NULLPTR)\n    {\n        qDebug() << \"SavedAccess model hasn't been set up yet.\";\n        return;\n    }\n\n    \/\/ Open file and make sure it went okay.\n    if (!savedGameFile.exists() || !savedGameFile.open(QFile::ReadOnly | QFile::Text))\n    {\n        \/\/ TODO: Make this error apparent on the interface somehow.\n        qDebug() << \"Can't open savedGameFile.\";\n        return;\n    }\n    else\n    {\n        QTextStream in(&savedGameFile);\n        QStringList strings;\n\n        long numberOfGames = in.readLine().toLongLong();\n        qDebug() << \"Loaded\" << numberOfGames << \"games.\";\n\n        \/\/ Remove all the games.\n        savedGameModel->clear();\n\n        \/\/ Add the games from the saves.sav file.\n        while (!in.atEnd())\n        {\n            strings = in.readLine().split(\"\/\", QString::KeepEmptyParts);\n\n            \/\/ Add the games to the list.\n            savedGameModel->appendRow(new SavedGame(strings[0],\n                                 strings[3],\n                                 strings[4],\n                                 strings[1].toLongLong(),\n                                 strings[2].toLongLong()));\n        }\n    }\n\n    \/\/ It's important to always close the file after reading\/writing, so this\n    \/\/ app can remain running while Timber and Stone saves as it wishes.\n    savedGameFile.close();\n}\n\nvoid SavesAccess::setSavedGameListModel(SavedGameListModel * model)\n{\n    savedGameModel = model;\n}\n\nQByteArray SavesAccess::toBinary(long value)\n{\n    QByteArray bytes;\n\n    \/\/ NOTE: I do not understand this. I understand what it's doing, but\n    \/\/ I have no idea why. I suspect it's much more simple, and I've\n    \/\/ missed something.\n    if (value>1919) \/\/ this is the largest two-byte number\n    {\n        bytes.append( (((value>>6) + 2)>>6) | 0xe0 );\n        bytes.append( (((value>>6) + 2) &0x3f) | 0x80 );\n    }\n    else\n    {\n        bytes.append( (((value>>6) &0x1f) + 2) | 0xc0 );\n    }\n    bytes.append(value&0x3f | 0x80);\n\n    return bytes;\n}\n\n\/\/ This format handling can certainly be simplified. There's little\n\/\/ chance that the game designer made it complicated on purpose.\n\/\/\nlong SavesAccess::toLong(QByteArray bytes)\n{\n    \/\/ Ensure the bytes have only their relevant bits visible.\n    long value;\n    if( bytes.size() > 2 )\n    {\n        bytes[0] = bytes[0] & 0x1f; \/\/ Two or more bytes exist, so this one has an extra id bit.\n        bytes[1] = bytes[1] & 0x3f;\n        bytes[2] = bytes[2] & 0x3f;\n\n        \/\/ Compile the bytes into a long.\n        \/\/\n        \/\/ Note: The -2 in the equation is strange. I have no answer as to why\n        \/\/ this format requires that.\n        value = bytes[2] | (((bytes[1] | (bytes[0]<<6)) -2) << 6);\n    }\n    else\n    {\n        bytes[0] = bytes[0] & 0x3f;\n        bytes[1] = bytes[1] & 0x3f;\n        value = bytes[1] | (bytes[0] -2) << 6;\n    }\n\n    return value;\n}\n\n\/\/ =====================\n\/\/ RESOURCES\n\/\/ =====================\n\nvoid SavesAccess::setResourceListModel(ResourceListModel * model)\n{\n    resourceModel = model;\n}\n\nvoid SavesAccess::loadResourceFile()\n{\n    QFile resourceFile(rootSavesDirectory.absolutePath()\n                       + \"\/\" + selectedSaveName\n                       + \"\/\" + \"re.sav\");\n\n    if (resourceModel == Q_NULLPTR)\n    {\n        qDebug() << \"Resource model hasn't been set up yet.\";\n        return;\n    }\n\n    \/\/ Open file and make sure it went okay.\n    if (!resourceFile.exists() || !resourceFile.open(QFile::ReadWrite))\n    {\n        \/\/ TODO: Make this error apparent on the interface somehow.\n        qDebug() << \"Can't open resourceFile.\";\n        return;\n    }\n    else\n    {\n\n        \/\/ Pull in the list of resource assets (name, group, etc)\n        QFile assetFile(QCoreApplication::applicationDirPath() + \"\/resource_list.csv\");\n\n        if (assetFile.open(QIODevice::ReadOnly | QIODevice::Text))\n        {\n            qDebug() << \"Opened Asset File: \" << assetFile.fileName();\n\n            \/\/ Clear the resource model\n            resourceModel->clear();\n\n            QTextStream assetStream(&assetFile);\n            long index(0);\n\n            while (!assetStream.atEnd())\n            {\n                \/\/ Grab the next section and decide the size, etc.\n                QString assetString;\n                assetString = assetStream.readLine();\n                QStringList assetData;\n                assetData = assetString.split(',');\n\n                \/\/ Temporary array to hold the bytes we read from the file.\n                QByteArray byteArray;\n                byteArray.clear();\n\n                unsigned char byte; \/\/ Most Significant Byte\n                resourceFile.read((char *)&byte, 1);\n\n                if( byte >= 0xe0)\n                {\n                    byteArray.append(byte);\n\n                    \/\/ Another byte exists!\n                    resourceFile.read((char *)&byte, 1);\n                    byteArray.append(byte);\n                }\n                else\n                {\n                    byteArray.append(byte);\n                }\n\n                resourceFile.read((char *)&byte, 1);\n                byteArray.append(byte);\n\n                resourceModel->appendRow(new Resource(assetData[0],\n                                          assetData[1],\n                                          assetData[2],\n                                          toLong(byteArray), \/\/ resource quantity\n                                          index++));         \/\/ id\n            }\n\n            if (!resourceFile.atEnd())\n            {\n                \/\/ Read the rest of the file into an array, and keep it for later.\n                resourceExtraData.clear();\n                resourceExtraData = resourceFile.readAll();\n            }\n        }\n        else\n        {\n            \/\/ TODO: Make this error apparent on the interface somehow.\n            qDebug() << \"Could not open \" << assetFile.fileName();\n        }\n\n        assetFile.close();\n        resourceFile.close();\n    }\n\n}\n\n\nvoid SavesAccess::saveResourceFile()\n{\n    if (resourceModel == Q_NULLPTR\n            || resourceModel->rowCount() <= 0)\n    {\n        qDebug() << \"The resource model hasn't been populated.\";\n        return;\n    }\n\n    QFile resourceFile(rootSavesDirectory.absolutePath()\n                       + \"\/\" + selectedSaveName\n                       + \"\/\" + \"re.sav\");\n\n    \/\/ Open file for write, and make sure it went okay.\n    if (!resourceFile.open(QFile::ReadWrite))\n    {\n        \/\/ TODO: Make this error apparent on the interface somehow.\n        \/\/ Perhaps by making the save icon be red instead of green.\n        qDebug() << \"Can't open resourceFile for writing.\";\n        return;\n    }\n    else\n    {\n        QByteArray binaryData;\n\n        \/\/ Write the data to the resource file. Clobber the old one.\n        for (int ndx = 0;\n             ndx < resourceModel->rowCount();\n             ndx++)\n        {\n            long quantity = resourceModel->index(ndx).data(Resource::QuantityRole).toLongLong();\n            if (quantity > 30000)\n            {\n                qDebug() << \"Resource quantities above 32,639 will fail to load in the game. Reduced to 30,000.\";\n                quantity = 30000;\n\n                \/\/ Update the resource.\n                resourceModel->setData(ndx,30000);\n            }\n            binaryData = toBinary(quantity);\n            resourceFile.write(binaryData);\n        }\n\n        \/\/ Write out the unexpected data to the file too.\n        resourceFile.write(resourceExtraData);\n        resourceFile.close();\n    }\n}\n\n\/\/ =====================\n\/\/ UNITS (human, neutral mobs, violent mobs)\n\/\/ =====================\n\nvoid SavesAccess::setHumanModel(HumanListModel * model)\n{\n    humanModel = model;\n}\nvoid SavesAccess::setNeutralMobModel(NeutralMobListModel * model)\n{\n    neutralMobModel = model;\n}\nvoid SavesAccess::setViolentMobModel(ViolentMobListModel * model)\n{\n    violentMobModel = model;\n}\n\nvoid SavesAccess::loadUnitFile()\n{\n    \/\/ Compose the file name.\n    QFile unitFile(rootSavesDirectory.absolutePath()\n                   + \"\/\" + selectedSaveName\n                   + \"\/\" + \"un.sav\");\n}\n\nvoid SavesAccess::saveUnitFile()\n{\n    \/\/ TODO: Save the units to the saved game file.\n}\n\n\nQ_DECLARE_METATYPE(SavesAccess*)\n<commit_msg>Added more stuff.<commit_after>#include \"savesaccess.h\"\n\n#include <QtWidgets\/QApplication>\n#include <QtWidgets\/QFileDialog>\n#include <QtWidgets\/QWidget>\n#include <QDebug>\n\nSavesAccess::SavesAccess(QObject *parent) :\n    QObject(parent),\n    savedGameModel(Q_NULLPTR),\n    resourceModel(Q_NULLPTR)\n{\n}\n\n\/\/ Sets the path and loads the game.\nvoid SavesAccess::loadSavedGame(QString gameName)\n{\n    \/\/ Set the game name.\n    selectedSaveName = gameName;\n\n    \/\/ Pull the resources into the list.\n    loadResourceFile();\n    loadUnitFile();\n}\n\nvoid SavesAccess::saveSavedGame()\n{\n    saveResourceFile();\n    \/\/saveUnitsToFile();\n    \/\/saveTimeToFile();\n    \/\/saveGameOverviewToFile();\n}\n\nvoid SavesAccess::openFileDialog()\n{\n\n    \/\/ TODO: Set the parent of this dialog so it returns properly.\n    \/\/ Not sure if this is the cause of the weird Windows behavior\n    \/\/ or not. Something to try.\n    QFileDialog fileDialog(0,\"Timber and Stone saves.sav file\");\n    fileDialog.setDirectory(rootSavesDirectory);\n    fileDialog.setNameFilter(\"Saves File (saves.sav)\");\n\n    \/\/ Open the file dialog so the user can select the saves.sav file.\n    if (fileDialog.exec())\n    {\n        rootSavesDirectory.setPath(fileDialog.selectedFiles().first());\n        rootSavesDirectory.cdUp(); \/\/ This trims off the saves.sav file.\n    }\n}\n\n\n\/\/ NOTE: Qml access this for types that are explicitly typed in.\nvoid SavesAccess::setFilePath(QString path)\n{\n    \/\/ Save the path to the file.\n    rootSavesDirectory.setPath(path);\n    rootSavesDirectory.cdUp();\n}\n\nQString SavesAccess::getSavesPath()\n{\n    return (rootSavesDirectory.absolutePath() + \"\/\" + \"saves.sav\");\n}\n\nbool SavesAccess::pathIsValid()\n{\n    \/\/ Return True if both the directory path is valid\n    \/\/ and the saves.sav file exists.\n    QFile savedGameFile(getSavesPath());\n    QFileInfo fileInfo(savedGameFile);\n    if (savedGameFile.exists() && (fileInfo.fileName() == \"saves.sav\"))\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nvoid SavesAccess::loadGamesList()\n{\n    \/\/ Save the file name.\n    QFile savedGameFile(rootSavesDirectory.absolutePath()\n                        + \"\/\" + \"saves.sav\");\n\n    if (savedGameModel == Q_NULLPTR)\n    {\n        qDebug() << \"SavedAccess model hasn't been set up yet.\";\n        return;\n    }\n\n    \/\/ Open file and make sure it went okay.\n    if (!savedGameFile.exists() || !savedGameFile.open(QFile::ReadOnly | QFile::Text))\n    {\n        \/\/ TODO: Make this error apparent on the interface somehow.\n        qDebug() << \"Can't open savedGameFile.\";\n        return;\n    }\n    else\n    {\n        QTextStream in(&savedGameFile);\n        QStringList strings;\n\n        long numberOfGames = in.readLine().toLongLong();\n        qDebug() << \"Loaded\" << numberOfGames << \"games.\";\n\n        \/\/ Remove all the games.\n        savedGameModel->clear();\n\n        \/\/ Add the games from the saves.sav file.\n        while (!in.atEnd())\n        {\n            strings = in.readLine().split(\"\/\", QString::KeepEmptyParts);\n\n            \/\/ Add the games to the list.\n            savedGameModel->appendRow(new SavedGame(strings[0],\n                                 strings[3],\n                                 strings[4],\n                                 strings[1].toLongLong(),\n                                 strings[2].toLongLong()));\n        }\n    }\n\n    \/\/ It's important to always close the file after reading\/writing, so this\n    \/\/ app can remain running while Timber and Stone saves as it wishes.\n    savedGameFile.close();\n}\n\nvoid SavesAccess::setSavedGameListModel(SavedGameListModel * model)\n{\n    savedGameModel = model;\n}\n\nQByteArray SavesAccess::toBinary(long value)\n{\n    QByteArray bytes;\n\n    \/\/ NOTE: I do not understand this. I understand what it's doing, but\n    \/\/ I have no idea why. I suspect it's much more simple, and I've\n    \/\/ missed something.\n    if (value>1919) \/\/ this is the largest two-byte number\n    {\n        bytes.append( (((value>>6) + 2)>>6) | 0xe0 );\n        bytes.append( (((value>>6) + 2) &0x3f) | 0x80 );\n    }\n    else\n    {\n        bytes.append( (((value>>6) &0x1f) + 2) | 0xc0 );\n    }\n    bytes.append((value&0x3f) | 0x80);\n\n    return bytes;\n}\n\n\/\/ This format handling can certainly be simplified. There's little\n\/\/ chance that the game designer made it complicated on purpose.\n\/\/\nlong SavesAccess::toLong(QByteArray bytes)\n{\n    \/\/ Ensure the bytes have only their relevant bits visible.\n    long value;\n    if( bytes.size() > 2 )\n    {\n        bytes[0] = bytes[0] & 0x1f; \/\/ Two or more bytes exist, so this one has an extra id bit.\n        bytes[1] = bytes[1] & 0x3f;\n        bytes[2] = bytes[2] & 0x3f;\n\n        \/\/ Compile the bytes into a long.\n        \/\/\n        \/\/ Note: The -2 in the equation is strange. I have no answer as to why\n        \/\/ this format requires that.\n        value = bytes[2] | (((bytes[1] | (bytes[0]<<6)) -2) << 6);\n    }\n    else\n    {\n        bytes[0] = bytes[0] & 0x3f;\n        bytes[1] = bytes[1] & 0x3f;\n        value = bytes[1] | (bytes[0] -2) << 6;\n    }\n\n    return value;\n}\n\n\/\/ =====================\n\/\/ RESOURCES\n\/\/ =====================\n\nvoid SavesAccess::setResourceListModel(ResourceListModel * model)\n{\n    resourceModel = model;\n}\n\nvoid SavesAccess::loadResourceFile()\n{\n    QFile resourceFile(rootSavesDirectory.absolutePath()\n                       + \"\/\" + selectedSaveName\n                       + \"\/\" + \"re.sav\");\n\n    if (resourceModel == Q_NULLPTR)\n    {\n        qDebug() << \"Resource model hasn't been set up yet.\";\n        return;\n    }\n\n    \/\/ Open file and make sure it went okay.\n    if (!resourceFile.exists() || !resourceFile.open(QFile::ReadWrite))\n    {\n        \/\/ TODO: Make this error apparent on the interface somehow.\n        qDebug() << \"Can't open resourceFile.\";\n        return;\n    }\n    else\n    {\n\n        \/\/ Pull in the list of resource assets (name, group, etc)\n        QFile assetFile(QCoreApplication::applicationDirPath() + \"\/resource_list.csv\");\n\n        if (assetFile.open(QIODevice::ReadOnly | QIODevice::Text))\n        {\n            qDebug() << \"Opened Asset File: \" << assetFile.fileName();\n\n            \/\/ Clear the resource model\n            resourceModel->clear();\n\n            QTextStream assetStream(&assetFile);\n            long index(0);\n\n            while (!assetStream.atEnd())\n            {\n                \/\/ Grab the next section and decide the size, etc.\n                QString assetString;\n                assetString = assetStream.readLine();\n                QStringList assetData;\n                assetData = assetString.split(',');\n\n                \/\/ Temporary array to hold the bytes we read from the file.\n                QByteArray byteArray;\n                byteArray.clear();\n\n                unsigned char byte; \/\/ Most Significant Byte\n                resourceFile.read((char *)&byte, 1);\n\n                if( byte >= 0xe0)\n                {\n                    byteArray.append(byte);\n\n                    \/\/ Another byte exists!\n                    resourceFile.read((char *)&byte, 1);\n                    byteArray.append(byte);\n                }\n                else\n                {\n                    byteArray.append(byte);\n                }\n\n                resourceFile.read((char *)&byte, 1);\n                byteArray.append(byte);\n\n                resourceModel->appendRow(new Resource(assetData[0],\n                                          assetData[1],\n                                          assetData[2],\n                                          toLong(byteArray), \/\/ resource quantity\n                                          index++));         \/\/ id\n            }\n\n            if (!resourceFile.atEnd())\n            {\n                \/\/ Read the rest of the file into an array, and keep it for later.\n                resourceExtraData.clear();\n                resourceExtraData = resourceFile.readAll();\n            }\n        }\n        else\n        {\n            \/\/ TODO: Make this error apparent on the interface somehow.\n            qDebug() << \"Could not open \" << assetFile.fileName();\n        }\n\n        assetFile.close();\n        resourceFile.close();\n    }\n\n}\n\n\nvoid SavesAccess::saveResourceFile()\n{\n    if (resourceModel == Q_NULLPTR\n            || resourceModel->rowCount() <= 0)\n    {\n        qDebug() << \"The resource model hasn't been populated.\";\n        return;\n    }\n\n    QFile resourceFile(rootSavesDirectory.absolutePath()\n                       + \"\/\" + selectedSaveName\n                       + \"\/\" + \"re.sav\");\n\n    \/\/ Open file for write, and make sure it went okay.\n    if (!resourceFile.open(QFile::ReadWrite))\n    {\n        \/\/ TODO: Make this error apparent on the interface somehow.\n        \/\/ Perhaps by making the save icon be red instead of green.\n        qDebug() << \"Can't open resourceFile for writing.\";\n        return;\n    }\n    else\n    {\n        QByteArray binaryData;\n\n        \/\/ Write the data to the resource file. Clobber the old one.\n        for (int ndx = 0;\n             ndx < resourceModel->rowCount();\n             ndx++)\n        {\n            long quantity = resourceModel->index(ndx).data(Resource::QuantityRole).toLongLong();\n            if (quantity > 30000)\n            {\n                qDebug() << \"Resource quantities above 32,639 will fail to load in the game. Reduced to 30,000.\";\n                quantity = 30000;\n\n                \/\/ Update the resource.\n                resourceModel->setData(ndx,30000);\n            }\n            binaryData = toBinary(quantity);\n            resourceFile.write(binaryData);\n        }\n\n        \/\/ Write out the unexpected data to the file too.\n        resourceFile.write(resourceExtraData);\n        resourceFile.close();\n    }\n}\n\n\/\/ =====================\n\/\/ UNITS (human, neutral mobs, violent mobs)\n\/\/ =====================\n\nvoid SavesAccess::setHumanModel(HumanListModel * model)\n{\n    humanModel = model;\n}\nvoid SavesAccess::setNeutralMobModel(NeutralMobListModel * model)\n{\n    neutralMobModel = model;\n}\nvoid SavesAccess::setViolentMobModel(ViolentMobListModel * model)\n{\n    violentMobModel = model;\n}\n\nvoid SavesAccess::loadUnitFile()\n{\n    \/\/ Compose the file name.\n    QFile unitFile(rootSavesDirectory.absolutePath()\n                   + \"\/\" + selectedSaveName\n                   + \"\/\" + \"un.sav\");\n\n    if ((humanModel == Q_NULLPTR) |\n        (neutralMobModel == Q_NULLPTR) |\n        (violentMobModel == Q_NULLPTR) )\n    {\n        qDebug() << \"Human, neutral, violent mob models haven't been set up yet.\";\n        return;\n    }\n\n    \/\/ Open file and make sure it went okay.\n    if (!unitFile.exists() || !unitFile.open(QFile::ReadWrite))\n    {\n        \/\/ TODO: Make this error apparent on the interface somehow.\n        qDebug() << \"Can't open unitFile.\";\n        return;\n    }\n    else\n    {\n        qDebug() << \"Opened unitFile.\" << unitFile.fileName();\n\n        \/\/ Remove all the humans.\n        humanModel->clear();\n\n        QTextStream unitStream(&unitFile);\n        QString unitString;\n        QStringList unitData;\n\n        \/\/ Load in all the Humans\n        int numberOfHumans = unitStream.readLine().toInt();\n        qDebug() << \"Number of humans: \" << numberOfHumans;\n        for (int i=0; i<numberOfHumans; i++)\n        {\n            unitString = unitStream.readLine();\n            unitData = unitString.split('\/');\n            qDebug() << \"   \" << unitData[0];\n\n            humanModel->appendRow(new Human(unitData[4],\n                                  unitData[0],\n                                  i));\n        }\n        qDebug() << \"In model: \" << humanModel->rowCount();\n\n        \/\/ Load in all the Neutral Mobs\n        int numberOfNeutralMobs = unitStream.readLine().toInt();\n        qDebug() << \"Number of neutral mobs: \" << numberOfNeutralMobs;\n        for (int i=0; i<numberOfNeutralMobs; i++)\n        {\n            unitString = unitStream.readLine();\n            unitData = unitString.split('\/');\n\n            qDebug() << \"   \" << unitData[0];\n        }\n\n        \/\/ Load in all the Violent Mobs\n        int numberOfViolentMobs = unitStream.readLine().toInt();\n        qDebug() << \"Number of violent mobs: \" << numberOfViolentMobs;\n        for (int i=0; i<numberOfViolentMobs; i++)\n        {\n            unitString = unitStream.readLine();\n            unitData = unitString.split('\/');\n\n            qDebug() << \"   \" << unitData[0];\n        }\n\n        unitFile.close();\n    }\n\n}\n\nvoid SavesAccess::saveUnitFile()\n{\n    \/\/ TODO: Save the units to the saved game file.\n}\n\n\nQ_DECLARE_METATYPE(SavesAccess*)\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2007 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 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 \"LocalizedStrings.h\"\n#include \"PlatformString.h\"\n#include \"IntSize.h\"\n\n#undef LOG\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n#include \"base\/logging.h\"\n#include \"base\/file_util.h\"\n#include \"base\/string_util.h\"\n#include \"build\/build_config.h\"\n#include \"webkit\/glue\/glue_util.h\"\n\n#if defined(OS_WIN)\n#include \"webkit_strings.h\"\n#else\n\/\/ TODO:(pinkerton): only windows has the GRIT machinery, so we've created a\n\/\/ temporary generated header until we can figure out the l10n strategy.\n#include \"bogus_webkit_strings.h\"\n#endif\n\nusing namespace WebCore;\n\ninline String GetLocalizedString(int message_id) {\n  const std::wstring& str(webkit_glue::GetLocalizedString(message_id));\n  return webkit_glue::StdWStringToString(str);\n}\n\n#if defined(OS_WIN)\nString WebCore::searchableIndexIntroduction() {\n  return GetLocalizedString(IDS_SEARCHABLE_INDEX_INTRO);\n}\nString WebCore::submitButtonDefaultLabel() {\n  return GetLocalizedString(IDS_FORM_SUBMIT_LABEL);\n}\nString WebCore::inputElementAltText() {\n  return GetLocalizedString(IDS_FORM_INPUT_ALT);\n}\nString WebCore::resetButtonDefaultLabel() {\n  return GetLocalizedString(IDS_FORM_RESET_LABEL);\n}\nString WebCore::fileButtonChooseFileLabel() {\n  return GetLocalizedString(IDS_FORM_FILE_BUTTON_LABEL);\n}\nString WebCore::fileButtonNoFileSelectedLabel() {\n  return GetLocalizedString(IDS_FORM_FILE_NO_FILE_LABEL);\n}\n\nString WebCore::searchMenuNoRecentSearchesText() {\n  return GetLocalizedString(IDS_RECENT_SEARCHES_NONE);\n}\nString WebCore::searchMenuRecentSearchesText() {\n  return GetLocalizedString(IDS_RECENT_SEARCHES);\n}\nString WebCore::searchMenuClearRecentSearchesText() {\n  return GetLocalizedString(IDS_RECENT_SEARCHES_CLEAR);\n}\n\n\/\/ A11y strings.\nString WebCore::AXWebAreaText() {\n  return GetLocalizedString(IDS_AX_ROLE_WEB_AREA);\n}\nString WebCore::AXLinkText() {\n  return GetLocalizedString(IDS_AX_ROLE_LINK);\n}\nString WebCore::AXListMarkerText() {\n  return GetLocalizedString(IDS_AX_ROLE_LIST_MARKER);\n}\nString WebCore::AXImageMapText() {\n  return GetLocalizedString(IDS_AX_ROLE_IMAGE_MAP);\n}\nString WebCore::AXHeadingText() {\n  return GetLocalizedString(IDS_AX_ROLE_HEADING);\n}\n#endif  \/\/ OS_WIN\nString WebCore::AXButtonActionVerb() {\n  return GetLocalizedString(IDS_AX_BUTTON_ACTION_VERB);\n}\nString WebCore::AXRadioButtonActionVerb() {\n  return GetLocalizedString(IDS_AX_RADIO_BUTTON_ACTION_VERB);\n}\nString WebCore::AXTextFieldActionVerb() {\n  return GetLocalizedString(IDS_AX_TEXT_FIELD_ACTION_VERB);\n}\nString WebCore::AXCheckedCheckBoxActionVerb() {\n  return GetLocalizedString(IDS_AX_CHECKED_CHECK_BOX_ACTION_VERB);\n}\nString WebCore::AXUncheckedCheckBoxActionVerb() {\n  return GetLocalizedString(IDS_AX_UNCHECKED_CHECK_BOX_ACTION_VERB);\n}\nString WebCore::AXLinkActionVerb() {\n  return GetLocalizedString(IDS_AX_LINK_ACTION_VERB);\n}\n\n\/\/ Used in FTPDirectoryDocument.cpp\nString WebCore::unknownFileSizeText() {\n  return String();\n}\n\n\/\/ These two are used in FileChooserWin.cpp.\n#if PLATFORM(WIN)\nString WebCore::uploadFileText() {\n  return String();\n}\nString WebCore::allFilesText() {\n  return String();\n}\n#endif\n\n\/\/ The following two functions are not declared in LocalizedStrings.h.\n\/\/ They are used by the menu for the HTML keygen tag.\nnamespace WebCore {\nString keygenMenuHighGradeKeySize() {\n  return GetLocalizedString(IDS_KEYGEN_HIGH_GRADE_KEY);\n}\nString keygenMenuMediumGradeKeySize() {\n  return GetLocalizedString(IDS_KEYGEN_MED_GRADE_KEY);\n}\n\n\/\/ Used in ImageDocument.cpp as the title for pages when that page is an image.\nString imageTitle(const String& filename, const IntSize& size) {\n  \/\/ C3 97 is UTF-8 for U+00D7 (multiplication sign).\n  std::string size_str = StringPrintf(\" (%d\\xC3\\x97%d)\",\n                                      size.width(), size.height());\n  return filename + webkit_glue::StdStringToString(size_str);\n}\n\n} \/\/namespace WebCore\n\n#if defined(OS_WIN)\n\/\/ We don't use these strings, so they return an empty String. We can't just\n\/\/ make them asserts because webcore still calls them.\nString WebCore::contextMenuItemTagOpenLinkInNewWindow() { return String(); }\nString WebCore::contextMenuItemTagDownloadLinkToDisk() { return String(); }\nString WebCore::contextMenuItemTagCopyLinkToClipboard() { return String(); }\nString WebCore::contextMenuItemTagOpenImageInNewWindow() { return String(); }\nString WebCore::contextMenuItemTagDownloadImageToDisk() { return String(); }\nString WebCore::contextMenuItemTagCopyImageToClipboard() { return String(); }\nString WebCore::contextMenuItemTagOpenFrameInNewWindow() { return String(); }\nString WebCore::contextMenuItemTagCopy() { return String(); }\nString WebCore::contextMenuItemTagGoBack() { return String(); }\nString WebCore::contextMenuItemTagGoForward() { return String(); }\nString WebCore::contextMenuItemTagStop() { return String(); }\nString WebCore::contextMenuItemTagReload() { return String(); }\nString WebCore::contextMenuItemTagCut() { return String(); }\nString WebCore::contextMenuItemTagPaste() { return String(); }\nString WebCore::contextMenuItemTagNoGuessesFound() { return String(); }\nString WebCore::contextMenuItemTagIgnoreSpelling() { return String(); }\nString WebCore::contextMenuItemTagLearnSpelling() { return String(); }\nString WebCore::contextMenuItemTagSearchWeb() { return String(); }\nString WebCore::contextMenuItemTagLookUpInDictionary() { return String(); }\nString WebCore::contextMenuItemTagOpenLink() { return String(); }\nString WebCore::contextMenuItemTagIgnoreGrammar() { return String(); }\nString WebCore::contextMenuItemTagSpellingMenu() { return String(); }\nString WebCore::contextMenuItemTagCheckSpelling() { return String(); }\nString WebCore::contextMenuItemTagCheckSpellingWhileTyping() { return String(); }\nString WebCore::contextMenuItemTagCheckGrammarWithSpelling() { return String(); }\nString WebCore::contextMenuItemTagFontMenu() { return String(); }\nString WebCore::contextMenuItemTagBold() { return String(); }\nString WebCore::contextMenuItemTagItalic() { return String(); }\nString WebCore::contextMenuItemTagUnderline() { return String(); }\nString WebCore::contextMenuItemTagOutline() { return String(); }\nString WebCore::contextMenuItemTagWritingDirectionMenu() { return String(); }\nString WebCore::contextMenuItemTagDefaultDirection() { return String(); }\nString WebCore::contextMenuItemTagLeftToRight() { return String(); }\nString WebCore::contextMenuItemTagRightToLeft() { return String(); }\nString WebCore::contextMenuItemTagInspectElement() { return String(); }\nString WebCore::contextMenuItemTagShowSpellingPanel(bool show) { return String(); }\n#endif  \/\/ OS_WIN\n<commit_msg>We want these symbols on all platforms.<commit_after>\/*\n * Copyright (C) 2007 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 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 \"LocalizedStrings.h\"\n#include \"PlatformString.h\"\n#include \"IntSize.h\"\n\n#undef LOG\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n#include \"base\/logging.h\"\n#include \"base\/file_util.h\"\n#include \"base\/string_util.h\"\n#include \"build\/build_config.h\"\n#include \"webkit\/glue\/glue_util.h\"\n\n#if defined(OS_WIN)\n#include \"webkit_strings.h\"\n#else\n\/\/ TODO:(pinkerton): only windows has the GRIT machinery, so we've created a\n\/\/ temporary generated header until we can figure out the l10n strategy.\n#include \"bogus_webkit_strings.h\"\n#endif\n\nusing namespace WebCore;\n\ninline String GetLocalizedString(int message_id) {\n  const std::wstring& str(webkit_glue::GetLocalizedString(message_id));\n  return webkit_glue::StdWStringToString(str);\n}\n\nString WebCore::searchableIndexIntroduction() {\n  return GetLocalizedString(IDS_SEARCHABLE_INDEX_INTRO);\n}\nString WebCore::submitButtonDefaultLabel() {\n  return GetLocalizedString(IDS_FORM_SUBMIT_LABEL);\n}\nString WebCore::inputElementAltText() {\n  return GetLocalizedString(IDS_FORM_INPUT_ALT);\n}\nString WebCore::resetButtonDefaultLabel() {\n  return GetLocalizedString(IDS_FORM_RESET_LABEL);\n}\nString WebCore::fileButtonChooseFileLabel() {\n  return GetLocalizedString(IDS_FORM_FILE_BUTTON_LABEL);\n}\nString WebCore::fileButtonNoFileSelectedLabel() {\n  return GetLocalizedString(IDS_FORM_FILE_NO_FILE_LABEL);\n}\n\nString WebCore::searchMenuNoRecentSearchesText() {\n  return GetLocalizedString(IDS_RECENT_SEARCHES_NONE);\n}\nString WebCore::searchMenuRecentSearchesText() {\n  return GetLocalizedString(IDS_RECENT_SEARCHES);\n}\nString WebCore::searchMenuClearRecentSearchesText() {\n  return GetLocalizedString(IDS_RECENT_SEARCHES_CLEAR);\n}\n\n\/\/ A11y strings.\nString WebCore::AXWebAreaText() {\n  return GetLocalizedString(IDS_AX_ROLE_WEB_AREA);\n}\nString WebCore::AXLinkText() {\n  return GetLocalizedString(IDS_AX_ROLE_LINK);\n}\nString WebCore::AXListMarkerText() {\n  return GetLocalizedString(IDS_AX_ROLE_LIST_MARKER);\n}\nString WebCore::AXImageMapText() {\n  return GetLocalizedString(IDS_AX_ROLE_IMAGE_MAP);\n}\nString WebCore::AXHeadingText() {\n  return GetLocalizedString(IDS_AX_ROLE_HEADING);\n}\nString WebCore::AXButtonActionVerb() {\n  return GetLocalizedString(IDS_AX_BUTTON_ACTION_VERB);\n}\nString WebCore::AXRadioButtonActionVerb() {\n  return GetLocalizedString(IDS_AX_RADIO_BUTTON_ACTION_VERB);\n}\nString WebCore::AXTextFieldActionVerb() {\n  return GetLocalizedString(IDS_AX_TEXT_FIELD_ACTION_VERB);\n}\nString WebCore::AXCheckedCheckBoxActionVerb() {\n  return GetLocalizedString(IDS_AX_CHECKED_CHECK_BOX_ACTION_VERB);\n}\nString WebCore::AXUncheckedCheckBoxActionVerb() {\n  return GetLocalizedString(IDS_AX_UNCHECKED_CHECK_BOX_ACTION_VERB);\n}\nString WebCore::AXLinkActionVerb() {\n  return GetLocalizedString(IDS_AX_LINK_ACTION_VERB);\n}\n\n\/\/ Used in FTPDirectoryDocument.cpp\nString WebCore::unknownFileSizeText() {\n  return String();\n}\n\n\/\/ These two are used in FileChooserWin.cpp.\n#if PLATFORM(WIN)\nString WebCore::uploadFileText() {\n  return String();\n}\nString WebCore::allFilesText() {\n  return String();\n}\n#endif\n\n\/\/ The following two functions are not declared in LocalizedStrings.h.\n\/\/ They are used by the menu for the HTML keygen tag.\nnamespace WebCore {\nString keygenMenuHighGradeKeySize() {\n  return GetLocalizedString(IDS_KEYGEN_HIGH_GRADE_KEY);\n}\nString keygenMenuMediumGradeKeySize() {\n  return GetLocalizedString(IDS_KEYGEN_MED_GRADE_KEY);\n}\n\n\/\/ Used in ImageDocument.cpp as the title for pages when that page is an image.\nString imageTitle(const String& filename, const IntSize& size) {\n  \/\/ C3 97 is UTF-8 for U+00D7 (multiplication sign).\n  std::string size_str = StringPrintf(\" (%d\\xC3\\x97%d)\",\n                                      size.width(), size.height());\n  return filename + webkit_glue::StdStringToString(size_str);\n}\n\n} \/\/namespace WebCore\n\n\/\/ We don't use these strings, so they return an empty String. We can't just\n\/\/ make them asserts because webcore still calls them.\nString WebCore::contextMenuItemTagOpenLinkInNewWindow() { return String(); }\nString WebCore::contextMenuItemTagDownloadLinkToDisk() { return String(); }\nString WebCore::contextMenuItemTagCopyLinkToClipboard() { return String(); }\nString WebCore::contextMenuItemTagOpenImageInNewWindow() { return String(); }\nString WebCore::contextMenuItemTagDownloadImageToDisk() { return String(); }\nString WebCore::contextMenuItemTagCopyImageToClipboard() { return String(); }\nString WebCore::contextMenuItemTagOpenFrameInNewWindow() { return String(); }\nString WebCore::contextMenuItemTagCopy() { return String(); }\nString WebCore::contextMenuItemTagGoBack() { return String(); }\nString WebCore::contextMenuItemTagGoForward() { return String(); }\nString WebCore::contextMenuItemTagStop() { return String(); }\nString WebCore::contextMenuItemTagReload() { return String(); }\nString WebCore::contextMenuItemTagCut() { return String(); }\nString WebCore::contextMenuItemTagPaste() { return String(); }\nString WebCore::contextMenuItemTagNoGuessesFound() { return String(); }\nString WebCore::contextMenuItemTagIgnoreSpelling() { return String(); }\nString WebCore::contextMenuItemTagLearnSpelling() { return String(); }\nString WebCore::contextMenuItemTagSearchWeb() { return String(); }\nString WebCore::contextMenuItemTagLookUpInDictionary() { return String(); }\nString WebCore::contextMenuItemTagOpenLink() { return String(); }\nString WebCore::contextMenuItemTagIgnoreGrammar() { return String(); }\nString WebCore::contextMenuItemTagSpellingMenu() { return String(); }\nString WebCore::contextMenuItemTagCheckSpelling() { return String(); }\nString WebCore::contextMenuItemTagCheckSpellingWhileTyping() { return String(); }\nString WebCore::contextMenuItemTagCheckGrammarWithSpelling() { return String(); }\nString WebCore::contextMenuItemTagFontMenu() { return String(); }\nString WebCore::contextMenuItemTagBold() { return String(); }\nString WebCore::contextMenuItemTagItalic() { return String(); }\nString WebCore::contextMenuItemTagUnderline() { return String(); }\nString WebCore::contextMenuItemTagOutline() { return String(); }\nString WebCore::contextMenuItemTagWritingDirectionMenu() { return String(); }\nString WebCore::contextMenuItemTagDefaultDirection() { return String(); }\nString WebCore::contextMenuItemTagLeftToRight() { return String(); }\nString WebCore::contextMenuItemTagRightToLeft() { return String(); }\nString WebCore::contextMenuItemTagInspectElement() { return String(); }\nString WebCore::contextMenuItemTagShowSpellingPanel(bool show) { return String(); }\n<|endoftext|>"}
{"text":"<commit_before>#ifndef slic3r_Tesselate_hpp_\n#define slic3r_Tesselate_hpp_\n\n#include <vector>\n\nnamespace Slic3r {\n\nclass ExPolygon;\ntypedef std::vector<ExPolygon> ExPolygons;\n\nextern Pointf3s triangulate_expolygons_3df(const ExPolygon &poly, coordf_t z = 0, bool flip = false);\nextern Pointf3s triangulate_expolygons_3df(const ExPolygons &polys, coordf_t z = 0, bool flip = false);\n\n} \/\/ namespace Slic3r\n\n#endif \/* slic3r_Tesselate_hpp_ *\/\n<commit_msg>Fixed compilation on OSX<commit_after>#ifndef slic3r_Tesselate_hpp_\n#define slic3r_Tesselate_hpp_\n\n#include <vector>\n\n#include \"Point.hpp\"\n\nnamespace Slic3r {\n\nclass ExPolygon;\ntypedef std::vector<ExPolygon> ExPolygons;\n\nextern Pointf3s triangulate_expolygons_3df(const ExPolygon &poly, coordf_t z = 0, bool flip = false);\nextern Pointf3s triangulate_expolygons_3df(const ExPolygons &polys, coordf_t z = 0, bool flip = false);\n\n} \/\/ namespace Slic3r\n\n#endif \/* slic3r_Tesselate_hpp_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"graphwidget.h\"\n\n#include <QGraphicsScene>\n#include <QGraphicsPolygonItem>\n#include <QWheelEvent>\n#include <QApplication>\n#include <QUrl>\n\n#include \"sprite.h\"\n#include \"config.h\"\n#include \"Debug.h\"\n\nGraphWidget::GraphWidget(QWidget *parent)\n    : QGraphicsView(parent)\n    , m_scene(new QGraphicsScene())\n    , m_scaleFactor(1)\n    , m_pressed(false)\n{\n    QSettings settings(Config::config(), Config::format());\n    int w = settings.value(Config::editorw, Config::w).toReal();\n    int h = settings.value(Config::editorh, Config::h).toReal();\n\n    this->setScene(m_scene);\n    this->setSceneRect(0,0,w,h);\n\n    init();\n\/\/    m_scene->addRect(0,0,w,h, QPen(Qt::red, 3, Qt::DashDotLine, Qt::RoundCap, Qt::RoundJoin));\n\n    setUpright(false, iPhone480x320);\n}\n\n\nvoid GraphWidget::scaleBy(double factor)\n{\n    scale(factor, factor);\n}\n\nvoid GraphWidget::zoomIn()\n{\n    scaleBy(1.1);\n}\n\nvoid GraphWidget::zoomOut()\n{\n    scaleBy(1.0 \/ 1.1);\n}\n\nvoid GraphWidget::setUpright(bool yes, DeviceType type)\n{\n    if (yes) {\n        m_bgFrame.load(m_frames.value(type));\n        m_frameStartPoint = m_framePoint.value(type);\n    }\n    else {\n        m_bgFrame.load(m_framevs.value(type));\n        m_frameStartPoint = m_framevPoint.value(type);\n    }\n}\n\nvoid GraphWidget::init()\n{\n    m_frames.insert(iPhone480x320, \"resource\/4frame.png\");\n    m_frames.insert(iPhone960x640, \"resource\/fframe@2x.png\");\n\n    m_framevs.insert(iPhone480x320, \"resource\/4frame-v.png\");\n    m_framevs.insert(iPhone960x640, \"resource\/fframe@2x-v.png\");\n\n    m_framePoint.insert(iPhone480x320, QPoint(0,0));\n    m_framePoint.insert(iPhone480x320, QPoint(0,0));\n\n    m_framevPoint.insert(iPhone480x320, QPoint(-119,-23));\n    m_framevPoint.insert(iPhone960x640, QPoint(0,0));\n\n    \/\/ mouse rect\n    m_mouseRectItem.setRect(0,0,1,1);\n    m_mouseRectItem.setBrush(QBrush(QColor(200,200,200,100)));\n    m_mouseRectItem.hide();\n    m_mouseRectItem.setZValue(100);\n    m_scene->addItem(&m_mouseRectItem);\n\n    \/\/ controller\n    m_controllerItem.setRect(0,0,100,100);\n    m_controllerItem.setBrush(QBrush(QColor(255,0,0,100)));\n    m_controllerItem.hide();\n    m_controllerItem.setZValue(100);\n    m_scene->addItem(&m_controllerItem);\n}\n\nvoid GraphWidget::wheelEvent(QWheelEvent *event)\n{\n    if (event->modifiers() == Qt::ControlModifier)\n     {\n         scaleBy(std::pow(4.0 \/ 3.0, (-event->delta() \/ 240.0)));\n     }\n     else\n     {\n         QGraphicsView::wheelEvent(event);\n     }\n\n    QGraphicsView::wheelEvent(event);\n}\n\n\/**\n * @brief GraphWidget::mousePressEvent\n * @param event\n *\n * - Operation of object is like folder on windows\/mac\/..\n *\/\nvoid GraphWidget::mousePressEvent(QMouseEvent *event)\n{\n    if (event->button() == Qt::LeftButton) {\n        QGraphicsItem *item = itemAt(event->pos());\n\n        m_prePos = event->posF();\n        m_pressed = true;\n        if (item) {\n            \/\/ add child if pressed ctrl, otherwise set the selected\n            \/\/ item as selected items\n            if (event->modifiers() == Qt::ControlModifier) {\n                if (!m_selectItems.contains(item))\n                    m_selectItems.append(item);\n            } else {\n                if (!m_selectItems.contains(item)) {\n                    m_selectItems.clear();\n                    m_selectItems.append(item);\n                }\n            }\n        } else {\n            \/\/ clear selected itmes and show mouse rect\n\n            \/\/ clear\n            m_selectItems.clear();\n\n            \/\/ show rect\n            m_mouseStartPoint = mapToScene(event->pos());\n            m_mouseRectItem.setRect(m_mouseRectItem.x()\n                                    , m_mouseRectItem.y(),1,1);\n            m_mouseRectItem.show();\n        }\n    }\n    QGraphicsView::mousePressEvent(event);\n}\n\nvoid GraphWidget::mouseReleaseEvent(QMouseEvent * event)\n{\n    m_pressed = false;\n\n    \/\/ select the items which in the mouse rect\n    m_selectItems = m_mouseRectItem.collidingItems();\n\n    m_mouseRectItem.hide();\n    QGraphicsView::mouseReleaseEvent(event);\n}\n\nvoid GraphWidget::mouseMoveEvent(QMouseEvent *event)\n{\n    \/\/ move items if there are, otherwise show mouse rect\n    if (m_pressed) {\n        if (m_selectItems.count()) {\n            foreach (QGraphicsItem* it, m_selectItems) {\n                QPointF delta = event->posF() - m_prePos;\n                it->setPos(delta + it->pos());\n            }\n            m_prePos =event->posF();\n        } else {\n            QPointF p = mapToScene(event->pos());\n            showMouseRect(m_mouseStartPoint.toPoint(), p.toPoint());\n\n\n        }\n    }\n\n    QGraphicsView::mouseMoveEvent(event);\n}\n\nvoid GraphWidget::keyReleaseEvent(QKeyEvent *event)\n{\n    \/\/ delete sprite\n    if (event->key() == Qt::Key_Delete) {\n        qDeleteAll(m_selectItems);\n        m_selectItems.clear();\n    }\n\n    QGraphicsView::keyReleaseEvent(event);\n}\n\nvoid GraphWidget::paintEvent(QPaintEvent * event)\n{\n    QGraphicsView::paintEvent(event);\n}\n\nvoid GraphWidget::dragEnterEvent(QDragEnterEvent *event)\n{\n    event->accept();\n}\n\nvoid GraphWidget::dragMoveEvent(QDragMoveEvent *event)\n{\n    event->accept();\n}\n\nvoid GraphWidget::dropEvent(QDropEvent *event)\n{\n    if (m_scene) {\n        QUrl url = event->mimeData()->urls().at(0);\n        QString file = url.toLocalFile();\n        QPixmap pixmap(file);\n        if (!pixmap.isNull()) {\n            Sprite *sprite = new Sprite(QPixmap(url.toLocalFile()));\n            sprite->setPos(mapToScene(event->pos()));\n            m_scene->addItem(sprite);\n        } if (file.endsWith(\".pshs\")) {\n\n        } else if (file.endsWith(\".plist\")) {\n\n        }\n    }\n}\n\nvoid GraphWidget::drawBackground(QPainter *painter, const QRectF &rect)\n{\n    QGraphicsView::drawBackground(painter, rect);\n\n    if (!m_bgFrame.isNull()) {\n        painter->drawPixmap(m_frameStartPoint, m_bgFrame);\n    }\n}\n\nvoid GraphWidget::drawForeground(QPainter *painter, const QRectF &rect)\n{\n    QGraphicsView::drawForeground(painter, rect);\n\n    \/\/ view rect\n    painter->setPen(QPen(Qt::red));\n    painter->drawRect(sceneRect());\n}\n\nvoid GraphWidget::showMouseRect(QPoint start, QPoint end)\n{\n    int x = start.x();\n    int y = start.y();\n    int w = end.x() - start.x();\n    int h = end.y() - start.y();\n\n    if (w < 0) x = end.x();\n    if (h < 0) y = end.y();\n\n    m_mouseRectItem.setRect(x,y, abs(w),abs(h));\n}\n\nvoid GraphWidget::hideControllerItem()\n{\n    m_controllerItem.hide();\n}\n\nvoid GraphWidget::showControllerItem(QPointF pos)\n{\n    m_controllerItem.show();\n    m_controllerItem.setPos(pos);\n}\n\nvoid GraphWidget::showControllerItem(QPoint pos)\n{\n    m_controllerItem.show();\n    m_controllerItem.setPos(pos);\n}\n<commit_msg>[fix:#2] only one move<commit_after>#include \"graphwidget.h\"\n\n#include <QGraphicsScene>\n#include <QGraphicsPolygonItem>\n#include <QWheelEvent>\n#include <QApplication>\n#include <QUrl>\n\n#include \"sprite.h\"\n#include \"config.h\"\n#include \"Debug.h\"\n\nGraphWidget::GraphWidget(QWidget *parent)\n    : QGraphicsView(parent)\n    , m_scene(new QGraphicsScene())\n    , m_scaleFactor(1)\n    , m_pressed(false)\n{\n    QSettings settings(Config::config(), Config::format());\n    int w = settings.value(Config::editorw, Config::w).toReal();\n    int h = settings.value(Config::editorh, Config::h).toReal();\n\n    this->setScene(m_scene);\n    this->setSceneRect(0,0,w,h);\n\n    init();\n\/\/    m_scene->addRect(0,0,w,h, QPen(Qt::red, 3, Qt::DashDotLine, Qt::RoundCap, Qt::RoundJoin));\n\n    setUpright(false, iPhone480x320);\n}\n\n\nvoid GraphWidget::scaleBy(double factor)\n{\n    scale(factor, factor);\n}\n\nvoid GraphWidget::zoomIn()\n{\n    scaleBy(1.1);\n}\n\nvoid GraphWidget::zoomOut()\n{\n    scaleBy(1.0 \/ 1.1);\n}\n\nvoid GraphWidget::setUpright(bool yes, DeviceType type)\n{\n    if (yes) {\n        m_bgFrame.load(m_frames.value(type));\n        m_frameStartPoint = m_framePoint.value(type);\n    }\n    else {\n        m_bgFrame.load(m_framevs.value(type));\n        m_frameStartPoint = m_framevPoint.value(type);\n    }\n}\n\nvoid GraphWidget::init()\n{\n    m_frames.insert(iPhone480x320, \"resource\/4frame.png\");\n    m_frames.insert(iPhone960x640, \"resource\/fframe@2x.png\");\n\n    m_framevs.insert(iPhone480x320, \"resource\/4frame-v.png\");\n    m_framevs.insert(iPhone960x640, \"resource\/fframe@2x-v.png\");\n\n    m_framePoint.insert(iPhone480x320, QPoint(0,0));\n    m_framePoint.insert(iPhone480x320, QPoint(0,0));\n\n    m_framevPoint.insert(iPhone480x320, QPoint(-119,-23));\n    m_framevPoint.insert(iPhone960x640, QPoint(0,0));\n\n    \/\/ mouse rect\n    m_mouseRectItem.setRect(0,0,1,1);\n    m_mouseRectItem.setBrush(QBrush(QColor(200,200,200,100)));\n    m_mouseRectItem.hide();\n    m_mouseRectItem.setZValue(100);\n    m_scene->addItem(&m_mouseRectItem);\n\n    \/\/ controller\n    m_controllerItem.setRect(0,0,100,100);\n    m_controllerItem.setBrush(QBrush(QColor(255,0,0,100)));\n    m_controllerItem.hide();\n    m_controllerItem.setZValue(100);\n    m_scene->addItem(&m_controllerItem);\n}\n\nvoid GraphWidget::wheelEvent(QWheelEvent *event)\n{\n    if (event->modifiers() == Qt::ControlModifier)\n     {\n         scaleBy(std::pow(4.0 \/ 3.0, (-event->delta() \/ 240.0)));\n     }\n     else\n     {\n         QGraphicsView::wheelEvent(event);\n     }\n\n    QGraphicsView::wheelEvent(event);\n}\n\n\/**\n * @brief GraphWidget::mousePressEvent\n * @param event\n *\n * - Operation of object is like folder on windows\/mac\/..\n *\/\nvoid GraphWidget::mousePressEvent(QMouseEvent *event)\n{\n    if (event->button() == Qt::LeftButton) {\n        QGraphicsItem *item = itemAt(event->pos());\n\n        m_prePos = event->posF();\n        m_pressed = true;\n        if (item) {\n            \/\/ add child if pressed ctrl, otherwise set the selected\n            \/\/ item as selected items\n            if (event->modifiers() == Qt::ControlModifier) {\n                if (!m_selectItems.contains(item)) {\n                    m_selectItems.append(item);\n                }\n\n            } else {\n                if (!m_selectItems.contains(item)) {\n                    m_selectItems.clear();\n                    m_selectItems.append(item);\n                }\n            }\n        } else {\n            \/\/ clear selected itmes and show mouse rect\n\n            \/\/ clear\n            m_selectItems.clear();\n\n            \/\/ show rect\n            m_mouseStartPoint = mapToScene(event->pos());\n            m_mouseRectItem.setRect(m_mouseRectItem.x()\n                                    , m_mouseRectItem.y(),1,1);\n        }\n    }\n    QGraphicsView::mousePressEvent(event);\n}\n\nvoid GraphWidget::mouseReleaseEvent(QMouseEvent * event)\n{\n    m_pressed = false;\n\n    if (m_mouseRectItem.isVisible()) {\n        \/\/ select the items which in the mouse rect\n        m_selectItems = m_mouseRectItem.collidingItems();\n    }\n\n    m_mouseRectItem.hide();\n    QGraphicsView::mouseReleaseEvent(event);\n}\n\nvoid GraphWidget::mouseMoveEvent(QMouseEvent *event)\n{\n    \/\/ move items if there are, otherwise show mouse rect\n    if (m_pressed) {\n        if (m_selectItems.count()) {\n            foreach (QGraphicsItem* it, m_selectItems) {\n                QPointF delta = event->posF() - m_prePos;\n                it->setPos(delta + it->pos());\n            }\n            m_prePos =event->posF();\n        } else {\n            QPointF p = mapToScene(event->pos());\n            showMouseRect(m_mouseStartPoint.toPoint(), p.toPoint());\n        }\n    }\n\n    QGraphicsView::mouseMoveEvent(event);\n}\n\nvoid GraphWidget::keyReleaseEvent(QKeyEvent *event)\n{\n    \/\/ delete sprite\n    if (event->key() == Qt::Key_Delete) {\n        qDeleteAll(m_selectItems);\n        m_selectItems.clear();\n    }\n\n    QGraphicsView::keyReleaseEvent(event);\n}\n\nvoid GraphWidget::paintEvent(QPaintEvent * event)\n{\n    QGraphicsView::paintEvent(event);\n}\n\nvoid GraphWidget::dragEnterEvent(QDragEnterEvent *event)\n{\n    event->accept();\n}\n\nvoid GraphWidget::dragMoveEvent(QDragMoveEvent *event)\n{\n    event->accept();\n}\n\nvoid GraphWidget::dropEvent(QDropEvent *event)\n{\n    if (m_scene) {\n        QUrl url = event->mimeData()->urls().at(0);\n        QString file = url.toLocalFile();\n        QPixmap pixmap(file);\n        if (!pixmap.isNull()) {\n            Sprite *sprite = new Sprite(QPixmap(url.toLocalFile()));\n            sprite->setPos(mapToScene(event->pos()));\n            m_scene->addItem(sprite);\n        } if (file.endsWith(\".pshs\")) {\n\n        } else if (file.endsWith(\".plist\")) {\n\n        }\n    }\n}\n\nvoid GraphWidget::drawBackground(QPainter *painter, const QRectF &rect)\n{\n    QGraphicsView::drawBackground(painter, rect);\n\n    if (!m_bgFrame.isNull()) {\n        painter->drawPixmap(m_frameStartPoint, m_bgFrame);\n    }\n}\n\nvoid GraphWidget::drawForeground(QPainter *painter, const QRectF &rect)\n{\n    QGraphicsView::drawForeground(painter, rect);\n\n    \/\/ view rect\n    painter->setPen(QPen(Qt::red));\n    painter->drawRect(sceneRect());\n}\n\nvoid GraphWidget::showMouseRect(QPoint start, QPoint end)\n{\n    int x = start.x();\n    int y = start.y();\n    int w = end.x() - start.x();\n    int h = end.y() - start.y();\n\n    if (w < 0) x = end.x();\n    if (h < 0) y = end.y();\n\n    m_mouseRectItem.show();\n    m_mouseRectItem.setRect(x,y, abs(w),abs(h));\n}\n\nvoid GraphWidget::hideControllerItem()\n{\n    m_controllerItem.hide();\n}\n\nvoid GraphWidget::showControllerItem(QPointF pos)\n{\n    m_controllerItem.show();\n    m_controllerItem.setPos(pos);\n}\n\nvoid GraphWidget::showControllerItem(QPoint pos)\n{\n    m_controllerItem.show();\n    m_controllerItem.setPos(pos);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/                                MFEM Example 0\n\/\/\n\/\/ Compile with: make ex0\n\/\/\n\/\/ Sample runs:  ex0\n\/\/               ex0 -m ..\/data\/fichera.mesh\n\/\/               ex0 -m ..\/data\/square-disc.mesh -o 2\n\/\/\n\/\/ Description: This example code demonstrates the most basic usage of MFEM to\n\/\/              define a simple finite element discretization of the Laplace\n\/\/              problem -Delta u = 1 with zero Dirichlet boundary conditions.\n\/\/              General 2D\/3D mesh files and finite element polynomial degrees\n\/\/              can be specified by command line options.\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace std;\nusing namespace mfem;\n\nint main(int argc, char *argv[])\n{\n   \/\/ 1. Parse command line options\n   const char *mesh_file = \"..\/data\/star.mesh\";\n   int order = 1;\n\n   OptionsParser args(argc, argv);\n   args.AddOption(&mesh_file, \"-m\", \"--mesh\", \"Mesh file to use.\");\n   args.AddOption(&order, \"-o\", \"--order\", \"Finite element polynomial degree\");\n   args.ParseCheck();\n\n   \/\/ 2. Read the mesh from the given mesh file, and refine once uniformly.\n   Mesh mesh(mesh_file);\n   mesh.UniformRefinement();\n\n   \/\/ 3. Define a finite element space on the mesh. Here we use H1 continuous\n   \/\/    high-order Lagrange finite elements of the given order.\n   H1_FECollection fec(order, mesh.Dimension());\n   FiniteElementSpace fespace(&mesh, &fec);\n   cout << \"Number of unknowns: \" << fespace.GetTrueVSize() << endl;\n\n   \/\/ 4. Extract the list of all the boundary DOFs. These will be marked as\n   \/\/    Dirichlet in order to enforce zero boundary conditions.\n   Array<int> boundary_dofs;\n   fespace.GetBoundaryTrueDofs(boundary_dofs);\n\n   \/\/ 5. Define the solution x as a finite element grid function in fespace. Set\n   \/\/    the initial guess to zero, which also sets the boundary conditions.\n   GridFunction x(&fespace);\n   x = 0.0;\n\n   \/\/ 6. Set up the linear form b(.) corresponding to the right-hand side.\n   ConstantCoefficient one(1.0);\n   LinearForm b(&fespace);\n   b.AddDomainIntegrator(new DomainLFIntegrator(one));\n   b.Assemble();\n\n   \/\/ 7. Set up the bilinear form a(.,.) corresponding to the -Delta operator.\n   BilinearForm a(&fespace);\n   a.AddDomainIntegrator(new DiffusionIntegrator);\n   a.Assemble();\n\n   \/\/ 8. Form the linear system A X = B. This includes eliminating boundary\n   \/\/    conditions, applying AMR constraints, and other transformations.\n   SparseMatrix A;\n   Vector B, X;\n   a.FormLinearSystem(boundary_dofs, x, b, A, X, B);\n\n   \/\/ 9. Solve the system using PCG with symmetric Gauss-Seidel preconditioner.\n   GSSmoother M(A);\n   PCG(A, M, B, X, 1, 200, 1e-12, 0.0);\n\n   \/\/ 10. Recover the solution x as a grid function and save to file. The output\n   \/\/     can be viewed using GLVis as follows: \"glvis -m mesh.mesh -g sol.gf\"\n   a.RecoverFEMSolution(X, b, x);\n   x.Save(\"sol.gf\");\n   mesh.Save(\"mesh.mesh\");\n\n   return 0;\n}\n<commit_msg>Introduce a failure in a test for testing purpose<commit_after>\/\/                                MFEM Example 0\n\/\/\n\/\/ Compile with: make ex0\n\/\/\n\/\/ Sample runs:  ex0\n\/\/               ex0 -m ..\/data\/fichera.mesh\n\/\/               ex0 -m ..\/data\/square-disc.mesh -o 2\n\/\/\n\/\/ Description: This example code demonstrates the most basic usage of MFEM to\n\/\/              define a simple finite element discretization of the Laplace\n\/\/              problem -Delta u = 1 with zero Dirichlet boundary conditions.\n\/\/              General 2D\/3D mesh files and finite element polynomial degrees\n\/\/              can be specified by command line options.\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace std;\nusing namespace mfem;\n\nint main(int argc, char *argv[])\n{\n   \/\/ 1. Parse command line options\n   const char *mesh_file = \"..\/data\/star.mesh\";\n   int order = 1;\n\n   OptionsParser args(argc, argv);\n   args.AddOption(&mesh_file, \"-m\", \"--mesh\", \"Mesh file to use.\");\n   args.AddOption(&order, \"-o\", \"--order\", \"Finite element polynomial degree\");\n   args.ParseCheck();\n\n   \/\/ 2. Read the mesh from the given mesh file, and refine once uniformly.\n   Mesh mesh(mesh_file);\n   mesh.UniformRefinement();\n\n   \/\/ 3. Define a finite element space on the mesh. Here we use H1 continuous\n   \/\/    high-order Lagrange finite elements of the given order.\n   H1_FECollection fec(order, mesh.Dimension());\n   FiniteElementSpace fespace(&mesh, &fec);\n   cout << \"Number of unknowns: \" << fespace.GetTrueVSize() << endl;\n\n   \/\/ 4. Extract the list of all the boundary DOFs. These will be marked as\n   \/\/    Dirichlet in order to enforce zero boundary conditions.\n   Array<int> boundary_dofs;\n   fespace.GetBoundaryTrueDofs(boundary_dofs);\n\n   \/\/ 5. Define the solution x as a finite element grid function in fespace. Set\n   \/\/    the initial guess to zero, which also sets the boundary conditions.\n   GridFunction x(&fespace);\n   x = 0.0;\n\n   \/\/ 6. Set up the linear form b(.) corresponding to the right-hand side.\n   ConstantCoefficient one(1.0);\n   LinearForm b(&fespace);\n   b.AddDomainIntegrator(new DomainLFIntegrator(one));\n   b.Assemble();\n\n   \/\/ 7. Set up the bilinear form a(.,.) corresponding to the -Delta operator.\n   BilinearForm a(&fespace);\n   a.AddDomainIntegrator(new DiffusionIntegrator);\n   a.Assemble();\n\n   \/\/ 8. Form the linear system A X = B. This includes eliminating boundary\n   \/\/    conditions, applying AMR constraints, and other transformations.\n   SparseMatrix A;\n   Vector B, X;\n   a.FormLinearSystem(boundary_dofs, x, b, A, X, B);\n\n   \/\/ 9. Solve the system using PCG with symmetric Gauss-Seidel preconditioner.\n   GSSmoother M(A);\n   PCG(A, M, B, X, 1, 200, 1e-12, 0.0);\n\n   \/\/ 10. Recover the solution x as a grid function and save to file. The output\n   \/\/     can be viewed using GLVis as follows: \"glvis -m mesh.mesh -g sol.gf\"\n   a.RecoverFEMSolution(X, b, x);\n   x.Save(\"sol.gf\");\n   mesh.Save(\"mesh.mesh\")\n\n   return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ To use this file, compile 'gcd.tmpc' with\n\/\/ tmpcompiler -o gcd.hpp gcd.tmpc\n#include <iostream>\n\n#include \"gcd.hpp\"\n\ntemplate <typename T>\nstruct wrap\n{\n    typedef T type;\n};\n\n\/\/ Convert a template argument list (of ints) to a List as compiled by\n\/\/ tmpcompiler.\ntemplate <int ... i>\nstruct ints_to_list;\n\ntemplate <>\nstruct ints_to_list<>\n{\n    typedef __data<0, __dummy> type;\n};\n\ntemplate <int i, int ... j>\nstruct ints_to_list<i, j...>\n{\n    typedef __data<1, __dummy, Int<i>, typename ints_to_list<j...>::type> type;\n};\n\nint main()\n{\n    std::cout << \"gcd(100, 80, 64) = \"\n        << gcds::type::apply<ints_to_list<100, 80, 64> >::type::value\n        << \"\\n\";\n}\n<commit_msg>Useless 'wrap'.<commit_after>\/\/ To use this file, compile 'gcd.tmpc' with\n\/\/ tmpcompiler -o gcd.hpp gcd.tmpc\n#include <iostream>\n\n#include \"gcd.hpp\"\n\n\/\/ Convert a template argument list (of ints) to a List as compiled by\n\/\/ tmpcompiler.\ntemplate <int ... i>\nstruct ints_to_list;\n\ntemplate <>\nstruct ints_to_list<>\n{\n    typedef __data<0, __dummy> type;\n};\n\ntemplate <int i, int ... j>\nstruct ints_to_list<i, j...>\n{\n    typedef __data<1, __dummy, Int<i>, typename ints_to_list<j...>::type> type;\n};\n\nint main()\n{\n    std::cout << \"gcd(100, 80, 64) = \"\n        << gcds::type::apply<ints_to_list<100, 80, 64> >::type::value\n        << \"\\n\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* $Id: $ *\/\n\/* $Log$ *\/\n\n\/\/------------------------------------\n\/\/ Configuration macro example:\n\/\/\n\/\/ Do prompt photon analysis with ESDs\n\/\/ Gamma in PHOS, \n\/\/ for EMCAL, PHOS by EMCAL where necessary\n\/\/\n\/\/ Author : Gustavo Conesa Balbastre (INFN-LNF)\n\/\/------------------------------------\n\nAliAnaMaker*  ConfigAnalysis()\n{\n  \/\/\n  \/\/ Configuration goes here\n  \/\/ \n  printf(\"======================== \\n\");\n  printf(\"ConfigAnalysis() \\n\");\n  printf(\"======================== \\n\");\n  \n  \n  \/\/Detector Fidutial Cuts\n  AliFidutialCut * fidCut = new AliFidutialCut();\n  fidCut->DoCTSFidutialCut(kTRUE) ;\n  \/\/fidCut->DoEMCALFidutialCut(kFALSE) ;\n  fidCut->DoPHOSFidutialCut(kTRUE) ;\n  \n  fidCut->SetSimpleCTSFidutialCut(0.9,0.,360.);\n  f\/\/idCut->SetSimpleEMCALFidutialCut(0.7,80.,190.);\n  fidCut->SetSimplePHOSFidutialCut(0.13,220.,320.);\n   \n  fidCut->Print(\"\");\n  \n  \/\/-----------------------------------------------------------  \n  \/\/ Reader\n  \/\/-----------------------------------------------------------\n  AliCaloTrackReader *reader = new AliCaloTrackESDReader();\n  reader->SetDebug(-1);\n\n  \/\/Switch on or off the detectors information that you want\n  reader->SwitchOffEMCAL();\n  reader->SwitchOnCTS();\n  reader->SwitchOnPHOS();\n  \n  \/\/Min particle pT\n  \/\/reader->SetEMCALPtMin(0.5); \n  reader->SetPHOSPtMin(0.5);\n  reader->SetCTSPtMin(0.2);\n  \n  reader->SetFidutialCut(fidCut);\n  reader->Print(\"\");\n  \n  \n  \/\/---------------------------------------------------------------------\n  \/\/ Analysis algorithm\n  \/\/---------------------------------------------------------------------\n  \n  \/\/Detector Fidutial Cuts for analysis part\n  AliFidutialCut * fidCut2 = new AliFidutialCut();\n  fidCut2->DoCTSFidutialCut(kFALSE) ;\n  \/\/fidCut2->DoEMCALFidutialCut(kTRUE) ;\n  fidCut2->DoPHOSFidutialCut(kFALSE) ;\n  \n  fidCut2->SetSimpleCTSFidutialCut(0.9,0.,360.);\n  \/\/fidCut2->SetSimpleEMCALFidutialCut(0.7,80.,190.);\n  fidCut2->SetSimplePHOSFidutialCut(0.13,220.,320.);\n  fidCut2->Print(\"\");\n\n  AliCaloPID * pid = new AliCaloPID();\n  \/\/ use selection with simple weights\n  pid->SetPHOSPhotonWeight(0.7);    pid->SetPHOSPi0Weight(0.7); \n  pid->SetEMCALPhotonWeight(0.7);    pid->SetEMCALPi0Weight(0.7);\n  \/\/ use more complicated selection, particle weight depending on cluster energy\n\/\/   pid->UsePHOSPIDWeightFormula(kTRUE);\n\/\/   TFormula * photonF = new TFormula(\"photonWeight\",\"0.98*(x<40)+ 0.68*(x>=100)+(x>=40 && x<100)*(0.98+x*(6e-3)-x*x*(2e-04)+x*x*x*(1.1e-06))\");\n\/\/   TFormula * pi0F = new TFormula(\"pi0Weight\",\"0.98*(x<65)+ 0.915*(x>=100)+(x>=65 && x-x*(1.95e-3)-x*x*(4.31e-05)+x*x*x*(3.61e-07))\");\n\/\/   pid->SetPHOSPhotonWeightFormula(photonF);\n\/\/   pid->SetPHOSPi0WeightFormula(pi0F);\n  pid->Print(\"\");\n\n  AliIsolationCut * ic = new AliIsolationCut();\n  ic->SetConeSize(0.4);\n  ic->SetPtThreshold(1.);\n  ic->SetICMethod(AliIsolationCut::kPtThresIC);\n  ic->Print(\"\");\n\n  AliAnaGammaDirect *ana = new AliAnaGammaDirect();\n  ana->SetDebug(-1);\n  ana->SetMinPt(5.);\n  ana->SetCaloPID(pid);\n  ana->SetFidutialCut(fidCut2);\n  ana->SetIsolationCut(ic) ;\n  ana->SetDetector(\"PHOS\");\n  ana->SwitchOnDataMC() ;\/\/Access MC stack and fill more histograms\n\n  ana->SwitchOnCaloPID();\n  ana->SwitchOffCaloPIDRecalculation(); \/\/recommended for EMCAL\n  ana->SwitchOnFidutialCut();\n  \/\/Select clusters with no pair, if both clusters with pi0 mass\n  ana->SwitchOffInvariantMass();\n  \/\/Do isolation cut\n  ana->SwitchOnIsolation();\n\n  \/\/Do or not do isolation with previously produced AODs.\n  \/\/No effect if use of SwitchOnSeveralIsolation()\n  ana->SwitchOffReIsolation();\n\n  \/\/Multiple IC\n  ana->SwitchOffSeveralIsolation() ;\n\/\/   ana->SwitchOnSeveralIsolation() ;\n\/\/   ana->SetNCones(2) ;     \n\/\/   ana->SetNPtThresFrac(2) ;     \n\/\/   ana->SetConeSizes(0, 0.3) ; ana->SetConeSizes(1, 0.4) ;    \n\/\/   ana->SetPtThresholds(0, 0.5) ;     ana->SetPtThresholds(1, 1.) ;   \n\/\/   ana->SetPtFractions(0, 1.) ;   ana->SetPtFractions(1, 1.5) ;  \n\n  ana->Print(\"\");\n\n  \/\/---------------------------------------------------------------------\n  \/\/ Set  analysis algorithm and reader\n  \/\/---------------------------------------------------------------------\n  maker = new AliAnaMaker();\n  maker->SetReader(reader);\/\/pointer to reader\n  maker->AddAnalysis(ana,0);\n  maker->SetAODBranchName(\"Photon\");\n  maker->SetAnaDebug(1)  ;\n  maker->SwitchOnHistogramsMaker()  ;\n  \/\/maker->SwitchOffHistogramsMaker() ;  \n  maker->SwitchOnAODsMaker()  ;\n  \/\/maker->SwitchOffAODsMaker() ; \n  \n  maker->Print(\"\");\n  \/\/\n  printf(\"======================== \\n\");\n  printf(\"END ConfigAnalysis() \\n\");\n  printf(\"======================== \\n\");\n  return maker ;\n}\n<commit_msg>correct typo<commit_after>\/* $Id:$ *\/\n\n\/\/------------------------------------\n\/\/ Configuration macro example:\n\/\/\n\/\/ Do prompt photon analysis with ESDs\n\/\/ Gamma in PHOS, \n\/\/ for EMCAL, PHOS by EMCAL where necessary\n\/\/\n\/\/ Author : Gustavo Conesa Balbastre (INFN-LNF)\n\/\/------------------------------------\n\nAliAnaMaker*  ConfigAnalysis()\n{\n  \/\/\n  \/\/ Configuration goes here\n  \/\/ \n  printf(\"======================== \\n\");\n  printf(\"ConfigAnalysis() \\n\");\n  printf(\"======================== \\n\");\n  \n  \n  \/\/Detector Fidutial Cuts\n  AliFidutialCut * fidCut = new AliFidutialCut();\n  fidCut->DoCTSFidutialCut(kTRUE) ;\n  \/\/fidCut->DoEMCALFidutialCut(kFALSE) ;\n  fidCut->DoPHOSFidutialCut(kTRUE) ;\n  \n  fidCut->SetSimpleCTSFidutialCut(0.9,0.,360.);\n  \/\/fidCut->SetSimpleEMCALFidutialCut(0.7,80.,190.);\n  fidCut->SetSimplePHOSFidutialCut(0.13,220.,320.);\n   \n  fidCut->Print(\"\");\n  \n  \/\/-----------------------------------------------------------  \n  \/\/ Reader\n  \/\/-----------------------------------------------------------\n  AliCaloTrackReader *reader = new AliCaloTrackESDReader();\n  reader->SetDebug(-1);\n\n  \/\/Switch on or off the detectors information that you want\n  reader->SwitchOffEMCAL();\n  reader->SwitchOnCTS();\n  reader->SwitchOnPHOS();\n  \n  \/\/Min particle pT\n  \/\/reader->SetEMCALPtMin(0.5); \n  reader->SetPHOSPtMin(0.5);\n  reader->SetCTSPtMin(0.2);\n  \n  reader->SetFidutialCut(fidCut);\n  reader->Print(\"\");\n  \n  \n  \/\/---------------------------------------------------------------------\n  \/\/ Analysis algorithm\n  \/\/---------------------------------------------------------------------\n  \n  \/\/Detector Fidutial Cuts for analysis part\n  AliFidutialCut * fidCut2 = new AliFidutialCut();\n  fidCut2->DoCTSFidutialCut(kFALSE) ;\n  \/\/fidCut2->DoEMCALFidutialCut(kTRUE) ;\n  fidCut2->DoPHOSFidutialCut(kFALSE) ;\n  \n  fidCut2->SetSimpleCTSFidutialCut(0.9,0.,360.);\n  \/\/fidCut2->SetSimpleEMCALFidutialCut(0.7,80.,190.);\n  fidCut2->SetSimplePHOSFidutialCut(0.13,220.,320.);\n  fidCut2->Print(\"\");\n\n  AliCaloPID * pid = new AliCaloPID();\n  \/\/ use selection with simple weights\n  pid->SetPHOSPhotonWeight(0.7);    pid->SetPHOSPi0Weight(0.7); \n  pid->SetEMCALPhotonWeight(0.7);    pid->SetEMCALPi0Weight(0.7);\n  \/\/ use more complicated selection, particle weight depending on cluster energy\n\/\/   pid->UsePHOSPIDWeightFormula(kTRUE);\n\/\/   TFormula * photonF = new TFormula(\"photonWeight\",\"0.98*(x<40)+ 0.68*(x>=100)+(x>=40 && x<100)*(0.98+x*(6e-3)-x*x*(2e-04)+x*x*x*(1.1e-06))\");\n\/\/   TFormula * pi0F = new TFormula(\"pi0Weight\",\"0.98*(x<65)+ 0.915*(x>=100)+(x>=65 && x-x*(1.95e-3)-x*x*(4.31e-05)+x*x*x*(3.61e-07))\");\n\/\/   pid->SetPHOSPhotonWeightFormula(photonF);\n\/\/   pid->SetPHOSPi0WeightFormula(pi0F);\n  pid->Print(\"\");\n\n  AliIsolationCut * ic = new AliIsolationCut();\n  ic->SetConeSize(0.4);\n  ic->SetPtThreshold(1.);\n  ic->SetICMethod(AliIsolationCut::kPtThresIC);\n  ic->Print(\"\");\n\n  AliAnaGammaDirect *ana = new AliAnaGammaDirect();\n  ana->SetDebug(-1);\n  ana->SetMinPt(5.);\n  ana->SetCaloPID(pid);\n  ana->SetFidutialCut(fidCut2);\n  ana->SetIsolationCut(ic) ;\n  ana->SetDetector(\"PHOS\");\n  ana->SwitchOnDataMC() ;\/\/Access MC stack and fill more histograms\n\n  ana->SwitchOnCaloPID();\n  ana->SwitchOffCaloPIDRecalculation(); \/\/recommended for EMCAL\n  ana->SwitchOnFidutialCut();\n  \/\/Select clusters with no pair, if both clusters with pi0 mass\n  ana->SwitchOffInvariantMass();\n  \/\/Do isolation cut\n  ana->SwitchOnIsolation();\n\n  \/\/Do or not do isolation with previously produced AODs.\n  \/\/No effect if use of SwitchOnSeveralIsolation()\n  ana->SwitchOffReIsolation();\n\n  \/\/Multiple IC\n  ana->SwitchOffSeveralIsolation() ;\n\/\/   ana->SwitchOnSeveralIsolation() ;\n\/\/   ana->SetNCones(2) ;     \n\/\/   ana->SetNPtThresFrac(2) ;     \n\/\/   ana->SetConeSizes(0, 0.3) ; ana->SetConeSizes(1, 0.4) ;    \n\/\/   ana->SetPtThresholds(0, 0.5) ;     ana->SetPtThresholds(1, 1.) ;   \n\/\/   ana->SetPtFractions(0, 1.) ;   ana->SetPtFractions(1, 1.5) ;  \n\n  ana->Print(\"\");\n\n  \/\/---------------------------------------------------------------------\n  \/\/ Set  analysis algorithm and reader\n  \/\/---------------------------------------------------------------------\n  maker = new AliAnaMaker();\n  maker->SetReader(reader);\/\/pointer to reader\n  maker->AddAnalysis(ana,0);\n  maker->SetAODBranchName(\"Photon\");\n  maker->SetAnaDebug(1)  ;\n  maker->SwitchOnHistogramsMaker()  ;\n  \/\/maker->SwitchOffHistogramsMaker() ;  \n  maker->SwitchOnAODsMaker()  ;\n  \/\/maker->SwitchOffAODsMaker() ; \n  \n  maker->Print(\"\");\n  \/\/\n  printf(\"======================== \\n\");\n  printf(\"END ConfigAnalysis() \\n\");\n  printf(\"======================== \\n\");\n  return maker ;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the CernVM File System.\n *\n * Fills an internal map of key-value pairs from ASCII files in key=value\n * style.  Parameters can be overwritten.  Used to read configuration from\n * \/etc\/cvmfs\/...\n *\/\n\n#include \"cvmfs_config.h\"\n#include \"options.h\"\n\n#include <unistd.h>\n\n#include <cstdio>\n#include <cassert>\n#include <cstdlib>\n\n#include <map>\n\n#include \"util.h\"\n\nusing namespace std;  \/\/ NOLINT\n\n#ifdef CVMFS_NAMESPACE_GUARD\nnamespace CVMFS_NAMESPACE_GUARD {\n#endif\n\nnamespace options {\n\nstruct ConfigValue {\n  string value;\n  string source;\n};\n\nmap<string, ConfigValue> *config_ = NULL;\n\n\nvoid Init() {\n  config_ = new map<string, ConfigValue>();\n}\n\n\nvoid Fini() {\n  delete config_;\n  config_ = NULL;\n}\n\n\nstatic string EscapeShell(const std::string &raw) {\n  for (unsigned i = 0, l = raw.length(); i < l; ++i) {\n    if (not (((raw[i] >= '0') && (raw[i] <= '9')) ||\n             ((raw[i] >= 'A') && (raw[i] <= 'Z')) ||\n             ((raw[i] >= 'a') && (raw[i] <= 'z')) ||\n             (raw[i] == '\/') || (raw[i] == ':') || (raw[i] == '.') ||\n             (raw[i] == '_') || (raw[i] == '-') || (raw[i] == ',')))\n    {\n      goto escape_shell_quote;\n    }\n  }\n  return raw;\n\n escape_shell_quote:\n  string result = \"'\";\n  for (unsigned i = 0, l = raw.length(); i < l; ++i) {\n    if (raw[i] == '\\'')\n      result += \"\\\\\";\n    result += raw[i];\n  }\n  result += \"'\";\n  return result;\n}\n\n\nvoid ParsePath(const string &config_file) {\n  FILE *fconfig = fopen(config_file.c_str(), \"r\");\n  if (!fconfig)\n    return;\n\n  int retval;\n\n  int fd_stdin;\n  int fd_stdout;\n  int fd_stderr;\n  retval = Shell(&fd_stdin, &fd_stdout, &fd_stderr);\n  assert(retval);\n\n  \/\/ Let the shell read the file\n  string line;\n  const string newline = \"\\n\";\n  while (GetLineFile(fconfig, &line)) {\n    WritePipe(fd_stdin, line.data(), line.length());\n    WritePipe(fd_stdin, newline.data(), newline.length());\n  }\n  rewind(fconfig);\n\n  \/\/ Read line by line and extract parameters\n  while (GetLineFile(fconfig, &line)) {\n    line = Trim(line);\n    if (line.empty() || line[0] == '#' || line.find(\"if \") == 0)\n      continue;\n    vector<string> tokens = SplitString(line, '=');\n    if (tokens.size() < 2)\n      continue;\n\n    ConfigValue value;\n    value.source = config_file;\n    string parameter = tokens[0];\n    \/\/ Strip \"readonly\"\n    if (parameter.find(\"readonly\") == 0) {\n      parameter = parameter.substr(8);\n      parameter = Trim(parameter);\n    }\n    \/\/ Strip export\n    if (parameter.find(\"export\") == 0) {\n      parameter = parameter.substr(6);\n      parameter = Trim(parameter);\n    }\n    \/\/ Strip eval\n    if (parameter.find(\"eval\") == 0) {\n      parameter = parameter.substr(4);\n      parameter = Trim(parameter);\n    }\n\n    const string sh_echo = \"echo $\" + parameter + \"\\n\";\n    WritePipe(fd_stdin, sh_echo.data(), sh_echo.length());\n    GetLineFd(fd_stdout, &value.value);\n    (*config_)[parameter] = value;\n    retval = setenv(parameter.c_str(), value.value.c_str(), 1);\n    assert(retval == 0);\n  }\n\n  close(fd_stderr);\n  close(fd_stdout);\n  close(fd_stdin);\n  fclose(fconfig);\n}\n\n\nvoid ParseDefault(const string &fqrn) {\n  int retval = setenv(\"CVMFS_FQRN\", fqrn.c_str(), 1);\n  assert(retval == 0);\n\n  ParsePath(\"\/etc\/cvmfs\/default.conf\");\n  vector<string> dist_defaults = FindFiles(\"\/etc\/cvmfs\/default.d\", \".conf\");\n  for (unsigned i = 0; i < dist_defaults.size(); ++i) {\n    ParsePath(dist_defaults[i]);\n  }\n  ParsePath(\"\/etc\/cernvm\/default.conf\");\n  ParsePath(\"\/etc\/cvmfs\/site.conf\");\n  ParsePath(\"\/etc\/cernvm\/site.conf\");\n  ParsePath(\"\/etc\/cvmfs\/default.local\");\n\n  if (fqrn != \"\") {\n    string domain;\n    vector<string> tokens = SplitString(fqrn, '.');\n    assert(tokens.size() > 1);\n    tokens.erase(tokens.begin());\n    domain = JoinStrings(tokens, \".\");\n\n    ParsePath(\"\/etc\/cvmfs\/domain.d\/\" + domain + \".conf\");\n    ParsePath(\"\/etc\/cvmfs\/domain.d\/\" + domain + \".local\");\n\n    ParsePath(\"\/etc\/cvmfs\/config.d\/\" + fqrn + \".conf\");\n    ParsePath(\"\/etc\/cvmfs\/config.d\/\" + fqrn + \".local\");\n  }\n}\n\n\nvoid ClearConfig() {\n  config_->clear();\n}\n\n\nbool IsDefined(const std::string &key) {\n  map<string, ConfigValue>::const_iterator iter = config_->find(key);\n  return iter != config_->end();\n}\n\n\nbool GetValue(const string &key, string *value) {\n  map<string, ConfigValue>::const_iterator iter = config_->find(key);\n  if (iter != config_->end()) {\n    *value = iter->second.value;\n    return true;\n  }\n  *value = \"\";\n  return false;\n}\n\n\nbool GetSource(const string &key, string *value) {\n  map<string, ConfigValue>::const_iterator iter = config_->find(key);\n  if (iter != config_->end()) {\n    *value = iter->second.source;\n    return true;\n  }\n  *value = \"\";\n  return false;\n}\n\n\nbool IsOn(const std::string &param_value) {\n  const string uppercase = ToUpper(param_value);\n  return ((uppercase == \"YES\") || (uppercase == \"ON\") || (uppercase == \"1\"));\n}\n\n\nvector<string> GetAllKeys() {\n  vector<string> result;\n  for (map<string, ConfigValue>::const_iterator i = config_->begin(),\n       iEnd = config_->end(); i != iEnd; ++i)\n  {\n    result.push_back(i->first);\n  }\n  return result;\n}\n\n\nstring Dump() {\n  string result;\n  vector<string> keys = GetAllKeys();\n  for (unsigned i = 0, l = keys.size(); i < l; ++i) {\n    bool retval;\n    string value;\n    string source;\n\n    retval = GetValue(keys[i], &value);\n    assert(retval);\n    retval = GetSource(keys[i], &source);\n    assert(retval);\n    result += keys[i] + \"=\" + EscapeShell(value) +\n              \"    # from \" + source + \"\\n\";\n  }\n  return result;\n}\n\n\nbool ParseUIntMap(const string &path, map<uint64_t, uint64_t> *map) {\n  assert(map);\n\n  FILE *fmap = fopen(path.c_str(), \"r\");\n  if (!fmap)\n    return false;\n\n  string line;\n  while (GetLineFile(fmap, &line)) {\n    line = Trim(line);\n    if (line.empty() || line[0] == '#') {\n      continue;\n    }\n    vector<string> components = SplitString(line, ' ');\n    if (components.size() != 2) {\n      fclose(fmap);\n      return false;\n    }\n    uint64_t from = String2Uint64(components[0]);\n    uint64_t to = String2Uint64(components[1]);\n    map->insert(pair<uint64_t, uint64_t>(from, to));\n  }\n  fclose(fmap);\n  return true;\n}\n\n}  \/\/ namespace options\n\n#ifdef CVMFS_NAMESPACE_GUARD\n}\n#endif\n<commit_msg>change directory to config file being parsed<commit_after>\/**\n * This file is part of the CernVM File System.\n *\n * Fills an internal map of key-value pairs from ASCII files in key=value\n * style.  Parameters can be overwritten.  Used to read configuration from\n * \/etc\/cvmfs\/...\n *\/\n\n#include \"cvmfs_config.h\"\n#include \"options.h\"\n\n#include <unistd.h>\n\n#include <cstdio>\n#include <cassert>\n#include <cstdlib>\n\n#include <map>\n\n#include \"util.h\"\n\nusing namespace std;  \/\/ NOLINT\n\n#ifdef CVMFS_NAMESPACE_GUARD\nnamespace CVMFS_NAMESPACE_GUARD {\n#endif\n\nnamespace options {\n\nstruct ConfigValue {\n  string value;\n  string source;\n};\n\nmap<string, ConfigValue> *config_ = NULL;\n\n\nvoid Init() {\n  config_ = new map<string, ConfigValue>();\n}\n\n\nvoid Fini() {\n  delete config_;\n  config_ = NULL;\n}\n\n\nstatic string EscapeShell(const std::string &raw) {\n  for (unsigned i = 0, l = raw.length(); i < l; ++i) {\n    if (not (((raw[i] >= '0') && (raw[i] <= '9')) ||\n             ((raw[i] >= 'A') && (raw[i] <= 'Z')) ||\n             ((raw[i] >= 'a') && (raw[i] <= 'z')) ||\n             (raw[i] == '\/') || (raw[i] == ':') || (raw[i] == '.') ||\n             (raw[i] == '_') || (raw[i] == '-') || (raw[i] == ',')))\n    {\n      goto escape_shell_quote;\n    }\n  }\n  return raw;\n\n escape_shell_quote:\n  string result = \"'\";\n  for (unsigned i = 0, l = raw.length(); i < l; ++i) {\n    if (raw[i] == '\\'')\n      result += \"\\\\\";\n    result += raw[i];\n  }\n  result += \"'\";\n  return result;\n}\n\n\nvoid ParsePath(const string &config_file) {\n  FILE *fconfig = fopen(config_file.c_str(), \"r\");\n  if (!fconfig)\n    return;\n  const string config_path = GetParentPath(config_file);\n\n  int retval;\n\n  int fd_stdin;\n  int fd_stdout;\n  int fd_stderr;\n  retval = Shell(&fd_stdin, &fd_stdout, &fd_stderr);\n  assert(retval);\n\n  \/\/ Let the shell read the file\n  string line;\n  const string newline = \"\\n\";\n  const string cd = \"cd \\\"\" + ((config_path == \"\") ? \"\/\" : config_path) + \"\\\"\" +\n                    newline;\n  WritePipe(fd_stdin, cd.data(), cd.length());\n  while (GetLineFile(fconfig, &line)) {\n    WritePipe(fd_stdin, line.data(), line.length());\n    WritePipe(fd_stdin, newline.data(), newline.length());\n  }\n  rewind(fconfig);\n\n  \/\/ Read line by line and extract parameters\n  while (GetLineFile(fconfig, &line)) {\n    line = Trim(line);\n    if (line.empty() || line[0] == '#' || line.find(\"if \") == 0)\n      continue;\n    vector<string> tokens = SplitString(line, '=');\n    if (tokens.size() < 2)\n      continue;\n\n    ConfigValue value;\n    value.source = config_file;\n    string parameter = tokens[0];\n    \/\/ Strip \"readonly\"\n    if (parameter.find(\"readonly\") == 0) {\n      parameter = parameter.substr(8);\n      parameter = Trim(parameter);\n    }\n    \/\/ Strip export\n    if (parameter.find(\"export\") == 0) {\n      parameter = parameter.substr(6);\n      parameter = Trim(parameter);\n    }\n    \/\/ Strip eval\n    if (parameter.find(\"eval\") == 0) {\n      parameter = parameter.substr(4);\n      parameter = Trim(parameter);\n    }\n\n    const string sh_echo = \"echo $\" + parameter + \"\\n\";\n    WritePipe(fd_stdin, sh_echo.data(), sh_echo.length());\n    GetLineFd(fd_stdout, &value.value);\n    (*config_)[parameter] = value;\n    retval = setenv(parameter.c_str(), value.value.c_str(), 1);\n    assert(retval == 0);\n  }\n\n  close(fd_stderr);\n  close(fd_stdout);\n  close(fd_stdin);\n  fclose(fconfig);\n}\n\n\nvoid ParseDefault(const string &fqrn) {\n  int retval = setenv(\"CVMFS_FQRN\", fqrn.c_str(), 1);\n  assert(retval == 0);\n\n  ParsePath(\"\/etc\/cvmfs\/default.conf\");\n  vector<string> dist_defaults = FindFiles(\"\/etc\/cvmfs\/default.d\", \".conf\");\n  for (unsigned i = 0; i < dist_defaults.size(); ++i) {\n    ParsePath(dist_defaults[i]);\n  }\n  ParsePath(\"\/etc\/cernvm\/default.conf\");\n  ParsePath(\"\/etc\/cvmfs\/site.conf\");\n  ParsePath(\"\/etc\/cernvm\/site.conf\");\n  ParsePath(\"\/etc\/cvmfs\/default.local\");\n\n  if (fqrn != \"\") {\n    string domain;\n    vector<string> tokens = SplitString(fqrn, '.');\n    assert(tokens.size() > 1);\n    tokens.erase(tokens.begin());\n    domain = JoinStrings(tokens, \".\");\n\n    ParsePath(\"\/etc\/cvmfs\/domain.d\/\" + domain + \".conf\");\n    ParsePath(\"\/etc\/cvmfs\/domain.d\/\" + domain + \".local\");\n\n    ParsePath(\"\/etc\/cvmfs\/config.d\/\" + fqrn + \".conf\");\n    ParsePath(\"\/etc\/cvmfs\/config.d\/\" + fqrn + \".local\");\n  }\n}\n\n\nvoid ClearConfig() {\n  config_->clear();\n}\n\n\nbool IsDefined(const std::string &key) {\n  map<string, ConfigValue>::const_iterator iter = config_->find(key);\n  return iter != config_->end();\n}\n\n\nbool GetValue(const string &key, string *value) {\n  map<string, ConfigValue>::const_iterator iter = config_->find(key);\n  if (iter != config_->end()) {\n    *value = iter->second.value;\n    return true;\n  }\n  *value = \"\";\n  return false;\n}\n\n\nbool GetSource(const string &key, string *value) {\n  map<string, ConfigValue>::const_iterator iter = config_->find(key);\n  if (iter != config_->end()) {\n    *value = iter->second.source;\n    return true;\n  }\n  *value = \"\";\n  return false;\n}\n\n\nbool IsOn(const std::string &param_value) {\n  const string uppercase = ToUpper(param_value);\n  return ((uppercase == \"YES\") || (uppercase == \"ON\") || (uppercase == \"1\"));\n}\n\n\nvector<string> GetAllKeys() {\n  vector<string> result;\n  for (map<string, ConfigValue>::const_iterator i = config_->begin(),\n       iEnd = config_->end(); i != iEnd; ++i)\n  {\n    result.push_back(i->first);\n  }\n  return result;\n}\n\n\nstring Dump() {\n  string result;\n  vector<string> keys = GetAllKeys();\n  for (unsigned i = 0, l = keys.size(); i < l; ++i) {\n    bool retval;\n    string value;\n    string source;\n\n    retval = GetValue(keys[i], &value);\n    assert(retval);\n    retval = GetSource(keys[i], &source);\n    assert(retval);\n    result += keys[i] + \"=\" + EscapeShell(value) +\n              \"    # from \" + source + \"\\n\";\n  }\n  return result;\n}\n\n\nbool ParseUIntMap(const string &path, map<uint64_t, uint64_t> *map) {\n  assert(map);\n\n  FILE *fmap = fopen(path.c_str(), \"r\");\n  if (!fmap)\n    return false;\n\n  string line;\n  while (GetLineFile(fmap, &line)) {\n    line = Trim(line);\n    if (line.empty() || line[0] == '#') {\n      continue;\n    }\n    vector<string> components = SplitString(line, ' ');\n    if (components.size() != 2) {\n      fclose(fmap);\n      return false;\n    }\n    uint64_t from = String2Uint64(components[0]);\n    uint64_t to = String2Uint64(components[1]);\n    map->insert(pair<uint64_t, uint64_t>(from, to));\n  }\n  fclose(fmap);\n  return true;\n}\n\n}  \/\/ namespace options\n\n#ifdef CVMFS_NAMESPACE_GUARD\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"echoS.h\"\n\n#include <iostream>\n\nclass Server : public CORBA::servant_traits<Example::Echo>::base_type\n{\npublic:\n  Server() = default;\n  virtual ~Server() {};\n  virtual std::string echoString(const std::string& mesg) override;\n};\n\nstd::string Server::echoString(const std::string& mesg)\n{\n  std::cout << \"Got \\\"\" << mesg << \"\\\", sending it back.\" << std::endl;\n  return mesg;\n}\n\nint main(int argc, char** argv)\n{\n\ttry {\n    IDL::traits<CORBA::ORB>::ref_type orb = CORBA::ORB_init (argc, argv);\n    IDL::traits<CORBA::Object>::ref_type obj = orb->resolve_initial_references (\"RootPOA\");\n    IDL::traits<PortableServer::POA>::ref_type poa = IDL::traits<PortableServer::POA>::narrow (obj);\n\n   CORBA::servant_traits<Example::Echo>::ref_type server = CORBA::make_reference<Server> ();\n\n   PortableServer::ObjectId id = poa->activate_object (server);\n\n   std::string sior(orb->object_to_string(server->_this()));\n   std::cout << sior << std::endl;\n\n   IDL::traits<PortableServer::POAManager>::ref_type pman = poa->the_POAManager ();\n\n   pman->activate();\n\n   orb->run();\n   orb->destroy();\n  }\n  catch (CORBA::SystemException& ex) {\n    std::cerr << \"Caught CORBA::\" << ex << std::endl;\n  }\n  catch (CORBA::Exception& ex) {\n    std::cerr << \"Caught CORBA::Exception: \" << ex << std::endl;\n  }\n  catch (std::exception& ex) {\n    std::cerr << \"Caught std exception: \" << ex.what() << std::endl;\n  }\n  return 0;\n}\n<commit_msg>Use space instead of tab<commit_after>#include \"echoS.h\"\n\n#include <iostream>\n\nclass Server : public CORBA::servant_traits<Example::Echo>::base_type\n{\npublic:\n  Server() = default;\n  virtual ~Server() {};\n  virtual std::string echoString(const std::string& mesg) override;\n};\n\nstd::string Server::echoString(const std::string& mesg)\n{\n  std::cout << \"Got \\\"\" << mesg << \"\\\", sending it back.\" << std::endl;\n  return mesg;\n}\n\nint main(int argc, char** argv)\n{\n  try {\n    IDL::traits<CORBA::ORB>::ref_type orb = CORBA::ORB_init (argc, argv);\n    IDL::traits<CORBA::Object>::ref_type obj = orb->resolve_initial_references (\"RootPOA\");\n    IDL::traits<PortableServer::POA>::ref_type poa = IDL::traits<PortableServer::POA>::narrow (obj);\n\n   CORBA::servant_traits<Example::Echo>::ref_type server = CORBA::make_reference<Server> ();\n\n   PortableServer::ObjectId id = poa->activate_object (server);\n\n   std::string sior(orb->object_to_string(server->_this()));\n   std::cout << sior << std::endl;\n\n   IDL::traits<PortableServer::POAManager>::ref_type pman = poa->the_POAManager ();\n\n   pman->activate();\n\n   orb->run();\n   orb->destroy();\n  }\n  catch (CORBA::SystemException& ex) {\n    std::cerr << \"Caught CORBA::\" << ex << std::endl;\n  }\n  catch (CORBA::Exception& ex) {\n    std::cerr << \"Caught CORBA::Exception: \" << ex << std::endl;\n  }\n  catch (std::exception& ex) {\n    std::cerr << \"Caught std exception: \" << ex.what() << std::endl;\n  }\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright 2019-2022 Diligent Graphics LLC\n *  Copyright 2015-2019 Egor Yusov\n *\n *  Licensed under the Apache License, Version 2.0 (the \"License\");\n *  you may not use this file except in compliance with the License.\n *  You may obtain a copy of the License at\n *\n *      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n *  Unless required by applicable law or agreed to in writing, software\n *  distributed under the License is distributed on an \"AS IS\" BASIS,\n *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *  See the License for the specific language governing permissions and\n *  limitations under the License.\n *\n *  In no event and under no legal theory, whether in tort (including negligence),\n *  contract, or otherwise, unless required by applicable law (such as deliberate\n *  and grossly negligent acts) or agreed to in writing, shall any Contributor be\n *  liable for any damages, including any direct, indirect, special, incidental,\n *  or consequential damages of any character arising as a result of this License or\n *  out of the use or inability to use the software (including but not limited to damages\n *  for loss of goodwill, work stoppage, computer failure or malfunction, or any and\n *  all other commercial damages or losses), even if such Contributor has been advised\n *  of the possibility of such damages.\n *\/\n\n#include \"BasicFileSystem.hpp\"\n#include \"DebugUtilities.hpp\"\n#include <algorithm>\n\nnamespace Diligent\n{\n\nString BasicFileSystem::m_strWorkingDirectory;\n\nBasicFile::BasicFile(const FileOpenAttribs& OpenAttribs) :\n    m_Path \/\/\n    {\n        [](const Char* strPath) \/\/\n        {\n            String Path = strPath != nullptr ? strPath : \"\";\n            BasicFileSystem::CorrectSlashes(Path);\n            return Path;\n        }(OpenAttribs.strFilePath) \/\/\n    },\n    m_OpenAttribs{m_Path.c_str(), OpenAttribs.AccessMode}\n{\n}\n\nBasicFile::~BasicFile()\n{\n}\n\nString BasicFile::GetOpenModeStr()\n{\n    std::string OpenModeStr;\n    switch (m_OpenAttribs.AccessMode)\n    {\n        \/\/ clang-format off\n        case EFileAccessMode::Read:      OpenModeStr += 'r'; break;\n        case EFileAccessMode::Overwrite: OpenModeStr += 'w'; break;\n        case EFileAccessMode::Append:    OpenModeStr += 'a'; break;\n        \/\/ clang-format on\n        default: break;\n    }\n\n    \/\/ Always open file in binary mode. Text mode is platform-specific\n    OpenModeStr += 'b';\n\n    return OpenModeStr;\n}\n\nBasicFile* BasicFileSystem::OpenFile(FileOpenAttribs& OpenAttribs)\n{\n    return nullptr;\n}\n\nvoid BasicFileSystem::ReleaseFile(BasicFile* pFile)\n{\n    if (pFile)\n        delete pFile;\n}\n\nbool BasicFileSystem::FileExists(const Char* strFilePath)\n{\n    return false;\n}\n\nvoid BasicFileSystem::CorrectSlashes(String& Path, Char Slash)\n{\n    if (Slash != 0)\n        DEV_CHECK_ERR(IsSlash(Slash), \"Incorrect slash symbol\");\n    else\n        Slash = SlashSymbol;\n    Char RevSlashSym = (Slash == '\\\\') ? '\/' : '\\\\';\n    std::replace(Path.begin(), Path.end(), RevSlashSym, Slash);\n}\n\nvoid BasicFileSystem::GetPathComponents(const String& Path,\n                                        String*       Directory,\n                                        String*       FileName)\n{\n    auto LastSlashPos = Path.find_last_of(\"\/\\\\\");\n    if (Directory)\n    {\n        if (LastSlashPos != String::npos)\n            *Directory = Path.substr(0, LastSlashPos);\n        else\n            *Directory = \"\";\n    }\n\n    if (FileName)\n    {\n        if (LastSlashPos != String::npos)\n            *FileName = Path.substr(LastSlashPos + 1);\n        else\n            *FileName = Path;\n    }\n}\n\nbool BasicFileSystem::IsPathAbsolute(const Char* strPath)\n{\n    if (strPath == nullptr || strPath[0] == 0)\n        return false;\n\n#if PLATFORM_WIN32 || PLATFORM_UNIVERSAL_WINDOWS\n    return ((strPath[1] == ':' && (strPath[2] == '\\\\' || strPath[2] == '\/')) || \/\/ c:\\Path or c:\/Path\n            (strPath[0] == '\\\\' && strPath[1] == '\\\\'));                        \/\/ \\\\?\\Path\n#elif PLATFORM_LINUX || PLATFORM_MACOS || PLATFORM_IOS || PLATFORM_TVOS || PLATFORM_ANDROID || PLATFORM_EMSCRIPTEN\n    return strPath[0] == '\/';\n#else\n#    error Unknown platform.\n#endif\n}\n\nstd::vector<String> BasicFileSystem::SplitPath(const Char* Path, bool Simplify)\n{\n    std::vector<std::string> Components;\n\n    const auto* c = Path;\n    while (*c != '\\0')\n    {\n        while (*c != '\\0' && IsSlash(*c))\n            ++c;\n\n        if (*c == '\\0')\n        {\n            \/\/ a\/\n            break;\n        }\n\n        std::string PathCmp;\n        while (*c != '\\0' && !IsSlash(*c))\n            PathCmp.push_back(*(c++));\n\n        if (Simplify)\n        {\n            if (PathCmp == \".\")\n            {\n                \/\/ Skip \/.\n                continue;\n            }\n            else if (PathCmp == \"..\" && !Components.empty() && Components.back() != \"..\")\n            {\n                \/\/ Pop previous subdirectory if \/.. is found, but only if there is no .. already\n                Components.pop_back();\n                continue;\n            }\n        }\n\n        Components.emplace_back(std::move(PathCmp));\n    }\n\n    return Components;\n}\n\nstd::string BasicFileSystem::SimplifyPath(const Char* Path, Char Slash)\n{\n    if (Path == nullptr)\n        return \"\";\n\n    if (Slash != 0)\n        DEV_CHECK_ERR(IsSlash(Slash), \"Incorrect slash symbol\");\n    else\n        Slash = SlashSymbol;\n\n    const auto PathComponents = SplitPath(Path, true);\n\n    std::string SimplifiedPath;\n    for (const auto& Cmp : PathComponents)\n    {\n        if (!SimplifiedPath.empty())\n            SimplifiedPath.push_back(Slash);\n        SimplifiedPath.append(Cmp);\n    }\n    return SimplifiedPath;\n}\n\n\nstd::string BasicFileSystem::GetRelativePath(const Char* PathFrom,\n                                             bool        IsFromDirectory,\n                                             const Char* PathTo,\n                                             bool \/*IsToDirectory*\/)\n{\n    DEV_CHECK_ERR(PathFrom != nullptr, \"Source path must not be null\");\n    DEV_CHECK_ERR(PathTo != nullptr, \"Destination path must not be null\");\n\n    const auto FromPathComps = SplitPath(PathFrom, true);\n    const auto ToPathComps   = SplitPath(PathTo, true);\n\n    auto from_it = FromPathComps.begin();\n    auto to_it   = ToPathComps.begin();\n    while (from_it != FromPathComps.end() && to_it != ToPathComps.end() && *from_it == *to_it)\n    {\n        ++from_it;\n        ++to_it;\n    }\n    if (from_it == FromPathComps.begin())\n        return PathFrom; \/\/ No common prefix\n\n    String RelPath;\n    for (; from_it != FromPathComps.end(); ++from_it)\n    {\n        if (!IsFromDirectory && from_it + 1 == FromPathComps.end())\n        {\n            \/\/                    from_it\n            \/\/                       V\n            \/\/ from:    \"common\/from\/file\"\n            \/\/ to:      \"common\/to\"\n            \/\/ RelPath: \"..\"\n            break;\n        }\n\n        if (!RelPath.empty())\n            RelPath.push_back(SlashSymbol);\n        RelPath.append(\"..\");\n    }\n\n    for (; to_it != ToPathComps.end(); ++to_it)\n    {\n        \/\/ IsToDirectory is in fact irrelevant\n        if (!RelPath.empty())\n            RelPath.push_back(SlashSymbol);\n        RelPath.append(*to_it);\n    }\n\n    return RelPath;\n}\n\n} \/\/ namespace Diligent\n<commit_msg>Some optimizations to BasicFileSystem::SplitPath<commit_after>\/*\n *  Copyright 2019-2022 Diligent Graphics LLC\n *  Copyright 2015-2019 Egor Yusov\n *\n *  Licensed under the Apache License, Version 2.0 (the \"License\");\n *  you may not use this file except in compliance with the License.\n *  You may obtain a copy of the License at\n *\n *      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n *  Unless required by applicable law or agreed to in writing, software\n *  distributed under the License is distributed on an \"AS IS\" BASIS,\n *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *  See the License for the specific language governing permissions and\n *  limitations under the License.\n *\n *  In no event and under no legal theory, whether in tort (including negligence),\n *  contract, or otherwise, unless required by applicable law (such as deliberate\n *  and grossly negligent acts) or agreed to in writing, shall any Contributor be\n *  liable for any damages, including any direct, indirect, special, incidental,\n *  or consequential damages of any character arising as a result of this License or\n *  out of the use or inability to use the software (including but not limited to damages\n *  for loss of goodwill, work stoppage, computer failure or malfunction, or any and\n *  all other commercial damages or losses), even if such Contributor has been advised\n *  of the possibility of such damages.\n *\/\n\n#include \"BasicFileSystem.hpp\"\n#include \"DebugUtilities.hpp\"\n#include <algorithm>\n\nnamespace Diligent\n{\n\nString BasicFileSystem::m_strWorkingDirectory;\n\nBasicFile::BasicFile(const FileOpenAttribs& OpenAttribs) :\n    m_Path \/\/\n    {\n        [](const Char* strPath) \/\/\n        {\n            String Path = strPath != nullptr ? strPath : \"\";\n            BasicFileSystem::CorrectSlashes(Path);\n            return Path;\n        }(OpenAttribs.strFilePath) \/\/\n    },\n    m_OpenAttribs{m_Path.c_str(), OpenAttribs.AccessMode}\n{\n}\n\nBasicFile::~BasicFile()\n{\n}\n\nString BasicFile::GetOpenModeStr()\n{\n    std::string OpenModeStr;\n    switch (m_OpenAttribs.AccessMode)\n    {\n        \/\/ clang-format off\n        case EFileAccessMode::Read:      OpenModeStr += 'r'; break;\n        case EFileAccessMode::Overwrite: OpenModeStr += 'w'; break;\n        case EFileAccessMode::Append:    OpenModeStr += 'a'; break;\n        \/\/ clang-format on\n        default: break;\n    }\n\n    \/\/ Always open file in binary mode. Text mode is platform-specific\n    OpenModeStr += 'b';\n\n    return OpenModeStr;\n}\n\nBasicFile* BasicFileSystem::OpenFile(FileOpenAttribs& OpenAttribs)\n{\n    return nullptr;\n}\n\nvoid BasicFileSystem::ReleaseFile(BasicFile* pFile)\n{\n    if (pFile)\n        delete pFile;\n}\n\nbool BasicFileSystem::FileExists(const Char* strFilePath)\n{\n    return false;\n}\n\nvoid BasicFileSystem::CorrectSlashes(String& Path, Char Slash)\n{\n    if (Slash != 0)\n        DEV_CHECK_ERR(IsSlash(Slash), \"Incorrect slash symbol\");\n    else\n        Slash = SlashSymbol;\n    Char RevSlashSym = (Slash == '\\\\') ? '\/' : '\\\\';\n    std::replace(Path.begin(), Path.end(), RevSlashSym, Slash);\n}\n\nvoid BasicFileSystem::GetPathComponents(const String& Path,\n                                        String*       Directory,\n                                        String*       FileName)\n{\n    auto LastSlashPos = Path.find_last_of(\"\/\\\\\");\n    if (Directory)\n    {\n        if (LastSlashPos != String::npos)\n            *Directory = Path.substr(0, LastSlashPos);\n        else\n            *Directory = \"\";\n    }\n\n    if (FileName)\n    {\n        if (LastSlashPos != String::npos)\n            *FileName = Path.substr(LastSlashPos + 1);\n        else\n            *FileName = Path;\n    }\n}\n\nbool BasicFileSystem::IsPathAbsolute(const Char* strPath)\n{\n    if (strPath == nullptr || strPath[0] == 0)\n        return false;\n\n#if PLATFORM_WIN32 || PLATFORM_UNIVERSAL_WINDOWS\n    return ((strPath[1] == ':' && (strPath[2] == '\\\\' || strPath[2] == '\/')) || \/\/ c:\\Path or c:\/Path\n            (strPath[0] == '\\\\' && strPath[1] == '\\\\'));                        \/\/ \\\\?\\Path\n#elif PLATFORM_LINUX || PLATFORM_MACOS || PLATFORM_IOS || PLATFORM_TVOS || PLATFORM_ANDROID || PLATFORM_EMSCRIPTEN\n    return strPath[0] == '\/';\n#else\n#    error Unknown platform.\n#endif\n}\n\nstd::vector<String> BasicFileSystem::SplitPath(const Char* Path, bool Simplify)\n{\n    std::vector<std::string> Components;\n\n    \/\/ Estimate the number of components and reserve space in the vector\n    {\n        size_t CompnentCount = 1;\n        for (const auto* c = Path; *c != '\\0'; ++c)\n        {\n            if (IsSlash(c[0]) && (c == Path || !IsSlash(c[-1])))\n                ++CompnentCount;\n        }\n        Components.reserve(CompnentCount);\n    }\n\n    const auto* c = Path;\n    while (*c != '\\0')\n    {\n        while (*c != '\\0' && IsSlash(*c))\n            ++c;\n\n        if (*c == '\\0')\n        {\n            \/\/ a\/\n            break;\n        }\n\n        const auto* const CmpStart = c;\n        while (*c != '\\0' && !IsSlash(*c))\n            ++c;\n        std::string PathCmp{CmpStart, c};\n\n        if (Simplify)\n        {\n            if (PathCmp == \".\")\n            {\n                \/\/ Skip \/.\n                continue;\n            }\n            else if (PathCmp == \"..\" && !Components.empty() && Components.back() != \"..\")\n            {\n                \/\/ Pop previous subdirectory if \/.. is found, but only if there is no .. already\n                Components.pop_back();\n                continue;\n            }\n        }\n\n        Components.emplace_back(std::move(PathCmp));\n    }\n\n    return Components;\n}\n\nstd::string BasicFileSystem::SimplifyPath(const Char* Path, Char Slash)\n{\n    if (Path == nullptr)\n        return \"\";\n\n    if (Slash != 0)\n        DEV_CHECK_ERR(IsSlash(Slash), \"Incorrect slash symbol\");\n    else\n        Slash = SlashSymbol;\n\n    const auto PathComponents = SplitPath(Path, true);\n\n    std::string SimplifiedPath;\n    for (const auto& Cmp : PathComponents)\n    {\n        if (!SimplifiedPath.empty())\n            SimplifiedPath.push_back(Slash);\n        SimplifiedPath.append(Cmp);\n    }\n    return SimplifiedPath;\n}\n\n\nstd::string BasicFileSystem::GetRelativePath(const Char* PathFrom,\n                                             bool        IsFromDirectory,\n                                             const Char* PathTo,\n                                             bool \/*IsToDirectory*\/)\n{\n    DEV_CHECK_ERR(PathFrom != nullptr, \"Source path must not be null\");\n    DEV_CHECK_ERR(PathTo != nullptr, \"Destination path must not be null\");\n\n    const auto FromPathComps = SplitPath(PathFrom, true);\n    const auto ToPathComps   = SplitPath(PathTo, true);\n\n    auto from_it = FromPathComps.begin();\n    auto to_it   = ToPathComps.begin();\n    while (from_it != FromPathComps.end() && to_it != ToPathComps.end() && *from_it == *to_it)\n    {\n        ++from_it;\n        ++to_it;\n    }\n    if (from_it == FromPathComps.begin())\n        return PathFrom; \/\/ No common prefix\n\n    String RelPath;\n    for (; from_it != FromPathComps.end(); ++from_it)\n    {\n        if (!IsFromDirectory && from_it + 1 == FromPathComps.end())\n        {\n            \/\/                    from_it\n            \/\/                       V\n            \/\/ from:    \"common\/from\/file\"\n            \/\/ to:      \"common\/to\"\n            \/\/ RelPath: \"..\"\n            break;\n        }\n\n        if (!RelPath.empty())\n            RelPath.push_back(SlashSymbol);\n        RelPath.append(\"..\");\n    }\n\n    for (; to_it != ToPathComps.end(); ++to_it)\n    {\n        \/\/ IsToDirectory is in fact irrelevant\n        if (!RelPath.empty())\n            RelPath.push_back(SlashSymbol);\n        RelPath.append(*to_it);\n    }\n\n    return RelPath;\n}\n\n} \/\/ namespace Diligent\n<|endoftext|>"}
{"text":"<commit_before>#include \"glcamera.h\"\n\n#ifdef __APPLE__\n    #include <GLUT\/glut.h>\n#else\n    #include <glut.h>\n#endif\n\n#include <QDebug>\n\nGLCamera::GLCamera()\n{\n    moveSpeed = 10.0;\n\n    x = 0.0;\n    y = 0.0;\n    z = 1.0;\n\n    look_x = 0.0;\n    look_y = 0.0;\n    look_z = 0.0;\n\n    zoomLevel = 1.0;\n    zoomSpeed = 0.05;\n\n    \/\/ lat=\"46.791803,9\" lon=\"4.427704,7\"\n    planeLeft = 437.0;\n    planeRight = 449.0;\n\n    planeBottom = 4674.0;\n    planeTop = 4686.0;\n\n    planeNear = 0.0;\n    planeFar = 10.0;\n\n    canvasWidth = 0;\n    canvasHeight = 0;\n}\n\nvoid GLCamera::left()\n{\n    x -= (moveSpeed * (1 \/ std::abs(zoomLevel)));\n    look_x -= (moveSpeed * (1 \/ std::abs(zoomLevel)));\n}\n\nvoid GLCamera::right()\n{\n    x += (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n    look_x += (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n}\n\nvoid GLCamera::up()\n{\n    y += (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n    look_y += (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n}\n\nvoid GLCamera::down()\n{\n    y -= (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n    look_y -= (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n}\n\nvoid GLCamera::move(int dx, int dy)\n{\n    \/\/ TODO : Need good scrolling\n    x -= (dx * (0.10 * (1 \/ std::abs(zoomLevel))));\n    look_x -= (dx * (0.10 * (1 \/ std::abs(zoomLevel))));\n    y += (dy * (0.10 * (1 \/ std::abs(zoomLevel))));\n    look_y += (dy * (0.10 * (1 \/ std::abs(zoomLevel))));\n}\n\nvoid GLCamera::zoomIn()\n{\n    if(zoomLevel == 121)\n        return;\n\n    if(planeRight - planeLeft <= 0.1 || planeTop - planeBottom <= 0.1)\n        return;\n\n    zoomLevel += 1;\n\n    planeLeft += zoomSpeed;\n    planeRight -= zoomSpeed;\n    planeBottom += zoomSpeed;\n    planeTop -= zoomSpeed;\n\n    setViewingVolume();\n}\n\nvoid GLCamera::zoomOut()\n{\n    if(zoomLevel == 1)\n        return;\n\n    zoomLevel -= 1;\n\n    planeLeft -= zoomSpeed;\n    planeRight += zoomSpeed;\n    planeBottom -= zoomSpeed;\n    planeTop += zoomSpeed;\n\n    setViewingVolume();\n}\n\nvoid GLCamera::setViewingVolume()\n{\n    glViewport(0, 0, canvasWidth, canvasHeight);\n\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity();\n\n    GLdouble dx = planeRight - planeLeft;\n    GLdouble dy = planeTop - planeBottom;\n\n    if(fabs(dx) > 0.001 || fabs(dy) > 0.001)\/\/Controls how far you can zoom in\n    {\n        if(dx >= dy)\n        {\n            GLdouble dY = dx * canvasHeight \/ canvasWidth;\n            GLdouble yMax = planeBottom + dY;\n            glOrtho(planeLeft, planeRight, planeBottom, yMax, planeNear, planeFar);\n        }\n        else\n        {\n            GLdouble dX = dy * canvasWidth \/ canvasHeight;\n            GLdouble xMax = planeLeft + dX;\n            glOrtho(planeLeft, xMax, planeBottom, planeTop, planeNear, planeFar);\n        }\n    }\n\n\/\/    glOrtho(planeLeft,\n\/\/            planeRight,\n\/\/            planeBottom,\n\/\/            planeTop,\n\/\/            planeNear,\n\/\/            planeFar);\n\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n}\n\nvoid GLCamera::center()\n{\n    x = 0.0;\n    y = 0.0;\n    z = 1.0;\n\n    look_x = 0.0;\n    look_y = 0.0;\n    look_z = 0.0;\n}\n\n<commit_msg>Scaling Map Issue is NOT resolved<commit_after>#include <cmath>\n#include \"glcamera.h\"\n\n#ifdef __APPLE__\n    #include <GLUT\/glut.h>\n#else\n    #include <glut.h>\n#endif\n\n#include <QDebug>\n\nGLCamera::GLCamera()\n{\n    moveSpeed = 10.0;\n\n    x = 0.0;\n    y = 0.0;\n    z = 1.0;\n\n    look_x = 0.0;\n    look_y = 0.0;\n    look_z = 0.0;\n\n    zoomLevel = 1.0;\n    zoomSpeed = 0.05;\n\n    \/\/ lat=\"46.791803,9\" lon=\"4.427704,7\"\n    planeLeft = 437.0;\n    planeRight = 449.0;\n\n    planeBottom = 4674.0;\n    planeTop = 4686.0;\n\n    planeNear = 0.0;\n    planeFar = 10.0;\n\n    canvasWidth = 0;\n    canvasHeight = 0;\n}\n\nvoid GLCamera::left()\n{\n    x -= (moveSpeed * (1 \/ std::abs(zoomLevel)));\n    look_x -= (moveSpeed * (1 \/ std::abs(zoomLevel)));\n}\n\nvoid GLCamera::right()\n{\n    x += (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n    look_x += (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n}\n\nvoid GLCamera::up()\n{\n    y += (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n    look_y += (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n}\n\nvoid GLCamera::down()\n{\n    y -= (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n    look_y -= (moveSpeed * (1 \/ std::abs(zoomLevel)));;\n}\n\nvoid GLCamera::move(int dx, int dy)\n{\n    \/\/ TODO : Need good scrolling\n    x -= (dx * (0.10 * (1 \/ std::abs(zoomLevel))));\n    look_x -= (dx * (0.10 * (1 \/ std::abs(zoomLevel))));\n    y += (dy * (0.10 * (1 \/ std::abs(zoomLevel))));\n    look_y += (dy * (0.10 * (1 \/ std::abs(zoomLevel))));\n}\n\nvoid GLCamera::zoomIn()\n{\n    if(zoomLevel == 121)\n        return;\n\n    if(planeRight - planeLeft <= 0.1 || planeTop - planeBottom <= 0.1)\n        return;\n\n    zoomLevel += 1;\n\n    planeLeft += zoomSpeed;\n    planeRight -= zoomSpeed;\n    planeBottom += zoomSpeed;\n    planeTop -= zoomSpeed;\n\n    setViewingVolume();\n}\n\nvoid GLCamera::zoomOut()\n{\n    if(zoomLevel == 1)\n        return;\n\n    zoomLevel -= 1;\n\n    planeLeft -= zoomSpeed;\n    planeRight += zoomSpeed;\n    planeBottom -= zoomSpeed;\n    planeTop += zoomSpeed;\n\n    setViewingVolume();\n}\n\nvoid GLCamera::setViewingVolume()\n{\n    glViewport(0, 0, canvasWidth, canvasHeight);\n\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity();\n\n    GLdouble dx = planeRight - planeLeft;\n    GLdouble dy = planeTop - planeBottom;\n\n    if(fabs(dx) > 0.001 || fabs(dy) > 0.001)\/\/Controls how far you can zoom in\n    {\n        if(dx >= dy)\n        {\n            GLdouble dY = dx * canvasHeight \/ canvasWidth;\n            GLdouble yMax = planeBottom + dY;\n            glOrtho(planeLeft, planeRight, planeBottom, yMax, planeNear, planeFar);\n        }\n        else\n        {\n            GLdouble dX = dy * canvasWidth \/ canvasHeight;\n            GLdouble xMax = planeLeft + dX;\n            glOrtho(planeLeft, xMax, planeBottom, planeTop, planeNear, planeFar);\n        }\n    }\n\n\/\/    glOrtho(planeLeft,\n\/\/            planeRight,\n\/\/            planeBottom,\n\/\/            planeTop,\n\/\/            planeNear,\n\/\/            planeFar);\n\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n}\n\nvoid GLCamera::center()\n{\n    x = 0.0;\n    y = 0.0;\n    z = 1.0;\n\n    look_x = 0.0;\n    look_y = 0.0;\n    look_z = 0.0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *  @file       merge_sort_for_list.hpp\n *  @author     Alan.W\n *  @date       15   Jun 2014\n *  @remark     This code is for Introduction to Algorithms\n *  @note\n ***************************************************************************\/\n\/\/!\n\/\/! merge_sort_for_list(node)\n\/\/! complexity  O(n lg n)\n\/\/!             no extra space needed\n\/\/! pseudo code:\n\/*      merge_sort_for_list(node)\n * 1    if(!node || !node->next)\n * 2        return node\n * 3    def left, right, temp, last\n * 4    left = right = temp = last = node\n * 5    while(temp && temp->next)   \/\/search for the half node\n * 6        last    = right\n * 7        right   = right->next\n * 8        temp    = temp->next->next\n * 9    last->next = nullptr        \/\/break into two lists\n * 10   left    = merge_sort_for_list(left)\n * 11   right   = merge_sort_for_list(right)\n * 12   def ret, next\n * 13   while(left || right)\n * 14       if(!right)\n * 15           next    =   left\n * 16           left    =   left->next\n * 17       else if(!left)\n * 18           next    =   right\n * 19           right   =   right->next\n * 20       else if(left->key < right->key)\n * 21           next    =   left\n * 22           left    =   left->next\n * 23       else\n * 24           next    =   right\n * 25           right   =   right->next\n * 26       if(!ret)\n * 27           ret     =   next\n * 28   return ret;\n *\/\n\n#ifndef MERGE_SORT_FOR_LIST_HPP\n#define MERGE_SORT_FOR_LIST_HPP\n\n#include \"list.hpp\"\n#include <memory>\n\nnamespace ch10 {\n\n\ntemplate<typename T>\nstd::shared_ptr<list::node<T> >\nmerge_sort_for_list(const std::shared_ptr<list::node<T> >& node);\n\n\/**\n * @brief merge_sort_for_list\n *\n * @complexity  time:   O(n lg n)\n *              space:  no extra space needed, compared with the same algorithm on array\n *                      which requires O(n) extra space.\n *\n * check above for pseud code which is based on an alorithm found on SO:\n * http:\/\/stackoverflow.com\/questions\/7685\/merge-sort-a-linked-list\n *\/\ntemplate<typename T>\ninline std::shared_ptr<list::node<T> >\nmerge_sort_for_list(const std::shared_ptr<list::node<T> >& node)\n{\n    using ValueType = T;\n    using Node      = list::node<ValueType>;\n    using sPointer  = std::shared_ptr<Node>;\n\n    \/\/! recursion stopping condition\n    if(!node || !node->next)    return node;\n\n    \/\/! search for the middle node\n    sPointer left, right, fast, last;\n    left = right = fast = last = node;\n    while(fast && fast->next)\n    {\n        last    =   right;\n        right   =   right->next;\n        fast    =   fast->next->next;\n    }\n\n    \/\/! split the original linked list\n    last->next  =   nullptr;\n\n    \/\/! recur\n    left    =   merge_sort_for_list(left);\n    right   =   merge_sort_for_list(right);\n\n    \/\/! merge\n    sPointer ret, next;\n    while(left || right)\n    {\n        if(!right)      \/\/when right part is exhausted.\n        {\n            next    =   left;\n            left    =   left->next;\n        }\n        else if(!left)  \/\/when left  part is exhausted.\n        {\n            next    =   right;\n            right   =   right->next;\n        }\n        else if(left->key < left->key)\n        {\n            next    =   left;\n            left    =   left->next;\n        }\n        else\n        {\n            next    =   right;\n            right   =   right->next;\n        }\n\n        if(!ret)\n            ret     =   next;\n    }\n    return ret;\n}\n\n}\/\/namespace\n#endif \/\/ MERGE_SORT_FOR_LIST_HPP\n<commit_msg>fixed a bug \tmodified:   ch10\/merge_sort_for_list.hpp<commit_after>\/***************************************************************************\n *  @file       merge_sort_for_list.hpp\n *  @author     Alan.W\n *  @date       15   Jun 2014\n *  @remark     This code is for Introduction to Algorithms\n *  @note\n ***************************************************************************\/\n\/\/!\n\/\/! merge_sort_for_list(node)\n\/\/! complexity  O(n lg n)\n\/\/!             no extra space needed\n\/\/! pseudo code:\n\/*      merge_sort_for_list(node)\n * 1    if(!node || !node->next)\n * 2        return node\n * 3    def left, right, temp, last\n * 4    left = right = temp = last = node\n * 5    while(temp && temp->next)   \/\/search for the half node\n * 6        last    = right\n * 7        right   = right->next\n * 8        temp    = temp->next->next\n * 9    last->next = nullptr        \/\/break into two lists\n * 10   left    = merge_sort_for_list(left)\n * 11   right   = merge_sort_for_list(right)\n * 12   def ret, next\n * 13   while(left || right)\n * 14       if(!right)\n * 15           next    =   left\n * 16           left    =   left->next\n * 17       else if(!left)\n * 18           next    =   right\n * 19           right   =   right->next\n * 20       else if(left->key < right->key)\n * 21           next    =   left\n * 22           left    =   left->next\n * 23       else\n * 24           next    =   right\n * 25           right   =   right->next\n * 26       if(!ret)\n * 27           ret     =   next\n * 28   return ret;\n *\/\n\n#ifndef MERGE_SORT_FOR_LIST_HPP\n#define MERGE_SORT_FOR_LIST_HPP\n\n#include \"list.hpp\"\n#include <memory>\n\nnamespace ch10 {\n\n\ntemplate<typename T>\nstd::shared_ptr<list::node<T> >\nmerge_sort_for_list(const std::shared_ptr<list::node<T> >& node);\n\n\/**\n * @brief merge_sort_for_list\n *\n * @complexity  time:   O(n lg n)\n *              space:  no extra space needed, compared with the same algorithm on array\n *                      which requires O(n) extra space.\n *\n * check above for pseud code which is based on an alorithm on SO:\n * http:\/\/stackoverflow.com\/questions\/7685\/merge-sort-a-linked-list\n *\/\ntemplate<typename T>\ninline std::shared_ptr<list::node<T> >\nmerge_sort_for_list(const std::shared_ptr<list::node<T> >& node)\n{\n    using ValueType = T;\n    using Node      = list::node<ValueType>;\n    using sPointer  = std::shared_ptr<Node>;\n\n    \/\/! recursion stopping condition\n    if(!node || !node->next)    return node;\n\n    \/\/! search for the middle node\n    sPointer left, right, fast, last;\n    left = right = fast = last = node;\n    while(fast && fast->next)\n    {\n        last    =   right;\n        right   =   right->next;\n        fast    =   fast->next->next;\n    }\n\n    \/\/! split the original linked list\n    last->next  =   nullptr;\n\n    \/\/! recur\n    left    =   merge_sort_for_list(left);\n    right   =   merge_sort_for_list(right);\n\n    \/\/! merge\n    sPointer ret, next;\n    while(left || right)\n    {\n        if(!right)      \/\/when right part is exhausted.\n        {\n            next    =   left;\n            left    =   left->next;\n        }\n        else if(!left)  \/\/when left  part is exhausted.\n        {\n            next    =   right;\n            right   =   right->next;\n        }\n        else if(left->key < right->key)\n        {\n            next    =   left;\n            left    =   left->next;\n        }\n        else\n        {\n            next    =   right;\n            right   =   right->next;\n        }\n\n        if(!ret)\n            ret     =   next;\n    }\n    return ret;\n}\n\n}\/\/namespace\n#endif \/\/ MERGE_SORT_FOR_LIST_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThis Source Code Form is subject to the\nterms of the Mozilla Public License, v.\n2.0. If a copy of the MPL was not\ndistributed with this file, You can\nobtain one at\nhttp:\/\/mozilla.org\/MPL\/2.0\/.\n*\/\n\n#include \"stdafx.h\"\n#include \"openglgeometrybank.h\"\n\n#include \"sn_utils.h\"\n#include \"logs.h\"\n#include \"globals.h\"\n\nvoid\nbasic_vertex::serialize( std::ostream &s ) const {\n\n    sn_utils::ls_float32( s, position.x );\n    sn_utils::ls_float32( s, position.y );\n    sn_utils::ls_float32( s, position.z );\n\n    sn_utils::ls_float32( s, normal.x );\n    sn_utils::ls_float32( s, normal.y );\n    sn_utils::ls_float32( s, normal.z );\n\n    sn_utils::ls_float32( s, texture.x );\n    sn_utils::ls_float32( s, texture.y );\n}\n\nvoid\nbasic_vertex::deserialize( std::istream &s ) {\n\n    position.x = sn_utils::ld_float32( s );\n    position.y = sn_utils::ld_float32( s );\n    position.z = sn_utils::ld_float32( s );\n\n    normal.x = sn_utils::ld_float32( s );\n    normal.y = sn_utils::ld_float32( s );\n    normal.z = sn_utils::ld_float32( s );\n\n    texture.x = sn_utils::ld_float32( s );\n    texture.y = sn_utils::ld_float32( s );\n}\n\n\/\/ generic geometry bank class, allows storage, update and drawing of geometry chunks\n\n\/\/ creates a new geometry chunk of specified type from supplied vertex data. returns: handle to the chunk\ngeometry_handle\ngeometry_bank::create( vertex_array &Vertices, unsigned int const Type ) {\n\n    if( true == Vertices.empty() ) { return geometry_handle( 0, 0 ); }\n\n    m_chunks.emplace_back( Vertices, Type );\n    \/\/ NOTE: handle is effectively (index into chunk array + 1) this leaves value of 0 to serve as error\/empty handle indication\n    geometry_handle chunkhandle { 0, static_cast<std::uint32_t>(m_chunks.size()) };\n    \/\/ template method implementation\n    create_( chunkhandle );\n    \/\/ all done\n    return chunkhandle;\n}\n\n\/\/ replaces data of specified chunk with the supplied vertex data, starting from specified offset\nbool\ngeometry_bank::replace( vertex_array &Vertices, geometry_handle const &Geometry, std::size_t const Offset ) {\n\n    if( ( Geometry.chunk == 0 ) || ( Geometry.chunk > m_chunks.size() ) ) { return false; }\n\n    auto &chunk = geometry_bank::chunk( Geometry );\n\n    if( ( Offset == 0 )\n     && ( Vertices.size() == chunk.vertices.size() ) ) {\n        \/\/ check first if we can get away with a simple swap...\n        chunk.vertices.swap( Vertices );\n    }\n    else {\n        \/\/ ...otherwise we need to do some legwork\n        \/\/ NOTE: if the offset is larger than existing size of the chunk, it'll bridge the gap with 'blank' vertices\n        \/\/ TBD: we could bail out with an error instead if such request occurs\n        chunk.vertices.resize( Offset + Vertices.size(), basic_vertex() );\n        chunk.vertices.insert( std::end( chunk.vertices ), std::begin( Vertices ), std::end( Vertices ) );\n    }\n    \/\/ template method implementation\n    replace_( Geometry );\n    \/\/ all done\n    return true;\n}\n\n\/\/ adds supplied vertex data at the end of specified chunk\nbool\ngeometry_bank::append( vertex_array &Vertices, geometry_handle const &Geometry ) {\n\n    if( ( Geometry.chunk == 0 ) || ( Geometry.chunk > m_chunks.size() ) ) { return false; }\n\n    return replace( Vertices, Geometry, geometry_bank::chunk( Geometry ).vertices.size() );\n}\n\n\/\/ draws geometry stored in specified chunk\nvoid\ngeometry_bank::draw( geometry_handle const &Geometry, unsigned int const Streams ) {\n    \/\/ template method implementation\n    draw_( Geometry, Streams );\n}\n\n\/\/ frees subclass-specific resources associated with the bank, typically called when the bank wasn't in use for a period of time\nvoid\ngeometry_bank::release() {\n    \/\/ template method implementation\n    release_();\n}\n\nvertex_array const &\ngeometry_bank::vertices( geometry_handle const &Geometry ) const {\n\n    return geometry_bank::chunk( Geometry ).vertices;\n}\n\n\/\/ opengl vbo-based variant of the geometry bank\n\nGLuint opengl_vbogeometrybank::m_activebuffer { NULL }; \/\/ buffer bound currently on the opengl end, if any\nunsigned int opengl_vbogeometrybank::m_activestreams { stream::none }; \/\/ currently enabled data type pointers\n\n\/\/ create() subclass details\nvoid\nopengl_vbogeometrybank::create_( geometry_handle const &Geometry ) {\n    \/\/ adding a chunk means we'll be (re)building the buffer, which will fill the chunk records, amongst other things.\n    \/\/ thus we don't need to initialize the values here\n    m_chunkrecords.emplace_back( chunk_record() );\n    \/\/ kiss the existing buffer goodbye, new overall data size means we'll be making a new one\n    delete_buffer();\n\n\tglGenVertexArrays(1, &m_vao);\n}\n\n\/\/ replace() subclass details\nvoid\nopengl_vbogeometrybank::replace_( geometry_handle const &Geometry ) {\n\n    auto &chunkrecord = m_chunkrecords[ Geometry.chunk - 1 ];\n    chunkrecord.is_good = false;\n    \/\/ if the overall length of the chunk didn't change we can get away with reusing the old buffer...\n    if( geometry_bank::chunk( Geometry ).vertices.size() != chunkrecord.size ) {\n        \/\/ ...but otherwise we'll need to allocate a new one\n        \/\/ TBD: we could keep and reuse the old buffer also if the new chunk is smaller than the old one,\n        \/\/ but it'd require some extra tracking and work to keep all chunks up to date; also wasting vram; may be not worth it?\n        delete_buffer();\n    }\n}\n\n\/\/ draw() subclass details\nvoid\nopengl_vbogeometrybank::draw_( geometry_handle const &Geometry, unsigned int const Streams ) {\n    if( m_buffer == NULL ) {\n        \/\/ if there's no buffer, we'll have to make one\n        \/\/ NOTE: this isn't exactly optimal in terms of ensuring the gfx card doesn't stall waiting for the data\n        \/\/ may be better to initiate upload earlier (during update phase) and trust this effort won't go to waste\n        if( true == m_chunks.empty() ) { return; }\n        std::size_t datasize{ 0 };\n        auto chunkiterator = m_chunks.cbegin();\n        for( auto &chunkrecord : m_chunkrecords ) {\n            \/\/ fill records for all chunks, based on the chunk data\n            chunkrecord.is_good = false; \/\/ if we're re-creating buffer, chunks might've been uploaded in the old one\n            chunkrecord.offset = datasize;\n            chunkrecord.size = chunkiterator->vertices.size();\n            datasize += chunkrecord.size;\n            ++chunkiterator;\n        }\n        \/\/ the odds for all created chunks to get replaced with empty ones are quite low, but the possibility does exist\n        if( datasize == 0 ) { return; }\n        \/\/ try to set up the buffer we need\n        ::glGenBuffers( 1, &m_buffer );\n        bind_buffer();\n        \/\/ NOTE: we're using static_draw since it's generally true for all we have implemented at the moment\n        \/\/ TODO: allow to specify usage hint at the object creation, and pass it here\n\t\tm_activestreams = stream::none;\n        ::glBufferData(\n            GL_ARRAY_BUFFER,\n            datasize * sizeof( basic_vertex ),\n            nullptr,\n            GL_STATIC_DRAW );\n        if( ::glGetError() == GL_OUT_OF_MEMORY ) {\n            \/\/ TBD: throw a bad_alloc?\n            ErrorLog( \"openGL error: out of memory; failed to create a geometry buffer\" );\n            delete_buffer();\n            return;\n        }\n        m_buffercapacity = datasize;\n    }\n    \/\/ actual draw procedure starts here\n    \/\/ setup...\n    if( m_activebuffer != m_buffer ) {\n        bind_buffer();\n    }\n    auto &chunkrecord = m_chunkrecords[ Geometry.chunk - 1 ];\n    auto const &chunk = geometry_bank::chunk( Geometry );\n    if( false == chunkrecord.is_good ) {\n        \/\/ we may potentially need to upload new buffer data before we can draw it\n        ::glBufferSubData(\n            GL_ARRAY_BUFFER,\n            chunkrecord.offset * sizeof( basic_vertex ),\n            chunkrecord.size * sizeof( basic_vertex ),\n            chunk.vertices.data() );\n        chunkrecord.is_good = true;\n    }\n\tif( m_activestreams != Streams ) {\n        bind_streams( Streams );\n    }\n\n    \/\/ ...render...\n    ::glDrawArrays( chunk.type, (GLint)chunkrecord.offset, (GLsizei)chunkrecord.size );\n    \/\/ ...post-render cleanup\n}\n\n\/\/ release () subclass details\nvoid\nopengl_vbogeometrybank::release_() {\n\n    delete_buffer();\n}\n\nvoid\nopengl_vbogeometrybank::bind_buffer() {\n\tglBindVertexArray(m_vao);\n    ::glBindBuffer( GL_ARRAY_BUFFER, m_buffer );\n    m_activebuffer = m_buffer;\n}\n\nvoid\nopengl_vbogeometrybank::delete_buffer() {\n\tglDeleteVertexArrays(1, &m_vao);\n    if( m_buffer != NULL ) {\n        \n        ::glDeleteBuffers( 1, &m_buffer );\n        if( m_activebuffer == m_buffer ) {\n            m_activebuffer = NULL;\n            bind_streams( stream::none );\n        }\n        m_buffer = NULL;\n        m_buffercapacity = 0;\n        \/\/ NOTE: since we've deleted the buffer all chunks it held were rendered invalid as well\n        \/\/ instead of clearing their state here we're delaying it until new buffer is created to avoid looping through chunk records twice\n    }\n}\n\nvoid\nopengl_vbogeometrybank::bind_streams( unsigned int const Streams ) {\n    if( Streams & stream::position ) {\n\t\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 8, (GLvoid*)0);\n\t\tglEnableVertexAttribArray(0);\n    }\n    else {\n\t\tglDisableVertexAttribArray(0);\n    }\n\n    \/\/ NOTE: normal and color streams share the data, making them effectively mutually exclusive\n    if( Streams & stream::normal ) {\n\t\tglVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 8, (GLvoid*)(sizeof(float) * 3));\n\t\tglEnableVertexAttribArray(1);\n    }\n    else {\n\t\tglDisableVertexAttribArray(1);\n    }\n\n    if( Streams & stream::color ) {\n\n    }\n    else {\n\n    }\n\n    if( Streams & stream::texture ) {\n\t\tglVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, sizeof(float) * 8, (GLvoid*)(sizeof(float) * 6));\n\t\tglEnableVertexAttribArray(2);\n    }\n    else {\n\t\tglDisableVertexAttribArray(2);\n    }\n\n    m_activestreams = Streams;\n}\n\n\/\/ opengl display list based variant of the geometry bank\n\n\/\/ create() subclass details\nvoid\nopengl_dlgeometrybank::create_( geometry_handle const &Geometry ) {\n\n    m_chunkrecords.emplace_back( chunk_record() );\n}\n\n\/\/ replace() subclass details\nvoid\nopengl_dlgeometrybank::replace_( geometry_handle const &Geometry ) {\n\n    delete_list( Geometry );\n}\n\n\/\/ draw() subclass details\nvoid\nopengl_dlgeometrybank::draw_( geometry_handle const &Geometry, unsigned int const Streams ) {\n\n    auto &chunkrecord = m_chunkrecords[ Geometry.chunk - 1 ];\n    if( chunkrecord.streams != Streams ) {\n        delete_list( Geometry );\n    }\n    if( chunkrecord.list == 0 ) {\n        \/\/ we don't have a list ready, so compile one\n        chunkrecord.streams = Streams;\n        chunkrecord.list = ::glGenLists( 1 );\n        auto const &chunk = geometry_bank::chunk( Geometry );\n        ::glNewList( chunkrecord.list, GL_COMPILE );\n\n        ::glBegin( chunk.type );\n        for( auto const &vertex : chunk.vertices ) {\n                 if( Streams & stream::normal ) { ::glNormal3fv( glm::value_ptr( vertex.normal ) ); }\n            else if( Streams & stream::color )  { ::glColor3fv( glm::value_ptr( vertex.normal ) ); }\n            if( Streams & stream::texture )     { ::glTexCoord2fv( glm::value_ptr( vertex.texture ) ); }\n            if( Streams & stream::position )    { ::glVertex3fv( glm::value_ptr( vertex.position ) ); }\n        }\n        ::glEnd();\n        ::glEndList();\n    }\n    \/\/ with the list done we can just play it\n    ::glCallList( chunkrecord.list );\n}\n\n\/\/ release () subclass details\nvoid\nopengl_dlgeometrybank::release_() {\n\n    for( auto &chunkrecord : m_chunkrecords ) {\n        if( chunkrecord.list != 0 ) {\n            ::glDeleteLists( chunkrecord.list, 1 );\n            chunkrecord.list = 0;\n        }\n        chunkrecord.streams = stream::none;\n    }\n}\n\nvoid\nopengl_dlgeometrybank::delete_list( geometry_handle const &Geometry ) {\n    \/\/ NOTE: given it's our own internal method we trust it to be called with valid parameters\n    auto &chunkrecord = m_chunkrecords[ Geometry.chunk - 1 ];\n    if( chunkrecord.list != 0 ) {\n        ::glDeleteLists( chunkrecord.list, 1 );\n        chunkrecord.list = 0;\n    }\n    chunkrecord.streams = stream::none;\n}\n\n\/\/ geometry bank manager, holds collection of geometry banks\n\n\/\/ performs a resource sweep\nvoid\ngeometrybank_manager::update() {\n\n    m_garbagecollector.sweep();\n}\n\n\/\/ creates a new geometry bank. returns: handle to the bank or NULL\ngeometrybank_handle\ngeometrybank_manager::create_bank() {\n\n\tm_geometrybanks.emplace_back(std::make_shared<opengl_vbogeometrybank>(), std::chrono::steady_clock::time_point());\n    \/\/ NOTE: handle is effectively (index into chunk array + 1) this leaves value of 0 to serve as error\/empty handle indication\n    return geometrybank_handle( (uint32_t)m_geometrybanks.size(), 0 );\n}\n\n\/\/ creates a new geometry chunk of specified type from supplied vertex data, in specified bank. returns: handle to the chunk or NULL\ngeometry_handle\ngeometrybank_manager::create_chunk( vertex_array &Vertices, geometrybank_handle const &Geometry, int const Type ) {\n\n    auto const newchunkhandle = bank( Geometry ).first->create( Vertices, Type );\n\n    if( newchunkhandle.chunk != 0 ) { return geometry_handle( Geometry.bank, newchunkhandle.chunk ); }\n    else                            { return geometry_handle( 0, 0 ); }\n}\n\n\/\/ replaces data of specified chunk with the supplied vertex data, starting from specified offset\nbool\ngeometrybank_manager::replace( vertex_array &Vertices, geometry_handle const &Geometry, std::size_t const Offset ) {\n\n    return bank( Geometry ).first->replace( Vertices, Geometry, Offset );\n}\n\n\/\/ adds supplied vertex data at the end of specified chunk\nbool\ngeometrybank_manager::append( vertex_array &Vertices, geometry_handle const &Geometry ) {\n\n    return bank( Geometry ).first->append( Vertices, Geometry );\n}\n\/\/ draws geometry stored in specified chunk\nvoid\ngeometrybank_manager::draw( geometry_handle const &Geometry, unsigned int const Streams ) {\n\n    if( Geometry == NULL ) { return; }\n\n    auto &bankrecord = bank( Geometry );\n\n    bankrecord.second = m_garbagecollector.timestamp();\n    bankrecord.first->draw( Geometry, Streams );\n}\n\n\/\/ provides direct access to vertex data of specfied chunk\nvertex_array const &\ngeometrybank_manager::vertices( geometry_handle const &Geometry ) const {\n\n    return bank( Geometry ).first->vertices( Geometry );\n}\n<commit_msg>przesadziłem?<commit_after>\/*\nThis Source Code Form is subject to the\nterms of the Mozilla Public License, v.\n2.0. If a copy of the MPL was not\ndistributed with this file, You can\nobtain one at\nhttp:\/\/mozilla.org\/MPL\/2.0\/.\n*\/\n\n#include \"stdafx.h\"\n#include \"openglgeometrybank.h\"\n\n#include \"sn_utils.h\"\n#include \"logs.h\"\n#include \"globals.h\"\n\nvoid\nbasic_vertex::serialize( std::ostream &s ) const {\n\n    sn_utils::ls_float32( s, position.x );\n    sn_utils::ls_float32( s, position.y );\n    sn_utils::ls_float32( s, position.z );\n\n    sn_utils::ls_float32( s, normal.x );\n    sn_utils::ls_float32( s, normal.y );\n    sn_utils::ls_float32( s, normal.z );\n\n    sn_utils::ls_float32( s, texture.x );\n    sn_utils::ls_float32( s, texture.y );\n}\n\nvoid\nbasic_vertex::deserialize( std::istream &s ) {\n\n    position.x = sn_utils::ld_float32( s );\n    position.y = sn_utils::ld_float32( s );\n    position.z = sn_utils::ld_float32( s );\n\n    normal.x = sn_utils::ld_float32( s );\n    normal.y = sn_utils::ld_float32( s );\n    normal.z = sn_utils::ld_float32( s );\n\n    texture.x = sn_utils::ld_float32( s );\n    texture.y = sn_utils::ld_float32( s );\n}\n\n\/\/ generic geometry bank class, allows storage, update and drawing of geometry chunks\n\n\/\/ creates a new geometry chunk of specified type from supplied vertex data. returns: handle to the chunk\ngeometry_handle\ngeometry_bank::create( vertex_array &Vertices, unsigned int const Type ) {\n\n    if( true == Vertices.empty() ) { return geometry_handle( 0, 0 ); }\n\n    m_chunks.emplace_back( Vertices, Type );\n    \/\/ NOTE: handle is effectively (index into chunk array + 1) this leaves value of 0 to serve as error\/empty handle indication\n    geometry_handle chunkhandle { 0, static_cast<std::uint32_t>(m_chunks.size()) };\n    \/\/ template method implementation\n    create_( chunkhandle );\n    \/\/ all done\n    return chunkhandle;\n}\n\n\/\/ replaces data of specified chunk with the supplied vertex data, starting from specified offset\nbool\ngeometry_bank::replace( vertex_array &Vertices, geometry_handle const &Geometry, std::size_t const Offset ) {\n\n    if( ( Geometry.chunk == 0 ) || ( Geometry.chunk > m_chunks.size() ) ) { return false; }\n\n    auto &chunk = geometry_bank::chunk( Geometry );\n\n    if( ( Offset == 0 )\n     && ( Vertices.size() == chunk.vertices.size() ) ) {\n        \/\/ check first if we can get away with a simple swap...\n        chunk.vertices.swap( Vertices );\n    }\n    else {\n        \/\/ ...otherwise we need to do some legwork\n        \/\/ NOTE: if the offset is larger than existing size of the chunk, it'll bridge the gap with 'blank' vertices\n        \/\/ TBD: we could bail out with an error instead if such request occurs\n        chunk.vertices.resize( Offset + Vertices.size(), basic_vertex() );\n        chunk.vertices.insert( std::end( chunk.vertices ), std::begin( Vertices ), std::end( Vertices ) );\n    }\n    \/\/ template method implementation\n    replace_( Geometry );\n    \/\/ all done\n    return true;\n}\n\n\/\/ adds supplied vertex data at the end of specified chunk\nbool\ngeometry_bank::append( vertex_array &Vertices, geometry_handle const &Geometry ) {\n\n    if( ( Geometry.chunk == 0 ) || ( Geometry.chunk > m_chunks.size() ) ) { return false; }\n\n    return replace( Vertices, Geometry, geometry_bank::chunk( Geometry ).vertices.size() );\n}\n\n\/\/ draws geometry stored in specified chunk\nvoid\ngeometry_bank::draw( geometry_handle const &Geometry, unsigned int const Streams ) {\n    \/\/ template method implementation\n    draw_( Geometry, Streams );\n}\n\n\/\/ frees subclass-specific resources associated with the bank, typically called when the bank wasn't in use for a period of time\nvoid\ngeometry_bank::release() {\n    \/\/ template method implementation\n    release_();\n}\n\nvertex_array const &\ngeometry_bank::vertices( geometry_handle const &Geometry ) const {\n\n    return geometry_bank::chunk( Geometry ).vertices;\n}\n\n\/\/ opengl vbo-based variant of the geometry bank\n\nGLuint opengl_vbogeometrybank::m_activebuffer { NULL }; \/\/ buffer bound currently on the opengl end, if any\nunsigned int opengl_vbogeometrybank::m_activestreams { stream::none }; \/\/ currently enabled data type pointers\n\n\/\/ create() subclass details\nvoid\nopengl_vbogeometrybank::create_( geometry_handle const &Geometry ) {\n    \/\/ adding a chunk means we'll be (re)building the buffer, which will fill the chunk records, amongst other things.\n    \/\/ thus we don't need to initialize the values here\n    m_chunkrecords.emplace_back( chunk_record() );\n    \/\/ kiss the existing buffer goodbye, new overall data size means we'll be making a new one\n    delete_buffer();\n\n\tbind_streams(stream::none);\n\tglGenVertexArrays(1, &m_vao);\n}\n\n\/\/ replace() subclass details\nvoid\nopengl_vbogeometrybank::replace_( geometry_handle const &Geometry ) {\n\n    auto &chunkrecord = m_chunkrecords[ Geometry.chunk - 1 ];\n    chunkrecord.is_good = false;\n    \/\/ if the overall length of the chunk didn't change we can get away with reusing the old buffer...\n    if( geometry_bank::chunk( Geometry ).vertices.size() != chunkrecord.size ) {\n        \/\/ ...but otherwise we'll need to allocate a new one\n        \/\/ TBD: we could keep and reuse the old buffer also if the new chunk is smaller than the old one,\n        \/\/ but it'd require some extra tracking and work to keep all chunks up to date; also wasting vram; may be not worth it?\n        delete_buffer();\n    }\n}\n\n\/\/ draw() subclass details\nvoid\nopengl_vbogeometrybank::draw_( geometry_handle const &Geometry, unsigned int const Streams ) {\n    if( m_buffer == NULL ) {\n        \/\/ if there's no buffer, we'll have to make one\n        \/\/ NOTE: this isn't exactly optimal in terms of ensuring the gfx card doesn't stall waiting for the data\n        \/\/ may be better to initiate upload earlier (during update phase) and trust this effort won't go to waste\n        if( true == m_chunks.empty() ) { return; }\n        std::size_t datasize{ 0 };\n        auto chunkiterator = m_chunks.cbegin();\n        for( auto &chunkrecord : m_chunkrecords ) {\n            \/\/ fill records for all chunks, based on the chunk data\n            chunkrecord.is_good = false; \/\/ if we're re-creating buffer, chunks might've been uploaded in the old one\n            chunkrecord.offset = datasize;\n            chunkrecord.size = chunkiterator->vertices.size();\n            datasize += chunkrecord.size;\n            ++chunkiterator;\n        }\n        \/\/ the odds for all created chunks to get replaced with empty ones are quite low, but the possibility does exist\n        if( datasize == 0 ) { return; }\n        \/\/ try to set up the buffer we need\n        ::glGenBuffers( 1, &m_buffer );\n        bind_buffer();\n        \/\/ NOTE: we're using static_draw since it's generally true for all we have implemented at the moment\n        \/\/ TODO: allow to specify usage hint at the object creation, and pass it here\n        ::glBufferData(\n            GL_ARRAY_BUFFER,\n            datasize * sizeof( basic_vertex ),\n            nullptr,\n            GL_STATIC_DRAW );\n        if( ::glGetError() == GL_OUT_OF_MEMORY ) {\n            \/\/ TBD: throw a bad_alloc?\n            ErrorLog( \"openGL error: out of memory; failed to create a geometry buffer\" );\n            delete_buffer();\n            return;\n        }\n        m_buffercapacity = datasize;\n    }\n    \/\/ actual draw procedure starts here\n    \/\/ setup...\n    if( m_activebuffer != m_buffer ) {\n        bind_buffer();\n    }\n    auto &chunkrecord = m_chunkrecords[ Geometry.chunk - 1 ];\n    auto const &chunk = geometry_bank::chunk( Geometry );\n    if( false == chunkrecord.is_good ) {\n        \/\/ we may potentially need to upload new buffer data before we can draw it\n        ::glBufferSubData(\n            GL_ARRAY_BUFFER,\n            chunkrecord.offset * sizeof( basic_vertex ),\n            chunkrecord.size * sizeof( basic_vertex ),\n            chunk.vertices.data() );\n        chunkrecord.is_good = true;\n    }\n\tif( m_activestreams != Streams ) {\n        bind_streams( Streams );\n    }\n\n    \/\/ ...render...\n    ::glDrawArrays( chunk.type, (GLint)chunkrecord.offset, (GLsizei)chunkrecord.size );\n    \/\/ ...post-render cleanup\n}\n\n\/\/ release () subclass details\nvoid\nopengl_vbogeometrybank::release_() {\n\n    delete_buffer();\n}\n\nvoid\nopengl_vbogeometrybank::bind_buffer() {\n\tglBindVertexArray(m_vao);\n    ::glBindBuffer( GL_ARRAY_BUFFER, m_buffer );\n    m_activebuffer = m_buffer;\n\tbind_streams(stream::none);\n}\n\nvoid\nopengl_vbogeometrybank::delete_buffer() {\n\tglDeleteVertexArrays(1, &m_vao);\n    if( m_buffer != NULL ) {\n        \n        ::glDeleteBuffers( 1, &m_buffer );\n        if( m_activebuffer == m_buffer ) {\n            m_activebuffer = NULL;\n            bind_streams( stream::none );\n        }\n        m_buffer = NULL;\n        m_buffercapacity = 0;\n        \/\/ NOTE: since we've deleted the buffer all chunks it held were rendered invalid as well\n        \/\/ instead of clearing their state here we're delaying it until new buffer is created to avoid looping through chunk records twice\n    }\n}\n\nvoid\nopengl_vbogeometrybank::bind_streams( unsigned int const Streams ) {\n    if( Streams & stream::position ) {\n\t\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 8, (GLvoid*)0);\n\t\tglEnableVertexAttribArray(0);\n    }\n    else {\n\t\tglDisableVertexAttribArray(0);\n    }\n\n    \/\/ NOTE: normal and color streams share the data, making them effectively mutually exclusive\n    if( Streams & stream::normal ) {\n\t\tglVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 8, (GLvoid*)(sizeof(float) * 3));\n\t\tglEnableVertexAttribArray(1);\n    }\n    else {\n\t\tglDisableVertexAttribArray(1);\n    }\n\n    if( Streams & stream::color ) {\n\n    }\n    else {\n\n    }\n\n    if( Streams & stream::texture ) {\n\t\tglVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, sizeof(float) * 8, (GLvoid*)(sizeof(float) * 6));\n\t\tglEnableVertexAttribArray(2);\n    }\n    else {\n\t\tglDisableVertexAttribArray(2);\n    }\n\n    m_activestreams = Streams;\n}\n\n\/\/ opengl display list based variant of the geometry bank\n\n\/\/ create() subclass details\nvoid\nopengl_dlgeometrybank::create_( geometry_handle const &Geometry ) {\n\n    m_chunkrecords.emplace_back( chunk_record() );\n}\n\n\/\/ replace() subclass details\nvoid\nopengl_dlgeometrybank::replace_( geometry_handle const &Geometry ) {\n\n    delete_list( Geometry );\n}\n\n\/\/ draw() subclass details\nvoid\nopengl_dlgeometrybank::draw_( geometry_handle const &Geometry, unsigned int const Streams ) {\n\n    auto &chunkrecord = m_chunkrecords[ Geometry.chunk - 1 ];\n    if( chunkrecord.streams != Streams ) {\n        delete_list( Geometry );\n    }\n    if( chunkrecord.list == 0 ) {\n        \/\/ we don't have a list ready, so compile one\n        chunkrecord.streams = Streams;\n        chunkrecord.list = ::glGenLists( 1 );\n        auto const &chunk = geometry_bank::chunk( Geometry );\n        ::glNewList( chunkrecord.list, GL_COMPILE );\n\n        ::glBegin( chunk.type );\n        for( auto const &vertex : chunk.vertices ) {\n                 if( Streams & stream::normal ) { ::glNormal3fv( glm::value_ptr( vertex.normal ) ); }\n            else if( Streams & stream::color )  { ::glColor3fv( glm::value_ptr( vertex.normal ) ); }\n            if( Streams & stream::texture )     { ::glTexCoord2fv( glm::value_ptr( vertex.texture ) ); }\n            if( Streams & stream::position )    { ::glVertex3fv( glm::value_ptr( vertex.position ) ); }\n        }\n        ::glEnd();\n        ::glEndList();\n    }\n    \/\/ with the list done we can just play it\n    ::glCallList( chunkrecord.list );\n}\n\n\/\/ release () subclass details\nvoid\nopengl_dlgeometrybank::release_() {\n\n    for( auto &chunkrecord : m_chunkrecords ) {\n        if( chunkrecord.list != 0 ) {\n            ::glDeleteLists( chunkrecord.list, 1 );\n            chunkrecord.list = 0;\n        }\n        chunkrecord.streams = stream::none;\n    }\n}\n\nvoid\nopengl_dlgeometrybank::delete_list( geometry_handle const &Geometry ) {\n    \/\/ NOTE: given it's our own internal method we trust it to be called with valid parameters\n    auto &chunkrecord = m_chunkrecords[ Geometry.chunk - 1 ];\n    if( chunkrecord.list != 0 ) {\n        ::glDeleteLists( chunkrecord.list, 1 );\n        chunkrecord.list = 0;\n    }\n    chunkrecord.streams = stream::none;\n}\n\n\/\/ geometry bank manager, holds collection of geometry banks\n\n\/\/ performs a resource sweep\nvoid\ngeometrybank_manager::update() {\n\n    m_garbagecollector.sweep();\n}\n\n\/\/ creates a new geometry bank. returns: handle to the bank or NULL\ngeometrybank_handle\ngeometrybank_manager::create_bank() {\n\n\tm_geometrybanks.emplace_back(std::make_shared<opengl_vbogeometrybank>(), std::chrono::steady_clock::time_point());\n    \/\/ NOTE: handle is effectively (index into chunk array + 1) this leaves value of 0 to serve as error\/empty handle indication\n    return geometrybank_handle( (uint32_t)m_geometrybanks.size(), 0 );\n}\n\n\/\/ creates a new geometry chunk of specified type from supplied vertex data, in specified bank. returns: handle to the chunk or NULL\ngeometry_handle\ngeometrybank_manager::create_chunk( vertex_array &Vertices, geometrybank_handle const &Geometry, int const Type ) {\n\n    auto const newchunkhandle = bank( Geometry ).first->create( Vertices, Type );\n\n    if( newchunkhandle.chunk != 0 ) { return geometry_handle( Geometry.bank, newchunkhandle.chunk ); }\n    else                            { return geometry_handle( 0, 0 ); }\n}\n\n\/\/ replaces data of specified chunk with the supplied vertex data, starting from specified offset\nbool\ngeometrybank_manager::replace( vertex_array &Vertices, geometry_handle const &Geometry, std::size_t const Offset ) {\n\n    return bank( Geometry ).first->replace( Vertices, Geometry, Offset );\n}\n\n\/\/ adds supplied vertex data at the end of specified chunk\nbool\ngeometrybank_manager::append( vertex_array &Vertices, geometry_handle const &Geometry ) {\n\n    return bank( Geometry ).first->append( Vertices, Geometry );\n}\n\/\/ draws geometry stored in specified chunk\nvoid\ngeometrybank_manager::draw( geometry_handle const &Geometry, unsigned int const Streams ) {\n\n    if( Geometry == NULL ) { return; }\n\n    auto &bankrecord = bank( Geometry );\n\n    bankrecord.second = m_garbagecollector.timestamp();\n    bankrecord.first->draw( Geometry, Streams );\n}\n\n\/\/ provides direct access to vertex data of specfied chunk\nvertex_array const &\ngeometrybank_manager::vertices( geometry_handle const &Geometry ) const {\n\n    return bank( Geometry ).first->vertices( Geometry );\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\n#include <fstream>\n#include <iostream>\nusing namespace std;\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <math.h>\n#include \"parse_regressor.h\"\n#include \"loss_functions.h\"\n#include \"global_data.h\"\n#include \"io.h\"\n\nvoid initialize_regressor(regressor &r)\n{\n  size_t length = ((size_t)1) << global.num_bits;\n  global.thread_mask = (global.stride * (length >> global.thread_bits)) - 1;\n  size_t num_threads = global.num_threads();\n  r.weight_vectors = (weight **)malloc(num_threads * sizeof(weight*));\n  for (size_t i = 0; i < num_threads; i++)\n    {\n      r.weight_vectors[i] = (weight *)calloc(global.stride*length\/num_threads, sizeof(weight));\n      if (r.weight_vectors[i] == NULL)\n        {\n          cerr << global.program_name << \": Failed to allocate weight array: try decreasing -b <bits>\" << endl;\n          exit (1);\n        }\n      if (global.initial_weight != 0.)\n\tfor (size_t j = 0; j < global.stride*length\/num_threads; j+=global.stride)\n\t  r.weight_vectors[i][j] = global.initial_weight;\n      if (global.random_weights)\n\tfor (size_t j = 0; j < length\/num_threads; j++) {\n          r.weight_vectors[i][j] = drand48() - 0.5;\n        }\n      if (global.lda)\n\t{\n\t  size_t stride = global.stride;\n\n          for (size_t j = 0; j < stride*length\/num_threads; j+=stride)\n\t    {\n\t      for (size_t k = 0; k < global.lda; k++) {\n                r.weight_vectors[i][j+k] = -log(drand48()) + 1.0;\n\/\/                 r.weight_vectors[i][j+k] *= r.weight_vectors[i][j+k];\n\/\/                 r.weight_vectors[i][j+k] *= r.weight_vectors[i][j+k];\n\t\tr.weight_vectors[i][j+k] *= (float)global.lda_D \/ (float)global.lda\n\t\t  \/ global.length() * 200;\n              }\n\t      r.weight_vectors[i][j+global.lda] = global.initial_t;\n\t    }\n\t}\n      if(global.adaptive)\n        for (size_t j = 1; j < global.stride*length\/num_threads; j+=global.stride)\n\t  r.weight_vectors[i][j] = 1;\n    }\n}\n\nvoid parse_regressor_args(po::variables_map& vm, regressor& r, string& final_regressor_name, bool quiet)\n{\n  if (vm.count(\"final_regressor\")) {\n    final_regressor_name = vm[\"final_regressor\"].as<string>();\n    if (!quiet)\n      cerr << \"final_regressor = \" << vm[\"final_regressor\"].as<string>() << endl;\n  }\n  else\n    final_regressor_name = \"\";\n\n  vector<string> regs;\n  if (vm.count(\"initial_regressor\"))\n    regs = vm[\"initial_regressor\"].as< vector<string> >();\n  \n  \/* \n     Read in regressors.  If multiple regressors are specified, do a weighted \n     average.  If none are specified, initialize according to global_seg & \n     numbits.\n  *\/\n  bool initialized = false;\n  \n  for (size_t i = 0; i < regs.size(); i++)\n    {\n      ifstream regressor(regs[i].c_str());\n      if (!regressor.is_open())\n\t{\n\t  cout << \"can't open \" << regs[i].c_str() << endl << \" ... exiting.\" << endl;\n\t  exit(1);\n\t}\n\n      size_t v_length;\n      regressor.read((char*)&v_length, sizeof(v_length));\n      char t[v_length];\n      regressor.read(t,v_length);\n      if (strcmp(t,version.c_str()) != 0)\n\t{\n\t  cout << \"regressor has possibly incompatible version!\" << endl;\n\t  exit(1);\n\t}\n\n      regressor.read((char*)&global.min_label, sizeof(global.min_label));\n      regressor.read((char*)&global.max_label, sizeof(global.max_label));\n\n      size_t local_num_bits;\n      regressor.read((char *)&local_num_bits, sizeof(local_num_bits));\n      if (!initialized){\n\tglobal.num_bits = local_num_bits;\n      }\n      else \n\tif (local_num_bits != global.num_bits)\n\t  {\n\t    cout << \"can't combine regressors with different feature number!\" << endl;\n\t    exit (1);\n\t  }\n\n      size_t local_thread_bits;\n      regressor.read((char*)&local_thread_bits, sizeof(local_thread_bits));\n      if (!initialized){\n\tglobal.thread_bits = local_thread_bits;\n\tglobal.partition_bits = global.thread_bits;\n      }\n      else \n\tif (local_thread_bits != global.thread_bits)\n\t  {\n\t    cout << \"can't combine regressors trained with different numbers of threads!\" << endl;\n\t    exit (1);\n\t  }\n      \n      int len;\n      regressor.read((char *)&len, sizeof(len));\n\n      vector<string> local_pairs;\n      for (; len > 0; len--)\n\t{\n\t  char pair[2];\n\t  regressor.read(pair, sizeof(char)*2);\n\t  string temp(pair, 2);\n\t  local_pairs.push_back(temp);\n\t}\n      if (!initialized)\n\t{\n\t  global.pairs = local_pairs;\n\t  initialize_regressor(r);\n\t}\n      else\n\tif (local_pairs != global.pairs)\n\t  {\n\t    cout << \"can't combine regressors with different features!\" << endl;\n\t    for (size_t i = 0; i < local_pairs.size(); i++)\n\t      cout << local_pairs[i] << \" \" << local_pairs[i].size() << \" \";\n\t    cout << endl;\n\t    for (size_t i = 0; i < global.pairs.size(); i++)\n\t      cout << global.pairs[i] << \" \" << global.pairs[i].size() << \" \";\n\t    cout << endl;\n\t    exit (1);\n\t  }\n      size_t local_ngram;\n      regressor.read((char*)&local_ngram, sizeof(local_ngram));\n      size_t local_skips;\n      regressor.read((char*)&local_skips, sizeof(local_skips));\n      if (!initialized)\n\t{\n\t  global.ngram = local_ngram;\n\t  global.skips = local_skips;\n\t  initialized = true;\n\t}\n      else\n\tif (global.ngram != local_ngram || global.skips != local_skips)\n\t  {\n\t    cout << \"can't combine regressors with different ngram features!\" << endl;\n\t    exit(1);\n\t  }\n      size_t stride = global.stride;\n      while (regressor.good())\n\t{\n\t  uint32_t hash;\n\t  regressor.read((char *)&hash, sizeof(hash));\n\t  weight w = 0.;\n\t  regressor.read((char *)&w, sizeof(float));\n\t  \n\t  size_t num_threads = global.num_threads();\n\t  if (regressor.good() && global.lda == 0) \n\t    r.weight_vectors[hash % num_threads][(hash*stride)\/num_threads] \n\t      = r.weight_vectors[hash % num_threads][(hash*stride)\/num_threads] + w;\n\t  else\n\t    r.weight_vectors[hash % num_threads][hash\/num_threads] \n\t      = r.weight_vectors[hash % num_threads][hash\/num_threads] + w;\n\t}      \n      regressor.close();\n    }\n  if (!initialized)\n    {\n      if(vm.count(\"noop\") || vm.count(\"sendto\"))\n\tr.weight_vectors = NULL;\n      else\n\tinitialize_regressor(r);\n    }\n}\n\nvoid free_regressor(regressor &r)\n{\n  if (r.weight_vectors != NULL)\n    {\n      for (size_t i = 0; i < global.num_threads(); i++)\n\tif (r.weight_vectors[i] != NULL)\n\t  free(r.weight_vectors[i]);\n      free(r.weight_vectors);\n    }\n}\n\nvoid dump_regressor(string reg_name, regressor &r)\n{\n  if (reg_name == string(\"\"))\n    return;\n  string start_name = reg_name+string(\".writing\");\n  io_buf io_temp;\n\n  int f = io_temp.open_file(start_name.c_str(),io_buf::WRITE);\n  \n  if (f<0)\n    {\n      cout << \"can't open: \" << start_name << \" for writing, exiting\" << endl;\n      exit(1);\n    }\n  size_t v_length = version.length()+1;\n  io_temp.write_file(f,(char*)&v_length, sizeof(v_length));\n  io_temp.write_file(f,version.c_str(),v_length);\n  \n  io_temp.write_file(f,(char*)&global.min_label, sizeof(global.min_label));\n  io_temp.write_file(f,(char*)&global.max_label, sizeof(global.max_label));\n  \n  io_temp.write_file(f,(char *)&global.num_bits, sizeof(global.num_bits));\n  io_temp.write_file(f,(char *)&global.thread_bits, sizeof(global.thread_bits));\n  int len = global.pairs.size();\n  io_temp.write_file(f,(char *)&len, sizeof(len));\n  for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) \n    io_temp.write_file(f,i->c_str(),2);\n\n  io_temp.write_file(f,(char*)&global.ngram, sizeof(global.ngram));\n  io_temp.write_file(f,(char*)&global.skips, sizeof(global.skips));\n  \n  uint32_t length = 1 << global.num_bits;\n  size_t num_threads = global.num_threads();\n  size_t stride = global.stride;\n  for(uint32_t i = 0; i < length; i++)\n    {\n      if (global.lda == 0)\n\t{\n\t  weight v = r.weight_vectors[i%num_threads][stride*(i\/num_threads)];\n\t  if (v != 0.)\n\t    {      \n\t      io_temp.write_file(f,(char *)&i, sizeof (i));\n\t      io_temp.write_file(f,(char *)&v, sizeof (v));\n\t    }\n\t}\n      else\n\tfor (size_t k = 0; k < global.lda; k++)\n\t  {\n\t    weight v = r.weight_vectors[i%num_threads][(stride*i+k)\/num_threads];\n\t    io_temp.write_file(f,(char *)&i, sizeof (i));\n\t    io_temp.write_file(f,(char *)&v, sizeof (v));\n\t  }\n    }\n\n  rename(start_name.c_str(),reg_name.c_str());\n\n  io_temp.close_file();\n}\n\nvoid finalize_regressor(string reg_name, regressor &r)\n{\n  dump_regressor(reg_name,r);\n  free_regressor(r);\n}\n<commit_msg>fixed bit check for regressor when testing from Paul Mineiro<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\n#include <fstream>\n#include <iostream>\nusing namespace std;\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <math.h>\n#include \"parse_regressor.h\"\n#include \"loss_functions.h\"\n#include \"global_data.h\"\n#include \"io.h\"\n\nvoid initialize_regressor(regressor &r)\n{\n  size_t length = ((size_t)1) << global.num_bits;\n  global.thread_mask = (global.stride * (length >> global.thread_bits)) - 1;\n  size_t num_threads = global.num_threads();\n  r.weight_vectors = (weight **)malloc(num_threads * sizeof(weight*));\n  for (size_t i = 0; i < num_threads; i++)\n    {\n      r.weight_vectors[i] = (weight *)calloc(global.stride*length\/num_threads, sizeof(weight));\n      if (r.weight_vectors[i] == NULL)\n        {\n          cerr << global.program_name << \": Failed to allocate weight array: try decreasing -b <bits>\" << endl;\n          exit (1);\n        }\n      if (global.initial_weight != 0.)\n\tfor (size_t j = 0; j < global.stride*length\/num_threads; j+=global.stride)\n\t  r.weight_vectors[i][j] = global.initial_weight;\n      if (global.random_weights)\n\tfor (size_t j = 0; j < length\/num_threads; j++) {\n          r.weight_vectors[i][j] = drand48() - 0.5;\n        }\n      if (global.lda)\n\t{\n\t  size_t stride = global.stride;\n\n          for (size_t j = 0; j < stride*length\/num_threads; j+=stride)\n\t    {\n\t      for (size_t k = 0; k < global.lda; k++) {\n                r.weight_vectors[i][j+k] = -log(drand48()) + 1.0;\n\/\/                 r.weight_vectors[i][j+k] *= r.weight_vectors[i][j+k];\n\/\/                 r.weight_vectors[i][j+k] *= r.weight_vectors[i][j+k];\n\t\tr.weight_vectors[i][j+k] *= (float)global.lda_D \/ (float)global.lda\n\t\t  \/ global.length() * 200;\n              }\n\t      r.weight_vectors[i][j+global.lda] = global.initial_t;\n\t    }\n\t}\n      if(global.adaptive)\n        for (size_t j = 1; j < global.stride*length\/num_threads; j+=global.stride)\n\t  r.weight_vectors[i][j] = 1;\n    }\n}\n\nvoid parse_regressor_args(po::variables_map& vm, regressor& r, string& final_regressor_name, bool quiet)\n{\n  if (vm.count(\"final_regressor\")) {\n    final_regressor_name = vm[\"final_regressor\"].as<string>();\n    if (!quiet)\n      cerr << \"final_regressor = \" << vm[\"final_regressor\"].as<string>() << endl;\n  }\n  else\n    final_regressor_name = \"\";\n\n  vector<string> regs;\n  if (vm.count(\"initial_regressor\"))\n    regs = vm[\"initial_regressor\"].as< vector<string> >();\n  \n  \/* \n     Read in regressors.  If multiple regressors are specified, do a weighted \n     average.  If none are specified, initialize according to global_seg & \n     numbits.\n  *\/\n  bool initialized = false;\n  \n  for (size_t i = 0; i < regs.size(); i++)\n    {\n      ifstream regressor(regs[i].c_str());\n      if (!regressor.is_open())\n\t{\n\t  cout << \"can't open \" << regs[i].c_str() << endl << \" ... exiting.\" << endl;\n\t  exit(1);\n\t}\n\n      size_t v_length;\n      regressor.read((char*)&v_length, sizeof(v_length));\n      char t[v_length];\n      regressor.read(t,v_length);\n      if (strcmp(t,version.c_str()) != 0)\n\t{\n\t  cout << \"regressor has possibly incompatible version!\" << endl;\n\t  exit(1);\n\t}\n\n      regressor.read((char*)&global.min_label, sizeof(global.min_label));\n      regressor.read((char*)&global.max_label, sizeof(global.max_label));\n\n      size_t local_num_bits;\n      regressor.read((char *)&local_num_bits, sizeof(local_num_bits));\n      if (!initialized){\n\tglobal.default_bits = false;\n\tglobal.num_bits = local_num_bits;\n      }\n      else \n\tif (local_num_bits != global.num_bits)\n\t  {\n\t    cout << \"can't combine regressors with different feature number!\" << endl;\n\t    exit (1);\n\t  }\n\n      size_t local_thread_bits;\n      regressor.read((char*)&local_thread_bits, sizeof(local_thread_bits));\n      if (!initialized){\n\tglobal.thread_bits = local_thread_bits;\n\tglobal.partition_bits = global.thread_bits;\n      }\n      else \n\tif (local_thread_bits != global.thread_bits)\n\t  {\n\t    cout << \"can't combine regressors trained with different numbers of threads!\" << endl;\n\t    exit (1);\n\t  }\n      \n      int len;\n      regressor.read((char *)&len, sizeof(len));\n\n      vector<string> local_pairs;\n      for (; len > 0; len--)\n\t{\n\t  char pair[2];\n\t  regressor.read(pair, sizeof(char)*2);\n\t  string temp(pair, 2);\n\t  local_pairs.push_back(temp);\n\t}\n      if (!initialized)\n\t{\n\t  global.pairs = local_pairs;\n\t  initialize_regressor(r);\n\t}\n      else\n\tif (local_pairs != global.pairs)\n\t  {\n\t    cout << \"can't combine regressors with different features!\" << endl;\n\t    for (size_t i = 0; i < local_pairs.size(); i++)\n\t      cout << local_pairs[i] << \" \" << local_pairs[i].size() << \" \";\n\t    cout << endl;\n\t    for (size_t i = 0; i < global.pairs.size(); i++)\n\t      cout << global.pairs[i] << \" \" << global.pairs[i].size() << \" \";\n\t    cout << endl;\n\t    exit (1);\n\t  }\n      size_t local_ngram;\n      regressor.read((char*)&local_ngram, sizeof(local_ngram));\n      size_t local_skips;\n      regressor.read((char*)&local_skips, sizeof(local_skips));\n      if (!initialized)\n\t{\n\t  global.ngram = local_ngram;\n\t  global.skips = local_skips;\n\t  initialized = true;\n\t}\n      else\n\tif (global.ngram != local_ngram || global.skips != local_skips)\n\t  {\n\t    cout << \"can't combine regressors with different ngram features!\" << endl;\n\t    exit(1);\n\t  }\n      size_t stride = global.stride;\n      while (regressor.good())\n\t{\n\t  uint32_t hash;\n\t  regressor.read((char *)&hash, sizeof(hash));\n\t  weight w = 0.;\n\t  regressor.read((char *)&w, sizeof(float));\n\t  \n\t  size_t num_threads = global.num_threads();\n\t  if (regressor.good() && global.lda == 0) \n\t    r.weight_vectors[hash % num_threads][(hash*stride)\/num_threads] \n\t      = r.weight_vectors[hash % num_threads][(hash*stride)\/num_threads] + w;\n\t  else\n\t    r.weight_vectors[hash % num_threads][hash\/num_threads] \n\t      = r.weight_vectors[hash % num_threads][hash\/num_threads] + w;\n\t}      \n      regressor.close();\n    }\n  if (!initialized)\n    {\n      if(vm.count(\"noop\") || vm.count(\"sendto\"))\n\tr.weight_vectors = NULL;\n      else\n\tinitialize_regressor(r);\n    }\n}\n\nvoid free_regressor(regressor &r)\n{\n  if (r.weight_vectors != NULL)\n    {\n      for (size_t i = 0; i < global.num_threads(); i++)\n\tif (r.weight_vectors[i] != NULL)\n\t  free(r.weight_vectors[i]);\n      free(r.weight_vectors);\n    }\n}\n\nvoid dump_regressor(string reg_name, regressor &r)\n{\n  if (reg_name == string(\"\"))\n    return;\n  string start_name = reg_name+string(\".writing\");\n  io_buf io_temp;\n\n  int f = io_temp.open_file(start_name.c_str(),io_buf::WRITE);\n  \n  if (f<0)\n    {\n      cout << \"can't open: \" << start_name << \" for writing, exiting\" << endl;\n      exit(1);\n    }\n  size_t v_length = version.length()+1;\n  io_temp.write_file(f,(char*)&v_length, sizeof(v_length));\n  io_temp.write_file(f,version.c_str(),v_length);\n  \n  io_temp.write_file(f,(char*)&global.min_label, sizeof(global.min_label));\n  io_temp.write_file(f,(char*)&global.max_label, sizeof(global.max_label));\n  \n  io_temp.write_file(f,(char *)&global.num_bits, sizeof(global.num_bits));\n  io_temp.write_file(f,(char *)&global.thread_bits, sizeof(global.thread_bits));\n  int len = global.pairs.size();\n  io_temp.write_file(f,(char *)&len, sizeof(len));\n  for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) \n    io_temp.write_file(f,i->c_str(),2);\n\n  io_temp.write_file(f,(char*)&global.ngram, sizeof(global.ngram));\n  io_temp.write_file(f,(char*)&global.skips, sizeof(global.skips));\n  \n  uint32_t length = 1 << global.num_bits;\n  size_t num_threads = global.num_threads();\n  size_t stride = global.stride;\n  for(uint32_t i = 0; i < length; i++)\n    {\n      if (global.lda == 0)\n\t{\n\t  weight v = r.weight_vectors[i%num_threads][stride*(i\/num_threads)];\n\t  if (v != 0.)\n\t    {      \n\t      io_temp.write_file(f,(char *)&i, sizeof (i));\n\t      io_temp.write_file(f,(char *)&v, sizeof (v));\n\t    }\n\t}\n      else\n\tfor (size_t k = 0; k < global.lda; k++)\n\t  {\n\t    weight v = r.weight_vectors[i%num_threads][(stride*i+k)\/num_threads];\n\t    io_temp.write_file(f,(char *)&i, sizeof (i));\n\t    io_temp.write_file(f,(char *)&v, sizeof (v));\n\t  }\n    }\n\n  rename(start_name.c_str(),reg_name.c_str());\n\n  io_temp.close_file();\n}\n\nvoid finalize_regressor(string reg_name, regressor &r)\n{\n  dump_regressor(reg_name,r);\n  free_regressor(r);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The idea behind this technique is to render the scene to an intermediate FBO repeatedly (SUBFRAMES times),\n\/\/ advancing the scene forward a little at a time (in sub-frame increments). So rather than rendering @ time 1.0, time 2.0, etc\n\/\/ we render at time 1.1, 1.2, etc.\n\/\/ At the end of rendering each sub-frame, accumulate (add) it into a floating point FBO. And at the end, we get an average by dividing\n\/\/ by the number of sub-frames we rendered. This is a slightly naive, but very general technique for rendering motion blur.\n\/\/ We achieve the accumulation by drawing the final sub-frame into the accumulation FBO using addivite blending.\n\/\/ To do the divide by SUBFRAMES at the end, we just set the color to be 1.0\/SUBFRAMES and draw the final accumulation buffer color texture.\n\n#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n\nusing namespace ci;\nusing namespace ci::app;\n\nclass MotionBlurFboApp : public App {\n  public:\t\n\tvoid setup();\n\tvoid keyDown( KeyEvent event );\n\tvoid updateCubeRotation( double time );\n\tvoid draw();\n\t\n\tCameraPersp\t\t\tmCam;\n\tmat4\t\t\tmCubeRotation;\n\tgl::BatchRef\t\tmBatch;\n\tgl::FboRef\t\t\tmFbo, mAccumFbo;\n\tbool\t\t\t\tmPaused;\n};\n\nconst int SUBFRAMES = 16; \/\/ increasing this number increases quality\n\nvoid MotionBlurFboApp::setup()\n{\n\tmCam.lookAt( vec3( 0, 0, 7 ), vec3( 0 ) );\n\tmCam.setPerspective( 60, getWindowAspectRatio(), 1, 1000 );\n\n\tmBatch = gl::Batch::create( geom::Cube().colors(), gl::getStockShader( gl::ShaderDef().color() ) );\n\tmFbo = gl::Fbo::create( toPixels( getWindowWidth() ), toPixels( getWindowHeight() ) );\n\n#if defined( CINDER_GL_ES_2 )\n\tmAccumFbo = gl::Fbo::create( toPixels( getWindowWidth() ), toPixels( getWindowHeight() ),\n\t\tgl::Fbo::Format().colorTexture( gl::Texture::Format().dataType( GL_HALF_FLOAT_OES )\n\t\t\t\t\t\t\t\t\t\t\t\t\t.internalFormat( GL_RGB ) ).disableDepth() );\n#else\n\tmAccumFbo = gl::Fbo::create( getWindowWidth(), getWindowHeight(),\n\t\tgl::Fbo::Format().colorTexture( gl::Texture::Format().internalFormat( GL_RGB16F ) ).disableDepth() );\n#endif\n\n\tmPaused = false;\n}\n\nvoid MotionBlurFboApp::keyDown( KeyEvent event )\n{\n\tif( event.getChar() == ' ' )\n\t\tmPaused = ! mPaused;\n}\n\nvoid MotionBlurFboApp::updateCubeRotation( double time )\n{\n\t\/\/ Rotate the cube by .03 radians around an arbitrary axis (which changes over time)\n\tauto axis = normalize( vec3( sin( time ), cos( time * 3 ), 0.5f ) );\n\tmCubeRotation *= rotate( sinf( time ) * 0.02f, axis );\n}\n\nvoid MotionBlurFboApp::draw()\n{\n\tgl::viewport( vec2(), mAccumFbo->getSize() );\n\n\tif( ! mPaused ) {\n\t\t\/\/ make 'mAccumFbo' the active framebuffer\n\t\tgl::ScopedFramebuffer fbScp( mAccumFbo );\n\t\t\/\/ clear out both of our FBOs\n\t\tgl::clear( Color::black() );\n\t\tgl::color( 1, 1, 1, 1 );\n\n\t\t\/\/ iterate all the sub-frames\n\t\tdouble startTime = getElapsedSeconds();\n\t\tfor( int i = 0; i < SUBFRAMES; ++i ) {\n\t\t\t\/\/ draw the Cube's sub-frame into mFbo\n\t\t\tgl::enableDepthRead();\n\t\t\tgl::enableDepthWrite();\n\t\t\tgl::enableAlphaBlending();\n\t\t\tmFbo->bindFramebuffer();\n\t\t\tgl::clear();\n\t\t\tgl::setMatrices( mCam );\n\t\t\tupdateCubeRotation( startTime + i \/ (float)SUBFRAMES );\n\t\t\tgl::multModelMatrix( mCubeRotation );\n\t\t\tmBatch->draw();\n\t\t\t\n\t\t\t\/\/ now add this frame to the accumulation FBO\n\t\t\tmAccumFbo->bindFramebuffer();\n\t\t\tgl::setMatricesWindow( mAccumFbo->getSize() );\n\t\t\tgl::enableAdditiveBlending();\n\t\t\tgl::disableDepthWrite();\n\t\t\tgl::disableDepthRead();\t\t\n\t\t\tgl::draw( mFbo->getColorTexture() );\n\t\t}\n\t}\n\t\n\tgl::disableDepthRead();\n\tgl::enableAlphaBlending();\n\t\/\/ set the color to be 1\/SUBFRAMES, which divides the HDR image by the number of sub-frames we rendered\n\tgl::color( 1.0f \/ SUBFRAMES, 1.0f \/ SUBFRAMES, 1.0f \/ SUBFRAMES, 1 );\n\tgl::setMatricesWindow( getWindowSize() );\n\tgl::draw( mAccumFbo->getColorTexture() );\n}\n\nCINDER_APP( MotionBlurFboApp, RendererGl, []( App::Settings *settings ) {\n\tsettings->setResizable( false );\n\tsettings->setHighDensityDisplayEnabled( false );\n} )\n<commit_msg>Minor updates to MotionBlurFbo sample<commit_after>\/\/ The idea behind this technique is to render the scene to an intermediate FBO repeatedly (SUBFRAMES times),\n\/\/ advancing the scene forward a little at a time (in sub-frame increments). So rather than rendering @ time 1.0, time 2.0, etc\n\/\/ we render at time 1.1, 1.2, etc.\n\/\/ At the end of rendering each sub-frame, accumulate (add) it into a floating point FBO. And at the end, we get an average by dividing\n\/\/ by the number of sub-frames we rendered. This is a slightly naive, but very general technique for rendering motion blur.\n\/\/ We achieve the accumulation by drawing the final sub-frame into the accumulation FBO using addivite blending.\n\/\/ To do the divide by SUBFRAMES at the end, we just set the color to be 1.0\/SUBFRAMES and draw the final accumulation buffer color texture.\n\n#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n\nusing namespace ci;\nusing namespace ci::app;\n\nclass MotionBlurFboApp : public App {\n  public:\t\n\tvoid setup();\n\tvoid keyDown( KeyEvent event );\n\tvoid updateCubeRotation( double time );\n\tvoid draw();\n\t\n\tCameraPersp\t\t\tmCam;\n\tmat4\t\t\tmCubeRotation;\n\tgl::BatchRef\t\tmBatch;\n\tgl::FboRef\t\t\tmFbo, mAccumFbo;\n\tbool\t\t\t\tmPaused;\n};\n\nconst int SUBFRAMES = 16; \/\/ increasing this number increases quality\n\nvoid MotionBlurFboApp::setup()\n{\n\tmCam.lookAt( vec3( 0, 0, 2.5 ), vec3( 0 ) );\n\tmCam.setPerspective( 60, getWindowAspectRatio(), 1, 1000 );\n\n\tmBatch = gl::Batch::create( geom::Cube().colors(), gl::getStockShader( gl::ShaderDef().color() ) );\n\tmFbo = gl::Fbo::create( toPixels( getWindowWidth() ), toPixels( getWindowHeight() ) );\n\n#if defined( CINDER_GL_ES_2 )\n\tmAccumFbo = gl::Fbo::create( toPixels( getWindowWidth() ), toPixels( getWindowHeight() ),\n\t\tgl::Fbo::Format().colorTexture( gl::Texture::Format().dataType( GL_HALF_FLOAT_OES )\n\t\t\t\t\t\t\t\t\t\t\t\t\t.internalFormat( GL_RGB ) ).disableDepth() );\n#else\n\tmAccumFbo = gl::Fbo::create( getWindowWidth(), getWindowHeight(),\n\t\tgl::Fbo::Format().colorTexture( gl::Texture::Format().internalFormat( GL_RGB16F ) ).disableDepth() );\n#endif\n\n\tmPaused = false;\n}\n\nvoid MotionBlurFboApp::keyDown( KeyEvent event )\n{\n\tif( event.getChar() == ' ' )\n\t\tmPaused = ! mPaused;\n}\n\nvoid MotionBlurFboApp::updateCubeRotation( double time )\n{\n\t\/\/ Rotate the cube by .03 radians around an arbitrary axis (which changes over time)\n\tauto axis = normalize( vec3( sin( time ), cos( time * 3 ), 0.5f ) );\n\tmCubeRotation *= rotate( sinf( time ) * 0.02f, axis );\n}\n\nvoid MotionBlurFboApp::draw()\n{\n\tgl::viewport( vec2(), mAccumFbo->getSize() );\n\n\tif( ! mPaused ) {\n\t\t\/\/ make 'mAccumFbo' the active framebuffer\n\t\tgl::ScopedFramebuffer fbScp( mAccumFbo );\n\t\t\/\/ clear out both of our FBOs\n\t\tgl::clear( Color::black() );\n\t\tgl::color( 1, 1, 1, 1 );\n\n\t\t\/\/ iterate all the sub-frames\n\t\tdouble startTime = getElapsedSeconds();\n\t\tfor( int i = 0; i < SUBFRAMES; ++i ) {\n\t\t\t\/\/ draw the Cube's sub-frame into mFbo\n\t\t\tgl::enableDepth();\n\t\t\tgl::enableAlphaBlending();\n\t\t\tmFbo->bindFramebuffer();\n\t\t\tgl::clear();\n\t\t\tgl::enableDepth();\n\t\t\tgl::setMatrices( mCam );\n\t\t\tupdateCubeRotation( startTime + i \/ (float)SUBFRAMES );\n\t\t\tgl::multModelMatrix( mCubeRotation );\n\t\t\tmBatch->draw();\n\t\t\t\n\t\t\t\/\/ now add this frame to the accumulation FBO\n\t\t\tmAccumFbo->bindFramebuffer();\n\t\t\tgl::setMatricesWindow( mAccumFbo->getSize() );\n\t\t\tgl::enableAdditiveBlending();\n\t\t\tgl::enableDepth( false );\n\t\t\tgl::draw( mFbo->getColorTexture() );\n\t\t}\n\t}\n\t\n\tgl::disableDepthRead();\n\tgl::disableAlphaBlending();\n\t\/\/ set the color to be 1\/SUBFRAMES, which divides the HDR image by the number of sub-frames we rendered\n\tgl::color( 1.0f \/ SUBFRAMES, 1.0f \/ SUBFRAMES, 1.0f \/ SUBFRAMES, 1 );\n\tgl::setMatricesWindow( getWindowSize() );\n\tgl::draw( mAccumFbo->getColorTexture() );\n}\n\nCINDER_APP( MotionBlurFboApp, RendererGl, []( App::Settings *settings ) {\n\tsettings->setResizable( false );\n\tsettings->setHighDensityDisplayEnabled( false );\n} )\n<|endoftext|>"}
{"text":"<commit_before>#include <ros\/ros.h>\n\n#include <ompl\/geometric\/SimpleSetup.h>\n#include <ompl\/geometric\/planners\/rrt\/RRT.h>\n#include <ompl\/base\/spaces\/SE2StateSpace.h>\n\n#include <cmath>\n#include <iostream>\n#include <fstream>\n\nnamespace ob = ompl::base;\nnamespace og = ompl::geometric;\n\nvoid planWithSimpleSetup(){\n    ob::StateSpacePtr space(new ob::SE2StateSpace());\n    ob::RealVectorBounds bounds(2);\n    bounds.setLow(-1);\n    bounds.setHigh(1);\n    space->as<ob::SE2StateSpace>()->setBounds(bounds);\n\n    og::SimpleSetup ss(space);\n\n    \/\/TODO: Set state validity checker\n    \n    ob::ScopedState<ob::SE2StateSpace> start(space);\n    start->setXY(-0.9, -0.9);\n    std::cout << \"start: \"; start.print(std::cout);\n\n    ob::ScopedState<ob::SE2StateSpace> goal(space);\n    goal->setXY(0.9, 0.9);\n    std::cout << \"goal: \" goal.print(std::cout);\n\n    ss.setStartAndGoalStates(start, goal);\n\n    ob::PlannerPtr planner(new og::PRM(ss.getSpaceInformation()));\n    ss.setPlanner(planner);\n\n    std::cout << \"-----------------\" << std::endl;\n    \n    ob::PlannerStatus solved = ss.solve(1.0);\n\n    if(solved){\n        ss.simplifySolution();\n        std::cout << \"------------\" << std::endl;\n        std::cout << \"Found solution:\" << std::endl;\n        ss.getSolutionPath().print(std::cout);\n\n        std::ofstream ofs(\"path.dat\");\n        ss.getSolutionPath().printAsMatrix(ofs);\n    }else{\n        ROS_ERROR(\"Solution is not found\");\n    }\n}\n\nint main(int argc, char *argv[]){\n    ros::init(argc, argv, \"global_path_planner\");\n    planWithSimpleSetup();\n    return 0;\n}\n\n<commit_msg>Fix syntax error<commit_after>#include <ros\/ros.h>\n\n#include <ompl\/geometric\/SimpleSetup.h>\n#include <ompl\/geometric\/planners\/rrt\/RRT.h>\n#include <ompl\/base\/spaces\/SE2StateSpace.h>\n\n#include <cmath>\n#include <iostream>\n#include <fstream>\n\nnamespace ob = ompl::base;\nnamespace og = ompl::geometric;\n\nvoid planWithSimpleSetup(){\n    ob::StateSpacePtr space(new ob::SE2StateSpace());\n    ob::RealVectorBounds bounds(2);\n    bounds.setLow(-1);\n    bounds.setHigh(1);\n    space->as<ob::SE2StateSpace>()->setBounds(bounds);\n\n    og::SimpleSetup ss(space);\n\n    \/\/TODO: Set state validity checker\n    \n    ob::ScopedState<ob::SE2StateSpace> start(space);\n    start->setXY(-0.9, -0.9);\n    std::cout << \"start: \"; start.print(std::cout);\n\n    ob::ScopedState<ob::SE2StateSpace> goal(space);\n    goal->setXY(0.9, 0.9);\n    std::cout << \"goal: \"; goal.print(std::cout);\n\n    ss.setStartAndGoalStates(start, goal);\n\n    ob::PlannerPtr planner(new og::PRM(ss.getSpaceInformation()));\n    ss.setPlanner(planner);\n\n    std::cout << \"-----------------\" << std::endl;\n    \n    ob::PlannerStatus solved = ss.solve(1.0);\n\n    if(solved){\n        ss.simplifySolution();\n        std::cout << \"------------\" << std::endl;\n        std::cout << \"Found solution:\" << std::endl;\n        ss.getSolutionPath().print(std::cout);\n\n        std::ofstream ofs(\"path.dat\");\n        ss.getSolutionPath().printAsMatrix(ofs);\n    }else{\n        ROS_ERROR(\"Solution is not found\");\n    }\n}\n\nint main(int argc, char *argv[]){\n    ros::init(argc, argv, \"global_path_planner\");\n    planWithSimpleSetup();\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- clang-format\/ClangFormat.cpp - Clang format tool ------------------===\/\/\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\/\/\/ \\file\n\/\/\/ \\brief This file implements a clang-format tool that automatically formats\n\/\/\/ (fragments of) C++ code.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/Basic\/DiagnosticOptions.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"clang\/Format\/Format.h\"\n#include \"clang\/Lex\/Lexer.h\"\n#include \"clang\/Rewrite\/Core\/Rewriter.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Signals.h\"\n\nusing namespace llvm;\n\nstatic cl::opt<bool> Help(\"h\", cl::desc(\"Alias for -help\"), cl::Hidden);\n\nstatic cl::list<int> Offsets(\n    \"offset\", cl::desc(\"Format a range starting at this file offset.\"));\nstatic cl::list<int> Lengths(\n    \"length\", cl::desc(\"Format a range of this length, -1 for end of file.\"));\nstatic cl::opt<std::string> Style(\n    \"style\",\n    cl::desc(\"Coding style, currently supports: LLVM, Google, Chromium.\"),\n    cl::init(\"LLVM\"));\nstatic cl::opt<bool> Inplace(\"i\",\n                             cl::desc(\"Inplace edit <file>, if specified.\"));\n\nstatic cl::opt<bool> OutputXML(\n    \"output-replacements-xml\", cl::desc(\"Output replacements as XML.\"));\n\n\/\/ FIXME: Remove this when styles are configurable through files.\nstatic cl::opt<bool> InvertPointerBinding(\n    \"invert-pointer-binding\", cl::desc(\"Inverts the side to which *\/& bind\"),\n    cl::init(false));\n\nstatic cl::opt<std::string> FileName(cl::Positional, cl::desc(\"[<file>]\"),\n                                     cl::init(\"-\"));\n\nnamespace clang {\nnamespace format {\n\nstatic FileID createInMemoryFile(StringRef FileName, const MemoryBuffer *Source,\n                                 SourceManager &Sources, FileManager &Files) {\n  const FileEntry *Entry = Files.getVirtualFile(FileName == \"-\" ? \"<stdin>\" :\n                                                    FileName,\n                                                Source->getBufferSize(), 0);\n  Sources.overrideFileContents(Entry, Source, true);\n  return Sources.createFileID(Entry, SourceLocation(), SrcMgr::C_User);\n}\n\nstatic FormatStyle getStyle() {\n  FormatStyle TheStyle = getGoogleStyle();\n  if (Style == \"LLVM\")\n    TheStyle = getLLVMStyle();\n  if (Style == \"Chromium\")\n    TheStyle = getChromiumStyle();\n  if (InvertPointerBinding) {\n    TheStyle.PointerAndReferenceBindToType =\n        !TheStyle.PointerAndReferenceBindToType;\n  }\n  return TheStyle;\n}\n\nstatic void format() {\n  FileManager Files((FileSystemOptions()));\n  DiagnosticsEngine Diagnostics(\n      IntrusiveRefCntPtr<DiagnosticIDs>(new DiagnosticIDs),\n      new DiagnosticOptions);\n  SourceManager Sources(Diagnostics, Files);\n  OwningPtr<MemoryBuffer> Code;\n  if (error_code ec = MemoryBuffer::getFileOrSTDIN(FileName, Code)) {\n    llvm::errs() << ec.message() << \"\\n\";\n    return;\n  }\n  FileID ID = createInMemoryFile(FileName, Code.get(), Sources, Files);\n  Lexer Lex(ID, Sources.getBuffer(ID), Sources, getFormattingLangOpts());\n  if (Offsets.empty())\n    Offsets.push_back(0);\n  if (Offsets.size() != Lengths.size() &&\n      !(Offsets.size() == 1 && Lengths.empty())) {\n    llvm::errs() << \"Number of -offset and -length arguments must match.\\n\";\n    return;\n  }\n  std::vector<CharSourceRange> Ranges;\n  for (cl::list<int>::size_type i = 0, e = Offsets.size(); i != e; ++i) {\n    SourceLocation Start =\n        Sources.getLocForStartOfFile(ID).getLocWithOffset(Offsets[i]);\n    SourceLocation End;\n    if (i < Lengths.size()) {\n      End = Start.getLocWithOffset(Lengths[i]);\n    } else {\n      End = Sources.getLocForEndOfFile(ID);\n    }\n    Ranges.push_back(CharSourceRange::getCharRange(Start, End));\n  }\n  tooling::Replacements Replaces = reformat(getStyle(), Lex, Sources, Ranges);\n  if (OutputXML) {\n    llvm::outs() << \"<?xml version='1.0'?>\\n<replacements xml:space='preserve'>\\n\";\n    for (tooling::Replacements::const_iterator I = Replaces.begin(),\n                                               E = Replaces.end();\n         I != E; ++I) {\n      llvm::outs() << \"<replacement \"\n                   << \"offset='\" << I->getOffset() << \"' \"\n                   << \"length='\" << I->getLength() << \"'>\"\n                   << I->getReplacementText() << \"<\/replacement>\\n\";\n    }\n    llvm::outs() << \"<\/replacements>\\n\";\n  } else {\n    Rewriter Rewrite(Sources, LangOptions());\n    tooling::applyAllReplacements(Replaces, Rewrite);\n    if (Inplace) {\n      if (Replaces.size() == 0)\n        return; \/\/ Nothing changed, don't touch the file.\n\n      std::string ErrorInfo;\n      llvm::raw_fd_ostream FileStream(FileName.c_str(), ErrorInfo,\n                                      llvm::raw_fd_ostream::F_Binary);\n      if (!ErrorInfo.empty()) {\n        llvm::errs() << \"Error while writing file: \" << ErrorInfo << \"\\n\";\n        return;\n      }\n      Rewrite.getEditBuffer(ID).write(FileStream);\n      FileStream.flush();\n    } else {\n      Rewrite.getEditBuffer(ID).write(outs());\n    }\n  }\n}\n\n}  \/\/ namespace format\n}  \/\/ namespace clang\n\nint main(int argc, const char **argv) {\n  llvm::sys::PrintStackTraceOnErrorSignal();\n  cl::ParseCommandLineOptions(\n      argc, argv,\n      \"A tool to format C\/C++\/Obj-C code.\\n\\n\"\n      \"Currently supports LLVM and Google style guides.\\n\"\n      \"If no arguments are specified, it formats the code from standard input\\n\"\n      \"and writes the result to the standard output.\\n\"\n      \"If <file> is given, it reformats the file. If -i is specified together\\n\"\n      \"with <file>, the file is edited in-place. Otherwise, the result is\\n\"\n      \"written to the standard output.\\n\");\n  if (Help)\n    cl::PrintHelpMessage();\n  clang::format::format();\n  return 0;\n}\n<commit_msg>Remove superseeded option.<commit_after>\/\/===-- clang-format\/ClangFormat.cpp - Clang format tool ------------------===\/\/\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\/\/\/ \\file\n\/\/\/ \\brief This file implements a clang-format tool that automatically formats\n\/\/\/ (fragments of) C++ code.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/Basic\/DiagnosticOptions.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"clang\/Format\/Format.h\"\n#include \"clang\/Lex\/Lexer.h\"\n#include \"clang\/Rewrite\/Core\/Rewriter.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Signals.h\"\n\nusing namespace llvm;\n\nstatic cl::opt<bool> Help(\"h\", cl::desc(\"Alias for -help\"), cl::Hidden);\n\nstatic cl::list<int> Offsets(\n    \"offset\", cl::desc(\"Format a range starting at this file offset.\"));\nstatic cl::list<int> Lengths(\n    \"length\", cl::desc(\"Format a range of this length, -1 for end of file.\"));\nstatic cl::opt<std::string> Style(\n    \"style\",\n    cl::desc(\"Coding style, currently supports: LLVM, Google, Chromium.\"),\n    cl::init(\"LLVM\"));\nstatic cl::opt<bool> Inplace(\"i\",\n                             cl::desc(\"Inplace edit <file>, if specified.\"));\n\nstatic cl::opt<bool> OutputXML(\n    \"output-replacements-xml\", cl::desc(\"Output replacements as XML.\"));\n\nstatic cl::opt<std::string> FileName(cl::Positional, cl::desc(\"[<file>]\"),\n                                     cl::init(\"-\"));\n\nnamespace clang {\nnamespace format {\n\nstatic FileID createInMemoryFile(StringRef FileName, const MemoryBuffer *Source,\n                                 SourceManager &Sources, FileManager &Files) {\n  const FileEntry *Entry = Files.getVirtualFile(FileName == \"-\" ? \"<stdin>\" :\n                                                    FileName,\n                                                Source->getBufferSize(), 0);\n  Sources.overrideFileContents(Entry, Source, true);\n  return Sources.createFileID(Entry, SourceLocation(), SrcMgr::C_User);\n}\n\nstatic FormatStyle getStyle() {\n  FormatStyle TheStyle = getGoogleStyle();\n  if (Style == \"LLVM\")\n    TheStyle = getLLVMStyle();\n  if (Style == \"Chromium\")\n    TheStyle = getChromiumStyle();\n  return TheStyle;\n}\n\nstatic void format() {\n  FileManager Files((FileSystemOptions()));\n  DiagnosticsEngine Diagnostics(\n      IntrusiveRefCntPtr<DiagnosticIDs>(new DiagnosticIDs),\n      new DiagnosticOptions);\n  SourceManager Sources(Diagnostics, Files);\n  OwningPtr<MemoryBuffer> Code;\n  if (error_code ec = MemoryBuffer::getFileOrSTDIN(FileName, Code)) {\n    llvm::errs() << ec.message() << \"\\n\";\n    return;\n  }\n  FileID ID = createInMemoryFile(FileName, Code.get(), Sources, Files);\n  Lexer Lex(ID, Sources.getBuffer(ID), Sources, getFormattingLangOpts());\n  if (Offsets.empty())\n    Offsets.push_back(0);\n  if (Offsets.size() != Lengths.size() &&\n      !(Offsets.size() == 1 && Lengths.empty())) {\n    llvm::errs() << \"Number of -offset and -length arguments must match.\\n\";\n    return;\n  }\n  std::vector<CharSourceRange> Ranges;\n  for (cl::list<int>::size_type i = 0, e = Offsets.size(); i != e; ++i) {\n    SourceLocation Start =\n        Sources.getLocForStartOfFile(ID).getLocWithOffset(Offsets[i]);\n    SourceLocation End;\n    if (i < Lengths.size()) {\n      End = Start.getLocWithOffset(Lengths[i]);\n    } else {\n      End = Sources.getLocForEndOfFile(ID);\n    }\n    Ranges.push_back(CharSourceRange::getCharRange(Start, End));\n  }\n  tooling::Replacements Replaces = reformat(getStyle(), Lex, Sources, Ranges);\n  if (OutputXML) {\n    llvm::outs() << \"<?xml version='1.0'?>\\n<replacements xml:space='preserve'>\\n\";\n    for (tooling::Replacements::const_iterator I = Replaces.begin(),\n                                               E = Replaces.end();\n         I != E; ++I) {\n      llvm::outs() << \"<replacement \"\n                   << \"offset='\" << I->getOffset() << \"' \"\n                   << \"length='\" << I->getLength() << \"'>\"\n                   << I->getReplacementText() << \"<\/replacement>\\n\";\n    }\n    llvm::outs() << \"<\/replacements>\\n\";\n  } else {\n    Rewriter Rewrite(Sources, LangOptions());\n    tooling::applyAllReplacements(Replaces, Rewrite);\n    if (Inplace) {\n      if (Replaces.size() == 0)\n        return; \/\/ Nothing changed, don't touch the file.\n\n      std::string ErrorInfo;\n      llvm::raw_fd_ostream FileStream(FileName.c_str(), ErrorInfo,\n                                      llvm::raw_fd_ostream::F_Binary);\n      if (!ErrorInfo.empty()) {\n        llvm::errs() << \"Error while writing file: \" << ErrorInfo << \"\\n\";\n        return;\n      }\n      Rewrite.getEditBuffer(ID).write(FileStream);\n      FileStream.flush();\n    } else {\n      Rewrite.getEditBuffer(ID).write(outs());\n    }\n  }\n}\n\n}  \/\/ namespace format\n}  \/\/ namespace clang\n\nint main(int argc, const char **argv) {\n  llvm::sys::PrintStackTraceOnErrorSignal();\n  cl::ParseCommandLineOptions(\n      argc, argv,\n      \"A tool to format C\/C++\/Obj-C code.\\n\\n\"\n      \"Currently supports LLVM and Google style guides.\\n\"\n      \"If no arguments are specified, it formats the code from standard input\\n\"\n      \"and writes the result to the standard output.\\n\"\n      \"If <file> is given, it reformats the file. If -i is specified together\\n\"\n      \"with <file>, the file is edited in-place. Otherwise, the result is\\n\"\n      \"written to the standard output.\\n\");\n  if (Help)\n    cl::PrintHelpMessage();\n  clang::format::format();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* LibMemcached\n * Copyright (C) 2006-2009 Brian Aker\n * All rights reserved.\n *\n * Use and distribution licensed under the BSD license.  See\n * the COPYING file in the parent directory for full text.\n *\n * Summary: String structure used for libmemcached.\n *\n *\/\n\n\/*\n  This is a partial implementation for fetching\/creating memcached_server_st objects.\n*\/\n#include <libmemcached\/common.h>\n\nstatic inline void _server_init(memcached_server_st *self, const memcached_st *root,\n                                const char *hostname, in_port_t port,\n                                uint32_t weight, memcached_connection_t type)\n{\n  self->options.is_shutting_down= false;\n  self->options.is_dead= false;\n  self->number_of_hosts= 0;\n  self->cursor_active= 0;\n  self->port= port;\n  self->cached_errno= 0;\n  self->fd= -1;\n  self->io_bytes_sent= 0;\n  self->server_failure_counter= 0;\n  self->weight= weight ? weight : 1; \/\/ 1 is the default weight value\n  WATCHPOINT_SET(self->io_wait_count.read= 0);\n  WATCHPOINT_SET(self->io_wait_count.write= 0);\n  self->major_version= UINT8_MAX;\n  self->micro_version= UINT8_MAX;\n  self->minor_version= UINT8_MAX;\n  self->type= type;\n  self->read_ptr= self->read_buffer;\n  self->cached_server_error= NULL;\n  self->read_buffer_length= 0;\n  self->read_data_length= 0;\n  self->write_buffer_offset= 0;\n  self->address_info= NULL;\n  self->address_info_next= NULL;\n\n  if (root)\n  {\n    self->next_retry= root->retry_timeout;\n  }\n  else\n  {\n    self->next_retry= 0;\n  }\n\n  self->root= root;\n  self->limit_maxbytes= 0;\n  if (hostname == NULL)\n  {\n    self->hostname[0]= 0;\n  }\n  else\n  {\n    strncpy(self->hostname, hostname, NI_MAXHOST - 1);\n  }\n}\n\nstatic memcached_server_st *_server_create(memcached_server_st *self, const memcached_st *memc)\n{\n  if (self == NULL)\n  {\n   self= (memcached_server_st *)libmemcached_malloc(memc, sizeof(memcached_server_st));\n\n    if (! self)\n      return NULL; \/*  MEMCACHED_MEMORY_ALLOCATION_FAILURE *\/\n\n    self->options.is_allocated= true;\n  }\n  else\n  {\n    self->options.is_allocated= false;\n  }\n\n  self->options.is_initialized= true;\n\n  return self;\n}\n\nmemcached_server_st *memcached_server_create_with(const memcached_st *memc,\n                                                  memcached_server_write_instance_st self,\n                                                  const char *hostname, in_port_t port,\n                                                  uint32_t weight, memcached_connection_t type)\n{\n  self= _server_create(self, memc);\n\n  if (self == NULL)\n    return NULL;\n\n  _server_init(self, memc, hostname, port, weight, type);\n\n\n  if (type == MEMCACHED_CONNECTION_UDP)\n  {\n    self->write_buffer_offset= UDP_DATAGRAM_HEADER_LENGTH;\n    memcached_io_init_udp_header(self, 0);\n  }\n\n  return self;\n}\n\nvoid memcached_server_free(memcached_server_st *self)\n{\n  memcached_quit_server(self, false);\n\n  if (self->cached_server_error)\n    free(self->cached_server_error);\n\n  if (self->address_info)\n    freeaddrinfo(self->address_info);\n\n  if (memcached_is_allocated(self))\n  {\n    if (self->root)\n    {\n      libmemcached_free(self->root, self);\n    }\n    else\n    {\n      free(self);\n    }\n  }\n  else\n  {\n    self->options.is_initialized= false;\n  }\n}\n\n\/*\n  If we do not have a valid object to clone from, we toss an error.\n*\/\nmemcached_server_st *memcached_server_clone(memcached_server_st *destination,\n                                            const memcached_server_st *source)\n{\n  \/* We just do a normal create if source is missing *\/\n  if (source == NULL)\n    return NULL;\n\n  destination= memcached_server_create_with(source->root, destination,\n                                            source->hostname, source->port, source->weight,\n                                            source->type);\n  if (destination != NULL)\n  {\n    destination->cached_errno= source->cached_errno;\n\n    if (source->cached_server_error)\n      destination->cached_server_error= strdup(source->cached_server_error);\n  }\n\n  return destination;\n\n}\n\nmemcached_return_t memcached_server_cursor(const memcached_st *ptr,\n                                           const memcached_server_fn *callback,\n                                           void *context,\n                                           uint32_t number_of_callbacks)\n{\n  memcached_return_t rc;\n  if ((rc= initialize_const_query(ptr)) != MEMCACHED_SUCCESS)\n  {\n    return rc;\n  }\n\n  for (uint32_t x= 0; x < memcached_server_count(ptr); x++)\n  {\n    memcached_server_instance_st instance=\n      memcached_server_instance_by_position(ptr, x);\n\n    for (uint32_t y= 0; y < number_of_callbacks; y++)\n    {\n      unsigned int iferror;\n\n      iferror= (*callback[y])(ptr, instance, context);\n\n      if (iferror)\n        continue;\n    }\n  }\n\n  return MEMCACHED_SUCCESS;\n}\n\nmemcached_return_t memcached_server_execute(memcached_st *ptr,\n                                            memcached_server_execute_fn callback,\n                                            void *context)\n{\n  for (uint32_t x= 0; x < memcached_server_count(ptr); x++)\n  {\n    memcached_server_write_instance_st instance=\n      memcached_server_instance_fetch(ptr, x);\n\n    unsigned int iferror;\n\n    iferror= (*callback)(ptr, instance, context);\n\n    if (iferror)\n      continue;\n  }\n\n  return MEMCACHED_SUCCESS;\n}\n\nmemcached_server_instance_st memcached_server_by_key(const memcached_st *ptr,\n                                                     const char *key,\n                                                     size_t key_length,\n                                                     memcached_return_t *error)\n{\n  memcached_return_t rc;\n  if (memcached_failed(rc= initialize_const_query(ptr)))\n  {\n    if (error)\n      *error= rc;\n\n    return NULL;\n  }\n\n  if (memcached_failed(rc= memcached_validate_key_length(key_length, ptr->flags.binary_protocol)))\n  {\n    if (error)\n      *error= rc;\n\n    return NULL;\n  }\n\n  if (ptr->flags.verify_key && (memcached_key_test((const char **)&key, &key_length, 1) == MEMCACHED_BAD_KEY_PROVIDED))\n  {\n    if (error)\n      *error= MEMCACHED_BAD_KEY_PROVIDED;\n    return NULL;\n  }\n\n  uint32_t server_key= memcached_generate_hash(ptr, key, key_length);\n  return memcached_server_instance_by_position(ptr, server_key);\n\n}\n\nvoid memcached_server_error_reset(memcached_server_st *self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return;\n\n  self->cached_server_error[0]= 0;\n}\n\nmemcached_server_instance_st memcached_server_get_last_disconnect(const memcached_st *self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return 0;\n\n  return self->last_disconnected_server;\n}\n\nvoid memcached_server_list_free(memcached_server_list_st self)\n{\n  if (not self)\n    return;\n\n  for (uint32_t x= 0; x < memcached_server_list_count(self); x++)\n  {\n    if (self[x].address_info)\n    {\n      freeaddrinfo(self[x].address_info);\n      self[x].address_info= NULL;\n    }\n  }\n\n  const memcached_st *root= self->root;\n  if (root)\n  {\n    libmemcached_free(root, self);\n  }\n  else\n  {\n    free(self);\n  }\n}\n\nuint32_t memcached_servers_set_count(memcached_server_st *servers, uint32_t count)\n{\n  WATCHPOINT_ASSERT(servers);\n  if (not servers)\n    return 0;\n\n  return servers->number_of_hosts= count;\n}\n\nuint32_t memcached_server_count(const memcached_st *self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return 0;\n\n  return self->number_of_hosts;\n}\n\nconst char *memcached_server_name(memcached_server_instance_st self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return NULL;\n\n  return self->hostname;\n}\n\nin_port_t memcached_server_port(memcached_server_instance_st self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return 0;\n\n  return self->port;\n}\n\nuint32_t memcached_server_response_count(memcached_server_instance_st self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return 0;\n\n  return self->cursor_active;\n}\n\nconst char *memcached_server_error(memcached_server_instance_st ptr)\n{\n  return ptr ?  ptr->cached_server_error : NULL;\n}\n\n<commit_msg>Small style cleanup<commit_after>\/*  vim:expandtab:shiftwidth=2:tabstop=2:smarttab:\n * \n *  Libmemcached library\n *\n *  Copyright (C) 2011 Data Differential, http:\/\/datadifferential.com\/\n *  Copyright (C) 2006-2009 Brian Aker 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\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 *\n *      * The names of its contributors may not 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\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  This is a partial implementation for fetching\/creating memcached_server_st objects.\n*\/\n#include <libmemcached\/common.h>\n#include <cassert>\n\nstatic inline void _server_init(memcached_server_st *self, const memcached_st *root,\n                                const char *hostname, in_port_t port,\n                                uint32_t weight, memcached_connection_t type)\n{\n  self->options.is_shutting_down= false;\n  self->options.is_dead= false;\n  self->number_of_hosts= 0;\n  self->cursor_active= 0;\n  self->port= port;\n  self->cached_errno= 0;\n  self->fd= -1;\n  self->io_bytes_sent= 0;\n  self->server_failure_counter= 0;\n  self->weight= weight ? weight : 1; \/\/ 1 is the default weight value\n  WATCHPOINT_SET(self->io_wait_count.read= 0);\n  WATCHPOINT_SET(self->io_wait_count.write= 0);\n  self->major_version= UINT8_MAX;\n  self->micro_version= UINT8_MAX;\n  self->minor_version= UINT8_MAX;\n  self->type= type;\n  self->read_ptr= self->read_buffer;\n  self->cached_server_error= NULL;\n  self->read_buffer_length= 0;\n  self->read_data_length= 0;\n  self->write_buffer_offset= 0;\n  self->address_info= NULL;\n  self->address_info_next= NULL;\n\n  if (root)\n  {\n    self->next_retry= root->retry_timeout;\n  }\n  else\n  {\n    self->next_retry= 0;\n  }\n\n  self->root= root;\n  self->limit_maxbytes= 0;\n  if (hostname == NULL)\n  {\n    self->hostname[0]= 0;\n  }\n  else\n  {\n    strncpy(self->hostname, hostname, NI_MAXHOST - 1);\n  }\n}\n\nstatic memcached_server_st *_server_create(memcached_server_st *self, const memcached_st *memc)\n{\n  if (self == NULL)\n  {\n   self= (memcached_server_st *)libmemcached_malloc(memc, sizeof(memcached_server_st));\n\n    if (! self)\n      return NULL; \/*  MEMCACHED_MEMORY_ALLOCATION_FAILURE *\/\n\n    self->options.is_allocated= true;\n  }\n  else\n  {\n    self->options.is_allocated= false;\n  }\n\n  self->options.is_initialized= true;\n\n  return self;\n}\n\nmemcached_server_st *memcached_server_create_with(const memcached_st *memc,\n                                                  memcached_server_write_instance_st self,\n                                                  const char *hostname, in_port_t port,\n                                                  uint32_t weight, memcached_connection_t type)\n{\n  self= _server_create(self, memc);\n\n  if (self == NULL)\n    return NULL;\n\n  _server_init(self, memc, hostname, port, weight, type);\n\n\n  if (type == MEMCACHED_CONNECTION_UDP)\n  {\n    self->write_buffer_offset= UDP_DATAGRAM_HEADER_LENGTH;\n    memcached_io_init_udp_header(self, 0);\n  }\n\n  return self;\n}\n\nvoid memcached_server_free(memcached_server_st *self)\n{\n  assert(self);\n  memcached_quit_server(self, false);\n\n  if (self->cached_server_error)\n    free(self->cached_server_error);\n\n  if (self->address_info)\n    freeaddrinfo(self->address_info);\n\n  if (memcached_is_allocated(self))\n  {\n    if (self->root)\n    {\n      libmemcached_free(self->root, self);\n    }\n    else\n    {\n      free(self);\n    }\n  }\n  else\n  {\n    self->options.is_initialized= false;\n  }\n}\n\n\/*\n  If we do not have a valid object to clone from, we toss an error.\n*\/\nmemcached_server_st *memcached_server_clone(memcached_server_st *destination,\n                                            const memcached_server_st *source)\n{\n  \/* We just do a normal create if source is missing *\/\n  if (not source)\n    return NULL;\n\n  destination= memcached_server_create_with(source->root, destination,\n                                            source->hostname, source->port, source->weight,\n                                            source->type);\n  if (destination != NULL)\n  {\n    destination->cached_errno= source->cached_errno;\n\n    if (source->cached_server_error)\n      destination->cached_server_error= strdup(source->cached_server_error);\n  }\n\n  return destination;\n\n}\n\nmemcached_return_t memcached_server_cursor(const memcached_st *ptr,\n                                           const memcached_server_fn *callback,\n                                           void *context,\n                                           uint32_t number_of_callbacks)\n{\n  memcached_return_t rc;\n  if (memcached_failed(rc= initialize_const_query(ptr)))\n  {\n    return rc;\n  }\n\n  for (uint32_t x= 0; x < memcached_server_count(ptr); x++)\n  {\n    memcached_server_instance_st instance=\n      memcached_server_instance_by_position(ptr, x);\n\n    for (uint32_t y= 0; y < number_of_callbacks; y++)\n    {\n      unsigned int iferror;\n\n      iferror= (*callback[y])(ptr, instance, context);\n\n      if (iferror)\n        continue;\n    }\n  }\n\n  return MEMCACHED_SUCCESS;\n}\n\nmemcached_return_t memcached_server_execute(memcached_st *ptr,\n                                            memcached_server_execute_fn callback,\n                                            void *context)\n{\n  for (uint32_t x= 0; x < memcached_server_count(ptr); x++)\n  {\n    memcached_server_write_instance_st instance= memcached_server_instance_fetch(ptr, x);\n\n    unsigned int iferror= (*callback)(ptr, instance, context);\n\n    if (iferror)\n      continue;\n  }\n\n  return MEMCACHED_SUCCESS;\n}\n\nmemcached_server_instance_st memcached_server_by_key(const memcached_st *ptr,\n                                                     const char *key,\n                                                     size_t key_length,\n                                                     memcached_return_t *error)\n{\n  memcached_return_t rc;\n  memcached_return_t unused;\n\n  if (not error)\n    error= &unused;\n\n  if (memcached_failed(rc= initialize_const_query(ptr)))\n  {\n    *error= rc;\n    return NULL;\n  }\n\n  if (memcached_failed(rc= memcached_validate_key_length(key_length, ptr->flags.binary_protocol)))\n  {\n    *error= rc;\n    return NULL;\n  }\n\n  if (ptr->flags.verify_key && (memcached_key_test((const char **)&key, &key_length, 1) == MEMCACHED_BAD_KEY_PROVIDED))\n  {\n    *error= MEMCACHED_BAD_KEY_PROVIDED;\n    return NULL;\n  }\n\n  uint32_t server_key= memcached_generate_hash(ptr, key, key_length);\n  return memcached_server_instance_by_position(ptr, server_key);\n\n}\n\nvoid memcached_server_error_reset(memcached_server_st *self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return;\n\n  self->cached_server_error[0]= 0;\n}\n\nmemcached_server_instance_st memcached_server_get_last_disconnect(const memcached_st *self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return 0;\n\n  return self->last_disconnected_server;\n}\n\nvoid memcached_server_list_free(memcached_server_list_st self)\n{\n  if (not self)\n    return;\n\n  for (uint32_t x= 0; x < memcached_server_list_count(self); x++)\n  {\n    if (self[x].address_info)\n    {\n      freeaddrinfo(self[x].address_info);\n      self[x].address_info= NULL;\n    }\n  }\n\n  const memcached_st *root= self->root;\n  if (root)\n  {\n    libmemcached_free(root, self);\n  }\n  else\n  {\n    free(self);\n  }\n}\n\nuint32_t memcached_servers_set_count(memcached_server_st *servers, uint32_t count)\n{\n  WATCHPOINT_ASSERT(servers);\n  if (not servers)\n    return 0;\n\n  return servers->number_of_hosts= count;\n}\n\nuint32_t memcached_server_count(const memcached_st *self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return 0;\n\n  return self->number_of_hosts;\n}\n\nconst char *memcached_server_name(memcached_server_instance_st self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return NULL;\n\n  return self->hostname;\n}\n\nin_port_t memcached_server_port(memcached_server_instance_st self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return 0;\n\n  return self->port;\n}\n\nuint32_t memcached_server_response_count(memcached_server_instance_st self)\n{\n  WATCHPOINT_ASSERT(self);\n  if (not self)\n    return 0;\n\n  return self->cursor_active;\n}\n\nconst char *memcached_server_error(memcached_server_instance_st ptr)\n{\n  return ptr ?  ptr->cached_server_error : NULL;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <cstring>\n\n#include \"common\/json.h\"\n#include \"client.h\"\n#include \"error_page.h\"\n#include \"orchestrator.h\"\n#include \"file.h\"\n\n\/* Constants *\/\n#define BUF_MAXLEN\t1024\n\n\nCClient::CClient(CSocket *_Socket, FileLogger *_log) {\n\t\/* Set the client socket *\/\n\tSocket = _Socket;\n\tlogger = _log;\n}\n\nCClient::~CClient() {\n\t\/* Disconnect client *\/\n\tDisconnect();\n\n\t\/* Delete socket *\/\n\tdelete Socket;\n}\n\nvoid CClient::Disconnect() {\n\t\/* Destroy socket *\/\n\tSocket->Destroy();\n}\n\nstd::string CClient::Remote() {\n\treturn Socket->RemoteAddr() + ':' + Socket->RemotePort();\n}\n\nint CClient::Read(void *buffer, size_t len) {\n\t\/* Receive data *\/\n\treturn Socket->Receive(buffer, len);\n}\n\nint CClient::Write(const void *buffer, size_t len) {\n\tunsigned char *ptr = (unsigned char *)buffer;\n\n\tsize_t  cnt = 0;\n\tssize_t res;\n\n\t\/* Write loop *\/\n\twhile (cnt < len) {\n\t\t\/* Send data *\/\n\t\tres = Socket->Send(ptr + cnt, len - cnt);\n\n\t\t\/* Check result *\/\n\t\tif (res == -1)\n\t\t\treturn res;\n\t\tif (res == 0)\n\t\t\tbreak;\n\n\t\t\/* Increment counter *\/\n\t\tcnt += res;\n\t}\n\n\treturn cnt;\n}\n\nint CClient::ReadLoop(void *buffer, size_t len) {\n\tunsigned char *ptr = (unsigned char *)buffer;\n\n\tsize_t  cnt = 0;\n\tssize_t res;\n\n\t\/* Read loop *\/\n\twhile (cnt < len) {\n\t\t\/* Receive data *\/\n\t\tres = Socket->Receive(ptr + cnt, len - cnt);\n\n\t\t\/* Check result *\/\n\t\tif (res == -1)\n\t\t\treturn res;\n\t\tif (res == 0)\n\t\t\tbreak;\n\n\t\t\/* Increment counter *\/\n\t\tcnt += res;\n\t}\n\n\treturn cnt;\n}\n\nbool CClient::SendHtml(const void *buffer, size_t len, int reply) {\n\tCHeader Header;\n\n\tssize_t res;\n\tbool    ret;\n\n\t\/* Setup header *\/\n\tHeader.AddReply(reply);\n\tHeader.AddType(\"text\/html; charset=UTF-8\");\n\tHeader.Set(\"X-Content-Type-Options: nosniff\\r\\n\");\n\tHeader.Set(\"X-Frame-Options: deny\\r\\n\");\n\tHeader.Set(\"X-XSS-Protection: 1; mode=block\\r\\n\");\n\tHeader.AddAdditional();\n\n\tHeader.AddDate();\n\tHeader.AddServer();\n\tif (len > 0)\n\t\tHeader.AddLength(len);\n\tHeader.AddEnd();\n\n\t\/* Send header *\/\n\tret = SendHeader(Header);\n\tif (!ret)\n\t\treturn false;\n\n\t\/* Send data *\/\n\tif (len > 0) {\n\t\tres = Write(buffer, len);\n\t\tif (res <= 0)\n\t\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool CClient::SendRedirect(const std::string& location) {\n\tCHeader Header;\n\tbool    ret;\n\n\t\/* Setup header *\/\n\tHeader.AddReply(REPLY_REDIR_PER);\n\tHeader.AddLocation(location);\n\tHeader.AddAdditional();\n\tHeader.AddDate();\n\tHeader.AddServer();\n\tHeader.AddEnd();\n\n\t\/* Send header *\/\n\tret = SendHeader(Header);\n\tif (!ret)\n\t\treturn false;\n\n\treturn true;\n}\n\nbool CClient::SendHeader(CHeader &Header) {\n\tstd::string  hdr;\n\tint len, res;\n\n\t\/* Generate header *\/\n\thdr = Header.Generate();\n\tlen = hdr.length();\n\n\t\/* Send header *\/\n\tres = Write(hdr.c_str(), len);\n\tif (res != len)\n\t\treturn false;\n\n\treturn true;\n}\n\nbool CClient::ParseUri(std::string filepath) {\n\tconst std::string service(\"\/core::foundation::rpc::service\");\n\tconst std::string webledge(\"\/core::webledge::\");\n\n\tif (!filepath.compare(0, service.size(), service)) {\n\t\tCHeader \tHeader;\n\t\tconst char *buffer;\n\t\tsize_t      len, res;\n\t\tnlohmann::json object;\n\n\t\tobject[\"active\"] = true;\n\t\tobject[\"operation\"] = \"default\";\n\t\tobject[\"type\"] = \"jsonrpc\";\n\t\tobject[\"success\"] = true;\n\t\tobject[\"message\"] = nullptr;\n\t\tobject[\"parameters\"] = {\"calls\", {\n\t\t\t{\"status\", \"Server status\"},\n\t\t\t{\"solicit\", \"Register instance\"}\n\t\t}};\n\t\tstd::string s = object.dump(4);\n\n\t\tbuffer = s.c_str();\n\t\tlen    = s.length();\n\n\t\t\/* Setup header *\/\n\t\tHeader.AddReply(REPLY_OK);\n\t\tHeader.AddType(\"application\/json\");\n\t\tHeader.AddDate();\n\t\tHeader.AddServer();\n\t\tHeader.AddConnection(false);\n\t\tHeader.AddLength(len);\n\t\tHeader.Set(\"Access-Control-Allow-Origin: *\\r\\n\");\n\t\tHeader.AddAdditional();\n\t\tHeader.AddEnd();\n\n\t\t\/* Send header *\/\n\t\tres = SendHeader(Header);\n\t\tif (!res)\n\t\t\treturn false;\n\n\t\t\/* Send data *\/\n\t\tif (len > 0) {\n\t\t\tres = Write(buffer, len);\n\t\t\tif (res <= 0)\n\t\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tif (!filepath.compare(0, webledge.size(), webledge)) {\n\t\tstd::string dir = filepath.substr(webledge.size()).c_str();\n\t\tif (!dir.empty()) {\n\t\t\tstd::string subdir = \"\";\n\n\t\t\tsize_t index;\n\t\t\twhile ((index = dir.find(\"::\")) != std::string::npos)\n\t\t\t\tdir.replace(index, 2, \"\/\");\n\n  \t\t\tdir.substr(0, dir.find_last_of('#'));\n\n\t\t\tSendFile(dir);\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tSendFile(\"index.html\");\n\n\t\treturn true;\n\t}\n\n\tif (!filepath.compare(\"\/favicon.ico\") || !filepath.compare(\"\/sitemap.xml\")) {\n\t\tHandleError(REPLY_NOENT);\n\t\t\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nbool CClient::SendFile(std::string filepath) {\n\treturn SendFile(filepath.c_str());\n}\n\nbool CClient::SendFile(const char *filepath) {\n\tCFile   File;\n\tCHeader Header;\n\n\tchar   buffer[BUF_MAXLEN];\n\tsize_t len;\n\tbool   res;\n\n\t\/* Open file *\/\n\tres = File.Open(filepath);\n\n\t\/* File not found *\/\n\tif (!res) {\n\t\t\/* Handle error *\/\n\t\tHandleError(REPLY_NOENT);\n\t\tgoto out;\n\t}\n\n\t\/* Get file size *\/\n\tlen = File.Size();\n\n\t\/* No contents? *\/\n\tif (!len) {\n\t\t\/* Handle error *\/\n\t\tHandleError(REPLY_INTERR);\n\n\t\tres = false;\n\t\tgoto out;\n\t}\n\n\t\/* Setup header *\/\n\tHeader.AddReply(REPLY_OK);\n\tHeader.AddType(File.Type());\n\tHeader.AddDate();\n\tHeader.AddServer();\n\tHeader.AddAdditional();\n\tHeader.AddLength(len);\n\tHeader.AddEnd();\n\n\t\/* Send header *\/\n\tres = SendHeader(Header);\n\tif (!res)\n\t\tgoto out;\n\n\t\/* Read loop *\/\n\twhile (len) {\n\t\tssize_t ret, size;\n\n\t\t\/* Block size *\/\n\t\tsize = (len > BUF_MAXLEN) ? BUF_MAXLEN : len;\n\n\t\t\/* Read block *\/\n\t\tres = File.Read(buffer, size);\n\t\tif (!res)\n\t\t\tbreak;\n\n\t\t\/* Send block *\/\n\t\tret = Write(buffer, size);\n\t\tif (ret != size) {\n\t\t\tres = false;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/* Update length *\/\n\t\tlen -= size;\n\t}\n\nout:\n\t\/* Close file *\/\n\tFile.Close();\n\n\treturn res;\n}\n\nbool CClient::RecvRequest(CHeader &Header) {\n\tchar   *buffer;\n\tssize_t res;\n\n\t\/* Allocate buffer *\/\n\tbuffer = new char[HDR_MAXLEN];\n\tif (!buffer)\n\t\treturn false;\n\n\t\/* Read data *\/\n\tres = Read(buffer, HDR_MAXLEN);\n\n\t\/* Set header string *\/\n\tif (res > 0)\n\t\tHeader.Set(buffer);\n\n\t\/* Delete buffer *\/\n\tdelete buffer;\n\n\treturn (res > 0) ? true : false;\n}\n\nbool CClient::HandleError(int reply) {\n\tconst char *buffer;\n\tsize_t      len;\n\n\tstd::string data;\n\n\t\/* Get the error page *\/\n\tdata = CErrorPage::Get(reply);\n\n\t\/* Set buffer *\/\n\tbuffer = data.c_str();\n\tlen    = data.length();\n\n\t\/* Send reply *\/\n\treturn SendHtml(buffer, len, reply);\n}\n\n<commit_msg>Correct dealloc<commit_after>#include <iostream>\n#include <fstream>\n#include <cstring>\n\n#include \"common\/json.h\"\n#include \"client.h\"\n#include \"error_page.h\"\n#include \"orchestrator.h\"\n#include \"file.h\"\n\n\/* Constants *\/\n#define BUF_MAXLEN\t1024\n\n\nCClient::CClient(CSocket *_Socket, FileLogger *_log) {\n\t\/* Set the client socket *\/\n\tSocket = _Socket;\n\tlogger = _log;\n}\n\nCClient::~CClient() {\n\t\/* Disconnect client *\/\n\tDisconnect();\n\n\t\/* Delete socket *\/\n\tdelete Socket;\n}\n\nvoid CClient::Disconnect() {\n\t\/* Destroy socket *\/\n\tSocket->Destroy();\n}\n\nstd::string CClient::Remote() {\n\treturn Socket->RemoteAddr() + ':' + Socket->RemotePort();\n}\n\nint CClient::Read(void *buffer, size_t len) {\n\t\/* Receive data *\/\n\treturn Socket->Receive(buffer, len);\n}\n\nint CClient::Write(const void *buffer, size_t len) {\n\tunsigned char *ptr = (unsigned char *)buffer;\n\n\tsize_t  cnt = 0;\n\tssize_t res;\n\n\t\/* Write loop *\/\n\twhile (cnt < len) {\n\t\t\/* Send data *\/\n\t\tres = Socket->Send(ptr + cnt, len - cnt);\n\n\t\t\/* Check result *\/\n\t\tif (res == -1)\n\t\t\treturn res;\n\t\tif (res == 0)\n\t\t\tbreak;\n\n\t\t\/* Increment counter *\/\n\t\tcnt += res;\n\t}\n\n\treturn cnt;\n}\n\nint CClient::ReadLoop(void *buffer, size_t len) {\n\tunsigned char *ptr = (unsigned char *)buffer;\n\n\tsize_t  cnt = 0;\n\tssize_t res;\n\n\t\/* Read loop *\/\n\twhile (cnt < len) {\n\t\t\/* Receive data *\/\n\t\tres = Socket->Receive(ptr + cnt, len - cnt);\n\n\t\t\/* Check result *\/\n\t\tif (res == -1)\n\t\t\treturn res;\n\t\tif (res == 0)\n\t\t\tbreak;\n\n\t\t\/* Increment counter *\/\n\t\tcnt += res;\n\t}\n\n\treturn cnt;\n}\n\nbool CClient::SendHtml(const void *buffer, size_t len, int reply) {\n\tCHeader Header;\n\n\tssize_t res;\n\tbool    ret;\n\n\t\/* Setup header *\/\n\tHeader.AddReply(reply);\n\tHeader.AddType(\"text\/html; charset=UTF-8\");\n\tHeader.Set(\"X-Content-Type-Options: nosniff\\r\\n\");\n\tHeader.Set(\"X-Frame-Options: deny\\r\\n\");\n\tHeader.Set(\"X-XSS-Protection: 1; mode=block\\r\\n\");\n\tHeader.AddAdditional();\n\n\tHeader.AddDate();\n\tHeader.AddServer();\n\tif (len > 0)\n\t\tHeader.AddLength(len);\n\tHeader.AddEnd();\n\n\t\/* Send header *\/\n\tret = SendHeader(Header);\n\tif (!ret)\n\t\treturn false;\n\n\t\/* Send data *\/\n\tif (len > 0) {\n\t\tres = Write(buffer, len);\n\t\tif (res <= 0)\n\t\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool CClient::SendRedirect(const std::string& location) {\n\tCHeader Header;\n\tbool    ret;\n\n\t\/* Setup header *\/\n\tHeader.AddReply(REPLY_REDIR_PER);\n\tHeader.AddLocation(location);\n\tHeader.AddAdditional();\n\tHeader.AddDate();\n\tHeader.AddServer();\n\tHeader.AddEnd();\n\n\t\/* Send header *\/\n\tret = SendHeader(Header);\n\tif (!ret)\n\t\treturn false;\n\n\treturn true;\n}\n\nbool CClient::SendHeader(CHeader &Header) {\n\tstd::string  hdr;\n\tint len, res;\n\n\t\/* Generate header *\/\n\thdr = Header.Generate();\n\tlen = hdr.length();\n\n\t\/* Send header *\/\n\tres = Write(hdr.c_str(), len);\n\tif (res != len)\n\t\treturn false;\n\n\treturn true;\n}\n\nbool CClient::ParseUri(std::string filepath) {\n\tconst std::string service(\"\/core::foundation::rpc::service\");\n\tconst std::string webledge(\"\/core::webledge::\");\n\n\tif (!filepath.compare(0, service.size(), service)) {\n\t\tCHeader \tHeader;\n\t\tconst char *buffer;\n\t\tsize_t      len, res;\n\t\tnlohmann::json object;\n\n\t\tobject[\"active\"] = true;\n\t\tobject[\"operation\"] = \"default\";\n\t\tobject[\"type\"] = \"jsonrpc\";\n\t\tobject[\"success\"] = true;\n\t\tobject[\"message\"] = nullptr;\n\t\tobject[\"parameters\"] = {\"calls\", {\n\t\t\t{\"status\", \"Server status\"},\n\t\t\t{\"solicit\", \"Register instance\"}\n\t\t}};\n\t\tstd::string s = object.dump(4);\n\n\t\tbuffer = s.c_str();\n\t\tlen    = s.length();\n\n\t\t\/* Setup header *\/\n\t\tHeader.AddReply(REPLY_OK);\n\t\tHeader.AddType(\"application\/json\");\n\t\tHeader.AddDate();\n\t\tHeader.AddServer();\n\t\tHeader.AddConnection(false);\n\t\tHeader.AddLength(len);\n\t\tHeader.Set(\"Access-Control-Allow-Origin: *\\r\\n\");\n\t\tHeader.AddAdditional();\n\t\tHeader.AddEnd();\n\n\t\t\/* Send header *\/\n\t\tres = SendHeader(Header);\n\t\tif (!res)\n\t\t\treturn false;\n\n\t\t\/* Send data *\/\n\t\tif (len > 0) {\n\t\t\tres = Write(buffer, len);\n\t\t\tif (res <= 0)\n\t\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tif (!filepath.compare(0, webledge.size(), webledge)) {\n\t\tstd::string dir = filepath.substr(webledge.size()).c_str();\n\t\tif (!dir.empty()) {\n\t\t\tstd::string subdir = \"\";\n\n\t\t\tsize_t index;\n\t\t\twhile ((index = dir.find(\"::\")) != std::string::npos)\n\t\t\t\tdir.replace(index, 2, \"\/\");\n\n  \t\t\tdir.substr(0, dir.find_last_of('#'));\n\n\t\t\tSendFile(dir);\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tSendFile(\"index.html\");\n\n\t\treturn true;\n\t}\n\n\tif (!filepath.compare(\"\/favicon.ico\") || !filepath.compare(\"\/sitemap.xml\")) {\n\t\tHandleError(REPLY_NOENT);\n\t\t\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nbool CClient::SendFile(std::string filepath) {\n\treturn SendFile(filepath.c_str());\n}\n\nbool CClient::SendFile(const char *filepath) {\n\tCFile   File;\n\tCHeader Header;\n\n\tchar   buffer[BUF_MAXLEN];\n\tsize_t len;\n\tbool   res;\n\n\t\/* Open file *\/\n\tres = File.Open(filepath);\n\n\t\/* File not found *\/\n\tif (!res) {\n\t\t\/* Handle error *\/\n\t\tHandleError(REPLY_NOENT);\n\t\tgoto out;\n\t}\n\n\t\/* Get file size *\/\n\tlen = File.Size();\n\n\t\/* No contents? *\/\n\tif (!len) {\n\t\t\/* Handle error *\/\n\t\tHandleError(REPLY_INTERR);\n\n\t\tres = false;\n\t\tgoto out;\n\t}\n\n\t\/* Setup header *\/\n\tHeader.AddReply(REPLY_OK);\n\tHeader.AddType(File.Type());\n\tHeader.AddDate();\n\tHeader.AddServer();\n\tHeader.AddAdditional();\n\tHeader.AddLength(len);\n\tHeader.AddEnd();\n\n\t\/* Send header *\/\n\tres = SendHeader(Header);\n\tif (!res)\n\t\tgoto out;\n\n\t\/* Read loop *\/\n\twhile (len) {\n\t\tssize_t ret, size;\n\n\t\t\/* Block size *\/\n\t\tsize = (len > BUF_MAXLEN) ? BUF_MAXLEN : len;\n\n\t\t\/* Read block *\/\n\t\tres = File.Read(buffer, size);\n\t\tif (!res)\n\t\t\tbreak;\n\n\t\t\/* Send block *\/\n\t\tret = Write(buffer, size);\n\t\tif (ret != size) {\n\t\t\tres = false;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/* Update length *\/\n\t\tlen -= size;\n\t}\n\nout:\n\t\/* Close file *\/\n\tFile.Close();\n\n\treturn res;\n}\n\nbool CClient::RecvRequest(CHeader &Header) {\n\tchar   *buffer;\n\tssize_t res;\n\n\t\/* Allocate buffer *\/\n\tbuffer = new char[HDR_MAXLEN];\n\tif (!buffer)\n\t\treturn false;\n\n\t\/* Read data *\/\n\tres = Read(buffer, HDR_MAXLEN);\n\n\t\/* Set header string *\/\n\tif (res > 0)\n\t\tHeader.Set(buffer);\n\n\t\/* Delete buffer *\/\n\tdelete[] buffer;\n\n\treturn (res > 0) ? true : false;\n}\n\nbool CClient::HandleError(int reply) {\n\tconst char *buffer;\n\tsize_t      len;\n\n\tstd::string data;\n\n\t\/* Get the error page *\/\n\tdata = CErrorPage::Get(reply);\n\n\t\/* Set buffer *\/\n\tbuffer = data.c_str();\n\tlen    = data.length();\n\n\t\/* Send reply *\/\n\treturn SendHtml(buffer, len, reply);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: kernihdl.hxx,v $\n *\n *  $Revision: 1.1.1.1 $\n *\n *  last change: $Author: hr $ $Date: 2000-09-18 17:07:05 $\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 _XMLOFF_PROPERTYHANDLER_KERNINGTYPES_HXX\n#define _XMLOFF_PROPERTYHANDLER_KERNINGTYPES_HXX\n\n#ifndef _XMLOFF_PROPERTYHANDLERBASE_HXX\n#include <xmlprhdl.hxx>\n#endif\n\n\/**\n    PropertyHandler for the XML-data-type:\n*\/\nclass XMLKerningPropHdl : public XMLPropertyHandler\n{\npublic:\n    virtual ~XMLKerningPropHdl();\n\n    virtual sal_Bool importXML( const ::rtl::OUString& rStrImpValue, ::com::sun::star::uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const;\n    virtual sal_Bool exportXML( ::rtl::OUString& rStrExpValue, const ::com::sun::star::uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const;\n};\n\n#endif      \/\/ _XMLOFF_PROPERTYHANDLER_KERNINGTYPES_HXX\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.652); FILE MERGED 2005\/09\/05 14:39:27 rt 1.1.1.1.652.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: kernihdl.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 14:44: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 _XMLOFF_PROPERTYHANDLER_KERNINGTYPES_HXX\n#define _XMLOFF_PROPERTYHANDLER_KERNINGTYPES_HXX\n\n#ifndef _XMLOFF_PROPERTYHANDLERBASE_HXX\n#include <xmlprhdl.hxx>\n#endif\n\n\/**\n    PropertyHandler for the XML-data-type:\n*\/\nclass XMLKerningPropHdl : public XMLPropertyHandler\n{\npublic:\n    virtual ~XMLKerningPropHdl();\n\n    virtual sal_Bool importXML( const ::rtl::OUString& rStrImpValue, ::com::sun::star::uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const;\n    virtual sal_Bool exportXML( ::rtl::OUString& rStrExpValue, const ::com::sun::star::uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const;\n};\n\n#endif      \/\/ _XMLOFF_PROPERTYHANDLER_KERNINGTYPES_HXX\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Thread Class\n * Copyright (c) 2005-2008 Ali Mashtizadeh\n * All rights reserved.\n *\/\n\n#include <limits.h>\n#include <pthread.h>\n#include <signal.h>\n#include <unistd.h>\n\n#include <string>\n\n#include \"thread.h\"\n\nusing namespace std;\n\n\/\/ Add support for using Thread::Thread() to get the current thread or the static GetThread().\n\nvoid EntryWrapper(Thread *t);\n\nThread::Thread()\n{\n    cstate = Running;\n    tname = \"\";\n    tid = pthread_self(); \/\/ How do i fix this for the current thread\n}\n\nThread::Thread(const string &name)\n{\n    cstate = Running;\n    tname = name;\n    tid = pthread_self();\n}\n\nThread::~Thread()\n{\n}\n\nstring Thread::getName()\n{\n    return tname;\n}\n\nvoid Thread::setName(const string &name)\n{\n    tname = name;\n}\n\nThreadPriority Thread::getPriority()\n{\n    return NormalPriority;\n}\n\nvoid Thread::setPriority(ThreadPriority p)\n{\n    \/\/pthread_setschedprio(tid,p);\n}\n\nint Thread::terminate()\n{\n    if (tid == pthread_self())\n\tpthread_exit(0);\n    return pthread_kill(tid, SIGKILL);\n}\n\nvoid Thread::exit(void *retval)\n{\n    pthread_exit(retval);\n}\n\nvoid Thread::sleep(unsigned long secs)\n{\n    sleep(secs);\n}\n\nvoid Thread::usleep(useconds_t usecs)\n{\n    usleep(usecs);\n}\n\nvoid Thread::start()\n{\n    int ret = pthread_create(&tid,\n\t\t\t     attr,\n\t\t\t     (void *(*)(void *))EntryWrapper,\n\t\t\t     (void *)this);\n    \/\/pthread_attr_destroy(attr);\n    if (ret != 0) {\n\tcstate = Running;\n\treturn;\n    }\n    return;\n}\n\nbool Thread::wait(unsigned long time)\n{\n    \/\/ pthread_join\n    return false;\n}\n\nvoid Thread::yield()\n{\n    pthread_yield();\n}\n\nvoid EntryWrapper(Thread *t)\n{\n    t->run();\n}\n\n<commit_msg>pthread_yield to sched_yield (standard)<commit_after>\/*\n * Thread Class\n * Copyright (c) 2005-2008 Ali Mashtizadeh\n * All rights reserved.\n *\/\n\n#include <limits.h>\n#include <pthread.h>\n#include <signal.h>\n#include <unistd.h>\n#include <sched.h>\n\n#include <string>\n\n#include \"thread.h\"\n\nusing namespace std;\n\n\/\/ Add support for using Thread::Thread() to get the current thread or the static GetThread().\n\nvoid EntryWrapper(Thread *t);\n\nThread::Thread()\n{\n    cstate = Running;\n    tname = \"\";\n    tid = pthread_self(); \/\/ How do i fix this for the current thread\n}\n\nThread::Thread(const string &name)\n{\n    cstate = Running;\n    tname = name;\n    tid = pthread_self();\n}\n\nThread::~Thread()\n{\n}\n\nstring Thread::getName()\n{\n    return tname;\n}\n\nvoid Thread::setName(const string &name)\n{\n    tname = name;\n}\n\nThreadPriority Thread::getPriority()\n{\n    return NormalPriority;\n}\n\nvoid Thread::setPriority(ThreadPriority p)\n{\n    \/\/pthread_setschedprio(tid,p);\n}\n\nint Thread::terminate()\n{\n    if (tid == pthread_self())\n\tpthread_exit(0);\n    return pthread_kill(tid, SIGKILL);\n}\n\nvoid Thread::exit(void *retval)\n{\n    pthread_exit(retval);\n}\n\nvoid Thread::sleep(unsigned long secs)\n{\n    sleep(secs);\n}\n\nvoid Thread::usleep(useconds_t usecs)\n{\n    usleep(usecs);\n}\n\nvoid Thread::start()\n{\n    int ret = pthread_create(&tid,\n\t\t\t     attr,\n\t\t\t     (void *(*)(void *))EntryWrapper,\n\t\t\t     (void *)this);\n    \/\/pthread_attr_destroy(attr);\n    if (ret != 0) {\n\tcstate = Running;\n\treturn;\n    }\n    return;\n}\n\nbool Thread::wait(unsigned long time)\n{\n    \/\/ pthread_join\n    return false;\n}\n\nvoid Thread::yield()\n{\n    sched_yield();\n}\n\nvoid EntryWrapper(Thread *t)\n{\n    t->run();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium OS 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\/\/ Some portions Copyright (c) 2009 The Chromium Authors.\n\/\/\n\/\/ Driver program for applying a minijail from the commandline to\n\/\/ a process and its children (depending on the feature).\n\n#include \"minijail\/minijail.h\"\n\n#include <errno.h>\n#include <linux\/capability.h>\n#include <stdio.h>\n#include <sys\/prctl.h>\n#include <unistd.h>\n\n#include <iostream>\n#include <new>\n#include <string>\n#include <vector>\n\n#include <base\/basictypes.h>\n#include <base\/command_line.h>\n#include <base\/logging.h>\n#include <base\/string_util.h>\n\nnamespace switches {\nstatic const char kAddReadonlyMounts[] = \"add-readonly-mounts\";\nstatic const char kDisableTracing[] = \"disable-tracing\";\nstatic const char kEnforceSyscallsBenchmark[] = \"enforce-syscall-benchmark\";\nstatic const char kEnforceSyscallsBySource[] = \"enforce-syscall-by-source\";\nstatic const char kGid[] = \"gid\";\nstatic const char kNamespaceVfs[] = \"namespace-vfs\";\nstatic const char kNamespacePid[] = \"namespace-pid\";\nstatic const char kSanitizeEnvironment[] = \"sanitize-environment\";\nstatic const char kUid[] = \"uid\";\nstatic const char kUseCapabilities[] = \"use-capabilities\";\nstatic const char kHelp[] = \"help\";\n\nstatic const char kHelpMessage[] = \"Available Switches:\\n\"\n\"  --add-readonly-mounts\\n\"\n\"    Mounts a read-only \/proc. (implies namespace-vfs)\\n\"\n\"    (TODO other read-only\/special mounts)\\n\"\n\"  --disable-tracing\\n\"\n\"    Disables ptrace() and core dumps.\\n\"\n\"    This may break debugging helpers\\n\"\n\"  --enforce-syscall-benchmark-source\\n\"\n\"    Runs system call filtering in a pass-through capacity only for\\n\"\n\"    benchmarking\\n\"\n\"  --enforce-syscall-by-source\\n\"\n\"    Enables kernel enforcement that system calls originate from read-only\\n\"\n\"    memory areas\\n\"\n\"  --gid [number]\\n\"\n\"    Numeric gid to transition to prior to execution.\\n\"\n\"   (TODO: Supplemental groups will be cleared.)\\n\"\n\"  --namespace-vfs\\n\"\n\"    Enables a process-tree specific VFS view.\\n\"\n\"  --namespace-pid\\n\"\n\"    Makes the executed process into procss id 1 in its own process view.\\n\"\n\"    With --add-readonly-mounts, other processes will not be visible\\n\"\n\"  --sanitize-environment\\n\"\n\"    Scrubs the environment clean of potentially dangerous values.\\n\"\n\"    (Note, this is a blacklist and not a whitelist so it may need attention)\\n\"\n\"  --uid [number]\\n\"\n\"    Numeric uid to transition to prior to execution.\\n\"\n\"  --use-capabilities\\n\"\n\"    Restricts all root-level capabilities to CAP_SETPCAP and enables\\n\"\n\"    SECURE_NOROOT.\\n\"\n\"  -- \/path\/to\/program [arg1 [arg2 [ . . . ] ] ]\\n\"\n\"    Supplies the required program to execute and its arguments.\\n\"\n\"    At present, an empty environment will be passed.\\n\"\n\"\\n\";\n\n}  \/\/ namespace switches\n\nstatic void ProcessSwitches(CommandLine *cl,\n                            chromeos::MiniJailOptions *jail_opts) {\n  if (cl->HasSwitch(switches::kHelp)) {\n    std::cerr << switches::kHelpMessage;\n    exit(0);\n  }\n\n  \/\/ Configure the jail options\n  jail_opts->set_namespace_pid(cl->HasSwitch(switches::kNamespacePid));\n  jail_opts->set_namespace_vfs(cl->HasSwitch(switches::kNamespaceVfs));\n  jail_opts->set_add_readonly_mounts(\n    cl->HasSwitch(switches::kAddReadonlyMounts));\n  jail_opts->set_disable_tracing(cl->HasSwitch(switches::kDisableTracing));\n  jail_opts->set_enforce_syscalls_by_source(\n    cl->HasSwitch(switches::kEnforceSyscallsBySource));\n  jail_opts->set_use_capabilities(cl->HasSwitch(switches::kUseCapabilities));\n  jail_opts->set_sanitize_environment(\n    cl->HasSwitch(switches::kSanitizeEnvironment));\n\n  std::string uid_string = cl->GetSwitchValueASCII(switches::kUid);\n  if (!uid_string.empty()) {\n    errno = 0;\n    uid_t uid = static_cast<uid_t>(strtol(uid_string.c_str(), NULL, 0));\n    PLOG_IF(WARNING, errno) << \"failed to parse uid\";\n    jail_opts->set_uid(uid);\n  }\n\n  std::string gid_string = cl->GetSwitchValueASCII(switches::kGid);\n  if (!gid_string.empty()) {\n    errno = 0;\n    gid_t gid = static_cast<gid_t>(strtol(gid_string.c_str(), NULL, 0));\n    PLOG_IF(WARNING, errno) << \"failed to parse gid\";\n    jail_opts->set_gid(gid);\n  }\n\n  if (!jail_opts->FixUpDependencies()) {\n    LOG(FATAL) << \"Irreconcilable jail options given. Aborting.\";\n  }\n\n  \/\/ Grab the loose args to use as the command line.\n  \/\/ We have to wstring->argv[][] manually. Ugh.\n  std::vector<std::wstring> loose_wide_args = cl->GetLooseValues();\n  std::vector<std::string> loose_args(loose_wide_args.size());\n  char const* *jailed_argv = new char const*[loose_wide_args.size() + 1];\n  std::vector<std::wstring>::const_iterator arg_it = loose_wide_args.begin();\n  char const* *ja = jailed_argv;\n  for (; arg_it != loose_wide_args.end(); ++arg_it) {\n    std::string arg = WideToASCII(*arg_it);\n    loose_args.push_back(arg);\n    \/\/ XXX: clean up this leak even though it doesn't matter.\n    *ja++ = strdup(arg.c_str());\n  }\n  *ja = 0;\n\n  jail_opts->set_executable_path(jailed_argv[0]);\n  jail_opts->set_arguments(const_cast<char * const*>(jailed_argv),\n                           loose_args.size());\n  \/\/ XXX We just leak this since we're going to exec anyhow.\n  \/\/ delete jailed_argv;\n}\n\nint main(int argc, char *argv[], char **envp) {\n  CommandLine::Init(argc, argv);\n  logging::InitLogging(NULL,\n                       logging::LOG_ONLY_TO_SYSTEM_DEBUG_LOG,\n                       logging::DONT_LOCK_LOG_FILE,\n                       logging::APPEND_TO_OLD_LOG_FILE);\n\n  chromeos::MiniJailOptions jail_opts;\n  CommandLine *cl = CommandLine::ForCurrentProcess();\n  ProcessSwitches(cl, &jail_opts);\n  jail_opts.set_environment(envp);\n\n  LOG_IF(FATAL, !jail_opts.executable_path()) << \"No executable given\";\n\n  chromeos::MiniJail jail;\n  jail.Initialize(&jail_opts);\n  bool ok = jail.Jail() && jail.Run();\n  return !ok;\n}\n\n<commit_msg>enable seccomp benchmark options which was in the switch list but not connected to anything...<commit_after>\/\/ Copyright (c) 2009 The Chromium OS 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\/\/ Some portions Copyright (c) 2009 The Chromium Authors.\n\/\/\n\/\/ Driver program for applying a minijail from the commandline to\n\/\/ a process and its children (depending on the feature).\n\n#include \"minijail\/minijail.h\"\n\n#include <errno.h>\n#include <linux\/capability.h>\n#include <stdio.h>\n#include <sys\/prctl.h>\n#include <unistd.h>\n\n#include <iostream>\n#include <new>\n#include <string>\n#include <vector>\n\n#include <base\/basictypes.h>\n#include <base\/command_line.h>\n#include <base\/logging.h>\n#include <base\/string_util.h>\n\nnamespace switches {\nstatic const char kAddReadonlyMounts[] = \"add-readonly-mounts\";\nstatic const char kDisableTracing[] = \"disable-tracing\";\nstatic const char kEnforceSyscallsBenchmark[] = \"enforce-syscall-benchmark\";\nstatic const char kEnforceSyscallsBySource[] = \"enforce-syscall-by-source\";\nstatic const char kGid[] = \"gid\";\nstatic const char kNamespaceVfs[] = \"namespace-vfs\";\nstatic const char kNamespacePid[] = \"namespace-pid\";\nstatic const char kSanitizeEnvironment[] = \"sanitize-environment\";\nstatic const char kUid[] = \"uid\";\nstatic const char kUseCapabilities[] = \"use-capabilities\";\nstatic const char kHelp[] = \"help\";\n\nstatic const char kHelpMessage[] = \"Available Switches:\\n\"\n\"  --add-readonly-mounts\\n\"\n\"    Mounts a read-only \/proc. (implies namespace-vfs)\\n\"\n\"    (TODO other read-only\/special mounts)\\n\"\n\"  --disable-tracing\\n\"\n\"    Disables ptrace() and core dumps.\\n\"\n\"    This may break debugging helpers\\n\"\n\"  --enforce-syscall-benchmark\\n\"\n\"    Runs system call filtering in a pass-through capacity only for\\n\"\n\"    benchmarking\\n\"\n\"  --enforce-syscall-by-source\\n\"\n\"    Enables kernel enforcement that system calls originate from read-only\\n\"\n\"    memory areas\\n\"\n\"  --gid [number]\\n\"\n\"    Numeric gid to transition to prior to execution.\\n\"\n\"   (TODO: Supplemental groups will be cleared.)\\n\"\n\"  --namespace-vfs\\n\"\n\"    Enables a process-tree specific VFS view.\\n\"\n\"  --namespace-pid\\n\"\n\"    Makes the executed process into procss id 1 in its own process view.\\n\"\n\"    With --add-readonly-mounts, other processes will not be visible\\n\"\n\"  --sanitize-environment\\n\"\n\"    Scrubs the environment clean of potentially dangerous values.\\n\"\n\"    (Note, this is a blacklist and not a whitelist so it may need attention)\\n\"\n\"  --uid [number]\\n\"\n\"    Numeric uid to transition to prior to execution.\\n\"\n\"  --use-capabilities\\n\"\n\"    Restricts all root-level capabilities to CAP_SETPCAP and enables\\n\"\n\"    SECURE_NOROOT.\\n\"\n\"  -- \/path\/to\/program [arg1 [arg2 [ . . . ] ] ]\\n\"\n\"    Supplies the required program to execute and its arguments.\\n\"\n\"    At present, an empty environment will be passed.\\n\"\n\"\\n\";\n\n}  \/\/ namespace switches\n\nstatic void ProcessSwitches(CommandLine *cl,\n                            chromeos::MiniJailOptions *jail_opts) {\n  if (cl->HasSwitch(switches::kHelp)) {\n    std::cerr << switches::kHelpMessage;\n    exit(0);\n  }\n\n  \/\/ Configure the jail options\n  jail_opts->set_namespace_pid(cl->HasSwitch(switches::kNamespacePid));\n  jail_opts->set_namespace_vfs(cl->HasSwitch(switches::kNamespaceVfs));\n  jail_opts->set_add_readonly_mounts(\n    cl->HasSwitch(switches::kAddReadonlyMounts));\n  jail_opts->set_disable_tracing(cl->HasSwitch(switches::kDisableTracing));\n  jail_opts->set_enforce_syscalls_benchmark(\n    cl->HasSwitch(switches::kEnforceSyscallsBenchmark));\n  jail_opts->set_enforce_syscalls_by_source(\n    cl->HasSwitch(switches::kEnforceSyscallsBySource));\n  jail_opts->set_use_capabilities(cl->HasSwitch(switches::kUseCapabilities));\n  jail_opts->set_sanitize_environment(\n    cl->HasSwitch(switches::kSanitizeEnvironment));\n\n  std::string uid_string = cl->GetSwitchValueASCII(switches::kUid);\n  if (!uid_string.empty()) {\n    errno = 0;\n    uid_t uid = static_cast<uid_t>(strtol(uid_string.c_str(), NULL, 0));\n    PLOG_IF(WARNING, errno) << \"failed to parse uid\";\n    jail_opts->set_uid(uid);\n  }\n\n  std::string gid_string = cl->GetSwitchValueASCII(switches::kGid);\n  if (!gid_string.empty()) {\n    errno = 0;\n    gid_t gid = static_cast<gid_t>(strtol(gid_string.c_str(), NULL, 0));\n    PLOG_IF(WARNING, errno) << \"failed to parse gid\";\n    jail_opts->set_gid(gid);\n  }\n\n  if (!jail_opts->FixUpDependencies()) {\n    LOG(FATAL) << \"Irreconcilable jail options given. Aborting.\";\n  }\n\n  \/\/ Grab the loose args to use as the command line.\n  \/\/ We have to wstring->argv[][] manually. Ugh.\n  std::vector<std::wstring> loose_wide_args = cl->GetLooseValues();\n  std::vector<std::string> loose_args(loose_wide_args.size());\n  char const* *jailed_argv = new char const*[loose_wide_args.size() + 1];\n  std::vector<std::wstring>::const_iterator arg_it = loose_wide_args.begin();\n  char const* *ja = jailed_argv;\n  for (; arg_it != loose_wide_args.end(); ++arg_it) {\n    std::string arg = WideToASCII(*arg_it);\n    loose_args.push_back(arg);\n    \/\/ XXX: clean up this leak even though it doesn't matter.\n    *ja++ = strdup(arg.c_str());\n  }\n  *ja = 0;\n\n  jail_opts->set_executable_path(jailed_argv[0]);\n  jail_opts->set_arguments(const_cast<char * const*>(jailed_argv),\n                           loose_args.size());\n  \/\/ XXX We just leak this since we're going to exec anyhow.\n  \/\/ delete jailed_argv;\n}\n\nint main(int argc, char *argv[], char **envp) {\n  CommandLine::Init(argc, argv);\n  logging::InitLogging(NULL,\n                       logging::LOG_ONLY_TO_SYSTEM_DEBUG_LOG,\n                       logging::DONT_LOCK_LOG_FILE,\n                       logging::APPEND_TO_OLD_LOG_FILE);\n\n  chromeos::MiniJailOptions jail_opts;\n  CommandLine *cl = CommandLine::ForCurrentProcess();\n  ProcessSwitches(cl, &jail_opts);\n  jail_opts.set_environment(envp);\n\n  LOG_IF(FATAL, !jail_opts.executable_path()) << \"No executable given\";\n\n  chromeos::MiniJail jail;\n  jail.Initialize(&jail_opts);\n  bool ok = jail.Jail() && jail.Run();\n  return !ok;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"phAttrib.h\"\n#include \"gmi_sim.h\"\n#include <SimAttribute.h>\n#include <SimUtil.h>\n#include <cstdlib>\n\n\/* Simmetrix, for the love of all that is good,\n   please put this in your header files.\n   We can't work with files from Simmodeler without it. *\/\npAManager SModel_attManager(pModel model);\n\ntypedef ph::BC* (*BCFactory)(pAttribute a, pGEntity ge);\ntypedef std::map<std::string, BCFactory> BCFactories;\n\nstruct SimBC : public ph::BC\n{\n  SimBC(pGEntity ge)\n  {\n    dim = GEN_type(ge);\n    tag = GEN_tag(ge);\n  }\n};\n\nstruct Tensor0BC : public SimBC\n{\n  Tensor0BC(pAttribute a, pGEntity ge):SimBC(ge)\n  {\n    if (Attribute_repType(a) != Att_tensor0) {\n      fprintf(stderr, \"tensor 0 attribute does not match type\\n\");\n      abort();\n    }\n    attribute = (pAttributeTensor0)a;\n  }\n  virtual double* eval(apf::Vector3 const& x)\n  {\n    buf = AttributeTensor0_evalDS(attribute, &x[0]);\n    return &buf;\n  }\n  pAttributeTensor0 attribute;\n  double buf;\n};\n\nstruct Tensor1BC : public SimBC {\n  Tensor1BC(pAttribute a, pGEntity ge):SimBC(ge)\n  {\n    if (Attribute_repType(a) != Att_tensor1) {\n      fprintf(stderr, \"tensor 1 attribute does not match type\\n\");\n      abort();\n    }\n    attribute = (pAttributeTensor1)a;\n  }\n  virtual double* eval(apf::Vector3 const& x)\n  {\n    for (int i = 0; i < 3; ++i)\n      buf[i] = AttributeTensor1_evalDS(attribute, i, &x[0]);\n    return buf;\n  }\n  pAttributeTensor1 attribute;\n  double buf[3];\n};\n\nstruct CompBC : public SimBC {\n  CompBC(pAttribute a, pGEntity ge):SimBC(ge)\n  {\n    if (Attribute_repType(a) != Att_void) {\n      fprintf(stderr, \"comp1\/3 attribute does not match type\\n\");\n      abort();\n    }\n    pPList children = Attribute_children(a);\n    magnitude = 0;\n    direction = 0;\n    for (int i = 0; i < PList_size(children); ++i) {\n      pAttribute child = (pAttribute) PList_item(children, i);\n      if (Attribute_repType(child) == Att_double)\n        magnitude = (pAttributeDouble) child;\n      else if (Attribute_repType(child) == Att_tensor1)\n        direction = (pAttributeTensor1) child;\n    }\n    PList_delete(children);\n    if (!magnitude) {\n      fprintf(stderr, \"comp1\/3 attribute does not have magnitude\\n\");\n      abort();\n    }\n    if (!direction) {\n      fprintf(stderr, \"comp1\/3 attribute does not have direction\\n\");\n      abort();\n    }\n  }\n  virtual double* eval(apf::Vector3 const& x)\n  {\n    buf[0] = AttributeDouble_evalDS(magnitude, &x[0]);\n    for (int i = 0; i < 3; ++i)\n      buf[i + 1] = AttributeTensor1_evalDS(direction, i, &x[0]);\n    return buf;\n  }\n  pAttributeDouble magnitude;\n  pAttributeTensor1 direction;\n  double buf[4];\n};\n\nstruct IntBC : public SimBC\n{\n  IntBC(pAttribute a, pGEntity ge):SimBC(ge)\n  {\n    if (Attribute_repType(a) != Att_int) {\n      fprintf(stderr, \"int attribute does not match type\\n\");\n      abort();\n    }\n    attribute = (pAttributeInt)a;\n  }\n  virtual double* eval(apf::Vector3 const&)\n  {\n    \/* forgive me for I am storing an int in a double.\n       let there be more than 32 mantissa bits such that\n       this conversion is lossless. *\/\n    buf = AttributeInt_value(attribute);\n    return &buf;\n  }\n  pAttributeInt attribute;\n  double buf;\n};\n\nstatic ph::BC* tensor0Factory(pAttribute a, pGEntity ge)\n{\n  return new Tensor0BC(a, ge);\n}\n\nstatic ph::BC* tensor1Factory(pAttribute a, pGEntity ge)\n{\n  return new Tensor1BC(a, ge);\n}\n\nstatic ph::BC* compFactory(pAttribute a, pGEntity ge)\n{\n  return new CompBC(a, ge);\n}\n\nstatic ph::BC* intFactory(pAttribute a, pGEntity ge)\n{\n  return new IntBC(a, ge);\n}\n\n\/* this should follow the KnownBC tables in phBC.cc *\/\nstatic void formFactories(BCFactories& fs)\n{\n  fs[\"density\"]              = tensor0Factory;\n  fs[\"temperature\"]          = tensor0Factory;\n  fs[\"pressure\"]             = tensor0Factory;\n  fs[\"comp1\"]                = compFactory;\n  fs[\"comp3\"]                = compFactory;\n  fs[\"scalar_1\"]             = tensor0Factory;\n  fs[\"scalar_2\"]             = tensor0Factory;\n  fs[\"scalar_3\"]             = tensor0Factory;\n  fs[\"scalar_4\"]             = tensor0Factory;\n  fs[\"mass flux\"]            = tensor0Factory;\n  fs[\"natural pressure\"]     = tensor0Factory;\n  fs[\"traction vector\"]      = tensor1Factory;\n  fs[\"heat flux\"]            = tensor0Factory;\n  fs[\"turbulence wall\"]      = tensor0Factory;\n  fs[\"scalar_1 flux\"]        = tensor0Factory;\n  fs[\"scalar_2 flux\"]        = tensor0Factory;\n  fs[\"scalar_3 flux\"]        = tensor0Factory;\n  fs[\"scalar_4 flux\"]        = tensor0Factory;\n  fs[\"surf ID\"]              = tensor0Factory;\n  fs[\"initial pressure\"]     = tensor0Factory;\n  fs[\"initial velocity\"]     = tensor1Factory;\n  fs[\"initial temperature\"]  = tensor0Factory;\n  fs[\"initial scalar_1\"]     = tensor0Factory;\n  fs[\"initial scalar_2\"]     = tensor0Factory;\n  fs[\"initial scalar_3\"]     = tensor0Factory;\n  fs[\"initial scalar_4\"]     = tensor0Factory;\n  fs[\"periodic slave\"]       = intFactory;\n  fs[\"DG interface\"]         = intFactory;\n  fs[\"material type\"]        = intFactory;\n}\n\nstatic std::string getType(pAttribute a)\n{\n  char* c_infoType = Attribute_infoType(a);\n  std::string infoType(c_infoType);\n  Sim_deleteString(c_infoType);\n  char* c_imageClass = Attribute_infoType(a);\n  std::string imageClass(c_imageClass);\n  Sim_deleteString(c_imageClass);\n  if (imageClass.length() != 0)\n    return imageClass;\n  return infoType;\n}\n\nstatic void addAttribute(BCFactories& fs, pAttribute a, pGEntity ge,\n    ph::BCs& bcs)\n{\n  std::string type = getType(a);\n  if (!fs.count(type)) {\n    fprintf(stderr,\"unknown attribute type \\\"%s\\\", ignoring !\\n\", type.c_str());\n    fprintf(stderr,\"it had repType %d\\n\",\n        Attribute_repType(a));\n    return;\n  }\n  if (!bcs.fields.count(type))\n    bcs.fields[type] = ph::FieldBCs();\n  ph::FieldBCs& fbcs = bcs.fields[type];\n  BCFactory f = fs[type];\n  fbcs.bcs.insert( f(a, ge) );\n}\n\nstatic void addAttributes(BCFactories& fs, pPList as, pGEntity ge,\n    ph::BCs& bcs)\n{\n  for (int i = 0; i < PList_size(as); ++i) {\n    pAttribute a = (pAttribute) PList_item(as, i);\n    addAttribute(fs, a, ge, bcs);\n  }\n}\n\nnamespace {\n  void getSimModelAndCase(gmi_model* m, pGModel& smdl, pACase& pd) {\n    smdl = gmi_export_sim(m);\n    pAManager mngr = SModel_attManager(smdl);\n    if (!mngr) {\n      fprintf(stderr,\"Simmetrix model did not come with an Attribute Manager\\n\");\n      abort();\n    }\n    pd = AMAN_findCaseByType(mngr, \"problem definition\");\n    if (!pd) {\n      fprintf(stderr,\"no Attribute Case \\\"problem definition\\\"\\n\");\n      abort();\n    }\n  }\n}\n\nvoid ph::clearAttAssociation(gmi_model* mdl, ph::Input& in)\n{\n  const char* attFile = in.attributeFileName.c_str();\n  if (gmi_has_ext(attFile, \"spj\"))\n    return;\n  pGModel smdl = NULL;\n  pACase pd = NULL;\n  getSimModelAndCase(mdl,smdl,pd);\n  AttCase_unassociate(pd);\n}\n\nvoid ph::getSimmetrixAttributes(gmi_model* model, ph::BCs& bcs)\n{\n  pGModel smdl = NULL;\n  pACase pd = NULL;\n  getSimModelAndCase(model,smdl,pd);\n  AttCase_setModel(pd, smdl);\n  AttCase_associate(pd, NULL);\n  BCFactories fs;\n  formFactories(fs);\n  for (int dim = 0; dim < 4; ++dim) {\n    gmi_iter* it = gmi_begin(model, dim);\n    gmi_ent* e;\n    while ((e = gmi_next(model, it))) {\n      pGEntity ge = (pGEntity) e;\n      pPList attribs = GEN_attributes(ge, \"\");\n      addAttributes(fs, attribs, ge, bcs);\n    }\n    gmi_end(model, it);\n  }\n  \/* Simmodeler seems to put ICs on the model itself, not the regions.\n     spread all ICs off the model onto the regions.\n     also, this code does assume the domain is 3D. *\/\n  pPList attribs = GM_attributes(smdl, \"\");\n  GRIter rit = GM_regionIter(smdl);\n  pGRegion gr;\n  while ((gr = GRIter_next(rit)))\n    addAttributes(fs, attribs, gr, bcs);\n  GRIter_delete(rit);\n}\n\n<commit_msg>fix stupid copy-paste mistake<commit_after>#include \"phAttrib.h\"\n#include \"gmi_sim.h\"\n#include <SimAttribute.h>\n#include <SimUtil.h>\n#include <cstdlib>\n\n\/* Simmetrix, for the love of all that is good,\n   please put this in your header files.\n   We can't work with files from Simmodeler without it. *\/\npAManager SModel_attManager(pModel model);\n\ntypedef ph::BC* (*BCFactory)(pAttribute a, pGEntity ge);\ntypedef std::map<std::string, BCFactory> BCFactories;\n\nstruct SimBC : public ph::BC\n{\n  SimBC(pGEntity ge)\n  {\n    dim = GEN_type(ge);\n    tag = GEN_tag(ge);\n  }\n};\n\nstruct Tensor0BC : public SimBC\n{\n  Tensor0BC(pAttribute a, pGEntity ge):SimBC(ge)\n  {\n    if (Attribute_repType(a) != Att_tensor0) {\n      fprintf(stderr, \"tensor 0 attribute does not match type\\n\");\n      abort();\n    }\n    attribute = (pAttributeTensor0)a;\n  }\n  virtual double* eval(apf::Vector3 const& x)\n  {\n    buf = AttributeTensor0_evalDS(attribute, &x[0]);\n    return &buf;\n  }\n  pAttributeTensor0 attribute;\n  double buf;\n};\n\nstruct Tensor1BC : public SimBC {\n  Tensor1BC(pAttribute a, pGEntity ge):SimBC(ge)\n  {\n    if (Attribute_repType(a) != Att_tensor1) {\n      fprintf(stderr, \"tensor 1 attribute does not match type\\n\");\n      abort();\n    }\n    attribute = (pAttributeTensor1)a;\n  }\n  virtual double* eval(apf::Vector3 const& x)\n  {\n    for (int i = 0; i < 3; ++i)\n      buf[i] = AttributeTensor1_evalDS(attribute, i, &x[0]);\n    return buf;\n  }\n  pAttributeTensor1 attribute;\n  double buf[3];\n};\n\nstruct CompBC : public SimBC {\n  CompBC(pAttribute a, pGEntity ge):SimBC(ge)\n  {\n    if (Attribute_repType(a) != Att_void) {\n      fprintf(stderr, \"comp1\/3 attribute does not match type\\n\");\n      abort();\n    }\n    pPList children = Attribute_children(a);\n    magnitude = 0;\n    direction = 0;\n    for (int i = 0; i < PList_size(children); ++i) {\n      pAttribute child = (pAttribute) PList_item(children, i);\n      if (Attribute_repType(child) == Att_double)\n        magnitude = (pAttributeDouble) child;\n      else if (Attribute_repType(child) == Att_tensor1)\n        direction = (pAttributeTensor1) child;\n    }\n    PList_delete(children);\n    if (!magnitude) {\n      fprintf(stderr, \"comp1\/3 attribute does not have magnitude\\n\");\n      abort();\n    }\n    if (!direction) {\n      fprintf(stderr, \"comp1\/3 attribute does not have direction\\n\");\n      abort();\n    }\n  }\n  virtual double* eval(apf::Vector3 const& x)\n  {\n    buf[0] = AttributeDouble_evalDS(magnitude, &x[0]);\n    for (int i = 0; i < 3; ++i)\n      buf[i + 1] = AttributeTensor1_evalDS(direction, i, &x[0]);\n    return buf;\n  }\n  pAttributeDouble magnitude;\n  pAttributeTensor1 direction;\n  double buf[4];\n};\n\nstruct IntBC : public SimBC\n{\n  IntBC(pAttribute a, pGEntity ge):SimBC(ge)\n  {\n    if (Attribute_repType(a) != Att_int) {\n      fprintf(stderr, \"int attribute does not match type\\n\");\n      abort();\n    }\n    attribute = (pAttributeInt)a;\n  }\n  virtual double* eval(apf::Vector3 const&)\n  {\n    \/* forgive me for I am storing an int in a double.\n       let there be more than 32 mantissa bits such that\n       this conversion is lossless. *\/\n    buf = AttributeInt_value(attribute);\n    return &buf;\n  }\n  pAttributeInt attribute;\n  double buf;\n};\n\nstatic ph::BC* tensor0Factory(pAttribute a, pGEntity ge)\n{\n  return new Tensor0BC(a, ge);\n}\n\nstatic ph::BC* tensor1Factory(pAttribute a, pGEntity ge)\n{\n  return new Tensor1BC(a, ge);\n}\n\nstatic ph::BC* compFactory(pAttribute a, pGEntity ge)\n{\n  return new CompBC(a, ge);\n}\n\nstatic ph::BC* intFactory(pAttribute a, pGEntity ge)\n{\n  return new IntBC(a, ge);\n}\n\n\/* this should follow the KnownBC tables in phBC.cc *\/\nstatic void formFactories(BCFactories& fs)\n{\n  fs[\"density\"]              = tensor0Factory;\n  fs[\"temperature\"]          = tensor0Factory;\n  fs[\"pressure\"]             = tensor0Factory;\n  fs[\"comp1\"]                = compFactory;\n  fs[\"comp3\"]                = compFactory;\n  fs[\"scalar_1\"]             = tensor0Factory;\n  fs[\"scalar_2\"]             = tensor0Factory;\n  fs[\"scalar_3\"]             = tensor0Factory;\n  fs[\"scalar_4\"]             = tensor0Factory;\n  fs[\"mass flux\"]            = tensor0Factory;\n  fs[\"natural pressure\"]     = tensor0Factory;\n  fs[\"traction vector\"]      = tensor1Factory;\n  fs[\"heat flux\"]            = tensor0Factory;\n  fs[\"turbulence wall\"]      = tensor0Factory;\n  fs[\"scalar_1 flux\"]        = tensor0Factory;\n  fs[\"scalar_2 flux\"]        = tensor0Factory;\n  fs[\"scalar_3 flux\"]        = tensor0Factory;\n  fs[\"scalar_4 flux\"]        = tensor0Factory;\n  fs[\"surf ID\"]              = tensor0Factory;\n  fs[\"initial pressure\"]     = tensor0Factory;\n  fs[\"initial velocity\"]     = tensor1Factory;\n  fs[\"initial temperature\"]  = tensor0Factory;\n  fs[\"initial scalar_1\"]     = tensor0Factory;\n  fs[\"initial scalar_2\"]     = tensor0Factory;\n  fs[\"initial scalar_3\"]     = tensor0Factory;\n  fs[\"initial scalar_4\"]     = tensor0Factory;\n  fs[\"periodic slave\"]       = intFactory;\n  fs[\"DG interface\"]         = intFactory;\n  fs[\"material type\"]        = intFactory;\n}\n\nstatic std::string getType(pAttribute a)\n{\n  char* c_infoType = Attribute_infoType(a);\n  std::string infoType(c_infoType);\n  Sim_deleteString(c_infoType);\n  char* c_imageClass = Attribute_imageClass(a);\n  std::string imageClass(c_imageClass);\n  Sim_deleteString(c_imageClass);\n  if (imageClass.length() != 0)\n    return imageClass;\n  return infoType;\n}\n\nstatic void addAttribute(BCFactories& fs, pAttribute a, pGEntity ge,\n    ph::BCs& bcs)\n{\n  std::string type = getType(a);\n  if (!fs.count(type)) {\n    fprintf(stderr,\"unknown attribute type \\\"%s\\\", ignoring !\\n\", type.c_str());\n    fprintf(stderr,\"it had repType %d\\n\",\n        Attribute_repType(a));\n    return;\n  }\n  if (!bcs.fields.count(type))\n    bcs.fields[type] = ph::FieldBCs();\n  ph::FieldBCs& fbcs = bcs.fields[type];\n  BCFactory f = fs[type];\n  fbcs.bcs.insert( f(a, ge) );\n}\n\nstatic void addAttributes(BCFactories& fs, pPList as, pGEntity ge,\n    ph::BCs& bcs)\n{\n  for (int i = 0; i < PList_size(as); ++i) {\n    pAttribute a = (pAttribute) PList_item(as, i);\n    addAttribute(fs, a, ge, bcs);\n  }\n}\n\nnamespace {\n  void getSimModelAndCase(gmi_model* m, pGModel& smdl, pACase& pd) {\n    smdl = gmi_export_sim(m);\n    pAManager mngr = SModel_attManager(smdl);\n    if (!mngr) {\n      fprintf(stderr,\"Simmetrix model did not come with an Attribute Manager\\n\");\n      abort();\n    }\n    pd = AMAN_findCaseByType(mngr, \"problem definition\");\n    if (!pd) {\n      fprintf(stderr,\"no Attribute Case \\\"problem definition\\\"\\n\");\n      abort();\n    }\n  }\n}\n\nvoid ph::clearAttAssociation(gmi_model* mdl, ph::Input& in)\n{\n  const char* attFile = in.attributeFileName.c_str();\n  if (gmi_has_ext(attFile, \"spj\"))\n    return;\n  pGModel smdl = NULL;\n  pACase pd = NULL;\n  getSimModelAndCase(mdl,smdl,pd);\n  AttCase_unassociate(pd);\n}\n\nvoid ph::getSimmetrixAttributes(gmi_model* model, ph::BCs& bcs)\n{\n  pGModel smdl = NULL;\n  pACase pd = NULL;\n  getSimModelAndCase(model,smdl,pd);\n  AttCase_setModel(pd, smdl);\n  AttCase_associate(pd, NULL);\n  BCFactories fs;\n  formFactories(fs);\n  for (int dim = 0; dim < 4; ++dim) {\n    gmi_iter* it = gmi_begin(model, dim);\n    gmi_ent* e;\n    while ((e = gmi_next(model, it))) {\n      pGEntity ge = (pGEntity) e;\n      pPList attribs = GEN_attributes(ge, \"\");\n      addAttributes(fs, attribs, ge, bcs);\n    }\n    gmi_end(model, it);\n  }\n  \/* Simmodeler seems to put ICs on the model itself, not the regions.\n     spread all ICs off the model onto the regions.\n     also, this code does assume the domain is 3D. *\/\n  pPList attribs = GM_attributes(smdl, \"\");\n  GRIter rit = GM_regionIter(smdl);\n  pGRegion gr;\n  while ((gr = GRIter_next(rit)))\n    addAttributes(fs, attribs, gr, bcs);\n  GRIter_delete(rit);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the KDE project\n    Copyright (C) 2004-2007 Matthias Kretz <kretz@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 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., 51 Franklin Street, Fifth Floor,\n    Boston, MA 02110-1301, USA.\n\n*\/\n\n#include \"factory_p.h\"\n\n#include \"backendinterface.h\"\n#include \"medianode_p.h\"\n#include \"audiooutput.h\"\n#include \"audiooutput_p.h\"\n#include \"globalstatic_p.h\"\n#include \"objectdescription.h\"\n#include \"platformplugin.h\"\n#include \"phononnamespace_p.h\"\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QDir>\n#include <QtCore\/QFile>\n#include <QtCore\/QLibrary>\n#include <QtCore\/QList>\n#include <QtCore\/QPluginLoader>\n#include <QtCore\/QPointer>\n#include <QtGui\/QIcon>\n#ifndef QT_NO_DBUS\n#include <QtDBus\/QtDBus>\n#endif\n\nQT_BEGIN_NAMESPACE\n\nnamespace Phonon\n{\n\nclass PlatformPlugin;\nclass FactoryPrivate : public Phonon::Factory::Sender\n{\n    friend QObject *Factory::backend(bool);\n    Q_OBJECT\n    public:\n        FactoryPrivate();\n        ~FactoryPrivate();\n        bool createBackend();\n        PlatformPlugin *platformPlugin();\n\n        QPointer<QObject> m_backendObject;\n        PlatformPlugin *m_platformPlugin;\n        bool m_noPlatformPlugin;\n\n        QList<QObject *> objects;\n        QList<MediaNodePrivate *> mediaNodePrivateList;\n\n    private Q_SLOTS:\n        \/**\n         * This is called via DBUS when the user changes the Phonon Backend.\n         *\/\n        void phononBackendChanged();\n\n        \/**\n         * unregisters the backend object\n         *\/\n        void objectDestroyed(QObject *);\n\n        void objectDescriptionChanged(ObjectDescriptionType);\n};\n\nPHONON_GLOBAL_STATIC(Phonon::FactoryPrivate, globalFactory)\n\nvoid Factory::setBackend(QObject *b)\n{\n    Q_ASSERT(globalFactory->m_backendObject == 0);\n    globalFactory->m_backendObject = b;\n}\n\n\/*void Factory::createBackend(const QString &library, const QString &version)\n{\n    Q_ASSERT(globalFactory->m_backendObject == 0);\n    PlatformPlugin *f = globalFactory->platformPlugin();\n    if (f) {\n        globalFactory->m_backendObject = f->createBackend(library, version);\n    }\n}*\/\n\nbool FactoryPrivate::createBackend()\n{\n    Q_ASSERT(m_backendObject == 0);\n    PlatformPlugin *f = globalFactory->platformPlugin();\n    if (f) {\n        m_backendObject = f->createBackend();\n    }\n    if (!m_backendObject) {\n        \/\/ could not load a backend through the platform plugin. Falling back to the default\n        \/\/ (finding the first loadable backend).\n        const QLatin1String suffix(\"\/phonon_backend\/\");\n        foreach (QString libPath, QCoreApplication::libraryPaths()) {\n            libPath += suffix;\n            const QDir dir(libPath);\n            if (!dir.exists()) {\n                pDebug() << Q_FUNC_INFO << dir.absolutePath() << \"does not exist\";\n                continue;\n            }\n            foreach (const QString &pluginName, dir.entryList(QDir::Files)) {\n                QPluginLoader pluginLoader(libPath + pluginName);\n                if (!pluginLoader.load()) {\n                    pDebug() << Q_FUNC_INFO << \"  load failed:\"\n                             << pluginLoader.errorString();\n                    continue;\n                }\n                pDebug() << pluginLoader.instance();\n                m_backendObject = pluginLoader.instance();\n                if (m_backendObject) {\n                    break;\n                }\n\n                \/\/ no backend found, don't leave an unused plugin in memory\n                pluginLoader.unload();\n            }\n\n            if (m_backendObject) {\n                break;\n            }\n        }\n        if (!m_backendObject) {\n            pWarning() << Q_FUNC_INFO << \"phonon backend plugin could not be loaded\";\n            return false;\n        }\n    }\n\n    connect(m_backendObject, SIGNAL(objectDescriptionChanged(ObjectDescriptionType)),\n            SLOT(objectDescriptionChanged(ObjectDescriptionType)));\n\n    return true;\n}\n\nFactoryPrivate::FactoryPrivate()\n    : m_backendObject(0),\n    m_platformPlugin(0),\n    m_noPlatformPlugin(false)\n{\n    \/\/ Add the post routine to make sure that all other global statics (especially the ones from Qt)\n    \/\/ are still available. If the FactoryPrivate dtor is called too late many bad things can happen\n    \/\/ as the whole backend might still be alive.\n    qAddPostRoutine(globalFactory.destroy);\n#ifndef QT_NO_DBUS\n    QDBusConnection::sessionBus().connect(QString(), QString(), \"org.kde.Phonon.Factory\",\n            \"phononBackendChanged\", this, SLOT(phononBackendChanged()));\n#endif\n}\n\nFactoryPrivate::~FactoryPrivate()\n{\n    foreach (MediaNodePrivate *bp, mediaNodePrivateList) {\n        bp->deleteBackendObject();\n    }\n    if (objects.size() > 0) {\n        pError() << \"The backend objects are not deleted as was requested.\";\n        qDeleteAll(objects);\n    }\n    delete m_backendObject;\n    delete m_platformPlugin;\n}\n\nvoid FactoryPrivate::objectDescriptionChanged(ObjectDescriptionType type)\n{\n#ifdef PHONON_METHODTEST\n    Q_UNUSED(type);\n#else\n    pDebug() << Q_FUNC_INFO << type;\n    switch (type) {\n    case AudioOutputDeviceType:\n        emit availableAudioOutputDevicesChanged();\n        break;\n    default:\n        break;\n    }\n    \/\/emit capabilitiesChanged();\n#endif \/\/ PHONON_METHODTEST\n}\n\nFactory::Sender *Factory::sender()\n{\n    return globalFactory;\n}\n\nbool Factory::isMimeTypeAvailable(const QString &mimeType)\n{\n    PlatformPlugin *f = globalFactory->platformPlugin();\n    if (f) {\n        return f->isMimeTypeAvailable(mimeType);\n    }\n    return true; \/\/ the MIME type might be supported, let BackendCapabilities find out\n}\n\nvoid Factory::registerFrontendObject(MediaNodePrivate *bp)\n{\n    globalFactory->mediaNodePrivateList.prepend(bp); \/\/ inserted last => deleted first\n}\n\nvoid Factory::deregisterFrontendObject(MediaNodePrivate *bp)\n{\n    \/\/ The Factory can already be cleaned up while there are other frontend objects still alive.\n    \/\/ When those are deleted they'll call deregisterFrontendObject through ~BasePrivate\n    if (!globalFactory.isDestroyed()) {\n        globalFactory->mediaNodePrivateList.removeAll(bp);\n    }\n}\n\nvoid FactoryPrivate::phononBackendChanged()\n{\n    if (m_backendObject) {\n        foreach (MediaNodePrivate *bp, mediaNodePrivateList) {\n            bp->deleteBackendObject();\n        }\n        if (objects.size() > 0) {\n            pDebug() << \"WARNING: we were asked to change the backend but the application did\\n\"\n                \"not free all references to objects created by the factory. Therefore we can not\\n\"\n                \"change the backend without crashing. Now we have to wait for a restart to make\\n\"\n                \"backendswitching possible.\";\n            \/\/ in case there were objects deleted give 'em a chance to recreate\n            \/\/ them now\n            foreach (MediaNodePrivate *bp, mediaNodePrivateList) {\n                bp->createBackendObject();\n            }\n            return;\n        }\n        delete m_backendObject;\n        m_backendObject = 0;\n    }\n    createBackend();\n    foreach (MediaNodePrivate *bp, mediaNodePrivateList) {\n        bp->createBackendObject();\n    }\n    emit backendChanged();\n}\n\n\/\/X void Factory::freeSoundcardDevices()\n\/\/X {\n\/\/X     if (globalFactory->backend) {\n\/\/X         globalFactory->backend->freeSoundcardDevices();\n\/\/X     }\n\/\/X }\n\nvoid FactoryPrivate::objectDestroyed(QObject * obj)\n{\n    \/\/pDebug() << Q_FUNC_INFO << obj;\n    objects.removeAll(obj);\n}\n\n#define FACTORY_IMPL(classname) \\\nQObject *Factory::create ## classname(QObject *parent) \\\n{ \\\n    if (backend()) { \\\n        return registerQObject(qobject_cast<BackendInterface *>(backend())->createObject(BackendInterface::classname##Class, parent)); \\\n    } \\\n    return 0; \\\n}\n#define FACTORY_IMPL_1ARG(classname) \\\nQObject *Factory::create ## classname(int arg1, QObject *parent) \\\n{ \\\n    if (backend()) { \\\n        return registerQObject(qobject_cast<BackendInterface *>(backend())->createObject(BackendInterface::classname##Class, parent, QList<QVariant>() << arg1)); \\\n    } \\\n    return 0; \\\n}\n\nFACTORY_IMPL(MediaObject)\nFACTORY_IMPL_1ARG(Effect)\nFACTORY_IMPL(VolumeFaderEffect)\nFACTORY_IMPL(AudioOutput)\nFACTORY_IMPL(AudioDataOutput)\nFACTORY_IMPL(Visualization)\nFACTORY_IMPL(VideoDataOutput)\nFACTORY_IMPL(VideoWidget)\n\n#undef FACTORY_IMPL\n\nPlatformPlugin *FactoryPrivate::platformPlugin()\n{\n    if (m_platformPlugin) {\n        return m_platformPlugin;\n    }\n    if (m_noPlatformPlugin) {\n        return 0;\n    }\n#ifndef QT_NO_DBUS\n    if (!QCoreApplication::instance() || QCoreApplication::applicationName().isEmpty()) {\n        pWarning() << \"Phonon needs QCoreApplication::applicationName to be set to export audio output names through the DBUS interface\";\n    }\n#endif\n    const QString suffix(QLatin1String(\"\/phonon_platform\/\"));\n    Q_ASSERT(QCoreApplication::instance());\n    foreach (QString libPath, QCoreApplication::libraryPaths()) {\n        libPath += suffix;\n        const QDir dir(libPath);\n        if (!dir.exists()) {\n            pDebug() << Q_FUNC_INFO << dir.absolutePath() << \"does not exist\";\n            continue;\n        }\n        foreach (const QString &pluginName, dir.entryList(QDir::Files)) {\n            QPluginLoader pluginLoader(libPath + pluginName);\n            if (!pluginLoader.load()) {\n                pDebug() << Q_FUNC_INFO << \"  platform plugin load failed:\"\n                    << pluginLoader.errorString();\n                continue;\n            }\n            pDebug() << pluginLoader.instance();\n            QObject *qobj = pluginLoader.instance();\n            m_platformPlugin = qobject_cast<PlatformPlugin *>(qobj);\n            pDebug() << m_platformPlugin;\n            if (m_platformPlugin) {\n                connect(qobj, SIGNAL(objectDescriptionChanged(ObjectDescriptionType)),\n                        SLOT(objectDescriptionChanged(ObjectDescriptionType)));\n                return m_platformPlugin;\n            } else {\n                pDebug() << Q_FUNC_INFO << dir.absolutePath() << \"exists but the platform plugin was not loadable:\" << pluginLoader.errorString();\n                pluginLoader.unload();\n            }\n        }\n    }\n    pDebug() << Q_FUNC_INFO << \"phonon_platform\/kde plugin could not be loaded\";\n    m_noPlatformPlugin = true;\n    return 0;\n}\n\nPlatformPlugin *Factory::platformPlugin()\n{\n    return globalFactory->platformPlugin();\n}\n\nQObject *Factory::backend(bool createWhenNull)\n{\n    if (globalFactory.isDestroyed()) {\n        return 0;\n    }\n    if (createWhenNull && globalFactory->m_backendObject == 0) {\n        globalFactory->createBackend();\n        \/\/ XXX: might create \"reentrancy\" problems:\n        \/\/ a method calls this method and is called again because the\n        \/\/ backendChanged signal is emitted\n        emit globalFactory->backendChanged();\n    }\n    return globalFactory->m_backendObject;\n}\n\n#define GET_STRING_PROPERTY(name) \\\nQString Factory::name() \\\n{ \\\n    if (globalFactory->m_backendObject) { \\\n        return globalFactory->m_backendObject->property(#name).toString(); \\\n    } \\\n    return QString(); \\\n} \\\n\nGET_STRING_PROPERTY(identifier)\nGET_STRING_PROPERTY(backendName)\nGET_STRING_PROPERTY(backendComment)\nGET_STRING_PROPERTY(backendVersion)\nGET_STRING_PROPERTY(backendIcon)\nGET_STRING_PROPERTY(backendWebsite)\n\nQObject *Factory::registerQObject(QObject *o)\n{\n    if (o) {\n        QObject::connect(o, SIGNAL(destroyed(QObject *)), globalFactory, SLOT(objectDestroyed(QObject *)), Qt::DirectConnection);\n        globalFactory->objects.append(o);\n    }\n    return o;\n}\n\n} \/\/namespace Phonon\n\nQT_END_NAMESPACE\n\n#include \"factory.moc\"\n#include \"moc_factory_p.cpp\"\n\n\/\/ vim: sw=4 ts=4\n<commit_msg>make it stop playback a bit faster on shutdown. Especially with streams and the xine backend there was a quite noticable delay<commit_after>\/*  This file is part of the KDE project\n    Copyright (C) 2004-2007 Matthias Kretz <kretz@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 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., 51 Franklin Street, Fifth Floor,\n    Boston, MA 02110-1301, USA.\n\n*\/\n\n#include \"factory_p.h\"\n\n#include \"backendinterface.h\"\n#include \"medianode_p.h\"\n#include \"mediaobject.h\"\n#include \"audiooutput.h\"\n#include \"audiooutput_p.h\"\n#include \"globalstatic_p.h\"\n#include \"objectdescription.h\"\n#include \"platformplugin.h\"\n#include \"phononnamespace_p.h\"\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QDir>\n#include <QtCore\/QFile>\n#include <QtCore\/QLibrary>\n#include <QtCore\/QList>\n#include <QtCore\/QPluginLoader>\n#include <QtCore\/QPointer>\n#include <QtGui\/QIcon>\n#ifndef QT_NO_DBUS\n#include <QtDBus\/QtDBus>\n#endif\n\nQT_BEGIN_NAMESPACE\n\nnamespace Phonon\n{\n\nclass PlatformPlugin;\nclass FactoryPrivate : public Phonon::Factory::Sender\n{\n    friend QObject *Factory::backend(bool);\n    Q_OBJECT\n    public:\n        FactoryPrivate();\n        ~FactoryPrivate();\n        bool createBackend();\n        PlatformPlugin *platformPlugin();\n\n        QPointer<QObject> m_backendObject;\n        PlatformPlugin *m_platformPlugin;\n        bool m_noPlatformPlugin;\n\n        QList<QObject *> objects;\n        QList<MediaNodePrivate *> mediaNodePrivateList;\n\n    private Q_SLOTS:\n        \/**\n         * This is called via DBUS when the user changes the Phonon Backend.\n         *\/\n        void phononBackendChanged();\n\n        \/**\n         * unregisters the backend object\n         *\/\n        void objectDestroyed(QObject *);\n\n        void objectDescriptionChanged(ObjectDescriptionType);\n};\n\nPHONON_GLOBAL_STATIC(Phonon::FactoryPrivate, globalFactory)\n\nvoid Factory::setBackend(QObject *b)\n{\n    Q_ASSERT(globalFactory->m_backendObject == 0);\n    globalFactory->m_backendObject = b;\n}\n\n\/*void Factory::createBackend(const QString &library, const QString &version)\n{\n    Q_ASSERT(globalFactory->m_backendObject == 0);\n    PlatformPlugin *f = globalFactory->platformPlugin();\n    if (f) {\n        globalFactory->m_backendObject = f->createBackend(library, version);\n    }\n}*\/\n\nbool FactoryPrivate::createBackend()\n{\n    Q_ASSERT(m_backendObject == 0);\n    PlatformPlugin *f = globalFactory->platformPlugin();\n    if (f) {\n        m_backendObject = f->createBackend();\n    }\n    if (!m_backendObject) {\n        \/\/ could not load a backend through the platform plugin. Falling back to the default\n        \/\/ (finding the first loadable backend).\n        const QLatin1String suffix(\"\/phonon_backend\/\");\n        foreach (QString libPath, QCoreApplication::libraryPaths()) {\n            libPath += suffix;\n            const QDir dir(libPath);\n            if (!dir.exists()) {\n                pDebug() << Q_FUNC_INFO << dir.absolutePath() << \"does not exist\";\n                continue;\n            }\n            foreach (const QString &pluginName, dir.entryList(QDir::Files)) {\n                QPluginLoader pluginLoader(libPath + pluginName);\n                if (!pluginLoader.load()) {\n                    pDebug() << Q_FUNC_INFO << \"  load failed:\"\n                             << pluginLoader.errorString();\n                    continue;\n                }\n                pDebug() << pluginLoader.instance();\n                m_backendObject = pluginLoader.instance();\n                if (m_backendObject) {\n                    break;\n                }\n\n                \/\/ no backend found, don't leave an unused plugin in memory\n                pluginLoader.unload();\n            }\n\n            if (m_backendObject) {\n                break;\n            }\n        }\n        if (!m_backendObject) {\n            pWarning() << Q_FUNC_INFO << \"phonon backend plugin could not be loaded\";\n            return false;\n        }\n    }\n\n    connect(m_backendObject, SIGNAL(objectDescriptionChanged(ObjectDescriptionType)),\n            SLOT(objectDescriptionChanged(ObjectDescriptionType)));\n\n    return true;\n}\n\nFactoryPrivate::FactoryPrivate()\n    : m_backendObject(0),\n    m_platformPlugin(0),\n    m_noPlatformPlugin(false)\n{\n    \/\/ Add the post routine to make sure that all other global statics (especially the ones from Qt)\n    \/\/ are still available. If the FactoryPrivate dtor is called too late many bad things can happen\n    \/\/ as the whole backend might still be alive.\n    qAddPostRoutine(globalFactory.destroy);\n#ifndef QT_NO_DBUS\n    QDBusConnection::sessionBus().connect(QString(), QString(), \"org.kde.Phonon.Factory\",\n            \"phononBackendChanged\", this, SLOT(phononBackendChanged()));\n#endif\n}\n\nFactoryPrivate::~FactoryPrivate()\n{\n    foreach (QObject *o, objects) {\n        MediaObject *m = qobject_cast<MediaObject *>(o);\n        if (m) {\n            m->stop();\n        }\n    }\n    foreach (MediaNodePrivate *bp, mediaNodePrivateList) {\n        bp->deleteBackendObject();\n    }\n    if (objects.size() > 0) {\n        pError() << \"The backend objects are not deleted as was requested.\";\n        qDeleteAll(objects);\n    }\n    delete m_backendObject;\n    delete m_platformPlugin;\n}\n\nvoid FactoryPrivate::objectDescriptionChanged(ObjectDescriptionType type)\n{\n#ifdef PHONON_METHODTEST\n    Q_UNUSED(type);\n#else\n    pDebug() << Q_FUNC_INFO << type;\n    switch (type) {\n    case AudioOutputDeviceType:\n        emit availableAudioOutputDevicesChanged();\n        break;\n    default:\n        break;\n    }\n    \/\/emit capabilitiesChanged();\n#endif \/\/ PHONON_METHODTEST\n}\n\nFactory::Sender *Factory::sender()\n{\n    return globalFactory;\n}\n\nbool Factory::isMimeTypeAvailable(const QString &mimeType)\n{\n    PlatformPlugin *f = globalFactory->platformPlugin();\n    if (f) {\n        return f->isMimeTypeAvailable(mimeType);\n    }\n    return true; \/\/ the MIME type might be supported, let BackendCapabilities find out\n}\n\nvoid Factory::registerFrontendObject(MediaNodePrivate *bp)\n{\n    globalFactory->mediaNodePrivateList.prepend(bp); \/\/ inserted last => deleted first\n}\n\nvoid Factory::deregisterFrontendObject(MediaNodePrivate *bp)\n{\n    \/\/ The Factory can already be cleaned up while there are other frontend objects still alive.\n    \/\/ When those are deleted they'll call deregisterFrontendObject through ~BasePrivate\n    if (!globalFactory.isDestroyed()) {\n        globalFactory->mediaNodePrivateList.removeAll(bp);\n    }\n}\n\nvoid FactoryPrivate::phononBackendChanged()\n{\n    if (m_backendObject) {\n        foreach (MediaNodePrivate *bp, mediaNodePrivateList) {\n            bp->deleteBackendObject();\n        }\n        if (objects.size() > 0) {\n            pDebug() << \"WARNING: we were asked to change the backend but the application did\\n\"\n                \"not free all references to objects created by the factory. Therefore we can not\\n\"\n                \"change the backend without crashing. Now we have to wait for a restart to make\\n\"\n                \"backendswitching possible.\";\n            \/\/ in case there were objects deleted give 'em a chance to recreate\n            \/\/ them now\n            foreach (MediaNodePrivate *bp, mediaNodePrivateList) {\n                bp->createBackendObject();\n            }\n            return;\n        }\n        delete m_backendObject;\n        m_backendObject = 0;\n    }\n    createBackend();\n    foreach (MediaNodePrivate *bp, mediaNodePrivateList) {\n        bp->createBackendObject();\n    }\n    emit backendChanged();\n}\n\n\/\/X void Factory::freeSoundcardDevices()\n\/\/X {\n\/\/X     if (globalFactory->backend) {\n\/\/X         globalFactory->backend->freeSoundcardDevices();\n\/\/X     }\n\/\/X }\n\nvoid FactoryPrivate::objectDestroyed(QObject * obj)\n{\n    \/\/pDebug() << Q_FUNC_INFO << obj;\n    objects.removeAll(obj);\n}\n\n#define FACTORY_IMPL(classname) \\\nQObject *Factory::create ## classname(QObject *parent) \\\n{ \\\n    if (backend()) { \\\n        return registerQObject(qobject_cast<BackendInterface *>(backend())->createObject(BackendInterface::classname##Class, parent)); \\\n    } \\\n    return 0; \\\n}\n#define FACTORY_IMPL_1ARG(classname) \\\nQObject *Factory::create ## classname(int arg1, QObject *parent) \\\n{ \\\n    if (backend()) { \\\n        return registerQObject(qobject_cast<BackendInterface *>(backend())->createObject(BackendInterface::classname##Class, parent, QList<QVariant>() << arg1)); \\\n    } \\\n    return 0; \\\n}\n\nFACTORY_IMPL(MediaObject)\nFACTORY_IMPL_1ARG(Effect)\nFACTORY_IMPL(VolumeFaderEffect)\nFACTORY_IMPL(AudioOutput)\nFACTORY_IMPL(AudioDataOutput)\nFACTORY_IMPL(Visualization)\nFACTORY_IMPL(VideoDataOutput)\nFACTORY_IMPL(VideoWidget)\n\n#undef FACTORY_IMPL\n\nPlatformPlugin *FactoryPrivate::platformPlugin()\n{\n    if (m_platformPlugin) {\n        return m_platformPlugin;\n    }\n    if (m_noPlatformPlugin) {\n        return 0;\n    }\n#ifndef QT_NO_DBUS\n    if (!QCoreApplication::instance() || QCoreApplication::applicationName().isEmpty()) {\n        pWarning() << \"Phonon needs QCoreApplication::applicationName to be set to export audio output names through the DBUS interface\";\n    }\n#endif\n    const QString suffix(QLatin1String(\"\/phonon_platform\/\"));\n    Q_ASSERT(QCoreApplication::instance());\n    foreach (QString libPath, QCoreApplication::libraryPaths()) {\n        libPath += suffix;\n        const QDir dir(libPath);\n        if (!dir.exists()) {\n            pDebug() << Q_FUNC_INFO << dir.absolutePath() << \"does not exist\";\n            continue;\n        }\n        foreach (const QString &pluginName, dir.entryList(QDir::Files)) {\n            QPluginLoader pluginLoader(libPath + pluginName);\n            if (!pluginLoader.load()) {\n                pDebug() << Q_FUNC_INFO << \"  platform plugin load failed:\"\n                    << pluginLoader.errorString();\n                continue;\n            }\n            pDebug() << pluginLoader.instance();\n            QObject *qobj = pluginLoader.instance();\n            m_platformPlugin = qobject_cast<PlatformPlugin *>(qobj);\n            pDebug() << m_platformPlugin;\n            if (m_platformPlugin) {\n                connect(qobj, SIGNAL(objectDescriptionChanged(ObjectDescriptionType)),\n                        SLOT(objectDescriptionChanged(ObjectDescriptionType)));\n                return m_platformPlugin;\n            } else {\n                pDebug() << Q_FUNC_INFO << dir.absolutePath() << \"exists but the platform plugin was not loadable:\" << pluginLoader.errorString();\n                pluginLoader.unload();\n            }\n        }\n    }\n    pDebug() << Q_FUNC_INFO << \"phonon_platform\/kde plugin could not be loaded\";\n    m_noPlatformPlugin = true;\n    return 0;\n}\n\nPlatformPlugin *Factory::platformPlugin()\n{\n    return globalFactory->platformPlugin();\n}\n\nQObject *Factory::backend(bool createWhenNull)\n{\n    if (globalFactory.isDestroyed()) {\n        return 0;\n    }\n    if (createWhenNull && globalFactory->m_backendObject == 0) {\n        globalFactory->createBackend();\n        \/\/ XXX: might create \"reentrancy\" problems:\n        \/\/ a method calls this method and is called again because the\n        \/\/ backendChanged signal is emitted\n        emit globalFactory->backendChanged();\n    }\n    return globalFactory->m_backendObject;\n}\n\n#define GET_STRING_PROPERTY(name) \\\nQString Factory::name() \\\n{ \\\n    if (globalFactory->m_backendObject) { \\\n        return globalFactory->m_backendObject->property(#name).toString(); \\\n    } \\\n    return QString(); \\\n} \\\n\nGET_STRING_PROPERTY(identifier)\nGET_STRING_PROPERTY(backendName)\nGET_STRING_PROPERTY(backendComment)\nGET_STRING_PROPERTY(backendVersion)\nGET_STRING_PROPERTY(backendIcon)\nGET_STRING_PROPERTY(backendWebsite)\n\nQObject *Factory::registerQObject(QObject *o)\n{\n    if (o) {\n        QObject::connect(o, SIGNAL(destroyed(QObject *)), globalFactory, SLOT(objectDestroyed(QObject *)), Qt::DirectConnection);\n        globalFactory->objects.append(o);\n    }\n    return o;\n}\n\n} \/\/namespace Phonon\n\nQT_END_NAMESPACE\n\n#include \"factory.moc\"\n#include \"moc_factory_p.cpp\"\n\n\/\/ vim: sw=4 ts=4\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\/\/ 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#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 typename NumTraits<Scalar>::Real RealScalar;\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_APPROX(m1.colwise().sum().sum(), m1.sum());\n  VERIFY_IS_APPROX(m1.rowwise().sum().sum(), m1.sum());\n  if (!internal::isApprox(m1.sum(), (m1+m2).sum()))\n    VERIFY_IS_NOT_APPROX(((m1+m2).rowwise().sum()).sum(), m1.sum());\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\ntemplate<typename MatrixType> void comparisons(const MatrixType& m)\n{\n  typedef typename MatrixType::Index Index;\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename NumTraits<Scalar>::Real RealScalar;\n  typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;\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) = internal::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  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>(), internal::sqrt(u.array().abs().square().sum()));\n  VERIFY_IS_APPROX(internal::pow(u.template lpNorm<5>(), typename VectorType::RealScalar(5)), u.array().abs().pow(5).sum());\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(3, 3)) );\n    CALL_SUBTEST_5( array_for_matrix(MatrixXf(8, 12)) );\n    CALL_SUBTEST_6( array_for_matrix(MatrixXi(8, 12)) );\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(8, 12)) );\n    CALL_SUBTEST_6( comparisons(MatrixXi(8, 12)) );\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(16)) );\n    CALL_SUBTEST_4( lpNorm(VectorXcf(10)) );\n  }\n}\n<commit_msg>Added regression tests for bug #148.<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\/\/ 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#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 typename NumTraits<Scalar>::Real RealScalar;\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_APPROX(m1.colwise().sum().sum(), m1.sum());\n  VERIFY_IS_APPROX(m1.rowwise().sum().sum(), m1.sum());\n  if (!internal::isApprox(m1.sum(), (m1+m2).sum()))\n    VERIFY_IS_NOT_APPROX(((m1+m2).rowwise().sum()).sum(), m1.sum());\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  typedef typename MatrixType::Index Index;\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename NumTraits<Scalar>::Real RealScalar;\n  typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;\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) = internal::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  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>(), internal::sqrt(u.array().abs().square().sum()));\n  VERIFY_IS_APPROX(internal::pow(u.template lpNorm<5>(), typename VectorType::RealScalar(5)), u.array().abs().pow(5).sum());\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(3, 3)) );\n    CALL_SUBTEST_5( array_for_matrix(MatrixXf(8, 12)) );\n    CALL_SUBTEST_6( array_for_matrix(MatrixXi(8, 12)) );\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(8, 12)) );\n    CALL_SUBTEST_6( comparisons(MatrixXi(8, 12)) );\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(16)) );\n    CALL_SUBTEST_4( lpNorm(VectorXcf(10)) );\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2007-2008 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#include \"accessors.h\"\n#include \"top.h\"\n\n#include \"cctest.h\"\n\n\nusing namespace v8::internal;\n\n\nstatic Object* AllocateAfterFailures() {\n  static int attempts = 0;\n  if (++attempts < 3) return Failure::RetryAfterGC(0);\n\n  \/\/ New space.\n  NewSpace* new_space = Heap::new_space();\n  static const int kNewSpaceFillerSize = ByteArray::SizeFor(0);\n  while (new_space->Available() > kNewSpaceFillerSize) {\n    int available_before = new_space->Available();\n    CHECK(!Heap::AllocateByteArray(0)->IsFailure());\n    if (available_before == new_space->Available()) {\n      \/\/ It seems that we are avoiding new space allocations when\n      \/\/ allocation is forced, so no need to fill up new space\n      \/\/ in order to make the test harder.\n      break;\n    }\n  }\n  CHECK(!Heap::AllocateByteArray(100)->IsFailure());\n  CHECK(!Heap::AllocateFixedArray(100, NOT_TENURED)->IsFailure());\n\n  \/\/ Make sure we can allocate through optimized allocation functions\n  \/\/ for specific kinds.\n  CHECK(!Heap::AllocateFixedArray(100)->IsFailure());\n  CHECK(!Heap::AllocateHeapNumber(0.42)->IsFailure());\n  CHECK(!Heap::AllocateArgumentsObject(Smi::FromInt(87), 10)->IsFailure());\n  Object* object = Heap::AllocateJSObject(*Top::object_function());\n  CHECK(!Heap::CopyJSObject(JSObject::cast(object))->IsFailure());\n\n  \/\/ Old data space.\n  OldSpace* old_data_space = Heap::old_data_space();\n  static const int kOldDataSpaceFillerSize = ByteArray::SizeFor(0);\n  while (old_data_space->Available() > kOldDataSpaceFillerSize) {\n    CHECK(!Heap::Heap::AllocateByteArray(0, TENURED)->IsFailure());\n  }\n  CHECK(!Heap::AllocateRawAsciiString(100, TENURED)->IsFailure());\n\n  \/\/ Large object space.\n  while (!Heap::OldGenerationAllocationLimitReached()) {\n    CHECK(!Heap::AllocateFixedArray(10000, TENURED)->IsFailure());\n  }\n  CHECK(!Heap::AllocateFixedArray(10000, TENURED)->IsFailure());\n\n  \/\/ Map space.\n  MapSpace* map_space = Heap::map_space();\n  static const int kMapSpaceFillerSize = Map::kSize;\n  InstanceType instance_type = JS_OBJECT_TYPE;\n  int instance_size = JSObject::kHeaderSize;\n  while (map_space->Available() > kMapSpaceFillerSize) {\n    CHECK(!Heap::AllocateMap(instance_type, instance_size)->IsFailure());\n  }\n  CHECK(!Heap::AllocateMap(instance_type, instance_size)->IsFailure());\n\n  \/\/ Test that we can allocate in old pointer space and code space.\n  CHECK(!Heap::AllocateFixedArray(100, TENURED)->IsFailure());\n  CHECK(!Heap::CopyCode(Builtins::builtin(Builtins::Illegal))->IsFailure());\n\n  \/\/ Return success.\n  return Smi::FromInt(42);\n}\n\n\nstatic Handle<Object> Test() {\n  CALL_HEAP_FUNCTION(AllocateAfterFailures(), Object);\n}\n\n\nTEST(StressHandles) {\n  v8::Persistent<v8::Context> env = v8::Context::New();\n  v8::HandleScope scope;\n  env->Enter();\n  Handle<Object> o = Test();\n  CHECK(o->IsSmi() && Smi::cast(*o)->value() == 42);\n  env->Exit();\n}\n\n\nstatic Object* TestAccessorGet(Object* object, void*) {\n  return AllocateAfterFailures();\n}\n\n\nconst AccessorDescriptor kDescriptor = {\n  TestAccessorGet,\n  0,\n  0\n};\n\n\nTEST(StressJS) {\n  v8::Persistent<v8::Context> env = v8::Context::New();\n  v8::HandleScope scope;\n  env->Enter();\n  Handle<JSFunction> function =\n      Factory::NewFunction(Factory::function_symbol(), Factory::null_value());\n  \/\/ Force the creation of an initial map and set the code to\n  \/\/ something empty.\n  Factory::NewJSObject(function);\n  function->set_code(Builtins::builtin(Builtins::EmptyFunction));\n  \/\/ Patch the map to have an accessor for \"get\".\n  Handle<Map> map(function->initial_map());\n  Handle<DescriptorArray> instance_descriptors(map->instance_descriptors());\n  Handle<Proxy> proxy = Factory::NewProxy(&kDescriptor);\n  instance_descriptors = Factory::CopyAppendProxyDescriptor(\n      instance_descriptors,\n      Factory::NewStringFromAscii(Vector<const char>(\"get\", 3)),\n      proxy,\n      static_cast<PropertyAttributes>(0));\n  map->set_instance_descriptors(*instance_descriptors);\n  \/\/ Add the Foo constructor the global object.\n  env->Global()->Set(v8::String::New(\"Foo\"), v8::Utils::ToLocal(function));\n  \/\/ Call the accessor through JavaScript.\n  v8::Handle<v8::Value> result =\n      v8::Script::Compile(v8::String::New(\"(new Foo).get\"))->Run();\n  CHECK_EQ(42, result->Int32Value());\n  env->Exit();\n}\n\n\n\/\/ CodeRange test.\n\/\/ Tests memory management in a CodeRange by allocating and freeing blocks,\n\/\/ using a pseudorandom generator to choose block sizes geometrically\n\/\/ distributed between 2 * Page::kPageSize and 2^5 + 1 * Page::kPageSize.\n\/\/ Ensure that the freed chunks are collected and reused by allocating (in\n\/\/ total) more than the size of the CodeRange.\n\n\/\/ This pseudorandom generator does not need to be particularly good.\n\/\/ Use the lower half of the V8::Random() generator.\nunsigned int Pseudorandom() {\n  static uint32_t lo = 2345;\n  lo = 18273 * (lo & 0xFFFF) + (lo >> 16);  \/\/ Provably not 0.\n  return lo & 0xFFFF;\n}\n\n\n\/\/ Plain old data class.  Represents a block of allocated memory.\nclass Block {\n public:\n  Block(void* base_arg, int size_arg)\n      : base(base_arg), size(size_arg) {}\n\n  void *base;\n  int size;\n};\n\n\nTEST(CodeRange) {\n  const int code_range_size = 16*MB;\n  CodeRange::Setup(code_range_size);\n  int current_allocated = 0;\n  int total_allocated = 0;\n  List<Block> blocks(1000);\n\n  while (total_allocated < 5 * code_range_size) {\n    if (current_allocated < code_range_size \/ 10) {\n      \/\/ Allocate a block.\n      \/\/ Geometrically distributed sizes, greater than Page::kPageSize.\n      size_t requested = (Page::kPageSize << (Pseudorandom() % 6)) +\n           Pseudorandom() % 5000 + 1;\n      size_t allocated = 0;\n      void* base = CodeRange::AllocateRawMemory(requested, &allocated);\n      blocks.Add(Block(base, static_cast<int>(allocated)));\n      current_allocated += static_cast<int>(allocated);\n      total_allocated += static_cast<int>(allocated);\n    } else {\n      \/\/ Free a block.\n      int index = Pseudorandom() % blocks.length();\n      CodeRange::FreeRawMemory(blocks[index].base, blocks[index].size);\n      current_allocated -= blocks[index].size;\n      if (index < blocks.length() - 1) {\n        blocks[index] = blocks.RemoveLast();\n      } else {\n        blocks.RemoveLast();\n      }\n    }\n  }\n\n  CodeRange::TearDown();\n}\n<commit_msg>Fix compilation error in r3352<commit_after>\/\/ Copyright 2007-2008 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#include \"accessors.h\"\n#include \"top.h\"\n\n#include \"cctest.h\"\n\n\nusing namespace v8::internal;\n\n\nstatic Object* AllocateAfterFailures() {\n  static int attempts = 0;\n  if (++attempts < 3) return Failure::RetryAfterGC(0);\n\n  \/\/ New space.\n  NewSpace* new_space = Heap::new_space();\n  static const int kNewSpaceFillerSize = ByteArray::SizeFor(0);\n  while (new_space->Available() > kNewSpaceFillerSize) {\n    int available_before = new_space->Available();\n    CHECK(!Heap::AllocateByteArray(0)->IsFailure());\n    if (available_before == new_space->Available()) {\n      \/\/ It seems that we are avoiding new space allocations when\n      \/\/ allocation is forced, so no need to fill up new space\n      \/\/ in order to make the test harder.\n      break;\n    }\n  }\n  CHECK(!Heap::AllocateByteArray(100)->IsFailure());\n  CHECK(!Heap::AllocateFixedArray(100, NOT_TENURED)->IsFailure());\n\n  \/\/ Make sure we can allocate through optimized allocation functions\n  \/\/ for specific kinds.\n  CHECK(!Heap::AllocateFixedArray(100)->IsFailure());\n  CHECK(!Heap::AllocateHeapNumber(0.42)->IsFailure());\n  CHECK(!Heap::AllocateArgumentsObject(Smi::FromInt(87), 10)->IsFailure());\n  Object* object = Heap::AllocateJSObject(*Top::object_function());\n  CHECK(!Heap::CopyJSObject(JSObject::cast(object))->IsFailure());\n\n  \/\/ Old data space.\n  OldSpace* old_data_space = Heap::old_data_space();\n  static const int kOldDataSpaceFillerSize = ByteArray::SizeFor(0);\n  while (old_data_space->Available() > kOldDataSpaceFillerSize) {\n    CHECK(!Heap::AllocateByteArray(0, TENURED)->IsFailure());\n  }\n  CHECK(!Heap::AllocateRawAsciiString(100, TENURED)->IsFailure());\n\n  \/\/ Large object space.\n  while (!Heap::OldGenerationAllocationLimitReached()) {\n    CHECK(!Heap::AllocateFixedArray(10000, TENURED)->IsFailure());\n  }\n  CHECK(!Heap::AllocateFixedArray(10000, TENURED)->IsFailure());\n\n  \/\/ Map space.\n  MapSpace* map_space = Heap::map_space();\n  static const int kMapSpaceFillerSize = Map::kSize;\n  InstanceType instance_type = JS_OBJECT_TYPE;\n  int instance_size = JSObject::kHeaderSize;\n  while (map_space->Available() > kMapSpaceFillerSize) {\n    CHECK(!Heap::AllocateMap(instance_type, instance_size)->IsFailure());\n  }\n  CHECK(!Heap::AllocateMap(instance_type, instance_size)->IsFailure());\n\n  \/\/ Test that we can allocate in old pointer space and code space.\n  CHECK(!Heap::AllocateFixedArray(100, TENURED)->IsFailure());\n  CHECK(!Heap::CopyCode(Builtins::builtin(Builtins::Illegal))->IsFailure());\n\n  \/\/ Return success.\n  return Smi::FromInt(42);\n}\n\n\nstatic Handle<Object> Test() {\n  CALL_HEAP_FUNCTION(AllocateAfterFailures(), Object);\n}\n\n\nTEST(StressHandles) {\n  v8::Persistent<v8::Context> env = v8::Context::New();\n  v8::HandleScope scope;\n  env->Enter();\n  Handle<Object> o = Test();\n  CHECK(o->IsSmi() && Smi::cast(*o)->value() == 42);\n  env->Exit();\n}\n\n\nstatic Object* TestAccessorGet(Object* object, void*) {\n  return AllocateAfterFailures();\n}\n\n\nconst AccessorDescriptor kDescriptor = {\n  TestAccessorGet,\n  0,\n  0\n};\n\n\nTEST(StressJS) {\n  v8::Persistent<v8::Context> env = v8::Context::New();\n  v8::HandleScope scope;\n  env->Enter();\n  Handle<JSFunction> function =\n      Factory::NewFunction(Factory::function_symbol(), Factory::null_value());\n  \/\/ Force the creation of an initial map and set the code to\n  \/\/ something empty.\n  Factory::NewJSObject(function);\n  function->set_code(Builtins::builtin(Builtins::EmptyFunction));\n  \/\/ Patch the map to have an accessor for \"get\".\n  Handle<Map> map(function->initial_map());\n  Handle<DescriptorArray> instance_descriptors(map->instance_descriptors());\n  Handle<Proxy> proxy = Factory::NewProxy(&kDescriptor);\n  instance_descriptors = Factory::CopyAppendProxyDescriptor(\n      instance_descriptors,\n      Factory::NewStringFromAscii(Vector<const char>(\"get\", 3)),\n      proxy,\n      static_cast<PropertyAttributes>(0));\n  map->set_instance_descriptors(*instance_descriptors);\n  \/\/ Add the Foo constructor the global object.\n  env->Global()->Set(v8::String::New(\"Foo\"), v8::Utils::ToLocal(function));\n  \/\/ Call the accessor through JavaScript.\n  v8::Handle<v8::Value> result =\n      v8::Script::Compile(v8::String::New(\"(new Foo).get\"))->Run();\n  CHECK_EQ(42, result->Int32Value());\n  env->Exit();\n}\n\n\n\/\/ CodeRange test.\n\/\/ Tests memory management in a CodeRange by allocating and freeing blocks,\n\/\/ using a pseudorandom generator to choose block sizes geometrically\n\/\/ distributed between 2 * Page::kPageSize and 2^5 + 1 * Page::kPageSize.\n\/\/ Ensure that the freed chunks are collected and reused by allocating (in\n\/\/ total) more than the size of the CodeRange.\n\n\/\/ This pseudorandom generator does not need to be particularly good.\n\/\/ Use the lower half of the V8::Random() generator.\nunsigned int Pseudorandom() {\n  static uint32_t lo = 2345;\n  lo = 18273 * (lo & 0xFFFF) + (lo >> 16);  \/\/ Provably not 0.\n  return lo & 0xFFFF;\n}\n\n\n\/\/ Plain old data class.  Represents a block of allocated memory.\nclass Block {\n public:\n  Block(void* base_arg, int size_arg)\n      : base(base_arg), size(size_arg) {}\n\n  void *base;\n  int size;\n};\n\n\nTEST(CodeRange) {\n  const int code_range_size = 16*MB;\n  CodeRange::Setup(code_range_size);\n  int current_allocated = 0;\n  int total_allocated = 0;\n  List<Block> blocks(1000);\n\n  while (total_allocated < 5 * code_range_size) {\n    if (current_allocated < code_range_size \/ 10) {\n      \/\/ Allocate a block.\n      \/\/ Geometrically distributed sizes, greater than Page::kPageSize.\n      size_t requested = (Page::kPageSize << (Pseudorandom() % 6)) +\n           Pseudorandom() % 5000 + 1;\n      size_t allocated = 0;\n      void* base = CodeRange::AllocateRawMemory(requested, &allocated);\n      blocks.Add(Block(base, static_cast<int>(allocated)));\n      current_allocated += static_cast<int>(allocated);\n      total_allocated += static_cast<int>(allocated);\n    } else {\n      \/\/ Free a block.\n      int index = Pseudorandom() % blocks.length();\n      CodeRange::FreeRawMemory(blocks[index].base, blocks[index].size);\n      current_allocated -= blocks[index].size;\n      if (index < blocks.length() - 1) {\n        blocks[index] = blocks.RemoveLast();\n      } else {\n        blocks.RemoveLast();\n      }\n    }\n  }\n\n  CodeRange::TearDown();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\npromising:\nhttp:\/\/elinux.org\/Interfacing_with_I2C_Devices\nhttps:\/\/i2c.wiki.kernel.org\/index.php\/Main_Page\n*\/\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include \"LSM303.h\"\n#include \"L3G4200D.h\"\n\nint main(int argc, char *argv[])\n{\n    I2CBus i2c(\"\/dev\/i2c-0\");\n    LSM303 compass(i2c);\n    L3G4200D gyro(i2c);\n\n    uint8_t result = compass.readMagReg(LSM303_WHO_AM_I_M);\n    if (result != 0x3C)\n    {\n        std::cerr << \"Error getting \\\"Who Am I\\\" register.\" << std::endl;\n        exit(2);\n    }\n\n    compass.enableDefault();\n    gyro.enableDefault();\n\n    while(1)\n    {\n        compass.read();\n        gyro.read();\n        printf(\"%7d %7d %7d,  %7d %7d %7d,  %7d %7d %7d\\n\",\n               compass.m(0), compass.m(1), compass.m(2),\n               compass.a(0), compass.a(1), compass.a(2),\n               gyro.g(0), gyro.g(1), gyro.g(2)\n        );\n        usleep(100*1000);\n    }\n\n    return 0;\n}\n<commit_msg>Added a calibration feature that just prints out the running mins and maxes.<commit_after>\/*\npromising:\nhttp:\/\/elinux.org\/Interfacing_with_I2C_Devices\nhttps:\/\/i2c.wiki.kernel.org\/index.php\/Main_Page\n*\/\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include \"LSM303.h\"\n#include \"L3G4200D.h\"\n\nvoid streamRawValues(LSM303& compass, L3G4200D& gyro)\n{\n    compass.enableDefault();\n    gyro.enableDefault();\n\n    while(1)\n    {\n        compass.read();\n        gyro.read();\n        printf(\"%7d %7d %7d,  %7d %7d %7d,  %7d %7d %7d\\n\",\n               compass.m(0), compass.m(1), compass.m(2),\n               compass.a(0), compass.a(1), compass.a(2),\n               gyro.g(0), gyro.g(1), gyro.g(2)\n        );\n        usleep(100*1000);\n    }\n}\n\nvoid calibrate(LSM303& compass)\n{\n    compass.enableDefault();\n    int_vector mag_max(0,0,0), mag_min(0,0,0);\n    while(1)\n    {\n        compass.read();\n        mag_min = mag_min.cwiseMin(compass.m);\n        mag_max = mag_max.cwiseMax(compass.m);\n        printf(\"%7d %7d %7d  %7d %7d %7d\\n\",\n               mag_min(0), mag_min(1), mag_min(2),\n               mag_max(0), mag_max(1), mag_max(2));\n        usleep(10*1000);\n    }\n}\n\nint main(int argc, char *argv[])\n{\n    I2CBus i2c(\"\/dev\/i2c-0\");\n    LSM303 compass(i2c);\n    L3G4200D gyro(i2c);\n\n    uint8_t result = compass.readMagReg(LSM303_WHO_AM_I_M);\n    if (result != 0x3C)\n    {\n        std::cerr << \"Error getting \\\"Who Am I\\\" register.\" << std::endl;\n        exit(2);\n    }\n\n    if (argc > 1)\n    {\n        if (0 == strcmp(\"cal\", argv[1]))\n        {\n            calibrate(compass);\n        }\n    }\n\n    streamRawValues(compass, gyro);\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2011 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Visit: 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 \"ParallelPrimeSieve.h\"\n#include \"PrimeSieve.h\"\n#include \"PrimeNumberFinder.h\"\n#include \"defs.h\"\n#include \"imath.h\"\n\n#if defined(_OPENMP)\n  #include <omp.h>\n#endif\n\n#include <cstdlib>\n#include <stdexcept>\n#include <algorithm>\n\nParallelPrimeSieve::ParallelPrimeSieve() :\n  numThreads_(USE_IDEAL_NUM_THREADS), shm_(NULL) {\n  \/\/ prevents prime k-tuplet gaps\n  static_assert(defs::MIN_THREAD_INTERVAL < 100, \"defs::MIN_THREAD_INTERVAL >= 100\");\n}\n\nint ParallelPrimeSieve::getMaxThreads() {\n#if defined(_OPENMP)\n  return omp_get_max_threads();\n#else\n  return 1;\n#endif\n}\n\n\/**\n * Get the current set number of threads for sieving.\n *\/\nint ParallelPrimeSieve::getNumThreads() const {\n  return (numThreads_ == USE_IDEAL_NUM_THREADS)\n      ? this->getIdealNumThreads() \n      : numThreads_;\n}\n\n\/**\n * Set the number of threads for sieving.\n * If numThreads is invalid (numThreads < 1 or > getMaxThreads()) it\n * is set to numThreads = USE_IDEAL_NUM_THREADS.\n *\/\nvoid ParallelPrimeSieve::setNumThreads(int numThreads) {\n  numThreads_ = (numThreads >= 1 && numThreads <= this->getMaxThreads())\n      ? numThreads\n      : USE_IDEAL_NUM_THREADS;\n}\n\nuint64_t ParallelPrimeSieve::getSieveInterval() const {\n  return stopNumber_ - startNumber_;\n}\n\n\/**\n * Get an ideal number of threads for the current set startNumber_,\n * stopNumber_ and flags_.\n *\/\nint ParallelPrimeSieve::getIdealNumThreads() const {\n  \/\/ 1 thread to print primes in sequential order\n  if (flags_ & PRINT_FLAGS)\n    return 1;\n  \/\/ each thread should at least sieve an interval of size n^0.5\/6 and\n  \/\/ not smaller than defs::MIN_THREAD_INTERVAL\n  uint64_t threadThreshold = std::max<uint64_t>(\n      defs::MIN_THREAD_INTERVAL,\n      isqrt(stopNumber_) \/ 6);\n  \/\/ set to maxThreads if the sieve interval is sufficiently large\n  int idealNumThreads = static_cast<int> (\n      std::min<uint64_t>(\n          this->getSieveInterval() \/ threadThreshold,\n          this->getMaxThreads()));\n\n  return std::max<int>(1, idealNumThreads);\n}\n\n\/**\n * Get an interval size that ensures a good load balance among\n * threads whilst sieving.\n *\/\nuint64_t ParallelPrimeSieve::getIdealInterval() const {\n  int numThreads = this->getNumThreads();\n  if (numThreads == 1)\n    return this->getSieveInterval();\n\n  \/\/ idealInterval = n^0.5*2000, 0.1 percent initialization\n  uint64_t idealInterval = std::max<uint64_t>(\n      defs::MIN_THREAD_INTERVAL,\n      static_cast<uint64_t> (isqrt(stopNumber_)) * 2000);\n  \/\/ maximum interval size per thread\n  uint64_t maxThreadInterval = this->getSieveInterval() \/ numThreads;\n  \/\/ correct the user's bad settings\n  if (maxThreadInterval < this->getSieveInterval() &&\n      maxThreadInterval < defs::MIN_THREAD_INTERVAL) {\n    maxThreadInterval = this->getSieveInterval() \/ this->getIdealNumThreads();\n  }\n  return std::min<uint64_t>(idealInterval, maxThreadInterval);\n}\n\n\/**\n * For use with the Qt primesieve application in ..\/qt-gui.\n * Initializes this ParallelPrimeSieve object with values from a\n * shared memory segment.\n *\/\nvoid ParallelPrimeSieve::init(SharedMemory* shm) {\n  if (shm == NULL)\n    throw std::invalid_argument(\n        \"ParallelPrimeSieve: shared memory segment must not be NULL\");\n  shm_ = shm;\n  this->setStartNumber(shm_->startNumber);\n  this->setStopNumber(shm_->stopNumber);\n  this->setSieveSize(shm_->sieveSize);\n  this->setFlags(shm_->flags);\n  this->setNumThreads(shm_->threads);\n}\n\n\/**\n * Calculate the current status in percent of sieve().\n * @param processed The size of the processed interval (segment)\n *\/\nvoid ParallelPrimeSieve::doStatus(uint32_t processed) {\n#if defined(_OPENMP)\n  #pragma omp critical (doStatus)\n#endif\n  {\n    PrimeSieve::doStatus(processed);\n    \/\/ communicate the current status via shared memory\n    \/\/ to the Qt GUI process\n    if (shm_ != NULL)\n      shm_->status = status_;\n  }\n}\n\n\/**\n * Sieve the primes\/prime k-tuplets within [startNumber_, stopNumber_]\n * in parallel using OpenMP.\n *\/\nvoid ParallelPrimeSieve::sieve() {\n  if (stopNumber_ < startNumber_)\n    throw std::invalid_argument(\"STOP must be >= START\");\n\n#if defined(_OPENMP)\n  double t1 = omp_get_wtime();\n  this->reset();\n  uint64_t idealInterval = this->getIdealInterval();\n  uint64_t chunks = (idealInterval == 0)\n      ? 1 : this->getSieveInterval() \/ idealInterval;\n  uint64_t maxOffset = chunks * idealInterval;\n  uint64_t maxStop = startNumber_ + maxOffset + 32 - maxOffset % 30;\n  if (maxStop < stopNumber_)\n    chunks++;\n  int numThreads = this->getNumThreads();\n\n  \/\/ the sieve interval [startNumber_, stopNumber_] is split into\n  \/\/ numerous sub-intervals that are processed in parallel\n  #pragma omp parallel for num_threads(numThreads) schedule(dynamic)\n  for (int64_t i = 0; i < static_cast<int64_t> (chunks); i++) {\n    uint64_t start = startNumber_ + idealInterval * i;\n    uint64_t stop = startNumber_ + idealInterval * (i+1);\n    \/\/ start\/stop numbers must be chosen carefully for PrimeSieve\n    \/\/ objects to prevent prime k-tuplets gaps\n    if (i > 0)\n      start += 32 - start % 30;\n    stop += 32 - stop % 30;\n    \/\/ sieve the primes within [start, stop]\n    PrimeSieve ps(start, std::min<uint64_t>(stop, stopNumber_), this);\n    ps.sieve();\n    #pragma omp critical (counts)\n    for (uint32_t j = 0; j < COUNTS_SIZE; j++)\n      counts_[j] += ps.getCounts(j);\n  }\n  timeElapsed_ = omp_get_wtime() - t1;\n#else\n  PrimeSieve::sieve();\n#endif\n  \/\/ communicate the sieving results via shared memory\n  \/\/ segment to the Qt GUI process\n  if (shm_ != NULL) {\n    for (uint32_t i = 0; i < COUNTS_SIZE; i++)\n      shm_->counts[i] = counts_[i];\n    shm_->timeElapsed = timeElapsed_;\n  }\n}\n<commit_msg>fixed static_assert<commit_after>\/\/\n\/\/ Copyright (c) 2011 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Visit: 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 \"ParallelPrimeSieve.h\"\n#include \"PrimeSieve.h\"\n#include \"PrimeNumberFinder.h\"\n#include \"defs.h\"\n#include \"imath.h\"\n\n#if defined(_OPENMP)\n  #include <omp.h>\n#endif\n\n#include <cstdlib>\n#include <stdexcept>\n#include <algorithm>\n\nParallelPrimeSieve::ParallelPrimeSieve() :\n  numThreads_(USE_IDEAL_NUM_THREADS), shm_(NULL) {\n  \/\/ prevents prime k-tuplet gaps\n  static_assert(defs::MIN_THREAD_INTERVAL >= 100,\n               \"defs::MIN_THREAD_INTERVAL >= 100\");\n}\n\nint ParallelPrimeSieve::getMaxThreads() {\n#if defined(_OPENMP)\n  return omp_get_max_threads();\n#else\n  return 1;\n#endif\n}\n\n\/**\n * Get the current set number of threads for sieving.\n *\/\nint ParallelPrimeSieve::getNumThreads() const {\n  return (numThreads_ == USE_IDEAL_NUM_THREADS)\n      ? this->getIdealNumThreads() \n      : numThreads_;\n}\n\n\/**\n * Set the number of threads for sieving.\n * If numThreads is invalid (numThreads < 1 or > getMaxThreads()) it\n * is set to numThreads = USE_IDEAL_NUM_THREADS.\n *\/\nvoid ParallelPrimeSieve::setNumThreads(int numThreads) {\n  numThreads_ = (numThreads >= 1 && numThreads <= this->getMaxThreads())\n      ? numThreads\n      : USE_IDEAL_NUM_THREADS;\n}\n\nuint64_t ParallelPrimeSieve::getSieveInterval() const {\n  return stopNumber_ - startNumber_;\n}\n\n\/**\n * Get an ideal number of threads for the current set startNumber_,\n * stopNumber_ and flags_.\n *\/\nint ParallelPrimeSieve::getIdealNumThreads() const {\n  \/\/ 1 thread to print primes in sequential order\n  if (flags_ & PRINT_FLAGS)\n    return 1;\n  \/\/ each thread should at least sieve an interval of size n^0.5\/6 and\n  \/\/ not smaller than defs::MIN_THREAD_INTERVAL\n  uint64_t threadThreshold = std::max<uint64_t>(\n      defs::MIN_THREAD_INTERVAL,\n      isqrt(stopNumber_) \/ 6);\n  \/\/ set to maxThreads if the sieve interval is sufficiently large\n  int idealNumThreads = static_cast<int> (\n      std::min<uint64_t>(\n          this->getSieveInterval() \/ threadThreshold,\n          this->getMaxThreads()));\n\n  return std::max<int>(1, idealNumThreads);\n}\n\n\/**\n * Get an interval size that ensures a good load balance among\n * threads whilst sieving.\n *\/\nuint64_t ParallelPrimeSieve::getIdealInterval() const {\n  int numThreads = this->getNumThreads();\n  if (numThreads == 1)\n    return this->getSieveInterval();\n\n  \/\/ idealInterval = n^0.5*2000, 0.1 percent initialization\n  uint64_t idealInterval = std::max<uint64_t>(\n      defs::MIN_THREAD_INTERVAL,\n      static_cast<uint64_t> (isqrt(stopNumber_)) * 2000);\n  \/\/ maximum interval size per thread\n  uint64_t maxThreadInterval = this->getSieveInterval() \/ numThreads;\n  \/\/ correct the user's bad settings\n  if (maxThreadInterval < this->getSieveInterval() &&\n      maxThreadInterval < defs::MIN_THREAD_INTERVAL) {\n    maxThreadInterval = this->getSieveInterval() \/ this->getIdealNumThreads();\n  }\n  return std::min<uint64_t>(idealInterval, maxThreadInterval);\n}\n\n\/**\n * For use with the Qt primesieve application in ..\/qt-gui.\n * Initializes this ParallelPrimeSieve object with values from a\n * shared memory segment.\n *\/\nvoid ParallelPrimeSieve::init(SharedMemory* shm) {\n  if (shm == NULL)\n    throw std::invalid_argument(\n        \"ParallelPrimeSieve: shared memory segment must not be NULL\");\n  shm_ = shm;\n  this->setStartNumber(shm_->startNumber);\n  this->setStopNumber(shm_->stopNumber);\n  this->setSieveSize(shm_->sieveSize);\n  this->setFlags(shm_->flags);\n  this->setNumThreads(shm_->threads);\n}\n\n\/**\n * Calculate the current status in percent of sieve().\n * @param processed The size of the processed interval (segment)\n *\/\nvoid ParallelPrimeSieve::doStatus(uint32_t processed) {\n#if defined(_OPENMP)\n  #pragma omp critical (doStatus)\n#endif\n  {\n    PrimeSieve::doStatus(processed);\n    \/\/ communicate the current status via shared memory\n    \/\/ to the Qt GUI process\n    if (shm_ != NULL)\n      shm_->status = status_;\n  }\n}\n\n\/**\n * Sieve the primes\/prime k-tuplets within [startNumber_, stopNumber_]\n * in parallel using OpenMP.\n *\/\nvoid ParallelPrimeSieve::sieve() {\n  if (stopNumber_ < startNumber_)\n    throw std::invalid_argument(\"STOP must be >= START\");\n\n#if defined(_OPENMP)\n  double t1 = omp_get_wtime();\n  this->reset();\n  uint64_t idealInterval = this->getIdealInterval();\n  uint64_t chunks = (idealInterval == 0)\n      ? 1 : this->getSieveInterval() \/ idealInterval;\n  uint64_t maxOffset = chunks * idealInterval;\n  uint64_t maxStop = startNumber_ + maxOffset + 32 - maxOffset % 30;\n  if (maxStop < stopNumber_)\n    chunks++;\n  int numThreads = this->getNumThreads();\n\n  \/\/ the sieve interval [startNumber_, stopNumber_] is split into\n  \/\/ numerous sub-intervals that are processed in parallel\n  #pragma omp parallel for num_threads(numThreads) schedule(dynamic)\n  for (int64_t i = 0; i < static_cast<int64_t> (chunks); i++) {\n    uint64_t start = startNumber_ + idealInterval * i;\n    uint64_t stop = startNumber_ + idealInterval * (i+1);\n    \/\/ start\/stop numbers must be chosen carefully for PrimeSieve\n    \/\/ objects to prevent prime k-tuplets gaps\n    if (i > 0)\n      start += 32 - start % 30;\n    stop += 32 - stop % 30;\n    \/\/ sieve the primes within [start, stop]\n    PrimeSieve ps(start, std::min<uint64_t>(stop, stopNumber_), this);\n    ps.sieve();\n    #pragma omp critical (counts)\n    for (uint32_t j = 0; j < COUNTS_SIZE; j++)\n      counts_[j] += ps.getCounts(j);\n  }\n  timeElapsed_ = omp_get_wtime() - t1;\n#else\n  PrimeSieve::sieve();\n#endif\n  \/\/ communicate the sieving results via shared memory\n  \/\/ segment to the Qt GUI process\n  if (shm_ != NULL) {\n    for (uint32_t i = 0; i < COUNTS_SIZE; i++)\n      shm_->counts[i] = counts_[i];\n    shm_->timeElapsed = timeElapsed_;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"vector.h\"\n#include \"MinIMU9.h\"\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <sys\/time.h>\n#include <system_error>\n\n\/\/ TODO: print warning if accelerometer magnitude is not close to 1 when starting up\n\nint millis()\n{\n    struct timeval tv;\n    gettimeofday(&tv, NULL);\n    return (tv.tv_sec) * 1000 + (tv.tv_usec)\/1000;\n}\n\nvoid print(matrix m)\n{\n    printf(\"%7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f\",\n           m(0,0), m(0,1), m(0,2),\n           m(1,0), m(1,1), m(1,2),\n           m(2,0), m(2,1), m(2,2));\n}\n\nvoid streamRawValues(IMU& imu)\n{\n    imu.enable();\n    while(1)\n    {\n        imu.read();\n        printf(\"%7d %7d %7d  %7d %7d %7d  %7d %7d %7d\\n\",\n               imu.raw_m[0], imu.raw_m[1], imu.raw_m[2],\n               imu.raw_a[0], imu.raw_a[1], imu.raw_a[2],\n               imu.raw_g[0], imu.raw_g[1], imu.raw_g[2]\n        );\n        usleep(20*1000);\n    }\n}\n\nmatrix rotationFromCompass(const vector& acceleration, const vector& magnetic_field)\n{\n    vector up = acceleration;     \/\/ usually true\n    vector magnetic_east = magnetic_field.cross(up);\n    vector east = magnetic_east;  \/\/ a rough approximation\n    vector north = up.cross(east);\n\n    matrix rotationFromCompass;\n    rotationFromCompass.row(0) = east;\n    rotationFromCompass.row(1) = north;\n    rotationFromCompass.row(2) = up;\n    rotationFromCompass.row(0).normalize();\n    rotationFromCompass.row(1).normalize();\n    rotationFromCompass.row(2).normalize();\n\n    return rotationFromCompass;\n}\n\nfloat heading(matrix rotation)\n{\n    \/\/ The board's x axis in earth coordinates.\n    vector x = rotation.col(0);\n    x.normalize();\n    x(2) = 0;\n    \/\/float heading_weight = x.norm();\n\n    \/\/ 0 = east, pi\/2 = north\n    return atan2(x(1), x(0));\n}\n\ntypedef void fuse_function(quaternion& rotation, float dt, const vector& angular_velocity,\n                  const vector& acceleration, const vector& magnetic_field);\n\n\nvoid fuse_compass_only(quaternion& rotation, float dt, const vector& angular_velocity,\n  const vector& acceleration, const vector& magnetic_field)\n{\n    rotation = rotationFromCompass(acceleration, magnetic_field);\n}\n\n\nvoid fuse_gyro_only(quaternion& rotation, float dt, const vector& angular_velocity,\n  const vector& acceleration, const vector& magnetic_field)\n{\n    quaternion w = quaternion(1, angular_velocity(0)*dt\/2, angular_velocity(1)*dt\/2, angular_velocity(2)*dt\/2);\n\n    \/\/ UM6 does: rotation += rotation*w;\n    rotation = rotation*w;\n    rotation.normalize();\n\n    \/\/ TODO: finish this algorithm\n\n    \/\/rotation *= updateMatrix(angular_velocity, dt);\n    \/\/rotation = normalize(rotation);\n}\n\n#define Kp_ROLLPITCH 1\n#define Ki_ROLLPITCH 0.00002\n#define Kp_YAW 1\n#define Ki_YAW 0.00002\n\n#define PI 3.14159265\n\nvoid fuse_default(quaternion& rotation, float dt, const vector& angular_velocity,\n  const vector& acceleration, const vector& magnetic_field)\n{\n    rotation = quaternion::Identity();\n    \/\/ TODO: finish this algorithm\n\n    \/\/matrix rotationCompass = rotationFromCompass(acceleration, magnetic_field);\n\n    \/\/ We trust the accelerometer more if it is telling us 1G.\n    \/\/float accel_weight = 1 - 2*abs(1 - acceleration.norm());\n    \/\/if (accel_weight < 0){ accel_weight = 0; }\n\n    \/\/ Add a \"torque\" that makes our up vector (rotation.row(2))\n    \/\/ get closer to the acceleration vector.\n    \/\/vector errorRollPitch = acceleration.cross(rotation.row(2)) * accel_weight;\n \n    \/\/ Add a \"torque\" that makes our east vector (rotation.row(0))\n    \/\/ get closer to east vector calculated from the compass.\n    \/\/vector errorYaw = rotationCompass.row(0).cross(rotation.row(0));\n\n    \/\/vector drift_correction = errorYaw * Kp_YAW + errorRollPitch * Kp_ROLLPITCH;\n\n    \/\/rotation *= updateMatrix(angular_velocity + drift_correction, dt);\n    \/\/rotation = normalize(rotation);\n}\n\nvoid ahrs(IMU& imu, fuse_function * fuse_func)\n{\n    imu.loadCalibration();\n    imu.enable();\n    imu.measureOffsets();\n    \n    \/\/ The quaternion that can convert a vector in body coordinates\n    \/\/ to ground coordinates when it its changed to a matrix.\n    quaternion rotation = quaternion::Identity();\n\n    int start = millis(); \/\/ truncate 64-bit return value\n    while(1)\n    {\n        int last_start = start;\n        start = millis();\n        float dt = (start-last_start)\/1000.0;\n        if (dt < 0){ throw std::runtime_error(\"time went backwards\"); }\n\n        vector angular_velocity = imu.readGyro();\n        vector acceleration = imu.readAcc();\n        vector magnetic_field = imu.readMag();\n\n        fuse_func(rotation, dt, angular_velocity, acceleration, magnetic_field);\n\n        matrix r = rotation.matrix();\n        printf(\"%7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f  %7.4f %7.4f %7.4f  %7.4f %7.4f %7.4f\\n\",\n               r(0,0), r(0,1), r(0,2),\n               r(1,0), r(1,1), r(1,2),\n               r(2,0), r(2,1), r(2,2),\n               acceleration(0), acceleration(1), acceleration(2),\n               magnetic_field(0), magnetic_field(1), magnetic_field(2));\n        fflush(stdout);\n\n        \/\/ Ensure that each iteration of the loop takes at least 20 ms.\n        while(millis() - start < 20)\n        {\n            usleep(1000);\n        }\n    }\n}\n\nint main(int argc, char *argv[])\n{\n    try\n    {\n        MinIMU9 imu(\"\/dev\/i2c-0\");\n        \n        imu.checkConnection();\n\n        if (argc > 1)\n        {\n            const char * action = argv[1];\n            if (0 == strcmp(\"raw\", action))\n            {\n                streamRawValues(imu);\n            }\n            else if (0 == strcmp(\"gyro-only\", action))\n            {\n                ahrs(imu, &fuse_gyro_only);\n            }\n            else if (0 == strcmp(\"compass-only\", action))\n            {\n                ahrs(imu, &fuse_compass_only);\n            }\n            else\n            {\n                fprintf(stderr, \"Unknown action '%s'.\\n\", action);\n                return 3;\n            }\n        }\n        else\n        {\n            ahrs(imu, &fuse_default);\n        }        \n        return 0;\n    }\n    catch(const std::system_error & error)\n    {\n        std::string what = error.what();\n        const std::error_code & code = error.code();\n        std::cerr << \"Error: \" << what << \"  \" << code.message() << \" (\" << code << \")\\n\";\n    }\n    catch(const std::exception & error)    \n    {\n        std::cerr << \"Error: \" << error.what() << '\\n';\n    }\n    return 1;\n}\n<commit_msg>Simplified fuse_gyro_only.<commit_after>#include \"vector.h\"\n#include \"MinIMU9.h\"\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <sys\/time.h>\n#include <system_error>\n\n\/\/ TODO: print warning if accelerometer magnitude is not close to 1 when starting up\n\nint millis()\n{\n    struct timeval tv;\n    gettimeofday(&tv, NULL);\n    return (tv.tv_sec) * 1000 + (tv.tv_usec)\/1000;\n}\n\nvoid print(matrix m)\n{\n    printf(\"%7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f\",\n           m(0,0), m(0,1), m(0,2),\n           m(1,0), m(1,1), m(1,2),\n           m(2,0), m(2,1), m(2,2));\n}\n\nvoid streamRawValues(IMU& imu)\n{\n    imu.enable();\n    while(1)\n    {\n        imu.read();\n        printf(\"%7d %7d %7d  %7d %7d %7d  %7d %7d %7d\\n\",\n               imu.raw_m[0], imu.raw_m[1], imu.raw_m[2],\n               imu.raw_a[0], imu.raw_a[1], imu.raw_a[2],\n               imu.raw_g[0], imu.raw_g[1], imu.raw_g[2]\n        );\n        usleep(20*1000);\n    }\n}\n\nmatrix rotationFromCompass(const vector& acceleration, const vector& magnetic_field)\n{\n    vector up = acceleration;     \/\/ usually true\n    vector magnetic_east = magnetic_field.cross(up);\n    vector east = magnetic_east;  \/\/ a rough approximation\n    vector north = up.cross(east);\n\n    matrix rotationFromCompass;\n    rotationFromCompass.row(0) = east;\n    rotationFromCompass.row(1) = north;\n    rotationFromCompass.row(2) = up;\n    rotationFromCompass.row(0).normalize();\n    rotationFromCompass.row(1).normalize();\n    rotationFromCompass.row(2).normalize();\n\n    return rotationFromCompass;\n}\n\nfloat heading(matrix rotation)\n{\n    \/\/ The board's x axis in earth coordinates.\n    vector x = rotation.col(0);\n    x.normalize();\n    x(2) = 0;\n    \/\/float heading_weight = x.norm();\n\n    \/\/ 0 = east, pi\/2 = north\n    return atan2(x(1), x(0));\n}\n\ntypedef void fuse_function(quaternion& rotation, float dt, const vector& angular_velocity,\n                  const vector& acceleration, const vector& magnetic_field);\n\n\nvoid fuse_compass_only(quaternion& rotation, float dt, const vector& angular_velocity,\n  const vector& acceleration, const vector& magnetic_field)\n{\n    rotation = rotationFromCompass(acceleration, magnetic_field);\n}\n\n\nvoid fuse_gyro_only(quaternion& rotation, float dt, const vector& angular_velocity,\n  const vector& acceleration, const vector& magnetic_field)\n{\n    \/\/ First order approximation of the quaternion representing this rotation.\n    quaternion w = quaternion(1, angular_velocity(0)*dt\/2, angular_velocity(1)*dt\/2, angular_velocity(2)*dt\/2);\n\n    \/\/ UM6 does: rotation += rotation*w, except their w has a 0 for the first component;\n    \/\/ Is that the same as what we are doing?\n    rotation *= w;\n    rotation.normalize();\n}\n\n#define Kp_ROLLPITCH 1\n#define Ki_ROLLPITCH 0.00002\n#define Kp_YAW 1\n#define Ki_YAW 0.00002\n\n#define PI 3.14159265\n\nvoid fuse_default(quaternion& rotation, float dt, const vector& angular_velocity,\n  const vector& acceleration, const vector& magnetic_field)\n{\n    rotation = quaternion::Identity();\n    \/\/ TODO: finish this algorithm\n\n    \/\/matrix rotationCompass = rotationFromCompass(acceleration, magnetic_field);\n\n    \/\/ We trust the accelerometer more if it is telling us 1G.\n    \/\/float accel_weight = 1 - 2*abs(1 - acceleration.norm());\n    \/\/if (accel_weight < 0){ accel_weight = 0; }\n\n    \/\/ Add a \"torque\" that makes our up vector (rotation.row(2))\n    \/\/ get closer to the acceleration vector.\n    \/\/vector errorRollPitch = acceleration.cross(rotation.row(2)) * accel_weight;\n \n    \/\/ Add a \"torque\" that makes our east vector (rotation.row(0))\n    \/\/ get closer to east vector calculated from the compass.\n    \/\/vector errorYaw = rotationCompass.row(0).cross(rotation.row(0));\n\n    \/\/vector drift_correction = errorYaw * Kp_YAW + errorRollPitch * Kp_ROLLPITCH;\n\n    \/\/rotation *= updateMatrix(angular_velocity + drift_correction, dt);\n    \/\/rotation = normalize(rotation);\n}\n\nvoid ahrs(IMU& imu, fuse_function * fuse_func)\n{\n    imu.loadCalibration();\n    imu.enable();\n    imu.measureOffsets();\n    \n    \/\/ The quaternion that can convert a vector in body coordinates\n    \/\/ to ground coordinates when it its changed to a matrix.\n    quaternion rotation = quaternion::Identity();\n\n    int start = millis(); \/\/ truncate 64-bit return value\n    while(1)\n    {\n        int last_start = start;\n        start = millis();\n        float dt = (start-last_start)\/1000.0;\n        if (dt < 0){ throw std::runtime_error(\"time went backwards\"); }\n\n        vector angular_velocity = imu.readGyro();\n        vector acceleration = imu.readAcc();\n        vector magnetic_field = imu.readMag();\n\n        fuse_func(rotation, dt, angular_velocity, acceleration, magnetic_field);\n\n        matrix r = rotation.matrix();\n        printf(\"%7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f %7.4f  %7.4f %7.4f %7.4f  %7.4f %7.4f %7.4f\\n\",\n               r(0,0), r(0,1), r(0,2),\n               r(1,0), r(1,1), r(1,2),\n               r(2,0), r(2,1), r(2,2),\n               acceleration(0), acceleration(1), acceleration(2),\n               magnetic_field(0), magnetic_field(1), magnetic_field(2));\n        fflush(stdout);\n\n        \/\/ Ensure that each iteration of the loop takes at least 20 ms.\n        while(millis() - start < 20)\n        {\n            usleep(1000);\n        }\n    }\n}\n\nint main(int argc, char *argv[])\n{\n    try\n    {\n        MinIMU9 imu(\"\/dev\/i2c-0\");\n        \n        imu.checkConnection();\n\n        if (argc > 1)\n        {\n            const char * action = argv[1];\n            if (0 == strcmp(\"raw\", action))\n            {\n                streamRawValues(imu);\n            }\n            else if (0 == strcmp(\"gyro-only\", action))\n            {\n                ahrs(imu, &fuse_gyro_only);\n            }\n            else if (0 == strcmp(\"compass-only\", action))\n            {\n                ahrs(imu, &fuse_compass_only);\n            }\n            else\n            {\n                fprintf(stderr, \"Unknown action '%s'.\\n\", action);\n                return 3;\n            }\n        }\n        else\n        {\n            ahrs(imu, &fuse_default);\n        }        \n        return 0;\n    }\n    catch(const std::system_error & error)\n    {\n        std::string what = error.what();\n        const std::error_code & code = error.code();\n        std::cerr << \"Error: \" << what << \"  \" << code.message() << \" (\" << code << \")\\n\";\n    }\n    catch(const std::exception & error)    \n    {\n        std::cerr << \"Error: \" << error.what() << '\\n';\n    }\n    return 1;\n}\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#include \"zorbautils\/fatal.h\"\n#include \"zorbatypes\/xqpstring.h\"\n#include \"store\/naive\/nsbindings.h\"\n\nnamespace zorba { namespace simplestore {\n\nNsBindingsContext::NsBindingsContext(ulong numBindings)\n{\n  theBindings.resize(numBindings);\n#if 0\n  std::cout << \"Create binding context1 \" << this << \"; num bindings = \"\n            << numBindings << std::endl;\n#endif\n}\n\n\nNsBindingsContext::NsBindingsContext(const store::NsBindings& bindings)\n  :\n  theBindings(bindings)\n{\n#if 0\n  std::cout << \"Create binding context2 \" << this << \"; num bindings = \"\n            << bindings.size() << std::endl;\n#endif\n}\n\n\nNsBindingsContext::~NsBindingsContext()\n{\n#if 0\n  std::cout << \"Removing binding context \" << this << \"; num bindings = \"\n            << theBindings.size() << std::endl;\n#endif\n}\n\n\nxqpStringStore* NsBindingsContext::findBinding(const xqpStringStore* prefix) const\n{\n  const NsBindingsContext* currentContext = this;\n\n  while (currentContext != NULL)\n  {\n    const store::NsBindings& bindings = currentContext->theBindings;\n    ulong numBindings = bindings.size();\n\n    for (ulong i = 0; i < numBindings; i++)\n    {\n      if (bindings[i].first.getStore()->byteEqual(*prefix))\n        return bindings[i].second.getStore();\n    }\n\n    currentContext = currentContext->getParent();\n  }\n\n  return NULL;\n}\n\n\nvoid NsBindingsContext::addBinding(\n    xqpStringStore* prefix,\n    xqpStringStore* ns)\n{\n  ulong numBindings = theBindings.size();\n\n  for (ulong i = 0; i < numBindings; i++)\n  {\n    if (theBindings[i].first.getStore()->byteEqual(*prefix))\n    {\n      ZORBA_FATAL(theBindings[i].second.getStore()->byteEqual(*ns), \"\");\n\n      return;\n    }\n  }\n\n  theBindings.push_back(std::pair<xqpString, xqpString>(prefix, ns));\n}\n\n\nvoid NsBindingsContext::removeBinding(\n    xqpStringStore* prefix,\n    xqpStringStore* ns)\n{\n  ulong numBindings = theBindings.size();\n\n  for (ulong i = 0; i < numBindings; i++)\n  {\n    if (theBindings[i].first.getStore()->byteEqual(*prefix))\n    {\n      ZORBA_FATAL(theBindings[i].second.getStore()->byteEqual(*ns), \"\");\n\n      theBindings.erase(theBindings.begin() + i);\n      return;\n    }\n  }\n}\n\n} \/\/ namespace store\n} \/\/ namespace zorba\n\n<commit_msg>Fixed some tests.<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#include \"zorbautils\/fatal.h\"\n#include \"zorbatypes\/xqpstring.h\"\n#include \"store\/naive\/nsbindings.h\"\n\nnamespace zorba { namespace simplestore {\n\nNsBindingsContext::NsBindingsContext(ulong numBindings)\n{\n  theBindings.resize(numBindings);\n#if 0\n  std::cout << \"Create binding context1 \" << this << \"; num bindings = \"\n            << numBindings << std::endl;\n#endif\n}\n\n\nNsBindingsContext::NsBindingsContext(const store::NsBindings& bindings)\n  :\n  theBindings(bindings)\n{\n#if 0\n  std::cout << \"Create binding context2 \" << this << \"; num bindings = \"\n            << bindings.size() << std::endl;\n#endif\n}\n\n\nNsBindingsContext::~NsBindingsContext()\n{\n#if 0\n  std::cout << \"Removing binding context \" << this << \"; num bindings = \"\n            << theBindings.size() << std::endl;\n#endif\n}\n\n\nxqpStringStore* NsBindingsContext::findBinding(const xqpStringStore* prefix) const\n{\n  const NsBindingsContext* currentContext = this;\n\n  while (currentContext != NULL)\n  {\n    const store::NsBindings& bindings = currentContext->theBindings;\n    ulong numBindings = bindings.size();\n\n    for (ulong i = 0; i < numBindings; i++)\n    {\n      if (bindings[i].first.getStore()->byteEqual(*prefix))\n        return bindings[i].second.getStore();\n    }\n\n    currentContext = currentContext->getParent();\n  }\n\n  return NULL;\n}\n\n\nvoid NsBindingsContext::addBinding(\n    xqpStringStore* prefix,\n    xqpStringStore* ns)\n{\n  ulong numBindings = theBindings.size();\n\n  for (ulong i = 0; i < numBindings; i++)\n  {\n    if (theBindings[i].first.getStore()->byteEqual(*prefix))\n    {\n      if(!theBindings[i].second.getStore()->byteEqual(*ns))\n      {\n        ZORBA_FATAL(theBindings[i].second.getStore()->byteEqual(*ns), \"\");\n      }\n      return;\n    }\n  }\n\n  theBindings.push_back(std::pair<xqpString, xqpString>(prefix, ns));\n}\n\n\nvoid NsBindingsContext::removeBinding(\n    xqpStringStore* prefix,\n    xqpStringStore* ns)\n{\n  ulong numBindings = theBindings.size();\n\n  for (ulong i = 0; i < numBindings; i++)\n  {\n    if (theBindings[i].first.getStore()->byteEqual(*prefix))\n    {\n      ZORBA_FATAL(theBindings[i].second.getStore()->byteEqual(*ns), \"\");\n\n      theBindings.erase(theBindings.begin() + i);\n      return;\n    }\n  }\n}\n\n} \/\/ namespace store\n} \/\/ namespace zorba\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: SlsQueueProcessor.hxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: vg $ $Date: 2008-02-12 16:27:37 $\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_QUEUE_PROCESSOR_HXX\n#define SD_SLIDESORTER_QUEUE_PROCESSOR_HXX\n\n#include \"SlsRequestPriorityClass.hxx\"\n#include \"view\/SlsPageObject.hxx\"\n#include \"view\/SlideSorterView.hxx\"\n#include \"tools\/IdleDetection.hxx\"\n#include \"SlsBitmapCache.hxx\"\n#include \"taskpane\/SlideSorterCacheDisplay.hxx\"\n#include \"sdpage.hxx\"\n#include \"Window.hxx\"\n\n#include <svx\/svdpagv.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/timer.hxx>\n\n#include <view\/SlsPageObjectViewObjectContact.hxx>\n\n\/\/ Uncomment the define below to have some more OSL_TRACE messages.\n#ifdef DEBUG\n\/\/#define VERBOSE\n#endif\n\nnamespace sd { namespace slidesorter { namespace view {\nclass SlideSorterView;\n} } }\n\n\nnamespace sd { namespace slidesorter { namespace cache {\n\n\/** This non-template base class exists primarily as a place for\n    implementing the timer callback.\n*\/\nclass QueueProcessorBase\n{\npublic:\n    QueueProcessorBase (void);\n    virtual ~QueueProcessorBase();\n\n    \/** Start the processor.  This implementation is timer based and waits\n        an defined amount of time that depends on the given argument before\n        the next entry in the queue is processed.\n        @param nPriorityClass\n            A priority class of 0 tells the processor that a high priority\n            request is waiting in the queue.  The time to wait is thus\n            shorter then that for a low priority request (denoted by a value\n            of 1.)  When the timer is already running it is not modified.\n    *\/\n    void Start (int nPriorityClass = 0);\n    void Stop (void);\n\nprotected:\n    virtual void ProcessRequest (void) = 0;\n\n    sal_uInt32 mnTimeBetweenHighPriorityRequests;\n    sal_uInt32 mnTimeBetweenLowPriorityRequests;\n    sal_uInt32 mnTimeBetweenRequestsWhenNotIdle;\n\nprivate:\n    \/\/\/ This time controls when to process the next element from the queue.\n    Timer maTimer;\n    DECL_LINK(ProcessRequestHdl, Timer*);\n};\n\n\n\n\n\/** This queue processor is timer based, i.e. when an entry is added to the\n    queue and the processor is started with Start() in the base class a\n    timer is started that eventually calls ProcessRequest().  This is\n    repeated until the queue is empty or Stop() is called.\n*\/\ntemplate <class Queue,\n          class RequestData,\n          class BitmapFactory>\n    class QueueProcessor\n    : public QueueProcessorBase\n{\npublic:\n    QueueProcessor (\n        view::SlideSorterView& rView,\n        Queue& rQueue,\n        const ::boost::shared_ptr<BitmapCache>& rpCache);\n    virtual ~QueueProcessor();\n\n    void Terminate (void);\n\n    \/** As we can not really terminate the rendering of a preview bitmap for\n        a request in midair this method acts more like a semaphor.  It\n        returns only when it is save for the caller to delete the request.\n        For this to work it is important to remove the request from the\n        queue before calling this method.\n    *\/\n    void RemoveRequest (RequestData& rRequest);\n\n    \/** Use this method when the page cache is (maybe) using a different\n        BitmapCache.  This is usually necessary after calling\n        PageCacheManager::ChangeSize().\n    *\/\n    void SetBitmapCache (const ::boost::shared_ptr<BitmapCache>& rpCache);\n\nprivate:\n    \/** This mutex is used to guard the queue processor.  Be carefull not to\n        mix its use with that of the solar mutex.\n    *\/\n    ::osl::Mutex maMutex;\n\n    view::SlideSorterView& mrView;\n    Queue& mrQueue;\n    ::boost::shared_ptr<BitmapCache> mpCache;\n    BitmapFactory maBitmapFactory;\n\n    virtual void ProcessRequest (void);\n};\n\n\n\n\n\/\/=====  QueueProcessor  ======================================================\n\ntemplate <class Queue, class RequestData, class BitmapFactory>\n    QueueProcessor<Queue, RequestData, BitmapFactory>::QueueProcessor (\n        view::SlideSorterView& rView,\n        Queue& rQueue,\n        const ::boost::shared_ptr<BitmapCache>& rpCache)\n        : maMutex(),\n          mrView (rView),\n          mrQueue (rQueue),\n          mpCache (rpCache),\n          maBitmapFactory(rView)\n{\n}\n\ntemplate <class Queue, class RequestData, class BitmapFactory>\nQueueProcessor<Queue, RequestData, BitmapFactory>::~QueueProcessor()\n{\n}\n\n\ntemplate <class Queue, class RequestData, class BitmapFactory>\n    void QueueProcessor<Queue, RequestData, BitmapFactory>::ProcessRequest (void)\n{\n    bool bIsShowingFullScreenShow (false);\n\n    while ( ! mrQueue.IsEmpty())\n    {\n        \/\/ Determine whether the system is idle.\n        sal_Int32 nIdleState (tools::IdleDetection::GetIdleState(static_cast< ::Window* >(mrView.GetWindow())));\n        if (nIdleState != tools::IdleDetection::IDET_IDLE)\n        {\n            if ((nIdleState&tools::IdleDetection::IDET_FULL_SCREEN_SHOW_ACTIVE) != 0)\n                bIsShowingFullScreenShow = true;\n            break;\n        }\n\n        RequestData* pRequest = NULL;\n        RequestPriorityClass ePriorityClass (NOT_VISIBLE);\n        bool bRequestIsValid = false;\n        Rectangle aDirtyRectangle;\n        Size aPreviewPixelSize;\n        const SdrPage* pPage = NULL;\n        {\n            ::osl::MutexGuard aGuard (mrQueue.GetMutex());\n\n            if ( ! mrQueue.IsEmpty())\n            {\n                \/\/ Get the requeuest with the highest priority from the\n                \/\/ queue.\n                ePriorityClass = mrQueue.GetFrontPriorityClass();\n                pRequest = &mrQueue.GetFront();\n                mrQueue.PopFront();\n                if (pRequest != NULL)\n                {\n                    \/\/ Save some values while we hold the mutex of the queue.\n                    pPage = pRequest->GetPage();\n                    aDirtyRectangle = pRequest->GetViewContact().GetPaintRectangle();\n                    aPreviewPixelSize = pRequest->GetBoundingBox(\n                        *mrView.GetWindow(),\n                        view::PageObjectViewObjectContact::PreviewBoundingBox,\n                        view::PageObjectViewObjectContact::PixelCoordinateSystem).GetSize();\n                    bRequestIsValid = true;\n                    SSCD_SET_STATUS(pPage,RENDERING);\n                }\n            }\n        }\n        if (bRequestIsValid)\n        {\n#ifdef VERBOSE\n            OSL_TRACE (\"processing request for page %d with priority class %d\",\n                (pPage->GetPageNum()-1)\/2,\n                ePriorityClass);\n#endif\n            try\n            {\n\n                ::osl::MutexGuard aGuard (maMutex);\n                \/\/ Create a new preview bitmap and store it in the cache.\n                if (mpCache.get() != NULL)\n                {\n                    const SdPage* pSdPage = dynamic_cast<const SdPage*>(pPage);\n                    if (pSdPage != NULL)\n                    {\n                        mpCache->SetBitmap (\n                            pPage,\n                            maBitmapFactory.CreateBitmap(*pSdPage, aPreviewPixelSize),\n                            ePriorityClass!=NOT_VISIBLE);\n\n                        \/\/ Initiate a repaint of the new preview.\n                        if (ePriorityClass != NOT_VISIBLE)\n                            mrView.InvalidateAllWin(aDirtyRectangle);\n\n                        SSCD_SET_STATUS(pPage,NONE);\n                    }\n                }\n            }\n            catch (::com::sun::star::uno::RuntimeException aException)\n            {\n                OSL_ASSERT(\"RuntimeException caught in QueueProcessor\");\n                (void) aException;\n            }\n            catch (::com::sun::star::uno::Exception aException)\n            {\n                OSL_ASSERT(\"Exception caught in QueueProcessor\");\n                (void) aException;\n            }\n\n            \/\/ Requests of lower priority are processed one at a time.\n            {\n                ::osl::MutexGuard aGuard (mrQueue.GetMutex());\n                if ( ! mrQueue.IsEmpty())\n                    if (mrQueue.GetFrontPriorityClass() > 0)\n                        break;\n            }\n        }\n    }\n\n    if ( ! mrQueue.IsEmpty())\n        if (bIsShowingFullScreenShow)\n            Start(mnTimeBetweenRequestsWhenNotIdle);\n        else\n            Start(mrQueue.GetFrontPriorityClass());\n}\n\n\n\n\ntemplate <class Queue, class RequestData, class BitmapFactory>\n    void QueueProcessor<Queue, RequestData, BitmapFactory>::Terminate (void)\n{\n}\n\n\n\n\ntemplate <class Queue, class RequestData, class BitmapFactory>\n    void QueueProcessor<Queue, RequestData, BitmapFactory>::RemoveRequest (RequestData& )\n{\n    \/\/ See the method declaration above for an explanation why this makes sense.\n    ::osl::MutexGuard aGuard (maMutex);\n}\n\n\n\n\ntemplate <class Queue, class RequestData, class BitmapFactory>\n    void QueueProcessor<Queue, RequestData, BitmapFactory>::SetBitmapCache (\n        const ::boost::shared_ptr<BitmapCache>& rpCache)\n{\n    mpCache = rpCache;\n}\n\n\n} } } \/\/ end of namespace ::sd::slidesorter::cache\n\n#endif\n<commit_msg>INTEGRATION: CWS presenterview (1.15.54); FILE MERGED 2008\/02\/26 12:23:35 af 1.15.54.4: #i18486# Dropped the use of templates for implementing cache classes. 2008\/02\/26 09:03:06 af 1.15.54.3: RESYNC: (1.16-1.17); FILE MERGED 2007\/07\/11 09:08:04 af 1.15.54.2: RESYNC: (1.15-1.16); FILE MERGED 2007\/04\/26 15:41:21 af 1.15.54.1: #i75317# Separation of SlideSorter from ViewShell.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: SlsQueueProcessor.hxx,v $\n *\n *  $Revision: 1.18 $\n *\n *  last change: $Author: kz $ $Date: 2008-04-03 14:20:39 $\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_QUEUE_PROCESSOR_HXX\n#define SD_SLIDESORTER_QUEUE_PROCESSOR_HXX\n\n#include \"cache\/SlsPageCache.hxx\"\n#include \"SlsRequestPriorityClass.hxx\"\n#include \"SlsBitmapFactory.hxx\"\n#include \"view\/SlsPageObject.hxx\"\n#include \"view\/SlideSorterView.hxx\"\n#include \"view\/SlsPageObjectViewObjectContact.hxx\"\n#include \"tools\/IdleDetection.hxx\"\n#include \"SlsBitmapCache.hxx\"\n#include \"taskpane\/SlideSorterCacheDisplay.hxx\"\n#include \"sdpage.hxx\"\n#include \"Window.hxx\"\n\n#include <svx\/svdpagv.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/timer.hxx>\n#include <boost\/function.hpp>\n\n\n\/\/ Uncomment the define below to have some more OSL_TRACE messages.\n#ifdef DEBUG\n\/\/#define VERBOSE\n#endif\n\nnamespace sd { namespace slidesorter { namespace view {\nclass SlideSorterView;\n} } }\n\n\n\nnamespace sd { namespace slidesorter { namespace cache {\n\nclass BitmapCache;\nclass RequestQueue;\n\n\n\n\/** This queue processor is timer based, i.e. when an entry is added to the\n    queue and the processor is started with Start() in the base class a\n    timer is started that eventually calls ProcessRequest().  This is\n    repeated until the queue is empty or Stop() is called.\n*\/\nclass QueueProcessor\n{\npublic:\n    typedef ::boost::function<bool()> IdleDetectionCallback;\n    QueueProcessor (\n        RequestQueue& rQueue,\n        const ::boost::shared_ptr<BitmapCache>& rpCache,\n        const Size& rPreviewSize,\n        const SharedCacheContext& rpCacheContext);\n    virtual ~QueueProcessor();\n\n    \/** Start the processor.  This implementation is timer based and waits\n        an defined amount of time that depends on the given argument before\n        the next entry in the queue is processed.\n        @param nPriorityClass\n            A priority class of 0 tells the processor that a high priority\n            request is waiting in the queue.  The time to wait is thus\n            shorter then that for a low priority request (denoted by a value\n            of 1.)  When the timer is already running it is not modified.\n    *\/\n    void Start (int nPriorityClass = 0);\n    void Stop (void);\n    void Pause (void);\n    void Resume (void);\n\n    void Terminate (void);\n\n    void SetPreviewSize (const Size& rSize);\n\n    \/** As we can not really terminate the rendering of a preview bitmap for\n        a request in midair this method acts more like a semaphor.  It\n        returns only when it is save for the caller to delete the request.\n        For this to work it is important to remove the request from the\n        queue before calling this method.\n    *\/\n    void RemoveRequest (CacheKey aKey);\n\n    \/** Use this method when the page cache is (maybe) using a different\n        BitmapCache.  This is usually necessary after calling\n        PageCacheManager::ChangeSize().\n    *\/\n    void SetBitmapCache (const ::boost::shared_ptr<BitmapCache>& rpCache);\n\nprivate:\n    \/** This mutex is used to guard the queue processor.  Be carefull not to\n        mix its use with that of the solar mutex.\n    *\/\n    ::osl::Mutex maMutex;\n\n    Timer maTimer;\n    DECL_LINK(ProcessRequestHdl, Timer*);\n    sal_uInt32 mnTimeBetweenHighPriorityRequests;\n    sal_uInt32 mnTimeBetweenLowPriorityRequests;\n    sal_uInt32 mnTimeBetweenRequestsWhenNotIdle;\n    Size maPreviewSize;\n    SharedCacheContext mpCacheContext;\n    RequestQueue& mrQueue;\n    ::boost::shared_ptr<BitmapCache> mpCache;\n    BitmapFactory maBitmapFactory;\n    bool mbIsPaused;\n\n    void ProcessRequests (void);\n    void ProcessOneRequest (\n        CacheKey aKey,\n        const RequestPriorityClass ePriorityClass);\n};\n\n\n\n\n} } } \/\/ end of namespace ::sd::slidesorter::cache\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: SlsPageDescriptor.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_sd.hxx\"\n\n#include \"model\/SlsPageDescriptor.hxx\"\n#include \"view\/SlsPageObject.hxx\"\n#include \"view\/SlsPageObjectViewObjectContact.hxx\"\n#include \"controller\/SlsPageObjectFactory.hxx\"\n\n#include \"sdpage.hxx\"\n#include \"drawdoc.hxx\"\n\n#include <svx\/svdopage.hxx>\n#include <svx\/svdpagv.hxx>\n#include <svx\/sdr\/contact\/viewcontact.hxx>\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star;\n\nnamespace sd {  namespace slidesorter { namespace model {\n\nPageDescriptor::PageDescriptor (\n    const Reference<drawing::XDrawPage>& rxPage,\n    SdPage* pPage,\n    const sal_Int32 nIndex,\n    const controller::PageObjectFactory& rPageObjectFactory)\n    : mpPage(pPage),\n      mxPage(rxPage),\n      mnIndex(nIndex),\n      mpPageObjectFactory(&rPageObjectFactory),\n      mpPageObject(NULL),\n      mbIsSelected(false),\n      mbIsVisible(false),\n      mbIsFocused(false),\n      mbIsCurrent(false),\n      mpViewObjectContact(NULL),\n      maModelBorder(0,0,0,0),\n      maPageNumberAreaModelSize(0,0)\n{\n    OSL_ASSERT(mpPage == SdPage::getImplementation(rxPage));\n}\n\n\n\n\nPageDescriptor::~PageDescriptor (void)\n{\n}\n\n\n\n\nSdPage* PageDescriptor::GetPage (void) const\n{\n    return mpPage;\n}\n\n\n\n\nReference<drawing::XDrawPage> PageDescriptor::GetXDrawPage (void) const\n{\n    return mxPage;\n}\n\n\n\n\nsal_Int32 PageDescriptor::GetPageIndex (void) const\n{\n    return mnIndex;\n}\n\n\n\n\nview::PageObject* PageDescriptor::GetPageObject (void)\n{\n    if (mpPageObject==NULL && mpPageObjectFactory!=NULL)\n    {\n        mpPageObject = mpPageObjectFactory->CreatePageObject(mpPage, shared_from_this());\n    }\n\n    return mpPageObject;\n}\n\n\n\n\nvoid PageDescriptor::ReleasePageObject (void)\n{\n    mpPageObject = NULL;\n}\n\n\n\n\nbool PageDescriptor::IsVisible (void) const\n{\n    return mbIsVisible;\n}\n\n\n\n\nvoid PageDescriptor::SetVisible (bool bIsVisible)\n{\n    mbIsVisible = bIsVisible;\n}\n\n\n\n\nbool PageDescriptor::Select (void)\n{\n    if ( ! IsSelected())\n    {\n        mbIsSelected = true;\n        return true;\n    }\n    else\n        return false;\n}\n\n\n\n\nbool PageDescriptor::Deselect (void)\n{\n    if (IsSelected())\n    {\n        mbIsSelected = false;\n        return true;\n    }\n    else\n        return false;\n}\n\n\n\n\nbool PageDescriptor::IsSelected (void) const\n{\n    return mbIsSelected;\n}\n\n\n\n\nbool PageDescriptor::UpdateSelection (void)\n{\n    if (mpPage!=NULL && (mpPage->IsSelected()==TRUE) != mbIsSelected)\n    {\n        mbIsSelected = ! mbIsSelected;\n        return true;\n    }\n    else\n        return false;\n}\n\n\n\n\nbool PageDescriptor::IsFocused (void) const\n{\n    return mbIsFocused;\n}\n\n\n\n\nvoid PageDescriptor::SetFocus (void)\n{\n    mbIsFocused = true;\n}\n\n\n\n\nvoid PageDescriptor::RemoveFocus (void)\n{\n    mbIsFocused = false;\n}\n\n\n\n\nview::PageObjectViewObjectContact*\n    PageDescriptor::GetViewObjectContact (void) const\n{\n    return mpViewObjectContact;\n}\n\n\n\n\nvoid PageDescriptor::SetViewObjectContact (\n    view::PageObjectViewObjectContact* pViewObjectContact)\n{\n    mpViewObjectContact = pViewObjectContact;\n}\n\n\n\n\nconst controller::PageObjectFactory&\n    PageDescriptor::GetPageObjectFactory (void) const\n{\n    return *mpPageObjectFactory;\n}\n\n\n\n\nvoid PageDescriptor::SetPageObjectFactory (\n    const controller::PageObjectFactory& rFactory)\n{\n    mpPageObjectFactory = &rFactory;\n}\n\n\n\n\nvoid PageDescriptor::SetModelBorder (const SvBorder& rBorder)\n{\n    maModelBorder = rBorder;\n}\n\n\n\n\nSvBorder PageDescriptor::GetModelBorder (void) const\n{\n    return maModelBorder;\n}\n\n\n\n\nvoid PageDescriptor::SetPageNumberAreaModelSize (const Size& rSize)\n{\n    maPageNumberAreaModelSize = rSize;\n}\n\n\n\n\nSize PageDescriptor::GetPageNumberAreaModelSize (void) const\n{\n    return maPageNumberAreaModelSize;\n}\n\n\n\n\nbool PageDescriptor::IsCurrentPage (void) const\n{\n    return mbIsCurrent;\n}\n\n\n\n\nvoid PageDescriptor::SetIsCurrentPage (const bool bIsCurrent)\n{\n    mbIsCurrent = bIsCurrent;\n}\n\n\n\n} } } \/\/ end of namespace ::sd::slidesorter::model\n<commit_msg>INTEGRATION: CWS impress141 (1.7.6); FILE MERGED 2008\/04\/29 15:03:21 cl 1.7.6.1: #i88007# check for null pointer<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: SlsPageDescriptor.cxx,v $\n * $Revision: 1.8 $\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_sd.hxx\"\n\n#include \"model\/SlsPageDescriptor.hxx\"\n#include \"view\/SlsPageObject.hxx\"\n#include \"view\/SlsPageObjectViewObjectContact.hxx\"\n#include \"controller\/SlsPageObjectFactory.hxx\"\n\n#include \"sdpage.hxx\"\n#include \"drawdoc.hxx\"\n\n#include <svx\/svdopage.hxx>\n#include <svx\/svdpagv.hxx>\n#include <svx\/sdr\/contact\/viewcontact.hxx>\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star;\n\nnamespace sd {  namespace slidesorter { namespace model {\n\nPageDescriptor::PageDescriptor (\n    const Reference<drawing::XDrawPage>& rxPage,\n    SdPage* pPage,\n    const sal_Int32 nIndex,\n    const controller::PageObjectFactory& rPageObjectFactory)\n    : mpPage(pPage),\n      mxPage(rxPage),\n      mnIndex(nIndex),\n      mpPageObjectFactory(&rPageObjectFactory),\n      mpPageObject(NULL),\n      mbIsSelected(false),\n      mbIsVisible(false),\n      mbIsFocused(false),\n      mbIsCurrent(false),\n      mpViewObjectContact(NULL),\n      maModelBorder(0,0,0,0),\n      maPageNumberAreaModelSize(0,0)\n{\n    OSL_ASSERT(mpPage == SdPage::getImplementation(rxPage));\n}\n\n\n\n\nPageDescriptor::~PageDescriptor (void)\n{\n}\n\n\n\n\nSdPage* PageDescriptor::GetPage (void) const\n{\n    return mpPage;\n}\n\n\n\n\nReference<drawing::XDrawPage> PageDescriptor::GetXDrawPage (void) const\n{\n    return mxPage;\n}\n\n\n\n\nsal_Int32 PageDescriptor::GetPageIndex (void) const\n{\n    return mnIndex;\n}\n\n\n\n\nview::PageObject* PageDescriptor::GetPageObject (void)\n{\n    if (mpPageObject==NULL && mpPageObjectFactory!=NULL && mpPage != NULL)\n    {\n        mpPageObject = mpPageObjectFactory->CreatePageObject(mpPage, shared_from_this());\n    }\n\n    return mpPageObject;\n}\n\n\n\n\nvoid PageDescriptor::ReleasePageObject (void)\n{\n    mpPageObject = NULL;\n}\n\n\n\n\nbool PageDescriptor::IsVisible (void) const\n{\n    return mbIsVisible;\n}\n\n\n\n\nvoid PageDescriptor::SetVisible (bool bIsVisible)\n{\n    mbIsVisible = bIsVisible;\n}\n\n\n\n\nbool PageDescriptor::Select (void)\n{\n    if ( ! IsSelected())\n    {\n        mbIsSelected = true;\n        return true;\n    }\n    else\n        return false;\n}\n\n\n\n\nbool PageDescriptor::Deselect (void)\n{\n    if (IsSelected())\n    {\n        mbIsSelected = false;\n        return true;\n    }\n    else\n        return false;\n}\n\n\n\n\nbool PageDescriptor::IsSelected (void) const\n{\n    return mbIsSelected;\n}\n\n\n\n\nbool PageDescriptor::UpdateSelection (void)\n{\n    if (mpPage!=NULL && (mpPage->IsSelected()==TRUE) != mbIsSelected)\n    {\n        mbIsSelected = ! mbIsSelected;\n        return true;\n    }\n    else\n        return false;\n}\n\n\n\n\nbool PageDescriptor::IsFocused (void) const\n{\n    return mbIsFocused;\n}\n\n\n\n\nvoid PageDescriptor::SetFocus (void)\n{\n    mbIsFocused = true;\n}\n\n\n\n\nvoid PageDescriptor::RemoveFocus (void)\n{\n    mbIsFocused = false;\n}\n\n\n\n\nview::PageObjectViewObjectContact*\n    PageDescriptor::GetViewObjectContact (void) const\n{\n    return mpViewObjectContact;\n}\n\n\n\n\nvoid PageDescriptor::SetViewObjectContact (\n    view::PageObjectViewObjectContact* pViewObjectContact)\n{\n    mpViewObjectContact = pViewObjectContact;\n}\n\n\n\n\nconst controller::PageObjectFactory&\n    PageDescriptor::GetPageObjectFactory (void) const\n{\n    return *mpPageObjectFactory;\n}\n\n\n\n\nvoid PageDescriptor::SetPageObjectFactory (\n    const controller::PageObjectFactory& rFactory)\n{\n    mpPageObjectFactory = &rFactory;\n}\n\n\n\n\nvoid PageDescriptor::SetModelBorder (const SvBorder& rBorder)\n{\n    maModelBorder = rBorder;\n}\n\n\n\n\nSvBorder PageDescriptor::GetModelBorder (void) const\n{\n    return maModelBorder;\n}\n\n\n\n\nvoid PageDescriptor::SetPageNumberAreaModelSize (const Size& rSize)\n{\n    maPageNumberAreaModelSize = rSize;\n}\n\n\n\n\nSize PageDescriptor::GetPageNumberAreaModelSize (void) const\n{\n    return maPageNumberAreaModelSize;\n}\n\n\n\n\nbool PageDescriptor::IsCurrentPage (void) const\n{\n    return mbIsCurrent;\n}\n\n\n\n\nvoid PageDescriptor::SetIsCurrentPage (const bool bIsCurrent)\n{\n    mbIsCurrent = bIsCurrent;\n}\n\n\n\n} } } \/\/ end of namespace ::sd::slidesorter::model\n<|endoftext|>"}
{"text":"<commit_before>#include \"search\/search_quality\/assessment_tool\/main_model.hpp\"\n\n#include \"search\/feature_loader.hpp\"\n#include \"search\/search_quality\/assessment_tool\/view.hpp\"\n#include \"search\/search_quality\/matcher.hpp\"\n\n#include \"map\/framework.hpp\"\n\n#include \"search\/search_params.hpp\"\n\n#include \"geometry\/algorithm.hpp\"\n#include \"geometry\/mercator.hpp\"\n\n#include \"coding\/multilang_utf8_string.hpp\"\n\n#include \"platform\/platform.hpp\"\n\n#include \"base\/assert.hpp\"\n#include \"base\/logging.hpp\"\n\n#include <algorithm>\n#include <fstream>\n#include <functional>\n#include <iterator>\n\nusing Relevance = search::Sample::Result::Relevance;\nusing namespace std;\n\n\/\/ MainModel::SampleContext ------------------------------------------------------------------------\n\n\/\/ MainModel ---------------------------------------------------------------------------------------\nMainModel::MainModel(Framework & framework)\n  : m_framework(framework)\n  , m_index(m_framework.GetIndex())\n  , m_loader(m_index)\n  , m_contexts(\n        [this](size_t sampleIndex, Edits::Update const & update) {\n          OnUpdate(View::ResultType::Found, sampleIndex, update);\n        },\n        [this](size_t sampleIndex, Edits::Update const & update) {\n          OnUpdate(View::ResultType::NonFound, sampleIndex, update);\n        })\n{\n}\n\nvoid MainModel::Open(string const & path)\n{\n  CHECK(m_view, ());\n\n  string contents;\n\n  {\n    ifstream ifs(path);\n    if (!ifs)\n    {\n      m_view->ShowError(\"Can't open file: \" + path);\n      return;\n    }\n    contents.assign(istreambuf_iterator<char>(ifs), istreambuf_iterator<char>());\n  }\n\n  vector<search::Sample> samples;\n  if (!search::Sample::DeserializeFromJSONLines(contents, samples))\n  {\n    m_view->ShowError(\"Can't parse samples: \" + path);\n    return;\n  }\n\n  ResetSearch();\n\n  m_view->Clear();\n\n  m_contexts.Resize(samples.size());\n  for (size_t i = 0; i < samples.size(); ++i)\n  {\n    auto & context = m_contexts[i];\n    context.Clear();\n    context.m_sample = samples[i];\n  }\n  m_path = path;\n\n  m_view->SetSamples(ContextList::SamplesSlice(m_contexts));\n  m_selectedSample = kInvalidIndex;\n}\n\nvoid MainModel::Save()\n{\n  CHECK(HasChanges(), ());\n  SaveAs(m_path);\n}\n\nvoid MainModel::SaveAs(string const & path)\n{\n  CHECK(HasChanges(), ());\n  CHECK(!path.empty(), ());\n\n  string contents;\n  search::Sample::SerializeToJSONLines(m_contexts.MakeSamples(m_loader), contents);\n\n  {\n    ofstream ofs(path);\n    if (!ofs)\n    {\n      m_view->ShowError(\"Can't open file: \" + path);\n      return;\n    }\n    copy(contents.begin(), contents.end(), ostreambuf_iterator<char>(ofs));\n  }\n\n  m_contexts.ApplyEdits();\n  m_path = path;\n}\n\nvoid MainModel::OnSampleSelected(int index)\n{\n  CHECK(m_threadChecker.CalledOnOriginalThread(), ());\n\n  CHECK_GREATER_OR_EQUAL(index, 0, ());\n  CHECK_LESS(index, m_contexts.Size(), ());\n  CHECK(m_view, ());\n\n  m_selectedSample = index;\n\n  auto & context = m_contexts[index];\n  auto const & sample = context.m_sample;\n  m_view->ShowSample(index, sample, sample.m_posAvailable, sample.m_pos, context.HasChanges());\n\n  ResetSearch();\n  auto const timestamp = m_queryTimestamp;\n  m_numShownResults = 0;\n\n  if (context.m_initialized)\n  {\n    OnResults(timestamp, index, context.m_foundResults, context.m_foundResultsEdits.GetRelevances(),\n              context.m_goldenMatching, context.m_actualMatching);\n    return;\n  }\n\n  auto & engine = m_framework.GetSearchEngine();\n  {\n    search::SearchParams params;\n    sample.FillSearchParams(params);\n    params.m_onResults = [this, index, sample, timestamp](search::Results const & results) {\n      vector<Relevance> relevances;\n      vector<size_t> goldenMatching;\n      vector<size_t> actualMatching;\n\n      if (results.IsEndedNormal())\n      {\n        \/\/ Can't use m_loader here due to thread-safety issues.\n        search::FeatureLoader loader(m_index);\n        search::Matcher matcher(loader);\n\n        vector<search::Result> const actual(results.begin(), results.end());\n        matcher.Match(sample.m_results, actual, goldenMatching, actualMatching);\n        relevances.assign(actual.size(), Relevance::Irrelevant);\n        for (size_t i = 0; i < goldenMatching.size(); ++i)\n        {\n          auto const j = goldenMatching[i];\n          if (j != search::Matcher::kInvalidId)\n          {\n            CHECK_LESS(j, relevances.size(), ());\n            relevances[j] = sample.m_results[i].m_relevance;\n          }\n        }\n      }\n\n      GetPlatform().RunOnGuiThread(bind(&MainModel::OnResults, this, timestamp, index, results,\n                                        relevances, goldenMatching, actualMatching));\n    };\n\n    m_queryHandle = engine.Search(params, sample.m_viewport);\n    m_view->OnSearchStarted();\n  }\n}\n\nvoid MainModel::OnResultSelected(int index)\n{\n  CHECK_GREATER_OR_EQUAL(m_selectedSample, 0, ());\n  CHECK_LESS(m_selectedSample, m_contexts.Size(), ());\n  auto const & context = m_contexts[m_selectedSample];\n  auto const & foundResults = context.m_foundResults;\n\n  CHECK_GREATER_OR_EQUAL(index, 0, ());\n  CHECK_LESS(index, foundResults.GetCount(), ());\n  m_view->MoveViewportToResult(foundResults[index]);\n}\n\nvoid MainModel::OnNonFoundResultSelected(int index)\n{\n  CHECK_GREATER_OR_EQUAL(m_selectedSample, 0, ());\n  CHECK_LESS(m_selectedSample, m_contexts.Size(), ());\n  auto const & context = m_contexts[m_selectedSample];\n  auto const & results = context.m_nonFoundResults;\n\n  CHECK_GREATER_OR_EQUAL(index, 0, ());\n  CHECK_LESS(index, results.size(), ());\n  m_view->MoveViewportToResult(results[index]);\n}\n\nvoid MainModel::OnShowViewportClicked()\n{\n  CHECK(m_selectedSample != kInvalidIndex, ());\n  CHECK(m_selectedSample < m_contexts.Size(), ());\n\n  auto const & context = m_contexts[m_selectedSample];\n  m_view->MoveViewportToRect(context.m_sample.m_viewport);\n}\n\nvoid MainModel::OnShowPositionClicked()\n{\n  CHECK(m_selectedSample != kInvalidIndex, ());\n  CHECK(m_selectedSample < m_contexts.Size(), ());\n\n  static int constexpr kViewportAroundPositionSizeM = 100;\n  static double constexpr kScale = 1.2;\n  static size_t constexpr kMaxTopResults = 3;\n\n  auto const & context = m_contexts[m_selectedSample];\n\n  vector<m2::PointD> points;\n  if (context.m_sample.m_posAvailable)\n    points.push_back(context.m_sample.m_pos);\n\n  size_t resultsAdded = 0;\n  for (auto const & result : context.m_foundResults)\n  {\n    if (!result.HasPoint())\n      continue;\n\n    if (resultsAdded == kMaxTopResults)\n      break;\n\n    points.push_back(result.GetFeatureCenter());\n    ++resultsAdded;\n  }\n\n  CHECK(!points.empty(), ());\n  auto boundingBox = m2::ApplyCalculator(points, m2::CalculateBoundingBox());\n  boundingBox.Scale(kScale);\n\n  auto const minRect = MercatorBounds::RectByCenterXYAndSizeInMeters(boundingBox.Center(),\n                                                                     kViewportAroundPositionSizeM);\n  m_view->MoveViewportToRect(m2::Add(boundingBox, minRect));\n}\n\nbool MainModel::HasChanges() { return m_contexts.HasChanges(); }\n\nbool MainModel::AlreadyInSamples(FeatureID const & id)\n{\n  CHECK(m_selectedSample != kInvalidIndex, ());\n  CHECK(m_selectedSample < m_contexts.Size(), ());\n\n  bool found = false;\n  ForAnyMatchingEntry(m_contexts[m_selectedSample], id, [&](Edits & edits, size_t index) {\n    auto const & entry = edits.GetEntry(index);\n    if (!entry.m_deleted)\n      found = true;\n  });\n  return found;\n}\n\nvoid MainModel::AddNonFoundResult(FeatureID const & id)\n{\n  CHECK(m_selectedSample != kInvalidIndex, ());\n  CHECK(m_selectedSample < m_contexts.Size(), ());\n\n  auto & context = m_contexts[m_selectedSample];\n\n  bool resurrected = false;\n  ForAnyMatchingEntry(context, id, [&](Edits & edits, size_t index) {\n    auto const & entry = edits.GetEntry(index);\n    CHECK(entry.m_deleted, ());\n    edits.Resurrect(index);\n    resurrected = true;\n  });\n  if (resurrected)\n    return;\n\n  FeatureType ft;\n  CHECK(m_loader.Load(id, ft), (\"Can't load feature:\", id));\n  auto const result = search::Sample::Result::Build(ft, search::Sample::Result::Relevance::Vital);\n  context.AddNonFoundResult(result);\n}\n\nvoid MainModel::OnUpdate(View::ResultType type, size_t sampleIndex, Edits::Update const & update)\n{\n  using Type = Edits::Update::Type;\n\n  CHECK_LESS(sampleIndex, m_contexts.Size(), ());\n  auto & context = m_contexts[sampleIndex];\n\n  if (update.m_type == Type::Add)\n  {\n    CHECK_EQUAL(type, View::ResultType::NonFound, ());\n    m_view->ShowNonFoundResults(context.m_nonFoundResults,\n                                context.m_nonFoundResultsEdits.GetEntries());\n    m_view->SetEdits(m_selectedSample, context.m_foundResultsEdits, context.m_nonFoundResultsEdits);\n  }\n\n  m_view->OnResultChanged(sampleIndex, type, update);\n  m_view->OnSampleChanged(sampleIndex, context.HasChanges());\n  m_view->OnSamplesChanged(m_contexts.HasChanges());\n\n  if (update.m_type == Type::Add || update.m_type == Type::Resurrect ||\n      update.m_type == Type::Delete)\n  {\n    CHECK(context.m_initialized, ());\n    CHECK_EQUAL(type, View::ResultType::NonFound, ());\n    ShowMarks(context);\n  }\n}\n\nvoid MainModel::OnResults(uint64_t timestamp, size_t sampleIndex, search::Results const & results,\n                          vector<Relevance> const & relevances,\n                          vector<size_t> const & goldenMatching,\n                          vector<size_t> const & actualMatching)\n{\n  CHECK(m_threadChecker.CalledOnOriginalThread(), ());\n\n  if (timestamp != m_queryTimestamp)\n    return;\n\n  CHECK_LESS_OR_EQUAL(m_numShownResults, results.GetCount(), ());\n  m_view->AddFoundResults(results.begin() + m_numShownResults, results.end());\n  m_numShownResults = results.GetCount();\n\n  auto & context = m_contexts[sampleIndex];\n  context.m_foundResults = results;\n\n  if (!results.IsEndedNormal())\n    return;\n\n  if (!context.m_initialized)\n  {\n    context.m_foundResultsEdits.Reset(relevances);\n    context.m_goldenMatching = goldenMatching;\n    context.m_actualMatching = actualMatching;\n\n    {\n      vector<Relevance> relevances;\n\n      auto & nonFound = context.m_nonFoundResults;\n      CHECK(nonFound.empty(), ());\n      for (size_t i = 0; i < context.m_goldenMatching.size(); ++i)\n      {\n        auto const j = context.m_goldenMatching[i];\n        if (j != search::Matcher::kInvalidId)\n          continue;\n        nonFound.push_back(context.m_sample.m_results[i]);\n        relevances.push_back(nonFound.back().m_relevance);\n      }\n      context.m_nonFoundResultsEdits.Reset(relevances);\n    }\n\n    context.m_initialized = true;\n  }\n\n  m_view->ShowNonFoundResults(context.m_nonFoundResults,\n                              context.m_nonFoundResultsEdits.GetEntries());\n  ShowMarks(context);\n  m_view->OnResultChanged(sampleIndex, View::ResultType::Found,\n                          Edits::Update::MakeAll());\n  m_view->OnResultChanged(sampleIndex, View::ResultType::NonFound,\n                          Edits::Update::MakeAll());\n  m_view->OnSampleChanged(sampleIndex, context.HasChanges());\n  m_view->SetEdits(sampleIndex, context.m_foundResultsEdits, context.m_nonFoundResultsEdits);\n  m_view->OnSearchCompleted();\n}\n\nvoid MainModel::ResetSearch()\n{\n  ++m_queryTimestamp;\n  if (auto handle = m_queryHandle.lock())\n    handle->Cancel();\n}\n\nvoid MainModel::ShowMarks(Context const & context)\n{\n  m_view->ClearSearchResultMarks();\n  m_view->ShowFoundResultsMarks(context.m_foundResults.begin(), context.m_foundResults.end());\n  m_view->ShowNonFoundResultsMarks(context.m_nonFoundResults,\n                                   context.m_nonFoundResultsEdits.GetEntries());\n}\n\ntemplate <typename Fn>\nvoid MainModel::ForAnyMatchingEntry(Context & context, FeatureID const & id, Fn && fn)\n{\n  CHECK(context.m_initialized, ());\n\n  auto const & foundResults = context.m_foundResults;\n  CHECK_EQUAL(foundResults.GetCount(), context.m_foundResultsEdits.NumEntries(), ());\n  for (size_t i = 0; i < foundResults.GetCount(); ++i)\n  {\n    auto const & result = foundResults[i];\n    if (result.GetResultType() != search::Result::RESULT_FEATURE)\n      continue;\n    if (result.GetFeatureID() == id)\n      return fn(context.m_foundResultsEdits, i);\n  }\n\n  FeatureType ft;\n  CHECK(m_loader.Load(id, ft), (\"Can't load feature:\", id));\n  search::Matcher matcher(m_loader);\n\n  auto const & nonFoundResults = context.m_nonFoundResults;\n  CHECK_EQUAL(nonFoundResults.size(), context.m_nonFoundResultsEdits.NumEntries(), ());\n  for (size_t i = 0; i < nonFoundResults.size(); ++i)\n  {\n    auto const & result = context.m_nonFoundResults[i];\n    if (matcher.Matches(result, ft))\n      return fn(context.m_nonFoundResultsEdits, i);\n  }\n}\n<commit_msg>Reviews fixes.<commit_after>#include \"search\/search_quality\/assessment_tool\/main_model.hpp\"\n\n#include \"search\/feature_loader.hpp\"\n#include \"search\/search_quality\/assessment_tool\/view.hpp\"\n#include \"search\/search_quality\/matcher.hpp\"\n\n#include \"map\/framework.hpp\"\n\n#include \"search\/search_params.hpp\"\n\n#include \"geometry\/algorithm.hpp\"\n#include \"geometry\/mercator.hpp\"\n\n#include \"coding\/multilang_utf8_string.hpp\"\n\n#include \"platform\/platform.hpp\"\n\n#include \"base\/assert.hpp\"\n#include \"base\/logging.hpp\"\n\n#include <algorithm>\n#include <fstream>\n#include <functional>\n#include <iterator>\n\nusing Relevance = search::Sample::Result::Relevance;\nusing namespace std;\n\n\/\/ MainModel::SampleContext ------------------------------------------------------------------------\n\n\/\/ MainModel ---------------------------------------------------------------------------------------\nMainModel::MainModel(Framework & framework)\n  : m_framework(framework)\n  , m_index(m_framework.GetIndex())\n  , m_loader(m_index)\n  , m_contexts(\n        [this](size_t sampleIndex, Edits::Update const & update) {\n          OnUpdate(View::ResultType::Found, sampleIndex, update);\n        },\n        [this](size_t sampleIndex, Edits::Update const & update) {\n          OnUpdate(View::ResultType::NonFound, sampleIndex, update);\n        })\n{\n}\n\nvoid MainModel::Open(string const & path)\n{\n  CHECK(m_view, ());\n\n  string contents;\n\n  {\n    ifstream ifs(path);\n    if (!ifs)\n    {\n      m_view->ShowError(\"Can't open file: \" + path);\n      return;\n    }\n    contents.assign(istreambuf_iterator<char>(ifs), istreambuf_iterator<char>());\n  }\n\n  vector<search::Sample> samples;\n  if (!search::Sample::DeserializeFromJSONLines(contents, samples))\n  {\n    m_view->ShowError(\"Can't parse samples: \" + path);\n    return;\n  }\n\n  ResetSearch();\n\n  m_view->Clear();\n\n  m_contexts.Resize(samples.size());\n  for (size_t i = 0; i < samples.size(); ++i)\n  {\n    auto & context = m_contexts[i];\n    context.Clear();\n    context.m_sample = samples[i];\n  }\n  m_path = path;\n\n  m_view->SetSamples(ContextList::SamplesSlice(m_contexts));\n  m_selectedSample = kInvalidIndex;\n}\n\nvoid MainModel::Save()\n{\n  CHECK(HasChanges(), ());\n  SaveAs(m_path);\n}\n\nvoid MainModel::SaveAs(string const & path)\n{\n  CHECK(HasChanges(), ());\n  CHECK(!path.empty(), ());\n\n  string contents;\n  search::Sample::SerializeToJSONLines(m_contexts.MakeSamples(m_loader), contents);\n\n  {\n    ofstream ofs(path);\n    if (!ofs)\n    {\n      m_view->ShowError(\"Can't open file: \" + path);\n      return;\n    }\n    copy(contents.begin(), contents.end(), ostreambuf_iterator<char>(ofs));\n  }\n\n  m_contexts.ApplyEdits();\n  m_path = path;\n}\n\nvoid MainModel::OnSampleSelected(int index)\n{\n  CHECK(m_threadChecker.CalledOnOriginalThread(), ());\n\n  CHECK_GREATER_OR_EQUAL(index, 0, ());\n  CHECK_LESS(index, m_contexts.Size(), ());\n  CHECK(m_view, ());\n\n  m_selectedSample = index;\n\n  auto & context = m_contexts[index];\n  auto const & sample = context.m_sample;\n  m_view->ShowSample(index, sample, sample.m_posAvailable, sample.m_pos, context.HasChanges());\n\n  ResetSearch();\n  auto const timestamp = m_queryTimestamp;\n  m_numShownResults = 0;\n\n  if (context.m_initialized)\n  {\n    OnResults(timestamp, index, context.m_foundResults, context.m_foundResultsEdits.GetRelevances(),\n              context.m_goldenMatching, context.m_actualMatching);\n    return;\n  }\n\n  auto & engine = m_framework.GetSearchEngine();\n  {\n    search::SearchParams params;\n    sample.FillSearchParams(params);\n    params.m_onResults = [this, index, sample, timestamp](search::Results const & results) {\n      vector<Relevance> relevances;\n      vector<size_t> goldenMatching;\n      vector<size_t> actualMatching;\n\n      if (results.IsEndedNormal())\n      {\n        \/\/ Can't use m_loader here due to thread-safety issues.\n        search::FeatureLoader loader(m_index);\n        search::Matcher matcher(loader);\n\n        vector<search::Result> const actual(results.begin(), results.end());\n        matcher.Match(sample.m_results, actual, goldenMatching, actualMatching);\n        relevances.assign(actual.size(), Relevance::Irrelevant);\n        for (size_t i = 0; i < goldenMatching.size(); ++i)\n        {\n          auto const j = goldenMatching[i];\n          if (j != search::Matcher::kInvalidId)\n          {\n            CHECK_LESS(j, relevances.size(), ());\n            relevances[j] = sample.m_results[i].m_relevance;\n          }\n        }\n      }\n\n      GetPlatform().RunOnGuiThread(bind(&MainModel::OnResults, this, timestamp, index, results,\n                                        relevances, goldenMatching, actualMatching));\n    };\n\n    m_queryHandle = engine.Search(params, sample.m_viewport);\n    m_view->OnSearchStarted();\n  }\n}\n\nvoid MainModel::OnResultSelected(int index)\n{\n  CHECK_GREATER_OR_EQUAL(m_selectedSample, 0, ());\n  CHECK_LESS(m_selectedSample, m_contexts.Size(), ());\n  auto const & context = m_contexts[m_selectedSample];\n  auto const & foundResults = context.m_foundResults;\n\n  CHECK_GREATER_OR_EQUAL(index, 0, ());\n  CHECK_LESS(index, foundResults.GetCount(), ());\n  m_view->MoveViewportToResult(foundResults[index]);\n}\n\nvoid MainModel::OnNonFoundResultSelected(int index)\n{\n  CHECK_GREATER_OR_EQUAL(m_selectedSample, 0, ());\n  CHECK_LESS(m_selectedSample, m_contexts.Size(), ());\n  auto const & context = m_contexts[m_selectedSample];\n  auto const & results = context.m_nonFoundResults;\n\n  CHECK_GREATER_OR_EQUAL(index, 0, ());\n  CHECK_LESS(index, results.size(), ());\n  m_view->MoveViewportToResult(results[index]);\n}\n\nvoid MainModel::OnShowViewportClicked()\n{\n  CHECK(m_selectedSample != kInvalidIndex, ());\n  CHECK(m_selectedSample < m_contexts.Size(), ());\n\n  auto const & context = m_contexts[m_selectedSample];\n  m_view->MoveViewportToRect(context.m_sample.m_viewport);\n}\n\nvoid MainModel::OnShowPositionClicked()\n{\n  CHECK(m_selectedSample != kInvalidIndex, ());\n  CHECK(m_selectedSample < m_contexts.Size(), ());\n\n  static int constexpr kViewportAroundTopResultsSizeM = 100;\n  static double constexpr kViewportAroundTopResultsScale = 1.2;\n  static size_t constexpr kMaxTopResults = 3;\n\n  auto const & context = m_contexts[m_selectedSample];\n\n  vector<m2::PointD> points;\n  if (context.m_sample.m_posAvailable)\n    points.push_back(context.m_sample.m_pos);\n\n  size_t resultsAdded = 0;\n  for (auto const & result : context.m_foundResults)\n  {\n    if (!result.HasPoint())\n      continue;\n\n    if (resultsAdded == kMaxTopResults)\n      break;\n\n    points.push_back(result.GetFeatureCenter());\n    ++resultsAdded;\n  }\n\n  CHECK(!points.empty(), ());\n  auto boundingBox = m2::ApplyCalculator(points, m2::CalculateBoundingBox());\n  boundingBox.Scale(kViewportAroundTopResultsScale);\n\n  auto const minRect = MercatorBounds::RectByCenterXYAndSizeInMeters(\n      boundingBox.Center(), kViewportAroundTopResultsSizeM);\n  m_view->MoveViewportToRect(m2::Add(boundingBox, minRect));\n}\n\nbool MainModel::HasChanges() { return m_contexts.HasChanges(); }\n\nbool MainModel::AlreadyInSamples(FeatureID const & id)\n{\n  CHECK(m_selectedSample != kInvalidIndex, ());\n  CHECK(m_selectedSample < m_contexts.Size(), ());\n\n  bool found = false;\n  ForAnyMatchingEntry(m_contexts[m_selectedSample], id, [&](Edits & edits, size_t index) {\n    auto const & entry = edits.GetEntry(index);\n    if (!entry.m_deleted)\n      found = true;\n  });\n  return found;\n}\n\nvoid MainModel::AddNonFoundResult(FeatureID const & id)\n{\n  CHECK(m_selectedSample != kInvalidIndex, ());\n  CHECK(m_selectedSample < m_contexts.Size(), ());\n\n  auto & context = m_contexts[m_selectedSample];\n\n  bool resurrected = false;\n  ForAnyMatchingEntry(context, id, [&](Edits & edits, size_t index) {\n    auto const & entry = edits.GetEntry(index);\n    CHECK(entry.m_deleted, ());\n    edits.Resurrect(index);\n    resurrected = true;\n  });\n  if (resurrected)\n    return;\n\n  FeatureType ft;\n  CHECK(m_loader.Load(id, ft), (\"Can't load feature:\", id));\n  auto const result = search::Sample::Result::Build(ft, search::Sample::Result::Relevance::Vital);\n  context.AddNonFoundResult(result);\n}\n\nvoid MainModel::OnUpdate(View::ResultType type, size_t sampleIndex, Edits::Update const & update)\n{\n  using Type = Edits::Update::Type;\n\n  CHECK_LESS(sampleIndex, m_contexts.Size(), ());\n  auto & context = m_contexts[sampleIndex];\n\n  if (update.m_type == Type::Add)\n  {\n    CHECK_EQUAL(type, View::ResultType::NonFound, ());\n    m_view->ShowNonFoundResults(context.m_nonFoundResults,\n                                context.m_nonFoundResultsEdits.GetEntries());\n    m_view->SetEdits(m_selectedSample, context.m_foundResultsEdits, context.m_nonFoundResultsEdits);\n  }\n\n  m_view->OnResultChanged(sampleIndex, type, update);\n  m_view->OnSampleChanged(sampleIndex, context.HasChanges());\n  m_view->OnSamplesChanged(m_contexts.HasChanges());\n\n  if (update.m_type == Type::Add || update.m_type == Type::Resurrect ||\n      update.m_type == Type::Delete)\n  {\n    CHECK(context.m_initialized, ());\n    CHECK_EQUAL(type, View::ResultType::NonFound, ());\n    ShowMarks(context);\n  }\n}\n\nvoid MainModel::OnResults(uint64_t timestamp, size_t sampleIndex, search::Results const & results,\n                          vector<Relevance> const & relevances,\n                          vector<size_t> const & goldenMatching,\n                          vector<size_t> const & actualMatching)\n{\n  CHECK(m_threadChecker.CalledOnOriginalThread(), ());\n\n  if (timestamp != m_queryTimestamp)\n    return;\n\n  CHECK_LESS_OR_EQUAL(m_numShownResults, results.GetCount(), ());\n  m_view->AddFoundResults(results.begin() + m_numShownResults, results.end());\n  m_numShownResults = results.GetCount();\n\n  auto & context = m_contexts[sampleIndex];\n  context.m_foundResults = results;\n\n  if (!results.IsEndedNormal())\n    return;\n\n  if (!context.m_initialized)\n  {\n    context.m_foundResultsEdits.Reset(relevances);\n    context.m_goldenMatching = goldenMatching;\n    context.m_actualMatching = actualMatching;\n\n    {\n      vector<Relevance> relevances;\n\n      auto & nonFound = context.m_nonFoundResults;\n      CHECK(nonFound.empty(), ());\n      for (size_t i = 0; i < context.m_goldenMatching.size(); ++i)\n      {\n        auto const j = context.m_goldenMatching[i];\n        if (j != search::Matcher::kInvalidId)\n          continue;\n        nonFound.push_back(context.m_sample.m_results[i]);\n        relevances.push_back(nonFound.back().m_relevance);\n      }\n      context.m_nonFoundResultsEdits.Reset(relevances);\n    }\n\n    context.m_initialized = true;\n  }\n\n  m_view->ShowNonFoundResults(context.m_nonFoundResults,\n                              context.m_nonFoundResultsEdits.GetEntries());\n  ShowMarks(context);\n  m_view->OnResultChanged(sampleIndex, View::ResultType::Found,\n                          Edits::Update::MakeAll());\n  m_view->OnResultChanged(sampleIndex, View::ResultType::NonFound,\n                          Edits::Update::MakeAll());\n  m_view->OnSampleChanged(sampleIndex, context.HasChanges());\n  m_view->SetEdits(sampleIndex, context.m_foundResultsEdits, context.m_nonFoundResultsEdits);\n  m_view->OnSearchCompleted();\n}\n\nvoid MainModel::ResetSearch()\n{\n  ++m_queryTimestamp;\n  if (auto handle = m_queryHandle.lock())\n    handle->Cancel();\n}\n\nvoid MainModel::ShowMarks(Context const & context)\n{\n  m_view->ClearSearchResultMarks();\n  m_view->ShowFoundResultsMarks(context.m_foundResults.begin(), context.m_foundResults.end());\n  m_view->ShowNonFoundResultsMarks(context.m_nonFoundResults,\n                                   context.m_nonFoundResultsEdits.GetEntries());\n}\n\ntemplate <typename Fn>\nvoid MainModel::ForAnyMatchingEntry(Context & context, FeatureID const & id, Fn && fn)\n{\n  CHECK(context.m_initialized, ());\n\n  auto const & foundResults = context.m_foundResults;\n  CHECK_EQUAL(foundResults.GetCount(), context.m_foundResultsEdits.NumEntries(), ());\n  for (size_t i = 0; i < foundResults.GetCount(); ++i)\n  {\n    auto const & result = foundResults[i];\n    if (result.GetResultType() != search::Result::RESULT_FEATURE)\n      continue;\n    if (result.GetFeatureID() == id)\n      return fn(context.m_foundResultsEdits, i);\n  }\n\n  FeatureType ft;\n  CHECK(m_loader.Load(id, ft), (\"Can't load feature:\", id));\n  search::Matcher matcher(m_loader);\n\n  auto const & nonFoundResults = context.m_nonFoundResults;\n  CHECK_EQUAL(nonFoundResults.size(), context.m_nonFoundResultsEdits.NumEntries(), ());\n  for (size_t i = 0; i < nonFoundResults.size(); ++i)\n  {\n    auto const & result = context.m_nonFoundResults[i];\n    if (matcher.Matches(result, ft))\n      return fn(context.m_nonFoundResultsEdits, i);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <string.h>\n\n#include <bot_core\/bot_core.h>\n#include <bot_vis\/bot_vis.h>\n#include <gtk\/gtk.h>\n#include <lcm\/lcm.h>\n#include <bot_lcmgl_render\/lcmgl_bot_renderer.h>\n\n\/*#include <bot_vis\/viewer.h>\n#include <bot_vis\/bot_vis.h>\n#include <bot_vis\/param_widget.h>\n#include <bot_vis\/glm.h>\n#include <bot_frames\/bot_frames.h>\n#include <bot_param\/param_client.h>\n#include <bot_param\/param_util.h>\n*\/\n\n\n#include \"UIProcessing.h\"\n#include \"LinearAlgebra.h\"\n#include \"perception\/PclSurrogateUtils.h\"\n#include <renderer_robot_plan\/renderer_robot_plan.hpp>\n\n\/\/#include <otdf_renderer\/renderer_otdf.hpp>\n#include <renderer_affordances\/renderer_affordances.hpp>\n#include <ConciseArgs>\n\nusing namespace surrogate_gui;\n\ntypedef struct {\n    BotViewer *viewer;\n    lcm_t *lcm;\n} state_t;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main(int argc, char *argv[])\n{\n  \n  string role = \"robot\";\n  ConciseArgs opt(argc, (char**)argv);\n  opt.add(role, \"r\", \"role\",\"Role - robot or base\");\n  opt.parse();\n  std::cout << \"role: \" << role << \"\\n\";\n  \n\n  string lcm_url=\"\";\n  std::string role_upper;\n  for(short i = 0; i < role.size(); ++i)\n     role_upper+= (std::toupper(role[i]));\n  if((role.compare(\"robot\") == 0) || (role.compare(\"base\") == 0) ){\n    for(short i = 0; i < role_upper.size(); ++i)\n       role_upper[i] = (std::toupper(role_upper[i]));\n    string env_variable_name = string(\"LCM_URL_DRC_\" + role_upper); \n    char* env_variable;\n    env_variable = getenv (env_variable_name.c_str());\n    if (env_variable!=NULL){\n      \/\/printf (\"The env_variable is: %s\\n\",env_variable);      \n      lcm_url = string(env_variable);\n    }else{\n      std::cout << env_variable_name << \" environment variable has not been set [\"<< lcm_url <<\"]\\n\";     \n      exit(-1);\n    }\n  }else{\n    std::cout << \"Role not understood, choose: robot or base\\n\";\n    return 1;\n  } \n\n\n  string vis_config_file=\"\";\n  if(role.compare(\"robot\") == 0){\n     vis_config_file = \".bot-plugin-robot-segmentation-viewer\";\n  }else if(role.compare(\"base\") == 0){  \n     vis_config_file = \".bot-plugin-base-segmentation-viewer\";\n  }else{\n    std::cout << \"DRC Viewer role not understood, choose: robot or base\\n\";\n    return 1;\n  }  \n  \n\t\/\/LinearAlgebra::runTests();\n\t\/\/PclSurrogateUtils::runTests();\n\t\/\/if (true) return 1;\n\n\t\/*for (int i = 0; i < Color::HIGHLIGHT; i++)\n\t{\n\t\tcout << \" i = \" << i << \" getColor(i) = \" <<\n\t\t\t\tColor::getColor(i) << \" | as int = \" <<\n\t\t\t\t((int) Color::getColor(i)) << endl;\n\t}\n\n\tvector<Color::StockColor> colors = Color::getDifferentColors(Color::BLUE, 5);\n\tcout << endl << \"===different colors w\/ initial = \" << Color::BLUE << \"====\" << endl;\n\tfor (uint i = 0; i < colors.size(); i++)\n\t{\n\t\tcout << \"\\nnext color = \" << colors[i] << endl;\n\t}\n\n\n\treturn 0;\n*\/\n    gtk_init(&argc, &argv);\n    glutInit(&argc, argv);\n    g_thread_init(NULL);\n\n    setlinebuf(stdout);\n\n    state_t app;\n    memset(&app, 0, sizeof(app));\n\n    BotViewer *viewer = bot_viewer_new(\"Segmentation\");\n    app.viewer = viewer;\n    app.lcm = lcm_create( lcm_url.c_str() );\n    boost::shared_ptr<lcm::LCM> lcmCpp = boost::shared_ptr<lcm::LCM>(new lcm::LCM(app.lcm));\n    \n    bot_glib_mainloop_attach_lcm(app.lcm);\n\n    \/\/otdf\n    \/\/ older: setup_renderer_otdf(viewer, 0, lcmCpp);\n    setup_renderer_affordances(viewer, 0, lcmCpp->getUnderlyingLCM());\n\n    \/\/ setup renderers\n    bot_viewer_add_stock_renderer(viewer, BOT_VIEWER_STOCK_RENDERER_GRID, 1);\n    \/\/KinectRendererXYZRGB *krxyzrgb = kinect_add_renderer_xyzrgb_to_viewer(viewer, 0,NULL,NULL);\n\n    \/\/ lcmgl\n    bot_lcmgl_add_renderer_to_viewer(viewer, lcmCpp->getUnderlyingLCM(), 1);\n\n\t\/\/ create segmentation handler\n    std::string channel_name = \"LOCAL_MAP_POINTS\";\n    UIProcessing uip(viewer, lcmCpp, channel_name.c_str()); \/\/\"KINECT_XYZRGB_ROS\");\n\n    std::cout << \"Listening to data from channel: \" << channel_name << \"\\n\";\n\n    \/\/ load saved preferences\n    char *fname = g_build_filename(g_get_user_config_dir(), vis_config_file.c_str() , NULL);\n    bot_viewer_load_preferences(viewer, fname);\n\n    printf(\"\\n\\n\\n========USAGE:\\n\");\n    printf(\"'a' = display axes for currently force or rotation-axis vector [track mode]\\n\");\n    printf(\"'c' = camera move\\n\");\n    printf(\"'g' = display trajector determined by force vector + rotation axis\\n\");\n    printf(\"'r' = rectangle select (valid in selection mode)\\n\");\n    printf(\"'s' = turn segment coloring on\/off (valid in selection mode)\\n\");\n    printf(\"'t' = turn tracking info on\/off\\n\");\n    printf(\"'u' = turn model fit display on\/off in segmenting mode\\n\");\n    printf(\"'<--' and '-->' switch between sub-components of an object [segment mode]\");\n    printf(\"'<--', '-->', [up|down] arrows +- [shift_l and\/or shift_r]: rotate vector [track mode]\");\n    printf(\"'tab', switch between rotation axis vector and force vector [track mode]\");\n\n    printf(\"\\n==============\\n\\n\\n\");\n\n    \/\/ run the main loop\n    gtk_main();\n\n    \/\/ save any changed preferences\n    bot_viewer_save_preferences(viewer, fname);\n    free(fname);\n\n    \/\/ cleanup\n    bot_viewer_unref(viewer);\n\n    return 0;\n}\n<commit_msg>fixed broken build due to change in renderer_affordances api<commit_after>#include <string.h>\n\n#include <bot_core\/bot_core.h>\n#include <bot_vis\/bot_vis.h>\n#include <gtk\/gtk.h>\n#include <lcm\/lcm.h>\n#include <bot_lcmgl_render\/lcmgl_bot_renderer.h>\n\n\/*#include <bot_vis\/viewer.h>\n#include <bot_vis\/bot_vis.h>\n#include <bot_vis\/param_widget.h>\n#include <bot_vis\/glm.h>\n#include <bot_frames\/bot_frames.h>\n#include <bot_param\/param_client.h>\n#include <bot_param\/param_util.h>\n*\/\n\n\n#include \"UIProcessing.h\"\n#include \"LinearAlgebra.h\"\n#include \"perception\/PclSurrogateUtils.h\"\n#include <renderer_robot_plan\/renderer_robot_plan.hpp>\n\n\/\/#include <otdf_renderer\/renderer_otdf.hpp>\n#include <renderer_affordances\/renderer_affordances.hpp>\n#include <ConciseArgs>\n\nusing namespace surrogate_gui;\n\ntypedef struct {\n    BotViewer *viewer;\n    lcm_t *lcm;\n} state_t;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main(int argc, char *argv[])\n{\n  \n  string role = \"robot\";\n  ConciseArgs opt(argc, (char**)argv);\n  opt.add(role, \"r\", \"role\",\"Role - robot or base\");\n  opt.parse();\n  std::cout << \"role: \" << role << \"\\n\";\n  \n\n  string lcm_url=\"\";\n  std::string role_upper;\n  for(short i = 0; i < role.size(); ++i)\n     role_upper+= (std::toupper(role[i]));\n  if((role.compare(\"robot\") == 0) || (role.compare(\"base\") == 0) ){\n    for(short i = 0; i < role_upper.size(); ++i)\n       role_upper[i] = (std::toupper(role_upper[i]));\n    string env_variable_name = string(\"LCM_URL_DRC_\" + role_upper); \n    char* env_variable;\n    env_variable = getenv (env_variable_name.c_str());\n    if (env_variable!=NULL){\n      \/\/printf (\"The env_variable is: %s\\n\",env_variable);      \n      lcm_url = string(env_variable);\n    }else{\n      std::cout << env_variable_name << \" environment variable has not been set [\"<< lcm_url <<\"]\\n\";     \n      exit(-1);\n    }\n  }else{\n    std::cout << \"Role not understood, choose: robot or base\\n\";\n    return 1;\n  } \n\n\n  string vis_config_file=\"\";\n  if(role.compare(\"robot\") == 0){\n     vis_config_file = \".bot-plugin-robot-segmentation-viewer\";\n  }else if(role.compare(\"base\") == 0){  \n     vis_config_file = \".bot-plugin-base-segmentation-viewer\";\n  }else{\n    std::cout << \"DRC Viewer role not understood, choose: robot or base\\n\";\n    return 1;\n  }  \n  \n\t\/\/LinearAlgebra::runTests();\n\t\/\/PclSurrogateUtils::runTests();\n\t\/\/if (true) return 1;\n\n\t\/*for (int i = 0; i < Color::HIGHLIGHT; i++)\n\t{\n\t\tcout << \" i = \" << i << \" getColor(i) = \" <<\n\t\t\t\tColor::getColor(i) << \" | as int = \" <<\n\t\t\t\t((int) Color::getColor(i)) << endl;\n\t}\n\n\tvector<Color::StockColor> colors = Color::getDifferentColors(Color::BLUE, 5);\n\tcout << endl << \"===different colors w\/ initial = \" << Color::BLUE << \"====\" << endl;\n\tfor (uint i = 0; i < colors.size(); i++)\n\t{\n\t\tcout << \"\\nnext color = \" << colors[i] << endl;\n\t}\n\n\n\treturn 0;\n*\/\n    gtk_init(&argc, &argv);\n    glutInit(&argc, argv);\n    g_thread_init(NULL);\n\n    setlinebuf(stdout);\n\n    state_t app;\n    memset(&app, 0, sizeof(app));\n\n    BotViewer *viewer = bot_viewer_new(\"Segmentation\");\n    app.viewer = viewer;\n    app.lcm = lcm_create( lcm_url.c_str() );\n    BotParam* bot_param = bot_param_new_from_server(app.lcm, 0);\n    if (bot_param == NULL) {\n      fprintf(stderr, \"Couldn't get bot param from server.\\n\");\n      return 1;\n    }\n    BotFrames* bot_frames = bot_frames_new(app.lcm, bot_param);\n    boost::shared_ptr<lcm::LCM> lcmCpp = boost::shared_ptr<lcm::LCM>(new lcm::LCM(app.lcm));\n    \n    bot_glib_mainloop_attach_lcm(app.lcm);\n\n    \/\/otdf\n    \/\/ older: setup_renderer_otdf(viewer, 0, lcmCpp);\n    setup_renderer_affordances(viewer, 0, lcmCpp->getUnderlyingLCM(), bot_frames);\n\n    \/\/ setup renderers\n    bot_viewer_add_stock_renderer(viewer, BOT_VIEWER_STOCK_RENDERER_GRID, 1);\n    \/\/KinectRendererXYZRGB *krxyzrgb = kinect_add_renderer_xyzrgb_to_viewer(viewer, 0,NULL,NULL);\n\n    \/\/ lcmgl\n    bot_lcmgl_add_renderer_to_viewer(viewer, lcmCpp->getUnderlyingLCM(), 1);\n\n\t\/\/ create segmentation handler\n    std::string channel_name = \"LOCAL_MAP_POINTS\";\n    UIProcessing uip(viewer, lcmCpp, channel_name.c_str()); \/\/\"KINECT_XYZRGB_ROS\");\n\n    std::cout << \"Listening to data from channel: \" << channel_name << \"\\n\";\n\n    \/\/ load saved preferences\n    char *fname = g_build_filename(g_get_user_config_dir(), vis_config_file.c_str() , NULL);\n    bot_viewer_load_preferences(viewer, fname);\n\n    printf(\"\\n\\n\\n========USAGE:\\n\");\n    printf(\"'a' = display axes for currently force or rotation-axis vector [track mode]\\n\");\n    printf(\"'c' = camera move\\n\");\n    printf(\"'g' = display trajector determined by force vector + rotation axis\\n\");\n    printf(\"'r' = rectangle select (valid in selection mode)\\n\");\n    printf(\"'s' = turn segment coloring on\/off (valid in selection mode)\\n\");\n    printf(\"'t' = turn tracking info on\/off\\n\");\n    printf(\"'u' = turn model fit display on\/off in segmenting mode\\n\");\n    printf(\"'<--' and '-->' switch between sub-components of an object [segment mode]\");\n    printf(\"'<--', '-->', [up|down] arrows +- [shift_l and\/or shift_r]: rotate vector [track mode]\");\n    printf(\"'tab', switch between rotation axis vector and force vector [track mode]\");\n\n    printf(\"\\n==============\\n\\n\\n\");\n\n    \/\/ run the main loop\n    gtk_main();\n\n    \/\/ save any changed preferences\n    bot_viewer_save_preferences(viewer, fname);\n    free(fname);\n\n    \/\/ cleanup\n    bot_viewer_unref(viewer);\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of Strigi Desktop Search\n *\n * Copyright (C) 2007 Jos van den Oever <jos@vandenoever.info>\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#include \"variant.h\"\n\nusing namespace std;\nusing namespace Strigi;\n\nclass Strigi::VariantPrivate {\npublic:\n    int32_t i_value;\n    uint32_t u_value;\n    string s_value;\n    vector<string> as_value;\n    vector<vector<string> > aas_value;\n    Variant::Type vartype;\n    bool valid;\n\n    VariantPrivate() :i_value(0), u_value(0), vartype(Variant::b_val), valid(false) {}\n    VariantPrivate(const Variant& v) { *this = v; }\n    void operator=(const VariantPrivate& v);\n    bool b() const;\n    int32_t i() const;\n    uint32_t u() const;\n    string s() const;\n    vector<string> as() const;\n    vector<vector<string> > aas() const;\n\n    static string itos(int32_t i);\n};\nVariant::Variant() :p(new VariantPrivate()) {}\nVariant::Variant(bool v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(int32_t v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(uint32_t v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const char* v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const string& v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const vector<string>& v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const vector<vector<string> >& v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const Variant& v) :p(new VariantPrivate(*v.p)) {\n}\nVariant::~Variant() {\n  delete p;\n}\n\nVariant::Type\nVariant::type() const { return p->vartype; }\nconst Variant&\nVariant::operator=(bool v) {\n    p->valid = true;\n    p->i_value = v;\n    p->vartype = b_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(int32_t v) {\n    p->valid=true;\n    p->i_value = v;\n    p->u_value = v;\n    p->vartype = i_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(uint32_t v) {\n    p->valid=true;\n    p->i_value = v;\n    p->u_value = v;\n    p->vartype = u_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const char* v) {\n    p->valid=true;\n    p->s_value.assign(v);\n    p->vartype = s_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const string& v) {\n    p->valid=true;\n    p->s_value.assign(v);\n    p->vartype = s_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const vector<string>& v) {\n    p->valid=true;\n    p->as_value = v;\n    p->vartype = as_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const vector<vector<string> >& v) {\n    p->valid=true;\n    p->aas_value = v;\n    p->vartype = aas_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const Variant& v) {\n    *p = *v.p;\n    return v;\n}\nvoid\nVariantPrivate::operator=(const VariantPrivate& v) {\n    i_value = v.i_value;\n    s_value = v.s_value;\n    as_value = v.as_value;\n    vartype = v.vartype;\n    valid = v.valid;\n}\nbool\nVariant::b() const {\n    return p->b();\n}\nbool\nVariantPrivate::b() const {\n    switch (vartype) {\n    case Variant::b_val:\n    case Variant::i_val:\n         return i_value;\n    case Variant::s_val:\n         return s_value == \"1\" || s_value == \"true\" || s_value == \"True\"\n             || s_value == \"TRUE\";\n    case Variant::as_val:\n         return as_value.size();\n    default:\n         return false;\n    }\n}\nint32_t\nVariant::i() const {\n    return p->i();\n}\nint32_t\nVariantPrivate::i() const {\n    switch (vartype) {\n    case Variant::b_val:\n    case Variant::i_val:\n         return i_value;\n    case Variant::s_val:\n         return atoi(s_value.c_str());\n    case Variant::as_val:\n         return as_value.size();\n    default:\n         return -1;\n    }\n}\nint32_t\nVariant::u() const {\n    return p->u();\n}\nuint32_t\nVariantPrivate::u() const {\n    switch (vartype) {\n    case Variant::b_val:\n    case Variant::i_val:\n    case Variant::u_val:\n         return u_value;\n    case Variant::s_val:\n         return atoi(s_value.c_str());\n    case Variant::as_val:\n         return as_value.size();\n    default:\n         return -1;\n    }\n}\nstring\nVariantPrivate::itos(int32_t i) {\n    ostringstream o;\n    o << i;\n    return o.str();\n}\nstring\nVariant::s() const {\n    return p->s();\n}\nstring\nVariantPrivate::s() const {\n    switch (vartype) {\n    case Variant::b_val:\n         return i_value ?\"true\" :\"false\";\n    case Variant::i_val:\n         return itos(i_value);\n    case Variant::s_val:\n         return s_value;\n    case Variant::as_val:\n         return as_value.size() ?as_value[0] :\"\";\n    default:\n         return \"\";\n    }\n}\nvector<string>\nVariant::as() const {\n    return p->as();\n}\nvector<string>\nVariantPrivate::as() const {\n    if (vartype == Variant::as_val) {\n        return as_value;\n    }\n    vector<string> v;\n    if (b()) {\n        v.push_back(s());\n    }\n    return v;\n}\nvector<vector<string> >\nVariant::aas() const {\n    return p->aas();\n}\nvector<vector<string> >\nVariantPrivate::aas() const {\n    if (vartype == Variant::aas_val) {\n        return aas_value;\n    }\n    vector<vector<string> > v;\n    if (b()) {\n        v.push_back(as());\n    }\n    return v;\n}\nbool\nVariant::isValid() const {\n    return p->valid;\n}\n<commit_msg>fix return type<commit_after>\/* This file is part of Strigi Desktop Search\n *\n * Copyright (C) 2007 Jos van den Oever <jos@vandenoever.info>\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#include \"variant.h\"\n\nusing namespace std;\nusing namespace Strigi;\n\nclass Strigi::VariantPrivate {\npublic:\n    int32_t i_value;\n    uint32_t u_value;\n    string s_value;\n    vector<string> as_value;\n    vector<vector<string> > aas_value;\n    Variant::Type vartype;\n    bool valid;\n\n    VariantPrivate() :i_value(0), u_value(0), vartype(Variant::b_val), valid(false) {}\n    VariantPrivate(const Variant& v) { *this = v; }\n    void operator=(const VariantPrivate& v);\n    bool b() const;\n    int32_t i() const;\n    uint32_t u() const;\n    string s() const;\n    vector<string> as() const;\n    vector<vector<string> > aas() const;\n\n    static string itos(int32_t i);\n};\nVariant::Variant() :p(new VariantPrivate()) {}\nVariant::Variant(bool v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(int32_t v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(uint32_t v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const char* v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const string& v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const vector<string>& v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const vector<vector<string> >& v) :p(new VariantPrivate()) {\n    *this=v;\n}\nVariant::Variant(const Variant& v) :p(new VariantPrivate(*v.p)) {\n}\nVariant::~Variant() {\n  delete p;\n}\n\nVariant::Type\nVariant::type() const { return p->vartype; }\nconst Variant&\nVariant::operator=(bool v) {\n    p->valid = true;\n    p->i_value = v;\n    p->vartype = b_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(int32_t v) {\n    p->valid=true;\n    p->i_value = v;\n    p->u_value = v;\n    p->vartype = i_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(uint32_t v) {\n    p->valid=true;\n    p->i_value = v;\n    p->u_value = v;\n    p->vartype = u_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const char* v) {\n    p->valid=true;\n    p->s_value.assign(v);\n    p->vartype = s_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const string& v) {\n    p->valid=true;\n    p->s_value.assign(v);\n    p->vartype = s_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const vector<string>& v) {\n    p->valid=true;\n    p->as_value = v;\n    p->vartype = as_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const vector<vector<string> >& v) {\n    p->valid=true;\n    p->aas_value = v;\n    p->vartype = aas_val;\n    return *this;\n}\nconst Variant&\nVariant::operator=(const Variant& v) {\n    *p = *v.p;\n    return v;\n}\nvoid\nVariantPrivate::operator=(const VariantPrivate& v) {\n    i_value = v.i_value;\n    s_value = v.s_value;\n    as_value = v.as_value;\n    vartype = v.vartype;\n    valid = v.valid;\n}\nbool\nVariant::b() const {\n    return p->b();\n}\nbool\nVariantPrivate::b() const {\n    switch (vartype) {\n    case Variant::b_val:\n    case Variant::i_val:\n         return i_value;\n    case Variant::s_val:\n         return s_value == \"1\" || s_value == \"true\" || s_value == \"True\"\n             || s_value == \"TRUE\";\n    case Variant::as_val:\n         return as_value.size();\n    default:\n         return false;\n    }\n}\nint32_t\nVariant::i() const {\n    return p->i();\n}\nint32_t\nVariantPrivate::i() const {\n    switch (vartype) {\n    case Variant::b_val:\n    case Variant::i_val:\n         return i_value;\n    case Variant::s_val:\n         return atoi(s_value.c_str());\n    case Variant::as_val:\n         return as_value.size();\n    default:\n         return -1;\n    }\n}\nuint32_t\nVariant::u() const {\n    return p->u();\n}\nuint32_t\nVariantPrivate::u() const {\n    switch (vartype) {\n    case Variant::b_val:\n    case Variant::i_val:\n    case Variant::u_val:\n         return u_value;\n    case Variant::s_val:\n         return atoi(s_value.c_str());\n    case Variant::as_val:\n         return as_value.size();\n    default:\n         return -1;\n    }\n}\nstring\nVariantPrivate::itos(int32_t i) {\n    ostringstream o;\n    o << i;\n    return o.str();\n}\nstring\nVariant::s() const {\n    return p->s();\n}\nstring\nVariantPrivate::s() const {\n    switch (vartype) {\n    case Variant::b_val:\n         return i_value ?\"true\" :\"false\";\n    case Variant::i_val:\n         return itos(i_value);\n    case Variant::s_val:\n         return s_value;\n    case Variant::as_val:\n         return as_value.size() ?as_value[0] :\"\";\n    default:\n         return \"\";\n    }\n}\nvector<string>\nVariant::as() const {\n    return p->as();\n}\nvector<string>\nVariantPrivate::as() const {\n    if (vartype == Variant::as_val) {\n        return as_value;\n    }\n    vector<string> v;\n    if (b()) {\n        v.push_back(s());\n    }\n    return v;\n}\nvector<vector<string> >\nVariant::aas() const {\n    return p->aas();\n}\nvector<vector<string> >\nVariantPrivate::aas() const {\n    if (vartype == Variant::aas_val) {\n        return aas_value;\n    }\n    vector<vector<string> > v;\n    if (b()) {\n        v.push_back(as());\n    }\n    return v;\n}\nbool\nVariant::isValid() const {\n    return p->valid;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"geometry.h\"\n#include <tuple>\n\nnamespace\n{\n\ttemplate<int n, typename T>\n\tinline const base::point &pt( const T &t )\n\t{\n\t\treturn std::get<n>( t );\n\t}\n\n\tconstexpr double PI = 3.14159265358979323846;\n}\n\n\nnamespace draw\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsize_t circle_precision( double r )\n{\n\tsize_t n = 3;\n\tdouble error = 0.0;\n\tdo\n\t{\n\t\tn = n * 2;\n\t\terror = r * ( 1 - std::cos( PI \/ n ) );\n\t} while ( error > 0.5 );\n\n\treturn n;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid add_quadratic( const base::point &p1, const base::point &p2, const base::point &p3, polyline &line )\n{\n\tusing base::point;\n\ttypedef std::tuple<point,point,point> curve;\n\tstd::vector<curve> stack;\n\tstack.reserve( 16 );\n\tstack.emplace_back( p1, p2, p3 );\n\tpoint c0, c1, c2, c3;\n\n\twhile ( !stack.empty() )\n\t{\n\t\tcurve &c = stack.back();\n\t\tpoint mid = ( pt<0>( c ) + pt<2>( c ) ) * 0.5;\n\n\t\tif ( point::distance_squared( mid, pt<1>( c ) ) <= 0.01 )\n\t\t{\n\t\t\tline.push_back( pt<2>( c ) );\n\t\t\tstack.pop_back();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tc0 = pt<0>( c );\n\t\t\tc1 = ( c0 + pt<1>( c ) ) * 0.5;\n\t\t\tc3 = ( pt<1>( c ) + pt<2>( c ) ) * 0.5;\n\t\t\tc2 = ( c1 + c3 ) * 0.5;\n\n\t\t\tc = std::make_tuple( c2, c3, pt<2>( c ) ); \/\/ right side\n\t\t\tstack.emplace_back( c0, c1, c2 );\n\t\t}\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid add_cubic( const base::point &p1, const base::point &p2, const base::point &p3, const base::point &p4, polyline &line )\n{\n\tusing base::point;\n\ttypedef std::tuple<point,point,point,point> curve;\n\tstd::vector<curve> stack;\n\tstack.reserve( 16 );\n\tstack.emplace_back( p1, p2, p3, p4 );\n\tpoint p0, p01, p12, p23, p012, p123, p0123, d, d13, d23;\n\tbool first = true;\n\n\twhile ( !stack.empty() )\n\t{\n\t\tcurve &c = stack.back();\n\t\tp01 = ( pt<0>( c ) + pt<1>( c ) ) * 0.5;\n\t\tp12 = ( pt<1>( c ) + pt<2>( c ) ) * 0.5;\n\t\tp23 = ( pt<2>( c ) + pt<3>( c ) ) * 0.5;\n\t\tp012 = ( p01 + p12 ) * 0.5;\n\t\tp123 = ( p12 + p23 ) * 0.5;\n\t\tp0123 = ( p012 + p123 ) * 0.5;\n\n\t\td = pt<0>( c ) - pt<3>( c );\n\t\td13 = pt<1>( c ) - pt<3>( c );\n\t\td23 = pt<2>( c ) - pt<3>( c );\n\n\t\tdouble d2 = d13.x() * d.y() - d13.y() * d.x();\n\t\tdouble d3 = d23.x() * d.y() - d23.y() * d.x();\n\n\t\tif ( ( d2 + d3 ) * ( d2 + d3 ) < 0.1 * ( d.x() * d.x() + d.y() * d.y() ) && !first )\n\t\t{\n\t\t\tline.push_back( pt<3>( c ) );\n\t\t\tstack.pop_back();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tp0 = pt<0>( c );\n\t\t\tc = std::make_tuple( p0123, p123, p23, pt<3>( c ) ); \/\/ right side\n\t\t\tstack.emplace_back( p0, p01, p012, p0123 );\n\t\t}\n\t\tfirst = false;\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid add_arc( const base::point &center, double radius, double a1, double a2, polyline &line )\n{\n\tusing base::point;\n\n\tsize_t n = circle_precision( radius );\n\n\tdouble span = std::abs( std::fmod( ( a1 - a2 + PI ), 2.0 * PI ) - PI );\n\tn = size_t( std::ceil( n * span \/ ( 2.0 * PI ) ) );\n\n\tpoint p = point::polar( radius, a1 ) + center;\n\tif ( line.empty() || point::distance_squared( p, line.back() ) > 0.1 )\n\t\tline.push_back( p );\n\n\tfor ( size_t i = 1; i <= n; ++i )\n\t{\n\t\tdouble m = double(i) \/ double(n);\n\t\tdouble a = a1 * ( 1.0 - m ) + a2 * m;\n\t\tline.push_back( point::polar( radius, a ) + center );\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\n<commit_msg>Increased precision of circle.<commit_after>\n#include \"geometry.h\"\n#include <tuple>\n\nnamespace\n{\n\ttemplate<int n, typename T>\n\tinline const base::point &pt( const T &t )\n\t{\n\t\treturn std::get<n>( t );\n\t}\n\n\tconstexpr double PI = 3.14159265358979323846;\n}\n\n\nnamespace draw\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsize_t circle_precision( double r )\n{\n\tsize_t n = 3;\n\tdouble error = 0.0;\n\tdo\n\t{\n\t\tn = n * 2;\n\t\terror = r * ( 1 - std::cos( PI \/ n ) );\n\t} while ( error > 0.01 );\n\n\treturn n;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid add_quadratic( const base::point &p1, const base::point &p2, const base::point &p3, polyline &line )\n{\n\tusing base::point;\n\ttypedef std::tuple<point,point,point> curve;\n\tstd::vector<curve> stack;\n\tstack.reserve( 16 );\n\tstack.emplace_back( p1, p2, p3 );\n\tpoint c0, c1, c2, c3;\n\n\twhile ( !stack.empty() )\n\t{\n\t\tcurve &c = stack.back();\n\t\tpoint mid = ( pt<0>( c ) + pt<2>( c ) ) * 0.5;\n\n\t\tif ( point::distance_squared( mid, pt<1>( c ) ) <= 0.01 )\n\t\t{\n\t\t\tline.push_back( pt<2>( c ) );\n\t\t\tstack.pop_back();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tc0 = pt<0>( c );\n\t\t\tc1 = ( c0 + pt<1>( c ) ) * 0.5;\n\t\t\tc3 = ( pt<1>( c ) + pt<2>( c ) ) * 0.5;\n\t\t\tc2 = ( c1 + c3 ) * 0.5;\n\n\t\t\tc = std::make_tuple( c2, c3, pt<2>( c ) ); \/\/ right side\n\t\t\tstack.emplace_back( c0, c1, c2 );\n\t\t}\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid add_cubic( const base::point &p1, const base::point &p2, const base::point &p3, const base::point &p4, polyline &line )\n{\n\tusing base::point;\n\ttypedef std::tuple<point,point,point,point> curve;\n\tstd::vector<curve> stack;\n\tstack.reserve( 16 );\n\tstack.emplace_back( p1, p2, p3, p4 );\n\tpoint p0, p01, p12, p23, p012, p123, p0123, d, d13, d23;\n\tbool first = true;\n\n\twhile ( !stack.empty() )\n\t{\n\t\tcurve &c = stack.back();\n\t\tp01 = ( pt<0>( c ) + pt<1>( c ) ) * 0.5;\n\t\tp12 = ( pt<1>( c ) + pt<2>( c ) ) * 0.5;\n\t\tp23 = ( pt<2>( c ) + pt<3>( c ) ) * 0.5;\n\t\tp012 = ( p01 + p12 ) * 0.5;\n\t\tp123 = ( p12 + p23 ) * 0.5;\n\t\tp0123 = ( p012 + p123 ) * 0.5;\n\n\t\td = pt<0>( c ) - pt<3>( c );\n\t\td13 = pt<1>( c ) - pt<3>( c );\n\t\td23 = pt<2>( c ) - pt<3>( c );\n\n\t\tdouble d2 = d13.x() * d.y() - d13.y() * d.x();\n\t\tdouble d3 = d23.x() * d.y() - d23.y() * d.x();\n\n\t\tif ( ( d2 + d3 ) * ( d2 + d3 ) < 0.1 * ( d.x() * d.x() + d.y() * d.y() ) && !first )\n\t\t{\n\t\t\tline.push_back( pt<3>( c ) );\n\t\t\tstack.pop_back();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tp0 = pt<0>( c );\n\t\t\tc = std::make_tuple( p0123, p123, p23, pt<3>( c ) ); \/\/ right side\n\t\t\tstack.emplace_back( p0, p01, p012, p0123 );\n\t\t}\n\t\tfirst = false;\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid add_arc( const base::point &center, double radius, double a1, double a2, polyline &line )\n{\n\tusing base::point;\n\n\tsize_t n = circle_precision( radius );\n\n\tdouble span = std::abs( std::fmod( ( a1 - a2 + PI ), 2.0 * PI ) - PI );\n\tn = size_t( std::ceil( n * span \/ ( 2.0 * PI ) ) );\n\n\tpoint p = point::polar( radius, a1 ) + center;\n\tif ( line.empty() || point::distance_squared( p, line.back() ) > 0.1 )\n\t\tline.push_back( p );\n\n\tfor ( size_t i = 1; i <= n; ++i )\n\t{\n\t\tdouble m = double(i) \/ double(n);\n\t\tdouble a = a1 * ( 1.0 - m ) + a2 * m;\n\t\tline.push_back( point::polar( radius, a ) + center );\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <SFML\/Graphics.hpp>\n\nusing namespace std;\nusing namespace sf;\n\nvoid load_csv(string & filename, vector<float> & data)\n{\n    ifstream infile(filename.c_str());\n    string s_number, line;\n    getline(infile, line);\n    stringstream linestream(line);\n    while(getline(linestream, s_number, ','))\n    {\n        \/\/data.push_back((atof(s_number.c_str()) + 2) * 50);\n        data.push_back(atof(s_number.c_str()));\n    }\n    infile.close();\n}\n\nclass TimeCourse : public Drawable\n{\npublic:\n    vector<float> data;\n    TimeCourse(vector<float> & data)\n    : data(data) {}\nprivate:\n    virtual void draw(sf::RenderTarget& target, sf::RenderStates states) const\n    {\n        VertexArray polyline(sf::LinesStrip, data.size());\n        for (int i = 0; i < data.size(); i++)\n        {\n            Vector2f p = Vector2f((float)i, data.at(i));\n            polyline[i] = p;\n        }\n        target.draw(polyline, states);\n    }\n};\n\nTransform getTransform(Vector2f center, Vector2f zoom) {\n    Transform transform = Transform::Identity;\n    transform = transform.translate(center.x, center.y);\n    cout << center.x << \" \" << center.y << endl;\n    transform = transform.scale(zoom.x, zoom.y);\n    return transform.translate(-center.x, -center.y);\n}\n\nint main(int argc, char ** argv)\n{\n\n    if (argc < 2)\n    {\n        cout << \"Usage: viewer [SIGNAL_FILENAME]\" << endl;\n        cout << \"Exiting.\" << endl;\n        exit(-1);\n    }\n\n    string filename(argv[1]);\n    vector<float> data;\n    load_csv(filename, data);\n    TimeCourse tc(data);\n\n    RenderWindow window(sf::VideoMode(1000, 500), \"Mega Chaos\");\n    View upper_view;\n    upper_view.reset(sf::FloatRect(0, -2, 10000, 4));\n\n    \/\/upper_view.setSize(800, 200);\n    upper_view.setViewport(sf::FloatRect(0.f, 0.f, 1.f, 1.f));\n\n\n\n    int current_view_level = 0;\n    int level_cnt = 3;\n    View current_view = upper_view;\n\n    float x0p, x1p, x0p_, x1p_, pxm, pxs, l, l_;\n    x0p = 0.; x1p = 10000.;\n    x0p_ = x0p; x1p_ = x1p;\n    l = x1p - x0p; l_ = l;\n\n    float y0p, y1p, y0p_, y1p_, pym, pys, h, h_;\n    y0p = -2.; y1p = 2.;\n    y0p_ = y0p; y1p_ = y1p;\n    h = y1p - y0p; h_ = h;\n    float z = 0.95f;\n\n    while (window.isOpen())\n    {\n        sf::Event event;\n        while (window.pollEvent(event))\n        {\n            if (event.type == sf::Event::Closed)\n                window.close();\n            if (event.type == sf::Event::MouseWheelMoved)\n            {\n                if (!Keyboard::isKeyPressed(Keyboard::LControl))\n                {\n                    if ((event.mouseWheel.delta > 0) && (x1p_ - x0p_) < 0.01)\n                    {\n                        continue;\n                    }\n                    std::cout << \"X0P_, X1P_: \" << x0p_ << \", \" << x1p_ << std::endl;\n                    std::cout << \"Len: \" << l_ << \",\" << l << std::endl;\n                    pxm = event.mouseWheel.x;\n                    pxs = pxm \/ window.getSize().x * l + x0p_;\n                    std::cout << \"PXM, PXS:  \" << pxm << \",\" << pxs << std::endl;\n                    z = 1 - event.mouseWheel.delta * 0.05;\n                    x0p = ((pxs) * (1. - z) + z*x0p_);\n                    x1p = z*l_ + x0p;\n                    l = x1p - x0p;\n                    std::cout << \"X0P, X1P: \" << x0p << \", \" << x1p << std::endl;\n                    std::cout << \"Len: \" << l_ << std::endl;\n                    upper_view.reset(sf::FloatRect(x0p, y0p, l, h));\n\n                    x0p_ = x0p;\n                    x1p_ = x1p;\n                    l_ = l;\n\n                }\n                else\n                {\n                    if ((event.mouseWheel.delta > 0) && (y1p_ - y0p_) < 0.01)\n                    {\n                        continue;\n                    }\n                    pym = event.mouseWheel.y;\n                    pys = pym \/ window.getSize().y * h + y0p_;\n                    z = 1 - event.mouseWheel.delta * 0.05;\n                    y0p = ((pys) * (1. - z) + z*y0p_);\n                    y1p = z*h_ + y0p;\n                    h = y1p - y0p;\n                    upper_view.reset(sf::FloatRect(x0p, y0p, l, h));\n\n                    y0p_ = y0p;\n                    y1p_ = y1p;\n                    h_ = h;\n                }\n            }\n        }\n        window.clear(sf::Color::Black);\n        \/\/window.draw(line, 2, sf::Lines);\n\n        window.setView(upper_view);\n        window.draw(tc);\n\n\n        window.display();\n    }\n}<commit_msg>Enabled rectangular zoom<commit_after>#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <SFML\/Graphics.hpp>\n\nusing namespace std;\nusing namespace sf;\n\nvoid load_csv(string & filename, vector<float> & data)\n{\n    ifstream infile(filename.c_str());\n    string s_number, line;\n    getline(infile, line);\n    stringstream linestream(line);\n    while(getline(linestream, s_number, ','))\n    {\n        \/\/data.push_back((atof(s_number.c_str()) + 2) * 50);\n        data.push_back(atof(s_number.c_str()));\n    }\n    infile.close();\n}\n\nclass TimeCourse : public Drawable\n{\npublic:\n    vector<float> data;\n    TimeCourse(vector<float> & data)\n    : data(data) {}\nprivate:\n    virtual void draw(sf::RenderTarget& target, sf::RenderStates states) const\n    {\n        VertexArray polyline(sf::LinesStrip, data.size());\n        for (int i = 0; i < data.size(); i++)\n        {\n            Vector2f p = Vector2f((float)i, data.at(i));\n            polyline[i] = p;\n        }\n        target.draw(polyline, states);\n    }\n};\n\nTransform getTransform(Vector2f center, Vector2f zoom) {\n    Transform transform = Transform::Identity;\n    transform = transform.translate(center.x, center.y);\n    cout << center.x << \" \" << center.y << endl;\n    transform = transform.scale(zoom.x, zoom.y);\n    return transform.translate(-center.x, -center.y);\n}\n\nint main(int argc, char ** argv)\n{\n\n    if (argc < 2)\n    {\n        cout << \"Usage: viewer [SIGNAL_FILENAME]\" << endl;\n        cout << \"Exiting.\" << endl;\n        exit(-1);\n    }\n\n    string filename(argv[1]);\n    vector<float> data;\n    load_csv(filename, data);\n    TimeCourse tc(data);\n\n    RenderWindow window(sf::VideoMode(1000, 500), \"Mega Chaos\");\n    View upper_view;\n    upper_view.reset(sf::FloatRect(0, -2, 10000, 4));\n\n    \/\/upper_view.setSize(800, 200);\n    upper_view.setViewport(sf::FloatRect(0.f, 0.f, 1.f, 1.f));\n\n\n\n    int current_view_level = 0;\n    int level_cnt = 3;\n    View current_view = upper_view;\n\n    float x0p, x1p, x0p_, x1p_, pxm, pxs, l, l_;\n    x0p = 0.; x1p = 10000.;\n    x0p_ = x0p; x1p_ = x1p;\n    l = x1p - x0p; l_ = l;\n\n    float y0p, y1p, y0p_, y1p_, pym, pys, h, h_;\n    y0p = -2.; y1p = 2.;\n    y0p_ = y0p; y1p_ = y1p;\n    h = y1p - y0p; h_ = h;\n    float z = 0.95f;\n\n    RectangleShape zoomRect;\n    Vector2i initialPosition = Vector2i(0, 0);\n    zoomRect.setFillColor(Color(76, 165, 0, 100));\n    View zoomView;\n    zoomView.reset(sf::FloatRect(0, 0, 1000, 500));\n\n    \/\/zoomView.setSize(800, 200);\n    zoomView.setViewport(sf::FloatRect(0.f, 0.f, 1.f, 1.f));\n\n\n    while (window.isOpen())\n    {\n        sf::Event event;\n        while (window.pollEvent(event))\n        {\n            if (event.type == sf::Event::Closed)\n                window.close();\n            if (event.type == sf::Event::MouseWheelMoved)\n            {\n                if (!Keyboard::isKeyPressed(Keyboard::LControl))\n                {\n                    if ((event.mouseWheel.delta > 0) && (x1p_ - x0p_) < 0.01)\n                    {\n                        continue;\n                    }\n                    std::cout << \"X0P_, X1P_: \" << x0p_ << \", \" << x1p_ << std::endl;\n                    std::cout << \"Len: \" << l_ << \",\" << l << std::endl;\n                    pxm = event.mouseWheel.x;\n                    pxs = pxm \/ window.getSize().x * l + x0p_;\n                    std::cout << \"PXM, PXS:  \" << pxm << \",\" << pxs << std::endl;\n                    z = 1 - event.mouseWheel.delta * 0.05;\n                    x0p = ((pxs) * (1. - z) + z*x0p_);\n                    x1p = z*l_ + x0p;\n                    l = x1p - x0p;\n                    std::cout << \"X0P, X1P: \" << x0p << \", \" << x1p << std::endl;\n                    std::cout << \"Len: \" << l_ << std::endl;\n                    upper_view.reset(sf::FloatRect(x0p, y0p, l, h));\n\n                    x0p_ = x0p;\n                    x1p_ = x1p;\n                    l_ = l;\n\n                }\n                else\n                {\n                    if ((event.mouseWheel.delta > 0) && (y1p_ - y0p_) < 0.01)\n                    {\n                        continue;\n                    }\n                    pym = event.mouseWheel.y;\n                    pys = pym \/ window.getSize().y * h + y0p_;\n                    z = 1 - event.mouseWheel.delta * 0.05;\n                    y0p = ((pys) * (1. - z) + z*y0p_);\n                    y1p = z*h_ + y0p;\n                    h = y1p - y0p;\n                    upper_view.reset(sf::FloatRect(x0p, y0p, l, h));\n\n                    y0p_ = y0p;\n                    y1p_ = y1p;\n                    h_ = h;\n                }\n            }\n            if (event.type == Event::MouseButtonPressed && \n                Keyboard::isKeyPressed(Keyboard::R))\n            {\n                initialPosition = Mouse::getPosition(window);\n                zoomRect.setPosition(initialPosition.x, initialPosition.y);\n                cout << \"initial pos: \" << initialPosition.x << \", \" << initialPosition.y << endl;\n            }\n            if (Keyboard::isKeyPressed(Keyboard::R) && Mouse::isButtonPressed(Mouse::Left))\n            {\n                zoomRect.setPosition(initialPosition.x, initialPosition.y);\n\n                Vector2i newPos = Mouse::getPosition(window);\n                float len = newPos.x - initialPosition.x;\n                float wid = newPos.y - initialPosition.y;\n                zoomRect.setSize(Vector2f(len, wid));\n                cout << \"Drawing...\" << endl;\n                cout << \"X, Y: \" << zoomRect.getPosition().x << \", \" << zoomRect.getPosition().y << \n                \", W, H: \" << zoomRect.getSize().x << \", \" << zoomRect.getSize().y << endl;\n            }\n            if (event.type == Event::MouseButtonReleased && zoomRect.getSize().x > 0)\n            {\n                float x0 = initialPosition.x;\n                float x1 = Mouse::getPosition(window).x;\n                x0 = x0 \/ window.getSize().x * l_ + x0p_;\n                x1 = x1 \/ window.getSize().x * l_ + x0p_;\n                float y0 = initialPosition.y;\n                float y1 = Mouse::getPosition(window).y;\n                y0 = y0 \/ window.getSize().y * h_ + y0p_;\n                y1 = y1 \/ window.getSize().y * h_ + y0p_;\n\n                upper_view.reset(FloatRect(x0, y0, x1 - x0, y1 - y0));\n\n                x0p_ = x0p = x0;\n                x1p_ = x1p = x1;\n                y0p_ = y0p = y0;\n                y1p_ = y1p = y1;\n                l_ = l = x1 - x0;\n                h_ = h = y1 - y0;\n\n                zoomRect.setSize(Vector2f(0, 0));\n            }\n        }\n        window.clear(sf::Color::Black);\n        \/\/window.draw(line, 2, sf::Lines);\n\n        window.setView(upper_view);\n        window.draw(tc);\n\n        window.setView(zoomView);\n        window.draw(zoomRect);\n\n\n        window.display();\n    }\n}<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Library\n  Module:    Cell.hh\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\nDescription:\n---------------------------------------------------------------------------\nThis file is part of the Visualization Library. No part of this file\nor its contents may be copied, reproduced or altered in any way\nwithout the express written consent of the authors.\n\nCopyright (c) Ken Martin, Will Schroeder, Bill Lorensen 1993, 1994 \n\n=========================================================================*\/\n\/\/\n\/\/ Abstract specification of computational cells.\n\/\/\n#ifndef __vlCell_h\n#define __vlCell_h\n\n#define MAX_CELL_SIZE 128\n#define TOL 1.e-05 \/\/ Tolerance for geometric calculation\n\n#include \"Object.hh\"\n#include \"FPoints.hh\"\n#include \"FScalars.hh\"\n#include \"IdList.hh\"\n#include \"CellType.hh\"\n\nclass vlCellArray;\n\nclass vlCell : public vlObject\n{\npublic:\n  vlCell(): Points(MAX_CELL_SIZE), PointIds(MAX_CELL_SIZE) {};\n  void Initialize(int npts, int *pts, vlPoints *p);\n  char *GetClassName() {return \"vlCell\";};\n\n  \/\/ Because these objects (cells and derived classes) are computational \n  \/\/ objects, and because they are used internally, do not use memory \n  \/\/ reference counting.\n\n  \/\/ Type of cell\n  virtual int GetCellType() = 0;\n\n  \/\/ Dimensionality of cell (0,1,2, or 3)\n  virtual int GetCellDimension() = 0;\n\n  \/\/ Point coordinates for cell.\n  vlFloatPoints *GetPoints() {return &this->Points;};\n\n  \/\/ Number of points (and other topological entities) in cell\n  int GetNumberOfPoints() {return this->PointIds.GetNumberOfIds();};\n  virtual int GetNumberOfEdges() = 0;\n  virtual int GetNumberOfFaces() = 0;\n\n  \/\/ Get topological entities\n  vlIdList *GetPointIds() {return &this->PointIds;};\n  int GetPointId(int ptId) {return this->PointIds.GetId(ptId);};\n  virtual vlCell *GetEdge(int edgeId) = 0;\n  virtual vlCell *GetFace(int faceId) = 0;\n\n  \/\/ given a point x[3] return inside(=1) or outside(=0) cell; evaluate \n  \/\/ parametric coordinates, sub-cell id (!=0 only if cell is composite),\n  \/\/ distance squared  of point x[3] to cell (in particular, the sub-cell \n  \/\/ indicated), and interpolation weights in cell.\n  virtual int EvaluatePosition(float x[3], float closestPoint[3], \n                               int& subId, float pcoords[3], \n                               float& dist2, float weights[MAX_CELL_SIZE]) = 0;\n\n  \/\/ Determine global coordinate from subId and parametric coordinates\n  virtual void EvaluateLocation(int& subId, float pcoords[3], \n                                float x[3], float weights[MAX_CELL_SIZE]) = 0;\n\n  \/\/ Generate contouring primitives\n  virtual void Contour(float value, vlFloatScalars *cellScalars, \n                       vlFloatPoints *points, vlCellArray *verts, \n                       vlCellArray *lines, vlCellArray *polys, \n                       vlFloatScalars *scalars) = 0;\n\n  \/\/ Compute cell bounding box (xmin,xmax,ymin,ymax,zmin,zmax)\n  float *GetBounds();\n\n  \/\/ Quick intersection of cell bounding box.  Returns != 0 for hit.\n  char HitBBox(float bounds[6], float origin[3], float dir[3], float coord[3]);\n\n  \/\/ left public for quick computational access\n  vlFloatPoints Points;\n  vlIdList PointIds;\n\n};\n\n#endif\n\n\n<commit_msg>ENH: Added length2 method.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Library\n  Module:    Cell.hh\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\nDescription:\n---------------------------------------------------------------------------\nThis file is part of the Visualization Library. No part of this file\nor its contents may be copied, reproduced or altered in any way\nwithout the express written consent of the authors.\n\nCopyright (c) Ken Martin, Will Schroeder, Bill Lorensen 1993, 1994 \n\n=========================================================================*\/\n\/\/\n\/\/ Abstract specification of computational cells.\n\/\/\n#ifndef __vlCell_h\n#define __vlCell_h\n\n#define MAX_CELL_SIZE 128\n#define TOL 1.e-05 \/\/ Tolerance for geometric calculation\n\n#include \"Object.hh\"\n#include \"FPoints.hh\"\n#include \"FScalars.hh\"\n#include \"IdList.hh\"\n#include \"CellType.hh\"\n\nclass vlCellArray;\n\nclass vlCell : public vlObject\n{\npublic:\n  vlCell(): Points(MAX_CELL_SIZE), PointIds(MAX_CELL_SIZE) {};\n  void Initialize(int npts, int *pts, vlPoints *p);\n  char *GetClassName() {return \"vlCell\";};\n\n  \/\/ Because these objects (cells and derived classes) are computational \n  \/\/ objects, and because they are used internally, do not use memory \n  \/\/ reference counting.\n\n  \/\/ Type of cell\n  virtual int GetCellType() = 0;\n\n  \/\/ Dimensionality of cell (0,1,2, or 3)\n  virtual int GetCellDimension() = 0;\n\n  \/\/ Point coordinates for cell.\n  vlFloatPoints *GetPoints() {return &this->Points;};\n\n  \/\/ Number of points (and other topological entities) in cell\n  int GetNumberOfPoints() {return this->PointIds.GetNumberOfIds();};\n  virtual int GetNumberOfEdges() = 0;\n  virtual int GetNumberOfFaces() = 0;\n\n  \/\/ Get topological entities\n  vlIdList *GetPointIds() {return &this->PointIds;};\n  int GetPointId(int ptId) {return this->PointIds.GetId(ptId);};\n  virtual vlCell *GetEdge(int edgeId) = 0;\n  virtual vlCell *GetFace(int faceId) = 0;\n\n  \/\/ given a point x[3] return inside(=1) or outside(=0) cell; evaluate \n  \/\/ parametric coordinates, sub-cell id (!=0 only if cell is composite),\n  \/\/ distance squared  of point x[3] to cell (in particular, the sub-cell \n  \/\/ indicated), and interpolation weights in cell.\n  virtual int EvaluatePosition(float x[3], float closestPoint[3], \n                               int& subId, float pcoords[3], \n                               float& dist2, float weights[MAX_CELL_SIZE]) = 0;\n\n  \/\/ Determine global coordinate from subId and parametric coordinates\n  virtual void EvaluateLocation(int& subId, float pcoords[3], \n                                float x[3], float weights[MAX_CELL_SIZE]) = 0;\n\n  \/\/ Generate contouring primitives\n  virtual void Contour(float value, vlFloatScalars *cellScalars, \n                       vlFloatPoints *points, vlCellArray *verts, \n                       vlCellArray *lines, vlCellArray *polys, \n                       vlFloatScalars *scalars) = 0;\n\n  \/\/ Compute cell bounding box (xmin,xmax,ymin,ymax,zmin,zmax)\n  float *GetBounds();\n\n  \/\/ Compute Length squared of cell (i.e., bounding box diagonal squared)\n  float GetLength2();\n\n  \/\/ Quick intersection of cell bounding box.  Returns != 0 for hit.\n  char HitBBox(float bounds[6], float origin[3], float dir[3], float coord[3]);\n\n  \/\/ left public for quick computational access\n  vlFloatPoints Points;\n  vlIdList PointIds;\n\n};\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  SPI.hpp\n\/\/  Bedrock\n\/\/\n\/\/  Created by Eric Yanush on 2016-02-28.\n\/\/  Copyright © 2016 EricYanush. All rights reserved.\n\/\/\n\n#ifndef SPI_h\n#define SPI_h\n\n#include \"types.hpp\"\n\nnamespace Bedrock {\n    \n    class SPI {\n    public:\n        dev_reg16_t CR1;\n        dev_reg16_t __pad1; \/\/anonymous padding\n        dev_reg16_t CR2;\n        dev_reg16_t __pad2; \/\/anonymous padding\n        dev_reg16_t SR;\n        dev_reg16_t __pad3; \/\/anonymous padding\n        dev_reg16_t DR;\n        dev_reg16_t __pad4; \/\/anonymous padding\n        dev_reg16_t CRCPR;\n        dev_reg16_t __pad5; \/\/anonymous padding\n        dev_reg16_t RXCRCR;\n        dev_reg16_t __pad6; \/\/anonymous padding\n        dev_reg16_t TXCRCR;\n        dev_reg16_t __pad7; \/\/anonymous padding\n        dev_reg16_t I2SCFGR;\n        dev_reg16_t __pad8; \/\/anonymous padding\n        dev_reg16_t I2SPR;\n        dev_reg16_t __pad9; \/\/anonymous padding\n        \n        enum class FrameFormat {\n            MSBFirst = 0,\n            LSBFirst = 1\n        };\n        \n        void setFrameFormat(FrameFormat format) {\n            if (format == FrameFormat::LSBFirst) {\n                CR1 |= (ENABLE << 7);\n            }\n            else {\n                CR1 &= ~(ENABLE << 7);\n            }\n        }\n        \n        FrameFormat getFrameFormat() {\n            uint8_t f = (CR1 >> 7) & 0x1;\n            return static_cast<FrameFormat>(f);\n        }\n        \n        void enable() {\n            CR1 |= (ENABLE << 6);\n        }\n        void disable() {\n            CR1 &= ~(ENABLE << 6);\n        }\n        \n        enum class BaudRatePrescaler\n        {\n            Div2   = 0b000,\n            Div4   = 0b001,\n            Div8   = 0b010,\n            Div16  = 0b011,\n            Div32  = 0b100,\n            Div64  = 0b101,\n            Div128 = 0b110,\n            Div256 = 0b111\n        };\n        void setBaudRatePrescaler(BaudRatePrescaler pre)\n        {\n            CR1 &= ~(0b111 << 3); \/\/clear current value\n            CR1 |= static_cast<uint32_t>(pre) << 3;\n        }\n        BaudRatePrescaler getBaudRatePrescaler()\n        {\n            return static_cast<BaudRatePrescaler>((CR1 >> 3) & 0b111);\n        }\n        \n        enum class DeviceMode\n        {\n            Slave  = 0,\n            Master = 1\n        };\n        \n        \n        void setDeviceMode(DeviceMode mode)\n        {\n            if (mode == DeviceMode::Slave)\n            {\n                CR1 &= ~(ENABLE << 2);\n            }\n            else\n            {\n                CR1 |= (ENABLE << 2);\n            }\n        }\n        \n        DeviceMode getDeviceMode()\n        {\n            return static_cast<DeviceMode>((CR1 >> 2) & 0x1);\n        }\n        \n        enum class SPIMode {\n            Zero  = 0b00,\n            One   = 0b01,\n            Two   = 0b10,\n            Three = 0b11\n        };\n        \n        void setSPIMode(SPIMode mode) {\n            CR1 &= ~(0b11); \/\/Clear current value;\n            CR1 |= static_cast<uint32_t>(mode);\n        }\n        SPIMode getSPIMode() {\n            return static_cast<SPIMode>(CR1 & 0b11);\n        }\n        \n        enum class TransmitSize {\n            Bits4  = 0b0011,\n            Bits5  = 0b0100,\n            Bits6  = 0b0101,\n            Bits7  = 0b0110,\n            Bits8  = 0b0111,\n            Bits9  = 0b1000,\n            Bits10 = 0b1001,\n            Bits11 = 0b1010,\n            Bits12 = 0b1011,\n            Bits13 = 0b1100,\n            Bits14 = 0b1101,\n            Bits15 = 0b1110,\n            Bits16 = 0b1111\n        };\n        \n        void setTransmitSize(TransmitSize size) {\n            CR2 &= ~(0b1111 << 8);\n            CR2 |= static_cast<uint32_t>(size) << 8;\n        }\n        \n        TransmitSize getTransmitSize() {\n            return static_cast<TransmitSize>((CR2 >> 8) & 0b1111);\n        }\n        \n        void enableTXBufferEmptyInterrupt() {\n            CR2 |= ENABLE << 7;\n        }\n        void disableTXBufferEmptyInterrupt() {\n            CR2 &= ~(ENABLE << 7);\n        }\n        \n        void enableRXBufferNotEmptyInterrupt() {\n            CR2 |= ENABLE << 6;\n        }\n        void disableRXBufferNotEmptyInterrupt() {\n            CR2 &= ~(ENABLE << 6);\n        }\n        \n        void enableErrorInterrupt() {\n            CR2 |= ENABLE << 5;\n        }\n        void disableErrorInterrupt() {\n            CR2 &= ~(ENABLE << 5);\n        }\n        \n        void enableTXDMA() {\n            CR2 |= ENABLE << 1;\n        }\n        void disableTXDMA() {\n            CR2 &= ~(ENABLE << 1);\n        }\n        \n        void enableRXDMA() {\n            CR2 |= (ENABLE << 0);\n        }\n        void disableRXDMA() {\n            CR2 &= ~(ENABLE << 0);\n        }\n        \n        enum class BufferLevel {\n            Empty   = 0b00,\n            Quarter = 0b01,\n            Half    = 0b10,\n            Full    = 0b11\n        };\n        \n        BufferLevel getTXLevel() {\n            return static_cast<BufferLevel>((SR >> 11) & 0b11);\n        }\n        \n        BufferLevel getRXLevel() {\n            return static_cast<BufferLevel>((SR >> 9) & 0b11);\n        }\n        \n        bool isBusy() {\n            return (SR >> 7) & 0x1;\n        }\n        \n        bool txEmpty() {\n            return (SR >> 1) & 0x1;\n        }\n        \n        bool rxNotEmpty() {\n            return (SR >> 0) & 0x1;\n        }\n        \n    };\n    \n}\n\n#endif \/* SPI_h *\/\n<commit_msg>Add SPIProvider alias<commit_after>\/\/\n\/\/  SPI.hpp\n\/\/  Bedrock\n\/\/\n\/\/  Created by Eric Yanush on 2016-02-28.\n\/\/  Copyright © 2016 EricYanush. All rights reserved.\n\/\/\n\n#ifndef SPI_h\n#define SPI_h\n\n#include \"types.hpp\"\n\nnamespace Bedrock {\n    \n    class SPI {\n    public:\n        dev_reg16_t CR1;\n        dev_reg16_t __pad1; \/\/anonymous padding\n        dev_reg16_t CR2;\n        dev_reg16_t __pad2; \/\/anonymous padding\n        dev_reg16_t SR;\n        dev_reg16_t __pad3; \/\/anonymous padding\n        dev_reg16_t DR;\n        dev_reg16_t __pad4; \/\/anonymous padding\n        dev_reg16_t CRCPR;\n        dev_reg16_t __pad5; \/\/anonymous padding\n        dev_reg16_t RXCRCR;\n        dev_reg16_t __pad6; \/\/anonymous padding\n        dev_reg16_t TXCRCR;\n        dev_reg16_t __pad7; \/\/anonymous padding\n        dev_reg16_t I2SCFGR;\n        dev_reg16_t __pad8; \/\/anonymous padding\n        dev_reg16_t I2SPR;\n        dev_reg16_t __pad9; \/\/anonymous padding\n        \n        enum class FrameFormat {\n            MSBFirst = 0,\n            LSBFirst = 1\n        };\n        \n        void setFrameFormat(FrameFormat format) {\n            if (format == FrameFormat::LSBFirst) {\n                CR1 |= (ENABLE << 7);\n            }\n            else {\n                CR1 &= ~(ENABLE << 7);\n            }\n        }\n        \n        FrameFormat getFrameFormat() {\n            uint8_t f = (CR1 >> 7) & 0x1;\n            return static_cast<FrameFormat>(f);\n        }\n        \n        void enable() {\n            CR1 |= (ENABLE << 6);\n        }\n        void disable() {\n            CR1 &= ~(ENABLE << 6);\n        }\n        \n        enum class BaudRatePrescaler\n        {\n            Div2   = 0b000,\n            Div4   = 0b001,\n            Div8   = 0b010,\n            Div16  = 0b011,\n            Div32  = 0b100,\n            Div64  = 0b101,\n            Div128 = 0b110,\n            Div256 = 0b111\n        };\n        void setBaudRatePrescaler(BaudRatePrescaler pre)\n        {\n            CR1 &= ~(0b111 << 3); \/\/clear current value\n            CR1 |= static_cast<uint32_t>(pre) << 3;\n        }\n        BaudRatePrescaler getBaudRatePrescaler()\n        {\n            return static_cast<BaudRatePrescaler>((CR1 >> 3) & 0b111);\n        }\n        \n        enum class DeviceMode\n        {\n            Slave  = 0,\n            Master = 1\n        };\n        \n        \n        void setDeviceMode(DeviceMode mode)\n        {\n            if (mode == DeviceMode::Slave)\n            {\n                CR1 &= ~(ENABLE << 2);\n            }\n            else\n            {\n                CR1 |= (ENABLE << 2);\n            }\n        }\n        \n        DeviceMode getDeviceMode()\n        {\n            return static_cast<DeviceMode>((CR1 >> 2) & 0x1);\n        }\n        \n        enum class SPIMode {\n            Zero  = 0b00,\n            One   = 0b01,\n            Two   = 0b10,\n            Three = 0b11\n        };\n        \n        void setSPIMode(SPIMode mode) {\n            CR1 &= ~(0b11); \/\/Clear current value;\n            CR1 |= static_cast<uint32_t>(mode);\n        }\n        SPIMode getSPIMode() {\n            return static_cast<SPIMode>(CR1 & 0b11);\n        }\n        \n        enum class TransmitSize {\n            Bits4  = 0b0011,\n            Bits5  = 0b0100,\n            Bits6  = 0b0101,\n            Bits7  = 0b0110,\n            Bits8  = 0b0111,\n            Bits9  = 0b1000,\n            Bits10 = 0b1001,\n            Bits11 = 0b1010,\n            Bits12 = 0b1011,\n            Bits13 = 0b1100,\n            Bits14 = 0b1101,\n            Bits15 = 0b1110,\n            Bits16 = 0b1111\n        };\n        \n        void setTransmitSize(TransmitSize size) {\n            CR2 &= ~(0b1111 << 8);\n            CR2 |= static_cast<uint32_t>(size) << 8;\n        }\n        \n        TransmitSize getTransmitSize() {\n            return static_cast<TransmitSize>((CR2 >> 8) & 0b1111);\n        }\n        \n        void enableTXBufferEmptyInterrupt() {\n            CR2 |= ENABLE << 7;\n        }\n        void disableTXBufferEmptyInterrupt() {\n            CR2 &= ~(ENABLE << 7);\n        }\n        \n        void enableRXBufferNotEmptyInterrupt() {\n            CR2 |= ENABLE << 6;\n        }\n        void disableRXBufferNotEmptyInterrupt() {\n            CR2 &= ~(ENABLE << 6);\n        }\n        \n        void enableErrorInterrupt() {\n            CR2 |= ENABLE << 5;\n        }\n        void disableErrorInterrupt() {\n            CR2 &= ~(ENABLE << 5);\n        }\n        \n        void enableTXDMA() {\n            CR2 |= ENABLE << 1;\n        }\n        void disableTXDMA() {\n            CR2 &= ~(ENABLE << 1);\n        }\n        \n        void enableRXDMA() {\n            CR2 |= (ENABLE << 0);\n        }\n        void disableRXDMA() {\n            CR2 &= ~(ENABLE << 0);\n        }\n        \n        enum class BufferLevel {\n            Empty   = 0b00,\n            Quarter = 0b01,\n            Half    = 0b10,\n            Full    = 0b11\n        };\n        \n        BufferLevel getTXLevel() {\n            return static_cast<BufferLevel>((SR >> 11) & 0b11);\n        }\n        \n        BufferLevel getRXLevel() {\n            return static_cast<BufferLevel>((SR >> 9) & 0b11);\n        }\n        \n        bool isBusy() {\n            return (SR >> 7) & 0x1;\n        }\n        \n        bool txEmpty() {\n            return (SR >> 1) & 0x1;\n        }\n        \n        bool rxNotEmpty() {\n            return (SR >> 0) & 0x1;\n        }\n        \n    };\n    using SPIProvider = SPI& (*)(void);\n}\n\n#endif \/* SPI_h *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\n#include <dirent.h>\n#include <sys\/types.h>\n#include <pwd.h>\n\n#include \"..\/test_common.h\"\n#include \"..\/..\/src\/constant.h\"\n#include \"..\/..\/src\/misc\/fatal.h\"\n\n\n#ifndef BIN_PATH\n#error require BIN_PATH\n#endif\n\n#ifndef EXTRA_TEST_DIR\n#error require EXTRA_TEST_DIR\n#endif\n\n\/**\n * extra test cases dependent on system directory structure\n * and have side effect on directory structures\n *\/\n\n\nusing namespace ydsh;\n\nclass ModLoadTest : public ExpectOutput {};\n\nstatic ProcBuilder ds(const char *src) {\n    return ProcBuilder{BIN_PATH, \"-c\", src}\n        .setOut(IOConfig::PIPE)\n        .setErr(IOConfig::PIPE)\n        .setWorkingDir(EXTRA_TEST_DIR);\n}\n\nTEST_F(ModLoadTest, prepare) {\n    auto src = format(\"assert test -f $SCRIPT_DIR\/mod4extra1.ds\\n\"\n                      \"assert !test -f $SCRIPT_DIR\/mod4extra2.ds\\n\"\n                      \"assert !test -f $SCRIPT_DIR\/mod4extra3.ds\\n\"\n                      \"assert test -f ~\/.ydsh\/module\/mod4extra1.ds\\n\"\n                      \"assert test -f ~\/.ydsh\/module\/mod4extra2.ds\\n\"\n                      \"assert !test -f ~\/.ydsh\/module\/mod4extra3.ds\\n\"\n                      \"assert test -f %s\/mod4extra1.ds\\n\"\n                      \"assert test -f %s\/mod4extra2.ds\\n\"\n                      \"assert test -f %s\/mod4extra3.ds\\n\"\n                      \"true\", SYSTEM_MOD_DIR, SYSTEM_MOD_DIR, SYSTEM_MOD_DIR);\n\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src.c_str()), 0));\n}\n\nTEST_F(ModLoadTest, scriptdir) {\n    const char *src = R\"(\n        source mod4extra1.ds\n        assert $OK_LOADING == \"script_dir: mod4extra1.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include1.ds\n        assert $mod1.OK_LOADING == \"script_dir: mod4extra1.ds\"\n        assert $mod2.OK_LOADING == \"local: mod4extra2.ds\"\n        assert $mod3.OK_LOADING == \"system: mod4extra3.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0, \"include from script_dir!!\\n\"));\n}\n\nTEST_F(ModLoadTest, local) {\n    const char *src = R\"(\n        source mod4extra2.ds\n        assert $OK_LOADING == \"local: mod4extra2.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include2.ds\n        assert $mod1.OK_LOADING == \"local: mod4extra1.ds\"\n        assert $mod2.OK_LOADING == \"local: mod4extra2.ds\"\n        assert $mod3.OK_LOADING == \"system: mod4extra3.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include4.ds\n        assert $mod.OK_LOADING == \"system: mod4extra4.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n}\n\nTEST_F(ModLoadTest, system) {\n    const char *src = R\"(\n        source mod4extra3.ds\n        assert $OK_LOADING == \"system: mod4extra3.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include3.ds\n        assert $mod1.OK_LOADING == \"system: mod4extra1.ds\"\n        assert $mod2.OK_LOADING == \"system: mod4extra2.ds\"\n        assert $mod3.OK_LOADING == \"system: mod4extra3.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include5.ds\n        exit 100\n)\";\n\n    auto e = format(\"%s\/include5.ds:2: [semantic error] not found module: `mod4extra5.ds'\\n\"\n                    \"source mod4extra5.ds as mod\\n\"\n                    \"       ^~~~~~~~~~~~~\\n\"\n                    \"(string):2: [note] at module import\\n\"\n                    \"        source include5.ds\\n\"\n                    \"               ^~~~~~~~~~~\\n\", SYSTEM_MOD_DIR);\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 1, \"\", e.c_str()));\n}\n\nstatic ProcHandle invoke() {\n    termios term;\n    xcfmakesane(term);\n    return ProcBuilder{BIN_PATH}\n            .setIn(IOConfig::PTY)\n            .setOut(IOConfig::PTY)\n            .setErr(IOConfig::PIPE)\n            .setTerm(term)\n            .addEnv(\"TERM\", \"xterm\")();\n}\n\nclass FileFactory {\nprivate:\n    std::string name;\n\npublic:\n    \/**\n     *\n     * @param name\n     * must be full path\n     * @param content\n     *\/\n    FileFactory(const char *name, const std::string &content) : name(name) {\n        FILE *fp = fopen(this->name.c_str(), \"w\");\n        fwrite(content.c_str(), sizeof(char), content.size(), fp);\n        fflush(fp);\n        fclose(fp);\n    }\n\n    ~FileFactory() {\n        remove(this->name.c_str());\n    }\n\n    const std::string &getFileName() const {\n        return this->name;\n    }\n};\n\nstatic std::string getHOME() {\n    std::string str;\n    struct passwd *pw = getpwuid(getuid());\n    if(pw == nullptr) {\n        fatal_perror(\"getpwuid failed\");\n    }\n    str = pw->pw_dir;\n    return str;\n}\n\nstatic void write(ProcHandle &handle, const char *text) {\n    int r = write(handle.in(), text, strlen(text));\n    (void) r;\n    fsync(handle.in());\n}\n\nTEST_F(ModLoadTest, rcfile1) {\n    std::string rcpath = getHOME();\n    rcpath += \"\/.ydshrc\";\n    FileFactory fileFactory(rcpath.c_str(), \"var RC_VAR = 'rcfile: ~\/.ydshrc'\");\n\n    auto handle = invoke();\n    write(handle, \"assert $RC_VAR == 'rcfile: ~\/.ydshrc'; exit 23\");\n    auto ret = handle.waitAndGetResult(false);\n    ASSERT_NO_FATAL_FAILURE(this->expect(ret, 23, WaitStatus::EXITED));\n}\n\nint main(int argc, char **argv) {\n    ::testing::InitGoogleTest(&argc, argv);\n    return RUN_ALL_TESTS();\n}<commit_msg>fix extra test case<commit_after>#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\n#include <dirent.h>\n#include <sys\/types.h>\n#include <pwd.h>\n\n#include <config.h>\n#include \"..\/test_common.h\"\n#include \"..\/..\/src\/constant.h\"\n#include \"..\/..\/src\/misc\/fatal.h\"\n\n\n#ifndef BIN_PATH\n#error require BIN_PATH\n#endif\n\n#ifndef EXTRA_TEST_DIR\n#error require EXTRA_TEST_DIR\n#endif\n\n\/**\n * extra test cases dependent on system directory structure\n * and have side effect on directory structures\n *\/\n\n\nusing namespace ydsh;\n\nclass ModLoadTest : public ExpectOutput {};\n\nstatic ProcBuilder ds(const char *src) {\n    return ProcBuilder{BIN_PATH, \"-c\", src}\n        .setOut(IOConfig::PIPE)\n        .setErr(IOConfig::PIPE)\n        .setWorkingDir(EXTRA_TEST_DIR);\n}\n\nTEST_F(ModLoadTest, prepare) {\n    auto src = format(\"assert test -f $SCRIPT_DIR\/mod4extra1.ds\\n\"\n                      \"assert !test -f $SCRIPT_DIR\/mod4extra2.ds\\n\"\n                      \"assert !test -f $SCRIPT_DIR\/mod4extra3.ds\\n\"\n                      \"assert test -f ~\/.ydsh\/module\/mod4extra1.ds\\n\"\n                      \"assert test -f ~\/.ydsh\/module\/mod4extra2.ds\\n\"\n                      \"assert !test -f ~\/.ydsh\/module\/mod4extra3.ds\\n\"\n                      \"assert test -f %s\/mod4extra1.ds\\n\"\n                      \"assert test -f %s\/mod4extra2.ds\\n\"\n                      \"assert test -f %s\/mod4extra3.ds\\n\"\n                      \"true\", SYSTEM_MOD_DIR, SYSTEM_MOD_DIR, SYSTEM_MOD_DIR);\n\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src.c_str()), 0));\n}\n\nTEST_F(ModLoadTest, scriptdir) {\n    const char *src = R\"(\n        source mod4extra1.ds\n        assert $OK_LOADING == \"script_dir: mod4extra1.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include1.ds\n        assert $mod1.OK_LOADING == \"script_dir: mod4extra1.ds\"\n        assert $mod2.OK_LOADING == \"local: mod4extra2.ds\"\n        assert $mod3.OK_LOADING == \"system: mod4extra3.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0, \"include from script_dir!!\\n\"));\n}\n\nTEST_F(ModLoadTest, local) {\n    const char *src = R\"(\n        source mod4extra2.ds\n        assert $OK_LOADING == \"local: mod4extra2.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include2.ds\n        assert $mod1.OK_LOADING == \"local: mod4extra1.ds\"\n        assert $mod2.OK_LOADING == \"local: mod4extra2.ds\"\n        assert $mod3.OK_LOADING == \"system: mod4extra3.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include4.ds\n        assert $mod.OK_LOADING == \"system: mod4extra4.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n}\n\nTEST_F(ModLoadTest, system) {\n    const char *src = R\"(\n        source mod4extra3.ds\n        assert $OK_LOADING == \"system: mod4extra3.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include3.ds\n        assert $mod1.OK_LOADING == \"system: mod4extra1.ds\"\n        assert $mod2.OK_LOADING == \"system: mod4extra2.ds\"\n        assert $mod3.OK_LOADING == \"system: mod4extra3.ds\"\n)\";\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 0));\n\n    src = R\"(\n        source include5.ds\n        exit 100\n)\";\n\n    auto e = format(\"%s\/include5.ds:2: [semantic error] not found module: `mod4extra5.ds'\\n\"\n                    \"source mod4extra5.ds as mod\\n\"\n                    \"       ^~~~~~~~~~~~~\\n\"\n                    \"(string):2: [note] at module import\\n\"\n                    \"        source include5.ds\\n\"\n                    \"               ^~~~~~~~~~~\\n\", SYSTEM_MOD_DIR);\n    ASSERT_NO_FATAL_FAILURE(this->expect(ds(src), 1, \"\", e.c_str()));\n}\n\nclass FileFactory {\nprivate:\n    std::string name;\n\npublic:\n    \/**\n     *\n     * @param name\n     * must be full path\n     * @param content\n     *\/\n    FileFactory(const char *name, const std::string &content) : name(name) {\n        FILE *fp = fopen(this->name.c_str(), \"w\");\n        fwrite(content.c_str(), sizeof(char), content.size(), fp);\n        fflush(fp);\n        fclose(fp);\n    }\n\n    ~FileFactory() {\n        remove(this->name.c_str());\n    }\n\n    const std::string &getFileName() const {\n        return this->name;\n    }\n};\n\nstruct RCTest : public InteractiveBase {\n    RCTest() : InteractiveBase(BIN_PATH, \".\") {}\n};\n\nstatic std::string getHOME() {\n    std::string str;\n    struct passwd *pw = getpwuid(getuid());\n    if(pw == nullptr) {\n        fatal_perror(\"getpwuid failed\");\n    }\n    str = pw->pw_dir;\n    return str;\n}\n\n#define XSTR(v) #v\n#define STR(v) XSTR(v)\n\n#define PROMPT \"ydsh-\" STR(X_INFO_MAJOR_VERSION) \".\" STR(X_INFO_MINOR_VERSION) \"$ \"\n\nTEST_F(RCTest, rcfile1) {\n    std::string rcpath = getHOME();\n    rcpath += \"\/.ydshrc\";\n    FileFactory fileFactory(rcpath.c_str(), \"var RC_VAR = 'rcfile: ~\/.ydshrc'\");\n\n    this->invoke(\"--quiet\");\n    ASSERT_NO_FATAL_FAILURE(this->expect(PROMPT));\n    ASSERT_NO_FATAL_FAILURE(this->sendAndExpect(\"assert $RC_VAR == 'rcfile: ~\/.ydshrc'; exit 23\", PROMPT));\n    ASSERT_NO_FATAL_FAILURE(this->waitAndExpect(23, WaitStatus::EXITED));\n}\n\nint main(int argc, char **argv) {\n    ::testing::InitGoogleTest(&argc, argv);\n    return RUN_ALL_TESTS();\n}<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cassert>\n#include <vector>\n\n#ifdef ENABLE_PROGRESS_THREAD\n#include <pthread.h>\n#endif\n\n#include <upcxx\/upcxx.hpp>\n\nnamespace cm {\n\n\/\/\/ @cond INTERNAL_DOCS\n\n\/**\n * A task that performs remote updates (spawned by Bin<T>)\n * \\param g_my_data Reference to local storage on the target\n * \\param ix View to update indexing (already transferred target)\n * \\param data View to update data (already transferred target)\n *\/\ntemplate <typename T>\nvoid update_task(long size, upcxx::global_ptr<T> g_my_data,\n                 upcxx::view<long> ix, upcxx::view<T> data) {\n#ifndef NOCHECK\n  assert(g_my_data.is_local());\n#endif\n  T *my_data = g_my_data.local();\n  for (long k = 0; k < size; k++) my_data[ix[k]] += data[k];\n}\n\n\/**\n * Implements the binning \/ remote application for a single thread\n * Not very efficient in terms of space for the moment, in exchange for\n * simplicity.\n * \\tparam T Matrix data type (e.g. float)\n *\/\ntemplate <typename T>\nclass Bin {\n private:\n  bool _init;                           \/\/ whether fields intialized\n  int _remote_tid;                      \/\/ thread id of target\n  upcxx::global_ptr<T> _g_remote_data;  \/\/ global_ptr _local_ to target\n  std::vector<long> _ix;                \/\/ linear indexing for target\n  std::vector<T> _data;                 \/\/ update data for target\n#ifdef ENABLE_PROGRESS_THREAD\n  pthread_mutex_t *_tq_mutex;  \/\/ mutex protecting task-queue ops\n#endif\n\n  inline void clear() {\n    _ix.clear();\n    _data.clear();\n  }\n\n public:\n  \/**\n   * Create an uninitialized Bin object\n   *\/\n  Bin() : _init(false) {}\n\n#ifdef ENABLE_PROGRESS_THREAD\n  \/**\n   * Create the Bin object associated with a given target\n   * \\param g_remote_data global_ptr<T> reference to the target-local storage\n   * \\param tq_mutex pthread mutex protecting the task queue and associated\n   * GASNet operations\n   *\/\n  Bin(upcxx::global_ptr<T> g_remote_data, pthread_mutex_t *tq_mutex)\n      : _init(true),\n        _remote_tid(g_remote_data.where()),\n        _g_remote_data(g_remote_data),\n        _tq_mutex(tq_mutex) {}\n\n  \/**\n   * Initialize the previously empty Bin object for a given target\n   * \\param g_remote_data global_ptr<T> reference to the target-local storage\n   * \\param tq_mutex pthread mutex protecting the task queue and associated\n   * GASNet operations\n   *\n   * \\b Note: It is erroneous to call this on a previously initialized Bin.\n   *\/\n  inline void init(upcxx::global_ptr<T> g_remote_data,\n                   pthread_mutex_t *tq_mutex) {\n    assert(!_init);\n    _remote_tid = g_remote_data.where();\n    _g_remote_data = g_remote_data;\n    _tq_mutex = tq_mutex;\n    _init = true;\n  }\n#else\n  \/**\n   * Create the Bin object associated with a given target\n   * \\param g_remote_data global_ptr<T> reference to the target-local storage\n   *\/\n  Bin(upcxx::global_ptr<T> g_remote_data)\n      : _init(true),\n        _remote_tid(g_remote_data.where()),\n        _g_remote_data(g_remote_data) {}\n\n  \/**\n   * Initialize the previously empty Bin object for a given target\n   * \\param g_remote_data global_ptr<T> reference to the target-local storage\n   *\n   * \\b Note: It is erroneous to call this on a previously initialized Bin.\n   *\/\n  inline void init(upcxx::global_ptr<T> g_remote_data) {\n    assert(!_init);\n    _remote_tid = g_remote_data.where();\n    _g_remote_data = g_remote_data;\n    _init = true;\n  }\n#endif\n\n  \/**\n   * Current size of the bin (number of update elems not yet applied)\n   *\/\n  inline long size() const { return _ix.size(); }\n\n  \/**\n   * Add an elemental update to this bin\n   * \\param data Elemental update (r.h.s. of +=)\n   * \\param ij Linear index (on the target) of element to be updated\n   *\/\n  inline void append(T data, long ij) {\n    _ix.push_back(ij);\n    _data.push_back(data);\n  }\n\n  \/**\n   * \"Flush\" this bin by initiate remote async update using the current bin\n   * contents.\n   * \\param p_op upcxx::promise<> pointer to which RPC remote operation\n   * completion will be registered\n   *\/\n  void flush(upcxx::promise<> *p_op) {\n#ifndef NOCHECK\n    assert(_init);\n#endif\n\n#ifdef ENABLE_PROGRESS_THREAD\n    pthread_mutex_lock(_tq_mutex);\n#endif\n\n    upcxx::promise<> p_src;  \/\/ Track source completion to render clear() safe\n\n    upcxx::rpc(_remote_tid,\n               upcxx::source_cx::as_promise(p_src) |\n                   upcxx::operation_cx::as_promise(*p_op),\n               update_task<T>, _data.size(), _g_remote_data,\n               upcxx::make_view(_ix), upcxx::make_view(_data));\n\n    p_src.finalize().wait();\n\n#ifdef ENABLE_PROGRESS_THREAD\n    pthread_mutex_unlock(_tq_mutex);\n#endif\n\n    \/\/ clear internal (vector) storage\n    clear();\n  }\n\n};  \/\/ end of Bin\n\n\/\/\/ @endcond\n\n}  \/\/ namespace cm\n<commit_msg>Remove progress thread support from bin.hpp<commit_after>#pragma once\n\n#include <cassert>\n#include <vector>\n\n#include <upcxx\/upcxx.hpp>\n\nnamespace cm {\n\n\/\/\/ @cond INTERNAL_DOCS\n\n\/**\n * A task that performs remote updates (spawned by Bin<T>)\n * \\param g_my_data Reference to local storage on the target\n * \\param ix View to update indexing (already transferred target)\n * \\param data View to update data (already transferred target)\n *\/\ntemplate <typename T>\nvoid update_task(long size, upcxx::global_ptr<T> g_my_data,\n                 upcxx::view<long> ix, upcxx::view<T> data) {\n#ifndef NOCHECK\n  assert(g_my_data.is_local());\n#endif\n  T *my_data = g_my_data.local();\n  for (long k = 0; k < size; k++) my_data[ix[k]] += data[k];\n}\n\n\/**\n * Implements the binning \/ remote application for a single thread\n * Not very efficient in terms of space for the moment, in exchange for\n * simplicity.\n * \\tparam T Matrix data type (e.g. float)\n *\/\ntemplate <typename T>\nclass Bin {\n private:\n  bool _init;                           \/\/ whether fields intialized\n  int _remote_tid;                      \/\/ thread id of target\n  upcxx::global_ptr<T> _g_remote_data;  \/\/ global_ptr _local_ to target\n  std::vector<long> _ix;                \/\/ linear indexing for target\n  std::vector<T> _data;                 \/\/ update data for target\n\n  inline void clear() {\n    _ix.clear();\n    _data.clear();\n  }\n\n public:\n  \/**\n   * Create an uninitialized Bin object\n   *\/\n  Bin() : _init(false) {}\n\n  \/**\n   * Create the Bin object associated with a given target\n   * \\param g_remote_data global_ptr<T> reference to the target-local storage\n   *\/\n  Bin(upcxx::global_ptr<T> g_remote_data)\n      : _init(true),\n        _remote_tid(g_remote_data.where()),\n        _g_remote_data(g_remote_data) {}\n\n  \/**\n   * Initialize the previously empty Bin object for a given target\n   * \\param g_remote_data global_ptr<T> reference to the target-local storage\n   *\n   * \\b Note: It is erroneous to call this on a previously initialized Bin.\n   *\/\n  inline void init(upcxx::global_ptr<T> g_remote_data) {\n    assert(!_init);\n    _remote_tid = g_remote_data.where();\n    _g_remote_data = g_remote_data;\n    _init = true;\n  }\n\n  \/**\n   * Current size of the bin (number of update elems not yet applied)\n   *\/\n  inline long size() const { return _ix.size(); }\n\n  \/**\n   * Add an elemental update to this bin\n   * \\param data Elemental update (r.h.s. of +=)\n   * \\param ij Linear index (on the target) of element to be updated\n   *\/\n  inline void append(T data, long ij) {\n    _ix.push_back(ij);\n    _data.push_back(data);\n  }\n\n  \/**\n   * \"Flush\" this bin by initiate remote async update using the current bin\n   * contents.\n   * \\param p_op upcxx::promise<> pointer to which RPC remote operation\n   * completion will be registered\n   *\/\n  void flush(upcxx::promise<> *p_op) {\n#ifndef NOCHECK\n    assert(_init);\n#endif\n\n    upcxx::promise<> p_src;  \/\/ Track source completion to render clear() safe\n\n    upcxx::rpc(_remote_tid,\n               upcxx::source_cx::as_promise(p_src) |\n                   upcxx::operation_cx::as_promise(*p_op),\n               update_task<T>, _data.size(), _g_remote_data,\n               upcxx::make_view(_ix), upcxx::make_view(_data));\n\n    \/\/ NOTE: upcxx::future::wait invokes user-level progress, so remote updates\n    \/\/ _may_ execute here (if the caller holds the master persona).\n    p_src.finalize().wait();\n\n    \/\/ It is now safe to call clear().\n    clear();\n  }\n\n};  \/\/ end of Bin\n\n\/\/\/ @endcond\n\n}  \/\/ namespace cm\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cassert>\n#include <vector>\n#ifdef ENABLE_PROGRESS_THREAD\n#include <pthread.h>\n#endif\n#ifdef FLUSH_ALLOC_RETRY\n#include <algorithm> \/\/ std::min\n#include <unistd.h>  \/\/ usleep\n#define RETRY_MIN_INTERVAL 10\t    \/\/ ms\n#define RETRY_MAX_INTERVAL 1000\t    \/\/ ms\n#define RETRY_INTERVAL_FACTOR 2\n#define RETRY_MAX_ITER 100\n#endif\n#include <upcxx.h>\n\n#ifdef FLUSH_ALLOC_RETRY\n\/\/ retry remote allocation statement A with exponential backoff\n#ifdef FLUSH_WARN_ON_RETRY\n#define FLUSH_WARN_RETRY if ( iter > 0 ) \\\n  printf( \"Warning: Thread %4i : ALLOC_WRAP required %li attempts\\n\", \\\n\t  MYTHREAD, iter );\n#else\n#define FLUSH_WARN_RETRY \/* noop *\/\n#endif\n#define ALLOC_WRAP( A ) \\\n  do { \\\n    long iter = 0; \\\n    useconds_t t = RETRY_MIN_INTERVAL; \\\n    while ( ( A ).raw_ptr() == NULL && iter++ < RETRY_MAX_ITER ) { \\\n      usleep( 1000 * t ); \\\n      t = std::min( t * RETRY_INTERVAL_FACTOR, \\\n\t\t    (useconds_t) RETRY_MAX_INTERVAL ); \\\n    } \\\n    FLUSH_WARN_RETRY \\\n  } while(0)\n#else\n\/\/ identity\n#define ALLOC_WRAP( A ) A\n#endif\n\nnamespace cm\n{\n\n  \/\/\/ @cond INTERNAL_DOCS\n\n  \/**\n   * A task that performs remote updates (spawned by Bin<T>)\n   * \\param g_my_data Reference to local storage on the target\n   * \\param g_ix Reference to update indexing (already transferred target)\n   * \\param g_data Reference to update data (already transferred target)\n   *\/\n  template <typename T>\n  void\n  update_task( long size,\n               upcxx::global_ptr<T>    g_my_data,\n               upcxx::global_ptr<long> g_ix,\n               upcxx::global_ptr<T>    g_data )\n  {\n    \/\/ local ptrs (for casts)\n    long *p_ix;\n    T *p_data, *p_my_data;\n\n#ifndef NOCHECK\n    assert( g_my_data.where() == MYTHREAD );\n    assert( g_ix.where()      == MYTHREAD );\n    assert( g_data.where()    == MYTHREAD );\n#endif\n\n    \/\/ cast to local ptrs\n    p_ix = (long *) g_ix;\n    p_data = (T *) g_data;\n    p_my_data = (T *) g_my_data;\n\n    \/\/ update\n    for ( long k = 0; k < size; k++ )\n      p_my_data[p_ix[k]] += p_data[k];\n\n    \/\/ free local (but remotely allocated) storage\n    upcxx::deallocate( g_ix );\n    upcxx::deallocate( g_data );\n\n  } \/\/ end of update_task\n\n\n  \/**\n   * Implements the binning \/ remote application for a single thread\n   * Not very efficient in terms of space for the moment, in exchange for\n   * simplicity.\n   * \\tparam T Matrix data type (e.g. float)\n   *\/\n  template<typename T>\n  class Bin\n  {\n\n   private:\n\n    bool _init;                           \/\/ whether fields intialized\n    int _remote_tid;                      \/\/ thread id of target\n    upcxx::global_ptr<T> _g_remote_data;  \/\/ global_ptr _local_ to target\n    std::vector<long> _ix;                \/\/ linear indexing for target\n    std::vector<T> _data;                 \/\/ update data for target\n#ifdef ENABLE_PROGRESS_THREAD\n    pthread_mutex_t *_tq_mutex;           \/\/ mutex protecting task-queue ops\n#endif\n\n    inline void\n    clear()\n    {\n      _ix.clear();\n      _data.clear();\n    }\n\n   public:\n\n    \/**\n     * Create an uninitialized Bin object\n     *\/\n    Bin() :\n      _init(false)\n    {}\n\n#ifdef ENABLE_PROGRESS_THREAD\n    \/**\n     * Create the Bin object associated with a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     * \\param tq_mutex pthread mutex protecting the task queue and associated\n     * GASNet operations\n     *\/\n    Bin( upcxx::global_ptr<T> g_remote_data, pthread_mutex_t * tq_mutex ) :\n      _init(true),\n      _remote_tid(g_remote_data.where()),\n      _g_remote_data(g_remote_data),\n      _tq_mutex(tq_mutex)\n    {}\n\n    \/**\n     * Initialize the previously empty Bin object for a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     * \\param tq_mutex pthread mutex protecting the task queue and associated\n     * GASNet operations\n     *\n     * \\b Note: It is erroneous to call this on a previously initialized Bin.\n     *\/\n    inline void\n    init( upcxx::global_ptr<T> g_remote_data, pthread_mutex_t * tq_mutex )\n    {\n      assert( ! _init );\n      _remote_tid = g_remote_data.where();\n      _g_remote_data = g_remote_data;\n      _tq_mutex = tq_mutex;\n      _init = true;\n    }\n#else\n    \/**\n     * Create the Bin object associated with a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     *\/\n    Bin( upcxx::global_ptr<T> g_remote_data ) :\n      _init(true),\n      _remote_tid(g_remote_data.where()),\n      _g_remote_data(g_remote_data)\n    {}\n\n    \/**\n     * Initialize the previously empty Bin object for a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     *\n     * \\b Note: It is erroneous to call this on a previously initialized Bin.\n     *\/\n    inline void\n    init( upcxx::global_ptr<T> g_remote_data )\n    {\n      assert( ! _init );\n      _remote_tid = g_remote_data.where();\n      _g_remote_data = g_remote_data;\n      _init = true;\n    }\n#endif\n\n    \/**\n     * Current size of the bin (number of update elems not yet applied)\n     *\/\n    inline long\n    size() const\n    {\n      return _ix.size();\n    }\n\n    \/**\n     * Add an elemental update to this bin\n     * \\param data Elemental update (r.h.s. of +=)\n     * \\param ij Linear index (on the target) of element to be updated\n     *\/\n    inline void\n    append( T data, long ij )\n    {\n      _ix.push_back( ij );\n      _data.push_back( data );\n    }\n\n    \/**\n     * \"Flush\" this bin by initiate remote async update using the current bin\n     * contents.\n     * \\param e upcxx::event pointer to which the async task will be registered\n     *\/\n    void\n    flush( upcxx::event *e )\n    {\n#ifndef NOCHECK\n      assert( _init );\n#endif\n\n      \/\/ global ptrs to local storage for async remote copy\n      upcxx::global_ptr<long> g_ix;\n      upcxx::global_ptr<T> g_data;\n\n#ifdef ENABLE_PROGRESS_THREAD\n      pthread_mutex_lock( _tq_mutex );\n#endif\n\n      \/\/ allocate remote storage\n      ALLOC_WRAP( g_ix = upcxx::allocate<long>( _remote_tid, _ix.size() ) );\n#ifdef NOCHECK\n      assert( g_ix.raw_ptr() != NULL );\n#endif\n      ALLOC_WRAP( g_data = upcxx::allocate<T>( _remote_tid, _data.size() ) );\n#ifdef NOCHECK\n      assert( g_data.raw_ptr() != NULL );\n#endif\n\n      \/\/ copy to remote\n      upcxx::copy( (upcxx::global_ptr<long>) _ix.data(), g_ix, _ix.size() );\n      upcxx::copy( (upcxx::global_ptr<T>) _data.data(), g_data, _data.size() );\n\n      \/\/ spawn the remote update (responsible for deallocating g_ix, g_data)\n      upcxx::async( _remote_tid, e )( update_task<T>,\n                                      _data.size(),\n                                      _g_remote_data,\n                                      g_ix, g_data );\n\n#ifdef ENABLE_PROGRESS_THREAD\n      pthread_mutex_unlock( _tq_mutex );\n#endif\n\n      \/\/ clear internal (vector) storage\n      clear();\n    }\n\n  }; \/\/ end of Bin\n\n  \/\/\/ @endcond\n\n}\n<commit_msg>Updated FLUSH_ALLOC_RETRY default iteration count<commit_after>#pragma once\n\n#include <cassert>\n#include <vector>\n\n#ifdef ENABLE_PROGRESS_THREAD\n#include <pthread.h>\n#endif\n\n#ifdef FLUSH_ALLOC_RETRY\n#include <algorithm> \/\/ std::min\n#include <unistd.h>  \/\/ usleep\n#ifndef RETRY_MIN_INTERVAL\n#define RETRY_MIN_INTERVAL 10       \/\/ ms\n#endif\n#ifndef RETRY_MAX_INTERVAL\n#define RETRY_MAX_INTERVAL 1000     \/\/ ms\n#endif\n#ifndef RETRY_INTERVAL_FACTOR\n#define RETRY_INTERVAL_FACTOR 2\n#endif\n#ifndef RETRY_MAX_ITER\n#define RETRY_MAX_ITER 1000\n#endif\n#endif \/* FLUSH_ALLOC_RETRY *\/\n\n#include <upcxx.h>\n\n\/\/ retry remote allocation statement A with bounded exponential backoff\n#ifdef FLUSH_ALLOC_RETRY\n#ifdef FLUSH_WARN_ON_RETRY\n#define FLUSH_WARN_RETRY if ( iter > 0 ) \\\n  printf( \"Warning: Thread %4i : ALLOC_WRAP required %li attempts\\n\", \\\n          MYTHREAD, iter );\n#else\n#define FLUSH_WARN_RETRY \/* noop *\/\n#endif \/* FLUSH_WARN_RETRY *\/\n#define ALLOC_WRAP( A ) \\\n  do { \\\n    long iter = 0; \\\n    useconds_t t = RETRY_MIN_INTERVAL; \\\n    while ( ( A ).raw_ptr() == NULL && iter++ < RETRY_MAX_ITER ) { \\\n      usleep( 1000 * t ); \\\n      t = std::min( t * RETRY_INTERVAL_FACTOR, \\\n                    (useconds_t) RETRY_MAX_INTERVAL ); \\\n    } \\\n    FLUSH_WARN_RETRY \\\n  } while(0)\n#else\n\/\/ identity\n#define ALLOC_WRAP( A ) A\n#endif \/* FLUSH_ALLOC_RETRY *\/\n\nnamespace cm\n{\n\n  \/\/\/ @cond INTERNAL_DOCS\n\n  \/**\n   * A task that performs remote updates (spawned by Bin<T>)\n   * \\param g_my_data Reference to local storage on the target\n   * \\param g_ix Reference to update indexing (already transferred target)\n   * \\param g_data Reference to update data (already transferred target)\n   *\/\n  template <typename T>\n  void\n  update_task( long size,\n               upcxx::global_ptr<T>    g_my_data,\n               upcxx::global_ptr<long> g_ix,\n               upcxx::global_ptr<T>    g_data )\n  {\n    \/\/ local ptrs (for casts)\n    long *p_ix;\n    T *p_data, *p_my_data;\n\n#ifndef NOCHECK\n    assert( g_my_data.where() == MYTHREAD );\n    assert( g_ix.where()      == MYTHREAD );\n    assert( g_data.where()    == MYTHREAD );\n#endif\n\n    \/\/ cast to local ptrs\n    p_ix = (long *) g_ix;\n    p_data = (T *) g_data;\n    p_my_data = (T *) g_my_data;\n\n    \/\/ update\n    for ( long k = 0; k < size; k++ )\n      p_my_data[p_ix[k]] += p_data[k];\n\n    \/\/ free local (but remotely allocated) storage\n    upcxx::deallocate( g_ix );\n    upcxx::deallocate( g_data );\n\n  } \/\/ end of update_task\n\n\n  \/**\n   * Implements the binning \/ remote application for a single thread\n   * Not very efficient in terms of space for the moment, in exchange for\n   * simplicity.\n   * \\tparam T Matrix data type (e.g. float)\n   *\/\n  template<typename T>\n  class Bin\n  {\n\n   private:\n\n    bool _init;                           \/\/ whether fields intialized\n    int _remote_tid;                      \/\/ thread id of target\n    upcxx::global_ptr<T> _g_remote_data;  \/\/ global_ptr _local_ to target\n    std::vector<long> _ix;                \/\/ linear indexing for target\n    std::vector<T> _data;                 \/\/ update data for target\n#ifdef ENABLE_PROGRESS_THREAD\n    pthread_mutex_t *_tq_mutex;           \/\/ mutex protecting task-queue ops\n#endif\n\n    inline void\n    clear()\n    {\n      _ix.clear();\n      _data.clear();\n    }\n\n   public:\n\n    \/**\n     * Create an uninitialized Bin object\n     *\/\n    Bin() :\n      _init(false)\n    {}\n\n#ifdef ENABLE_PROGRESS_THREAD\n    \/**\n     * Create the Bin object associated with a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     * \\param tq_mutex pthread mutex protecting the task queue and associated\n     * GASNet operations\n     *\/\n    Bin( upcxx::global_ptr<T> g_remote_data, pthread_mutex_t * tq_mutex ) :\n      _init(true),\n      _remote_tid(g_remote_data.where()),\n      _g_remote_data(g_remote_data),\n      _tq_mutex(tq_mutex)\n    {}\n\n    \/**\n     * Initialize the previously empty Bin object for a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     * \\param tq_mutex pthread mutex protecting the task queue and associated\n     * GASNet operations\n     *\n     * \\b Note: It is erroneous to call this on a previously initialized Bin.\n     *\/\n    inline void\n    init( upcxx::global_ptr<T> g_remote_data, pthread_mutex_t * tq_mutex )\n    {\n      assert( ! _init );\n      _remote_tid = g_remote_data.where();\n      _g_remote_data = g_remote_data;\n      _tq_mutex = tq_mutex;\n      _init = true;\n    }\n#else\n    \/**\n     * Create the Bin object associated with a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     *\/\n    Bin( upcxx::global_ptr<T> g_remote_data ) :\n      _init(true),\n      _remote_tid(g_remote_data.where()),\n      _g_remote_data(g_remote_data)\n    {}\n\n    \/**\n     * Initialize the previously empty Bin object for a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     *\n     * \\b Note: It is erroneous to call this on a previously initialized Bin.\n     *\/\n    inline void\n    init( upcxx::global_ptr<T> g_remote_data )\n    {\n      assert( ! _init );\n      _remote_tid = g_remote_data.where();\n      _g_remote_data = g_remote_data;\n      _init = true;\n    }\n#endif\n\n    \/**\n     * Current size of the bin (number of update elems not yet applied)\n     *\/\n    inline long\n    size() const\n    {\n      return _ix.size();\n    }\n\n    \/**\n     * Add an elemental update to this bin\n     * \\param data Elemental update (r.h.s. of +=)\n     * \\param ij Linear index (on the target) of element to be updated\n     *\/\n    inline void\n    append( T data, long ij )\n    {\n      _ix.push_back( ij );\n      _data.push_back( data );\n    }\n\n    \/**\n     * \"Flush\" this bin by initiate remote async update using the current bin\n     * contents.\n     * \\param e upcxx::event pointer to which the async task will be registered\n     *\/\n    void\n    flush( upcxx::event *e )\n    {\n#ifndef NOCHECK\n      assert( _init );\n#endif\n\n      \/\/ global ptrs to local storage for async remote copy\n      upcxx::global_ptr<long> g_ix;\n      upcxx::global_ptr<T> g_data;\n\n#ifdef ENABLE_PROGRESS_THREAD\n      pthread_mutex_lock( _tq_mutex );\n#endif\n\n      \/\/ allocate remote storage\n      ALLOC_WRAP( g_ix = upcxx::allocate<long>( _remote_tid, _ix.size() ) );\n#ifdef NOCHECK\n      assert( g_ix.raw_ptr() != NULL );\n#endif\n      ALLOC_WRAP( g_data = upcxx::allocate<T>( _remote_tid, _data.size() ) );\n#ifdef NOCHECK\n      assert( g_data.raw_ptr() != NULL );\n#endif\n\n      \/\/ copy to remote\n      upcxx::copy( (upcxx::global_ptr<long>) _ix.data(), g_ix, _ix.size() );\n      upcxx::copy( (upcxx::global_ptr<T>) _data.data(), g_data, _data.size() );\n\n      \/\/ spawn the remote update (responsible for deallocating g_ix, g_data)\n      upcxx::async( _remote_tid, e )( update_task<T>,\n                                      _data.size(),\n                                      _g_remote_data,\n                                      g_ix, g_data );\n\n#ifdef ENABLE_PROGRESS_THREAD\n      pthread_mutex_unlock( _tq_mutex );\n#endif\n\n      \/\/ clear internal (vector) storage\n      clear();\n    }\n\n  }; \/\/ end of Bin\n\n  \/\/\/ @endcond\n\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 2015 Cloudius Systems\n *\n * Modified by Cloudius Systems\n *\/\n\n#ifndef CQL3_TERM_HH\n#define CQL3_TERM_HH\n\n#include <memory>\n\nnamespace cql3 {\n\nclass terminal;\n\nclass term;\n\n\/**\n * A CQL3 term, i.e. a column value with or without bind variables.\n *\n * A Term can be either terminal or non terminal. A term object is one that is typed and is obtained\n * from a raw term (Term.Raw) by poviding the actual receiver to which the term is supposed to be a\n * value of.\n *\/\nclass term {\npublic:\n    \/**\n     * Collects the column specification for the bind variables in this Term.\n     * This is obviously a no-op if the term is Terminal.\n     *\n     * @param boundNames the variables specification where to collect the\n     * bind variables of this term in.\n     *\/\n    virtual void collect_marker_specification(std::shared_ptr<variable_specifications> bound_names) = 0;\n\n    \/**\n     * Bind the values in this term to the values contained in {@code values}.\n     * This is obviously a no-op if the term is Terminal.\n     *\n     * @param options the values to bind markers to.\n     * @return the result of binding all the variables of this NonTerminal (or\n     * 'this' if the term is terminal).\n     *\/\n    virtual std::shared_ptr<terminal> bind(std::shared_ptr<terminal> term, const query_options& options) = 0;\n\n    \/**\n     * A shorter for bind(values).get().\n     * We expose it mainly because for constants it can avoids allocating a temporary\n     * object between the bind and the get (note that we still want to be able\n     * to separate bind and get for collections).\n     *\/\n    virtual bytes bind_and_get(std::shared_ptr<terminal> term, const query_options& options) = 0;\n\n    \/**\n     * Whether or not that term contains at least one bind marker.\n     *\n     * Note that this is slightly different from being or not a NonTerminal,\n     * because calls to non pure functions will be NonTerminal (see #5616)\n     * even if they don't have bind markers.\n     *\/\n    virtual bool contains_bind_marker() = 0;\n\n    virtual bool uses_function(sstring ks_name, sstring function_name) const = 0;\n\n    \/**\n     * A parsed, non prepared (thus untyped) term.\n     *\n     * This can be one of:\n     *   - a constant\n     *   - a collection literal\n     *   - a function call\n     *   - a marker\n     *\/\n    class raw : public virtual assignment_testable {\n    public:\n        \/**\n         * This method validates this RawTerm is valid for provided column\n         * specification and \"prepare\" this RawTerm, returning the resulting\n         * prepared Term.\n         *\n         * @param receiver the \"column\" this RawTerm is supposed to be a value of. Note\n         * that the ColumnSpecification may not correspond to a real column in the\n         * case this RawTerm describe a list index or a map key, etc...\n         * @return the prepared term.\n         *\/\n        virtual std::unique_ptr<term> prepare(sstring keyspace, const column_specification& receiver) = 0;\n    };\n\n    class multi_column_raw : public virtual raw {\n    public:\n        virtual std::unique_ptr<term> prepare(sstring keyspace, const std::vector<column_specification>& receiver) = 0;\n    };\n};\n\n    \/**\n     * A terminal term, one that can be reduced to a byte buffer directly.\n     *\n     * This includes most terms that don't have a bind marker (an exception\n     * being delayed call for non pure function that are NonTerminal even\n     * if they don't have bind markers).\n     *\n     * This can be only one of:\n     *   - a constant value\n     *   - a collection value\n     *\n     * Note that a terminal term will always have been type checked, and thus\n     * consumer can (and should) assume so.\n     *\/\n    class terminal : public virtual term {\n    public:\n        virtual void collect_marker_specification(std::shared_ptr<variable_specifications> bound_names) {\n        }\n\n        virtual std::shared_ptr<terminal> bind(std::shared_ptr<terminal> term, const query_options& options) override {\n            return std::move(term);\n        }\n\n        virtual bool uses_function(sstring ks_name, sstring function_name) const override {\n            return false;\n        }\n\n        \/\/ While some NonTerminal may not have bind markers, no Term can be Terminal\n        \/\/ with a bind marker\n        virtual bool contains_bind_marker() const {\n            return false;\n        }\n\n        \/**\n         * @return the serialized value of this terminal.\n         *\/\n        virtual bytes get(std::shared_ptr<terminal> term, const query_options& options) = 0;\n\n        virtual bytes bind_and_get(std::shared_ptr<terminal> term, const query_options& options) override {\n            return get(term, options);\n        }\n    };\n\n    class multi_item_terminal : public terminal {\n    public:\n        virtual std::vector<bytes> get_elements() = 0;\n    };\n\n    class collection_terminal {\n    public:\n        \/** Gets the value of the collection when serialized with the given protocol version format *\/\n        virtual bytes get_with_protocol_version(int protocol_version) = 0;\n    };\n\n    \/**\n     * A non terminal term, i.e. a term that can only be reduce to a byte buffer\n     * at execution time.\n     *\n     * We have the following type of NonTerminal:\n     *   - marker for a constant value\n     *   - marker for a collection value (list, set, map)\n     *   - a function having bind marker\n     *   - a non pure function (even if it doesn't have bind marker - see #5616)\n     *\/\n    class non_terminal : public virtual term {\n    public:\n        virtual bool uses_function(sstring ks_name, sstring function_name) const override {\n            return false;\n        }\n\n        virtual bytes bind_and_get(std::shared_ptr<terminal> term, const query_options& options) override{\n            auto t = bind(term, options);\n            return t == nullptr ? nullptr : t->get(term, options);\n        }\n    };\n}\n\n#endif\n<commit_msg>cql3: Fix term::bind() type signature<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_TERM_HH\n#define CQL3_TERM_HH\n\n#include <memory>\n\nnamespace cql3 {\n\nclass terminal;\n\nclass term;\n\n\/**\n * A CQL3 term, i.e. a column value with or without bind variables.\n *\n * A Term can be either terminal or non terminal. A term object is one that is typed and is obtained\n * from a raw term (Term.Raw) by poviding the actual receiver to which the term is supposed to be a\n * value of.\n *\/\nclass term {\npublic:\n    \/**\n     * Collects the column specification for the bind variables in this Term.\n     * This is obviously a no-op if the term is Terminal.\n     *\n     * @param boundNames the variables specification where to collect the\n     * bind variables of this term in.\n     *\/\n    virtual void collect_marker_specification(std::shared_ptr<variable_specifications> bound_names) = 0;\n\n    \/**\n     * Bind the values in this term to the values contained in {@code values}.\n     * This is obviously a no-op if the term is Terminal.\n     *\n     * @param options the values to bind markers to.\n     * @return the result of binding all the variables of this NonTerminal (or\n     * 'this' if the term is terminal).\n     *\/\n    virtual std::shared_ptr<terminal> bind(std::shared_ptr<term> term, const query_options& options) = 0;\n\n    \/**\n     * A shorter for bind(values).get().\n     * We expose it mainly because for constants it can avoids allocating a temporary\n     * object between the bind and the get (note that we still want to be able\n     * to separate bind and get for collections).\n     *\/\n    virtual bytes bind_and_get(std::shared_ptr<term> term, const query_options& options) = 0;\n\n    \/**\n     * Whether or not that term contains at least one bind marker.\n     *\n     * Note that this is slightly different from being or not a NonTerminal,\n     * because calls to non pure functions will be NonTerminal (see #5616)\n     * even if they don't have bind markers.\n     *\/\n    virtual bool contains_bind_marker() = 0;\n\n    virtual bool uses_function(sstring ks_name, sstring function_name) const = 0;\n\n    \/**\n     * A parsed, non prepared (thus untyped) term.\n     *\n     * This can be one of:\n     *   - a constant\n     *   - a collection literal\n     *   - a function call\n     *   - a marker\n     *\/\n    class raw : public virtual assignment_testable {\n    public:\n        \/**\n         * This method validates this RawTerm is valid for provided column\n         * specification and \"prepare\" this RawTerm, returning the resulting\n         * prepared Term.\n         *\n         * @param receiver the \"column\" this RawTerm is supposed to be a value of. Note\n         * that the ColumnSpecification may not correspond to a real column in the\n         * case this RawTerm describe a list index or a map key, etc...\n         * @return the prepared term.\n         *\/\n        virtual std::unique_ptr<term> prepare(sstring keyspace, const column_specification& receiver) = 0;\n    };\n\n    class multi_column_raw : public virtual raw {\n    public:\n        virtual std::unique_ptr<term> prepare(sstring keyspace, const std::vector<column_specification>& receiver) = 0;\n    };\n};\n\n    \/**\n     * A terminal term, one that can be reduced to a byte buffer directly.\n     *\n     * This includes most terms that don't have a bind marker (an exception\n     * being delayed call for non pure function that are NonTerminal even\n     * if they don't have bind markers).\n     *\n     * This can be only one of:\n     *   - a constant value\n     *   - a collection value\n     *\n     * Note that a terminal term will always have been type checked, and thus\n     * consumer can (and should) assume so.\n     *\/\n    class terminal : public term {\n    public:\n        virtual void collect_marker_specification(std::shared_ptr<variable_specifications> bound_names) {\n        }\n\n        virtual std::shared_ptr<terminal> bind(std::shared_ptr<term> term, const query_options& options) override {\n            return std::static_pointer_cast<terminal>(term);\n        }\n\n        virtual bool uses_function(sstring ks_name, sstring function_name) const override {\n            return false;\n        }\n\n        \/\/ While some NonTerminal may not have bind markers, no Term can be Terminal\n        \/\/ with a bind marker\n        virtual bool contains_bind_marker() const {\n            return false;\n        }\n\n        \/**\n         * @return the serialized value of this terminal.\n         *\/\n        virtual bytes get(std::shared_ptr<term> term, const query_options& options) = 0;\n\n        virtual bytes bind_and_get(std::shared_ptr<term> term, const query_options& options) override {\n            return get(term, options);\n        }\n    };\n\n    class multi_item_terminal : public terminal {\n    public:\n        virtual std::vector<bytes> get_elements() = 0;\n    };\n\n    class collection_terminal {\n    public:\n        \/** Gets the value of the collection when serialized with the given protocol version format *\/\n        virtual bytes get_with_protocol_version(int protocol_version) = 0;\n    };\n\n    \/**\n     * A non terminal term, i.e. a term that can only be reduce to a byte buffer\n     * at execution time.\n     *\n     * We have the following type of NonTerminal:\n     *   - marker for a constant value\n     *   - marker for a collection value (list, set, map)\n     *   - a function having bind marker\n     *   - a non pure function (even if it doesn't have bind marker - see #5616)\n     *\/\n    class non_terminal : public virtual term {\n    public:\n        virtual bool uses_function(sstring ks_name, sstring function_name) const override {\n            return false;\n        }\n\n        virtual bytes bind_and_get(std::shared_ptr<term> term, const query_options& options) override {\n            auto t = bind(term, options);\n            return t == nullptr ? nullptr : t->get(term, options);\n        }\n    };\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/\/ only included in case there's a C++11 compiler out there that doesn't support `#pragma once`\n#ifndef DKM_KMEANS_H\n#define DKM_KMEANS_H\n\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <cstddef>\n#include <cstdint>\n#include <random>\n#include <tuple>\n#include <type_traits>\n#include <vector>\n\n\/*\nDKM - A k-means implementation that is generic across variable data dimensions.\n*\/\nnamespace dkm {\n\n\/*\nThese functions are all private implementation details and shouldn't be referenced outside of this\nfile.\n*\/\nnamespace details {\n\n\/*\nCalculate the square of the distance between two points.\n*\/\ntemplate <typename T, size_t N>\nT distance_squared(const std::array<T, N>& point_a, const std::array<T, N>& point_b) {\n\tT d_squared = T();\n\tfor (typename std::array<T, N>::size_type i = 0; i < N; ++i) {\n\t\tauto delta = point_a[i] - point_b[i];\n\t\td_squared += delta * delta;\n\t}\n\treturn d_squared;\n}\n\ntemplate <typename T, size_t N>\nT distance(const std::array<T, N>& point_a, const std::array<T, N>& point_b) {\n\treturn std::sqrt(distance_squared(point_a, point_b));\n}\n\n\/*\nCalculate the smallest distance between each of the data points and any of the input means.\n*\/\ntemplate <typename T, size_t N>\nstd::vector<T> closest_distance(\n\tconst std::vector<std::array<T, N>>& means, const std::vector<std::array<T, N>>& data) {\n\tstd::vector<T> distances;\n\tdistances.reserve(data.size());\n\tfor (auto& d : data) {\n\t\tT closest = distance_squared(d, means[0]);\n\t\tfor (auto& m : means) {\n\t\t\tT distance = distance_squared(d, m);\n\t\t\tif (distance < closest)\n\t\t\t\tclosest = distance;\n\t\t}\n\t\tdistances.push_back(closest);\n\t}\n\treturn distances;\n}\n\n\/*\nThis is an alternate initialization method based on the [kmeans++](https:\/\/en.wikipedia.org\/wiki\/K-means%2B%2B)\ninitialization algorithm.\n*\/\ntemplate <typename T, size_t N>\nstd::vector<std::array<T, N>> random_plusplus(const std::vector<std::array<T, N>>& data, uint32_t k) {\n\tassert(k > 0);\n\tassert(data.size() > 0);\n\tusing input_size_t = typename std::array<T, N>::size_type;\n\tstd::vector<std::array<T, N>> means;\n\t\/\/ Using a very simple PRBS generator, parameters selected according to\n\t\/\/ https:\/\/en.wikipedia.org\/wiki\/Linear_congruential_generator#Parameters_in_common_use\n\tstd::random_device rand_device;\n\tstd::linear_congruential_engine<uint64_t, 6364136223846793005, 1442695040888963407, UINT64_MAX> rand_engine(\n\t\trand_device());\n\n\t\/\/ Select first mean at random from the set\n\t{\n\t\tstd::uniform_int_distribution<input_size_t> uniform_generator(0, data.size() - 1);\n\t\tmeans.push_back(data[uniform_generator(rand_engine)]);\n\t}\n\n\tfor (uint32_t count = 1; count < k; ++count) {\n\t\t\/\/ Calculate the distance to the closest mean for each data point\n\t\tauto distances = details::closest_distance(means, data);\n\t\t\/\/ Pick a random point weighted by the distance from existing means\n\t\t\/\/ TODO: This might convert floating point weights to ints, distorting the distribution for small weights\n#if !defined(_MSC_VER) || _MSC_VER >= 1900\n\t\tstd::discrete_distribution<input_size_t> generator(distances.begin(), distances.end());\n#else  \/\/ MSVC++ older than 14.0\n\t\tinput_size_t i = 0;\n\t\tstd::discrete_distribution<input_size_t> generator(distances.size(), 0.0, 0.0, [&distances, &i](double) { return distances[i++]; });\n#endif\n\t\tmeans.push_back(data[generator(rand_engine)]);\n\t}\n\treturn means;\n}\n\n\/*\nCalculate the index of the mean a particular data point is closest to (euclidean distance)\n*\/\ntemplate <typename T, size_t N>\nuint32_t closest_mean(const std::array<T, N>& point, const std::vector<std::array<T, N>>& means) {\n\tassert(!means.empty());\n\tT smallest_distance = distance_squared(point, means[0]);\n\ttypename std::array<T, N>::size_type index = 0;\n\tT distance;\n\tfor (size_t i = 1; i < means.size(); ++i) {\n\t\tdistance = distance_squared(point, means[i]);\n\t\tif (distance < smallest_distance) {\n\t\t\tsmallest_distance = distance;\n\t\t\tindex = i;\n\t\t}\n\t}\n\treturn index;\n}\n\n\/*\nCalculate the index of the mean each data point is closest to (euclidean distance).\n*\/\ntemplate <typename T, size_t N>\nstd::vector<uint32_t> calculate_clusters(\n\tconst std::vector<std::array<T, N>>& data, const std::vector<std::array<T, N>>& means) {\n\tstd::vector<uint32_t> clusters;\n\tfor (auto& point : data) {\n\t\tclusters.push_back(closest_mean(point, means));\n\t}\n\treturn clusters;\n}\n\n\/*\nCalculate means based on data points and their cluster assignments.\n*\/\ntemplate <typename T, size_t N>\nstd::vector<std::array<T, N>> calculate_means(const std::vector<std::array<T, N>>& data,\n\tconst std::vector<uint32_t>& clusters,\n\tconst std::vector<std::array<T, N>>& old_means,\n\tuint32_t k) {\n\tstd::vector<std::array<T, N>> means(k);\n\tstd::vector<T> count(k, T());\n\tfor (size_t i = 0; i < std::min(clusters.size(), data.size()); ++i) {\n\t\tauto& mean = means[clusters[i]];\n\t\tcount[clusters[i]] += 1;\n\t\tfor (size_t j = 0; j < std::min(data[i].size(), mean.size()); ++j) {\n\t\t\tmean[j] += data[i][j];\n\t\t}\n\t}\n\tfor (size_t i = 0; i < k; ++i) {\n\t\tif (count[i] == 0) {\n\t\t\tmeans[i] = old_means[i];\n\t\t} else {\n\t\t\tfor (size_t j = 0; j < means[i].size(); ++j) {\n\t\t\t\tmeans[i][j] \/= count[i];\n\t\t\t}\n\t\t}\n\t}\n\treturn means;\n}\n\ntemplate <typename T, size_t N>\nstd::vector<T> deltas(\n\tconst std::vector<std::array<T, N>>& old_means, const std::vector<std::array<T, N>>& means)\n{\n\tstd::vector<T> distances;\n\tdistances.reserve(means.size());\n\tassert(old_means.size() == means.size());\n\tfor (size_t i = 0; i < means.size(); ++i) {\n\t\tdistances.push_back(distance(means[i], old_means[i]));\n\t}\n\treturn distances;\n}\n\ntemplate <typename T>\nbool deltas_below_limit(const std::vector<T>& deltas, T min_delta) {\n\tfor (T d : deltas) {\n\t\tif (d > min_delta) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n} \/\/ namespace details\n\n\/*\nclustering_parameters is the configuration used for running the kmeans_lloyd algorithm.\n\nIt requires a k value for initialization, and can subsequently be configured with your choice\nof optional parameters, including:\n* Maximum iteration count; the algorithm will terminate if it reaches this iteration count\n  before converging on a solution. The results returned are the means and cluster assignments \n  calculated in the last iteration before termination.\n* Minimum delta; the algorithm will terminate if the change in position of all means is\n  smaller than the specified distance.\n* Random seed; if present, this will be used in place of `std::random_device` for kmeans++\n  initialization. This can be used to ensure reproducible\/deterministic behavior.\n*\/\ntemplate <typename T>\nclass clustering_parameters {\npublic:\n\texplicit clustering_parameters(uint32_t k) :\n\t_k(k),\n\t_has_max_iter(false), _max_iter(),\n\t_has_min_delta(false), _min_delta(),\n\t_has_rand_seed(false), _rand_seed()\n\t{}\n\n\tvoid set_max_iteration(uint64_t max_iter)\n\t{\n\t\t_max_iter = max_iter;\n\t\t_has_max_iter = true;\n\t}\n\n\tvoid set_min_delta(T min_delta)\n\t{\n\t\t_min_delta = min_delta;\n\t\t_has_min_delta = true;\n\t}\n\n\tvoid set_random_seed(uint64_t rand_seed)\n\t{\n\t\t_rand_seed = rand_seed;\n\t\t_has_rand_seed = true;\n\t}\n\n\tbool has_max_iteration() const { return _has_max_iter; }\n\tbool has_min_delta() const { return _has_min_delta; }\n\tbool has_random_seed() const { return _has_rand_seed; }\n\n\tuint32_t get_k() const { return _k; };\n\tuint64_t get_max_iteration() const { return _max_iter; }\n\tT get_min_delta() const { return _min_delta; }\n\tuint64_t get_random_seed() const { return _has_rand_seed; }\n\nprivate:\n\tuint32_t _k;\n\tbool _has_max_iter;\n\tuint64_t _max_iter;\n\tbool _has_min_delta;\n\tT _min_delta;\n\tbool _has_rand_seed;\n\tuint64_t _rand_seed;\n};\n\n\/*\nImplementation of k-means generic across the data type and the dimension of each data item. Expects\nthe data to be a vector of fixed-size arrays. Generic parameters are the type of the base data (T)\nand the dimensionality of each data point (N). All points must have the same dimensionality.\n\ne.g. points of the form (X, Y, Z) would be N = 3.\n\nTakes a `clustering_parameters` struct for algorithm configuration. See the comments for the\n`clustering_parameters` struct for more information about the configuration values and how they\naffect the algorithm.\n\nReturns a std::tuple containing:\n  0: A vector holding the means for each cluster from 0 to k-1.\n  1: A vector containing the cluster number (0 to k-1) for each corresponding element of the input\n\t data vector.\n\nImplementation details:\nThis implementation of k-means uses [Lloyd's Algorithm](https:\/\/en.wikipedia.org\/wiki\/Lloyd%27s_algorithm)\nwith the [kmeans++](https:\/\/en.wikipedia.org\/wiki\/K-means%2B%2B)\nused for initializing the means.\n\nTODO: Need to implement clustering_parameters support in parallel implementation.\n*\/\ntemplate <typename T, size_t N>\nstd::tuple<std::vector<std::array<T, N>>, std::vector<uint32_t>> kmeans_lloyd(\n\tconst std::vector<std::array<T, N>>& data, const clustering_parameters<T>& parameters) {\n\tstatic_assert(std::is_arithmetic<T>::value && std::is_signed<T>::value,\n\t\t\"kmeans_lloyd requires the template parameter T to be a signed arithmetic type (e.g. float, double, int)\");\n\tassert(parameters.get_k() > 0); \/\/ k must be greater than zero\n\tassert(data.size() >= parameters.get_k()); \/\/ there must be at least k data points\n\tstd::vector<std::array<T, N>> means = details::random_plusplus(data, parameters.get_k());\n\n\tstd::vector<std::array<T, N>> old_means;\n\tstd::vector<std::array<T, N>> old_old_means;\n\tstd::vector<uint32_t> clusters;\n\t\/\/ Calculate new means until convergence is reached or we hit the maximum iteration count\n\tuint64_t count = 0;\n\tdo {\n\t\tclusters = details::calculate_clusters(data, means);\n\t\told_old_means = old_means;\n\t\told_means = means;\n\t\tmeans = details::calculate_means(data, clusters, old_means, parameters.get_k());\n\t\t++count;\n\t} while ((means != old_means && means != old_old_means)\n\t\t|| (parameters.has_max_iteration() && count == parameters.get_max_iteration())\n\t\t|| (parameters.has_min_delta() && !details::deltas_below_limit(details::deltas(old_means, means), parameters.get_min_delta())));\n\n\treturn std::tuple<std::vector<std::array<T, N>>, std::vector<uint32_t>>(means, clusters);\n}\n\n\/*\nThis overload exists to support legacy code which uses this signature of the kmeans_lloyd function.\nAny code still using this signature should move to the version of this function that uses a\n`clustering_parameters` struct for configuration.\n*\/\ntemplate <typename T, size_t N>\nstd::tuple<std::vector<std::array<T, N>>, std::vector<uint32_t>> kmeans_lloyd(\n\tconst std::vector<std::array<T, N>>& data, uint32_t k,\n\tuint64_t max_iter = 0, T min_delta = -1.0) {\n\tclustering_parameters<T> parameters(k);\n\tif (max_iter != 0) {\n\t\tparameters.set_max_iteration(max_iter);\n\t}\n\tif (min_delta != 0) {\n\t\tparameters.set_min_delta(min_delta);\n\t}\n\tkmeans_lloyd(data, parameters);\n}\n\n} \/\/ namespace dkm\n\n#endif \/* DKM_KMEANS_H *\/\n<commit_msg>Removed TODO.<commit_after>#pragma once\n\n\/\/ only included in case there's a C++11 compiler out there that doesn't support `#pragma once`\n#ifndef DKM_KMEANS_H\n#define DKM_KMEANS_H\n\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <cstddef>\n#include <cstdint>\n#include <random>\n#include <tuple>\n#include <type_traits>\n#include <vector>\n\n\/*\nDKM - A k-means implementation that is generic across variable data dimensions.\n*\/\nnamespace dkm {\n\n\/*\nThese functions are all private implementation details and shouldn't be referenced outside of this\nfile.\n*\/\nnamespace details {\n\n\/*\nCalculate the square of the distance between two points.\n*\/\ntemplate <typename T, size_t N>\nT distance_squared(const std::array<T, N>& point_a, const std::array<T, N>& point_b) {\n\tT d_squared = T();\n\tfor (typename std::array<T, N>::size_type i = 0; i < N; ++i) {\n\t\tauto delta = point_a[i] - point_b[i];\n\t\td_squared += delta * delta;\n\t}\n\treturn d_squared;\n}\n\ntemplate <typename T, size_t N>\nT distance(const std::array<T, N>& point_a, const std::array<T, N>& point_b) {\n\treturn std::sqrt(distance_squared(point_a, point_b));\n}\n\n\/*\nCalculate the smallest distance between each of the data points and any of the input means.\n*\/\ntemplate <typename T, size_t N>\nstd::vector<T> closest_distance(\n\tconst std::vector<std::array<T, N>>& means, const std::vector<std::array<T, N>>& data) {\n\tstd::vector<T> distances;\n\tdistances.reserve(data.size());\n\tfor (auto& d : data) {\n\t\tT closest = distance_squared(d, means[0]);\n\t\tfor (auto& m : means) {\n\t\t\tT distance = distance_squared(d, m);\n\t\t\tif (distance < closest)\n\t\t\t\tclosest = distance;\n\t\t}\n\t\tdistances.push_back(closest);\n\t}\n\treturn distances;\n}\n\n\/*\nThis is an alternate initialization method based on the [kmeans++](https:\/\/en.wikipedia.org\/wiki\/K-means%2B%2B)\ninitialization algorithm.\n*\/\ntemplate <typename T, size_t N>\nstd::vector<std::array<T, N>> random_plusplus(const std::vector<std::array<T, N>>& data, uint32_t k) {\n\tassert(k > 0);\n\tassert(data.size() > 0);\n\tusing input_size_t = typename std::array<T, N>::size_type;\n\tstd::vector<std::array<T, N>> means;\n\t\/\/ Using a very simple PRBS generator, parameters selected according to\n\t\/\/ https:\/\/en.wikipedia.org\/wiki\/Linear_congruential_generator#Parameters_in_common_use\n\tstd::random_device rand_device;\n\tstd::linear_congruential_engine<uint64_t, 6364136223846793005, 1442695040888963407, UINT64_MAX> rand_engine(\n\t\trand_device());\n\n\t\/\/ Select first mean at random from the set\n\t{\n\t\tstd::uniform_int_distribution<input_size_t> uniform_generator(0, data.size() - 1);\n\t\tmeans.push_back(data[uniform_generator(rand_engine)]);\n\t}\n\n\tfor (uint32_t count = 1; count < k; ++count) {\n\t\t\/\/ Calculate the distance to the closest mean for each data point\n\t\tauto distances = details::closest_distance(means, data);\n\t\t\/\/ Pick a random point weighted by the distance from existing means\n\t\t\/\/ TODO: This might convert floating point weights to ints, distorting the distribution for small weights\n#if !defined(_MSC_VER) || _MSC_VER >= 1900\n\t\tstd::discrete_distribution<input_size_t> generator(distances.begin(), distances.end());\n#else  \/\/ MSVC++ older than 14.0\n\t\tinput_size_t i = 0;\n\t\tstd::discrete_distribution<input_size_t> generator(distances.size(), 0.0, 0.0, [&distances, &i](double) { return distances[i++]; });\n#endif\n\t\tmeans.push_back(data[generator(rand_engine)]);\n\t}\n\treturn means;\n}\n\n\/*\nCalculate the index of the mean a particular data point is closest to (euclidean distance)\n*\/\ntemplate <typename T, size_t N>\nuint32_t closest_mean(const std::array<T, N>& point, const std::vector<std::array<T, N>>& means) {\n\tassert(!means.empty());\n\tT smallest_distance = distance_squared(point, means[0]);\n\ttypename std::array<T, N>::size_type index = 0;\n\tT distance;\n\tfor (size_t i = 1; i < means.size(); ++i) {\n\t\tdistance = distance_squared(point, means[i]);\n\t\tif (distance < smallest_distance) {\n\t\t\tsmallest_distance = distance;\n\t\t\tindex = i;\n\t\t}\n\t}\n\treturn index;\n}\n\n\/*\nCalculate the index of the mean each data point is closest to (euclidean distance).\n*\/\ntemplate <typename T, size_t N>\nstd::vector<uint32_t> calculate_clusters(\n\tconst std::vector<std::array<T, N>>& data, const std::vector<std::array<T, N>>& means) {\n\tstd::vector<uint32_t> clusters;\n\tfor (auto& point : data) {\n\t\tclusters.push_back(closest_mean(point, means));\n\t}\n\treturn clusters;\n}\n\n\/*\nCalculate means based on data points and their cluster assignments.\n*\/\ntemplate <typename T, size_t N>\nstd::vector<std::array<T, N>> calculate_means(const std::vector<std::array<T, N>>& data,\n\tconst std::vector<uint32_t>& clusters,\n\tconst std::vector<std::array<T, N>>& old_means,\n\tuint32_t k) {\n\tstd::vector<std::array<T, N>> means(k);\n\tstd::vector<T> count(k, T());\n\tfor (size_t i = 0; i < std::min(clusters.size(), data.size()); ++i) {\n\t\tauto& mean = means[clusters[i]];\n\t\tcount[clusters[i]] += 1;\n\t\tfor (size_t j = 0; j < std::min(data[i].size(), mean.size()); ++j) {\n\t\t\tmean[j] += data[i][j];\n\t\t}\n\t}\n\tfor (size_t i = 0; i < k; ++i) {\n\t\tif (count[i] == 0) {\n\t\t\tmeans[i] = old_means[i];\n\t\t} else {\n\t\t\tfor (size_t j = 0; j < means[i].size(); ++j) {\n\t\t\t\tmeans[i][j] \/= count[i];\n\t\t\t}\n\t\t}\n\t}\n\treturn means;\n}\n\ntemplate <typename T, size_t N>\nstd::vector<T> deltas(\n\tconst std::vector<std::array<T, N>>& old_means, const std::vector<std::array<T, N>>& means)\n{\n\tstd::vector<T> distances;\n\tdistances.reserve(means.size());\n\tassert(old_means.size() == means.size());\n\tfor (size_t i = 0; i < means.size(); ++i) {\n\t\tdistances.push_back(distance(means[i], old_means[i]));\n\t}\n\treturn distances;\n}\n\ntemplate <typename T>\nbool deltas_below_limit(const std::vector<T>& deltas, T min_delta) {\n\tfor (T d : deltas) {\n\t\tif (d > min_delta) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n} \/\/ namespace details\n\n\/*\nclustering_parameters is the configuration used for running the kmeans_lloyd algorithm.\n\nIt requires a k value for initialization, and can subsequently be configured with your choice\nof optional parameters, including:\n* Maximum iteration count; the algorithm will terminate if it reaches this iteration count\n  before converging on a solution. The results returned are the means and cluster assignments \n  calculated in the last iteration before termination.\n* Minimum delta; the algorithm will terminate if the change in position of all means is\n  smaller than the specified distance.\n* Random seed; if present, this will be used in place of `std::random_device` for kmeans++\n  initialization. This can be used to ensure reproducible\/deterministic behavior.\n*\/\ntemplate <typename T>\nclass clustering_parameters {\npublic:\n\texplicit clustering_parameters(uint32_t k) :\n\t_k(k),\n\t_has_max_iter(false), _max_iter(),\n\t_has_min_delta(false), _min_delta(),\n\t_has_rand_seed(false), _rand_seed()\n\t{}\n\n\tvoid set_max_iteration(uint64_t max_iter)\n\t{\n\t\t_max_iter = max_iter;\n\t\t_has_max_iter = true;\n\t}\n\n\tvoid set_min_delta(T min_delta)\n\t{\n\t\t_min_delta = min_delta;\n\t\t_has_min_delta = true;\n\t}\n\n\tvoid set_random_seed(uint64_t rand_seed)\n\t{\n\t\t_rand_seed = rand_seed;\n\t\t_has_rand_seed = true;\n\t}\n\n\tbool has_max_iteration() const { return _has_max_iter; }\n\tbool has_min_delta() const { return _has_min_delta; }\n\tbool has_random_seed() const { return _has_rand_seed; }\n\n\tuint32_t get_k() const { return _k; };\n\tuint64_t get_max_iteration() const { return _max_iter; }\n\tT get_min_delta() const { return _min_delta; }\n\tuint64_t get_random_seed() const { return _has_rand_seed; }\n\nprivate:\n\tuint32_t _k;\n\tbool _has_max_iter;\n\tuint64_t _max_iter;\n\tbool _has_min_delta;\n\tT _min_delta;\n\tbool _has_rand_seed;\n\tuint64_t _rand_seed;\n};\n\n\/*\nImplementation of k-means generic across the data type and the dimension of each data item. Expects\nthe data to be a vector of fixed-size arrays. Generic parameters are the type of the base data (T)\nand the dimensionality of each data point (N). All points must have the same dimensionality.\n\ne.g. points of the form (X, Y, Z) would be N = 3.\n\nTakes a `clustering_parameters` struct for algorithm configuration. See the comments for the\n`clustering_parameters` struct for more information about the configuration values and how they\naffect the algorithm.\n\nReturns a std::tuple containing:\n  0: A vector holding the means for each cluster from 0 to k-1.\n  1: A vector containing the cluster number (0 to k-1) for each corresponding element of the input\n\t data vector.\n\nImplementation details:\nThis implementation of k-means uses [Lloyd's Algorithm](https:\/\/en.wikipedia.org\/wiki\/Lloyd%27s_algorithm)\nwith the [kmeans++](https:\/\/en.wikipedia.org\/wiki\/K-means%2B%2B)\nused for initializing the means.\n\n*\/\ntemplate <typename T, size_t N>\nstd::tuple<std::vector<std::array<T, N>>, std::vector<uint32_t>> kmeans_lloyd(\n\tconst std::vector<std::array<T, N>>& data, const clustering_parameters<T>& parameters) {\n\tstatic_assert(std::is_arithmetic<T>::value && std::is_signed<T>::value,\n\t\t\"kmeans_lloyd requires the template parameter T to be a signed arithmetic type (e.g. float, double, int)\");\n\tassert(parameters.get_k() > 0); \/\/ k must be greater than zero\n\tassert(data.size() >= parameters.get_k()); \/\/ there must be at least k data points\n\tstd::vector<std::array<T, N>> means = details::random_plusplus(data, parameters.get_k());\n\n\tstd::vector<std::array<T, N>> old_means;\n\tstd::vector<std::array<T, N>> old_old_means;\n\tstd::vector<uint32_t> clusters;\n\t\/\/ Calculate new means until convergence is reached or we hit the maximum iteration count\n\tuint64_t count = 0;\n\tdo {\n\t\tclusters = details::calculate_clusters(data, means);\n\t\told_old_means = old_means;\n\t\told_means = means;\n\t\tmeans = details::calculate_means(data, clusters, old_means, parameters.get_k());\n\t\t++count;\n\t} while ((means != old_means && means != old_old_means)\n\t\t|| (parameters.has_max_iteration() && count == parameters.get_max_iteration())\n\t\t|| (parameters.has_min_delta() && !details::deltas_below_limit(details::deltas(old_means, means), parameters.get_min_delta())));\n\n\treturn std::tuple<std::vector<std::array<T, N>>, std::vector<uint32_t>>(means, clusters);\n}\n\n\/*\nThis overload exists to support legacy code which uses this signature of the kmeans_lloyd function.\nAny code still using this signature should move to the version of this function that uses a\n`clustering_parameters` struct for configuration.\n*\/\ntemplate <typename T, size_t N>\nstd::tuple<std::vector<std::array<T, N>>, std::vector<uint32_t>> kmeans_lloyd(\n\tconst std::vector<std::array<T, N>>& data, uint32_t k,\n\tuint64_t max_iter = 0, T min_delta = -1.0) {\n\tclustering_parameters<T> parameters(k);\n\tif (max_iter != 0) {\n\t\tparameters.set_max_iteration(max_iter);\n\t}\n\tif (min_delta != 0) {\n\t\tparameters.set_min_delta(min_delta);\n\t}\n\tkmeans_lloyd(data, parameters);\n}\n\n} \/\/ namespace dkm\n\n#endif \/* DKM_KMEANS_H *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2015 Relja Ljubobratovic, ljubobratovic.relja@gmail.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\/\/ Description:\n\/\/ Core project header, containing build option preprocessor switches, and\n\/\/ main macros used trough the library code. \n\/\/\n\/\/ Author:\n\/\/ Relja Ljubobratovic, ljubobratovic.relja@gmail.com\n\n#ifndef FWD_HPP_1F9LO7BS\n#define FWD_HPP_1F9LO7BS\n\n\n#if defined(_MSC_VER)\n\/\/  Microsoft Visual Compiler, and DLL compilation\n#define CV_EXPORT __declspec(dllexport)\n#define CV_IMPORT __declspec(dllimport)\n#define CV_PRAGMA(arg) __pragma(arg)\n#define CV_TYPENAME typename\n#define CV_WINDOWS\n#elif defined(__GNUG__) \/\/  GNU Compiler\n#define CV_EXPORT __attribute__((visibility(\"default\")))\n#define CV_PRAGMA(arg) _Pragma(#arg)\n#define CV_IMPORT\n#define CV_TYPENAME typename\n#define CV_LINUX\n#else \/\/ arbitrary compiler, not expected and handled.\n#error Unrecognized compiler\n#define CV_EXPORT\n#define CV_IMPORT\n#define CV_TYPENAME typename\n#define CV_PRAGMA(arg) \n#endif\n\n#define PI (double)3.14159265358979323846264338327950288  \/*!< Pi value. *\/\n#define RAD_TO_DEG(val) (double)( val * (180.0 \/ PI)) \/*!< Convert radians to degrees. *\/\n#define DEG_TO_RAD(val) (double)( val * (PI \/ 180.0)) \/*!< Convert degrees to radians. *\/\n\n#define LOOP_FOR(from,to,by) for(int i=from;i<to;i+=by)\n#define LOOP_FOR_TO(to) LOOP_FOR(0,to,1)\n#define NEST_FOR(from,to,by,from_nest,to_nest,by_nest) for(int i=from;i<to;i+=by) for(int j=from_nest;j<to_nest;j+=by_nest)\n#define NEST_FOR_TO(to,to_nest)  NEST_FOR(0,to,1,0,to_nest,1)\n\n#define OMP_PARALLEL_FOR CV_PRAGMA(omp parallel for) \/\/!< OpenMP parallel for pragma initializer macro.\n#define OMP_INIT CV_PRAGMA(omp parallel) { \/\/!< OpenMP parallel pragma initializer macro.\n#define OMP_END } \/\/!< OpenMP parallel for pragma deinitializer macro.\n#define OMP_FOR CV_PRAGMA(omp for) \/\/!< OpenMP for for pragma initializer macro.\n#define OMP_ATOMIC CV_PRAGMA(omp atomic) \/\/!< Perform OpenMP atomic increment.\n#define OMP_CRITICAL CV_PRAGMA(omp critical) \/\/!< Start OpenMP critical segment.\n#define LOOP_OMP_FOR(cnti) OMP_FOR LOOP_FOR_TO(cnti) \/\/!< OpenMP for pragma initializer with loop macro.\n#define LOOP_PARALLEL_FOR(from,to,by) OMP_PARALLEL_FOR LOOP_FOR(from,to,by) \/\/!< OpenMP parallel for pragma initializer with loop macro.\n#define LOOP_PARALLEL_FOR_TO(cnt) OMP_PARALLEL_FOR LOOP_FOR_TO(cnt) \/\/!< OpenMP parallel for pragma initializer macro.\n#define NEST_PARALLEL_FOR_TO(cnti, cntj) LOOP_PARALLEL_FOR_TO(cnti) for(int j = 0; j < cntj; j++) \/\/!< OpenMP parallel for pragma initializer with nested loop macro.\n#define NEST_OMP_FOR_TO(cnti, cntj) OMP_FOR NEST_FOR_TO(cnti, cntj) \/\/!< OpenMP parallel for pragma initializer with nested loop macro.\n#define FOREACH(iter, cnt) for(auto iter = cnt.begin(); iter != cnt.end(); iter++)\n#define ITERATE(iter, begin, end) for (auto iter = begin; iter != end; iter++)\n\ntypedef unsigned char byte;\ntypedef byte uchar;\ntypedef unsigned int uint;\n\n#ifdef CV_REAL_TYPE_DOUBLE\ntypedef double real_t;\n#else\ntypedef float real_t;\n#endif\n\n#define INTERPRET_INDEX(idx,length) (idx >= 0) ? idx : length + idx\n\nenum parallelization_module {\n\tCV_OPENMP,\n\tCV_TBB,\n\tCV_OCL\n};\n\n#ifndef CV_PARALLELIZATION_MODULE\n#ifdef _OPENMP\n#define CV_PARALLELIZATION_MODULE CV_OPENMP\n#endif\n\n#endif\n\n#ifndef VECTOR_PARALLELIZATION_THRESHOLD\n\n\/*!\n\t\\def VECTOR_PARALLELIZATION_THRESHOLD\n\n\tThis value represents a threshold after which some of algorithms over vectors will be paralellized on the CPU\/GPU.\n\tFor instance, small vectors (e.g. with size less than 1000) will take more time to allocate thread stack space\n\t(or allocating device memory for GPU), than to simply evaluate an algorithm on a single CPU core. For larger\n\tvectors (default value is 100000), parallelization of defined type (default is OpenMP) will be initialized.\n\n\t\\note\n\tThis value is initialized in fwd.hpp header, but will be overriden if preprocessor define with the same\n\tname is defined in compilation setup. (\/DVECTOR_PARALLELIZATION_THRESHOLD=100000)\n\t*\/\n#define VECTOR_PARALLELIZATION_THRESHOLD 100000\n#endif\n\n#ifndef CV_BPQ_INIT_VALUE\n#define CV_BPQ_INIT_VALUE 10e+30\n#endif\n\ntypedef unsigned refcount_type;\n\n#define REF_INCREMENT(ref) if(ref) ++(*ref) \/\/!< Increment reference counter - assumes given value (int*) is initialized.\n#define REF_DECREMENT(ref) if(ref) --(*ref) \/\/!< Decrement reference counter - assumes given value (int*) is initialized.\n#define REF_CHECK(ref) ((*ref) <= 0) ? false : true \/\/!< Check if reference counter is equal to 0 - assumes given value (int*) is initialized.\n#define REF_NEW new refcount_type(1) \/\/!< Instatiate new reference counter.\n#define REF_DESTROY(ref) delete ref \/\/!< Destroy reference counter.\n#define REF_INIT(ref) REF_DESTROY(ref), ref = REF_NEW \/\/!< Initialize reference counter, will first delete existing, then instantiate a new one.\n\n\/*!\n * Runtime assertion check.\n *\/\n#if(defined(NDEBUG) || defined(NO_ASSERT))\n#define ASSERT(cond)  \/\/ empty macro - skip runtime assertion checks in the release mode.\n#else\n#define ASSERT(cond) \\\n    do \\\n\t\t\t    { \\\n        if (!(cond)) \\\n\t\t\t\t\t\t        { \\\n            throw std::runtime_error((\"Assertion check failed at condition: \" #cond \", at line: \") + \\\n\t\t\t\t\tstd::to_string(__LINE__) + (\", in file \" __FILE__)); \\\n\t\t\t\t\t\t        } \\\n\t\t\t\t    } while(0)\n#endif\n\n\/*!\n\t@brief Computer Vision core namespace.\n\n\tContains data structures and basic algorithms used in\n\timage processing and computer vision tasks.\n\n\tUsed as libcv base namespace.\n\t*\/\nnamespace cv {\n\n\/\/! Type of region of interest data.\nenum class RoiType {\n\tREFERENCE,  \/\/!< Referenced data.\n\tCOPY \/\/!< Copy data.\n};\n\n\/\/! Type of region of interest edge menagement.\nenum class RoiEdge {\n\tMIRROR, \/\/!< Mirrored edges.\n\tZEROS \/\/!< Zero edges.\n};\n\n\/\/! Norm type.\nenum class Norm {\n\tMINMAX,  \/\/!< Min-Max norm.\n\tINF,  \/\/!< Infinite norm.\n\tL0,  \/\/!< Zero norm - L0.\n\tL1,  \/\/!< L1 Norm.\n\tL1_SQRT,  \/\/!< L! squared norm.\n\tL2,  \/\/!< Eucledian norm.\n};\n\nenum class InterpolationType  \/\/! Interpolation value_type used by some functions.\n{\n\tNN, \/*!< Nearest neighbour interpolation. *\/\n\tLINEAR, \/*!< Bilinear interpolation. *\/\n\tCUBIC, \/*!< Bicubic interpolation. *\/\n\tNO_INTER  \/\/!< No interpolation used.\n};\n\nenum ColorConvertion {\n\n};\n\nenum class ImageDepth {\n\tANY = 0,\n\tBYTE_8 = 1,\n\tSHORT_16 = 2,\n\tFLOAT_32 = 4, \n\tDOUBLE_64 = 8\n};\n\nenum class ImageFormat {\n\tANY = 0,\n\tGRAY = 1,\n\tRGB = 3,\n\tRGBA = 4\n};\n\n}\n\n#endif \/* end of include guard: FWD_HPP_1F9LO7BS*\/\n<commit_msg>moved index comparator<commit_after>\/\/The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2015 Relja Ljubobratovic, ljubobratovic.relja@gmail.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\/\/ Description:\n\/\/ Core project header, containing build option preprocessor switches, and\n\/\/ main macros used trough the library code. \n\/\/\n\/\/ Author:\n\/\/ Relja Ljubobratovic, ljubobratovic.relja@gmail.com\n\n#ifndef FWD_HPP_1F9LO7BS\n#define FWD_HPP_1F9LO7BS\n\n\n#if defined(_MSC_VER)\n\/\/  Microsoft Visual Compiler, and DLL compilation\n#define CV_EXPORT __declspec(dllexport)\n#define CV_IMPORT __declspec(dllimport)\n#define CV_PRAGMA(arg) __pragma(arg)\n#define CV_TYPENAME typename\n#define CV_WINDOWS\n#elif defined(__GNUG__) \/\/  GNU Compiler\n#define CV_EXPORT __attribute__((visibility(\"default\")))\n#define CV_PRAGMA(arg) _Pragma(#arg)\n#define CV_IMPORT\n#define CV_TYPENAME typename\n#define CV_LINUX\n#else \/\/ arbitrary compiler, not expected and handled.\n#error Unrecognized compiler\n#define CV_EXPORT\n#define CV_IMPORT\n#define CV_TYPENAME typename\n#define CV_PRAGMA(arg) \n#endif\n\n#define PI (double)3.14159265358979323846264338327950288  \/*!< Pi value. *\/\n#define RAD_TO_DEG(val) (double)( val * (180.0 \/ PI)) \/*!< Convert radians to degrees. *\/\n#define DEG_TO_RAD(val) (double)( val * (PI \/ 180.0)) \/*!< Convert degrees to radians. *\/\n\n#define LOOP_FOR(from,to,by) for(int i=from;i<to;i+=by)\n#define LOOP_FOR_TO(to) LOOP_FOR(0,to,1)\n#define NEST_FOR(from,to,by,from_nest,to_nest,by_nest) for(int i=from;i<to;i+=by) for(int j=from_nest;j<to_nest;j+=by_nest)\n#define NEST_FOR_TO(to,to_nest)  NEST_FOR(0,to,1,0,to_nest,1)\n\n#define OMP_PARALLEL_FOR CV_PRAGMA(omp parallel for) \/\/!< OpenMP parallel for pragma initializer macro.\n#define OMP_INIT CV_PRAGMA(omp parallel) { \/\/!< OpenMP parallel pragma initializer macro.\n#define OMP_END } \/\/!< OpenMP parallel for pragma deinitializer macro.\n#define OMP_FOR CV_PRAGMA(omp for) \/\/!< OpenMP for for pragma initializer macro.\n#define OMP_ATOMIC CV_PRAGMA(omp atomic) \/\/!< Perform OpenMP atomic increment.\n#define OMP_CRITICAL CV_PRAGMA(omp critical) \/\/!< Start OpenMP critical segment.\n#define LOOP_OMP_FOR(cnti) OMP_FOR LOOP_FOR_TO(cnti) \/\/!< OpenMP for pragma initializer with loop macro.\n#define LOOP_PARALLEL_FOR(from,to,by) OMP_PARALLEL_FOR LOOP_FOR(from,to,by) \/\/!< OpenMP parallel for pragma initializer with loop macro.\n#define LOOP_PARALLEL_FOR_TO(cnt) OMP_PARALLEL_FOR LOOP_FOR_TO(cnt) \/\/!< OpenMP parallel for pragma initializer macro.\n#define NEST_PARALLEL_FOR_TO(cnti, cntj) LOOP_PARALLEL_FOR_TO(cnti) for(int j = 0; j < cntj; j++) \/\/!< OpenMP parallel for pragma initializer with nested loop macro.\n#define NEST_OMP_FOR_TO(cnti, cntj) OMP_FOR NEST_FOR_TO(cnti, cntj) \/\/!< OpenMP parallel for pragma initializer with nested loop macro.\n#define FOREACH(iter, cnt) for(auto iter = cnt.begin(); iter != cnt.end(); iter++)\n#define ITERATE(iter, begin, end) for (auto iter = begin; iter != end; iter++)\n\ntypedef unsigned char byte;\ntypedef byte uchar;\ntypedef unsigned int uint;\n\n#ifdef CV_REAL_TYPE_DOUBLE\ntypedef double real_t;\n#else\ntypedef float real_t;\n#endif\n\n#define INTERPRET_INDEX(idx,length) (idx >= 0) ? idx : length + idx\n\nenum parallelization_module {\n\tCV_OPENMP,\n\tCV_TBB,\n\tCV_OCL\n};\n\n#ifndef CV_PARALLELIZATION_MODULE\n#ifdef _OPENMP\n#define CV_PARALLELIZATION_MODULE CV_OPENMP\n#endif\n\n#endif\n\n#ifndef VECTOR_PARALLELIZATION_THRESHOLD\n\n\/*!\n\t\\def VECTOR_PARALLELIZATION_THRESHOLD\n\n\tThis value represents a threshold after which some of algorithms over vectors will be paralellized on the CPU\/GPU.\n\tFor instance, small vectors (e.g. with size less than 1000) will take more time to allocate thread stack space\n\t(or allocating device memory for GPU), than to simply evaluate an algorithm on a single CPU core. For larger\n\tvectors (default value is 100000), parallelization of defined type (default is OpenMP) will be initialized.\n\n\t\\note\n\tThis value is initialized in fwd.hpp header, but will be overriden if preprocessor define with the same\n\tname is defined in compilation setup. (\/DVECTOR_PARALLELIZATION_THRESHOLD=100000)\n\t*\/\n#define VECTOR_PARALLELIZATION_THRESHOLD 100000\n#endif\n\n#ifndef CV_BPQ_INIT_VALUE\n#define CV_BPQ_INIT_VALUE 10e+30\n#endif\n\ntypedef unsigned refcount_type;\n\n#define REF_INCREMENT(ref) if(ref) ++(*ref) \/\/!< Increment reference counter - assumes given value (int*) is initialized.\n#define REF_DECREMENT(ref) if(ref) --(*ref) \/\/!< Decrement reference counter - assumes given value (int*) is initialized.\n#define REF_CHECK(ref) ((*ref) <= 0) ? false : true \/\/!< Check if reference counter is equal to 0 - assumes given value (int*) is initialized.\n#define REF_NEW new refcount_type(1) \/\/!< Instatiate new reference counter.\n#define REF_DESTROY(ref) delete ref \/\/!< Destroy reference counter.\n#define REF_INIT(ref) REF_DESTROY(ref), ref = REF_NEW \/\/!< Initialize reference counter, will first delete existing, then instantiate a new one.\n\n\/*!\n * Runtime assertion check.\n *\/\n#if(defined(NDEBUG) || defined(NO_ASSERT))\n#define ASSERT(cond)  \/\/ empty macro - skip runtime assertion checks in the release mode.\n#else\n#define ASSERT(cond) \\\n    do \\\n\t\t\t    { \\\n        if (!(cond)) \\\n\t\t\t\t\t\t        { \\\n            throw std::runtime_error((\"Assertion check failed at condition: \" #cond \", at line: \") + \\\n\t\t\t\t\tstd::to_string(__LINE__) + (\", in file \" __FILE__)); \\\n\t\t\t\t\t\t        } \\\n\t\t\t\t    } while(0)\n#endif\n\n\/*!\n\t@brief Computer Vision core namespace.\n\n\tContains data structures and basic algorithms used in\n\timage processing and computer vision tasks.\n\n\tUsed as libcv base namespace.\n\t*\/\nnamespace cv {\n\n\/\/! Type of region of interest data.\nenum class RoiType {\n\tREFERENCE,  \/\/!< Referenced data.\n\tCOPY \/\/!< Copy data.\n};\n\n\/\/! Type of region of interest edge menagement.\nenum class RoiEdge {\n\tMIRROR, \/\/!< Mirrored edges.\n\tZEROS \/\/!< Zero edges.\n};\n\n\/\/! Norm type.\nenum class Norm {\n\tMINMAX,  \/\/!< Min-Max norm.\n\tINF,  \/\/!< Infinite norm.\n\tL0,  \/\/!< Zero norm - L0.\n\tL1,  \/\/!< L1 Norm.\n\tL1_SQRT,  \/\/!< L! squared norm.\n\tL2,  \/\/!< Eucledian norm.\n};\n\nenum class InterpolationType  \/\/! Interpolation value_type used by some functions.\n{\n\tNN, \/*!< Nearest neighbour interpolation. *\/\n\tLINEAR, \/*!< Bilinear interpolation. *\/\n\tCUBIC, \/*!< Bicubic interpolation. *\/\n\tNO_INTER  \/\/!< No interpolation used.\n};\n\nenum ColorConvertion {\n\n};\n\nenum class ImageDepth {\n\tANY = 0,\n\tBYTE_8 = 1,\n\tSHORT_16 = 2,\n\tFLOAT_32 = 4, \n\tDOUBLE_64 = 8\n};\n\nenum class ImageFormat {\n\tANY = 0,\n\tGRAY = 1,\n\tRGB = 3,\n\tRGBA = 4\n};\n\nnamespace internal {\n\/\/ Index comparator used for comparing arrays by only one axis values.\nstruct idx_cmp {\n\tunsigned index = 0;\n\n\tidx_cmp(unsigned index) : index(index) {}\n\n\ttemplate<typename _ArrayType>\n\tbool operator ()(const _ArrayType &rhs, const _ArrayType &lhs) const {\n\t\treturn (rhs[index] < lhs[index]);\n\t}\n};\n\n}\n}\n\n#endif \/* end of include guard: FWD_HPP_1F9LO7BS*\/\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 <stdlib.h>\n#include <unistd.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-mdb\/MDB.h\"\n#include \"cm-common\/CustomerNamespace.h\"\n#include \"cm-logjoin\/LogJoin.h\"\n\nusing namespace fnord;\n\nstruct FeedChunkInfo {\n  uint64_t generation;\n  uint64_t generation_window;\n  uint64_t start_time;\n  uint64_t end_time;\n  HashMap<String, String> start_offsets;\n\n  template <typename T>\n  static void reflect(T* meta) {\n    meta->prop(&FeedChunkInfo::generation, 1, \"generation\", false);\n    meta->prop(&FeedChunkInfo::generation_window, 2, \"generation_window\", false);\n    meta->prop(&FeedChunkInfo::start_time, 3, \"start_time\", false);\n    meta->prop(&FeedChunkInfo::end_time, 4, \"end_time\", false);\n    meta->prop(&FeedChunkInfo::start_offsets, 5, \"start_offsets\", false);\n  };\n};\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      \"output_path\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output file path\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"output_prefix\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output filename prefix\",\n      \"<prefix>\");\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      \"generation_window_secs\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"14400\",\n      \"generation_window_secs\",\n      \"<secs>\");\n\n  flags.defineFlag(\n      \"generation_delay_secs\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"3600\",\n      \"generation_delay_secs\",\n      \"<secs>\");\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  auto evloop_thread = std::thread([&ev] {\n    ev.run();\n  });\n\n  \/* set up rpc client *\/\n  HTTPRPCClient rpc_client(&ev);\n\n  auto output_path = flags.getString(\"output_path\");\n  auto output_prefix = flags.getString(\"output_prefix\");\n  size_t batch_size = flags.getInt(\"batch_size\");\n  size_t buffer_size = flags.getInt(\"buffer_size\");\n  size_t generation_window_micros =\n      flags.getInt(\"generation_window_secs\") * kMicrosPerSecond;\n  size_t generation_delay_micros =\n      flags.getInt(\"generation_delay_secs\") * kMicrosPerSecond;\n\n  FileUtil::mkdir_p(output_path);\n\n  \/* set up input feed reader *\/\n  feeds::RemoteFeedReader feed_reader(&rpc_client);\n\n  \/* get source urls *\/\n  Vector<String> uris = flags.getArgv();\n  \/\/if (flags.isSet(\"statefile\")) {\n  \/\/  auto statefile = FileUtil::read(flags.getString(\"statefile\")).toString();\n  \/\/  for (const auto& uri : StringUtil::split(statefile, \"\\n\")) {\n  \/\/    if (uri.size() > 0) {\n  \/\/      uris.emplace_back(uri);\n  \/\/    }\n  \/\/  }\n  \/\/}\n\n  HashMap<String, String> feed_urls;\n  for (const auto& uri_raw : uris) {\n    URI uri(uri_raw);\n    const auto& params = uri.queryParams();\n\n    std::string feed;\n    if (!URI::getParam(params, \"feed\", &feed)) {\n      RAISEF(\n          kIllegalArgumentError,\n          \"feed url missing ?feed query param: $0\",\n          uri_raw);\n    }\n\n    feed_urls.emplace(feed, uri_raw.substr(0, uri_raw.find(\"?\")));\n\n    std::string offset_str;\n    uint64_t offset = 0;\n    if (URI::getParam(params, \"offset\", &offset_str)) {\n      if (offset_str == \"HEAD\") {\n        offset = std::numeric_limits<uint64_t>::max();\n      } else {\n        offset = std::stoul(offset_str);\n      }\n    }\n\n    feed_reader.addSourceFeed(\n        uri,\n        feed,\n        offset,\n        batch_size,\n        buffer_size);\n  }\n\n  uint64_t total_rows = 0;\n  uint64_t total_bytes = 0;\n  auto start_time = WallClock::now().unixMicros();\n  auto last_status_line = start_time;\n\n  DateTime last_iter;\n  uint64_t rate_limit_micros = 0.1 * kMicrosPerSecond;\n\n  HashMap<uint64_t, List<feeds::FeedEntry>> generations_;\n  HashMap<uint64_t, HashMap<String, String>> generation_offsets_;\n  uint64_t max_gen_ = 0;\n\n  for (;;) {\n    last_iter = WallClock::now();\n    feed_reader.fillBuffers();\n\n    \/* read feed and build generations *\/\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      ++total_rows;\n      total_bytes += entry.get().data.size();\n\n      auto now = WallClock::now().unixMicros();\n      if (now - last_status_line > 10000) {\n        Set<uint64_t> active_gens;\n        for (const auto& g : generations_) {\n          active_gens.emplace(g.first);\n        }\n\n        auto runtime = (now - start_time) \/ 1000000;\n        uint64_t bandwidth = total_bytes \/ (runtime + 1);\n        auto str = StringUtil::format(\n            \"\\rrows=$0 bytes=$1B time=$2s bw=$3B\/s active_gens=$4\"\n            \"          \",\n            total_rows,\n            total_bytes,\n            runtime,\n            bandwidth,\n            inspect(active_gens));\n\n        write(0, str.c_str(), str.length());\n        fflush(0);\n      }\n\n\n      auto entry_time = entry.get().time.unixMicros();\n      if (entry_time == 0) {\n        continue;\n      }\n\n      uint64_t entry_gen = entry_time \/ generation_window_micros;\n\n      auto iter = generations_.find(entry_gen);\n      if (iter == generations_.end()) {\n        if (max_gen_ >= entry_gen) {\n          fnord::logWarning(\n              \"fnord.feedexport\",\n              \"Dropping late data for  generation #$0\",\n              entry_gen);\n\n          continue;\n        }\n\n        fnord::logDebug(\n            \"fnord.feedexport\",\n            \"Creating new generation #$0\",\n            entry_gen);\n\n        auto stream_offsets = feed_reader.streamOffsets();\n        for (const auto& soff : stream_offsets) {\n          generation_offsets_[entry_gen].emplace(\n              soff.first,\n              StringUtil::toString(soff.second));\n        }\n\n        if (entry_gen > max_gen_) {\n          max_gen_ = entry_gen;\n        }\n      }\n\n      generations_[entry_gen].emplace_back(entry.get());\n    }\n\n    feed_reader.fillBuffers();\n\n\n    \/* flush generations *\/\n    auto watermarks = feed_reader.watermarks();\n    auto stream_time_micros = watermarks.first.unixMicros();\n\n    if (stream_time_micros > generation_delay_micros) {\n      stream_time_micros -= generation_delay_micros;\n    }\n\n    for (auto iter = generations_.begin(); iter != generations_.end(); ) {\n      if (stream_time_micros < ((iter->first + 1) * generation_window_micros)) {\n        ++iter;\n        continue;\n      }\n\n      fnord::logDebug(\n          \"cm.ctrstatsbuild\",\n          \"Flushing report generation #$0\",\n          iter->first);\n\n      FeedChunkInfo fci;\n      fci.generation = iter->first;\n      fci.generation_window = generation_window_micros;\n      fci.start_time = iter->first * generation_window_micros;\n      fci.end_time = (iter->first + 1) * generation_window_micros;\n      fci.start_offsets = generation_offsets_[iter->first];\n\n      auto fci_json = json::toJSONString(fci);\n\n      auto sstable_file_path = FileUtil::joinPaths(\n          output_path,\n          StringUtil::format(\"$0.$1.sstable\", output_prefix, iter->first));\n\n      auto sstable_writer = sstable::SSTableWriter::create(\n          sstable_file_path,\n          sstable::IndexProvider{},\n          fci_json.c_str(),\n          fci_json.length());\n\n      iter = generations_.erase(iter);\n      generation_offsets_.erase(iter->first);\n    }\n\n    auto etime = WallClock::now().unixMicros() - last_iter.unixMicros();\n    if (i < 1 && etime < rate_limit_micros) {\n      usleep(rate_limit_micros - etime);\n    }\n  }\n\n  evloop_thread.join();\n  return 0;\n}\n\n<commit_msg>display streamtime<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 <stdlib.h>\n#include <unistd.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-mdb\/MDB.h\"\n#include \"cm-common\/CustomerNamespace.h\"\n#include \"cm-logjoin\/LogJoin.h\"\n\nusing namespace fnord;\n\nstruct FeedChunkInfo {\n  uint64_t generation;\n  uint64_t generation_window;\n  uint64_t start_time;\n  uint64_t end_time;\n  HashMap<String, String> start_offsets;\n\n  template <typename T>\n  static void reflect(T* meta) {\n    meta->prop(&FeedChunkInfo::generation, 1, \"generation\", false);\n    meta->prop(&FeedChunkInfo::generation_window, 2, \"generation_window\", false);\n    meta->prop(&FeedChunkInfo::start_time, 3, \"start_time\", false);\n    meta->prop(&FeedChunkInfo::end_time, 4, \"end_time\", false);\n    meta->prop(&FeedChunkInfo::start_offsets, 5, \"start_offsets\", false);\n  };\n};\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      \"output_path\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output file path\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"output_prefix\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output filename prefix\",\n      \"<prefix>\");\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      \"generation_window_secs\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"14400\",\n      \"generation_window_secs\",\n      \"<secs>\");\n\n  flags.defineFlag(\n      \"generation_delay_secs\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"3600\",\n      \"generation_delay_secs\",\n      \"<secs>\");\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  auto evloop_thread = std::thread([&ev] {\n    ev.run();\n  });\n\n  \/* set up rpc client *\/\n  HTTPRPCClient rpc_client(&ev);\n\n  auto output_path = flags.getString(\"output_path\");\n  auto output_prefix = flags.getString(\"output_prefix\");\n  size_t batch_size = flags.getInt(\"batch_size\");\n  size_t buffer_size = flags.getInt(\"buffer_size\");\n  size_t generation_window_micros =\n      flags.getInt(\"generation_window_secs\") * kMicrosPerSecond;\n  size_t generation_delay_micros =\n      flags.getInt(\"generation_delay_secs\") * kMicrosPerSecond;\n\n  FileUtil::mkdir_p(output_path);\n\n  \/* set up input feed reader *\/\n  feeds::RemoteFeedReader feed_reader(&rpc_client);\n\n  \/* get source urls *\/\n  Vector<String> uris = flags.getArgv();\n  \/\/if (flags.isSet(\"statefile\")) {\n  \/\/  auto statefile = FileUtil::read(flags.getString(\"statefile\")).toString();\n  \/\/  for (const auto& uri : StringUtil::split(statefile, \"\\n\")) {\n  \/\/    if (uri.size() > 0) {\n  \/\/      uris.emplace_back(uri);\n  \/\/    }\n  \/\/  }\n  \/\/}\n\n  HashMap<String, String> feed_urls;\n  for (const auto& uri_raw : uris) {\n    URI uri(uri_raw);\n    const auto& params = uri.queryParams();\n\n    std::string feed;\n    if (!URI::getParam(params, \"feed\", &feed)) {\n      RAISEF(\n          kIllegalArgumentError,\n          \"feed url missing ?feed query param: $0\",\n          uri_raw);\n    }\n\n    feed_urls.emplace(feed, uri_raw.substr(0, uri_raw.find(\"?\")));\n\n    std::string offset_str;\n    uint64_t offset = 0;\n    if (URI::getParam(params, \"offset\", &offset_str)) {\n      if (offset_str == \"HEAD\") {\n        offset = std::numeric_limits<uint64_t>::max();\n      } else {\n        offset = std::stoul(offset_str);\n      }\n    }\n\n    feed_reader.addSourceFeed(\n        uri,\n        feed,\n        offset,\n        batch_size,\n        buffer_size);\n  }\n\n  uint64_t total_rows = 0;\n  uint64_t total_bytes = 0;\n  auto start_time = WallClock::now().unixMicros();\n  auto last_status_line = start_time;\n\n  DateTime last_iter;\n  uint64_t rate_limit_micros = 0.1 * kMicrosPerSecond;\n\n  HashMap<uint64_t, List<feeds::FeedEntry>> generations_;\n  HashMap<uint64_t, HashMap<String, String>> generation_offsets_;\n  uint64_t max_gen_ = 0;\n\n  for (;;) {\n    last_iter = WallClock::now();\n    feed_reader.fillBuffers();\n\n    \/* read feed and build generations *\/\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      ++total_rows;\n      total_bytes += entry.get().data.size();\n\n      auto now = WallClock::now().unixMicros();\n      if (now - last_status_line > 10000) {\n        Set<uint64_t> active_gens;\n        for (const auto& g : generations_) {\n          active_gens.emplace(g.first);\n        }\n\n        auto watermarks = feed_reader.watermarks();\n        auto runtime = (now - start_time) \/ 1000000;\n        uint64_t bandwidth = total_bytes \/ (runtime + 1);\n        auto str = StringUtil::format(\n            \"\\rrows=$0 bytes=$1B time=$2s bw=$3B\/s active_gens=$4 streamtime=$5\"\n            \"          \",\n            total_rows,\n            total_bytes,\n            runtime,\n            bandwidth,\n            inspect(active_gens),\n            watermarks.first);\n\n        write(0, str.c_str(), str.length());\n        fflush(0);\n      }\n\n\n      auto entry_time = entry.get().time.unixMicros();\n      if (entry_time == 0) {\n        continue;\n      }\n\n      uint64_t entry_gen = entry_time \/ generation_window_micros;\n\n      auto iter = generations_.find(entry_gen);\n      if (iter == generations_.end()) {\n        if (max_gen_ >= entry_gen) {\n          fnord::logWarning(\n              \"fnord.feedexport\",\n              \"Dropping late data for  generation #$0\",\n              entry_gen);\n\n          continue;\n        }\n\n        fnord::logDebug(\n            \"fnord.feedexport\",\n            \"Creating new generation #$0\",\n            entry_gen);\n\n        auto stream_offsets = feed_reader.streamOffsets();\n        for (const auto& soff : stream_offsets) {\n          generation_offsets_[entry_gen].emplace(\n              soff.first,\n              StringUtil::toString(soff.second));\n        }\n\n        if (entry_gen > max_gen_) {\n          max_gen_ = entry_gen;\n        }\n      }\n\n      generations_[entry_gen].emplace_back(entry.get());\n    }\n\n    feed_reader.fillBuffers();\n\n    \/* flush generations *\/\n    auto watermarks = feed_reader.watermarks();\n    auto stream_time_micros = watermarks.first.unixMicros();\n\n    if (stream_time_micros > generation_delay_micros) {\n      stream_time_micros -= generation_delay_micros;\n    }\n\n    for (auto iter = generations_.begin(); iter != generations_.end(); ) {\n      if (stream_time_micros < ((iter->first + 1) * generation_window_micros)) {\n        ++iter;\n        continue;\n      }\n\n      fnord::logDebug(\n          \"cm.ctrstatsbuild\",\n          \"Flushing report generation #$0\",\n          iter->first);\n\n      FeedChunkInfo fci;\n      fci.generation = iter->first;\n      fci.generation_window = generation_window_micros;\n      fci.start_time = iter->first * generation_window_micros;\n      fci.end_time = (iter->first + 1) * generation_window_micros;\n      fci.start_offsets = generation_offsets_[iter->first];\n\n      auto fci_json = json::toJSONString(fci);\n\n      auto sstable_file_path = FileUtil::joinPaths(\n          output_path,\n          StringUtil::format(\"$0.$1.sstable\", output_prefix, iter->first));\n\n      auto sstable_writer = sstable::SSTableWriter::create(\n          sstable_file_path,\n          sstable::IndexProvider{},\n          fci_json.c_str(),\n          fci_json.length());\n\n      iter = generations_.erase(iter);\n      generation_offsets_.erase(iter->first);\n    }\n\n    auto etime = WallClock::now().unixMicros() - last_iter.unixMicros();\n    if (i < 1 && etime < rate_limit_micros) {\n      usleep(rate_limit_micros - etime);\n    }\n  }\n\n  evloop_thread.join();\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/  \n\/\/ Copyright (C) 2006-2017 SIPez LLC.  All rights reserved.\n\/\/  \n\/\/  \n\/\/ $$ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ \n\n#include <os\/OsIntTypes.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\n#include <mp\/MpCodecFactory.h>\n#include <os\/OsTime.h>\n#include <os\/OsDateTime.h>\n\n#include <sipxunittests.h>\n\n\/\/ Setup codec paths..\n#include <..\/test\/mp\/MpTestCodecPaths.h>\n\n\/\/\/ Duration of one frame in milliseconds\n#define FRAME_MS                 20\n\/\/\/ Maximum length of audio data we expect from decoder (in samples).\n#define DECODED_FRAME_MAX_SIZE   3200\n\/\/\/ Maximum size of encoded frame (in bytes).\n#define ENCODED_FRAME_MAX_SIZE   1480\n\/\/\/ Number of RTP packets to encode\/decode.\n#define NUM_PACKETS_TO_TEST      3\n\/\/\/ Maximum number of milliseconds in packet.\n#define MAX_PACKET_TIME          20\n\n\/\/\/  Unit test for testing performance of supported codecs.\nclass MpCodecsPerformanceTest : public SIPX_UNIT_BASE_CLASS\n{\n   CPPUNIT_TEST_SUITE(MpCodecsPerformanceTest);\n   CPPUNIT_TEST(testCodecsPreformance);\n   CPPUNIT_TEST_SUITE_END();\n\npublic:\n\n   void setUp()\n   {\n      \/\/ Create pool for data buffers\n      mpPool = new MpBufPool(ENCODED_FRAME_MAX_SIZE + MpArrayBuf::getHeaderSize(), 1, \"MpCodecsPerformanceTest\");\n      CPPUNIT_ASSERT(mpPool != NULL);\n\n      \/\/ Create pool for buffer headers\n      mpHeadersPool = new MpBufPool(sizeof(MpRtpBuf), 1, \"MpCodecsPerformanceTestHeaders\");\n      CPPUNIT_ASSERT(mpHeadersPool != NULL);\n\n      \/\/ Set mpHeadersPool as default pool for audio and data pools.\n      MpRtpBuf::smpDefaultPool = mpHeadersPool;\n   }\n\n   void tearDown()\n   {\n      if (mpPool != NULL)\n      {\n         delete mpPool;\n      }\n      if (mpHeadersPool != NULL)\n      {\n         delete mpHeadersPool;\n      }\n   }\n\n   void testCodecsPreformance()\n   {\n      MpCodecFactory  *pCodecFactory;\n      const MppCodecInfoV1_1 **pCodecInfo;\n      unsigned         codecInfoNum;\n\n      \/\/ Get\/create codec factory\n      pCodecFactory = MpCodecFactory::getMpCodecFactory();\n      CPPUNIT_ASSERT(pCodecFactory != NULL);\n\n      \/\/ Load all available codecs\n      size_t i;\n      for(i = 0; i < sNumCodecPaths; i++)\n      {\n         printf(\"MpCodecsPerformanceTest loading codecs from: %s\\n\", sCodecPaths[i].data());\n         pCodecFactory->loadAllDynCodecs(sCodecPaths[i],\n                                         CODEC_PLUGINS_FILTER);\n      }\n\n      \/\/ Get list of loaded codecs\n      pCodecFactory->getCodecInfoArray(codecInfoNum, pCodecInfo);\n      CPPUNIT_ASSERT(codecInfoNum>0);\n\n      unsigned j;\n      for (j=0; j<codecInfoNum; j++)\n      {\n         const char **pCodecFmtps;\n         unsigned     codecFmtpsNum;\n         codecFmtpsNum = pCodecInfo[j]->fmtpsNum;\n         pCodecFmtps = pCodecInfo[j]->fmtps;\n         if(strcmp(pCodecInfo[j]->mimeSubtype, MIME_SUBTYPE_H264) == 0)\n         {\n             printf(\"Skipping codec: %s\\n\", pCodecInfo[j]->mimeSubtype);\n         }\n         else if (codecFmtpsNum == 0)\n         {\n            testOneCodecPreformance(pCodecFactory,\n                                    pCodecInfo[j]->mimeSubtype,\n                                    \"\",\n                                    pCodecInfo[j]->sampleRate,\n                                    pCodecInfo[j]->numChannels);\n         } \n         else\n         {\n            for (unsigned fmtpNum=0; fmtpNum<codecFmtpsNum; fmtpNum++)\n            {\n               testOneCodecPreformance(pCodecFactory,\n                                       pCodecInfo[j]->mimeSubtype,\n                                       pCodecFmtps[fmtpNum],\n                                       pCodecInfo[j]->sampleRate,\n                                       pCodecInfo[j]->numChannels);\n            }\n         }\n      }\n\n      \/\/ Free codec factory\n      MpCodecFactory::freeSingletonHandle();\n   }\n\nprotected:\n   MpBufPool *mpPool;         \/\/\/< Pool for data buffers\n   MpBufPool *mpHeadersPool;  \/\/\/< Pool for buffers headers\n\n   void testOneCodecPreformance(MpCodecFactory *pCodecFactory,\n                                const UtlString &codecMime,\n                                const UtlString &codecFmtp,\n                                int sampleRate,\n                                int numChannels)\n   {\n      MpDecoderBase *pDecoder;\n      MpEncoderBase *pEncoder;\n      MpAudioSample *pOriginal;\n      MpAudioSample  pDecoded[DECODED_FRAME_MAX_SIZE];\n      int            encodeFrameNum = 0;\n      int            maxPacketSamples = (MAX_PACKET_TIME*sampleRate)\/1000;\n      int            frameSize = (sampleRate*FRAME_MS)\/1000;\n      int            codecFrameSamples;\n      UtlString contextMessage;\n      contextMessage.appendFormat(\"While testing codec: %s fmtp: %s sample rate: %d\", codecMime.data(), codecFmtp.data(), sampleRate);\n\n      \/\/ Allocate buffer for raw audio data\n      pOriginal = new MpAudioSample[frameSize];\n      srand(time(NULL));\n      for (int k=0; k<frameSize; k++)\n      {\n         pOriginal[k] = rand()%32000 - 16000;\n      }\n\n      \/\/ Create and initialize decoder and encoder\n      \/\/printf(\"creating decoder: %s\/%d\/%d fmpt=\\\"%s\\\"\\n\",\n      \/\/       codecMime.data(), sampleRate, numChannels, codecFmtp.data());\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pCodecFactory->createDecoder(codecMime, codecFmtp,\n                                                        sampleRate, numChannels,\n                                                        0, pDecoder));\n\n      CPPUNIT_ASSERT(pDecoder);\n\n      OsStatus initDecodeStatus = pDecoder->initDecode();\n      CPPUNIT_ASSERT_EQUAL_MESSAGE(contextMessage.data(), OS_SUCCESS, initDecodeStatus);\n                           \n      \/\/ Could not test speed of signaling codec\n      if (pDecoder->getInfo() == NULL || pDecoder->getInfo()->isSignalingCodec())\n      {\n         pDecoder->freeDecode();\n         delete pDecoder;\n         return;\n      }\n\n      printf(\"codec: %s sample rate: %d frame size: %d\\n\",\n         codecMime.data(), sampleRate, pDecoder->getInfo()->getNumSamplesPerFrame());\n\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pCodecFactory->createEncoder(codecMime, codecFmtp,\n                                                        sampleRate, numChannels,\n                                                        0, pEncoder));\n\n      CPPUNIT_ASSERT(pEncoder);\n\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pEncoder->initEncode());\n\n      \/\/ Get number of samples we'll pack to get one packet\n      if (pEncoder->getInfo()->getCodecType() == CODEC_TYPE_FRAME_BASED)\n      {\n         codecFrameSamples = pEncoder->getInfo()->getNumSamplesPerFrame();\n      }\n      else if (pEncoder->getInfo()->getCodecType() == CODEC_TYPE_SAMPLE_BASED)\n      {\n         codecFrameSamples = frameSize;\n      }\n      else\n      {\n         assert(!\"Unknown codec type!\");\n      }\n\n      unsigned char* rtpDataStart = NULL;\n\n      for (int i=0; i<NUM_PACKETS_TO_TEST; i++)\n      {\n         int            tmpSamplesConsumed;\n         int            tmpEncodedSize;\n         UtlBoolean     tmpIsPacketReady;\n         UtlBoolean     tmpIsPacketSilent;\n         MpRtpBufPtr    pRtpPacket = mpPool->getBuffer();\n         unsigned char *pRtpPayloadPtr = (unsigned char *)pRtpPacket->getDataWritePtr();\n         int            payloadSize = 0;\n         int            samplesInPacket = 0;\n         OsTime         start;\n         OsTime         stop;\n         OsTime         diff;\n\n         UtlString loopMessage;\n         loopMessage.appendFormat(\"%s packet: %d\", codecMime.data(), i);\n\n         if(rtpDataStart == NULL)\n         {\n             rtpDataStart = pRtpPayloadPtr;\n         }\n\n         \/\/ Encode frames until we get tmpSendNow set or reach packet size limit.\n         do \n         {\n            if(pRtpPayloadPtr != rtpDataStart)\n            {\n               printf(\"WARNING: rtpDataStart: %p pRtpPayloadPtr: %p\\n\",\n                   rtpDataStart, pRtpPayloadPtr);\n            }\n\n            \/\/ Encode one frame and measure time it took.\n            UtlBoolean setMarkerBit;\n            OsStatus result;\n            OsDateTime::getCurTime(start);\n            result = pEncoder->encode(pOriginal, frameSize, tmpSamplesConsumed,\n                                      pRtpPayloadPtr,\n                                      ENCODED_FRAME_MAX_SIZE-payloadSize,\n                                      tmpEncodedSize, tmpIsPacketReady,\n                                      tmpIsPacketSilent,\n                                      setMarkerBit);\n            OsDateTime::getCurTime(stop);\n            CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, result);\n            \n            \/\/ Print timing in CSV format\n            diff = stop - start;\n            printf(\"encode %s\/%d\/%d %s;%d;%ld.%06ld;%ld.%06ld\\n\",\n                   codecMime.data(), sampleRate, numChannels, codecFmtp.data(),\n                   encodeFrameNum,\n                   start.seconds(), start.usecs(),\n                   diff.seconds(), diff.usecs());\n\n            \/\/ Adjust encoding state\n            payloadSize += tmpEncodedSize;\n            pRtpPayloadPtr += tmpEncodedSize;\n            samplesInPacket += tmpSamplesConsumed;\n            CPPUNIT_ASSERT_MESSAGE(contextMessage.data(), payloadSize <= ENCODED_FRAME_MAX_SIZE);\n            if(payloadSize > ENCODED_FRAME_MAX_SIZE)\n            {\n                printf(\"payloadSize: %d ENCODED_FRAME_MAX_SIZE: %d\\n\",\n                    payloadSize, ENCODED_FRAME_MAX_SIZE);\n            }\n            encodeFrameNum++;\n            printf(\"payloadSize: %d tmpIsPacketReady: %s samplesInPacket: %d codecFrameSamples: %d maxPacketSamples: %d tmpEncodedSize: %d\\n\",\n                payloadSize, tmpIsPacketReady ? \"true\" : \"false\", samplesInPacket, codecFrameSamples, maxPacketSamples, tmpEncodedSize);\n         } while( (payloadSize == 0)\n                ||( (tmpIsPacketReady != TRUE) &&\n                    (samplesInPacket+codecFrameSamples <= maxPacketSamples)));\n\n         printf(\"packet samples: %d\\n\", samplesInPacket);\n\n         pRtpPacket->setPayloadSize(payloadSize);\n\n         \/\/ Decode frame, measure time and verify, that we decoded same number of samples.\n         OsDateTime::getCurTime(start);\n         tmpSamplesConsumed = pDecoder->decode(pRtpPacket, DECODED_FRAME_MAX_SIZE,\n                                               pDecoded);\n         OsDateTime::getCurTime(stop);\n         CPPUNIT_ASSERT_EQUAL_MESSAGE(loopMessage.data(),\n                                      samplesInPacket, tmpSamplesConsumed);\n\n         printf(\"RTP payload first byte: %x payload size: %d\\n\",\n             *(pRtpPacket->getDataPtr()), pRtpPacket->getPayloadSize());\n \n         \/\/ Print timing in TSV format\n         diff = stop - start;\n         printf(\"decode %s\/%d\/%d %s;%d;%ld.%06ld;%ld.%06ld\\n\",\n                codecMime.data(), sampleRate, numChannels, codecFmtp.data(),\n                i,\n                start.seconds(), start.usecs(),\n                diff.seconds(), diff.usecs());\n      }\n\n      \/\/ Free encoder and decoder\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pDecoder->freeDecode());\n      delete pDecoder;\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pEncoder->freeEncode());\n      delete pEncoder;\n\n      \/\/ Free buffer used for raw audio data\n      delete[] pOriginal;\n   }\n\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(MpCodecsPerformanceTest);\n<commit_msg>Added some more test cases, changed media frame size to 10 ms (as is typical), fixed a number of issues in unit test and in plugins.  <commit_after>\/\/  \n\/\/ Copyright (C) 2006-2017 SIPez LLC.  All rights reserved.\n\/\/  \n\/\/  \n\/\/ $$ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ \n\n#include <os\/OsIntTypes.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\n#include <mp\/MpCodecFactory.h>\n#include <mp\/NetInTask.h>\n#include <os\/OsTime.h>\n#include <os\/OsDateTime.h>\n\n#include <sipxunittests.h>\n\n\/\/ Setup codec paths..\n#include <..\/test\/mp\/MpTestCodecPaths.h>\n\n\/\/\/ Duration of one frame in milliseconds\n#define FRAME_MS                 10\n\/\/\/ Maximum length of audio data we expect from decoder (in samples).\n#define DECODED_FRAME_MAX_SIZE   3200\n\/\/\/ Maximum size of encoded frame (in bytes).\n#define ENCODED_FRAME_MAX_SIZE   RTP_MTU\n\/\/\/ Number of RTP packets to encode\/decode.\n#define NUM_PACKETS_TO_TEST      3\n\/\/\/ Maximum number of milliseconds in packet.\n#define MAX_PACKET_TIME          20\n\n\/\/\/  Unit test for testing performance of supported codecs.\nclass MpCodecsPerformanceTest : public SIPX_UNIT_BASE_CLASS\n{\n   CPPUNIT_TEST_SUITE(MpCodecsPerformanceTest);\n   CPPUNIT_TEST(testCodecsPreformance);\n   CPPUNIT_TEST_SUITE_END();\n\npublic:\n\n   void setUp()\n   {\n      \/\/ Create pool for data buffers\n      mpPool = new MpBufPool(ENCODED_FRAME_MAX_SIZE + MpArrayBuf::getHeaderSize(), 1, \"MpCodecsPerformanceTest\");\n      CPPUNIT_ASSERT(mpPool != NULL);\n\n      \/\/ Create pool for buffer headers\n      mpHeadersPool = new MpBufPool(sizeof(MpRtpBuf), 1, \"MpCodecsPerformanceTestHeaders\");\n      CPPUNIT_ASSERT(mpHeadersPool != NULL);\n\n      \/\/ Set mpHeadersPool as default pool for audio and data pools.\n      MpRtpBuf::smpDefaultPool = mpHeadersPool;\n   }\n\n   void tearDown()\n   {\n      if (mpPool != NULL)\n      {\n         delete mpPool;\n      }\n      if (mpHeadersPool != NULL)\n      {\n         delete mpHeadersPool;\n      }\n   }\n\n   void testCodecsPreformance()\n   {\n      MpCodecFactory  *pCodecFactory;\n      const MppCodecInfoV1_1 **pCodecInfo;\n      unsigned         codecInfoNum;\n\n      \/\/ Get\/create codec factory\n      pCodecFactory = MpCodecFactory::getMpCodecFactory();\n      CPPUNIT_ASSERT(pCodecFactory != NULL);\n\n      \/\/ Load all available codecs\n      size_t i;\n      for(i = 0; i < sNumCodecPaths; i++)\n      {\n         printf(\"MpCodecsPerformanceTest loading codecs from: %s\\n\", sCodecPaths[i].data());\n         pCodecFactory->loadAllDynCodecs(sCodecPaths[i],\n                                         CODEC_PLUGINS_FILTER);\n      }\n\n      printf(\"mediaFrame size: %d mSec\\n\", FRAME_MS);\n\n      \/\/ Get list of loaded codecs\n      pCodecFactory->getCodecInfoArray(codecInfoNum, pCodecInfo);\n      CPPUNIT_ASSERT(codecInfoNum>0);\n\n      unsigned j;\n      for (j=0; j<codecInfoNum; j++)\n      {\n         const char **pCodecFmtps;\n         unsigned     codecFmtpsNum;\n         codecFmtpsNum = pCodecInfo[j]->fmtpsNum;\n         pCodecFmtps = pCodecInfo[j]->fmtps;\n         if(strcmp(pCodecInfo[j]->mimeSubtype, MIME_SUBTYPE_H264) == 0)\n         {\n             printf(\"Skipping codec: %s\\n\", pCodecInfo[j]->mimeSubtype);\n         }\n         else if (codecFmtpsNum == 0)\n         {\n            testOneCodecPreformance(pCodecFactory,\n                                    pCodecInfo[j]->mimeSubtype,\n                                    \"\",\n                                    pCodecInfo[j]->sampleRate,\n                                    pCodecInfo[j]->numChannels);\n         } \n         else\n         {\n            for (unsigned fmtpNum=0; fmtpNum<codecFmtpsNum; fmtpNum++)\n            {\n               testOneCodecPreformance(pCodecFactory,\n                                       pCodecInfo[j]->mimeSubtype,\n                                       pCodecFmtps[fmtpNum],\n                                       pCodecInfo[j]->sampleRate,\n                                       pCodecInfo[j]->numChannels);\n            }\n         }\n      }\n\n      \/\/ Free codec factory\n      MpCodecFactory::freeSingletonHandle();\n   }\n\nprotected:\n   MpBufPool *mpPool;         \/\/\/< Pool for data buffers\n   MpBufPool *mpHeadersPool;  \/\/\/< Pool for buffers headers\n\n   void testOneCodecPreformance(MpCodecFactory *pCodecFactory,\n                                const UtlString &codecMime,\n                                const UtlString &codecFmtp,\n                                int sampleRate,\n                                int numChannels)\n   {\n      MpDecoderBase *pDecoder;\n      MpEncoderBase *pEncoder;\n      MpAudioSample *pOriginal;\n      MpAudioSample  pDecoded[DECODED_FRAME_MAX_SIZE];\n      int            encodeFrameNum = 0;\n      int            maxPacketSamples = (MAX_PACKET_TIME*sampleRate)\/1000 \/\n                        (MAX_PACKET_TIME\/FRAME_MS) * (MAX_PACKET_TIME\/FRAME_MS); \/\/ Fix roundoff issues\n      int            frameSize = (sampleRate*FRAME_MS)\/1000;\n      int            codecFrameSamples;\n      UtlString contextMessage;\n      contextMessage.appendFormat(\"While testing codec: %s fmtp: %s sample rate: %d\", codecMime.data(), codecFmtp.data(), sampleRate);\n\n      \/\/ Allocate buffer for raw audio data\n      pOriginal = new MpAudioSample[frameSize];\n      srand(time(NULL));\n      for (int k=0; k<frameSize; k++)\n      {\n         pOriginal[k] = rand()%32000 - 16000;\n      }\n\n      \/\/ Create and initialize decoder and encoder\n      \/\/printf(\"creating decoder: %s\/%d\/%d fmpt=\\\"%s\\\"\\n\",\n      \/\/       codecMime.data(), sampleRate, numChannels, codecFmtp.data());\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pCodecFactory->createDecoder(codecMime, codecFmtp,\n                                                        sampleRate, numChannels,\n                                                        0, pDecoder));\n\n      CPPUNIT_ASSERT(pDecoder);\n\n      OsStatus initDecodeStatus = pDecoder->initDecode();\n      CPPUNIT_ASSERT_EQUAL_MESSAGE(contextMessage.data(), OS_SUCCESS, initDecodeStatus);\n                           \n      \/\/ Could not test speed of signaling codec\n      if (pDecoder->getInfo() == NULL || pDecoder->getInfo()->isSignalingCodec())\n      {\n         pDecoder->freeDecode();\n         delete pDecoder;\n         return;\n      }\n\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pCodecFactory->createEncoder(codecMime, codecFmtp,\n                                                        sampleRate, numChannels,\n                                                        0, pEncoder));\n\n      CPPUNIT_ASSERT(pEncoder);\n\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pEncoder->initEncode());\n\n      \/\/ Get number of samples we'll pack to get one packet\n      if (pEncoder->getInfo()->getCodecType() == CODEC_TYPE_FRAME_BASED)\n      {\n         codecFrameSamples = pEncoder->getInfo()->getNumSamplesPerFrame();\n      }\n      else if (pEncoder->getInfo()->getCodecType() == CODEC_TYPE_SAMPLE_BASED)\n      {\n         codecFrameSamples = frameSize;\n      }\n      else\n      {\n         assert(!\"Unknown codec type!\");\n      }\n\n      printf(\"codec: %s sample rate: %d frame size: %d\\n\",\n         codecMime.data(), sampleRate, codecFrameSamples);\n\n      CPPUNIT_ASSERT_MESSAGE(contextMessage.data(), codecFrameSamples > 0);\n\n      unsigned char* rtpDataStart = NULL;\n      int algorithmicDelaySamplesCount = 0;\n\n      for (int i=0; i<NUM_PACKETS_TO_TEST; i++)\n      {\n         int            tmpSamplesConsumed;\n         int            tmpEncodedSize;\n         UtlBoolean     tmpIsPacketReady;\n         UtlBoolean     tmpIsPacketSilent;\n         MpRtpBufPtr    pRtpPacket = mpPool->getBuffer();\n         unsigned char *pRtpPayloadPtr = (unsigned char *)pRtpPacket->getDataWritePtr();\n         int            payloadSize = 0;\n         int            samplesInPacket = 0;\n         OsTime         start;\n         OsTime         stop;\n         OsTime         diff;\n\n         UtlString loopMessage;\n         loopMessage.appendFormat(\"%s packet: %d\", codecMime.data(), i);\n\n         if(rtpDataStart == NULL)\n         {\n             rtpDataStart = pRtpPayloadPtr;\n         }\n\n         \/\/ Encode frames until we get tmpSendNow set or reach packet size limit.\n         do \n         {\n            if(pRtpPayloadPtr != rtpDataStart)\n            {\n               printf(\"WARNING: rtpDataStart: %p pRtpPayloadPtr: %p\\n\",\n                   rtpDataStart, pRtpPayloadPtr);\n            }\n\n            \/\/ Encode one frame and measure time it took.\n            UtlBoolean setMarkerBit;\n            OsStatus result;\n            OsDateTime::getCurTime(start);\n            result = pEncoder->encode(pOriginal, frameSize, tmpSamplesConsumed,\n                                      pRtpPayloadPtr,\n                                      ENCODED_FRAME_MAX_SIZE-payloadSize,\n                                      tmpEncodedSize, tmpIsPacketReady,\n                                      tmpIsPacketSilent,\n                                      setMarkerBit);\n            OsDateTime::getCurTime(stop);\n            CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, result);\n            \n            \/\/ Print timing in CSV format\n            diff = stop - start;\n            printf(\"encode %s\/%d\/%d %s;%d;%ld.%06ld;%ld.%06ld\\n\",\n                   codecMime.data(), sampleRate, numChannels, codecFmtp.data(),\n                   encodeFrameNum,\n                   start.seconds(), start.usecs(),\n                   diff.seconds(), diff.usecs());\n\n            \/\/ Adjust encoding state\n            payloadSize += tmpEncodedSize;\n            pRtpPayloadPtr += tmpEncodedSize;\n            samplesInPacket += tmpSamplesConsumed;\n            CPPUNIT_ASSERT_MESSAGE(contextMessage.data(), payloadSize <= ENCODED_FRAME_MAX_SIZE);\n            if(payloadSize > ENCODED_FRAME_MAX_SIZE)\n            {\n                printf(\"payloadSize: %d ENCODED_FRAME_MAX_SIZE: %d\\n\",\n                    payloadSize, ENCODED_FRAME_MAX_SIZE);\n            }\n            encodeFrameNum++;\n            printf(\"payloadSize: %d tmpIsPacketReady: %s samplesInPacket: %d codecFrameSamples: %d maxPacketSamples: %d tmpEncodedSize: %d\\n\",\n                payloadSize, tmpIsPacketReady ? \"true\" : \"false\", samplesInPacket, codecFrameSamples, maxPacketSamples, tmpEncodedSize);\n         } while( (payloadSize == 0)\n                ||( (tmpIsPacketReady != TRUE) &&\n                    (samplesInPacket+codecFrameSamples <= maxPacketSamples)));\n\n         printf(\"packet samples: %d\\n\", samplesInPacket);\n\n         pRtpPacket->setPayloadSize(payloadSize);\n\n         \/\/ Decode frame, measure time and verify, that we decoded same number of samples.\n         OsDateTime::getCurTime(start);\n         tmpSamplesConsumed = pDecoder->decode(pRtpPacket, DECODED_FRAME_MAX_SIZE,\n                                               pDecoded);\n         OsDateTime::getCurTime(stop);\n         if(algorithmicDelaySamplesCount == 0 &&\n            tmpSamplesConsumed > 0)\n         {\n             algorithmicDelaySamplesCount = samplesInPacket;\n         \n             CPPUNIT_ASSERT_MESSAGE(loopMessage.data(),\n                                    algorithmicDelaySamplesCount >= \n                                    pEncoder->getInfo()->getAlgorithmicDelay());\n             if(algorithmicDelaySamplesCount < \n                pEncoder->getInfo()->getAlgorithmicDelay())\n             {\n                printf(\"algorithmic delay observed: %d samples codec info: %d samples\\n\",\n                       algorithmicDelaySamplesCount,\n                       pEncoder->getInfo()->getAlgorithmicDelay());\n             }\n             \/\/ If we run into the MTU limit, we may not reach the algorithmic delay num samples\n             if(pRtpPacket->getPayloadSize() < RTP_MTU ||\n                algorithmicDelaySamplesCount >=\n                                    codecFrameSamples)\n             {\n                 CPPUNIT_ASSERT_MESSAGE(loopMessage.data(),\n                                        algorithmicDelaySamplesCount >= \n                                        codecFrameSamples);\n                 if(algorithmicDelaySamplesCount <\n                    codecFrameSamples)\n                 {\n                    printf(\"algorithmic delay observed: %d codecFrameSamples: %d\\n\",\n                           algorithmicDelaySamplesCount,\n                           codecFrameSamples);\n                 }\n             }\n         }\n         CPPUNIT_ASSERT_EQUAL_MESSAGE(loopMessage.data(),\n                                      samplesInPacket, tmpSamplesConsumed);\n         if(pEncoder->getInfo()->getCodecType() == CODEC_TYPE_SAMPLE_BASED)\n         {\n             if(pRtpPacket->getPayloadSize() < RTP_MTU ||\n                tmpSamplesConsumed == maxPacketSamples)\n             {\n                 CPPUNIT_ASSERT_EQUAL_MESSAGE(loopMessage.data(),\n                                              tmpSamplesConsumed,\n                                              maxPacketSamples);\n             }\n             \/\/ TODO: need test for case when we fill the RTP packet before we get to maxPacketSamples\n             else\n             {\n                 printf(\"WARNING: maximum RTP MTU (%d) reached before maxPacketSamples (%d), only %d encoded\\n\",\n                        RTP_MTU,\n                        maxPacketSamples,\n                        tmpSamplesConsumed);\n             }\n         }\n         else\n         {\n             CPPUNIT_ASSERT_EQUAL_MESSAGE(loopMessage.data(),\n                                          tmpSamplesConsumed,\n                                          codecFrameSamples);\n         }\n         printf(\"RTP payload first byte: %x payload size: %d\\n\",\n             *(pRtpPacket->getDataPtr()), pRtpPacket->getPayloadSize());\n \n         \/\/ Print timing in TSV format\n         diff = stop - start;\n         printf(\"decode %s\/%d\/%d %s;%d;%ld.%06ld;%ld.%06ld\\n\",\n                codecMime.data(), sampleRate, numChannels, codecFmtp.data(),\n                i,\n                start.seconds(), start.usecs(),\n                diff.seconds(), diff.usecs());\n      }\n\n      printf(\"algorithmic-delay %s\/%d\/%d %s;%d;%f\\n\",\n             codecMime.data(), sampleRate, numChannels, codecFmtp.data(),\n             algorithmicDelaySamplesCount, \n             ((float)algorithmicDelaySamplesCount) \/ ((float)sampleRate) * 1000.0);\n      printf(\"packet-samples %s\/%d\/%d %s;%d;%f\\n\",\n             codecMime.data(), sampleRate, numChannels, codecFmtp.data(),\n             codecFrameSamples,\n             ((float)codecFrameSamples) \/ ((float)sampleRate) * 1000.0);\n      \/\/ Free encoder and decoder\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pDecoder->freeDecode());\n      delete pDecoder;\n      CPPUNIT_ASSERT_EQUAL(OS_SUCCESS,\n                           pEncoder->freeEncode());\n      delete pEncoder;\n\n      \/\/ Free buffer used for raw audio data\n      delete[] pOriginal;\n   }\n\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(MpCodecsPerformanceTest);\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n *\n * The implementation of the logging functions.\n *\n * @author Nicolas Bock <nicolas.bock@freeon.org>\n * @author Matt Challacombe <matt.challacombe@freeon.org>\n *\/\n\n#include \"logger.h\"\n#include \"index.h\"\n\n#include <charm++.h>\n#include <bitset>\n#include <string>\n#include <string.h>\n#include <sstream>\n#include <stdarg.h>\n#include <stdio.h>\n\n\n\/** The main logging function. It is usually more convenient to use the macros\n * DEBUG, INFO, and ABORT instead.\n *\n * @param filename The name of the file where the message occurred.\n * @param linenumber The line number in that file.\n * @param function_name The name of the function.\n * @param tag A tag.\n * @param format The format string. See printf() for details.\n *\/\nvoid logger (const char *const filename,\n    const int linenumber,\n    const char *const function_name,\n    const char *const tag,\n    const char *const format, ...)\n{\n  const int format_length = 2000;\n  const int string_length = 5000;\n\n  va_list ap;\n  char new_format[format_length];\n  char output_string[string_length];\n\n  if(strlen(tag) > 0)\n  {\n    snprintf(new_format, format_length, \"[%s:%d (%s) PE:%d %s] %s\", filename,\n        linenumber, function_name, CkMyPe(), tag, format);\n  }\n\n  else\n  {\n    snprintf(new_format, format_length, \"[%s:%d (%s) PE:%d] %s\", filename,\n        linenumber, function_name, CkMyPe(), format);\n  }\n\n  va_start(ap, format);\n  vsnprintf(output_string, string_length, new_format, ap);\n  va_end(ap);\n  CkPrintf(output_string);\n}\n\n\/** Print a dense matrix.\n *\n * @param N The matrix size.\n * @param A The matrix.\n * @param format The format string for a message that is printed in front of\n * the matrix. See printf() for details.\n *\/\nvoid printDense (int N, double *A, const char *const format, ...)\n{\n  std::ostringstream o;\n  o.setf(std::ios::scientific);\n\n  va_list ap;\n  const int message_length = 2000;\n  char message[message_length];\n\n  va_start(ap, format);\n  vsnprintf(message, message_length, format, ap);\n  va_end(ap);\n\n  o << message << std::endl;\n  if(N <= 32)\n  {\n    for(int i = 0; i < N; i++) {\n      for(int j = 0; j < N; j++)\n      {\n        o << \" \" << A[BLOCK_INDEX(i, j, 0, 0, N)];\n      }\n      o << std::endl;\n    }\n    CkPrintf(o.str().c_str());\n  }\n\n  else\n  {\n    INFO(\"matrix size too large for printing\\n\");\n  }\n}\n\n\/** Convert an integer to a binary as a string.\n *\n * @param i The integer.\n *\n * @return The string represenation.\n *\/\nstd::string toBinary (unsigned int i)\n{\n  std::string bitString = std::bitset<8*sizeof(unsigned int)>(i).to_string();\n  while(bitString[0] == '0')\n  {\n    bitString.erase(0, 1);\n  }\n  return bitString;\n}\n\n\/** Convert some number of bytes into a human readable form. For instance, n =\n * 1024 would result in \"1 kB\".\n *\n * @param n The number of bytes to convert.\n *\n * @return The string representation of the human readable form.\n *\/\nstd::string humanReadableSize (unsigned long n)\n{\n  std::ostringstream o;\n  double size = 0;\n  const int numberUnits = 5;\n  std::string unit[numberUnits] = { \"B\", \"kiB\", \"MiB\", \"GiB\", \"TiB\" };\n\n  for(int i = 0; i < numberUnits; i++)\n  {\n    size \/= 1024.;\n\n    if(n\/1024 > 0)\n    {\n      size += (n%1024);\n      n \/= 1024;\n    }\n\n    else\n    {\n      size += n;\n      o << size << \" \" << unit[i];\n      return o.str();\n    }\n  }\n  ABORT(\"can not convert this number\\n\");\n}\n<commit_msg>Small fix in documentation.<commit_after>\/** @file\n *\n * The implementation of the logging functions.\n *\n * @author Nicolas Bock <nicolas.bock@freeon.org>\n * @author Matt Challacombe <matt.challacombe@freeon.org>\n *\/\n\n#include \"logger.h\"\n#include \"index.h\"\n\n#include <charm++.h>\n#include <bitset>\n#include <string>\n#include <string.h>\n#include <sstream>\n#include <stdarg.h>\n#include <stdio.h>\n\n\n\/** The main logging function. It is usually more convenient to use the macros\n * DEBUG, INFO, and ABORT instead.\n *\n * @param filename The name of the file where the message occurred.\n * @param linenumber The line number in that file.\n * @param function_name The name of the function.\n * @param tag A tag.\n * @param format The format string. See printf() for details.\n *\/\nvoid logger (const char *const filename,\n    const int linenumber,\n    const char *const function_name,\n    const char *const tag,\n    const char *const format, ...)\n{\n  const int format_length = 2000;\n  const int string_length = 5000;\n\n  va_list ap;\n  char new_format[format_length];\n  char output_string[string_length];\n\n  if(strlen(tag) > 0)\n  {\n    snprintf(new_format, format_length, \"[%s:%d (%s) PE:%d %s] %s\", filename,\n        linenumber, function_name, CkMyPe(), tag, format);\n  }\n\n  else\n  {\n    snprintf(new_format, format_length, \"[%s:%d (%s) PE:%d] %s\", filename,\n        linenumber, function_name, CkMyPe(), format);\n  }\n\n  va_start(ap, format);\n  vsnprintf(output_string, string_length, new_format, ap);\n  va_end(ap);\n  CkPrintf(output_string);\n}\n\n\/** Print a dense matrix.\n *\n * @param N The matrix size.\n * @param A The matrix.\n * @param format The format string for a message that is printed in front of\n * the matrix. See printf() for details.\n *\/\nvoid printDense (int N, double *A, const char *const format, ...)\n{\n  std::ostringstream o;\n  o.setf(std::ios::scientific);\n\n  va_list ap;\n  const int message_length = 2000;\n  char message[message_length];\n\n  va_start(ap, format);\n  vsnprintf(message, message_length, format, ap);\n  va_end(ap);\n\n  o << message << std::endl;\n  if(N <= 32)\n  {\n    for(int i = 0; i < N; i++) {\n      for(int j = 0; j < N; j++)\n      {\n        o << \" \" << A[BLOCK_INDEX(i, j, 0, 0, N)];\n      }\n      o << std::endl;\n    }\n    CkPrintf(o.str().c_str());\n  }\n\n  else\n  {\n    INFO(\"matrix size too large for printing\\n\");\n  }\n}\n\n\/** Convert an integer to a binary as a string.\n *\n * @param i The integer.\n *\n * @return The string represenation.\n *\/\nstd::string toBinary (unsigned int i)\n{\n  std::string bitString = std::bitset<8*sizeof(unsigned int)>(i).to_string();\n  while(bitString[0] == '0')\n  {\n    bitString.erase(0, 1);\n  }\n  return bitString;\n}\n\n\/** Convert some number of bytes into a human readable form. For instance, n =\n * 1024 would result in \"1 kiB\".\n *\n * @param n The number of bytes to convert.\n *\n * @return The string representation of the human readable form.\n *\/\nstd::string humanReadableSize (unsigned long n)\n{\n  std::ostringstream o;\n  double size = 0;\n  const int numberUnits = 5;\n  std::string unit[numberUnits] = { \"B\", \"kiB\", \"MiB\", \"GiB\", \"TiB\" };\n\n  for(int i = 0; i < numberUnits; i++)\n  {\n    size \/= 1024.;\n\n    if(n\/1024 > 0)\n    {\n      size += (n%1024);\n      n \/= 1024;\n    }\n\n    else\n    {\n      size += n;\n      o << size << \" \" << unit[i];\n      return o.str();\n    }\n  }\n  ABORT(\"can not convert this number\\n\");\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"cp_task.h\"\n#include <regex>\n\n#define BOOST_FILESYSTEM_NO_DEPRECATED\n#define BOOST_NO_CXX11_SCOPED_ENUMS\n#include <boost\/filesystem.hpp>\n\nnamespace fs = boost::filesystem;\n\nnamespace {\n\nvoid replace_substring(std::string &data, const std::string &from, const std::string &to)\n{\n\tstd::size_t pos = data.find(from);\n\twhile(pos != std::string::npos) {\n\t\tdata.replace(pos, from.size(), to);\n\t\tpos = data.find(from, pos + to.size());\n\t}\n}\n\nvoid escape_regex(std::string &regex)\n{\n\treplace_substring(regex, \"\\\\\", \"\\\\\\\\\");\n\treplace_substring(regex, \"^\", \"\\\\^\");\n\treplace_substring(regex, \".\", \"\\\\.\");\n\treplace_substring(regex, \"$\", \"\\\\$\");\n\treplace_substring(regex, \"|\", \"\\\\|\");\n\treplace_substring(regex, \"(\", \"\\\\(\");\n\treplace_substring(regex, \")\", \"\\\\)\");\n\treplace_substring(regex, \"[\", \"\\\\[\");\n\treplace_substring(regex, \"]\", \"\\\\]\");\n\treplace_substring(regex, \"*\", \"\\\\*\");\n\treplace_substring(regex, \"+\", \"\\\\+\");\n\treplace_substring(regex, \"?\", \"\\\\?\");\n\treplace_substring(regex, \"\/\", \"\\\\\/\");\n}\n\nstd::regex wildcards_regex(std::string wildcard_pattern)\n{\n\t\/\/ Escape all regex special chars\n\tescape_regex(wildcard_pattern);\n\n\t\/\/ Convert chars '*?' back to their regex equivalents\n\treplace_substring(wildcard_pattern, \"\\\\?\", \".\");\n\treplace_substring(wildcard_pattern, \"\\\\*\", \".*\");\n\n\treturn std::regex(wildcard_pattern);\n}\n\n} \/\/ namespace\n\n\ncp_task::cp_task(std::size_t id, std::shared_ptr<task_metadata> task_meta) : task_base(id, task_meta)\n{\n\tif (task_meta_->cmd_args.size() != 2) {\n\t\tthrow task_exception(\n\t\t\t\"Wrong number of arguments. Required: 2, Actual: \" + std::to_string(task_meta_->cmd_args.size()));\n\t}\n}\n\n\nstd::shared_ptr<task_results> cp_task::run()\n{\n\tstd::shared_ptr<task_results> result(new task_results());\n\n\t\/\/ Cannot use this normal variant due to bug in boost which\n\t\/\/ causes calling abort() instead of throwing an exception\n\t\/\/ try {\n\t\/\/ \tfs::copy(task_meta_->cmd_args[0], task_meta_->cmd_args[1]);\n\t\/\/ } catch (fs::filesystem_error &e) {\n\t\/\/ \tresult->status = task_status::FAILED;\n\t\/\/ \tresult->error_message = std::string(\"Cannot copy files. Error: \") + e.what();\n\t\/\/ }\n\n\t\/\/ Instead, following version seems to work fine\n\n\t\/\/ parse the input path and separate the last part\n\tfs::path input(task_meta_->cmd_args[0]);\n\tauto filename_matcher = input.filename().string();\n\tauto base_dir = input.remove_filename();\n\tauto pattern = wildcards_regex(filename_matcher);\n\n\t\/\/ parse output path and check if it is existing directory or not\n\tfs::path output(task_meta_->cmd_args[1]);\n\tbool output_is_dir = fs::is_directory(output);\n\n\tif (!fs::exists(base_dir)) {\n\t\tresult->status = task_status::FAILED;\n\t\tresult->error_message = \"Source directory '\" + base_dir.string() + \"' does not exist\";\n\t\treturn result;\n\t}\n\n\t\/\/ go through all items in base directory and copy matching items to result location\n\t\/\/ TODO: replace to range loop when boost is upgraded\n\tfs::directory_iterator end_itr;\n\tfor (fs::directory_iterator item(base_dir); item != end_itr; ++item) {\n\t\tif (regex_match(item->path().filename().string(), pattern)) {\n\t\t\tauto target = output_is_dir ? (output \/ item->path().filename()) : output;\n\t\t\tboost::system::error_code error_code;\n\t\t\tfs::copy(item->path(), target, error_code);\n\t\t\tif (error_code.value() != boost::system::errc::success) {\n\t\t\t\tresult->status = task_status::FAILED;\n\t\t\t\tresult->error_message = std::string(\"Cannot copy files. Error: \") + error_code.message();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n}\n<commit_msg>Copy task should be able to copy directories<commit_after>#include \"cp_task.h\"\n#include <regex>\n#include \"helpers\/filesystem.h\"\n\n#define BOOST_FILESYSTEM_NO_DEPRECATED\n#define BOOST_NO_CXX11_SCOPED_ENUMS\n#include <boost\/filesystem.hpp>\n\nnamespace fs = boost::filesystem;\n\nnamespace {\n\nvoid replace_substring(std::string &data, const std::string &from, const std::string &to)\n{\n\tstd::size_t pos = data.find(from);\n\twhile(pos != std::string::npos) {\n\t\tdata.replace(pos, from.size(), to);\n\t\tpos = data.find(from, pos + to.size());\n\t}\n}\n\nvoid escape_regex(std::string &regex)\n{\n\treplace_substring(regex, \"\\\\\", \"\\\\\\\\\");\n\treplace_substring(regex, \"^\", \"\\\\^\");\n\treplace_substring(regex, \".\", \"\\\\.\");\n\treplace_substring(regex, \"$\", \"\\\\$\");\n\treplace_substring(regex, \"|\", \"\\\\|\");\n\treplace_substring(regex, \"(\", \"\\\\(\");\n\treplace_substring(regex, \")\", \"\\\\)\");\n\treplace_substring(regex, \"[\", \"\\\\[\");\n\treplace_substring(regex, \"]\", \"\\\\]\");\n\treplace_substring(regex, \"*\", \"\\\\*\");\n\treplace_substring(regex, \"+\", \"\\\\+\");\n\treplace_substring(regex, \"?\", \"\\\\?\");\n\treplace_substring(regex, \"\/\", \"\\\\\/\");\n}\n\nstd::regex wildcards_regex(std::string wildcard_pattern)\n{\n\t\/\/ Escape all regex special chars\n\tescape_regex(wildcard_pattern);\n\n\t\/\/ Convert chars '*?' back to their regex equivalents\n\treplace_substring(wildcard_pattern, \"\\\\?\", \".\");\n\treplace_substring(wildcard_pattern, \"\\\\*\", \".*\");\n\n\treturn std::regex(wildcard_pattern);\n}\n\n} \/\/ namespace\n\n\ncp_task::cp_task(std::size_t id, std::shared_ptr<task_metadata> task_meta) : task_base(id, task_meta)\n{\n\tif (task_meta_->cmd_args.size() != 2) {\n\t\tthrow task_exception(\n\t\t\t\"Wrong number of arguments. Required: 2, Actual: \" + std::to_string(task_meta_->cmd_args.size()));\n\t}\n}\n\n\nstd::shared_ptr<task_results> cp_task::run()\n{\n\tstd::shared_ptr<task_results> result(new task_results());\n\n\t\/\/ Cannot use this normal variant due to bug in boost which\n\t\/\/ causes calling abort() instead of throwing an exception\n\t\/\/ try {\n\t\/\/ \tfs::copy(task_meta_->cmd_args[0], task_meta_->cmd_args[1]);\n\t\/\/ } catch (fs::filesystem_error &e) {\n\t\/\/ \tresult->status = task_status::FAILED;\n\t\/\/ \tresult->error_message = std::string(\"Cannot copy files. Error: \") + e.what();\n\t\/\/ }\n\n\t\/\/ Instead, following version seems to work fine\n\n\t\/\/ parse the input path and separate the last part\n\tfs::path input(task_meta_->cmd_args[0]);\n\tauto filename_matcher = input.filename().string();\n\tauto base_dir = input.remove_filename();\n\tauto pattern = wildcards_regex(filename_matcher);\n\n\t\/\/ parse output path and check if it is existing directory or not\n\tfs::path output(task_meta_->cmd_args[1]);\n\tbool output_is_dir = fs::is_directory(output);\n\n\tif (!fs::exists(base_dir)) {\n\t\tresult->status = task_status::FAILED;\n\t\tresult->error_message = \"Source directory '\" + base_dir.string() + \"' does not exist\";\n\t\treturn result;\n\t}\n\n\t\/\/ go through all items in base directory and copy matching items to result location\n\t\/\/ TODO: replace to range loop when boost is upgraded\n\tfs::directory_iterator end_itr;\n\tfor (fs::directory_iterator item(base_dir); item != end_itr; ++item) {\n\t\tif (regex_match(item->path().filename().string(), pattern)) {\n\t\t\tauto target = output_is_dir ? (output \/ item->path().filename()) : output;\n\t\t\tif (fs::is_directory(item->path())) {\n\t\t\t\thelpers::copy_directory(item->path(), target);\n\t\t\t} else {\n\t\t\t\tboost::system::error_code error_code;\n\t\t\t\tfs::copy(item->path(), target, error_code);\n\t\t\t\tif (error_code.value() != boost::system::errc::success) {\n\t\t\t\t\tresult->status = task_status::FAILED;\n\t\t\t\t\tresult->error_message = std::string(\"Cannot copy files. Error: \") + error_code.message();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2008 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\/\/ C++ includes\n#include \"libmesh_config.h\"\n\n#ifdef LIBMESH_HAVE_PETSC\n\n\/\/ Local includes\n#include \"petsc_matrix.h\"\n#include \"dof_map.h\"\n#include \"dense_matrix.h\"\n#include \"petsc_vector.h\"\n\nnamespace libMesh\n{\n\n\n\n\/\/-----------------------------------------------------------------------\n\/\/ PetscMatrix members\ntemplate <typename T>\nvoid PetscMatrix<T>::init (const unsigned int m,\n\t\t\t   const unsigned int n,\n\t\t\t   const unsigned int m_l,\n\t\t\t   const unsigned int n_l,\n\t\t\t   const unsigned int nnz,\n\t\t\t   const unsigned int noz)\n{\n  \/\/ We allow 0x0 matrices now\n  \/\/if ((m==0) || (n==0))\n  \/\/  return;\n\n  \/\/ Clear initialized matrices\n  if (this->initialized())\n    this->clear();\n\n  this->_is_initialized = true;\n\n  \n  int ierr     = 0;\n  int m_global = static_cast<int>(m);\n  int n_global = static_cast<int>(n);\n  int m_local  = static_cast<int>(m_l);\n  int n_local  = static_cast<int>(n_l);\n  int n_nz     = static_cast<int>(nnz);\n  int n_oz     = static_cast<int>(noz);\n  \n  \/\/ create a sequential matrix on one processor\n  if (libMesh::n_processors() == 1)\n    {\n      libmesh_assert ((m_l == m) && (n_l == n));\n\n      \/\/ Create matrix.  Revisit later to do preallocation and make more efficient\n      ierr = MatCreateSeqAIJ (libMesh::COMM_WORLD, m_global, n_global,\n\t\t\t      n_nz, PETSC_NULL, &_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatSetFromOptions (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  else\n    {\n      parallel_only();\n\n      ierr = MatCreateMPIAIJ (libMesh::COMM_WORLD, m_local, n_local, m_global, n_global,\n\t\t\t      n_nz, PETSC_NULL, n_oz, PETSC_NULL, &_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatSetFromOptions (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  this->zero ();\n}\n\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::init ()\n{\n  libmesh_assert (this->_dof_map != NULL);\n  \n  \/\/ Clear initialized matrices\n  if (this->initialized())\n    this->clear();\n\n  this->_is_initialized = true;\n\n  \n  const unsigned int m   = this->_dof_map->n_dofs();\n  const unsigned int n   = m;\n  const unsigned int n_l = this->_dof_map->n_dofs_on_processor(libMesh::processor_id()); \n  const unsigned int m_l = n_l;\n\n\n  const std::vector<unsigned int>& n_nz = this->_dof_map->get_n_nz();\n  const std::vector<unsigned int>& n_oz = this->_dof_map->get_n_oz();\n\n  \/\/ Make sure the sparsity pattern isn't empty unless the matrix is 0x0\n  libmesh_assert (n_nz.size() == n_l);\n  libmesh_assert (n_oz.size() == n_l);\n  \n  \/\/ We allow 0x0 matrices now\n  \/\/if (m==0)\n  \/\/  return;\n  \n  int ierr     = 0;\n  int m_global = static_cast<int>(m);\n  int n_global = static_cast<int>(n);\n  int m_local  = static_cast<int>(m_l);\n  int n_local  = static_cast<int>(n_l);\n\n\n  \/\/ create a sequential matrix on one processor\n  if (libMesh::n_processors() == 1)\n    {\n      libmesh_assert ((m_l == m) && (n_l == n));\n      if (n_nz.empty())\n        ierr = MatCreateSeqAIJ (libMesh::COMM_WORLD, n_global, n_global,\n\t\t\t        PETSC_NULL, (int*) PETSC_NULL, &_mat);\n      else\n        ierr = MatCreateSeqAIJ (libMesh::COMM_WORLD, n_global, n_global,\n\t\t\t        PETSC_NULL, (int*) &n_nz[0], &_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatSetFromOptions (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  else\n    {\n      parallel_only();\n\n      if (n_nz.empty())\n        ierr = MatCreateMPIAIJ (libMesh::COMM_WORLD,\n\t\t\t        m_local, n_local,\n\t\t\t        m_global, n_global,\n\t\t\t        PETSC_NULL, (int*) PETSC_NULL,\n\t\t\t        PETSC_NULL, (int*) PETSC_NULL, &_mat);\n      else\n        ierr = MatCreateMPIAIJ (libMesh::COMM_WORLD,\n\t\t\t        m_local, n_local,\n\t\t\t        m_global, n_global,\n\t\t\t        PETSC_NULL, (int*) &n_nz[0],\n\t\t\t        PETSC_NULL, (int*) &n_oz[0], &_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatSetFromOptions (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  this->zero();\n}\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::zero ()\n{\n  libmesh_assert (this->initialized());\n\n  semiparallel_only();\n  \n  int ierr=0;\n\n  ierr = MatZeroEntries(_mat);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\ntemplate <typename T>\nvoid PetscMatrix<T>::zero_rows (std::vector<int> & rows, T diag_value)\n{\n  libmesh_assert (this->initialized());\n\n  semiparallel_only();\n\n  int ierr=0;\n\n  if(!rows.empty())\n    ierr = MatZeroRows(_mat, rows.size(), &rows[0], diag_value);\n  else\n    ierr = MatZeroRows(_mat, 0, PETSC_NULL, diag_value);\n\n  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\ntemplate <typename T>\nvoid PetscMatrix<T>::clear ()\n{\n  int ierr=0;\n  \n  if ((this->initialized()) && (this->_destroy_mat_on_exit))\n    {\n      semiparallel_only();\n  \n      ierr = MatDestroy (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n      \n      this->_is_initialized = false;\n    }\n}\n\n\n\ntemplate <typename T>\nReal PetscMatrix<T>::l1_norm () const\n{\n  libmesh_assert (this->initialized());\n  \n  semiparallel_only();\n\n  int ierr=0;\n  PetscReal petsc_value;\n  Real value;\n  \n  libmesh_assert (this->closed());\n\n  ierr = MatNorm(_mat, NORM_1, &petsc_value);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  value = static_cast<Real>(petsc_value);\n\n  return value;\n}\n\n\n\ntemplate <typename T>\nReal PetscMatrix<T>::linfty_norm () const\n{\n  libmesh_assert (this->initialized());\n  \n  semiparallel_only();\n\n  int ierr=0;\n  PetscReal petsc_value;\n  Real value;\n  \n  libmesh_assert (this->closed());\n\n  ierr = MatNorm(_mat, NORM_INFINITY, &petsc_value);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  value = static_cast<Real>(petsc_value);\n\n  return value;\n}\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::print_matlab (const std::string name) const\n{\n  libmesh_assert (this->initialized());\n\n  semiparallel_only();\n\n  \/\/ libmesh_assert (this->closed());\n  this->close();\n  \n  int ierr=0; \n  PetscViewer petsc_viewer;\n\n\n  ierr = PetscViewerCreate (libMesh::COMM_WORLD,\n\t\t\t    &petsc_viewer);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  \/**\n   * Create an ASCII file containing the matrix\n   * if a filename was provided.  \n   *\/\n  if (name != \"NULL\")\n    {\n      ierr = PetscViewerASCIIOpen( libMesh::COMM_WORLD,\n\t\t\t\t   name.c_str(),\n\t\t\t\t   &petsc_viewer);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n      \n      ierr = PetscViewerSetFormat (petsc_viewer,\n\t\t\t\t   PETSC_VIEWER_ASCII_MATLAB);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatView (_mat, petsc_viewer);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  \/**\n   * Otherwise the matrix will be dumped to the screen.\n   *\/\n  else\n    {\n      ierr = PetscViewerSetFormat (PETSC_VIEWER_STDOUT_WORLD,\n\t\t\t\t   PETSC_VIEWER_ASCII_MATLAB);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatView (_mat, PETSC_VIEWER_STDOUT_WORLD);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n\n  \/**\n   * Destroy the viewer.\n   *\/\n  ierr = PetscViewerDestroy (petsc_viewer);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::add_matrix(const DenseMatrix<T>& dm,\n\t\t\t\tconst std::vector<unsigned int>& rows,\n\t\t\t\tconst std::vector<unsigned int>& cols)\n{\n  libmesh_assert (this->initialized());\n  \n  const unsigned int m = dm.m();\n  const unsigned int n = dm.n();\n\n  libmesh_assert (rows.size() == m);\n  libmesh_assert (cols.size() == n);\n  \n  int ierr=0;\n\n  \/\/ These casts are required for PETSc <= 2.1.5\n  ierr = MatSetValues(_mat,\n\t\t      m, (int*) &rows[0],\n\t\t      n, (int*) &cols[0],\n\t\t      (PetscScalar*) &dm.get_values()[0],\n\t\t      ADD_VALUES);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\n\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::_get_submatrix(SparseMatrix<T>& submatrix,\n\t\t\t\t    const std::vector<unsigned int> &rows,\n\t\t\t\t    const std::vector<unsigned int> &cols,\n\t\t\t\t    const bool reuse_submatrix) const\n{\n  \/\/ Can only extract submatrices from closed matrices\n  this->close();\n\n  \/\/ Make sure the SparseMatrix passed in is really a PetscMatrix\n  PetscMatrix<T>* petsc_submatrix = libmesh_cast_ptr<PetscMatrix<T>*>(&submatrix);\n\n  \/\/ If we're not reusing submatrix and submatrix is already initialized\n  \/\/ then we need to clear it, otherwise we get a memory leak.\n  if( !reuse_submatrix && submatrix.initialized() )\n    submatrix.clear();\n  \n  \/\/ Construct row and column index sets.\n  int ierr=0;\n  IS isrow, iscol;\n\n  ierr = ISCreateGeneral(libMesh::COMM_WORLD,\n\t\t\t rows.size(),\n\t\t\t (int*) &rows[0],\n\t\t\t &isrow); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  ierr = ISCreateGeneral(libMesh::COMM_WORLD,\n\t\t\t cols.size(),\n\t\t\t (int*) &cols[0],\n\t\t\t &iscol); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  \/\/ Extract submatrix\n#if !PETSC_VERSION_LESS_THAN(3,0,1) || !PETSC_VERSION_RELEASE\n  ierr = MatGetSubMatrix(_mat,\n\t\t\t isrow,\n\t\t\t iscol,\n\t\t\t (reuse_submatrix ? MAT_REUSE_MATRIX : MAT_INITIAL_MATRIX),\n\t\t\t &(petsc_submatrix->_mat));  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n#else\n  ierr = MatGetSubMatrix(_mat,\n\t\t\t isrow,\n\t\t\t iscol,\n\t\t\t PETSC_DECIDE,\n\t\t\t (reuse_submatrix ? MAT_REUSE_MATRIX : MAT_INITIAL_MATRIX),\n\t\t\t &(petsc_submatrix->_mat));  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n#endif\n\n  \/\/ Specify that the new submatrix is initialized and close it.\n  petsc_submatrix->_is_initialized = true;\n  petsc_submatrix->close();\n\n  \/\/ Clean up PETSc data structures\n  ierr = ISDestroy(isrow); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  ierr = ISDestroy(iscol); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::get_diagonal (NumericVector<T>& dest) const\n{\n  \/\/ Make sure the NumericVector passed in is really a PetscVector\n  PetscVector<T>& petsc_dest = libmesh_cast_ref<PetscVector<T>&>(dest);\n\n  \/\/ Call PETSc function.\n\n#if PETSC_VERSION_LESS_THAN(2,3,1)\n\n  libMesh::out << \"This method has been developed with PETSc 2.3.1.  \"\n\t        << \"No one has made it backwards compatible with older \"\n\t        << \"versions of PETSc so far; however, it might work \"\n\t        << \"without any change with some older version.\" << std::endl;\n  libmesh_error();\n\n#else\n\n  \/\/ Needs a const_cast since PETSc does not work with const.\n  int ierr =\n    MatGetDiagonal(const_cast<PetscMatrix<T>*>(this)->mat(),petsc_dest.vec()); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n#endif\n\n}\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::get_transpose (SparseMatrix<T>& dest) const\n{\n  \/\/ Make sure the SparseMatrix passed in is really a PetscMatrix\n  PetscMatrix<T>& petsc_dest = libmesh_cast_ref<PetscMatrix<T>&>(dest);\n\n  \/\/ If we aren't reusing the matrix then need to clear dest,\n  \/\/ otherwise we get a memory leak\n  if(&petsc_dest != this)\n    dest.clear();\n\n  int ierr;\n#if PETSC_VERSION_LESS_THAN(3,0,0)\n  if (&petsc_dest == this)\n    ierr = MatTranspose(_mat,PETSC_NULL);\n  else\n    ierr = MatTranspose(_mat,&petsc_dest._mat);\n  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n#else\n  \/\/ FIXME - we can probably use MAT_REUSE_MATRIX in more situations\n  if (&petsc_dest == this)\n    ierr = MatTranspose(_mat,MAT_REUSE_MATRIX,&petsc_dest._mat);\n  else\n    ierr = MatTranspose(_mat,MAT_INITIAL_MATRIX,&petsc_dest._mat);\n  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n#endif\n\n  \/\/ Specify that the transposed matrix is initialized and close it.\n  petsc_dest._is_initialized = true;\n  petsc_dest.close();\n}\n\n\n\n\/\/------------------------------------------------------------------\n\/\/ Explicit instantiations\ntemplate class PetscMatrix<Number>;\n\n} \/\/ namespace libMesh\n\n\n#endif \/\/ #ifdef LIBMESH_HAVE_PETSC\n<commit_msg>Fixed another rectangular PetscMatrix \"bug\" - this one is impossible to trigger as-is but might crop up if we change that constructor later.<commit_after>\/\/ $Id$\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2008 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\/\/ C++ includes\n#include \"libmesh_config.h\"\n\n#ifdef LIBMESH_HAVE_PETSC\n\n\/\/ Local includes\n#include \"petsc_matrix.h\"\n#include \"dof_map.h\"\n#include \"dense_matrix.h\"\n#include \"petsc_vector.h\"\n\nnamespace libMesh\n{\n\n\n\n\/\/-----------------------------------------------------------------------\n\/\/ PetscMatrix members\ntemplate <typename T>\nvoid PetscMatrix<T>::init (const unsigned int m,\n\t\t\t   const unsigned int n,\n\t\t\t   const unsigned int m_l,\n\t\t\t   const unsigned int n_l,\n\t\t\t   const unsigned int nnz,\n\t\t\t   const unsigned int noz)\n{\n  \/\/ We allow 0x0 matrices now\n  \/\/if ((m==0) || (n==0))\n  \/\/  return;\n\n  \/\/ Clear initialized matrices\n  if (this->initialized())\n    this->clear();\n\n  this->_is_initialized = true;\n\n  \n  int ierr     = 0;\n  int m_global = static_cast<int>(m);\n  int n_global = static_cast<int>(n);\n  int m_local  = static_cast<int>(m_l);\n  int n_local  = static_cast<int>(n_l);\n  int n_nz     = static_cast<int>(nnz);\n  int n_oz     = static_cast<int>(noz);\n  \n  \/\/ create a sequential matrix on one processor\n  if (libMesh::n_processors() == 1)\n    {\n      libmesh_assert ((m_l == m) && (n_l == n));\n\n      \/\/ Create matrix.  Revisit later to do preallocation and make more efficient\n      ierr = MatCreateSeqAIJ (libMesh::COMM_WORLD, m_global, n_global,\n\t\t\t      n_nz, PETSC_NULL, &_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatSetFromOptions (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  else\n    {\n      parallel_only();\n\n      ierr = MatCreateMPIAIJ (libMesh::COMM_WORLD, m_local, n_local, m_global, n_global,\n\t\t\t      n_nz, PETSC_NULL, n_oz, PETSC_NULL, &_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatSetFromOptions (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  this->zero ();\n}\n\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::init ()\n{\n  libmesh_assert (this->_dof_map != NULL);\n  \n  \/\/ Clear initialized matrices\n  if (this->initialized())\n    this->clear();\n\n  this->_is_initialized = true;\n\n  \n  const unsigned int m   = this->_dof_map->n_dofs();\n  const unsigned int n   = m;\n  const unsigned int n_l = this->_dof_map->n_dofs_on_processor(libMesh::processor_id()); \n  const unsigned int m_l = n_l;\n\n\n  const std::vector<unsigned int>& n_nz = this->_dof_map->get_n_nz();\n  const std::vector<unsigned int>& n_oz = this->_dof_map->get_n_oz();\n\n  \/\/ Make sure the sparsity pattern isn't empty unless the matrix is 0x0\n  libmesh_assert (n_nz.size() == n_l);\n  libmesh_assert (n_oz.size() == n_l);\n  \n  \/\/ We allow 0x0 matrices now\n  \/\/if (m==0)\n  \/\/  return;\n  \n  int ierr     = 0;\n  int m_global = static_cast<int>(m);\n  int n_global = static_cast<int>(n);\n  int m_local  = static_cast<int>(m_l);\n  int n_local  = static_cast<int>(n_l);\n\n\n  \/\/ create a sequential matrix on one processor\n  if (libMesh::n_processors() == 1)\n    {\n      libmesh_assert ((m_l == m) && (n_l == n));\n      if (n_nz.empty())\n        ierr = MatCreateSeqAIJ (libMesh::COMM_WORLD, m_global, n_global,\n\t\t\t        PETSC_NULL, (int*) PETSC_NULL, &_mat);\n      else\n        ierr = MatCreateSeqAIJ (libMesh::COMM_WORLD, m_global, n_global,\n\t\t\t        PETSC_NULL, (int*) &n_nz[0], &_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatSetFromOptions (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  else\n    {\n      parallel_only();\n\n      if (n_nz.empty())\n        ierr = MatCreateMPIAIJ (libMesh::COMM_WORLD,\n\t\t\t        m_local, n_local,\n\t\t\t        m_global, n_global,\n\t\t\t        PETSC_NULL, (int*) PETSC_NULL,\n\t\t\t        PETSC_NULL, (int*) PETSC_NULL, &_mat);\n      else\n        ierr = MatCreateMPIAIJ (libMesh::COMM_WORLD,\n\t\t\t        m_local, n_local,\n\t\t\t        m_global, n_global,\n\t\t\t        PETSC_NULL, (int*) &n_nz[0],\n\t\t\t        PETSC_NULL, (int*) &n_oz[0], &_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatSetFromOptions (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  this->zero();\n}\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::zero ()\n{\n  libmesh_assert (this->initialized());\n\n  semiparallel_only();\n  \n  int ierr=0;\n\n  ierr = MatZeroEntries(_mat);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\ntemplate <typename T>\nvoid PetscMatrix<T>::zero_rows (std::vector<int> & rows, T diag_value)\n{\n  libmesh_assert (this->initialized());\n\n  semiparallel_only();\n\n  int ierr=0;\n\n  if(!rows.empty())\n    ierr = MatZeroRows(_mat, rows.size(), &rows[0], diag_value);\n  else\n    ierr = MatZeroRows(_mat, 0, PETSC_NULL, diag_value);\n\n  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\ntemplate <typename T>\nvoid PetscMatrix<T>::clear ()\n{\n  int ierr=0;\n  \n  if ((this->initialized()) && (this->_destroy_mat_on_exit))\n    {\n      semiparallel_only();\n  \n      ierr = MatDestroy (_mat);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n      \n      this->_is_initialized = false;\n    }\n}\n\n\n\ntemplate <typename T>\nReal PetscMatrix<T>::l1_norm () const\n{\n  libmesh_assert (this->initialized());\n  \n  semiparallel_only();\n\n  int ierr=0;\n  PetscReal petsc_value;\n  Real value;\n  \n  libmesh_assert (this->closed());\n\n  ierr = MatNorm(_mat, NORM_1, &petsc_value);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  value = static_cast<Real>(petsc_value);\n\n  return value;\n}\n\n\n\ntemplate <typename T>\nReal PetscMatrix<T>::linfty_norm () const\n{\n  libmesh_assert (this->initialized());\n  \n  semiparallel_only();\n\n  int ierr=0;\n  PetscReal petsc_value;\n  Real value;\n  \n  libmesh_assert (this->closed());\n\n  ierr = MatNorm(_mat, NORM_INFINITY, &petsc_value);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  value = static_cast<Real>(petsc_value);\n\n  return value;\n}\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::print_matlab (const std::string name) const\n{\n  libmesh_assert (this->initialized());\n\n  semiparallel_only();\n\n  \/\/ libmesh_assert (this->closed());\n  this->close();\n  \n  int ierr=0; \n  PetscViewer petsc_viewer;\n\n\n  ierr = PetscViewerCreate (libMesh::COMM_WORLD,\n\t\t\t    &petsc_viewer);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  \/**\n   * Create an ASCII file containing the matrix\n   * if a filename was provided.  \n   *\/\n  if (name != \"NULL\")\n    {\n      ierr = PetscViewerASCIIOpen( libMesh::COMM_WORLD,\n\t\t\t\t   name.c_str(),\n\t\t\t\t   &petsc_viewer);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n      \n      ierr = PetscViewerSetFormat (petsc_viewer,\n\t\t\t\t   PETSC_VIEWER_ASCII_MATLAB);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatView (_mat, petsc_viewer);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n  \/**\n   * Otherwise the matrix will be dumped to the screen.\n   *\/\n  else\n    {\n      ierr = PetscViewerSetFormat (PETSC_VIEWER_STDOUT_WORLD,\n\t\t\t\t   PETSC_VIEWER_ASCII_MATLAB);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  \n      ierr = MatView (_mat, PETSC_VIEWER_STDOUT_WORLD);\n             CHKERRABORT(libMesh::COMM_WORLD,ierr);\n    }\n\n\n  \/**\n   * Destroy the viewer.\n   *\/\n  ierr = PetscViewerDestroy (petsc_viewer);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::add_matrix(const DenseMatrix<T>& dm,\n\t\t\t\tconst std::vector<unsigned int>& rows,\n\t\t\t\tconst std::vector<unsigned int>& cols)\n{\n  libmesh_assert (this->initialized());\n  \n  const unsigned int m = dm.m();\n  const unsigned int n = dm.n();\n\n  libmesh_assert (rows.size() == m);\n  libmesh_assert (cols.size() == n);\n  \n  int ierr=0;\n\n  \/\/ These casts are required for PETSc <= 2.1.5\n  ierr = MatSetValues(_mat,\n\t\t      m, (int*) &rows[0],\n\t\t      n, (int*) &cols[0],\n\t\t      (PetscScalar*) &dm.get_values()[0],\n\t\t      ADD_VALUES);\n         CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\n\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::_get_submatrix(SparseMatrix<T>& submatrix,\n\t\t\t\t    const std::vector<unsigned int> &rows,\n\t\t\t\t    const std::vector<unsigned int> &cols,\n\t\t\t\t    const bool reuse_submatrix) const\n{\n  \/\/ Can only extract submatrices from closed matrices\n  this->close();\n\n  \/\/ Make sure the SparseMatrix passed in is really a PetscMatrix\n  PetscMatrix<T>* petsc_submatrix = libmesh_cast_ptr<PetscMatrix<T>*>(&submatrix);\n\n  \/\/ If we're not reusing submatrix and submatrix is already initialized\n  \/\/ then we need to clear it, otherwise we get a memory leak.\n  if( !reuse_submatrix && submatrix.initialized() )\n    submatrix.clear();\n  \n  \/\/ Construct row and column index sets.\n  int ierr=0;\n  IS isrow, iscol;\n\n  ierr = ISCreateGeneral(libMesh::COMM_WORLD,\n\t\t\t rows.size(),\n\t\t\t (int*) &rows[0],\n\t\t\t &isrow); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  ierr = ISCreateGeneral(libMesh::COMM_WORLD,\n\t\t\t cols.size(),\n\t\t\t (int*) &cols[0],\n\t\t\t &iscol); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n  \/\/ Extract submatrix\n#if !PETSC_VERSION_LESS_THAN(3,0,1) || !PETSC_VERSION_RELEASE\n  ierr = MatGetSubMatrix(_mat,\n\t\t\t isrow,\n\t\t\t iscol,\n\t\t\t (reuse_submatrix ? MAT_REUSE_MATRIX : MAT_INITIAL_MATRIX),\n\t\t\t &(petsc_submatrix->_mat));  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n#else\n  ierr = MatGetSubMatrix(_mat,\n\t\t\t isrow,\n\t\t\t iscol,\n\t\t\t PETSC_DECIDE,\n\t\t\t (reuse_submatrix ? MAT_REUSE_MATRIX : MAT_INITIAL_MATRIX),\n\t\t\t &(petsc_submatrix->_mat));  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n#endif\n\n  \/\/ Specify that the new submatrix is initialized and close it.\n  petsc_submatrix->_is_initialized = true;\n  petsc_submatrix->close();\n\n  \/\/ Clean up PETSc data structures\n  ierr = ISDestroy(isrow); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n  ierr = ISDestroy(iscol); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n}\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::get_diagonal (NumericVector<T>& dest) const\n{\n  \/\/ Make sure the NumericVector passed in is really a PetscVector\n  PetscVector<T>& petsc_dest = libmesh_cast_ref<PetscVector<T>&>(dest);\n\n  \/\/ Call PETSc function.\n\n#if PETSC_VERSION_LESS_THAN(2,3,1)\n\n  libMesh::out << \"This method has been developed with PETSc 2.3.1.  \"\n\t        << \"No one has made it backwards compatible with older \"\n\t        << \"versions of PETSc so far; however, it might work \"\n\t        << \"without any change with some older version.\" << std::endl;\n  libmesh_error();\n\n#else\n\n  \/\/ Needs a const_cast since PETSc does not work with const.\n  int ierr =\n    MatGetDiagonal(const_cast<PetscMatrix<T>*>(this)->mat(),petsc_dest.vec()); CHKERRABORT(libMesh::COMM_WORLD,ierr);\n\n#endif\n\n}\n\n\n\ntemplate <typename T>\nvoid PetscMatrix<T>::get_transpose (SparseMatrix<T>& dest) const\n{\n  \/\/ Make sure the SparseMatrix passed in is really a PetscMatrix\n  PetscMatrix<T>& petsc_dest = libmesh_cast_ref<PetscMatrix<T>&>(dest);\n\n  \/\/ If we aren't reusing the matrix then need to clear dest,\n  \/\/ otherwise we get a memory leak\n  if(&petsc_dest != this)\n    dest.clear();\n\n  int ierr;\n#if PETSC_VERSION_LESS_THAN(3,0,0)\n  if (&petsc_dest == this)\n    ierr = MatTranspose(_mat,PETSC_NULL);\n  else\n    ierr = MatTranspose(_mat,&petsc_dest._mat);\n  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n#else\n  \/\/ FIXME - we can probably use MAT_REUSE_MATRIX in more situations\n  if (&petsc_dest == this)\n    ierr = MatTranspose(_mat,MAT_REUSE_MATRIX,&petsc_dest._mat);\n  else\n    ierr = MatTranspose(_mat,MAT_INITIAL_MATRIX,&petsc_dest._mat);\n  CHKERRABORT(libMesh::COMM_WORLD,ierr);\n#endif\n\n  \/\/ Specify that the transposed matrix is initialized and close it.\n  petsc_dest._is_initialized = true;\n  petsc_dest.close();\n}\n\n\n\n\/\/------------------------------------------------------------------\n\/\/ Explicit instantiations\ntemplate class PetscMatrix<Number>;\n\n} \/\/ namespace libMesh\n\n\n#endif \/\/ #ifdef LIBMESH_HAVE_PETSC\n<|endoftext|>"}
{"text":"<commit_before>#include <sirius.h>\n\nusing namespace sirius;\n\nextern \"C\" void randomize_on_gpu(double* ptr, size_t size);\n\nvoid test()\n{\n    int N = 500;\n    int K = 30000;\n    mdarray<double_complex, 2> A(N, K);\n    mdarray<double_complex, 2> B(K, N);\n    mdarray<double_complex, 2> C(N, N);\n\n    for (int j = 0; j < K; j++)\n    {\n        for (int i = 0; i < N; i++)\n        {\n            A(i, j) = 1.0;\n            B(j, i) = 1.0;\n        }\n    }\n    blas<cpu>::gemm(0, 0, N, N, K, A.at<cpu>(), A.ld(), B.at<cpu>(), B.ld(), C.at<cpu>(), C.ld());\n    Platform::comm_world().allreduce(C.ptr(), (int)C.size());\n\n    std::cout << C(0, 0) << \" \" << C(N - 1, N - 1) << std::endl;\n\n    A.allocate_on_device();\n    A.copy_to_device();\n    B.allocate_on_device();\n    B.copy_to_device();\n    C.allocate_on_device();\n\n    blas<gpu>::gemm(0, 0, N, N, K, A.at<gpu>(), A.ld(), B.at<gpu>(), B.ld(), C.at<gpu>(), C.ld());\n    Platform::comm_world().allreduce(C.at<gpu>(), (int)C.size());\n    C.copy_to_host();\n\n    std::cout << C(0, 0) << \" \" << C(N - 1, N - 1) << std::endl;\n}\n\nvoid test1()\n{\n    mdarray<double_complex, 1> A(1000000);\n    A.allocate_on_device();\n    randomize_on_gpu((double*)A.at<gpu>(), A.size() * 2);\n\n    A.copy_to_host();\n    Platform::comm_world().allreduce(A.at<cpu>(), (int)A.size());\n    \n    mdarray<double_complex, 1> A_ref(1000000);\n    A >> A_ref;\n\n    Platform::comm_world().allreduce(A.at<gpu>(), (int)A.size());\n    A.copy_to_host();\n\n    for (int i = 0; i < 1000000; i++)\n    {\n        double d = std::abs(A(i) - A_ref(i));\n        if (d > 1e-8) INFO << \"i=\" << i << \" diff=\" << d << std::endl;\n    }\n}\n\nint main(int argn, char** argv)\n{\n    Platform::initialize(1);\n    test();\n    test1();\n    Platform::finalize();\n}\n<commit_msg>better test of gpudirect<commit_after>#include <sirius.h>\n\nusing namespace sirius;\n\nextern \"C\" void randomize_on_gpu(double* ptr, size_t size);\n\nvoid test1()\n{\n    int N = 1000;\n    int K = 10000;\n    mdarray<double_complex, 2> A(N, K);\n    mdarray<double_complex, 2> B(K, N);\n    mdarray<double_complex, 2> C(N, N);\n\n    for (int j = 0; j < K; j++)\n    {\n        for (int i = 0; i < N; i++)\n        {\n            A(i, j) = double_complex(1, 1);\n            B(j, i) = double_complex(1, 1);\n        }\n    }\n    A.allocate_on_device();\n    A.copy_to_device();\n    B.allocate_on_device();\n    B.copy_to_device();\n    C.allocate_on_device();\n\n    blas<gpu>::gemm(0, 0, N, N, K, A.at<gpu>(), A.ld(), B.at<gpu>(), B.ld(), C.at<gpu>(), C.ld());\n    Platform::comm_world().allreduce(C.at<gpu>(), (int)C.size());\n    C.copy_to_host();\n    \n    int nerr = 0;\n    for (int i = 0; i < N; i++)\n    {\n        for (int j = 0; j < N; j++)\n        {\n            if (std::abs(C(i, j) - double_complex(0, 2 * K * Platform::comm_world().size())) > 1e-12) nerr++;\n        }\n    }\n\n    if (nerr)\n    {\n        printf(\"test1, number of errors: %i\\n\", nerr);\n    }\n    else\n    {\n        printf(\"test1 passed!\\n\");\n    }\n}\n\nvoid test2()\n{\n    int N = 1000000;\n\n    mdarray<double_complex, 1> A(N);\n    A.allocate_on_device();\n    for (int i = 0; i < N; i++) A(i) = double_complex(1, 1);\n\n    A.copy_to_device();\n    Platform::comm_world().allreduce(A.at<gpu>(), (int)A.size());\n    A.copy_to_host();\n\n    int nerr = 0;\n    for (int i = 0; i < N; i++)\n    {\n        double d = std::abs(A(i) - double_complex(Platform::comm_world().size(), Platform::comm_world().size()));\n        if (d > 1e-12) nerr++;\n    }\n\n    if (nerr)\n    {\n        printf(\"test2, number of errors: %i\\n\", nerr);\n    }\n    else\n    {\n        printf(\"test2 passed!\\n\");\n    }\n}\n\nvoid test3()\n{\n    mdarray<double_complex, 1> A(1000000);\n    A.allocate_on_device();\n    randomize_on_gpu((double*)A.at<gpu>(), A.size() * 2);\n\n    \n\n    A.copy_to_host();\n    Platform::comm_world().allreduce(A.at<cpu>(), (int)A.size());\n    \n    mdarray<double_complex, 1> A_ref(1000000);\n    A >> A_ref;\n\n    Platform::comm_world().allreduce(A.at<gpu>(), (int)A.size());\n    A.copy_to_host();\n\n    for (int i = 0; i < 1000000; i++)\n    {\n        double d = std::abs(A(i) - A_ref(i));\n        if (d > 1e-8) INFO << \"i=\" << i << \" diff=\" << d << std::endl;\n    }\n}\n\nint main(int argn, char** argv)\n{\n    Platform::initialize(1);\n    test1();\n    test2();\n    test3();\n    test1();\n    test2();\n    test3();\n    Platform::finalize();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"apps_starter.h\"\n\nstd::vector<job> apps_vect;\t\t\t\/\/ Определение вектора запущенных программ\nstruct termios hos_tmode;\t\t\t\/\/ настройки терминала для hos\n\nvoid sighandler(int signo)\n{\n\tif (signo == SIGTSTP) {\n\n\t}\n\n\tif (signo == SIGINT) {\n\t\t\n\t}\n}\n\nvoid init_signals()\n{\n\tsignal(SIGINT, &sighandler);\n\tsignal(SIGTSTP, &sighandler);\n\tsignal(SIGTTIN, SIG_IGN);\n\tsignal(SIGTTOU, SIG_IGN);\n}\n\nint app_start(int number_of_app, char** argv) {\n\tstd::string name_app\t= configurator(APPS_FILE, str(number_of_app) + \"_app_launcher\", \"\", false);\n\tstd::string path_to_dir\t= configurator(APPS_FILE, str(number_of_app) + \"_app_path\", \"\", false);\n\terase();\n\tendwin();\n\n\tint\t\tstatus;\n\tpid_t\tchpid\t= fork();\n\n\tjob j = {\n\t\t.name = name_app,\n\t\t.pid = chpid\n\t};\n\n\tj.running = true;\n\n\tapps_vect.insert(apps_vect.end(), j);\n\n\tif (chpid == 0) {\n\t\tsignal(SIGTTIN, SIG_IGN);\n\t\tsignal(SIGTTOU, SIG_IGN);\n\t\ttcsetpgrp(STDIN_FILENO, getpid());\n\t\tchdir(path_to_dir.c_str());\n\t\tsetpgid(getpid(), getpid());\t\t\t \t\/\/ Создаём группу процессов\n\t\tif (execl(name_app.c_str(), \"\", NULL) == -1) \t\/\/ parent process\n\t\t\texit(0);\n\t} else {\n\t\twaitpid(chpid, &status,WUNTRACED);\n\t\ttcsetpgrp(STDIN_FILENO, getpid());\n\t\ttcgetattr(STDIN_FILENO, &j.tmode);\n\t\ttcsetattr(STDIN_FILENO, TCSADRAIN, &hos_tmode);\n\t\tinit_display();\n\t\tinit_color();\n\t}\n\treturn 0;\n}<commit_msg>fg interface<commit_after>#include \"apps_starter.h\"\n\nstd::vector<job> apps_vect;\t\t\t\/\/ Определение вектора запущенных программ\nstruct termios hos_tmode;\t\t\t\/\/ настройки терминала для hos\n\nvoid sighandler(int signo)\n{\n\tif (signo == SIGTSTP) {\n\n\t}\n\n\tif (signo == SIGINT) {\n\t\t\n\t}\n}\n\nvoid fg_job(pid_t pid)\n{\n\t\n}\n\nvoid init_signals()\n{\n\tsignal(SIGINT, &sighandler);\n\tsignal(SIGTSTP, &sighandler);\n\tsignal(SIGTTIN, SIG_IGN);\n\tsignal(SIGTTOU, SIG_IGN);\n}\n\nint app_start(int number_of_app, char** argv) {\n\tstd::string name_app\t= configurator(APPS_FILE, str(number_of_app) + \"_app_launcher\", \"\", false);\n\tstd::string path_to_dir\t= configurator(APPS_FILE, str(number_of_app) + \"_app_path\", \"\", false);\n\terase();\n\tendwin();\n\n\tint\t\tstatus;\n\tpid_t\tchpid\t= fork();\n\n\tjob j = {\n\t\t.name = name_app,\n\t\t.pid = chpid\n\t};\n\n\tj.running = true;\n\n\t\/\/ Помещаем процесс в список запущенных процессов\n\tapps_vect.insert(apps_vect.end(), j);\n\n\tif (chpid == 0) {\n\t\tsignal(SIGTTIN, SIG_IGN);\n\t\tsignal(SIGTTOU, SIG_IGN);\n\t\ttcsetpgrp(STDIN_FILENO, getpid());\n\t\tchdir(path_to_dir.c_str());\n\t\tsetpgid(getpid(), getpid());\t\t\t \t\/\/ Создаём группу процессов\n\t\tif (execl(name_app.c_str(), \"\", NULL) == -1) \t\/\/ parent process\n\t\t\texit(0);\n\t} else {\n\t\twaitpid(chpid, &status,WUNTRACED);\n\t\ttcsetpgrp(STDIN_FILENO, getpid());\n\t\ttcgetattr(STDIN_FILENO, &j.tmode);\n\t\ttcsetattr(STDIN_FILENO, TCSADRAIN, &hos_tmode);\n\n\t\tif (WIFSTOPPED(status)) {\t\/* Если процесс был остановлен во время выполнения *\/\n\t\t\tapps_vect.back().running = false;\n\t\t}\n\n\t\tinit_display();\n\t\tinit_color();\n\t}\n\treturn 0;\n}<|endoftext|>"}
{"text":"<commit_before><commit_msg>odb: make corner IO cells not auto placeable<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-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 <pubkey.h>\n#include <script\/interpreter.h>\n#include <streams.h>\n#include <util\/memory.h>\n#include <version.h>\n\n#include <test\/fuzz\/fuzz.h>\n\n\/** Flags that are not forbidden by an assert *\/\nstatic bool IsValidFlagCombination(unsigned flags);\n\nvoid initialize()\n{\n    static const auto verify_handle = MakeUnique<ECCVerifyHandle>();\n}\n\nvoid test_one_input(const std::vector<uint8_t>& buffer)\n{\n    CDataStream ds(buffer, SER_NETWORK, INIT_PROTO_VERSION);\n    try {\n        int nVersion;\n        ds >> nVersion;\n        ds.SetVersion(nVersion);\n    } catch (const std::ios_base::failure&) {\n        return;\n    }\n\n    try {\n        const CTransaction tx(deserialize, ds);\n\n        unsigned int verify_flags;\n        ds >> verify_flags;\n\n        if (!IsValidFlagCombination(verify_flags)) return;\n\n        unsigned int fuzzed_flags;\n        ds >> fuzzed_flags;\n\n        std::vector<CTxOut> spent_outputs;\n        for (unsigned i = 0; i < tx.vin.size(); ++i) {\n            CTxOut prevout;\n            ds >> prevout;\n            if (!MoneyRange(prevout.nValue)) {\n                \/\/ prevouts should be consensus-valid\n                prevout.nValue = 1;\n            }\n            spent_outputs.push_back(prevout);\n        }\n        PrecomputedTransactionData txdata;\n        txdata.Init(tx, std::move(spent_outputs));\n\n        for (unsigned i = 0; i < tx.vin.size(); ++i) {\n            const CTxOut& prevout = txdata.m_spent_outputs.at(i);\n            const TransactionSignatureChecker checker{&tx, i, prevout.nValue, txdata};\n\n            ScriptError serror;\n            const bool ret = VerifyScript(tx.vin.at(i).scriptSig, prevout.scriptPubKey, verify_flags, checker, &serror);\n            assert(ret == (serror == SCRIPT_ERR_OK));\n\n            \/\/ Verify that removing flags from a passing test or adding flags to a failing test does not change the result\n            if (ret) {\n                verify_flags &= ~fuzzed_flags;\n            } else {\n                verify_flags |= fuzzed_flags;\n            }\n            if (!IsValidFlagCombination(verify_flags)) return;\n\n            ScriptError serror_fuzzed;\n            const bool ret_fuzzed = VerifyScript(tx.vin.at(i).scriptSig, prevout.scriptPubKey, verify_flags, checker, &serror_fuzzed);\n            assert(ret_fuzzed == (serror_fuzzed == SCRIPT_ERR_OK));\n\n            assert(ret_fuzzed == ret);\n        }\n    } catch (const std::ios_base::failure&) {\n        return;\n    }\n}\n\nstatic bool IsValidFlagCombination(unsigned flags)\n{\n    if (flags & SCRIPT_VERIFY_CLEANSTACK && ~flags & SCRIPT_VERIFY_P2SH) return false;\n    return true;\n}\n<commit_msg>fuzz: revert PrecomputedTransactionData backport introduced in dash#4435<commit_after>\/\/ Copyright (c) 2009-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 <pubkey.h>\n#include <script\/interpreter.h>\n#include <streams.h>\n#include <util\/memory.h>\n#include <version.h>\n\n#include <test\/fuzz\/fuzz.h>\n\n\/** Flags that are not forbidden by an assert *\/\nstatic bool IsValidFlagCombination(unsigned flags);\n\nvoid initialize()\n{\n    static const auto verify_handle = MakeUnique<ECCVerifyHandle>();\n}\n\nvoid test_one_input(const std::vector<uint8_t>& buffer)\n{\n    CDataStream ds(buffer, SER_NETWORK, INIT_PROTO_VERSION);\n    try {\n        int nVersion;\n        ds >> nVersion;\n        ds.SetVersion(nVersion);\n    } catch (const std::ios_base::failure&) {\n        return;\n    }\n\n    try {\n        const CTransaction tx(deserialize, ds);\n        const PrecomputedTransactionData txdata(tx);\n\n        unsigned int verify_flags;\n        ds >> verify_flags;\n\n        if (!IsValidFlagCombination(verify_flags)) return;\n\n        unsigned int fuzzed_flags;\n        ds >> fuzzed_flags;\n\n        for (unsigned i = 0; i < tx.vin.size(); ++i) {\n            CTxOut prevout;\n            ds >> prevout;\n            if (!MoneyRange(prevout.nValue)) {\n                \/\/ prevouts should be consensus-valid\n                prevout.nValue = 1;\n            }\n\n            const TransactionSignatureChecker checker{&tx, i, prevout.nValue, txdata};\n\n            ScriptError serror;\n            const bool ret = VerifyScript(tx.vin.at(i).scriptSig, prevout.scriptPubKey, verify_flags, checker, &serror);\n            assert(ret == (serror == SCRIPT_ERR_OK));\n\n            \/\/ Verify that removing flags from a passing test or adding flags to a failing test does not change the result\n            if (ret) {\n                verify_flags &= ~fuzzed_flags;\n            } else {\n                verify_flags |= fuzzed_flags;\n            }\n            if (!IsValidFlagCombination(verify_flags)) return;\n\n            ScriptError serror_fuzzed;\n            const bool ret_fuzzed = VerifyScript(tx.vin.at(i).scriptSig, prevout.scriptPubKey, verify_flags, checker, &serror_fuzzed);\n            assert(ret_fuzzed == (serror_fuzzed == SCRIPT_ERR_OK));\n\n            assert(ret_fuzzed == ret);\n        }\n    } catch (const std::ios_base::failure&) {\n        return;\n    }\n}\n\nstatic bool IsValidFlagCombination(unsigned flags)\n{\n    if (flags & SCRIPT_VERIFY_CLEANSTACK && ~flags & SCRIPT_VERIFY_P2SH) return false;\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ test base bloom filter\n#include \"catch.hpp\"\n\n#include \"BaseBloomFilter.hpp\"\n\n\/\/ define main\n\nTEST_CASE( \"testing BaseBloomFilter\", \"[bae_bloom_filter]\" ) {\n\tBaseBloomFilter bf(20);\n\tREQUIRE(bf.get_bit_count() == 1024 * 1024 * 32 * 10);\n\tREQUIRE(bf.get_hash_count() == 2);\n\tCHECK(bf.get_inserted_count() == 0);\n}<commit_msg>added a test for BaseBloomFitler<commit_after>\/\/ test base bloom filter\n#include \"catch.hpp\"\n\n#include \"BaseBloomFilter.hpp\"\n\n\/\/ define main\n\nTEST_CASE( \"testing BaseBloomFilter\", \"[base_bloom_filter]\" ) {\n\tBaseBloomFilter bf(20);\n\tREQUIRE(bf.get_bit_count() == 1024 * 1024 * 32 * 10);\n\tREQUIRE(bf.get_hash_count() == 2);\n\tCHECK(bf.get_inserted_count() == 0);\n}\n\nTEST_CASE( \"testing add BaseBloomFilter\", \"[base_bloom_filter]\" ) {\n\tBaseBloomFilter bf(20);\n\tsize_t expected_size = 1024 * 1024 * 32 * 10;\n\t\n\tbf.add(1);\n\tREQUIRE(bf.get_bit_count() == expected_size);\n\tREQUIRE(bf.get_hash_count() == 2);\n\tREQUIRE(bf.get_inserted_count() == 1);\n}\n\nTEST_CASE( \"testing contains BaseBloomFilter\", \"[base_bloom_filter]\" ) {\n\tBaseBloomFilter bf(20);\n\tsize_t expected_size = 1024 * 1024 * 32 * 10;\n\t\n\tbf.add(1);\n\tREQUIRE(bf.get_bit_count() == expected_size);\n\tREQUIRE(bf.contains(1));\n\t\/\/ should not expect this collision since the BF so far is empty (except \n\t\/\/ for 1 bit)\n\tREQUIRE(!bf.contains(0) );\n}\n\nTEST_CASE( \"testing populate BaseBloomFilter\", \"[base_bloom_filter]\" ) {\n\tBaseBloomFilter bf(20);\n\tsize_t expected_size = 1024 * 1024 * 32 * 10;\n\tunordered_set<kmer_t> kmers;\n\tfor (int i = 0; i < 1000; i++)\n\t\tkmers.emplace(i);\n\n\tbf.populate(kmers);\n\tREQUIRE(bf.get_bit_count() == expected_size);\n\tfor (const auto & item : kmers)\n\t\tREQUIRE(bf.contains(item));\n\tREQUIRE(bf.get_inserted_count() == kmers.size());\n}<|endoftext|>"}
{"text":"<commit_before>#include <fstream>\n#include <util\/exceptions.h>\n#include <util\/Logger.h>\n#include \"GoldStandardFileReader.h\"\n\nlogger::LogChannel goldstandardfilereaderlog(\"goldstandardfilereaderlog\", \"[GoldStandardFileReader] \");\n\nGoldStandardFileReader::GoldStandardFileReader(const std::string& filename) :\n\t\t_filename(filename) {\n\n\tregisterInput(_allSegments, \"all segments\");\n\tregisterOutput(_goldStandard, \"gold standard\");\n}\n\nvoid\nGoldStandardFileReader::updateOutputs() {\n\n\t\/\/ get the hashes of all gold-standard segments\n\n\tstd::set<SegmentHash> goldStandardSegmentHashes;\n\tstd::set<SegmentHash> otherSegmentHashes;\n\n\tstd::ifstream file(_filename.c_str());\n\n\tif (!file.good()) {\n\n\t\tUTIL_THROW_EXCEPTION(\n\t\t\t\tUsageError,\n\t\t\t\t\"could not open \" << _filename << \" to read the gold-standard hashes -- please make sure you created them beforehand!\");\n\t}\n\n\twhile (file.good()) {\n\n\t\tstd::string line;\n\t\tstd::getline(file, line);\n\n\t\tif (line.empty())\n\t\t\tcontinue;\n\n\t\tstd::size_t hashStart = line.find_first_of('#');\n\n\t\t\/\/ is it a gold-standard segment? it is a gold-standard segment if there \n\t\t\/\/ is a '1' before the '#'\n\t\tstd::size_t firstOne = line.find_first_of('1');\n\t\tbool isGoldStandard = (firstOne < hashStart);\n\n\t\tif (hashStart != std::string::npos) {\n\n\t\t\tstd::string hashString = line.substr(hashStart);\n\n\t\t\t\/\/ strip any leading non-number\n\t\t\tstd::size_t firstDigit = hashString.find_first_of(\"0123456789\");\n\t\t\thashString = hashString.substr(firstDigit);\n\n\t\t\tSegmentHash hash = boost::lexical_cast<SegmentHash>(hashString);\n\n\t\t\tif (isGoldStandard)\n\t\t\t\tgoldStandardSegmentHashes.insert(hash);\n\t\t\telse\n\t\t\t\totherSegmentHashes.insert(hash);\n\n\t\t} else {\n\n\t\t\tUTIL_THROW_EXCEPTION(\n\t\t\t\t\tUsageError,\n\t\t\t\t\t_filename << \" does not contain a hash value in line '\" << line << \"'\");\n\t\t}\n\t}\n\n\t\/\/ collect all gold-standard segments\n\n\tif (!_goldStandard)\n\t\t_goldStandard = new Segments();\n\telse\n\t\t_goldStandard->clear();\n\n\tforeach (boost::shared_ptr<EndSegment> segment, _allSegments->getEnds())\n\t\tif (goldStandardSegmentHashes.count(segment->hashValue()))\n\t\t\t_goldStandard->add(segment);\n\t\telse if (!otherSegmentHashes.count(segment->hashValue())) {\n\n\t\t\tLOG_ERROR(goldstandardfilereaderlog)\n\t\t\t\t\t<< \"end segment \" << segment->getId()\n\t\t\t\t\t<< \" in ISI \" << segment->getInterSectionInterval()\n\t\t\t\t\t<< \" is not contained in \"\n\t\t\t\t\t<< _filename << std::endl;\n\t\t}\n\tforeach (boost::shared_ptr<ContinuationSegment> segment, _allSegments->getContinuations())\n\t\tif (goldStandardSegmentHashes.count(segment->hashValue()))\n\t\t\t_goldStandard->add(segment);\n\t\telse if (!otherSegmentHashes.count(segment->hashValue())) {\n\n\t\t\tLOG_ERROR(goldstandardfilereaderlog)\n\t\t\t\t\t<< \"continuation segment \" << segment->getId()\n\t\t\t\t\t<< \" in ISI \" << segment->getInterSectionInterval()\n\t\t\t\t\t<< \" is not contained in \"\n\t\t\t\t\t<< _filename << std::endl;\n\t\t}\n\tforeach (boost::shared_ptr<BranchSegment> segment, _allSegments->getBranches())\n\t\tif (goldStandardSegmentHashes.count(segment->hashValue()))\n\t\t\t_goldStandard->add(segment);\n\t\telse if (!otherSegmentHashes.count(segment->hashValue())) {\n\n\t\t\tLOG_ERROR(goldstandardfilereaderlog)\n\t\t\t\t\t<< \"branch segment \" << segment->getId()\n\t\t\t\t\t<< \" in ISI \" << segment->getInterSectionInterval()\n\t\t\t\t\t<< \" is not contained in \"\n\t\t\t\t\t<< _filename << std::endl;\n\t\t}\n\n\tLOG_USER(goldstandardfilereaderlog)\n\t\t\t<< \"collected \" << _goldStandard->size()\n\t\t\t<< \" segments in gold-standard\" << std::endl;\n}\n<commit_msg>added end segments to first and last slices in GoldStandardFileReader to ensure consistent solution<commit_after>#include <fstream>\n#include <util\/exceptions.h>\n#include <util\/Logger.h>\n#include \"GoldStandardFileReader.h\"\n\nlogger::LogChannel goldstandardfilereaderlog(\"goldstandardfilereaderlog\", \"[GoldStandardFileReader] \");\n\nGoldStandardFileReader::GoldStandardFileReader(const std::string& filename) :\n\t\t_filename(filename) {\n\n\tregisterInput(_allSegments, \"all segments\");\n\tregisterOutput(_goldStandard, \"gold standard\");\n}\n\nvoid\nGoldStandardFileReader::updateOutputs() {\n\n\tif (_allSegments->size() == 0)\n\t\tUTIL_THROW_EXCEPTION(\n\t\t\t\tUsageError,\n\t\t\t\t\"given segment set is empty\");\n\n\t\/\/ get the hashes of all gold-standard segments\n\n\tstd::set<SegmentHash> goldStandardSegmentHashes;\n\tstd::set<SegmentHash> otherSegmentHashes;\n\n\tstd::ifstream file(_filename.c_str());\n\n\tif (!file.good()) {\n\n\t\tUTIL_THROW_EXCEPTION(\n\t\t\t\tUsageError,\n\t\t\t\t\"could not open \" << _filename << \" to read the gold-standard hashes -- please make sure you created them beforehand!\");\n\t}\n\n\twhile (file.good()) {\n\n\t\tstd::string line;\n\t\tstd::getline(file, line);\n\n\t\tif (line.empty())\n\t\t\tcontinue;\n\n\t\tstd::size_t hashStart = line.find_first_of('#');\n\n\t\t\/\/ is it a gold-standard segment? it is a gold-standard segment if there \n\t\t\/\/ is a '1' before the '#'\n\t\tstd::size_t firstOne = line.find_first_of('1');\n\t\tbool isGoldStandard = (firstOne < hashStart);\n\n\t\tif (hashStart != std::string::npos) {\n\n\t\t\tstd::string hashString = line.substr(hashStart);\n\n\t\t\t\/\/ strip any leading non-number\n\t\t\tstd::size_t firstDigit = hashString.find_first_of(\"0123456789\");\n\t\t\thashString = hashString.substr(firstDigit);\n\n\t\t\tSegmentHash hash = boost::lexical_cast<SegmentHash>(hashString);\n\n\t\t\tif (isGoldStandard)\n\t\t\t\tgoldStandardSegmentHashes.insert(hash);\n\t\t\telse\n\t\t\t\totherSegmentHashes.insert(hash);\n\n\t\t} else {\n\n\t\t\tUTIL_THROW_EXCEPTION(\n\t\t\t\t\tUsageError,\n\t\t\t\t\t_filename << \" does not contain a hash value in line '\" << line << \"'\");\n\t\t}\n\t}\n\n\t\/\/ collect all gold-standard segments\n\n\tif (!_goldStandard)\n\t\t_goldStandard = new Segments();\n\telse\n\t\t_goldStandard->clear();\n\n\tforeach (boost::shared_ptr<EndSegment> segment, _allSegments->getEnds())\n\t\tif (goldStandardSegmentHashes.count(segment->hashValue()))\n\t\t\t_goldStandard->add(segment);\n\t\telse if (!otherSegmentHashes.count(segment->hashValue())) {\n\n\t\t\tLOG_ERROR(goldstandardfilereaderlog)\n\t\t\t\t\t<< \"end segment \" << segment->getId()\n\t\t\t\t\t<< \" in ISI \" << segment->getInterSectionInterval()\n\t\t\t\t\t<< \" is not contained in \"\n\t\t\t\t\t<< _filename << std::endl;\n\t\t}\n\tforeach (boost::shared_ptr<ContinuationSegment> segment, _allSegments->getContinuations())\n\t\tif (goldStandardSegmentHashes.count(segment->hashValue()))\n\t\t\t_goldStandard->add(segment);\n\t\telse if (!otherSegmentHashes.count(segment->hashValue())) {\n\n\t\t\tLOG_ERROR(goldstandardfilereaderlog)\n\t\t\t\t\t<< \"continuation segment \" << segment->getId()\n\t\t\t\t\t<< \" in ISI \" << segment->getInterSectionInterval()\n\t\t\t\t\t<< \" is not contained in \"\n\t\t\t\t\t<< _filename << std::endl;\n\t\t}\n\tforeach (boost::shared_ptr<BranchSegment> segment, _allSegments->getBranches())\n\t\tif (goldStandardSegmentHashes.count(segment->hashValue()))\n\t\t\t_goldStandard->add(segment);\n\t\telse if (!otherSegmentHashes.count(segment->hashValue())) {\n\n\t\t\tLOG_ERROR(goldstandardfilereaderlog)\n\t\t\t\t\t<< \"branch segment \" << segment->getId()\n\t\t\t\t\t<< \" in ISI \" << segment->getInterSectionInterval()\n\t\t\t\t\t<< \" is not contained in \"\n\t\t\t\t\t<< _filename << std::endl;\n\t\t}\n\n\tLOG_USER(goldstandardfilereaderlog)\n\t\t\t<< \"collected \" << _goldStandard->size()\n\t\t\t<< \" segments in gold-standard\" << std::endl;\n\n\t\/\/ make sure end segments are present for each slice in the first and last \n\t\/\/ section (this might not be the case if we are reading a subset of the \n\t\/\/ gold-standard)\n\n\t\/\/ get the first and last section number\n\tunsigned int firstSection = std::numeric_limits<unsigned int>::max();\n\tunsigned int lastSection  = 0;\n\tforeach (boost::shared_ptr<Segment> segment, _goldStandard->getSegments()) {\n\t\tforeach (boost::shared_ptr<Slice> slice, segment->getSlices()) {\n\t\t\tunsigned int section = slice->getSection();\n\t\t\tfirstSection = std::min(firstSection, section);\n\t\t\tlastSection  = std::min(lastSection,  section);\n\t\t}\n\t}\n\n\t\/\/ collect all first and last slices\n\tstd::set<boost::shared_ptr<Slice> > firstSlices;\n\tstd::set<boost::shared_ptr<Slice> > lastSlices;\n\tforeach (boost::shared_ptr<Segment> segment, _goldStandard->getSegments()) {\n\t\tforeach (boost::shared_ptr<Slice> slice, segment->getSlices()) {\n\n\t\t\tif (slice->getSection() == firstSection)\n\t\t\t\tfirstSlices.insert(slice);\n\t\t\telse if (slice->getSection() == lastSection)\n\t\t\t\tlastSlices.insert(slice);\n\t\t}\n\t}\n\n\t\/\/ get all end segments that use those slices (direction is determined by \n\t\/\/ providing the inter-section interval) and add them to the gold-standard\n\tforeach (boost::shared_ptr<EndSegment> firstEnd, _allSegments->getEnds(firstSection))\n\t\tif (firstSlices.count(firstEnd->getSlice()) > 0)\n\t\t\t_goldStandard->add(firstEnd);\n\tforeach (boost::shared_ptr<EndSegment> lastEnd, _allSegments->getEnds(lastSection + 1))\n\t\tif (lastSlices.count(lastEnd->getSlice()) > 0)\n\t\t\t_goldStandard->add(lastEnd);\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 <Core\/Algorithms\/Math\/SolveLinearSystemWithEigen.h>\n#include <Core\/Datatypes\/DenseMatrix.h>\n#include <Core\/Datatypes\/SparseRowMatrix.h>\n#include <Core\/Datatypes\/MatrixTypeConversions.h>\n#include <Eigen\/Sparse>\n\nusing namespace SCIRun::Core::Algorithms::Math;\nusing namespace SCIRun::Core::Datatypes;\nusing namespace SCIRun::Core::Algorithms;\nusing namespace SCIRun::Core;\n\nnamespace\n{\n  class SolveLinearSystemAlgorithmEigenCGImpl\n  {\n  public:\n    SolveLinearSystemAlgorithmEigenCGImpl(const DenseColumnMatrix& rhs, double tolerance, int maxIterations) : \n        rhs_(rhs), tolerance_(tolerance), maxIterations_(maxIterations) {}\n\n    template <class MatrixType>\n    DenseColumnMatrix solveWithEigen(const MatrixType& lhs)\n    {\n      Eigen::ConjugateGradient<typename MatrixType::EigenBase> cg;\n      cg.compute(lhs);\n\n      if (cg.info() != Eigen::Success)\n        BOOST_THROW_EXCEPTION(AlgorithmInputException() \n          << LinearAlgebraErrorMessage(\"Conjugate gradient initialization was unsuccessful\")\n          << EigenComputationInfo(cg.info()));\n\n      cg.setTolerance(tolerance_);\n      cg.setMaxIterations(maxIterations_);\n      return cg.solve(rhs_);\n    }\n  private:\n    const DenseColumnMatrix& rhs_;\n    double tolerance_;\n    int maxIterations_;\n  };\n}\n\nSolveLinearSystemAlgorithm::Outputs SolveLinearSystemAlgorithm::run(const Inputs& input, const Parameters& params) const\n{\n  MatrixConstHandle A = input.get<0>();\n  if (!A)\n    BOOST_THROW_EXCEPTION(AlgorithmInputException() << NullObjectInfo(\"Null input matrix\"));\n\n  auto b = input.get<1>();\n  if (!b)\n    BOOST_THROW_EXCEPTION(AlgorithmInputException() << NullObjectInfo(\"Null rhs vector\"));\n  \n  double tolerance = params.get<0>();\n  if (tolerance < 0)\n    BOOST_THROW_EXCEPTION(AlgorithmInputException() << DoubleOutOfRangeInfo(\n      DoubleOutOfRangeInfo::value_type(\n        std::string(\"Tolerance out of range!\"), \n        tolerance, \n        boost::numeric::interval<double>(0, std::numeric_limits<double>::infinity()))));\n\n  int maxIterations = params.get<1>();\n  if (maxIterations < 0)\n    BOOST_THROW_EXCEPTION(AlgorithmInputException() << IntOutOfRangeInfo(\n      IntOutOfRangeInfo::value_type(\n        std::string(\"Max iterations out of range!\"), \n        maxIterations, \n         boost::numeric::interval<int>(0, std::numeric_limits<int>::infinity()))));\n\n  SolveLinearSystemAlgorithmEigenCGImpl impl(*b, tolerance, maxIterations);\n  DenseColumnMatrix x;\n  if (matrix_is::dense(A))\n    x = impl.solveWithEigen(*matrix_cast::as_dense(A));\n  else if (matrix_is::sparse(A))\n    x = impl.solveWithEigen(*matrix_cast::as_sparse(A));\n  \/\/TODO: move ctor\n  if (x.size())\n    return SolveLinearSystemAlgorithm::Outputs(new DenseColumnMatrix(x));\n  else\n    return SolveLinearSystemAlgorithm::Outputs();\n}<commit_msg>Add TODO note. Closes #46.<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 <Core\/Algorithms\/Math\/SolveLinearSystemWithEigen.h>\n#include <Core\/Datatypes\/DenseMatrix.h>\n#include <Core\/Datatypes\/SparseRowMatrix.h>\n#include <Core\/Datatypes\/MatrixTypeConversions.h>\n#include <Eigen\/Sparse>\n\nusing namespace SCIRun::Core::Algorithms::Math;\nusing namespace SCIRun::Core::Datatypes;\nusing namespace SCIRun::Core::Algorithms;\nusing namespace SCIRun::Core;\n\nnamespace\n{\n  class SolveLinearSystemAlgorithmEigenCGImpl\n  {\n  public:\n    SolveLinearSystemAlgorithmEigenCGImpl(const DenseColumnMatrix& rhs, double tolerance, int maxIterations) : \n        rhs_(rhs), tolerance_(tolerance), maxIterations_(maxIterations) {}\n\n    template <class MatrixType>\n    DenseColumnMatrix solveWithEigen(const MatrixType& lhs)\n    {\n      Eigen::ConjugateGradient<typename MatrixType::EigenBase> cg;\n      cg.compute(lhs);\n\n      if (cg.info() != Eigen::Success)\n        BOOST_THROW_EXCEPTION(AlgorithmInputException() \n          << LinearAlgebraErrorMessage(\"Conjugate gradient initialization was unsuccessful\")\n          << EigenComputationInfo(cg.info()));\n\n      cg.setTolerance(tolerance_);\n      cg.setMaxIterations(maxIterations_);\n      return cg.solve(rhs_);\n    }\n  private:\n    const DenseColumnMatrix& rhs_;\n    double tolerance_;\n    int maxIterations_;\n  };\n}\n\nSolveLinearSystemAlgorithm::Outputs SolveLinearSystemAlgorithm::run(const Inputs& input, const Parameters& params) const\n{\n  \/\/TODO: make convenience macros for these common error conditions (also to increase readability)\n  MatrixConstHandle A = input.get<0>();\n  if (!A)\n    BOOST_THROW_EXCEPTION(AlgorithmInputException() << NullObjectInfo(\"Null input matrix\"));\n\n  auto b = input.get<1>();\n  if (!b)\n    BOOST_THROW_EXCEPTION(AlgorithmInputException() << NullObjectInfo(\"Null rhs vector\"));\n  \n  double tolerance = params.get<0>();\n  if (tolerance < 0)\n    BOOST_THROW_EXCEPTION(AlgorithmInputException() << DoubleOutOfRangeInfo(\n      DoubleOutOfRangeInfo::value_type(\n        std::string(\"Tolerance out of range!\"), \n        tolerance, \n        boost::numeric::interval<double>(0, std::numeric_limits<double>::infinity()))));\n\n  int maxIterations = params.get<1>();\n  if (maxIterations < 0)\n    BOOST_THROW_EXCEPTION(AlgorithmInputException() << IntOutOfRangeInfo(\n      IntOutOfRangeInfo::value_type(\n        std::string(\"Max iterations out of range!\"), \n        maxIterations, \n         boost::numeric::interval<int>(0, std::numeric_limits<int>::infinity()))));\n\n  SolveLinearSystemAlgorithmEigenCGImpl impl(*b, tolerance, maxIterations);\n  DenseColumnMatrix x;\n  if (matrix_is::dense(A))\n    x = impl.solveWithEigen(*matrix_cast::as_dense(A));\n  else if (matrix_is::sparse(A))\n    x = impl.solveWithEigen(*matrix_cast::as_sparse(A));\n  \/\/TODO: move ctor\n  if (x.size())\n    return SolveLinearSystemAlgorithm::Outputs(new DenseColumnMatrix(x));\n  else\n    return SolveLinearSystemAlgorithm::Outputs();\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef __MATRIX_SR_CPP_\n#define __MATRIX_SR_CPP_\n#include \"..\/..\/..\/include\/tools\/matrix\/matrix_sr.h\"\n#include <iostream>\n#include <cassert>\n#include <cmath>\n#include <complex> \/\/ std::complex, std::imag\n\n#include \"..\/..\/..\/include\/tools\/matrix\/eigen_unsym.h\"\n#include \"..\/..\/..\/include\/tools\/matrix\/gaussj.h\"\n\nnamespace matrix_sr {\n\n\tsize_t_matrix_t matrix_multiplication(size_t_matrix_t m_k, size_t_matrix_t k_n) {\n\t\tstd::size_t m = m_k.size();\n\t\tstd::size_t m_k_k = m_k[0].size();\n\t\tstd::size_t k_n_k = k_n.size();\n\t\tstd::size_t n = k_n[0].size();\n\t\t\/\/ #columns of first matrix equals #rows of second matrix\n\t\tassert(m_k_k == k_n_k);\n\n\t\tsize_t_matrix_t return_matrix(m, std::vector<rsp::index_int_t>(n, 0));\n\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tfor (std::size_t j = 0; j < n; ++j) {\n\t\t\t\treturn_matrix[i][j] = 0;\n\t\t\t\tfor (std::size_t k = 0; k < m_k_k; ++k) {\n\t\t\t\t\treturn_matrix[i][j] += m_k[i][k] * k_n[k][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn return_matrix;\n\t}\n\n\tsize_t_matrix_t matrix_power(size_t_matrix_t n_n, std::size_t k)\n\t{\n\t\tif (k == 0)\n\t\t\treturn size_t_matrix_t();\n\t\tassert(k >= 1);\n\t\tsize_t_matrix_t A = n_n;\n\t\tfor (std::size_t i = 0; i < k - 1; ++i) {\n\t\t\tA = matrix_multiplication(A, n_n);\n\t\t}\n\n\t\treturn A;\n\t}\n\n\tpath_R_matrix_t matrix_multiplication(path_R_matrix_t m_k, path_R_matrix_t k_n)\n\t{\n\t\tstd::size_t m = m_k.size();\n\t\tstd::size_t m_k_k = m_k[0].size();\n\t\tstd::size_t k_n_k = k_n.size();\n\t\tstd::size_t n = k_n[0].size();\n\t\t\/\/ #columns of first matrix equals #rows of second matrix\n\t\tassert(m_k_k == k_n_k);\n\t\t\/\/ each matrix element is a potential matrix\n\t\tpath_R_matrix_t return_matrix(m, std::vector<path_R_matrix_element_t>(n));\n\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tfor (std::size_t j = 0; j < n; ++j) {\n\t\t\t\t\/\/ define multiplication\n\t\t\t\t\/\/ combine two vectors into a single vector\n\t\t\t\tpath_R_matrix_element_t p_new;\n\t\t\t\tfor (std::size_t k = 0; k < m_k_k; ++k) {\n\t\t\t\t\tfor (std::size_t l1 = 0; l1 < m_k[i][k].size(); ++l1) {\n\t\t\t\t\t\t\/\/ for all none-zero path, zero means no path, just a empty vector\n\t\t\t\t\t\tif (m_k[i][k][l1].size() != 0) {\n\t\t\t\t\t\t\tfor (std::size_t l2 = 0; l2 < k_n[k][j].size(); ++l2) {\n\t\t\t\t\t\t\t\tif (k_n[k][j][l2].size() != 0) {\n\t\t\t\t\t\t\t\t\tstd::vector<rsp::index_int_t> v_new;\n\t\t\t\t\t\t\t\t\t\/\/ combine two vectors\n\t\t\t\t\t\t\t\t\tv_new.reserve(m_k[i][k][l1].size() + k_n[k][j][l2].size()); \/\/ preallocate memory\n\t\t\t\t\t\t\t\t\tv_new.insert(v_new.end(), m_k[i][k][l1].begin(), m_k[i][k][l1].end());\n\t\t\t\t\t\t\t\t\tv_new.insert(v_new.end(), k_n[k][j][l2].begin(), k_n[k][j][l2].end());\n\t\t\t\t\t\t\t\t\tp_new.push_back(v_new);\n\t\t\t\t\t\t\t\t} \/\/ if\n\t\t\t\t\t\t\t} \/\/ l2\n\n\t\t\t\t\t\t} \/\/ if\n\n\t\t\t\t\t} \/\/ l1\n\t\t\t\t} \/\/ k\n\n\t\t\t\tif (p_new.size() == 0)\n\t\t\t\t\tp_new = {};\n\t\t\t\treturn_matrix[i][j] = p_new;\n\t\t\t} \/\/ j\n\t\t} \/\/ i\n\n\t\treturn return_matrix;\n\t}\n\n\tpath_R_matrix_t matrix_power(path_R_matrix_t n_n, std::size_t k)\n\t{\n\t\tif (k == 0)\n\t\t\treturn path_R_matrix_t();\n\t\tassert(k >= 1);\n\t\tpath_R_matrix_t A = n_n;\n\t\tfor (std::size_t i = 0; i < k - 1; ++i) {\n\t\t\tA = matrix_multiplication(A, n_n);\n\t\t}\n\n\t\treturn A;\n\n\t}\n\n\tbool cal_equilibrium_ratio_from_transition_matrix(std::vector<std::vector<double>>& transition_mat, double &first_real_positive_eigenvalue, std::vector<double> &equil_ratio)\n\t{\n\t\tstd::size_t m = transition_mat.size();\n\t\tequil_ratio.assign(m, 0.0);\n\n\t\tMatDoub mat_tmp(m, m, 0.0);\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tfor (std::size_t j = 0; j < m; ++j) {\n\t\t\t\tmat_tmp[i][j] = transition_mat[i][j];\n\t\t\t}\n\t\t}\n\n\t\tUnsymmeig h(mat_tmp, true, true);\n\t\tauto eigen_val = h.wri;\n\t\tauto eigen_vec = h.zz;\n\n\t\t\/\/ find the first eigen value that's is positive\n\t\t\/\/ if there is more than one steady states, ignore the rest lol\n\t\tstd::size_t first_real_idx = 0;\n\t\tbool ok = false;\n\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tif (eigen_val[i].imag() != 0)\n\t\t\t\tcontinue;\n\t\t\t\/\/ imaginary is zero, real number\n\t\t\tif (eigen_val[i].real() > 0) {\n\t\t\t\tfirst_real_idx = i;\n\t\t\t\tok = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ if there is no real positive eigen-value, return false\n\t\tif (ok == false)\n\t\t\treturn false;\n\n\t\tfirst_real_positive_eigenvalue = eigen_val[first_real_idx].real();\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\t\/\/equil_ratio[i] = eigen_vec[i][first_real_idx];\n\t\t\tequil_ratio[i] = eigen_vec[i][first_real_idx] * eigen_vec[i][first_real_idx];\n\t\t}\n\n\t\t\/\/ normalize\n\t\tdouble sum_tmp = 0.0;\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tsum_tmp += equil_ratio[i];\n\t\t}\n\t\tif (sum_tmp == 0.0)\n\t\t\treturn false;\n\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tequil_ratio[i] \/= sum_tmp;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tbool gaussian_jordan(std::vector<std::vector<double>>& A, std::vector<double> &b) {\n\t\tstd::size_t m = A.size();\n\t\t\/\/b.assign(m, 0.0);\n\n\t\tMatDoub A_mat(m, m, 0.0);\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tfor (std::size_t j = 0; j < m; ++j) {\n\t\t\t\tA_mat[i][j] = A[i][j];\n\t\t\t}\n\t\t}\n\n\t\tMatDoub b_vec(m, 1, 0.0);\n\t\tfor (std::size_t i = 0; i < m; ++i)\n\t\t\tb_vec[i][0] = b[i];\n\n\t\tauto ok = gaussj_return(A_mat, b_vec);\n\n\t\tstd::size_t n_mat = A_mat.nrows() - 1;\n\t\twhile (ok == false && (n_mat >= 1)) {\n\n\t\t\t\/\/ set the last variable to be 1.0, move the contribution from the varible to b vector\n\t\t\tMatDoub A_mat_tmp(n_mat, n_mat, 0.0);\n\t\t\tfor (std::size_t i = 0; i < n_mat; ++i) {\n\t\t\t\tfor (std::size_t j = 0; j < n_mat; ++j) {\n\t\t\t\t\tA_mat_tmp[i][j] = A[i][j];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tMatDoub b_vec_tmp(n_mat, 1, 0.0);\n\t\t\tfor (std::size_t i = 0; i < n_mat; ++i)\n\t\t\t\tb_vec_tmp[i][0] = b[i];\n\n\t\t\t\/\/ set current the value of current b_vec to be 1.0, move the contribution of it to the b_vec\n\t\t\tb_vec[n_mat][0] = 1.0;\n\t\t\tfor (std::size_t i = 0; i < n_mat; ++i)\n\t\t\t\tb_vec_tmp[i][0] -= (A[i][n_mat] * 1.0);\n\n\t\t\tok = gaussj_return(A_mat_tmp, b_vec_tmp);\n\n\t\t\tif (ok == true) {\n\t\t\t\tfor (std::size_t i = 0; i < n_mat; ++i)\n\t\t\t\t\tb_vec[i][0] = b_vec_tmp[i][0];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tn_mat -= 1;\n\t\t}\n\n\t\tdouble sum_b = 0.0;\n\t\tif (ok == true) {\n\t\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\t\tb[i] = b_vec[i][0];\n\t\t\t\tsum_b += b[i];\n\t\t\t}\n\t\t}\n\n\t\t\/\/ normalize\n\t\tif (ok == false || sum_b == 0) {\n\t\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\t\tb[i] = 1.0 \/ m;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\t\tb[i] \/= sum_b;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t\/\/matrix_sr::size_t_matrix_t m1;\n\t\/\/m1.resize(5);\n\t\/\/m1[0] = { 0,1,1,1,1 };\n\t\/\/m1[1] = { 0,0,1,1,1 };\n\t\/\/m1[2] = { 0,0,0,1,1 };\n\t\/\/m1[3] = { 0,0,0,0,1 };\n\t\/\/m1[4] = { 0,0,0,0,0 };\n\n\t\/\/matrix_sr::size_t_matrix_t m2 = matrix_sr::matrix_multiplication(m1, m1);\n\n\t\/\/for (auto x : m2)\n\t\/\/\tstd::cout << x << std::endl;\n\n\t\/\/matrix_sr::size_t_matrix_t A = matrix_sr::matrix_power(m1, 2);\n\t\/\/for (auto x : A)\n\t\/\/\tstd::cout << x << std::endl;\n\n\t\/\/matrix_sr::path_R_matrix_t m1;\n\t\/\/m1.resize(5);\n\t\/\/\/\/ each matrix element is a matrix\n\t\/\/m1[0] = { {},{ { 1 } },{ { 2 } },{ { 3 } },{ { 4 } } };\n\t\/\/m1[1] = { {},{},{ { 5 } },{ { 6 } },{ { 7 } } };\n\t\/\/m1[2] = { {},{},{},{ { 8 } },{ { 9 } } };\n\t\/\/m1[3] = { {},{},{},{},{ {10}, {11} } };\n\t\/\/m1[4] = { {},{},{},{},{} };\n\n\t\/\/for (std::size_t i = 0; i < m1.size(); ++i) {\n\t\/\/\tfor (std::size_t j = 0; j < m1[i].size(); ++j) {\n\t\/\/\t\tstd::cout << \"(\" << i << \",\" << j << \")\\t\";\n\t\/\/\t\tif (m1[i][j].size() == 0) {\n\t\/\/\t\t\tcontinue;\n\t\/\/\t\t}\n\t\/\/\t\tfor (std::size_t k = 0; k < m1[i][j].size(); ++k) {\n\t\/\/\t\t\tfor (std::size_t l = 0; l < m1[i][j][k].size(); ++l)\n\t\/\/\t\t\t\tstd::cout << m1[i][j][k][l] << \"\\t\";\n\t\/\/\t\t}\n\t\/\/\t}\n\t\/\/\tstd::cout << std::endl;\n\t\/\/}\n\n\t\/\/matrix_sr::path_R_matrix_t m2 = matrix_sr::matrix_multiplication(m1, m1);\n\n\t\/\/for (std::size_t i = 0; i < m2.size(); ++i) {\n\t\/\/\tfor (std::size_t j = 0; j < m2[i].size(); ++j) {\n\t\/\/\t\tstd::cout << \"(\" << i << \",\" << j << \")\\t\";\n\t\/\/\t\tif (m2[i][j].size() == 0) {\n\t\/\/\t\t\tcontinue;\n\t\/\/\t\t}\n\t\/\/\t\tfor (std::size_t k = 0; k < m2[i][j].size(); ++k) {\n\t\/\/\t\t\tfor (std::size_t l = 0; l < m2[i][j][k].size(); ++l)\n\t\/\/\t\t\t\tstd::cout << m2[i][j][k][l] << \"\\t\";\n\t\/\/\t\t}\n\t\/\/\t}\n\t\/\/\tstd::cout << std::endl;\n\t\/\/}\n\n\t\/\/matrix_sr::path_R_matrix_t m3 = matrix_sr::matrix_power(m1, 3);\n\n\t\/\/for (std::size_t i = 0; i < m3.size(); ++i) {\n\t\/\/\tfor (std::size_t j = 0; j < m3[i].size(); ++j) {\n\t\/\/\t\tstd::cout << \"(\" << i << \",\" << j << \")\\t\";\n\t\/\/\t\tif (m3[i][j].size() == 0) {\n\t\/\/\t\t\tcontinue;\n\t\/\/\t\t}\n\t\/\/\t\tfor (std::size_t k = 0; k < m3[i][j].size(); ++k) {\n\t\/\/\t\t\tfor (std::size_t l = 0; l < m3[i][j][k].size(); ++l)\n\t\/\/\t\t\t\tstd::cout << m3[i][j][k][l] << \"\\t\";\n\t\/\/\t\t}\n\t\/\/\t}\n\t\/\/\tstd::cout << std::endl;\n\t\/\/}\n\n}\n\n\n#endif \/\/ !__MATRIX_SR_CPP_\n<commit_msg>minor<commit_after>#ifndef __MATRIX_SR_CPP_\n#define __MATRIX_SR_CPP_\n#include \"..\/..\/..\/include\/tools\/matrix\/matrix_sr.h\"\n#include <iostream>\n#include <cassert>\n#include <cmath>\n#include <complex> \/\/ std::complex, std::imag\n\n#include \"..\/..\/..\/include\/tools\/matrix\/eigen_unsym.h\"\n#include \"..\/..\/..\/include\/tools\/matrix\/gaussj.h\"\n\nnamespace matrix_sr {\n\n\tsize_t_matrix_t matrix_multiplication(size_t_matrix_t m_k, size_t_matrix_t k_n) {\n\t\tstd::size_t m = m_k.size();\n\t\tstd::size_t m_k_k = m_k[0].size();\n\t\tstd::size_t k_n_k = k_n.size();\n\t\tstd::size_t n = k_n[0].size();\n\t\t\/\/ #columns of first matrix equals #rows of second matrix\n\t\tassert(m_k_k == k_n_k);\n\n\t\tsize_t_matrix_t return_matrix(m, std::vector<rsp::index_int_t>(n, 0));\n\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tfor (std::size_t j = 0; j < n; ++j) {\n\t\t\t\treturn_matrix[i][j] = 0;\n\t\t\t\tfor (std::size_t k = 0; k < m_k_k; ++k) {\n\t\t\t\t\treturn_matrix[i][j] += m_k[i][k] * k_n[k][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn return_matrix;\n\t}\n\n\tsize_t_matrix_t matrix_power(size_t_matrix_t n_n, std::size_t k)\n\t{\n\t\tif (k == 0)\n\t\t\treturn size_t_matrix_t();\n\t\tassert(k >= 1);\n\t\tsize_t_matrix_t A = n_n;\n\t\tfor (std::size_t i = 0; i < k - 1; ++i) {\n\t\t\tA = matrix_multiplication(A, n_n);\n\t\t}\n\n\t\treturn A;\n\t}\n\n\tpath_R_matrix_t matrix_multiplication(path_R_matrix_t m_k, path_R_matrix_t k_n)\n\t{\n\t\tstd::size_t m = m_k.size();\n\t\tstd::size_t m_k_k = m_k[0].size();\n\t\tstd::size_t k_n_k = k_n.size();\n\t\tstd::size_t n = k_n[0].size();\n\t\t\/\/ #columns of first matrix equals #rows of second matrix\n\t\tassert(m_k_k == k_n_k);\n\t\t\/\/ each matrix element is a potential matrix\n\t\tpath_R_matrix_t return_matrix(m, std::vector<path_R_matrix_element_t>(n));\n\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tfor (std::size_t j = 0; j < n; ++j) {\n\t\t\t\t\/\/ define multiplication\n\t\t\t\t\/\/ combine two vectors into a single vector\n\t\t\t\tpath_R_matrix_element_t p_new;\n\t\t\t\tfor (std::size_t k = 0; k < m_k_k; ++k) {\n\t\t\t\t\tfor (std::size_t l1 = 0; l1 < m_k[i][k].size(); ++l1) {\n\t\t\t\t\t\t\/\/ for all none-zero path, zero means no path, just a empty vector\n\t\t\t\t\t\tif (m_k[i][k][l1].size() != 0) {\n\t\t\t\t\t\t\tfor (std::size_t l2 = 0; l2 < k_n[k][j].size(); ++l2) {\n\t\t\t\t\t\t\t\tif (k_n[k][j][l2].size() != 0) {\n\t\t\t\t\t\t\t\t\tstd::vector<rsp::index_int_t> v_new;\n\t\t\t\t\t\t\t\t\t\/\/ combine two vectors\n\t\t\t\t\t\t\t\t\tv_new.reserve(m_k[i][k][l1].size() + k_n[k][j][l2].size()); \/\/ preallocate memory\n\t\t\t\t\t\t\t\t\tv_new.insert(v_new.end(), m_k[i][k][l1].begin(), m_k[i][k][l1].end());\n\t\t\t\t\t\t\t\t\tv_new.insert(v_new.end(), k_n[k][j][l2].begin(), k_n[k][j][l2].end());\n\t\t\t\t\t\t\t\t\tp_new.push_back(v_new);\n\t\t\t\t\t\t\t\t} \/\/ if\n\t\t\t\t\t\t\t} \/\/ l2\n\n\t\t\t\t\t\t} \/\/ if\n\n\t\t\t\t\t} \/\/ l1\n\t\t\t\t} \/\/ k\n\n\t\t\t\tif (p_new.size() == 0)\n\t\t\t\t\tp_new = {};\n\t\t\t\treturn_matrix[i][j] = p_new;\n\t\t\t} \/\/ j\n\t\t} \/\/ i\n\n\t\treturn return_matrix;\n\t}\n\n\tpath_R_matrix_t matrix_power(path_R_matrix_t n_n, std::size_t k)\n\t{\n\t\tif (k == 0)\n\t\t\treturn path_R_matrix_t();\n\t\tassert(k >= 1);\n\t\tpath_R_matrix_t A = n_n;\n\t\tfor (std::size_t i = 0; i < k - 1; ++i) {\n\t\t\tA = matrix_multiplication(A, n_n);\n\t\t}\n\n\t\treturn A;\n\n\t}\n\n\tbool cal_equilibrium_ratio_from_transition_matrix(std::vector<std::vector<double>>& transition_mat, double &first_real_positive_eigenvalue, std::vector<double> &equil_ratio)\n\t{\n\t\tstd::size_t m = transition_mat.size();\n\t\tequil_ratio.assign(m, 0.0);\n\n\t\tMatDoub mat_tmp(m, m, 0.0);\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tfor (std::size_t j = 0; j < m; ++j) {\n\t\t\t\tmat_tmp[i][j] = transition_mat[i][j];\n\t\t\t}\n\t\t}\n\n\t\tUnsymmeig h(mat_tmp, true, true);\n\t\tauto eigen_val = h.wri;\n\t\tauto eigen_vec = h.zz;\n\n\t\t\/\/ find the first eigen value that's is positive\n\t\t\/\/ if there is more than one steady states, ignore the rest lol\n\t\tstd::size_t first_real_idx = 0;\n\t\tbool ok = false;\n\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tif (eigen_val[i].imag() != 0)\n\t\t\t\tcontinue;\n\t\t\t\/\/ imaginary is zero, real number\n\t\t\tif (eigen_val[i].real() > 0) {\n\t\t\t\tfirst_real_idx = i;\n\t\t\t\tok = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ if there is no real positive eigen-value, return false\n\t\tif (ok == false)\n\t\t\treturn false;\n\n\t\tfirst_real_positive_eigenvalue = eigen_val[first_real_idx].real();\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\t\/\/equil_ratio[i] = eigen_vec[i][first_real_idx];\n\t\t\tequil_ratio[i] = eigen_vec[i][first_real_idx] * eigen_vec[i][first_real_idx];\n\t\t}\n\n\t\t\/\/ normalize\n\t\tdouble sum_tmp = 0.0;\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tsum_tmp += equil_ratio[i];\n\t\t}\n\t\tif (sum_tmp == 0.0)\n\t\t\treturn false;\n\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tequil_ratio[i] \/= sum_tmp;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tbool gaussian_jordan(std::vector<std::vector<double>>& A, std::vector<double> &b) {\n\t\tstd::size_t m = A.size();\n\t\t\/\/b.assign(m, 0.0);\n\n\t\tMatDoub A_mat(m, m, 0.0);\n\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\tfor (std::size_t j = 0; j < m; ++j) {\n\t\t\t\tA_mat[i][j] = A[i][j];\n\t\t\t}\n\t\t}\n\n\t\tMatDoub b_vec(m, 1, 0.0);\n\t\tfor (std::size_t i = 0; i < m; ++i)\n\t\t\tb_vec[i][0] = b[i];\n\n\t\tauto ok = gaussj_return(A_mat, b_vec);\n\n\t\tstd::size_t n_mat = A_mat.nrows() - 1;\n\t\twhile (ok == false && (n_mat >= 1)) {\n\n\t\t\t\/\/ set the last variable to be 1.0, move the contribution from the varible to b vector\n\t\t\tMatDoub A_mat_tmp(n_mat, n_mat, 0.0);\n\t\t\tfor (std::size_t i = 0; i < n_mat; ++i) {\n\t\t\t\tfor (std::size_t j = 0; j < n_mat; ++j) {\n\t\t\t\t\tA_mat_tmp[i][j] = A[i][j];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tMatDoub b_vec_tmp(n_mat, 1, 0.0);\n\t\t\tfor (std::size_t i = 0; i < n_mat; ++i)\n\t\t\t\tb_vec_tmp[i][0] = b[i];\n\n\t\t\t\/\/ set current the value of current b_vec to be 1.0, move the contribution of it to the b_vec\n\t\t\tb_vec[n_mat][0] = 1.0;\n\t\t\t\/\/for (std::size_t i = 0; i < n_mat; ++i)\n\t\t\t\/\/\tb_vec_tmp[i][0] -= (A[i][n_mat] * 1.0);\n\t\t\tfor (std::size_t i = 0; i < n_mat; ++i) {\n\t\t\t\tfor (std::size_t j = n_mat; j < m; ++j) {\n\t\t\t\t\tb_vec_tmp[i][0] -= (A[i][j] * 1.0);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tok = gaussj_return(A_mat_tmp, b_vec_tmp);\n\n\t\t\tif (ok == true) {\n\t\t\t\tfor (std::size_t i = 0; i < n_mat; ++i)\n\t\t\t\t\tb_vec[i][0] = b_vec_tmp[i][0];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tn_mat -= 1;\n\t\t}\n\n\t\tdouble sum_b = 0.0;\n\t\tif (ok == true) {\n\t\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\t\tb[i] = b_vec[i][0];\n\t\t\t\tsum_b += b[i];\n\t\t\t}\n\t\t}\n\n\t\t\/\/ normalize\n\t\tif (ok == false || sum_b == 0) {\n\t\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\t\tb[i] = 1.0 \/ m;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (std::size_t i = 0; i < m; ++i) {\n\t\t\t\tb[i] \/= sum_b;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t\/\/matrix_sr::size_t_matrix_t m1;\n\t\/\/m1.resize(5);\n\t\/\/m1[0] = { 0,1,1,1,1 };\n\t\/\/m1[1] = { 0,0,1,1,1 };\n\t\/\/m1[2] = { 0,0,0,1,1 };\n\t\/\/m1[3] = { 0,0,0,0,1 };\n\t\/\/m1[4] = { 0,0,0,0,0 };\n\n\t\/\/matrix_sr::size_t_matrix_t m2 = matrix_sr::matrix_multiplication(m1, m1);\n\n\t\/\/for (auto x : m2)\n\t\/\/\tstd::cout << x << std::endl;\n\n\t\/\/matrix_sr::size_t_matrix_t A = matrix_sr::matrix_power(m1, 2);\n\t\/\/for (auto x : A)\n\t\/\/\tstd::cout << x << std::endl;\n\n\t\/\/matrix_sr::path_R_matrix_t m1;\n\t\/\/m1.resize(5);\n\t\/\/\/\/ each matrix element is a matrix\n\t\/\/m1[0] = { {},{ { 1 } },{ { 2 } },{ { 3 } },{ { 4 } } };\n\t\/\/m1[1] = { {},{},{ { 5 } },{ { 6 } },{ { 7 } } };\n\t\/\/m1[2] = { {},{},{},{ { 8 } },{ { 9 } } };\n\t\/\/m1[3] = { {},{},{},{},{ {10}, {11} } };\n\t\/\/m1[4] = { {},{},{},{},{} };\n\n\t\/\/for (std::size_t i = 0; i < m1.size(); ++i) {\n\t\/\/\tfor (std::size_t j = 0; j < m1[i].size(); ++j) {\n\t\/\/\t\tstd::cout << \"(\" << i << \",\" << j << \")\\t\";\n\t\/\/\t\tif (m1[i][j].size() == 0) {\n\t\/\/\t\t\tcontinue;\n\t\/\/\t\t}\n\t\/\/\t\tfor (std::size_t k = 0; k < m1[i][j].size(); ++k) {\n\t\/\/\t\t\tfor (std::size_t l = 0; l < m1[i][j][k].size(); ++l)\n\t\/\/\t\t\t\tstd::cout << m1[i][j][k][l] << \"\\t\";\n\t\/\/\t\t}\n\t\/\/\t}\n\t\/\/\tstd::cout << std::endl;\n\t\/\/}\n\n\t\/\/matrix_sr::path_R_matrix_t m2 = matrix_sr::matrix_multiplication(m1, m1);\n\n\t\/\/for (std::size_t i = 0; i < m2.size(); ++i) {\n\t\/\/\tfor (std::size_t j = 0; j < m2[i].size(); ++j) {\n\t\/\/\t\tstd::cout << \"(\" << i << \",\" << j << \")\\t\";\n\t\/\/\t\tif (m2[i][j].size() == 0) {\n\t\/\/\t\t\tcontinue;\n\t\/\/\t\t}\n\t\/\/\t\tfor (std::size_t k = 0; k < m2[i][j].size(); ++k) {\n\t\/\/\t\t\tfor (std::size_t l = 0; l < m2[i][j][k].size(); ++l)\n\t\/\/\t\t\t\tstd::cout << m2[i][j][k][l] << \"\\t\";\n\t\/\/\t\t}\n\t\/\/\t}\n\t\/\/\tstd::cout << std::endl;\n\t\/\/}\n\n\t\/\/matrix_sr::path_R_matrix_t m3 = matrix_sr::matrix_power(m1, 3);\n\n\t\/\/for (std::size_t i = 0; i < m3.size(); ++i) {\n\t\/\/\tfor (std::size_t j = 0; j < m3[i].size(); ++j) {\n\t\/\/\t\tstd::cout << \"(\" << i << \",\" << j << \")\\t\";\n\t\/\/\t\tif (m3[i][j].size() == 0) {\n\t\/\/\t\t\tcontinue;\n\t\/\/\t\t}\n\t\/\/\t\tfor (std::size_t k = 0; k < m3[i][j].size(); ++k) {\n\t\/\/\t\t\tfor (std::size_t l = 0; l < m3[i][j][k].size(); ++l)\n\t\/\/\t\t\t\tstd::cout << m3[i][j][k][l] << \"\\t\";\n\t\/\/\t\t}\n\t\/\/\t}\n\t\/\/\tstd::cout << std::endl;\n\t\/\/}\n\n}\n\n\n#endif \/\/ !__MATRIX_SR_CPP_\n<|endoftext|>"}
{"text":"<commit_before>#include \"QGCWaypointListMulti.h\"\n#include \"ui_QGCWaypointListMulti.h\"\n#include \"UASManager.h\"\n\nQGCWaypointListMulti::QGCWaypointListMulti(QWidget *parent) :\n    QWidget(parent),\n    offline_uas_id(0),\n    ui(new Ui::QGCWaypointListMulti)\n{\n    ui->setupUi(this);\n    setMinimumSize(600, 80);\n    connect(UASManager::instance(), SIGNAL(UASCreated(UASInterface*)), this, SLOT(systemCreated(UASInterface*)));\n    connect(UASManager::instance(), SIGNAL(activeUASSet(int)), this, SLOT(systemSetActive(int)));\n\n    WaypointList* list = new WaypointList(ui->stackedWidget, UASManager::instance()->getActiveUASWaypointManager());\n    lists.insert(offline_uas_id, list);\n    ui->stackedWidget->addWidget(list);\n\n    if (UASManager::instance()->getActiveUAS()) {\n        systemCreated(UASManager::instance()->getActiveUAS());\n        systemSetActive(UASManager::instance()->getActiveUAS()->getUASID());\n    }\n\n}\n\nvoid QGCWaypointListMulti::systemDeleted(QObject* uas)\n{\n    UASInterface* mav = dynamic_cast<UASInterface*>(uas);\n    if (mav)\n    {\n        int id = mav->getUASID();\n        WaypointList* list = lists.value(id, NULL);\n        if (list)\n        {\n            delete list;\n            lists.remove(id);\n        }\n    }\n}\n\nvoid QGCWaypointListMulti::systemCreated(UASInterface* uas)\n{\n    WaypointList* list = new WaypointList(ui->stackedWidget, uas->getWaypointManager());\n    lists.insert(uas->getUASID(), list);\n    ui->stackedWidget->addWidget(list);\n    \/\/ Ensure widget is deleted when system is deleted\n    connect(uas, SIGNAL(destroyed(QObject*)), this, SLOT(systemDeleted(QObject*)));\n}\n\nvoid QGCWaypointListMulti::systemSetActive(int uas)\n{\n    WaypointList* list = lists.value(uas, NULL);\n    if (list) {\n        ui->stackedWidget->setCurrentWidget(list);\n    }\n}\n\nQGCWaypointListMulti::~QGCWaypointListMulti()\n{\n    delete ui;\n}\n\nvoid QGCWaypointListMulti::changeEvent(QEvent *e)\n{\n    QWidget::changeEvent(e);\n    switch (e->type()) {\n    case QEvent::LanguageChange:\n        ui->retranslateUi(this);\n        break;\n    default:\n        break;\n    }\n}\n<commit_msg>Fix to Waypoint Edit Widget being to small<commit_after>#include \"QGCWaypointListMulti.h\"\n#include \"ui_QGCWaypointListMulti.h\"\n#include \"UASManager.h\"\n\nQGCWaypointListMulti::QGCWaypointListMulti(QWidget *parent) :\n    QWidget(parent),\n    offline_uas_id(0),\n    ui(new Ui::QGCWaypointListMulti)\n{\n    ui->setupUi(this);\n    setMinimumSize(600, 120);\n    connect(UASManager::instance(), SIGNAL(UASCreated(UASInterface*)), this, SLOT(systemCreated(UASInterface*)));\n    connect(UASManager::instance(), SIGNAL(activeUASSet(int)), this, SLOT(systemSetActive(int)));\n\n    WaypointList* list = new WaypointList(ui->stackedWidget, UASManager::instance()->getActiveUASWaypointManager());\n    lists.insert(offline_uas_id, list);\n    ui->stackedWidget->addWidget(list);\n\n    if (UASManager::instance()->getActiveUAS()) {\n        systemCreated(UASManager::instance()->getActiveUAS());\n        systemSetActive(UASManager::instance()->getActiveUAS()->getUASID());\n    }\n\n}\n\nvoid QGCWaypointListMulti::systemDeleted(QObject* uas)\n{\n    UASInterface* mav = dynamic_cast<UASInterface*>(uas);\n    if (mav)\n    {\n        int id = mav->getUASID();\n        WaypointList* list = lists.value(id, NULL);\n        if (list)\n        {\n            delete list;\n            lists.remove(id);\n        }\n    }\n}\n\nvoid QGCWaypointListMulti::systemCreated(UASInterface* uas)\n{\n    WaypointList* list = new WaypointList(ui->stackedWidget, uas->getWaypointManager());\n    lists.insert(uas->getUASID(), list);\n    ui->stackedWidget->addWidget(list);\n    \/\/ Ensure widget is deleted when system is deleted\n    connect(uas, SIGNAL(destroyed(QObject*)), this, SLOT(systemDeleted(QObject*)));\n}\n\nvoid QGCWaypointListMulti::systemSetActive(int uas)\n{\n    WaypointList* list = lists.value(uas, NULL);\n    if (list) {\n        ui->stackedWidget->setCurrentWidget(list);\n    }\n}\n\nQGCWaypointListMulti::~QGCWaypointListMulti()\n{\n    delete ui;\n}\n\nvoid QGCWaypointListMulti::changeEvent(QEvent *e)\n{\n    QWidget::changeEvent(e);\n    switch (e->type()) {\n    case QEvent::LanguageChange:\n        ui->retranslateUi(this);\n        break;\n    default:\n        break;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2005 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#include <osg\/DisplaySettings>\n#include <osg\/ArgumentParser>\n#include <osg\/ApplicationUsage>\n#include <osg\/ref_ptr>\n\n#include <algorithm>\n\nusing namespace osg;\nusing namespace std;\n\nDisplaySettings* DisplaySettings::instance()\n{\n    static ref_ptr<DisplaySettings> s_displaySettings = new DisplaySettings;\n    return s_displaySettings.get();\n}\n\nDisplaySettings::DisplaySettings(const DisplaySettings& vs):Referenced()\n{\n    setDisplaySettings(vs);\n}\n\nDisplaySettings::~DisplaySettings()\n{\n}\n\n \n DisplaySettings& DisplaySettings::operator = (const DisplaySettings& vs)\n{\n    if (this==&vs) return *this;\n    setDisplaySettings(vs);\n    return *this;\n}\n\nvoid DisplaySettings::setDisplaySettings(const DisplaySettings& vs)\n{\n    _displayType = vs._displayType;\n    _stereoMode = vs._stereoMode;\n    _eyeSeparation = vs._eyeSeparation;\n    _screenWidth = vs._screenWidth;\n    _screenHeight = vs._screenHeight;\n    _screenDistance = vs._screenDistance;\n\n    _splitStereoHorizontalEyeMapping = vs._splitStereoHorizontalEyeMapping;\n    _splitStereoHorizontalSeparation = vs._splitStereoHorizontalSeparation;\n\n    _splitStereoVerticalEyeMapping = vs._splitStereoVerticalEyeMapping;\n    _splitStereoVerticalSeparation = vs._splitStereoVerticalSeparation;\n    \n    _splitStereoAutoAdjustAspectRatio = vs._splitStereoAutoAdjustAspectRatio;\n\n    _doubleBuffer = vs._doubleBuffer;\n    _RGB = vs._RGB;\n    _depthBuffer = vs._depthBuffer;\n    _minimumNumberAlphaBits = vs._minimumNumberAlphaBits;\n    _minimumNumberStencilBits = vs._minimumNumberStencilBits;\n\n    _maxNumOfGraphicsContexts = vs._maxNumOfGraphicsContexts;\n}\n\nvoid DisplaySettings::merge(const DisplaySettings& vs)\n{\n    if (_stereo       || vs._stereo)        _stereo = true;\n    \n    \/\/ need to think what to do about merging the stereo mode.\n    \n    if (_doubleBuffer || vs._doubleBuffer)  _doubleBuffer = true;\n    if (_RGB          || vs._RGB)           _RGB = true;\n    if (_depthBuffer  || vs._depthBuffer)   _depthBuffer = true;\n    \n    if (vs._minimumNumberAlphaBits>_minimumNumberAlphaBits) _minimumNumberAlphaBits = vs._minimumNumberAlphaBits;\n    if (vs._minimumNumberStencilBits>_minimumNumberStencilBits) _minimumNumberStencilBits = vs._minimumNumberStencilBits;\n}\n\nvoid DisplaySettings::setDefaults()\n{\n    _displayType = MONITOR;\n\n    _stereo = false;\n    _stereoMode = ANAGLYPHIC;\n    _eyeSeparation = 0.05f;\n    _screenWidth = 0.325f;\n    _screenHeight = 0.26f;\n    _screenDistance = 0.5f;\n\n    _splitStereoHorizontalEyeMapping = LEFT_EYE_LEFT_VIEWPORT;\n    _splitStereoHorizontalSeparation = 0;\n\n    _splitStereoVerticalEyeMapping = LEFT_EYE_TOP_VIEWPORT;\n    _splitStereoVerticalSeparation = 0;\n\n    _splitStereoAutoAdjustAspectRatio = true;\n\n    _doubleBuffer = true;\n    _RGB = true;\n    _depthBuffer = true;\n    _minimumNumberAlphaBits = 0;\n    _minimumNumberStencilBits = 0;\n    \n    _maxNumOfGraphicsContexts = 3;\n}\n\nstatic ApplicationUsageProxy DisplaySetting_e0(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_DISPLAY_TYPE <type>\",\"MONITOR | POWERWALL | REALITY_CENTER | HEAD_MOUNTED_DISPLAY\");\nstatic ApplicationUsageProxy DisplaySetting_e1(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_STEREO_MODE <mode>\",\"QUAD_BUFFER | ANAGLYPHIC | HORIZONTAL_SPLIT | VERTICAL_SPLIT | LEFT_EYE | RIGHT_EYE\");\nstatic ApplicationUsageProxy DisplaySetting_e2(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_STEREO <mode>\",\"OFF | ON\");\nstatic ApplicationUsageProxy DisplaySetting_e3(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_EYE_SEPARATION <float>\",\"physical distance between eyes\");\nstatic ApplicationUsageProxy DisplaySetting_e4(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_DISTANCE <float>\",\"physical distance between eyes and screen\");\nstatic ApplicationUsageProxy DisplaySetting_e5(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_HEIGHT <float>\",\"physical screen height\");\nstatic ApplicationUsageProxy DisplaySetting_e6(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_WIDTH <float>\",\"physical screen width\");\nstatic ApplicationUsageProxy DisplaySetting_e7(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_HORIZONTAL_EYE_MAPPING <mode>\",\"LEFT_EYE_LEFT_VIEWPORT | LEFT_EYE_RIGHT_VIEWPORT\");\nstatic ApplicationUsageProxy DisplaySetting_e8(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_HORIZONTAL_SEPARATION <float>\",\"number of pixels between viewports\");\nstatic ApplicationUsageProxy DisplaySetting_e9(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_VERTICAL_EYE_MAPPING <mode>\",\"LEFT_EYE_TOP_VIEWPORT | LEFT_EYE_BOTTOM_VIEWPORT\");\nstatic ApplicationUsageProxy DisplaySetting_e10(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_AUTO_ADJUST_ASPECT_RATIO <mode>\",\"OFF | ON  Default to ON to compenstate for the compression of the aspect ratio when viewing in split screen stereo.  Note, if you are setting fovx and fovy explicityly OFF should be used.\");\nstatic ApplicationUsageProxy DisplaySetting_e11(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_VERTICAL_SEPARATION <float>\",\"number of pixels between viewports\");\nstatic ApplicationUsageProxy DisplaySetting_e12(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_MAX_NUMBER_OF_GRAPHICS_CONTEXTS <int>\",\"maximum number of graphics contexts to be used with applications.\");\n\nvoid DisplaySettings::readEnvironmentalVariables()\n{\n    char *ptr;\n    \n    if ((ptr = getenv(\"OSG_DISPLAY_TYPE\")) != 0)\n    {\n        if (strcmp(ptr,\"MONITOR\")==0)\n        {\n            _displayType = MONITOR;\n        }\n        else\n        if (strcmp(ptr,\"POWERWALL\")==0)\n        {\n            _displayType = POWERWALL;\n        }\n        else\n        if (strcmp(ptr,\"REALITY_CENTER\")==0)\n        {\n            _displayType = REALITY_CENTER;\n        }\n        else\n        if (strcmp(ptr,\"HEAD_MOUNTED_DISPLAY\")==0)\n        {\n            _displayType = HEAD_MOUNTED_DISPLAY;\n        }\n    }\n    \n    if( (ptr = getenv(\"OSG_STEREO_MODE\")) != 0)\n    {\n        if (strcmp(ptr,\"QUAD_BUFFER\")==0)\n        {\n            _stereoMode = QUAD_BUFFER;\n        }\n        else\n        if (strcmp(ptr,\"ANAGLYPHIC\")==0)\n        {\n            _stereoMode = ANAGLYPHIC;\n        }\n        else\n        if (strcmp(ptr,\"HORIZONTAL_SPLIT\")==0)\n        {\n            _stereoMode = HORIZONTAL_SPLIT;\n        }\n        else\n        if (strcmp(ptr,\"VERTICAL_SPLIT\")==0)\n        {\n            _stereoMode = VERTICAL_SPLIT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE\")==0)\n        {\n            _stereoMode = LEFT_EYE;\n        }\n        else\n        if (strcmp(ptr,\"RIGHT_EYE\")==0)\n        {\n            _stereoMode = RIGHT_EYE;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_STEREO\")) != 0)\n    {\n        if (strcmp(ptr,\"OFF\")==0)\n        {\n            _stereo = false;\n        }\n        else\n        if (strcmp(ptr,\"ON\")==0)\n        {\n            _stereo = true;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_EYE_SEPARATION\")) != 0)\n    {\n        _eyeSeparation = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_WIDTH\")) != 0)\n    {\n        _screenWidth = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_HEIGHT\")) != 0)\n    {\n        _screenHeight = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_DISTANCE\")) != 0)\n    {\n        _screenDistance = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_HORIZONTAL_EYE_MAPPING\")) != 0)\n    {\n        if (strcmp(ptr,\"LEFT_EYE_LEFT_VIEWPORT\")==0)\n        {\n            _splitStereoHorizontalEyeMapping = LEFT_EYE_LEFT_VIEWPORT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE_RIGHT_VIEWPORT\")==0)\n        {\n            _splitStereoHorizontalEyeMapping = LEFT_EYE_RIGHT_VIEWPORT;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_HORIZONTAL_SEPARATION\")) != 0)\n    {\n        _splitStereoHorizontalSeparation = atoi(ptr);\n    }\n\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_VERTICAL_EYE_MAPPING\")) != 0)\n    {\n        if (strcmp(ptr,\"LEFT_EYE_TOP_VIEWPORT\")==0)\n        {\n            _splitStereoVerticalEyeMapping = LEFT_EYE_TOP_VIEWPORT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE_BOTTOM_VIEWPORT\")==0)\n        {\n            _splitStereoVerticalEyeMapping = LEFT_EYE_BOTTOM_VIEWPORT;\n        }\n    }\n    \n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_AUTO_ADJUST_ASPECT_RATIO\")) != 0)\n    {\n        if (strcmp(ptr,\"OFF\")==0)\n        {\n            _splitStereoAutoAdjustAspectRatio = false;\n        }\n        else\n        if (strcmp(ptr,\"ON\")==0)\n        {\n            _splitStereoAutoAdjustAspectRatio = true;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_VERTICAL_SEPARATION\")) != 0)\n    {\n        _splitStereoVerticalSeparation = atoi(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_MAX_NUMBER_OF_GRAPHICS_CONTEXTS\")) != 0)\n    {\n        _maxNumOfGraphicsContexts = atoi(ptr);\n    }\n}\n\nvoid DisplaySettings::readCommandLine(ArgumentParser& arguments)\n{\n\n    \/\/ report the usage options.\n    if (arguments.getApplicationUsage())\n    {\n        arguments.getApplicationUsage()->addCommandLineOption(\"--display <type>\",\"MONITOR | POWERWALL | REALITY_CENTER | HEAD_MOUNTED_DISPLAY\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stereo\",\"Use default stereo mode which is ANAGLYPHIC if not overriden by environmental variable\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stereo <mode>\",\"ANAGLYPHIC | QUAD_BUFFER | HORIZONTAL_SPLIT | VERTICAL_SPLIT | LEFT_EYE | RIGHT_EYE | ON | OFF \");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--rgba\",\"Request a RGBA color buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stencil\",\"Request a stencil buffer visual\");\n    }\n\n    std::string str;\n    while(arguments.read(\"--display\",str))\n    {\n        if (str==\"MONITOR\") _displayType = MONITOR;\n        else if (str==\"POWERWALL\") _displayType = POWERWALL;\n        else if (str==\"REALITY_CENTER\") _displayType = REALITY_CENTER;\n        else if (str==\"HEAD_MOUNTED_DISPLAY\") _displayType = HEAD_MOUNTED_DISPLAY;\n    }\n\n    int pos;\n    while ((pos=arguments.find(\"--stereo\"))!=0)\n    {\n        if (arguments.match(pos+1,\"ANAGLYPHIC\"))            { arguments.remove(pos,2); _stereo = true;_stereoMode = ANAGLYPHIC; }\n        else if (arguments.match(pos+1,\"QUAD_BUFFER\"))      { arguments.remove(pos,2); _stereo = true;_stereoMode = QUAD_BUFFER; }\n        else if (arguments.match(pos+1,\"HORIZONTAL_SPLIT\")) { arguments.remove(pos,2); _stereo = true;_stereoMode = HORIZONTAL_SPLIT; }\n        else if (arguments.match(pos+1,\"VERTICAL_SPLIT\"))   { arguments.remove(pos,2); _stereo = true;_stereoMode = VERTICAL_SPLIT; }\n        else if (arguments.match(pos+1,\"LEFT_EYE\"))         { arguments.remove(pos,2); _stereo = true;_stereoMode = LEFT_EYE; }\n        else if (arguments.match(pos+1,\"RIGHT_EYE\"))        { arguments.remove(pos,2); _stereo = true;_stereoMode = RIGHT_EYE; }\n        else if (arguments.match(pos+1,\"ON\"))               { arguments.remove(pos,2); _stereo = true; }\n        else if (arguments.match(pos+1,\"OFF\"))              { arguments.remove(pos,2); _stereo = false; }\n        else                                                { arguments.remove(pos); _stereo = true; }\n    }\n\n    while (arguments.read(\"--rgba\"))\n    {\n        _RGB = true;\n        _minimumNumberAlphaBits = 1;\n    }            \n\n    while (arguments.read(\"--stencil\"))\n    {\n        _minimumNumberStencilBits = 1;\n    }\n}\n<commit_msg>Added missing copy of _stereo<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2005 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#include <osg\/DisplaySettings>\n#include <osg\/ArgumentParser>\n#include <osg\/ApplicationUsage>\n#include <osg\/ref_ptr>\n\n#include <algorithm>\n\nusing namespace osg;\nusing namespace std;\n\nDisplaySettings* DisplaySettings::instance()\n{\n    static ref_ptr<DisplaySettings> s_displaySettings = new DisplaySettings;\n    return s_displaySettings.get();\n}\n\nDisplaySettings::DisplaySettings(const DisplaySettings& vs):Referenced()\n{\n    setDisplaySettings(vs);\n}\n\nDisplaySettings::~DisplaySettings()\n{\n}\n\n \n DisplaySettings& DisplaySettings::operator = (const DisplaySettings& vs)\n{\n    if (this==&vs) return *this;\n    setDisplaySettings(vs);\n    return *this;\n}\n\nvoid DisplaySettings::setDisplaySettings(const DisplaySettings& vs)\n{\n    _displayType = vs._displayType;\n    _stereo = vs._stereo;\n    _stereoMode = vs._stereoMode;\n    _eyeSeparation = vs._eyeSeparation;\n    _screenWidth = vs._screenWidth;\n    _screenHeight = vs._screenHeight;\n    _screenDistance = vs._screenDistance;\n\n    _splitStereoHorizontalEyeMapping = vs._splitStereoHorizontalEyeMapping;\n    _splitStereoHorizontalSeparation = vs._splitStereoHorizontalSeparation;\n\n    _splitStereoVerticalEyeMapping = vs._splitStereoVerticalEyeMapping;\n    _splitStereoVerticalSeparation = vs._splitStereoVerticalSeparation;\n    \n    _splitStereoAutoAdjustAspectRatio = vs._splitStereoAutoAdjustAspectRatio;\n\n    _doubleBuffer = vs._doubleBuffer;\n    _RGB = vs._RGB;\n    _depthBuffer = vs._depthBuffer;\n    _minimumNumberAlphaBits = vs._minimumNumberAlphaBits;\n    _minimumNumberStencilBits = vs._minimumNumberStencilBits;\n\n    _maxNumOfGraphicsContexts = vs._maxNumOfGraphicsContexts;\n}\n\nvoid DisplaySettings::merge(const DisplaySettings& vs)\n{\n    if (_stereo       || vs._stereo)        _stereo = true;\n    \n    \/\/ need to think what to do about merging the stereo mode.\n    \n    if (_doubleBuffer || vs._doubleBuffer)  _doubleBuffer = true;\n    if (_RGB          || vs._RGB)           _RGB = true;\n    if (_depthBuffer  || vs._depthBuffer)   _depthBuffer = true;\n    \n    if (vs._minimumNumberAlphaBits>_minimumNumberAlphaBits) _minimumNumberAlphaBits = vs._minimumNumberAlphaBits;\n    if (vs._minimumNumberStencilBits>_minimumNumberStencilBits) _minimumNumberStencilBits = vs._minimumNumberStencilBits;\n}\n\nvoid DisplaySettings::setDefaults()\n{\n    _displayType = MONITOR;\n\n    _stereo = false;\n    _stereoMode = ANAGLYPHIC;\n    _eyeSeparation = 0.05f;\n    _screenWidth = 0.325f;\n    _screenHeight = 0.26f;\n    _screenDistance = 0.5f;\n\n    _splitStereoHorizontalEyeMapping = LEFT_EYE_LEFT_VIEWPORT;\n    _splitStereoHorizontalSeparation = 0;\n\n    _splitStereoVerticalEyeMapping = LEFT_EYE_TOP_VIEWPORT;\n    _splitStereoVerticalSeparation = 0;\n\n    _splitStereoAutoAdjustAspectRatio = true;\n\n    _doubleBuffer = true;\n    _RGB = true;\n    _depthBuffer = true;\n    _minimumNumberAlphaBits = 0;\n    _minimumNumberStencilBits = 0;\n    \n    _maxNumOfGraphicsContexts = 3;\n}\n\nstatic ApplicationUsageProxy DisplaySetting_e0(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_DISPLAY_TYPE <type>\",\"MONITOR | POWERWALL | REALITY_CENTER | HEAD_MOUNTED_DISPLAY\");\nstatic ApplicationUsageProxy DisplaySetting_e1(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_STEREO_MODE <mode>\",\"QUAD_BUFFER | ANAGLYPHIC | HORIZONTAL_SPLIT | VERTICAL_SPLIT | LEFT_EYE | RIGHT_EYE\");\nstatic ApplicationUsageProxy DisplaySetting_e2(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_STEREO <mode>\",\"OFF | ON\");\nstatic ApplicationUsageProxy DisplaySetting_e3(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_EYE_SEPARATION <float>\",\"physical distance between eyes\");\nstatic ApplicationUsageProxy DisplaySetting_e4(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_DISTANCE <float>\",\"physical distance between eyes and screen\");\nstatic ApplicationUsageProxy DisplaySetting_e5(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_HEIGHT <float>\",\"physical screen height\");\nstatic ApplicationUsageProxy DisplaySetting_e6(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SCREEN_WIDTH <float>\",\"physical screen width\");\nstatic ApplicationUsageProxy DisplaySetting_e7(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_HORIZONTAL_EYE_MAPPING <mode>\",\"LEFT_EYE_LEFT_VIEWPORT | LEFT_EYE_RIGHT_VIEWPORT\");\nstatic ApplicationUsageProxy DisplaySetting_e8(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_HORIZONTAL_SEPARATION <float>\",\"number of pixels between viewports\");\nstatic ApplicationUsageProxy DisplaySetting_e9(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_VERTICAL_EYE_MAPPING <mode>\",\"LEFT_EYE_TOP_VIEWPORT | LEFT_EYE_BOTTOM_VIEWPORT\");\nstatic ApplicationUsageProxy DisplaySetting_e10(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_AUTO_ADJUST_ASPECT_RATIO <mode>\",\"OFF | ON  Default to ON to compenstate for the compression of the aspect ratio when viewing in split screen stereo.  Note, if you are setting fovx and fovy explicityly OFF should be used.\");\nstatic ApplicationUsageProxy DisplaySetting_e11(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_SPLIT_STEREO_VERTICAL_SEPARATION <float>\",\"number of pixels between viewports\");\nstatic ApplicationUsageProxy DisplaySetting_e12(ApplicationUsage::ENVIRONMENTAL_VARIABLE,\"OSG_MAX_NUMBER_OF_GRAPHICS_CONTEXTS <int>\",\"maximum number of graphics contexts to be used with applications.\");\n\nvoid DisplaySettings::readEnvironmentalVariables()\n{\n    char *ptr;\n    \n    if ((ptr = getenv(\"OSG_DISPLAY_TYPE\")) != 0)\n    {\n        if (strcmp(ptr,\"MONITOR\")==0)\n        {\n            _displayType = MONITOR;\n        }\n        else\n        if (strcmp(ptr,\"POWERWALL\")==0)\n        {\n            _displayType = POWERWALL;\n        }\n        else\n        if (strcmp(ptr,\"REALITY_CENTER\")==0)\n        {\n            _displayType = REALITY_CENTER;\n        }\n        else\n        if (strcmp(ptr,\"HEAD_MOUNTED_DISPLAY\")==0)\n        {\n            _displayType = HEAD_MOUNTED_DISPLAY;\n        }\n    }\n    \n    if( (ptr = getenv(\"OSG_STEREO_MODE\")) != 0)\n    {\n        if (strcmp(ptr,\"QUAD_BUFFER\")==0)\n        {\n            _stereoMode = QUAD_BUFFER;\n        }\n        else\n        if (strcmp(ptr,\"ANAGLYPHIC\")==0)\n        {\n            _stereoMode = ANAGLYPHIC;\n        }\n        else\n        if (strcmp(ptr,\"HORIZONTAL_SPLIT\")==0)\n        {\n            _stereoMode = HORIZONTAL_SPLIT;\n        }\n        else\n        if (strcmp(ptr,\"VERTICAL_SPLIT\")==0)\n        {\n            _stereoMode = VERTICAL_SPLIT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE\")==0)\n        {\n            _stereoMode = LEFT_EYE;\n        }\n        else\n        if (strcmp(ptr,\"RIGHT_EYE\")==0)\n        {\n            _stereoMode = RIGHT_EYE;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_STEREO\")) != 0)\n    {\n        if (strcmp(ptr,\"OFF\")==0)\n        {\n            _stereo = false;\n        }\n        else\n        if (strcmp(ptr,\"ON\")==0)\n        {\n            _stereo = true;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_EYE_SEPARATION\")) != 0)\n    {\n        _eyeSeparation = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_WIDTH\")) != 0)\n    {\n        _screenWidth = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_HEIGHT\")) != 0)\n    {\n        _screenHeight = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SCREEN_DISTANCE\")) != 0)\n    {\n        _screenDistance = atof(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_HORIZONTAL_EYE_MAPPING\")) != 0)\n    {\n        if (strcmp(ptr,\"LEFT_EYE_LEFT_VIEWPORT\")==0)\n        {\n            _splitStereoHorizontalEyeMapping = LEFT_EYE_LEFT_VIEWPORT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE_RIGHT_VIEWPORT\")==0)\n        {\n            _splitStereoHorizontalEyeMapping = LEFT_EYE_RIGHT_VIEWPORT;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_HORIZONTAL_SEPARATION\")) != 0)\n    {\n        _splitStereoHorizontalSeparation = atoi(ptr);\n    }\n\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_VERTICAL_EYE_MAPPING\")) != 0)\n    {\n        if (strcmp(ptr,\"LEFT_EYE_TOP_VIEWPORT\")==0)\n        {\n            _splitStereoVerticalEyeMapping = LEFT_EYE_TOP_VIEWPORT;\n        }\n        else\n        if (strcmp(ptr,\"LEFT_EYE_BOTTOM_VIEWPORT\")==0)\n        {\n            _splitStereoVerticalEyeMapping = LEFT_EYE_BOTTOM_VIEWPORT;\n        }\n    }\n    \n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_AUTO_ADJUST_ASPECT_RATIO\")) != 0)\n    {\n        if (strcmp(ptr,\"OFF\")==0)\n        {\n            _splitStereoAutoAdjustAspectRatio = false;\n        }\n        else\n        if (strcmp(ptr,\"ON\")==0)\n        {\n            _splitStereoAutoAdjustAspectRatio = true;\n        }\n    }\n\n    if( (ptr = getenv(\"OSG_SPLIT_STEREO_VERTICAL_SEPARATION\")) != 0)\n    {\n        _splitStereoVerticalSeparation = atoi(ptr);\n    }\n\n    if( (ptr = getenv(\"OSG_MAX_NUMBER_OF_GRAPHICS_CONTEXTS\")) != 0)\n    {\n        _maxNumOfGraphicsContexts = atoi(ptr);\n    }\n}\n\nvoid DisplaySettings::readCommandLine(ArgumentParser& arguments)\n{\n\n    \/\/ report the usage options.\n    if (arguments.getApplicationUsage())\n    {\n        arguments.getApplicationUsage()->addCommandLineOption(\"--display <type>\",\"MONITOR | POWERWALL | REALITY_CENTER | HEAD_MOUNTED_DISPLAY\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stereo\",\"Use default stereo mode which is ANAGLYPHIC if not overriden by environmental variable\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stereo <mode>\",\"ANAGLYPHIC | QUAD_BUFFER | HORIZONTAL_SPLIT | VERTICAL_SPLIT | LEFT_EYE | RIGHT_EYE | ON | OFF \");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--rgba\",\"Request a RGBA color buffer visual\");\n        arguments.getApplicationUsage()->addCommandLineOption(\"--stencil\",\"Request a stencil buffer visual\");\n    }\n\n    std::string str;\n    while(arguments.read(\"--display\",str))\n    {\n        if (str==\"MONITOR\") _displayType = MONITOR;\n        else if (str==\"POWERWALL\") _displayType = POWERWALL;\n        else if (str==\"REALITY_CENTER\") _displayType = REALITY_CENTER;\n        else if (str==\"HEAD_MOUNTED_DISPLAY\") _displayType = HEAD_MOUNTED_DISPLAY;\n    }\n\n    int pos;\n    while ((pos=arguments.find(\"--stereo\"))!=0)\n    {\n        if (arguments.match(pos+1,\"ANAGLYPHIC\"))            { arguments.remove(pos,2); _stereo = true;_stereoMode = ANAGLYPHIC; }\n        else if (arguments.match(pos+1,\"QUAD_BUFFER\"))      { arguments.remove(pos,2); _stereo = true;_stereoMode = QUAD_BUFFER; }\n        else if (arguments.match(pos+1,\"HORIZONTAL_SPLIT\")) { arguments.remove(pos,2); _stereo = true;_stereoMode = HORIZONTAL_SPLIT; }\n        else if (arguments.match(pos+1,\"VERTICAL_SPLIT\"))   { arguments.remove(pos,2); _stereo = true;_stereoMode = VERTICAL_SPLIT; }\n        else if (arguments.match(pos+1,\"LEFT_EYE\"))         { arguments.remove(pos,2); _stereo = true;_stereoMode = LEFT_EYE; }\n        else if (arguments.match(pos+1,\"RIGHT_EYE\"))        { arguments.remove(pos,2); _stereo = true;_stereoMode = RIGHT_EYE; }\n        else if (arguments.match(pos+1,\"ON\"))               { arguments.remove(pos,2); _stereo = true; }\n        else if (arguments.match(pos+1,\"OFF\"))              { arguments.remove(pos,2); _stereo = false; }\n        else                                                { arguments.remove(pos); _stereo = true; }\n    }\n\n    while (arguments.read(\"--rgba\"))\n    {\n        _RGB = true;\n        _minimumNumberAlphaBits = 1;\n    }            \n\n    while (arguments.read(\"--stencil\"))\n    {\n        _minimumNumberStencilBits = 1;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009 - Mozy, Inc.\n\n#include <boost\/bind.hpp>\n\n#include \"sleep.h\"\n\n#include \"assert.h\"\n#include \"fiber.h\"\n#include \"scheduler.h\"\n#include \"timer.h\"\n\nnamespace Mordor {\n\nstatic void scheduleMe(Scheduler *scheduler, Fiber::ptr fiber)\n{\n    scheduler->schedule(fiber);\n}\n\nvoid\nsleep(TimerManager &timerManager, unsigned long long us)\n{\n    MORDOR_ASSERT(Scheduler::getThis());\n    timerManager.registerTimer(us,\n        boost::bind(&scheduleMe, Scheduler::getThis(), Fiber::getThis()));\n    Scheduler::yieldTo();\n}\n\nvoid\nsleep(unsigned long long us)\n{\n#ifdef WINDOWS\n    Sleep((DWORD)(us \/ 1000));\n#else\n    struct timespec ts;\n    ts.tv_sec = us \/ 1000000;\n    ts.tv_nsec = (us % 1000) * 1000;\n    while (true) {\n        if (nanosleep(&ts, &ts) == -1) {\n            if (errno == EINTR)\n                continue;\n            MORDOR_THROW_EXCEPTION_FROM_LAST_ERROR_API(\"nanosleep\");\n        }\n        break;\n    }\n#endif\n}\n\n}\n<commit_msg>fix for sleep on posix<commit_after>\/\/ Copyright (c) 2009 - Mozy, Inc.\n\n#include <boost\/bind.hpp>\n\n#include \"sleep.h\"\n\n#include \"assert.h\"\n#include \"fiber.h\"\n#include \"scheduler.h\"\n#include \"timer.h\"\n\nnamespace Mordor {\n\nstatic void scheduleMe(Scheduler *scheduler, Fiber::ptr fiber)\n{\n    scheduler->schedule(fiber);\n}\n\nvoid\nsleep(TimerManager &timerManager, unsigned long long us)\n{\n    MORDOR_ASSERT(Scheduler::getThis());\n    timerManager.registerTimer(us,\n        boost::bind(&scheduleMe, Scheduler::getThis(), Fiber::getThis()));\n    Scheduler::yieldTo();\n}\n\nvoid\nsleep(unsigned long long us)\n{\n#ifdef WINDOWS\n    Sleep((DWORD)(us \/ 1000));\n#else\n    struct timespec ts;\n    ts.tv_sec = us \/ 1000000;\n    ts.tv_nsec = (us % 1000000) * 1000;\n    while (true) {\n        if (nanosleep(&ts, &ts) == -1) {\n            if (errno == EINTR)\n                continue;\n            MORDOR_THROW_EXCEPTION_FROM_LAST_ERROR_API(\"nanosleep\");\n        }\n        break;\n    }\n#endif\n}\n\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 URI_HPP\n#define URI_HPP\n\n#include <gsl.h>\n#include <unordered_map>\n\nnamespace uri {\n\n  \/**\n   * Representation of RFC 3986 URI's.\n   * Ref. https:\/\/tools.ietf.org\/html\/rfc3986\n   **\/\n  class URI {\n  public:\n    \/*\n     * Default constructor\n     *\/\n    URI() = default;\n\n    \/*\n     * Default copy and move constructors\n     *\/\n    URI(URI&) = default;\n    URI(URI&&) = default;\n\n    \/*\n     * Default destructor\n     *\/\n    ~URI() = default;\n\n    \/*\n     * Default assignment operators\n     *\/\n    URI& operator=(const URI&) = default;\n    URI& operator=(URI&&) = default;\n\n    \/\/\n    \/\/ We might do a span-based constructor later.\n    \/\/ URI(gsl::span<const char>);\n    \/\/\n\n    \/**\n     * @brief Construct using a C-String\n     *\n     * @param uri : A C-String representing a uri\n     *\/\n    URI(const char* uri);\n\n    \/**\n     * @brief Construct using a string\n     *\n     * @param uri : A string representing a uri\n     *\/\n    URI(const std::string& uri);\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/----------RFC-specified URI parts----------\/\/\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    \/**\n     * @brief Get scheme.\n     *\n     * E.g. 'http', 'file', 'ftp' etc.\n     *\n     * @return The scheme\n     *\/\n    const std::string& scheme() const;\n\n    \/**\n     * @brief Get userinfo.\n     *\n     * E.g. 'username@'...\n     *\n     * @return The user's information\n     *\/\n    const std::string& userinfo() const;\n\n    \/**\n     * @brief Get host.\n     *\n     * E.g. 'includeos.org', '10.0.0.42' etc.\n     *\n     * @return The host's information\n     *\/\n    const std::string& host() const;\n\n    \/**\n     * @brief Get the raw port number in decimal character representation.\n     *\n     * @return The raw port number as a string\n     *\/\n    const std::string& port_str() const;\n\n    \/**\n     * @brief Get numeric port number.\n     *\n     * @warning The RFC doesn't specify dimension. This funcion will truncate\n     * any overflowing digits.\n     *\n     * @return The numeric port number as a 16-bit number\n     *\/\n    uint16_t port() const noexcept;\n\n    \/**\n     * @brief Get the path.\n     *\n     * E.g. \/pictures\/logo.png \n     *\n     * @return The path information\n     *\/\n    const std::string& path() const;\n\n    \/**\n     * @brief Get the complete unparsed query string.\n     *\n     * @return The complete unparsed query string\n     *\/\n    const std::string& query() const;\n\n    \/**\n     * @brief Get the fragment part.\n     *\n     * E.g. \"...#anchor1\"\n     *\n     * @return the fragment part\n     *\/\n    const std::string& fragment() const;\n\n    \/**\n     * @brief Get the URI-decoded value of a query-string key.\n     *\n     * @param key : The key to find the associated value\n     *\n     * @return The key's associated value\n     *\n     * @example For the query: \"?name=Bjarne%20Stroustrup\",\n     * query(\"name\") returns \"Bjarne Stroustrup\"\n     *\/\n    const std::string& query(const std::string& key);\n\n    \/**\n     * @brief Get a string representation of this\n     * class\n     *\n     * @return - A string representation\n     *\/\n    std::string to_string() const;\n\n    \/**\n     * @brief Operator to transform this class\n     * into string form\n     *\/\n    operator std::string () const;\n\n  private:\n    \/*\n     * A copy of the data representing a uri\n     *\/\n    std::string uri_str_;\n\n    mutable uint16_t port_;\n\n    Span_t scheme_;\n    Span_t userinfo_;\n    Span_t host_;\n    Span_t port_str_;\n    Span_t path_;\n    Span_t query_;\n    Span_t fragment_;\n\n    static const Span_t zero_span_;\n\n    std::unordered_map<std::string,std::string> queries_;\n\n    \/**\n     * @brief Parse the given string representing a uri\n     * into its given parts according to RFC 3986\n     *\n     * @param uri : The string representing a uri\n     *\/\n    void parse(const std::string& uri);\n\n    \/**\n     * @brief Load queries into the map\n     *\/\n    void load_queries();\n\n  }; \/\/ class uri::URI\n\n  \/**\n   * @brief Operator to stream the contents of a {URI}\n   * to the specified output stream device\n   *\n   * @param output_device : The output stream device\n   * @param uri : The {URI} to send to the output stream\n   *\n   * @return A reference to the specified output stream device\n   *\/\n  std::ostream& operator<< (std::ostream& output_device, const URI& uri);\n\n} \/\/ namespace uri\n\n#endif \/\/< URI_HPP\n<commit_msg>Updated API Doc for URI(const std::string&)<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 URI_HPP\n#define URI_HPP\n\n#include <gsl.h>\n#include <unordered_map>\n\nnamespace uri {\n\n  \/**\n   * Representation of RFC 3986 URI's.\n   * Ref. https:\/\/tools.ietf.org\/html\/rfc3986\n   **\/\n  class URI {\n  public:\n    \/*\n     * Default constructor\n     *\/\n    URI() = default;\n\n    \/*\n     * Default copy and move constructors\n     *\/\n    URI(URI&) = default;\n    URI(URI&&) = default;\n\n    \/*\n     * Default destructor\n     *\/\n    ~URI() = default;\n\n    \/*\n     * Default assignment operators\n     *\/\n    URI& operator=(const URI&) = default;\n    URI& operator=(URI&&) = default;\n\n    \/\/\n    \/\/ We might do a span-based constructor later.\n    \/\/ URI(gsl::span<const char>);\n    \/\/\n\n    \/**\n     * @brief Construct using a C-String\n     *\n     * @param uri : A C-String representing a uri\n     *\/\n    URI(const char* uri);\n\n    \/**\n     * @brief Construct using a {std::string}\n     *\n     * @param uri : A {std::string} representing a uri\n     *\/\n    URI(const std::string& uri);\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/----------RFC-specified URI parts----------\/\/\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    \/**\n     * @brief Get scheme.\n     *\n     * E.g. 'http', 'file', 'ftp' etc.\n     *\n     * @return The scheme\n     *\/\n    const std::string& scheme() const;\n\n    \/**\n     * @brief Get userinfo.\n     *\n     * E.g. 'username@'...\n     *\n     * @return The user's information\n     *\/\n    const std::string& userinfo() const;\n\n    \/**\n     * @brief Get host.\n     *\n     * E.g. 'includeos.org', '10.0.0.42' etc.\n     *\n     * @return The host's information\n     *\/\n    const std::string& host() const;\n\n    \/**\n     * @brief Get the raw port number in decimal character representation.\n     *\n     * @return The raw port number as a string\n     *\/\n    const std::string& port_str() const;\n\n    \/**\n     * @brief Get numeric port number.\n     *\n     * @warning The RFC doesn't specify dimension. This funcion will truncate\n     * any overflowing digits.\n     *\n     * @return The numeric port number as a 16-bit number\n     *\/\n    uint16_t port() const noexcept;\n\n    \/**\n     * @brief Get the path.\n     *\n     * E.g. \/pictures\/logo.png \n     *\n     * @return The path information\n     *\/\n    const std::string& path() const;\n\n    \/**\n     * @brief Get the complete unparsed query string.\n     *\n     * @return The complete unparsed query string\n     *\/\n    const std::string& query() const;\n\n    \/**\n     * @brief Get the fragment part.\n     *\n     * E.g. \"...#anchor1\"\n     *\n     * @return the fragment part\n     *\/\n    const std::string& fragment() const;\n\n    \/**\n     * @brief Get the URI-decoded value of a query-string key.\n     *\n     * @param key : The key to find the associated value\n     *\n     * @return The key's associated value\n     *\n     * @example For the query: \"?name=Bjarne%20Stroustrup\",\n     * query(\"name\") returns \"Bjarne Stroustrup\"\n     *\/\n    const std::string& query(const std::string& key);\n\n    \/**\n     * @brief Get a string representation of this\n     * class\n     *\n     * @return - A string representation\n     *\/\n    std::string to_string() const;\n\n    \/**\n     * @brief Operator to transform this class\n     * into string form\n     *\/\n    operator std::string () const;\n\n  private:\n    \/*\n     * A copy of the data representing a uri\n     *\/\n    std::string uri_str_;\n\n    mutable uint16_t port_;\n\n    Span_t scheme_;\n    Span_t userinfo_;\n    Span_t host_;\n    Span_t port_str_;\n    Span_t path_;\n    Span_t query_;\n    Span_t fragment_;\n\n    static const Span_t zero_span_;\n\n    std::unordered_map<std::string,std::string> queries_;\n\n    \/**\n     * @brief Parse the given string representing a uri\n     * into its given parts according to RFC 3986\n     *\n     * @param uri : The string representing a uri\n     *\/\n    void parse(const std::string& uri);\n\n    \/**\n     * @brief Load queries into the map\n     *\/\n    void load_queries();\n\n  }; \/\/ class uri::URI\n\n  \/**\n   * @brief Operator to stream the contents of a {URI}\n   * to the specified output stream device\n   *\n   * @param output_device : The output stream device\n   * @param uri : The {URI} to send to the output stream\n   *\n   * @return A reference to the specified output stream device\n   *\/\n  std::ostream& operator<< (std::ostream& output_device, const URI& uri);\n\n} \/\/ namespace uri\n\n#endif \/\/< URI_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************\\\n\n  Auto-generated perc.cpp\n\n  This file contains the auto-generated main plugin object\n  implementation for the perc project\n\n\\**********************************************************\/\n\n#include \"percAPI.h\"\n\n#include \"perc.h\"\n#include <windows.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @fn perc::StaticInitialize()\n\/\/\/\n\/\/\/ @brief  Called from PluginFactory::globalPluginInitialize()\n\/\/\/\n\/\/\/ @see FB::FactoryBase::globalPluginInitialize\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid perc::StaticInitialize()\n{\n    \/\/ Place one-time initialization stuff here; As of FireBreath 1.4 this should only\n    \/\/ be called once per process\n\n\tMessageBox(NULL, L\"StaticInitialize\", L\"\", 0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @fn perc::StaticInitialize()\n\/\/\/\n\/\/\/ @brief  Called from PluginFactory::globalPluginDeinitialize()\n\/\/\/\n\/\/\/ @see FB::FactoryBase::globalPluginDeinitialize\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid perc::StaticDeinitialize()\n{\n    \/\/ Place one-time deinitialization stuff here. As of FireBreath 1.4 this should\n    \/\/ always be called just before the plugin library is unloaded\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief  perc constructor.  Note that your API is not available\n\/\/\/         at this point, nor the window.  For best results wait to use\n\/\/\/         the JSAPI object until the onPluginReady method is called\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nperc::perc()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief  perc destructor.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nperc::~perc()\n{\n    \/\/ This is optional, but if you reset m_api (the shared_ptr to your JSAPI\n    \/\/ root object) and tell the host to free the retained JSAPI objects then\n    \/\/ unless you are holding another shared_ptr reference to your JSAPI object\n    \/\/ they will be released here.\n    releaseRootJSAPI();\n    m_host->freeRetainedObjects();\n}\n\nvoid perc::onPluginReady()\n{\n    \/\/ When this is called, the BrowserHost is attached, the JSAPI object is\n    \/\/ created, and we are ready to interact with the page and such.  The\n    \/\/ PluginWindow may or may not have already fire the AttachedEvent at\n    \/\/ this point.\n}\n\nvoid perc::shutdown()\n{\n    \/\/ This will be called when it is time for the plugin to shut down;\n    \/\/ any threads or anything else that may hold a shared_ptr to this\n    \/\/ object should be released here so that this object can be safely\n    \/\/ destroyed. This is the last point that shared_from_this and weak_ptr\n    \/\/ references to this object will be valid\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief  Creates an instance of the JSAPI object that provides your main\n\/\/\/         Javascript interface.\n\/\/\/\n\/\/\/ Note that m_host is your BrowserHost and shared_ptr returns a\n\/\/\/ FB::PluginCorePtr, which can be used to provide a\n\/\/\/ boost::weak_ptr<perc> for your JSAPI class.\n\/\/\/\n\/\/\/ Be very careful where you hold a shared_ptr to your plugin class from,\n\/\/\/ as it could prevent your plugin class from getting destroyed properly.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nFB::JSAPIPtr perc::createJSAPI()\n{\n    \/\/ m_host is the BrowserHost\n    return boost::make_shared<percAPI>(FB::ptr_cast<perc>(shared_from_this()), m_host);\n}\n\nbool perc::onMouseDown(FB::MouseDownEvent *evt, FB::PluginWindow *)\n{\n    \/\/printf(\"Mouse down at: %d, %d\\n\", evt->m_x, evt->m_y);\n    return false;\n}\n\nbool perc::onMouseUp(FB::MouseUpEvent *evt, FB::PluginWindow *)\n{\n    \/\/printf(\"Mouse up at: %d, %d\\n\", evt->m_x, evt->m_y);\n    return false;\n}\n\nbool perc::onMouseMove(FB::MouseMoveEvent *evt, FB::PluginWindow *)\n{\n    \/\/printf(\"Mouse move at: %d, %d\\n\", evt->m_x, evt->m_y);\n    return false;\n}\nbool perc::onWindowAttached(FB::AttachedEvent *evt, FB::PluginWindow *)\n{\n    \/\/ The window is attached; act appropriately\n    return false;\n}\n\nbool perc::onWindowDetached(FB::DetachedEvent *evt, FB::PluginWindow *)\n{\n    \/\/ The window is about to be detached; act appropriately\n    return false;\n}\n\n<commit_msg>Stop putting up a message box when loading the plugin.<commit_after>\/**********************************************************\\\n\n  Auto-generated perc.cpp\n\n  This file contains the auto-generated main plugin object\n  implementation for the perc project\n\n\\**********************************************************\/\n\n#include \"percAPI.h\"\n\n#include \"perc.h\"\n#include <windows.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @fn perc::StaticInitialize()\n\/\/\/\n\/\/\/ @brief  Called from PluginFactory::globalPluginInitialize()\n\/\/\/\n\/\/\/ @see FB::FactoryBase::globalPluginInitialize\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid perc::StaticInitialize()\n{\n    \/\/ Place one-time initialization stuff here; As of FireBreath 1.4 this should only\n    \/\/ be called once per process\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @fn perc::StaticInitialize()\n\/\/\/\n\/\/\/ @brief  Called from PluginFactory::globalPluginDeinitialize()\n\/\/\/\n\/\/\/ @see FB::FactoryBase::globalPluginDeinitialize\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid perc::StaticDeinitialize()\n{\n    \/\/ Place one-time deinitialization stuff here. As of FireBreath 1.4 this should\n    \/\/ always be called just before the plugin library is unloaded\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief  perc constructor.  Note that your API is not available\n\/\/\/         at this point, nor the window.  For best results wait to use\n\/\/\/         the JSAPI object until the onPluginReady method is called\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nperc::perc()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief  perc destructor.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nperc::~perc()\n{\n    \/\/ This is optional, but if you reset m_api (the shared_ptr to your JSAPI\n    \/\/ root object) and tell the host to free the retained JSAPI objects then\n    \/\/ unless you are holding another shared_ptr reference to your JSAPI object\n    \/\/ they will be released here.\n    releaseRootJSAPI();\n    m_host->freeRetainedObjects();\n}\n\nvoid perc::onPluginReady()\n{\n    \/\/ When this is called, the BrowserHost is attached, the JSAPI object is\n    \/\/ created, and we are ready to interact with the page and such.  The\n    \/\/ PluginWindow may or may not have already fire the AttachedEvent at\n    \/\/ this point.\n}\n\nvoid perc::shutdown()\n{\n    \/\/ This will be called when it is time for the plugin to shut down;\n    \/\/ any threads or anything else that may hold a shared_ptr to this\n    \/\/ object should be released here so that this object can be safely\n    \/\/ destroyed. This is the last point that shared_from_this and weak_ptr\n    \/\/ references to this object will be valid\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief  Creates an instance of the JSAPI object that provides your main\n\/\/\/         Javascript interface.\n\/\/\/\n\/\/\/ Note that m_host is your BrowserHost and shared_ptr returns a\n\/\/\/ FB::PluginCorePtr, which can be used to provide a\n\/\/\/ boost::weak_ptr<perc> for your JSAPI class.\n\/\/\/\n\/\/\/ Be very careful where you hold a shared_ptr to your plugin class from,\n\/\/\/ as it could prevent your plugin class from getting destroyed properly.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nFB::JSAPIPtr perc::createJSAPI()\n{\n    \/\/ m_host is the BrowserHost\n    return boost::make_shared<percAPI>(FB::ptr_cast<perc>(shared_from_this()), m_host);\n}\n\nbool perc::onMouseDown(FB::MouseDownEvent *evt, FB::PluginWindow *)\n{\n    \/\/printf(\"Mouse down at: %d, %d\\n\", evt->m_x, evt->m_y);\n    return false;\n}\n\nbool perc::onMouseUp(FB::MouseUpEvent *evt, FB::PluginWindow *)\n{\n    \/\/printf(\"Mouse up at: %d, %d\\n\", evt->m_x, evt->m_y);\n    return false;\n}\n\nbool perc::onMouseMove(FB::MouseMoveEvent *evt, FB::PluginWindow *)\n{\n    \/\/printf(\"Mouse move at: %d, %d\\n\", evt->m_x, evt->m_y);\n    return false;\n}\nbool perc::onWindowAttached(FB::AttachedEvent *evt, FB::PluginWindow *)\n{\n    \/\/ The window is attached; act appropriately\n    return false;\n}\n\nbool perc::onWindowDetached(FB::DetachedEvent *evt, FB::PluginWindow *)\n{\n    \/\/ The window is about to be detached; act appropriately\n    return false;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/sg: this is going to be the primary vision node for qubo (or future robots, whatever)\n#include \"vision_node.h\"\n\nusing namespace std;\nusing namespace ros;\nusing namespace AVT::VmbAPI;\n\n\nint VisionNode::vmb_err(const int func_call, const string err_msg) {\n\tif (func_call != VmbErrorSuccess){\n\t\tROS_ERROR(\"%s, code: %i\", err_msg.c_str(), func_call);\n\t\treturn func_call;\n\t}\n\treturn func_call;\n}\n\n\n\/\/you need to pass in a node handle, and a camera feed, which should be a file path either to a physical device or to a video  \nVisionNode::VisionNode(NodeHandle n, NodeHandle np, string feed)\n\t:\tm_buoy_server(n, \"buoy_action\", boost::bind(&VisionNode::findBuoy, this, _1, &m_buoy_server), false),\n\t\tm_gate_server(n, \"gate_action\", boost::bind(&VisionNode::findGate, this, _1, &m_gate_server), false),\n\t\tm_blob_server(n, \"blob_action\", boost::bind(&VisionNode::findBlob, this, _1, &m_blob_server), false)\n\n{\n\n\t\/\/ isdigit makes sure checks if we're dealing with a number (like if want to open the default camera by passing a 0). If we are we convert our string to an int (VideoCapture won't correctly open the camera with the string in this case);\n\t\/\/this could give us problems if we pass something like \"0followed_by_string\" but just don't do that.\n\n\t\/\/sgillen@20170429-07:04 we really don't even need this... we can just pass in \/dev\/video0 if we want the web camera... I'll leave it for now though\n\tif(isdigit(feed.c_str()[0])){\n\t\tm_cap = cv::VideoCapture(atoi(feed.c_str()));\n\t}\n\telse{\n\t\tm_cap = cv::VideoCapture(feed);\n\t}\n\n\n\t\t\/\/make sure we have something valid\n    if(!m_cap.isOpened()){           \n        ROS_ERROR(\"couldn't open file\/camera  %s\\n now exiting\" ,feed.c_str());\n        exit(0);\n    }\n\t\n\n\t\/\/TODO give option to user to specify the name of the video\n\t\/\/TODO make sure this doesn't fail when specifying a directory that does not yet exist\n\t\n\tstring output_dir;\n\tnp.param<string>(\"output_dir\", output_dir, \"\"); \/\/this line will populate the output_dir variable if it's specified in the launch file\n\n\t\/\/TODO change variable names\n\tif(!output_dir.empty()){\n\t\t\n\t\tstringstream output_ss;\n\t\tauto t = time(nullptr);\n\t\tauto tm = *localtime(&t);\n\n\t\toutput_ss << output_dir;\n\t\toutput_ss << put_time(&tm, \"%Y%m%d_%H-%M-%S\");\n\t\toutput_ss << \".avi\";\n\t\t\n\t\tstring output_str = output_ss.str();\n\t\t\n\t\tint ex = static_cast<int>(m_cap.get(CV_CAP_PROP_FOURCC));\n\n\t\tcv::Size S = cv::Size((int) m_cap.get(CV_CAP_PROP_FRAME_WIDTH),    \/\/ Acquire input size\n\t\t\t\t\t  (int) m_cap.get(CV_CAP_PROP_FRAME_HEIGHT));\n\t\t\n\n\t\t\/\/sgillen@20172107-06:21 I found more problems trying to keep the extension (by passing ex as the second argument) than I did by forcing the output to be CV_FOURCC('M','J','P','G')  \n\t\t\/\/m_output_video.open(output_str, ex, m_cap.get(CV_CAP_PROP_FPS), S, true);\n\t\tm_output_video.open(output_str, CV_FOURCC('M','J','P','G'), m_cap.get(CV_CAP_PROP_FPS), S, true);\n\n\n\t\tif(!m_output_video.isOpened()){\n\t\t\tROS_ERROR(\"problem opening output video! we tried saving it as %s, now exiting\" ,output_str.c_str());\n\t\t\texit(0);\n\t\t}\n\n\t\tROS_INFO(\"output video being saved as %s\" , output_str.c_str());\n\t}\n\n\t\n\t\/\/register all services here\n\t\/\/------------------------------------------------------------------------------\n\tm_test_srv = n.advertiseService(\"service_test\", &VisionNode::serviceTest, this);\n\t\n\t\/\/start your action servers here\n\t\/\/------------------------------------------------------------------------------\n\tm_buoy_server.start();\n\tm_gate_server.start();\n\tROS_INFO(\"servers started\");\n}\n\n\nVisionNode::~VisionNode(){\n    \/\/sg: may need to close the cameras here not sure..\n}\n\nvoid VisionNode::update(){\n\n\tm_cap >> m_img;\n\t\/\/if one of our frames was empty it means we ran out of footage, should only happen with test feeds or if a camera breaks I guess\n\tif(m_img.empty()){           \n\t\tROS_ERROR(\"ran out of video (one of the frames was empty) exiting node now\");\n\t\texit(0);\n\t}\n\t\n\t\/\/if the user didn't specify a directory this will not be open\n\tif(m_output_video.isOpened()){\n\t\tROS_ERROR(\"writing image!\");\n\t\tm_output_video << m_img;\n\t}\n\t\n\tspinOnce();\n}\n\n\n\/*\n* Past this point is a collection of services and \n* actions that will be able to called from any other node\n* =================================================================================================================\n*\/\nbool VisionNode::serviceTest(ram_msgs::bool_bool::Request &req, ram_msgs::bool_bool::Response &res){\n    ROS_ERROR(\"service called successfully\");\n}\n\n\n\n\/\/There are the definitions for all of our actionlib actions, may be moved to it's own class not sure yet. \n\/\/=================================================================================================================\nvoid VisionNode::testExecute(const ram_msgs::VisionNavGoalConstPtr& goal, actionlib::SimpleActionServer<ram_msgs::VisionNavAction> *as){\n    \/\/    goal->test_feedback = 5;\n    ROS_ERROR(\"You called the action well done!\");\n    as->setSucceeded();\n}\n\n\n\/\/if a buoy is found on frame finds where it is and returns the center offset \nvoid VisionNode::findBuoy(const ram_msgs::VisionNavGoalConstPtr& goal,  actionlib::SimpleActionServer<ram_msgs::VisionNavAction> *as){\n\t\n\tBuoyAction action = BuoyAction(as);\n\t\n\twhile(true){\n\t\taction.updateAction(m_img); \/\/this will also publish the feedback\n\t}\n\t\n\tas->setSucceeded();   \n}\n\nvoid VisionNode::findGate(const ram_msgs::VisionNavGoalConstPtr& goal,  actionlib::SimpleActionServer<ram_msgs::VisionNavAction> *as){\n\t\n\tGateAction action = GateAction();\n\n\twhile(true){\n\t\tROS_ERROR(\"updating action\");\n\t\taction.updateAction(m_img);\n\t}\n\n\tas->setSucceeded();\n}\n\n\nvoid VisionNode::findBlob(const ram_msgs::VisionNavGoalConstPtr& goal,  actionlib::SimpleActionServer<ram_msgs::VisionNavAction> *as){\n\t\n\tBlobAction action = BlobAction(as);\n\n\twhile(true){\n\t\tROS_ERROR(\"updating action\");\n\t\taction.updateAction(m_img);\n\t}\n\n\tas->setSucceeded();\n}\n<commit_msg>starts the server now<commit_after>\/\/sg: this is going to be the primary vision node for qubo (or future robots, whatever)\n#include \"vision_node.h\"\n\nusing namespace std;\nusing namespace ros;\nusing namespace AVT::VmbAPI;\n\n\nint VisionNode::vmb_err(const int func_call, const string err_msg) {\n\tif (func_call != VmbErrorSuccess){\n\t\tROS_ERROR(\"%s, code: %i\", err_msg.c_str(), func_call);\n\t\treturn func_call;\n\t}\n\treturn func_call;\n}\n\n\n\/\/you need to pass in a node handle, and a camera feed, which should be a file path either to a physical device or to a video  \nVisionNode::VisionNode(NodeHandle n, NodeHandle np, string feed)\n\t:\tm_buoy_server(n, \"buoy_action\", boost::bind(&VisionNode::findBuoy, this, _1, &m_buoy_server), false),\n\t\tm_gate_server(n, \"gate_action\", boost::bind(&VisionNode::findGate, this, _1, &m_gate_server), false),\n\t\tm_blob_server(n, \"blob_action\", boost::bind(&VisionNode::findBlob, this, _1, &m_blob_server), false)\n\n{\n\n\t\/\/ isdigit makes sure checks if we're dealing with a number (like if want to open the default camera by passing a 0). If we are we convert our string to an int (VideoCapture won't correctly open the camera with the string in this case);\n\t\/\/this could give us problems if we pass something like \"0followed_by_string\" but just don't do that.\n\n\t\/\/sgillen@20170429-07:04 we really don't even need this... we can just pass in \/dev\/video0 if we want the web camera... I'll leave it for now though\n\tif(isdigit(feed.c_str()[0])){\n\t\tm_cap = cv::VideoCapture(atoi(feed.c_str()));\n\t}\n\telse{\n\t\tm_cap = cv::VideoCapture(feed);\n\t}\n\n\n\t\t\/\/make sure we have something valid\n    if(!m_cap.isOpened()){           \n        ROS_ERROR(\"couldn't open file\/camera  %s\\n now exiting\" ,feed.c_str());\n        exit(0);\n    }\n\t\n\n\t\/\/TODO give option to user to specify the name of the video\n\t\/\/TODO make sure this doesn't fail when specifying a directory that does not yet exist\n\t\n\tstring output_dir;\n\tnp.param<string>(\"output_dir\", output_dir, \"\"); \/\/this line will populate the output_dir variable if it's specified in the launch file\n\n\t\/\/TODO change variable names\n\tif(!output_dir.empty()){\n\t\t\n\t\tstringstream output_ss;\n\t\tauto t = time(nullptr);\n\t\tauto tm = *localtime(&t);\n\n\t\toutput_ss << output_dir;\n\t\toutput_ss << put_time(&tm, \"%Y%m%d_%H-%M-%S\");\n\t\toutput_ss << \".avi\";\n\t\t\n\t\tstring output_str = output_ss.str();\n\t\t\n\t\tint ex = static_cast<int>(m_cap.get(CV_CAP_PROP_FOURCC));\n\n\t\tcv::Size S = cv::Size((int) m_cap.get(CV_CAP_PROP_FRAME_WIDTH),    \/\/ Acquire input size\n\t\t\t\t\t  (int) m_cap.get(CV_CAP_PROP_FRAME_HEIGHT));\n\t\t\n\n\t\t\/\/sgillen@20172107-06:21 I found more problems trying to keep the extension (by passing ex as the second argument) than I did by forcing the output to be CV_FOURCC('M','J','P','G')  \n\t\t\/\/m_output_video.open(output_str, ex, m_cap.get(CV_CAP_PROP_FPS), S, true);\n\t\tm_output_video.open(output_str, CV_FOURCC('M','J','P','G'), m_cap.get(CV_CAP_PROP_FPS), S, true);\n\n\n\t\tif(!m_output_video.isOpened()){\n\t\t\tROS_ERROR(\"problem opening output video! we tried saving it as %s, now exiting\" ,output_str.c_str());\n\t\t\texit(0);\n\t\t}\n\n\t\tROS_INFO(\"output video being saved as %s\" , output_str.c_str());\n\t}\n\n\t\n\t\/\/register all services here\n\t\/\/------------------------------------------------------------------------------\n\tm_test_srv = n.advertiseService(\"service_test\", &VisionNode::serviceTest, this);\n\t\n\t\/\/start your action servers here\n\t\/\/------------------------------------------------------------------------------\n\tm_buoy_server.start();\n\tm_gate_server.start();\n\tm_blob_server.start();\n\tROS_INFO(\"servers started\");\n}\n\n\nVisionNode::~VisionNode(){\n    \/\/sg: may need to close the cameras here not sure..\n}\n\nvoid VisionNode::update(){\n\n\tm_cap >> m_img;\n\t\/\/if one of our frames was empty it means we ran out of footage, should only happen with test feeds or if a camera breaks I guess\n\tif(m_img.empty()){           \n\t\tROS_ERROR(\"ran out of video (one of the frames was empty) exiting node now\");\n\t\texit(0);\n\t}\n\t\n\t\/\/if the user didn't specify a directory this will not be open\n\tif(m_output_video.isOpened()){\n\t\tROS_ERROR(\"writing image!\");\n\t\tm_output_video << m_img;\n\t}\n\t\n\tspinOnce();\n}\n\n\n\/*\n* Past this point is a collection of services and \n* actions that will be able to called from any other node\n* =================================================================================================================\n*\/\nbool VisionNode::serviceTest(ram_msgs::bool_bool::Request &req, ram_msgs::bool_bool::Response &res){\n    ROS_ERROR(\"service called successfully\");\n}\n\n\n\n\/\/There are the definitions for all of our actionlib actions, may be moved to it's own class not sure yet. \n\/\/=================================================================================================================\nvoid VisionNode::testExecute(const ram_msgs::VisionNavGoalConstPtr& goal, actionlib::SimpleActionServer<ram_msgs::VisionNavAction> *as){\n    \/\/    goal->test_feedback = 5;\n    ROS_ERROR(\"You called the action well done!\");\n    as->setSucceeded();\n}\n\n\n\/\/if a buoy is found on frame finds where it is and returns the center offset \nvoid VisionNode::findBuoy(const ram_msgs::VisionNavGoalConstPtr& goal,  actionlib::SimpleActionServer<ram_msgs::VisionNavAction> *as){\n\t\n\tBuoyAction action = BuoyAction(as);\n\t\n\twhile(true){\n\t\taction.updateAction(m_img); \/\/this will also publish the feedback\n\t}\n\t\n\tas->setSucceeded();   \n}\n\nvoid VisionNode::findGate(const ram_msgs::VisionNavGoalConstPtr& goal,  actionlib::SimpleActionServer<ram_msgs::VisionNavAction> *as){\n\t\n\tGateAction action = GateAction();\n\n\twhile(true){\n\t\tROS_ERROR(\"updating action\");\n\t\taction.updateAction(m_img);\n\t}\n\n\tas->setSucceeded();\n}\n\n\nvoid VisionNode::findBlob(const ram_msgs::VisionNavGoalConstPtr& goal,  actionlib::SimpleActionServer<ram_msgs::VisionNavAction> *as){\n\t\n\tBlobAction action = BlobAction(as);\n\n\twhile(true){\n\t\tROS_ERROR(\"updating action\");\n\t\taction.updateAction(m_img);\n\t}\n\n\tas->setSucceeded();\n}\n<|endoftext|>"}
{"text":"<commit_before>#if !(defined MPL_OPERATOR_HPP)\n\n#define MPL_OPERATOR_HPP\n\n#include <mpi.h>\n#include <functional>\n#include <type_traits>\n\nnamespace mpl {\n\n  template<typename T>\n  struct max {\n    T operator()(const T &x, const T &y) const {\n      return (x<y) ? y : x;\n    }\n  };\n\n  template<typename T>\n  struct min {\n    T operator()(const T &x, const T &y) const {\n      return !(y<x) ? x : y;\n    }\n  };\n\n  template<typename T>\n  struct plus {\n    T operator()(const T &x, const T &y) const {\n      return x+y;\n    }\n  };\n\n  template<typename T>\n  struct multiplies {\n    T operator()(const T &x, const T &y) const {\n      return x*y;\n    }\n  };\n\n  template<typename T>\n  struct logical_and {\n    T operator()(const T &x, const T &y) const {\n      return x and y;\n    }\n  };\n\n  template<typename T>\n  struct logical_or {\n    T operator()(const T &x, const T &y) const {\n      return x or y;\n    }\n  };\n\n  template<typename T>\n  struct logical_xor {\n    T operator()(const T &x, const T &y) const {\n      return x xor y;\n    }\n  };\n\n  template<typename T>\n  struct bit_and {\n    T operator()(const T &x, const T &y) const {\n      return x & y;\n    }\n  };\n\n  template<typename T>\n  struct bit_or {\n    T operator()(const T &x, const T &y) const {\n      return x | y;\n    }\n  };\n\n  template<typename T>\n  struct bit_xor {\n    T operator()(const T &x, const T &y) const {\n      return x ^ y;\n    }\n  };\n\n  \/\/ -------------------------------------------------------------------\n\n  template<typename F>\n  struct op_traits {\n    static constexpr bool is_commutative() {\n      return false;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<max<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<min<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<plus<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<multiplies<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<logical_and<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<logical_or<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<logical_xor<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<bit_and<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<bit_or<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  template<typename T>\n  struct op_traits<bit_xor<T>> {\n    static constexpr bool is_commutative() {\n      return true;\n    }\n  };\n\n  \/\/ -------------------------------------------------------------------\n\n  namespace detail {\n\n    template<typename T> struct remove_class { };\n    template<typename C, typename R, typename... A>\n    struct remove_class<R(C::*)(A...)> { using type = R(A...); };\n    template<typename C, typename R, typename... A>\n    struct remove_class<R(C::*)(A...) const> { using type = R(A...); };\n    template<typename C, typename R, typename... A>\n    struct remove_class<R(C::*)(A...) volatile> { using type = R(A...); };\n    template<typename C, typename R, typename... A>\n    struct remove_class<R(C::*)(A...) const volatile> { using type = R(A...); };\n\n    template<typename T>\n    struct get_signature_impl {\n      using type = typename remove_class<decltype(&std::remove_reference<T>::type::operator())>::type;\n    };\n\n    template<typename R, typename... A>\n    struct get_signature_impl<R(A...)> { using type = R(A...); };\n    template<typename R, typename... A>\n    struct get_signature_impl<R(&)(A...)> { using type = R(A...); };\n    template<typename R, typename... A>\n    struct get_signature_impl<R(*)(A...)> { using type = R(A...); };\n    template<typename T> using get_signature = typename get_signature_impl<T>::type;\n\n    template<typename T>\n    struct get_result_type_impl;\n    template<typename R, typename... A>\n    struct get_result_type_impl<R(A...)> { using type = R; };\n    template<typename T> using get_result_type = typename get_result_type_impl<T>::type;\n\n    template<typename T>\n    struct get_first_argument_type_impl;\n    template<typename R, typename A1, typename... A>\n    struct get_first_argument_type_impl<R(A1, A...)> { using type = A1; };\n    template<typename T> using get_first_argument_type = typename get_first_argument_type_impl<T>::type;\n\n    template<typename T>\n    struct get_second_argument_type_impl;\n    template<typename R, typename A1, typename A2, typename... A>\n    struct get_second_argument_type_impl<R(A1, A2, A...)> { using type = A2; };\n    template<typename T> using get_second_argument_type = typename get_second_argument_type_impl<T>::type;\n\n    template<typename F> using make_function_type = std::function<get_signature<F>>;\n\n    template<typename F> make_function_type<F> make_function(F &&f) {\n      return make_function_type<F>(std::forward<F>(f));\n    }\n\n    \/\/------------------------------------------------------------------\n\n    template<typename T, typename F>\n    class op {\n    public:\n      typedef F functor;\n      typedef get_signature<functor> signature;\n      typedef typename std::decay<get_first_argument_type<signature>>::type first_argument_type;\n      typedef typename std::decay<get_second_argument_type<signature>>::type second_argument_type;\n      typedef typename std::decay<get_result_type<signature>>::type result_type;\n      static_assert(std::is_assignable<typename std::add_lvalue_reference<first_argument_type>::type, T>::value and\n\t\t    std::is_assignable<typename std::add_lvalue_reference<second_argument_type>::type, T>::value and\n\t\t    std::is_assignable<T &, result_type>::value, \"argument type mismatch\");\n\n      static functor *f;\n      static void apply(void *invec, void *inoutvec, int *len,\n    \t\t\tMPI_Datatype *datatype) {\n\tfunctor local_f(*f);\n    \tT *i1=reinterpret_cast<T *>(invec);\n    \tT *i2=reinterpret_cast<T *>(inoutvec);\n    \tfor (int i=0, i_end=*len; i<i_end; ++i, ++i1, ++i2)\n    \t  *i2=local_f(*i1, *i2);\n      }\n      MPI_Op mpi_op;\n      op() {\n    \tMPI_Op_create(op::apply, op_traits<functor>::is_commutative(), &mpi_op);\n      }\n      ~op() {\n    \tMPI_Op_free(&mpi_op);\n      }\n      static constexpr bool is_s_commutative() {\n    \treturn op_traits<functor>::is_commutative();\n      }\n      op(op const &)=delete;\n      void operator=(op const&)=delete;\n    };\n\n    template<typename T, typename F>\n    F *op<T, F>::f;\n\n    template<typename T, typename F>\n    op<T, F> & get_op() {\n      static detail::op<T, F> op;\n      return op;\n    }\n\n  }\n\n}\n\n#endif\n<commit_msg>make is_commutative a constexpr member variable<commit_after>#if !(defined MPL_OPERATOR_HPP)\n\n#define MPL_OPERATOR_HPP\n\n#include <mpi.h>\n#include <functional>\n#include <type_traits>\n\nnamespace mpl {\n\n  template<typename T>\n  struct max {\n    T operator()(const T &x, const T &y) const {\n      return (x<y) ? y : x;\n    }\n  };\n\n  template<typename T>\n  struct min {\n    T operator()(const T &x, const T &y) const {\n      return !(y<x) ? x : y;\n    }\n  };\n\n  template<typename T>\n  struct plus {\n    T operator()(const T &x, const T &y) const {\n      return x+y;\n    }\n  };\n\n  template<typename T>\n  struct multiplies {\n    T operator()(const T &x, const T &y) const {\n      return x*y;\n    }\n  };\n\n  template<typename T>\n  struct logical_and {\n    T operator()(const T &x, const T &y) const {\n      return x and y;\n    }\n  };\n\n  template<typename T>\n  struct logical_or {\n    T operator()(const T &x, const T &y) const {\n      return x or y;\n    }\n  };\n\n  template<typename T>\n  struct logical_xor {\n    T operator()(const T &x, const T &y) const {\n      return x xor y;\n    }\n  };\n\n  template<typename T>\n  struct bit_and {\n    T operator()(const T &x, const T &y) const {\n      return x & y;\n    }\n  };\n\n  template<typename T>\n  struct bit_or {\n    T operator()(const T &x, const T &y) const {\n      return x | y;\n    }\n  };\n\n  template<typename T>\n  struct bit_xor {\n    T operator()(const T &x, const T &y) const {\n      return x ^ y;\n    }\n  };\n\n  \/\/ -------------------------------------------------------------------\n\n  template<typename F>\n  struct op_traits {\n    static constexpr bool is_commutative=false;\n  };\n\n  template<typename T>\n  struct op_traits<max<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<min<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<plus<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<multiplies<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<logical_and<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<logical_or<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<logical_xor<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<bit_and<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<bit_or<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  template<typename T>\n  struct op_traits<bit_xor<T>> {\n    static constexpr bool is_commutative=true;\n  };\n\n  \/\/ -------------------------------------------------------------------\n\n  namespace detail {\n\n    template<typename T> struct remove_class { };\n    template<typename C, typename R, typename... A>\n    struct remove_class<R(C::*)(A...)> { using type = R(A...); };\n    template<typename C, typename R, typename... A>\n    struct remove_class<R(C::*)(A...) const> { using type = R(A...); };\n    template<typename C, typename R, typename... A>\n    struct remove_class<R(C::*)(A...) volatile> { using type = R(A...); };\n    template<typename C, typename R, typename... A>\n    struct remove_class<R(C::*)(A...) const volatile> { using type = R(A...); };\n\n    template<typename T>\n    struct get_signature_impl {\n      using type = typename remove_class<decltype(&std::remove_reference<T>::type::operator())>::type;\n    };\n\n    template<typename R, typename... A>\n    struct get_signature_impl<R(A...)> { using type = R(A...); };\n    template<typename R, typename... A>\n    struct get_signature_impl<R(&)(A...)> { using type = R(A...); };\n    template<typename R, typename... A>\n    struct get_signature_impl<R(*)(A...)> { using type = R(A...); };\n    template<typename T> using get_signature = typename get_signature_impl<T>::type;\n\n    template<typename T>\n    struct get_result_type_impl;\n    template<typename R, typename... A>\n    struct get_result_type_impl<R(A...)> { using type = R; };\n    template<typename T> using get_result_type = typename get_result_type_impl<T>::type;\n\n    template<typename T>\n    struct get_first_argument_type_impl;\n    template<typename R, typename A1, typename... A>\n    struct get_first_argument_type_impl<R(A1, A...)> { using type = A1; };\n    template<typename T> using get_first_argument_type = typename get_first_argument_type_impl<T>::type;\n\n    template<typename T>\n    struct get_second_argument_type_impl;\n    template<typename R, typename A1, typename A2, typename... A>\n    struct get_second_argument_type_impl<R(A1, A2, A...)> { using type = A2; };\n    template<typename T> using get_second_argument_type = typename get_second_argument_type_impl<T>::type;\n\n    template<typename F> using make_function_type = std::function<get_signature<F>>;\n\n    template<typename F> make_function_type<F> make_function(F &&f) {\n      return make_function_type<F>(std::forward<F>(f));\n    }\n\n    \/\/------------------------------------------------------------------\n\n    template<typename T, typename F>\n    class op {\n    public:\n      typedef F functor;\n      typedef get_signature<functor> signature;\n      typedef typename std::decay<get_first_argument_type<signature>>::type first_argument_type;\n      typedef typename std::decay<get_second_argument_type<signature>>::type second_argument_type;\n      typedef typename std::decay<get_result_type<signature>>::type result_type;\n      static_assert(std::is_assignable<typename std::add_lvalue_reference<first_argument_type>::type, T>::value and\n\t\t    std::is_assignable<typename std::add_lvalue_reference<second_argument_type>::type, T>::value and\n\t\t    std::is_assignable<T &, result_type>::value, \"argument type mismatch\");\n\n      static constexpr bool is_commutative=op_traits<functor>::is_commutative;\n      static functor *f;\n      static void apply(void *invec, void *inoutvec, int *len,\n    \t\t\tMPI_Datatype *datatype) {\n\tfunctor local_f(*f);\n    \tT *i1=reinterpret_cast<T *>(invec);\n    \tT *i2=reinterpret_cast<T *>(inoutvec);\n    \tfor (int i=0, i_end=*len; i<i_end; ++i, ++i1, ++i2)\n    \t  *i2=local_f(*i1, *i2);\n      }\n      MPI_Op mpi_op;\n      op() {\n    \tMPI_Op_create(op::apply, is_commutative, &mpi_op);\n      }\n      ~op() {\n    \tMPI_Op_free(&mpi_op);\n      }\n      op(op const &)=delete;\n      void operator=(op const&)=delete;\n    };\n\n    template<typename T, typename F>\n    F *op<T, F>::f;\n\n    template<typename T, typename F>\n    op<T, F> & get_op() {\n      static detail::op<T, F> op;\n      return op;\n    }\n\n  }\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"log_sigmoid.hpp\"\n\nTEST(LogSigmoidTest, Sigmoid0) {\n    double expectedVal = 0.5;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(0);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, Sigmoid1) {\n    double expectedVal = 0.7310585786300048792511592418218362743651446401650565192763659079190404530702046393874745320759812453;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(1);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, Sigmoid2) {\n    double expectedVal = 0.8807970779778824440597291413023967952063842986289682757984052500609766222883192417294737608368383572;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(2);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, Sigmoid3) {\n    double expectedVal = 0.9525741268224332191211518482282477986138205675793908992821119912255512884972897661142163455089399610;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(3);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, Sigmoid4) {\n    double expectedVal = 0.9820137900379084419732068620504615751275149881204673880241316087065539731588051012797374250226038446;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(4);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, DISABLED_SigmoidDeriv0) {\n    double expectedVal = 0.5;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(0);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, DISABLED_SigmoidDeriv1) {\n    double expectedVal = 0.2099871708070130346972483695208507224585933641153854773566557201222949497620241528078470044311593630;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(1);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, DISABLED_SigmoidDeriv2) {\n    double expectedVal = 0.03532541242658223284312382793052739615606362991882798056243190491343103030472792095272482867191154543;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(2);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, DISABLED_SigmoidDeriv3) {\n    double expectedVal = 0.004933018582720095636578084841761743663660804559399863602124745023211662148054750855857728873900145776;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(3);\n\n    ASSERT_NEAR(expectedVal, actualVal, 0.0000000000000001L);\n}\n\nTEST(LogSigmoidTest, DISABLED_SigmoidDeriv4) {\n    double expectedVal = 0.0006704753415129484399851094516655066155078830348121154630238921104701595170235635223347777256572355192;\n\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(4);\n\n    ASSERT_NEAR(expectedVal, actualVal, 0.0000000000000001L);\n}\n\n<commit_msg>Add log sigmoid derivative tests<commit_after>#include \"gtest\/gtest.h\"\n#include \"log_sigmoid.hpp\"\n\nTEST(LogSigmoidTest, Sigmoid0) {\n    double expectedVal = 0.5;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(0);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, Sigmoid1) {\n    double expectedVal = 0.7310585786300048792511592418218362743651446401650565192763659079190404530702046393874745320759812453;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(1);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, Sigmoid2) {\n    double expectedVal = 0.8807970779778824440597291413023967952063842986289682757984052500609766222883192417294737608368383572;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(2);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, Sigmoid3) {\n    double expectedVal = 0.9525741268224332191211518482282477986138205675793908992821119912255512884972897661142163455089399610;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(3);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, Sigmoid4) {\n    double expectedVal = 0.9820137900379084419732068620504615751275149881204673880241316087065539731588051012797374250226038446;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelFunc(4);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, SigmoidDeriv0) {\n    double expectedVal = 0.25;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(0);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, SigmoidDeriv1) {\n    double expectedVal = 0.1966119332414818525374247335859090256222672854273135775763268324868302873926450596563475285482006501;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(1);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, SigmoidDeriv2) {\n    double expectedVal = 0.1049935854035065173486241847604253612292966820576927386783278600611474748810120764039235022155796815;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(2);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, SigmoidDeriv3) {\n    double expectedVal = 0.04517665973091213264936002843565163799485995239748969246454782778480922682026316173926092989723483536;\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(3);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\nTEST(LogSigmoidTest, SigmoidDeriv4) {\n    double expectedVal = 0.01766270621329111642156191396526369807803181495941399028121595245671551515236396047636241433595577272;\n\n\n    LogSigmoid kernel;\n    double actualVal = kernel.kernelDeriv(4);\n\n    ASSERT_DOUBLE_EQ(expectedVal, actualVal);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <allegro5\/allegro.h>\n\n#include <sstream>\n#include <vector>\n#include <utility>\n\n#include \"config.h\"\n#include \"creature.h\"\n#include \"game_context.h\"\n\nGameContext::GameContext():\n    config(new Config()),\n    display(new Display()),\n    dungeon(new Dungeon()),\n    queue(al_create_event_queue()),\n    clock_time(0)\n{\n    al_register_event_source(\n        queue, al_get_keyboard_event_source()\n    );\n    al_register_event_source(\n        queue, al_get_display_event_source(display->display)\n    );\n\n    int free_pos_x;\n    int free_pos_y;\n    while (1)\n    {\n        int rand_x = rand() % dungeon->get_width();\n        int rand_y = rand() % dungeon->get_height();\n\n        if (dungeon->entity_at_index(rand_x, rand_y).is_passable())\n        {\n            free_pos_x = rand_x;\n            free_pos_y = rand_y;\n\n            break;\n        }\n    }\n\n    creatures.push_back(\n        new Creature(\n            '@', \"Glorzak\", true, true, true, free_pos_x, free_pos_y, 50, 10\n        )\n    );\n\n    auto gobber = config->load_creature(\"gobber\");\n    gobber->set_position(free_pos_x + 2, free_pos_y - 2);\n\n    creatures.push_back(gobber);\n}\n\nCreature* GameContext::creature_at_index(int x, int y)\n{\n    for (auto it = creatures.cbegin(); it != creatures.cend(); it++)\n    {\n        if ((*it)->get_x() == x && (*it)->get_y() == y)\n        {\n            return *it;\n        }\n    }\n\n    return NULL;\n}\n\nvoid GameContext::kill_creature_at_index(int x, int y) {\n    for (auto it = creatures.begin(); it != creatures.end(); it++) {\n        if ((*it)->get_x() == x && (*it)->get_y() == y) {\n            creatures.erase(it);\n\n            break;\n        }\n    }\n}\n\nvoid GameContext::conduct_melee_attack(Creature* source, Creature* target) {\n    auto damage = source->get_strength();\n\n    target->take_damage(damage);\n\n    std::ostringstream stream;\n\n    stream << \"You hit the \" << target->get_name() << \" with your fists.\";\n\n    event_messages.push_back(stream.str());\n    \/\/ Clear the sstream\n    stream.str(std::string());\n\n    stream << \"The \" << target->get_name();\n\n    if (target->get_health() <= 0) {\n        kill_creature_at_index(target->get_x(), target->get_y());\n\n        stream << \" dies.\";\n    }\n    else if (target->get_health() >= target->get_max_health() * 0.8) {\n        stream << \" is lightly wounded.\";\n    }\n    else if (target->get_health() >= target->get_max_health() * 0.5) {\n        stream << \" is moderately wounded.\";\n    }\n    else if (target->get_health() >= target->get_max_health() * 0.2) {\n        stream << \" is heavily wounded.\";\n    }\n    else {\n        stream << \" is gravely wounded.\";\n    }\n\n    event_messages.push_back(stream.str());\n}\n\nvoid GameContext::process_movement(int x, int y, Creature* creature)\n{\n    if (auto target = creature_at_index(x, y))\n    {\n        \/\/ Swap positions with the friendly creature\n        if (target->is_friendly())\n        {\n            target->set_position(creature->get_x(), creature->get_y());\n            creature->set_position(x, y);\n        }\n        else\n        {\n            conduct_melee_attack(creature, target);\n        }\n    }\n    else if (dungeon->entity_at_index(x, y).is_passable())\n    {\n        creature->set_position(x, y);\n    }\n}\n\nbool GameContext::take_input(Creature* controllable)\n{\n    ALLEGRO_EVENT event;\n\n    do {\n        al_wait_for_event(queue, &event);\n    } while(\n        event.type != ALLEGRO_EVENT_DISPLAY_CLOSE &&\n        event.type != ALLEGRO_EVENT_KEY_CHAR\n    );\n\n    if (event.type == ALLEGRO_EVENT_DISPLAY_CLOSE)\n    {\n        return true;\n    }\n\n    int cur_x = controllable->get_x();\n    int cur_y = controllable->get_y();\n\n    if (event.type == ALLEGRO_EVENT_KEY_CHAR)\n    {\n        switch (event.keyboard.keycode)\n        {\n        case ALLEGRO_KEY_LEFT:\n            process_movement(cur_x - 1, cur_y, controllable);\n            break;\n        case ALLEGRO_KEY_RIGHT:\n            process_movement(cur_x + 1, cur_y, controllable);\n            break;\n        case ALLEGRO_KEY_UP:\n            process_movement(cur_x, cur_y - 1, controllable);\n            break;\n        case ALLEGRO_KEY_DOWN:\n            process_movement(cur_x, cur_y + 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_1:\n            process_movement(cur_x - 1, cur_y + 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_2:\n            process_movement(cur_x, cur_y + 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_3:\n            process_movement(cur_x + 1, cur_y + 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_4:\n            process_movement(cur_x - 1, cur_y, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_6:\n            process_movement(cur_x + 1, cur_y, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_7:\n            process_movement(cur_x - 1, cur_y - 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_8:\n            process_movement(cur_x, cur_y - 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_9:\n            process_movement(cur_x + 1, cur_y - 1, controllable);\n            break;\n        }\n\n        if (\n            event.keyboard.keycode == ALLEGRO_KEY_ESCAPE ||\n            event.keyboard.unichar == 'q'\n        ) {\n            return true;\n        }\n    }\n\n    return false;\n}\n\nvoid GameContext::ai_turn(Creature* player, Creature* creature) {\n\n    \/\/check to see if player is nearby\n    if (creature_nearby(creature, player, 5)) {\n        if (creature_nearby(creature, player, 1)) {\n            conduct_melee_attack(creature, player);\n        }\n        \/\/move towards player\n        move_towards(creature, player);\n    } \n    else {\n        wander(creature);\n    }\n}\n\n\/\/Check to see if Creature A is within thresh of Creature B\nbool GameContext::creature_nearby(Creature* creat_a, Creature* creat_b, int thresh) {\n    if (\n        creat_a->get_x() + thresh >= creat_b->get_x() &&\n        creat_a->get_x() - thresh <= creat_b->get_x() &&\n        creat_a->get_y() + thresh >= creat_b->get_y() &&\n        creat_a->get_y() - thresh <= creat_b->get_y()\n    ) {\n        \/\/printf(\"NEAR\\n\");\n        return true;\n    }\n    return false;\n}\n\nbool GameContext::index_is_unoccupied(int x, int y) {\n    if (\n        dungeon->entity_at_index(x, y).is_passable() &&\n        creature_at_index(x, y) == NULL\n    ) {\n        return true;\n    }\n    return false;\n}\n\n\/\/Check to see what diretion to go\nvoid GameContext::move_towards(Creature* creat_a, Creature* creat_b) {\n    if (creat_a->get_x() > creat_b->get_x()) {\n        if (index_is_unoccupied(creat_a->get_x() - 1, creat_a->get_y())) {\n            creat_a->set_position(creat_a->get_x() - 1, creat_a->get_y());\n        }\n    } \n    else if (creat_a->get_x() < creat_b->get_x()) {\n        if (index_is_unoccupied(creat_a->get_x() + 1, creat_a->get_y())) {\n            creat_a->set_position(creat_a->get_x() + 1, creat_a->get_y());\n        }\n    } \n    else if (creat_a->get_y() > creat_b->get_y()) {\n        if (index_is_unoccupied(creat_a->get_x(), creat_a->get_y() - 1)) {\n            creat_a->set_position(creat_a->get_x(), creat_a->get_y() - 1);\n        }\n    }\n    else if (creat_a->get_y() < creat_b->get_y()) {\n        if (index_is_unoccupied(creat_a->get_x(), creat_a->get_y() + 1)) {\n            creat_a->set_position(creat_a->get_x(), creat_a->get_y() + 1);\n        }\n    }\n}\n\n\/*\n    have a Creature wander into a new space\n\n    1 2 3\n    4 X 5   Pick one of the numbered spots to move into\n    6 7 8\n*\/\nvoid GameContext::wander(Creature* creature) {\n\n    std::vector<std::pair<int,int>> spaces;\n\n    int x = -1;\n    while (x < 2) {\n        int y = -1;\n        while (y < 2) {\n            if (index_is_unoccupied(creature->get_x() + x, creature->get_y() + y)) {\n                spaces.push_back(std::make_pair(creature->get_x() + x, creature->get_y() + y));\n            }\n            y++;\n        }\n        x++;\n    }\n\n    if (!spaces.empty()) {\n        int r = rand() % spaces.size();\n        creature->set_position(spaces[r].first, spaces[r].second);\n    }\n}\n\nvoid GameContext::game_loop()\n{\n    Creature* player;\n    if (!(player = get_player()))\n    {\n        return;\n    }\n\n    while (1)\n    {\n        for (auto it = creatures.begin(); it != creatures.end(); it++)\n        {\n            if (!(*it)->is_turn(clock_time))\n            {\n                continue;\n            }\n\n            if (!(*it)->is_controllable())\n            {\n                ai_turn(player, *it);\n                continue;\n            }\n\n            display->draw_dungeon(\n                (*it)->get_x(), (*it)->get_y(),\n                dungeon, creatures.cbegin(), creatures.cend()\n            );\n\n            display->draw_event_messages(event_messages);\n\n            display->draw_borders();\n\n            display->update_screen();\n\n            bool exit_request = take_input(*it);\n\n            if (exit_request)\n            {\n                goto BREAK_GAME_LOOP;\n            }\n        }\n\n        clock_time += 5;\n    }\n\nBREAK_GAME_LOOP:\n\n    return;\n}\n\nCreature* GameContext::get_player()\n{\n    for (auto it = creatures.begin(); it != creatures.end(); it++)\n    {\n        if ((*it)->is_player())\n        {\n            return *it;\n        }\n    }\n\n    return NULL;\n}\n\nGameContext::~GameContext()\n{\n    delete display;\n    delete dungeon;\n\n    for (auto it = creatures.begin(); it != creatures.end(); it++)\n    {\n        delete *it;\n    }\n\n    al_destroy_event_queue(queue);\n}\n<commit_msg>Fixed problem where enemy can both attack and move in the same turn.<commit_after>#include <allegro5\/allegro.h>\n\n#include <sstream>\n#include <vector>\n#include <utility>\n\n#include \"config.h\"\n#include \"creature.h\"\n#include \"game_context.h\"\n\nGameContext::GameContext():\n    config(new Config()),\n    display(new Display()),\n    dungeon(new Dungeon()),\n    queue(al_create_event_queue()),\n    clock_time(0)\n{\n    al_register_event_source(\n        queue, al_get_keyboard_event_source()\n    );\n    al_register_event_source(\n        queue, al_get_display_event_source(display->display)\n    );\n\n    int free_pos_x;\n    int free_pos_y;\n    while (1)\n    {\n        int rand_x = rand() % dungeon->get_width();\n        int rand_y = rand() % dungeon->get_height();\n\n        if (dungeon->entity_at_index(rand_x, rand_y).is_passable())\n        {\n            free_pos_x = rand_x;\n            free_pos_y = rand_y;\n\n            break;\n        }\n    }\n\n    creatures.push_back(\n        new Creature(\n            '@', \"Glorzak\", true, true, true, free_pos_x, free_pos_y, 50, 10\n        )\n    );\n\n    auto gobber = config->load_creature(\"gobber\");\n    gobber->set_position(free_pos_x + 2, free_pos_y - 2);\n\n    creatures.push_back(gobber);\n}\n\nCreature* GameContext::creature_at_index(int x, int y)\n{\n    for (auto it = creatures.cbegin(); it != creatures.cend(); it++)\n    {\n        if ((*it)->get_x() == x && (*it)->get_y() == y)\n        {\n            return *it;\n        }\n    }\n\n    return NULL;\n}\n\nvoid GameContext::kill_creature_at_index(int x, int y) {\n    for (auto it = creatures.begin(); it != creatures.end(); it++) {\n        if ((*it)->get_x() == x && (*it)->get_y() == y) {\n            creatures.erase(it);\n\n            break;\n        }\n    }\n}\n\nvoid GameContext::conduct_melee_attack(Creature* source, Creature* target) {\n    auto damage = source->get_strength();\n\n    target->take_damage(damage);\n\n    std::ostringstream stream;\n\n    stream << \"You hit the \" << target->get_name() << \" with your fists.\";\n\n    event_messages.push_back(stream.str());\n    \/\/ Clear the sstream\n    stream.str(std::string());\n\n    stream << \"The \" << target->get_name();\n\n    if (target->get_health() <= 0) {\n        kill_creature_at_index(target->get_x(), target->get_y());\n\n        stream << \" dies.\";\n    }\n    else if (target->get_health() >= target->get_max_health() * 0.8) {\n        stream << \" is lightly wounded.\";\n    }\n    else if (target->get_health() >= target->get_max_health() * 0.5) {\n        stream << \" is moderately wounded.\";\n    }\n    else if (target->get_health() >= target->get_max_health() * 0.2) {\n        stream << \" is heavily wounded.\";\n    }\n    else {\n        stream << \" is gravely wounded.\";\n    }\n\n    event_messages.push_back(stream.str());\n}\n\nvoid GameContext::process_movement(int x, int y, Creature* creature)\n{\n    if (auto target = creature_at_index(x, y))\n    {\n        \/\/ Swap positions with the friendly creature\n        if (target->is_friendly())\n        {\n            target->set_position(creature->get_x(), creature->get_y());\n            creature->set_position(x, y);\n        }\n        else\n        {\n            conduct_melee_attack(creature, target);\n        }\n    }\n    else if (dungeon->entity_at_index(x, y).is_passable())\n    {\n        creature->set_position(x, y);\n    }\n}\n\nbool GameContext::take_input(Creature* controllable)\n{\n    ALLEGRO_EVENT event;\n\n    do {\n        al_wait_for_event(queue, &event);\n    } while(\n        event.type != ALLEGRO_EVENT_DISPLAY_CLOSE &&\n        event.type != ALLEGRO_EVENT_KEY_CHAR\n    );\n\n    if (event.type == ALLEGRO_EVENT_DISPLAY_CLOSE)\n    {\n        return true;\n    }\n\n    int cur_x = controllable->get_x();\n    int cur_y = controllable->get_y();\n\n    if (event.type == ALLEGRO_EVENT_KEY_CHAR)\n    {\n        switch (event.keyboard.keycode)\n        {\n        case ALLEGRO_KEY_LEFT:\n            process_movement(cur_x - 1, cur_y, controllable);\n            break;\n        case ALLEGRO_KEY_RIGHT:\n            process_movement(cur_x + 1, cur_y, controllable);\n            break;\n        case ALLEGRO_KEY_UP:\n            process_movement(cur_x, cur_y - 1, controllable);\n            break;\n        case ALLEGRO_KEY_DOWN:\n            process_movement(cur_x, cur_y + 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_1:\n            process_movement(cur_x - 1, cur_y + 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_2:\n            process_movement(cur_x, cur_y + 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_3:\n            process_movement(cur_x + 1, cur_y + 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_4:\n            process_movement(cur_x - 1, cur_y, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_6:\n            process_movement(cur_x + 1, cur_y, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_7:\n            process_movement(cur_x - 1, cur_y - 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_8:\n            process_movement(cur_x, cur_y - 1, controllable);\n            break;\n        case ALLEGRO_KEY_PAD_9:\n            process_movement(cur_x + 1, cur_y - 1, controllable);\n            break;\n        }\n\n        if (\n            event.keyboard.keycode == ALLEGRO_KEY_ESCAPE ||\n            event.keyboard.unichar == 'q'\n        ) {\n            return true;\n        }\n    }\n\n    return false;\n}\n\nvoid GameContext::ai_turn(Creature* player, Creature* creature) {\n\n    \/\/check to see if player is nearby\n    if (creature_nearby(creature, player, 5)) {\n        if (creature_nearby(creature, player, 1)) {\n            conduct_melee_attack(creature, player);\n        }\n        else {\n            \/\/move towards player\n            move_towards(creature, player);\n        }\n    } \n    else {\n        wander(creature);\n    }\n}\n\n\/\/Check to see if Creature A is within thresh of Creature B\nbool GameContext::creature_nearby(Creature* creat_a, Creature* creat_b, int thresh) {\n    if (\n        creat_a->get_x() + thresh >= creat_b->get_x() &&\n        creat_a->get_x() - thresh <= creat_b->get_x() &&\n        creat_a->get_y() + thresh >= creat_b->get_y() &&\n        creat_a->get_y() - thresh <= creat_b->get_y()\n    ) {\n        \/\/printf(\"NEAR\\n\");\n        return true;\n    }\n    return false;\n}\n\nbool GameContext::index_is_unoccupied(int x, int y) {\n    if (\n        dungeon->entity_at_index(x, y).is_passable() &&\n        creature_at_index(x, y) == NULL\n    ) {\n        return true;\n    }\n    return false;\n}\n\n\/\/Check to see what diretion to go\nvoid GameContext::move_towards(Creature* creat_a, Creature* creat_b) {\n    if (creat_a->get_x() > creat_b->get_x()) {\n        if (index_is_unoccupied(creat_a->get_x() - 1, creat_a->get_y())) {\n            creat_a->set_position(creat_a->get_x() - 1, creat_a->get_y());\n        }\n    } \n    else if (creat_a->get_x() < creat_b->get_x()) {\n        if (index_is_unoccupied(creat_a->get_x() + 1, creat_a->get_y())) {\n            creat_a->set_position(creat_a->get_x() + 1, creat_a->get_y());\n        }\n    } \n    else if (creat_a->get_y() > creat_b->get_y()) {\n        if (index_is_unoccupied(creat_a->get_x(), creat_a->get_y() - 1)) {\n            creat_a->set_position(creat_a->get_x(), creat_a->get_y() - 1);\n        }\n    }\n    else if (creat_a->get_y() < creat_b->get_y()) {\n        if (index_is_unoccupied(creat_a->get_x(), creat_a->get_y() + 1)) {\n            creat_a->set_position(creat_a->get_x(), creat_a->get_y() + 1);\n        }\n    }\n}\n\n\/*\n    have a Creature wander into a new space\n\n    1 2 3\n    4 X 5   Pick one of the numbered spots to move into\n    6 7 8\n*\/\nvoid GameContext::wander(Creature* creature) {\n\n    std::vector<std::pair<int,int>> spaces;\n\n    int x = -1;\n    while (x < 2) {\n        int y = -1;\n        while (y < 2) {\n            if (index_is_unoccupied(creature->get_x() + x, creature->get_y() + y)) {\n                spaces.push_back(std::make_pair(creature->get_x() + x, creature->get_y() + y));\n            }\n            y++;\n        }\n        x++;\n    }\n\n    if (!spaces.empty()) {\n        int r = rand() % spaces.size();\n        creature->set_position(spaces[r].first, spaces[r].second);\n    }\n}\n\nvoid GameContext::game_loop()\n{\n    Creature* player;\n    if (!(player = get_player()))\n    {\n        return;\n    }\n\n    while (1)\n    {\n        for (auto it = creatures.begin(); it != creatures.end(); it++)\n        {\n            if (!(*it)->is_turn(clock_time))\n            {\n                continue;\n            }\n\n            if (!(*it)->is_controllable())\n            {\n                ai_turn(player, *it);\n                continue;\n            }\n\n            display->draw_dungeon(\n                (*it)->get_x(), (*it)->get_y(),\n                dungeon, creatures.cbegin(), creatures.cend()\n            );\n\n            display->draw_event_messages(event_messages);\n\n            display->draw_borders();\n\n            display->update_screen();\n\n            bool exit_request = take_input(*it);\n\n            if (exit_request)\n            {\n                goto BREAK_GAME_LOOP;\n            }\n        }\n\n        clock_time += 5;\n    }\n\nBREAK_GAME_LOOP:\n\n    return;\n}\n\nCreature* GameContext::get_player()\n{\n    for (auto it = creatures.begin(); it != creatures.end(); it++)\n    {\n        if ((*it)->is_player())\n        {\n            return *it;\n        }\n    }\n\n    return NULL;\n}\n\nGameContext::~GameContext()\n{\n    delete display;\n    delete dungeon;\n\n    for (auto it = creatures.begin(); it != creatures.end(); it++)\n    {\n        delete *it;\n    }\n\n    al_destroy_event_queue(queue);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"direct.hxx\"\n#include \"istream\/istream.hxx\"\n#include \"istream\/istream_byte.hxx\"\n#include \"istream\/istream_cat.hxx\"\n#include \"istream\/istream_fail.hxx\"\n#include \"istream\/istream_four.hxx\"\n#include \"istream\/istream_head.hxx\"\n#include \"istream\/istream_hold.hxx\"\n#include \"istream\/istream_inject.hxx\"\n#include \"istream\/istream_later.hxx\"\n\n#include <glib.h>\n#include <event.h>\n\n#include <stdio.h>\n#ifdef EXPECTED_RESULT\n#include <string.h>\n#endif\n\nenum {\n#ifdef NO_BLOCKING\n    enable_blocking = false,\n#else\n    enable_blocking = true,\n#endif\n};\n\nstatic inline GQuark\ntest_quark(void)\n{\n    return g_quark_from_static_string(\"test\");\n}\n\n#ifndef FILTER_CLEANUP\nstatic void\ncleanup(void)\n{\n}\n#endif\n\nstruct Context {\n    bool half = false;\n    bool got_data;\n    bool eof = false;\n#ifdef EXPECTED_RESULT\n    bool record = false;\n    char buffer[sizeof(EXPECTED_RESULT) * 2];\n    size_t buffer_length = 0;\n#endif\n    struct istream *abort_istream = nullptr;\n    int abort_after = 0;\n\n    int block_after = -1;\n\n    bool block_byte = false, block_byte_state = false;\n};\n\n\/*\n * istream handler\n *\n *\/\n\nstatic size_t\nmy_istream_data(const void *data, size_t length, void *_ctx)\n{\n    auto &ctx = *(Context *)_ctx;\n\n    (void)data;\n\n    ctx.got_data = true;\n\n    if (ctx.block_byte) {\n        ctx.block_byte_state = !ctx.block_byte_state;\n        if (ctx.block_byte_state)\n            return 0;\n    }\n\n    if (ctx.abort_istream != nullptr && ctx.abort_after-- == 0) {\n        GError *error = g_error_new_literal(test_quark(), 0, \"abort_istream\");\n        istream_inject_fault(ctx.abort_istream, error);\n        ctx.abort_istream = nullptr;\n        return 0;\n    }\n\n    if (ctx.half && length > 8)\n        length = (length + 1) \/ 2;\n\n    if (ctx.block_after >= 0) {\n        --ctx.block_after;\n        if (ctx.block_after == -1)\n            \/* block once *\/\n            return 0;\n    }\n\n#ifdef EXPECTED_RESULT\n    if (ctx.record) {\n#ifdef __clang__\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wstring-plus-int\"\n#endif\n\n        assert(ctx.buffer_length + length < sizeof(ctx.buffer));\n        assert(memcmp(EXPECTED_RESULT + ctx.buffer_length, data, length) == 0);\n\n#ifdef __clang__\n#pragma GCC diagnostic pop\n#endif\n\n        if (ctx.buffer_length + length < sizeof(ctx.buffer))\n            memcpy(ctx.buffer + ctx.buffer_length, data, length);\n        ctx.buffer_length += length;\n    }\n#endif\n\n    return length;\n}\n\nstatic ssize_t\nmy_istream_direct(gcc_unused FdType type, int fd,\n                  size_t max_length, void *_ctx)\n{\n    auto &ctx = *(Context *)_ctx;\n\n    (void)fd;\n\n    ctx.got_data = true;\n\n    if (ctx.abort_istream != nullptr) {\n        GError *error = g_error_new_literal(test_quark(), 0, \"abort_istream\");\n        istream_inject_fault(ctx.abort_istream, error);\n        ctx.abort_istream = nullptr;\n        return 0;\n    }\n\n    return max_length;\n}\n\nstatic void\nmy_istream_eof(void *_ctx)\n{\n    auto &ctx = *(Context *)_ctx;\n\n    ctx.eof = true;\n}\n\nstatic void\nmy_istream_abort(GError *error, void *_ctx)\n{\n    auto &ctx = *(Context *)_ctx;\n\n    g_error_free(error);\n\n#ifdef EXPECTED_RESULT\n    assert(!ctx.record);\n#endif\n\n    ctx.eof = true;\n}\n\nstatic const struct istream_handler my_istream_handler = {\n    .data = my_istream_data,\n    .direct = my_istream_direct,\n    .eof = my_istream_eof,\n    .abort = my_istream_abort,\n};\n\n\n\/*\n * utils\n *\n *\/\n\nstatic int\nistream_read_event(struct istream *istream)\n{\n    istream_read(istream);\n    return event_loop(EVLOOP_ONCE|EVLOOP_NONBLOCK);\n}\n\nstatic inline void\nistream_read_expect(Context &ctx, struct istream *istream)\n{\n    assert(!ctx.eof);\n\n    ctx.got_data = false;\n\n    const auto ret = istream_read_event(istream);\n    assert(ctx.eof || ctx.got_data || ret == 0);\n\n    \/* give istream_later another chance to breathe *\/\n    event_loop(EVLOOP_ONCE|EVLOOP_NONBLOCK);\n}\n\nstatic void\nrun_istream_ctx(Context &ctx, struct pool *pool, struct istream *istream)\n{\n    ctx.eof = false;\n\n    gcc_unused off_t a1 = istream_available(istream, false);\n    gcc_unused off_t a2 = istream_available(istream, true);\n\n    istream_handler_set(istream, &my_istream_handler, &ctx, 0);\n\n    pool_unref(pool);\n    pool_commit();\n\n#ifndef NO_GOT_DATA_ASSERT\n    while (!ctx.eof)\n        istream_read_expect(ctx, istream);\n#else\n    for (int i = 0; i < 1000 && !ctx.eof; ++i)\n           istream_read_event(istream);\n#endif\n\n#ifdef EXPECTED_RESULT\n    if (ctx.record) {\n        assert(ctx.buffer_length == sizeof(EXPECTED_RESULT) - 1);\n        assert(memcmp(ctx.buffer, EXPECTED_RESULT, ctx.buffer_length) == 0);\n    }\n#endif\n\n    cleanup();\n    pool_commit();\n}\n\nstatic void\nrun_istream_block(struct pool *pool, struct istream *istream,\n                  gcc_unused bool record,\n                  int block_after)\n{\n    Context ctx;\n    ctx.block_after = block_after;\n#ifdef EXPECTED_RESULT\n    ctx.record = record;\n#endif\n\n    run_istream_ctx(ctx, pool, istream);\n}\n\nstatic void\nrun_istream(struct pool *pool, struct istream *istream, bool record)\n{\n    run_istream_block(pool, istream, record, -1);\n}\n\n\n\/*\n * tests\n *\n *\/\n\n\/** normal run *\/\nstatic void\ntest_normal(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_normal\", 8192);\n\n    auto *istream = create_test(pool, create_input(pool));\n    assert(istream != nullptr);\n    assert(!istream_has_handler(istream));\n\n    run_istream(pool, istream, true);\n}\n\n\/** block once after n data() invocations *\/\nstatic void\ntest_block(struct pool *parent_pool)\n{\n    for (int n = 0; n < 8; ++n) {\n        struct istream *istream;\n\n        auto *pool = pool_new_linear(parent_pool, \"test_block\", 8192);\n\n        istream = create_test(pool, create_input(pool));\n        assert(istream != nullptr);\n        assert(!istream_has_handler(istream));\n\n        run_istream_block(pool, istream, true, n);\n    }\n}\n\n\/** test with istream_byte *\/\nstatic void\ntest_byte(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_byte\", 8192);\n\n    auto *istream =\n        create_test(pool, istream_byte_new(*pool, *create_input(pool)));\n    run_istream(pool, istream, true);\n}\n\n\/** block and consume one byte at a time *\/\nstatic void\ntest_block_byte(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_byte\", 8192);\n\n    auto *istream =\n        create_test(pool, istream_byte_new(*pool, *create_input(pool)));\n\n    Context ctx;\n    ctx.block_byte = true;\n#ifdef EXPECTED_RESULT\n    ctx.record = true;\n#endif\n\n    run_istream_ctx(ctx, pool, istream);\n}\n\n\/** accept only half of the data *\/\nstatic void\ntest_half(struct pool *pool)\n{\n    Context ctx;\n    ctx.half = true;\n#ifdef EXPECTED_RESULT\n    ctx.record = true;\n#endif\n\n    pool = pool_new_linear(pool, \"test_half\", 8192);\n\n    run_istream_ctx(ctx, pool, create_test(pool, create_input(pool)));\n}\n\n\/** input fails *\/\nstatic void\ntest_fail(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_fail\", 8192);\n\n    GError *error = g_error_new_literal(test_quark(), 0, \"test_fail\");\n    auto *istream = create_test(pool, istream_fail_new(pool, error));\n    run_istream(pool, istream, false);\n}\n\n\/** input fails after the first byte *\/\nstatic void\ntest_fail_1byte(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_fail_1byte\", 8192);\n\n    GError *error = g_error_new_literal(test_quark(), 0, \"test_fail\");\n    auto *istream =\n        create_test(pool,\n                    istream_cat_new(pool,\n                                    istream_head_new(pool, create_input(pool),\n                                                     1, false),\n                                    istream_fail_new(pool, error),\n                                    nullptr));\n    run_istream(pool, istream, false);\n}\n\n\/** abort without handler *\/\nstatic void\ntest_abort_without_handler(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_abort_without_handler\", 8192);\n\n    auto *istream = create_test(pool, create_input(pool));\n    pool_unref(pool);\n    pool_commit();\n\n    istream_close_unused(istream);\n\n    cleanup();\n    pool_commit();\n}\n\n#ifndef NO_ABORT_ISTREAM\n\n\/** abort in handler *\/\nstatic void\ntest_abort_in_handler(struct pool *pool)\n{\n    Context ctx;\n    ctx.block_after = -1;\n\n    pool = pool_new_linear(pool, \"test_abort_in_handler\", 8192);\n\n    ctx.abort_istream = istream_inject_new(pool, create_input(pool));\n    auto *istream = create_test(pool, ctx.abort_istream);\n    istream_handler_set(istream, &my_istream_handler, &ctx, 0);\n    pool_unref(pool);\n    pool_commit();\n\n    while (!ctx.eof) {\n        istream_read_expect(ctx, istream);\n        event_loop(EVLOOP_ONCE|EVLOOP_NONBLOCK);\n    }\n\n    assert(ctx.abort_istream == nullptr);\n\n    cleanup();\n    pool_commit();\n}\n\n\/** abort in handler, with some data consumed *\/\nstatic void\ntest_abort_in_handler_half(struct pool *pool)\n{\n    Context ctx;\n    ctx.half = true;\n    ctx.abort_after = 2;\n\n    pool = pool_new_linear(pool, \"test_abort_in_handler_half\", 8192);\n\n    ctx.abort_istream = istream_inject_new(pool, istream_four_new(pool, create_input(pool)));\n    auto *istream = create_test(pool, istream_byte_new(*pool, *ctx.abort_istream));\n    istream_handler_set(istream, &my_istream_handler, &ctx, 0);\n    pool_unref(pool);\n    pool_commit();\n\n    while (!ctx.eof) {\n        istream_read_expect(ctx, istream);\n        event_loop(EVLOOP_ONCE|EVLOOP_NONBLOCK);\n    }\n\n    assert(ctx.abort_istream == nullptr || ctx.abort_after >= 0);\n\n    cleanup();\n    pool_commit();\n}\n\n#endif\n\n\/** abort after 1 byte of output *\/\nstatic void\ntest_abort_1byte(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_abort_1byte\", 8192);\n\n    auto *istream = istream_head_new(pool,\n                                     create_test(pool,\n                                                 create_input(pool)),\n                                     1, false);\n    run_istream(pool, istream, false);\n}\n\n\/** test with istream_later filter *\/\nstatic void\ntest_later(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_later\", 8192);\n\n    auto *istream =\n        create_test(pool, istream_later_new(pool, create_input(pool)));\n    run_istream(pool, istream, true);\n}\n\n#ifdef EXPECTED_RESULT\n\/** test with large input and blocking handler *\/\nstatic void\ntest_big_hold(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_big_hold\", 8192);\n\n    struct istream *istream = create_input(pool);\n    for (unsigned i = 0; i < 1024; ++i)\n        istream = istream_cat_new(pool, istream, create_input(pool), nullptr);\n\n    istream = create_test(pool, istream);\n    struct istream *hold = istream_hold_new(pool, istream);\n\n    istream_read(istream);\n\n    istream_close_unused(hold);\n\n    pool_unref(pool);\n}\n#endif\n\n\n\/*\n * main\n *\n *\/\n\n\nint main(int argc, char **argv) {\n    (void)argc;\n    (void)argv;\n\n    direct_global_init();\n    auto *const event_base = event_init();\n\n    auto *const root_pool = pool_new_libc(nullptr, \"root\");\n\n    \/* run test suite *\/\n\n    test_normal(root_pool);\n    if (enable_blocking) {\n        test_block(root_pool);\n        test_byte(root_pool);\n        test_block_byte(root_pool);\n    }\n    test_half(root_pool);\n    test_fail(root_pool);\n    test_fail_1byte(root_pool);\n    test_abort_without_handler(root_pool);\n#ifndef NO_ABORT_ISTREAM\n    test_abort_in_handler(root_pool);\n    if (enable_blocking)\n        test_abort_in_handler_half(root_pool);\n#endif\n    test_abort_1byte(root_pool);\n    test_later(root_pool);\n\n#ifdef EXPECTED_RESULT\n    test_big_hold(root_pool);\n#endif\n\n#ifdef CUSTOM_TEST\n    test_custom(root_pool);\n#endif\n\n    \/* cleanup *\/\n\n    pool_unref(root_pool);\n    pool_commit();\n\n    pool_recycler_clear();\n\n    event_base_free(event_base);\n    direct_global_deinit();\n}\n<commit_msg>test\/t_istream_filter: use class IstreamPointer<commit_after>#include \"direct.hxx\"\n#include \"istream\/istream.hxx\"\n#include \"istream\/istream_byte.hxx\"\n#include \"istream\/istream_cat.hxx\"\n#include \"istream\/istream_fail.hxx\"\n#include \"istream\/istream_four.hxx\"\n#include \"istream\/istream_head.hxx\"\n#include \"istream\/istream_hold.hxx\"\n#include \"istream\/istream_inject.hxx\"\n#include \"istream\/istream_later.hxx\"\n#include \"istream\/istream_pointer.hxx\"\n\n#include <glib.h>\n#include <event.h>\n\n#include <stdio.h>\n#ifdef EXPECTED_RESULT\n#include <string.h>\n#endif\n\nenum {\n#ifdef NO_BLOCKING\n    enable_blocking = false,\n#else\n    enable_blocking = true,\n#endif\n};\n\nstatic inline GQuark\ntest_quark(void)\n{\n    return g_quark_from_static_string(\"test\");\n}\n\n#ifndef FILTER_CLEANUP\nstatic void\ncleanup(void)\n{\n}\n#endif\n\nstruct Context {\n    IstreamPointer input;\n\n    bool half = false;\n    bool got_data;\n    bool eof = false;\n#ifdef EXPECTED_RESULT\n    bool record = false;\n    char buffer[sizeof(EXPECTED_RESULT) * 2];\n    size_t buffer_length = 0;\n#endif\n    struct istream *abort_istream = nullptr;\n    int abort_after = 0;\n\n    int block_after = -1;\n\n    bool block_byte = false, block_byte_state = false;\n\n    explicit Context(struct istream &_input);\n};\n\n\/*\n * istream handler\n *\n *\/\n\nstatic size_t\nmy_istream_data(const void *data, size_t length, void *_ctx)\n{\n    auto &ctx = *(Context *)_ctx;\n\n    (void)data;\n\n    ctx.got_data = true;\n\n    if (ctx.block_byte) {\n        ctx.block_byte_state = !ctx.block_byte_state;\n        if (ctx.block_byte_state)\n            return 0;\n    }\n\n    if (ctx.abort_istream != nullptr && ctx.abort_after-- == 0) {\n        GError *error = g_error_new_literal(test_quark(), 0, \"abort_istream\");\n        istream_inject_fault(ctx.abort_istream, error);\n        ctx.abort_istream = nullptr;\n        return 0;\n    }\n\n    if (ctx.half && length > 8)\n        length = (length + 1) \/ 2;\n\n    if (ctx.block_after >= 0) {\n        --ctx.block_after;\n        if (ctx.block_after == -1)\n            \/* block once *\/\n            return 0;\n    }\n\n#ifdef EXPECTED_RESULT\n    if (ctx.record) {\n#ifdef __clang__\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wstring-plus-int\"\n#endif\n\n        assert(ctx.buffer_length + length < sizeof(ctx.buffer));\n        assert(memcmp(EXPECTED_RESULT + ctx.buffer_length, data, length) == 0);\n\n#ifdef __clang__\n#pragma GCC diagnostic pop\n#endif\n\n        if (ctx.buffer_length + length < sizeof(ctx.buffer))\n            memcpy(ctx.buffer + ctx.buffer_length, data, length);\n        ctx.buffer_length += length;\n    }\n#endif\n\n    return length;\n}\n\nstatic ssize_t\nmy_istream_direct(gcc_unused FdType type, int fd,\n                  size_t max_length, void *_ctx)\n{\n    auto &ctx = *(Context *)_ctx;\n\n    (void)fd;\n\n    ctx.got_data = true;\n\n    if (ctx.abort_istream != nullptr) {\n        GError *error = g_error_new_literal(test_quark(), 0, \"abort_istream\");\n        istream_inject_fault(ctx.abort_istream, error);\n        ctx.abort_istream = nullptr;\n        return 0;\n    }\n\n    return max_length;\n}\n\nstatic void\nmy_istream_eof(void *_ctx)\n{\n    auto &ctx = *(Context *)_ctx;\n\n    ctx.eof = true;\n}\n\nstatic void\nmy_istream_abort(GError *error, void *_ctx)\n{\n    auto &ctx = *(Context *)_ctx;\n\n    g_error_free(error);\n\n#ifdef EXPECTED_RESULT\n    assert(!ctx.record);\n#endif\n\n    ctx.eof = true;\n}\n\nstatic const struct istream_handler my_istream_handler = {\n    .data = my_istream_data,\n    .direct = my_istream_direct,\n    .eof = my_istream_eof,\n    .abort = my_istream_abort,\n};\n\nContext::Context(struct istream &_input)\n    :input(_input, my_istream_handler, this) {}\n\n\/*\n * utils\n *\n *\/\n\nstatic int\nistream_read_event(IstreamPointer &istream)\n{\n    istream.Read();\n    return event_loop(EVLOOP_ONCE|EVLOOP_NONBLOCK);\n}\n\nstatic inline void\nistream_read_expect(Context &ctx)\n{\n    assert(!ctx.eof);\n\n    ctx.got_data = false;\n\n    const auto ret = istream_read_event(ctx.input);\n    assert(ctx.eof || ctx.got_data || ret == 0);\n\n    \/* give istream_later another chance to breathe *\/\n    event_loop(EVLOOP_ONCE|EVLOOP_NONBLOCK);\n}\n\nstatic void\nrun_istream_ctx(Context &ctx, struct pool *pool)\n{\n    ctx.eof = false;\n\n    gcc_unused off_t a1 = ctx.input.GetAvailable(false);\n    gcc_unused off_t a2 = ctx.input.GetAvailable(true);\n\n    pool_unref(pool);\n    pool_commit();\n\n#ifndef NO_GOT_DATA_ASSERT\n    while (!ctx.eof)\n        istream_read_expect(ctx);\n#else\n    for (int i = 0; i < 1000 && !ctx.eof; ++i)\n           istream_read_event(ctx.input);\n#endif\n\n#ifdef EXPECTED_RESULT\n    if (ctx.record) {\n        assert(ctx.buffer_length == sizeof(EXPECTED_RESULT) - 1);\n        assert(memcmp(ctx.buffer, EXPECTED_RESULT, ctx.buffer_length) == 0);\n    }\n#endif\n\n    cleanup();\n    pool_commit();\n}\n\nstatic void\nrun_istream_block(struct pool *pool, struct istream *istream,\n                  gcc_unused bool record,\n                  int block_after)\n{\n    Context ctx(*istream);\n    ctx.block_after = block_after;\n#ifdef EXPECTED_RESULT\n    ctx.record = record;\n#endif\n\n    run_istream_ctx(ctx, pool);\n}\n\nstatic void\nrun_istream(struct pool *pool, struct istream *istream, bool record)\n{\n    run_istream_block(pool, istream, record, -1);\n}\n\n\n\/*\n * tests\n *\n *\/\n\n\/** normal run *\/\nstatic void\ntest_normal(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_normal\", 8192);\n\n    auto *istream = create_test(pool, create_input(pool));\n    assert(istream != nullptr);\n    assert(!istream_has_handler(istream));\n\n    run_istream(pool, istream, true);\n}\n\n\/** block once after n data() invocations *\/\nstatic void\ntest_block(struct pool *parent_pool)\n{\n    for (int n = 0; n < 8; ++n) {\n        struct istream *istream;\n\n        auto *pool = pool_new_linear(parent_pool, \"test_block\", 8192);\n\n        istream = create_test(pool, create_input(pool));\n        assert(istream != nullptr);\n        assert(!istream_has_handler(istream));\n\n        run_istream_block(pool, istream, true, n);\n    }\n}\n\n\/** test with istream_byte *\/\nstatic void\ntest_byte(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_byte\", 8192);\n\n    auto *istream =\n        create_test(pool, istream_byte_new(*pool, *create_input(pool)));\n    run_istream(pool, istream, true);\n}\n\n\/** block and consume one byte at a time *\/\nstatic void\ntest_block_byte(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_byte\", 8192);\n\n    Context ctx(*create_test(pool,\n                             istream_byte_new(*pool, *create_input(pool))));\n    ctx.block_byte = true;\n#ifdef EXPECTED_RESULT\n    ctx.record = true;\n#endif\n\n    run_istream_ctx(ctx, pool);\n}\n\n\/** accept only half of the data *\/\nstatic void\ntest_half(struct pool *pool)\n{\n    Context ctx(*create_test(pool, create_input(pool)));\n    ctx.half = true;\n#ifdef EXPECTED_RESULT\n    ctx.record = true;\n#endif\n\n    pool = pool_new_linear(pool, \"test_half\", 8192);\n\n    run_istream_ctx(ctx, pool);\n}\n\n\/** input fails *\/\nstatic void\ntest_fail(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_fail\", 8192);\n\n    GError *error = g_error_new_literal(test_quark(), 0, \"test_fail\");\n    auto *istream = create_test(pool, istream_fail_new(pool, error));\n    run_istream(pool, istream, false);\n}\n\n\/** input fails after the first byte *\/\nstatic void\ntest_fail_1byte(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_fail_1byte\", 8192);\n\n    GError *error = g_error_new_literal(test_quark(), 0, \"test_fail\");\n    auto *istream =\n        create_test(pool,\n                    istream_cat_new(pool,\n                                    istream_head_new(pool, create_input(pool),\n                                                     1, false),\n                                    istream_fail_new(pool, error),\n                                    nullptr));\n    run_istream(pool, istream, false);\n}\n\n\/** abort without handler *\/\nstatic void\ntest_abort_without_handler(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_abort_without_handler\", 8192);\n\n    auto *istream = create_test(pool, create_input(pool));\n    pool_unref(pool);\n    pool_commit();\n\n    istream_close_unused(istream);\n\n    cleanup();\n    pool_commit();\n}\n\n#ifndef NO_ABORT_ISTREAM\n\n\/** abort in handler *\/\nstatic void\ntest_abort_in_handler(struct pool *pool)\n{\n\n    pool = pool_new_linear(pool, \"test_abort_in_handler\", 8192);\n\n    auto *abort_istream = istream_inject_new(pool, create_input(pool));\n    auto *istream = create_test(pool, abort_istream);\n    pool_unref(pool);\n    pool_commit();\n\n    Context ctx(*istream);\n    ctx.block_after = -1;\n    ctx.abort_istream = abort_istream;\n\n    while (!ctx.eof) {\n        istream_read_expect(ctx);\n        event_loop(EVLOOP_ONCE|EVLOOP_NONBLOCK);\n    }\n\n    assert(ctx.abort_istream == nullptr);\n\n    cleanup();\n    pool_commit();\n}\n\n\/** abort in handler, with some data consumed *\/\nstatic void\ntest_abort_in_handler_half(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_abort_in_handler_half\", 8192);\n\n    auto *abort_istream =\n        istream_inject_new(pool, istream_four_new(pool, create_input(pool)));\n    auto *istream = create_test(pool, istream_byte_new(*pool, *abort_istream));\n    pool_unref(pool);\n    pool_commit();\n\n    Context ctx(*istream);\n    ctx.half = true;\n    ctx.abort_after = 2;\n    ctx.abort_istream = abort_istream;\n\n    while (!ctx.eof) {\n        istream_read_expect(ctx);\n        event_loop(EVLOOP_ONCE|EVLOOP_NONBLOCK);\n    }\n\n    assert(ctx.abort_istream == nullptr || ctx.abort_after >= 0);\n\n    cleanup();\n    pool_commit();\n}\n\n#endif\n\n\/** abort after 1 byte of output *\/\nstatic void\ntest_abort_1byte(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_abort_1byte\", 8192);\n\n    auto *istream = istream_head_new(pool,\n                                     create_test(pool,\n                                                 create_input(pool)),\n                                     1, false);\n    run_istream(pool, istream, false);\n}\n\n\/** test with istream_later filter *\/\nstatic void\ntest_later(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_later\", 8192);\n\n    auto *istream =\n        create_test(pool, istream_later_new(pool, create_input(pool)));\n    run_istream(pool, istream, true);\n}\n\n#ifdef EXPECTED_RESULT\n\/** test with large input and blocking handler *\/\nstatic void\ntest_big_hold(struct pool *pool)\n{\n    pool = pool_new_linear(pool, \"test_big_hold\", 8192);\n\n    struct istream *istream = create_input(pool);\n    for (unsigned i = 0; i < 1024; ++i)\n        istream = istream_cat_new(pool, istream, create_input(pool), nullptr);\n\n    istream = create_test(pool, istream);\n    struct istream *hold = istream_hold_new(pool, istream);\n\n    istream_read(istream);\n\n    istream_close_unused(hold);\n\n    pool_unref(pool);\n}\n#endif\n\n\n\/*\n * main\n *\n *\/\n\n\nint main(int argc, char **argv) {\n    (void)argc;\n    (void)argv;\n\n    direct_global_init();\n    auto *const event_base = event_init();\n\n    auto *const root_pool = pool_new_libc(nullptr, \"root\");\n\n    \/* run test suite *\/\n\n    test_normal(root_pool);\n    if (enable_blocking) {\n        test_block(root_pool);\n        test_byte(root_pool);\n        test_block_byte(root_pool);\n    }\n    test_half(root_pool);\n    test_fail(root_pool);\n    test_fail_1byte(root_pool);\n    test_abort_without_handler(root_pool);\n#ifndef NO_ABORT_ISTREAM\n    test_abort_in_handler(root_pool);\n    if (enable_blocking)\n        test_abort_in_handler_half(root_pool);\n#endif\n    test_abort_1byte(root_pool);\n    test_later(root_pool);\n\n#ifdef EXPECTED_RESULT\n    test_big_hold(root_pool);\n#endif\n\n#ifdef CUSTOM_TEST\n    test_custom(root_pool);\n#endif\n\n    \/* cleanup *\/\n\n    pool_unref(root_pool);\n    pool_commit();\n\n    pool_recycler_clear();\n\n    event_base_free(event_base);\n    direct_global_deinit();\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"service.h\"\n#include \"..\/..\/core\/system\/cpu.h\"\n#include \"..\/..\/thread\/array.h\"\n#include \"..\/..\/private\/jobs\/queue\/thread.h\"\n#include <unistd.h>\n\n\nnamespace Yuni\n{\nnamespace Job\n{\n\n\tenum\n\t{\n\t\tmaxNumberOfThreads = 512,\n\t};\n\n\n\ttypedef Yuni::Thread::Array<Yuni::Private::QueueService::QueueThread>  ThreadArray;\n\n\n\n\tstatic inline uint OptimalCPUCount()\n\t{\n\t\tuint count = System::CPU::Count();\n\t\tif (count < 1)\n\t\t\treturn 1;\n\t\tif (count > 2)\n\t\t\treturn count - 1;\n\t\treturn count;\n\t}\n\n\n\n\n\n\n\n\tQueueService::QueueService()\n\t\t: pThreads(((void*) new ThreadArray()))\n\t{\n\t\tuint count = OptimalCPUCount();\n\t\tpMinimumThreadCount = count;\n\t\tpMaximumThreadCount = count;\n\t}\n\n\n\tQueueService::QueueService(bool autostart)\n\t\t: pThreads(((void*) new ThreadArray()))\n\t{\n\t\tuint count = OptimalCPUCount();\n\t\tpMinimumThreadCount = count;\n\t\tpMaximumThreadCount = count;\n\n\t\tif (YUNI_LIKELY(autostart))\n\t\t\tstart();\n\t}\n\n\n\tQueueService::~QueueService()\n\t{\n\t\tif (pStarted)\n\t\t{\n\t\t\t\/\/ wait for the execution of all jobs\n\t\t\tif (not idle() or not pWaitingRoom.empty())\n\t\t\t\tpSignalAllThreadHaveStopped.wait();\n\n\t\t\t\/\/ retrieve the thread pool\n\t\t\tThreadArray* threads = nullptr; \/\/ the thread pool\n\t\t\t{\n\t\t\t\tMutexLocker locker(*this);\n\t\t\t\tthreads = (ThreadArray*) pThreads;\n\t\t\t\tpThreads = nullptr;\n\t\t\t}\n\n\t\t\t\/\/ Destroying the thread pool\n\t\t\tif (threads)\n\t\t\t{\n\t\t\t\tthreads->stop(defaultTimeout);\n\t\t\t\tdelete threads;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ the queueservice might be stopped, but the thread pool might have been created\n\t\t\tdelete ((ThreadArray*) pThreads);\n\t\t}\n\t}\n\n\n\tbool QueueService::maximumThreadCount(uint count)\n\t{\n\t\tif (count > maxNumberOfThreads) \/\/ hard-coded value\n\t\t\treturn false;\n\t\tif (0 == count)\n\t\t\tcount = OptimalCPUCount();\n\n\t\tMutexLocker locker(*this);\n\n\t\t\/\/ checking for the lower bound\n\t\tif (pMinimumThreadCount > count)\n\t\t\tpMinimumThreadCount = count;\n\t\t\/\/ reseting the upper bound\n\t\tpMaximumThreadCount = count;\n\t\treturn true;\n\t}\n\n\n\tuint QueueService::maximumThreadCount() const\n\t{\n\t\tMutexLocker locker(*this);\n\t\treturn pMaximumThreadCount;\n\t}\n\n\n\tbool QueueService::minimumThreadCount(uint count)\n\t{\n\t\tif (count > maxNumberOfThreads) \/\/ hard-coded value\n\t\t\treturn false;\n\t\tif (0 == count)\n\t\t\tcount = OptimalCPUCount();\n\n\t\tMutexLocker locker(*this);\n\n\t\t\/\/ checking for the upper bound\n\t\tif (pMaximumThreadCount < count)\n\t\t\tpMaximumThreadCount = count;\n\t\t\/\/ reseting the lower bound\n\t\tpMinimumThreadCount = count;\n\t\treturn true;\n\t}\n\n\n\tuint QueueService::minimumThreadCount() const\n\t{\n\t\tMutexLocker locker(*this);\n\t\treturn pMinimumThreadCount;\n\t}\n\n\n\tstd::pair<uint,uint> QueueService::minmaxThreadCount() const\n\t{\n\t\tMutexLocker locker(*this);\n\t\treturn std::pair<uint, uint>(pMinimumThreadCount, pMaximumThreadCount);\n\t}\n\n\n\tbool QueueService::minmaxThreadCount(const std::pair<uint, uint>& values)\n\t{\n\t\tuint maxv = values.second;\n\t\tif (maxv > maxNumberOfThreads)\n\t\t\treturn false;\n\t\tuint minv = values.first;\n\t\tif (minv > maxv)\n\t\t\tminv = maxv;\n\t\tif (maxv == 0)\n\t\t{\n\t\t\tmaxv = OptimalCPUCount();\n\t\t\tminv = maxv;\n\t\t}\n\n\t\tMutexLocker locker(*this);\n\t\tpMinimumThreadCount = minv;\n\t\tpMaximumThreadCount = maxv;\n\t\treturn true;\n\t}\n\n\n\tbool QueueService::start()\n\t{\n\t\tMutexLocker locker(*this);\n\t\tif (YUNI_LIKELY(not pStarted))\n\t\t{\n\t\t\t\/\/ alias to the thread pool\n\t\t\tThreadArray& array = *((ThreadArray*) pThreads);\n\n\t\t\t\/\/ recreate the thread pool\n\t\t\t\/\/ adding the minimum number of threads\n\t\t\tarray.clear();\n\t\t\tfor (uint i = 0; i != pMinimumThreadCount; ++i)\n\t\t\t\tarray += new Yuni::Private::QueueService::QueueThread(*this);\n\n\t\t\t\/\/ Start all threads at once\n\t\t\tarray.start();\n\n\t\t\t\/\/ Ok now we have started\n\t\t\tpStarted = true;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\tbool QueueService::stop(uint timeout)\n\t{\n\t\tif (pStarted)\n\t\t{\n\t\t\tThreadArray* threads; \/\/ the thread pool\n\n\t\t\t\/\/ The method stop must avoid as much as possible to lock the inner mutex\n\t\t\t{\n\t\t\t\tMutexLocker locker(*this);\n\t\t\t\tif (not pStarted)\n\t\t\t\t\treturn true;\n\n\t\t\t\tthreads = (ThreadArray*) pThreads;\n\t\t\t\tpThreads = nullptr;\n\n\t\t\t\t\/\/ The service is now really stopped\n\t\t\t\tpStarted = false;\n\t\t\t}\n\n\t\t\t\/\/ Destroying the thread pool\n\t\t\tif (YUNI_LIKELY(threads))\n\t\t\t{\n\t\t\t\tthreads->stop(timeout);\n\t\t\t\tdelete threads;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\n\tvoid QueueService::wait()\n\t{\n\t\tif (pStarted)\n\t\t{\n\t\t\twhile (not idle() or not pWaitingRoom.empty())\n\t\t\t\tpSignalAllThreadHaveStopped.waitAndReset();\n\t\t}\n\t}\n\n\n\tbool QueueService::wait(uint timeout, uint \/*pollInterval*\/)\n\t{\n\t\tif (pStarted)\n\t\t{\n\t\t\t\/\/ note: the timeout may not be respected here\n\t\t\tdo\n\t\t\t{\n\t\t\t\tif (idle() and pWaitingRoom.empty())\n\t\t\t\t\treturn true;\n\n\t\t\t\tif (not pSignalAllThreadHaveStopped.wait(timeout))\n\t\t\t\t\treturn false; \/\/ timeout reached\n\n\t\t\t\t\/\/ we have been notified\n\t\t\t\tpSignalAllThreadHaveStopped.reset();\n\t\t\t}\n\t\t\twhile (true);\n\t\t}\n\t\treturn true;\n\t}\n\n\n\tvoid QueueService::add(IJob* job)\n\t{\n\t\tif (YUNI_LIKELY(job))\n\t\t{\n\t\t\tpWaitingRoom.add(job);\n\t\t\t((ThreadArray*) pThreads)->wakeUp();\n\t\t}\n\t}\n\n\n\tvoid QueueService::add(const IJob::Ptr& job)\n\t{\n\t\tif (YUNI_LIKELY(!(!job)))\n\t\t{\n\t\t\tpWaitingRoom.add(job);\n\t\t\t((ThreadArray*) pThreads)->wakeUp();\n\t\t}\n\t}\n\n\n\tvoid QueueService::add(const IJob::Ptr& job, Priority priority)\n\t{\n\t\tif (YUNI_LIKELY(!(!job)))\n\t\t{\n\t\t\tpWaitingRoom.add(job, priority);\n\t\t\t((ThreadArray*) pThreads)->wakeUp();\n\t\t}\n\t}\n\n\n\tvoid QueueService::add(IJob* job, Priority priority)\n\t{\n\t\tif (YUNI_LIKELY(!(!job)))\n\t\t{\n\t\t\tpWaitingRoom.add(job, priority);\n\t\t\t((ThreadArray*) pThreads)->wakeUp();\n\t\t}\n\t}\n\n\n\tuint QueueService::threadCount() const\n\t{\n\t\treturn ((const ThreadArray*) pThreads)->size();\n\t}\n\n\n\n\n\tnamespace \/\/ anonymous\n\t{\n\n\t\tclass QueueActivityPredicate final\n\t\t{\n\t\tpublic:\n\t\t\t\/\/!\n\t\t\ttypedef typename QueueService::ThreadInfo ThreadInfoType;\n\t\t\ttypedef typename ThreadInfoType::Vector VectorType;\n\n\t\tpublic:\n\t\t\tQueueActivityPredicate(VectorType* out) :\n\t\t\t\tpList(out)\n\t\t\t{\n\t\t\t\tpList->clear();\n\t\t\t}\n\n\t\t\ttemplate<class ThreadPtrT>\n\t\t\tbool operator () (const ThreadPtrT& thread) const\n\t\t\t{\n\t\t\t\tThreadInfoType* info = new ThreadInfoType();\n\t\t\t\tinfo->thread = thread;\n\t\t\t\tif (!(!(info->thread)))\n\t\t\t\t{\n\t\t\t\t\tinfo->job = thread->currentJob();\n\t\t\t\t\tif (!(!(info->job)))\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ We have a job which is currently working !\n\t\t\t\t\t\tinfo->hasJob = true;\n\t\t\t\t\t\tinfo->job->fillInformation(*info);\n\t\t\t\t\t\tpList->push_back(info);\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tinfo->hasJob = false;\n\t\t\t\tinfo->state = Yuni::Job::stateIdle;\n\t\t\t\tinfo->canceling = false;\n\t\t\t\tinfo->progression = 0;\n\t\t\t\tpList->push_back(info);\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\tprivate:\n\t\t\tmutable VectorType* pList;\n\t\t};\n\n\t} \/\/ anonymous namespace\n\n\n\tvoid QueueService::activitySnapshot(QueueService::ThreadInfo::Vector& out)\n\t{\n\t\tQueueActivityPredicate predicate(&out);\n\t\t((ThreadArray*) pThreads)->foreachThread(predicate);\n\t}\n\n\n\n\n\n\n\n} \/\/ namespace Job\n} \/\/ namespace Yuni\n\n<commit_msg>job: fixed compilation with Visual Studio<commit_after>\n#include \"service.h\"\n#include \"..\/..\/core\/system\/cpu.h\"\n#include \"..\/..\/thread\/array.h\"\n#include \"..\/..\/private\/jobs\/queue\/thread.h\"\n#ifndef YUNI_OS_WINDOWS\n\t#include <unistd.h>\n#endif\n\n\nnamespace Yuni\n{\nnamespace Job\n{\n\n\tenum\n\t{\n\t\tmaxNumberOfThreads = 512,\n\t};\n\n\n\ttypedef Yuni::Thread::Array<Yuni::Private::QueueService::QueueThread>  ThreadArray;\n\n\n\n\tstatic inline uint OptimalCPUCount()\n\t{\n\t\tuint count = System::CPU::Count();\n\t\tif (count < 1)\n\t\t\treturn 1;\n\t\tif (count > 2)\n\t\t\treturn count - 1;\n\t\treturn count;\n\t}\n\n\n\n\n\n\n\n\tQueueService::QueueService()\n\t\t: pThreads(((void*) new ThreadArray()))\n\t{\n\t\tuint count = OptimalCPUCount();\n\t\tpMinimumThreadCount = count;\n\t\tpMaximumThreadCount = count;\n\t}\n\n\n\tQueueService::QueueService(bool autostart)\n\t\t: pThreads(((void*) new ThreadArray()))\n\t{\n\t\tuint count = OptimalCPUCount();\n\t\tpMinimumThreadCount = count;\n\t\tpMaximumThreadCount = count;\n\n\t\tif (YUNI_LIKELY(autostart))\n\t\t\tstart();\n\t}\n\n\n\tQueueService::~QueueService()\n\t{\n\t\tif (pStarted)\n\t\t{\n\t\t\t\/\/ wait for the execution of all jobs\n\t\t\tif (not idle() or not pWaitingRoom.empty())\n\t\t\t\tpSignalAllThreadHaveStopped.wait();\n\n\t\t\t\/\/ retrieve the thread pool\n\t\t\tThreadArray* threads = nullptr; \/\/ the thread pool\n\t\t\t{\n\t\t\t\tMutexLocker locker(*this);\n\t\t\t\tthreads = (ThreadArray*) pThreads;\n\t\t\t\tpThreads = nullptr;\n\t\t\t}\n\n\t\t\t\/\/ Destroying the thread pool\n\t\t\tif (threads)\n\t\t\t{\n\t\t\t\tthreads->stop(defaultTimeout);\n\t\t\t\tdelete threads;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ the queueservice might be stopped, but the thread pool might have been created\n\t\t\tdelete ((ThreadArray*) pThreads);\n\t\t}\n\t}\n\n\n\tbool QueueService::maximumThreadCount(uint count)\n\t{\n\t\tif (count > maxNumberOfThreads) \/\/ hard-coded value\n\t\t\treturn false;\n\t\tif (0 == count)\n\t\t\tcount = OptimalCPUCount();\n\n\t\tMutexLocker locker(*this);\n\n\t\t\/\/ checking for the lower bound\n\t\tif (pMinimumThreadCount > count)\n\t\t\tpMinimumThreadCount = count;\n\t\t\/\/ reseting the upper bound\n\t\tpMaximumThreadCount = count;\n\t\treturn true;\n\t}\n\n\n\tuint QueueService::maximumThreadCount() const\n\t{\n\t\tMutexLocker locker(*this);\n\t\treturn pMaximumThreadCount;\n\t}\n\n\n\tbool QueueService::minimumThreadCount(uint count)\n\t{\n\t\tif (count > maxNumberOfThreads) \/\/ hard-coded value\n\t\t\treturn false;\n\t\tif (0 == count)\n\t\t\tcount = OptimalCPUCount();\n\n\t\tMutexLocker locker(*this);\n\n\t\t\/\/ checking for the upper bound\n\t\tif (pMaximumThreadCount < count)\n\t\t\tpMaximumThreadCount = count;\n\t\t\/\/ reseting the lower bound\n\t\tpMinimumThreadCount = count;\n\t\treturn true;\n\t}\n\n\n\tuint QueueService::minimumThreadCount() const\n\t{\n\t\tMutexLocker locker(*this);\n\t\treturn pMinimumThreadCount;\n\t}\n\n\n\tstd::pair<uint,uint> QueueService::minmaxThreadCount() const\n\t{\n\t\tMutexLocker locker(*this);\n\t\treturn std::pair<uint, uint>(pMinimumThreadCount, pMaximumThreadCount);\n\t}\n\n\n\tbool QueueService::minmaxThreadCount(const std::pair<uint, uint>& values)\n\t{\n\t\tuint maxv = values.second;\n\t\tif (maxv > maxNumberOfThreads)\n\t\t\treturn false;\n\t\tuint minv = values.first;\n\t\tif (minv > maxv)\n\t\t\tminv = maxv;\n\t\tif (maxv == 0)\n\t\t{\n\t\t\tmaxv = OptimalCPUCount();\n\t\t\tminv = maxv;\n\t\t}\n\n\t\tMutexLocker locker(*this);\n\t\tpMinimumThreadCount = minv;\n\t\tpMaximumThreadCount = maxv;\n\t\treturn true;\n\t}\n\n\n\tbool QueueService::start()\n\t{\n\t\tMutexLocker locker(*this);\n\t\tif (YUNI_LIKELY(not pStarted))\n\t\t{\n\t\t\t\/\/ alias to the thread pool\n\t\t\tThreadArray& array = *((ThreadArray*) pThreads);\n\n\t\t\t\/\/ recreate the thread pool\n\t\t\t\/\/ adding the minimum number of threads\n\t\t\tarray.clear();\n\t\t\tfor (uint i = 0; i != pMinimumThreadCount; ++i)\n\t\t\t\tarray += new Yuni::Private::QueueService::QueueThread(*this);\n\n\t\t\t\/\/ Start all threads at once\n\t\t\tarray.start();\n\n\t\t\t\/\/ Ok now we have started\n\t\t\tpStarted = true;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\tbool QueueService::stop(uint timeout)\n\t{\n\t\tif (pStarted)\n\t\t{\n\t\t\tThreadArray* threads; \/\/ the thread pool\n\n\t\t\t\/\/ The method stop must avoid as much as possible to lock the inner mutex\n\t\t\t{\n\t\t\t\tMutexLocker locker(*this);\n\t\t\t\tif (not pStarted)\n\t\t\t\t\treturn true;\n\n\t\t\t\tthreads = (ThreadArray*) pThreads;\n\t\t\t\tpThreads = nullptr;\n\n\t\t\t\t\/\/ The service is now really stopped\n\t\t\t\tpStarted = false;\n\t\t\t}\n\n\t\t\t\/\/ Destroying the thread pool\n\t\t\tif (YUNI_LIKELY(threads))\n\t\t\t{\n\t\t\t\tthreads->stop(timeout);\n\t\t\t\tdelete threads;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\n\tvoid QueueService::wait()\n\t{\n\t\tif (pStarted)\n\t\t{\n\t\t\twhile (not idle() or not pWaitingRoom.empty())\n\t\t\t\tpSignalAllThreadHaveStopped.waitAndReset();\n\t\t}\n\t}\n\n\n\tbool QueueService::wait(uint timeout, uint \/*pollInterval*\/)\n\t{\n\t\tif (pStarted)\n\t\t{\n\t\t\t\/\/ note: the timeout may not be respected here\n\t\t\tdo\n\t\t\t{\n\t\t\t\tif (idle() and pWaitingRoom.empty())\n\t\t\t\t\treturn true;\n\n\t\t\t\tif (not pSignalAllThreadHaveStopped.wait(timeout))\n\t\t\t\t\treturn false; \/\/ timeout reached\n\n\t\t\t\t\/\/ we have been notified\n\t\t\t\tpSignalAllThreadHaveStopped.reset();\n\t\t\t}\n\t\t\twhile (true);\n\t\t}\n\t\treturn true;\n\t}\n\n\n\tvoid QueueService::add(IJob* job)\n\t{\n\t\tif (YUNI_LIKELY(job))\n\t\t{\n\t\t\tpWaitingRoom.add(job);\n\t\t\t((ThreadArray*) pThreads)->wakeUp();\n\t\t}\n\t}\n\n\n\tvoid QueueService::add(const IJob::Ptr& job)\n\t{\n\t\tif (YUNI_LIKELY(!(!job)))\n\t\t{\n\t\t\tpWaitingRoom.add(job);\n\t\t\t((ThreadArray*) pThreads)->wakeUp();\n\t\t}\n\t}\n\n\n\tvoid QueueService::add(const IJob::Ptr& job, Priority priority)\n\t{\n\t\tif (YUNI_LIKELY(!(!job)))\n\t\t{\n\t\t\tpWaitingRoom.add(job, priority);\n\t\t\t((ThreadArray*) pThreads)->wakeUp();\n\t\t}\n\t}\n\n\n\tvoid QueueService::add(IJob* job, Priority priority)\n\t{\n\t\tif (YUNI_LIKELY(!(!job)))\n\t\t{\n\t\t\tpWaitingRoom.add(job, priority);\n\t\t\t((ThreadArray*) pThreads)->wakeUp();\n\t\t}\n\t}\n\n\n\tuint QueueService::threadCount() const\n\t{\n\t\treturn ((const ThreadArray*) pThreads)->size();\n\t}\n\n\n\n\n\tnamespace \/\/ anonymous\n\t{\n\n\t\tclass QueueActivityPredicate final\n\t\t{\n\t\tpublic:\n\t\t\t\/\/!\n\t\t\ttypedef typename QueueService::ThreadInfo ThreadInfoType;\n\t\t\ttypedef typename ThreadInfoType::Vector VectorType;\n\n\t\tpublic:\n\t\t\tQueueActivityPredicate(VectorType* out) :\n\t\t\t\tpList(out)\n\t\t\t{\n\t\t\t\tpList->clear();\n\t\t\t}\n\n\t\t\ttemplate<class ThreadPtrT>\n\t\t\tbool operator () (const ThreadPtrT& thread) const\n\t\t\t{\n\t\t\t\tThreadInfoType* info = new ThreadInfoType();\n\t\t\t\tinfo->thread = thread;\n\t\t\t\tif (!(!(info->thread)))\n\t\t\t\t{\n\t\t\t\t\tinfo->job = thread->currentJob();\n\t\t\t\t\tif (!(!(info->job)))\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ We have a job which is currently working !\n\t\t\t\t\t\tinfo->hasJob = true;\n\t\t\t\t\t\tinfo->job->fillInformation(*info);\n\t\t\t\t\t\tpList->push_back(info);\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tinfo->hasJob = false;\n\t\t\t\tinfo->state = Yuni::Job::stateIdle;\n\t\t\t\tinfo->canceling = false;\n\t\t\t\tinfo->progression = 0;\n\t\t\t\tpList->push_back(info);\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\tprivate:\n\t\t\tmutable VectorType* pList;\n\t\t};\n\n\t} \/\/ anonymous namespace\n\n\n\tvoid QueueService::activitySnapshot(QueueService::ThreadInfo::Vector& out)\n\t{\n\t\tQueueActivityPredicate predicate(&out);\n\t\t((ThreadArray*) pThreads)->foreachThread(predicate);\n\t}\n\n\n\n\n\n\n\n} \/\/ namespace Job\n} \/\/ namespace Yuni\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ConfigQuorumContext.h\"\n#include \"Framework\/Replication\/ReplicationConfig.h\"\n#include \"Framework\/Replication\/PaxosLease\/PaxosLeaseMessage.h\"\n#include \"Framework\/Replication\/Paxos\/PaxosMessage.h\"\n#include \"Application\/Common\/CatchupMessage.h\"\n#include \"ConfigQuorumProcessor.h\"\n\nvoid ConfigQuorumContext::Init(ConfigQuorumProcessor* quorumProcessor_, unsigned numConfigServers,\n StorageShardProxy* quorumPaxosShard, StorageShardProxy* quorumLogShard)\n{\n    uint64_t nodeID;\n    \n    quorumProcessor = quorumProcessor_;\n    \n    quorumID = 0;\n    for (nodeID = 0; nodeID < numConfigServers; nodeID++)\n        quorum.AddNode(nodeID);\n\n    transport.SetQuorum(&quorum);\n    transport.SetQuorumID(quorumID);\n    \n    database.Init(quorumPaxosShard, quorumLogShard);\n    \n    replicatedLog.Init(this);\n    replicatedLog.SetUseProposeTimeouts(true);\n    replicatedLog.SetCommitChaining(false);\n    replicatedLog.SetAsyncCommit(false);\n    paxosLease.Init(this);\n    transport.SetQuorumID(quorumID);\n    highestPaxosID = 0; \n\n    paxosLease.AcquireLease();\n\n    isReplicationActive = true;\n}\n\nvoid ConfigQuorumContext::Append(ConfigMessage* message)\n{\n    message->Write(nextValue);\n\n    replicatedLog.TryAppendNextValue();\n}\n\nbool ConfigQuorumContext::IsAppending()\n{\n    return (nextValue.GetLength() != 0);\n}\n\nbool ConfigQuorumContext::IsLeaseOwner()\n{\n    return paxosLease.IsLeaseOwner();\n}\n\nbool ConfigQuorumContext::IsLeaseKnown()\n{\n    return paxosLease.IsLeaseKnown();\n}\n\nuint64_t ConfigQuorumContext::GetLeaseOwner()\n{\n    return paxosLease.GetLeaseOwner();\n}\n\nbool ConfigQuorumContext::IsLeader()\n{\n    return IsLeaseOwner() && replicatedLog.IsMultiPaxosEnabled();\n}\n\nvoid ConfigQuorumContext::OnLearnLease()\n{\n    replicatedLog.OnLearnLease();\n    quorumProcessor->OnLearnLease();\n}\n\nvoid ConfigQuorumContext::OnLeaseTimeout()\n{\n    nextValue.Clear();\n    replicatedLog.OnLeaseTimeout();\n    quorumProcessor->OnLeaseTimeout();\n}\n\nvoid ConfigQuorumContext::OnIsLeader()\n{\n    quorumProcessor->OnIsLeader();\n}\n\nuint64_t ConfigQuorumContext::GetQuorumID()\n{\n    return quorumID;\n}\n\nvoid ConfigQuorumContext::SetPaxosID(uint64_t paxosID)\n{\n    replicatedLog.SetPaxosID(paxosID);\n}\n\nuint64_t ConfigQuorumContext::GetPaxosID()\n{\n    return replicatedLog.GetPaxosID();\n}\n\nuint64_t ConfigQuorumContext::GetHighestPaxosID()\n{\n    return highestPaxosID;\n}\n\nQuorum* ConfigQuorumContext::GetQuorum()\n{\n    return &quorum;\n}\n\nQuorumDatabase* ConfigQuorumContext::GetDatabase()\n{\n    return &database;\n}\n\nQuorumTransport* ConfigQuorumContext::GetTransport()\n{\n    return &transport;\n}\n\nbool ConfigQuorumContext::IsPaxosBlocked()\n{\n    return false;\n}\n\nBuffer& ConfigQuorumContext::GetNextValue()\n{\n    return nextValue;\n}\n\nvoid ConfigQuorumContext::OnAppend(uint64_t paxosID, Buffer& value, bool ownAppend)\n{\n    bool            ret;\n    ReadBuffer      rbValue;\n    ConfigMessage   message;\n\n    nextValue.Clear();\n\n    rbValue.Wrap(value);\n    ret = message.Read(rbValue);\n    ASSERT(ret);\n    quorumProcessor->OnAppend(paxosID, message, ownAppend);\n}\n\nvoid ConfigQuorumContext::OnMessage(uint64_t \/*nodeID*\/, ReadBuffer buffer)\n{\n    char proto;\n    \n    Log_Trace(\"%R\", &buffer);\n\n\/\/    quorumProcessor->RegisterHeartbeat(nodeID);\n\n    if (buffer.GetLength() < 2)\n        ASSERT_FAIL();\n\n    proto = buffer.GetCharAt(0);\n    ASSERT(buffer.GetCharAt(1) == ':');\n    \n    switch(proto)\n    {\n        case PAXOSLEASE_PROTOCOL_ID:        \/\/ 'L':\n            OnPaxosLeaseMessage(buffer);\n            break;\n        case PAXOS_PROTOCOL_ID:             \/\/ 'P':\n            OnPaxosMessage(buffer);\n            break;\n        case CATCHUP_PROTOCOL_ID:           \/\/ 'C'\n            OnCatchupMessage(buffer);\n            break;\n        default:\n            ASSERT_FAIL();\n            break;\n    }\n}\n\nvoid ConfigQuorumContext::OnStartCatchup()\n{\n    quorumProcessor->OnStartCatchup();\n}\n\nvoid ConfigQuorumContext::OnCatchupComplete(uint64_t paxosID)\n{\n    replicatedLog.OnCatchupComplete(paxosID);\n}\n\nvoid ConfigQuorumContext::OnAppendComplete()\n{\n    replicatedLog.OnAppendComplete();\n}\n\nvoid ConfigQuorumContext::StopReplication()\n{\n    \/\/ TODO: xxx\n}\n\nvoid ConfigQuorumContext::ContinueReplication()\n{\n    \/\/ TODO: xxx\n}\n\nvoid ConfigQuorumContext::OnPaxosLeaseMessage(ReadBuffer buffer)\n{\n    PaxosLeaseMessage msg;\n\n    Log_Trace(\"%R\", &buffer);\n    \n    msg.Read(buffer);\n    if (msg.type == PAXOSLEASE_PREPARE_REQUEST || msg.type == PAXOSLEASE_LEARN_CHOSEN)\n    {\n        if (isReplicationActive)\n        {\n            RegisterPaxosID(msg.paxosID);\n            replicatedLog.RegisterPaxosID(msg.paxosID, msg.nodeID);\n        }\n    }\n    paxosLease.OnMessage(msg);\n    \/\/ TODO: right now PaxosLeaseLearner will not call back\n}\n\n\nvoid ConfigQuorumContext::OnPaxosMessage(ReadBuffer buffer)\n{\n    PaxosMessage msg;\n \n    if (!isReplicationActive)\n        return;\n\n    msg.Read(buffer);\n    RegisterPaxosID(msg.paxosID);\n    replicatedLog.RegisterPaxosID(msg.paxosID, msg.nodeID);\n    replicatedLog.OnMessage(msg);\n}\n\nvoid ConfigQuorumContext::OnCatchupMessage(ReadBuffer buffer)\n{\n    CatchupMessage msg;\n    \n    msg.Read(buffer);\n    quorumProcessor->OnCatchupMessage(msg);\n}\n\nvoid ConfigQuorumContext::RegisterPaxosID(uint64_t paxosID)\n{\n    if (paxosID > highestPaxosID)\n        highestPaxosID = paxosID;\n}\n<commit_msg>Don't use PaxosLease on the controller in single mode.<commit_after>#include \"ConfigQuorumContext.h\"\n#include \"Framework\/Replication\/ReplicationConfig.h\"\n#include \"Framework\/Replication\/PaxosLease\/PaxosLeaseMessage.h\"\n#include \"Framework\/Replication\/Paxos\/PaxosMessage.h\"\n#include \"Application\/Common\/CatchupMessage.h\"\n#include \"ConfigQuorumProcessor.h\"\n\nvoid ConfigQuorumContext::Init(ConfigQuorumProcessor* quorumProcessor_, unsigned numConfigServers,\n StorageShardProxy* quorumPaxosShard, StorageShardProxy* quorumLogShard)\n{\n    uint64_t nodeID;\n    \n    quorumProcessor = quorumProcessor_;\n    \n    quorumID = 0;\n    for (nodeID = 0; nodeID < numConfigServers; nodeID++)\n        quorum.AddNode(nodeID);\n\n    transport.SetQuorum(&quorum);\n    transport.SetQuorumID(quorumID);\n    \n    database.Init(quorumPaxosShard, quorumLogShard);\n    \n    replicatedLog.Init(this);\n    replicatedLog.SetUseProposeTimeouts(true);\n    replicatedLog.SetCommitChaining(false);\n    replicatedLog.SetAsyncCommit(false);\n    paxosLease.Init(this);\n    transport.SetQuorumID(quorumID);\n    highestPaxosID = 0; \n\n    isReplicationActive = true;\n\n    if (quorum.GetNumNodes() > 1)\n    {\n        paxosLease.AcquireLease();\n    }\n    else\n    {\n        replicatedLog.OnLearnLease();\n        quorumProcessor->OnLearnLease();\n    }\n\n}\n\nvoid ConfigQuorumContext::Append(ConfigMessage* message)\n{\n    message->Write(nextValue);\n\n    replicatedLog.TryAppendNextValue();\n}\n\nbool ConfigQuorumContext::IsAppending()\n{\n    return (nextValue.GetLength() != 0);\n}\n\nbool ConfigQuorumContext::IsLeaseOwner()\n{\n    if (quorum.GetNumNodes() == 1)\n        return true;\n    else\n        return paxosLease.IsLeaseOwner();\n}\n\nbool ConfigQuorumContext::IsLeaseKnown()\n{\n    if (quorum.GetNumNodes() == 1)\n        return true;\n    else\n        return paxosLease.IsLeaseKnown();\n}\n\nuint64_t ConfigQuorumContext::GetLeaseOwner()\n{\n    if (quorum.GetNumNodes() == 1)\n        return MY_NODEID;\n    else\n        return paxosLease.GetLeaseOwner();\n}\n\nbool ConfigQuorumContext::IsLeader()\n{\n    if (quorum.GetNumNodes() == 1)\n        return true;\n    else\n        return IsLeaseOwner() && replicatedLog.IsMultiPaxosEnabled();\n}\n\nvoid ConfigQuorumContext::OnLearnLease()\n{\n    replicatedLog.OnLearnLease();\n    quorumProcessor->OnLearnLease();\n}\n\nvoid ConfigQuorumContext::OnLeaseTimeout()\n{\n    nextValue.Clear();\n    replicatedLog.OnLeaseTimeout();\n    quorumProcessor->OnLeaseTimeout();\n}\n\nvoid ConfigQuorumContext::OnIsLeader()\n{\n    quorumProcessor->OnIsLeader();\n}\n\nuint64_t ConfigQuorumContext::GetQuorumID()\n{\n    return quorumID;\n}\n\nvoid ConfigQuorumContext::SetPaxosID(uint64_t paxosID)\n{\n    replicatedLog.SetPaxosID(paxosID);\n}\n\nuint64_t ConfigQuorumContext::GetPaxosID()\n{\n    return replicatedLog.GetPaxosID();\n}\n\nuint64_t ConfigQuorumContext::GetHighestPaxosID()\n{\n    return highestPaxosID;\n}\n\nQuorum* ConfigQuorumContext::GetQuorum()\n{\n    return &quorum;\n}\n\nQuorumDatabase* ConfigQuorumContext::GetDatabase()\n{\n    return &database;\n}\n\nQuorumTransport* ConfigQuorumContext::GetTransport()\n{\n    return &transport;\n}\n\nbool ConfigQuorumContext::IsPaxosBlocked()\n{\n    return false;\n}\n\nBuffer& ConfigQuorumContext::GetNextValue()\n{\n    return nextValue;\n}\n\nvoid ConfigQuorumContext::OnAppend(uint64_t paxosID, Buffer& value, bool ownAppend)\n{\n    bool            ret;\n    ReadBuffer      rbValue;\n    ConfigMessage   message;\n\n    nextValue.Clear();\n\n    rbValue.Wrap(value);\n    ret = message.Read(rbValue);\n    ASSERT(ret);\n    quorumProcessor->OnAppend(paxosID, message, ownAppend);\n}\n\nvoid ConfigQuorumContext::OnMessage(uint64_t \/*nodeID*\/, ReadBuffer buffer)\n{\n    char proto;\n    \n    Log_Trace(\"%R\", &buffer);\n\n\/\/    quorumProcessor->RegisterHeartbeat(nodeID);\n\n    if (buffer.GetLength() < 2)\n        ASSERT_FAIL();\n\n    proto = buffer.GetCharAt(0);\n    ASSERT(buffer.GetCharAt(1) == ':');\n    \n    switch(proto)\n    {\n        case PAXOSLEASE_PROTOCOL_ID:        \/\/ 'L':\n            OnPaxosLeaseMessage(buffer);\n            break;\n        case PAXOS_PROTOCOL_ID:             \/\/ 'P':\n            OnPaxosMessage(buffer);\n            break;\n        case CATCHUP_PROTOCOL_ID:           \/\/ 'C'\n            OnCatchupMessage(buffer);\n            break;\n        default:\n            ASSERT_FAIL();\n            break;\n    }\n}\n\nvoid ConfigQuorumContext::OnStartCatchup()\n{\n    quorumProcessor->OnStartCatchup();\n}\n\nvoid ConfigQuorumContext::OnCatchupComplete(uint64_t paxosID)\n{\n    replicatedLog.OnCatchupComplete(paxosID);\n}\n\nvoid ConfigQuorumContext::OnAppendComplete()\n{\n    replicatedLog.OnAppendComplete();\n}\n\nvoid ConfigQuorumContext::StopReplication()\n{\n    \/\/ TODO: xxx\n}\n\nvoid ConfigQuorumContext::ContinueReplication()\n{\n    \/\/ TODO: xxx\n}\n\nvoid ConfigQuorumContext::OnPaxosLeaseMessage(ReadBuffer buffer)\n{\n    PaxosLeaseMessage msg;\n\n    Log_Trace(\"%R\", &buffer);\n    \n    msg.Read(buffer);\n    if (msg.type == PAXOSLEASE_PREPARE_REQUEST || msg.type == PAXOSLEASE_LEARN_CHOSEN)\n    {\n        if (isReplicationActive)\n        {\n            RegisterPaxosID(msg.paxosID);\n            replicatedLog.RegisterPaxosID(msg.paxosID, msg.nodeID);\n        }\n    }\n    paxosLease.OnMessage(msg);\n    \/\/ TODO: right now PaxosLeaseLearner will not call back\n}\n\n\nvoid ConfigQuorumContext::OnPaxosMessage(ReadBuffer buffer)\n{\n    PaxosMessage msg;\n \n    if (!isReplicationActive)\n        return;\n\n    msg.Read(buffer);\n    RegisterPaxosID(msg.paxosID);\n    replicatedLog.RegisterPaxosID(msg.paxosID, msg.nodeID);\n    replicatedLog.OnMessage(msg);\n}\n\nvoid ConfigQuorumContext::OnCatchupMessage(ReadBuffer buffer)\n{\n    CatchupMessage msg;\n    \n    msg.Read(buffer);\n    quorumProcessor->OnCatchupMessage(msg);\n}\n\nvoid ConfigQuorumContext::RegisterPaxosID(uint64_t paxosID)\n{\n    if (paxosID > highestPaxosID)\n        highestPaxosID = paxosID;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ShardMigrationWriter.h\"\n#include \"Application\/Common\/ContextTransport.h\"\n#include \"ShardServer.h\"\n#include \"ShardQuorumProcessor.h\"\n\nShardMigrationWriter::ShardMigrationWriter()\n{\n    onTimeout.SetCallable(MFUNC(ShardMigrationWriter, OnTimeout));\n    onTimeout.SetDelay(SHARD_MIGRATION_WRITER_DELAY);\n    Reset();\n}\n\nShardMigrationWriter::~ShardMigrationWriter()\n{\n    if (cursor != NULL)\n        delete cursor;\n}\n\nvoid ShardMigrationWriter::Init(ShardServer* shardServer_)\n{\n    shardServer = shardServer_;\n    environment = shardServer->GetDatabaseManager()->GetEnvironment();\n\n    Reset();\n}\n\nvoid ShardMigrationWriter::Reset()\n{\n    cursor = NULL;\n    isActive = false;\n    sendFirst = false;\n    quorumProcessor = NULL;\n    bytesSent = 0;\n    bytesTotal = 0;\n    startTime = 0;\n    prevBytesSent = 0;\n    EventLoop::Remove(&onTimeout);\n}\n\nbool ShardMigrationWriter::IsActive()\n{\n    return isActive;\n}\n\nuint64_t ShardMigrationWriter::GetShardID()\n{\n    return shardID;\n}\n\nuint64_t ShardMigrationWriter::GetQuorumID()\n{\n    return quorumID;\n}\n\nuint64_t ShardMigrationWriter::GetNodeID()\n{\n    return nodeID;\n}\n\nuint64_t ShardMigrationWriter::GetBytesSent()\n{\n    return bytesSent;\n}\n\nuint64_t ShardMigrationWriter::GetBytesTotal()\n{\n    return bytesTotal;\n}\n\nuint64_t ShardMigrationWriter::GetThroughput()\n{\n    uint64_t now;\n    \n    now = NowClock();\n    \n    if (now > startTime)\n        return bytesSent \/ ((now - startTime)\/1000.0);\n    else\n        return 0;\n}\n\nvoid ShardMigrationWriter::Begin(ClusterMessage& request)\n{\n    ConfigState*        configState;\n    ConfigShard*        configShard;\n    ConfigShardServer*  configShardServer;\n    \n    assert(!isActive);\n    assert(cursor == NULL);\n\n    configState = shardServer->GetConfigState();\n    configShard = configState->GetShard(request.shardID);\n    assert(configShard != NULL);\n    configShardServer = configState->GetShardServer(request.nodeID);\n    assert(configShardServer != NULL);\n    \n    quorumProcessor = shardServer->GetQuorumProcessor(configShard->quorumID);\n    assert(quorumProcessor != NULL);\n    \n    isActive = true;\n    nodeID = request.nodeID;\n    quorumID = request.quorumID;\n    shardID = request.shardID;\n    \n    bytesTotal = environment->GetSize(QUORUM_DATABASE_DATA_CONTEXT, shardID);\n    startTime = NowClock();\n    \n    CONTEXT_TRANSPORT->AddNode(nodeID, configShardServer->endpoint);\n    \n    Log_Debug(\"ShardMigrationWriter::Begin() nodeID = %U\", nodeID);\n    Log_Debug(\"ShardMigrationWriter::Begin() quorumID = %U\", quorumID);\n    Log_Debug(\"ShardMigrationWriter::Begin() shardID = %U\", shardID);\n\n    Log_Message(\"Migrating shard %U into quorum %U (sending)\", shardID, quorumID);\n\n    sendFirst = true;\n    CONTEXT_TRANSPORT->RegisterWriteReadyness(nodeID, MFUNC(ShardMigrationWriter, OnWriteReadyness));\n    EventLoop::Add(&onTimeout);\n}\n\nvoid ShardMigrationWriter::Abort()\n{\n    Log_Message(\"Aborting shard migration...\", shardID, quorumID);\n    \n    CONTEXT_TRANSPORT->UnregisterWriteReadyness(nodeID, MFUNC(ShardMigrationWriter, OnWriteReadyness));\n    Reset();\n\n    if (cursor != NULL)\n    {\n        delete cursor;\n        cursor = NULL;\n    }\n}\n\nvoid ShardMigrationWriter::SendFirst()\n{\n    ClusterMessage      msg;\n    ReadBuffer          key;\n    ReadBuffer          value;\n\n    assert(cursor == NULL);\n    cursor = environment->GetBulkCursor(QUORUM_DATABASE_DATA_CONTEXT, shardID);\n\n    msg.ShardMigrationBegin(quorumID, shardID);\n    CONTEXT_TRANSPORT->SendClusterMessage(nodeID, msg);\n\n    Log_Debug(\"ShardMigrationWriter sending BEGIN\");\n\n    \/\/ send first KV\n    kv = cursor->First();\n    if (kv)\n        SendItem(kv);\n    else\n        SendCommit();\n}\n\nvoid ShardMigrationWriter::SendNext()\n{\n    assert(cursor != NULL);\n    kv = cursor->Next(kv);\n    if (kv)\n        SendItem(kv);\n    else\n        SendCommit();\n}\n\nvoid ShardMigrationWriter::SendCommit()\n{\n    ClusterMessage msg;\n    \n    msg.ShardMigrationCommit(quorumID, shardID);\n    CONTEXT_TRANSPORT->SendClusterMessage(nodeID, msg);\n\n    Log_Message(\"Finished sending shard %U...\", shardID);\n\n    if (cursor != NULL)\n    {\n        delete cursor;\n        cursor = NULL;\n    }\n\n    CONTEXT_TRANSPORT->UnregisterWriteReadyness(nodeID, MFUNC(ShardMigrationWriter, OnWriteReadyness));\n\n    Reset();\n}\n\nvoid ShardMigrationWriter::SendItem(StorageKeyValue* kv)\n{\n    ClusterMessage msg;\n    \n    if (kv->GetType() == STORAGE_KEYVALUE_TYPE_SET)\n    {\n        msg.ShardMigrationSet(quorumID, shardID, kv->GetKey(), kv->GetValue());\n        bytesSent += kv->GetKey().GetLength() + kv->GetValue().GetLength();\n    }\n    else\n    {\n        msg.ShardMigrationDelete(quorumID, shardID, kv->GetKey());\n        bytesSent += kv->GetKey().GetLength();\n    }\n\n    CONTEXT_TRANSPORT->SendClusterMessage(nodeID, msg);\n}\n\nvoid ShardMigrationWriter::OnWriteReadyness()\n{\n    assert(quorumProcessor != NULL);\n    if (!quorumProcessor->IsPrimary()\n     || !shardServer->GetConfigState()->isMigrating\n     || (shardServer->GetConfigState()->isMigrating &&\n         (shardServer->GetConfigState()->migrateShardID != shardID ||\n          shardServer->GetConfigState()->migrateQuorumID != quorumID)))\n    {\n        Abort();\n        return;\n    }\n    \n    if (sendFirst)\n    {\n        sendFirst = false;\n        SendFirst();\n    }\n    else\n    {\n        SendNext();\n    }\n}\n\nvoid ShardMigrationWriter::OnTimeout()\n{\n    ConfigState*    configState;\n    ConfigQuorum*   configQuorum;\n\n    assert(quorumProcessor != NULL);\n    if (!quorumProcessor->IsPrimary()\n     || !shardServer->GetConfigState()->isMigrating\n     || (shardServer->GetConfigState()->isMigrating &&\n         (shardServer->GetConfigState()->migrateShardID != shardID ||\n          shardServer->GetConfigState()->migrateQuorumID != quorumID)))\n    {\n        Abort();\n        return;\n    }\n    \n    \/\/ check the destination nodeID is still in the quorum\n    configState = quorumProcessor->GetShardServer()->GetConfigState();\n    configQuorum = configState->GetQuorum(quorumID);\n    if (configQuorum == NULL)\n    {\n        Abort();\n        return;\n    }\n    if (!configQuorum->IsMember(nodeID))\n    {\n        Abort();\n        return;\n    }\n\n    if (bytesSent == prevBytesSent)\n    {\n        Abort();\n        return;\n    }\n\n    prevBytesSent = bytesSent;\n    EventLoop::Add(&onTimeout);\n}\n<commit_msg>Fixed bug where ShardServer would crash if migrating empty database.<commit_after>#include \"ShardMigrationWriter.h\"\n#include \"Application\/Common\/ContextTransport.h\"\n#include \"ShardServer.h\"\n#include \"ShardQuorumProcessor.h\"\n\nShardMigrationWriter::ShardMigrationWriter()\n{\n    onTimeout.SetCallable(MFUNC(ShardMigrationWriter, OnTimeout));\n    onTimeout.SetDelay(SHARD_MIGRATION_WRITER_DELAY);\n    Reset();\n}\n\nShardMigrationWriter::~ShardMigrationWriter()\n{\n    if (cursor != NULL)\n        delete cursor;\n}\n\nvoid ShardMigrationWriter::Init(ShardServer* shardServer_)\n{\n    shardServer = shardServer_;\n    environment = shardServer->GetDatabaseManager()->GetEnvironment();\n\n    Reset();\n}\n\nvoid ShardMigrationWriter::Reset()\n{\n    cursor = NULL;\n    isActive = false;\n    sendFirst = false;\n    quorumProcessor = NULL;\n    bytesSent = 0;\n    bytesTotal = 0;\n    startTime = 0;\n    prevBytesSent = 0;\n    EventLoop::Remove(&onTimeout);\n}\n\nbool ShardMigrationWriter::IsActive()\n{\n    return isActive;\n}\n\nuint64_t ShardMigrationWriter::GetShardID()\n{\n    return shardID;\n}\n\nuint64_t ShardMigrationWriter::GetQuorumID()\n{\n    return quorumID;\n}\n\nuint64_t ShardMigrationWriter::GetNodeID()\n{\n    return nodeID;\n}\n\nuint64_t ShardMigrationWriter::GetBytesSent()\n{\n    return bytesSent;\n}\n\nuint64_t ShardMigrationWriter::GetBytesTotal()\n{\n    return bytesTotal;\n}\n\nuint64_t ShardMigrationWriter::GetThroughput()\n{\n    uint64_t now;\n    \n    now = NowClock();\n    \n    if (now > startTime)\n        return bytesSent \/ ((now - startTime)\/1000.0);\n    else\n        return 0;\n}\n\nvoid ShardMigrationWriter::Begin(ClusterMessage& request)\n{\n    ConfigState*        configState;\n    ConfigShard*        configShard;\n    ConfigShardServer*  configShardServer;\n    \n    assert(!isActive);\n    assert(cursor == NULL);\n\n    configState = shardServer->GetConfigState();\n    configShard = configState->GetShard(request.shardID);\n    assert(configShard != NULL);\n    configShardServer = configState->GetShardServer(request.nodeID);\n    assert(configShardServer != NULL);\n    \n    quorumProcessor = shardServer->GetQuorumProcessor(configShard->quorumID);\n    assert(quorumProcessor != NULL);\n    \n    isActive = true;\n    nodeID = request.nodeID;\n    quorumID = request.quorumID;\n    shardID = request.shardID;\n    \n    bytesTotal = environment->GetSize(QUORUM_DATABASE_DATA_CONTEXT, shardID);\n    startTime = NowClock();\n    \n    CONTEXT_TRANSPORT->AddNode(nodeID, configShardServer->endpoint);\n    \n    Log_Debug(\"ShardMigrationWriter::Begin() nodeID = %U\", nodeID);\n    Log_Debug(\"ShardMigrationWriter::Begin() quorumID = %U\", quorumID);\n    Log_Debug(\"ShardMigrationWriter::Begin() shardID = %U\", shardID);\n\n    Log_Message(\"Migrating shard %U into quorum %U (sending)\", shardID, quorumID);\n\n    sendFirst = true;\n    EventLoop::Add(&onTimeout);\n    CONTEXT_TRANSPORT->RegisterWriteReadyness(nodeID, MFUNC(ShardMigrationWriter, OnWriteReadyness));\n}\n\nvoid ShardMigrationWriter::Abort()\n{\n    Log_Message(\"Aborting shard migration...\", shardID, quorumID);\n    \n    CONTEXT_TRANSPORT->UnregisterWriteReadyness(nodeID, MFUNC(ShardMigrationWriter, OnWriteReadyness));\n    Reset();\n\n    if (cursor != NULL)\n    {\n        delete cursor;\n        cursor = NULL;\n    }\n}\n\nvoid ShardMigrationWriter::SendFirst()\n{\n    ClusterMessage      msg;\n    ReadBuffer          key;\n    ReadBuffer          value;\n\n    assert(cursor == NULL);\n    cursor = environment->GetBulkCursor(QUORUM_DATABASE_DATA_CONTEXT, shardID);\n\n    msg.ShardMigrationBegin(quorumID, shardID);\n    CONTEXT_TRANSPORT->SendClusterMessage(nodeID, msg);\n\n    Log_Debug(\"ShardMigrationWriter sending BEGIN\");\n\n    \/\/ send first KV\n    kv = cursor->First();\n    if (kv)\n        SendItem(kv);\n    else\n        SendCommit();\n}\n\nvoid ShardMigrationWriter::SendNext()\n{\n    assert(cursor != NULL);\n    kv = cursor->Next(kv);\n    if (kv)\n        SendItem(kv);\n    else\n        SendCommit();\n}\n\nvoid ShardMigrationWriter::SendCommit()\n{\n    ClusterMessage msg;\n    \n    msg.ShardMigrationCommit(quorumID, shardID);\n    CONTEXT_TRANSPORT->SendClusterMessage(nodeID, msg);\n\n    Log_Message(\"Finished sending shard %U...\", shardID);\n\n    if (cursor != NULL)\n    {\n        delete cursor;\n        cursor = NULL;\n    }\n\n    CONTEXT_TRANSPORT->UnregisterWriteReadyness(nodeID, MFUNC(ShardMigrationWriter, OnWriteReadyness));\n\n    Reset();\n}\n\nvoid ShardMigrationWriter::SendItem(StorageKeyValue* kv)\n{\n    ClusterMessage msg;\n    \n    if (kv->GetType() == STORAGE_KEYVALUE_TYPE_SET)\n    {\n        msg.ShardMigrationSet(quorumID, shardID, kv->GetKey(), kv->GetValue());\n        bytesSent += kv->GetKey().GetLength() + kv->GetValue().GetLength();\n    }\n    else\n    {\n        msg.ShardMigrationDelete(quorumID, shardID, kv->GetKey());\n        bytesSent += kv->GetKey().GetLength();\n    }\n\n    CONTEXT_TRANSPORT->SendClusterMessage(nodeID, msg);\n}\n\nvoid ShardMigrationWriter::OnWriteReadyness()\n{\n    assert(quorumProcessor != NULL);\n    if (!quorumProcessor->IsPrimary()\n     || !shardServer->GetConfigState()->isMigrating\n     || (shardServer->GetConfigState()->isMigrating &&\n         (shardServer->GetConfigState()->migrateShardID != shardID ||\n          shardServer->GetConfigState()->migrateQuorumID != quorumID)))\n    {\n        Abort();\n        return;\n    }\n    \n    if (sendFirst)\n    {\n        sendFirst = false;\n        SendFirst();\n    }\n    else\n    {\n        SendNext();\n    }\n}\n\nvoid ShardMigrationWriter::OnTimeout()\n{\n    ConfigState*    configState;\n    ConfigQuorum*   configQuorum;\n\n    assert(quorumProcessor != NULL);\n    if (!quorumProcessor->IsPrimary()\n     || !shardServer->GetConfigState()->isMigrating\n     || (shardServer->GetConfigState()->isMigrating &&\n         (shardServer->GetConfigState()->migrateShardID != shardID ||\n          shardServer->GetConfigState()->migrateQuorumID != quorumID)))\n    {\n        Abort();\n        return;\n    }\n    \n    \/\/ check the destination nodeID is still in the quorum\n    configState = quorumProcessor->GetShardServer()->GetConfigState();\n    configQuorum = configState->GetQuorum(quorumID);\n    if (configQuorum == NULL)\n    {\n        Abort();\n        return;\n    }\n    if (!configQuorum->IsMember(nodeID))\n    {\n        Abort();\n        return;\n    }\n\n    if (bytesSent == prevBytesSent)\n    {\n        Abort();\n        return;\n    }\n\n    prevBytesSent = bytesSent;\n    EventLoop::Add(&onTimeout);\n}\n<|endoftext|>"}
{"text":"<commit_before>int* predo(string pattern){\n    int* dp = new int[pattern.size()];\n    dp[0] = 0;\n    for(int i=1;i<pattern.size();i++){\n        dp[i] = dp[i-1];\n        while(dp[i] > 0 && pattern[dp[i]] != pattern[i])dp[i] = dp[dp[i]-1];\n        if(pattern[dp[i]] == pattern[i])dp[i]++;\n    }\n    return dp;\n}\n\nvoid KMP(string text,string pattern){\n    int* dp = predo(pattern);\n    for(int i=0,match=0;i<text.size();i++){\n        while(match > 0 && pattern[match] != text[i])match = dp[match-1];\n        if(pattern[match] == text[i])match++;\n        if(match == pattern.size()){\n            cout << i-pattern.size()+1 << endl;\n            match = dp[match-1];\n        }\n    }\n    delete [] dp;\n}\n<commit_msg>Update KMP.cpp<commit_after>\/\/ Complexity : O(T+P)\nvoid predo(string pattern,int dp[]){\n    dp[0] = 0;\n    for(int i=1;i<pattern.size();i++){\n        dp[i] = dp[i-1];\n        while(dp[i] > 0 && pattern[dp[i]] != pattern[i]) dp[i] = dp[dp[i]-1];\n        if(pattern[dp[i]] == pattern[i]) dp[i]++;\n    }\n}\n\nvoid KMP(string text,string pattern){\n    int dp[pattern.size()];predo(pattern,dp);\n    for(int i=0,match=0;i<text.size();i++){\n        while(match > 0 && pattern[match] != text[i]) match = dp[match-1];\n        if(pattern[match] == text[i]) match++;\n        if(match == pattern.size()){\n            \/\/ do something with i-pattern.size()+1\n            match = dp[match-1];\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/\/ `krbn::observer::device_observer` can be used safely in a multi-threaded environment.\n\n#include \"event_queue.hpp\"\n#include \"grabber_client.hpp\"\n#include \"iokit_utility.hpp\"\n#include \"logger.hpp\"\n#include \"types.hpp\"\n#include <pqrs\/dispatcher.hpp>\n#include <pqrs\/osx\/iokit_hid_manager.hpp>\n#include <pqrs\/osx\/iokit_hid_queue_value_monitor.hpp>\n#include <pqrs\/osx\/iokit_types.hpp>\n\nnamespace krbn {\nnamespace observer {\nclass device_observer final : public pqrs::dispatcher::extra::dispatcher_client {\npublic:\n  device_observer(const device_observer&) = delete;\n\n  device_observer(std::weak_ptr<grabber_client> grabber_client) : dispatcher_client(),\n                                                                  grabber_client_(grabber_client) {\n    \/\/ hid_manager_\n\n    std::vector<pqrs::cf::cf_ptr<CFDictionaryRef>> matching_dictionaries{\n        pqrs::osx::iokit_hid_manager::make_matching_dictionary(\n            pqrs::osx::iokit_hid_usage_page_generic_desktop,\n            pqrs::osx::iokit_hid_usage_generic_desktop_keyboard),\n\n        pqrs::osx::iokit_hid_manager::make_matching_dictionary(\n            pqrs::osx::iokit_hid_usage_page_generic_desktop,\n            pqrs::osx::iokit_hid_usage_generic_desktop_mouse),\n\n        pqrs::osx::iokit_hid_manager::make_matching_dictionary(\n            pqrs::osx::iokit_hid_usage_page_generic_desktop,\n            pqrs::osx::iokit_hid_usage_generic_desktop_pointer),\n    };\n\n    hid_manager_ = std::make_unique<pqrs::osx::iokit_hid_manager>(weak_dispatcher_,\n                                                                  matching_dictionaries,\n                                                                  std::chrono::milliseconds(3000));\n\n    hid_manager_->device_matched.connect([this](auto&& registry_entry_id, auto&& device_ptr) {\n      if (device_ptr) {\n        iokit_utility::log_matching_device(registry_entry_id, *device_ptr);\n\n        auto device_id = make_device_id(registry_entry_id);\n        auto device_name = iokit_utility::make_device_name_for_log(device_id,\n                                                                   *device_ptr);\n\n        auto hid_queue_value_monitor = std::make_shared<pqrs::osx::iokit_hid_queue_value_monitor>(weak_dispatcher_,\n                                                                                                  *device_ptr);\n        hid_queue_value_monitors_[device_id] = hid_queue_value_monitor;\n\n        if (iokit_utility::is_karabiner_virtual_hid_device(*device_ptr)) {\n          \/\/ Handle caps_lock_state_changed event only if the hid is Karabiner-VirtualHIDDevice.\n          hid_queue_value_monitor->values_arrived.connect([this, device_id](auto&& values_ptr) {\n            auto event_queue = event_queue::utility::make_queue(device_id,\n                                                                iokit_utility::make_hid_values(values_ptr));\n            for (const auto& e : event_queue->get_entries()) {\n              if (e.get_event().get_type() == event_queue::event::type::caps_lock_state_changed) {\n                if (auto client = grabber_client_.lock()) {\n                  if (auto state = e.get_event().get_integer_value()) {\n                    client->async_caps_lock_state_changed(*state);\n                  }\n                }\n              }\n            }\n          });\n        } else {\n          hid_queue_value_monitor->values_arrived.connect([this, device_id](auto&& values_ptr) {\n            auto event_queue = event_queue::utility::make_queue(device_id,\n                                                                iokit_utility::make_hid_values(values_ptr));\n            for (const auto& entry : event_queue->get_entries()) {\n              if (auto e = entry.get_event().make_key_down_up_valued_event()) {\n                if (auto client = grabber_client_.lock()) {\n                  client->async_key_down_up_valued_event_arrived(device_id,\n                                                                 *e,\n                                                                 entry.get_event_type(),\n                                                                 entry.get_event_time_stamp().get_time_stamp());\n                }\n              }\n            }\n          });\n        }\n\n        hid_queue_value_monitor->started.connect([this, device_id, device_name] {\n          logger::get_logger()->info(\"{0} is observed.\", device_name);\n\n          observed_devices_.insert(device_id);\n\n          send_observed_devices();\n        });\n\n        hid_queue_value_monitor->async_start(kIOHIDOptionsTypeNone,\n                                             std::chrono::milliseconds(3000));\n      }\n\n      async_rescan();\n    });\n\n    hid_manager_->device_terminated.connect([this](auto&& registry_entry_id) {\n      auto device_id = make_device_id(registry_entry_id);\n\n      logger::get_logger()->info(\"device_id:{0} is terminated.\", type_safe::get(device_id));\n\n      hid_queue_value_monitors_.erase(device_id);\n      observed_devices_.erase(device_id);\n\n      send_observed_devices();\n\n      async_rescan();\n    });\n\n    hid_manager_->error_occurred.connect([](auto&& message, auto&& iokit_return) {\n      logger::get_logger()->error(\"{0}: {1}\", message, iokit_return.to_string());\n    });\n  }\n\n  virtual ~device_observer(void) {\n    detach_from_dispatcher([this] {\n      hid_manager_ = nullptr;\n      hid_queue_value_monitors_.clear();\n    });\n\n    logger::get_logger()->info(\"device_observer is stopped.\");\n  }\n\n  void async_start(void) const {\n    enqueue_to_dispatcher([this] {\n      hid_manager_->async_start();\n\n      logger::get_logger()->info(\"device_observer is started.\");\n    });\n  }\n\n  void async_rescan(void) const {\n    enqueue_to_dispatcher([this] {\n      hid_manager_->async_rescan();\n\n      logger::get_logger()->info(\"rescan devices...\");\n    });\n  }\n\n  void async_send_observed_devices(void) const {\n    enqueue_to_dispatcher([this] {\n      send_observed_devices();\n    });\n  }\n\nprivate:\n  void send_observed_devices(void) const {\n    if (auto client = grabber_client_.lock()) {\n      client->async_observed_devices_updated(observed_devices_);\n    }\n  }\n\n  std::weak_ptr<grabber_client> grabber_client_;\n\n  std::unique_ptr<pqrs::osx::iokit_hid_manager> hid_manager_;\n  std::unordered_map<device_id, std::shared_ptr<pqrs::osx::iokit_hid_queue_value_monitor>> hid_queue_value_monitors_;\n  std::unordered_set<device_id> observed_devices_;\n};\n} \/\/ namespace observer\n} \/\/ namespace krbn\n<commit_msg>set device_matched_delay_ 0 @ observer<commit_after>#pragma once\n\n\/\/ `krbn::observer::device_observer` can be used safely in a multi-threaded environment.\n\n#include \"event_queue.hpp\"\n#include \"grabber_client.hpp\"\n#include \"iokit_utility.hpp\"\n#include \"logger.hpp\"\n#include \"types.hpp\"\n#include <pqrs\/dispatcher.hpp>\n#include <pqrs\/osx\/iokit_hid_manager.hpp>\n#include <pqrs\/osx\/iokit_hid_queue_value_monitor.hpp>\n#include <pqrs\/osx\/iokit_types.hpp>\n\nnamespace krbn {\nnamespace observer {\nclass device_observer final : public pqrs::dispatcher::extra::dispatcher_client {\npublic:\n  device_observer(const device_observer&) = delete;\n\n  device_observer(std::weak_ptr<grabber_client> grabber_client) : dispatcher_client(),\n                                                                  grabber_client_(grabber_client) {\n    \/\/ hid_manager_\n\n    std::vector<pqrs::cf::cf_ptr<CFDictionaryRef>> matching_dictionaries{\n        pqrs::osx::iokit_hid_manager::make_matching_dictionary(\n            pqrs::osx::iokit_hid_usage_page_generic_desktop,\n            pqrs::osx::iokit_hid_usage_generic_desktop_keyboard),\n\n        pqrs::osx::iokit_hid_manager::make_matching_dictionary(\n            pqrs::osx::iokit_hid_usage_page_generic_desktop,\n            pqrs::osx::iokit_hid_usage_generic_desktop_mouse),\n\n        pqrs::osx::iokit_hid_manager::make_matching_dictionary(\n            pqrs::osx::iokit_hid_usage_page_generic_desktop,\n            pqrs::osx::iokit_hid_usage_generic_desktop_pointer),\n    };\n\n    hid_manager_ = std::make_unique<pqrs::osx::iokit_hid_manager>(weak_dispatcher_,\n                                                                  matching_dictionaries,\n                                                                  std::chrono::milliseconds(0));\n\n    hid_manager_->device_matched.connect([this](auto&& registry_entry_id, auto&& device_ptr) {\n      if (device_ptr) {\n        iokit_utility::log_matching_device(registry_entry_id, *device_ptr);\n\n        auto device_id = make_device_id(registry_entry_id);\n        auto device_name = iokit_utility::make_device_name_for_log(device_id,\n                                                                   *device_ptr);\n\n        auto hid_queue_value_monitor = std::make_shared<pqrs::osx::iokit_hid_queue_value_monitor>(weak_dispatcher_,\n                                                                                                  *device_ptr);\n        hid_queue_value_monitors_[device_id] = hid_queue_value_monitor;\n\n        if (iokit_utility::is_karabiner_virtual_hid_device(*device_ptr)) {\n          \/\/ Handle caps_lock_state_changed event only if the hid is Karabiner-VirtualHIDDevice.\n          hid_queue_value_monitor->values_arrived.connect([this, device_id](auto&& values_ptr) {\n            auto event_queue = event_queue::utility::make_queue(device_id,\n                                                                iokit_utility::make_hid_values(values_ptr));\n            for (const auto& e : event_queue->get_entries()) {\n              if (e.get_event().get_type() == event_queue::event::type::caps_lock_state_changed) {\n                if (auto client = grabber_client_.lock()) {\n                  if (auto state = e.get_event().get_integer_value()) {\n                    client->async_caps_lock_state_changed(*state);\n                  }\n                }\n              }\n            }\n          });\n        } else {\n          hid_queue_value_monitor->values_arrived.connect([this, device_id](auto&& values_ptr) {\n            auto event_queue = event_queue::utility::make_queue(device_id,\n                                                                iokit_utility::make_hid_values(values_ptr));\n            for (const auto& entry : event_queue->get_entries()) {\n              if (auto e = entry.get_event().make_key_down_up_valued_event()) {\n                if (auto client = grabber_client_.lock()) {\n                  client->async_key_down_up_valued_event_arrived(device_id,\n                                                                 *e,\n                                                                 entry.get_event_type(),\n                                                                 entry.get_event_time_stamp().get_time_stamp());\n                }\n              }\n            }\n          });\n        }\n\n        hid_queue_value_monitor->started.connect([this, device_id, device_name] {\n          logger::get_logger()->info(\"{0} is observed.\", device_name);\n\n          observed_devices_.insert(device_id);\n\n          send_observed_devices();\n        });\n\n        hid_queue_value_monitor->async_start(kIOHIDOptionsTypeNone,\n                                             std::chrono::milliseconds(3000));\n      }\n\n      async_rescan();\n    });\n\n    hid_manager_->device_terminated.connect([this](auto&& registry_entry_id) {\n      auto device_id = make_device_id(registry_entry_id);\n\n      logger::get_logger()->info(\"device_id:{0} is terminated.\", type_safe::get(device_id));\n\n      hid_queue_value_monitors_.erase(device_id);\n      observed_devices_.erase(device_id);\n\n      send_observed_devices();\n\n      async_rescan();\n    });\n\n    hid_manager_->error_occurred.connect([](auto&& message, auto&& iokit_return) {\n      logger::get_logger()->error(\"{0}: {1}\", message, iokit_return.to_string());\n    });\n  }\n\n  virtual ~device_observer(void) {\n    detach_from_dispatcher([this] {\n      hid_manager_ = nullptr;\n      hid_queue_value_monitors_.clear();\n    });\n\n    logger::get_logger()->info(\"device_observer is stopped.\");\n  }\n\n  void async_start(void) const {\n    enqueue_to_dispatcher([this] {\n      hid_manager_->async_start();\n\n      logger::get_logger()->info(\"device_observer is started.\");\n    });\n  }\n\n  void async_rescan(void) const {\n    enqueue_to_dispatcher([this] {\n      hid_manager_->async_rescan();\n\n      logger::get_logger()->info(\"rescan devices...\");\n    });\n  }\n\n  void async_send_observed_devices(void) const {\n    enqueue_to_dispatcher([this] {\n      send_observed_devices();\n    });\n  }\n\nprivate:\n  void send_observed_devices(void) const {\n    if (auto client = grabber_client_.lock()) {\n      client->async_observed_devices_updated(observed_devices_);\n    }\n  }\n\n  std::weak_ptr<grabber_client> grabber_client_;\n\n  std::unique_ptr<pqrs::osx::iokit_hid_manager> hid_manager_;\n  std::unordered_map<device_id, std::shared_ptr<pqrs::osx::iokit_hid_queue_value_monitor>> hid_queue_value_monitors_;\n  std::unordered_set<device_id> observed_devices_;\n};\n} \/\/ namespace observer\n} \/\/ namespace krbn\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2007-2013  CEA\/DEN, EDF R&D, OPEN CASCADE\n\/\/\n\/\/ Copyright (C) 2003-2007  OPEN CASCADE, EADS\/CCR, LIP6, CEA\/DEN,\n\/\/ CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS\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., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\/\/\n\/\/ See http:\/\/www.salome-platform.org\/ or email : webmaster.salome@opencascade.com\n\/\/\n\n\/\/  GEOM GEOMGUI : GUI for Geometry component\n\/\/  File   : OperationGUI_ExtrudedFeatureDlg.cxx\n\/\/  Author : Renaud NEDELEC, Open CASCADE S.A.S.\n\n#include \"OperationGUI.h\"\n#include \"OperationGUI_ExtrudedFeatureDlg.h\"\n\n#include <SUIT_Session.h>\n#include <SUIT_ResourceMgr.h>\n#include <SalomeApp_Application.h>\n#include <LightApp_SelectionMgr.h>\n\n#include <GeometryGUI.h>\n#include <GEOMBase.h>\n\n#include <DlgRef.h>\n#include <GEOM_Object.hxx>\n\n\/\/ OCCT Includes\n#include <TColStd_HSequenceOfTransient.hxx>\n\n#include <GEOMImpl_Types.hxx>\n\n\/\/=================================================================================\n\/\/ class    : OperationGUI_ExtrudedFeatureDlg()\n\/\/ purpose  : Constructs a OperationGUI_ExtrudedCutDlg which is a child of 'parent',\n\/\/            with the name 'name' and widget flags set to 'f'.\n\/\/            The dialog will by default be modeless, unless you set 'modal' to\n\/\/            TRUE to construct a modal dialog.\n\/\/=================================================================================\n\nOperationGUI_ExtrudedFeatureDlg::OperationGUI_ExtrudedFeatureDlg(const int theOperation,\n                                                                 GeometryGUI* theGeometryGUI,\n                                                                 QWidget* parent,bool modal, \n                                                                 Qt::WindowFlags fl)\n  : GEOMBase_Skeleton(theGeometryGUI, parent, modal, fl),\n    myOperation(theOperation)\n{\n  SUIT_ResourceMgr* aResMgr = SUIT_Session::session()->resourceMgr();\n  QPixmap image0;\n  QPixmap image1 (aResMgr->loadPixmap(\"GEOM\", tr(\"ICON_SELECT\")));\n  QPixmap image2 (aResMgr->loadPixmap(\"GEOM\", tr(\"ICO_DRAFT\")));\n  QPixmap image3 (aResMgr->loadPixmap(\"GEOM\", tr(\"ICON_DLG_CHANGE_DIRECTION\")));\n  QString aTitle;\n  switch (myOperation) \n  {\n    case OperationGUI::BOSS:\n      image0 = QPixmap(aResMgr->loadPixmap(\"GEOM\", tr(\"ICO_EXTRUDED_BOSS\")));\n      aTitle = tr(\"GEOM_EXTRUDED_BOSS_TITLE\");\n      setHelpFileName(\"extruded_boss_operation_page.html\");\n      break;\n    case OperationGUI::CUT:\n      image0 = QPixmap( aResMgr->loadPixmap(\"GEOM\", tr(\"ICO_EXTRUDED_CUT\")));\n      aTitle = tr(\"GEOM_EXTRUDED_CUT_TITLE\");\n      setHelpFileName(\"extruded_cut_operation_page.html\");\n      break;\n  }\n    \n  setWindowTitle(aTitle);\n  mainFrame()->GroupConstructors->setTitle(aTitle);\n  mainFrame()->RadioButton1->setIcon(image0);\n  mainFrame()->RadioButton2->setAttribute(Qt::WA_DeleteOnClose);\n  mainFrame()->RadioButton2->close();\n  mainFrame()->RadioButton3->setAttribute(Qt::WA_DeleteOnClose);\n  mainFrame()->RadioButton3->close();\n  \n  mainFrame()->RadioButton1->setChecked(true);\n  \n  myGroup = new DlgRef_2Sel2Spin2Push(centralWidget());\n  \n  myGroup->GroupBox1->setTitle(tr(\"GEOM_ARGUMENTS\"));\n  \n  myGroup->PushButton1->setIcon(image1);\n  myGroup->PushButton2->setIcon(image1);\n  myGroup->PushButton3->setIcon(image2);\n  myGroup->PushButton4->setIcon(image3);\n  myGroup->LineEdit1->setReadOnly(true);\n  myGroup->LineEdit2->setReadOnly(true);\n  myGroup->TextLabel1->setText(tr(\"GEOM_INIT_SHAPE\"));\n  myGroup->TextLabel2->setText(tr(\"GEOM_PROFILE\"));\n  myGroup->TextLabel3->setText(tr(\"GEOM_HEIGHT\"));\n  myGroup->TextLabel4->setText(tr(\"GEOM_DRAFT_ANGLE\"));\n  myGroup->TextLabel5->setText(tr(\"GEOM_CHANGE_DIRECTION\"));\n \n  \n  QVBoxLayout* layout = new QVBoxLayout(centralWidget());\n  layout->setMargin(0); \n  layout->setSpacing(6);\n  layout->addWidget(myGroup);\n\n  Init();\n   \n}\n\n\/\/=================================================================================\n\/\/ function : ~OperationGUI_ExtrudedFeatureDlg()\n\/\/ purpose  : Destroys the object and frees any allocated resources\n\/\/=================================================================================\nOperationGUI_ExtrudedFeatureDlg::~OperationGUI_ExtrudedFeatureDlg()\n{\n}\n\n\/\/=================================================================================\n\/\/ function : Init()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::Init()\n{\n  \/\/ init variables\n  myEditCurrentArgument = myGroup->LineEdit1;\n  \n  \/\/ Get setting of step value from file configuration\n  SUIT_ResourceMgr* resMgr = SUIT_Session::session()->resourceMgr();\n  double step = resMgr->doubleValue(\"Geometry\", \"SettingsGeomStep\", 100);\n  \n  initSpinBox(myGroup->SpinBox_DX, COORD_MIN, COORD_MAX, step, \"length_precision\" );\n  initSpinBox(myGroup->SpinBox_DY, COORD_MIN, COORD_MAX, step, \"length_precision\" );\n\n  myGroup->LineEdit1->setText(\"\");\n  myGroup->LineEdit2->setText(\"\");\n  myGroup->SpinBox_DX->setValue(10.0);\n  myGroup->SpinBox_DY->setValue(10.0);\n  myGroup->SpinBox_DY->setEnabled(false);\n  myObject1.nullify();\n  myObject2.nullify();\n  \n  \/\/ signals and slots connections\n  connect(buttonOk(),    SIGNAL(clicked()), this, SLOT(ClickOnOk()));\n  connect(buttonApply(), SIGNAL(clicked()), this, SLOT(ClickOnApply()));\n\n  connect(myGroup->PushButton1, SIGNAL(clicked()),     this, SLOT(SetEditCurrentArgument()));\n  connect(myGroup->PushButton2, SIGNAL(clicked()),     this, SLOT(SetEditCurrentArgument()));\n  connect(myGroup->PushButton3, SIGNAL(clicked(bool)), this, SLOT(ButtonClicked(bool)));\n  connect(myGroup->PushButton4, SIGNAL(clicked(bool)), this, SLOT(ButtonClicked(bool)));\n  connect(myGroup->SpinBox_DX,  SIGNAL(valueChanged(double)), this, SLOT(ValueChangedInSpinBox()));\n  connect(myGroup->SpinBox_DY,  SIGNAL(valueChanged(double)), this, SLOT(ValueChangedInSpinBox()));\n  \n\n  connect(((SalomeApp_Application*)(SUIT_Session::session()->activeApplication()))->selectionMgr(),\n           SIGNAL(currentSelectionChanged()), this, SLOT(SelectionIntoArgument()));\n  \n  switch (myOperation) \n  {\n    case OperationGUI::BOSS:\n      initName(tr(\"GEOM_EXTRUDED_BOSS\"));     \n      break;\n    case OperationGUI::CUT:\n      initName(tr(\"GEOM_EXTRUDED_CUT\"));  \n      break;\n  }\n  \n  mainFrame()->RadioButton1->setFocus();\n  \n  globalSelection(GEOM_ALLSHAPES);\n  \n  myGroup->PushButton1->click();\n  SelectionIntoArgument();\n  \n  resize(minimumSizeHint());\n}\n\n\/\/=================================================================================\n\/\/ function : ClickOnOk()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::ClickOnOk()\n{\n  setIsApplyAndClose( true );\n  if (ClickOnApply())\n    ClickOnCancel();\n}\n\n\/\/=================================================================================\n\/\/ function : ClickOnApply()\n\/\/ purpose  :\n\/\/=================================================================================\nbool OperationGUI_ExtrudedFeatureDlg::ClickOnApply()\n{\n  if (!onAccept())\n    return false;\n\n  initName();\n  \/\/ activate selection and connect selection manager\n  myGroup->PushButton1->click();\n  return true;\n}\n\n\/\/=================================================================================\n\/\/ function : SetEditCurrentArgument()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::SetEditCurrentArgument()\n{\n  QPushButton* send = (QPushButton*)sender();\n  \n  if (send == myGroup->PushButton1) {\n    myEditCurrentArgument = myGroup->LineEdit1;\n\n    myGroup->PushButton2->setDown(false);\n    myGroup->LineEdit2->setEnabled(false);\n  }\n  else if (send == myGroup->PushButton2) {\n    myEditCurrentArgument = myGroup->LineEdit2;\n\n    myGroup->PushButton1->setDown(false);\n    myGroup->LineEdit1->setEnabled(false);\n  }\n  \n  \/\/ enable line edit\n  myEditCurrentArgument->setEnabled(true);\n  myEditCurrentArgument->setFocus();\n  \/\/ after setFocus(), because it will be setDown(false) when loses focus\n  send->setDown(true);\n}\n\n\n\/\/=================================================================================\n\/\/ function : SelectionIntoArgument()\n\/\/ purpose  : Called when selection is changed or on dialog initialization or activation\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::SelectionIntoArgument()\n{\n  myEditCurrentArgument->setText(\"\");\n\n  QList<TopAbs_ShapeEnum> types;\n  types<<TopAbs_SHAPE;\n  \n  if (myEditCurrentArgument == myGroup->LineEdit1)\n  {\n    types.clear();\n    types<<TopAbs_COMPOUND<<TopAbs_SOLID;\n  }\n  if (myEditCurrentArgument == myGroup->LineEdit2)\n  {\n    types.clear();\n    types << TopAbs_EDGE << TopAbs_WIRE << TopAbs_FACE;\n  }\n\n  GEOM::GeomObjPtr aSelectedObject = getSelected( types );\n  TopoDS_Shape aShape;\n  if ( aSelectedObject && GEOMBase::GetShape( aSelectedObject.get(), aShape ) && !aShape.IsNull() ) {\n    QString aName = GEOMBase::GetName( aSelectedObject.get() );\n    myEditCurrentArgument->setText( aName );\n\n    \/\/ clear selection\n    disconnect(myGeomGUI->getApp()->selectionMgr(), 0, this, 0);\n    myGeomGUI->getApp()->selectionMgr()->clearSelected();\n    connect(myGeomGUI->getApp()->selectionMgr(), SIGNAL(currentSelectionChanged()),\n            this, SLOT(SelectionIntoArgument()));\n\n    if (myEditCurrentArgument == myGroup->LineEdit1) {\n      myObject1 = aSelectedObject;\n      if (!myObject2)\n        myGroup->PushButton2->click();\n    }\n    else if (myEditCurrentArgument == myGroup->LineEdit2) {\n      myObject2 = aSelectedObject;\n      if (!myObject1)\n        myGroup->PushButton1->click();\n    }\n    \n    displayPreview(true);\n  }\n  else {\n    if      (myEditCurrentArgument == myGroup->LineEdit1) myObject1.nullify();\n    else if (myEditCurrentArgument == myGroup->LineEdit2) myObject2.nullify();\n  }\n}\n\n\/\/=================================================================================\n\/\/ function : ActivateThisDialog()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::ActivateThisDialog()\n{\n  GEOMBase_Skeleton::ActivateThisDialog();\n\n  connect( myGeomGUI->getApp()->selectionMgr(), SIGNAL( currentSelectionChanged() ),\n           this, SLOT( SelectionIntoArgument() ) );\n  processPreview();\n}\n\n\n\/\/=================================================================================\n\/\/ function : enterEvent()\n\/\/ purpose  : when mouse enter onto the QWidget\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::enterEvent (QEvent*)\n{\n  if (!mainFrame()->GroupConstructors->isEnabled())\n    ActivateThisDialog();\n}\n\n\/\/=================================================================================\n\/\/ function : ValueChangedInSpinBox()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::ValueChangedInSpinBox()\n{\n  displayPreview(true);\n}\n\n\/\/=================================================================================\n\/\/ function : ButtonClicked(bool checked)\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::ButtonClicked(bool checked)\n{\n  QPushButton* send = (QPushButton*)sender();\n  if (send == myGroup->PushButton3)\n    myGroup->SpinBox_DY->setEnabled(checked);\n \n  displayPreview(true);\n}\n\n\/\/=================================================================================\n\/\/ function : createOperation\n\/\/ purpose  :\n\/\/=================================================================================\nGEOM::GEOM_IOperations_ptr OperationGUI_ExtrudedFeatureDlg::createOperation()\n{\n  return getGeomEngine()->GetI3DPrimOperations(getStudyId());\n}\n\n\/\/=================================================================================\n\/\/ function : isValid\n\/\/ purpose  :\n\/\/=================================================================================\nbool OperationGUI_ExtrudedFeatureDlg::isValid (QString&)\n{\n  return myObject1 && myObject2; \n}\n\n\/\/=================================================================================\n\/\/ function : execute\n\/\/ purpose  :\n\/\/=================================================================================\nbool OperationGUI_ExtrudedFeatureDlg::execute (ObjectList& objects)\n{\n  GEOM::GEOM_I3DPrimOperations_var anOper = GEOM::GEOM_I3DPrimOperations::_narrow(getOperation());\n  \n  double angle=0.0;\n  double aHeight = myGroup->SpinBox_DX->value();\n  \n  if (myGroup->PushButton3->isChecked())\n    angle=myGroup->SpinBox_DY->value();\n  \n  if (myGroup->PushButton4->isChecked())\n  {\n    aHeight = -aHeight;\n    angle   = -angle;\n  }\n    \n  bool isProtrusion = (myOperation == OperationGUI::BOSS);  \n  \n  \/\/ Hide the initial shape in order to see the modifications on the preview\n  erase(myObject1.get(),false); \n  \n  GEOM::GEOM_Object_var anObj = anOper->MakeDraftPrism(myObject1.get(), myObject2.get(), \n                                                       aHeight,\n                                                       angle,\n                                                       isProtrusion);\n  if (!anObj->_is_nil())\n    objects.push_back(anObj._retn());\n\n  return true;\n}\n\n\/\/ \/\/=================================================================================\n\/\/ \/\/ function : addSubshapeToStudy\n\/\/ \/\/ purpose  : virtual method to add new SubObjects if local selection\n\/\/ \/\/=================================================================================\n\/\/ void OperationGUI_ExtrudedFeatureDlg::addSubshapesToStudy()\n\/\/ {\n\/\/   GEOMBase::PublishSubObject( myObject2.get() );\n\/\/ }\n<commit_msg>GEOM porting to CMake<commit_after>\/\/ Copyright (C) 2007-2013  CEA\/DEN, EDF R&D, OPEN CASCADE\n\/\/\n\/\/ Copyright (C) 2003-2007  OPEN CASCADE, EADS\/CCR, LIP6, CEA\/DEN,\n\/\/ CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS\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., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\/\/\n\/\/ See http:\/\/www.salome-platform.org\/ or email : webmaster.salome@opencascade.com\n\/\/\n\n\/\/  GEOM GEOMGUI : GUI for Geometry component\n\/\/  File   : OperationGUI_ExtrudedFeatureDlg.cxx\n\/\/  Author : Renaud NEDELEC, Open CASCADE S.A.S.\n\n#include \"OperationGUI.h\"\n#include \"OperationGUI_ExtrudedFeatureDlg.h\"\n\n#include <SUIT_Session.h>\n#include <SUIT_ResourceMgr.h>\n#include <SalomeApp_Application.h>\n#include <LightApp_SelectionMgr.h>\n\n#include <GeometryGUI.h>\n#include <GEOMBase.h>\n\n#include <DlgRef.h>\n\n\/\/ OCCT Includes\n#include <TColStd_HSequenceOfTransient.hxx>\n\n#include <GEOMImpl_Types.hxx>\n\n\/\/=================================================================================\n\/\/ class    : OperationGUI_ExtrudedFeatureDlg()\n\/\/ purpose  : Constructs a OperationGUI_ExtrudedCutDlg which is a child of 'parent',\n\/\/            with the name 'name' and widget flags set to 'f'.\n\/\/            The dialog will by default be modeless, unless you set 'modal' to\n\/\/            TRUE to construct a modal dialog.\n\/\/=================================================================================\n\nOperationGUI_ExtrudedFeatureDlg::OperationGUI_ExtrudedFeatureDlg(const int theOperation,\n                                                                 GeometryGUI* theGeometryGUI,\n                                                                 QWidget* parent,bool modal, \n                                                                 Qt::WindowFlags fl)\n  : GEOMBase_Skeleton(theGeometryGUI, parent, modal, fl),\n    myOperation(theOperation)\n{\n  SUIT_ResourceMgr* aResMgr = SUIT_Session::session()->resourceMgr();\n  QPixmap image0;\n  QPixmap image1 (aResMgr->loadPixmap(\"GEOM\", tr(\"ICON_SELECT\")));\n  QPixmap image2 (aResMgr->loadPixmap(\"GEOM\", tr(\"ICO_DRAFT\")));\n  QPixmap image3 (aResMgr->loadPixmap(\"GEOM\", tr(\"ICON_DLG_CHANGE_DIRECTION\")));\n  QString aTitle;\n  switch (myOperation) \n  {\n    case OperationGUI::BOSS:\n      image0 = QPixmap(aResMgr->loadPixmap(\"GEOM\", tr(\"ICO_EXTRUDED_BOSS\")));\n      aTitle = tr(\"GEOM_EXTRUDED_BOSS_TITLE\");\n      setHelpFileName(\"extruded_boss_operation_page.html\");\n      break;\n    case OperationGUI::CUT:\n      image0 = QPixmap( aResMgr->loadPixmap(\"GEOM\", tr(\"ICO_EXTRUDED_CUT\")));\n      aTitle = tr(\"GEOM_EXTRUDED_CUT_TITLE\");\n      setHelpFileName(\"extruded_cut_operation_page.html\");\n      break;\n  }\n    \n  setWindowTitle(aTitle);\n  mainFrame()->GroupConstructors->setTitle(aTitle);\n  mainFrame()->RadioButton1->setIcon(image0);\n  mainFrame()->RadioButton2->setAttribute(Qt::WA_DeleteOnClose);\n  mainFrame()->RadioButton2->close();\n  mainFrame()->RadioButton3->setAttribute(Qt::WA_DeleteOnClose);\n  mainFrame()->RadioButton3->close();\n  \n  mainFrame()->RadioButton1->setChecked(true);\n  \n  myGroup = new DlgRef_2Sel2Spin2Push(centralWidget());\n  \n  myGroup->GroupBox1->setTitle(tr(\"GEOM_ARGUMENTS\"));\n  \n  myGroup->PushButton1->setIcon(image1);\n  myGroup->PushButton2->setIcon(image1);\n  myGroup->PushButton3->setIcon(image2);\n  myGroup->PushButton4->setIcon(image3);\n  myGroup->LineEdit1->setReadOnly(true);\n  myGroup->LineEdit2->setReadOnly(true);\n  myGroup->TextLabel1->setText(tr(\"GEOM_INIT_SHAPE\"));\n  myGroup->TextLabel2->setText(tr(\"GEOM_PROFILE\"));\n  myGroup->TextLabel3->setText(tr(\"GEOM_HEIGHT\"));\n  myGroup->TextLabel4->setText(tr(\"GEOM_DRAFT_ANGLE\"));\n  myGroup->TextLabel5->setText(tr(\"GEOM_CHANGE_DIRECTION\"));\n \n  \n  QVBoxLayout* layout = new QVBoxLayout(centralWidget());\n  layout->setMargin(0); \n  layout->setSpacing(6);\n  layout->addWidget(myGroup);\n\n  Init();\n   \n}\n\n\/\/=================================================================================\n\/\/ function : ~OperationGUI_ExtrudedFeatureDlg()\n\/\/ purpose  : Destroys the object and frees any allocated resources\n\/\/=================================================================================\nOperationGUI_ExtrudedFeatureDlg::~OperationGUI_ExtrudedFeatureDlg()\n{\n}\n\n\/\/=================================================================================\n\/\/ function : Init()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::Init()\n{\n  \/\/ init variables\n  myEditCurrentArgument = myGroup->LineEdit1;\n  \n  \/\/ Get setting of step value from file configuration\n  SUIT_ResourceMgr* resMgr = SUIT_Session::session()->resourceMgr();\n  double step = resMgr->doubleValue(\"Geometry\", \"SettingsGeomStep\", 100);\n  \n  initSpinBox(myGroup->SpinBox_DX, COORD_MIN, COORD_MAX, step, \"length_precision\" );\n  initSpinBox(myGroup->SpinBox_DY, COORD_MIN, COORD_MAX, step, \"length_precision\" );\n\n  myGroup->LineEdit1->setText(\"\");\n  myGroup->LineEdit2->setText(\"\");\n  myGroup->SpinBox_DX->setValue(10.0);\n  myGroup->SpinBox_DY->setValue(10.0);\n  myGroup->SpinBox_DY->setEnabled(false);\n  myObject1.nullify();\n  myObject2.nullify();\n  \n  \/\/ signals and slots connections\n  connect(buttonOk(),    SIGNAL(clicked()), this, SLOT(ClickOnOk()));\n  connect(buttonApply(), SIGNAL(clicked()), this, SLOT(ClickOnApply()));\n\n  connect(myGroup->PushButton1, SIGNAL(clicked()),     this, SLOT(SetEditCurrentArgument()));\n  connect(myGroup->PushButton2, SIGNAL(clicked()),     this, SLOT(SetEditCurrentArgument()));\n  connect(myGroup->PushButton3, SIGNAL(clicked(bool)), this, SLOT(ButtonClicked(bool)));\n  connect(myGroup->PushButton4, SIGNAL(clicked(bool)), this, SLOT(ButtonClicked(bool)));\n  connect(myGroup->SpinBox_DX,  SIGNAL(valueChanged(double)), this, SLOT(ValueChangedInSpinBox()));\n  connect(myGroup->SpinBox_DY,  SIGNAL(valueChanged(double)), this, SLOT(ValueChangedInSpinBox()));\n  \n\n  connect(((SalomeApp_Application*)(SUIT_Session::session()->activeApplication()))->selectionMgr(),\n           SIGNAL(currentSelectionChanged()), this, SLOT(SelectionIntoArgument()));\n  \n  switch (myOperation) \n  {\n    case OperationGUI::BOSS:\n      initName(tr(\"GEOM_EXTRUDED_BOSS\"));     \n      break;\n    case OperationGUI::CUT:\n      initName(tr(\"GEOM_EXTRUDED_CUT\"));  \n      break;\n  }\n  \n  mainFrame()->RadioButton1->setFocus();\n  \n  globalSelection(GEOM_ALLSHAPES);\n  \n  myGroup->PushButton1->click();\n  SelectionIntoArgument();\n  \n  resize(minimumSizeHint());\n}\n\n\/\/=================================================================================\n\/\/ function : ClickOnOk()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::ClickOnOk()\n{\n  setIsApplyAndClose( true );\n  if (ClickOnApply())\n    ClickOnCancel();\n}\n\n\/\/=================================================================================\n\/\/ function : ClickOnApply()\n\/\/ purpose  :\n\/\/=================================================================================\nbool OperationGUI_ExtrudedFeatureDlg::ClickOnApply()\n{\n  if (!onAccept())\n    return false;\n\n  initName();\n  \/\/ activate selection and connect selection manager\n  myGroup->PushButton1->click();\n  return true;\n}\n\n\/\/=================================================================================\n\/\/ function : SetEditCurrentArgument()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::SetEditCurrentArgument()\n{\n  QPushButton* send = (QPushButton*)sender();\n  \n  if (send == myGroup->PushButton1) {\n    myEditCurrentArgument = myGroup->LineEdit1;\n\n    myGroup->PushButton2->setDown(false);\n    myGroup->LineEdit2->setEnabled(false);\n  }\n  else if (send == myGroup->PushButton2) {\n    myEditCurrentArgument = myGroup->LineEdit2;\n\n    myGroup->PushButton1->setDown(false);\n    myGroup->LineEdit1->setEnabled(false);\n  }\n  \n  \/\/ enable line edit\n  myEditCurrentArgument->setEnabled(true);\n  myEditCurrentArgument->setFocus();\n  \/\/ after setFocus(), because it will be setDown(false) when loses focus\n  send->setDown(true);\n}\n\n\n\/\/=================================================================================\n\/\/ function : SelectionIntoArgument()\n\/\/ purpose  : Called when selection is changed or on dialog initialization or activation\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::SelectionIntoArgument()\n{\n  myEditCurrentArgument->setText(\"\");\n\n  QList<TopAbs_ShapeEnum> types;\n  types<<TopAbs_SHAPE;\n  \n  if (myEditCurrentArgument == myGroup->LineEdit1)\n  {\n    types.clear();\n    types<<TopAbs_COMPOUND<<TopAbs_SOLID;\n  }\n  if (myEditCurrentArgument == myGroup->LineEdit2)\n  {\n    types.clear();\n    types << TopAbs_EDGE << TopAbs_WIRE << TopAbs_FACE;\n  }\n\n  GEOM::GeomObjPtr aSelectedObject = getSelected( types );\n  TopoDS_Shape aShape;\n  if ( aSelectedObject && GEOMBase::GetShape( aSelectedObject.get(), aShape ) && !aShape.IsNull() ) {\n    QString aName = GEOMBase::GetName( aSelectedObject.get() );\n    myEditCurrentArgument->setText( aName );\n\n    \/\/ clear selection\n    disconnect(myGeomGUI->getApp()->selectionMgr(), 0, this, 0);\n    myGeomGUI->getApp()->selectionMgr()->clearSelected();\n    connect(myGeomGUI->getApp()->selectionMgr(), SIGNAL(currentSelectionChanged()),\n            this, SLOT(SelectionIntoArgument()));\n\n    if (myEditCurrentArgument == myGroup->LineEdit1) {\n      myObject1 = aSelectedObject;\n      if (!myObject2)\n        myGroup->PushButton2->click();\n    }\n    else if (myEditCurrentArgument == myGroup->LineEdit2) {\n      myObject2 = aSelectedObject;\n      if (!myObject1)\n        myGroup->PushButton1->click();\n    }\n    \n    displayPreview(true);\n  }\n  else {\n    if      (myEditCurrentArgument == myGroup->LineEdit1) myObject1.nullify();\n    else if (myEditCurrentArgument == myGroup->LineEdit2) myObject2.nullify();\n  }\n}\n\n\/\/=================================================================================\n\/\/ function : ActivateThisDialog()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::ActivateThisDialog()\n{\n  GEOMBase_Skeleton::ActivateThisDialog();\n\n  connect( myGeomGUI->getApp()->selectionMgr(), SIGNAL( currentSelectionChanged() ),\n           this, SLOT( SelectionIntoArgument() ) );\n  processPreview();\n}\n\n\n\/\/=================================================================================\n\/\/ function : enterEvent()\n\/\/ purpose  : when mouse enter onto the QWidget\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::enterEvent (QEvent*)\n{\n  if (!mainFrame()->GroupConstructors->isEnabled())\n    ActivateThisDialog();\n}\n\n\/\/=================================================================================\n\/\/ function : ValueChangedInSpinBox()\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::ValueChangedInSpinBox()\n{\n  displayPreview(true);\n}\n\n\/\/=================================================================================\n\/\/ function : ButtonClicked(bool checked)\n\/\/ purpose  :\n\/\/=================================================================================\nvoid OperationGUI_ExtrudedFeatureDlg::ButtonClicked(bool checked)\n{\n  QPushButton* send = (QPushButton*)sender();\n  if (send == myGroup->PushButton3)\n    myGroup->SpinBox_DY->setEnabled(checked);\n \n  displayPreview(true);\n}\n\n\/\/=================================================================================\n\/\/ function : createOperation\n\/\/ purpose  :\n\/\/=================================================================================\nGEOM::GEOM_IOperations_ptr OperationGUI_ExtrudedFeatureDlg::createOperation()\n{\n  return getGeomEngine()->GetI3DPrimOperations(getStudyId());\n}\n\n\/\/=================================================================================\n\/\/ function : isValid\n\/\/ purpose  :\n\/\/=================================================================================\nbool OperationGUI_ExtrudedFeatureDlg::isValid (QString&)\n{\n  return myObject1 && myObject2; \n}\n\n\/\/=================================================================================\n\/\/ function : execute\n\/\/ purpose  :\n\/\/=================================================================================\nbool OperationGUI_ExtrudedFeatureDlg::execute (ObjectList& objects)\n{\n  GEOM::GEOM_I3DPrimOperations_var anOper = GEOM::GEOM_I3DPrimOperations::_narrow(getOperation());\n  \n  double angle=0.0;\n  double aHeight = myGroup->SpinBox_DX->value();\n  \n  if (myGroup->PushButton3->isChecked())\n    angle=myGroup->SpinBox_DY->value();\n  \n  if (myGroup->PushButton4->isChecked())\n  {\n    aHeight = -aHeight;\n    angle   = -angle;\n  }\n    \n  bool isProtrusion = (myOperation == OperationGUI::BOSS);  \n  \n  \/\/ Hide the initial shape in order to see the modifications on the preview\n  erase(myObject1.get(),false); \n  \n  GEOM::GEOM_Object_var anObj = anOper->MakeDraftPrism(myObject1.get(), myObject2.get(), \n                                                       aHeight,\n                                                       angle,\n                                                       isProtrusion);\n  if (!anObj->_is_nil())\n    objects.push_back(anObj._retn());\n\n  return true;\n}\n\n\/\/ \/\/=================================================================================\n\/\/ \/\/ function : addSubshapeToStudy\n\/\/ \/\/ purpose  : virtual method to add new SubObjects if local selection\n\/\/ \/\/=================================================================================\n\/\/ void OperationGUI_ExtrudedFeatureDlg::addSubshapesToStudy()\n\/\/ {\n\/\/   GEOMBase::PublishSubObject( myObject2.get() );\n\/\/ }\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#include \"gm.h\"\n\n#include \"SkColorPriv.h\"\n#include \"SkShader.h\"\n\nnamespace skiagm {\n\nclass BigMatrixGM : public GM {\npublic:\n    BigMatrixGM() {\n        this->setBGColor(0xFF66AA99);\n    }\n\nprotected:\n    virtual SkString onShortName() {\n        return SkString(\"bigmatrix\");\n    }\n\n    virtual SkISize onISize() {\n        return make_isize(50, 50);\n    }\n\n    virtual void onDraw(SkCanvas* canvas) {\n        SkMatrix m;\n        m.reset();\n        m.setRotate(33 * SK_Scalar1);\n        m.postScale(3000 * SK_Scalar1, 3000 * SK_Scalar1);\n        m.postTranslate(6000 * SK_Scalar1, -5000 * SK_Scalar1);\n        canvas->concat(m);\n\n        SkPaint paint;\n        paint.setColor(SK_ColorRED);\n        paint.setAntiAlias(true);\n\n        m.invert(&m);\n\n        SkPath path;\n\n        SkPoint pt = {10 * SK_Scalar1, 10 * SK_Scalar1};\n        SkScalar small = 1 \/ (500 * SK_Scalar1);\n\n        m.mapPoints(&pt, 1);\n        path.addCircle(pt.fX, pt.fY, small);\n        canvas->drawPath(path, paint);\n\n        pt.set(30 * SK_Scalar1, 10 * SK_Scalar1);\n        m.mapPoints(&pt, 1);\n        SkRect rect = {pt.fX - small, pt.fY - small,\n                       pt.fX + small, pt.fY + small};\n        canvas->drawRect(rect, paint);\n\n        SkBitmap bmp;\n        bmp.setConfig(SkBitmap::kARGB_8888_Config, 2, 2);\n        bmp.allocPixels();\n        bmp.lockPixels();\n        uint32_t* pixels = reinterpret_cast<uint32_t*>(bmp.getPixels());\n        pixels[0] = SkPackARGB32(0xFF, 0xFF, 0x00, 0x00);\n        pixels[1] = SkPackARGB32(0xFF, 0x00, 0xFF, 0x00);\n        pixels[2] = SkPackARGB32(0x80, 0x00, 0x00, 0x00);\n        pixels[3] = SkPackARGB32(0xFF, 0x00, 0x00, 0xFF);\n        bmp.unlockPixels();\n        pt.set(30 * SK_Scalar1, 30 * SK_Scalar1);\n        m.mapPoints(&pt, 1);\n        SkShader* shader = SkShader::CreateBitmapShader(\n                                            bmp,\n                                            SkShader::kRepeat_TileMode,\n                                            SkShader::kRepeat_TileMode);\n        SkMatrix s;\n        s.reset();\n        s.setScale(SK_Scalar1 \/ 1000, SK_Scalar1 \/ 1000);\n        shader->setLocalMatrix(s);\n        paint.setShader(shader)->unref();\n        paint.setAntiAlias(false);\n        paint.setFilterBitmap(true);\n        rect.setLTRB(pt.fX - small, pt.fY - small,\n                     pt.fX + small, pt.fY + small);\n        canvas->drawRect(rect, paint);\n    }\n\nprivate:\n    typedef GM INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic GM* MyFactory(void*) { return new BigMatrixGM; }\nstatic GMRegistry reg(MyFactory);\n\n}\n\n<commit_msg>silence warning<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#include \"gm.h\"\n\n#include \"SkColorPriv.h\"\n#include \"SkShader.h\"\n\nnamespace skiagm {\n\nclass BigMatrixGM : public GM {\npublic:\n    BigMatrixGM() {\n        this->setBGColor(0xFF66AA99);\n    }\n\nprotected:\n    virtual SkString onShortName() {\n        return SkString(\"bigmatrix\");\n    }\n\n    virtual SkISize onISize() {\n        return make_isize(50, 50);\n    }\n\n    virtual void onDraw(SkCanvas* canvas) {\n        SkMatrix m;\n        m.reset();\n        m.setRotate(33 * SK_Scalar1);\n        m.postScale(3000 * SK_Scalar1, 3000 * SK_Scalar1);\n        m.postTranslate(6000 * SK_Scalar1, -5000 * SK_Scalar1);\n        canvas->concat(m);\n\n        SkPaint paint;\n        paint.setColor(SK_ColorRED);\n        paint.setAntiAlias(true);\n\n        bool success = m.invert(&m);\n\n        SkPath path;\n\n        SkPoint pt = {10 * SK_Scalar1, 10 * SK_Scalar1};\n        SkScalar small = 1 \/ (500 * SK_Scalar1);\n\n        m.mapPoints(&pt, 1);\n        path.addCircle(pt.fX, pt.fY, small);\n        canvas->drawPath(path, paint);\n\n        pt.set(30 * SK_Scalar1, 10 * SK_Scalar1);\n        m.mapPoints(&pt, 1);\n        SkRect rect = {pt.fX - small, pt.fY - small,\n                       pt.fX + small, pt.fY + small};\n        canvas->drawRect(rect, paint);\n\n        SkBitmap bmp;\n        bmp.setConfig(SkBitmap::kARGB_8888_Config, 2, 2);\n        bmp.allocPixels();\n        bmp.lockPixels();\n        uint32_t* pixels = reinterpret_cast<uint32_t*>(bmp.getPixels());\n        pixels[0] = SkPackARGB32(0xFF, 0xFF, 0x00, 0x00);\n        pixels[1] = SkPackARGB32(0xFF, 0x00, 0xFF, 0x00);\n        pixels[2] = SkPackARGB32(0x80, 0x00, 0x00, 0x00);\n        pixels[3] = SkPackARGB32(0xFF, 0x00, 0x00, 0xFF);\n        bmp.unlockPixels();\n        pt.set(30 * SK_Scalar1, 30 * SK_Scalar1);\n        m.mapPoints(&pt, 1);\n        SkShader* shader = SkShader::CreateBitmapShader(\n                                            bmp,\n                                            SkShader::kRepeat_TileMode,\n                                            SkShader::kRepeat_TileMode);\n        SkMatrix s;\n        s.reset();\n        s.setScale(SK_Scalar1 \/ 1000, SK_Scalar1 \/ 1000);\n        shader->setLocalMatrix(s);\n        paint.setShader(shader)->unref();\n        paint.setAntiAlias(false);\n        paint.setFilterBitmap(true);\n        rect.setLTRB(pt.fX - small, pt.fY - small,\n                     pt.fX + small, pt.fY + small);\n        canvas->drawRect(rect, paint);\n    }\n\nprivate:\n    typedef GM INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic GM* MyFactory(void*) { return new BigMatrixGM; }\nstatic GMRegistry reg(MyFactory);\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2018 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#include \"SkGeometry.h\"\n#include \"SkPaint.h\"\n#include \"SkPath.h\"\n#include \"SkPoint.h\"\n#include \"SkRandom.h\"\n\n#include <math.h>\n\nnamespace skiagm {\n\n\/\/ Slices paths into sliver-size contours shaped like ice cream cones.\nclass MandolineSlicer {\npublic:\n    static constexpr int kDefaultSubdivisions = 10;\n\n    MandolineSlicer(SkPoint anchorPt) {\n        fPath.setFillType(SkPath::kEvenOdd_FillType);\n        fPath.setIsVolatile(true);\n        this->reset(anchorPt);\n    }\n\n    void reset(SkPoint anchorPt) {\n        fPath.reset();\n        fLastPt = fAnchorPt = anchorPt;\n    }\n\n    void sliceLine(SkPoint pt, int numSubdivisions = kDefaultSubdivisions) {\n        if (numSubdivisions <= 0) {\n            fPath.moveTo(fAnchorPt);\n            fPath.lineTo(fLastPt);\n            fPath.lineTo(pt);\n            fPath.close();\n            fLastPt = pt;\n            return;\n        }\n        float T = this->chooseChopT(numSubdivisions);\n        if (0 == T) {\n            fPath.lineTo(fLastPt);\n            this->sliceLine(pt, numSubdivisions - 1);\n            return;\n        }\n        SkPoint midpt = fLastPt * (1 - T) + pt * T;\n        this->sliceLine(midpt, numSubdivisions - 1);\n        this->sliceLine(pt, numSubdivisions - 1);\n    }\n\n    void sliceQuadratic(SkPoint p1, SkPoint p2, int numSubdivisions = kDefaultSubdivisions) {\n        if (numSubdivisions <= 0) {\n            fPath.moveTo(fAnchorPt);\n            fPath.lineTo(fLastPt);\n            fPath.quadTo(p1, p2);\n            fPath.close();\n            fLastPt = p2;\n            return;\n        }\n        float T = this->chooseChopT(numSubdivisions);\n        if (0 == T) {\n            fPath.quadTo(fLastPt, fLastPt);\n            this->sliceQuadratic(p1, p2, numSubdivisions - 1);\n            return;\n        }\n        SkPoint P[3] = {fLastPt, p1, p2}, PP[5];\n        SkChopQuadAt(P, PP, T);\n        this->sliceQuadratic(PP[1], PP[2], numSubdivisions - 1);\n        this->sliceQuadratic(PP[3], PP[4], numSubdivisions - 1);\n    }\n\n    void sliceCubic(SkPoint p1, SkPoint p2, SkPoint p3,\n                    int numSubdivisions = kDefaultSubdivisions) {\n        if (numSubdivisions <= 0) {\n            fPath.moveTo(fAnchorPt);\n            fPath.lineTo(fLastPt);\n            fPath.cubicTo(p1, p2, p3);\n            fPath.close();\n            fLastPt = p3;\n            return;\n        }\n        float T = this->chooseChopT(numSubdivisions);\n        if (0 == T) {\n            fPath.cubicTo(fLastPt, fLastPt, fLastPt);\n            this->sliceCubic(p1, p2, p3, numSubdivisions - 1);\n            return;\n        }\n        SkPoint P[4] = {fLastPt, p1, p2, p3}, PP[7];\n        SkChopCubicAt(P, PP, T);\n        this->sliceCubic(PP[1], PP[2], PP[3], numSubdivisions - 1);\n        this->sliceCubic(PP[4], PP[5], PP[6], numSubdivisions - 1);\n    }\n\n    void sliceConic(SkPoint p1, SkPoint p2, float w, int numSubdivisions = kDefaultSubdivisions) {\n        if (numSubdivisions <= 0) {\n            fPath.moveTo(fAnchorPt);\n            fPath.lineTo(fLastPt);\n            fPath.conicTo(p1, p2, w);\n            fPath.close();\n            fLastPt = p2;\n            return;\n        }\n        float T = this->chooseChopT(numSubdivisions);\n        if (0 == T) {\n            fPath.conicTo(fLastPt, fLastPt, w);\n            this->sliceConic(p1, p2, w, numSubdivisions - 1);\n            return;\n        }\n        SkConic conic(fLastPt, p1, p2, w), halves[2];\n        if (!conic.chopAt(T, halves)) {\n            SK_ABORT(\"SkConic::chopAt failed\");\n        }\n        this->sliceConic(halves[0].fPts[1], halves[0].fPts[2], halves[0].fW, numSubdivisions - 1);\n        this->sliceConic(halves[1].fPts[1], halves[1].fPts[2], halves[1].fW, numSubdivisions - 1);\n    }\n\n    const SkPath& path() const { return fPath; }\n\nprivate:\n    float chooseChopT(int numSubdivisions) {\n        SkASSERT(numSubdivisions > 0);\n        if (numSubdivisions > 1) {\n            return .5f;\n        }\n        float T = (0 == fRand.nextU() % 10) ? 0 : scalbnf(1, -(int)fRand.nextRangeU(10, 149));\n        SkASSERT(T >= 0 && T < 1);\n        return T;\n    }\n\n    SkRandom fRand;\n    SkPath fPath;\n    SkPoint fAnchorPt;\n    SkPoint fLastPt;\n};\n\nclass SliverPathsGM : public GM {\npublic:\n    SliverPathsGM() {\n        this->setBGColor(SK_ColorBLACK);\n    }\n\nprotected:\n    SkString onShortName() override {\n        return SkString(\"mandoline\");\n    }\n\n    SkISize onISize() override {\n        return SkISize::Make(560, 475);\n    }\n\n    void onDraw(SkCanvas* canvas) override {\n        SkPaint paint;\n        paint.setColor(SK_ColorWHITE);\n        paint.setAntiAlias(true);\n\n        MandolineSlicer mandoline({41, 43});\n        mandoline.sliceCubic({5, 277}, {381, -74}, {243, 162});\n        mandoline.sliceLine({41, 43});\n        canvas->drawPath(mandoline.path(), paint);\n\n        mandoline.reset({357.049988f, 446.049988f});\n        mandoline.sliceCubic({472.750000f, -71.950012f}, {639.750000f, 531.950012f},\n                             {309.049988f, 347.950012f});\n        mandoline.sliceLine({309.049988f, 419});\n        mandoline.sliceLine({357.049988f, 446.049988f});\n        canvas->drawPath(mandoline.path(), paint);\n\n        canvas->save();\n        canvas->translate(421, 105);\n        canvas->scale(100, 81);\n        mandoline.reset({-cosf(SkDegreesToRadians(-60)), sinf(SkDegreesToRadians(-60))});\n        mandoline.sliceConic({-2, 0},\n                             {-cosf(SkDegreesToRadians(60)), sinf(SkDegreesToRadians(60))}, .5f);\n        mandoline.sliceConic({-cosf(SkDegreesToRadians(120))*2, sinf(SkDegreesToRadians(120))*2},\n                             {1, 0}, .5f);\n        mandoline.sliceLine({0, 0});\n        mandoline.sliceLine({-cosf(SkDegreesToRadians(-60)), sinf(SkDegreesToRadians(-60))});\n        canvas->drawPath(mandoline.path(), paint);\n        canvas->restore();\n\n        canvas->save();\n        canvas->translate(150, 300);\n        canvas->scale(75, 75);\n        mandoline.reset({1, 0});\n        constexpr int nquads = 5;\n        for (int i = 0; i < nquads; ++i) {\n            float theta1 = 2*SK_ScalarPI\/nquads * (i + .5f);\n            float theta2 = 2*SK_ScalarPI\/nquads * (i + 1);\n            mandoline.sliceQuadratic({cosf(theta1)*2, sinf(theta1)*2},\n                                     {cosf(theta2), sinf(theta2)});\n        }\n        canvas->drawPath(mandoline.path(), paint);\n        canvas->restore();\n    }\n};\n\nDEF_GM(return new SliverPathsGM;)\n\n}\n<commit_msg>modify gm to avoid creating t-junctions between degernate curves and lines<commit_after>\/*\n * Copyright 2018 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#include \"SkGeometry.h\"\n#include \"SkPaint.h\"\n#include \"SkPath.h\"\n#include \"SkPoint.h\"\n#include \"SkRandom.h\"\n\n#include <math.h>\n\nnamespace skiagm {\n\n\/\/ Slices paths into sliver-size contours shaped like ice cream cones.\nclass MandolineSlicer {\npublic:\n    static constexpr int kDefaultSubdivisions = 10;\n\n    MandolineSlicer(SkPoint anchorPt) {\n        fPath.setFillType(SkPath::kEvenOdd_FillType);\n        fPath.setIsVolatile(true);\n        this->reset(anchorPt);\n    }\n\n    void reset(SkPoint anchorPt) {\n        fPath.reset();\n        fLastPt = fAnchorPt = anchorPt;\n    }\n\n    void sliceLine(SkPoint pt, int numSubdivisions = kDefaultSubdivisions) {\n        if (numSubdivisions <= 0) {\n            fPath.moveTo(fAnchorPt);\n            fPath.lineTo(fLastPt);\n            fPath.lineTo(pt);\n            fPath.close();\n            fLastPt = pt;\n            return;\n        }\n        float T = this->chooseChopT(numSubdivisions);\n        if (0 == T) {\n            return;\n        }\n        SkPoint midpt = fLastPt * (1 - T) + pt * T;\n        this->sliceLine(midpt, numSubdivisions - 1);\n        this->sliceLine(pt, numSubdivisions - 1);\n    }\n\n    void sliceQuadratic(SkPoint p1, SkPoint p2, int numSubdivisions = kDefaultSubdivisions) {\n        if (numSubdivisions <= 0) {\n            fPath.moveTo(fAnchorPt);\n            fPath.lineTo(fLastPt);\n            fPath.quadTo(p1, p2);\n            fPath.close();\n            fLastPt = p2;\n            return;\n        }\n        float T = this->chooseChopT(numSubdivisions);\n        if (0 == T) {\n            return;\n        }\n        SkPoint P[3] = {fLastPt, p1, p2}, PP[5];\n        SkChopQuadAt(P, PP, T);\n        this->sliceQuadratic(PP[1], PP[2], numSubdivisions - 1);\n        this->sliceQuadratic(PP[3], PP[4], numSubdivisions - 1);\n    }\n\n    void sliceCubic(SkPoint p1, SkPoint p2, SkPoint p3,\n                    int numSubdivisions = kDefaultSubdivisions) {\n        if (numSubdivisions <= 0) {\n            fPath.moveTo(fAnchorPt);\n            fPath.lineTo(fLastPt);\n            fPath.cubicTo(p1, p2, p3);\n            fPath.close();\n            fLastPt = p3;\n            return;\n        }\n        float T = this->chooseChopT(numSubdivisions);\n        if (0 == T) {\n            return;\n        }\n        SkPoint P[4] = {fLastPt, p1, p2, p3}, PP[7];\n        SkChopCubicAt(P, PP, T);\n        this->sliceCubic(PP[1], PP[2], PP[3], numSubdivisions - 1);\n        this->sliceCubic(PP[4], PP[5], PP[6], numSubdivisions - 1);\n    }\n\n    void sliceConic(SkPoint p1, SkPoint p2, float w, int numSubdivisions = kDefaultSubdivisions) {\n        if (numSubdivisions <= 0) {\n            fPath.moveTo(fAnchorPt);\n            fPath.lineTo(fLastPt);\n            fPath.conicTo(p1, p2, w);\n            fPath.close();\n            fLastPt = p2;\n            return;\n        }\n        float T = this->chooseChopT(numSubdivisions);\n        if (0 == T) {\n            return;\n        }\n        SkConic conic(fLastPt, p1, p2, w), halves[2];\n        if (!conic.chopAt(T, halves)) {\n            SK_ABORT(\"SkConic::chopAt failed\");\n        }\n        this->sliceConic(halves[0].fPts[1], halves[0].fPts[2], halves[0].fW, numSubdivisions - 1);\n        this->sliceConic(halves[1].fPts[1], halves[1].fPts[2], halves[1].fW, numSubdivisions - 1);\n    }\n\n    const SkPath& path() const { return fPath; }\n\nprivate:\n    float chooseChopT(int numSubdivisions) {\n        SkASSERT(numSubdivisions > 0);\n        if (numSubdivisions > 1) {\n            return .5f;\n        }\n        float T = (0 == fRand.nextU() % 10) ? 0 : scalbnf(1, -(int)fRand.nextRangeU(10, 149));\n        SkASSERT(T >= 0 && T < 1);\n        return T;\n    }\n\n    SkRandom fRand;\n    SkPath fPath;\n    SkPoint fAnchorPt;\n    SkPoint fLastPt;\n};\n\nclass SliverPathsGM : public GM {\npublic:\n    SliverPathsGM() {\n        this->setBGColor(SK_ColorBLACK);\n    }\n\nprotected:\n    SkString onShortName() override {\n        return SkString(\"mandoline\");\n    }\n\n    SkISize onISize() override {\n        return SkISize::Make(560, 475);\n    }\n\n    void onDraw(SkCanvas* canvas) override {\n        SkPaint paint;\n        paint.setColor(SK_ColorWHITE);\n        paint.setAntiAlias(true);\n\n        MandolineSlicer mandoline({41, 43});\n        mandoline.sliceCubic({5, 277}, {381, -74}, {243, 162});\n        mandoline.sliceLine({41, 43});\n        canvas->drawPath(mandoline.path(), paint);\n\n        mandoline.reset({357.049988f, 446.049988f});\n        mandoline.sliceCubic({472.750000f, -71.950012f}, {639.750000f, 531.950012f},\n                             {309.049988f, 347.950012f});\n        mandoline.sliceLine({309.049988f, 419});\n        mandoline.sliceLine({357.049988f, 446.049988f});\n        canvas->drawPath(mandoline.path(), paint);\n\n        canvas->save();\n        canvas->translate(421, 105);\n        canvas->scale(100, 81);\n        mandoline.reset({-cosf(SkDegreesToRadians(-60)), sinf(SkDegreesToRadians(-60))});\n        mandoline.sliceConic({-2, 0},\n                             {-cosf(SkDegreesToRadians(60)), sinf(SkDegreesToRadians(60))}, .5f);\n        mandoline.sliceConic({-cosf(SkDegreesToRadians(120))*2, sinf(SkDegreesToRadians(120))*2},\n                             {1, 0}, .5f);\n        mandoline.sliceLine({0, 0});\n        mandoline.sliceLine({-cosf(SkDegreesToRadians(-60)), sinf(SkDegreesToRadians(-60))});\n        canvas->drawPath(mandoline.path(), paint);\n        canvas->restore();\n\n        canvas->save();\n        canvas->translate(150, 300);\n        canvas->scale(75, 75);\n        mandoline.reset({1, 0});\n        constexpr int nquads = 5;\n        for (int i = 0; i < nquads; ++i) {\n            float theta1 = 2*SK_ScalarPI\/nquads * (i + .5f);\n            float theta2 = 2*SK_ScalarPI\/nquads * (i + 1);\n            mandoline.sliceQuadratic({cosf(theta1)*2, sinf(theta1)*2},\n                                     {cosf(theta2), sinf(theta2)});\n        }\n        canvas->drawPath(mandoline.path(), paint);\n        canvas->restore();\n    }\n};\n\nDEF_GM(return new SliverPathsGM;)\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  The MIT License (MIT)\n\n  Copyright (c) 2016 G. Beard\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#ifndef TEST_HPP_INCLUDED\n#define TEST_HPP_INCLUDED\n\n#include <iostream>\n#include <vector>\n#include <tuple>\n\nnamespace gmb { namespace test\n{\n  size_t error_count;\n  using test_case_t = void(*)(char const*);\n  std::vector<std::pair<test_case_t, char const*>> list;\n} }\n\n#define TEST_STRINGIFY_IMPL(str) #str\n#define TEST_STRINGIFY(str) TEST_STRINGIFY_IMPL(str)\n#define TEST_CONCAT_IMPL(x, y) x##y\n#define TEST_CONCAT(x, y) TEST_CONCAT_IMPL(x, y)\n\n#define TEST_CASE(name) \\\n  void name(char const*); \\\n  struct name##_helper_t \\\n  { \\\n    name##_helper_t() \\\n    { \\\n      ::gmb::test::list.push_back(std::make_pair( \\\n        name, TEST_STRINGIFY(name))); \\\n    } \\\n  } name##_instance; \\\n  void name(char const* _test_name_)\n\n#define DEFINE_TEST_MAIN \\\n  int main() \\\n  { \\\n    for(auto&& t : ::gmb::test::list) { \\\n      std::get<0>(t)(std::get<1>(t)); \\\n    } \\\n    TEST_EXIT(); \\\n  }\n\n#define TEST_LOG_DEBUG(str) \\\n  do { \\\n    std::cout << \"LOG: \" TEST_CONCAT(<<, str) \\\n    << \" [\" << __FILE__ << \", \" << _test_name_ << \", line \" \\\n          << __LINE__ << \"] \" << std::endl; \\\n  } \\\n  while(0)\n\n#define TEST_PRINT_POSITION \\\n  \" [\" << __FILE__ << \", \" << _test_name_ << \\\n  \", line \" << __LINE__ << \"]\" \\\n\n#define TEST_ASSERT(x) \\\n  do { \\\n    if( !(x) ) { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"ASSERTION FAILED: \\\"\" TEST_STRINGIFY(x) \\\n        << \"\\\"\" << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define TEST_EXPECT_THROW(x) \\\n  do { \\\n    try { \\\n      x; \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"EXPECT EXCEPTION FAILED: \\\"\" TEST_STRINGIFY(x) \\\n        << \"\\\"\" << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n    catch(...) { } \\\n  } \\\n  while(0)\n\n#define THIS_(expr) \\\n  do { \\\n    char const* _expr_str_  = \\\n      TEST_STRINGIFY(expr); \\\n    if ([&]() -> bool { return (expr); }\n\n#define _SHOULD_BE_(expected) \\\n  () != (expected) ) \\\n    { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"ASSERTION FAILED: \\\"\" << \\\n        _expr_str_ << \" != \" << TEST_STRINGIFY(expected) \\\n        << \"\\\"\" \\\n        << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define _SHOULD_BE_TRUE \\\n  () == false ) \\\n    { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"ASSERTION FAILED: \\\"\" << \\\n        _expr_str_ << \"\\\"\" \\\n        << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define _SHOULD_BE_FALSE \\\n  () == true ) \\\n    { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"ASSERTION FAILED: \\\"\" << \\\n        _expr_str_ << \"\\\"\" \\\n        << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define TEST_EXPECT_NO_THROW(x) \\\n  do { \\\n    try { \\\n      x; \\\n    } \\\n    catch(...) { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"EXPECT NO EXCEPTION FAILED: \" TEST_STRINGIFY(x) \\\n        << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define TEST_EXIT() \\\n  do { \\\n    if(::gmb::test::error_count > 0) { \\\n      std::cerr << ::gmb::test::error_count << \" TESTS FAILED!\" \\\n        << std::endl; \\\n      return 1; \\\n    } \\\n    else { \\\n      std::cout << \"NO FAILURES\" << std::endl; \\\n      return 0; \\\n    } \\\n  } \\\n  while(0)\n\n#endif \/\/TEST_HPP_INCLUDED\n<commit_msg>Added static linkage to internal tracking variables<commit_after>\/*\n  The MIT License (MIT)\n\n  Copyright (c) 2016 G. Beard\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#ifndef TEST_HPP_INCLUDED\n#define TEST_HPP_INCLUDED\n\n#include <iostream>\n#include <vector>\n#include <tuple>\n\nnamespace gmb { namespace test\n{\n  static size_t error_count;\n  using test_case_t = void(*)(char const*);\n  static std::vector<std::pair<test_case_t, char const*>> list;\n} }\n\n#define TEST_STRINGIFY_IMPL(str) #str\n#define TEST_STRINGIFY(str) TEST_STRINGIFY_IMPL(str)\n#define TEST_CONCAT_IMPL(x, y) x##y\n#define TEST_CONCAT(x, y) TEST_CONCAT_IMPL(x, y)\n\n#define TEST_CASE(name) \\\n  void name(char const*); \\\n  struct name##_helper_t \\\n  { \\\n    name##_helper_t() \\\n    { \\\n      ::gmb::test::list.push_back(std::make_pair( \\\n        name, TEST_STRINGIFY(name))); \\\n    } \\\n  } name##_instance; \\\n  void name(char const* _test_name_)\n\n#define DEFINE_TEST_MAIN \\\n  int main() \\\n  { \\\n    for(auto&& t : ::gmb::test::list) { \\\n      std::get<0>(t)(std::get<1>(t)); \\\n    } \\\n    TEST_EXIT(); \\\n  }\n\n#define TEST_LOG_DEBUG(str) \\\n  do { \\\n    std::cout << \"LOG: \" TEST_CONCAT(<<, str) \\\n    << \" [\" << __FILE__ << \", \" << _test_name_ << \", line \" \\\n          << __LINE__ << \"] \" << std::endl; \\\n  } \\\n  while(0)\n\n#define TEST_PRINT_POSITION \\\n  \" [\" << __FILE__ << \", \" << _test_name_ << \\\n  \", line \" << __LINE__ << \"]\" \\\n\n#define TEST_ASSERT(x) \\\n  do { \\\n    if( !(x) ) { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"ASSERTION FAILED: \\\"\" TEST_STRINGIFY(x) \\\n        << \"\\\"\" << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define TEST_EXPECT_THROW(x) \\\n  do { \\\n    try { \\\n      x; \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"EXPECT EXCEPTION FAILED: \\\"\" TEST_STRINGIFY(x) \\\n        << \"\\\"\" << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n    catch(...) { } \\\n  } \\\n  while(0)\n\n#define THIS_(expr) \\\n  do { \\\n    char const* _expr_str_  = \\\n      TEST_STRINGIFY(expr); \\\n    if ([&]() -> bool { return (expr); }\n\n#define _SHOULD_BE_(expected) \\\n  () != (expected) ) \\\n    { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"ASSERTION FAILED: \\\"\" << \\\n        _expr_str_ << \" != \" << TEST_STRINGIFY(expected) \\\n        << \"\\\"\" \\\n        << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define _SHOULD_BE_TRUE \\\n  () == false ) \\\n    { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"ASSERTION FAILED: \\\"\" << \\\n        _expr_str_ << \"\\\"\" \\\n        << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define _SHOULD_BE_FALSE \\\n  () == true ) \\\n    { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"ASSERTION FAILED: \\\"\" << \\\n        _expr_str_ << \"\\\"\" \\\n        << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define TEST_EXPECT_NO_THROW(x) \\\n  do { \\\n    try { \\\n      x; \\\n    } \\\n    catch(...) { \\\n      ::gmb::test::error_count++; \\\n      std::cerr << \"EXPECT NO EXCEPTION FAILED: \" TEST_STRINGIFY(x) \\\n        << TEST_PRINT_POSITION \\\n        << std::endl; \\\n    } \\\n  } \\\n  while(0)\n\n#define TEST_EXIT() \\\n  do { \\\n    if(::gmb::test::error_count > 0) { \\\n      std::cerr << ::gmb::test::error_count << \" TESTS FAILED!\" \\\n        << std::endl; \\\n      return 1; \\\n    } \\\n    else { \\\n      std::cout << \"NO FAILURES\" << std::endl; \\\n      return 0; \\\n    } \\\n  } \\\n  while(0)\n\n#endif \/\/TEST_HPP_INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2012 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 \".\/vp9_rtcd.h\"\n#include \".\/vpx_config.h\"\n#include \".\/vpx_dsp_rtcd.h\"\n#include \"test\/acm_random.h\"\n#include \"test\/clear_system_state.h\"\n#include \"test\/register_state_check.h\"\n#include \"vp9\/common\/vp9_blockd.h\"\n#include \"vpx_mem\/vpx_mem.h\"\n\ntypedef void (*SubtractFunc)(int rows, int cols,\n                             int16_t *diff_ptr, ptrdiff_t diff_stride,\n                             const uint8_t *src_ptr, ptrdiff_t src_stride,\n                             const uint8_t *pred_ptr, ptrdiff_t pred_stride);\n\nnamespace vp9 {\n\nclass VP9SubtractBlockTest : public ::testing::TestWithParam<SubtractFunc> {\n public:\n  virtual void TearDown() {\n    libvpx_test::ClearSystemState();\n  }\n};\n\nusing libvpx_test::ACMRandom;\n\nTEST_P(VP9SubtractBlockTest, SimpleSubtract) {\n  ACMRandom rnd(ACMRandom::DeterministicSeed());\n\n  \/\/ FIXME(rbultje) split in its own file\n  for (BLOCK_SIZE bsize = BLOCK_4X4; bsize < BLOCK_SIZES;\n       bsize = static_cast<BLOCK_SIZE>(static_cast<int>(bsize) + 1)) {\n    const int block_width = 4 * num_4x4_blocks_wide_lookup[bsize];\n    const int block_height = 4 * num_4x4_blocks_high_lookup[bsize];\n    int16_t *diff = reinterpret_cast<int16_t *>(\n        vpx_memalign(16, sizeof(*diff) * block_width * block_height * 2));\n    uint8_t *pred = reinterpret_cast<uint8_t *>(\n        vpx_memalign(16, block_width * block_height * 2));\n    uint8_t *src  = reinterpret_cast<uint8_t *>(\n        vpx_memalign(16, block_width * block_height * 2));\n\n    for (int n = 0; n < 100; n++) {\n      for (int r = 0; r < block_height; ++r) {\n        for (int c = 0; c < block_width * 2; ++c) {\n          src[r * block_width * 2 + c] = rnd.Rand8();\n          pred[r * block_width * 2 + c] = rnd.Rand8();\n        }\n      }\n\n      GetParam()(block_height, block_width, diff, block_width,\n                 src, block_width, pred, block_width);\n\n      for (int r = 0; r < block_height; ++r) {\n        for (int c = 0; c < block_width; ++c) {\n          EXPECT_EQ(diff[r * block_width + c],\n                    (src[r * block_width + c] -\n                     pred[r * block_width + c])) << \"r = \" << r\n                                                 << \", c = \" << c\n                                                 << \", bs = \" << bsize;\n        }\n      }\n\n      GetParam()(block_height, block_width, diff, block_width * 2,\n                 src, block_width * 2, pred, block_width * 2);\n\n      for (int r = 0; r < block_height; ++r) {\n        for (int c = 0; c < block_width; ++c) {\n          EXPECT_EQ(diff[r * block_width * 2 + c],\n                    (src[r * block_width * 2 + c] -\n                     pred[r * block_width * 2 + c])) << \"r = \" << r\n                                                     << \", c = \" << c\n                                                     << \", bs = \" << bsize;\n        }\n      }\n    }\n    vpx_free(diff);\n    vpx_free(pred);\n    vpx_free(src);\n  }\n}\n\nINSTANTIATE_TEST_CASE_P(C, VP9SubtractBlockTest,\n                        ::testing::Values(vpx_subtract_block_c));\n\n#if HAVE_SSE2 && CONFIG_USE_X86INC\nINSTANTIATE_TEST_CASE_P(SSE2, VP9SubtractBlockTest,\n                        ::testing::Values(vpx_subtract_block_sse2));\n#endif\n#if HAVE_NEON\nINSTANTIATE_TEST_CASE_P(NEON, VP9SubtractBlockTest,\n                        ::testing::Values(vpx_subtract_block_neon));\n#endif\n\n}  \/\/ namespace vp9\n<commit_msg>mips msa vpx subtract test added<commit_after>\/*\n *  Copyright (c) 2012 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 \".\/vp9_rtcd.h\"\n#include \".\/vpx_config.h\"\n#include \".\/vpx_dsp_rtcd.h\"\n#include \"test\/acm_random.h\"\n#include \"test\/clear_system_state.h\"\n#include \"test\/register_state_check.h\"\n#include \"vp9\/common\/vp9_blockd.h\"\n#include \"vpx_mem\/vpx_mem.h\"\n\ntypedef void (*SubtractFunc)(int rows, int cols,\n                             int16_t *diff_ptr, ptrdiff_t diff_stride,\n                             const uint8_t *src_ptr, ptrdiff_t src_stride,\n                             const uint8_t *pred_ptr, ptrdiff_t pred_stride);\n\nnamespace vp9 {\n\nclass VP9SubtractBlockTest : public ::testing::TestWithParam<SubtractFunc> {\n public:\n  virtual void TearDown() {\n    libvpx_test::ClearSystemState();\n  }\n};\n\nusing libvpx_test::ACMRandom;\n\nTEST_P(VP9SubtractBlockTest, SimpleSubtract) {\n  ACMRandom rnd(ACMRandom::DeterministicSeed());\n\n  \/\/ FIXME(rbultje) split in its own file\n  for (BLOCK_SIZE bsize = BLOCK_4X4; bsize < BLOCK_SIZES;\n       bsize = static_cast<BLOCK_SIZE>(static_cast<int>(bsize) + 1)) {\n    const int block_width = 4 * num_4x4_blocks_wide_lookup[bsize];\n    const int block_height = 4 * num_4x4_blocks_high_lookup[bsize];\n    int16_t *diff = reinterpret_cast<int16_t *>(\n        vpx_memalign(16, sizeof(*diff) * block_width * block_height * 2));\n    uint8_t *pred = reinterpret_cast<uint8_t *>(\n        vpx_memalign(16, block_width * block_height * 2));\n    uint8_t *src  = reinterpret_cast<uint8_t *>(\n        vpx_memalign(16, block_width * block_height * 2));\n\n    for (int n = 0; n < 100; n++) {\n      for (int r = 0; r < block_height; ++r) {\n        for (int c = 0; c < block_width * 2; ++c) {\n          src[r * block_width * 2 + c] = rnd.Rand8();\n          pred[r * block_width * 2 + c] = rnd.Rand8();\n        }\n      }\n\n      GetParam()(block_height, block_width, diff, block_width,\n                 src, block_width, pred, block_width);\n\n      for (int r = 0; r < block_height; ++r) {\n        for (int c = 0; c < block_width; ++c) {\n          EXPECT_EQ(diff[r * block_width + c],\n                    (src[r * block_width + c] -\n                     pred[r * block_width + c])) << \"r = \" << r\n                                                 << \", c = \" << c\n                                                 << \", bs = \" << bsize;\n        }\n      }\n\n      GetParam()(block_height, block_width, diff, block_width * 2,\n                 src, block_width * 2, pred, block_width * 2);\n\n      for (int r = 0; r < block_height; ++r) {\n        for (int c = 0; c < block_width; ++c) {\n          EXPECT_EQ(diff[r * block_width * 2 + c],\n                    (src[r * block_width * 2 + c] -\n                     pred[r * block_width * 2 + c])) << \"r = \" << r\n                                                     << \", c = \" << c\n                                                     << \", bs = \" << bsize;\n        }\n      }\n    }\n    vpx_free(diff);\n    vpx_free(pred);\n    vpx_free(src);\n  }\n}\n\nINSTANTIATE_TEST_CASE_P(C, VP9SubtractBlockTest,\n                        ::testing::Values(vpx_subtract_block_c));\n\n#if HAVE_SSE2 && CONFIG_USE_X86INC\nINSTANTIATE_TEST_CASE_P(SSE2, VP9SubtractBlockTest,\n                        ::testing::Values(vpx_subtract_block_sse2));\n#endif\n#if HAVE_NEON\nINSTANTIATE_TEST_CASE_P(NEON, VP9SubtractBlockTest,\n                        ::testing::Values(vpx_subtract_block_neon));\n#endif\n#if HAVE_MSA\nINSTANTIATE_TEST_CASE_P(MSA, VP9SubtractBlockTest,\n                        ::testing::Values(vpx_subtract_block_msa));\n#endif\n\n}  \/\/ namespace vp9\n<|endoftext|>"}
{"text":"<commit_before>#include \"mytablemodel.h\"\n\nint MyTableModel::rowCount(const QModelIndex &parent) const\n{\n    return m_data.size();\n}\n\nint MyTableModel::columnCount(const QModelIndex &parent) const\n{\n    return 2;\n}\n\nQVariant MyTableModel::data(const QModelIndex &index, int role) const\n{\n    if (role != Qt::DisplayRole)\n        return QVariant();\n\n    Record const& dataElem = m_data[index.row()];\n\n    if (index.column() == 0)\n        return QVariant(dataElem.label);\n    else\n        return QVariant(dataElem.number);\n}\n\nbool MyTableModel::setData(const QModelIndex &index, const QVariant &value, int role)\n{\n    return false;\n}\n\nQt::ItemFlags MyTableModel::flags(const QModelIndex &index) const\n{\n    return QAbstractTableModel::flags(index);\n}\n\nvoid MyTableModel::insertRow()\n{\n    m_data.push_back({ \"label\", 0 });\n    emit layoutChanged();\n}\n<commit_msg>Edit support<commit_after>#include \"mytablemodel.h\"\n\nint MyTableModel::rowCount(const QModelIndex &parent) const\n{\n    return m_data.size();\n}\n\nint MyTableModel::columnCount(const QModelIndex &parent) const\n{\n    return 2;\n}\n\nQVariant MyTableModel::data(const QModelIndex &index, int role) const\n{\n    if (role != Qt::DisplayRole)\n        return QVariant();\n\n    Record const& dataElem = m_data[index.row()];\n\n    if (index.column() == 0)\n        return QVariant(dataElem.label);\n    else\n        return QVariant(dataElem.number);\n}\n\nbool MyTableModel::setData(const QModelIndex &index, const QVariant &value, int role)\n{\n    if (role != Qt::EditRole)\n        return QAbstractTableModel::setData(index, value,role);\n\n    Record &dataElem = m_data[index.row()];\n\n    if (index.column() == 0)\n        dataElem.label = value.toString();\n    else\n        dataElem.number = value.toInt();\n\n    emit layoutChanged();\n    return true;\n}\n\nQt::ItemFlags MyTableModel::flags(const QModelIndex &index) const\n{\n    return QAbstractTableModel::flags(index) | Qt::ItemIsEditable;\n}\n\nvoid MyTableModel::insertRow()\n{\n    m_data.push_back({ \"label\", 0 });\n    emit layoutChanged();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * QueryProcessor.cc\n *\n * Process user queries.\n *\n * Copyright (c) 2008 Linas Vepstas <linas@linas.org>\n *\/\n#include <stdio.h>\n\n#include \"AtomSpace.h\"\n#include \"CogServer.h\"\n#include \"Foreach.h\"\n#include \"MindAgent.h\"\n#include \"Node.h\"\n#include \"PatternMatch.h\"\n#include \"QueryProcessor.h\"\n\nusing namespace opencog;\n\nQueryProcessor::QueryProcessor(void)\n{\n}\n\nQueryProcessor::~QueryProcessor()\n{\n}\n\nvoid QueryProcessor::run(CogServer *server)\n{\n\tAtomSpace *as = server->getAtomSpace();\n\t\/\/ Handle h = as->getHandle(qtype, \"test\");\n\t\n\t\/\/ Look for recently asserted assertions.\n\tType atype = ClassServer::getType(\"AssertionLink\");\n\tstd::list<Handle> asrt_list;\n\tas->getHandleSet(back_inserter(asrt_list), atype, NULL);\n\n\t\/\/ Loop over all recent assertions, and take care of them.\n\twhile(!asrt_list.empty())\n\t{\n\t\tHandle h = asrt_list.front();\n\t\tdo_assertion(h);\n\t\tasrt_list.pop_front();\n\t\tif (h) as->removeAtom(h);\n\t}\n\n\t\/* XXX HACK ALERT -- no scheduling, so just sleep *\/\n\tusleep(1000000);  \/\/ 1 second\n\tusleep(10000);  \/\/ 10 millisecs == 100HZ\n}\n\n\/**\n * Set pointer to Node, if the node name is \"match_name\".\n *\/\nbool QueryProcessor::match_node_name(Atom *arel)\n{\n\tNode *n = dynamic_cast<Node *>(arel);\n\tif (n)\n\t{\n\t\tconst std::string& name = n->getName();\n\t\tif (0 == strcmp(name.c_str(), match_name))\n\t\t{\n\t\t\tnode = n;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\/**\n * Search for queries\n *\/\nbool QueryProcessor::check_for_query(Handle rel)\n{\n\tmatch_name = \"_$qVar\";\n\tnode = NULL;\n\tforeach_outgoing_atom(rel, &QueryProcessor::match_node_name, this);\n\tif (node)\n\t{\n\t\tprintf (\"found query its %s\\n\", node->toString().c_str());\n\t\tvarlist.push_back(TLB::getHandle(node));\n\t}\n}\n\n\/**\n * Process an assertion fed into the system.\n * Currently, this ignores all assertions that are not queries.\n *\/\nvoid QueryProcessor::do_assertion(Handle h)\n{\n\tprintf (\"duuuude found assertion handle=%p\\n\", h);\n\n\t\/\/ Look for unbound query variables\n\tvarlist.clear();\n\tforeach_outgoing_handle(h, &QueryProcessor::check_for_query, this);\n\n\t\/\/ If a query, try to answer it.\n\tif (0 != varlist.size())\n\t{\n\t\tPatternMatch pm;\n\t\tpm.match(h, varlist);\n\t}\n}\n\n\/* ======================= END OF FILE ==================== *\/\n<commit_msg>whoops, bug fix<commit_after>\/**\n * QueryProcessor.cc\n *\n * Process user queries.\n *\n * Copyright (c) 2008 Linas Vepstas <linas@linas.org>\n *\/\n#include <stdio.h>\n\n#include \"AtomSpace.h\"\n#include \"CogServer.h\"\n#include \"Foreach.h\"\n#include \"MindAgent.h\"\n#include \"Node.h\"\n#include \"PatternMatch.h\"\n#include \"QueryProcessor.h\"\n\nusing namespace opencog;\n\nQueryProcessor::QueryProcessor(void)\n{\n}\n\nQueryProcessor::~QueryProcessor()\n{\n}\n\nvoid QueryProcessor::run(CogServer *server)\n{\n\tAtomSpace *as = server->getAtomSpace();\n\t\/\/ Handle h = as->getHandle(qtype, \"test\");\n\t\n\t\/\/ Look for recently asserted assertions.\n\tType atype = ClassServer::getType(\"AssertionLink\");\n\tstd::list<Handle> asrt_list;\n\tas->getHandleSet(back_inserter(asrt_list), atype, NULL);\n\n\t\/\/ Loop over all recent assertions, and take care of them.\n\twhile(!asrt_list.empty())\n\t{\n\t\tHandle h = asrt_list.front();\n\t\tdo_assertion(h);\n\t\tasrt_list.pop_front();\n\t\tif (h) as->removeAtom(h);\n\t}\n\n\t\/* XXX HACK ALERT -- no scheduling, so just sleep *\/\n\tusleep(1000000);  \/\/ 1 second\n\tusleep(10000);  \/\/ 10 millisecs == 100HZ\n}\n\n\/**\n * Set pointer to Node, if the node name is \"match_name\".\n *\/\nbool QueryProcessor::match_node_name(Atom *atom)\n{\n\tNode *n = dynamic_cast<Node *>(atom);\n\tif (n)\n\t{\n\t\tconst std::string& name = n->getName();\n\t\tif (0 == strcmp(name.c_str(), match_name))\n\t\t{\n\t\t\tnode = n;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\/**\n * Search for queries\n *\/\nbool QueryProcessor::check_for_query(Handle rel)\n{\n\tmatch_name = \"_$qVar\";\n\tnode = NULL;\n\tforeach_outgoing_atom(rel, &QueryProcessor::match_node_name, this);\n\tif (node)\n\t{\n\t\t\/\/ printf (\"found query its %s\\n\", node->toString().c_str());\n\t\tvarlist.push_back(TLB::getHandle(node));\n\t}\n\treturn true;\n}\n\n\/**\n * Process an assertion fed into the system.\n * Currently, this ignores all assertions that are not queries.\n *\/\nvoid QueryProcessor::do_assertion(Handle h)\n{\n\tprintf (\"duuuude found assertion handle=%p\\n\", h);\n\n\t\/\/ Look for unbound query variables\n\tvarlist.clear();\n\tforeach_outgoing_handle(h, &QueryProcessor::check_for_query, this);\n\n\t\/\/ If a query, try to answer it.\n\tif (0 != varlist.size())\n\t{\n\t\tPatternMatch pm;\n\t\tpm.match(h, varlist);\n\t}\n}\n\n\/* ======================= END OF FILE ==================== *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Name:        copy_to_clipboard.cpp\n\/\/ Author:      jean-pierre Charras\n\/\/ Created:     18 aug 2006\n\/\/ Licence:   License GNU\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ For compilers that support precompilation, includes \"wx\/wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifdef __BORLANDC__\n#pragma hdrstop\n#endif\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n\n#include <ctype.h>\n#include \"wx\/metafile.h\"\n#include \"fctsys.h\"\n\n#include \"common.h\"\n#include \"id.h\"\n\nextern BASE_SCREEN * ActiveScreen;\n\nstatic const bool s_PlotBlackAndWhite = FALSE;\nstatic const bool Print_Sheet_Ref = TRUE;\n\nstatic bool DrawPage(WinEDA_DrawPanel * panel);\n\n\/************************************************************\/\nvoid WinEDA_DrawFrame::CopyToClipboard(wxCommandEvent& event)\n\/************************************************************\/\n\/* calls the function to copy the current page or the current bock to the clipboard\n*\/\n{\n\tDrawPage(DrawPanel);\n\n\tif(  event.GetId() == ID_GEN_COPY_BLOCK_TO_CLIPBOARD )\n\t{\n\t\tif (GetScreen()->BlockLocate.m_Command != BLOCK_IDLE)\n\t\t\tDrawPanel->SetCursor(wxCursor(DrawPanel->m_PanelCursor = DrawPanel->m_PanelDefaultCursor) );\n\n\t\tif( DrawPanel->ManageCurseur && DrawPanel->ForceCloseManageCurseur )\n\t\t{\n\t\twxClientDC dc(DrawPanel);\n\t\t\tDrawPanel->PrepareGraphicContext(&dc);\n\t\t\tDrawPanel->ForceCloseManageCurseur(DrawPanel, &dc);\n\t\t}\n\t}\n}\n\n\/*****************************************************************\/\nbool DrawPage(WinEDA_DrawPanel * panel)\n\/*****************************************************************\/\n\/* copy the current page or block to the clipboard ,\n\tto export drawings to other applications (word processing ...)\n\tThi is not suitable for copy command within eeschema or pcbnew\n*\/\n{\nbool success = TRUE;\n\n#ifdef __WINDOWS__\nint tmpzoom;\nwxPoint tmp_startvisu;\nwxPoint old_org;\nwxPoint DrawOffset;\t\/\/ Offset de trace\nint ClipboardSizeX, ClipboardSizeY;\nbool DrawBlock = FALSE;\nwxRect DrawArea;\n\n\t\/* scale is the ratio resolution\/internal units *\/\n\tfloat scale = 82.0 \/ panel->m_Parent->m_InternalUnits;\n\n\tif ( ActiveScreen->BlockLocate.m_Command != BLOCK_IDLE )\n\t{\n\t\tDrawBlock = TRUE;\n\t\tDrawArea.SetX((int)(ActiveScreen->BlockLocate.GetX()) );\n\t\tDrawArea.SetY((int)(ActiveScreen->BlockLocate.GetY()));\n\t\tDrawArea.SetWidth((int)(ActiveScreen->BlockLocate.GetWidth()));\n\t\tDrawArea.SetHeight((int)(ActiveScreen->BlockLocate.GetHeight()));\n\t}\n\n\t\/* modification des cadrages et reglages locaux *\/\n\ttmp_startvisu = ActiveScreen->m_StartVisu;\n\ttmpzoom = ActiveScreen->GetZoom();\n\told_org = ActiveScreen->m_DrawOrg;\n\tActiveScreen->m_DrawOrg.x = ActiveScreen->m_DrawOrg.y = 0;\n\tActiveScreen->m_StartVisu.x = ActiveScreen->m_StartVisu.y = 0;\n\n\tActiveScreen->SetZoom(1);\n\nwxMetafileDC dc\/*(wxT(\"\"), DrawArea.GetWidth(), DrawArea.GetHeight())*\/;\n\n\tif ( ! dc.Ok() )\n\t{\n\t\tDisplayError(NULL, wxT(\"CopyToClipboard: DrawPage error: wxMetafileDC not OK\"));\n\t\tsuccess = FALSE;\n\t}\n\n\telse\n\t{\n\tEDA_Rect tmp = panel->m_ClipBox;\n\t\tGRResetPenAndBrush(&dc);\n\t\tGRForceBlackPen(s_PlotBlackAndWhite);\n\t\tg_IsPrinting = TRUE;\n\t\tdc.SetUserScale(scale, scale);\n\t\tClipboardSizeX = dc.MaxX() + 10;\n\t\tClipboardSizeY = dc.MaxY() + 10;\n\t\tpanel->m_ClipBox.SetX(0);panel->m_ClipBox.SetY(0);\n\t\tpanel->m_ClipBox.SetWidth(0x7FFFFF0); panel->m_ClipBox.SetHeight(0x7FFFFF0);\n\n\t\tif ( DrawBlock )\n\t\t{\n\t\t\tdc.SetClippingRegion( DrawArea );\n\t\t}\n\t\tpanel->PrintPage(&dc, Print_Sheet_Ref, -1);\n\t\tg_IsPrinting = FALSE;\n\t\tpanel->m_ClipBox = tmp;\n\t\twxMetafile *mf = dc.Close();\n\t\tif (mf)\n\t\t{\n\t\t\tsuccess = mf->SetClipboard(ClipboardSizeX, ClipboardSizeY);\n\t\t\tdelete mf;\n\t\t}\n\t}\n\n\n\tGRForceBlackPen(FALSE);\n\tSetPenMinWidth(1);\n\n\tActiveScreen->m_StartVisu = tmp_startvisu;\n\tActiveScreen->m_DrawOrg = old_org;\n\tActiveScreen->SetZoom(tmpzoom);\n#endif\n\n\treturn success;\n}\n\n<commit_msg>beautify<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Name:        copy_to_clipboard.cpp\n\/\/ Author:      jean-pierre Charras\n\/\/ Created:     18 aug 2006\n\/\/ Licence:   License GNU\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ For compilers that support precompilation, includes \"wx\/wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifdef __BORLANDC__\n#pragma hdrstop\n#endif\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n\n#include <ctype.h>\n#include \"wx\/metafile.h\"\n#include \"fctsys.h\"\n\n#include \"common.h\"\n#include \"id.h\"\n\nextern BASE_SCREEN* ActiveScreen;\n\nstatic const bool   s_PlotBlackAndWhite = FALSE;\nstatic const bool   Print_Sheet_Ref = TRUE;\n\nstatic bool DrawPage( WinEDA_DrawPanel* panel );\n\n\/************************************************************\/\nvoid WinEDA_DrawFrame::CopyToClipboard( wxCommandEvent& event )\n\/************************************************************\/\n\n\/* calls the function to copy the current page or the current bock to the clipboard\n *\/\n{\n    DrawPage( DrawPanel );\n\n    if(  event.GetId() == ID_GEN_COPY_BLOCK_TO_CLIPBOARD )\n    {\n        if( GetScreen()->BlockLocate.m_Command != BLOCK_IDLE )\n            DrawPanel->SetCursor( wxCursor( DrawPanel->m_PanelCursor =\n                        DrawPanel->m_PanelDefaultCursor ) );\n\n        if( DrawPanel->ManageCurseur && DrawPanel->ForceCloseManageCurseur )\n        {\n            wxClientDC dc( DrawPanel );\n\n            DrawPanel->PrepareGraphicContext( &dc );\n            DrawPanel->ForceCloseManageCurseur( DrawPanel, &dc );\n        }\n    }\n}\n\n\n\/*****************************************************************\/\nbool DrawPage( WinEDA_DrawPanel* panel )\n\/*****************************************************************\/\n\n\/* copy the current page or block to the clipboard ,\n * to export drawings to other applications (word processing ...)\n * Thi is not suitable for copy command within eeschema or pcbnew\n *\/\n{\n    bool    success = TRUE;\n\n#ifdef __WINDOWS__\n    int     tmpzoom;\n    wxPoint tmp_startvisu;\n    wxPoint old_org;\n    wxPoint DrawOffset; \/\/ Offset de trace\n    int     ClipboardSizeX, ClipboardSizeY;\n    bool    DrawBlock = FALSE;\n    wxRect  DrawArea;\n\n    \/* scale is the ratio resolution\/internal units *\/\n    float   scale = 82.0 \/ panel->m_Parent->m_InternalUnits;\n\n    if( ActiveScreen->BlockLocate.m_Command != BLOCK_IDLE )\n    {\n        DrawBlock = TRUE;\n        DrawArea.SetX( (int) ( ActiveScreen->BlockLocate.GetX() ) );\n        DrawArea.SetY( (int) ( ActiveScreen->BlockLocate.GetY() ) );\n        DrawArea.SetWidth( (int) ( ActiveScreen->BlockLocate.GetWidth() ) );\n        DrawArea.SetHeight( (int) ( ActiveScreen->BlockLocate.GetHeight() ) );\n    }\n\n    \/* modification des cadrages et reglages locaux *\/\n    tmp_startvisu = ActiveScreen->m_StartVisu;\n    tmpzoom = ActiveScreen->GetZoom();\n    old_org = ActiveScreen->m_DrawOrg;\n    ActiveScreen->m_DrawOrg.x   = ActiveScreen->m_DrawOrg.y = 0;\n    ActiveScreen->m_StartVisu.x = ActiveScreen->m_StartVisu.y = 0;\n\n    ActiveScreen->SetZoom( 1 );\n\n    wxMetafileDC dc \/*(wxT(\"\"), DrawArea.GetWidth(), DrawArea.GetHeight())*\/;\n\n    if( !dc.Ok() )\n    {\n        DisplayError( NULL, wxT( \"CopyToClipboard: DrawPage error: wxMetafileDC not OK\" ) );\n        success = FALSE;\n    }\n    else\n    {\n        EDA_Rect tmp = panel->m_ClipBox;\n        GRResetPenAndBrush( &dc );\n        GRForceBlackPen( s_PlotBlackAndWhite );\n        g_IsPrinting = TRUE;\n        dc.SetUserScale( scale, scale );\n        ClipboardSizeX = dc.MaxX() + 10;\n        ClipboardSizeY = dc.MaxY() + 10;\n        panel->m_ClipBox.SetX( 0 ); panel->m_ClipBox.SetY( 0 );\n        panel->m_ClipBox.SetWidth( 0x7FFFFF0 ); panel->m_ClipBox.SetHeight( 0x7FFFFF0 );\n\n        if( DrawBlock )\n        {\n            dc.SetClippingRegion( DrawArea );\n        }\n        panel->PrintPage( &dc, Print_Sheet_Ref, -1 );\n        g_IsPrinting     = FALSE;\n        panel->m_ClipBox = tmp;\n        wxMetafile* mf = dc.Close();\n        if( mf )\n        {\n            success = mf->SetClipboard( ClipboardSizeX, ClipboardSizeY );\n            delete mf;\n        }\n    }\n\n\n    GRForceBlackPen( FALSE );\n    SetPenMinWidth( 1 );\n\n    ActiveScreen->m_StartVisu = tmp_startvisu;\n    ActiveScreen->m_DrawOrg   = old_org;\n    ActiveScreen->SetZoom( tmpzoom );\n#endif\n\n    return success;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"syscall_model.h\"\n#include \"sys\/syscall.h\"\n#include \"transport.h\"\n#include \"config.h\"\n\nSyscallMdl::SyscallMdl(Network *net)\n      : m_called_enter(false),\n      m_ret_val(0),\n      m_network(net)\n{\n}\n\nvoid SyscallMdl::runExit(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/\/if only the code below worked in enter...\n   \/\/int return_addr = PIN_GetContextReg(ctx, REG_INST_PTR);\n   \/\/return_addr += 2;\n   \/\/PIN_SetContextReg(ctx, REG_INST_PTR, return_addr);\n   \/\/PIN_ExecuteAt(ctx);\n\n   if (m_called_enter)\n   {\n#ifdef TARGET_IA32E\n      PIN_SetContextReg(ctx, REG_RAX, m_ret_val);\n#else\n      PIN_SetContextReg(ctx, REG_EAX, m_ret_val);\n#endif\n      m_called_enter = false;\n   }\n}\n\nvoid SyscallMdl::runEnter(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   fprintf(stderr, \"Syscall...\\n\");\n   \/\/ Reset the buffers for the new transmission\n   m_recv_buff.clear();\n   m_send_buff.clear();\n\n   int msg_type = MCP_MESSAGE_SYS_CALL;\n\n   UInt8 syscall_number = (UInt8) PIN_GetSyscallNumber(ctx, syscall_standard);\n\n   m_send_buff << msg_type << syscall_number;\n\n   switch (syscall_number)\n   {\n   case SYS_open:\n   {\n      \/\/ Filter on the input\n      char *path = (char *)PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n      if (!strcmp(path,\".\/common\/tests\/file_io\/input\"))\n      {\n         m_called_enter = true;\n         m_ret_val = marshallOpenCall(ctx, syscall_standard);\n      }\n      break;\n   }\n   case SYS_read:\n   {\n      m_called_enter = true;\n      m_ret_val = marshallReadCall(ctx, syscall_standard);\n      break;\n   }\n\n   case SYS_write:\n   {\n      fprintf(stderr, \"Calling write call\\n\");\n      m_called_enter = true;\n      m_ret_val = marshallWriteCall(ctx, syscall_standard);\n      break;\n   }\n   case SYS_close:\n   {\n      int fd = PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n      if (fd == 0x08)\n      {\n         m_called_enter = true;\n         m_ret_val = marshallCloseCall(ctx, syscall_standard);\n      }\n      break;\n   }\n   case SYS_access:\n      m_called_enter = true;\n      m_ret_val = marshallAccessCall(ctx, syscall_standard);\n      break;\n   case SYS_brk:\n      \/\/uncomment the following when our shared-mem handles mallocs properly\n      \/\/m_called_enter = true;\n      break;\n\n      \/\/ case SYS_exit:\n      \/\/    cerr << \"exit()\" << endl;\n      \/\/    break;\n   case -1:\n      break;\n   default:\n\/\/            cerr << \"SysCall: \" << (int)syscall_number << endl;\n      break;\n   }\n\n   if (m_called_enter)\n      PIN_SetSyscallNumber(ctx, syscall_standard, SYS_getpid);\n\n\n}\n\n\nint SyscallMdl::marshallOpenCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/*\n       Syscall Args\n       const char *pathname, int flags\n\n\n       Transmit Protocol\n\n       Field               Type\n       -----------------|--------\n       LEN_FNAME           UInt32\n       FILE_NAME           char[]\n       STATUS_FLAGS        int\n\n       Receive Protocol\n\n       Field               Type\n       -----------------|--------\n       STATUS              int\n\n   *\/\n\n   \/\/cerr << \"Entering SyscallMdl::marshallOpen()\" << endl;\n\n   char *path = (char *) PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n   int flags = (int) PIN_GetSyscallArgument(ctx, syscall_standard, 1);\n   UInt32 len_fname = strlen(path) + 1;\n\n   \/\/ cerr << \"open(\" << path << \")\" << endl;\n\n   m_send_buff << len_fname << make_pair(path, len_fname) << flags;\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n   assert(recv_pkt.length == sizeof(int));\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   int status;\n   m_recv_buff >> status;\n\n   delete [](Byte*)recv_pkt.data;\n\n   return status;\n}\n\n\nint SyscallMdl::marshallReadCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n\n   \/*\n       Syscall Args\n       int fd, void *buf, size_t count\n\n\n       Transmit\n\n       Field               Type\n       -----------------|--------\n       FILE_DESCRIPTOR     int\n       COUNT               size_t\n\n       Receive\n\n       Field               Type\n       -----------------|--------\n       BYTES               int\n       BUFFER              void *\n\n   *\/\n\n   \/\/cerr << \"Entering syscall model marshall read\" << endl;\n\n   int fd = (int) PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n   void *buf = (void *) PIN_GetSyscallArgument(ctx, syscall_standard, 1);\n   size_t count = (size_t) PIN_GetSyscallArgument(ctx, syscall_standard, 2);\n\n   \/\/ cerr << \"read(\" << fd << hex << \", \" << buf << dec << \", \" << count << \")\" << endl;\n\n\/\/if shared mem, provide the buf to read into\n   m_send_buff << fd << count << (int)buf;\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   \/\/cerr << \"sent to mcp \" << m_send_buff.size() << \" bytes\" << endl;\n\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n\n   assert(recv_pkt.length >= sizeof(int));\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   int bytes;\n   m_recv_buff >> bytes;\n\n   if (bytes != -1)\n   {\n      m_recv_buff >> make_pair(buf, bytes);\n   }\n   else\n   {\n      assert(m_recv_buff.size() == 0);\n   }\n   \/\/cerr << \"Exiting syscall model marshall read\" << endl;\n\n   delete [](Byte*)recv_pkt.data;\n\n   return bytes;\n}\n\n\nint SyscallMdl::marshallWriteCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/*\n       Syscall Args\n       int fd, void *buf, size_t count\n\n\n       Transmit\n\n       Field               Type\n       -----------------|--------\n       FILE_DESCRIPTOR     int\n       COUNT               size_t\n       BUFFER              char[]\n\n       Receive\n\n       Field               Type\n       -----------------|--------\n       BYTES               int\n\n   *\/\n\n   \/\/cerr << \"Entering syscall model marshall write\" << endl;\n\n   int fd = (int) PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n   void *buf = (void *) PIN_GetSyscallArgument(ctx, syscall_standard, 1);\n   size_t count = (size_t) PIN_GetSyscallArgument(ctx, syscall_standard, 2);\n\n   \/\/ cerr << \"write(\" << fd << hex << \", \" << buf << dec << \", \" << count << \")\" << endl;\n\n   \/\/ If we are simulating shared memory, then we simply put\n   \/\/ the address in the message. Otherwise, we need to put\n   \/\/ the data in the message as well.\n   if (g_config->isSimulatingSharedMemory())\n      m_send_buff << fd << count << (int)buf;\n   else\n      m_send_buff << fd << count << make_pair(buf, count);\n\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n   assert(recv_pkt.length == sizeof(int));\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   int status;\n   m_recv_buff >> status;\n\n   delete [](Byte*) recv_pkt.data;\n\n   return status;\n}\n\nint SyscallMdl::marshallCloseCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/*\n       Syscall Args\n       int fd, void *buf, size_t count\n\n\n       Transmit\n\n       Field               Type\n       -----------------|--------\n       FILE_DESCRIPTOR     int\n\n       Receive\n\n       Field               Type\n       -----------------|--------\n       STATUS              int\n\n   *\/\n\n   \/\/cerr << \"Entering syscall model marshall close\" << endl;\n\n   int fd = (int) PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n\n   \/\/ cerr << \"close(\" << fd  << \")\" << endl;\n\n   m_send_buff << fd;\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n   assert(recv_pkt.length == sizeof(int));\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   int status;\n   m_recv_buff >> status;\n\n   delete [](Byte*) recv_pkt.data;\n\n   return status;\n}\n\nint SyscallMdl::marshallAccessCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/\/cerr << \"Entering SyscallMdl::marshallAccessCall()\" << endl;\n\n   char *path = (char *)PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n   int mode = (int)PIN_GetSyscallArgument(ctx, syscall_standard, 1);\n   UInt32 len_fname = strlen(path) + 1;\n\n   \/\/ pack the data\n   m_send_buff << len_fname << make_pair(path, len_fname) << mode;\n\n   \/\/ send the data\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   \/\/ get a result\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n\n   \/\/ Create a buffer out of the result\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   \/\/ return the result\n   int result;\n   m_recv_buff >> result;\n\n   delete [](Byte*) recv_pkt.data;\n\n   return result;\n}\n\n\n<commit_msg>[syscall_model] Enable more functionality in the syscall model as it should all be supported.<commit_after>#include \"syscall_model.h\"\n#include \"sys\/syscall.h\"\n#include \"transport.h\"\n#include \"config.h\"\n\nSyscallMdl::SyscallMdl(Network *net)\n      : m_called_enter(false),\n      m_ret_val(0),\n      m_network(net)\n{\n}\n\nvoid SyscallMdl::runExit(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/\/if only the code below worked in enter...\n   \/\/int return_addr = PIN_GetContextReg(ctx, REG_INST_PTR);\n   \/\/return_addr += 2;\n   \/\/PIN_SetContextReg(ctx, REG_INST_PTR, return_addr);\n   \/\/PIN_ExecuteAt(ctx);\n\n   if (m_called_enter)\n   {\n#ifdef TARGET_IA32E\n      PIN_SetContextReg(ctx, REG_RAX, m_ret_val);\n#else\n      PIN_SetContextReg(ctx, REG_EAX, m_ret_val);\n#endif\n      m_called_enter = false;\n   }\n}\n\nvoid SyscallMdl::runEnter(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/\/ Reset the buffers for the new transmission\n   m_recv_buff.clear();\n   m_send_buff.clear();\n\n   int msg_type = MCP_MESSAGE_SYS_CALL;\n\n   UInt8 syscall_number = (UInt8) PIN_GetSyscallNumber(ctx, syscall_standard);\n\n   m_send_buff << msg_type << syscall_number;\n\n   switch (syscall_number)\n   {\n   case SYS_open:\n   {\n      m_called_enter = true;\n      m_ret_val = marshallOpenCall(ctx, syscall_standard);\n      break;\n   }\n   case SYS_read:\n   {\n      m_called_enter = true;\n      m_ret_val = marshallReadCall(ctx, syscall_standard);\n      break;\n   }\n\n   case SYS_write:\n   {\n      m_called_enter = true;\n      m_ret_val = marshallWriteCall(ctx, syscall_standard);\n      break;\n   }\n   case SYS_close:\n   {\n      m_called_enter = true;\n      m_ret_val = marshallCloseCall(ctx, syscall_standard);\n      break;\n   }\n   case SYS_access:\n      m_called_enter = true;\n      m_ret_val = marshallAccessCall(ctx, syscall_standard);\n      break;\n   case SYS_brk:\n      \/\/uncomment the following when our shared-mem handles mallocs properly\n      \/\/m_called_enter = true;\n      break;\n\n      \/\/ case SYS_exit:\n      \/\/    cerr << \"exit()\" << endl;\n      \/\/    break;\n   case -1:\n      break;\n   default:\n\/\/            cerr << \"SysCall: \" << (int)syscall_number << endl;\n      break;\n   }\n\n   if (m_called_enter)\n      PIN_SetSyscallNumber(ctx, syscall_standard, SYS_getpid);\n\n\n}\n\n\nint SyscallMdl::marshallOpenCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/*\n       Syscall Args\n       const char *pathname, int flags\n\n\n       Transmit Protocol\n\n       Field               Type\n       -----------------|--------\n       LEN_FNAME           UInt32\n       FILE_NAME           char[]\n       STATUS_FLAGS        int\n\n       Receive Protocol\n\n       Field               Type\n       -----------------|--------\n       STATUS              int\n\n   *\/\n\n   \/\/cerr << \"Entering SyscallMdl::marshallOpen()\" << endl;\n\n   char *path = (char *) PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n   int flags = (int) PIN_GetSyscallArgument(ctx, syscall_standard, 1);\n   UInt32 len_fname = strlen(path) + 1;\n\n   \/\/ cerr << \"open(\" << path << \")\" << endl;\n\n   m_send_buff << len_fname << make_pair(path, len_fname) << flags;\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n   assert(recv_pkt.length == sizeof(int));\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   int status;\n   m_recv_buff >> status;\n\n   delete [](Byte*)recv_pkt.data;\n\n   return status;\n}\n\n\nint SyscallMdl::marshallReadCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n\n   \/*\n       Syscall Args\n       int fd, void *buf, size_t count\n\n\n       Transmit\n\n       Field               Type\n       -----------------|--------\n       FILE_DESCRIPTOR     int\n       COUNT               size_t\n\n       Receive\n\n       Field               Type\n       -----------------|--------\n       BYTES               int\n       BUFFER              void *\n\n   *\/\n\n   \/\/cerr << \"Entering syscall model marshall read\" << endl;\n\n   int fd = (int) PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n   void *buf = (void *) PIN_GetSyscallArgument(ctx, syscall_standard, 1);\n   size_t count = (size_t) PIN_GetSyscallArgument(ctx, syscall_standard, 2);\n\n   \/\/ cerr << \"read(\" << fd << hex << \", \" << buf << dec << \", \" << count << \")\" << endl;\n\n\/\/if shared mem, provide the buf to read into\n   m_send_buff << fd << count << (int)buf;\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   \/\/cerr << \"sent to mcp \" << m_send_buff.size() << \" bytes\" << endl;\n\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n\n   assert(recv_pkt.length >= sizeof(int));\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   int bytes;\n   m_recv_buff >> bytes;\n\n   if (bytes != -1)\n   {\n      m_recv_buff >> make_pair(buf, bytes);\n   }\n   else\n   {\n      assert(m_recv_buff.size() == 0);\n   }\n   \/\/cerr << \"Exiting syscall model marshall read\" << endl;\n\n   delete [](Byte*)recv_pkt.data;\n\n   return bytes;\n}\n\n\nint SyscallMdl::marshallWriteCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/*\n       Syscall Args\n       int fd, void *buf, size_t count\n\n\n       Transmit\n\n       Field               Type\n       -----------------|--------\n       FILE_DESCRIPTOR     int\n       COUNT               size_t\n       BUFFER              char[]\n\n       Receive\n\n       Field               Type\n       -----------------|--------\n       BYTES               int\n\n   *\/\n\n   \/\/cerr << \"Entering syscall model marshall write\" << endl;\n\n   int fd = (int) PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n   void *buf = (void *) PIN_GetSyscallArgument(ctx, syscall_standard, 1);\n   size_t count = (size_t) PIN_GetSyscallArgument(ctx, syscall_standard, 2);\n\n   \/\/ cerr << \"write(\" << fd << hex << \", \" << buf << dec << \", \" << count << \")\" << endl;\n\n   \/\/ If we are simulating shared memory, then we simply put\n   \/\/ the address in the message. Otherwise, we need to put\n   \/\/ the data in the message as well.\n   if (g_config->isSimulatingSharedMemory())\n      m_send_buff << fd << count << (int)buf;\n   else\n      m_send_buff << fd << count << make_pair(buf, count);\n\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n   assert(recv_pkt.length == sizeof(int));\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   int status;\n   m_recv_buff >> status;\n\n   delete [](Byte*) recv_pkt.data;\n\n   return status;\n}\n\nint SyscallMdl::marshallCloseCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/*\n       Syscall Args\n       int fd, void *buf, size_t count\n\n\n       Transmit\n\n       Field               Type\n       -----------------|--------\n       FILE_DESCRIPTOR     int\n\n       Receive\n\n       Field               Type\n       -----------------|--------\n       STATUS              int\n\n   *\/\n\n   \/\/cerr << \"Entering syscall model marshall close\" << endl;\n\n   int fd = (int) PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n\n   \/\/ cerr << \"close(\" << fd  << \")\" << endl;\n\n   m_send_buff << fd;\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n   assert(recv_pkt.length == sizeof(int));\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   int status;\n   m_recv_buff >> status;\n\n   delete [](Byte*) recv_pkt.data;\n\n   return status;\n}\n\nint SyscallMdl::marshallAccessCall(CONTEXT *ctx, SYSCALL_STANDARD syscall_standard)\n{\n   \/\/cerr << \"Entering SyscallMdl::marshallAccessCall()\" << endl;\n\n   char *path = (char *)PIN_GetSyscallArgument(ctx, syscall_standard, 0);\n   int mode = (int)PIN_GetSyscallArgument(ctx, syscall_standard, 1);\n   UInt32 len_fname = strlen(path) + 1;\n\n   \/\/ pack the data\n   m_send_buff << len_fname << make_pair(path, len_fname) << mode;\n\n   \/\/ send the data\n   m_network->netSend(g_config->getMCPCoreNum(), MCP_REQUEST_TYPE, m_send_buff.getBuffer(), m_send_buff.size());\n\n   \/\/ get a result\n   NetPacket recv_pkt;\n   recv_pkt = m_network->netRecv(g_config->getMCPCoreNum(), MCP_RESPONSE_TYPE);\n\n   \/\/ Create a buffer out of the result\n   m_recv_buff << make_pair(recv_pkt.data, recv_pkt.length);\n\n   \/\/ return the result\n   int result;\n   m_recv_buff >> result;\n\n   delete [](Byte*) recv_pkt.data;\n\n   return result;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2014 nabijaczleweli\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#include \"container.hpp\"\n\n\nusing namespace sf;\nusing namespace std;\nusing namespace audiere;\n\n\nconst string assets_root(\".\/assets\");\nconst string textures_root(\".\/assets\/textures\");\nconst string font_root(\".\/assets\/fonts\");\nconst string sound_root(\".\/assets\/sound\");\nconst string localization_root(\".\/assets\/lang\");\n\nconst string app_name(\"BarbersAndRebarbs\");\n\/***\/ config app_configuration(\".\/\" + app_name + \".cfg\");\n\nconst localizer fallback_izer;\nconst localizer local_izer(app_configuration.language);\nconst localizer global_izer(local_izer, fallback_izer);\n\n\nconst Font font_pixelish([] {\n\tFont tmp;\n\ttmp.loadFromFile(font_root + \"\/04B_30.ttf\");\n\treturn tmp;\n}());\nconst Font font_swirly([] {\n\tFont tmp;\n\ttmp.loadFromFile(font_root + \"\/MACABRA_.ttf\");\n\treturn tmp;\n}());\n\n\nconst AudioDevicePtr audio_device(OpenDevice());\n<commit_msg>All assets come from exec's dir, not curdir<commit_after>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2014 nabijaczleweli\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#include \"container.hpp\"\n#include \"whereami++.hpp\"\n\n\nusing namespace sf;\nusing namespace std;\nusing namespace audiere;\nusing namespace whereami;\n\n\nconst string assets_root(executable_dir() + \"\/assets\");\nconst string textures_root(assets_root + \"\/textures\");\nconst string font_root(assets_root + \"\/fonts\");\nconst string sound_root(assets_root + \"\/sound\");\nconst string localization_root(assets_root + \"\/lang\");\n\nconst string app_name(\"BarbersAndRebarbs\");\n\/***\/ config app_configuration(executable_dir() + \"\/\" + app_name + \".cfg\");\n\nconst localizer fallback_izer;\nconst localizer local_izer(app_configuration.language);\nconst localizer global_izer(local_izer, fallback_izer);\n\n\nconst Font font_pixelish([] {\n\tFont tmp;\n\ttmp.loadFromFile(font_root + \"\/04B_30.ttf\");\n\treturn tmp;\n}());\nconst Font font_swirly([] {\n\tFont tmp;\n\ttmp.loadFromFile(font_root + \"\/MACABRA_.ttf\");\n\treturn tmp;\n}());\n\n\nconst AudioDevicePtr audio_device(OpenDevice());\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2015 nabijaczleweli\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#include \"bezier_curve.hpp\"\n#include \"..\/util\/vector.hpp\"\n#include <algorithm>\n#include <functional>\n#include <future>\n\n\nfloat bezier_curve::bezier_step       = .0001f;\nbool bezier_curve::optimize_points    = true;\nfloat bezier_curve::optimize_prettily = .01f;\n\n\nbezier_curve::bezier_curve(sf::Vector2f the_start_point, sf::Vector2f the_control_point, sf::Vector2f the_end_point)\n      : start_point(the_start_point), control_point(the_control_point), end_point(the_end_point) {\n\tcompute_vertices();\n}\n\nvoid bezier_curve::swap(bezier_curve & with) {\n#define VSWAP(var)       \\\n\t{                      \\\n\t\ttemp     = var;      \\\n\t\tvar      = with.var; \\\n\t\twith.var = temp;     \\\n\t}\n\n\tsf::Vector2f temp;\n\n\tVSWAP(start_point);\n\tVSWAP(control_point);\n\tVSWAP(end_point);\n\tvertices.swap(with.vertices);\n\n#undef VSWAP\n}\n\nvoid bezier_curve::draw(sf::RenderTarget & target, sf::RenderStates) const {\n\ttarget.draw(vertices.data(), vertices.size(), sf::PrimitiveType::LineStrip);\n\t\/\/ target.draw(&static_cast<const sf::Vertex &>(Vertex(control_point,sf:: Color::White)), 1, sf::PrimitiveType::Points);  \/\/ Debug\n}\n\nvoid bezier_curve::compute_vertices() {\n\tvertices.clear();\n\tconst auto & scale(get_scale());\n\tfor(float t = 0; t <= 1; t += bezier_step)\n\t\tvertices.emplace_back((1 - t) * (1 - t) * (scale * start_point) + 2 * (1 - t) * t * (scale * control_point) + t * t * (scale * end_point), sf::Color::White);\n\tif(optimize_points) {\n\t\tconst unsigned int additional_offset = optimize_prettily * vertices.size();\n\t\tvertices.erase(\n\t\t    unique(vertices.begin() + additional_offset, vertices.end() - additional_offset,\n\t\t           [&](auto && lhs, auto && rhs) { return (round(lhs.position.x) == round(rhs.position.x)) && (round(lhs.position.y) == round(rhs.position.y)); }),\n\t\t    vertices.end() - additional_offset);\n\t}\n\tvertices.shrink_to_fit();\n}\n\nvoid bezier_curve::move(float x, float y) {\n\tsf::Vector2f by(x, y);\n\tstart_point += by;\n\tcontrol_point += by;\n\tend_point += by;\n\tcompute_vertices();\n}\n\nvoid bezier_curve::set_scale(float factor_x, float factor_y) {\n\ttransform.setScale(factor_x, factor_y);\n\tcompute_vertices();\n}\n\nvoid bezier_curve::scale(const sf::Vector2f & factor) {\n\tscale(factor.x, factor.y);\n}\n\nvoid bezier_curve::scale(float factor_x, float factor_y) {\n\ttransform.scale(factor_x, factor_y);\n\tcompute_vertices();\n}\n<commit_msg>Use std::swap() in bezier_curve<commit_after>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2015 nabijaczleweli\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#include \"bezier_curve.hpp\"\n#include \"..\/util\/vector.hpp\"\n#include <algorithm>\n#include <functional>\n\n\nfloat bezier_curve::bezier_step       = .0001f;\nbool bezier_curve::optimize_points    = true;\nfloat bezier_curve::optimize_prettily = .01f;\n\n\nbezier_curve::bezier_curve(sf::Vector2f the_start_point, sf::Vector2f the_control_point, sf::Vector2f the_end_point)\n      : start_point(the_start_point), control_point(the_control_point), end_point(the_end_point) {\n\tcompute_vertices();\n}\n\nvoid bezier_curve::swap(bezier_curve & with) {\n\tstd::swap(start_point, with.start_point);\n\tstd::swap(control_point, with.control_point);\n\tstd::swap(end_point, with.end_point);\n\tvertices.swap(with.vertices);\n}\n\nvoid bezier_curve::draw(sf::RenderTarget & target, sf::RenderStates) const {\n\ttarget.draw(vertices.data(), vertices.size(), sf::PrimitiveType::LineStrip);\n\t\/\/ target.draw(&static_cast<const sf::Vertex &>(Vertex(control_point,sf:: Color::White)), 1, sf::PrimitiveType::Points);  \/\/ Debug\n}\n\nvoid bezier_curve::compute_vertices() {\n\tvertices.clear();\n\tconst auto & scale(get_scale());\n\tfor(float t = 0; t <= 1; t += bezier_step)\n\t\tvertices.emplace_back((1 - t) * (1 - t) * (scale * start_point) + 2 * (1 - t) * t * (scale * control_point) + t * t * (scale * end_point), sf::Color::White);\n\tif(optimize_points) {\n\t\tconst unsigned int additional_offset = optimize_prettily * vertices.size();\n\t\tvertices.erase(\n\t\t    unique(vertices.begin() + additional_offset, vertices.end() - additional_offset,\n\t\t           [&](auto && lhs, auto && rhs) { return (round(lhs.position.x) == round(rhs.position.x)) && (round(lhs.position.y) == round(rhs.position.y)); }),\n\t\t    vertices.end() - additional_offset);\n\t}\n\tvertices.shrink_to_fit();\n}\n\nvoid bezier_curve::move(float x, float y) {\n\tsf::Vector2f by(x, y);\n\tstart_point += by;\n\tcontrol_point += by;\n\tend_point += by;\n\tcompute_vertices();\n}\n\nvoid bezier_curve::set_scale(float factor_x, float factor_y) {\n\ttransform.setScale(factor_x, factor_y);\n\tcompute_vertices();\n}\n\nvoid bezier_curve::scale(const sf::Vector2f & factor) {\n\tscale(factor.x, factor.y);\n}\n\nvoid bezier_curve::scale(float factor_x, float factor_y) {\n\ttransform.scale(factor_x, factor_y);\n\tcompute_vertices();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n\n#include <string>\n#include <cmath>\n\n#include \"csimsbw.h\"\n#include \"csim\/error_codes.h\"\n\n\/\/ generated with test resource locations\n#include \"test_resources.h\"\n\n#define ABS_TOL 1.0e-7\n#define LOOSE_TOL 1.0e-1\n\nTEST(SBW, say_hello) {\n    char* hello;\n    int length;\n    int code = csim_sayHello(&hello, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 11);\n    EXPECT_EQ(std::string(hello), \"Hello World\");\n    csim_freeVector(hello);\n}\n\nTEST(SBW, model_string) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    EXPECT_EQ(code, 0);\n    int expectedLength = 9422 + strlen(\" xml:base=\\\"\\\"\") +\n            strlen(TestResources::getLocation(\n                       TestResources::CELLML_SINE_MODEL_RESOURCE));\n    EXPECT_EQ(length, expectedLength);\n    EXPECT_NE(std::string(modelString), \"\");\n    csim_freeVector(modelString);\n}\n\nTEST(SBW, model_with_imports_string) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    EXPECT_EQ(code, 0);\n    int expectedLength = 4629 + strlen(\" xml:base=\\\"\\\"\") +\n            strlen(TestResources::getLocation(\n                       TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE));\n    EXPECT_EQ(length, expectedLength);\n    EXPECT_NE(std::string(modelString), \"\");\n    csim_freeVector(modelString);\n}\n\nTEST(SBW, load_model) {\n    char* modelString;\n    int length;\n    \/\/ need to allow users to apply changes to the raw XML (from SED-ML for example)\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    EXPECT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    EXPECT_EQ(code, 0);\n    csim_freeVector(modelString);\n}\n\nTEST(SBW, load_model_with_imports) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    EXPECT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    EXPECT_EQ(code, 0);\n    csim_freeVector(modelString);\n}\n\nTEST(SBW, get_variables) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    char** variables;\n    code = csim_getVariables(&variables, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 19);\n    \/\/ test a few random variable IDs\n    EXPECT_EQ(std::string(variables[0]), \"actual_sin\/sin\");\n    EXPECT_EQ(std::string(variables[2]), \"deriv_approx_sin\/sin\");\n    EXPECT_EQ(std::string(variables[5]), \"main\/deriv_approx_initial_value\");\n    EXPECT_EQ(std::string(variables[9]), \"main\/x\");\n    EXPECT_EQ(std::string(variables[15]), \"parabolic_approx_sin\/kPi_32\");\n    EXPECT_EQ(std::string(variables[10]), \"parabolic_approx_sin\/C\");\n    csim_freeMatrix((void**)variables, length);\n}\n\nTEST(SBW, get_variables_with_imports) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    char** variables;\n    code = csim_getVariables(&variables, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 5);\n    \/\/ test a few random variable IDs\n    EXPECT_EQ(std::string(variables[1]), \"main\/sin1\");\n    EXPECT_EQ(std::string(variables[3]), \"main\/sin3\");\n    EXPECT_EQ(std::string(variables[4]), \"main\/x\");\n    csim_freeMatrix((void**)variables, length);\n}\n\nTEST(SBW, get_initial_values) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 19);\n    \/\/ test a few random variable values\n    EXPECT_NEAR(values[0], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[5], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[10], 0.75, ABS_TOL);\n    csim_freeVector(values);\n}\n\nTEST(SBW, get_initial_values_import) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 5);\n    \/\/ test a few random variable values\n    EXPECT_NEAR(values[1], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[3], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[4], 0.0, ABS_TOL);\n    csim_freeVector(values);\n}\n\nTEST(SBW, set_value) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    \/\/ get the initial values\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 19);\n    \/\/ test a few random variable values\n    EXPECT_NEAR(values[0], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[5], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[10], 0.75, ABS_TOL);\n    csim_freeVector(values);\n    \/\/ and now we should be able to set the value of the input variables\n    code = csim_setValue(\"main\/deriv_approx_initial_value\", 123.456);\n    EXPECT_EQ(code, 0);\n    code = csim_setValue(\"parabolic_approx_sin\/C\", 987.654);\n    EXPECT_EQ(code, 0);\n    code = csim_getValues(&values, &length);\n    EXPECT_NEAR(values[5], 123.456, ABS_TOL);\n    EXPECT_NEAR(values[10], 987.654, ABS_TOL);\n    csim_freeVector(values);\n}\n\nTEST(SBW, set_value_import) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 5);\n    \/\/ test a few random variable values\n    EXPECT_NEAR(values[1], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[3], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[4], 0.0, ABS_TOL);\n    csim_freeVector(values);\n    \/\/ try setting a variable (there are no inputs in this model)\n    code = csim_setValue(\"main\/sin1\", 123.4);\n    EXPECT_NE(code, 0);\n}\n\nTEST(SBW, one_step) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    \/\/ get the initial values\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 19);\n    csim_freeVector(values);\n    code = csim_setTolerances(1.0, 1.0, 10);\n    code = csim_oneStep(1.5);\n    EXPECT_EQ(code, 0);\n    \/\/ check the outputs\n    code = csim_getValues(&values, &length);\n    EXPECT_NEAR(values[9], 1.5, ABS_TOL); \/\/ main\/x\n    EXPECT_NEAR(values[0], sin(1.5), ABS_TOL); \/\/ actual_sin\/sin\n    EXPECT_NEAR(values[2], sin(1.5), LOOSE_TOL); \/\/ deriv_approx_sin\/sin\n    csim_freeVector(values);\n}\n<commit_msg>add one step test for import model<commit_after>#include \"gtest\/gtest.h\"\n\n#include <string>\n#include <cmath>\n\n#include \"csimsbw.h\"\n#include \"csim\/error_codes.h\"\n\n\/\/ generated with test resource locations\n#include \"test_resources.h\"\n\n#define ABS_TOL 1.0e-7\n#define LOOSE_TOL 1.0e-1\n\nTEST(SBW, say_hello) {\n    char* hello;\n    int length;\n    int code = csim_sayHello(&hello, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 11);\n    EXPECT_EQ(std::string(hello), \"Hello World\");\n    csim_freeVector(hello);\n}\n\nTEST(SBW, model_string) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    EXPECT_EQ(code, 0);\n    int expectedLength = 9422 + strlen(\" xml:base=\\\"\\\"\") +\n            strlen(TestResources::getLocation(\n                       TestResources::CELLML_SINE_MODEL_RESOURCE));\n    EXPECT_EQ(length, expectedLength);\n    EXPECT_NE(std::string(modelString), \"\");\n    csim_freeVector(modelString);\n}\n\nTEST(SBW, model_with_imports_string) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    EXPECT_EQ(code, 0);\n    int expectedLength = 4629 + strlen(\" xml:base=\\\"\\\"\") +\n            strlen(TestResources::getLocation(\n                       TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE));\n    EXPECT_EQ(length, expectedLength);\n    EXPECT_NE(std::string(modelString), \"\");\n    csim_freeVector(modelString);\n}\n\nTEST(SBW, load_model) {\n    char* modelString;\n    int length;\n    \/\/ need to allow users to apply changes to the raw XML (from SED-ML for example)\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    EXPECT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    EXPECT_EQ(code, 0);\n    csim_freeVector(modelString);\n}\n\nTEST(SBW, load_model_with_imports) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    EXPECT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    EXPECT_EQ(code, 0);\n    csim_freeVector(modelString);\n}\n\nTEST(SBW, get_variables) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    char** variables;\n    code = csim_getVariables(&variables, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 19);\n    \/\/ test a few random variable IDs\n    EXPECT_EQ(std::string(variables[0]), \"actual_sin\/sin\");\n    EXPECT_EQ(std::string(variables[2]), \"deriv_approx_sin\/sin\");\n    EXPECT_EQ(std::string(variables[5]), \"main\/deriv_approx_initial_value\");\n    EXPECT_EQ(std::string(variables[9]), \"main\/x\");\n    EXPECT_EQ(std::string(variables[15]), \"parabolic_approx_sin\/kPi_32\");\n    EXPECT_EQ(std::string(variables[10]), \"parabolic_approx_sin\/C\");\n    csim_freeMatrix((void**)variables, length);\n}\n\nTEST(SBW, get_variables_with_imports) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    char** variables;\n    code = csim_getVariables(&variables, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 5);\n    \/\/ test a few random variable IDs\n    EXPECT_EQ(std::string(variables[1]), \"main\/sin1\");\n    EXPECT_EQ(std::string(variables[3]), \"main\/sin3\");\n    EXPECT_EQ(std::string(variables[4]), \"main\/x\");\n    csim_freeMatrix((void**)variables, length);\n}\n\nTEST(SBW, get_initial_values) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 19);\n    \/\/ test a few random variable values\n    EXPECT_NEAR(values[0], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[5], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[10], 0.75, ABS_TOL);\n    csim_freeVector(values);\n}\n\nTEST(SBW, get_initial_values_import) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 5);\n    \/\/ test a few random variable values\n    EXPECT_NEAR(values[1], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[3], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[4], 0.0, ABS_TOL);\n    csim_freeVector(values);\n}\n\nTEST(SBW, set_value) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    \/\/ get the initial values\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 19);\n    \/\/ test a few random variable values\n    EXPECT_NEAR(values[0], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[5], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[10], 0.75, ABS_TOL);\n    csim_freeVector(values);\n    \/\/ and now we should be able to set the value of the input variables\n    code = csim_setValue(\"main\/deriv_approx_initial_value\", 123.456);\n    EXPECT_EQ(code, 0);\n    code = csim_setValue(\"parabolic_approx_sin\/C\", 987.654);\n    EXPECT_EQ(code, 0);\n    code = csim_getValues(&values, &length);\n    EXPECT_NEAR(values[5], 123.456, ABS_TOL);\n    EXPECT_NEAR(values[10], 987.654, ABS_TOL);\n    csim_freeVector(values);\n}\n\nTEST(SBW, set_value_import) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 5);\n    \/\/ test a few random variable values\n    EXPECT_NEAR(values[1], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[3], 0.0, ABS_TOL);\n    EXPECT_NEAR(values[4], 0.0, ABS_TOL);\n    csim_freeVector(values);\n    \/\/ try setting a variable (there are no inputs in this model)\n    code = csim_setValue(\"main\/sin1\", 123.4);\n    EXPECT_NE(code, 0);\n}\n\nTEST(SBW, one_step) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    \/\/ get the initial values\n    code = csim_getValues(&values, &length);\n    EXPECT_EQ(code, 0);\n    EXPECT_EQ(length, 19);\n    csim_freeVector(values);\n    code = csim_setTolerances(1.0, 1.0, 10);\n    code = csim_oneStep(1.5);\n    EXPECT_EQ(code, 0);\n    \/\/ check the outputs\n    code = csim_getValues(&values, &length);\n    EXPECT_NEAR(values[9], 1.5, ABS_TOL); \/\/ main\/x\n    EXPECT_NEAR(values[0], sin(1.5), ABS_TOL); \/\/ actual_sin\/sin\n    EXPECT_NEAR(values[2], sin(1.5), LOOSE_TOL); \/\/ deriv_approx_sin\/sin\n    csim_freeVector(values);\n}\n\nTEST(SBW, one_step_import) {\n    char* modelString;\n    int length;\n    int code = csim_serialiseCellmlFromUrl(\n                TestResources::getLocation(\n                    TestResources::CELLML_SINE_IMPORTS_MODEL_RESOURCE),\n                &modelString, &length);\n    \/\/ no point continuing if this fails\n    ASSERT_EQ(code, 0);\n    code = csim_loadCellml(modelString);\n    ASSERT_EQ(code, 0);\n    csim_freeVector(modelString);\n    double* values;\n    code = csim_setTolerances(1.0, 1.0, 10);\n    code = csim_oneStep(1.5);\n    EXPECT_EQ(code, 0);\n    \/\/ check the outputs\n    code = csim_getValues(&values, &length);\n    EXPECT_NEAR(values[4], 1.5, ABS_TOL); \/\/ main\/x\n    EXPECT_NEAR(values[1], sin(1.5), ABS_TOL); \/\/ main\/sin1 (actual sine)\n    EXPECT_NEAR(values[2], sin(1.5), LOOSE_TOL); \/\/ main\/sin2 (deriv approx)\n    EXPECT_NEAR(values[3], sin(1.5), LOOSE_TOL); \/\/ main\/sin3 (parabolic approx)\n    csim_freeVector(values);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cassert>\n#include <vector>\n#ifdef ENABLE_PROGRESS_THREAD\n#include <pthread.h>\n#endif\n#ifdef FLUSH_ALLOC_RETRY\n#include <algorithm> \/\/ std::min\n#include <unistd.h>  \/\/ usleep\n#define RETRY_MIN_INTERVAL 10\t    \/\/ ms\n#define RETRY_MAX_INTERVAL 1000\t    \/\/ ms\n#define RETRY_INTERVAL_FACTOR 2\n#define RETRY_MAX_ITER 100\n#endif\n#include <upcxx.h>\n\n#ifdef FLUSH_ALLOC_RETRY\n\/\/ retry remote allocation statement A with exponential backoff\n#ifdef FLUSH_WARN_ON_RETRY\n#define FLUSH_WARN_RETRY if ( iter > 0 ) printf( \"Warning: Thread %4i : ALLOC_WRAP required %li attempts\\n\", MYTHREAD, iter );\n#else\n#define FLUSH_WARN_RETRY \/* noop *\/\n#endif\n#define ALLOC_WRAP( A ) \\\n  do { \\\n    long iter = 0; \\\n    useconds_t t = RETRY_MIN_INTERVAL; \\\n    while ( ( A ).raw_ptr() == NULL && iter++ < RETRY_MAX_ITER ) { \\\n      usleep( 1000 * t ); \\\n      t = std::min( t * RETRY_INTERVAL_FACTOR, (useconds_t) RETRY_MAX_INTERVAL ); \\\n    } \\\n    FLUSH_WARN_RETRY \\\n  } while(0)\n#else\n\/\/ just try once\n#define ALLOC_WRAP( A ) A\n#endif\n\nnamespace cm\n{\n\n  \/\/\/ @cond INTERNAL_DOCS\n\n  \/**\n   * A task that performs remote updates (spawned by Bin<T>)\n   * \\param g_my_data Reference to local storage on the target\n   * \\param g_ix Reference to update indexing (already transferred target)\n   * \\param g_data Reference to update data (already transferred target)\n   *\/\n  template <typename T>\n  void\n  update_task( long size,\n               upcxx::global_ptr<T>    g_my_data,\n               upcxx::global_ptr<long> g_ix,\n               upcxx::global_ptr<T>    g_data )\n  {\n    \/\/ local ptrs (for casts)\n    long *p_ix;\n    T *p_data, *p_my_data;\n\n#ifndef NOCHECK\n    assert( g_my_data.where() == MYTHREAD );\n    assert( g_ix.where()      == MYTHREAD );\n    assert( g_data.where()    == MYTHREAD );\n#endif\n\n    \/\/ cast to local ptrs\n    p_ix = (long *) g_ix;\n    p_data = (T *) g_data;\n    p_my_data = (T *) g_my_data;\n\n    \/\/ update\n    for ( long k = 0; k < size; k++ )\n      p_my_data[p_ix[k]] += p_data[k];\n\n    \/\/ free local (but remotely allocated) storage\n    upcxx::deallocate( g_ix );\n    upcxx::deallocate( g_data );\n\n  } \/\/ end of update_task\n\n\n  \/**\n   * Implements the binning \/ remote application for a single thread\n   * Not very efficient in terms of space for the moment, in exchange for\n   * simplicity.\n   * \\tparam T Matrix data type (e.g. float)\n   *\/\n  template<typename T>\n  class Bin\n  {\n\n   private:\n\n    bool _init;                           \/\/ whether fields intialized\n    int _remote_tid;                      \/\/ thread id of target\n    upcxx::global_ptr<T> _g_remote_data;  \/\/ global_ptr _local_ to target\n    std::vector<long> _ix;                \/\/ linear indexing for target\n    std::vector<T> _data;                 \/\/ update data for target\n#ifdef ENABLE_PROGRESS_THREAD\n    pthread_mutex_t *_tq_mutex;           \/\/ mutex protecting task-queue ops\n#endif\n\n    inline void\n    clear()\n    {\n      _ix.clear();\n      _data.clear();\n    }\n\n   public:\n\n    \/**\n     * Create an uninitialized Bin object\n     *\/\n    Bin() :\n      _init(false)\n    {}\n\n#ifdef ENABLE_PROGRESS_THREAD\n    \/**\n     * Create the Bin object associated with a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     * \\param tq_mutex pthread mutex protecting the task queue and associated\n     * GASNet operations\n     *\/\n    Bin( upcxx::global_ptr<T> g_remote_data, pthread_mutex_t * tq_mutex ) :\n      _init(true),\n      _remote_tid(g_remote_data.where()),\n      _g_remote_data(g_remote_data),\n      _tq_mutex(tq_mutex)\n    {}\n\n    \/**\n     * Initialize the previously empty Bin object for a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     * \\param tq_mutex pthread mutex protecting the task queue and associated\n     * GASNet operations\n     *\n     * \\b Note: It is erroneous to call this on a previously initialized Bin.\n     *\/\n    inline void\n    init( upcxx::global_ptr<T> g_remote_data, pthread_mutex_t * tq_mutex )\n    {\n      assert( ! _init );\n      _remote_tid = g_remote_data.where();\n      _g_remote_data = g_remote_data;\n      _tq_mutex = tq_mutex;\n      _init = true;\n    }\n#else\n    \/**\n     * Create the Bin object associated with a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     *\/\n    Bin( upcxx::global_ptr<T> g_remote_data ) :\n      _init(true),\n      _remote_tid(g_remote_data.where()),\n      _g_remote_data(g_remote_data)\n    {}\n\n    \/**\n     * Initialize the previously empty Bin object for a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     *\n     * \\b Note: It is erroneous to call this on a previously initialized Bin.\n     *\/\n    inline void\n    init( upcxx::global_ptr<T> g_remote_data )\n    {\n      assert( ! _init );\n      _remote_tid = g_remote_data.where();\n      _g_remote_data = g_remote_data;\n      _init = true;\n    }\n#endif\n\n    \/**\n     * Current size of the bin (number of update elems not yet applied)\n     *\/\n    inline long\n    size() const\n    {\n      return _ix.size();\n    }\n\n    \/**\n     * Add an elemental update to this bin\n     * \\param data Elemental update (r.h.s. of +=)\n     * \\param ij Linear index (on the target) of element to be updated\n     *\/\n    inline void\n    append( T data, long ij )\n    {\n      _ix.push_back( ij );\n      _data.push_back( data );\n    }\n\n    \/**\n     * \"Flush\" this bin by initiate remote async update using the current bin\n     * contents.\n     * \\param e upcxx::event pointer to which the async task will be registered\n     *\/\n    void\n    flush( upcxx::event *e )\n    {\n#ifndef NOCHECK\n      assert( _init );\n#endif\n\n      \/\/ global ptrs to local storage for async remote copy\n      upcxx::global_ptr<long> g_ix;\n      upcxx::global_ptr<T> g_data;\n\n#ifdef ENABLE_PROGRESS_THREAD\n      pthread_mutex_lock( _tq_mutex );\n#endif\n\n      \/\/ allocate remote storage\n      ALLOC_WRAP( g_ix = upcxx::allocate<long>( _remote_tid, _ix.size() ) );\n#ifdef NOCHECK\n      assert( g_ix.raw_ptr() != NULL );\n#endif\n      ALLOC_WRAP( g_data = upcxx::allocate<T>( _remote_tid, _data.size() ) );\n#ifdef NOCHECK\n      assert( g_data.raw_ptr() != NULL );\n#endif\n\n      \/\/ copy to remote\n      upcxx::copy( (upcxx::global_ptr<long>) _ix.data(), g_ix, _ix.size() );\n      upcxx::copy( (upcxx::global_ptr<T>) _data.data(), g_data, _data.size() );\n\n      \/\/ spawn the remote update (responsible for deallocating g_ix, g_data)\n      upcxx::async( _remote_tid, e )( update_task<T>,\n                                      _data.size(),\n                                      _g_remote_data,\n                                      g_ix, g_data );\n\n#ifdef ENABLE_PROGRESS_THREAD\n      pthread_mutex_unlock( _tq_mutex );\n#endif\n\n      \/\/ clear internal (vector) storage\n      clear();\n    }\n\n  }; \/\/ end of Bin\n\n  \/\/\/ @endcond\n\n}\n<commit_msg>A little cleanup in FLUSH_ALLOC_RETRY<commit_after>#pragma once\n\n#include <cassert>\n#include <vector>\n#ifdef ENABLE_PROGRESS_THREAD\n#include <pthread.h>\n#endif\n#ifdef FLUSH_ALLOC_RETRY\n#include <algorithm> \/\/ std::min\n#include <unistd.h>  \/\/ usleep\n#define RETRY_MIN_INTERVAL 10\t    \/\/ ms\n#define RETRY_MAX_INTERVAL 1000\t    \/\/ ms\n#define RETRY_INTERVAL_FACTOR 2\n#define RETRY_MAX_ITER 100\n#endif\n#include <upcxx.h>\n\n#ifdef FLUSH_ALLOC_RETRY\n\/\/ retry remote allocation statement A with exponential backoff\n#ifdef FLUSH_WARN_ON_RETRY\n#define FLUSH_WARN_RETRY if ( iter > 0 ) \\\n  printf( \"Warning: Thread %4i : ALLOC_WRAP required %li attempts\\n\", \\\n\t  MYTHREAD, iter );\n#else\n#define FLUSH_WARN_RETRY \/* noop *\/\n#endif\n#define ALLOC_WRAP( A ) \\\n  do { \\\n    long iter = 0; \\\n    useconds_t t = RETRY_MIN_INTERVAL; \\\n    while ( ( A ).raw_ptr() == NULL && iter++ < RETRY_MAX_ITER ) { \\\n      usleep( 1000 * t ); \\\n      t = std::min( t * RETRY_INTERVAL_FACTOR, \\\n\t\t    (useconds_t) RETRY_MAX_INTERVAL ); \\\n    } \\\n    FLUSH_WARN_RETRY \\\n  } while(0)\n#else\n\/\/ identity\n#define ALLOC_WRAP( A ) A\n#endif\n\nnamespace cm\n{\n\n  \/\/\/ @cond INTERNAL_DOCS\n\n  \/**\n   * A task that performs remote updates (spawned by Bin<T>)\n   * \\param g_my_data Reference to local storage on the target\n   * \\param g_ix Reference to update indexing (already transferred target)\n   * \\param g_data Reference to update data (already transferred target)\n   *\/\n  template <typename T>\n  void\n  update_task( long size,\n               upcxx::global_ptr<T>    g_my_data,\n               upcxx::global_ptr<long> g_ix,\n               upcxx::global_ptr<T>    g_data )\n  {\n    \/\/ local ptrs (for casts)\n    long *p_ix;\n    T *p_data, *p_my_data;\n\n#ifndef NOCHECK\n    assert( g_my_data.where() == MYTHREAD );\n    assert( g_ix.where()      == MYTHREAD );\n    assert( g_data.where()    == MYTHREAD );\n#endif\n\n    \/\/ cast to local ptrs\n    p_ix = (long *) g_ix;\n    p_data = (T *) g_data;\n    p_my_data = (T *) g_my_data;\n\n    \/\/ update\n    for ( long k = 0; k < size; k++ )\n      p_my_data[p_ix[k]] += p_data[k];\n\n    \/\/ free local (but remotely allocated) storage\n    upcxx::deallocate( g_ix );\n    upcxx::deallocate( g_data );\n\n  } \/\/ end of update_task\n\n\n  \/**\n   * Implements the binning \/ remote application for a single thread\n   * Not very efficient in terms of space for the moment, in exchange for\n   * simplicity.\n   * \\tparam T Matrix data type (e.g. float)\n   *\/\n  template<typename T>\n  class Bin\n  {\n\n   private:\n\n    bool _init;                           \/\/ whether fields intialized\n    int _remote_tid;                      \/\/ thread id of target\n    upcxx::global_ptr<T> _g_remote_data;  \/\/ global_ptr _local_ to target\n    std::vector<long> _ix;                \/\/ linear indexing for target\n    std::vector<T> _data;                 \/\/ update data for target\n#ifdef ENABLE_PROGRESS_THREAD\n    pthread_mutex_t *_tq_mutex;           \/\/ mutex protecting task-queue ops\n#endif\n\n    inline void\n    clear()\n    {\n      _ix.clear();\n      _data.clear();\n    }\n\n   public:\n\n    \/**\n     * Create an uninitialized Bin object\n     *\/\n    Bin() :\n      _init(false)\n    {}\n\n#ifdef ENABLE_PROGRESS_THREAD\n    \/**\n     * Create the Bin object associated with a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     * \\param tq_mutex pthread mutex protecting the task queue and associated\n     * GASNet operations\n     *\/\n    Bin( upcxx::global_ptr<T> g_remote_data, pthread_mutex_t * tq_mutex ) :\n      _init(true),\n      _remote_tid(g_remote_data.where()),\n      _g_remote_data(g_remote_data),\n      _tq_mutex(tq_mutex)\n    {}\n\n    \/**\n     * Initialize the previously empty Bin object for a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     * \\param tq_mutex pthread mutex protecting the task queue and associated\n     * GASNet operations\n     *\n     * \\b Note: It is erroneous to call this on a previously initialized Bin.\n     *\/\n    inline void\n    init( upcxx::global_ptr<T> g_remote_data, pthread_mutex_t * tq_mutex )\n    {\n      assert( ! _init );\n      _remote_tid = g_remote_data.where();\n      _g_remote_data = g_remote_data;\n      _tq_mutex = tq_mutex;\n      _init = true;\n    }\n#else\n    \/**\n     * Create the Bin object associated with a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     *\/\n    Bin( upcxx::global_ptr<T> g_remote_data ) :\n      _init(true),\n      _remote_tid(g_remote_data.where()),\n      _g_remote_data(g_remote_data)\n    {}\n\n    \/**\n     * Initialize the previously empty Bin object for a given target\n     * \\param g_remote_data global_ptr<T> reference to the target-local storage\n     *\n     * \\b Note: It is erroneous to call this on a previously initialized Bin.\n     *\/\n    inline void\n    init( upcxx::global_ptr<T> g_remote_data )\n    {\n      assert( ! _init );\n      _remote_tid = g_remote_data.where();\n      _g_remote_data = g_remote_data;\n      _init = true;\n    }\n#endif\n\n    \/**\n     * Current size of the bin (number of update elems not yet applied)\n     *\/\n    inline long\n    size() const\n    {\n      return _ix.size();\n    }\n\n    \/**\n     * Add an elemental update to this bin\n     * \\param data Elemental update (r.h.s. of +=)\n     * \\param ij Linear index (on the target) of element to be updated\n     *\/\n    inline void\n    append( T data, long ij )\n    {\n      _ix.push_back( ij );\n      _data.push_back( data );\n    }\n\n    \/**\n     * \"Flush\" this bin by initiate remote async update using the current bin\n     * contents.\n     * \\param e upcxx::event pointer to which the async task will be registered\n     *\/\n    void\n    flush( upcxx::event *e )\n    {\n#ifndef NOCHECK\n      assert( _init );\n#endif\n\n      \/\/ global ptrs to local storage for async remote copy\n      upcxx::global_ptr<long> g_ix;\n      upcxx::global_ptr<T> g_data;\n\n#ifdef ENABLE_PROGRESS_THREAD\n      pthread_mutex_lock( _tq_mutex );\n#endif\n\n      \/\/ allocate remote storage\n      ALLOC_WRAP( g_ix = upcxx::allocate<long>( _remote_tid, _ix.size() ) );\n#ifdef NOCHECK\n      assert( g_ix.raw_ptr() != NULL );\n#endif\n      ALLOC_WRAP( g_data = upcxx::allocate<T>( _remote_tid, _data.size() ) );\n#ifdef NOCHECK\n      assert( g_data.raw_ptr() != NULL );\n#endif\n\n      \/\/ copy to remote\n      upcxx::copy( (upcxx::global_ptr<long>) _ix.data(), g_ix, _ix.size() );\n      upcxx::copy( (upcxx::global_ptr<T>) _data.data(), g_data, _data.size() );\n\n      \/\/ spawn the remote update (responsible for deallocating g_ix, g_data)\n      upcxx::async( _remote_tid, e )( update_task<T>,\n                                      _data.size(),\n                                      _g_remote_data,\n                                      g_ix, g_data );\n\n#ifdef ENABLE_PROGRESS_THREAD\n      pthread_mutex_unlock( _tq_mutex );\n#endif\n\n      \/\/ clear internal (vector) storage\n      clear();\n    }\n\n  }; \/\/ end of Bin\n\n  \/\/\/ @endcond\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"cpputil.hh\"\n#include \"ns.hh\"\n#include \"gc.hh\"\n#include \"atomic.hh\"\n#include \"ref.hh\"\n\nu64 namehash(const strbuf<DIRSIZ>&);\n\nstruct file : public referenced, public rcu_freed {\n  static file* alloc();\n  file*        dup();\n  int          stat(struct stat*);\n  int          read(char *addr, int n);\n  ssize_t      pread(char *addr, size_t n, off_t offset);\n  int          write(const char *addr, int n);\n\n  enum { FD_NONE, FD_PIPE, FD_INODE, FD_SOCKET } type;  \n\n  char readable;\n  char writable;\n\n  int socket;\n  struct pipe *pipe;\n  struct inode *ip;\n  u32 off;\n\n  virtual void do_gc(void);\n\nprivate:\n  file();\n  file& operator=(const file&);\n  file(const file& x);\n  NEW_DELETE_OPS(file);\n\nprotected:\n  virtual void onzero() const;\n};\n\n\/\/ in-core file system types\n\nstruct inode : public rcu_freed {\n  u32 dev;           \/\/ Device number\n  u32 inum;          \/\/ Inode number\n  u32 gen;           \/\/ Generation number\n  std::atomic<int> ref; \/\/ Reference count\n  int flags;         \/\/ I_BUSY, I_VALID\n  std::atomic<int> readbusy;\n  struct condvar cv;\n  struct spinlock lock;\n  char lockname[16];\n  std::atomic<xns<strbuf<DIRSIZ>, u32, namehash>*> dir;\n\n  short type;         \/\/ copy of disk inode\n  short major;\n  short minor;\n  short nlink;\n  u32 size;\n  u32 addrs[NDIRECT+1];\n\n  static inode* alloc(u32 dev, u32 inum);\n  void init();\n  inode();\n  ~inode();\n  virtual void do_gc() { delete this; }\n  NEW_DELETE_OPS(inode)\n};\n\n#define I_BUSYR 0x1\n#define I_BUSYW 0x2\n#define I_VALID 0x4\n#define I_FREE 0x8\n\n\n\/\/ device implementations\n\nstruct devsw {\n  int (*read)(struct inode*, char*, u32, u32);\n  int (*write)(struct inode*, const char*, u32, u32);\n  void (*stat)(struct inode*, struct stat*);\n};\n\nextern struct devsw devsw[];\n<commit_msg>inode class definition nits<commit_after>#pragma once\n\n#include \"cpputil.hh\"\n#include \"ns.hh\"\n#include \"gc.hh\"\n#include \"atomic.hh\"\n#include \"ref.hh\"\n\nu64 namehash(const strbuf<DIRSIZ>&);\n\nstruct file : public referenced, public rcu_freed {\n  static file* alloc();\n  file*        dup();\n  int          stat(struct stat*);\n  int          read(char *addr, int n);\n  ssize_t      pread(char *addr, size_t n, off_t offset);\n  int          write(const char *addr, int n);\n\n  enum { FD_NONE, FD_PIPE, FD_INODE, FD_SOCKET } type;  \n\n  char readable;\n  char writable;\n\n  int socket;\n  struct pipe *pipe;\n  struct inode *ip;\n  u32 off;\n\n  virtual void do_gc(void);\n\nprivate:\n  file();\n  file& operator=(const file&);\n  file(const file& x);\n  NEW_DELETE_OPS(file);\n\nprotected:\n  virtual void onzero() const;\n};\n\n\/\/ in-core file system types\n\nstruct inode : public rcu_freed\n{\n  static inode* alloc(u32 dev, u32 inum);\n  virtual void do_gc() { delete this; }\n  void init();\n\n  inode& operator=(const inode&) = delete;\n  inode(const inode& x) = delete;\n  \n  u32 dev;           \/\/ Device number\n  u32 inum;          \/\/ Inode number\n  u32 gen;           \/\/ Generation number\n  std::atomic<int> ref; \/\/ Reference count\n  int flags;         \/\/ I_BUSY, I_VALID\n  std::atomic<int> readbusy;\n  struct condvar cv;\n  struct spinlock lock;\n  char lockname[16];\n  std::atomic<xns<strbuf<DIRSIZ>, u32, namehash>*> dir;\n\n  short type;         \/\/ copy of disk inode\n  short major;\n  short minor;\n  short nlink;\n  u32 size;\n  u32 addrs[NDIRECT+1];\n\nprivate:\n  inode();\n  ~inode();\n  NEW_DELETE_OPS(inode)\n};\n\n#define I_BUSYR 0x1\n#define I_BUSYW 0x2\n#define I_VALID 0x4\n#define I_FREE 0x8\n\n\n\/\/ device implementations\n\nstruct devsw {\n  int (*read)(struct inode*, char*, u32, u32);\n  int (*write)(struct inode*, const char*, u32, u32);\n  void (*stat)(struct inode*, struct stat*);\n};\n\nextern struct devsw devsw[];\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: strarray.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2006-10-12 12:27: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_svx.hxx\"\n\n#ifndef _SHL_HXX \/\/autogen\n#include <tools\/shl.hxx>\n#endif\n\n\/\/ include ---------------------------------------------------------------\n\n#include \"dialogs.hrc\" \/\/ -> RID_SVXSTR_LANGUAGE_TABLE\n#include \"dialmgr.hxx\"\n#include \"strarray.hxx\"\n\n\/\/------------------------------------------------------------------------\n\nSvxStringArray::SvxStringArray( USHORT nResId ) :\n\n    ResStringArray( SVX_RES( nResId ) )\n\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSvxStringArray::SvxStringArray( const ResId& rResId ) :\n    ResStringArray( rResId )\n{\n}\n\n\n\/\/------------------------------------------------------------------------\n\nSvxStringArray::~SvxStringArray()\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nconst String& SvxStringArray::GetStringByPos( USHORT nPos ) const\n{\n    if ( RESARRAY_INDEX_NOTFOUND != nPos && nPos < Count() )\n        return ResStringArray::GetString( nPos );\n    else\n        return String::EmptyString();\n}\n\n\/\/------------------------------------------------------------------------\n\nconst String& SvxStringArray::GetStringByType( long nType ) const\n{\n    sal_uInt32 nPos = FindIndex( nType );\n\n    if ( RESARRAY_INDEX_NOTFOUND != nPos && nPos < Count() )\n        return ResStringArray::GetString( nPos );\n    else\n        return String::EmptyString();\n}\n\n\/\/------------------------------------------------------------------------\n\nlong SvxStringArray::GetValueByStr( const String& rStr ) const\n{\n    long nType = 0;\n    sal_uInt32 nCount = Count();\n\n    for ( sal_uInt32 i = 0; i < nCount; ++i )\n        if ( rStr == ResStringArray::GetString( i ) )\n        {\n            nType = GetValue( i );\n            break;\n        }\n    return nType;\n}\n\n\n<commit_msg>INTEGRATION: CWS residcleanup (1.5.230); FILE MERGED 2007\/02\/21 22:04:12 pl 1.5.230.1: #i74635# get rid of global ResMgr<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: strarray.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-26 07:43:39 $\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_svx.hxx\"\n\n#ifndef _SHL_HXX \/\/autogen\n#include <tools\/shl.hxx>\n#endif\n\n\/\/ include ---------------------------------------------------------------\n\n#include \"dialogs.hrc\" \/\/ -> RID_SVXSTR_LANGUAGE_TABLE\n#include \"dialmgr.hxx\"\n#include \"strarray.hxx\"\n\n\/\/------------------------------------------------------------------------\n\nSvxStringArray::SvxStringArray( sal_uInt32 nResId ) :\n\n    ResStringArray( SVX_RES( nResId ) )\n\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSvxStringArray::SvxStringArray( const ResId& rResId ) :\n    ResStringArray( rResId )\n{\n}\n\n\n\/\/------------------------------------------------------------------------\n\nSvxStringArray::~SvxStringArray()\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nconst String& SvxStringArray::GetStringByPos( sal_uInt32 nPos ) const\n{\n    if ( RESARRAY_INDEX_NOTFOUND != nPos && nPos < Count() )\n        return ResStringArray::GetString( nPos );\n    else\n        return String::EmptyString();\n}\n\n\/\/------------------------------------------------------------------------\n\nconst String& SvxStringArray::GetStringByType( long nType ) const\n{\n    sal_uInt32 nPos = FindIndex( nType );\n\n    if ( RESARRAY_INDEX_NOTFOUND != nPos && nPos < Count() )\n        return ResStringArray::GetString( nPos );\n    else\n        return String::EmptyString();\n}\n\n\/\/------------------------------------------------------------------------\n\nlong SvxStringArray::GetValueByStr( const String& rStr ) const\n{\n    long nType = 0;\n    sal_uInt32 nCount = Count();\n\n    for ( sal_uInt32 i = 0; i < nCount; ++i )\n        if ( rStr == ResStringArray::GetString( i ) )\n        {\n            nType = GetValue( i );\n            break;\n        }\n    return nType;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: swafopt.cxx,v $\n *\n *  $Revision: 1.1.1.1 $\n *\n *  last change: $Author: hr $ $Date: 2000-09-18 17:01: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\n#pragma hdrstop\n\n#ifndef _SV_KEYCODES_HXX \/\/autogen\n#include <vcl\/keycodes.hxx>\n#endif\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\n#include \"swafopt.hxx\"\n\n#if defined UNX\n\n#if defined GCC\nextern const sal_Char __FAR_DATA sBulletFntName[];\nconst sal_Char __FAR_DATA sBulletFntName[] = \"starbats\";\n#else\nextern const sal_Char __FAR_DATA sBulletFntName[] = \"starbats\";\n#endif\n\n#else\nextern const sal_Char __FAR_DATA sBulletFntName[] = \"StarBats\";\n#endif\n\n\/\/ !! JP - 17.04.00: which value becomes this Bulletchar\n\/\/                   in the Unicode Version?\nconst sal_Char cBulletChar  = '\\x95';   \/\/ character for Aufzaehlungen\n\n\/*------------------------------------------------------------------------\n Beschreibung:\n------------------------------------------------------------------------*\/\n\nSvxSwAutoFmtFlags::SvxSwAutoFmtFlags()\n    : aBulletFont( String( sBulletFntName, RTL_TEXTENCODING_MS_1252 ),\n                    Size( 0, 14 ) )\n{\n    bReplaceQuote =\n    bAutoCorrect =\n    bCptlSttSntnc =\n    bCptlSttWrd =\n    bChkFontAttr =\n    bChgUserColl =\n    bChgEnumNum =\n    bChgFracionSymbol =\n    bChgOrdinalNumber =\n    bChgToEnEmDash =\n    bChgWeightUnderl =\n    bSetINetAttr =\n    bAFmtDelSpacesAtSttEnd =\n    bAFmtDelSpacesBetweenLines =\n    bAFmtByInpDelSpacesAtSttEnd =\n    bAFmtByInpDelSpacesBetweenLines =\n    bDummy = TRUE;\n\n    bReplaceStyles =\n    bDelEmptyNode =\n    bWithRedlining =\n    bAutoCmpltEndless =\n    bAutoCmpltAppendBlanc =\n    bAutoCmpltShowAsTip = FALSE;\n\n    bSetBorder =\n    bCreateTable =\n    bSetNumRule =\n    bAFmtByInput =\n    bRightMargin =\n    bAutoCompleteWords =\n    bAutoCmpltCollectWords = TRUE;\n\n    bDummy4 = bDummy5 = bDummy6 = bDummy7 = bDummy8 =\n         FALSE;\n\n    nRightMargin = 50;      \/\/ dflt. 50 %\n    nAutoCmpltExpandKey = KEY_RETURN;\n\n    aBulletFont.SetCharSet( RTL_TEXTENCODING_SYMBOL );\n    aBulletFont.SetFamily( FAMILY_DONTKNOW );\n    aBulletFont.SetPitch( PITCH_DONTKNOW );\n    aBulletFont.SetWeight( WEIGHT_DONTKNOW );\n    aBulletFont.SetTransparent( TRUE );\n\n    cBullet = ByteString::ConvertToUnicode( cBulletChar,\n                                            RTL_TEXTENCODING_SYMBOL );\n    cByInputBullet = cBullet;\n    aByInputBulletFont = aBulletFont;\n\n    nAutoCmpltWordLen = 10;\n    nAutoCmpltListLen = 500;\n    pAutoCmpltList = 0;\n}\n\n\nSvxSwAutoFmtFlags& SvxSwAutoFmtFlags::operator=( const SvxSwAutoFmtFlags& rAFFlags )\n{\n    bAutoCorrect = rAFFlags.bAutoCorrect;\n    bReplaceQuote = rAFFlags.bReplaceQuote;\n    bCptlSttSntnc = rAFFlags.bCptlSttSntnc;\n    bCptlSttWrd = rAFFlags.bCptlSttWrd;\n    bChkFontAttr = rAFFlags.bChkFontAttr;\n\n    bChgUserColl = rAFFlags.bChgUserColl;\n    bChgEnumNum = rAFFlags.bChgEnumNum;\n    bDelEmptyNode = rAFFlags.bDelEmptyNode;\n    bSetNumRule = rAFFlags.bSetNumRule;\n    bAFmtByInput = rAFFlags.bAFmtByInput;\n\n    bChgFracionSymbol = rAFFlags.bChgFracionSymbol;\n    bChgOrdinalNumber = rAFFlags.bChgOrdinalNumber;\n    bChgToEnEmDash = rAFFlags.bChgToEnEmDash;\n    bChgWeightUnderl = rAFFlags.bChgWeightUnderl;\n    bSetINetAttr = rAFFlags.bSetINetAttr;\n    bSetBorder = rAFFlags.bSetBorder;\n    bCreateTable = rAFFlags.bCreateTable;\n    bReplaceStyles = rAFFlags.bReplaceStyles;\n    bAFmtDelSpacesAtSttEnd = rAFFlags.bAFmtDelSpacesAtSttEnd;\n    bAFmtDelSpacesBetweenLines = rAFFlags.bAFmtDelSpacesBetweenLines;\n    bAFmtByInpDelSpacesAtSttEnd = rAFFlags.bAFmtByInpDelSpacesAtSttEnd;\n    bAFmtByInpDelSpacesBetweenLines = rAFFlags.bAFmtByInpDelSpacesBetweenLines;\n\n    bDummy = rAFFlags.bDummy;\n\n    bDummy4 = rAFFlags.bDummy4;\n    bDummy5 = rAFFlags.bDummy5;\n    bDummy6 = rAFFlags.bDummy6;\n    bDummy7 = rAFFlags.bDummy7;\n    bDummy8 = rAFFlags.bDummy8;\n\n    bWithRedlining = rAFFlags.bWithRedlining;\n\n    bRightMargin = rAFFlags.bRightMargin;\n    nRightMargin = rAFFlags.nRightMargin;\n\n    cBullet = rAFFlags.cBullet;\n    aBulletFont = rAFFlags.aBulletFont;\n\n    cByInputBullet = rAFFlags.cByInputBullet;\n    aByInputBulletFont = rAFFlags.aByInputBulletFont;\n\n    bAutoCompleteWords = rAFFlags.bAutoCompleteWords;\n    bAutoCmpltCollectWords = rAFFlags.bAutoCmpltCollectWords;\n    bAutoCmpltEndless = rAFFlags.bAutoCmpltEndless;\n    bAutoCmpltAppendBlanc = rAFFlags.bAutoCmpltAppendBlanc;\n    bAutoCmpltShowAsTip = rAFFlags.bAutoCmpltShowAsTip;\n    pAutoCmpltList = rAFFlags.pAutoCmpltList;\n    nAutoCmpltExpandKey = rAFFlags.nAutoCmpltExpandKey;\n\n    nAutoCmpltWordLen = rAFFlags.nAutoCmpltWordLen;\n    nAutoCmpltListLen = rAFFlags.nAutoCmpltListLen;\n\n    return *this;\n}\n\n<commit_msg>Bug #9110#\/#88107#: changes for StarBats -> StarSymbol<commit_after>\/*************************************************************************\n *\n *  $RCSfile: swafopt.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: jp $ $Date: 2001-08-16 12:49: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#pragma hdrstop\n\n#ifndef _SV_KEYCODES_HXX \/\/autogen\n#include <vcl\/keycodes.hxx>\n#endif\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\n#include \"swafopt.hxx\"\n\n\/*------------------------------------------------------------------------\n Beschreibung:\n------------------------------------------------------------------------*\/\n\nSvxSwAutoFmtFlags::SvxSwAutoFmtFlags()\n    : aBulletFont( String::CreateFromAscii(\n                        RTL_CONSTASCII_STRINGPARAM( \"StarSymbol\" )),\n                    Size( 0, 14 ) )\n{\n    bReplaceQuote =\n    bAutoCorrect =\n    bCptlSttSntnc =\n    bCptlSttWrd =\n    bChkFontAttr =\n    bChgUserColl =\n    bChgEnumNum =\n    bChgFracionSymbol =\n    bChgOrdinalNumber =\n    bChgToEnEmDash =\n    bChgWeightUnderl =\n    bSetINetAttr =\n    bAFmtDelSpacesAtSttEnd =\n    bAFmtDelSpacesBetweenLines =\n    bAFmtByInpDelSpacesAtSttEnd =\n    bAFmtByInpDelSpacesBetweenLines =\n    bDummy = TRUE;\n\n    bReplaceStyles =\n    bDelEmptyNode =\n    bWithRedlining =\n    bAutoCmpltEndless =\n    bAutoCmpltAppendBlanc =\n    bAutoCmpltShowAsTip = FALSE;\n\n    bSetBorder =\n    bCreateTable =\n    bSetNumRule =\n    bAFmtByInput =\n    bRightMargin =\n    bAutoCompleteWords =\n    bAutoCmpltCollectWords = TRUE;\n\n    bDummy4 = bDummy5 = bDummy6 = bDummy7 = bDummy8 =\n         FALSE;\n\n    nRightMargin = 50;      \/\/ dflt. 50 %\n    nAutoCmpltExpandKey = KEY_RETURN;\n\n    aBulletFont.SetCharSet( RTL_TEXTENCODING_SYMBOL );\n    aBulletFont.SetFamily( FAMILY_DONTKNOW );\n    aBulletFont.SetPitch( PITCH_DONTKNOW );\n    aBulletFont.SetWeight( WEIGHT_DONTKNOW );\n    aBulletFont.SetTransparent( TRUE );\n\n    cBullet = 0x2022;\n    cByInputBullet = cBullet;\n    aByInputBulletFont = aBulletFont;\n\n    nAutoCmpltWordLen = 10;\n    nAutoCmpltListLen = 500;\n    pAutoCmpltList = 0;\n}\n\n\nSvxSwAutoFmtFlags& SvxSwAutoFmtFlags::operator=( const SvxSwAutoFmtFlags& rAFFlags )\n{\n    bAutoCorrect = rAFFlags.bAutoCorrect;\n    bReplaceQuote = rAFFlags.bReplaceQuote;\n    bCptlSttSntnc = rAFFlags.bCptlSttSntnc;\n    bCptlSttWrd = rAFFlags.bCptlSttWrd;\n    bChkFontAttr = rAFFlags.bChkFontAttr;\n\n    bChgUserColl = rAFFlags.bChgUserColl;\n    bChgEnumNum = rAFFlags.bChgEnumNum;\n    bDelEmptyNode = rAFFlags.bDelEmptyNode;\n    bSetNumRule = rAFFlags.bSetNumRule;\n    bAFmtByInput = rAFFlags.bAFmtByInput;\n\n    bChgFracionSymbol = rAFFlags.bChgFracionSymbol;\n    bChgOrdinalNumber = rAFFlags.bChgOrdinalNumber;\n    bChgToEnEmDash = rAFFlags.bChgToEnEmDash;\n    bChgWeightUnderl = rAFFlags.bChgWeightUnderl;\n    bSetINetAttr = rAFFlags.bSetINetAttr;\n    bSetBorder = rAFFlags.bSetBorder;\n    bCreateTable = rAFFlags.bCreateTable;\n    bReplaceStyles = rAFFlags.bReplaceStyles;\n    bAFmtDelSpacesAtSttEnd = rAFFlags.bAFmtDelSpacesAtSttEnd;\n    bAFmtDelSpacesBetweenLines = rAFFlags.bAFmtDelSpacesBetweenLines;\n    bAFmtByInpDelSpacesAtSttEnd = rAFFlags.bAFmtByInpDelSpacesAtSttEnd;\n    bAFmtByInpDelSpacesBetweenLines = rAFFlags.bAFmtByInpDelSpacesBetweenLines;\n\n    bDummy = rAFFlags.bDummy;\n\n    bDummy4 = rAFFlags.bDummy4;\n    bDummy5 = rAFFlags.bDummy5;\n    bDummy6 = rAFFlags.bDummy6;\n    bDummy7 = rAFFlags.bDummy7;\n    bDummy8 = rAFFlags.bDummy8;\n\n    bWithRedlining = rAFFlags.bWithRedlining;\n\n    bRightMargin = rAFFlags.bRightMargin;\n    nRightMargin = rAFFlags.nRightMargin;\n\n    cBullet = rAFFlags.cBullet;\n    aBulletFont = rAFFlags.aBulletFont;\n\n    cByInputBullet = rAFFlags.cByInputBullet;\n    aByInputBulletFont = rAFFlags.aByInputBulletFont;\n\n    bAutoCompleteWords = rAFFlags.bAutoCompleteWords;\n    bAutoCmpltCollectWords = rAFFlags.bAutoCmpltCollectWords;\n    bAutoCmpltEndless = rAFFlags.bAutoCmpltEndless;\n    bAutoCmpltAppendBlanc = rAFFlags.bAutoCmpltAppendBlanc;\n    bAutoCmpltShowAsTip = rAFFlags.bAutoCmpltShowAsTip;\n    pAutoCmpltList = rAFFlags.pAutoCmpltList;\n    nAutoCmpltExpandKey = rAFFlags.nAutoCmpltExpandKey;\n\n    nAutoCmpltWordLen = rAFFlags.nAutoCmpltWordLen;\n    nAutoCmpltListLen = rAFFlags.nAutoCmpltListLen;\n\n    return *this;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>-Werror,-Wunused-const-variable<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: porexp.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: fme $ $Date: 2002-02-28 12:42: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 _POREXP_HXX\n#define _POREXP_HXX\n\n#include \"portxt.hxx\"\n\n\/*************************************************************************\n *                      class SwExpandPortion\n *************************************************************************\/\n\nclass SwExpandPortion : public SwTxtPortion\n{\npublic:\n    inline  SwExpandPortion() { SetWhichPor( POR_EXP ); }\n    virtual sal_Bool Format( SwTxtFormatInfo &rInf );\n    virtual xub_StrLen GetCrsrOfst( const MSHORT nOfst ) const;\n    virtual sal_Bool GetExpTxt( const SwTxtSizeInfo &rInf, XubString &rTxt ) const;\n    virtual SwPosSize GetTxtSize( const SwTxtSizeInfo &rInfo ) const;\n    virtual void Paint( const SwTxtPaintInfo &rInf ) const;\n\n    \/\/ Accessibility: pass information about this portion to the PortionHandler\n    virtual void HandlePortion( SwPortionHandler& rPH ) const;\n\n    OUTPUT_OPERATOR\n};\n\n\n\/*************************************************************************\n *                      class SwBlankPortion\n *************************************************************************\/\n\nclass SwBlankPortion : public SwExpandPortion\n{\n    xub_Unicode cChar;\n    BOOL bMulti;        \/\/ For multiportion brackets\npublic:\n    inline  SwBlankPortion( xub_Unicode cCh, BOOL bMult = sal_False )\n        : cChar( cCh ), bMulti( bMult )\n        { cChar = cCh; SetLen(1); SetWhichPor( POR_BLANK ); }\n\n    BOOL IsMulti() const { return bMulti; }\n    void SetMulti( BOOL bNew ) { bMulti = bNew; }\n\n    virtual SwLinePortion *Compress();\n    virtual sal_Bool GetExpTxt( const SwTxtSizeInfo &rInf, XubString &rTxt ) const;\n    virtual void FormatEOL( SwTxtFormatInfo &rInf );\n    virtual sal_Bool Format( SwTxtFormatInfo &rInf );\n    virtual void Paint( const SwTxtPaintInfo &rInf ) const;\n    MSHORT MayUnderFlow( const SwTxtFormatInfo &rInf, xub_StrLen nIdx,\n        sal_Bool bUnderFlow ) const;\n\n    \/\/ Accessibility: pass information about this portion to the PortionHandler\n    virtual void HandlePortion( SwPortionHandler& rPH ) const;\n\n    OUTPUT_OPERATOR\n};\n\n\/*************************************************************************\n *                      class SwPostItsPortion\n *************************************************************************\/\n\nclass SwPostItsPortion : public SwExpandPortion\n{\n    KSHORT  nViewWidth;\n    sal_Bool    bScript;\npublic:\n            SwPostItsPortion( sal_Bool bScrpt );\n    virtual void Paint( const SwTxtPaintInfo &rInf ) const;\n    virtual sal_Bool Format( SwTxtFormatInfo &rInf );\n    virtual KSHORT GetViewWidth( const SwTxtSizeInfo &rInf ) const;\n    virtual sal_Bool GetExpTxt( const SwTxtSizeInfo &rInf, XubString &rTxt ) const;\n    sal_Bool IsScript() const { return bScript; }\n    OUTPUT_OPERATOR\n};\n\n\nCLASSIO( SwExpandPortion )\nCLASSIO( SwBlankPortion )\nCLASSIO( SwPostItsPortion )\n\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.5.1426); FILE MERGED 2005\/09\/05 13:40:54 rt 1.5.1426.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: porexp.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 04:57: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#ifndef _POREXP_HXX\n#define _POREXP_HXX\n\n#include \"portxt.hxx\"\n\n\/*************************************************************************\n *                      class SwExpandPortion\n *************************************************************************\/\n\nclass SwExpandPortion : public SwTxtPortion\n{\npublic:\n    inline  SwExpandPortion() { SetWhichPor( POR_EXP ); }\n    virtual sal_Bool Format( SwTxtFormatInfo &rInf );\n    virtual xub_StrLen GetCrsrOfst( const MSHORT nOfst ) const;\n    virtual sal_Bool GetExpTxt( const SwTxtSizeInfo &rInf, XubString &rTxt ) const;\n    virtual SwPosSize GetTxtSize( const SwTxtSizeInfo &rInfo ) const;\n    virtual void Paint( const SwTxtPaintInfo &rInf ) const;\n\n    \/\/ Accessibility: pass information about this portion to the PortionHandler\n    virtual void HandlePortion( SwPortionHandler& rPH ) const;\n\n    OUTPUT_OPERATOR\n};\n\n\n\/*************************************************************************\n *                      class SwBlankPortion\n *************************************************************************\/\n\nclass SwBlankPortion : public SwExpandPortion\n{\n    xub_Unicode cChar;\n    BOOL bMulti;        \/\/ For multiportion brackets\npublic:\n    inline  SwBlankPortion( xub_Unicode cCh, BOOL bMult = sal_False )\n        : cChar( cCh ), bMulti( bMult )\n        { cChar = cCh; SetLen(1); SetWhichPor( POR_BLANK ); }\n\n    BOOL IsMulti() const { return bMulti; }\n    void SetMulti( BOOL bNew ) { bMulti = bNew; }\n\n    virtual SwLinePortion *Compress();\n    virtual sal_Bool GetExpTxt( const SwTxtSizeInfo &rInf, XubString &rTxt ) const;\n    virtual void FormatEOL( SwTxtFormatInfo &rInf );\n    virtual sal_Bool Format( SwTxtFormatInfo &rInf );\n    virtual void Paint( const SwTxtPaintInfo &rInf ) const;\n    MSHORT MayUnderFlow( const SwTxtFormatInfo &rInf, xub_StrLen nIdx,\n        sal_Bool bUnderFlow ) const;\n\n    \/\/ Accessibility: pass information about this portion to the PortionHandler\n    virtual void HandlePortion( SwPortionHandler& rPH ) const;\n\n    OUTPUT_OPERATOR\n};\n\n\/*************************************************************************\n *                      class SwPostItsPortion\n *************************************************************************\/\n\nclass SwPostItsPortion : public SwExpandPortion\n{\n    KSHORT  nViewWidth;\n    sal_Bool    bScript;\npublic:\n            SwPostItsPortion( sal_Bool bScrpt );\n    virtual void Paint( const SwTxtPaintInfo &rInf ) const;\n    virtual sal_Bool Format( SwTxtFormatInfo &rInf );\n    virtual KSHORT GetViewWidth( const SwTxtSizeInfo &rInf ) const;\n    virtual sal_Bool GetExpTxt( const SwTxtSizeInfo &rInf, XubString &rTxt ) const;\n    sal_Bool IsScript() const { return bScript; }\n    OUTPUT_OPERATOR\n};\n\n\nCLASSIO( SwExpandPortion )\nCLASSIO( SwBlankPortion )\nCLASSIO( SwPostItsPortion )\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: txtnum.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2004-05-10 16:37: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): _______________________________________\n *\n *\n ************************************************************************\/\n\n#pragma hdrstop\n\n#include <hintids.hxx>\n#ifndef _MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX \/\/autogen\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SVX_NUMITEM_HXX \/\/autogen\n#include <svx\/numitem.hxx>\n#endif\n#ifndef _SVX_BRSHITEM_HXX \/\/autogen wg. SvxBrushItem\n#include <svx\/brshitem.hxx>\n#endif\n\n#include \"cmdid.h\"\n#include \"wrtsh.hxx\"\n#include \"view.hxx\"\n#include \"viewopt.hxx\"\n#include \"wdocsh.hxx\"\n#include \"textsh.hxx\"\n#include \"uiitems.hxx\"\n\/\/CHINA001 #include \"num.hxx\"\n#include \"swabstdlg.hxx\" \/\/CHINA001\n#include <globals.hrc> \/\/CHINA001\n#include <sfx2\/tabdlg.hxx> \/\/CHINA001\n\nvoid SwTextShell::ExecEnterNum(SfxRequest &rReq)\n{\n    \/\/wg. Aufzeichnung schon vor dem evtl. Shellwechsel\n    switch(rReq.GetSlot())\n    {\n    case FN_NUM_NUMBERING_ON:\n    {\n        SFX_REQUEST_ARG( rReq, pItem, SfxBoolItem, FN_PARAM_1 , sal_False );\n        BOOL bMode = !GetShell().GetCurNumRule();\n        if ( pItem )\n            bMode = pItem->GetValue();\n        else\n            rReq.AppendItem( SfxBoolItem( FN_PARAM_1, bMode ) );\n        if ( bMode != (GetShell().GetCurNumRule()!=NULL) )\n        {\n            rReq.Done();\n            if( bMode )\n                GetShell().NumOn();\n            else\n                GetShell().DelNumRules();\n        }\n    }\n    break;\n    case FN_NUM_BULLET_ON:\n    {\n        SFX_REQUEST_ARG( rReq, pItem, SfxBoolItem, FN_PARAM_1 , sal_False );\n        BOOL bMode = !GetShell().GetCurNumRule();\n        if ( pItem )\n            bMode = pItem->GetValue();\n        else\n            rReq.AppendItem( SfxBoolItem( FN_PARAM_1, bMode ) );\n        if ( bMode != (GetShell().GetCurNumRule()!=NULL) )\n        {\n            rReq.Done();\n            if( bMode )\n                GetShell().BulletOn();\n            else\n                GetShell().DelNumRules();\n        }\n    }\n    break;\n    case FN_NUMBER_BULLETS:\n    {\n        \/\/ per default TRUE, damit die Schleife im Dialog richtig arbeitet!\n        BOOL bHasChild = TRUE;\n        SfxItemSet aSet(GetPool(),\n                SID_HTML_MODE, SID_HTML_MODE,\n                SID_ATTR_NUMBERING_RULE, SID_PARAM_CUR_NUM_LEVEL,\n                0 );\n        SwDocShell* pDocSh = GetView().GetDocShell();\n        BOOL bHtml = 0 != PTR_CAST(SwWebDocShell, pDocSh);\n        const SwNumRule* pCurRule = GetShell().GetCurNumRule();\n        if( pCurRule )\n        {\n            SvxNumRule aRule = pCurRule->MakeSvxNumRule();\n\n            \/\/convert type of linked bitmaps from SVX_NUM_BITMAP to (SVX_NUM_BITMAP|LINK_TOKEN)\n            for(USHORT i = 0; i < aRule.GetLevelCount(); i++)\n            {\n                SvxNumberFormat aFmt(aRule.GetLevel(i));\n                if(SVX_NUM_BITMAP == aFmt.GetNumberingType())\n                {\n                    const SvxBrushItem* pBrush = aFmt.GetBrush();\n                    const String* pLinkStr;\n                    if(pBrush &&\n                        0 != (pLinkStr = pBrush->GetGraphicLink()) &&\n                            pLinkStr->Len())\n                        aFmt.SetNumberingType(SvxExtNumType(SVX_NUM_BITMAP|LINK_TOKEN));\n                    aRule.SetLevel(i, aFmt, aRule.Get(i) != 0);\n                }\n            }\n            if(bHtml)\n                aRule.SetFeatureFlag(NUM_ENABLE_EMBEDDED_BMP, FALSE);\n\n            aSet.Put(SvxNumBulletItem(aRule));\n            USHORT nLevel = GetRealLevel(GetShell().GetNumLevel( &bHasChild ));\n            if( nLevel < MAXLEVEL )\n            {\n                nLevel = 1<<nLevel;\n                aSet.Put( SfxUInt16Item( SID_PARAM_CUR_NUM_LEVEL, nLevel ));\n            }\n        }\n        else\n        {\n            SwNumRule aRule( GetShell().GetUniqueNumRuleName() );\n            SvxNumRule aSvxRule = aRule.MakeSvxNumRule();\n            if(bHtml)\n            {\n                for( BYTE n = 1; n < MAXLEVEL; ++n )\n                {\n                    SvxNumberFormat aFmt( aSvxRule.GetLevel( n ) );\n                    \/\/ 1\/2\" fuer HTML\n                    aFmt.SetLSpace(720);\n                    aFmt.SetAbsLSpace(n * 720);\n                    aSvxRule.SetLevel( n, aFmt, FALSE );\n                }\n                aSvxRule.SetFeatureFlag(NUM_ENABLE_EMBEDDED_BMP, FALSE);\n            }\n            aSet.Put(SvxNumBulletItem(aSvxRule));\n        }\n\n        aSet.Put( SfxBoolItem( SID_PARAM_CHILD_LEVELS, bHasChild ));\n        aSet.Put( SfxBoolItem( SID_PARAM_NUM_PRESET,FALSE ));\n\n        \/\/ vor dem Dialog wird der HtmlMode an der DocShell versenkt\n        pDocSh->PutItem(SfxUInt16Item(SID_HTML_MODE, ::GetHtmlMode(pDocSh)));\n\n\/\/CHINA001      SwSvxNumBulletTabDialog* pDlg = new SwSvxNumBulletTabDialog(\n\/\/CHINA001      GetView().GetWindow(), &aSet, GetShell() );\n        SwAbstractDialogFactory* pFact = SwAbstractDialogFactory::Create();\n        DBG_ASSERT(pFact, \"Dialogdiet fail!\");\/\/CHINA001\n        SfxAbstractTabDialog* pDlg = pFact->CreateSwTabDialog( ResId(DLG_SVXTEST_NUM_BULLET),\n                                                        GetView().GetWindow(), &aSet, GetShell());\n        DBG_ASSERT(pDlg, \"Dialogdiet fail!\");\/\/CHINA001\n        USHORT nRet = pDlg->Execute();\n        const SfxPoolItem* pItem;\n        if( RET_OK == nRet )\n        {\n            if( SFX_ITEM_SET == pDlg->GetOutputItemSet()->GetItemState( SID_ATTR_NUMBERING_RULE, FALSE, &pItem ))\n            {\n                rReq.AppendItem(*pItem);\n                rReq.Done();\n                SvxNumRule* pSetRule = ((SvxNumBulletItem*)pItem)->GetNumRule();\n                pSetRule->UnLinkGraphics();\n                SwNumRule aSetRule( pCurRule\n                                        ? pCurRule->GetName()\n                                        : GetShell().GetUniqueNumRuleName());\n                aSetRule.SetSvxRule( *pSetRule, GetShell().GetDoc());\n                aSetRule.SetAutoRule( TRUE );\n                GetShell().SetCurNumRule( aSetRule );\n            }\n            \/\/ wenn der Dialog mit OK verlassen wurde, aber nichts ausgewaehlt\n            \/\/ wurde dann muss die Numerierung zumindest eingeschaltet werden,\n            \/\/ wenn sie das noch nicht ist\n            else if( !pCurRule && SFX_ITEM_SET == aSet.GetItemState( SID_ATTR_NUMBERING_RULE, FALSE, &pItem ))\n            {\n                rReq.AppendItem( *pItem );\n                rReq.Done();\n                SvxNumRule* pSetRule = ((SvxNumBulletItem*)pItem)->GetNumRule();\n                SwNumRule aSetRule(GetShell().GetUniqueNumRuleName());\n                aSetRule.SetSvxRule(*pSetRule, GetShell().GetDoc());\n                aSetRule.SetAutoRule( TRUE );\n                GetShell().SetCurNumRule( aSetRule );\n            }\n        }\n        else if(RET_USER == nRet)\n            GetShell().DelNumRules();\n\n        delete pDlg;\n    }\n    break;\n    default:\n        ASSERT(FALSE,  falscher Dispatcher);\n        return;\n    }\n}\n\n\n<commit_msg>INTEGRATION: CWS hbea1bugs01 (1.7.118); FILE MERGED 2004\/05\/27 09:24:36 hbrinkm 1.7.118.1: #i29560#<commit_after>\/*************************************************************************\n *\n *  $RCSfile: txtnum.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: kz $ $Date: 2004-06-11 15:23: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\n#pragma hdrstop\n\n#include <hintids.hxx>\n#ifndef _MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX \/\/autogen\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SVX_NUMITEM_HXX \/\/autogen\n#include <svx\/numitem.hxx>\n#endif\n#ifndef _SVX_BRSHITEM_HXX \/\/autogen wg. SvxBrushItem\n#include <svx\/brshitem.hxx>\n#endif\n\n#include \"cmdid.h\"\n#include \"wrtsh.hxx\"\n#include \"view.hxx\"\n#include \"viewopt.hxx\"\n#include \"wdocsh.hxx\"\n#include \"textsh.hxx\"\n#include \"uiitems.hxx\"\n\/\/CHINA001 #include \"num.hxx\"\n#include \"swabstdlg.hxx\" \/\/CHINA001\n#include <globals.hrc> \/\/CHINA001\n#include <sfx2\/tabdlg.hxx> \/\/CHINA001\n\nvoid SwTextShell::ExecEnterNum(SfxRequest &rReq)\n{\n    \/\/wg. Aufzeichnung schon vor dem evtl. Shellwechsel\n    switch(rReq.GetSlot())\n    {\n    case FN_NUM_NUMBERING_ON:\n    {\n        SFX_REQUEST_ARG( rReq, pItem, SfxBoolItem, FN_PARAM_1 , sal_False );\n        BOOL bMode = !GetShell().HasNumber(); \/\/ #i29560#\n        if ( pItem )\n            bMode = pItem->GetValue();\n        else\n            rReq.AppendItem( SfxBoolItem( FN_PARAM_1, bMode ) );\n\n        if ( bMode != (GetShell().HasNumber()) ) \/\/ #i29560#\n        {\n            rReq.Done();\n            if( bMode )\n                GetShell().NumOn();\n            else\n                GetShell().NumOrBulletOff(); \/\/ #i29560#\n        }\n    }\n    break;\n    case FN_NUM_BULLET_ON:\n    {\n        SFX_REQUEST_ARG( rReq, pItem, SfxBoolItem, FN_PARAM_1 , sal_False );\n        BOOL bMode = !GetShell().HasBullet(); \/\/ #i29560#\n        if ( pItem )\n            bMode = pItem->GetValue();\n        else\n            rReq.AppendItem( SfxBoolItem( FN_PARAM_1, bMode ) );\n\n        if ( bMode != (GetShell().HasBullet()) ) \/\/ #i29560#\n        {\n            rReq.Done();\n            if( bMode )\n                GetShell().BulletOn();\n            else\n                GetShell().NumOrBulletOff(); \/\/ #i29560#\n        }\n    }\n    break;\n    case FN_NUMBER_BULLETS:\n    {\n        \/\/ per default TRUE, damit die Schleife im Dialog richtig arbeitet!\n        BOOL bHasChild = TRUE;\n        SfxItemSet aSet(GetPool(),\n                SID_HTML_MODE, SID_HTML_MODE,\n                SID_ATTR_NUMBERING_RULE, SID_PARAM_CUR_NUM_LEVEL,\n                0 );\n        SwDocShell* pDocSh = GetView().GetDocShell();\n        BOOL bHtml = 0 != PTR_CAST(SwWebDocShell, pDocSh);\n        const SwNumRule* pCurRule = GetShell().GetCurNumRule();\n        if( pCurRule )\n        {\n            SvxNumRule aRule = pCurRule->MakeSvxNumRule();\n\n            \/\/convert type of linked bitmaps from SVX_NUM_BITMAP to (SVX_NUM_BITMAP|LINK_TOKEN)\n            for(USHORT i = 0; i < aRule.GetLevelCount(); i++)\n            {\n                SvxNumberFormat aFmt(aRule.GetLevel(i));\n                if(SVX_NUM_BITMAP == aFmt.GetNumberingType())\n                {\n                    const SvxBrushItem* pBrush = aFmt.GetBrush();\n                    const String* pLinkStr;\n                    if(pBrush &&\n                        0 != (pLinkStr = pBrush->GetGraphicLink()) &&\n                            pLinkStr->Len())\n                        aFmt.SetNumberingType(SvxExtNumType(SVX_NUM_BITMAP|LINK_TOKEN));\n                    aRule.SetLevel(i, aFmt, aRule.Get(i) != 0);\n                }\n            }\n            if(bHtml)\n                aRule.SetFeatureFlag(NUM_ENABLE_EMBEDDED_BMP, FALSE);\n\n            aSet.Put(SvxNumBulletItem(aRule));\n            USHORT nLevel = GetRealLevel(GetShell().GetNumLevel( &bHasChild ));\n            if( nLevel < MAXLEVEL )\n            {\n                nLevel = 1<<nLevel;\n                aSet.Put( SfxUInt16Item( SID_PARAM_CUR_NUM_LEVEL, nLevel ));\n            }\n        }\n        else\n        {\n            SwNumRule aRule( GetShell().GetUniqueNumRuleName() );\n            SvxNumRule aSvxRule = aRule.MakeSvxNumRule();\n            if(bHtml)\n            {\n                for( BYTE n = 1; n < MAXLEVEL; ++n )\n                {\n                    SvxNumberFormat aFmt( aSvxRule.GetLevel( n ) );\n                    \/\/ 1\/2\" fuer HTML\n                    aFmt.SetLSpace(720);\n                    aFmt.SetAbsLSpace(n * 720);\n                    aSvxRule.SetLevel( n, aFmt, FALSE );\n                }\n                aSvxRule.SetFeatureFlag(NUM_ENABLE_EMBEDDED_BMP, FALSE);\n            }\n            aSet.Put(SvxNumBulletItem(aSvxRule));\n        }\n\n        aSet.Put( SfxBoolItem( SID_PARAM_CHILD_LEVELS, bHasChild ));\n        aSet.Put( SfxBoolItem( SID_PARAM_NUM_PRESET,FALSE ));\n\n        \/\/ vor dem Dialog wird der HtmlMode an der DocShell versenkt\n        pDocSh->PutItem(SfxUInt16Item(SID_HTML_MODE, ::GetHtmlMode(pDocSh)));\n\n\/\/CHINA001      SwSvxNumBulletTabDialog* pDlg = new SwSvxNumBulletTabDialog(\n\/\/CHINA001      GetView().GetWindow(), &aSet, GetShell() );\n        SwAbstractDialogFactory* pFact = SwAbstractDialogFactory::Create();\n        DBG_ASSERT(pFact, \"Dialogdiet fail!\");\/\/CHINA001\n        SfxAbstractTabDialog* pDlg = pFact->CreateSwTabDialog( ResId(DLG_SVXTEST_NUM_BULLET),\n                                                        GetView().GetWindow(), &aSet, GetShell());\n        DBG_ASSERT(pDlg, \"Dialogdiet fail!\");\/\/CHINA001\n        USHORT nRet = pDlg->Execute();\n        const SfxPoolItem* pItem;\n        if( RET_OK == nRet )\n        {\n            if( SFX_ITEM_SET == pDlg->GetOutputItemSet()->GetItemState( SID_ATTR_NUMBERING_RULE, FALSE, &pItem ))\n            {\n                rReq.AppendItem(*pItem);\n                rReq.Done();\n                SvxNumRule* pSetRule = ((SvxNumBulletItem*)pItem)->GetNumRule();\n                pSetRule->UnLinkGraphics();\n                SwNumRule aSetRule( pCurRule\n                                        ? pCurRule->GetName()\n                                        : GetShell().GetUniqueNumRuleName());\n                aSetRule.SetSvxRule( *pSetRule, GetShell().GetDoc());\n                aSetRule.SetAutoRule( TRUE );\n                GetShell().SetCurNumRule( aSetRule );\n            }\n            \/\/ wenn der Dialog mit OK verlassen wurde, aber nichts ausgewaehlt\n            \/\/ wurde dann muss die Numerierung zumindest eingeschaltet werden,\n            \/\/ wenn sie das noch nicht ist\n            else if( !pCurRule && SFX_ITEM_SET == aSet.GetItemState( SID_ATTR_NUMBERING_RULE, FALSE, &pItem ))\n            {\n                rReq.AppendItem( *pItem );\n                rReq.Done();\n                SvxNumRule* pSetRule = ((SvxNumBulletItem*)pItem)->GetNumRule();\n                SwNumRule aSetRule(GetShell().GetUniqueNumRuleName());\n                aSetRule.SetSvxRule(*pSetRule, GetShell().GetDoc());\n                aSetRule.SetAutoRule( TRUE );\n                GetShell().SetCurNumRule( aSetRule );\n            }\n        }\n        else if(RET_USER == nRet)\n            GetShell().DelNumRules();\n\n        delete pDlg;\n    }\n    break;\n    default:\n        ASSERT(FALSE,  falscher Dispatcher);\n        return;\n    }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: convert.cxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: kz $ $Date: 2007-09-06 14:08: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sw.hxx\"\n\n\n#ifdef SW_DLLIMPLEMENTATION\n#undef SW_DLLIMPLEMENTATION\n#endif\n\n\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXVIEWFRM_HXX \/\/autogen\n#include <sfx2\/viewfrm.hxx>\n#endif\n\n#ifndef _MODOPT_HXX \/\/autogen\n#include <modcfg.hxx>\n#endif\n#ifndef _SVX_HTMLMODE_HXX \/\/autogen\n#include <svx\/htmlmode.hxx>\n#endif\n#ifndef _VIEWOPT_HXX\n#include <viewopt.hxx>\n#endif\n#include \"swmodule.hxx\"\n#include \"cmdid.h\"\n#include \"convert.hxx\"\n#include \"tablemgr.hxx\"\n#include \"wrtsh.hxx\"\n#include \"view.hxx\"\n\/\/CHINA001 #include \"tautofmt.hxx\"\n#include \"tblafmt.hxx\"\n\n#include \"table.hrc\"\n#include \"convert.hrc\"\n#include \"swabstdlg.hxx\" \/\/CHINA001\n\nnamespace swui\n{\n    SwAbstractDialogFactory * GetFactory();\n}\n\n\/\/keep the state of the buttons on runtime\nstatic int nSaveButtonState = -1; \/\/ 0: tab, 1: semicolon, 2: paragraph, 3: other, -1: not yet used\nstatic sal_Bool bIsKeepColumn = sal_True;\nstatic sal_Unicode uOther = ',';\n\nvoid SwConvertTableDlg::GetValues(  sal_Unicode& rDelim,\n                                    SwInsertTableOptions& rInsTblOpts,\n                                    SwTableAutoFmt *& prTAFmt )\n{\n    if( aTabBtn.IsChecked() )\n    {\n        \/\/0x0b mustn't be set when re-converting table into text\n        bIsKeepColumn = !aKeepColumn.IsVisible() || aKeepColumn.IsChecked();\n        rDelim = bIsKeepColumn ? 0x09 : 0x0b;\n        nSaveButtonState = 0;\n    }\n    else if( aSemiBtn.IsChecked() )\n    {\n        rDelim = ';';\n        nSaveButtonState = 1;\n    }\n    else if( aOtherBtn.IsChecked() && aOtherEd.GetText().Len() )\n    {\n        uOther = aOtherEd.GetText().GetChar( 0 );\n        rDelim = uOther;\n        nSaveButtonState = 3;\n    }\n    else\n    {\n        nSaveButtonState = 2;\n        rDelim = cParaDelim;\n        if(aOtherBtn.IsChecked())\n        {\n            nSaveButtonState = 3;\n            uOther = 0;\n        }\n    }\n\n\n    USHORT nInsMode = 0;\n    if (aBorderCB.IsChecked())\n        nInsMode |= tabopts::DEFAULT_BORDER;\n    if (aHeaderCB.IsChecked())\n        nInsMode |= tabopts::HEADLINE;\n    if (aRepeatHeaderCB.IsEnabled() && aRepeatHeaderCB.IsChecked())\n        rInsTblOpts.mnRowsToRepeat = USHORT( aRepeatHeaderNF.GetValue() );\n    else\n        rInsTblOpts.mnRowsToRepeat = 0;\n    if (!aDontSplitCB.IsChecked())\n        nInsMode |= tabopts::SPLIT_LAYOUT;\n\n    if( pTAutoFmt )\n        prTAFmt = new SwTableAutoFmt( *pTAutoFmt );\n\n    rInsTblOpts.mnInsMode = nInsMode;\n}\n\n\nSwConvertTableDlg::SwConvertTableDlg( SwView& rView, bool bToTable )\n\n    : SfxModalDialog( &rView.GetViewFrame()->GetWindow(), SW_RES(DLG_CONV_TEXT_TABLE)),\n\n#ifdef _MSC_VER\n#pragma warning (disable : 4355)\n#endif\n    aTabBtn         (this, SW_RES(CB_TAB)),\n    aSemiBtn        (this, SW_RES(CB_SEMI)),\n    aParaBtn        (this, SW_RES(CB_PARA)),\n    aDelimFL       (this, SW_RES(FL_DELIM)),\n    aOtherBtn       (this, SW_RES(RB_OTHER)),\n    aOtherEd        (this, SW_RES(ED_OTHER)),\n    aKeepColumn     (this, SW_RES(CB_KEEPCOLUMN)),\n    aHeaderCB       (this, SW_RES(CB_HEADER)),\n    aRepeatHeaderCB (this, SW_RES(CB_REPEAT_HEADER)),\n    aRepeatHeaderFT         (this, SW_RES(FT_REPEAT_HEADER)),\n    aRepeatHeaderBeforeFT   (this),\n    aRepeatHeaderNF         (this, SW_RES(NF_REPEAT_HEADER)),\n    aRepeatHeaderAfterFT    (this),\n    aRepeatHeaderCombo      (this, SW_RES(WIN_REPEAT_HEADER), aRepeatHeaderNF, aRepeatHeaderBeforeFT, aRepeatHeaderAfterFT),\n\n    aDontSplitCB    (this, SW_RES(CB_DONT_SPLIT)),\n    aBorderCB       (this, SW_RES(CB_BORDER)),\n    aOptionsFL      (this, SW_RES(FL_OPTIONS)),\n\n    aOkBtn(this,SW_RES(BT_OK)),\n    aCancelBtn(this,SW_RES(BT_CANCEL)),\n    aHelpBtn(this, SW_RES(BT_HELP)),\n    aAutoFmtBtn(this,SW_RES(BT_AUTOFORMAT)),\n#ifdef _MSC_VER\n#pragma warning (default : 4355)\n#endif\n\n    pTAutoFmt( 0 ),\n    pShell( &rView.GetWrtShell() ),\n    sConvertTextTable(SW_RES(STR_CONVERT_TEXT_TABLE))\n{\n    FreeResource();\n    if(nSaveButtonState > -1)\n    {\n        switch (nSaveButtonState)\n        {\n            case 0:\n                aTabBtn.Check();\n                aKeepColumn.Check(bIsKeepColumn);\n            break;\n            case 1: aSemiBtn.Check();break;\n            case 2: aParaBtn.Check();break;\n            case 3:\n                aOtherBtn.Check();\n                if(uOther)\n                    aOtherEd.SetText(uOther);\n            break;\n        }\n\n    }\n    if( bToTable )\n    {\n        SetText( sConvertTextTable );\n        aAutoFmtBtn.SetClickHdl(LINK(this, SwConvertTableDlg, AutoFmtHdl));\n        aAutoFmtBtn.Show();\n        aKeepColumn.Show();\n        aKeepColumn.Enable( aTabBtn.IsChecked() );\n        aRepeatHeaderCombo.Arrange( aRepeatHeaderFT );\n    }\n    else\n    {\n        \/\/Einfuege-Optionen verstecken\n        aHeaderCB          .Show(FALSE);\n        aRepeatHeaderCB    .Show(FALSE);\n        aDontSplitCB       .Show(FALSE);\n        aBorderCB          .Show(FALSE);\n        aOptionsFL         .Show(FALSE);\n        aRepeatHeaderCombo.Show(FALSE);\n\n        \/\/Groesse anpassen\n        Size aSize(GetSizePixel());\n        aSize.Height() = 8 + aHelpBtn.GetSizePixel().Height() + aHelpBtn.GetPosPixel().Y();\n        SetOutputSizePixel(aSize);\n    }\n    aKeepColumn.SaveValue();\n\n    Link aLk( LINK(this, SwConvertTableDlg, BtnHdl) );\n    aTabBtn.SetClickHdl( aLk );\n    aSemiBtn.SetClickHdl( aLk );\n    aParaBtn.SetClickHdl( aLk );\n    aOtherBtn.SetClickHdl(aLk );\n    aOtherEd.Enable( aOtherBtn.IsChecked() );\n\n    const SwModuleOptions* pModOpt = SW_MOD()->GetModuleConfig();\n\n    BOOL bHTMLMode = 0 != (::GetHtmlMode(rView.GetDocShell())&HTMLMODE_ON);\n\n    SwInsertTableOptions aInsOpts = pModOpt->GetInsTblFlags(bHTMLMode);\n    USHORT nInsTblFlags = aInsOpts.mnInsMode;\n\n    aHeaderCB.Check(nInsTblFlags & tabopts::HEADLINE);\n    aRepeatHeaderCB.Check(aInsOpts.mnRowsToRepeat > 0);\n    aDontSplitCB.Check(!(nInsTblFlags & tabopts::SPLIT_LAYOUT));\n    aBorderCB.Check(nInsTblFlags & tabopts::DEFAULT_BORDER);\n\n    aHeaderCB.SetClickHdl(LINK(this, SwConvertTableDlg, CheckBoxHdl));\n    aRepeatHeaderCB.SetClickHdl(LINK(this, SwConvertTableDlg, ReapeatHeaderCheckBoxHdl));\n    ReapeatHeaderCheckBoxHdl();\n    CheckBoxHdl();\n}\n\nSwConvertTableDlg:: ~SwConvertTableDlg()\n{\n    delete pTAutoFmt;\n}\n\nIMPL_LINK( SwConvertTableDlg, AutoFmtHdl, PushButton*, pButton )\n{\n    \/\/CHINA001 SwAutoFormatDlg aDlg( pButton, pShell, FALSE, pTAutoFmt );\n    SwAbstractDialogFactory* pFact = swui::GetFactory();\/\/CHINA001\n    DBG_ASSERT(pFact, \"SwAbstractDialogFactory fail!\");\/\/CHINA001\n\n    AbstractSwAutoFormatDlg* pDlg = pFact->CreateSwAutoFormatDlg(pButton, pShell, DLG_AUTOFMT_TABLE, FALSE, pTAutoFmt);\n    DBG_ASSERT(pDlg, \"Dialogdiet fail!\");\/\/CHINA001\n    if( RET_OK == pDlg->Execute()) \/\/CHINA001  if( RET_OK == aDlg.Execute())\n        pDlg->FillAutoFmtOfIndex( pTAutoFmt ); \/\/CHINA001  aDlg.FillAutoFmtOfIndex( pTAutoFmt );\n    delete pDlg; \/\/CHINA001\n    return 0;\n}\n\nIMPL_LINK( SwConvertTableDlg, BtnHdl, Button*, pButton )\n{\n    if( pButton == &aTabBtn )\n        aKeepColumn.SetState( aKeepColumn.GetSavedValue() );\n    else\n    {\n        if( aKeepColumn.IsEnabled() )\n            aKeepColumn.SaveValue();\n        aKeepColumn.Check( TRUE );\n    }\n    aKeepColumn.Enable( aTabBtn.IsChecked() );\n    aOtherEd.Enable( aOtherBtn.IsChecked() );\n    return 0;\n}\n\n\/*********************************************************************\/\n\/*                                                                   *\/\n\/*********************************************************************\/\n\nIMPL_LINK(SwConvertTableDlg, CheckBoxHdl, CheckBox*, EMPTYARG)\n{\n    aRepeatHeaderCB.Enable(aHeaderCB.IsChecked());\n    ReapeatHeaderCheckBoxHdl();\n\n    return 0;\n}\n\nIMPL_LINK(SwConvertTableDlg, ReapeatHeaderCheckBoxHdl, void*, EMPTYARG)\n{\n    sal_Bool bEnable = aHeaderCB.IsChecked() && aRepeatHeaderCB.IsChecked();\n    aRepeatHeaderBeforeFT.Enable(bEnable);\n    aRepeatHeaderAfterFT.Enable(bEnable);\n    aRepeatHeaderNF.Enable(bEnable);\n\n    return 0;\n}\n<commit_msg>INTEGRATION: CWS swwarnings (1.12.222); FILE MERGED 2007\/05\/29 14:14:21 os 1.12.222.4: RESYNC: (1.12-1.13); FILE MERGED 2007\/04\/13 12:18:16 tl 1.12.222.3: #i69287# binfilter related comments removed 2007\/04\/11 07:03:36 tl 1.12.222.2: #i69287# warning-free code 2007\/02\/28 12:22:19 os 1.12.222.1: #i69287# warnings removed<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: convert.cxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-27 12:32:53 $\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#ifdef SW_DLLIMPLEMENTATION\n#undef SW_DLLIMPLEMENTATION\n#endif\n\n\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXVIEWFRM_HXX \/\/autogen\n#include <sfx2\/viewfrm.hxx>\n#endif\n\n#ifndef _MODOPT_HXX \/\/autogen\n#include <modcfg.hxx>\n#endif\n#ifndef _SVX_HTMLMODE_HXX \/\/autogen\n#include <svx\/htmlmode.hxx>\n#endif\n#ifndef _VIEWOPT_HXX\n#include <viewopt.hxx>\n#endif\n#include \"swmodule.hxx\"\n#include \"cmdid.h\"\n#include \"convert.hxx\"\n#include \"tablemgr.hxx\"\n#include \"wrtsh.hxx\"\n#include \"view.hxx\"\n#include \"tblafmt.hxx\"\n\n#include \"table.hrc\"\n#include \"convert.hrc\"\n#include \"swabstdlg.hxx\"\n\nnamespace swui\n{\n    SwAbstractDialogFactory * GetFactory();\n}\n\n\/\/keep the state of the buttons on runtime\nstatic int nSaveButtonState = -1; \/\/ 0: tab, 1: semicolon, 2: paragraph, 3: other, -1: not yet used\nstatic sal_Bool bIsKeepColumn = sal_True;\nstatic sal_Unicode uOther = ',';\n\nvoid SwConvertTableDlg::GetValues(  sal_Unicode& rDelim,\n                                    SwInsertTableOptions& rInsTblOpts,\n                                    SwTableAutoFmt *& prTAFmt )\n{\n    if( aTabBtn.IsChecked() )\n    {\n        \/\/0x0b mustn't be set when re-converting table into text\n        bIsKeepColumn = !aKeepColumn.IsVisible() || aKeepColumn.IsChecked();\n        rDelim = bIsKeepColumn ? 0x09 : 0x0b;\n        nSaveButtonState = 0;\n    }\n    else if( aSemiBtn.IsChecked() )\n    {\n        rDelim = ';';\n        nSaveButtonState = 1;\n    }\n    else if( aOtherBtn.IsChecked() && aOtherEd.GetText().Len() )\n    {\n        uOther = aOtherEd.GetText().GetChar( 0 );\n        rDelim = uOther;\n        nSaveButtonState = 3;\n    }\n    else\n    {\n        nSaveButtonState = 2;\n        rDelim = cParaDelim;\n        if(aOtherBtn.IsChecked())\n        {\n            nSaveButtonState = 3;\n            uOther = 0;\n        }\n    }\n\n\n    USHORT nInsMode = 0;\n    if (aBorderCB.IsChecked())\n        nInsMode |= tabopts::DEFAULT_BORDER;\n    if (aHeaderCB.IsChecked())\n        nInsMode |= tabopts::HEADLINE;\n    if (aRepeatHeaderCB.IsEnabled() && aRepeatHeaderCB.IsChecked())\n        rInsTblOpts.mnRowsToRepeat = USHORT( aRepeatHeaderNF.GetValue() );\n    else\n        rInsTblOpts.mnRowsToRepeat = 0;\n    if (!aDontSplitCB.IsChecked())\n        nInsMode |= tabopts::SPLIT_LAYOUT;\n\n    if( pTAutoFmt )\n        prTAFmt = new SwTableAutoFmt( *pTAutoFmt );\n\n    rInsTblOpts.mnInsMode = nInsMode;\n}\n\n\nSwConvertTableDlg::SwConvertTableDlg( SwView& rView, bool bToTable )\n\n    : SfxModalDialog( &rView.GetViewFrame()->GetWindow(), SW_RES(DLG_CONV_TEXT_TABLE)),\n#ifdef MSC\n#pragma warning (disable : 4355)\n#endif\n    aTabBtn         (this, SW_RES(CB_TAB)),\n    aSemiBtn        (this, SW_RES(CB_SEMI)),\n    aParaBtn        (this, SW_RES(CB_PARA)),\n    aOtherBtn       (this, SW_RES(RB_OTHER)),\n    aOtherEd        (this, SW_RES(ED_OTHER)),\n    aKeepColumn     (this, SW_RES(CB_KEEPCOLUMN)),\n    aDelimFL       (this, SW_RES(FL_DELIM)),\n\n    aHeaderCB       (this, SW_RES(CB_HEADER)),\n    aRepeatHeaderCB (this, SW_RES(CB_REPEAT_HEADER)),\n\n    aRepeatHeaderFT         (this, SW_RES(FT_REPEAT_HEADER)),\n    aRepeatHeaderBeforeFT   (this),\n    aRepeatHeaderNF         (this, SW_RES(NF_REPEAT_HEADER)),\n    aRepeatHeaderAfterFT    (this),\n    aRepeatHeaderCombo      (this, SW_RES(WIN_REPEAT_HEADER), aRepeatHeaderNF, aRepeatHeaderBeforeFT, aRepeatHeaderAfterFT),\n\n    aDontSplitCB    (this, SW_RES(CB_DONT_SPLIT)),\n    aBorderCB       (this, SW_RES(CB_BORDER)),\n    aOptionsFL      (this, SW_RES(FL_OPTIONS)),\n\n    aOkBtn(this,SW_RES(BT_OK)),\n    aCancelBtn(this,SW_RES(BT_CANCEL)),\n    aHelpBtn(this, SW_RES(BT_HELP)),\n    aAutoFmtBtn(this,SW_RES(BT_AUTOFORMAT)),\n#ifdef MSC\n#pragma warning (default : 4355)\n#endif\n    sConvertTextTable(SW_RES(STR_CONVERT_TEXT_TABLE)),\n    pTAutoFmt( 0 ),\n    pShell( &rView.GetWrtShell() )\n{\n    FreeResource();\n    if(nSaveButtonState > -1)\n    {\n        switch (nSaveButtonState)\n        {\n            case 0:\n                aTabBtn.Check();\n                aKeepColumn.Check(bIsKeepColumn);\n            break;\n            case 1: aSemiBtn.Check();break;\n            case 2: aParaBtn.Check();break;\n            case 3:\n                aOtherBtn.Check();\n                if(uOther)\n                    aOtherEd.SetText(uOther);\n            break;\n        }\n\n    }\n    if( bToTable )\n    {\n        SetText( sConvertTextTable );\n        aAutoFmtBtn.SetClickHdl(LINK(this, SwConvertTableDlg, AutoFmtHdl));\n        aAutoFmtBtn.Show();\n        aKeepColumn.Show();\n        aKeepColumn.Enable( aTabBtn.IsChecked() );\n        aRepeatHeaderCombo.Arrange( aRepeatHeaderFT );\n    }\n    else\n    {\n        \/\/Einfuege-Optionen verstecken\n        aHeaderCB          .Show(FALSE);\n        aRepeatHeaderCB    .Show(FALSE);\n        aDontSplitCB       .Show(FALSE);\n        aBorderCB          .Show(FALSE);\n        aOptionsFL         .Show(FALSE);\n        aRepeatHeaderCombo.Show(FALSE);\n\n        \/\/Groesse anpassen\n        Size aSize(GetSizePixel());\n        aSize.Height() = 8 + aHelpBtn.GetSizePixel().Height() + aHelpBtn.GetPosPixel().Y();\n        SetOutputSizePixel(aSize);\n    }\n    aKeepColumn.SaveValue();\n\n    Link aLk( LINK(this, SwConvertTableDlg, BtnHdl) );\n    aTabBtn.SetClickHdl( aLk );\n    aSemiBtn.SetClickHdl( aLk );\n    aParaBtn.SetClickHdl( aLk );\n    aOtherBtn.SetClickHdl(aLk );\n    aOtherEd.Enable( aOtherBtn.IsChecked() );\n\n    const SwModuleOptions* pModOpt = SW_MOD()->GetModuleConfig();\n\n    BOOL bHTMLMode = 0 != (::GetHtmlMode(rView.GetDocShell())&HTMLMODE_ON);\n\n    SwInsertTableOptions aInsOpts = pModOpt->GetInsTblFlags(bHTMLMode);\n    USHORT nInsTblFlags = aInsOpts.mnInsMode;\n\n    aHeaderCB.Check( 0 != (nInsTblFlags & tabopts::HEADLINE) );\n    aRepeatHeaderCB.Check(aInsOpts.mnRowsToRepeat > 0);\n    aDontSplitCB.Check( 0 == (nInsTblFlags & tabopts::SPLIT_LAYOUT));\n    aBorderCB.Check( 0!= (nInsTblFlags & tabopts::DEFAULT_BORDER) );\n\n    aHeaderCB.SetClickHdl(LINK(this, SwConvertTableDlg, CheckBoxHdl));\n    aRepeatHeaderCB.SetClickHdl(LINK(this, SwConvertTableDlg, ReapeatHeaderCheckBoxHdl));\n    ReapeatHeaderCheckBoxHdl();\n    CheckBoxHdl();\n}\n\nSwConvertTableDlg:: ~SwConvertTableDlg()\n{\n    delete pTAutoFmt;\n}\n\nIMPL_LINK( SwConvertTableDlg, AutoFmtHdl, PushButton*, pButton )\n{\n    SwAbstractDialogFactory* pFact = swui::GetFactory();\n    DBG_ASSERT(pFact, \"SwAbstractDialogFactory fail!\");\n\n    AbstractSwAutoFormatDlg* pDlg = pFact->CreateSwAutoFormatDlg(pButton, pShell, DLG_AUTOFMT_TABLE, FALSE, pTAutoFmt);\n    DBG_ASSERT(pDlg, \"Dialogdiet fail!\");\n    if( RET_OK == pDlg->Execute())\n        pDlg->FillAutoFmtOfIndex( pTAutoFmt );\n    delete pDlg;\n    return 0;\n}\n\nIMPL_LINK( SwConvertTableDlg, BtnHdl, Button*, pButton )\n{\n    if( pButton == &aTabBtn )\n        aKeepColumn.SetState( aKeepColumn.GetSavedValue() );\n    else\n    {\n        if( aKeepColumn.IsEnabled() )\n            aKeepColumn.SaveValue();\n        aKeepColumn.Check( TRUE );\n    }\n    aKeepColumn.Enable( aTabBtn.IsChecked() );\n    aOtherEd.Enable( aOtherBtn.IsChecked() );\n    return 0;\n}\n\n\/*********************************************************************\/\n\/*                                                                   *\/\n\/*********************************************************************\/\n\nIMPL_LINK(SwConvertTableDlg, CheckBoxHdl, CheckBox*, EMPTYARG)\n{\n    aRepeatHeaderCB.Enable(aHeaderCB.IsChecked());\n    ReapeatHeaderCheckBoxHdl();\n\n    return 0;\n}\n\nIMPL_LINK(SwConvertTableDlg, ReapeatHeaderCheckBoxHdl, void*, EMPTYARG)\n{\n    sal_Bool bEnable = aHeaderCB.IsChecked() && aRepeatHeaderCB.IsChecked();\n    aRepeatHeaderBeforeFT.Enable(bEnable);\n    aRepeatHeaderAfterFT.Enable(bEnable);\n    aRepeatHeaderNF.Enable(bEnable);\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Transformations for begin, cobegin, and on statements\n\/\/\n\n#include \"astutil.h\"\n#include \"expr.h\"\n#include \"passes.h\"\n#include \"runtime.h\"\n#include \"stmt.h\"\n#include \"symbol.h\"\n#include \"stringutil.h\"\n#include \"driver.h\"\n#include \"files.h\"\n\n\n\/\/ Package args into a class and call a wrapper function with that\n\/\/ object. The wrapper function will then call the function\n\/\/ created by the previous parallel pass. This is a way to pass along\n\/\/ multiple args through the limitation of one arg in the runtime's\n\/\/ thread creation interface. \nstatic void\nbundleArgs(BlockStmt* block) {\n  currentLineno = block->lineno;\n  currentFilename = block->filename;\n  ModuleSymbol* mod = block->getModule();\n  BlockStmt *newb = new BlockStmt();\n  newb->blockTag = block->blockTag;\n  for_alist(expr, block->body) {\n    CallExpr* fcall = toCallExpr(expr);\n    if (!fcall || !fcall->isResolved()) {\n      block->insertBefore(expr->remove());\n      continue;\n    } else {\n      FnSymbol* fn = fcall->isResolved();\n\n      \/\/ create a new class to capture refs to locals\n      ClassType* ctype = new ClassType( CLASS_CLASS);\n      TypeSymbol* new_c = new TypeSymbol( astr(\"_class_locals\", \n                                               fn->name),\n                                          ctype);\n      new_c->addPragma(\"no wide class\");\n\n      \/\/ add the function args as fields in the class\n      int i = 1;\n      bool first = true;\n      for_actuals(arg, fcall) {\n        if (block->blockTag == BLOCK_ON && first) {\n          first = false;\n          continue;\n        }\n        SymExpr *s = toSymExpr(arg);\n        Symbol  *var = s->var; \/\/ arg or var\n        var->isConcurrent = true;\n        VarSymbol* field = new VarSymbol(astr(\"_\", istr(i), \"_\", var->name), var->type);\n        ctype->fields.insertAtTail(new DefExpr(field));\n        i++;\n      }\n      mod->block->insertAtHead(new DefExpr(new_c));\n        \n      \/\/ create the class variable instance and allocate it\n      VarSymbol *tempc = new VarSymbol( astr( \"_args_for\", \n                                              fn->name),\n                                        ctype);\n      block->insertBefore( new DefExpr( tempc));\n      CallExpr *tempc_alloc = new CallExpr( PRIMITIVE_CHPL_ALLOC,\n                                            ctype->symbol,\n                                            new_StringSymbol( astr( \"instance of class \", ctype->symbol->name)));\n      block->insertBefore( new CallExpr( PRIMITIVE_MOVE,\n                                     tempc,\n                                     tempc_alloc));\n      \n      \/\/ set the references in the class instance\n      i = 1;\n      first = true;\n      for_actuals(arg, fcall) {\n        if (block->blockTag == BLOCK_ON && first) {\n          first = false;\n          continue;\n        }\n        SymExpr *s = toSymExpr(arg);\n        Symbol  *var = s->var; \/\/ var or arg\n        CallExpr *setc=new CallExpr(PRIMITIVE_SET_MEMBER,\n                                    tempc,\n                                    ctype->getField(i),\n                                    var);\n        block->insertBefore( setc);\n        i++;\n      }\n      \n      \/\/ create wrapper-function that uses the class instance\n\n      FnSymbol *wrap_fn = new FnSymbol( astr(\"wrap\", fn->name));\n      DefExpr  *fcall_def= (toSymExpr( fcall->baseExpr))->var->defPoint;\n      if (block->blockTag == BLOCK_ON) {\n        wrap_fn->addPragma(\"on block\");\n        ArgSymbol* locale = new ArgSymbol(INTENT_BLANK, \"_dummy_locale_arg\", dtInt[INT_SIZE_32]);\n        wrap_fn->insertFormalAtTail(locale);\n      }\n      ArgSymbol *wrap_c = new ArgSymbol( INTENT_BLANK, \"c\", ctype);\n      wrap_fn->insertFormalAtTail( wrap_c);\n\n      mod->block->insertAtTail(new DefExpr(wrap_fn));\n      if (block->blockTag == BLOCK_ON) {\n        newb->insertAtTail(new CallExpr(wrap_fn, fcall->get(1)->remove(), tempc));\n      } else\n        newb->insertAtTail(new CallExpr(wrap_fn, tempc));\n\n      if (block->blockTag == BLOCK_BEGIN || block->blockTag == BLOCK_COBEGIN)\n        wrap_fn->insertAtHead(new CallExpr(PRIMITIVE_THREAD_INIT));\n        \n      \/\/ translate the original cobegin function\n      CallExpr *new_cofn = new CallExpr( (toSymExpr(fcall->baseExpr))->var);\n      if (block->blockTag == BLOCK_ON)\n        new_cofn->insertAtTail(new_IntSymbol(0)); \/\/ bogus actual\n      for_fields(field, ctype) {  \/\/ insert args\n\n        VarSymbol* tmp = new VarSymbol(\"_tmp\", field->type);\n        tmp->isCompilerTemp = true;\n        wrap_fn->insertAtTail(new DefExpr(tmp));\n        wrap_fn->insertAtTail(\n          new CallExpr(PRIMITIVE_MOVE, tmp,\n            new CallExpr(PRIMITIVE_GET_MEMBER_VALUE, wrap_c, field)));\n        new_cofn->insertAtTail(tmp);\n      }\n      \n      wrap_fn->retType = dtVoid;\n      fcall->remove();                     \/\/ rm orig. call\n      wrap_fn->insertAtTail(new_cofn);     \/\/ add new call\n      if (block->blockTag == BLOCK_ON)\n        block->insertAfter(new CallExpr(PRIMITIVE_CHPL_FREE, tempc));\n      else\n        wrap_fn->insertAtTail(new CallExpr(PRIMITIVE_CHPL_FREE, wrap_c));\n\n      fcall_def->remove();                 \/\/ move orig. def\n      mod->block->insertAtTail(fcall_def); \/\/ to top-level\n      normalize(wrap_fn);\n    }\n  }\n  block->replace(newb);\n}\n\n\nvoid\nparallel(void) {\n  compute_sym_uses();\n\n  Vec<BlockStmt*> blocks;\n  forv_Vec(BaseAST, ast, gAsts) {\n    if (BlockStmt* block = toBlockStmt(ast))\n      blocks.add(block);\n  }\n\n  forv_Vec(BlockStmt, block, blocks) {\n    if (block->blockTag == BLOCK_ON ||\n        block->blockTag == BLOCK_BEGIN ||\n        block->blockTag == BLOCK_COBEGIN)\n      bundleArgs(block);\n  }\n}\n\n\nstatic void\nbuildWideClass(Type* type) {\n  ClassType* wide = new ClassType(CLASS_RECORD);\n  TypeSymbol* wts = new TypeSymbol(astr(\"_wide_\", type->symbol->cname), wide);\n  wts->addPragma(\"wide class\");\n  theProgram->block->insertAtTail(new DefExpr(wts));\n  wide->fields.insertAtTail(new DefExpr(new VarSymbol(\"locale\", dtInt[INT_SIZE_32])));\n  wide->fields.insertAtTail(new DefExpr(new VarSymbol(\"addr\", type)));\n  wideClassMap.put(type, wide);\n\n  \/\/\n  \/\/ build reference type for wide class type\n  \/\/\n  ClassType* ref = new ClassType(CLASS_CLASS);\n  TypeSymbol* rts = new TypeSymbol(astr(\"_ref_wide_\", type->symbol->cname), ref);\n  rts->addPragma(\"ref\");\n  theProgram->block->insertAtTail(new DefExpr(rts));\n  ref->fields.insertAtTail(new DefExpr(new VarSymbol(\"_val\", type)));\n  wide->refType = ref;\n}\n\n\n\/\/\n\/\/ change all classes into wide classes\n\/\/ change all references into wide references\n\/\/\nvoid\ninsertWideReferences(void) {\n  if (fLocal)\n    return;\n\n  wideClassMap.clear();\n\n  \/\/\n  \/\/ build wide class type for every class type\n  \/\/\n  forv_Vec(TypeSymbol, ts, gTypes) {\n    ClassType* ct = toClassType(ts->type);\n    if (ct && ct->classTag == CLASS_CLASS && !ts->hasPragma(\"ref\") && !ts->hasPragma(\"no wide class\")) {\n\n      \/\/\n      \/\/ do not yet support remote sync and single variables\n      \/\/\n      if (ts->hasPragma(\"sync\") || ts->hasPragma(\"single\"))\n        continue;\n\n      buildWideClass(ct);\n    }\n  }\n  buildWideClass(dtObject);\n\n  \/\/\n  \/\/ change all classes into wide classes\n  \/\/\n  forv_Vec(BaseAST, ast, gAsts) {\n    if (DefExpr* def = toDefExpr(ast)) {\n\n      \/\/\n      \/\/ do not change class field in wide class type\n      \/\/\n      if (TypeSymbol* ts = toTypeSymbol(def->parentSymbol))\n        if (ts->hasPragma(\"wide class\"))\n          continue;\n\n      if (FnSymbol* fn = toFnSymbol(def->sym)) {\n        if (Type* wide = wideClassMap.get(fn->retType))\n          fn->retType = wide;\n      } else if (!isTypeSymbol(def->sym)) {\n        if (Type* wide = wideClassMap.get(def->sym->type))\n          def->sym->type = wide;\n      }\n    }\n  }\n\n  \/\/\n  \/\/ change arrays of classes into arrays of wide classes\n  \/\/\n  forv_Vec(TypeSymbol, ts, gTypes) {\n    if (ts->hasPragma(\"data class\")) {\n      if (Type* nt = wideClassMap.get(toType(ts->type->substitutions.v[0].value))) {\n        ts->type->substitutions.v[0].value = nt;\n      }\n    }\n  }\n\n  wideRefMap.clear();\n\n  \/\/\n  \/\/ build wide reference type for every reference type\n  \/\/\n  forv_Vec(TypeSymbol, ts, gTypes) {\n    if (ts->hasPragma(\"ref\")) {\n      ClassType* wide = new ClassType(CLASS_RECORD);\n      TypeSymbol* wts = new TypeSymbol(astr(\"_wide_\", ts->cname), wide);\n      wts->addPragma(\"wide\");\n      theProgram->block->insertAtTail(new DefExpr(wts));\n      wide->fields.insertAtTail(new DefExpr(new VarSymbol(\"locale\", dtInt[INT_SIZE_32])));\n      wide->fields.insertAtTail(new DefExpr(new VarSymbol(\"addr\", ts->type)));\n      wideRefMap.put(ts->type, wide);\n    }\n  }\n\n  \/\/\n  \/\/ change all references into wide references\n  \/\/\n  forv_Vec(BaseAST, ast, gAsts) {\n    if (DefExpr* def = toDefExpr(ast)) {\n\n      \/\/\n      \/\/ do not change reference field in wide reference type\n      \/\/\n      if (TypeSymbol* ts = toTypeSymbol(def->parentSymbol))\n        if (ts->hasPragma(\"wide\"))\n          continue;\n\n      if (FnSymbol* fn = toFnSymbol(def->sym)) {\n        if (Type* wide = wideRefMap.get(fn->retType))\n          fn->retType = wide;\n      } else if (!isTypeSymbol(def->sym)) {\n        if (Type* wide = wideRefMap.get(def->sym->type))\n          def->sym->type = wide;\n      }\n    }\n  }\n}\n<commit_msg>Added code at the beginning of insertWideReferences to convert all uses of type dtNil into uses of type dtObject before insert wide references.<commit_after>\/\/\n\/\/ Transformations for begin, cobegin, and on statements\n\/\/\n\n#include \"astutil.h\"\n#include \"expr.h\"\n#include \"passes.h\"\n#include \"runtime.h\"\n#include \"stmt.h\"\n#include \"symbol.h\"\n#include \"stringutil.h\"\n#include \"driver.h\"\n#include \"files.h\"\n\n\n\/\/ Package args into a class and call a wrapper function with that\n\/\/ object. The wrapper function will then call the function\n\/\/ created by the previous parallel pass. This is a way to pass along\n\/\/ multiple args through the limitation of one arg in the runtime's\n\/\/ thread creation interface. \nstatic void\nbundleArgs(BlockStmt* block) {\n  currentLineno = block->lineno;\n  currentFilename = block->filename;\n  ModuleSymbol* mod = block->getModule();\n  BlockStmt *newb = new BlockStmt();\n  newb->blockTag = block->blockTag;\n  for_alist(expr, block->body) {\n    CallExpr* fcall = toCallExpr(expr);\n    if (!fcall || !fcall->isResolved()) {\n      block->insertBefore(expr->remove());\n      continue;\n    } else {\n      FnSymbol* fn = fcall->isResolved();\n\n      \/\/ create a new class to capture refs to locals\n      ClassType* ctype = new ClassType( CLASS_CLASS);\n      TypeSymbol* new_c = new TypeSymbol( astr(\"_class_locals\", \n                                               fn->name),\n                                          ctype);\n      new_c->addPragma(\"no wide class\");\n\n      \/\/ add the function args as fields in the class\n      int i = 1;\n      bool first = true;\n      for_actuals(arg, fcall) {\n        if (block->blockTag == BLOCK_ON && first) {\n          first = false;\n          continue;\n        }\n        SymExpr *s = toSymExpr(arg);\n        Symbol  *var = s->var; \/\/ arg or var\n        var->isConcurrent = true;\n        VarSymbol* field = new VarSymbol(astr(\"_\", istr(i), \"_\", var->name), var->type);\n        ctype->fields.insertAtTail(new DefExpr(field));\n        i++;\n      }\n      mod->block->insertAtHead(new DefExpr(new_c));\n        \n      \/\/ create the class variable instance and allocate it\n      VarSymbol *tempc = new VarSymbol( astr( \"_args_for\", \n                                              fn->name),\n                                        ctype);\n      block->insertBefore( new DefExpr( tempc));\n      CallExpr *tempc_alloc = new CallExpr( PRIMITIVE_CHPL_ALLOC,\n                                            ctype->symbol,\n                                            new_StringSymbol( astr( \"instance of class \", ctype->symbol->name)));\n      block->insertBefore( new CallExpr( PRIMITIVE_MOVE,\n                                     tempc,\n                                     tempc_alloc));\n      \n      \/\/ set the references in the class instance\n      i = 1;\n      first = true;\n      for_actuals(arg, fcall) {\n        if (block->blockTag == BLOCK_ON && first) {\n          first = false;\n          continue;\n        }\n        SymExpr *s = toSymExpr(arg);\n        Symbol  *var = s->var; \/\/ var or arg\n        CallExpr *setc=new CallExpr(PRIMITIVE_SET_MEMBER,\n                                    tempc,\n                                    ctype->getField(i),\n                                    var);\n        block->insertBefore( setc);\n        i++;\n      }\n      \n      \/\/ create wrapper-function that uses the class instance\n\n      FnSymbol *wrap_fn = new FnSymbol( astr(\"wrap\", fn->name));\n      DefExpr  *fcall_def= (toSymExpr( fcall->baseExpr))->var->defPoint;\n      if (block->blockTag == BLOCK_ON) {\n        wrap_fn->addPragma(\"on block\");\n        ArgSymbol* locale = new ArgSymbol(INTENT_BLANK, \"_dummy_locale_arg\", dtInt[INT_SIZE_32]);\n        wrap_fn->insertFormalAtTail(locale);\n      }\n      ArgSymbol *wrap_c = new ArgSymbol( INTENT_BLANK, \"c\", ctype);\n      wrap_fn->insertFormalAtTail( wrap_c);\n\n      mod->block->insertAtTail(new DefExpr(wrap_fn));\n      if (block->blockTag == BLOCK_ON) {\n        newb->insertAtTail(new CallExpr(wrap_fn, fcall->get(1)->remove(), tempc));\n      } else\n        newb->insertAtTail(new CallExpr(wrap_fn, tempc));\n\n      if (block->blockTag == BLOCK_BEGIN || block->blockTag == BLOCK_COBEGIN)\n        wrap_fn->insertAtHead(new CallExpr(PRIMITIVE_THREAD_INIT));\n        \n      \/\/ translate the original cobegin function\n      CallExpr *new_cofn = new CallExpr( (toSymExpr(fcall->baseExpr))->var);\n      if (block->blockTag == BLOCK_ON)\n        new_cofn->insertAtTail(new_IntSymbol(0)); \/\/ bogus actual\n      for_fields(field, ctype) {  \/\/ insert args\n\n        VarSymbol* tmp = new VarSymbol(\"_tmp\", field->type);\n        tmp->isCompilerTemp = true;\n        wrap_fn->insertAtTail(new DefExpr(tmp));\n        wrap_fn->insertAtTail(\n          new CallExpr(PRIMITIVE_MOVE, tmp,\n            new CallExpr(PRIMITIVE_GET_MEMBER_VALUE, wrap_c, field)));\n        new_cofn->insertAtTail(tmp);\n      }\n      \n      wrap_fn->retType = dtVoid;\n      fcall->remove();                     \/\/ rm orig. call\n      wrap_fn->insertAtTail(new_cofn);     \/\/ add new call\n      if (block->blockTag == BLOCK_ON)\n        block->insertAfter(new CallExpr(PRIMITIVE_CHPL_FREE, tempc));\n      else\n        wrap_fn->insertAtTail(new CallExpr(PRIMITIVE_CHPL_FREE, wrap_c));\n\n      fcall_def->remove();                 \/\/ move orig. def\n      mod->block->insertAtTail(fcall_def); \/\/ to top-level\n      normalize(wrap_fn);\n    }\n  }\n  block->replace(newb);\n}\n\n\nvoid\nparallel(void) {\n  compute_sym_uses();\n\n  Vec<BlockStmt*> blocks;\n  forv_Vec(BaseAST, ast, gAsts) {\n    if (BlockStmt* block = toBlockStmt(ast))\n      blocks.add(block);\n  }\n\n  forv_Vec(BlockStmt, block, blocks) {\n    if (block->blockTag == BLOCK_ON ||\n        block->blockTag == BLOCK_BEGIN ||\n        block->blockTag == BLOCK_COBEGIN)\n      bundleArgs(block);\n  }\n}\n\n\nstatic void\nbuildWideClass(Type* type) {\n  ClassType* wide = new ClassType(CLASS_RECORD);\n  TypeSymbol* wts = new TypeSymbol(astr(\"_wide_\", type->symbol->cname), wide);\n  wts->addPragma(\"wide class\");\n  theProgram->block->insertAtTail(new DefExpr(wts));\n  wide->fields.insertAtTail(new DefExpr(new VarSymbol(\"locale\", dtInt[INT_SIZE_32])));\n  wide->fields.insertAtTail(new DefExpr(new VarSymbol(\"addr\", type)));\n  wideClassMap.put(type, wide);\n\n  \/\/\n  \/\/ build reference type for wide class type\n  \/\/\n  ClassType* ref = new ClassType(CLASS_CLASS);\n  TypeSymbol* rts = new TypeSymbol(astr(\"_ref_wide_\", type->symbol->cname), ref);\n  rts->addPragma(\"ref\");\n  theProgram->block->insertAtTail(new DefExpr(rts));\n  ref->fields.insertAtTail(new DefExpr(new VarSymbol(\"_val\", type)));\n  wide->refType = ref;\n}\n\n\n\/\/\n\/\/ change all classes into wide classes\n\/\/ change all references into wide references\n\/\/\nvoid\ninsertWideReferences(void) {\n  if (fLocal)\n    return;\n\n  \/\/\n  \/\/ change dtNil into dtObject\n  \/\/\n  forv_Vec(BaseAST, ast, gAsts) {\n    if (DefExpr* def = toDefExpr(ast)) {\n      if (FnSymbol* fn = toFnSymbol(def->sym)) {\n        if (fn->retType == dtNil)\n          fn->retType = dtObject;\n      } else if (!isTypeSymbol(def->sym)) {\n        if (def->sym->type == dtNil)\n          def->sym->type = dtObject;\n      }\n    }\n  }\n\n  wideClassMap.clear();\n\n  \/\/\n  \/\/ build wide class type for every class type\n  \/\/\n  forv_Vec(TypeSymbol, ts, gTypes) {\n    ClassType* ct = toClassType(ts->type);\n    if (ct && ct->classTag == CLASS_CLASS && !ts->hasPragma(\"ref\") && !ts->hasPragma(\"no wide class\")) {\n\n      \/\/\n      \/\/ do not yet support remote sync and single variables\n      \/\/\n      if (ts->hasPragma(\"sync\") || ts->hasPragma(\"single\"))\n        continue;\n\n      buildWideClass(ct);\n    }\n  }\n  buildWideClass(dtObject);\n\n  \/\/\n  \/\/ change all classes into wide classes\n  \/\/\n  forv_Vec(BaseAST, ast, gAsts) {\n    if (DefExpr* def = toDefExpr(ast)) {\n\n      \/\/\n      \/\/ do not change class field in wide class type\n      \/\/\n      if (TypeSymbol* ts = toTypeSymbol(def->parentSymbol))\n        if (ts->hasPragma(\"wide class\"))\n          continue;\n\n      if (FnSymbol* fn = toFnSymbol(def->sym)) {\n        if (Type* wide = wideClassMap.get(fn->retType))\n          fn->retType = wide;\n      } else if (!isTypeSymbol(def->sym)) {\n        if (Type* wide = wideClassMap.get(def->sym->type))\n          def->sym->type = wide;\n      }\n    }\n  }\n\n  \/\/\n  \/\/ change arrays of classes into arrays of wide classes\n  \/\/\n  forv_Vec(TypeSymbol, ts, gTypes) {\n    if (ts->hasPragma(\"data class\")) {\n      if (Type* nt = wideClassMap.get(toType(ts->type->substitutions.v[0].value))) {\n        ts->type->substitutions.v[0].value = nt;\n      }\n    }\n  }\n\n  wideRefMap.clear();\n\n  \/\/\n  \/\/ build wide reference type for every reference type\n  \/\/\n  forv_Vec(TypeSymbol, ts, gTypes) {\n    if (ts->hasPragma(\"ref\")) {\n      ClassType* wide = new ClassType(CLASS_RECORD);\n      TypeSymbol* wts = new TypeSymbol(astr(\"_wide_\", ts->cname), wide);\n      wts->addPragma(\"wide\");\n      theProgram->block->insertAtTail(new DefExpr(wts));\n      wide->fields.insertAtTail(new DefExpr(new VarSymbol(\"locale\", dtInt[INT_SIZE_32])));\n      wide->fields.insertAtTail(new DefExpr(new VarSymbol(\"addr\", ts->type)));\n      wideRefMap.put(ts->type, wide);\n    }\n  }\n\n  \/\/\n  \/\/ change all references into wide references\n  \/\/\n  forv_Vec(BaseAST, ast, gAsts) {\n    if (DefExpr* def = toDefExpr(ast)) {\n\n      \/\/\n      \/\/ do not change reference field in wide reference type\n      \/\/\n      if (TypeSymbol* ts = toTypeSymbol(def->parentSymbol))\n        if (ts->hasPragma(\"wide\"))\n          continue;\n\n      if (FnSymbol* fn = toFnSymbol(def->sym)) {\n        if (Type* wide = wideRefMap.get(fn->retType))\n          fn->retType = wide;\n      } else if (!isTypeSymbol(def->sym)) {\n        if (Type* wide = wideRefMap.get(def->sym->type))\n          def->sym->type = wide;\n      }\n    }\n  }\n\n  \/\/\n  \/\/ insert wide class temps for nil\n  \/\/\n  forv_Vec(BaseAST, ast, gAsts) {\n    if (SymExpr* se = toSymExpr(ast)) {\n      if (se->var == gNil) {\n        if (CallExpr* call = toCallExpr(se->parentExpr)) {\n          if (call->isResolved()) {\n            if (Type* type = actual_to_formal(se)->typeInfo()) {\n              if (type->symbol->hasPragma(\"wide class\")) {\n                VarSymbol* tmp = new VarSymbol(\"_tmp\", type);\n                call->getStmtExpr()->insertBefore(new DefExpr(tmp));\n                se->replace(new SymExpr(tmp));\n                call->getStmtExpr()->insertBefore(new CallExpr(PRIMITIVE_MOVE, tmp, se));\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CLUSTERING_ADMINISTRATION_HTTP_JSON_ADAPTERS_HPP_\n#define CLUSTERING_ADMINISTRATION_HTTP_JSON_ADAPTERS_HPP_\n\n#include \"http\/json\/json_adapter.hpp\"\n#include \"protocol_api.hpp\"\n#include \"rpc\/connectivity\/connectivity.hpp\"\n#include \"rpc\/semilattice\/joins\/deletable.hpp\"\n#include \"rpc\/semilattice\/joins\/vclock.hpp\"\n\n\/* There are a couple of semilattice structures that we need to have json\n * adaptable for the administration server, this code shouldn't go with the\n * definition of these structures because they're deep in the rpc directory\n * which generally doesn't concern itself with how people interact with its\n * structures. *\/\n\n\/* The vclock_t type needs a special apapter which allows it to be resolved.\n * When the vector clock goes in to conflict all of the other requests will\n * fail. *\/\ntemplate <class T, class ctx_t>\nclass json_vclock_resolver_t : public json_adapter_if_t<ctx_t> {\nprivate:\n    vclock_t<T> *target;\nprivate:\n    typename json_adapter_if_t<ctx_t>::json_adapter_map_t get_subfields_impl(const ctx_t &);\n    cJSON *render_impl(const ctx_t &);\n    void apply_impl(cJSON *change, const ctx_t &);\n    void reset_impl(const ctx_t &);\n    void erase_impl(const ctx_t &);\n    boost::shared_ptr<subfield_change_functor_t<ctx_t> > get_change_callback();\npublic:\n    explicit json_vclock_resolver_t(vclock_t<T> *);\n};\n\ntemplate <class T, class ctx_t>\nclass json_vclock_adapter_t : public json_adapter_if_t<ctx_t> {\nprivate:\n    vclock_t<T> *target;\nprivate:\n    typename json_adapter_if_t<ctx_t>::json_adapter_map_t get_subfields_impl(const ctx_t &);\n    cJSON *render_impl(const ctx_t &);\n    void apply_impl(cJSON *, const ctx_t &);\n    void reset_impl(const ctx_t &);\n    void erase_impl(const ctx_t &);\n    boost::shared_ptr<subfield_change_functor_t<ctx_t> >  get_change_callback();\npublic:\n    explicit json_vclock_adapter_t(vclock_t<T> *);\n};\n\n\/\/json adapter concept for vclock_t\ntemplate <class T, class ctx_t>\ntypename json_adapter_if_t<ctx_t>::json_adapter_map_t get_json_subfields(vclock_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\ncJSON *render_as_json(vclock_t<T> *, const ctx_t &);\n\n\/\/Note this is not actually part of the json_adapter concept but is a special\n\/\/purpose rendering function which is needed by the json_vclock_resolver_t\ntemplate <class T, class ctx_t>\ncJSON *render_all_values(vclock_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid apply_json_to(cJSON *, vclock_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid on_subfield_change(vclock_t<T> *, const ctx_t &);\n\n\/\/json adapter concept for deletable_t\ntemplate <class T, class ctx_t>\ntypename json_adapter_if_t<ctx_t>::json_adapter_map_t get_json_subfields(deletable_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\ncJSON *render_as_json(deletable_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid apply_json_to(cJSON *, deletable_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid erase_json(deletable_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid on_subfield_change(deletable_t<T> *, const ctx_t &);\n\n\/\/json adapter concept for peer_id_t\ntemplate <class ctx_t>\ntypename json_adapter_if_t<ctx_t>::json_adapter_map_t get_json_subfields(peer_id_t *, const ctx_t &);\n\ntemplate <class ctx_t>\ncJSON *render_as_json(peer_id_t *, const ctx_t &);\n\ntemplate <class ctx_t>\nvoid apply_json_to(cJSON *, peer_id_t *, const ctx_t &);\n\ntemplate <class ctx_t>\nvoid on_subfield_change(peer_id_t *, const ctx_t &);\n\n\/\/json adapter concept for region map\ntemplate <class protocol_t, class value_t, class ctx_t>\ntypename json_adapter_if_t<ctx_t>::json_adapter_map_t get_json_subfields(region_map_t<protocol_t, value_t> *, const ctx_t &);\n\ntemplate <class protocol_t, class value_t, class ctx_t>\ncJSON *render_as_json(region_map_t<protocol_t, value_t> *, const ctx_t &);\n\ntemplate <class protocol_t, class value_t, class ctx_t>\nvoid apply_json_to(cJSON *, region_map_t<protocol_t, value_t> *, const ctx_t &);\n\ntemplate <class protocol_t, class value_t, class ctx_t>\nvoid on_subfield_change(region_map_t<protocol_t, value_t> *, const ctx_t &);\n\n#include \"clustering\/administration\/http\/json_adapters.tcc\"\n\n#endif\n<commit_msg>Added DISABLE_COPYING to json_vclock_resolver_t and made all the public\/private ordering consistent with the rest of the project.<commit_after>#ifndef CLUSTERING_ADMINISTRATION_HTTP_JSON_ADAPTERS_HPP_\n#define CLUSTERING_ADMINISTRATION_HTTP_JSON_ADAPTERS_HPP_\n\n#include \"http\/json\/json_adapter.hpp\"\n#include \"protocol_api.hpp\"\n#include \"rpc\/connectivity\/connectivity.hpp\"\n#include \"rpc\/semilattice\/joins\/deletable.hpp\"\n#include \"rpc\/semilattice\/joins\/vclock.hpp\"\n\n\/* There are a couple of semilattice structures that we need to have json\n * adaptable for the administration server, this code shouldn't go with the\n * definition of these structures because they're deep in the rpc directory\n * which generally doesn't concern itself with how people interact with its\n * structures. *\/\n\n\/* The vclock_t type needs a special apapter which allows it to be resolved.\n * When the vector clock goes in to conflict all of the other requests will\n * fail. *\/\ntemplate <class T, class ctx_t>\nclass json_vclock_resolver_t : public json_adapter_if_t<ctx_t> {\npublic:\n    explicit json_vclock_resolver_t(vclock_t<T> *);\n\nprivate:\n    typename json_adapter_if_t<ctx_t>::json_adapter_map_t get_subfields_impl(const ctx_t &);\n    cJSON *render_impl(const ctx_t &);\n    void apply_impl(cJSON *change, const ctx_t &);\n    void reset_impl(const ctx_t &);\n    void erase_impl(const ctx_t &);\n    boost::shared_ptr<subfield_change_functor_t<ctx_t> > get_change_callback();\n\n    vclock_t<T> *target;\n\n    DISABLE_COPYING(json_vclock_resolver_t);\n};\n\ntemplate <class T, class ctx_t>\nclass json_vclock_adapter_t : public json_adapter_if_t<ctx_t> {\nprivate:\n    vclock_t<T> *target;\nprivate:\n    typename json_adapter_if_t<ctx_t>::json_adapter_map_t get_subfields_impl(const ctx_t &);\n    cJSON *render_impl(const ctx_t &);\n    void apply_impl(cJSON *, const ctx_t &);\n    void reset_impl(const ctx_t &);\n    void erase_impl(const ctx_t &);\n    boost::shared_ptr<subfield_change_functor_t<ctx_t> >  get_change_callback();\npublic:\n    explicit json_vclock_adapter_t(vclock_t<T> *);\n};\n\n\/\/json adapter concept for vclock_t\ntemplate <class T, class ctx_t>\ntypename json_adapter_if_t<ctx_t>::json_adapter_map_t get_json_subfields(vclock_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\ncJSON *render_as_json(vclock_t<T> *, const ctx_t &);\n\n\/\/Note this is not actually part of the json_adapter concept but is a special\n\/\/purpose rendering function which is needed by the json_vclock_resolver_t\ntemplate <class T, class ctx_t>\ncJSON *render_all_values(vclock_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid apply_json_to(cJSON *, vclock_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid on_subfield_change(vclock_t<T> *, const ctx_t &);\n\n\/\/json adapter concept for deletable_t\ntemplate <class T, class ctx_t>\ntypename json_adapter_if_t<ctx_t>::json_adapter_map_t get_json_subfields(deletable_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\ncJSON *render_as_json(deletable_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid apply_json_to(cJSON *, deletable_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid erase_json(deletable_t<T> *, const ctx_t &);\n\ntemplate <class T, class ctx_t>\nvoid on_subfield_change(deletable_t<T> *, const ctx_t &);\n\n\/\/json adapter concept for peer_id_t\ntemplate <class ctx_t>\ntypename json_adapter_if_t<ctx_t>::json_adapter_map_t get_json_subfields(peer_id_t *, const ctx_t &);\n\ntemplate <class ctx_t>\ncJSON *render_as_json(peer_id_t *, const ctx_t &);\n\ntemplate <class ctx_t>\nvoid apply_json_to(cJSON *, peer_id_t *, const ctx_t &);\n\ntemplate <class ctx_t>\nvoid on_subfield_change(peer_id_t *, const ctx_t &);\n\n\/\/json adapter concept for region map\ntemplate <class protocol_t, class value_t, class ctx_t>\ntypename json_adapter_if_t<ctx_t>::json_adapter_map_t get_json_subfields(region_map_t<protocol_t, value_t> *, const ctx_t &);\n\ntemplate <class protocol_t, class value_t, class ctx_t>\ncJSON *render_as_json(region_map_t<protocol_t, value_t> *, const ctx_t &);\n\ntemplate <class protocol_t, class value_t, class ctx_t>\nvoid apply_json_to(cJSON *, region_map_t<protocol_t, value_t> *, const ctx_t &);\n\ntemplate <class protocol_t, class value_t, class ctx_t>\nvoid on_subfield_change(region_map_t<protocol_t, value_t> *, const ctx_t &);\n\n#include \"clustering\/administration\/http\/json_adapters.tcc\"\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <unordered_map>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <assert.h>\n#include \"interpreter.h\"\n\nusing namespace Interpreter;\n\nstatic std::unordered_map<std::string, int> symbols;\nstatic std::unordered_map<std::string, Statements*> functions;\n\nId::Id(const char *name) {\n    this->name = strdup(name);\n}\n\nint Id::Evaluate()\n{\n    const char* name = this->name;\n    \n    try\n    {\n        return symbols.at(name);\n    }\n    catch(std::out_of_range e)\n    {\n        fprintf(stderr, \"error: use of undeclared variable '%s'\\n\", name);\n        exit(1);\n    }\n}\n\nvoid Id::Assign(int val) {\n    symbols[this->name] = val;\n}\n\nVal::Val(int val) {\n    this->val = val;\n}\n\nint Val::Evaluate()\n{\n    return this->val;\n}\n\nOp::Op(const char *symbol) {\n    this->symbol = strdup(symbol);\n}\n\nStatements::Statements(Statement *statement, Statements *childStatements) {\n    this->statement = statement;\n    this->childStatements = childStatements;\n}\n\nvoid Statements::Execute()\n{\n    if(this->statement != nullptr)\n    {\n        this->statement->Execute();\n    }\n    if(this->childStatements != nullptr)\n    {\n        this->childStatements->Execute();\n    }\n}\n\nAssignment::Assignment(Id *id, Expression* right) {\n    this->id= id;\n    this->right = right;\n}\n\nvoid Assignment::Execute() {\n    int val = this->right->Evaluate();\n    this->id->Assign(val);\n}\n\nConditional::Conditional(Expression* condition, Statement* statement) {\n    this->condition = condition;\n    this->statement = statement;\n}\n\nvoid Conditional::Execute()\n{\n    int result = this->condition->Evaluate();\n    if(result) {\n        this->statement->Execute();\n    }\n}\n\nPrint::Print(Expression *expr) {\n    this->expr = expr;\n}\n\nvoid Print::Execute()\n{\n    int result = this->expr->Evaluate();\n    printf(\"%d\\n\", result);\n}\n\nExpressionNode::ExpressionNode(Expression *left, Expression *right, Op* op) {\n    this->left = left;\n    this->right = right;\n    this->op = op;\n}\n\nint ExpressionNode::Evaluate()\n{\n    const char* op = this->op->symbol;\n    int left = this->left->Evaluate();\n    int right = this->right->Evaluate();\n\n    if(strcmp(op,\"+\")==0) {\n        return left+right;\n    } else if(strcmp(op,\"-\")==0) {\n        return left-right;\n    } else if(strcmp(op,\"*\")==0) {\n        return left*right;\n    } else if(strcmp(op,\"\/\")==0) {\n        return left\/right;\n    } else if(strcmp(op,\"<\")==0) {\n        return left<right;\n    } else if(strcmp(op,\"<=\")==0) {\n        return left<=right;\n    } else if(strcmp(op,\">\")==0) {\n        return left>right;\n    } else if(strcmp(op,\">=\")==0) {\n        return left>=right;\n    } else if(strcmp(op,\"==\")==0) {\n        return left==right;\n    } else if(strcmp(op,\"!=\")==0) {\n        return left!=right;\n    } else {\n        fprintf(stderr,\"fatal error: invalid op '%s'\\n\", op);\n        exit(1);\n    }\n}\n\nFunctionAssignment::FunctionAssignment(Id *id, Statements *statements)\n{\n    this->id = id;\n    this->statements = statements;\n}\n\nvoid FunctionAssignment::Execute()\n{\n    functions[this->id->name] = this->statements;\n}\n\nFunctionCall::FunctionCall(Id *id)\n{\n    this->id = id;\n}\n\nvoid FunctionCall::Execute()\n{\n    try\n    {\n        functions.at(this->id->name)->Execute();\n    }\n    catch(std::out_of_range e)\n    {\n        fprintf(stderr, \"error: use of undeclared function '%s'\\n\", this->id->name);\n        exit(1);\n    }\n}\n<commit_msg>Eliminate recursion on statement chain<commit_after>#include <unordered_map>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <assert.h>\n#include \"interpreter.h\"\n\nusing namespace Interpreter;\n\nstatic std::unordered_map<std::string, int> symbols;\nstatic std::unordered_map<std::string, Statements*> functions;\n\nId::Id(const char *name) {\n    this->name = strdup(name);\n}\n\nint Id::Evaluate()\n{\n    const char* name = this->name;\n    \n    try\n    {\n        return symbols.at(name);\n    }\n    catch(std::out_of_range e)\n    {\n        fprintf(stderr, \"error: use of undeclared variable '%s'\\n\", name);\n        exit(1);\n    }\n}\n\nvoid Id::Assign(int val) {\n    symbols[this->name] = val;\n}\n\nVal::Val(int val) {\n    this->val = val;\n}\n\nint Val::Evaluate()\n{\n    return this->val;\n}\n\nOp::Op(const char *symbol) {\n    this->symbol = strdup(symbol);\n}\n\nStatements::Statements(Statement *statement, Statements *childStatements) {\n    this->statement = statement;\n    this->childStatements = childStatements;\n}\n\nvoid Statements::Execute()\n{\n    Statements *nexts = this;\n    while(nexts != nullptr)\n    {\n       nexts->statement->Execute();\n       nexts = nexts->childStatements;\n    }\n}\n\nAssignment::Assignment(Id *id, Expression* right) {\n    this->id= id;\n    this->right = right;\n}\n\nvoid Assignment::Execute() {\n    int val = this->right->Evaluate();\n    this->id->Assign(val);\n}\n\nConditional::Conditional(Expression* condition, Statement* statement) {\n    this->condition = condition;\n    this->statement = statement;\n}\n\nvoid Conditional::Execute()\n{\n    int result = this->condition->Evaluate();\n    if(result) {\n        this->statement->Execute();\n    }\n}\n\nPrint::Print(Expression *expr) {\n    this->expr = expr;\n}\n\nvoid Print::Execute()\n{\n    int result = this->expr->Evaluate();\n    printf(\"%d\\n\", result);\n}\n\nExpressionNode::ExpressionNode(Expression *left, Expression *right, Op* op) {\n    this->left = left;\n    this->right = right;\n    this->op = op;\n}\n\nint ExpressionNode::Evaluate()\n{\n    const char* op = this->op->symbol;\n    int left = this->left->Evaluate();\n    int right = this->right->Evaluate();\n\n    if(strcmp(op,\"+\")==0) {\n        return left+right;\n    } else if(strcmp(op,\"-\")==0) {\n        return left-right;\n    } else if(strcmp(op,\"*\")==0) {\n        return left*right;\n    } else if(strcmp(op,\"\/\")==0) {\n        return left\/right;\n    } else if(strcmp(op,\"<\")==0) {\n        return left<right;\n    } else if(strcmp(op,\"<=\")==0) {\n        return left<=right;\n    } else if(strcmp(op,\">\")==0) {\n        return left>right;\n    } else if(strcmp(op,\">=\")==0) {\n        return left>=right;\n    } else if(strcmp(op,\"==\")==0) {\n        return left==right;\n    } else if(strcmp(op,\"!=\")==0) {\n        return left!=right;\n    } else {\n        fprintf(stderr,\"fatal error: invalid op '%s'\\n\", op);\n        exit(1);\n    }\n}\n\nFunctionAssignment::FunctionAssignment(Id *id, Statements *statements)\n{\n    this->id = id;\n    this->statements = statements;\n}\n\nvoid FunctionAssignment::Execute()\n{\n    functions[this->id->name] = this->statements;\n}\n\nFunctionCall::FunctionCall(Id *id)\n{\n    this->id = id;\n}\n\nvoid FunctionCall::Execute()\n{\n    try\n    {\n        functions.at(this->id->name)->Execute();\n    }\n    catch(std::out_of_range e)\n    {\n        fprintf(stderr, \"error: use of undeclared function '%s'\\n\", this->id->name);\n        exit(1);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Config.hpp\"\n#include \"EventOutputQueue.hpp\"\n#include \"PointingRelativeToScroll.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n  namespace RemapFunc {\n    List* PointingRelativeToScroll::queue_ = NULL;\n    TimerWrapper PointingRelativeToScroll::timer_;\n\n    void\n    PointingRelativeToScroll::static_initialize(IOWorkLoop& workloop)\n    {\n      queue_ = new List();\n      timer_.initialize(&workloop, NULL, PointingRelativeToScroll::callback);\n    }\n\n    void\n    PointingRelativeToScroll::static_terminate(void)\n    {\n      timer_.terminate();\n\n      if (queue_) {\n        delete queue_;\n      }\n    }\n\n    void\n    PointingRelativeToScroll::cancelScroll(void)\n    {\n      timer_.cancelTimeout();\n\n      if (queue_) {\n        queue_->clear();\n      }\n    }\n\n    void\n    PointingRelativeToScroll::initialize(void)\n    {}\n\n    void\n    PointingRelativeToScroll::terminate(void)\n    {}\n\n    void\n    PointingRelativeToScroll::add(Flags newval)\n    {\n      fromFlags_ = newval;\n    }\n\n    void\n    PointingRelativeToScroll::add(PointingButton newval)\n    {\n      fromButton_ = newval;\n    }\n\n    bool\n    PointingRelativeToScroll::remap(RemapPointingParams_relative& remapParams)\n    {\n      bool active = fromkeychecker_.isactive();\n\n      if (remapParams.isremapped) return false;\n      if (fromButton_ == PointingButton::NONE) {\n        if (! FlagStatus::makeFlags().isOn(fromFlags_)) return false;\n      } else {\n        if (! fromkeychecker_.isFromPointingButton(remapParams.params, fromButton_, fromFlags_) && ! active) return false;\n      }\n      remapParams.isremapped = true;\n\n      if (fromButton_ == PointingButton::NONE) {\n        goto doremap;\n      }\n\n      \/\/ first time\n      if (! active) {\n        \/\/ if the source buttons contains left button, we cancel left click for iPhoto, or some applications.\n        \/\/ iPhoto store the scroll events when left button is pressed, and restore events after left button is released.\n        \/\/ PointingRelativeToScroll doesn't aim it, we release the left button and do normal scroll event.\n        ButtonStatus::decrease(fromButton_);\n        EventOutputQueue::FireRelativePointer::fire();\n        ButtonStatus::increase(fromButton_);\n\n        absolute_distance_ = 0;\n        begin_ic_.begin();\n        chained_ic_.begin();\n        chained_delta1_ = 0;\n        chained_delta2_ = 0;\n\n        goto doremap;\n      }\n\n      \/\/ last time\n      if (! fromkeychecker_.isactive()) {\n        cancelScroll();\n\n        const uint32_t DISTANCE_THRESHOLD = 5;\n        const uint32_t TIME_THRESHOLD = 300;\n        if (absolute_distance_ <= DISTANCE_THRESHOLD && begin_ic_.getmillisec() < TIME_THRESHOLD) {\n          \/\/ Fire by a click event.\n          ButtonStatus::increase(fromButton_);\n          EventOutputQueue::FireRelativePointer::fire();\n          ButtonStatus::decrease(fromButton_);\n          EventOutputQueue::FireRelativePointer::fire();\n        }\n        return true;\n      }\n\n    doremap:\n      FlagStatus::temporary_decrease(fromFlags_);\n      toscroll(remapParams);\n      \/\/ We need to call temporary_increase.\n      \/\/ Because when SimultaneousKeyPresses is enabled, temporary flags will be reset in unexpected timing.\n      \/\/ So, we need to restore temporary flags explicitly.\n      FlagStatus::temporary_increase(fromFlags_);\n\n      return true;\n    }\n\n    void\n    PointingRelativeToScroll::toscroll(RemapPointingParams_relative& remapParams)\n    {\n      if (! queue_) return;\n\n      \/\/ ----------------------------------------\n      const uint32_t CANCEL_THRESHOLD = 100;\n      if (chained_ic_.getmillisec() > CANCEL_THRESHOLD) {\n        chained_delta1_ = 0;\n        chained_delta2_ = 0;\n        cancelScroll();\n      }\n\n      int delta1 = -remapParams.params.dy;\n      int delta2 = -remapParams.params.dx;\n\n      chained_ic_.begin();\n\n      \/\/ ----------------------------------------\n      if (config.option_pointing_disable_vertical_scroll) delta1 = 0;\n      if (config.option_pointing_disable_horizontal_scroll) delta2 = 0;\n\n      \/\/ ----------------------------------------\n      \/\/ ignore minuscule move\n      const unsigned int abs1 = abs(delta1);\n      const unsigned int abs2 = abs(delta2);\n\n      if (abs1 > abs2 * 2) {\n        delta2 = 0;\n      }\n      if (abs2 > abs1 * 2) {\n        delta1 = 0;\n      }\n\n      \/\/ ----------------------------------------\n      \/\/ Fixation processing\n\n      if (config.option_pointing_enable_scrollwheel_fixation) {\n        \/\/ When 300ms passes from the last event, we reset a value.\n        const uint32_t FIXATION_MILLISEC = 300;\n        if (fixation_ic_.getmillisec() > FIXATION_MILLISEC) {\n          fixation_begin_ic_.begin();\n          fixation_delta1_ = 0;\n          fixation_delta2_ = 0;\n        }\n        fixation_ic_.begin();\n\n        if (fixation_delta1_ > fixation_delta2_ * 2) {\n          delta2 = 0;\n        }\n        if (fixation_delta2_ > fixation_delta1_ * 2) {\n          delta1 = 0;\n        }\n\n        \/\/ Only first 1000ms performs the addition of fixation_delta1, fixation_delta2.\n        const uint32_t FIXATION_EARLY_MILLISEC  = 1000;\n        if (fixation_begin_ic_.getmillisec() < FIXATION_EARLY_MILLISEC) {\n          if (delta1 == 0) fixation_delta2_ += abs2;\n          if (delta2 == 0) fixation_delta1_ += abs1;\n        }\n      }\n\n      \/\/ ------------------------------------------------------------\n      if (abs(delta1) > abs(chained_delta1_) || delta1 * chained_delta1_ < 0 ||\n          abs(delta2) > abs(chained_delta2_) || delta2 * chained_delta2_ < 0) {\n        chained_delta1_ = delta1;\n        chained_delta2_ = delta2;\n      }\n\n      absolute_distance_ += abs(chained_delta1_) + abs(chained_delta2_);\n      queue_->push_back(new Item(chained_delta1_ * DELTA_SCALE, chained_delta2_ * DELTA_SCALE));\n\n      timer_.setTimeoutMS(SCROLL_INTERVAL_MS, false);\n    }\n\n    void\n    PointingRelativeToScroll::firescroll(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      deltaAxis1 = (delta1 * config.pointing_relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n      deltaAxis2 = (delta2 * config.pointing_relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n      fixedDelta1 = (delta1 * config.pointing_relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n      fixedDelta2 = (delta2 * config.pointing_relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n\n      pointDelta1 = (delta1 * POINTING_POINT_SCALE * config.pointing_relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n      pointDelta2 = (delta2 * POINTING_POINT_SCALE * config.pointing_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    void\n    PointingRelativeToScroll::callback(OSObject* owner, IOTimerEventSource* sender)\n    {\n      IOLockWrapper::ScopedLock lk(timer_.getlock());\n\n      if (! queue_) return;\n\n      \/\/ ----------------------------------------\n      int delta1 = 0;\n      int delta2 = 0;\n      {\n        Item* p = static_cast<Item*>(queue_->front());\n        if (! p) return;\n\n        delta1 = p->delta1;\n        delta2 = p->delta2;\n\n        queue_->pop_front();\n      }\n\n      \/\/ ----------------------------------------\n      firescroll(delta1, delta2);\n\n      if (! config.option_pointing_disable_momentum_scroll) {\n        if (delta1 != 0 || delta2 != 0) {\n          queue_->push_back(new Item(delta1 \/ 2, delta2 \/ 2));\n        }\n      }\n\n      timer_.setTimeoutMS(SCROLL_INTERVAL_MS, false);\n    }\n  }\n}\n<commit_msg>adjusted PointingRelativeToScroll<commit_after>#include \"Config.hpp\"\n#include \"EventOutputQueue.hpp\"\n#include \"PointingRelativeToScroll.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n  namespace RemapFunc {\n    List* PointingRelativeToScroll::queue_ = NULL;\n    TimerWrapper PointingRelativeToScroll::timer_;\n\n    void\n    PointingRelativeToScroll::static_initialize(IOWorkLoop& workloop)\n    {\n      queue_ = new List();\n      timer_.initialize(&workloop, NULL, PointingRelativeToScroll::callback);\n    }\n\n    void\n    PointingRelativeToScroll::static_terminate(void)\n    {\n      timer_.terminate();\n\n      if (queue_) {\n        delete queue_;\n      }\n    }\n\n    void\n    PointingRelativeToScroll::cancelScroll(void)\n    {\n      timer_.cancelTimeout();\n\n      if (queue_) {\n        queue_->clear();\n      }\n    }\n\n    void\n    PointingRelativeToScroll::initialize(void)\n    {}\n\n    void\n    PointingRelativeToScroll::terminate(void)\n    {}\n\n    void\n    PointingRelativeToScroll::add(Flags newval)\n    {\n      fromFlags_ = newval;\n    }\n\n    void\n    PointingRelativeToScroll::add(PointingButton newval)\n    {\n      fromButton_ = newval;\n    }\n\n    bool\n    PointingRelativeToScroll::remap(RemapPointingParams_relative& remapParams)\n    {\n      bool active = fromkeychecker_.isactive();\n\n      if (remapParams.isremapped) return false;\n      if (fromButton_ == PointingButton::NONE) {\n        if (! FlagStatus::makeFlags().isOn(fromFlags_)) return false;\n      } else {\n        if (! fromkeychecker_.isFromPointingButton(remapParams.params, fromButton_, fromFlags_) && ! active) return false;\n      }\n      remapParams.isremapped = true;\n\n      if (fromButton_ == PointingButton::NONE) {\n        goto doremap;\n      }\n\n      \/\/ first time\n      if (! active) {\n        \/\/ if the source buttons contains left button, we cancel left click for iPhoto, or some applications.\n        \/\/ iPhoto store the scroll events when left button is pressed, and restore events after left button is released.\n        \/\/ PointingRelativeToScroll doesn't aim it, we release the left button and do normal scroll event.\n        ButtonStatus::decrease(fromButton_);\n        EventOutputQueue::FireRelativePointer::fire();\n        ButtonStatus::increase(fromButton_);\n\n        absolute_distance_ = 0;\n        begin_ic_.begin();\n        chained_ic_.begin();\n        chained_delta1_ = 0;\n        chained_delta2_ = 0;\n\n        goto doremap;\n      }\n\n      \/\/ last time\n      if (! fromkeychecker_.isactive()) {\n        cancelScroll();\n\n        const uint32_t DISTANCE_THRESHOLD = 5;\n        const uint32_t TIME_THRESHOLD = 300;\n        if (absolute_distance_ <= DISTANCE_THRESHOLD && begin_ic_.getmillisec() < TIME_THRESHOLD) {\n          \/\/ Fire by a click event.\n          ButtonStatus::increase(fromButton_);\n          EventOutputQueue::FireRelativePointer::fire();\n          ButtonStatus::decrease(fromButton_);\n          EventOutputQueue::FireRelativePointer::fire();\n        }\n        return true;\n      }\n\n    doremap:\n      FlagStatus::temporary_decrease(fromFlags_);\n      toscroll(remapParams);\n      \/\/ We need to call temporary_increase.\n      \/\/ Because when SimultaneousKeyPresses is enabled, temporary flags will be reset in unexpected timing.\n      \/\/ So, we need to restore temporary flags explicitly.\n      FlagStatus::temporary_increase(fromFlags_);\n\n      return true;\n    }\n\n    void\n    PointingRelativeToScroll::toscroll(RemapPointingParams_relative& remapParams)\n    {\n      if (! queue_) return;\n\n      \/\/ ----------------------------------------\n      const uint32_t CANCEL_THRESHOLD = 100;\n      if (chained_ic_.getmillisec() > CANCEL_THRESHOLD) {\n        chained_delta1_ = 0;\n        chained_delta2_ = 0;\n        cancelScroll();\n      }\n\n      int delta1 = -remapParams.params.dy;\n      int delta2 = -remapParams.params.dx;\n\n      chained_ic_.begin();\n\n      \/\/ ----------------------------------------\n      if (config.option_pointing_disable_vertical_scroll) delta1 = 0;\n      if (config.option_pointing_disable_horizontal_scroll) delta2 = 0;\n\n      \/\/ ----------------------------------------\n      \/\/ ignore minuscule move\n      const unsigned int abs1 = abs(delta1);\n      const unsigned int abs2 = abs(delta2);\n\n      if (abs1 > abs2 * 2) {\n        delta2 = 0;\n      }\n      if (abs2 > abs1 * 2) {\n        delta1 = 0;\n      }\n\n      \/\/ ----------------------------------------\n      \/\/ Fixation processing\n\n      if (config.option_pointing_enable_scrollwheel_fixation) {\n        \/\/ When 300ms passes from the last event, we reset a value.\n        const uint32_t FIXATION_MILLISEC = 300;\n        if (fixation_ic_.getmillisec() > FIXATION_MILLISEC) {\n          fixation_begin_ic_.begin();\n          fixation_delta1_ = 0;\n          fixation_delta2_ = 0;\n        }\n        fixation_ic_.begin();\n\n        if (fixation_delta1_ > fixation_delta2_ * 2) {\n          delta2 = 0;\n        }\n        if (fixation_delta2_ > fixation_delta1_ * 2) {\n          delta1 = 0;\n        }\n\n        \/\/ Only first 1000ms performs the addition of fixation_delta1, fixation_delta2.\n        const uint32_t FIXATION_EARLY_MILLISEC  = 1000;\n        if (fixation_begin_ic_.getmillisec() < FIXATION_EARLY_MILLISEC) {\n          if (delta1 == 0) fixation_delta2_ += abs2;\n          if (delta2 == 0) fixation_delta1_ += abs1;\n        }\n      }\n\n      \/\/ ------------------------------------------------------------\n      \/\/ when sign is different\n      if (0 > delta1 * chained_delta1_ ||\n          0 > delta2 * chained_delta2_) {\n        queue_->clear();\n        chained_delta1_ = delta1;\n        chained_delta2_ = delta2;\n\n      } else if (abs(delta1) > abs(chained_delta1_) ||\n                 abs(delta2) > abs(chained_delta2_)) {\n        \/\/ greater delta.\n        chained_delta1_ = delta1;\n        chained_delta2_ = delta2;\n      }\n\n      absolute_distance_ += abs(chained_delta1_) + abs(chained_delta2_);\n      queue_->push_back(new Item(chained_delta1_ * DELTA_SCALE, chained_delta2_ * DELTA_SCALE));\n\n      timer_.setTimeoutMS(SCROLL_INTERVAL_MS, false);\n    }\n\n    void\n    PointingRelativeToScroll::firescroll(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      deltaAxis1 = (delta1 * config.pointing_relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n      deltaAxis2 = (delta2 * config.pointing_relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n      fixedDelta1 = (delta1 * config.pointing_relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n      fixedDelta2 = (delta2 * config.pointing_relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n\n      pointDelta1 = (delta1 * POINTING_POINT_SCALE * config.pointing_relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n      pointDelta2 = (delta2 * POINTING_POINT_SCALE * config.pointing_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    void\n    PointingRelativeToScroll::callback(OSObject* owner, IOTimerEventSource* sender)\n    {\n      IOLockWrapper::ScopedLock lk(timer_.getlock());\n\n      if (! queue_) return;\n\n      \/\/ ----------------------------------------\n      int delta1 = 0;\n      int delta2 = 0;\n      {\n        Item* p = static_cast<Item*>(queue_->front());\n        if (! p) return;\n\n        delta1 = p->delta1;\n        delta2 = p->delta2;\n\n        queue_->pop_front();\n      }\n\n      \/\/ ----------------------------------------\n      firescroll(delta1, delta2);\n\n      if (! config.option_pointing_disable_momentum_scroll) {\n        if (delta1 != 0 || delta2 != 0) {\n          queue_->push_back(new Item(delta1 \/ 2, delta2 \/ 2));\n        }\n      }\n\n      timer_.setTimeoutMS(SCROLL_INTERVAL_MS, false);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"retracer.h\"\n\n#include \"apitracecall.h\"\n#include \"thumbnail.h\"\n\n#include \"image.hpp\"\n\n#include \"trace_profiler.hpp\"\n\n#include <QDebug>\n#include <QVariant>\n#include <QList>\n#include <QImage>\n\n#include <qjson\/parser.h>\n\n\/**\n * Wrapper around a QProcess which enforces IO to block .\n *\n * Several QIODevice users (notably QJSON) expect blocking semantics, e.g.,\n * they expect that QIODevice::read() will blocked until the requested ammount\n * of bytes is read or end of file is reached. But by default QProcess, does\n * not block.  And passing QIODevice::Unbuffered mitigates but does not fully\n * address the problem either.\n *\n * This class wraps around QProcess, providing QIODevice interface, while\n * ensuring that all reads block.\n *\n * This class also works around a bug in QProcess::atEnd() implementation.\n *\n * See also:\n * - http:\/\/qt-project.org\/wiki\/Simple_Crypt_IO_Device\n * - http:\/\/qt-project.org\/wiki\/Custom_IO_Device\n *\/\nclass BlockingIODevice : public QIODevice\n{\n    \/* We don't use the Q_OBJECT in this class given we don't declare any\n     * signals and slots or use any other services provided by Qt's meta-object\n     * system. *\/\npublic:\n    BlockingIODevice(QProcess * io);\n    bool isSequential() const;\n    bool atEnd() const;\n    bool waitForReadyRead(int msecs = -1);\n\nprotected:\n    qint64 readData(char * data, qint64 maxSize);\n    qint64 writeData(const char * data, qint64 maxSize);\n\nprivate:\n    QProcess *m_device;\n};\n\nBlockingIODevice::BlockingIODevice(QProcess * io) :\n    m_device(io)\n{\n    \/*\n     * We pass QIODevice::Unbuffered to prevent the base QIODevice class to do\n     * its own buffering on top of the overridden readData() method.\n     *\n     * The only buffering used will be to satisfy QIODevice::peek() and\n     * QIODevice::ungetChar().\n     *\/\n    setOpenMode(ReadOnly | Unbuffered);\n}\n\nbool BlockingIODevice::isSequential() const\n{\n    return true;\n}\n\nbool BlockingIODevice::atEnd() const\n{\n    \/*\n     * XXX: QProcess::atEnd() documentation is wrong -- it will return true\n     * even when the process is running --, so we try to workaround that here.\n     *\/\n    if (m_device->atEnd()) {\n        if (m_device->state() == QProcess::Running) {\n            if (!m_device->waitForReadyRead(-1)) {\n                return true;\n            }\n        }\n    }\n    return false;\n}\n\nbool BlockingIODevice::waitForReadyRead(int msecs)\n{\n    Q_UNUSED(msecs);\n    return true;\n}\n\nqint64 BlockingIODevice::readData(char * data, qint64 maxSize)\n{\n    qint64 bytesToRead = maxSize;\n    qint64 readSoFar = 0;\n    do {\n        qint64 chunkSize = m_device->read(data + readSoFar, bytesToRead);\n        if (chunkSize < 0) {\n            if (readSoFar) {\n                return readSoFar;\n            } else {\n                return chunkSize;\n            }\n        }\n        Q_ASSERT(chunkSize <= bytesToRead);\n        bytesToRead -= chunkSize;\n        readSoFar += chunkSize;\n        if (bytesToRead) {\n            if (!m_device->waitForReadyRead(-1)) {\n                qDebug() << \"waitForReadyRead failed\\n\";\n                break;\n            }\n        }\n    } while(bytesToRead);\n\n    return readSoFar;\n}\n\nqint64 BlockingIODevice::writeData(const char * data, qint64 maxSize)\n{\n    Q_ASSERT(false);\n    return -1;\n}\n\nQ_DECLARE_METATYPE(QList<ApiTraceError>);\n\nRetracer::Retracer(QObject *parent)\n    : QThread(parent),\n      m_benchmarking(false),\n      m_doubleBuffered(true),\n      m_captureState(false),\n      m_captureCall(0),\n      m_profileGpu(false),\n      m_profileCpu(false),\n      m_profilePixels(false)\n{\n    qRegisterMetaType<QList<ApiTraceError> >();\n\n#ifdef Q_OS_WIN\n    QString format = QLatin1String(\"%1;\");\n#else\n    QString format = QLatin1String(\"%1:\");\n#endif\n    QString buildPath = format.arg(APITRACE_BINARY_DIR);\n    m_processEnvironment = QProcessEnvironment::systemEnvironment();\n    m_processEnvironment.insert(\"PATH\", buildPath +\n                                m_processEnvironment.value(\"PATH\"));\n\n    qputenv(\"PATH\",\n            m_processEnvironment.value(\"PATH\").toLatin1());\n}\n\nQString Retracer::fileName() const\n{\n    return m_fileName;\n}\n\nvoid Retracer::setFileName(const QString &name)\n{\n    m_fileName = name;\n}\n\nvoid Retracer::setAPI(trace::API api)\n{\n    m_api = api;\n}\n\nbool Retracer::isBenchmarking() const\n{\n    return m_benchmarking;\n}\n\nvoid Retracer::setBenchmarking(bool bench)\n{\n    m_benchmarking = bench;\n}\n\nbool Retracer::isDoubleBuffered() const\n{\n    return m_doubleBuffered;\n}\n\nvoid Retracer::setDoubleBuffered(bool db)\n{\n    m_doubleBuffered = db;\n}\n\nbool Retracer::isProfilingGpu() const\n{\n    return m_profileGpu;\n}\n\nbool Retracer::isProfilingCpu() const\n{\n    return m_profileCpu;\n}\n\nbool Retracer::isProfilingPixels() const\n{\n    return m_profilePixels;\n}\n\nbool Retracer::isProfiling() const\n{\n    return m_profileGpu || m_profileCpu || m_profilePixels;\n}\n\nvoid Retracer::setProfiling(bool gpu, bool cpu, bool pixels)\n{\n    m_profileGpu = gpu;\n    m_profileCpu = cpu;\n    m_profilePixels = pixels;\n}\n\nvoid Retracer::setCaptureAtCallNumber(qlonglong num)\n{\n    m_captureCall = num;\n}\n\nqlonglong Retracer::captureAtCallNumber() const\n{\n    return m_captureCall;\n}\n\nbool Retracer::captureState() const\n{\n    return m_captureState;\n}\n\nvoid Retracer::setCaptureState(bool enable)\n{\n    m_captureState = enable;\n}\n\nbool Retracer::captureThumbnails() const\n{\n    return m_captureThumbnails;\n}\n\nvoid Retracer::setCaptureThumbnails(bool enable)\n{\n    m_captureThumbnails = enable;\n}\n\n\/**\n * Starting point for the retracing thread.\n *\n * Overrides QThread::run().\n *\/\nvoid Retracer::run()\n{\n    QString msg = QLatin1String(\"Replay finished!\");\n\n    \/*\n     * Construct command line\n     *\/\n\n    QString prog;\n    QStringList arguments;\n\n    switch (m_api) {\n    case trace::API_GL:\n        prog = QLatin1String(\"glretrace\");\n        break;\n    case trace::API_EGL:\n        prog = QLatin1String(\"eglretrace\");\n        break;\n    case trace::API_DX:\n    case trace::API_D3D7:\n    case trace::API_D3D8:\n    case trace::API_D3D9:\n    case trace::API_D3D10:\n    case trace::API_D3D10_1:\n    case trace::API_D3D11:\n#ifdef Q_OS_WIN\n        prog = QLatin1String(\"d3dretrace\");\n#else\n        prog = QLatin1String(\"wine\");\n        arguments << QLatin1String(\"d3dretrace.exe\");\n#endif\n        break;\n    default:\n        emit finished(QLatin1String(\"Unsupported API\"));\n        return;\n    }\n\n    if (m_captureState) {\n        arguments << QLatin1String(\"-D\");\n        arguments << QString::number(m_captureCall);\n    } else if (m_captureThumbnails) {\n        arguments << QLatin1String(\"-s\"); \/\/ emit snapshots\n        arguments << QLatin1String(\"-\"); \/\/ emit to stdout\n    } else if (isProfiling()) {\n        if (m_profileGpu) {\n            arguments << QLatin1String(\"--pgpu\");\n        }\n\n        if (m_profileCpu) {\n            arguments << QLatin1String(\"--pcpu\");\n        }\n\n        if (m_profilePixels) {\n            arguments << QLatin1String(\"--ppd\");\n        }\n    } else {\n        if (m_doubleBuffered) {\n            arguments << QLatin1String(\"--db\");\n        } else {\n            arguments << QLatin1String(\"--sb\");\n        }\n\n        if (m_benchmarking) {\n            arguments << QLatin1String(\"-b\");\n        }\n    }\n\n    arguments << m_fileName;\n\n    \/*\n     * Start the process.\n     *\/\n\n    QProcess process;\n\n    process.start(prog, arguments, QIODevice::ReadOnly);\n    if (!process.waitForStarted(-1)) {\n        emit finished(QLatin1String(\"Could not start process\"));\n        return;\n    }\n\n    \/*\n     * Process standard output\n     *\/\n\n    QList<QImage> thumbnails;\n    QVariantMap parsedJson;\n    trace::Profile* profile = NULL;\n\n    process.setReadChannel(QProcess::StandardOutput);\n    if (process.waitForReadyRead(-1)) {\n        BlockingIODevice io(&process);\n\n        if (m_captureState) {\n            \/*\n             * Parse JSON from the output.\n             *\n             * XXX: QJSON's scanner is inneficient as it abuses single\n             * character QIODevice::peek (not cheap), instead of maintaining a\n             * lookahead character on its own.\n             *\/\n\n            bool ok = false;\n            QJson::Parser jsonParser;\n\n            \/\/ Allow Nan\/Infinity\n            jsonParser.allowSpecialNumbers(true);\n#if 0\n            parsedJson = jsonParser.parse(&io, &ok).toMap();\n#else\n            \/*\n             * XXX: QJSON expects blocking IO, and it looks like\n             * BlockingIODevice does not work reliably in all cases.\n             *\/\n            process.waitForFinished(-1);\n            parsedJson = jsonParser.parse(&process, &ok).toMap();\n#endif\n            if (!ok) {\n                msg = QLatin1String(\"failed to parse JSON\");\n            }\n        } else if (m_captureThumbnails) {\n            \/*\n             * Parse concatenated PNM images from output.\n             *\/\n\n            while (!io.atEnd()) {\n                unsigned channels = 0;\n                unsigned width = 0;\n                unsigned height = 0;\n\n                char header[512];\n                qint64 headerSize = 0;\n                int headerLines = 3; \/\/ assume no optional comment line\n\n                for (int headerLine = 0; headerLine < headerLines; ++headerLine) {\n                    qint64 headerRead = io.readLine(&header[headerSize], sizeof(header) - headerSize);\n\n                    \/\/ if header actually contains optional comment line, ...\n                    if (headerLine == 1 && header[headerSize] == '#') {\n                        ++headerLines;\n                    }\n\n                    headerSize += headerRead;\n                }\n\n                const char *headerEnd = image::readPNMHeader(header, headerSize, &channels, &width, &height);\n\n                \/\/ if invalid PNM header was encountered, ...\n                if (header == headerEnd) {\n                    qDebug() << \"error: invalid snapshot stream encountered\";\n                    break;\n                }\n\n                \/\/ qDebug() << \"channels: \" << channels << \", width: \" << width << \", height: \" << height\";\n\n                QImage snapshot = QImage(width, height, channels == 1 ? QImage::Format_Mono : QImage::Format_RGB888);\n\n                int rowBytes = channels * width;\n                for (int y = 0; y < height; ++y) {\n                    unsigned char *scanLine = snapshot.scanLine(y);\n                    qint64 readBytes = io.read((char *) scanLine, rowBytes);\n                    Q_ASSERT(readBytes == rowBytes);\n                }\n\n                QImage thumb = thumbnail(snapshot);\n                thumbnails.append(thumb);\n            }\n\n            Q_ASSERT(process.state() != QProcess::Running);\n        } else if (isProfiling()) {\n            profile = new trace::Profile();\n\n            while (!io.atEnd()) {\n                char line[256];\n                qint64 lineLength;\n\n                lineLength = io.readLine(line, 256);\n\n                if (lineLength == -1)\n                    break;\n\n                trace::Profiler::parseLine(line, profile);\n            }\n        } else {\n            QByteArray output;\n            output = process.readAllStandardOutput();\n            if (output.length() < 80) {\n                msg = QString::fromUtf8(output);\n            }\n        }\n    }\n\n    \/*\n     * Wait for process termination\n     *\/\n\n    process.waitForFinished(-1);\n\n    if (process.exitStatus() != QProcess::NormalExit) {\n        msg = QLatin1String(\"Process crashed\");\n    } else if (process.exitCode() != 0) {\n        msg = QLatin1String(\"Process exited with non zero exit code\");\n    }\n\n    \/*\n     * Parse errors.\n     *\/\n\n    QList<ApiTraceError> errors;\n    process.setReadChannel(QProcess::StandardError);\n    QRegExp regexp(\"(^\\\\d+): +(\\\\b\\\\w+\\\\b): ([^\\\\r\\\\n]+)[\\\\r\\\\n]*$\");\n    while (!process.atEnd()) {\n        QString line = process.readLine();\n        if (regexp.indexIn(line) != -1) {\n            ApiTraceError error;\n            error.callIndex = regexp.cap(1).toInt();\n            error.type = regexp.cap(2);\n            error.message = regexp.cap(3);\n            errors.append(error);\n        } else if (!errors.isEmpty()) {\n            \/\/ Probably a multiligne message\n            ApiTraceError &previous = errors.last();\n            if (line.endsWith(\"\\n\")) {\n                line.chop(1);\n            }\n            previous.message.append('\\n');\n            previous.message.append(line);\n        }\n    }\n\n    \/*\n     * Emit signals\n     *\/\n\n    if (m_captureState) {\n        ApiTraceState *state = new ApiTraceState(parsedJson);\n        emit foundState(state);\n        msg = QLatin1String(\"State fetched.\");\n    }\n\n    if (m_captureThumbnails && !thumbnails.isEmpty()) {\n        emit foundThumbnails(thumbnails);\n    }\n\n    if (isProfiling() && profile) {\n        emit foundProfile(profile);\n    }\n\n    if (!errors.isEmpty()) {\n        emit retraceErrors(errors);\n    }\n\n    emit finished(msg);\n}\n\n#include \"retracer.moc\"\n<commit_msg>gui: Silence unused var warning.<commit_after>#include \"retracer.h\"\n\n#include \"apitracecall.h\"\n#include \"thumbnail.h\"\n\n#include \"image.hpp\"\n\n#include \"trace_profiler.hpp\"\n\n#include <QDebug>\n#include <QVariant>\n#include <QList>\n#include <QImage>\n\n#include <qjson\/parser.h>\n\n\/**\n * Wrapper around a QProcess which enforces IO to block .\n *\n * Several QIODevice users (notably QJSON) expect blocking semantics, e.g.,\n * they expect that QIODevice::read() will blocked until the requested ammount\n * of bytes is read or end of file is reached. But by default QProcess, does\n * not block.  And passing QIODevice::Unbuffered mitigates but does not fully\n * address the problem either.\n *\n * This class wraps around QProcess, providing QIODevice interface, while\n * ensuring that all reads block.\n *\n * This class also works around a bug in QProcess::atEnd() implementation.\n *\n * See also:\n * - http:\/\/qt-project.org\/wiki\/Simple_Crypt_IO_Device\n * - http:\/\/qt-project.org\/wiki\/Custom_IO_Device\n *\/\nclass BlockingIODevice : public QIODevice\n{\n    \/* We don't use the Q_OBJECT in this class given we don't declare any\n     * signals and slots or use any other services provided by Qt's meta-object\n     * system. *\/\npublic:\n    BlockingIODevice(QProcess * io);\n    bool isSequential() const;\n    bool atEnd() const;\n    bool waitForReadyRead(int msecs = -1);\n\nprotected:\n    qint64 readData(char * data, qint64 maxSize);\n    qint64 writeData(const char * data, qint64 maxSize);\n\nprivate:\n    QProcess *m_device;\n};\n\nBlockingIODevice::BlockingIODevice(QProcess * io) :\n    m_device(io)\n{\n    \/*\n     * We pass QIODevice::Unbuffered to prevent the base QIODevice class to do\n     * its own buffering on top of the overridden readData() method.\n     *\n     * The only buffering used will be to satisfy QIODevice::peek() and\n     * QIODevice::ungetChar().\n     *\/\n    setOpenMode(ReadOnly | Unbuffered);\n}\n\nbool BlockingIODevice::isSequential() const\n{\n    return true;\n}\n\nbool BlockingIODevice::atEnd() const\n{\n    \/*\n     * XXX: QProcess::atEnd() documentation is wrong -- it will return true\n     * even when the process is running --, so we try to workaround that here.\n     *\/\n    if (m_device->atEnd()) {\n        if (m_device->state() == QProcess::Running) {\n            if (!m_device->waitForReadyRead(-1)) {\n                return true;\n            }\n        }\n    }\n    return false;\n}\n\nbool BlockingIODevice::waitForReadyRead(int msecs)\n{\n    Q_UNUSED(msecs);\n    return true;\n}\n\nqint64 BlockingIODevice::readData(char * data, qint64 maxSize)\n{\n    qint64 bytesToRead = maxSize;\n    qint64 readSoFar = 0;\n    do {\n        qint64 chunkSize = m_device->read(data + readSoFar, bytesToRead);\n        if (chunkSize < 0) {\n            if (readSoFar) {\n                return readSoFar;\n            } else {\n                return chunkSize;\n            }\n        }\n        Q_ASSERT(chunkSize <= bytesToRead);\n        bytesToRead -= chunkSize;\n        readSoFar += chunkSize;\n        if (bytesToRead) {\n            if (!m_device->waitForReadyRead(-1)) {\n                qDebug() << \"waitForReadyRead failed\\n\";\n                break;\n            }\n        }\n    } while(bytesToRead);\n\n    return readSoFar;\n}\n\nqint64 BlockingIODevice::writeData(const char * data, qint64 maxSize)\n{\n    Q_ASSERT(false);\n    return -1;\n}\n\nQ_DECLARE_METATYPE(QList<ApiTraceError>);\n\nRetracer::Retracer(QObject *parent)\n    : QThread(parent),\n      m_benchmarking(false),\n      m_doubleBuffered(true),\n      m_captureState(false),\n      m_captureCall(0),\n      m_profileGpu(false),\n      m_profileCpu(false),\n      m_profilePixels(false)\n{\n    qRegisterMetaType<QList<ApiTraceError> >();\n\n#ifdef Q_OS_WIN\n    QString format = QLatin1String(\"%1;\");\n#else\n    QString format = QLatin1String(\"%1:\");\n#endif\n    QString buildPath = format.arg(APITRACE_BINARY_DIR);\n    m_processEnvironment = QProcessEnvironment::systemEnvironment();\n    m_processEnvironment.insert(\"PATH\", buildPath +\n                                m_processEnvironment.value(\"PATH\"));\n\n    qputenv(\"PATH\",\n            m_processEnvironment.value(\"PATH\").toLatin1());\n}\n\nQString Retracer::fileName() const\n{\n    return m_fileName;\n}\n\nvoid Retracer::setFileName(const QString &name)\n{\n    m_fileName = name;\n}\n\nvoid Retracer::setAPI(trace::API api)\n{\n    m_api = api;\n}\n\nbool Retracer::isBenchmarking() const\n{\n    return m_benchmarking;\n}\n\nvoid Retracer::setBenchmarking(bool bench)\n{\n    m_benchmarking = bench;\n}\n\nbool Retracer::isDoubleBuffered() const\n{\n    return m_doubleBuffered;\n}\n\nvoid Retracer::setDoubleBuffered(bool db)\n{\n    m_doubleBuffered = db;\n}\n\nbool Retracer::isProfilingGpu() const\n{\n    return m_profileGpu;\n}\n\nbool Retracer::isProfilingCpu() const\n{\n    return m_profileCpu;\n}\n\nbool Retracer::isProfilingPixels() const\n{\n    return m_profilePixels;\n}\n\nbool Retracer::isProfiling() const\n{\n    return m_profileGpu || m_profileCpu || m_profilePixels;\n}\n\nvoid Retracer::setProfiling(bool gpu, bool cpu, bool pixels)\n{\n    m_profileGpu = gpu;\n    m_profileCpu = cpu;\n    m_profilePixels = pixels;\n}\n\nvoid Retracer::setCaptureAtCallNumber(qlonglong num)\n{\n    m_captureCall = num;\n}\n\nqlonglong Retracer::captureAtCallNumber() const\n{\n    return m_captureCall;\n}\n\nbool Retracer::captureState() const\n{\n    return m_captureState;\n}\n\nvoid Retracer::setCaptureState(bool enable)\n{\n    m_captureState = enable;\n}\n\nbool Retracer::captureThumbnails() const\n{\n    return m_captureThumbnails;\n}\n\nvoid Retracer::setCaptureThumbnails(bool enable)\n{\n    m_captureThumbnails = enable;\n}\n\n\/**\n * Starting point for the retracing thread.\n *\n * Overrides QThread::run().\n *\/\nvoid Retracer::run()\n{\n    QString msg = QLatin1String(\"Replay finished!\");\n\n    \/*\n     * Construct command line\n     *\/\n\n    QString prog;\n    QStringList arguments;\n\n    switch (m_api) {\n    case trace::API_GL:\n        prog = QLatin1String(\"glretrace\");\n        break;\n    case trace::API_EGL:\n        prog = QLatin1String(\"eglretrace\");\n        break;\n    case trace::API_DX:\n    case trace::API_D3D7:\n    case trace::API_D3D8:\n    case trace::API_D3D9:\n    case trace::API_D3D10:\n    case trace::API_D3D10_1:\n    case trace::API_D3D11:\n#ifdef Q_OS_WIN\n        prog = QLatin1String(\"d3dretrace\");\n#else\n        prog = QLatin1String(\"wine\");\n        arguments << QLatin1String(\"d3dretrace.exe\");\n#endif\n        break;\n    default:\n        emit finished(QLatin1String(\"Unsupported API\"));\n        return;\n    }\n\n    if (m_captureState) {\n        arguments << QLatin1String(\"-D\");\n        arguments << QString::number(m_captureCall);\n    } else if (m_captureThumbnails) {\n        arguments << QLatin1String(\"-s\"); \/\/ emit snapshots\n        arguments << QLatin1String(\"-\"); \/\/ emit to stdout\n    } else if (isProfiling()) {\n        if (m_profileGpu) {\n            arguments << QLatin1String(\"--pgpu\");\n        }\n\n        if (m_profileCpu) {\n            arguments << QLatin1String(\"--pcpu\");\n        }\n\n        if (m_profilePixels) {\n            arguments << QLatin1String(\"--ppd\");\n        }\n    } else {\n        if (m_doubleBuffered) {\n            arguments << QLatin1String(\"--db\");\n        } else {\n            arguments << QLatin1String(\"--sb\");\n        }\n\n        if (m_benchmarking) {\n            arguments << QLatin1String(\"-b\");\n        }\n    }\n\n    arguments << m_fileName;\n\n    \/*\n     * Start the process.\n     *\/\n\n    QProcess process;\n\n    process.start(prog, arguments, QIODevice::ReadOnly);\n    if (!process.waitForStarted(-1)) {\n        emit finished(QLatin1String(\"Could not start process\"));\n        return;\n    }\n\n    \/*\n     * Process standard output\n     *\/\n\n    QList<QImage> thumbnails;\n    QVariantMap parsedJson;\n    trace::Profile* profile = NULL;\n\n    process.setReadChannel(QProcess::StandardOutput);\n    if (process.waitForReadyRead(-1)) {\n        BlockingIODevice io(&process);\n\n        if (m_captureState) {\n            \/*\n             * Parse JSON from the output.\n             *\n             * XXX: QJSON's scanner is inneficient as it abuses single\n             * character QIODevice::peek (not cheap), instead of maintaining a\n             * lookahead character on its own.\n             *\/\n\n            bool ok = false;\n            QJson::Parser jsonParser;\n\n            \/\/ Allow Nan\/Infinity\n            jsonParser.allowSpecialNumbers(true);\n#if 0\n            parsedJson = jsonParser.parse(&io, &ok).toMap();\n#else\n            \/*\n             * XXX: QJSON expects blocking IO, and it looks like\n             * BlockingIODevice does not work reliably in all cases.\n             *\/\n            process.waitForFinished(-1);\n            parsedJson = jsonParser.parse(&process, &ok).toMap();\n#endif\n            if (!ok) {\n                msg = QLatin1String(\"failed to parse JSON\");\n            }\n        } else if (m_captureThumbnails) {\n            \/*\n             * Parse concatenated PNM images from output.\n             *\/\n\n            while (!io.atEnd()) {\n                unsigned channels = 0;\n                unsigned width = 0;\n                unsigned height = 0;\n\n                char header[512];\n                qint64 headerSize = 0;\n                int headerLines = 3; \/\/ assume no optional comment line\n\n                for (int headerLine = 0; headerLine < headerLines; ++headerLine) {\n                    qint64 headerRead = io.readLine(&header[headerSize], sizeof(header) - headerSize);\n\n                    \/\/ if header actually contains optional comment line, ...\n                    if (headerLine == 1 && header[headerSize] == '#') {\n                        ++headerLines;\n                    }\n\n                    headerSize += headerRead;\n                }\n\n                const char *headerEnd = image::readPNMHeader(header, headerSize, &channels, &width, &height);\n\n                \/\/ if invalid PNM header was encountered, ...\n                if (header == headerEnd) {\n                    qDebug() << \"error: invalid snapshot stream encountered\";\n                    break;\n                }\n\n                \/\/ qDebug() << \"channels: \" << channels << \", width: \" << width << \", height: \" << height\";\n\n                QImage snapshot = QImage(width, height, channels == 1 ? QImage::Format_Mono : QImage::Format_RGB888);\n\n                int rowBytes = channels * width;\n                for (int y = 0; y < height; ++y) {\n                    unsigned char *scanLine = snapshot.scanLine(y);\n                    qint64 readBytes = io.read((char *) scanLine, rowBytes);\n                    Q_ASSERT(readBytes == rowBytes);\n                    (void)readBytes;\n                }\n\n                QImage thumb = thumbnail(snapshot);\n                thumbnails.append(thumb);\n            }\n\n            Q_ASSERT(process.state() != QProcess::Running);\n        } else if (isProfiling()) {\n            profile = new trace::Profile();\n\n            while (!io.atEnd()) {\n                char line[256];\n                qint64 lineLength;\n\n                lineLength = io.readLine(line, 256);\n\n                if (lineLength == -1)\n                    break;\n\n                trace::Profiler::parseLine(line, profile);\n            }\n        } else {\n            QByteArray output;\n            output = process.readAllStandardOutput();\n            if (output.length() < 80) {\n                msg = QString::fromUtf8(output);\n            }\n        }\n    }\n\n    \/*\n     * Wait for process termination\n     *\/\n\n    process.waitForFinished(-1);\n\n    if (process.exitStatus() != QProcess::NormalExit) {\n        msg = QLatin1String(\"Process crashed\");\n    } else if (process.exitCode() != 0) {\n        msg = QLatin1String(\"Process exited with non zero exit code\");\n    }\n\n    \/*\n     * Parse errors.\n     *\/\n\n    QList<ApiTraceError> errors;\n    process.setReadChannel(QProcess::StandardError);\n    QRegExp regexp(\"(^\\\\d+): +(\\\\b\\\\w+\\\\b): ([^\\\\r\\\\n]+)[\\\\r\\\\n]*$\");\n    while (!process.atEnd()) {\n        QString line = process.readLine();\n        if (regexp.indexIn(line) != -1) {\n            ApiTraceError error;\n            error.callIndex = regexp.cap(1).toInt();\n            error.type = regexp.cap(2);\n            error.message = regexp.cap(3);\n            errors.append(error);\n        } else if (!errors.isEmpty()) {\n            \/\/ Probably a multiligne message\n            ApiTraceError &previous = errors.last();\n            if (line.endsWith(\"\\n\")) {\n                line.chop(1);\n            }\n            previous.message.append('\\n');\n            previous.message.append(line);\n        }\n    }\n\n    \/*\n     * Emit signals\n     *\/\n\n    if (m_captureState) {\n        ApiTraceState *state = new ApiTraceState(parsedJson);\n        emit foundState(state);\n        msg = QLatin1String(\"State fetched.\");\n    }\n\n    if (m_captureThumbnails && !thumbnails.isEmpty()) {\n        emit foundThumbnails(thumbnails);\n    }\n\n    if (isProfiling() && profile) {\n        emit foundProfile(profile);\n    }\n\n    if (!errors.isEmpty()) {\n        emit retraceErrors(errors);\n    }\n\n    emit finished(msg);\n}\n\n#include \"retracer.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/python.hpp>\n#include <stddef.h>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n#include <opengm\/inference\/inference.hxx>\n#include <opengm\/operations\/adder.hxx>\n#include <opengm\/operations\/multiplier.hxx>\n#include <opengm\/operations\/minimizer.hxx>\n#include <opengm\/operations\/maximizer.hxx>\n#include <opengm\/operations\/integrator.hxx>\n\n#include \"pyInference.hxx\"\n#include \"pyIcm.hxx\"\n#include \"pyGraphcut.hxx\"\n#include \"pyTrbp.hxx\"\n#include \"pyBp.hxx\"\n#include \"pyAstar.hxx\"\n\n\n\/\/#include \"pyGibbs.hxx\"\n#include \"pyBruteforce.hxx\"\n#include \"pyLazyflipper.hxx\"\n#include \"pyDynp.hxx\"\n\n#include  \"pyAe.hxx\"\n#include  \"pyAbSwap.hxx\"\n#include  \"pyPartitionMove.hxx\"\n\n\n#include \"pyDualDecompositionSubGradient.hxx\"\n\/\/#include \"pyDualDecompositionMerit.hxx\"\n#ifdef WITH_CONICBUNDLE\n   \/\/#include \"pyDualDecompositionBundle.hxx\"\n#endif\n#ifdef WITH_LIBDAI\n#include  \"pyLibdai.hxx\" \n#endif\n\n#ifdef WITH_CPLEX\n#include \"pyCplex.hxx\"\n#include \"pyMultiCut.hxx\"\n#endif\n\n#ifdef WITH_TRWS\n#include \"pyTrws.hxx\"\n#endif\n\n#ifdef WITH_MRF\n#include \"pyMrf.hxx\"\n#endif\n\n#ifdef WITH_FASTPD\n#include \"pyFastPD.hxx\"\n#endif\n\n\n#ifdef WITH_AD3\n#include \"pyAd3.hxx\"\n#include \"pyLoc.hxx\"\n#endif\n\n\n#include \"pyQpbo.hxx\"\n\n#ifdef WITH_QPBO\n#include \"pyQpbo.hxx\"\n#include \"pyMQpbo.hxx\"\n#include \"pyReducedInference.hxx\"\n#include  \"pyAeFusion.hxx\"\n#endif\n\n\n\n#if !defined(NOVIGRA) && (defined(WITH_QPBO) || (defined(WITH_BLOSSOM5) && defined(WITH_PLANARITY) ) )\n#include \"pyCgc.hxx\"\n#include \"pyIntersectionBased.hxx\"\n#else\n#error \"something went wrong\"\n#endif\n\n\n\/\/#include \"pyPbp.hxx\"\n\n#include \"pyFusionMoves.hxx\"\n#include \"pySelfFusion.hxx\"\n#include \"pyFusionBased.hxx\"\n\n\/\/#include \"pySwendsenWang.hxx\"\n\n\/\/#include \"pyLpInference.hxx\"\n\n\n#include <opengm\/python\/opengmpython.hxx>\n#include <opengm\/python\/converter.hxx>\n#include <opengm\/python\/numpyview.hxx>\n#include <opengm\/python\/pythonfunction.hxx>\n\n\/\/ include the LPDef symbols only once!\n#undef OPENGM_LPDEF_NO_SYMBOLS\n#include <opengm\/inference\/auxiliary\/lpdef.hxx>\n\nusing namespace boost::python;\n\n\nBOOST_PYTHON_MODULE_INIT(_inference) {\n\n   Py_Initialize();\n   PyEval_InitThreads();\n   boost::python::numeric::array::set_module_and_type(\"numpy\", \"ndarray\");\n   \n   std::string adderString=\"adder\";\n   std::string multiplierString=\"multiplier\";\n   std::string minimizerString=\"minimizer\";\n   std::string maximizerString=\"maximizer\";\n   std::string integratorString=\"integrator\";\n   std::string substring,submoduleName,subsubmoduleName,subsubstring;\n   docstring_options doc_options(true,true,false);\n   scope current;\n   std::string currentScopeName(extract<const char*>(current.attr(\"__name__\")));\n   currentScopeName=\"inference\";\n   \/\/import_array();\n   export_inference();\n   \/\/adder\n   {\n      substring=adderString;\n      submoduleName = currentScopeName + std::string(\".\") + substring;\n      \/\/ Create the submodule, and attach it to the current scope.\n      object submodule(borrowed(PyImport_AddModule(submoduleName.c_str())));\n      current.attr(substring.c_str()) = submodule;\n      submodule.attr(\"__package__\")=submoduleName.c_str();\n      \/\/ Switch the scope to the submodule, add methods and classes.\n      scope submoduleScope = submodule;\n      \/\/ minimizer\n      {\n         subsubstring=minimizerString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         \/\/ Switch the scope to the submodule, add methods and classes.\n         scope subsubmoduleScope = subsubmodule;\n\n         export_icm<opengm::python::GmAdder,opengm::Minimizer>();\n         \/\/export_pbp<opengm::python::GmAdder,opengm::Minimizer>();\n         export_bp<opengm::python::GmAdder,opengm::Minimizer>();\n         export_trbp<opengm::python::GmAdder,opengm::Minimizer>();\n         export_astar<opengm::python::GmAdder,opengm::Minimizer>();\n         \/\/export_gibbs<opengm::python::GmAdder,opengm::Minimizer>();\n         \n         export_dual_decomposition_subgradient<opengm::python::GmAdder,opengm::Minimizer>();\n\n         \/\/export_self_fusion<opengm::python::GmAdder,opengm::Minimizer>();\n         export_fusion_moves<opengm::python::GmAdder,opengm::Minimizer>();\n         \n         #ifdef WITH_CONICBUNDLE\n            \/\/export_dual_decomposition_bundle<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n         export_lazyflipper<opengm::python::GmAdder,opengm::Minimizer>();\n         #ifdef WITH_AD3\n         export_loc<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n         export_bruteforce<opengm::python::GmAdder,opengm::Minimizer>();\n         export_graphcut<opengm::python::GmAdder,opengm::Minimizer>();\n         export_abswap<opengm::python::GmAdder,opengm::Minimizer>();\n         export_ae<opengm::python::GmAdder,opengm::Minimizer>();\n         export_dynp<opengm::python::GmAdder,opengm::Minimizer>();\n         export_partition_move<opengm::python::GmAdder,opengm::Minimizer>();\n         \n         \/\/export_qpbo<opengm::python::GmAdder,opengm::Minimizer>();\n         #ifdef WITH_QPBO\n         export_reduced_inference<opengm::python::GmAdder,opengm::Minimizer>();\n         export_ae_fusion<opengm::python::GmAdder,opengm::Minimizer>();\n         export_mqpbo<opengm::python::GmAdder,opengm::Minimizer>();\n         export_qpbo_external<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n         #ifdef WITH_TRWS\n         export_trws<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n         \n         #ifdef WITH_CPLEX\n         export_cplex<opengm::python::GmAdder,opengm::Minimizer>();\n         export_multicut<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n        #if defined(WITH_QPBO) || defined(WITH_CPLEX) || defined(WITH_BLOSSOM5) && defined(WITH_PLANARITY)\n        \/\/export_cgc<opengm::python::GmAdder,opengm::Minimizer>();\n       \texport_intersection_based<opengm::python::GmAdder,opengm::Minimizer>();\n        #endif\n\n         \/\/export_lp_inference<opengm::python::GmAdder,opengm::Minimizer>();\n\n         #ifdef WITH_LIBDAI\n         export_libdai_inference<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n         #ifdef WITH_MRF\n         export_mrf<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n         #ifdef WITH_FASTPD\n         export_fast_pd<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n         #ifdef WITH_AD3\n         export_ad3<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n         export_self_fusion<opengm::python::GmAdder,opengm::Minimizer>();\n         export_fusion_based<opengm::python::GmAdder,opengm::Minimizer>();\n      }\n      \/\/ maximizer\n      {\n         subsubstring=maximizerString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         \/\/ Switch the scope to the submodule, add methods and classes.\n         scope subsubmoduleScope = subsubmodule;\n         export_icm<opengm::python::GmAdder,opengm::Maximizer>();\n         export_bp<opengm::python::GmAdder,opengm::Maximizer>();\n         export_trbp<opengm::python::GmAdder,opengm::Maximizer>();\n         export_astar<opengm::python::GmAdder,opengm::Maximizer>();\n         export_lazyflipper<opengm::python::GmAdder,opengm::Maximizer>();\n         #ifdef WITH_AD3\n         export_loc<opengm::python::GmAdder,opengm::Maximizer>();\n         #endif\n         export_bruteforce<opengm::python::GmAdder,opengm::Maximizer>();\n         export_dynp<opengm::python::GmAdder,opengm::Maximizer>();\n\n         #ifdef WITH_AD3\n         export_ad3<opengm::python::GmAdder,opengm::Maximizer>();\n         #endif\n      }\n      \/\/ integrator\n      {\n         subsubstring=integratorString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         scope subsubmoduleScope = subsubmodule;\n\n         export_bp<opengm::python::GmAdder,opengm::Integrator>();\n         export_trbp<opengm::python::GmAdder,opengm::Integrator>();\n         \/\/export_dynp<opengm::python::GmMultiplier,opengm::Maximizer>();\n      }\n   }\n   \/\/multiplier\n   {\n      substring=multiplierString;\n      submoduleName = currentScopeName + std::string(\".\") + substring;\n      \/\/ Create the submodule, and attach it to the current scope.\n      object submodule(borrowed(PyImport_AddModule(submoduleName.c_str())));\n      current.attr(substring.c_str()) = submodule;\n      submodule.attr(\"__package__\")=submoduleName.c_str();\n      \/\/ Switch the scope to the submodule, add methods and classes.\n      scope submoduleScope = submodule;\n      \/\/ minimizer\n      {\n         subsubstring=minimizerString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         \/\/ Switch the scope to the submodule, add methods and classes.\n         scope subsubmoduleScope = subsubmodule;\n         export_icm<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_bp<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_trbp<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_astar<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_lazyflipper<opengm::python::GmMultiplier,opengm::Minimizer>();\n         \/\/export_loc<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_bruteforce<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_dynp<opengm::python::GmMultiplier,opengm::Minimizer>();\n      }\n      \/\/ maximizer\n      {\n         subsubstring=maximizerString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         \/\/ Switch the scope to the submodule, add methods and classes.\n         scope subsubmoduleScope = subsubmodule;\n         export_icm<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_bp<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_trbp<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_astar<opengm::python::GmMultiplier,opengm::Maximizer>();\n         \/\/export_gibbs<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_lazyflipper<opengm::python::GmMultiplier,opengm::Maximizer>();\n         \/\/export_loc<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_bruteforce<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_dynp<opengm::python::GmMultiplier,opengm::Maximizer>();\n      }\n      \/\/ integrator\n      {\n         subsubstring=integratorString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         scope subsubmoduleScope = subsubmodule;\n\n         export_bp<opengm::python::GmMultiplier,opengm::Integrator>();\n         export_trbp<opengm::python::GmMultiplier,opengm::Integrator>();\n         \/\/export_dynp<opengm::python::GmMultiplier,opengm::Maximizer>();\n      }\n   }\n}\n<commit_msg>hotfix<commit_after>#include <boost\/python.hpp>\n#include <stddef.h>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n#include <opengm\/inference\/inference.hxx>\n#include <opengm\/operations\/adder.hxx>\n#include <opengm\/operations\/multiplier.hxx>\n#include <opengm\/operations\/minimizer.hxx>\n#include <opengm\/operations\/maximizer.hxx>\n#include <opengm\/operations\/integrator.hxx>\n\n#include \"pyInference.hxx\"\n#include \"pyIcm.hxx\"\n#include \"pyGraphcut.hxx\"\n#include \"pyTrbp.hxx\"\n#include \"pyBp.hxx\"\n#include \"pyAstar.hxx\"\n\n\n\/\/#include \"pyGibbs.hxx\"\n#include \"pyBruteforce.hxx\"\n#include \"pyLazyflipper.hxx\"\n#include \"pyDynp.hxx\"\n\n#include  \"pyAe.hxx\"\n#include  \"pyAbSwap.hxx\"\n#include  \"pyPartitionMove.hxx\"\n\n\n#include \"pyDualDecompositionSubGradient.hxx\"\n\/\/#include \"pyDualDecompositionMerit.hxx\"\n#ifdef WITH_CONICBUNDLE\n   \/\/#include \"pyDualDecompositionBundle.hxx\"\n#endif\n#ifdef WITH_LIBDAI\n#include  \"pyLibdai.hxx\" \n#endif\n\n#ifdef WITH_CPLEX\n#include \"pyCplex.hxx\"\n#include \"pyMultiCut.hxx\"\n#endif\n\n#ifdef WITH_TRWS\n#include \"pyTrws.hxx\"\n#endif\n\n#ifdef WITH_MRF\n#include \"pyMrf.hxx\"\n#endif\n\n#ifdef WITH_FASTPD\n#include \"pyFastPD.hxx\"\n#endif\n\n\n#ifdef WITH_AD3\n#include \"pyAd3.hxx\"\n#include \"pyLoc.hxx\"\n#endif\n\n\n#include \"pyQpbo.hxx\"\n\n#ifdef WITH_QPBO\n#include \"pyQpbo.hxx\"\n#include \"pyMQpbo.hxx\"\n#include \"pyReducedInference.hxx\"\n#include  \"pyAeFusion.hxx\"\n#endif\n\n\n\n#if !defined(NOVIGRA) && (defined(WITH_QPBO) || (defined(WITH_BLOSSOM5) && defined(WITH_PLANARITY) ) )\n#include \"pyCgc.hxx\"\n#include \"pyIntersectionBased.hxx\"\n#endif\n\n\n\/\/#include \"pyPbp.hxx\"\n\n#include \"pyFusionMoves.hxx\"\n#include \"pySelfFusion.hxx\"\n#include \"pyFusionBased.hxx\"\n\n\/\/#include \"pySwendsenWang.hxx\"\n\n\/\/#include \"pyLpInference.hxx\"\n\n\n#include <opengm\/python\/opengmpython.hxx>\n#include <opengm\/python\/converter.hxx>\n#include <opengm\/python\/numpyview.hxx>\n#include <opengm\/python\/pythonfunction.hxx>\n\n\/\/ include the LPDef symbols only once!\n#undef OPENGM_LPDEF_NO_SYMBOLS\n#include <opengm\/inference\/auxiliary\/lpdef.hxx>\n\nusing namespace boost::python;\n\n\nBOOST_PYTHON_MODULE_INIT(_inference) {\n\n   Py_Initialize();\n   PyEval_InitThreads();\n   boost::python::numeric::array::set_module_and_type(\"numpy\", \"ndarray\");\n   \n   std::string adderString=\"adder\";\n   std::string multiplierString=\"multiplier\";\n   std::string minimizerString=\"minimizer\";\n   std::string maximizerString=\"maximizer\";\n   std::string integratorString=\"integrator\";\n   std::string substring,submoduleName,subsubmoduleName,subsubstring;\n   docstring_options doc_options(true,true,false);\n   scope current;\n   std::string currentScopeName(extract<const char*>(current.attr(\"__name__\")));\n   currentScopeName=\"inference\";\n   \/\/import_array();\n   export_inference();\n   \/\/adder\n   {\n      substring=adderString;\n      submoduleName = currentScopeName + std::string(\".\") + substring;\n      \/\/ Create the submodule, and attach it to the current scope.\n      object submodule(borrowed(PyImport_AddModule(submoduleName.c_str())));\n      current.attr(substring.c_str()) = submodule;\n      submodule.attr(\"__package__\")=submoduleName.c_str();\n      \/\/ Switch the scope to the submodule, add methods and classes.\n      scope submoduleScope = submodule;\n      \/\/ minimizer\n      {\n         subsubstring=minimizerString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         \/\/ Switch the scope to the submodule, add methods and classes.\n         scope subsubmoduleScope = subsubmodule;\n\n         export_icm<opengm::python::GmAdder,opengm::Minimizer>();\n         \/\/export_pbp<opengm::python::GmAdder,opengm::Minimizer>();\n         export_bp<opengm::python::GmAdder,opengm::Minimizer>();\n         export_trbp<opengm::python::GmAdder,opengm::Minimizer>();\n         export_astar<opengm::python::GmAdder,opengm::Minimizer>();\n         \/\/export_gibbs<opengm::python::GmAdder,opengm::Minimizer>();\n         \n         export_dual_decomposition_subgradient<opengm::python::GmAdder,opengm::Minimizer>();\n\n         \/\/export_self_fusion<opengm::python::GmAdder,opengm::Minimizer>();\n         export_fusion_moves<opengm::python::GmAdder,opengm::Minimizer>();\n         \n         #ifdef WITH_CONICBUNDLE\n            \/\/export_dual_decomposition_bundle<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n         export_lazyflipper<opengm::python::GmAdder,opengm::Minimizer>();\n         #ifdef WITH_AD3\n         export_loc<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n         export_bruteforce<opengm::python::GmAdder,opengm::Minimizer>();\n         export_graphcut<opengm::python::GmAdder,opengm::Minimizer>();\n         export_abswap<opengm::python::GmAdder,opengm::Minimizer>();\n         export_ae<opengm::python::GmAdder,opengm::Minimizer>();\n         export_dynp<opengm::python::GmAdder,opengm::Minimizer>();\n         export_partition_move<opengm::python::GmAdder,opengm::Minimizer>();\n         \n         \/\/export_qpbo<opengm::python::GmAdder,opengm::Minimizer>();\n         #ifdef WITH_QPBO\n         export_reduced_inference<opengm::python::GmAdder,opengm::Minimizer>();\n         export_ae_fusion<opengm::python::GmAdder,opengm::Minimizer>();\n         export_mqpbo<opengm::python::GmAdder,opengm::Minimizer>();\n         export_qpbo_external<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n         #ifdef WITH_TRWS\n         export_trws<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n         \n         #ifdef WITH_CPLEX\n         export_cplex<opengm::python::GmAdder,opengm::Minimizer>();\n         export_multicut<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n        #if defined(WITH_QPBO) || defined(WITH_CPLEX) || defined(WITH_BLOSSOM5) && defined(WITH_PLANARITY)\n        \/\/export_cgc<opengm::python::GmAdder,opengm::Minimizer>();\n       \texport_intersection_based<opengm::python::GmAdder,opengm::Minimizer>();\n        #endif\n\n         \/\/export_lp_inference<opengm::python::GmAdder,opengm::Minimizer>();\n\n         #ifdef WITH_LIBDAI\n         export_libdai_inference<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n         #ifdef WITH_MRF\n         export_mrf<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n         #ifdef WITH_FASTPD\n         export_fast_pd<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n         #ifdef WITH_AD3\n         export_ad3<opengm::python::GmAdder,opengm::Minimizer>();\n         #endif\n\n         export_self_fusion<opengm::python::GmAdder,opengm::Minimizer>();\n         export_fusion_based<opengm::python::GmAdder,opengm::Minimizer>();\n      }\n      \/\/ maximizer\n      {\n         subsubstring=maximizerString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         \/\/ Switch the scope to the submodule, add methods and classes.\n         scope subsubmoduleScope = subsubmodule;\n         export_icm<opengm::python::GmAdder,opengm::Maximizer>();\n         export_bp<opengm::python::GmAdder,opengm::Maximizer>();\n         export_trbp<opengm::python::GmAdder,opengm::Maximizer>();\n         export_astar<opengm::python::GmAdder,opengm::Maximizer>();\n         export_lazyflipper<opengm::python::GmAdder,opengm::Maximizer>();\n         #ifdef WITH_AD3\n         export_loc<opengm::python::GmAdder,opengm::Maximizer>();\n         #endif\n         export_bruteforce<opengm::python::GmAdder,opengm::Maximizer>();\n         export_dynp<opengm::python::GmAdder,opengm::Maximizer>();\n\n         #ifdef WITH_AD3\n         export_ad3<opengm::python::GmAdder,opengm::Maximizer>();\n         #endif\n      }\n      \/\/ integrator\n      {\n         subsubstring=integratorString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         scope subsubmoduleScope = subsubmodule;\n\n         export_bp<opengm::python::GmAdder,opengm::Integrator>();\n         export_trbp<opengm::python::GmAdder,opengm::Integrator>();\n         \/\/export_dynp<opengm::python::GmMultiplier,opengm::Maximizer>();\n      }\n   }\n   \/\/multiplier\n   {\n      substring=multiplierString;\n      submoduleName = currentScopeName + std::string(\".\") + substring;\n      \/\/ Create the submodule, and attach it to the current scope.\n      object submodule(borrowed(PyImport_AddModule(submoduleName.c_str())));\n      current.attr(substring.c_str()) = submodule;\n      submodule.attr(\"__package__\")=submoduleName.c_str();\n      \/\/ Switch the scope to the submodule, add methods and classes.\n      scope submoduleScope = submodule;\n      \/\/ minimizer\n      {\n         subsubstring=minimizerString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         \/\/ Switch the scope to the submodule, add methods and classes.\n         scope subsubmoduleScope = subsubmodule;\n         export_icm<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_bp<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_trbp<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_astar<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_lazyflipper<opengm::python::GmMultiplier,opengm::Minimizer>();\n         \/\/export_loc<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_bruteforce<opengm::python::GmMultiplier,opengm::Minimizer>();\n         export_dynp<opengm::python::GmMultiplier,opengm::Minimizer>();\n      }\n      \/\/ maximizer\n      {\n         subsubstring=maximizerString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         \/\/ Switch the scope to the submodule, add methods and classes.\n         scope subsubmoduleScope = subsubmodule;\n         export_icm<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_bp<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_trbp<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_astar<opengm::python::GmMultiplier,opengm::Maximizer>();\n         \/\/export_gibbs<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_lazyflipper<opengm::python::GmMultiplier,opengm::Maximizer>();\n         \/\/export_loc<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_bruteforce<opengm::python::GmMultiplier,opengm::Maximizer>();\n         export_dynp<opengm::python::GmMultiplier,opengm::Maximizer>();\n      }\n      \/\/ integrator\n      {\n         subsubstring=integratorString;\n         subsubmoduleName = currentScopeName + std::string(\".\") + substring  + std::string(\".\") + subsubstring ;\n         \/\/ Create the submodule, and attach it to the current scope.\n         object subsubmodule(borrowed(PyImport_AddModule(subsubmoduleName.c_str())));\n         submoduleScope.attr(subsubstring.c_str()) = subsubmodule;\n         \/\/subsubmodule.attr(\"__package__\")=subsubmoduleName.c_str();\n         scope subsubmoduleScope = subsubmodule;\n\n         export_bp<opengm::python::GmMultiplier,opengm::Integrator>();\n         export_trbp<opengm::python::GmMultiplier,opengm::Integrator>();\n         \/\/export_dynp<opengm::python::GmMultiplier,opengm::Maximizer>();\n      }\n   }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2018-2019 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 FlightTaskOrbit.cpp\n *\/\n\n#include \"FlightTaskOrbit.hpp\"\n\n#include <mathlib\/mathlib.h>\n#include <lib\/ecl\/geo\/geo.h>\n\nusing namespace matrix;\n\nFlightTaskOrbit::FlightTaskOrbit() : _circle_approach_line(_position)\n{\n\t_sticks_data_required = false;\n}\n\nbool FlightTaskOrbit::applyCommandParameters(const vehicle_command_s &command)\n{\n\tbool ret = true;\n\t\/\/ save previous velocity and roatation direction\n\tfloat v = fabsf(_v);\n\tbool clockwise = _v > 0;\n\n\t\/\/ commanded radius\n\tif (PX4_ISFINITE(command.param1)) {\n\t\tclockwise = command.param1 > 0;\n\t\tconst float r = fabsf(command.param1);\n\t\tret = ret && setRadius(r);\n\t}\n\n\t\/\/ commanded velocity, take sign of radius as rotation direction\n\tif (PX4_ISFINITE(command.param2)) {\n\t\tv = command.param2;\n\t}\n\n\tret = ret && setVelocity(v * (clockwise ? 1.f : -1.f));\n\n\t\/\/ commanded heading behaviour\n\tif (PX4_ISFINITE(command.param3)) {\n\t\t_yaw_behaviour = command.param3;\n\t}\n\n\t\/\/ TODO: apply x,y \/ z independently in geo library\n\t\/\/ commanded center coordinates\n\t\/\/ if(PX4_ISFINITE(command.param5) && PX4_ISFINITE(command.param6)) {\n\t\/\/ \tmap_projection_global_project(command.param5, command.param6, &_center(0), &_center(1));\n\t\/\/ }\n\n\t\/\/ commanded altitude\n\t\/\/ if(PX4_ISFINITE(command.param7)) {\n\t\/\/ \t_position_setpoint(2) = gl_ref.alt - command.param7;\n\t\/\/ }\n\n\tif (PX4_ISFINITE(command.param5) && PX4_ISFINITE(command.param6) && PX4_ISFINITE(command.param7)) {\n\t\tif (globallocalconverter_tolocal(command.param5, command.param6, command.param7, &_center(0), &_center(1),\n\t\t\t\t\t\t &_position_setpoint(2))) {\n\t\t\t\/\/ global to local conversion failed\n\t\t\tret = false;\n\t\t}\n\t}\n\n\t\/\/ perpendicularly approach the orbit circle again when new parameters get commanded\n\t_in_circle_approach = true;\n\n\treturn ret;\n}\n\nbool FlightTaskOrbit::sendTelemetry()\n{\n\torbit_status_s orbit_status{};\n\torbit_status.timestamp = hrt_absolute_time();\n\torbit_status.radius = math::signNoZero(_v) * _r;\n\torbit_status.frame = 0; \/\/ MAV_FRAME::MAV_FRAME_GLOBAL\n\torbit_status.yaw_behaviour = _yaw_behaviour;\n\n\tif (globallocalconverter_toglobal(_center(0), _center(1), _position_setpoint(2), &orbit_status.x, &orbit_status.y,\n\t\t\t\t\t  &orbit_status.z)) {\n\t\treturn false; \/\/ don't send the message if the transformation failed\n\t}\n\n\t_orbit_status_pub.publish(orbit_status);\n\n\treturn true;\n}\n\nbool FlightTaskOrbit::setRadius(float r)\n{\n\t\/\/ clip the radius to be within range\n\tr = math::constrain(r, _radius_min, _radius_max);\n\n\t\/\/ small radius is more important than high velocity for safety\n\tif (!checkAcceleration(r, _v, _acceleration_max)) {\n\t\t_v = sign(_v) * sqrtf(_acceleration_max * r);\n\t}\n\n\t_r = r;\n\treturn true;\n}\n\nbool FlightTaskOrbit::setVelocity(const float v)\n{\n\tif (fabs(v) < _velocity_max &&\n\t    checkAcceleration(_r, v, _acceleration_max)) {\n\t\t_v = v;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nbool FlightTaskOrbit::checkAcceleration(float r, float v, float a)\n{\n\treturn v * v < a * r;\n}\n\nbool FlightTaskOrbit::activate(vehicle_local_position_setpoint_s last_setpoint)\n{\n\tbool ret = FlightTaskManualAltitudeSmooth::activate(last_setpoint);\n\t_r = _radius_min;\n\t_v =  1.f;\n\t_center = Vector2f(_position);\n\t_center(0) -= _r;\n\n\t_initial_heading = _yaw;\n\n\t\/\/ need a valid position and velocity\n\tret = ret && PX4_ISFINITE(_position(0))\n\t      && PX4_ISFINITE(_position(1))\n\t      && PX4_ISFINITE(_position(2))\n\t      && PX4_ISFINITE(_velocity(0))\n\t      && PX4_ISFINITE(_velocity(1))\n\t      && PX4_ISFINITE(_velocity(2));\n\n\treturn ret;\n}\n\nbool FlightTaskOrbit::update()\n{\n\t\/\/ update altitude\n\tbool ret = FlightTaskManualAltitudeSmooth::update();\n\n\t\/\/ stick input adjusts parameters within a fixed time frame\n\tconst float r = _r - _sticks.getPositionExpo()(0) * _deltatime * (_radius_max \/ 8.f);\n\tconst float v = _v - _sticks.getPositionExpo()(1) * _deltatime * (_velocity_max \/ 4.f);\n\n\tsetRadius(r);\n\tsetVelocity(v);\n\n\tVector2f center_to_position = Vector2f(_position) - _center;\n\tVector2f start_to_circle = (_r - center_to_position.norm()) * center_to_position.unit_or_zero();\n\n\tif (_in_circle_approach) {\n\t\tgenerate_circle_approach_setpoints(start_to_circle);\n\n\t} else {\n\t\tgenerate_circle_setpoints(center_to_position);\n\t\tgenerate_circle_yaw_setpoints(center_to_position);\n\t}\n\n\t\/\/ publish information to UI\n\tsendTelemetry();\n\n\treturn ret;\n}\n\nvoid FlightTaskOrbit::generate_circle_approach_setpoints(Vector2f start_to_circle)\n{\n\n\tif (_circle_approach_line.isEndReached()) {\n\t\t\/\/ calculate target point on circle and plan a line trajectory\n\t\tVector2f closest_circle_point = Vector2f(_position) + start_to_circle;\n\t\tVector3f target = Vector3f(closest_circle_point(0), closest_circle_point(1), _position(2));\n\t\t_circle_approach_line.setLineFromTo(_position, target);\n\t\t_circle_approach_line.setSpeed(_param_mpc_xy_cruise.get());\n\t\t_yaw_setpoint = atan2f(start_to_circle(1), start_to_circle(0));\n\t}\n\n\t\/\/ follow the planned line and switch to orbiting once the circle is reached\n\t_circle_approach_line.generateSetpoints(_position_setpoint, _velocity_setpoint);\n\t_in_circle_approach = !_circle_approach_line.isEndReached();\n}\n\nvoid FlightTaskOrbit::generate_circle_setpoints(Vector2f center_to_position)\n{\n\t\/\/ xy velocity to go around in a circle\n\tVector2f velocity_xy(-center_to_position(1), center_to_position(0));\n\tvelocity_xy = velocity_xy.unit_or_zero();\n\tvelocity_xy *= _v;\n\n\t\/\/ xy velocity adjustment to stay on the radius distance\n\tvelocity_xy += (_r - center_to_position.norm()) * center_to_position.unit_or_zero();\n\n\t_position_setpoint(0) = _position_setpoint(1) = NAN;\n\t_velocity_setpoint.xy() = velocity_xy;\n\t_acceleration_setpoint.xy() = -center_to_position.unit_or_zero() * _v * _v \/ _r;\n}\n\nvoid FlightTaskOrbit::generate_circle_yaw_setpoints(Vector2f center_to_position)\n{\n\tswitch (_yaw_behaviour) {\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_HOLD_INITIAL_HEADING:\n\t\t\/\/ make vehicle keep the same heading as when the orbit was commanded\n\t\t_yaw_setpoint = _initial_heading;\n\t\t_yawspeed_setpoint = NAN;\n\t\tbreak;\n\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_UNCONTROLLED:\n\t\t\/\/ no yaw setpoint\n\t\t_yaw_setpoint = NAN;\n\t\t_yawspeed_setpoint = NAN;\n\t\tbreak;\n\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_HOLD_FRONT_TANGENT_TO_CIRCLE:\n\t\tif (_r > 0) {\n\t\t\t_yaw_setpoint = atan2f(center_to_position(1), center_to_position(0)) + M_PI_F \/ 2.f;\n\n\t\t} else {\n\t\t\t_yaw_setpoint = atan2f(center_to_position(1), center_to_position(0)) - M_PI_F \/ 2.f;\n\t\t}\n\n\t\t_yawspeed_setpoint = _v \/ _r;\n\n\t\tbreak;\n\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_RC_CONTROLLED:\n\t\t_yaw_setpoint = NAN;\n\t\t_yawspeed_setpoint = _sticks.getPositionExpo()(3);\n\t\tbreak;\n\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_HOLD_FRONT_TO_CIRCLE_CENTER:\n\tdefault:\n\t\t_yaw_setpoint = atan2f(center_to_position(1), center_to_position(0)) + M_PI_F;\n\t\t\/\/ yawspeed feed-forward because we know the necessary angular rate\n\t\t_yawspeed_setpoint = _v \/ _r;\n\t\tbreak;\n\t}\n}\n<commit_msg>FlightTaskOrbit: use yaw setpoint from Altitude task with RC yaw mode<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2018-2019 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 FlightTaskOrbit.cpp\n *\/\n\n#include \"FlightTaskOrbit.hpp\"\n\n#include <mathlib\/mathlib.h>\n#include <lib\/ecl\/geo\/geo.h>\n\nusing namespace matrix;\n\nFlightTaskOrbit::FlightTaskOrbit() : _circle_approach_line(_position)\n{\n\t_sticks_data_required = false;\n}\n\nbool FlightTaskOrbit::applyCommandParameters(const vehicle_command_s &command)\n{\n\tbool ret = true;\n\t\/\/ save previous velocity and roatation direction\n\tfloat v = fabsf(_v);\n\tbool clockwise = _v > 0;\n\n\t\/\/ commanded radius\n\tif (PX4_ISFINITE(command.param1)) {\n\t\tclockwise = command.param1 > 0;\n\t\tconst float r = fabsf(command.param1);\n\t\tret = ret && setRadius(r);\n\t}\n\n\t\/\/ commanded velocity, take sign of radius as rotation direction\n\tif (PX4_ISFINITE(command.param2)) {\n\t\tv = command.param2;\n\t}\n\n\tret = ret && setVelocity(v * (clockwise ? 1.f : -1.f));\n\n\t\/\/ commanded heading behaviour\n\tif (PX4_ISFINITE(command.param3)) {\n\t\t_yaw_behaviour = command.param3;\n\t}\n\n\t\/\/ TODO: apply x,y \/ z independently in geo library\n\t\/\/ commanded center coordinates\n\t\/\/ if(PX4_ISFINITE(command.param5) && PX4_ISFINITE(command.param6)) {\n\t\/\/ \tmap_projection_global_project(command.param5, command.param6, &_center(0), &_center(1));\n\t\/\/ }\n\n\t\/\/ commanded altitude\n\t\/\/ if(PX4_ISFINITE(command.param7)) {\n\t\/\/ \t_position_setpoint(2) = gl_ref.alt - command.param7;\n\t\/\/ }\n\n\tif (PX4_ISFINITE(command.param5) && PX4_ISFINITE(command.param6) && PX4_ISFINITE(command.param7)) {\n\t\tif (globallocalconverter_tolocal(command.param5, command.param6, command.param7, &_center(0), &_center(1),\n\t\t\t\t\t\t &_position_setpoint(2))) {\n\t\t\t\/\/ global to local conversion failed\n\t\t\tret = false;\n\t\t}\n\t}\n\n\t\/\/ perpendicularly approach the orbit circle again when new parameters get commanded\n\t_in_circle_approach = true;\n\n\treturn ret;\n}\n\nbool FlightTaskOrbit::sendTelemetry()\n{\n\torbit_status_s orbit_status{};\n\torbit_status.timestamp = hrt_absolute_time();\n\torbit_status.radius = math::signNoZero(_v) * _r;\n\torbit_status.frame = 0; \/\/ MAV_FRAME::MAV_FRAME_GLOBAL\n\torbit_status.yaw_behaviour = _yaw_behaviour;\n\n\tif (globallocalconverter_toglobal(_center(0), _center(1), _position_setpoint(2), &orbit_status.x, &orbit_status.y,\n\t\t\t\t\t  &orbit_status.z)) {\n\t\treturn false; \/\/ don't send the message if the transformation failed\n\t}\n\n\t_orbit_status_pub.publish(orbit_status);\n\n\treturn true;\n}\n\nbool FlightTaskOrbit::setRadius(float r)\n{\n\t\/\/ clip the radius to be within range\n\tr = math::constrain(r, _radius_min, _radius_max);\n\n\t\/\/ small radius is more important than high velocity for safety\n\tif (!checkAcceleration(r, _v, _acceleration_max)) {\n\t\t_v = sign(_v) * sqrtf(_acceleration_max * r);\n\t}\n\n\t_r = r;\n\treturn true;\n}\n\nbool FlightTaskOrbit::setVelocity(const float v)\n{\n\tif (fabs(v) < _velocity_max &&\n\t    checkAcceleration(_r, v, _acceleration_max)) {\n\t\t_v = v;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nbool FlightTaskOrbit::checkAcceleration(float r, float v, float a)\n{\n\treturn v * v < a * r;\n}\n\nbool FlightTaskOrbit::activate(vehicle_local_position_setpoint_s last_setpoint)\n{\n\tbool ret = FlightTaskManualAltitudeSmooth::activate(last_setpoint);\n\t_r = _radius_min;\n\t_v =  1.f;\n\t_center = Vector2f(_position);\n\t_center(0) -= _r;\n\n\t_initial_heading = _yaw;\n\n\t\/\/ need a valid position and velocity\n\tret = ret && PX4_ISFINITE(_position(0))\n\t      && PX4_ISFINITE(_position(1))\n\t      && PX4_ISFINITE(_position(2))\n\t      && PX4_ISFINITE(_velocity(0))\n\t      && PX4_ISFINITE(_velocity(1))\n\t      && PX4_ISFINITE(_velocity(2));\n\n\treturn ret;\n}\n\nbool FlightTaskOrbit::update()\n{\n\t\/\/ update altitude\n\tbool ret = FlightTaskManualAltitudeSmooth::update();\n\n\t\/\/ stick input adjusts parameters within a fixed time frame\n\tconst float r = _r - _sticks.getPositionExpo()(0) * _deltatime * (_radius_max \/ 8.f);\n\tconst float v = _v - _sticks.getPositionExpo()(1) * _deltatime * (_velocity_max \/ 4.f);\n\n\tsetRadius(r);\n\tsetVelocity(v);\n\n\tVector2f center_to_position = Vector2f(_position) - _center;\n\tVector2f start_to_circle = (_r - center_to_position.norm()) * center_to_position.unit_or_zero();\n\n\tif (_in_circle_approach) {\n\t\tgenerate_circle_approach_setpoints(start_to_circle);\n\n\t} else {\n\t\tgenerate_circle_setpoints(center_to_position);\n\t\tgenerate_circle_yaw_setpoints(center_to_position);\n\t}\n\n\t\/\/ publish information to UI\n\tsendTelemetry();\n\n\treturn ret;\n}\n\nvoid FlightTaskOrbit::generate_circle_approach_setpoints(Vector2f start_to_circle)\n{\n\n\tif (_circle_approach_line.isEndReached()) {\n\t\t\/\/ calculate target point on circle and plan a line trajectory\n\t\tVector2f closest_circle_point = Vector2f(_position) + start_to_circle;\n\t\tVector3f target = Vector3f(closest_circle_point(0), closest_circle_point(1), _position(2));\n\t\t_circle_approach_line.setLineFromTo(_position, target);\n\t\t_circle_approach_line.setSpeed(_param_mpc_xy_cruise.get());\n\t\t_yaw_setpoint = atan2f(start_to_circle(1), start_to_circle(0));\n\t}\n\n\t\/\/ follow the planned line and switch to orbiting once the circle is reached\n\t_circle_approach_line.generateSetpoints(_position_setpoint, _velocity_setpoint);\n\t_in_circle_approach = !_circle_approach_line.isEndReached();\n}\n\nvoid FlightTaskOrbit::generate_circle_setpoints(Vector2f center_to_position)\n{\n\t\/\/ xy velocity to go around in a circle\n\tVector2f velocity_xy(-center_to_position(1), center_to_position(0));\n\tvelocity_xy = velocity_xy.unit_or_zero();\n\tvelocity_xy *= _v;\n\n\t\/\/ xy velocity adjustment to stay on the radius distance\n\tvelocity_xy += (_r - center_to_position.norm()) * center_to_position.unit_or_zero();\n\n\t_position_setpoint(0) = _position_setpoint(1) = NAN;\n\t_velocity_setpoint.xy() = velocity_xy;\n\t_acceleration_setpoint.xy() = -center_to_position.unit_or_zero() * _v * _v \/ _r;\n}\n\nvoid FlightTaskOrbit::generate_circle_yaw_setpoints(Vector2f center_to_position)\n{\n\tswitch (_yaw_behaviour) {\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_HOLD_INITIAL_HEADING:\n\t\t\/\/ make vehicle keep the same heading as when the orbit was commanded\n\t\t_yaw_setpoint = _initial_heading;\n\t\t_yawspeed_setpoint = NAN;\n\t\tbreak;\n\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_UNCONTROLLED:\n\t\t\/\/ no yaw setpoint\n\t\t_yaw_setpoint = NAN;\n\t\t_yawspeed_setpoint = NAN;\n\t\tbreak;\n\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_HOLD_FRONT_TANGENT_TO_CIRCLE:\n\t\tif (_r > 0) {\n\t\t\t_yaw_setpoint = atan2f(center_to_position(1), center_to_position(0)) + M_PI_F \/ 2.f;\n\n\t\t} else {\n\t\t\t_yaw_setpoint = atan2f(center_to_position(1), center_to_position(0)) - M_PI_F \/ 2.f;\n\t\t}\n\n\t\t_yawspeed_setpoint = _v \/ _r;\n\n\t\tbreak;\n\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_RC_CONTROLLED:\n\t\t\/\/ inherit setpoint from altitude flight task\n\t\tbreak;\n\n\tcase orbit_status_s::ORBIT_YAW_BEHAVIOUR_HOLD_FRONT_TO_CIRCLE_CENTER:\n\tdefault:\n\t\t_yaw_setpoint = atan2f(center_to_position(1), center_to_position(0)) + M_PI_F;\n\t\t\/\/ yawspeed feed-forward because we know the necessary angular rate\n\t\t_yawspeed_setpoint = _v \/ _r;\n\t\tbreak;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>rsz repairNet<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of MorphoDiTa.\n\/\/\n\/\/ Copyright 2013 by Institute of Formal and Applied Linguistics, Faculty of\n\/\/ Mathematics and Physics, Charles University in Prague, Czech Republic.\n\/\/\n\/\/ MorphoDiTa is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Lesser 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\/\/ MorphoDiTa is distributed in the hope that it 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 MorphoDiTa.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#include <memory>\n\n#include \"morpho\/morpho.h\"\n#include \"tagger\/tagger.h\"\n#include \"tagset_converter\/tagset_converter.h\"\n#include \"utils\/input.h\"\n#include \"utils\/parse_int.h\"\n#include \"utils\/parse_options.h\"\n#include \"utils\/process_args.h\"\n\nusing namespace ufal::morphodita;\n\nstatic void generate(FILE* in, FILE* out, const morpho& dictionary, bool use_guesser, const tagset_converter& tagset_converter);\n\nint main(int argc, char* argv[]) {\n  show_version_if_requested(argc, argv);\n\n  options_map options;\n  if (!parse_options({{\"convert_tagset\",option_values::any},\n                      {\"from_tagger\",option_values::none}}, argc, argv, options) ||\n      argc < 3)\n    runtime_errorf(\"Usage: %s [options] dict_file use_guesser [file[:output_file]]...\\n\"\n                   \"Options: --convert_tagset=pdt_to_conll2009|strip_lemma_comment|strip_lemma_id\\n\"\n                   \"         --from_tagger\", argv[0]);\n\n  unique_ptr<morpho> morpho;\n  unique_ptr<tagger> tagger;\n  if (options.count(\"from_tagger\")) {\n    eprintf(\"Loading dictionary from tagger: \");\n    tagger.reset(tagger::load(argv[1]));\n    if (!tagger) runtime_errorf(\"Cannot load tagger from file '%s'!\", argv[1]);\n  } else {\n    eprintf(\"Loading dictionary: \");\n    morpho.reset(morpho::load(argv[1]));\n    if (!morpho) runtime_errorf(\"Cannot load dictionary from file '%s'!\", argv[1]);\n  }\n  eprintf(\"done\\n\");\n  auto& dictionary = options.count(\"from_tagger\") ? *tagger->get_morpho() : *morpho;\n\n  bool use_guesser = parse_int(argv[2], \"use_guesser\");\n\n  unique_ptr<tagset_converter> tagset_converter;\n  if (options.count(\"convert_tagset\")) {\n    tagset_converter.reset(new_tagset_converter(options[\"convert_tagset\"], dictionary));\n    if (!tagset_converter) runtime_errorf(\"Unknown tag set converter '%s'!\", options[\"convert_tagset\"].c_str());\n  } else {\n    tagset_converter.reset(tagset_converter::new_identity_converter());\n    if (!tagset_converter) runtime_errorf(\"Cannot create identity tag set converter!\");\n  }\n\n  process_args(3, argc, argv, generate, dictionary, use_guesser, *tagset_converter);\n\n  return 0;\n}\n\nvoid generate(FILE* in, FILE* out, const morpho& dictionary, bool use_guesser, const tagset_converter& tagset_converter) {\n  string line;\n  vector<tagged_lemma_forms> forms;\n\n  while (getline(in, line)) {\n    if (!line.empty()) {\n      string_piece lemma = line;\n      const char* wildcard = nullptr;\n\n      string::size_type space = line.find('\\t');\n      if (space != string::npos) {\n        lemma.len = space;\n        wildcard = line.c_str() + space + 1;\n      }\n\n      dictionary.generate(lemma, wildcard, use_guesser ? morpho::GUESSER : morpho::NO_GUESSER, forms);\n      tagset_converter.convert_generated(forms);\n\n      bool first = true;\n      for (auto&& lemma : forms)\n        for (auto&& form : lemma.forms) {\n          if (!first) fputc('\\t', out);\n          fprintf(out, \"%s\\t%s\\t%s\", form.form.c_str(), lemma.lemma.c_str(), form.tag.c_str());\n          first = false;\n        }\n    }\n    fputc('\\n', out);\n  }\n}\n<commit_msg>Avoid clang-3.5 compile error by disambiguating generate method.<commit_after>\/\/ This file is part of MorphoDiTa.\n\/\/\n\/\/ Copyright 2013 by Institute of Formal and Applied Linguistics, Faculty of\n\/\/ Mathematics and Physics, Charles University in Prague, Czech Republic.\n\/\/\n\/\/ MorphoDiTa is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Lesser 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\/\/ MorphoDiTa is distributed in the hope that it 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 MorphoDiTa.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#include <memory>\n\n#include \"morpho\/morpho.h\"\n#include \"tagger\/tagger.h\"\n#include \"tagset_converter\/tagset_converter.h\"\n#include \"utils\/input.h\"\n#include \"utils\/parse_int.h\"\n#include \"utils\/parse_options.h\"\n#include \"utils\/process_args.h\"\n\nusing namespace ufal::morphodita;\n\nstatic void generate_vertical(FILE* in, FILE* out, const morpho& dictionary, bool use_guesser, const tagset_converter& tagset_converter);\n\nint main(int argc, char* argv[]) {\n  show_version_if_requested(argc, argv);\n\n  options_map options;\n  if (!parse_options({{\"convert_tagset\",option_values::any},\n                      {\"from_tagger\",option_values::none}}, argc, argv, options) ||\n      argc < 3)\n    runtime_errorf(\"Usage: %s [options] dict_file use_guesser [file[:output_file]]...\\n\"\n                   \"Options: --convert_tagset=pdt_to_conll2009|strip_lemma_comment|strip_lemma_id\\n\"\n                   \"         --from_tagger\", argv[0]);\n\n  unique_ptr<morpho> morpho;\n  unique_ptr<tagger> tagger;\n  if (options.count(\"from_tagger\")) {\n    eprintf(\"Loading dictionary from tagger: \");\n    tagger.reset(tagger::load(argv[1]));\n    if (!tagger) runtime_errorf(\"Cannot load tagger from file '%s'!\", argv[1]);\n  } else {\n    eprintf(\"Loading dictionary: \");\n    morpho.reset(morpho::load(argv[1]));\n    if (!morpho) runtime_errorf(\"Cannot load dictionary from file '%s'!\", argv[1]);\n  }\n  eprintf(\"done\\n\");\n  auto& dictionary = options.count(\"from_tagger\") ? *tagger->get_morpho() : *morpho;\n\n  bool use_guesser = parse_int(argv[2], \"use_guesser\");\n\n  unique_ptr<tagset_converter> tagset_converter;\n  if (options.count(\"convert_tagset\")) {\n    tagset_converter.reset(new_tagset_converter(options[\"convert_tagset\"], dictionary));\n    if (!tagset_converter) runtime_errorf(\"Unknown tag set converter '%s'!\", options[\"convert_tagset\"].c_str());\n  } else {\n    tagset_converter.reset(tagset_converter::new_identity_converter());\n    if (!tagset_converter) runtime_errorf(\"Cannot create identity tag set converter!\");\n  }\n\n  process_args(3, argc, argv, generate_vertical, dictionary, use_guesser, *tagset_converter);\n\n  return 0;\n}\n\nvoid generate_vertical(FILE* in, FILE* out, const morpho& dictionary, bool use_guesser, const tagset_converter& tagset_converter) {\n  string line;\n  vector<tagged_lemma_forms> forms;\n\n  while (getline(in, line)) {\n    if (!line.empty()) {\n      string_piece lemma = line;\n      const char* wildcard = nullptr;\n\n      string::size_type space = line.find('\\t');\n      if (space != string::npos) {\n        lemma.len = space;\n        wildcard = line.c_str() + space + 1;\n      }\n\n      dictionary.generate(lemma, wildcard, use_guesser ? morpho::GUESSER : morpho::NO_GUESSER, forms);\n      tagset_converter.convert_generated(forms);\n\n      bool first = true;\n      for (auto&& lemma : forms)\n        for (auto&& form : lemma.forms) {\n          if (!first) fputc('\\t', out);\n          fprintf(out, \"%s\\t%s\\t%s\", form.form.c_str(), lemma.lemma.c_str(), form.tag.c_str());\n          first = false;\n        }\n    }\n    fputc('\\n', out);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"veraMolnarTrapezium.h\"\n\nvoid veraMolnarTrapezium::setup(){\n\n\tiCenterX = 0;\n\tiCenterY = 1;\n\tiTopLeftOffsetX = 2;\n\tiTopRightOffsetX = 3;\n\tiBottomLeftOffsetX = 4;\n\tiBottomRightOffsetX = 5;\n  \n\/\/ setup pramaters\n\/\/    param.set(\"param\", 5, 0, 100);\n\/\/    parameters.add(param);\n\tspacingPercent.set(\"spacingPercent\", 1.2, 0, 10);\n\tspacingPercentX.set(\"spacingPercentX\", 1.2, 0, 10);\n\tspacingPercentY.set(\"spacingPercentY\", 1.2, 0, 10);\n\tunifiedSpacing.set(\"unifiedSpacing\", true);\n\twhiteBackground.set(\"whiteBackground\", false);\n\tnumWide.set(\"numWide\", 9, 1, 100);\n\tbaseSize.set(\"baseSize\", dimensions.width\/spacingPercent\/(numWide+2), 10, dimensions.width);\n\tcornerNoise.set(\"cornerNoise\", 0., 0., 1.);\n\tcenterNoise.set(\"centerNoise\", 0., 0., 1.);\n\t\n\tparameters.add(baseSize);\n\tparameters.add(spacingPercent);\n\tparameters.add(unifiedSpacing);\n\tparameters.add(spacingPercentX);\n\tparameters.add(spacingPercentY);\n\tparameters.add(numWide);\n\tparameters.add(cornerNoise);\n\tparameters.add(centerNoise);\n\tparameters.add(whiteBackground);\n\n    loadCode(\"veraMolnarTrapezium\/exampleCode.cpp\");\n}\n\nvoid veraMolnarTrapezium::update(){\n\tif (unifiedSpacing){\n\t\tspacingPercentX = spacingPercent;\n\t\tspacingPercentY = spacingPercent;\n\t}\n    while(placements.size() < numWide*numWide){\n\t\t\/\/centerX, centerY, \n\t\t\/\/topLeftOffsetX, topRightOffsetX,\n\t\t\/\/bottomLeftOffsetX, bottomRightOffsetX\n\t\tplacements.push_back({\n\t\t\tofRandom(0, 1), \n\t\t\tofRandom(0, 1),\n\t\t\tofRandom(-1, 1),\n\t\t\tofRandom(-1, 1),\n\t\t\tofRandom(-1, 1),\n\t\t\tofRandom(-1, 1)});\n\t}\n}\n\nvoid veraMolnarTrapezium::draw(){\n\tif (whiteBackground){\n\t\tofBackground(255);\n\t\tofSetColor(0);\n\t} else {\n\t\tofBackground(0);\n\t\tofSetColor(255);\n\t}\n\tfor(int row = 0; row < numWide; row++){\n\t\tfor(int column = 0; column < numWide; column++){\n\t\t\tdrawTrapezium(row, column);\n\t\t}\n\t}\n}\n\nvoid veraMolnarTrapezium::drawTrapezium(int row, int column){\n\tfloat spacingX, spacingY;\n\tif (unifiedSpacing){\n\t\tspacingX = spacingY = baseSize * spacingPercent;\n\t} else {\n\t\tspacingX = baseSize * spacingPercentX;\n\t\tspacingY = baseSize * spacingPercentY;\n\t}\n\tint index = row * numWide + column;\n\tfloat gridLeft = (dimensions.width - numWide * spacingX) \/ 2;\n\tfloat gridTop = (dimensions.height - numWide * spacingY) \/ 2;\n\n\tfloat leftmostCenter = gridLeft + spacingX \/ 2;\n\tfloat rightmostCenter = leftmostCenter + (numWide - 1) * spacingX;\n\tfloat topmostCenter = gridTop + spacingY \/ 2;\n\tfloat bottommostCenter = topmostCenter + (numWide - 1) * spacingY;\n\n\tfloat startCenterX = leftmostCenter + column * spacingX;\n\tfloat startCenterY = topmostCenter + row * spacingY;\n\tfloat centerSpanX = (rightmostCenter - leftmostCenter);\n\tfloat centerSpanY = (bottommostCenter - topmostCenter);\n\tfloat targetCenterX = centerSpanX * placements[index][iCenterX] + leftmostCenter;\n\tfloat targetCenterY = centerSpanY * placements[index][iCenterY] + leftmostCenter;\n\n\tfloat centerX = \n\t\tstartCenterX * (1. - centerNoise) + \n\t\ttargetCenterX * centerNoise;\n\tfloat centerY = \n\t\tstartCenterY * (1. - centerNoise) +\n\t\ttargetCenterY * centerNoise;\n\n\tfloat top = centerY - baseSize \/ 2;\n\tfloat bottom = centerY + baseSize \/ 2;\n\tfloat left = centerX - baseSize \/ 2;\n\tfloat right = centerX + baseSize \/ 2;\n\n\tfloat cornerMagnitude = cornerNoise * baseSize;\n\tofVec2f topLeft = ofVec2f(top, left);\n\ttopLeft.x += placements[index][iTopLeftOffsetX] * cornerMagnitude;\n\tofVec2f topRight = ofVec2f(top, right);\n\ttopRight.x += placements[index][iTopRightOffsetX] * cornerMagnitude;\n\tofVec2f bottomRight = ofVec2f(bottom, right);\n\tbottomRight.x += placements[index][iBottomRightOffsetX] * cornerMagnitude;\n\tofVec2f bottomLeft = ofVec2f(bottom, left);\n\tbottomLeft.x += placements[index][iBottomLeftOffsetX] * cornerMagnitude;\n\n\tofDrawLine(topLeft.x, topLeft.y, topRight.x, topRight.y);\n\tofDrawLine(topRight.x, topRight.y, bottomRight.x, bottomRight.y);\n\tofDrawLine(bottomRight.x, bottomRight.y, bottomLeft.x, bottomLeft.y);\n\tofDrawLine(bottomLeft.x, bottomLeft.y, topLeft.x, topLeft.y);\n}\n<commit_msg>fixing some spacing bug.<commit_after>\n#include \"veraMolnarTrapezium.h\"\n\nvoid veraMolnarTrapezium::setup(){\n\n\tiCenterX = 0;\n\tiCenterY = 1;\n\tiTopLeftOffsetX = 2;\n\tiTopRightOffsetX = 3;\n\tiBottomLeftOffsetX = 4;\n\tiBottomRightOffsetX = 5;\n  \n\/\/ setup pramaters\n\/\/    param.set(\"param\", 5, 0, 100);\n\/\/    parameters.add(param);\n\tspacingPercent.set(\"spacingPercent\", 1.2, 0, 10);\n\tspacingPercentX.set(\"spacingPercentX\", 1.2, 0, 10);\n\tspacingPercentY.set(\"spacingPercentY\", 1.2, 0, 10);\n\tunifiedSpacing.set(\"unifiedSpacing\", true);\n\twhiteBackground.set(\"whiteBackground\", false);\n\tnumWide.set(\"numWide\", 9, 1, 100);\n\tbaseSize.set(\"baseSize\", dimensions.width\/spacingPercent\/(numWide+2), 10, dimensions.width);\n\tcornerNoise.set(\"cornerNoise\", 0., 0., 1.);\n\tcenterNoise.set(\"centerNoise\", 0., 0., 1.);\n\t\n\tparameters.add(baseSize);\n\tparameters.add(spacingPercent);\n\tparameters.add(unifiedSpacing);\n\tparameters.add(spacingPercentX);\n\tparameters.add(spacingPercentY);\n\tparameters.add(numWide);\n\tparameters.add(cornerNoise);\n\tparameters.add(centerNoise);\n\tparameters.add(whiteBackground);\n\n    loadCode(\"veraMolnarTrapezium\/exampleCode.cpp\");\n}\n\nvoid veraMolnarTrapezium::update(){\n\tif (unifiedSpacing){\n\t\tspacingPercentX = spacingPercent;\n\t\tspacingPercentY = spacingPercent;\n\t}\n    while(placements.size() < numWide*numWide){\n\t\t\/\/centerX, centerY, \n\t\t\/\/topLeftOffsetX, topRightOffsetX,\n\t\t\/\/bottomLeftOffsetX, bottomRightOffsetX\n\t\tplacements.push_back({\n\t\t\tofRandom(0, 1), \n\t\t\tofRandom(0, 1),\n\t\t\tofRandom(-1, 1),\n\t\t\tofRandom(-1, 1),\n\t\t\tofRandom(-1, 1),\n\t\t\tofRandom(-1, 1)});\n\t}\n}\n\nvoid veraMolnarTrapezium::draw(){\n\tif (whiteBackground){\n\t\tofBackground(255);\n\t\tofSetColor(0);\n\t} else {\n\t\tofBackground(0);\n\t\tofSetColor(255);\n\t}\n\tfor(int row = 0; row < numWide; row++){\n\t\tfor(int column = 0; column < numWide; column++){\n\t\t\tdrawTrapezium(row, column);\n\t\t}\n\t}\n}\n\nvoid veraMolnarTrapezium::drawTrapezium(int row, int column){\n\tfloat spacingX, spacingY;\n\tif (unifiedSpacing){\n\t\tspacingX = spacingY = baseSize * spacingPercent;\n\t} else {\n\t\tspacingX = baseSize * spacingPercentX;\n\t\tspacingY = baseSize * spacingPercentY;\n\t}\n\tint index = row * numWide + column;\n\tfloat gridLeft = (dimensions.width - numWide * spacingX) \/ 2;\n\tfloat gridTop = (dimensions.height - numWide * spacingY) \/ 2;\n\n\tfloat leftmostCenter = gridLeft + spacingX \/ 2;\n\tfloat rightmostCenter = leftmostCenter + (numWide - 1) * spacingX;\n\tfloat topmostCenter = gridTop + spacingY \/ 2;\n\tfloat bottommostCenter = topmostCenter + (numWide - 1) * spacingY;\n\n\tfloat startCenterX = leftmostCenter + column * spacingX;\n\tfloat startCenterY = topmostCenter + row * spacingY;\n\tfloat centerSpanX = (rightmostCenter - leftmostCenter);\n\tfloat centerSpanY = (bottommostCenter - topmostCenter);\n\tfloat targetCenterX = centerSpanX * placements[index][iCenterX] + leftmostCenter;\n\tfloat targetCenterY = centerSpanY * placements[index][iCenterY] + topmostCenter;\n\n\tfloat centerX = \n\t\tstartCenterX * (1. - centerNoise) + \n\t\ttargetCenterX * centerNoise;\n\tfloat centerY = \n\t\tstartCenterY * (1. - centerNoise) +\n\t\ttargetCenterY * centerNoise;\n\n\tfloat top = centerY - baseSize \/ 2;\n\tfloat bottom = centerY + baseSize \/ 2;\n\tfloat left = centerX - baseSize \/ 2;\n\tfloat right = centerX + baseSize \/ 2;\n\n\tfloat cornerMagnitude = cornerNoise * baseSize;\n\tofVec2f topLeft = ofVec2f(top, left);\n\ttopLeft.x += placements[index][iTopLeftOffsetX] * cornerMagnitude;\n\tofVec2f topRight = ofVec2f(top, right);\n\ttopRight.x += placements[index][iTopRightOffsetX] * cornerMagnitude;\n\tofVec2f bottomRight = ofVec2f(bottom, right);\n\tbottomRight.x += placements[index][iBottomRightOffsetX] * cornerMagnitude;\n\tofVec2f bottomLeft = ofVec2f(bottom, left);\n\tbottomLeft.x += placements[index][iBottomLeftOffsetX] * cornerMagnitude;\n\n\tofDrawLine(topLeft.x, topLeft.y, topRight.x, topRight.y);\n\tofDrawLine(topRight.x, topRight.y, bottomRight.x, bottomRight.y);\n\tofDrawLine(bottomRight.x, bottomRight.y, bottomLeft.x, bottomLeft.y);\n\tofDrawLine(bottomLeft.x, bottomLeft.y, topLeft.x, topLeft.y);\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 <stdint.h>\n\n#include <algorithm>\n#include <list>\n#include <map>\n#include <set>\n#include <string>\n#include <vector>\n\n#include <process\/collect.hpp>\n#include <process\/defer.hpp>\n#include <process\/future.hpp>\n\n#include <stout\/error.hpp>\n#include <stout\/foreach.hpp>\n#include <stout\/hashmap.hpp>\n#include <stout\/option.hpp>\n#include <stout\/os.hpp>\n#include <stout\/try.hpp>\n\n#include \"linux\/cgroups.hpp\"\n\n#include \"slave\/flags.hpp\"\n\n#include \"slave\/containerizer\/containerizer.hpp\"\n\n#include \"slave\/containerizer\/mesos\/isolator.hpp\"\n\n#include \"slave\/containerizer\/mesos\/isolators\/gpu\/nvidia.hpp\"\n#include \"slave\/containerizer\/mesos\/isolators\/gpu\/nvml.hpp\"\n\nusing cgroups::devices::Entry;\n\nusing mesos::slave::ContainerConfig;\nusing mesos::slave::ContainerLaunchInfo;\nusing mesos::slave::ContainerLimitation;\nusing mesos::slave::ContainerState;\nusing mesos::slave::Isolator;\n\nusing process::defer;\nusing process::Failure;\nusing process::Future;\nusing process::PID;\n\nusing std::list;\nusing std::map;\nusing std::set;\nusing std::string;\nusing std::vector;\n\nnamespace mesos {\nnamespace internal {\nnamespace slave {\n\n\/\/ TODO(klueska): Expand this when we support other GPU types.\nstatic constexpr unsigned int NVIDIA_MAJOR_DEVICE = 195;\n\n\nNvidiaGpuIsolatorProcess::NvidiaGpuIsolatorProcess(\n    const Flags& _flags,\n    const string& _hierarchy,\n    const NvidiaGpuAllocator& _allocator,\n    const cgroups::devices::Entry& uvmDeviceEntry,\n    const cgroups::devices::Entry& ctlDeviceEntry)\n  : flags(_flags),\n    hierarchy(_hierarchy),\n    allocator(_allocator),\n    NVIDIA_CTL_DEVICE_ENTRY(ctlDeviceEntry),\n    NVIDIA_UVM_DEVICE_ENTRY(uvmDeviceEntry) {}\n\n\nTry<Isolator*> NvidiaGpuIsolatorProcess::create(const Flags& flags)\n{\n  \/\/ Make sure the 'cgroups\/devices' isolator is present and\n  \/\/ precedes the GPU isolator.\n  vector<string> tokens = strings::tokenize(flags.isolation, \",\");\n\n  auto gpuIsolator =\n    std::find(tokens.begin(), tokens.end(), \"gpu\/nvidia\");\n  auto devicesIsolator =\n    std::find(tokens.begin(), tokens.end(), \"cgroups\/devices\");\n\n  CHECK(gpuIsolator != tokens.end());\n\n  if (devicesIsolator == tokens.end()) {\n    return Error(\"The 'cgroups\/devices' isolator must be enabled in\"\n                 \" order to use the 'gpu\/nvidia' isolator\");\n  }\n\n  if (devicesIsolator > gpuIsolator) {\n    return Error(\"'cgroups\/devices' must precede 'gpu\/nvidia'\"\n                 \" in the --isolation flag\");\n  }\n\n  \/\/ Create the allocator.\n  \/\/\n  \/\/ TODO(klueska): We need to share the allocator\n  \/\/ with the docker containerizer.\n  Try<Resources> resources =\n    NvidiaGpuAllocator::resources(flags);\n\n  if (resources.isError()) {\n    return Error(\"Failed to NvidiaGpuAllocator::resources: \" +\n                 resources.error());\n  }\n\n  Try<NvidiaGpuAllocator> allocator =\n    NvidiaGpuAllocator::create(flags, resources.get());\n\n  if (allocator.isError()) {\n    return Error(\"Failed to NvidiaGpuAllocator::create: \" +\n                 allocator.error());\n  }\n\n  \/\/ Retrieve the cgroups devices hierarchy.\n  Result<string> hierarchy = cgroups::hierarchy(\"devices\");\n\n  if (hierarchy.isError()) {\n    return Error(\n        \"Error retrieving the 'devices' subsystem hierarchy: \" +\n        hierarchy.error());\n  }\n\n  \/\/ Create the device entries for\n  \/\/ `\/dev\/nvidiactl` and `\/dev\/nvidia-uvm`.\n  Try<dev_t> device = os::stat::rdev(\"\/dev\/nvidiactl\");\n  if (device.isError()) {\n    return Error(\"Failed to obtain device ID for '\/dev\/nvidiactl': \" +\n                 device.error());\n  }\n\n  cgroups::devices::Entry ctlDeviceEntry;\n  ctlDeviceEntry.selector.type = Entry::Selector::Type::CHARACTER;\n  ctlDeviceEntry.selector.major = major(device.get());\n  ctlDeviceEntry.selector.minor = minor(device.get());\n  ctlDeviceEntry.access.read = true;\n  ctlDeviceEntry.access.write = true;\n  ctlDeviceEntry.access.mknod = true;\n\n  device = os::stat::rdev(\"\/dev\/nvidia-uvm\");\n  if (device.isError()) {\n    return Error(\"Failed to obtain device ID for '\/dev\/nvidia-uvm': \" +\n                 device.error());\n  }\n\n  cgroups::devices::Entry uvmDeviceEntry;\n  uvmDeviceEntry.selector.type = Entry::Selector::Type::CHARACTER;\n  uvmDeviceEntry.selector.major = major(device.get());\n  uvmDeviceEntry.selector.minor = minor(device.get());\n  uvmDeviceEntry.access.read = true;\n  uvmDeviceEntry.access.write = true;\n  uvmDeviceEntry.access.mknod = true;\n\n  process::Owned<MesosIsolatorProcess> process(\n      new NvidiaGpuIsolatorProcess(\n          flags,\n          hierarchy.get(),\n          allocator.get(),\n          ctlDeviceEntry,\n          uvmDeviceEntry));\n\n  return new MesosIsolator(process);\n}\n\n\nFuture<Nothing> NvidiaGpuIsolatorProcess::recover(\n    const list<ContainerState>& states,\n    const hashset<ContainerID>& orphans)\n{\n  list<Future<Nothing>> futures;\n\n  foreach (const ContainerState& state, states) {\n    const ContainerID& containerId = state.container_id();\n    const string cgroup = path::join(flags.cgroups_root, containerId.value());\n\n    Try<bool> exists = cgroups::exists(hierarchy, cgroup);\n    if (exists.isError()) {\n      foreachvalue (Info* info, infos) {\n        delete info;\n      }\n      infos.clear();\n      return Failure(\"Failed to check cgroup for container '\" +\n                     stringify(containerId) + \"'\");\n    }\n\n    if (!exists.get()) {\n      VLOG(1) << \"Couldn't find cgroup for container \" << containerId;\n      \/\/ This may occur if the executor has exited and the isolator\n      \/\/ has destroyed the cgroup but the slave dies before noticing\n      \/\/ this. This will be detected when the containerizer tries to\n      \/\/ monitor the executor's pid.\n      continue;\n    }\n\n    infos[containerId] = new Info(containerId, cgroup);\n\n    \/\/ Determine which GPUs are allocated to this container.\n    Try<vector<cgroups::devices::Entry>> entries =\n      cgroups::devices::list(hierarchy, cgroup);\n\n    if (entries.isError()) {\n      return Failure(\"Failed to obtain devices list for cgroup\"\n                     \" '\" + cgroup + \"': \" + entries.error());\n    }\n\n    const set<Gpu>& available = allocator.total();\n\n    set<Gpu> containerGpus;\n    foreach (const cgroups::devices::Entry& entry, entries.get()) {\n      foreach (const Gpu& gpu, available) {\n        if (entry.selector.major == gpu.major &&\n            entry.selector.minor == gpu.minor) {\n          containerGpus.insert(gpu);\n          break;\n        }\n      }\n    }\n\n    futures.push_back(allocator.allocate(containerGpus)\n      .then(defer(self(), [=]() -> Future<Nothing> {\n        infos[containerId]->allocated = containerGpus;\n        return Nothing();\n      })));\n  }\n\n  return collect(futures).then([]() { return Nothing(); });\n}\n\n\nFuture<Option<ContainerLaunchInfo>> NvidiaGpuIsolatorProcess::prepare(\n    const ContainerID& containerId,\n    const mesos::slave::ContainerConfig& containerConfig)\n{\n  if (infos.contains(containerId)) {\n    return Failure(\"Container has already been prepared\");\n  }\n\n  infos[containerId] = new Info(\n      containerId, path::join(flags.cgroups_root, containerId.value()));\n\n  \/\/ Grant access to \/dev\/nvidiactl and \/dev\/nvida-uvm.\n  \/\/\n  \/\/ This allows standard NVIDIA tools like `nvidia-smi` to be\n  \/\/ used within the container even if no GPUs are allocated.\n  \/\/ Without these devices, these tools fail abnormally.\n  map<string, const cgroups::devices::Entry> entries = {\n    { \"\/dev\/nvidiactl\", NVIDIA_CTL_DEVICE_ENTRY },\n    { \"\/dev\/nvidia-uvm\", NVIDIA_UVM_DEVICE_ENTRY },\n  };\n\n  foreachkey (const string& device, entries) {\n    Try<Nothing> allow = cgroups::devices::allow(\n        hierarchy, infos[containerId]->cgroup, entries[device]);\n\n    if (allow.isError()) {\n      return Failure(\"Failed to grant cgroups access to\"\n                     \" '\" + device + \"': \" + allow.error());\n    }\n  }\n\n  return update(containerId, containerConfig.executor_info().resources())\n    .then([]() -> Future<Option<ContainerLaunchInfo>> {\n      return None();\n    });\n}\n\n\nFuture<Nothing> NvidiaGpuIsolatorProcess::update(\n    const ContainerID& containerId,\n    const Resources& resources)\n{\n  if (!infos.contains(containerId)) {\n    return Failure(\"Unknown container\");\n  }\n\n  Info* info = CHECK_NOTNULL(infos[containerId]);\n\n  Option<double> gpus = resources.gpus();\n\n  \/\/ Make sure that the `gpus` resource is not fractional.\n  \/\/ We rely on scalar resources only having 3 digits of precision.\n  if (static_cast<long long>(gpus.getOrElse(0.0) * 1000.0) % 1000 != 0) {\n    return Failure(\"The 'gpus' resource must be an unsigned integer\");\n  }\n\n  size_t requested = static_cast<size_t>(resources.gpus().getOrElse(0.0));\n\n  \/\/ Update the GPU allocation to reflect the new total.\n  if (requested > info->allocated.size()) {\n    size_t additional = requested - info->allocated.size();\n\n    return allocator.allocate(additional)\n      .then(defer(PID<NvidiaGpuIsolatorProcess>(this),\n                  &NvidiaGpuIsolatorProcess::_update,\n                  containerId,\n                  lambda::_1));\n  } else if (requested < info->allocated.size()) {\n    size_t fewer = info->allocated.size() - requested;\n\n    set<Gpu> deallocated;\n\n    for (size_t i = 0; i < fewer; i++) {\n      const auto gpu = info->allocated.begin();\n\n      cgroups::devices::Entry entry;\n      entry.selector.type = Entry::Selector::Type::CHARACTER;\n      entry.selector.major = gpu->major;\n      entry.selector.minor = gpu->minor;\n      entry.access.read = true;\n      entry.access.write = true;\n      entry.access.mknod = true;\n\n      Try<Nothing> deny = cgroups::devices::deny(\n          hierarchy, info->cgroup, entry);\n\n      if (deny.isError()) {\n        return Failure(\"Failed to deny cgroups access to GPU device\"\n                       \" '\" + stringify(entry) + \"': \" + deny.error());\n      }\n\n      deallocated.insert(*gpu);\n      info->allocated.erase(gpu);\n    }\n\n    return allocator.deallocate(deallocated);\n  }\n\n  return Nothing();\n}\n\n\nFuture<Nothing> NvidiaGpuIsolatorProcess::_update(\n    const ContainerID& containerId,\n    const set<Gpu>& allocation)\n{\n  if (!infos.contains(containerId)) {\n    return Failure(\"Failed to complete GPU allocation: unknown container\");\n  }\n\n  Info* info = CHECK_NOTNULL(infos.at(containerId));\n\n  foreach (const Gpu& gpu, allocation) {\n    cgroups::devices::Entry entry;\n    entry.selector.type = Entry::Selector::Type::CHARACTER;\n    entry.selector.major = gpu.major;\n    entry.selector.minor = gpu.minor;\n    entry.access.read = true;\n    entry.access.write = true;\n    entry.access.mknod = true;\n\n    Try<Nothing> allow = cgroups::devices::allow(\n        hierarchy, info->cgroup, entry);\n\n    if (allow.isError()) {\n      return Failure(\"Failed to grant cgroups access to GPU device\"\n                     \" '\" + stringify(entry) + \"': \" + allow.error());\n    }\n  }\n\n  info->allocated = allocation;\n\n  return Nothing();\n}\n\n\nFuture<ResourceStatistics> NvidiaGpuIsolatorProcess::usage(\n    const ContainerID& containerId)\n{\n  if (!infos.contains(containerId)) {\n    return Failure(\"Unknown container\");\n  }\n\n  \/\/ TODO(rtodd): Obtain usage information from NVML.\n\n  ResourceStatistics result;\n  return result;\n}\n\n\nFuture<Nothing> NvidiaGpuIsolatorProcess::cleanup(\n    const ContainerID& containerId)\n{\n  \/\/ Multiple calls may occur during test clean up.\n  if (!infos.contains(containerId)) {\n    VLOG(1) << \"Ignoring cleanup request for unknown container \" << containerId;\n\n    return Nothing();\n  }\n\n  Info* info = CHECK_NOTNULL(infos.at(containerId));\n\n  \/\/ Make any remaining GPUs available.\n  return allocator.deallocate(info->allocated)\n    .then(defer(self(), [=]() -> Future<Nothing> {\n      CHECK(infos.contains(containerId));\n      delete infos.at(containerId);\n      infos.erase(containerId);\n\n      return Nothing();\n    }));\n}\n\n} \/\/ namespace slave {\n} \/\/ namespace internal {\n} \/\/ namespace mesos {\n<commit_msg>Removed an unused constant in the GPU isolator.<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 <stdint.h>\n\n#include <algorithm>\n#include <list>\n#include <map>\n#include <set>\n#include <string>\n#include <vector>\n\n#include <process\/collect.hpp>\n#include <process\/defer.hpp>\n#include <process\/future.hpp>\n\n#include <stout\/error.hpp>\n#include <stout\/foreach.hpp>\n#include <stout\/hashmap.hpp>\n#include <stout\/option.hpp>\n#include <stout\/os.hpp>\n#include <stout\/try.hpp>\n\n#include \"linux\/cgroups.hpp\"\n\n#include \"slave\/flags.hpp\"\n\n#include \"slave\/containerizer\/containerizer.hpp\"\n\n#include \"slave\/containerizer\/mesos\/isolator.hpp\"\n\n#include \"slave\/containerizer\/mesos\/isolators\/gpu\/nvidia.hpp\"\n#include \"slave\/containerizer\/mesos\/isolators\/gpu\/nvml.hpp\"\n\nusing cgroups::devices::Entry;\n\nusing mesos::slave::ContainerConfig;\nusing mesos::slave::ContainerLaunchInfo;\nusing mesos::slave::ContainerLimitation;\nusing mesos::slave::ContainerState;\nusing mesos::slave::Isolator;\n\nusing process::defer;\nusing process::Failure;\nusing process::Future;\nusing process::PID;\n\nusing std::list;\nusing std::map;\nusing std::set;\nusing std::string;\nusing std::vector;\n\nnamespace mesos {\nnamespace internal {\nnamespace slave {\n\nNvidiaGpuIsolatorProcess::NvidiaGpuIsolatorProcess(\n    const Flags& _flags,\n    const string& _hierarchy,\n    const NvidiaGpuAllocator& _allocator,\n    const cgroups::devices::Entry& uvmDeviceEntry,\n    const cgroups::devices::Entry& ctlDeviceEntry)\n  : flags(_flags),\n    hierarchy(_hierarchy),\n    allocator(_allocator),\n    NVIDIA_CTL_DEVICE_ENTRY(ctlDeviceEntry),\n    NVIDIA_UVM_DEVICE_ENTRY(uvmDeviceEntry) {}\n\n\nTry<Isolator*> NvidiaGpuIsolatorProcess::create(const Flags& flags)\n{\n  \/\/ Make sure the 'cgroups\/devices' isolator is present and\n  \/\/ precedes the GPU isolator.\n  vector<string> tokens = strings::tokenize(flags.isolation, \",\");\n\n  auto gpuIsolator =\n    std::find(tokens.begin(), tokens.end(), \"gpu\/nvidia\");\n  auto devicesIsolator =\n    std::find(tokens.begin(), tokens.end(), \"cgroups\/devices\");\n\n  CHECK(gpuIsolator != tokens.end());\n\n  if (devicesIsolator == tokens.end()) {\n    return Error(\"The 'cgroups\/devices' isolator must be enabled in\"\n                 \" order to use the 'gpu\/nvidia' isolator\");\n  }\n\n  if (devicesIsolator > gpuIsolator) {\n    return Error(\"'cgroups\/devices' must precede 'gpu\/nvidia'\"\n                 \" in the --isolation flag\");\n  }\n\n  \/\/ Create the allocator.\n  \/\/\n  \/\/ TODO(klueska): We need to share the allocator\n  \/\/ with the docker containerizer.\n  Try<Resources> resources =\n    NvidiaGpuAllocator::resources(flags);\n\n  if (resources.isError()) {\n    return Error(\"Failed to NvidiaGpuAllocator::resources: \" +\n                 resources.error());\n  }\n\n  Try<NvidiaGpuAllocator> allocator =\n    NvidiaGpuAllocator::create(flags, resources.get());\n\n  if (allocator.isError()) {\n    return Error(\"Failed to NvidiaGpuAllocator::create: \" +\n                 allocator.error());\n  }\n\n  \/\/ Retrieve the cgroups devices hierarchy.\n  Result<string> hierarchy = cgroups::hierarchy(\"devices\");\n\n  if (hierarchy.isError()) {\n    return Error(\n        \"Error retrieving the 'devices' subsystem hierarchy: \" +\n        hierarchy.error());\n  }\n\n  \/\/ Create the device entries for\n  \/\/ `\/dev\/nvidiactl` and `\/dev\/nvidia-uvm`.\n  Try<dev_t> device = os::stat::rdev(\"\/dev\/nvidiactl\");\n  if (device.isError()) {\n    return Error(\"Failed to obtain device ID for '\/dev\/nvidiactl': \" +\n                 device.error());\n  }\n\n  cgroups::devices::Entry ctlDeviceEntry;\n  ctlDeviceEntry.selector.type = Entry::Selector::Type::CHARACTER;\n  ctlDeviceEntry.selector.major = major(device.get());\n  ctlDeviceEntry.selector.minor = minor(device.get());\n  ctlDeviceEntry.access.read = true;\n  ctlDeviceEntry.access.write = true;\n  ctlDeviceEntry.access.mknod = true;\n\n  device = os::stat::rdev(\"\/dev\/nvidia-uvm\");\n  if (device.isError()) {\n    return Error(\"Failed to obtain device ID for '\/dev\/nvidia-uvm': \" +\n                 device.error());\n  }\n\n  cgroups::devices::Entry uvmDeviceEntry;\n  uvmDeviceEntry.selector.type = Entry::Selector::Type::CHARACTER;\n  uvmDeviceEntry.selector.major = major(device.get());\n  uvmDeviceEntry.selector.minor = minor(device.get());\n  uvmDeviceEntry.access.read = true;\n  uvmDeviceEntry.access.write = true;\n  uvmDeviceEntry.access.mknod = true;\n\n  process::Owned<MesosIsolatorProcess> process(\n      new NvidiaGpuIsolatorProcess(\n          flags,\n          hierarchy.get(),\n          allocator.get(),\n          ctlDeviceEntry,\n          uvmDeviceEntry));\n\n  return new MesosIsolator(process);\n}\n\n\nFuture<Nothing> NvidiaGpuIsolatorProcess::recover(\n    const list<ContainerState>& states,\n    const hashset<ContainerID>& orphans)\n{\n  list<Future<Nothing>> futures;\n\n  foreach (const ContainerState& state, states) {\n    const ContainerID& containerId = state.container_id();\n    const string cgroup = path::join(flags.cgroups_root, containerId.value());\n\n    Try<bool> exists = cgroups::exists(hierarchy, cgroup);\n    if (exists.isError()) {\n      foreachvalue (Info* info, infos) {\n        delete info;\n      }\n      infos.clear();\n      return Failure(\"Failed to check cgroup for container '\" +\n                     stringify(containerId) + \"'\");\n    }\n\n    if (!exists.get()) {\n      VLOG(1) << \"Couldn't find cgroup for container \" << containerId;\n      \/\/ This may occur if the executor has exited and the isolator\n      \/\/ has destroyed the cgroup but the slave dies before noticing\n      \/\/ this. This will be detected when the containerizer tries to\n      \/\/ monitor the executor's pid.\n      continue;\n    }\n\n    infos[containerId] = new Info(containerId, cgroup);\n\n    \/\/ Determine which GPUs are allocated to this container.\n    Try<vector<cgroups::devices::Entry>> entries =\n      cgroups::devices::list(hierarchy, cgroup);\n\n    if (entries.isError()) {\n      return Failure(\"Failed to obtain devices list for cgroup\"\n                     \" '\" + cgroup + \"': \" + entries.error());\n    }\n\n    const set<Gpu>& available = allocator.total();\n\n    set<Gpu> containerGpus;\n    foreach (const cgroups::devices::Entry& entry, entries.get()) {\n      foreach (const Gpu& gpu, available) {\n        if (entry.selector.major == gpu.major &&\n            entry.selector.minor == gpu.minor) {\n          containerGpus.insert(gpu);\n          break;\n        }\n      }\n    }\n\n    futures.push_back(allocator.allocate(containerGpus)\n      .then(defer(self(), [=]() -> Future<Nothing> {\n        infos[containerId]->allocated = containerGpus;\n        return Nothing();\n      })));\n  }\n\n  return collect(futures).then([]() { return Nothing(); });\n}\n\n\nFuture<Option<ContainerLaunchInfo>> NvidiaGpuIsolatorProcess::prepare(\n    const ContainerID& containerId,\n    const mesos::slave::ContainerConfig& containerConfig)\n{\n  if (infos.contains(containerId)) {\n    return Failure(\"Container has already been prepared\");\n  }\n\n  infos[containerId] = new Info(\n      containerId, path::join(flags.cgroups_root, containerId.value()));\n\n  \/\/ Grant access to \/dev\/nvidiactl and \/dev\/nvida-uvm.\n  \/\/\n  \/\/ This allows standard NVIDIA tools like `nvidia-smi` to be\n  \/\/ used within the container even if no GPUs are allocated.\n  \/\/ Without these devices, these tools fail abnormally.\n  map<string, const cgroups::devices::Entry> entries = {\n    { \"\/dev\/nvidiactl\", NVIDIA_CTL_DEVICE_ENTRY },\n    { \"\/dev\/nvidia-uvm\", NVIDIA_UVM_DEVICE_ENTRY },\n  };\n\n  foreachkey (const string& device, entries) {\n    Try<Nothing> allow = cgroups::devices::allow(\n        hierarchy, infos[containerId]->cgroup, entries[device]);\n\n    if (allow.isError()) {\n      return Failure(\"Failed to grant cgroups access to\"\n                     \" '\" + device + \"': \" + allow.error());\n    }\n  }\n\n  return update(containerId, containerConfig.executor_info().resources())\n    .then([]() -> Future<Option<ContainerLaunchInfo>> {\n      return None();\n    });\n}\n\n\nFuture<Nothing> NvidiaGpuIsolatorProcess::update(\n    const ContainerID& containerId,\n    const Resources& resources)\n{\n  if (!infos.contains(containerId)) {\n    return Failure(\"Unknown container\");\n  }\n\n  Info* info = CHECK_NOTNULL(infos[containerId]);\n\n  Option<double> gpus = resources.gpus();\n\n  \/\/ Make sure that the `gpus` resource is not fractional.\n  \/\/ We rely on scalar resources only having 3 digits of precision.\n  if (static_cast<long long>(gpus.getOrElse(0.0) * 1000.0) % 1000 != 0) {\n    return Failure(\"The 'gpus' resource must be an unsigned integer\");\n  }\n\n  size_t requested = static_cast<size_t>(resources.gpus().getOrElse(0.0));\n\n  \/\/ Update the GPU allocation to reflect the new total.\n  if (requested > info->allocated.size()) {\n    size_t additional = requested - info->allocated.size();\n\n    return allocator.allocate(additional)\n      .then(defer(PID<NvidiaGpuIsolatorProcess>(this),\n                  &NvidiaGpuIsolatorProcess::_update,\n                  containerId,\n                  lambda::_1));\n  } else if (requested < info->allocated.size()) {\n    size_t fewer = info->allocated.size() - requested;\n\n    set<Gpu> deallocated;\n\n    for (size_t i = 0; i < fewer; i++) {\n      const auto gpu = info->allocated.begin();\n\n      cgroups::devices::Entry entry;\n      entry.selector.type = Entry::Selector::Type::CHARACTER;\n      entry.selector.major = gpu->major;\n      entry.selector.minor = gpu->minor;\n      entry.access.read = true;\n      entry.access.write = true;\n      entry.access.mknod = true;\n\n      Try<Nothing> deny = cgroups::devices::deny(\n          hierarchy, info->cgroup, entry);\n\n      if (deny.isError()) {\n        return Failure(\"Failed to deny cgroups access to GPU device\"\n                       \" '\" + stringify(entry) + \"': \" + deny.error());\n      }\n\n      deallocated.insert(*gpu);\n      info->allocated.erase(gpu);\n    }\n\n    return allocator.deallocate(deallocated);\n  }\n\n  return Nothing();\n}\n\n\nFuture<Nothing> NvidiaGpuIsolatorProcess::_update(\n    const ContainerID& containerId,\n    const set<Gpu>& allocation)\n{\n  if (!infos.contains(containerId)) {\n    return Failure(\"Failed to complete GPU allocation: unknown container\");\n  }\n\n  Info* info = CHECK_NOTNULL(infos.at(containerId));\n\n  foreach (const Gpu& gpu, allocation) {\n    cgroups::devices::Entry entry;\n    entry.selector.type = Entry::Selector::Type::CHARACTER;\n    entry.selector.major = gpu.major;\n    entry.selector.minor = gpu.minor;\n    entry.access.read = true;\n    entry.access.write = true;\n    entry.access.mknod = true;\n\n    Try<Nothing> allow = cgroups::devices::allow(\n        hierarchy, info->cgroup, entry);\n\n    if (allow.isError()) {\n      return Failure(\"Failed to grant cgroups access to GPU device\"\n                     \" '\" + stringify(entry) + \"': \" + allow.error());\n    }\n  }\n\n  info->allocated = allocation;\n\n  return Nothing();\n}\n\n\nFuture<ResourceStatistics> NvidiaGpuIsolatorProcess::usage(\n    const ContainerID& containerId)\n{\n  if (!infos.contains(containerId)) {\n    return Failure(\"Unknown container\");\n  }\n\n  \/\/ TODO(rtodd): Obtain usage information from NVML.\n\n  ResourceStatistics result;\n  return result;\n}\n\n\nFuture<Nothing> NvidiaGpuIsolatorProcess::cleanup(\n    const ContainerID& containerId)\n{\n  \/\/ Multiple calls may occur during test clean up.\n  if (!infos.contains(containerId)) {\n    VLOG(1) << \"Ignoring cleanup request for unknown container \" << containerId;\n\n    return Nothing();\n  }\n\n  Info* info = CHECK_NOTNULL(infos.at(containerId));\n\n  \/\/ Make any remaining GPUs available.\n  return allocator.deallocate(info->allocated)\n    .then(defer(self(), [=]() -> Future<Nothing> {\n      CHECK(infos.contains(containerId));\n      delete infos.at(containerId);\n      infos.erase(containerId);\n\n      return Nothing();\n    }));\n}\n\n} \/\/ namespace slave {\n} \/\/ namespace internal {\n} \/\/ namespace mesos {\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2016 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\/\/\/     vpp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 Christoph Uhde\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"VppCommTask.h\"\n\n#include \"Basics\/StringBuffer.h\"\n#include \"Basics\/HybridLogicalClock.h\"\n#include \"Basics\/VelocyPackHelper.h\"\n#include \"GeneralServer\/GeneralServer.h\"\n#include \"GeneralServer\/GeneralServerFeature.h\"\n#include \"GeneralServer\/RestHandler.h\"\n#include \"GeneralServer\/RestHandlerFactory.h\"\n#include \"Scheduler\/Scheduler.h\"\n#include \"Scheduler\/SchedulerFeature.h\"\n#include \"Logger\/LoggerFeature.h\"\n#include \"VocBase\/ticks.h\"\n\n#include <velocypack\/Validator.h>\n#include <velocypack\/velocypack-aliases.h>\n\n#include <iostream>\n#include <stdexcept>\n\nusing namespace arangodb;\nusing namespace arangodb::basics;\nusing namespace arangodb::rest;\n\nnamespace {\nstd::size_t findAndValidateVPacks(char const* vpHeaderStart,\n                                  char const* chunkEnd) {\n  VPackValidator validator;\n  \/\/ check for slice start to the end of Chunk\n  \/\/ isSubPart allows the slice to be shorter than the checked buffer.\n  validator.validate(vpHeaderStart, std::distance(vpHeaderStart, chunkEnd),\n                     \/*isSubPart =*\/true);\n\n  \/\/ check if there is payload and locate the start\n  VPackSlice vpHeader(vpHeaderStart);\n  auto vpHeaderLen = vpHeader.byteSize();\n  auto vpPayloadStart = vpHeaderStart + vpHeaderLen;\n  if (vpPayloadStart == chunkEnd) {\n    return 0;  \/\/ no payload available\n  }\n\n  \/\/ validate Payload VelocyPack\n  validator.validate(vpPayloadStart, std::distance(vpPayloadStart, chunkEnd),\n                     \/*isSubPart =*\/false);\n  return std::distance(vpHeaderStart, vpPayloadStart);\n}\n\nstd::unique_ptr<basics::StringBuffer> createChunkForNetworkDetail(\n    std::vector<VPackSlice> const& slices, bool isFirstChunk, uint32_t chunk,\n    uint64_t id, uint32_t totalMessageLength = 0) {\n  using basics::StringBuffer;\n  bool firstOfMany = false;\n\n  \/\/ if we have more than one chunk and the chunk is the first\n  \/\/ then we are sending the first in a series. if this condition\n  \/\/ is true we also send extra 8 bytes for the messageLength\n  \/\/ (length of all VPackData)\n  if (isFirstChunk && chunk > 1) {\n    firstOfMany = true;\n  }\n\n  \/\/ build chunkX -- see VelocyStream Documentaion\n  chunk <<= 1;\n  chunk |= isFirstChunk ? 0x1 : 0x0;\n\n  \/\/ get the lenght of VPack data\n  uint32_t dataLength = 0;\n  for (auto& slice : slices) {\n    dataLength += slice.byteSize();\n  }\n\n  \/\/ calculate length of current chunk\n  uint32_t chunkLength = dataLength;\n  chunkLength += (sizeof(chunkLength) + sizeof(chunk) + sizeof(id));\n  if (firstOfMany) {\n    chunkLength += sizeof(totalMessageLength);\n  }\n\n  auto buffer =\n      std::make_unique<StringBuffer>(TRI_UNKNOWN_MEM_ZONE, chunkLength, false);\n\n  char cChunkLength[sizeof(chunkLength)];\n  char const* cChunkLengthPtr = cChunkLength;\n  std::memcpy(&cChunkLength, &chunkLength, sizeof(chunkLength));\n  buffer->appendText(cChunkLengthPtr, sizeof(chunkLength));\n\n  char cChunk[sizeof(chunk)];\n  char const* cChunkPtr = cChunk;\n  std::memcpy(&cChunk, &chunk, sizeof(chunk));\n  buffer->appendText(cChunkPtr, sizeof(chunk));\n\n  char cId[sizeof(id)];\n  char const* cIdPtr = cId;\n  std::memcpy(&cId, &id, sizeof(id));\n  buffer->appendText(cIdPtr, sizeof(id));\n\n  if (firstOfMany) {\n    char cTotalMessageLength[sizeof(totalMessageLength)];\n    char const* cTotalMessageLengthPtr = cTotalMessageLength;\n    std::memcpy(&cTotalMessageLength, &totalMessageLength,\n                sizeof(totalMessageLength));\n    buffer->appendText(cTotalMessageLengthPtr, sizeof(totalMessageLength));\n  }\n\n  \/\/ append data in slices\n  for (auto const& slice : slices) {\n    buffer->appendText(std::string(slice.startAs<char>(), slice.byteSize()));\n  }\n\n  return buffer;\n}\n\nstd::unique_ptr<basics::StringBuffer> createChunkForNetworkSingle(\n    std::vector<VPackSlice> const& slices, uint64_t id) {\n  return createChunkForNetworkDetail(slices, true, 1, id, 0 \/*unused*\/);\n}\n\n\/\/ TODO FIXME make use of these functions\n\/\/ std::unique_ptr<basics::StringBuffer> createChunkForNetworkMultiFirst(\n\/\/     std::vector<VPackSlice> const& slices, uint64_t id, uint32_t\n\/\/     numberOfChunks,\n\/\/     uint32_t totalMessageLength) {\n\/\/   return createChunkForNetworkDetail(slices, true, numberOfChunks, id,\n\/\/                                      totalMessageLength);\n\/\/ }\n\/\/\n\/\/ std::unique_ptr<basics::StringBuffer> createChunkForNetworkMultiFollow(\n\/\/     std::vector<VPackSlice> const& slices, uint64_t id, uint32_t chunkNumber,\n\/\/     uint32_t totalMessageLength) {\n\/\/   return createChunkForNetworkDetail(slices, false, chunkNumber, id, 0);\n\/\/ }\n}\n\nVppCommTask::VppCommTask(GeneralServer* server, TRI_socket_t sock,\n                         ConnectionInfo&& info, double timeout)\n    : Task(\"VppCommTask\"),\n      GeneralCommTask(server, sock, std::move(info), timeout) {\n  _protocol = \"vpp\";\n  \/\/ connectionStatisticsAgentSetVpp();\n}\n\nvoid VppCommTask::addResponse(VppResponse* response, bool isError) {\n  if (isError) {\n    \/\/ FIXME (obi)\n    \/\/ what do we need to do?\n    \/\/ clean read buffer? reset process read cursor\n  }\n\n  VPackMessageNoOwnBuffer response_message = response->prepareForNetwork();\n  uint64_t& id = response_message._id;\n\n  std::vector<VPackSlice> slices;\n  slices.push_back(response_message._header);\n\n  VPackBuilder builder;\n  if (response_message._generateBody) {\n    builder = basics::VelocyPackHelper::stanitizeExternalsChecked(\n        response_message._payload);\n    slices.push_back(builder.slice());\n  }\n\n  \/\/ FIXME (obi)\n  \/\/ If the message is big we will create many small chunks in a loop.\n  \/\/ For the first tests we just send single Messages\n\n  LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"got response:\";\n  for (auto const& slice : slices) {\n    try {\n      LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << slice.toJson();\n    } catch (Exception const& e) {\n      std::cout << e.message();\n    }\n  }\n\n  \/\/ adds chunk header infromation and creates SingBuffer* that can be\n  \/\/ used with _writeBuffers\n  auto buffer = createChunkForNetworkSingle(slices, id);\n  _writeBuffers.push_back(buffer.get());\n  buffer.release();\n\n  fillWriteBuffer();  \/\/ move data from _writebuffers to _writebuffer\n                      \/\/ implemented in base\n}\n\nVppCommTask::ChunkHeader VppCommTask::readChunkHeader() {\n  VppCommTask::ChunkHeader header;\n\n  auto cursor = _processReadVariables._readBufferCursor;\n\n  std::memcpy(&header._chunkLength, cursor, sizeof(header._chunkLength));\n  cursor += sizeof(header._chunkLength);\n\n  uint32_t chunkX;\n  std::memcpy(&chunkX, cursor, sizeof(chunkX));\n  cursor += sizeof(chunkX);\n\n  header._isFirst = chunkX & 0x1;\n  header._chunk = chunkX >> 1;\n\n  std::memcpy(&header._messageID, cursor, sizeof(header._messageID));\n  cursor += sizeof(header._messageID);\n\n  \/\/ extract total len of message\n  if (header._isFirst && header._chunk > 1) {\n    std::memcpy(&header._messageLength, cursor, sizeof(header._messageLength));\n    cursor += sizeof(header._messageLength);\n  } else {\n    header._messageLength = 0;  \/\/ not needed\n  }\n\n  header._headerLength =\n      std::distance(_processReadVariables._readBufferCursor, cursor);\n\n  return header;\n}\n\nbool VppCommTask::isChunkComplete(char* start) {\n  std::size_t length = std::distance(start, _readBuffer->end());\n  auto& prv = _processReadVariables;\n\n  if (!prv._currentChunkLength && length < sizeof(uint32_t)) {\n    return false;\n  }\n  if (!prv._currentChunkLength) {\n    \/\/ read chunk length\n    std::memcpy(&prv._currentChunkLength, start, sizeof(uint32_t));\n  }\n  if (length < prv._currentChunkLength) {\n    \/\/ chunk not complete\n    return false;\n  }\n\n  return true;\n}\n\n\/\/ reads data from the socket\nbool VppCommTask::processRead() {\n  \/\/ TODO FIXME\n  \/\/ - in case of error send an operation failed to all incomplete messages \/\n  \/\/   operation and close connection (implement resetState\/resetCommtask)\n\n  auto& prv = _processReadVariables;\n  if (!prv._readBufferCursor) {\n    prv._readBufferCursor = _readBuffer->begin();\n  }\n\n  auto chunkBegin = prv._readBufferCursor;\n  if (chunkBegin == nullptr || !isChunkComplete(chunkBegin)) {\n    return false;  \/\/ no data or incomplete\n  }\n\n  ChunkHeader chunkHeader = readChunkHeader();\n  auto chunkEnd = chunkBegin + chunkHeader._chunkLength;\n  auto vpackBegin = chunkBegin + chunkHeader._headerLength;\n  bool doExecute = false;\n  bool read_maybe_only_part_of_buffer = false;\n  VPackMessage message;  \/\/ filled in CASE 1 or CASE 2b\n\n  \/\/ CASE 1: message is in one chunk\n  if (chunkHeader._isFirst && chunkHeader._chunk == 1) {\n    std::size_t payloadOffset = findAndValidateVPacks(vpackBegin, chunkEnd);\n    message._id = chunkHeader._messageID;\n    message._buffer.append(vpackBegin, std::distance(vpackBegin, chunkEnd));\n    message._header = VPackSlice(message._buffer.data());\n    if (payloadOffset) {\n      message._payload = VPackSlice(message._buffer.data() + payloadOffset);\n    }\n    VPackValidator val;\n    val.validate(message._header.begin(), message._header.byteSize());\n\n    doExecute = true;\n    LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"CASE 1\";\n  }\n  \/\/ CASE 2:  message is in multiple chunks\n  auto incompleteMessageItr = _incompleteMessages.find(chunkHeader._messageID);\n\n  \/\/ CASE 2a: chunk starts new message\n  if (chunkHeader._isFirst) {  \/\/ first chunk of multi chunk message\n    if (incompleteMessageItr != _incompleteMessages.end()) {\n      throw std::logic_error(\n          \"Message should be first but is already in the Map of incomplete \"\n          \"messages\");\n    }\n\n    IncompleteVPackMessage message(chunkHeader._messageLength,\n                                   chunkHeader._chunk \/*number of chunks*\/);\n    message._buffer.append(vpackBegin, std::distance(vpackBegin, chunkEnd));\n    auto insertPair = _incompleteMessages.emplace(\n        std::make_pair(chunkHeader._messageID, std::move(message)));\n    if (!insertPair.second) {\n      throw std::logic_error(\"insert failed\");\n    }\n\n    LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"CASE 2a\";\n\n    \/\/ CASE 2b: chunk continues a message\n  } else {  \/\/ followup chunk of some mesage\n    if (incompleteMessageItr == _incompleteMessages.end()) {\n      throw std::logic_error(\"found message without previous part\");\n    }\n    auto& im = incompleteMessageItr->second;  \/\/ incomplete Message\n    im._currentChunk++;\n    assert(im._currentChunk == chunkHeader._chunk);\n    im._buffer.append(vpackBegin, std::distance(vpackBegin, chunkEnd));\n    \/\/ check buffer longer than length\n\n    \/\/ MESSAGE COMPLETE\n    if (im._currentChunk == im._numberOfChunks - 1 \/* zero based counting *\/) {\n      std::size_t payloadOffset = findAndValidateVPacks(\n          reinterpret_cast<char const*>(im._buffer.data()),\n          reinterpret_cast<char const*>(im._buffer.data() +\n                                        im._buffer.byteSize()));\n      message._id = chunkHeader._messageID;\n      message._buffer = std::move(im._buffer);\n      message._header = VPackSlice(message._buffer.data());\n      if (payloadOffset) {\n        message._payload = VPackSlice(message._buffer.data() + payloadOffset);\n      }\n      _incompleteMessages.erase(incompleteMessageItr);\n      \/\/ check length\n\n      doExecute = true;\n      LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"CASE 2b - complete\";\n    }\n    LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"CASE 2b - still incomplete\";\n  }\n\n  \/\/ clean buffer up to length of chunk\n  read_maybe_only_part_of_buffer = true;\n  prv._currentChunkLength = 0;\n  prv._readBufferCursor = chunkEnd;\n  std::size_t processedDataLen =\n      std::distance(_readBuffer->begin(), prv._readBufferCursor);\n  if (processedDataLen > prv._cleanupLength) {\n    _readBuffer->move_front(prv._cleanupLength);\n    prv._readBufferCursor = nullptr;  \/\/ the positon will be set at the\n                                      \/\/ begin of this function\n  }\n\n  if (doExecute) {\n    \/\/    return false;  \/\/ we have no complete request, so we return early\n    \/\/ for now we can handle only one request at a time\n    \/\/ lock _request???? REVIEW (fc)\n    LOG_TOPIC(DEBUG, Logger::COMMUNICATION)\n        << \"got request:\" << message._header.toJson();\n    _request = new VppRequest(_connectionInfo, std::move(message));\n    GeneralServerFeature::HANDLER_FACTORY->setRequestContext(_request);\n    if (_request->requestContext() == nullptr) {\n      handleSimpleError(GeneralResponse::ResponseCode::NOT_FOUND,\n                        TRI_ERROR_ARANGO_DATABASE_NOT_FOUND,\n                        TRI_errno_string(TRI_ERROR_ARANGO_DATABASE_NOT_FOUND));\n    } else {\n      _request->setClientTaskId(_taskId);\n      _protocolVersion = _request->protocolVersion();\n      executeRequest(\n          _request, new VppResponse(GeneralResponse::ResponseCode::SERVER_ERROR,\n                                    chunkHeader._messageID));\n    }\n  }\n\n  if (read_maybe_only_part_of_buffer) {\n    if (prv._readBufferCursor == _readBuffer->end()) {\n      return false;\n    }\n    return true;\n  }\n  return doExecute;\n}\n\nvoid VppCommTask::completedWriteBuffer() {\n  \/\/ REVIEW (fc)\n}\n\nvoid VppCommTask::resetState(bool close) {\n  \/\/ REVIEW (fc)\n  \/\/ is there a case where we do not want to close the connection\n  replyToIncompleteMessages();\n}\n\n\/\/ GeneralResponse::ResponseCode VppCommTask::authenticateRequest() {\n\/\/   auto context = (_request == nullptr) ? nullptr :\n\/\/   _request->requestContext();\n\/\/\n\/\/   if (context == nullptr && _request != nullptr) {\n\/\/     bool res =\n\/\/         GeneralServerFeature::HANDLER_FACTORY->setRequestContext(_request);\n\/\/\n\/\/     if (!res) {\n\/\/       return GeneralResponse::ResponseCode::NOT_FOUND;\n\/\/     }\n\/\/\n\/\/     context = _request->requestContext();\n\/\/   }\n\/\/\n\/\/   if (context == nullptr) {\n\/\/     return GeneralResponse::ResponseCode::SERVER_ERROR;\n\/\/   }\n\/\/\n\/\/   return context->authenticate();\n\/\/ }\n\n\/\/ convert internal GeneralRequest to VppRequest\nVppRequest* VppCommTask::requestAsVpp() {\n  VppRequest* request = dynamic_cast<VppRequest*>(_request);\n  if (request == nullptr) {\n    THROW_ARANGO_EXCEPTION(TRI_ERROR_INTERNAL);\n  }\n  return request;\n};\n<commit_msg>i fix type of execepton so it gets caught<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2016 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\/\/\/     vpp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 Christoph Uhde\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"VppCommTask.h\"\n\n#include \"Basics\/StringBuffer.h\"\n#include \"Basics\/HybridLogicalClock.h\"\n#include \"Basics\/VelocyPackHelper.h\"\n#include \"GeneralServer\/GeneralServer.h\"\n#include \"GeneralServer\/GeneralServerFeature.h\"\n#include \"GeneralServer\/RestHandler.h\"\n#include \"GeneralServer\/RestHandlerFactory.h\"\n#include \"Scheduler\/Scheduler.h\"\n#include \"Scheduler\/SchedulerFeature.h\"\n#include \"Logger\/LoggerFeature.h\"\n#include \"VocBase\/ticks.h\"\n\n#include <velocypack\/Validator.h>\n#include <velocypack\/velocypack-aliases.h>\n\n#include <iostream>\n#include <stdexcept>\n\nusing namespace arangodb;\nusing namespace arangodb::basics;\nusing namespace arangodb::rest;\n\nnamespace {\nstd::size_t findAndValidateVPacks(char const* vpHeaderStart,\n                                  char const* chunkEnd) {\n  VPackValidator validator;\n  \/\/ check for slice start to the end of Chunk\n  \/\/ isSubPart allows the slice to be shorter than the checked buffer.\n  validator.validate(vpHeaderStart, std::distance(vpHeaderStart, chunkEnd),\n                     \/*isSubPart =*\/true);\n\n  \/\/ check if there is payload and locate the start\n  VPackSlice vpHeader(vpHeaderStart);\n  auto vpHeaderLen = vpHeader.byteSize();\n  auto vpPayloadStart = vpHeaderStart + vpHeaderLen;\n  if (vpPayloadStart == chunkEnd) {\n    return 0;  \/\/ no payload available\n  }\n\n  \/\/ validate Payload VelocyPack\n  validator.validate(vpPayloadStart, std::distance(vpPayloadStart, chunkEnd),\n                     \/*isSubPart =*\/false);\n  return std::distance(vpHeaderStart, vpPayloadStart);\n}\n\nstd::unique_ptr<basics::StringBuffer> createChunkForNetworkDetail(\n    std::vector<VPackSlice> const& slices, bool isFirstChunk, uint32_t chunk,\n    uint64_t id, uint32_t totalMessageLength = 0) {\n  using basics::StringBuffer;\n  bool firstOfMany = false;\n\n  \/\/ if we have more than one chunk and the chunk is the first\n  \/\/ then we are sending the first in a series. if this condition\n  \/\/ is true we also send extra 8 bytes for the messageLength\n  \/\/ (length of all VPackData)\n  if (isFirstChunk && chunk > 1) {\n    firstOfMany = true;\n  }\n\n  \/\/ build chunkX -- see VelocyStream Documentaion\n  chunk <<= 1;\n  chunk |= isFirstChunk ? 0x1 : 0x0;\n\n  \/\/ get the lenght of VPack data\n  uint32_t dataLength = 0;\n  for (auto& slice : slices) {\n    dataLength += slice.byteSize();\n  }\n\n  \/\/ calculate length of current chunk\n  uint32_t chunkLength = dataLength;\n  chunkLength += (sizeof(chunkLength) + sizeof(chunk) + sizeof(id));\n  if (firstOfMany) {\n    chunkLength += sizeof(totalMessageLength);\n  }\n\n  auto buffer =\n      std::make_unique<StringBuffer>(TRI_UNKNOWN_MEM_ZONE, chunkLength, false);\n\n  char cChunkLength[sizeof(chunkLength)];\n  char const* cChunkLengthPtr = cChunkLength;\n  std::memcpy(&cChunkLength, &chunkLength, sizeof(chunkLength));\n  buffer->appendText(cChunkLengthPtr, sizeof(chunkLength));\n\n  char cChunk[sizeof(chunk)];\n  char const* cChunkPtr = cChunk;\n  std::memcpy(&cChunk, &chunk, sizeof(chunk));\n  buffer->appendText(cChunkPtr, sizeof(chunk));\n\n  char cId[sizeof(id)];\n  char const* cIdPtr = cId;\n  std::memcpy(&cId, &id, sizeof(id));\n  buffer->appendText(cIdPtr, sizeof(id));\n\n  if (firstOfMany) {\n    char cTotalMessageLength[sizeof(totalMessageLength)];\n    char const* cTotalMessageLengthPtr = cTotalMessageLength;\n    std::memcpy(&cTotalMessageLength, &totalMessageLength,\n                sizeof(totalMessageLength));\n    buffer->appendText(cTotalMessageLengthPtr, sizeof(totalMessageLength));\n  }\n\n  \/\/ append data in slices\n  for (auto const& slice : slices) {\n    buffer->appendText(std::string(slice.startAs<char>(), slice.byteSize()));\n  }\n\n  return buffer;\n}\n\nstd::unique_ptr<basics::StringBuffer> createChunkForNetworkSingle(\n    std::vector<VPackSlice> const& slices, uint64_t id) {\n  return createChunkForNetworkDetail(slices, true, 1, id, 0 \/*unused*\/);\n}\n\n\/\/ TODO FIXME make use of these functions\n\/\/ std::unique_ptr<basics::StringBuffer> createChunkForNetworkMultiFirst(\n\/\/     std::vector<VPackSlice> const& slices, uint64_t id, uint32_t\n\/\/     numberOfChunks,\n\/\/     uint32_t totalMessageLength) {\n\/\/   return createChunkForNetworkDetail(slices, true, numberOfChunks, id,\n\/\/                                      totalMessageLength);\n\/\/ }\n\/\/\n\/\/ std::unique_ptr<basics::StringBuffer> createChunkForNetworkMultiFollow(\n\/\/     std::vector<VPackSlice> const& slices, uint64_t id, uint32_t chunkNumber,\n\/\/     uint32_t totalMessageLength) {\n\/\/   return createChunkForNetworkDetail(slices, false, chunkNumber, id, 0);\n\/\/ }\n}\n\nVppCommTask::VppCommTask(GeneralServer* server, TRI_socket_t sock,\n                         ConnectionInfo&& info, double timeout)\n    : Task(\"VppCommTask\"),\n      GeneralCommTask(server, sock, std::move(info), timeout) {\n  _protocol = \"vpp\";\n  \/\/ connectionStatisticsAgentSetVpp();\n}\n\nvoid VppCommTask::addResponse(VppResponse* response, bool isError) {\n  if (isError) {\n    \/\/ FIXME (obi)\n    \/\/ what do we need to do?\n    \/\/ clean read buffer? reset process read cursor\n  }\n\n  VPackMessageNoOwnBuffer response_message = response->prepareForNetwork();\n  uint64_t& id = response_message._id;\n\n  std::vector<VPackSlice> slices;\n  slices.push_back(response_message._header);\n\n  VPackBuilder builder;\n  if (response_message._generateBody) {\n    builder = basics::VelocyPackHelper::stanitizeExternalsChecked(\n        response_message._payload);\n    slices.push_back(builder.slice());\n  }\n\n  \/\/ FIXME (obi)\n  \/\/ If the message is big we will create many small chunks in a loop.\n  \/\/ For the first tests we just send single Messages\n\n  LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"got response:\";\n  for (auto const& slice : slices) {\n    try {\n      LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << slice.toJson();\n    } catch (arangodb::velocypack::Exception const& e) {\n      std::cout << \"obi exception\" << e.what();\n    }\n  }\n\n  \/\/ adds chunk header infromation and creates SingBuffer* that can be\n  \/\/ used with _writeBuffers\n  auto buffer = createChunkForNetworkSingle(slices, id);\n  _writeBuffers.push_back(buffer.get());\n  buffer.release();\n\n  fillWriteBuffer();  \/\/ move data from _writebuffers to _writebuffer\n                      \/\/ implemented in base\n}\n\nVppCommTask::ChunkHeader VppCommTask::readChunkHeader() {\n  VppCommTask::ChunkHeader header;\n\n  auto cursor = _processReadVariables._readBufferCursor;\n\n  std::memcpy(&header._chunkLength, cursor, sizeof(header._chunkLength));\n  cursor += sizeof(header._chunkLength);\n\n  uint32_t chunkX;\n  std::memcpy(&chunkX, cursor, sizeof(chunkX));\n  cursor += sizeof(chunkX);\n\n  header._isFirst = chunkX & 0x1;\n  header._chunk = chunkX >> 1;\n\n  std::memcpy(&header._messageID, cursor, sizeof(header._messageID));\n  cursor += sizeof(header._messageID);\n\n  \/\/ extract total len of message\n  if (header._isFirst && header._chunk > 1) {\n    std::memcpy(&header._messageLength, cursor, sizeof(header._messageLength));\n    cursor += sizeof(header._messageLength);\n  } else {\n    header._messageLength = 0;  \/\/ not needed\n  }\n\n  header._headerLength =\n      std::distance(_processReadVariables._readBufferCursor, cursor);\n\n  return header;\n}\n\nbool VppCommTask::isChunkComplete(char* start) {\n  std::size_t length = std::distance(start, _readBuffer->end());\n  auto& prv = _processReadVariables;\n\n  if (!prv._currentChunkLength && length < sizeof(uint32_t)) {\n    return false;\n  }\n  if (!prv._currentChunkLength) {\n    \/\/ read chunk length\n    std::memcpy(&prv._currentChunkLength, start, sizeof(uint32_t));\n  }\n  if (length < prv._currentChunkLength) {\n    \/\/ chunk not complete\n    return false;\n  }\n\n  return true;\n}\n\n\/\/ reads data from the socket\nbool VppCommTask::processRead() {\n  \/\/ TODO FIXME\n  \/\/ - in case of error send an operation failed to all incomplete messages \/\n  \/\/   operation and close connection (implement resetState\/resetCommtask)\n\n  auto& prv = _processReadVariables;\n  if (!prv._readBufferCursor) {\n    prv._readBufferCursor = _readBuffer->begin();\n  }\n\n  auto chunkBegin = prv._readBufferCursor;\n  if (chunkBegin == nullptr || !isChunkComplete(chunkBegin)) {\n    return false;  \/\/ no data or incomplete\n  }\n\n  ChunkHeader chunkHeader = readChunkHeader();\n  auto chunkEnd = chunkBegin + chunkHeader._chunkLength;\n  auto vpackBegin = chunkBegin + chunkHeader._headerLength;\n  bool doExecute = false;\n  bool read_maybe_only_part_of_buffer = false;\n  VPackMessage message;  \/\/ filled in CASE 1 or CASE 2b\n\n  \/\/ CASE 1: message is in one chunk\n  if (chunkHeader._isFirst && chunkHeader._chunk == 1) {\n    std::size_t payloadOffset = findAndValidateVPacks(vpackBegin, chunkEnd);\n    message._id = chunkHeader._messageID;\n    message._buffer.append(vpackBegin, std::distance(vpackBegin, chunkEnd));\n    message._header = VPackSlice(message._buffer.data());\n    if (payloadOffset) {\n      message._payload = VPackSlice(message._buffer.data() + payloadOffset);\n    }\n    VPackValidator val;\n    val.validate(message._header.begin(), message._header.byteSize());\n\n    doExecute = true;\n    LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"CASE 1\";\n  }\n  \/\/ CASE 2:  message is in multiple chunks\n  auto incompleteMessageItr = _incompleteMessages.find(chunkHeader._messageID);\n\n  \/\/ CASE 2a: chunk starts new message\n  if (chunkHeader._isFirst) {  \/\/ first chunk of multi chunk message\n    if (incompleteMessageItr != _incompleteMessages.end()) {\n      throw std::logic_error(\n          \"Message should be first but is already in the Map of incomplete \"\n          \"messages\");\n    }\n\n    IncompleteVPackMessage message(chunkHeader._messageLength,\n                                   chunkHeader._chunk \/*number of chunks*\/);\n    message._buffer.append(vpackBegin, std::distance(vpackBegin, chunkEnd));\n    auto insertPair = _incompleteMessages.emplace(\n        std::make_pair(chunkHeader._messageID, std::move(message)));\n    if (!insertPair.second) {\n      throw std::logic_error(\"insert failed\");\n    }\n\n    LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"CASE 2a\";\n\n    \/\/ CASE 2b: chunk continues a message\n  } else {  \/\/ followup chunk of some mesage\n    if (incompleteMessageItr == _incompleteMessages.end()) {\n      throw std::logic_error(\"found message without previous part\");\n    }\n    auto& im = incompleteMessageItr->second;  \/\/ incomplete Message\n    im._currentChunk++;\n    assert(im._currentChunk == chunkHeader._chunk);\n    im._buffer.append(vpackBegin, std::distance(vpackBegin, chunkEnd));\n    \/\/ check buffer longer than length\n\n    \/\/ MESSAGE COMPLETE\n    if (im._currentChunk == im._numberOfChunks - 1 \/* zero based counting *\/) {\n      std::size_t payloadOffset = findAndValidateVPacks(\n          reinterpret_cast<char const*>(im._buffer.data()),\n          reinterpret_cast<char const*>(im._buffer.data() +\n                                        im._buffer.byteSize()));\n      message._id = chunkHeader._messageID;\n      message._buffer = std::move(im._buffer);\n      message._header = VPackSlice(message._buffer.data());\n      if (payloadOffset) {\n        message._payload = VPackSlice(message._buffer.data() + payloadOffset);\n      }\n      _incompleteMessages.erase(incompleteMessageItr);\n      \/\/ check length\n\n      doExecute = true;\n      LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"CASE 2b - complete\";\n    }\n    LOG_TOPIC(DEBUG, Logger::COMMUNICATION) << \"CASE 2b - still incomplete\";\n  }\n\n  \/\/ clean buffer up to length of chunk\n  read_maybe_only_part_of_buffer = true;\n  prv._currentChunkLength = 0;\n  prv._readBufferCursor = chunkEnd;\n  std::size_t processedDataLen =\n      std::distance(_readBuffer->begin(), prv._readBufferCursor);\n  if (processedDataLen > prv._cleanupLength) {\n    _readBuffer->move_front(prv._cleanupLength);\n    prv._readBufferCursor = nullptr;  \/\/ the positon will be set at the\n                                      \/\/ begin of this function\n  }\n\n  if (doExecute) {\n    \/\/    return false;  \/\/ we have no complete request, so we return early\n    \/\/ for now we can handle only one request at a time\n    \/\/ lock _request???? REVIEW (fc)\n    LOG_TOPIC(DEBUG, Logger::COMMUNICATION)\n        << \"got request:\" << message._header.toJson();\n    _request = new VppRequest(_connectionInfo, std::move(message));\n    GeneralServerFeature::HANDLER_FACTORY->setRequestContext(_request);\n    if (_request->requestContext() == nullptr) {\n      handleSimpleError(GeneralResponse::ResponseCode::NOT_FOUND,\n                        TRI_ERROR_ARANGO_DATABASE_NOT_FOUND,\n                        TRI_errno_string(TRI_ERROR_ARANGO_DATABASE_NOT_FOUND));\n    } else {\n      _request->setClientTaskId(_taskId);\n      _protocolVersion = _request->protocolVersion();\n      executeRequest(\n          _request, new VppResponse(GeneralResponse::ResponseCode::SERVER_ERROR,\n                                    chunkHeader._messageID));\n    }\n  }\n\n  if (read_maybe_only_part_of_buffer) {\n    if (prv._readBufferCursor == _readBuffer->end()) {\n      return false;\n    }\n    return true;\n  }\n  return doExecute;\n}\n\nvoid VppCommTask::completedWriteBuffer() {\n  \/\/ REVIEW (fc)\n}\n\nvoid VppCommTask::resetState(bool close) {\n  \/\/ REVIEW (fc)\n  \/\/ is there a case where we do not want to close the connection\n  replyToIncompleteMessages();\n}\n\n\/\/ GeneralResponse::ResponseCode VppCommTask::authenticateRequest() {\n\/\/   auto context = (_request == nullptr) ? nullptr :\n\/\/   _request->requestContext();\n\/\/\n\/\/   if (context == nullptr && _request != nullptr) {\n\/\/     bool res =\n\/\/         GeneralServerFeature::HANDLER_FACTORY->setRequestContext(_request);\n\/\/\n\/\/     if (!res) {\n\/\/       return GeneralResponse::ResponseCode::NOT_FOUND;\n\/\/     }\n\/\/\n\/\/     context = _request->requestContext();\n\/\/   }\n\/\/\n\/\/   if (context == nullptr) {\n\/\/     return GeneralResponse::ResponseCode::SERVER_ERROR;\n\/\/   }\n\/\/\n\/\/   return context->authenticate();\n\/\/ }\n\n\/\/ convert internal GeneralRequest to VppRequest\nVppRequest* VppCommTask::requestAsVpp() {\n  VppRequest* request = dynamic_cast<VppRequest*>(_request);\n  if (request == nullptr) {\n    THROW_ARANGO_EXCEPTION(TRI_ERROR_INTERNAL);\n  }\n  return request;\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n\n  Licensed to Accellera Systems Initiative Inc. (Accellera) under one or\n  more contributor license agreements.  See the NOTICE file distributed\n  with this work for additional information regarding copyright ownership.\n  Accellera 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 the\n  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\n  implied.  See the License for the specific language governing\n  permissions and limitations under the License.\n\n *****************************************************************************\/\n\n#ifndef __SYSTEMC_EXT_TLM_CORE_2_SOCKETS_INITIATOR_SOCKET_HH__\n#define __SYSTEMC_EXT_TLM_CORE_2_SOCKETS_INITIATOR_SOCKET_HH__\n\n#include <typeindex>\n\n#include \"..\/interfaces\/fw_bw_ifs.hh\"\n#include \"base_socket_if.hh\"\n\nnamespace tlm\n{\n\ntemplate <unsigned int BUSWIDTH=32,\n          typename FW_IF=tlm_fw_transport_if<>,\n          typename BW_IF=tlm_bw_transport_if<>>\nclass tlm_base_initiator_socket_b\n{\n  public:\n    virtual ~tlm_base_initiator_socket_b() {}\n\n    virtual sc_core::sc_port_b<FW_IF> &get_base_port() = 0;\n    virtual sc_core::sc_port_b<FW_IF> const &get_base_port() const = 0;\n    virtual BW_IF &get_base_interface() = 0;\n    virtual BW_IF const &get_base_interface() const = 0;\n    virtual sc_core::sc_export<BW_IF> &get_base_export() = 0;\n    virtual sc_core::sc_export<BW_IF> const &get_base_export() const = 0;\n};\n\ntemplate <unsigned int BUSWIDTH, typename FW_IF, typename BW_IF>\nclass tlm_base_target_socket_b;\n\ntemplate <unsigned int BUSWIDTH, typename FW_IF, typename BW_IF, int N,\n          sc_core::sc_port_policy POL>\nclass tlm_base_target_socket;\n\ntemplate <unsigned int BUSWIDTH=32, typename FW_IF=tlm_fw_transport_if<>,\n          typename BW_IF=tlm_bw_transport_if<>, int N=1,\n          sc_core::sc_port_policy POL=sc_core::SC_ONE_OR_MORE_BOUND>\nclass tlm_base_initiator_socket :\n    public tlm_base_socket_if,\n    public tlm_base_initiator_socket_b<BUSWIDTH, FW_IF, BW_IF>,\n    public sc_core::sc_port<FW_IF, N, POL>\n{\n  public:\n    typedef FW_IF fw_interface_type;\n    typedef BW_IF bw_interface_type;\n    typedef sc_core::sc_port<fw_interface_type, N, POL> port_type;\n\n    typedef sc_core::sc_export<bw_interface_type> export_type;\n\n    typedef tlm_base_target_socket_b<\n        BUSWIDTH, fw_interface_type, bw_interface_type>\n        base_target_socket_type;\n    typedef tlm_base_initiator_socket_b<\n        BUSWIDTH, fw_interface_type, bw_interface_type> base_type;\n\n    template <unsigned int, typename, typename, int, sc_core::sc_port_policy>\n    friend class tlm_base_target_socket;\n\n  public:\n    tlm_base_initiator_socket() :\n        port_type(sc_core::sc_gen_unique_name(\"tlm_base_initiator_socket\")),\n        m_export(sc_core::sc_gen_unique_name(\n                    \"tlm_base_initiator_socket_export\"))\n    {}\n\n    explicit tlm_base_initiator_socket(const char *name) : port_type(name),\n        m_export(sc_core::sc_gen_unique_name(\n                    (std::string(name) + \"_export\").c_str()))\n    {}\n\n    virtual const char* kind() const { return \"tlm_base_initiator_socket\"; }\n\n    \/\/\n    \/\/ Bind initiator socket to target socket\n    \/\/ - Binds the port of the initiator socket to the export of the target\n    \/\/   socket\n    \/\/ - Binds the port of the target socket to the export of the initiator\n    \/\/   socket\n    \/\/\n    virtual void\n    bind(base_target_socket_type &s)\n    {\n        \/\/ initiator.port -> target.export\n        (get_base_port())(s.get_base_interface());\n        \/\/ target.port -> initiator.export\n        (s.get_base_port())(get_base_interface());\n    }\n\n    void operator () (base_target_socket_type &s) { bind(s); }\n\n    \/\/\n    \/\/ Bind initiator socket to initiator socket (hierarchical bind)\n    \/\/ - Binds both the export and the port\n    \/\/\n    virtual void\n    bind(base_type &s)\n    {\n        \/\/ port\n        (get_base_port())(s.get_base_port());\n        \/\/ export\n        (s.get_base_export())(get_base_export());\n    }\n\n    void operator() (base_type &s) { bind(s); }\n\n    \/\/\n    \/\/ Bind interface to socket\n    \/\/ - Binds the interface to the export of this socket\n    \/\/\n    virtual void bind(bw_interface_type &ifs) { (get_base_export())(ifs); }\n    void operator() (bw_interface_type &s) { bind(s); }\n\n    \/\/ Implementation of tlm_base_socket_if functions\n    virtual sc_core::sc_port_base &get_port_base() { return *this; }\n    virtual sc_core::sc_port_base const &\n    get_port_base() const\n    {\n        return *this;\n    }\n    virtual sc_core::sc_export_base &get_export_base() { return m_export; }\n    virtual sc_core::sc_export_base const &\n    get_export_base() const\n    {\n        return m_export;\n    }\n    virtual unsigned int get_bus_width() const { return BUSWIDTH; }\n    virtual tlm_socket_category\n    get_socket_category() const\n    {\n        return TLM_INITIATOR_SOCKET;\n    }\n\n    \/\/ Implementation of tlm_base_target_socket_b functions\n    virtual sc_core::sc_port_b<FW_IF> &get_base_port() { return *this; }\n    virtual sc_core::sc_port_b<FW_IF> const &\n    get_base_port() const\n    {\n        return *this;\n    }\n\n    virtual BW_IF &get_base_interface() { return m_export; }\n    virtual BW_IF const &get_base_interface() const { return m_export; }\n\n    virtual sc_core::sc_export<BW_IF> &get_base_export() { return m_export; }\n    virtual sc_core::sc_export<BW_IF> const &\n    get_base_export() const\n    {\n        return m_export;\n    }\n\n  protected:\n    export_type m_export;\n\n  private:\n    using port_type::bind;\n};\n\n\/\/\n\/\/ Convenience socket classes\n\/\/\n\ntemplate <unsigned int BUSWIDTH=32, typename TYPES=tlm_base_protocol_types,\n          int N=1, sc_core::sc_port_policy POL=sc_core::SC_ONE_OR_MORE_BOUND>\nclass tlm_initiator_socket : public tlm_base_initiator_socket<\n                             BUSWIDTH, tlm_fw_transport_if<TYPES>,\n                             tlm_bw_transport_if<TYPES>, N, POL>\n{\n  public:\n    tlm_initiator_socket() : tlm_base_initiator_socket<\n                             BUSWIDTH, tlm_fw_transport_if<TYPES>,\n                             tlm_bw_transport_if<TYPES>, N, POL>()\n    {}\n\n    explicit tlm_initiator_socket(const char *name) :\n        tlm_base_initiator_socket<BUSWIDTH, tlm_fw_transport_if<TYPES>,\n                                  tlm_bw_transport_if<TYPES>, N, POL>(name)\n    {}\n\n    virtual const char *kind() const { return \"tlm_initiator_socket\"; }\n\n    virtual std::type_index\n    get_protocol_types() const\n    {\n        return typeid(TYPES);\n    }\n};\n\n} \/\/ namespace tlm\n\n#endif \/* __SYSTEMC_EXT_TLM_CORE_2_SOCKETS_INITIATOR_SOCKET_HH__ *\/\n<commit_msg>systemc: Purposefully *expose* bind in the initiator socket.<commit_after>\/*****************************************************************************\n\n  Licensed to Accellera Systems Initiative Inc. (Accellera) under one or\n  more contributor license agreements.  See the NOTICE file distributed\n  with this work for additional information regarding copyright ownership.\n  Accellera 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 the\n  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\n  implied.  See the License for the specific language governing\n  permissions and limitations under the License.\n\n *****************************************************************************\/\n\n#ifndef __SYSTEMC_EXT_TLM_CORE_2_SOCKETS_INITIATOR_SOCKET_HH__\n#define __SYSTEMC_EXT_TLM_CORE_2_SOCKETS_INITIATOR_SOCKET_HH__\n\n#include <typeindex>\n\n#include \"..\/interfaces\/fw_bw_ifs.hh\"\n#include \"base_socket_if.hh\"\n\nnamespace tlm\n{\n\ntemplate <unsigned int BUSWIDTH=32,\n          typename FW_IF=tlm_fw_transport_if<>,\n          typename BW_IF=tlm_bw_transport_if<>>\nclass tlm_base_initiator_socket_b\n{\n  public:\n    virtual ~tlm_base_initiator_socket_b() {}\n\n    virtual sc_core::sc_port_b<FW_IF> &get_base_port() = 0;\n    virtual sc_core::sc_port_b<FW_IF> const &get_base_port() const = 0;\n    virtual BW_IF &get_base_interface() = 0;\n    virtual BW_IF const &get_base_interface() const = 0;\n    virtual sc_core::sc_export<BW_IF> &get_base_export() = 0;\n    virtual sc_core::sc_export<BW_IF> const &get_base_export() const = 0;\n};\n\ntemplate <unsigned int BUSWIDTH, typename FW_IF, typename BW_IF>\nclass tlm_base_target_socket_b;\n\ntemplate <unsigned int BUSWIDTH, typename FW_IF, typename BW_IF, int N,\n          sc_core::sc_port_policy POL>\nclass tlm_base_target_socket;\n\ntemplate <unsigned int BUSWIDTH=32, typename FW_IF=tlm_fw_transport_if<>,\n          typename BW_IF=tlm_bw_transport_if<>, int N=1,\n          sc_core::sc_port_policy POL=sc_core::SC_ONE_OR_MORE_BOUND>\nclass tlm_base_initiator_socket :\n    public tlm_base_socket_if,\n    public tlm_base_initiator_socket_b<BUSWIDTH, FW_IF, BW_IF>,\n    public sc_core::sc_port<FW_IF, N, POL>\n{\n  public:\n    typedef FW_IF fw_interface_type;\n    typedef BW_IF bw_interface_type;\n    typedef sc_core::sc_port<fw_interface_type, N, POL> port_type;\n\n    typedef sc_core::sc_export<bw_interface_type> export_type;\n\n    typedef tlm_base_target_socket_b<\n        BUSWIDTH, fw_interface_type, bw_interface_type>\n        base_target_socket_type;\n    typedef tlm_base_initiator_socket_b<\n        BUSWIDTH, fw_interface_type, bw_interface_type> base_type;\n\n    template <unsigned int, typename, typename, int, sc_core::sc_port_policy>\n    friend class tlm_base_target_socket;\n\n  public:\n    tlm_base_initiator_socket() :\n        port_type(sc_core::sc_gen_unique_name(\"tlm_base_initiator_socket\")),\n        m_export(sc_core::sc_gen_unique_name(\n                    \"tlm_base_initiator_socket_export\"))\n    {}\n\n    explicit tlm_base_initiator_socket(const char *name) : port_type(name),\n        m_export(sc_core::sc_gen_unique_name(\n                    (std::string(name) + \"_export\").c_str()))\n    {}\n\n    virtual const char* kind() const { return \"tlm_base_initiator_socket\"; }\n\n    \/\/\n    \/\/ Bind initiator socket to target socket\n    \/\/ - Binds the port of the initiator socket to the export of the target\n    \/\/   socket\n    \/\/ - Binds the port of the target socket to the export of the initiator\n    \/\/   socket\n    \/\/\n    virtual void\n    bind(base_target_socket_type &s)\n    {\n        \/\/ initiator.port -> target.export\n        (get_base_port())(s.get_base_interface());\n        \/\/ target.port -> initiator.export\n        (s.get_base_port())(get_base_interface());\n    }\n\n    void operator () (base_target_socket_type &s) { bind(s); }\n\n    \/\/\n    \/\/ Bind initiator socket to initiator socket (hierarchical bind)\n    \/\/ - Binds both the export and the port\n    \/\/\n    virtual void\n    bind(base_type &s)\n    {\n        \/\/ port\n        (get_base_port())(s.get_base_port());\n        \/\/ export\n        (s.get_base_export())(get_base_export());\n    }\n\n    using port_type::bind;\n\n    void operator() (base_type &s) { bind(s); }\n\n    \/\/\n    \/\/ Bind interface to socket\n    \/\/ - Binds the interface to the export of this socket\n    \/\/\n    virtual void bind(bw_interface_type &ifs) { (get_base_export())(ifs); }\n    void operator() (bw_interface_type &s) { bind(s); }\n\n    \/\/ Implementation of tlm_base_socket_if functions\n    virtual sc_core::sc_port_base &get_port_base() { return *this; }\n    virtual sc_core::sc_port_base const &\n    get_port_base() const\n    {\n        return *this;\n    }\n    virtual sc_core::sc_export_base &get_export_base() { return m_export; }\n    virtual sc_core::sc_export_base const &\n    get_export_base() const\n    {\n        return m_export;\n    }\n    virtual unsigned int get_bus_width() const { return BUSWIDTH; }\n    virtual tlm_socket_category\n    get_socket_category() const\n    {\n        return TLM_INITIATOR_SOCKET;\n    }\n\n    \/\/ Implementation of tlm_base_target_socket_b functions\n    virtual sc_core::sc_port_b<FW_IF> &get_base_port() { return *this; }\n    virtual sc_core::sc_port_b<FW_IF> const &\n    get_base_port() const\n    {\n        return *this;\n    }\n\n    virtual BW_IF &get_base_interface() { return m_export; }\n    virtual BW_IF const &get_base_interface() const { return m_export; }\n\n    virtual sc_core::sc_export<BW_IF> &get_base_export() { return m_export; }\n    virtual sc_core::sc_export<BW_IF> const &\n    get_base_export() const\n    {\n        return m_export;\n    }\n\n  protected:\n    export_type m_export;\n};\n\n\/\/\n\/\/ Convenience socket classes\n\/\/\n\ntemplate <unsigned int BUSWIDTH=32, typename TYPES=tlm_base_protocol_types,\n          int N=1, sc_core::sc_port_policy POL=sc_core::SC_ONE_OR_MORE_BOUND>\nclass tlm_initiator_socket : public tlm_base_initiator_socket<\n                             BUSWIDTH, tlm_fw_transport_if<TYPES>,\n                             tlm_bw_transport_if<TYPES>, N, POL>\n{\n  public:\n    tlm_initiator_socket() : tlm_base_initiator_socket<\n                             BUSWIDTH, tlm_fw_transport_if<TYPES>,\n                             tlm_bw_transport_if<TYPES>, N, POL>()\n    {}\n\n    explicit tlm_initiator_socket(const char *name) :\n        tlm_base_initiator_socket<BUSWIDTH, tlm_fw_transport_if<TYPES>,\n                                  tlm_bw_transport_if<TYPES>, N, POL>(name)\n    {}\n\n    virtual const char *kind() const { return \"tlm_initiator_socket\"; }\n\n    virtual std::type_index\n    get_protocol_types() const\n    {\n        return typeid(TYPES);\n    }\n};\n\n} \/\/ namespace tlm\n\n#endif \/* __SYSTEMC_EXT_TLM_CORE_2_SOCKETS_INITIATOR_SOCKET_HH__ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ip_ce.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 16:19: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 ARY_IDL_IP_CE_HXX\n#define ARY_IDL_IP_CE_HXX\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n#include <ary\/idl\/i_language.hxx>\n#include <ary\/idl\/i_property.hxx>\n\n\nnamespace ary\n{\n\nclass QualifiedName;\n\nnamespace idl\n{\n    class Module;\n\n    class ConstantsGroup;\n    class Enum;\n    class Exception;\n    class Interface;\n    class Service;\n    class SglIfcService;\n    class Singleton;\n    class SglIfcSingleton;\n    class Struct;\n    class Typedef;\n\n    class Attribute;\n    class Constant;\n    class EnumValue;\n    class Function;\n    class Property;\n    class StructElement;\n    class Variable;\n\n    class NameLookup;\n\n\/** @resp\n    Provides the access logic for all code entities.\n\n    @interface\n*\/\nclass CePilot\n{\n  public:\n    \/\/ LIFECYCLE\n    virtual             ~CePilot() {}\n\n    \/\/ OPERATIONS\n    Module &            CheckIn_Module(\n                            Ce_id               i_nParentId,\n                            const String &      i_sName );\n    Service &           Store_Service(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName );\n    virtual SglIfcService &\n                        Store_SglIfcService(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBaseInterface ) = 0;\n    Interface &         Store_Interface(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase );\n    Struct &            Store_Struct(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase,\n                            const String &      i_sTemplateParam = String::Null_() );\n    Exception &         Store_Exception(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase );\n    Enum &              Store_Enum(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName );\n    Typedef &           Store_Typedef(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nDefiningType );\n    ConstantsGroup &    Store_ConstantsGroup(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName );\n    Singleton &         Store_Singleton(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName );\n    virtual SglIfcSingleton &\n                        Store_SglIfcSingleton(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBaseInterface ) = 0;\n\n    Constant &          Store_Constant(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            const String &      i_sValue );\n    Property &          Store_Property(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            Property::Stereotypes\n                                                i_stereotypes );\n    Function &          Store_Function(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nReturnType,\n                            bool                i_bOneWay );\n    virtual Function &  Store_ServiceConstructor(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    StructElement &     Store_StructMember(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType );\n    StructElement &     Store_ExceptionMember(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType );\n    EnumValue &         Store_EnumValue(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            const String &      i_sValue );\n    Attribute &         Store_Attribute(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            bool                i_bReadOnly,\n                            bool                i_bBound );\n    \/\/ INQUIRY\n    const Module &      GlobalNamespace() const;\n    const CodeEntity &  Find_Ce(\n                            Ce_id               i_nId ) const;\n\n    const Module &      Find_Module(\n                            Ce_id               i_nId ) const;\n    const Module *      Search_Module(\n                            Ce_id               i_nId ) const;\n    const Function &    Find_Function(\n                            Ce_id               i_nId ) const;\n    const Property &    Find_Property(\n                            Ce_id               i_nId ) const;\n    const EnumValue &   Find_EnumValue(\n                            Ce_id               i_nId ) const;\n    const Constant &    Find_Constant(\n                            Ce_id               i_nId ) const;\n    const StructElement &\n                        Find_StructElement(\n                            Ce_id               i_nId ) const;\n    void                Get_Text(\n                            StringVector &      o_module,\n                            String &            o_ce,\n                            String &            o_member,\n                            const CodeEntity &  i_ce ) const;\n    const NameLookup &  NameDictionary() const;\n\n    \/\/ ACCESS\n    Module &            GlobalNamespace();\n    CodeEntity &        Find_Ce(\n                            Ce_id               i_nId );\n\n  private:\n    \/\/ Locals\n    virtual Module &    do_CheckIn_Module(\n                            Ce_id               i_nParentId,\n                            const String &      i_sName ) = 0;\n    virtual Service &   do_Store_Service(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    virtual Interface & do_Store_Interface(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase ) = 0;\n    virtual Struct &    do_Store_Struct(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase,\n                            const String &      i_sTemplateParam ) = 0;\n    virtual Exception & do_Store_Exception(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase ) = 0;\n    virtual Enum &      do_Store_Enum(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    virtual Typedef &   do_Store_Typedef(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nDefiningType ) = 0;\n    virtual ConstantsGroup &\n                        do_Store_ConstantsGroup(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    virtual Singleton & do_Store_Singleton(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n\n    virtual Constant &  do_Store_Constant(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            const String &      i_sValue ) = 0;\n    virtual Property &  do_Store_Property(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            Property::Stereotypes\n                                                i_stereotypes ) = 0;\n    virtual Function &  do_Store_Function(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nReturnType,\n                            bool                i_bOneWay ) = 0;\n    virtual StructElement &\n                        do_Store_StructMember(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType ) = 0;\n    virtual StructElement &\n                        do_Store_ExceptionMember(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType ) = 0;\n    virtual EnumValue & do_Store_EnumValue(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            const String &      i_sValue ) = 0;\n    virtual Attribute & do_Store_Attribute(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            bool                i_bReadOnly,\n                            bool                i_bBound ) = 0;\n\n    virtual const Module &\n                        inq_GlobalNamespace() const = 0;\n    virtual const CodeEntity &\n                        inq_Find_Ce(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Module &\n                        inq_Find_Module(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Module *\n                        inq_Search_Module(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Function &\n                        inq_Find_Function(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Property &\n                        inq_Find_Property(\n                            Ce_id               i_nId ) const = 0;\n    virtual const EnumValue &\n                        inq_Find_EnumValue(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Constant &\n                        inq_Find_Constant(\n                            Ce_id               i_nId ) const = 0;\n    virtual const StructElement &\n                        inq_Find_StructElement(\n                            Ce_id               i_nId ) const = 0;\n    virtual void        inq_Get_Text(\n                            StringVector &      o_module,\n                            String &            o_ce,\n                            String &            o_member,\n                            const CodeEntity &  i_ce ) const = 0;\n    virtual const NameLookup &\n                        inq_NameDictionary() const = 0;\n\n    \/\/ ACCESS\n    virtual Module &    access_GlobalNamespace() = 0;\n    virtual CodeEntity &\n                        access_Find_Ce(\n                            Ce_id               i_nId ) = 0;\n};\n\n\n\/\/ IMPLEMENTATION\n\ninline Module &\nCePilot::CheckIn_Module(    Ce_id               i_nParentId,\n                            const String &      i_sName )\n    { return do_CheckIn_Module(i_nParentId, i_sName); }\n\ninline Service &\nCePilot::Store_Service(     Ce_id               i_nOwner,\n                            const String &      i_sName )\n    { return do_Store_Service(i_nOwner,i_sName); }\n\ninline Interface &\nCePilot::Store_Interface(   Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase )\n    { return do_Store_Interface(i_nOwner,i_sName,i_nBase); }\n\ninline Struct &\nCePilot::Store_Struct(      Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase,\n                            const String &      i_sTemplateParam )\n    { return do_Store_Struct(i_nOwner,i_sName,i_nBase,i_sTemplateParam); }\n\ninline Exception &\nCePilot::Store_Exception(   Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase )\n    { return do_Store_Exception(i_nOwner,i_sName,i_nBase); }\n\ninline Enum &\nCePilot::Store_Enum(        Ce_id               i_nOwner,\n                            const String &      i_sName )\n    { return do_Store_Enum(i_nOwner,i_sName); }\n\ninline Typedef &\nCePilot::Store_Typedef(     Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nDefiningType )\n    { return do_Store_Typedef(i_nOwner,i_sName,i_nDefiningType); }\n\ninline ConstantsGroup &\nCePilot::Store_ConstantsGroup(  Ce_id               i_nOwner,\n                                const String &      i_sName )\n    { return do_Store_ConstantsGroup(i_nOwner,i_sName); }\n\ninline Singleton &\nCePilot::Store_Singleton( Ce_id               i_nOwner,\n                          const String &      i_sName )\n    { return do_Store_Singleton(i_nOwner,i_sName); }\n\ninline Constant &\nCePilot::Store_Constant(    Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            const String &      i_sValue )\n    { return do_Store_Constant(i_nOwner,i_sName,i_nType,i_sValue); }\n\ninline Property &\nCePilot::Store_Property(    Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            ary::idl::Property::Stereotypes\n                                                i_stereotypes )\n    { return do_Store_Property(i_nOwner,i_sName,i_nType,i_stereotypes); }\n\ninline Function &\nCePilot::Store_Function(    Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nReturnType,\n                            bool                i_bOneWay )\n    { return do_Store_Function(i_nOwner,i_sName,i_nReturnType,i_bOneWay); }\n\ninline StructElement &\nCePilot::Store_StructMember(   Ce_id               i_nOwner,\n                               const String &      i_sName,\n                               Type_id             i_nType )\n    { return do_Store_StructMember(i_nOwner,i_sName,i_nType); }\n\ninline StructElement &\nCePilot::Store_ExceptionMember( Ce_id               i_nOwner,\n                                const String &      i_sName,\n                                Type_id             i_nType )\n    { return do_Store_ExceptionMember(i_nOwner,i_sName,i_nType); }\n\ninline EnumValue &\nCePilot::Store_EnumValue(   Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            const String &      i_sValue )\n    { return do_Store_EnumValue(i_nOwner,i_sName,i_sValue); }\n\ninline Attribute &\nCePilot::Store_Attribute( Ce_id               i_nOwner,\n                          const String &      i_sName,\n                          Type_id             i_nType,\n                          bool                i_bReadOnly,\n                          bool                i_bBound )\n    { return do_Store_Attribute(i_nOwner, i_sName, i_nType, i_bReadOnly, i_bBound); }\n\ninline const Module &\nCePilot::GlobalNamespace() const\n    { return inq_GlobalNamespace(); }\ninline const CodeEntity &\nCePilot::Find_Ce( Ce_id i_nId ) const\n    { return inq_Find_Ce(i_nId); }\ninline const Module &\nCePilot::Find_Module( Ce_id i_nId ) const\n    { return inq_Find_Module(i_nId); }\ninline const Module *\nCePilot::Search_Module( Ce_id i_nId ) const\n    { return inq_Search_Module(i_nId); }\ninline const Function &\nCePilot::Find_Function( Ce_id i_nId ) const\n    { return inq_Find_Function(i_nId); }\ninline const Property &\nCePilot::Find_Property( Ce_id i_nId ) const\n    { return inq_Find_Property(i_nId); }\ninline const EnumValue &\nCePilot::Find_EnumValue( Ce_id i_nId ) const\n    { return inq_Find_EnumValue(i_nId); }\ninline const Constant &\nCePilot::Find_Constant( Ce_id i_nId ) const\n    { return inq_Find_Constant(i_nId); }\n\ninline const StructElement &\nCePilot::Find_StructElement( Ce_id i_nId ) const\n    { return inq_Find_StructElement(i_nId); }\ninline void\nCePilot::Get_Text( StringVector &      o_module,\n                   String &            o_ce,\n                   String &            o_member,\n                   const CodeEntity &  i_ce ) const\n    { inq_Get_Text(o_module, o_ce, o_member, i_ce);  }\n\ninline const NameLookup &\nCePilot::NameDictionary() const\n    { return inq_NameDictionary(); }\n\ninline Module &\nCePilot::GlobalNamespace()\n    { return access_GlobalNamespace(); }\ninline CodeEntity &\nCePilot::Find_Ce( Ce_id i_nId )\n    { return access_Find_Ce(i_nId); }\n\n\n}   \/\/ namespace idl\n}   \/\/ namespace ary\n\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS adc18 (1.5.56); FILE MERGED 2007\/10\/18 13:06:37 np 1.5.56.1: #i81775#<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ip_ce.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-02 15:14: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 ARY_IDL_IP_CE_HXX\n#define ARY_IDL_IP_CE_HXX\n\n\/\/ USED SERVICES\n#include <ary\/idl\/i_types4idl.hxx>\n#include <ary\/idl\/i_property.hxx>\n\n\n\n\nnamespace ary\n{\nnamespace idl\n{\n    class Module;\n\n    class ConstantsGroup;\n    class Enum;\n    class Exception;\n    class Interface;\n    class Service;\n    class SglIfcService;\n    class Singleton;\n    class SglIfcSingleton;\n    class Struct;\n    class Typedef;\n\n    class Attribute;\n    class Constant;\n    class EnumValue;\n    class Function;\n    class Property;\n    class StructElement;\n    class Variable;\n\n    class NameLookup;\n\n\n\/** Provides the access logic for all code entities.\n*\/\nclass CePilot\n{\n  public:\n    \/\/ LIFECYCLE\n    virtual             ~CePilot() {}\n\n    \/\/ OPERATIONS\n    virtual Module &    CheckIn_Module(\n                            Ce_id               i_nParentId,\n                            const String &      i_sName ) = 0;\n    virtual Service &   Store_Service(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    virtual SglIfcService &\n                        Store_SglIfcService(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBaseInterface ) = 0;\n    virtual Interface & Store_Interface(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase ) = 0;\n    virtual Struct &    Store_Struct(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase,\n                            const String &      i_sTemplateParam = String::Null_() ) = 0;\n    virtual Exception & Store_Exception(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBase ) = 0;\n    virtual Enum &      Store_Enum(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    virtual Typedef &   Store_Typedef(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nDefiningType ) = 0;\n    virtual ConstantsGroup &\n                        Store_ConstantsGroup(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    virtual Singleton & Store_Singleton(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    virtual SglIfcSingleton &\n                        Store_SglIfcSingleton(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nBaseInterface ) = 0;\n\n    virtual Constant &  Store_Constant(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            const String &      i_sValue ) = 0;\n    virtual Property &  Store_Property(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            Property::Stereotypes\n                                                i_stereotypes ) = 0;\n    virtual Function &  Store_Function(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nReturnType,\n                            bool                i_bOneWay ) = 0;\n    virtual Function &  Store_ServiceConstructor(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName ) = 0;\n    virtual StructElement &\n                        Store_StructMember(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType ) = 0;\n    virtual StructElement &\n                        Store_ExceptionMember(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType ) = 0;\n    virtual EnumValue & Store_EnumValue(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            const String &      i_sValue ) = 0;\n    virtual Attribute & Store_Attribute(\n                            Ce_id               i_nOwner,\n                            const String &      i_sName,\n                            Type_id             i_nType,\n                            bool                i_bReadOnly,\n                            bool                i_bBound ) = 0;\n    \/\/ INQUIRY\n    virtual const Module &\n                        GlobalNamespace() const = 0;\n    virtual const CodeEntity &\n                        Find_Ce(\n                            Ce_id               i_nId ) const = 0;\n\n    virtual const Module &\n                        Find_Module(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Module *\n                        Search_Module(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Function &\n                        Find_Function(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Property &\n                        Find_Property(\n                            Ce_id               i_nId ) const = 0;\n    virtual const EnumValue &\n                        Find_EnumValue(\n                            Ce_id               i_nId ) const = 0;\n    virtual const Constant &\n                        Find_Constant(\n                            Ce_id               i_nId ) const = 0;\n    virtual const StructElement &\n                        Find_StructElement(\n                            Ce_id               i_nId ) const = 0;\n    virtual void        Get_Text(\n                            StringVector &      o_module,\n                            String &            o_ce,\n                            String &            o_member,\n                            const CodeEntity &  i_ce ) const = 0;\n    virtual const NameLookup &\n                        NameDictionary() const = 0;\n    virtual void        Get_AlphabeticalIndex(\n                            std::vector<Ce_id> &\n                                                o_rResult,\n                            alphabetical_index::E_Letter\n                                                i_cLetter) const = 0;\n    \/\/ ACCESS\n    virtual Module &    GlobalNamespace() = 0;\n    virtual CodeEntity &\n                        Find_Ce(\n                            Ce_id               i_nId ) = 0;\n};\n\n\n\n\n}   \/\/ namespace idl\n}   \/\/ namespace ary\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: c_rcode.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: vg $ $Date: 2003-12-17 18:35: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\n#include <precomp.h>\n#include \"c_rcode.hxx\"\n\n\n\/\/ NOT FULLY DECLARED SERVICES\n#include <ary\/cpp\/c_rwgate.hxx>\n#include <ary\/cpp\/c_namesp.hxx>\n\/\/ #include <ary\/cpp\/c_groups.hxx>\n#include <ary\/loc\/l_rwgate.hxx>\n#include \"cpp_pe.hxx\"\n#include <adc_cl.hxx>\n#include <x_parse.hxx>\n#include \"pe_file.hxx\"\n\n#ifdef IRIX\n\/\/ see i19418 incomplete type for cpp::PE_Namespace\n#include \"pe_namsp.hxx\"\n#include \"pe_ignor.hxx\"\n#include \"pe_defs.hxx\"\n#include \"pe_vafu.hxx\"\n#include \"pe_tydef.hxx\"\n#include \"pe_tpltp.hxx\"\n#include \"pe_type.hxx\"\n#include \"pe_vari.hxx\"\n#include \"pe_funct.hxx\"\n#include \"pe_enum.hxx\"\n#include \"pe_param.hxx\"\n#include \"pe_class.hxx\"\n#include \"pe_expression.hxx\"\n#include \"pe_base.hxx\"\n#include \"pe_enum.hxx\"\n#include \"pe_enval.hxx\"\n#endif\n\n\nconst uintt C_nNO_TRY = uintt(-1);\n\n\nnamespace cpp {\n\n\nCodeExplorer::CodeExplorer( ary::cpp::RwGate & io_rAryGate )\n    :   aGlobalParseContext(io_rAryGate),\n        \/\/ aEnvironments,\n        pPE_File(0),\n        pGate(&io_rAryGate),\n        dpCurToken(0)\n{\n    pPE_File = new PE_File( aGlobalParseContext );\n}\n\nCodeExplorer::~CodeExplorer()\n{\n}\n\nvoid\nCodeExplorer::StartNewFile()\n{\n    csv::erase_container(aEnvironments);\n\n    aEnvironments.push_back( pPE_File.MutablePtr() );\n    pPE_File->Enter(push);\n}\n\nvoid\nCodeExplorer::Process_Token( DYN cpp::Token & let_drToken )\n{\nif (DEBUG_ShowTokens())\n{\n    Cout() << let_drToken.Text() << Endl();\n}\n    dpCurToken = &let_drToken;\n    aGlobalParseContext.ResetResult();\n\n    do {\n        CurToken().Trigger( CurEnv() );\n        AcknowledgeResult();\n    } while ( dpCurToken );\n}\n\nvoid\nCodeExplorer::AcknowledgeResult()\n{\n    if (CurResult().eDone == done)\n        dpCurToken = 0;\n\n    switch ( CurResult().eStackAction )\n    {\n        case stay:\n                break;\n        case push:\n                CurEnv().Leave(push);\n                aEnvironments.push_back( &PushEnv() );\n                PushEnv().Enter(push);\n                break;\n        case pop_success:\n                CurEnv().Leave(pop_success);\n                aEnvironments.pop_back();\n                CurEnv().Enter(pop_success);\n                break;\n        case pop_failure:\n        {\n                Cpp_PE * pRecover = 0;\n                do {\n                    CurEnv().Leave(pop_failure);\n                    aEnvironments.pop_back();\n                    if ( aEnvironments.empty() )\n                        break;\n                    pRecover = CurEnv().Handle_ChildFailure();\n                } while ( pRecover == 0 );\n                if ( pRecover != 0 )\n                {\n                    aEnvironments.push_back(pRecover);\n                    pRecover->Enter(push);\n                }\n                else\n                {\n                    throw X_Parser( X_Parser::x_UnexpectedToken, CurToken().Text(), aGlobalParseContext.CurFileName(), aGlobalParseContext.LineCount() );\n                }\n        }       break;\n        default:\n            csv_assert(false);\n    }   \/\/ end switch(CurResult().eStackAction)\n}\n\nary::Cid\nCodeExplorer::CurFile() const\n{\n    \/\/ KORR\n    return 0;\n}\n\nconst Token &\nCodeExplorer::CurToken() const\n{\n    csv_assert(dpCurToken);\n\n    return *dpCurToken;\n}\n\nCpp_PE &\nCodeExplorer::CurEnv() const\n{\n    csv_assert(aEnvironments.size() > 0);\n    csv_assert(aEnvironments.back() != 0);\n\n    return *aEnvironments.back();\n}\n\nCpp_PE &\nCodeExplorer::PushEnv() const\n{\n    TokenProcessing_Result & rCurResult = const_cast< TokenProcessing_Result& >(aGlobalParseContext.CurResult());\n    Cpp_PE * ret = dynamic_cast< Cpp_PE* >(rCurResult.pEnv2Push);\n    csv_assert( ret != 0 );\n    return *ret;\n}\n\n\n\n}   \/\/ namespace cpp\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.50); FILE MERGED 2005\/09\/05 13:11:37 rt 1.2.50.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: c_rcode.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 18:15: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#include <precomp.h>\n#include \"c_rcode.hxx\"\n\n\n\/\/ NOT FULLY DECLARED SERVICES\n#include <ary\/cpp\/c_rwgate.hxx>\n#include <ary\/cpp\/c_namesp.hxx>\n\/\/ #include <ary\/cpp\/c_groups.hxx>\n#include <ary\/loc\/l_rwgate.hxx>\n#include \"cpp_pe.hxx\"\n#include <adc_cl.hxx>\n#include <x_parse.hxx>\n#include \"pe_file.hxx\"\n\n#ifdef IRIX\n\/\/ see i19418 incomplete type for cpp::PE_Namespace\n#include \"pe_namsp.hxx\"\n#include \"pe_ignor.hxx\"\n#include \"pe_defs.hxx\"\n#include \"pe_vafu.hxx\"\n#include \"pe_tydef.hxx\"\n#include \"pe_tpltp.hxx\"\n#include \"pe_type.hxx\"\n#include \"pe_vari.hxx\"\n#include \"pe_funct.hxx\"\n#include \"pe_enum.hxx\"\n#include \"pe_param.hxx\"\n#include \"pe_class.hxx\"\n#include \"pe_expression.hxx\"\n#include \"pe_base.hxx\"\n#include \"pe_enum.hxx\"\n#include \"pe_enval.hxx\"\n#endif\n\n\nconst uintt C_nNO_TRY = uintt(-1);\n\n\nnamespace cpp {\n\n\nCodeExplorer::CodeExplorer( ary::cpp::RwGate & io_rAryGate )\n    :   aGlobalParseContext(io_rAryGate),\n        \/\/ aEnvironments,\n        pPE_File(0),\n        pGate(&io_rAryGate),\n        dpCurToken(0)\n{\n    pPE_File = new PE_File( aGlobalParseContext );\n}\n\nCodeExplorer::~CodeExplorer()\n{\n}\n\nvoid\nCodeExplorer::StartNewFile()\n{\n    csv::erase_container(aEnvironments);\n\n    aEnvironments.push_back( pPE_File.MutablePtr() );\n    pPE_File->Enter(push);\n}\n\nvoid\nCodeExplorer::Process_Token( DYN cpp::Token & let_drToken )\n{\nif (DEBUG_ShowTokens())\n{\n    Cout() << let_drToken.Text() << Endl();\n}\n    dpCurToken = &let_drToken;\n    aGlobalParseContext.ResetResult();\n\n    do {\n        CurToken().Trigger( CurEnv() );\n        AcknowledgeResult();\n    } while ( dpCurToken );\n}\n\nvoid\nCodeExplorer::AcknowledgeResult()\n{\n    if (CurResult().eDone == done)\n        dpCurToken = 0;\n\n    switch ( CurResult().eStackAction )\n    {\n        case stay:\n                break;\n        case push:\n                CurEnv().Leave(push);\n                aEnvironments.push_back( &PushEnv() );\n                PushEnv().Enter(push);\n                break;\n        case pop_success:\n                CurEnv().Leave(pop_success);\n                aEnvironments.pop_back();\n                CurEnv().Enter(pop_success);\n                break;\n        case pop_failure:\n        {\n                Cpp_PE * pRecover = 0;\n                do {\n                    CurEnv().Leave(pop_failure);\n                    aEnvironments.pop_back();\n                    if ( aEnvironments.empty() )\n                        break;\n                    pRecover = CurEnv().Handle_ChildFailure();\n                } while ( pRecover == 0 );\n                if ( pRecover != 0 )\n                {\n                    aEnvironments.push_back(pRecover);\n                    pRecover->Enter(push);\n                }\n                else\n                {\n                    throw X_Parser( X_Parser::x_UnexpectedToken, CurToken().Text(), aGlobalParseContext.CurFileName(), aGlobalParseContext.LineCount() );\n                }\n        }       break;\n        default:\n            csv_assert(false);\n    }   \/\/ end switch(CurResult().eStackAction)\n}\n\nary::Cid\nCodeExplorer::CurFile() const\n{\n    \/\/ KORR\n    return 0;\n}\n\nconst Token &\nCodeExplorer::CurToken() const\n{\n    csv_assert(dpCurToken);\n\n    return *dpCurToken;\n}\n\nCpp_PE &\nCodeExplorer::CurEnv() const\n{\n    csv_assert(aEnvironments.size() > 0);\n    csv_assert(aEnvironments.back() != 0);\n\n    return *aEnvironments.back();\n}\n\nCpp_PE &\nCodeExplorer::PushEnv() const\n{\n    TokenProcessing_Result & rCurResult = const_cast< TokenProcessing_Result& >(aGlobalParseContext.CurResult());\n    Cpp_PE * ret = dynamic_cast< Cpp_PE* >(rCurResult.pEnv2Push);\n    csv_assert( ret != 0 );\n    return *ret;\n}\n\n\n\n}   \/\/ namespace cpp\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file Cosa\/IOStream.cpp\n * @version 1.0\n *\n * @section License\n * Copyright (C) 2012-2014, Mikael Patel\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 * This file is part of the Arduino Che Cosa project.\n *\/\n\n#include \"Cosa\/IOStream.hh\"\n#include \"Cosa\/Power.hh\"\n#include <ctype.h>\n\nIOStream::IOStream(Device* dev) : \n  m_dev(dev),\n  m_base(dec),\n  m_width(6),\n  m_prec(4)\n{}\n\nIOStream::IOStream() : \n  m_dev(NULL),\n  m_base(dec),\n  m_width(6),\n  m_prec(4)\n{}\n\nIOStream::Device* \nIOStream::set_device(Device* dev) \n{ \n  if (dev == NULL) return (m_dev);\n  Device* previous = m_dev;\n  m_dev = dev;\n  return (previous);\n}\n\nvoid \nIOStream::print(int n, Base base) \n{\n  if (base != bcd) {\n    if (base != dec) print_prefix(base);\n    char buf[sizeof(int) * CHARBITS + 1];\n    print(itoa(n, buf, base));\n  }\n  else {\n    print((char) ('0' + ((n >> 4) & 0xf)));\n    print((char) ('0' + (n & 0xf)));\n  }\n}\n\nvoid \nIOStream::print(long int n, Base base)\n{\n  if (base != dec) print_prefix(base);\n  char buf[sizeof(long int) * CHARBITS + 1];\n  print(ltoa(n, buf, base));\n}\n\nvoid \nIOStream::print(unsigned int n, Base base) \n{\n  if (base != dec) print_prefix(base);\n  char buf[sizeof(int) * CHARBITS + 1];\n  print(utoa(n, buf, base));\n}\n\nvoid \nIOStream::print(unsigned long int n, Base base)\n{\n  if (base != dec) print_prefix(base);\n  char buf[sizeof(long int) * CHARBITS + 1];\n  print(ultoa(n, buf, base));\n}\n\nvoid \nIOStream::print(unsigned int n, uint8_t digits, Base base) \n{\n  char buf[sizeof(int) * CHARBITS + 1];\n  utoa(n, buf, base);\n  for (uint8_t length = strlen(buf); length < digits; length++)\n    print('0');\n  print(buf);\n}\n\nvoid \nIOStream::print(unsigned long int n, uint8_t digits, Base base)\n{\n  char buf[sizeof(long int) * CHARBITS + 1];\n  ultoa(n, buf, base);\n  for (uint8_t length = strlen(buf); length < digits; length++)\n    print('0');\n  print(buf);\n}\n\nvoid \nIOStream::print(double value, int8_t width, uint8_t prec)\n{\n  const uint8_t BUF_MAX = 33;\n  char buf[BUF_MAX];\n  dtostrf(value, width, prec, buf);\n  print(buf);\n}\n\nvoid \nIOStream::print(IOStream::Device* buffer)\n{\n  int c;\n  while ((c = buffer->getchar()) != EOF)\n    print((char) c);\n}\n\nvoid \nIOStream::print_prefix(Base base)\n{\n  if (base == hex)\n    print_P(PSTR(\"0x\"));\n  else if (base == bin)\n    print_P(PSTR(\"0b\"));\n  else if (base == oct)\n    print_P(PSTR(\"0\"));\n}\n\nvoid \nIOStream::print(uint32_t src, const void *ptr, size_t size, Base base, uint8_t max)\n{\n  Base b = (base != dec ? hex : dec);\n  uint8_t w = (base == hex ? 2 : (base == bin ? 8 : 3));\n  uint8_t* p = (uint8_t*) ptr;\n  uint8_t n = 0;\n  print(src, 6, b);\n  print_P(PSTR(\": \"));\n  while (size--) {\n    print((unsigned int) *p++, w, base);\n    src += 1;\n    if (++n < max) {\n      print_P(PSTR(\" \"));\n    }\n    else {\n      println();\n      n = 0;\n      if (size > 0) {\n\tprint(src, 6, b);\n\tprint_P(PSTR(\": \"));\n      }\n    }\n  }\n  if (n != 0) println();\n}\n\nvoid \nIOStream::vprintf_P(const char* format, va_list args)\n{\n  const char* s = format;\n  uint8_t is_signed;\n  Base base;\n  char c;\n  while ((c = pgm_read_byte(s++)) != 0) {\n    if (c == '%') {\n      is_signed = 1;\n      base = dec;\n    next:\n      c = pgm_read_byte(s++);\n      if (c == 0) s--;\n      switch (c) {\n      case 'b': \n\tbase = bin; \n\tgoto next;\n      case 'B': \n\tbase = bcd; \n\tgoto next;\n      case 'o': \n\tbase = oct; \n\tgoto next;\n      case 'h':\n      case 'x': \n\tbase = hex; \n\tgoto next;\n      case 'u': \n\tis_signed = 0; \n\tgoto next;\n      case 'c': \n\tprint((char) va_arg(args, int)); \n\tcontinue;\n      case 'p': \n\tprint(va_arg(args, void*)); \n\tcontinue;\n      case 's': \n\tprint(va_arg(args, char*)); \n\tcontinue;\n      case 'S': \n\tprint_P(va_arg(args, const char*)); \n\tcontinue;\n      case 'd': \n\tif (is_signed) \n\t  print(va_arg(args, int), base); \n\telse\n\t  print(va_arg(args, unsigned int), base); \n\tcontinue;\n      case 'l': \n\tif (is_signed) \n\t  print(va_arg(args, long int), base);\n\telse\n\t  print(va_arg(args, unsigned long int), base);\n\tcontinue;\n      };\n    }\n    print(c);\n  }\n}\n\nchar* \nIOStream::scan(char *s, size_t count)\n{\n  if (m_dev == NULL) return (NULL);\n  char* res = s;\n\n  \/\/ Skip whitespace\n  int c = m_dev->peekchar();\n  while (c <= ' ' && c != '\\n') {\n    if (c == EOF) return (NULL);\n    c = m_dev->getchar();\n    c = m_dev->peekchar();\n  }\n  c = m_dev->getchar();\n\n  \/\/ Scan the token; identifier, number or special character\n  count -= 1;\n  *s++ = c;\n  if (isalpha(c)) {\n    while (count--) {\n      c = m_dev->peekchar();\n      if (!isalnum(c)) break;\n      c = m_dev->getchar();\n      *s++ = c;\n    }\n  }\n  else if (isdigit(c) || c == '-') {\n    while (count--) {\n      c = m_dev->peekchar();\n      if (!isdigit(c)) break;\n      c = m_dev->getchar();\n      *s++ = c;\n    }\n  }\n  *s = 0;\n  return (res);\n}\n\nchar*\nIOStream::readline(char* buf, size_t size)\n{\n  if (m_dev == NULL) return (NULL);\n  int count = m_dev->available();\n  if (count <= 0) return (NULL);\n  size_t len = strlen(buf);\n  char* s = buf + len;\n  char c = 0;\n  while (count--) {\n    c = m_dev->getchar();\n    if (c == '\\b' || c == 127) {\n      if (len > 0) {\n\tprint_P(PSTR(\"\\b \\b\"));\n\tlen -= 1;\n\ts -= 1;\n      }\n    }\n    else {\n      print(c);\n      if (c == '\\r') {\n\tif (m_dev->get_eol() == CRLF_MODE) continue;\n\tc = '\\n';\n\tprint(c);\n      }\n      if (len < size) {\n\tlen += 1;\n\t*s++ = c;\n      }\n      if (c == '\\n') break;\n    }\n  }\n  *s = 0;\n  return (c == '\\n' ? buf : NULL);\n}\n\n\/\/ IOStream::Device IOStream::Device::null;\n\nint \nIOStream::Device::available()\n{\n  return (0);\n}\n\nint \nIOStream::Device::room()\n{\n  return (0);\n}\n\nint \nIOStream::Device::putchar(char c) \n{ \n  int res = write(&c, sizeof(c));\n  return (res == sizeof(c) ? c & 0xff : res);\n}\n    \nint \nIOStream::Device::puts(const char* s) \n{ \n  return (write(s, strlen(s)));\n}\n\nint \nIOStream::Device::puts_P(const char* s)\n{ \n  return (write_P(s, strlen_P(s)));\n}\n\nint \nIOStream::Device::write(const void* buf, size_t size) \n{ \n  char* bp = (char*) buf;\n  size_t n = 0;\n  for(; n < size; n++)\n    if (putchar(*bp++) < 0)\n      break;\n  return (n);\n}\n\nint \nIOStream::Device::write_P(const void* buf, size_t size) \n{ \n  char* bp = (char*) buf;\n  size_t n = 0;\n  for(; n < size; n++)\n    if (putchar(pgm_read_byte(bp++)) < 0)\n      break;\n  return (n);\n}\n\nint \nIOStream::Device::write(const iovec_t* vec)\n{\n  size_t size = 0;\n  for (const iovec_t* vp = vec; vp->buf != NULL; vp++) {\n    size_t res = (size_t) write(vp->buf, vp->size);\n    if (res == 0) break;\n    size += res;\n  }\n  return (size);\n}\n\nint \nIOStream::Device::peekchar() \n{ \n  return (EOF); \n}\n\nint \nIOStream::Device::peekchar(char c) \n{ \n  UNUSED(c);\n  return (EOF); \n}\n\nint \nIOStream::Device::getchar() \n{ \n  return (EOF); \n}\n\nchar* \nIOStream::Device::gets(char *s, size_t count) \n{ \n  char* res = s;\n  while (--count) {\n    int c = getchar();\n    if (c == EOF) {\n      if (m_blocking) {\n\twhile (c == EOF) {\n\t  yield();\n\t  c = getchar();\n\t}\n      }\n      else break;\n    }\n    if (c == '\\r') {\n      if (m_eol == CRLF_MODE) continue;\n      c = '\\n';\n    }\n    *s++ = c;\n    if (c == '\\n') break;\n  }\n  *s = 0;\n  return (s == res ? NULL : res);\n}\n\nint \nIOStream::Device::read(void* buf, size_t size) \n{ \n  char* bp = (char*) buf;\n  size_t n = 0; \n  for (; n < size; n++) {\n    int c = getchar();\n    if (c < 0) break;\n    *bp++ = c;\n  }\n  return (n);\n}\n\nint \nIOStream::Device::read(iovec_t* vec) \n{\n  size_t size = 0;\n  for (const iovec_t* vp = vec; vp->buf != NULL; vp++) {\n    size_t res = (size_t) read(vp->buf, vp->size);\n    if (res == 0) break;\n    size += res;\n  }\n  return (size);\n}\n\nint \nIOStream::Device::flush() \n{ \n  return (EOF); \n}\n<commit_msg>Remove ESC to make function key codes visible.<commit_after>\/**\n * @file Cosa\/IOStream.cpp\n * @version 1.0\n *\n * @section License\n * Copyright (C) 2012-2014, Mikael Patel\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 * This file is part of the Arduino Che Cosa project.\n *\/\n\n#include \"Cosa\/IOStream.hh\"\n#include \"Cosa\/Power.hh\"\n#include <ctype.h>\n\nIOStream::IOStream(Device* dev) : \n  m_dev(dev),\n  m_base(dec),\n  m_width(6),\n  m_prec(4)\n{}\n\nIOStream::IOStream() : \n  m_dev(NULL),\n  m_base(dec),\n  m_width(6),\n  m_prec(4)\n{}\n\nIOStream::Device* \nIOStream::set_device(Device* dev) \n{ \n  if (dev == NULL) return (m_dev);\n  Device* previous = m_dev;\n  m_dev = dev;\n  return (previous);\n}\n\nvoid \nIOStream::print(int n, Base base) \n{\n  if (base != bcd) {\n    if (base != dec) print_prefix(base);\n    char buf[sizeof(int) * CHARBITS + 1];\n    print(itoa(n, buf, base));\n  }\n  else {\n    print((char) ('0' + ((n >> 4) & 0xf)));\n    print((char) ('0' + (n & 0xf)));\n  }\n}\n\nvoid \nIOStream::print(long int n, Base base)\n{\n  if (base != dec) print_prefix(base);\n  char buf[sizeof(long int) * CHARBITS + 1];\n  print(ltoa(n, buf, base));\n}\n\nvoid \nIOStream::print(unsigned int n, Base base) \n{\n  if (base != dec) print_prefix(base);\n  char buf[sizeof(int) * CHARBITS + 1];\n  print(utoa(n, buf, base));\n}\n\nvoid \nIOStream::print(unsigned long int n, Base base)\n{\n  if (base != dec) print_prefix(base);\n  char buf[sizeof(long int) * CHARBITS + 1];\n  print(ultoa(n, buf, base));\n}\n\nvoid \nIOStream::print(unsigned int n, uint8_t digits, Base base) \n{\n  char buf[sizeof(int) * CHARBITS + 1];\n  utoa(n, buf, base);\n  for (uint8_t length = strlen(buf); length < digits; length++)\n    print('0');\n  print(buf);\n}\n\nvoid \nIOStream::print(unsigned long int n, uint8_t digits, Base base)\n{\n  char buf[sizeof(long int) * CHARBITS + 1];\n  ultoa(n, buf, base);\n  for (uint8_t length = strlen(buf); length < digits; length++)\n    print('0');\n  print(buf);\n}\n\nvoid \nIOStream::print(double value, int8_t width, uint8_t prec)\n{\n  const uint8_t BUF_MAX = 33;\n  char buf[BUF_MAX];\n  dtostrf(value, width, prec, buf);\n  print(buf);\n}\n\nvoid \nIOStream::print(IOStream::Device* buffer)\n{\n  int c;\n  while ((c = buffer->getchar()) != EOF)\n    print((char) c);\n}\n\nvoid \nIOStream::print_prefix(Base base)\n{\n  if (base == hex)\n    print_P(PSTR(\"0x\"));\n  else if (base == bin)\n    print_P(PSTR(\"0b\"));\n  else if (base == oct)\n    print_P(PSTR(\"0\"));\n}\n\nvoid \nIOStream::print(uint32_t src, const void *ptr, size_t size, Base base, uint8_t max)\n{\n  Base b = (base != dec ? hex : dec);\n  uint8_t w = (base == hex ? 2 : (base == bin ? 8 : 3));\n  uint8_t* p = (uint8_t*) ptr;\n  uint8_t n = 0;\n  print(src, 6, b);\n  print_P(PSTR(\": \"));\n  while (size--) {\n    print((unsigned int) *p++, w, base);\n    src += 1;\n    if (++n < max) {\n      print_P(PSTR(\" \"));\n    }\n    else {\n      println();\n      n = 0;\n      if (size > 0) {\n\tprint(src, 6, b);\n\tprint_P(PSTR(\": \"));\n      }\n    }\n  }\n  if (n != 0) println();\n}\n\nvoid \nIOStream::vprintf_P(const char* format, va_list args)\n{\n  const char* s = format;\n  uint8_t is_signed;\n  Base base;\n  char c;\n  while ((c = pgm_read_byte(s++)) != 0) {\n    if (c == '%') {\n      is_signed = 1;\n      base = dec;\n    next:\n      c = pgm_read_byte(s++);\n      if (c == 0) s--;\n      switch (c) {\n      case 'b': \n\tbase = bin; \n\tgoto next;\n      case 'B': \n\tbase = bcd; \n\tgoto next;\n      case 'o': \n\tbase = oct; \n\tgoto next;\n      case 'h':\n      case 'x': \n\tbase = hex; \n\tgoto next;\n      case 'u': \n\tis_signed = 0; \n\tgoto next;\n      case 'c': \n\tprint((char) va_arg(args, int)); \n\tcontinue;\n      case 'p': \n\tprint(va_arg(args, void*)); \n\tcontinue;\n      case 's': \n\tprint(va_arg(args, char*)); \n\tcontinue;\n      case 'S': \n\tprint_P(va_arg(args, const char*)); \n\tcontinue;\n      case 'd': \n\tif (is_signed) \n\t  print(va_arg(args, int), base); \n\telse\n\t  print(va_arg(args, unsigned int), base); \n\tcontinue;\n      case 'l': \n\tif (is_signed) \n\t  print(va_arg(args, long int), base);\n\telse\n\t  print(va_arg(args, unsigned long int), base);\n\tcontinue;\n      };\n    }\n    print(c);\n  }\n}\n\nchar* \nIOStream::scan(char *s, size_t count)\n{\n  if (m_dev == NULL) return (NULL);\n  char* res = s;\n\n  \/\/ Skip whitespace\n  int c = m_dev->peekchar();\n  while (c <= ' ' && c != '\\n') {\n    if (c == EOF) return (NULL);\n    c = m_dev->getchar();\n    c = m_dev->peekchar();\n  }\n  c = m_dev->getchar();\n\n  \/\/ Scan the token; identifier, number or special character\n  count -= 1;\n  *s++ = c;\n  if (isalpha(c)) {\n    while (count--) {\n      c = m_dev->peekchar();\n      if (!isalnum(c)) break;\n      c = m_dev->getchar();\n      *s++ = c;\n    }\n  }\n  else if (isdigit(c) || c == '-') {\n    while (count--) {\n      c = m_dev->peekchar();\n      if (!isdigit(c)) break;\n      c = m_dev->getchar();\n      *s++ = c;\n    }\n  }\n  *s = 0;\n  return (res);\n}\n\nchar*\nIOStream::readline(char* buf, size_t size)\n{\n  const char DEL = 127;\n  const char ESC = 27;\n  if (m_dev == NULL) return (NULL);\n  int count = m_dev->available();\n  if (count <= 0) return (NULL);\n  size_t len = strlen(buf);\n  char* s = buf + len;\n  char c = 0;\n  while (count--) {\n    c = m_dev->getchar();\n    if (c == ESC) continue;\n    if (c == '\\b' || c == DEL) {\n      if (len > 0) {\n\tprint_P(PSTR(\"\\b \\b\"));\n\tlen -= 1;\n\ts -= 1;\n      }\n    }\n    else {\n      if (c == '\\r') {\n\tprint(c);\n\tif (m_dev->get_eol() == CRLF_MODE) continue;\n\tc = '\\n';\n      }\n      print(c);\n      if (len < size) {\n\tlen += 1;\n\t*s++ = c;\n      }\n      if (c == '\\n') break;\n    }\n  }\n  *s = 0;\n  return (c == '\\n' ? buf : NULL);\n}\n\n\/\/ IOStream::Device IOStream::Device::null;\n\nint \nIOStream::Device::available()\n{\n  return (0);\n}\n\nint \nIOStream::Device::room()\n{\n  return (0);\n}\n\nint \nIOStream::Device::putchar(char c) \n{ \n  int res = write(&c, sizeof(c));\n  return (res == sizeof(c) ? c & 0xff : res);\n}\n    \nint \nIOStream::Device::puts(const char* s) \n{ \n  return (write(s, strlen(s)));\n}\n\nint \nIOStream::Device::puts_P(const char* s)\n{ \n  return (write_P(s, strlen_P(s)));\n}\n\nint \nIOStream::Device::write(const void* buf, size_t size) \n{ \n  char* bp = (char*) buf;\n  size_t n = 0;\n  for(; n < size; n++)\n    if (putchar(*bp++) < 0)\n      break;\n  return (n);\n}\n\nint \nIOStream::Device::write_P(const void* buf, size_t size) \n{ \n  char* bp = (char*) buf;\n  size_t n = 0;\n  for(; n < size; n++)\n    if (putchar(pgm_read_byte(bp++)) < 0)\n      break;\n  return (n);\n}\n\nint \nIOStream::Device::write(const iovec_t* vec)\n{\n  size_t size = 0;\n  for (const iovec_t* vp = vec; vp->buf != NULL; vp++) {\n    size_t res = (size_t) write(vp->buf, vp->size);\n    if (res == 0) break;\n    size += res;\n  }\n  return (size);\n}\n\nint \nIOStream::Device::peekchar() \n{ \n  return (EOF); \n}\n\nint \nIOStream::Device::peekchar(char c) \n{ \n  UNUSED(c);\n  return (EOF); \n}\n\nint \nIOStream::Device::getchar() \n{ \n  return (EOF); \n}\n\nchar* \nIOStream::Device::gets(char *s, size_t count) \n{ \n  char* res = s;\n  while (--count) {\n    int c = getchar();\n    if (c == EOF) {\n      if (m_blocking) {\n\twhile (c == EOF) {\n\t  yield();\n\t  c = getchar();\n\t}\n      }\n      else break;\n    }\n    if (c == '\\r') {\n      if (m_eol == CRLF_MODE) continue;\n      c = '\\n';\n    }\n    *s++ = c;\n    if (c == '\\n') break;\n  }\n  *s = 0;\n  return (s == res ? NULL : res);\n}\n\nint \nIOStream::Device::read(void* buf, size_t size) \n{ \n  char* bp = (char*) buf;\n  size_t n = 0; \n  for (; n < size; n++) {\n    int c = getchar();\n    if (c < 0) break;\n    *bp++ = c;\n  }\n  return (n);\n}\n\nint \nIOStream::Device::read(iovec_t* vec) \n{\n  size_t size = 0;\n  for (const iovec_t* vp = vec; vp->buf != NULL; vp++) {\n    size_t res = (size_t) read(vp->buf, vp->size);\n    if (res == 0) break;\n    size += res;\n  }\n  return (size);\n}\n\nint \nIOStream::Device::flush() \n{ \n  return (EOF); \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: pe_base.hxx,v $\n *\n *  $Revision: 1.1.1.1 $\n *\n *  last change: $Author: np $ $Date: 2002-03-08 14:45: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\n#ifndef ADC_CPP_PE_BASE_HXX\n#define ADC_CPP_PE_BASE_HXX\n\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include \"cpp_pe.hxx\"\n    \/\/ COMPONENTS\n#include <semantic\/callf.hxx>\n#include <semantic\/sub_peu.hxx>\n    \/\/ PARAMETERS\n#include <ary\/cpp\/c_etypes.hxx>\n\/\/ #include <ary\/cpp\/c_class.hxx>\n#include <ary\/cpp\/c_idlist.hxx>\n\n\nnamespace cpp {\n\nclass PE_Type;\n\nclass PE_Base : public Cpp_PE\n{\n  public:\n    enum E_State\n    {\n        startOfNext,\n        inName,\n        size_of_states\n    };\n\n    typedef ary::cpp::List_Bases        BaseList;\n    typedef ary::cpp::S_Classes_Base    Base;\n\n                        PE_Base(\n                            Cpp_PE *            i_pParent );\n                        ~PE_Base();\n\n    const BaseList &    Result_BaseIds() const;\n\n    virtual void        Call_Handler(\n                            const cpp::Token &  i_rTok );\n\n  private:\n    typedef SubPe< PE_Base, PE_Type >           SP_Type;\n    typedef SubPeUse< PE_Base, PE_Type>         SPU_BaseName;\n\n    void                Setup_StatusFunctions();\n    virtual void        InitData();\n    virtual void        TransferData();\n    void                Hdl_SyntaxError( const char *);\n\n    void                SpReturn_BaseName();\n\n    void                On_startOfNext_Identifier(const char *);\n    void                On_startOfNext_public(const char *);\n    void                On_startOfNext_protected(const char *);\n    void                On_startOfNext_private(const char *);\n    void                On_startOfNext_virtual(const char *);\n    void                On_startOfNext_DoubleColon(const char *);\n\n    void                On_inName_Identifier(const char *);\n    void                On_inName_virtual(const char *);\n    void                On_inName_SwBracket_Left(const char *);\n    void                On_inName_DoubleColon(const char *);\n    void                On_inName_Comma(const char *);\n\n    Base &              CurObject();\n\n    \/\/ DATA\n    Dyn< PeStatusArray<PE_Base> >\n                        pStati;\n\n    Dyn<SP_Type>        pSpType;            \/\/\/ till \"{\" incl.\n    Dyn<SPU_BaseName>   pSpuBaseName;\n\n    BaseList            aBaseIds;\n};\n\n\n\n\/\/ IMPLEMENTATION\n\ninline const PE_Base::BaseList &\nPE_Base::Result_BaseIds() const\n    { return aBaseIds; }\n\n\ninline PE_Base::Base &\nPE_Base::CurObject()\n    { return aBaseIds.back(); }\n\n\n}   \/\/ namespace cpp\n\n\n\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.146); FILE MERGED 2005\/09\/05 13:11:43 rt 1.1.1.1.146.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: pe_base.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 18:22:30 $\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#ifndef ADC_CPP_PE_BASE_HXX\n#define ADC_CPP_PE_BASE_HXX\n\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include \"cpp_pe.hxx\"\n    \/\/ COMPONENTS\n#include <semantic\/callf.hxx>\n#include <semantic\/sub_peu.hxx>\n    \/\/ PARAMETERS\n#include <ary\/cpp\/c_etypes.hxx>\n\/\/ #include <ary\/cpp\/c_class.hxx>\n#include <ary\/cpp\/c_idlist.hxx>\n\n\nnamespace cpp {\n\nclass PE_Type;\n\nclass PE_Base : public Cpp_PE\n{\n  public:\n    enum E_State\n    {\n        startOfNext,\n        inName,\n        size_of_states\n    };\n\n    typedef ary::cpp::List_Bases        BaseList;\n    typedef ary::cpp::S_Classes_Base    Base;\n\n                        PE_Base(\n                            Cpp_PE *            i_pParent );\n                        ~PE_Base();\n\n    const BaseList &    Result_BaseIds() const;\n\n    virtual void        Call_Handler(\n                            const cpp::Token &  i_rTok );\n\n  private:\n    typedef SubPe< PE_Base, PE_Type >           SP_Type;\n    typedef SubPeUse< PE_Base, PE_Type>         SPU_BaseName;\n\n    void                Setup_StatusFunctions();\n    virtual void        InitData();\n    virtual void        TransferData();\n    void                Hdl_SyntaxError( const char *);\n\n    void                SpReturn_BaseName();\n\n    void                On_startOfNext_Identifier(const char *);\n    void                On_startOfNext_public(const char *);\n    void                On_startOfNext_protected(const char *);\n    void                On_startOfNext_private(const char *);\n    void                On_startOfNext_virtual(const char *);\n    void                On_startOfNext_DoubleColon(const char *);\n\n    void                On_inName_Identifier(const char *);\n    void                On_inName_virtual(const char *);\n    void                On_inName_SwBracket_Left(const char *);\n    void                On_inName_DoubleColon(const char *);\n    void                On_inName_Comma(const char *);\n\n    Base &              CurObject();\n\n    \/\/ DATA\n    Dyn< PeStatusArray<PE_Base> >\n                        pStati;\n\n    Dyn<SP_Type>        pSpType;            \/\/\/ till \"{\" incl.\n    Dyn<SPU_BaseName>   pSpuBaseName;\n\n    BaseList            aBaseIds;\n};\n\n\n\n\/\/ IMPLEMENTATION\n\ninline const PE_Base::BaseList &\nPE_Base::Result_BaseIds() const\n    { return aBaseIds; }\n\n\ninline PE_Base::Base &\nPE_Base::CurObject()\n    { return aBaseIds.back(); }\n\n\n}   \/\/ namespace cpp\n\n\n\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  StackThunk.c - Allow use second stack for BearSSL calls\n\n  BearSSL uses a significant amount of stack space, much larger than\n  the default Arduino core stack. These routines handle swapping\n  between a secondary, user-allocated stack on the heap and the real\n  stack.\n\n  Copyright (c) 2017 Earle F. Philhower, III. 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  Modified 8 May 2015 by Hristo Gochkov (proper post and file upload handling)\n*\/\n\n#include <stdint.h>\n#include <stdlib.h>\n#include \"StackThunk.h\"\n#include <ets_sys.h>\n\nextern \"C\" {\n\nuint32_t *stack_thunk_ptr = NULL;\nuint32_t *stack_thunk_top = NULL;\nuint32_t *stack_thunk_save = NULL;  \/* Saved A1 while in BearSSL *\/\nuint32_t stack_thunk_refcnt = 0;\n\n\/* Largest stack usage seen in the wild at  6120 *\/\n#define _stackSize (6200\/4)\n#define _stackPaint 0xdeadbeef\n\n\/* Add a reference, and allocate the stack if necessary *\/\nvoid stack_thunk_add_ref()\n{\n  stack_thunk_refcnt++;\n  if (stack_thunk_refcnt == 1) {\n    stack_thunk_ptr = (uint32_t *)malloc(_stackSize * sizeof(uint32_t));\n    stack_thunk_top = stack_thunk_ptr + _stackSize - 1;\n    stack_thunk_save = NULL;\n    stack_thunk_repaint();\n  }\n}\n\n\/* Drop a reference, and free stack if no more in use *\/\nvoid stack_thunk_del_ref()\n{\n  if (stack_thunk_refcnt == 0) {\n    \/* Error! *\/\n    return;\n  }\n  stack_thunk_refcnt--;\n  if (!stack_thunk_refcnt) {\n    free(stack_thunk_ptr);\n    stack_thunk_ptr = NULL;\n    stack_thunk_top = NULL;\n    stack_thunk_save = NULL;\n  }\n}\n\nvoid stack_thunk_repaint()\n{\n  for (int i=0; i < _stackSize; i++) {\n    stack_thunk_ptr[i] = _stackPaint;\n  }\n}\n\n\/* Simple accessor functions used by postmortem *\/\nuint32_t stack_thunk_get_refcnt() {\n  return stack_thunk_refcnt;\n}\n\nuint32_t stack_thunk_get_stack_top() {\n  return (uint32_t)stack_thunk_top;\n}\n\nuint32_t stack_thunk_get_stack_bot() {\n  return (uint32_t)stack_thunk_ptr;\n}\n\nuint32_t stack_thunk_get_cont_sp() {\n  return (uint32_t)stack_thunk_save;\n}\n\n\/* Return the number of bytes ever used since the stack was created *\/\nuint32_t stack_thunk_get_max_usage()\n{\n  uint32_t cnt = 0;\n\n  \/* No stack == no usage by definition! *\/\n  if (!stack_thunk_ptr) {\n    return 0;\n  }\n\n  for (cnt=0; (cnt < _stackSize) && (stack_thunk_ptr[cnt] == _stackPaint); cnt++) {\n    \/* Noop, all work done in for() *\/\n  }\n  return 4 * (_stackSize - cnt);\n}\n\n\/* Print the stack from the first used 16-byte chunk to the top, decodable by the exception decoder *\/\nvoid stack_thunk_dump_stack()\n{\n  uint32_t *pos = stack_thunk_ptr;\n  while (pos < stack_thunk_top) {\n    if ((pos[0] != _stackPaint) || (pos[1] != _stackPaint) || (pos[2] != _stackPaint) || (pos[3] != _stackPaint))\n      break;\n    pos += 4;\n  }\n  ets_printf(\">>>stack>>>\\n\");\n  while (pos < stack_thunk_top) {\n    ets_printf(\"%08x:  %08x %08x %08x %08x\\n\", (int32_t)pos, pos[0], pos[1], pos[2], pos[3]);\n    pos += 4;\n  }\n  ets_printf(\"<<<stack<<<\\n\");\n}\n\n\/* Called when the stack overflow is detected by a thunk.  Main memory is corrupted at this point.  Do not return. *\/\nvoid stack_thunk_fatal_overflow()\n{\n    ets_printf(\"FATAL ERROR: BSSL stack overflow\\n\");\n    abort();\n}\n\n};\n<commit_msg>Abort if BearSSL stack allocation fails (#7152)<commit_after>\/*\n  StackThunk.c - Allow use second stack for BearSSL calls\n\n  BearSSL uses a significant amount of stack space, much larger than\n  the default Arduino core stack. These routines handle swapping\n  between a secondary, user-allocated stack on the heap and the real\n  stack.\n\n  Copyright (c) 2017 Earle F. Philhower, III. 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  Modified 8 May 2015 by Hristo Gochkov (proper post and file upload handling)\n*\/\n\n#include <stdint.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include \"pgmspace.h\"\n#include \"debug.h\"\n#include \"StackThunk.h\"\n#include <ets_sys.h>\n\nextern \"C\" {\n\nuint32_t *stack_thunk_ptr = NULL;\nuint32_t *stack_thunk_top = NULL;\nuint32_t *stack_thunk_save = NULL;  \/* Saved A1 while in BearSSL *\/\nuint32_t stack_thunk_refcnt = 0;\n\n\/* Largest stack usage seen in the wild at  6120 *\/\n#define _stackSize (6200\/4)\n#define _stackPaint 0xdeadbeef\n\n\/* Add a reference, and allocate the stack if necessary *\/\nvoid stack_thunk_add_ref()\n{\n  stack_thunk_refcnt++;\n  if (stack_thunk_refcnt == 1) {\n    stack_thunk_ptr = (uint32_t *)malloc(_stackSize * sizeof(uint32_t));\n    if (!stack_thunk_ptr) {\n        \/\/ This is a fatal error, stop the sketch\n        DEBUGV(\"Unable to allocate BearSSL stack\\n\");\n        abort();\n    }\n    stack_thunk_top = stack_thunk_ptr + _stackSize - 1;\n    stack_thunk_save = NULL;\n    stack_thunk_repaint();\n  }\n}\n\n\/* Drop a reference, and free stack if no more in use *\/\nvoid stack_thunk_del_ref()\n{\n  if (stack_thunk_refcnt == 0) {\n    \/* Error! *\/\n    return;\n  }\n  stack_thunk_refcnt--;\n  if (!stack_thunk_refcnt) {\n    free(stack_thunk_ptr);\n    stack_thunk_ptr = NULL;\n    stack_thunk_top = NULL;\n    stack_thunk_save = NULL;\n  }\n}\n\nvoid stack_thunk_repaint()\n{\n  for (int i=0; i < _stackSize; i++) {\n    stack_thunk_ptr[i] = _stackPaint;\n  }\n}\n\n\/* Simple accessor functions used by postmortem *\/\nuint32_t stack_thunk_get_refcnt() {\n  return stack_thunk_refcnt;\n}\n\nuint32_t stack_thunk_get_stack_top() {\n  return (uint32_t)stack_thunk_top;\n}\n\nuint32_t stack_thunk_get_stack_bot() {\n  return (uint32_t)stack_thunk_ptr;\n}\n\nuint32_t stack_thunk_get_cont_sp() {\n  return (uint32_t)stack_thunk_save;\n}\n\n\/* Return the number of bytes ever used since the stack was created *\/\nuint32_t stack_thunk_get_max_usage()\n{\n  uint32_t cnt = 0;\n\n  \/* No stack == no usage by definition! *\/\n  if (!stack_thunk_ptr) {\n    return 0;\n  }\n\n  for (cnt=0; (cnt < _stackSize) && (stack_thunk_ptr[cnt] == _stackPaint); cnt++) {\n    \/* Noop, all work done in for() *\/\n  }\n  return 4 * (_stackSize - cnt);\n}\n\n\/* Print the stack from the first used 16-byte chunk to the top, decodable by the exception decoder *\/\nvoid stack_thunk_dump_stack()\n{\n  uint32_t *pos = stack_thunk_ptr;\n  while (pos < stack_thunk_top) {\n    if ((pos[0] != _stackPaint) || (pos[1] != _stackPaint) || (pos[2] != _stackPaint) || (pos[3] != _stackPaint))\n      break;\n    pos += 4;\n  }\n  ets_printf(\">>>stack>>>\\n\");\n  while (pos < stack_thunk_top) {\n    ets_printf(\"%08x:  %08x %08x %08x %08x\\n\", (int32_t)pos, pos[0], pos[1], pos[2], pos[3]);\n    pos += 4;\n  }\n  ets_printf(\"<<<stack<<<\\n\");\n}\n\n\/* Called when the stack overflow is detected by a thunk.  Main memory is corrupted at this point.  Do not return. *\/\nvoid stack_thunk_fatal_overflow()\n{\n    ets_printf(\"FATAL ERROR: BSSL stack overflow\\n\");\n    abort();\n}\n\n};\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file    Elasticsearch.cc\n *  \\brief   Implementation of the Elasticsearch class.\n *  \\author  Dr. Johannes Ruscheinski\n *  \\author  Mario Trojan\n *\n *  \\copyright 2018,2019 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 \"Elasticsearch.h\"\n#include \"FileUtil.h\"\n#include \"IniFile.h\"\n#include \"UBTools.h\"\n#include \"Url.h\"\n\n\nconst std::string DEFAULT_CONFIG_FILE_PATH(UBTools::GetTuelibPath() + \"Elasticsearch.conf\");\n\n\nstatic void LoadIniParameters(const std::string &config_file_path, std::string * const host, std::string * const username,\n                              std::string * const password, bool * const ignore_ssl_certificates)\n{\n    if (not FileUtil::Exists(config_file_path))\n        LOG_ERROR(\"Elasticsearch config file missing: \" + config_file_path);\n\n    const IniFile ini_file(config_file_path);\n\n    *host                    = ini_file.getString(\"Elasticsearch\", \"host\");\n    *username                = ini_file.getString(\"Elasticsearch\", \"username\", \"\");\n    *password                = ini_file.getString(\"Elasticsearch\", \"password\", \"\");\n    *ignore_ssl_certificates = ini_file.getBool(\"Elasticsearch\", \"ignore_ssl_certificates\", false);\n}\n\n\nElasticsearch::Elasticsearch(const std::string &index, const std::string &type): index_(index), type_(type) {\n    LoadIniParameters(DEFAULT_CONFIG_FILE_PATH, &host_, &username_, &password_, &ignore_ssl_certificates_);\n}\n\n\nsize_t Elasticsearch::size() const {\n    return JSON::LookupInteger(\"\/_all\/primaries\/docs\/count\", query(\"_stats\", REST::GET, JSON::ObjectNode()));\n}\n\n\nvoid Elasticsearch::simpleInsert(const std::map<std::string, std::string> &fields_and_values) {\n    query(\"\", REST::POST, JSON::ObjectNode(fields_and_values));\n}\n\n\n\/\/ A general comment as to the strategy we use in this function:\n\/\/\n\/\/    We know that there is an _update API endpoint, but as we insert a bunch of chunks, the number of which can change,\n\/\/    we have to use a \"wildcard\" strategy to first delete possibly existing chunks as the number of new chunks may be greater or\n\/\/    fewer than what may already be stored.\nvoid Elasticsearch::insertOrUpdateDocument(const std::string &document_id, const std::string &document) {\n    deleteDocument(document_id);\n    simpleInsert({ { \"id\", document_id }, { \"document\", document } });\n}\n\n\nbool Elasticsearch::deleteDocument(const std::string &document_id) {\n    const JSON::ObjectNode match_node(\"{ \\\"query\\\":\"\n                                      \"    { \\\"match\\\":\"\n                                      \"        { \\\"id\\\": \\\"\" + JSON::EscapeString(document_id) + \"\\\" }\"\n                                      \"    }\"\n                                      \"}\");\n    const auto result_node(query(\"_delete_by_query\", REST::POST, match_node));\n    return result_node->getIntegerNode(\"deleted\")->getValue() > 0;\n}\n\n\nstd::unordered_set<std::string> Elasticsearch::selectAll(const std::string &field) const {\n    const std::vector<std::map<std::string, std::string>> result(simpleSelect({ field }));\n    std::unordered_set<std::string> unique_values;\n    for (const auto &map : result) {\n        const auto key_and_value(map.find(field));\n        if (key_and_value != map.cend())\n            unique_values.emplace(key_and_value->second);\n    }\n\n    return unique_values;\n}\n\n\nstd::vector<std::map<std::string, std::string>> Elasticsearch::simpleSelect(const std::set<std::string> &fields,\n                                                                            const std::map<std::string, std::string> &filter,\n                                                                            const int max_count) const\n{\n    std::string query_string(\"{\\n\");\n\n    if (not fields.empty()) {\n        query_string += \"    \\\"_source\\\": [\";\n        for (const auto &field : fields)\n            query_string += \"\\\"\" + field + \"\\\", \";\n        query_string.resize(query_string.size() - 2); \/\/ Remove trailing comma and space.\n        query_string += \"],\\n\";\n    }\n\n    query_string += \"    \\\"query\\\": {\";\n\n    if (filter.empty())\n        query_string += \" \\\"match_all\\\" {}\";\n    else {\n        query_string += \"\\\"bool\\\" : { \\\"filter\\\": [\\n\";\n        for (const auto &field_and_value : filter)\n            query_string += \"       { \\\"term\\\": { \\\"\" + field_and_value.first + \"\\\": \\\"\" + field_and_value.second + \"\\\"} },\\n\";\n        query_string.resize(query_string.size() - 2); \/\/ Remove the last comma and newline.\n        query_string += \"\\n    ] }\";\n    }\n\n    query_string += \"    },\\n\";\n    query_string += \"    \\\"size\\\": \" + std::to_string(max_count) + \"\\n\";\n    query_string += \"}\\n\";\n\n    const auto result_node(query(\"_search\", REST::POST, JSON::ObjectNode(query_string)));\n    const auto hits_object_node(result_node->getObjectNode(\"hits\"));\n    if (unlikely(hits_object_node == nullptr))\n        LOG_ERROR(\"missing \\\"hits\\\" object node in Elasticsearch result node!\");\n    const auto hits_array_node(hits_object_node->getArrayNode(\"hits\"));\n    if (unlikely(hits_array_node == nullptr))\n        LOG_ERROR(\"missing \\\"hits\\\" array node in Elasticsearch result node!\");\n\n    std::vector<std::map<std::string, std::string>> search_results;\n    search_results.reserve(hits_array_node->size());\n    for (const auto entry_node : *hits_array_node) {\n        std::map<std::string, std::string> new_map;\n        const auto entry_object_node(JSON::JSONNode::CastToObjectNodeOrDie(\"entry_object_node\", entry_node));\n        for (const auto &entry : *entry_object_node) {\n            if (fields.empty() or fields.find(entry.first) != fields.cend())\n                new_map[entry.first] = JSON::JSONNode::CastToStringNodeOrDie(\"new_map[entry.first]\", entry.second)->getValue();\n        }\n\n        search_results.resize(search_results.size() + 1);\n        std::swap(search_results.back(), new_map);\n    }\n\n    return search_results;\n}\n\n\nstatic std::string ToString(const Elasticsearch::RangeOperator op) {\n    switch (op) {\n    case Elasticsearch::RO_GT:  return \"gt\";\n    case Elasticsearch::RO_GTE: return \"gte\";\n    case Elasticsearch::RO_LT:  return \"lt\";\n    case Elasticsearch::RO_LTE: return \"lte\";\n    default:\n        LOG_ERROR(\"we should *never* get here!\");\n    }\n}\n\n\nbool Elasticsearch::deleteRange(const std::string &field, const RangeOperator operator1, const std::string &operand1,\n                                const RangeOperator operator2, const std::string &operand2)\n{\n    const std::string range_node((operator2 == RO_NOOP or operand2.empty()) ?\n                                    \"{ \\\"query\\\":\"\n                                    \"    { \\\"range\\\":\"\n                                    \"        \\\"\" + field + \"\\\": {\"\n                                    \"            \\\"\" + ToString(operator1) + \"\\\"\" + operand1 + \"\\\"\"\n                                        + ((operator2 == RO_NOOP or operand2.empty())\n                                               ? std::string()\n                                               : \"      ,\\\"\" + ToString(operator2) + \"\\\"\" + operand2 + \"\\\"\") +\n                                    \"        }\"\n                                    \"    }\"\n                                    \"}\"\n                                                                            :\n                                    \"\");\n    const auto result_node(query(\"_delete\", REST::POST, range_node));\n    return result_node->getIntegerNode(\"deleted\")->getValue() > 0;\n}\n\n\nbool Elasticsearch::fieldWithValueExists(const std::string &field, const std::string &value) {\n\n   const auto result_node(\n         query(\"_search\", REST::POST,\n              \"{\"\n              \"    \\\"query\\\": {\"\n              \"        \\\"match\\\" : { \\\"\" + field + \"\\\" : \\\"\" + value + \"\\\" }\"\n              \"    }\"\n              \"}\"\n         ));\n\n   const auto hits_node(result_node->getObjectNode(\"hits\"));\n   if (hits_node == nullptr)\n       LOG_ERROR(\"No \\\"hits\\\" node in results\");\n\n   const auto total_node = hits_node->getIntegerNode(\"total\");\n   if (total_node == nullptr)\n       LOG_ERROR(\"No \\\"total\\\" node found\");\n   return total_node->getValue() == 0 ? false : true;\n}\n\n\nstd::shared_ptr<JSON::ObjectNode> Elasticsearch::query(const std::string &action, const REST::QueryType query_type,\n                                                       const JSON::ObjectNode &data) const\n{\n    Downloader::Params downloader_params;\n    downloader_params.authentication_username_ = username_;\n    downloader_params.authentication_password_ = password_;\n    downloader_params.ignore_ssl_certificates_ = ignore_ssl_certificates_;\n    downloader_params.additional_headers_.push_back(\"Content-Type: application\/json\");\n    const Url url(host_ + \"\/\" + index_ + \"\/\" + type_ + (action.empty() ? \"\" : \"\/\" + action));\n    std::shared_ptr<JSON::JSONNode> result(REST::QueryJSON(url, query_type, &data, downloader_params));\n    std::shared_ptr<JSON::ObjectNode> result_object(JSON::JSONNode::CastToObjectNodeOrDie(\"Elasticsearch result\", result));\n    if (result_object->hasNode(\"error\"))\n        LOG_ERROR(\"Elasticsearch \" + action + \" query failed: \" + result_object->getNode(\"error\")->toString());\n\n    return result_object;\n}\n<commit_msg>Flatten _source field<commit_after>\/** \\file    Elasticsearch.cc\n *  \\brief   Implementation of the Elasticsearch class.\n *  \\author  Dr. Johannes Ruscheinski\n *  \\author  Mario Trojan\n *\n *  \\copyright 2018,2019 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 \"Elasticsearch.h\"\n#include \"FileUtil.h\"\n#include \"IniFile.h\"\n#include \"UBTools.h\"\n#include \"Url.h\"\n\n\nconst std::string DEFAULT_CONFIG_FILE_PATH(UBTools::GetTuelibPath() + \"Elasticsearch.conf\");\n\n\nstatic void LoadIniParameters(const std::string &config_file_path, std::string * const host, std::string * const username,\n                              std::string * const password, bool * const ignore_ssl_certificates)\n{\n    if (not FileUtil::Exists(config_file_path))\n        LOG_ERROR(\"Elasticsearch config file missing: \" + config_file_path);\n\n    const IniFile ini_file(config_file_path);\n\n    *host                    = ini_file.getString(\"Elasticsearch\", \"host\");\n    *username                = ini_file.getString(\"Elasticsearch\", \"username\", \"\");\n    *password                = ini_file.getString(\"Elasticsearch\", \"password\", \"\");\n    *ignore_ssl_certificates = ini_file.getBool(\"Elasticsearch\", \"ignore_ssl_certificates\", false);\n}\n\n\nElasticsearch::Elasticsearch(const std::string &index, const std::string &type): index_(index), type_(type) {\n    LoadIniParameters(DEFAULT_CONFIG_FILE_PATH, &host_, &username_, &password_, &ignore_ssl_certificates_);\n}\n\n\nsize_t Elasticsearch::size() const {\n    return JSON::LookupInteger(\"\/_all\/primaries\/docs\/count\", query(\"_stats\", REST::GET, JSON::ObjectNode()));\n}\n\n\nvoid Elasticsearch::simpleInsert(const std::map<std::string, std::string> &fields_and_values) {\n    query(\"\", REST::POST, JSON::ObjectNode(fields_and_values));\n}\n\n\n\/\/ A general comment as to the strategy we use in this function:\n\/\/\n\/\/    We know that there is an _update API endpoint, but as we insert a bunch of chunks, the number of which can change,\n\/\/    we have to use a \"wildcard\" strategy to first delete possibly existing chunks as the number of new chunks may be greater or\n\/\/    fewer than what may already be stored.\nvoid Elasticsearch::insertOrUpdateDocument(const std::string &document_id, const std::string &document) {\n    deleteDocument(document_id);\n    simpleInsert({ { \"id\", document_id }, { \"document\", document } });\n}\n\n\nbool Elasticsearch::deleteDocument(const std::string &document_id) {\n    const JSON::ObjectNode match_node(\"{ \\\"query\\\":\"\n                                      \"    { \\\"match\\\":\"\n                                      \"        { \\\"id\\\": \\\"\" + JSON::EscapeString(document_id) + \"\\\" }\"\n                                      \"    }\"\n                                      \"}\");\n    const auto result_node(query(\"_delete_by_query\", REST::POST, match_node));\n    return result_node->getIntegerNode(\"deleted\")->getValue() > 0;\n}\n\n\nstd::unordered_set<std::string> Elasticsearch::selectAll(const std::string &field) const {\n    const std::vector<std::map<std::string, std::string>> result(simpleSelect({ field }));\n    std::unordered_set<std::string> unique_values;\n    for (const auto &map : result) {\n        const auto key_and_value(map.find(field));\n        if (key_and_value != map.cend())\n            unique_values.emplace(key_and_value->second);\n    }\n\n    return unique_values;\n}\n\n\nstd::vector<std::map<std::string, std::string>> Elasticsearch::simpleSelect(const std::set<std::string> &fields,\n                                                                            const std::map<std::string, std::string> &filter,\n                                                                            const int max_count) const\n{\n    std::string query_string(\"{\\n\");\n\n    if (not fields.empty()) {\n        query_string += \"    \\\"_source\\\": [\";\n        for (const auto &field : fields)\n            query_string += \"\\\"\" + field + \"\\\", \";\n        query_string.resize(query_string.size() - 2); \/\/ Remove trailing comma and space.\n        query_string += \"],\\n\";\n    }\n\n    query_string += \"    \\\"query\\\": {\";\n\n    if (filter.empty())\n        query_string += \" \\\"match_all\\\" {}\";\n    else {\n        query_string += \"\\\"bool\\\" : { \\\"filter\\\": [\\n\";\n        for (const auto &field_and_value : filter)\n            query_string += \"       { \\\"term\\\": { \\\"\" + field_and_value.first + \"\\\": \\\"\" + field_and_value.second + \"\\\"} },\\n\";\n        query_string.resize(query_string.size() - 2); \/\/ Remove the last comma and newline.\n        query_string += \"\\n    ] }\";\n    }\n\n    query_string += \"    },\\n\";\n    query_string += \"    \\\"size\\\": \" + std::to_string(max_count) + \"\\n\";\n    query_string += \"}\\n\";\n\n    const auto result_node(query(\"_search\", REST::POST, JSON::ObjectNode(query_string)));\n    const auto hits_object_node(result_node->getObjectNode(\"hits\"));\n    if (unlikely(hits_object_node == nullptr))\n        LOG_ERROR(\"missing \\\"hits\\\" object node in Elasticsearch result node!\");\n    const auto hits_array_node(hits_object_node->getArrayNode(\"hits\"));\n    if (unlikely(hits_array_node == nullptr))\n        LOG_ERROR(\"missing \\\"hits\\\" array node in Elasticsearch result node!\");\n\n    std::vector<std::map<std::string, std::string>> search_results;\n    search_results.reserve(hits_array_node->size());\n    for (const auto entry_node : *hits_array_node) {\n        std::map<std::string, std::string> new_map;\n        const auto entry_object_node(JSON::JSONNode::CastToObjectNodeOrDie(\"entry_object_node\", entry_node));\n        for (const auto &entry : *entry_object_node) {\n            if (fields.empty() or fields.find(entry.first) != fields.cend() or entry.first == \"_source\") {\n                \/\/ Copy existing fields but flatten the contents of _source\n                if (entry.first == \"_source\") {\n                    const auto source_object_node(JSON::JSONNode::CastToObjectNodeOrDie(\"source_object_node\", entry.second));\n                    for (const auto source_entry : *source_object_node)\n                         new_map[source_entry.first] = JSON::JSONNode::CastToStringNodeOrDie(\"new_map[source_entry.first]\",\n                                                                                             source_entry.second)->getValue();\n                } else\n                    new_map[entry.first] = JSON::JSONNode::CastToStringNodeOrDie(\"new_map[entry.first]\", entry.second)->getValue();\n            }\n        }\n\n        search_results.resize(search_results.size() + 1);\n        std::swap(search_results.back(), new_map);\n    }\n\n    return search_results;\n}\n\n\nstatic std::string ToString(const Elasticsearch::RangeOperator op) {\n    switch (op) {\n    case Elasticsearch::RO_GT:  return \"gt\";\n    case Elasticsearch::RO_GTE: return \"gte\";\n    case Elasticsearch::RO_LT:  return \"lt\";\n    case Elasticsearch::RO_LTE: return \"lte\";\n    default:\n        LOG_ERROR(\"we should *never* get here!\");\n    }\n}\n\n\nbool Elasticsearch::deleteRange(const std::string &field, const RangeOperator operator1, const std::string &operand1,\n                                const RangeOperator operator2, const std::string &operand2)\n{\n    const std::string range_node((operator2 == RO_NOOP or operand2.empty()) ?\n                                    \"{ \\\"query\\\":\"\n                                    \"    { \\\"range\\\":\"\n                                    \"        \\\"\" + field + \"\\\": {\"\n                                    \"            \\\"\" + ToString(operator1) + \"\\\"\" + operand1 + \"\\\"\"\n                                        + ((operator2 == RO_NOOP or operand2.empty())\n                                               ? std::string()\n                                               : \"      ,\\\"\" + ToString(operator2) + \"\\\"\" + operand2 + \"\\\"\") +\n                                    \"        }\"\n                                    \"    }\"\n                                    \"}\"\n                                                                            :\n                                    \"\");\n    const auto result_node(query(\"_delete\", REST::POST, range_node));\n    return result_node->getIntegerNode(\"deleted\")->getValue() > 0;\n}\n\n\nbool Elasticsearch::fieldWithValueExists(const std::string &field, const std::string &value) {\n\n   const auto result_node(\n         query(\"_search\", REST::POST,\n              \"{\"\n              \"    \\\"query\\\": {\"\n              \"        \\\"match\\\" : { \\\"\" + field + \"\\\" : \\\"\" + value + \"\\\" }\"\n              \"    }\"\n              \"}\"\n         ));\n\n   const auto hits_node(result_node->getObjectNode(\"hits\"));\n   if (hits_node == nullptr)\n       LOG_ERROR(\"No \\\"hits\\\" node in results\");\n\n   const auto total_node = hits_node->getIntegerNode(\"total\");\n   if (total_node == nullptr)\n       LOG_ERROR(\"No \\\"total\\\" node found\");\n   return total_node->getValue() == 0 ? false : true;\n}\n\n\nstd::shared_ptr<JSON::ObjectNode> Elasticsearch::query(const std::string &action, const REST::QueryType query_type,\n                                                       const JSON::ObjectNode &data) const\n{\n    Downloader::Params downloader_params;\n    downloader_params.authentication_username_ = username_;\n    downloader_params.authentication_password_ = password_;\n    downloader_params.ignore_ssl_certificates_ = ignore_ssl_certificates_;\n    downloader_params.additional_headers_.push_back(\"Content-Type: application\/json\");\n    const Url url(host_ + \"\/\" + index_ + \"\/\" + type_ + (action.empty() ? \"\" : \"\/\" + action));\n    std::shared_ptr<JSON::JSONNode> result(REST::QueryJSON(url, query_type, &data, downloader_params));\n    std::shared_ptr<JSON::ObjectNode> result_object(JSON::JSONNode::CastToObjectNodeOrDie(\"Elasticsearch result\", result));\n    if (result_object->hasNode(\"error\"))\n        LOG_ERROR(\"Elasticsearch \" + action + \" query failed: \" + result_object->getNode(\"error\")->toString());\n\n    return result_object;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"node.hpp\"\n#include \"frequency_map.hpp\"\n#include <map>\n#include <fstream>\n#include <queue>\n#include <functional>\n#include <string>\n\n\n#ifndef HUFFMAN_TREE_HPP\n#define HUFFMAN_TREE_HPP\n\n\nnamespace cpr\n{\n\tnamespace huffman\n\t{\n\t\ttemplate<typename Char, typename Freq>\n\t\tclass HuffmanTree\n\t\t{\n\t\tpublic:\n\t\t\tusing SharedNode = typename Node<Char, Freq>::SharedNode;\n\t\t\t\n\t\t\texplicit HuffmanTree(FrequencyMap<Char, Freq> const& map)\n\t\t\t\t: root{make_tree(map)}\n\t\t\t{}\n\n\t\t\tstd::string to_string() const\n\t\t\t{\n\t\t\t\tstd::string str;\n\t\t\t\tstd::function<void(SharedNode)> inorder = [&](SharedNode node)\n\t\t\t\t{\n\t\t\t\t\tif (node)\n\t\t\t\t\t{\n\t\t\t\t\t\tinorder(node->left_);\n\n\t\t\t\t\t\tstr.push_back('[');\n\t\t\t\t\t\tstr.push_back(node->character_ == 0 ? '_' : node->character_);\n\t\t\t\t\t\tstr.push_back(',');\n\t\t\t\t\t\tstr += std::to_string(node->freq_);\n\t\t\t\t\t\tstr.push_back(']');\n\t\t\t\t\t\t\n\t\t\t\t\t\tinorder(node->right_);\n\t\t\t\t\t}\n\t\t\t\t};\n\n\t\t\t\tinorder(root);\n\t\t\t\treturn str;\n\t\t\t}\n\n\t\t\tconst SharedNode root;\n\n\t\tprivate:\n\t\t\t\/\/ huffman coding algorithm \n\t\t\t\/\/ based on a pseudocode on 16.3 CLRS 3rd.\n\t\t\tSharedNode make_tree(FrequencyMap<Char, Freq> const& map) const\n\t\t\t{\n\t\t\t\t\tauto greater = [](SharedNode lhs, SharedNode rhs)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (lhs->freq_ != rhs->freq_)\n\t\t\t\t\t\t\treturn lhs->freq_ > rhs->freq_;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\treturn lhs->character_ > rhs->character_;\n\t\t\t\t\t};\n\n\n\t\t\t\t\tusing MinPriorityQueue = std::priority_queue < SharedNode, std::vector<SharedNode>, decltype(greater) > ;\n\n\t\t\t\t\tMinPriorityQueue queue(greater);\n\t\t\t\t\tfor (auto const& pair : map)\n\t\t\t\t\t\tqueue.push(make_new_node(pair.first, pair.second));\n\t\t\t\t\t\n\t\t\t\t\tfor (int count = 1; count != map.size(); ++count)\n\t\t\t\t\t{\n\t\t\t\t\t\tauto merge = make_new_node<Char, Freq>();\n\t\t\t\t\t\tmerge->left_ = make_new_node(*queue.top());\n\t\t\t\t\t\tqueue.pop();\n\t\t\t\t\t\tmerge->right_ = make_new_node(*queue.top());\n\t\t\t\t\t\tqueue.pop();\n\t\t\t\t\t\tmerge->freq_ = merge->left_->freq_ + merge->right_->freq_;\n\t\t\t\t\t\tqueue.push(merge);\n\t\t\t\t\t}\n\n\t\t\t\t\treturn queue.top();\n\t\t\t}\n\t\t};\n\t}\n}\n\n#endif \/\/ !HUFFMAN_TREE_HPP<commit_msg>fixed #8 \tmodified:   cpr\/huffman\/huffman_tree.hpp<commit_after>#include \"node.hpp\"\n#include \"frequency_map.hpp\"\n#include <map>\n#include <fstream>\n#include <queue>\n#include <functional>\n#include <string>\n\n\n#ifndef HUFFMAN_TREE_HPP\n#define HUFFMAN_TREE_HPP\n\n\nnamespace cpr\n{\n\tnamespace huffman\n\t{\n\t\ttemplate<typename Char, typename Freq>\n\t\tclass HuffmanTree\n\t\t{\n\t\tpublic:\n\t\t\tusing SharedNode = typename Node<Char, Freq>::SharedNode;\n\t\t\t\n\t\t\texplicit HuffmanTree(FrequencyMap<Char, Freq> const& map)\n\t\t\t\t: root{make_tree(map)}\n\t\t\t{}\n\n\t\t\tstd::string to_string() const\n\t\t\t{\n\t\t\t\tstd::string str;\n\t\t\t\tstd::function<void(SharedNode)> inorder = [&](SharedNode node)\n\t\t\t\t{\n\t\t\t\t\tif (node)\n\t\t\t\t\t{\n\t\t\t\t\t\tinorder(node->left_);\n\n\t\t\t\t\t\tstr.push_back('[');\n\t\t\t\t\t\tstr.push_back(node->character_ == 0 ? '_' : node->character_);\n\t\t\t\t\t\tstr.push_back(',');\n\t\t\t\t\t\tstr += std::to_string(node->freq_);\n\t\t\t\t\t\tstr.push_back(']');\n\t\t\t\t\t\t\n\t\t\t\t\t\tinorder(node->right_);\n\t\t\t\t\t}\n\t\t\t\t};\n\n\t\t\t\tinorder(root);\n\t\t\t\treturn str;\n\t\t\t}\n\n\t\t\tconst SharedNode root;\n\n\t\tprivate:\n\t\t\t\/\/ huffman coding algorithm \n\t\t\t\/\/ based on a pseudocode on 16.3 CLRS 3rd.\n\t\t\tSharedNode make_tree(FrequencyMap<Char, Freq> const& map) const\n\t\t\t{\n\t\t\t\t\tauto greater = [](SharedNode lhs, SharedNode rhs)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (lhs->freq_ != rhs->freq_)\n\t\t\t\t\t\t\treturn lhs->freq_ > rhs->freq_;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\treturn lhs->character_ > rhs->character_;\n\t\t\t\t\t};\n\n\n\t\t\t\t\tusing MinPriorityQueue = std::priority_queue < SharedNode, std::vector<SharedNode>, decltype(greater) > ;\n\n\t\t\t\t\tMinPriorityQueue queue(greater);\n\t\t\t\t\tfor (auto const& pair : map)\n\t\t\t\t\t\tqueue.push(make_new_node(pair.first, pair.second));\n\t\t\t\t\t\n\t\t\t\t\tfor (int count = 1; count != map.size(); ++count)\n\t\t\t\t\t{\n\t\t\t\t\t\tauto merge = make_new_node<Char, Freq>();\n\t\t\t\t\t\tmerge->left_ = queue.top();\t\tqueue.pop();\n\t\t\t\t\t\tmerge->right_ = queue.top();\tqueue.pop();\n\t\t\t\t\t\tmerge->freq_ = merge->left_->freq_ + merge->right_->freq_;\n\t\t\t\t\t\tqueue.push(merge);\n\t\t\t\t\t}\n\n\t\t\t\t\treturn queue.top();\n\t\t\t}\n\t\t};\n\t}\n}\n\n#endif \/\/ !HUFFMAN_TREE_HPP<|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 <memory>\n#include <string>\n#include <vector>\n\n#include \"tensorflow\/compiler\/xla\/layout_util.h\"\n#include \"tensorflow\/compiler\/xla\/literal_util.h\"\n#include \"tensorflow\/compiler\/xla\/service\/device_memory_allocator.h\"\n#include \"tensorflow\/compiler\/xla\/service\/generic_transfer_manager.h\"\n#include \"tensorflow\/compiler\/xla\/service\/shaped_buffer.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/compiler\/xla\/statusor.h\"\n#include \"tensorflow\/compiler\/xla\/tests\/literal_test_util.h\"\n#include \"tensorflow\/compiler\/xla\/tests\/local_client_test_base.h\"\n#include \"tensorflow\/compiler\/xla\/tests\/test_macros.h\"\n#include \"tensorflow\/compiler\/xla\/types.h\"\n#include \"tensorflow\/compiler\/xla\/xla_data.pb.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/stream_executor_no_cuda.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n\nnamespace se = ::perftools::gputools;\n\nnamespace xla {\n\nnamespace {\n\nclass TransferManagerTest : public LocalClientTestBase {\n protected:\n  TransferManagerTest() {\n    shape_size_fn_ = [this](const Shape& shape) {\n      return transfer_manager_->GetByteSizeRequirement(shape);\n    };\n  }\n\n  ~TransferManagerTest() override {}\n\n  std::unique_ptr<ScopedShapedBuffer> AllocateDeviceBuffer(const Shape& shape) {\n    return ScopedShapedBuffer::Allocate(\n               shape, GetOrCreateAllocator(local_client_->platform()),\n               \/*device_ordinal=*\/0, shape_size_fn_)\n        .ConsumeValueOrDie();\n  }\n\n  std::function<int64(const Shape&)> shape_size_fn_;\n};\n\nXLA_TEST_F(TransferManagerTest, TransferR0U32) {\n  std::unique_ptr<Literal> literal = Literal::CreateR0<uint32>(42);\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectR0Equal<uint32>(42, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferR1F32) {\n  std::unique_ptr<Literal> literal =\n      Literal::CreateR1<float>({1.25f, 2.5f, -17.0f, -20.125f});\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectR1Equal<float>({1.25f, 2.5f, -17.0f, -20.125f},\n                                        *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferR1LargeF32) {\n  std::vector<float> test_vector(1024 * 1024);\n  std::iota(test_vector.begin(), test_vector.end(), 0);\n  std::unique_ptr<Literal> literal = Literal::CreateR1<float>(test_vector);\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectR1Equal<float>(test_vector, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferR1U8) {\n  const char* test_string = \"0123456789abcdef\";\n  std::unique_ptr<Literal> literal = Literal::CreateR1U8(test_string);\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  EXPECT_EQ(result->u8s_string(), test_string);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferR2F32) {\n  std::unique_ptr<Literal> literal =\n      Literal::CreateR2<float>({{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}});\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectR2Equal<float>(\n      {{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}}, *result);\n}\n\nXLA_TEST_F(TransferManagerTest,\n           TransferR2F32AndChangeLayoutTransferringToDevice) {\n  std::unique_ptr<Literal> literal = Literal::CreateR2WithLayout<float>(\n      {{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}}, LayoutUtil::MakeLayout({0, 1}));\n  const Shape ondevice_shape =\n      ShapeUtil::MakeShapeWithLayout(F32, {2, 3}, {1, 0});\n  auto device_buffer = AllocateDeviceBuffer(ondevice_shape);\n\n  \/\/ Round trip literal through device. Set the on-device layout to something\n  \/\/ different than the literal layout.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  EXPECT_FALSE(\n      LayoutUtil::Equal(result->shape().layout(), literal->shape().layout()));\n  LiteralTestUtil::ExpectR2Equal<float>(\n      {{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}}, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferTuple) {\n  std::unique_ptr<Literal> literal = Literal::MakeTuple(\n      {Literal::CreateR0<float>(123.0f).get(),\n       Literal::CreateR2<float>({{1.0f, 2.0f}, {4.0f, 5.0f}}).get(),\n       Literal::CreateR1<float>({44.0f, -10.0f, 3333333.3f}).get()});\n  auto device_buffer = AllocateDeviceBuffer(literal->shape());\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectEqual(*literal, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferEmptyTuple) {\n  std::unique_ptr<Literal> literal = Literal::MakeTuple({});\n  auto device_buffer = AllocateDeviceBuffer(literal->shape());\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectEqual(*literal, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferNestedTuple) {\n  std::unique_ptr<Literal> literal = Literal::MakeTuple(\n      {Literal::CreateR0<float>(123.0f).get(),\n       Literal::MakeTuple(\n           {Literal::CreateR2<float>({{1.0f, 2.0f}, {4.0f, 5.0f}}).get(),\n            Literal::CreateR1<float>({44.0f, -10.0f, 3333333.3f}).get()})\n           .get(),\n       Literal::CreateR1<float>({-10.0f, 123.0f}).get()});\n  auto device_buffer = AllocateDeviceBuffer(literal->shape());\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectEqual(*literal, *result);\n}\n\n}  \/\/ namespace\n\n}  \/\/ namespace xla\n<commit_msg>Clean up initialization, declarations and access of TransferManagerTest<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 <memory>\n#include <string>\n#include <vector>\n\n#include \"tensorflow\/compiler\/xla\/layout_util.h\"\n#include \"tensorflow\/compiler\/xla\/literal_util.h\"\n#include \"tensorflow\/compiler\/xla\/service\/device_memory_allocator.h\"\n#include \"tensorflow\/compiler\/xla\/service\/generic_transfer_manager.h\"\n#include \"tensorflow\/compiler\/xla\/service\/shaped_buffer.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/compiler\/xla\/statusor.h\"\n#include \"tensorflow\/compiler\/xla\/tests\/literal_test_util.h\"\n#include \"tensorflow\/compiler\/xla\/tests\/local_client_test_base.h\"\n#include \"tensorflow\/compiler\/xla\/tests\/test_macros.h\"\n#include \"tensorflow\/compiler\/xla\/types.h\"\n#include \"tensorflow\/compiler\/xla\/xla_data.pb.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/stream_executor_no_cuda.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n\nnamespace xla {\nnamespace {\n\nclass TransferManagerTest : public LocalClientTestBase {\n protected:\n  TransferManagerTest()\n      : shape_size_fn_([this](const Shape& shape) {\n          return transfer_manager_->GetByteSizeRequirement(shape);\n        }) {}\n\n  ~TransferManagerTest() override = default;\n\n  std::unique_ptr<ScopedShapedBuffer> AllocateDeviceBuffer(const Shape& shape) {\n    return ScopedShapedBuffer::Allocate(\n               shape, GetOrCreateAllocator(local_client_->platform()),\n               \/*device_ordinal=*\/0, shape_size_fn_)\n        .ValueOrDie();\n  }\n\n private:\n  std::function<int64(const Shape&)> shape_size_fn_;\n};\n\nXLA_TEST_F(TransferManagerTest, TransferR0U32) {\n  std::unique_ptr<Literal> literal = Literal::CreateR0<uint32>(42);\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectR0Equal<uint32>(42, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferR1F32) {\n  std::unique_ptr<Literal> literal =\n      Literal::CreateR1<float>({1.25f, 2.5f, -17.0f, -20.125f});\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectR1Equal<float>({1.25f, 2.5f, -17.0f, -20.125f},\n                                        *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferR1LargeF32) {\n  std::vector<float> test_vector(1024 * 1024);\n  std::iota(test_vector.begin(), test_vector.end(), 0);\n  std::unique_ptr<Literal> literal = Literal::CreateR1<float>(test_vector);\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectR1Equal<float>(test_vector, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferR1U8) {\n  const char* test_string = \"0123456789abcdef\";\n  std::unique_ptr<Literal> literal = Literal::CreateR1U8(test_string);\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  EXPECT_EQ(result->u8s_string(), test_string);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferR2F32) {\n  std::unique_ptr<Literal> literal =\n      Literal::CreateR2<float>({{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}});\n  const Shape& shape = literal->shape();\n  auto device_buffer = AllocateDeviceBuffer(shape);\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectR2Equal<float>(\n      {{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}}, *result);\n}\n\nXLA_TEST_F(TransferManagerTest,\n           TransferR2F32AndChangeLayoutTransferringToDevice) {\n  std::unique_ptr<Literal> literal = Literal::CreateR2WithLayout<float>(\n      {{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}}, LayoutUtil::MakeLayout({0, 1}));\n  const Shape ondevice_shape =\n      ShapeUtil::MakeShapeWithLayout(F32, {2, 3}, {1, 0});\n  auto device_buffer = AllocateDeviceBuffer(ondevice_shape);\n\n  \/\/ Round trip literal through device. Set the on-device layout to something\n  \/\/ different than the literal layout.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  EXPECT_FALSE(\n      LayoutUtil::Equal(result->shape().layout(), literal->shape().layout()));\n  LiteralTestUtil::ExpectR2Equal<float>(\n      {{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}}, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferTuple) {\n  std::unique_ptr<Literal> literal = Literal::MakeTuple(\n      {Literal::CreateR0<float>(123.0f).get(),\n       Literal::CreateR2<float>({{1.0f, 2.0f}, {4.0f, 5.0f}}).get(),\n       Literal::CreateR1<float>({44.0f, -10.0f, 3333333.3f}).get()});\n  auto device_buffer = AllocateDeviceBuffer(literal->shape());\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectEqual(*literal, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferEmptyTuple) {\n  std::unique_ptr<Literal> literal = Literal::MakeTuple({});\n  auto device_buffer = AllocateDeviceBuffer(literal->shape());\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectEqual(*literal, *result);\n}\n\nXLA_TEST_F(TransferManagerTest, TransferNestedTuple) {\n  std::unique_ptr<Literal> literal = Literal::MakeTuple(\n      {Literal::CreateR0<float>(123.0f).get(),\n       Literal::MakeTuple(\n           {Literal::CreateR2<float>({{1.0f, 2.0f}, {4.0f, 5.0f}}).get(),\n            Literal::CreateR1<float>({44.0f, -10.0f, 3333333.3f}).get()})\n           .get(),\n       Literal::CreateR1<float>({-10.0f, 123.0f}).get()});\n  auto device_buffer = AllocateDeviceBuffer(literal->shape());\n\n  \/\/ Round trip literal through device.\n  ASSERT_IS_OK(transfer_manager_->TransferLiteralToDevice(\n      stream_executor_, *literal, *device_buffer));\n  TF_ASSERT_OK_AND_ASSIGN(std::unique_ptr<Literal> result,\n                          transfer_manager_->TransferLiteralFromDevice(\n                              stream_executor_, *device_buffer));\n\n  LiteralTestUtil::ExpectEqual(*literal, *result);\n}\n\n}  \/\/ namespace\n}  \/\/ namespace xla\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2019 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\/delegates\/gpu\/metal\/kernels\/padding.h\"\n\n#include <map>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"absl\/strings\/substitute.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/common\/model.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/common\/operations.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/common\/types.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/common\/util.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/metal\/compute_task_descriptor.h\"\n\nnamespace tflite {\nnamespace gpu {\nnamespace metal {\nnamespace {\n\nstd::string GetPaddingCode(const PadAttributes& attr) {\n  const std::string channels[] = {\".x\", \".y\", \".z\", \".w\"};\n  std::string code = R\"(\n    #include <metal_stdlib>\n    using namespace metal;\n\n    struct uniforms {\n      int4 src_size;\n      int4 dst_size;\n      int4 padding;\n    };)\";\n  if (attr.type == PaddingContentType::REFLECT) {\n    code += R\"(\n    int reflect(int x, int size) {\n      return size - 1 - abs(abs(x) - size + 1);\n    })\";\n  }\n  code += R\"(\n    $0\n    kernel void ComputeFunction(\n                                $1\n                                uint3 gid[[thread_position_in_grid]]) {\n      if (static_cast<int>(gid.x) >= params.dst_size.x ||\n          static_cast<int>(gid.y) >= params.dst_size.y) {\n        return;\n      }\n\n      FLT4 value = FLT4(0.0f);\n      int s_x = static_cast<int>(gid.x) - params.padding.x;\n      int s_y = static_cast<int>(gid.y) - params.padding.y;)\";\n  if (attr.type == PaddingContentType::REFLECT) {\n    code += R\"(\n      s_x = reflect(s_x, params.src_size.x);\n      s_y = reflect(s_y, params.src_size.y);\n)\";\n    if (attr.prepended.c == 0 && attr.appended.c == 0) {\n      \/\/ optimized case\n      code +=\n          \"      int buffer_index = (int(gid.z) * params.src_size.y + s_y) * \"\n          \"params.src_size.x + s_x;\\n\";\n      code += \"      value = src_tensor[buffer_index];\\n\";\n    } else {\n      code += \"      int start_channel = static_cast<int>(gid.z) * 4;\\n\";\n      for (int i = 0; i < 4; ++i) {\n        const auto& s = channels[i];\n        code += \"      {\\n\";\n        code += \"        int channel = start_channel + \" + std::to_string(i) +\n                \";\\n\";\n        code += \"        int s_z = channel - params.padding.z;\\n\";\n        \/\/ We need additional clamp for z, so that we use alignment for channels\n        \/\/ and can proceed extra channels that can lead to reading out of\n        \/\/ resource.\n        code +=\n            \"        s_z = clamp(reflect(s_z, params.src_size.z), 0, \"\n            \"params.src_size.z - 1);\\n\";\n        code +=\n            \"        int buffer_index = ((s_z \/ 4) * params.src_size.y + s_y) \"\n            \"* params.src_size.x + s_x;\\n\";\n        code += \"        FLT4 t = src_tensor[buffer_index];\\n\";\n        code += \"        FLT t_ar[4] = {t.x, t.y, t.z, t.w};\\n\";\n        code += \"        value\" + s + \" = t_ar[s_z % 4];\\n\";\n        code += \"      }\\n\";\n      }\n    }\n  } else {\n    code += R\"(\n      bool inside_x = s_x >= 0 && s_x < params.src_size.x;\n      bool inside_y = s_y >= 0 && s_y < params.src_size.y;\n      if (inside_x && inside_y) {\n        int start_channel = static_cast<int>(gid.z) * 4;\n    )\";\n    if (attr.prepended.c == 0 && attr.appended.c == 0) {\n      \/\/ optimized case\n      code +=\n          \"        int buffer_index = (int(gid.z) * params.src_size.y + s_y) * \"\n          \"params.src_size.x + s_x;\\n\";\n      code += \"        value = src_tensor[buffer_index];\\n\";\n    } else if (attr.prepended.c % 4 == 0) {\n      code += R\"(\n        int s_z = static_cast<int>(gid.z) - params.padding.z \/ 4;\n        if (s_z >= 0 && s_z < params.src_size.w) {\n          int buffer_index = (s_z * params.src_size.y + s_y) * params.src_size.x + s_x;\n          value = src_tensor[buffer_index];\n        })\";\n    } else {\n      for (int i = 0; i < 4; ++i) {\n        const auto& s = channels[i];\n        code += \"    {\\n\";\n        code +=\n            \"    int channel = start_channel + \" + std::to_string(i) + \";\\n\";\n        code += \"    int s_z = channel - params.padding.z;\\n\";\n        code += \"    if (s_z >= 0 && s_z < params.src_size.z) {\\n\";\n        code +=\n            \"      int buffer_index = ((s_z \/ 4) * params.src_size.y + s_y) * \"\n            \"params.src_size.x + \"\n            \"s_x;\\n\";\n        code += \"      FLT4 t = src_tensor[buffer_index];\\n\";\n        code += \"      FLT t_ar[4] = {t.x, t.y, t.z, t.w};\\n\";\n        code += \"      value\" + s + \" = t_ar[s_z % 4];\\n\";\n        code += \"    }\\n\";\n        code += \"    }\\n\";\n      }\n    }\n    code += \"  }\\n\";\n  }\n  code +=\n      \"  int linear_index = (gid.z * params.dst_size.y + int(gid.y)) * \"\n      \"params.dst_size.x + \"\n      \"int(gid.x);\\n\";\n  code += \"  $2\\n\";\n  code += \"  dst_tensor[linear_index] = value;\\n\";\n  code += \"}\\n\";\n  return code;\n}\n}  \/\/ namespace\n\nComputeTaskDescriptor Padding(const OperationDef& definition,\n                              const PadAttributes& attr) {\n  ComputeTaskDescriptor desc(definition);\n  desc.shader_source = GetPaddingCode(attr);\n\n  desc.AddSrcTensor(\"src_tensor\", definition.src_tensors[0]);\n  desc.AddDstTensor(\"dst_tensor\", definition.dst_tensors[0]);\n\n  desc.uniform_buffers = {\n      {\"constant uniforms& params\",\n       [attr](const std::vector<BHWC>& src_shapes,\n              const std::vector<BHWC>& dst_shapes) {\n         std::vector<int> uniform_params{\n             \/\/ int4 src_size\n             src_shapes[0].w,\n             src_shapes[0].h,\n             src_shapes[0].c,\n             DivideRoundUp(src_shapes[0].c, 4),\n             \/\/ int4 dst_size\n             dst_shapes[0].w,\n             dst_shapes[0].h,\n             dst_shapes[0].c,\n             DivideRoundUp(dst_shapes[0].c, 4),\n             \/\/ int4 prepended padding\n             attr.prepended.w,\n             attr.prepended.h,\n             attr.prepended.c,\n             attr.prepended.b,\n         };\n         return GetByteBuffer(uniform_params);\n       }},\n  };\n\n  desc.resize_function = [attr](const std::vector<BHWC>& src_shapes,\n                                const std::vector<BHWC>& dst_shapes) {\n    const uint3 groups_size{16, 16, 1};\n    const int dst_layers = DivideRoundUp(dst_shapes[0].c, 4);\n    int groups_x = DivideRoundUp(dst_shapes[0].w, groups_size.x);\n    int groups_y = DivideRoundUp(dst_shapes[0].h, groups_size.y);\n    int groups_z = DivideRoundUp(dst_layers, groups_size.z);\n    return std::make_pair(groups_size, uint3{groups_x, groups_y, groups_z});\n  };\n\n  return desc;\n}\n\n}  \/\/ namespace metal\n}  \/\/ namespace gpu\n}  \/\/ namespace tflite\n<commit_msg>Using Tensor objects and args in Padding kernel.<commit_after>\/* Copyright 2019 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\/delegates\/gpu\/metal\/kernels\/padding.h\"\n\n#include <map>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"absl\/strings\/substitute.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/common\/model.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/common\/operations.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/common\/types.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/common\/util.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/metal\/compute_task_descriptor.h\"\n\nnamespace tflite {\nnamespace gpu {\nnamespace metal {\nnamespace {\n\nstd::string GetPaddingCode(const PadAttributes& attr) {\n  const std::string channels[] = {\".x\", \".y\", \".z\", \".w\"};\n  std::string code = R\"(\n    #include <metal_stdlib>\n    using namespace metal;\n)\";\n  if (attr.type == PaddingContentType::REFLECT) {\n    code += R\"(\n    int reflect(int x, int size) {\n      return size - 1 - abs(abs(x) - size + 1);\n    })\";\n  }\n  code += R\"(\n    $0\n    kernel void ComputeFunction(\n                                $1\n                                uint3 gid[[thread_position_in_grid]]) {\n      if (static_cast<int>(gid.x) >= args.dst_tensor.Width() ||\n          static_cast<int>(gid.y) >= args.dst_tensor.Height()) {\n        return;\n      }\n\n      FLT4 value = FLT4(0.0f);\n      int s_x = static_cast<int>(gid.x) - args.padding_w;\n      int s_y = static_cast<int>(gid.y) - args.padding_h;)\";\n  if (attr.type == PaddingContentType::REFLECT) {\n    code += R\"(\n      s_x = reflect(s_x, args.src_tensor.Width());\n      s_y = reflect(s_y, args.src_tensor.Height());\n)\";\n    if (attr.prepended.c == 0 && attr.appended.c == 0) {\n      \/\/ optimized case\n      code += \"      value = args.src_tensor.Read(s_x, s_y, gid.z);\\n\";\n    } else {\n      code += \"      int start_channel = static_cast<int>(gid.z) * 4;\\n\";\n      for (int i = 0; i < 4; ++i) {\n        const auto& s = channels[i];\n        code += \"      {\\n\";\n        code += \"        int channel = start_channel + \" + std::to_string(i) +\n                \";\\n\";\n        code += \"        int s_z = channel - args.padding_c;\\n\";\n        \/\/ We need additional clamp for z, so that we use alignment for channels\n        \/\/ and can proceed extra channels that can lead to reading out of\n        \/\/ resource.\n        code +=\n            \"        s_z = clamp(reflect(s_z, args.src_tensor.Channels()), 0, \"\n            \"args.src_tensor.Channels() - 1);\\n\";\n        code += \"        FLT4 t = args.src_tensor.Read(s_x, s_y, s_z \/ 4);\\n\";\n        code += \"        FLT t_ar[4] = {t.x, t.y, t.z, t.w};\\n\";\n        code += \"        value\" + s + \" = t_ar[s_z % 4];\\n\";\n        code += \"      }\\n\";\n      }\n    }\n  } else {\n    code += R\"(\n      bool inside_x = s_x >= 0 && s_x < args.src_tensor.Width();\n      bool inside_y = s_y >= 0 && s_y < args.src_tensor.Height();\n      if (inside_x && inside_y) {\n        int start_channel = static_cast<int>(gid.z) * 4;\n    )\";\n    if (attr.prepended.c == 0 && attr.appended.c == 0) {\n      \/\/ optimized case\n      code += \"        value = args.src_tensor.Read(s_x, s_y, gid.z);\\n\";\n    } else if (attr.prepended.c % 4 == 0) {\n      code += R\"(\n        int s_z = static_cast<int>(gid.z) - args.padding_c \/ 4;\n        if (s_z >= 0 && s_z < args.src_tensor.Slices()) {\n          value = args.src_tensor.Read(s_x, s_y, s_z);\n        })\";\n    } else {\n      for (int i = 0; i < 4; ++i) {\n        const auto& s = channels[i];\n        code += \"    {\\n\";\n        code +=\n            \"    int channel = start_channel + \" + std::to_string(i) + \";\\n\";\n        code += \"    int s_z = channel - args.padding_c;\\n\";\n        code += \"    if (s_z >= 0 && s_z < args.src_tensor.Channels()) {\\n\";\n        code += \"      FLT4 t = args.src_tensor.Read(s_x, s_y, s_z \/ 4);\\n\";\n        code += \"      FLT t_ar[4] = {t.x, t.y, t.z, t.w};\\n\";\n        code += \"      value\" + s + \" = t_ar[s_z % 4];\\n\";\n        code += \"    }\\n\";\n        code += \"    }\\n\";\n      }\n    }\n    code += \"  }\\n\";\n  }\n  code += \"  args.dst_tensor.GetAddress(linear_index, gid.x, gid.y, gid.z);\\n\";\n  code += \"  $2\\n\";\n  code += \"  args.dst_tensor.Write(value, gid.x, gid.y, gid.z);\\n\";\n  code += \"}\\n\";\n  return code;\n}\n}  \/\/ namespace\n\nComputeTaskDescriptor Padding(const OperationDef& definition,\n                              const PadAttributes& attr) {\n  ComputeTaskDescriptor desc(definition);\n  desc.tensors_as_args = true;\n  desc.shader_source = GetPaddingCode(attr);\n\n  desc.AddSrcTensor(\"src_tensor\", definition.src_tensors[0]);\n  desc.AddDstTensor(\"dst_tensor\", definition.dst_tensors[0]);\n\n  desc.args.AddInt(\"padding_w\", attr.prepended.w);\n  desc.args.AddInt(\"padding_h\", attr.prepended.h);\n  desc.args.AddInt(\"padding_c\", attr.prepended.c);\n  desc.args.AddInt(\"padding_b\", attr.prepended.b);\n\n  desc.resize_function = [attr](const std::vector<BHWC>& src_shapes,\n                                const std::vector<BHWC>& dst_shapes) {\n    const uint3 groups_size{16, 16, 1};\n    const int dst_layers = DivideRoundUp(dst_shapes[0].c, 4);\n    int groups_x = DivideRoundUp(dst_shapes[0].w, groups_size.x);\n    int groups_y = DivideRoundUp(dst_shapes[0].h, groups_size.y);\n    int groups_z = DivideRoundUp(dst_layers, groups_size.z);\n    return std::make_pair(groups_size, uint3{groups_x, groups_y, groups_z});\n  };\n\n  return desc;\n}\n\n}  \/\/ namespace metal\n}  \/\/ namespace gpu\n}  \/\/ namespace tflite\n<|endoftext|>"}
{"text":"<commit_before>#include \"framework.hpp\"\n\n#include \"..\/indexer\/classificator.hpp\"\n#include \"..\/indexer\/feature_visibility.hpp\"\n\n\nnamespace\n{\n  class FeatureInfoT\n  {\n    double m_dist;\n\n  public:\n    FeatureInfoT(double d, feature::TypesHolder & types, string & name, m2::PointD const & pt)\n      : m_dist(d), m_types(types), m_pt(pt)\n    {\n      m_name.swap(name);\n    }\n\n    bool operator<(FeatureInfoT const & rhs) const\n    {\n      return (m_dist < rhs.m_dist);\n    }\n\n    void Swap(FeatureInfoT & rhs)\n    {\n      swap(m_dist, rhs.m_dist);\n      m_name.swap(rhs.m_name);\n      swap(m_types, rhs.m_types);\n    }\n\n    string m_name;\n    feature::TypesHolder m_types;\n    m2::PointD m_pt;\n  };\n\n  void swap(FeatureInfoT & i1, FeatureInfoT & i2)\n  {\n    i1.Swap(i2);\n  }\n\n  class DoGetFeatureInfoBase\n  {\n  protected:\n    virtual double GetResultDistance(double d, feature::TypesHolder const & types) const = 0;\n    virtual double NeedProcess(feature::TypesHolder const & types) const\n    {\n      pair<int, int> const r = feature::GetDrawableScaleRange(types);\n      return my::between_s(r.first, r.second, m_scale);\n    }\n\n    static double GetCompareEpsilonImpl(feature::EGeomType type, double eps)\n    {\n      using namespace feature;\n      switch (type)\n      {\n      case GEOM_POINT: return 0.0 * eps;\n      case GEOM_LINE: return 1.0 * eps;\n      case GEOM_AREA: return 2.0 * eps;\n      default:\n        ASSERT ( false, () );\n        return numeric_limits<double>::max();\n      }\n    }\n\n  public:\n    DoGetFeatureInfoBase(m2::PointD const & pt, double eps, int scale)\n      : m_pt(pt), m_scale(scale), m_eps(eps)\n    {\n      m_coastType = classif().GetCoastType();\n    }\n\n    void operator() (FeatureType const & f)\n    {\n      feature::TypesHolder types(f);\n      if (!types.Has(m_coastType) && NeedProcess(types))\n      {\n        double const d = f.GetDistance(m_pt, m_scale);\n        ASSERT_GREATER_OR_EQUAL(d, 0.0, ());\n\n        if (d <= m_eps)\n        {\n          string defName, intName;\n          f.GetPreferredDrawableNames(defName, intName);\n\n          \/\/ if geom type is not GEOM_POINT, result center point doesn't matter in future use\n          m2::PointD const pt = (types.GetGeoType() == feature::GEOM_POINT) ?\n                f.GetCenter() : m2::PointD();\n\n          m_cont.push_back(FeatureInfoT(GetResultDistance(d, types), types, defName, pt));\n        }\n      }\n    }\n\n    void SortResults()\n    {\n      sort(m_cont.begin(), m_cont.end());\n    }\n\n  private:\n    m2::PointD m_pt;\n    int m_scale;\n    uint32_t m_coastType;\n\n  protected:\n    double m_eps;\n    vector<FeatureInfoT> m_cont;\n  };\n\n  class DoGetFeatureTypes : public DoGetFeatureInfoBase\n  {\n  protected:\n    virtual double GetResultDistance(double d, feature::TypesHolder const & types) const\n    {\n      return (d + GetCompareEpsilonImpl(types.GetGeoType(), m_eps));\n    }\n\n  public:\n    DoGetFeatureTypes(m2::PointD const & pt, double eps, int scale)\n      : DoGetFeatureInfoBase(pt, eps, scale)\n    {\n    }\n\n    void GetFeatureTypes(size_t count, vector<string> & types)\n    {\n      SortResults();\n\n      Classificator const & c = classif();\n\n      for (size_t i = 0; i < min(count, m_cont.size()); ++i)\n        for (size_t j = 0; j < m_cont[i].m_types.Size(); ++j)\n          types.push_back(c.GetFullObjectName(m_cont[i].m_types[j]));\n    }\n  };\n}\n\nvoid Framework::GetFeatureTypes(m2::PointD pt, vector<string> & types) const\n{\n  pt = m_navigator.ShiftPoint(pt);\n\n  int const sm = 20;\n  m2::RectD pixR(m2::PointD(pt.x - sm, pt.y - sm), m2::PointD(pt.x + sm, pt.y + sm));\n\n  m2::RectD glbR;\n  m_navigator.Screen().PtoG(pixR, glbR);\n\n  int const scale = GetDrawScale();\n  DoGetFeatureTypes getTypes(m_navigator.Screen().PtoG(pt),\n                             max(glbR.SizeX(), glbR.SizeY()) \/ 2.0,\n                             scale);\n\n  m_model.ForEachFeature(glbR, getTypes, scale);\n\n  getTypes.GetFeatureTypes(5, types);\n}\n\n\nnamespace\n{\n  class DoGetAddressInfo : public DoGetFeatureInfoBase\n  {\n  public:\n    class TypeChecker\n    {\n      vector<uint32_t> m_localities, m_streets, m_buildings;\n\n      template <size_t count, size_t ind>\n      void FillMatch(char const * (& arr)[count][ind], vector<uint32_t> & vec)\n      {\n        STATIC_ASSERT ( count > 0 );\n        STATIC_ASSERT ( ind > 0 );\n\n        Classificator const & c = classif();\n\n        vec.reserve(count);\n        for (size_t i = 0; i < count; ++i)\n        {\n          vector<string> v(arr[i], arr[i] + ind);\n          vec.push_back(c.GetTypeByPath(v));\n        }\n      }\n\n      static bool IsMatchImpl(vector<uint32_t> const & vec, feature::TypesHolder const & types)\n      {\n        for (size_t i = 0; i < types.Size(); ++i)\n        {\n          uint32_t type = types[i];\n          ftype::TruncValue(type, 2);\n\n          if (find(vec.begin(), vec.end(), type) != vec.end())\n            return true;\n        }\n\n        return false;\n      }\n\n    public:\n      TypeChecker()\n      {\n        char const * arrLocalities[][2] = {\n          { \"place\", \"city\" },\n          { \"place\", \"town\" },\n          { \"place\", \"village\" },\n          { \"place\", \"hamlet\" }\n        };\n\n        char const * arrStreet[][2] = {\n          { \"highway\", \"primary\" },\n          { \"highway\", \"secondary\" },\n          { \"highway\", \"residential\" },\n          { \"highway\", \"tertiary\" },\n          { \"highway\", \"living_street\" },\n          { \"highway\", \"service\" }\n        };\n\n        char const * arrBuilding[][1] = {\n          { \"building\" }\n        };\n\n        FillMatch(arrLocalities, m_localities);\n        FillMatch(arrStreet, m_streets);\n        FillMatch(arrBuilding, m_buildings);\n      }\n\n      bool IsLocality(feature::TypesHolder const & types) const\n      {\n        return IsMatchImpl(m_localities, types);\n      }\n      bool IsStreet(feature::TypesHolder const & types) const\n      {\n        return IsMatchImpl(m_streets, types);\n      }\n      bool IsBuilding(feature::TypesHolder const & types) const\n      {\n        return IsMatchImpl(m_buildings, types);\n      }\n\n      double GetLocalityDivideFactor(feature::TypesHolder const & types) const\n      {\n        double arrF[] = { 10.0, 10.0, 1.0, 1.0 };\n        ASSERT_EQUAL ( ARRAY_SIZE(arrF), m_localities.size(), () );\n\n        for (size_t i = 0; i < types.Size(); ++i)\n        {\n          uint32_t type = types[i];\n          ftype::TruncValue(type, 2);\n\n          vector<uint32_t>::const_iterator j = find(m_localities.begin(), m_localities.end(), type);\n          if (j != m_localities.end())\n            return arrF[distance(m_localities.begin(), j)];\n        }\n\n        return 1.0;\n      }\n    };\n\n    TypeChecker const & m_checker;\n    bool m_doLocalities;\n\n  protected:\n    virtual double GetResultDistance(double d, feature::TypesHolder const & types) const\n    {\n      if (!m_doLocalities)\n        return (d + GetCompareEpsilonImpl(types.GetGeoType(), 5.0 * MercatorBounds::degreeInMetres));\n      else\n      {\n        \/\/ This routine is needed for quality of locality prediction.\n        \/\/ Hamlet may be the nearest point, but it's a part of a City. So use the divide factor\n        \/\/ for distance, according to feature type.\n        return (d \/ m_checker.GetLocalityDivideFactor(types));\n      }\n    }\n    virtual double NeedProcess(feature::TypesHolder const & types) const\n    {\n      if (!DoGetFeatureInfoBase::NeedProcess(types))\n        return false;\n\n      return (!m_doLocalities ||\n              (types.GetGeoType() == feature::GEOM_POINT && m_checker.IsLocality(types)));\n    }\n\n  public:\n    DoGetAddressInfo(m2::PointD const & pt, double eps, int scale,\n                     TypeChecker const & checker)\n      : DoGetFeatureInfoBase(pt, eps, scale),\n        m_checker(checker), m_doLocalities(false)\n    {\n    }\n\n    void PrepareForLocalities()\n    {\n      m_doLocalities = true;\n      m_cont.clear();\n    }\n\n    void FillAddress(Framework::AddressInfo & info)\n    {\n      SortResults();\n\n      for (size_t i = 0; i < m_cont.size(); ++i)\n      {\n        bool const isStreet = m_checker.IsStreet(m_cont[i].m_types);\n        \/\/bool const isBuilding = m_checker.IsBuilding(m_cont[i].m_types);\n\n        if (info.m_street.empty() && isStreet)\n          info.m_street = m_cont[i].m_name;\n\n        \/\/if (info.m_house.empty() && isBuilding)\n        \/\/  info.m_house = m_cont[i].m_house;\n\n        if (info.m_name.empty())\n        {\n          if (m_cont[i].m_types.GetGeoType() != feature::GEOM_LINE)\n            info.m_name = m_cont[i].m_name;\n        }\n\n        if (!(info.m_street.empty() || info.m_name.empty()))\n          break;\n      }\n    }\n\n    void FillLocality(Framework::AddressInfo & info, Framework const & fm)\n    {\n      SortResults();\n\n      for (size_t i = 0; i < m_cont.size(); ++i)\n      {\n        if (!m_cont[i].m_name.empty() && fm.GetCountryName(m_cont[i].m_pt) == info.m_country)\n        {\n          info.m_city = m_cont[i].m_name;\n          break;\n        }\n      }\n    }\n  };\n}\n\nvoid Framework::GetAddressInfo(m2::PointD const & pt, AddressInfo & info) const\n{\n  info.m_country = GetCountryName(pt);\n  if (info.m_country.empty())\n  {\n    LOG(LINFO, (\"Can't find region for point \", pt));\n    return;\n  }\n\n  int const scale = scales::GetUpperScale();\n  double const addressR = 200.0;\n  double const localityR = 20000;\n\n  static DoGetAddressInfo::TypeChecker checker;\n\n  \/\/ first of all - get an address\n  {\n    DoGetAddressInfo getAddress(pt, addressR, scale, checker);\n\n    m_model.ForEachFeature(\n          MercatorBounds::RectByCenterXYAndSizeInMeters(pt, addressR), getAddress, scale);\n\n    getAddress.FillAddress(info);\n  }\n\n  \/\/ now - get the locality\n  {\n    DoGetAddressInfo getLocality(pt, localityR, scale, checker);\n    getLocality.PrepareForLocalities();\n\n    m_model.ForEachFeature(\n          MercatorBounds::RectByCenterXYAndSizeInMeters(pt, localityR), getLocality, scale);\n\n    getLocality.FillLocality(info, *this);\n  }\n}\n<commit_msg>Fix bug with locality detection (do not check on scale visibility).<commit_after>#include \"framework.hpp\"\n\n#include \"..\/indexer\/classificator.hpp\"\n#include \"..\/indexer\/feature_visibility.hpp\"\n\n\nnamespace\n{\n  class FeatureInfoT\n  {\n  public:\n    FeatureInfoT(double d, feature::TypesHolder & types, string & name, m2::PointD const & pt)\n      : m_types(types), m_pt(pt), m_dist(d)\n    {\n      m_name.swap(name);\n    }\n\n    bool operator<(FeatureInfoT const & rhs) const\n    {\n      return (m_dist < rhs.m_dist);\n    }\n\n    void Swap(FeatureInfoT & rhs)\n    {\n      swap(m_dist, rhs.m_dist);\n      m_name.swap(rhs.m_name);\n      swap(m_types, rhs.m_types);\n    }\n\n    string m_name;\n    feature::TypesHolder m_types;\n    m2::PointD m_pt;\n    double m_dist;\n  };\n\n  void swap(FeatureInfoT & i1, FeatureInfoT & i2)\n  {\n    i1.Swap(i2);\n  }\n\n  string DebugPrint(FeatureInfoT const & info)\n  {\n    return (\"Name = \" + info.m_name + \" Distance = \" + strings::to_string(info.m_dist));\n  }\n\n  class DoGetFeatureInfoBase\n  {\n  protected:\n    virtual double GetResultDistance(double d, feature::TypesHolder const & types) const = 0;\n    virtual double NeedProcess(feature::TypesHolder const & types) const\n    {\n      pair<int, int> const r = feature::GetDrawableScaleRange(types);\n      return my::between_s(r.first, r.second, m_scale);\n    }\n\n    static double GetCompareEpsilonImpl(feature::EGeomType type, double eps)\n    {\n      using namespace feature;\n      switch (type)\n      {\n      case GEOM_POINT: return 0.0 * eps;\n      case GEOM_LINE: return 1.0 * eps;\n      case GEOM_AREA: return 2.0 * eps;\n      default:\n        ASSERT ( false, () );\n        return numeric_limits<double>::max();\n      }\n    }\n\n  public:\n    DoGetFeatureInfoBase(m2::PointD const & pt, double eps, int scale)\n      : m_pt(pt), m_scale(scale), m_eps(eps)\n    {\n      m_coastType = classif().GetCoastType();\n    }\n\n    void operator() (FeatureType const & f)\n    {\n      feature::TypesHolder types(f);\n      if (!types.Has(m_coastType) && NeedProcess(types))\n      {\n        double const d = f.GetDistance(m_pt, m_scale);\n        ASSERT_GREATER_OR_EQUAL(d, 0.0, ());\n\n        if (d <= m_eps)\n        {\n          string defName, intName;\n          f.GetPreferredDrawableNames(defName, intName);\n\n          \/\/ if geom type is not GEOM_POINT, result center point doesn't matter in future use\n          m2::PointD const pt = (types.GetGeoType() == feature::GEOM_POINT) ?\n                f.GetCenter() : m2::PointD();\n\n          m_cont.push_back(FeatureInfoT(GetResultDistance(d, types), types, defName, pt));\n        }\n      }\n    }\n\n    void SortResults()\n    {\n      sort(m_cont.begin(), m_cont.end());\n    }\n\n  private:\n    m2::PointD m_pt;\n    int m_scale;\n    uint32_t m_coastType;\n\n  protected:\n    double m_eps;\n    vector<FeatureInfoT> m_cont;\n  };\n\n  class DoGetFeatureTypes : public DoGetFeatureInfoBase\n  {\n  protected:\n    virtual double GetResultDistance(double d, feature::TypesHolder const & types) const\n    {\n      return (d + GetCompareEpsilonImpl(types.GetGeoType(), m_eps));\n    }\n\n  public:\n    DoGetFeatureTypes(m2::PointD const & pt, double eps, int scale)\n      : DoGetFeatureInfoBase(pt, eps, scale)\n    {\n    }\n\n    void GetFeatureTypes(size_t count, vector<string> & types)\n    {\n      SortResults();\n\n      Classificator const & c = classif();\n\n      for (size_t i = 0; i < min(count, m_cont.size()); ++i)\n        for (size_t j = 0; j < m_cont[i].m_types.Size(); ++j)\n          types.push_back(c.GetFullObjectName(m_cont[i].m_types[j]));\n    }\n  };\n}\n\nvoid Framework::GetFeatureTypes(m2::PointD pt, vector<string> & types) const\n{\n  pt = m_navigator.ShiftPoint(pt);\n\n  int const sm = 20;\n  m2::RectD pixR(m2::PointD(pt.x - sm, pt.y - sm), m2::PointD(pt.x + sm, pt.y + sm));\n\n  m2::RectD glbR;\n  m_navigator.Screen().PtoG(pixR, glbR);\n\n  int const scale = GetDrawScale();\n  DoGetFeatureTypes getTypes(m_navigator.Screen().PtoG(pt),\n                             max(glbR.SizeX(), glbR.SizeY()) \/ 2.0,\n                             scale);\n\n  m_model.ForEachFeature(glbR, getTypes, scale);\n\n  getTypes.GetFeatureTypes(5, types);\n}\n\n\nnamespace\n{\n  class DoGetAddressInfo : public DoGetFeatureInfoBase\n  {\n  public:\n    class TypeChecker\n    {\n      vector<uint32_t> m_localities, m_streets, m_buildings;\n\n      template <size_t count, size_t ind>\n      void FillMatch(char const * (& arr)[count][ind], vector<uint32_t> & vec)\n      {\n        STATIC_ASSERT ( count > 0 );\n        STATIC_ASSERT ( ind > 0 );\n\n        Classificator const & c = classif();\n\n        vec.reserve(count);\n        for (size_t i = 0; i < count; ++i)\n        {\n          vector<string> v(arr[i], arr[i] + ind);\n          vec.push_back(c.GetTypeByPath(v));\n        }\n      }\n\n      static bool IsMatchImpl(vector<uint32_t> const & vec, feature::TypesHolder const & types)\n      {\n        for (size_t i = 0; i < types.Size(); ++i)\n        {\n          uint32_t type = types[i];\n          ftype::TruncValue(type, 2);\n\n          if (find(vec.begin(), vec.end(), type) != vec.end())\n            return true;\n        }\n\n        return false;\n      }\n\n    public:\n      TypeChecker()\n      {\n        char const * arrLocalities[][2] = {\n          { \"place\", \"city\" },\n          { \"place\", \"town\" },\n          { \"place\", \"village\" },\n          { \"place\", \"hamlet\" }\n        };\n\n        char const * arrStreet[][2] = {\n          { \"highway\", \"primary\" },\n          { \"highway\", \"secondary\" },\n          { \"highway\", \"residential\" },\n          { \"highway\", \"tertiary\" },\n          { \"highway\", \"living_street\" },\n          { \"highway\", \"service\" }\n        };\n\n        char const * arrBuilding[][1] = {\n          { \"building\" }\n        };\n\n        FillMatch(arrLocalities, m_localities);\n        FillMatch(arrStreet, m_streets);\n        FillMatch(arrBuilding, m_buildings);\n      }\n\n      bool IsLocality(feature::TypesHolder const & types) const\n      {\n        return IsMatchImpl(m_localities, types);\n      }\n      bool IsStreet(feature::TypesHolder const & types) const\n      {\n        return IsMatchImpl(m_streets, types);\n      }\n      bool IsBuilding(feature::TypesHolder const & types) const\n      {\n        return IsMatchImpl(m_buildings, types);\n      }\n\n      double GetLocalityDivideFactor(feature::TypesHolder const & types) const\n      {\n        double arrF[] = { 10.0, 10.0, 1.0, 1.0 };\n        ASSERT_EQUAL ( ARRAY_SIZE(arrF), m_localities.size(), () );\n\n        for (size_t i = 0; i < types.Size(); ++i)\n        {\n          uint32_t type = types[i];\n          ftype::TruncValue(type, 2);\n\n          vector<uint32_t>::const_iterator j = find(m_localities.begin(), m_localities.end(), type);\n          if (j != m_localities.end())\n            return arrF[distance(m_localities.begin(), j)];\n        }\n\n        return 1.0;\n      }\n    };\n\n    TypeChecker const & m_checker;\n    bool m_doLocalities;\n\n  protected:\n    virtual double GetResultDistance(double d, feature::TypesHolder const & types) const\n    {\n      if (!m_doLocalities)\n        return (d + GetCompareEpsilonImpl(types.GetGeoType(), 5.0 * MercatorBounds::degreeInMetres));\n      else\n      {\n        \/\/ This routine is needed for quality of locality prediction.\n        \/\/ Hamlet may be the nearest point, but it's a part of a City. So use the divide factor\n        \/\/ for distance, according to feature type.\n        return (d \/ m_checker.GetLocalityDivideFactor(types));\n      }\n    }\n    virtual double NeedProcess(feature::TypesHolder const & types) const\n    {\n      if (m_doLocalities)\n        return (types.GetGeoType() == feature::GEOM_POINT && m_checker.IsLocality(types));\n      else\n        return DoGetFeatureInfoBase::NeedProcess(types);\n    }\n\n  public:\n    DoGetAddressInfo(m2::PointD const & pt, double eps, int scale,\n                     TypeChecker const & checker)\n      : DoGetFeatureInfoBase(pt, eps, scale),\n        m_checker(checker), m_doLocalities(false)\n    {\n    }\n\n    void PrepareForLocalities()\n    {\n      m_doLocalities = true;\n      m_cont.clear();\n    }\n\n    void FillAddress(Framework::AddressInfo & info)\n    {\n      SortResults();\n\n      for (size_t i = 0; i < m_cont.size(); ++i)\n      {\n        bool const isStreet = m_checker.IsStreet(m_cont[i].m_types);\n        \/\/bool const isBuilding = m_checker.IsBuilding(m_cont[i].m_types);\n\n        if (info.m_street.empty() && isStreet)\n          info.m_street = m_cont[i].m_name;\n\n        \/\/if (info.m_house.empty() && isBuilding)\n        \/\/  info.m_house = m_cont[i].m_house;\n\n        if (info.m_name.empty())\n        {\n          if (m_cont[i].m_types.GetGeoType() != feature::GEOM_LINE)\n            info.m_name = m_cont[i].m_name;\n        }\n\n        if (!(info.m_street.empty() || info.m_name.empty()))\n          break;\n      }\n    }\n\n    void FillLocality(Framework::AddressInfo & info, Framework const & fm)\n    {\n      SortResults();\n      \/\/LOG(LDEBUG, (m_cont));\n\n      for (size_t i = 0; i < m_cont.size(); ++i)\n      {\n        if (!m_cont[i].m_name.empty() && fm.GetCountryName(m_cont[i].m_pt) == info.m_country)\n        {\n          info.m_city = m_cont[i].m_name;\n          break;\n        }\n      }\n    }\n  };\n}\n\nvoid Framework::GetAddressInfo(m2::PointD const & pt, AddressInfo & info) const\n{\n  info.m_country = GetCountryName(pt);\n  if (info.m_country.empty())\n  {\n    LOG(LINFO, (\"Can't find region for point \", pt));\n    return;\n  }\n\n  int const scale = scales::GetUpperScale();\n  double const addressR = 200.0;\n  double const localityR = 20000;\n\n  static DoGetAddressInfo::TypeChecker checker;\n\n  \/\/ first of all - get an address\n  {\n    DoGetAddressInfo getAddress(pt, addressR, scale, checker);\n\n    m_model.ForEachFeature(\n          MercatorBounds::RectByCenterXYAndSizeInMeters(pt, addressR), getAddress, scale);\n\n    getAddress.FillAddress(info);\n  }\n\n  \/\/ now - get the locality\n  {\n    DoGetAddressInfo getLocality(pt, localityR, scale, checker);\n    getLocality.PrepareForLocalities();\n\n    m_model.ForEachFeature(\n          MercatorBounds::RectByCenterXYAndSizeInMeters(pt, localityR), getLocality, scale);\n\n    getLocality.FillLocality(info, *this);\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, Jean-Francois Doyon\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\/\/$Id: mapnik_parameters.cpp 17 2005-03-08 23:58:43Z pavlenko $\n\n#include <boost\/python.hpp>\n#include <boost\/python\/detail\/api_placeholder.hpp>\n#include <mapnik\/params.hpp>\n\nusing mapnik::parameter;\nusing mapnik::parameters;\n\nstruct parameter_pickle_suite : boost::python::pickle_suite\n{\n    static boost::python::tuple\n    getinitargs(const parameter& p)\n    {\n        using namespace boost::python;\n        return boost::python::make_tuple(p.first,p.second);\n    }\n};\n\nstruct parameters_pickle_suite : boost::python::pickle_suite\n{\n    static boost::python::tuple\n    getstate(const parameters& p)\n    {\n        using namespace boost::python;\n        dict d;\n        parameters::const_iterator pos=p.begin();\n        while(pos!=p.end())\n        {\n            d[pos->first]=pos->second;\n            ++pos;\n        }\n        return boost::python::make_tuple(d);\n    }\n\n    static void setstate(parameters& p, boost::python::tuple state)\n    {\n        using namespace boost::python;\n        if (len(state) != 1)\n        {\n            PyErr_SetObject(PyExc_ValueError,\n\t\t\t    (\"expected 1-item tuple in call to __setstate__; got %s\"\n\t\t\t     % state).ptr()\n\t\t\t    );\n            throw_error_already_set();\n        }\n        dict d = extract<dict>(state[0]);\n        boost::python::list keys=d.keys();\n        for (int i=0;i<len(keys);++i)\n        {\n            std::string key=extract<std::string>(keys[i]);\n            std::string value=extract<std::string>(d[key]); \/\/ FIXME: use boost::variant as a value object. Add Py_Int\/Py_Float\/Py_String extractors. \n            p[key] = value;\n        }\n    }\n};\n\n\nvoid export_parameters()\n{\n    using namespace boost::python;\n    class_<parameter>(\"Parameter\",init<std::string,std::string>())\n        .def_pickle(parameter_pickle_suite())\n        ;\n\n    class_<parameters>(\"Parameters\",init<>())\n        .def_pickle(parameters_pickle_suite())\n        ;\n}\n<commit_msg>+expose parameters as python list and dict, and add pickle support by taking advantage of boost visitation - needs further review - see #345<commit_after>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko, Jean-Francois Doyon\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\/\/$Id: mapnik_parameters.cpp 17 2005-03-08 23:58:43Z pavlenko $\n\n\/\/ boost\n#include <boost\/python.hpp>\n\n\/\/ mapnik\n#include <mapnik\/params.hpp>\n\nusing mapnik::parameter;\nusing mapnik::parameters;\n\nstruct pickle_value : public boost::static_visitor<>\n{\n    public:\n        pickle_value( boost::python::list vals): \n        vals_(vals) {}\n            \n        void operator () ( int val )\n        {\n            vals_.append(val);\n        }\n        \n        void operator () ( double val )\n        {\n            vals_.append(val);\n        }\n\n        void operator () ( std::string val )\n        {\n            vals_.append(val);\n        }\n        \n    private:\n        boost::python::list vals_;\n\n};\n\nstruct parameter_pickle_suite : boost::python::pickle_suite\n{\n    static boost::python::tuple\n    getinitargs(const parameter& p)\n    {\n        using namespace boost::python;\n        return boost::python::make_tuple(p.first,boost::get<std::string>(p.second));\n    }\n};\n\nstruct parameters_pickle_suite : boost::python::pickle_suite\n{\n    static boost::python::tuple\n    getstate(const parameters& p)\n    {\n        using namespace boost::python;\n        dict d;\n        parameters::const_iterator pos=p.begin();\n        while(pos!=p.end())\n        {\n            boost::python::list vals;\n            pickle_value serializer( vals );\n            mapnik::value_holder val = pos->second;\n            boost::apply_visitor( serializer, val );\n            d[pos->first] = vals[0];\n            ++pos;\n        }\n        return boost::python::make_tuple(d);\n    }\n\n    static void setstate(parameters& p, boost::python::tuple state)\n    {\n        using namespace boost::python;\n        if (len(state) != 1)\n        {\n            PyErr_SetObject(PyExc_ValueError,\n\t\t\t    (\"expected 1-item tuple in call to __setstate__; got %s\"\n\t\t\t     % state).ptr()\n\t\t\t    );\n            throw_error_already_set();\n        }\n        \n        dict d = extract<dict>(state[0]);\n        boost::python::list keys = d.keys();\n        for (int i=0; i<len(keys); ++i)\n        {\n            std::string key = extract<std::string>(keys[i]);\n            object obj = d[key];\n            extract<std::string> ex0(obj);\n            extract<int> ex1(obj);\n            extract<double> ex2(obj);\n            \n            if (ex0.check())\n            {\n               p[key] = ex0();\n            }\n            else if (ex1.check())\n            {\n               p[key] = ex1();\n            }\n            else if (ex2.check())\n            {\n               p[key] = ex2();\n            }           \n            \n            \/*\n            extract_value serializer( p, key );\n            mapnik::value_holder val = extract<mapnik::value_holder>(d[key]);\n            boost::apply_visitor( serializer, val );\n            *\/\n        }        \n    }\n};\n\nboost::python::dict dict_params(parameters& p)\n{\n    boost::python::dict d;\n    parameters::const_iterator pos=p.begin();\n    while(pos!=p.end())\n    {\n        boost::python::list vals;\n        pickle_value serializer( vals );\n        mapnik::value_holder val = pos->second;\n        boost::apply_visitor( serializer, val );\n        d[pos->first] = vals[0];\n        ++pos;\n    }\n    return d;\n}\n\nboost::python::list list_params(parameters& p)\n{\n    boost::python::list l;\n    parameters::const_iterator pos=p.begin();\n    while(pos!=p.end())\n    {\n        boost::python::list vals;\n        pickle_value serializer( vals );\n        mapnik::value_holder val = pos->second;\n        boost::apply_visitor( serializer, val );\n        l.append(boost::python::make_tuple(pos->first,vals[0]));\n        ++pos;\n    }\n    return l;\n}\n\nboost::python::dict dict_param(parameter& p)\n{\n    boost::python::dict d;\n    d[p.first] = boost::get<std::string>(p.second);\n    return d;\n}\n\nboost::python::tuple tuple_param(parameter& p)\n{\n    return boost::python::make_tuple(p.first,boost::get<std::string>(p.second));\n}\n\nvoid export_parameters()\n{\n    using namespace boost::python;\n    class_<parameter>(\"Parameter\",init<std::string,std::string>())\n        .def_pickle(parameter_pickle_suite())\n        .def(\"as_dict\",dict_param)\n        .def(\"as_tuple\",tuple_param)\n        ;\n\n    class_<parameters>(\"Parameters\",init<>())\n        .def_pickle(parameters_pickle_suite())\n        .def(\"as_dict\",dict_params)\n        .def(\"as_list\",list_params)\n        ;\n}<|endoftext|>"}
{"text":"<commit_before>\/*ckwg +5\n * Copyright 2011 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 \"layered_image_reader_process.h\"\n\n#include <processes\/helpers\/image\/format.h>\n#include <processes\/helpers\/image\/read.h>\n\n#include <vistk\/utilities\/path.h>\n\n#include <vistk\/pipeline\/config.h>\n#include <vistk\/pipeline\/datum.h>\n#include <vistk\/pipeline\/process_exception.h>\n#include <vistk\/pipeline\/stamp.h>\n\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/format.hpp>\n#include <boost\/make_shared.hpp>\n\n#include <string>\n\n\/**\n * \\file layered_image_reader_process.cxx\n *\n * \\brief Implementation of the layered image reader process.\n *\/\n\nnamespace vistk\n{\n\nclass layered_image_reader_process::priv\n{\n  public:\n    priv(config::value_t const& fmt, uint64_t offset_, read_func_t func, port_type_t const& port_type);\n    ~priv();\n\n    typedef boost::basic_format<config::value_t::value_type> format_t;\n\n    typedef port_t layer_t;\n    typedef std::vector<layer_t> layers_t;\n\n    format_t format;\n    read_func_t const read;\n    port_type_t const port_type_output;\n\n    layers_t layers;\n    uint64_t frame;\n\n    static config::key_t const config_pixtype;\n    static config::key_t const config_pixfmt;\n    static config::key_t const config_format;\n    static config::key_t const config_offset;\n    static config::value_t const default_pixtype;\n    static config::value_t const default_pixfmt;\n    static config::value_t const default_format;\n    static config::value_t const default_offset;\n    static port_t const port_image_prefix;\n};\n\nconfig::key_t const layered_image_reader_process::priv::config_pixtype = config::key_t(\"pixtype\");\nconfig::key_t const layered_image_reader_process::priv::config_pixfmt = config::key_t(\"pixfmt\");\nconfig::key_t const layered_image_reader_process::priv::config_format = config::key_t(\"format\");\nconfig::key_t const layered_image_reader_process::priv::config_offset = config::key_t(\"offset\");\nconfig::value_t const layered_image_reader_process::priv::default_pixtype = config::value_t(pixtypes::pixtype_byte());\nconfig::value_t const layered_image_reader_process::priv::default_pixfmt = config::value_t(pixfmts::pixfmt_rgb());\nconfig::value_t const layered_image_reader_process::priv::default_format = config::value_t(\"image-%1%-%2%.png\");\nconfig::value_t const layered_image_reader_process::priv::default_offset = config::value_t(\"0\");\nprocess::port_t const layered_image_reader_process::priv::port_image_prefix = process::port_t(\"image\/\");\n\nlayered_image_reader_process\n::layered_image_reader_process(config_t const& config)\n  : process(config)\n{\n  \/\/\/ \\todo There should probably be timestamp input rather than manually keeping track of the frame.\n\n  declare_configuration_key(priv::config_pixtype, boost::make_shared<conf_info>(\n    priv::default_pixtype,\n    config::description_t(\"The pixel type of the input images.\")));\n  declare_configuration_key(priv::config_pixfmt, boost::make_shared<conf_info>(\n    priv::default_pixfmt,\n    config::description_t(\"The pixel format of the input images.\")));\n  declare_configuration_key(priv::config_format, boost::make_shared<conf_info>(\n    priv::default_format,\n    config::description_t(\"The format string for the input layers.\")));\n  declare_configuration_key(priv::config_offset, boost::make_shared<conf_info>(\n    priv::default_offset,\n    config::description_t(\"The frame number to start reading.\")));\n}\n\nlayered_image_reader_process\n::~layered_image_reader_process()\n{\n}\n\nvoid\nlayered_image_reader_process\n::_init()\n{\n  \/\/ Configure the process.\n  {\n    pixtype_t const pixtype = config_value<pixtype_t>(priv::config_pixtype);\n    pixfmt_t const pixfmt = config_value<pixfmt_t>(priv::config_pixfmt);\n    config::value_t const format = config_value<config::value_t>(priv::config_format);\n    uint64_t const offset = config_value<uint64_t>(priv::config_offset);\n\n    port_type_t const port_type = port_type_for_pixtype(pixtype, pixfmt);\n    read_func_t const func = read_for_pixtype(pixtype);\n\n    d.reset(new priv(format, offset, func, port_type));\n  }\n\n  if (!d->read)\n  {\n    static std::string const reason = \"A read function for the \"\n                                      \"given pixtype could not be found\";\n\n    throw invalid_configuration_exception(name(), reason);\n  }\n\n  process::_init();\n}\n\nvoid\nlayered_image_reader_process\n::_step()\n{\n  BOOST_FOREACH (priv::layer_t const& layer, d->layers)\n  {\n    d->format.clear();\n\n    try\n    {\n      d->format % layer;\n      d->format % d->frame;\n    }\n    catch (boost::io::format_error&)\n    {\n    }\n\n    path_t const path = boost::str(d->format);\n\n    datum_t const dat = d->read(path);\n\n    push_datum_to_port(priv::port_image_prefix + layer, dat);\n  }\n\n  ++d->frame;\n\n  process::_step();\n}\n\nprocess::port_info_t\nlayered_image_reader_process\n::_output_port_info(port_t const& port)\n{\n  if (boost::starts_with(port, priv::port_image_prefix))\n  {\n    priv::layer_t const layer = port.substr(priv::port_image_prefix.size());\n\n    priv::layers_t::const_iterator const i = std::find(d->layers.begin(), d->layers.end(), layer);\n\n    if (i == d->layers.end())\n    {\n      d->layers.push_back(layer);\n\n      port_flags_t required;\n\n      required.insert(flag_required);\n\n      declare_output_port(port, boost::make_shared<port_info>(\n        d->port_type_output,\n        required,\n        port_description_t(\"The \\'\" + layer + \"\\' layer of the image.\")));\n    }\n  }\n\n  return process::_output_port_info(port);\n}\n\nlayered_image_reader_process::priv\n::priv(config::value_t const& fmt, uint64_t offset_, read_func_t func, port_type_t const& port_type)\n  : format(fmt)\n  , read(func)\n  , port_type_output(port_type)\n  , frame(offset_)\n{\n}\n\nlayered_image_reader_process::priv\n::~priv()\n{\n}\n\n}\n<commit_msg>Get a timestamp to know what mask to read<commit_after>\/*ckwg +5\n * Copyright 2011 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 \"layered_image_reader_process.h\"\n\n#include <processes\/helpers\/image\/format.h>\n#include <processes\/helpers\/image\/read.h>\n\n#include <vistk\/utilities\/timestamp.h>\n#include <vistk\/utilities\/path.h>\n\n#include <vistk\/pipeline\/config.h>\n#include <vistk\/pipeline\/datum.h>\n#include <vistk\/pipeline\/process_exception.h>\n#include <vistk\/pipeline\/stamp.h>\n\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/format.hpp>\n#include <boost\/make_shared.hpp>\n\n#include <string>\n\n\/**\n * \\file layered_image_reader_process.cxx\n *\n * \\brief Implementation of the layered image reader process.\n *\/\n\nnamespace vistk\n{\n\nclass layered_image_reader_process::priv\n{\n  public:\n    priv(config::value_t const& fmt, read_func_t func, port_type_t const& port_type);\n    ~priv();\n\n    typedef boost::basic_format<config::value_t::value_type> format_t;\n\n    typedef port_t layer_t;\n    typedef std::vector<layer_t> layers_t;\n\n    format_t format;\n    read_func_t const read;\n    port_type_t const port_type_output;\n\n    layers_t layers;\n\n    static config::key_t const config_pixtype;\n    static config::key_t const config_pixfmt;\n    static config::key_t const config_format;\n    static config::value_t const default_pixtype;\n    static config::value_t const default_pixfmt;\n    static config::value_t const default_format;\n    static port_t const port_timestamp;\n    static port_t const port_image_prefix;\n};\n\nconfig::key_t const layered_image_reader_process::priv::config_pixtype = config::key_t(\"pixtype\");\nconfig::key_t const layered_image_reader_process::priv::config_pixfmt = config::key_t(\"pixfmt\");\nconfig::key_t const layered_image_reader_process::priv::config_format = config::key_t(\"format\");\nconfig::value_t const layered_image_reader_process::priv::default_pixtype = config::value_t(pixtypes::pixtype_byte());\nconfig::value_t const layered_image_reader_process::priv::default_pixfmt = config::value_t(pixfmts::pixfmt_rgb());\nconfig::value_t const layered_image_reader_process::priv::default_format = config::value_t(\"image-%1%-%2%.png\");\nprocess::port_t const layered_image_reader_process::priv::port_timestamp = process::port_t(\"timestamp\");\nprocess::port_t const layered_image_reader_process::priv::port_image_prefix = process::port_t(\"image\/\");\n\nlayered_image_reader_process\n::layered_image_reader_process(config_t const& config)\n  : process(config)\n{\n  \/\/\/ \\todo There should probably be timestamp input rather than manually keeping track of the frame.\n\n  declare_configuration_key(priv::config_pixtype, boost::make_shared<conf_info>(\n    priv::default_pixtype,\n    config::description_t(\"The pixel type of the input images.\")));\n  declare_configuration_key(priv::config_pixfmt, boost::make_shared<conf_info>(\n    priv::default_pixfmt,\n    config::description_t(\"The pixel format of the input images.\")));\n  declare_configuration_key(priv::config_format, boost::make_shared<conf_info>(\n    priv::default_format,\n    config::description_t(\"The format string for the input layers.\")));\n\n  port_flags_t required;\n\n  required.insert(flag_required);\n\n  declare_input_port(priv::port_timestamp, boost::make_shared<port_info>(\n    \"timestamp\",\n    required,\n    port_description_t(\"The timestamp to use when reading masks.\")));\n}\n\nlayered_image_reader_process\n::~layered_image_reader_process()\n{\n}\n\nvoid\nlayered_image_reader_process\n::_init()\n{\n  \/\/ Configure the process.\n  {\n    pixtype_t const pixtype = config_value<pixtype_t>(priv::config_pixtype);\n    pixfmt_t const pixfmt = config_value<pixfmt_t>(priv::config_pixfmt);\n    config::value_t const format = config_value<config::value_t>(priv::config_format);\n\n    port_type_t const port_type = port_type_for_pixtype(pixtype, pixfmt);\n    read_func_t const func = read_for_pixtype(pixtype);\n\n    d.reset(new priv(format, func, port_type));\n  }\n\n  if (!d->read)\n  {\n    static std::string const reason = \"A read function for the \"\n                                      \"given pixtype could not be found\";\n\n    throw invalid_configuration_exception(name(), reason);\n  }\n\n  process::_init();\n}\n\nvoid\nlayered_image_reader_process\n::_step()\n{\n  timestamp const ts = grab_from_port_as<timestamp>(priv::port_timestamp);\n\n  BOOST_FOREACH (priv::layer_t const& layer, d->layers)\n  {\n    d->format.clear();\n\n    try\n    {\n      d->format % layer;\n      d->format % ts.frame();\n    }\n    catch (boost::io::format_error&)\n    {\n    }\n\n    path_t const path = boost::str(d->format);\n\n    datum_t const dat = d->read(path);\n\n    push_datum_to_port(priv::port_image_prefix + layer, dat);\n  }\n\n  process::_step();\n}\n\nprocess::port_info_t\nlayered_image_reader_process\n::_output_port_info(port_t const& port)\n{\n  if (boost::starts_with(port, priv::port_image_prefix))\n  {\n    priv::layer_t const layer = port.substr(priv::port_image_prefix.size());\n\n    priv::layers_t::const_iterator const i = std::find(d->layers.begin(), d->layers.end(), layer);\n\n    if (i == d->layers.end())\n    {\n      d->layers.push_back(layer);\n\n      port_flags_t required;\n\n      required.insert(flag_required);\n\n      declare_output_port(port, boost::make_shared<port_info>(\n        d->port_type_output,\n        required,\n        port_description_t(\"The \\'\" + layer + \"\\' layer of the image.\")));\n    }\n  }\n\n  return process::_output_port_info(port);\n}\n\nlayered_image_reader_process::priv\n::priv(config::value_t const& fmt, read_func_t func, port_type_t const& port_type)\n  : format(fmt)\n  , read(func)\n  , port_type_output(port_type)\n{\n}\n\nlayered_image_reader_process::priv\n::~priv()\n{\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"BleuDocScorer.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <climits>\n#include <fstream>\n#include <iostream>\n#include <stdexcept>\n\n#include \"util\/check.hh\"\n#include \"Ngram.h\"\n#include \"Reference.h\"\n#include \"Util.h\"\n#include \"Vocabulary.h\"\n\n\nusing namespace std;\n\nnamespace\n{\n\n\/\/ configure regularisation\nconst char KEY_REFLEN[] = \"reflen\";\nconst char REFLEN_AVERAGE[] = \"average\";\nconst char REFLEN_SHORTEST[] = \"shortest\";\nconst char REFLEN_CLOSEST[] = \"closest\";\n\n} \/\/ namespace\n\nnamespace MosesTuning\n{\n  \n\nBleuDocScorer::BleuDocScorer(const string& config)\n    : BleuScorer(\"BLEUDOC\", config),\n      m_ref_length_type(CLOSEST)\n{\n  const string reflen = getConfig(KEY_REFLEN, REFLEN_CLOSEST);\n  if (reflen == REFLEN_AVERAGE) {\n    m_ref_length_type = AVERAGE;\n  } else if (reflen == REFLEN_SHORTEST) {\n    m_ref_length_type = SHORTEST;\n  } else if (reflen == REFLEN_CLOSEST) {\n    m_ref_length_type = CLOSEST;\n  } else {\n    throw runtime_error(\"Unknown reference length strategy: \" + reflen);\n  }\n}\n\nBleuDocScorer::~BleuDocScorer() {}\n\n\nbool BleuDocScorer::OpenReferenceStream(istream* is, size_t file_id)\n{\n  if (is == NULL) return false;\n\n  string line;\n  size_t doc_id = -1;\n  size_t sid = 0;\n  while (getline(*is, line)) {\n\n    if (line.find(\"<doc docid\") != std::string::npos) {  \/\/ new document\n      doc_id++;\n      m_references.push_back(new ScopedVector<Reference>()); \n      sid = 0;\n    }\n    else if (line.find(\"<seg\") != std::string::npos) {  \/\/new sentence\n      int start = line.find_first_of('>') + 1;\n      std::string trans = line.substr(start, line.find_last_of('<')-start);\n      trans = preprocessSentence(trans);\n\n      if (file_id == 0) {\n\t\t  Reference* ref = new Reference;\n\t\t  m_references[doc_id]->push_back(ref);    \/\/ Take ownership of the Reference object.\n      }\n\n      if (m_references[doc_id]->size() <= sid) {\n      \treturn false;\n      }\n      NgramCounts counts;\n      size_t length = CountNgrams(trans, counts, kBleuNgramOrder);\n      \n      \/\/for any counts larger than those already there, merge them in\n      for (NgramCounts::const_iterator ci = counts.begin(); ci != counts.end(); ++ci) {\n\t\t  const NgramCounts::Key& ngram = ci->first;\n\t\t  const NgramCounts::Value newcount = ci->second;\n\t\n\t\t  NgramCounts::Value oldcount = 0;\n\t\t  m_references[doc_id]->get().at(sid)->get_counts()->Lookup(ngram, &oldcount);\n\t\t  if (newcount > oldcount) {\n\t\t\t  m_references[doc_id]->get().at(sid)->get_counts()->operator[](ngram) = newcount;\n\t\t  }\n      }\n      \/\/add in the length\n\n\t  m_references[doc_id]->get().at(sid)->push_back(length);\n      if (sid > 0 && sid % 100 == 0) {\n\t\t  TRACE_ERR(\".\");\n      }\n      ++sid;\n    }\n  }\n  return true;\n}\n\nvoid BleuDocScorer::prepareStats(size_t sid, const string& text, ScoreStats& entry)\n{\n  if (sid >= m_references.size()) {\n    stringstream msg;\n    msg << \"Sentence id (\" << sid << \") not found in reference set\";\n    throw runtime_error(msg.str());\n  }\n\n  std::vector<std::string> sentences = splitDoc(text);\n\n  vector<ScoreStatsType> totStats(kBleuNgramOrder * 2 + 1);\n\n  for (uint i=0; i<sentences.size(); ++i) {\n\n    NgramCounts testcounts;\n    \/\/ stats for this line\n    vector<ScoreStatsType> stats(kBleuNgramOrder * 2);\n    string sentence = preprocessSentence(sentences[i]);\n    const size_t length = CountNgrams(sentence, testcounts, kBleuNgramOrder);\n\n    \/\/precision on each ngram type\n    for (NgramCounts::const_iterator testcounts_it = testcounts.begin();\n\t testcounts_it != testcounts.end(); ++testcounts_it) {\n      const NgramCounts::Value guess = testcounts_it->second;\n      const size_t len = testcounts_it->first.size();\n      NgramCounts::Value correct = 0;\n    \n      NgramCounts::Value v = 0;\n      if (m_references[sid]->get().at(i)->get_counts()->Lookup(testcounts_it->first, &v)) {\n\tcorrect = min(v, guess);\n      }\n      stats[len * 2 - 2] += correct;\n      stats[len * 2 - 1] += guess;\n    }\n\n    const int reference_len = CalcReferenceLength(sid, i, length);\n    stats.push_back(reference_len);\n\n    \/\/ADD stats to totStats \n    std::transform(stats.begin(), stats.end(), totStats.begin(), \n\t\t   totStats.begin(), std::plus<int>());\n  }\n  entry.set(totStats); \n}\n  \nstd::vector<std::string> BleuDocScorer::splitDoc(const std::string& text)\n{\n  std::vector<std::string> res;\n\n  uint index = 0;\n  std::string::size_type end;\n\n  while ((end = text.find(\" \\\\n \", index)) != std::string::npos) {\n    res.push_back(text.substr(index,end-index));\n    index = end + 4;\n  }\n  return res;\n}\n\nstatscore_t BleuDocScorer::calculateScore(const vector<int>& comps) const\n{\n  CHECK(comps.size() == kBleuNgramOrder * 2 + 1);\n\n  float logbleu = 0.0;\n  for (int i = 0; i < kBleuNgramOrder; ++i) {\n    if (comps[2*i] == 0) {\n      return 0.0;\n    }\n    logbleu += log(comps[2*i]) - log(comps[2*i+1]);\n\n  }\n  logbleu \/= kBleuNgramOrder;\n  \/\/ reflength divided by test length\n  const float brevity = 1.0 - static_cast<float>(comps[kBleuNgramOrder * 2]) \/ comps[1];\n  if (brevity < 0.0) {\n    logbleu += brevity;\n  }\n  return exp(logbleu);\n}\n\nint BleuDocScorer::CalcReferenceLength(size_t doc_id, size_t sentence_id, size_t length)\n{\n  switch (m_ref_length_type) {\n    case AVERAGE:\n      return m_references[doc_id]->get().at(sentence_id)->CalcAverage();\n      break;\n    case CLOSEST:\n      return m_references[doc_id]->get().at(sentence_id)->CalcClosest(length);\n      break;\n    case SHORTEST:\n      return m_references[doc_id]->get().at(sentence_id)->CalcShortest();\n      break;\n    default:\n      cerr << \"unknown reference types.\" << endl;\n      exit(1);\n  }\n}\n\n}\n\n<commit_msg>mac compile<commit_after>#include \"BleuDocScorer.h\"\n\n#include <sys\/types.h>\n#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <climits>\n#include <fstream>\n#include <iostream>\n#include <stdexcept>\n\n#include \"util\/check.hh\"\n#include \"Ngram.h\"\n#include \"Reference.h\"\n#include \"Util.h\"\n#include \"Vocabulary.h\"\n\n\nusing namespace std;\n\nnamespace\n{\n\n\/\/ configure regularisation\nconst char KEY_REFLEN[] = \"reflen\";\nconst char REFLEN_AVERAGE[] = \"average\";\nconst char REFLEN_SHORTEST[] = \"shortest\";\nconst char REFLEN_CLOSEST[] = \"closest\";\n\n} \/\/ namespace\n\nnamespace MosesTuning\n{\n  \n\nBleuDocScorer::BleuDocScorer(const string& config)\n    : BleuScorer(\"BLEUDOC\", config),\n      m_ref_length_type(CLOSEST)\n{\n  const string reflen = getConfig(KEY_REFLEN, REFLEN_CLOSEST);\n  if (reflen == REFLEN_AVERAGE) {\n    m_ref_length_type = AVERAGE;\n  } else if (reflen == REFLEN_SHORTEST) {\n    m_ref_length_type = SHORTEST;\n  } else if (reflen == REFLEN_CLOSEST) {\n    m_ref_length_type = CLOSEST;\n  } else {\n    throw runtime_error(\"Unknown reference length strategy: \" + reflen);\n  }\n}\n\nBleuDocScorer::~BleuDocScorer() {}\n\n\nbool BleuDocScorer::OpenReferenceStream(istream* is, size_t file_id)\n{\n  if (is == NULL) return false;\n\n  string line;\n  size_t doc_id = -1;\n  size_t sid = 0;\n  while (getline(*is, line)) {\n\n    if (line.find(\"<doc docid\") != std::string::npos) {  \/\/ new document\n      doc_id++;\n      m_references.push_back(new ScopedVector<Reference>()); \n      sid = 0;\n    }\n    else if (line.find(\"<seg\") != std::string::npos) {  \/\/new sentence\n      int start = line.find_first_of('>') + 1;\n      std::string trans = line.substr(start, line.find_last_of('<')-start);\n      trans = preprocessSentence(trans);\n\n      if (file_id == 0) {\n\t\t  Reference* ref = new Reference;\n\t\t  m_references[doc_id]->push_back(ref);    \/\/ Take ownership of the Reference object.\n      }\n\n      if (m_references[doc_id]->size() <= sid) {\n      \treturn false;\n      }\n      NgramCounts counts;\n      size_t length = CountNgrams(trans, counts, kBleuNgramOrder);\n      \n      \/\/for any counts larger than those already there, merge them in\n      for (NgramCounts::const_iterator ci = counts.begin(); ci != counts.end(); ++ci) {\n\t\t  const NgramCounts::Key& ngram = ci->first;\n\t\t  const NgramCounts::Value newcount = ci->second;\n\t\n\t\t  NgramCounts::Value oldcount = 0;\n\t\t  m_references[doc_id]->get().at(sid)->get_counts()->Lookup(ngram, &oldcount);\n\t\t  if (newcount > oldcount) {\n\t\t\t  m_references[doc_id]->get().at(sid)->get_counts()->operator[](ngram) = newcount;\n\t\t  }\n      }\n      \/\/add in the length\n\n\t  m_references[doc_id]->get().at(sid)->push_back(length);\n      if (sid > 0 && sid % 100 == 0) {\n\t\t  TRACE_ERR(\".\");\n      }\n      ++sid;\n    }\n  }\n  return true;\n}\n\nvoid BleuDocScorer::prepareStats(size_t sid, const string& text, ScoreStats& entry)\n{\n  if (sid >= m_references.size()) {\n    stringstream msg;\n    msg << \"Sentence id (\" << sid << \") not found in reference set\";\n    throw runtime_error(msg.str());\n  }\n\n  std::vector<std::string> sentences = splitDoc(text);\n\n  vector<ScoreStatsType> totStats(kBleuNgramOrder * 2 + 1);\n\n  for (uint i=0; i<sentences.size(); ++i) {\n\n    NgramCounts testcounts;\n    \/\/ stats for this line\n    vector<ScoreStatsType> stats(kBleuNgramOrder * 2);\n    string sentence = preprocessSentence(sentences[i]);\n    const size_t length = CountNgrams(sentence, testcounts, kBleuNgramOrder);\n\n    \/\/precision on each ngram type\n    for (NgramCounts::const_iterator testcounts_it = testcounts.begin();\n\t testcounts_it != testcounts.end(); ++testcounts_it) {\n      const NgramCounts::Value guess = testcounts_it->second;\n      const size_t len = testcounts_it->first.size();\n      NgramCounts::Value correct = 0;\n    \n      NgramCounts::Value v = 0;\n      if (m_references[sid]->get().at(i)->get_counts()->Lookup(testcounts_it->first, &v)) {\n\tcorrect = min(v, guess);\n      }\n      stats[len * 2 - 2] += correct;\n      stats[len * 2 - 1] += guess;\n    }\n\n    const int reference_len = CalcReferenceLength(sid, i, length);\n    stats.push_back(reference_len);\n\n    \/\/ADD stats to totStats \n    std::transform(stats.begin(), stats.end(), totStats.begin(), \n\t\t   totStats.begin(), std::plus<int>());\n  }\n  entry.set(totStats); \n}\n  \nstd::vector<std::string> BleuDocScorer::splitDoc(const std::string& text)\n{\n  std::vector<std::string> res;\n\n  uint index = 0;\n  std::string::size_type end;\n\n  while ((end = text.find(\" \\\\n \", index)) != std::string::npos) {\n    res.push_back(text.substr(index,end-index));\n    index = end + 4;\n  }\n  return res;\n}\n\nstatscore_t BleuDocScorer::calculateScore(const vector<int>& comps) const\n{\n  CHECK(comps.size() == kBleuNgramOrder * 2 + 1);\n\n  float logbleu = 0.0;\n  for (int i = 0; i < kBleuNgramOrder; ++i) {\n    if (comps[2*i] == 0) {\n      return 0.0;\n    }\n    logbleu += log(comps[2*i]) - log(comps[2*i+1]);\n\n  }\n  logbleu \/= kBleuNgramOrder;\n  \/\/ reflength divided by test length\n  const float brevity = 1.0 - static_cast<float>(comps[kBleuNgramOrder * 2]) \/ comps[1];\n  if (brevity < 0.0) {\n    logbleu += brevity;\n  }\n  return exp(logbleu);\n}\n\nint BleuDocScorer::CalcReferenceLength(size_t doc_id, size_t sentence_id, size_t length)\n{\n  switch (m_ref_length_type) {\n    case AVERAGE:\n      return m_references[doc_id]->get().at(sentence_id)->CalcAverage();\n      break;\n    case CLOSEST:\n      return m_references[doc_id]->get().at(sentence_id)->CalcClosest(length);\n      break;\n    case SHORTEST:\n      return m_references[doc_id]->get().at(sentence_id)->CalcShortest();\n      break;\n    default:\n      cerr << \"unknown reference types.\" << endl;\n      exit(1);\n  }\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n<commit_msg>Delete 1.cpp<commit_after><|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 MIDDLEWARE_PARSLEY_HPP\n#define MIDDLEWARE_PARSLEY_HPP\n\n#include \"json.hpp\"\n#include \"middleware.hpp\"\n\nnamespace middleware {\n\n\/**\n * @brief A vegan way to parse JSON Content in a response\n * @details TBC..\n *\n *\/\nclass Parsley : public server::Middleware {\npublic:\n\n  virtual void process(server::Request_ptr req, server::Response_ptr, server::Next next) override;\n\nprivate:\n\n  bool has_json(server::Request_ptr req) const;\n};\n\ninline void process(server::Request_ptr req, server::Response_ptr, server::Next next) {\n  using namespace json;\n\n  if(not has_json(req)) return (*next)();\n\n  \/\/ Request doesn't have JSON attribute\n  if(not req->has_attribute<JsonDoc>()) {\n    \/\/ Create attribute\n    auto json = std::make_shared<JsonDoc>();\n\n    \/\/ Access the document and parse the body\n    json->doc().Parse(req->get_body().c_str());\n    printf(\"<Parsley> Parsed JSON data.\\n\");\n\n    \/\/ Add the json attribute to the request\n    req->set_attribute(json);\n  }\n\n  return (*next)();\n}\n\ninline bool has_json(server::Request_ptr req) const {\n  auto c_type = http::header_fields::Entity::Content_Type;\n  if(not req->has_header(c_type)) return false;\n  return (req->header_value(c_type).find(\"application\/json\") != std::string::npos);\n}\n\n} \/\/< namespace middleware\n\n#endif\n<commit_msg>Added API DOC comment blocks<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 MIDDLEWARE_PARSLEY_HPP\n#define MIDDLEWARE_PARSLEY_HPP\n\n#include \"json.hpp\"\n#include \"middleware.hpp\"\n\nnamespace middleware {\n\n\/**\n * @brief A vegan way to parse JSON Content in a response\n * @details TBC..\n *\n *\/\nclass Parsley : public server::Middleware {\npublic:\n\n  \/**\n   *\n   *\/\n  virtual void process(server::Request_ptr req, server::Response_ptr, server::Next next) override;\n\nprivate:\n\n  \/**\n   *\n   *\/\n  bool has_json(server::Request_ptr req) const;\n};\n\ninline void process(server::Request_ptr req, server::Response_ptr, server::Next next) {\n  using namespace json;\n\n  if(not has_json(req)) return (*next)();\n\n  \/\/ Request doesn't have JSON attribute\n  if(not req->has_attribute<JsonDoc>()) {\n    \/\/ Create attribute\n    auto json = std::make_shared<JsonDoc>();\n\n    \/\/ Access the document and parse the body\n    json->doc().Parse(req->get_body().c_str());\n    printf(\"<Parsley> Parsed JSON data.\\n\");\n\n    \/\/ Add the json attribute to the request\n    req->set_attribute(json);\n  }\n\n  return (*next)();\n}\n\ninline bool has_json(server::Request_ptr req) const {\n  auto c_type = http::header_fields::Entity::Content_Type;\n  if(not req->has_header(c_type)) return false;\n  return (req->header_value(c_type).find(\"application\/json\") != std::string::npos);\n}\n\n} \/\/< namespace middleware\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: sbintern.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: vg $ $Date: 2004-01-06 19:41: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#ifndef _SB_INTERN_HXX\n#define _SB_INTERN_HXX\n\n#include <svtools\/sbxfac.hxx>\n#ifndef _UNOTOOLS_TRANSLITERATIONWRAPPER_HXX\n#include <unotools\/transliterationwrapper.hxx>\n#endif\n#include \"sb.hxx\"\n\nclass ::utl::TransliterationWrapper;\nclass SbUnoFactory;\nclass SbiInstance;\nclass SbModule;\n\nclass SbiFactory : public SbxFactory\n{\npublic:\n    virtual SbxBase* Create( UINT16 nSbxId, UINT32 = SBXCR_SBX );\n    virtual SbxObject* CreateObject( const String& );\n};\n\n\/\/ Stack fuer die im Fehlerfall abgebaute SbiRuntime Kette\nclass SbErrorStackEntry\n{\npublic:\n    SbErrorStackEntry(SbMethodRef aM, xub_StrLen nL, xub_StrLen nC1, xub_StrLen nC2)\n        : aMethod(aM), nLine(nL), nCol1(nC1), nCol2(nC2) {}\n    SbMethodRef aMethod;\n    xub_StrLen nLine;\n    xub_StrLen nCol1, nCol2;\n};\n\nSV_DECL_PTRARR_DEL(SbErrorStack, SbErrorStackEntry*, 1, 1)\n\n\n\nstruct SbiGlobals\n{\n    SbiInstance*    pInst;          \/\/ alle aktiven Runtime-Instanzen\n    SbiFactory*     pSbFac;         \/\/ StarBASIC-Factory\n    SbUnoFactory*   pUnoFac;        \/\/ Factory fuer Uno-Structs bei DIM AS NEW\n    SbModule*       pMod;           \/\/ aktuell aktives Modul\n    SbModule*       pCompMod;       \/\/ aktuell compiliertes Modul\n    short           nInst;          \/\/ Anzahl BASICs\n    Link            aErrHdl;        \/\/ globaler Error-Handler\n    Link            aBreakHdl;      \/\/ globaler Break-Handler\n    SbError         nCode;          \/\/ aktueller Fehlercode\n    xub_StrLen      nLine;          \/\/ aktuelle Zeile\n    xub_StrLen      nCol1,nCol2;    \/\/ aktuelle Spalten (von,bis)\n    BOOL            bCompiler;      \/\/ Flag fuer Compiler-Error\n    BOOL            bGlobalInitErr; \/\/ Beim GlobalInit trat ein Compiler-Fehler auf\n    BOOL            bRunInit;       \/\/ TRUE, wenn RunInit vom Basic aktiv ist\n    String          aErrMsg;        \/\/ Puffer fuer GetErrorText()\n    SbLanguageMode  eLanguageMode;  \/\/ Flag fuer Visual-Basic-Script-Modus\n    SbErrorStack*   pErrStack;      \/\/ Stack fuer die im Fehlerfall abgebaute SbiRuntime Kette\n    ::utl::TransliterationWrapper* pTransliterationWrapper;    \/\/ For StrComp\n    BOOL            bBlockCompilerError;\n\n    SbiGlobals();\n    ~SbiGlobals();\n};\n\n\/\/ Utility-Makros und -Routinen\n\nSbiGlobals* GetSbData();\n\n#define pINST       GetSbData()->pInst\n#define pMOD        GetSbData()->pMod\n#define pCMOD       GetSbData()->pCompMod\n#define pSBFAC      GetSbData()->pSbFac\n#define pUNOFAC     GetSbData()->pUnoFac\n\n#endif\n\n<commit_msg>INTEGRATION: CWS jl5vba (1.4.6); FILE MERGED 2004\/01\/21 09:24:39 ab 1.4.6.1: #111934# Merge to src680, for tasks see message INTEGRATION: CWS ab02vba (1.3.22)<commit_after>\/*************************************************************************\n *\n *  $RCSfile: sbintern.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2004-03-17 13:34: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 _SB_INTERN_HXX\n#define _SB_INTERN_HXX\n\n#include <svtools\/sbxfac.hxx>\n#ifndef _UNOTOOLS_TRANSLITERATIONWRAPPER_HXX\n#include <unotools\/transliterationwrapper.hxx>\n#endif\n#include \"sb.hxx\"\n\nclass ::utl::TransliterationWrapper;\nclass SbUnoFactory;\nclass SbTypeFactory;\nclass SbOLEFactory;\nclass SbiInstance;\nclass SbModule;\n\nclass SbiFactory : public SbxFactory\n{\npublic:\n    virtual SbxBase* Create( UINT16 nSbxId, UINT32 = SBXCR_SBX );\n    virtual SbxObject* CreateObject( const String& );\n};\n\n\/\/ Stack fuer die im Fehlerfall abgebaute SbiRuntime Kette\nclass SbErrorStackEntry\n{\npublic:\n    SbErrorStackEntry(SbMethodRef aM, xub_StrLen nL, xub_StrLen nC1, xub_StrLen nC2)\n        : aMethod(aM), nLine(nL), nCol1(nC1), nCol2(nC2) {}\n    SbMethodRef aMethod;\n    xub_StrLen nLine;\n    xub_StrLen nCol1, nCol2;\n};\n\nSV_DECL_PTRARR_DEL(SbErrorStack, SbErrorStackEntry*, 1, 1)\n\n\n\nstruct SbiGlobals\n{\n    SbiInstance*    pInst;          \/\/ alle aktiven Runtime-Instanzen\n    SbiFactory*     pSbFac;         \/\/ StarBASIC-Factory\n    SbUnoFactory*   pUnoFac;        \/\/ Factory fuer Uno-Structs bei DIM AS NEW\n    SbTypeFactory*  pTypeFac;       \/\/ Factory for user defined types\n    SbOLEFactory*   pOLEFac;        \/\/ Factory for OLE types\n    SbModule*       pMod;           \/\/ aktuell aktives Modul\n    SbModule*       pCompMod;       \/\/ aktuell compiliertes Modul\n    short           nInst;          \/\/ Anzahl BASICs\n    Link            aErrHdl;        \/\/ globaler Error-Handler\n    Link            aBreakHdl;      \/\/ globaler Break-Handler\n    SbError         nCode;          \/\/ aktueller Fehlercode\n    xub_StrLen      nLine;          \/\/ aktuelle Zeile\n    xub_StrLen      nCol1,nCol2;    \/\/ aktuelle Spalten (von,bis)\n    BOOL            bCompiler;      \/\/ Flag fuer Compiler-Error\n    BOOL            bGlobalInitErr; \/\/ Beim GlobalInit trat ein Compiler-Fehler auf\n    BOOL            bRunInit;       \/\/ TRUE, wenn RunInit vom Basic aktiv ist\n    String          aErrMsg;        \/\/ Puffer fuer GetErrorText()\n    SbLanguageMode  eLanguageMode;  \/\/ Flag fuer Visual-Basic-Script-Modus\n    SbErrorStack*   pErrStack;      \/\/ Stack fuer die im Fehlerfall abgebaute SbiRuntime Kette\n    ::utl::TransliterationWrapper* pTransliterationWrapper;    \/\/ For StrComp\n    BOOL            bBlockCompilerError;\n\n    SbiGlobals();\n    ~SbiGlobals();\n};\n\n\/\/ Utility-Makros und -Routinen\n\nSbiGlobals* GetSbData();\n\n#define pINST       GetSbData()->pInst\n#define pMOD        GetSbData()->pMod\n#define pCMOD       GetSbData()->pCompMod\n#define pSBFAC      GetSbData()->pSbFac\n#define pUNOFAC     GetSbData()->pUnoFac\n#define pTYPEFAC    GetSbData()->pTypeFac\n#define pOLEFAC     GetSbData()->pOLEFac\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n#include <iostream>\n#include <memory>\n\n#include \"sodium.h\"\n\n#include \"samplePacket.hpp\"\n#include \"stateMachine.hpp\"\n\nunion tsc_t {\n\tuint64_t tsc_64;\n\tstruct {\n\t\tuint32_t lo_32;\n\t\tuint32_t hi_32;\n\t};\n};\n\ninline static uint64_t read_rdtsc() {\n\tunion tsc_t tsc;\n\tasm volatile(\"RDTSC\\n\\t\"\n\t\t\t\t \"mov %%edx, %0\\n\\t\"\n\t\t\t\t \"mov %%eax, %1\\n\\t\"\n\t\t\t\t : \"=r\"(tsc.hi_32), \"=r\"(tsc.lo_32)::\"%rax\", \"%rbx\", \"%rcx\", \"%rdx\");\n\treturn tsc.tsc_64;\n}\n\nusing namespace std;\n\nclass Identifier;\nusing SM = StateMachine<Identifier, SamplePacket>;\n\n\/\/ This is a very elemental Identifier class\nclass Identifier {\npublic:\n\tstruct ConnectionID {\n\t\tuint64_t val;\n\n\t\tbool operator==(const ConnectionID &c) const { return val == c.val; }\n\n\t\tbool operator<(const ConnectionID &c) const { return val < c.val; }\n\n\t\toperator std::string() const { return \"\"; }\n\n\t\tConnectionID(const ConnectionID &c) : val(c.val){};\n\t\tConnectionID() : val(0){};\n\t};\n\n\tstruct Hasher {\n\t\tsize_t operator()(const ConnectionID &id) const {\n\t\t\tuint64_t res;\n\t\t\tassert(crypto_shorthash_BYTES == 8);\n\t\t\tuint8_t key[crypto_shorthash_KEYBYTES];\n\t\t\tmemset(key, 0, crypto_shorthash_KEYBYTES);\n\t\t\tcrypto_shorthash(reinterpret_cast<uint8_t *>(&res),\n\t\t\t\treinterpret_cast<const uint8_t *>(&id.val), sizeof(id.val), key);\n\n\t\t\treturn res;\n\t\t}\n\t};\n\n\tstatic ConnectionID identify(SamplePacket *pkt) {\n\t\tConnectionID id;\n\t\tid.val = (uint64_t)pkt->getData();\n\t\treturn id;\n\t};\n};\n\n\/\/ This just mallocs one SamplePacket\nSamplePacket *getPkt() {\n\tuint32_t dataLen = 64;\n\tvoid *data = malloc(dataLen);\n\tSamplePacket *p = new SamplePacket(data, dataLen);\n\treturn p;\n}\n\n\/\/ This is the function for state 1\nvoid fun1(SM::State &state, SamplePacket *pktIn, SM::FunIface &fi) {\n\n\tDEBUG_ENABLED(cout << endl << \"running fun1\" << endl;)\n\n\t\/\/ Sanity check -> this should never to true\n\tDEBUG_ENABLED(if (state.state != 1) { cout << \"fun1: state not 1\" << endl; })\n\n\t\/\/ if pktIn == 2 -> transition to state 2 and fill packet with 12\n\tif (*(reinterpret_cast<uint32_t *>(pktIn->getData())) == 2) {\n\t\tDEBUG_ENABLED(cout << \"fun1: transision to state 2\" << endl;)\n\t\tfi.transition(2);\n\t\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 12;\n\t\treturn;\n\t}\n\n\t\/\/ if pktIn == 3 -> transition to state 3 and fill packet with 13\n\tif (*(reinterpret_cast<uint32_t *>(pktIn->getData())) == 3) {\n\t\tDEBUG_ENABLED(cout << \"fun1: transision to state 3\" << endl;)\n\t\tfi.transition(3);\n\t\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 13;\n\t\treturn;\n\t}\n\n\tDEBUG_ENABLED(cout << \"fun1: no transision\" << endl;)\n\n\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 10;\n}\n\n\/\/ This is the function for state 2\n\/\/ Pretty much the same as state 1...\nvoid fun2(SM::State &state, SamplePacket *pktIn, SM::FunIface &fi) {\n\tDEBUG_ENABLED(cout << endl << \"running fun2\" << endl;)\n\n\tDEBUG_ENABLED(if (state.state != 2) { cout << \"fun2: state not 2\" << endl; })\n\n\tif (*(reinterpret_cast<uint32_t *>(pktIn->getData())) == 3) {\n\t\tDEBUG_ENABLED(cout << \"fun2: transision to state 3\" << endl;)\n\t\tfi.transition(3);\n\t\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 23;\n\t\treturn;\n\t}\n\n\tDEBUG_ENABLED(cout << \"fun2: no transision\" << endl;)\n\n\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 24;\n}\n\nvoid usage(std::string progName) {\n\tstd::cout << \"Usage: \" << progName << \" <Num States>\" << std::endl;\n\tstd::exit(0);\n}\n\nint main(int argc, char **argv) {\n\n\tif (argc < 2) {\n\t\tusage(std::string(argv[0]));\n\t}\n\n\tunsigned int numStates = atoi(argv[1]);\n\tuint64_t startTimer, stopTimer;\n\n\ttry {\n\n\t\tSM sm;\n\n\t\t\/\/ All incoming connections start at state 1, and don't require preparation\n\t\tsm.registerStartStateID(1, nullptr);\n\n\t\t\/\/ Every connection is state 3 should be deleted\n\t\tsm.registerEndStateID(3);\n\n\t\t\/\/ Register the functions to handle packets for these states\n\t\tsm.registerFunction(1, fun1);\n\t\tsm.registerFunction(2, fun2);\n\n\t\t\/\/ Setup sanity check\n\t\tassert(sm.getStateTableSize() == 0);\n\n\t\t\/\/ Prepare the packet array\n\t\tSamplePacket **spArray =\n\t\t\treinterpret_cast<SamplePacket **>(malloc(numStates * sizeof(void *)));\n\t\tfor (unsigned int i = 0; i < numStates; i++) {\n\t\t\tspArray[i] = getPkt();\n\t\t}\n\n\t\t\/\/ Prepare one BufArray\n\t\tBufArray<SamplePacket> pktsIn(spArray, numStates);\n\n\t\t\/\/ Set data in input packets to 0\n\t\tfor (unsigned int i = 0; i < numStates; i++) {\n\t\t\t*(reinterpret_cast<uint32_t *>(pktsIn[i]->getData())) = 0;\n\t\t}\n\n\t\t\/\/ Run the packet through the state machine\n\t\tstartTimer = read_rdtsc();\n\t\tsm.runPktBatch(pktsIn);\n\t\tstopTimer = read_rdtsc();\n\t\tstd::cout << \"Insertion: \" << stopTimer - startTimer << std::endl;\n\n\t\t\/\/ Run packets through SM\n\t\tstartTimer = read_rdtsc();\n\t\tsm.runPktBatch(pktsIn);\n\t\tstopTimer = read_rdtsc();\n\t\tstd::cout << \"Run: \" << stopTimer - startTimer << std::endl;\n\n\t} catch (exception *e) {\n\t\t\/\/ Just catch whatever fails there may be\n\t\tcout << endl << \"FATAL:\" << endl;\n\t\tcout << e->what() << endl;\n\n\t\treturn 1;\n\t}\n\n\treturn 0;\n}\n<commit_msg>fix benchmarks\/stateTableSize.cpp for sparsehash<commit_after>#include <cassert>\n#include <iostream>\n#include <limits>\n#include <memory>\n\n#include \"sodium.h\"\n\n#include \"samplePacket.hpp\"\n#include \"stateMachine.hpp\"\n\nunion tsc_t {\n\tuint64_t tsc_64;\n\tstruct {\n\t\tuint32_t lo_32;\n\t\tuint32_t hi_32;\n\t};\n};\n\ninline static uint64_t read_rdtsc() {\n\tunion tsc_t tsc;\n\tasm volatile(\"RDTSC\\n\\t\"\n\t\t\t\t \"mov %%edx, %0\\n\\t\"\n\t\t\t\t \"mov %%eax, %1\\n\\t\"\n\t\t\t\t : \"=r\"(tsc.hi_32), \"=r\"(tsc.lo_32)::\"%rax\", \"%rbx\", \"%rcx\", \"%rdx\");\n\treturn tsc.tsc_64;\n}\n\nusing namespace std;\n\nclass Identifier;\nusing SM = StateMachine<Identifier, SamplePacket>;\n\n\/\/ This is a very elemental Identifier class\nclass Identifier {\npublic:\n\tstruct ConnectionID {\n\t\tuint64_t val;\n\n\t\tbool operator==(const ConnectionID &c) const { return val == c.val; }\n\n\t\tbool operator<(const ConnectionID &c) const { return val < c.val; }\n\n\t\toperator std::string() const { return \"\"; }\n\n\t\tConnectionID(const ConnectionID &c) : val(c.val){};\n\t\tConnectionID() : val(0){};\n\t\tConnectionID(uint64_t val) : val(val){};\n\t};\n\n\tstatic struct ConnectionID getDelKey() {\n\t\treturn ConnectionID(std::numeric_limits<uint64_t>::max());\n\t};\n\n\tstatic struct ConnectionID getEmptyKey() {\n\t\treturn ConnectionID(std::numeric_limits<uint64_t>::max() - 1);\n\t};\n\n\tstruct Hasher {\n\t\tsize_t operator()(const ConnectionID &id) const {\n\t\t\tuint64_t res;\n\t\t\tassert(crypto_shorthash_BYTES == 8);\n\t\t\tuint8_t key[crypto_shorthash_KEYBYTES];\n\t\t\tmemset(key, 0, crypto_shorthash_KEYBYTES);\n\t\t\tcrypto_shorthash(reinterpret_cast<uint8_t *>(&res),\n\t\t\t\treinterpret_cast<const uint8_t *>(&id.val), sizeof(id.val), key);\n\n\t\t\treturn res;\n\t\t}\n\t};\n\n\tstatic ConnectionID identify(SamplePacket *pkt) {\n\t\tConnectionID id;\n\t\tid.val = (uint64_t)pkt->getData();\n\t\treturn id;\n\t};\n};\n\n\/\/ This just mallocs one SamplePacket\nSamplePacket *getPkt() {\n\tuint32_t dataLen = 64;\n\tvoid *data = malloc(dataLen);\n\tSamplePacket *p = new SamplePacket(data, dataLen);\n\treturn p;\n}\n\n\/\/ This is the function for state 1\nvoid fun1(SM::State &state, SamplePacket *pktIn, SM::FunIface &fi) {\n\n\tDEBUG_ENABLED(cout << endl << \"running fun1\" << endl;)\n\n\t\/\/ Sanity check -> this should never to true\n\tDEBUG_ENABLED(if (state.state != 1) { cout << \"fun1: state not 1\" << endl; })\n\n\t\/\/ if pktIn == 2 -> transition to state 2 and fill packet with 12\n\tif (*(reinterpret_cast<uint32_t *>(pktIn->getData())) == 2) {\n\t\tDEBUG_ENABLED(cout << \"fun1: transision to state 2\" << endl;)\n\t\tfi.transition(2);\n\t\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 12;\n\t\treturn;\n\t}\n\n\t\/\/ if pktIn == 3 -> transition to state 3 and fill packet with 13\n\tif (*(reinterpret_cast<uint32_t *>(pktIn->getData())) == 3) {\n\t\tDEBUG_ENABLED(cout << \"fun1: transision to state 3\" << endl;)\n\t\tfi.transition(3);\n\t\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 13;\n\t\treturn;\n\t}\n\n\tDEBUG_ENABLED(cout << \"fun1: no transision\" << endl;)\n\n\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 10;\n}\n\n\/\/ This is the function for state 2\n\/\/ Pretty much the same as state 1...\nvoid fun2(SM::State &state, SamplePacket *pktIn, SM::FunIface &fi) {\n\tDEBUG_ENABLED(cout << endl << \"running fun2\" << endl;)\n\n\tDEBUG_ENABLED(if (state.state != 2) { cout << \"fun2: state not 2\" << endl; })\n\n\tif (*(reinterpret_cast<uint32_t *>(pktIn->getData())) == 3) {\n\t\tDEBUG_ENABLED(cout << \"fun2: transision to state 3\" << endl;)\n\t\tfi.transition(3);\n\t\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 23;\n\t\treturn;\n\t}\n\n\tDEBUG_ENABLED(cout << \"fun2: no transision\" << endl;)\n\n\t*(reinterpret_cast<uint32_t *>(pktIn->getData())) = 24;\n}\n\nvoid usage(std::string progName) {\n\tstd::cout << \"Usage: \" << progName << \" <Num States>\" << std::endl;\n\tstd::exit(0);\n}\n\nint main(int argc, char **argv) {\n\n\tif (argc < 2) {\n\t\tusage(std::string(argv[0]));\n\t}\n\n\tunsigned int numStates = atoi(argv[1]);\n\tuint64_t startTimer, stopTimer;\n\n\ttry {\n\n\t\tSM sm;\n\n\t\t\/\/ All incoming connections start at state 1, and don't require preparation\n\t\tsm.registerStartStateID(1, nullptr);\n\n\t\t\/\/ Every connection is state 3 should be deleted\n\t\tsm.registerEndStateID(3);\n\n\t\t\/\/ Register the functions to handle packets for these states\n\t\tsm.registerFunction(1, fun1);\n\t\tsm.registerFunction(2, fun2);\n\n\t\t\/\/ Setup sanity check\n\t\tassert(sm.getStateTableSize() == 0);\n\n\t\t\/\/ Prepare the packet array\n\t\tSamplePacket **spArray =\n\t\t\treinterpret_cast<SamplePacket **>(malloc(numStates * sizeof(void *)));\n\t\tfor (unsigned int i = 0; i < numStates; i++) {\n\t\t\tspArray[i] = getPkt();\n\t\t}\n\n\t\t\/\/ Prepare one BufArray\n\t\tBufArray<SamplePacket> pktsIn(spArray, numStates);\n\n\t\t\/\/ Set data in input packets to 0\n\t\tfor (unsigned int i = 0; i < numStates; i++) {\n\t\t\t*(reinterpret_cast<uint32_t *>(pktsIn[i]->getData())) = 0;\n\t\t}\n\n\t\t\/\/ Run the packet through the state machine\n\t\tstartTimer = read_rdtsc();\n\t\tsm.runPktBatch(pktsIn);\n\t\tstopTimer = read_rdtsc();\n\t\tstd::cout << \"Insertion: \" << stopTimer - startTimer << std::endl;\n\n\t\t\/\/ Run packets through SM\n\t\tstartTimer = read_rdtsc();\n\t\tsm.runPktBatch(pktsIn);\n\t\tstopTimer = read_rdtsc();\n\t\tstd::cout << \"Run: \" << stopTimer - startTimer << std::endl;\n\n\t} catch (exception *e) {\n\t\t\/\/ Just catch whatever fails there may be\n\t\tcout << endl << \"FATAL:\" << endl;\n\t\tcout << e->what() << endl;\n\n\t\treturn 1;\n\t}\n\n\treturn 0;\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 \"chrome\/common\/notification_service.h\"\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/thread_local.h\"\n\nstatic base::LazyInstance<base::ThreadLocalPointer<NotificationService> >\n    lazy_tls_ptr(base::LINKER_INITIALIZED);\n\n\/\/ static\nNotificationService* NotificationService::current() {\n  return lazy_tls_ptr.Pointer()->Get();\n}\n\n\/\/ static\nbool NotificationService::HasKey(const NotificationSourceMap& map,\n                                 const NotificationSource& source) {\n  return map.find(source.map_key()) != map.end();\n}\n\nNotificationService::NotificationService() {\n  DCHECK(current() == NULL);\n#ifndef NDEBUG\n  memset(observer_counts_, 0, sizeof(observer_counts_));\n#endif\n\n  lazy_tls_ptr.Pointer()->Set(this);\n}\n\nvoid NotificationService::AddObserver(NotificationObserver* observer,\n                                      NotificationType type,\n                                      const NotificationSource& source) {\n  DCHECK(type.value < NotificationType::NOTIFICATION_TYPE_COUNT);\n\n  \/\/ We have gotten some crashes where the observer pointer is NULL. The problem\n  \/\/ is that this happens when we actually execute a notification, so have no\n  \/\/ way of knowing who the bad observer was. We want to know when this happens\n  \/\/ in release mode so we know what code to blame the crash on (since this is\n  \/\/ guaranteed to crash later).\n  CHECK(observer);\n\n  NotificationObserverList* observer_list;\n  if (HasKey(observers_[type.value], source)) {\n    observer_list = observers_[type.value][source.map_key()];\n  } else {\n    observer_list = new NotificationObserverList;\n    observers_[type.value][source.map_key()] = observer_list;\n  }\n\n  observer_list->AddObserver(observer);\n#ifndef NDEBUG\n  ++observer_counts_[type.value];\n#endif\n}\n\nvoid NotificationService::RemoveObserver(NotificationObserver* observer,\n                                         NotificationType type,\n                                         const NotificationSource& source) {\n  DCHECK(type.value < NotificationType::NOTIFICATION_TYPE_COUNT);\n  DCHECK(HasKey(observers_[type.value], source));\n\n  NotificationObserverList* observer_list =\n      observers_[type.value][source.map_key()];\n  if (observer_list) {\n    observer_list->RemoveObserver(observer);\n#ifndef NDEBUG\n    --observer_counts_[type.value];\n#endif\n  }\n\n  \/\/ TODO(jhughes): Remove observer list from map if empty?\n}\n\nvoid NotificationService::Notify(NotificationType type,\n                                 const NotificationSource& source,\n                                 const NotificationDetails& details) {\n  DCHECK(type.value > NotificationType::ALL) <<\n      \"Allowed for observing, but not posting.\";\n  DCHECK(type.value < NotificationType::NOTIFICATION_TYPE_COUNT);\n\n  \/\/ There's no particular reason for the order in which the different\n  \/\/ classes of observers get notified here.\n\n  \/\/ Notify observers of all types and all sources\n  if (HasKey(observers_[NotificationType::ALL], AllSources()) &&\n      source != AllSources()) {\n    FOR_EACH_OBSERVER(NotificationObserver,\n       *observers_[NotificationType::ALL][AllSources().map_key()],\n       Observe(type, source, details));\n  }\n\n  \/\/ Notify observers of all types and the given source\n  if (HasKey(observers_[NotificationType::ALL], source)) {\n    FOR_EACH_OBSERVER(NotificationObserver,\n        *observers_[NotificationType::ALL][source.map_key()],\n        Observe(type, source, details));\n  }\n\n  \/\/ Notify observers of the given type and all sources\n  if (HasKey(observers_[type.value], AllSources()) &&\n      source != AllSources()) {\n    FOR_EACH_OBSERVER(NotificationObserver,\n                      *observers_[type.value][AllSources().map_key()],\n                      Observe(type, source, details));\n  }\n\n  \/\/ Notify observers of the given type and the given source\n  if (HasKey(observers_[type.value], source)) {\n    FOR_EACH_OBSERVER(NotificationObserver,\n                      *observers_[type.value][source.map_key()],\n                      Observe(type, source, details));\n  }\n}\n\n\nNotificationService::~NotificationService() {\n  lazy_tls_ptr.Pointer()->Set(NULL);\n\n#ifndef NDEBUG\n  for (int i = 0; i < NotificationType::NOTIFICATION_TYPE_COUNT; i++) {\n    if (observer_counts_[i] > 0) {\n      \/\/ This may not be completely fixable -- see\n      \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=11010 .\n      \/\/ But any new leaks should be fixed.\n      LOG(WARNING) << observer_counts_[i] << \" notification observer(s) leaked\"\n          << \" of notification type \" << i;\n    }\n  }\n#endif\n\n  for (int i = 0; i < NotificationType::NOTIFICATION_TYPE_COUNT; i++) {\n    NotificationSourceMap omap = observers_[i];\n    for (NotificationSourceMap::iterator it = omap.begin();\n         it != omap.end(); ++it) {\n      delete it->second;\n    }\n  }\n}\n\nNotificationObserver::~NotificationObserver() {}\n<commit_msg>Make NotificationObserver leaks into LOG(INFO).<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 \"chrome\/common\/notification_service.h\"\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/thread_local.h\"\n\nstatic base::LazyInstance<base::ThreadLocalPointer<NotificationService> >\n    lazy_tls_ptr(base::LINKER_INITIALIZED);\n\n\/\/ static\nNotificationService* NotificationService::current() {\n  return lazy_tls_ptr.Pointer()->Get();\n}\n\n\/\/ static\nbool NotificationService::HasKey(const NotificationSourceMap& map,\n                                 const NotificationSource& source) {\n  return map.find(source.map_key()) != map.end();\n}\n\nNotificationService::NotificationService() {\n  DCHECK(current() == NULL);\n#ifndef NDEBUG\n  memset(observer_counts_, 0, sizeof(observer_counts_));\n#endif\n\n  lazy_tls_ptr.Pointer()->Set(this);\n}\n\nvoid NotificationService::AddObserver(NotificationObserver* observer,\n                                      NotificationType type,\n                                      const NotificationSource& source) {\n  DCHECK(type.value < NotificationType::NOTIFICATION_TYPE_COUNT);\n\n  \/\/ We have gotten some crashes where the observer pointer is NULL. The problem\n  \/\/ is that this happens when we actually execute a notification, so have no\n  \/\/ way of knowing who the bad observer was. We want to know when this happens\n  \/\/ in release mode so we know what code to blame the crash on (since this is\n  \/\/ guaranteed to crash later).\n  CHECK(observer);\n\n  NotificationObserverList* observer_list;\n  if (HasKey(observers_[type.value], source)) {\n    observer_list = observers_[type.value][source.map_key()];\n  } else {\n    observer_list = new NotificationObserverList;\n    observers_[type.value][source.map_key()] = observer_list;\n  }\n\n  observer_list->AddObserver(observer);\n#ifndef NDEBUG\n  ++observer_counts_[type.value];\n#endif\n}\n\nvoid NotificationService::RemoveObserver(NotificationObserver* observer,\n                                         NotificationType type,\n                                         const NotificationSource& source) {\n  DCHECK(type.value < NotificationType::NOTIFICATION_TYPE_COUNT);\n  DCHECK(HasKey(observers_[type.value], source));\n\n  NotificationObserverList* observer_list =\n      observers_[type.value][source.map_key()];\n  if (observer_list) {\n    observer_list->RemoveObserver(observer);\n#ifndef NDEBUG\n    --observer_counts_[type.value];\n#endif\n  }\n\n  \/\/ TODO(jhughes): Remove observer list from map if empty?\n}\n\nvoid NotificationService::Notify(NotificationType type,\n                                 const NotificationSource& source,\n                                 const NotificationDetails& details) {\n  DCHECK(type.value > NotificationType::ALL) <<\n      \"Allowed for observing, but not posting.\";\n  DCHECK(type.value < NotificationType::NOTIFICATION_TYPE_COUNT);\n\n  \/\/ There's no particular reason for the order in which the different\n  \/\/ classes of observers get notified here.\n\n  \/\/ Notify observers of all types and all sources\n  if (HasKey(observers_[NotificationType::ALL], AllSources()) &&\n      source != AllSources()) {\n    FOR_EACH_OBSERVER(NotificationObserver,\n       *observers_[NotificationType::ALL][AllSources().map_key()],\n       Observe(type, source, details));\n  }\n\n  \/\/ Notify observers of all types and the given source\n  if (HasKey(observers_[NotificationType::ALL], source)) {\n    FOR_EACH_OBSERVER(NotificationObserver,\n        *observers_[NotificationType::ALL][source.map_key()],\n        Observe(type, source, details));\n  }\n\n  \/\/ Notify observers of the given type and all sources\n  if (HasKey(observers_[type.value], AllSources()) &&\n      source != AllSources()) {\n    FOR_EACH_OBSERVER(NotificationObserver,\n                      *observers_[type.value][AllSources().map_key()],\n                      Observe(type, source, details));\n  }\n\n  \/\/ Notify observers of the given type and the given source\n  if (HasKey(observers_[type.value], source)) {\n    FOR_EACH_OBSERVER(NotificationObserver,\n                      *observers_[type.value][source.map_key()],\n                      Observe(type, source, details));\n  }\n}\n\n\nNotificationService::~NotificationService() {\n  lazy_tls_ptr.Pointer()->Set(NULL);\n\n#ifndef NDEBUG\n  for (int i = 0; i < NotificationType::NOTIFICATION_TYPE_COUNT; i++) {\n    if (observer_counts_[i] > 0) {\n      \/\/ This may not be completely fixable -- see\n      \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=11010 .\n      \/\/ But any new leaks should be fixed.\n      LOG(INFO) << observer_counts_[i] << \" notification observer(s) leaked\"\n          << \" of notification type \" << i;\n    }\n  }\n#endif\n\n  for (int i = 0; i < NotificationType::NOTIFICATION_TYPE_COUNT; i++) {\n    NotificationSourceMap omap = observers_[i];\n    for (NotificationSourceMap::iterator it = omap.begin();\n         it != omap.end(); ++it) {\n      delete it->second;\n    }\n  }\n}\n\nNotificationObserver::~NotificationObserver() {}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\nCopyright (c) 2017 InversePalindrome\r\nVariadicPoker - Deck.hpp\r\nInversePalindrome.com\r\n*\/\r\n\r\n\r\n#pragma once\r\n#include <list>\r\n#include <algorithm>\r\n#include \"Card.hpp\"\r\n\r\n\r\nclass Deck\r\n{\r\npublic:\r\n\tDeck();\r\n\tDeck(const std::list<Card>& deck);\r\n\r\n\tstd::list<Card> getDeck() const;\r\n\t\r\n\tvoid setDeck(const std::list<Card>& deck);\r\n\r\n\tvoid shuffle() const;\r\n\tCard removeCard() const;\r\n\tCard removeCard(const Card& card) const;\r\n\tvoid addCard(const Card& card) const;\r\n\r\nprivate:\r\n\tstd::list<Card> deck;\r\n};<commit_msg>Delete Deck.hpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <act-common\/common.h>\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Critical Macrodefinitions ========================\n\/\/ ========================================================================\n\n\n\n\n\/*\n * FOSC = 1MHz is confugured via Flash Fuses CKSEL=1 and SUT=2.\n *\/\n\n#define BAUD_RATE    4800    \/\/ 4.8kbps\n#define FOSC         1000000 \/\/ 1MHz\n#define TC2_PRESCALE 1       \/\/ no Timer\/Counter2 prescale\n\n\n\n#include <act-photo\/usart.h>\n#include <act-photo\/pwm.h>\n\n\n\n#define REMUX(c) ADMUX = (3<<REFS0)|(1<<ADLAR)|(c<<MUX0)\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Initialization ===================================\n\/\/ ========================================================================\n\n\n\n\ninline __monitor void init()\n{\n    \/* USART initialization *\/\n    usart_init();\n    \/* Timer\/Counter2 initialization *\/\n    init_tc2_wg();\n    \/* ADC initialization (1\/8 prescaling,\n       1st channel, internal Vref, left alignment) *\/\n    REMUX(0);\n    ADCSR = (1<<ADEN)|(3<<ADPS0);\n    \n    \/* Pin configuration *\/\n    PORTB = (1<<PORTB0)|(1<<PORTB1)|(1<<PORTB2)|\n            (0<<PORTB3)|(1<<PORTB4)|(1<<PORTB5)|\n            (1<<PORTB6)|(1<<PORTB7);\n    DDRB = (0<<DDB0)|(0<<DDB1)|(0<<DDB2)|\n           (1<<DDB3)|(0<<DDB4)|(0<<DDB5)|\n           (0<<DDB6)|(0<<DDB7);\n    PORTC = (0<<PORTC0)|(0<<PORTC1)|(1<<PORTC2)|\n            (1<<PORTC3)|(1<<PORTC4)|(1<<PORTC5)|\n            (1<<PORTC6);\n    DDRC = (0<<DDC0)|(0<<DDC1)|(0<<DDC2)|\n           (0<<DDC3)|(0<<DDC4)|(0<<DDC5)|\n           (0<<DDC6);\n    PORTD = (0<<PORTD0)|(0<<PORTD1)|(1<<PORTD2)|\n            (1<<PORTD3)|(1<<PORTD4)|(1<<PORTD5)|\n            (1<<PORTD6)|(1<<PORTD7);\n    DDRD = (0<<DDD0)|(1<<DDD1)|(0<<DDD2)|\n           (0<<DDD3)|(0<<DDD4)|(0<<DDD5)|\n           (0<<DDD6)|(0<<DDD7);\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Common Variables =================================\n\/\/ ========================================================================\n\n\n\n\/*\n * #40 <bug> <enchancement>\n *\n *     Modify coefficient format.\n *\n * Let C = one of { KP KI KS }.\n *\n *     C * x = (M * x) >> d\n *\n * Since ATMega8 does not support floating point operations,\n * and just (x << d) or (x >> d) cannot provide precise regulation.\n *\/\n\n\nunsigned int kp_m = 0; byte kp_d = 0;   \/* proportional factor *\/\nunsigned int ki_m = 0; byte ki_d = 0;   \/* integral factor     *\/\nunsigned int ks_m = 0; byte ks_d = 0;   \/* scale factor        *\/\n\n#define COEF(c, x) (((long) x) * (c##_m)) >> (c##_d)\n\nbool  pause  = false; \/* paused state                          *\/\nbool  sync   = false; \/* USART async\/sync transmit operation   *\/\n\nbyte  adc1, adc2;     \/* ADC 1st and 2nd channel               *\/\n\nint   int_err = 0;    \/* integral error                        *\/\nint   cur_err = 0;    \/* current error                         *\/\nint   pwm     = 0;    \/* PWM                                   *\/\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Message Loop Variables ===========================\n\/\/ ========================================================================\n\n\n\n\n\/*\n * #33 <enchancement>\n *\n *     Simplify IO protocol.\n *\n * The new protocol is user-friendly and quite simple.\n * The typical command starts with `METHOD`\n * (1 byte: `SET`, `GET`, `ECHO`, etc.). The next byte is\n * method-dependent. E.g. `VARIABLE` for `SET` and `GET`.\n * `SET` method also requires the variable value (1..any bytes)\n * to be set.\n *\n * COMMAND = METHOD [CONTENT]\n * METHOD = `SET` | `GET` | `ECHO` | BYTE\n * CONTENT = {\n *     METHOD=`SET`  => VARIABLE [DATA],\n *     METHOD=`GET`  => VARIABLE,\n *     METHOD=`ECHO` => BYTE,\n *     METHOD=BYTE   => any\n * }\n * VARIABLE = BYTE\n * DATA = any\n *\n * BYTE = 1 any byte\n * any = any bytes\n *\/\n\n\nbyte command_method;\nbool command_present = false;\nbyte command_variable;\nbool command_variable_present = false;\n\n\/*\n * #47 <enchancement>\n *\n *     Add `COEFS` variable and `PACKET` output format\n *     to support controller-gui tool.\n *\n * Data packet GET format is:\n *     <0 ADC1 ADC2 CUR_ERR INT_ERR PWM OCR2>\n * Coefficient packet SET format is:\n *     <KP KI KS>\n *\/\n\n#define METHOD_GET     (byte) 0\n#define METHOD_SET     (byte) 1\n#define METHOD_ECHO    (byte) 2\n\n\/\/ SET\n#define VAR_PAUSE      (byte) 0\n#define VAR_SYNC_USART (byte) 1\n#define VAR_KP         (byte) 2\n#define VAR_KI         (byte) 3\n#define VAR_KS         (byte) 4\n#define VAR_COEFS      (byte) 5\n\n\/\/ GET\n#define NO_OUTPUT      (byte) 0\n#define VAR_ADC1       (byte) 1\n#define VAR_ADC2       (byte) 2\n#define VAR_INT_ERR    (byte) 3\n#define VAR_CUR_ERR    (byte) 4\n#define VAR_PWM        (byte) 5\n#define VAR_OCR2       (byte) 6\n#define VAR_PACKET     (byte) 7\n\n\nbyte output_mode = NO_OUTPUT;\n\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Utility Functions ================================\n\/\/ ========================================================================\n\n\n\n\ninline byte transmit_all(byte * src, byte length)\n{\n    return iobuf_write < sp_process_full, lp_use_lock > (usart_obuf, src, length);\n}\n\ninline byte receive_all(byte * dst, byte length)\n{\n    return iobuf_read < sp_process_full, lp_use_lock > (dst, usart_ibuf, length);\n}\n\ninline byte receive(byte * dst)\n{\n    return iobuf_read < lp_use_lock > (*dst, usart_ibuf);\n}\n\n\nvoid send_all(byte *data, byte size)\n{\n    if (!sync)\n    {\n        transmit_all(data, size);\n    }\n    else\n    {\n        while (!transmit_all(data, size)) \/\/ wait in sync mode\n            ;\n    }\n}\n\n\nvoid send_byte(byte data)\n{\n    send_all(&data, 1);\n}\n\n\nvoid send_int(unsigned int data)\n{\n    byte hi_lo[2] = { (byte) (data >> 8), (byte) (data & 0xff) };\n    send_all(hi_lo, 2);\n}\n\n\nvoid send_packet(\/* byte adc1, byte adc2, int cur_err, int int_err, int pwm, byte OCR2 *\/)\n{\n    \/*\n     * #53 <enchancement>\n     *     Review the packet format.\n     *     \n     * The new packet format is < delimiter | data | checksum >,\n     * where checksum is calculated as delimiter ^ adc1 ^ (cerr & 0xff) ^ ocr2.\n     *\/\n    \n    byte packet[11] = {\n       103,\n       adc1,\n       adc2,\n       ((unsigned int) cur_err) >> 8, cur_err & 0xff,\n       ((unsigned int) int_err) >> 8, int_err & 0xff,\n       ((unsigned int) pwm) >> 8,     pwm     & 0xff,\n       OCR2\n    };\n    packet[10] = packet[0] ^ packet[1] ^ packet[4] ^ packet[9];\n    send_all(packet, 11);\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Command Processors ===============================\n\/\/ ========================================================================\n\n\n\n\n\nbool process_set_variable()\n{\n    byte packet[9];\n    switch(command_variable)\n    {\n    case VAR_PAUSE:\n        if (!receive(&packet[0])) return false; \/\/ wait for the value\n        pause = packet[0];\n        break;\n    case VAR_SYNC_USART:\n        if (!receive(packet)) return false; \/\/ wait for the value\n        sync = packet[0];\n        break;\n    case VAR_KP:\n        if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n        kp_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n        kp_d = packet[2];\n        break;\n    case VAR_KI:\n        if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n        ki_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n        ki_d = packet[2];\n        break;\n    case VAR_KS:\n        if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n        ks_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n        ks_d = packet[2];\n        break;\n    case VAR_COEFS:\n        if (!receive_all(packet, 9)) return false; \/\/ wait for the value\n        kp_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n        kp_d = packet[2];\n        ki_m = (((unsigned int) packet[3]) << 8) | (packet[4]);\n        ki_d = packet[5];\n        ks_m = (((unsigned int) packet[6]) << 8) | (packet[7]);\n        ks_d = packet[8];\n        break;\n    }\n    return true;\n}\n\n\nvoid process_command()\n{\n    byte echo_value;\n    switch(command_method)\n    {\n    case METHOD_ECHO:\n        if (!receive(&echo_value)) return; \/\/ wait for the value to send back\n        send_byte(echo_value);\n        break;\n    case METHOD_GET:\n        if (!receive(&output_mode)) return; \/\/ wait for the variable\n        break;\n    case METHOD_SET:\n        \/\/ wait for the variable\n        if (!command_variable_present)\n        {\n            if (!(command_variable_present = receive(&command_variable))) return;\n        }\n        if (!process_set_variable()) return; \/\/ wait for the argument(s)\n        break;\n    }\n    command_present = false;\n    command_variable_present = false;\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Program Logic ====================================\n\/\/ ========================================================================\n\n\n\n\n\nvoid do_computations()\n{\n    \/* Read ADC input *\/\n  \n    REMUX(0);                       \/* 1st ADC channel                    *\/\n    ADCSR |= (1 << ADSC);           \/* Initialize single-ended conversion *\/\n    while(!(ADCSR & (1 << ADIF)))   \/* Wait for the end of the conversion *\/\n      ;\n    adc1 = ADCH;                    \/* Read the 8-bit conversion result   *\/\n    ADCSR &= ~(1 << ADIF);          \/* Clear Conversion Complete flag     *\/\n    \n    REMUX(1);                       \/* 2nd ADC channel                    *\/\n    ADCSR |= (1 << ADSC);           \/* Initialize single-ended conversion *\/\n    while(!(ADCSR & (1 << ADIF)))   \/* Wait for the end of the conversion *\/\n      ;\n    adc2 = ADCH;                    \/* Read the 8-bit conversion result   *\/\n    ADCSR &= ~(1 << ADIF);          \/* Clear Conversion Complete flag     *\/\n    \n    \/* Calculate PWM width *\/\n    \n    \/*\n     * pwm = KP * e + KI * err\n     *\/\n    \n    cur_err = ((int)(adc2) - (int)(adc1));\n    \n    long p = COEF(kp, cur_err), q = COEF(ki, int_err);\n    if (ABS(p) > INT_MAX) p = ((p < 0) ? (INT_MIN) : (INT_MAX));\n    if (ABS(q) > INT_MAX) q = ((q < 0) ? (INT_MIN) : (INT_MAX));\n    pwm = safe_add((int) p, (int) q);\n    \n    int_err = safe_add(int_err, cur_err);\n    \n    \/* Setup PWM width *\/\n    \n    long t = COEF(ks, pwm) + INT_MAX;\n    if (ABS(t) > INT_MAX) t = ((p < 0) ? (INT_MIN) : (INT_MAX));\n    \n    OCR2 = (((unsigned int) t) + INT_MAX) >> 8;\n\n    \/* Report back *\/\n    \n    switch(output_mode)\n    {\n    case NO_OUTPUT:\n        break;\n    case VAR_ADC1:\n        send_byte(adc1);\n        break;\n    case VAR_ADC2:\n        send_byte(adc2);\n        break;\n    case VAR_INT_ERR:\n        send_int(int_err);\n        break;\n    case VAR_CUR_ERR:\n        send_int(cur_err);\n        break;\n    case VAR_PWM:\n        send_int(pwm);\n        break;\n    case VAR_OCR2:\n        send_byte(OCR2);\n        break;\n    case VAR_PACKET:\n        send_packet();\n        break;\n    }\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Program Entry Point ==============================\n\/\/ ========================================================================\n\n\n\n\n\nint main()\n{\n    \n    \/* Initialization here *\/\n    \n    \n    init();\n    \n    __enable_interrupt();\n    \n    \n    \/* Program Loop *\/\n    \n    \n    for(;;)\n    {\n        \n        \n        \/* Message Loop *\/\n        \n        \n        if (command_present)\n        {\n            process_command();\n        }\n        else\n        {\n            command_present = receive(&command_method);\n        }\n        \n        \n        \/* Program Body *\/\n        \n        \n        if (!pause)\n        {\n            do_computations();\n        }\n        \n        \n    }\n    \n    \n    return 0;\n}\n<commit_msg>\/mc\/controller common.h dlib support activated<commit_after>#define DLIB\n\n#include <act-common\/common.h>\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Critical Macrodefinitions ========================\n\/\/ ========================================================================\n\n\n\n\n\/*\n * FOSC = 1MHz is confugured via Flash Fuses CKSEL=1 and SUT=2.\n *\/\n\n#define BAUD_RATE    4800    \/\/ 4.8kbps\n#define FOSC         1000000 \/\/ 1MHz\n#define TC2_PRESCALE 1       \/\/ no Timer\/Counter2 prescale\n\n\n\n#include <act-photo\/usart.h>\n#include <act-photo\/pwm.h>\n\n\n\n#define REMUX(c) ADMUX = (3<<REFS0)|(1<<ADLAR)|(c<<MUX0)\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Initialization ===================================\n\/\/ ========================================================================\n\n\n\n\ninline __monitor void init()\n{\n    \/* USART initialization *\/\n    usart_init();\n    \/* Timer\/Counter2 initialization *\/\n    init_tc2_wg();\n    \/* ADC initialization (1\/8 prescaling,\n       1st channel, internal Vref, left alignment) *\/\n    REMUX(0);\n    ADCSR = (1<<ADEN)|(3<<ADPS0);\n    \n    \/* Pin configuration *\/\n    PORTB = (1<<PORTB0)|(1<<PORTB1)|(1<<PORTB2)|\n            (0<<PORTB3)|(1<<PORTB4)|(1<<PORTB5)|\n            (1<<PORTB6)|(1<<PORTB7);\n    DDRB = (0<<DDB0)|(0<<DDB1)|(0<<DDB2)|\n           (1<<DDB3)|(0<<DDB4)|(0<<DDB5)|\n           (0<<DDB6)|(0<<DDB7);\n    PORTC = (0<<PORTC0)|(0<<PORTC1)|(1<<PORTC2)|\n            (1<<PORTC3)|(1<<PORTC4)|(1<<PORTC5)|\n            (1<<PORTC6);\n    DDRC = (0<<DDC0)|(0<<DDC1)|(0<<DDC2)|\n           (0<<DDC3)|(0<<DDC4)|(0<<DDC5)|\n           (0<<DDC6);\n    PORTD = (0<<PORTD0)|(0<<PORTD1)|(1<<PORTD2)|\n            (1<<PORTD3)|(1<<PORTD4)|(1<<PORTD5)|\n            (1<<PORTD6)|(1<<PORTD7);\n    DDRD = (0<<DDD0)|(1<<DDD1)|(0<<DDD2)|\n           (0<<DDD3)|(0<<DDD4)|(0<<DDD5)|\n           (0<<DDD6)|(0<<DDD7);\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Common Variables =================================\n\/\/ ========================================================================\n\n\n\n\/*\n * #40 <bug> <enchancement>\n *\n *     Modify coefficient format.\n *\n * Let C = one of { KP KI KS }.\n *\n *     C * x = (M * x) >> d\n *\n * Since ATMega8 does not support floating point operations,\n * and just (x << d) or (x >> d) cannot provide precise regulation.\n *\/\n\n\nunsigned int kp_m = 0; byte kp_d = 0;   \/* proportional factor *\/\nunsigned int ki_m = 0; byte ki_d = 0;   \/* integral factor     *\/\nunsigned int ks_m = 0; byte ks_d = 0;   \/* scale factor        *\/\n\n#define COEF(c, x) (((long) x) * (c##_m)) >> (c##_d)\n\nbool  pause  = false; \/* paused state                          *\/\nbool  sync   = false; \/* USART async\/sync transmit operation   *\/\n\nbyte  adc1, adc2;     \/* ADC 1st and 2nd channel               *\/\n\nint   int_err = 0;    \/* integral error                        *\/\nint   cur_err = 0;    \/* current error                         *\/\nint   pwm     = 0;    \/* PWM                                   *\/\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Message Loop Variables ===========================\n\/\/ ========================================================================\n\n\n\n\n\/*\n * #33 <enchancement>\n *\n *     Simplify IO protocol.\n *\n * The new protocol is user-friendly and quite simple.\n * The typical command starts with `METHOD`\n * (1 byte: `SET`, `GET`, `ECHO`, etc.). The next byte is\n * method-dependent. E.g. `VARIABLE` for `SET` and `GET`.\n * `SET` method also requires the variable value (1..any bytes)\n * to be set.\n *\n * COMMAND = METHOD [CONTENT]\n * METHOD = `SET` | `GET` | `ECHO` | BYTE\n * CONTENT = {\n *     METHOD=`SET`  => VARIABLE [DATA],\n *     METHOD=`GET`  => VARIABLE,\n *     METHOD=`ECHO` => BYTE,\n *     METHOD=BYTE   => any\n * }\n * VARIABLE = BYTE\n * DATA = any\n *\n * BYTE = 1 any byte\n * any = any bytes\n *\/\n\n\nbyte command_method;\nbool command_present = false;\nbyte command_variable;\nbool command_variable_present = false;\n\n\/*\n * #47 <enchancement>\n *\n *     Add `COEFS` variable and `PACKET` output format\n *     to support controller-gui tool.\n *\n * Data packet GET format is:\n *     <0 ADC1 ADC2 CUR_ERR INT_ERR PWM OCR2>\n * Coefficient packet SET format is:\n *     <KP KI KS>\n *\/\n\n#define METHOD_GET     (byte) 0\n#define METHOD_SET     (byte) 1\n#define METHOD_ECHO    (byte) 2\n\n\/\/ SET\n#define VAR_PAUSE      (byte) 0\n#define VAR_SYNC_USART (byte) 1\n#define VAR_KP         (byte) 2\n#define VAR_KI         (byte) 3\n#define VAR_KS         (byte) 4\n#define VAR_COEFS      (byte) 5\n\n\/\/ GET\n#define NO_OUTPUT      (byte) 0\n#define VAR_ADC1       (byte) 1\n#define VAR_ADC2       (byte) 2\n#define VAR_INT_ERR    (byte) 3\n#define VAR_CUR_ERR    (byte) 4\n#define VAR_PWM        (byte) 5\n#define VAR_OCR2       (byte) 6\n#define VAR_PACKET     (byte) 7\n\n\nbyte output_mode = NO_OUTPUT;\n\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Utility Functions ================================\n\/\/ ========================================================================\n\n\n\n\ninline byte transmit_all(byte * src, byte length)\n{\n    return iobuf_write < sp_process_full, lp_use_lock > (usart_obuf, src, length);\n}\n\ninline byte receive_all(byte * dst, byte length)\n{\n    return iobuf_read < sp_process_full, lp_use_lock > (dst, usart_ibuf, length);\n}\n\ninline byte receive(byte * dst)\n{\n    return iobuf_read < lp_use_lock > (*dst, usart_ibuf);\n}\n\n\nvoid send_all(byte *data, byte size)\n{\n    if (!sync)\n    {\n        transmit_all(data, size);\n    }\n    else\n    {\n        while (!transmit_all(data, size)) \/\/ wait in sync mode\n            ;\n    }\n}\n\n\nvoid send_byte(byte data)\n{\n    send_all(&data, 1);\n}\n\n\nvoid send_int(unsigned int data)\n{\n    byte hi_lo[2] = { (byte) (data >> 8), (byte) (data & 0xff) };\n    send_all(hi_lo, 2);\n}\n\n\nvoid send_packet(\/* byte adc1, byte adc2, int cur_err, int int_err, int pwm, byte OCR2 *\/)\n{\n    \/*\n     * #53 <enchancement>\n     *     Review the packet format.\n     *     \n     * The new packet format is < delimiter | data | checksum >,\n     * where checksum is calculated as delimiter ^ adc1 ^ (cerr & 0xff) ^ ocr2.\n     *\/\n    \n    byte packet[11] = {\n       103,\n       adc1,\n       adc2,\n       ((unsigned int) cur_err) >> 8, cur_err & 0xff,\n       ((unsigned int) int_err) >> 8, int_err & 0xff,\n       ((unsigned int) pwm) >> 8,     pwm     & 0xff,\n       OCR2\n    };\n    packet[10] = packet[0] ^ packet[1] ^ packet[4] ^ packet[9];\n    send_all(packet, 11);\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Command Processors ===============================\n\/\/ ========================================================================\n\n\n\n\n\nbool process_set_variable()\n{\n    byte packet[9];\n    switch(command_variable)\n    {\n    case VAR_PAUSE:\n        if (!receive(&packet[0])) return false; \/\/ wait for the value\n        pause = packet[0];\n        break;\n    case VAR_SYNC_USART:\n        if (!receive(packet)) return false; \/\/ wait for the value\n        sync = packet[0];\n        break;\n    case VAR_KP:\n        if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n        kp_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n        kp_d = packet[2];\n        break;\n    case VAR_KI:\n        if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n        ki_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n        ki_d = packet[2];\n        break;\n    case VAR_KS:\n        if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n        ks_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n        ks_d = packet[2];\n        break;\n    case VAR_COEFS:\n        if (!receive_all(packet, 9)) return false; \/\/ wait for the value\n        kp_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n        kp_d = packet[2];\n        ki_m = (((unsigned int) packet[3]) << 8) | (packet[4]);\n        ki_d = packet[5];\n        ks_m = (((unsigned int) packet[6]) << 8) | (packet[7]);\n        ks_d = packet[8];\n        break;\n    }\n    return true;\n}\n\n\nvoid process_command()\n{\n    byte echo_value;\n    switch(command_method)\n    {\n    case METHOD_ECHO:\n        if (!receive(&echo_value)) return; \/\/ wait for the value to send back\n        send_byte(echo_value);\n        break;\n    case METHOD_GET:\n        if (!receive(&output_mode)) return; \/\/ wait for the variable\n        break;\n    case METHOD_SET:\n        \/\/ wait for the variable\n        if (!command_variable_present)\n        {\n            if (!(command_variable_present = receive(&command_variable))) return;\n        }\n        if (!process_set_variable()) return; \/\/ wait for the argument(s)\n        break;\n    }\n    command_present = false;\n    command_variable_present = false;\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Program Logic ====================================\n\/\/ ========================================================================\n\n\n\n\n\nvoid do_computations()\n{\n    \/* Read ADC input *\/\n  \n    REMUX(0);                       \/* 1st ADC channel                    *\/\n    ADCSR |= (1 << ADSC);           \/* Initialize single-ended conversion *\/\n    while(!(ADCSR & (1 << ADIF)))   \/* Wait for the end of the conversion *\/\n      ;\n    adc1 = ADCH;                    \/* Read the 8-bit conversion result   *\/\n    ADCSR &= ~(1 << ADIF);          \/* Clear Conversion Complete flag     *\/\n    \n    REMUX(1);                       \/* 2nd ADC channel                    *\/\n    ADCSR |= (1 << ADSC);           \/* Initialize single-ended conversion *\/\n    while(!(ADCSR & (1 << ADIF)))   \/* Wait for the end of the conversion *\/\n      ;\n    adc2 = ADCH;                    \/* Read the 8-bit conversion result   *\/\n    ADCSR &= ~(1 << ADIF);          \/* Clear Conversion Complete flag     *\/\n    \n    \/* Calculate PWM width *\/\n    \n    \/*\n     * pwm = KP * e + KI * err\n     *\/\n    \n    cur_err = ((int)(adc2) - (int)(adc1));\n    \n    long p = COEF(kp, cur_err), q = COEF(ki, int_err);\n    if (ABS(p) > INT_MAX) p = ((p < 0) ? (INT_MIN) : (INT_MAX));\n    if (ABS(q) > INT_MAX) q = ((q < 0) ? (INT_MIN) : (INT_MAX));\n    pwm = safe_add((int) p, (int) q);\n    \n    int_err = safe_add(int_err, cur_err);\n    \n    \/* Setup PWM width *\/\n    \n    long t = COEF(ks, pwm) + INT_MAX;\n    if (ABS(t) > INT_MAX) t = ((p < 0) ? (INT_MIN) : (INT_MAX));\n    \n    OCR2 = (((unsigned int) t) + INT_MAX) >> 8;\n\n    \/* Report back *\/\n    \n    switch(output_mode)\n    {\n    case NO_OUTPUT:\n        break;\n    case VAR_ADC1:\n        send_byte(adc1);\n        break;\n    case VAR_ADC2:\n        send_byte(adc2);\n        break;\n    case VAR_INT_ERR:\n        send_int(int_err);\n        break;\n    case VAR_CUR_ERR:\n        send_int(cur_err);\n        break;\n    case VAR_PWM:\n        send_int(pwm);\n        break;\n    case VAR_OCR2:\n        send_byte(OCR2);\n        break;\n    case VAR_PACKET:\n        send_packet();\n        break;\n    }\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Program Entry Point ==============================\n\/\/ ========================================================================\n\n\n\n\n\nint main()\n{\n    \n    \/* Initialization here *\/\n    \n    \n    init();\n    \n    __enable_interrupt();\n    \n    \n    \/* Program Loop *\/\n    \n    \n    for(;;)\n    {\n        \n        \n        \/* Message Loop *\/\n        \n        \n        if (command_present)\n        {\n            process_command();\n        }\n        else\n        {\n            command_present = receive(&command_method);\n        }\n        \n        \n        \/* Program Body *\/\n        \n        \n        if (!pause)\n        {\n            do_computations();\n        }\n        \n        \n    }\n    \n    \n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef\t\t__WORLD_HH__\n#define\t\t__WORLD_HH__\n\n#include\t<cmath>\n#include\t<cstdio>\n#include\t<stdint.h>\n#include\t<vector>\n#include\t<algorithm>\n#include\t\"..\/vbam\/gba\/Globals.h\"\n#include\t\"PokemonUtils.hh\"\n\nclass\t\tWorld\n{\nprivate:\n  struct\tHeader\n  {\n    uint32_t\tmapPtr;\n    uint32_t\tevtPtr;\n    uint32_t\tscriptPtr;\n    uint32_t\tconnectPtr;\n    uint16_t\tmusicId;\n    uint16_t\tmapId;\n    uint8_t\tlabelId;\n    uint8_t\tflash;\n    uint8_t\tweather;\n    uint8_t\ttype;\n    uint16_t\tunknown;\n    uint8_t\tshowLabel;\n    uint8_t\tbattleType;\n  };\n\n  struct\tDataHeader\n  {\n    uint32_t\twidth;\n    uint32_t\theight;\n    uint32_t\tborder;\n    uint32_t\tdata;\n    uint32_t\tglobalTileset;\n    uint32_t\tlocalTileset;\n    uint8_t\tborderW;\n    uint8_t\tborderH;\n  };\n\n  struct\tTilesetHeader\n  {\n    uint8_t\tcompressed;\n    uint8_t\tprimary;\n    uint16_t\tunknown;\n    uint32_t\timgPtr;\n    uint32_t\tpalettePtr;\n    uint32_t\tblocksPtr;\n    uint32_t\tanimPtr;\n    uint32_t\tbehaviorPtr;\n  };\n\n  struct\tEvent\n  {\n    uint8_t\tnbPersons;\n    uint8_t\tnbWarps;\n    uint8_t\tnbScripts;\n    uint8_t\tnbSigns;\n    uint32_t\tpersonsPtr;\n    uint32_t\twarpsPtr;\n    uint32_t\tscriptsPtr;\n    uint32_t\tsignsPtr;\n  };\n\n  struct\tSignEvt\n  {\n    uint16_t\tx;\n    uint16_t\ty;\n    uint8_t\tlevel;\n    uint8_t\ttype;\n    uint32_t\tscriptPtr;\n  };\n\n  struct\tWarpEvt\n  {\n    uint16_t\tx;\n    uint16_t\ty;\n    uint8_t\tlevel;\n    uint8_t\tdestWarp;\n    uint8_t\tdestMap;\n    uint8_t\tdestBank;\n  };\n\n  struct\tPersonEvt\n  {\n    uint8_t\tevtNb;\n    uint8_t\tpictureNb;\n    uint16_t\tunknown;\n    uint16_t\tx;\n    uint16_t\ty;\n    uint8_t\tlevel;\n    uint8_t\tmvtType;\n    uint8_t\tmvt;\n    uint8_t\tunknown2;\n    uint8_t\ttrainer;\n    uint8_t\tunknown3;\n    uint16_t\tview;\n    uint32_t\tscriptPtr;\n    uint16_t\tid;\n    uint16_t\tunknown4;\n\n    bool\tisVisible() const\n    {\n      if (!id)\n\treturn (true);\n      return (!getFlag(id));\n    }\n  };\n\n  struct\tScriptEvt\n  {\n    uint16_t\tx;\n    uint16_t\ty;\n    uint8_t\tlevel;\n    uint8_t\tunknown;\n    uint16_t\tvarNb;\n    uint16_t\tvarVal;\n    uint16_t\tunknown2;\n    uint32_t\tscriptPtr;\n  };\n\n  struct\tConnection\n  {\n    uint32_t\ttype;\n    uint32_t\toffset;\n    uint8_t\tbank;\n    uint8_t\tmap;\n    uint16_t\tpadding;\n  };\n\n  struct\tWildHeader\n  {\n    uint8_t\tbank;\n    uint8_t\tmap;\n    uint16_t\tpadding;\n    uint32_t\tentryPtr[4];\n  };\n\n  struct\tWildEntry\n  {\n    uint8_t\tminLvl;\n    uint8_t\tmaxLvl;\n    uint16_t\tspecies;\n  };\n\npublic:\n  struct\tMap\n  {\n    struct\tTileAttr\n    {\n      uint16_t\tbehavior;\n      uint16_t\tbg;\n    };\n\n    struct\tNode\n    {\n      uint8_t\tstatus;\n      uint16_t\ttile;\n      TileAttr\t*attr;\n      Node\t*from;\n      uint32_t\tg;\n      uint32_t\tf;\n      uint32_t\tx;\n      uint32_t\ty;\n\n      Node(uint32_t px = 0, uint32_t py = 0) : status(0), from(NULL), g(0), f(0), x(px), y(py) {}\n      void\tsetG(uint32_t pg) { g = pg; }\n      void\tsetF(uint32_t xe, uint32_t ye) { f = g + 10 * sqrt(POW(xe - x) + POW(ye - y)); }\n\n      uint8_t   getStatus() const { return (status); }\n      uint16_t  getBehavior() const { return (attr->behavior); }\n      uint16_t  getBackground() const { return (attr->bg); }\n      uint32_t  getX() const { return (x); }\n      uint32_t  getY() const { return (y); }\n    };\n\n    struct\tWildBattle\n    {\n      uint8_t\tratio;\n      WildEntry\t*entries;\n      uint8_t\tnbEntries;\n    };\n\n    enum\n      {\n\tROCK = 35,\n\tHILL = 35,\n\tLADDER = 34,\n\tWATER = 36,\n\tROAD = 32,\n\tWALL = 30,\n\tPLAYER = 31\n      };\n\n    uint64_t\twidth;\n    uint64_t\theight;\n    Node\t**data;\n    uint8_t\tnbPersons;\n    uint8_t\tnbWarps;\n    uint8_t\tnbScripts;\n    uint8_t\tnbSigns;\n    PersonEvt\t*persons;\n    WarpEvt\t*warps;\n    ScriptEvt\t*scripts;\n    SignEvt\t*signs;\n    uint32_t\tnbConnects;\n    Connection\t*connects;\n    uint32_t\tscriptPtr;\n    WildBattle\twildBattles[4];\n    uint8_t     labelId;\n    std::string name;\n\n  public:\n    \/\/ Getters\n    uint64_t    getWidth() const { return (width); }\n    uint64_t    getHeight() const { return (height); }\n    const Node  &getNode(uint8_t x, uint8_t y) const { return (data[y][x]); }\n    uint8_t     getNbPersons() const { return (nbPersons); }\n    uint8_t     getNbWarps() const { return (nbWarps); }\n    uint8_t     getNbScripts() const { return (nbScripts); }\n    uint8_t     getNbSigns() const { return (nbSigns); }\n    uint32_t    getNbConnections() const { return (nbConnects); }\n    uint32_t    getScripPtr() const { return (scriptPtr); }\n    uint8_t     getLabelId() const { return (labelId); }\n    const std::string&  getName() const { return (name); }\n\n  public:\n    void                loadName(uint8_t id);\n    Node\t\t*operator[](uint8_t y) { return (data[y]); }\n    inline uint8_t\tgetMatterColor(uint8_t matter, bool pos) {\n      return (pos ? PLAYER:\n\t      !matter ? LADDER :\n\t      matter == 1 ? WALL :\n\t      matter == 4 ? WATER :\n\t      matter == 12 ? ROAD :\n\t      matter == 13 ? HILL :\n\t      matter == 16 ? LADDER : 0);\n    }\n  };\n  typedef\tstd::vector<Map::Node*>\tPath;\n\npublic:\n  World();\n  ~World();\n\nprivate:\n  void\t\t_initWorld();\n  void\t\t_initWildBattles();\n\npublic:\n  std::vector<Map>\t&operator[](uint8_t bank) { return (_banks[(bank < _banks.size()) * bank]); }\n  Map                   &getMap(uint8_t bank, uint8_t map) { return ((*this)[bank][(map < (*this)[bank].size()) * map]); }\n\npublic:\n  std::vector<std::vector<Map> >\t_banks;\n};\n\n#endif\n<commit_msg>add: getters for events and connection data<commit_after>#ifndef\t\t__WORLD_HH__\n#define\t\t__WORLD_HH__\n\n#include\t<cmath>\n#include\t<cstdio>\n#include\t<stdint.h>\n#include\t<vector>\n#include\t<algorithm>\n#include\t\"..\/vbam\/gba\/Globals.h\"\n#include\t\"PokemonUtils.hh\"\n\nclass\t\tWorld\n{\nprivate:\n  struct\tHeader\n  {\n    uint32_t\tmapPtr;\n    uint32_t\tevtPtr;\n    uint32_t\tscriptPtr;\n    uint32_t\tconnectPtr;\n    uint16_t\tmusicId;\n    uint16_t\tmapId;\n    uint8_t\tlabelId;\n    uint8_t\tflash;\n    uint8_t\tweather;\n    uint8_t\ttype;\n    uint16_t\tunknown;\n    uint8_t\tshowLabel;\n    uint8_t\tbattleType;\n  };\n\n  struct\tDataHeader\n  {\n    uint32_t\twidth;\n    uint32_t\theight;\n    uint32_t\tborder;\n    uint32_t\tdata;\n    uint32_t\tglobalTileset;\n    uint32_t\tlocalTileset;\n    uint8_t\tborderW;\n    uint8_t\tborderH;\n  };\n\n  struct\tTilesetHeader\n  {\n    uint8_t\tcompressed;\n    uint8_t\tprimary;\n    uint16_t\tunknown;\n    uint32_t\timgPtr;\n    uint32_t\tpalettePtr;\n    uint32_t\tblocksPtr;\n    uint32_t\tanimPtr;\n    uint32_t\tbehaviorPtr;\n  };\n\n  struct\tEvent\n  {\n    uint8_t\tnbPersons;\n    uint8_t\tnbWarps;\n    uint8_t\tnbScripts;\n    uint8_t\tnbSigns;\n    uint32_t\tpersonsPtr;\n    uint32_t\twarpsPtr;\n    uint32_t\tscriptsPtr;\n    uint32_t\tsignsPtr;\n  };\n\npublic:\n  struct\tSignEvt\n  {\n    uint16_t\tx;\n    uint16_t\ty;\n    uint8_t\tlevel;\n    uint8_t\ttype;\n    uint32_t\tscriptPtr;\n\n    uint16_t\tgetX() const { return (x); }\n    uint16_t\tgetY() const { return (y); }\n    uint8_t\tgetLevel() const { return (level); }\n    uint16_t\tgetTyoe() const { return (type); }\n    uint32_t\tgetScript() const { return (scriptPtr); }\n  };\n\n  struct\tWarpEvt\n  {\n    uint16_t\tx;\n    uint16_t\ty;\n    uint8_t\tlevel;\n    uint8_t\tdestWarp;\n    uint8_t\tdestMap;\n    uint8_t\tdestBank;\n\n    uint16_t\tgetX() const { return (x); }\n    uint16_t\tgetY() const { return (y); }\n    uint8_t\tgetLevel() const { return (level); }\n    uint8_t\tgetWarp() const { return (destWarp); }\n    uint8_t\tgetMap() const { return (destMap); }\n    uint8_t\tgetBank() const { return (destBank); }\n  };\n\n  struct\tPersonEvt\n  {\n    uint8_t\tevtNb;\n    uint8_t\tpictureNb;\n    uint16_t\tunknown;\n    uint16_t\tx;\n    uint16_t\ty;\n    uint8_t\tlevel;\n    uint8_t\tmvtType;\n    uint8_t\tmvt;\n    uint8_t\tunknown2;\n    uint8_t\ttrainer;\n    uint8_t\tunknown3;\n    uint16_t\tview;\n    uint32_t\tscriptPtr;\n    uint16_t\tid;\n    uint16_t\tunknown4;\n\n    bool\tisVisible() const\n    {\n      if (!id)\n\treturn (true);\n      return (!getFlag(id));\n    }\n    uint8_t     getEventNb() const { return (evtNb); }\n    uint16_t\tgetX() const { return (x); }\n    uint16_t\tgetY() const { return (y); }\n    uint8_t\tgetLevel() const { return (level); }\n    uint8_t\tgetMovementType() const { return (mvtType); }\n    uint8_t\tgetMovement() const { return (mvt); }\n    bool\tisTrainer() const { return (trainer); }\n    uint16_t\tgetView() const { return (view); }\n    uint32_t\tgetScript() const { return (scriptPtr); }\n    uint16_t\tgetId() const { return (id); }\n  };\n\n  struct\tScriptEvt\n  {\n    uint16_t\tx;\n    uint16_t\ty;\n    uint8_t\tlevel;\n    uint8_t\tunknown;\n    uint16_t\tvarNb;\n    uint16_t\tvarVal;\n    uint16_t\tunknown2;\n    uint32_t\tscriptPtr;\n\n    uint16_t\tgetX() const { return (x); }\n    uint16_t\tgetY() const { return (y); }\n    uint8_t\tgetLevel() const { return (level); }\n    uint8_t\tgetVarNb() const { return (varNb); }\n    uint8_t\tgetVarValue() const { return (varVal); }\n    uint32_t\tgetScript() const { return (scriptPtr); }\n  };\n\n  struct\tConnection\n  {\n    uint32_t\ttype;\n    uint32_t\toffset;\n    uint8_t\tbank;\n    uint8_t\tmap;\n    uint16_t\tpadding;\n\n    uint32_t\tgetType() const { return (type); }\n    uint32_t\tgetOffset() const { return (offset); }\n    uint8_t\tgetBank() const { return (bank); }\n    uint8_t\tgetMap() const { return (map); }\n    uint16_t\tgetPadding() const { return (padding); }\n  };\n\n  struct\tWildHeader\n  {\n    uint8_t\tbank;\n    uint8_t\tmap;\n    uint16_t\tpadding;\n    uint32_t\tentryPtr[4];\n  };\n\n  struct\tWildEntry\n  {\n    uint8_t\tminLvl;\n    uint8_t\tmaxLvl;\n    uint16_t\tspecies;\n  };\n\npublic:\n  struct\tMap\n  {\n    struct\tTileAttr\n    {\n      uint16_t\tbehavior;\n      uint16_t\tbg;\n    };\n\n    struct\tNode\n    {\n      uint8_t\tstatus;\n      uint16_t\ttile;\n      TileAttr\t*attr;\n      Node\t*from;\n      uint32_t\tg;\n      uint32_t\tf;\n      uint32_t\tx;\n      uint32_t\ty;\n\n      Node(uint32_t px = 0, uint32_t py = 0) : status(0), from(NULL), g(0), f(0), x(px), y(py) {}\n      void\tsetG(uint32_t pg) { g = pg; }\n      void\tsetF(uint32_t xe, uint32_t ye) { f = g + 10 * sqrt(POW(xe - x) + POW(ye - y)); }\n\n      uint8_t   getStatus() const { return (status); }\n      uint16_t  getBehavior() const { return (attr->behavior); }\n      uint16_t  getBackground() const { return (attr->bg); }\n      uint32_t  getX() const { return (x); }\n      uint32_t  getY() const { return (y); }\n    };\n\n    struct\tWildBattle\n    {\n      uint8_t\tratio;\n      WildEntry\t*entries;\n      uint8_t\tnbEntries;\n    };\n\n    enum\n      {\n\tROCK = 35,\n\tHILL = 35,\n\tLADDER = 34,\n\tWATER = 36,\n\tROAD = 32,\n\tWALL = 30,\n\tPLAYER = 31\n      };\n\n    uint64_t\twidth;\n    uint64_t\theight;\n    Node\t**data;\n    uint8_t\tnbPersons;\n    uint8_t\tnbWarps;\n    uint8_t\tnbScripts;\n    uint8_t\tnbSigns;\n    PersonEvt\t*persons;\n    WarpEvt\t*warps;\n    ScriptEvt\t*scripts;\n    SignEvt\t*signs;\n    uint32_t\tnbConnects;\n    Connection\t*connects;\n    uint32_t\tscriptPtr;\n    WildBattle\twildBattles[4];\n    uint8_t     labelId;\n    std::string name;\n\n  public:\n    \/\/ Getters\n    uint64_t    getWidth() const { return (width); }\n    uint64_t    getHeight() const { return (height); }\n    const Node  &getNode(uint8_t x, uint8_t y) const { return (data[y][x]); }\n    uint8_t     getNbPersons() const { return (nbPersons); }\n    uint8_t     getNbWarps() const { return (nbWarps); }\n    uint8_t     getNbScripts() const { return (nbScripts); }\n    uint8_t     getNbSigns() const { return (nbSigns); }\n    uint32_t    getNbConnections() const { return (nbConnects); }\n    uint32_t    getScripPtr() const { return (scriptPtr); }\n    uint8_t     getLabelId() const { return (labelId); }\n    const std::string&  getName() const { return (name); }\n\n  public:\n    void                loadName(uint8_t id);\n    Node\t\t*operator[](uint8_t y) { return (data[y]); }\n    inline uint8_t\tgetMatterColor(uint8_t matter, bool pos) {\n      return (pos ? PLAYER:\n\t      !matter ? LADDER :\n\t      matter == 1 ? WALL :\n\t      matter == 4 ? WATER :\n\t      matter == 12 ? ROAD :\n\t      matter == 13 ? HILL :\n\t      matter == 16 ? LADDER : 0);\n    }\n  };\n  typedef\tstd::vector<Map::Node*>\tPath;\n\npublic:\n  World();\n  ~World();\n\nprivate:\n  void\t\t_initWorld();\n  void\t\t_initWildBattles();\n\npublic:\n  std::vector<Map>\t&operator[](uint8_t bank) { return (_banks[(bank < _banks.size()) * bank]); }\n  Map                   &getMap(uint8_t bank, uint8_t map) { return ((*this)[bank][(map < (*this)[bank].size()) * map]); }\n\npublic:\n  std::vector<std::vector<Map> >\t_banks;\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"kernel.hh\"\n#include \"refcache.hh\"\n#include \"chainhash.hh\"\n#include \"radix_array.hh\"\n#include \"page_info.hh\"\n#include \"kalloc.hh\"\n#include \"fs.h\"\n\n#include <limits.h>\n\nclass mdir;\nclass mfile;\nclass mdev;\nclass msock;\n\nclass mnode : public refcache::weak_referenced\n{\nprivate:\n  struct inumber {\n    u64 v_;\n    static const int type_bits = 8;\n    static const int cpu_bits = 8;\n\n    inumber(u64 v) : v_(v) {}\n    inumber(u8 type, u64 cpu, u64 count)\n      : v_(type | (cpu << type_bits) | (count << (type_bits + cpu_bits)))\n    {\n      assert(type < (1 << type_bits));\n      assert(cpu < (1 << cpu_bits));\n    }\n\n    u8 type() {\n      return v_ & ((1 << type_bits) - 1);\n    }\n  };\n\npublic:\n  struct types {\n    enum {\n      dir = 1,\n      file,\n      dev,\n      sock,\n    };\n  };\n\n  static sref<mnode> get(u64 n);\n  static sref<mnode> alloc(u8 type);\n\n  void cache_pin(bool flag);\n  u8 type() const { return inumber(inum_).type(); }\n\n  mdir* as_dir();\n  const mdir* as_dir() const;\n  mfile* as_file();\n  const mfile* as_file() const;\n  mdev* as_dev();\n  const mdev* as_dev() const;\n  msock* as_sock();\n  const msock* as_sock() const;\n\n  class linkcount : public FS_NLINK_REFCOUNT referenced {\n  public:\n    linkcount() : referenced(0) {};\n    void onzero() override;\n  };\n\n  const u64 inum_;\n  linkcount nlink_;\n\nprotected:\n  mnode(u64 inum);\n\nprivate:\n  void onzero() override;\n\n  std::atomic<bool> cache_pin_;\n  std::atomic<bool> dirty_;\n  std::atomic<bool> valid_;\n};\n\n\/*\n * An mlinkref represents a link count reference on an mnode.\n * The caller must ensure that mlinkref::acquire() is not called\n * after mnode::nlink_ reaches stable zero, perhaps by blocking\n * refcache epochs using cli when looking up the inode number in\n * a directory.\n *\n * Each mlinkref holds a reference to the mnode as well, to ensure\n * that the memory used to store the nlink_ count is not evicted\n * before all of the refcache deltas are flushed.  Otherwise this\n * would just be an sref<linkcount>.\n *\/\nclass mlinkref {\npublic:\n  mlinkref() {}\n  mlinkref(sref<mnode> mref) : m_(mref) {}\n\n  sref<mnode> mn() {\n    return m_;\n  }\n\n  bool held() {\n    return !!l_;\n  }\n\n  \/*\n   * Increment the link count on the mnode.\n   *\/\n  void acquire() {\n    assert(m_ && !l_);\n    l_ = sref<mnode::linkcount>::newref(&m_->nlink_);\n  }\n\n  \/*\n   * Transfer an existing link count on the mnode to this mlinkref.\n   *\/\n  void transfer() {\n    assert(m_ && !l_);\n    l_ = sref<mnode::linkcount>::transfer(&m_->nlink_);\n  }\n\nprivate:\n  \/*\n   * The order is important due to C++ constructor\/destructor\n   * rules: we must hold the mnode reference while manipulating\n   * the linkcount reference.\n   *\/\n  sref<mnode> m_;\n  sref<mnode::linkcount> l_;\n};\n\n\nclass mdir : public mnode {\nprivate:\n  mdir(u64 inum) : mnode(inum), map_(257) {}\n  NEW_DELETE_OPS(mdir);\n  friend sref<mnode> mnode::get(u64);\n\n  chainhash<strbuf<DIRSIZ>, u64> map_;\n\npublic:\n  bool insert(const strbuf<DIRSIZ>& name, mlinkref* ilink) {\n    if (name == \".\")\n      return false;\n    if (!map_.insert(name, ilink->mn()->inum_))\n      return false;\n    assert(ilink->held());\n    ilink->mn()->nlink_.inc();\n    return true;\n  }\n\n  bool remove(const strbuf<DIRSIZ>& name, sref<mnode> m) {\n    if (!map_.remove(name, m->inum_))\n      return false;\n    m->nlink_.dec();\n    return true;\n  }\n\n  bool replace(const strbuf<DIRSIZ>& name, sref<mnode> mold, mlinkref* ilinknew) {\n    if (mold->inum_ == ilinknew->mn()->inum_)\n      return true;\n    if (!map_.replace(name, mold->inum_, ilinknew->mn()->inum_))\n      return false;\n    assert(ilinknew->held());\n    ilinknew->mn()->nlink_.inc();\n    mold->nlink_.dec();\n    return true;\n  }\n\n  bool exists(const strbuf<DIRSIZ>& name) const {\n    if (name == \".\")\n      return true;\n\n    return map_.lookup(name);\n  }\n\n  sref<mnode> lookup(const strbuf<DIRSIZ>& name) const {\n    if (name == \".\")\n      return mnode::get(inum_);\n\n    u64 iprev = -1;\n    for (;;) {\n      u64 inum;\n      if (!map_.lookup(name, &inum))\n        return sref<mnode>();\n\n      sref<mnode> m = mnode::get(inum);\n      if (m)\n        return m;\n\n      \/*\n       * The inode was GCed between the lookup and mnode::get().\n       * Retry the lookup.  Crash if we repeatedly can't find\n       * the same inode (to make such bugs easier to track down).\n       *\/\n      assert(inum != iprev);\n      iprev = inum;\n    }\n  }\n\n  mlinkref lookup_link(const strbuf<DIRSIZ>& name) const {\n    if (name == \".\")\n      \/*\n       * We cannot convert the name \".\" to a link count on the mnode,\n       * because \".\" does not hold a link count of its own.\n       *\/\n      return mlinkref();\n\n    for (;;) {\n      sref<mnode> m = lookup(name);\n      if (!m)\n        return mlinkref();\n\n      scoped_cli cli;\n      \/*\n       * Retry the lookup, now that we have an sref<mnode>, since\n       * we don't want to do lookup's mnode::get() under cli.\n       *\/\n      u64 inum;\n      if (!map_.lookup(name, &inum) || inum != m->inum_)\n        \/*\n         * The name has either been unlinked or changed to point\n         * to another inode.  Retry.\n         *\/\n        continue;\n\n      mlinkref ilink(m);\n\n      \/*\n       * At this point, we know the inode had a non-zero link\n       * count prior to the second lookup.  Since we are holding\n       * cli, refcache cannot advance its epoch, and will not\n       * garbage-collect the inode until after we release cli.\n       *\n       * Mild POSIX violation: an inode can appear to have a\n       * zero link count, according to fstat, but get a positive\n       * link counter later, because the fstat occurs after the\n       * last name has been unlinked, but before we increment\n       * the link count here.\n       *\/\n\n      ilink.acquire();\n\n      \/*\n       * Mild POSIX violation: an inode can appear to have a\n       * link count, according to fstat, that is higher than\n       * the number of all its names.  For instance, sys_link()\n       * first grabs a mlinkref on the existing name, and then\n       * drops it if the new name already exists.\n       *\/\n\n      return ilink;\n    }\n  }\n\n  bool enumerate(const strbuf<DIRSIZ>* prev, strbuf<DIRSIZ>* name) const {\n    if (!prev) {\n      *name = \".\";\n      return true;\n    }\n\n    if (*prev == \".\")\n      prev = nullptr;\n\n    return map_.enumerate(prev, name);\n  }\n\n  bool kill(sref<mnode> parent) {\n    if (!map_.remove_and_kill(\"..\", parent->inum_))\n      return false;\n\n    parent->nlink_.dec();\n    return true;\n  }\n\n  bool killed() const {\n    return map_.killed();\n  }\n};\n\ninline mdir*\nmnode::as_dir()\n{\n  assert(type() == types::dir);\n  return static_cast<mdir*>(this);\n}\n\ninline const mdir*\nmnode::as_dir() const\n{\n  assert(type() == types::dir);\n  return static_cast<const mdir*>(this);\n}\n\n\nclass mfile : public mnode {\nprivate:\n  mfile(u64 inum) : mnode(inum), size_(0) {}\n  NEW_DELETE_OPS(mfile);\n  friend sref<mnode> mnode::get(u64);\n\n  struct page_state {\n    enum {\n      FLAG_LOCK_BIT = 0,\n      FLAG_LOCK = 1 << FLAG_LOCK_BIT,\n      FLAG_SET = 1 << 1,\n    };\n\n    page_state() : flags(0) {}\n    page_state(sref<page_info> p) : flags(FLAG_SET), pg(p) {}\n\n    bool is_set() const {\n      return flags & FLAG_SET;\n    }\n\n    bit_spinlock get_lock() {\n      return bit_spinlock(&flags, FLAG_LOCK_BIT);\n    }\n\n    u64 flags;\n    sref<page_info> pg;\n  };\n\n  enum { maxidx = ULONG_MAX \/ PGSIZE + 1 };\n  radix_array<page_state, maxidx, PGSIZE,\n              kalloc_allocator<page_state>> pages_;\n\n  spinlock resize_lock_;\n  seqcount<u32> size_seq_;\n  u64 size_;\n\npublic:\n  class resizer : public lock_guard<spinlock>,\n                  public seq_writer {\n  private:\n    resizer(mfile* mf) : lock_guard<spinlock>(&mf->resize_lock_),\n                         seq_writer(&mf->size_seq_),\n                         mf_(mf) {}\n    mfile* mf_;\n    friend class mfile;\n\n  public:\n    resizer() : mf_(nullptr) {}\n    explicit operator bool () const { return !!mf_; }\n    u64 read_size() { return mf_->size_; }\n    void resize_nogrow(u64 size);\n    void resize_append(u64 size, sref<page_info> pi);\n  };\n\n  resizer write_size() {\n    return resizer(this);\n  }\n\n  seq_reader<u64> read_size() {\n    return seq_reader<u64>(&size_, &size_seq_);\n  }\n\n  sref<page_info> get_page(u64 pageidx);\n};\n\ninline mfile*\nmnode::as_file()\n{\n  assert(type() == types::file);\n  return static_cast<mfile*>(this);\n}\n\ninline const mfile*\nmnode::as_file() const\n{\n  assert(type() == types::file);\n  return static_cast<const mfile*>(this);\n}\n\n\nclass mdev : public mnode {\nprivate:\n  mdev(u64 inum) : mnode(inum), major_(0), minor_(0) {}\n  NEW_DELETE_OPS(mdev);\n  friend sref<mnode> mnode::get(u64);\n\n  u16 major_;\n  u16 minor_;\n\npublic:\n  u16 major() const { return major_; }\n  u16 minor() const { return minor_; }\n\n  void init(u16 major, u16 minor) {\n    assert(!major_ && !minor_);\n    major_ = major;\n    minor_ = minor;\n  }\n};\n\ninline mdev*\nmnode::as_dev()\n{\n  assert(type() == types::dev);\n  return static_cast<mdev*>(this);\n}\n\ninline const mdev*\nmnode::as_dev() const\n{\n  assert(type() == types::dev);\n  return static_cast<const mdev*>(this);\n}\n\n\nclass msock : public mnode {\nprivate:\n  msock(u64 inum) : mnode(inum), localsock_(nullptr) {}\n  NEW_DELETE_OPS(msock);\n  friend sref<mnode> mnode::get(u64);\n\n  localsock* localsock_;\n\npublic:\n  localsock* get_sock() const { return localsock_; }\n\n  void init(localsock* ls) {\n    assert(!localsock_);\n    localsock_ = ls;\n  }\n};\n\ninline msock*\nmnode::as_sock()\n{\n  assert(type() == types::sock);\n  return static_cast<msock*>(this);\n}\n\ninline const msock*\nmnode::as_sock() const\n{\n  assert(type() == types::sock);\n  return static_cast<const msock*>(this);\n}\n<commit_msg>mnode: Put nlink on its own cache line<commit_after>#pragma once\n\n#include \"kernel.hh\"\n#include \"refcache.hh\"\n#include \"chainhash.hh\"\n#include \"radix_array.hh\"\n#include \"page_info.hh\"\n#include \"kalloc.hh\"\n#include \"fs.h\"\n\n#include <limits.h>\n\nclass mdir;\nclass mfile;\nclass mdev;\nclass msock;\n\nclass mnode : public refcache::weak_referenced\n{\nprivate:\n  struct inumber {\n    u64 v_;\n    static const int type_bits = 8;\n    static const int cpu_bits = 8;\n\n    inumber(u64 v) : v_(v) {}\n    inumber(u8 type, u64 cpu, u64 count)\n      : v_(type | (cpu << type_bits) | (count << (type_bits + cpu_bits)))\n    {\n      assert(type < (1 << type_bits));\n      assert(cpu < (1 << cpu_bits));\n    }\n\n    u8 type() {\n      return v_ & ((1 << type_bits) - 1);\n    }\n  };\n\npublic:\n  struct types {\n    enum {\n      dir = 1,\n      file,\n      dev,\n      sock,\n    };\n  };\n\n  static sref<mnode> get(u64 n);\n  static sref<mnode> alloc(u8 type);\n\n  void cache_pin(bool flag);\n  u8 type() const { return inumber(inum_).type(); }\n\n  mdir* as_dir();\n  const mdir* as_dir() const;\n  mfile* as_file();\n  const mfile* as_file() const;\n  mdev* as_dev();\n  const mdev* as_dev() const;\n  msock* as_sock();\n  const msock* as_sock() const;\n\n  class linkcount : public FS_NLINK_REFCOUNT referenced {\n  public:\n    linkcount() : referenced(0) {};\n    void onzero() override;\n  };\n\n  const u64 inum_;\n  linkcount nlink_ __mpalign__;\n  __padout__;\n\nprotected:\n  mnode(u64 inum);\n\nprivate:\n  void onzero() override;\n\n  std::atomic<bool> cache_pin_;\n  std::atomic<bool> dirty_;\n  std::atomic<bool> valid_;\n};\n\n\/*\n * An mlinkref represents a link count reference on an mnode.\n * The caller must ensure that mlinkref::acquire() is not called\n * after mnode::nlink_ reaches stable zero, perhaps by blocking\n * refcache epochs using cli when looking up the inode number in\n * a directory.\n *\n * Each mlinkref holds a reference to the mnode as well, to ensure\n * that the memory used to store the nlink_ count is not evicted\n * before all of the refcache deltas are flushed.  Otherwise this\n * would just be an sref<linkcount>.\n *\/\nclass mlinkref {\npublic:\n  mlinkref() {}\n  mlinkref(sref<mnode> mref) : m_(mref) {}\n\n  sref<mnode> mn() {\n    return m_;\n  }\n\n  bool held() {\n    return !!l_;\n  }\n\n  \/*\n   * Increment the link count on the mnode.\n   *\/\n  void acquire() {\n    assert(m_ && !l_);\n    l_ = sref<mnode::linkcount>::newref(&m_->nlink_);\n  }\n\n  \/*\n   * Transfer an existing link count on the mnode to this mlinkref.\n   *\/\n  void transfer() {\n    assert(m_ && !l_);\n    l_ = sref<mnode::linkcount>::transfer(&m_->nlink_);\n  }\n\nprivate:\n  \/*\n   * The order is important due to C++ constructor\/destructor\n   * rules: we must hold the mnode reference while manipulating\n   * the linkcount reference.\n   *\/\n  sref<mnode> m_;\n  sref<mnode::linkcount> l_;\n};\n\n\nclass mdir : public mnode {\nprivate:\n  mdir(u64 inum) : mnode(inum), map_(257) {}\n  NEW_DELETE_OPS(mdir);\n  friend sref<mnode> mnode::get(u64);\n\n  chainhash<strbuf<DIRSIZ>, u64> map_;\n\npublic:\n  bool insert(const strbuf<DIRSIZ>& name, mlinkref* ilink) {\n    if (name == \".\")\n      return false;\n    if (!map_.insert(name, ilink->mn()->inum_))\n      return false;\n    assert(ilink->held());\n    ilink->mn()->nlink_.inc();\n    return true;\n  }\n\n  bool remove(const strbuf<DIRSIZ>& name, sref<mnode> m) {\n    if (!map_.remove(name, m->inum_))\n      return false;\n    m->nlink_.dec();\n    return true;\n  }\n\n  bool replace(const strbuf<DIRSIZ>& name, sref<mnode> mold, mlinkref* ilinknew) {\n    if (mold->inum_ == ilinknew->mn()->inum_)\n      return true;\n    if (!map_.replace(name, mold->inum_, ilinknew->mn()->inum_))\n      return false;\n    assert(ilinknew->held());\n    ilinknew->mn()->nlink_.inc();\n    mold->nlink_.dec();\n    return true;\n  }\n\n  bool exists(const strbuf<DIRSIZ>& name) const {\n    if (name == \".\")\n      return true;\n\n    return map_.lookup(name);\n  }\n\n  sref<mnode> lookup(const strbuf<DIRSIZ>& name) const {\n    if (name == \".\")\n      return mnode::get(inum_);\n\n    u64 iprev = -1;\n    for (;;) {\n      u64 inum;\n      if (!map_.lookup(name, &inum))\n        return sref<mnode>();\n\n      sref<mnode> m = mnode::get(inum);\n      if (m)\n        return m;\n\n      \/*\n       * The inode was GCed between the lookup and mnode::get().\n       * Retry the lookup.  Crash if we repeatedly can't find\n       * the same inode (to make such bugs easier to track down).\n       *\/\n      assert(inum != iprev);\n      iprev = inum;\n    }\n  }\n\n  mlinkref lookup_link(const strbuf<DIRSIZ>& name) const {\n    if (name == \".\")\n      \/*\n       * We cannot convert the name \".\" to a link count on the mnode,\n       * because \".\" does not hold a link count of its own.\n       *\/\n      return mlinkref();\n\n    for (;;) {\n      sref<mnode> m = lookup(name);\n      if (!m)\n        return mlinkref();\n\n      scoped_cli cli;\n      \/*\n       * Retry the lookup, now that we have an sref<mnode>, since\n       * we don't want to do lookup's mnode::get() under cli.\n       *\/\n      u64 inum;\n      if (!map_.lookup(name, &inum) || inum != m->inum_)\n        \/*\n         * The name has either been unlinked or changed to point\n         * to another inode.  Retry.\n         *\/\n        continue;\n\n      mlinkref ilink(m);\n\n      \/*\n       * At this point, we know the inode had a non-zero link\n       * count prior to the second lookup.  Since we are holding\n       * cli, refcache cannot advance its epoch, and will not\n       * garbage-collect the inode until after we release cli.\n       *\n       * Mild POSIX violation: an inode can appear to have a\n       * zero link count, according to fstat, but get a positive\n       * link counter later, because the fstat occurs after the\n       * last name has been unlinked, but before we increment\n       * the link count here.\n       *\/\n\n      ilink.acquire();\n\n      \/*\n       * Mild POSIX violation: an inode can appear to have a\n       * link count, according to fstat, that is higher than\n       * the number of all its names.  For instance, sys_link()\n       * first grabs a mlinkref on the existing name, and then\n       * drops it if the new name already exists.\n       *\/\n\n      return ilink;\n    }\n  }\n\n  bool enumerate(const strbuf<DIRSIZ>* prev, strbuf<DIRSIZ>* name) const {\n    if (!prev) {\n      *name = \".\";\n      return true;\n    }\n\n    if (*prev == \".\")\n      prev = nullptr;\n\n    return map_.enumerate(prev, name);\n  }\n\n  bool kill(sref<mnode> parent) {\n    if (!map_.remove_and_kill(\"..\", parent->inum_))\n      return false;\n\n    parent->nlink_.dec();\n    return true;\n  }\n\n  bool killed() const {\n    return map_.killed();\n  }\n};\n\ninline mdir*\nmnode::as_dir()\n{\n  assert(type() == types::dir);\n  return static_cast<mdir*>(this);\n}\n\ninline const mdir*\nmnode::as_dir() const\n{\n  assert(type() == types::dir);\n  return static_cast<const mdir*>(this);\n}\n\n\nclass mfile : public mnode {\nprivate:\n  mfile(u64 inum) : mnode(inum), size_(0) {}\n  NEW_DELETE_OPS(mfile);\n  friend sref<mnode> mnode::get(u64);\n\n  struct page_state {\n    enum {\n      FLAG_LOCK_BIT = 0,\n      FLAG_LOCK = 1 << FLAG_LOCK_BIT,\n      FLAG_SET = 1 << 1,\n    };\n\n    page_state() : flags(0) {}\n    page_state(sref<page_info> p) : flags(FLAG_SET), pg(p) {}\n\n    bool is_set() const {\n      return flags & FLAG_SET;\n    }\n\n    bit_spinlock get_lock() {\n      return bit_spinlock(&flags, FLAG_LOCK_BIT);\n    }\n\n    u64 flags;\n    sref<page_info> pg;\n  };\n\n  enum { maxidx = ULONG_MAX \/ PGSIZE + 1 };\n  radix_array<page_state, maxidx, PGSIZE,\n              kalloc_allocator<page_state>> pages_;\n\n  spinlock resize_lock_;\n  seqcount<u32> size_seq_;\n  u64 size_;\n\npublic:\n  class resizer : public lock_guard<spinlock>,\n                  public seq_writer {\n  private:\n    resizer(mfile* mf) : lock_guard<spinlock>(&mf->resize_lock_),\n                         seq_writer(&mf->size_seq_),\n                         mf_(mf) {}\n    mfile* mf_;\n    friend class mfile;\n\n  public:\n    resizer() : mf_(nullptr) {}\n    explicit operator bool () const { return !!mf_; }\n    u64 read_size() { return mf_->size_; }\n    void resize_nogrow(u64 size);\n    void resize_append(u64 size, sref<page_info> pi);\n  };\n\n  resizer write_size() {\n    return resizer(this);\n  }\n\n  seq_reader<u64> read_size() {\n    return seq_reader<u64>(&size_, &size_seq_);\n  }\n\n  sref<page_info> get_page(u64 pageidx);\n};\n\ninline mfile*\nmnode::as_file()\n{\n  assert(type() == types::file);\n  return static_cast<mfile*>(this);\n}\n\ninline const mfile*\nmnode::as_file() const\n{\n  assert(type() == types::file);\n  return static_cast<const mfile*>(this);\n}\n\n\nclass mdev : public mnode {\nprivate:\n  mdev(u64 inum) : mnode(inum), major_(0), minor_(0) {}\n  NEW_DELETE_OPS(mdev);\n  friend sref<mnode> mnode::get(u64);\n\n  u16 major_;\n  u16 minor_;\n\npublic:\n  u16 major() const { return major_; }\n  u16 minor() const { return minor_; }\n\n  void init(u16 major, u16 minor) {\n    assert(!major_ && !minor_);\n    major_ = major;\n    minor_ = minor;\n  }\n};\n\ninline mdev*\nmnode::as_dev()\n{\n  assert(type() == types::dev);\n  return static_cast<mdev*>(this);\n}\n\ninline const mdev*\nmnode::as_dev() const\n{\n  assert(type() == types::dev);\n  return static_cast<const mdev*>(this);\n}\n\n\nclass msock : public mnode {\nprivate:\n  msock(u64 inum) : mnode(inum), localsock_(nullptr) {}\n  NEW_DELETE_OPS(msock);\n  friend sref<mnode> mnode::get(u64);\n\n  localsock* localsock_;\n\npublic:\n  localsock* get_sock() const { return localsock_; }\n\n  void init(localsock* ls) {\n    assert(!localsock_);\n    localsock_ = ls;\n  }\n};\n\ninline msock*\nmnode::as_sock()\n{\n  assert(type() == types::sock);\n  return static_cast<msock*>(this);\n}\n\ninline const msock*\nmnode::as_sock() const\n{\n  assert(type() == types::sock);\n  return static_cast<const msock*>(this);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_PRIM_MAT_PROB_BERNOULLI_LOGIT_GLM_LPMF_HPP\n#define STAN_MATH_PRIM_MAT_PROB_BERNOULLI_LOGIT_GLM_LPMF_HPP\n\n\n\/*\nFix includes\n*\/\n#include <stan\/math\/prim\/scal\/meta\/is_constant_struct.hpp>\n#include <stan\/math\/prim\/scal\/meta\/partials_return_type.hpp>\n#include <stan\/math\/prim\/scal\/meta\/operands_and_partials.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_consistent_sizes.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_bounded.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_finite.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_not_nan.hpp>\n#include <stan\/math\/prim\/scal\/fun\/constants.hpp>\n#include <stan\/math\/prim\/scal\/fun\/inv_logit.hpp>\n#include <stan\/math\/prim\/scal\/fun\/log1m.hpp>\n#include <stan\/math\/prim\/scal\/fun\/value_of.hpp>\n#include <stan\/math\/prim\/scal\/meta\/include_summand.hpp>\n#include <stan\/math\/prim\/scal\/meta\/scalar_seq_view.hpp>\n#include <boost\/random\/bernoulli_distribution.hpp>\n#include <boost\/random\/variate_generator.hpp>\n#include <cmath>\n#include <string>\n\nusing Eigen::Dynamic;\nusing Eigen::Matrix;\n\nnamespace stan {\n  namespace math {\n\n    \/**\n     * Returns the log PMF of the Generalized Linear Model (GLM) with Bernoulli distribution\n     * and logit link function. If containers are supplied, returns the log sum of the probabilities.\n     *\n     * @tparam T_n type of integer parameter\n     * @tparam T_x type of the data matrix (design matrix); this should be an Eigen::Matrix type\n     * @tparam T_beta type of the weight vector\n     * @tparam T_alpha type of the bias vector\n     * @param n integer parameter\n     * @param x design matrix\n     * @param beta weight vector\n     * @param alpha bias vector (in logits)\n     * @return log probability or log sum of probabilities\n     * @throw std::domain_error if theta is infinite.\n     * @throw std::invalid_argument if container sizes mismatch.\n     *\/\n\t\n\n    template <bool propto, typename T_n, typename T_x, typename T_beta, typename T_alpha>\n    typename return_type<T_x, T_beta, T_alpha>::type\n    bernoulli_logit_glm_lpmf(const T_n& n, const T_x& x, const T_beta& beta, const T_alpha& alpha) {\n      static const std::string function = \"bernoulli_logit_glm_lpmf\";\n      typedef typename stan::partials_return_type<T_n, T_x, T_beta, T_alpha>::type\n        T_partials_return;\n\n      using stan::is_constant_struct;\n      using std::exp;\n\n      if (!(stan::length(n) && stan::length(x) && stan::length(beta) && stan::length(alpha))) \n        return 0.0;\n\n      T_partials_return logp(0.0);\n\n      check_bounded(function, \"n\", n, 0, 1);\n      check_not_nan(function, \"Data matrix\", x); \n      check_not_nan(function, \"Weight vector\", beta); \n      check_not_nan(function, \"Bias vector\", alpha);\n      check_consistent_sizes(function,\n                             \"Random variable\", n,\n                             \"Bias vector\", alpha); \n      \/\/check_consistent_sizes(function,\n      \/\/                       \"Random variable\", n,\n      \/\/                       \"Data matrix\", x); \/\/ would this work?\n\t  \/\/\t\t\t!!! add one more check to see that x is compatible with beta\n\n      if (!include_summand<propto, T_x, T_beta, T_alpha>::value)\n        return 0.0;\n\n      scalar_seq_view<T_n> n_vec(n);\n      scalar_seq_view<T_beta> beta_vec(beta);\n      scalar_seq_view<T_alpha> alpha_vec(alpha);\n      const size_t N = max_size(n, alpha); \/\/ do we want to check anything about x here? and in the next line?\n\t  const size_t M = beta.size();\n      operands_and_partials<T_x, T_beta, T_alpha> ops_partials(x, beta, alpha);\n\t  Matrix<double, Dynamic, 1> beta_dbl(M,1);\n\t  Matrix<double, Dynamic, Dynamic> x_dbl(N,M);\n\t  for (size_t m = 0; m < M; m++) {  \n\t\tbeta_dbl[m] = value_of(beta_vec[m]);\n\t  }\n      for (size_t n = 0; n < N; n++) { \/\/ is there a point in vectorising this loop?\n\t\tfor (size_t m = 0; m < M; m++) {\n\t\t\tx_dbl(n,m) = value_of(x(n,m));\n\t\t}\n        const int n_int = value_of(n_vec[n]);\n        const T_partials_return theta_dbl = (x_dbl.row(n)* beta_dbl)[0] + value_of(alpha_vec[n]); \n\n\n        const int sign = 2 * n_int - 1;\n        const T_partials_return ntheta = sign * theta_dbl;\n        const T_partials_return exp_m_ntheta = exp(-ntheta);\n\n        \/\/ Handle extreme values gracefully using Taylor approximations.\n        static const double cutoff = 20.0;\n        if (ntheta > cutoff)\n          logp -= exp_m_ntheta;\n        else if (ntheta < -cutoff)\n          logp += ntheta;\n        else\n          logp -= log1p(exp_m_ntheta);\n\t\t\n\t\tconst bool constant_x = is_constant_struct<T_x>::value;\n\t\tconst bool constant_beta = is_constant_struct<T_beta>::value;\n\t\tconst bool constant_alpha = is_constant_struct<T_alpha>::value;\n        if ( !(constant_x && constant_beta && constant_alpha)) { \n          static const double cutoff = 20.0; \/\/ do we really need this line?\n\t\t  T_partials_return theta_derivative;\n          if (ntheta > cutoff)\n            theta_derivative = - exp_m_ntheta;\n          else if (ntheta < -cutoff)\n            theta_derivative = sign;\n          else\n            theta_derivative = sign * exp_m_ntheta \n              \/ (exp_m_ntheta + 1);\n          if ( !constant_beta){\n\t\t\tfor (size_t m = 0; m < M; m++) \/\/ vectorise this loop?\n\t\t\t{\n\t\t\t\tops_partials.edge2_.partials_[m] += theta_derivative * x_dbl(n,m);\n\t\t\t}\n\t\t  }\n\t\t  if ( !constant_x){\n\t\t\tops_partials.edge1_.partials_.row(n) += theta_derivative * beta_dbl.transpose();\n\t\t  }\n\t\t  if ( !constant_alpha){\n            ops_partials.edge3_.partials_[n] += theta_derivative;\t\n          }\t\t\t\n        }\n      }\n      return ops_partials.build(logp);\n    }\n\n    template <typename T_n,\n              typename T_x,\n\t\t\t  typename T_beta,\n\t\t\t  typename T_alpha>\n    inline\n    typename return_type<T_x, T_beta, T_alpha>::type\n    bernoulli_logit_glm_lpmf(const T_n& n,\n\t                         const T_x& x,\n\t\t\t\t\t\t\t const T_beta& beta,\n\t\t\t\t\t\t\t const T_alpha& alpha) {\n      return bernoulli_logit_glm_lpmf<false>(n, x, beta, alpha);\n    }\n\n  }\n}\n#endif\n<commit_msg>cosmetic changes<commit_after>#ifndef STAN_MATH_PRIM_MAT_PROB_BERNOULLI_LOGIT_GLM_LPMF_HPP\n#define STAN_MATH_PRIM_MAT_PROB_BERNOULLI_LOGIT_GLM_LPMF_HPP\n\n\n\/*\nFix includes\n*\/\n#include <stan\/math\/prim\/scal\/meta\/is_constant_struct.hpp>\n#include <stan\/math\/prim\/scal\/meta\/partials_return_type.hpp>\n#include <stan\/math\/prim\/scal\/meta\/operands_and_partials.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_consistent_sizes.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_bounded.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_finite.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_not_nan.hpp>\n#include <stan\/math\/prim\/scal\/fun\/constants.hpp>\n#include <stan\/math\/prim\/scal\/fun\/inv_logit.hpp>\n#include <stan\/math\/prim\/scal\/fun\/log1m.hpp>\n#include <stan\/math\/prim\/scal\/fun\/value_of.hpp>\n#include <stan\/math\/prim\/scal\/meta\/include_summand.hpp>\n#include <stan\/math\/prim\/scal\/meta\/scalar_seq_view.hpp>\n#include <boost\/random\/bernoulli_distribution.hpp>\n#include <boost\/random\/variate_generator.hpp>\n#include <cmath>\n#include <string>\n\nusing Eigen::Dynamic;\nusing Eigen::Matrix;\n\nnamespace stan {\n  namespace math {\n\n    \/**\n     * Returns the log PMF of the Generalized Linear Model (GLM) with Bernoulli distribution\n     * and logit link function. If containers are supplied, returns the log sum of the probabilities.\n     *\n     * @tparam T_n type of integer parameter\n     * @tparam T_x type of the data matrix (design matrix); this should be an Eigen::Matrix type\n     * @tparam T_beta type of the weight vector\n     * @tparam T_alpha type of the bias vector\n     * @param n integer parameter\n     * @param x design matrix\n     * @param beta weight vector\n     * @param alpha bias vector (in logits)\n     * @return log probability or log sum of probabilities\n     * @throw std::domain_error if theta is infinite.\n     * @throw std::invalid_argument if container sizes mismatch.\n     *\/\n\t\n\n    template <bool propto, typename T_n, typename T_x, typename T_beta, typename T_alpha>\n    typename return_type<T_x, T_beta, T_alpha>::type\n    bernoulli_logit_glm_lpmf(const T_n& n, const T_x& x, const T_beta& beta, const T_alpha& alpha) {\n      static const std::string function = \"bernoulli_logit_glm_lpmf\";\n      typedef typename stan::partials_return_type<T_n, T_x, T_beta, T_alpha>::type\n        T_partials_return;\n\n      using stan::is_constant_struct;\n      using std::exp;\n\n      if (!(stan::length(n) && stan::length(x) && stan::length(beta) && stan::length(alpha))) \n        return 0.0;\n\n      T_partials_return logp(0.0);\n\n      check_bounded(function, \"n\", n, 0, 1);\n      check_not_nan(function, \"Data matrix\", x); \n      check_not_nan(function, \"Weight vector\", beta); \n      check_not_nan(function, \"Bias vector\", alpha);\n      check_consistent_sizes(function,\n                             \"Random variable\", n,\n                             \"Bias vector\", alpha); \n      \/\/check_consistent_sizes(function,\n      \/\/                       \"Random variable\", n,\n      \/\/                       \"Data matrix\", x); \/\/ would this work?\n\t  \/\/\t\t\t           maybe add one more check to see that x is compatible with beta?\n\n      if (!include_summand<propto, T_x, T_beta, T_alpha>::value)\n        return 0.0;\n\n      scalar_seq_view<T_n> n_vec(n);\n      scalar_seq_view<T_beta> beta_vec(beta);\n      scalar_seq_view<T_alpha> alpha_vec(alpha);\n      const size_t N = max_size(n, alpha); \/\/ do we also want to check anything about x here? and in the next line?\n\t  const size_t M = beta.size();\n      operands_and_partials<T_x, T_beta, T_alpha> ops_partials(x, beta, alpha);\n\t  Matrix<double, Dynamic, 1> beta_dbl(M,1);\n\t  Matrix<double, Dynamic, Dynamic> x_dbl(N,M);\n\t  for (size_t m = 0; m < M; m++) {  \n\t\tbeta_dbl[m] = value_of(beta_vec[m]);\n\t  }\n      for (size_t n = 0; n < N; n++) { \/\/ could we vectorise this loop?\n\t\tfor (size_t m = 0; m < M; m++) {\n\t\t\tx_dbl(n,m) = value_of(x(n,m));\n\t\t}\n        const int n_int = value_of(n_vec[n]);\n        const T_partials_return theta_dbl = (x_dbl.row(n)* beta_dbl)[0] + value_of(alpha_vec[n]); \n\n\n        const int sign = 2 * n_int - 1;\n        const T_partials_return ntheta = sign * theta_dbl;\n        const T_partials_return exp_m_ntheta = exp(-ntheta);\n\n        \/\/ Handle extreme values gracefully using Taylor approximations.\n        static const double cutoff = 20.0;\n        if (ntheta > cutoff)\n          logp -= exp_m_ntheta;\n        else if (ntheta < -cutoff)\n          logp += ntheta;\n        else\n          logp -= log1p(exp_m_ntheta);\n\t\t\n\t\tconst bool constant_x = is_constant_struct<T_x>::value;\n\t\tconst bool constant_beta = is_constant_struct<T_beta>::value;\n\t\tconst bool constant_alpha = is_constant_struct<T_alpha>::value;\n        if ( !(constant_x && constant_beta && constant_alpha)) { \n          static const double cutoff = 20.0; \/\/ do we really need this line?\n\t\t  T_partials_return theta_derivative;\n          if (ntheta > cutoff)\n            theta_derivative = - exp_m_ntheta;\n          else if (ntheta < -cutoff)\n            theta_derivative = sign;\n          else\n            theta_derivative = sign * exp_m_ntheta \n              \/ (exp_m_ntheta + 1);\n          if ( !constant_beta){\n\t\t\tfor (size_t m = 0; m < M; m++) \/\/ can we vectorise this loop?\n\t\t\t{\n\t\t\t\tops_partials.edge2_.partials_[m] += theta_derivative * x_dbl(n,m);\n\t\t\t}\n\t\t  }\n\t\t  if ( !constant_x){\n\t\t\tops_partials.edge1_.partials_.row(n) += theta_derivative * beta_dbl.transpose();\n\t\t  }\n\t\t  if ( !constant_alpha){\n            ops_partials.edge3_.partials_[n] += theta_derivative;\t\n          }\t\t\t\n        }\n      }\n      return ops_partials.build(logp);\n    }\n\n    template <typename T_n,\n              typename T_x,\n\t\t\t  typename T_beta,\n\t\t\t  typename T_alpha>\n    inline\n    typename return_type<T_x, T_beta, T_alpha>::type\n    bernoulli_logit_glm_lpmf(const T_n& n,\n\t                         const T_x& x,\n\t\t\t\t\t\t\t const T_beta& beta,\n\t\t\t\t\t\t\t const T_alpha& alpha) {\n      return bernoulli_logit_glm_lpmf<false>(n, x, beta, alpha);\n    }\n\n  }\n}\n#endif\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 <vector>\n\n#include \"webkit\/tools\/test_shell\/simple_socket_stream_bridge.h\"\n\n#include \"base\/message_loop.h\"\n#include \"base\/ref_counted.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/socket_stream\/socket_stream.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"webkit\/api\/public\/WebSocketStreamHandle.h\"\n#include \"webkit\/glue\/websocketstreamhandle_bridge.h\"\n#include \"webkit\/glue\/websocketstreamhandle_delegate.h\"\n\nusing webkit_glue::WebSocketStreamHandleBridge;\n\nstatic const int kNoSocketId = 0;\n\nnamespace {\n\nMessageLoop* g_io_thread;\nscoped_refptr<URLRequestContext> g_request_context;\n\nclass WebSocketStreamHandleBridgeImpl\n    : public WebSocketStreamHandleBridge,\n      public net::SocketStream::Delegate {\n public:\n  WebSocketStreamHandleBridgeImpl(\n      WebKit::WebSocketStreamHandle* handle,\n      webkit_glue::WebSocketStreamHandleDelegate* delegate);\n\n  \/\/ WebSocketStreamHandleBridge methods.\n  virtual void Connect(const GURL& url);\n  virtual bool Send(const std::vector<char>& data);\n  virtual void Close();\n\n  \/\/ net::SocketStream::Delegate methods.\n  virtual void OnConnected(net::SocketStream* req,\n                           int max_pending_send_allowed);\n  virtual void OnSentData(net::SocketStream* req,\n                          int amount_sent);\n  virtual void OnReceivedData(net::SocketStream* req,\n                              const char* data, int len);\n  virtual void OnClose(net::SocketStream* req);\n\n private:\n  virtual ~WebSocketStreamHandleBridgeImpl();\n\n  \/\/ Runs on |g_io_thread|;\n  void DoConnect(const GURL& url);\n  void DoSend(std::vector<char>* data);\n  void DoClose();\n\n  \/\/ Runs on |message_loop_|;\n  void DoOnConnected(int max_amount_send_allowed);\n  void DoOnSentData(int amount_sent);\n  void DoOnReceivedData(std::vector<char>* data);\n  void DoOnClose(webkit_glue::WebSocketStreamHandleDelegate* delegate);\n\n  int socket_id_;\n  MessageLoop* message_loop_;\n  WebKit::WebSocketStreamHandle* handle_;\n  webkit_glue::WebSocketStreamHandleDelegate* delegate_;\n\n  scoped_refptr<net::SocketStream> socket_;\n\n  DISALLOW_COPY_AND_ASSIGN(WebSocketStreamHandleBridgeImpl);\n};\n\nWebSocketStreamHandleBridgeImpl::WebSocketStreamHandleBridgeImpl(\n    WebKit::WebSocketStreamHandle* handle,\n    webkit_glue::WebSocketStreamHandleDelegate* delegate)\n    : socket_id_(kNoSocketId),\n      message_loop_(MessageLoop::current()),\n      handle_(handle),\n      delegate_(delegate) {\n}\n\nWebSocketStreamHandleBridgeImpl::~WebSocketStreamHandleBridgeImpl() {\n  CHECK(socket_id_ == kNoSocketId);\n}\n\nvoid WebSocketStreamHandleBridgeImpl::Connect(const GURL& url) {\n  CHECK(g_io_thread);\n  AddRef();  \/\/ Released in DoOnClose().\n  g_io_thread->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoConnect,\n                        url));\n  if (delegate_)\n    delegate_->WillOpenStream(handle_, url);\n}\n\nbool WebSocketStreamHandleBridgeImpl::Send(\n    const std::vector<char>& data) {\n  CHECK(g_io_thread);\n  g_io_thread->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoSend,\n                        new std::vector<char>(data)));\n  return true;\n}\n\nvoid WebSocketStreamHandleBridgeImpl::Close() {\n  CHECK(g_io_thread);\n  g_io_thread->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoClose));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::OnConnected(\n    net::SocketStream* socket, int max_pending_send_allowed) {\n  message_loop_->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoOnConnected,\n                        max_pending_send_allowed));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::OnSentData(\n    net::SocketStream* socket, int amount_sent) {\n  message_loop_->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoOnSentData,\n                        amount_sent));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::OnReceivedData(\n    net::SocketStream* socket, const char* data, int len) {\n  message_loop_->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this,\n                        &WebSocketStreamHandleBridgeImpl::DoOnReceivedData,\n                        new std::vector<char>(data, data + len)));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::OnClose(net::SocketStream* socket) {\n  webkit_glue::WebSocketStreamHandleDelegate* delegate = delegate_;\n  delegate_ = NULL;\n  socket_ = 0;\n  socket_id_ = kNoSocketId;\n  message_loop_->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoOnClose,\n                        delegate));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoConnect(const GURL& url) {\n  CHECK(MessageLoop::current() == g_io_thread);\n  socket_ = new net::SocketStream(url, this);\n  socket_->set_context(g_request_context);\n  socket_->Connect();\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoSend(std::vector<char>* data) {\n  CHECK(MessageLoop::current() == g_io_thread);\n  scoped_ptr<std::vector<char> > scoped_data(data);\n  if (!socket_)\n    return;\n  if (!socket_->SendData(&(data->at(0)), data->size()))\n    socket_->Close();\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoClose() {\n  CHECK(MessageLoop::current() == g_io_thread);\n  if (!socket_)\n    return;\n  socket_->Close();\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoOnConnected(\n    int max_pending_send_allowed) {\n  CHECK(MessageLoop::current() == message_loop_);\n  if (delegate_)\n    delegate_->DidOpenStream(handle_, max_pending_send_allowed);\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoOnSentData(int amount_sent) {\n  CHECK(MessageLoop::current() == message_loop_);\n  if (delegate_)\n    delegate_->DidSendData(handle_, amount_sent);\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoOnReceivedData(\n    std::vector<char>* data) {\n  CHECK(MessageLoop::current() == message_loop_);\n  scoped_ptr<std::vector<char> > scoped_data(data);\n  if (delegate_)\n    delegate_->DidReceiveData(handle_, &(data->at(0)), data->size());\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoOnClose(\n    webkit_glue::WebSocketStreamHandleDelegate* delegate) {\n  CHECK(MessageLoop::current() == message_loop_);\n  CHECK(!socket_);\n  if (delegate)\n    delegate->DidClose(handle_);\n  Release();\n}\n\n}  \/\/ namespace\n\n\/* static *\/\nvoid SimpleSocketStreamBridge::InitializeOnIOThread(\n    URLRequestContext* request_context) {\n  g_io_thread = MessageLoop::current();\n  g_request_context = request_context;\n}\n\nvoid SimpleSocketStreamBridge::Cleanup() {\n  g_io_thread = NULL;\n  g_request_context = NULL;\n}\n\nnamespace webkit_glue {\n\n\/* static *\/\nWebSocketStreamHandleBridge* WebSocketStreamHandleBridge::Create(\n    WebKit::WebSocketStreamHandle* handle,\n    WebSocketStreamHandleDelegate* delegate) {\n  return new WebSocketStreamHandleBridgeImpl(handle, delegate);\n}\n\n}  \/\/ namespace webkit_glue\n<commit_msg>Delay OnClose actions.<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 <vector>\n\n#include \"webkit\/tools\/test_shell\/simple_socket_stream_bridge.h\"\n\n#include \"base\/message_loop.h\"\n#include \"base\/ref_counted.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/socket_stream\/socket_stream.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"webkit\/api\/public\/WebSocketStreamHandle.h\"\n#include \"webkit\/glue\/websocketstreamhandle_bridge.h\"\n#include \"webkit\/glue\/websocketstreamhandle_delegate.h\"\n\nusing webkit_glue::WebSocketStreamHandleBridge;\n\nstatic const int kNoSocketId = 0;\n\nnamespace {\n\nMessageLoop* g_io_thread;\nscoped_refptr<URLRequestContext> g_request_context;\n\nclass WebSocketStreamHandleBridgeImpl\n    : public WebSocketStreamHandleBridge,\n      public net::SocketStream::Delegate {\n public:\n  WebSocketStreamHandleBridgeImpl(\n      WebKit::WebSocketStreamHandle* handle,\n      webkit_glue::WebSocketStreamHandleDelegate* delegate);\n\n  \/\/ WebSocketStreamHandleBridge methods.\n  virtual void Connect(const GURL& url);\n  virtual bool Send(const std::vector<char>& data);\n  virtual void Close();\n\n  \/\/ net::SocketStream::Delegate methods.\n  virtual void OnConnected(net::SocketStream* req,\n                           int max_pending_send_allowed);\n  virtual void OnSentData(net::SocketStream* req,\n                          int amount_sent);\n  virtual void OnReceivedData(net::SocketStream* req,\n                              const char* data, int len);\n  virtual void OnClose(net::SocketStream* req);\n\n private:\n  virtual ~WebSocketStreamHandleBridgeImpl();\n\n  \/\/ Runs on |g_io_thread|;\n  void DoConnect(const GURL& url);\n  void DoSend(std::vector<char>* data);\n  void DoClose();\n\n  \/\/ Runs on |message_loop_|;\n  void DoOnConnected(int max_amount_send_allowed);\n  void DoOnSentData(int amount_sent);\n  void DoOnReceivedData(std::vector<char>* data);\n  void DoOnClose();\n\n  int socket_id_;\n  MessageLoop* message_loop_;\n  WebKit::WebSocketStreamHandle* handle_;\n  webkit_glue::WebSocketStreamHandleDelegate* delegate_;\n\n  scoped_refptr<net::SocketStream> socket_;\n  \/\/ Number of pending tasks to handle net::SocketStream::Delegate methods.\n  int num_pending_tasks_;\n\n  DISALLOW_COPY_AND_ASSIGN(WebSocketStreamHandleBridgeImpl);\n};\n\nWebSocketStreamHandleBridgeImpl::WebSocketStreamHandleBridgeImpl(\n    WebKit::WebSocketStreamHandle* handle,\n    webkit_glue::WebSocketStreamHandleDelegate* delegate)\n    : socket_id_(kNoSocketId),\n      message_loop_(MessageLoop::current()),\n      handle_(handle),\n      delegate_(delegate),\n      num_pending_tasks_(0) {\n}\n\nWebSocketStreamHandleBridgeImpl::~WebSocketStreamHandleBridgeImpl() {\n  DCHECK_EQ(socket_id_, kNoSocketId);\n}\n\nvoid WebSocketStreamHandleBridgeImpl::Connect(const GURL& url) {\n  DCHECK(g_io_thread);\n  AddRef();  \/\/ Released in DoOnClose().\n  g_io_thread->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoConnect,\n                        url));\n  if (delegate_)\n    delegate_->WillOpenStream(handle_, url);\n}\n\nbool WebSocketStreamHandleBridgeImpl::Send(\n    const std::vector<char>& data) {\n  DCHECK(g_io_thread);\n  g_io_thread->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoSend,\n                        new std::vector<char>(data)));\n  return true;\n}\n\nvoid WebSocketStreamHandleBridgeImpl::Close() {\n  DCHECK(g_io_thread);\n  g_io_thread->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoClose));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::OnConnected(\n    net::SocketStream* socket, int max_pending_send_allowed) {\n  ++num_pending_tasks_;\n  message_loop_->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoOnConnected,\n                        max_pending_send_allowed));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::OnSentData(\n    net::SocketStream* socket, int amount_sent) {\n  ++num_pending_tasks_;\n  message_loop_->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoOnSentData,\n                        amount_sent));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::OnReceivedData(\n    net::SocketStream* socket, const char* data, int len) {\n  ++num_pending_tasks_;\n  message_loop_->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this,\n                        &WebSocketStreamHandleBridgeImpl::DoOnReceivedData,\n                        new std::vector<char>(data, data + len)));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::OnClose(net::SocketStream* socket) {\n  ++num_pending_tasks_;\n  \/\/ Release socket_ on IO thread.\n  socket_ = NULL;\n  socket_id_ = kNoSocketId;\n  message_loop_->PostTask(\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketStreamHandleBridgeImpl::DoOnClose));\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoConnect(const GURL& url) {\n  DCHECK(MessageLoop::current() == g_io_thread);\n  socket_ = new net::SocketStream(url, this);\n  socket_->set_context(g_request_context);\n  socket_->Connect();\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoSend(std::vector<char>* data) {\n  DCHECK(MessageLoop::current() == g_io_thread);\n  scoped_ptr<std::vector<char> > scoped_data(data);\n  if (!socket_)\n    return;\n  if (!socket_->SendData(&(data->at(0)), data->size()))\n    socket_->Close();\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoClose() {\n  DCHECK(MessageLoop::current() == g_io_thread);\n  if (!socket_)\n    return;\n  socket_->Close();\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoOnConnected(\n    int max_pending_send_allowed) {\n  DCHECK(MessageLoop::current() == message_loop_);\n  --num_pending_tasks_;\n  if (delegate_)\n    delegate_->DidOpenStream(handle_, max_pending_send_allowed);\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoOnSentData(int amount_sent) {\n  DCHECK(MessageLoop::current() == message_loop_);\n  --num_pending_tasks_;\n  if (delegate_)\n    delegate_->DidSendData(handle_, amount_sent);\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoOnReceivedData(\n    std::vector<char>* data) {\n  DCHECK(MessageLoop::current() == message_loop_);\n  --num_pending_tasks_;\n  scoped_ptr<std::vector<char> > scoped_data(data);\n  if (delegate_)\n    delegate_->DidReceiveData(handle_, &(data->at(0)), data->size());\n}\n\nvoid WebSocketStreamHandleBridgeImpl::DoOnClose() {\n  DCHECK(MessageLoop::current() == message_loop_);\n  --num_pending_tasks_;\n  \/\/ Don't handle OnClose if there are pending tasks.\n  DCHECK_EQ(num_pending_tasks_, 0);\n  DCHECK(!socket_);\n  DCHECK_EQ(socket_id_, kNoSocketId);\n  webkit_glue::WebSocketStreamHandleDelegate* delegate = delegate_;\n  delegate_ = NULL;\n  if (delegate)\n    delegate->DidClose(handle_);\n  Release();\n}\n\n}  \/\/ namespace\n\n\/* static *\/\nvoid SimpleSocketStreamBridge::InitializeOnIOThread(\n    URLRequestContext* request_context) {\n  g_io_thread = MessageLoop::current();\n  g_request_context = request_context;\n}\n\nvoid SimpleSocketStreamBridge::Cleanup() {\n  g_io_thread = NULL;\n  g_request_context = NULL;\n}\n\nnamespace webkit_glue {\n\n\/* static *\/\nWebSocketStreamHandleBridge* WebSocketStreamHandleBridge::Create(\n    WebKit::WebSocketStreamHandle* handle,\n    WebSocketStreamHandleDelegate* delegate) {\n  return new WebSocketStreamHandleBridgeImpl(handle, delegate);\n}\n\n}  \/\/ namespace webkit_glue\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#include \"tensorflow\/compiler\/xla\/service\/gpu\/fusion_merger.h\"\n\n#include <algorithm>\n\n#include \"tensorflow\/compiler\/xla\/service\/hlo_cost_analysis.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/compiler\/xla\/util.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/strings\/str_util.h\"\n\nnamespace xla {\nnamespace gpu {\n\nnamespace {\n\n\/\/ Traverses users of tuple shape, adding leaf instructions to 'instructions'.\nvoid MaybeResolveTupleElements(HloInstruction* instruction,\n                               std::vector<HloInstruction*>* instructions) {\n  if (ShapeUtil::IsTuple(instruction->shape())) {\n    for (auto tuple_user : instruction->users()) {\n      MaybeResolveTupleElements(tuple_user, instructions);\n    }\n  } else {\n    instructions->push_back(instruction);\n  }\n}\n\n\/\/ Returns the bytes read by fusion parameter 'param', by returning the byte\n\/\/ size of 'param' shape (or the cumulative byte sizes of all leaf tuple\n\/\/ elements if 'param' is tuple-shaped).\n\/\/ In the special case where all users of 'param' (or all users of a leaf\n\/\/ tuple element if 'param' is tuple-shaped) are Slice instructions, the size\n\/\/ of each slice instruction is accumulated instead, to give a more accurate\n\/\/ value for bytes read.\ndouble CalculateBytesReadByFusionParameter(HloInstruction* param) {\n  CHECK_EQ(HloOpcode::kParameter, param->opcode());\n\n  \/\/ Adds all leaf tuple elements to 'instructions' if 'param' is tuple-shaped.\n  \/\/ Adds 'param' to 'instructions' otherwise.\n  std::vector<HloInstruction*> instructions;\n  MaybeResolveTupleElements(param, &instructions);\n\n  \/\/ Iterate through 'instructions' accumulating byte sizes of each instruction\n  \/\/ shape. For each 'instruction' in 'instructions', if all users of\n  \/\/ 'instruction' are Slice instructions, accumuates the byte sizes of each\n  \/\/ Slice for a more accurate estimate of bytes read.\n  double bytes = 0.0;\n  for (auto& instruction : instructions) {\n    if (std::all_of(instruction->users().begin(), instruction->users().end(),\n                    [](const HloInstruction* instruction) {\n                      return instruction->opcode() == HloOpcode::kSlice ||\n                             instruction->opcode() == HloOpcode::kDynamicSlice;\n                    })) {\n      \/\/ All users are slice: accumulate bytes of all user slice instructions.\n      for (auto& user : instruction->users()) {\n        bytes += ShapeUtil::ByteSizeOf(user->shape());\n      }\n    } else {\n      \/\/ Some users are not slice: accumulate full size of 'instruction'.\n      bytes += ShapeUtil::ByteSizeOf(instruction->shape());\n    }\n  }\n  return bytes;\n}\n\n\/\/ Returns the bytes read by all fusion parameters of instruction 'fusion'.\ndouble CalculateBytesReadByFusionInstruction(HloInstruction* fusion) {\n  double bytes = 0.0;\n  for (const auto& fused_instruction : fusion->fused_instructions()) {\n    if (fused_instruction->opcode() != HloOpcode::kParameter) {\n      continue;\n    }\n    bytes += CalculateBytesReadByFusionParameter(fused_instruction.get());\n  }\n  return bytes;\n}\n\n\/\/ Returns the flops to bytes transferred ratio of instruction 'fusion'.\ndouble CalculateFlopsToBytesRatio(HloInstruction* fusion) {\n  CHECK_EQ(HloOpcode::kFusion, fusion->opcode());\n  \/\/ Calculate total bytes transferred in\/out.\n  double bytes = CalculateBytesReadByFusionInstruction(fusion);\n  \/\/ Add bytes written to root instructions buffer.\n  bytes += ShapeUtil::ByteSizeOf(fusion->fused_expression_root()->shape());\n  \/\/ Calculate flops for all fused instructions.\n  HloCostAnalysis analysis;\n  TF_CHECK_OK(fusion->fused_expression_root()->Accept(&analysis));\n  \/\/ Return flops \/ bytes.\n  return bytes > 0.0 ? analysis.flop_count() \/ bytes : analysis.flop_count();\n}\n\n\/\/ Returns bytes transferred by instruction 'fusion', including the bytes\n\/\/ that would be read by all users.\ndouble GetCurrentBytesTransferred(HloInstruction* fusion) {\n  CHECK_EQ(HloOpcode::kFusion, fusion->opcode());\n  const double bytes_read = CalculateBytesReadByFusionInstruction(fusion);\n  const double bytes_written =\n      ShapeUtil::ByteSizeOf(fusion->fused_expression_root()->shape());\n  \/\/ Current bytes transferred (ignoring non 'fusion' user operands) is bytes\n  \/\/ read and written by 'fusion', plus reads of size 'bytes_written' for each\n  \/\/ user.\n  return bytes_read + bytes_written * (fusion->user_count() + 1);\n}\n\n\/\/ Returns bytes transferred if 'fusion' were to be merged into its users.\ndouble GetMergedBytesTransferred(HloInstruction* fusion) {\n  CHECK_EQ(HloOpcode::kFusion, fusion->opcode());\n  return CalculateBytesReadByFusionInstruction(fusion) * fusion->user_count();\n}\n\n}  \/\/ anonymous namespace\n\n\/\/ FusionInstructionMerger visits all fusion instructions in 'computation'\n\/\/ in post order, attempting to merge each into all of its users.\n\/\/ Accumulates and reports stats on successful\/failed merge attempts.\nclass FusionInstructionMerger {\n public:\n  explicit FusionInstructionMerger(HloComputation* computation)\n      : computation_(computation) {}\n\n  Status Run();\n\n  bool changed() const { return changed_; }\n\n private:\n  Status HandleFusion(HloInstruction* fusion);\n\n  HloComputation* computation_;\n  bool changed_ = false;\n\n  \/\/ Fusion instruction merge stats.\n  int total_visited_ = 0;\n  int total_merged_ = 0;\n  int num_fail_no_users_ = 0;\n  int num_fail_dot_root_ = 0;\n  int num_fail_merge_all_users_ = 0;\n  int num_fail_flops_to_byte_ratio_ = 0;\n  int num_fail_net_bytes_transferred_ratio_ = 0;\n\n  TF_DISALLOW_COPY_AND_ASSIGN(FusionInstructionMerger);\n};\n\nStatus FusionInstructionMerger::Run() {\n  for (auto* instruction : computation_->MakeInstructionPostOrder()) {\n    if (instruction->opcode() == HloOpcode::kFusion) {\n      TF_RETURN_IF_ERROR(HandleFusion(instruction));\n    }\n  }\n\n  VLOG(1) << \"FusionInstructionMerger EXIT\"\n          << \" computation: \" << computation_->name()\n          << \" total_visited: \" << total_visited_\n          << \" total_merged: \" << total_merged_ << \" merge failures { \"\n          << \" no_users: \" << num_fail_no_users_\n          << \" dot_root: \" << num_fail_dot_root_\n          << \" merge_all_users: \" << num_fail_merge_all_users_\n          << \" flops_to_byte_ratio: \" << num_fail_flops_to_byte_ratio_\n          << \" net_bytes_transferred: \" << num_fail_net_bytes_transferred_ratio_\n          << \" }\";\n  return Status::OK();\n}\n\nStatus FusionInstructionMerger::HandleFusion(HloInstruction* fusion) {\n  VLOG(3) << \"FusionInstructionMerger ENTRY fusion: \" << fusion->name()\n          << \" flops_to_bytes_ratio: \" << CalculateFlopsToBytesRatio(fusion);\n  ++total_visited_;\n  \/\/ Skip 'fusion' instruction if there are no users into which we can merge.\n  if (fusion->users().empty()) {\n    ++num_fail_no_users_;\n    return Status::OK();\n  }\n  \/\/ Skip 'fusion' instruction if its fused root is kDot, as IrEmitterUnnested\n  \/\/ expects a specific structure (kParameter operands) for this case.\n  if (fusion->fused_expression_root()->opcode() == HloOpcode::kDot) {\n    ++num_fail_dot_root_;\n    return Status::OK();\n  }\n  \/\/ Skip 'fusion' instruction if we cannot merge into all of its users.\n  \/\/ Merging into all users enables the removal of 'fusion' from the\n  \/\/ computation.\n  if (!std::all_of(fusion->users().begin(), fusion->users().end(),\n                   [](const HloInstruction* instruction) {\n                     return instruction->opcode() == HloOpcode::kFusion &&\n                            instruction->fused_expression_root()->opcode() !=\n                                HloOpcode::kDot;\n                   })) {\n    ++num_fail_merge_all_users_;\n    return Status::OK();\n  }\n  \/\/ Skip 'fusion' instruction if its flops to bytes transferred ratio\n  \/\/ exceeds the threshold value.\n  if (CalculateFlopsToBytesRatio(fusion) >\n      FusionMerger::GetThresholdFlopsToBytesRatio()) {\n    ++num_fail_flops_to_byte_ratio_;\n    return Status::OK();\n  }\n  \/\/ Skip 'fusion' instruction if merging it into all users would result in a\n  \/\/ net increase in bytes transferred (currently allowing the net bytes\n  \/\/ transferred to be exceeded up to ~10% in exhange for eliminating the\n  \/\/ overhead from a GPU kernel launch).\n  const double current_bytes_transferred = GetCurrentBytesTransferred(fusion);\n  const double merged_bytes_transferred = GetMergedBytesTransferred(fusion);\n  const double merged_to_current_bytes_ratio =\n      merged_bytes_transferred \/ std::max(1.0, current_bytes_transferred);\n  if (merged_to_current_bytes_ratio > 1.10) {\n    ++num_fail_net_bytes_transferred_ratio_;\n    return Status::OK();\n  }\n  \/\/ Merge fused instructions from 'fusion' into each user.\n  std::set<HloInstruction*> users = fusion->users();\n  for (HloInstruction* user : users) {\n    user->MergeFusionInstruction(fusion);\n    changed_ = true;\n  }\n  ++total_merged_;\n  VLOG(2) << \"Merged fusion instruction: \" << fusion->name()\n          << \" flops_to_bytes_ratio: \" << CalculateFlopsToBytesRatio(fusion)\n          << \" merged_to_current_bytes_ratio: \" << merged_to_current_bytes_ratio\n          << \" into users { \"\n          << tensorflow::str_util::Join(users, \", \",\n                                        [](string* out, HloInstruction* user) {\n                                          tensorflow::strings::StrAppend(\n                                              out, user->name());\n                                        })\n          << \" }\";\n  \/\/ Remove 'fusion' instruction.\n  CHECK_EQ(0, fusion->user_count());\n  computation_->RemoveInstruction(fusion);\n  return Status::OK();\n}\n\nStatusOr<bool> FusionMerger::Run(HloModule* module) {\n  bool changed = false;\n  VLOG(2) << \"FusionMerger for module: \" << module->name();\n  for (auto& computation : module->computations()) {\n    VLOG(1) << \"Before running FusionInstructionMerger for computation: \"\n            << computation->name();\n    XLA_VLOG_LINES(3, computation->ToString());\n\n    FusionInstructionMerger fusion_merger(computation.get());\n    TF_RETURN_IF_ERROR(fusion_merger.Run());\n    changed |= fusion_merger.changed();\n\n    VLOG(1) << \"After running FusionInstructionMerger for computation: \"\n            << computation->name() << \" changed: \" << changed;\n    XLA_VLOG_LINES(3, computation->ToString());\n  }\n  return changed;\n}\n\n}  \/\/ namespace gpu\n}  \/\/ namespace xla\n<commit_msg>[XLA:GPU] Do not merge fusions that are not loop fusions.<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#include \"tensorflow\/compiler\/xla\/service\/gpu\/fusion_merger.h\"\n\n#include <algorithm>\n\n#include \"tensorflow\/compiler\/xla\/service\/hlo_cost_analysis.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/compiler\/xla\/util.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/strings\/str_util.h\"\n\nnamespace xla {\nnamespace gpu {\n\nnamespace {\n\n\/\/ Traverses users of tuple shape, adding leaf instructions to 'instructions'.\nvoid MaybeResolveTupleElements(HloInstruction* instruction,\n                               std::vector<HloInstruction*>* instructions) {\n  if (ShapeUtil::IsTuple(instruction->shape())) {\n    for (auto tuple_user : instruction->users()) {\n      MaybeResolveTupleElements(tuple_user, instructions);\n    }\n  } else {\n    instructions->push_back(instruction);\n  }\n}\n\n\/\/ Returns the bytes read by fusion parameter 'param', by returning the byte\n\/\/ size of 'param' shape (or the cumulative byte sizes of all leaf tuple\n\/\/ elements if 'param' is tuple-shaped).\n\/\/ In the special case where all users of 'param' (or all users of a leaf\n\/\/ tuple element if 'param' is tuple-shaped) are Slice instructions, the size\n\/\/ of each slice instruction is accumulated instead, to give a more accurate\n\/\/ value for bytes read.\ndouble CalculateBytesReadByFusionParameter(HloInstruction* param) {\n  CHECK_EQ(HloOpcode::kParameter, param->opcode());\n\n  \/\/ Adds all leaf tuple elements to 'instructions' if 'param' is tuple-shaped.\n  \/\/ Adds 'param' to 'instructions' otherwise.\n  std::vector<HloInstruction*> instructions;\n  MaybeResolveTupleElements(param, &instructions);\n\n  \/\/ Iterate through 'instructions' accumulating byte sizes of each instruction\n  \/\/ shape. For each 'instruction' in 'instructions', if all users of\n  \/\/ 'instruction' are Slice instructions, accumuates the byte sizes of each\n  \/\/ Slice for a more accurate estimate of bytes read.\n  double bytes = 0.0;\n  for (auto& instruction : instructions) {\n    if (std::all_of(instruction->users().begin(), instruction->users().end(),\n                    [](const HloInstruction* instruction) {\n                      return instruction->opcode() == HloOpcode::kSlice ||\n                             instruction->opcode() == HloOpcode::kDynamicSlice;\n                    })) {\n      \/\/ All users are slice: accumulate bytes of all user slice instructions.\n      for (auto& user : instruction->users()) {\n        bytes += ShapeUtil::ByteSizeOf(user->shape());\n      }\n    } else {\n      \/\/ Some users are not slice: accumulate full size of 'instruction'.\n      bytes += ShapeUtil::ByteSizeOf(instruction->shape());\n    }\n  }\n  return bytes;\n}\n\n\/\/ Returns the bytes read by all fusion parameters of instruction 'fusion'.\ndouble CalculateBytesReadByFusionInstruction(HloInstruction* fusion) {\n  double bytes = 0.0;\n  for (const auto& fused_instruction : fusion->fused_instructions()) {\n    if (fused_instruction->opcode() != HloOpcode::kParameter) {\n      continue;\n    }\n    bytes += CalculateBytesReadByFusionParameter(fused_instruction.get());\n  }\n  return bytes;\n}\n\n\/\/ Returns the flops to bytes transferred ratio of instruction 'fusion'.\ndouble CalculateFlopsToBytesRatio(HloInstruction* fusion) {\n  CHECK_EQ(HloOpcode::kFusion, fusion->opcode());\n  \/\/ Calculate total bytes transferred in\/out.\n  double bytes = CalculateBytesReadByFusionInstruction(fusion);\n  \/\/ Add bytes written to root instructions buffer.\n  bytes += ShapeUtil::ByteSizeOf(fusion->fused_expression_root()->shape());\n  \/\/ Calculate flops for all fused instructions.\n  HloCostAnalysis analysis;\n  TF_CHECK_OK(fusion->fused_expression_root()->Accept(&analysis));\n  \/\/ Return flops \/ bytes.\n  return bytes > 0.0 ? analysis.flop_count() \/ bytes : analysis.flop_count();\n}\n\n\/\/ Returns bytes transferred by instruction 'fusion', including the bytes\n\/\/ that would be read by all users.\ndouble GetCurrentBytesTransferred(HloInstruction* fusion) {\n  CHECK_EQ(HloOpcode::kFusion, fusion->opcode());\n  const double bytes_read = CalculateBytesReadByFusionInstruction(fusion);\n  const double bytes_written =\n      ShapeUtil::ByteSizeOf(fusion->fused_expression_root()->shape());\n  \/\/ Current bytes transferred (ignoring non 'fusion' user operands) is bytes\n  \/\/ read and written by 'fusion', plus reads of size 'bytes_written' for each\n  \/\/ user.\n  return bytes_read + bytes_written * (fusion->user_count() + 1);\n}\n\n\/\/ Returns bytes transferred if 'fusion' were to be merged into its users.\ndouble GetMergedBytesTransferred(HloInstruction* fusion) {\n  CHECK_EQ(HloOpcode::kFusion, fusion->opcode());\n  return CalculateBytesReadByFusionInstruction(fusion) * fusion->user_count();\n}\n\n}  \/\/ anonymous namespace\n\n\/\/ FusionInstructionMerger visits all fusion instructions in 'computation'\n\/\/ in post order, attempting to merge each into all of its users.\n\/\/ Accumulates and reports stats on successful\/failed merge attempts.\nclass FusionInstructionMerger {\n public:\n  explicit FusionInstructionMerger(HloComputation* computation)\n      : computation_(computation) {}\n\n  Status Run();\n\n  bool changed() const { return changed_; }\n\n private:\n  Status HandleFusion(HloInstruction* fusion);\n\n  HloComputation* computation_;\n  bool changed_ = false;\n\n  \/\/ Fusion instruction merge stats.\n  int total_visited_ = 0;\n  int total_merged_ = 0;\n  int num_fail_no_users_ = 0;\n  int num_fail_not_loop_fusion_ = 0;\n  int num_fail_merge_all_users_ = 0;\n  int num_fail_flops_to_byte_ratio_ = 0;\n  int num_fail_net_bytes_transferred_ratio_ = 0;\n\n  TF_DISALLOW_COPY_AND_ASSIGN(FusionInstructionMerger);\n};\n\nStatus FusionInstructionMerger::Run() {\n  for (auto* instruction : computation_->MakeInstructionPostOrder()) {\n    if (instruction->opcode() == HloOpcode::kFusion) {\n      TF_RETURN_IF_ERROR(HandleFusion(instruction));\n    }\n  }\n\n  VLOG(1) << \"FusionInstructionMerger EXIT\"\n          << \" computation: \" << computation_->name()\n          << \" total_visited: \" << total_visited_\n          << \" total_merged: \" << total_merged_ << \" merge failures { \"\n          << \" no_users: \" << num_fail_no_users_\n          << \" not_loop_fusion: \" << num_fail_not_loop_fusion_\n          << \" merge_all_users: \" << num_fail_merge_all_users_\n          << \" flops_to_byte_ratio: \" << num_fail_flops_to_byte_ratio_\n          << \" net_bytes_transferred: \" << num_fail_net_bytes_transferred_ratio_\n          << \" }\";\n  return Status::OK();\n}\n\nStatus FusionInstructionMerger::HandleFusion(HloInstruction* fusion) {\n  VLOG(3) << \"FusionInstructionMerger ENTRY fusion: \" << fusion->name()\n          << \" flops_to_bytes_ratio: \" << CalculateFlopsToBytesRatio(fusion);\n  ++total_visited_;\n  \/\/ Skip 'fusion' instruction if there are no users into which we can merge.\n  if (fusion->users().empty()) {\n    ++num_fail_no_users_;\n    return Status::OK();\n  }\n\n  \/\/ Skip 'fusion' instruction if it is not a loop fusion. Library fusion\n  \/\/ instructions match specific patterns, so they shouldn't be further fused.\n  \/\/ Input fusion instructions need to be rooted at a particular HLO (e.g.\n  \/\/ kReduce), so they shouldn't be further fused either.\n  if (fusion->fusion_kind() != HloInstruction::FusionKind::kLoop) {\n    ++num_fail_not_loop_fusion_;\n    return Status::OK();\n  }\n  \/\/ Skip 'fusion' instruction if we cannot merge into all of its users.\n  \/\/ Merging into all users enables the removal of 'fusion' from the\n  \/\/ computation.\n  if (!std::all_of(fusion->users().begin(), fusion->users().end(),\n                   [](const HloInstruction* instruction) {\n                     return instruction->opcode() == HloOpcode::kFusion &&\n                            instruction->fusion_kind() ==\n                                HloInstruction::FusionKind::kLoop;\n                   })) {\n    ++num_fail_merge_all_users_;\n    return Status::OK();\n  }\n  \/\/ Skip 'fusion' instruction if its flops to bytes transferred ratio\n  \/\/ exceeds the threshold value.\n  if (CalculateFlopsToBytesRatio(fusion) >\n      FusionMerger::GetThresholdFlopsToBytesRatio()) {\n    ++num_fail_flops_to_byte_ratio_;\n    return Status::OK();\n  }\n  \/\/ Skip 'fusion' instruction if merging it into all users would result in a\n  \/\/ net increase in bytes transferred (currently allowing the net bytes\n  \/\/ transferred to be exceeded up to ~10% in exhange for eliminating the\n  \/\/ overhead from a GPU kernel launch).\n  const double current_bytes_transferred = GetCurrentBytesTransferred(fusion);\n  const double merged_bytes_transferred = GetMergedBytesTransferred(fusion);\n  const double merged_to_current_bytes_ratio =\n      merged_bytes_transferred \/ std::max(1.0, current_bytes_transferred);\n  if (merged_to_current_bytes_ratio > 1.10) {\n    ++num_fail_net_bytes_transferred_ratio_;\n    return Status::OK();\n  }\n  \/\/ Merge fused instructions from 'fusion' into each user.\n  std::set<HloInstruction*> users = fusion->users();\n  for (HloInstruction* user : users) {\n    user->MergeFusionInstruction(fusion);\n    changed_ = true;\n  }\n  ++total_merged_;\n  VLOG(2) << \"Merged fusion instruction: \" << fusion->name()\n          << \" flops_to_bytes_ratio: \" << CalculateFlopsToBytesRatio(fusion)\n          << \" merged_to_current_bytes_ratio: \" << merged_to_current_bytes_ratio\n          << \" into users { \"\n          << tensorflow::str_util::Join(users, \", \",\n                                        [](string* out, HloInstruction* user) {\n                                          tensorflow::strings::StrAppend(\n                                              out, user->name());\n                                        })\n          << \" }\";\n  \/\/ Remove 'fusion' instruction.\n  CHECK_EQ(0, fusion->user_count());\n  computation_->RemoveInstruction(fusion);\n  return Status::OK();\n}\n\nStatusOr<bool> FusionMerger::Run(HloModule* module) {\n  bool changed = false;\n  VLOG(2) << \"FusionMerger for module: \" << module->name();\n  for (auto& computation : module->computations()) {\n    VLOG(1) << \"Before running FusionInstructionMerger for computation: \"\n            << computation->name();\n    XLA_VLOG_LINES(3, computation->ToString());\n\n    FusionInstructionMerger fusion_merger(computation.get());\n    TF_RETURN_IF_ERROR(fusion_merger.Run());\n    changed |= fusion_merger.changed();\n\n    VLOG(1) << \"After running FusionInstructionMerger for computation: \"\n            << computation->name() << \" changed: \" << changed;\n    XLA_VLOG_LINES(3, computation->ToString());\n  }\n  return changed;\n}\n\n}  \/\/ namespace gpu\n}  \/\/ namespace xla\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 <stdint.h>\n\n#include \"tensorflow\/lite\/micro\/all_ops_resolver.h\"\n#include \"tensorflow\/lite\/micro\/benchmarks\/keyword_scrambled_model_data.h\"\n#include \"tensorflow\/lite\/micro\/recording_micro_allocator.h\"\n#include \"tensorflow\/lite\/micro\/recording_micro_interpreter.h\"\n#include \"tensorflow\/lite\/micro\/testing\/micro_test.h\"\n#include \"tensorflow\/lite\/micro\/testing\/test_conv_model.h\"\n\n\/**\n * Tests to ensure arena memory allocation does not regress by more than 3%.\n *\/\n\nnamespace {\n\n\/\/ Ensure memory doesn't expand more that 3%:\nconstexpr float kAllocationThreshold = 0.03;\n\n\/\/ TODO(b\/160617245): Record persistent allocations to provide a more accurate\n\/\/ number here.\nconstexpr float kAllocationTailMiscCeiling = 2 * 1024;\n\nconst bool kIs64BitSystem = (sizeof(void*) == 8);\n\nconstexpr int kKeywordModelTensorArenaSize = 22 * 1024;\nuint8_t keyword_model_tensor_arena[kKeywordModelTensorArenaSize];\n\nconstexpr int kKeywordModelTensorCount = 54;\nconstexpr int kKeywordModelNodeAndRegistrationCount = 15;\n\n\/\/ NOTE: These values are measured on x86-64:\n\/\/ TODO(b\/158651472): Consider auditing these values on non-64 bit systems.\n\/\/\n\/\/ Run this test with '--copt=-DTF_LITE_STATIC_MEMORY' to get optimized memory\n\/\/ runtime values:\n#ifdef TF_LITE_STATIC_MEMORY\nconstexpr int kKeywordModelTotalSize = 18192;\nconstexpr int kKeywordModelTailSize = 17520;\n#else\nconstexpr int kKeywordModelTotalSize = 21152;\nconstexpr int kKeywordModelTailSize = 20480;\n#endif\nconstexpr int kKeywordModelHeadSize = 672;\nconstexpr int kKeywordModelTfLiteTensorVariableBufferDataSize = 10240;\nconstexpr int kKeywordModelTfLiteTensorQuantizationDataSize = 1728;\nconstexpr int kKeywordModelOpRuntimeDataSize = 148;\n\nconstexpr int kTestConvModelArenaSize = 12 * 1024;\nuint8_t test_conv_tensor_arena[kTestConvModelArenaSize];\n\nconstexpr int kTestConvModelTensorCount = 15;\nconstexpr int kTestConvModelNodeAndRegistrationCount = 7;\n\n\/\/ NOTE: These values are measured on x86-64:\n\/\/ TODO(b\/158651472): Consider auditing these values on non-64 bit systems.\n#ifdef TF_LITE_STATIC_MEMORY\nconstexpr int kTestConvModelTotalSize = 10816;\nconstexpr int kTestConvModelTailSize = 3072;\n#else\nconstexpr int kTestConvModelTotalSize = 11712;\nconstexpr int kTestConvModelTailSize = 3968;\n#endif\nconstexpr int kTestConvModelHeadSize = 7744;\nconstexpr int kTestConvModelTfLiteTensorQuantizationDataSize = 768;\nconstexpr int kTestConvModelOpRuntimeDataSize = 136;\n\nstruct ModelAllocationThresholds {\n  size_t tensor_count = 0;\n  size_t node_and_registration_count = 0;\n  size_t total_alloc_size = 0;\n  size_t head_alloc_size = 0;\n  size_t tail_alloc_size = 0;\n  size_t tensor_variable_buffer_data_size = 0;\n  size_t tensor_quantization_data_size = 0;\n  size_t op_runtime_data_size = 0;\n};\n\nvoid EnsureAllocatedSizeThreshold(const char* allocation_type, size_t actual,\n                                  size_t expected) {\n  \/\/ TODO(b\/158651472): Better auditing of non-64 bit systems:\n  if (kIs64BitSystem) {\n    \/\/ 64-bit systems should check floor and ceiling to catch memory savings:\n    TF_LITE_MICRO_EXPECT_NEAR(actual, expected, kAllocationThreshold);\n    if (actual != expected) {\n      TF_LITE_REPORT_ERROR(micro_test::reporter,\n                           \"%s threshold failed: %d != %d\", allocation_type,\n                           actual, expected);\n    }\n  } else {\n    \/\/ Non-64 bit systems should just expect allocation does not exceed the\n    \/\/ ceiling:\n    TF_LITE_MICRO_EXPECT_LE(actual, expected + expected * kAllocationThreshold);\n  }\n}\n\nvoid ValidateModelAllocationThresholds(\n    const tflite::RecordingMicroAllocator& allocator,\n    const ModelAllocationThresholds& thresholds) {\n  allocator.PrintAllocations();\n\n  EnsureAllocatedSizeThreshold(\n      \"Total\", allocator.GetSimpleMemoryAllocator()->GetUsedBytes(),\n      thresholds.total_alloc_size);\n  EnsureAllocatedSizeThreshold(\n      \"Head\", allocator.GetSimpleMemoryAllocator()->GetHeadUsedBytes(),\n      thresholds.head_alloc_size);\n  EnsureAllocatedSizeThreshold(\n      \"Tail\", allocator.GetSimpleMemoryAllocator()->GetTailUsedBytes(),\n      thresholds.tail_alloc_size);\n  EnsureAllocatedSizeThreshold(\n      \"TfLiteTensor\",\n      allocator\n          .GetRecordedAllocation(\n              tflite::RecordedAllocationType::kTfLiteTensorArray)\n          .used_bytes,\n      sizeof(TfLiteTensor) * thresholds.tensor_count);\n  EnsureAllocatedSizeThreshold(\n      \"VariableBufferData\",\n      allocator\n          .GetRecordedAllocation(\n              tflite::RecordedAllocationType::kTfLiteTensorVariableBufferData)\n          .used_bytes,\n      thresholds.tensor_variable_buffer_data_size);\n  EnsureAllocatedSizeThreshold(\n      \"QuantizationData\",\n      allocator\n          .GetRecordedAllocation(tflite::RecordedAllocationType::\n                                     kTfLiteTensorArrayQuantizationData)\n          .used_bytes,\n      thresholds.tensor_quantization_data_size);\n  EnsureAllocatedSizeThreshold(\n      \"NodeAndRegistration\",\n      allocator\n          .GetRecordedAllocation(\n              tflite::RecordedAllocationType::kNodeAndRegistrationArray)\n          .used_bytes,\n      sizeof(tflite::NodeAndRegistration) *\n          thresholds.node_and_registration_count);\n  EnsureAllocatedSizeThreshold(\n      \"OpData\",\n      allocator.GetRecordedAllocation(tflite::RecordedAllocationType::kOpData)\n          .used_bytes,\n      thresholds.op_runtime_data_size);\n\n  \/\/ Ensure tail allocation recording is not missing any large chunks:\n  size_t tail_est_length = sizeof(TfLiteTensor) * thresholds.tensor_count +\n                           thresholds.tensor_quantization_data_size +\n                           thresholds.tensor_variable_buffer_data_size +\n                           sizeof(tflite::NodeAndRegistration) *\n                               thresholds.node_and_registration_count +\n                           thresholds.op_runtime_data_size;\n  TF_LITE_MICRO_EXPECT_LE(thresholds.tail_alloc_size - tail_est_length,\n                          kAllocationTailMiscCeiling);\n}\n\n}  \/\/ namespace\n\nTF_LITE_MICRO_TESTS_BEGIN\n\nTF_LITE_MICRO_TEST(TestKeywordModelMemoryThreshold) {\n  tflite::AllOpsResolver all_ops_resolver;\n  tflite::RecordingMicroInterpreter interpreter(\n      tflite::GetModel(g_keyword_scrambled_model_data), all_ops_resolver,\n      keyword_model_tensor_arena, kKeywordModelTensorArenaSize,\n      micro_test::reporter);\n\n  interpreter.AllocateTensors();\n\n  ModelAllocationThresholds thresholds;\n  thresholds.tensor_count = kKeywordModelTensorCount;\n  thresholds.node_and_registration_count =\n      kKeywordModelNodeAndRegistrationCount;\n  thresholds.total_alloc_size = kKeywordModelTotalSize;\n  thresholds.head_alloc_size = kKeywordModelHeadSize;\n  thresholds.tail_alloc_size = kKeywordModelTailSize;\n  thresholds.tensor_variable_buffer_data_size =\n      kKeywordModelTfLiteTensorVariableBufferDataSize;\n  thresholds.tensor_quantization_data_size =\n      kKeywordModelTfLiteTensorQuantizationDataSize;\n  thresholds.op_runtime_data_size = kKeywordModelOpRuntimeDataSize;\n\n  ValidateModelAllocationThresholds(interpreter.GetMicroAllocator(),\n                                    thresholds);\n}\n\nTF_LITE_MICRO_TEST(TestConvModelMemoryThreshold) {\n  tflite::AllOpsResolver all_ops_resolver;\n  tflite::RecordingMicroInterpreter interpreter(\n      tflite::GetModel(kTestConvModelData), all_ops_resolver,\n      test_conv_tensor_arena, kTestConvModelArenaSize, micro_test::reporter);\n\n  interpreter.AllocateTensors();\n\n  ModelAllocationThresholds thresholds;\n  thresholds.tensor_count = kTestConvModelTensorCount;\n  thresholds.node_and_registration_count =\n      kTestConvModelNodeAndRegistrationCount;\n  thresholds.total_alloc_size = kTestConvModelTotalSize;\n  thresholds.head_alloc_size = kTestConvModelHeadSize;\n  thresholds.tail_alloc_size = kTestConvModelTailSize;\n  thresholds.tensor_quantization_data_size =\n      kTestConvModelTfLiteTensorQuantizationDataSize;\n  thresholds.op_runtime_data_size = kTestConvModelOpRuntimeDataSize;\n\n  ValidateModelAllocationThresholds(interpreter.GetMicroAllocator(),\n                                    thresholds);\n}\n\nTF_LITE_MICRO_TESTS_END\n<commit_msg>Fix memory \"near\" tests for thresholds.<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 <stdint.h>\n\n#include \"tensorflow\/lite\/micro\/all_ops_resolver.h\"\n#include \"tensorflow\/lite\/micro\/benchmarks\/keyword_scrambled_model_data.h\"\n#include \"tensorflow\/lite\/micro\/recording_micro_allocator.h\"\n#include \"tensorflow\/lite\/micro\/recording_micro_interpreter.h\"\n#include \"tensorflow\/lite\/micro\/testing\/micro_test.h\"\n#include \"tensorflow\/lite\/micro\/testing\/test_conv_model.h\"\n\n\/**\n * Tests to ensure arena memory allocation does not regress by more than 3%.\n *\/\n\nnamespace {\n\n\/\/ Ensure memory doesn't expand more that 3%:\nconstexpr float kAllocationThreshold = 0.03;\n\n\/\/ TODO(b\/160617245): Record persistent allocations to provide a more accurate\n\/\/ number here.\nconstexpr float kAllocationTailMiscCeiling = 2 * 1024;\n\nconst bool kIs64BitSystem = (sizeof(void*) == 8);\n\nconstexpr int kKeywordModelTensorArenaSize = 22 * 1024;\nuint8_t keyword_model_tensor_arena[kKeywordModelTensorArenaSize];\n\nconstexpr int kKeywordModelTensorCount = 54;\nconstexpr int kKeywordModelNodeAndRegistrationCount = 15;\n\n\/\/ NOTE: These values are measured on x86-64:\n\/\/ TODO(b\/158651472): Consider auditing these values on non-64 bit systems.\n\/\/\n\/\/ Run this test with '--copt=-DTF_LITE_STATIC_MEMORY' to get optimized memory\n\/\/ runtime values:\n#ifdef TF_LITE_STATIC_MEMORY\nconstexpr int kKeywordModelTotalSize = 18192;\nconstexpr int kKeywordModelTailSize = 17520;\n#else\nconstexpr int kKeywordModelTotalSize = 21152;\nconstexpr int kKeywordModelTailSize = 20480;\n#endif\nconstexpr int kKeywordModelHeadSize = 672;\nconstexpr int kKeywordModelTfLiteTensorVariableBufferDataSize = 10240;\nconstexpr int kKeywordModelTfLiteTensorQuantizationDataSize = 1728;\nconstexpr int kKeywordModelOpRuntimeDataSize = 148;\n\nconstexpr int kTestConvModelArenaSize = 12 * 1024;\nuint8_t test_conv_tensor_arena[kTestConvModelArenaSize];\n\nconstexpr int kTestConvModelTensorCount = 15;\nconstexpr int kTestConvModelNodeAndRegistrationCount = 7;\n\n\/\/ NOTE: These values are measured on x86-64:\n\/\/ TODO(b\/158651472): Consider auditing these values on non-64 bit systems.\n#ifdef TF_LITE_STATIC_MEMORY\nconstexpr int kTestConvModelTotalSize = 10816;\nconstexpr int kTestConvModelTailSize = 3072;\n#else\nconstexpr int kTestConvModelTotalSize = 11712;\nconstexpr int kTestConvModelTailSize = 3968;\n#endif\nconstexpr int kTestConvModelHeadSize = 7744;\nconstexpr int kTestConvModelTfLiteTensorQuantizationDataSize = 768;\nconstexpr int kTestConvModelOpRuntimeDataSize = 136;\n\nstruct ModelAllocationThresholds {\n  size_t tensor_count = 0;\n  size_t node_and_registration_count = 0;\n  size_t total_alloc_size = 0;\n  size_t head_alloc_size = 0;\n  size_t tail_alloc_size = 0;\n  size_t tensor_variable_buffer_data_size = 0;\n  size_t tensor_quantization_data_size = 0;\n  size_t op_runtime_data_size = 0;\n};\n\nvoid EnsureAllocatedSizeThreshold(const char* allocation_type, size_t actual,\n                                  size_t expected) {\n  \/\/ TODO(b\/158651472): Better auditing of non-64 bit systems:\n  if (kIs64BitSystem) {\n    \/\/ 64-bit systems should check floor and ceiling to catch memory savings:\n    TF_LITE_MICRO_EXPECT_NEAR(actual, expected,\n                              expected * kAllocationThreshold);\n    if (actual != expected) {\n      TF_LITE_REPORT_ERROR(micro_test::reporter,\n                           \"%s threshold failed: %d != %d\", allocation_type,\n                           actual, expected);\n    }\n  } else {\n    \/\/ Non-64 bit systems should just expect allocation does not exceed the\n    \/\/ ceiling:\n    TF_LITE_MICRO_EXPECT_LE(actual, expected + expected * kAllocationThreshold);\n  }\n}\n\nvoid ValidateModelAllocationThresholds(\n    const tflite::RecordingMicroAllocator& allocator,\n    const ModelAllocationThresholds& thresholds) {\n  allocator.PrintAllocations();\n\n  EnsureAllocatedSizeThreshold(\n      \"Total\", allocator.GetSimpleMemoryAllocator()->GetUsedBytes(),\n      thresholds.total_alloc_size);\n  EnsureAllocatedSizeThreshold(\n      \"Head\", allocator.GetSimpleMemoryAllocator()->GetHeadUsedBytes(),\n      thresholds.head_alloc_size);\n  EnsureAllocatedSizeThreshold(\n      \"Tail\", allocator.GetSimpleMemoryAllocator()->GetTailUsedBytes(),\n      thresholds.tail_alloc_size);\n  EnsureAllocatedSizeThreshold(\n      \"TfLiteTensor\",\n      allocator\n          .GetRecordedAllocation(\n              tflite::RecordedAllocationType::kTfLiteTensorArray)\n          .used_bytes,\n      sizeof(TfLiteTensor) * thresholds.tensor_count);\n  EnsureAllocatedSizeThreshold(\n      \"VariableBufferData\",\n      allocator\n          .GetRecordedAllocation(\n              tflite::RecordedAllocationType::kTfLiteTensorVariableBufferData)\n          .used_bytes,\n      thresholds.tensor_variable_buffer_data_size);\n  EnsureAllocatedSizeThreshold(\n      \"QuantizationData\",\n      allocator\n          .GetRecordedAllocation(tflite::RecordedAllocationType::\n                                     kTfLiteTensorArrayQuantizationData)\n          .used_bytes,\n      thresholds.tensor_quantization_data_size);\n  EnsureAllocatedSizeThreshold(\n      \"NodeAndRegistration\",\n      allocator\n          .GetRecordedAllocation(\n              tflite::RecordedAllocationType::kNodeAndRegistrationArray)\n          .used_bytes,\n      sizeof(tflite::NodeAndRegistration) *\n          thresholds.node_and_registration_count);\n  EnsureAllocatedSizeThreshold(\n      \"OpData\",\n      allocator.GetRecordedAllocation(tflite::RecordedAllocationType::kOpData)\n          .used_bytes,\n      thresholds.op_runtime_data_size);\n\n  \/\/ Ensure tail allocation recording is not missing any large chunks:\n  size_t tail_est_length = sizeof(TfLiteTensor) * thresholds.tensor_count +\n                           thresholds.tensor_quantization_data_size +\n                           thresholds.tensor_variable_buffer_data_size +\n                           sizeof(tflite::NodeAndRegistration) *\n                               thresholds.node_and_registration_count +\n                           thresholds.op_runtime_data_size;\n  TF_LITE_MICRO_EXPECT_LE(thresholds.tail_alloc_size - tail_est_length,\n                          kAllocationTailMiscCeiling);\n}\n\n}  \/\/ namespace\n\nTF_LITE_MICRO_TESTS_BEGIN\n\nTF_LITE_MICRO_TEST(TestKeywordModelMemoryThreshold) {\n  tflite::AllOpsResolver all_ops_resolver;\n  tflite::RecordingMicroInterpreter interpreter(\n      tflite::GetModel(g_keyword_scrambled_model_data), all_ops_resolver,\n      keyword_model_tensor_arena, kKeywordModelTensorArenaSize,\n      micro_test::reporter);\n\n  interpreter.AllocateTensors();\n\n  ModelAllocationThresholds thresholds;\n  thresholds.tensor_count = kKeywordModelTensorCount;\n  thresholds.node_and_registration_count =\n      kKeywordModelNodeAndRegistrationCount;\n  thresholds.total_alloc_size = kKeywordModelTotalSize;\n  thresholds.head_alloc_size = kKeywordModelHeadSize;\n  thresholds.tail_alloc_size = kKeywordModelTailSize;\n  thresholds.tensor_variable_buffer_data_size =\n      kKeywordModelTfLiteTensorVariableBufferDataSize;\n  thresholds.tensor_quantization_data_size =\n      kKeywordModelTfLiteTensorQuantizationDataSize;\n  thresholds.op_runtime_data_size = kKeywordModelOpRuntimeDataSize;\n\n  ValidateModelAllocationThresholds(interpreter.GetMicroAllocator(),\n                                    thresholds);\n}\n\nTF_LITE_MICRO_TEST(TestConvModelMemoryThreshold) {\n  tflite::AllOpsResolver all_ops_resolver;\n  tflite::RecordingMicroInterpreter interpreter(\n      tflite::GetModel(kTestConvModelData), all_ops_resolver,\n      test_conv_tensor_arena, kTestConvModelArenaSize, micro_test::reporter);\n\n  interpreter.AllocateTensors();\n\n  ModelAllocationThresholds thresholds;\n  thresholds.tensor_count = kTestConvModelTensorCount;\n  thresholds.node_and_registration_count =\n      kTestConvModelNodeAndRegistrationCount;\n  thresholds.total_alloc_size = kTestConvModelTotalSize;\n  thresholds.head_alloc_size = kTestConvModelHeadSize;\n  thresholds.tail_alloc_size = kTestConvModelTailSize;\n  thresholds.tensor_quantization_data_size =\n      kTestConvModelTfLiteTensorQuantizationDataSize;\n  thresholds.op_runtime_data_size = kTestConvModelOpRuntimeDataSize;\n\n  ValidateModelAllocationThresholds(interpreter.GetMicroAllocator(),\n                                    thresholds);\n}\n\nTF_LITE_MICRO_TESTS_END\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Added `#include` guard.<commit_after><|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#include \"libmesh\/diff_system.h\"\n#include \"libmesh\/euler2_solver.h\"\n\nnamespace libMesh\n{\n\n\n\nEuler2Solver::Euler2Solver (sys_type& s)\n  : UnsteadySolver(s), theta(1.)\n{\n}\n\n\n\nEuler2Solver::~Euler2Solver ()\n{\n}\n\n\n\nReal Euler2Solver::error_order() const\n{\n  if (theta == 0.5)\n    return 2.;\n  return 1.;\n}\n\n\n\n\nbool Euler2Solver::element_residual (bool request_jacobian,\n                                     DiffContext &context)\n{\n  return this->_general_residual(request_jacobian,\n                                 context,\n                                 &DifferentiablePhysics::mass_residual,\n                                 &DifferentiablePhysics::_eulerian_time_deriv,\n                                 &DifferentiablePhysics::element_constraint,\n                                 &DiffContext::elem_reinit);\n}\n\n\n\nbool Euler2Solver::side_residual (bool request_jacobian,\n                                  DiffContext &context)\n{\n  return this->_general_residual(request_jacobian,\n                                 context,\n                                 &DifferentiablePhysics::side_mass_residual,\n                                 &DifferentiablePhysics::side_time_derivative,\n                                 &DifferentiablePhysics::side_constraint,\n                                 &DiffContext::elem_side_reinit);\n}\n\n\n\nbool Euler2Solver::nonlocal_residual (bool request_jacobian,\n                                      DiffContext &context)\n{\n  return this->_general_residual(request_jacobian,\n                                 context,\n                                 &DifferentiablePhysics::nonlocal_mass_residual,\n                                 &DifferentiablePhysics::nonlocal_time_derivative,\n                                 &DifferentiablePhysics::nonlocal_constraint,\n                                 &DiffContext::nonlocal_reinit);\n}\n\n\n\nbool Euler2Solver::_general_residual (bool request_jacobian,\n                                      DiffContext &context,\n                                      ResFuncType mass,\n                                      ResFuncType time_deriv,\n                                      ResFuncType constraint,\n                                      ReinitFuncType reinit_func)\n{\n  unsigned int n_dofs = context.get_elem_solution().size();\n\n  \/\/ Local nonlinear solution at old timestep\n  DenseVector<Number> old_elem_solution(n_dofs);\n  for (unsigned int i=0; i != n_dofs; ++i)\n    old_elem_solution(i) =\n      old_nonlinear_solution(context.get_dof_indices()[i]);\n\n  \/\/ Local time derivative of solution\n  context.get_elem_solution_rate() = context.get_elem_solution();\n  context.get_elem_solution_rate() -= old_elem_solution;\n  context.elem_solution_rate_derivative = 1 \/ _system.deltat;\n  context.get_elem_solution_rate() *=\n    context.elem_solution_rate_derivative;\n\n  \/\/ Our first evaluations are at the final elem_solution\n  context.elem_solution_derivative = 1.0;\n\n  \/\/ If a fixed solution is requested, we'll use the elem_solution\n  \/\/ at the new timestep\n  \/\/ FIXME - should this be the theta solution instead?\n  if (_system.use_fixed_solution)\n    context.get_elem_fixed_solution() = context.get_elem_solution();\n\n  context.fixed_solution_derivative = 1.0;\n\n  \/\/ We might need to save the old jacobian in case one of our physics\n  \/\/ terms later is unable to update it analytically.\n  DenseMatrix<Number> old_elem_jacobian(n_dofs, n_dofs);\n  if (request_jacobian)\n    old_elem_jacobian.swap(context.get_elem_jacobian());\n\n  \/\/ Local time derivative of solution\n  context.get_elem_solution_rate() = context.get_elem_solution();\n  context.get_elem_solution_rate() -= old_elem_solution;\n  context.elem_solution_rate_derivative = 1 \/ _system.deltat;\n  context.get_elem_solution_rate() *=\n    context.elem_solution_rate_derivative;\n\n  \/\/ First, evaluate time derivative at the new timestep.\n  \/\/ The element should already be in the proper place\n  \/\/ even for a moving mesh problem.\n  bool jacobian_computed =\n    (_system.*time_deriv)(request_jacobian, context);\n\n  \/\/ Next, evaluate the mass residual at the new timestep\n\n  jacobian_computed = (_system.*mass)(jacobian_computed, context) &&\n    jacobian_computed;\n\n  \/\/ Add the constraint term\n  jacobian_computed = (_system.*constraint)(jacobian_computed, context) &&\n    jacobian_computed;\n\n  \/\/ Add the time-dependent term for the old solution\n\n  \/\/ Make sure elem_solution is set up for elem_reinit to use\n  \/\/ Move elem_->old_, old_->elem_\n  context.get_elem_solution().swap(old_elem_solution);\n  context.elem_solution_derivative = 0.0;\n\n  \/\/ Move the mesh into place first if necessary\n  (context.*reinit_func)(0.);\n\n  jacobian_computed =\n    (_system.*time_deriv)(jacobian_computed, context) &&\n    jacobian_computed;\n\n  \/\/ Add the mass residual term for the old solution\n\n  \/\/ Evaluating the mass residual at both old and new timesteps will be\n  \/\/ redundant in most problems but may be necessary for time accuracy\n  \/\/ or stability in moving mesh problems or problems with user-overridden\n  \/\/ mass_residual functions\n\n  jacobian_computed =\n    (_system.*mass)(jacobian_computed, context) &&\n    jacobian_computed;\n\n  \/\/ Restore the elem_solution\n  \/\/ Move elem_->elem_, old_->old_\n  context.get_elem_solution().swap(old_elem_solution);\n  context.elem_solution_derivative = 1;\n\n  \/\/ Restore the elem position if necessary\n  (context.*reinit_func)(1.);\n\n  \/\/ Add back (or restore) the old jacobian\n  if (request_jacobian)\n    {\n      if (jacobian_computed)\n        context.get_elem_jacobian() += old_elem_jacobian;\n      else\n        context.get_elem_jacobian().swap(old_elem_jacobian);\n    }\n\n  return jacobian_computed;\n}\n\n\n\n} \/\/ namespace libMesh\n<commit_msg>Fix new Euler2Solver evaluations<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#include \"libmesh\/diff_system.h\"\n#include \"libmesh\/euler2_solver.h\"\n\nnamespace libMesh\n{\n\n\n\nEuler2Solver::Euler2Solver (sys_type& s)\n  : UnsteadySolver(s), theta(1.)\n{\n}\n\n\n\nEuler2Solver::~Euler2Solver ()\n{\n}\n\n\n\nReal Euler2Solver::error_order() const\n{\n  if (theta == 0.5)\n    return 2.;\n  return 1.;\n}\n\n\n\n\nbool Euler2Solver::element_residual (bool request_jacobian,\n                                     DiffContext &context)\n{\n  return this->_general_residual(request_jacobian,\n                                 context,\n                                 &DifferentiablePhysics::mass_residual,\n                                 &DifferentiablePhysics::_eulerian_time_deriv,\n                                 &DifferentiablePhysics::element_constraint,\n                                 &DiffContext::elem_reinit);\n}\n\n\n\nbool Euler2Solver::side_residual (bool request_jacobian,\n                                  DiffContext &context)\n{\n  return this->_general_residual(request_jacobian,\n                                 context,\n                                 &DifferentiablePhysics::side_mass_residual,\n                                 &DifferentiablePhysics::side_time_derivative,\n                                 &DifferentiablePhysics::side_constraint,\n                                 &DiffContext::elem_side_reinit);\n}\n\n\n\nbool Euler2Solver::nonlocal_residual (bool request_jacobian,\n                                      DiffContext &context)\n{\n  return this->_general_residual(request_jacobian,\n                                 context,\n                                 &DifferentiablePhysics::nonlocal_mass_residual,\n                                 &DifferentiablePhysics::nonlocal_time_derivative,\n                                 &DifferentiablePhysics::nonlocal_constraint,\n                                 &DiffContext::nonlocal_reinit);\n}\n\n\n\nbool Euler2Solver::_general_residual (bool request_jacobian,\n                                      DiffContext &context,\n                                      ResFuncType mass,\n                                      ResFuncType time_deriv,\n                                      ResFuncType constraint,\n                                      ReinitFuncType reinit_func)\n{\n  unsigned int n_dofs = context.get_elem_solution().size();\n\n  \/\/ Local nonlinear solution at old timestep\n  DenseVector<Number> old_elem_solution(n_dofs);\n  for (unsigned int i=0; i != n_dofs; ++i)\n    old_elem_solution(i) =\n      old_nonlinear_solution(context.get_dof_indices()[i]);\n\n  \/\/ Local time derivative of solution\n  context.get_elem_solution_rate() = context.get_elem_solution();\n  context.get_elem_solution_rate() -= old_elem_solution;\n  context.elem_solution_rate_derivative = 1 \/ _system.deltat;\n  context.get_elem_solution_rate() *=\n    context.elem_solution_rate_derivative;\n\n  \/\/ Our first evaluations are at the final elem_solution\n  context.elem_solution_derivative = 1.0;\n\n  \/\/ If a fixed solution is requested, we'll use the elem_solution\n  \/\/ at the new timestep\n  \/\/ FIXME - should this be the theta solution instead?\n  if (_system.use_fixed_solution)\n    context.get_elem_fixed_solution() = context.get_elem_solution();\n\n  context.fixed_solution_derivative = 1.0;\n\n  \/\/ We need to save the old jacobian and old residual since we'll be \n  \/\/ multiplying some of the new contributions by theta or 1-theta\n  DenseMatrix<Number> old_elem_jacobian(n_dofs, n_dofs);\n  DenseVector<Number> old_elem_residual(n_dofs);\n  old_elem_residual.swap(context.get_elem_residual());\n  if (request_jacobian)\n    old_elem_jacobian.swap(context.get_elem_jacobian());\n\n  \/\/ Local time derivative of solution\n  context.get_elem_solution_rate() = context.get_elem_solution();\n  context.get_elem_solution_rate() -= old_elem_solution;\n  context.elem_solution_rate_derivative = 1 \/ _system.deltat;\n  context.get_elem_solution_rate() *=\n    context.elem_solution_rate_derivative;\n\n  \/\/ First, evaluate time derivative at the new timestep.\n  \/\/ The element should already be in the proper place\n  \/\/ even for a moving mesh problem.\n  bool jacobian_computed =\n    (_system.*time_deriv)(request_jacobian, context);\n\n  \/\/ Next, evaluate the mass residual at the new timestep\n\n  jacobian_computed = (_system.*mass)(jacobian_computed, context) &&\n    jacobian_computed;\n\n  \/\/ Add the constraint term\n  jacobian_computed = (_system.*constraint)(jacobian_computed, context) &&\n    jacobian_computed;\n\n  \/\/ The new solution's contribution is scaled by theta\n  context.get_elem_residual() *= theta;\n  context.get_elem_jacobian() *= theta;\n\n  \/\/ Save the new solution's term\n  DenseMatrix<Number> elem_jacobian_newterm(n_dofs, n_dofs);\n  DenseVector<Number> elem_residual_newterm(n_dofs);\n  elem_residual_newterm.swap(context.get_elem_residual());\n  if (request_jacobian)\n    elem_jacobian_newterm.swap(context.get_elem_jacobian());\n\n  \/\/ Add the time-dependent term for the old solution\n\n  \/\/ Make sure elem_solution is set up for elem_reinit to use\n  \/\/ Move elem_->old_, old_->elem_\n  context.get_elem_solution().swap(old_elem_solution);\n  context.elem_solution_derivative = 0.0;\n\n  \/\/ Move the mesh into place first if necessary\n  (context.*reinit_func)(0.);\n\n  jacobian_computed =\n    (_system.*time_deriv)(jacobian_computed, context) &&\n    jacobian_computed;\n\n  \/\/ Add the mass residual term for the old solution\n\n  \/\/ Evaluating the mass residual at both old and new timesteps will be\n  \/\/ redundant in most problems but may be necessary for time accuracy\n  \/\/ or stability in moving mesh problems or problems with user-overridden\n  \/\/ mass_residual functions\n\n  jacobian_computed =\n    (_system.*mass)(jacobian_computed, context) &&\n    jacobian_computed;\n\n  \/\/ The old solution's contribution is scaled by (1-theta)\n  context.get_elem_residual() *= (1-theta);\n  context.get_elem_jacobian() *= (1-theta);\n\n  \/\/ Restore the elem_solution\n  \/\/ Move elem_->elem_, old_->old_\n  context.get_elem_solution().swap(old_elem_solution);\n  context.elem_solution_derivative = 1;\n\n  \/\/ Restore the elem position if necessary\n  (context.*reinit_func)(1.);\n\n  \/\/ Add back (or restore) the old residual\/jacobian\n  context.get_elem_residual() += old_elem_residual;\n  if (request_jacobian)\n    {\n      if (jacobian_computed)\n        context.get_elem_jacobian() += old_elem_jacobian;\n      else\n        context.get_elem_jacobian().swap(old_elem_jacobian);\n    }\n\n  \/\/ Add the saved new-solution terms\n  context.get_elem_residual() += elem_residual_newterm;\n  if (jacobian_computed)\n    context.get_elem_jacobian() += elem_jacobian_newterm;\n\n  return jacobian_computed;\n}\n\n\n\n} \/\/ namespace libMesh\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"diff_system.h\"\n#include \"libmesh_logging.h\"\n#include \"linear_solver.h\"\n#include \"newton_solver.h\"\n#include \"numeric_vector.h\"\n#include \"sparse_matrix.h\"\n#include \"dof_map.h\"\n\n\nNewtonSolver::NewtonSolver (sys_type& s)\n  : Parent(s),\n    require_residual_reduction(false),\n    minsteplength(0.0),\n    linear_solver(LinearSolver<Number>::build())\n{\n}\n\n\n\nNewtonSolver::~NewtonSolver ()\n{\n}\n\n\n\nvoid NewtonSolver::reinit()\n{\n  Parent::reinit();\n\n  linear_solver->clear();\n}\n\n\n\nvoid NewtonSolver::solve()\n{\n  START_LOG(\"solve()\", \"NewtonSolver\");\n\n\/\/ Amount by which nonlinear residual should exceed linear solver\n\/\/ tolerance\nconst Real relative_tolerance = 1.e-3;\n\n\n  NumericVector<Number> &solution = *(_system.solution);\n  NumericVector<Number> &newton_iterate =\n    _system.get_vector(\"_nonlinear_solution\");\n  newton_iterate.close();\n  solution.close();\n\n  NumericVector<Number> &rhs = *(_system.rhs);\n\n  SparseMatrix<Number> &matrix = *(_system.matrix);\n\n  \/\/ Prepare to take incomplete steps\n  Real last_residual=0.;\n\n  \/\/ Set starting linear tolerance\n  Real current_linear_tolerance = initial_linear_tolerance;\n\n  \/\/ Now we begin the nonlinear loop\n  for (unsigned int l=0; l<max_nonlinear_iterations; ++l)\n    {\n      PAUSE_LOG(\"solve()\", \"NewtonSolver\");\n      _system.assembly(true, true);\n      RESTART_LOG(\"solve()\", \"NewtonSolver\");\n      rhs.close();\n      Real current_residual = rhs.l2_norm();\n      last_residual = current_residual;\n\n      max_residual_norm = std::max (current_residual,\n                                    max_residual_norm);\n \n      \/\/ Compute the l2 norm of the whole solution\n      Real norm_total = newton_iterate.l2_norm();\n\n      max_solution_norm = std::max(max_solution_norm, norm_total);\n\n      if (!quiet)\n        std::cout << \"Nonlinear Residual: \"\n                  << current_residual << std::endl;\n\n      \/\/ Make sure our linear tolerance is low enough\n      if (current_linear_tolerance > current_residual * relative_tolerance)\n        {\n          current_linear_tolerance = current_residual * relative_tolerance;\n        }\n\n      \/\/ But don't let it be zero\n      if (current_linear_tolerance == 0.)\n        {\n          current_linear_tolerance = TOLERANCE * TOLERANCE;\n        }\n\n      \/\/ At this point newton_iterate is the current guess, and\n      \/\/ solution is now about to become the NEGATIVE of the next\n      \/\/ Newton step.\n\n      \/\/ Our best initial guess for the solution is zero!\n      solution.zero();\n\n      if (!quiet)\n        std::cout << \"Linear solve starting\" << std::endl;\n\n      PAUSE_LOG(\"solve()\", \"NewtonSolver\");\n      \/\/ Solve the linear system.  Two cases:\n      const std::pair<unsigned int, Real> rval =\n        (_system.have_matrix(\"Preconditioner\")) ?\n      \/\/ 1.) User-supplied preconditioner\n        linear_solver->solve (matrix, _system.get_matrix(\"Preconditioner\"),\n                              solution, rhs, current_linear_tolerance,\n                              max_linear_iterations) :\n      \/\/ 2.) Use system matrix for the preconditioner\n        linear_solver->solve (matrix, solution, rhs,\n                              current_linear_tolerance, \n                              max_linear_iterations);\n      \/\/ We may need to localize a parallel solution\n      _system.update ();\n      RESTART_LOG(\"solve()\", \"NewtonSolver\");\n      \/\/ The linear solver may not have fit our constraints exactly\n      _system.get_dof_map().enforce_constraints_exactly(_system);\n\n      if (!quiet)\n        std::cout << \"Linear solve finished, step \" << rval.first\n                  << \", residual \" << rval.second\n                  << \", tolerance \" << current_linear_tolerance\n                  << std::endl;\n\n      \/\/ Compute the l2 norm of the nonlinear update\n      Real norm_delta = solution.l2_norm();\n\n      if (!quiet)\n        std::cout << \"Trying full Newton step\" << std::endl;\n      \/\/ Take a full Newton step\n      newton_iterate.add (-1., solution);\n      newton_iterate.close();\n\n      \/\/ Check residual with full Newton step\n      Real steplength = 1.;\n      PAUSE_LOG(\"solve()\", \"NewtonSolver\");\n      _system.assembly(true, false);\n      RESTART_LOG(\"solve()\", \"NewtonSolver\");\n\n      rhs.close();\n      current_residual = rhs.l2_norm();\n\n      \/\/ backtrack if necessary\n      if (require_residual_reduction)\n        {\n          \/\/ but don't fiddle around if we've already converged\n          if (test_convergence(current_residual, norm_delta))\n            {\n              if (!quiet)\n\t\tprint_convergence(l, current_residual, norm_delta);\n              break;\n            }\n\n          while (current_residual > last_residual)\n            {\n              \/\/ Reduce step size to 1\/2, 1\/4, etc.\n              steplength \/= 2.;\n              norm_delta \/= 2.;\n              if (!quiet)\n                std::cout << \"Shrinking Newton step to \"\n                          << steplength << std::endl;\n              newton_iterate.add (steplength, solution);\n              newton_iterate.close();\n\n              \/\/ Check residual with fractional Newton step\n              PAUSE_LOG(\"solve()\", \"NewtonSolver\");\n              _system.assembly (true, false);\n              RESTART_LOG(\"solve()\", \"NewtonSolver\");\n              current_residual = rhs.l2_norm();\n              if (!quiet)\n                std::cout << \"Current Residual: \"\n                          << current_residual << std::endl;\n\n              if (steplength\/2. < minsteplength && \n                  current_residual > last_residual)\n                {\n                  if (!quiet)\n                    std::cout << \"Inexact Newton step FAILED at step \"\n                              << l << std::endl;\n\n                  error();\n                }\n            }\n        }\n\n      \/\/ Compute the l2 norm of the whole solution\n      norm_total = newton_iterate.l2_norm();\n\n      max_solution_norm = std::max(max_solution_norm, norm_total);\n\n      \/\/ Print out information for the \n      \/\/ nonlinear iterations.\n      if (!quiet)\n        std::cout << \"  Nonlinear step: |du|\/|u| = \"\n                  << norm_delta \/ norm_total\n                  << \", |du| = \" << norm_delta\n                  << std::endl;\n\n      \/\/ Terminate the solution iteration if the difference between\n      \/\/ this iteration and the last is sufficiently small.\n      if (!quiet)\n        print_convergence(l, current_residual,\n                          norm_delta \/ steplength);\n      if (test_convergence(current_residual, norm_delta \/ steplength))\n        {\n          break;\n        }\n      if (l >= max_nonlinear_iterations - 1)\n        {\n          std::cout << \"  Nonlinear solver DIVERGED at step \" << l\n                    << \" with norm \" << norm_total\n                    << std::endl;\n          error();\n          continue;\n        }\n    } \/\/ end nonlinear loop\n\n  \/\/ Copy the final nonlinear iterate into the current_solution,\n  \/\/ for other libMesh functions that expect it\n\n  solution = newton_iterate;\n  solution.close();\n\n  \/\/ We may need to localize a parallel solution\n  _system.update ();\n\n  STOP_LOG(\"solve()\", \"NewtonSolver\");\n}\n\n\n\nbool NewtonSolver::test_convergence(Real current_residual,\n                                    Real step_norm)\n{\n  \/\/ We haven't converged unless we pass a convergence test\n  bool has_converged = false;\n\n  \/\/ Is our absolute residual low enough?\n  if (current_residual < absolute_residual_tolerance)\n    has_converged = true;\n\n  \/\/ Is our relative residual low enough?\n  if ((current_residual \/ max_residual_norm) <\n      relative_residual_tolerance)\n    has_converged = true;\n\n  \/\/ Is our absolute Newton step size small enough?\n  if (step_norm < absolute_step_tolerance)\n    has_converged = true;\n\n  \/\/ Is our relative Newton step size small enough?\n  if (step_norm \/ max_solution_norm <\n      relative_step_tolerance)\n    has_converged = true;\n\n  return has_converged;\n}\n\n\nvoid NewtonSolver::print_convergence(unsigned int step_num,\n                                     Real current_residual,\n                                     Real step_norm)\n{\n  \/\/ Is our absolute residual low enough?\n  if (current_residual < absolute_residual_tolerance)\n    {\n      std::cout << \"  Nonlinear solver converged, step \" << step_num\n                << \", residual \" << current_residual\n                << std::endl;\n    }\n  else if (absolute_residual_tolerance)\n    {\n      std::cout << \"  Nonlinear solver current_residual \"\n                << current_residual << \" > \"\n                << (absolute_residual_tolerance) << std::endl;\n    }\n\n  \/\/ Is our relative residual low enough?\n  if ((current_residual \/ max_residual_norm) <\n      relative_residual_tolerance)\n    {\n      std::cout << \"  Nonlinear solver converged, step \" << step_num\n                << \", residual reduction \"\n                << current_residual \/ max_residual_norm\n                << \" < \" << relative_residual_tolerance\n                << std::endl;\n    }\n  else if (relative_residual_tolerance)\n    {\n      if (!quiet)\n        std::cout << \"  Nonlinear solver relative residual \"\n                  << (current_residual \/ max_residual_norm)\n                  << \" > \" << relative_residual_tolerance\n                  << std::endl;\n    }\n\n  \/\/ Is our absolute Newton step size small enough?\n  if (step_norm < absolute_step_tolerance)\n    {\n      std::cout << \"  Nonlinear solver converged, step \" << step_num\n                << \", absolute step size \"\n                << step_norm\n                << \" < \" << absolute_step_tolerance\n                << std::endl;\n    }\n  else if (absolute_step_tolerance)\n    {\n      std::cout << \"  Nonlinear solver absolute step size \"\n                << step_norm\n                << \" > \" << absolute_step_tolerance\n                << std::endl;\n    }\n\n  \/\/ Is our relative Newton step size small enough?\n  if (step_norm \/ max_solution_norm <\n      relative_step_tolerance)\n    {\n      std::cout << \"  Nonlinear solver converged, step \" << step_num\n                << \", relative step size \"\n                << (step_norm \/ max_solution_norm)\n                << \" < \" << relative_step_tolerance\n                << std::endl;\n    }\n  else if (relative_step_tolerance)\n    {\n      std::cout << \"  Nonlinear solver relative step size \"\n                << (step_norm \/ max_solution_norm)\n                << \" > \" << relative_step_tolerance\n                << std::endl;\n    }\n}\n<commit_msg>More verbosity<commit_after>\n#include \"diff_system.h\"\n#include \"libmesh_logging.h\"\n#include \"linear_solver.h\"\n#include \"newton_solver.h\"\n#include \"numeric_vector.h\"\n#include \"sparse_matrix.h\"\n#include \"dof_map.h\"\n\n\nNewtonSolver::NewtonSolver (sys_type& s)\n  : Parent(s),\n    require_residual_reduction(false),\n    minsteplength(0.0),\n    linear_solver(LinearSolver<Number>::build())\n{\n}\n\n\n\nNewtonSolver::~NewtonSolver ()\n{\n}\n\n\n\nvoid NewtonSolver::reinit()\n{\n  Parent::reinit();\n\n  linear_solver->clear();\n}\n\n\n\nvoid NewtonSolver::solve()\n{\n  START_LOG(\"solve()\", \"NewtonSolver\");\n\n\/\/ Amount by which nonlinear residual should exceed linear solver\n\/\/ tolerance\nconst Real relative_tolerance = 1.e-3;\n\n\n  NumericVector<Number> &solution = *(_system.solution);\n  NumericVector<Number> &newton_iterate =\n    _system.get_vector(\"_nonlinear_solution\");\n  newton_iterate.close();\n  solution.close();\n\n  NumericVector<Number> &rhs = *(_system.rhs);\n\n  SparseMatrix<Number> &matrix = *(_system.matrix);\n\n  \/\/ Prepare to take incomplete steps\n  Real last_residual=0.;\n\n  \/\/ Set starting linear tolerance\n  Real current_linear_tolerance = initial_linear_tolerance;\n\n  \/\/ Now we begin the nonlinear loop\n  for (unsigned int l=0; l<max_nonlinear_iterations; ++l)\n    {\n      if (!quiet)\n        std::cout << \"Assembling System\" << std::endl;\n\n      PAUSE_LOG(\"solve()\", \"NewtonSolver\");\n      _system.assembly(true, true);\n      RESTART_LOG(\"solve()\", \"NewtonSolver\");\n      rhs.close();\n      Real current_residual = rhs.l2_norm();\n      last_residual = current_residual;\n\n      max_residual_norm = std::max (current_residual,\n                                    max_residual_norm);\n \n      \/\/ Compute the l2 norm of the whole solution\n      Real norm_total = newton_iterate.l2_norm();\n\n      max_solution_norm = std::max(max_solution_norm, norm_total);\n\n      if (!quiet)\n        std::cout << \"Nonlinear Residual: \"\n                  << current_residual << std::endl;\n\n      \/\/ Make sure our linear tolerance is low enough\n      if (current_linear_tolerance > current_residual * relative_tolerance)\n        {\n          current_linear_tolerance = current_residual * relative_tolerance;\n        }\n\n      \/\/ But don't let it be zero\n      if (current_linear_tolerance == 0.)\n        {\n          current_linear_tolerance = TOLERANCE * TOLERANCE;\n        }\n\n      \/\/ At this point newton_iterate is the current guess, and\n      \/\/ solution is now about to become the NEGATIVE of the next\n      \/\/ Newton step.\n\n      \/\/ Our best initial guess for the solution is zero!\n      solution.zero();\n\n      if (!quiet)\n        std::cout << \"Linear solve starting\" << std::endl;\n\n      PAUSE_LOG(\"solve()\", \"NewtonSolver\");\n      \/\/ Solve the linear system.  Two cases:\n      const std::pair<unsigned int, Real> rval =\n        (_system.have_matrix(\"Preconditioner\")) ?\n      \/\/ 1.) User-supplied preconditioner\n        linear_solver->solve (matrix, _system.get_matrix(\"Preconditioner\"),\n                              solution, rhs, current_linear_tolerance,\n                              max_linear_iterations) :\n      \/\/ 2.) Use system matrix for the preconditioner\n        linear_solver->solve (matrix, solution, rhs,\n                              current_linear_tolerance, \n                              max_linear_iterations);\n      \/\/ We may need to localize a parallel solution\n      _system.update ();\n      RESTART_LOG(\"solve()\", \"NewtonSolver\");\n      \/\/ The linear solver may not have fit our constraints exactly\n      _system.get_dof_map().enforce_constraints_exactly(_system);\n\n      if (!quiet)\n        std::cout << \"Linear solve finished, step \" << rval.first\n                  << \", residual \" << rval.second\n                  << \", tolerance \" << current_linear_tolerance\n                  << std::endl;\n\n      \/\/ Compute the l2 norm of the nonlinear update\n      Real norm_delta = solution.l2_norm();\n\n      if (!quiet)\n        std::cout << \"Trying full Newton step\" << std::endl;\n      \/\/ Take a full Newton step\n      newton_iterate.add (-1., solution);\n      newton_iterate.close();\n\n      \/\/ Check residual with full Newton step\n      Real steplength = 1.;\n      PAUSE_LOG(\"solve()\", \"NewtonSolver\");\n      _system.assembly(true, false);\n      RESTART_LOG(\"solve()\", \"NewtonSolver\");\n\n      rhs.close();\n      current_residual = rhs.l2_norm();\n\n      \/\/ backtrack if necessary\n      if (require_residual_reduction)\n        {\n          \/\/ but don't fiddle around if we've already converged\n          if (test_convergence(current_residual, norm_delta))\n            {\n              if (!quiet)\n\t\tprint_convergence(l, current_residual, norm_delta);\n              break;\n            }\n\n          while (current_residual > last_residual)\n            {\n              \/\/ Reduce step size to 1\/2, 1\/4, etc.\n              steplength \/= 2.;\n              norm_delta \/= 2.;\n              if (!quiet)\n                std::cout << \"Shrinking Newton step to \"\n                          << steplength << std::endl;\n              newton_iterate.add (steplength, solution);\n              newton_iterate.close();\n\n              \/\/ Check residual with fractional Newton step\n              PAUSE_LOG(\"solve()\", \"NewtonSolver\");\n              _system.assembly (true, false);\n              RESTART_LOG(\"solve()\", \"NewtonSolver\");\n              current_residual = rhs.l2_norm();\n              if (!quiet)\n                std::cout << \"Current Residual: \"\n                          << current_residual << std::endl;\n\n              if (steplength\/2. < minsteplength && \n                  current_residual > last_residual)\n                {\n                  if (!quiet)\n                    std::cout << \"Inexact Newton step FAILED at step \"\n                              << l << std::endl;\n\n                  error();\n                }\n            }\n        }\n\n      \/\/ Compute the l2 norm of the whole solution\n      norm_total = newton_iterate.l2_norm();\n\n      max_solution_norm = std::max(max_solution_norm, norm_total);\n\n      \/\/ Print out information for the \n      \/\/ nonlinear iterations.\n      if (!quiet)\n        std::cout << \"  Nonlinear step: |du|\/|u| = \"\n                  << norm_delta \/ norm_total\n                  << \", |du| = \" << norm_delta\n                  << std::endl;\n\n      \/\/ Terminate the solution iteration if the difference between\n      \/\/ this iteration and the last is sufficiently small.\n      if (!quiet)\n        print_convergence(l, current_residual,\n                          norm_delta \/ steplength);\n      if (test_convergence(current_residual, norm_delta \/ steplength))\n        {\n          break;\n        }\n      if (l >= max_nonlinear_iterations - 1)\n        {\n          std::cout << \"  Nonlinear solver DIVERGED at step \" << l\n                    << \" with norm \" << norm_total\n                    << std::endl;\n          error();\n          continue;\n        }\n    } \/\/ end nonlinear loop\n\n  \/\/ Copy the final nonlinear iterate into the current_solution,\n  \/\/ for other libMesh functions that expect it\n\n  solution = newton_iterate;\n  solution.close();\n\n  \/\/ We may need to localize a parallel solution\n  _system.update ();\n\n  STOP_LOG(\"solve()\", \"NewtonSolver\");\n}\n\n\n\nbool NewtonSolver::test_convergence(Real current_residual,\n                                    Real step_norm)\n{\n  \/\/ We haven't converged unless we pass a convergence test\n  bool has_converged = false;\n\n  \/\/ Is our absolute residual low enough?\n  if (current_residual < absolute_residual_tolerance)\n    has_converged = true;\n\n  \/\/ Is our relative residual low enough?\n  if ((current_residual \/ max_residual_norm) <\n      relative_residual_tolerance)\n    has_converged = true;\n\n  \/\/ Is our absolute Newton step size small enough?\n  if (step_norm < absolute_step_tolerance)\n    has_converged = true;\n\n  \/\/ Is our relative Newton step size small enough?\n  if (step_norm \/ max_solution_norm <\n      relative_step_tolerance)\n    has_converged = true;\n\n  return has_converged;\n}\n\n\nvoid NewtonSolver::print_convergence(unsigned int step_num,\n                                     Real current_residual,\n                                     Real step_norm)\n{\n  \/\/ Is our absolute residual low enough?\n  if (current_residual < absolute_residual_tolerance)\n    {\n      std::cout << \"  Nonlinear solver converged, step \" << step_num\n                << \", residual \" << current_residual\n                << std::endl;\n    }\n  else if (absolute_residual_tolerance)\n    {\n      std::cout << \"  Nonlinear solver current_residual \"\n                << current_residual << \" > \"\n                << (absolute_residual_tolerance) << std::endl;\n    }\n\n  \/\/ Is our relative residual low enough?\n  if ((current_residual \/ max_residual_norm) <\n      relative_residual_tolerance)\n    {\n      std::cout << \"  Nonlinear solver converged, step \" << step_num\n                << \", residual reduction \"\n                << current_residual \/ max_residual_norm\n                << \" < \" << relative_residual_tolerance\n                << std::endl;\n    }\n  else if (relative_residual_tolerance)\n    {\n      if (!quiet)\n        std::cout << \"  Nonlinear solver relative residual \"\n                  << (current_residual \/ max_residual_norm)\n                  << \" > \" << relative_residual_tolerance\n                  << std::endl;\n    }\n\n  \/\/ Is our absolute Newton step size small enough?\n  if (step_norm < absolute_step_tolerance)\n    {\n      std::cout << \"  Nonlinear solver converged, step \" << step_num\n                << \", absolute step size \"\n                << step_norm\n                << \" < \" << absolute_step_tolerance\n                << std::endl;\n    }\n  else if (absolute_step_tolerance)\n    {\n      std::cout << \"  Nonlinear solver absolute step size \"\n                << step_norm\n                << \" > \" << absolute_step_tolerance\n                << std::endl;\n    }\n\n  \/\/ Is our relative Newton step size small enough?\n  if (step_norm \/ max_solution_norm <\n      relative_step_tolerance)\n    {\n      std::cout << \"  Nonlinear solver converged, step \" << step_num\n                << \", relative step size \"\n                << (step_norm \/ max_solution_norm)\n                << \" < \" << relative_step_tolerance\n                << std::endl;\n    }\n  else if (relative_step_tolerance)\n    {\n      std::cout << \"  Nonlinear solver relative step size \"\n                << (step_norm \/ max_solution_norm)\n                << \" > \" << relative_step_tolerance\n                << std::endl;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"paddle.hpp\"\n\nvoid PaddleBase::draw() const\n{\n\tarduboy.fillRect(x, y, PADDLE_WIDTH, PADDLE_HEIGHT, WHITE);\n}\n\nvoid PaddleBase::move(int16_t distance)\n{\n\tint16_t newY = y + distance;\n\tif (newY <= 0)\n\t{\n\t\ty = 1;\n\t}\n\telse if (newY > HEIGHT - PADDLE_HEIGHT - 1)\n\t{\n\t\ty = HEIGHT - PADDLE_HEIGHT - 1;\n\t}\n\telse\n\t{\n\t\ty = newY;\n\t}\n}\n\nvoid Player::move_impl()\n{\n\tif (arduboy.pressed(UP_BUTTON))\n\t{\n\t\tPaddleBase::move(-1);\n\t}\n\tif (arduboy.pressed(DOWN_BUTTON))\n\t{\n\t\tPaddleBase::move(1);\n\t}\n}\n\nvoid Computer::move_impl()\n{\n\t\/\/ bother the paddle if the ball is close or a random time\n\tif (ball.x > 90 || !random(15))\n\t{\n\t\t\/\/ move up if the ball is higher\n\t\tif (ball.y <= y)\n\t\t{\n\t\t\tPaddleBase::move(-1);\n\t\t}\n\t\t\/\/ move down if the ball is lower\n\t\tif (ball.y + BALL_SIZE >= y + PADDLE_HEIGHT)\n\t\t{\n\t\t\tPaddleBase::move(1);\n\t\t}\n\t}\n}\n<commit_msg>Tweak AI<commit_after>#include \"paddle.hpp\"\n\nvoid PaddleBase::draw() const\n{\n\tarduboy.fillRect(x, y, PADDLE_WIDTH, PADDLE_HEIGHT, WHITE);\n}\n\nvoid PaddleBase::move(int16_t distance)\n{\n\tint16_t newY = y + distance;\n\tif (newY <= 0)\n\t{\n\t\ty = 1;\n\t}\n\telse if (newY > HEIGHT - PADDLE_HEIGHT - 1)\n\t{\n\t\ty = HEIGHT - PADDLE_HEIGHT - 1;\n\t}\n\telse\n\t{\n\t\ty = newY;\n\t}\n}\n\nvoid Player::move_impl()\n{\n\tif (arduboy.pressed(UP_BUTTON))\n\t{\n\t\tPaddleBase::move(-1);\n\t}\n\tif (arduboy.pressed(DOWN_BUTTON))\n\t{\n\t\tPaddleBase::move(1);\n\t}\n}\n\nvoid Computer::move_impl()\n{\n\t\/\/ bother the paddle if the ball is close or a random time\n\tif (ball.x > 80 || !random(10))\n\t{\n\t\t\/\/ move up if the ball is higher\n\t\tif (ball.y <= y)\n\t\t{\n\t\t\tPaddleBase::move(-1);\n\t\t}\n\t\t\/\/ move down if the ball is lower\n\t\tif (ball.y + BALL_SIZE >= y + PADDLE_HEIGHT)\n\t\t{\n\t\t\tPaddleBase::move(1);\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file rna_main.cpp\n *\n * Defines the \"vg rna\" subcommand, which projects rna transcripts to graph paths and\/or GBWT haplotypes.\n *\/\n\n#include <unistd.h>\n#include <getopt.h>\n#include <chrono>\n\n#include \"subcommand.hpp\"\n\n#include \"..\/transcriptome.hpp\"\n#include \"..\/stream\/vpkg.hpp\"\n#include \"..\/stream\/stream.hpp\"\n\nusing namespace std;\nusing namespace vg;\nusing namespace vg::subcommand;\n\n\nvoid help_rna(char** argv) {\n    cerr << \"\\nusage: \" << argv[0] << \" rna [options] <graph.vg> > splice_graph.vg\" << endl\n         << \"options:\" << endl\n         << \"    -n, --transcripts FILE     transcript file(s) in gtf\/gff format; may repeat (required)\" << endl\n         << \"    -s, --transcript-tag NAME  use this attribute tag in the gtf\/gff file(s) as id [transcript_id]\" << endl\n         << \"    -l, --haplotypes FILE      project transcripts onto haplotypes in GBWT index file\" << endl\n         << \"    -e, --use-embedded-paths   project transcripts onto embedded graph paths\" << endl\n         << \"    -r, --filter-reference     filter reference transcripts\" << endl\n         << \"    -c, --do-not-collapse      do not collapse identical transcripts across haplotypes\" << endl\n         << \"    -a, --add-paths            add transcripts as embedded paths in the graph\" << endl\n         << \"    -b, --write-gbwt FILE      write transcripts as path to GBWT index file\" << endl\n         << \"    -g, --write-gam FILE       write transcripts as alignments to GAM file\" << endl\n         << \"    -f, --write-fasta FILE     write transcripts as sequences to fasta file\" << endl\n         << \"    -t, --threads INT          number of compute threads to use [1]\" << endl\n         << \"    -p, --progress             show progress\" << endl\n         << \"    -h, --help                 print help message\" << endl\n         << endl;\n}\n\nint32_t main_rna(int32_t argc, char** argv) {\n\n    if (argc == 2) {\n        help_rna(argv);\n        return 1;\n    }\n    \n    vector<string> transcript_filenames;\n    string transcript_tag = \"transcript_id\";\n    string haplotypes_filename;\n    bool use_embedded_paths = false;\n    bool filter_reference_transcript_paths = false;\n    bool collapse_transcript_paths = true;\n    bool add_transcript_paths = false;\n    string gbwt_out_filename = \"\";\n    string gam_out_filename = \"\";\n    string fasta_out_filename = \"\";\n    int32_t num_threads = 1;\n    bool show_progress = false;\n\n    int32_t c;\n    optind = 2; \/\/ force optind past command positional argument\n\n    while (true) {\n        static struct option long_options[] =\n            {\n                {\"transcripts\",  no_argument, 0, 'n'},\n                {\"transcript-tag\",  no_argument, 0, 's'},\n                {\"haplotypes\",  no_argument, 0, 'l'},\n                {\"use-embeded-paths\",  no_argument, 0, 'e'},\n                {\"filter-reference\",  no_argument, 0, 'r'},\n                {\"do-not-collapse\",  no_argument, 0, 'c'},\n                {\"add-paths\",  no_argument, 0, 'a'},\n                {\"write-gbwt\",  no_argument, 0, 'b'},\n                {\"write-gam\",  no_argument, 0, 'g'},\n                {\"write-fasta\",  no_argument, 0, 'f'},\n                {\"threads\",  no_argument, 0, 't'},\n                {\"progress\",  no_argument, 0, 'p'},\n                {\"help\", no_argument, 0, 'h'},\n                {0, 0, 0, 0}\n            };\n\n        int32_t option_index = 0;\n        c = getopt_long(argc, argv, \"n:s:l:ercab:g:f:t:ph?\", long_options, &option_index);\n\n        \/* Detect the end of the options. *\/\n        if (c == -1)\n            break;\n\n        switch (c)\n        {\n\n        case 'n':\n            transcript_filenames.push_back(optarg);\n            break;\n\n        case 's':\n            transcript_tag = optarg;\n            break;\n\n        case 'l':\n            haplotypes_filename = optarg;\n            break;\n\n        case 'e':\n            use_embedded_paths = true;\n            break;\n\n        case 'r':\n            filter_reference_transcript_paths = true;\n            break;\n            \n        case 'c':\n            collapse_transcript_paths = false;\n            break;\n\n        case 'a':\n            add_transcript_paths = true;\n            break;\n\n        case 'b':\n            gbwt_out_filename = optarg;\n            break;\n\n        case 'g':\n            gam_out_filename = optarg;\n            break;\n\n        case 'f':\n            fasta_out_filename = optarg;\n            break;\n\n        case 't':\n            num_threads = stoi(optarg);\n            break;\n\n        case 'p':\n            show_progress = true;\n            break;\n\n        case 'h':\n        case '?':\n            \/* getopt_long already printed an error message. *\/\n            help_rna(argv);\n            exit(1);\n            break;\n\n        default:\n            abort();\n        }\n    }\n\n    if (argc < optind + 1) {\n        help_rna(argv);\n        return 1;\n    }\n\n    if (transcript_filenames.empty()) {\n\n        cerr << \"[vg rna] ERROR: No transcripts were given. Use --transcripts FILE.\" << endl;\n        return 1;       \n    }\n\n    if (haplotypes_filename.empty() && !use_embedded_paths) {\n\n        cerr << \"[vg rna] ERROR: No haplotypes or paths were given for transcript projection. Use --haplotypes FILE and\/or --use-embeded-paths.\" << endl;\n        return 1;       \n    }\n\n    if (show_progress) { cerr << \"[vg rna] Parsing graph file ...\" << endl; }\n    \n    \/\/ Load the graph\n    VG* graph = nullptr;\n    get_input_file(optind, argc, argv, [&](istream& in) {\n        graph = new VG(in, show_progress);\n    });\n\n    if (!graph) {\n        cerr << \"[vg rna] ERROR: Could not load graph.\" << endl;\n        return 1;\n    }\n\n    gbwt::GBWT haplotype_index;\n\n    if (!haplotypes_filename.empty()) {\n\n        if (show_progress) { cerr << \"[vg rna] Parsing haplotype GBWT index file ...\" << endl; }\n\n        sdsl::load_from_file(haplotype_index, haplotypes_filename);\n    }\n\n    Transcriptome transcriptome;\n\n    transcriptome.num_threads = num_threads;\n    transcriptome.transcript_tag = transcript_tag;\n    transcriptome.use_embedded_paths = use_embedded_paths;\n    transcriptome.collapse_transcript_paths = collapse_transcript_paths;\n    transcriptome.filter_reference_transcript_paths = filter_reference_transcript_paths;\n\n    auto time1 = std::chrono::system_clock::now();\n\n    if (show_progress) { cerr << \"[vg rna] Parsing and projecting transcripts ...\" << endl; }\n\n    for (auto & filename: transcript_filenames) {\n\n        get_input_file(filename, [&](istream& transcript_stream) {\n                   transcriptome.add_transcripts(transcript_stream, *graph, haplotype_index);\n        });\n    }\n\n    auto time2 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time2 - time1).count() << endl;\n\n    if (show_progress) { cerr << \"[vg rna] Adding splice-junctions \" << (add_transcript_paths ? \"and transcript paths \" : \"\") << \"to graph ...\" << endl; }\n\n    transcriptome.edit_graph(graph, add_transcript_paths);\n\n    auto time3 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time3 - time2).count() << endl;\n\n    if (!gbwt_out_filename.empty()) {\n\n        if (show_progress) { cerr << \"[vg rna] Writing \" << transcriptome.size() << \" transcripts as paths to GBWT index file ...\" << endl; }\n\n        gbwt::Verbosity::set(gbwt::Verbosity::SILENT); \n        gbwt::GBWTBuilder gbwt_builder(gbwt::bit_length(gbwt::Node::encode(graph->max_node_id(), true)));\n\n        transcriptome.construct_gbwt(&gbwt_builder);\n        gbwt_builder.finish();\n\n        gbwt_builder.index.addMetadata();\n        gbwt_builder.index.metadata.setHaplotypes(transcriptome.size());\n        \/\/ gbwt_builder.index.metadata.setSamples();\n        \/\/ gbwt_builder.index.metadata.setContigs();\n\n        sdsl::store_to_file(gbwt_builder.index, gbwt_out_filename);\n    }    \n\n    auto time4 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time4 - time3).count() << endl;\n\n    if (!gam_out_filename.empty()) {\n\n        if (show_progress) { cerr << \"[vg rna] Writing \" << transcriptome.size() << \" transcripts as alignments to GAM file ...\" << endl; }\n\n        ofstream gam_ostream;\n        gam_ostream.open(gam_out_filename);\n        transcriptome.write_gam_alignments(&gam_ostream);\n        gam_ostream.close();\n    }\n\n    auto time5 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time5 - time4).count() << endl;\n\n    if (!fasta_out_filename.empty()) {\n\n        if (show_progress) { cerr << \"[vg rna] Writing \" << transcriptome.size() << \" transcripts as sequences to fasta file ...\" << endl; }\n\n        ofstream fasta_ostream;\n        fasta_ostream.open(fasta_out_filename);\n        transcriptome.write_fasta_sequences(&fasta_ostream, *graph);\n        fasta_ostream.close();\n    }    \n\n    auto time6 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time6 - time5).count() << endl;\n\n    if (show_progress) { cerr << \"[vg rna] Writing graph to stdout ...\" << endl; }\n\n    graph->serialize_to_ostream(std::cout);\n    delete graph;    \n\n    return 0;\n}\n\n\/\/ Register subcommand\nstatic Subcommand vg_rna(\"rna\", \"project rna transcripts to graph paths and\/or GBWT haplotypes\", main_rna);\n\n<commit_msg>fixed VPKG compatibility<commit_after>\/** \\file rna_main.cpp\n *\n * Defines the \"vg rna\" subcommand, which projects rna transcripts to graph paths and\/or GBWT haplotypes.\n *\/\n\n#include <unistd.h>\n#include <getopt.h>\n#include <chrono>\n\n#include \"subcommand.hpp\"\n\n#include \"..\/transcriptome.hpp\"\n#include \"..\/stream\/vpkg.hpp\"\n#include \"..\/stream\/stream.hpp\"\n\nusing namespace std;\nusing namespace vg;\nusing namespace vg::subcommand;\n\n\nvoid help_rna(char** argv) {\n    cerr << \"\\nusage: \" << argv[0] << \" rna [options] <graph.vg> > splice_graph.vg\" << endl\n         << \"options:\" << endl\n         << \"    -n, --transcripts FILE     transcript file(s) in gtf\/gff format; may repeat (required)\" << endl\n         << \"    -s, --transcript-tag NAME  use this attribute tag in the gtf\/gff file(s) as id [transcript_id]\" << endl\n         << \"    -l, --haplotypes FILE      project transcripts onto haplotypes in GBWT index file\" << endl\n         << \"    -e, --use-embedded-paths   project transcripts onto embedded graph paths\" << endl\n         << \"    -r, --filter-reference     filter reference transcripts\" << endl\n         << \"    -c, --do-not-collapse      do not collapse identical transcripts across haplotypes\" << endl\n         << \"    -a, --add-paths            add transcripts as embedded paths in the graph\" << endl\n         << \"    -b, --write-gbwt FILE      write transcripts as path to GBWT index file\" << endl\n         << \"    -g, --write-gam FILE       write transcripts as alignments to GAM file\" << endl\n         << \"    -f, --write-fasta FILE     write transcripts as sequences to fasta file\" << endl\n         << \"    -t, --threads INT          number of compute threads to use [1]\" << endl\n         << \"    -p, --progress             show progress\" << endl\n         << \"    -h, --help                 print help message\" << endl\n         << endl;\n}\n\nint32_t main_rna(int32_t argc, char** argv) {\n\n    if (argc == 2) {\n        help_rna(argv);\n        return 1;\n    }\n    \n    vector<string> transcript_filenames;\n    string transcript_tag = \"transcript_id\";\n    string haplotypes_filename;\n    bool use_embedded_paths = false;\n    bool filter_reference_transcript_paths = false;\n    bool collapse_transcript_paths = true;\n    bool add_transcript_paths = false;\n    string gbwt_out_filename = \"\";\n    string gam_out_filename = \"\";\n    string fasta_out_filename = \"\";\n    int32_t num_threads = 1;\n    bool show_progress = false;\n\n    int32_t c;\n    optind = 2; \/\/ force optind past command positional argument\n\n    while (true) {\n        static struct option long_options[] =\n            {\n                {\"transcripts\",  no_argument, 0, 'n'},\n                {\"transcript-tag\",  no_argument, 0, 's'},\n                {\"haplotypes\",  no_argument, 0, 'l'},\n                {\"use-embeded-paths\",  no_argument, 0, 'e'},\n                {\"filter-reference\",  no_argument, 0, 'r'},\n                {\"do-not-collapse\",  no_argument, 0, 'c'},\n                {\"add-paths\",  no_argument, 0, 'a'},\n                {\"write-gbwt\",  no_argument, 0, 'b'},\n                {\"write-gam\",  no_argument, 0, 'g'},\n                {\"write-fasta\",  no_argument, 0, 'f'},\n                {\"threads\",  no_argument, 0, 't'},\n                {\"progress\",  no_argument, 0, 'p'},\n                {\"help\", no_argument, 0, 'h'},\n                {0, 0, 0, 0}\n            };\n\n        int32_t option_index = 0;\n        c = getopt_long(argc, argv, \"n:s:l:ercab:g:f:t:ph?\", long_options, &option_index);\n\n        \/* Detect the end of the options. *\/\n        if (c == -1)\n            break;\n\n        switch (c)\n        {\n\n        case 'n':\n            transcript_filenames.push_back(optarg);\n            break;\n\n        case 's':\n            transcript_tag = optarg;\n            break;\n\n        case 'l':\n            haplotypes_filename = optarg;\n            break;\n\n        case 'e':\n            use_embedded_paths = true;\n            break;\n\n        case 'r':\n            filter_reference_transcript_paths = true;\n            break;\n            \n        case 'c':\n            collapse_transcript_paths = false;\n            break;\n\n        case 'a':\n            add_transcript_paths = true;\n            break;\n\n        case 'b':\n            gbwt_out_filename = optarg;\n            break;\n\n        case 'g':\n            gam_out_filename = optarg;\n            break;\n\n        case 'f':\n            fasta_out_filename = optarg;\n            break;\n\n        case 't':\n            num_threads = stoi(optarg);\n            break;\n\n        case 'p':\n            show_progress = true;\n            break;\n\n        case 'h':\n        case '?':\n            \/* getopt_long already printed an error message. *\/\n            help_rna(argv);\n            exit(1);\n            break;\n\n        default:\n            abort();\n        }\n    }\n\n    if (argc < optind + 1) {\n        help_rna(argv);\n        return 1;\n    }\n\n    if (transcript_filenames.empty()) {\n\n        cerr << \"[vg rna] ERROR: No transcripts were given. Use --transcripts FILE.\" << endl;\n        return 1;       \n    }\n\n    if (haplotypes_filename.empty() && !use_embedded_paths) {\n\n        cerr << \"[vg rna] ERROR: No haplotypes or paths were given for transcript projection. Use --haplotypes FILE and\/or --use-embeded-paths.\" << endl;\n        return 1;       \n    }\n\n    if (show_progress) { cerr << \"[vg rna] Parsing graph file ...\" << endl; }\n    \n    \/\/ Load the graph\n    VG* graph = nullptr;\n    get_input_file(optind, argc, argv, [&](istream& in) {\n        graph = new VG(in, show_progress);\n    });\n\n    if (!graph) {\n        cerr << \"[vg rna] ERROR: Could not load graph.\" << endl;\n        return 1;\n    }\n\n    unique_ptr<gbwt::GBWT> haplotype_index;\n\n    if (!haplotypes_filename.empty()) {\n\n        if (show_progress) { cerr << \"[vg rna] Parsing haplotype GBWT index file ...\" << endl; }\n        haplotype_index = stream::VPKG::load_one<gbwt::GBWT>(haplotypes_filename);\n    \n    } else {\n\n        haplotype_index = unique_ptr<gbwt::GBWT>(new gbwt::GBWT());\n    }\n\n    Transcriptome transcriptome;\n\n    transcriptome.num_threads = num_threads;\n    transcriptome.transcript_tag = transcript_tag;\n    transcriptome.use_embedded_paths = use_embedded_paths;\n    transcriptome.collapse_transcript_paths = collapse_transcript_paths;\n    transcriptome.filter_reference_transcript_paths = filter_reference_transcript_paths;\n\n    auto time1 = std::chrono::system_clock::now();\n\n    if (show_progress) { cerr << \"[vg rna] Parsing and projecting transcripts ...\" << endl; }\n\n    for (auto & filename: transcript_filenames) {\n\n        get_input_file(filename, [&](istream& transcript_stream) {\n                   transcriptome.add_transcripts(transcript_stream, *graph, *haplotype_index);\n        });\n    }\n\n    haplotype_index.reset();\n\n    auto time2 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time2 - time1).count() << endl;\n\n    if (show_progress) { cerr << \"[vg rna] Adding splice-junctions \" << (add_transcript_paths ? \"and transcript paths \" : \"\") << \"to graph ...\" << endl; }\n\n    transcriptome.edit_graph(graph, add_transcript_paths);\n\n    auto time3 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time3 - time2).count() << endl;\n\n    if (!gbwt_out_filename.empty()) {\n\n        if (show_progress) { cerr << \"[vg rna] Writing \" << transcriptome.size() << \" transcripts as paths to GBWT index file ...\" << endl; }\n\n        gbwt::Verbosity::set(gbwt::Verbosity::SILENT); \n        gbwt::GBWTBuilder gbwt_builder(gbwt::bit_length(gbwt::Node::encode(graph->max_node_id(), true)));\n\n        transcriptome.construct_gbwt(&gbwt_builder);\n        gbwt_builder.finish();\n\n        gbwt_builder.index.addMetadata();\n        gbwt_builder.index.metadata.setHaplotypes(transcriptome.size());\n        \/\/ gbwt_builder.index.metadata.setSamples();\n        \/\/ gbwt_builder.index.metadata.setContigs();\n\n        stream::VPKG::save(gbwt_builder.index, gbwt_out_filename);\n    }    \n\n    auto time4 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time4 - time3).count() << endl;\n\n    if (!gam_out_filename.empty()) {\n\n        if (show_progress) { cerr << \"[vg rna] Writing \" << transcriptome.size() << \" transcripts as alignments to GAM file ...\" << endl; }\n\n        ofstream gam_ostream;\n        gam_ostream.open(gam_out_filename);\n        transcriptome.write_gam_alignments(&gam_ostream);\n        gam_ostream.close();\n    }\n\n    auto time5 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time5 - time4).count() << endl;\n\n    if (!fasta_out_filename.empty()) {\n\n        if (show_progress) { cerr << \"[vg rna] Writing \" << transcriptome.size() << \" transcripts as sequences to fasta file ...\" << endl; }\n\n        ofstream fasta_ostream;\n        fasta_ostream.open(fasta_out_filename);\n        transcriptome.write_fasta_sequences(&fasta_ostream, *graph);\n        fasta_ostream.close();\n    }    \n\n    auto time6 = std::chrono::system_clock::now();\n    cerr << \"Time (s): \" << std::chrono::duration_cast<std::chrono::seconds>(time6 - time5).count() << endl;\n\n    if (show_progress) { cerr << \"[vg rna] Writing graph to stdout ...\" << endl; }\n\n    graph->serialize_to_ostream(std::cout);\n    delete graph;    \n\n    return 0;\n}\n\n\/\/ Register subcommand\nstatic Subcommand vg_rna(\"rna\", \"project rna transcripts to graph paths and\/or GBWT haplotypes\", main_rna);\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"popupwidget.h\"\n#include \"ui_popupwidget.h\"\n#include <QDebug>\n#include <QCloseEvent>\n#include <QWebFrame>\n#include <QTimer>\n\nconst int PopupWidget::weblioPosition = 330;\n\nPopupWidget::PopupWidget(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::PopupWidget)\n{\n    ui->setupUi(this);\n\n    isScrolled = false;\n    canToggle  = true;\n    shortcut = new QxtGlobalShortcut(this);\n    if (!shortcut->setShortcut(QKeySequence(\"Ctrl+F12\"))) {\n        qWarning() << \"Ctrl+12 is already assigned!\";\n    } else {\n        connect(shortcut, SIGNAL(activated()),\n                this,     SLOT(toggleShowUp()));\\\n        setupTray();\n    }\n}\n\nPopupWidget::~PopupWidget()\n{\n    delete ui;\n}\n\nvoid PopupWidget::toggleShowUp()\n{\n    if (!canToggle) return;\n\n    if (isVisible()) {\n\/\/        qDebug() << \"hide\";\n        hide();\n        canToggle = false;\n        QTimer::singleShot(500, this, SLOT(enableToggle()));\n    } else {\n\/\/        qDebug() << \"show\";\n        \/\/ Open Display\n        setWindowFlags(Qt::WindowStaysOnTopHint);\n        activateWindow(); \/\/qApp->setActiveWindow()も必要\n        qApp->setActiveWindow(this); \/\/activateWindow()も必要\n        showNormal();\n\n        ui->lineEdit->setFocus();\n        canToggle = false;\n        QTimer::singleShot(500, this, SLOT(enableToggle()));\n    }\n}\n\nvoid PopupWidget::setupTray()\n{\n    setupTrayMenu();\n    trayIcon = new QSystemTrayIcon(this);\n    trayIcon->setContextMenu(trayMenu);\n    trayIcon->setIcon(QIcon(\":\/img\/icon.svg\"));\n    trayIcon->show();\n}\n\nvoid PopupWidget::setupTrayMenu()\n{\n    quitAction = new QAction(tr(\"&Quit\"), this);\n    connect(quitAction, SIGNAL(triggered()), qApp, SLOT(quit()));\n    trayMenu = new QMenu(this);\n    trayMenu->addAction(quitAction);\n}\n\nvoid PopupWidget::closeEvent(QCloseEvent *event)\n{\n    if (trayIcon->isVisible()) {\n        hide();\n        event->ignore();\n    }\n}\n\nvoid PopupWidget::search(QString word)\n{\n    QUrl url = QUrl(QString(\"http:\/\/ejje.weblio.jp\/content\/\") + word);\n    qDebug() << url;\n    ui->webView->load(url);\n    emit urlChanged(url);\n}\n\nvoid PopupWidget::search()\n{\n    QString word = ui->lineEdit->text();\n    QUrl url = QUrl(QString(\"http:\/\/ejje.weblio.jp\/content\/\") + word);\n    qDebug() << url;\n    ui->webView->load(url);\n    emit urlChanged(url);\n}\n\nvoid PopupWidget::on_webView_loadProgress(int progress)\n{\n    Q_UNUSED(progress)\n    if (!isScrolled) {\n        QWebFrame *frame = ui->webView->page()->mainFrame();\n        int min = frame->scrollBarMinimum(Qt::Vertical);\n        int max = frame->scrollBarMaximum(Qt::Vertical);\n        qDebug() << \"Max=\" << max << \" Min=\" << min;\n        if (max > weblioPosition) {\n            frame->setScrollBarValue(Qt::Vertical, weblioPosition);\n\/\/            qDebug() << \"Scroll\";\n            isScrolled = true;\n        }\n    }\n}\n\nvoid PopupWidget::on_webView_loadStarted()\n{\n    isScrolled = false;\n}\n\nvoid PopupWidget::on_actionSearch_triggered()\n{\n    search();\n}\n\n<commit_msg>commentouted unncessary messages<commit_after>#include \"popupwidget.h\"\n#include \"ui_popupwidget.h\"\n#include <QDebug>\n#include <QCloseEvent>\n#include <QWebFrame>\n#include <QTimer>\n\nconst int PopupWidget::weblioPosition = 330;\n\nPopupWidget::PopupWidget(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::PopupWidget)\n{\n    ui->setupUi(this);\n\n    isScrolled = false;\n    canToggle  = true;\n    shortcut = new QxtGlobalShortcut(this);\n    if (!shortcut->setShortcut(QKeySequence(\"Ctrl+F12\"))) {\n        qWarning() << \"Ctrl+12 is already assigned!\";\n    } else {\n        connect(shortcut, SIGNAL(activated()),\n                this,     SLOT(toggleShowUp()));\\\n        setupTray();\n    }\n}\n\nPopupWidget::~PopupWidget()\n{\n    delete ui;\n}\n\nvoid PopupWidget::toggleShowUp()\n{\n    if (!canToggle) return;\n\n    if (isVisible()) {\n\/\/        qDebug() << \"hide\";\n        hide();\n        canToggle = false;\n        QTimer::singleShot(500, this, SLOT(enableToggle()));\n    } else {\n\/\/        qDebug() << \"show\";\n        \/\/ Open Display\n        setWindowFlags(Qt::WindowStaysOnTopHint);\n        activateWindow(); \/\/qApp->setActiveWindow()も必要\n        qApp->setActiveWindow(this); \/\/activateWindow()も必要\n        showNormal();\n\n        ui->lineEdit->setFocus();\n        canToggle = false;\n        QTimer::singleShot(500, this, SLOT(enableToggle()));\n    }\n}\n\nvoid PopupWidget::setupTray()\n{\n    setupTrayMenu();\n    trayIcon = new QSystemTrayIcon(this);\n    trayIcon->setContextMenu(trayMenu);\n    trayIcon->setIcon(QIcon(\":\/img\/icon.svg\"));\n    trayIcon->show();\n}\n\nvoid PopupWidget::setupTrayMenu()\n{\n    quitAction = new QAction(tr(\"&Quit\"), this);\n    connect(quitAction, SIGNAL(triggered()), qApp, SLOT(quit()));\n    trayMenu = new QMenu(this);\n    trayMenu->addAction(quitAction);\n}\n\nvoid PopupWidget::closeEvent(QCloseEvent *event)\n{\n    if (trayIcon->isVisible()) {\n        hide();\n        event->ignore();\n    }\n}\n\nvoid PopupWidget::search(QString word)\n{\n    QUrl url = QUrl(QString(\"http:\/\/ejje.weblio.jp\/content\/\") + word);\n\/\/    qDebug() << url;\n    ui->webView->load(url);\n    emit urlChanged(url);\n}\n\nvoid PopupWidget::search()\n{\n    QString word = ui->lineEdit->text();\n    QUrl url = QUrl(QString(\"http:\/\/ejje.weblio.jp\/content\/\") + word);\n\/\/    qDebug() << url;\n    ui->webView->load(url);\n    emit urlChanged(url);\n}\n\nvoid PopupWidget::on_webView_loadProgress(int progress)\n{\n    Q_UNUSED(progress)\n    if (!isScrolled) {\n        QWebFrame *frame = ui->webView->page()->mainFrame();\n\/\/        int min = frame->scrollBarMinimum(Qt::Vertical);\n        int max = frame->scrollBarMaximum(Qt::Vertical);\n\/\/        qDebug() << \"Max=\" << max << \" Min=\" << min;\n        if (max > weblioPosition) {\n            frame->setScrollBarValue(Qt::Vertical, weblioPosition);\n\/\/            qDebug() << \"Scroll\";\n            isScrolled = true;\n        }\n    }\n}\n\nvoid PopupWidget::on_webView_loadStarted()\n{\n    isScrolled = false;\n}\n\nvoid PopupWidget::on_actionSearch_triggered()\n{\n    search();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"encoder.hh\"\n#include \"..\/format\/format-stream.hh\"\n\nnamespace mimosa\n{\n  namespace json\n  {\n    Encoder::Encoder(stream::Stream::Ptr output)\n      : output_(output)\n    {\n    }\n\n    bool\n    Encoder::startObject()\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (output_->loopWrite(\"{\", 1) != 1)\n        return false;\n      state_.push_back(kObjectKey);\n      return true;\n    }\n\n    bool\n    Encoder::endObject()\n    {\n      if (state_.empty() ||\n          (state_.back() != kObjectKey && state_.back() != kObjectNext))\n        throw SyntaxError();\n\n      if (output_->loopWrite(\"}\", 1) != 1)\n        return false;\n\n      state_.pop_back();\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::startArray()\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (output_->loopWrite(\"[\", 1) != 1)\n        return false;\n\n      state_.push_back(kArray);\n      return true;\n    }\n\n    bool\n    Encoder::endArray()\n    {\n      if (state_.empty() || (state_.back() != kArray && state_.back() != kArrayNext))\n        throw SyntaxError();\n\n      if (output_->loopWrite(\"]\", 1) != 1)\n        return false;\n\n      state_.pop_back();\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushBoolean(bool value)\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if ((value && output_->loopWrite(\"true\", 4) != 4) ||\n          (!value && output_->loopWrite(\"false\", 5) != 5))\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushNull()\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (output_->loopWrite(\"null\", 4) != 4)\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushString(const std::string & data)\n    {\n      if (!pushSeparator())\n        return false;\n\n      if (output_->loopWrite(\"\\\"\", 1) != 1)\n        return false;\n\n      \/\/ XXX do it better\n      for (auto it = data.begin(); it != data.end(); ++it) {\n        if (*it == '\\\\' || *it == '\"')\n          if (output_->loopWrite(\"\\\\\", 1) != 1)\n            return false;\n\n        switch (*it) {\n        case '\\r':\n          if (output_->loopWrite(\"\\\\r\", 2) != 2)\n            return false;\n          break;\n\n        case '\\n':\n          if (output_->loopWrite(\"\\\\n\", 2) != 2)\n            return false;\n          break;\n\n        case '\\t':\n          if (output_->loopWrite(\"\\\\t\", 2) != 2)\n            return false;\n          break;\n\n        case '\\v':\n          if (output_->loopWrite(\"\\\\v\", 2) != 2)\n            return false;\n          break;\n\n        case '\\\\':\n        case '\"':\n          if (output_->loopWrite(\"\\\\\", 1) != 1)\n            return false;\n          \/* fall through *\/\n\n        default:\n          if (output_->loopWrite(&*it, 1) != 1)\n            return false;\n        }\n      }\n\n      if (output_->loopWrite(\"\\\"\", 1) != 1)\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushNumber(int64_t value)\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (!format::format(*output_, \"%d\", value))\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushFloat(double value)\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (!format::format(*output_, \"%v\", value))\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushSeparator()\n    {\n      if (state_.empty())\n        return true;\n\n      switch (state_.back()) {\n      case kArray:\n      case kObjectKey:\n        return true;\n\n      case kArrayNext:\n        if (output_->loopWrite(\",\", 1) != 1)\n          return false;\n        state_.back() = kArray;\n        return true;\n\n      case kObjectNext:\n        if (output_->loopWrite(\",\", 1) != 1)\n          return false;\n        state_.back() = kObjectKey;\n        return true;\n\n      case kObjectValue:\n        return output_->loopWrite(\":\", 1) == 1;\n\n      default:\n        return true;\n      }\n    }\n\n    void\n    Encoder::nextState()\n    {\n      if (state_.empty())\n        return;\n\n      switch (state_.back()) {\n      case kArray:\n        state_.back() = kArrayNext;\n        break;\n\n      case kArrayNext:\n        break;\n\n      case kObjectKey:\n        state_.back() = kObjectValue;\n        break;\n\n      case kObjectValue:\n        state_.back() = kObjectNext;\n        break;\n\n      case kObjectNext:\n        state_.back() = kObjectKey;\n        break;\n\n      default:\n        break;\n      }\n    }\n  }\n}\n<commit_msg>json:encoder: \\b support<commit_after>#include \"encoder.hh\"\n#include \"..\/format\/format-stream.hh\"\n\nnamespace mimosa\n{\n  namespace json\n  {\n    Encoder::Encoder(stream::Stream::Ptr output)\n      : output_(output)\n    {\n    }\n\n    bool\n    Encoder::startObject()\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (output_->loopWrite(\"{\", 1) != 1)\n        return false;\n      state_.push_back(kObjectKey);\n      return true;\n    }\n\n    bool\n    Encoder::endObject()\n    {\n      if (state_.empty() ||\n          (state_.back() != kObjectKey && state_.back() != kObjectNext))\n        throw SyntaxError();\n\n      if (output_->loopWrite(\"}\", 1) != 1)\n        return false;\n\n      state_.pop_back();\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::startArray()\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (output_->loopWrite(\"[\", 1) != 1)\n        return false;\n\n      state_.push_back(kArray);\n      return true;\n    }\n\n    bool\n    Encoder::endArray()\n    {\n      if (state_.empty() || (state_.back() != kArray && state_.back() != kArrayNext))\n        throw SyntaxError();\n\n      if (output_->loopWrite(\"]\", 1) != 1)\n        return false;\n\n      state_.pop_back();\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushBoolean(bool value)\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if ((value && output_->loopWrite(\"true\", 4) != 4) ||\n          (!value && output_->loopWrite(\"false\", 5) != 5))\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushNull()\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (output_->loopWrite(\"null\", 4) != 4)\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushString(const std::string & data)\n    {\n      if (!pushSeparator())\n        return false;\n\n      if (output_->loopWrite(\"\\\"\", 1) != 1)\n        return false;\n\n      for (auto it = data.begin(); it != data.end(); ++it) {\n        if (*it == '\\\\' || *it == '\"')\n          if (output_->loopWrite(\"\\\\\", 1) != 1)\n            return false;\n\n        switch (*it) {\n        case '\\r':\n          if (output_->loopWrite(\"\\\\r\", 2) != 2)\n            return false;\n          break;\n\n        case '\\n':\n          if (output_->loopWrite(\"\\\\n\", 2) != 2)\n            return false;\n          break;\n\n        case '\\t':\n          if (output_->loopWrite(\"\\\\t\", 2) != 2)\n            return false;\n          break;\n\n        case '\\v':\n          if (output_->loopWrite(\"\\\\v\", 2) != 2)\n            return false;\n          break;\n\n        case '\\b':\n          if (output_->loopWrite(\"\\\\b\", 2) != 2)\n            return false;\n          break;\n\n        case '\\\\':\n        case '\"':\n          if (output_->loopWrite(\"\\\\\", 1) != 1)\n            return false;\n          \/* fall through *\/\n\n        default:\n          if (output_->loopWrite(&*it, 1) != 1)\n            return false;\n        }\n      }\n\n      if (output_->loopWrite(\"\\\"\", 1) != 1)\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushNumber(int64_t value)\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (!format::format(*output_, \"%d\", value))\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushFloat(double value)\n    {\n      if (!state_.empty() && state_.back() == kObjectKey)\n        throw SyntaxError();\n\n      if (!pushSeparator())\n        return false;\n\n      if (!format::format(*output_, \"%v\", value))\n        return false;\n\n      nextState();\n      return true;\n    }\n\n    bool\n    Encoder::pushSeparator()\n    {\n      if (state_.empty())\n        return true;\n\n      switch (state_.back()) {\n      case kArray:\n      case kObjectKey:\n        return true;\n\n      case kArrayNext:\n        if (output_->loopWrite(\",\", 1) != 1)\n          return false;\n        state_.back() = kArray;\n        return true;\n\n      case kObjectNext:\n        if (output_->loopWrite(\",\", 1) != 1)\n          return false;\n        state_.back() = kObjectKey;\n        return true;\n\n      case kObjectValue:\n        return output_->loopWrite(\":\", 1) == 1;\n\n      default:\n        return true;\n      }\n    }\n\n    void\n    Encoder::nextState()\n    {\n      if (state_.empty())\n        return;\n\n      switch (state_.back()) {\n      case kArray:\n        state_.back() = kArrayNext;\n        break;\n\n      case kArrayNext:\n        break;\n\n      case kObjectKey:\n        state_.back() = kObjectValue;\n        break;\n\n      case kObjectValue:\n        state_.back() = kObjectNext;\n        break;\n\n      case kObjectNext:\n        state_.back() = kObjectKey;\n        break;\n\n      default:\n        break;\n      }\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  main.cpp\n *  Program:  kalarm\n *  (C) 2001 - 2004 by David Jarvie <software@astrojar.org.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\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 permission\n *  to link the code of this program with any edition of the Qt library by\n *  Trolltech AS, Norway (or with modified versions of Qt that use the same\n *  license as Qt), and distribute linked combinations including the two.\n *  You must obey the GNU General Public License in all respects for all of\n *  the code used other than Qt.  If you modify this file, you may extend\n *  this exception to your version of the file, but you are not obligated to\n *  do so. If you do not wish to do so, delete this exception statement from\n *  your version.\n *\/\n\n#include \"kalarm.h\"\n\n#include <stdlib.h>\n\n#include <kcmdlineargs.h>\n#include <kaboutdata.h>\n#include <klocale.h>\n#include <kdebug.h>\n\n#include \"kalarmapp.h\"\n\n#define PROGRAM_NAME \"kalarm\"\n\nstatic KCmdLineOptions options[] =\n{\n\t{ \"a\", 0, 0 },\n\t{ \"ack-confirm\", I18N_NOOP(\"Prompt for confirmation when alarm is acknowledged\"), 0 },\n\t{ \"A\", 0, 0 },\n\t{ \"attach <url>\", I18N_NOOP(\"Attach file to email (repeat as needed)\"), 0 },\n\t{ \"bcc\", I18N_NOOP(\"Blind copy email to self\"), 0 },\n\t{ \"b\", 0, 0 },\n\t{ \"beep\", I18N_NOOP(\"Beep when message is displayed\"), 0 },\n\t{ \"colour\", 0, 0 },\n\t{ \"c\", 0, 0 },\n\t{ \"color <color>\", I18N_NOOP(\"Message background color (name or hex 0xRRGGBB)\"), 0 },\n\t{ \"colourfg\", 0, 0 },\n\t{ \"C\", 0, 0 },\n\t{ \"colorfg <color>\", I18N_NOOP(\"Message foreground color (name or hex 0xRRGGBB)\"), 0 },\n\t{ \"calendarURL <url>\", I18N_NOOP(\"URL of calendar file\"), 0 },\n\t{ \"cancelEvent <eventID>\", I18N_NOOP(\"Cancel alarm with the specified event ID\"), 0 },\n\t{ \"e\", 0, 0 },\n\t{ \"exec <commandline>\", I18N_NOOP(\"Execute a shell command line\"), 0 },\n\t{ \"f\", 0, 0 },\n\t{ \"file <url>\", I18N_NOOP(\"File to display\"), 0 },\n\t{ \"handleEvent <eventID>\", I18N_NOOP(\"Trigger or cancel alarm with the specified event ID\"), 0 },\n\t{ \"i\", 0, 0 },\n\t{ \"interval <period>\", I18N_NOOP(\"Interval between alarm recurrences\"), 0 },\n\t{ \"l\", 0, 0 },\n\t{ \"late-cancel\", I18N_NOOP(\"Cancel alarm if it cannot be triggered on time\"), 0 },\n#if 0\n\t{ \"auto-close\", I18N_NOOP(\"Auto-close alarm window after --late-cancel period\"), 0 },\n\t{ \"disable\", I18N_NOOP(\"Disable the alarm\"), 0 },\n\t{ \"late-cancel <period>\", I18N_NOOP(\"Cancel alarm if more than 'period' late when triggered\"), \"1\" },\n#endif\n\t{ \"L\", 0, 0 },\n\t{ \"login\", I18N_NOOP(\"Repeat alarm at every login\"), 0 },\n\t{ \"m\", 0, 0 },\n\t{ \"mail <address>\", I18N_NOOP(\"Send an email to the given address (repeat as needed)\"), 0 },\n\t{ \"p\", 0, 0 },\n\t{ \"play <url>\", I18N_NOOP(\"Audio file to play once\"), 0 },\n#ifndef WITHOUT_ARTS\n\t{ \"P\", 0, 0 },\n\t{ \"play-repeat <url>\", I18N_NOOP(\"Audio file to play repeatedly\"), 0 },\n#endif\n\t{ \"recurrence <spec>\", I18N_NOOP(\"Specify alarm recurrence using iCalendar syntax\"), 0 },\n\t{ \"R\", 0, 0 },\n\t{ \"reminder <period>\", I18N_NOOP(\"Display reminder in advance of alarm\"), 0 },\n\t{ \"reminder-once <period>\", I18N_NOOP(\"Display reminder once, before first alarm recurrence\"), 0 },\n\t{ \"r\", 0, 0 },\n\t{ \"repeat <count>\", I18N_NOOP(\"Number of times to repeat alarm (after the initial occasion)\"), 0 },\n\t{ \"reset\", I18N_NOOP(\"Reset the alarm scheduling daemon\"), 0 },\n\t{ \"stop\", I18N_NOOP(\"Stop the alarm scheduling daemon\"), 0 },\n\t{ \"S\", 0, 0 },\n\t{ \"subject \", I18N_NOOP(\"Email subject line\"), 0 },\n\t{ \"t\", 0, 0 },\n\t{ \"time <time>\", I18N_NOOP(\"Trigger alarm at time [[[yyyy-]mm-]dd-]hh:mm, or date yyyy-mm-dd\"), 0 },\n\t{ \"tray\", I18N_NOOP(\"Display system tray icon\"), 0 },\n\t{ \"triggerEvent <eventID>\", I18N_NOOP(\"Trigger alarm with the specified event ID\"), 0 },\n\t{ \"u\", 0, 0 },\n\t{ \"until <time>\", I18N_NOOP(\"Repeat until time [[[yyyy-]mm-]dd-]hh:mm, or date yyyy-mm-dd\"), 0 },\n#ifndef WITHOUT_ARTS\n\t{ \"v\", 0, 0 },\n\t{ \"volume <percent>\", I18N_NOOP(\"Volume to play audio file\"), 0 },\n#endif\n\t{ \"+[message]\", I18N_NOOP(\"Message text to display\"), 0 },\n\tKCmdLineLastOption\n};\n\n\nint main(int argc, char *argv[])\n{\n\tKAboutData aboutData(PROGRAM_NAME, I18N_NOOP(\"KAlarm\"), KALARM_VERSION,\n\t\tI18N_NOOP(\"Personal alarm message, command and email scheduler for KDE\"),\n\t\tKAboutData::License_GPL,\n\t\t\"(c) 2001 - 2004, David Jarvie\", 0, \"http:\/\/www.astrojar.org.uk\/linux\/kalarm.html\");\n\taboutData.addAuthor(\"David Jarvie\", 0, \"software@astrojar.org.uk\");\n\n\t\/\/ Fetch all command line options\/arguments after --exec and\n\t\/\/ concatenate them into a single argument.\n\t\/\/ This is necessary because the \"!\" indicator in the 'options'\n\t\/\/ array above doesn't work (on KDE2, at least)\n\tint    newargc = argc;\n\tchar** newargv = argv;\n\tfor (int i = 0;  i < argc;  ++i)\n\t{\n\t\tif (!strcmp(argv[i], \"-e\") || !strcmp(argv[i], \"--exec\"))\n\t\t{\n\t\t\t\/\/ --exec has been found. Create a new args list.\n\t\t\tnewargc = i + 1;\n\t\t\tnewargv = (char**)malloc(newargc * sizeof(char*));\n\t\t\tfor (int j = 0;  j < newargc;  ++j)\n\t\t\t\tnewargv[j] = argv[j];\n\t\t\t\/\/ Concatenate the --exec arguments into one\n\t\t\tQCString execArguments;\n\t\t\twhile (++i < argc)\n\t\t\t{\n\t\t\t\texecArguments += argv[i];\n\t\t\t\tif (i < argc - 1)\n\t\t\t\t\texecArguments += ' ';\n\t\t\t}\n\t\t\ti = execArguments.length();\n\t\t\tnewargv[newargc] = (char*)malloc(i + 1);\n\t\t\tmemcpy(newargv[newargc], static_cast<const char*>(execArguments), i);\n\t\t\tnewargv[newargc][i] = 0;\n\t\t\t++newargc;\n\t\t\tbreak;\n\t\t}\n\t}\n\tKCmdLineArgs::init(newargc, newargv, &aboutData);\n\tKCmdLineArgs::addCmdLineOptions(options);\n\tKUniqueApplication::addCmdLineOptions();\n\n\tif (!KAlarmApp::start())\n\t{\n\t\t\/\/ An instance of the application is already running\n\t\texit(0);\n\t}\n\n\t\/\/ This is the first time through\n\tkdDebug(5950) << \"main(): initialising\\n\";\n\tKAlarmApp* app = KAlarmApp::getInstance();\n\tapp->restoreSession();\n\treturn app->exec();\n}\n<commit_msg>Fix option descriptions<commit_after>\/*\n *  main.cpp\n *  Program:  kalarm\n *  (C) 2001 - 2004 by David Jarvie <software@astrojar.org.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\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 \"kalarm.h\"\n\n#include <stdlib.h>\n\n#include <kcmdlineargs.h>\n#include <kaboutdata.h>\n#include <klocale.h>\n#include <kdebug.h>\n\n#include \"kalarmapp.h\"\n\n#define PROGRAM_NAME \"kalarm\"\n\nstatic KCmdLineOptions options[] =\n{\n\t{ \"a\", 0, 0 },\n\t{ \"ack-confirm\", I18N_NOOP(\"Prompt for confirmation when alarm is acknowledged\"), 0 },\n\t{ \"A\", 0, 0 },\n\t{ \"attach <url>\", I18N_NOOP(\"Attach file to email (repeat as needed)\"), 0 },\n\t{ \"bcc\", I18N_NOOP(\"Blind copy email to self\"), 0 },\n\t{ \"b\", 0, 0 },\n\t{ \"beep\", I18N_NOOP(\"Beep when message is displayed\"), 0 },\n\t{ \"colour\", 0, 0 },\n\t{ \"c\", 0, 0 },\n\t{ \"color <color>\", I18N_NOOP(\"Message background color (name or hex 0xRRGGBB)\"), 0 },\n\t{ \"colourfg\", 0, 0 },\n\t{ \"C\", 0, 0 },\n\t{ \"colorfg <color>\", I18N_NOOP(\"Message foreground color (name or hex 0xRRGGBB)\"), 0 },\n\t{ \"calendarURL <url>\", I18N_NOOP(\"URL of calendar file\"), 0 },\n\t{ \"cancelEvent <eventID>\", I18N_NOOP(\"Cancel alarm with the specified event ID\"), 0 },\n\t{ \"e\", 0, 0 },\n\t{ \"exec <commandline>\", I18N_NOOP(\"Execute a shell command line\"), 0 },\n\t{ \"f\", 0, 0 },\n\t{ \"file <url>\", I18N_NOOP(\"File to display\"), 0 },\n\t{ \"handleEvent <eventID>\", I18N_NOOP(\"Trigger or cancel alarm with the specified event ID\"), 0 },\n\t{ \"i\", 0, 0 },\n\t{ \"interval <period>\", I18N_NOOP(\"Interval between alarm repetitions\"), 0 },\n\t{ \"l\", 0, 0 },\n\t{ \"late-cancel\", I18N_NOOP(\"Cancel alarm if it cannot be triggered on time\"), 0 },\n#if 0\n\t{ \"auto-close\", I18N_NOOP(\"Auto-close alarm window after --late-cancel period\"), 0 },\n\t{ \"disable\", I18N_NOOP(\"Disable the alarm\"), 0 },\n\t{ \"late-cancel <period>\", I18N_NOOP(\"Cancel alarm if more than 'period' late when triggered\"), \"1\" },\n#endif\n\t{ \"L\", 0, 0 },\n\t{ \"login\", I18N_NOOP(\"Repeat alarm at every login\"), 0 },\n\t{ \"m\", 0, 0 },\n\t{ \"mail <address>\", I18N_NOOP(\"Send an email to the given address (repeat as needed)\"), 0 },\n\t{ \"p\", 0, 0 },\n\t{ \"play <url>\", I18N_NOOP(\"Audio file to play once\"), 0 },\n#ifndef WITHOUT_ARTS\n\t{ \"P\", 0, 0 },\n\t{ \"play-repeat <url>\", I18N_NOOP(\"Audio file to play repeatedly\"), 0 },\n#endif\n\t{ \"recurrence <spec>\", I18N_NOOP(\"Specify alarm recurrence using iCalendar syntax\"), 0 },\n\t{ \"R\", 0, 0 },\n\t{ \"reminder <period>\", I18N_NOOP(\"Display reminder in advance of alarm\"), 0 },\n\t{ \"reminder-once <period>\", I18N_NOOP(\"Display reminder once, before first alarm recurrence\"), 0 },\n\t{ \"r\", 0, 0 },\n\t{ \"repeat <count>\", I18N_NOOP(\"Number of times to repeat alarm (including initial occasion)\"), 0 },\n\t{ \"reset\", I18N_NOOP(\"Reset the alarm scheduling daemon\"), 0 },\n\t{ \"stop\", I18N_NOOP(\"Stop the alarm scheduling daemon\"), 0 },\n\t{ \"S\", 0, 0 },\n\t{ \"subject \", I18N_NOOP(\"Email subject line\"), 0 },\n\t{ \"t\", 0, 0 },\n\t{ \"time <time>\", I18N_NOOP(\"Trigger alarm at time [[[yyyy-]mm-]dd-]hh:mm, or date yyyy-mm-dd\"), 0 },\n\t{ \"tray\", I18N_NOOP(\"Display system tray icon\"), 0 },\n\t{ \"triggerEvent <eventID>\", I18N_NOOP(\"Trigger alarm with the specified event ID\"), 0 },\n\t{ \"u\", 0, 0 },\n\t{ \"until <time>\", I18N_NOOP(\"Repeat until time [[[yyyy-]mm-]dd-]hh:mm, or date yyyy-mm-dd\"), 0 },\n#ifndef WITHOUT_ARTS\n\t{ \"v\", 0, 0 },\n\t{ \"volume <percent>\", I18N_NOOP(\"Volume to play audio file\"), 0 },\n#endif\n\t{ \"+[message]\", I18N_NOOP(\"Message text to display\"), 0 },\n\tKCmdLineLastOption\n};\n\n\nint main(int argc, char *argv[])\n{\n\tKAboutData aboutData(PROGRAM_NAME, I18N_NOOP(\"KAlarm\"), KALARM_VERSION,\n\t\tI18N_NOOP(\"Personal alarm message, command and email scheduler for KDE\"),\n\t\tKAboutData::License_GPL,\n\t\t\"(c) 2001 - 2004, David Jarvie\", 0, \"http:\/\/www.astrojar.org.uk\/linux\/kalarm.html\");\n\taboutData.addAuthor(\"David Jarvie\", 0, \"software@astrojar.org.uk\");\n\n\t\/\/ Fetch all command line options\/arguments after --exec and\n\t\/\/ concatenate them into a single argument.\n\t\/\/ This is necessary because the \"!\" indicator in the 'options'\n\t\/\/ array above doesn't work (on KDE2, at least)\n\tint    newargc = argc;\n\tchar** newargv = argv;\n\tfor (int i = 0;  i < argc;  ++i)\n\t{\n\t\tif (!strcmp(argv[i], \"-e\") || !strcmp(argv[i], \"--exec\"))\n\t\t{\n\t\t\t\/\/ --exec has been found. Create a new args list.\n\t\t\tnewargc = i + 1;\n\t\t\tnewargv = (char**)malloc(newargc * sizeof(char*));\n\t\t\tfor (int j = 0;  j < newargc;  ++j)\n\t\t\t\tnewargv[j] = argv[j];\n\t\t\t\/\/ Concatenate the --exec arguments into one\n\t\t\tQCString execArguments;\n\t\t\twhile (++i < argc)\n\t\t\t{\n\t\t\t\texecArguments += argv[i];\n\t\t\t\tif (i < argc - 1)\n\t\t\t\t\texecArguments += ' ';\n\t\t\t}\n\t\t\ti = execArguments.length();\n\t\t\tnewargv[newargc] = (char*)malloc(i + 1);\n\t\t\tmemcpy(newargv[newargc], static_cast<const char*>(execArguments), i);\n\t\t\tnewargv[newargc][i] = 0;\n\t\t\t++newargc;\n\t\t\tbreak;\n\t\t}\n\t}\n\tKCmdLineArgs::init(newargc, newargv, &aboutData);\n\tKCmdLineArgs::addCmdLineOptions(options);\n\tKUniqueApplication::addCmdLineOptions();\n\n\tif (!KAlarmApp::start())\n\t{\n\t\t\/\/ An instance of the application is already running\n\t\texit(0);\n\t}\n\n\t\/\/ This is the first time through\n\tkdDebug(5950) << \"main(): initialising\\n\";\n\tKAlarmApp* app = KAlarmApp::getInstance();\n\tapp->restoreSession();\n\treturn app->exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <scheduler\/pthread-coro.hh>\n\n#if defined SCHEDULER_CORO_OSTHREAD\n\n#  include <cerrno>\n\n#  include <libport\/config.h>\n#  include <libport\/assert.hh>\n#  include <libport\/compiler.hh>\n#  include <libport\/semaphore.hh>\n#  include <libport\/thread.hh>\n\n#  include <kernel\/kernconf.hh>\n#  include <scheduler\/coroutine.hh>\n\n\/* Os-thread implementation of coroutines, using semaphores to ensure\n   that only one coroutine is running at the same time.  *\/\n\nCoro::Coro()\n  : die_(false)\n{}\n\nCoro*\ncoroutine_new(size_t)\n{\n  return new Coro;\n}\n\nvoid\ncoroutine_free(Coro* c)\n{\n  c->die_ = true;\n  c->sem_++;\n}\n\nvoid\ncoroutine_start(Coro* self, Coro* other,\n                void (*callback)(void*), void* context)\n{\n#if defined WIN32\n  unsigned long id;\n  void* r =\n    CreateThread(NULL, 0,\n                 reinterpret_cast<void* (*)(void*)>(callback), context,\n                 0, &id);\n#else\n  \/\/ Adjust to the requested stack size.\n  static pthread_attr_t attr;\n  static bool first = true;\n  if (first)\n  {\n    first = false;\n    if (pthread_attr_init(&attr))\n      errabort(\"pthread_attr_init\");\n\n    if (pthread_attr_setstacksize(&attr, kernconf.default_stack_size))\n      errabort(\"pthread_attr_setstacksize\");\n  }\n\n  if (pthread_create(&other->thread_, &attr,\n\t\t     reinterpret_cast<void* (*)(void*)>(callback), context))\n    errabort(\"pthread_create\");\n#endif\n  self->sem_--;\n}\n\nvoid\ncoroutine_switch_to(Coro* self, Coro* next)\n{\n  next->sem_++;\n  self->sem_--;\n  if (self->die_)\n  {\n    delete self;\n    pthread_exit(0);\n  }\n}\n\nbool\ncoroutine_stack_space_almost_gone(Coro*)\n{\n  return false;\n}\n\nvoid\ncoroutine_initialize_main(Coro*)\n{\n}\n\n#endif \/\/! SCHEDULER_CORO_OSTHREAD\n<commit_msg>Terminate job synchronously even in pthreads mode.<commit_after>#include <scheduler\/pthread-coro.hh>\n\n#if defined SCHEDULER_CORO_OSTHREAD\n\n#  include <cerrno>\n\n#  include <libport\/config.h>\n#  include <libport\/assert.hh>\n#  include <libport\/compiler.hh>\n#  include <libport\/semaphore.hh>\n#  include <libport\/thread.hh>\n\n#  include <kernel\/kernconf.hh>\n#  include <scheduler\/coroutine.hh>\n\n\/* Os-thread implementation of coroutines, using semaphores to ensure\n   that only one coroutine is running at the same time.  *\/\n\nCoro::Coro()\n  : die_(false)\n{}\n\nCoro*\ncoroutine_new(size_t)\n{\n  return new Coro;\n}\n\nvoid\ncoroutine_free(Coro* c)\n{\n  void *status;\n  c->die_ = true;\n  c->sem_++;\n  if (pthread_join(c->thread_, &status))\n    errabort(\"pthread_join\");\n}\n\nvoid\ncoroutine_start(Coro* self, Coro* other,\n                void (*callback)(void*), void* context)\n{\n#if defined WIN32\n  unsigned long id;\n  void* r =\n    CreateThread(NULL, 0,\n                 reinterpret_cast<void* (*)(void*)>(callback), context,\n                 0, &id);\n#else\n  \/\/ Adjust to the requested stack size.\n  static pthread_attr_t attr;\n  static bool first = true;\n  if (first)\n  {\n    first = false;\n    if (pthread_attr_init(&attr))\n      errabort(\"pthread_attr_init\");\n\n    if (pthread_attr_setstacksize(&attr, kernconf.default_stack_size))\n      errabort(\"pthread_attr_setstacksize\");\n  }\n\n  if (pthread_create(&other->thread_, &attr,\n\t\t     reinterpret_cast<void* (*)(void*)>(callback), context))\n    errabort(\"pthread_create\");\n#endif\n  self->sem_--;\n}\n\nvoid\ncoroutine_switch_to(Coro* self, Coro* next)\n{\n  next->sem_++;\n  self->sem_--;\n  if (self->die_)\n  {\n    delete self;\n    pthread_exit(0);\n  }\n}\n\nbool\ncoroutine_stack_space_almost_gone(Coro*)\n{\n  return false;\n}\n\nvoid\ncoroutine_initialize_main(Coro*)\n{\n}\n\n#endif \/\/! SCHEDULER_CORO_OSTHREAD\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2014-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 <thrift\/lib\/cpp2\/util\/ScopedServerInterfaceThread.h>\n\n#include <folly\/SocketAddress.h>\n#include <thrift\/lib\/cpp2\/server\/BaseThriftServer.h>\n#include <thrift\/lib\/cpp2\/server\/ThriftServer.h>\n\nusing namespace std;\nusing namespace folly;\nusing namespace apache::thrift::concurrency;\n\nnamespace apache { namespace thrift {\n\nScopedServerInterfaceThread::ScopedServerInterfaceThread(\n    shared_ptr<AsyncProcessorFactory> apf,\n    SocketAddress const& addr,\n    ServerConfigCb configCb) {\n  auto tm = ThreadManager::newSimpleThreadManager(1, false);\n  tm->threadFactory(make_shared<PosixThreadFactory>());\n  tm->start();\n  auto ts = make_shared<ThriftServer>();\n  ts->setAddress(addr);\n  ts->setProcessorFactory(move(apf));\n  ts->setNumIOWorkerThreads(1);\n  ts->setThreadManager(tm);\n  if (configCb) {\n    configCb(*ts);\n  }\n  ts_ = move(ts);\n  sst_.start(ts_);\n}\n\nScopedServerInterfaceThread::ScopedServerInterfaceThread(\n    shared_ptr<AsyncProcessorFactory> apf,\n    const string& host,\n    uint16_t port,\n    ServerConfigCb configCb)\n    : ScopedServerInterfaceThread(\n          move(apf),\n          SocketAddress(host, port),\n          move(configCb)) {}\n\nScopedServerInterfaceThread::ScopedServerInterfaceThread(\n    shared_ptr<BaseThriftServer> ts) {\n  ts_ = move(ts);\n  sst_.start(ts_);\n}\n\nBaseThriftServer& ScopedServerInterfaceThread::getThriftServer() const {\n  return *ts_;\n}\n\nconst SocketAddress& ScopedServerInterfaceThread::getAddress() const {\n  return *sst_.getAddress();\n}\n\nuint16_t ScopedServerInterfaceThread::getPort() const {\n  return getAddress().getPort();\n}\n\n}}\n<commit_msg>Let ScopedServerInterfaceThread not detach threads<commit_after>\/*\n * Copyright 2014-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 <thrift\/lib\/cpp2\/util\/ScopedServerInterfaceThread.h>\n\n#include <folly\/SocketAddress.h>\n#include <thrift\/lib\/cpp2\/server\/BaseThriftServer.h>\n#include <thrift\/lib\/cpp2\/server\/ThriftServer.h>\n\nusing namespace std;\nusing namespace folly;\nusing namespace apache::thrift::concurrency;\n\nnamespace apache { namespace thrift {\n\nScopedServerInterfaceThread::ScopedServerInterfaceThread(\n    shared_ptr<AsyncProcessorFactory> apf,\n    SocketAddress const& addr,\n    ServerConfigCb configCb) {\n  auto tf = make_shared<PosixThreadFactory>(PosixThreadFactory::ATTACHED);\n  auto tm = ThreadManager::newSimpleThreadManager(1, false);\n  tm->threadFactory(move(tf));\n  tm->start();\n  auto ts = make_shared<ThriftServer>();\n  ts->setAddress(addr);\n  ts->setProcessorFactory(move(apf));\n  ts->setNumIOWorkerThreads(1);\n  ts->setThreadManager(tm);\n  if (configCb) {\n    configCb(*ts);\n  }\n  ts_ = move(ts);\n  sst_.start(ts_);\n}\n\nScopedServerInterfaceThread::ScopedServerInterfaceThread(\n    shared_ptr<AsyncProcessorFactory> apf,\n    const string& host,\n    uint16_t port,\n    ServerConfigCb configCb)\n    : ScopedServerInterfaceThread(\n          move(apf),\n          SocketAddress(host, port),\n          move(configCb)) {}\n\nScopedServerInterfaceThread::ScopedServerInterfaceThread(\n    shared_ptr<BaseThriftServer> ts) {\n  ts_ = move(ts);\n  sst_.start(ts_);\n}\n\nBaseThriftServer& ScopedServerInterfaceThread::getThriftServer() const {\n  return *ts_;\n}\n\nconst SocketAddress& ScopedServerInterfaceThread::getAddress() const {\n  return *sst_.getAddress();\n}\n\nuint16_t ScopedServerInterfaceThread::getPort() const {\n  return getAddress().getPort();\n}\n\n}}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: unocontrolcontainer.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: ihi $ $Date: 2006-11-14 12:28: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 _TOOLKIT_CONTROLS_UNOCONTROLCONTAINER_HXX_\n#define _TOOLKIT_CONTROLS_UNOCONTROLCONTAINER_HXX_\n\n\n#ifndef _COM_SUN_STAR_AWT_XCONTROLCONTAINER_HPP_\n#include <com\/sun\/star\/awt\/XControlContainer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XUNOCONTROLCONTAINER_HPP_\n#include <com\/sun\/star\/awt\/XUnoControlContainer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCONTAINER_HPP_\n#include <com\/sun\/star\/container\/XContainer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XIDENTIFIERCONTAINER_HPP_\n#include <com\/sun\/star\/container\/XIdentifierContainer.hpp>\n#endif\n\n#include <toolkit\/controls\/unocontrol.hxx>\n#include <toolkit\/controls\/unocontrolbase.hxx>\n#include <toolkit\/helper\/macros.hxx>\n#include <toolkit\/helper\/servicenames.hxx>\n\n#include <cppuhelper\/implbase4.hxx>\n\nclass UnoControlHolderList;\n\n\/\/  ----------------------------------------------------\n\/\/  class UnoControlContainer\n\/\/  ----------------------------------------------------\ntypedef ::cppu::AggImplInheritanceHelper4   <   UnoControlBase\n                                            ,   ::com::sun::star::awt::XUnoControlContainer\n                                            ,   ::com::sun::star::awt::XControlContainer\n                                            ,   ::com::sun::star::container::XContainer\n                                            ,   ::com::sun::star::container::XIdentifierContainer\n                                            >   UnoControlContainer_Base;\n\nclass UnoControlContainer : public UnoControlContainer_Base\n{\nprivate:\n    UnoControlHolderList*                   mpControls;\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController > >    maTabControllers;\n    ContainerListenerMultiplexer            maCListeners;\n\nprotected:\n    void                                    ImplActivateTabControllers();\n\npublic:\n                UnoControlContainer();\n                UnoControlContainer( ::com::sun::star::uno::Reference< ::com::sun::star::awt::XWindowPeer >  xPeer );\n                ~UnoControlContainer();\n\n\n    \/\/ ::com::sun::star::lang::XComponent\n    void SAL_CALL dispose() throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::lang::XEventListener\n    void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XContainer\n    void SAL_CALL addContainerListener( const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerListener >& xListener ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL removeContainerListener( const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerListener >& xListener ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XIdentifierContainer\n    virtual ::sal_Int32 SAL_CALL insert( const ::com::sun::star::uno::Any& aElement ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XIdentifierReplace\n    virtual void SAL_CALL removeByIdentifier( ::sal_Int32 Identifier ) throw (::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL replaceByIdentifer( ::sal_Int32 Identifier, const ::com::sun::star::uno::Any& aElement ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XIdentifierAccess\n    virtual ::com::sun::star::uno::Any SAL_CALL getByIdentifier( ::sal_Int32 Identifierr ) throw (::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< ::sal_Int32 > SAL_CALL getIdentifiers(  ) throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XElementAccess\n    virtual ::com::sun::star::uno::Type SAL_CALL getElementType(  ) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Bool SAL_CALL hasElements(  ) throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::awt::XControlContainer\n    void SAL_CALL setStatusText( const ::rtl::OUString& StatusText ) throw(::com::sun::star::uno::RuntimeException);\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl > > SAL_CALL getControls(  ) throw(::com::sun::star::uno::RuntimeException);\n    ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl > SAL_CALL getControl( const ::rtl::OUString& aName ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL addControl( const ::rtl::OUString& Name, const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& Control ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL removeControl( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& Control ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::awt::XUnoControlContainer\n    void SAL_CALL setTabControllers( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController > >& TabControllers ) throw(::com::sun::star::uno::RuntimeException);\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController > > SAL_CALL getTabControllers(  ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL addTabController( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController >& TabController ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL removeTabController( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController >& TabController ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::awt::XControl\n    void SAL_CALL createPeer( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XToolkit >& Toolkit, const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XWindowPeer >& Parent ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::awt::XWindow\n    void SAL_CALL setVisible( sal_Bool Visible ) throw(::com::sun::star::uno::RuntimeException);\n\n    DECLIMPL_SERVICEINFO_DERIVED( UnoControlContainer, UnoControlBase, szServiceName2_UnoControlContainer )\n\nprotected:\n    virtual void removingControl( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl );\n    virtual void addingControl( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl );\n\nprivate:\n    \/** adds the control to the container, does necessary notifications, and the like\n        @param _rxControl\n            the control to add. Must not be <NULL\/>\n        @param _pName\n            Pointer to a name for the control. Might be <NULL\/>, in this case an auotmatic name is generated\n        @return\n            the ID of the newly added control\n    *\/\n    sal_Int32 impl_addControl(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl,\n        const ::rtl::OUString* _pName = NULL\n    );\n\n    \/** removes the given control from the container, including necessary notifications and the like\n        @param  _nId\n            the ID of the control to remove\n        @param  _rxControl\n            the control itself. Must be the one which is stored under the given ID. This parameter could also be\n            obtained inside the method, but callers usually have obtained it, anyway.\n        @param  _pNameAccessor\n            the name which the control was registered for. Might be <NULL\/>, in this case\n            container event broadcasts use the ID as accessor.\n    *\/\n    void      impl_removeControl(\n        sal_Int32 _nId,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl,\n        const ::rtl::OUString* _pNameAccessor\n    );\n\n    \/** ensures that the given control has a peer, if necessary and possible\n        @param _rxControl\n            an ->XControl which has just been inserted into the container. Must not be <NULL\/>.\n        @precond\n            our mutex is locked\n    *\/\n    void    impl_createControlPeerIfNecessary(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl\n    );\n};\n\n\n\n#endif \/\/ _TOOLKIT_CONTROLS_UNOCONTROLCONTAINER_HXX_\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.9.190); FILE MERGED 2008\/04\/01 12:56:44 thb 1.9.190.2: #i85898# Stripping all external header guards 2008\/03\/28 15:40:07 rt 1.9.190.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: unocontrolcontainer.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 _TOOLKIT_CONTROLS_UNOCONTROLCONTAINER_HXX_\n#define _TOOLKIT_CONTROLS_UNOCONTROLCONTAINER_HXX_\n\n\n#include <com\/sun\/star\/awt\/XControlContainer.hpp>\n#include <com\/sun\/star\/awt\/XUnoControlContainer.hpp>\n#include <com\/sun\/star\/container\/XContainer.hpp>\n#include <com\/sun\/star\/container\/XIdentifierContainer.hpp>\n\n#include <toolkit\/controls\/unocontrol.hxx>\n#include <toolkit\/controls\/unocontrolbase.hxx>\n#include <toolkit\/helper\/macros.hxx>\n#include <toolkit\/helper\/servicenames.hxx>\n\n#include <cppuhelper\/implbase4.hxx>\n\nclass UnoControlHolderList;\n\n\/\/  ----------------------------------------------------\n\/\/  class UnoControlContainer\n\/\/  ----------------------------------------------------\ntypedef ::cppu::AggImplInheritanceHelper4   <   UnoControlBase\n                                            ,   ::com::sun::star::awt::XUnoControlContainer\n                                            ,   ::com::sun::star::awt::XControlContainer\n                                            ,   ::com::sun::star::container::XContainer\n                                            ,   ::com::sun::star::container::XIdentifierContainer\n                                            >   UnoControlContainer_Base;\n\nclass UnoControlContainer : public UnoControlContainer_Base\n{\nprivate:\n    UnoControlHolderList*                   mpControls;\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController > >    maTabControllers;\n    ContainerListenerMultiplexer            maCListeners;\n\nprotected:\n    void                                    ImplActivateTabControllers();\n\npublic:\n                UnoControlContainer();\n                UnoControlContainer( ::com::sun::star::uno::Reference< ::com::sun::star::awt::XWindowPeer >  xPeer );\n                ~UnoControlContainer();\n\n\n    \/\/ ::com::sun::star::lang::XComponent\n    void SAL_CALL dispose() throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::lang::XEventListener\n    void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XContainer\n    void SAL_CALL addContainerListener( const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerListener >& xListener ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL removeContainerListener( const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerListener >& xListener ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XIdentifierContainer\n    virtual ::sal_Int32 SAL_CALL insert( const ::com::sun::star::uno::Any& aElement ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XIdentifierReplace\n    virtual void SAL_CALL removeByIdentifier( ::sal_Int32 Identifier ) throw (::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL replaceByIdentifer( ::sal_Int32 Identifier, const ::com::sun::star::uno::Any& aElement ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XIdentifierAccess\n    virtual ::com::sun::star::uno::Any SAL_CALL getByIdentifier( ::sal_Int32 Identifierr ) throw (::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< ::sal_Int32 > SAL_CALL getIdentifiers(  ) throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::container::XElementAccess\n    virtual ::com::sun::star::uno::Type SAL_CALL getElementType(  ) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Bool SAL_CALL hasElements(  ) throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::awt::XControlContainer\n    void SAL_CALL setStatusText( const ::rtl::OUString& StatusText ) throw(::com::sun::star::uno::RuntimeException);\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl > > SAL_CALL getControls(  ) throw(::com::sun::star::uno::RuntimeException);\n    ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl > SAL_CALL getControl( const ::rtl::OUString& aName ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL addControl( const ::rtl::OUString& Name, const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& Control ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL removeControl( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& Control ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::awt::XUnoControlContainer\n    void SAL_CALL setTabControllers( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController > >& TabControllers ) throw(::com::sun::star::uno::RuntimeException);\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController > > SAL_CALL getTabControllers(  ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL addTabController( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController >& TabController ) throw(::com::sun::star::uno::RuntimeException);\n    void SAL_CALL removeTabController( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTabController >& TabController ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::awt::XControl\n    void SAL_CALL createPeer( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XToolkit >& Toolkit, const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XWindowPeer >& Parent ) throw(::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::awt::XWindow\n    void SAL_CALL setVisible( sal_Bool Visible ) throw(::com::sun::star::uno::RuntimeException);\n\n    DECLIMPL_SERVICEINFO_DERIVED( UnoControlContainer, UnoControlBase, szServiceName2_UnoControlContainer )\n\nprotected:\n    virtual void removingControl( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl );\n    virtual void addingControl( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl );\n\nprivate:\n    \/** adds the control to the container, does necessary notifications, and the like\n        @param _rxControl\n            the control to add. Must not be <NULL\/>\n        @param _pName\n            Pointer to a name for the control. Might be <NULL\/>, in this case an auotmatic name is generated\n        @return\n            the ID of the newly added control\n    *\/\n    sal_Int32 impl_addControl(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl,\n        const ::rtl::OUString* _pName = NULL\n    );\n\n    \/** removes the given control from the container, including necessary notifications and the like\n        @param  _nId\n            the ID of the control to remove\n        @param  _rxControl\n            the control itself. Must be the one which is stored under the given ID. This parameter could also be\n            obtained inside the method, but callers usually have obtained it, anyway.\n        @param  _pNameAccessor\n            the name which the control was registered for. Might be <NULL\/>, in this case\n            container event broadcasts use the ID as accessor.\n    *\/\n    void      impl_removeControl(\n        sal_Int32 _nId,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl,\n        const ::rtl::OUString* _pNameAccessor\n    );\n\n    \/** ensures that the given control has a peer, if necessary and possible\n        @param _rxControl\n            an ->XControl which has just been inserted into the container. Must not be <NULL\/>.\n        @precond\n            our mutex is locked\n    *\/\n    void    impl_createControlPeerIfNecessary(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl\n    );\n};\n\n\n\n#endif \/\/ _TOOLKIT_CONTROLS_UNOCONTROLCONTAINER_HXX_\n\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <sstream>\n#include <stdexcept>\n\n#include \"File.h\"\n#include \"KeyValueFile.h\"\n#include \"String.h\"\n#include \"StringView.h\"\n#include \"..\/debug\/Debug.h\"\n\nvoid KeyValueFile::Section::init(std::string &&name)\n{\n\tthis->name = std::move(name);\n}\n\nconst std::string &KeyValueFile::Section::getName() const\n{\n\treturn this->name;\n}\n\nint KeyValueFile::Section::getPairCount() const\n{\n\treturn static_cast<int>(this->pairs.size());\n}\n\nconst std::pair<std::string, std::string> &KeyValueFile::Section::getPair(int index) const\n{\n\tDebugAssertIndex(this->pairs, index);\n\treturn this->pairs[index];\n}\n\nbool KeyValueFile::Section::tryGetValue(const std::string &key, std::string_view &value) const\n{\n\tconst std::pair<std::string, std::string> searchPair(key, std::string());\n\tconst auto iter = std::lower_bound(this->pairs.begin(), this->pairs.end(), searchPair,\n\t\t[](const auto &pairA, const auto &pairB)\n\t{\n\t\treturn pairA.first < pairB.first;\n\t});\n\n\tif (iter != this->pairs.end())\n\t{\n\t\tvalue = iter->second;\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nbool KeyValueFile::Section::tryGetBoolean(const std::string &key, bool &value) const\n{\n\tstd::string_view str;\n\tif (!this->tryGetValue(key, str))\n\t{\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\t\/\/ Convert to lowercase for easier comparison.\n\t\tconst std::string lowerStr = String::toLowercase(std::string(str));\n\n\t\tif (lowerStr == \"true\")\n\t\t{\n\t\t\tvalue = true;\n\t\t\treturn true;\n\t\t}\n\t\telse if (lowerStr == \"false\")\n\t\t{\n\t\t\tvalue = false;\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nbool KeyValueFile::Section::tryGetInteger(const std::string &key, int &value) const\n{\n\tstd::string_view str;\n\tif (!this->tryGetValue(key, str))\n\t{\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\ttry\n\t\t{\n\t\t\tsize_t index = 0;\n\t\t\tvalue = std::stoi(std::string(str), &index);\n\t\t\treturn index == str.size();\n\t\t}\n\t\tcatch (std::exception)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nbool KeyValueFile::Section::tryGetDouble(const std::string &key, double &value) const\n{\n\tstd::string_view str;\n\tif (!this->tryGetValue(key, str))\n\t{\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\ttry\n\t\t{\n\t\t\tsize_t index = 0;\n\t\t\tvalue = std::stod(std::string(str), &index);\n\t\t\treturn index == str.size();\n\t\t}\n\t\tcatch (std::exception)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nbool KeyValueFile::Section::tryGetString(const std::string &key, std::string_view &value) const\n{\n\treturn this->tryGetValue(key, value);\n}\n\nvoid KeyValueFile::Section::add(std::string &&key, std::string &&value)\n{\n\tthis->pairs.push_back(std::make_pair(std::move(key), std::move(value)));\n\tstd::sort(this->pairs.begin(), this->pairs.end(),\n\t\t[](const auto &pairA, const auto &pairB)\n\t{\n\t\tconst std::string &strA = pairA.first;\n\t\tconst std::string &strB = pairB.first;\n\t\treturn strA < strB;\n\t});\n}\n\nvoid KeyValueFile::Section::clear()\n{\n\tthis->pairs.clear();\n}\n\nconst char KeyValueFile::COMMENT = '#';\nconst char KeyValueFile::PAIR_SEPARATOR = '=';\nconst char KeyValueFile::SECTION_FRONT = '[';\nconst char KeyValueFile::SECTION_BACK = ']';\n\nbool KeyValueFile::init(const char *filename)\n{\n\tconst std::string text = File::readAllText(filename);\n\tstd::istringstream iss(text);\n\n\t\/\/ Check each line for a valid section or key-value pair. Start the line numbers at 1\n\t\/\/ since most users aren't programmers.\n\tstd::string line;\n\tSection *activeSection = nullptr;\n\tfor (int lineNumber = 1; std::getline(iss, line); lineNumber++)\n\t{\n\t\t\/\/ Get a filtered version of the current line so it can be parsed. If the filtered\n\t\t\/\/ string is empty, then skip to the next line.\n\t\tconst std::string_view filteredLine = [&line]()\n\t\t{\n\t\t\tstd::string_view str = line;\n\n\t\t\t\/\/ Skip empty strings.\n\t\t\tif ((str.size() == 0) || ((str.size() == 1) && (str.front() == '\\r')))\n\t\t\t{\n\t\t\t\treturn std::string_view();\n\t\t\t}\n\n\t\t\t\/\/ Remove carriage return at the end (if any).\n\t\t\tif (str.back() == '\\r')\n\t\t\t{\n\t\t\t\tstr.remove_suffix(1);\n\t\t\t}\n\n\t\t\t\/\/ Extract left-most comment (if any).\n\t\t\tconst size_t commentIndex = str.find(KeyValueFile::COMMENT);\n\t\t\tif (commentIndex == 0)\n\t\t\t{\n\t\t\t\t\/\/ Comment covers the entire line.\n\t\t\t\treturn std::string_view();\n\t\t\t}\n\t\t\telse if (commentIndex != std::string_view::npos)\n\t\t\t{\n\t\t\t\t\/\/ Comment is somewhere in the line, so only work with the left substring.\n\t\t\t\tstr = str.substr(0, commentIndex);\n\t\t\t}\n\n\t\t\t\/\/ Trim leading and trailing whitespace (i.e., in case the key has whitespace\n\t\t\t\/\/ before it, or a comment had whitespace before it).\n\t\t\treturn StringView::trimFront(StringView::trimBack(str));\n\t\t}();\n\n\t\tif (filteredLine.empty())\n\t\t{\n\t\t\t\/\/ It became an empty string after whitespace was removed.\n\t\t\tcontinue;\n\t\t}\n\t\telse if (filteredLine.size() < 3)\n\t\t{\n\t\t\t\/\/ Not long enough to be a section or key-value pair.\n\t\t\tDebugLogError(\"Syntax error \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ See if it's a section line or key-value pair line.\n\t\tconst size_t sectionFrontIndex = filteredLine.find(KeyValueFile::SECTION_FRONT);\n\t\tif (sectionFrontIndex != std::string_view::npos)\n\t\t{\n\t\t\t\/\/ Section line. There must be a closing character with enough space between it\n\t\t\t\/\/ and the front character for at least one section character.\n\t\t\tconst size_t sectionBackIndex = filteredLine.find(\n\t\t\t\tKeyValueFile::SECTION_BACK, sectionFrontIndex);\n\n\t\t\tif ((sectionBackIndex != std::string_view::npos) &&\n\t\t\t\t(sectionBackIndex > (sectionFrontIndex + 1)))\n\t\t\t{\n\t\t\t\t\/\/ Get the string that's between the section characters and trim any\n\t\t\t\t\/\/ leading or trailing whitespace.\n\t\t\t\tstd::string_view sectionName = filteredLine.substr(\n\t\t\t\t\tsectionFrontIndex + 1, sectionBackIndex - sectionFrontIndex - 1);\n\t\t\t\tsectionName = StringView::trimFront(StringView::trimBack(sectionName));\n\n\t\t\t\tconst auto sectionIter = std::find_if(this->sections.begin(), this->sections.end(),\n\t\t\t\t\t[&sectionName](const Section &section)\n\t\t\t\t{\n\t\t\t\t\treturn section.getName() == sectionName;\n\t\t\t\t});\n\n\t\t\t\t\/\/ If the section is new, add it to the section maps.\n\t\t\t\tif (sectionIter == this->sections.end())\n\t\t\t\t{\n\t\t\t\t\tSection section;\n\t\t\t\t\tsection.init(std::string(sectionName));\n\t\t\t\t\tthis->sections.push_back(std::move(section));\n\t\t\t\t\tactiveSection = &this->sections.back();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tDebugLogError(\"Section \\\"\" + std::string(sectionName) + \"\\\" (line \" +\n\t\t\t\t\t\tstd::to_string(lineNumber) + \") already defined in \" + filename + \".\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tDebugLogError(\"Invalid section \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse if (filteredLine.find(KeyValueFile::PAIR_SEPARATOR) != std::string::npos)\n\t\t{\n\t\t\t\/\/ Key-value pair line. There must be two tokens: key and value.\n\t\t\tstd::array<std::string_view, 2> tokens;\n\t\t\tif (!StringView::splitExpected(filteredLine, KeyValueFile::PAIR_SEPARATOR, tokens))\n\t\t\t{\n\t\t\t\tDebugLogError(\"Invalid pair \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ Trim whitespace from the key and leading whitespace from the value.\n\t\t\tconst std::string_view key = StringView::trimFront(StringView::trimBack(tokens[0]));\n\t\t\tconst std::string_view value = StringView::trimFront(tokens[1]);\n\n\t\t\tif (key.size() == 0)\n\t\t\t{\n\t\t\t\tDebugLogError(\"Empty key in \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ Add the key-value pair to the active section map.\n\t\t\tif (activeSection != nullptr)\n\t\t\t{\n\t\t\t\tactiveSection->add(std::string(key), std::string(value));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ If no active section map, print a warning and ignore the current pair.\n\t\t\t\t\/\/ All key-value pairs must be in a section.\n\t\t\t\tDebugLogWarning(\"Ignoring \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\t\tstd::to_string(lineNumber) + \"), no active section in \" + filename);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Filtered line is not a section or key-value pair.\n\t\t\tDebugLogError(\"Invalid line \\\"\" + line + \"\\\" (line \" +\n\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/\/ Sort for binary search.\n\tstd::sort(this->sections.begin(), this->sections.end(),\n\t\t[](const Section &sectionA, const Section &sectionB)\n\t{\n\t\treturn sectionA.getName() < sectionB.getName();\n\t});\n\n\treturn true;\n}\n\nint KeyValueFile::getSectionCount() const\n{\n\treturn static_cast<int>(this->sections.size());\n}\n\nconst KeyValueFile::Section &KeyValueFile::getSection(int index) const\n{\n\tDebugAssertIndex(this->sections, index);\n\treturn this->sections[index];\n}\n\nconst KeyValueFile::Section *KeyValueFile::getSectionByName(const std::string &name) const\n{\n\tconst auto iter = std::lower_bound(this->sections.begin(), this->sections.end(), name,\n\t\t[](const Section &section, const std::string &str)\n\t{\n\t\treturn section.getName() < str;\n\t});\n\n\treturn (iter != this->sections.end()) ? &(*iter) : nullptr;\n}\n<commit_msg>Added file exists check to KeyValueFile::init().<commit_after>#include <algorithm>\n#include <sstream>\n#include <stdexcept>\n\n#include \"File.h\"\n#include \"KeyValueFile.h\"\n#include \"String.h\"\n#include \"StringView.h\"\n#include \"..\/debug\/Debug.h\"\n\nvoid KeyValueFile::Section::init(std::string &&name)\n{\n\tthis->name = std::move(name);\n}\n\nconst std::string &KeyValueFile::Section::getName() const\n{\n\treturn this->name;\n}\n\nint KeyValueFile::Section::getPairCount() const\n{\n\treturn static_cast<int>(this->pairs.size());\n}\n\nconst std::pair<std::string, std::string> &KeyValueFile::Section::getPair(int index) const\n{\n\tDebugAssertIndex(this->pairs, index);\n\treturn this->pairs[index];\n}\n\nbool KeyValueFile::Section::tryGetValue(const std::string &key, std::string_view &value) const\n{\n\tconst std::pair<std::string, std::string> searchPair(key, std::string());\n\tconst auto iter = std::lower_bound(this->pairs.begin(), this->pairs.end(), searchPair,\n\t\t[](const auto &pairA, const auto &pairB)\n\t{\n\t\treturn pairA.first < pairB.first;\n\t});\n\n\tif (iter != this->pairs.end())\n\t{\n\t\tvalue = iter->second;\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nbool KeyValueFile::Section::tryGetBoolean(const std::string &key, bool &value) const\n{\n\tstd::string_view str;\n\tif (!this->tryGetValue(key, str))\n\t{\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\t\/\/ Convert to lowercase for easier comparison.\n\t\tconst std::string lowerStr = String::toLowercase(std::string(str));\n\n\t\tif (lowerStr == \"true\")\n\t\t{\n\t\t\tvalue = true;\n\t\t\treturn true;\n\t\t}\n\t\telse if (lowerStr == \"false\")\n\t\t{\n\t\t\tvalue = false;\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nbool KeyValueFile::Section::tryGetInteger(const std::string &key, int &value) const\n{\n\tstd::string_view str;\n\tif (!this->tryGetValue(key, str))\n\t{\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\ttry\n\t\t{\n\t\t\tsize_t index = 0;\n\t\t\tvalue = std::stoi(std::string(str), &index);\n\t\t\treturn index == str.size();\n\t\t}\n\t\tcatch (std::exception)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nbool KeyValueFile::Section::tryGetDouble(const std::string &key, double &value) const\n{\n\tstd::string_view str;\n\tif (!this->tryGetValue(key, str))\n\t{\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\ttry\n\t\t{\n\t\t\tsize_t index = 0;\n\t\t\tvalue = std::stod(std::string(str), &index);\n\t\t\treturn index == str.size();\n\t\t}\n\t\tcatch (std::exception)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nbool KeyValueFile::Section::tryGetString(const std::string &key, std::string_view &value) const\n{\n\treturn this->tryGetValue(key, value);\n}\n\nvoid KeyValueFile::Section::add(std::string &&key, std::string &&value)\n{\n\tthis->pairs.push_back(std::make_pair(std::move(key), std::move(value)));\n\tstd::sort(this->pairs.begin(), this->pairs.end(),\n\t\t[](const auto &pairA, const auto &pairB)\n\t{\n\t\tconst std::string &strA = pairA.first;\n\t\tconst std::string &strB = pairB.first;\n\t\treturn strA < strB;\n\t});\n}\n\nvoid KeyValueFile::Section::clear()\n{\n\tthis->pairs.clear();\n}\n\nconst char KeyValueFile::COMMENT = '#';\nconst char KeyValueFile::PAIR_SEPARATOR = '=';\nconst char KeyValueFile::SECTION_FRONT = '[';\nconst char KeyValueFile::SECTION_BACK = ']';\n\nbool KeyValueFile::init(const char *filename)\n{\n\tif (!File::exists(filename))\n\t{\n\t\tDebugLogError(\"Could not find \\\"\" + std::string(filename) + \"\\\".\");\n\t\treturn false;\n\t}\n\n\tconst std::string text = File::readAllText(filename);\n\tstd::istringstream iss(text);\n\n\t\/\/ Check each line for a valid section or key-value pair. Start the line numbers at 1\n\t\/\/ since most users aren't programmers.\n\tstd::string line;\n\tSection *activeSection = nullptr;\n\tfor (int lineNumber = 1; std::getline(iss, line); lineNumber++)\n\t{\n\t\t\/\/ Get a filtered version of the current line so it can be parsed. If the filtered\n\t\t\/\/ string is empty, then skip to the next line.\n\t\tconst std::string_view filteredLine = [&line]()\n\t\t{\n\t\t\tstd::string_view str = line;\n\n\t\t\t\/\/ Skip empty strings.\n\t\t\tif ((str.size() == 0) || ((str.size() == 1) && (str.front() == '\\r')))\n\t\t\t{\n\t\t\t\treturn std::string_view();\n\t\t\t}\n\n\t\t\t\/\/ Remove carriage return at the end (if any).\n\t\t\tif (str.back() == '\\r')\n\t\t\t{\n\t\t\t\tstr.remove_suffix(1);\n\t\t\t}\n\n\t\t\t\/\/ Extract left-most comment (if any).\n\t\t\tconst size_t commentIndex = str.find(KeyValueFile::COMMENT);\n\t\t\tif (commentIndex == 0)\n\t\t\t{\n\t\t\t\t\/\/ Comment covers the entire line.\n\t\t\t\treturn std::string_view();\n\t\t\t}\n\t\t\telse if (commentIndex != std::string_view::npos)\n\t\t\t{\n\t\t\t\t\/\/ Comment is somewhere in the line, so only work with the left substring.\n\t\t\t\tstr = str.substr(0, commentIndex);\n\t\t\t}\n\n\t\t\t\/\/ Trim leading and trailing whitespace (i.e., in case the key has whitespace\n\t\t\t\/\/ before it, or a comment had whitespace before it).\n\t\t\treturn StringView::trimFront(StringView::trimBack(str));\n\t\t}();\n\n\t\tif (filteredLine.empty())\n\t\t{\n\t\t\t\/\/ It became an empty string after whitespace was removed.\n\t\t\tcontinue;\n\t\t}\n\t\telse if (filteredLine.size() < 3)\n\t\t{\n\t\t\t\/\/ Not long enough to be a section or key-value pair.\n\t\t\tDebugLogError(\"Syntax error \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ See if it's a section line or key-value pair line.\n\t\tconst size_t sectionFrontIndex = filteredLine.find(KeyValueFile::SECTION_FRONT);\n\t\tif (sectionFrontIndex != std::string_view::npos)\n\t\t{\n\t\t\t\/\/ Section line. There must be a closing character with enough space between it\n\t\t\t\/\/ and the front character for at least one section character.\n\t\t\tconst size_t sectionBackIndex = filteredLine.find(\n\t\t\t\tKeyValueFile::SECTION_BACK, sectionFrontIndex);\n\n\t\t\tif ((sectionBackIndex != std::string_view::npos) &&\n\t\t\t\t(sectionBackIndex > (sectionFrontIndex + 1)))\n\t\t\t{\n\t\t\t\t\/\/ Get the string that's between the section characters and trim any\n\t\t\t\t\/\/ leading or trailing whitespace.\n\t\t\t\tstd::string_view sectionName = filteredLine.substr(\n\t\t\t\t\tsectionFrontIndex + 1, sectionBackIndex - sectionFrontIndex - 1);\n\t\t\t\tsectionName = StringView::trimFront(StringView::trimBack(sectionName));\n\n\t\t\t\tconst auto sectionIter = std::find_if(this->sections.begin(), this->sections.end(),\n\t\t\t\t\t[&sectionName](const Section &section)\n\t\t\t\t{\n\t\t\t\t\treturn section.getName() == sectionName;\n\t\t\t\t});\n\n\t\t\t\t\/\/ If the section is new, add it to the section maps.\n\t\t\t\tif (sectionIter == this->sections.end())\n\t\t\t\t{\n\t\t\t\t\tSection section;\n\t\t\t\t\tsection.init(std::string(sectionName));\n\t\t\t\t\tthis->sections.push_back(std::move(section));\n\t\t\t\t\tactiveSection = &this->sections.back();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tDebugLogError(\"Section \\\"\" + std::string(sectionName) + \"\\\" (line \" +\n\t\t\t\t\t\tstd::to_string(lineNumber) + \") already defined in \" + filename + \".\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tDebugLogError(\"Invalid section \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse if (filteredLine.find(KeyValueFile::PAIR_SEPARATOR) != std::string::npos)\n\t\t{\n\t\t\t\/\/ Key-value pair line. There must be two tokens: key and value.\n\t\t\tstd::array<std::string_view, 2> tokens;\n\t\t\tif (!StringView::splitExpected(filteredLine, KeyValueFile::PAIR_SEPARATOR, tokens))\n\t\t\t{\n\t\t\t\tDebugLogError(\"Invalid pair \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ Trim whitespace from the key and leading whitespace from the value.\n\t\t\tconst std::string_view key = StringView::trimFront(StringView::trimBack(tokens[0]));\n\t\t\tconst std::string_view value = StringView::trimFront(tokens[1]);\n\n\t\t\tif (key.size() == 0)\n\t\t\t{\n\t\t\t\tDebugLogError(\"Empty key in \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ Add the key-value pair to the active section map.\n\t\t\tif (activeSection != nullptr)\n\t\t\t{\n\t\t\t\tactiveSection->add(std::string(key), std::string(value));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ If no active section map, print a warning and ignore the current pair.\n\t\t\t\t\/\/ All key-value pairs must be in a section.\n\t\t\t\tDebugLogWarning(\"Ignoring \\\"\" + std::string(filteredLine) + \"\\\" (line \" +\n\t\t\t\t\tstd::to_string(lineNumber) + \"), no active section in \" + filename);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Filtered line is not a section or key-value pair.\n\t\t\tDebugLogError(\"Invalid line \\\"\" + line + \"\\\" (line \" +\n\t\t\t\tstd::to_string(lineNumber) + \") in \" + filename + \".\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/\/ Sort for binary search.\n\tstd::sort(this->sections.begin(), this->sections.end(),\n\t\t[](const Section &sectionA, const Section &sectionB)\n\t{\n\t\treturn sectionA.getName() < sectionB.getName();\n\t});\n\n\treturn true;\n}\n\nint KeyValueFile::getSectionCount() const\n{\n\treturn static_cast<int>(this->sections.size());\n}\n\nconst KeyValueFile::Section &KeyValueFile::getSection(int index) const\n{\n\tDebugAssertIndex(this->sections, index);\n\treturn this->sections[index];\n}\n\nconst KeyValueFile::Section *KeyValueFile::getSectionByName(const std::string &name) const\n{\n\tconst auto iter = std::lower_bound(this->sections.begin(), this->sections.end(), name,\n\t\t[](const Section &section, const std::string &str)\n\t{\n\t\treturn section.getName() < str;\n\t});\n\n\treturn (iter != this->sections.end()) ? &(*iter) : nullptr;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2015-2020 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 <test\/fuzz\/fuzz.h>\n#include <test\/fuzz\/FuzzedDataProvider.h>\n\n#include <vector>\n#include <prevector.h>\n\n#include <reverse_iterator.h>\n#include <serialize.h>\n#include <streams.h>\n\nnamespace {\n\ntemplate<unsigned int N, typename T>\nclass prevector_tester {\n    typedef std::vector<T> realtype;\n    realtype real_vector;\n    realtype real_vector_alt;\n\n    typedef prevector<N, T> pretype;\n    pretype pre_vector;\n    pretype pre_vector_alt;\n\n    typedef typename pretype::size_type Size;\n\n    void test() {\n        const pretype& const_pre_vector = pre_vector;\n        assert(real_vector.size() == pre_vector.size());\n        assert(real_vector.empty() == pre_vector.empty());\n        for (Size s = 0; s < real_vector.size(); s++) {\n             assert(real_vector[s] == pre_vector[s]);\n             assert(&(pre_vector[s]) == &(pre_vector.begin()[s]));\n             assert(&(pre_vector[s]) == &*(pre_vector.begin() + s));\n             assert(&(pre_vector[s]) == &*((pre_vector.end() + s) - real_vector.size()));\n        }\n        \/\/ assert(realtype(pre_vector) == real_vector);\n        assert(pretype(real_vector.begin(), real_vector.end()) == pre_vector);\n        assert(pretype(pre_vector.begin(), pre_vector.end()) == pre_vector);\n        size_t pos = 0;\n        for (const T& v : pre_vector) {\n             assert(v == real_vector[pos]);\n             ++pos;\n        }\n        for (const T& v : reverse_iterate(pre_vector)) {\n             --pos;\n             assert(v == real_vector[pos]);\n        }\n        for (const T& v : const_pre_vector) {\n             assert(v == real_vector[pos]);\n             ++pos;\n        }\n        for (const T& v : reverse_iterate(const_pre_vector)) {\n             --pos;\n             assert(v == real_vector[pos]);\n        }\n        CDataStream ss1(SER_DISK, 0);\n        CDataStream ss2(SER_DISK, 0);\n        ss1 << real_vector;\n        ss2 << pre_vector;\n        assert(ss1.size() == ss2.size());\n        for (Size s = 0; s < ss1.size(); s++) {\n            assert(ss1[s] == ss2[s]);\n        }\n    }\n\npublic:\n    void resize(Size s) {\n        real_vector.resize(s);\n        assert(real_vector.size() == s);\n        pre_vector.resize(s);\n        assert(pre_vector.size() == s);\n        test();\n    }\n\n    void reserve(Size s) {\n        real_vector.reserve(s);\n        assert(real_vector.capacity() >= s);\n        pre_vector.reserve(s);\n        assert(pre_vector.capacity() >= s);\n        test();\n    }\n\n    void insert(Size position, const T& value) {\n        real_vector.insert(real_vector.begin() + position, value);\n        pre_vector.insert(pre_vector.begin() + position, value);\n        test();\n    }\n\n    void insert(Size position, Size count, const T& value) {\n        real_vector.insert(real_vector.begin() + position, count, value);\n        pre_vector.insert(pre_vector.begin() + position, count, value);\n        test();\n    }\n\n    template<typename I>\n    void insert_range(Size position, I first, I last) {\n        real_vector.insert(real_vector.begin() + position, first, last);\n        pre_vector.insert(pre_vector.begin() + position, first, last);\n        test();\n    }\n\n    void erase(Size position) {\n        real_vector.erase(real_vector.begin() + position);\n        pre_vector.erase(pre_vector.begin() + position);\n        test();\n    }\n\n    void erase(Size first, Size last) {\n        real_vector.erase(real_vector.begin() + first, real_vector.begin() + last);\n        pre_vector.erase(pre_vector.begin() + first, pre_vector.begin() + last);\n        test();\n    }\n\n    void update(Size pos, const T& value) {\n        real_vector[pos] = value;\n        pre_vector[pos] = value;\n        test();\n    }\n\n    void push_back(const T& value) {\n        real_vector.push_back(value);\n        pre_vector.push_back(value);\n        test();\n    }\n\n    void pop_back() {\n        real_vector.pop_back();\n        pre_vector.pop_back();\n        test();\n    }\n\n    void clear() {\n        real_vector.clear();\n        pre_vector.clear();\n    }\n\n    void assign(Size n, const T& value) {\n        real_vector.assign(n, value);\n        pre_vector.assign(n, value);\n    }\n\n    Size size() const {\n        return real_vector.size();\n    }\n\n    Size capacity() const {\n        return pre_vector.capacity();\n    }\n\n    void shrink_to_fit() {\n        pre_vector.shrink_to_fit();\n        test();\n    }\n\n    void swap() {\n        real_vector.swap(real_vector_alt);\n        pre_vector.swap(pre_vector_alt);\n        test();\n    }\n\n    void move() {\n        real_vector = std::move(real_vector_alt);\n        real_vector_alt.clear();\n        pre_vector = std::move(pre_vector_alt);\n        pre_vector_alt.clear();\n    }\n\n    void copy() {\n        real_vector = real_vector_alt;\n        pre_vector = pre_vector_alt;\n    }\n\n    void resize_uninitialized(realtype values) {\n        size_t r = values.size();\n        size_t s = real_vector.size() \/ 2;\n        if (real_vector.capacity() < s + r) {\n            real_vector.reserve(s + r);\n        }\n        real_vector.resize(s);\n        pre_vector.resize_uninitialized(s);\n        for (auto v : values) {\n            real_vector.push_back(v);\n        }\n        auto p = pre_vector.size();\n        pre_vector.resize_uninitialized(p + r);\n        for (auto v : values) {\n            pre_vector[p] = v;\n            ++p;\n        }\n        test();\n    }\n};\n\n}\n\nvoid test_one_input(const std::vector<uint8_t>& buffer)\n{\n    FuzzedDataProvider prov(buffer.data(), buffer.size());\n    prevector_tester<8, int> test;\n\n    while (prov.remaining_bytes()) {\n        switch (prov.ConsumeIntegralInRange<int>(0, 14 + 3 * (test.size() > 0))) {\n        case 0:\n            test.insert(prov.ConsumeIntegralInRange<size_t>(0, test.size()), prov.ConsumeIntegral<int>());\n            break;\n        case 15:\n            test.erase(prov.ConsumeIntegralInRange<size_t>(0, test.size() - 1));\n            break;\n        case 1:\n            test.resize(std::max(0, std::min(30, (int)test.size() + prov.ConsumeIntegralInRange<int>(0, 4) - 2)));\n            break;\n        case 2:\n            test.insert(prov.ConsumeIntegralInRange<size_t>(0, test.size()), 1 + prov.ConsumeBool(), prov.ConsumeIntegral<int>());\n            break;\n        case 3: {\n            int del = std::min<int>(test.size(), 1 + prov.ConsumeBool());\n            int beg = prov.ConsumeIntegralInRange<int>(0, test.size() - del);\n            test.erase(beg, beg + del);\n            break;\n        }\n        case 4:\n            test.push_back(prov.ConsumeIntegral<int>());\n            break;\n        case 16:\n            test.pop_back();\n            break;\n        case 5: {\n            int values[4];\n            int num = 1 + prov.ConsumeIntegralInRange<int>(0, 3);\n            for (int k = 0; k < num; ++k) {\n                values[k] = prov.ConsumeIntegral<int>();\n            }\n            test.insert_range(prov.ConsumeIntegralInRange<size_t>(0, test.size()), values, values + num);\n            break;\n        }\n        case 6: {\n            int del = std::min<int>(test.size(), 1 + prov.ConsumeIntegralInRange<int>(0, 3));\n            int beg = prov.ConsumeIntegralInRange<int>(0, test.size() - del);\n            test.erase(beg, beg + del);\n            break;\n        }\n        case 7:\n            test.reserve(prov.ConsumeIntegralInRange<size_t>(0, 32767));\n            break;\n        case 8:\n            test.shrink_to_fit();\n            break;\n        case 17:\n            test.update(prov.ConsumeIntegralInRange<size_t>(0, test.size() - 1), prov.ConsumeIntegral<int>());\n            break;\n        case 9:\n            test.clear();\n            break;\n        case 10:\n            test.assign(prov.ConsumeIntegralInRange<size_t>(0, 32767), prov.ConsumeIntegral<int>());\n            break;\n        case 11:\n            test.swap();\n            break;\n        case 12:\n            test.copy();\n            break;\n        case 13:\n            test.move();\n            break;\n        case 14: {\n            int num = 1 + prov.ConsumeIntegralInRange<int>(0, 15);\n            std::vector<int> values(num);\n            for (auto& v : values) {\n                v = prov.ConsumeIntegral<int>();\n            }\n            test.resize_uninitialized(values);\n            break;\n        }\n        }\n    }\n}\n<commit_msg>Only run sanity check once at the end<commit_after>\/\/ Copyright (c) 2015-2020 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 <test\/fuzz\/fuzz.h>\n#include <test\/fuzz\/FuzzedDataProvider.h>\n\n#include <vector>\n#include <prevector.h>\n\n#include <reverse_iterator.h>\n#include <serialize.h>\n#include <streams.h>\n\nnamespace {\n\ntemplate<unsigned int N, typename T>\nclass prevector_tester {\n    typedef std::vector<T> realtype;\n    realtype real_vector;\n    realtype real_vector_alt;\n\n    typedef prevector<N, T> pretype;\n    pretype pre_vector;\n    pretype pre_vector_alt;\n\n    typedef typename pretype::size_type Size;\n\npublic:\n    void test() const {\n        const pretype& const_pre_vector = pre_vector;\n        assert(real_vector.size() == pre_vector.size());\n        assert(real_vector.empty() == pre_vector.empty());\n        for (Size s = 0; s < real_vector.size(); s++) {\n             assert(real_vector[s] == pre_vector[s]);\n             assert(&(pre_vector[s]) == &(pre_vector.begin()[s]));\n             assert(&(pre_vector[s]) == &*(pre_vector.begin() + s));\n             assert(&(pre_vector[s]) == &*((pre_vector.end() + s) - real_vector.size()));\n        }\n        \/\/ assert(realtype(pre_vector) == real_vector);\n        assert(pretype(real_vector.begin(), real_vector.end()) == pre_vector);\n        assert(pretype(pre_vector.begin(), pre_vector.end()) == pre_vector);\n        size_t pos = 0;\n        for (const T& v : pre_vector) {\n             assert(v == real_vector[pos]);\n             ++pos;\n        }\n        for (const T& v : reverse_iterate(pre_vector)) {\n             --pos;\n             assert(v == real_vector[pos]);\n        }\n        for (const T& v : const_pre_vector) {\n             assert(v == real_vector[pos]);\n             ++pos;\n        }\n        for (const T& v : reverse_iterate(const_pre_vector)) {\n             --pos;\n             assert(v == real_vector[pos]);\n        }\n        CDataStream ss1(SER_DISK, 0);\n        CDataStream ss2(SER_DISK, 0);\n        ss1 << real_vector;\n        ss2 << pre_vector;\n        assert(ss1.size() == ss2.size());\n        for (Size s = 0; s < ss1.size(); s++) {\n            assert(ss1[s] == ss2[s]);\n        }\n    }\n\n    void resize(Size s) {\n        real_vector.resize(s);\n        assert(real_vector.size() == s);\n        pre_vector.resize(s);\n        assert(pre_vector.size() == s);\n    }\n\n    void reserve(Size s) {\n        real_vector.reserve(s);\n        assert(real_vector.capacity() >= s);\n        pre_vector.reserve(s);\n        assert(pre_vector.capacity() >= s);\n    }\n\n    void insert(Size position, const T& value) {\n        real_vector.insert(real_vector.begin() + position, value);\n        pre_vector.insert(pre_vector.begin() + position, value);\n    }\n\n    void insert(Size position, Size count, const T& value) {\n        real_vector.insert(real_vector.begin() + position, count, value);\n        pre_vector.insert(pre_vector.begin() + position, count, value);\n    }\n\n    template<typename I>\n    void insert_range(Size position, I first, I last) {\n        real_vector.insert(real_vector.begin() + position, first, last);\n        pre_vector.insert(pre_vector.begin() + position, first, last);\n    }\n\n    void erase(Size position) {\n        real_vector.erase(real_vector.begin() + position);\n        pre_vector.erase(pre_vector.begin() + position);\n    }\n\n    void erase(Size first, Size last) {\n        real_vector.erase(real_vector.begin() + first, real_vector.begin() + last);\n        pre_vector.erase(pre_vector.begin() + first, pre_vector.begin() + last);\n    }\n\n    void update(Size pos, const T& value) {\n        real_vector[pos] = value;\n        pre_vector[pos] = value;\n    }\n\n    void push_back(const T& value) {\n        real_vector.push_back(value);\n        pre_vector.push_back(value);\n    }\n\n    void pop_back() {\n        real_vector.pop_back();\n        pre_vector.pop_back();\n    }\n\n    void clear() {\n        real_vector.clear();\n        pre_vector.clear();\n    }\n\n    void assign(Size n, const T& value) {\n        real_vector.assign(n, value);\n        pre_vector.assign(n, value);\n    }\n\n    Size size() const {\n        return real_vector.size();\n    }\n\n    Size capacity() const {\n        return pre_vector.capacity();\n    }\n\n    void shrink_to_fit() {\n        pre_vector.shrink_to_fit();\n    }\n\n    void swap() {\n        real_vector.swap(real_vector_alt);\n        pre_vector.swap(pre_vector_alt);\n    }\n\n    void move() {\n        real_vector = std::move(real_vector_alt);\n        real_vector_alt.clear();\n        pre_vector = std::move(pre_vector_alt);\n        pre_vector_alt.clear();\n    }\n\n    void copy() {\n        real_vector = real_vector_alt;\n        pre_vector = pre_vector_alt;\n    }\n\n    void resize_uninitialized(realtype values) {\n        size_t r = values.size();\n        size_t s = real_vector.size() \/ 2;\n        if (real_vector.capacity() < s + r) {\n            real_vector.reserve(s + r);\n        }\n        real_vector.resize(s);\n        pre_vector.resize_uninitialized(s);\n        for (auto v : values) {\n            real_vector.push_back(v);\n        }\n        auto p = pre_vector.size();\n        pre_vector.resize_uninitialized(p + r);\n        for (auto v : values) {\n            pre_vector[p] = v;\n            ++p;\n        }\n    }\n};\n\n}\n\nvoid test_one_input(const std::vector<uint8_t>& buffer)\n{\n    FuzzedDataProvider prov(buffer.data(), buffer.size());\n    prevector_tester<8, int> test;\n\n    while (prov.remaining_bytes()) {\n        switch (prov.ConsumeIntegralInRange<int>(0, 14 + 3 * (test.size() > 0))) {\n        case 0:\n            test.insert(prov.ConsumeIntegralInRange<size_t>(0, test.size()), prov.ConsumeIntegral<int>());\n            break;\n        case 15:\n            test.erase(prov.ConsumeIntegralInRange<size_t>(0, test.size() - 1));\n            break;\n        case 1:\n            test.resize(std::max(0, std::min(30, (int)test.size() + prov.ConsumeIntegralInRange<int>(0, 4) - 2)));\n            break;\n        case 2:\n            test.insert(prov.ConsumeIntegralInRange<size_t>(0, test.size()), 1 + prov.ConsumeBool(), prov.ConsumeIntegral<int>());\n            break;\n        case 3: {\n            int del = std::min<int>(test.size(), 1 + prov.ConsumeBool());\n            int beg = prov.ConsumeIntegralInRange<int>(0, test.size() - del);\n            test.erase(beg, beg + del);\n            break;\n        }\n        case 4:\n            test.push_back(prov.ConsumeIntegral<int>());\n            break;\n        case 16:\n            test.pop_back();\n            break;\n        case 5: {\n            int values[4];\n            int num = 1 + prov.ConsumeIntegralInRange<int>(0, 3);\n            for (int k = 0; k < num; ++k) {\n                values[k] = prov.ConsumeIntegral<int>();\n            }\n            test.insert_range(prov.ConsumeIntegralInRange<size_t>(0, test.size()), values, values + num);\n            break;\n        }\n        case 6: {\n            int del = std::min<int>(test.size(), 1 + prov.ConsumeIntegralInRange<int>(0, 3));\n            int beg = prov.ConsumeIntegralInRange<int>(0, test.size() - del);\n            test.erase(beg, beg + del);\n            break;\n        }\n        case 7:\n            test.reserve(prov.ConsumeIntegralInRange<size_t>(0, 32767));\n            break;\n        case 8:\n            test.shrink_to_fit();\n            break;\n        case 17:\n            test.update(prov.ConsumeIntegralInRange<size_t>(0, test.size() - 1), prov.ConsumeIntegral<int>());\n            break;\n        case 9:\n            test.clear();\n            break;\n        case 10:\n            test.assign(prov.ConsumeIntegralInRange<size_t>(0, 32767), prov.ConsumeIntegral<int>());\n            break;\n        case 11:\n            test.swap();\n            break;\n        case 12:\n            test.copy();\n            break;\n        case 13:\n            test.move();\n            break;\n        case 14: {\n            int num = 1 + prov.ConsumeIntegralInRange<int>(0, 15);\n            std::vector<int> values(num);\n            for (auto& v : values) {\n                v = prov.ConsumeIntegral<int>();\n            }\n            test.resize_uninitialized(values);\n            break;\n        }\n        }\n    }\n\n    test.test();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011-2013 The Bitcoin 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 \"key.h\"\n#include \"keystore.h\"\n#include \"main.h\"\n#include \"script.h\"\n#include \"uint256.h\"\n\n#include <boost\/assign\/std\/vector.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nusing namespace std;\nusing namespace boost::assign;\n\ntypedef vector<unsigned char> valtype;\n\nextern uint256 SignatureHash(const CScript &scriptCode, const CTransaction& txTo, unsigned int nIn, int nHashType);\n\nBOOST_AUTO_TEST_SUITE(multisig_tests)\n\nCScript\nsign_multisig(CScript scriptPubKey, vector<CKey> keys, CTransaction transaction, int whichIn)\n{\n    uint256 hash = SignatureHash(scriptPubKey, transaction, whichIn, SIGHASH_ALL);\n\n    CScript result;\n    result << OP_0; \/\/ CHECKMULTISIG bug workaround\n    BOOST_FOREACH(const CKey &key, keys)\n    {\n        vector<unsigned char> vchSig;\n        BOOST_CHECK(key.Sign(hash, vchSig));\n        vchSig.push_back((unsigned char)SIGHASH_ALL);\n        result << vchSig;\n    }\n    return result;\n}\n\nBOOST_AUTO_TEST_CASE(multisig_verify)\n{\n    unsigned int flags = SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_STRICTENC;\n\n    CKey key[4];\n    for (int i = 0; i < 4; i++)\n        key[i].MakeNewKey(true);\n\n    CScript a_and_b;\n    a_and_b << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n\n    CScript a_or_b;\n    a_or_b << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n\n    CScript escrow;\n    escrow << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n\n    CTransaction txFrom;  \/\/ Funding transaction\n    txFrom.vout.resize(3);\n    txFrom.vout[0].scriptPubKey = a_and_b;\n    txFrom.vout[1].scriptPubKey = a_or_b;\n    txFrom.vout[2].scriptPubKey = escrow;\n\n    CTransaction txTo[3]; \/\/ Spending transaction\n    for (int i = 0; i < 3; i++)\n    {\n        txTo[i].vin.resize(1);\n        txTo[i].vout.resize(1);\n        txTo[i].vin[0].prevout.n = i;\n        txTo[i].vin[0].prevout.hash = txFrom.GetHash();\n        txTo[i].vout[0].nValue = 1;\n    }\n\n    vector<CKey> keys;\n    CScript s;\n\n    \/\/ Test a AND b:\n    keys.clear();\n    keys += key[0],key[1]; \/\/ magic operator+= from boost.assign\n    s = sign_multisig(a_and_b, keys, txTo[0], 0);\n    BOOST_CHECK(VerifyScript(s, a_and_b, txTo[0], 0, flags, 0));\n\n    for (int i = 0; i < 4; i++)\n    {\n        keys.clear();\n        keys += key[i];\n        s = sign_multisig(a_and_b, keys, txTo[0], 0);\n        BOOST_CHECK_MESSAGE(!VerifyScript(s, a_and_b, txTo[0], 0, flags, 0), strprintf(\"a&b 1: %d\", i));\n\n        keys.clear();\n        keys += key[1],key[i];\n        s = sign_multisig(a_and_b, keys, txTo[0], 0);\n        BOOST_CHECK_MESSAGE(!VerifyScript(s, a_and_b, txTo[0], 0, flags, 0), strprintf(\"a&b 2: %d\", i));\n    }\n\n    \/\/ Test a OR b:\n    for (int i = 0; i < 4; i++)\n    {\n        keys.clear();\n        keys += key[i];\n        s = sign_multisig(a_or_b, keys, txTo[1], 0);\n        if (i == 0 || i == 1)\n            BOOST_CHECK_MESSAGE(VerifyScript(s, a_or_b, txTo[1], 0, flags, 0), strprintf(\"a|b: %d\", i));\n        else\n            BOOST_CHECK_MESSAGE(!VerifyScript(s, a_or_b, txTo[1], 0, flags, 0), strprintf(\"a|b: %d\", i));\n    }\n    s.clear();\n    s << OP_0 << OP_0;\n    BOOST_CHECK(!VerifyScript(s, a_or_b, txTo[1], 0, flags, 0));\n    s.clear();\n    s << OP_0 << OP_1;\n    BOOST_CHECK(!VerifyScript(s, a_or_b, txTo[1], 0, flags, 0));\n\n\n    for (int i = 0; i < 4; i++)\n        for (int j = 0; j < 4; j++)\n        {\n            keys.clear();\n            keys += key[i],key[j];\n            s = sign_multisig(escrow, keys, txTo[2], 0);\n            if (i < j && i < 3 && j < 3)\n                BOOST_CHECK_MESSAGE(VerifyScript(s, escrow, txTo[2], 0, flags, 0), strprintf(\"escrow 1: %d %d\", i, j));\n            else\n                BOOST_CHECK_MESSAGE(!VerifyScript(s, escrow, txTo[2], 0, flags, 0), strprintf(\"escrow 2: %d %d\", i, j));\n        }\n}\n\nBOOST_AUTO_TEST_CASE(multisig_IsStandard)\n{\n    CKey key[4];\n    for (int i = 0; i < 4; i++)\n        key[i].MakeNewKey(true);\n\n    txnouttype whichType;\n\n    CScript a_and_b;\n    a_and_b << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n    BOOST_CHECK(::IsStandard(a_and_b, whichType));\n\n    CScript a_or_b;\n    a_or_b  << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n    BOOST_CHECK(::IsStandard(a_or_b, whichType));\n\n    CScript escrow;\n    escrow << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n    BOOST_CHECK(::IsStandard(escrow, whichType));\n\n    CScript one_of_four;\n    one_of_four << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << key[3].GetPubKey() << OP_4 << OP_CHECKMULTISIG;\n    BOOST_CHECK(!::IsStandard(one_of_four, whichType));\n\n    CScript malformed[6];\n    malformed[0] << OP_3 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n    malformed[1] << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n    malformed[2] << OP_0 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n    malformed[3] << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_0 << OP_CHECKMULTISIG;\n    malformed[4] << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_CHECKMULTISIG;\n    malformed[5] << OP_1 << key[0].GetPubKey() << key[1].GetPubKey();\n\n    for (int i = 0; i < 6; i++)\n        BOOST_CHECK(!::IsStandard(malformed[i], whichType));\n}\n\nBOOST_AUTO_TEST_CASE(multisig_Solver1)\n{\n    \/\/ Tests Solver() that returns lists of keys that are\n    \/\/ required to satisfy a ScriptPubKey\n    \/\/\n    \/\/ Also tests IsMine() and ExtractAddress()\n    \/\/\n    \/\/ Note: ExtractAddress for the multisignature transactions\n    \/\/ always returns false for this release, even if you have\n    \/\/ one key that would satisfy an (a|b) or 2-of-3 keys needed\n    \/\/ to spend an escrow transaction.\n    \/\/\n    CBasicKeyStore keystore, emptykeystore, partialkeystore;\n    CKey key[3];\n    CTxDestination keyaddr[3];\n    for (int i = 0; i < 3; i++)\n    {\n        key[i].MakeNewKey(true);\n        keystore.AddKey(key[i]);\n        keyaddr[i] = key[i].GetPubKey().GetID();\n    }\n    partialkeystore.AddKey(key[0]);\n\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << key[0].GetPubKey() << OP_CHECKSIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK(solutions.size() == 1);\n        CTxDestination addr;\n        BOOST_CHECK(ExtractDestination(s, addr));\n        BOOST_CHECK(addr == keyaddr[0]);\n        BOOST_CHECK(IsMine(keystore, s));\n        BOOST_CHECK(!IsMine(emptykeystore, s));\n    }\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << OP_DUP << OP_HASH160 << key[0].GetPubKey().GetID() << OP_EQUALVERIFY << OP_CHECKSIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK(solutions.size() == 1);\n        CTxDestination addr;\n        BOOST_CHECK(ExtractDestination(s, addr));\n        BOOST_CHECK(addr == keyaddr[0]);\n        BOOST_CHECK(IsMine(keystore, s));\n        BOOST_CHECK(!IsMine(emptykeystore, s));\n    }\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK_EQUAL(solutions.size(), 4U);\n        CTxDestination addr;\n        BOOST_CHECK(!ExtractDestination(s, addr));\n        BOOST_CHECK(IsMine(keystore, s));\n        BOOST_CHECK(!IsMine(emptykeystore, s));\n        BOOST_CHECK(!IsMine(partialkeystore, s));\n    }\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK_EQUAL(solutions.size(), 4U);\n        vector<CTxDestination> addrs;\n        int nRequired;\n        BOOST_CHECK(ExtractDestinations(s, whichType, addrs, nRequired));\n        BOOST_CHECK(addrs[0] == keyaddr[0]);\n        BOOST_CHECK(addrs[1] == keyaddr[1]);\n        BOOST_CHECK(nRequired == 1);\n        BOOST_CHECK(IsMine(keystore, s));\n        BOOST_CHECK(!IsMine(emptykeystore, s));\n        BOOST_CHECK(!IsMine(partialkeystore, s));\n    }\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK(solutions.size() == 5);\n    }\n}\n\nBOOST_AUTO_TEST_CASE(multisig_Sign)\n{\n    \/\/ Test SignSignature() (and therefore the version of Solver() that signs transactions)\n    CBasicKeyStore keystore;\n    CKey key[4];\n    for (int i = 0; i < 4; i++)\n    {\n        key[i].MakeNewKey(true);\n        keystore.AddKey(key[i]);\n    }\n\n    CScript a_and_b;\n    a_and_b << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n\n    CScript a_or_b;\n    a_or_b  << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n\n    CScript escrow;\n    escrow << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n\n    CTransaction txFrom;  \/\/ Funding transaction\n    txFrom.vout.resize(3);\n    txFrom.vout[0].scriptPubKey = a_and_b;\n    txFrom.vout[1].scriptPubKey = a_or_b;\n    txFrom.vout[2].scriptPubKey = escrow;\n\n    CTransaction txTo[3]; \/\/ Spending transaction\n    for (int i = 0; i < 3; i++)\n    {\n        txTo[i].vin.resize(1);\n        txTo[i].vout.resize(1);\n        txTo[i].vin[0].prevout.n = i;\n        txTo[i].vin[0].prevout.hash = txFrom.GetHash();\n        txTo[i].vout[0].nValue = 1;\n    }\n\n    for (int i = 0; i < 3; i++)\n    {\n        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], 0), strprintf(\"SignSignature %d\", i));\n    }\n}\n\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>ExtractAddress() -> ExtractDestination()<commit_after>\/\/ Copyright (c) 2011-2013 The Bitcoin 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 \"key.h\"\n#include \"keystore.h\"\n#include \"main.h\"\n#include \"script.h\"\n#include \"uint256.h\"\n\n#include <boost\/assign\/std\/vector.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nusing namespace std;\nusing namespace boost::assign;\n\ntypedef vector<unsigned char> valtype;\n\nextern uint256 SignatureHash(const CScript &scriptCode, const CTransaction& txTo, unsigned int nIn, int nHashType);\n\nBOOST_AUTO_TEST_SUITE(multisig_tests)\n\nCScript\nsign_multisig(CScript scriptPubKey, vector<CKey> keys, CTransaction transaction, int whichIn)\n{\n    uint256 hash = SignatureHash(scriptPubKey, transaction, whichIn, SIGHASH_ALL);\n\n    CScript result;\n    result << OP_0; \/\/ CHECKMULTISIG bug workaround\n    BOOST_FOREACH(const CKey &key, keys)\n    {\n        vector<unsigned char> vchSig;\n        BOOST_CHECK(key.Sign(hash, vchSig));\n        vchSig.push_back((unsigned char)SIGHASH_ALL);\n        result << vchSig;\n    }\n    return result;\n}\n\nBOOST_AUTO_TEST_CASE(multisig_verify)\n{\n    unsigned int flags = SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_STRICTENC;\n\n    CKey key[4];\n    for (int i = 0; i < 4; i++)\n        key[i].MakeNewKey(true);\n\n    CScript a_and_b;\n    a_and_b << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n\n    CScript a_or_b;\n    a_or_b << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n\n    CScript escrow;\n    escrow << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n\n    CTransaction txFrom;  \/\/ Funding transaction\n    txFrom.vout.resize(3);\n    txFrom.vout[0].scriptPubKey = a_and_b;\n    txFrom.vout[1].scriptPubKey = a_or_b;\n    txFrom.vout[2].scriptPubKey = escrow;\n\n    CTransaction txTo[3]; \/\/ Spending transaction\n    for (int i = 0; i < 3; i++)\n    {\n        txTo[i].vin.resize(1);\n        txTo[i].vout.resize(1);\n        txTo[i].vin[0].prevout.n = i;\n        txTo[i].vin[0].prevout.hash = txFrom.GetHash();\n        txTo[i].vout[0].nValue = 1;\n    }\n\n    vector<CKey> keys;\n    CScript s;\n\n    \/\/ Test a AND b:\n    keys.clear();\n    keys += key[0],key[1]; \/\/ magic operator+= from boost.assign\n    s = sign_multisig(a_and_b, keys, txTo[0], 0);\n    BOOST_CHECK(VerifyScript(s, a_and_b, txTo[0], 0, flags, 0));\n\n    for (int i = 0; i < 4; i++)\n    {\n        keys.clear();\n        keys += key[i];\n        s = sign_multisig(a_and_b, keys, txTo[0], 0);\n        BOOST_CHECK_MESSAGE(!VerifyScript(s, a_and_b, txTo[0], 0, flags, 0), strprintf(\"a&b 1: %d\", i));\n\n        keys.clear();\n        keys += key[1],key[i];\n        s = sign_multisig(a_and_b, keys, txTo[0], 0);\n        BOOST_CHECK_MESSAGE(!VerifyScript(s, a_and_b, txTo[0], 0, flags, 0), strprintf(\"a&b 2: %d\", i));\n    }\n\n    \/\/ Test a OR b:\n    for (int i = 0; i < 4; i++)\n    {\n        keys.clear();\n        keys += key[i];\n        s = sign_multisig(a_or_b, keys, txTo[1], 0);\n        if (i == 0 || i == 1)\n            BOOST_CHECK_MESSAGE(VerifyScript(s, a_or_b, txTo[1], 0, flags, 0), strprintf(\"a|b: %d\", i));\n        else\n            BOOST_CHECK_MESSAGE(!VerifyScript(s, a_or_b, txTo[1], 0, flags, 0), strprintf(\"a|b: %d\", i));\n    }\n    s.clear();\n    s << OP_0 << OP_0;\n    BOOST_CHECK(!VerifyScript(s, a_or_b, txTo[1], 0, flags, 0));\n    s.clear();\n    s << OP_0 << OP_1;\n    BOOST_CHECK(!VerifyScript(s, a_or_b, txTo[1], 0, flags, 0));\n\n\n    for (int i = 0; i < 4; i++)\n        for (int j = 0; j < 4; j++)\n        {\n            keys.clear();\n            keys += key[i],key[j];\n            s = sign_multisig(escrow, keys, txTo[2], 0);\n            if (i < j && i < 3 && j < 3)\n                BOOST_CHECK_MESSAGE(VerifyScript(s, escrow, txTo[2], 0, flags, 0), strprintf(\"escrow 1: %d %d\", i, j));\n            else\n                BOOST_CHECK_MESSAGE(!VerifyScript(s, escrow, txTo[2], 0, flags, 0), strprintf(\"escrow 2: %d %d\", i, j));\n        }\n}\n\nBOOST_AUTO_TEST_CASE(multisig_IsStandard)\n{\n    CKey key[4];\n    for (int i = 0; i < 4; i++)\n        key[i].MakeNewKey(true);\n\n    txnouttype whichType;\n\n    CScript a_and_b;\n    a_and_b << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n    BOOST_CHECK(::IsStandard(a_and_b, whichType));\n\n    CScript a_or_b;\n    a_or_b  << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n    BOOST_CHECK(::IsStandard(a_or_b, whichType));\n\n    CScript escrow;\n    escrow << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n    BOOST_CHECK(::IsStandard(escrow, whichType));\n\n    CScript one_of_four;\n    one_of_four << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << key[3].GetPubKey() << OP_4 << OP_CHECKMULTISIG;\n    BOOST_CHECK(!::IsStandard(one_of_four, whichType));\n\n    CScript malformed[6];\n    malformed[0] << OP_3 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n    malformed[1] << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n    malformed[2] << OP_0 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n    malformed[3] << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_0 << OP_CHECKMULTISIG;\n    malformed[4] << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_CHECKMULTISIG;\n    malformed[5] << OP_1 << key[0].GetPubKey() << key[1].GetPubKey();\n\n    for (int i = 0; i < 6; i++)\n        BOOST_CHECK(!::IsStandard(malformed[i], whichType));\n}\n\nBOOST_AUTO_TEST_CASE(multisig_Solver1)\n{\n    \/\/ Tests Solver() that returns lists of keys that are\n    \/\/ required to satisfy a ScriptPubKey\n    \/\/\n    \/\/ Also tests IsMine() and ExtractDestination()\n    \/\/\n    \/\/ Note: ExtractDestination for the multisignature transactions\n    \/\/ always returns false for this release, even if you have\n    \/\/ one key that would satisfy an (a|b) or 2-of-3 keys needed\n    \/\/ to spend an escrow transaction.\n    \/\/\n    CBasicKeyStore keystore, emptykeystore, partialkeystore;\n    CKey key[3];\n    CTxDestination keyaddr[3];\n    for (int i = 0; i < 3; i++)\n    {\n        key[i].MakeNewKey(true);\n        keystore.AddKey(key[i]);\n        keyaddr[i] = key[i].GetPubKey().GetID();\n    }\n    partialkeystore.AddKey(key[0]);\n\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << key[0].GetPubKey() << OP_CHECKSIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK(solutions.size() == 1);\n        CTxDestination addr;\n        BOOST_CHECK(ExtractDestination(s, addr));\n        BOOST_CHECK(addr == keyaddr[0]);\n        BOOST_CHECK(IsMine(keystore, s));\n        BOOST_CHECK(!IsMine(emptykeystore, s));\n    }\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << OP_DUP << OP_HASH160 << key[0].GetPubKey().GetID() << OP_EQUALVERIFY << OP_CHECKSIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK(solutions.size() == 1);\n        CTxDestination addr;\n        BOOST_CHECK(ExtractDestination(s, addr));\n        BOOST_CHECK(addr == keyaddr[0]);\n        BOOST_CHECK(IsMine(keystore, s));\n        BOOST_CHECK(!IsMine(emptykeystore, s));\n    }\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK_EQUAL(solutions.size(), 4U);\n        CTxDestination addr;\n        BOOST_CHECK(!ExtractDestination(s, addr));\n        BOOST_CHECK(IsMine(keystore, s));\n        BOOST_CHECK(!IsMine(emptykeystore, s));\n        BOOST_CHECK(!IsMine(partialkeystore, s));\n    }\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK_EQUAL(solutions.size(), 4U);\n        vector<CTxDestination> addrs;\n        int nRequired;\n        BOOST_CHECK(ExtractDestinations(s, whichType, addrs, nRequired));\n        BOOST_CHECK(addrs[0] == keyaddr[0]);\n        BOOST_CHECK(addrs[1] == keyaddr[1]);\n        BOOST_CHECK(nRequired == 1);\n        BOOST_CHECK(IsMine(keystore, s));\n        BOOST_CHECK(!IsMine(emptykeystore, s));\n        BOOST_CHECK(!IsMine(partialkeystore, s));\n    }\n    {\n        vector<valtype> solutions;\n        txnouttype whichType;\n        CScript s;\n        s << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n        BOOST_CHECK(Solver(s, whichType, solutions));\n        BOOST_CHECK(solutions.size() == 5);\n    }\n}\n\nBOOST_AUTO_TEST_CASE(multisig_Sign)\n{\n    \/\/ Test SignSignature() (and therefore the version of Solver() that signs transactions)\n    CBasicKeyStore keystore;\n    CKey key[4];\n    for (int i = 0; i < 4; i++)\n    {\n        key[i].MakeNewKey(true);\n        keystore.AddKey(key[i]);\n    }\n\n    CScript a_and_b;\n    a_and_b << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n\n    CScript a_or_b;\n    a_or_b  << OP_1 << key[0].GetPubKey() << key[1].GetPubKey() << OP_2 << OP_CHECKMULTISIG;\n\n    CScript escrow;\n    escrow << OP_2 << key[0].GetPubKey() << key[1].GetPubKey() << key[2].GetPubKey() << OP_3 << OP_CHECKMULTISIG;\n\n    CTransaction txFrom;  \/\/ Funding transaction\n    txFrom.vout.resize(3);\n    txFrom.vout[0].scriptPubKey = a_and_b;\n    txFrom.vout[1].scriptPubKey = a_or_b;\n    txFrom.vout[2].scriptPubKey = escrow;\n\n    CTransaction txTo[3]; \/\/ Spending transaction\n    for (int i = 0; i < 3; i++)\n    {\n        txTo[i].vin.resize(1);\n        txTo[i].vout.resize(1);\n        txTo[i].vin[0].prevout.n = i;\n        txTo[i].vin[0].prevout.hash = txFrom.GetHash();\n        txTo[i].vout[0].nValue = 1;\n    }\n\n    for (int i = 0; i < 3; i++)\n    {\n        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], 0), strprintf(\"SignSignature %d\", i));\n    }\n}\n\n\nBOOST_AUTO_TEST_SUITE_END()\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#include <map>\n\n#include <gmock\/gmock.h>\n\n#include <mesos\/executor.hpp>\n#include <mesos\/mesos.hpp>\n\n#include <process\/clock.hpp>\n#include <process\/future.hpp>\n#include <process\/http.hpp>\n#include <process\/pid.hpp>\n#include <process\/process.hpp>\n\n#include <stout\/duration.hpp>\n\n#include \"slave\/constants.hpp\"\n#include \"slave\/monitor.hpp\"\n\n#include \"tests\/utils.hpp\"\n\nusing namespace mesos;\nusing namespace mesos::internal;\nusing namespace mesos::internal::tests;\n\nusing process::Future;\n\nusing process::http::BadRequest;\nusing process::http::NotFound;\nusing process::http::OK;\nusing process::http::Response;\n\nusing std::string;\n\n\n\/\/ TODO(bmahler): Add additional tests:\n\/\/   1. Check that the data has been published to statistics.\n\/\/   2. Check that metering is occurring on subsequent resource data.\n\/\/   3. Add tests for process based isolation usage.\n\/\/   4. Add tests for cgroups based isolation usage.\nTEST(MonitorTest, WatchUnwatch)\n{\n  FrameworkID frameworkId;\n  frameworkId.set_value(\"framework\");\n\n  ExecutorID executorId;\n  executorId.set_value(\"executor\");\n\n  ExecutorInfo executorInfo;\n  executorInfo.mutable_executor_id()->CopyFrom(executorId);\n  executorInfo.mutable_framework_id()->CopyFrom(frameworkId);\n  executorInfo.set_name(\"name\");\n  executorInfo.set_source(\"source\");\n\n  ResourceStatistics statistics;\n  statistics.set_cpu_user_time(5);\n  statistics.set_cpu_system_time(1);\n  statistics.set_memory_rss(1024);\n\n  std::map<ExecutorID, Executor*> execs;\n  TestingIsolationModule isolationModule(execs);\n\n  EXPECT_CALL(isolationModule, usage(frameworkId, executorId))\n    .WillRepeatedly(Return(statistics));\n\n  \/\/ Monitor the executor.\n  slave::ResourceMonitor monitor(&isolationModule);\n  monitor.watch(\n      frameworkId,\n      executorId,\n      executorInfo,\n      slave::RESOURCE_MONITORING_INTERVAL);\n\n  process::Clock::pause();\n  process::Clock::advance(slave::RESOURCE_MONITORING_INTERVAL.secs());\n\n  \/\/ Allow the monitor to handle the usage future becoming ready.\n  sleep(1);\n\n  process::UPID upid(\"monitor\", process::ip(), process::port());\n\n  Future<Response> response = process::http::get(upid, \"usage.json\");\n\n  EXPECT_RESPONSE_STATUS_WILL_EQ(OK().status, response);\n  EXPECT_RESPONSE_HEADER_WILL_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n\n  \/\/ TODO(bmahler): Verify metering directly through statistics.\n  EXPECT_RESPONSE_BODY_WILL_EQ(\n      strings::format(\n          \"[{\"\n              \"\\\"executor_id\\\":\\\"executor\\\",\"\n              \"\\\"executor_name\\\":\\\"name\\\",\"\n              \"\\\"framework_id\\\":\\\"framework\\\",\"\n              \"\\\"resource_usage\\\":{\"\n                  \"\\\"cpu_time\\\":%g,\"\n                  \"\\\"cpu_usage\\\":%g,\"\n                  \"\\\"memory_rss\\\":%lu\"\n              \"},\"\n              \"\\\"source\\\":\\\"source\\\"\"\n          \"}]\",\n          statistics.cpu_user_time() + statistics.cpu_system_time(),\n          statistics.cpu_usage(),\n          statistics.memory_rss()).get(),\n      response);\n\n  \/\/ Ensure the monitor stops polling the isolation module.\n  monitor.unwatch(frameworkId, executorId);\n\n  process::Clock::advance(slave::RESOURCE_MONITORING_INTERVAL.secs());\n\n  response = process::http::get(upid, \"usage.json\");\n\n  EXPECT_RESPONSE_STATUS_WILL_EQ(OK().status, response);\n  EXPECT_RESPONSE_HEADER_WILL_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n  EXPECT_RESPONSE_BODY_WILL_EQ(\"[]\", response);\n}\n<commit_msg>Fixed the monitor test to spawn the isolation module.<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#include <map>\n\n#include <gmock\/gmock.h>\n\n#include <mesos\/executor.hpp>\n#include <mesos\/mesos.hpp>\n\n#include <process\/clock.hpp>\n#include <process\/future.hpp>\n#include <process\/http.hpp>\n#include <process\/pid.hpp>\n#include <process\/process.hpp>\n\n#include <stout\/duration.hpp>\n\n#include \"slave\/constants.hpp\"\n#include \"slave\/monitor.hpp\"\n\n#include \"tests\/utils.hpp\"\n\nusing namespace mesos;\nusing namespace mesos::internal;\nusing namespace mesos::internal::tests;\n\nusing process::Future;\n\nusing process::http::BadRequest;\nusing process::http::NotFound;\nusing process::http::OK;\nusing process::http::Response;\n\nusing std::string;\n\n\n\/\/ TODO(bmahler): Add additional tests:\n\/\/   1. Check that the data has been published to statistics.\n\/\/   2. Check that metering is occurring on subsequent resource data.\n\/\/   3. Add tests for process based isolation usage.\n\/\/   4. Add tests for cgroups based isolation usage.\nTEST(MonitorTest, WatchUnwatch)\n{\n  FrameworkID frameworkId;\n  frameworkId.set_value(\"framework\");\n\n  ExecutorID executorId;\n  executorId.set_value(\"executor\");\n\n  ExecutorInfo executorInfo;\n  executorInfo.mutable_executor_id()->CopyFrom(executorId);\n  executorInfo.mutable_framework_id()->CopyFrom(frameworkId);\n  executorInfo.set_name(\"name\");\n  executorInfo.set_source(\"source\");\n\n  ResourceStatistics statistics;\n  statistics.set_cpu_user_time(5);\n  statistics.set_cpu_system_time(1);\n  statistics.set_memory_rss(1024);\n\n  std::map<ExecutorID, Executor*> execs;\n  TestingIsolationModule isolationModule(execs);\n\n  process::spawn(isolationModule);\n\n  EXPECT_CALL(isolationModule, usage(frameworkId, executorId))\n    .WillRepeatedly(Return(statistics));\n\n  \/\/ Monitor the executor.\n  slave::ResourceMonitor monitor(&isolationModule);\n  monitor.watch(\n      frameworkId,\n      executorId,\n      executorInfo,\n      slave::RESOURCE_MONITORING_INTERVAL);\n\n  process::Clock::pause();\n  process::Clock::advance(slave::RESOURCE_MONITORING_INTERVAL.secs());\n\n  \/\/ Allow the monitor to handle the usage future becoming ready.\n  sleep(1);\n\n  process::UPID upid(\"monitor\", process::ip(), process::port());\n\n  Future<Response> response = process::http::get(upid, \"usage.json\");\n\n  EXPECT_RESPONSE_STATUS_WILL_EQ(OK().status, response);\n  EXPECT_RESPONSE_HEADER_WILL_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n\n  \/\/ TODO(bmahler): Verify metering directly through statistics.\n  EXPECT_RESPONSE_BODY_WILL_EQ(\n      strings::format(\n          \"[{\"\n              \"\\\"executor_id\\\":\\\"executor\\\",\"\n              \"\\\"executor_name\\\":\\\"name\\\",\"\n              \"\\\"framework_id\\\":\\\"framework\\\",\"\n              \"\\\"resource_usage\\\":{\"\n                  \"\\\"cpu_time\\\":%g,\"\n                  \"\\\"cpu_usage\\\":%g,\"\n                  \"\\\"memory_rss\\\":%lu\"\n              \"},\"\n              \"\\\"source\\\":\\\"source\\\"\"\n          \"}]\",\n          statistics.cpu_user_time() + statistics.cpu_system_time(),\n          statistics.cpu_usage(),\n          statistics.memory_rss()).get(),\n      response);\n\n  \/\/ Ensure the monitor stops polling the isolation module.\n  monitor.unwatch(frameworkId, executorId);\n\n  process::Clock::advance(slave::RESOURCE_MONITORING_INTERVAL.secs());\n\n  response = process::http::get(upid, \"usage.json\");\n\n  EXPECT_RESPONSE_STATUS_WILL_EQ(OK().status, response);\n  EXPECT_RESPONSE_HEADER_WILL_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n  EXPECT_RESPONSE_BODY_WILL_EQ(\"[]\", response);\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#include <limits>\n\n#include <mesos\/mesos.hpp>\n#include <mesos\/resources.hpp>\n\n#include <process\/future.hpp>\n#include <process\/gmock.hpp>\n#include <process\/gtest.hpp>\n#include <process\/http.hpp>\n#include <process\/pid.hpp>\n#include <process\/process.hpp>\n\n#include <stout\/nothing.hpp>\n\n#include \"slave\/monitor.hpp\"\n\nusing namespace process;\n\nusing mesos::internal::slave::ResourceMonitor;\n\nusing std::numeric_limits;\nusing std::string;\n\nnamespace mesos {\nnamespace internal {\nnamespace tests {\n\nTEST(MonitorTest, Statistics)\n{\n  FrameworkID frameworkId;\n  frameworkId.set_value(\"framework\");\n\n  ExecutorID executorId;\n  executorId.set_value(\"executor\");\n\n  ExecutorInfo executorInfo;\n  executorInfo.mutable_executor_id()->CopyFrom(executorId);\n  executorInfo.mutable_framework_id()->CopyFrom(frameworkId);\n  executorInfo.set_name(\"name\");\n  executorInfo.set_source(\"source\");\n\n  ResourceStatistics statistics;\n  statistics.set_cpus_nr_periods(100);\n  statistics.set_cpus_nr_throttled(2);\n  statistics.set_cpus_user_time_secs(4);\n  statistics.set_cpus_system_time_secs(1);\n  statistics.set_cpus_throttled_time_secs(0.5);\n  statistics.set_cpus_limit(1.0);\n  statistics.set_mem_file_bytes(0);\n  statistics.set_mem_anon_bytes(0);\n  statistics.set_mem_mapped_file_bytes(0);\n  statistics.set_mem_rss_bytes(1024);\n  statistics.set_mem_limit_bytes(2048);\n  statistics.set_timestamp(0);\n\n  ResourceMonitor monitor([=]() -> Future<ResourceUsage> {\n    Resources resources = Resources::parse(\"cpus:1;mem:2\").get();\n\n    ResourceUsage usage;\n    ResourceUsage::Executor* executor = usage.add_executors();\n    executor->mutable_executor_info()->CopyFrom(executorInfo);\n    executor->mutable_allocated()->CopyFrom(resources);\n    executor->mutable_statistics()->CopyFrom(statistics);\n\n    return usage;\n  });\n\n  UPID upid(\"monitor\", address());\n\n  Future<http::Response> response = http::get(upid, \"statistics.json\");\n  AWAIT_READY(response);\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(http::OK().status, response);\n  AWAIT_EXPECT_RESPONSE_HEADER_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n\n  \/\/ TODO(bmahler): Use JSON equality instead to avoid having to use\n  \/\/ numeric limits for double precision.\n  AWAIT_EXPECT_RESPONSE_BODY_EQ(\n      strings::format(\n          \"[{\"\n              \"\\\"executor_id\\\":\\\"executor\\\",\"\n              \"\\\"executor_name\\\":\\\"name\\\",\"\n              \"\\\"framework_id\\\":\\\"framework\\\",\"\n              \"\\\"source\\\":\\\"source\\\",\"\n              \"\\\"statistics\\\":{\"\n                  \"\\\"cpus_limit\\\":%g,\"\n                  \"\\\"cpus_nr_periods\\\":%d,\"\n                  \"\\\"cpus_nr_throttled\\\":%d,\"\n                  \"\\\"cpus_system_time_secs\\\":%g,\"\n                  \"\\\"cpus_throttled_time_secs\\\":%g,\"\n                  \"\\\"cpus_user_time_secs\\\":%g,\"\n                  \"\\\"mem_anon_bytes\\\":%lu,\"\n                  \"\\\"mem_file_bytes\\\":%lu,\"\n                  \"\\\"mem_limit_bytes\\\":%lu,\"\n                  \"\\\"mem_mapped_file_bytes\\\":%lu,\"\n                  \"\\\"mem_rss_bytes\\\":%lu,\"\n                  \"\\\"timestamp\\\":\"\n                      \"%.\" + stringify(numeric_limits<double>::digits10) + \"g\"\n              \"}\"\n          \"}]\",\n          statistics.cpus_limit(),\n          statistics.cpus_nr_periods(),\n          statistics.cpus_nr_throttled(),\n          statistics.cpus_system_time_secs(),\n          statistics.cpus_throttled_time_secs(),\n          statistics.cpus_user_time_secs(),\n          statistics.mem_anon_bytes(),\n          statistics.mem_file_bytes(),\n          statistics.mem_limit_bytes(),\n          statistics.mem_mapped_file_bytes(),\n          statistics.mem_rss_bytes(),\n          statistics.timestamp()).get(),\n      response);\n}\n\n\n\/\/ This test verifies the correct handling of the statistics.json\n\/\/ endpoint when there is no executor running.\nTEST(MonitorTest, NoExecutor)\n{\n  ResourceMonitor monitor([]() -> Future<ResourceUsage> {\n    return ResourceUsage();\n  });\n\n  UPID upid(\"monitor\", address());\n\n  Future<http::Response> response = http::get(upid, \"statistics.json\");\n  AWAIT_READY(response);\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(http::OK().status, response);\n  AWAIT_EXPECT_RESPONSE_HEADER_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n  AWAIT_EXPECT_RESPONSE_BODY_EQ(\"[]\", response);\n}\n\n\n\/\/ This test verifies the correct handling of the statistics.json\n\/\/ endpoint when statistics is missing in ResourceUsage.\nTEST(MonitorTest, MissingStatistics)\n{\n  ResourceMonitor monitor([]() -> Future<ResourceUsage> {\n    FrameworkID frameworkId;\n    frameworkId.set_value(\"framework\");\n\n    ExecutorID executorId;\n    executorId.set_value(\"executor\");\n\n    ExecutorInfo executorInfo;\n    executorInfo.mutable_executor_id()->CopyFrom(executorId);\n    executorInfo.mutable_framework_id()->CopyFrom(frameworkId);\n    executorInfo.set_name(\"name\");\n    executorInfo.set_source(\"source\");\n\n    Resources resources = Resources::parse(\"cpus:1;mem:2\").get();\n\n    ResourceUsage usage;\n    ResourceUsage::Executor* executor = usage.add_executors();\n    executor->mutable_executor_info()->CopyFrom(executorInfo);\n    executor->mutable_allocated()->CopyFrom(resources);\n\n    return usage;\n  });\n\n  UPID upid(\"monitor\", address());\n\n  Future<http::Response> response = http::get(upid, \"statistics.json\");\n  AWAIT_READY(response);\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(http::OK().status, response);\n  AWAIT_EXPECT_RESPONSE_HEADER_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n  AWAIT_EXPECT_RESPONSE_BODY_EQ(\"[]\", response);\n}\n\n} \/\/ namespace tests {\n} \/\/ namespace internal {\n} \/\/ namespace mesos {\n<commit_msg>Added a slave integration test in MonitorTest.<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#include <limits>\n#include <vector>\n\n#include <gmock\/gmock.h>\n\n#include <mesos\/mesos.hpp>\n#include <mesos\/resources.hpp>\n\n#include <process\/future.hpp>\n#include <process\/gmock.hpp>\n#include <process\/gtest.hpp>\n#include <process\/http.hpp>\n#include <process\/pid.hpp>\n#include <process\/process.hpp>\n\n#include <stout\/bytes.hpp>\n#include <stout\/json.hpp>\n#include <stout\/nothing.hpp>\n\n#include \"slave\/constants.hpp\"\n#include \"slave\/monitor.hpp\"\n\n#include \"tests\/mesos.hpp\"\n\nusing namespace process;\n\nusing mesos::internal::master::Master;\n\nusing mesos::internal::slave::ResourceMonitor;\nusing mesos::internal::slave::Slave;\n\nusing std::numeric_limits;\nusing std::string;\nusing std::vector;\n\nnamespace mesos {\nnamespace internal {\nnamespace tests {\n\nTEST(MonitorTest, Statistics)\n{\n  FrameworkID frameworkId;\n  frameworkId.set_value(\"framework\");\n\n  ExecutorID executorId;\n  executorId.set_value(\"executor\");\n\n  ExecutorInfo executorInfo;\n  executorInfo.mutable_executor_id()->CopyFrom(executorId);\n  executorInfo.mutable_framework_id()->CopyFrom(frameworkId);\n  executorInfo.set_name(\"name\");\n  executorInfo.set_source(\"source\");\n\n  ResourceStatistics statistics;\n  statistics.set_cpus_nr_periods(100);\n  statistics.set_cpus_nr_throttled(2);\n  statistics.set_cpus_user_time_secs(4);\n  statistics.set_cpus_system_time_secs(1);\n  statistics.set_cpus_throttled_time_secs(0.5);\n  statistics.set_cpus_limit(1.0);\n  statistics.set_mem_file_bytes(0);\n  statistics.set_mem_anon_bytes(0);\n  statistics.set_mem_mapped_file_bytes(0);\n  statistics.set_mem_rss_bytes(1024);\n  statistics.set_mem_limit_bytes(2048);\n  statistics.set_timestamp(0);\n\n  ResourceMonitor monitor([=]() -> Future<ResourceUsage> {\n    Resources resources = Resources::parse(\"cpus:1;mem:2\").get();\n\n    ResourceUsage usage;\n    ResourceUsage::Executor* executor = usage.add_executors();\n    executor->mutable_executor_info()->CopyFrom(executorInfo);\n    executor->mutable_allocated()->CopyFrom(resources);\n    executor->mutable_statistics()->CopyFrom(statistics);\n\n    return usage;\n  });\n\n  UPID upid(\"monitor\", process::address());\n\n  Future<http::Response> response = http::get(upid, \"statistics.json\");\n  AWAIT_READY(response);\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(http::OK().status, response);\n  AWAIT_EXPECT_RESPONSE_HEADER_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n\n  \/\/ TODO(bmahler): Use JSON equality instead to avoid having to use\n  \/\/ numeric limits for double precision.\n  AWAIT_EXPECT_RESPONSE_BODY_EQ(\n      strings::format(\n          \"[{\"\n              \"\\\"executor_id\\\":\\\"executor\\\",\"\n              \"\\\"executor_name\\\":\\\"name\\\",\"\n              \"\\\"framework_id\\\":\\\"framework\\\",\"\n              \"\\\"source\\\":\\\"source\\\",\"\n              \"\\\"statistics\\\":{\"\n                  \"\\\"cpus_limit\\\":%g,\"\n                  \"\\\"cpus_nr_periods\\\":%d,\"\n                  \"\\\"cpus_nr_throttled\\\":%d,\"\n                  \"\\\"cpus_system_time_secs\\\":%g,\"\n                  \"\\\"cpus_throttled_time_secs\\\":%g,\"\n                  \"\\\"cpus_user_time_secs\\\":%g,\"\n                  \"\\\"mem_anon_bytes\\\":%lu,\"\n                  \"\\\"mem_file_bytes\\\":%lu,\"\n                  \"\\\"mem_limit_bytes\\\":%lu,\"\n                  \"\\\"mem_mapped_file_bytes\\\":%lu,\"\n                  \"\\\"mem_rss_bytes\\\":%lu,\"\n                  \"\\\"timestamp\\\":\"\n                      \"%.\" + stringify(numeric_limits<double>::digits10) + \"g\"\n              \"}\"\n          \"}]\",\n          statistics.cpus_limit(),\n          statistics.cpus_nr_periods(),\n          statistics.cpus_nr_throttled(),\n          statistics.cpus_system_time_secs(),\n          statistics.cpus_throttled_time_secs(),\n          statistics.cpus_user_time_secs(),\n          statistics.mem_anon_bytes(),\n          statistics.mem_file_bytes(),\n          statistics.mem_limit_bytes(),\n          statistics.mem_mapped_file_bytes(),\n          statistics.mem_rss_bytes(),\n          statistics.timestamp()).get(),\n      response);\n}\n\n\n\/\/ This test verifies the correct handling of the statistics.json\n\/\/ endpoint when there is no executor running.\nTEST(MonitorTest, NoExecutor)\n{\n  ResourceMonitor monitor([]() -> Future<ResourceUsage> {\n    return ResourceUsage();\n  });\n\n  UPID upid(\"monitor\", process::address());\n\n  Future<http::Response> response = http::get(upid, \"statistics.json\");\n  AWAIT_READY(response);\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(http::OK().status, response);\n  AWAIT_EXPECT_RESPONSE_HEADER_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n  AWAIT_EXPECT_RESPONSE_BODY_EQ(\"[]\", response);\n}\n\n\n\/\/ This test verifies the correct handling of the statistics.json\n\/\/ endpoint when statistics is missing in ResourceUsage.\nTEST(MonitorTest, MissingStatistics)\n{\n  ResourceMonitor monitor([]() -> Future<ResourceUsage> {\n    FrameworkID frameworkId;\n    frameworkId.set_value(\"framework\");\n\n    ExecutorID executorId;\n    executorId.set_value(\"executor\");\n\n    ExecutorInfo executorInfo;\n    executorInfo.mutable_executor_id()->CopyFrom(executorId);\n    executorInfo.mutable_framework_id()->CopyFrom(frameworkId);\n    executorInfo.set_name(\"name\");\n    executorInfo.set_source(\"source\");\n\n    Resources resources = Resources::parse(\"cpus:1;mem:2\").get();\n\n    ResourceUsage usage;\n    ResourceUsage::Executor* executor = usage.add_executors();\n    executor->mutable_executor_info()->CopyFrom(executorInfo);\n    executor->mutable_allocated()->CopyFrom(resources);\n\n    return usage;\n  });\n\n  UPID upid(\"monitor\", process::address());\n\n  Future<http::Response> response = http::get(upid, \"statistics.json\");\n  AWAIT_READY(response);\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(http::OK().status, response);\n  AWAIT_EXPECT_RESPONSE_HEADER_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n  AWAIT_EXPECT_RESPONSE_BODY_EQ(\"[]\", response);\n}\n\n\nclass MonitorIntegrationTest : public MesosTest {};\n\n\n\/\/ This is an end-to-end test that verfies that the slave returns the\n\/\/ correct ResourceUsage based on the currently running executors, and\n\/\/ the values get from the statistics endpoint are as expected.\nTEST_F(MonitorIntegrationTest, RunningExecutor)\n{\n  Try<PID<Master>> master = StartMaster();\n  ASSERT_SOME(master);\n\n  Try<PID<Slave>> slave = StartSlave();\n  ASSERT_SOME(slave);\n\n  MockScheduler sched;\n  MesosSchedulerDriver driver(\n      &sched, DEFAULT_FRAMEWORK_INFO, master.get(), DEFAULT_CREDENTIAL);\n\n  EXPECT_CALL(sched, registered(&driver, _, _));\n\n  Future<vector<Offer>> offers;\n  EXPECT_CALL(sched, resourceOffers(&driver, _))\n    .WillOnce(FutureArg<1>(&offers))\n    .WillRepeatedly(Return());        \/\/ Ignore subsequent offers.\n\n  driver.start();\n\n  AWAIT_READY(offers);\n  EXPECT_FALSE(offers.get().empty());\n\n  const Offer& offer = offers.get()[0];\n\n  \/\/ Launch a task and wait until it is in RUNNING status.\n  TaskInfo task = createTask(\n      offer.slave_id(),\n      Resources::parse(\"cpus:1;mem:32\").get(),\n      \"sleep 1000\");\n\n  Future<TaskStatus> status;\n  EXPECT_CALL(sched, statusUpdate(&driver, _))\n    .WillOnce(FutureArg<1>(&status));\n\n  driver.launchTasks(offer.id(), {task});\n\n  AWAIT_READY(status);\n  EXPECT_EQ(task.task_id(), status.get().task_id());\n  EXPECT_EQ(TASK_RUNNING, status.get().state());\n\n  \/\/ Hit the statistics endpoint and expect the response contains the\n  \/\/ resource statistics for the running container.\n  UPID upid(\"monitor\", process::address());\n\n  Future<http::Response> response = http::get(upid, \"statistics.json\");\n  AWAIT_READY(response);\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(http::OK().status, response);\n  AWAIT_EXPECT_RESPONSE_HEADER_EQ(\n      \"application\/json\",\n      \"Content-Type\",\n      response);\n\n  \/\/ Verify that the statistics in the response contains the proper\n  \/\/ resource limits for the container.\n  Try<JSON::Value> value = JSON::parse(response.get().body);\n  ASSERT_SOME(value);\n\n  Try<JSON::Value> expected = JSON::parse(strings::format(\n      \"[{\"\n          \"\\\"statistics\\\":{\"\n              \"\\\"cpus_limit\\\":%g,\"\n              \"\\\"mem_limit_bytes\\\":%lu\"\n          \"}\"\n      \"}]\",\n      1 + slave::DEFAULT_EXECUTOR_CPUS,\n      (Megabytes(32) + slave::DEFAULT_EXECUTOR_MEM).bytes()).get());\n\n  ASSERT_SOME(expected);\n  EXPECT_TRUE(value.get().contains(expected.get()));\n\n  driver.stop();\n  driver.join();\n\n  Shutdown();\n}\n\n} \/\/ namespace tests {\n} \/\/ namespace internal {\n} \/\/ namespace mesos {\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <climits>\n#include <cstdio>\n#include <unistd.h>\n\nusing std::cout;\nusing std::cin;\nusing std::endl;\n\nvoid processinfo()\n{\n  cout << \"pid: \" << getpid()\n       << \" pgid: \" << getpgrp()\n       << \" ppid: \" << getppid() << endl;\n}\n\nvoid dummywait()\n{\n  while(getchar() == EOF) {\n      sleep(INT_MAX);\n  }\n\n  cout << \"Error: Shouldn't come here\" << endl;\n}\n\n\/\/ This program forks 2 processes in a chain. The child process exits after\n\/\/ forking its own child (the grandchild of the main). The grandchild is\n\/\/ parented by Init but is in the same group as the main process.\nint main()\n{\n  \/\/ Become session leader.\n  setsid();\n\n  pid_t pid = fork();\n\n  if (pid) {\n    \/\/cout << \"Inside Parent process: \";\n    processinfo();\n    dummywait();\n  } else {\n    \/\/cout << \"Inside Child process: \";\n    processinfo();\n\n    pid_t pid2 = fork();\n\n    if (pid2) {\n      \/\/ Kill the child process so that the tree link is broken.\n      _exit(0);\n    } else {\n      \/\/cout << \"Inside Grand Child process:\";\n      processinfo();\n      dummywait();\n    }\n  }\n\n  cout << \"Error: Shouldn't come here!!\" << endl;\n  return -1;\n}\n<commit_msg>Revert \"applying mesos-37 patch\"<commit_after>#include <iostream>\n\nusing std::cout;\nusing std::cin;\nusing std::endl;\n\nvoid processinfo()\n{\n  cout << \"pid: \" << getpid()\n       << \" pgid: \" << getpgrp()\n       << \" ppid: \" << getppid() << endl;\n}\n\nvoid dummywait()\n{\n  while(getchar() == EOF) {\n      sleep(INT_MAX);\n  }\n\n  cout << \"Error: Shouldn't come here\" << endl;\n}\n\n\/\/ This program forks 2 processes in a chain. The child process exits after\n\/\/ forking its own child (the grandchild of the main). The grandchild is\n\/\/ parented by Init but is in the same group as the main process.\nint main()\n{\n  \/\/ Become session leader.\n  setsid();\n\n  pid_t pid = fork();\n\n  if (pid) {\n    \/\/cout << \"Inside Parent process: \";\n    processinfo();\n    dummywait();\n  } else {\n    \/\/cout << \"Inside Child process: \";\n    processinfo();\n\n    pid_t pid2 = fork();\n\n    if (pid2) {\n      \/\/ Kill the child process so that the tree link is broken.\n      _exit(0);\n    } else {\n      \/\/cout << \"Inside Grand Child process:\";\n      processinfo();\n      dummywait();\n    }\n  }\n\n  cout << \"Error: Shouldn't come here!!\" << endl;\n  return -1;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"busdefwriter.h\"\n\n\n#include <fstream>\n#include \"json.hpp\"\n\n#include \"tincan\/errors.h\"\n#include \"tincan\/canframedef.h\"\n#include \"tincan\/bussignaldef.h\"\n\n\nusing json = nlohmann::json;\n\n\nvoid tin::write_can_bus_def(const tin::Can_bus_def& bus_def, std::string_view filepath)\n{\n  json j;\n  j[\"version\"] = \"0.1\";\n  j[\"format\"] = \"CAN\";\n  auto frames = json::array();\n\n  for (const auto& frame_def : bus_def.frame_defs)\n  {\n    json frame;\n    frame[\"id\"] = frame_def.id;\n    frame[\"dlc\"] = frame_def.dlc;\n    frame[\"name\"] = frame_def.name;\n    auto bus_signals = json::array();\n\n    for (const auto& signal_def : frame_def.bus_signal_defs)\n    {\n      json signal;\n      signal[\"byte_order\"] = static_cast<int>(signal_def.order);\n      signal[\"value_sign\"] = static_cast<int>(signal_def.sign);\n      signal[\"pos\"] = signal_def.pos;\n      signal[\"len\"] = signal_def.len;\n      signal[\"multiplex_switch\"] = signal_def.multiplex_switch;\n      signal[\"multiplex_value\"] = signal_def.multiplex_value;\n      signal[\"factor\"] = signal_def.factor;\n      signal[\"offset\"] = signal_def.offset;\n      signal[\"minimum\"] = signal_def.minimum;\n      signal[\"maximum\"] = signal_def.maximum;\n      \/\/signal[\"unit\"] = signal_def.unit;  \/\/ TODO: UTF-8 error\n      signal[\"name\"] = signal_def.name;\n      bus_signals.push_back(signal);\n    }\n\n    frame[\"signals\"] = bus_signals;\n    frames.push_back(frame);\n  }\n\n  j[\"frames\"] = frames;\n\n  std::ofstream fs{std::string{filepath}};\n  if (!fs.is_open())\n    throw tin::File_error{\"Could not open file\"};\n\n  fs << j.dump(2);\n}\n<commit_msg>Fix style<commit_after>#include \"busdefwriter.h\"\n\n\n#include <fstream>\n#include \"json.hpp\"\n\n#include \"tincan\/errors.h\"\n#include \"tincan\/canframedef.h\"\n#include \"tincan\/bussignaldef.h\"\n\n\nusing json = nlohmann::json;\n\n\nvoid tin::write_can_bus_def(const tin::Can_bus_def& bus_def, std::string_view filepath)\n{\n  json j;\n  j[\"version\"] = \"0.1\";\n  j[\"format\"] = \"CAN\";\n  auto frames = json::array();\n\n  for (const auto& frame_def : bus_def.frame_defs) {\n    json frame;\n    frame[\"id\"] = frame_def.id;\n    frame[\"dlc\"] = frame_def.dlc;\n    frame[\"name\"] = frame_def.name;\n    auto bus_signals = json::array();\n\n    for (const auto& signal_def : frame_def.bus_signal_defs) {\n      json signal;\n      signal[\"byte_order\"] = static_cast<int>(signal_def.order);\n      signal[\"value_sign\"] = static_cast<int>(signal_def.sign);\n      signal[\"pos\"] = signal_def.pos;\n      signal[\"len\"] = signal_def.len;\n      signal[\"multiplex_switch\"] = signal_def.multiplex_switch;\n      signal[\"multiplex_value\"] = signal_def.multiplex_value;\n      signal[\"factor\"] = signal_def.factor;\n      signal[\"offset\"] = signal_def.offset;\n      signal[\"minimum\"] = signal_def.minimum;\n      signal[\"maximum\"] = signal_def.maximum;\n      \/\/signal[\"unit\"] = signal_def.unit;  \/\/ TODO: UTF-8 error\n      signal[\"name\"] = signal_def.name;\n      bus_signals.push_back(signal);\n    }\n\n    frame[\"signals\"] = bus_signals;\n    frames.push_back(frame);\n  }\n\n  j[\"frames\"] = frames;\n\n  std::ofstream fs{std::string{filepath}};\n  if (!fs.is_open())\n    throw tin::File_error{\"Could not open file\"};\n\n  fs << j.dump(2);\n}\n<|endoftext|>"}
{"text":"<commit_before>#line 2 \"togo\/resource_types.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief Resource types.\n@ingroup types\n@ingroup resource\n*\/\n\n#pragma once\n\n#include <togo\/config.hpp>\n#include <togo\/types.hpp>\n#include <togo\/traits.hpp>\n#include <togo\/string_types.hpp>\n#include <togo\/hash.hpp>\n#include <togo\/memory_types.hpp>\n#include <togo\/collection_types.hpp>\n#include <togo\/io_types.hpp>\n#include <togo\/file_io.hpp>\n\nnamespace togo {\n\n\/**\n\t@addtogroup resource\n\t@{\n*\/\n\n\/\/\/ Resource type.\nusing ResourceType = hash32;\n\n\/\/\/ Resource name hash.\nusing ResourceNameHash = hash64;\n\n\/** @cond INTERNAL *\/\nstatic_assert(\n\tis_same<ResourceType, hash32>::value,\n\t\"changed ResourceType type breaks binary formats,\"\n\t\" hash functions, and likely other things\"\n);\nstatic_assert(\n\tis_same<ResourceNameHash, hash64>::value,\n\t\"changed ResourceNameHash type breaks binary formats,\"\n\t\" hash functions, and likely other things\"\n);\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/\/\/ Resource type hash literal.\ninline constexpr ResourceType\noperator\"\" _resource_type(\n\tchar const* const data,\n\tstd::size_t const size\n) {\n\treturn hash::calc32_ce(data, size);\n}\n\n\/\/\/ Resource name hash literal.\ninline constexpr ResourceNameHash\noperator\"\" _resource_name(\n\tchar const* const data,\n\tstd::size_t const size\n) {\n\treturn hash::calc64_ce(data, size);\n}\n\n\/\/\/ Resource types.\nenum : ResourceType {\n\t\/\/\/ Non-type.\n\tRES_TYPE_NULL = \"\"_resource_type,\n\n\t\/\/\/ gfx::RenderConfig.\n\tRES_TYPE_RENDER_CONFIG = \"render_config\"_resource_type,\n};\n\n\/\/\/ Resource path parts.\nstruct ResourcePathParts {\n\tstruct Tag {\n\t\tStringRef name{null_tag{}};\n\t\thash32 hash;\n\t};\n\n\tResourceType type_hash;\n\tResourceNameHash name_hash;\n\tStringRef type{null_tag{}};\n\tStringRef name{null_tag{}};\n\tFixedArray<Tag, 8> tags;\n};\n\n\/\/ Forward declarations\nstruct ResourcePackage;\nstruct ResourceHandler;\nstruct ResourceManager;\n\n\/**\n\t@addtogroup resource_package\n\t@{\n*\/\n\n\/\/\/ Resource package.\nstruct ResourcePackage {\n\tstruct Entry {\n\t\tResourceType type;\n\t\tu8 path_size;\n\t\tchar path[256];\n\t};\n\n\tusing EntryNode = HashMapNode<ResourceNameHash, Entry>;\n\n\thash64 _root_hash;\n\tFileReader _data_stream;\n\tHashMap<ResourceNameHash, Entry> _entries;\n\tFixedArray<char, 128> _root;\n\n\tResourcePackage() = delete;\n\tResourcePackage(ResourcePackage const&) = delete;\n\tResourcePackage(ResourcePackage&&) = delete;\n\tResourcePackage& operator=(ResourcePackage const&) = delete;\n\tResourcePackage& operator=(ResourcePackage&&) = delete;\n\n\t~ResourcePackage() = default;\n\n\tResourcePackage(\n\t\tStringRef const& root,\n\t\tAllocator& allocator\n\t);\n};\n\n\/** @} *\/ \/\/ end of doc-group resource_package\n\n\/**\n\t@addtogroup resource_handler\n\t@{\n*\/\n\n\/\/\/ Resource handler.\nstruct ResourceHandler {\n\t\/\/\/ Load a resource.\n\t\/\/\/\n\t\/\/\/ Returns pointer to resource, or nullptr on error.\n\tusing load_func_type = void* (\n\t\tvoid* \/*type_data*\/,\n\t\tResourceManager& \/*manager*\/,\n\t\tResourceNameHash \/*name_hash*\/,\n\t\tIReader& \/*stream*\/\n\t);\n\n\t\/\/\/ Unload a resource.\n\tusing unload_func_type = void (\n\t\tvoid* \/*type_data*\/,\n\t\tResourceManager& \/*manager*\/,\n\t\tResourceNameHash \/*name_hash*\/,\n\t\tvoid* \/*resource*\/\n\t);\n\n\tResourceType type;\n\tload_func_type* func_load;\n\tunload_func_type* func_unload;\n};\n\n\/** @} *\/ \/\/ end of doc-group resource_handler\n\n\/**\n\t@addtogroup resource_manager\n\t@{\n*\/\n\n\/\/\/ Resource manager.\nstruct ResourceManager {\n\tstruct BoundHandler {\n\t\tResourceHandler handler;\n\t\tvoid* type_data;\n\t};\n\n\tstruct TypedResource {\n\t\tvoid* value;\n\t\tResourceType type;\n\t};\n\n\tHashMap<ResourceType, BoundHandler> _handlers;\n\tHashMap<ResourceNameHash, TypedResource> _resources;\n\tArray<ResourcePackage*> _packages;\n\n\tResourceManager() = delete;\n\tResourceManager(ResourceManager const&) = delete;\n\tResourceManager(ResourceManager&&) = delete;\n\tResourceManager& operator=(ResourceManager const&) = delete;\n\tResourceManager& operator=(ResourceManager&&) = delete;\n\n\t~ResourceManager();\n\tResourceManager(Allocator& allocator);\n};\n\n\/** @} *\/ \/\/ end of doc-group resource_manager\n\n\/** @} *\/ \/\/ end of doc-group resource\n\n} \/\/ namespace togo\n<commit_msg>resource: added RES_NAME_NULL.<commit_after>#line 2 \"togo\/resource_types.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief Resource types.\n@ingroup types\n@ingroup resource\n*\/\n\n#pragma once\n\n#include <togo\/config.hpp>\n#include <togo\/types.hpp>\n#include <togo\/traits.hpp>\n#include <togo\/string_types.hpp>\n#include <togo\/hash.hpp>\n#include <togo\/memory_types.hpp>\n#include <togo\/collection_types.hpp>\n#include <togo\/io_types.hpp>\n#include <togo\/file_io.hpp>\n\nnamespace togo {\n\n\/**\n\t@addtogroup resource\n\t@{\n*\/\n\n\/\/\/ Resource type.\nusing ResourceType = hash32;\n\n\/\/\/ Resource name hash.\nusing ResourceNameHash = hash64;\n\n\/** @cond INTERNAL *\/\nstatic_assert(\n\tis_same<ResourceType, hash32>::value,\n\t\"changed ResourceType type breaks binary formats,\"\n\t\" hash functions, and likely other things\"\n);\nstatic_assert(\n\tis_same<ResourceNameHash, hash64>::value,\n\t\"changed ResourceNameHash type breaks binary formats,\"\n\t\" hash functions, and likely other things\"\n);\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/\/\/ Resource type hash literal.\ninline constexpr ResourceType\noperator\"\" _resource_type(\n\tchar const* const data,\n\tstd::size_t const size\n) {\n\treturn hash::calc32_ce(data, size);\n}\n\n\/\/\/ Resource name hash literal.\ninline constexpr ResourceNameHash\noperator\"\" _resource_name(\n\tchar const* const data,\n\tstd::size_t const size\n) {\n\treturn hash::calc64_ce(data, size);\n}\n\n\/\/\/ Resource types.\nenum : ResourceType {\n\t\/\/\/ Non-type.\n\tRES_TYPE_NULL = \"\"_resource_type,\n\n\t\/\/\/ gfx::RenderConfig.\n\tRES_TYPE_RENDER_CONFIG = \"render_config\"_resource_type,\n};\n\n\/\/\/ Resource names.\nenum : ResourceNameHash {\n\t\/\/\/ Null name.\n\tRES_NAME_NULL = \"\"_resource_name,\n};\n\n\/\/\/ Resource path parts.\nstruct ResourcePathParts {\n\tstruct Tag {\n\t\tStringRef name{null_tag{}};\n\t\thash32 hash;\n\t};\n\n\tResourceType type_hash;\n\tResourceNameHash name_hash;\n\tStringRef type{null_tag{}};\n\tStringRef name{null_tag{}};\n\tFixedArray<Tag, 8> tags;\n};\n\n\/\/ Forward declarations\nstruct ResourcePackage;\nstruct ResourceHandler;\nstruct ResourceManager;\n\n\/**\n\t@addtogroup resource_package\n\t@{\n*\/\n\n\/\/\/ Resource package.\nstruct ResourcePackage {\n\tstruct Entry {\n\t\tResourceType type;\n\t\tu8 path_size;\n\t\tchar path[256];\n\t};\n\n\tusing EntryNode = HashMapNode<ResourceNameHash, Entry>;\n\n\thash64 _root_hash;\n\tFileReader _data_stream;\n\tHashMap<ResourceNameHash, Entry> _entries;\n\tFixedArray<char, 128> _root;\n\n\tResourcePackage() = delete;\n\tResourcePackage(ResourcePackage const&) = delete;\n\tResourcePackage(ResourcePackage&&) = delete;\n\tResourcePackage& operator=(ResourcePackage const&) = delete;\n\tResourcePackage& operator=(ResourcePackage&&) = delete;\n\n\t~ResourcePackage() = default;\n\n\tResourcePackage(\n\t\tStringRef const& root,\n\t\tAllocator& allocator\n\t);\n};\n\n\/** @} *\/ \/\/ end of doc-group resource_package\n\n\/**\n\t@addtogroup resource_handler\n\t@{\n*\/\n\n\/\/\/ Resource handler.\nstruct ResourceHandler {\n\t\/\/\/ Load a resource.\n\t\/\/\/\n\t\/\/\/ Returns pointer to resource, or nullptr on error.\n\tusing load_func_type = void* (\n\t\tvoid* \/*type_data*\/,\n\t\tResourceManager& \/*manager*\/,\n\t\tResourceNameHash \/*name_hash*\/,\n\t\tIReader& \/*stream*\/\n\t);\n\n\t\/\/\/ Unload a resource.\n\tusing unload_func_type = void (\n\t\tvoid* \/*type_data*\/,\n\t\tResourceManager& \/*manager*\/,\n\t\tResourceNameHash \/*name_hash*\/,\n\t\tvoid* \/*resource*\/\n\t);\n\n\tResourceType type;\n\tload_func_type* func_load;\n\tunload_func_type* func_unload;\n};\n\n\/** @} *\/ \/\/ end of doc-group resource_handler\n\n\/**\n\t@addtogroup resource_manager\n\t@{\n*\/\n\n\/\/\/ Resource manager.\nstruct ResourceManager {\n\tstruct BoundHandler {\n\t\tResourceHandler handler;\n\t\tvoid* type_data;\n\t};\n\n\tstruct TypedResource {\n\t\tvoid* value;\n\t\tResourceType type;\n\t};\n\n\tHashMap<ResourceType, BoundHandler> _handlers;\n\tHashMap<ResourceNameHash, TypedResource> _resources;\n\tArray<ResourcePackage*> _packages;\n\n\tResourceManager() = delete;\n\tResourceManager(ResourceManager const&) = delete;\n\tResourceManager(ResourceManager&&) = delete;\n\tResourceManager& operator=(ResourceManager const&) = delete;\n\tResourceManager& operator=(ResourceManager&&) = delete;\n\n\t~ResourceManager();\n\tResourceManager(Allocator& allocator);\n};\n\n\/** @} *\/ \/\/ end of doc-group resource_manager\n\n\/** @} *\/ \/\/ end of doc-group resource\n\n} \/\/ namespace togo\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (c) 2003-2011 Rony Shapiro <ronys@users.sourceforge.net>.\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\/\/\/ file DboxTray.cpp\n\/\/\n\/\/ Tray-related methods of DboxMain\n\/\/-----------------------------------------------------------------------------\n\n#include \"PasswordSafe.h\"\n#include \"ThisMfcApp.h\"\n#include \"DboxMain.h\"\n#include \"RUEList.h\"\n\n#if defined(POCKET_PC)\n#include \"pocketpc\/resource.h\"\n#else\n#include <errno.h>\n#include \"resource.h\"\n#include \"resource2.h\"  \/\/ Menu, Toolbar & Accelerator resources\n#include \"resource3.h\"  \/\/ String resources\n#endif\n\n#include \"core\/pwsprefs.h\"\n#include \"core\/pwscore.h\"\n#include \"core\/PWSAuxParse.h\"\n\n#ifdef _DEBUG\n#define new DEBUG_NEW\n#undef THIS_FILE\nstatic char THIS_FILE[] = __FILE__;\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ New System Tray Commands \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#ifndef POCKET_PC\nvoid DboxMain::OnTrayLockUnLock()\n{\n  switch(app.GetSystemTrayState()) {\n    case ThisMfcApp::LOCKED:            \/\/ User clicked UnLock!\n      \/\/ This only unlocks the database - it does not restore the window\n      pws_os::Trace(L\"OnTrayLockUnLock: User clicked Unlock\\n\");\n      RestoreWindowsData(false, false);\n      TellUserAboutExpiredPasswords();\n      break;\n    case ThisMfcApp::UNLOCKED:          \/\/ User clicked Lock!\n      UpdateSystemTray(LOCKED);\n      ClearClipboardData();\n      if (!IsIconic())\n        m_vGroupDisplayState = GetGroupDisplayState();\n      if (LockDataBase())  { \/\/ save db if needed, clear data\n        ShowWindow(SW_HIDE);\n      }\n      break;\n    case ThisMfcApp::CLOSED:\n      break;\n    default:\n      ASSERT(0);\n      break;\n  }\n}\n\nvoid DboxMain::OnTrayClearRecentEntries()\n{\n  m_RUEList.ClearEntries();\n}\n\nvoid DboxMain::OnTrayCopyUsername(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYUSERNAME1) &&\n    (nID <= ID_MENUITEM_TRAYCOPYUSERNAMEMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYUSERNAME1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  const StringX cs_username = ci.GetUser();\n  SetClipboardData(cs_username);\n  UpdateLastClipboardAction(CItemData::USER);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyUsername(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayCopyPassword(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYPASSWORD1) && (nID <= ID_MENUITEM_TRAYCOPYPASSWORDMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYPASSWORD1, ci))\n    return;\n\n  if (ci.IsDependent()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  const StringX cs_password = ci.GetPassword();\n  SetClipboardData(cs_password);\n  UpdateLastClipboardAction(CItemData::PASSWORD);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyPassword(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayCopyNotes(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYNOTES1) && (nID <= ID_MENUITEM_TRAYCOPYNOTESMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYNOTES1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  SetClipboardData(ci.GetNotes());\n  UpdateLastClipboardAction(CItemData::NOTES);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyNotes(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayBrowse(UINT nID)\n{\n  ASSERT(((nID >= ID_MENUITEM_TRAYBROWSE1) && (nID <= ID_MENUITEM_TRAYBROWSEMAX)) ||\n         ((nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX)));\n\n  CItemData ci;\n  const bool bDoAutotype = (nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && \n                           (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX);\n  if (!bDoAutotype) {\n    if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYBROWSE1, ci))\n      return;\n  } else {\n    if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYBROWSEPLUS1, ci))\n      return;\n  }\n\n  if (ci.IsShortcut()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  if (!ci.IsURLEmpty()) {\n    std::vector<size_t> vactionverboffsets;\n    StringX sxAutotype = PWSAuxParse::GetAutoTypeString(ci.GetAutoType(),\n                                  ci.GetGroup(), ci.GetTitle(), \n                                  ci.GetUser(), ci.GetPassword(), \n                                  ci.GetNotes(),\n                                  vactionverboffsets);\n\n    LaunchBrowser(ci.GetURL().c_str(), sxAutotype, vactionverboffsets, bDoAutotype);\n\n    if (PWSprefs::GetInstance()->GetPref(PWSprefs::CopyPasswordWhenBrowseToURL)) {\n      SetClipboardData(ci.GetPassword());\n      UpdateLastClipboardAction(CItemData::PASSWORD);\n    } else\n      UpdateLastClipboardAction(CItemData::URL);\n  }\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayBrowse(CCmdUI *pCmdUI)\n{\n  int nID = pCmdUI->m_nID;\n\n  ASSERT(((nID >= ID_MENUITEM_TRAYBROWSE1) && (nID <= ID_MENUITEM_TRAYBROWSEMAX)) ||\n         ((nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX)));\n\n  CItemData ci;\n  const bool bDoAutotype = (nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && \n                           (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX);\n  if (!bDoAutotype) {\n    if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYBROWSE1, ci))\n      return;\n  } else {\n    if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYBROWSEPLUS1, ci))\n      return;\n  }\n\n  if (ci.IsShortcut()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  \/\/ Has it an embedded URL\n  if (ci.IsURLEmpty()) {\n    pCmdUI->Enable(FALSE);\n  } else {\n    const bool bIsEmail = ci.IsURLEmail();\n    MapMenuShortcutsIter iter;\n  if (!bIsEmail && (nID >= ID_MENUITEM_TRAYBROWSE1) && (nID <= ID_MENUITEM_TRAYBROWSEMAX))\n    iter = m_MapMenuShortcuts.find(ID_MENUITEM_BROWSEURL);\n  else if (!bIsEmail && (nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX))\n    iter = m_MapMenuShortcuts.find(ID_MENUITEM_BROWSEURLPLUS);\n  else if (bIsEmail && (nID >= ID_MENUITEM_TRAYBROWSE1) && (nID <= ID_MENUITEM_TRAYBROWSEMAX))\n    iter = m_MapMenuShortcuts.find(ID_MENUITEM_SENDEMAIL);\n    ASSERT(iter != m_MapMenuShortcuts.end());\n    CString cs_text = iter->second.name.c_str();\n    int nPos = cs_text.Find(L\"\\t\");\n    if (nPos > 0)\n      cs_text = cs_text.Left(nPos);\n    pCmdUI->SetText(cs_text);\n  }\n}\n\n\nvoid DboxMain::OnTrayCopyEmail(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYEMAIL1) &&\n    (nID <= ID_MENUITEM_TRAYCOPYEMAILMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYEMAIL1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  const StringX cs_email = ci.GetEmail();\n  SetClipboardData(cs_email);\n  UpdateLastClipboardAction(CItemData::EMAIL);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyEmail(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTraySendEmail(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYSENDEMAIL1) && (nID <= ID_MENUITEM_TRAYSENDEMAILMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYSENDEMAIL1, ci))\n      return;\n\n  if (ci.IsShortcut()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  CString cs_command;\n  if (!ci.IsEmailEmpty()) {\n    cs_command = L\"mailto:\";\n    cs_command += ci.GetEmail().c_str();\n  } else {\n    cs_command = ci.GetURL().c_str();\n  }\n\n  if (!cs_command.IsEmpty()) {\n    std::vector<size_t> vactionverboffsets;\n    LaunchBrowser(cs_command, L\"\", vactionverboffsets, false);\n    UpdateAccessTime(&ci);\n  }\n}\n\nvoid DboxMain::OnUpdateTraySendEmail(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTraySelect(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYSELECT1) && (nID <= ID_MENUITEM_TRAYSELECTMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYSELECT1, ci))\n      return;\n\n  DisplayInfo *pdi = (DisplayInfo *)ci.GetDisplayInfo();\n  if (pdi != NULL) { \/\/ could be null if RefreshViews not called,\n    \/\/ in which case we've no display to select to.\n    \/\/ An alternate solution would be to force the main window\n    \/\/ to display, along with a call to RefreshViews(), before\n    \/\/ calling GetDisplayInfo().\n    SelectEntry(pdi->list_index,TRUE);\n  }\n}\n\nvoid DboxMain::OnUpdateTraySelect(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayDeleteEntry(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYDELETE1) && (nID <= ID_MENUITEM_TRAYDELETEMAX));\n\n  m_RUEList.DeleteRUEntry(nID - ID_MENUITEM_TRAYDELETE1);\n}\n\nvoid DboxMain::OnUpdateTrayDeleteEntry(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayAutoType(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYAUTOTYPE1) && (nID <= ID_MENUITEM_TRAYAUTOTYPEMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYAUTOTYPE1, ci))\n    return;\n\n  m_bInAT = true;\n  AutoType(ci);\n  UpdateAccessTime(&ci);\n  m_bInAT = false;\n}\n\nvoid DboxMain::OnUpdateTrayAutoType(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayCopyURL(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYURL1) && (nID <= ID_MENUITEM_TRAYCOPYURLMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYURL1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  StringX cs_URL = ci.GetURL();\n  StringX::size_type ipos;\n  ipos = cs_URL.find(L\"[alt]\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n  ipos = cs_URL.find(L\"[ssh]\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n  ipos = cs_URL.find(L\"{alt}\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n\n  SetClipboardData(cs_URL);\n  UpdateLastClipboardAction(CItemData::URL);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyURL(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayRunCommand(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYRUNCMD1) && (nID <= ID_MENUITEM_TRAYRUNCMDMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYRUNCMD1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    ci = *GetBaseEntry(&ci);\n  }\n\n  StringX cs_URL = ci.GetURL();\n  StringX::size_type ipos;\n  ipos = cs_URL.find(L\"[alt]\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n  ipos = cs_URL.find(L\"[ssh]\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n  ipos = cs_URL.find(L\"{alt}\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n\n  SetClipboardData(cs_URL);\n  UpdateLastClipboardAction(CItemData::URL);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayRunCommand(CCmdUI *)\n{\n}\n\n#endif \/*  POCKET_PC *\/\n<commit_msg>Add some bulletproofing to GetBaseEntry calls in systray actions<commit_after>\/*\n* Copyright (c) 2003-2011 Rony Shapiro <ronys@users.sourceforge.net>.\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\/\/\/ file DboxTray.cpp\n\/\/\n\/\/ Tray-related methods of DboxMain\n\/\/-----------------------------------------------------------------------------\n\n#include \"PasswordSafe.h\"\n#include \"ThisMfcApp.h\"\n#include \"DboxMain.h\"\n#include \"RUEList.h\"\n\n#if defined(POCKET_PC)\n#include \"pocketpc\/resource.h\"\n#else\n#include <errno.h>\n#include \"resource.h\"\n#include \"resource2.h\"  \/\/ Menu, Toolbar & Accelerator resources\n#include \"resource3.h\"  \/\/ String resources\n#endif\n\n#include \"core\/pwsprefs.h\"\n#include \"core\/pwscore.h\"\n#include \"core\/PWSAuxParse.h\"\n\n#ifdef _DEBUG\n#define new DEBUG_NEW\n#undef THIS_FILE\nstatic char THIS_FILE[] = __FILE__;\n#endif\n\nstatic bool SafeGetBaseEntry(const DboxMain *dbm, const CItemData &dep, CItemData &base)\n{\n  \/\/ Asserts in debug build if GetBase(dep) fails\n  \/\/ returns false in release build\n  const CItemData *pBase = dbm->GetBaseEntry(&dep);\n  ASSERT(pBase != NULL);\n  if (pBase != NULL) {\n    base = *pBase;\n    return true;\n  } else\n    return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ New System Tray Commands \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#ifndef POCKET_PC\nvoid DboxMain::OnTrayLockUnLock()\n{\n  switch(app.GetSystemTrayState()) {\n    case ThisMfcApp::LOCKED:            \/\/ User clicked UnLock!\n      \/\/ This only unlocks the database - it does not restore the window\n      pws_os::Trace(L\"OnTrayLockUnLock: User clicked Unlock\\n\");\n      RestoreWindowsData(false, false);\n      TellUserAboutExpiredPasswords();\n      break;\n    case ThisMfcApp::UNLOCKED:          \/\/ User clicked Lock!\n      UpdateSystemTray(LOCKED);\n      ClearClipboardData();\n      if (!IsIconic())\n        m_vGroupDisplayState = GetGroupDisplayState();\n      if (LockDataBase())  { \/\/ save db if needed, clear data\n        ShowWindow(SW_HIDE);\n      }\n      break;\n    case ThisMfcApp::CLOSED:\n      break;\n    default:\n      ASSERT(0);\n      break;\n  }\n}\n\nvoid DboxMain::OnTrayClearRecentEntries()\n{\n  m_RUEList.ClearEntries();\n}\n\nvoid DboxMain::OnTrayCopyUsername(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYUSERNAME1) &&\n    (nID <= ID_MENUITEM_TRAYCOPYUSERNAMEMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYUSERNAME1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return; \/\/ fail safely in release\n  }\n\n  const StringX cs_username = ci.GetUser();\n  SetClipboardData(cs_username);\n  UpdateLastClipboardAction(CItemData::USER);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyUsername(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayCopyPassword(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYPASSWORD1) && (nID <= ID_MENUITEM_TRAYCOPYPASSWORDMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYPASSWORD1, ci))\n    return;\n\n  if (ci.IsDependent()) {\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return; \/\/ fail safely in release\n  }\n\n  const StringX cs_password = ci.GetPassword();\n  SetClipboardData(cs_password);\n  UpdateLastClipboardAction(CItemData::PASSWORD);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyPassword(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayCopyNotes(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYNOTES1) && (nID <= ID_MENUITEM_TRAYCOPYNOTESMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYNOTES1, ci))\n    return;\n\n  if (ci.IsShortcut())\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return;\n\n  SetClipboardData(ci.GetNotes());\n  UpdateLastClipboardAction(CItemData::NOTES);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyNotes(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayBrowse(UINT nID)\n{\n  ASSERT(((nID >= ID_MENUITEM_TRAYBROWSE1) && (nID <= ID_MENUITEM_TRAYBROWSEMAX)) ||\n         ((nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX)));\n\n  CItemData ci;\n  const bool bDoAutotype = (nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && \n                           (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX);\n  if (!bDoAutotype) {\n    if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYBROWSE1, ci))\n      return;\n  } else {\n    if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYBROWSEPLUS1, ci))\n      return;\n  }\n\n  if (ci.IsShortcut()) {\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return;\n  }\n\n  if (!ci.IsURLEmpty()) {\n    std::vector<size_t> vactionverboffsets;\n    StringX sxAutotype = PWSAuxParse::GetAutoTypeString(ci.GetAutoType(),\n                                  ci.GetGroup(), ci.GetTitle(), \n                                  ci.GetUser(), ci.GetPassword(), \n                                  ci.GetNotes(),\n                                  vactionverboffsets);\n\n    LaunchBrowser(ci.GetURL().c_str(), sxAutotype, vactionverboffsets, bDoAutotype);\n\n    if (PWSprefs::GetInstance()->GetPref(PWSprefs::CopyPasswordWhenBrowseToURL)) {\n      SetClipboardData(ci.GetPassword());\n      UpdateLastClipboardAction(CItemData::PASSWORD);\n    } else\n      UpdateLastClipboardAction(CItemData::URL);\n  }\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayBrowse(CCmdUI *pCmdUI)\n{\n  int nID = pCmdUI->m_nID;\n\n  ASSERT(((nID >= ID_MENUITEM_TRAYBROWSE1) && (nID <= ID_MENUITEM_TRAYBROWSEMAX)) ||\n         ((nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX)));\n\n  CItemData ci;\n  const bool bDoAutotype = (nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && \n                           (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX);\n  if (!bDoAutotype) {\n    if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYBROWSE1, ci))\n      return;\n  } else {\n    if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYBROWSEPLUS1, ci))\n      return;\n  }\n\n  if (ci.IsShortcut()) {\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return;\n  }\n\n  \/\/ Has it an embedded URL\n  if (ci.IsURLEmpty()) {\n    pCmdUI->Enable(FALSE);\n  } else {\n    const bool bIsEmail = ci.IsURLEmail();\n    MapMenuShortcutsIter iter;\n  if (!bIsEmail && (nID >= ID_MENUITEM_TRAYBROWSE1) && (nID <= ID_MENUITEM_TRAYBROWSEMAX))\n    iter = m_MapMenuShortcuts.find(ID_MENUITEM_BROWSEURL);\n  else if (!bIsEmail && (nID >= ID_MENUITEM_TRAYBROWSEPLUS1) && (nID <= ID_MENUITEM_TRAYBROWSEPLUSMAX))\n    iter = m_MapMenuShortcuts.find(ID_MENUITEM_BROWSEURLPLUS);\n  else if (bIsEmail && (nID >= ID_MENUITEM_TRAYBROWSE1) && (nID <= ID_MENUITEM_TRAYBROWSEMAX))\n    iter = m_MapMenuShortcuts.find(ID_MENUITEM_SENDEMAIL);\n    ASSERT(iter != m_MapMenuShortcuts.end());\n    CString cs_text = iter->second.name.c_str();\n    int nPos = cs_text.Find(L\"\\t\");\n    if (nPos > 0)\n      cs_text = cs_text.Left(nPos);\n    pCmdUI->SetText(cs_text);\n  }\n}\n\n\nvoid DboxMain::OnTrayCopyEmail(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYEMAIL1) &&\n    (nID <= ID_MENUITEM_TRAYCOPYEMAILMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYEMAIL1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return; \/\/ fail safely in release\n  }\n\n  const StringX cs_email = ci.GetEmail();\n  SetClipboardData(cs_email);\n  UpdateLastClipboardAction(CItemData::EMAIL);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyEmail(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTraySendEmail(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYSENDEMAIL1) && (nID <= ID_MENUITEM_TRAYSENDEMAILMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYSENDEMAIL1, ci))\n      return;\n\n  if (ci.IsShortcut()) {\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return; \/\/ fail safely in release\n  }\n\n  CString cs_command;\n  if (!ci.IsEmailEmpty()) {\n    cs_command = L\"mailto:\";\n    cs_command += ci.GetEmail().c_str();\n  } else {\n    cs_command = ci.GetURL().c_str();\n  }\n\n  if (!cs_command.IsEmpty()) {\n    std::vector<size_t> vactionverboffsets;\n    LaunchBrowser(cs_command, L\"\", vactionverboffsets, false);\n    UpdateAccessTime(&ci);\n  }\n}\n\nvoid DboxMain::OnUpdateTraySendEmail(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTraySelect(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYSELECT1) && (nID <= ID_MENUITEM_TRAYSELECTMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYSELECT1, ci))\n      return;\n\n  DisplayInfo *pdi = (DisplayInfo *)ci.GetDisplayInfo();\n  if (pdi != NULL) { \/\/ could be null if RefreshViews not called,\n    \/\/ in which case we've no display to select to.\n    \/\/ An alternate solution would be to force the main window\n    \/\/ to display, along with a call to RefreshViews(), before\n    \/\/ calling GetDisplayInfo().\n    SelectEntry(pdi->list_index,TRUE);\n  }\n}\n\nvoid DboxMain::OnUpdateTraySelect(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayDeleteEntry(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYDELETE1) && (nID <= ID_MENUITEM_TRAYDELETEMAX));\n\n  m_RUEList.DeleteRUEntry(nID - ID_MENUITEM_TRAYDELETE1);\n}\n\nvoid DboxMain::OnUpdateTrayDeleteEntry(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayAutoType(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYAUTOTYPE1) && (nID <= ID_MENUITEM_TRAYAUTOTYPEMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYAUTOTYPE1, ci))\n    return;\n\n  m_bInAT = true;\n  AutoType(ci);\n  UpdateAccessTime(&ci);\n  m_bInAT = false;\n}\n\nvoid DboxMain::OnUpdateTrayAutoType(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayCopyURL(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYCOPYURL1) && (nID <= ID_MENUITEM_TRAYCOPYURLMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYCOPYURL1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return; \/\/ fail safely in release\n  }\n\n  StringX cs_URL = ci.GetURL();\n  StringX::size_type ipos;\n  ipos = cs_URL.find(L\"[alt]\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n  ipos = cs_URL.find(L\"[ssh]\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n  ipos = cs_URL.find(L\"{alt}\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n\n  SetClipboardData(cs_URL);\n  UpdateLastClipboardAction(CItemData::URL);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayCopyURL(CCmdUI *)\n{\n}\n\nvoid DboxMain::OnTrayRunCommand(UINT nID)\n{\n  ASSERT((nID >= ID_MENUITEM_TRAYRUNCMD1) && (nID <= ID_MENUITEM_TRAYRUNCMDMAX));\n\n  CItemData ci;\n  if (!m_RUEList.GetPWEntry(nID - ID_MENUITEM_TRAYRUNCMD1, ci))\n    return;\n\n  if (ci.IsShortcut()) {\n    if (!SafeGetBaseEntry(this, ci, ci))\n      return; \/\/ fail safely in release\n  }\n\n  StringX cs_URL = ci.GetURL();\n  StringX::size_type ipos;\n  ipos = cs_URL.find(L\"[alt]\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n  ipos = cs_URL.find(L\"[ssh]\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n  ipos = cs_URL.find(L\"{alt}\");\n  if (ipos != StringX::npos)\n    cs_URL.replace(ipos, 5, L\"\");\n\n  SetClipboardData(cs_URL);\n  UpdateLastClipboardAction(CItemData::URL);\n  UpdateAccessTime(&ci);\n}\n\nvoid DboxMain::OnUpdateTrayRunCommand(CCmdUI *)\n{\n}\n\n#endif \/*  POCKET_PC *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2015 The Bitcoin Core developers\n\/\/ Copyright (c) 2015-2018 The Bitcoin Unlimited developers\n\/\/ Copyright (c) 2016 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 \"verifydb.h\"\n\n#include \"blockstorage\/blockstorage.h\"\n#include \"init.h\"\n#include \"ui_interface.h\"\n#include \"validation.h\"\n\nCVerifyDB::CVerifyDB() { uiInterface.ShowProgress(_(\"Verifying blocks...\"), 0); }\nCVerifyDB::~CVerifyDB() { uiInterface.ShowProgress(\"\", 100); }\nbool CVerifyDB::VerifyDB(const CChainParams &chainparams, CCoinsView *coinsview, int nCheckLevel, int nCheckDepth)\n{\n    LOCK(cs_main);\n    if (chainActive.Tip() == NULL || chainActive.Tip()->pprev == NULL)\n        return true;\n\n    \/\/ Verify blocks in the best chain\n    if (nCheckDepth <= 0)\n        nCheckDepth = 1000000000; \/\/ suffices until the year 19000\n    if (nCheckDepth > chainActive.Height())\n        nCheckDepth = chainActive.Height();\n    nCheckLevel = std::max(0, std::min(4, nCheckLevel));\n    LOGA(\"Verifying last %i blocks at level %i\\n\", nCheckDepth, nCheckLevel);\n    CCoinsViewCache coins(coinsview);\n    CBlockIndex *pindexState = chainActive.Tip();\n    CBlockIndex *pindexFailure = NULL;\n    int nGoodTransactions = 0;\n    CValidationState state;\n    for (CBlockIndex *pindex = chainActive.Tip(); pindex && pindex->pprev; pindex = pindex->pprev)\n    {\n        if (shutdown_threads.load() == true)\n        {\n            return false;\n        }\n        uiInterface.ShowProgress(_(\"Verifying blocks...\"),\n            std::max(1, std::min(99, (int)(((double)(chainActive.Height() - pindex->nHeight)) \/ (double)nCheckDepth *\n                                           (nCheckLevel >= 4 ? 50 : 100)))));\n        if (pindex->nHeight < chainActive.Height() - nCheckDepth)\n            break;\n        if (fPruneMode && !(pindex->nStatus & BLOCK_HAVE_DATA))\n        {\n            \/\/ If pruning, only go back as far as we have data.\n            LOGA(\"VerifyDB(): block verification stopping at height %d (pruning, no data)\\n\", pindex->nHeight);\n            break;\n        }\n        CBlock block;\n        \/\/ check level 0: read from disk\n        if (!ReadBlockFromDisk(block, pindex, chainparams.GetConsensus()))\n            return error(\"VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s\", pindex->nHeight,\n                pindex->GetBlockHash().ToString());\n        \/\/ check level 1: verify block validity\n        if (nCheckLevel >= 1 && !CheckBlock(block, state))\n            return error(\n                \"VerifyDB(): *** found bad block at %d, hash=%s\\n\", pindex->nHeight, pindex->GetBlockHash().ToString());\n        \/\/ check level 2: verify undo validity\n        if (nCheckLevel >= 2 && pindex)\n        {\n            CBlockUndo undo;\n            CDiskBlockPos pos = pindex->GetUndoPos();\n            if (!pos.IsNull())\n            {\n                if (!ReadUndoFromDisk(undo, pos, pindex->pprev))\n                    return error(\"VerifyDB(): *** found bad undo data at %d, hash=%s\\n\", pindex->nHeight,\n                        pindex->GetBlockHash().ToString());\n            }\n        }\n        \/\/ check level 3: check for inconsistencies during memory-only disconnect of tip blocks\n        if (nCheckLevel >= 3 && pindex == pindexState &&\n            (int64_t)(coins.DynamicMemoryUsage() + pcoinsTip->DynamicMemoryUsage()) <= nCoinCacheMaxSize)\n        {\n            bool fClean = true;\n            DisconnectResult res = DisconnectBlock(block, pindex, coins);\n            if (res == DISCONNECT_FAILED)\n            {\n                return error(\"VerifyDB(): *** irrecoverable inconsistency in block data at %d, hash=%s\",\n                    pindex->nHeight, pindex->GetBlockHash().ToString());\n            }\n            pindexState = pindex->pprev;\n            if (!fClean)\n            {\n                nGoodTransactions = 0;\n                pindexFailure = pindex;\n            }\n            else\n                nGoodTransactions += block.vtx.size();\n        }\n        if (ShutdownRequested())\n            return true;\n    }\n    if (pindexFailure)\n        return error(\n            \"VerifyDB(): *** coin database inconsistencies found (last %i blocks, %i good transactions before that)\\n\",\n            chainActive.Height() - pindexFailure->nHeight + 1, nGoodTransactions);\n\n    \/\/ check level 4: try reconnecting blocks\n    if (nCheckLevel >= 4)\n    {\n        CBlockIndex *pindex = pindexState;\n        while (pindex != chainActive.Tip())\n        {\n            if (shutdown_threads.load() == true)\n            {\n                return false;\n            }\n            uiInterface.ShowProgress(_(\"Verifying blocks...\"),\n                std::max(1, std::min(99, 100 - (int)(((double)(chainActive.Height() - pindex->nHeight)) \/\n                                                     (double)nCheckDepth * 50))));\n            pindex = chainActive.Next(pindex);\n            CBlock block;\n            if (!ReadBlockFromDisk(block, pindex, chainparams.GetConsensus()))\n                return error(\"VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s\", pindex->nHeight,\n                    pindex->GetBlockHash().ToString());\n            if (!ConnectBlock(block, state, pindex, coins, chainparams))\n                return error(\"VerifyDB(): *** found unconnectable block at %d, hash=%s\", pindex->nHeight,\n                    pindex->GetBlockHash().ToString());\n        }\n    }\n\n    LOGA(\"No coin database inconsistencies in last %i blocks (%i transactions)\\n\",\n        chainActive.Height() - pindexState->nHeight, nGoodTransactions);\n\n    return true;\n}\n<commit_msg>Port core PR #10775: nCheckDepth chain height fix<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2015 The Bitcoin Core developers\n\/\/ Copyright (c) 2015-2018 The Bitcoin Unlimited developers\n\/\/ Copyright (c) 2016 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 \"verifydb.h\"\n\n#include \"blockstorage\/blockstorage.h\"\n#include \"init.h\"\n#include \"ui_interface.h\"\n#include \"validation.h\"\n\nCVerifyDB::CVerifyDB() { uiInterface.ShowProgress(_(\"Verifying blocks...\"), 0); }\nCVerifyDB::~CVerifyDB() { uiInterface.ShowProgress(\"\", 100); }\nbool CVerifyDB::VerifyDB(const CChainParams &chainparams, CCoinsView *coinsview, int nCheckLevel, int nCheckDepth)\n{\n    LOCK(cs_main);\n    if (chainActive.Tip() == NULL || chainActive.Tip()->pprev == NULL)\n        return true;\n\n    \/\/ Verify blocks in the best chain\n    if (nCheckDepth <= 0 || nCheckDepth > chainActive.Height())\n    {\n        nCheckDepth = chainActive.Height();\n    }\n    nCheckLevel = std::max(0, std::min(4, nCheckLevel));\n    LOGA(\"Verifying last %i blocks at level %i\\n\", nCheckDepth, nCheckLevel);\n    CCoinsViewCache coins(coinsview);\n    CBlockIndex *pindexState = chainActive.Tip();\n    CBlockIndex *pindexFailure = NULL;\n    int nGoodTransactions = 0;\n    CValidationState state;\n    for (CBlockIndex *pindex = chainActive.Tip(); pindex && pindex->pprev; pindex = pindex->pprev)\n    {\n        if (shutdown_threads.load() == true)\n        {\n            return false;\n        }\n        uiInterface.ShowProgress(_(\"Verifying blocks...\"),\n            std::max(1, std::min(99, (int)(((double)(chainActive.Height() - pindex->nHeight)) \/ (double)nCheckDepth *\n                                           (nCheckLevel >= 4 ? 50 : 100)))));\n        if (pindex->nHeight < chainActive.Height() - nCheckDepth)\n            break;\n        if (fPruneMode && !(pindex->nStatus & BLOCK_HAVE_DATA))\n        {\n            \/\/ If pruning, only go back as far as we have data.\n            LOGA(\"VerifyDB(): block verification stopping at height %d (pruning, no data)\\n\", pindex->nHeight);\n            break;\n        }\n        CBlock block;\n        \/\/ check level 0: read from disk\n        if (!ReadBlockFromDisk(block, pindex, chainparams.GetConsensus()))\n            return error(\"VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s\", pindex->nHeight,\n                pindex->GetBlockHash().ToString());\n        \/\/ check level 1: verify block validity\n        if (nCheckLevel >= 1 && !CheckBlock(block, state))\n            return error(\n                \"VerifyDB(): *** found bad block at %d, hash=%s\\n\", pindex->nHeight, pindex->GetBlockHash().ToString());\n        \/\/ check level 2: verify undo validity\n        if (nCheckLevel >= 2 && pindex)\n        {\n            CBlockUndo undo;\n            CDiskBlockPos pos = pindex->GetUndoPos();\n            if (!pos.IsNull())\n            {\n                if (!ReadUndoFromDisk(undo, pos, pindex->pprev))\n                    return error(\"VerifyDB(): *** found bad undo data at %d, hash=%s\\n\", pindex->nHeight,\n                        pindex->GetBlockHash().ToString());\n            }\n        }\n        \/\/ check level 3: check for inconsistencies during memory-only disconnect of tip blocks\n        if (nCheckLevel >= 3 && pindex == pindexState &&\n            (int64_t)(coins.DynamicMemoryUsage() + pcoinsTip->DynamicMemoryUsage()) <= nCoinCacheMaxSize)\n        {\n            bool fClean = true;\n            DisconnectResult res = DisconnectBlock(block, pindex, coins);\n            if (res == DISCONNECT_FAILED)\n            {\n                return error(\"VerifyDB(): *** irrecoverable inconsistency in block data at %d, hash=%s\",\n                    pindex->nHeight, pindex->GetBlockHash().ToString());\n            }\n            pindexState = pindex->pprev;\n            if (!fClean)\n            {\n                nGoodTransactions = 0;\n                pindexFailure = pindex;\n            }\n            else\n                nGoodTransactions += block.vtx.size();\n        }\n        if (ShutdownRequested())\n            return true;\n    }\n    if (pindexFailure)\n        return error(\n            \"VerifyDB(): *** coin database inconsistencies found (last %i blocks, %i good transactions before that)\\n\",\n            chainActive.Height() - pindexFailure->nHeight + 1, nGoodTransactions);\n\n    \/\/ check level 4: try reconnecting blocks\n    if (nCheckLevel >= 4)\n    {\n        CBlockIndex *pindex = pindexState;\n        while (pindex != chainActive.Tip())\n        {\n            if (shutdown_threads.load() == true)\n            {\n                return false;\n            }\n            uiInterface.ShowProgress(_(\"Verifying blocks...\"),\n                std::max(1, std::min(99, 100 - (int)(((double)(chainActive.Height() - pindex->nHeight)) \/\n                                                     (double)nCheckDepth * 50))));\n            pindex = chainActive.Next(pindex);\n            CBlock block;\n            if (!ReadBlockFromDisk(block, pindex, chainparams.GetConsensus()))\n                return error(\"VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s\", pindex->nHeight,\n                    pindex->GetBlockHash().ToString());\n            if (!ConnectBlock(block, state, pindex, coins, chainparams))\n                return error(\"VerifyDB(): *** found unconnectable block at %d, hash=%s\", pindex->nHeight,\n                    pindex->GetBlockHash().ToString());\n        }\n    }\n\n    LOGA(\"No coin database inconsistencies in last %i blocks (%i transactions)\\n\",\n        chainActive.Height() - pindexState->nHeight, nGoodTransactions);\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __RAPICORN_CXXAUX_HH__\n#define __RAPICORN_CXXAUX_HH__\n\n#include <rcore\/rapicornconfig.h>       \/\/ _GNU_SOURCE\n#include <stdbool.h>\n#include <stdarg.h>\n#include <stddef.h>\t\t\t\/\/ NULL\n#include <sys\/types.h>\t\t\t\/\/ uint, ssize\n#include <stdint.h>\t\t\t\/\/ uint64_t\n#include <limits.h>                     \/\/ {INT|CHAR|...}_{MIN|MAX}\n#include <float.h>                      \/\/ {FLT|DBL}_{MIN|MAX|EPSILON}\n\n\/\/ == Standard Macros ==\n#ifndef FALSE\n#  define FALSE\t\t\t\t\tfalse\n#endif\n#ifndef TRUE\n#  define TRUE\t\t\t\t\ttrue\n#endif\n#define RAPICORN_ABS(a)                       \t((a) > -(a) ? (a) : -(a))\n#define RAPICORN_MIN(a,b)                         ((a) <= (b) ? (a) : (b))\n#define RAPICORN_MAX(a,b)                         ((a) >= (b) ? (a) : (b))\n#define RAPICORN_CLAMP(v,mi,ma)                   ((v) < (mi) ? (mi) : ((v) > (ma) ? (ma) : (v)))\n#define RAPICORN_ARRAY_SIZE(array)\t\t(sizeof (array) \/ sizeof ((array)[0]))\n#undef ABS\n#define ABS                                     RAPICORN_ABS\n#undef MIN\n#define MIN                                     RAPICORN_MIN\n#undef MAX\n#define MAX                                     RAPICORN_MAX\n#undef CLAMP\n#define CLAMP                                   RAPICORN_CLAMP\n#undef ARRAY_SIZE\n#define ARRAY_SIZE\t\t\t\tRAPICORN_ARRAY_SIZE\n#undef EXTERN_C\n#ifdef\t__cplusplus\n#define EXTERN_C                                extern \"C\"\n#else\n#define EXTERN_C                                extern\n#endif\n#undef STRFUNC\n#define STRFUNC\t\t\t\t        RAPICORN_SIMPLE_FUNCTION\n#if     !defined (INT64_MAX) || !defined (INT64_MIN) || !defined (UINT64_MAX)\n#ifdef  LLONG_MAX       \/\/ some gcc versions ship limits.h that fail to define LLONG_MAX for C99\n#  define INT64_MAX     LLONG_MAX       \/\/ +9223372036854775807LL\n#  define INT64_MIN     LLONG_MIN       \/\/ -9223372036854775808LL\n#  define UINT64_MAX    ULLONG_MAX      \/\/ +18446744073709551615LLU\n#else   \/\/ !LLONG_MAX but gcc always has __LONG_LONG_MAX__\n#  define INT64_MAX     __LONG_LONG_MAX__\n#  define INT64_MIN     (-INT64_MAX - 1LL)\n#  define UINT64_MAX    (INT64_MAX * 2ULL + 1ULL)\n#endif\n#endif\n#ifndef SIZE_T_MAX\n#define SIZE_T_MAX              (~size_t (0))\n#define SSIZE_T_MAX             (ssize_t (SIZE_T_MAX \/ 2))\n#endif\n\n\/\/ == Likelyness Hinting ==\n#define\tRAPICORN__BOOL(expr)\t\t__extension__ ({ bool _rapicorn__bool; if (expr) _rapicorn__bool = 1; else _rapicorn__bool = 0; _rapicorn__bool; })\n#define\tRAPICORN_ISLIKELY(expr)\t\t__builtin_expect (RAPICORN__BOOL (expr), 1)\n#define\tRAPICORN_UNLIKELY(expr)\t\t__builtin_expect (RAPICORN__BOOL (expr), 0)\n#define\tRAPICORN_LIKELY\t\t\tRAPICORN_ISLIKELY\n\n\/\/ == Convenience Macros ==\n#ifdef  RAPICORN_CONVENIENCE\n#define\tISLIKELY\t\tRAPICORN_ISLIKELY       \/\/\/< Compiler hint that @a expression is likely to be true.\n#define\tUNLIKELY\t\tRAPICORN_UNLIKELY       \/\/\/< Compiler hint that @a expression is unlikely to be true.\n#define\tLIKELY\t\t\tRAPICORN_LIKELY         \/\/\/< Compiler hint that @a expression is likely to be true.\n#define\tSTRINGIFY               RAPICORN_CPP_STRINGIFY  \/\/\/< Produces a const char C string from the macro @a argument.\n#endif\n\/**\n * @def RAPICORN_CONVENIENCE\n * Configuration macro to enable convenience macros.\n * Defining this before inclusion of rapicorn.hh or rapicorn-core.hh enables several convenience\n * macros that are defined in the global namespace without the usual \"RAPICORN_\" prefix,\n * see e.g. critical_unless(), UNLIKELY().\n *\/\n#ifdef  RAPICORN_DOXYGEN\n#  define RAPICORN_CONVENIENCE\n#endif \/\/ RAPICORN_DOXYGEN\n\n\/\/ == Preprocessor Convenience ==\n#define RAPICORN_CPP_PASTE2_(a,b)               a ## b  \/\/ indirection required to expand macros like __LINE__\n#define RAPICORN_CPP_PASTE2(a,b)                RAPICORN_CPP_PASTE2_ (a,b)\n#define RAPICORN_CPP_STRINGIFY_(s)              #s      \/\/ indirection required to expand macros like __LINE__\n#define RAPICORN_CPP_STRINGIFY(s)               RAPICORN_CPP_STRINGIFY_ (s)\n#define RAPICORN_STATIC_ASSERT(expr)            static_assert (expr, #expr)\n\n\/\/ == GCC Attributes ==\n#if     __GNUC__ >= 4\n#define RAPICORN_PURE                           __attribute__ ((__pure__))\n#define RAPICORN_MALLOC                         __attribute__ ((__malloc__))\n#define RAPICORN_PRINTF(format_idx, arg_idx)    __attribute__ ((__format__ (__printf__, format_idx, arg_idx)))\n#define RAPICORN_SCANF(format_idx, arg_idx)     __attribute__ ((__format__ (__scanf__, format_idx, arg_idx)))\n#define RAPICORN_FORMAT(arg_idx)                __attribute__ ((__format_arg__ (arg_idx)))\n#define RAPICORN_SENTINEL                       __attribute__ ((__sentinel__))\n#define RAPICORN_NORETURN                       __attribute__ ((__noreturn__))\n#define RAPICORN_CONST                          __attribute__ ((__const__))\n#define RAPICORN_UNUSED                         __attribute__ ((__unused__))\n#define RAPICORN_NO_INSTRUMENT                  __attribute__ ((__no_instrument_function__))\n#define RAPICORN_DEPRECATED                     __attribute__ ((__deprecated__))\n#define RAPICORN_ALWAYS_INLINE\t\t\t__attribute__ ((always_inline))\n#define RAPICORN_NEVER_INLINE\t\t\t__attribute__ ((noinline))\n#define RAPICORN_CONSTRUCTOR\t\t\t__attribute__ ((constructor,used))      \/\/ gcc-3.3 also needs \"used\" to emit code\n#define RAPICORN_MAY_ALIAS                      __attribute__ ((may_alias))\n#define\tRAPICORN_SIMPLE_FUNCTION\t       (::Rapicorn::string_from_pretty_function_name (__PRETTY_FUNCTION__).c_str())\n#else   \/\/ !__GNUC__\n#define RAPICORN_PURE\n#define RAPICORN_MALLOC\n#define RAPICORN_PRINTF(format_idx, arg_idx)\n#define RAPICORN_SCANF(format_idx, arg_idx)\n#define RAPICORN_FORMAT(arg_idx)\n#define RAPICORN_SENTINEL\n#define RAPICORN_NORETURN\n#define RAPICORN_CONST\n#define RAPICORN_UNUSED\n#define RAPICORN_NO_INSTRUMENT\n#define RAPICORN_DEPRECATED\n#define RAPICORN_ALWAYS_INLINE\n#define RAPICORN_NEVER_INLINE\n#define RAPICORN_CONSTRUCTOR\n#define RAPICORN_MAY_ALIAS\n#define\tRAPICORN_SIMPLE_FUNCTION\t       (__func__)\n#error  Failed to detect a recent GCC version (>= 4)\n#endif  \/\/ !__GNUC__\n\n\/\/ == Ensure 'uint' in global namespace ==\n#if \tRAPICORN_SIZEOF_SYS_TYPESH_UINT == 0\ntypedef unsigned int\t\tuint;           \/\/ for systems that don't define uint in sys\/types.h\n#else\nRAPICORN_STATIC_ASSERT (RAPICORN_SIZEOF_SYS_TYPESH_UINT == 4);\n#endif\nRAPICORN_STATIC_ASSERT (sizeof (uint) == 4);\n\n\/\/ == Rapicorn Namespace ==\nnamespace Rapicorn {\n\n\/\/ == Provide Canonical Integer Types ==\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 unsigned long long int  uint64;         \/\/\/< A 64-bit unsigned integer, use \"%llu\" in format strings.\n\/\/ typedef uint64_t             uint64;         \/\/ int64_t \/ uint64_t are longs on AMD64 which breaks printf\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 signed long long int    int64;          \/\/\/< A 64-bit unsigned integer, use \"%lld\" in format strings.\ntypedef uint32_t                unichar;        \/\/\/< A 32-bit unsigned integer used for Unicode characters.\nRAPICORN_STATIC_ASSERT (sizeof (uint8) == 1 && sizeof (uint16) == 2 && sizeof (uint32) == 4 && sizeof (uint64) == 8);\nRAPICORN_STATIC_ASSERT (sizeof (int8)  == 1 && sizeof (int16)  == 2 && sizeof (int32)  == 4 && sizeof (int64)  == 8);\nRAPICORN_STATIC_ASSERT (sizeof (int) == 4 && sizeof (uint) == 4 && sizeof (unichar) == 4);\n\n\/\/ == File Path Handling ==\n#ifdef\tRAPICORN_OS_WIN32\n#define RAPICORN_DIR_SEPARATOR\t\t  '\\\\'\n#define RAPICORN_DIR_SEPARATOR_S\t  \"\\\\\"\n#define RAPICORN_SEARCHPATH_SEPARATOR\t  ';'\n#define RAPICORN_SEARCHPATH_SEPARATOR_S\t  \";\"\n#else   \/\/ !RAPICORN_OS_WIN32\n#define RAPICORN_DIR_SEPARATOR\t\t  '\/'\n#define RAPICORN_DIR_SEPARATOR_S\t  \"\/\"\n#define RAPICORN_SEARCHPATH_SEPARATOR\t  ':'\n#define RAPICORN_SEARCHPATH_SEPARATOR_S\t  \":\"\n#endif  \/\/ !RAPICORN_OS_WIN32\n#define\tRAPICORN_IS_DIR_SEPARATOR(c)        (RAPICORN_DIR_SEPARATOR == (c))\n#define RAPICORN_IS_SEARCHPATH_SEPARATOR(c) (RAPICORN_SEARCHPATH_SEPARATOR == (c))\n\n\/\/ == X86 Architecture ==\n#if defined __i386__ || defined __x86_64__\n#define RAPICORN_HAVE_X86_RDTSC  1\n#define RAPICORN_X86_RDTSC()     ({ Rapicorn::uint32 __l_, __h_, __s_; \\\n                                    __asm__ __volatile__ (\"rdtsc\" : \"=a\" (__l_), \"=d\" (__h_));  \\\n                                    __s_ = __l_ + (Rapicorn::uint64 (__h_) << 32); __s_; })\n#else\n#define RAPICORN_HAVE_X86_RDTSC  0\n#define RAPICORN_X86_RDTSC()    (0)\n#endif\n\n} \/\/ Rapicorn\n\n#endif \/\/ __RAPICORN_CXXAUX_HH__\n<commit_msg>RCORE: introduce RAPICORN_CLASS_NON_COPYABLE() to avoid NonCopyable derivation<commit_after>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __RAPICORN_CXXAUX_HH__\n#define __RAPICORN_CXXAUX_HH__\n\n#include <rcore\/rapicornconfig.h>       \/\/ _GNU_SOURCE\n#include <stdbool.h>\n#include <stdarg.h>\n#include <stddef.h>\t\t\t\/\/ NULL\n#include <sys\/types.h>\t\t\t\/\/ uint, ssize\n#include <stdint.h>\t\t\t\/\/ uint64_t\n#include <limits.h>                     \/\/ {INT|CHAR|...}_{MIN|MAX}\n#include <float.h>                      \/\/ {FLT|DBL}_{MIN|MAX|EPSILON}\n\n\/\/ == Standard Macros ==\n#ifndef FALSE\n#  define FALSE\t\t\t\t\tfalse\n#endif\n#ifndef TRUE\n#  define TRUE\t\t\t\t\ttrue\n#endif\n#define RAPICORN_ABS(a)                       \t((a) > -(a) ? (a) : -(a))\n#define RAPICORN_MIN(a,b)                         ((a) <= (b) ? (a) : (b))\n#define RAPICORN_MAX(a,b)                         ((a) >= (b) ? (a) : (b))\n#define RAPICORN_CLAMP(v,mi,ma)                   ((v) < (mi) ? (mi) : ((v) > (ma) ? (ma) : (v)))\n#define RAPICORN_ARRAY_SIZE(array)\t\t(sizeof (array) \/ sizeof ((array)[0]))\n#undef ABS\n#define ABS                                     RAPICORN_ABS\n#undef MIN\n#define MIN                                     RAPICORN_MIN\n#undef MAX\n#define MAX                                     RAPICORN_MAX\n#undef CLAMP\n#define CLAMP                                   RAPICORN_CLAMP\n#undef ARRAY_SIZE\n#define ARRAY_SIZE\t\t\t\tRAPICORN_ARRAY_SIZE\n#undef EXTERN_C\n#ifdef\t__cplusplus\n#define EXTERN_C                                extern \"C\"\n#else\n#define EXTERN_C                                extern\n#endif\n#undef STRFUNC\n#define STRFUNC\t\t\t\t        RAPICORN_SIMPLE_FUNCTION\n#if     !defined (INT64_MAX) || !defined (INT64_MIN) || !defined (UINT64_MAX)\n#ifdef  LLONG_MAX       \/\/ some gcc versions ship limits.h that fail to define LLONG_MAX for C99\n#  define INT64_MAX     LLONG_MAX       \/\/ +9223372036854775807LL\n#  define INT64_MIN     LLONG_MIN       \/\/ -9223372036854775808LL\n#  define UINT64_MAX    ULLONG_MAX      \/\/ +18446744073709551615LLU\n#else   \/\/ !LLONG_MAX but gcc always has __LONG_LONG_MAX__\n#  define INT64_MAX     __LONG_LONG_MAX__\n#  define INT64_MIN     (-INT64_MAX - 1LL)\n#  define UINT64_MAX    (INT64_MAX * 2ULL + 1ULL)\n#endif\n#endif\n#ifndef SIZE_T_MAX\n#define SIZE_T_MAX              (~size_t (0))\n#define SSIZE_T_MAX             (ssize_t (SIZE_T_MAX \/ 2))\n#endif\n\n\/\/ == Likelyness Hinting ==\n#define\tRAPICORN__BOOL(expr)\t\t__extension__ ({ bool _rapicorn__bool; if (expr) _rapicorn__bool = 1; else _rapicorn__bool = 0; _rapicorn__bool; })\n#define\tRAPICORN_ISLIKELY(expr)\t\t__builtin_expect (RAPICORN__BOOL (expr), 1)\n#define\tRAPICORN_UNLIKELY(expr)\t\t__builtin_expect (RAPICORN__BOOL (expr), 0)\n#define\tRAPICORN_LIKELY\t\t\tRAPICORN_ISLIKELY\n\n\/\/ == Convenience Macros ==\n#ifdef  RAPICORN_CONVENIENCE\n#define\tISLIKELY\t\tRAPICORN_ISLIKELY       \/\/\/< Compiler hint that @a expression is likely to be true.\n#define\tUNLIKELY\t\tRAPICORN_UNLIKELY       \/\/\/< Compiler hint that @a expression is unlikely to be true.\n#define\tLIKELY\t\t\tRAPICORN_LIKELY         \/\/\/< Compiler hint that @a expression is likely to be true.\n#define\tSTRINGIFY               RAPICORN_CPP_STRINGIFY  \/\/\/< Produces a const char C string from the macro @a argument.\n#endif\n\/**\n * @def RAPICORN_CONVENIENCE\n * Configuration macro to enable convenience macros.\n * Defining this before inclusion of rapicorn.hh or rapicorn-core.hh enables several convenience\n * macros that are defined in the global namespace without the usual \"RAPICORN_\" prefix,\n * see e.g. critical_unless(), UNLIKELY().\n *\/\n#ifdef  RAPICORN_DOXYGEN\n#  define RAPICORN_CONVENIENCE\n#endif \/\/ RAPICORN_DOXYGEN\n\n\/\/ == Preprocessor Convenience ==\n#define RAPICORN_CPP_PASTE2_(a,b)               a ## b  \/\/ indirection required to expand macros like __LINE__\n#define RAPICORN_CPP_PASTE2(a,b)                RAPICORN_CPP_PASTE2_ (a,b)\n#define RAPICORN_CPP_STRINGIFY_(s)              #s      \/\/ indirection required to expand macros like __LINE__\n#define RAPICORN_CPP_STRINGIFY(s)               RAPICORN_CPP_STRINGIFY_ (s)\n#define RAPICORN_STATIC_ASSERT(expr)            static_assert (expr, #expr)\n\n\/\/ == GCC Attributes ==\n#if     __GNUC__ >= 4\n#define RAPICORN_PURE                           __attribute__ ((__pure__))\n#define RAPICORN_MALLOC                         __attribute__ ((__malloc__))\n#define RAPICORN_PRINTF(format_idx, arg_idx)    __attribute__ ((__format__ (__printf__, format_idx, arg_idx)))\n#define RAPICORN_SCANF(format_idx, arg_idx)     __attribute__ ((__format__ (__scanf__, format_idx, arg_idx)))\n#define RAPICORN_FORMAT(arg_idx)                __attribute__ ((__format_arg__ (arg_idx)))\n#define RAPICORN_SENTINEL                       __attribute__ ((__sentinel__))\n#define RAPICORN_NORETURN                       __attribute__ ((__noreturn__))\n#define RAPICORN_CONST                          __attribute__ ((__const__))\n#define RAPICORN_UNUSED                         __attribute__ ((__unused__))\n#define RAPICORN_NO_INSTRUMENT                  __attribute__ ((__no_instrument_function__))\n#define RAPICORN_DEPRECATED                     __attribute__ ((__deprecated__))\n#define RAPICORN_ALWAYS_INLINE\t\t\t__attribute__ ((always_inline))\n#define RAPICORN_NEVER_INLINE\t\t\t__attribute__ ((noinline))\n#define RAPICORN_CONSTRUCTOR\t\t\t__attribute__ ((constructor,used))      \/\/ gcc-3.3 also needs \"used\" to emit code\n#define RAPICORN_MAY_ALIAS                      __attribute__ ((may_alias))\n#define\tRAPICORN_SIMPLE_FUNCTION\t       (::Rapicorn::string_from_pretty_function_name (__PRETTY_FUNCTION__).c_str())\n#else   \/\/ !__GNUC__\n#define RAPICORN_PURE\n#define RAPICORN_MALLOC\n#define RAPICORN_PRINTF(format_idx, arg_idx)\n#define RAPICORN_SCANF(format_idx, arg_idx)\n#define RAPICORN_FORMAT(arg_idx)\n#define RAPICORN_SENTINEL\n#define RAPICORN_NORETURN\n#define RAPICORN_CONST\n#define RAPICORN_UNUSED\n#define RAPICORN_NO_INSTRUMENT\n#define RAPICORN_DEPRECATED\n#define RAPICORN_ALWAYS_INLINE\n#define RAPICORN_NEVER_INLINE\n#define RAPICORN_CONSTRUCTOR\n#define RAPICORN_MAY_ALIAS\n#define\tRAPICORN_SIMPLE_FUNCTION\t       (__func__)\n#error  Failed to detect a recent GCC version (>= 4)\n#endif  \/\/ !__GNUC__\n\n\/\/ == Ensure 'uint' in global namespace ==\n#if \tRAPICORN_SIZEOF_SYS_TYPESH_UINT == 0\ntypedef unsigned int\t\tuint;           \/\/ for systems that don't define uint in sys\/types.h\n#else\nRAPICORN_STATIC_ASSERT (RAPICORN_SIZEOF_SYS_TYPESH_UINT == 4);\n#endif\nRAPICORN_STATIC_ASSERT (sizeof (uint) == 4);\n\n\/\/ == Rapicorn Namespace ==\nnamespace Rapicorn {\n\n\/\/ == Provide Canonical Integer Types ==\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 unsigned long long int  uint64;         \/\/\/< A 64-bit unsigned integer, use \"%llu\" in format strings.\n\/\/ typedef uint64_t             uint64;         \/\/ int64_t \/ uint64_t are longs on AMD64 which breaks printf\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 signed long long int    int64;          \/\/\/< A 64-bit unsigned integer, use \"%lld\" in format strings.\ntypedef uint32_t                unichar;        \/\/\/< A 32-bit unsigned integer used for Unicode characters.\nRAPICORN_STATIC_ASSERT (sizeof (uint8) == 1 && sizeof (uint16) == 2 && sizeof (uint32) == 4 && sizeof (uint64) == 8);\nRAPICORN_STATIC_ASSERT (sizeof (int8)  == 1 && sizeof (int16)  == 2 && sizeof (int32)  == 4 && sizeof (int64)  == 8);\nRAPICORN_STATIC_ASSERT (sizeof (int) == 4 && sizeof (uint) == 4 && sizeof (unichar) == 4);\n\n\/\/ == File Path Handling ==\n#ifdef\tRAPICORN_OS_WIN32\n#define RAPICORN_DIR_SEPARATOR\t\t  '\\\\'\n#define RAPICORN_DIR_SEPARATOR_S\t  \"\\\\\"\n#define RAPICORN_SEARCHPATH_SEPARATOR\t  ';'\n#define RAPICORN_SEARCHPATH_SEPARATOR_S\t  \";\"\n#else   \/\/ !RAPICORN_OS_WIN32\n#define RAPICORN_DIR_SEPARATOR\t\t  '\/'\n#define RAPICORN_DIR_SEPARATOR_S\t  \"\/\"\n#define RAPICORN_SEARCHPATH_SEPARATOR\t  ':'\n#define RAPICORN_SEARCHPATH_SEPARATOR_S\t  \":\"\n#endif  \/\/ !RAPICORN_OS_WIN32\n#define\tRAPICORN_IS_DIR_SEPARATOR(c)        (RAPICORN_DIR_SEPARATOR == (c))\n#define RAPICORN_IS_SEARCHPATH_SEPARATOR(c) (RAPICORN_SEARCHPATH_SEPARATOR == (c))\n\n\/\/ == C++ Macros ==\n#define RAPICORN_CLASS_NON_COPYABLE(ClassName)                                  private: \\\n  \/*copy-ctor*\/ ClassName  (const ClassName&) __attribute__ ((error (\"NON_COPYABLE\"))); \\\n  ClassName&    operator=  (const ClassName&) __attribute__ ((error (\"NON_COPYABLE\")))\n\n\/\/ == X86 Architecture ==\n#if defined __i386__ || defined __x86_64__\n#define RAPICORN_HAVE_X86_RDTSC  1\n#define RAPICORN_X86_RDTSC()     ({ Rapicorn::uint32 __l_, __h_, __s_; \\\n                                    __asm__ __volatile__ (\"rdtsc\" : \"=a\" (__l_), \"=d\" (__h_));  \\\n                                    __s_ = __l_ + (Rapicorn::uint64 (__h_) << 32); __s_; })\n#else\n#define RAPICORN_HAVE_X86_RDTSC  0\n#define RAPICORN_X86_RDTSC()    (0)\n#endif\n\n} \/\/ Rapicorn\n\n#endif \/\/ __RAPICORN_CXXAUX_HH__\n<|endoftext|>"}
{"text":"<commit_before>#include \"writer\/cxx\/resource.h\"\n\n#include \"iroha\/i_design.h\"\n#include \"iroha\/logging.h\"\n#include \"iroha\/resource_class.h\"\n#include \"iroha\/resource_params.h\"\n#include \"writer\/cxx\/class_writer.h\"\n\nnamespace iroha {\nnamespace writer {\nnamespace cxx {\n\nvoid Resource::BuildResource(IResource *res, ClassWriter *cw) {\n  auto *rc = res->GetClass();\n  if (resource::IsMapped(*rc)) {\n    auto *params = res->GetParams();\n    if (params->GetMappedName() == \"mem\") {\n      IArray *array = res->GetArray();\n      if (!array->IsExternal()) {\n\tstring mem_name = MemName(res);\n\tcw->AddVariable(mem_name, \"Memory *\");\n\tClassMember *m = cw->FindConstructor();\n\tm->body_ += \"    \" + mem_name + \" = new Memory();\\n\";\n      }\n    }\n  }\n}\n\nvoid Resource::WriteInsn(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  auto *rc = res->GetClass();\n  if (resource::IsExclusiveBinOp(*rc) ||\n      resource::IsLightBinOp(*rc)) {\n    WriteBinOp(insn, os);\n  }\n  if (resource::IsLightUniOp(*rc)) {\n    WriteUniOp(insn, os);\n  }\n  if (resource::IsBitShiftOp(*rc)) {\n    WriteBitShift(insn, os);\n  }\n  if (rc->GetName() == resource::kPrint) {\n    WritePrint(insn, os);\n  }\n  if (rc->GetName() == resource::kAssert) {\n    WriteAssert(insn, os);\n  }\n  if (resource::IsMapped(*rc)) {\n    WriteMapped(insn, os);\n  }\n}\n\nvoid Resource::WriteBinOp(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  const string &res_name = res->GetClass()->GetName();\n  string op;\n  if (res_name == resource::kGt) {\n    op = \">\";\n  } else if (res_name == resource::kAdd) {\n    op = \"+\";\n  } else if (res_name == resource::kSub) {\n    op = \"-\";\n  } else if (res_name == resource::kMul) {\n    op = \"*\";\n  } else if (res_name == resource::kEq) {\n    op = \"==\";\n  } else if (res_name == resource::kGte) {\n    op = \">=\";\n  } else if (res_name == resource::kBitAnd) {\n    op = \"&\";\n  } else if (res_name == resource::kBitOr) {\n    op = \"|\";\n  } else if (res_name == resource::kBitXor) {\n    op = \"^\";\n  } else {\n    LOG(FATAL) << \"Unknown binop: \" << res_name;\n  }\n  os << \"    \" << insn->outputs_[0]->GetName() << \" = \"\n     << RegValue(insn->inputs_[0]) << \" \" << op << \" \"\n     << RegValue(insn->inputs_[1]) << \";\\n\";\n}\n\nvoid Resource::WriteUniOp(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  const string &res_name = res->GetClass()->GetName();\n  string op;\n  if (res_name == resource::kBitInv) {\n    op = \"~\";\n  } else {\n    LOG(FATAL) << \"Unknown uniop: \" << res_name;\n  }\n  os << \"    \" << insn->outputs_[0]->GetName() << \" = \"\n     << op << RegValue(insn->inputs_[0]) << \";\\n\";\n}\n\nvoid Resource::WriteBitShift(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  const string &res_name = res->GetClass()->GetName();\n  if (res_name != resource::kShift) {\n    return;\n  }\n  bool is_left = (insn->GetOperand() == \"left\");\n  string op = is_left ? \"<<\" : \">>\";\n  const IValue &value = insn->inputs_[1]->GetInitialValue();\n  int amount = value.value_;\n  os << \"    \" << insn->outputs_[0]->GetName() << \" = \"\n     << RegValue(insn->inputs_[0]) << \" \" << op << \" \"\n     << amount << \";\\n\";\n}\n\nstring Resource::RegValue(IRegister *reg) {\n  if (reg->IsConst()) {\n    return Util::Itoa(reg->GetInitialValue().value_);\n  }\n  return reg->GetName();\n}\n\nvoid Resource::WritePrint(IInsn *insn, ostream &os) {\n  for (IRegister *reg : insn->inputs_) {\n    os << \"    cout << \\\"print: \\\" << \" << RegValue(reg) << \" << \\\"\\\\n\\\";\\n\";\n  }\n}\n\nvoid Resource::WriteAssert(IInsn *insn, ostream &os) {\n  for (IRegister *reg : insn->inputs_) {\n    os << \"    if (!\" << RegValue(reg) << \") {\\n\"\n       << \"      cout << \\\"ASSERTION FAILURE\\\\n\\\";\\n\"\n       << \"    }\\n\";\n  }\n}\n\nvoid Resource::WriteMapped(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  auto *params = res->GetParams();\n  if (params->GetMappedName() == \"mem\") {\n    string mem_name = MemName(res);\n    if (insn->GetOperand() == \"sram_write\") {\n      os << \"    \" << mem_name\n\t << \"->Write(\" << RegValue(insn->inputs_[0]) << \", \"\n\t << RegValue(insn->inputs_[1]) << \");\\n\";\n    }\n    if (insn->GetOperand() == \"sram_read_address\") {\n      os << \"    \" << mem_name\n\t << \"->ReadAddr(\" << RegValue(insn->inputs_[0]) << \");\\n\";\n    }\n    if (insn->GetOperand() == \"sram_read_data\") {\n      os << \"    \" << insn->outputs_[0]->GetName() << \" = \"\n\t << mem_name << \"->ReadData();\\n\";\n    }\n  }\n}\n\nstring Resource::MemName(IResource *res) {\n  string mem = \"mem\";\n  IArray *array = res->GetArray();\n  if (!array->IsExternal()) {\n    mem += \"_\" + Util::Itoa(res->GetId()) + \"_\";\n  }\n  return mem;\n}\n\n}  \/\/ namespace cxx\n}  \/\/ namespace writer\n}  \/\/ namespace iroha\n<commit_msg>[c++ writer] Fix memory name.<commit_after>#include \"writer\/cxx\/resource.h\"\n\n#include \"iroha\/i_design.h\"\n#include \"iroha\/logging.h\"\n#include \"iroha\/resource_class.h\"\n#include \"iroha\/resource_params.h\"\n#include \"writer\/cxx\/class_writer.h\"\n\nnamespace iroha {\nnamespace writer {\nnamespace cxx {\n\nvoid Resource::BuildResource(IResource *res, ClassWriter *cw) {\n  auto *rc = res->GetClass();\n  if (resource::IsMapped(*rc)) {\n    auto *params = res->GetParams();\n    if (params->GetMappedName() == \"mem\") {\n      IArray *array = res->GetArray();\n      if (!array->IsExternal()) {\n\tstring mem_name = MemName(res);\n\tcw->AddVariable(mem_name, \"Memory *\");\n\tClassMember *m = cw->FindConstructor();\n\tm->body_ += \"    \" + mem_name + \" = new Memory();\\n\";\n      }\n    }\n  }\n}\n\nvoid Resource::WriteInsn(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  auto *rc = res->GetClass();\n  if (resource::IsExclusiveBinOp(*rc) ||\n      resource::IsLightBinOp(*rc)) {\n    WriteBinOp(insn, os);\n  }\n  if (resource::IsLightUniOp(*rc)) {\n    WriteUniOp(insn, os);\n  }\n  if (resource::IsBitShiftOp(*rc)) {\n    WriteBitShift(insn, os);\n  }\n  if (rc->GetName() == resource::kPrint) {\n    WritePrint(insn, os);\n  }\n  if (rc->GetName() == resource::kAssert) {\n    WriteAssert(insn, os);\n  }\n  if (resource::IsMapped(*rc)) {\n    WriteMapped(insn, os);\n  }\n}\n\nvoid Resource::WriteBinOp(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  const string &res_name = res->GetClass()->GetName();\n  string op;\n  if (res_name == resource::kGt) {\n    op = \">\";\n  } else if (res_name == resource::kAdd) {\n    op = \"+\";\n  } else if (res_name == resource::kSub) {\n    op = \"-\";\n  } else if (res_name == resource::kMul) {\n    op = \"*\";\n  } else if (res_name == resource::kEq) {\n    op = \"==\";\n  } else if (res_name == resource::kGte) {\n    op = \">=\";\n  } else if (res_name == resource::kBitAnd) {\n    op = \"&\";\n  } else if (res_name == resource::kBitOr) {\n    op = \"|\";\n  } else if (res_name == resource::kBitXor) {\n    op = \"^\";\n  } else {\n    LOG(FATAL) << \"Unknown binop: \" << res_name;\n  }\n  os << \"    \" << insn->outputs_[0]->GetName() << \" = \"\n     << RegValue(insn->inputs_[0]) << \" \" << op << \" \"\n     << RegValue(insn->inputs_[1]) << \";\\n\";\n}\n\nvoid Resource::WriteUniOp(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  const string &res_name = res->GetClass()->GetName();\n  string op;\n  if (res_name == resource::kBitInv) {\n    op = \"~\";\n  } else {\n    LOG(FATAL) << \"Unknown uniop: \" << res_name;\n  }\n  os << \"    \" << insn->outputs_[0]->GetName() << \" = \"\n     << op << RegValue(insn->inputs_[0]) << \";\\n\";\n}\n\nvoid Resource::WriteBitShift(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  const string &res_name = res->GetClass()->GetName();\n  if (res_name != resource::kShift) {\n    return;\n  }\n  bool is_left = (insn->GetOperand() == \"left\");\n  string op = is_left ? \"<<\" : \">>\";\n  const IValue &value = insn->inputs_[1]->GetInitialValue();\n  int amount = value.value_;\n  os << \"    \" << insn->outputs_[0]->GetName() << \" = \"\n     << RegValue(insn->inputs_[0]) << \" \" << op << \" \"\n     << amount << \";\\n\";\n}\n\nstring Resource::RegValue(IRegister *reg) {\n  if (reg->IsConst()) {\n    return Util::Itoa(reg->GetInitialValue().value_);\n  }\n  return reg->GetName();\n}\n\nvoid Resource::WritePrint(IInsn *insn, ostream &os) {\n  for (IRegister *reg : insn->inputs_) {\n    os << \"    cout << \\\"print: \\\" << \" << RegValue(reg) << \" << \\\"\\\\n\\\";\\n\";\n  }\n}\n\nvoid Resource::WriteAssert(IInsn *insn, ostream &os) {\n  for (IRegister *reg : insn->inputs_) {\n    os << \"    if (!\" << RegValue(reg) << \") {\\n\"\n       << \"      cout << \\\"ASSERTION FAILURE\\\\n\\\";\\n\"\n       << \"    }\\n\";\n  }\n}\n\nvoid Resource::WriteMapped(IInsn *insn, ostream &os) {\n  IResource *res = insn->GetResource();\n  auto *params = res->GetParams();\n  if (params->GetMappedName() == \"mem\") {\n    string mem_name = MemName(res);\n    if (insn->GetOperand() == \"sram_write\") {\n      os << \"    \" << mem_name\n\t << \"->Write(\" << RegValue(insn->inputs_[0]) << \", \"\n\t << RegValue(insn->inputs_[1]) << \");\\n\";\n    }\n    if (insn->GetOperand() == \"sram_read_address\") {\n      os << \"    \" << mem_name\n\t << \"->ReadAddr(\" << RegValue(insn->inputs_[0]) << \");\\n\";\n    }\n    if (insn->GetOperand() == \"sram_read_data\") {\n      os << \"    \" << insn->outputs_[0]->GetName() << \" = \"\n\t << mem_name << \"->ReadData();\\n\";\n    }\n  }\n}\n\nstring Resource::MemName(IResource *res) {\n  string mem = \"mem_\";\n  IArray *array = res->GetArray();\n  if (!array->IsExternal()) {\n    mem += Util::Itoa(res->GetId()) + \"_\";\n  }\n  return mem;\n}\n\n}  \/\/ namespace cxx\n}  \/\/ namespace writer\n}  \/\/ namespace iroha\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Add a class for cpp.<commit_after>#ifndef _REQL_HPP\n#define _REQL_HPP\n\nclass ReQL_Client {\n    int tt;\n\npublic:\n    int connect();\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* mbed Microcontroller Library\n * Copyright (c) 2006-2012 ARM 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 THE\n * SOFTWARE.\n *\/\n#include \"rtos\/Thread.h\"\n\n#include \"mbed.h\"\n#include \"rtos\/rtos_idle.h\"\n\nstatic void (*terminate_hook)(osThreadId_t id) = 0;\nextern \"C\" void thread_terminate_hook(osThreadId_t id)\n{\n    if (terminate_hook != (void (*)(osThreadId_t))NULL) {\n        terminate_hook(id);\n    }\n}\n\nnamespace rtos {\n\nvoid Thread::constructor(osPriority priority,\n        uint32_t stack_size, unsigned char *stack_mem, const char *name) {\n    _tid = 0;\n    _dynamic_stack = (stack_mem == NULL);\n    _finished = false;\n    memset(&_obj_mem, 0, sizeof(_obj_mem));\n    memset(&_attr, 0, sizeof(_attr));\n    _attr.priority = priority;\n    _attr.stack_size = stack_size;\n    _attr.name = name ? name : \"application_unnamed_thread\";\n    _attr.stack_mem = (uint32_t*)stack_mem;\n}\n\nvoid Thread::constructor(Callback<void()> task,\n        osPriority priority, uint32_t stack_size, unsigned char *stack_mem, const char *name) {\n    constructor(priority, stack_size, stack_mem, name);\n\n    switch (start(task)) {\n        case osErrorResource:\n            error(\"OS ran out of threads!\\n\");\n            break;\n        case osErrorParameter:\n            error(\"Thread already running!\\n\");\n            break;\n        case osErrorNoMemory:\n            error(\"Error allocating the stack memory\\n\");\n        default:\n            break;\n    }\n}\n\nosStatus Thread::start(Callback<void()> task) {\n    _mutex.lock();\n\n    if ((_tid != 0) || _finished) {\n        _mutex.unlock();\n        return osErrorParameter;\n    }\n\n    if (_attr.stack_mem == NULL) {\n        _attr.stack_mem = new uint32_t[_attr.stack_size\/sizeof(uint32_t)];\n        MBED_ASSERT(_attr.stack_mem != NULL);\n    }\n\n    \/\/Fill the stack with a magic word for maximum usage checking\n    for (uint32_t i = 0; i < (_attr.stack_size \/ sizeof(uint32_t)); i++) {\n        ((uint32_t *)_attr.stack_mem)[i] = 0xE25A2EA5;\n    }\n\n    memset(&_obj_mem, 0, sizeof(_obj_mem));\n    _attr.cb_size = sizeof(_obj_mem);\n    _attr.cb_mem = &_obj_mem;\n    _task = task;\n    _tid = osThreadNew(Thread::_thunk, this, &_attr);\n    if (_tid == NULL) {\n        if (_dynamic_stack) {\n            delete[] (uint32_t *)(_attr.stack_mem);\n            _attr.stack_mem = (uint32_t*)NULL;\n        }\n        _mutex.unlock();\n        _join_sem.release();\n        return osErrorResource;\n    }\n\n    _mutex.unlock();\n    return osOK;\n}\n\nosStatus Thread::terminate() {\n    osStatus_t ret = osOK;\n    _mutex.lock();\n\n    \/\/ Set the Thread's tid to NULL and\n    \/\/ release the semaphore before terminating\n    \/\/ since this thread could be terminating itself\n    osThreadId_t local_id = _tid;\n    _join_sem.release();\n    _tid = (osThreadId_t)NULL;\n    if (!_finished) {\n        _finished = true;\n        ret = osThreadTerminate(local_id);\n    }\n    _mutex.unlock();\n    return ret;\n}\n\nosStatus Thread::join() {\n    int32_t ret = _join_sem.wait();\n    if (ret < 0) {\n        return osError;\n    }\n\n    \/\/ The semaphore has been released so this thread is being\n    \/\/ terminated or has been terminated. Once the mutex has\n    \/\/ been locked it is ensured that the thread is deleted.\n    _mutex.lock();\n    MBED_ASSERT(NULL == _tid);\n    _mutex.unlock();\n\n    \/\/ Release sem so any other threads joining this thread wake up\n    _join_sem.release();\n    return osOK;\n}\n\nosStatus Thread::set_priority(osPriority priority) {\n    osStatus_t ret;\n    _mutex.lock();\n\n    ret = osThreadSetPriority(_tid, priority);\n\n    _mutex.unlock();\n    return ret;\n}\n\nosPriority Thread::get_priority() {\n    osPriority_t ret;\n    _mutex.lock();\n\n    ret = osThreadGetPriority(_tid);\n\n    _mutex.unlock();\n    return ret;\n}\n\nint32_t Thread::signal_set(int32_t flags) {\n    return osThreadFlagsSet(_tid, flags);\n}\n\nThread::State Thread::get_state() {\n    uint8_t state = osThreadTerminated;\n\n    _mutex.lock();\n\n    if (_tid != NULL) {\n#if defined(MBED_OS_BACKEND_RTX5)\n        state = _obj_mem.state;\n#else\n        state = osThreadGetState(_tid);\n#endif\n    }\n\n    _mutex.unlock();\n\n    State user_state;\n\n    switch(state) {\n        case osThreadInactive:\n            user_state = Inactive;\n            break;\n        case osThreadReady:\n            user_state = Ready;\n            break;\n        case osThreadRunning:\n            user_state = Running;\n            break;\n#if defined(MBED_OS_BACKEND_RTX5)\n        case osRtxThreadWaitingDelay:\n            user_state = WaitingDelay;\n            break;\n        case osRtxThreadWaitingJoin:\n            user_state = WaitingJoin;\n            break;\n        case osRtxThreadWaitingThreadFlags:\n            user_state = WaitingThreadFlag;\n            break;\n        case osRtxThreadWaitingEventFlags:\n            user_state = WaitingEventFlag;\n            break;\n        case osRtxThreadWaitingMutex:\n            user_state = WaitingMutex;\n            break;\n        case osRtxThreadWaitingSemaphore:\n            user_state = WaitingSemaphore;\n            break;\n        case osRtxThreadWaitingMemoryPool:\n            user_state = WaitingMemoryPool;\n            break;\n        case osRtxThreadWaitingMessageGet:\n            user_state = WaitingMessageGet;\n            break;\n        case osRtxThreadWaitingMessagePut:\n            user_state = WaitingMessagePut;\n            break;\n#endif\n        case osThreadTerminated:\n        default:\n            user_state = Deleted;\n            break;\n    }\n\n    return user_state;\n}\n\nuint32_t Thread::stack_size() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n    if (_tid != NULL) {\n        size = osThreadGetStackSize(_tid);\n    }\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::free_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n#if defined(MBED_OS_BACKEND_RTX5)\n    if (_tid != NULL) {\n        os_thread_t *thread = (os_thread_t *)_tid;\n        size = (uint32_t)thread->sp - (uint32_t)thread->stack_mem;\n    }\n#endif\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::used_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n#if defined(MBED_OS_BACKEND_RTX5)\n    if (_tid != NULL) {\n        os_thread_t *thread = (os_thread_t *)_tid;\n        size = ((uint32_t)thread->stack_mem + thread->stack_size) - thread->sp;\n    }\n#endif\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::max_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n    if (_tid != NULL) {\n#if defined(MBED_OS_BACKEND_RTX5)\n        os_thread_t *thread = (os_thread_t *)_tid;\n        uint32_t high_mark = 0;\n        while (((uint32_t *)(thread->stack_mem))[high_mark] == 0xE25A2EA5)\n            high_mark++;\n        size = thread->stack_size - (high_mark * sizeof(uint32_t));\n#else\n        size = osThreadGetStackSize(_tid) - osThreadGetStackSpace(_tid);\n#endif\n    }\n\n    _mutex.unlock();\n    return size;\n}\n\nconst char *Thread::get_name() {\n    return _attr.name;\n}\n\nint32_t Thread::signal_clr(int32_t flags) {\n    return osThreadFlagsClear(flags);\n}\n\nosEvent Thread::signal_wait(int32_t signals, uint32_t millisec) {\n    uint32_t res;\n    osEvent evt;\n    uint32_t options = osFlagsWaitAll;\n    if (signals == 0) {\n        options = osFlagsWaitAny;\n        signals = 0x7FFFFFFF;\n    }\n    res = osThreadFlagsWait(signals, options, millisec);\n    if (res & osFlagsError) {\n        switch (res) {\n            case osFlagsErrorISR:\n                evt.status = osErrorISR;\n                break;\n            case osFlagsErrorResource:\n                evt.status = osOK;\n                break;\n            case osFlagsErrorTimeout:\n                evt.status = (osStatus)osEventTimeout;\n                break;\n            case osFlagsErrorParameter:\n            default:\n                evt.status = (osStatus)osErrorValue;\n                break;\n        }\n    } else {\n        evt.status = (osStatus)osEventSignal;\n        evt.value.signals = res;\n    }\n\n    return evt;\n}\n\nosStatus Thread::wait(uint32_t millisec) {\n    return osDelay(millisec);\n}\n\nosStatus Thread::yield() {\n    return osThreadYield();\n}\n\nosThreadId Thread::gettid() {\n    return osThreadGetId();\n}\n\nvoid Thread::attach_idle_hook(void (*fptr)(void)) {\n    rtos_attach_idle_hook(fptr);\n}\n\nvoid Thread::attach_terminate_hook(void (*fptr)(osThreadId_t id)) {\n    terminate_hook = fptr;\n}\n\nThread::~Thread() {\n    \/\/ terminate is thread safe\n    terminate();\n    if (_dynamic_stack) {\n        delete[] (uint32_t*)(_attr.stack_mem);\n        _attr.stack_mem = (uint32_t*)NULL;\n    }\n}\n\nvoid Thread::_thunk(void * thread_ptr)\n{\n    Thread *t = (Thread*)thread_ptr;\n    t->_task();\n    t->_mutex.lock();\n    t->_tid = (osThreadId)NULL;\n    t->_finished = true;\n    t->_join_sem.release();\n    \/\/ rtos will release the mutex automatically\n}\n\n}\n<commit_msg>Ensure Thread stack is 8 byte aligned<commit_after>\/* mbed Microcontroller Library\n * Copyright (c) 2006-2012 ARM 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 THE\n * SOFTWARE.\n *\/\n#include \"rtos\/Thread.h\"\n\n#include \"mbed.h\"\n#include \"rtos\/rtos_idle.h\"\n#include \"mbed_assert.h\"\n\n#define ALIGN_UP(pos, align) ((pos) % (align) ? (pos) +  ((align) - (pos) % (align)) : (pos))\nMBED_STATIC_ASSERT(ALIGN_UP(0, 8) == 0, \"ALIGN_UP macro error\");\nMBED_STATIC_ASSERT(ALIGN_UP(1, 8) == 8, \"ALIGN_UP macro error\");\n\n#define ALIGN_DOWN(pos, align) ((pos) - ((pos) % (align)))\nMBED_STATIC_ASSERT(ALIGN_DOWN(7, 8) == 0, \"ALIGN_DOWN macro error\");\nMBED_STATIC_ASSERT(ALIGN_DOWN(8, 8) == 8, \"ALIGN_DOWN macro error\");\n\nstatic void (*terminate_hook)(osThreadId_t id) = 0;\nextern \"C\" void thread_terminate_hook(osThreadId_t id)\n{\n    if (terminate_hook != (void (*)(osThreadId_t))NULL) {\n        terminate_hook(id);\n    }\n}\n\nnamespace rtos {\n\nvoid Thread::constructor(osPriority priority,\n        uint32_t stack_size, unsigned char *stack_mem, const char *name) {\n\n    const uintptr_t unaligned_mem = reinterpret_cast<uintptr_t>(stack_mem);\n    const uintptr_t aligned_mem = ALIGN_UP(unaligned_mem, 8);\n    const uint32_t offset = aligned_mem - unaligned_mem;\n    const uint32_t aligned_size = ALIGN_DOWN(stack_size - offset, 8);\n\n    _tid = 0;\n    _dynamic_stack = (stack_mem == NULL);\n    _finished = false;\n    memset(&_obj_mem, 0, sizeof(_obj_mem));\n    memset(&_attr, 0, sizeof(_attr));\n    _attr.priority = priority;\n    _attr.stack_size = aligned_size;\n    _attr.name = name ? name : \"application_unnamed_thread\";\n    _attr.stack_mem = reinterpret_cast<uint32_t*>(aligned_mem);\n}\n\nvoid Thread::constructor(Callback<void()> task,\n        osPriority priority, uint32_t stack_size, unsigned char *stack_mem, const char *name) {\n    constructor(priority, stack_size, stack_mem, name);\n\n    switch (start(task)) {\n        case osErrorResource:\n            error(\"OS ran out of threads!\\n\");\n            break;\n        case osErrorParameter:\n            error(\"Thread already running!\\n\");\n            break;\n        case osErrorNoMemory:\n            error(\"Error allocating the stack memory\\n\");\n        default:\n            break;\n    }\n}\n\nosStatus Thread::start(Callback<void()> task) {\n    _mutex.lock();\n\n    if ((_tid != 0) || _finished) {\n        _mutex.unlock();\n        return osErrorParameter;\n    }\n\n    if (_attr.stack_mem == NULL) {\n        _attr.stack_mem = new uint32_t[_attr.stack_size\/sizeof(uint32_t)];\n        MBED_ASSERT(_attr.stack_mem != NULL);\n    }\n\n    \/\/Fill the stack with a magic word for maximum usage checking\n    for (uint32_t i = 0; i < (_attr.stack_size \/ sizeof(uint32_t)); i++) {\n        ((uint32_t *)_attr.stack_mem)[i] = 0xE25A2EA5;\n    }\n\n    memset(&_obj_mem, 0, sizeof(_obj_mem));\n    _attr.cb_size = sizeof(_obj_mem);\n    _attr.cb_mem = &_obj_mem;\n    _task = task;\n    _tid = osThreadNew(Thread::_thunk, this, &_attr);\n    if (_tid == NULL) {\n        if (_dynamic_stack) {\n            delete[] (uint32_t *)(_attr.stack_mem);\n            _attr.stack_mem = (uint32_t*)NULL;\n        }\n        _mutex.unlock();\n        _join_sem.release();\n        return osErrorResource;\n    }\n\n    _mutex.unlock();\n    return osOK;\n}\n\nosStatus Thread::terminate() {\n    osStatus_t ret = osOK;\n    _mutex.lock();\n\n    \/\/ Set the Thread's tid to NULL and\n    \/\/ release the semaphore before terminating\n    \/\/ since this thread could be terminating itself\n    osThreadId_t local_id = _tid;\n    _join_sem.release();\n    _tid = (osThreadId_t)NULL;\n    if (!_finished) {\n        _finished = true;\n        ret = osThreadTerminate(local_id);\n    }\n    _mutex.unlock();\n    return ret;\n}\n\nosStatus Thread::join() {\n    int32_t ret = _join_sem.wait();\n    if (ret < 0) {\n        return osError;\n    }\n\n    \/\/ The semaphore has been released so this thread is being\n    \/\/ terminated or has been terminated. Once the mutex has\n    \/\/ been locked it is ensured that the thread is deleted.\n    _mutex.lock();\n    MBED_ASSERT(NULL == _tid);\n    _mutex.unlock();\n\n    \/\/ Release sem so any other threads joining this thread wake up\n    _join_sem.release();\n    return osOK;\n}\n\nosStatus Thread::set_priority(osPriority priority) {\n    osStatus_t ret;\n    _mutex.lock();\n\n    ret = osThreadSetPriority(_tid, priority);\n\n    _mutex.unlock();\n    return ret;\n}\n\nosPriority Thread::get_priority() {\n    osPriority_t ret;\n    _mutex.lock();\n\n    ret = osThreadGetPriority(_tid);\n\n    _mutex.unlock();\n    return ret;\n}\n\nint32_t Thread::signal_set(int32_t flags) {\n    return osThreadFlagsSet(_tid, flags);\n}\n\nThread::State Thread::get_state() {\n    uint8_t state = osThreadTerminated;\n\n    _mutex.lock();\n\n    if (_tid != NULL) {\n#if defined(MBED_OS_BACKEND_RTX5)\n        state = _obj_mem.state;\n#else\n        state = osThreadGetState(_tid);\n#endif\n    }\n\n    _mutex.unlock();\n\n    State user_state;\n\n    switch(state) {\n        case osThreadInactive:\n            user_state = Inactive;\n            break;\n        case osThreadReady:\n            user_state = Ready;\n            break;\n        case osThreadRunning:\n            user_state = Running;\n            break;\n#if defined(MBED_OS_BACKEND_RTX5)\n        case osRtxThreadWaitingDelay:\n            user_state = WaitingDelay;\n            break;\n        case osRtxThreadWaitingJoin:\n            user_state = WaitingJoin;\n            break;\n        case osRtxThreadWaitingThreadFlags:\n            user_state = WaitingThreadFlag;\n            break;\n        case osRtxThreadWaitingEventFlags:\n            user_state = WaitingEventFlag;\n            break;\n        case osRtxThreadWaitingMutex:\n            user_state = WaitingMutex;\n            break;\n        case osRtxThreadWaitingSemaphore:\n            user_state = WaitingSemaphore;\n            break;\n        case osRtxThreadWaitingMemoryPool:\n            user_state = WaitingMemoryPool;\n            break;\n        case osRtxThreadWaitingMessageGet:\n            user_state = WaitingMessageGet;\n            break;\n        case osRtxThreadWaitingMessagePut:\n            user_state = WaitingMessagePut;\n            break;\n#endif\n        case osThreadTerminated:\n        default:\n            user_state = Deleted;\n            break;\n    }\n\n    return user_state;\n}\n\nuint32_t Thread::stack_size() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n    if (_tid != NULL) {\n        size = osThreadGetStackSize(_tid);\n    }\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::free_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n#if defined(MBED_OS_BACKEND_RTX5)\n    if (_tid != NULL) {\n        os_thread_t *thread = (os_thread_t *)_tid;\n        size = (uint32_t)thread->sp - (uint32_t)thread->stack_mem;\n    }\n#endif\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::used_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n#if defined(MBED_OS_BACKEND_RTX5)\n    if (_tid != NULL) {\n        os_thread_t *thread = (os_thread_t *)_tid;\n        size = ((uint32_t)thread->stack_mem + thread->stack_size) - thread->sp;\n    }\n#endif\n\n    _mutex.unlock();\n    return size;\n}\n\nuint32_t Thread::max_stack() {\n    uint32_t size = 0;\n    _mutex.lock();\n\n    if (_tid != NULL) {\n#if defined(MBED_OS_BACKEND_RTX5)\n        os_thread_t *thread = (os_thread_t *)_tid;\n        uint32_t high_mark = 0;\n        while (((uint32_t *)(thread->stack_mem))[high_mark] == 0xE25A2EA5)\n            high_mark++;\n        size = thread->stack_size - (high_mark * sizeof(uint32_t));\n#else\n        size = osThreadGetStackSize(_tid) - osThreadGetStackSpace(_tid);\n#endif\n    }\n\n    _mutex.unlock();\n    return size;\n}\n\nconst char *Thread::get_name() {\n    return _attr.name;\n}\n\nint32_t Thread::signal_clr(int32_t flags) {\n    return osThreadFlagsClear(flags);\n}\n\nosEvent Thread::signal_wait(int32_t signals, uint32_t millisec) {\n    uint32_t res;\n    osEvent evt;\n    uint32_t options = osFlagsWaitAll;\n    if (signals == 0) {\n        options = osFlagsWaitAny;\n        signals = 0x7FFFFFFF;\n    }\n    res = osThreadFlagsWait(signals, options, millisec);\n    if (res & osFlagsError) {\n        switch (res) {\n            case osFlagsErrorISR:\n                evt.status = osErrorISR;\n                break;\n            case osFlagsErrorResource:\n                evt.status = osOK;\n                break;\n            case osFlagsErrorTimeout:\n                evt.status = (osStatus)osEventTimeout;\n                break;\n            case osFlagsErrorParameter:\n            default:\n                evt.status = (osStatus)osErrorValue;\n                break;\n        }\n    } else {\n        evt.status = (osStatus)osEventSignal;\n        evt.value.signals = res;\n    }\n\n    return evt;\n}\n\nosStatus Thread::wait(uint32_t millisec) {\n    return osDelay(millisec);\n}\n\nosStatus Thread::yield() {\n    return osThreadYield();\n}\n\nosThreadId Thread::gettid() {\n    return osThreadGetId();\n}\n\nvoid Thread::attach_idle_hook(void (*fptr)(void)) {\n    rtos_attach_idle_hook(fptr);\n}\n\nvoid Thread::attach_terminate_hook(void (*fptr)(osThreadId_t id)) {\n    terminate_hook = fptr;\n}\n\nThread::~Thread() {\n    \/\/ terminate is thread safe\n    terminate();\n    if (_dynamic_stack) {\n        delete[] (uint32_t*)(_attr.stack_mem);\n        _attr.stack_mem = (uint32_t*)NULL;\n    }\n}\n\nvoid Thread::_thunk(void * thread_ptr)\n{\n    Thread *t = (Thread*)thread_ptr;\n    t->_task();\n    t->_mutex.lock();\n    t->_tid = (osThreadId)NULL;\n    t->_finished = true;\n    t->_join_sem.release();\n    \/\/ rtos will release the mutex automatically\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tsample of Elliptic Curve Diffie-Hellman key sharing\n*\/\n#include <iostream>\n#include <fstream>\n#include <cybozu\/random_generator.hpp>\n#include <mcl\/fp.hpp>\n#include <mcl\/gmp_util.hpp>\n#include <mcl\/ecparam.hpp>\n#include <mcl\/ec.hpp>\n#include <mcl\/fp.hpp>\n\ntypedef mcl::FpT<> Fp;\ntypedef mcl::FpT<mcl::ZnTag> Zn;\ntypedef mcl::EcT<Fp> Ec;\n\nint main()\n{\n\tcybozu::RandomGenerator rg;\n\t\/*\n\t\tsystem setup with a parameter secp192k1 recommended by SECG\n\t\tEc is an elliptic curve over Fp\n\t\tthe cyclic group of <P> is isomorphic to Zn\n\t*\/\n\tconst mcl::EcParam& para = mcl::ecparam::secp192k1;\n\tZn::setModulo(para.n);\n\tFp::setModulo(para.p);\n\tEc::setParam(para.a, para.b);\n\tconst Ec P(Fp(para.gx), Fp(para.gy));\n\n\t\/*\n\t\tAlice setups a private key a and public key aP\n\t*\/\n\tZn a;\n\tEc aP;\n\n\ta.setRand(rg);\n\tEc::mul(aP, P, a); \/\/ aP = a * P;\n\n\tstd::cout << \"aP=\" << aP << std::endl;\n\n\t\/*\n\t\tBob setups a private key b and public key bP\n\t*\/\n\tZn b;\n\tEc bP;\n\n\tb.setRand(rg);\n\tEc::mul(bP, P, b); \/\/ bP = b * P;\n\n\tstd::cout << \"bP=\" << bP << std::endl;\n\n\tEc abP, baP;\n\n\t\/\/ Alice uses bP(B's public key) and a(A's priavte key)\n\tEc::mul(abP, bP, a); \/\/ abP = a * (bP)\n\n\t\/\/ Bob uses aP(A's public key) and b(B's private key)\n\tEc::mul(baP, aP, b); \/\/ baP = b * (aP)\n\n\tif (abP == baP) {\n\t\tstd::cout << \"key sharing succeed:\" << abP << std::endl;\n\t} else {\n\t\tstd::cout << \"ERR(not here)\" << std::endl;\n\t}\n}\n\n<commit_msg>remove unnecessary include<commit_after>\/*\n\tsample of Elliptic Curve Diffie-Hellman key sharing\n*\/\n#include <iostream>\n#include <fstream>\n#include <cybozu\/random_generator.hpp>\n#include <mcl\/fp.hpp>\n#include <mcl\/ecparam.hpp>\n\ntypedef mcl::FpT<> Fp;\ntypedef mcl::FpT<mcl::ZnTag> Zn;\ntypedef mcl::EcT<Fp> Ec;\n\nint main()\n{\n\tcybozu::RandomGenerator rg;\n\t\/*\n\t\tsystem setup with a parameter secp192k1 recommended by SECG\n\t\tEc is an elliptic curve over Fp\n\t\tthe cyclic group of <P> is isomorphic to Zn\n\t*\/\n\tconst mcl::EcParam& para = mcl::ecparam::secp192k1;\n\tZn::setModulo(para.n);\n\tFp::setModulo(para.p);\n\tEc::setParam(para.a, para.b);\n\tconst Ec P(Fp(para.gx), Fp(para.gy));\n\n\t\/*\n\t\tAlice setups a private key a and public key aP\n\t*\/\n\tZn a;\n\tEc aP;\n\n\ta.setRand(rg);\n\tEc::mul(aP, P, a); \/\/ aP = a * P;\n\n\tstd::cout << \"aP=\" << aP << std::endl;\n\n\t\/*\n\t\tBob setups a private key b and public key bP\n\t*\/\n\tZn b;\n\tEc bP;\n\n\tb.setRand(rg);\n\tEc::mul(bP, P, b); \/\/ bP = b * P;\n\n\tstd::cout << \"bP=\" << bP << std::endl;\n\n\tEc abP, baP;\n\n\t\/\/ Alice uses bP(B's public key) and a(A's priavte key)\n\tEc::mul(abP, bP, a); \/\/ abP = a * (bP)\n\n\t\/\/ Bob uses aP(A's public key) and b(B's private key)\n\tEc::mul(baP, aP, b); \/\/ baP = b * (aP)\n\n\tif (abP == baP) {\n\t\tstd::cout << \"key sharing succeed:\" << abP << std::endl;\n\t} else {\n\t\tstd::cout << \"ERR(not here)\" << std::endl;\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <stdlib.h>\n#include <iostream>\n\n#include <sys\/types.h>\n#include <unistd.h>\n\n\/\/ include libevent's header\n#include <event.h>\n\n\/\/ include libcage's header\n#include <libcage\/cage.hpp>\n\nconst int max_node    = 12;\nconst int max_process = 1;\n\nconst int port     = 10000;\nlibcage::cage *boot;\nlibcage::cage *cage;\n\nconst char *host;\nint host_port = 10000;\n\ndouble t1;\n\nevent ev;\n\nint count = 0;\nconst int max_count = 1000;\n\nvoid timer_callback(int fd, short ev, void *arg);\nvoid timer_get(int fd, short ev, void *arg);\n\ndouble\ngettimeofday_sec()\n{\n    struct timeval tv;\n    gettimeofday(&tv, NULL);\n    return tv.tv_sec + (double)tv.tv_usec*1e-6;\n}\n\nclass join_callback\n{\npublic:\n        int n;\n        int p;\n\n        void operator() (bool result)\n        {\n                \/\/ print state\n                if (result) {\n                        std::cerr << \"join: successed, n = \"\n                                  << n\n                                  << std::endl;\n                } else  {\n                        std::cerr << \"join: failed, n = \"\n                                  << n\n                                  << std::endl;\n\n                        \/\/cage[n].join(\"localhost\", 10000, *this);\n                        \/\/return;\n                }\n\n                int v = p * max_node + n;\n                cage[n].put(&v, sizeof(v), &v, sizeof(v), (1 << 16) - 1);\n\n                n++;\n\n                if (n < max_node) {\n                        \/\/ start nodes recursively\n                        timeval tval;\n\n                        tval.tv_sec  = 0;\n                        tval.tv_usec = 400000;\n\n                        join_callback *func = new join_callback;\n\n                        *func = *this;\n\n                        evtimer_set(&ev, timer_callback, func);\n                        evtimer_add(&ev, &tval);\n                } else {\n                        \/\/ start timer\n                        timeval tval;\n\n                        tval.tv_sec  = 1;\n                        tval.tv_usec = 0;\n\n                        evtimer_set(&ev, timer_get, NULL);\n                        evtimer_add(&ev, &tval);\n                }\n        }\n};\n\nclass get_callback {\npublic:\n        void operator() (bool result, void *buf, int len)\n        {\n                double t2 = gettimeofday_sec();\n\n                if (result) {\n                        double diff = t2 - t1;\n                        std::cout << diff << std::endl;\n                }\n\n                if (count > max_count)\n                        exit(0);\n\n                timeval tval;\n\n                tval.tv_sec  = 1;\n                tval.tv_usec = 0;\n\n                evtimer_set(&ev, timer_get, NULL);\n                evtimer_add(&ev, &tval);\n        }\n};\n\n\njoin_callback func;\n\n\/\/ callback for join\nvoid\ntimer_callback(int fd, short ev, void *arg)\n{\n        join_callback *func = (join_callback*)arg;\n\n        if (! cage[func->n].open(PF_INET, 0)) {\n                std::cerr << \"cannot open port\"\n                          << std::endl;\n                return;\n        }\n        \n        cage[func->n].set_global();\n        cage[func->n].join(host, host_port, *func);\n\n        delete func;\n}\n\nvoid\ntimer_get(int fd, short ev, void *arg)\n{\n        uint32_t n1, n2, n3;\n\n        n1  = mrand48();\n        n1 %= max_process;\n        n1  = n1 > 0 ? n1 : -n1;\n\n        n2  = mrand48();\n        n2 %= max_node;\n        n2  = n2 > 0 ? n2 : -n2;\n\n        n3  = mrand48();\n        n3 %= max_node;\n        n3  = n2 > 0 ? n2 : -n2;\n\n        int n = n1 * max_node + n2;\n\n        get_callback func;\n\n        t1 = gettimeofday_sec();\n\n        count++;\n\n        cage[n3].get(&n, sizeof(n), func);\n}\n\n\nint\nmain(int argc, char *argv[])\n{\n        if (argc < 3)\n                return -1;\n\n        host = argv[1];\n        host_port = atoi(argv[2]);\n\n        int i;\n\n        \/\/ fork\n        for (i = 0; i < max_process; i++) {\n                pid_t pid = fork();\n                if (pid > 0)\n                        break;\n        }\n\n\n        \/\/ initialize libevent\n        event_init();\n\n\n        \/\/ start other nodes\n        cage = new libcage::cage[max_node];\n\n        join_callback func;\n\n        func.n = 0;\n        func.p = i;\n\n        if (! cage[0].open(PF_INET, 0)) {\n                std::cerr << \"cannot open port\"\n                          << std::endl;\n                return -1;\n        }\n        cage[0].set_global();\n        cage[0].join(host, host_port, func);\n\n        \/\/ handle event loop\n        event_dispatch();\n\n        return 0;\n}\n<commit_msg>fixed for test<commit_after>#include <stdlib.h>\n#include <iostream>\n\n#include <sys\/types.h>\n#include <unistd.h>\n\n\/\/ include libevent's header\n#include <event.h>\n\n\/\/ include libcage's header\n#include <libcage\/cage.hpp>\n\nint max_node = 100;\nconst int max_process = 1;\n\nconst int port     = 10000;\nlibcage::cage *boot;\nlibcage::cage *cage;\n\nconst char *host;\nint host_port = 10000;\n\ndouble t1;\n\nevent ev;\n\nint count = 0;\nconst int max_count = 1000;\n\nvoid timer_callback(int fd, short ev, void *arg);\nvoid timer_get(int fd, short ev, void *arg);\n\ndouble\ngettimeofday_sec()\n{\n    struct timeval tv;\n    gettimeofday(&tv, NULL);\n    return tv.tv_sec + (double)tv.tv_usec*1e-6;\n}\n\nclass join_callback\n{\npublic:\n        int n;\n        int p;\n\n        void operator() (bool result)\n        {\n                \/\/ print state\n                if (result) {\n                        std::cerr << \"join: successed, n = \"\n                                  << n\n                                  << std::endl;\n                } else  {\n                        std::cerr << \"join: failed, n = \"\n                                  << n\n                                  << std::endl;\n\n                        \/\/cage[n].join(\"localhost\", 10000, *this);\n                        \/\/return;\n                }\n\n                int v = p * max_node + n;\n                cage[n].put(&v, sizeof(v), &v, sizeof(v), (1 << 16) - 1);\n\n                n++;\n\n                if (n < max_node) {\n                        \/\/ start nodes recursively\n                        timeval tval;\n\n                        tval.tv_sec  = 0;\n                        tval.tv_usec = 400000;\n\n                        join_callback *func = new join_callback;\n\n                        *func = *this;\n\n                        evtimer_set(&ev, timer_callback, func);\n                        evtimer_add(&ev, &tval);\n                } else {\n                        \/\/ start timer\n                        timeval tval;\n\n                        tval.tv_sec  = 1;\n                        tval.tv_usec = 0;\n\n                        evtimer_set(&ev, timer_get, NULL);\n                        evtimer_add(&ev, &tval);\n                }\n        }\n};\n\nclass get_callback {\npublic:\n        void operator() (bool result, void *buf, int len)\n        {\n                double t2 = gettimeofday_sec();\n\n                if (result) {\n                        double diff = t2 - t1;\n                        std::cout << diff << std::endl;\n                }\n\n                if (count > max_count)\n                        exit(0);\n\n                timeval tval;\n\n                tval.tv_sec  = 1;\n                tval.tv_usec = 0;\n\n                evtimer_set(&ev, timer_get, NULL);\n                evtimer_add(&ev, &tval);\n        }\n};\n\n\njoin_callback func;\n\n\/\/ callback for join\nvoid\ntimer_callback(int fd, short ev, void *arg)\n{\n        join_callback *func = (join_callback*)arg;\n\n        if (! cage[func->n].open(PF_INET, 0)) {\n                std::cerr << \"cannot open port\"\n                          << std::endl;\n                return;\n        }\n        \n        cage[func->n].set_global();\n        cage[func->n].join(host, host_port, *func);\n\n        delete func;\n}\n\nvoid\ntimer_get(int fd, short ev, void *arg)\n{\n        uint32_t n1, n2, n3;\n\n        n1  = mrand48();\n        n1 %= max_process;\n        n1  = n1 > 0 ? n1 : -n1;\n\n        n2  = mrand48();\n        n2 %= max_node;\n        n2  = n2 > 0 ? n2 : -n2;\n\n        n3  = mrand48();\n        n3 %= max_node;\n        n3  = n2 > 0 ? n2 : -n2;\n\n        int n = n1 * max_node + n2;\n\n        get_callback func;\n\n        t1 = gettimeofday_sec();\n\n        count++;\n\n        cage[n3].get(&n, sizeof(n), func);\n}\n\n\nint\nmain(int argc, char *argv[])\n{\n        if (argc < 4)\n                return -1;\n\n        max_node = atoi(argv[1]);\n        host = argv[2];\n        host_port = atoi(argv[3]);\n\n        int i;\n\n        \/\/ fork\n        for (i = 0; i < max_process; i++) {\n                pid_t pid = fork();\n                if (pid > 0)\n                        break;\n        }\n\n\n        \/\/ initialize libevent\n        event_init();\n\n\n        \/\/ start other nodes\n        cage = new libcage::cage[max_node];\n\n        join_callback func;\n\n        func.n = 0;\n        func.p = i;\n\n        if (! cage[0].open(PF_INET, 0)) {\n                std::cerr << \"cannot open port\"\n                          << std::endl;\n                return -1;\n        }\n        cage[0].set_global();\n        cage[0].join(host, host_port, func);\n\n        \/\/ handle event loop\n        event_dispatch();\n\n        return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ @file\r\n\/\/\/\r\n\/\/\/ Class Definition for Reminder\r\n\/\/\/\r\n\/\/\/ @ingroup Reminder_Library\r\n\/\/\/\r\n\/\/\/ @par Copyright (c) 2014 George Nyarangi. All rights reserved.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n#include <iostream>\r\n#include <algorithm>\r\n#include <fstream>\r\n#include <string>\r\n#include <sstream>  \r\n#include <string.h>\r\n#include <time.h>\r\n\r\n#include \"ReminderTypes.hpp\"\r\n#include \"Reminder.hpp\"\r\n#include \"quickmail.h\"\r\n#include \"Types.hpp\"\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Reminder constructor\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nReminder::Reminder()\r\n{\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Overloaded Reminder constructor; Allows 'reminderTable' to be initialized\r\n\/\/\/ when the 'Reminder' class object is instantiated, i.e.,\r\n\/\/\/ Reminder myReminder ( myTable )\r\n\/\/\/\r\n\/\/\/ @param[in]  reminderTable   Table where all data will be stored    \r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nReminder::Reminder( Table_t& reminderTable )\r\n{\r\n    this->reminderTable = reminderTable;\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Reminder destructor.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nReminder::~Reminder()\r\n{\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for reading an input file\r\n\/\/\/\r\n\/\/\/ @param[in]  fileName        Name of the file containing the data \r\n\/\/\/\r\n\/\/\/ @return     ReminderStatus  Status indicating success\/failure\r\n\/\/\/\r\n\/\/\/ @retval     REMINDER_STATUS_PASS    \r\n\/\/\/             REMINDER_STATUS_FAIL\r\n\/\/\/\r\n\/\/\/ @test        Reminder_ReadFile.cpp\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nReminderStatus Reminder::ReadFile( const std::string& fileName )\r\n{\r\n    std::string line;\r\n    std::string key;\r\n    std::string value;\r\n    ReminderStatus readFileStatus = REMINDER_STATUS_FAIL;\r\n\r\n    \/\/\/ @future Refactor ReadFile() to utilize a CSV reader library\r\n    std::ifstream myFile;\r\n    myFile.open( fileName, std::ifstream::in );\r\n\r\n    if ( myFile.is_open() )\r\n    {\r\n        uint32_t datumPosition = 1;\r\n        while ( std::getline( myFile, line, ',') )\r\n        {\r\n            \/\/ Remove spaces from strings\r\n            line.erase( std::remove_if( line.begin(), line.end(), ::isspace ), line.end() );\r\n            \/\/ Check if datum position is odd\r\n            if (datumPosition % 2) \r\n            { \r\n                key = line;\r\n            } \r\n            else \r\n            {\r\n                value = line;\r\n                reminderTable.insert( std::pair<std::string, std::string>( key, value ) );\r\n                \r\n                readFileStatus = REMINDER_STATUS_PASS;\r\n            }\r\n\r\n            datumPosition++;\r\n        }\r\n        \r\n        myFile.close();\r\n    }\r\n    \r\n    return readFileStatus;\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for adding an email recepient to the \"to\" field\r\n\/\/\/\r\n\/\/\/ @param[in]  additionalRecepient  Recepient to be addedd\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::AddRecepient( std::string additionalRecepient )\r\n{\r\n    const char* cstrAdditionalRecepient = additionalRecepient.c_str();\r\n    quickmail_add_to ( mailObject, cstrAdditionalRecepient );\r\n}  \r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for getting date metadata\r\n\/\/\/\r\n\/\/\/param[in, out]  currentMonth  The current month\r\n\/\/\/param[in, out]  currentDay    The current day\r\n\/\/\/param[in, out]  longDate      Long date (Www Mmm dd hh:mm:ss yyyy)\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::GetDate( int16_t& currentMonth, int16_t& currentDay, std::string& longDate )\r\n{\r\n    time_t rawTime;\r\n    time( &rawTime );\r\n    today = localtime( &rawTime );\r\n    currentMonth = today->tm_mon + 1;\r\n    currentDay = today->tm_mday;\r\n    longDate = asctime ( today );\r\n    \/\/strcpy( *longDate, asctime ( today ));\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for constructing the email body\r\n\/\/\/\r\n\/\/\/ @param[in]  additionalRecepient  Recepient to be addedd\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::ConstructEmailBody( std::string& messageBody, bool_t& readyToBeSent)\r\n{   \r\n    const char* greeting = \"\";\r\n    int16_t currentMonth = 0;\r\n    int16_t currentDay = 0;\r\n    std::string longDate = \"\";\r\n    GetDate( currentMonth, currentDay, longDate );\r\n\r\n    messageBody.append( \"\\n\" ); \r\n    messageBody.append( longDate );\r\n    messageBody.append( \"-------------------------------------\\n\" );\r\n    messageBody.append( \"Hi:\\n\\n\" );\r\n    messageBody.append( \"The following items are due soon:\\n\\n\" );\r\n    \r\n    for (Table_t::iterator location =  reminderTable.begin(); location != reminderTable.end(); location++ )\r\n    {   \r\n        std::string itemDate = location->second;\r\n        std::string itemName = location->first;\r\n        std::string delimiter = \"\/\";\r\n        size_t delimiterPosition = itemDate.find(delimiter);\r\n        std::string dueMonth = itemDate.substr( 0, delimiterPosition );\r\n        std::string dueDay = itemDate.substr( delimiterPosition + 1, std::string::npos );\r\n\r\n          \/\/std::cout << \" here2 -->\"  << DAYS_IN_A_MONTH + atoi( dueDay.c_str() ) << std::endl;\r\n        if ( currentDay == atoi( dueDay.c_str() ) - NOTIFICATION_HEAD_START && dueMonth.compare( \"00\" ) == 0 || \r\n             ( ( atoi(dueDay.c_str()) - NOTIFICATION_HEAD_START < 0 ) && \r\n               ( currentDay == DAYS_IN_A_MONTH + atoi(dueDay.c_str()) - NOTIFICATION_HEAD_START ) ) || \r\n              \/\/ Check is b\r\n             ( currentMonth == atoi( dueMonth.c_str() )  && currentDay == atoi( dueDay.c_str() ) - NOTIFICATION_HEAD_START ) )\r\n        {\r\n            \/\/ Bill is due this month and notification can be done this month\r\n            if ( dueMonth.compare( \"00\" ) == 0 &&  atoi(dueDay.c_str()) - NOTIFICATION_HEAD_START > 0)\r\n            {\r\n                itemDate = std::to_string( currentMonth ) + \"\/\" + dueDay;\r\n                messageBody.append( itemName + \" is due on \" +  itemDate  );\r\n                readyToBeSent = 1;\r\n            }\r\n            \/\/ Bill is due early next month and notification has to be done late this month\r\n            else if ( dueMonth.compare( \"00\" ) == 0 && atoi(dueDay.c_str()) - NOTIFICATION_HEAD_START < 0 ) \r\n            {\r\n                itemDate = std::to_string( currentMonth + 1 ) + \"\/\" + dueDay;\r\n                messageBody.append( itemName + \" is due on \" +  itemDate  );\r\n                readyToBeSent = 1;\r\n            }\r\n            \/\/ Bill month has been specified\r\n            else\r\n            {\r\n               messageBody.append( itemName + \" is due on \" +  itemDate  );\r\n               readyToBeSent = 1;\r\n            }\r\n\r\n            messageBody.append(\"\\n\");\r\n        }\r\n\t}\r\n    \r\n    messageBody.append( \"\\n\" );\r\n    messageBody.append( \"Adios,\\n\" );\r\n    messageBody.append( \"ReminderBot\" );\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for sending a notification email\r\n\/\/\/\r\n\/\/\/ @param[in]  message    Message object containing email details \r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::SendEmail( const Message& message )\r\n{\r\n    bool_t readyToBeSent = 0;\r\n    std::string messageBody;\r\n    const char* cstrRecepientEmail = message.recepientEmail.c_str();\r\n    const char* cstrSenderEmail = message.senderEmail.c_str();\r\n    const char* cstrSubject = message.subject.c_str();\r\n    const char* cstrUsername = message.senderEmail.c_str();\r\n    const char* cstrPassword = message.senderPassword.c_str();\r\n    const char* cstrSmtpServer = message.smtpServer.c_str();    \r\n    \r\n    quickmail_initialize();\r\n    mailObject = quickmail_create( cstrSenderEmail, cstrSubject );\r\n    quickmail_add_to( mailObject, cstrRecepientEmail );\r\n    quickmail_set_from( mailObject, cstrSenderEmail );\r\n    quickmail_set_subject( mailObject, cstrSubject );\r\n    quickmail_add_header( mailObject, cstrSubject );\r\n    \r\n    ConstructEmailBody( messageBody, readyToBeSent );\r\n    quickmail_set_body( mailObject, messageBody.c_str() );\r\n\r\n    \/\/ Send the email\r\n    if ( readyToBeSent == 1 )\r\n    {\r\n        quickmail_send( mailObject, cstrSmtpServer, message.smtpPort, cstrUsername, cstrPassword );\r\n    }\r\n}\r\n                                                                      \r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for dumping data from the tables\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::DumpTable( void )\r\n{\r\n    for ( Table_t::iterator location =  reminderTable.begin(); location != reminderTable.end(); location++ )\r\n    {\r\n        std::cout << \"reminderTable[\" << location->first << \"] = \" << location->second << std::endl;\r\n    }\r\n}\r\n<commit_msg>Updates for debugging<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ @file\r\n\/\/\/\r\n\/\/\/ Class Definition for Reminder\r\n\/\/\/\r\n\/\/\/ @ingroup Reminder_Library\r\n\/\/\/\r\n\/\/\/ @par Copyright (c) 2014 George Nyarangi. All rights reserved.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n#include <iostream>\r\n#include <algorithm>\r\n#include <fstream>\r\n#include <string>\r\n#include <sstream>  \r\n#include <string.h>\r\n#include <time.h>\r\n\r\n#include \"ReminderTypes.hpp\"\r\n#include \"Reminder.hpp\"\r\n#include \"quickmail.h\"\r\n#include \"Types.hpp\"\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Reminder constructor\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nReminder::Reminder()\r\n{\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Overloaded Reminder constructor; Allows 'reminderTable' to be initialized\r\n\/\/\/ when the 'Reminder' class object is instantiated, i.e.,\r\n\/\/\/ Reminder myReminder ( myTable )\r\n\/\/\/\r\n\/\/\/ @param[in]  reminderTable   Table where all data will be stored    \r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nReminder::Reminder( Table_t& reminderTable )\r\n{\r\n    this->reminderTable = reminderTable;\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Reminder destructor.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nReminder::~Reminder()\r\n{\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for reading an input file\r\n\/\/\/\r\n\/\/\/ @param[in]  fileName        Name of the file containing the data \r\n\/\/\/\r\n\/\/\/ @return     ReminderStatus  Status indicating success\/failure\r\n\/\/\/\r\n\/\/\/ @retval     REMINDER_STATUS_PASS    \r\n\/\/\/             REMINDER_STATUS_FAIL\r\n\/\/\/\r\n\/\/\/ @test        Reminder_ReadFile.cpp\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nReminderStatus Reminder::ReadFile( const std::string& fileName )\r\n{\r\n    std::string line;\r\n    std::string key;\r\n    std::string value;\r\n    ReminderStatus readFileStatus = REMINDER_STATUS_FAIL;\r\n\r\n    \/\/\/ @future Refactor ReadFile() to utilize a CSV reader library\r\n    std::ifstream myFile;\r\n    myFile.open( fileName, std::ifstream::in );\r\n\r\n    if ( myFile.is_open() )\r\n    {\r\n        uint32_t datumPosition = 1;\r\n        while ( std::getline( myFile, line, ',') )\r\n        {\r\n            \/\/ Remove spaces from strings\r\n            line.erase( std::remove_if( line.begin(), line.end(), ::isspace ), line.end() );\r\n            \/\/ Check if datum position is odd\r\n            if (datumPosition % 2) \r\n            { \r\n                key = line;\r\n            } \r\n            else \r\n            {\r\n                value = line;\r\n                reminderTable.insert( std::pair<std::string, std::string>( key, value ) );\r\n                \r\n                readFileStatus = REMINDER_STATUS_PASS;\r\n            }\r\n\r\n            datumPosition++;\r\n        }\r\n        \r\n        myFile.close();\r\n    }\r\n    \r\n    return readFileStatus;\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for adding an email recepient to the \"to\" field\r\n\/\/\/\r\n\/\/\/ @param[in]  additionalRecepient  Recepient to be addedd\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::AddRecepient( std::string additionalRecepient )\r\n{\r\n    const char* cstrAdditionalRecepient = additionalRecepient.c_str();\r\n    quickmail_add_to ( mailObject, cstrAdditionalRecepient );\r\n}  \r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for getting date metadata\r\n\/\/\/\r\n\/\/\/param[in, out]  currentMonth  The current month\r\n\/\/\/param[in, out]  currentDay    The current day\r\n\/\/\/param[in, out]  longDate      Long date (Www Mmm dd hh:mm:ss yyyy)\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::GetDate( int16_t& currentMonth, int16_t& currentDay, std::string& longDate )\r\n{\r\n    time_t rawTime;\r\n    time( &rawTime );\r\n    today = localtime( &rawTime );\r\n    currentMonth = today->tm_mon + 1;\r\n    currentDay = today->tm_mday;\r\n    longDate = asctime ( today );\r\n    \/\/strcpy( *longDate, asctime ( today ));\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for constructing the email body\r\n\/\/\/\r\n\/\/\/ @param[in]  additionalRecepient  Recepient to be addedd\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::ConstructEmailBody( std::string& messageBody, bool_t& readyToBeSent)\r\n{   \r\n    const char* greeting = \"\";\r\n    int16_t currentMonth = 0;\r\n    int16_t currentDay = 0;\r\n    std::string longDate = \"\";\r\n    GetDate( currentMonth, currentDay, longDate );\r\n\r\n    messageBody.append( \"\\n\" ); \r\n    messageBody.append( longDate );\r\n    messageBody.append( \"-------------------------------------\\n\" );\r\n    messageBody.append( \"Hi:\\n\\n\" );\r\n    messageBody.append( \"The following items are due soon:\\n\\n\" );\r\n    \r\n    for (Table_t::iterator location =  reminderTable.begin(); location != reminderTable.end(); location++ )\r\n    {   \r\n        std::string itemDate = location->second;\r\n        std::string itemName = location->first;\r\n        std::string delimiter = \"\/\";\r\n        size_t delimiterPosition = itemDate.find(delimiter);\r\n        std::string dueMonth = itemDate.substr( 0, delimiterPosition );\r\n        std::string dueDay = itemDate.substr( delimiterPosition + 1, std::string::npos );\r\n\r\n          \/\/std::cout << \" here2 -->\"  << DAYS_IN_A_MONTH + atoi( dueDay.c_str() ) << std::endl;\r\n        if ( currentDay == atoi( dueDay.c_str() ) - NOTIFICATION_HEAD_START && dueMonth.compare( \"00\" ) == 0 || \r\n             ( ( atoi(dueDay.c_str()) - NOTIFICATION_HEAD_START < 0 ) && \r\n               ( currentDay == DAYS_IN_A_MONTH + atoi(dueDay.c_str()) - NOTIFICATION_HEAD_START ) ) || \r\n              \/\/ Check is b\r\n             ( currentMonth == atoi( dueMonth.c_str() )  && currentDay == atoi( dueDay.c_str() ) - NOTIFICATION_HEAD_START ) )\r\n        {\r\n            \/\/ Bill is due this month and notification can be done this month\r\n            if ( dueMonth.compare( \"00\" ) == 0 &&  atoi(dueDay.c_str()) - NOTIFICATION_HEAD_START > 0)\r\n            {\r\n                itemDate = std::to_string( currentMonth ) + \"\/\" + dueDay;\r\n                messageBody.append( itemName + \" is due on \" +  itemDate  );\r\n                readyToBeSent = 1;\r\n            }\r\n            \/\/ Bill is due early next month and notification has to be done late this month\r\n            else if ( dueMonth.compare( \"00\" ) == 0 && atoi(dueDay.c_str()) - NOTIFICATION_HEAD_START < 0 ) \r\n            {\r\n                itemDate = std::to_string( currentMonth + 1 ) + \"\/\" + dueDay;\r\n                messageBody.append( itemName + \" is due on \" +  itemDate  );\r\n                readyToBeSent = 1;\r\n            }\r\n            \/\/ Bill month has been specified\r\n            else\r\n            {\r\n               messageBody.append( itemName + \" is due on \" +  itemDate  );\r\n               readyToBeSent = 1;\r\n            }\r\n\r\n            messageBody.append(\"\\n\");\r\n        }\r\n\t}\r\n    \r\n    messageBody.append( \"\\n\" );\r\n    messageBody.append( \"Adios,\\n\" );\r\n    messageBody.append( \"ReminderBot\" );\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for sending a notification email\r\n\/\/\/\r\n\/\/\/ @param[in]  message    Message object containing email details \r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::SendEmail( const Message& message )\r\n{\r\n    bool_t readyToBeSent = 0;\r\n    std::string messageBody;\r\n    const char* cstrRecepientEmail = message.recepientEmail.c_str();\r\n    const char* cstrSenderEmail = message.senderEmail.c_str();\r\n    const char* cstrSubject = message.subject.c_str();\r\n    const char* cstrUsername = message.senderEmail.c_str();\r\n    const char* cstrPassword = message.senderPassword.c_str();\r\n    const char* cstrSmtpServer = message.smtpServer.c_str();    \r\n    \r\n    quickmail_initialize();\r\n    mailObject = quickmail_create( cstrSenderEmail, cstrSubject );\r\n    quickmail_add_to( mailObject, cstrRecepientEmail );\r\n    quickmail_set_from( mailObject, cstrSenderEmail );\r\n    quickmail_set_subject( mailObject, cstrSubject );\r\n    quickmail_add_header( mailObject, cstrSubject );\r\n    \r\n    ConstructEmailBody( messageBody, readyToBeSent );\r\n    std::cout << \"message = \\n\" << messageBody << std::endl;\r\n    quickmail_set_body( mailObject, messageBody.c_str() );\r\n\r\n    \/\/ Send the email\r\n    if ( readyToBeSent == 1 )\r\n    {\r\n        \/\/quickmail_send( mailObject, cstrSmtpServer, message.smtpPort, cstrUsername, cstrPassword );\r\n    }\r\n}\r\n                                                                      \r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/ Method for dumping data from the tables\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Reminder::DumpTable( void )\r\n{\r\n    for ( Table_t::iterator location =  reminderTable.begin(); location != reminderTable.end(); location++ )\r\n    {\r\n        std::cout << \"reminderTable[\" << location->first << \"] = \" << location->second << std::endl;\r\n    }\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project                                 *\n ******************************************************************************\n * Copyright 2014 Ben Vanik. All rights reserved.                             *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include <gflags\/gflags.h>\n\n#include <string>\n\n\/\/ NOTE: this must be included before microprofile as macro expansion needs\n\/\/ XELOGI.\n#include \"xenia\/base\/logging.h\"\n\n\/\/ NOTE: microprofile must be setup first, before profiling.h is included.\n#define MICROPROFILE_ENABLED 1\n#define MICROPROFILEUI_ENABLED 1\n#define MICROPROFILE_IMPL 1\n#define MICROPROFILEUI_IMPL 1\n#define MICROPROFILE_PER_THREAD_BUFFER_SIZE (1024 * 1024 * 10)\n#define MICROPROFILE_USE_THREAD_NAME_CALLBACK 1\n#define MICROPROFILE_WEBSERVER_MAXFRAMES 3\n#define MICROPROFILE_PRINTF XELOGI\n#define MICROPROFILE_WEBSERVER 0\n#define MICROPROFILE_DEBUG 0\n#define MICROPROFILE_MAX_THREADS 128\n#include \"third_party\/microprofile\/microprofile.h\"\n\n#include \"xenia\/base\/assert.h\"\n#include \"xenia\/base\/profiling.h\"\n#include \"xenia\/ui\/window.h\"\n\n#if XE_OPTION_PROFILING\n#include \"third_party\/microprofile\/microprofileui.h\"\n#endif  \/\/ XE_OPTION_PROFILING\n\n#if XE_OPTION_PROFILING_UI\n#undef DrawText\n#include \"xenia\/ui\/microprofile_drawer.h\"\n#endif  \/\/ XE_OPTION_PROFILING_UI\n\nDEFINE_bool(show_profiler, false, \"Show profiling UI by default.\");\n\nnamespace xe {\n\nui::Window* Profiler::window_ = nullptr;\nstd::unique_ptr<ui::MicroprofileDrawer> Profiler::drawer_ = nullptr;\n\n#if XE_OPTION_PROFILING\n\nbool Profiler::is_enabled() { return true; }\n\nbool Profiler::is_visible() { return is_enabled() && MicroProfileIsDrawing(); }\n\nvoid Profiler::Initialize() {\n  \/\/ Custom groups.\n  MicroProfileSetEnableAllGroups(false);\n  MicroProfileForceEnableGroup(\"apu\", MicroProfileTokenTypeCpu);\n  MicroProfileForceEnableGroup(\"cpu\", MicroProfileTokenTypeCpu);\n  MicroProfileForceEnableGroup(\"gpu\", MicroProfileTokenTypeCpu);\n  MicroProfileForceEnableGroup(\"internal\", MicroProfileTokenTypeCpu);\n  g_MicroProfile.nGroupMask = g_MicroProfile.nForceGroup;\n  g_MicroProfile.nActiveGroup = g_MicroProfile.nActiveGroupWanted =\n      g_MicroProfile.nGroupMask;\n\n  \/\/ Custom timers: time, average.\n  g_MicroProfile.nBars |= 0x1 | 0x2;\n  g_MicroProfile.nActiveBars |= 0x1 | 0x2;\n\n#if XE_OPTION_PROFILING_UI\n  MicroProfileInitUI();\n  g_MicroProfileUI.bShowSpikes = true;\n  g_MicroProfileUI.nOpacityBackground = 0x40u << 24;\n  g_MicroProfileUI.nOpacityForeground = 0xc0u << 24;\n  if (FLAGS_show_profiler) {\n    MicroProfileSetDisplayMode(1);\n  }\n#else\n  MicroProfileSetForceEnable(true);\n  MicroProfileSetEnableAllGroups(true);\n  MicroProfileSetForceMetaCounters(false);\n#endif  \/\/ XE_OPTION_PROFILING_UI\n}\n\nvoid Profiler::Dump() {\n#if XE_OPTION_PROFILING_UI\n  MicroProfileDumpTimers();\n#endif  \/\/ XE_OPTION_PROFILING_UI\n  MicroProfileDumpHtml(\"profile.html\");\n  MicroProfileDumpHtmlToFile();\n}\n\nvoid Profiler::Shutdown() {\n  drawer_.reset();\n  window_ = nullptr;\n  MicroProfileShutdown();\n}\n\nuint32_t Profiler::GetColor(const char* str) {\n  std::hash<std::string> fn;\n  size_t value = fn(str);\n  return value & 0xFFFFFF;\n}\n\nvoid Profiler::ThreadEnter(const char* name) {\n  MicroProfileOnThreadCreate(name);\n}\n\nvoid Profiler::ThreadExit() { MicroProfileOnThreadExit(); }\n\nbool Profiler::OnKeyDown(int key_code) {\n  \/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/dd375731(v=vs.85).aspx\n  switch (key_code) {\n    case VK_OEM_3:  \/\/ `\n      MicroProfileTogglePause();\n      return true;\n#if XE_OPTION_PROFILING_UI\n    case VK_TAB:\n      MicroProfileToggleDisplayMode();\n      return true;\n    case 0x31:  \/\/ 1\n      MicroProfileModKey(1);\n      return true;\n#endif  \/\/ XE_OPTION_PROFILING_UI\n  }\n  return false;\n}\n\nbool Profiler::OnKeyUp(int key_code) {\n  switch (key_code) {\n#if XE_OPTION_PROFILING_UI\n    case 0x31:  \/\/ 1\n      MicroProfileModKey(0);\n      return true;\n#endif  \/\/ XE_OPTION_PROFILING_UI\n  }\n  return false;\n}\n\n#if XE_OPTION_PROFILING_UI\n\nvoid Profiler::OnMouseDown(bool left_button, bool right_button) {\n  MicroProfileMouseButton(left_button, right_button);\n}\n\nvoid Profiler::OnMouseUp() { MicroProfileMouseButton(0, 0); }\n\nvoid Profiler::OnMouseMove(int x, int y) { MicroProfileMousePosition(x, y, 0); }\n\nvoid Profiler::OnMouseWheel(int x, int y, int dy) {\n  MicroProfileMousePosition(x, y, dy);\n}\n\nvoid Profiler::ToggleDisplay() { MicroProfileToggleDisplayMode(); }\n\nvoid Profiler::TogglePause() { MicroProfileTogglePause(); }\n\n#else\n\nvoid Profiler::OnMouseDown(bool left_button, bool right_button) {}\n\nvoid Profiler::OnMouseUp() {}\n\nvoid Profiler::OnMouseMove(int x, int y) {}\n\nvoid Profiler::OnMouseWheel(int x, int y, int dy) {}\n\nvoid Profiler::ToggleDisplay() {}\n\nvoid Profiler::TogglePause() {}\n\n#endif  \/\/ XE_OPTION_PROFILING_UI\n\nvoid Profiler::set_window(ui::Window* window) {\n  assert_null(window_);\n  if (!window) {\n    return;\n  }\n  window_ = window;\n  drawer_ = std::make_unique<ui::MicroprofileDrawer>(window);\n\n  window_->on_painted.AddListener([](ui::UIEvent* e) { Profiler::Present(); });\n\n  \/\/ Pass through mouse events.\n  window_->on_mouse_down.AddListener([](ui::MouseEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnMouseDown(e->button() == ui::MouseEvent::Button::kLeft,\n                            e->button() == ui::MouseEvent::Button::kRight);\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n  window_->on_mouse_up.AddListener([](ui::MouseEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnMouseUp();\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n  window_->on_mouse_move.AddListener([](ui::MouseEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnMouseMove(e->x(), e->y());\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n  window_->on_mouse_wheel.AddListener([](ui::MouseEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnMouseWheel(e->x(), e->y(), -e->dy());\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n\n  \/\/ Watch for toggle\/mode keys and such.\n  window_->on_key_down.AddListener([](ui::KeyEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnKeyDown(e->key_code());\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n  window_->on_key_up.AddListener([](ui::KeyEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnKeyUp(e->key_code());\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n}\n\nvoid Profiler::Present() {\n  SCOPE_profile_cpu_f(\"internal\");\n  MicroProfileFlip();\n#if XE_OPTION_PROFILING_UI\n  if (!window_ || !drawer_) {\n    return;\n  }\n  drawer_->Begin();\n  MicroProfileDraw(window_->width(), window_->height());\n  drawer_->End();\n#endif  \/\/ XE_OPTION_PROFILING_UI\n}\n\n#else\n\nbool Profiler::is_enabled() { return false; }\nbool Profiler::is_visible() { return false; }\nvoid Profiler::Initialize() {}\nvoid Profiler::Dump() {}\nvoid Profiler::Shutdown() {}\nuint32_t Profiler::GetColor(const char* str) { return 0; }\nvoid Profiler::ThreadEnter(const char* name) {}\nvoid Profiler::ThreadExit() {}\nbool Profiler::OnKeyDown(int key_code) { return false; }\nbool Profiler::OnKeyUp(int key_code) { return false; }\nvoid Profiler::OnMouseDown(bool left_button, bool right_button) {}\nvoid Profiler::OnMouseUp() {}\nvoid Profiler::OnMouseMove(int x, int y) {}\nvoid Profiler::OnMouseWheel(int x, int y, int dy) {}\nvoid Profiler::ToggleDisplay() {}\nvoid Profiler::TogglePause() {}\nvoid Profiler::set_window(ui::Window* window) {}\nvoid Profiler::Present() {}\n\n#endif  \/\/ XE_OPTION_PROFILING\n\n}  \/\/ namespace xe\n\n#if XE_OPTION_PROFILING\n\nuint32_t MicroProfileGpuInsertTimeStamp() { return 0; }\n\nuint64_t MicroProfileGpuGetTimeStamp(uint32_t nKey) { return 0; }\n\nuint64_t MicroProfileTicksPerSecondGpu() { return 0; }\n\nconst char* MicroProfileGetThreadName() { return \"TODO: get thread name!\"; }\n\n#if XE_OPTION_PROFILING_UI\n\nvoid MicroProfileDrawBox(int nX, int nY, int nX1, int nY1, uint32_t nColor,\n                         MicroProfileBoxType type) {\n  auto drawer = xe::Profiler::drawer();\n  if (!drawer) {\n    return;\n  }\n  drawer->DrawBox(nX, nY, nX1, nY1, nColor,\n                  static_cast<xe::ui::MicroprofileDrawer::BoxType>(type));\n}\n\nvoid MicroProfileDrawLine2D(uint32_t nVertices, float* pVertices,\n                            uint32_t nColor) {\n  auto drawer = xe::Profiler::drawer();\n  if (!drawer) {\n    return;\n  }\n  drawer->DrawLine2D(nVertices, pVertices, nColor);\n}\n\nvoid MicroProfileDrawText(int nX, int nY, uint32_t nColor, const char* pText,\n                          uint32_t nLen) {\n  auto drawer = xe::Profiler::drawer();\n  if (!drawer) {\n    return;\n  }\n  drawer->DrawText(nX, nY, nColor, pText, nLen);\n}\n\n#endif  \/\/ XE_OPTION_PROFILING_UI\n\n#endif  \/\/ XE_OPTION_PROFILING\n<commit_msg>Fixing builds when profiling is disabled.<commit_after>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project                                 *\n ******************************************************************************\n * Copyright 2014 Ben Vanik. All rights reserved.                             *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include <gflags\/gflags.h>\n\n#include <string>\n\n\/\/ NOTE: this must be included before microprofile as macro expansion needs\n\/\/ XELOGI.\n#include \"xenia\/base\/logging.h\"\n\n\/\/ NOTE: microprofile must be setup first, before profiling.h is included.\n#define MICROPROFILE_ENABLED 1\n#define MICROPROFILEUI_ENABLED 1\n#define MICROPROFILE_IMPL 1\n#define MICROPROFILEUI_IMPL 1\n#define MICROPROFILE_PER_THREAD_BUFFER_SIZE (1024 * 1024 * 10)\n#define MICROPROFILE_USE_THREAD_NAME_CALLBACK 1\n#define MICROPROFILE_WEBSERVER_MAXFRAMES 3\n#define MICROPROFILE_PRINTF XELOGI\n#define MICROPROFILE_WEBSERVER 0\n#define MICROPROFILE_DEBUG 0\n#define MICROPROFILE_MAX_THREADS 128\n#include \"third_party\/microprofile\/microprofile.h\"\n\n#include \"xenia\/base\/assert.h\"\n#include \"xenia\/base\/profiling.h\"\n#include \"xenia\/ui\/window.h\"\n\n#if XE_OPTION_PROFILING\n#include \"third_party\/microprofile\/microprofileui.h\"\n#endif  \/\/ XE_OPTION_PROFILING\n\n#if XE_OPTION_PROFILING_UI\n#undef DrawText\n#include \"xenia\/ui\/microprofile_drawer.h\"\n#endif  \/\/ XE_OPTION_PROFILING_UI\n\nDEFINE_bool(show_profiler, false, \"Show profiling UI by default.\");\n\nnamespace xe {\n\n#if XE_OPTION_PROFILING_UI\nui::Window* Profiler::window_ = nullptr;\nstd::unique_ptr<ui::MicroprofileDrawer> Profiler::drawer_ = nullptr;\n#endif  \/\/ XE_OPTION_PROFILING_UI\n\n#if XE_OPTION_PROFILING\n\nbool Profiler::is_enabled() { return true; }\n\nbool Profiler::is_visible() { return is_enabled() && MicroProfileIsDrawing(); }\n\nvoid Profiler::Initialize() {\n  \/\/ Custom groups.\n  MicroProfileSetEnableAllGroups(false);\n  MicroProfileForceEnableGroup(\"apu\", MicroProfileTokenTypeCpu);\n  MicroProfileForceEnableGroup(\"cpu\", MicroProfileTokenTypeCpu);\n  MicroProfileForceEnableGroup(\"gpu\", MicroProfileTokenTypeCpu);\n  MicroProfileForceEnableGroup(\"internal\", MicroProfileTokenTypeCpu);\n  g_MicroProfile.nGroupMask = g_MicroProfile.nForceGroup;\n  g_MicroProfile.nActiveGroup = g_MicroProfile.nActiveGroupWanted =\n      g_MicroProfile.nGroupMask;\n\n  \/\/ Custom timers: time, average.\n  g_MicroProfile.nBars |= 0x1 | 0x2;\n  g_MicroProfile.nActiveBars |= 0x1 | 0x2;\n\n#if XE_OPTION_PROFILING_UI\n  MicroProfileInitUI();\n  g_MicroProfileUI.bShowSpikes = true;\n  g_MicroProfileUI.nOpacityBackground = 0x40u << 24;\n  g_MicroProfileUI.nOpacityForeground = 0xc0u << 24;\n  if (FLAGS_show_profiler) {\n    MicroProfileSetDisplayMode(1);\n  }\n#else\n  MicroProfileSetForceEnable(true);\n  MicroProfileSetEnableAllGroups(true);\n  MicroProfileSetForceMetaCounters(false);\n#endif  \/\/ XE_OPTION_PROFILING_UI\n}\n\nvoid Profiler::Dump() {\n#if XE_OPTION_PROFILING_UI\n  MicroProfileDumpTimers();\n#endif  \/\/ XE_OPTION_PROFILING_UI\n  MicroProfileDumpHtml(\"profile.html\");\n  MicroProfileDumpHtmlToFile();\n}\n\nvoid Profiler::Shutdown() {\n  drawer_.reset();\n  window_ = nullptr;\n  MicroProfileShutdown();\n}\n\nuint32_t Profiler::GetColor(const char* str) {\n  std::hash<std::string> fn;\n  size_t value = fn(str);\n  return value & 0xFFFFFF;\n}\n\nvoid Profiler::ThreadEnter(const char* name) {\n  MicroProfileOnThreadCreate(name);\n}\n\nvoid Profiler::ThreadExit() { MicroProfileOnThreadExit(); }\n\nbool Profiler::OnKeyDown(int key_code) {\n  \/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/dd375731(v=vs.85).aspx\n  switch (key_code) {\n    case VK_OEM_3:  \/\/ `\n      MicroProfileTogglePause();\n      return true;\n#if XE_OPTION_PROFILING_UI\n    case VK_TAB:\n      MicroProfileToggleDisplayMode();\n      return true;\n    case 0x31:  \/\/ 1\n      MicroProfileModKey(1);\n      return true;\n#endif  \/\/ XE_OPTION_PROFILING_UI\n  }\n  return false;\n}\n\nbool Profiler::OnKeyUp(int key_code) {\n  switch (key_code) {\n#if XE_OPTION_PROFILING_UI\n    case 0x31:  \/\/ 1\n      MicroProfileModKey(0);\n      return true;\n#endif  \/\/ XE_OPTION_PROFILING_UI\n  }\n  return false;\n}\n\n#if XE_OPTION_PROFILING_UI\n\nvoid Profiler::OnMouseDown(bool left_button, bool right_button) {\n  MicroProfileMouseButton(left_button, right_button);\n}\n\nvoid Profiler::OnMouseUp() { MicroProfileMouseButton(0, 0); }\n\nvoid Profiler::OnMouseMove(int x, int y) { MicroProfileMousePosition(x, y, 0); }\n\nvoid Profiler::OnMouseWheel(int x, int y, int dy) {\n  MicroProfileMousePosition(x, y, dy);\n}\n\nvoid Profiler::ToggleDisplay() { MicroProfileToggleDisplayMode(); }\n\nvoid Profiler::TogglePause() { MicroProfileTogglePause(); }\n\n#else\n\nvoid Profiler::OnMouseDown(bool left_button, bool right_button) {}\n\nvoid Profiler::OnMouseUp() {}\n\nvoid Profiler::OnMouseMove(int x, int y) {}\n\nvoid Profiler::OnMouseWheel(int x, int y, int dy) {}\n\nvoid Profiler::ToggleDisplay() {}\n\nvoid Profiler::TogglePause() {}\n\n#endif  \/\/ XE_OPTION_PROFILING_UI\n\nvoid Profiler::set_window(ui::Window* window) {\n  assert_null(window_);\n  if (!window) {\n    return;\n  }\n  window_ = window;\n  drawer_ = std::make_unique<ui::MicroprofileDrawer>(window);\n\n  window_->on_painted.AddListener([](ui::UIEvent* e) { Profiler::Present(); });\n\n  \/\/ Pass through mouse events.\n  window_->on_mouse_down.AddListener([](ui::MouseEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnMouseDown(e->button() == ui::MouseEvent::Button::kLeft,\n                            e->button() == ui::MouseEvent::Button::kRight);\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n  window_->on_mouse_up.AddListener([](ui::MouseEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnMouseUp();\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n  window_->on_mouse_move.AddListener([](ui::MouseEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnMouseMove(e->x(), e->y());\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n  window_->on_mouse_wheel.AddListener([](ui::MouseEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnMouseWheel(e->x(), e->y(), -e->dy());\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n\n  \/\/ Watch for toggle\/mode keys and such.\n  window_->on_key_down.AddListener([](ui::KeyEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnKeyDown(e->key_code());\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n  window_->on_key_up.AddListener([](ui::KeyEvent* e) {\n    if (Profiler::is_visible()) {\n      Profiler::OnKeyUp(e->key_code());\n      e->set_handled(true);\n      window_->Invalidate();\n    }\n  });\n}\n\nvoid Profiler::Present() {\n  SCOPE_profile_cpu_f(\"internal\");\n  MicroProfileFlip();\n#if XE_OPTION_PROFILING_UI\n  if (!window_ || !drawer_) {\n    return;\n  }\n  drawer_->Begin();\n  MicroProfileDraw(window_->width(), window_->height());\n  drawer_->End();\n#endif  \/\/ XE_OPTION_PROFILING_UI\n}\n\n#else\n\nbool Profiler::is_enabled() { return false; }\nbool Profiler::is_visible() { return false; }\nvoid Profiler::Initialize() {}\nvoid Profiler::Dump() {}\nvoid Profiler::Shutdown() {}\nuint32_t Profiler::GetColor(const char* str) { return 0; }\nvoid Profiler::ThreadEnter(const char* name) {}\nvoid Profiler::ThreadExit() {}\nbool Profiler::OnKeyDown(int key_code) { return false; }\nbool Profiler::OnKeyUp(int key_code) { return false; }\nvoid Profiler::OnMouseDown(bool left_button, bool right_button) {}\nvoid Profiler::OnMouseUp() {}\nvoid Profiler::OnMouseMove(int x, int y) {}\nvoid Profiler::OnMouseWheel(int x, int y, int dy) {}\nvoid Profiler::ToggleDisplay() {}\nvoid Profiler::TogglePause() {}\nvoid Profiler::set_window(ui::Window* window) {}\nvoid Profiler::Present() {}\n\n#endif  \/\/ XE_OPTION_PROFILING\n\n}  \/\/ namespace xe\n\n#if XE_OPTION_PROFILING\n\nuint32_t MicroProfileGpuInsertTimeStamp() { return 0; }\n\nuint64_t MicroProfileGpuGetTimeStamp(uint32_t nKey) { return 0; }\n\nuint64_t MicroProfileTicksPerSecondGpu() { return 0; }\n\nconst char* MicroProfileGetThreadName() { return \"TODO: get thread name!\"; }\n\n#if XE_OPTION_PROFILING_UI\n\nvoid MicroProfileDrawBox(int nX, int nY, int nX1, int nY1, uint32_t nColor,\n                         MicroProfileBoxType type) {\n  auto drawer = xe::Profiler::drawer();\n  if (!drawer) {\n    return;\n  }\n  drawer->DrawBox(nX, nY, nX1, nY1, nColor,\n                  static_cast<xe::ui::MicroprofileDrawer::BoxType>(type));\n}\n\nvoid MicroProfileDrawLine2D(uint32_t nVertices, float* pVertices,\n                            uint32_t nColor) {\n  auto drawer = xe::Profiler::drawer();\n  if (!drawer) {\n    return;\n  }\n  drawer->DrawLine2D(nVertices, pVertices, nColor);\n}\n\nvoid MicroProfileDrawText(int nX, int nY, uint32_t nColor, const char* pText,\n                          uint32_t nLen) {\n  auto drawer = xe::Profiler::drawer();\n  if (!drawer) {\n    return;\n  }\n  drawer->DrawText(nX, nY, nColor, pText, nLen);\n}\n\n#endif  \/\/ XE_OPTION_PROFILING_UI\n\n#endif  \/\/ XE_OPTION_PROFILING\n<|endoftext|>"}
{"text":"<commit_before>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project                                 *\n ******************************************************************************\n * Copyright 2015 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\/gpu\/trace_dump.h\"\n\n#include <gflags\/gflags.h>\n\n#include \"third_party\/stb\/stb_image_write.h\"\n#include \"xenia\/base\/logging.h\"\n#include \"xenia\/base\/profiling.h\"\n#include \"xenia\/base\/string.h\"\n#include \"xenia\/base\/threading.h\"\n#include \"xenia\/gpu\/command_processor.h\"\n#include \"xenia\/gpu\/graphics_system.h\"\n#include \"xenia\/memory.h\"\n#include \"xenia\/ui\/file_picker.h\"\n#include \"xenia\/ui\/window.h\"\n#include \"xenia\/xbox.h\"\n\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n#undef _CRT_SECURE_NO_WARNINGS\n#undef _CRT_NONSTDC_NO_DEPRECATE\n#include \"third_party\/stb\/stb_image_write.h\"\n\nDEFINE_string(target_trace_file, \"\", \"Specifies the trace file to load.\");\nDEFINE_string(trace_dump_path, \"\", \"Output path for dumped files.\");\n\nnamespace xe {\nnamespace gpu {\n\nusing namespace xe::gpu::xenos;\n\nTraceDump::TraceDump() = default;\n\nTraceDump::~TraceDump() = default;\n\nint TraceDump::Main(const std::vector<std::wstring>& args) {\n  \/\/ Grab path from the flag or unnamed argument.\n  std::wstring path;\n  if (!FLAGS_target_trace_file.empty()) {\n    \/\/ Passed as a named argument.\n    \/\/ TODO(benvanik): find something better than gflags that supports\n    \/\/ unicode.\n    path = xe::to_wstring(FLAGS_target_trace_file);\n  } else if (args.size() >= 2) {\n    \/\/ Passed as an unnamed argument.\n    path = args[1];\n  } else {\n    \/\/ Open a file chooser and ask the user.\n    auto file_picker = xe::ui::FilePicker::Create();\n    file_picker->set_mode(ui::FilePicker::Mode::kOpen);\n    file_picker->set_type(ui::FilePicker::Type::kFile);\n    file_picker->set_multi_selection(false);\n    file_picker->set_title(L\"Select Trace File\");\n    file_picker->set_extensions({\n        {L\"Supported Files\", L\"*.xenia_gpu_trace\"},\n        {L\"All Files (*.*)\", L\"*.*\"},\n    });\n    if (file_picker->Show()) {\n      auto selected_files = file_picker->selected_files();\n      if (!selected_files.empty()) {\n        path = selected_files[0];\n      }\n    }\n  }\n\n  if (path.empty()) {\n    xe::FatalError(\"No trace file specified\");\n    return 1;\n  }\n\n  \/\/ Normalize the path and make absolute.\n  auto abs_path = xe::to_absolute_path(path);\n  XELOGI(\"Loading trace file %ls...\", abs_path.c_str());\n\n  if (!Setup()) {\n    xe::FatalError(\"Unable to setup trace dump tool\");\n    return 1;\n  }\n  if (!Load(std::move(abs_path))) {\n    xe::FatalError(\"Unable to load trace file; not found?\");\n    return 1;\n  }\n\n  \/\/ Root file name for outputs.\n  base_output_path_ =\n      xe::fix_path_separators(xe::to_wstring(FLAGS_trace_dump_path));\n  base_output_path_ =\n      xe::join_paths(base_output_path_,\n                     xe::find_name_from_path(xe::fix_path_separators(path)));\n\n  \/\/ Ensure output path exists.\n  xe::filesystem::CreateParentFolder(base_output_path_);\n\n  return Run();\n}\n\nbool TraceDump::Setup() {\n  \/\/ Main display window.\n  loop_ = ui::Loop::Create();\n  window_ = xe::ui::Window::Create(loop_.get(), L\"xenia-gpu-trace-dump\");\n  loop_->PostSynchronous([&]() {\n    xe::threading::set_name(\"Win32 Loop\");\n    if (!window_->Initialize()) {\n      xe::FatalError(\"Failed to initialize main window\");\n      return;\n    }\n  });\n  window_->on_closed.AddListener([&](xe::ui::UIEvent* e) {\n    loop_->Quit();\n    XELOGI(\"User-initiated death!\");\n    exit(1);\n  });\n  loop_->on_quit.AddListener([&](xe::ui::UIEvent* e) { window_.reset(); });\n  window_->Resize(1920, 1200);\n\n  \/\/ Create the emulator but don't initialize so we can setup the window.\n  emulator_ = std::make_unique<Emulator>(L\"\");\n  X_STATUS result =\n      emulator_->Setup(window_.get(), nullptr,\n                       [this]() { return CreateGraphicsSystem(); }, nullptr);\n  if (XFAILED(result)) {\n    XELOGE(\"Failed to setup emulator: %.8X\", result);\n    return false;\n  }\n  memory_ = emulator_->memory();\n  graphics_system_ = emulator_->graphics_system();\n\n  window_->on_key_char.AddListener([&](xe::ui::KeyEvent* e) {\n    if (e->key_code() == 0x74 \/* VK_F5 *\/) {\n      graphics_system_->ClearCaches();\n      e->set_handled(true);\n    }\n  });\n\n  player_ = std::make_unique<TracePlayer>(loop_.get(), graphics_system_);\n\n  window_->on_painting.AddListener([&](xe::ui::UIEvent* e) {\n    \/\/ Update titlebar status.\n    auto file_name = xe::find_name_from_path(trace_file_path_);\n    std::wstring title = std::wstring(L\"Xenia GPU Trace Dump: \") + file_name;\n    if (player_->is_playing_trace()) {\n      int percent =\n          static_cast<int>(player_->playback_percent() \/ 10000.0 * 100.0);\n      title += xe::format_string(L\" (%d%%)\", percent);\n    }\n    window_->set_title(title);\n\n    \/\/ Continuous paint.\n    window_->Invalidate();\n  });\n  window_->Invalidate();\n\n  return true;\n}\n\nbool TraceDump::Load(std::wstring trace_file_path) {\n  trace_file_path_ = std::move(trace_file_path);\n\n  if (!player_->Open(trace_file_path_)) {\n    XELOGE(\"Could not load trace file\");\n    return false;\n  }\n\n  return true;\n}\n\nint TraceDump::Run() {\n  loop_->Post([&]() {\n    player_->SeekFrame(0);\n    player_->SeekCommand(\n        static_cast<int>(player_->current_frame()->commands.size() - 1));\n  });\n  player_->WaitOnPlayback();\n\n  loop_->PostSynchronous([&]() {\n    \/\/ Breathe.\n  });\n  loop_->PostSynchronous([&]() {\n    \/\/ Breathe.\n  });\n\n  xe::threading::Fence capture_fence;\n  int result = 0;\n  loop_->PostDelayed(\n      [&]() {\n        \/\/ Capture.\n        auto raw_image = graphics_system_->Capture();\n        if (!raw_image) {\n          \/\/ Failed to capture anything.\n          result = -1;\n          capture_fence.Signal();\n          return;\n        }\n\n        \/\/ Save framebuffer png.\n        std::string png_path = xe::to_string(base_output_path_ + L\".png\");\n        stbi_write_png(png_path.c_str(), static_cast<int>(raw_image->width),\n                       static_cast<int>(raw_image->height), 4,\n                       raw_image->data.data(),\n                       static_cast<int>(raw_image->stride));\n\n        result = 0;\n        capture_fence.Signal();\n      },\n      50);\n\n  capture_fence.Wait();\n\n  \/\/ Wait until we are exited.\n  loop_->Quit();\n  loop_->AwaitQuit();\n\n  Profiler::Shutdown();\n  window_.reset();\n  loop_.reset();\n  player_.reset();\n  emulator_.reset();\n\n  return result;\n}\n\n}  \/\/  namespace gpu\n}  \/\/  namespace xe\n<commit_msg>[GPU] Accept input and output path as command line parameters<commit_after>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project                                 *\n ******************************************************************************\n * Copyright 2015 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\/gpu\/trace_dump.h\"\n\n#include <gflags\/gflags.h>\n\n#include \"third_party\/stb\/stb_image_write.h\"\n#include \"xenia\/base\/logging.h\"\n#include \"xenia\/base\/profiling.h\"\n#include \"xenia\/base\/string.h\"\n#include \"xenia\/base\/threading.h\"\n#include \"xenia\/gpu\/command_processor.h\"\n#include \"xenia\/gpu\/graphics_system.h\"\n#include \"xenia\/memory.h\"\n#include \"xenia\/ui\/file_picker.h\"\n#include \"xenia\/ui\/window.h\"\n#include \"xenia\/xbox.h\"\n\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n#undef _CRT_SECURE_NO_WARNINGS\n#undef _CRT_NONSTDC_NO_DEPRECATE\n#include \"third_party\/stb\/stb_image_write.h\"\n\nDEFINE_string(target_trace_file, \"\", \"Specifies the trace file to load.\");\nDEFINE_string(trace_dump_path, \"\", \"Output path for dumped files.\");\n\nnamespace xe {\nnamespace gpu {\n\nusing namespace xe::gpu::xenos;\n\nTraceDump::TraceDump() = default;\n\nTraceDump::~TraceDump() = default;\n\nint TraceDump::Main(const std::vector<std::wstring>& args) {\n  \/\/ Grab path from the flag or unnamed argument.\n  std::wstring path;\n  std::wstring output_path;\n  if (!FLAGS_target_trace_file.empty()) {\n    \/\/ Passed as a named argument.\n    \/\/ TODO(benvanik): find something better than gflags that supports\n    \/\/ unicode.\n    path = xe::to_wstring(FLAGS_target_trace_file);\n  } else if (args.size() >= 2) {\n    \/\/ Passed as an unnamed argument.\n    path = args[1];\n\n    if (args.size() >= 3) {\n      output_path = args[2];\n    }\n  } else {\n    \/\/ Open a file chooser and ask the user.\n    auto file_picker = xe::ui::FilePicker::Create();\n    file_picker->set_mode(ui::FilePicker::Mode::kOpen);\n    file_picker->set_type(ui::FilePicker::Type::kFile);\n    file_picker->set_multi_selection(false);\n    file_picker->set_title(L\"Select Trace File\");\n    file_picker->set_extensions({\n        {L\"Supported Files\", L\"*.xenia_gpu_trace\"},\n        {L\"All Files (*.*)\", L\"*.*\"},\n    });\n    if (file_picker->Show()) {\n      auto selected_files = file_picker->selected_files();\n      if (!selected_files.empty()) {\n        path = selected_files[0];\n      }\n    }\n  }\n\n  if (path.empty()) {\n    xe::FatalError(\"No trace file specified\");\n    return 1;\n  }\n\n  \/\/ Normalize the path and make absolute.\n  auto abs_path = xe::to_absolute_path(path);\n  XELOGI(\"Loading trace file %ls...\", abs_path.c_str());\n\n  if (!Setup()) {\n    xe::FatalError(\"Unable to setup trace dump tool\");\n    return 1;\n  }\n  if (!Load(std::move(abs_path))) {\n    xe::FatalError(\"Unable to load trace file; not found?\");\n    return 1;\n  }\n\n  \/\/ Root file name for outputs.\n  if (output_path.empty()) {\n    base_output_path_ =\n        xe::fix_path_separators(xe::to_wstring(FLAGS_trace_dump_path));\n    base_output_path_ =\n        xe::join_paths(base_output_path_,\n                       xe::find_name_from_path(xe::fix_path_separators(path)));\n  } else {\n    base_output_path_ = xe::fix_path_separators(output_path);\n  }\n\n  \/\/ Ensure output path exists.\n  xe::filesystem::CreateParentFolder(base_output_path_);\n\n  return Run();\n}\n\nbool TraceDump::Setup() {\n  \/\/ Main display window.\n  loop_ = ui::Loop::Create();\n  window_ = xe::ui::Window::Create(loop_.get(), L\"xenia-gpu-trace-dump\");\n  loop_->PostSynchronous([&]() {\n    xe::threading::set_name(\"Win32 Loop\");\n    if (!window_->Initialize()) {\n      xe::FatalError(\"Failed to initialize main window\");\n      return;\n    }\n  });\n  window_->on_closed.AddListener([&](xe::ui::UIEvent* e) {\n    loop_->Quit();\n    XELOGI(\"User-initiated death!\");\n    exit(1);\n  });\n  loop_->on_quit.AddListener([&](xe::ui::UIEvent* e) { window_.reset(); });\n  window_->Resize(1920, 1200);\n\n  \/\/ Create the emulator but don't initialize so we can setup the window.\n  emulator_ = std::make_unique<Emulator>(L\"\");\n  X_STATUS result =\n      emulator_->Setup(window_.get(), nullptr,\n                       [this]() { return CreateGraphicsSystem(); }, nullptr);\n  if (XFAILED(result)) {\n    XELOGE(\"Failed to setup emulator: %.8X\", result);\n    return false;\n  }\n  memory_ = emulator_->memory();\n  graphics_system_ = emulator_->graphics_system();\n\n  window_->on_key_char.AddListener([&](xe::ui::KeyEvent* e) {\n    if (e->key_code() == 0x74 \/* VK_F5 *\/) {\n      graphics_system_->ClearCaches();\n      e->set_handled(true);\n    }\n  });\n\n  player_ = std::make_unique<TracePlayer>(loop_.get(), graphics_system_);\n\n  window_->on_painting.AddListener([&](xe::ui::UIEvent* e) {\n    \/\/ Update titlebar status.\n    auto file_name = xe::find_name_from_path(trace_file_path_);\n    std::wstring title = std::wstring(L\"Xenia GPU Trace Dump: \") + file_name;\n    if (player_->is_playing_trace()) {\n      int percent =\n          static_cast<int>(player_->playback_percent() \/ 10000.0 * 100.0);\n      title += xe::format_string(L\" (%d%%)\", percent);\n    }\n    window_->set_title(title);\n\n    \/\/ Continuous paint.\n    window_->Invalidate();\n  });\n  window_->Invalidate();\n\n  return true;\n}\n\nbool TraceDump::Load(std::wstring trace_file_path) {\n  trace_file_path_ = std::move(trace_file_path);\n\n  if (!player_->Open(trace_file_path_)) {\n    XELOGE(\"Could not load trace file\");\n    return false;\n  }\n\n  return true;\n}\n\nint TraceDump::Run() {\n  loop_->Post([&]() {\n    player_->SeekFrame(0);\n    player_->SeekCommand(\n        static_cast<int>(player_->current_frame()->commands.size() - 1));\n  });\n  player_->WaitOnPlayback();\n\n  loop_->PostSynchronous([&]() {\n    \/\/ Breathe.\n  });\n  loop_->PostSynchronous([&]() {\n    \/\/ Breathe.\n  });\n\n  xe::threading::Fence capture_fence;\n  int result = 0;\n  loop_->PostDelayed(\n      [&]() {\n        \/\/ Capture.\n        auto raw_image = graphics_system_->Capture();\n        if (!raw_image) {\n          \/\/ Failed to capture anything.\n          result = -1;\n          capture_fence.Signal();\n          return;\n        }\n\n        \/\/ Save framebuffer png.\n        std::string png_path = xe::to_string(base_output_path_ + L\".png\");\n        stbi_write_png(png_path.c_str(), static_cast<int>(raw_image->width),\n                       static_cast<int>(raw_image->height), 4,\n                       raw_image->data.data(),\n                       static_cast<int>(raw_image->stride));\n\n        result = 0;\n        capture_fence.Signal();\n      },\n      50);\n\n  capture_fence.Wait();\n\n  \/\/ Wait until we are exited.\n  loop_->Quit();\n  loop_->AwaitQuit();\n\n  Profiler::Shutdown();\n  window_.reset();\n  loop_.reset();\n  player_.reset();\n  emulator_.reset();\n\n  return result;\n}\n\n}  \/\/  namespace gpu\n}  \/\/  namespace xe\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/  mos6502.cc\n\/\/------------------------------------------------------------------------------\n#include \"mos6502.h\"\n#include \"yakc\/core\/system_bus.h\"\n\nnamespace YAKC {\n\n\/\/------------------------------------------------------------------------------\n\/\/  address mode table\n\/\/\nuint8_t mos_6502::addr_modes[4][8][8] = {\n    \/\/ cc = 00\n    {\n        \/\/---    BIT    JMP    JMP()  STY    LDY    CPY    CPX\n        { A____, A____, A____, A____, A____, A_IMM, A_IMM, A_IMM },\n        { A____, A_ZER, A____, A____, A_ZER, A_ZER, A_ZER, A_ZER },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A_ZPX, A_ZPY, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A_ABX, A____, A____ },\n    },\n    \/\/ cc = 01\n    {\n        \/\/ORA    AND    EOR    ADC    STA    LDA    CMP    SBC\n        { A_IDX, A_IDX, A_IDX, A_IDX, A_IDX, A_IDX, A_IDX, A_IDX },\n        { A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER },\n        { A_IMM, A_IMM, A_IMM, A_IMM, A____, A_IMM, A_IMM, A_IMM },\n        { A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS },\n        { A_IDY, A_IDY, A_IDY, A_IDY, A_IDY, A_IDY, A_IDY, A_IDY },\n        { A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPX },\n        { A_ABY, A_ABY, A_ABY, A_ABY, A_ABY, A_ABY, A_ABY, A_ABY },\n        { A_ABX, A_ABX, A_ABX, A_ABX, A_ABX, A_ABX, A_ABX, A_ABX },\n    }\n    \/\/ cc = 02\n    {\n        \/\/ASL    ROL    LSR    ROR    STX    LDX    DEC    INC\n        { A____, A____, A____, A____, A____, A_IMM, A____, A____ },\n        { A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPY, A_ZPY, A_ZPX, A_ZPX },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A_ABX, A_ABX, A_ABX, A_ABX, A____, A_ABY, A_ABX, A_ABX },\n    }\n    \/\/ cc = 03\n    {\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n    },\n};\n\n\/\/------------------------------------------------------------------------------\nmos6502::mos6502() {\n    this->init();\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::init() {\n    A = 0; X = 0; Y = 0; S = 0; P = XF; PC = 0;\n    OP = 0;\n    RW = true;\n    Cycle = 0;\n    FetchReady = true;\n    AddrReady = false;\n    ExecReady = false;\n    AddrMode = A____;\n    AddrStep = 0;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::reset() {\n    P = (IF | XF);\n    S = 0xFD;\n    PC = mem.r16(0xFFFC);\n    RW = true;\n    Cycle = 0;\n    FetchReady = true;\n    AddrReady = false;\n    ExecReady = false;\n    AddrMode = A____;\n    AddrStep = 0;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step(system_bus* bus) {\n    \/\/ FIXME: Decode overlaps with Execute from the last instruction\n    if (FetchReady) {\n        step_fetch(bus);\n    }\n    if (AddReady) {\n        step_addr(bus);\n    }\n    if (ExecReady) {\n        step_exec(bus);\n    }\n    Cycle++;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_fetch() {\n    \/\/ fetch next instruction byte\n    ADDR = PC++;\n    OP = mem.r8(ADDR);\n\n    \/\/ decode:\n    \/\/  - determine addressing mode\n    \/\/  - determine load\/store\n    uint8_t cc  = OP & 0x03;\n    uint8_t bbb = (OP >> 2) & 0x07;\n    uint8_t aaa = (OP >> 5) & 0x07;\n    AddrMode = addr_modes[cc][bbb][aaa];\n    AddrReady = true;\n    FetchReady = false;\n    ExecReady = false;\n    Cycle = 0;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_exec() {\n    FetchReady = true;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr() {\n    if (Cycle > 0) {\n        switch (AddrMode) {\n            case A_IMM: this->step_addr_imm(); break;\n            case A_ZER: this->step_addr_zer(); break;\n            case A_ZPX: this->step_addr_zpx(); break;\n            case A_ZPY: this->step_addr_zpy(); break;\n            case A_ABS: this->step_addr_abs(); break;\n            case A_ABX: this->step_addr_abx(); break;\n            case A_ABY: this->step_addr_aby(); break;\n            case A_IDX: this->step_addr_idx(); break;\n            case A_IDY: this->step_addr_idy(); break;\n            default: ExecReady = true; break;\n        }\n        DATA = mem.r8(ADDR);\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_imm() {\n    ADDR = PC++;\n    ExecReady = true;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_zer() {\n    switch (AddrCycle) {\n        case 1: ADDR = PC++; break;\n        case 2: ADDR = DATA; ExecReady = true; break;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_zpx() {\n    switch (AddrCycle) {\n        case 1: ADDR = PC++; break;\n        case 2: ADDR = DATA; break;\n        case 3: ADDR = (ADDR + X) & 0x00FF; ExecReady = true; break;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_zpy() {\n    switch (AddrCycle) {\n        case 1: ADDR = PC++; break;\n        case 2: ADDR = DATA; break;\n        case 3: ADDR = (ADDR + Y) & 0x00FF; ExecReady = true; break;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_abs() {\n    switch (AddrCycle) {\n        case 1: ADDR = PC++; break;\n        case 2: tmp = DATA; ADDR = PC++; break;\n        case 3: ADDR = DATA<<8 | tmp; ExecReady = true; break;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_abx() {\n    switch (AddrCycle) {\n        case 1: ADDR = PC++; break;\n        case 2: tmp = DATA + X; ADDR = PC++; break;\n        case 3:\n            ADDR = (DATA<<8) | (tmp&0xFF);\n            if ((tmp & 0xFF00) == 0x00) {\n                \/\/ page boundary not crossed, can exit early\n                ExecReady = true;\n            }\n            break;\n        case 4:\n            \/\/ only arrives here if page boundary was crossed\n            ADDR = (DATA<<8) + tmp;\n            ExecReady = true;\n            break;\n    }\n}\n\n} \/\/ namespace YAKC\n<commit_msg>some more minor 6502 fixes<commit_after>\/\/------------------------------------------------------------------------------\n\/\/  mos6502.cc\n\/\/------------------------------------------------------------------------------\n#include \"mos6502.h\"\n#include \"yakc\/core\/system_bus.h\"\n\nnamespace YAKC {\n\n\/\/------------------------------------------------------------------------------\n\/\/  address mode table\n\/\/\nuint8_t mos_6502::addr_modes[4][8][8] = {\n    \/\/ cc = 00\n    {\n        \/\/---    BIT    JMP    JMP()  STY    LDY    CPY    CPX\n        { A____, A____, A____, A____, A____, A_IMM, A_IMM, A_IMM },\n        { A____, A_ZER, A____, A____, A_ZER, A_ZER, A_ZER, A_ZER },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A_ZPX, A_ZPY, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A_ABX, A____, A____ },\n    },\n    \/\/ cc = 01\n    {\n        \/\/ORA    AND    EOR    ADC    STA    LDA    CMP    SBC\n        { A_IDX, A_IDX, A_IDX, A_IDX, A_IDX, A_IDX, A_IDX, A_IDX },\n        { A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER },\n        { A_IMM, A_IMM, A_IMM, A_IMM, A____, A_IMM, A_IMM, A_IMM },\n        { A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS },\n        { A_IDY, A_IDY, A_IDY, A_IDY, A_IDY, A_IDY, A_IDY, A_IDY },\n        { A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPX },\n        { A_ABY, A_ABY, A_ABY, A_ABY, A_ABY, A_ABY, A_ABY, A_ABY },\n        { A_ABX, A_ABX, A_ABX, A_ABX, A_ABX, A_ABX, A_ABX, A_ABX },\n    }\n    \/\/ cc = 02\n    {\n        \/\/ASL    ROL    LSR    ROR    STX    LDX    DEC    INC\n        { A____, A____, A____, A____, A____, A_IMM, A____, A____ },\n        { A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER, A_ZER },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS, A_ABS },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A_ZPX, A_ZPX, A_ZPX, A_ZPX, A_ZPY, A_ZPY, A_ZPX, A_ZPX },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A_ABX, A_ABX, A_ABX, A_ABX, A____, A_ABY, A_ABX, A_ABX },\n    }\n    \/\/ cc = 03\n    {\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n        { A____, A____, A____, A____, A____, A____, A____, A____ },\n    },\n};\n\n\/\/------------------------------------------------------------------------------\nmos6502::mos6502() {\n    this->init();\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::init() {\n    A = 0; X = 0; Y = 0; S = 0; P = XF; PC = 0;\n    OP = 0;\n    RW = true;\n    Cycle = 0;\n    FetchReady = true;\n    AddrReady = false;\n    ExecReady = false;\n    AddrMode = A____;\n    AddrStep = 0;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::reset() {\n    P = (IF | XF);\n    S = 0xFD;\n    PC = mem.r16(0xFFFC);\n    RW = true;\n    Cycle = 0;\n    FetchReady = true;\n    AddrReady = false;\n    ExecReady = false;\n    AddrMode = A____;\n    AddrStep = 0;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step(system_bus* bus) {\n    \/\/ FIXME: Decode overlaps with Execute from the last instruction\n    if (FetchReady) {\n        step_fetch(bus);\n    }\n    if (AddReady) {\n        step_addr(bus);\n    }\n    if (ExecReady) {\n        step_exec(bus);\n    }\n    Cycle++;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_fetch() {\n    \/\/ fetch next instruction byte\n    ADDR = PC++;\n    OP = mem.r8(ADDR);\n\n    \/\/ decode:\n    \/\/  - determine addressing mode\n    \/\/  - determine load\/store\n    uint8_t cc  = OP & 0x03;\n    uint8_t bbb = (OP >> 2) & 0x07;\n    uint8_t aaa = (OP >> 5) & 0x07;\n    AddrMode = addr_modes[cc][bbb][aaa];\n    AddrReady = true;\n    FetchReady = false;\n    ExecReady = false;\n    Cycle = 0;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_exec() {\n    FetchReady = true;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr() {\n    if (Cycle > 0) {\n        switch (AddrMode) {\n            case A_IMM: this->step_addr_imm(); break;\n            case A_ZER: this->step_addr_zer(); break;\n            case A_ZPX: this->step_addr_zpx(); break;\n            case A_ZPY: this->step_addr_zpy(); break;\n            case A_ABS: this->step_addr_abs(); break;\n            case A_ABX: this->step_addr_abx(); break;\n            case A_ABY: this->step_addr_aby(); break;\n            case A_IDX: this->step_addr_idx(); break;\n            case A_IDY: this->step_addr_idy(); break;\n            default: ExecReady = true; break;\n        }\n        DATA = mem.r8(ADDR);\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_imm() {\n    ADDR = PC++;\n    ExecReady = true;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_zer() {\n    switch (Cycle) {\n        case 1: ADDR = PC++; break;\n        case 2: ADDR = DATA; ExecReady = true; break;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_zpx() {\n    switch (Cycle) {\n        case 1: ADDR = PC++; break;\n        case 2: ADDR = DATA; break;\n        case 3: ADDR = (DATA + X) & 0x00FF; ExecReady = true; break;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_zpy() {\n    switch (Cycle) {\n        case 1: ADDR = PC++; break;\n        case 2: ADDR = DATA; break;\n        case 3: ADDR = (ADDR + Y) & 0x00FF; ExecReady = true; break;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_addr_abs() {\n    switch (Cycle) {\n        case 1: ADDR = PC++; break;\n        case 2: tmp = DATA; ADDR = PC++; break;\n        case 3: ADDR = DATA<<8 | tmp; ExecReady = true; break;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid\nmos6502::step_abx() {\n    switch (Cycle) {\n        case 1: ADDR = PC++; break;\n        case 2: tmp = DATA + X; ADDR = PC++; break;\n        case 3:\n            \/\/ first read from within current page\n            ADDR = (DATA<<8) | (tmp&0xFF);\n            if ((tmp & 0xFF00) == 0x00) {\n                \/\/ page boundary not crossed, can exit early\n                ExecReady = true;\n            }\n            break;\n        case 4:\n            \/\/ only arrives here if page boundary was crossed\n            ADDR = (DATA<<8) + tmp;\n            ExecReady = true;\n            break;\n    }\n}\n\n} \/\/ namespace YAKC\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Clever programming language\n * Copyright (c) 2011-2012 Clever Team\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 * 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#include <cmath>\n#include <vector>\n#include <cstdlib>\n#include <cstdio>\n#include <map>\n#include <string>\n\n#ifndef __APPLE__\n# include <ffi.h>\n#else\n# include <ffi\/ffi.h>\n#endif\n\n#ifdef CLEVER_WIN32\n# include <windows.h>\n#else\n# include <dlfcn.h>\n#endif\n\n#include \"modules\/std\/ffi\/ffiobject.h\"\n#include \"modules\/std\/ffi\/ffi.h\"\n#include \"types\/nativetypes.h\"\n\nnamespace clever { namespace packages { namespace std { namespace ffi {\n\nextern \"C\" {\n\ttypedef void (*ffi_call_func)();\n}\n\n#ifndef CLEVER_WIN32\n\tExtMap ext_mod_map;\n#endif\n\n#if defined(CLEVER_WIN32)\n\tconst char* CLEVER_DYLIB_EXT = \".dll\";\n#elif defined(CLEVER_APPLE)\n\tconst char* CLEVER_DYLIB_EXT = \".dylib\";\n#else\n\tconst char* CLEVER_DYLIB_EXT = \".so\";\n#endif\n\nffi_type* find_ffi_type(const char* tn) {\n\tswitch (tn[0]) {\n\t\tcase 'i': return &ffi_type_sint32;\n\t\tcase 'd': return &ffi_type_double;\n\t\tcase 'b': return &ffi_type_schar;\n\t\tcase 's': return &ffi_type_pointer;\n\t\tcase 'c': return &ffi_type_schar;\n\t\tcase 'v': return &ffi_type_void;\n\t\tcase 'p': return &ffi_type_pointer;\n\t}\n\treturn NULL;\n}\n\n\/**\n * call_ext_func(..., str function_name, str library_name)\n * Returns call an external function\n *\/\nstatic CLEVER_FUNCTION(call_ext_func) {\n\tsize_t size = CLEVER_NUM_ARGS();\n\tsize_t n_args = size - 3;\n\n\t::std::string lib = CLEVER_ARG_STR(size-3);\n\t::std::string rt = CLEVER_ARG_STR(size-2);\n\t::std::string func = CLEVER_ARG_STR(size-1);\n\n#ifndef CLEVER_WIN32\n\tvoid* fpf;\n\tffi_call_func pf;\n\n\tExtMap::iterator it = ext_mod_map.find(lib),\n\t\tend = ext_mod_map.end();\n\n\tif (it == end) {\n\t\t::std::string libname = ::std::string(\".\/\") + lib + CLEVER_DYLIB_EXT;\n\t\tvoid* m = ext_mod_map[lib] = dlopen(libname.c_str(), 1);\n\n\t\tif (m == NULL) {\n\t\t\t::std::fprintf(stderr,\"[FFI] Shared library %s don't found!\\n\",libname.c_str());\n\t\t\tCLEVER_RETURN_BOOL(false);\n\t\t\treturn;\n\t\t}\n\t\tit=ext_mod_map.find(lib);\n\t}\n\n\n\n\tfpf = dlsym(it->second, func.c_str());\n\n\tif (fpf == NULL) {\n\t\t::std::fprintf(stderr,\"[FFI] function %s don't found at %s!\\n\",func.c_str(),lib.c_str());\n\t\tCLEVER_RETURN_BOOL(false);\n\t\treturn;\n\t}\n\n\tpf = reinterpret_cast<ffi_call_func>(fpf);\n#endif\n\n\tffi_cif cif;\n\n\tffi_type* ffi_rt = find_ffi_type(rt.c_str());\n\tffi_type** ffi_args = (ffi_type**) malloc(n_args*sizeof(ffi_type*));\n\n\tvoid** ffi_values = (void**) malloc(n_args*sizeof(void*));\n\n\tfor (size_t i = 0; i < n_args; ++i) {\n\t\tif (CLEVER_ARG_IS_INT(i)) {\n\t\t\tffi_args[i] = &ffi_type_sint32;\n\n\t\t\tint* vi= (int*) malloc(sizeof(int));\n\n\t\t\t*vi = CLEVER_ARG_INT(i);\n\n\t\t\tffi_values[i] =  vi;\n\t\t} else if (CLEVER_ARG_IS_BOOL(i)) {\n\t\t\tffi_args[i] = find_ffi_type(\"b\");\n\n\t\t\tchar* b=(char*) malloc (sizeof(char));\n\n\t\t\t*b = CLEVER_ARG_BOOL(i);\n\n\t\t\tffi_values[i] = b;\n\t\t} else if (CLEVER_ARG_IS_STR(i)) {\n\t\t\tconst char* st = CLEVER_ARG_STR(i).c_str();\n\n\t\t\tchar** s= (char**) malloc (sizeof(char*));\n\t\t\t*s = (char*) malloc (sizeof(char)* (strlen(st)+1));\n\n\t\t\tstrcpy(*s,st);\n\t\t\t(*s)[strlen(st)]='\\0';\n\n\t\t\tffi_args[i] = find_ffi_type(\"s\");\n\n\t\t\tffi_values[i] =  s;\n\t\t} else if (CLEVER_ARG_IS_BYTE(i)) {\n\t\t\tffi_args[i] = find_ffi_type(\"c\");\n\n\t\t\tchar* b = (char*) malloc (sizeof(char));\n\t\t\t*b = CLEVER_ARG_BYTE(i);\n\n\t\t\tffi_values[i] = b;\n\t\t} else if (CLEVER_ARG_IS_DOUBLE(i)) {\n\t\t\tffi_args[i] = &ffi_type_double;\n\n\t\t\tdouble* d = (double*)malloc(sizeof(double));\n\t\t\t*d = CLEVER_ARG_DOUBLE(i);\n\t\t\tffi_values[i] = d;\n\t\t} else if ( CLEVER_ARG_IS_USER(i) ) {\n\t\t\tffi_args[i] = find_ffi_type(\"p\");\n\n\t\t\tFFIObjectValue* obj = static_cast<FFIObjectValue*>(CLEVER_ARG_DATA_VALUE(i));\n\t\t\t\n\t\t\tffi_values[i] = &obj->pointer;\n\t\t}\n\t}\n\n\tif (ffi_prep_cif(&cif, FFI_DEFAULT_ABI, n_args, ffi_rt, ffi_args) != FFI_OK) {\n\t\t CLEVER_RETURN_BOOL(false);\n\t}\n\n#ifndef CLEVER_WIN32\n\n\tif (rt[0] == 'i') {\n\t\tint vi;\n\n\t\tffi_call(&cif, pf, &vi, ffi_values);\n\n\t\tCLEVER_RETURN_INT(vi);\n\t} else if (rt[0] == 'd') {\n\t\tdouble vd;\n\n\t\tffi_call(&cif, pf, &vd, ffi_values);\n\n\t\tCLEVER_RETURN_DOUBLE(vd);\n\t} else if (rt[0] == 'b') {\n\t\tbool vb;\n\n\t\tffi_call(&cif, pf, &vb, ffi_values);\n\n\t\tCLEVER_RETURN_BOOL(vb);\n\t} else if (rt[0] == 's') {\n\t\tchar* vs[1];\n\t\tvs[0]=0;\n\n\t\tffi_call(&cif, pf, &vs, ffi_values);\n\n\t\tCLEVER_RETURN_STR(CSTRING(*vs));\n\t} else if (rt[0] == 'c') {\n\t\tchar vc;\n\n\t\tffi_call(&cif, pf, &vc, ffi_values);\n\n\t\tCLEVER_RETURN_BYTE(vc);\n\t} else if (rt[0] == 'v') {\n\n\t\tffi_call(&cif, pf, NULL, ffi_values);\n\n\t\tCLEVER_RETURN_BOOL(true);\n\t} else if (rt[0] == 'p') {\n\t\tFFIObjectValue* x = new FFIObjectValue();\n\n\t\tffi_call(&cif, pf, &(x->pointer), ffi_values);\n\n\t\tCLEVER_RETURN_DATA_VALUE(x);\n\t} else {\n\t\tCLEVER_RETURN_BOOL(true);\n\t}\n\n#endif\n\n\tfor (size_t i = 0; i < n_args; ++i) {\n\t\tif (CLEVER_ARG_IS_INT(i)) {\n\t\t\tfree((int*)ffi_values[i]);\n\t\t} else if (CLEVER_ARG_IS_BOOL(i)) {\n\t\t\tfree((char*)ffi_values[i]);\n\t\t} else if (CLEVER_ARG_IS_STR(i)) {\n\t\t\tchar** v=(char**)ffi_values[i];\n\t\t\tfree(v[0]);\n\t\t\tfree(v);\n\t\t} else if (CLEVER_ARG_IS_BYTE(i)) {\n\t\t\tfree((char*)ffi_values[i]);\n\t\t} else if (CLEVER_ARG_IS_DOUBLE(i)) {\n\t\t\tfree((double*)ffi_values[i]);\n\t\t} else if (CLEVER_ARG_IS_USER(i)) {\n\t\t}\n\t}\n\n\tfree(ffi_args);\n\tfree(ffi_values);\n}\n\n} \/\/ ffi\n\n\/**\n * Load module data\n *\/\nvoid FFI::init() {\n\n\tClass* FFIObject = new ffi::FFIObject();\n\n\taddClass(FFIObject);\n\n\taddFunction(new Function(\"call_ext_func\", &CLEVER_NS_FNAME(ffi, call_ext_func), CLEVER_BOOL))\n\t\t->setVariadic()\n\t\t->setMinNumArgs(2);\n}\n\nFFI::~FFI() {\n\tExtMap::const_iterator it = ffi::ext_mod_map.begin(),\n\t\tend = ffi::ext_mod_map.end();\n\n\twhile (it != end) {\n\t\tif (it->second != NULL) dlclose(it->second);\n\t\t++it;\n\t}\n}\n\n}}} \/\/ clever::packages::std\n<commit_msg>Using clever_fatal to FFI error messages<commit_after>\/**\n * Clever programming language\n * Copyright (c) 2011-2012 Clever Team\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 * 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#include <cmath>\n#include <vector>\n#include <cstdlib>\n#include <cstdio>\n#include <map>\n#include <string>\n\n#ifndef __APPLE__\n# include <ffi.h>\n#else\n# include <ffi\/ffi.h>\n#endif\n\n#ifdef CLEVER_WIN32\n# include <windows.h>\n#else\n# include <dlfcn.h>\n#endif\n\n#include \"modules\/std\/ffi\/ffiobject.h\"\n#include \"modules\/std\/ffi\/ffi.h\"\n#include \"types\/nativetypes.h\"\n\nnamespace clever { namespace packages { namespace std { namespace ffi {\n\nextern \"C\" {\n\ttypedef void (*ffi_call_func)();\n}\n\n#ifndef CLEVER_WIN32\n\tExtMap ext_mod_map;\n#endif\n\n#if defined(CLEVER_WIN32)\n\tconst char* CLEVER_DYLIB_EXT = \".dll\";\n#elif defined(CLEVER_APPLE)\n\tconst char* CLEVER_DYLIB_EXT = \".dylib\";\n#else\n\tconst char* CLEVER_DYLIB_EXT = \".so\";\n#endif\n\nffi_type* find_ffi_type(const char* tn) {\n\tswitch (tn[0]) {\n\t\tcase 'i': return &ffi_type_sint32;\n\t\tcase 'd': return &ffi_type_double;\n\t\tcase 'b': return &ffi_type_schar;\n\t\tcase 's': return &ffi_type_pointer;\n\t\tcase 'c': return &ffi_type_schar;\n\t\tcase 'v': return &ffi_type_void;\n\t\tcase 'p': return &ffi_type_pointer;\n\t}\n\treturn NULL;\n}\n\n\/**\n * call_ext_func(..., str function_name, str library_name)\n * Returns call an external function\n *\/\nstatic CLEVER_FUNCTION(call_ext_func) {\n\tsize_t size = CLEVER_NUM_ARGS();\n\tsize_t n_args = size - 3;\n\n\t::std::string lib = CLEVER_ARG_STR(size-3);\n\t::std::string rt = CLEVER_ARG_STR(size-2);\n\t::std::string func = CLEVER_ARG_STR(size-1);\n\n#ifndef CLEVER_WIN32\n\tvoid* fpf;\n\tffi_call_func pf;\n\n\tExtMap::iterator it = ext_mod_map.find(lib),\n\t\tend = ext_mod_map.end();\n\n\tif (it == end) {\n\t\t::std::string libname = ::std::string(\".\/\") + lib + CLEVER_DYLIB_EXT;\n\t\tvoid* m = ext_mod_map[lib] = dlopen(libname.c_str(), 1);\n\n\t\tif (m == NULL) {\n\t\t\tclever_fatal(\"[FFI] Shared library`%S' not found!\", &CLEVER_ARG_STR(size-3));\n\t\t\tCLEVER_RETURN_BOOL(false);\n\t\t\treturn;\n\t\t}\n\t\tit=ext_mod_map.find(lib);\n\t}\n\n\n\n\tfpf = dlsym(it->second, func.c_str());\n\n\tif (fpf == NULL) {\n\t\tclever_fatal(\"[FFI] function`%S' not found at `%S'!\", &CLEVER_ARG_STR(size-1),&CLEVER_ARG_STR(size-3));\n\t\tCLEVER_RETURN_BOOL(false);\n\t\treturn;\n\t}\n\n\tpf = reinterpret_cast<ffi_call_func>(fpf);\n#endif\n\n\tffi_cif cif;\n\n\tffi_type* ffi_rt = find_ffi_type(rt.c_str());\n\tffi_type** ffi_args = (ffi_type**) malloc(n_args*sizeof(ffi_type*));\n\n\tvoid** ffi_values = (void**) malloc(n_args*sizeof(void*));\n\n\tfor (size_t i = 0; i < n_args; ++i) {\n\t\tif (CLEVER_ARG_IS_INT(i)) {\n\t\t\tffi_args[i] = &ffi_type_sint32;\n\n\t\t\tint* vi= (int*) malloc(sizeof(int));\n\n\t\t\t*vi = CLEVER_ARG_INT(i);\n\n\t\t\tffi_values[i] =  vi;\n\t\t} else if (CLEVER_ARG_IS_BOOL(i)) {\n\t\t\tffi_args[i] = find_ffi_type(\"b\");\n\n\t\t\tchar* b=(char*) malloc (sizeof(char));\n\n\t\t\t*b = CLEVER_ARG_BOOL(i);\n\n\t\t\tffi_values[i] = b;\n\t\t} else if (CLEVER_ARG_IS_STR(i)) {\n\t\t\tconst char* st = CLEVER_ARG_STR(i).c_str();\n\n\t\t\tchar** s= (char**) malloc (sizeof(char*));\n\t\t\t*s = (char*) malloc (sizeof(char)* (strlen(st)+1));\n\n\t\t\tstrcpy(*s,st);\n\t\t\t(*s)[strlen(st)]='\\0';\n\n\t\t\tffi_args[i] = find_ffi_type(\"s\");\n\n\t\t\tffi_values[i] =  s;\n\t\t} else if (CLEVER_ARG_IS_BYTE(i)) {\n\t\t\tffi_args[i] = find_ffi_type(\"c\");\n\n\t\t\tchar* b = (char*) malloc (sizeof(char));\n\t\t\t*b = CLEVER_ARG_BYTE(i);\n\n\t\t\tffi_values[i] = b;\n\t\t} else if (CLEVER_ARG_IS_DOUBLE(i)) {\n\t\t\tffi_args[i] = &ffi_type_double;\n\n\t\t\tdouble* d = (double*)malloc(sizeof(double));\n\t\t\t*d = CLEVER_ARG_DOUBLE(i);\n\t\t\tffi_values[i] = d;\n\t\t} else if ( CLEVER_ARG_IS_USER(i) ) {\n\t\t\tffi_args[i] = find_ffi_type(\"p\");\n\n\t\t\tFFIObjectValue* obj = static_cast<FFIObjectValue*>(CLEVER_ARG_DATA_VALUE(i));\n\t\t\t\n\t\t\tffi_values[i] = &obj->pointer;\n\t\t}\n\t}\n\n\tif (ffi_prep_cif(&cif, FFI_DEFAULT_ABI, n_args, ffi_rt, ffi_args) != FFI_OK) {\n\t\t CLEVER_RETURN_BOOL(false);\n\t}\n\n#ifndef CLEVER_WIN32\n\n\tif (rt[0] == 'i') {\n\t\tint vi;\n\n\t\tffi_call(&cif, pf, &vi, ffi_values);\n\n\t\tCLEVER_RETURN_INT(vi);\n\t} else if (rt[0] == 'd') {\n\t\tdouble vd;\n\n\t\tffi_call(&cif, pf, &vd, ffi_values);\n\n\t\tCLEVER_RETURN_DOUBLE(vd);\n\t} else if (rt[0] == 'b') {\n\t\tbool vb;\n\n\t\tffi_call(&cif, pf, &vb, ffi_values);\n\n\t\tCLEVER_RETURN_BOOL(vb);\n\t} else if (rt[0] == 's') {\n\t\tchar* vs[1];\n\t\tvs[0]=0;\n\n\t\tffi_call(&cif, pf, &vs, ffi_values);\n\n\t\tCLEVER_RETURN_STR(CSTRING(*vs));\n\t} else if (rt[0] == 'c') {\n\t\tchar vc;\n\n\t\tffi_call(&cif, pf, &vc, ffi_values);\n\n\t\tCLEVER_RETURN_BYTE(vc);\n\t} else if (rt[0] == 'v') {\n\n\t\tffi_call(&cif, pf, NULL, ffi_values);\n\n\t\tCLEVER_RETURN_BOOL(true);\n\t} else if (rt[0] == 'p') {\n\t\tFFIObjectValue* x = new FFIObjectValue();\n\n\t\tffi_call(&cif, pf, &(x->pointer), ffi_values);\n\n\t\tCLEVER_RETURN_DATA_VALUE(x);\n\t} else {\n\t\tCLEVER_RETURN_BOOL(true);\n\t}\n\n#endif\n\n\tfor (size_t i = 0; i < n_args; ++i) {\n\t\tif (CLEVER_ARG_IS_INT(i)) {\n\t\t\tfree((int*)ffi_values[i]);\n\t\t} else if (CLEVER_ARG_IS_BOOL(i)) {\n\t\t\tfree((char*)ffi_values[i]);\n\t\t} else if (CLEVER_ARG_IS_STR(i)) {\n\t\t\tchar** v=(char**)ffi_values[i];\n\t\t\tfree(v[0]);\n\t\t\tfree(v);\n\t\t} else if (CLEVER_ARG_IS_BYTE(i)) {\n\t\t\tfree((char*)ffi_values[i]);\n\t\t} else if (CLEVER_ARG_IS_DOUBLE(i)) {\n\t\t\tfree((double*)ffi_values[i]);\n\t\t} else if (CLEVER_ARG_IS_USER(i)) {\n\t\t}\n\t}\n\n\tfree(ffi_args);\n\tfree(ffi_values);\n}\n\n} \/\/ ffi\n\n\/**\n * Load module data\n *\/\nvoid FFI::init() {\n\n\tClass* FFIObject = new ffi::FFIObject();\n\n\taddClass(FFIObject);\n\n\taddFunction(new Function(\"call_ext_func\", &CLEVER_NS_FNAME(ffi, call_ext_func), CLEVER_BOOL))\n\t\t->setVariadic()\n\t\t->setMinNumArgs(2);\n}\n\nFFI::~FFI() {\n\tExtMap::const_iterator it = ffi::ext_mod_map.begin(),\n\t\tend = ffi::ext_mod_map.end();\n\n\twhile (it != end) {\n\t\tif (it->second != NULL) dlclose(it->second);\n\t\t++it;\n\t}\n}\n\n}}} \/\/ clever::packages::std\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n** Copyright (c) 2013-2015, Intel Corporation                                **\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** 3. Neither the name of the copyright holder 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** HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,    **\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED  **\n** TO, 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\/* Hans Pabst (Intel Corp.)\n******************************************************************************\/\n#if defined(LIBXSMM_OFFLOAD)\n# pragma offload_attribute(push,target(mic))\n#endif\n\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <cassert>\n#include <cstdio>\n#include <vector>\n#include <cmath>\n\n#if defined(_OPENMP)\n# include <omp.h>\n#endif\n\n#if defined(LIBXSMM_OFFLOAD)\n# pragma offload_attribute(pop)\n#endif\n\n#include <libxsmm.h>\n\n\/\/ make sure that stacksize is covering the problem size\n#define SMM_MAX_PROBLEM_SIZE (5 * LIBXSMM_MAX_MNK)\n\n#if (0 < (LIBXSMM_ALIGNED_STORES))\n# define SMM_ALIGNMENT LIBXSMM_ALIGNED_STORES\n#else\n# define SMM_ALIGNMENT LIBXSMM_ALIGNMENT\n#endif\n\n#define SMM_CHECK\n\n\ntemplate<typename T>\nLIBXSMM_TARGET(mic) void nrand(T& a)\n{\n  static const double scale = 1.0 \/ RAND_MAX;\n  a = static_cast<T>(scale * (2 * std::rand() - RAND_MAX));\n}\n\n\ntemplate<typename T>\nLIBXSMM_TARGET(mic) void add(T *LIBXSMM_RESTRICT dst, const T *LIBXSMM_RESTRICT c, int m, int n, int ldc)\n{\n#if (0 < LIBXSMM_ALIGNED_STORES)\n  LIBXSMM_ASSUME_ALIGNED(c, SMM_ALIGNMENT);\n#endif\n  for (int i = 0; i < m; ++i) {\n    for (int j = 0; j < n; ++j) {\n#if (0 != LIBXSMM_ROW_MAJOR)\n      const T value = c[i*ldc+j];\n#else\n      const T value = c[j*ldc+i];\n#endif\n#if defined(_OPENMP)\n#     pragma omp atomic\n#endif\n#if (0 != LIBXSMM_ROW_MAJOR)\n      dst[i*n+j] += value;\n#else\n      dst[j*m+i] += value;\n#endif\n    }\n  }\n}\n\n\ntemplate<typename T>\nLIBXSMM_TARGET(mic) double max_diff(const T *LIBXSMM_RESTRICT result, const T *LIBXSMM_RESTRICT expect, int m, int n, int ldc)\n{\n  double diff = 0;\n  for (int i = 0; i < m; ++i) {\n    for (int j = 0; j < n; ++j) {\n#if (0 != LIBXSMM_ROW_MAJOR)\n      const int k = i * ldc + j;\n#else\n      const int k = j * ldc + i;\n#endif\n      diff = std::max(diff, std::abs(static_cast<double>(result[k]) - static_cast<double>(expect[k])));\n    }\n  }\n  return diff;\n}\n\n\nint main(int argc, char* argv[])\n{\n  try {\n    typedef double T;\n    const int default_psize = 500000, default_batch = 100;\n    const int m = 1 < argc ? std::atoi(argv[1]) : 23;\n    const int s = 2 < argc ? (0 < std::atoi(argv[2]) ? std::atoi(argv[2]) : ('+' == *argv[2]\n      ? (default_psize << std::strlen(argv[2]))\n      : (default_psize >> std::strlen(argv[2])))) : default_psize;\n    const int t = 3 < argc ? (0 < std::atoi(argv[3]) ? std::atoi(argv[3]) : ('+' == *argv[3]\n      ? (default_batch << std::strlen(argv[3]))\n      : (default_batch >> std::strlen(argv[3])))) : default_batch;\n    const int n = 4 < argc ? std::atoi(argv[4]) : m;\n    const int k = 5 < argc ? std::atoi(argv[5]) : m;\n\n#if (0 != LIBXSMM_ALIGNED_STORES)\n# if (0 != LIBXSMM_ROW_MAJOR)\n    const int ldc = LIBXSMM_ALIGN_VALUE(int, T, n, LIBXSMM_ALIGNED_STORES);\n    const int csize = m * ldc + (LIBXSMM_ALIGNED_STORES) \/ sizeof(T) - 1;\n# else\n    const int ldc = LIBXSMM_ALIGN_VALUE(int, T, m, LIBXSMM_ALIGNED_STORES);\n    const int csize = n * ldc + (LIBXSMM_ALIGNED_STORES) \/ sizeof(T) - 1;\n# endif\n#else\n# if (0 != LIBXSMM_ROW_MAJOR)\n    const int ldc = n, csize = m * ldc;\n# else\n    const int ldc = m, csize = n * ldc;\n# endif\n#endif\n\n#if defined(LIBXSMM_OFFLOAD)\n#   pragma offload target(mic)\n#endif\n    {\n#if defined(_OPENMP)\n      const double gflops = (2ULL * s * m * n * k) * 1E-9;\n#endif\n      const int asize = m * k, bsize = k * n;\n      std::vector<T> a(s * asize), b(s * bsize), result(csize);\n#if defined(SMM_CHECK)\n      std::vector<T> expect(csize);\n#endif\n      std::for_each(a.begin(), a.end(), nrand<T>);\n      std::for_each(b.begin(), b.end(), nrand<T>);\n      fprintf(stdout, \"psize=%i batch=%i m=%i n=%i k=%i ldc=%i\\n\", s, t, m, n, k, ldc);\n\n      { \/\/ LAPACK\/BLAS3 (fallback)\n        fprintf(stdout, \"LAPACK\/BLAS...\\n\");\n        std::fill(result.begin(), result.end(), 0);\n#if defined(_OPENMP)\n        const double start = omp_get_wtime();\n#       pragma omp parallel for\n#endif\n        for (int i = 0; i < s; i += t) {\n          LIBXSMM_ALIGNED(T tmp[SMM_MAX_PROBLEM_SIZE], SMM_ALIGNMENT);\n          for (int j = 0; j < csize; ++j) tmp[j] = 0; \/\/ clear\n          for (int j = 0; j < LIBXSMM_MIN(t, s - i); ++j) {\n            libxsmm_blasmm(m, n, k, &a[0] + (i + j) * asize, &b[0] + (i + j) * bsize, tmp);\n          }\n          add(&result[0], tmp, m, n, ldc); \/\/ atomic\n        }\n#if defined(_OPENMP)\n        const double duration = omp_get_wtime() - start;\n        if (0 < duration) {\n          fprintf(stdout, \"\\tperformance: %.1f GFLOPS\/s\\n\", gflops \/ duration);\n        }\n        fprintf(stdout, \"\\tduration: %.1f s\\n\", duration);\n#endif\n#if defined(SMM_CHECK)\n        std::copy(result.begin(), result.end(), expect.begin());\n#endif\n      }\n\n      { \/\/ auto-dispatched\n        fprintf(stdout, \"Dispatched...\\n\");\n        std::fill(result.begin(), result.end(), 0);\n#if defined(_OPENMP)\n        const double start = omp_get_wtime();\n#       pragma omp parallel for\n#endif\n        for (int i = 0; i < s; i += t) {\n          LIBXSMM_ALIGNED(T tmp[SMM_MAX_PROBLEM_SIZE], SMM_ALIGNMENT);\n          for (int j = 0; j < csize; ++j) tmp[j] = 0; \/\/ clear\n          for (int j = 0; j < LIBXSMM_MIN(t, s - i); ++j) {\n            libxsmm_mm(m, n, k, &a[0] + (i + j) * asize, &b[0] + (i + j) * bsize, tmp);\n          }\n          add(&result[0], tmp, m, n, ldc); \/\/ atomic\n        }\n#if defined(_OPENMP)\n        const double duration = omp_get_wtime() - start;\n        if (0 < duration) {\n          fprintf(stdout, \"\\tperformance: %.1f GFLOPS\/s\\n\", gflops \/ duration);\n        }\n        fprintf(stdout, \"\\tduration: %.1f s\\n\", duration);\n#endif\n#if defined(SMM_CHECK)\n        fprintf(stdout, \"\\tdiff=%f\\n\", max_diff(&result[0], &expect[0], m, n, ldc));\n#endif\n      }\n\n      { \/\/ inline an optimized implementation\n        fprintf(stdout, \"Inlined...\\n\");\n        std::fill(result.begin(), result.end(), 0);\n#if defined(_OPENMP)\n        const double start = omp_get_wtime();\n#       pragma omp parallel for\n#endif\n        for (int i = 0; i < s; i += t) {\n          LIBXSMM_ALIGNED(T tmp[SMM_MAX_PROBLEM_SIZE], SMM_ALIGNMENT);\n          for (int j = 0; j < csize; ++j) tmp[j] = 0; \/\/ clear\n          for (int j = 0; j < LIBXSMM_MIN(t, s - i); ++j) {\n            libxsmm_imm(m, n, k, &a[0] + (i + j) * asize, &b[0] + (i + j) * bsize, tmp);\n          }\n          add(&result[0], tmp, m, n, ldc); \/\/ atomic\n        }\n#if defined(_OPENMP)\n        const double duration = omp_get_wtime() - start;\n        if (0 < duration) {\n          fprintf(stdout, \"\\tperformance: %.1f GFLOPS\/s\\n\", gflops \/ duration);\n        }\n        fprintf(stdout, \"\\tduration: %.1f s\\n\", duration);\n#endif\n#if defined(SMM_CHECK)\n        fprintf(stdout, \"\\tdiff=%f\\n\", max_diff(&result[0], &expect[0], m, n, ldc));\n#endif\n      }\n\n      const libxsmm_mm_dispatch<T> xmm(m, n, k);\n      if (xmm) { \/\/ specialized routine\n        fprintf(stdout, \"Specialized...\\n\");\n        std::fill(result.begin(), result.end(), 0);\n#if defined(_OPENMP)\n        const double start = omp_get_wtime();\n#       pragma omp parallel for\n#endif\n        for (int i = 0; i < s; i += t) {\n          LIBXSMM_ALIGNED(T tmp[SMM_MAX_PROBLEM_SIZE], SMM_ALIGNMENT);\n          for (int j = 0; j < csize; ++j) tmp[j] = 0; \/\/ clear\n          for (int j = 0; j < LIBXSMM_MIN(t, s - i); ++j) {\n            xmm(&a[0] + (i + j) * asize, &b[0] + (i + j) * bsize, tmp);\n          }\n          add(&result[0], tmp, m, n, ldc); \/\/ atomic\n        }\n#if defined(_OPENMP)\n        const double duration = omp_get_wtime() - start;\n        if (0 < duration) {\n          fprintf(stdout, \"\\tperformance: %.1f GFLOPS\/s\\n\", gflops \/ duration);\n        }\n        fprintf(stdout, \"\\tduration: %.1f s\\n\", duration);\n#endif\n#if defined(SMM_CHECK)\n        fprintf(stdout, \"\\tdiff=%f\\n\", max_diff(&result[0], &expect[0], m, n, ldc));\n#endif\n      }\n    }\n  }\n  catch(const std::exception& e) {\n    fprintf(stderr, \"Error: %s\\n\", e.what());\n    return EXIT_FAILURE;\n  }\n  catch(...) {\n    fprintf(stderr, \"Error: unknown exception caught!\\n\");\n    return EXIT_FAILURE;\n  }\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>Fixed include order.<commit_after>\/******************************************************************************\n** Copyright (c) 2013-2015, Intel Corporation                                **\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** 3. Neither the name of the copyright holder 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** HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,    **\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED  **\n** TO, 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\/* Hans Pabst (Intel Corp.)\n******************************************************************************\/\n#include <libxsmm.h>\n\n#if defined(LIBXSMM_OFFLOAD)\n# pragma offload_attribute(push,target(mic))\n#endif\n\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <cassert>\n#include <cstdio>\n#include <vector>\n#include <cmath>\n\n#if defined(_OPENMP)\n# include <omp.h>\n#endif\n\n#if defined(LIBXSMM_OFFLOAD)\n# pragma offload_attribute(pop)\n#endif\n\n\/\/ make sure that stacksize is covering the problem size\n#define SMM_MAX_PROBLEM_SIZE (5 * LIBXSMM_MAX_MNK)\n\n#if (0 < (LIBXSMM_ALIGNED_STORES))\n# define SMM_ALIGNMENT LIBXSMM_ALIGNED_STORES\n#else\n# define SMM_ALIGNMENT LIBXSMM_ALIGNMENT\n#endif\n\n#define SMM_CHECK\n\n\ntemplate<typename T>\nLIBXSMM_TARGET(mic) void nrand(T& a)\n{\n  static const double scale = 1.0 \/ RAND_MAX;\n  a = static_cast<T>(scale * (2 * std::rand() - RAND_MAX));\n}\n\n\ntemplate<typename T>\nLIBXSMM_TARGET(mic) void add(T *LIBXSMM_RESTRICT dst, const T *LIBXSMM_RESTRICT c, int m, int n, int ldc)\n{\n#if (0 < LIBXSMM_ALIGNED_STORES)\n  LIBXSMM_ASSUME_ALIGNED(c, SMM_ALIGNMENT);\n#endif\n  for (int i = 0; i < m; ++i) {\n    for (int j = 0; j < n; ++j) {\n#if (0 != LIBXSMM_ROW_MAJOR)\n      const T value = c[i*ldc+j];\n#else\n      const T value = c[j*ldc+i];\n#endif\n#if defined(_OPENMP)\n#     pragma omp atomic\n#endif\n#if (0 != LIBXSMM_ROW_MAJOR)\n      dst[i*n+j] += value;\n#else\n      dst[j*m+i] += value;\n#endif\n    }\n  }\n}\n\n\ntemplate<typename T>\nLIBXSMM_TARGET(mic) double max_diff(const T *LIBXSMM_RESTRICT result, const T *LIBXSMM_RESTRICT expect, int m, int n, int ldc)\n{\n  double diff = 0;\n  for (int i = 0; i < m; ++i) {\n    for (int j = 0; j < n; ++j) {\n#if (0 != LIBXSMM_ROW_MAJOR)\n      const int k = i * ldc + j;\n#else\n      const int k = j * ldc + i;\n#endif\n      diff = std::max(diff, std::abs(static_cast<double>(result[k]) - static_cast<double>(expect[k])));\n    }\n  }\n  return diff;\n}\n\n\nint main(int argc, char* argv[])\n{\n  try {\n    typedef double T;\n    const int default_psize = 500000, default_batch = 100;\n    const int m = 1 < argc ? std::atoi(argv[1]) : 23;\n    const int s = 2 < argc ? (0 < std::atoi(argv[2]) ? std::atoi(argv[2]) : ('+' == *argv[2]\n      ? (default_psize << std::strlen(argv[2]))\n      : (default_psize >> std::strlen(argv[2])))) : default_psize;\n    const int t = 3 < argc ? (0 < std::atoi(argv[3]) ? std::atoi(argv[3]) : ('+' == *argv[3]\n      ? (default_batch << std::strlen(argv[3]))\n      : (default_batch >> std::strlen(argv[3])))) : default_batch;\n    const int n = 4 < argc ? std::atoi(argv[4]) : m;\n    const int k = 5 < argc ? std::atoi(argv[5]) : m;\n\n#if (0 != LIBXSMM_ALIGNED_STORES)\n# if (0 != LIBXSMM_ROW_MAJOR)\n    const int ldc = LIBXSMM_ALIGN_VALUE(int, T, n, LIBXSMM_ALIGNED_STORES);\n    const int csize = m * ldc + (LIBXSMM_ALIGNED_STORES) \/ sizeof(T) - 1;\n# else\n    const int ldc = LIBXSMM_ALIGN_VALUE(int, T, m, LIBXSMM_ALIGNED_STORES);\n    const int csize = n * ldc + (LIBXSMM_ALIGNED_STORES) \/ sizeof(T) - 1;\n# endif\n#else\n# if (0 != LIBXSMM_ROW_MAJOR)\n    const int ldc = n, csize = m * ldc;\n# else\n    const int ldc = m, csize = n * ldc;\n# endif\n#endif\n\n#if defined(LIBXSMM_OFFLOAD)\n#   pragma offload target(mic)\n#endif\n    {\n#if defined(_OPENMP)\n      const double gflops = (2ULL * s * m * n * k) * 1E-9;\n#endif\n      const int asize = m * k, bsize = k * n;\n      std::vector<T> a(s * asize), b(s * bsize), result(csize);\n#if defined(SMM_CHECK)\n      std::vector<T> expect(csize);\n#endif\n      std::for_each(a.begin(), a.end(), nrand<T>);\n      std::for_each(b.begin(), b.end(), nrand<T>);\n      fprintf(stdout, \"psize=%i batch=%i m=%i n=%i k=%i ldc=%i\\n\", s, t, m, n, k, ldc);\n\n      { \/\/ LAPACK\/BLAS3 (fallback)\n        fprintf(stdout, \"LAPACK\/BLAS...\\n\");\n        std::fill(result.begin(), result.end(), 0);\n#if defined(_OPENMP)\n        const double start = omp_get_wtime();\n#       pragma omp parallel for\n#endif\n        for (int i = 0; i < s; i += t) {\n          LIBXSMM_ALIGNED(T tmp[SMM_MAX_PROBLEM_SIZE], SMM_ALIGNMENT);\n          for (int j = 0; j < csize; ++j) tmp[j] = 0; \/\/ clear\n          for (int j = 0; j < LIBXSMM_MIN(t, s - i); ++j) {\n            libxsmm_blasmm(m, n, k, &a[0] + (i + j) * asize, &b[0] + (i + j) * bsize, tmp);\n          }\n          add(&result[0], tmp, m, n, ldc); \/\/ atomic\n        }\n#if defined(_OPENMP)\n        const double duration = omp_get_wtime() - start;\n        if (0 < duration) {\n          fprintf(stdout, \"\\tperformance: %.1f GFLOPS\/s\\n\", gflops \/ duration);\n        }\n        fprintf(stdout, \"\\tduration: %.1f s\\n\", duration);\n#endif\n#if defined(SMM_CHECK)\n        std::copy(result.begin(), result.end(), expect.begin());\n#endif\n      }\n\n      { \/\/ auto-dispatched\n        fprintf(stdout, \"Dispatched...\\n\");\n        std::fill(result.begin(), result.end(), 0);\n#if defined(_OPENMP)\n        const double start = omp_get_wtime();\n#       pragma omp parallel for\n#endif\n        for (int i = 0; i < s; i += t) {\n          LIBXSMM_ALIGNED(T tmp[SMM_MAX_PROBLEM_SIZE], SMM_ALIGNMENT);\n          for (int j = 0; j < csize; ++j) tmp[j] = 0; \/\/ clear\n          for (int j = 0; j < LIBXSMM_MIN(t, s - i); ++j) {\n            libxsmm_mm(m, n, k, &a[0] + (i + j) * asize, &b[0] + (i + j) * bsize, tmp);\n          }\n          add(&result[0], tmp, m, n, ldc); \/\/ atomic\n        }\n#if defined(_OPENMP)\n        const double duration = omp_get_wtime() - start;\n        if (0 < duration) {\n          fprintf(stdout, \"\\tperformance: %.1f GFLOPS\/s\\n\", gflops \/ duration);\n        }\n        fprintf(stdout, \"\\tduration: %.1f s\\n\", duration);\n#endif\n#if defined(SMM_CHECK)\n        fprintf(stdout, \"\\tdiff=%f\\n\", max_diff(&result[0], &expect[0], m, n, ldc));\n#endif\n      }\n\n      { \/\/ inline an optimized implementation\n        fprintf(stdout, \"Inlined...\\n\");\n        std::fill(result.begin(), result.end(), 0);\n#if defined(_OPENMP)\n        const double start = omp_get_wtime();\n#       pragma omp parallel for\n#endif\n        for (int i = 0; i < s; i += t) {\n          LIBXSMM_ALIGNED(T tmp[SMM_MAX_PROBLEM_SIZE], SMM_ALIGNMENT);\n          for (int j = 0; j < csize; ++j) tmp[j] = 0; \/\/ clear\n          for (int j = 0; j < LIBXSMM_MIN(t, s - i); ++j) {\n            libxsmm_imm(m, n, k, &a[0] + (i + j) * asize, &b[0] + (i + j) * bsize, tmp);\n          }\n          add(&result[0], tmp, m, n, ldc); \/\/ atomic\n        }\n#if defined(_OPENMP)\n        const double duration = omp_get_wtime() - start;\n        if (0 < duration) {\n          fprintf(stdout, \"\\tperformance: %.1f GFLOPS\/s\\n\", gflops \/ duration);\n        }\n        fprintf(stdout, \"\\tduration: %.1f s\\n\", duration);\n#endif\n#if defined(SMM_CHECK)\n        fprintf(stdout, \"\\tdiff=%f\\n\", max_diff(&result[0], &expect[0], m, n, ldc));\n#endif\n      }\n\n      const libxsmm_mm_dispatch<T> xmm(m, n, k);\n      if (xmm) { \/\/ specialized routine\n        fprintf(stdout, \"Specialized...\\n\");\n        std::fill(result.begin(), result.end(), 0);\n#if defined(_OPENMP)\n        const double start = omp_get_wtime();\n#       pragma omp parallel for\n#endif\n        for (int i = 0; i < s; i += t) {\n          LIBXSMM_ALIGNED(T tmp[SMM_MAX_PROBLEM_SIZE], SMM_ALIGNMENT);\n          for (int j = 0; j < csize; ++j) tmp[j] = 0; \/\/ clear\n          for (int j = 0; j < LIBXSMM_MIN(t, s - i); ++j) {\n            xmm(&a[0] + (i + j) * asize, &b[0] + (i + j) * bsize, tmp);\n          }\n          add(&result[0], tmp, m, n, ldc); \/\/ atomic\n        }\n#if defined(_OPENMP)\n        const double duration = omp_get_wtime() - start;\n        if (0 < duration) {\n          fprintf(stdout, \"\\tperformance: %.1f GFLOPS\/s\\n\", gflops \/ duration);\n        }\n        fprintf(stdout, \"\\tduration: %.1f s\\n\", duration);\n#endif\n#if defined(SMM_CHECK)\n        fprintf(stdout, \"\\tdiff=%f\\n\", max_diff(&result[0], &expect[0], m, n, ldc));\n#endif\n      }\n    }\n  }\n  catch(const std::exception& e) {\n    fprintf(stderr, \"Error: %s\\n\", e.what());\n    return EXIT_FAILURE;\n  }\n  catch(...) {\n    fprintf(stderr, \"Error: unknown exception caught!\\n\");\n    return EXIT_FAILURE;\n  }\n\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Kopete , The KDE Instant Messenger\n    Copyright (c) 2001-2002 by Duncan Mac-Vicar Prett <duncan@kde.org>\n\n    Viva Chile Mierda!\n    Started at Wed Dec 26 03:12:10 CLST 2001, Santiago de Chile\n\n    Kopete    (c) 2002-2008 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 <kcmdlineargs.h>\n#include <kaboutdata.h>\n#include <klocale.h>\n\n#include \"kopeteapplication.h\"\n#include \"kopeteversion.h\"\n\nstatic const char description[] =\n\tI18N_NOOP( \"Kopete, the KDE Instant Messenger\" );\n\nint main( int argc, char *argv[] )\n{\n\tKAboutData aboutData( \"kopete\", 0, ki18n(\"Kopete\"),\n\t\tKOPETE_VERSION_STRING, ki18n(description), KAboutData::License_GPL,\n\t\tki18n(\"(c) 2001-2004, Duncan Mac-Vicar Prett\\n(c) 2002-2008, Kopete Development Team\"), ki18n(\"kopete-devel@kde.org\"), \"http:\/\/kopete.kde.org\");\n\n\taboutData.addAuthor ( ki18n(\"Duncan Mac-Vicar Prett\"), ki18n(\"Developer and Project founder\"), \"duncan@kde.org\", \"http:\/\/www.mac-vicar.org\/~duncan\" );\n\taboutData.addAuthor ( ki18n(\"Andre Duffeck\"), ki18n(\"Developer, Yahoo plugin maintainer\"), \"duffeck@kde.org\" );\n\taboutData.addAuthor ( ki18n(\"Andy Goossens\"), ki18n(\"Developer\"), \"andygoossens@telenet.be\" );\n\taboutData.addAuthor ( ki18n(\"Chris Howells\"), ki18n(\"Developer, Connection status plugin author\"), \"howells@kde.org\", \"http:\/\/chrishowells.co.uk\");\n\taboutData.addAuthor ( ki18n(\"Cláudio da Silveira Pinheiro\"), ki18n(\"Developer, Video device support\"), \"taupter@gmail.com\", \"http:\/\/taupter.homelinux.org\" );\n\taboutData.addAuthor ( ki18n(\"Gregg Edghill\"), ki18n(\"Developer, MSN\"), \"gregg.edghill@gmail.com\");\n\taboutData.addAuthor ( ki18n(\"Grzegorz Jaskiewicz\"), ki18n(\"Developer, Gadu plugin maintainer\"), \"gj@pointblue.com.pl\" );\n\taboutData.addAuthor ( ki18n(\"Gustavo Pichorim Boiko\"), ki18n(\"Developer\"), \"gustavo.boiko@kdemail.net\" );\n\taboutData.addAuthor ( ki18n(\"Jason Keirstead\"), ki18n(\"Developer\"), \"jason@keirstead.org\", \"http:\/\/www.keirstead.org\");\n\taboutData.addAuthor ( ki18n(\"Matt Rogers\"), ki18n(\"Lead Developer, AIM and ICQ plugin maintainer\"), \"mattr@kde.org\" );\n\taboutData.addAuthor ( ki18n(\"Michel Hermier\"), ki18n(\"IRC plugin maintainer\"), \"michel.hermier@wanadoo.fr\" );\n\taboutData.addAuthor ( ki18n(\"Michaël Larouche\"), ki18n(\"Lead Developer, Telepathy and Messenger plugin maintainer\"), \"larouche@kde.org\", \"http:\/\/www.tehbisnatch.org\/\" );\n\taboutData.addAuthor ( ki18n(\"Olivier Goffart\"), ki18n(\"Lead Developer, MSN plugin maintainer\"), \"ogoffart@kde.org\");\n\taboutData.addAuthor ( ki18n(\"Ollivier Lapeyre Johann\"), ki18n(\"Artist \/ Developer, Artwork maintainer\"), \"johann.ollivierlapeyre@gmail.com\" );\n\taboutData.addAuthor ( ki18n(\"Richard Smith\"), ki18n(\"Developer, UI maintainer\"), \"kde@metafoo.co.uk\" );\n\taboutData.addAuthor ( ki18n(\"Tiago Salem Herrmann\"), ki18n(\"Developer, WLM plugin maintainer\"), \"tiagosh@gmail.com\");\n\taboutData.addAuthor ( ki18n(\"Till Gerken\"), ki18n(\"Developer, Jabber plugin maintainer\"), \"till@tantalo.net\");\n\taboutData.addAuthor ( ki18n(\"Will Stephenson\"), ki18n(\"Lead Developer, GroupWise maintainer\"), \"wstephenson@kde.org\" );\n\taboutData.addAuthor ( ki18n(\"Rafael Fernández López\"), ki18n(\"Developer\"), \"ereslibre@kde.org\" );\n\taboutData.addAuthor ( ki18n(\"Roman Jarosz\"), ki18n(\"Developer, AIM and ICQ\"), \"kedgedev@centrum.cz\" );\n\taboutData.addAuthor ( ki18n(\"Charles Connell\"), ki18n(\"Developer\"), \"charles@connells.org\" );\n\taboutData.addAuthor ( ki18n(\"Tejas Dinkar\"), ki18n(\"Developer, Bonjour Plugin Maintainer\"), \"tejas@gja.in\", \"http:\/\/www.gja.in\" );\n\taboutData.addAuthor ( ki18n(\"Pali Rohár\"), ki18n(\"Developer, Skype plugin maintainer\"), \"pali.rohar@gmail.com\" );\n\n\taboutData.addCredit ( ki18n(\"Vally8\"), ki18n(\"Konki style author\"), \"vally8@gmail.com\", \"http:\/\/vally8.free.fr\/\" );\n\taboutData.addCredit ( ki18n(\"Tm_T\"), ki18n(\"Hacker style author\"), \"jussi.kekkonen@gmail.com\");\n\taboutData.addCredit ( ki18n(\"Luciash d' Being\"), ki18n(\"Kopete's icon author\") );\n\taboutData.addCredit ( ki18n(\"Steve Cable\"), ki18n(\"Sounds\") );\n\taboutData.addCredit ( ki18n(\"Jessica Hall\"), ki18n(\"Kopete Docugoddess, Bug and Patch Testing.\") );\n\taboutData.addCredit ( ki18n(\"Justin Karneges\"), ki18n(\"Iris Jabber Backend Library\") );\n\taboutData.addCredit ( ki18n(\"Tom Linsky\"), ki18n(\"OscarSocket author\"), \"twl6@po.cwru.edu\" );\n\taboutData.addCredit ( ki18n(\"Olaf Lueg\"), ki18n(\"Kmerlin MSN code\") );\n\taboutData.addCredit ( ki18n(\"Chetan Reddy\"), ki18n(\"Former developer\"), \"chetan13@gmail.com\" );\n\taboutData.addCredit ( ki18n(\"Nick Betcher\"), ki18n(\"Former developer, project co-founder\"), \"nbetcher@kde.org\");\n\taboutData.addCredit ( ki18n(\"Ryan Cumming\"), ki18n(\"Former developer\"), \"ryan@kde.org\" );\n\taboutData.addCredit ( ki18n(\"Stefan Gehn\"), ki18n(\"Former developer\"), \"metz@gehn.net\", \"http:\/\/metz.gehn.net\" );\n\taboutData.addCredit ( ki18n(\"Martijn Klingens\"), ki18n(\"Former developer\"), \"klingens@kde.org\" );\n\taboutData.addCredit ( ki18n(\"Andres Krapf\"), ki18n(\"Former developer\"), \"dae@chez.com\" );\n\taboutData.addCredit ( ki18n(\"Carsten Pfeiffer\"), ki18n(\"Misc bugfixes and enhancements\"), \"pfeiffer@kde.org\" );\n\taboutData.addCredit ( ki18n(\"Zack Rusin\"), ki18n(\"Former developer, original Gadu plugin author\"), \"zack@kde.org\" );\n\taboutData.addCredit ( ki18n(\"Richard Stellingwerff\"), ki18n(\"Former developer\"), \"remenic@linuxfromscratch.org\");\n\taboutData.addCredit ( ki18n(\"Daniel Stone\"), ki18n(\"Former developer, Jabber plugin author\"), \"daniel@fooishbar.org\", \"http:\/\/fooishbar.org\");\n\taboutData.addCredit ( ki18n(\"Chris TenHarmsel\"), ki18n(\"Former developer, Oscar plugin\"), \"chris@tenharmsel.com\");\n\taboutData.addCredit ( ki18n(\"Hendrik vom Lehn\"), ki18n(\"Former developer\"), \"hennevl@hennevl.de\", \"http:\/\/www.hennevl.de\");\n\taboutData.addCredit ( ki18n(\"Gav Wood\"), ki18n(\"Former developer and WinPopup maintainer\"), \"gav@indigoarchive.net\" );\n\n\taboutData.setTranslator( ki18nc(\"NAME OF TRANSLATORS\",\"Your names\"),\n\t\tki18nc(\"EMAIL OF TRANSLATORS\",\"Your emails\") );\n\n\tKCmdLineArgs::init( argc, argv, &aboutData );\n\n\tKCmdLineOptions options;\n\toptions.add(\"noplugins\", ki18n( \"Do not load plugins. This option overrides all other options.\" ));\n\toptions.add(\"noconnect\", ki18n( \"Disable auto-connection\" ));\n\toptions.add(\"autoconnect <accounts>\", ki18n( \"Auto-connect the specified accounts. Use a comma-separated list\\n\"\n\t\t\"to auto-connect multiple accounts.\" ));\n\toptions.add(\"disable <plugins>\", ki18n( \"Do not load the specified plugin. Use a comma-separated list\\n\"\n\t\t\"to disable multiple plugins.\" ));\n\toptions.add(\"load-plugins <plugins>\", ki18n( \"Load only the specified plugins. Use a comma-separated list\\n\"\n\t\t\"to load multiple plugins. This option has no effect when\\n\"\n\t\t\"--noplugins is set and overrides all other plugin related\\n\"\n\t\t\"command line options.\" ));\n\t\/\/\t{ \"url <url>\",              I18N_NOOP( \"Load the given Kopete URL\" ), 0 },\n\/\/\t{ \"!+[plugin]\",            I18N_NOOP( \"Load specified plugins\" ), 0 },\n\toptions.add(\"!+[URL]\", ki18n(\"URLs to pass to kopete \/ emoticon themes to install\"));\n\tKCmdLineArgs::addCmdLineOptions( options ); \/\/ Add our own options.\n\tKUniqueApplication::addCmdLineOptions();\n\n\tKopeteApplication kopete;\n\treturn kopete.exec();\n}\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n<commit_msg>Update my credits<commit_after>\/*\n    Kopete , The KDE Instant Messenger\n    Copyright (c) 2001-2002 by Duncan Mac-Vicar Prett <duncan@kde.org>\n\n    Viva Chile Mierda!\n    Started at Wed Dec 26 03:12:10 CLST 2001, Santiago de Chile\n\n    Kopete    (c) 2002-2008 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 <kcmdlineargs.h>\n#include <kaboutdata.h>\n#include <klocale.h>\n\n#include \"kopeteapplication.h\"\n#include \"kopeteversion.h\"\n\nstatic const char description[] =\n\tI18N_NOOP( \"Kopete, the KDE Instant Messenger\" );\n\nint main( int argc, char *argv[] )\n{\n\tKAboutData aboutData( \"kopete\", 0, ki18n(\"Kopete\"),\n\t\tKOPETE_VERSION_STRING, ki18n(description), KAboutData::License_GPL,\n\t\tki18n(\"(c) 2001-2004, Duncan Mac-Vicar Prett\\n(c) 2002-2008, Kopete Development Team\"), ki18n(\"kopete-devel@kde.org\"), \"http:\/\/kopete.kde.org\");\n\n\taboutData.addAuthor ( ki18n(\"Pali Rohár\"), ki18n(\"Developer and maintainer\"), \"pali.rohar@gmail.com\" );\n\taboutData.addAuthor ( ki18n(\"Duncan Mac-Vicar Prett\"), ki18n(\"Developer and Project founder\"), \"duncan@kde.org\", \"http:\/\/www.mac-vicar.org\/~duncan\" );\n\taboutData.addAuthor ( ki18n(\"Andre Duffeck\"), ki18n(\"Developer, Yahoo plugin maintainer\"), \"duffeck@kde.org\" );\n\taboutData.addAuthor ( ki18n(\"Andy Goossens\"), ki18n(\"Developer\"), \"andygoossens@telenet.be\" );\n\taboutData.addAuthor ( ki18n(\"Chris Howells\"), ki18n(\"Developer, Connection status plugin author\"), \"howells@kde.org\", \"http:\/\/chrishowells.co.uk\");\n\taboutData.addAuthor ( ki18n(\"Cláudio da Silveira Pinheiro\"), ki18n(\"Developer, Video device support\"), \"taupter@gmail.com\", \"http:\/\/taupter.homelinux.org\" );\n\taboutData.addAuthor ( ki18n(\"Gregg Edghill\"), ki18n(\"Developer, MSN\"), \"gregg.edghill@gmail.com\");\n\taboutData.addAuthor ( ki18n(\"Grzegorz Jaskiewicz\"), ki18n(\"Developer, Gadu plugin maintainer\"), \"gj@pointblue.com.pl\" );\n\taboutData.addAuthor ( ki18n(\"Gustavo Pichorim Boiko\"), ki18n(\"Developer\"), \"gustavo.boiko@kdemail.net\" );\n\taboutData.addAuthor ( ki18n(\"Jason Keirstead\"), ki18n(\"Developer\"), \"jason@keirstead.org\", \"http:\/\/www.keirstead.org\");\n\taboutData.addAuthor ( ki18n(\"Matt Rogers\"), ki18n(\"Lead Developer, AIM and ICQ plugin maintainer\"), \"mattr@kde.org\" );\n\taboutData.addAuthor ( ki18n(\"Michel Hermier\"), ki18n(\"IRC plugin maintainer\"), \"michel.hermier@wanadoo.fr\" );\n\taboutData.addAuthor ( ki18n(\"Michaël Larouche\"), ki18n(\"Lead Developer, Telepathy and Messenger plugin maintainer\"), \"larouche@kde.org\", \"http:\/\/www.tehbisnatch.org\/\" );\n\taboutData.addAuthor ( ki18n(\"Olivier Goffart\"), ki18n(\"Lead Developer, MSN plugin maintainer\"), \"ogoffart@kde.org\");\n\taboutData.addAuthor ( ki18n(\"Ollivier Lapeyre Johann\"), ki18n(\"Artist \/ Developer, Artwork maintainer\"), \"johann.ollivierlapeyre@gmail.com\" );\n\taboutData.addAuthor ( ki18n(\"Richard Smith\"), ki18n(\"Developer, UI maintainer\"), \"kde@metafoo.co.uk\" );\n\taboutData.addAuthor ( ki18n(\"Tiago Salem Herrmann\"), ki18n(\"Developer, WLM plugin maintainer\"), \"tiagosh@gmail.com\");\n\taboutData.addAuthor ( ki18n(\"Till Gerken\"), ki18n(\"Developer, Jabber plugin maintainer\"), \"till@tantalo.net\");\n\taboutData.addAuthor ( ki18n(\"Will Stephenson\"), ki18n(\"Lead Developer, GroupWise maintainer\"), \"wstephenson@kde.org\" );\n\taboutData.addAuthor ( ki18n(\"Rafael Fernández López\"), ki18n(\"Developer\"), \"ereslibre@kde.org\" );\n\taboutData.addAuthor ( ki18n(\"Roman Jarosz\"), ki18n(\"Developer, AIM and ICQ\"), \"kedgedev@centrum.cz\" );\n\taboutData.addAuthor ( ki18n(\"Charles Connell\"), ki18n(\"Developer\"), \"charles@connells.org\" );\n\taboutData.addAuthor ( ki18n(\"Tejas Dinkar\"), ki18n(\"Developer, Bonjour Plugin Maintainer\"), \"tejas@gja.in\", \"http:\/\/www.gja.in\" );\n\n\taboutData.addCredit ( ki18n(\"Vally8\"), ki18n(\"Konki style author\"), \"vally8@gmail.com\", \"http:\/\/vally8.free.fr\/\" );\n\taboutData.addCredit ( ki18n(\"Tm_T\"), ki18n(\"Hacker style author\"), \"jussi.kekkonen@gmail.com\");\n\taboutData.addCredit ( ki18n(\"Luciash d' Being\"), ki18n(\"Kopete's icon author\") );\n\taboutData.addCredit ( ki18n(\"Steve Cable\"), ki18n(\"Sounds\") );\n\taboutData.addCredit ( ki18n(\"Jessica Hall\"), ki18n(\"Kopete Docugoddess, Bug and Patch Testing.\") );\n\taboutData.addCredit ( ki18n(\"Justin Karneges\"), ki18n(\"Iris Jabber Backend Library\") );\n\taboutData.addCredit ( ki18n(\"Tom Linsky\"), ki18n(\"OscarSocket author\"), \"twl6@po.cwru.edu\" );\n\taboutData.addCredit ( ki18n(\"Olaf Lueg\"), ki18n(\"Kmerlin MSN code\") );\n\taboutData.addCredit ( ki18n(\"Chetan Reddy\"), ki18n(\"Former developer\"), \"chetan13@gmail.com\" );\n\taboutData.addCredit ( ki18n(\"Nick Betcher\"), ki18n(\"Former developer, project co-founder\"), \"nbetcher@kde.org\");\n\taboutData.addCredit ( ki18n(\"Ryan Cumming\"), ki18n(\"Former developer\"), \"ryan@kde.org\" );\n\taboutData.addCredit ( ki18n(\"Stefan Gehn\"), ki18n(\"Former developer\"), \"metz@gehn.net\", \"http:\/\/metz.gehn.net\" );\n\taboutData.addCredit ( ki18n(\"Martijn Klingens\"), ki18n(\"Former developer\"), \"klingens@kde.org\" );\n\taboutData.addCredit ( ki18n(\"Andres Krapf\"), ki18n(\"Former developer\"), \"dae@chez.com\" );\n\taboutData.addCredit ( ki18n(\"Carsten Pfeiffer\"), ki18n(\"Misc bugfixes and enhancements\"), \"pfeiffer@kde.org\" );\n\taboutData.addCredit ( ki18n(\"Zack Rusin\"), ki18n(\"Former developer, original Gadu plugin author\"), \"zack@kde.org\" );\n\taboutData.addCredit ( ki18n(\"Richard Stellingwerff\"), ki18n(\"Former developer\"), \"remenic@linuxfromscratch.org\");\n\taboutData.addCredit ( ki18n(\"Daniel Stone\"), ki18n(\"Former developer, Jabber plugin author\"), \"daniel@fooishbar.org\", \"http:\/\/fooishbar.org\");\n\taboutData.addCredit ( ki18n(\"Chris TenHarmsel\"), ki18n(\"Former developer, Oscar plugin\"), \"chris@tenharmsel.com\");\n\taboutData.addCredit ( ki18n(\"Hendrik vom Lehn\"), ki18n(\"Former developer\"), \"hennevl@hennevl.de\", \"http:\/\/www.hennevl.de\");\n\taboutData.addCredit ( ki18n(\"Gav Wood\"), ki18n(\"Former developer and WinPopup maintainer\"), \"gav@indigoarchive.net\" );\n\n\taboutData.setTranslator( ki18nc(\"NAME OF TRANSLATORS\",\"Your names\"),\n\t\tki18nc(\"EMAIL OF TRANSLATORS\",\"Your emails\") );\n\n\tKCmdLineArgs::init( argc, argv, &aboutData );\n\n\tKCmdLineOptions options;\n\toptions.add(\"noplugins\", ki18n( \"Do not load plugins. This option overrides all other options.\" ));\n\toptions.add(\"noconnect\", ki18n( \"Disable auto-connection\" ));\n\toptions.add(\"autoconnect <accounts>\", ki18n( \"Auto-connect the specified accounts. Use a comma-separated list\\n\"\n\t\t\"to auto-connect multiple accounts.\" ));\n\toptions.add(\"disable <plugins>\", ki18n( \"Do not load the specified plugin. Use a comma-separated list\\n\"\n\t\t\"to disable multiple plugins.\" ));\n\toptions.add(\"load-plugins <plugins>\", ki18n( \"Load only the specified plugins. Use a comma-separated list\\n\"\n\t\t\"to load multiple plugins. This option has no effect when\\n\"\n\t\t\"--noplugins is set and overrides all other plugin related\\n\"\n\t\t\"command line options.\" ));\n\t\/\/\t{ \"url <url>\",              I18N_NOOP( \"Load the given Kopete URL\" ), 0 },\n\/\/\t{ \"!+[plugin]\",            I18N_NOOP( \"Load specified plugins\" ), 0 },\n\toptions.add(\"!+[URL]\", ki18n(\"URLs to pass to kopete \/ emoticon themes to install\"));\n\tKCmdLineArgs::addCmdLineOptions( options ); \/\/ Add our own options.\n\tKUniqueApplication::addCmdLineOptions();\n\n\tKopeteApplication kopete;\n\treturn kopete.exec();\n}\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n<|endoftext|>"}
{"text":"<commit_before>#define PROG_VERSION \"v0.1.0-alpha\"\n\n\/\/Owns files\n#include \"cmdparser.hpp\"\n#include \"log.hpp\"\n#include \"reads.hpp\"\n#include \"readsTools.hpp\"\n#include \"workerCL.hpp\"\n\n\/\/Standards libs\n#include <iostream>\n#include <string>\n#include <map>\n#include <vector>\n#include <thread>\n\n\nusing namespace std;\n\n\/*\nFunction to get the scores matrix between all contigs of a same set. Used in mono and multithreading.\n*\/\n\nvoid contigs_cmp(size_t id_begin, size_t id_end, vector< vector< int8_t> >& scores, const Contigs& contigs){\n\tReadsTools readsTools; \/\/Toolsbox containing the function to cmp reads\n\tfor(size_t c = 0; c < contigs.get_nbContigs(); c++){\n\t\tstring seq_c = contigs.get_seqContig(c);\n\t\tfor(size_t i=id_begin; i <= id_end; i++){\n\t\t\t\/\/if same read, score = 0\n\t\t\t\/\/Else compare\n\t\t\tif(c == i){scores[c][i] = 0;}\n\t\t\telse{\n\t\t\t\tstring seq_i = contigs.get_seqContig(i);\n\t\t\t\t\n\t\t\t\tscores[c][i] = readsTools.scoreCmpReads(seq_c, seq_i);\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n\/*\nHeart of the program\n*\/\n\nint main(int argc, char* argv[]){\n\t\/* Initialisation :\n\t\t1\/ Check and parse parameters and options\n\t\t2\/ Display infos\n\t\t3\/ Initialize OpenCL\n\t*\/\n\t\/\/Get parameters and options (Includes\/cmdparser.hpp using optionsparser.h)\n\tParams params = parse(argc, argv);\n\tLog log(params.logs);\n\n\t\/\/Display infos\n\tlog.write( \"[STEP]\\tInitialisation\" );\n\n\tif(!params.gpu_infos){ \/\/normal infos\n\t\tlog.write( \"=== Infos ===\" );\n\t\tlog.write(params.infosToString());\n\t}\n\telse{ \/\/Asked GPU infos\n\t\tlog.write( \"=== OpenCL infos ===\" );\n\t\tWorkerCL::list_infos(log);\n\t\treturn 0; \/\/End prog\n\t}\n\n\t\/\/Initialize gpu (used only if gpu is asked)\n\tWorkerCL* workerCL = nullptr;\n\ttry{\n\t\tif(params.gpu){\n\t\t\tlog.write(\"=== OpenCL initialisation ===\");\n\t\t\tworkerCL = new WorkerCL(params.opencl_platform_id, params.opencl_device_id, log);\n\t\t}\n\t}\n\tcatch(string opencl_err){\n\t\tlog.write(opencl_err);\n\t}\n\n\t\/* Data gathering :\n\t\t1\/ read file (get reads) (encode and store them)\n\t\t2\/ Create the contigs list. It creates a \"contig\" for each read. A contig contain the ids of its reads and its sequence\n\t\t3\/ Initialize the 2D array (vector) to store each reads-reads score alignment\n\t*\/\n\tlog.write( \"\\n[STEP]\\tData gathering\" );\n\t\n\tlog.write( \"=== File reading ===\" );\n\tReads reads;\n\treads.readFile_fasta(params.readsFile);\n\t{\n\t\tstring s = \"nbReads = \" + to_string(reads.get_nbReads());\n\t\tlog.write(s);\n\t}\n\tlog.write( \"=== Create contigs ===\" );\n\tContigs contigs( &reads );\n\tsize_t nbContigs = contigs.get_nbContigs();\n\t{\n\t\tstring s = \"number of contigs = \" + to_string(nbContigs);\n\t\tlog.write(s);\n\t}\n\t\n\t\n\t\/\/ Cycles\n\tlog.write( \"\\n[STEP]\\tCycles\" );\n\n\tbool in_progress = true; \/\/There is still progress ?\n\tsize_t cycles = 0;\n\n\twhile(in_progress){\n\t\tcycles++;\n\t\t{\n\t\t\tstring s = \"===== Cycle \"+to_string(cycles)+\" =====\";\n\t\t\tlog.write(s);\n\t\t\tlog.write( \"=== Calculate score between each contig ===\" );\n\t\t}\n\n\t\t\/*\n\t\t Create a 2D array of size of nb of contigs storing for each pair of contigs their alignment score.\n\t\t 0 means a bad alignment.\n\t\t The second element is match on the first element.\n\t\t >0 gives the score of a normal alignment\n\t\t <0 gives the score (the absolute value) of the complementary alignment\n\t\t The highest absolute value is stored (for example: for two read A et B if the score of the normal is 10 and\n\t\t the score of the complementary alignment is 25, -25 will be stored\n\t\t*\/\n\t\tnbContigs = contigs.get_nbContigs();\n\t\tvector< vector< int8_t > > scores = vector< vector<int8_t> >(nbContigs, vector<int8_t>(nbContigs, 0));\n\t\t\n\t\t\t\/\/ GPU ?\n\t\tif(params.gpu){\n\t\t\tworkerCL->run(contigs, params.opencl_work_group_size);\n\t\t}\n\t\t\t\/\/ Multithreading ?\n\t\telse if(params.nbthreads > 1){\n\t\t\tvector<thread> workers;\n\t\t\tsize_t id_begin=0;\n\n\t\t\t\/\/the main is a thread; So the number of worker = (number_of_threads_asked - 1).\n\t\t\t\/\/Launch threads\n\t\t\tfor(size_t w=0; w < params.nbthreads-1; w++){\n\t\t\t\t\/\/Number of contigs to cmp in this thread\n\t\t\t\tsize_t nb_contigs_cmp = nbContigs\/params.nbthreads + (( w < (nbContigs % params.nbthreads) )?1:0);\n\t\t\t\t\/\/cout << \"Thread \" << w << \": \" << nb_contigs_cmp << \" contigs.\" << endl;\n\n\t\t\t\t\/\/If there is contigs to cmp, we run the thread\n\t\t\t\tif(nb_contigs_cmp){\n\t\t\t\t\tsize_t id_end=id_begin+nb_contigs_cmp-1;\n\t\t\t\t\tworkers.emplace_back(contigs_cmp, id_begin, id_end, ref(scores), ref(contigs));\n\t\t\t\t\t\/\/cout << \"Thread \" << w << \" on \" << id_begin << \" to \" << id_end << endl;\n\t\t\t\t\tid_begin = id_end+1; \/\/Prepare next\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t\n\t\t\t\/\/Run remainings contigs on main\n\t\t\tif(id_begin < nbContigs){\n\t\t\t\t\/\/cout << \"Thread main on \" << id_begin << \" to \" << nbContigs-1 << endl;\n\t\t\t\tcontigs_cmp(id_begin, nbContigs-1, scores, contigs);\n\t\t\t}\n\n\t\t\t\/\/Wait the end of threads\n\t\t\tfor(size_t w = 0; w < workers.size(); w++){\n\t\t\t\tworkers[w].join();\n\t\t\t}\n\n\t\t}\n\t\t\t\/\/ Monothreading\n\t\telse{\n\t\t\tcontigs_cmp(0, nbContigs-1, scores, contigs);\n\t\t}\n\n\t\t\/*\n\t\tlog.write(\"---- matrix of scores ----\");\n\t\tstring out;\n\t\tfor(size_t i=0; i < nbContigs; i++){out += \"\\t\" + to_string(i);}\n\t\tlog.write(out);\n\n\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\tout = to_string(i);\n\t\t\tfor(size_t j=0; j < nbContigs; j++){\n\t\t\t\tout += \"\\t\"+to_string(scores[i][j]);\n\t\t\t}\n\t\t\tlog.write(out);\n\t\t}\n\t\tlog.write(\"---- end of matrix ----\");\n\t\t*\/\n\n\t\t\/\/Merge best couples (when score >= requirement)\n\t\tlog.write(\"=== Merging best contigs couples ===\");\n\t\tint8_t b; \/\/best couples score\n\t\tdo {\n\t\t\tb=0;\n\t\t\tsize_t b_id1=0;\n\t\t\tsize_t b_id2=0;\n\t\t\t\/\/ Get best couple\n\t\t\tfor(size_t id1=0; id1 < nbContigs; id1++){\n\t\t\t\tfor(size_t id2=id1+1; id2 < nbContigs; id2++){\n\t\t\t\t\t\/\/Get score, is it better ?\n\t\t\t\t\tif(abs(scores[id1][id2]) > b){\n\t\t\t\t\t\t\/\/keep this couple\n\t\t\t\t\t\tb = abs(scores[id1][id2]);\n\t\t\t\t\t\tb_id1 = id1;\n\t\t\t\t\t\tb_id2 = id2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/If score > requirement : merge this 2 \n\t\t\tif(b >= params.requiredScore){\n\t\t\t\t\/\/Merge\n\t\t\t\tcontigs.merge_contigs(b_id1, b_id2, scores[b_id1][b_id2]);\n\n\t\t\t\t\/\/clean the done and not possible couples after this merge\n\t\t\t\t\t\/\/This couple and its opposite\n\t\t\t\tscores[b_id1][b_id2]=0;\n\t\t\t\tscores[b_id2][b_id1]=0;\n\t\t\t\t\t\/\/The 'end' of contig1 is used\n\t\t\t\t\t\t\/\/All couple with contig1 first\n\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\tscores[b_id1][i]=0;\n\t\t\t\t}\n\t\t\t\t\t\t\/\/All couple with contig1 reversed as second \n\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\tif(scores[i][b_id1]<0){scores[i][b_id1]=0;}\n\t\t\t\t}\n\n\t\t\t\t\t\/\/contig2 normal ? The begin is used\n\t\t\t\tif(scores[b_id1][b_id2] > 0){\n\t\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\t\tif(scores[i][b_id2]>0){scores[i][b_id2]=0;}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\t\/\/else contig2 is reversed: the end is used\n\t\t\t\telse{\n\t\t\t\t\t\t\/\/All couples beginning with contig2\n\t\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\t\tscores[b_id2][i]=0;\n\t\t\t\t\t}\n\t\t\t\t\t\t\/\/All couples with contig2 as second and reversed\n\t\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\t\tif(scores[i][b_id2] < 0){scores[i][b_id2]=0;}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t} while (b >= params.requiredScore);\n\n\n\t\t\/\/Synchronize the contigs list\n\t\tlog.write(\"=== Synchronisation ===\");\n\t\tcontigs.sync_contigs_list();\n\t\t\n\t\t\/\/Get the evolution. None: stop it.\n\t\tsize_t new_nbContigs = contigs.get_nbContigs();\n\n\t\tstring s = \"nb contigs merged = \" + to_string(nbContigs - new_nbContigs);\n\t\ts += \"\\nnb contigs remaining = \" + to_string(new_nbContigs);\n\t\tif(new_nbContigs == nbContigs){\n\t\t\ts += \"\\nNo evolution. Stopping.\";\n\t\t\tin_progress=false;\n\t\t}\n\t\tlog.write(s);\n\n\t\t\/\/End of cycle\n\t\tlog.write(\"===== Cycle end =====\\n\");\n\t}\n\n\t\/\/Free workerCL (if created)\n\tif(params.gpu){\n\t\tcout << \"Deleting gpu worker\" << endl;\n\t\tdelete workerCL;\n\t\tworkerCL = nullptr;\n\t\tcout << \"\\t- Done\" << endl;\n\t}\n\n\t\/\/End of program\n\treturn 0;\n}\n<commit_msg>Get scores matrix from gpu run. Display (debug) matrix.<commit_after>#define PROG_VERSION \"v0.1.0-alpha\"\n\n\/\/Owns files\n#include \"cmdparser.hpp\"\n#include \"log.hpp\"\n#include \"reads.hpp\"\n#include \"readsTools.hpp\"\n#include \"workerCL.hpp\"\n\n\/\/Standards libs\n#include <iostream>\n#include <string>\n#include <map>\n#include <vector>\n#include <thread>\n\n\nusing namespace std;\n\n\/*\nFunction to get the scores matrix between all contigs of a same set. Used in mono and multithreading.\n*\/\n\nvoid contigs_cmp(size_t id_begin, size_t id_end, vector< vector< int8_t> >& scores, const Contigs& contigs){\n\tReadsTools readsTools; \/\/Toolsbox containing the function to cmp reads\n\tfor(size_t c = 0; c < contigs.get_nbContigs(); c++){\n\t\tstring seq_c = contigs.get_seqContig(c);\n\t\tfor(size_t i=id_begin; i <= id_end; i++){\n\t\t\t\/\/if same read, score = 0\n\t\t\t\/\/Else compare\n\t\t\tif(c == i){scores[c][i] = 0;}\n\t\t\telse{\n\t\t\t\tstring seq_i = contigs.get_seqContig(i);\n\t\t\t\t\n\t\t\t\tscores[c][i] = readsTools.scoreCmpReads(seq_c, seq_i);\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n\/*\nHeart of the program\n*\/\n\nint main(int argc, char* argv[]){\n\t\/* Initialisation :\n\t\t1\/ Check and parse parameters and options\n\t\t2\/ Display infos\n\t\t3\/ Initialize OpenCL\n\t*\/\n\t\/\/Get parameters and options (Includes\/cmdparser.hpp using optionsparser.h)\n\tParams params = parse(argc, argv);\n\tLog log(params.logs);\n\n\t\/\/Display infos\n\tlog.write( \"[STEP]\\tInitialisation\" );\n\n\tif(!params.gpu_infos){ \/\/normal infos\n\t\tlog.write( \"=== Infos ===\" );\n\t\tlog.write(params.infosToString());\n\t}\n\telse{ \/\/Asked GPU infos\n\t\tlog.write( \"=== OpenCL infos ===\" );\n\t\tWorkerCL::list_infos(log);\n\t\treturn 0; \/\/End prog\n\t}\n\n\t\/\/Initialize gpu (used only if gpu is asked)\n\tWorkerCL* workerCL = nullptr;\n\ttry{\n\t\tif(params.gpu){\n\t\t\tlog.write(\"=== OpenCL initialisation ===\");\n\t\t\tworkerCL = new WorkerCL(params.opencl_platform_id, params.opencl_device_id, log);\n\t\t}\n\t}\n\tcatch(string opencl_err){\n\t\tlog.write(opencl_err);\n\t}\n\n\t\/* Data gathering :\n\t\t1\/ read file (get reads) (encode and store them)\n\t\t2\/ Create the contigs list. It creates a \"contig\" for each read. A contig contain the ids of its reads and its sequence\n\t\t3\/ Initialize the 2D array (vector) to store each reads-reads score alignment\n\t*\/\n\tlog.write( \"\\n[STEP]\\tData gathering\" );\n\t\n\tlog.write( \"=== File reading ===\" );\n\tReads reads;\n\treads.readFile_fasta(params.readsFile);\n\t{\n\t\tstring s = \"nbReads = \" + to_string(reads.get_nbReads());\n\t\tlog.write(s);\n\t}\n\tlog.write( \"=== Create contigs ===\" );\n\tContigs contigs( &reads );\n\tsize_t nbContigs = contigs.get_nbContigs();\n\t{\n\t\tstring s = \"number of contigs = \" + to_string(nbContigs);\n\t\tlog.write(s);\n\t}\n\t\n\t\n\t\/\/ Cycles\n\tlog.write( \"\\n[STEP]\\tCycles\" );\n\n\tbool in_progress = true; \/\/There is still progress ?\n\tsize_t cycles = 0;\n\n\twhile(in_progress){\n\t\tcycles++;\n\t\t{\n\t\t\tstring s = \"===== Cycle \"+to_string(cycles)+\" =====\";\n\t\t\tlog.write(s);\n\t\t\tlog.write( \"=== Calculate score between each contig ===\" );\n\t\t}\n\n\t\t\/*\n\t\t Create a 2D array of size of nb of contigs storing for each pair of contigs their alignment score.\n\t\t 0 means a bad alignment.\n\t\t The second element is match on the first element.\n\t\t >0 gives the score of a normal alignment\n\t\t <0 gives the score (the absolute value) of the complementary alignment\n\t\t The highest absolute value is stored (for example: for two read A et B if the score of the normal is 10 and\n\t\t the score of the complementary alignment is 25, -25 will be stored\n\t\t*\/\n\t\tnbContigs = contigs.get_nbContigs();\n\t\tvector< vector< int8_t > > scores = vector< vector<int8_t> >(nbContigs, vector<int8_t>(nbContigs, 0));\n\t\t\n\t\t\t\/\/ GPU ?\n\t\tif(params.gpu){\n\t\t\tscores = workerCL->run(contigs, params.opencl_work_group_size);\n\t\t}\n\t\t\t\/\/ Multithreading ?\n\t\telse if(params.nbthreads > 1){\n\t\t\tvector<thread> workers;\n\t\t\tsize_t id_begin=0;\n\n\t\t\t\/\/the main is a thread; So the number of worker = (number_of_threads_asked - 1).\n\t\t\t\/\/Launch threads\n\t\t\tfor(size_t w=0; w < params.nbthreads-1; w++){\n\t\t\t\t\/\/Number of contigs to cmp in this thread\n\t\t\t\tsize_t nb_contigs_cmp = nbContigs\/params.nbthreads + (( w < (nbContigs % params.nbthreads) )?1:0);\n\t\t\t\t\/\/cout << \"Thread \" << w << \": \" << nb_contigs_cmp << \" contigs.\" << endl;\n\n\t\t\t\t\/\/If there is contigs to cmp, we run the thread\n\t\t\t\tif(nb_contigs_cmp){\n\t\t\t\t\tsize_t id_end=id_begin+nb_contigs_cmp-1;\n\t\t\t\t\tworkers.emplace_back(contigs_cmp, id_begin, id_end, ref(scores), ref(contigs));\n\t\t\t\t\t\/\/cout << \"Thread \" << w << \" on \" << id_begin << \" to \" << id_end << endl;\n\t\t\t\t\tid_begin = id_end+1; \/\/Prepare next\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t\n\t\t\t\/\/Run remainings contigs on main\n\t\t\tif(id_begin < nbContigs){\n\t\t\t\t\/\/cout << \"Thread main on \" << id_begin << \" to \" << nbContigs-1 << endl;\n\t\t\t\tcontigs_cmp(id_begin, nbContigs-1, scores, contigs);\n\t\t\t}\n\n\t\t\t\/\/Wait the end of threads\n\t\t\tfor(size_t w = 0; w < workers.size(); w++){\n\t\t\t\tworkers[w].join();\n\t\t\t}\n\n\t\t}\n\t\t\t\/\/ Monothreading\n\t\telse{\n\t\t\tcontigs_cmp(0, nbContigs-1, scores, contigs);\n\t\t}\n\n\t\tlog.write(\"---- matrix of scores ----\");\n\t\tstring out;\n\t\tfor(size_t i=0; i < nbContigs; i++){out += \"\\t\" + to_string(i);}\n\t\tlog.write(out);\n\n\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\tout = to_string(i);\n\t\t\tfor(size_t j=0; j < nbContigs; j++){\n\t\t\t\tout += \"\\t\"+to_string(scores[i][j]);\n\t\t\t}\n\t\t\tlog.write(out);\n\t\t}\n\t\tlog.write(\"---- end of matrix ----\");\n\n\t\t\/\/Merge best couples (when score >= requirement)\n\t\tlog.write(\"=== Merging best contigs couples ===\");\n\t\tint8_t b; \/\/best couples score\n\t\tdo {\n\t\t\tb=0;\n\t\t\tsize_t b_id1=0;\n\t\t\tsize_t b_id2=0;\n\t\t\t\/\/ Get best couple\n\t\t\tfor(size_t id1=0; id1 < nbContigs; id1++){\n\t\t\t\tfor(size_t id2=id1+1; id2 < nbContigs; id2++){\n\t\t\t\t\t\/\/Get score, is it better ?\n\t\t\t\t\tif(abs(scores[id1][id2]) > b){\n\t\t\t\t\t\t\/\/keep this couple\n\t\t\t\t\t\tb = abs(scores[id1][id2]);\n\t\t\t\t\t\tb_id1 = id1;\n\t\t\t\t\t\tb_id2 = id2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/If score > requirement : merge this 2 \n\t\t\tif(b >= params.requiredScore){\n\t\t\t\t\/\/Merge\n\t\t\t\tcontigs.merge_contigs(b_id1, b_id2, scores[b_id1][b_id2]);\n\n\t\t\t\t\/\/clean the done and not possible couples after this merge\n\t\t\t\t\t\/\/This couple and its opposite\n\t\t\t\tscores[b_id1][b_id2]=0;\n\t\t\t\tscores[b_id2][b_id1]=0;\n\t\t\t\t\t\/\/The 'end' of contig1 is used\n\t\t\t\t\t\t\/\/All couple with contig1 first\n\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\tscores[b_id1][i]=0;\n\t\t\t\t}\n\t\t\t\t\t\t\/\/All couple with contig1 reversed as second \n\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\tif(scores[i][b_id1]<0){scores[i][b_id1]=0;}\n\t\t\t\t}\n\n\t\t\t\t\t\/\/contig2 normal ? The begin is used\n\t\t\t\tif(scores[b_id1][b_id2] > 0){\n\t\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\t\tif(scores[i][b_id2]>0){scores[i][b_id2]=0;}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\t\/\/else contig2 is reversed: the end is used\n\t\t\t\telse{\n\t\t\t\t\t\t\/\/All couples beginning with contig2\n\t\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\t\tscores[b_id2][i]=0;\n\t\t\t\t\t}\n\t\t\t\t\t\t\/\/All couples with contig2 as second and reversed\n\t\t\t\t\tfor(size_t i=0; i < nbContigs; i++){\n\t\t\t\t\t\tif(scores[i][b_id2] < 0){scores[i][b_id2]=0;}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t} while (b >= params.requiredScore);\n\n\n\t\t\/\/Synchronize the contigs list\n\t\tlog.write(\"=== Synchronisation ===\");\n\t\tcontigs.sync_contigs_list();\n\t\t\n\t\t\/\/Get the evolution. None: stop it.\n\t\tsize_t new_nbContigs = contigs.get_nbContigs();\n\n\t\tstring s = \"nb contigs merged = \" + to_string(nbContigs - new_nbContigs);\n\t\ts += \"\\nnb contigs remaining = \" + to_string(new_nbContigs);\n\t\tif(new_nbContigs == nbContigs){\n\t\t\ts += \"\\nNo evolution. Stopping.\";\n\t\t\tin_progress=false;\n\t\t}\n\t\tlog.write(s);\n\n\t\t\/\/End of cycle\n\t\tlog.write(\"===== Cycle end =====\\n\");\n\t}\n\n\t\/\/Free workerCL (if created)\n\tif(params.gpu){\n\t\tcout << \"Deleting gpu worker\" << endl;\n\t\tdelete workerCL;\n\t\tworkerCL = nullptr;\n\t\tcout << \"\\t- Done\" << endl;\n\t}\n\n\t\/\/End of program\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Begin CVS Header\n\/\/   $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/utilities\/CAnnotatedMatrix.cpp,v $\n\/\/   $Revision: 1.25 $\n\/\/   $Name:  $\n\/\/   $Author: ssahle $\n\/\/   $Date: 2008\/09\/25 22:40:02 $\n\/\/ End CVS Header\n\n\/\/ Copyright (C) 2008 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) 2001 - 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n\/*!\n    \\file CAnnotatedMatrix.cpp\n    \\brief Implementation file of class CCopasiArray and CArrayAnnotation\n *\/\n\n#include <sstream>\n#include \"CAnnotatedMatrix.h\"\n#include \"CCopasiVector.h\"\n\n#include \"report\/CKeyFactory.h\"\n#include \"report\/CArrayElementReference.h\"\n\nCArrayAnnotation::CArrayAnnotation(const std::string & name,\n                                   const CCopasiContainer * pParent,\n                                   CCopasiAbstractArray * array,\n                                   const bool & adopt)\n    : CCopasiContainer(name, pParent, \"Array\" , CCopasiObject::Array),\n    mpArray(array),\n    mDestructArray(adopt),\n    mDefaultMode(OBJECTS)\n{\n  assert(mpArray);\n\n  resize();\n\n  \/\/addObjectReference(\"Annotated Matrix\", *this, CCopasiObject::ValueDbl);\n}\n\nCArrayAnnotation::~CArrayAnnotation()\n{\n  if (mDestructArray)\n    pdelete(mpArray);\n}\n\nvoid CArrayAnnotation::setArray(CCopasiAbstractArray * a)\n{\n  mpArray = a;\n}\n\nvoid CArrayAnnotation::setMode(unsigned int d, Mode m)\n{\n  mModes[d] = m;\n  resizeOneDimension(d);\n}\n\nvoid CArrayAnnotation::setMode(Mode m)\n{\n  mDefaultMode = m;\n\n  unsigned int i;\n  for (i = 0; i < mModes.size(); ++i)\n    setMode(i, m);\n}\n\nunsigned int CArrayAnnotation::dimensionality() const\n  {\n    return mModes.size();\n  }\n\nvoid CArrayAnnotation::setCopasiVector(unsigned int d, const CCopasiContainer* v)\n{\n  assert(d < mCopasiVectors.size());\n  assert((mModes[d] == VECTOR) || (mModes[d] == VECTOR_ON_THE_FLY));\n\n  mCopasiVectors[d] = v;\n  if (mModes[d] == VECTOR)\n    createAnnotationsCNFromCopasiVector(d, mCopasiVectors[d]);\n}\n\nvoid CArrayAnnotation::setAnnotationCN(unsigned int d, unsigned int i, const std::string cn)\n{\n  assert(d < mAnnotationsCN.size());\n  assert(mModes[d] == OBJECTS);\n\n  resizeOneDimension(d);\n  assert(i < mAnnotationsCN[d].size());\n\n  mAnnotationsCN[d][i] = cn;\n}\n\nvoid CArrayAnnotation::setAnnotationString(unsigned int d, unsigned int i, const std::string s)\n{\n  assert(d < mAnnotationsString.size());\n  assert(mModes[d] == STRINGS);\n\n  resizeOneDimension(d);\n  assert(i < mAnnotationsString[d].size());\n\n  mAnnotationsString[d][i] = s;\n}\n\nconst std::vector<CRegisteredObjectName> & CArrayAnnotation::getAnnotationsCN(unsigned int d) const\n  {\n    assert(d < mModes.size());\n    assert(mModes[d] != STRINGS);\n    assert(mModes[d] != NUMBERS);\n\n    if (mModes[d] == VECTOR_ON_THE_FLY)\n      createAnnotationsCNFromCopasiVector(d, mCopasiVectors[d]);\n\n    return mAnnotationsCN[d];\n  }\n\nconst std::vector<std::string> & CArrayAnnotation::getAnnotationsString(unsigned int d, bool display) const\n  {\n    assert(d < mModes.size());\n\n    \/\/generate CNs (if necessary)\n    if (mModes[d] == VECTOR_ON_THE_FLY)\n      createAnnotationsCNFromCopasiVector(d, mCopasiVectors[d]);\n\n    \/\/generate DisplayNames\n    if ((mModes[d] == VECTOR) || (mModes[d] == VECTOR_ON_THE_FLY) || (mModes[d] == OBJECTS))\n      {\n        unsigned int i, imax = mAnnotationsCN[d].size();\n        mAnnotationsString[d].resize(imax);\n        for (i = 0; i < imax; ++i)\n          {\n            const CCopasiObject * obj = CCopasiContainer::ObjectFromName(mAnnotationsCN[d][i]);\n            if (obj)\n              mAnnotationsString[d][i] =\n                display ? obj->getObjectDisplayName() : obj->getObjectName();\n            else\n              mAnnotationsString[d][i] = \"???\";\n          }\n      }\n\n    \/\/generate Numbers\n    if (mModes[d] == NUMBERS)\n      createNumbers(d);\n\n    \/\/ if the mode is STRINGS do nothing, mAnnotationsString is supposed to contain\n    \/\/ the correct strings\n\n    return mAnnotationsString[d];\n  }\n\nconst std::string & CArrayAnnotation::getDimensionDescription(unsigned int d) const\n  {\n    assert(d < mDimensionDescriptions.size());\n    return mDimensionDescriptions[d];\n  }\n\nvoid CArrayAnnotation::setDimensionDescription(unsigned int d, const std::string & s)\n{\n  assert(d < mDimensionDescriptions.size());\n  mDimensionDescriptions[d] = s;\n}\n\nconst std::string & CArrayAnnotation::getDescription() const\n  {return mDescription;}\n\nvoid CArrayAnnotation::setDescription(const std::string & s)\n{mDescription = s;}\n\nbool CArrayAnnotation::createAnnotationsCNFromCopasiVector(unsigned int d,\n    const CCopasiContainer* v) const\n  {\n    if (!v) return false;\n    if (! (v->isVector() || v->isNameVector())) return false;\n    if (d >= mpArray->dimensionality()) return false;\n\n    \/\/now we know we have a vector. A CCopasiVector[N\/S], hopefully, so that the following cast is valid:\n    const CCopasiVector< CCopasiObject > * pVector =\n      reinterpret_cast<const CCopasiVector< CCopasiObject > * >(v);\n\n    mAnnotationsCN[d].resize(pVector->size());\n    \/\/if (pVector->size() < mAnnotations[d].size()) return false;\n\n    unsigned int i;\n    for (i = 0; i < mAnnotationsCN[d].size(); ++i)\n      {\n        if (!(*pVector)[i])\n          return false;\n        else\n          mAnnotationsCN[d][i] = (*pVector)[i]->getCN();\n      }\n    return true;\n  }\n\n\/\/private\nvoid CArrayAnnotation::createNumbers(unsigned int \/*d*\/) const\n  {\n    \/\/TODO\n  }\n\n\/\/private\nvoid CArrayAnnotation::reDimensionalize(unsigned int d)\n{\n  mAnnotationsCN.resize(d);\n  mAnnotationsString.resize(d);\n  mDimensionDescriptions.resize(d);\n  mCopasiVectors.resize(d);\n  mModes.resize(d, mDefaultMode);\n}\n\n\/\/private\nvoid CArrayAnnotation::resizeOneDimension(unsigned int d)\n{\n  if (mModes[d] != VECTOR)\n    {\n      mAnnotationsCN[d].resize(mpArray->size()[d]);\n      mAnnotationsString[d].resize(mpArray->size()[d]);\n    }\n}\n\nvoid CArrayAnnotation::resize()\n{\n  assert(mpArray);\n  reDimensionalize(mpArray->dimensionality());\n\n  unsigned int i, imax = mpArray->dimensionality();\n  for (i = 0; i < imax; ++i)\n    resizeOneDimension(i);\n}\n\nconst CCopasiObject* CArrayAnnotation::addElementReference(CCopasiAbstractArray::index_type index)\n{\n  \/\/generate the index string\n  std::string tmp;\n  std::ostringstream indexString;\n  unsigned C_INT32 ii = 0;\n  for (ii = 0; ii < index.size(); ++ii)\n    {\n      indexString << \"[\" << index[ii] << \"]\";\n    }\n\n  return this->getObject(indexString.str());\n}\n\nconst CCopasiObject* CArrayAnnotation::addElementReference(C_INT32 u, C_INT32 v)\n{\n  CCopasiAbstractArray::index_type index;\n  index.push_back(u);\n  index.push_back(v);\n  return addElementReference(index);\n}\n\nconst CCopasiObject * CArrayAnnotation::getObject(const CCopasiObjectName & cn) const\n  {\n    std::cout << \"CArrayAnnotation::getObject() \" << cn << std::endl;\n\n    if (cn == \"\")\n      {\n        return this;\n      }\n\n    \/\/if there are no indices there could still be other children. This can be handled\n    \/\/by the container base class\n    if (cn.getElementName(0, false) == \"\") \/\/no indices\n      return this->CCopasiContainer::getObject(cn);\n\n    \/\/so now we know we have indices. So we check if the array element reference\n    \/\/exists, if not we create it. Then getObject() of the element reference is called\n    \/\/with the remainder TODO\n\n    \/*\n        \/\/first get the array indices. At the moment only numerical indices...\n        C_INT32 ii = 0;\n        CCopasiArray::index_type index;\n        while (cn.getElementName(ii, false) != \"\")\n          {\n            index.push_back(cn.getElementIndex(ii));\n            ++ii;\n          }\n    *\/\n    \/\/first get the index string\n    std::string tmp;\n    std::string indexString;\n    C_INT32 ii = 0;\n    while ((tmp = cn.getElementName(ii, false)) != \"\")\n      {\n        indexString += \"[\" + tmp + \"]\";\n        ++ii;\n      }\n\n    const CCopasiObject* pObject = NULL; \/\/this will contain the element reference\n\n    \/\/if the reference object already exists, its name will be identical to the index\n    std::pair< objectMap::const_iterator, objectMap::const_iterator > range =\n      mObjects.equal_range(indexString);\n    objectMap::const_iterator it = range.first;\n    while (it != range.second && it->second->getObjectType() != \"ElementReference\") ++it;\n\n    if (it == range.second) \/\/not found\n      {\n        \/\/create new element reference\n        pObject = new CArrayElementReference(cn, this);\n      }\n    else\n      {\n        pObject = it->second;\n      }\n\n    if (pObject)\n      return pObject->getObject(cn.getRemainder());\n    else\n      return NULL;\n\n    \/*\n    if (index.size() != dimensionality())  \/\/wrong number of indices for this array\n      return NULL;\n\n    unsigned C_INT32 i;\n    for (i = 0; i < dimensionality(); ++i)\n      if (index[i] >= size()[i]) \/\/out of range\n        return NULL;\n    *\/\n\n    \/\/TODO remove element children after resize\n    \/\/TODO check optimization expression widget...\n  }\n\nvoid CArrayAnnotation::print(std::ostream * ostream) const\n{*ostream << *this;}\n\n#define SPC(level) std::string(level, ' ')\n\nvoid CArrayAnnotation::printRecursively(std::ostream & ostream, C_INT32 level,\n                                        CCopasiAbstractArray::index_type & index,\n                                        const std::vector<std::vector<std::string> > & display) const\n  {\n    unsigned C_INT32 indent = 2 * (dimensionality() - 1 - level);\n\n    if (level == 0) \/\/only vector\n      {\n        ostream << SPC(indent) << \"Rows: \" << getDimensionDescription(level) << \"\\n\";\n\n        unsigned C_INT32 imax = size()[0];\n        for (index[0] = 0; index[0] < imax; ++index[0])\n          ostream << SPC(indent) << display[0][index[0]] << \"\\t\" << (*array())[index] << \"\\n\";\n      }\n    else if (level == 1) \/\/matrix\n      {\n        ostream << SPC(indent) << \"Rows:    \" << getDimensionDescription(level - 1) << \"\\n\";\n        ostream << SPC(indent) << \"Columns: \" << getDimensionDescription(level) << \"\\n\";\n\n        unsigned C_INT32 imax = size()[0];\n        unsigned C_INT32 jmax = size()[1];\n        ostream << SPC(indent);\n        for (index[1] = 0; index[1] < jmax; ++index[1])\n          ostream << \"\\t\" << display[1][index[1]];\n        ostream << \"\\n\";\n        for (index[0] = 0; index[0] < imax; ++index[0])\n          {\n            ostream << SPC(indent) << display[0][index[0]];\n            for (index[1] = 0; index[1] < jmax; ++index[1])\n              ostream << \"\\t\" << (*array())[index];\n            ostream << \"\\n\";\n          }\n      }\n    else \/\/dimensionality > 2\n      {\n        unsigned C_INT32 i, imax = size()[level];\n        for (i = 0; i < imax; ++i)\n          {\n            ostream << SPC(indent) << getDimensionDescription(level) << \": \" << display[level][i] << \"\\n\";\n            index[level] = i;\n            printRecursively(ostream, level - 1, index, display);\n          }\n      }\n  }\n\n#undef SPC\n\nstd::ostream &operator<<(std::ostream &os, const CArrayAnnotation & o)\n{\n  if (!o.array()) return os;\n\n  \/\/cache the display names\n  std::vector<std::vector<std::string> > displaynames;\n  unsigned C_INT32 i;\n  for (i = 0; i < o.dimensionality(); ++i)\n    displaynames.push_back(o.getAnnotationsString(i));\n\n  os << o.getObjectName() << std::endl;\n  os << o.getDescription() << std::endl;\n\n  CCopasiAbstractArray::index_type arraysize = o.array()->size();\n  if (o.dimensionality() == 0)\n    {\n      \/\/only one scalar value\n      os << (*o.array())[arraysize] << std::endl;\n    }\n  else\n    {\n      o.printRecursively(os, o.dimensionality() - 1, arraysize, displaynames);\n    }\n\n  return os;\n}\n\n\/\/ void CArrayAnnotation::printDebugLoop(std::ostream & out, CCopasiAbstractArray::index_type & index, unsigned int level) const\n\/\/   {\n\/\/     unsigned int i, imax = mArray->size()[level];\n\/\/     for (i = 0; i < imax; ++i)\n\/\/       {\n\/\/         index[level] = i;\n\/\/\n\/\/         if (level == dimensionality() - 1)\n\/\/           {\n\/\/             out << (*mArray)[index] << \"  \";\n\/\/}\n\/\/         else\n\/\/           {\n\/\/             printDebugLoop(out, index, level + 1);\n\/\/             out << std::endl;\n\/\/}\n\/\/}\n\/\/}\n\/\/\n\/\/ void CArrayAnnotation::printDebug(std::ostream & out) const\n\/\/   {\n\/\/     out << mDescription << std::endl;\n\/\/     out << \"  Dimensionality: \" << dimensionality() << std::endl;\n\/\/\n\/\/     unsigned int i, j;\n\/\/     for (i = 0; i < dimensionality(); ++i)\n\/\/       {\n\/\/         out << \"   \" << i << \": \" << mDimensionDescriptions[i] << std::endl;\n\/\/\n\/\/         \/\/std::vector<std::string> names = const_cast<CArrayAnnotation*>(this)->getAnnotationsDisplay(i);\n\/\/\n\/\/         for (j = 0; j < mAnnotations[i].size(); ++j)\n\/\/           out << \"     \" << mAnnotations[i][j] \/*<< \" :\" << names[j]*\/ << std::endl;\n\/\/\n\/\/         out << std::endl;\n\/\/}\n\/\/\n\/\/     CCopasiAbstractArray::index_type index; index.resize(dimensionality());\n\/\/     printDebugLoop(out, index, 0);\n\/\/}\n<commit_msg>Removed debug output.<commit_after>\/\/ Begin CVS Header\n\/\/   $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/utilities\/CAnnotatedMatrix.cpp,v $\n\/\/   $Revision: 1.26 $\n\/\/   $Name:  $\n\/\/   $Author: shoops $\n\/\/   $Date: 2008\/10\/07 16:22:29 $\n\/\/ End CVS Header\n\n\/\/ Copyright (C) 2008 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) 2001 - 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n\/*!\n    \\file CAnnotatedMatrix.cpp\n    \\brief Implementation file of class CCopasiArray and CArrayAnnotation\n *\/\n\n#include <sstream>\n#include \"CAnnotatedMatrix.h\"\n#include \"CCopasiVector.h\"\n\n#include \"report\/CKeyFactory.h\"\n#include \"report\/CArrayElementReference.h\"\n\nCArrayAnnotation::CArrayAnnotation(const std::string & name,\n                                   const CCopasiContainer * pParent,\n                                   CCopasiAbstractArray * array,\n                                   const bool & adopt)\n    : CCopasiContainer(name, pParent, \"Array\" , CCopasiObject::Array),\n    mpArray(array),\n    mDestructArray(adopt),\n    mDefaultMode(OBJECTS)\n{\n  assert(mpArray);\n\n  resize();\n\n  \/\/addObjectReference(\"Annotated Matrix\", *this, CCopasiObject::ValueDbl);\n}\n\nCArrayAnnotation::~CArrayAnnotation()\n{\n  if (mDestructArray)\n    pdelete(mpArray);\n}\n\nvoid CArrayAnnotation::setArray(CCopasiAbstractArray * a)\n{\n  mpArray = a;\n}\n\nvoid CArrayAnnotation::setMode(unsigned int d, Mode m)\n{\n  mModes[d] = m;\n  resizeOneDimension(d);\n}\n\nvoid CArrayAnnotation::setMode(Mode m)\n{\n  mDefaultMode = m;\n\n  unsigned int i;\n  for (i = 0; i < mModes.size(); ++i)\n    setMode(i, m);\n}\n\nunsigned int CArrayAnnotation::dimensionality() const\n  {\n    return mModes.size();\n  }\n\nvoid CArrayAnnotation::setCopasiVector(unsigned int d, const CCopasiContainer* v)\n{\n  assert(d < mCopasiVectors.size());\n  assert((mModes[d] == VECTOR) || (mModes[d] == VECTOR_ON_THE_FLY));\n\n  mCopasiVectors[d] = v;\n  if (mModes[d] == VECTOR)\n    createAnnotationsCNFromCopasiVector(d, mCopasiVectors[d]);\n}\n\nvoid CArrayAnnotation::setAnnotationCN(unsigned int d, unsigned int i, const std::string cn)\n{\n  assert(d < mAnnotationsCN.size());\n  assert(mModes[d] == OBJECTS);\n\n  resizeOneDimension(d);\n  assert(i < mAnnotationsCN[d].size());\n\n  mAnnotationsCN[d][i] = cn;\n}\n\nvoid CArrayAnnotation::setAnnotationString(unsigned int d, unsigned int i, const std::string s)\n{\n  assert(d < mAnnotationsString.size());\n  assert(mModes[d] == STRINGS);\n\n  resizeOneDimension(d);\n  assert(i < mAnnotationsString[d].size());\n\n  mAnnotationsString[d][i] = s;\n}\n\nconst std::vector<CRegisteredObjectName> & CArrayAnnotation::getAnnotationsCN(unsigned int d) const\n  {\n    assert(d < mModes.size());\n    assert(mModes[d] != STRINGS);\n    assert(mModes[d] != NUMBERS);\n\n    if (mModes[d] == VECTOR_ON_THE_FLY)\n      createAnnotationsCNFromCopasiVector(d, mCopasiVectors[d]);\n\n    return mAnnotationsCN[d];\n  }\n\nconst std::vector<std::string> & CArrayAnnotation::getAnnotationsString(unsigned int d, bool display) const\n  {\n    assert(d < mModes.size());\n\n    \/\/generate CNs (if necessary)\n    if (mModes[d] == VECTOR_ON_THE_FLY)\n      createAnnotationsCNFromCopasiVector(d, mCopasiVectors[d]);\n\n    \/\/generate DisplayNames\n    if ((mModes[d] == VECTOR) || (mModes[d] == VECTOR_ON_THE_FLY) || (mModes[d] == OBJECTS))\n      {\n        unsigned int i, imax = mAnnotationsCN[d].size();\n        mAnnotationsString[d].resize(imax);\n        for (i = 0; i < imax; ++i)\n          {\n            const CCopasiObject * obj = CCopasiContainer::ObjectFromName(mAnnotationsCN[d][i]);\n            if (obj)\n              mAnnotationsString[d][i] =\n                display ? obj->getObjectDisplayName() : obj->getObjectName();\n            else\n              mAnnotationsString[d][i] = \"???\";\n          }\n      }\n\n    \/\/generate Numbers\n    if (mModes[d] == NUMBERS)\n      createNumbers(d);\n\n    \/\/ if the mode is STRINGS do nothing, mAnnotationsString is supposed to contain\n    \/\/ the correct strings\n\n    return mAnnotationsString[d];\n  }\n\nconst std::string & CArrayAnnotation::getDimensionDescription(unsigned int d) const\n  {\n    assert(d < mDimensionDescriptions.size());\n    return mDimensionDescriptions[d];\n  }\n\nvoid CArrayAnnotation::setDimensionDescription(unsigned int d, const std::string & s)\n{\n  assert(d < mDimensionDescriptions.size());\n  mDimensionDescriptions[d] = s;\n}\n\nconst std::string & CArrayAnnotation::getDescription() const\n  {return mDescription;}\n\nvoid CArrayAnnotation::setDescription(const std::string & s)\n{mDescription = s;}\n\nbool CArrayAnnotation::createAnnotationsCNFromCopasiVector(unsigned int d,\n    const CCopasiContainer* v) const\n  {\n    if (!v) return false;\n    if (! (v->isVector() || v->isNameVector())) return false;\n    if (d >= mpArray->dimensionality()) return false;\n\n    \/\/now we know we have a vector. A CCopasiVector[N\/S], hopefully, so that the following cast is valid:\n    const CCopasiVector< CCopasiObject > * pVector =\n      reinterpret_cast<const CCopasiVector< CCopasiObject > * >(v);\n\n    mAnnotationsCN[d].resize(pVector->size());\n    \/\/if (pVector->size() < mAnnotations[d].size()) return false;\n\n    unsigned int i;\n    for (i = 0; i < mAnnotationsCN[d].size(); ++i)\n      {\n        if (!(*pVector)[i])\n          return false;\n        else\n          mAnnotationsCN[d][i] = (*pVector)[i]->getCN();\n      }\n    return true;\n  }\n\n\/\/private\nvoid CArrayAnnotation::createNumbers(unsigned int \/*d*\/) const\n  {\n    \/\/TODO\n  }\n\n\/\/private\nvoid CArrayAnnotation::reDimensionalize(unsigned int d)\n{\n  mAnnotationsCN.resize(d);\n  mAnnotationsString.resize(d);\n  mDimensionDescriptions.resize(d);\n  mCopasiVectors.resize(d);\n  mModes.resize(d, mDefaultMode);\n}\n\n\/\/private\nvoid CArrayAnnotation::resizeOneDimension(unsigned int d)\n{\n  if (mModes[d] != VECTOR)\n    {\n      mAnnotationsCN[d].resize(mpArray->size()[d]);\n      mAnnotationsString[d].resize(mpArray->size()[d]);\n    }\n}\n\nvoid CArrayAnnotation::resize()\n{\n  assert(mpArray);\n  reDimensionalize(mpArray->dimensionality());\n\n  unsigned int i, imax = mpArray->dimensionality();\n  for (i = 0; i < imax; ++i)\n    resizeOneDimension(i);\n}\n\nconst CCopasiObject* CArrayAnnotation::addElementReference(CCopasiAbstractArray::index_type index)\n{\n  \/\/generate the index string\n  std::string tmp;\n  std::ostringstream indexString;\n  unsigned C_INT32 ii = 0;\n  for (ii = 0; ii < index.size(); ++ii)\n    {\n      indexString << \"[\" << index[ii] << \"]\";\n    }\n\n  return this->getObject(indexString.str());\n}\n\nconst CCopasiObject* CArrayAnnotation::addElementReference(C_INT32 u, C_INT32 v)\n{\n  CCopasiAbstractArray::index_type index;\n  index.push_back(u);\n  index.push_back(v);\n  return addElementReference(index);\n}\n\nconst CCopasiObject * CArrayAnnotation::getObject(const CCopasiObjectName & cn) const\n  {\n    if (cn == \"\")\n      {\n        return this;\n      }\n\n    \/\/if there are no indices there could still be other children. This can be handled\n    \/\/by the container base class\n    if (cn.getElementName(0, false) == \"\") \/\/no indices\n      return this->CCopasiContainer::getObject(cn);\n\n    \/\/so now we know we have indices. So we check if the array element reference\n    \/\/exists, if not we create it. Then getObject() of the element reference is called\n    \/\/with the remainder TODO\n\n    \/*\n        \/\/first get the array indices. At the moment only numerical indices...\n        C_INT32 ii = 0;\n        CCopasiArray::index_type index;\n        while (cn.getElementName(ii, false) != \"\")\n          {\n            index.push_back(cn.getElementIndex(ii));\n            ++ii;\n          }\n    *\/\n    \/\/first get the index string\n    std::string tmp;\n    std::string indexString;\n    C_INT32 ii = 0;\n    while ((tmp = cn.getElementName(ii, false)) != \"\")\n      {\n        indexString += \"[\" + tmp + \"]\";\n        ++ii;\n      }\n\n    const CCopasiObject* pObject = NULL; \/\/this will contain the element reference\n\n    \/\/if the reference object already exists, its name will be identical to the index\n    std::pair< objectMap::const_iterator, objectMap::const_iterator > range =\n      mObjects.equal_range(indexString);\n    objectMap::const_iterator it = range.first;\n    while (it != range.second && it->second->getObjectType() != \"ElementReference\") ++it;\n\n    if (it == range.second) \/\/not found\n      {\n        \/\/create new element reference\n        pObject = new CArrayElementReference(cn, this);\n      }\n    else\n      {\n        pObject = it->second;\n      }\n\n    if (pObject)\n      return pObject->getObject(cn.getRemainder());\n    else\n      return NULL;\n\n    \/*\n    if (index.size() != dimensionality())  \/\/wrong number of indices for this array\n      return NULL;\n\n    unsigned C_INT32 i;\n    for (i = 0; i < dimensionality(); ++i)\n      if (index[i] >= size()[i]) \/\/out of range\n        return NULL;\n    *\/\n\n    \/\/TODO remove element children after resize\n    \/\/TODO check optimization expression widget...\n  }\n\nvoid CArrayAnnotation::print(std::ostream * ostream) const\n{*ostream << *this;}\n\n#define SPC(level) std::string(level, ' ')\n\nvoid CArrayAnnotation::printRecursively(std::ostream & ostream, C_INT32 level,\n                                        CCopasiAbstractArray::index_type & index,\n                                        const std::vector<std::vector<std::string> > & display) const\n  {\n    unsigned C_INT32 indent = 2 * (dimensionality() - 1 - level);\n\n    if (level == 0) \/\/only vector\n      {\n        ostream << SPC(indent) << \"Rows: \" << getDimensionDescription(level) << \"\\n\";\n\n        unsigned C_INT32 imax = size()[0];\n        for (index[0] = 0; index[0] < imax; ++index[0])\n          ostream << SPC(indent) << display[0][index[0]] << \"\\t\" << (*array())[index] << \"\\n\";\n      }\n    else if (level == 1) \/\/matrix\n      {\n        ostream << SPC(indent) << \"Rows:    \" << getDimensionDescription(level - 1) << \"\\n\";\n        ostream << SPC(indent) << \"Columns: \" << getDimensionDescription(level) << \"\\n\";\n\n        unsigned C_INT32 imax = size()[0];\n        unsigned C_INT32 jmax = size()[1];\n        ostream << SPC(indent);\n        for (index[1] = 0; index[1] < jmax; ++index[1])\n          ostream << \"\\t\" << display[1][index[1]];\n        ostream << \"\\n\";\n        for (index[0] = 0; index[0] < imax; ++index[0])\n          {\n            ostream << SPC(indent) << display[0][index[0]];\n            for (index[1] = 0; index[1] < jmax; ++index[1])\n              ostream << \"\\t\" << (*array())[index];\n            ostream << \"\\n\";\n          }\n      }\n    else \/\/dimensionality > 2\n      {\n        unsigned C_INT32 i, imax = size()[level];\n        for (i = 0; i < imax; ++i)\n          {\n            ostream << SPC(indent) << getDimensionDescription(level) << \": \" << display[level][i] << \"\\n\";\n            index[level] = i;\n            printRecursively(ostream, level - 1, index, display);\n          }\n      }\n  }\n\n#undef SPC\n\nstd::ostream &operator<<(std::ostream &os, const CArrayAnnotation & o)\n{\n  if (!o.array()) return os;\n\n  \/\/cache the display names\n  std::vector<std::vector<std::string> > displaynames;\n  unsigned C_INT32 i;\n  for (i = 0; i < o.dimensionality(); ++i)\n    displaynames.push_back(o.getAnnotationsString(i));\n\n  os << o.getObjectName() << std::endl;\n  os << o.getDescription() << std::endl;\n\n  CCopasiAbstractArray::index_type arraysize = o.array()->size();\n  if (o.dimensionality() == 0)\n    {\n      \/\/only one scalar value\n      os << (*o.array())[arraysize] << std::endl;\n    }\n  else\n    {\n      o.printRecursively(os, o.dimensionality() - 1, arraysize, displaynames);\n    }\n\n  return os;\n}\n\n\/\/ void CArrayAnnotation::printDebugLoop(std::ostream & out, CCopasiAbstractArray::index_type & index, unsigned int level) const\n\/\/   {\n\/\/     unsigned int i, imax = mArray->size()[level];\n\/\/     for (i = 0; i < imax; ++i)\n\/\/       {\n\/\/         index[level] = i;\n\/\/\n\/\/         if (level == dimensionality() - 1)\n\/\/           {\n\/\/             out << (*mArray)[index] << \"  \";\n\/\/}\n\/\/         else\n\/\/           {\n\/\/             printDebugLoop(out, index, level + 1);\n\/\/             out << std::endl;\n\/\/}\n\/\/}\n\/\/}\n\/\/\n\/\/ void CArrayAnnotation::printDebug(std::ostream & out) const\n\/\/   {\n\/\/     out << mDescription << std::endl;\n\/\/     out << \"  Dimensionality: \" << dimensionality() << std::endl;\n\/\/\n\/\/     unsigned int i, j;\n\/\/     for (i = 0; i < dimensionality(); ++i)\n\/\/       {\n\/\/         out << \"   \" << i << \": \" << mDimensionDescriptions[i] << std::endl;\n\/\/\n\/\/         \/\/std::vector<std::string> names = const_cast<CArrayAnnotation*>(this)->getAnnotationsDisplay(i);\n\/\/\n\/\/         for (j = 0; j < mAnnotations[i].size(); ++j)\n\/\/           out << \"     \" << mAnnotations[i][j] \/*<< \" :\" << names[j]*\/ << std::endl;\n\/\/\n\/\/         out << std::endl;\n\/\/}\n\/\/\n\/\/     CCopasiAbstractArray::index_type index; index.resize(dimensionality());\n\/\/     printDebugLoop(out, index, 0);\n\/\/}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Terminal.cpp -- source file\n\/*\n *\n * Author: septimomend (Ivan Chapkailo)\n *\n * 30.06.2017\n *\n *\/\n\n#include \"stdafx.h\"\n#include \"Terminal.h\"\n\n\/\/ TODO: add definitions\n<commit_msg>some functions definitions added<commit_after>\/\/ Terminal.cpp -- source file\n\/*\n *\n * Author: septimomend (Ivan Chapkailo)\n *\n * 30.06.2017\n *\n *\/\n\n#include \"stdafx.h\"\n#include \"Terminal.h\"\n\nTerminal::Terminal() \/\/ cstr\n{\n}\n\nvoid Terminal::emergencyDestruction(const char* str)\n{\n  write(STDOUT_FILENO, \"\\x1b[2J\", 4); \/\/ write clr code to file\n  write(STDOUT_FILENO, \"\\x1b[H\", 3);\n\n  perror(str);\n  exit(1);  \/\/ exit with error\n}\n\nvoid Terminal::rowModeOff()\n{\n  \/\/ the change will occur after all output written to STDIN_FILENO is transmitted,\n  \/\/ and all input so far received but not read will be discarded before the change is made\n  if (tcsetattr(STDIN_FILENO, TCSAFLUSH, &configObj.baseTermiosObj) == -1)\n    emergencyDestruction(\"tcsetattr\");\n}\n\nvoid Terminal::rowModeOn()\n{\n  if (tcgetattr(STDIN_FILENO, &configObj.baseTermiosObj) == -1)\n    emergencyDestruction(\"tcgetattr\");\n  atexit(rowModeOff);\n\n  struct termios raw = configObj.baseTermiosObj;\n  \/\/ setting flags\n  \/\/\n  raw.c_iflag &= ~(BRKINT | ICRNL | INPCK | ISTRIP | IXON);\n  raw.c_oflag &= ~(OPOST); \/\/ Post-process output \n  raw.c_cflag |= (CS8); \/\/ Character size 8 bits\n  raw.c_lflag &= ~(ECHO | ICANON | IEXTEN | ISIG);\n  raw.c_cc[VMIN] = 0;\n  raw.c_cc[VTIME] = 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <core\/stdafx.h>\n#include <core\/propertyBag\/registryProperty.h>\n#include <core\/mapi\/mapiFunctions.h>\n#include <core\/utility\/strings.h>\n#include <core\/utility\/registry.h>\n#include <core\/utility\/error.h>\n#include <core\/interpret\/proptags.h>\n#include <core\/property\/parseProperty.h>\n#include <core\/smartview\/SmartView.h>\n\nnamespace propertybag\n{\n\tregistryProperty::registryProperty(HKEY hKey, _In_ const std::wstring& name, DWORD dwType)\n\t\t: m_hKey(hKey), m_name(name), m_dwType(dwType)\n\t{\n\t\tm_secure = false;\n\t\t\/\/ Get our prop tag and determine if we're a secure prop\n\t\tif (name.size() == 8 || name.size() == 9)\n\t\t{\n\t\t\tULONG num{};\n\t\t\t\/\/ If we're not a simple prop tag, perhaps we have a prefix\n\t\t\tauto str = name;\n\t\t\tif (strings::stripPrefix(str, L\"S\") && strings::tryWstringToUlong(num, str, 16, false))\n\t\t\t{\n\t\t\t\tm_secure = true;\n\t\t\t\t\/\/ abuse some macros to swap the order of the tag\n\t\t\t\tm_ulPropTag = PROP_TAG(PROP_ID(num), PROP_TYPE(num));\n\t\t\t}\n\t\t\telse if (strings::tryWstringToUlong(num, name, 16, false))\n\t\t\t{\n\t\t\t\t\/\/ abuse some macros to swap the order of the tag\n\t\t\t\tm_ulPropTag = PROP_TAG(PROP_ID(num), PROP_TYPE(num));\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid registryProperty::ensureSPropValue()\n\t{\n\t\tif (m_prop.ulPropTag != 0) return;\n\t\tm_prop = {m_ulPropTag};\n\t\tm_canParseMAPI = false;\n\n\t\tif (m_dwType == REG_BINARY)\n\t\t{\n\t\t\tm_binVal = registry::ReadBinFromRegistry(m_hKey, m_name);\n\t\t\tif (m_ulPropTag)\n\t\t\t{\n\t\t\t\tm_canParseMAPI = true;\n\t\t\t\tswitch (PROP_TYPE(m_ulPropTag))\n\t\t\t\t{\n\t\t\t\tcase PT_CLSID:\n\t\t\t\t\tif (m_binVal.size() == 16)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.lpguid = reinterpret_cast<LPGUID>(const_cast<LPBYTE>(m_binVal.data()));\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_SYSTIME:\n\t\t\t\t\tif (m_binVal.size() == 8)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.ft = *reinterpret_cast<LPFILETIME>(const_cast<LPBYTE>(m_binVal.data()));\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_I8:\n\t\t\t\t\tif (m_binVal.size() == 8)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.li.QuadPart = static_cast<LONGLONG>(*m_binVal.data());\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_LONG:\n\t\t\t\t\tif (m_binVal.size() == 4)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.l = static_cast<DWORD>(*m_binVal.data());\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_BOOLEAN:\n\t\t\t\t\tif (m_binVal.size() == 2)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.b = static_cast<WORD>(*m_binVal.data());\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_BINARY:\n\t\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_UNICODE:\n\t\t\t\t\tif (m_secure)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.ulPropTag = PROP_TAG(PT_BINARY, PROP_ID(m_ulPropTag));\n\t\t\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\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_unicodeVal = m_binVal;\n\t\t\t\t\t\tm_unicodeVal.push_back(0); \/\/ Add some null terminators just in case\n\t\t\t\t\t\tm_unicodeVal.push_back(0);\n\t\t\t\t\t\tm_prop.Value.lpszW = reinterpret_cast<LPWSTR>(const_cast<LPBYTE>(m_unicodeVal.data()));\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tm_prop.ulPropTag = PROP_TAG(PT_BINARY, PROP_ID(m_ulPropTag));\n\t\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\n\t\t\t\t\tm_canParseMAPI = false;\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\tm_prop.ulPropTag = PROP_TAG(PT_BINARY, PROP_ID_NULL);\n\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_DWORD)\n\t\t{\n\t\t\tm_dwVal = registry::ReadDWORDFromRegistry(m_hKey, m_name);\n\t\t\tm_prop.Value.l = m_dwVal;\n\t\t\tif (m_ulPropTag)\n\t\t\t{\n\t\t\t\tm_canParseMAPI = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_prop.ulPropTag = PROP_TAG(PT_LONG, PROP_ID_NULL);\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_SZ)\n\t\t{\n\t\t\tm_szVal = registry::ReadStringFromRegistry(m_hKey, m_name);\n\t\t\tif (!m_prop.ulPropTag) m_prop.ulPropTag = PROP_TAG(PT_UNICODE, PROP_ID_NULL);\n\t\t\tswitch (PROP_TYPE(m_prop.ulPropTag))\n\t\t\t{\n\t\t\tcase PT_UNICODE:\n\t\t\t\tm_prop.Value.lpszW = m_szVal.data();\n\t\t\t\tbreak;\n\t\t\tcase PT_STRING8:\n\t\t\t\tm_ansiVal = strings::wstringTostring(m_szVal);\n\t\t\t\tm_prop.Value.lpszA = m_ansiVal.data();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid registryProperty::ensureModel()\n\t{\n\t\tif (m_model) return;\n\t\tensureSPropValue();\n\t\tm_model = std::make_shared<model::mapiRowModel>();\n\t\tif (m_ulPropTag != 0)\n\t\t{\n\t\t\tm_model->ulPropTag(m_ulPropTag);\n\t\t\tconst auto propTagNames = proptags::PropTagToPropName(m_ulPropTag, false);\n\t\t\tif (!propTagNames.bestGuess.empty())\n\t\t\t{\n\t\t\t\tm_model->name(propTagNames.bestGuess);\n\t\t\t}\n\n\t\t\tif (!propTagNames.otherMatches.empty())\n\t\t\t{\n\t\t\t\tm_model->otherName(propTagNames.otherMatches);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_model->name(m_name);\n\t\t\tm_model->otherName(strings::format(L\"%d\", m_dwType)); \/\/ Just shoving in model to see it\n\t\t}\n\n\t\tif (m_secure) m_model->name(m_model->name() + L\" (secure)\");\n\n\t\tif (m_dwType == REG_BINARY)\n\t\t{\n\t\t\tif (!m_canParseMAPI)\n\t\t\t{\n\t\t\t\tif (!m_model->ulPropTag()) m_model->ulPropTag(PROP_TAG(PT_BINARY, PROP_ID_NULL));\n\t\t\t\tm_model->value(strings::BinToHexString(m_binVal, true));\n\t\t\t\tm_model->altValue(strings::BinToTextString(m_binVal, true));\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_DWORD)\n\t\t{\n\t\t\tif (!m_ulPropTag)\n\t\t\t{\n\t\t\t\tm_model->ulPropTag(PROP_TAG(PT_LONG, PROP_ID_NULL));\n\t\t\t\tm_model->value(strings::format(L\"%d\", m_dwVal));\n\t\t\t\tm_model->altValue(strings::format(L\"0x%08X\", m_dwVal));\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_SZ)\n\t\t{\n\t\t\tif (!m_model->ulPropTag()) m_model->ulPropTag(PROP_TAG(PT_UNICODE, PROP_ID_NULL));\n\t\t\tm_model->value(m_szVal);\n\t\t}\n\n\t\tif (m_canParseMAPI)\n\t\t{\n\t\t\tstd::wstring PropString;\n\t\t\tstd::wstring AltPropString;\n\t\t\tproperty::parseProperty(&m_prop, &PropString, &AltPropString);\n\t\t\tm_model->value(PropString);\n\t\t\tm_model->altValue(AltPropString);\n\n\t\t\tconst auto szSmartView =\n\t\t\t\tsmartview::parsePropertySmartView(&m_prop, nullptr, nullptr, nullptr, false, false);\n\t\t\tif (!szSmartView.empty()) m_model->smartView(szSmartView);\n\t\t}\n\n\t\t\/\/ For debugging purposes right now\n\t\tm_model->namedPropName(strings::BinToHexString(m_binVal, true));\n\t\tm_model->namedPropGuid(strings::BinToTextString(m_binVal, true));\n\t}\n\n\tvoid registryProperty::set(_In_opt_ LPSPropValue newValue)\n\t{\n\t\tif (!newValue) return;\n\n\t\tif (m_dwType == REG_BINARY)\n\t\t{\n\t\t\tif (m_ulPropTag)\n\t\t\t{\n\t\t\t\tswitch (PROP_TYPE(m_ulPropTag))\n\t\t\t\t{\n\t\t\t\tcase PT_CLSID:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 16, LPBYTE(newValue->Value.lpguid));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_SYSTIME:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 8, LPBYTE(&newValue->Value.ft));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_I8:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 8, LPBYTE(&newValue->Value.li.QuadPart));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_LONG:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 4, LPBYTE(&newValue->Value.l));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_BOOLEAN:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 2, LPBYTE(&newValue->Value.b));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_BINARY:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, newValue->Value.bin.cb, newValue->Value.bin.lpb);\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_UNICODE:\n\t\t\t\t\t\/\/ Include null terminator\n\t\t\t\t\tregistry::WriteBinToRegistry(\n\t\t\t\t\t\tm_hKey,\n\t\t\t\t\t\tm_name,\n\t\t\t\t\t\t(std::wstring(newValue->Value.lpszW).length() + 1) * sizeof(wchar_t),\n\t\t\t\t\t\tLPBYTE(newValue->Value.lpszW));\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\tm_prop.ulPropTag = PROP_TAG(PT_BINARY, PROP_ID_NULL);\n\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_DWORD)\n\t\t{\n\t\t\tif (PROP_TYPE(newValue->ulPropTag) == PT_LONG)\n\t\t\t{\n\t\t\t\tregistry::WriteDWORDToRegistry(m_hKey, m_name, newValue->Value.l);\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_SZ)\n\t\t{\n\t\t\tswitch (PROP_TYPE(newValue->ulPropTag))\n\t\t\t{\n\t\t\tcase PT_UNICODE:\n\t\t\t\tregistry::WriteStringToRegistry(m_hKey, m_name, newValue->Value.lpszW);\n\t\t\t\tbreak;\n\t\t\tcase PT_STRING8:\n\t\t\t\tregistry::WriteStringToRegistry(m_hKey, m_name, strings::stringTowstring(newValue->Value.lpszA));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tm_model = nullptr;\n\t\tm_prop = {};\n\t\tensureModel();\n\t}\n} \/\/ namespace propertybag<commit_msg>add comment<commit_after>#include <core\/stdafx.h>\n#include <core\/propertyBag\/registryProperty.h>\n#include <core\/mapi\/mapiFunctions.h>\n#include <core\/utility\/strings.h>\n#include <core\/utility\/registry.h>\n#include <core\/utility\/error.h>\n#include <core\/interpret\/proptags.h>\n#include <core\/property\/parseProperty.h>\n#include <core\/smartview\/SmartView.h>\n\nnamespace propertybag\n{\n\tregistryProperty::registryProperty(HKEY hKey, _In_ const std::wstring& name, DWORD dwType)\n\t\t: m_hKey(hKey), m_name(name), m_dwType(dwType)\n\t{\n\t\tm_secure = false;\n\t\t\/\/ Get our prop tag and determine if we're a secure prop\n\t\tif (name.size() == 8 || name.size() == 9)\n\t\t{\n\t\t\tULONG num{};\n\t\t\t\/\/ If we're not a simple prop tag, perhaps we have a prefix\n\t\t\tauto str = name;\n\t\t\tif (strings::stripPrefix(str, L\"S\") && strings::tryWstringToUlong(num, str, 16, false))\n\t\t\t{\n\t\t\t\tm_secure = true;\n\t\t\t\t\/\/ abuse some macros to swap the order of the tag\n\t\t\t\tm_ulPropTag = PROP_TAG(PROP_ID(num), PROP_TYPE(num));\n\t\t\t}\n\t\t\telse if (strings::tryWstringToUlong(num, name, 16, false))\n\t\t\t{\n\t\t\t\t\/\/ abuse some macros to swap the order of the tag\n\t\t\t\tm_ulPropTag = PROP_TAG(PROP_ID(num), PROP_TYPE(num));\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid registryProperty::ensureSPropValue()\n\t{\n\t\tif (m_prop.ulPropTag != 0) return;\n\t\tm_prop = {m_ulPropTag};\n\t\tm_canParseMAPI = false;\n\n\t\tif (m_dwType == REG_BINARY)\n\t\t{\n\t\t\tm_binVal = registry::ReadBinFromRegistry(m_hKey, m_name);\n\t\t\tif (m_ulPropTag)\n\t\t\t{\n\t\t\t\tm_canParseMAPI = true;\n\t\t\t\tswitch (PROP_TYPE(m_ulPropTag))\n\t\t\t\t{\n\t\t\t\tcase PT_CLSID:\n\t\t\t\t\tif (m_binVal.size() == 16)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.lpguid = reinterpret_cast<LPGUID>(const_cast<LPBYTE>(m_binVal.data()));\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_SYSTIME:\n\t\t\t\t\tif (m_binVal.size() == 8)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.ft = *reinterpret_cast<LPFILETIME>(const_cast<LPBYTE>(m_binVal.data()));\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_I8:\n\t\t\t\t\tif (m_binVal.size() == 8)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.li.QuadPart = static_cast<LONGLONG>(*m_binVal.data());\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_LONG:\n\t\t\t\t\tif (m_binVal.size() == 4)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.l = static_cast<DWORD>(*m_binVal.data());\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_BOOLEAN:\n\t\t\t\t\tif (m_binVal.size() == 2)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_prop.Value.b = static_cast<WORD>(*m_binVal.data());\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_BINARY:\n\t\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_UNICODE:\n\t\t\t\t\tif (m_secure)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ TODO - not showing right prop type in UI\n\t\t\t\t\t\tm_prop.ulPropTag = PROP_TAG(PT_BINARY, PROP_ID(m_ulPropTag));\n\t\t\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\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_unicodeVal = m_binVal;\n\t\t\t\t\t\tm_unicodeVal.push_back(0); \/\/ Add some null terminators just in case\n\t\t\t\t\t\tm_unicodeVal.push_back(0);\n\t\t\t\t\t\tm_prop.Value.lpszW = reinterpret_cast<LPWSTR>(const_cast<LPBYTE>(m_unicodeVal.data()));\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tm_prop.ulPropTag = PROP_TAG(PT_BINARY, PROP_ID(m_ulPropTag));\n\t\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\n\t\t\t\t\tm_canParseMAPI = false;\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\tm_prop.ulPropTag = PROP_TAG(PT_BINARY, PROP_ID_NULL);\n\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_DWORD)\n\t\t{\n\t\t\tm_dwVal = registry::ReadDWORDFromRegistry(m_hKey, m_name);\n\t\t\tm_prop.Value.l = m_dwVal;\n\t\t\tif (m_ulPropTag)\n\t\t\t{\n\t\t\t\tm_canParseMAPI = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_prop.ulPropTag = PROP_TAG(PT_LONG, PROP_ID_NULL);\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_SZ)\n\t\t{\n\t\t\tm_szVal = registry::ReadStringFromRegistry(m_hKey, m_name);\n\t\t\tif (!m_prop.ulPropTag) m_prop.ulPropTag = PROP_TAG(PT_UNICODE, PROP_ID_NULL);\n\t\t\tswitch (PROP_TYPE(m_prop.ulPropTag))\n\t\t\t{\n\t\t\tcase PT_UNICODE:\n\t\t\t\tm_prop.Value.lpszW = m_szVal.data();\n\t\t\t\tbreak;\n\t\t\tcase PT_STRING8:\n\t\t\t\tm_ansiVal = strings::wstringTostring(m_szVal);\n\t\t\t\tm_prop.Value.lpszA = m_ansiVal.data();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid registryProperty::ensureModel()\n\t{\n\t\tif (m_model) return;\n\t\tensureSPropValue();\n\t\tm_model = std::make_shared<model::mapiRowModel>();\n\t\tif (m_ulPropTag != 0)\n\t\t{\n\t\t\tm_model->ulPropTag(m_ulPropTag);\n\t\t\tconst auto propTagNames = proptags::PropTagToPropName(m_ulPropTag, false);\n\t\t\tif (!propTagNames.bestGuess.empty())\n\t\t\t{\n\t\t\t\tm_model->name(propTagNames.bestGuess);\n\t\t\t}\n\n\t\t\tif (!propTagNames.otherMatches.empty())\n\t\t\t{\n\t\t\t\tm_model->otherName(propTagNames.otherMatches);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_model->name(m_name);\n\t\t\tm_model->otherName(strings::format(L\"%d\", m_dwType)); \/\/ Just shoving in model to see it\n\t\t}\n\n\t\tif (m_secure) m_model->name(m_model->name() + L\" (secure)\");\n\n\t\tif (m_dwType == REG_BINARY)\n\t\t{\n\t\t\tif (!m_canParseMAPI)\n\t\t\t{\n\t\t\t\tif (!m_model->ulPropTag()) m_model->ulPropTag(PROP_TAG(PT_BINARY, PROP_ID_NULL));\n\t\t\t\tm_model->value(strings::BinToHexString(m_binVal, true));\n\t\t\t\tm_model->altValue(strings::BinToTextString(m_binVal, true));\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_DWORD)\n\t\t{\n\t\t\tif (!m_ulPropTag)\n\t\t\t{\n\t\t\t\tm_model->ulPropTag(PROP_TAG(PT_LONG, PROP_ID_NULL));\n\t\t\t\tm_model->value(strings::format(L\"%d\", m_dwVal));\n\t\t\t\tm_model->altValue(strings::format(L\"0x%08X\", m_dwVal));\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_SZ)\n\t\t{\n\t\t\tif (!m_model->ulPropTag()) m_model->ulPropTag(PROP_TAG(PT_UNICODE, PROP_ID_NULL));\n\t\t\tm_model->value(m_szVal);\n\t\t}\n\n\t\tif (m_canParseMAPI)\n\t\t{\n\t\t\tstd::wstring PropString;\n\t\t\tstd::wstring AltPropString;\n\t\t\tproperty::parseProperty(&m_prop, &PropString, &AltPropString);\n\t\t\tm_model->value(PropString);\n\t\t\tm_model->altValue(AltPropString);\n\n\t\t\tconst auto szSmartView =\n\t\t\t\tsmartview::parsePropertySmartView(&m_prop, nullptr, nullptr, nullptr, false, false);\n\t\t\tif (!szSmartView.empty()) m_model->smartView(szSmartView);\n\t\t}\n\n\t\t\/\/ For debugging purposes right now\n\t\tm_model->namedPropName(strings::BinToHexString(m_binVal, true));\n\t\tm_model->namedPropGuid(strings::BinToTextString(m_binVal, true));\n\t}\n\n\tvoid registryProperty::set(_In_opt_ LPSPropValue newValue)\n\t{\n\t\tif (!newValue) return;\n\n\t\tif (m_dwType == REG_BINARY)\n\t\t{\n\t\t\tif (m_ulPropTag)\n\t\t\t{\n\t\t\t\tswitch (PROP_TYPE(m_ulPropTag))\n\t\t\t\t{\n\t\t\t\tcase PT_CLSID:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 16, LPBYTE(newValue->Value.lpguid));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_SYSTIME:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 8, LPBYTE(&newValue->Value.ft));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_I8:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 8, LPBYTE(&newValue->Value.li.QuadPart));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_LONG:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 4, LPBYTE(&newValue->Value.l));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_BOOLEAN:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, 2, LPBYTE(&newValue->Value.b));\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_BINARY:\n\t\t\t\t\tregistry::WriteBinToRegistry(m_hKey, m_name, newValue->Value.bin.cb, newValue->Value.bin.lpb);\n\t\t\t\t\tbreak;\n\t\t\t\tcase PT_UNICODE:\n\t\t\t\t\t\/\/ Include null terminator\n\t\t\t\t\tregistry::WriteBinToRegistry(\n\t\t\t\t\t\tm_hKey,\n\t\t\t\t\t\tm_name,\n\t\t\t\t\t\t(std::wstring(newValue->Value.lpszW).length() + 1) * sizeof(wchar_t),\n\t\t\t\t\t\tLPBYTE(newValue->Value.lpszW));\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\tm_prop.ulPropTag = PROP_TAG(PT_BINARY, PROP_ID_NULL);\n\t\t\t\tm_prop.Value.bin.cb = m_binVal.size();\n\t\t\t\tm_prop.Value.bin.lpb = const_cast<LPBYTE>(m_binVal.data());\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_DWORD)\n\t\t{\n\t\t\tif (PROP_TYPE(newValue->ulPropTag) == PT_LONG)\n\t\t\t{\n\t\t\t\tregistry::WriteDWORDToRegistry(m_hKey, m_name, newValue->Value.l);\n\t\t\t}\n\t\t}\n\t\telse if (m_dwType == REG_SZ)\n\t\t{\n\t\t\tswitch (PROP_TYPE(newValue->ulPropTag))\n\t\t\t{\n\t\t\tcase PT_UNICODE:\n\t\t\t\tregistry::WriteStringToRegistry(m_hKey, m_name, newValue->Value.lpszW);\n\t\t\t\tbreak;\n\t\t\tcase PT_STRING8:\n\t\t\t\tregistry::WriteStringToRegistry(m_hKey, m_name, strings::stringTowstring(newValue->Value.lpszA));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tm_model = nullptr;\n\t\tm_prop = {};\n\t\tensureModel();\n\t}\n} \/\/ namespace propertybag<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2015.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#if     qHas_Syslog\n#include    <syslog.h>\n#endif\n\n#include    \"..\/Characters\/CString\/Utilities.h\"\n#include    \"..\/Characters\/Format.h\"\n#include    \"..\/Debug\/Trace.h\"\n#include    \"BlockingQueue.h\"\n#include    \"Common.h\"\n#include    \"Process.h\"\n#include    \"Thread.h\"\n#include    \"TimeOutException.h\"\n\n#include    \"Logger.h\"\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Configuration;\nusing   namespace   Stroika::Foundation::Execution;\n\nusing   Memory::Optional;\nusing   Time::DurationSecondsType;\n\n\n\n\/\/ Comment this in to turn on aggressive noisy DbgTrace in this module\n\/\/#define   USE_NOISY_TRACE_IN_THIS_MODULE_       1\n\n\n\n\n\n\/*\n ********************************************************************************\n ******************************** Execution::Logger *****************************\n ********************************************************************************\n *\/\nLogger  Logger::sThe_;\n\nconst EnumNames<Logger::Priority>   Logger::Stroika_Enum_Names(Priority)\n{\n    { Logger::Priority::eDebug, L\"Debug\" },\n    { Logger::Priority::eInfo, L\"Info\" },\n    { Logger::Priority::eNotice, L\"Notice\" },\n    { Logger::Priority::eWarning, L\"Warning\" },\n    { Logger::Priority::eError, L\"Error\" },\n    { Logger::Priority::eCriticalError, L\"CriticalError\" },\n    { Logger::Priority::eAlertError, L\"AlertError\" },\n    { Logger::Priority::eEmergency, L\"Emergency\" },\n};\n\n\n\nnamespace {\n    BlockingQueue<pair<Logger::Priority, String>>   sOutMsgQ_;\n    Execution::Thread                               sBookkeepingThread_;\n    bool                                            sOutQMaybeNeedsFlush_ = true;       \/\/ sligt optimziation of not using buffering\n\n    Synchronized<Memory::Optional<DurationSecondsType>>       sSuppressDuplicatesThreshold_;\n\n    struct LastMsg_ {\n        mutex                               fMutex_;     \/\/ mutex so we can update related variables together\n        pair<Logger::Priority, String>      fLastMsgSent_;\n        Time::DurationSecondsType           fLastSentAt = 0.0;\n        unsigned int                        fRepeatCount_ = 0;\n    };\n    LastMsg_    sLastMsg_;\n}\n\n\nLogger::Logger ()\n    : fAppender_ ()\n    , fMinLogLevel_ (Priority::eInfo)\n    , fBufferingEnabled_ (false)\n{\n}\n\nvoid    Logger::SetAppender (const shared_ptr<IAppenderRep>& rep)\n{\n    fAppender_ = rep;\n}\n\nvoid    Logger::Log_ (Priority logLevel, const String& format, va_list argList)\n{\n    shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n    if (tmp.get () != nullptr) {\n        auto p = pair<Logger::Priority, String> (logLevel, Characters::FormatV (format.c_str (), argList));\n        if (sSuppressDuplicatesThreshold_->IsPresent ()) {\n            auto    critSec { make_unique_lock (sLastMsg_.fMutex_) };\n            if (p == sLastMsg_.fLastMsgSent_) {\n                sLastMsg_.fRepeatCount_++;\n                sLastMsg_.fLastSentAt = Time::GetTickCount ();\n                return; \/\/ so will be handled later\n            }\n            else {\n                if (sLastMsg_.fRepeatCount_ > 0) {\n                    FlushDupsWarning_ ();\n                }\n                sLastMsg_.fLastMsgSent_ = p;\n                sLastMsg_.fRepeatCount_ = 0;\n                sLastMsg_.fLastSentAt = Time::GetTickCount ();\n            }\n        }\n        if (GetBufferingEnabled ()) {\n            sOutQMaybeNeedsFlush_ = true;\n            sOutMsgQ_.AddTail (p);\n        }\n        else {\n            if (sOutQMaybeNeedsFlush_) {\n                FlushBuffer (); \/\/ in case recently disabled\n            }\n            tmp->Log (p.first, p.second);\n        }\n    }\n}\n\nvoid        Logger::SetBufferingEnabled (bool logBufferingEnabled)\n{\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n    Debug::TraceContextBumper ctx (SDKSTR (\"Logger::SetBufferingEnabled\"));\n    DbgTrace (L\"(logBufferingEnabled=%d)\", logBufferingEnabled);\n#endif\n    sThe_.fBufferingEnabled_ = logBufferingEnabled;\n    UpdateBookkeepingThread_ ();\n}\n\nvoid        Logger::FlushBuffer ()\n{\n    shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n    if (tmp != nullptr) {\n        while (true) {\n            Optional<pair<Logger::Priority, String>> p = sOutMsgQ_.RemoveHeadIfPossible ();\n            if (p.IsPresent ()) {\n                tmp->Log (p->first, p->second);\n            }\n            else {\n                return; \/\/ no more entries\n            }\n        }\n    }\n    sOutQMaybeNeedsFlush_ = false;\n}\n\nMemory::Optional<Time::DurationSecondsType> Logger::GetSuppressDuplicates ()\n{\n    return Memory::Optional<Time::DurationSecondsType> (sSuppressDuplicatesThreshold_);\n}\n\nvoid    Logger::SetSuppressDuplicates (const Memory::Optional<DurationSecondsType>& suppressDuplicatesThreshold)\n{\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n    Debug::TraceContextBumper ctx (SDKSTR (\"Logger::SetSuppressDuplicates\"));\n    DbgTrace (L\"(suppressDuplicatesThreshold=%f)\", suppressDuplicatesThreshold.Value (-1));\n#endif\n    Require (suppressDuplicatesThreshold.IsMissing () or * suppressDuplicatesThreshold > 0.0);\n    auto    critSec { Execution::make_unique_lock (sSuppressDuplicatesThreshold_) };\n    if (sSuppressDuplicatesThreshold_ != suppressDuplicatesThreshold) {\n        sSuppressDuplicatesThreshold_ = suppressDuplicatesThreshold;\n        UpdateBookkeepingThread_ ();\n    }\n}\n\nvoid    Logger::FlushDupsWarning_ ()\n{\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n    Debug::TraceContextBumper ctx (SDKSTR (\"Logger::FlushDupsWarning_\"));\n#endif\n    if (sLastMsg_.fRepeatCount_ > 0) {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        DbgTrace (L\"sLastMsg_.fRepeatCount_ = %d\", sLastMsg_.fRepeatCount_);\n#endif\n        shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n        if (tmp != nullptr) {\n            if (sLastMsg_.fRepeatCount_ == 1) {\n                tmp->Log (sLastMsg_.fLastMsgSent_.first, sLastMsg_.fLastMsgSent_.second);\n            }\n            else {\n                tmp->Log (sLastMsg_.fLastMsgSent_.first,  Characters::Format (L\"[%d duplicates suppressed]: %s\", sLastMsg_.fRepeatCount_ - 1, sLastMsg_.fLastMsgSent_.second.c_str ()));\n            }\n        }\n        sLastMsg_.fRepeatCount_ = 0;\n        sLastMsg_.fLastMsgSent_.second.clear ();\n    }\n}\n\nvoid    Logger::UpdateBookkeepingThread_ ()\n{\n    sBookkeepingThread_.AbortAndWaitForDone ();\n    sBookkeepingThread_ = Thread ();  \/\/ so null\n\n    Time::DurationSecondsType   suppressDuplicatesThreshold =   sSuppressDuplicatesThreshold_->Value (0);\n    bool                        suppressDuplicates          =   suppressDuplicatesThreshold > 0;\n    if (suppressDuplicates or GetBufferingEnabled ()) {\n        if (suppressDuplicates) {\n            sBookkeepingThread_ = Thread ([suppressDuplicatesThreshold] () {\n                while (true) {\n                    DurationSecondsType time2Wait = max (static_cast<DurationSecondsType> (2), suppressDuplicatesThreshold);    \/\/ never wait less than this\n                    try {\n                        auto p = sOutMsgQ_.RemoveHead (time2Wait);\n                        shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n                        if (tmp != nullptr) {\n                            tmp->Log (p.first, p.second);\n                        }\n                    }\n                    catch (const TimeOutException&) {\n                    }\n                    {\n                        auto    critSec { make_unique_lock (sLastMsg_.fMutex_) };\n                        if (sLastMsg_.fRepeatCount_ > 0 and sLastMsg_.fLastSentAt + suppressDuplicatesThreshold < Time::GetTickCount ()) {\n                            FlushDupsWarning_ ();\n                        }\n                    }\n                }\n            });\n        }\n        else {\n            sBookkeepingThread_ = Thread ([] () {\n                while (true) {\n                    auto p = sOutMsgQ_.RemoveHead ();\n                    shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n                    if (tmp != nullptr) {\n                        tmp->Log (p.first, p.second);\n                    }\n                }\n            });\n        }\n        sBookkeepingThread_.SetThreadName (L\"Logger Bookkeeping\");\n        sBookkeepingThread_.SetThreadPriority (Thread::Priority::eBelowNormal);\n        sBookkeepingThread_.Start ();\n    }\n\n    \/\/ manually push out pending messages\n    FlushBuffer ();\n}\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************** Execution::IAppenderRep *****************************\n ********************************************************************************\n *\/\nLogger::IAppenderRep::~IAppenderRep ()\n{\n}\n\n\n\n\n\n\n#if     qHas_Syslog\n\/*\n ********************************************************************************\n ************************ Execution::SysLogAppender *****************************\n ********************************************************************************\n *\/\nnamespace   {\n    string mkMsg_ (const String& applicationName)\n    {\n        return Characters::CString::Format (\"%s[%d]\", applicationName.AsNarrowSDKString ().c_str (), GetCurrentProcessID ());\n    }\n}\nLogger::SysLogAppender::SysLogAppender (const String& applicationName)\n    : fApplicationName_ (mkMsg_ (applicationName))\n{\n    openlog (fApplicationName_.c_str (), 0, LOG_DAEMON);    \/\/ not sure what facility to pass?\n}\n\nLogger::SysLogAppender::SysLogAppender (const String& applicationName, int facility)\n    : fApplicationName_ (mkMsg_ (applicationName))\n{\n    openlog (fApplicationName_.c_str (), 0, facility);\n}\n\nLogger::SysLogAppender::~SysLogAppender ()\n{\n    closelog ();\n}\n\nvoid    Logger::SysLogAppender::Log (Priority logLevel, const String& message)\n{\n    DbgTrace (L\"SYSLOG: %s: %s\", Stroika_Enum_Names(Priority).GetName (logLevel), message.c_str ());\n    int sysLogLevel = LOG_NOTICE;   \/\/ doesnt matter cuz assert error if hit\n    switch (logLevel) {\n        case Priority::eDebug:\n            sysLogLevel = LOG_DEBUG;\n            break;\n        case Priority::eInfo:\n            sysLogLevel = LOG_INFO;\n            break;\n        case Priority::eNotice:\n            sysLogLevel = LOG_NOTICE;\n            break;\n        case Priority::eWarning:\n            sysLogLevel = LOG_WARNING;\n            break;\n        case Priority::eError:\n            sysLogLevel = LOG_ERR;\n            break;\n        case Priority::eCriticalError:\n            sysLogLevel = LOG_CRIT;\n            break;\n        case Priority::eAlertError:\n            sysLogLevel = LOG_ALERT;\n            break;\n        case Priority::eEmergency:\n            sysLogLevel = LOG_EMERG;\n            break;\n        default:\n            RequireNotReached ();\n    }\n    syslog (sysLogLevel, \"%s\", message.AsNarrowSDKString ().c_str ());\n}\n#endif\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************** Execution::FileAppender *****************************\n ********************************************************************************\n *\/\nLogger::FileAppender::FileAppender (const String& fileName)\n{\n    AssertNotImplemented ();\n}\n\nvoid    Logger::FileAppender::Log (Priority logLevel, const String& message)\n{\n    AssertNotImplemented ();\n}\n\n\n\n\n\n\n#if     qPlatform_Windows\n\/*\n ********************************************************************************\n ************************ Execution::SysLogAppender *****************************\n ********************************************************************************\n *\/\nLogger::WindowsEventLogAppender::WindowsEventLogAppender ()\n{\n}\n\nvoid    Logger::WindowsEventLogAppender::Log (Priority logLevel, const String& message)\n{\n    \/*\n     * VERY QUICK HACK - AT LEAST DUMPS SOME INFO TO EVENTLOG - BUT MUCH TWEAKING LEFT TODO\n     *\/\n    const   TCHAR   kEventSourceName[]  =   _T (\"xxxtest\");\n    WORD    eventType   =   EVENTLOG_ERROR_TYPE;\n    switch (logLevel) {\n        case Priority::eDebug:\n            eventType = EVENTLOG_INFORMATION_TYPE;\n            break;\n        case Priority::eInfo:\n            eventType = EVENTLOG_INFORMATION_TYPE;\n            break;\n        case Priority::eNotice:\n            eventType = EVENTLOG_INFORMATION_TYPE;\n            break;\n        case Priority::eWarning:\n            eventType = EVENTLOG_WARNING_TYPE;\n            break;\n        case Priority::eError:\n            eventType = EVENTLOG_ERROR_TYPE;\n            break;\n        case Priority::eAlertError:\n            eventType = EVENTLOG_ERROR_TYPE;\n            break;\n        case Priority::eEmergency:\n            eventType = EVENTLOG_ERROR_TYPE;\n            break;\n    }\n#define CATEGORY_Normal                  0x00000001L\n    WORD    eventCategoryID =   CATEGORY_Normal;\n    \/\/ See SPR#565 for wierdness - where I cannot really get these paid attention to\n    \/\/ by the Windows EventLog. So had to use the .Net eventlogger. It SEEMS\n#define EVENT_Message                    0x00000064L\n    const   DWORD   kEventID            =   EVENT_Message;\n    HANDLE  hEventSource = RegisterEventSource (NULL, kEventSourceName);\n    Verify (hEventSource != NULL);\n    SDKString tmp = message.AsSDKString ();\n    const Characters::SDKChar* msg = tmp.c_str ();\n    Verify (::ReportEvent (\n                hEventSource,\n                eventType,\n                eventCategoryID,\n                kEventID,\n                NULL,\n                (WORD)1,\n                0,\n                &msg,\n                NULL\n            )\n           );\n    Verify (::DeregisterEventSource (hEventSource));\n}\n#endif<commit_msg>use Synchonized<> with recursive mutex  instead of nonrecursive mutext to avoid a flush deadlock in Execution::Logger<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2015.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#if     qHas_Syslog\n#include    <syslog.h>\n#endif\n\n#include    \"..\/Characters\/CString\/Utilities.h\"\n#include    \"..\/Characters\/Format.h\"\n#include    \"..\/Debug\/Trace.h\"\n#include    \"BlockingQueue.h\"\n#include    \"Common.h\"\n#include    \"Process.h\"\n#include    \"Synchronized.h\"\n#include    \"Thread.h\"\n#include    \"TimeOutException.h\"\n\n#include    \"Logger.h\"\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Configuration;\nusing   namespace   Stroika::Foundation::Execution;\n\nusing   Memory::Optional;\nusing   Time::DurationSecondsType;\n\n\n\n\/\/ Comment this in to turn on aggressive noisy DbgTrace in this module\n\/\/#define   USE_NOISY_TRACE_IN_THIS_MODULE_       1\n\n\n\n\n\n\/*\n ********************************************************************************\n ******************************** Execution::Logger *****************************\n ********************************************************************************\n *\/\nLogger  Logger::sThe_;\n\nconst EnumNames<Logger::Priority>   Logger::Stroika_Enum_Names(Priority)\n{\n    { Logger::Priority::eDebug, L\"Debug\" },\n    { Logger::Priority::eInfo, L\"Info\" },\n    { Logger::Priority::eNotice, L\"Notice\" },\n    { Logger::Priority::eWarning, L\"Warning\" },\n    { Logger::Priority::eError, L\"Error\" },\n    { Logger::Priority::eCriticalError, L\"CriticalError\" },\n    { Logger::Priority::eAlertError, L\"AlertError\" },\n    { Logger::Priority::eEmergency, L\"Emergency\" },\n};\n\n\n\nnamespace {\n    BlockingQueue<pair<Logger::Priority, String>>   sOutMsgQ_;\n    Execution::Thread                               sBookkeepingThread_;\n    bool                                            sOutQMaybeNeedsFlush_ = true;       \/\/ sligt optimziation of not using buffering\n\n    Synchronized<Memory::Optional<DurationSecondsType>>       sSuppressDuplicatesThreshold_;\n\n    struct LastMsg_ {\n        pair<Logger::Priority, String>      fLastMsgSent_;\n        Time::DurationSecondsType           fLastSentAt = 0.0;\n        unsigned int                        fRepeatCount_ = 0;\n    };\n    Synchronized<LastMsg_>    sLastMsg_;\n}\n\n\nLogger::Logger ()\n    : fAppender_ ()\n    , fMinLogLevel_ (Priority::eInfo)\n    , fBufferingEnabled_ (false)\n{\n}\n\nvoid    Logger::SetAppender (const shared_ptr<IAppenderRep>& rep)\n{\n    fAppender_ = rep;\n}\n\nvoid    Logger::Log_ (Priority logLevel, const String& format, va_list argList)\n{\n    shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n    if (tmp.get () != nullptr) {\n        auto p = pair<Logger::Priority, String> (logLevel, Characters::FormatV (format.c_str (), argList));\n        if (sSuppressDuplicatesThreshold_->IsPresent ()) {\n            auto    lastMsgLocked = sLastMsg_.GetReference ();\n            if (p == lastMsgLocked->fLastMsgSent_) {\n                lastMsgLocked->fRepeatCount_++;\n                lastMsgLocked->fLastSentAt = Time::GetTickCount ();\n                return; \/\/ so will be handled later\n            }\n            else {\n                if (lastMsgLocked->fRepeatCount_ > 0) {\n                    FlushDupsWarning_ ();\n                }\n                lastMsgLocked->fLastMsgSent_ = p;\n                lastMsgLocked->fRepeatCount_ = 0;\n                lastMsgLocked->fLastSentAt = Time::GetTickCount ();\n            }\n        }\n        if (GetBufferingEnabled ()) {\n            sOutQMaybeNeedsFlush_ = true;\n            sOutMsgQ_.AddTail (p);\n        }\n        else {\n            if (sOutQMaybeNeedsFlush_) {\n                FlushBuffer (); \/\/ in case recently disabled\n            }\n            tmp->Log (p.first, p.second);\n        }\n    }\n}\n\nvoid        Logger::SetBufferingEnabled (bool logBufferingEnabled)\n{\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n    Debug::TraceContextBumper ctx (SDKSTR (\"Logger::SetBufferingEnabled\"));\n    DbgTrace (L\"(logBufferingEnabled=%d)\", logBufferingEnabled);\n#endif\n    sThe_.fBufferingEnabled_ = logBufferingEnabled;\n    UpdateBookkeepingThread_ ();\n}\n\nvoid        Logger::FlushBuffer ()\n{\n    shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n    if (tmp != nullptr) {\n        while (true) {\n            Optional<pair<Logger::Priority, String>> p = sOutMsgQ_.RemoveHeadIfPossible ();\n            if (p.IsPresent ()) {\n                tmp->Log (p->first, p->second);\n            }\n            else {\n                return; \/\/ no more entries\n            }\n        }\n    }\n    sOutQMaybeNeedsFlush_ = false;\n}\n\nMemory::Optional<Time::DurationSecondsType> Logger::GetSuppressDuplicates ()\n{\n    return Memory::Optional<Time::DurationSecondsType> (sSuppressDuplicatesThreshold_);\n}\n\nvoid    Logger::SetSuppressDuplicates (const Memory::Optional<DurationSecondsType>& suppressDuplicatesThreshold)\n{\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n    Debug::TraceContextBumper ctx (SDKSTR (\"Logger::SetSuppressDuplicates\"));\n    DbgTrace (L\"(suppressDuplicatesThreshold=%f)\", suppressDuplicatesThreshold.Value (-1));\n#endif\n    Require (suppressDuplicatesThreshold.IsMissing () or * suppressDuplicatesThreshold > 0.0);\n    auto    critSec { Execution::make_unique_lock (sSuppressDuplicatesThreshold_) };\n    if (sSuppressDuplicatesThreshold_ != suppressDuplicatesThreshold) {\n        sSuppressDuplicatesThreshold_ = suppressDuplicatesThreshold;\n        UpdateBookkeepingThread_ ();\n    }\n}\n\nvoid    Logger::FlushDupsWarning_ ()\n{\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n    Debug::TraceContextBumper ctx (SDKSTR (\"Logger::FlushDupsWarning_\"));\n#endif\n    auto    lastMsgLocked = sLastMsg_.GetReference ();\n    if (lastMsgLocked->fRepeatCount_ > 0) {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        DbgTrace (L\"sLastMsg_.fRepeatCount_ = %d\", lastMsgLocked->fRepeatCount_);\n#endif\n        shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n        if (tmp != nullptr) {\n            if (lastMsgLocked->fRepeatCount_ == 1) {\n                tmp->Log (lastMsgLocked->fLastMsgSent_.first, lastMsgLocked->fLastMsgSent_.second);\n            }\n            else {\n                tmp->Log (lastMsgLocked->fLastMsgSent_.first,  Characters::Format (L\"[%d duplicates suppressed]: %s\", lastMsgLocked->fRepeatCount_ - 1, lastMsgLocked->fLastMsgSent_.second.c_str ()));\n            }\n        }\n        lastMsgLocked->fRepeatCount_ = 0;\n        lastMsgLocked->fLastMsgSent_.second.clear ();\n    }\n}\n\nvoid    Logger::UpdateBookkeepingThread_ ()\n{\n    sBookkeepingThread_.AbortAndWaitForDone ();\n    sBookkeepingThread_ = Thread ();  \/\/ so null\n\n    Time::DurationSecondsType   suppressDuplicatesThreshold =   sSuppressDuplicatesThreshold_->Value (0);\n    bool                        suppressDuplicates          =   suppressDuplicatesThreshold > 0;\n    if (suppressDuplicates or GetBufferingEnabled ()) {\n        if (suppressDuplicates) {\n            sBookkeepingThread_ = Thread ([suppressDuplicatesThreshold] () {\n                while (true) {\n                    DurationSecondsType time2Wait = max (static_cast<DurationSecondsType> (2), suppressDuplicatesThreshold);    \/\/ never wait less than this\n                    try {\n                        auto p = sOutMsgQ_.RemoveHead (time2Wait);\n                        shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n                        if (tmp != nullptr) {\n                            tmp->Log (p.first, p.second);\n                        }\n                    }\n                    catch (const TimeOutException&) {\n                    }\n                    {\n                        auto    lastMsgLocked = sLastMsg_.GetReference ();\n                        if (lastMsgLocked->fRepeatCount_ > 0 and lastMsgLocked->fLastSentAt + suppressDuplicatesThreshold < Time::GetTickCount ()) {\n                            FlushDupsWarning_ ();\n                        }\n                    }\n                }\n            });\n        }\n        else {\n            sBookkeepingThread_ = Thread ([] () {\n                while (true) {\n                    auto p = sOutMsgQ_.RemoveHead ();\n                    shared_ptr<IAppenderRep> tmp =   sThe_.fAppender_;   \/\/ avoid races and critical sections\n                    if (tmp != nullptr) {\n                        tmp->Log (p.first, p.second);\n                    }\n                }\n            });\n        }\n        sBookkeepingThread_.SetThreadName (L\"Logger Bookkeeping\");\n        sBookkeepingThread_.SetThreadPriority (Thread::Priority::eBelowNormal);\n        sBookkeepingThread_.Start ();\n    }\n\n    \/\/ manually push out pending messages\n    FlushBuffer ();\n}\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************** Execution::IAppenderRep *****************************\n ********************************************************************************\n *\/\nLogger::IAppenderRep::~IAppenderRep ()\n{\n}\n\n\n\n\n\n\n#if     qHas_Syslog\n\/*\n ********************************************************************************\n ************************ Execution::SysLogAppender *****************************\n ********************************************************************************\n *\/\nnamespace   {\n    string mkMsg_ (const String& applicationName)\n    {\n        return Characters::CString::Format (\"%s[%d]\", applicationName.AsNarrowSDKString ().c_str (), GetCurrentProcessID ());\n    }\n}\nLogger::SysLogAppender::SysLogAppender (const String& applicationName)\n    : fApplicationName_ (mkMsg_ (applicationName))\n{\n    openlog (fApplicationName_.c_str (), 0, LOG_DAEMON);    \/\/ not sure what facility to pass?\n}\n\nLogger::SysLogAppender::SysLogAppender (const String& applicationName, int facility)\n    : fApplicationName_ (mkMsg_ (applicationName))\n{\n    openlog (fApplicationName_.c_str (), 0, facility);\n}\n\nLogger::SysLogAppender::~SysLogAppender ()\n{\n    closelog ();\n}\n\nvoid    Logger::SysLogAppender::Log (Priority logLevel, const String& message)\n{\n    DbgTrace (L\"SYSLOG: %s: %s\", Stroika_Enum_Names(Priority).GetName (logLevel), message.c_str ());\n    int sysLogLevel = LOG_NOTICE;   \/\/ doesnt matter cuz assert error if hit\n    switch (logLevel) {\n        case Priority::eDebug:\n            sysLogLevel = LOG_DEBUG;\n            break;\n        case Priority::eInfo:\n            sysLogLevel = LOG_INFO;\n            break;\n        case Priority::eNotice:\n            sysLogLevel = LOG_NOTICE;\n            break;\n        case Priority::eWarning:\n            sysLogLevel = LOG_WARNING;\n            break;\n        case Priority::eError:\n            sysLogLevel = LOG_ERR;\n            break;\n        case Priority::eCriticalError:\n            sysLogLevel = LOG_CRIT;\n            break;\n        case Priority::eAlertError:\n            sysLogLevel = LOG_ALERT;\n            break;\n        case Priority::eEmergency:\n            sysLogLevel = LOG_EMERG;\n            break;\n        default:\n            RequireNotReached ();\n    }\n    syslog (sysLogLevel, \"%s\", message.AsNarrowSDKString ().c_str ());\n}\n#endif\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************** Execution::FileAppender *****************************\n ********************************************************************************\n *\/\nLogger::FileAppender::FileAppender (const String& fileName)\n{\n    AssertNotImplemented ();\n}\n\nvoid    Logger::FileAppender::Log (Priority logLevel, const String& message)\n{\n    AssertNotImplemented ();\n}\n\n\n\n\n\n\n#if     qPlatform_Windows\n\/*\n ********************************************************************************\n ************************ Execution::SysLogAppender *****************************\n ********************************************************************************\n *\/\nLogger::WindowsEventLogAppender::WindowsEventLogAppender ()\n{\n}\n\nvoid    Logger::WindowsEventLogAppender::Log (Priority logLevel, const String& message)\n{\n    \/*\n     * VERY QUICK HACK - AT LEAST DUMPS SOME INFO TO EVENTLOG - BUT MUCH TWEAKING LEFT TODO\n     *\/\n    const   TCHAR   kEventSourceName[]  =   _T (\"xxxtest\");\n    WORD    eventType   =   EVENTLOG_ERROR_TYPE;\n    switch (logLevel) {\n        case Priority::eDebug:\n            eventType = EVENTLOG_INFORMATION_TYPE;\n            break;\n        case Priority::eInfo:\n            eventType = EVENTLOG_INFORMATION_TYPE;\n            break;\n        case Priority::eNotice:\n            eventType = EVENTLOG_INFORMATION_TYPE;\n            break;\n        case Priority::eWarning:\n            eventType = EVENTLOG_WARNING_TYPE;\n            break;\n        case Priority::eError:\n            eventType = EVENTLOG_ERROR_TYPE;\n            break;\n        case Priority::eAlertError:\n            eventType = EVENTLOG_ERROR_TYPE;\n            break;\n        case Priority::eEmergency:\n            eventType = EVENTLOG_ERROR_TYPE;\n            break;\n    }\n#define CATEGORY_Normal                  0x00000001L\n    WORD    eventCategoryID =   CATEGORY_Normal;\n    \/\/ See SPR#565 for wierdness - where I cannot really get these paid attention to\n    \/\/ by the Windows EventLog. So had to use the .Net eventlogger. It SEEMS\n#define EVENT_Message                    0x00000064L\n    const   DWORD   kEventID            =   EVENT_Message;\n    HANDLE  hEventSource = RegisterEventSource (NULL, kEventSourceName);\n    Verify (hEventSource != NULL);\n    SDKString tmp = message.AsSDKString ();\n    const Characters::SDKChar* msg = tmp.c_str ();\n    Verify (::ReportEvent (\n                hEventSource,\n                eventType,\n                eventCategoryID,\n                kEventID,\n                NULL,\n                (WORD)1,\n                0,\n                &msg,\n                NULL\n            )\n           );\n    Verify (::DeregisterEventSource (hEventSource));\n}\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2013 by Glenn Hickey (hickey@soe.ucsc.edu)\n *\n * Released under the MIT license, see LICENSE.txt\n *\/\n\n#include <iostream>\n#include <string>\n#include <set>\n#include <vector>\n#include <map>\n#include \"hal.h\"\n#include \"halBlockMapper.h\"\n\nusing namespace hal;\nusing namespace std;\n\nhal_size_t BlockMapper::_maxAdjScan = 5;\n\nBlockMapper::BlockMapper()\n{\n\n}\n\nBlockMapper::~BlockMapper()\n{\n  erase();\n}\n\nvoid BlockMapper::erase()\n{\n  _segMap.clear();\n  _spanningTree.clear();\n}\n\nvoid BlockMapper::init(const Genome* refGenome, const Genome* queryGenome,\n                       hal_index_t absRefFirst, hal_index_t absRefLast,\n                       bool doDupes, hal_size_t minLength,\n                       bool mapTargetAdjacencies)\n{\n  erase();\n  _absRefFirst = absRefFirst;\n  _absRefLast = absRefLast;\n  _doDupes = doDupes;\n  _minLength = minLength;\n  _mapAdj = mapTargetAdjacencies;\n  _refGenome = refGenome;\n  _refSequence = refGenome->getSequenceBySite(_absRefFirst);\n  assert(_refSequence == refGenome->getSequenceBySite(_absRefLast));\n  _queryGenome = queryGenome;\n\n  set<const Genome*> inputSet;\n  inputSet.insert(_refGenome);\n  inputSet.insert(_queryGenome);\n  getGenomesInSpanningTree(inputSet, _spanningTree);\n}\n\nvoid BlockMapper::map()\n{\n  SegmentIteratorConstPtr refSeg;\n  hal_index_t lastIndex;\n  if (_refGenome->getNumBottomSegments() > 0)\n  {\n    refSeg = _refGenome->getBottomSegmentIterator();\n    lastIndex = _refGenome->getNumBottomSegments();\n  }\n  else\n  {\n    refSeg = _refGenome->getTopSegmentIterator();\n    lastIndex = _refGenome->getNumTopSegments();\n  }\n\n  refSeg->toSite(_absRefFirst, false);\n  hal_offset_t startOffset = _absRefFirst - refSeg->getStartPosition();\n  hal_offset_t endOffset = 0;\n  if (_absRefLast <= refSeg->getEndPosition())\n  {\n    endOffset = refSeg->getEndPosition() - _absRefLast;\n  }\n  refSeg->slice(startOffset, endOffset);\n  \n  assert(refSeg->getStartPosition() ==  _absRefFirst);\n  assert(refSeg->getEndPosition() <= _absRefLast);\n\n  while (refSeg->getArrayIndex() < lastIndex &&\n         refSeg->getStartPosition() <= _absRefLast)  \n  {\n    refSeg->getMappedSegments(_segMap, _queryGenome, &_spanningTree,\n                              _doDupes, _minLength);\n    refSeg->toRight(_absRefLast);\n  }\n\n  if (_mapAdj)\n  {\n    \/\/ construct a set sorted on query instead of ref. \n    MSFlipSet flipSet(_segMap.begin(), _segMap.end());\n\n    MSFlipSet::const_iterator i;\n    for (i = flipSet.begin(); i != flipSet.end(); ++i)\n    {\n      mapAdjacencies(flipSet, i);\n    }\n  }\n}\n  \nvoid BlockMapper::mapAdjacencies(const MSFlipSet& flipSet,\n                                 MSFlipSet::const_iterator flipIt)\n{\n  assert(flipSet.empty() == false && flipIt != flipSet.end());\n  MappedSegmentConstPtr mappedQuerySeg = *flipIt;\n  hal_index_t maxIndex;\n  hal_index_t minIndex;\n  SegmentIteratorConstPtr queryIt = makeIterator(mappedQuerySeg, \n                                                 minIndex,\n                                                 maxIndex);\n  MSSet backResults;\n  MSFlipSet::const_iterator flipNext = flipIt;\n  if (queryIt->getReversed())\n  {\n    flipNext = flipNext == flipSet.begin() ? flipSet.end() : --flipNext;\n  }\n  else\n  {\n    ++flipNext;\n  }\n  hal_size_t iter = 0;\n  queryIt->toRight();\n  while (queryIt->getArrayIndex() >= minIndex &&\n         queryIt->getArrayIndex() < maxIndex && iter < _maxAdjScan)\n  {\n    if (flipNext != flipSet.end())\n    {\n      \/\/ if cut returns nothing, then the region in question is covered\n      \/\/ by flipNext (ie already mapped).\n      cutByNext(queryIt, *flipNext, !queryIt->getReversed());\n    }\n    if (queryIt.get() == NULL)\n    {\n      break;\n    }\n    size_t backSize = backResults.size();\n    assert(queryIt->getArrayIndex() >= 0);\n    queryIt->getMappedSegments(backResults, _refGenome, &_spanningTree,\n                               _doDupes, _minLength);\n    \/\/ something was found, that's good enough.\n    if (backResults.size() > backSize)\n    {\n      break;\n    }\n    queryIt->toRight();\n    ++iter;\n  }\n\n  queryIt = makeIterator(mappedQuerySeg, \n                         minIndex,\n                         maxIndex);\n\n  MSFlipSet::const_iterator flipPrev = flipIt;\n  queryIt->getReversed() ? ++flipPrev : --flipPrev;\n  iter = 0;\n  queryIt->toLeft();\n  while (queryIt->getArrayIndex() >= minIndex &&\n         queryIt->getArrayIndex() < maxIndex && iter < _maxAdjScan)\n  {\n    if (flipNext != flipSet.end())\n    {\n      \/\/ if cut returns nothing, then the region in question is covered\n      \/\/ by flipNext (ie already mapped).\n      cutByNext(queryIt, *flipNext, queryIt->getReversed());\n    }\n    if (queryIt.get() == NULL)\n    {\n      break;\n    }\n    size_t backSize = backResults.size();\n    queryIt->getMappedSegments(backResults, _refGenome, &_spanningTree,\n                               _doDupes, _minLength);\n    \/\/ something was found, that's good enough.\n    if (backResults.size() > backSize)\n    {\n      break;\n    }\n    queryIt->toLeft();\n    ++iter;\n  }\n\n  \/\/ flip the results and copy back to our main set.\n  for (MSSet::iterator i = backResults.begin(); i != backResults.end(); ++i)\n  {\n    MappedSegmentConstPtr mseg = *i;\n    mseg->flip();\n    assert(_segMap.find(mseg) == _segMap.end());\n    _segMap.insert(mseg);\n  }\n}\n\nSegmentIteratorConstPtr BlockMapper::makeIterator(\n  MappedSegmentConstPtr mappedSegment, hal_index_t& minIndex,\n  hal_index_t& maxIndex)\n{\n  SegmentIteratorConstPtr segIt;\n  if (mappedSegment->isTop())\n  {\n    segIt = mappedSegment->getGenome()->getTopSegmentIterator(\n      mappedSegment->getArrayIndex());\n    minIndex = segIt->getSequence()->getTopSegmentArrayIndex();\n    maxIndex = minIndex + \n       (hal_index_t)segIt->getSequence()->getNumTopSegments();\n  }\n  else\n  {\n    segIt = mappedSegment->getGenome()->getBottomSegmentIterator(\n      mappedSegment->getArrayIndex());\n    minIndex = segIt->getSequence()->getBottomSegmentArrayIndex();\n    maxIndex = minIndex + \n       (hal_index_t)segIt->getSequence()->getNumBottomSegments();\n  }\n  \n  if (mappedSegment->getReversed())\n  {\n    segIt->toReverse();\n  }\n  segIt->slice(mappedSegment->getStartOffset(), \n               mappedSegment->getEndOffset());\n  \n  assert(segIt->getGenome() == mappedSegment->getGenome());\n  assert(segIt->getArrayIndex() == mappedSegment->getArrayIndex());\n  assert(segIt->getStartOffset() == mappedSegment->getStartOffset());\n  assert(segIt->getEndOffset() == mappedSegment->getEndOffset());\n  assert(segIt->getReversed() == mappedSegment->getReversed());\n\n  return segIt;\n}\n\nvoid BlockMapper::cutByNext(SegmentIteratorConstPtr queryIt, \n                            SlicedSegmentConstPtr nextSeg,\n                            bool right)\n{\n  assert(queryIt->getGenome() == nextSeg->getGenome());\n  assert(queryIt->isTop() == nextSeg->isTop());\n\n  if (queryIt->getArrayIndex() == nextSeg->getArrayIndex())\n  {    \n    hal_offset_t so1 = queryIt->getStartOffset();\n    hal_offset_t eo1 = queryIt->getEndOffset();\n    if (queryIt->getReversed())\n    {\n      swap(so1, eo1);\n    }\n    hal_offset_t so2 = nextSeg->getReversed() ? nextSeg->getEndOffset() :\n       nextSeg->getStartOffset();\n\n    if (right)\n    {\n      assert(max(nextSeg->getStartPosition(), nextSeg->getEndPosition()) >=\n             max(queryIt->getStartPosition(), queryIt->getEndPosition()));\n\n      \/\/ overlap on start position.  we zap\n      if (so1 >= so2)\n      {\n        queryIt = SegmentIteratorConstPtr();\n      }\n      else\n      {\n        assert(max(nextSeg->getStartPosition(), nextSeg->getEndPosition()) >\n               max(queryIt->getStartPosition(), queryIt->getEndPosition()));\n\n        hal_index_t e1 = max(queryIt->getEndPosition(), \n                             queryIt->getStartPosition());\n        hal_index_t s2 = min(nextSeg->getEndPosition(), \n                             nextSeg->getStartPosition());\n        \/\/ end position of queryIt overlaps next seg.  so we cut it.\n        if (e1 >= s2)\n        {\n          hal_index_t delta = 1 + e1 - s2;\n          assert(delta < (hal_index_t)queryIt->getLength());\n          hal_offset_t newEndOffset = eo1 + delta;\n          hal_offset_t newStartOffset = so1;\n          if (queryIt->getReversed() == true)\n          {\n            swap(newEndOffset, newStartOffset);\n          }\n          queryIt->slice(newStartOffset, newEndOffset);\n        }\n      }\n      assert(!queryIt.get() ||\n             max(queryIt->getStartPosition(), queryIt->getEndPosition()) <\n             min(nextSeg->getStartPosition(), nextSeg->getEndPosition()));\n    }\n    else\n    {\n      assert(min(nextSeg->getStartPosition(), nextSeg->getEndPosition()) <=\n             min(queryIt->getStartPosition(), queryIt->getEndPosition()));\n\n      hal_index_t s1 = min(queryIt->getEndPosition(), \n                           queryIt->getStartPosition());\n      hal_index_t e1 = max(queryIt->getEndPosition(), \n                           queryIt->getStartPosition());\n      hal_index_t e2 = max(nextSeg->getEndPosition(), \n                           nextSeg->getStartPosition());\n\n      \/\/ overlap on end position.  we zap\n      if (e1 <= e2)\n      {\n        queryIt = SegmentIteratorConstPtr();\n      }\n      else\n      {\n        assert(min(nextSeg->getStartPosition(), nextSeg->getEndPosition()) <\n               min(queryIt->getStartPosition(), queryIt->getEndPosition()));\n\n        \/\/ end position of queryIt overlaps next seg.  so we cut it.\n        if (s1 <= e2)\n        {\n          hal_index_t delta = 1 + e2 - s1;\n          assert(delta < (hal_index_t)queryIt->getLength());\n          hal_offset_t newStartOffset = so1 + delta;\n          hal_offset_t newEndOffset = eo1;\n          if (queryIt->getReversed() == true)\n          {\n            swap(newEndOffset, newStartOffset);\n          }\n          queryIt->slice(newStartOffset, newEndOffset);\n        }\n      }\n      assert(!queryIt.get() ||\n             min(queryIt->getStartPosition(), queryIt->getEndPosition()) >\n             max(nextSeg->getStartPosition(), nextSeg->getEndPosition()));\n    }\n  }\n}\n<commit_msg>flip back-mapped adjacent reference segments to forward strand.  filter out back-mapped segements that map outside of reference chromosome<commit_after>\/*\n * Copyright (C) 2013 by Glenn Hickey (hickey@soe.ucsc.edu)\n *\n * Released under the MIT license, see LICENSE.txt\n *\/\n\n#include <iostream>\n#include <string>\n#include <set>\n#include <vector>\n#include <map>\n#include \"hal.h\"\n#include \"halBlockMapper.h\"\n\nusing namespace hal;\nusing namespace std;\n\nhal_size_t BlockMapper::_maxAdjScan = 5;\n\nBlockMapper::BlockMapper()\n{\n\n}\n\nBlockMapper::~BlockMapper()\n{\n  erase();\n}\n\nvoid BlockMapper::erase()\n{\n  _segMap.clear();\n  _spanningTree.clear();\n}\n\nvoid BlockMapper::init(const Genome* refGenome, const Genome* queryGenome,\n                       hal_index_t absRefFirst, hal_index_t absRefLast,\n                       bool doDupes, hal_size_t minLength,\n                       bool mapTargetAdjacencies)\n{\n  erase();\n  _absRefFirst = absRefFirst;\n  _absRefLast = absRefLast;\n  _doDupes = doDupes;\n  _minLength = minLength;\n  _mapAdj = mapTargetAdjacencies;\n  _refGenome = refGenome;\n  _refSequence = refGenome->getSequenceBySite(_absRefFirst);\n  assert(_refSequence == refGenome->getSequenceBySite(_absRefLast));\n  _queryGenome = queryGenome;\n\n  set<const Genome*> inputSet;\n  inputSet.insert(_refGenome);\n  inputSet.insert(_queryGenome);\n  getGenomesInSpanningTree(inputSet, _spanningTree);\n}\n\nvoid BlockMapper::map()\n{\n  SegmentIteratorConstPtr refSeg;\n  hal_index_t lastIndex;\n  if (_refGenome->getNumBottomSegments() > 0)\n  {\n    refSeg = _refGenome->getBottomSegmentIterator();\n    lastIndex = _refGenome->getNumBottomSegments();\n  }\n  else\n  {\n    refSeg = _refGenome->getTopSegmentIterator();\n    lastIndex = _refGenome->getNumTopSegments();\n  }\n\n  refSeg->toSite(_absRefFirst, false);\n  hal_offset_t startOffset = _absRefFirst - refSeg->getStartPosition();\n  hal_offset_t endOffset = 0;\n  if (_absRefLast <= refSeg->getEndPosition())\n  {\n    endOffset = refSeg->getEndPosition() - _absRefLast;\n  }\n  refSeg->slice(startOffset, endOffset);\n  \n  assert(refSeg->getStartPosition() ==  _absRefFirst);\n  assert(refSeg->getEndPosition() <= _absRefLast);\n\n  while (refSeg->getArrayIndex() < lastIndex &&\n         refSeg->getStartPosition() <= _absRefLast)  \n  {\n    refSeg->getMappedSegments(_segMap, _queryGenome, &_spanningTree,\n                              _doDupes, _minLength);\n    refSeg->toRight(_absRefLast);\n  }\n\n  if (_mapAdj)\n  {\n    \/\/ construct a set sorted on query instead of ref. \n    MSFlipSet flipSet(_segMap.begin(), _segMap.end());\n\n    MSFlipSet::const_iterator i;\n    for (i = flipSet.begin(); i != flipSet.end(); ++i)\n    {\n      mapAdjacencies(flipSet, i);\n    }\n  }\n}\n  \nvoid BlockMapper::mapAdjacencies(const MSFlipSet& flipSet,\n                                 MSFlipSet::const_iterator flipIt)\n{\n  assert(flipSet.empty() == false && flipIt != flipSet.end());\n  MappedSegmentConstPtr mappedQuerySeg = *flipIt;\n  hal_index_t maxIndex;\n  hal_index_t minIndex;\n  SegmentIteratorConstPtr queryIt = makeIterator(mappedQuerySeg, \n                                                 minIndex,\n                                                 maxIndex);\n  MSSet backResults;\n  MSFlipSet::const_iterator flipNext = flipIt;\n  if (queryIt->getReversed())\n  {\n    flipNext = flipNext == flipSet.begin() ? flipSet.end() : --flipNext;\n  }\n  else\n  {\n    ++flipNext;\n  }\n  hal_size_t iter = 0;\n  queryIt->toRight();\n  while (queryIt->getArrayIndex() >= minIndex &&\n         queryIt->getArrayIndex() < maxIndex && iter < _maxAdjScan)\n  {\n    if (flipNext != flipSet.end())\n    {\n      \/\/ if cut returns nothing, then the region in question is covered\n      \/\/ by flipNext (ie already mapped).\n      cutByNext(queryIt, *flipNext, !queryIt->getReversed());\n    }\n    if (queryIt.get() == NULL)\n    {\n      break;\n    }\n    size_t backSize = backResults.size();\n    assert(queryIt->getArrayIndex() >= 0);\n    queryIt->getMappedSegments(backResults, _refGenome, &_spanningTree,\n                               _doDupes, _minLength);\n    \/\/ something was found, that's good enough.\n    if (backResults.size() > backSize)\n    {\n      break;\n    }\n    queryIt->toRight();\n    ++iter;\n  }\n\n  queryIt = makeIterator(mappedQuerySeg, \n                         minIndex,\n                         maxIndex);\n\n  MSFlipSet::const_iterator flipPrev = flipIt;\n  queryIt->getReversed() ? ++flipPrev : --flipPrev;\n  iter = 0;\n  queryIt->toLeft();\n  while (queryIt->getArrayIndex() >= minIndex &&\n         queryIt->getArrayIndex() < maxIndex && iter < _maxAdjScan)\n  {\n    if (flipNext != flipSet.end())\n    {\n      \/\/ if cut returns nothing, then the region in question is covered\n      \/\/ by flipNext (ie already mapped).\n      cutByNext(queryIt, *flipNext, queryIt->getReversed());\n    }\n    if (queryIt.get() == NULL)\n    {\n      break;\n    }\n    size_t backSize = backResults.size();\n    queryIt->getMappedSegments(backResults, _refGenome, &_spanningTree,\n                               _doDupes, _minLength);\n    \/\/ something was found, that's good enough.\n    if (backResults.size() > backSize)\n    {\n      break;\n    }\n    queryIt->toLeft();\n    ++iter;\n  }\n\n  \/\/ flip the results and copy back to our main set.\n  for (MSSet::iterator i = backResults.begin(); i != backResults.end(); ++i)\n  {\n    MappedSegmentConstPtr mseg = *i;\n    if (mseg->getSequence() == _refSequence)\n    {\n      mseg->flip();\n      SlicedSegmentConstPtr refSeg = mseg->getSource();\n      if (refSeg->getReversed())\n      {\n        refSeg->slice(refSeg->getEndOffset(), refSeg->getEndOffset());\n        refSeg->toReverse();\n        mseg->slice(mseg->getEndOffset(), mseg->getEndOffset());\n        mseg->toReverse();\n      }\n      assert(_segMap.find(mseg) == _segMap.end());\n      _segMap.insert(mseg);\n    }\n  }\n}\n\nSegmentIteratorConstPtr BlockMapper::makeIterator(\n  MappedSegmentConstPtr mappedSegment, hal_index_t& minIndex,\n  hal_index_t& maxIndex)\n{\n  SegmentIteratorConstPtr segIt;\n  if (mappedSegment->isTop())\n  {\n    segIt = mappedSegment->getGenome()->getTopSegmentIterator(\n      mappedSegment->getArrayIndex());\n    minIndex = segIt->getSequence()->getTopSegmentArrayIndex();\n    maxIndex = minIndex + \n       (hal_index_t)segIt->getSequence()->getNumTopSegments();\n  }\n  else\n  {\n    segIt = mappedSegment->getGenome()->getBottomSegmentIterator(\n      mappedSegment->getArrayIndex());\n    minIndex = segIt->getSequence()->getBottomSegmentArrayIndex();\n    maxIndex = minIndex + \n       (hal_index_t)segIt->getSequence()->getNumBottomSegments();\n  }\n  \n  if (mappedSegment->getReversed())\n  {\n    segIt->toReverse();\n  }\n  segIt->slice(mappedSegment->getStartOffset(), \n               mappedSegment->getEndOffset());\n  \n  assert(segIt->getGenome() == mappedSegment->getGenome());\n  assert(segIt->getArrayIndex() == mappedSegment->getArrayIndex());\n  assert(segIt->getStartOffset() == mappedSegment->getStartOffset());\n  assert(segIt->getEndOffset() == mappedSegment->getEndOffset());\n  assert(segIt->getReversed() == mappedSegment->getReversed());\n\n  return segIt;\n}\n\nvoid BlockMapper::cutByNext(SegmentIteratorConstPtr queryIt, \n                            SlicedSegmentConstPtr nextSeg,\n                            bool right)\n{\n  assert(queryIt->getGenome() == nextSeg->getGenome());\n  assert(queryIt->isTop() == nextSeg->isTop());\n\n  if (queryIt->getArrayIndex() == nextSeg->getArrayIndex())\n  {    \n    hal_offset_t so1 = queryIt->getStartOffset();\n    hal_offset_t eo1 = queryIt->getEndOffset();\n    if (queryIt->getReversed())\n    {\n      swap(so1, eo1);\n    }\n    hal_offset_t so2 = nextSeg->getReversed() ? nextSeg->getEndOffset() :\n       nextSeg->getStartOffset();\n\n    if (right)\n    {\n      assert(max(nextSeg->getStartPosition(), nextSeg->getEndPosition()) >=\n             max(queryIt->getStartPosition(), queryIt->getEndPosition()));\n\n      \/\/ overlap on start position.  we zap\n      if (so1 >= so2)\n      {\n        queryIt = SegmentIteratorConstPtr();\n      }\n      else\n      {\n        assert(max(nextSeg->getStartPosition(), nextSeg->getEndPosition()) >\n               max(queryIt->getStartPosition(), queryIt->getEndPosition()));\n\n        hal_index_t e1 = max(queryIt->getEndPosition(), \n                             queryIt->getStartPosition());\n        hal_index_t s2 = min(nextSeg->getEndPosition(), \n                             nextSeg->getStartPosition());\n        \/\/ end position of queryIt overlaps next seg.  so we cut it.\n        if (e1 >= s2)\n        {\n          hal_index_t delta = 1 + e1 - s2;\n          assert(delta < (hal_index_t)queryIt->getLength());\n          hal_offset_t newEndOffset = eo1 + delta;\n          hal_offset_t newStartOffset = so1;\n          if (queryIt->getReversed() == true)\n          {\n            swap(newEndOffset, newStartOffset);\n          }\n          queryIt->slice(newStartOffset, newEndOffset);\n        }\n      }\n      assert(!queryIt.get() ||\n             max(queryIt->getStartPosition(), queryIt->getEndPosition()) <\n             min(nextSeg->getStartPosition(), nextSeg->getEndPosition()));\n    }\n    else\n    {\n      assert(min(nextSeg->getStartPosition(), nextSeg->getEndPosition()) <=\n             min(queryIt->getStartPosition(), queryIt->getEndPosition()));\n\n      hal_index_t s1 = min(queryIt->getEndPosition(), \n                           queryIt->getStartPosition());\n      hal_index_t e1 = max(queryIt->getEndPosition(), \n                           queryIt->getStartPosition());\n      hal_index_t e2 = max(nextSeg->getEndPosition(), \n                           nextSeg->getStartPosition());\n\n      \/\/ overlap on end position.  we zap\n      if (e1 <= e2)\n      {\n        queryIt = SegmentIteratorConstPtr();\n      }\n      else\n      {\n        assert(min(nextSeg->getStartPosition(), nextSeg->getEndPosition()) <\n               min(queryIt->getStartPosition(), queryIt->getEndPosition()));\n\n        \/\/ end position of queryIt overlaps next seg.  so we cut it.\n        if (s1 <= e2)\n        {\n          hal_index_t delta = 1 + e2 - s1;\n          assert(delta < (hal_index_t)queryIt->getLength());\n          hal_offset_t newStartOffset = so1 + delta;\n          hal_offset_t newEndOffset = eo1;\n          if (queryIt->getReversed() == true)\n          {\n            swap(newEndOffset, newStartOffset);\n          }\n          queryIt->slice(newStartOffset, newEndOffset);\n        }\n      }\n      assert(!queryIt.get() ||\n             min(queryIt->getStartPosition(), queryIt->getEndPosition()) >\n             max(nextSeg->getStartPosition(), nextSeg->getEndPosition()));\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <windows.h>\n#include <winuser.h>\n#include <process.h>\n\n#include <myo\/myo.hpp>\n\n#include \"..\/module_headers\/module.h\"\n#include \"..\/module_headers\/control_module.h\"\n#include \"..\/rcml_compiler\/globals.h\"\n\n#include \"myo_data_collector.h\"\n#include \"myo_control_module.h\"\n\nconst unsigned int COUNT_AXIS = 6;\n\n#define DEFINE_ALL_AXIS \\\n\tADD_AXIS(\"fist\", 1, 0)\\\n\tADD_AXIS(\"left_or_right\", 1, -1)\\\n\tADD_AXIS(\"fingers_spread\", 1, 0)\\\n\tADD_AXIS(\"double_tap\", 1, 0)\\\n\tADD_AXIS(\"locked\", 1, 0)\\\n\tADD_AXIS(\"arm_pitch_angle\", 18, 0)\n\nbool myo_working = false;\nCRITICAL_SECTION myo_working_mutex;\n\nunsigned int WINAPI waitTerminateSignal(void *arg) {\n\tHANDLE hStdin = GetStdHandle(STD_INPUT_HANDLE);\n\tif (hStdin == INVALID_HANDLE_VALUE) {\n\t\tgoto exit; \/\/error\n\t}\n\n\tDWORD fdwSaveOldMode;\n\tif (!GetConsoleMode(hStdin, &fdwSaveOldMode)) {\n\t\tgoto exit; \/\/error\n\t}\n\tDWORD fdwMode = ENABLE_WINDOW_INPUT | ENABLE_MOUSE_INPUT;\n\tif (!SetConsoleMode(hStdin, fdwMode)) {\n\t\tgoto exit; \/\/error\n\t}\n\n\tINPUT_RECORD irInBuf[128];\n\tDWORD cNumRead;\n\tDWORD i;\n\n\twhile (1) {\n\t\tif (!ReadConsoleInput(hStdin, irInBuf, 128, &cNumRead))  {\n\t\t\tgoto exit; \/\/error\n\t\t}\n\n\t\tfor (i = 0; i < cNumRead; ++i) {\n\t\t\tif (irInBuf[i].EventType == KEY_EVENT) {\n\t\t\t\tWORD key_code = irInBuf[i].Event.KeyEvent.wVirtualKeyCode;\n\t\t\t\tif (key_code == VK_ESCAPE) {\n\t\t\t\t\tgoto exit; \/\/exit\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\texit:\n\t\n\tEnterCriticalSection(&myo_working_mutex);\n\tmyo_working = false;\n\tLeaveCriticalSection(&myo_working_mutex);\n\t\n\tSetConsoleMode(hStdin, fdwSaveOldMode);\n\treturn 0;\n}\n\nvoid MyoControlModule::execute(sendAxisState_t sendAxisState) {\n\tmyo->vibrate(myo::Myo::VibrationType::vibrationShort);\n\tmyo_data_collector->start(sendAxisState);\n\n\tmyo_working = true;\n\tInitializeCriticalSection(&myo_working_mutex);\n\n\tunsigned int tid;\n\tHANDLE thread_handle = (HANDLE) _beginthreadex(NULL, 0, waitTerminateSignal, NULL, 0, &tid);\n\n\tEnterCriticalSection(&myo_working_mutex);\n\twhile (myo_working) {\n\t\tLeaveCriticalSection(&myo_working_mutex);\n\n        hub->run(1000\/20);\n        myo_data_collector->print();\n\t\t\n\t\tEnterCriticalSection(&myo_working_mutex);\n    }\n\tLeaveCriticalSection(&myo_working_mutex);\n\n\tWaitForSingleObject(thread_handle, INFINITE);\n\tCloseHandle(thread_handle);\n\tDeleteCriticalSection(&myo_working_mutex);\n\n\tmyo_data_collector->finish();\n\tmyo->vibrate(myo::Myo::VibrationType::vibrationShort);\n}\n\nMyoControlModule::MyoControlModule() {\n\trobot_axis = new AxisData*[COUNT_AXIS];\n\tsystem_value axis_id = 0;\n\tDEFINE_ALL_AXIS\n}\n\nint MyoControlModule::init() {\n\t try {\n\t\thub = new myo::Hub(\"com.example.myo_control_module\");\n\t\t\n\t\tcolorPrintf(ConsoleColor(), \"Attempting to find a Myo...\\n\");\n\n\t\tmyo = hub->waitForMyo(10000);\n\t\tif (!myo) {\n\t\t\tthrow std::runtime_error(\"Unable to find a Myo!\");\n\t\t}\n\t\tcolorPrintf(ConsoleColor(ConsoleColor::green), \"Connected to a Myo armband!\\n\");\n\n\t\tmyo_data_collector = new DataCollector();\n\t\thub->addListener(myo_data_collector);\n\n    } catch (const std::exception& e) {\n        colorPrintf(ConsoleColor(ConsoleColor::red), \"Error: %s\\n\", e.what());\n        return 1;\n    }\n\treturn 0;\n}\n\nconst char *MyoControlModule::getUID() {\n\treturn \"Myo control module v0.99b by m79lol\";\n}\n\nvoid MyoControlModule::prepare(colorPrintf_t *colorPrintf_p, colorPrintfVA_t *colorPrintfVA_p) {\n\tthis->colorPrintf_p = colorPrintfVA_p;\n}\n\nvoid MyoControlModule::colorPrintf(ConsoleColor colors, const char *mask, ...) {\n\tva_list args;\n    va_start(args, mask);\n    (*colorPrintf_p)(this, colors, mask, args);\n    va_end(args);\n}\n\nvoid MyoControlModule::final() {\n\thub->removeListener(myo_data_collector);\n\tdelete myo_data_collector;\n\tdelete hub;\n}\n\nAxisData** MyoControlModule::getAxis(unsigned int *count_axis) {\n\t(*count_axis) = COUNT_AXIS;\n\treturn robot_axis;\n}\n\nvoid MyoControlModule::destroy() {\n\tfor (unsigned int j = 0; j < COUNT_AXIS; ++j) {\n\t\tdelete robot_axis[j];\n\t}\n\tdelete[] robot_axis;\n\tdelete this;\n}\n\nvoid *MyoControlModule::writePC(unsigned int *buffer_length) {\n\t*buffer_length = 0;\n\treturn NULL;\n}\n\nint MyoControlModule::startProgram(int uniq_index, void *buffer, unsigned int buffer_length) {\n\treturn 0;\n}\nint MyoControlModule::endProgram(int uniq_index) {\n\treturn 0;\n}\n\n__declspec(dllexport) ControlModule* getControlModuleObject() {\n\treturn new MyoControlModule();\n}<commit_msg>Fixed bug with key \"escape\".<commit_after>#include <stdio.h>\n#include <windows.h>\n#include <winuser.h>\n#include <process.h>\n\n#include <myo\/myo.hpp>\n\n#include \"..\/module_headers\/module.h\"\n#include \"..\/module_headers\/control_module.h\"\n#include \"..\/rcml_compiler\/globals.h\"\n\n#include \"myo_data_collector.h\"\n#include \"myo_control_module.h\"\n\nconst unsigned int COUNT_AXIS = 6;\n\n#define DEFINE_ALL_AXIS \\\n\tADD_AXIS(\"fist\", 1, 0)\\\n\tADD_AXIS(\"left_or_right\", 1, -1)\\\n\tADD_AXIS(\"fingers_spread\", 1, 0)\\\n\tADD_AXIS(\"double_tap\", 1, 0)\\\n\tADD_AXIS(\"locked\", 1, 0)\\\n\tADD_AXIS(\"arm_pitch_angle\", 18, 0)\n\nbool myo_working = false;\nCRITICAL_SECTION myo_working_mutex;\n\nunsigned int WINAPI waitTerminateSignal(void *arg) {\n\tHANDLE hStdin = GetStdHandle(STD_INPUT_HANDLE);\n\tif (hStdin == INVALID_HANDLE_VALUE) {\n\t\tgoto exit; \/\/error\n\t}\n\n\tDWORD fdwSaveOldMode;\n\tif (!GetConsoleMode(hStdin, &fdwSaveOldMode)) {\n\t\tgoto exit; \/\/error\n\t}\n\tDWORD fdwMode = ENABLE_WINDOW_INPUT | ENABLE_MOUSE_INPUT;\n\tif (!SetConsoleMode(hStdin, fdwMode)) {\n\t\tgoto exit; \/\/error\n\t}\n\n\tINPUT_RECORD irInBuf[128];\n\tDWORD cNumRead;\n\tDWORD i;\n\n\twhile (1) {\n\t\tif (!ReadConsoleInput(hStdin, irInBuf, 128, &cNumRead))  {\n\t\t\tgoto exit; \/\/error\n\t\t}\n\n\t\tfor (i = 0; i < cNumRead; ++i) {\n\t\t\tif (irInBuf[i].EventType == KEY_EVENT) {\n\t\t\t\tWORD key_code = irInBuf[i].Event.KeyEvent.wVirtualKeyCode;\n\t\t\t\tif ((key_code == VK_ESCAPE) && (irInBuf[i].Event.KeyEvent.bKeyDown)) {\n\t\t\t\t\tgoto exit; \/\/exit\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\texit:\n\t\n\tEnterCriticalSection(&myo_working_mutex);\n\tmyo_working = false;\n\tLeaveCriticalSection(&myo_working_mutex);\n\t\n\tSetConsoleMode(hStdin, fdwSaveOldMode);\n\treturn 0;\n}\n\nvoid MyoControlModule::execute(sendAxisState_t sendAxisState) {\n\tmyo->vibrate(myo::Myo::VibrationType::vibrationShort);\n\tmyo_data_collector->start(sendAxisState);\n\n\tmyo_working = true;\n\tInitializeCriticalSection(&myo_working_mutex);\n\n\tunsigned int tid;\n\tHANDLE thread_handle = (HANDLE) _beginthreadex(NULL, 0, waitTerminateSignal, NULL, 0, &tid);\n\n\tEnterCriticalSection(&myo_working_mutex);\n\twhile (myo_working) {\n\t\tLeaveCriticalSection(&myo_working_mutex);\n\n        hub->run(1000\/20);\n        myo_data_collector->print();\n\t\t\n\t\tEnterCriticalSection(&myo_working_mutex);\n    }\n\tLeaveCriticalSection(&myo_working_mutex);\n\n\tWaitForSingleObject(thread_handle, INFINITE);\n\tCloseHandle(thread_handle);\n\tDeleteCriticalSection(&myo_working_mutex);\n\n\tmyo_data_collector->finish();\n\tmyo->vibrate(myo::Myo::VibrationType::vibrationShort);\n}\n\nMyoControlModule::MyoControlModule() {\n\trobot_axis = new AxisData*[COUNT_AXIS];\n\tsystem_value axis_id = 0;\n\tDEFINE_ALL_AXIS\n}\n\nint MyoControlModule::init() {\n\t try {\n\t\thub = new myo::Hub(\"com.example.myo_control_module\");\n\t\t\n\t\tcolorPrintf(ConsoleColor(), \"Attempting to find a Myo...\\n\");\n\n\t\tmyo = hub->waitForMyo(10000);\n\t\tif (!myo) {\n\t\t\tthrow std::runtime_error(\"Unable to find a Myo!\");\n\t\t}\n\t\tcolorPrintf(ConsoleColor(ConsoleColor::green), \"Connected to a Myo armband!\\n\");\n\n\t\tmyo_data_collector = new DataCollector();\n\t\thub->addListener(myo_data_collector);\n\n    } catch (const std::exception& e) {\n        colorPrintf(ConsoleColor(ConsoleColor::red), \"Error: %s\\n\", e.what());\n        return 1;\n    }\n\treturn 0;\n}\n\nconst char *MyoControlModule::getUID() {\n\treturn \"Myo control module v0.99b by m79lol\";\n}\n\nvoid MyoControlModule::prepare(colorPrintf_t *colorPrintf_p, colorPrintfVA_t *colorPrintfVA_p) {\n\tthis->colorPrintf_p = colorPrintfVA_p;\n}\n\nvoid MyoControlModule::colorPrintf(ConsoleColor colors, const char *mask, ...) {\n\tva_list args;\n    va_start(args, mask);\n    (*colorPrintf_p)(this, colors, mask, args);\n    va_end(args);\n}\n\nvoid MyoControlModule::final() {\n\thub->removeListener(myo_data_collector);\n\tdelete myo_data_collector;\n\tdelete hub;\n}\n\nAxisData** MyoControlModule::getAxis(unsigned int *count_axis) {\n\t(*count_axis) = COUNT_AXIS;\n\treturn robot_axis;\n}\n\nvoid MyoControlModule::destroy() {\n\tfor (unsigned int j = 0; j < COUNT_AXIS; ++j) {\n\t\tdelete robot_axis[j];\n\t}\n\tdelete[] robot_axis;\n\tdelete this;\n}\n\nvoid *MyoControlModule::writePC(unsigned int *buffer_length) {\n\t*buffer_length = 0;\n\treturn NULL;\n}\n\nint MyoControlModule::startProgram(int uniq_index, void *buffer, unsigned int buffer_length) {\n\treturn 0;\n}\nint MyoControlModule::endProgram(int uniq_index) {\n\treturn 0;\n}\n\n__declspec(dllexport) ControlModule* getControlModuleObject() {\n\treturn new MyoControlModule();\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 * Modified by Cloudius Systems.\n * Copyright 2015 Cloudius Systems.\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 \"core\/sstring.hh\"\n#include \"query-request.hh\"\n#include \"dht\/i_partitioner.hh\"\n#include <vector>\n\nnamespace streaming {\n\nclass stream_request {\npublic:\n    using token = dht::token;\n    sstring keyspace;\n    std::vector<query::range<token>> ranges;\n    std::vector<sstring> column_families;\n    long repaired_at;\n    stream_request() = default;\n    stream_request(sstring _keyspace, std::vector<query::range<token>> _ranges, std::vector<sstring> _column_families)\n        : keyspace(std::move(_keyspace))\n        , ranges(std::move(_ranges))\n        , column_families(std::move(_column_families)) {\n    }\n    friend std::ostream& operator<<(std::ostream& os, const stream_request& r);\npublic:\n    void serialize(bytes::iterator& out) const;\n    static stream_request deserialize(bytes_view& v);\n    size_t serialized_size() const;\n};\n\n} \/\/ namespace streaming\n<commit_msg>streaming: Drop unused repaired_at in stream_request<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 * Modified by Cloudius Systems.\n * Copyright 2015 Cloudius Systems.\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 \"core\/sstring.hh\"\n#include \"query-request.hh\"\n#include \"dht\/i_partitioner.hh\"\n#include <vector>\n\nnamespace streaming {\n\nclass stream_request {\npublic:\n    using token = dht::token;\n    sstring keyspace;\n    std::vector<query::range<token>> ranges;\n    std::vector<sstring> column_families;\n    stream_request() = default;\n    stream_request(sstring _keyspace, std::vector<query::range<token>> _ranges, std::vector<sstring> _column_families)\n        : keyspace(std::move(_keyspace))\n        , ranges(std::move(_ranges))\n        , column_families(std::move(_column_families)) {\n    }\n    friend std::ostream& operator<<(std::ostream& os, const stream_request& r);\npublic:\n    void serialize(bytes::iterator& out) const;\n    static stream_request deserialize(bytes_view& v);\n    size_t serialized_size() const;\n};\n\n} \/\/ namespace streaming\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>linux: fix warning message that was bugging me<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Build fix to pick up changes in gpu_messages_internal.h for mac.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#75757: remove inheritance to std::vector<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: fmdpage.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: hr $ $Date: 2004-04-13 10:57: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#pragma hdrstop\n\n#ifndef _SVX_FMPAGE_HXX\n#include \"fmpage.hxx\"\n#endif\n\n#ifndef _SVX_FMOBJ_HXX\n#include \"fmobj.hxx\"\n#endif\n\n#ifndef _SVX_FMGLOB_HXX\n#include \"fmglob.hxx\"\n#endif\n\n#ifndef _SVX_FMDPAGE_HXX\n#include \"fmdpage.hxx\"\n#endif\n\n#ifndef _SVX_UNOSHAPE_HXX \/\/autogen\n#include \"unoshape.hxx\"\n#endif\n#ifndef _CPPUHELPER_QUERYINTERFACE_HXX_\n#include <cppuhelper\/queryinterface.hxx>\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n\nDBG_NAME(SvxFmDrawPage);\nSvxFmDrawPage::SvxFmDrawPage( SdrPage* pInPage ) :\n    SvxDrawPage( pInPage )\n{\n    DBG_CTOR(SvxFmDrawPage,NULL);\n}\n\nSvxFmDrawPage::~SvxFmDrawPage() throw ()\n{\n    DBG_DTOR(SvxFmDrawPage,NULL);\n}\n\n::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL SvxFmDrawPage::getImplementationId() throw(::com::sun::star::uno::RuntimeException)\n{\n    static ::cppu::OImplementationId* pId = 0;\n    if (! pId)\n    {\n        ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n        if (! pId)\n        {\n            static ::cppu::OImplementationId aId;\n            pId = &aId;\n        }\n    }\n    return pId->getImplementationId();\n}\n\n::com::sun::star::uno::Any SAL_CALL SvxFmDrawPage::queryAggregation( const ::com::sun::star::uno::Type& aType ) throw(::com::sun::star::uno::RuntimeException)\n{\n    ::com::sun::star::uno::Any aRet = ::cppu::queryInterface(aType,\n        static_cast< ::com::sun::star::form::XFormsSupplier*>(this));\n    if(aRet.hasValue())\n        return aRet;\n\n    return SvxDrawPage::queryAggregation(aType);\n}\n\n\/***********************************************************************\n*                                                                      *\n***********************************************************************\/\n::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL SvxFmDrawPage::getTypes(  ) throw(::com::sun::star::uno::RuntimeException)\n{\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > aTypes(SvxDrawPage::getTypes());\n    aTypes.realloc(aTypes.getLength() + 1);\n    ::com::sun::star::uno::Type* pTypes = aTypes.getArray();\n\n    pTypes[aTypes.getLength()-1] = ::getCppuType((const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormsSupplier>*)0);\n    return aTypes;\n}\n\nSdrObject *SvxFmDrawPage::_CreateSdrObject( const ::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape > & xDescr ) throw ()\n{\n    ::rtl::OUString aShapeType( xDescr->getShapeType() );\n\n    if (aShapeType  ==  ::rtl::OUString::createFromAscii(\"com.sun.star.drawing.ShapeControl\"))\n        return new FmFormObj(OBJ_FM_CONTROL);\n    else\n        return SvxDrawPage::_CreateSdrObject( xDescr );\n\n}\n\n::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape >  SvxFmDrawPage::_CreateShape( SdrObject *pObj ) const throw ()\n{\n    if( FmFormInventor == pObj->GetObjInventor() )\n    {\n        ::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape >  xShape = (SvxShape*)new SvxShapeControl( pObj );\n        return xShape;\n    }\n    else\n        return SvxDrawPage::_CreateShape( pObj );\n}\n\n\/\/ ::com::sun::star::form::XFormsSupplier\n::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer > SAL_CALL SvxFmDrawPage::getForms(void) throw( ::com::sun::star::uno::RuntimeException )\n{\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer >  xForms;\n\n    FmFormPage *pFmPage = PTR_CAST( FmFormPage, GetSdrPage() );\n    if( pFmPage )\n        xForms = pFmPage->GetForms();\n\n    return xForms;\n}\n\n\/\/ ::com::sun::star::lang::XServiceInfo\n::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL SvxFmDrawPage::getSupportedServiceNames(void) throw( ::com::sun::star::uno::RuntimeException )\n{\n    \/* TODO: DG? Irgendwelche Services?\n    ::com::sun::star::uno::Sequence aSeq( SvxDrawPage::getSupportedServiceNames() );\n    addToSequence( aSeq, 1, ::rtl::OUString::createFromAscii(\"stardiv.form.superservice?\") );\n    return aSeq;\n    *\/\n\n    return SvxDrawPage::getSupportedServiceNames();\n}\n\n\n<commit_msg>INTEGRATION: CWS xmlperf02 (1.4.584); FILE MERGED 2005\/03\/17 12:03:15 fs 1.4.584.2: #119224# ::cppu::queryInterface does not care for interface inheritance 2005\/02\/01 14:45:03 fs 1.4.584.1: #119224# XFormsSupplier2: asking (cheaply) for hasForms, without actually obtaining the forms container<commit_after>\/*************************************************************************\n *\n *  $RCSfile: fmdpage.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: kz $ $Date: 2005-03-18 18:42:33 $\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#pragma hdrstop\n\n#ifndef _SVX_FMPAGE_HXX\n#include \"fmpage.hxx\"\n#endif\n\n#ifndef _SVX_FMOBJ_HXX\n#include \"fmobj.hxx\"\n#endif\n\n#ifndef _SVX_FMGLOB_HXX\n#include \"fmglob.hxx\"\n#endif\n\n#ifndef _SVX_FMDPAGE_HXX\n#include \"fmdpage.hxx\"\n#endif\n\n#ifndef _SVX_UNOSHAPE_HXX \/\/autogen\n#include \"unoshape.hxx\"\n#endif\n#ifndef _CPPUHELPER_QUERYINTERFACE_HXX_\n#include <cppuhelper\/queryinterface.hxx>\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n\nusing ::com::sun::star::uno::Any;\nusing ::com::sun::star::uno::RuntimeException;\nusing ::com::sun::star::form::XFormsSupplier2;\n\nDBG_NAME(SvxFmDrawPage);\nSvxFmDrawPage::SvxFmDrawPage( SdrPage* pInPage ) :\n    SvxDrawPage( pInPage )\n{\n    DBG_CTOR(SvxFmDrawPage,NULL);\n}\n\nSvxFmDrawPage::~SvxFmDrawPage() throw ()\n{\n    DBG_DTOR(SvxFmDrawPage,NULL);\n}\n\n::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL SvxFmDrawPage::getImplementationId() throw(::com::sun::star::uno::RuntimeException)\n{\n    static ::cppu::OImplementationId* pId = 0;\n    if (! pId)\n    {\n        ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n        if (! pId)\n        {\n            static ::cppu::OImplementationId aId;\n            pId = &aId;\n        }\n    }\n    return pId->getImplementationId();\n}\n\nAny SAL_CALL SvxFmDrawPage::queryAggregation( const ::com::sun::star::uno::Type& _rType ) throw(RuntimeException)\n{\n    Any aRet = ::cppu::queryInterface   (   _rType\n                                        ,   static_cast< XFormsSupplier2* >( this )\n                                        ,   static_cast< XFormsSupplier* >( this )\n                                        );\n    if ( !aRet.hasValue() )\n        aRet = SvxDrawPage::queryAggregation( _rType );\n\n    return aRet;\n}\n\n\/***********************************************************************\n*                                                                      *\n***********************************************************************\/\n::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL SvxFmDrawPage::getTypes(  ) throw(::com::sun::star::uno::RuntimeException)\n{\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > aTypes(SvxDrawPage::getTypes());\n    aTypes.realloc(aTypes.getLength() + 1);\n    ::com::sun::star::uno::Type* pTypes = aTypes.getArray();\n\n    pTypes[aTypes.getLength()-1] = ::getCppuType((const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormsSupplier>*)0);\n    return aTypes;\n}\n\nSdrObject *SvxFmDrawPage::_CreateSdrObject( const ::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape > & xDescr ) throw ()\n{\n    ::rtl::OUString aShapeType( xDescr->getShapeType() );\n\n    if (aShapeType  ==  ::rtl::OUString::createFromAscii(\"com.sun.star.drawing.ShapeControl\"))\n        return new FmFormObj(OBJ_FM_CONTROL);\n    else\n        return SvxDrawPage::_CreateSdrObject( xDescr );\n\n}\n\n::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape >  SvxFmDrawPage::_CreateShape( SdrObject *pObj ) const throw ()\n{\n    if( FmFormInventor == pObj->GetObjInventor() )\n    {\n        ::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape >  xShape = (SvxShape*)new SvxShapeControl( pObj );\n        return xShape;\n    }\n    else\n        return SvxDrawPage::_CreateShape( pObj );\n}\n\n\/\/ XFormsSupplier\n::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer > SAL_CALL SvxFmDrawPage::getForms(void) throw( ::com::sun::star::uno::RuntimeException )\n{\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer >  xForms;\n\n    FmFormPage *pFmPage = PTR_CAST( FmFormPage, GetSdrPage() );\n    if( pFmPage )\n        xForms = pFmPage->GetForms();\n\n    return xForms;\n}\n\n\/\/ XFormsSupplier2\nsal_Bool SAL_CALL SvxFmDrawPage::hasForms(void) throw( ::com::sun::star::uno::RuntimeException )\n{\n    sal_Bool bHas = sal_False;\n    FmFormPage* pFormPage = PTR_CAST( FmFormPage, GetSdrPage() );\n    if ( pFormPage )\n        bHas = pFormPage->GetForms( false ).is();\n    return bHas;\n}\n\n\/\/ ::com::sun::star::lang::XServiceInfo\n::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL SvxFmDrawPage::getSupportedServiceNames(void) throw( ::com::sun::star::uno::RuntimeException )\n{\n    return SvxDrawPage::getSupportedServiceNames();\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\nkmsc - Kurento Media Server C\/C++ implementation\nCopyright (C) 2012 Tikal Technologies\n\nThis program is free software: you can redistribute it and\/or modify\nit under the terms of the GNU General Public License version 3\nas published by the Free Software Foundation.\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 General Public License\nalong with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <signal.h>\n#include <execinfo.h>\n\n#include \"MediaServerServiceHandler.h\"\n\n#include <protocol\/TBinaryProtocol.h>\n#include <transport\/TServerSocket.h>\n#include <transport\/TBufferTransports.h>\n#include <server\/TNonblockingServer.h>\n#include <concurrency\/PosixThreadFactory.h>\n#include <concurrency\/ThreadManager.h>\n\n#include \"media_config_loader.h\"\n\n#include <glibmm.h>\n#include <fstream>\n\n#include <gst\/gst.h>\n\n#include <version.h>\n\nusing namespace ::apache::thrift;\nusing namespace ::apache::thrift::protocol;\nusing namespace ::apache::thrift::transport;\nusing namespace ::apache::thrift::server;\nusing namespace ::apache::thrift::concurrency;\n\nusing namespace ::kurento;\n\nusing boost::shared_ptr;\nusing ::kurento::MediaServerServiceHandler;\nusing ::Glib::KeyFile;\nusing ::Glib::KeyFileFlags;\n\n\n#define GST_CAT_DEFAULT media_server\nGST_DEBUG_CATEGORY_STATIC (GST_CAT_DEFAULT);\n#define GST_DEFAULT_NAME \"media_server\"\n\n#define DEFAULT_CONFIG_FILE \"\/etc\/kurento\/kurento.conf\"\n\n#define MEDIA_SERVER_ADDRESS \"localhost\"\n#define MEDIA_SERVER_SERVICE_PORT 9090\n\n#define MEDIA_SERVER_ADDRESS_KEY \"serverAddress\"\n#define MEDIA_SERVER_SERVICE_PORT_KEY \"serverPort\"\n\nstatic std::string serverAddress;\nstatic gint serverServicePort;\nstatic std::string sessionSpec;\nstatic KeyFile configFile;\n\nGlib::RefPtr<Glib::MainLoop> loop = Glib::MainLoop::create(true);\nstatic TNonblockingServer *p_server = NULL;\n\nstatic void create_media_server_service() {\n\tint port;\n\n\tport = MEDIA_SERVER_SERVICE_PORT;\n\n\tshared_ptr<MediaServerServiceHandler> handler(\n\t\t\tnew MediaServerServiceHandler());\n\tshared_ptr<TProcessor> processor(new MediaServerServiceProcessor(handler));\n\tshared_ptr<TProtocolFactory> protocolFactory(new TBinaryProtocolFactory());\n\tshared_ptr<PosixThreadFactory> threadFactory(new PosixThreadFactory ());\n\tshared_ptr<ThreadManager> threadManager= ThreadManager::newSimpleThreadManager(15);\n\n\tthreadManager->threadFactory(threadFactory);\n\tthreadManager->start();\n\tTNonblockingServer server(processor, protocolFactory, port, threadManager);\n\tp_server = &server;\n\tGST_INFO(\"Starting MediaServerService\");\n\tserver.serve();\n\n\tGST_INFO(\"MediaServerService stopped finishing thread\");\n\tthrow Glib::Thread::Exit();\n}\n\nstatic void\ncheck_port(int port)\n{\n\tif (port <=0 || port > G_MAXUSHORT)\n\t\tthrow Glib::KeyFileError(Glib::KeyFileError::PARSE,\n\t\t\t\t\t\t\t\"Invalid value\");\n}\n\nstatic void\nset_default_server_config()\n{\n\tserverAddress = MEDIA_SERVER_ADDRESS;\n\tserverServicePort = MEDIA_SERVER_SERVICE_PORT;\n}\n\nstatic void load_config(const std::string &file_name) {\n\tgint port;\n\n\tGST_INFO(\"Reading configuration from: %s\", file_name.c_str());\n\t\/* Try to open de file *\/\n\t{\n\t\tstd::ifstream file(file_name);\n\t\tif (!file) {\n\t\t\tGST_INFO(\"Config file not found, creating a new one\");\n\t\t\tstd::ofstream of(file_name);\n\t\t}\n\t}\n\ttry {\n\t\tif (!configFile.load_from_file(file_name,\n\t\t\t\tKeyFileFlags::KEY_FILE_KEEP_COMMENTS |\n\t\t\t\tKeyFileFlags::KEY_FILE_KEEP_TRANSLATIONS )) {\n\t\t\tGST_WARNING(\"Error loading configuration from %s, loading \"\n\t\t\t\t\t\t\"default server config, but no \"\n\t\t\t\t\t\t\"codecs will be available\", file_name.c_str());\n\t\t\tset_default_server_config();\n\t\t\treturn;\n\t\t}\n\t} catch (Glib::Error ex) {\n\t\tGST_WARNING(\"Error loading configuration: %s\", ex.what().c_str());\n\t\tGST_WARNING(\"Error loading configuration from %s, loading \"\n\t\t\t\t\t\t\"default server config, but no \"\n\t\t\t\t\t\t\"codecs will be available\", file_name.c_str());\n\t\tset_default_server_config();\n\t\treturn;\n\t}\n\n\ttry {\n\t\tserverAddress = configFile.get_string(SERVER_GROUP,\n\t\t\t\t\t\t\tMEDIA_SERVER_ADDRESS_KEY);\n\t} catch (Glib::KeyFileError err) {\n\t\tGST_INFO(err.what().c_str());\n\t\tGST_INFO(\"Setting default address\");\n\t\tconfigFile.set_string(SERVER_GROUP, MEDIA_SERVER_ADDRESS_KEY,\n\t\t\t\t\t\t\t\tMEDIA_SERVER_ADDRESS);\n\t\tserverAddress = MEDIA_SERVER_ADDRESS;\n\t}\n\n\ttry {\n\t\tport = configFile.get_integer(SERVER_GROUP, MEDIA_SERVER_SERVICE_PORT_KEY);\n\t\tcheck_port(port);\n\t\tserverServicePort = port;\n\t} catch (Glib::KeyFileError err) {\n\t\tGST_INFO(err.what().c_str());\n\t\tGST_INFO(\"Setting default server port\");\n\t\tconfigFile.set_integer(SERVER_GROUP, MEDIA_SERVER_SERVICE_PORT_KEY,\n\t\t\t\t\t\t\tMEDIA_SERVER_SERVICE_PORT);\n\t\tserverServicePort = MEDIA_SERVER_SERVICE_PORT;\n\t}\n\n\ttry {\n\t\tload_spec(configFile, sessionSpec);\n\t} catch (Glib::KeyFileError err) {\n\t\tGST_WARNING(err.what().c_str());\n\t\tGST_WARNING(\"Wrong codec configuration, communication won't be possible\");\n\t}\n\n\tstd::ofstream f(file_name, std::ios::out | std::ios::trunc);\n\tf << configFile.to_data();\n\tf.close();\n\n\tGST_INFO(\"Configuration loaded successfully\");\n\tGST_DEBUG(\"Final config file:\\n%s\", configFile.to_data().c_str());\n}\n\nstatic void\ninitialiseExecutableName(char *exe, int size) {\n\tchar link[1024];\n\tint len;\n\n\tsnprintf(link, sizeof(link), \"\/proc\/%d\/exe\", getpid());\n\tlen = readlink(link, exe, size);\n\n\tif(len ==-1) {\n\t\tfprintf(stderr,\"ERROR GETTING NAME\\n\");\n\t\texit(1);\n\t}\n\n\texe[len] = '\\0';\n}\n\nstatic const char*\ngetExecutableName() {\n\tstatic char* exe = NULL;\n\tstatic char aux[1024];\n\n\tif (exe == NULL) {\n\t\tinitialiseExecutableName(aux, sizeof(aux));\n\t\texe = aux;\n\t}\n\n\treturn exe;\n}\n\nstatic void\nbt_sighandler(int sig, siginfo_t *info, gpointer data) {\n\n\tvoid *trace[35];\n\tchar **messages = (char **)NULL;\n\tint i, trace_size = 0;\n\/\/ \tucontext_t *uc = (ucontext_t *)data;\n\n\t\/* Do something useful with siginfo_t *\/\n\tif (sig == SIGSEGV) {\n\t\tprintf(\"Got signal %d, faulty address is %p\\n\", sig,\n\t\t\t\t\t\t(gpointer) info->si_addr);\n\t} else if (sig == SIGKILL || sig == SIGINT) {\n\t\tloop->quit();\n\t\tif (p_server != NULL) {\n\t\t\tp_server->stop();\n\t\t\tp_server = NULL;\n\t\t}\n\t\treturn;\n\t} else {\n\t\tprintf(\"Got signal %d\\n\", sig);\n\t}\n\n\ttrace_size = backtrace(trace, 35);\n\t\/* overwrite sigaction with caller's address *\/\n\t\/\/trace[1] = (void *) uc->uc_mcontext.gregs[REG_EIP];\n\n\tmessages = backtrace_symbols(trace, trace_size);\n\t\/* skip first stack frame (points here) *\/\n\tg_print(\"\\t[bt] Execution path:\\n\");\n\tfor (i=1; i<trace_size; ++i) {\n\t\tg_print(\"\\t[bt] #%d %s\\n\", i, messages[i]);\n\t\tchar syscom[256];\n\t\tgchar **strs;\n\t\tconst gchar *exe;\n\n\t\tstrs = g_strsplit(messages[i], \"(\", 2);\n\n\t\tif (strs[1] == NULL)\n\t\t\texe = getExecutableName();\n\t\telse\n\t\t\texe = strs[0];\n\n\t\tsprintf(syscom, \"echo -n \\\"\\t[bt]\\t\\t\\\"; addr2line %p -s -e %s\",\n\t\t\t\t\t\t\t\ttrace[i], exe);\n\n\t\tg_strfreev(strs);\n\t\tsystem(syscom);\n\t}\n\n\tif (sig == SIGPIPE) {\n\t\tGST_DEBUG(\"Ignore sigpipe\");\n\t} else {\n\t\texit(sig);\n\t}\n}\n\nint main(int argc, char **argv) {\n\tstruct sigaction sa;\n\n\tgst_init(&argc, &argv);\n\tGST_DEBUG_CATEGORY_INIT(GST_CAT_DEFAULT, GST_DEFAULT_NAME, 0, GST_DEFAULT_NAME);\n\n\t\/* Install our signal handler *\/\n\tsa.sa_sigaction = \/*(void (*)(int, siginfo*, gpointer))*\/bt_sighandler;\n\tsigemptyset(&sa.sa_mask);\n\tsa.sa_flags = SA_RESTART | SA_SIGINFO;\n\n\tsigaction(SIGSEGV, &sa, NULL);\n\tsigaction(SIGPIPE, &sa, NULL);\n\tsigaction(SIGINT, &sa, NULL);\n\tsigaction(SIGKILL, &sa, NULL);\n\tGlib::thread_init();\n\n\tGST_INFO(\"Kmsc version: %s\", get_version());\n\n\tload_config(DEFAULT_CONFIG_FILE);\n\n\tsigc::slot<void> ss = sigc::ptr_fun(&create_media_server_service);\n\tGlib::Thread *serverServiceThread = Glib::Thread::create(ss, true);\n\tloop->run();\n\tserverServiceThread->join();\n\n\treturn 0;\n}\n<commit_msg>Use command line option parser.<commit_after>\/*\nkmsc - Kurento Media Server C\/C++ implementation\nCopyright (C) 2012 Tikal Technologies\n\nThis program is free software: you can redistribute it and\/or modify\nit under the terms of the GNU General Public License version 3\nas published by the Free Software Foundation.\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 General Public License\nalong with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <signal.h>\n#include <execinfo.h>\n\n#include \"MediaServerServiceHandler.h\"\n\n#include <protocol\/TBinaryProtocol.h>\n#include <transport\/TServerSocket.h>\n#include <transport\/TBufferTransports.h>\n#include <server\/TNonblockingServer.h>\n#include <concurrency\/PosixThreadFactory.h>\n#include <concurrency\/ThreadManager.h>\n\n#include \"media_config_loader.h\"\n\n#include <glibmm.h>\n#include <fstream>\n\n#include <gst\/gst.h>\n\n#include <version.h>\n\nusing namespace ::apache::thrift;\nusing namespace ::apache::thrift::protocol;\nusing namespace ::apache::thrift::transport;\nusing namespace ::apache::thrift::server;\nusing namespace ::apache::thrift::concurrency;\n\nusing namespace ::kurento;\n\nusing boost::shared_ptr;\nusing ::kurento::MediaServerServiceHandler;\nusing ::Glib::KeyFile;\nusing ::Glib::KeyFileFlags;\n\n\n#define GST_CAT_DEFAULT media_server\nGST_DEBUG_CATEGORY_STATIC (GST_CAT_DEFAULT);\n#define GST_DEFAULT_NAME \"media_server\"\n\n#define DEFAULT_CONFIG_FILE \"\/etc\/kurento\/kurento.conf\"\n\n#define MEDIA_SERVER_ADDRESS \"localhost\"\n#define MEDIA_SERVER_SERVICE_PORT 9090\n\n#define MEDIA_SERVER_ADDRESS_KEY \"serverAddress\"\n#define MEDIA_SERVER_SERVICE_PORT_KEY \"serverPort\"\n\nstatic std::string serverAddress;\nstatic gint serverServicePort;\nstatic std::string sessionSpec;\nstatic KeyFile configFile;\n\nGlib::RefPtr<Glib::MainLoop> loop = Glib::MainLoop::create(true);\nstatic TNonblockingServer *p_server = NULL;\n\nstatic gchar *conf_file;\n\nstatic GOptionEntry entries[] =\n{\n\t{ \"conf-file\", 'f', 0, G_OPTION_ARG_FILENAME, &conf_file, \"Configuration file\", NULL },\n\t{ NULL }\n};\n\nstatic void create_media_server_service() {\n\tint port;\n\n\tport = MEDIA_SERVER_SERVICE_PORT;\n\n\tshared_ptr<MediaServerServiceHandler> handler(\n\t\t\tnew MediaServerServiceHandler());\n\tshared_ptr<TProcessor> processor(new MediaServerServiceProcessor(handler));\n\tshared_ptr<TProtocolFactory> protocolFactory(new TBinaryProtocolFactory());\n\tshared_ptr<PosixThreadFactory> threadFactory(new PosixThreadFactory ());\n\tshared_ptr<ThreadManager> threadManager= ThreadManager::newSimpleThreadManager(15);\n\n\tthreadManager->threadFactory(threadFactory);\n\tthreadManager->start();\n\tTNonblockingServer server(processor, protocolFactory, port, threadManager);\n\tp_server = &server;\n\tGST_INFO(\"Starting MediaServerService\");\n\tserver.serve();\n\n\tGST_INFO(\"MediaServerService stopped finishing thread\");\n\tthrow Glib::Thread::Exit();\n}\n\nstatic void\ncheck_port(int port)\n{\n\tif (port <=0 || port > G_MAXUSHORT)\n\t\tthrow Glib::KeyFileError(Glib::KeyFileError::PARSE,\n\t\t\t\t\t\t\t\"Invalid value\");\n}\n\nstatic void\nset_default_server_config()\n{\n\tserverAddress = MEDIA_SERVER_ADDRESS;\n\tserverServicePort = MEDIA_SERVER_SERVICE_PORT;\n}\n\nstatic void load_config(const std::string &file_name) {\n\tgint port;\n\n\tGST_INFO(\"Reading configuration from: %s\", file_name.c_str());\n\t\/* Try to open de file *\/\n\t{\n\t\tstd::ifstream file(file_name);\n\t\tif (!file) {\n\t\t\tGST_INFO(\"Config file not found, creating a new one\");\n\t\t\tstd::ofstream of(file_name);\n\t\t}\n\t}\n\ttry {\n\t\tif (!configFile.load_from_file(file_name,\n\t\t\t\tKeyFileFlags::KEY_FILE_KEEP_COMMENTS |\n\t\t\t\tKeyFileFlags::KEY_FILE_KEEP_TRANSLATIONS )) {\n\t\t\tGST_WARNING(\"Error loading configuration from %s, loading \"\n\t\t\t\t\t\t\"default server config, but no \"\n\t\t\t\t\t\t\"codecs will be available\", file_name.c_str());\n\t\t\tset_default_server_config();\n\t\t\treturn;\n\t\t}\n\t} catch (Glib::Error ex) {\n\t\tGST_WARNING(\"Error loading configuration: %s\", ex.what().c_str());\n\t\tGST_WARNING(\"Error loading configuration from %s, loading \"\n\t\t\t\t\t\t\"default server config, but no \"\n\t\t\t\t\t\t\"codecs will be available\", file_name.c_str());\n\t\tset_default_server_config();\n\t\treturn;\n\t}\n\n\ttry {\n\t\tserverAddress = configFile.get_string(SERVER_GROUP,\n\t\t\t\t\t\t\tMEDIA_SERVER_ADDRESS_KEY);\n\t} catch (Glib::KeyFileError err) {\n\t\tGST_INFO(err.what().c_str());\n\t\tGST_INFO(\"Setting default address\");\n\t\tconfigFile.set_string(SERVER_GROUP, MEDIA_SERVER_ADDRESS_KEY,\n\t\t\t\t\t\t\t\tMEDIA_SERVER_ADDRESS);\n\t\tserverAddress = MEDIA_SERVER_ADDRESS;\n\t}\n\n\ttry {\n\t\tport = configFile.get_integer(SERVER_GROUP, MEDIA_SERVER_SERVICE_PORT_KEY);\n\t\tcheck_port(port);\n\t\tserverServicePort = port;\n\t} catch (Glib::KeyFileError err) {\n\t\tGST_INFO(err.what().c_str());\n\t\tGST_INFO(\"Setting default server port\");\n\t\tconfigFile.set_integer(SERVER_GROUP, MEDIA_SERVER_SERVICE_PORT_KEY,\n\t\t\t\t\t\t\tMEDIA_SERVER_SERVICE_PORT);\n\t\tserverServicePort = MEDIA_SERVER_SERVICE_PORT;\n\t}\n\n\ttry {\n\t\tload_spec(configFile, sessionSpec);\n\t} catch (Glib::KeyFileError err) {\n\t\tGST_WARNING(err.what().c_str());\n\t\tGST_WARNING(\"Wrong codec configuration, communication won't be possible\");\n\t}\n\n\tstd::ofstream f(file_name, std::ios::out | std::ios::trunc);\n\tf << configFile.to_data();\n\tf.close();\n\n\tGST_INFO(\"Configuration loaded successfully\");\n\tGST_DEBUG(\"Final config file:\\n%s\", configFile.to_data().c_str());\n}\n\nstatic void\ninitialiseExecutableName(char *exe, int size) {\n\tchar link[1024];\n\tint len;\n\n\tsnprintf(link, sizeof(link), \"\/proc\/%d\/exe\", getpid());\n\tlen = readlink(link, exe, size);\n\n\tif(len ==-1) {\n\t\tfprintf(stderr,\"ERROR GETTING NAME\\n\");\n\t\texit(1);\n\t}\n\n\texe[len] = '\\0';\n}\n\nstatic const char*\ngetExecutableName() {\n\tstatic char* exe = NULL;\n\tstatic char aux[1024];\n\n\tif (exe == NULL) {\n\t\tinitialiseExecutableName(aux, sizeof(aux));\n\t\texe = aux;\n\t}\n\n\treturn exe;\n}\n\nstatic void\nbt_sighandler(int sig, siginfo_t *info, gpointer data) {\n\n\tvoid *trace[35];\n\tchar **messages = (char **)NULL;\n\tint i, trace_size = 0;\n\/\/ \tucontext_t *uc = (ucontext_t *)data;\n\n\t\/* Do something useful with siginfo_t *\/\n\tif (sig == SIGSEGV) {\n\t\tprintf(\"Got signal %d, faulty address is %p\\n\", sig,\n\t\t\t\t\t\t(gpointer) info->si_addr);\n\t} else if (sig == SIGKILL || sig == SIGINT) {\n\t\tloop->quit();\n\t\tif (p_server != NULL) {\n\t\t\tp_server->stop();\n\t\t\tp_server = NULL;\n\t\t}\n\t\treturn;\n\t} else {\n\t\tprintf(\"Got signal %d\\n\", sig);\n\t}\n\n\ttrace_size = backtrace(trace, 35);\n\t\/* overwrite sigaction with caller's address *\/\n\t\/\/trace[1] = (void *) uc->uc_mcontext.gregs[REG_EIP];\n\n\tmessages = backtrace_symbols(trace, trace_size);\n\t\/* skip first stack frame (points here) *\/\n\tg_print(\"\\t[bt] Execution path:\\n\");\n\tfor (i=1; i<trace_size; ++i) {\n\t\tg_print(\"\\t[bt] #%d %s\\n\", i, messages[i]);\n\t\tchar syscom[256];\n\t\tgchar **strs;\n\t\tconst gchar *exe;\n\n\t\tstrs = g_strsplit(messages[i], \"(\", 2);\n\n\t\tif (strs[1] == NULL)\n\t\t\texe = getExecutableName();\n\t\telse\n\t\t\texe = strs[0];\n\n\t\tsprintf(syscom, \"echo -n \\\"\\t[bt]\\t\\t\\\"; addr2line %p -s -e %s\",\n\t\t\t\t\t\t\t\ttrace[i], exe);\n\n\t\tg_strfreev(strs);\n\t\tsystem(syscom);\n\t}\n\n\tif (sig == SIGPIPE) {\n\t\tGST_DEBUG(\"Ignore sigpipe\");\n\t} else {\n\t\texit(sig);\n\t}\n}\n\nint main(int argc, char **argv) {\n\tGError *error = NULL;\n\tGOptionContext *context;\n\n\tstruct sigaction sa;\n\n\tcontext = g_option_context_new(\"\");\n\tg_option_context_add_main_entries(context, entries, NULL);\n\tg_option_context_add_group(context, gst_init_get_option_group());\n\tif (!g_option_context_parse(context, &argc, &argv, &error)) {\n\t\tGST_ERROR(\"option parsing failed: %s\\n\", error->message);\n\t\texit (1);\n\t}\n\n\tgst_init(&argc, &argv);\n\tGST_DEBUG_CATEGORY_INIT(GST_CAT_DEFAULT, GST_DEFAULT_NAME, 0, GST_DEFAULT_NAME);\n\n\t\/* Install our signal handler *\/\n\tsa.sa_sigaction = \/*(void (*)(int, siginfo*, gpointer))*\/bt_sighandler;\n\tsigemptyset(&sa.sa_mask);\n\tsa.sa_flags = SA_RESTART | SA_SIGINFO;\n\n\tsigaction(SIGSEGV, &sa, NULL);\n\tsigaction(SIGPIPE, &sa, NULL);\n\tsigaction(SIGINT, &sa, NULL);\n\tsigaction(SIGKILL, &sa, NULL);\n\tGlib::thread_init();\n\n\tGST_INFO(\"Kmsc version: %s\", get_version());\n\n\tload_config(DEFAULT_CONFIG_FILE);\n\n\tsigc::slot<void> ss = sigc::ptr_fun(&create_media_server_service);\n\tGlib::Thread *serverServiceThread = Glib::Thread::create(ss, true);\n\tloop->run();\n\tserverServiceThread->join();\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SERVER_HTTP_HPP\n#define\tSERVER_HTTP_HPP\n\n#include <boost\/asio.hpp>\n\n#include <regex>\n#include <unordered_map>\n#include <thread>\n\nnamespace SimpleWeb {\n    template <class socket_type>\n    class ServerBase {\n    public:\n        class Request {\n            friend class ServerBase<socket_type>;\n        public:\n            std::string method, path, http_version;\n\n            std::istream content;\n\n            std::unordered_map<std::string, std::string> header;\n\n            std::smatch path_match;\n            \n        private:\n            Request(): content(&content_buffer) {}\n            \n            boost::asio::streambuf content_buffer;\n        };\n        \n        typedef std::map<std::string, std::unordered_map<std::string, \n                std::function<void(std::ostream&, std::shared_ptr<ServerBase<socket_type>::Request>)> > > resource_type;\n        \n        resource_type resource;\n\n        resource_type default_resource;\n        \n        void start() {\n            \/\/All resources with default_resource at the end of vector\n            \/\/Used in the respond-method\n            for(auto it=resource.begin(); it!=resource.end();it++) {\n                all_resources.push_back(it);\n            }\n            for(auto it=default_resource.begin(); it!=default_resource.end();it++) {\n                all_resources.push_back(it);\n            }\n            \n            accept();            \n            \n            \/\/If num_threads>1, start m_io_service.run() in (num_threads-1) threads for thread-pooling\n            for(size_t c=1;c<num_threads;c++) {\n                threads.emplace_back([this](){\n                    m_io_service.run();\n                });\n            }\n\n            \/\/Main thread\n            m_io_service.run();\n\n            \/\/Wait for the rest of the threads, if any, to finish as well\n            for(auto& t: threads) {\n                t.join();\n            }\n        }\n\n    protected:\n        boost::asio::io_service m_io_service;\n        boost::asio::ip::tcp::endpoint endpoint;\n        boost::asio::ip::tcp::acceptor acceptor;\n        size_t num_threads;\n        std::vector<std::thread> threads;\n        \n        size_t timeout_request;\n        size_t timeout_content;\n\n        \/\/All resources with default_resource at the end of vector\n        \/\/Created in start()\n        std::vector<typename resource_type::iterator> all_resources;\n        \n        ServerBase(unsigned short port, size_t num_threads, size_t timeout_request, size_t timeout_send_or_receive) : \n                endpoint(boost::asio::ip::tcp::v4(), port), acceptor(m_io_service, endpoint), num_threads(num_threads), \n                timeout_request(timeout_request), timeout_content(timeout_send_or_receive) {}\n        \n        virtual void accept()=0;\n        \n        virtual std::shared_ptr<boost::asio::deadline_timer> set_timeout_on_socket(std::shared_ptr<socket_type> socket, size_t seconds)=0;\n        \n        void read_request_and_content(std::shared_ptr<socket_type> socket) {\n            \/\/Create new streambuf (Request::streambuf) for async_read_until()\n            \/\/shared_ptr is used to pass temporary objects to the asynchronous functions\n            std::shared_ptr<Request> request(new Request());\n\n            \/\/Set timeout on the following boost::asio::async-read or write function\n            std::shared_ptr<boost::asio::deadline_timer> timer;\n            if(timeout_request>0)\n                timer=set_timeout_on_socket(socket, timeout_request);\n            \n            boost::asio::async_read_until(*socket, request->content_buffer, \"\\r\\n\\r\\n\",\n                    [this, socket, request, timer](const boost::system::error_code& ec, size_t bytes_transferred) {\n                if(timeout_request>0)\n                    timer->cancel();\n                if(!ec) {\n                    \/\/request->streambuf.size() is not necessarily the same as bytes_transferred, from Boost-docs:\n                    \/\/\"After a successful async_read_until operation, the streambuf may contain additional data beyond the delimiter\"\n                    \/\/The chosen solution is to extract lines from the stream directly when parsing the header. What is left of the\n                    \/\/streambuf (maybe some bytes of the content) is appended to in the async_read-function below (for retrieving content).\n                    size_t num_additional_bytes=request->content_buffer.size()-bytes_transferred;\n                    \n                    parse_request(request, request->content);\n                    \n                    \/\/If content, read that as well\n                    if(request->header.count(\"Content-Length\")>0) {\n                        \/\/Set timeout on the following boost::asio::async-read or write function\n                        std::shared_ptr<boost::asio::deadline_timer> timer;\n                        if(timeout_content>0)\n                            timer=set_timeout_on_socket(socket, timeout_content);\n                        \n                        boost::asio::async_read(*socket, request->content_buffer, \n                                boost::asio::transfer_exactly(stoull(request->header[\"Content-Length\"])-num_additional_bytes), \n                                [this, socket, request, timer]\n                                (const boost::system::error_code& ec, size_t bytes_transferred) {\n                            if(timeout_content>0)\n                                timer->cancel();\n                            if(!ec)\n                                write_response(socket, request);\n                        });\n                    }\n                    else {                   \n                        write_response(socket, request);\n                    }\n                }\n            });\n        }\n\n        void parse_request(std::shared_ptr<Request> request, std::istream& stream) const {\n            std::regex e(\"^([^ ]*) ([^ ]*) HTTP\/([^ ]*)$\");\n\n            std::smatch sm;\n\n            \/\/First parse request method, path, and HTTP-version from the first line\n            std::string line;\n            getline(stream, line);\n            line.pop_back();\n            if(std::regex_match(line, sm, e)) {        \n                request->method=sm[1];\n                request->path=sm[2];\n                request->http_version=sm[3];\n\n                bool matched;\n                e=\"^([^:]*): ?(.*)$\";\n                \/\/Parse the rest of the header\n                do {\n                    getline(stream, line);\n                    line.pop_back();\n                    matched=std::regex_match(line, sm, e);\n                    if(matched) {\n                        request->header[sm[1]]=sm[2];\n                    }\n\n                } while(matched==true);\n            }\n        }\n\n        void write_response(std::shared_ptr<socket_type> socket, std::shared_ptr<Request> request) {\n            \/\/Find path- and method-match, and generate response\n            for(auto res_it: all_resources) {\n                std::regex e(res_it->first);\n                std::smatch sm_res;\n                if(std::regex_match(request->path, sm_res, e)) {\n                    if(res_it->second.count(request->method)>0) {\n                        request->path_match=move(sm_res);\n                        \n                        std::shared_ptr<boost::asio::streambuf> write_buffer(new boost::asio::streambuf);\n                        std::ostream response(write_buffer.get());\n                        res_it->second[request->method](response, request);\n\n                        \/\/Set timeout on the following boost::asio::async-read or write function\n                        std::shared_ptr<boost::asio::deadline_timer> timer;\n                        if(timeout_content>0)\n                            timer=set_timeout_on_socket(socket, timeout_content);\n                        \n                        \/\/Capture write_buffer in lambda so it is not destroyed before async_write is finished\n                        boost::asio::async_write(*socket, *write_buffer, \n                                [this, socket, request, write_buffer, timer]\n                                (const boost::system::error_code& ec, size_t bytes_transferred) {\n                            if(timeout_content>0)\n                                timer->cancel();\n                            \/\/HTTP persistent connection (HTTP 1.1):\n                            if(!ec && stof(request->http_version)>1.05)\n                                read_request_and_content(socket);\n                        });\n                        return;\n                    }\n                }\n            }\n        }\n    };\n    \n    template<class socket_type>\n    class Server : public ServerBase<socket_type> {};\n    \n    typedef boost::asio::ip::tcp::socket HTTP;\n    \n    template<>\n    class Server<HTTP> : public ServerBase<HTTP> {\n    public:\n        Server(unsigned short port, size_t num_threads=1, size_t timeout_request=5, size_t timeout_content=300) : \n                ServerBase<HTTP>::ServerBase(port, num_threads, timeout_request, timeout_content) {};\n        \n    private:\n        void accept() {\n            \/\/Create new socket for this connection\n            \/\/Shared_ptr is used to pass temporary objects to the asynchronous functions\n            std::shared_ptr<HTTP> socket(new HTTP(m_io_service));\n            \n            acceptor.async_accept(*socket, [this, socket](const boost::system::error_code& ec) {\n                \/\/Immediately start accepting a new connection\n                accept();\n\n                if(!ec) {\n                    read_request_and_content(socket);\n                }\n            });\n        }\n        \n        std::shared_ptr<boost::asio::deadline_timer> set_timeout_on_socket(std::shared_ptr<HTTP> socket, size_t seconds) {\n            std::shared_ptr<boost::asio::deadline_timer> timer(new boost::asio::deadline_timer(m_io_service));\n            timer->expires_from_now(boost::posix_time::seconds(seconds));\n            timer->async_wait([socket](const boost::system::error_code& ec){\n                if(!ec) {\n                    socket->shutdown(boost::asio::ip::tcp::socket::shutdown_both);\n                    socket->close();\n                }\n            });\n            return timer;\n        }\n    };\n}\n#endif\t\/* SERVER_HTTP_HPP *\/<commit_msg>Added Server::stop()<commit_after>#ifndef SERVER_HTTP_HPP\n#define\tSERVER_HTTP_HPP\n\n#include <boost\/asio.hpp>\n\n#include <regex>\n#include <unordered_map>\n#include <thread>\n\nnamespace SimpleWeb {\n    template <class socket_type>\n    class ServerBase {\n    public:\n        class Request {\n            friend class ServerBase<socket_type>;\n        public:\n            std::string method, path, http_version;\n\n            std::istream content;\n\n            std::unordered_map<std::string, std::string> header;\n\n            std::smatch path_match;\n            \n        private:\n            Request(): content(&content_buffer) {}\n            \n            boost::asio::streambuf content_buffer;\n        };\n        \n        typedef std::map<std::string, std::unordered_map<std::string, \n                std::function<void(std::ostream&, std::shared_ptr<ServerBase<socket_type>::Request>)> > > resource_type;\n        \n        resource_type resource;\n\n        resource_type default_resource;\n        \n        void start() {\n            \/\/All resources with default_resource at the end of vector\n            \/\/Used in the respond-method\n            for(auto it=resource.begin(); it!=resource.end();it++) {\n                all_resources.push_back(it);\n            }\n            for(auto it=default_resource.begin(); it!=default_resource.end();it++) {\n                all_resources.push_back(it);\n            }\n            \n            accept();            \n            \n            \/\/If num_threads>1, start m_io_service.run() in (num_threads-1) threads for thread-pooling\n            for(size_t c=1;c<num_threads;c++) {\n                threads.emplace_back([this](){\n                    m_io_service.run();\n                });\n            }\n\n            \/\/Main thread\n            m_io_service.run();\n\n            \/\/Wait for the rest of the threads, if any, to finish as well\n            for(auto& t: threads) {\n                t.join();\n            }\n        }\n        \n        void stop() {\n            m_io_service.stop();\n        }\n\n    protected:\n        boost::asio::io_service m_io_service;\n        boost::asio::ip::tcp::endpoint endpoint;\n        boost::asio::ip::tcp::acceptor acceptor;\n        size_t num_threads;\n        std::vector<std::thread> threads;\n        \n        size_t timeout_request;\n        size_t timeout_content;\n\n        \/\/All resources with default_resource at the end of vector\n        \/\/Created in start()\n        std::vector<typename resource_type::iterator> all_resources;\n        \n        ServerBase(unsigned short port, size_t num_threads, size_t timeout_request, size_t timeout_send_or_receive) : \n                endpoint(boost::asio::ip::tcp::v4(), port), acceptor(m_io_service, endpoint), num_threads(num_threads), \n                timeout_request(timeout_request), timeout_content(timeout_send_or_receive) {}\n        \n        virtual void accept()=0;\n        \n        virtual std::shared_ptr<boost::asio::deadline_timer> set_timeout_on_socket(std::shared_ptr<socket_type> socket, size_t seconds)=0;\n        \n        void read_request_and_content(std::shared_ptr<socket_type> socket) {\n            \/\/Create new streambuf (Request::streambuf) for async_read_until()\n            \/\/shared_ptr is used to pass temporary objects to the asynchronous functions\n            std::shared_ptr<Request> request(new Request());\n\n            \/\/Set timeout on the following boost::asio::async-read or write function\n            std::shared_ptr<boost::asio::deadline_timer> timer;\n            if(timeout_request>0)\n                timer=set_timeout_on_socket(socket, timeout_request);\n            \n            boost::asio::async_read_until(*socket, request->content_buffer, \"\\r\\n\\r\\n\",\n                    [this, socket, request, timer](const boost::system::error_code& ec, size_t bytes_transferred) {\n                if(timeout_request>0)\n                    timer->cancel();\n                if(!ec) {\n                    \/\/request->streambuf.size() is not necessarily the same as bytes_transferred, from Boost-docs:\n                    \/\/\"After a successful async_read_until operation, the streambuf may contain additional data beyond the delimiter\"\n                    \/\/The chosen solution is to extract lines from the stream directly when parsing the header. What is left of the\n                    \/\/streambuf (maybe some bytes of the content) is appended to in the async_read-function below (for retrieving content).\n                    size_t num_additional_bytes=request->content_buffer.size()-bytes_transferred;\n                    \n                    parse_request(request, request->content);\n                    \n                    \/\/If content, read that as well\n                    if(request->header.count(\"Content-Length\")>0) {\n                        \/\/Set timeout on the following boost::asio::async-read or write function\n                        std::shared_ptr<boost::asio::deadline_timer> timer;\n                        if(timeout_content>0)\n                            timer=set_timeout_on_socket(socket, timeout_content);\n                        \n                        boost::asio::async_read(*socket, request->content_buffer, \n                                boost::asio::transfer_exactly(stoull(request->header[\"Content-Length\"])-num_additional_bytes), \n                                [this, socket, request, timer]\n                                (const boost::system::error_code& ec, size_t bytes_transferred) {\n                            if(timeout_content>0)\n                                timer->cancel();\n                            if(!ec)\n                                write_response(socket, request);\n                        });\n                    }\n                    else {                   \n                        write_response(socket, request);\n                    }\n                }\n            });\n        }\n\n        void parse_request(std::shared_ptr<Request> request, std::istream& stream) const {\n            std::regex e(\"^([^ ]*) ([^ ]*) HTTP\/([^ ]*)$\");\n\n            std::smatch sm;\n\n            \/\/First parse request method, path, and HTTP-version from the first line\n            std::string line;\n            getline(stream, line);\n            line.pop_back();\n            if(std::regex_match(line, sm, e)) {        \n                request->method=sm[1];\n                request->path=sm[2];\n                request->http_version=sm[3];\n\n                bool matched;\n                e=\"^([^:]*): ?(.*)$\";\n                \/\/Parse the rest of the header\n                do {\n                    getline(stream, line);\n                    line.pop_back();\n                    matched=std::regex_match(line, sm, e);\n                    if(matched) {\n                        request->header[sm[1]]=sm[2];\n                    }\n\n                } while(matched==true);\n            }\n        }\n\n        void write_response(std::shared_ptr<socket_type> socket, std::shared_ptr<Request> request) {\n            \/\/Find path- and method-match, and generate response\n            for(auto res_it: all_resources) {\n                std::regex e(res_it->first);\n                std::smatch sm_res;\n                if(std::regex_match(request->path, sm_res, e)) {\n                    if(res_it->second.count(request->method)>0) {\n                        request->path_match=move(sm_res);\n                        \n                        std::shared_ptr<boost::asio::streambuf> write_buffer(new boost::asio::streambuf);\n                        std::ostream response(write_buffer.get());\n                        res_it->second[request->method](response, request);\n\n                        \/\/Set timeout on the following boost::asio::async-read or write function\n                        std::shared_ptr<boost::asio::deadline_timer> timer;\n                        if(timeout_content>0)\n                            timer=set_timeout_on_socket(socket, timeout_content);\n                        \n                        \/\/Capture write_buffer in lambda so it is not destroyed before async_write is finished\n                        boost::asio::async_write(*socket, *write_buffer, \n                                [this, socket, request, write_buffer, timer]\n                                (const boost::system::error_code& ec, size_t bytes_transferred) {\n                            if(timeout_content>0)\n                                timer->cancel();\n                            \/\/HTTP persistent connection (HTTP 1.1):\n                            if(!ec && stof(request->http_version)>1.05)\n                                read_request_and_content(socket);\n                        });\n                        return;\n                    }\n                }\n            }\n        }\n    };\n    \n    template<class socket_type>\n    class Server : public ServerBase<socket_type> {};\n    \n    typedef boost::asio::ip::tcp::socket HTTP;\n    \n    template<>\n    class Server<HTTP> : public ServerBase<HTTP> {\n    public:\n        Server(unsigned short port, size_t num_threads=1, size_t timeout_request=5, size_t timeout_content=300) : \n                ServerBase<HTTP>::ServerBase(port, num_threads, timeout_request, timeout_content) {};\n        \n    private:\n        void accept() {\n            \/\/Create new socket for this connection\n            \/\/Shared_ptr is used to pass temporary objects to the asynchronous functions\n            std::shared_ptr<HTTP> socket(new HTTP(m_io_service));\n            \n            acceptor.async_accept(*socket, [this, socket](const boost::system::error_code& ec) {\n                \/\/Immediately start accepting a new connection\n                accept();\n\n                if(!ec) {\n                    read_request_and_content(socket);\n                }\n            });\n        }\n        \n        std::shared_ptr<boost::asio::deadline_timer> set_timeout_on_socket(std::shared_ptr<HTTP> socket, size_t seconds) {\n            std::shared_ptr<boost::asio::deadline_timer> timer(new boost::asio::deadline_timer(m_io_service));\n            timer->expires_from_now(boost::posix_time::seconds(seconds));\n            timer->async_wait([socket](const boost::system::error_code& ec){\n                if(!ec) {\n                    socket->shutdown(boost::asio::ip::tcp::socket::shutdown_both);\n                    socket->close();\n                }\n            });\n            return timer;\n        }\n    };\n}\n#endif\t\/* SERVER_HTTP_HPP *\/<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n#include <stdexcept>\n\nextern \"C\" {\n#include <Zend\/zend_API.h>\n}\n\n#include \"array.h\"\n#include \"helpers.h\"\n#include \"string.h\"\n#include \"value.h\"\n#include \"zendstring.h\"\n\nphpcxx::Array::Array()\n{\n    array_init(&this->m_z);\n}\n\nphpcxx::Array::Array(zval* z)\n{\n    assert(z != nullptr);\n\n    if (Z_ISREF_P(z) && Z_TYPE_P(Z_REFVAL_P(z)) == IS_ARRAY) {\n        ZVAL_COPY(&this->m_z, Z_REFVAL_P(z));\n    }\n    else {\n        ZVAL_COPY(&this->m_z, z);\n        if (Z_TYPE_P(z) != IS_ARRAY) {\n            convert_to_array(&this->m_z);\n        }\n    }\n}\n\nphpcxx::Array::Array(Value& v)\n    : Array(v.pzval())\n{\n}\n\nphpcxx::Array::Array(Array& other)\n{\n    ZVAL_COPY(&this->m_z, &other.m_z);\n}\n\nphpcxx::Array::Array(Array&& other)\n{\n    ZVAL_UNDEF(&this->m_z);\n    std::swap(this->m_z, other.m_z);\n}\n\nphpcxx::Array::~Array()\n{\n    i_zval_ptr_dtor(&this->m_z ZEND_FILE_LINE_CC);\n#ifdef PHPCXX_DEBUG\n    ZVAL_UNDEF(&this->m_z);\n#endif\n}\n\nphpcxx::Array& phpcxx::Array::operator=(Array& other)\n{\n    phpcxx::assign(&this->m_z, &other.m_z);\n    return *this;\n}\n\nphpcxx::Value& phpcxx::Array::operator[](std::nullptr_t)\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n\n    zval* var_ptr = zend_hash_next_index_insert(Z_ARRVAL(this->m_z), &EG(uninitialized_zval));\n    if (UNEXPECTED(!var_ptr)) {\n        throw std::runtime_error(\"Cannot add element to the array as the next element is already occupied\");\n    }\n\n    return *(new(var_ptr) Value(placement_construct));\n}\n\nphpcxx::Value& phpcxx::Array::operator[](zend_long idx)\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n\n    zend_ulong h = static_cast<zend_ulong>(idx);\n    zval* retval = zend_hash_index_find(Z_ARRVAL(this->m_z), h);\n    if (!retval) {\n        retval = zend_hash_index_add_new(Z_ARRVAL(this->m_z), h, &EG(uninitialized_zval));\n        if (UNEXPECTED(!retval)) {\n            throw std::runtime_error(\"Cannot add element to the array as the next element is already occupied\");\n        }\n    }\n\n    return *(new(retval) Value(placement_construct));\n}\n\nphpcxx::Value& phpcxx::Array::operator[](const Value& key)\n{\n    zval* z = key.pzval();\n\n    while (true) {\n        switch (key.type()) {\n            case Type::String:    return this->operator[](Z_STR_P(z));\n            case Type::Integer:   return this->operator[](Z_LVAL_P(z));\n            case Type::Double:    return this->operator[](zend_dval_to_lval(Z_DVAL_P(z)));\n            case Type::True:      return this->operator[](static_cast<zend_long>(1l));\n            case Type::False:     return this->operator[](static_cast<zend_long>(0l));\n            case Type::Resource:  return this->operator[](Z_RES_HANDLE_P(z));\n            case Type::Undefined: return this->operator[](ZSTR_EMPTY_ALLOC());\n            case Type::Null:      return this->operator[](ZSTR_EMPTY_ALLOC());\n            case Type::Reference:\n                z = Z_REFVAL_P(z);\n                break;\n\n            default:\n                throw std::invalid_argument(\"Illegal offset type\");\n        }\n    }\n}\n\nphpcxx::Value& phpcxx::Array::operator[](zend_string* key)\n{\n    zend_ulong hval;\n    if (ZEND_HANDLE_NUMERIC(key, hval)) {\n        return this->operator[](static_cast<zend_long>(hval));\n    }\n\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n\n    zval* retval = zend_hash_find(Z_ARRVAL(this->m_z), key);\n    if (retval) {\n        if (UNEXPECTED(Z_TYPE_P(retval) == IS_INDIRECT)) {\n            retval = Z_INDIRECT_P(retval);\n            if (UNEXPECTED(Z_TYPE_P(retval) == IS_UNDEF)) {\n                ZVAL_NULL(retval);\n            }\n        }\n    }\n    else {\n        retval = zend_hash_add_new(Z_ARRVAL(this->m_z), key, &EG(uninitialized_zval));\n        if (UNEXPECTED(!retval)) {\n            throw std::runtime_error(\"Cannot add element to the array as the next element is already occupied\");\n        }\n    }\n\n    return *(new(retval) Value(placement_construct));\n}\n\nstd::size_t phpcxx::Array::size() const\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    return zend_hash_num_elements(Z_ARRVAL(this->m_z));\n}\n\nbool phpcxx::Array::isset(zend_long idx) const\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    return zend_hash_index_exists(Z_ARRVAL(this->m_z), static_cast<zend_ulong>(idx));\n}\n\nbool phpcxx::Array::isset(const Value& key) const\n{\n    zval* z = key.pzval();\n\n    while (true) {\n        switch (key.type()) {\n            case Type::String:    return this->isset(Z_STR_P(z));\n            case Type::Integer:   return this->isset(Z_LVAL_P(z));\n            case Type::Double:    return this->isset(zend_dval_to_lval(Z_DVAL_P(z)));\n            case Type::True:      return this->isset(static_cast<zend_long>(1));\n            case Type::False:     return this->isset(static_cast<zend_long>(0));\n            case Type::Resource:  return this->isset(Z_RES_HANDLE_P(z));\n            case Type::Undefined: return this->isset(ZSTR_EMPTY_ALLOC());\n            case Type::Null:      return this->isset(ZSTR_EMPTY_ALLOC());\n            case Type::Reference:\n                z = Z_REFVAL_P(z);\n                break;\n\n            default:\n                throw std::invalid_argument(\"Illegal offset type\");\n        }\n    }\n}\n\nbool phpcxx::Array::isset(zend_string* key) const\n{\n    zend_ulong hval;\n    if (ZEND_HANDLE_NUMERIC(key, hval)) {\n        return this->isset(static_cast<zend_long>(hval));\n    }\n\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    return zend_hash_exists(Z_ARRVAL(this->m_z), key);\n}\n\nvoid phpcxx::Array::unset(zend_long idx)\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n    zend_hash_index_del(Z_ARRVAL(this->m_z), static_cast<zend_ulong>(idx));\n}\n\nvoid phpcxx::Array::unset(const Value& key)\n{\n    zval* z = key.pzval();\n\n    while (true) {\n        switch (key.type()) {\n            case Type::String:    return this->unset(Z_STR_P(z));\n            case Type::Integer:   return this->unset(Z_LVAL_P(z));\n            case Type::Double:    return this->unset(zend_dval_to_lval(Z_DVAL_P(z)));\n            case Type::True:      return this->unset(static_cast<zend_long>(1));\n            case Type::False:     return this->unset(static_cast<zend_long>(0));\n            case Type::Resource:  return this->unset(Z_RES_HANDLE_P(z));\n            case Type::Undefined: return this->unset(ZSTR_EMPTY_ALLOC());\n            case Type::Null:      return this->unset(ZSTR_EMPTY_ALLOC());\n            case Type::Reference:\n                z = Z_REFVAL_P(z);\n                break;\n\n            default:\n                throw std::invalid_argument(\"Illegal offset type\");\n        }\n    }\n}\n\nvoid phpcxx::Array::unset(zend_string* key)\n{\n    zend_ulong hval;\n    if (ZEND_HANDLE_NUMERIC(key, hval)) {\n        return this->unset(static_cast<zend_long>(hval));\n    }\n\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n\n    HashTable* ht = Z_ARRVAL(this->m_z);\n    if (UNEXPECTED(ht == &EG(symbol_table))) {\n        zend_delete_global_variable(key);\n    }\n    else {\n        zend_hash_del(ht, key);\n    }\n}\n\nphpcxx::Value& phpcxx::Array::operator[](const char* key)\n{\n    return this->operator[](ZendString(key).get());\n}\n\nphpcxx::Value& phpcxx::Array::operator[](const string& key)\n{\n    return this->operator[](ZendString(key).get());\n}\n\nphpcxx::Value& phpcxx::Array::operator[](const ZendString& key)\n{\n    return this->operator[](key.get());\n}\n\nbool phpcxx::Array::isset(const char* key) const\n{\n    return this->isset(ZendString(key).get());\n}\n\nbool phpcxx::Array::isset(const string& key) const\n{\n    return this->isset(ZendString(key).get());\n}\n\nbool phpcxx::Array::isset(const ZendString& key) const\n{\n    return this->isset(key.get());\n}\n\nvoid phpcxx::Array::unset(const char* key)\n{\n    this->unset(ZendString(key).get());\n}\n\nvoid phpcxx::Array::unset(const string& key)\n{\n    this->unset(ZendString(key).get());\n}\n\nvoid phpcxx::Array::unset(const ZendString& key)\n{\n    this->unset(key.get());\n}\n<commit_msg>Fix segmentation fault<commit_after>#include <cassert>\n#include <stdexcept>\n\nextern \"C\" {\n#include <Zend\/zend_API.h>\n}\n\n#include \"array.h\"\n#include \"helpers.h\"\n#include \"string.h\"\n#include \"value.h\"\n#include \"zendstring.h\"\n\nphpcxx::Array::Array()\n{\n    array_init(&this->m_z);\n}\n\nphpcxx::Array::Array(zval* z)\n{\n    assert(z != nullptr);\n\n    if (Z_ISREF_P(z) && Z_TYPE_P(Z_REFVAL_P(z)) == IS_ARRAY) {\n        ZVAL_COPY(&this->m_z, Z_REFVAL_P(z));\n    }\n    else {\n        ZVAL_COPY(&this->m_z, z);\n        if (Z_TYPE_P(z) != IS_ARRAY) {\n            convert_to_array(&this->m_z);\n        }\n    }\n}\n\nphpcxx::Array::Array(Value& v)\n    : Array(v.pzval())\n{\n}\n\nphpcxx::Array::Array(Array& other)\n{\n    ZVAL_COPY(&this->m_z, &other.m_z);\n}\n\nphpcxx::Array::Array(Array&& other)\n{\n    ZVAL_UNDEF(&this->m_z);\n    std::swap(this->m_z, other.m_z);\n}\n\nphpcxx::Array::~Array()\n{\n    i_zval_ptr_dtor(&this->m_z ZEND_FILE_LINE_CC);\n#ifdef PHPCXX_DEBUG\n    ZVAL_UNDEF(&this->m_z);\n#endif\n}\n\nphpcxx::Array& phpcxx::Array::operator=(Array& other)\n{\n    phpcxx::assign(&this->m_z, &other.m_z);\n    return *this;\n}\n\nphpcxx::Value& phpcxx::Array::operator[](std::nullptr_t)\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n\n    zval* var_ptr = zend_hash_next_index_insert(Z_ARRVAL(this->m_z), &EG(uninitialized_zval));\n    if (UNEXPECTED(!var_ptr)) {\n        throw std::runtime_error(\"Cannot add element to the array as the next element is already occupied\");\n    }\n\n    return *(new(var_ptr) Value(placement_construct));\n}\n\nphpcxx::Value& phpcxx::Array::operator[](zend_long idx)\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n\n    zend_ulong h = static_cast<zend_ulong>(idx);\n    zval* retval = zend_hash_index_find(Z_ARRVAL(this->m_z), h);\n    if (!retval) {\n        retval = zend_hash_index_add_new(Z_ARRVAL(this->m_z), h, &EG(uninitialized_zval));\n        if (UNEXPECTED(!retval)) {\n            throw std::runtime_error(\"Cannot add element to the array as the next element is already occupied\");\n        }\n    }\n\n    return *(new(retval) Value(placement_construct));\n}\n\nphpcxx::Value& phpcxx::Array::operator[](const Value& key)\n{\n    zval* z = key.pzval();\n\n    while (true) {\n        switch (Z_TYPE_P(z)) {\n            case IS_STRING:    return this->operator[](Z_STR_P(z));\n            case IS_LONG:      return this->operator[](Z_LVAL_P(z));\n            case IS_DOUBLE:    return this->operator[](zend_dval_to_lval(Z_DVAL_P(z)));\n            case IS_TRUE:      return this->operator[](static_cast<zend_long>(1l));\n            case IS_FALSE:     return this->operator[](static_cast<zend_long>(0l));\n            case IS_RESOURCE:  return this->operator[](Z_RES_HANDLE_P(z));\n            case IS_UNDEF:     return this->operator[](ZSTR_EMPTY_ALLOC());\n            case IS_NULL:      return this->operator[](ZSTR_EMPTY_ALLOC());\n            case IS_REFERENCE:\n                z = Z_REFVAL_P(z);\n                break;\n\n            default:\n                throw std::invalid_argument(\"Illegal offset type\");\n        }\n    }\n}\n\nphpcxx::Value& phpcxx::Array::operator[](zend_string* key)\n{\n    zend_ulong hval;\n    if (ZEND_HANDLE_NUMERIC(key, hval)) {\n        return this->operator[](static_cast<zend_long>(hval));\n    }\n\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n\n    zval* retval = zend_hash_find(Z_ARRVAL(this->m_z), key);\n    if (retval) {\n        if (UNEXPECTED(Z_TYPE_P(retval) == IS_INDIRECT)) {\n            retval = Z_INDIRECT_P(retval);\n            if (UNEXPECTED(Z_TYPE_P(retval) == IS_UNDEF)) {\n                ZVAL_NULL(retval);\n            }\n        }\n    }\n    else {\n        retval = zend_hash_add_new(Z_ARRVAL(this->m_z), key, &EG(uninitialized_zval));\n        if (UNEXPECTED(!retval)) {\n            throw std::runtime_error(\"Cannot add element to the array as the next element is already occupied\");\n        }\n    }\n\n    return *(new(retval) Value(placement_construct));\n}\n\nstd::size_t phpcxx::Array::size() const\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    return zend_hash_num_elements(Z_ARRVAL(this->m_z));\n}\n\nbool phpcxx::Array::isset(zend_long idx) const\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    return zend_hash_index_exists(Z_ARRVAL(this->m_z), static_cast<zend_ulong>(idx));\n}\n\nbool phpcxx::Array::isset(const Value& key) const\n{\n    zval* z = key.pzval();\n\n    while (true) {\n        switch (Z_TYPE_P(z)) {\n            case IS_STRING:    return this->isset(Z_STR_P(z));\n            case IS_LONG:      return this->isset(Z_LVAL_P(z));\n            case IS_DOUBLE:    return this->isset(zend_dval_to_lval(Z_DVAL_P(z)));\n            case IS_TRUE:      return this->isset(static_cast<zend_long>(1));\n            case IS_FALSE:     return this->isset(static_cast<zend_long>(0));\n            case IS_RESOURCE:  return this->isset(Z_RES_HANDLE_P(z));\n            case IS_UNDEF:     return this->isset(ZSTR_EMPTY_ALLOC());\n            case IS_NULL:      return this->isset(ZSTR_EMPTY_ALLOC());\n            case IS_REFERENCE:\n                z = Z_REFVAL_P(z);\n                break;\n\n            default:\n                throw std::invalid_argument(\"Illegal offset type\");\n        }\n    }\n}\n\nbool phpcxx::Array::isset(zend_string* key) const\n{\n    zend_ulong hval;\n    if (ZEND_HANDLE_NUMERIC(key, hval)) {\n        return this->isset(static_cast<zend_long>(hval));\n    }\n\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    return zend_hash_exists(Z_ARRVAL(this->m_z), key);\n}\n\nvoid phpcxx::Array::unset(zend_long idx)\n{\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n    zend_hash_index_del(Z_ARRVAL(this->m_z), static_cast<zend_ulong>(idx));\n}\n\nvoid phpcxx::Array::unset(const Value& key)\n{\n    zval* z = key.pzval();\n\n    while (true) {\n        switch (Z_TYPE_P(z)) {\n            case IS_STRING:    return this->unset(Z_STR_P(z));\n            case IS_LONG:      return this->unset(Z_LVAL_P(z));\n            case IS_DOUBLE:    return this->unset(zend_dval_to_lval(Z_DVAL_P(z)));\n            case IS_TRUE:      return this->unset(static_cast<zend_long>(1));\n            case IS_FALSE:     return this->unset(static_cast<zend_long>(0));\n            case IS_RESOURCE:  return this->unset(Z_RES_HANDLE_P(z));\n            case IS_UNDEF:     return this->unset(ZSTR_EMPTY_ALLOC());\n            case IS_NULL:      return this->unset(ZSTR_EMPTY_ALLOC());\n            case IS_REFERENCE:\n                z = Z_REFVAL_P(z);\n                break;\n\n            default:\n                throw std::invalid_argument(\"Illegal offset type\");\n        }\n    }\n}\n\nvoid phpcxx::Array::unset(zend_string* key)\n{\n    zend_ulong hval;\n    if (ZEND_HANDLE_NUMERIC(key, hval)) {\n        return this->unset(static_cast<zend_long>(hval));\n    }\n\n    assert(Z_TYPE(this->m_z) == IS_ARRAY);\n    SEPARATE_ARRAY(&this->m_z);\n\n    HashTable* ht = Z_ARRVAL(this->m_z);\n    if (UNEXPECTED(ht == &EG(symbol_table))) {\n        zend_delete_global_variable(key);\n    }\n    else {\n        zend_hash_del(ht, key);\n    }\n}\n\nphpcxx::Value& phpcxx::Array::operator[](const char* key)\n{\n    return this->operator[](ZendString(key).get());\n}\n\nphpcxx::Value& phpcxx::Array::operator[](const string& key)\n{\n    return this->operator[](ZendString(key).get());\n}\n\nphpcxx::Value& phpcxx::Array::operator[](const ZendString& key)\n{\n    return this->operator[](key.get());\n}\n\nbool phpcxx::Array::isset(const char* key) const\n{\n    return this->isset(ZendString(key).get());\n}\n\nbool phpcxx::Array::isset(const string& key) const\n{\n    return this->isset(ZendString(key).get());\n}\n\nbool phpcxx::Array::isset(const ZendString& key) const\n{\n    return this->isset(key.get());\n}\n\nvoid phpcxx::Array::unset(const char* key)\n{\n    this->unset(ZendString(key).get());\n}\n\nvoid phpcxx::Array::unset(const string& key)\n{\n    this->unset(ZendString(key).get());\n}\n\nvoid phpcxx::Array::unset(const ZendString& key)\n{\n    this->unset(key.get());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\n *\n * Software License Agreement (BSD License)\n *\n *  Copyright (c) 2014, Robert Bosch LLC.\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 Robert Bosch 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\n#include <ros\/ros.h>\n#include <sensor_msgs\/fill_image.h>\n#include <usb_cam\/usb_cam.h>\n#include <image_transport\/image_transport.h>\n#include <camera_info_manager\/camera_info_manager.h>\n#include <sstream>\n\nclass UsbCamNode\n{\npublic:\n  \/\/ private ROS node handle\n  ros::NodeHandle node_;\n\n  \/\/ shared image message\n  sensor_msgs::Image img_;\n  usb_cam_camera_image_t *camera_image_;\n  image_transport::CameraPublisher image_pub_;\n\n  \/\/ parameters\n  std::string video_device_name_, io_method_name_, pixel_format_name_, camera_name_, camera_info_url_;\n  int image_width_, image_height_, framerate_, exposure_, brightness_, contrast_, saturation_, sharpness_, focus_,\n      white_balance_;\n  bool autofocus_, autoexposure_, auto_white_balance_;\n  boost::shared_ptr<camera_info_manager::CameraInfoManager> cinfo_;\n\n  UsbCamNode() :\n      node_(\"~\")\n  {\n    \/\/ advertise the main image topic\n    image_transport::ImageTransport it(node_);\n    image_pub_ = it.advertiseCamera(\"image_raw\", 1);\n\n    \/\/ grab the parameters\n    node_.param(\"video_device\", video_device_name_, std::string(\"\/dev\/video0\"));\n    node_.param(\"brightness\", brightness_, 128); \/\/0-255\n    node_.param(\"contrast\", contrast_, 32); \/\/0-255\n    node_.param(\"saturation\", saturation_, 32); \/\/0-255\n    node_.param(\"sharpness\", sharpness_, 22); \/\/0-255\n    \/\/ possible values: mmap, read, userptr\n    node_.param(\"io_method\", io_method_name_, std::string(\"mmap\"));\n    node_.param(\"image_width\", image_width_, 640);\n    node_.param(\"image_height\", image_height_, 480);\n    node_.param(\"framerate\", framerate_, 30);\n    \/\/ possible values: yuyv, uyvy, mjpeg, yuvmono10, rgb24\n    node_.param(\"pixel_format\", pixel_format_name_, std::string(\"mjpeg\"));\n    \/\/ enable\/disable autofocus\n    node_.param(\"autofocus\", autofocus_, false);\n    node_.param(\"focus\", focus_, 51);\n    \/\/ enable\/disable autoexposure\n    node_.param(\"autoexposure\", autoexposure_, true);\n    node_.param(\"exposure\", exposure_, 100);\n    \/\/ enable\/disable auto white balance temperature\n    node_.param(\"auto_white_balance\", auto_white_balance_, true);\n    node_.param(\"white_balance\", white_balance_, 4000);\n\n    \/\/ load the camera info\n    node_.param(\"camera_frame_id\", img_.header.frame_id, std::string(\"head_camera\"));\n    node_.param(\"camera_name\", camera_name_, std::string(\"head_camera\"));\n    node_.param(\"camera_info_url\", camera_info_url_, std::string(\"\"));\n    cinfo_.reset(new camera_info_manager::CameraInfoManager(node_, camera_name_, camera_info_url_));\n\n    ROS_INFO(\"Starting '%s' (%s) at %dx%d via %s (%s) at %i FPS\", camera_name_.c_str(), video_device_name_.c_str(),\n             image_width_, image_height_, io_method_name_.c_str(), pixel_format_name_.c_str(), framerate_);\n\n    \/\/ set the IO method\n    usb_cam_io_method io_method;\n    if (io_method_name_ == \"mmap\")\n      io_method = IO_METHOD_MMAP;\n    else if (io_method_name_ == \"read\")\n      io_method = IO_METHOD_READ;\n    else if (io_method_name_ == \"userptr\")\n      io_method = IO_METHOD_USERPTR;\n    else\n    {\n      ROS_FATAL(\"Unknown IO method '%s'\", io_method_name_.c_str());\n      node_.shutdown();\n      return;\n    }\n\n    \/\/ set the pixel format\n    usb_cam_pixel_format pixel_format;\n    if (pixel_format_name_ == \"yuyv\")\n      pixel_format = PIXEL_FORMAT_YUYV;\n    else if (pixel_format_name_ == \"uyvy\")\n      pixel_format = PIXEL_FORMAT_UYVY;\n    else if (pixel_format_name_ == \"mjpeg\")\n      pixel_format = PIXEL_FORMAT_MJPEG;\n    else if (pixel_format_name_ == \"yuvmono10\")\n      pixel_format = PIXEL_FORMAT_YUVMONO10;\n    else if (pixel_format_name_ == \"rgb24\")\n      pixel_format = PIXEL_FORMAT_RGB24;\n    else\n    {\n      ROS_FATAL(\"Unknown pixel format '%s'\", pixel_format_name_.c_str());\n      node_.shutdown();\n      return;\n    }\n\n    \/\/ start the camera\n    camera_image_ = usb_cam_camera_start(video_device_name_.c_str(), io_method, pixel_format, image_width_,\n                                         image_height_, framerate_);\n\n    \/\/ set camera parameters\n    std::stringstream paramstream;\n    paramstream << \"brightness=\" << brightness_;\n    this->set_v4l_parameters(video_device_name_, paramstream.str());\n    paramstream.str(\"\");\n    paramstream << \"contrast=\" << contrast_;\n    this->set_v4l_parameters(video_device_name_, paramstream.str());\n    paramstream.str(\"\");\n    paramstream << \"saturation=\" << saturation_;\n    this->set_v4l_parameters(video_device_name_, paramstream.str());\n    paramstream.str(\"\");\n    paramstream << \"sharpness=\" << sharpness_;\n    this->set_v4l_parameters(video_device_name_, paramstream.str());\n\n    \/\/ check auto white balance\n    if (!auto_white_balance_)\n    {\n      this->set_v4l_parameters(video_device_name_, \"white_balance_temperature_auto=0\");\n      std::stringstream ss;\n      ss << \"white_balance_temperature=\" << white_balance_;\n      this->set_v4l_parameters(video_device_name_, ss.str());\n    }\n\n    \/\/ check auto exposure\n    if (!autoexposure_)\n    {\n      \/\/ turn down exposure control (from max of 3)\n      this->set_v4l_parameters(video_device_name_, \"exposure_auto=1\");\n      \/\/ change the exposure level\n      std::stringstream ss;\n      ss << \"exposure_absolute=\" << exposure_;\n      this->set_v4l_parameters(video_device_name_, ss.str());\n    }\n\n    \/\/ check auto focus\n    if (autofocus_)\n    {\n      usb_cam_camera_set_auto_focus(1);\n      this->set_v4l_parameters(video_device_name_, \"focus_auto=1\");\n    }\n    else\n    {\n      this->set_v4l_parameters(video_device_name_, \"focus_auto=0\");\n      std::stringstream ss;\n      ss << \"focus_absolute=\" << focus_;\n      this->set_v4l_parameters(video_device_name_, ss.str());\n    }\n  }\n\n  virtual ~UsbCamNode()\n  {\n    usb_cam_camera_shutdown();\n  }\n\n  bool take_and_send_image()\n  {\n    \/\/ grab the image\n    usb_cam_camera_grab_image(camera_image_);\n    \/\/ fill the info\n    fillImage(img_, \"rgb8\", camera_image_->height, camera_image_->width, 3 * camera_image_->width,\n              camera_image_->image);\n    \/\/ stamp the image\n    img_.header.stamp = ros::Time::now();\n\n    \/\/ grab the camera info\n    sensor_msgs::CameraInfoPtr ci(new sensor_msgs::CameraInfo(cinfo_->getCameraInfo()));\n    ci->header.frame_id = img_.header.frame_id;\n    ci->header.stamp = img_.header.stamp;\n\n    \/\/ publish the image\n    image_pub_.publish(img_, *ci);\n\n    return true;\n  }\n\n  bool spin()\n  {\n    ros::Rate loop_rate(this->framerate_);\n    while (node_.ok())\n    {\n      if (!take_and_send_image())\n        ROS_WARN(\"USB camera did not respond in time.\");\n      ros::spinOnce();\n      loop_rate.sleep();\n    }\n    return true;\n  }\n\nprivate:\n\n  \/**\n   * Set video device parameters via calls to v4l-utils.\n   *\n   * @param dev The device (e.g., \"\/dev\/video0\")\n   * @param param The full parameter to set (e.g., \"focus_auto=1\")\n   *\/\n  void set_v4l_parameters(std::string dev, std::string param)\n  {\n    \/\/ build the command\n    std::stringstream ss;\n    ss << \"v4l2-ctl --device=\" << dev << \" -c \" << param << \" 2>&1\";\n    std::string cmd = ss.str();\n\n    \/\/ capture the output\n    std::string output;\n    int buffer_size = 256;\n    char buffer[buffer_size];\n    FILE *stream = popen(cmd.c_str(), \"r\");\n    if (stream)\n    {\n      while (!feof(stream))\n        if (fgets(buffer, buffer_size, stream) != NULL)\n          output.append(buffer);\n      pclose(stream);\n      \/\/ any output should be an error\n      if (output.length() > 0)\n        ROS_WARN(\"%s\", output.c_str());\n    }\n    else\n      ROS_WARN(\"usb_cam_node could not run '%s'\", cmd.c_str());\n  }\n};\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"usb_cam\");\n  UsbCamNode a;\n  a.spin();\n  return EXIT_SUCCESS;\n}\n<commit_msg>Parameter to enable\/disable auto white balance<commit_after>\/*********************************************************************\n *\n * Software License Agreement (BSD License)\n *\n *  Copyright (c) 2014, Robert Bosch LLC.\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 Robert Bosch 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\n#include <ros\/ros.h>\n#include <sensor_msgs\/fill_image.h>\n#include <usb_cam\/usb_cam.h>\n#include <image_transport\/image_transport.h>\n#include <camera_info_manager\/camera_info_manager.h>\n#include <sstream>\n\nclass UsbCamNode\n{\npublic:\n  \/\/ private ROS node handle\n  ros::NodeHandle node_;\n\n  \/\/ shared image message\n  sensor_msgs::Image img_;\n  usb_cam_camera_image_t *camera_image_;\n  image_transport::CameraPublisher image_pub_;\n\n  \/\/ parameters\n  std::string video_device_name_, io_method_name_, pixel_format_name_, camera_name_, camera_info_url_;\n  int image_width_, image_height_, framerate_, exposure_, brightness_, contrast_, saturation_, sharpness_, focus_,\n      white_balance_;\n  bool autofocus_, autoexposure_, auto_white_balance_;\n  boost::shared_ptr<camera_info_manager::CameraInfoManager> cinfo_;\n\n  UsbCamNode() :\n      node_(\"~\")\n  {\n    \/\/ advertise the main image topic\n    image_transport::ImageTransport it(node_);\n    image_pub_ = it.advertiseCamera(\"image_raw\", 1);\n\n    \/\/ grab the parameters\n    node_.param(\"video_device\", video_device_name_, std::string(\"\/dev\/video0\"));\n    node_.param(\"brightness\", brightness_, 128); \/\/0-255\n    node_.param(\"contrast\", contrast_, 32); \/\/0-255\n    node_.param(\"saturation\", saturation_, 32); \/\/0-255\n    node_.param(\"sharpness\", sharpness_, 22); \/\/0-255\n    \/\/ possible values: mmap, read, userptr\n    node_.param(\"io_method\", io_method_name_, std::string(\"mmap\"));\n    node_.param(\"image_width\", image_width_, 640);\n    node_.param(\"image_height\", image_height_, 480);\n    node_.param(\"framerate\", framerate_, 30);\n    \/\/ possible values: yuyv, uyvy, mjpeg, yuvmono10, rgb24\n    node_.param(\"pixel_format\", pixel_format_name_, std::string(\"mjpeg\"));\n    \/\/ enable\/disable autofocus\n    node_.param(\"autofocus\", autofocus_, false);\n    node_.param(\"focus\", focus_, 51);\n    \/\/ enable\/disable autoexposure\n    node_.param(\"autoexposure\", autoexposure_, true);\n    node_.param(\"exposure\", exposure_, 100);\n    \/\/ enable\/disable auto white balance temperature\n    node_.param(\"auto_white_balance\", auto_white_balance_, true);\n    node_.param(\"white_balance\", white_balance_, 4000);\n\n    \/\/ load the camera info\n    node_.param(\"camera_frame_id\", img_.header.frame_id, std::string(\"head_camera\"));\n    node_.param(\"camera_name\", camera_name_, std::string(\"head_camera\"));\n    node_.param(\"camera_info_url\", camera_info_url_, std::string(\"\"));\n    cinfo_.reset(new camera_info_manager::CameraInfoManager(node_, camera_name_, camera_info_url_));\n\n    ROS_INFO(\"Starting '%s' (%s) at %dx%d via %s (%s) at %i FPS\", camera_name_.c_str(), video_device_name_.c_str(),\n             image_width_, image_height_, io_method_name_.c_str(), pixel_format_name_.c_str(), framerate_);\n\n    \/\/ set the IO method\n    usb_cam_io_method io_method;\n    if (io_method_name_ == \"mmap\")\n      io_method = IO_METHOD_MMAP;\n    else if (io_method_name_ == \"read\")\n      io_method = IO_METHOD_READ;\n    else if (io_method_name_ == \"userptr\")\n      io_method = IO_METHOD_USERPTR;\n    else\n    {\n      ROS_FATAL(\"Unknown IO method '%s'\", io_method_name_.c_str());\n      node_.shutdown();\n      return;\n    }\n\n    \/\/ set the pixel format\n    usb_cam_pixel_format pixel_format;\n    if (pixel_format_name_ == \"yuyv\")\n      pixel_format = PIXEL_FORMAT_YUYV;\n    else if (pixel_format_name_ == \"uyvy\")\n      pixel_format = PIXEL_FORMAT_UYVY;\n    else if (pixel_format_name_ == \"mjpeg\")\n      pixel_format = PIXEL_FORMAT_MJPEG;\n    else if (pixel_format_name_ == \"yuvmono10\")\n      pixel_format = PIXEL_FORMAT_YUVMONO10;\n    else if (pixel_format_name_ == \"rgb24\")\n      pixel_format = PIXEL_FORMAT_RGB24;\n    else\n    {\n      ROS_FATAL(\"Unknown pixel format '%s'\", pixel_format_name_.c_str());\n      node_.shutdown();\n      return;\n    }\n\n    \/\/ start the camera\n    camera_image_ = usb_cam_camera_start(video_device_name_.c_str(), io_method, pixel_format, image_width_,\n                                         image_height_, framerate_);\n\n    \/\/ set camera parameters\n    std::stringstream paramstream;\n    paramstream << \"brightness=\" << brightness_;\n    this->set_v4l_parameters(video_device_name_, paramstream.str());\n    paramstream.str(\"\");\n    paramstream << \"contrast=\" << contrast_;\n    this->set_v4l_parameters(video_device_name_, paramstream.str());\n    paramstream.str(\"\");\n    paramstream << \"saturation=\" << saturation_;\n    this->set_v4l_parameters(video_device_name_, paramstream.str());\n    paramstream.str(\"\");\n    paramstream << \"sharpness=\" << sharpness_;\n    this->set_v4l_parameters(video_device_name_, paramstream.str());\n\n    \/\/ check auto white balance\n    if (auto_white_balance_)\n    {\n      this->set_v4l_parameters(video_device_name_, \"white_balance_temperature_auto=1\");\n    }\n    else\n    {\n      this->set_v4l_parameters(video_device_name_, \"white_balance_temperature_auto=0\");\n      std::stringstream ss;\n      ss << \"white_balance_temperature=\" << white_balance_;\n      this->set_v4l_parameters(video_device_name_, ss.str());\n    }\n\n    \/\/ check auto exposure\n    if (!autoexposure_)\n    {\n      \/\/ turn down exposure control (from max of 3)\n      this->set_v4l_parameters(video_device_name_, \"exposure_auto=1\");\n      \/\/ change the exposure level\n      std::stringstream ss;\n      ss << \"exposure_absolute=\" << exposure_;\n      this->set_v4l_parameters(video_device_name_, ss.str());\n    }\n\n    \/\/ check auto focus\n    if (autofocus_)\n    {\n      usb_cam_camera_set_auto_focus(1);\n      this->set_v4l_parameters(video_device_name_, \"focus_auto=1\");\n    }\n    else\n    {\n      this->set_v4l_parameters(video_device_name_, \"focus_auto=0\");\n      std::stringstream ss;\n      ss << \"focus_absolute=\" << focus_;\n      this->set_v4l_parameters(video_device_name_, ss.str());\n    }\n  }\n\n  virtual ~UsbCamNode()\n  {\n    usb_cam_camera_shutdown();\n  }\n\n  bool take_and_send_image()\n  {\n    \/\/ grab the image\n    usb_cam_camera_grab_image(camera_image_);\n    \/\/ fill the info\n    fillImage(img_, \"rgb8\", camera_image_->height, camera_image_->width, 3 * camera_image_->width,\n              camera_image_->image);\n    \/\/ stamp the image\n    img_.header.stamp = ros::Time::now();\n\n    \/\/ grab the camera info\n    sensor_msgs::CameraInfoPtr ci(new sensor_msgs::CameraInfo(cinfo_->getCameraInfo()));\n    ci->header.frame_id = img_.header.frame_id;\n    ci->header.stamp = img_.header.stamp;\n\n    \/\/ publish the image\n    image_pub_.publish(img_, *ci);\n\n    return true;\n  }\n\n  bool spin()\n  {\n    ros::Rate loop_rate(this->framerate_);\n    while (node_.ok())\n    {\n      if (!take_and_send_image())\n        ROS_WARN(\"USB camera did not respond in time.\");\n      ros::spinOnce();\n      loop_rate.sleep();\n    }\n    return true;\n  }\n\nprivate:\n\n  \/**\n   * Set video device parameters via calls to v4l-utils.\n   *\n   * @param dev The device (e.g., \"\/dev\/video0\")\n   * @param param The full parameter to set (e.g., \"focus_auto=1\")\n   *\/\n  void set_v4l_parameters(std::string dev, std::string param)\n  {\n    \/\/ build the command\n    std::stringstream ss;\n    ss << \"v4l2-ctl --device=\" << dev << \" -c \" << param << \" 2>&1\";\n    std::string cmd = ss.str();\n\n    \/\/ capture the output\n    std::string output;\n    int buffer_size = 256;\n    char buffer[buffer_size];\n    FILE *stream = popen(cmd.c_str(), \"r\");\n    if (stream)\n    {\n      while (!feof(stream))\n        if (fgets(buffer, buffer_size, stream) != NULL)\n          output.append(buffer);\n      pclose(stream);\n      \/\/ any output should be an error\n      if (output.length() > 0)\n        ROS_WARN(\"%s\", output.c_str());\n    }\n    else\n      ROS_WARN(\"usb_cam_node could not run '%s'\", cmd.c_str());\n  }\n};\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"usb_cam\");\n  UsbCamNode a;\n  a.spin();\n  return EXIT_SUCCESS;\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\/\/\/ \\file\n\/\/\/ Tests for the SixenseDevice class.\n\n#include <memory>\n#include <string>\n#include <boost\/thread.hpp>\n#include <boost\/chrono.hpp>\n#include <gtest\/gtest.h>\n#include \"SurgSim\/Devices\/Sixense\/SixenseDevice.h\"\n\/\/#include \"SurgSim\/Devices\/Sixense\/SixenseScaffold.h\"  \/\/ only needed if calling SixenseScaffold::setDefaultLogLevel()\n#include \"SurgSim\/DataStructures\/DataGroup.h\"\n#include \"SurgSim\/Input\/InputConsumerInterface.h\"\n#include \"SurgSim\/Input\/OutputProducerInterface.h\"\n#include \"SurgSim\/Math\/RigidTransform.h\"\n#include \"SurgSim\/Math\/Matrix.h\"\n\nusing SurgSim::Device::SixenseDevice;\nusing SurgSim::Device::SixenseScaffold;\nusing SurgSim::DataStructures::DataGroup;\nusing SurgSim::Input::InputConsumerInterface;\nusing SurgSim::Input::OutputProducerInterface;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::Matrix44d;\n\n\nstruct TestListener : public InputConsumerInterface, public OutputProducerInterface\n{\npublic:\n\tTestListener() :\n\t\tm_numTimesInitializedInput(0),\n\t\tm_numTimesReceivedInput(0),\n\t\tm_numTimesRequestedOutput(0)\n\t{\n\t}\n\n\tvirtual void initializeInput(const std::string& device, const DataGroup& inputData);\n\tvirtual void handleInput(const std::string& device, const DataGroup& inputData);\n\tvirtual bool requestOutput(const std::string& device, DataGroup* outputData);\n\n\tint m_numTimesInitializedInput;\n\tint m_numTimesReceivedInput;\n\tint m_numTimesRequestedOutput;\n\tDataGroup m_lastReceivedInput;\n};\n\nvoid TestListener::initializeInput(const std::string& device, const DataGroup& inputData)\n{\n\t++m_numTimesInitializedInput;\n}\n\nvoid TestListener::handleInput(const std::string& device, const DataGroup& inputData)\n{\n\t++m_numTimesReceivedInput;\n\tm_lastReceivedInput = inputData;\n}\n\nbool TestListener::requestOutput(const std::string& device, DataGroup* outputData)\n{\n\t++m_numTimesRequestedOutput;\n\treturn false;\n}\n\n\nTEST(SixenseDeviceTest, CreateUninitializedDevice)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n}\n\nTEST(SixenseDeviceTest, CreateAndInitializeDevice)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\tEXPECT_FALSE(device->isInitialized());\n\tASSERT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\tEXPECT_TRUE(device->isInitialized());\n}\n\nTEST(SixenseDeviceTest, Name)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\tEXPECT_EQ(\"TestSixense\", device->getName());\n\tEXPECT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\tEXPECT_EQ(\"TestSixense\", device->getName());\n}\n\nTEST(SixenseDeviceTest, CreateDeviceSeveralTimes)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tfor (int i = 0;  i < 6;  ++i)\n\t{\n\t\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\t\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\t\tASSERT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\t\t\/\/ the device will be destroyed here\n\t}\n}\n\nTEST(SixenseDeviceTest, CreateSeveralDevices)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device1 = std::make_shared<SixenseDevice>(\"Sixense1\");\n\tASSERT_TRUE(device1 != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device1->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\n\tstd::shared_ptr<SixenseDevice> device2 = std::make_shared<SixenseDevice>(\"Sixense1\");\n\tASSERT_TRUE(device2 != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device2->initialize()) << \"Initialization failed for second controller.\" <<\n\t\t\"  Is only one controller plugged in?\";\n\n\t\/\/ We can't check what happens with the scaffolds, since those are no longer a part of the device's API...\n\n\tstd::shared_ptr<SixenseDevice> device3 = std::make_shared<SixenseDevice>(\"Sixense3\");\n\tASSERT_TRUE(device3 != nullptr) << \"Device creation failed.\";\n\tif (! device3->initialize())\n\t{\n\t\tstd::cerr << \"[Warning: third Sixense\/Hydra controller did not come up; is it plugged in?]\" << std::endl;\n\t}\n}\n\n\/\/ Create a string representation from an int.\n\/\/ C++11 adds std::to_string() to do this for various types, but VS2010 only half-supports that.\ntemplate <typename T>\ninline std::string makeString(T value)\n{\n\tstd::ostringstream out;\n\tout << value;\n\treturn out.str();\n}\n\nTEST(SixenseDeviceTest, CreateAllDevices)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::vector<std::shared_ptr<SixenseDevice>> devices;\n\n\tfor (int i = 1;  ;  ++i)\n\t{\n\t\tstd::string name = \"Sixense\" + makeString(i);\n\t\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(name);\n\t\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\t\tif (! device->initialize())\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tdevices.emplace_back(std::move(device));\n\t}\n\n\tstd::cout << devices.size() << \" devices initialized.\" << std::endl;\n\tASSERT_GT(devices.size(), 0U) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\tEXPECT_GT(devices.size(), 1U) << \"Controller #2 initialization failed.  Is only one controller plugged in?\";\n}\n\nTEST(SixenseDeviceTest, InputConsumer)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\n\tstd::shared_ptr<TestListener> consumer = std::make_shared<TestListener>();\n\tEXPECT_EQ(0, consumer->m_numTimesInitializedInput);\n\tEXPECT_EQ(0, consumer->m_numTimesReceivedInput);\n\n\tEXPECT_FALSE(device->removeInputConsumer(consumer));\n\tEXPECT_EQ(0, consumer->m_numTimesInitializedInput);\n\tEXPECT_EQ(0, consumer->m_numTimesReceivedInput);\n\n\tEXPECT_TRUE(device->addInputConsumer(consumer));\n\n\t\/\/ Adding the same input consumer again should fail.\n\tEXPECT_FALSE(device->addInputConsumer(consumer));\n\n\t\/\/ Sleep for a second, to see how many times the consumer is invoked.\n\t\/\/ (A Sixense device updates internally at 60Hz, but our code currently runs at 120Hz to reduce latency.)\n\tboost::this_thread::sleep_until(boost::chrono::steady_clock::now() + boost::chrono::milliseconds(1000));\n\n\tEXPECT_TRUE(device->removeInputConsumer(consumer));\n\n\t\/\/ Removing the same input consumer again should fail.\n\tEXPECT_FALSE(device->removeInputConsumer(consumer));\n\n\t\/\/ Check the number of invocations.\n\tEXPECT_EQ(1, consumer->m_numTimesInitializedInput);\n\tEXPECT_GE(consumer->m_numTimesReceivedInput, 100);\n\tEXPECT_LE(consumer->m_numTimesReceivedInput, 140);\n\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.poses().hasData(\"pose\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.scalars().hasData(\"trigger\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.scalars().hasData(\"joystickX\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.scalars().hasData(\"joystickY\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"buttonTrigger\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"buttonBumper\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"button1\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"button2\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"button3\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"button4\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"buttonStart\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"buttonJoystick\"));\n}\n\nTEST(SixenseDeviceTest, OutputProducer)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\n\tstd::shared_ptr<TestListener> producer = std::make_shared<TestListener>();\n\tEXPECT_EQ(0, producer->m_numTimesRequestedOutput);\n\n\tEXPECT_FALSE(device->removeOutputProducer(producer));\n\tEXPECT_EQ(0, producer->m_numTimesRequestedOutput);\n\n\tEXPECT_TRUE(device->setOutputProducer(producer));\n\n\t\/\/ Sleep for a second, to see how many times the producer is invoked.\n\t\/\/ (A Sixense device is does not request any output.)\n\tboost::this_thread::sleep_until(boost::chrono::steady_clock::now() + boost::chrono::milliseconds(1000));\n\n\tEXPECT_TRUE(device->removeOutputProducer(producer));\n\n\t\/\/ Removing the same input producer again should fail.\n\tEXPECT_FALSE(device->removeOutputProducer(producer));\n\n\t\/\/ Check the number of invocations.\n\tEXPECT_EQ(0, producer->m_numTimesRequestedOutput);\n}\n<commit_msg>Add test for uniqueness of device names.<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\/\/\/ \\file\n\/\/\/ Tests for the SixenseDevice class.\n\n#include <memory>\n#include <string>\n#include <boost\/thread.hpp>\n#include <boost\/chrono.hpp>\n#include <gtest\/gtest.h>\n#include \"SurgSim\/Devices\/Sixense\/SixenseDevice.h\"\n\/\/#include \"SurgSim\/Devices\/Sixense\/SixenseScaffold.h\"  \/\/ only needed if calling SixenseScaffold::setDefaultLogLevel()\n#include \"SurgSim\/DataStructures\/DataGroup.h\"\n#include \"SurgSim\/Input\/InputConsumerInterface.h\"\n#include \"SurgSim\/Input\/OutputProducerInterface.h\"\n#include \"SurgSim\/Math\/RigidTransform.h\"\n#include \"SurgSim\/Math\/Matrix.h\"\n\nusing SurgSim::Device::SixenseDevice;\nusing SurgSim::Device::SixenseScaffold;\nusing SurgSim::DataStructures::DataGroup;\nusing SurgSim::Input::InputConsumerInterface;\nusing SurgSim::Input::OutputProducerInterface;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::Matrix44d;\n\n\nstruct TestListener : public InputConsumerInterface, public OutputProducerInterface\n{\npublic:\n\tTestListener() :\n\t\tm_numTimesInitializedInput(0),\n\t\tm_numTimesReceivedInput(0),\n\t\tm_numTimesRequestedOutput(0)\n\t{\n\t}\n\n\tvirtual void initializeInput(const std::string& device, const DataGroup& inputData);\n\tvirtual void handleInput(const std::string& device, const DataGroup& inputData);\n\tvirtual bool requestOutput(const std::string& device, DataGroup* outputData);\n\n\tint m_numTimesInitializedInput;\n\tint m_numTimesReceivedInput;\n\tint m_numTimesRequestedOutput;\n\tDataGroup m_lastReceivedInput;\n};\n\nvoid TestListener::initializeInput(const std::string& device, const DataGroup& inputData)\n{\n\t++m_numTimesInitializedInput;\n}\n\nvoid TestListener::handleInput(const std::string& device, const DataGroup& inputData)\n{\n\t++m_numTimesReceivedInput;\n\tm_lastReceivedInput = inputData;\n}\n\nbool TestListener::requestOutput(const std::string& device, DataGroup* outputData)\n{\n\t++m_numTimesRequestedOutput;\n\treturn false;\n}\n\n\nTEST(SixenseDeviceTest, CreateUninitializedDevice)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n}\n\nTEST(SixenseDeviceTest, CreateAndInitializeDevice)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\tEXPECT_FALSE(device->isInitialized());\n\tASSERT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\tEXPECT_TRUE(device->isInitialized());\n}\n\nTEST(SixenseDeviceTest, Name)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\tEXPECT_EQ(\"TestSixense\", device->getName());\n\tEXPECT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\tEXPECT_EQ(\"TestSixense\", device->getName());\n}\n\nTEST(SixenseDeviceTest, CreateDeviceSeveralTimes)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tfor (int i = 0;  i < 6;  ++i)\n\t{\n\t\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\t\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\t\tASSERT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\t\t\/\/ the device will be destroyed here\n\t}\n}\n\nTEST(SixenseDeviceTest, CreateSeveralDevices)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device1 = std::make_shared<SixenseDevice>(\"Sixense1\");\n\tASSERT_TRUE(device1 != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device1->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\n\tstd::shared_ptr<SixenseDevice> device2 = std::make_shared<SixenseDevice>(\"Sixense2\");\n\tASSERT_TRUE(device2 != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device2->initialize()) << \"Initialization failed for second controller.\" <<\n\t\t\"  Is only one controller plugged in?\";\n\n\t\/\/ We can't check what happens with the scaffolds, since those are no longer a part of the device's API...\n\n\tstd::shared_ptr<SixenseDevice> device3 = std::make_shared<SixenseDevice>(\"Sixense3\");\n\tASSERT_TRUE(device3 != nullptr) << \"Device creation failed.\";\n\tif (! device3->initialize())\n\t{\n\t\tstd::cerr << \"[Warning: third Sixense\/Hydra controller did not come up; is it plugged in?]\" << std::endl;\n\t}\n}\n\nTEST(SixenseDeviceTest, CreateDevicesWithSameName)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device1 = std::make_shared<SixenseDevice>(\"Sixense\");\n\tASSERT_TRUE(device1 != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device1->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\n\tstd::shared_ptr<SixenseDevice> device2 = std::make_shared<SixenseDevice>(\"Sixense\");\n\tASSERT_TRUE(device2 != nullptr) << \"Device creation failed.\";\n\tASSERT_FALSE(device2->initialize()) << \"Initialization succeeded despite duplicate name.\";\n}\n\n\/\/ Create a string representation from an int.\n\/\/ C++11 adds std::to_string() to do this for various types, but VS2010 only half-supports that.\ntemplate <typename T>\ninline std::string makeString(T value)\n{\n\tstd::ostringstream out;\n\tout << value;\n\treturn out.str();\n}\n\nTEST(SixenseDeviceTest, CreateAllDevices)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::vector<std::shared_ptr<SixenseDevice>> devices;\n\n\tfor (int i = 1;  ;  ++i)\n\t{\n\t\tstd::string name = \"Sixense\" + makeString(i);\n\t\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(name);\n\t\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\t\tif (! device->initialize())\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tdevices.emplace_back(std::move(device));\n\t}\n\n\tstd::cout << devices.size() << \" devices initialized.\" << std::endl;\n\tASSERT_GT(devices.size(), 0U) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\tEXPECT_GT(devices.size(), 1U) << \"Controller #2 initialization failed.  Is only one controller plugged in?\";\n}\n\nTEST(SixenseDeviceTest, InputConsumer)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\n\tstd::shared_ptr<TestListener> consumer = std::make_shared<TestListener>();\n\tEXPECT_EQ(0, consumer->m_numTimesInitializedInput);\n\tEXPECT_EQ(0, consumer->m_numTimesReceivedInput);\n\n\tEXPECT_FALSE(device->removeInputConsumer(consumer));\n\tEXPECT_EQ(0, consumer->m_numTimesInitializedInput);\n\tEXPECT_EQ(0, consumer->m_numTimesReceivedInput);\n\n\tEXPECT_TRUE(device->addInputConsumer(consumer));\n\n\t\/\/ Adding the same input consumer again should fail.\n\tEXPECT_FALSE(device->addInputConsumer(consumer));\n\n\t\/\/ Sleep for a second, to see how many times the consumer is invoked.\n\t\/\/ (A Sixense device updates internally at 60Hz, but our code currently runs at 120Hz to reduce latency.)\n\tboost::this_thread::sleep_until(boost::chrono::steady_clock::now() + boost::chrono::milliseconds(1000));\n\n\tEXPECT_TRUE(device->removeInputConsumer(consumer));\n\n\t\/\/ Removing the same input consumer again should fail.\n\tEXPECT_FALSE(device->removeInputConsumer(consumer));\n\n\t\/\/ Check the number of invocations.\n\tEXPECT_EQ(1, consumer->m_numTimesInitializedInput);\n\tEXPECT_GE(consumer->m_numTimesReceivedInput, 100);\n\tEXPECT_LE(consumer->m_numTimesReceivedInput, 140);\n\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.poses().hasData(\"pose\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.scalars().hasData(\"trigger\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.scalars().hasData(\"joystickX\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.scalars().hasData(\"joystickY\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"buttonTrigger\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"buttonBumper\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"button1\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"button2\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"button3\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"button4\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"buttonStart\"));\n\tEXPECT_TRUE(consumer->m_lastReceivedInput.booleans().hasData(\"buttonJoystick\"));\n}\n\nTEST(SixenseDeviceTest, OutputProducer)\n{\n\t\/\/SixenseScaffold::setDefaultLogLevel(SurgSim::Framework::LOG_LEVEL_DEBUG);\n\tstd::shared_ptr<SixenseDevice> device = std::make_shared<SixenseDevice>(\"TestSixense\");\n\tASSERT_TRUE(device != nullptr) << \"Device creation failed.\";\n\tASSERT_TRUE(device->initialize()) << \"Initialization failed.  Is a Sixense\/Hydra device plugged in?\";\n\n\tstd::shared_ptr<TestListener> producer = std::make_shared<TestListener>();\n\tEXPECT_EQ(0, producer->m_numTimesRequestedOutput);\n\n\tEXPECT_FALSE(device->removeOutputProducer(producer));\n\tEXPECT_EQ(0, producer->m_numTimesRequestedOutput);\n\n\tEXPECT_TRUE(device->setOutputProducer(producer));\n\n\t\/\/ Sleep for a second, to see how many times the producer is invoked.\n\t\/\/ (A Sixense device is does not request any output.)\n\tboost::this_thread::sleep_until(boost::chrono::steady_clock::now() + boost::chrono::milliseconds(1000));\n\n\tEXPECT_TRUE(device->removeOutputProducer(producer));\n\n\t\/\/ Removing the same input producer again should fail.\n\tEXPECT_FALSE(device->removeOutputProducer(producer));\n\n\t\/\/ Check the number of invocations.\n\tEXPECT_EQ(0, producer->m_numTimesRequestedOutput);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tenh\/implementation\/alt.hpp by Victor Dods, created 2013\/09\/26\n\/\/ Copyright Leap Motion Inc.\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef TENH_IMPLEMENTATION_ALT_HPP_\n#define TENH_IMPLEMENTATION_ALT_HPP_\n\n#include \"tenh\/core.hpp\"\n\n#include \"tenh\/conceptual\/exteriorpower.hpp\"\n#include \"tenh\/implementation\/tensor.hpp\"\n#include \"tenh\/implementation\/wedge.hpp\"\n\nnamespace Tenh {\n\nnamespace ComponentGeneratorEvaluator {\n\n\/\/ this would be better defined as a private static method in Alt_f below, but g++\n\/\/ complains about that being invalid in a const expression (whereas clang++ is fine with it)\ntemplate <Uint32 ORDER_, typename Factor_, Uint32 COMPONENT_COUNT_, typename Scalar_>\nScalar_ alt (ComponentIndex_t<COMPONENT_COUNT_> const &i)\n{\n    typedef ComponentIndex_t<COMPONENT_COUNT_> ComponentIndex;\n    typedef ExteriorPowerOfBasedVectorSpace_c<ORDER_,Factor_> ExteriorPower;\n    typedef typename TensorPowerOfBasedVectorSpace_f<ORDER_,Factor_>::T TensorPower;\n    typedef TypeList_t<ExteriorPower,\n            TypeList_t<typename DualOf_f<TensorPower>::T> > FactorTypeList;\n    typedef TensorProductOfBasedVectorSpaces_c<FactorTypeList> Projection;\n    STATIC_ASSERT(DimensionOf_f<Projection>::V == COMPONENT_COUNT_, DIMENSIONS_MUST_MATCH);\n\n    \/\/ for using bundle_index_map -- the use of UsePreallocatedArray is somewhat arbitrary,\n    \/\/ since only the static method bundle_index_map will be used.\n    typedef ImplementationOf_t<Projection,Scalar_,UsePreallocatedArray> BootstrappingImplementation;\n    typedef ImplementationOf_t<ExteriorPower,Scalar_,UsePreallocatedArray> Factor0BootstrappingImplementation;\n    typedef ImplementationOf_t<TensorPower,Scalar_,UsePreallocatedArray> Factor1BootstrappingImplementation;\n\n    typedef typename BootstrappingImplementation::MultiIndex MultiIndex;\n    typedef typename MultiIndex::IndexTypeList IndexTypeList;\n    STATIC_ASSERT(IndexTypeList::LENGTH == 2, LENGTH_MUST_BE_EXACTLY_2);\n    MultiIndex m(BootstrappingImplementation::template bundle_index_map<IndexTypeList,ComponentIndex>(i));\n\n    typedef typename Factor1BootstrappingImplementation::MultiIndex::IndexTypeList Factor1IndexTypeList;\n    STATIC_ASSERT(Factor1IndexTypeList::LENGTH == ORDER_, LENGTHS_MUST_BE_EQUAL);\n    typedef MultiIndex_t<Factor1IndexTypeList> TensorPowerMultiIndex;\n    typedef typename Factor1BootstrappingImplementation::ComponentIndex TensorPowerComponentIndex;\n    TensorPowerMultiIndex m1(Factor1BootstrappingImplementation::template bundle_index_map<Factor1IndexTypeList,TensorPowerComponentIndex>(m.template el<1>()));\n\n    \/\/ if there is no memory location for the multiindex value, the component is zero\n    if (Factor0BootstrappingImplementation::component_is_immutable_zero(m1))\n    {\n        return Scalar_(0);\n    }\n    \/\/ vector_index_of sorts the multiindex and returns the vector index -- if this\n    \/\/ matches the symmetric vector index, then return 1; otherwise 0.\n    else if (m.template el<0>() == Factor0BootstrappingImplementation::vector_index_of(m1))\n    {\n        typedef typename Factor0BootstrappingImplementation::MultiIndex ExteriorPowerMultiIndex;\n        typedef typename ExteriorPowerMultiIndex::IndexTypeList Factor0IndexTypeList;\n        typedef typename Factor0BootstrappingImplementation::ComponentIndex ExteriorPowerComponentIndex;\n        ExteriorPowerMultiIndex m0(Factor0BootstrappingImplementation::template bundle_index_map<Factor0IndexTypeList,ExteriorPowerComponentIndex>(m.template el<0>()));\n        return Factor0BootstrappingImplementation::scalar_factor_for_component(m1);\n    }\n    else\n    {\n        return Scalar_(0);\n    }\n}\n\n} \/\/ end of namespace ComponentGeneratorEvaluator\n\ntemplate <Uint32 ORDER_, typename Factor_>\nstruct AltId_t\n{\n    static std::string type_as_string () { return \"Alt<\" + AS_STRING(ORDER_) + ',' + TypeStringOf_t<Factor_>::eval() + '>'; }\n};\n\n\/\/ template specialization for standard inner product on a based vector space having orthonormal basis\ntemplate <Uint32 ORDER_, typename Factor_, typename Scalar_>\nstruct Alt_f\n{\nprivate:\n    typedef ExteriorPowerOfBasedVectorSpace_c<ORDER_,Factor_> ExteriorPower;\n    typedef typename TensorPowerOfBasedVectorSpace_f<ORDER_,Factor_>::T TensorPower;\n    typedef TypeList_t<ExteriorPower,\n            TypeList_t<typename DualOf_f<TensorPower>::T> > FactorTypeList;\n    typedef TensorProductOfBasedVectorSpaces_c<FactorTypeList> Projection;\n    typedef ComponentGenerator_t<Scalar_,\n                                 DimensionOf_f<Projection>::V,\n                                 ComponentGeneratorEvaluator::alt<ORDER_,Factor_,DimensionOf_f<Projection>::V,Scalar_>,\n                                 AltId_t<ORDER_,Factor_> > ComponentGenerator;\npublic:\n    typedef ImplementationOf_t<Projection,Scalar_,UseImmutableArray_t<ComponentGenerator> > T;\n};\n\n} \/\/ end of namespace Tenh\n\n#endif \/\/ TENH_IMPLEMENTATION_ALT_HPP_\n<commit_msg>Fixed an unused variable warning\/error.<commit_after>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tenh\/implementation\/alt.hpp by Victor Dods, created 2013\/09\/26\n\/\/ Copyright Leap Motion Inc.\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef TENH_IMPLEMENTATION_ALT_HPP_\n#define TENH_IMPLEMENTATION_ALT_HPP_\n\n#include \"tenh\/core.hpp\"\n\n#include \"tenh\/conceptual\/exteriorpower.hpp\"\n#include \"tenh\/implementation\/tensor.hpp\"\n#include \"tenh\/implementation\/wedge.hpp\"\n\nnamespace Tenh {\n\nnamespace ComponentGeneratorEvaluator {\n\n\/\/ this would be better defined as a private static method in Alt_f below, but g++\n\/\/ complains about that being invalid in a const expression (whereas clang++ is fine with it)\ntemplate <Uint32 ORDER_, typename Factor_, Uint32 COMPONENT_COUNT_, typename Scalar_>\nScalar_ alt (ComponentIndex_t<COMPONENT_COUNT_> const &i)\n{\n    typedef ComponentIndex_t<COMPONENT_COUNT_> ComponentIndex;\n    typedef ExteriorPowerOfBasedVectorSpace_c<ORDER_,Factor_> ExteriorPower;\n    typedef typename TensorPowerOfBasedVectorSpace_f<ORDER_,Factor_>::T TensorPower;\n    typedef TypeList_t<ExteriorPower,\n            TypeList_t<typename DualOf_f<TensorPower>::T> > FactorTypeList;\n    typedef TensorProductOfBasedVectorSpaces_c<FactorTypeList> Projection;\n    STATIC_ASSERT(DimensionOf_f<Projection>::V == COMPONENT_COUNT_, DIMENSIONS_MUST_MATCH);\n\n    \/\/ for using bundle_index_map -- the use of UsePreallocatedArray is somewhat arbitrary,\n    \/\/ since only the static method bundle_index_map will be used.\n    typedef ImplementationOf_t<Projection,Scalar_,UsePreallocatedArray> BootstrappingImplementation;\n    typedef ImplementationOf_t<ExteriorPower,Scalar_,UsePreallocatedArray> Factor0BootstrappingImplementation;\n    typedef ImplementationOf_t<TensorPower,Scalar_,UsePreallocatedArray> Factor1BootstrappingImplementation;\n\n    typedef typename BootstrappingImplementation::MultiIndex MultiIndex;\n    typedef typename MultiIndex::IndexTypeList IndexTypeList;\n    STATIC_ASSERT(IndexTypeList::LENGTH == 2, LENGTH_MUST_BE_EXACTLY_2);\n    MultiIndex m(BootstrappingImplementation::template bundle_index_map<IndexTypeList,ComponentIndex>(i));\n\n    typedef typename Factor1BootstrappingImplementation::MultiIndex::IndexTypeList Factor1IndexTypeList;\n    STATIC_ASSERT(Factor1IndexTypeList::LENGTH == ORDER_, LENGTHS_MUST_BE_EQUAL);\n    typedef MultiIndex_t<Factor1IndexTypeList> TensorPowerMultiIndex;\n    typedef typename Factor1BootstrappingImplementation::ComponentIndex TensorPowerComponentIndex;\n    TensorPowerMultiIndex m1(Factor1BootstrappingImplementation::template bundle_index_map<Factor1IndexTypeList,TensorPowerComponentIndex>(m.template el<1>()));\n\n    \/\/ if there is no memory location for the multiindex value, the component is zero\n    if (Factor0BootstrappingImplementation::component_is_immutable_zero(m1))\n    {\n        return Scalar_(0);\n    }\n    \/\/ vector_index_of sorts the multiindex and returns the vector index -- if this\n    \/\/ matches the symmetric vector index, then return 1.\n    else if (m.template el<0>() == Factor0BootstrappingImplementation::vector_index_of(m1))\n    {\n        return Factor0BootstrappingImplementation::scalar_factor_for_component(m1);\n    }\n    \/\/ otherwise 0.\n    else\n    {\n        return Scalar_(0);\n    }\n}\n\n} \/\/ end of namespace ComponentGeneratorEvaluator\n\ntemplate <Uint32 ORDER_, typename Factor_>\nstruct AltId_t\n{\n    static std::string type_as_string () { return \"Alt<\" + AS_STRING(ORDER_) + ',' + TypeStringOf_t<Factor_>::eval() + '>'; }\n};\n\n\/\/ template specialization for standard inner product on a based vector space having orthonormal basis\ntemplate <Uint32 ORDER_, typename Factor_, typename Scalar_>\nstruct Alt_f\n{\nprivate:\n    typedef ExteriorPowerOfBasedVectorSpace_c<ORDER_,Factor_> ExteriorPower;\n    typedef typename TensorPowerOfBasedVectorSpace_f<ORDER_,Factor_>::T TensorPower;\n    typedef TypeList_t<ExteriorPower,\n            TypeList_t<typename DualOf_f<TensorPower>::T> > FactorTypeList;\n    typedef TensorProductOfBasedVectorSpaces_c<FactorTypeList> Projection;\n    typedef ComponentGenerator_t<Scalar_,\n                                 DimensionOf_f<Projection>::V,\n                                 ComponentGeneratorEvaluator::alt<ORDER_,Factor_,DimensionOf_f<Projection>::V,Scalar_>,\n                                 AltId_t<ORDER_,Factor_> > ComponentGenerator;\npublic:\n    typedef ImplementationOf_t<Projection,Scalar_,UseImmutableArray_t<ComponentGenerator> > T;\n};\n\n} \/\/ end of namespace Tenh\n\n#endif \/\/ TENH_IMPLEMENTATION_ALT_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2015 The Khronos Group Inc.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and\/or associated documentation files (the\n\/\/ \"Materials\"), to deal in the Materials without restriction, including\n\/\/ without limitation the rights to use, copy, modify, merge, publish,\n\/\/ distribute, sublicense, and\/or sell copies of the Materials, and to\n\/\/ permit persons to whom the Materials are 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 Materials.\n\/\/\n\/\/ MODIFICATIONS TO THIS FILE MAY MEAN IT NO LONGER ACCURATELY REFLECTS\n\/\/ KHRONOS STANDARDS. THE UNMODIFIED, NORMATIVE VERSIONS OF KHRONOS\n\/\/ SPECIFICATIONS AND HEADER INFORMATION ARE LOCATED AT\n\/\/    https:\/\/www.khronos.org\/registry\/\n\/\/\n\/\/ THE MATERIALS ARE 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\/\/ MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS.\n\n\/\/ Assembler tests for instructions in the \"Group Instrucions\" section of the\n\/\/ SPIR-V spec.\n\n#include \"UnitSPIRV.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"TestFixture.h\"\n\nnamespace {\n\nusing spvtest::EnumCase;\nusing spvtest::MakeInstruction;\nusing ::testing::Eq;\n\n\/\/ Test GroupOperation enum\n\nusing GroupOperationTest = spvtest::TextToBinaryTestBase<\n    ::testing::TestWithParam<EnumCase<spv::GroupOperation>>>;\n\nTEST_P(GroupOperationTest, AnyGroupOperation) {\n  const std::string input =\n      \"%result = OpGroupIAdd %type %scope \" + GetParam().name() + \" %x\";\n  EXPECT_THAT(\n      CompiledInstructions(input),\n      Eq(MakeInstruction(spv::OpGroupIAdd, {1, 2, 3, GetParam().value(), 4})));\n}\n\n\/\/ clang-format off\n#define CASE(NAME) { spv::GroupOperation##NAME, #NAME}\nINSTANTIATE_TEST_CASE_P(TextToBinaryGroupOperation, GroupOperationTest,\n                        ::testing::ValuesIn(std::vector<EnumCase<spv::GroupOperation>>{\n                            CASE(Reduce),\n                            CASE(InclusiveScan),\n                            CASE(ExclusiveScan),\n                        }));\n#undef CASE\n\/\/ clang-format on\n\n\/\/ TODO(dneto): OpAsyncGroupCopy\n\/\/ TODO(dneto): OpWaitGroupEvents\n\/\/ TODO(dneto): OpGroupAll\n\/\/ TODO(dneto): OpGroupAny\n\/\/ TODO(dneto): OpGroupBroadcast\n\/\/ TODO(dneto): OpGroupIAdd\n\/\/ TODO(dneto): OpGroupFAdd\n\/\/ TODO(dneto): OpGroupFMin\n\/\/ TODO(dneto): OpGroupUMin\n\/\/ TODO(dneto): OpGroupSMin\n\/\/ TODO(dneto): OpGroupFMax\n\/\/ TODO(dneto): OpGroupUMax\n\/\/ TODO(dneto): OpGroupSMax\n\n}  \/\/ anonymous namespace\n<commit_msg>Negative test for GroupOperation.<commit_after>\/\/ Copyright (c) 2015 The Khronos Group Inc.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and\/or associated documentation files (the\n\/\/ \"Materials\"), to deal in the Materials without restriction, including\n\/\/ without limitation the rights to use, copy, modify, merge, publish,\n\/\/ distribute, sublicense, and\/or sell copies of the Materials, and to\n\/\/ permit persons to whom the Materials are 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 Materials.\n\/\/\n\/\/ MODIFICATIONS TO THIS FILE MAY MEAN IT NO LONGER ACCURATELY REFLECTS\n\/\/ KHRONOS STANDARDS. THE UNMODIFIED, NORMATIVE VERSIONS OF KHRONOS\n\/\/ SPECIFICATIONS AND HEADER INFORMATION ARE LOCATED AT\n\/\/    https:\/\/www.khronos.org\/registry\/\n\/\/\n\/\/ THE MATERIALS ARE 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\/\/ MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS.\n\n\/\/ Assembler tests for instructions in the \"Group Instrucions\" section of the\n\/\/ SPIR-V spec.\n\n#include \"UnitSPIRV.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"TestFixture.h\"\n\nnamespace {\n\nusing spvtest::EnumCase;\nusing spvtest::MakeInstruction;\nusing ::testing::Eq;\n\n\/\/ Test GroupOperation enum\n\nusing GroupOperationTest = spvtest::TextToBinaryTestBase<\n    ::testing::TestWithParam<EnumCase<spv::GroupOperation>>>;\n\nTEST_P(GroupOperationTest, AnyGroupOperation) {\n  const std::string input =\n      \"%result = OpGroupIAdd %type %scope \" + GetParam().name() + \" %x\";\n  EXPECT_THAT(\n      CompiledInstructions(input),\n      Eq(MakeInstruction(spv::OpGroupIAdd, {1, 2, 3, GetParam().value(), 4})));\n}\n\n\/\/ clang-format off\n#define CASE(NAME) { spv::GroupOperation##NAME, #NAME}\nINSTANTIATE_TEST_CASE_P(TextToBinaryGroupOperation, GroupOperationTest,\n                        ::testing::ValuesIn(std::vector<EnumCase<spv::GroupOperation>>{\n                            CASE(Reduce),\n                            CASE(InclusiveScan),\n                            CASE(ExclusiveScan),\n                        }));\n#undef CASE\n\/\/ clang-format on\n\nTEST_F(GroupOperationTest, WrongGroupOperation) {\n  EXPECT_THAT(CompileFailure(\"%r = OpGroupUMin %t %e xxyyzz %x\"),\n              Eq(\"Invalid group operation 'xxyyzz'.\"));\n}\n\n\/\/ TODO(dneto): OpAsyncGroupCopy\n\/\/ TODO(dneto): OpWaitGroupEvents\n\/\/ TODO(dneto): OpGroupAll\n\/\/ TODO(dneto): OpGroupAny\n\/\/ TODO(dneto): OpGroupBroadcast\n\/\/ TODO(dneto): OpGroupIAdd\n\/\/ TODO(dneto): OpGroupFAdd\n\/\/ TODO(dneto): OpGroupFMin\n\/\/ TODO(dneto): OpGroupUMin\n\/\/ TODO(dneto): OpGroupSMin\n\/\/ TODO(dneto): OpGroupFMax\n\/\/ TODO(dneto): OpGroupUMax\n\/\/ TODO(dneto): OpGroupSMax\n\n}  \/\/ anonymous namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/ 11 may 2015\n\/\/ TODO split out winapi includes\n#include \"tablepriv.h\"\n\/\/ before we start, why is this file C++? because the following is not a valid C header file!\n\/\/ namely, UIAutomationCoreApi.h forgets to typedef enum xxx { ... } xxx; and typedef struct xxx xxx; so it just uses xxx incorrectly\n\/\/ and because these are enums, we can't just do typedef enum xxx xxx; here ourselves, as that's illegal in both C and C++!\n\/\/ thanks, Microsoft!\n\/\/ (if it was just structs I would just typedef them here but even that's not really futureproof)\n#include <uiautomation.h>\n\n\/\/ TODO\n\/\/#include <stdio.h>\nextern \"C\" int printf(const char *,...);\n\n\/\/ TODOs\n\/\/ - make sure RPC_E_DISCONNECTED is correct; source it\n\/\/ - make sure E_POINTER is correct\n\n\/\/ well if we're stuck with C++, we might as well make the most of it\nclass tableAcc : public IRawElementProviderSimple {\n\tstruct table *t;\n\tULONG refcount;\npublic:\n\ttableAcc(struct table *);\n\n\t\/\/ internal methods\n\tvoid Invalidate(void);\n\n\t\/\/ IUnknown\n\tSTDMETHODIMP QueryInterface(REFIID riid, void **ppvObject);\n\tSTDMETHODIMP_(ULONG) AddRef(void);\n\tSTDMETHODIMP_(ULONG) Release(void);\n\n\t\/\/ IRawElementProviderSimple\n\tSTDMETHODIMP GetPatternProvider(PATTERNID patternId, IUnknown **pRetVal);\n\tSTDMETHODIMP GetPropertyValue(PROPERTYID propertyId, VARIANT *pRetVal);\n\tSTDMETHODIMP get_HostRawElementProvider(IRawElementProviderSimple **pRetVal);\n\tSTDMETHODIMP get_ProviderOptions(ProviderOptions *pRetVal);\n};\n\ntableAcc::tableAcc(struct table *t)\n{\nprintf(\"construct\\n\");\n\tthis->t = t;\n\tthis->refcount = 1;\t\t\/\/ first instance goes to the table\n}\n\nvoid tableAcc::Invalidate(void)\n{\nprintf(\"invalidate\\n\");\n\t\/\/ this will always be called before the tableAcc is destroyed because there's one ref given to the table itself\n\tthis->t = NULL;\n}\n\nSTDMETHODIMP tableAcc::QueryInterface(REFIID riid, void **ppvObject)\n{\nprintf(\"query interface\\n\");\n\tif (ppvObject == NULL)\n\t\treturn E_POINTER;\n\tif (IsEqualIID(riid, IID_IUnknown) ||\n\t\tIsEqualIID(riid, IID_IRawElementProviderSimple)) {\n\t\tthis->AddRef();\n\t\t*ppvObject = this;\n\t\treturn S_OK;\n\t}\n\treturn E_NOINTERFACE;\n}\n\nSTDMETHODIMP_(ULONG) tableAcc::AddRef(void)\n{\nprintf(\"add ref\\n\");\n\t\/\/ http:\/\/blogs.msdn.com\/b\/oldnewthing\/archive\/2005\/09\/27\/474384.aspx\n\tif (this->refcount == 0)\n\t\tlogLastError(\"tableAcc::AddRef() called during destruction\");\n\tthis->refcount++;\n\treturn this->refcount;\n}\n\nSTDMETHODIMP_(ULONG) tableAcc::Release(void)\n{\nprintf(\"release\\n\");\n\tthis->refcount--;\n\tif (this->refcount == 0) {\nprintf(\"destroy\\n\");\n\t\tdelete this;\n\t\treturn 0;\n\t}\n\treturn this->refcount;\n}\n\nSTDMETHODIMP tableAcc::GetPatternProvider(PATTERNID patternId, IUnknown **pRetVal)\n{\nprintf(\"get pattern provider\\n\");\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\t\/\/ TODO\n\t*pRetVal = NULL;\n\/\/\treturn S_OK;\n\treturn E_NOTIMPL;\n}\n\nSTDMETHODIMP tableAcc::GetPropertyValue(PROPERTYID propertyId, VARIANT *pRetVal)\n{\nprintf(\"get property value\\n\");\n\tBSTR bstr;\n\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\tpRetVal->vt = VT_EMPTY;\t\t\/\/ behavior on unknown property is to keep it VT_EMPTY and return S_OK\n\tswitch (propertyId) {\n\tcase UIA_NamePropertyId:\n\t\tbstr = SysAllocString(L\"test string\");\n\t\tif (bstr == NULL)\n\t\t\treturn E_OUTOFMEMORY;\n\t\tpRetVal->vt = VT_BSTR;\n\t\tpRetVal->bstrVal = bstr;\n\t\tbreak;\n\t}\n\treturn S_OK;\n}\n\nSTDMETHODIMP tableAcc::get_HostRawElementProvider(IRawElementProviderSimple **pRetVal)\n{\nprintf(\"get host raw element provider\\n\");\n\tif (this->t != NULL) {\n\t\tif (pRetVal == NULL)\n\t\t\treturn E_POINTER;\n\t\t\/\/ TODO correct?\n\t\t*pRetVal = NULL;\n\t\treturn RPC_E_DISCONNECTED;\n\t}\n\treturn UiaHostProviderFromHwnd(this->t->hwnd, pRetVal);\n}\n\nSTDMETHODIMP tableAcc::get_ProviderOptions(ProviderOptions *pRetVal)\n{\nprintf(\"get provider options\\n\");\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\t\/\/ TODO ProviderOptions_UseClientCoordinates?\n\t*pRetVal = ProviderOptions_ServerSideProvider;\n\treturn S_OK;\n}\n\nvoid initTableAcc(struct table *t)\n{\n\ttableAcc *a;\n\n\ta = new tableAcc(t);\n\tt->tableAcc = a;\n}\n\nvoid uninitTableAcc(struct table *t)\n{\n\ttableAcc *a;\n\n\ta = (tableAcc *) (t->tableAcc);\n\ta->Invalidate();\n\ta->Release();\n\tt->tableAcc = NULL;\n}\n\nHANDLER(accessibilityHandler)\n{\n\tif (uMsg != WM_GETOBJECT)\n\t\treturn FALSE;\n\t\/\/ OBJID_CLIENT evaluates to an expression of type LONG\n\t\/\/ the documentation for WM_GETOBJECT says to cast \"it\" to a DWORD before comparing\n\t\/\/ https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/dd373624%28v=vs.85%29.aspx casts them both to DWORDs; let's do that\n\t\/\/ its two siblings only cast lParam, resulting in an erroneous DWORD to LONG comparison\n\t\/\/ The Old New Thing book does not cast anything\n\t\/\/ Microsoft's MSAA sample casts lParam to LONG instead!\n\t\/\/ (As you can probably tell, the biggest problem with MSAA is that its documentation is ambiguous and\/or self-contradictory...)\n\t\/\/ and https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/ff625912%28v=vs.85%29.aspx casts them both to long!\n\t\/\/ Note that we're not using Active Accessibility, but the above applies even more, because UiaRootObjectId is *NEGATIVE*!\n\tif (((DWORD) lParam) != ((DWORD) UiaRootObjectId))\n\t\treturn FALSE;\n\t*lResult = UiaReturnRawElementProvider(t->hwnd, wParam, lParam, (IRawElementProviderSimple *) (t->tableAcc));\n\treturn TRUE;\n}\n<commit_msg>More tableAcc work.<commit_after>\/\/ 11 may 2015\n\/\/ TODO split out winapi includes\n#include \"tablepriv.h\"\n\/\/ before we start, why is this file C++? because the following is not a valid C header file!\n\/\/ namely, UIAutomationCoreApi.h forgets to typedef enum xxx { ... } xxx; and typedef struct xxx xxx; so it just uses xxx incorrectly\n\/\/ and because these are enums, we can't just do typedef enum xxx xxx; here ourselves, as that's illegal in both C and C++!\n\/\/ thanks, Microsoft!\n\/\/ (if it was just structs I would just typedef them here but even that's not really futureproof)\n#include <uiautomation.h>\n\n\/\/ TODO\n\/\/#include <stdio.h>\nextern \"C\" int printf(const char *,...);\n\n\/\/ TODOs\n\/\/ - make sure RPC_E_DISCONNECTED is correct; source it\n\/\/ - make sure E_POINTER is correct\n\n\/\/ well if we're stuck with C++, we might as well make the most of it\nclass tableAcc : public IRawElementProviderSimple\/*TODO, public ITableProvider, public IGridProvider*\/ {\n\tstruct table *t;\n\tULONG refcount;\npublic:\n\ttableAcc(struct table *);\n\n\t\/\/ internal methods\n\tvoid Invalidate(void);\n\n\t\/\/ IUnknown\n\tSTDMETHODIMP QueryInterface(REFIID riid, void **ppvObject);\n\tSTDMETHODIMP_(ULONG) AddRef(void);\n\tSTDMETHODIMP_(ULONG) Release(void);\n\n\t\/\/ IRawElementProviderSimple\n\tSTDMETHODIMP GetPatternProvider(PATTERNID patternId, IUnknown **pRetVal);\n\tSTDMETHODIMP GetPropertyValue(PROPERTYID propertyId, VARIANT *pRetVal);\n\tSTDMETHODIMP get_HostRawElementProvider(IRawElementProviderSimple **pRetVal);\n\tSTDMETHODIMP get_ProviderOptions(ProviderOptions *pRetVal);\n\n#if 0\n\t\/\/ ITableProvider\n\tSTDMETHODIMP GetColumnHeaders(SAFEARRAY **pRetVal);\n\tSTDMETHODIMP GetRowHeaders(SAFEARRAY **pRetVal);\n\tSTDMETHODIMP get_RowOrColumnMajor(RowOrColumnMajor *pRetVal);\n#endif\n};\n\ntableAcc::tableAcc(struct table *t)\n{\nprintf(\"construct\\n\");\n\tthis->t = t;\n\tthis->refcount = 1;\t\t\/\/ first instance goes to the table\n}\n\nvoid tableAcc::Invalidate(void)\n{\nprintf(\"invalidate\\n\");\n\t\/\/ this will always be called before the tableAcc is destroyed because there's one ref given to the table itself\n\tthis->t = NULL;\n}\n\nSTDMETHODIMP tableAcc::QueryInterface(REFIID riid, void **ppvObject)\n{\nprintf(\"query interface\\n\");\n\tif (ppvObject == NULL)\n\t\treturn E_POINTER;\n\tif (IsEqualIID(riid, IID_IUnknown) ||\n\t\tIsEqualIID(riid, IID_IRawElementProviderSimple)) {\n\t\tthis->AddRef();\n\t\t*ppvObject = this;\n\t\treturn S_OK;\n\t}\n\treturn E_NOINTERFACE;\n}\n\nSTDMETHODIMP_(ULONG) tableAcc::AddRef(void)\n{\nprintf(\"add ref\\n\");\n\t\/\/ http:\/\/blogs.msdn.com\/b\/oldnewthing\/archive\/2005\/09\/27\/474384.aspx\n\tif (this->refcount == 0)\n\t\tlogLastError(\"tableAcc::AddRef() called during destruction\");\n\tthis->refcount++;\n\treturn this->refcount;\n}\n\nSTDMETHODIMP_(ULONG) tableAcc::Release(void)\n{\nprintf(\"release\\n\");\n\tthis->refcount--;\n\tif (this->refcount == 0) {\nprintf(\"destroy\\n\");\n\t\tdelete this;\n\t\treturn 0;\n\t}\n\treturn this->refcount;\n}\n\nSTDMETHODIMP tableAcc::GetPatternProvider(PATTERNID patternId, IUnknown **pRetVal)\n{\nprintf(\"get pattern provider\\n\");\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\/\/TODO\tif (patternId != UIA_TablePatternId) {\n\t\t*pRetVal = NULL;\n\t\treturn S_OK;\n#if 0\n\t}\n\t*pRetVal = xxxxx;\n\treturn S_OK;\n#endif\n}\n\nSTDMETHODIMP tableAcc::GetPropertyValue(PROPERTYID propertyId, VARIANT *pRetVal)\n{\nprintf(\"get property value\\n\");\n\tBSTR bstr;\n\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\tpRetVal->vt = VT_EMPTY;\t\t\/\/ behavior on unknown property is to keep it VT_EMPTY and return S_OK\n\tswitch (propertyId) {\n\tcase UIA_NamePropertyId:\n\t\t\/\/ TODO this doesn't show up\n\t\tbstr = SysAllocString(L\"test string\");\n\t\tif (bstr == NULL)\n\t\t\treturn E_OUTOFMEMORY;\n\t\tpRetVal->vt = VT_BSTR;\n\t\tpRetVal->bstrVal = bstr;\n\t\tbreak;\n\t}\n\treturn S_OK;\n}\n\nSTDMETHODIMP tableAcc::get_HostRawElementProvider(IRawElementProviderSimple **pRetVal)\n{\nprintf(\"get host raw element provider\\n\");\n\tif (this->t != NULL) {\n\t\tif (pRetVal == NULL)\n\t\t\treturn E_POINTER;\n\t\t\/\/ TODO correct?\n\t\t*pRetVal = NULL;\n\t\treturn RPC_E_DISCONNECTED;\n\t}\n\t\/\/ TODO wait should we?\n\/\/\treturn UiaHostProviderFromHwnd(this->t->hwnd, pRetVal);\n\t*pRetVal = NULL;\n\treturn S_OK;\n}\n\nSTDMETHODIMP tableAcc::get_ProviderOptions(ProviderOptions *pRetVal)\n{\nprintf(\"get provider options\\n\");\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\t\/\/ TODO ProviderOptions_UseClientCoordinates?\n\t*pRetVal = ProviderOptions_ServerSideProvider;\n\treturn S_OK;\n}\n\n#if 0\nSTDMETHODIMP tableAcc::GetColumnHeaders(SAFEARRAY **pRetVal)\n{\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\t*pRetVal = NULL;\n\treturn E_NOTIMPL;\n}\n\nSTDMETHODIMP tableAcc::GetRowHeaders(SAFEARRAY **pRetVal)\n{\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\t*pRetVal = NULL;\n\treturn E_NOTIMPL;\n}\n\nSTDMETHODIMP tableAcc::get_RowOrColumnMajor(RowOrColumnMajor *pRetVal)\n{\n\tif (pRetVal == NULL)\n\t\treturn E_POINTER;\n\t*pRetVal = RowOrColumnMajor_RowMajor;\n\treturn S_OK;\n}\n#endif\n\nvoid initTableAcc(struct table *t)\n{\n\ttableAcc *a;\n\n\ta = new tableAcc(t);\n\tt->tableAcc = a;\n}\n\nvoid uninitTableAcc(struct table *t)\n{\n\ttableAcc *a;\n\n\ta = (tableAcc *) (t->tableAcc);\n\ta->Invalidate();\n\ta->Release();\n\tt->tableAcc = NULL;\n}\n\nHANDLER(accessibilityHandler)\n{\n\tif (uMsg != WM_GETOBJECT)\n\t\treturn FALSE;\n\t\/\/ OBJID_CLIENT evaluates to an expression of type LONG\n\t\/\/ the documentation for WM_GETOBJECT says to cast \"it\" to a DWORD before comparing\n\t\/\/ https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/dd373624%28v=vs.85%29.aspx casts them both to DWORDs; let's do that\n\t\/\/ its two siblings only cast lParam, resulting in an erroneous DWORD to LONG comparison\n\t\/\/ The Old New Thing book does not cast anything\n\t\/\/ Microsoft's MSAA sample casts lParam to LONG instead!\n\t\/\/ (As you can probably tell, the biggest problem with MSAA is that its documentation is ambiguous and\/or self-contradictory...)\n\t\/\/ and https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/ff625912%28v=vs.85%29.aspx casts them both to long!\n\t\/\/ Note that we're not using Active Accessibility, but the above applies even more, because UiaRootObjectId is *NEGATIVE*!\n\tif (((DWORD) lParam) != ((DWORD) UiaRootObjectId))\n\t\treturn FALSE;\n\t*lResult = UiaReturnRawElementProvider(t->hwnd, wParam, lParam, (IRawElementProviderSimple *) (t->tableAcc));\n\treturn TRUE;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"SkCanvas.h\"\n#include \"SkDocument.h\"\n#include \"SkFontMgr.h\"\n#include \"SkGradientShader.h\"\n#include \"SkPaint.h\"\n#include \"SkStream.h\"\n#include \"SkString.h\"\n#include \"SkTypeface.h\"\n#include <hb.h>\n#include <hb-ft.h>\n#include <cairo.h>\n#include <cairo-ft.h>\n\n\nstruct Config {\n  double page_width;\n  double page_height;\n\n  SkString title;\n  SkString author;\n  SkString subject;\n  SkString keywords;\n  SkString creator;\n\n  std::string font_file;\n  double font_size;\n\n  Config(int argc, char **argv) :\n    page_width(800.f), page_height(600.f),\n    title(\"...\"), author(\"...\"), subject(\"...\"), keywords(\"...\"),\n    creator(\"...\"),\n    font_file(\"fonts\/NotoNastaliqUrdu-Regular.ttf\"),\n    font_size(24.0f) {\n    for (int i = 1; i < argc; i++) {\n      printf(\"Config arg[%d]=%s\\n\", argc, argv[i]);\n      if (*argv[i] == '-') {\n        char option_char = *(argv[i] + 1);\n        if (i >= argc) {\n          break;\n        }\n        const char *option_value = argv[i + 1];\n        printf(\"\\toption_char=%c\\n\", option_char);\n        printf(\"\\toption_value=%s\\n\", option_value);\n        switch (option_char) {\n          case 'w':\n            page_width = atof(option_value);\n            i++;\n            break;\n          case 'h':\n            page_height = atof(option_value);\n            i++;\n            break;\n          case 't':\n            title = option_value;\n            i++;\n            break;\n          case 'a':\n            author = option_value;\n            i++;\n            break;\n          case 's':\n            subject = option_value;\n            i++;\n            break;\n          case 'k':\n            keywords = option_value;\n            i++;\n            break;\n          case 'c':\n            creator = option_value;\n            i++;\n            break;\n\n          case 'f':\n            font_file = option_value;\n            i++;\n            break;\n          case 'z':\n            font_size = atof(option_value);\n            i++;\n            break;\n          default:\n            printf(\"Unrecognized option: %c. Skipping.\\n\", option_char);\n        }\n      }\n    }\n\n  } \/\/ end of Config::Config\n};\n\n\nclass Placement {\n  Config config;\n\n  FT_Library ft_library;\n  FT_Face ft_face;\n  hb_font_t *hb_font;\n  hb_buffer_t *hb_buffer;\n\n  const char *text;\n  unsigned len;\n\n  hb_glyph_position_t *pos;\n  hb_glyph_info_t *info;\n\n public:\n  Placement(Config &_config, const char *_text) : config(_config) {\n    text = _text;\n    FT_Error ft_error;\n\n    if ((ft_error = FT_Init_FreeType (&ft_library)))\n      abort();\n    if ((ft_error = FT_New_Face (ft_library, config.font_file.c_str(), 0, &ft_face)))\n      abort();\n    if ((ft_error = FT_Set_Char_Size (ft_face, config.font_size*64,\n        config.font_size*64, 0, 0)))\n      abort();\n\n    \/* Create hb-ft font. *\/\n    hb_font = hb_ft_font_create (ft_face, NULL);\n\n    \/* Create hb-buffer and populate. *\/\n    hb_buffer = hb_buffer_create ();\n    hb_buffer_add_utf8 (hb_buffer, text, -1, 0, -1);\n    hb_buffer_guess_segment_properties (hb_buffer);\n\n    \/* Shape it! *\/\n    hb_shape (hb_font, hb_buffer, NULL, 0);\n\n    dump_hb_buffer(hb_buffer);\n  } \/\/ end of Placement\n\n  ~Placement() {\n    hb_buffer_destroy (hb_buffer);\n    hb_font_destroy (hb_font);\n\n    FT_Done_Face (ft_face);\n    FT_Done_FreeType (ft_library);\n  }\n\n  void DrawGlyphsUsingCairo(double margin) {\n    \/* Draw, using cairo. *\/\n    double width = 2 * margin;\n    double height = 2 * margin;\n    for (unsigned int i = 0; i < len; i++)\n    {\n      width  += pos[i].x_advance \/ 64.;\n      height -= pos[i].y_advance \/ 64.;\n    }\n    if (HB_DIRECTION_IS_HORIZONTAL (hb_buffer_get_direction(hb_buffer)))\n      height += config.font_size;\n    else\n      width  += config.font_size;\n\n    \/* Set up cairo surface. *\/\n    cairo_surface_t *cairo_surface;\n    cairo_surface = cairo_image_surface_create (CAIRO_FORMAT_ARGB32,\n                            ceil(width),\n                            ceil(height));\n    cairo_t *cr;\n    cr = cairo_create (cairo_surface);\n    cairo_set_source_rgba (cr, 1., 1., 1., 1.);\n    cairo_paint (cr);\n    cairo_set_source_rgba (cr, 0., 0., 0., 1.);\n    cairo_translate (cr, margin, margin);\n\n    \/* Set up cairo font face. *\/\n    cairo_font_face_t *cairo_face;\n    cairo_face = cairo_ft_font_face_create_for_ft_face (ft_face, 0);\n    cairo_set_font_face (cr, cairo_face);\n    cairo_set_font_size (cr, config.font_size);\n\n    \/* Set up baseline. *\/\n    if (HB_DIRECTION_IS_HORIZONTAL (hb_buffer_get_direction(hb_buffer)))\n    {\n      cairo_font_extents_t font_extents;\n      cairo_font_extents (cr, &font_extents);\n      double baseline = (config.font_size - font_extents.height) * .5 + font_extents.ascent;\n      cairo_translate (cr, 0, baseline);\n    }\n    else\n    {\n      cairo_translate (cr, config.font_size * .5, 0);\n    }\n\n    cairo_glyph_t *cairo_glyphs = cairo_glyph_allocate (len);\n    double current_x = 0;\n    double current_y = 0;\n    for (unsigned int i = 0; i < len; i++)\n    {\n      cairo_glyphs[i].index = info[i].codepoint;\n      cairo_glyphs[i].x = current_x + pos[i].x_offset \/ 64.;\n      cairo_glyphs[i].y = -(current_y + pos[i].y_offset \/ 64.);\n      current_x += pos[i].x_advance \/ 64.;\n      current_y += pos[i].y_advance \/ 64.;\n    }\n    cairo_show_glyphs (cr, cairo_glyphs, len);\n    cairo_glyph_free (cairo_glyphs);\n\n    cairo_surface_write_to_png (cairo_surface, \"out-cairo.png\");\n\n    cairo_font_face_destroy (cairo_face);\n    cairo_destroy (cr);\n    cairo_surface_destroy (cairo_surface);\n  } \/\/ end of DrawGlyphsUsingCairo\n\n  bool DrawGlyphsUsingSkia(SkWStream* outputStream) {\n    sk_sp<SkDocument> pdfDocument(SkDocument::CreatePDF(outputStream));\n    typedef SkDocument::Attribute Attr;\n    Attr pdf_info[] = {\n        Attr(SkString(\"Title\"),    config.title),\n        Attr(SkString(\"Author\"),   config.author),\n        Attr(SkString(\"Subject\"),  config.subject),\n        Attr(SkString(\"Keywords\"), config.keywords),\n        Attr(SkString(\"Creator\"),  config.creator),\n    };\n    int pdf_infoCount = sizeof(pdf_info) \/ sizeof(pdf_info[0]);\n    std::unique_ptr<SkTime::DateTime> now = GetCurrentDateTime();\n\n    pdfDocument->setMetadata(pdf_info, pdf_infoCount, now.get(), now.get());\n\n    int numberOfPages = 1;\n    for (int page = 0; page < numberOfPages; ++page) {\n      SkScalar pageWidth = SkIntToScalar(800);\n      SkScalar pageHeight = SkIntToScalar(600);\n      SkCanvas* pageCanvas = pdfDocument->beginPage(pageWidth, pageHeight);\n\n      SkScalar s = SkIntToScalar(600);\n      static const SkPoint     kPts0[] = { { 0, 0 }, { s, s } };\n      static const SkScalar    kPos[] = { 0, SK_Scalar1\/2, SK_Scalar1 };\n      static const SkColor kColors0[] = {0x80F00080, 0xF0F08000, 0x800080F0 };\n\n      SkPaint paint;\n      paint.setShader(SkGradientShader::MakeLinear(\n          kPts0, kColors0, kPos, SK_ARRAY_COUNT(kColors0),\n          SkShader::kClamp_TileMode));\n      pageCanvas->drawPaint(paint);\n\n      SkPaint textPaint;\n      \/\/ Draw a message with a nice black paint.\n      textPaint.setFlags(\n          SkPaint::kAntiAlias_Flag |\n          SkPaint::kSubpixelText_Flag | \/\/ ... avoid waggly text when rotating.\n          SkPaint::kUnderlineText_Flag);\n      textPaint.setColor(SK_ColorBLACK);\n      textPaint.setTextSize(config.font_size);\n      pageCanvas->save();\n      pageCanvas->translate(40, 20);\n      pageCanvas->rotate(45.0f);\n      SkAutoTUnref<SkFontMgr> fm(SkFontMgr::RefDefault());\n      SkTypeface * typeface = SkTypeface::CreateFromFile(config.font_file.c_str(), 0);\n      textPaint.setTypeface(typeface);\n\n      pageCanvas->drawText(text, strlen(text), 0, 0, textPaint);\n\n      SkPoint *skpos = (SkPoint*)malloc(sizeof(SkPoint) * len);\n\n      double current_x = 10;\n      double current_y = 50;\n\n      SkPaint glyphPaint(textPaint);\n      glyphPaint.setTextEncoding(SkPaint::kGlyphID_TextEncoding);\n      SkAutoSTMalloc<128, uint16_t> glyphStorage(len);\n      uint16_t* glyphs = glyphStorage.get();\n      for (unsigned int i = 0; i < len; i++)\n      {\n        glyphs[i] = info[i].codepoint;\n        skpos[i] = SkPoint::Make(\n          current_x + pos[i].x_offset \/ 64.,\n          current_y - pos[i].y_offset \/ 64.);\n        current_x += pos[i].x_advance \/ 64.;\n        current_y += pos[i].y_advance \/ 64.;\n      }\n\n      pageCanvas->drawPosText(glyphs, len * sizeof(uint16_t), skpos, glyphPaint);\n      pageCanvas->restore();\n\n      free(skpos);\n\n      pdfDocument->endPage();\n    }\n    return pdfDocument->close();\n  } \/\/ end of DrawGlyphsUsingSkia\n\nprivate:\n  void dump_hb_buffer(hb_buffer_t *hb_buffer) {\n    \/* Get glyph information and positions out of the buffer. *\/\n    len = hb_buffer_get_length (hb_buffer);\n    info = hb_buffer_get_glyph_infos (hb_buffer, NULL);\n    pos = hb_buffer_get_glyph_positions (hb_buffer, NULL);\n\n    \/* Print them out as is. *\/\n    printf (\"Raw buffer contents:\\n\");\n    for (unsigned int i = 0; i < len; i++)\n    {\n      hb_codepoint_t gid   = info[i].codepoint;\n      unsigned int cluster = info[i].cluster;\n      double x_advance = pos[i].x_advance \/ 64.;\n      double y_advance = pos[i].y_advance \/ 64.;\n      double x_offset  = pos[i].x_offset \/ 64.;\n      double y_offset  = pos[i].y_offset \/ 64.;\n\n      char glyphname[32];\n      hb_font_get_glyph_name (hb_font, gid, glyphname, sizeof (glyphname));\n\n      printf (\"glyph='%s' cluster=%d  advance=(%g,%g) offset=(%g,%g)\\n\",\n              glyphname, cluster, x_advance, y_advance, x_offset, y_offset);\n    }\n  }\n\n  std::unique_ptr<SkTime::DateTime> GetCurrentDateTime() {\n    time_t m_time;\n    time(&m_time);\n    struct tm* tstruct;\n    tstruct = gmtime(&m_time);\n\n    std::unique_ptr<SkTime::DateTime> now(new SkTime::DateTime());\n    now->fTimeZoneMinutes = 0;\n    now->fYear       = tstruct->tm_year + 1900;\n    now->fMonth      = SkToU8(tstruct->tm_mon + 1);\n    now->fDayOfWeek  = SkToU8(tstruct->tm_wday);\n    now->fDay        = SkToU8(tstruct->tm_mday);\n    now->fHour       = SkToU8(tstruct->tm_hour);\n    now->fMinute     = SkToU8(tstruct->tm_min);\n    now->fSecond     = SkToU8(tstruct->tm_sec);\n    return now;\n  }\n}; \/\/ end of Placement class\n\nint main(int argc, char** argv) {\n    Config config(argc, argv);\n\n    SkPaint paint;\n    paint.setColor(SK_ColorRED);\n\n    SkString* str = new SkString();\n    paint.toString(str);\n\n    fprintf(stdout, \"%s\\n\", str->c_str());\n\n    \/\/ CreateAndPlaceGlyphs(36, 36 * .5, \"fonts\/TSCu_SaiIndira.ttf\", \"டஉடு\");\n    \/\/ CreateAndPlaceGlyphs(36, 36 * .5, \"fonts\/DejaVuSans.ttf\", \"حرف‌باز\");\n    \/\/ Placement placement(\"fonts\/NotoNastaliqUrdu-Regular.ttf\", \"حرف‌باز Привет, Вася! Hello, world! டஉடு\", 24 \/* font_size *\/);\n    Placement placement(config, \"حرف‌باز\");\n    placement.DrawGlyphsUsingCairo(24 * .5 \/* margin *\/);\n    placement.DrawGlyphsUsingSkia(new SkFILEWStream(\"out-skiahf.pdf\"));\n\n    return 0;\n}\n<commit_msg>Create Config.<commit_after>#include \"SkCanvas.h\"\n#include \"SkDocument.h\"\n#include \"SkFontMgr.h\"\n#include \"SkGradientShader.h\"\n#include \"SkPaint.h\"\n#include \"SkStream.h\"\n#include \"SkString.h\"\n#include \"SkTypeface.h\"\n#include <hb.h>\n#include <hb-ft.h>\n#include <cairo.h>\n#include <cairo-ft.h>\n\nstruct Config {\n  double page_width;\n  double page_height;\n\n  SkString title;\n  SkString author;\n  SkString subject;\n  SkString keywords;\n  SkString creator;\n\n  std::string font_file;\n  double font_size;\n\n  Config(int argc, char **argv) :\n    page_width(800.f), page_height(600.f),\n    title(\"...\"), author(\"...\"), subject(\"...\"), keywords(\"...\"), creator(\"...\"),\n    font_file(\"fonts\/NotoNastaliqUrdu-Regular.ttf\"), font_size(24.0f) {\n    for (int i = 1; i < argc; i++) {\n      printf(\"Config arg[%d]=%s\\n\", argc, argv[i]);\n      if (*argv[i] == '-') {\n        char option_char = *(argv[i] + 1);\n        if (i >= argc) {\n          break;\n        }\n        const char *option_value = argv[i + 1];\n        printf(\"\\toption_char=%c\\n\", option_char);\n        printf(\"\\toption_value=%s\\n\", option_value);\n        switch (option_char) {\n          case 'w':\n            page_width = atof(option_value);\n            i++;\n            break;\n          case 'h':\n            page_height = atof(option_value);\n            i++;\n            break;\n          case 't':\n            title = option_value;\n            i++;\n            break;\n          case 'a':\n            author = option_value;\n            i++;\n            break;\n          case 's':\n            subject = option_value;\n            i++;\n            break;\n          case 'k':\n            keywords = option_value;\n            i++;\n            break;\n          case 'c':\n            creator = option_value;\n            i++;\n            break;\n\n          case 'f':\n            font_file = option_value;\n            i++;\n            break;\n          case 'z':\n            font_size = atof(option_value);\n            i++;\n            break;\n          default:\n            printf(\"Unrecognized option: %c. Skipping.\\n\", option_char);\n        }\n      }\n    }\n\n  } \/\/ end of Config::Config\n};\n\n\nclass Placement {\n  Config config;\n\n  FT_Library ft_library;\n  FT_Face ft_face;\n  hb_font_t *hb_font;\n  hb_buffer_t *hb_buffer;\n\n  const char *text;\n  unsigned len;\n\n  hb_glyph_position_t *pos;\n  hb_glyph_info_t *info;\n\n public:\n  Placement(Config &_config, const char *_text) : config(_config) {\n    text = _text;\n    FT_Error ft_error;\n\n    if ((ft_error = FT_Init_FreeType (&ft_library)))\n      abort();\n    if ((ft_error = FT_New_Face (ft_library, config.font_file.c_str(), 0, &ft_face)))\n      abort();\n    if ((ft_error = FT_Set_Char_Size (ft_face, config.font_size*64,\n        config.font_size*64, 0, 0)))\n      abort();\n\n    \/* Create hb-ft font. *\/\n    hb_font = hb_ft_font_create (ft_face, NULL);\n\n    \/* Create hb-buffer and populate. *\/\n    hb_buffer = hb_buffer_create ();\n    hb_buffer_add_utf8 (hb_buffer, text, -1, 0, -1);\n    hb_buffer_guess_segment_properties (hb_buffer);\n\n    \/* Shape it! *\/\n    hb_shape (hb_font, hb_buffer, NULL, 0);\n\n    dump_hb_buffer(hb_buffer);\n  } \/\/ end of Placement\n\n  ~Placement() {\n    hb_buffer_destroy (hb_buffer);\n    hb_font_destroy (hb_font);\n\n    FT_Done_Face (ft_face);\n    FT_Done_FreeType (ft_library);\n  }\n\n  void DrawGlyphsUsingCairo(double margin) {\n    \/* Draw, using cairo. *\/\n    double width = 2 * margin;\n    double height = 2 * margin;\n    for (unsigned int i = 0; i < len; i++)\n    {\n      width  += pos[i].x_advance \/ 64.;\n      height -= pos[i].y_advance \/ 64.;\n    }\n    if (HB_DIRECTION_IS_HORIZONTAL (hb_buffer_get_direction(hb_buffer)))\n      height += config.font_size;\n    else\n      width  += config.font_size;\n\n    \/* Set up cairo surface. *\/\n    cairo_surface_t *cairo_surface;\n    cairo_surface = cairo_image_surface_create (CAIRO_FORMAT_ARGB32,\n                            ceil(width),\n                            ceil(height));\n    cairo_t *cr;\n    cr = cairo_create (cairo_surface);\n    cairo_set_source_rgba (cr, 1., 1., 1., 1.);\n    cairo_paint (cr);\n    cairo_set_source_rgba (cr, 0., 0., 0., 1.);\n    cairo_translate (cr, margin, margin);\n\n    \/* Set up cairo font face. *\/\n    cairo_font_face_t *cairo_face;\n    cairo_face = cairo_ft_font_face_create_for_ft_face (ft_face, 0);\n    cairo_set_font_face (cr, cairo_face);\n    cairo_set_font_size (cr, config.font_size);\n\n    \/* Set up baseline. *\/\n    if (HB_DIRECTION_IS_HORIZONTAL (hb_buffer_get_direction(hb_buffer)))\n    {\n      cairo_font_extents_t font_extents;\n      cairo_font_extents (cr, &font_extents);\n      double baseline = (config.font_size - font_extents.height) * .5 + font_extents.ascent;\n      cairo_translate (cr, 0, baseline);\n    }\n    else\n    {\n      cairo_translate (cr, config.font_size * .5, 0);\n    }\n\n    cairo_glyph_t *cairo_glyphs = cairo_glyph_allocate (len);\n    double current_x = 0;\n    double current_y = 0;\n    for (unsigned int i = 0; i < len; i++)\n    {\n      cairo_glyphs[i].index = info[i].codepoint;\n      cairo_glyphs[i].x = current_x + pos[i].x_offset \/ 64.;\n      cairo_glyphs[i].y = -(current_y + pos[i].y_offset \/ 64.);\n      current_x += pos[i].x_advance \/ 64.;\n      current_y += pos[i].y_advance \/ 64.;\n    }\n    cairo_show_glyphs (cr, cairo_glyphs, len);\n    cairo_glyph_free (cairo_glyphs);\n\n    cairo_surface_write_to_png (cairo_surface, \"out-cairo.png\");\n\n    cairo_font_face_destroy (cairo_face);\n    cairo_destroy (cr);\n    cairo_surface_destroy (cairo_surface);\n  } \/\/ end of DrawGlyphsUsingCairo\n\n  bool DrawGlyphsUsingSkia(SkWStream* outputStream) {\n    sk_sp<SkDocument> pdfDocument(SkDocument::CreatePDF(outputStream));\n    typedef SkDocument::Attribute Attr;\n    Attr pdf_info[] = {\n        Attr(SkString(\"Title\"),    config.title),\n        Attr(SkString(\"Author\"),   config.author),\n        Attr(SkString(\"Subject\"),  config.subject),\n        Attr(SkString(\"Keywords\"), config.keywords),\n        Attr(SkString(\"Creator\"),  config.creator),\n    };\n    int pdf_infoCount = sizeof(pdf_info) \/ sizeof(pdf_info[0]);\n    std::unique_ptr<SkTime::DateTime> now = GetCurrentDateTime();\n\n    pdfDocument->setMetadata(pdf_info, pdf_infoCount, now.get(), now.get());\n\n    int numberOfPages = 1;\n    for (int page = 0; page < numberOfPages; ++page) {\n      SkScalar pageWidth = SkIntToScalar(800);\n      SkScalar pageHeight = SkIntToScalar(600);\n      SkCanvas* pageCanvas = pdfDocument->beginPage(pageWidth, pageHeight);\n\n      SkScalar s = SkIntToScalar(600);\n      static const SkPoint     kPts0[] = { { 0, 0 }, { s, s } };\n      static const SkScalar    kPos[] = { 0, SK_Scalar1\/2, SK_Scalar1 };\n      static const SkColor kColors0[] = {0x80F00080, 0xF0F08000, 0x800080F0 };\n\n      SkPaint paint;\n      paint.setShader(SkGradientShader::MakeLinear(\n          kPts0, kColors0, kPos, SK_ARRAY_COUNT(kColors0),\n          SkShader::kClamp_TileMode));\n      pageCanvas->drawPaint(paint);\n\n      SkPaint textPaint;\n      \/\/ Draw a message with a nice black paint.\n      textPaint.setFlags(\n          SkPaint::kAntiAlias_Flag |\n          SkPaint::kSubpixelText_Flag | \/\/ ... avoid waggly text when rotating.\n          SkPaint::kUnderlineText_Flag);\n      textPaint.setColor(SK_ColorBLACK);\n      textPaint.setTextSize(config.font_size);\n      pageCanvas->save();\n      pageCanvas->translate(40, 20);\n      pageCanvas->rotate(45.0f);\n      SkAutoTUnref<SkFontMgr> fm(SkFontMgr::RefDefault());\n      SkTypeface * typeface = SkTypeface::CreateFromFile(config.font_file.c_str(), 0);\n      textPaint.setTypeface(typeface);\n\n      pageCanvas->drawText(text, strlen(text), 0, 0, textPaint);\n\n      SkPoint *skpos = (SkPoint*)malloc(sizeof(SkPoint) * len);\n\n      double current_x = 10;\n      double current_y = 50;\n\n      SkPaint glyphPaint(textPaint);\n      glyphPaint.setTextEncoding(SkPaint::kGlyphID_TextEncoding);\n      SkAutoSTMalloc<128, uint16_t> glyphStorage(len);\n      uint16_t* glyphs = glyphStorage.get();\n      for (unsigned int i = 0; i < len; i++)\n      {\n        glyphs[i] = info[i].codepoint;\n        skpos[i] = SkPoint::Make(\n          current_x + pos[i].x_offset \/ 64.,\n          current_y - pos[i].y_offset \/ 64.);\n        current_x += pos[i].x_advance \/ 64.;\n        current_y += pos[i].y_advance \/ 64.;\n      }\n\n      pageCanvas->drawPosText(glyphs, len * sizeof(uint16_t), skpos, glyphPaint);\n\n      current_x += 50;\n      current_y += 50;\n\n      SkTextBlobBuilder textBlobBuilder;\n      auto runBuffer = textBlobBuilder.allocRunPos(glyphPaint, len);\n      for (unsigned int i = 0; i < len; i++)\n      {\n        runBuffer.glyphs[i] = info[i].codepoint;\n        skpos[i] = SkPoint::Make(\n          current_x + pos[i].x_offset \/ 64.,\n          current_y - pos[i].y_offset \/ 64.);\n        current_x += pos[i].x_advance \/ 64.;\n        current_y += pos[i].y_advance \/ 64.;\n      }\n\n      pageCanvas->drawTextBlob(textBlobBuilder.build(), x, y, glyphPaint);\n\n      pageCanvas->restore();\n\n      free(skpos);\n\n      pdfDocument->endPage();\n    }\n    return pdfDocument->close();\n  } \/\/ end of DrawGlyphsUsingSkia\n\nprivate:\n  void dump_hb_buffer(hb_buffer_t *hb_buffer) {\n    \/* Get glyph information and positions out of the buffer. *\/\n    len = hb_buffer_get_length (hb_buffer);\n    info = hb_buffer_get_glyph_infos (hb_buffer, NULL);\n    pos = hb_buffer_get_glyph_positions (hb_buffer, NULL);\n\n    \/* Print them out as is. *\/\n    printf (\"Raw buffer contents:\\n\");\n    for (unsigned int i = 0; i < len; i++)\n    {\n      hb_codepoint_t gid   = info[i].codepoint;\n      unsigned int cluster = info[i].cluster;\n      double x_advance = pos[i].x_advance \/ 64.;\n      double y_advance = pos[i].y_advance \/ 64.;\n      double x_offset  = pos[i].x_offset \/ 64.;\n      double y_offset  = pos[i].y_offset \/ 64.;\n\n      char glyphname[32];\n      hb_font_get_glyph_name (hb_font, gid, glyphname, sizeof (glyphname));\n\n      printf (\"glyph='%s' cluster=%d  advance=(%g,%g) offset=(%g,%g)\\n\",\n              glyphname, cluster, x_advance, y_advance, x_offset, y_offset);\n    }\n  }\n\n  std::unique_ptr<SkTime::DateTime> GetCurrentDateTime() {\n    time_t m_time;\n    time(&m_time);\n    struct tm* tstruct;\n    tstruct = gmtime(&m_time);\n\n    std::unique_ptr<SkTime::DateTime> now(new SkTime::DateTime());\n    now->fTimeZoneMinutes = 0;\n    now->fYear       = tstruct->tm_year + 1900;\n    now->fMonth      = SkToU8(tstruct->tm_mon + 1);\n    now->fDayOfWeek  = SkToU8(tstruct->tm_wday);\n    now->fDay        = SkToU8(tstruct->tm_mday);\n    now->fHour       = SkToU8(tstruct->tm_hour);\n    now->fMinute     = SkToU8(tstruct->tm_min);\n    now->fSecond     = SkToU8(tstruct->tm_sec);\n    return now;\n  }\n}; \/\/ end of Placement class\n\nint main(int argc, char** argv) {\n    Config config(argc, argv);\n\n    SkPaint paint;\n    paint.setColor(SK_ColorRED);\n\n    SkString* str = new SkString();\n    paint.toString(str);\n\n    fprintf(stdout, \"%s\\n\", str->c_str());\n\n    \/\/ CreateAndPlaceGlyphs(36, 36 * .5, \"fonts\/TSCu_SaiIndira.ttf\", \"டஉடு\");\n    \/\/ CreateAndPlaceGlyphs(36, 36 * .5, \"fonts\/DejaVuSans.ttf\", \"حرف‌باز\");\n    \/\/ Placement placement(\"fonts\/NotoNastaliqUrdu-Regular.ttf\", \"حرف‌باز Привет, Вася! Hello, world! டஉடு\", 24 \/* font_size *\/);\n    Placement placement(config, \"حرف‌باز\");\n    placement.DrawGlyphsUsingCairo(24 * .5 \/* margin *\/);\n    placement.DrawGlyphsUsingSkia(new SkFILEWStream(\"out-skiahf.pdf\"));\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* ----------------------------------------------------------------------------\n* “THE COFFEEWARE LICENSE” (Revision 1):\n* <ihsan@kehribar.me> wrote this file. As long as you retain this notice you\n* can do whatever you want with this stuff. If we meet some day, and you think\n* this stuff is worth it, you can buy me a coffee in return.\n* -----------------------------------------------------------------------------\n* This library is based on this library: \n*   https:\/\/github.com\/aaronds\/arduino-nrf24l01\n* Which is based on this library: \n*   http:\/\/www.tinkerer.eu\/AVRLib\/nRF24L01\n* -----------------------------------------------------------------------------\n*\/\n#include \"nrf24.hpp\"\n\nuint8_t payload_len;\n\n\/\/ FIXME: correct pin definitions\ntypedef GpioA0 Ce;\ntypedef GpioA0 Csn;\ntypedef GpioA0 Sck;\ntypedef GpioA0 Mosi;\ntypedef GpioA0 Miso;\n\n\n\n\n\/* init the hardware pins *\/\nvoid nrf24_init() \n{\n\/*    - Set MISO pin input\n *    - Set MOSI pin output\n *    - Set SCK pin output\n *    - Set CSN pin output\n *    - Set CE pin output     *\/\n    Miso::setInput();\n    Mosi::setOutput(xpcc::Gpio::Low);\n    Sck::setOutput(xpcc::Gpio::Low);\n    Csn::setOutput(xpcc::Gpio::Low);\n    Ce::setOutput(xpcc::Gpio::Low);\n\n    Ce::reset();\n    Csn::set();\n}\n\n\/* configure the module *\/\nvoid nrf24_config(uint8_t channel, uint8_t pay_length)\n{\n    \/* Use static payload length ... *\/\n    payload_len = pay_length;\n\n    \/\/ Set RF channel\n    nrf24_configRegister(RF_CH,channel);\n\n    \/\/ Set length of incoming payload \n    nrf24_configRegister(RX_PW_P0, 0x00); \/\/ Auto-ACK pipe ...\n    nrf24_configRegister(RX_PW_P1, payload_len); \/\/ Data payload pipe\n    nrf24_configRegister(RX_PW_P2, 0x00); \/\/ Pipe not used \n    nrf24_configRegister(RX_PW_P3, 0x00); \/\/ Pipe not used \n    nrf24_configRegister(RX_PW_P4, 0x00); \/\/ Pipe not used \n    nrf24_configRegister(RX_PW_P5, 0x00); \/\/ Pipe not used \n\n    \/\/ 1 Mbps, TX gain: 0dbm\n    nrf24_configRegister(RF_SETUP, (0<<RF_DR)|((0x03)<<RF_PWR));\n\n    \/\/ CRC enable, 1 byte CRC length\n    nrf24_configRegister(CONFIG,nrf24_CONFIG);\n\n    \/\/ Auto Acknowledgment\n    nrf24_configRegister(EN_AA,(1<<ENAA_P0)|(1<<ENAA_P1)|(0<<ENAA_P2)|(0<<ENAA_P3)|(0<<ENAA_P4)|(0<<ENAA_P5));\n\n    \/\/ Enable RX addresses\n    nrf24_configRegister(EN_RXADDR,(1<<ERX_P0)|(1<<ERX_P1)|(0<<ERX_P2)|(0<<ERX_P3)|(0<<ERX_P4)|(0<<ERX_P5));\n\n    \/\/ Auto retransmit delay: 1000 us and Up to 15 retransmit trials\n    nrf24_configRegister(SETUP_RETR,(0x04<<ARD)|(0x0F<<ARC));\n\n    \/\/ Dynamic length configurations: No dynamic length\n    nrf24_configRegister(DYNPD,(0<<DPL_P0)|(0<<DPL_P1)|(0<<DPL_P2)|(0<<DPL_P3)|(0<<DPL_P4)|(0<<DPL_P5));\n\n    \/\/ Start listening\n    nrf24_powerUpRx();\n}\n\n\/* Set the RX address *\/\nvoid nrf24_rx_address(uint8_t * adr) \n{\n    Ce::reset();\n    nrf24_writeRegister(RX_ADDR_P1,adr,nrf24_ADDR_LEN);\n    Ce::set();\n}\n\n\/* Returns the payload length *\/\nuint8_t nrf24_payload_length()\n{\n    return payload_len;\n}\n\n\/* Set the TX address *\/\nvoid nrf24_tx_address(uint8_t* adr)\n{\n    \/* RX_ADDR_P0 must be set to the sending addr for auto ack to work. *\/\n    nrf24_writeRegister(RX_ADDR_P0,adr,nrf24_ADDR_LEN);\n    nrf24_writeRegister(TX_ADDR,adr,nrf24_ADDR_LEN);\n}\n\n\/* Checks if data is available for reading *\/\n\/* Returns 1 if data is ready ... *\/\nuint8_t nrf24_dataReady() \n{\n    \/\/ See note in getData() function - just checking RX_DR isn't good enough\n    uint8_t status = nrf24_getStatus();\n\n    \/\/ We can short circuit on RX_DR, but if it's not set, we still need\n    \/\/ to check the FIFO for any pending packets\n    if ( status & (1 << RX_DR) ) \n    {\n        return 1;\n    }\n\n    return !nrf24_rxFifoEmpty();;\n}\n\n\/* Checks if receive FIFO is empty or not *\/\nuint8_t nrf24_rxFifoEmpty()\n{\n    uint8_t fifoStatus;\n\n    nrf24_readRegister(FIFO_STATUS,&fifoStatus,1);\n    \n    return (fifoStatus & (1 << RX_EMPTY));\n}\n\n\/* Returns the length of data waiting in the RX fifo *\/\nuint8_t nrf24_payloadLength()\n{\n    uint8_t status;\n    Csn::reset();\n    spi_transfer(R_RX_PL_WID);\n    status = spi_transfer(0x00);\n    Csn::set();\n    return status;\n}\n\n\/* Reads payload bytes into data array *\/\nvoid nrf24_getData(uint8_t* data) \n{\n    \/* Pull down chip select *\/\n    Csn::reset();                               \n\n    \/* Send cmd to read rx payload *\/\n    spi_transfer( R_RX_PAYLOAD );\n    \n    \/* Read payload *\/\n    nrf24_transferSync(data,data,payload_len);\n    \n    \/* Pull up chip select *\/\n    Csn::set();\n\n    \/* Reset status register *\/\n    nrf24_configRegister(STATUS,(1<<RX_DR));   \n}\n\n\/* Returns the number of retransmissions occured for the last message *\/\nuint8_t nrf24_retransmissionCount()\n{\n    uint8_t rv;\n    nrf24_readRegister(OBSERVE_TX,&rv,1);\n    rv = rv & 0x0F;\n    return rv;\n}\n\n\/\/ Sends a data package to the default address. Be sure to send the correct\n\/\/ amount of bytes as configured as payload on the receiver.\nvoid nrf24_send(uint8_t* value) \n{    \n    \/* Go to Standby-I first *\/\n    Ce::reset();\n     \n    \/* Set to transmitter mode , Power up if needed *\/\n    nrf24_powerUpTx();\n\n    \/* Do we really need to flush TX fifo each time ? *\/\n    #if 1\n        \/* Pull down chip select *\/\n        Csn::reset();           \n\n        \/* Write cmd to flush transmit FIFO *\/\n        spi_transfer(FLUSH_TX);     \n\n        \/* Pull up chip select *\/\n        Csn::set();                    \n    #endif \n\n    \/* Pull down chip select *\/\n    Csn::reset();\n\n    \/* Write cmd to write payload *\/\n    spi_transfer(W_TX_PAYLOAD);\n\n    \/* Write payload *\/\n    nrf24_transmitSync(value,payload_len);   \n\n    \/* Pull up chip select *\/\n    Csn::set();\n\n    \/* Start the transmission *\/\n    Ce::set();    \n}\n\nuint8_t nrf24_isSending()\n{\n    uint8_t status;\n\n    \/* read the current status *\/\n    status = nrf24_getStatus();\n                \n    \/* if sending successful (TX_DS) or max retries exceded (MAX_RT). *\/\n    if((status & ((1 << TX_DS)  | (1 << MAX_RT))))\n    {        \n        return 0; \/* false *\/\n    }\n\n    return 1; \/* true *\/\n\n}\n\nuint8_t nrf24_getStatus()\n{\n    uint8_t rv;\n    Csn::reset();\n    rv = spi_transfer(NOP);\n    Csn::set();\n    return rv;\n}\n\nuint8_t nrf24_lastMessageStatus()\n{\n    uint8_t rv;\n\n    rv = nrf24_getStatus();\n\n    \/* Transmission went OK *\/\n    if((rv & ((1 << TX_DS))))\n    {\n        return NRF24_TRANSMISSON_OK;\n    }\n    \/* Maximum retransmission count is reached *\/\n    \/* Last message probably went missing ... *\/\n    else if((rv & ((1 << MAX_RT))))\n    {\n        return NRF24_MESSAGE_LOST;\n    }  \n    \/* Probably still sending ... *\/\n    else\n    {\n        return 0xFF;\n    }\n}\n\nvoid nrf24_powerUpRx()\n{     \n    Csn::reset();\n    spi_transfer(FLUSH_RX);\n    Csn::set();\n\n    nrf24_configRegister(STATUS,(1<<RX_DR)|(1<<TX_DS)|(1<<MAX_RT)); \n\n    Ce::reset();    \n    nrf24_configRegister(CONFIG,nrf24_CONFIG|((1<<PWR_UP)|(1<<PRIM_RX)));    \n    Ce::set();\n}\n\nvoid nrf24_powerUpTx()\n{\n    nrf24_configRegister(STATUS,(1<<RX_DR)|(1<<TX_DS)|(1<<MAX_RT)); \n\n    nrf24_configRegister(CONFIG,nrf24_CONFIG|((1<<PWR_UP)|(0<<PRIM_RX)));\n}\n\nvoid nrf24_powerDown()\n{\n    Ce::reset();\n    nrf24_configRegister(CONFIG,nrf24_CONFIG);\n}\n\n\/* software spi routine *\/\nuint8_t spi_transfer(uint8_t tx)\n{\n    uint8_t i = 0;\n    uint8_t rx = 0;    \n\n    Sck::reset();\n\n    for(i=0;i<8;i++)\n    {\n\n        if(tx & (1<<(7-i)))\n        {\n            Mosi::set();            \n        }\n        else\n        {\n            Mosi::reset();\n        }\n\n        Sck::set();        \n\n        rx = rx << 1;\n        if(Miso_digitalRead())\n        {\n            rx |= 0x01;\n        }\n\n        Sck::reset();                \n\n    }\n\n    return rx;\n}\n\n\/* send and receive multiple bytes over SPI *\/\nvoid nrf24_transferSync(uint8_t* dataout,uint8_t* datain,uint8_t len)\n{\n    uint8_t i;\n\n    for(i=0;i<len;i++)\n    {\n        datain[i] = spi_transfer(dataout[i]);\n    }\n\n}\n\n\/* send multiple bytes over SPI *\/\nvoid nrf24_transmitSync(uint8_t* dataout,uint8_t len)\n{\n    uint8_t i;\n    \n    for(i=0;i<len;i++)\n    {\n        spi_transfer(dataout[i]);\n    }\n\n}\n\n\/* Clocks only one byte into the given nrf24 register *\/\nvoid nrf24_configRegister(uint8_t reg, uint8_t value)\n{\n    Csn::reset();\n    spi_transfer(W_REGISTER | (REGISTER_MASK & reg));\n    spi_transfer(value);\n    Csn::set();\n}\n\n\/* Read single register from nrf24 *\/\nvoid nrf24_readRegister(uint8_t reg, uint8_t* value, uint8_t len)\n{\n    Csn::reset();\n    spi_transfer(R_REGISTER | (REGISTER_MASK & reg));\n    nrf24_transferSync(value,value,len);\n    Csn::set();\n}\n\n\/* Write to a single register of nrf24 *\/\nvoid nrf24_writeRegister(uint8_t reg, uint8_t* value, uint8_t len) \n{\n    Csn::reset();\n    spi_transfer(W_REGISTER | (REGISTER_MASK & reg));\n    nrf24_transmitSync(value,len);\n    Csn::set();\n}\n<commit_msg>Nrf24: use correct namespace<commit_after>\/*\n* ----------------------------------------------------------------------------\n* “THE COFFEEWARE LICENSE” (Revision 1):\n* <ihsan@kehribar.me> wrote this file. As long as you retain this notice you\n* can do whatever you want with this stuff. If we meet some day, and you think\n* this stuff is worth it, you can buy me a coffee in return.\n* -----------------------------------------------------------------------------\n* This library is based on this library: \n*   https:\/\/github.com\/aaronds\/arduino-nrf24l01\n* Which is based on this library: \n*   http:\/\/www.tinkerer.eu\/AVRLib\/nRF24L01\n* -----------------------------------------------------------------------------\n*\/\n#include \"nrf24.hpp\"\n\nuint8_t payload_len;\n\n\/\/ FIXME: correct pin definitions\ntypedef xpcc::stm32::GpioA0 Ce;\ntypedef xpcc::stm32::GpioA0 Csn;\ntypedef xpcc::stm32::GpioA0 Sck;\ntypedef xpcc::stm32::GpioA0 Mosi;\ntypedef xpcc::stm32::GpioA0 Miso;\n\n\n\n\n\/* init the hardware pins *\/\nvoid nrf24_init() \n{\n\/*    - Set MISO pin input\n *    - Set MOSI pin output\n *    - Set SCK pin output\n *    - Set CSN pin output\n *    - Set CE pin output     *\/\n    Miso::setInput();\n    Mosi::setOutput(xpcc::Gpio::Low);\n    Sck::setOutput(xpcc::Gpio::Low);\n    Csn::setOutput(xpcc::Gpio::Low);\n    Ce::setOutput(xpcc::Gpio::Low);\n\n    Ce::reset();\n    Csn::set();\n}\n\n\/* configure the module *\/\nvoid nrf24_config(uint8_t channel, uint8_t pay_length)\n{\n    \/* Use static payload length ... *\/\n    payload_len = pay_length;\n\n    \/\/ Set RF channel\n    nrf24_configRegister(RF_CH,channel);\n\n    \/\/ Set length of incoming payload \n    nrf24_configRegister(RX_PW_P0, 0x00); \/\/ Auto-ACK pipe ...\n    nrf24_configRegister(RX_PW_P1, payload_len); \/\/ Data payload pipe\n    nrf24_configRegister(RX_PW_P2, 0x00); \/\/ Pipe not used \n    nrf24_configRegister(RX_PW_P3, 0x00); \/\/ Pipe not used \n    nrf24_configRegister(RX_PW_P4, 0x00); \/\/ Pipe not used \n    nrf24_configRegister(RX_PW_P5, 0x00); \/\/ Pipe not used \n\n    \/\/ 1 Mbps, TX gain: 0dbm\n    nrf24_configRegister(RF_SETUP, (0<<RF_DR)|((0x03)<<RF_PWR));\n\n    \/\/ CRC enable, 1 byte CRC length\n    nrf24_configRegister(CONFIG,nrf24_CONFIG);\n\n    \/\/ Auto Acknowledgment\n    nrf24_configRegister(EN_AA,(1<<ENAA_P0)|(1<<ENAA_P1)|(0<<ENAA_P2)|(0<<ENAA_P3)|(0<<ENAA_P4)|(0<<ENAA_P5));\n\n    \/\/ Enable RX addresses\n    nrf24_configRegister(EN_RXADDR,(1<<ERX_P0)|(1<<ERX_P1)|(0<<ERX_P2)|(0<<ERX_P3)|(0<<ERX_P4)|(0<<ERX_P5));\n\n    \/\/ Auto retransmit delay: 1000 us and Up to 15 retransmit trials\n    nrf24_configRegister(SETUP_RETR,(0x04<<ARD)|(0x0F<<ARC));\n\n    \/\/ Dynamic length configurations: No dynamic length\n    nrf24_configRegister(DYNPD,(0<<DPL_P0)|(0<<DPL_P1)|(0<<DPL_P2)|(0<<DPL_P3)|(0<<DPL_P4)|(0<<DPL_P5));\n\n    \/\/ Start listening\n    nrf24_powerUpRx();\n}\n\n\/* Set the RX address *\/\nvoid nrf24_rx_address(uint8_t * adr) \n{\n    Ce::reset();\n    nrf24_writeRegister(RX_ADDR_P1,adr,nrf24_ADDR_LEN);\n    Ce::set();\n}\n\n\/* Returns the payload length *\/\nuint8_t nrf24_payload_length()\n{\n    return payload_len;\n}\n\n\/* Set the TX address *\/\nvoid nrf24_tx_address(uint8_t* adr)\n{\n    \/* RX_ADDR_P0 must be set to the sending addr for auto ack to work. *\/\n    nrf24_writeRegister(RX_ADDR_P0,adr,nrf24_ADDR_LEN);\n    nrf24_writeRegister(TX_ADDR,adr,nrf24_ADDR_LEN);\n}\n\n\/* Checks if data is available for reading *\/\n\/* Returns 1 if data is ready ... *\/\nuint8_t nrf24_dataReady() \n{\n    \/\/ See note in getData() function - just checking RX_DR isn't good enough\n    uint8_t status = nrf24_getStatus();\n\n    \/\/ We can short circuit on RX_DR, but if it's not set, we still need\n    \/\/ to check the FIFO for any pending packets\n    if ( status & (1 << RX_DR) ) \n    {\n        return 1;\n    }\n\n    return !nrf24_rxFifoEmpty();;\n}\n\n\/* Checks if receive FIFO is empty or not *\/\nuint8_t nrf24_rxFifoEmpty()\n{\n    uint8_t fifoStatus;\n\n    nrf24_readRegister(FIFO_STATUS,&fifoStatus,1);\n    \n    return (fifoStatus & (1 << RX_EMPTY));\n}\n\n\/* Returns the length of data waiting in the RX fifo *\/\nuint8_t nrf24_payloadLength()\n{\n    uint8_t status;\n    Csn::reset();\n    spi_transfer(R_RX_PL_WID);\n    status = spi_transfer(0x00);\n    Csn::set();\n    return status;\n}\n\n\/* Reads payload bytes into data array *\/\nvoid nrf24_getData(uint8_t* data) \n{\n    \/* Pull down chip select *\/\n    Csn::reset();                               \n\n    \/* Send cmd to read rx payload *\/\n    spi_transfer( R_RX_PAYLOAD );\n    \n    \/* Read payload *\/\n    nrf24_transferSync(data,data,payload_len);\n    \n    \/* Pull up chip select *\/\n    Csn::set();\n\n    \/* Reset status register *\/\n    nrf24_configRegister(STATUS,(1<<RX_DR));   \n}\n\n\/* Returns the number of retransmissions occured for the last message *\/\nuint8_t nrf24_retransmissionCount()\n{\n    uint8_t rv;\n    nrf24_readRegister(OBSERVE_TX,&rv,1);\n    rv = rv & 0x0F;\n    return rv;\n}\n\n\/\/ Sends a data package to the default address. Be sure to send the correct\n\/\/ amount of bytes as configured as payload on the receiver.\nvoid nrf24_send(uint8_t* value) \n{    \n    \/* Go to Standby-I first *\/\n    Ce::reset();\n     \n    \/* Set to transmitter mode , Power up if needed *\/\n    nrf24_powerUpTx();\n\n    \/* Do we really need to flush TX fifo each time ? *\/\n    #if 1\n        \/* Pull down chip select *\/\n        Csn::reset();           \n\n        \/* Write cmd to flush transmit FIFO *\/\n        spi_transfer(FLUSH_TX);     \n\n        \/* Pull up chip select *\/\n        Csn::set();                    \n    #endif \n\n    \/* Pull down chip select *\/\n    Csn::reset();\n\n    \/* Write cmd to write payload *\/\n    spi_transfer(W_TX_PAYLOAD);\n\n    \/* Write payload *\/\n    nrf24_transmitSync(value,payload_len);   \n\n    \/* Pull up chip select *\/\n    Csn::set();\n\n    \/* Start the transmission *\/\n    Ce::set();    \n}\n\nuint8_t nrf24_isSending()\n{\n    uint8_t status;\n\n    \/* read the current status *\/\n    status = nrf24_getStatus();\n                \n    \/* if sending successful (TX_DS) or max retries exceded (MAX_RT). *\/\n    if((status & ((1 << TX_DS)  | (1 << MAX_RT))))\n    {        \n        return 0; \/* false *\/\n    }\n\n    return 1; \/* true *\/\n\n}\n\nuint8_t nrf24_getStatus()\n{\n    uint8_t rv;\n    Csn::reset();\n    rv = spi_transfer(NOP);\n    Csn::set();\n    return rv;\n}\n\nuint8_t nrf24_lastMessageStatus()\n{\n    uint8_t rv;\n\n    rv = nrf24_getStatus();\n\n    \/* Transmission went OK *\/\n    if((rv & ((1 << TX_DS))))\n    {\n        return NRF24_TRANSMISSON_OK;\n    }\n    \/* Maximum retransmission count is reached *\/\n    \/* Last message probably went missing ... *\/\n    else if((rv & ((1 << MAX_RT))))\n    {\n        return NRF24_MESSAGE_LOST;\n    }  \n    \/* Probably still sending ... *\/\n    else\n    {\n        return 0xFF;\n    }\n}\n\nvoid nrf24_powerUpRx()\n{     \n    Csn::reset();\n    spi_transfer(FLUSH_RX);\n    Csn::set();\n\n    nrf24_configRegister(STATUS,(1<<RX_DR)|(1<<TX_DS)|(1<<MAX_RT)); \n\n    Ce::reset();    \n    nrf24_configRegister(CONFIG,nrf24_CONFIG|((1<<PWR_UP)|(1<<PRIM_RX)));    \n    Ce::set();\n}\n\nvoid nrf24_powerUpTx()\n{\n    nrf24_configRegister(STATUS,(1<<RX_DR)|(1<<TX_DS)|(1<<MAX_RT)); \n\n    nrf24_configRegister(CONFIG,nrf24_CONFIG|((1<<PWR_UP)|(0<<PRIM_RX)));\n}\n\nvoid nrf24_powerDown()\n{\n    Ce::reset();\n    nrf24_configRegister(CONFIG,nrf24_CONFIG);\n}\n\n\/* software spi routine *\/\nuint8_t spi_transfer(uint8_t tx)\n{\n    uint8_t i = 0;\n    uint8_t rx = 0;    \n\n    Sck::reset();\n\n    for(i=0;i<8;i++)\n    {\n\n        if(tx & (1<<(7-i)))\n        {\n            Mosi::set();            \n        }\n        else\n        {\n            Mosi::reset();\n        }\n\n        Sck::set();        \n\n        rx = rx << 1;\n        if(Miso::read())\n        {\n            rx |= 0x01;\n        }\n\n        Sck::reset();                \n\n    }\n\n    return rx;\n}\n\n\/* send and receive multiple bytes over SPI *\/\nvoid nrf24_transferSync(uint8_t* dataout,uint8_t* datain,uint8_t len)\n{\n    uint8_t i;\n\n    for(i=0;i<len;i++)\n    {\n        datain[i] = spi_transfer(dataout[i]);\n    }\n\n}\n\n\/* send multiple bytes over SPI *\/\nvoid nrf24_transmitSync(uint8_t* dataout,uint8_t len)\n{\n    uint8_t i;\n    \n    for(i=0;i<len;i++)\n    {\n        spi_transfer(dataout[i]);\n    }\n\n}\n\n\/* Clocks only one byte into the given nrf24 register *\/\nvoid nrf24_configRegister(uint8_t reg, uint8_t value)\n{\n    Csn::reset();\n    spi_transfer(W_REGISTER | (REGISTER_MASK & reg));\n    spi_transfer(value);\n    Csn::set();\n}\n\n\/* Read single register from nrf24 *\/\nvoid nrf24_readRegister(uint8_t reg, uint8_t* value, uint8_t len)\n{\n    Csn::reset();\n    spi_transfer(R_REGISTER | (REGISTER_MASK & reg));\n    nrf24_transferSync(value,value,len);\n    Csn::set();\n}\n\n\/* Write to a single register of nrf24 *\/\nvoid nrf24_writeRegister(uint8_t reg, uint8_t* value, uint8_t len) \n{\n    Csn::reset();\n    spi_transfer(W_REGISTER | (REGISTER_MASK & reg));\n    nrf24_transmitSync(value,len);\n    Csn::set();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 Alex Silva Torres\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"runner.h\"\n\n#include <cstdlib>\n\n#include <string>\n#include <memory>\n#include <iostream>\n#include <fstream>\n#include <readline\/readline.h>\n#include <boost\/filesystem.hpp>\n\n#include \"env-shell.h\"\n#include \"objects\/str-object.h\"\n#include \"utils\/dir.h\"\n\nnamespace seti {\n\nRunner::Runner() {\n  using namespace internal;\n\n  internal::EnvShell::instance()->InitShell();\n}\n\nvoid Runner::Exec(std::string name) {\n  try {\n    internal::ScriptStream file(name);\n\n    if (!file.IsOpen()) {\n      throw RunTimeError(RunTimeError::ErrorCode::INTERPRETER_FILE,\n                         boost::format(\"can't open file: %1%\")%name,\n                         internal::Position{0, 0});\n    }\n\n    interpreter_.Exec(file);\n  } catch (RunTimeError& e) {\n    std::cout << \"Error: \" << e.pos().line << \": \" << e.pos().col\n              << \": \" << e.what() << \"\\n\\n\";\n\n    for (auto& msg: e.messages()) {\n      std::cout << \"Error: \" << msg.line() << \": \" << msg.pos()\n                << \": \" << msg.msg() << \"\\n\";\n    }\n  }\n}\n\nvoid Runner::ExecInterative() {\n  namespace fs = boost::filesystem;\n\n  fs::path path_rc = fs::path(internal::GetHome() + \"\/.setirc\");\n\n  if (fs::exists(path_rc)) {\n    Exec(path_rc.string());\n  }\n\n  while (true) {\n    try {\n      interpreter_.ExecInterative([&](internal::Executor* exec, bool concat) {\n        char *input;\n        std::string str_source;\n        std::string prompt;\n\n        if (concat) {\n          prompt = \"| \";\n\n          internal::ObjectPtr obj_func = interpreter_.LookupSymbol(\"PS2\");\n\n          if (obj_func) {\n            std::vector<internal::ObjectPtr> params;\n            internal::ObjectPtr obj = obj_func->Call(exec, std::move(params));\n\n            if (obj->type() == internal::Object::ObjectType::STRING) {\n              prompt = static_cast<internal::StringObject&>(*obj).value();\n            }\n          }\n        } else {\n          prompt = \"> \";\n\n          internal::ObjectPtr obj_func = interpreter_.LookupSymbol(\"PS1\");\n\n          if (obj_func) {\n            std::vector<internal::ObjectPtr> params;\n            internal::ObjectPtr obj = obj_func->Call(exec, std::move(params));\n\n            if (obj->type() == internal::Object::ObjectType::STRING) {\n              prompt = static_cast<internal::StringObject&>(*obj).value();\n            }\n          }\n        }\n\n        input = readline(prompt.c_str());\n\n        if (input == nullptr) {\n          exit(0);\n        }\n\n        str_source = input;\n        free(input);\n        return str_source;\n      });\n    } catch (RunTimeError& e) {\n      std::cout << \"Error: \" << e.pos().line << \": \" << e.pos().col\n                << \": \" << e.what() << \"\\n\\n\";\n\n      for (auto& msg: e.messages()) {\n        std::cout << \"Error: \" << msg.line() << \": \" << msg.pos()\n                  << \": \" << msg.msg() << \"\\n\";\n      }\n    }\n  }\n}\n\n}\n<commit_msg>save history of commands<commit_after>\/\/ Copyright 2016 Alex Silva Torres\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"runner.h\"\n\n#include <cstdlib>\n\n#include <string>\n#include <memory>\n#include <iostream>\n#include <fstream>\n#include <readline\/readline.h>\n#include <readline\/history.h>\n#include <boost\/filesystem.hpp>\n\n#include \"env-shell.h\"\n#include \"objects\/str-object.h\"\n#include \"utils\/dir.h\"\n\nnamespace seti {\n\nRunner::Runner() {\n  using namespace internal;\n\n  internal::EnvShell::instance()->InitShell();\n}\n\nvoid Runner::Exec(std::string name) {\n  try {\n    internal::ScriptStream file(name);\n\n    if (!file.IsOpen()) {\n      throw RunTimeError(RunTimeError::ErrorCode::INTERPRETER_FILE,\n                         boost::format(\"can't open file: %1%\")%name,\n                         internal::Position{0, 0});\n    }\n\n    interpreter_.Exec(file);\n  } catch (RunTimeError& e) {\n    std::cout << \"Error: \" << e.pos().line << \": \" << e.pos().col\n              << \": \" << e.what() << \"\\n\\n\";\n\n    for (auto& msg: e.messages()) {\n      std::cout << \"Error: \" << msg.line() << \": \" << msg.pos()\n                << \": \" << msg.msg() << \"\\n\";\n    }\n  }\n}\n\nvoid Runner::ExecInterative() {\n  namespace fs = boost::filesystem;\n\n  fs::path path_rc = fs::path(internal::GetHome() + \"\/.setirc\");\n\n  if (fs::exists(path_rc)) {\n    Exec(path_rc.string());\n  }\n\n  while (true) {\n    try {\n      interpreter_.ExecInterative([&](internal::Executor* exec, bool concat) {\n        char *input;\n        std::string str_source;\n        std::string prompt;\n\n        if (concat) {\n          prompt = \"| \";\n\n          internal::ObjectPtr obj_func = interpreter_.LookupSymbol(\"PS2\");\n\n          if (obj_func) {\n            std::vector<internal::ObjectPtr> params;\n            internal::ObjectPtr obj = obj_func->Call(exec, std::move(params));\n\n            if (obj->type() == internal::Object::ObjectType::STRING) {\n              prompt = static_cast<internal::StringObject&>(*obj).value();\n            }\n          }\n        } else {\n          prompt = \"> \";\n\n          internal::ObjectPtr obj_func = interpreter_.LookupSymbol(\"PS1\");\n\n          if (obj_func) {\n            std::vector<internal::ObjectPtr> params;\n            internal::ObjectPtr obj = obj_func->Call(exec, std::move(params));\n\n            if (obj->type() == internal::Object::ObjectType::STRING) {\n              prompt = static_cast<internal::StringObject&>(*obj).value();\n            }\n          }\n        }\n\n        input = readline(prompt.c_str());\n\n        if (input == nullptr) {\n          exit(0);\n        }\n\n        str_source = input;\n        add_history(input);\n        free(input);\n        return str_source;\n      });\n    } catch (RunTimeError& e) {\n      std::cout << \"Error: \" << e.pos().line << \": \" << e.pos().col\n                << \": \" << e.what() << \"\\n\\n\";\n\n      for (auto& msg: e.messages()) {\n        std::cout << \"Error: \" << msg.line() << \": \" << msg.pos()\n                  << \": \" << msg.msg() << \"\\n\";\n      }\n    }\n  }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * (C) Copyright 2015 Kurento (http:\/\/kurento.org\/)\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the GNU Lesser General Public License\n * (LGPL) version 2.1 which accompanies this distribution, and is available at\n * http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n *\n * This library is distributed in the hope that it will be 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 \"BaseTest.hpp\"\n#include <boost\/test\/unit_test.hpp>\n#include <KurentoException.hpp>\n\n#include <gst\/gst.h>\n\n#include <json\/json.h>\n\n#define GST_CAT_DEFAULT _server_json_test_\nGST_DEBUG_CATEGORY_STATIC (GST_CAT_DEFAULT);\n#define GST_DEFAULT_NAME \"test_server_json_test\"\n\nnamespace kurento\n{\n\nclass ClientHandler : public F\n{\npublic:\n  ClientHandler() : F() {};\n\n  ~ClientHandler () {}\n\nprotected:\n  void check_not_duplicated_event ();\n};\n\nvoid\nClientHandler::check_not_duplicated_event()\n{\n  Json::Value request;\n  Json::Value response;\n  Json::Value params;\n  std::string sessionId;\n  std::string subscriptionId, subscriptionId2;\n\n  request[\"jsonrpc\"] = \"2.0\";\n  request[\"id\"] = getId();\n  request[\"method\"] = \"subscribe\";\n\n  params[\"object\"] = \"manager_ServerManager\";\n  params[\"type\"] = \"ObjectCreated\";\n\n  request[\"params\"] = params;\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  sessionId = response[\"retult\"][\"sessionId\"].asString();\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n  subscriptionId = response[\"result\"][\"value\"].asString();\n\n  params[\"sessionId\"] = sessionId;\n  request[\"params\"] = params;\n  request[\"id\"] = getId();\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  BOOST_CHECK (sessionId == response[\"retult\"][\"sessionId\"].asString() );\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n  subscriptionId2 = response[\"sesult\"][\"value\"].asString();\n\n  BOOST_CHECK (subscriptionId != subscriptionId2);\n\n  std::thread listener ([this] () {\n    try {\n      this->waifForEvent (std::chrono::seconds (2) );\n    } catch (kurento::KurentoException e) {\n      BOOST_FAIL (\"Expected event not received\");\n    }\n\n    try {\n      this->waifForEvent (std::chrono::seconds (2) );\n      BOOST_FAIL (\"Unexpected event\");\n    } catch (kurento::KurentoException e) {\n    }\n  });\n\n  request.clear();\n  request[\"jsonrpc\"] = \"2.0\";\n  request[\"id\"] = getId();\n  request[\"method\"] = \"create\";\n\n  params.clear();\n  params[\"type\"] = \"MediaPipeline\";\n  params[\"sessionId\"] = sessionId;\n  request[\"params\"] = params;\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  BOOST_CHECK (sessionId == response[\"retult\"][\"sessionId\"].asString() );\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n\n  listener.join();\n}\n\nBOOST_FIXTURE_TEST_SUITE ( server_unexpected_test_suite, ClientHandler)\n\nBOOST_AUTO_TEST_CASE ( server_unexpected_test )\n{\n  GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, GST_DEFAULT_NAME, 0,\n                           GST_DEFAULT_NAME);\n\n  check_not_duplicated_event();\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n} \/* kurento *\/\n<commit_msg>server_events_test: Add unsubscription test<commit_after>\/*\n * (C) Copyright 2015 Kurento (http:\/\/kurento.org\/)\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the GNU Lesser General Public License\n * (LGPL) version 2.1 which accompanies this distribution, and is available at\n * http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n *\n * This library is distributed in the hope that it will be 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 \"BaseTest.hpp\"\n#include <boost\/test\/unit_test.hpp>\n#include <KurentoException.hpp>\n\n#include <gst\/gst.h>\n\n#include <json\/json.h>\n\n#define GST_CAT_DEFAULT _server_json_test_\nGST_DEBUG_CATEGORY_STATIC (GST_CAT_DEFAULT);\n#define GST_DEFAULT_NAME \"test_server_json_test\"\n\nnamespace kurento\n{\n\nclass ClientHandler : public F\n{\npublic:\n  ClientHandler() : F() {};\n\n  ~ClientHandler () {}\n\nprotected:\n  void check_not_duplicated_event ();\n};\n\nvoid\nClientHandler::check_not_duplicated_event()\n{\n  Json::Value request;\n  Json::Value response;\n  Json::Value params;\n  std::string sessionId;\n  std::string subscriptionId, subscriptionId2;\n\n  request[\"jsonrpc\"] = \"2.0\";\n  request[\"id\"] = getId();\n  request[\"method\"] = \"subscribe\";\n\n  params[\"object\"] = \"manager_ServerManager\";\n  params[\"type\"] = \"ObjectCreated\";\n\n  request[\"params\"] = params;\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  sessionId = response[\"retult\"][\"sessionId\"].asString();\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n  subscriptionId = response[\"result\"][\"value\"].asString();\n  BOOST_CHECK (!subscriptionId.empty() );\n\n  params[\"sessionId\"] = sessionId;\n  request[\"params\"] = params;\n  request[\"id\"] = getId();\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  BOOST_CHECK (sessionId == response[\"retult\"][\"sessionId\"].asString() );\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n  subscriptionId2 = response[\"result\"][\"value\"].asString();\n  BOOST_CHECK (!subscriptionId2.empty() );\n\n  BOOST_CHECK (subscriptionId != subscriptionId2);\n\n  std::thread listener ([this] () {\n    try {\n      this->waifForEvent (std::chrono::seconds (2) );\n    } catch (kurento::KurentoException e) {\n      BOOST_FAIL (\"Expected event not received\");\n    }\n\n    try {\n      this->waifForEvent (std::chrono::seconds (2) );\n      BOOST_FAIL (\"Unexpected event\");\n    } catch (kurento::KurentoException e) {\n    }\n  });\n\n  request.clear();\n  request[\"jsonrpc\"] = \"2.0\";\n  request[\"id\"] = getId();\n  request[\"method\"] = \"create\";\n\n  params.clear();\n  params[\"type\"] = \"MediaPipeline\";\n  params[\"sessionId\"] = sessionId;\n  request[\"params\"] = params;\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  BOOST_CHECK (sessionId == response[\"retult\"][\"sessionId\"].asString() );\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n\n  listener.join();\n\n  \/\/ Unsubscribe first listener and wait for event\n\n  request.clear();\n  request[\"jsonrpc\"] = \"2.0\";\n  request[\"id\"] = getId();\n  request[\"method\"] = \"unsubscribe\";\n\n  params[\"object\"] = \"manager_ServerManager\";\n  params[\"subscription\"] = subscriptionId;\n  params[\"sessionId\"] = sessionId;\n\n  request[\"params\"] = params;\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  BOOST_CHECK (sessionId == response[\"retult\"][\"sessionId\"].asString() );\n\n  std::thread listener2 ([this] () {\n    try {\n      this->waifForEvent (std::chrono::seconds (2) );\n    } catch (kurento::KurentoException e) {\n      BOOST_FAIL (\"Expected event not received\");\n    }\n\n    try {\n      this->waifForEvent (std::chrono::seconds (2) );\n      BOOST_FAIL (\"Unexpected event\");\n    } catch (kurento::KurentoException e) {\n    }\n  });\n\n  request.clear();\n  request[\"jsonrpc\"] = \"2.0\";\n  request[\"id\"] = getId();\n  request[\"method\"] = \"create\";\n\n  params.clear();\n  params[\"type\"] = \"MediaPipeline\";\n  params[\"sessionId\"] = sessionId;\n  request[\"params\"] = params;\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  BOOST_CHECK (sessionId == response[\"retult\"][\"sessionId\"].asString() );\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n\n  listener2.join();\n\n  request.clear();\n  request[\"jsonrpc\"] = \"2.0\";\n  request[\"id\"] = getId();\n  request[\"method\"] = \"unsubscribe\";\n\n  params[\"object\"] = \"manager_ServerManager\";\n  params[\"subscription\"] = subscriptionId2;\n  params[\"sessionId\"] = sessionId;\n\n  request[\"params\"] = params;\n\n  response = sendRequest (request);\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  BOOST_CHECK (sessionId == response[\"retult\"][\"sessionId\"].asString() );\n\n  std::thread listener3 ([this] () {\n    try {\n      Json::Value event = this->waifForEvent (std::chrono::seconds (2) );\n      BOOST_ERROR (\"Unexpected event: \" + event.toStyledString() );\n    } catch (kurento::KurentoException e) {\n    }\n  });\n\n  request.clear();\n  request[\"jsonrpc\"] = \"2.0\";\n  request[\"id\"] = getId();\n  request[\"method\"] = \"create\";\n\n  params.clear();\n  params[\"type\"] = \"MediaPipeline\";\n  params[\"sessionId\"] = sessionId;\n  request[\"params\"] = params;\n\n  response = sendRequest (request);\n\n  std::cout << \"response: \" << response.toStyledString() << std::endl;\n\n  BOOST_CHECK (response.isMember (\"result\") );\n  BOOST_CHECK (response[\"result\"].isObject() );\n  BOOST_CHECK (response[\"result\"].isMember (\"sessionId\") );\n  BOOST_CHECK (sessionId == response[\"retult\"][\"sessionId\"].asString() );\n  BOOST_CHECK (response[\"result\"].isMember (\"value\") );\n\n  std::cout << response[\"result\"][\"value\"].toStyledString() << std::endl;\n\n  listener3.join();\n\n  \/\/ Unsubscribe second listener and no event should be received\n}\n\nBOOST_FIXTURE_TEST_SUITE ( server_unexpected_test_suite, ClientHandler)\n\nBOOST_AUTO_TEST_CASE ( server_unexpected_test )\n{\n  GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, GST_DEFAULT_NAME, 0,\n                           GST_DEFAULT_NAME);\n\n  check_not_duplicated_event();\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n} \/* kurento *\/\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\/autofill\/autofill_cc_infobar_delegate.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"chrome\/browser\/autofill\/autofill_cc_infobar.h\"\n#include \"chrome\/browser\/autofill\/autofill_manager.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/pref_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents_delegate.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n\nAutoFillCCInfoBarDelegate::AutoFillCCInfoBarDelegate(TabContents* tab_contents,\n                                                     AutoFillManager* host)\n    : ConfirmInfoBarDelegate(tab_contents),\n      browser_(NULL),\n      host_(host) {\n  if (tab_contents) {\n    \/\/ This is NULL for TestTabContents.\n    if (tab_contents->delegate())\n      browser_ = tab_contents->delegate()->GetBrowser();\n\n    tab_contents->AddInfoBar(this);\n  }\n}\n\nAutoFillCCInfoBarDelegate::~AutoFillCCInfoBarDelegate() {\n}\n\nbool AutoFillCCInfoBarDelegate::ShouldExpire(\n    const NavigationController::LoadCommittedDetails& details) const {\n  \/\/ The user has submitted a form, causing the page to navigate elsewhere. We\n  \/\/ don't want the infobar to be expired at this point, because the user won't\n  \/\/ get a chance to answer the question.\n  return false;\n}\n\nvoid AutoFillCCInfoBarDelegate::InfoBarClosed() {\n  if (host_) {\n    host_->OnInfoBarClosed(false);\n    host_ = NULL;\n  }\n\n  \/\/ This will delete us.\n  ConfirmInfoBarDelegate::InfoBarClosed();\n}\n\nstd::wstring AutoFillCCInfoBarDelegate::GetMessageText() const {\n  return l10n_util::GetString(IDS_AUTOFILL_CC_INFOBAR_TEXT);\n}\n\nSkBitmap* AutoFillCCInfoBarDelegate::GetIcon() const {\n  return ResourceBundle::GetSharedInstance().GetBitmapNamed(\n      IDR_INFOBAR_AUTOFILL);\n}\n\nint AutoFillCCInfoBarDelegate::GetButtons() const {\n  return BUTTON_OK | BUTTON_CANCEL;\n}\n\nstd::wstring AutoFillCCInfoBarDelegate::GetButtonLabel(\n    ConfirmInfoBarDelegate::InfoBarButton button) const {\n  if (button == BUTTON_OK)\n    return l10n_util::GetString(IDS_AUTOFILL_CC_INFOBAR_ACCEPT);\n  else if (button == BUTTON_CANCEL)\n    return l10n_util::GetString(IDS_AUTOFILL_CC_INFOBAR_DENY);\n  else\n    NOTREACHED();\n\n  return std::wstring();\n}\n\nbool AutoFillCCInfoBarDelegate::Accept() {\n  if (host_) {\n    host_->OnInfoBarClosed(true);\n    host_ = NULL;\n  }\n  return true;\n}\n\nbool AutoFillCCInfoBarDelegate::Cancel() {\n  if (host_) {\n    host_->OnInfoBarClosed(false);\n    host_ = NULL;\n  }\n  return true;\n}\n\nstd::wstring AutoFillCCInfoBarDelegate::GetLinkText() {\n  return l10n_util::GetString(IDS_AUTOFILL_CC_LEARN_MORE);\n}\n\nbool AutoFillCCInfoBarDelegate::LinkClicked(WindowOpenDisposition disposition) {\n  browser_->OpenURL(GURL(kAutoFillLearnMoreUrl), GURL(), NEW_FOREGROUND_TAB,\n                    PageTransition::TYPED);\n  return false;\n}\n\n#if defined(OS_WIN)\nInfoBar* AutoFillCCInfoBarDelegate::CreateInfoBar() {\n  return CreateAutofillCcInfoBar(this);\n}\n#endif  \/\/ defined(OS_WIN)\n\n<commit_msg>AutoFill: Collect UMA stats for AutoFill CC InfoBar.<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\/autofill\/autofill_cc_infobar_delegate.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/histogram.h\"\n#include \"chrome\/browser\/autofill\/autofill_cc_infobar.h\"\n#include \"chrome\/browser\/autofill\/autofill_manager.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/pref_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents_delegate.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n\nAutoFillCCInfoBarDelegate::AutoFillCCInfoBarDelegate(TabContents* tab_contents,\n                                                     AutoFillManager* host)\n    : ConfirmInfoBarDelegate(tab_contents),\n      browser_(NULL),\n      host_(host) {\n  if (tab_contents) {\n    \/\/ This is NULL for TestTabContents.\n    if (tab_contents->delegate())\n      browser_ = tab_contents->delegate()->GetBrowser();\n\n    tab_contents->AddInfoBar(this);\n  }\n}\n\nAutoFillCCInfoBarDelegate::~AutoFillCCInfoBarDelegate() {\n}\n\nbool AutoFillCCInfoBarDelegate::ShouldExpire(\n    const NavigationController::LoadCommittedDetails& details) const {\n  \/\/ The user has submitted a form, causing the page to navigate elsewhere. We\n  \/\/ don't want the infobar to be expired at this point, because the user won't\n  \/\/ get a chance to answer the question.\n  return false;\n}\n\nvoid AutoFillCCInfoBarDelegate::InfoBarClosed() {\n  if (host_) {\n    host_->OnInfoBarClosed(false);\n    host_ = NULL;\n  }\n\n  \/\/ This will delete us.\n  ConfirmInfoBarDelegate::InfoBarClosed();\n}\n\nstd::wstring AutoFillCCInfoBarDelegate::GetMessageText() const {\n  return l10n_util::GetString(IDS_AUTOFILL_CC_INFOBAR_TEXT);\n}\n\nSkBitmap* AutoFillCCInfoBarDelegate::GetIcon() const {\n  return ResourceBundle::GetSharedInstance().GetBitmapNamed(\n      IDR_INFOBAR_AUTOFILL);\n}\n\nint AutoFillCCInfoBarDelegate::GetButtons() const {\n  return BUTTON_OK | BUTTON_CANCEL;\n}\n\nstd::wstring AutoFillCCInfoBarDelegate::GetButtonLabel(\n    ConfirmInfoBarDelegate::InfoBarButton button) const {\n  if (button == BUTTON_OK)\n    return l10n_util::GetString(IDS_AUTOFILL_CC_INFOBAR_ACCEPT);\n  else if (button == BUTTON_CANCEL)\n    return l10n_util::GetString(IDS_AUTOFILL_CC_INFOBAR_DENY);\n  else\n    NOTREACHED();\n\n  return std::wstring();\n}\n\nbool AutoFillCCInfoBarDelegate::Accept() {\n  UMA_HISTOGRAM_COUNTS(\"AutoFill.CCInfoBarAccepted\", 1);\n  if (host_) {\n    host_->OnInfoBarClosed(true);\n    host_ = NULL;\n  }\n  return true;\n}\n\nbool AutoFillCCInfoBarDelegate::Cancel() {\n  UMA_HISTOGRAM_COUNTS(\"AutoFill.CCInfoBarDenied\", 1);\n  if (host_) {\n    host_->OnInfoBarClosed(false);\n    host_ = NULL;\n  }\n  return true;\n}\n\nstd::wstring AutoFillCCInfoBarDelegate::GetLinkText() {\n  return l10n_util::GetString(IDS_AUTOFILL_CC_LEARN_MORE);\n}\n\nbool AutoFillCCInfoBarDelegate::LinkClicked(WindowOpenDisposition disposition) {\n  browser_->OpenURL(GURL(kAutoFillLearnMoreUrl), GURL(), NEW_FOREGROUND_TAB,\n                    PageTransition::TYPED);\n  return false;\n}\n\n#if defined(OS_WIN)\nInfoBar* AutoFillCCInfoBarDelegate::CreateInfoBar() {\n  return CreateAutofillCcInfoBar(this);\n}\n#endif  \/\/ defined(OS_WIN)\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\nnamespace chromeos {\n\nMockOwnershipService::MockOwnershipService() {}\n\nMockOwnershipService::~MockOwnershipService() {}\n\n}  \/\/ namespace chromeos\n<commit_msg>moar build fix TBR=dpolukhin<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\/mock_ownership_service.h\"\n\nnamespace chromeos {\n\nMockOwnershipService::MockOwnershipService() {}\n\nMockOwnershipService::~MockOwnershipService() {}\n\n}  \/\/ namespace chromeos\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\/ref_counted.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/extensions\/autoupdate_interceptor.h\"\n#include \"chrome\/browser\/extensions\/extension_browsertest.h\"\n#include \"chrome\/browser\/extensions\/extension_host.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/extensions\/extension_updater.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nclass ExtensionManagementTest : public ExtensionBrowserTest {\n protected:\n  \/\/ Helper method that returns whether the extension is at the given version.\n  \/\/ This calls version(), which must be defined in the extension's bg page,\n  \/\/ as well as asking the extension itself.\n  bool IsExtensionAtVersion(Extension* extension,\n                            const std::string& expected_version) {\n    \/\/ Test that the extension's version from the manifest and reported by the\n    \/\/ background page is correct.  This is to ensure that the processes are in\n    \/\/ sync with the Extension.\n    ExtensionProcessManager* manager = browser()->profile()->\n        GetExtensionProcessManager();\n    ExtensionHost* ext_host = manager->GetBackgroundHostForExtension(extension);\n    EXPECT_TRUE(ext_host);\n    if (!ext_host)\n      return false;\n\n    std::string version_from_bg;\n    bool exec = ui_test_utils::ExecuteJavaScriptAndExtractString(\n        ext_host->render_view_host(), L\"\", L\"version()\", &version_from_bg);\n    EXPECT_TRUE(exec);\n    if (!exec)\n      return false;\n\n    if (version_from_bg != expected_version ||\n        extension->VersionString() != expected_version)\n      return false;\n    return true;\n  }\n\n  \/\/ Helper method that installs a low permission extension then updates\n  \/\/ to the second version requiring increased permissions. Returns whether\n  \/\/ the operation was completed successfully.\n  bool InstallAndUpdateIncreasingPermissionsExtension() {\n    ExtensionsService* service = browser()->profile()->GetExtensionsService();\n    if (service->HasInstalledExtensions())\n      return false;\n\n    \/\/ Install the initial version, which should happen just fine.\n    if (!InstallExtension(\n        test_data_dir_.AppendASCII(\"permissions-low-v1.crx\"), 1))\n      return false;\n\n    \/\/ Upgrade to a version that wants more permissions. We should disable the\n    \/\/ extension and prompt the user to reenable.\n    if (service->extensions()->size() != 1u)\n      return false;\n    if (!UpdateExtension(\n        service->extensions()->at(0)->id(),\n        test_data_dir_.AppendASCII(\"permissions-high-v2.crx\"), -1))\n      return false;\n    EXPECT_EQ(0u, service->extensions()->size());\n    if (service->disabled_extensions()->size() != 1u)\n      return false;\n    return true;\n  }\n};\n\n\/\/ Tests that installing the same version does not overwrite.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, InstallSameVersion) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install.crx\"), 1));\n\n  \/\/ Install an extension with the same version. The previous install should\n  \/\/ be kept.\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install_same_version.crx\"), 0));\n  EXPECT_TRUE(IsExtensionAtVersion(service->extensions()->at(0), \"1.0\"));\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, InstallOlderVersion) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install.crx\"), 1));\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install_older_version.crx\"), 0));\n  EXPECT_TRUE(IsExtensionAtVersion(service->extensions()->at(0), \"1.0\"));\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, InstallThenCancel) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install.crx\"), 1));\n\n  \/\/ Cancel this install.\n  StartInstallButCancel(test_data_dir_.AppendASCII(\"install\/install_v2.crx\"));\n  EXPECT_TRUE(IsExtensionAtVersion(service->extensions()->at(0), \"1.0\"));\n}\n\n\/\/ Tests that installing and uninstalling extensions don't crash with an\n\/\/ incognito window open.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, Incognito) {\n  \/\/ Open an incognito window to the extensions management page.  We just\n  \/\/ want to make sure that we don't crash while playing with extensions when\n  \/\/ this guy is around.\n  ui_test_utils::OpenURLOffTheRecord(browser()->profile(),\n                                     GURL(chrome::kChromeUIExtensionsURL));\n\n  ASSERT_TRUE(InstallExtension(test_data_dir_.AppendASCII(\"good.crx\"), 1));\n  UninstallExtension(\"ldnnhddmnhbkjipkidpdiheffobcpfmf\");\n}\n\n\/\/ Tests the process of updating an extension to one that requires higher\n\/\/ permissions.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, UpdatePermissions) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_TRUE(InstallAndUpdateIncreasingPermissionsExtension());\n\n  \/\/ Now try reenabling it.\n  service->EnableExtension(service->disabled_extensions()->at(0)->id());\n  EXPECT_EQ(1u, service->extensions()->size());\n  EXPECT_EQ(0u, service->disabled_extensions()->size());\n}\n\n\/\/ Tests that we can uninstall a disabled extension.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, UninstallDisabled) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_TRUE(InstallAndUpdateIncreasingPermissionsExtension());\n\n  \/\/ Now try uninstalling it.\n  UninstallExtension(service->disabled_extensions()->at(0)->id());\n  EXPECT_EQ(0u, service->extensions()->size());\n  EXPECT_EQ(0u, service->disabled_extensions()->size());\n  ASSERT_FALSE(service->HasInstalledExtensions());\n}\n\n\/\/ Tests that disabling and re-enabling an extension works.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, DisableEnable) {\n  ExtensionProcessManager* manager = browser()->profile()->\n      GetExtensionProcessManager();\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n\n  \/\/ Load an extension, expect the background page to be available.\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(LoadExtension(\n      test_data_dir_.AppendASCII(\"good\").AppendASCII(\"Extensions\")\n                    .AppendASCII(\"bjafgdebaacbbbecmhlhpofkepfkgcpa\")\n                    .AppendASCII(\"1.0\")));\n  ASSERT_EQ(1u, service->extensions()->size());\n  EXPECT_EQ(0u, service->disabled_extensions()->size());\n  Extension* extension = service->extensions()->at(0);\n  EXPECT_TRUE(manager->GetBackgroundHostForExtension(extension));\n  ASSERT_TRUE(service->HasInstalledExtensions());\n\n  \/\/ After disabling, the background page should go away.\n  service->DisableExtension(\"bjafgdebaacbbbecmhlhpofkepfkgcpa\");\n  EXPECT_EQ(0u, service->extensions()->size());\n  EXPECT_EQ(1u, service->disabled_extensions()->size());\n  EXPECT_FALSE(manager->GetBackgroundHostForExtension(extension));\n  ASSERT_TRUE(service->HasInstalledExtensions());\n\n  \/\/ And bring it back.\n  service->EnableExtension(\"bjafgdebaacbbbecmhlhpofkepfkgcpa\");\n  EXPECT_EQ(1u, service->extensions()->size());\n  EXPECT_EQ(0u, service->disabled_extensions()->size());\n  EXPECT_TRUE(manager->GetBackgroundHostForExtension(extension));\n  ASSERT_TRUE(service->HasInstalledExtensions());\n}\n\n\/\/ TODO(asargent): This test seems to crash on linux buildbots.\n\/\/ (http:\/\/crbug.com\/31737)\n#if !defined(OS_LINUX)\n\/\/ Tests extension autoupdate.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, AutoUpdate) {\n  FilePath basedir = test_data_dir_.AppendASCII(\"autoupdate\");\n  \/\/ Note: This interceptor gets requests on the IO thread.\n  scoped_refptr<AutoUpdateInterceptor> interceptor(new AutoUpdateInterceptor());\n  URLFetcher::enable_interception_for_tests(true);\n\n  interceptor->SetResponseOnIOThread(\"http:\/\/localhost\/autoupdate\/manifest\",\n                                     basedir.AppendASCII(\"manifest_v2.xml\"));\n  interceptor->SetResponseOnIOThread(\"http:\/\/localhost\/autoupdate\/v2.crx\",\n                                     basedir.AppendASCII(\"v2.crx\"));\n\n  \/\/ Install version 1 of the extension.\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(InstallExtension(basedir.AppendASCII(\"v1.crx\"), 1));\n  const ExtensionList* extensions = service->extensions();\n  ASSERT_TRUE(service->HasInstalledExtensions());\n  ASSERT_EQ(1u, extensions->size());\n  ASSERT_EQ(\"ogjcoiohnmldgjemafoockdghcjciccf\", extensions->at(0)->id());\n  ASSERT_EQ(\"1.0\", extensions->at(0)->VersionString());\n\n  \/\/ We don't want autoupdate blacklist checks.\n  service->updater()->set_blacklist_checks_enabled(false);\n\n  \/\/ Run autoupdate and make sure version 2 of the extension was installed.\n  service->updater()->CheckNow();\n  ASSERT_TRUE(WaitForExtensionInstall());\n  extensions = service->extensions();\n  ASSERT_EQ(1u, extensions->size());\n  ASSERT_EQ(\"ogjcoiohnmldgjemafoockdghcjciccf\", extensions->at(0)->id());\n  ASSERT_EQ(\"2.0\", extensions->at(0)->VersionString());\n\n  \/\/ Now try doing an update to version 3, which has been incorrectly\n  \/\/ signed. This should fail.\n  interceptor->SetResponseOnIOThread(\"http:\/\/localhost\/autoupdate\/manifest\",\n                                     basedir.AppendASCII(\"manifest_v3.xml\"));\n  interceptor->SetResponseOnIOThread(\"http:\/\/localhost\/autoupdate\/v3.crx\",\n                                     basedir.AppendASCII(\"v3.crx\"));\n\n  service->updater()->CheckNow();\n  ASSERT_TRUE(WaitForExtensionInstallError());\n\n  \/\/ Make sure the extension state is the same as before.\n  extensions = service->extensions();\n  ASSERT_EQ(1u, extensions->size());\n  ASSERT_EQ(\"ogjcoiohnmldgjemafoockdghcjciccf\", extensions->at(0)->id());\n  ASSERT_EQ(\"2.0\", extensions->at(0)->VersionString());\n}\n#endif  \/\/ !defined(OS_LINUX)\n<commit_msg>Disable UpdatePermissions because of flakiness on linux 64. BUG=none TEST=none TBR=asargent Review URL: http:\/\/codereview.chromium.org\/553058<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\/ref_counted.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/extensions\/autoupdate_interceptor.h\"\n#include \"chrome\/browser\/extensions\/extension_browsertest.h\"\n#include \"chrome\/browser\/extensions\/extension_host.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/extensions\/extension_updater.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nclass ExtensionManagementTest : public ExtensionBrowserTest {\n protected:\n  \/\/ Helper method that returns whether the extension is at the given version.\n  \/\/ This calls version(), which must be defined in the extension's bg page,\n  \/\/ as well as asking the extension itself.\n  bool IsExtensionAtVersion(Extension* extension,\n                            const std::string& expected_version) {\n    \/\/ Test that the extension's version from the manifest and reported by the\n    \/\/ background page is correct.  This is to ensure that the processes are in\n    \/\/ sync with the Extension.\n    ExtensionProcessManager* manager = browser()->profile()->\n        GetExtensionProcessManager();\n    ExtensionHost* ext_host = manager->GetBackgroundHostForExtension(extension);\n    EXPECT_TRUE(ext_host);\n    if (!ext_host)\n      return false;\n\n    std::string version_from_bg;\n    bool exec = ui_test_utils::ExecuteJavaScriptAndExtractString(\n        ext_host->render_view_host(), L\"\", L\"version()\", &version_from_bg);\n    EXPECT_TRUE(exec);\n    if (!exec)\n      return false;\n\n    if (version_from_bg != expected_version ||\n        extension->VersionString() != expected_version)\n      return false;\n    return true;\n  }\n\n  \/\/ Helper method that installs a low permission extension then updates\n  \/\/ to the second version requiring increased permissions. Returns whether\n  \/\/ the operation was completed successfully.\n  bool InstallAndUpdateIncreasingPermissionsExtension() {\n    ExtensionsService* service = browser()->profile()->GetExtensionsService();\n    if (service->HasInstalledExtensions())\n      return false;\n\n    \/\/ Install the initial version, which should happen just fine.\n    if (!InstallExtension(\n        test_data_dir_.AppendASCII(\"permissions-low-v1.crx\"), 1))\n      return false;\n\n    \/\/ Upgrade to a version that wants more permissions. We should disable the\n    \/\/ extension and prompt the user to reenable.\n    if (service->extensions()->size() != 1u)\n      return false;\n    if (!UpdateExtension(\n        service->extensions()->at(0)->id(),\n        test_data_dir_.AppendASCII(\"permissions-high-v2.crx\"), -1))\n      return false;\n    EXPECT_EQ(0u, service->extensions()->size());\n    if (service->disabled_extensions()->size() != 1u)\n      return false;\n    return true;\n  }\n};\n\n\/\/ Tests that installing the same version does not overwrite.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, InstallSameVersion) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install.crx\"), 1));\n\n  \/\/ Install an extension with the same version. The previous install should\n  \/\/ be kept.\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install_same_version.crx\"), 0));\n  EXPECT_TRUE(IsExtensionAtVersion(service->extensions()->at(0), \"1.0\"));\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, InstallOlderVersion) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install.crx\"), 1));\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install_older_version.crx\"), 0));\n  EXPECT_TRUE(IsExtensionAtVersion(service->extensions()->at(0), \"1.0\"));\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, InstallThenCancel) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(InstallExtension(\n      test_data_dir_.AppendASCII(\"install\/install.crx\"), 1));\n\n  \/\/ Cancel this install.\n  StartInstallButCancel(test_data_dir_.AppendASCII(\"install\/install_v2.crx\"));\n  EXPECT_TRUE(IsExtensionAtVersion(service->extensions()->at(0), \"1.0\"));\n}\n\n\/\/ Tests that installing and uninstalling extensions don't crash with an\n\/\/ incognito window open.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, Incognito) {\n  \/\/ Open an incognito window to the extensions management page.  We just\n  \/\/ want to make sure that we don't crash while playing with extensions when\n  \/\/ this guy is around.\n  ui_test_utils::OpenURLOffTheRecord(browser()->profile(),\n                                     GURL(chrome::kChromeUIExtensionsURL));\n\n  ASSERT_TRUE(InstallExtension(test_data_dir_.AppendASCII(\"good.crx\"), 1));\n  UninstallExtension(\"ldnnhddmnhbkjipkidpdiheffobcpfmf\");\n}\n\n#if defined(OS_LINUX)\n\/\/ See http:\/\/crbug.com\/32906.\n#define UpdatePermissions DISABLED_UpdatePermissions\n#endif\n\n\/\/ Tests the process of updating an extension to one that requires higher\n\/\/ permissions.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, UpdatePermissions) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_TRUE(InstallAndUpdateIncreasingPermissionsExtension());\n\n  \/\/ Now try reenabling it.\n  service->EnableExtension(service->disabled_extensions()->at(0)->id());\n  EXPECT_EQ(1u, service->extensions()->size());\n  EXPECT_EQ(0u, service->disabled_extensions()->size());\n}\n\n\/\/ Tests that we can uninstall a disabled extension.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, UninstallDisabled) {\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_TRUE(InstallAndUpdateIncreasingPermissionsExtension());\n\n  \/\/ Now try uninstalling it.\n  UninstallExtension(service->disabled_extensions()->at(0)->id());\n  EXPECT_EQ(0u, service->extensions()->size());\n  EXPECT_EQ(0u, service->disabled_extensions()->size());\n  ASSERT_FALSE(service->HasInstalledExtensions());\n}\n\n\/\/ Tests that disabling and re-enabling an extension works.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, DisableEnable) {\n  ExtensionProcessManager* manager = browser()->profile()->\n      GetExtensionProcessManager();\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n\n  \/\/ Load an extension, expect the background page to be available.\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(LoadExtension(\n      test_data_dir_.AppendASCII(\"good\").AppendASCII(\"Extensions\")\n                    .AppendASCII(\"bjafgdebaacbbbecmhlhpofkepfkgcpa\")\n                    .AppendASCII(\"1.0\")));\n  ASSERT_EQ(1u, service->extensions()->size());\n  EXPECT_EQ(0u, service->disabled_extensions()->size());\n  Extension* extension = service->extensions()->at(0);\n  EXPECT_TRUE(manager->GetBackgroundHostForExtension(extension));\n  ASSERT_TRUE(service->HasInstalledExtensions());\n\n  \/\/ After disabling, the background page should go away.\n  service->DisableExtension(\"bjafgdebaacbbbecmhlhpofkepfkgcpa\");\n  EXPECT_EQ(0u, service->extensions()->size());\n  EXPECT_EQ(1u, service->disabled_extensions()->size());\n  EXPECT_FALSE(manager->GetBackgroundHostForExtension(extension));\n  ASSERT_TRUE(service->HasInstalledExtensions());\n\n  \/\/ And bring it back.\n  service->EnableExtension(\"bjafgdebaacbbbecmhlhpofkepfkgcpa\");\n  EXPECT_EQ(1u, service->extensions()->size());\n  EXPECT_EQ(0u, service->disabled_extensions()->size());\n  EXPECT_TRUE(manager->GetBackgroundHostForExtension(extension));\n  ASSERT_TRUE(service->HasInstalledExtensions());\n}\n\n\/\/ TODO(asargent): This test seems to crash on linux buildbots.\n\/\/ (http:\/\/crbug.com\/31737)\n#if !defined(OS_LINUX)\n\/\/ Tests extension autoupdate.\nIN_PROC_BROWSER_TEST_F(ExtensionManagementTest, AutoUpdate) {\n  FilePath basedir = test_data_dir_.AppendASCII(\"autoupdate\");\n  \/\/ Note: This interceptor gets requests on the IO thread.\n  scoped_refptr<AutoUpdateInterceptor> interceptor(new AutoUpdateInterceptor());\n  URLFetcher::enable_interception_for_tests(true);\n\n  interceptor->SetResponseOnIOThread(\"http:\/\/localhost\/autoupdate\/manifest\",\n                                     basedir.AppendASCII(\"manifest_v2.xml\"));\n  interceptor->SetResponseOnIOThread(\"http:\/\/localhost\/autoupdate\/v2.crx\",\n                                     basedir.AppendASCII(\"v2.crx\"));\n\n  \/\/ Install version 1 of the extension.\n  ExtensionsService* service = browser()->profile()->GetExtensionsService();\n  ASSERT_FALSE(service->HasInstalledExtensions());\n  ASSERT_TRUE(InstallExtension(basedir.AppendASCII(\"v1.crx\"), 1));\n  const ExtensionList* extensions = service->extensions();\n  ASSERT_TRUE(service->HasInstalledExtensions());\n  ASSERT_EQ(1u, extensions->size());\n  ASSERT_EQ(\"ogjcoiohnmldgjemafoockdghcjciccf\", extensions->at(0)->id());\n  ASSERT_EQ(\"1.0\", extensions->at(0)->VersionString());\n\n  \/\/ We don't want autoupdate blacklist checks.\n  service->updater()->set_blacklist_checks_enabled(false);\n\n  \/\/ Run autoupdate and make sure version 2 of the extension was installed.\n  service->updater()->CheckNow();\n  ASSERT_TRUE(WaitForExtensionInstall());\n  extensions = service->extensions();\n  ASSERT_EQ(1u, extensions->size());\n  ASSERT_EQ(\"ogjcoiohnmldgjemafoockdghcjciccf\", extensions->at(0)->id());\n  ASSERT_EQ(\"2.0\", extensions->at(0)->VersionString());\n\n  \/\/ Now try doing an update to version 3, which has been incorrectly\n  \/\/ signed. This should fail.\n  interceptor->SetResponseOnIOThread(\"http:\/\/localhost\/autoupdate\/manifest\",\n                                     basedir.AppendASCII(\"manifest_v3.xml\"));\n  interceptor->SetResponseOnIOThread(\"http:\/\/localhost\/autoupdate\/v3.crx\",\n                                     basedir.AppendASCII(\"v3.crx\"));\n\n  service->updater()->CheckNow();\n  ASSERT_TRUE(WaitForExtensionInstallError());\n\n  \/\/ Make sure the extension state is the same as before.\n  extensions = service->extensions();\n  ASSERT_EQ(1u, extensions->size());\n  ASSERT_EQ(\"ogjcoiohnmldgjemafoockdghcjciccf\", extensions->at(0)->id());\n  ASSERT_EQ(\"2.0\", extensions->at(0)->VersionString());\n}\n#endif  \/\/ !defined(OS_LINUX)\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\/notifier\/chrome_system_resources.h\"\n\n#include <cstdlib>\n#include <cstring>\n#include <string>\n\n#include \"base\/logging.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/sync\/notifier\/invalidation_util.h\"\n\nnamespace sync_notifier {\n\nChromeSystemResources::ChromeSystemResources() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n}\n\nChromeSystemResources::~ChromeSystemResources() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  StopScheduler();\n}\n\ninvalidation::Time ChromeSystemResources::current_time() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  return base::Time::Now();\n}\n\nvoid ChromeSystemResources::StartScheduler() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  scoped_runnable_method_factory_.reset(\n      new ScopedRunnableMethodFactory<ChromeSystemResources>(this));\n}\n\nvoid ChromeSystemResources::StopScheduler() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  scoped_runnable_method_factory_.reset();\n  STLDeleteElements(&posted_tasks_);\n}\n\nvoid ChromeSystemResources::ScheduleWithDelay(\n    invalidation::TimeDelta delay,\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  Task* task_to_post = MakeTaskToPost(task);\n  if (!task_to_post) {\n    return;\n  }\n  MessageLoop::current()->PostDelayedTask(\n      FROM_HERE, task_to_post, delay.InMillisecondsRoundedUp());\n}\n\nvoid ChromeSystemResources::ScheduleImmediately(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  Task* task_to_post = MakeTaskToPost(task);\n  if (!task_to_post) {\n    return;\n  }\n  MessageLoop::current()->PostTask(FROM_HERE, task_to_post);\n}\n\n\/\/ The listener thread is just our current thread.\nvoid ChromeSystemResources::ScheduleOnListenerThread(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  ScheduleImmediately(task);\n}\n\n\/\/ We're already on a separate thread, so always return true.\nbool ChromeSystemResources::IsRunningOnInternalThread() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  return true;\n}\n\nvoid ChromeSystemResources::Log(\n    LogLevel level, const char* file, int line,\n    const char* format, ...) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  logging::LogSeverity log_severity = logging::LOG_INFO;\n  switch (level) {\n    case INFO_LEVEL:\n      log_severity = logging::LOG_INFO;\n      break;\n    case WARNING_LEVEL:\n      log_severity = logging::LOG_WARNING;\n      break;\n    case ERROR_LEVEL:\n      log_severity = logging::LOG_ERROR;\n      break;\n  }\n  \/\/ We treat LOG(INFO) as VLOG(1).\n  if ((log_severity >= logging::GetMinLogLevel()) &&\n      ((log_severity != logging::LOG_INFO) ||\n       (1 <= logging::GetVlogLevelHelper(file, ::strlen(file))))) {\n    va_list ap;\n    va_start(ap, format);\n    std::string result;\n    StringAppendV(&result, format, ap);\n    logging::LogMessage(file, line, log_severity).stream() << result;\n    va_end(ap);\n  }\n}\n\nvoid ChromeSystemResources::WriteState(\n    const invalidation::string& state,\n    invalidation::StorageCallback* callback) {\n  \/\/ TODO(akalin): Write the given state to persistent storage.\n  callback->Run(false);\n  delete callback;\n}\n\nTask* ChromeSystemResources::MakeTaskToPost(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  DCHECK(invalidation::IsCallbackRepeatable(task));\n  if (!scoped_runnable_method_factory_.get()) {\n    delete task;\n    return NULL;\n  }\n  posted_tasks_.insert(task);\n  Task* task_to_post =\n      scoped_runnable_method_factory_->NewRunnableMethod(\n          &ChromeSystemResources::RunPostedTask, task);\n  return task_to_post;\n}\n\nvoid ChromeSystemResources::RunPostedTask(invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  RunAndDeleteClosure(task);\n  posted_tasks_.erase(task);\n}\n\n}  \/\/ namespace sync_notifier\n<commit_msg>[Sync] Fixed flipped return value from 61851.<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\/notifier\/chrome_system_resources.h\"\n\n#include <cstdlib>\n#include <cstring>\n#include <string>\n\n#include \"base\/logging.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/sync\/notifier\/invalidation_util.h\"\n\nnamespace sync_notifier {\n\nChromeSystemResources::ChromeSystemResources() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n}\n\nChromeSystemResources::~ChromeSystemResources() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  StopScheduler();\n}\n\ninvalidation::Time ChromeSystemResources::current_time() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  return base::Time::Now();\n}\n\nvoid ChromeSystemResources::StartScheduler() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  scoped_runnable_method_factory_.reset(\n      new ScopedRunnableMethodFactory<ChromeSystemResources>(this));\n}\n\nvoid ChromeSystemResources::StopScheduler() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  scoped_runnable_method_factory_.reset();\n  STLDeleteElements(&posted_tasks_);\n}\n\nvoid ChromeSystemResources::ScheduleWithDelay(\n    invalidation::TimeDelta delay,\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  Task* task_to_post = MakeTaskToPost(task);\n  if (!task_to_post) {\n    return;\n  }\n  MessageLoop::current()->PostDelayedTask(\n      FROM_HERE, task_to_post, delay.InMillisecondsRoundedUp());\n}\n\nvoid ChromeSystemResources::ScheduleImmediately(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  Task* task_to_post = MakeTaskToPost(task);\n  if (!task_to_post) {\n    return;\n  }\n  MessageLoop::current()->PostTask(FROM_HERE, task_to_post);\n}\n\n\/\/ The listener thread is just our current thread (i.e., the\n\/\/ notifications thread).\nvoid ChromeSystemResources::ScheduleOnListenerThread(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  ScheduleImmediately(task);\n}\n\n\/\/ 'Internal thread' means 'not the listener thread'.  Since the\n\/\/ listener thread is the notifications thread, always return false.\nbool ChromeSystemResources::IsRunningOnInternalThread() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  return false;\n}\n\nvoid ChromeSystemResources::Log(\n    LogLevel level, const char* file, int line,\n    const char* format, ...) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  logging::LogSeverity log_severity = logging::LOG_INFO;\n  switch (level) {\n    case INFO_LEVEL:\n      log_severity = logging::LOG_INFO;\n      break;\n    case WARNING_LEVEL:\n      log_severity = logging::LOG_WARNING;\n      break;\n    case ERROR_LEVEL:\n      log_severity = logging::LOG_ERROR;\n      break;\n  }\n  \/\/ We treat LOG(INFO) as VLOG(1).\n  if ((log_severity >= logging::GetMinLogLevel()) &&\n      ((log_severity != logging::LOG_INFO) ||\n       (1 <= logging::GetVlogLevelHelper(file, ::strlen(file))))) {\n    va_list ap;\n    va_start(ap, format);\n    std::string result;\n    StringAppendV(&result, format, ap);\n    logging::LogMessage(file, line, log_severity).stream() << result;\n    va_end(ap);\n  }\n}\n\nvoid ChromeSystemResources::WriteState(\n    const invalidation::string& state,\n    invalidation::StorageCallback* callback) {\n  \/\/ TODO(akalin): Write the given state to persistent storage.\n  callback->Run(false);\n  delete callback;\n}\n\nTask* ChromeSystemResources::MakeTaskToPost(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  DCHECK(invalidation::IsCallbackRepeatable(task));\n  if (!scoped_runnable_method_factory_.get()) {\n    delete task;\n    return NULL;\n  }\n  posted_tasks_.insert(task);\n  Task* task_to_post =\n      scoped_runnable_method_factory_->NewRunnableMethod(\n          &ChromeSystemResources::RunPostedTask, task);\n  return task_to_post;\n}\n\nvoid ChromeSystemResources::RunPostedTask(invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  RunAndDeleteClosure(task);\n  posted_tasks_.erase(task);\n}\n\n}  \/\/ namespace sync_notifier\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\/notifier\/chrome_system_resources.h\"\n\n#include <cstdlib>\n#include <cstring>\n#include <string>\n\n#include \"base\/logging.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/sync\/notifier\/invalidation_util.h\"\n\nnamespace sync_notifier {\n\nChromeSystemResources::ChromeSystemResources() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n}\n\nChromeSystemResources::~ChromeSystemResources() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  StopScheduler();\n}\n\ninvalidation::Time ChromeSystemResources::current_time() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  return base::Time::Now();\n}\n\nvoid ChromeSystemResources::StartScheduler() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  scoped_runnable_method_factory_.reset(\n      new ScopedRunnableMethodFactory<ChromeSystemResources>(this));\n}\n\nvoid ChromeSystemResources::StopScheduler() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  scoped_runnable_method_factory_.reset();\n  STLDeleteElements(&posted_tasks_);\n}\n\nvoid ChromeSystemResources::ScheduleWithDelay(\n    invalidation::TimeDelta delay,\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  Task* task_to_post = MakeTaskToPost(task);\n  if (!task_to_post) {\n    return;\n  }\n  MessageLoop::current()->PostDelayedTask(\n      FROM_HERE, task_to_post, delay.InMillisecondsRoundedUp());\n}\n\nvoid ChromeSystemResources::ScheduleImmediately(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  Task* task_to_post = MakeTaskToPost(task);\n  if (!task_to_post) {\n    return;\n  }\n  MessageLoop::current()->PostTask(FROM_HERE, task_to_post);\n}\n\n\/\/ The listener thread is just our current thread.\nvoid ChromeSystemResources::ScheduleOnListenerThread(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  ScheduleImmediately(task);\n}\n\n\/\/ We're already on a separate thread, so always return true.\nbool ChromeSystemResources::IsRunningOnInternalThread() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  return true;\n}\n\nvoid ChromeSystemResources::Log(\n    LogLevel level, const char* file, int line,\n    const char* format, ...) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  logging::LogSeverity log_severity = logging::LOG_INFO;\n  switch (level) {\n    case INFO_LEVEL:\n      log_severity = logging::LOG_INFO;\n      break;\n    case WARNING_LEVEL:\n      log_severity = logging::LOG_WARNING;\n      break;\n    case ERROR_LEVEL:\n      log_severity = logging::LOG_ERROR;\n      break;\n  }\n  \/\/ We treat LOG(INFO) as VLOG(1).\n  if ((log_severity >= logging::GetMinLogLevel()) &&\n      ((log_severity != logging::LOG_INFO) ||\n       (1 <= logging::GetVlogLevelHelper(file, ::strlen(file))))) {\n    va_list ap;\n    va_start(ap, format);\n    std::string result;\n    StringAppendV(&result, format, ap);\n    logging::LogMessage(file, line, log_severity).stream() << result;\n    va_end(ap);\n  }\n}\n\nvoid ChromeSystemResources::WriteState(\n    const invalidation::string& state,\n    invalidation::StorageCallback* callback) {\n  \/\/ TODO(akalin): Write the given state to persistent storage.\n  callback->Run(false);\n  delete callback;\n}\n\nTask* ChromeSystemResources::MakeTaskToPost(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  DCHECK(invalidation::IsCallbackRepeatable(task));\n  if (!scoped_runnable_method_factory_.get()) {\n    delete task;\n    return NULL;\n  }\n  posted_tasks_.insert(task);\n  Task* task_to_post =\n      scoped_runnable_method_factory_->NewRunnableMethod(\n          &ChromeSystemResources::RunPostedTask, task);\n  return task_to_post;\n}\n\nvoid ChromeSystemResources::RunPostedTask(invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  RunAndDeleteClosure(task);\n  posted_tasks_.erase(task);\n}\n\n}  \/\/ namespace sync_notifier\n<commit_msg>[Sync] Fixed flipped return value from 61851.<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\/notifier\/chrome_system_resources.h\"\n\n#include <cstdlib>\n#include <cstring>\n#include <string>\n\n#include \"base\/logging.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/sync\/notifier\/invalidation_util.h\"\n\nnamespace sync_notifier {\n\nChromeSystemResources::ChromeSystemResources() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n}\n\nChromeSystemResources::~ChromeSystemResources() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  StopScheduler();\n}\n\ninvalidation::Time ChromeSystemResources::current_time() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  return base::Time::Now();\n}\n\nvoid ChromeSystemResources::StartScheduler() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  scoped_runnable_method_factory_.reset(\n      new ScopedRunnableMethodFactory<ChromeSystemResources>(this));\n}\n\nvoid ChromeSystemResources::StopScheduler() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  scoped_runnable_method_factory_.reset();\n  STLDeleteElements(&posted_tasks_);\n}\n\nvoid ChromeSystemResources::ScheduleWithDelay(\n    invalidation::TimeDelta delay,\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  Task* task_to_post = MakeTaskToPost(task);\n  if (!task_to_post) {\n    return;\n  }\n  MessageLoop::current()->PostDelayedTask(\n      FROM_HERE, task_to_post, delay.InMillisecondsRoundedUp());\n}\n\nvoid ChromeSystemResources::ScheduleImmediately(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  Task* task_to_post = MakeTaskToPost(task);\n  if (!task_to_post) {\n    return;\n  }\n  MessageLoop::current()->PostTask(FROM_HERE, task_to_post);\n}\n\n\/\/ The listener thread is just our current thread (i.e., the\n\/\/ notifications thread).\nvoid ChromeSystemResources::ScheduleOnListenerThread(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  ScheduleImmediately(task);\n}\n\n\/\/ 'Internal thread' means 'not the listener thread'.  Since the\n\/\/ listener thread is the notifications thread, always return false.\nbool ChromeSystemResources::IsRunningOnInternalThread() {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  return false;\n}\n\nvoid ChromeSystemResources::Log(\n    LogLevel level, const char* file, int line,\n    const char* format, ...) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  logging::LogSeverity log_severity = logging::LOG_INFO;\n  switch (level) {\n    case INFO_LEVEL:\n      log_severity = logging::LOG_INFO;\n      break;\n    case WARNING_LEVEL:\n      log_severity = logging::LOG_WARNING;\n      break;\n    case ERROR_LEVEL:\n      log_severity = logging::LOG_ERROR;\n      break;\n  }\n  \/\/ We treat LOG(INFO) as VLOG(1).\n  if ((log_severity >= logging::GetMinLogLevel()) &&\n      ((log_severity != logging::LOG_INFO) ||\n       (1 <= logging::GetVlogLevelHelper(file, ::strlen(file))))) {\n    va_list ap;\n    va_start(ap, format);\n    std::string result;\n    StringAppendV(&result, format, ap);\n    logging::LogMessage(file, line, log_severity).stream() << result;\n    va_end(ap);\n  }\n}\n\nvoid ChromeSystemResources::WriteState(\n    const invalidation::string& state,\n    invalidation::StorageCallback* callback) {\n  \/\/ TODO(akalin): Write the given state to persistent storage.\n  callback->Run(false);\n  delete callback;\n}\n\nTask* ChromeSystemResources::MakeTaskToPost(\n    invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  DCHECK(invalidation::IsCallbackRepeatable(task));\n  if (!scoped_runnable_method_factory_.get()) {\n    delete task;\n    return NULL;\n  }\n  posted_tasks_.insert(task);\n  Task* task_to_post =\n      scoped_runnable_method_factory_->NewRunnableMethod(\n          &ChromeSystemResources::RunPostedTask, task);\n  return task_to_post;\n}\n\nvoid ChromeSystemResources::RunPostedTask(invalidation::Closure* task) {\n  DCHECK(non_thread_safe_.CalledOnValidThread());\n  RunAndDeleteClosure(task);\n  posted_tasks_.erase(task);\n}\n\n}  \/\/ namespace sync_notifier\n<|endoftext|>"}
{"text":"<commit_before>\/\/-----------------------------------------------------------------------bl-\n\/\/--------------------------------------------------------------------------\n\/\/\n\/\/ GRINS - General Reacting Incompressible Navier-Stokes\n\/\/\n\/\/ Copyright (C) 2014-2016 Paul T. Bauman, Roy H. Stogner\n\/\/ Copyright (C) 2010-2013 The PECOS Development Team\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the Version 2.1 GNU Lesser General\n\/\/ Public License 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,\n\/\/ Boston, MA  02110-1301  USA\n\/\/\n\/\/-----------------------------------------------------------------------el-\n\n#include \"grins_config.h\"\n\n#ifdef GRINS_HAVE_CPPUNIT\n\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/TestCase.h>\n\n#include \"test_comm.h\"\n#include \"grins_test_paths.h\"\n\n\/\/ GRINS\n#include \"grins\/grins_enums.h\"\n#include \"grins\/mesh_builder.h\"\n#include \"grins\/rayfire_mesh.h\"\n#include \"grins\/math_constants.h\"\n\n\/\/ libMesh\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/getpot.h\"\n#include \"libmesh\/face_quad4.h\"\n#include \"libmesh\/face_quad9.h\"\n#include \"libmesh\/fe_interface.h\"\n#include \"libmesh\/mesh_refinement.h\"\n\nnamespace GRINSTesting\n{\n  class RayfireTestAMR : public CppUnit::TestCase\n  {\n  public:\n    CPPUNIT_TEST_SUITE( RayfireTestAMR );\n\n    CPPUNIT_TEST( single_elems );\n    CPPUNIT_TEST( through_vertex_postrefinment );\n    CPPUNIT_TEST( large_2D_mesh );\n    CPPUNIT_TEST( refine_elem_not_on_rayfire );\n\n    CPPUNIT_TEST_SUITE_END();\n\n  public:\n\n    \/\/! Refine a single element\n    void single_elems()\n    {\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = build_quad4_elem();\n      test_single_elem(mesh);\n\n      mesh = build_quad9_elem();\n      test_single_elem(mesh);\n    }\n\n    \/\/! After refinement, the rayfire will travel through a vertex\n    void through_vertex_postrefinment()\n    {\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = build_quad4_elem();\n      test_through_vertex(mesh);\n\n      mesh = build_quad9_elem();\n      test_through_vertex(mesh);\n    }\n\n    \/\/! A 10x10 mesh with selectively refined elements\n    void large_2D_mesh()\n    {\n      std::string filename = std::string(GRINS_TEST_UNIT_INPUT_SRCDIR)+\"\/mesh_quad4_100elem_2D.in\";\n      GetPot input_quad4(filename);\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = this->build_mesh(input_quad4);\n      test_large_mesh(mesh);\n\n      filename = std::string(GRINS_TEST_UNIT_INPUT_SRCDIR)+\"\/mesh_quad9_100elem_2D.in\";\n      GetPot input_quad9(filename);\n      mesh = this->build_mesh(input_quad9);\n      test_large_mesh(mesh);\n    }\n\n    \/\/! Make sure refined elements not on the rayfire do not get added\n    void refine_elem_not_on_rayfire()\n    {\n      std::string filename = std::string(GRINS_TEST_UNIT_INPUT_SRCDIR)+\"\/mesh_quad4_100elem_2D.in\";\n      GetPot input(filename);\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = this->build_mesh(input);\n\n      libMesh::Point origin(0.0,6.5);\n      libMesh::Point end_point(10.0,0.25);\n      libMesh::Real theta = calc_theta(origin,end_point);\n\n      GRINS::SharedPtr<GRINS::RayfireMesh> rayfire = new GRINS::RayfireMesh(origin,theta);\n      rayfire->init(*mesh);\n\n      \/\/ elem 0 is not along the rayfire\n      mesh->elem(0)->set_refinement_flag(libMesh::Elem::RefinementState::REFINE);\n\n      libMesh::MeshRefinement mr(*mesh);\n      mr.refine_elements();\n\n      rayfire->reinit(*mesh);\n\n      \/\/ elem 0 should not be in the rayfire\n      CPPUNIT_ASSERT( !(rayfire->map_to_rayfire_elem(mesh->elem(0)->id()) ) );\n\n      \/\/ no children of elem 0 should be in the rayfire\n      for (unsigned int i=0; i<4; i++)\n        CPPUNIT_ASSERT( !(rayfire->map_to_rayfire_elem( mesh->elem(0)->child(i)->id() ) ) );\n    }\n\n\n  private:\n\n    libMesh::Real calc_theta(libMesh::Point& start, libMesh::Point end)\n    {\n      return std::atan2( (end(1)-start(1)), (end(0)-start(0)) );\n    }\n\n    GRINS::SharedPtr<libMesh::UnstructuredMesh> build_mesh( const GetPot& input )\n    {\n      GRINS::MeshBuilder mesh_builder;\n      return mesh_builder.build( input, *TestCommWorld );\n    }\n\n    \/\/! Build a single square QUAD4\n    GRINS::SharedPtr<libMesh::UnstructuredMesh> build_quad4_elem()\n    {\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = new libMesh::SerialMesh(*TestCommWorld);\n\n      mesh->set_mesh_dimension(2);\n\n      mesh->add_point( libMesh::Point(0.0,0.0),0 );\n      mesh->add_point( libMesh::Point(1.0,0.0),1 );\n      mesh->add_point( libMesh::Point(1.0,1.0),2 );\n      mesh->add_point( libMesh::Point(0.0,1.0),3 );\n\n      libMesh::Elem* elem = mesh->add_elem( new libMesh::Quad4 );\n      for (unsigned int n=0; n<4; n++)\n        elem->set_node(n) = mesh->node_ptr(n);\n\n      mesh->prepare_for_use();\n\n      return mesh;\n    }\n\n    \/\/! Build a single square QUAD9\n    GRINS::SharedPtr<libMesh::UnstructuredMesh> build_quad9_elem()\n    {\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = new libMesh::SerialMesh(*TestCommWorld);\n\n      mesh->set_mesh_dimension(2);\n\n      mesh->add_point( libMesh::Point(0.0,0.0),0 );\n      mesh->add_point( libMesh::Point(1.0,0.0),1 );\n      mesh->add_point( libMesh::Point(1.0,1.0),2 );\n      mesh->add_point( libMesh::Point(0.0,1.0),3 );\n      mesh->add_point( libMesh::Point(0.5,0.0),4 );\n      mesh->add_point( libMesh::Point(1.0,0.5),5 );\n      mesh->add_point( libMesh::Point(0.5,1.0),6 );\n      mesh->add_point( libMesh::Point(0.0,0.5),7 );\n      mesh->add_point( libMesh::Point(0.5,0.5),8 );\n\n      libMesh::Elem* elem = mesh->add_elem( new libMesh::Quad9 );\n      for (unsigned int n=0; n<9; n++)\n        elem->set_node(n) = mesh->node_ptr(n);\n\n      mesh->prepare_for_use();\n\n      return mesh;\n    }\n\n    \/\/! Runs the test on single square QUADs of unit length and width\n    void test_single_elem(GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh)\n    {\n      CPPUNIT_ASSERT_EQUAL( mesh->n_elem(), (libMesh::dof_id_type)1 );\n\n      libMesh::Point origin(0.0,0.1);\n      libMesh::Point end_point(1.0,0.2);\n      libMesh::Real theta = calc_theta(origin,end_point);\n\n      GRINS::SharedPtr<GRINS::RayfireMesh> rayfire = new GRINS::RayfireMesh(origin,theta);\n      rayfire->init(*mesh);\n\n      libMesh::Elem* elem = mesh->elem(0);\n      CPPUNIT_ASSERT(elem);\n\n      elem->set_refinement_flag(libMesh::Elem::RefinementState::REFINE);\n\n      libMesh::MeshRefinement mr(*mesh);\n      mr.refine_elements();\n\n      rayfire->reinit(*mesh);\n\n      const libMesh::Elem* rayfire_elem0 = rayfire->map_to_rayfire_elem( elem->child(0)->id() );\n      CPPUNIT_ASSERT(rayfire_elem0);\n\n      const libMesh::Elem* rayfire_elem1 = rayfire->map_to_rayfire_elem( elem->child(1)->id() );\n      CPPUNIT_ASSERT(rayfire_elem1);\n\n      CPPUNIT_ASSERT( (rayfire_elem0->get_node(0))->absolute_fuzzy_equals(origin) );\n      CPPUNIT_ASSERT( (rayfire_elem0->get_node(1))->absolute_fuzzy_equals(libMesh::Point(0.5,0.15)) );\n      CPPUNIT_ASSERT( (rayfire_elem1->get_node(0))->absolute_fuzzy_equals(libMesh::Point(0.5,0.15)) );\n      CPPUNIT_ASSERT( (rayfire_elem1->get_node(1))->absolute_fuzzy_equals(end_point) );\n    }\n\n    void test_through_vertex(GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh)\n    {\n      libMesh::Point origin(0.0,0.0);\n      libMesh::Point end_point(1.0,1.0);\n      libMesh::Real theta = calc_theta(origin,end_point);\n\n      GRINS::SharedPtr<GRINS::RayfireMesh> rayfire = new GRINS::RayfireMesh(origin,theta);\n      rayfire->init(*mesh);\n\n      libMesh::Elem* elem = mesh->elem(0);\n      CPPUNIT_ASSERT(elem);\n\n      elem->set_refinement_flag(libMesh::Elem::RefinementState::REFINE);\n\n      libMesh::MeshRefinement mr(*mesh);\n      mr.refine_elements();\n\n      rayfire->reinit(*mesh);\n\n      const libMesh::Elem* rayfire_elem0 = rayfire->map_to_rayfire_elem( elem->child(0)->id() );\n      CPPUNIT_ASSERT(rayfire_elem0);\n\n      const libMesh::Elem* rayfire_elem1 = rayfire->map_to_rayfire_elem( elem->child(3)->id() );\n      CPPUNIT_ASSERT(rayfire_elem1);\n\n      CPPUNIT_ASSERT( (rayfire_elem0->get_node(0))->absolute_fuzzy_equals(origin) );\n      CPPUNIT_ASSERT( (rayfire_elem0->get_node(1))->absolute_fuzzy_equals(libMesh::Point(0.5,0.5)) );\n      CPPUNIT_ASSERT( (rayfire_elem1->get_node(0))->absolute_fuzzy_equals(libMesh::Point(0.5,0.5)) );\n      CPPUNIT_ASSERT( (rayfire_elem1->get_node(1))->absolute_fuzzy_equals(end_point) );\n    }\n\n    \/\/! Refine specific elements on a large mesh\n    void test_large_mesh(GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh)\n    {\n      libMesh::Point origin(0.0,6.5);\n      libMesh::Point end_point(10.0,0.25);\n      libMesh::Real theta = calc_theta(origin,end_point);\n\n      GRINS::SharedPtr<GRINS::RayfireMesh> rayfire = new GRINS::RayfireMesh(origin,theta);\n      rayfire->init(*mesh);\n\n      \/\/ manually refine specific elements\n      \/\/ map index 0: main_elem id to refine\n      \/\/ map index 1: children that should be in the rayfire post-refinement\n      std::map<unsigned int,std::vector<unsigned int> > refine_elems;\n      refine_elems[60] = std::vector<unsigned int>();\n      refine_elems[60].push_back(0);\n      refine_elems[60].push_back(1);\n\n      refine_elems[52] = std::vector<unsigned int>();\n      refine_elems[52].push_back(0);\n\n      refine_elems[34] = std::vector<unsigned int>();\n      refine_elems[34].push_back(1);\n      refine_elems[34].push_back(2);\n      refine_elems[34].push_back(3);\n\n      refine_elems[25] = std::vector<unsigned int>();\n      refine_elems[25].push_back(3);\n\n      refine_elems[26] = std::vector<unsigned int>();\n      refine_elems[26].push_back(0);\n      refine_elems[26].push_back(1);\n      refine_elems[26].push_back(2);\n\n      refine_elems[17] = std::vector<unsigned int>();\n      refine_elems[17].push_back(2);\n      refine_elems[17].push_back(3);\n\n      refine_elems[9] = std::vector<unsigned int>();\n      refine_elems[9].push_back(1);\n      refine_elems[9].push_back(2);\n      refine_elems[9].push_back(3);\n\n      \/\/ check to make sure those elements are along the rayfire\n      \/\/ and then set their refinement flags\n      std::map<unsigned int,std::vector<unsigned int> >::iterator it = refine_elems.begin();\n      for(; it != refine_elems.end(); it++)\n        {\n          libMesh::Elem* elem = mesh->elem( it->first );\n          CPPUNIT_ASSERT( rayfire->map_to_rayfire_elem(elem->id()) );\n          elem->set_refinement_flag(libMesh::Elem::RefinementState::REFINE);\n        }\n\n      \/\/ refine the elements\n      libMesh::MeshRefinement mr(*mesh);\n      mr.refine_elements();\n\n      \/\/ reinitialize the rayfire\n      rayfire->reinit(*mesh);\n\n      \/\/ check the refined elements and their children\n      it = refine_elems.begin();\n      for(; it != refine_elems.end(); it++)\n        {\n          libMesh::Elem* elem = mesh->elem( it->first );\n\n          \/\/ make sure it was refined\n          CPPUNIT_ASSERT_EQUAL( elem->refinement_flag(), libMesh::Elem::RefinementState::INACTIVE );\n\n          \/\/ make sure it was deleted from the rayfire\n          CPPUNIT_ASSERT( !( rayfire->map_to_rayfire_elem(elem->id()) ) );\n\n          \/\/ check that the computed children are in the rayfire\n          \/\/ and that the rest are not\n          std::vector<unsigned int> children = it->second;\n          unsigned int index = 0;\n          for(unsigned int c=0; c<elem->n_children(); c++)\n            {\n              if (c==children[index] && index<children.size())\n                {\n                  index++;\n                  std::cout <<it->first <<\" child: \" <<c <<std::endl;\n                  CPPUNIT_ASSERT( rayfire->map_to_rayfire_elem( elem->child(c)->id() ) );\n                }\n              else\n                CPPUNIT_ASSERT( !(rayfire->map_to_rayfire_elem( elem->child(c)->id() )) );\n            }\n        }\n    }\n\n  };\n\n  CPPUNIT_TEST_SUITE_REGISTRATION( RayfireTestAMR );\n\n} \/\/ end namespace GRINSTesting\n\n#endif \/\/ GRINS_HAVE_CPPUNIT\n<commit_msg>Add another missing serial_mesh.h include<commit_after>\/\/-----------------------------------------------------------------------bl-\n\/\/--------------------------------------------------------------------------\n\/\/\n\/\/ GRINS - General Reacting Incompressible Navier-Stokes\n\/\/\n\/\/ Copyright (C) 2014-2016 Paul T. Bauman, Roy H. Stogner\n\/\/ Copyright (C) 2010-2013 The PECOS Development Team\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the Version 2.1 GNU Lesser General\n\/\/ Public License 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,\n\/\/ Boston, MA  02110-1301  USA\n\/\/\n\/\/-----------------------------------------------------------------------el-\n\n#include \"grins_config.h\"\n\n#ifdef GRINS_HAVE_CPPUNIT\n\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/TestCase.h>\n\n#include \"test_comm.h\"\n#include \"grins_test_paths.h\"\n\n\/\/ GRINS\n#include \"grins\/grins_enums.h\"\n#include \"grins\/mesh_builder.h\"\n#include \"grins\/rayfire_mesh.h\"\n#include \"grins\/math_constants.h\"\n\n\/\/ libMesh\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/getpot.h\"\n#include \"libmesh\/face_quad4.h\"\n#include \"libmesh\/face_quad9.h\"\n#include \"libmesh\/fe_interface.h\"\n#include \"libmesh\/mesh_refinement.h\"\n#include \"libmesh\/serial_mesh.h\"\n\nnamespace GRINSTesting\n{\n  class RayfireTestAMR : public CppUnit::TestCase\n  {\n  public:\n    CPPUNIT_TEST_SUITE( RayfireTestAMR );\n\n    CPPUNIT_TEST( single_elems );\n    CPPUNIT_TEST( through_vertex_postrefinment );\n    CPPUNIT_TEST( large_2D_mesh );\n    CPPUNIT_TEST( refine_elem_not_on_rayfire );\n\n    CPPUNIT_TEST_SUITE_END();\n\n  public:\n\n    \/\/! Refine a single element\n    void single_elems()\n    {\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = build_quad4_elem();\n      test_single_elem(mesh);\n\n      mesh = build_quad9_elem();\n      test_single_elem(mesh);\n    }\n\n    \/\/! After refinement, the rayfire will travel through a vertex\n    void through_vertex_postrefinment()\n    {\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = build_quad4_elem();\n      test_through_vertex(mesh);\n\n      mesh = build_quad9_elem();\n      test_through_vertex(mesh);\n    }\n\n    \/\/! A 10x10 mesh with selectively refined elements\n    void large_2D_mesh()\n    {\n      std::string filename = std::string(GRINS_TEST_UNIT_INPUT_SRCDIR)+\"\/mesh_quad4_100elem_2D.in\";\n      GetPot input_quad4(filename);\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = this->build_mesh(input_quad4);\n      test_large_mesh(mesh);\n\n      filename = std::string(GRINS_TEST_UNIT_INPUT_SRCDIR)+\"\/mesh_quad9_100elem_2D.in\";\n      GetPot input_quad9(filename);\n      mesh = this->build_mesh(input_quad9);\n      test_large_mesh(mesh);\n    }\n\n    \/\/! Make sure refined elements not on the rayfire do not get added\n    void refine_elem_not_on_rayfire()\n    {\n      std::string filename = std::string(GRINS_TEST_UNIT_INPUT_SRCDIR)+\"\/mesh_quad4_100elem_2D.in\";\n      GetPot input(filename);\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = this->build_mesh(input);\n\n      libMesh::Point origin(0.0,6.5);\n      libMesh::Point end_point(10.0,0.25);\n      libMesh::Real theta = calc_theta(origin,end_point);\n\n      GRINS::SharedPtr<GRINS::RayfireMesh> rayfire = new GRINS::RayfireMesh(origin,theta);\n      rayfire->init(*mesh);\n\n      \/\/ elem 0 is not along the rayfire\n      mesh->elem(0)->set_refinement_flag(libMesh::Elem::RefinementState::REFINE);\n\n      libMesh::MeshRefinement mr(*mesh);\n      mr.refine_elements();\n\n      rayfire->reinit(*mesh);\n\n      \/\/ elem 0 should not be in the rayfire\n      CPPUNIT_ASSERT( !(rayfire->map_to_rayfire_elem(mesh->elem(0)->id()) ) );\n\n      \/\/ no children of elem 0 should be in the rayfire\n      for (unsigned int i=0; i<4; i++)\n        CPPUNIT_ASSERT( !(rayfire->map_to_rayfire_elem( mesh->elem(0)->child(i)->id() ) ) );\n    }\n\n\n  private:\n\n    libMesh::Real calc_theta(libMesh::Point& start, libMesh::Point end)\n    {\n      return std::atan2( (end(1)-start(1)), (end(0)-start(0)) );\n    }\n\n    GRINS::SharedPtr<libMesh::UnstructuredMesh> build_mesh( const GetPot& input )\n    {\n      GRINS::MeshBuilder mesh_builder;\n      return mesh_builder.build( input, *TestCommWorld );\n    }\n\n    \/\/! Build a single square QUAD4\n    GRINS::SharedPtr<libMesh::UnstructuredMesh> build_quad4_elem()\n    {\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = new libMesh::SerialMesh(*TestCommWorld);\n\n      mesh->set_mesh_dimension(2);\n\n      mesh->add_point( libMesh::Point(0.0,0.0),0 );\n      mesh->add_point( libMesh::Point(1.0,0.0),1 );\n      mesh->add_point( libMesh::Point(1.0,1.0),2 );\n      mesh->add_point( libMesh::Point(0.0,1.0),3 );\n\n      libMesh::Elem* elem = mesh->add_elem( new libMesh::Quad4 );\n      for (unsigned int n=0; n<4; n++)\n        elem->set_node(n) = mesh->node_ptr(n);\n\n      mesh->prepare_for_use();\n\n      return mesh;\n    }\n\n    \/\/! Build a single square QUAD9\n    GRINS::SharedPtr<libMesh::UnstructuredMesh> build_quad9_elem()\n    {\n      GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh = new libMesh::SerialMesh(*TestCommWorld);\n\n      mesh->set_mesh_dimension(2);\n\n      mesh->add_point( libMesh::Point(0.0,0.0),0 );\n      mesh->add_point( libMesh::Point(1.0,0.0),1 );\n      mesh->add_point( libMesh::Point(1.0,1.0),2 );\n      mesh->add_point( libMesh::Point(0.0,1.0),3 );\n      mesh->add_point( libMesh::Point(0.5,0.0),4 );\n      mesh->add_point( libMesh::Point(1.0,0.5),5 );\n      mesh->add_point( libMesh::Point(0.5,1.0),6 );\n      mesh->add_point( libMesh::Point(0.0,0.5),7 );\n      mesh->add_point( libMesh::Point(0.5,0.5),8 );\n\n      libMesh::Elem* elem = mesh->add_elem( new libMesh::Quad9 );\n      for (unsigned int n=0; n<9; n++)\n        elem->set_node(n) = mesh->node_ptr(n);\n\n      mesh->prepare_for_use();\n\n      return mesh;\n    }\n\n    \/\/! Runs the test on single square QUADs of unit length and width\n    void test_single_elem(GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh)\n    {\n      CPPUNIT_ASSERT_EQUAL( mesh->n_elem(), (libMesh::dof_id_type)1 );\n\n      libMesh::Point origin(0.0,0.1);\n      libMesh::Point end_point(1.0,0.2);\n      libMesh::Real theta = calc_theta(origin,end_point);\n\n      GRINS::SharedPtr<GRINS::RayfireMesh> rayfire = new GRINS::RayfireMesh(origin,theta);\n      rayfire->init(*mesh);\n\n      libMesh::Elem* elem = mesh->elem(0);\n      CPPUNIT_ASSERT(elem);\n\n      elem->set_refinement_flag(libMesh::Elem::RefinementState::REFINE);\n\n      libMesh::MeshRefinement mr(*mesh);\n      mr.refine_elements();\n\n      rayfire->reinit(*mesh);\n\n      const libMesh::Elem* rayfire_elem0 = rayfire->map_to_rayfire_elem( elem->child(0)->id() );\n      CPPUNIT_ASSERT(rayfire_elem0);\n\n      const libMesh::Elem* rayfire_elem1 = rayfire->map_to_rayfire_elem( elem->child(1)->id() );\n      CPPUNIT_ASSERT(rayfire_elem1);\n\n      CPPUNIT_ASSERT( (rayfire_elem0->get_node(0))->absolute_fuzzy_equals(origin) );\n      CPPUNIT_ASSERT( (rayfire_elem0->get_node(1))->absolute_fuzzy_equals(libMesh::Point(0.5,0.15)) );\n      CPPUNIT_ASSERT( (rayfire_elem1->get_node(0))->absolute_fuzzy_equals(libMesh::Point(0.5,0.15)) );\n      CPPUNIT_ASSERT( (rayfire_elem1->get_node(1))->absolute_fuzzy_equals(end_point) );\n    }\n\n    void test_through_vertex(GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh)\n    {\n      libMesh::Point origin(0.0,0.0);\n      libMesh::Point end_point(1.0,1.0);\n      libMesh::Real theta = calc_theta(origin,end_point);\n\n      GRINS::SharedPtr<GRINS::RayfireMesh> rayfire = new GRINS::RayfireMesh(origin,theta);\n      rayfire->init(*mesh);\n\n      libMesh::Elem* elem = mesh->elem(0);\n      CPPUNIT_ASSERT(elem);\n\n      elem->set_refinement_flag(libMesh::Elem::RefinementState::REFINE);\n\n      libMesh::MeshRefinement mr(*mesh);\n      mr.refine_elements();\n\n      rayfire->reinit(*mesh);\n\n      const libMesh::Elem* rayfire_elem0 = rayfire->map_to_rayfire_elem( elem->child(0)->id() );\n      CPPUNIT_ASSERT(rayfire_elem0);\n\n      const libMesh::Elem* rayfire_elem1 = rayfire->map_to_rayfire_elem( elem->child(3)->id() );\n      CPPUNIT_ASSERT(rayfire_elem1);\n\n      CPPUNIT_ASSERT( (rayfire_elem0->get_node(0))->absolute_fuzzy_equals(origin) );\n      CPPUNIT_ASSERT( (rayfire_elem0->get_node(1))->absolute_fuzzy_equals(libMesh::Point(0.5,0.5)) );\n      CPPUNIT_ASSERT( (rayfire_elem1->get_node(0))->absolute_fuzzy_equals(libMesh::Point(0.5,0.5)) );\n      CPPUNIT_ASSERT( (rayfire_elem1->get_node(1))->absolute_fuzzy_equals(end_point) );\n    }\n\n    \/\/! Refine specific elements on a large mesh\n    void test_large_mesh(GRINS::SharedPtr<libMesh::UnstructuredMesh> mesh)\n    {\n      libMesh::Point origin(0.0,6.5);\n      libMesh::Point end_point(10.0,0.25);\n      libMesh::Real theta = calc_theta(origin,end_point);\n\n      GRINS::SharedPtr<GRINS::RayfireMesh> rayfire = new GRINS::RayfireMesh(origin,theta);\n      rayfire->init(*mesh);\n\n      \/\/ manually refine specific elements\n      \/\/ map index 0: main_elem id to refine\n      \/\/ map index 1: children that should be in the rayfire post-refinement\n      std::map<unsigned int,std::vector<unsigned int> > refine_elems;\n      refine_elems[60] = std::vector<unsigned int>();\n      refine_elems[60].push_back(0);\n      refine_elems[60].push_back(1);\n\n      refine_elems[52] = std::vector<unsigned int>();\n      refine_elems[52].push_back(0);\n\n      refine_elems[34] = std::vector<unsigned int>();\n      refine_elems[34].push_back(1);\n      refine_elems[34].push_back(2);\n      refine_elems[34].push_back(3);\n\n      refine_elems[25] = std::vector<unsigned int>();\n      refine_elems[25].push_back(3);\n\n      refine_elems[26] = std::vector<unsigned int>();\n      refine_elems[26].push_back(0);\n      refine_elems[26].push_back(1);\n      refine_elems[26].push_back(2);\n\n      refine_elems[17] = std::vector<unsigned int>();\n      refine_elems[17].push_back(2);\n      refine_elems[17].push_back(3);\n\n      refine_elems[9] = std::vector<unsigned int>();\n      refine_elems[9].push_back(1);\n      refine_elems[9].push_back(2);\n      refine_elems[9].push_back(3);\n\n      \/\/ check to make sure those elements are along the rayfire\n      \/\/ and then set their refinement flags\n      std::map<unsigned int,std::vector<unsigned int> >::iterator it = refine_elems.begin();\n      for(; it != refine_elems.end(); it++)\n        {\n          libMesh::Elem* elem = mesh->elem( it->first );\n          CPPUNIT_ASSERT( rayfire->map_to_rayfire_elem(elem->id()) );\n          elem->set_refinement_flag(libMesh::Elem::RefinementState::REFINE);\n        }\n\n      \/\/ refine the elements\n      libMesh::MeshRefinement mr(*mesh);\n      mr.refine_elements();\n\n      \/\/ reinitialize the rayfire\n      rayfire->reinit(*mesh);\n\n      \/\/ check the refined elements and their children\n      it = refine_elems.begin();\n      for(; it != refine_elems.end(); it++)\n        {\n          libMesh::Elem* elem = mesh->elem( it->first );\n\n          \/\/ make sure it was refined\n          CPPUNIT_ASSERT_EQUAL( elem->refinement_flag(), libMesh::Elem::RefinementState::INACTIVE );\n\n          \/\/ make sure it was deleted from the rayfire\n          CPPUNIT_ASSERT( !( rayfire->map_to_rayfire_elem(elem->id()) ) );\n\n          \/\/ check that the computed children are in the rayfire\n          \/\/ and that the rest are not\n          std::vector<unsigned int> children = it->second;\n          unsigned int index = 0;\n          for(unsigned int c=0; c<elem->n_children(); c++)\n            {\n              if (c==children[index] && index<children.size())\n                {\n                  index++;\n                  std::cout <<it->first <<\" child: \" <<c <<std::endl;\n                  CPPUNIT_ASSERT( rayfire->map_to_rayfire_elem( elem->child(c)->id() ) );\n                }\n              else\n                CPPUNIT_ASSERT( !(rayfire->map_to_rayfire_elem( elem->child(c)->id() )) );\n            }\n        }\n    }\n\n  };\n\n  CPPUNIT_TEST_SUITE_REGISTRATION( RayfireTestAMR );\n\n} \/\/ end namespace GRINSTesting\n\n#endif \/\/ GRINS_HAVE_CPPUNIT\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n * Large parts of this file were copied from the following repo:\n * https:\/\/github.com\/chris-wood\/dtls-test\n *\n * The BIO part is strongly inspired by the following file:\n * https:\/\/gist.github.com\/darrenjs\/4645f115d10aa4b5cebf57483ec82eca\n *\n *\n * Use this command to create the certificate:\n * openssl req -x509 -newkey rsa:2048 -days 3650 -nodes -keyout server-key.pem\n * -out server-cert.pem\n *\/\n\n#include <arpa\/inet.h>\n#include <cstring>\n#include <iostream>\n#include <openssl\/conf.h>\n#include <openssl\/dh.h>\n#include <openssl\/engine.h>\n#include <openssl\/err.h>\n#include <openssl\/ssl.h>\n#include <stdbool.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <sys\/socket.h>\n#include <thread>\n#include <unistd.h>\n#include <unordered_map>\n#include <vector>\n\ntypedef unsigned int uint;\n\nusing namespace std;\n\nstruct conn {\n\tSSL *ssl;\n\tBIO *wbio;\n\tBIO *rbio;\n};\n\n\/\/ Taken from:\n\/\/ https:\/\/stackoverflow.com\/a\/20602159\nstruct pairhash {\npublic:\n\ttemplate <typename T, typename U> std::size_t operator()(const std::pair<T, U> &x) const {\n\t\treturn std::hash<T>()(x.first) ^ std::hash<U>()(x.second);\n\t}\n};\n\nvoid dtls_Begin() {\n\tSSL_library_init();\n\tSSL_load_error_strings();\n\tERR_load_BIO_strings();\n\tOpenSSL_add_all_algorithms();\n}\n\nstatic int _ssl_verify_peer(int ok, X509_STORE_CTX *ctx) {\n\t(void)ok;\n\t(void)ctx;\n\treturn 1;\n}\n\nstatic int _createSocket(int port) {\n\tint sock;\n\tstruct sockaddr_in addr;\n\n\taddr.sin_family = AF_INET;\n\taddr.sin_port = htons(port);\n\taddr.sin_addr.s_addr = htonl(INADDR_ANY);\n\n\tsock = socket(AF_INET, SOCK_DGRAM, 0);\n\tif (sock < 0) {\n\t\tperror(\"Unable to create socket\");\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tif (::bind(sock, (struct sockaddr *)&addr, sizeof(addr)) < 0) {\n\t\tperror(\"Unable to bind\");\n\t\texit(EXIT_FAILURE);\n\t}\n\n\treturn sock;\n}\n\nint dtls_InitContextFromKeystore(SSL_CTX **ctx, const char *keyname) {\n\tint result = 0;\n\n\t\/\/ Create a new context using DTLS\n\t*ctx = SSL_CTX_new(DTLS_method());\n\tif (ctx == NULL) {\n\t\tprintf(\"Error: cannot create SSL_CTX.\\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -1;\n\t}\n\n\t\/\/ Set our supported ciphers\n\tresult = SSL_CTX_set_cipher_list(*ctx, \"ALL:!ADH:!LOW:!EXP:!MD5:@STRENGTH\");\n\tif (result != 1) {\n\t\tprintf(\"Error: cannot set the cipher list.\\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -2;\n\t}\n\n\t\/\/ The client doesn't have to send it's certificate\n\tSSL_CTX_set_verify(*ctx, SSL_VERIFY_PEER, _ssl_verify_peer);\n\n\t\/\/ Load key and certificate\n\tchar certfile[1024];\n\tchar keyfile[1024];\n\tsprintf(certfile, \".\/%s-cert.pem\", keyname);\n\tsprintf(keyfile, \".\/%s-key.pem\", keyname);\n\n\t\/\/ Load the certificate file; contains also the public key\n\tresult = SSL_CTX_use_certificate_file(*ctx, certfile, SSL_FILETYPE_PEM);\n\tif (result != 1) {\n\t\tprintf(\"Error: cannot load certificate file.\\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -4;\n\t}\n\n\t\/\/ Load private key\n\tresult = SSL_CTX_use_PrivateKey_file(*ctx, keyfile, SSL_FILETYPE_PEM);\n\tif (result != 1) {\n\t\tprintf(\"Error: cannot load private key file.\\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -5;\n\t}\n\n\t\/\/ Check if the private key is valid\n\tresult = SSL_CTX_check_private_key(*ctx);\n\tif (result != 1) {\n\t\tprintf(\"Error: checking the private key failed. \\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -6;\n\t}\n\n\treturn 0;\n}\n\nconn *createNewConn(SSL_CTX *ctx) {\n\tSSL *ssl = SSL_new(ctx);\n\tif (ssl == NULL) {\n\t\tcout << \"SSL_new() failed\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tBIO *wbio = BIO_new(BIO_s_memQ());\n\tif (wbio == NULL) {\n\t\tcout << \"BIO_new() failed\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tBIO *rbio = BIO_new(BIO_s_memQ());\n\tif (rbio == NULL) {\n\t\tcout << \"BIO_new() failed\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tSSL_set_accept_state(ssl);\n\tSSL_set_bio(ssl, rbio, wbio);\n\n\tconn *c = new conn();\n\n\tc->ssl = ssl;\n\tc->wbio = wbio;\n\tc->rbio = rbio;\n\n\treturn c;\n}\n\nint handlePacket(int fd, struct conn *conn, char *buf, int bufLen, int recvBytes,\n\tstruct sockaddr_in *src_addr) {\n\n\tif (BIO_write(conn->rbio, buf, recvBytes) != recvBytes) {\n\t\tcout << \"BIO_write() failed\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tif (SSL_is_init_finished(conn->ssl)) {\n\t\t\/\/ Here the handshake is already finished\n\n\t\t\/\/ Try to read incoming byte from the connection\n\t\tint readLen = SSL_read(conn->ssl, buf, bufLen);\n\t\tif ((readLen <= 0) && (SSL_get_shutdown(conn->ssl) == 0)) {\n\t\t\tcout << \"SSL_read() failed\" << endl;\n\t\t\tcout << \"shutdown: \" << SSL_get_shutdown(conn->ssl) << endl;\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\t\/\/ Try to write the same bytes to the connection\n\t\tif (readLen > 0) {\n\t\t\tint writeLen = SSL_write(conn->ssl, buf, readLen);\n\t\t\tif (writeLen <= 0) {\n\t\t\t\tcout << \"SSL_write() failed\" << endl;\n\t\t\t\texit(EXIT_FAILURE);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t\/\/ We are currently conducting a handshake\n\n\t\t\/\/ The return code is pretty useless, throw it away\n\t\tSSL_accept(conn->ssl);\n\t}\n\n\t\/\/ Write out all data\n\tint readCount;\n\twhile ((readCount = BIO_read(conn->wbio, buf, bufLen)) > 0) {\n\t\tint sendBytes = sendto(\n\t\t\tfd, buf, readCount, 0, (struct sockaddr *)src_addr, sizeof(struct sockaddr_in));\n\t\tif (sendBytes != readCount) {\n\t\t\tperror(\"sendto() failed\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t}\n\n\tif (SSL_get_shutdown(conn->ssl) != 0) {\n\t\tif (SSL_shutdown(conn->ssl) == 1) {\n\t\t\tSSL_free(conn->ssl);\n\t\t\tdelete (conn);\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nint main() {\n\t\/\/ Initialize whatever OpenSSL state is necessary to execute the DTLS protocol.\n\tdtls_Begin();\n\n\tSSL_CTX *ctx;\n\n\tif (dtls_InitContextFromKeystore(&ctx, \"server\") < 0) {\n\t\texit(EXIT_FAILURE);\n\t}\n\n\t\/\/ Create the server UDP listener socket\n\tint sock = _createSocket(4433);\n\n\tunordered_map<pair<unsigned long, unsigned short>, struct conn *, pairhash> connections;\n\n\tchar buf[2048];\n\n\twhile (true) {\n\t\tstruct sockaddr_in src_addr;\n\t\tsocklen_t addrlen = sizeof(struct sockaddr_in);\n\n\t\t\/\/ Try and recv a packet\n\t\tint ret =\n\t\t\trecvfrom(sock, (void *)buf, 2048, 0, (struct sockaddr *)&src_addr, &addrlen);\n\t\tif (ret < 0) {\n\t\t\tperror(\"recvfrom failed\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\t\/\/ Look up if there already exists a connection\n\tconn_lockup:\n\t\tauto conn_it = connections.find({src_addr.sin_addr.s_addr, src_addr.sin_port});\n\t\tif (conn_it == connections.end()) {\n\t\t\tconnections.insert(\n\t\t\t\t{{src_addr.sin_addr.s_addr, src_addr.sin_port}, createNewConn(ctx)});\n\t\t\tgoto conn_lockup;\n\t\t}\n\n\t\t\/\/ Just double checking\n\t\tif (conn_it == connections.end()) {\n\t\t\tcout << \"conn_it is invalid...\" << endl;\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\tif (handlePacket(sock, conn_it->second, buf, 2048, ret, &src_addr) == 1) {\n\t\t\tconnections.erase(conn_it);\n\t\t}\n\t}\n\n\tclose(sock);\n}\n<commit_msg>make the DTLS server more verbose<commit_after>\n\/*\n * Large parts of this file were copied from the following repo:\n * https:\/\/github.com\/chris-wood\/dtls-test\n *\n * The BIO part is strongly inspired by the following file:\n * https:\/\/gist.github.com\/darrenjs\/4645f115d10aa4b5cebf57483ec82eca\n *\n *\n * Use this command to create the certificate:\n * openssl req -x509 -newkey rsa:2048 -days 3650 -nodes -keyout server-key.pem\n * -out server-cert.pem\n *\/\n\n#include <arpa\/inet.h>\n#include <cstring>\n#include <iostream>\n#include <openssl\/conf.h>\n#include <openssl\/dh.h>\n#include <openssl\/engine.h>\n#include <openssl\/err.h>\n#include <openssl\/ssl.h>\n#include <stdbool.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <sys\/socket.h>\n#include <thread>\n#include <unistd.h>\n#include <unordered_map>\n#include <vector>\n\ntypedef unsigned int uint;\n\nusing namespace std;\n\nstruct conn {\n\tSSL *ssl;\n\tBIO *wbio;\n\tBIO *rbio;\n};\n\n\/\/ Taken from:\n\/\/ https:\/\/stackoverflow.com\/a\/20602159\nstruct pairhash {\npublic:\n\ttemplate <typename T, typename U> std::size_t operator()(const std::pair<T, U> &x) const {\n\t\treturn std::hash<T>()(x.first) ^ std::hash<U>()(x.second);\n\t}\n};\n\nvoid dtls_Begin() {\n\tSSL_library_init();\n\tSSL_load_error_strings();\n\tERR_load_BIO_strings();\n\tOpenSSL_add_all_algorithms();\n}\n\nstatic int _ssl_verify_peer(int ok, X509_STORE_CTX *ctx) {\n\t(void)ok;\n\t(void)ctx;\n\treturn 1;\n}\n\nstatic int _createSocket(int port) {\n\tint sock;\n\tstruct sockaddr_in addr;\n\n\taddr.sin_family = AF_INET;\n\taddr.sin_port = htons(port);\n\taddr.sin_addr.s_addr = htonl(INADDR_ANY);\n\n\tsock = socket(AF_INET, SOCK_DGRAM, 0);\n\tif (sock < 0) {\n\t\tperror(\"Unable to create socket\");\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tif (::bind(sock, (struct sockaddr *)&addr, sizeof(addr)) < 0) {\n\t\tperror(\"Unable to bind\");\n\t\texit(EXIT_FAILURE);\n\t}\n\n\treturn sock;\n}\n\nint dtls_InitContextFromKeystore(SSL_CTX **ctx, const char *keyname) {\n\tint result = 0;\n\n\t\/\/ Create a new context using DTLS\n\t*ctx = SSL_CTX_new(DTLS_method());\n\tif (ctx == NULL) {\n\t\tprintf(\"Error: cannot create SSL_CTX.\\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -1;\n\t}\n\n\t\/\/ Set our supported ciphers\n\tresult = SSL_CTX_set_cipher_list(*ctx, \"ALL:!ADH:!LOW:!EXP:!MD5:@STRENGTH\");\n\tif (result != 1) {\n\t\tprintf(\"Error: cannot set the cipher list.\\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -2;\n\t}\n\n\t\/\/ The client doesn't have to send it's certificate\n\tSSL_CTX_set_verify(*ctx, SSL_VERIFY_PEER, _ssl_verify_peer);\n\n\t\/\/ Load key and certificate\n\tchar certfile[1024];\n\tchar keyfile[1024];\n\tsprintf(certfile, \".\/%s-cert.pem\", keyname);\n\tsprintf(keyfile, \".\/%s-key.pem\", keyname);\n\n\t\/\/ Load the certificate file; contains also the public key\n\tresult = SSL_CTX_use_certificate_file(*ctx, certfile, SSL_FILETYPE_PEM);\n\tif (result != 1) {\n\t\tprintf(\"Error: cannot load certificate file.\\n\");\n\t\tprintf(\"IN CASE YOU DIDN'T CREATE ONE:\\n\");\n\t\tprintf(\"openssl req -x509 -newkey rsa:2048 -days 3650 -nodes -keyout server-key.pem \"\n\t\t\t   \"-out server-cert.pem\\n\\n\");\n\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -4;\n\t}\n\n\t\/\/ Load private key\n\tresult = SSL_CTX_use_PrivateKey_file(*ctx, keyfile, SSL_FILETYPE_PEM);\n\tif (result != 1) {\n\t\tprintf(\"Error: cannot load private key file.\\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -5;\n\t}\n\n\t\/\/ Check if the private key is valid\n\tresult = SSL_CTX_check_private_key(*ctx);\n\tif (result != 1) {\n\t\tprintf(\"Error: checking the private key failed. \\n\");\n\t\tERR_print_errors_fp(stderr);\n\t\treturn -6;\n\t}\n\n\treturn 0;\n}\n\nconn *createNewConn(SSL_CTX *ctx) {\n\tSSL *ssl = SSL_new(ctx);\n\tif (ssl == NULL) {\n\t\tcout << \"SSL_new() failed\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tBIO *wbio = BIO_new(BIO_s_memQ());\n\tif (wbio == NULL) {\n\t\tcout << \"BIO_new() failed\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tBIO *rbio = BIO_new(BIO_s_memQ());\n\tif (rbio == NULL) {\n\t\tcout << \"BIO_new() failed\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tSSL_set_accept_state(ssl);\n\tSSL_set_bio(ssl, rbio, wbio);\n\n\tconn *c = new conn();\n\n\tc->ssl = ssl;\n\tc->wbio = wbio;\n\tc->rbio = rbio;\n\n\treturn c;\n}\n\nint handlePacket(int fd, struct conn *conn, char *buf, int bufLen, int recvBytes,\n\tstruct sockaddr_in *src_addr) {\n\n\tif (BIO_write(conn->rbio, buf, recvBytes) != recvBytes) {\n\t\tcout << \"BIO_write() failed\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tif (SSL_is_init_finished(conn->ssl)) {\n\t\t\/\/ Here the handshake is already finished\n\n\t\t\/\/ Try to read incoming byte from the connection\n\t\tint readLen = SSL_read(conn->ssl, buf, bufLen);\n\t\tif ((readLen <= 0) && (SSL_get_shutdown(conn->ssl) == 0)) {\n\t\t\tcout << \"SSL_read() failed\" << endl;\n\t\t\tcout << \"shutdown: \" << SSL_get_shutdown(conn->ssl) << endl;\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\t\/\/ Try to write the same bytes to the connection\n\t\tif (readLen > 0) {\n\t\t\tint writeLen = SSL_write(conn->ssl, buf, readLen);\n\t\t\tif (writeLen <= 0) {\n\t\t\t\tcout << \"SSL_write() failed\" << endl;\n\t\t\t\texit(EXIT_FAILURE);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t\/\/ We are currently conducting a handshake\n\n\t\t\/\/ The return code is pretty useless, throw it away\n\t\tSSL_accept(conn->ssl);\n\t}\n\n\t\/\/ Write out all data\n\tint readCount;\n\twhile ((readCount = BIO_read(conn->wbio, buf, bufLen)) > 0) {\n\t\tint sendBytes = sendto(\n\t\t\tfd, buf, readCount, 0, (struct sockaddr *)src_addr, sizeof(struct sockaddr_in));\n\t\tif (sendBytes != readCount) {\n\t\t\tperror(\"sendto() failed\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t}\n\n\tif (SSL_get_shutdown(conn->ssl) != 0) {\n\t\tif (SSL_shutdown(conn->ssl) == 1) {\n\t\t\tSSL_free(conn->ssl);\n\t\t\tdelete (conn);\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nint main() {\n\t\/\/ Initialize whatever OpenSSL state is necessary to execute the DTLS protocol.\n\tdtls_Begin();\n\n\tSSL_CTX *ctx;\n\n\tif (dtls_InitContextFromKeystore(&ctx, \"server\") < 0) {\n\t\texit(EXIT_FAILURE);\n\t}\n\n\t\/\/ Create the server UDP listener socket\n\tint sock = _createSocket(4433);\n\n\tunordered_map<pair<unsigned long, unsigned short>, struct conn *, pairhash> connections;\n\n\tchar buf[2048];\n\n\twhile (true) {\n\t\tstruct sockaddr_in src_addr;\n\t\tsocklen_t addrlen = sizeof(struct sockaddr_in);\n\n\t\t\/\/ Try and recv a packet\n\t\tint ret =\n\t\t\trecvfrom(sock, (void *)buf, 2048, 0, (struct sockaddr *)&src_addr, &addrlen);\n\t\tif (ret < 0) {\n\t\t\tperror(\"recvfrom failed\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\t\/\/ Look up if there already exists a connection\n\tconn_lockup:\n\t\tauto conn_it = connections.find({src_addr.sin_addr.s_addr, src_addr.sin_port});\n\t\tif (conn_it == connections.end()) {\n\t\t\tcout << \"Connection from new client\" << endl;\n\t\t\tconnections.insert(\n\t\t\t\t{{src_addr.sin_addr.s_addr, src_addr.sin_port}, createNewConn(ctx)});\n\t\t\tgoto conn_lockup;\n\t\t}\n\n\t\t\/\/ Just double checking\n\t\tif (conn_it == connections.end()) {\n\t\t\tcout << \"conn_it is invalid...\" << endl;\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\tif (handlePacket(sock, conn_it->second, buf, 2048, ret, &src_addr) == 1) {\n\t\t\tconnections.erase(conn_it);\n\t\t}\n\t}\n\n\tclose(sock);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file      retdec\/file_tests.cpp\n\/\/\/ @copyright (c) 2015 by Petr Zemek (s3rvac@gmail.com) and contributors\n\/\/\/ @license   MIT, see the @c LICENSE file for more details\n\/\/\/ @brief     Tests for the decompilation.\n\/\/\/\n\n#include <gtest\/gtest.h>\n\n#include \"retdec\/file.h\"\n#include \"retdec\/internal\/utilities\/os.h\"\n\nusing namespace testing;\n\nnamespace retdec {\nnamespace tests {\n\n\/\/\/\n\/\/\/ Tests for File.\n\/\/\/\nclass FileTests: public Test {};\n\nTEST_F(FileTests,\nFromContentWithNameReturnsFileWithCorrectContentAndName) {\n\tauto file = File::fromContentWithName(\"content\", \"file.txt\");\n\tEXPECT_EQ(\"content\", file->getContent());\n\tEXPECT_EQ(\"file.txt\", file->getName());\n}\n\nTEST_F(FileTests,\nFromFilesystemReturnsFileWithCorrectName) {\n#ifdef RETDEC_OS_WINDOWS\n\tauto file = File::fromFilesystem(R\"(C:\\\\\/path\/to\/file.txt)\")\n#else\n\tauto file = File::fromFilesystem(\"\/path\/to\/file.txt\");\n#endif\n\tEXPECT_EQ(\"file.txt\", file->getName());\n}\n\nTEST_F(FileTests,\nFromFilesystemWithOtherNameReturnsFileWithCorrectName) {\n#ifdef RETDEC_OS_WINDOWS\n\tauto file = File::fromFilesystemWithOtherName(\n\t\tR\"(C:\\\\\/path\/to\/file.txt)\", \"other.txt\")\n#else\n\tauto file = File::fromFilesystemWithOtherName(\n\t\t\"\/path\/to\/file.txt\", \"other.txt\");\n#endif\n\tEXPECT_EQ(\"other.txt\", file->getName());\n}\n\n} \/\/ namespace tests\n} \/\/ namespace retdec\n<commit_msg>Fix a typo in file_tests.cpp.<commit_after>\/\/\/\n\/\/\/ @file      retdec\/file_tests.cpp\n\/\/\/ @copyright (c) 2015 by Petr Zemek (s3rvac@gmail.com) and contributors\n\/\/\/ @license   MIT, see the @c LICENSE file for more details\n\/\/\/ @brief     Tests for the files.\n\/\/\/\n\n#include <gtest\/gtest.h>\n\n#include \"retdec\/file.h\"\n#include \"retdec\/internal\/utilities\/os.h\"\n\nusing namespace testing;\n\nnamespace retdec {\nnamespace tests {\n\n\/\/\/\n\/\/\/ Tests for File.\n\/\/\/\nclass FileTests: public Test {};\n\nTEST_F(FileTests,\nFromContentWithNameReturnsFileWithCorrectContentAndName) {\n\tauto file = File::fromContentWithName(\"content\", \"file.txt\");\n\tEXPECT_EQ(\"content\", file->getContent());\n\tEXPECT_EQ(\"file.txt\", file->getName());\n}\n\nTEST_F(FileTests,\nFromFilesystemReturnsFileWithCorrectName) {\n#ifdef RETDEC_OS_WINDOWS\n\tauto file = File::fromFilesystem(R\"(C:\\\\\/path\/to\/file.txt)\")\n#else\n\tauto file = File::fromFilesystem(\"\/path\/to\/file.txt\");\n#endif\n\tEXPECT_EQ(\"file.txt\", file->getName());\n}\n\nTEST_F(FileTests,\nFromFilesystemWithOtherNameReturnsFileWithCorrectName) {\n#ifdef RETDEC_OS_WINDOWS\n\tauto file = File::fromFilesystemWithOtherName(\n\t\tR\"(C:\\\\\/path\/to\/file.txt)\", \"other.txt\")\n#else\n\tauto file = File::fromFilesystemWithOtherName(\n\t\t\"\/path\/to\/file.txt\", \"other.txt\");\n#endif\n\tEXPECT_EQ(\"other.txt\", file->getName());\n}\n\n} \/\/ namespace tests\n} \/\/ namespace retdec\n<|endoftext|>"}
{"text":"<commit_before>#include <chrono>\n#include <iostream>\n#include <memory>\n#include <string.h>\n#include \"..\/lcd\/LcdDisplay.h\"\n#include \"..\/src2\/HealthStatus.h\"\n\nusing namespace std;\nusing namespace std::chrono;\n\nint main() {\n    unique_ptr<LcdDisplay> lcd(LcdDisplay::getLcdDisplayInstance());\n    lcd->init();\n    StatusInformation status;\n    beacon_info beacon;\n    memset(&beacon, sizeof(beacon), 0);\n    status.setScannerID(\"Room206\");\n\n    \/\/ Add some events\n    sprintf(beacon.uuid, \"UUID-%.10d\", 66);\n    beacon.minor = 66;\n    beacon.major = 1;\n    beacon.manufacturer = 0xdead;\n    beacon.code = 0xbeef;\n    beacon.count = 3;\n    beacon.rssi = -68;\n    milliseconds now = duration_cast<milliseconds >(high_resolution_clock::now().time_since_epoch());\n    beacon.time = now.count();\n    status.addEvent(beacon, false);\n\n    beacon.isHeartbeat = true;\n    beacon.minor = 206;\n    beacon.time += 10;\n    status.addEvent(beacon, true);\n\n    beacon.isHeartbeat = false;\n    beacon.minor = 56;\n    beacon.time += 10;\n    status.addEvent(beacon, false);\n\n    beacon.isHeartbeat = true;\n    beacon.minor = 206;\n    beacon.time += 10;\n    status.addEvent(beacon, true);\n\n    HealthStatus healthStatus;\n    healthStatus.calculateStatus(status);\n    Properties statusProps = healthStatus.getLastStatus();\n    char tmp[20];\n    snprintf(tmp, 20, \"%s: HC:%.5d RSSI:%d\", status.getScannerID().c_str(), status.getHeartbeatCount(), status.getHeartbeatRSSI());\n    lcd->displayText(tmp, 0, 0);\n    const char *uptime = statusProps[\"Uptime\"].c_str();\n    snprintf(tmp, 20, \"UP: %s: \", uptime);\n    lcd->displayText(tmp, 0, 1);\n    const char *load = statusProps[\"LoadAverage\"].c_str();\n\n    cout << \"Enter any key to exit: \";\n    std::string line; std::getline(std::cin, line);\n    lcd->clear();\n}\n<commit_msg>Correct the status information passing<commit_after>#include <chrono>\n#include <iostream>\n#include <memory>\n#include <string.h>\n#include \"..\/lcd\/LcdDisplay.h\"\n#include \"..\/src2\/HealthStatus.h\"\n\nusing namespace std;\nusing namespace std::chrono;\n\nint main() {\n    unique_ptr<LcdDisplay> lcd(LcdDisplay::getLcdDisplayInstance());\n    lcd->init();\n    StatusInformation status;\n    beacon_info beacon;\n    memset(&beacon, sizeof(beacon), 0);\n    status.setScannerID(\"Room206\");\n\n    \/\/ Add some events\n    sprintf(beacon.uuid, \"UUID-%.10d\", 66);\n    beacon.minor = 66;\n    beacon.major = 1;\n    beacon.manufacturer = 0xdead;\n    beacon.code = 0xbeef;\n    beacon.count = 3;\n    beacon.rssi = -68;\n    milliseconds now = duration_cast<milliseconds >(high_resolution_clock::now().time_since_epoch());\n    beacon.time = now.count();\n    status.addEvent(beacon, false);\n\n    beacon.isHeartbeat = true;\n    beacon.minor = 206;\n    beacon.time += 10;\n    status.addEvent(beacon, true);\n\n    beacon.isHeartbeat = false;\n    beacon.minor = 56;\n    beacon.time += 10;\n    status.addEvent(beacon, false);\n\n    beacon.isHeartbeat = true;\n    beacon.minor = 206;\n    beacon.time += 10;\n    status.addEvent(beacon, true);\n\n    HealthStatus healthStatus;\n    healthStatus.calculateStatus(status);\n    Properties statusProps = healthStatus.getLastStatus();\n    char tmp[20];\n    snprintf(tmp, 20, \"%s:%.5d;%d\", status.getScannerID().c_str(), status.getHeartbeatCount(), status.getHeartbeatRSSI());\n    lcd->displayText(tmp, 0, 0);\n    string uptime = statusProps[\"Uptime\"];\n    printf(\"%s; length=%d\\n\", uptime.c_str(), uptime.size());\n    snprintf(tmp, 20, \"UP: %s: \", uptime);\n    lcd->displayText(tmp, 0, 1);\n    const char *load = statusProps[\"LoadAverage\"].c_str();\n    lcd->displayText(tmp, 0, 2);\n\n\n    cout << \"Enter any key to exit: \";\n    std::string line; std::getline(std::cin, line);\n    lcd->clear();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * test_post_weights.cpp\n *\n *  Created on: Feb 4, 2010\n *      Author: Craig Rasmussen\n *\n * This file tests the conversion of pre-synaptic weight patches to post-synaptic\n * weight patches.\n *\n *\/\n\n#undef DEBUG_PRINT\n\n#include \"..\/src\/columns\/HyPerCol.hpp\"\n#include \"..\/src\/layers\/HyPerLayer.hpp\"\n#include \"..\/src\/connections\/HyPerConn.hpp\"\n#include \"..\/src\/layers\/Example.hpp\"\n#include \"..\/src\/io\/ConnectionProbe.hpp\"\n#include \"..\/src\/io\/PostConnProbe.hpp\"\n\nusing namespace PV;\n\nstatic int set_weights_to_source_index(HyPerConn * c);\nstatic int check_weights(HyPerConn * c, PVPatch ** postWeights);\n\nint main(int argc, char * argv[])\n{\n   PVPatch ** postWeights;\n\n   int status = 0;\n\n   HyPerCol  * hc = new HyPerCol(\"column\", argc, argv);\n   Example   * l1 = new Example(\"test_post_weights L1\", hc);\n   Example   * l2 = new Example(\"test_post_weights L2\", hc);\n   Example   * l3 = new Example(\"test_post_weights L3\", hc);\n   HyPerConn * c1 = new HyPerConn(\"test_post_weights L1 to L1\", hc, l1, l1, CHANNEL_EXC);\n   HyPerConn * c2 = new HyPerConn(\"test_post_weights L2 to L3\", hc, l2, l3, CHANNEL_EXC);\n\n   \/\/ set weights to be k index source in pre-synaptic layer\n   \/\/\n   status = set_weights_to_source_index(c1);\n   status = set_weights_to_source_index(c2);\n\n   postWeights = c1->convertPreSynapticWeights(0.0f);\n   status = check_weights(c1, postWeights);\n   if (status) return status;\n\n   postWeights = c2->convertPreSynapticWeights(0.0f);\n\n   ConnectionProbe * cp = new ConnectionProbe(-1, -2, 0);\n   c2->insertProbe(cp);\n\n   PostConnProbe * pcp = new PostConnProbe(125);\n   pcp->setOutputIndices(true);\n   c2->insertProbe(pcp);\n\n   c2->outputState(0);\n\n   status = check_weights(c2, postWeights);\n   if (status) return status;\n\n   return status;\n}\n\nstatic int check_weights(HyPerConn * c, PVPatch ** postWeights)\n{\n   int status = 0;\n\n   const int nxPre = c->preSynapticLayer()->clayer->loc.nx;\n   const int nyPre = c->preSynapticLayer()->clayer->loc.ny;\n   const int nfPre = c->preSynapticLayer()->clayer->loc.nBands;\n\n   const int nPadPre = c->preSynapticLayer()->clayer->loc.nPad;\n\n   const int nx = c->postSynapticLayer()->clayer->loc.nx;\n   const int ny = c->postSynapticLayer()->clayer->loc.ny;\n   const int nf = c->postSynapticLayer()->clayer->loc.nBands;\n\n   const int numPatches = nx * ny * nf;\n\n   \/\/ assume (or at least use) only one arbor (set of weight patches)\n   for (int kPost = 0; kPost < numPatches; kPost++) {\n      int kxPre, kyPre, kfPre = 0;\n\n      const int kxPost = kxPos(kPost, nx, ny, nf);\n      const int kyPost = kyPos(kPost, nx, ny, nf);\n      const int kfPost = featureIndex(kPost, nx, ny, nf);\n\n      PVPatch * p = postWeights[kPost];\n\n      const int nxp = p->nx;\n      const int nyp = p->ny;\n      const int nfp = p->nf;\n\n      \/\/ these strides are from the extended pre-synaptic layer, not the patch\n      \/\/ NOTE: assumes nf from layer == nf from patch\n      \/\/\n      const int sx = nfPre;\n      const int sy = (nxPre + 2*nPadPre) * nfPre;\n      const int sf = p->sf;\n\n      pvdata_t * w = p->data;\n\n      c->preSynapticPatchHead(kxPost, kyPost, kfPost, &kxPre, &kyPre);\n\n      \/\/ convert to extended indices\n      \/\/\n      kxPre += nPadPre;\n      kyPre += nPadPre;\n\n      int kPreHead = kIndex(kxPre, kyPre, kfPre, nxPre+2*nPadPre, nyPre+2*nPadPre, nfPre);\n\n      \/\/ FIND OUT WHY THIS DOESN'T WORK\n      \/\/int kPreHead = kIndex(kxPre, kyPre, kfPre, nxPre, nyPre, nfPre);\n      \/\/kPreHead = kIndexExtended(kPreHead, nxPre, nyPre, nfPre, nPadPre);\n\n      \/\/ loop over patch indices (writing out layer indices)\n      \/\/\n      int kp = 0;\n      for (int f = 0; f < nfp; f++) {\n         for (int j = 0; j < nyp; j++) {\n            for (int i = 0; i < nxp; i++) {\n               int kPre = kPreHead + i*sx + j*sy + f*sf;\n\n               if (kPre != (int) w[kp++]) {\n                  status = -1;\n                  fprintf(stderr, \"ERROR: check_weights: kPost==%d kPre==%d kp==%d != w==%d\\n\",\n                          kPost, kPre, kp, (int) w[kp-1]);\n                  return status;\n               }\n            }\n         }\n      }\n\n   } \/\/ end loop over weight patches\n\n   return status;\n}\n\nstatic int set_weights_to_source_index(HyPerConn * c)\n{\n   int status = 0;\n   int arbor = 0;\n   short wPacked[2];\n\n   assert(sizeof(short) == 2);\n\n   const PVLayer * lPre  = c->preSynapticLayer()->clayer;\n   const PVLayer * lPost = c->postSynapticLayer()->clayer;\n\n   const int nxPre = c->preSynapticLayer()->clayer->loc.nx;\n   const int nyPre = c->preSynapticLayer()->clayer->loc.ny;\n   const int nfPre = c->preSynapticLayer()->clayer->loc.nBands;\n\n   const int nPadPre = c->preSynapticLayer()->clayer->loc.nPad;\n\n   const int nxPost = c->postSynapticLayer()->clayer->loc.nx;\n   const int nyPost = c->postSynapticLayer()->clayer->loc.ny;\n   const int nfPost = c->postSynapticLayer()->clayer->loc.nBands;\n\n   int numPatches = c->numWeightPatches(arbor);\n\n   \/\/ assume (or at least use) only one arbor (set of weight patches)\n   \/\/ k index is in extended space\n   for (int kPre = 0; kPre < numPatches; kPre++) {\n      PVPatch * p = c->getWeights(kPre, arbor);\n\n      const int nxp = p->nx;\n      const int nyp = p->ny;\n      const int nfp = p->nf;\n\n      const int sxp = p->sx;\n      const int syp = p->sy;\n      const int sfp = p->sf;\n\n      pvdata_t * w = p->data;\n\n      int kxPre = kxPos(kPre, nxPre+2*nPadPre, nyPre+2*nPadPre, nfPre);\n      int kyPre = kxPos(kPre, nxPre+2*nPadPre, nyPre+2*nPadPre, nfPre);\n\n      int kxPatchHead = zPatchHead(kxPre-nPadPre, nxp, lPre->xScale, lPost->xScale);\n      int kyPatchHead = zPatchHead(kyPre-nPadPre, nyp, lPre->xScale, lPost->xScale);\n\n      for (int y = 0; y < nyp; y++) {\n         for (int x = 0; x < nxp; x++) {\n            for (int f = 0; f < nfp; f++) {\n               int kxPost = kxPatchHead + x;\n               int kyPost = kyPatchHead + y;\n               int kPost = kIndex(kxPost, kyPost, f, nxPost, nyPost, nfPost);\n\n               wPacked[0] = kPre;\n               wPacked[1] = kPost;\n               \/\/w[x*sxp + y*syp + f*sfp] = * ((float *) wPacked);\n               w[x*sxp + y*syp + f*sfp] = kPre;\n            }\n         }\n      }\n\n   } \/\/ end loop over weight patches\n\n   return status;\n}\n<commit_msg>Improved test by adding both pre and post indices to patch weights.<commit_after>\/**\n * test_post_weights.cpp\n *\n *  Created on: Feb 4, 2010\n *      Author: Craig Rasmussen\n *\n * This file tests the conversion of pre-synaptic weight patches to post-synaptic\n * weight patches.\n *\n *\/\n\n#undef DEBUG_PRINT\n\n#include \"..\/src\/columns\/HyPerCol.hpp\"\n#include \"..\/src\/layers\/HyPerLayer.hpp\"\n#include \"..\/src\/connections\/HyPerConn.hpp\"\n#include \"..\/src\/layers\/Example.hpp\"\n#include \"..\/src\/io\/ConnectionProbe.hpp\"\n#include \"..\/src\/io\/PostConnProbe.hpp\"\n\nusing namespace PV;\n\nstatic int set_weights_to_source_index(HyPerConn * c);\nstatic int check_weights(HyPerConn * c, PVPatch ** postWeights);\n\nint main(int argc, char * argv[])\n{\n   PVPatch ** postWeights;\n\n   int status = 0;\n\n   HyPerCol  * hc = new HyPerCol(\"column\", argc, argv);\n   Example   * l1 = new Example(\"test_post_weights L1\", hc);\n   Example   * l2 = new Example(\"test_post_weights L2\", hc);\n   Example   * l3 = new Example(\"test_post_weights L3\", hc);\n   HyPerConn * c1 = new HyPerConn(\"test_post_weights L1 to L1\", hc, l1, l1, CHANNEL_EXC);\n   HyPerConn * c2 = new HyPerConn(\"test_post_weights L2 to L3\", hc, l2, l3, CHANNEL_EXC);\n\n   \/\/ set weights to be k index source in pre-synaptic layer\n   \/\/\n   status = set_weights_to_source_index(c1);\n   status = set_weights_to_source_index(c2);\n\n   postWeights = c1->convertPreSynapticWeights(0.0f);\n   status = check_weights(c1, postWeights);\n   if (status) return status;\n\n   postWeights = c2->convertPreSynapticWeights(0.0f);\n   status = check_weights(c2, postWeights);\n   if (status) return status;\n\n#ifdef DEBUG_PRING\n   ConnectionProbe * cp = new ConnectionProbe(-1, -2, 0);\n   c2->insertProbe(cp);\n\n   PostConnProbe * pcp = new PostConnProbe(0);\n   pcp->setOutputIndices(true);\n   c2->insertProbe(pcp);\n\n   c2->outputState(0);\n#endif\n\n   return status;\n}\n\nstatic int check_weights(HyPerConn * c, PVPatch ** postWeights)\n{\n   int status = 0;\n\n   const int nxPre = c->preSynapticLayer()->clayer->loc.nx;\n   const int nyPre = c->preSynapticLayer()->clayer->loc.ny;\n   const int nfPre = c->preSynapticLayer()->clayer->loc.nBands;\n\n   const int nPadPre = c->preSynapticLayer()->clayer->loc.nPad;\n\n   const int nx = c->postSynapticLayer()->clayer->loc.nx;\n   const int ny = c->postSynapticLayer()->clayer->loc.ny;\n   const int nf = c->postSynapticLayer()->clayer->loc.nBands;\n\n   const int numPatches = nx * ny * nf;\n\n   \/\/ assume (or at least use) only one arbor (set of weight patches)\n   for (int kPost = 0; kPost < numPatches; kPost++) {\n      int kxPre, kyPre, kfPre = 0;\n\n      const int kxPost = kxPos(kPost, nx, ny, nf);\n      const int kyPost = kyPos(kPost, nx, ny, nf);\n      const int kfPost = featureIndex(kPost, nx, ny, nf);\n\n      PVPatch * p = postWeights[kPost];\n\n      const int nxp = p->nx;\n      const int nyp = p->ny;\n      const int nfp = p->nf;\n\n      \/\/ these strides are from the extended pre-synaptic layer, not the patch\n      \/\/ NOTE: assumes nf from layer == nf from patch\n      \/\/\n      const int sx = nfPre;\n      const int sy = (nxPre + 2*nPadPre) * nfPre;\n      const int sf = p->sf;\n\n      pvdata_t * w = p->data;\n\n      c->preSynapticPatchHead(kxPost, kyPost, kfPost, &kxPre, &kyPre);\n\n      \/\/ convert to extended indices\n      \/\/\n      kxPre += nPadPre;\n      kyPre += nPadPre;\n\n      int kPreHead = kIndex(kxPre, kyPre, kfPre, nxPre+2*nPadPre, nyPre+2*nPadPre, nfPre);\n\n      \/\/ FIND OUT WHY THIS DOESN'T WORK\n      \/\/int kPreHead = kIndex(kxPre, kyPre, kfPre, nxPre, nyPre, nfPre);\n      \/\/kPreHead = kIndexExtended(kPreHead, nxPre, nyPre, nfPre, nPadPre);\n\n      \/\/ loop over patch indices (writing out layer indices)\n      \/\/\n      int kp = 0;\n      for (int f = 0; f < nfp; f++) {\n         for (int j = 0; j < nyp; j++) {\n            for (int i = 0; i < nxp; i++) {\n               short * ws;\n               int kPre = kPreHead + i*sx + j*sy + f*sf;\n\n               ws = (short *) &w[kp++];\n\n               if (kPre != (int) ws[0] || kPost != (int) ws[1]) {\n                  status = -1;\n                  fprintf(stderr, \"ERROR: check_weights: kPost==%d kPre==%d kp==%d != w==%d\\n\",\n                          kPost, kPre, kp, (int) w[kp-1]);\n                  return status;\n               }\n            }\n         }\n      }\n\n   } \/\/ end loop over weight patches\n\n   return status;\n}\n\nstatic int set_weights_to_source_index(HyPerConn * c)\n{\n   int status = 0;\n   int arbor = 0;\n   short wPacked[2];\n\n   assert(sizeof(short) == 2);\n\n   const PVLayer * lPost = c->postSynapticLayer()->clayer;\n\n   const int nxPost = lPost->loc.nx;\n   const int nyPost = lPost->loc.ny;\n   const int nfPost = lPost->loc.nBands;\n\n   int numPatches = c->numWeightPatches(arbor);\n\n   \/\/ assume (or at least use) only one arbor (set of weight patches)\n   \/\/ k index is in extended space\n   for (int kPre = 0; kPre < numPatches; kPre++) {\n      int kxPostHead, kyPostHead, kfPostHead;\n      int nxp, nyp;\n      int dx, dy;\n      PVPatch * p = c->getWeights(kPre, arbor);\n\n      c->postSynapticPatchHead(kPre, &kxPostHead, &kyPostHead, &kfPostHead, &dx, &dy, &nxp, &nyp);\n\n      const int nfp = p->nf;\n\n      assert(nxp == p->nx);\n      assert(nyp == p->ny);\n      assert(nfp == lPost->numFeatures);\n\n      const int sxp = p->sx;\n      const int syp = p->sy;\n      const int sfp = p->sf;\n\n      pvdata_t * w = p->data;\n\n      for (int y = 0; y < nyp; y++) {\n         for (int x = 0; x < nxp; x++) {\n            for (int f = 0; f < nfp; f++) {\n               int kxPost = kxPostHead + x;\n               int kyPost = kyPostHead + y;\n               int kfPost = kfPostHead + f;\n               int kPost = kIndex(kxPost, kyPost, kfPost, nxPost, nyPost, nfPost);\n\n               wPacked[0] = kPre;\n               wPacked[1] = kPost;\n               w[x*sxp + y*syp + f*sfp] = * ((float *) wPacked);\n               \/\/w[x*sxp + y*syp + f*sfp] = kPre;\n            }\n         }\n      }\n\n   } \/\/ end loop over weight patches\n\n   return status;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  solarsystem.cpp\n *  SolarSystem\n *\n *  Created by Jadzia on 1\/1\/09.\n *  Copyright 2009 Rachel Reddick. All rights reserved.\n *\n *\/\n\n#include \"solarsystem.h\"\n#include \"orbital.h\"\n#include \"parameter_readin.h\"\n\nint main(int argc, char **argv) {\n    \/\/Time to figure out the input arguments\n    if(argc < 2) {\n        cout << \"ERROR: Insufficient number of arguments\" << endl;\n        cout << \"FORMAT: \" << endl;\n        exit(1);\n    }\n    \n    int myarg = 0;\n    \/\/Arguments needed:\n    \/\/Input file name\n    string filename = argv[1];\n    \n    \/\/Type of position input -- X, Y, Z, or orbital elements?\n    \/\/Default X, Y, Z\n    \n    \/\/Size of timestep (in seconds)\n    \/\/Default 1 hour\n\n    \/\/Total desired runtime\n    \/\/Default is 3 Earth-years\n    \n    \/\/How often to output positions\n    \/\/Default is every time step\n\n    \/\/Read the input file\n    vector<valarray<long double> > positions;\n    vector<string> names;\n    positions = ReadParameterFile(filename, 0, names);\n    \n    \/\/Initialize the solar system\n    \/\/Note that this includes setting the timestep\n    SolarSystem system;\n    long double dt = 3600.;\n    system.Initialize(dt, \"\");\n    \n    \/\/Add the Sun as a planet\n    valarray<long double> solar_position(6);\n    solar_position[0] = 0.; solar_position[1] = 0.; solar_position[2] = 0.;\n    solar_position[3] = 0.; solar_position[4] = -0.0894690; solar_position[5] = 0.;\n    system.AddPlanet(1.9891e30, 6.96e8, solar_position, 0., \"TheSun\");\n    \n    \/\/Add the Earth as a planet\n    valarray<long double> initial(6);\n    long double eccEarth = 0.01671;\n    long double semimajorEarth = 1.49498e11; \/\/m\n    long double semiminorEarth = semimajorEarth*sqrt(1-eccEarth*eccEarth); \/\/m\n    long double incEarth = 1.+34\/60. ; \/\/degrees\n    long double ascNodeEarth = 348.74; \/\/degrees\n    long double argPeriEarth = 114.21; \/\/degrees\n    long double startAngle = 0;\n    \/\/initial conditions set to ascending node\n    initial = orbitalElementConverter(semimajorEarth,semiminorEarth,incEarth,ascNodeEarth,argPeriEarth,startAngle);\n    system.AddPlanet(5.972e24, 6.371e6, initial, 0., \"TheEarth\");\n\n    cout<<initial[0]<<\" \"<<initial[1]<<\" \"<<initial[2]<<\" \"<<initial[3]<<\" \"<<initial[4]<<\" \"<<initial[5]<<endl;\n    cout<<\"Radius: \"<<sqrt(initial[0]*initial[0]+initial[1]*initial[1])<<endl;\n    cout<<\"Velocity: \"<<sqrt(initial[3]*initial[3]+initial[4]*initial[4])<<endl;\n    cout<<incEarth*M_PI\/180<<endl;\n    \n    \/\/Add Jupiter as a planet\n    initial = orbitalElementConverter(7.785e11, 7.785e11*sqrt(1-0.0488*0.0488), 1.305, 100.492, 275.066, 0);\n    system.AddPlanet(1.899e27, 7.15e7, initial, 0, \"Jupiter\");\n\n    \/\/Recenter our system on the center of mass\n    system.MoveToCenterOfMass();\n    \n    \/\/Run everything!\n    cout << \"Ready to run!\" << endl;\n    system.PrintPlanets();\n    RunTheSystem(system, 10*365.24*24.*3600.);\n    \/\/RunTheSystem(system, 50*3600.);\n\nreturn(0);\n}\n<commit_msg>Updated now so that the input parameter file for the set of objects is actually used to initialize the planets<commit_after>\/*\n *  solarsystem.cpp\n *  SolarSystem\n *\n *  Created by Jadzia on 1\/1\/09.\n *  Copyright 2009 Rachel Reddick. All rights reserved.\n *\n *\/\n\n#include \"solarsystem.h\"\n#include \"orbital.h\"\n#include \"parameter_readin.h\"\n\nint main(int argc, char **argv) {\n    \/\/Time to figure out the input arguments\n    if(argc < 2) {\n        cout << \"ERROR: Insufficient number of arguments\" << endl;\n        cout << \"FORMAT: \" << endl;\n        exit(1);\n    }\n    \n    int myarg = 0;\n    int filetype = 0;\n    \/\/Arguments needed:\n    \/\/Input file name\n    string filename = argv[1];\n    \n    \/\/Type of position input -- X, Y, Z, or orbital elements?\n    \/\/Default X, Y, Z\n    \n    \/\/Size of timestep (in seconds)\n    \/\/Default 1 hour\n\n    \/\/Total desired runtime\n    \/\/Default is 3 Earth-years\n    \n    \/\/How often to output positions\n    \/\/Default is every time step\n    filetype = 0;\n    \n    \/\/Where to place the output files\n    \/\/Default is current working directory\n    string output_directory = \"\";\n\n    \/\/Read the input file\n    vector<valarray<long double> > positions;\n    vector<string> names;\n    cout << \"Ready for readin\" << endl;\n    positions = ReadParameterFile(filename, filetype, names);\n    cout << \"Readin complete\" << endl;\n    \n    \/\/Initialize the solar system\n    \/\/Note that this includes setting the timestep\n    SolarSystem system;\n    long double dt = 3600.;\n    system.Initialize(dt, output_directory);\n\n    \/\/Add all the desired input objects\n    valarray<long double> xtemp(6);\n    for(int i=0; i<positions.size(); i++) {\n        for(int j=0; j<6; j++){\n            xtemp[j] = positions[i][j+2];\n        }\n        system.AddPlanet(positions[i][0], positions[i][1], xtemp, 0, names[i]);\n    }\n    cout << \"Done initializing \" << positions.size() << \" objects\" << endl;\n\n    \/\/Recenter our system on the center of mass\n    system.MoveToCenterOfMass();\n    \n    \/\/Run everything!\n    cout << \"Ready to run!\" << endl;\n    system.PrintPlanets();\n    RunTheSystem(system, 10*365.24*24.*3600.);\n    \/\/RunTheSystem(system, 50*3600.);\n\nreturn(0);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Boid.h\"\n\nvoid Boid::seek(sf::Vector2f& target) {\n\tauto desired = target - location;\n\tdesired = maxSpeed * norm(desired);\n\tauto steer = desired - velocity;\n\tif (mag(steer) > maxForce) {\n\t\tsteer = norm(steer) * coheseCoef * maxForce;\n\t}\n\tapplyForce(steer);\n};\n\n\nvoid Boid::separate(const std::vector<Boid>& v_vec) {\n\tauto averageRepulsVec = sf::Vector2f{ 0,0 };\n\tint cntr = 0;\n\tfor (auto veh : v_vec) {\n\t\tauto d = mag(location - veh.getLocation());\n\n\t\tif (d > 0 && d < desiredSeparation) {\n\t\t\taverageRepulsVec += norm(location - veh.getLocation()) \/ d;\n\t\t\t++cntr;\n\t\t}\n\n\t}\n\tif (cntr > 0) {\n\t\taverageRepulsVec = maxSpeed * norm(averageRepulsVec) \/ cntr;\n\t\tauto steer = averageRepulsVec - velocity;\n\t\tif (mag(steer) > maxForce)\n\t\t\tsteer = norm(steer) *separateCoef* maxForce;\n\t\tapplyForce(steer);\n\t}\n\n}\n\n\nvoid Boid::align(const std::vector<Boid>& v_vec) {\n\tauto averageAlignVec = sf::Vector2f{ 0,0 };\n\tint cntr = 0;\n\tfor (auto veh : v_vec) {\n\t\tauto d = mag(location - veh.getLocation());\n\n\t\tif (d > 0 && d < visionRadius) {\n\t\t\taverageAlignVec += veh.getVelocity();\n\t\t\t++cntr;\n\t\t}\n\n\t}\n\tif (cntr > 0) {\n\t\taverageAlignVec = maxSpeed * norm(averageAlignVec) \/ cntr;\n\t\tauto steer = averageAlignVec - velocity;\n\t\tif (mag(steer) > maxForce)\n\t\t\tsteer = norm(steer) * alignCoef * maxForce;\n\t\tapplyForce(steer);\n\t}\n}\n\n\nvoid Boid::cohese(const std::vector<Boid>& v_vec) {\n\tauto averageCoheseVec = sf::Vector2f{ 0,0 };\n\tint cntr = 0;\n\tfor (auto veh : v_vec) {\n\t\tauto d = mag(location - veh.getLocation());\n\n\t\tif (d > 0 && d < visionRadius) {\n\t\t\taverageCoheseVec += veh.getLocation();\n\t\t\t++cntr;\n\t\t}\n\n\t}\n\tif (cntr > 0) {\n\t\taverageCoheseVec = averageCoheseVec \/ cntr;\n\t\tseek(averageCoheseVec);\n\t}\n}\n\n\nvoid Boid::swarm(const std::vector<Boid>& v_vec) {\n\tauto averageRepulsVec = sf::Vector2f{ 0,0 };\n\tauto averageAlignVec  = averageRepulsVec;\n\tauto averageCoheseVec = averageRepulsVec;\n\n\tint cntrRepuls = 0;\n\tint cntrAC = 0;\n\n\tfor (auto& veh : v_vec) {\n\t\tauto otherVec = veh.getLocation();\n\t\tauto d = mag(location - otherVec);\n\n\t\tif (d > 0 && d < visionRadius) {\n\t\t\taverageAlignVec  += veh.getVelocity();\n\t\t\taverageCoheseVec += otherVec;\n\t\t\t++cntrAC;\n\t\t\tif (d > 0 && d < desiredSeparation) {\n\t\t\t\taverageRepulsVec += norm(location - otherVec) \/ d;\n\t\t\t\t++cntrRepuls;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (cntrRepuls > 0) {\n\t\taverageRepulsVec = maxSpeed * norm(averageRepulsVec) \/ cntrRepuls;\n\t\tauto steer = averageRepulsVec - velocity;\n\t\tif (mag(steer) > maxForce)\n\t\t\tsteer = norm(steer) *separateCoef* maxForce;\n\t\tapplyForce(steer);\n\t}\n\n\tif (cntrAC > 0) {\n\t\taverageAlignVec = maxSpeed * norm(averageAlignVec) \/ cntrAC;\n\t\tauto steer = averageAlignVec - velocity;\n\t\tif (mag(steer) > maxForce)\n\t\t\tsteer = norm(steer) * alignCoef * maxForce;\n\t\tapplyForce(steer);\n\t\t\n\t\taverageCoheseVec = averageCoheseVec \/ cntrAC;\n\t\tseek(averageCoheseVec);\n\t}\n}\n\n\nvoid Boid::ignoreEdges(const sf::RenderWindow& window) {\n\tint win_x = window.getSize().x;\n\tint win_y = window.getSize().y;\n\tint diameter = 2 * getRadius();\n\n\tif (location.x > win_x) {\n\t\tlocation.x = 0;\n\t}\n\telse if (location.x < 0) {\n\t\tlocation.x = win_x;\n\t}\n\n\tif (location.y > win_y) {\n\t\tlocation.y = 0;\n\t}\n\telse if (location.y < 0) {\n\t\tlocation.y = win_y ;\n\t}\n}\n\n\nvoid Boid::checkEdges(const sf::RenderWindow& window) {\n\tint win_x = window.getSize().x;\n\tint win_y = window.getSize().y;\n\tint diameter = 2 * getRadius();\n\n\tif (location.x >= win_x - diameter) {\n\t\tvelocity.x *= -1;\n\t\tlocation.x = win_x - diameter;\n\t}\n\telse if (location.x <= 0) {\n\t\tvelocity.x *= -1;\n\t\tlocation.x = 0;\n\t}\n\n\tif (location.y >= win_y - diameter) {\n\t\tvelocity.y *= -1;\n\t\tlocation.y = win_y - diameter;\n\t}\n\telse if (location.y <= 0) {\n\t\tvelocity.y *= -1;\n\t\tlocation.y = 0;\n\t}\n}\n\n\nvoid Boid::update(const sf::RenderWindow& window) {\n\tvelocity += acceleration;\n\tlimit(maxSpeed);\n\tlocation += velocity;\n\tignoreEdges(window);\n\tshape.setPosition(location);\n\tacceleration = sf::Vector2f(0, 0);\n}\n\n\nvoid Boid::draw(sf::RenderWindow& window) {\n\twindow.draw(shape);\n}\n  \n<commit_msg>Update Boid.cpp<commit_after>#include \"Boid.h\"\n\n\nvoid Boid::seek(sf::Vector2f& target) {\n\tauto desired = target - location;\n\tdesired = boid_params.maxSpeed * norm(desired);\n\tauto steer = desired - velocity;\n\tif (mag(steer) > boid_params.maxForce) {\n\t\tsteer = norm(steer) * boid_params.coheseCoef * boid_params.maxForce;\n\t}\n\tapplyForce(steer);\n};\n\nvoid Boid::swarm(const std::vector<Boid>& v_vec) {\n\tauto averageRepulsVec = sf::Vector2f{ 0,0 };\n\tauto averageAlignVec  = averageRepulsVec;\n\tauto averageCoheseVec = averageRepulsVec;\n\n\tint cntrRepuls = 0;\n\tint cntrAC = 0;\n\n\tfor (auto& veh : v_vec) {\n\t\tauto otherVec = veh.getLocation();\n\t\tauto d = mag(location - otherVec);\n\n\t\tif (d > 0 && d < boid_params.visionRadius) {\n\t\t\taverageAlignVec  += veh.getVelocity();\n\t\t\taverageCoheseVec += otherVec;\n\t\t\t++cntrAC;\n\t\t\tif (d > 0 && d < boid_params.desiredSeparation) {\n\t\t\t\taverageRepulsVec += norm(location - otherVec) \/ d;\n\t\t\t\t++cntrRepuls;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (cntrRepuls > 0) {\n\t\taverageRepulsVec = boid_params.maxSpeed * norm(averageRepulsVec) \/ cntrRepuls;\n\t\tauto steer = averageRepulsVec - velocity;\n\t\tif (mag(steer) > boid_params.maxForce)\n\t\t\tsteer = norm(steer) *boid_params.separateCoef* boid_params.maxForce;\n\t\tapplyForce(steer);\n\t}\n\n\tif (cntrAC > 0) {\n\t\taverageAlignVec = boid_params.maxSpeed * norm(averageAlignVec) \/ cntrAC;\n\t\tauto steer = averageAlignVec - velocity;\n\t\tif (mag(steer) > boid_params.maxForce)\n\t\t\tsteer = norm(steer) * boid_params.alignCoef * boid_params.maxForce;\n\t\tapplyForce(steer);\n\t\t\n\t\taverageCoheseVec = averageCoheseVec \/ cntrAC;\n\t\tseek(averageCoheseVec);\n\t}\n}\n\n\nvoid parallel_swarm(const std::vector<Boid*>& v_ptr,\n\tconst std::vector<Boid*>::iterator& start,\n\tconst std::vector<Boid*>::iterator& end)\n{\n\t\/\/ check if ( v_boids().empty() ) ?\n\tauto& boid_params = v_ptr[0]->getBoidParams();\n\t\n\tfor (auto ptr = start; ptr != end; ++ptr){\n\t\t\n\t\tauto averageRepulsVec = sf::Vector2f{ 0,0 };\n\t\tauto averageAlignVec = averageRepulsVec;\n\t\tauto averageCoheseVec = averageRepulsVec;\n\n\t\tint cntrRepuls = 0;\n\t\tint cntrAC = 0;\n\n\t\tauto& curr_boid = **ptr; \/\/ hmm\n\n\t\tfor (auto& boid : v_ptr) {\n\t\t\tauto d = mag(curr_boid.getLocation() - boid->getLocation());\n\n\t\t\tif (d > 0 && d < boid_params.visionRadius) {\n\t\t\t\taverageAlignVec += boid->getVelocity();\n\t\t\t\taverageCoheseVec += boid->getLocation();\n\t\t\t\t++cntrAC;\n\n\t\t\t\tif (d < boid_params.desiredSeparation) {\n\t\t\t\t\taverageRepulsVec += norm(curr_boid.getLocation() - boid->getLocation()) \/ d;\n\t\t\t\t\t++cntrRepuls;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tif (cntrRepuls > 0) {\n\t\t\taverageRepulsVec = boid_params.maxSpeed * norm(averageRepulsVec) \/ cntrRepuls;\n\t\t\tauto steer = averageRepulsVec - curr_boid.getVelocity();\n\t\t\tif (mag(steer) > boid_params.maxForce)\n\t\t\t\tsteer = norm(steer) * boid_params.separateCoef * boid_params.maxForce;\n\t\t\tcurr_boid.applyForce(steer);\n\t\t}\n\n\t\tif (cntrAC > 0) {\n\t\t\taverageAlignVec = boid_params.maxSpeed * norm(averageAlignVec) \/ cntrAC;\n\t\t\tauto steer = averageAlignVec - curr_boid.getVelocity();\n\t\t\tif (mag(steer) > boid_params.maxForce)\n\t\t\t\tsteer = norm(steer) * boid_params.alignCoef * boid_params.maxForce;\n\t\t\tcurr_boid.applyForce(steer);\n\n\t\t\taverageCoheseVec = averageCoheseVec \/ cntrAC;\n\t\t\tcurr_boid.seek(averageCoheseVec);\n\t\t}\n\t}\n\n}\n\n\nvoid Boid::ignoreEdges(const sf::RenderWindow& window) {\n\tint win_x = window.getSize().x;\n\tint win_y = window.getSize().y;\n\tint diameter = 2 * getRadius();\n\n\tif (location.x > win_x) {\n\t\tlocation.x = 0;\n\t}\n\telse if (location.x < 0) {\n\t\tlocation.x = win_x;\n\t}\n\n\tif (location.y > win_y) {\n\t\tlocation.y = 0;\n\t}\n\telse if (location.y < 0) {\n\t\tlocation.y = win_y ;\n\t}\n}\n\n\nvoid Boid::checkEdges(const sf::RenderWindow& window) {\n\tint win_x = window.getSize().x;\n\tint win_y = window.getSize().y;\n\tint diameter = 2 * getRadius();\n\n\tif (location.x >= win_x - diameter) {\n\t\tvelocity.x *= -1;\n\t\tlocation.x = win_x - diameter;\n\t}\n\telse if (location.x <= 0) {\n\t\tvelocity.x *= -1;\n\t\tlocation.x = 0;\n\t}\n\n\tif (location.y >= win_y - diameter) {\n\t\tvelocity.y *= -1;\n\t\tlocation.y = win_y - diameter;\n\t}\n\telse if (location.y <= 0) {\n\t\tvelocity.y *= -1;\n\t\tlocation.y = 0;\n\t}\n}\n\n\nvoid Boid::update(const sf::RenderWindow& window) {\n\tvelocity += acceleration;\n\tlimit(boid_params.maxSpeed);\n\tlocation += velocity;\n\tignoreEdges(window);\n\tshape.setPosition(location);\n\tacceleration = sf::Vector2f(0, 0);\n}\n\n\nvoid Boid::draw(sf::RenderWindow& window) {\n\twindow.draw(shape);\n}\n  \n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ Book.cpp\n\/\/\/ Manages the eBook.\n\/\/\/\n\n#include <cmath>\n#include <numeric>\n#include <fstream>\n#include <iostream>\n#include <algorithm>\n\n#include \"pp2d\/pp2d.h\"\n#include \"tinyxml2\/tinyxml2.h\"\n\n#include \"Book.hpp\"\n\nusing namespace tinyxml2;\n\nvoid shortenString(std::vector<std::string>& vec, std::string str)\n{\n\tif (str.size() > 715)\n\t{\n\t\tstd::string final = str.substr(0, 715);\n\t\tvec.push_back(final);\n\n\t\tstd::string rest = str.substr(716, str.size());\n\t\tshortenString(vec, final);\n\t}\n\telse\n\t{\n\t\tvec.push_back(str);\n\t}\n}\n\nBook::Book(const std::string& epub)\n{\n    m_book = \"sdmc:\/books\/\" + epub;\n    BLUnZip zip(m_book);\n    \n    parseContainer(zip);\n    parseOPF(zip);\n    parsePages(zip);\n\n    zip.Close();\n}\n\nBook::~Book()\n{\n    m_manifest.clear();\n    m_spine.clear();\n    m_text.clear();\n\n    m_book = \"\";\n    m_opf = \"\";\n    m_title = \"\";\n    m_author = \"\";\n    m_container = \"\";\n}\n\nvoid Book::parseContainer(BLUnZip& zip)\n{\n    std::string data = zip.ExtractToString(\"META-INF\/container.xml\");\n\n    XMLDocument doc;\n    doc.Parse(data.c_str());\n\n    XMLElement* container = doc.FirstChildElement(\"container\");\n    XMLElement* rootfiles = container->FirstChildElement(\"rootfiles\");\n    XMLElement* rootfile = rootfiles->FirstChildElement(\"rootfile\");\n\n    m_opf = rootfile->Attribute(\"full-path\");\n\n    auto pos = m_opf.find(\"content.opf\");\n    if (pos == 0)\n    {\n        m_container = \"\";\n    }\n    else\n    {\n        m_container = m_opf.substr(0, pos);\n    }\n}\n\nvoid Book::parseOPF(BLUnZip& zip)\n{\n    std::string data = zip.ExtractToString(m_opf);\n    \n    XMLDocument doc;\n    doc.Parse(data.c_str());\n\n    XMLElement* package = doc.FirstChildElement(\"package\");\n    XMLElement* metadata = package->FirstChildElement(\"metadata\");\n    XMLElement* manifest = package->FirstChildElement(\"manifest\");\n    XMLElement* item = manifest->FirstChildElement(\"item\");\n\n    m_title = metadata->FirstChildElement(\"dc:title\")->GetText();\n    m_author = metadata->FirstChildElement(\"dc:creator\")->GetText();\n\n    for(XMLElement* rfe = item; rfe != nullptr; rfe = rfe->NextSiblingElement(\"item\"))\n    {\n       m_manifest.emplace(rfe->Attribute(\"id\"), rfe->Attribute(\"href\"));\n    }\n\n    XMLElement* spine = package->FirstChildElement(\"spine\");\n    XMLElement* itemref = spine->FirstChildElement(\"itemref\");\n\n    for (XMLElement* it = itemref; it != nullptr; it = it->NextSiblingElement(\"itemref\"))\n    {\n        m_spine.push_back(it->Attribute(\"idref\"));\n    }\n}\n\nvoid Book::parsePages(BLUnZip& zip)\n{\n    for (size_t i = 0; i < m_spine.size(); ++i)\n    {\n        std::string data = zip.ExtractToString(m_container + m_manifest[m_spine[i]]);\n\n        XMLDocument doc;\n        doc.Parse(data.c_str());\n\n        XMLElement* html = doc.FirstChildElement(\"html\");\n    \tXMLElement* body = html->FirstChildElement(\"body\");\n        \n        for (XMLElement* next = body->FirstChildElement(); next != nullptr; next = next->NextSiblingElement())\n        {\n        \tif (next)\n        \t{\n        \t\tconst char* textStr = next->GetText();\n            \tif (textStr)\n            \t{\n            \t\tshortenString(m_text, textStr);\n            \t}\n        \t}\n        }\n    }\n}\n\nconst std::vector<std::string>& Book::getBookText() const\n{\n    return m_text;\n}<commit_msg>Book.cpp: fix shortenString<commit_after>\/\/\/\n\/\/\/ Book.cpp\n\/\/\/ Manages the eBook.\n\/\/\/\n\n#include <cmath>\n#include <numeric>\n#include <fstream>\n#include <iostream>\n#include <algorithm>\n\n#include \"pp2d\/pp2d.h\"\n#include \"tinyxml2\/tinyxml2.h\"\n\n#include \"Book.hpp\"\n\nusing namespace tinyxml2;\n\nstatic void shortenString(std::vector<std::string>& vec, std::string& str)\n{\n\tif (str.size() > 715)\n\t{\n\t\tstd::string&& chunk = str.substr(0, 715);\n\t\tvec.push_back(chunk);\n\n\t\tstr.erase(0, 715);\n\t\tshortenString(vec, str);\n\t}\n\telse\n\t{\n\t\tvec.push_back(str);\n\t}\n}\n\nBook::Book(const std::string& epub)\n{\n    m_book = \"sdmc:\/books\/\" + epub;\n    BLUnZip zip(m_book);\n    \n    parseContainer(zip);\n    parseOPF(zip);\n    parsePages(zip);\n\n    zip.Close();\n}\n\nBook::~Book()\n{\n    m_manifest.clear();\n    m_spine.clear();\n    m_text.clear();\n\n    m_book = \"\";\n    m_opf = \"\";\n    m_title = \"\";\n    m_author = \"\";\n    m_container = \"\";\n}\n\nvoid Book::parseContainer(BLUnZip& zip)\n{\n    std::string data = zip.ExtractToString(\"META-INF\/container.xml\");\n\n    XMLDocument doc;\n    doc.Parse(data.c_str());\n\n    XMLElement* container = doc.FirstChildElement(\"container\");\n    XMLElement* rootfiles = container->FirstChildElement(\"rootfiles\");\n    XMLElement* rootfile = rootfiles->FirstChildElement(\"rootfile\");\n\n    m_opf = rootfile->Attribute(\"full-path\");\n\n    auto pos = m_opf.find(\"content.opf\");\n    if (pos == 0)\n    {\n        m_container = \"\";\n    }\n    else\n    {\n        m_container = m_opf.substr(0, pos);\n    }\n}\n\nvoid Book::parseOPF(BLUnZip& zip)\n{\n    std::string data = zip.ExtractToString(m_opf);\n    \n    XMLDocument doc;\n    doc.Parse(data.c_str());\n\n    XMLElement* package = doc.FirstChildElement(\"package\");\n    XMLElement* metadata = package->FirstChildElement(\"metadata\");\n    XMLElement* manifest = package->FirstChildElement(\"manifest\");\n    XMLElement* item = manifest->FirstChildElement(\"item\");\n\n    m_title = metadata->FirstChildElement(\"dc:title\")->GetText();\n    m_author = metadata->FirstChildElement(\"dc:creator\")->GetText();\n\n    for(XMLElement* rfe = item; rfe != nullptr; rfe = rfe->NextSiblingElement(\"item\"))\n    {\n       m_manifest.emplace(rfe->Attribute(\"id\"), rfe->Attribute(\"href\"));\n    }\n\n    XMLElement* spine = package->FirstChildElement(\"spine\");\n    XMLElement* itemref = spine->FirstChildElement(\"itemref\");\n\n    for (XMLElement* it = itemref; it != nullptr; it = it->NextSiblingElement(\"itemref\"))\n    {\n        m_spine.push_back(it->Attribute(\"idref\"));\n    }\n}\n\nvoid Book::parsePages(BLUnZip& zip)\n{\n    for (size_t i = 0; i < m_spine.size(); ++i)\n    {\n        std::string data = zip.ExtractToString(m_container + m_manifest[m_spine[i]]);\n\n        XMLDocument doc;\n        doc.Parse(data.c_str());\n\n        XMLElement* html = doc.FirstChildElement(\"html\");\n    \tXMLElement* body = html->FirstChildElement(\"body\");\n        \n        for (XMLElement* next = body->FirstChildElement(); next != nullptr; next = next->NextSiblingElement())\n        {\n        \tif (next)\n        \t{\n        \t\tconst char* textStr = next->GetText();\n\t\t\tif (textStr)\n\t\t\t{\n\t\t\t\tstd::string str(textStr);\n\t\t\t\tshortenString(m_text, str);\n\t\t\t}\n        \t}\n        }\n    }\n}\n\nconst std::vector<std::string>& Book::getBookText() const\n{\n    return m_text;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n#include <iostream>\n\n#include \"grid.hpp\"\n#include \"observers.hpp\"\n#include \"model.hpp\"\n#include \"photons.hpp\"\n\ndouble FlaredDisk::density(double x, double y, double z) const\n{\n    double const r2 = x*x + y*y;\n    double const r  = std::sqrt(r2);\n\n    \/\/ Disk Geometry\n    if(( r >= rInner_ ) && ( r <= rOuter_ ))\n    {\n        double const h = h0_ * std::pow(r\/r0_, beta_);\n        return rho0_ * std::pow(r0_ \/ r, alpha_) * std::exp(-0.5*z*z \/ (h*h)); \/\/ rho in g\/cm^3\n    } else {\n        return 0.0;\n    }\n}\n\n\nGrid::Grid(\n        double const xmax,\n        double const ymax,\n        double const zmax,\n        double const kappa,\n        uint32_t const nx,\n        uint32_t const ny,\n        uint32_t const nz,\n        FlaredDiskCPtr disk)\n    : nx_{ nx }\n    , ny_{ ny }\n    , nz_{ nz }\n    , xmax_{ xmax }\n    , ymax_{ ymax }\n    , zmax_{ zmax }\n    , disk_{ std::move(disk) }\n{\n    rhokappa_ = new double[nx_ * ny_ * nz_];\n    minrho_ = 1e+38;\n\n    for (size_t cntx=0; cntx!=nx_; ++cntx)\n    {\n        double const x = (cntx*2.0+1) * xmax_\/nx_ - xmax_;\n        for (size_t cnty=0; cnty!=ny_; ++cnty)\n        {\n            double const y=(cnty*2.0+1) * ymax_\/ny_ - ymax_;\n            for (size_t cntz=0; cntz!=nz_; ++cntz)\n            {\n                double const z=(cntz*2.0+1) * zmax_\/nz_ - zmax_;\n                size_t const idx = cntx+cnty*nx+cntz*ny*nx;\n                rhokappa_[idx] = disk_->density(x, y, z) * kappa * 1.5e13; \/\/ rho*kappa*R,\n                if (minrho_ > rhokappa_[idx] && rhokappa_[idx] > 0)\n                    minrho_ = rhokappa_[idx];\n            }\n        }\n    }\n}\n\n\/\/ calculate smax -- maximum distance photon can travel *******\ndouble Grid::maxDistance(Photon const& ph) const\n{\t\n    double dsx=0.0, dsy=0.0, dsz=0.0, smax =0.0;\n    if(ph.dir().x() > 0.0) {\n        dsx = (xmax_ - ph.pos().x()) \/ ph.dir().x();\n    } else if(ph.dir().x() < 0.0) {\n        dsx =-(ph.pos().x() + xmax_) \/ ph.dir().x();\n    } else {\n        dsx = 200.0*xmax_;\n    }\n    if(ph.dir().y() > 0.0) {\n        dsy = (ymax_ - ph.pos().y()) \/ ph.dir().y();\n    } else if(ph.dir().y() < 0.0) {\n        dsy =-(ph.pos().y() + ymax_) \/ ph.dir().y();\n    } else {\n        dsy =200.0*ymax_;\n    }\n    if(ph.dir().z() > 0.0) {\n        dsz= (zmax_ - ph.pos().z()) \/ ph.dir().z();\n    } else if(ph.dir().z() < 0.0) {\n        dsz=-(ph.pos().z() + zmax_) \/ ph.dir().z();\n    } else {\n        dsz=200.0*zmax_;\n    }\n    smax = ( dsx < dsy) ? dsx  : dsy;\n    smax = (smax < dsz) ? smax : dsz;\n    return smax;\n}\n\n\/\/ find distance to next x, y, and z cell walls.  \n\/\/ note that dx is not the x-distance, but the actual distance along \n\/\/ the direction of travel to the next x-face, and likewise for dy and dz.\ndouble Grid::cellDistance(Photon& ph, double delta) const\n{\n    double dx=200.0*xmax_, dy=200.0*ymax_, dz=200.0*zmax_, dcell=0.0;\n    if (delta < 0.0) delta=0.0001*(2.*xmax_\/nx_);\n    double tmp = 2.0*xmax_\/nx_;\n    if(ph.dir().x() > 0.0)\n    {\n        dx = (( int( (ph.pos().x()+xmax_) \/ tmp ) + 1.0 )* tmp - xmax_ - ph.pos().x() )\/ph.dir().x();\n        if (dx < delta)\n        {\n            dx = tmp\/ph.dir().x();\n            ph.x() = (int( (ph.pos().x()+xmax_) \/ tmp ) + 1.0 )*tmp - xmax_ + delta;\n        }\n    } else if (ph.dir().x() < 0.0) {\n        dx = (( int( (ph.pos().x()+xmax_)\/ tmp ) )* tmp - xmax_ - ph.pos().x() )\/ph.dir().x();\n        if (dx < delta)\n        {\n            dx =-tmp\/ph.dir().x();\n            ph.x() = ( int( (ph.pos().x()+xmax_)\/tmp) )* tmp - xmax_ - delta;\n        }\n    }\n\n    tmp = 2.0*ymax_\/ny_;\n    if(ph.dir().y() > 0.0)\n    {\n        dy = (( int( (ph.pos().y()+ymax_)\/tmp ) + 1.0 )* tmp - ymax_ - ph.pos().y() )\/ph.dir().y();\n        if (dy < delta)\n        {\n            dy = tmp\/ph.dir().y();\n            ph.y() = (int( (ph.pos().y()+ymax_)\/tmp) + 1.0 )* tmp - ymax_+ delta;\n        }\n    } else if (ph.dir().y() < 0.0) {\n        dy = (( int( (ph.pos().y()+ymax_)\/tmp ) )*tmp - ymax_ - ph.pos().y() )\/ph.dir().y();\n        if (dy < delta)\n        {\n            dy =-tmp\/ph.dir().y();\n            ph.y() = ( int( (ph.pos().y()+xmax_)\/tmp ) )* tmp - ymax_ - delta;\n        }\n    }\n\n    tmp=2.0*zmax_\/nz_;\n    if(ph.dir().z() > 0.0)\n    {\n        dz = (( int( (ph.pos().z()+zmax_)\/tmp ) + 1.0 )* tmp - zmax_ - ph.pos().z() )\/ph.dir().z();\n        if (dz < delta)\n        {\n            dz = tmp\/ph.dir().z();\n            ph.z() = (int( (ph.pos().z()+zmax_)\/tmp ) + 1.0 )* tmp - zmax_ + delta;\n        }\n    } else if (ph.dir().z() < 0.0) {\n        dz = (( int( (ph.pos().z()+zmax_)\/tmp ))* tmp- zmax_ - ph.pos().z() )\/ph.dir().z();\n        if (dz < delta)\n        {\n            dz =-tmp\/ph.dir().z();\n            ph.z() = ( int( (ph.pos().z()+zmax_)\/tmp ) )* tmp - zmax_ - delta;\n        }\n    }\n\n    dcell = ( dx   < dy ) ? dx    : dy;\n    dcell = (dcell < dz ) ? dcell : dz;\n\/\/\tprintf(\"d %g %g %g \\n\", dx, dy, dz);\n    return dcell;\n}\n\ndouble Grid::findOpticalDepth( Photon ph, double delta ) const\n{\n    double taurun=0.0, d=0.0;\n\n    if (delta < 0.0 ) delta=0.0001*(2.*xmax_\/nx_);\n    double const smax = maxDistance(ph);\n\n    if(smax < delta)\n    {\n        return 0.0;\n    }\n\n    while (d < 0.999*smax)\n    {\n        double const dcell = cellDistance(ph, delta);\n        auto const x = uint32_t( (ph.pos().x()+xmax_)*nx_ \/ 2.0 \/ xmax_ );\n        auto const y = uint32_t( (ph.pos().y()+ymax_)*ny_ \/ 2.0 \/ ymax_ );\n        auto const z = uint32_t( (ph.pos().z()+zmax_)*nz_ \/ 2.0 \/ zmax_ );\n\n        taurun += dcell * rhokappa_[ x+y*nx_+z*ny_*nx_ ];\n        ph.Move(dcell);\n        d += dcell;\n    }\n\n    return taurun;\n}\n\nint Grid::movePhotonAtDepth( Photon & ph, double tau, double tauold, double delta ) const\n{\n    double taurun=tauold, d=0.0;\n\n    if (delta < 0.0 )\n    {\n        delta=0.0001*(2.*xmax_\/nx_);\n    }\n\n    double const smax = maxDistance(ph);\n\n    \/\/ integrate through grid\n    while (taurun < tau && d < (0.9999*smax))\n    {\n        double const dcell = cellDistance(ph, delta);\n        auto const x = uint32_t( (ph.pos().x()+xmax_)*nx_ \/ 2.0 \/ xmax_ );\n        auto const y = uint32_t( (ph.pos().y()+ymax_)*ny_ \/ 2.0 \/ ymax_ );\n        auto const z = uint32_t( (ph.pos().z()+zmax_)*nz_ \/ 2.0 \/ zmax_ );\n        double const taucell = dcell*rhokappa_[ x+y*nx_+z*ny_*nx_ ];\n\n        if(taurun + taucell >= tau)\n        {\n            double const d1 = (tau-taurun) \/ rhokappa_[ x+y*nx_+z*ny_*nx_ ];\n            d += d1;\n            ph.Move(d1);\n        } else {\n            d += dcell;\n            ph.Move(dcell);\n        }\n\n        taurun += taucell;\n    }\n\n    \/\/ calculate photon final position.  if it escapes envelope then\n    \/\/ set tflag=1.  if photon doesn't escape leave tflag=0 and update\n    \/\/ photon position.\n    return d >= 0.999 * smax;\n}\n\nint Grid::movePhotonAtRandomDepth( Photon &ph, double delta ) const\n{\n    double const tau = -std::log(ran.Get());\n    return movePhotonAtDepth(ph, tau, 0.0, delta);\n}\n\nvoid Grid::peeloff(Photon ph, Observer& observer, DustCRef dust) const\n{\n    double const hgfac = ph.Scatt(dust, Direction3d{observer.pos()});\n    double const tau = findOpticalDepth(ph);\n\n    if (tau == 0.0)\n    {\n        return;\n    }\n\n    ph.weight() *= hgfac * exp(-tau);\n    \/\/ Bin the photon into the image according to its position and direction of travel.\n    observer.Bin(ph);\n} \n<commit_msg>Simplify Grid::maxDistance method<commit_after>#include <algorithm>\n#include <cmath>\n#include <iostream>\n\n#include \"grid.hpp\"\n#include \"observers.hpp\"\n#include \"model.hpp\"\n#include \"photons.hpp\"\n\nnamespace\n{\n    inline double ds(double const pos, double const velocity, double const max)\n    {\n        if(velocity > 0.0)\n        {\n            return (max - pos) \/ velocity;\n        } else if(velocity < 0.0) {\n            return (pos + max) \/ velocity;\n        }\n        return 2.0 * max;\n    }\n}\n\ndouble FlaredDisk::density(double x, double y, double z) const\n{\n    double const r2 = x*x + y*y;\n    double const r  = std::sqrt(r2);\n\n    \/\/ Disk Geometry\n    if(( r >= rInner_ ) && ( r <= rOuter_ ))\n    {\n        double const h = h0_ * std::pow(r\/r0_, beta_);\n        return rho0_ * std::pow(r0_ \/ r, alpha_) * std::exp(-0.5*z*z \/ (h*h)); \/\/ rho in g\/cm^3\n    } else {\n        return 0.0;\n    }\n}\n\n\nGrid::Grid(\n        double const xmax,\n        double const ymax,\n        double const zmax,\n        double const kappa,\n        uint32_t const nx,\n        uint32_t const ny,\n        uint32_t const nz,\n        FlaredDiskCPtr disk)\n    : nx_{ nx }\n    , ny_{ ny }\n    , nz_{ nz }\n    , xmax_{ xmax }\n    , ymax_{ ymax }\n    , zmax_{ zmax }\n    , disk_{ std::move(disk) }\n{\n    rhokappa_ = new double[nx_ * ny_ * nz_];\n    minrho_ = 1e+38;\n\n    for (size_t cntx=0; cntx!=nx_; ++cntx)\n    {\n        double const x = (cntx*2.0+1) * xmax_\/nx_ - xmax_;\n        for (size_t cnty=0; cnty!=ny_; ++cnty)\n        {\n            double const y=(cnty*2.0+1) * ymax_\/ny_ - ymax_;\n            for (size_t cntz=0; cntz!=nz_; ++cntz)\n            {\n                double const z=(cntz*2.0+1) * zmax_\/nz_ - zmax_;\n                size_t const idx = cntx+cnty*nx+cntz*ny*nx;\n                rhokappa_[idx] = disk_->density(x, y, z) * kappa * 1.5e13; \/\/ rho*kappa*R,\n                if (minrho_ > rhokappa_[idx] && rhokappa_[idx] > 0)\n                    minrho_ = rhokappa_[idx];\n            }\n        }\n    }\n}\n\n\/\/ calculate smax -- maximum distance photon can travel *******\ndouble Grid::maxDistance(Photon const& ph) const\n{\t\n    double const dsx = ds(ph.pos().x(), ph.dir().x(), xmax_);\n    double const dsy = ds(ph.pos().y(), ph.dir().y(), xmax_);\n    double const dsz = ds(ph.pos().z(), ph.dir().z(), xmax_);\n\n    return std::max(dsx, std::max(dsy, dsz));\n}\n\n\/\/ find distance to next x, y, and z cell walls.  \n\/\/ note that dx is not the x-distance, but the actual distance along \n\/\/ the direction of travel to the next x-face, and likewise for dy and dz.\ndouble Grid::cellDistance(Photon& ph, double delta) const\n{\n    double dx=200.0*xmax_, dy=200.0*ymax_, dz=200.0*zmax_, dcell=0.0;\n    if (delta < 0.0) delta=0.0001*(2.*xmax_\/nx_);\n    double tmp = 2.0*xmax_\/nx_;\n    if(ph.dir().x() > 0.0)\n    {\n        dx = (( int( (ph.pos().x()+xmax_) \/ tmp ) + 1.0 )* tmp - xmax_ - ph.pos().x() )\/ph.dir().x();\n        if (dx < delta)\n        {\n            dx = tmp\/ph.dir().x();\n            ph.x() = (int( (ph.pos().x()+xmax_) \/ tmp ) + 1.0 )*tmp - xmax_ + delta;\n        }\n    } else if (ph.dir().x() < 0.0) {\n        dx = (( int( (ph.pos().x()+xmax_)\/ tmp ) )* tmp - xmax_ - ph.pos().x() )\/ph.dir().x();\n        if (dx < delta)\n        {\n            dx =-tmp\/ph.dir().x();\n            ph.x() = ( int( (ph.pos().x()+xmax_)\/tmp) )* tmp - xmax_ - delta;\n        }\n    }\n\n    tmp = 2.0*ymax_\/ny_;\n    if(ph.dir().y() > 0.0)\n    {\n        dy = (( int( (ph.pos().y()+ymax_)\/tmp ) + 1.0 )* tmp - ymax_ - ph.pos().y() )\/ph.dir().y();\n        if (dy < delta)\n        {\n            dy = tmp\/ph.dir().y();\n            ph.y() = (int( (ph.pos().y()+ymax_)\/tmp) + 1.0 )* tmp - ymax_+ delta;\n        }\n    } else if (ph.dir().y() < 0.0) {\n        dy = (( int( (ph.pos().y()+ymax_)\/tmp ) )*tmp - ymax_ - ph.pos().y() )\/ph.dir().y();\n        if (dy < delta)\n        {\n            dy =-tmp\/ph.dir().y();\n            ph.y() = ( int( (ph.pos().y()+xmax_)\/tmp ) )* tmp - ymax_ - delta;\n        }\n    }\n\n    tmp=2.0*zmax_\/nz_;\n    if(ph.dir().z() > 0.0)\n    {\n        dz = (( int( (ph.pos().z()+zmax_)\/tmp ) + 1.0 )* tmp - zmax_ - ph.pos().z() )\/ph.dir().z();\n        if (dz < delta)\n        {\n            dz = tmp\/ph.dir().z();\n            ph.z() = (int( (ph.pos().z()+zmax_)\/tmp ) + 1.0 )* tmp - zmax_ + delta;\n        }\n    } else if (ph.dir().z() < 0.0) {\n        dz = (( int( (ph.pos().z()+zmax_)\/tmp ))* tmp- zmax_ - ph.pos().z() )\/ph.dir().z();\n        if (dz < delta)\n        {\n            dz =-tmp\/ph.dir().z();\n            ph.z() = ( int( (ph.pos().z()+zmax_)\/tmp ) )* tmp - zmax_ - delta;\n        }\n    }\n\n    dcell = ( dx   < dy ) ? dx    : dy;\n    dcell = (dcell < dz ) ? dcell : dz;\n\/\/\tprintf(\"d %g %g %g \\n\", dx, dy, dz);\n    return dcell;\n}\n\ndouble Grid::findOpticalDepth( Photon ph, double delta ) const\n{\n    double taurun=0.0, d=0.0;\n\n    if (delta < 0.0) delta=0.0001*(2.*xmax_\/nx_);\n    double const smax = maxDistance(ph);\n\n    if(smax < delta)\n    {\n        return 0.0;\n    }\n\n    while (d < 0.999*smax)\n    {\n        double const dcell = cellDistance(ph, delta);\n        auto const x = uint32_t( (ph.pos().x()+xmax_)*nx_ \/ 2.0 \/ xmax_ );\n        auto const y = uint32_t( (ph.pos().y()+ymax_)*ny_ \/ 2.0 \/ ymax_ );\n        auto const z = uint32_t( (ph.pos().z()+zmax_)*nz_ \/ 2.0 \/ zmax_ );\n\n        taurun += dcell * rhokappa_[ x+y*nx_+z*ny_*nx_ ];\n        ph.Move(dcell);\n        d += dcell;\n    }\n\n    return taurun;\n}\n\nint Grid::movePhotonAtDepth( Photon & ph, double tau, double tauold, double delta ) const\n{\n    double taurun=tauold, d=0.0;\n\n    if (delta < 0.0 )\n    {\n        delta=0.0001*(2.*xmax_\/nx_);\n    }\n\n    double const smax = maxDistance(ph);\n\n    \/\/ integrate through grid\n    while (taurun < tau && d < (0.9999*smax))\n    {\n        double const dcell = cellDistance(ph, delta);\n        auto const x = uint32_t( (ph.pos().x()+xmax_)*nx_ \/ 2.0 \/ xmax_ );\n        auto const y = uint32_t( (ph.pos().y()+ymax_)*ny_ \/ 2.0 \/ ymax_ );\n        auto const z = uint32_t( (ph.pos().z()+zmax_)*nz_ \/ 2.0 \/ zmax_ );\n        double const taucell = dcell*rhokappa_[ x+y*nx_+z*ny_*nx_ ];\n\n        if(taurun + taucell >= tau)\n        {\n            double const d1 = (tau-taurun) \/ rhokappa_[ x+y*nx_+z*ny_*nx_ ];\n            d += d1;\n            ph.Move(d1);\n        } else {\n            d += dcell;\n            ph.Move(dcell);\n        }\n\n        taurun += taucell;\n    }\n\n    \/\/ calculate photon final position.  if it escapes envelope then\n    \/\/ set tflag=1.  if photon doesn't escape leave tflag=0 and update\n    \/\/ photon position.\n    return d >= 0.999 * smax;\n}\n\nint Grid::movePhotonAtRandomDepth( Photon &ph, double delta ) const\n{\n    double const tau = -std::log(ran.Get());\n    return movePhotonAtDepth(ph, tau, 0.0, delta);\n}\n\nvoid Grid::peeloff(Photon ph, Observer& observer, DustCRef dust) const\n{\n    double const hgfac = ph.Scatt(dust, Direction3d{observer.pos()});\n    double const tau = findOpticalDepth(ph);\n\n    if (tau == 0.0)\n    {\n        return;\n    }\n\n    ph.weight() *= hgfac * exp(-tau);\n    \/\/ Bin the photon into the image according to its position and direction of travel.\n    observer.Bin(ph);\n} \n<|endoftext|>"}
{"text":"<commit_before>\/\/udp_sync_echo_server.cpp\n#include <iostream>\nusing namespace std;\n\n#ifdef WIN32\n#define _WIN32_WINNT 0x0501\n#include <stdio.h>\n#endif\n\n#include <boost\/bind.hpp>\n#include <boost\/asio.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/enable_shared_from_this.hpp>\nusing namespace boost::asio;\nusing namespace boost::posix_time;\nio_service service;\nvoid handle_connections() {\n\tchar buff[1024];\n\tip::udp::socket sock(service, ip::udp::endpoint(ip::udp::v4(), 8001));\n\twhile (true) {\n\t\tip::udp::endpoint sender_ep;\n\t\tint bytes = sock.receive_from(buffer(buff), sender_ep);\n\t\tstd::string msg(buff, bytes);\n\t\tsock.send_to(buffer(msg), sender_ep);\n\t}\n}\nint main(int argc, char* argv[]) {\n\tstd::cout << \"udp_sync_echo_server.cpp port 8001\" << endl;\n\thandle_connections();\n}\n\n\n\n\n\n\n\n\n\n\n\n\/\/#define BOOST_ASIO_SEPARATE_COMPILATION \n\/*\n\n#include <boost\/thread.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/asio.hpp>\n#include <iostream>\n\nusing namespace std;\nusing namespace boost::asio;\n\/\/io_service service;\n*\/\n\n\n\n\n\n\n\n\/*\/\/  \nvoid func(int i)\n{\n\tstd::cout << \"func called, i= \" << i << std::endl;\n}\nvoid worker_thread()\n{\n\tservice.run();\n}\n\nint main(int argc, char* argv[])\n{\n\tfor (int i = 0; i < 10; ++i)\n\t\tservice.post(boost::bind(func, i));\n\n\tboost::thread_group threads;\n\tfor (int i = 0; i < 3; ++i)\n\t\tthreads.create_thread(worker_thread);\n\t\/\/ wait for all threads to be created\n\tboost::this_thread::sleep(boost::posix_time::millisec(500));\n\tthreads.join_all();\n\tsystem(\"pause\");\n}\n*\/\n\n\n\/*\/\/    \nvoid func(int i)\n{\n\tstd::cout << \"func called, i= \" << i << \"\/\" << boost::this_thread::get_id() << std::endl;\n}\nvoid worker_thread()\n{\n\tservice.run();\n}\nint main(int argc, char* argv[])\n{\n\tio_service::strand strand_one(service), strand_two(service);\n\tfor (int i = 0; i < 5; ++i)\n\t\tservice.post(strand_one.wrap(boost::bind(func, i)));\n\t\n\tfor (int i = 5; i < 10; ++i)\n\t\tservice.post(strand_two.wrap(boost::bind(func, i)));\n\t\n\tboost::thread_group threads;\n\tfor (int i = 0; i < 3; ++i)\n\t\tthreads.create_thread(worker_thread);\t\/\/ wait for all threads to be created\n\n\tboost::this_thread::sleep(boost::posix_time::millisec(500));\n\tthreads.join_all();\n\n\tsystem(\"pause\");\n\treturn 1;\n}*\/\n\n\n\n\n\/*\/\/  service.dispatch    :\nvoid func(int i)\n{\n\tstd::cout << \"func called, i= \" << i << std::endl;\n}\n\nvoid run_dispatch_and_post()\n{\n\tfor (int i = 0; i < 10; i += 2)\n\t{\n\t\tservice.dispatch(boost::bind(func, i));\n\t\tservice.post(boost::bind(func, i + 1));\n\t}\n}\nint main(int argc, char* argv[])\n{\n\tservice.post(run_dispatch_and_post);\n\tservice.run();\n\tsystem(\"pause\");\n\treturn 0;\n}*\/\n\n\n\n\n\n\n\/*\/\/    service.wrap(handler).wrap()  ,     \n\/\/     :\nvoid dispatched_func_1()\n{\n\tstd::cout << \"dispatched 1\" << std::endl;\n}\nvoid dispatched_func_2()\n{\n\tstd::cout << \"dispatched 2\" << std::endl;\n}\nvoid test(boost::function<void()> func)\n{\n\tstd::cout << \"test\" << std::endl;\n\tservice.dispatch(dispatched_func_1);\n\tfunc();\n}\nvoid service_run()\n{\n\tservice.run();\n}\nint main(int argc, char* argv[])\n{\n\ttest(service.wrap(dispatched_func_2));\n\tboost::thread th(service_run);\n\tboost::this_thread::sleep(boost::posix_time::millisec(500));\n\tth.join();\n\tsystem(\"pause\");\n\treturn 0; \n}*\/\n\n\n\n\/\/      :\n\/*using boost::asio;\ntypedef boost::shared_ptr<ip::tcp::socket> socket_ptr;\nio_service service;\nip::tcp::endpoint ep(ip::tcp::v4(), 2001)); \/\/ listen on 2001\nip::tcp::acceptor acc(service, ep);\nsocket_ptr sock(new ip::tcp::socket(service));\nstart_accept(sock);\nservice.run();\nvoid start_accept(socket_ptr sock)\n{\n\tacc.async_accept(*sock, boost::bind(handle_accept, sock, _1));\n}\nvoid handle_accept(socket_ptr sock, const boost::system::error_code & err)\n{\n\tif (err) return;\n\t\/\/ at this point, you can read\/write to the socket\n\tsocket_ptr sock(new ip::tcp::socket(service));\n\tstart_accept(sock);\n}*\/\n\n\n\/\/-------------------------------------\n\n \/*,           100 :\n\nbool read = false;\nvoid deadline_handler(const boost::system::error_code &) \n{\n    std::cout << (read ? \"read successfully\" : \"read failed\") << std::endl;\n}\nvoid read_handler(const boost::system::error_code &) \n{\n    read = true;\n}\nip::tcp::socket sock(service);\n\nread = false;\nchar data[512];\nsock.async_read_some(buffer(data, 512));\ndeadline_timer t(service, boost::posix_time::milliseconds(100));\nt.async_wait(&deadline_handler);\nservice.run();\n*\/\n\n\n\/*\n.run()   ,      \n  ,  service.run()  ,      . \n  .      connect_handler,     .\n       ,   :\ntypedef boost::shared_ptr<io_service::work> work_ptr;\nwork_ptr dummy_work(new io_service::work(service_));\n\n      service_.run()        \nuseservice_.stop()  dummy_work.reset(0); \/\/ destroy dummy_work.\n*\/<commit_msg>Add system login (TCP)<commit_after>#ifdef WIN32\n#define _WIN32_WINNT 0x0501\n#include <stdio.h>\n#endif\n\n\n#include <boost\/thread.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/asio.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/enable_shared_from_this.hpp>\nusing namespace boost::asio;\nusing namespace boost::posix_time;\nio_service service;\n\nstruct talk_to_client;\ntypedef boost::shared_ptr<talk_to_client> client_ptr;\ntypedef std::vector<client_ptr> array;\narray clients;\n\/\/ thread-safe access to clients array\nboost::recursive_mutex cs;\n\nvoid update_clients_changed();\n\n\/** simple connection to server:\n- logs in just with username (no password)\n- all connections are initiated by the client: client asks, server answers\n- server disconnects any client that hasn't pinged for 5 seconds\n\nPossible requests:\n- gets a list of all connected clients\n- ping: the server answers either with \"ping ok\" or \"ping client_list_changed\"\n*\/\nstruct talk_to_client : boost::enable_shared_from_this<talk_to_client> {\n\ttalk_to_client()\n\t\t: sock_(service), started_(false), already_read_(0) {\n\t\tlast_ping = microsec_clock::local_time();\n\t}\n\tstd::string username() const { return username_; }\n\n\tvoid answer_to_client() {\n\t\ttry {\n\t\t\tread_request();\n\t\t\tprocess_request();\n\t\t}\n\t\tcatch (boost::system::system_error&) {\n\t\t\tstop();\n\t\t}\n\t\tif (timed_out()) {\n\t\t\tstop();\n\t\t\tstd::cout << \"stopping \" << username_ << \" - no ping in time\" << std::endl;\n\t\t}\n\t}\n\tvoid set_clients_changed() { clients_changed_ = true; }\n\tip::tcp::socket & sock() { return sock_; }\n\tbool timed_out() const {\n\t\tptime now = microsec_clock::local_time();\n\t\tlong long ms = (now - last_ping).total_milliseconds();\n\t\treturn ms > 5000;\n\t}\n\tvoid stop() {\n\t\t\/\/ close client connection\n\t\tboost::system::error_code err;\n\t\tsock_.close(err);\n\t}\nprivate:\n\tvoid read_request() {\n\t\tif (sock_.available())\n\t\t\talready_read_ += sock_.read_some(\n\t\t\tbuffer(buff_ + already_read_, max_msg - already_read_));\n\t}\n\tvoid process_request() {\n\t\tbool found_enter = std::find(buff_, buff_ + already_read_, '\\n')\n\t\t\t< buff_ + already_read_;\n\t\tif (!found_enter)\n\t\t\treturn; \/\/ message is not full\n\t\t\/\/ process the msg\n\t\tlast_ping = microsec_clock::local_time();\n\t\tsize_t pos = std::find(buff_, buff_ + already_read_, '\\n') - buff_;\n\t\tstd::string msg(buff_, pos);\n\t\tstd::copy(buff_ + already_read_, buff_ + max_msg, buff_);\n\t\talready_read_ -= pos + 1;\n\n\t\tif (msg.find(\"login \") == 0) on_login(msg);\n\t\telse if (msg.find(\"ping\") == 0) on_ping();\n\t\telse if (msg.find(\"ask_clients\") == 0) on_clients();\n\t\telse std::cerr << \"invalid msg \" << msg << std::endl;\n\t}\n\n\tvoid on_login(const std::string & msg) {\n\t\tstd::istringstream in(msg);\n\t\tin >> username_ >> username_;\n\t\tstd::cout << username_ << \" logged in\" << std::endl;\n\t\twrite(\"login ok\\n\");\n\t\tupdate_clients_changed();\n\t}\n\tvoid on_ping() {\n\t\twrite(clients_changed_ ? \"ping client_list_changed\\n\" : \"ping ok\\n\");\n\t\tclients_changed_ = false;\n\t}\n\tvoid on_clients() {\n\t\tstd::string msg;\n\t\t{ boost::recursive_mutex::scoped_lock lk(cs);\n\t\tfor (array::const_iterator b = clients.begin(), e = clients.end(); b != e; ++b)\n\t\t\tmsg += (*b)->username() + \" \";\n\t\t}\n\t\twrite(\"clients \" + msg + \"\\n\");\n\t}\n\n\n\tvoid write(const std::string & msg) {\n\t\tsock_.write_some(buffer(msg));\n\t}\nprivate:\n\tip::tcp::socket sock_;\n\tenum { max_msg = 1024 };\n\tint already_read_;\n\tchar buff_[max_msg];\n\tbool started_;\n\tstd::string username_;\n\tbool clients_changed_;\n\tptime last_ping;\n};\n\nvoid update_clients_changed() {\n\tboost::recursive_mutex::scoped_lock lk(cs);\n\tfor (array::iterator b = clients.begin(), e = clients.end(); b != e; ++b)\n\t\t(*b)->set_clients_changed();\n}\n\n\n\nvoid accept_thread() {\n\tip::tcp::acceptor acceptor(service, ip::tcp::endpoint(ip::tcp::v4(), 8001));\n\twhile (true) {\n\t\tclient_ptr new_(new talk_to_client);\n\t\tacceptor.accept(new_->sock());\n\n\t\tboost::recursive_mutex::scoped_lock lk(cs);\n\t\tclients.push_back(new_);\n\t}\n}\n\nvoid handle_clients_thread() {\n\twhile (true) {\n\t\tboost::this_thread::sleep(millisec(1));\n\t\tboost::recursive_mutex::scoped_lock lk(cs);\n\t\tfor (array::iterator b = clients.begin(), e = clients.end(); b != e; ++b)\n\t\t\t(*b)->answer_to_client();\n\t\t\/\/ erase clients that timed out\n\t\tclients.erase(std::remove_if(clients.begin(), clients.end(),\n\t\t\tboost::bind(&talk_to_client::timed_out, _1)), clients.end());\n\t}\n}\n\nint main(int argc, char* argv[]) {\n\tboost::thread_group threads;\n\tthreads.create_thread(accept_thread);\n\tthreads.create_thread(handle_clients_thread);\n\tthreads.join_all();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <ctrcommon\/input.hpp>\r\n#include <ctrcommon\/platform.hpp>\r\n#include <ctrcommon\/ui.hpp>\r\n\r\n#include <stdio.h>\r\n\r\n#include <sstream>\r\n#include <iomanip>\r\n\r\n#include <sys\/dirent.h>\r\n#include <3ds.h>\r\n#include <ctrcommon\/app.hpp>\r\n\r\ntypedef enum {\r\n    INSTALL_CIA,\r\n    DELETE_CIA,\r\n    DELETE_TITLE,\r\n    LAUNCH_TITLE\r\n} Mode;\r\n\r\nint main(int argc, char **argv) {\r\n    if(!platformInit()) {\r\n        return 0;\r\n    }\r\n\r\n    bool ninjhax = platformIsNinjhax();\r\n\r\n    std::vector<std::string> extensions;\r\n    extensions.push_back(\"cia\");\r\n\r\n    MediaType destination = SD;\r\n    Mode mode = INSTALL_CIA;\r\n    bool exit = false;\r\n    bool netInstall = false;\r\n    u64 freeSpace = fsGetFreeSpace(destination);\r\n    auto onLoop = [&]() {\r\n        if(ninjhax && inputIsPressed(BUTTON_START)) {\r\n            exit = true;\r\n            return true;\r\n        }\r\n\r\n        bool breakLoop = false;\r\n\r\n        if(inputIsPressed(BUTTON_L)) {\r\n            if(destination == SD) {\r\n                destination = NAND;\r\n            } else {\r\n                destination = SD;\r\n            }\r\n\r\n            freeSpace = fsGetFreeSpace(destination);\r\n            if(mode == DELETE_TITLE || mode == LAUNCH_TITLE) {\r\n                breakLoop = true;\r\n            }\r\n        }\r\n\r\n        if(inputIsPressed(BUTTON_R)) {\r\n            if(mode == INSTALL_CIA) {\r\n                mode = DELETE_CIA;\r\n            } else if(mode == DELETE_CIA) {\r\n                mode = DELETE_TITLE;\r\n                breakLoop = true;\r\n            } else if(mode == DELETE_TITLE) {\r\n                mode = LAUNCH_TITLE;\r\n            } else if(mode == LAUNCH_TITLE) {\r\n                mode = INSTALL_CIA;\r\n                breakLoop = true;\r\n            }\r\n        }\r\n\r\n        if(mode == INSTALL_CIA && inputIsPressed(BUTTON_Y)) {\r\n            netInstall = true;\r\n            breakLoop = true;\r\n        }\r\n\r\n        std::stringstream stream;\r\n        stream << \"Free Space: \" << freeSpace << \" bytes (\" << std::fixed << std::setprecision(2) << freeSpace \/ 1024.0f \/ 1024.0f << \"MB)\" << \"\\n\";\r\n        stream << \"Destination: \" << (destination == NAND ? \"NAND\" : \"SD\") << \", Mode: \" << (mode == INSTALL_CIA ? \"Install CIA\" : mode == DELETE_CIA ? \"Delete CIA\" : mode == DELETE_TITLE ? \"Delete Title\" : \"Launch Title\") << \"\\n\";\r\n        stream << \"L - Switch Destination, R - Switch Mode\" << \"\\n\";\r\n        if(mode == INSTALL_CIA) {\r\n            stream << \"X - Install all CIAs in the current directory\" << \"\\n\";\r\n            stream << \"Y - Receive an app over the network\" << \"\\n\";\r\n        } else if(mode == DELETE_CIA) {\r\n            stream << \"X - Delete all CIAs in the current directory\" << \"\\n\";\r\n        }\r\n\r\n        if(ninjhax) {\r\n            stream << \"START - Exit to launcher\" << \"\\n\";\r\n        }\r\n\r\n        std::string str = stream.str();\r\n        screenDrawString(str, (screenGetWidth() - screenGetStrWidth(str)) \/ 2, screenGetHeight() - 4 - screenGetStrHeight(str), 255, 255, 255);\r\n\r\n        return breakLoop;\r\n    };\r\n\r\n    auto onProgress = [&](u64 pos, u64 totalSize) {\r\n        std::stringstream details;\r\n        details << \"(\" << std::fixed << std::setprecision(2) << ((double) pos \/ 1024.0 \/ 1024.0) << \"MB \/ \" << std::fixed << std::setprecision(2) << ((double) totalSize \/ 1024.0 \/ 1024.0) << \"MB)\" << \"\\n\";\r\n        details << \"Press B to cancel.\";\r\n\r\n        u32 progress = (u32) (((double) pos \/ (double) totalSize) * 100);\r\n        uiDisplayProgress(TOP_SCREEN, \"Installing\", details.str(), true, progress);\r\n        inputPoll();\r\n        return !inputIsPressed(BUTTON_B);\r\n    };\r\n\r\n    while(platformIsRunning()) {\r\n        std::string fileTarget;\r\n        App appTarget;\r\n        if(mode == INSTALL_CIA || mode == DELETE_CIA) {\r\n            uiSelectFile(&fileTarget, \"\/\", extensions, [&](const std::string currDirectory, bool inRoot, bool &updateList) {\r\n                if(inputIsPressed(BUTTON_X)) {\r\n                    std::stringstream confirmMsg;\r\n                    if(mode == INSTALL_CIA) {\r\n                        confirmMsg << \"Install \";\r\n                    } else {\r\n                        confirmMsg << \"Delete \";\r\n                    }\r\n\r\n                    confirmMsg << \"all CIAs in the current directory?\";\r\n                    if(uiPrompt(TOP_SCREEN, confirmMsg.str(), true)) {\r\n                        bool failed = false;\r\n                        std::vector<FileInfo> contents = fsGetDirectoryContents(currDirectory);\r\n                        for(std::vector<FileInfo>::iterator it = contents.begin(); it != contents.end(); it++) {\r\n                            std::string path = (*it).path;\r\n                            std::string fileName = (*it).name;\r\n                            if(!fsIsDirectory(path) && fsHasExtensions(path, extensions)) {\r\n                                if(mode == INSTALL_CIA) {\r\n                                    AppResult ret = appInstallFile(destination, path, onProgress);\r\n                                    if(ret != APP_SUCCESS) {\r\n                                        std::stringstream resultMsg;\r\n                                        resultMsg << \"Install failed!\" << \"\\n\";\r\n                                        resultMsg << fileName << \"\\n\";\r\n                                        resultMsg << appGetResultString(ret) << \"\\n\";\r\n                                        uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n                                        failed = true;\r\n                                        break;\r\n                                    }\r\n                                } else {\r\n                                    if(!fsDelete(path)) {\r\n                                        std::stringstream resultMsg;\r\n                                        resultMsg << \"Delete failed!\" << \"\\n\";\r\n                                        resultMsg << fileName << \"\\n\";\r\n                                        resultMsg << platformGetErrorString(platformGetError()) << \"\\n\";\r\n                                        uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n                                        failed = true;\r\n                                        break;\r\n                                    } else {\r\n                                        updateList = true;\r\n                                    }\r\n                                }\r\n                            }\r\n                        }\r\n\r\n                        if(!failed) {\r\n                            uiPrompt(TOP_SCREEN, \"Install succeeded!\\n\", false);\r\n                        }\r\n\r\n                        freeSpace = fsGetFreeSpace(destination);\r\n                    }\r\n                }\r\n\r\n                return onLoop();\r\n            }, [&](const std::string path, bool &updateList) {\r\n                std::stringstream confirmMsg;\r\n                if(mode == INSTALL_CIA) {\r\n                    confirmMsg << \"Install \";\r\n                } else {\r\n                    confirmMsg << \"Delete \";\r\n                }\r\n\r\n                confirmMsg << \"the selected CIA?\";\r\n                if(uiPrompt(TOP_SCREEN, confirmMsg.str(), true)) {\r\n                    std::stringstream resultMsg;\r\n                    if(mode == INSTALL_CIA) {\r\n                        resultMsg << \"Install \";\r\n                    } else {\r\n                        resultMsg << \"Delete \";\r\n                    }\r\n\r\n                    if(mode == INSTALL_CIA) {\r\n                        AppResult ret = appInstallFile(destination, path, onProgress);\r\n                        if(ret == APP_SUCCESS) {\r\n                            resultMsg << \"succeeded!\";\r\n                        } else {\r\n                            resultMsg << \"failed!\" << \"\\n\";\r\n                            resultMsg << appGetResultString(ret) << \"\\n\";\r\n                        }\r\n                    } else {\r\n                        if(fsDelete(path)) {\r\n                            updateList = true;\r\n                            resultMsg << \"succeeded!\";\r\n                        } else {\r\n                            resultMsg << \"failed!\" << \"\\n\";\r\n                            resultMsg << platformGetErrorString(platformGetError()) << \"\\n\";\r\n                        }\r\n                    }\r\n\r\n                    uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n\r\n                    freeSpace = fsGetFreeSpace(destination);\r\n                }\r\n\r\n                return false;\r\n            });\r\n        } else if(mode == DELETE_TITLE || mode == LAUNCH_TITLE) {\r\n            uiSelectApp(&appTarget, destination, [&](bool &updateList) {\r\n                return onLoop();\r\n            }, [&](App app, bool &updateList) {\r\n                if(mode == DELETE_TITLE) {\r\n                    if(uiPrompt(TOP_SCREEN, \"Delete the selected title?\", true)) {\r\n                        updateList = true;\r\n                        uiDisplayMessage(TOP_SCREEN, \"Deleting title...\");\r\n                        AppResult ret = appDelete(app);\r\n\r\n                        std::stringstream resultMsg;\r\n                        resultMsg << \"Delete \";\r\n                        if(ret == APP_SUCCESS) {\r\n                            resultMsg << \"succeeded!\";\r\n                        } else {\r\n                            resultMsg << \"failed!\" << \"\\n\";\r\n                            resultMsg << appGetResultString(ret) << \"\\n\";\r\n                        }\r\n\r\n                        uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n\r\n                        freeSpace = fsGetFreeSpace(destination);\r\n                    }\r\n                } else if(mode == LAUNCH_TITLE) {\r\n                    if(uiPrompt(TOP_SCREEN, \"Launch the selected title?\", true)) {\r\n                        updateList = true;\r\n                        uiDisplayMessage(TOP_SCREEN, \"Launching title...\");\r\n                        AppResult ret = appLaunch(app);\r\n\r\n                        if(ret != APP_SUCCESS) {\r\n                            std::stringstream resultMsg;\r\n                            resultMsg << \"Launch failed!\" << \"\\n\";\r\n                            resultMsg << appGetResultString(ret) << \"\\n\";\r\n                            uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n                        } else {\r\n                            while(true) {\r\n                            }\r\n                        }\r\n                    }\r\n                }\r\n\r\n                return false;\r\n            });\r\n        }\r\n\r\n        if(netInstall && !exit) {\r\n            netInstall = false;\r\n\r\n            screenClearBuffers(BOTTOM_SCREEN, 0, 0, 0);\r\n\r\n            RemoteFile file = uiAcceptRemoteFile(TOP_SCREEN);\r\n            if(file.fd == NULL) {\r\n                continue;\r\n            }\r\n\r\n            std::stringstream confirmStream;\r\n            confirmStream << \"Install the received application?\" << \"\\n\";\r\n            confirmStream << \"Size: \" << file.fileSize << \" bytes (\" << std::fixed << std::setprecision(2) << file.fileSize \/ 1024.0f \/ 1024.0f << \"MB)\" << \"\\n\";\r\n            if(uiPrompt(TOP_SCREEN, confirmStream.str(), true)) {\r\n                AppResult ret = appInstall(destination, file.fd, file.fileSize, onProgress);\r\n                std::stringstream resultMsg;\r\n                resultMsg << \"Install \";\r\n                if(ret == APP_SUCCESS) {\r\n                    resultMsg << \"succeeded!\";\r\n                } else {\r\n                    resultMsg << \"failed!\" << \"\\n\";\r\n                    resultMsg << appGetResultString(ret) << \"\\n\";\r\n                }\r\n\r\n                uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n            }\r\n\r\n            fclose(file.fd);\r\n            continue;\r\n        }\r\n\r\n        if(exit) {\r\n            break;\r\n        }\r\n    }\r\n\r\n    platformCleanup();\r\n    return 0;\r\n}\r\n<commit_msg>Display message while loading title list.<commit_after>#include <ctrcommon\/app.hpp>\r\n#include <ctrcommon\/input.hpp>\r\n#include <ctrcommon\/platform.hpp>\r\n#include <ctrcommon\/ui.hpp>\r\n\r\n#include <stdio.h>\r\n\r\n#include <sstream>\r\n#include <iomanip>\r\n\r\n#include <sys\/dirent.h>\r\n\r\ntypedef enum {\r\n    INSTALL_CIA,\r\n    DELETE_CIA,\r\n    DELETE_TITLE,\r\n    LAUNCH_TITLE\r\n} Mode;\r\n\r\nint main(int argc, char **argv) {\r\n    if(!platformInit()) {\r\n        return 0;\r\n    }\r\n\r\n    bool ninjhax = platformIsNinjhax();\r\n\r\n    std::vector<std::string> extensions;\r\n    extensions.push_back(\"cia\");\r\n\r\n    MediaType destination = SD;\r\n    Mode mode = INSTALL_CIA;\r\n    bool exit = false;\r\n    bool netInstall = false;\r\n    u64 freeSpace = fsGetFreeSpace(destination);\r\n    auto onLoop = [&]() {\r\n        if(ninjhax && inputIsPressed(BUTTON_START)) {\r\n            exit = true;\r\n            return true;\r\n        }\r\n\r\n        bool breakLoop = false;\r\n\r\n        if(inputIsPressed(BUTTON_L)) {\r\n            if(destination == SD) {\r\n                destination = NAND;\r\n            } else {\r\n                destination = SD;\r\n            }\r\n\r\n            freeSpace = fsGetFreeSpace(destination);\r\n            if(mode == DELETE_TITLE || mode == LAUNCH_TITLE) {\r\n                breakLoop = true;\r\n            }\r\n        }\r\n\r\n        if(inputIsPressed(BUTTON_R)) {\r\n            if(mode == INSTALL_CIA) {\r\n                mode = DELETE_CIA;\r\n            } else if(mode == DELETE_CIA) {\r\n                mode = DELETE_TITLE;\r\n                breakLoop = true;\r\n            } else if(mode == DELETE_TITLE) {\r\n                mode = LAUNCH_TITLE;\r\n            } else if(mode == LAUNCH_TITLE) {\r\n                mode = INSTALL_CIA;\r\n                breakLoop = true;\r\n            }\r\n        }\r\n\r\n        if(mode == INSTALL_CIA && inputIsPressed(BUTTON_Y)) {\r\n            netInstall = true;\r\n            breakLoop = true;\r\n        }\r\n\r\n        std::stringstream stream;\r\n        stream << \"Free Space: \" << freeSpace << \" bytes (\" << std::fixed << std::setprecision(2) << freeSpace \/ 1024.0f \/ 1024.0f << \"MB)\" << \"\\n\";\r\n        stream << \"Destination: \" << (destination == NAND ? \"NAND\" : \"SD\") << \", Mode: \" << (mode == INSTALL_CIA ? \"Install CIA\" : mode == DELETE_CIA ? \"Delete CIA\" : mode == DELETE_TITLE ? \"Delete Title\" : \"Launch Title\") << \"\\n\";\r\n        stream << \"L - Switch Destination, R - Switch Mode\" << \"\\n\";\r\n        if(mode == INSTALL_CIA) {\r\n            stream << \"X - Install all CIAs in the current directory\" << \"\\n\";\r\n            stream << \"Y - Receive an app over the network\" << \"\\n\";\r\n        } else if(mode == DELETE_CIA) {\r\n            stream << \"X - Delete all CIAs in the current directory\" << \"\\n\";\r\n        }\r\n\r\n        if(ninjhax) {\r\n            stream << \"START - Exit to launcher\" << \"\\n\";\r\n        }\r\n\r\n        std::string str = stream.str();\r\n        screenDrawString(str, (screenGetWidth() - screenGetStrWidth(str)) \/ 2, screenGetHeight() - 4 - screenGetStrHeight(str), 255, 255, 255);\r\n\r\n        return breakLoop;\r\n    };\r\n\r\n    auto onProgress = [&](u64 pos, u64 totalSize) {\r\n        std::stringstream details;\r\n        details << \"(\" << std::fixed << std::setprecision(2) << ((double) pos \/ 1024.0 \/ 1024.0) << \"MB \/ \" << std::fixed << std::setprecision(2) << ((double) totalSize \/ 1024.0 \/ 1024.0) << \"MB)\" << \"\\n\";\r\n        details << \"Press B to cancel.\";\r\n\r\n        u32 progress = (u32) (((double) pos \/ (double) totalSize) * 100);\r\n        uiDisplayProgress(TOP_SCREEN, \"Installing\", details.str(), true, progress);\r\n        inputPoll();\r\n        return !inputIsPressed(BUTTON_B);\r\n    };\r\n\r\n    while(platformIsRunning()) {\r\n        std::string fileTarget;\r\n        App appTarget;\r\n        if(mode == INSTALL_CIA || mode == DELETE_CIA) {\r\n            uiSelectFile(&fileTarget, \"\/\", extensions, [&](const std::string currDirectory, bool inRoot, bool &updateList) {\r\n                if(inputIsPressed(BUTTON_X)) {\r\n                    std::stringstream confirmMsg;\r\n                    if(mode == INSTALL_CIA) {\r\n                        confirmMsg << \"Install \";\r\n                    } else {\r\n                        confirmMsg << \"Delete \";\r\n                    }\r\n\r\n                    confirmMsg << \"all CIAs in the current directory?\";\r\n                    if(uiPrompt(TOP_SCREEN, confirmMsg.str(), true)) {\r\n                        bool failed = false;\r\n                        std::vector<FileInfo> contents = fsGetDirectoryContents(currDirectory);\r\n                        for(std::vector<FileInfo>::iterator it = contents.begin(); it != contents.end(); it++) {\r\n                            std::string path = (*it).path;\r\n                            std::string fileName = (*it).name;\r\n                            if(!fsIsDirectory(path) && fsHasExtensions(path, extensions)) {\r\n                                if(mode == INSTALL_CIA) {\r\n                                    AppResult ret = appInstallFile(destination, path, onProgress);\r\n                                    if(ret != APP_SUCCESS) {\r\n                                        std::stringstream resultMsg;\r\n                                        resultMsg << \"Install failed!\" << \"\\n\";\r\n                                        resultMsg << fileName << \"\\n\";\r\n                                        resultMsg << appGetResultString(ret) << \"\\n\";\r\n                                        uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n                                        failed = true;\r\n                                        break;\r\n                                    }\r\n                                } else {\r\n                                    if(!fsDelete(path)) {\r\n                                        std::stringstream resultMsg;\r\n                                        resultMsg << \"Delete failed!\" << \"\\n\";\r\n                                        resultMsg << fileName << \"\\n\";\r\n                                        resultMsg << platformGetErrorString(platformGetError()) << \"\\n\";\r\n                                        uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n                                        failed = true;\r\n                                        break;\r\n                                    } else {\r\n                                        updateList = true;\r\n                                    }\r\n                                }\r\n                            }\r\n                        }\r\n\r\n                        if(!failed) {\r\n                            uiPrompt(TOP_SCREEN, \"Install succeeded!\\n\", false);\r\n                        }\r\n\r\n                        freeSpace = fsGetFreeSpace(destination);\r\n                    }\r\n                }\r\n\r\n                return onLoop();\r\n            }, [&](const std::string path, bool &updateList) {\r\n                std::stringstream confirmMsg;\r\n                if(mode == INSTALL_CIA) {\r\n                    confirmMsg << \"Install \";\r\n                } else {\r\n                    confirmMsg << \"Delete \";\r\n                }\r\n\r\n                confirmMsg << \"the selected CIA?\";\r\n                if(uiPrompt(TOP_SCREEN, confirmMsg.str(), true)) {\r\n                    std::stringstream resultMsg;\r\n                    if(mode == INSTALL_CIA) {\r\n                        resultMsg << \"Install \";\r\n                    } else {\r\n                        resultMsg << \"Delete \";\r\n                    }\r\n\r\n                    if(mode == INSTALL_CIA) {\r\n                        AppResult ret = appInstallFile(destination, path, onProgress);\r\n                        if(ret == APP_SUCCESS) {\r\n                            resultMsg << \"succeeded!\";\r\n                        } else {\r\n                            resultMsg << \"failed!\" << \"\\n\";\r\n                            resultMsg << appGetResultString(ret) << \"\\n\";\r\n                        }\r\n                    } else {\r\n                        if(fsDelete(path)) {\r\n                            updateList = true;\r\n                            resultMsg << \"succeeded!\";\r\n                        } else {\r\n                            resultMsg << \"failed!\" << \"\\n\";\r\n                            resultMsg << platformGetErrorString(platformGetError()) << \"\\n\";\r\n                        }\r\n                    }\r\n\r\n                    uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n\r\n                    freeSpace = fsGetFreeSpace(destination);\r\n                }\r\n\r\n                return false;\r\n            });\r\n        } else if(mode == DELETE_TITLE || mode == LAUNCH_TITLE) {\r\n            uiDisplayMessage(BOTTOM_SCREEN, \"Loading title list...\");\r\n            uiSelectApp(&appTarget, destination, [&](bool &updateList) {\r\n                return onLoop();\r\n            }, [&](App app, bool &updateList) {\r\n                if(mode == DELETE_TITLE) {\r\n                    if(uiPrompt(TOP_SCREEN, \"Delete the selected title?\", true)) {\r\n                        updateList = true;\r\n                        uiDisplayMessage(TOP_SCREEN, \"Deleting title...\");\r\n                        AppResult ret = appDelete(app);\r\n\r\n                        std::stringstream resultMsg;\r\n                        resultMsg << \"Delete \";\r\n                        if(ret == APP_SUCCESS) {\r\n                            resultMsg << \"succeeded!\";\r\n                        } else {\r\n                            resultMsg << \"failed!\" << \"\\n\";\r\n                            resultMsg << appGetResultString(ret) << \"\\n\";\r\n                        }\r\n\r\n                        uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n\r\n                        freeSpace = fsGetFreeSpace(destination);\r\n                    }\r\n                } else if(mode == LAUNCH_TITLE) {\r\n                    if(uiPrompt(TOP_SCREEN, \"Launch the selected title?\", true)) {\r\n                        updateList = true;\r\n                        uiDisplayMessage(TOP_SCREEN, \"Launching title...\");\r\n                        AppResult ret = appLaunch(app);\r\n\r\n                        if(ret != APP_SUCCESS) {\r\n                            std::stringstream resultMsg;\r\n                            resultMsg << \"Launch failed!\" << \"\\n\";\r\n                            resultMsg << appGetResultString(ret) << \"\\n\";\r\n                            uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n                        } else {\r\n                            while(true) {\r\n                            }\r\n                        }\r\n                    }\r\n                }\r\n\r\n                return false;\r\n            });\r\n        }\r\n\r\n        if(netInstall && !exit) {\r\n            netInstall = false;\r\n\r\n            screenClearBuffers(BOTTOM_SCREEN, 0, 0, 0);\r\n\r\n            RemoteFile file = uiAcceptRemoteFile(TOP_SCREEN);\r\n            if(file.fd == NULL) {\r\n                continue;\r\n            }\r\n\r\n            std::stringstream confirmStream;\r\n            confirmStream << \"Install the received application?\" << \"\\n\";\r\n            confirmStream << \"Size: \" << file.fileSize << \" bytes (\" << std::fixed << std::setprecision(2) << file.fileSize \/ 1024.0f \/ 1024.0f << \"MB)\" << \"\\n\";\r\n            if(uiPrompt(TOP_SCREEN, confirmStream.str(), true)) {\r\n                AppResult ret = appInstall(destination, file.fd, file.fileSize, onProgress);\r\n                std::stringstream resultMsg;\r\n                resultMsg << \"Install \";\r\n                if(ret == APP_SUCCESS) {\r\n                    resultMsg << \"succeeded!\";\r\n                } else {\r\n                    resultMsg << \"failed!\" << \"\\n\";\r\n                    resultMsg << appGetResultString(ret) << \"\\n\";\r\n                }\r\n\r\n                uiPrompt(TOP_SCREEN, resultMsg.str(), false);\r\n            }\r\n\r\n            fclose(file.fd);\r\n            continue;\r\n        }\r\n\r\n        if(exit) {\r\n            break;\r\n        }\r\n    }\r\n\r\n    platformCleanup();\r\n    return 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\r\n#include <iostream>\r\n\r\nusing namespace std;\r\n\r\nstatic bool is_prime(int i) {\r\n\tif (i == 1) return false;\t\t\/\/ 1 isn't prime\r\n\tif (i == 2) return true;\t\t\/\/ 2 is though\r\n\tif (i % 2 == 0) return false;\t\/\/ Even numbers aren't prime\r\n\r\n\tint div = 3;\t\t\t\t\t\/\/ No need to test even dividers either\r\n\twhile (div <= sqrt(i)) {\r\n\t\tif (i%div == 0) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tdiv = div + 2;\r\n\t}\r\n\treturn true;\r\n}\r\n\r\nint main() {\r\n\tint n;\r\n\tcin >> n;\r\n\twhile (n--) {\r\n\t\tint i;\r\n\t\tcin >> i;\r\n\t\tif (is_prime(i))\r\n\t\t{\r\n\t\t\tcout << \"Prime\" << endl;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tcout << \"Not prime\" << endl;\r\n\t\t}\r\n\t}\r\n\treturn 0;\r\n}\r\n<commit_msg>Update ctci-big-o.cpp<commit_after>#include <cmath>\r\n#include <iostream>\r\n\r\nusing namespace std;\r\n\r\nstatic bool is_prime(int i) {\r\n\tif (i == 1) return false;\t\t\/\/ 1 isn't prime\r\n\tif (i == 2) return true;\t\t\/\/ 2 is though\r\n\tif (i % 2 == 0) return false;\t\t\/\/ Even numbers aren't prime\r\n\r\n\tint div = 3;\t\t\t\t\/\/ No need to test even dividers either\r\n\twhile (div <= sqrt(i)) {\r\n\t\tif (i%div == 0) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tdiv = div + 2;\r\n\t}\r\n\treturn true;\r\n}\r\n\r\nint main() {\r\n\tint n;\r\n\tcin >> n;\r\n\twhile (n--) {\r\n\t\tint i;\r\n\t\tcin >> i;\r\n\t\tif (is_prime(i))\r\n\t\t{\r\n\t\t\tcout << \"Prime\" << endl;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tcout << \"Not prime\" << endl;\r\n\t\t}\r\n\t}\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\r\n#include <string>\r\n#include <vector>\r\n#include <tuple>\r\n#include <sstream>\r\n#include <type_traits>\r\n#include <functional>\r\n#include <memory>\r\n#include <unordered_map>\r\n\r\nnamespace argparse {\r\n\r\nnamespace detail {\r\n    template <typename In, typename Out, bool pass = std::is_convertible<In, Out>::value>\r\n    struct lexical_cast_t;\r\n\r\n    template <typename In, typename Out>\r\n    struct lexical_cast_t<In, Out, true> {\r\n        static Out apply(In const& val) {\r\n            return static_cast<Out>(val);\r\n        }\r\n    };\r\n\r\n    template <typename In>\r\n    struct lexical_cast_t<In, std::string, false> {\r\n        static std::string apply(In const& val) {\r\n            std::ostringstream osstr;\r\n            osstr << val;\r\n            return osstr.str();\r\n        }\r\n    };\r\n\r\n    template <typename Out>\r\n    struct lexical_cast_t<std::string, Out, false> {\r\n        static Out apply(std::string const& val) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n\r\n    template <typename Out, std::size_t N>\r\n    struct lexical_cast_t<char[N], Out, false> {\r\n        static Out apply(char const (&val)[N]) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n\r\n    template <typename Out, std::size_t N>\r\n    struct lexical_cast_t<char const[N], Out, false> {\r\n        static Out apply(char const (&val)[N]) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n} \/\/ namespace detail;\r\n\r\ntemplate <typename Out, typename In>\r\ninline Out lexical_cast(In const& val) {\r\n    return detail::lexical_cast_t<In, Out>::apply(val);\r\n}\r\n\r\n\/\/\r\n\r\nstruct argument_base {\r\n   virtual void assign(std::string const& src) = 0;\r\n   virtual void store_true() = 0;\r\n   virtual bool with_value() const = 0;\r\n\r\n   argument_base(std::string const& name, char short_name,\r\n                 std::string const& help)\r\n     : name_{name}, short_name_{short_name}, help_{help}\r\n  {\r\n  }\r\n\r\n   std::string const& name() const { return name_; }\r\n   char short_name() const { return short_name_; }\r\n\r\nprivate:\r\n   std::string name_;\r\n   char short_name_;\r\n   std::string help_;\r\n};\r\n\r\ntemplate <typename T>\r\nstruct argument_with_value : public argument_base {\r\n   using arg_type = T;\r\n\r\n   argument_with_value(std::string const& name, char short_name,\r\n                       std::string const& help)\r\n      : argument_base{name, short_name, help}\r\n   {\r\n   }\r\n\r\n   void assign(std::string const& src) override {\r\n      val_.reset(new T(lexical_cast<T>(src)));\r\n   }\r\n\r\n   void store_true() override { \/* do nothing. *\/ }\r\n   bool with_value() const override { return true; }\r\n\r\nprivate:\r\n   std::unique_ptr<T> val_;\r\n};\r\n\r\nstruct argument_flag : public argument_base {\r\n   using arg_type = bool;\r\n\r\n   argument_flag(std::string const& name, char short_name,\r\n            std::string const& help)\r\n      : argument_base{ name, short_name, help }\r\n   {\r\n   }\r\n\r\n   void assign(std::string const&) override { \/* do nothing. *\/ }\r\n   void store_true() override { val_ = true; }\r\n   bool with_value() const override { return false; }\r\n\r\nprivate:\r\n   bool val_ = false;\r\n};\r\n\r\n\r\ntemplate <typename T>\r\ninline argument_with_value<T> arg(std::string const& name, char short_name = '\\0',\r\n                                  std::string const& help = \"\")\r\n{\r\n   return argument_with_value<T>{ name, short_name, help };\r\n}\r\n\r\ntemplate <typename T>\r\ninline argument_with_value<T> arg(std::string const& name, std::string const& help)\r\n{\r\n   return argument_with_value<T>{ name, '\\0', help };\r\n}\r\n\r\ninline argument_flag flag(std::string const& name, char short_name = '\\0',\r\n                          std::string const& help = \"\")\r\n{\r\n   return argument_flag{ name, short_name, help };\r\n}\r\n\r\ninline argument_flag flag(std::string const& name, std::string const& help)\r\n{\r\n   return argument_flag{ name, '\\0', help };\r\n}\r\n\r\ntemplate <typename... Args>\r\nstruct parser\r\n{\r\n   using args_type = std::tuple<typename Args::arg_type...>;\r\n\r\n   parser(Args&&... args)\r\n      : args_{ std::forward<Args>(args)... }\r\n   {\r\n      \/\/ make lookup tables.\r\n   }\r\n\r\n   void parse(std::vector<std::string> const& args) {\r\n      if (args.empty())\r\n         throw std::runtime_error(\"argument must be at least one item(s).\");\r\n\r\n      progname_ = args[0];\r\n\r\n      for (auto it = args.begin(); it != args.end(); ++it)\r\n      {\r\n         auto& arg = *it;\r\n         if (arg.substr(0,2)==\"--\") { \/\/ long option\r\n            std::string::size_type pos = arg.find('=',2);\r\n            if (pos==std::string::npos) {\r\n               std::string key = arg.substr(2);\r\n               if (lookup_.count(key) == 0)\r\n                  throw std::runtime_error(\"unknown option: --\" + key);\r\n               argument_base& a = lookup_.at(key).get();\r\n               if (a.with_value()) {\r\n                  \/\/ read next argument\r\n                  ++it;\r\n                  std::string val = *it;\r\n                  a.assign(val);\r\n               }\r\n               else {\r\n                  a.store_true();\r\n               }\r\n            }\r\n            else {\r\n               std::string key = arg.substr(2, pos);\r\n               std::string val = arg.substr(pos+1);\r\n               argument_base& a = lookup_.at(key).get();\r\n               if (a.with_value()) {\r\n                  a.assign(val);\r\n               }\r\n               else {\r\n                  a.store_true();\r\n               }\r\n            }\r\n         }\r\n         else if (arg[0] == '-') { \/\/ short option\r\n            if (arg.length() < 2) continue;\r\n            char s = arg[1];\r\n            if (short_lookup_.count(s) == 0)\r\n               throw std::runtime_error(std::string(\"unknown short option: -\") + s);\r\n            argument_base& a = short_lookup_.at(s).get();\r\n            if (a.with_value()) {\r\n               ++it;\r\n               std::string val = *it;\r\n               a.assign(val);\r\n            } else {\r\n               a.store_true();\r\n            }\r\n         }\r\n         else { \/\/ normal argument\r\n            remains_.push_back(arg);\r\n         }\r\n      }\r\n   }\r\n\r\n   std::string const& progname() const { return progname_; }\r\n   args_type const& options() const { return options_; }\r\n   std::vector<std::string> const& remains() const { return remains_; }\r\n\r\nprivate:\r\n   std::tuple<Args...> args_;\r\n   std::unordered_map<std::string, std::reference_wrapper<argument_base>> lookup_;\r\n   std::unordered_map<char,        std::reference_wrapper<argument_base>> short_lookup_;\r\n\r\n   std::string progname_;\r\n   args_type options_;\r\n   std::vector<std::string> remains_;\r\n};\r\n\r\ntemplate <typename... Args>\r\nparser<Args...> make_parser(Args&&... args) {\r\n   return parser<Args...>{ std::forward<Args>(args)... };\r\n}\r\n\r\n} \/\/ namespace argparse;\r\n<commit_msg>implement: construction of lookup table<commit_after>#pragma once\r\n\r\n#include <string>\r\n#include <vector>\r\n#include <tuple>\r\n#include <sstream>\r\n#include <type_traits>\r\n#include <functional>\r\n#include <memory>\r\n#include <unordered_map>\r\n\r\nnamespace argparse {\r\n\r\nnamespace detail {\r\n    template <typename In, typename Out, bool pass = std::is_convertible<In, Out>::value>\r\n    struct lexical_cast_t;\r\n\r\n    template <typename In, typename Out>\r\n    struct lexical_cast_t<In, Out, true> {\r\n        static Out apply(In const& val) {\r\n            return static_cast<Out>(val);\r\n        }\r\n    };\r\n\r\n    template <typename In>\r\n    struct lexical_cast_t<In, std::string, false> {\r\n        static std::string apply(In const& val) {\r\n            std::ostringstream osstr;\r\n            osstr << val;\r\n            return osstr.str();\r\n        }\r\n    };\r\n\r\n    template <typename Out>\r\n    struct lexical_cast_t<std::string, Out, false> {\r\n        static Out apply(std::string const& val) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n\r\n    template <typename Out, std::size_t N>\r\n    struct lexical_cast_t<char[N], Out, false> {\r\n        static Out apply(char const (&val)[N]) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n\r\n    template <typename Out, std::size_t N>\r\n    struct lexical_cast_t<char const[N], Out, false> {\r\n        static Out apply(char const (&val)[N]) {\r\n            std::istringstream isstr(val);\r\n            Out out;\r\n            isstr >> out;\r\n            return out;\r\n        }\r\n    };\r\n} \/\/ namespace detail;\r\n\r\ntemplate <typename Out, typename In>\r\ninline Out lexical_cast(In const& val) {\r\n    return detail::lexical_cast_t<In, Out>::apply(val);\r\n}\r\n\r\n\/\/\r\n\r\nstruct argument_base {\r\n   virtual void assign(std::string const& src) = 0;\r\n   virtual void store_true() = 0;\r\n   virtual bool with_value() const = 0;\r\n\r\n   argument_base(std::string const& name, char short_name,\r\n                 std::string const& help)\r\n     : name_{name}, short_name_{short_name}, help_{help}\r\n  {\r\n  }\r\n\r\n   std::string const& name() const { return name_; }\r\n   char short_name() const { return short_name_; }\r\n\r\nprivate:\r\n   std::string name_;\r\n   char short_name_;\r\n   std::string help_;\r\n};\r\n\r\ntemplate <typename T>\r\nstruct argument_with_value : public argument_base {\r\n   using arg_type = T;\r\n\r\n   argument_with_value(std::string const& name, char short_name,\r\n                       std::string const& help)\r\n      : argument_base{name, short_name, help}\r\n   {\r\n   }\r\n\r\n   void assign(std::string const& src) override {\r\n      val_.reset(new T(lexical_cast<T>(src)));\r\n   }\r\n\r\n   void store_true() override { \/* do nothing. *\/ }\r\n   bool with_value() const override { return true; }\r\n\r\nprivate:\r\n   std::unique_ptr<T> val_;\r\n};\r\n\r\nstruct argument_flag : public argument_base {\r\n   using arg_type = bool;\r\n\r\n   argument_flag(std::string const& name, char short_name,\r\n            std::string const& help)\r\n      : argument_base{ name, short_name, help }\r\n   {\r\n   }\r\n\r\n   void assign(std::string const&) override { \/* do nothing. *\/ }\r\n   void store_true() override { val_ = true; }\r\n   bool with_value() const override { return false; }\r\n\r\nprivate:\r\n   bool val_ = false;\r\n};\r\n\r\n\r\ntemplate <typename T>\r\ninline argument_with_value<T> arg(std::string const& name, char short_name = '\\0',\r\n                                  std::string const& help = \"\")\r\n{\r\n   return argument_with_value<T>{ name, short_name, help };\r\n}\r\n\r\ntemplate <typename T>\r\ninline argument_with_value<T> arg(std::string const& name, std::string const& help)\r\n{\r\n   return argument_with_value<T>{ name, '\\0', help };\r\n}\r\n\r\ninline argument_flag flag(std::string const& name, char short_name = '\\0',\r\n                          std::string const& help = \"\")\r\n{\r\n   return argument_flag{ name, short_name, help };\r\n}\r\n\r\ninline argument_flag flag(std::string const& name, std::string const& help)\r\n{\r\n   return argument_flag{ name, '\\0', help };\r\n}\r\n\r\ntemplate <std::size_t... Idx>\r\nstruct index_sequence {\r\n   using next = index_sequence<Idx..., sizeof...(Idx)>;\r\n};\r\n\r\ntemplate <std::size_t Nt, std::size_t N>\r\nstruct iota {\r\n   using type = typename iota<Nt-1, N-1>::type::next;\r\n};\r\n\r\ntemplate <std::size_t Nt>\r\nstruct iota<Nt, 0> {\r\n   using type = index_sequence<>;\r\n};\r\n\r\ntemplate <std::size_t N>\r\nusing make_index_sequence = typename iota<N, N>::type;\r\n\r\ntemplate <typename... T> inline void dummy(T...) {}\r\n\r\n\r\ntemplate <typename... Args>\r\nstruct parser\r\n{\r\n   using args_type = std::tuple<typename Args::arg_type...>;\r\n\r\n   parser(Args&&... args)\r\n      : args_{ std::forward<Args>(args)... }\r\n   {\r\n      make_lookup_tables(args_, make_index_sequence<sizeof...(Args)>());\r\n   }\r\n\r\n   template <typename Tuple, std::size_t... Idx>\r\n   void make_lookup_tables(Tuple& args, index_sequence<Idx...>) {\r\n      dummy( append_to_lookup_table(std::get<Idx>(args))... );\r\n   }\r\n\r\n   template <typename Arg>\r\n   int append_to_lookup_table(Arg& arg) {\r\n      std::string const& name = arg.name();\r\n      lookup_.insert({ name, static_cast<argument_base&>(arg) });\r\n\r\n      char s = arg.short_name();\r\n      if (s != '\\0')\r\n         short_lookup_.insert({ s, static_cast<argument_base&>(arg) });\r\n\r\n      return 0;\r\n   }\r\n\r\n   void parse(std::vector<std::string> const& args) {\r\n      if (args.empty())\r\n         throw std::runtime_error(\"argument must be at least one item(s).\");\r\n\r\n      progname_ = args[0];\r\n\r\n      for (auto it = args.begin(); it != args.end(); ++it)\r\n      {\r\n         auto& arg = *it;\r\n         if (arg.substr(0,2)==\"--\") { \/\/ long option\r\n            std::string::size_type pos = arg.find('=',2);\r\n            if (pos==std::string::npos) {\r\n               std::string key = arg.substr(2);\r\n               if (lookup_.count(key) == 0)\r\n                  throw std::runtime_error(\"unknown option: --\" + key);\r\n               argument_base& a = lookup_.at(key).get();\r\n               if (a.with_value()) {\r\n                  \/\/ read next argument\r\n                  ++it;\r\n                  std::string val = *it;\r\n                  a.assign(val);\r\n               }\r\n               else {\r\n                  a.store_true();\r\n               }\r\n            }\r\n            else {\r\n               std::string key = arg.substr(2, pos);\r\n               std::string val = arg.substr(pos+1);\r\n               argument_base& a = lookup_.at(key).get();\r\n               if (a.with_value()) {\r\n                  a.assign(val);\r\n               }\r\n               else {\r\n                  a.store_true();\r\n               }\r\n            }\r\n         }\r\n         else if (arg[0] == '-') { \/\/ short option\r\n            if (arg.length() < 2) continue;\r\n            char s = arg[1];\r\n            if (short_lookup_.count(s) == 0)\r\n               throw std::runtime_error(std::string(\"unknown short option: -\") + s);\r\n            argument_base& a = short_lookup_.at(s).get();\r\n            if (a.with_value()) {\r\n               ++it;\r\n               std::string val = *it;\r\n               a.assign(val);\r\n            } else {\r\n               a.store_true();\r\n            }\r\n         }\r\n         else { \/\/ normal argument\r\n            remains_.push_back(arg);\r\n         }\r\n      }\r\n   }\r\n\r\n   std::string const& progname() const { return progname_; }\r\n   args_type const& options() const { return options_; }\r\n   std::vector<std::string> const& remains() const { return remains_; }\r\n\r\nprivate:\r\n   std::tuple<Args...> args_;\r\n   std::unordered_map<std::string, std::reference_wrapper<argument_base>> lookup_;\r\n   std::unordered_map<char,        std::reference_wrapper<argument_base>> short_lookup_;\r\n\r\n   std::string progname_;\r\n   args_type options_;\r\n   std::vector<std::string> remains_;\r\n};\r\n\r\ntemplate <typename... Args>\r\nparser<Args...> make_parser(Args&&... args) {\r\n   return parser<Args...>{ std::forward<Args>(args)... };\r\n}\r\n\r\n} \/\/ namespace argparse;\r\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\/*\n  Get hostname for an IP.  Hostnames are checked with reverse name lookup and\n  checked that they doesn't resemble an ip.\n*\/\n\n#include \"mysql_priv.h\"\n#include \"hash_filo.h\"\n#include <m_ctype.h>\n#ifdef\t__cplusplus\nextern \"C\" {\t\t\t\t\t\/\/ Because of SCO 3.2V4.2\n#endif\n#if !defined( __WIN__) && !defined(OS2)\n#ifdef HAVE_SYS_UN_H\n#include <sys\/un.h>\n#endif\n#include <netdb.h>\n#include <sys\/utsname.h>\n#endif \/\/ __WIN__\n#ifdef\t__cplusplus\n}\n#endif\n\n\nclass host_entry :public hash_filo_element\n{\npublic:\n  char\t ip[sizeof(((struct in_addr *) 0)->s_addr)];\n  uint\t errors;\n  char\t *hostname;\n};\n\nstatic hash_filo *hostname_cache;\nstatic pthread_mutex_t LOCK_hostname;\n\nvoid hostname_cache_refresh()\n{\n  hostname_cache->clear();\n}\n\nbool hostname_cache_init()\n{\n  host_entry tmp;\n  uint offset= (uint) ((char*) (&tmp.ip) - (char*) &tmp);\n  if (!(hostname_cache=new hash_filo(HOST_CACHE_SIZE, offset,\n\t\t\t\t     sizeof(struct in_addr),NULL,\n\t\t\t\t     (hash_free_key) free,\n\t\t\t\t     &my_charset_latin1)))\n    return 1;\n  hostname_cache->clear();\n  (void) pthread_mutex_init(&LOCK_hostname,MY_MUTEX_INIT_SLOW);\n  return 0;\n}\n\nvoid hostname_cache_free()\n{\n  if (hostname_cache)\n  {\n    (void) pthread_mutex_destroy(&LOCK_hostname);\n    delete hostname_cache;\n    hostname_cache= 0;\n  }\n}\n\n\nstatic void add_hostname(struct in_addr *in,const char *name)\n{\n  if (!(specialflag & SPECIAL_NO_HOST_CACHE))\n  {\n    VOID(pthread_mutex_lock(&hostname_cache->lock));\n    host_entry *entry;\n    if (!(entry=(host_entry*) hostname_cache->search((gptr) &in->s_addr,0)))\n    {\n      uint length=name ? (uint) strlen(name) : 0;\n\n      if ((entry=(host_entry*) malloc(sizeof(host_entry)+length+1)))\n      {\n\tchar *new_name;\n\tmemcpy_fixed(&entry->ip, &in->s_addr, sizeof(in->s_addr));\n\tif (length)\n\t  memcpy(new_name= (char *) (entry+1), name, length+1);\n\telse\n\t  new_name=0;\n\tentry->hostname=new_name;\n\tentry->errors=0;\n\t(void) hostname_cache->add(entry);\n      }\n    }\n    VOID(pthread_mutex_unlock(&hostname_cache->lock));\n  }\n}\n\n\ninline void add_wrong_ip(struct in_addr *in)\n{\n  add_hostname(in,NullS);\n}\n\nvoid inc_host_errors(struct in_addr *in)\n{\n  VOID(pthread_mutex_lock(&hostname_cache->lock));\n  host_entry *entry;\n  if ((entry=(host_entry*) hostname_cache->search((gptr) &in->s_addr,0)))\n    entry->errors++;\n  VOID(pthread_mutex_unlock(&hostname_cache->lock));\n}\n\nvoid reset_host_errors(struct in_addr *in)\n{\n  VOID(pthread_mutex_lock(&hostname_cache->lock));\n  host_entry *entry;\n  if ((entry=(host_entry*) hostname_cache->search((gptr) &in->s_addr,0)))\n    entry->errors=0;\n  VOID(pthread_mutex_unlock(&hostname_cache->lock));\n}\n\n\/* Deal with systems that don't defined INADDR_LOOPBACK *\/\n#ifndef INADDR_LOOPBACK\n#define INADDR_LOOPBACK 0x7f000001UL\n#endif\n\nmy_string ip_to_hostname(struct in_addr *in, uint *errors)\n{\n  uint i;\n  host_entry *entry;\n  DBUG_ENTER(\"ip_to_hostname\");\n  *errors=0;\n\n  \/* We always treat the loopback address as \"localhost\". *\/\n  if (in->s_addr == INADDR_LOOPBACK)\n    return (char *)my_localhost;\n\n  \/* Check first if we have name in cache *\/\n  if (!(specialflag & SPECIAL_NO_HOST_CACHE))\n  {\n    VOID(pthread_mutex_lock(&hostname_cache->lock));\n    if ((entry=(host_entry*) hostname_cache->search((gptr) &in->s_addr,0)))\n    {\n      char *name;\n      if (!entry->hostname)\n\tname=0;\t\t\t\t\t\/\/ Don't allow connection\n      else\n\tname=my_strdup(entry->hostname,MYF(0));\n      *errors= entry->errors;\n      VOID(pthread_mutex_unlock(&hostname_cache->lock));\n      DBUG_RETURN(name);\n    }\n    VOID(pthread_mutex_unlock(&hostname_cache->lock));\n  }\n\n  struct hostent *hp, *check;\n  char *name;\n  LINT_INIT(check);\n#if defined(HAVE_GETHOSTBYADDR_R) && defined(HAVE_SOLARIS_STYLE_GETHOST)\n  char buff[GETHOSTBYADDR_BUFF_SIZE],buff2[GETHOSTBYNAME_BUFF_SIZE];\n  int tmp_errno;\n  struct hostent tmp_hostent, tmp_hostent2;\n#ifdef HAVE_purify\n  bzero(buff,sizeof(buff));\t\t\/\/ Bug in purify\n#endif\n  if (!(hp=gethostbyaddr_r((char*) in,sizeof(*in),\n\t\t\t   AF_INET,\n\t\t\t   &tmp_hostent,buff,sizeof(buff),&tmp_errno)))\n  {\n    DBUG_PRINT(\"error\",(\"gethostbyaddr_r returned %d\",tmp_errno));\n    return 0;\n  }\n  if (!(check=my_gethostbyname_r(hp->h_name,&tmp_hostent2,buff2,sizeof(buff2),\n\t\t\t\t &tmp_errno)))\n  {\n    DBUG_PRINT(\"error\",(\"gethostbyname_r returned %d\",tmp_errno));\n    \/*\n      Don't cache responses when the DSN server is down, as otherwise\n      transient DNS failure may leave any number of clients (those\n      that attempted to connect during the outage) unable to connect\n      indefinitely.\n    *\/\n    if (tmp_errno == HOST_NOT_FOUND || tmp_errno == NO_DATA)\n      add_wrong_ip(in);\n    my_gethostbyname_r_free();\n    DBUG_RETURN(0);\n  }\n  if (!hp->h_name[0])\n  {\n    DBUG_PRINT(\"error\",(\"Got an empty hostname\"));\n    add_wrong_ip(in);\n    my_gethostbyname_r_free();\n    DBUG_RETURN(0);\t\t\t\t\/\/ Don't allow empty hostnames\n  }\n  if (!(name=my_strdup(hp->h_name,MYF(0))))\n  {\n    my_gethostbyname_r_free();\n    DBUG_RETURN(0);\t\t\t\t\/\/ out of memory\n  }\n  my_gethostbyname_r_free();\n#else\n  VOID(pthread_mutex_lock(&LOCK_hostname));\n  if (!(hp=gethostbyaddr((char*) in,sizeof(*in), AF_INET)))\n  {\n    VOID(pthread_mutex_unlock(&LOCK_hostname));\n    DBUG_PRINT(\"error\",(\"gethostbyaddr returned %d\",errno));\n\n    if (errno == HOST_NOT_FOUND || errno == NO_DATA)\n      goto add_wrong_ip_and_return;\n    \/* Failure, don't cache responce *\/\n    DBUG_RETURN(0);\n  }\n  if (!hp->h_name[0])\t\t\t\t\/\/ Don't allow empty hostnames\n  {\n    VOID(pthread_mutex_unlock(&LOCK_hostname));\n    DBUG_PRINT(\"error\",(\"Got an empty hostname\"));\n    goto add_wrong_ip_and_return;\n  }\n  if (!(name=my_strdup(hp->h_name,MYF(0))))\n  {\n    VOID(pthread_mutex_unlock(&LOCK_hostname));\n    DBUG_RETURN(0);\t\t\t\t\/\/ out of memory\n  }\n  check=gethostbyname(name);\n  VOID(pthread_mutex_unlock(&LOCK_hostname));\n  if (!check)\n  {\n    DBUG_PRINT(\"error\",(\"gethostbyname returned %d\",errno));\n    my_free(name,MYF(0));\n    DBUG_RETURN(0);\n  }\n#endif\n\n  \/* Don't accept hostnames that starts with digits because they may be\n     false ip:s *\/\n  if (my_isdigit(&my_charset_latin1,name[0]))\n  {\n    char *pos;\n    for (pos= name+1 ; my_isdigit(&my_charset_latin1,*pos); pos++) ;\n    if (*pos == '.')\n    {\n      DBUG_PRINT(\"error\",(\"mysqld doesn't accept hostnames that starts with a number followed by a '.'\"));\n      my_free(name,MYF(0));\n      goto add_wrong_ip_and_return;\n    }\n  }\n\n  \/* Check that 'gethostbyname' returned the used ip *\/\n  for (i=0; check->h_addr_list[i]; i++)\n  {\n    if (*(uint32*)(check->h_addr_list)[i] == in->s_addr)\n    {\n      add_hostname(in,name);\n      DBUG_RETURN(name);\n    }\n  }\n  DBUG_PRINT(\"error\",(\"Couldn't verify hostname with gethostbyname\"));\n  my_free(name,MYF(0));\n\nadd_wrong_ip_and_return:\n  add_wrong_ip(in);\n  DBUG_RETURN(0);\n}\n<commit_msg>Fix shortcircuit of 127.0.0.1 -> localhost lookup on little-endian machines. (Bug #11822)<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\/*\n  Get hostname for an IP.  Hostnames are checked with reverse name lookup and\n  checked that they doesn't resemble an ip.\n*\/\n\n#include \"mysql_priv.h\"\n#include \"hash_filo.h\"\n#include <m_ctype.h>\n#ifdef\t__cplusplus\nextern \"C\" {\t\t\t\t\t\/\/ Because of SCO 3.2V4.2\n#endif\n#if !defined( __WIN__) && !defined(OS2)\n#ifdef HAVE_SYS_UN_H\n#include <sys\/un.h>\n#endif\n#include <netdb.h>\n#include <sys\/utsname.h>\n#endif \/\/ __WIN__\n#ifdef\t__cplusplus\n}\n#endif\n\n\nclass host_entry :public hash_filo_element\n{\npublic:\n  char\t ip[sizeof(((struct in_addr *) 0)->s_addr)];\n  uint\t errors;\n  char\t *hostname;\n};\n\nstatic hash_filo *hostname_cache;\nstatic pthread_mutex_t LOCK_hostname;\n\nvoid hostname_cache_refresh()\n{\n  hostname_cache->clear();\n}\n\nbool hostname_cache_init()\n{\n  host_entry tmp;\n  uint offset= (uint) ((char*) (&tmp.ip) - (char*) &tmp);\n  if (!(hostname_cache=new hash_filo(HOST_CACHE_SIZE, offset,\n\t\t\t\t     sizeof(struct in_addr),NULL,\n\t\t\t\t     (hash_free_key) free,\n\t\t\t\t     &my_charset_latin1)))\n    return 1;\n  hostname_cache->clear();\n  (void) pthread_mutex_init(&LOCK_hostname,MY_MUTEX_INIT_SLOW);\n  return 0;\n}\n\nvoid hostname_cache_free()\n{\n  if (hostname_cache)\n  {\n    (void) pthread_mutex_destroy(&LOCK_hostname);\n    delete hostname_cache;\n    hostname_cache= 0;\n  }\n}\n\n\nstatic void add_hostname(struct in_addr *in,const char *name)\n{\n  if (!(specialflag & SPECIAL_NO_HOST_CACHE))\n  {\n    VOID(pthread_mutex_lock(&hostname_cache->lock));\n    host_entry *entry;\n    if (!(entry=(host_entry*) hostname_cache->search((gptr) &in->s_addr,0)))\n    {\n      uint length=name ? (uint) strlen(name) : 0;\n\n      if ((entry=(host_entry*) malloc(sizeof(host_entry)+length+1)))\n      {\n\tchar *new_name;\n\tmemcpy_fixed(&entry->ip, &in->s_addr, sizeof(in->s_addr));\n\tif (length)\n\t  memcpy(new_name= (char *) (entry+1), name, length+1);\n\telse\n\t  new_name=0;\n\tentry->hostname=new_name;\n\tentry->errors=0;\n\t(void) hostname_cache->add(entry);\n      }\n    }\n    VOID(pthread_mutex_unlock(&hostname_cache->lock));\n  }\n}\n\n\ninline void add_wrong_ip(struct in_addr *in)\n{\n  add_hostname(in,NullS);\n}\n\nvoid inc_host_errors(struct in_addr *in)\n{\n  VOID(pthread_mutex_lock(&hostname_cache->lock));\n  host_entry *entry;\n  if ((entry=(host_entry*) hostname_cache->search((gptr) &in->s_addr,0)))\n    entry->errors++;\n  VOID(pthread_mutex_unlock(&hostname_cache->lock));\n}\n\nvoid reset_host_errors(struct in_addr *in)\n{\n  VOID(pthread_mutex_lock(&hostname_cache->lock));\n  host_entry *entry;\n  if ((entry=(host_entry*) hostname_cache->search((gptr) &in->s_addr,0)))\n    entry->errors=0;\n  VOID(pthread_mutex_unlock(&hostname_cache->lock));\n}\n\n\/* Deal with systems that don't defined INADDR_LOOPBACK *\/\n#ifndef INADDR_LOOPBACK\n#define INADDR_LOOPBACK 0x7f000001UL\n#endif\n\nmy_string ip_to_hostname(struct in_addr *in, uint *errors)\n{\n  uint i;\n  host_entry *entry;\n  DBUG_ENTER(\"ip_to_hostname\");\n  *errors=0;\n\n  \/* We always treat the loopback address as \"localhost\". *\/\n  if (in->s_addr == htonl(INADDR_LOOPBACK))\n    DBUG_RETURN((char *)my_localhost);\n\n  \/* Check first if we have name in cache *\/\n  if (!(specialflag & SPECIAL_NO_HOST_CACHE))\n  {\n    VOID(pthread_mutex_lock(&hostname_cache->lock));\n    if ((entry=(host_entry*) hostname_cache->search((gptr) &in->s_addr,0)))\n    {\n      char *name;\n      if (!entry->hostname)\n\tname=0;\t\t\t\t\t\/\/ Don't allow connection\n      else\n\tname=my_strdup(entry->hostname,MYF(0));\n      *errors= entry->errors;\n      VOID(pthread_mutex_unlock(&hostname_cache->lock));\n      DBUG_RETURN(name);\n    }\n    VOID(pthread_mutex_unlock(&hostname_cache->lock));\n  }\n\n  struct hostent *hp, *check;\n  char *name;\n  LINT_INIT(check);\n#if defined(HAVE_GETHOSTBYADDR_R) && defined(HAVE_SOLARIS_STYLE_GETHOST)\n  char buff[GETHOSTBYADDR_BUFF_SIZE],buff2[GETHOSTBYNAME_BUFF_SIZE];\n  int tmp_errno;\n  struct hostent tmp_hostent, tmp_hostent2;\n#ifdef HAVE_purify\n  bzero(buff,sizeof(buff));\t\t\/\/ Bug in purify\n#endif\n  if (!(hp=gethostbyaddr_r((char*) in,sizeof(*in),\n\t\t\t   AF_INET,\n\t\t\t   &tmp_hostent,buff,sizeof(buff),&tmp_errno)))\n  {\n    DBUG_PRINT(\"error\",(\"gethostbyaddr_r returned %d\",tmp_errno));\n    return 0;\n  }\n  if (!(check=my_gethostbyname_r(hp->h_name,&tmp_hostent2,buff2,sizeof(buff2),\n\t\t\t\t &tmp_errno)))\n  {\n    DBUG_PRINT(\"error\",(\"gethostbyname_r returned %d\",tmp_errno));\n    \/*\n      Don't cache responses when the DSN server is down, as otherwise\n      transient DNS failure may leave any number of clients (those\n      that attempted to connect during the outage) unable to connect\n      indefinitely.\n    *\/\n    if (tmp_errno == HOST_NOT_FOUND || tmp_errno == NO_DATA)\n      add_wrong_ip(in);\n    my_gethostbyname_r_free();\n    DBUG_RETURN(0);\n  }\n  if (!hp->h_name[0])\n  {\n    DBUG_PRINT(\"error\",(\"Got an empty hostname\"));\n    add_wrong_ip(in);\n    my_gethostbyname_r_free();\n    DBUG_RETURN(0);\t\t\t\t\/\/ Don't allow empty hostnames\n  }\n  if (!(name=my_strdup(hp->h_name,MYF(0))))\n  {\n    my_gethostbyname_r_free();\n    DBUG_RETURN(0);\t\t\t\t\/\/ out of memory\n  }\n  my_gethostbyname_r_free();\n#else\n  VOID(pthread_mutex_lock(&LOCK_hostname));\n  if (!(hp=gethostbyaddr((char*) in,sizeof(*in), AF_INET)))\n  {\n    VOID(pthread_mutex_unlock(&LOCK_hostname));\n    DBUG_PRINT(\"error\",(\"gethostbyaddr returned %d\",errno));\n\n    if (errno == HOST_NOT_FOUND || errno == NO_DATA)\n      goto add_wrong_ip_and_return;\n    \/* Failure, don't cache responce *\/\n    DBUG_RETURN(0);\n  }\n  if (!hp->h_name[0])\t\t\t\t\/\/ Don't allow empty hostnames\n  {\n    VOID(pthread_mutex_unlock(&LOCK_hostname));\n    DBUG_PRINT(\"error\",(\"Got an empty hostname\"));\n    goto add_wrong_ip_and_return;\n  }\n  if (!(name=my_strdup(hp->h_name,MYF(0))))\n  {\n    VOID(pthread_mutex_unlock(&LOCK_hostname));\n    DBUG_RETURN(0);\t\t\t\t\/\/ out of memory\n  }\n  check=gethostbyname(name);\n  VOID(pthread_mutex_unlock(&LOCK_hostname));\n  if (!check)\n  {\n    DBUG_PRINT(\"error\",(\"gethostbyname returned %d\",errno));\n    my_free(name,MYF(0));\n    DBUG_RETURN(0);\n  }\n#endif\n\n  \/* Don't accept hostnames that starts with digits because they may be\n     false ip:s *\/\n  if (my_isdigit(&my_charset_latin1,name[0]))\n  {\n    char *pos;\n    for (pos= name+1 ; my_isdigit(&my_charset_latin1,*pos); pos++) ;\n    if (*pos == '.')\n    {\n      DBUG_PRINT(\"error\",(\"mysqld doesn't accept hostnames that starts with a number followed by a '.'\"));\n      my_free(name,MYF(0));\n      goto add_wrong_ip_and_return;\n    }\n  }\n\n  \/* Check that 'gethostbyname' returned the used ip *\/\n  for (i=0; check->h_addr_list[i]; i++)\n  {\n    if (*(uint32*)(check->h_addr_list)[i] == in->s_addr)\n    {\n      add_hostname(in,name);\n      DBUG_RETURN(name);\n    }\n  }\n  DBUG_PRINT(\"error\",(\"Couldn't verify hostname with gethostbyname\"));\n  my_free(name,MYF(0));\n\nadd_wrong_ip_and_return:\n  add_wrong_ip(in);\n  DBUG_RETURN(0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- mlir-opt.cpp - MLIR Optimizer Driver -------------------------------===\/\/\n\/\/\n\/\/ Copyright 2019 The MLIR 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\/\/ This is a command line utility that parses an MLIR file, runs an optimization\n\/\/ pass, then prints the result back out.  It is designed to support unit\n\/\/ testing.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"mlir\/Analysis\/Passes.h\"\n#include \"mlir\/IR\/Attributes.h\"\n#include \"mlir\/IR\/CFGFunction.h\"\n#include \"mlir\/IR\/Location.h\"\n#include \"mlir\/IR\/MLFunction.h\"\n#include \"mlir\/IR\/MLIRContext.h\"\n#include \"mlir\/IR\/Module.h\"\n#include \"mlir\/Parser.h\"\n#include \"mlir\/Pass.h\"\n#include \"mlir\/Support\/PassNameParser.h\"\n#include \"mlir\/TensorFlow\/ControlFlowOps.h\"\n#include \"mlir\/TensorFlow\/Passes.h\"\n#include \"mlir\/TensorFlowLite\/Passes.h\"\n#include \"mlir\/Transforms\/CFGFunctionViewGraph.h\"\n#include \"mlir\/Transforms\/Passes.h\"\n#include \"mlir\/XLA\/Passes.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileUtilities.h\"\n#include \"llvm\/Support\/InitLLVM.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/Regex.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/ToolOutputFile.h\"\n\nusing namespace mlir;\nusing namespace llvm;\nusing llvm::SMLoc;\n\nstatic cl::opt<std::string>\ninputFilename(cl::Positional, cl::desc(\"<input file>\"), cl::init(\"-\"));\n\nstatic cl::opt<std::string>\noutputFilename(\"o\", cl::desc(\"Output filename\"), cl::value_desc(\"filename\"),\n               cl::init(\"-\"));\n\nstatic cl::opt<bool>\n    splitInputFile(\"split-input-file\",\n                   cl::desc(\"Split the input file into pieces and process each \"\n                            \"chunk independently\"),\n                   cl::init(false));\n\nstatic cl::opt<bool>\n    verifyDiagnostics(\"verify\",\n                      cl::desc(\"Check that emitted diagnostics match \"\n                               \"expected-* lines on the corresponding line\"),\n                      cl::init(false));\n\nstatic std::vector<const mlir::PassInfo *> *passList;\n\nenum OptResult { OptSuccess, OptFailure };\n\n\/\/\/ Open the specified output file and return it, exiting if there is any I\/O or\n\/\/\/ other errors.\nstatic std::unique_ptr<ToolOutputFile> getOutputStream() {\n  std::error_code error;\n  auto result =\n      llvm::make_unique<ToolOutputFile>(outputFilename, error, sys::fs::F_None);\n  if (error) {\n    llvm::errs() << error.message() << '\\n';\n    exit(1);\n  }\n\n  return result;\n}\n\n\/\/\/ Given a MemoryBuffer along with a line and column within it, return the\n\/\/\/ location being referenced.\nstatic SMLoc getLocFromLineAndCol(MemoryBuffer &membuf, unsigned lineNo,\n                                  unsigned columnNo) {\n  \/\/ TODO: This should really be upstreamed to be a method on llvm::SourceMgr.\n  \/\/ Doing so would allow it to use the offset cache that is already maintained\n  \/\/ by SrcBuffer, making this more efficient.\n\n  \/\/ Scan for the correct line number.\n  const char *position = membuf.getBufferStart();\n  const char *end = membuf.getBufferEnd();\n\n  \/\/ We start counting line and column numbers from 1.\n  --lineNo;\n  --columnNo;\n\n  while (position < end && lineNo) {\n    auto curChar = *position++;\n\n    \/\/ Scan for newlines.  If this isn't one, ignore it.\n    if (curChar != '\\r' && curChar != '\\n')\n      continue;\n\n    \/\/ We saw a line break, decrement our counter.\n    --lineNo;\n\n    \/\/ Check for \\r\\n and \\n\\r and treat it as a single escape.  We know that\n    \/\/ looking past one character is safe because MemoryBuffer's are always nul\n    \/\/ terminated.\n    if (*position != curChar && (*position == '\\r' || *position == '\\n'))\n      ++position;\n  }\n\n  \/\/ If the line\/column counter was invalid, return a pointer to the start of\n  \/\/ the buffer.\n  if (lineNo || position + columnNo > end)\n    return SMLoc::getFromPointer(membuf.getBufferStart());\n\n  \/\/ Otherwise return the right pointer.\n  return SMLoc::getFromPointer(position + columnNo);\n}\n\n\/\/\/ Perform the actions on the input file indicated by the command line flags\n\/\/\/ within the specified context.\n\/\/\/\n\/\/\/ This typically parses the main source file, runs zero or more optimization\n\/\/\/ passes, then prints the output.\n\/\/\/\nstatic OptResult performActions(SourceMgr &sourceMgr, MLIRContext *context) {\n  std::unique_ptr<Module> module(parseSourceFile(sourceMgr, context));\n  if (!module)\n    return OptFailure;\n\n  \/\/ Run each of the passes that were selected.\n  for (const auto *passInfo : *passList) {\n    std::unique_ptr<Pass> pass(passInfo->createPass());\n    PassResult result = pass->runOnModule(module.get());\n    if (result)\n      return OptFailure;\n\n    \/\/ Verify that the result of the pass is still valid.\n    if (module->verify())\n      return OptFailure;\n  }\n\n  \/\/ Print the output.\n  auto output = getOutputStream();\n  module->print(output->os());\n  output->keep();\n  return OptSuccess;\n}\n\n\/\/\/ Given a diagnostic kind, return a human readable string for it.\nstatic StringRef getDiagnosticKindString(MLIRContext::DiagnosticKind kind) {\n  switch (kind) {\n  case MLIRContext::DiagnosticKind::Note:\n    return \"note\";\n  case MLIRContext::DiagnosticKind::Warning:\n    return \"warning\";\n  case MLIRContext::DiagnosticKind::Error:\n    return \"error\";\n  }\n}\n\n\/\/\/ Parses the memory buffer.  If successfully, run a series of passes against\n\/\/\/ it and print the result.\nstatic OptResult processFile(std::unique_ptr<MemoryBuffer> ownedBuffer) {\n  \/\/ Tell sourceMgr about this buffer, which is what the parser will pick up.\n  SourceMgr sourceMgr;\n  auto &buffer = *ownedBuffer;\n  sourceMgr.AddNewSourceBuffer(std::move(ownedBuffer), SMLoc());\n\n  \/\/ Parse the input file.\n  MLIRContext context;\n\n  \/\/ If we are in verify mode then we have a lot of work to do, otherwise just\n  \/\/ perform the actions without worrying about it.\n  if (!verifyDiagnostics) {\n\n    \/\/ Register a simple diagnostic handler that prints out info with context.\n    context.registerDiagnosticHandler([&](Location location, StringRef message,\n                                          MLIRContext::DiagnosticKind kind) {\n      unsigned line = 1, column = 1;\n      if (auto fileLoc = location.dyn_cast<FileLineColLoc>()) {\n        line = fileLoc->getLine();\n        column = fileLoc->getColumn();\n      }\n\n      auto unexpectedLoc = getLocFromLineAndCol(buffer, line, column);\n      sourceMgr.PrintMessage(unexpectedLoc, SourceMgr::DK_Error, message);\n    });\n\n    \/\/ Run the test actions.\n    return performActions(sourceMgr, &context);\n  }\n\n  \/\/ Keep track of the result of this file processing.  If there are no issues,\n  \/\/ then we succeed.\n  auto result = OptSuccess;\n\n  \/\/ Record the expected diagnostic's position, substring and whether it was\n  \/\/ seen.\n  struct ExpectedDiag {\n    MLIRContext::DiagnosticKind kind;\n    unsigned lineNo;\n    StringRef substring;\n    SMLoc fileLoc;\n    bool matched = false;\n  };\n  SmallVector<ExpectedDiag, 2> expectedDiags;\n\n  \/\/ Error checker that verifies reported error was expected.\n  auto checker = [&](Location location, StringRef message,\n                     MLIRContext::DiagnosticKind kind) {\n    unsigned line = 1, column = 1;\n    if (auto fileLoc = location.dyn_cast<FileLineColLoc>()) {\n      line = fileLoc->getLine();\n      column = fileLoc->getColumn();\n    }\n\n    \/\/ If we find something that is close then emit a more specific error.\n    ExpectedDiag *nearMiss = nullptr;\n\n    \/\/ If this was an expected error, remember that we saw it and return.\n    for (auto &e : expectedDiags) {\n      if (line == e.lineNo && message.contains(e.substring)) {\n        if (e.kind == kind) {\n          e.matched = true;\n          return;\n        }\n\n        \/\/ If this only differs based on the diagnostic kind, then consider it\n        \/\/ to be a near miss.\n        nearMiss = &e;\n      }\n    }\n\n    \/\/ If there was a near miss, emit a specific diagnostic.\n    if (nearMiss) {\n      sourceMgr.PrintMessage(nearMiss->fileLoc, SourceMgr::DK_Error,\n                             \"'\" + getDiagnosticKindString(kind) +\n                                 \"' diagnostic emitted when expecting a '\" +\n                                 getDiagnosticKindString(nearMiss->kind) + \"'\");\n      result = OptFailure;\n      return;\n    }\n\n    \/\/ If this error wasn't expected, produce an error out of mlir-opt saying\n    \/\/ so.\n    auto unexpectedLoc = getLocFromLineAndCol(buffer, line, column);\n    sourceMgr.PrintMessage(unexpectedLoc, SourceMgr::DK_Error,\n                           \"unexpected error: \" + Twine(message));\n    result = OptFailure;\n  };\n\n  \/\/ Scan the file for expected-* designators and register a callback for the\n  \/\/ error handler.\n  \/\/ Extract the expected errors from the file.\n  llvm::Regex expected(\n      \"expected-(error|note|warning) *(@[+-][0-9]+)? *{{(.*)}}\");\n  SmallVector<StringRef, 100> lines;\n  buffer.getBuffer().split(lines, '\\n');\n  for (unsigned lineNo = 0, e = lines.size(); lineNo < e; ++lineNo) {\n    SmallVector<StringRef, 3> matches;\n    if (expected.match(lines[lineNo], &matches)) {\n      \/\/ Point to the start of expected-*.\n      SMLoc expectedStart = SMLoc::getFromPointer(matches[0].data());\n\n      MLIRContext::DiagnosticKind kind;\n      if (matches[1] == \"error\")\n        kind = MLIRContext::DiagnosticKind::Error;\n      else if (matches[1] == \"warning\")\n        kind = MLIRContext::DiagnosticKind::Warning;\n      else {\n        assert(matches[1] == \"note\");\n        kind = MLIRContext::DiagnosticKind::Note;\n      }\n\n      ExpectedDiag record{kind, lineNo + 1, matches[3], expectedStart, false};\n      auto offsetMatch = matches[2];\n      if (!offsetMatch.empty()) {\n        int offset;\n        \/\/ Get the integer value without the @ and +\/- prefix.\n        if (!offsetMatch.drop_front(2).getAsInteger(0, offset)) {\n          if (offsetMatch[1] == '+')\n            record.lineNo += offset;\n          else\n            record.lineNo -= offset;\n        }\n      }\n      expectedDiags.push_back(record);\n    }\n  }\n\n  \/\/ Finally, register the error handler to capture them.\n  context.registerDiagnosticHandler(checker);\n\n  \/\/ Do any processing requested by command line flags.  We don't care whether\n  \/\/ these actions succeed or fail, we only care what diagnostics they produce\n  \/\/ and whether they match our expectations.\n  performActions(sourceMgr, &context);\n\n  \/\/ Verify that all expected errors were seen.\n  for (auto &err : expectedDiags) {\n    if (!err.matched) {\n      SMRange range(err.fileLoc,\n                    SMLoc::getFromPointer(err.fileLoc.getPointer() +\n                                          err.substring.size()));\n      auto kind = getDiagnosticKindString(err.kind);\n      sourceMgr.PrintMessage(err.fileLoc, SourceMgr::DK_Error,\n                             \"expected \" + kind + \" \\\"\" + err.substring +\n                                 \"\\\" was not produced\",\n                             range);\n      result = OptFailure;\n    }\n  }\n\n  return result;\n}\n\n\/\/\/ Split the specified file on a marker and process each chunk independently\n\/\/\/ according to the normal processFile logic.  This is primarily used to\n\/\/\/ allow a large number of small independent parser tests to be put into a\n\/\/\/ single test, but could be used for other purposes as well.\nstatic OptResult\nsplitAndProcessFile(std::unique_ptr<MemoryBuffer> originalBuffer) {\n  const char marker[] = \"-----\";\n  auto *origMemBuffer = originalBuffer.get();\n  SmallVector<StringRef, 8> sourceBuffers;\n  origMemBuffer->getBuffer().split(sourceBuffers, marker);\n\n  \/\/ Add the original buffer to the source manager.\n  SourceMgr fileSourceMgr;\n  fileSourceMgr.AddNewSourceBuffer(std::move(originalBuffer), SMLoc());\n\n  bool hadUnexpectedResult = false;\n\n  \/\/ Process each chunk in turn.  If any fails, then return a failure of the\n  \/\/ tool.\n  for (auto &subBuffer : sourceBuffers) {\n    auto splitLoc = SMLoc::getFromPointer(subBuffer.data());\n    unsigned splitLine = fileSourceMgr.getLineAndColumn(splitLoc).first;\n    auto subMemBuffer = MemoryBuffer::getMemBufferCopy(\n        subBuffer, origMemBuffer->getBufferIdentifier() +\n                       Twine(\" split at line #\") + Twine(splitLine));\n    if (processFile(std::move(subMemBuffer)))\n      hadUnexpectedResult = true;\n  }\n\n  return hadUnexpectedResult ? OptFailure : OptSuccess;\n}\n\nint main(int argc, char **argv) {\n  llvm::PrettyStackTraceProgram x(argc, argv);\n  InitLLVM y(argc, argv);\n\n  \/\/ Parse pass names in main to ensure static initialization completed.\n  llvm::cl::list<const mlir::PassInfo *, bool, mlir::PassNameParser> passList(\n      \"\", llvm::cl::desc(\"Compiler passes to run\"));\n  ::passList = &passList;\n  cl::ParseCommandLineOptions(argc, argv, \"MLIR modular optimizer driver\\n\");\n\n  \/\/ Set up the input file.\n  auto fileOrErr = MemoryBuffer::getFileOrSTDIN(inputFilename);\n  if (std::error_code error = fileOrErr.getError()) {\n    llvm::errs() << argv[0] << \": could not open input file '\" << inputFilename\n                 << \"': \" << error.message() << \"\\n\";\n    return 1;\n  }\n\n  \/\/ The split-input-file mode is a very specific mode that slices the file\n  \/\/ up into small pieces and checks each independently.\n  if (splitInputFile)\n    return splitAndProcessFile(std::move(*fileOrErr));\n\n  return processFile(std::move(*fileOrErr));\n}\n<commit_msg>Update split marker for split-input-file option to be more restrictive<commit_after>\/\/===- mlir-opt.cpp - MLIR Optimizer Driver -------------------------------===\/\/\n\/\/\n\/\/ Copyright 2019 The MLIR 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\/\/ This is a command line utility that parses an MLIR file, runs an optimization\n\/\/ pass, then prints the result back out.  It is designed to support unit\n\/\/ testing.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"mlir\/Analysis\/Passes.h\"\n#include \"mlir\/IR\/Attributes.h\"\n#include \"mlir\/IR\/CFGFunction.h\"\n#include \"mlir\/IR\/Location.h\"\n#include \"mlir\/IR\/MLFunction.h\"\n#include \"mlir\/IR\/MLIRContext.h\"\n#include \"mlir\/IR\/Module.h\"\n#include \"mlir\/Parser.h\"\n#include \"mlir\/Pass.h\"\n#include \"mlir\/Support\/PassNameParser.h\"\n#include \"mlir\/TensorFlow\/ControlFlowOps.h\"\n#include \"mlir\/TensorFlow\/Passes.h\"\n#include \"mlir\/TensorFlowLite\/Passes.h\"\n#include \"mlir\/Transforms\/CFGFunctionViewGraph.h\"\n#include \"mlir\/Transforms\/Passes.h\"\n#include \"mlir\/XLA\/Passes.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileUtilities.h\"\n#include \"llvm\/Support\/InitLLVM.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/Regex.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/ToolOutputFile.h\"\n\nusing namespace mlir;\nusing namespace llvm;\nusing llvm::SMLoc;\n\nstatic cl::opt<std::string>\ninputFilename(cl::Positional, cl::desc(\"<input file>\"), cl::init(\"-\"));\n\nstatic cl::opt<std::string>\noutputFilename(\"o\", cl::desc(\"Output filename\"), cl::value_desc(\"filename\"),\n               cl::init(\"-\"));\n\nstatic cl::opt<bool>\n    splitInputFile(\"split-input-file\",\n                   cl::desc(\"Split the input file into pieces and process each \"\n                            \"chunk independently\"),\n                   cl::init(false));\n\nstatic cl::opt<bool>\n    verifyDiagnostics(\"verify\",\n                      cl::desc(\"Check that emitted diagnostics match \"\n                               \"expected-* lines on the corresponding line\"),\n                      cl::init(false));\n\nstatic std::vector<const mlir::PassInfo *> *passList;\n\nenum OptResult { OptSuccess, OptFailure };\n\n\/\/\/ Open the specified output file and return it, exiting if there is any I\/O or\n\/\/\/ other errors.\nstatic std::unique_ptr<ToolOutputFile> getOutputStream() {\n  std::error_code error;\n  auto result =\n      llvm::make_unique<ToolOutputFile>(outputFilename, error, sys::fs::F_None);\n  if (error) {\n    llvm::errs() << error.message() << '\\n';\n    exit(1);\n  }\n\n  return result;\n}\n\n\/\/\/ Given a MemoryBuffer along with a line and column within it, return the\n\/\/\/ location being referenced.\nstatic SMLoc getLocFromLineAndCol(MemoryBuffer &membuf, unsigned lineNo,\n                                  unsigned columnNo) {\n  \/\/ TODO: This should really be upstreamed to be a method on llvm::SourceMgr.\n  \/\/ Doing so would allow it to use the offset cache that is already maintained\n  \/\/ by SrcBuffer, making this more efficient.\n\n  \/\/ Scan for the correct line number.\n  const char *position = membuf.getBufferStart();\n  const char *end = membuf.getBufferEnd();\n\n  \/\/ We start counting line and column numbers from 1.\n  --lineNo;\n  --columnNo;\n\n  while (position < end && lineNo) {\n    auto curChar = *position++;\n\n    \/\/ Scan for newlines.  If this isn't one, ignore it.\n    if (curChar != '\\r' && curChar != '\\n')\n      continue;\n\n    \/\/ We saw a line break, decrement our counter.\n    --lineNo;\n\n    \/\/ Check for \\r\\n and \\n\\r and treat it as a single escape.  We know that\n    \/\/ looking past one character is safe because MemoryBuffer's are always nul\n    \/\/ terminated.\n    if (*position != curChar && (*position == '\\r' || *position == '\\n'))\n      ++position;\n  }\n\n  \/\/ If the line\/column counter was invalid, return a pointer to the start of\n  \/\/ the buffer.\n  if (lineNo || position + columnNo > end)\n    return SMLoc::getFromPointer(membuf.getBufferStart());\n\n  \/\/ Otherwise return the right pointer.\n  return SMLoc::getFromPointer(position + columnNo);\n}\n\n\/\/\/ Perform the actions on the input file indicated by the command line flags\n\/\/\/ within the specified context.\n\/\/\/\n\/\/\/ This typically parses the main source file, runs zero or more optimization\n\/\/\/ passes, then prints the output.\n\/\/\/\nstatic OptResult performActions(SourceMgr &sourceMgr, MLIRContext *context) {\n  std::unique_ptr<Module> module(parseSourceFile(sourceMgr, context));\n  if (!module)\n    return OptFailure;\n\n  \/\/ Run each of the passes that were selected.\n  for (const auto *passInfo : *passList) {\n    std::unique_ptr<Pass> pass(passInfo->createPass());\n    PassResult result = pass->runOnModule(module.get());\n    if (result)\n      return OptFailure;\n\n    \/\/ Verify that the result of the pass is still valid.\n    if (module->verify())\n      return OptFailure;\n  }\n\n  \/\/ Print the output.\n  auto output = getOutputStream();\n  module->print(output->os());\n  output->keep();\n  return OptSuccess;\n}\n\n\/\/\/ Given a diagnostic kind, return a human readable string for it.\nstatic StringRef getDiagnosticKindString(MLIRContext::DiagnosticKind kind) {\n  switch (kind) {\n  case MLIRContext::DiagnosticKind::Note:\n    return \"note\";\n  case MLIRContext::DiagnosticKind::Warning:\n    return \"warning\";\n  case MLIRContext::DiagnosticKind::Error:\n    return \"error\";\n  }\n}\n\n\/\/\/ Parses the memory buffer.  If successfully, run a series of passes against\n\/\/\/ it and print the result.\nstatic OptResult processFile(std::unique_ptr<MemoryBuffer> ownedBuffer) {\n  \/\/ Tell sourceMgr about this buffer, which is what the parser will pick up.\n  SourceMgr sourceMgr;\n  auto &buffer = *ownedBuffer;\n  sourceMgr.AddNewSourceBuffer(std::move(ownedBuffer), SMLoc());\n\n  \/\/ Parse the input file.\n  MLIRContext context;\n\n  \/\/ If we are in verify mode then we have a lot of work to do, otherwise just\n  \/\/ perform the actions without worrying about it.\n  if (!verifyDiagnostics) {\n\n    \/\/ Register a simple diagnostic handler that prints out info with context.\n    context.registerDiagnosticHandler([&](Location location, StringRef message,\n                                          MLIRContext::DiagnosticKind kind) {\n      unsigned line = 1, column = 1;\n      if (auto fileLoc = location.dyn_cast<FileLineColLoc>()) {\n        line = fileLoc->getLine();\n        column = fileLoc->getColumn();\n      }\n\n      auto unexpectedLoc = getLocFromLineAndCol(buffer, line, column);\n      sourceMgr.PrintMessage(unexpectedLoc, SourceMgr::DK_Error, message);\n    });\n\n    \/\/ Run the test actions.\n    return performActions(sourceMgr, &context);\n  }\n\n  \/\/ Keep track of the result of this file processing.  If there are no issues,\n  \/\/ then we succeed.\n  auto result = OptSuccess;\n\n  \/\/ Record the expected diagnostic's position, substring and whether it was\n  \/\/ seen.\n  struct ExpectedDiag {\n    MLIRContext::DiagnosticKind kind;\n    unsigned lineNo;\n    StringRef substring;\n    SMLoc fileLoc;\n    bool matched = false;\n  };\n  SmallVector<ExpectedDiag, 2> expectedDiags;\n\n  \/\/ Error checker that verifies reported error was expected.\n  auto checker = [&](Location location, StringRef message,\n                     MLIRContext::DiagnosticKind kind) {\n    unsigned line = 1, column = 1;\n    if (auto fileLoc = location.dyn_cast<FileLineColLoc>()) {\n      line = fileLoc->getLine();\n      column = fileLoc->getColumn();\n    }\n\n    \/\/ If we find something that is close then emit a more specific error.\n    ExpectedDiag *nearMiss = nullptr;\n\n    \/\/ If this was an expected error, remember that we saw it and return.\n    for (auto &e : expectedDiags) {\n      if (line == e.lineNo && message.contains(e.substring)) {\n        if (e.kind == kind) {\n          e.matched = true;\n          return;\n        }\n\n        \/\/ If this only differs based on the diagnostic kind, then consider it\n        \/\/ to be a near miss.\n        nearMiss = &e;\n      }\n    }\n\n    \/\/ If there was a near miss, emit a specific diagnostic.\n    if (nearMiss) {\n      sourceMgr.PrintMessage(nearMiss->fileLoc, SourceMgr::DK_Error,\n                             \"'\" + getDiagnosticKindString(kind) +\n                                 \"' diagnostic emitted when expecting a '\" +\n                                 getDiagnosticKindString(nearMiss->kind) + \"'\");\n      result = OptFailure;\n      return;\n    }\n\n    \/\/ If this error wasn't expected, produce an error out of mlir-opt saying\n    \/\/ so.\n    auto unexpectedLoc = getLocFromLineAndCol(buffer, line, column);\n    sourceMgr.PrintMessage(unexpectedLoc, SourceMgr::DK_Error,\n                           \"unexpected error: \" + Twine(message));\n    result = OptFailure;\n  };\n\n  \/\/ Scan the file for expected-* designators and register a callback for the\n  \/\/ error handler.\n  \/\/ Extract the expected errors from the file.\n  llvm::Regex expected(\n      \"expected-(error|note|warning) *(@[+-][0-9]+)? *{{(.*)}}\");\n  SmallVector<StringRef, 100> lines;\n  buffer.getBuffer().split(lines, '\\n');\n  for (unsigned lineNo = 0, e = lines.size(); lineNo < e; ++lineNo) {\n    SmallVector<StringRef, 3> matches;\n    if (expected.match(lines[lineNo], &matches)) {\n      \/\/ Point to the start of expected-*.\n      SMLoc expectedStart = SMLoc::getFromPointer(matches[0].data());\n\n      MLIRContext::DiagnosticKind kind;\n      if (matches[1] == \"error\")\n        kind = MLIRContext::DiagnosticKind::Error;\n      else if (matches[1] == \"warning\")\n        kind = MLIRContext::DiagnosticKind::Warning;\n      else {\n        assert(matches[1] == \"note\");\n        kind = MLIRContext::DiagnosticKind::Note;\n      }\n\n      ExpectedDiag record{kind, lineNo + 1, matches[3], expectedStart, false};\n      auto offsetMatch = matches[2];\n      if (!offsetMatch.empty()) {\n        int offset;\n        \/\/ Get the integer value without the @ and +\/- prefix.\n        if (!offsetMatch.drop_front(2).getAsInteger(0, offset)) {\n          if (offsetMatch[1] == '+')\n            record.lineNo += offset;\n          else\n            record.lineNo -= offset;\n        }\n      }\n      expectedDiags.push_back(record);\n    }\n  }\n\n  \/\/ Finally, register the error handler to capture them.\n  context.registerDiagnosticHandler(checker);\n\n  \/\/ Do any processing requested by command line flags.  We don't care whether\n  \/\/ these actions succeed or fail, we only care what diagnostics they produce\n  \/\/ and whether they match our expectations.\n  performActions(sourceMgr, &context);\n\n  \/\/ Verify that all expected errors were seen.\n  for (auto &err : expectedDiags) {\n    if (!err.matched) {\n      SMRange range(err.fileLoc,\n                    SMLoc::getFromPointer(err.fileLoc.getPointer() +\n                                          err.substring.size()));\n      auto kind = getDiagnosticKindString(err.kind);\n      sourceMgr.PrintMessage(err.fileLoc, SourceMgr::DK_Error,\n                             \"expected \" + kind + \" \\\"\" + err.substring +\n                                 \"\\\" was not produced\",\n                             range);\n      result = OptFailure;\n    }\n  }\n\n  return result;\n}\n\n\/\/\/ Split the specified file on a marker and process each chunk independently\n\/\/\/ according to the normal processFile logic.  This is primarily used to\n\/\/\/ allow a large number of small independent parser tests to be put into a\n\/\/\/ single test, but could be used for other purposes as well.\nstatic OptResult\nsplitAndProcessFile(std::unique_ptr<MemoryBuffer> originalBuffer) {\n  const char marker[] = \"\/\/ -----\\n\";\n  auto *origMemBuffer = originalBuffer.get();\n  SmallVector<StringRef, 8> sourceBuffers;\n  origMemBuffer->getBuffer().split(sourceBuffers, marker);\n\n  \/\/ Add the original buffer to the source manager.\n  SourceMgr fileSourceMgr;\n  fileSourceMgr.AddNewSourceBuffer(std::move(originalBuffer), SMLoc());\n\n  bool hadUnexpectedResult = false;\n\n  \/\/ Process each chunk in turn.  If any fails, then return a failure of the\n  \/\/ tool.\n  for (auto &subBuffer : sourceBuffers) {\n    auto splitLoc = SMLoc::getFromPointer(subBuffer.data());\n    unsigned splitLine = fileSourceMgr.getLineAndColumn(splitLoc).first;\n    auto subMemBuffer = MemoryBuffer::getMemBufferCopy(\n        subBuffer, origMemBuffer->getBufferIdentifier() +\n                       Twine(\" split at line #\") + Twine(splitLine));\n    if (processFile(std::move(subMemBuffer)))\n      hadUnexpectedResult = true;\n  }\n\n  return hadUnexpectedResult ? OptFailure : OptSuccess;\n}\n\nint main(int argc, char **argv) {\n  llvm::PrettyStackTraceProgram x(argc, argv);\n  InitLLVM y(argc, argv);\n\n  \/\/ Parse pass names in main to ensure static initialization completed.\n  llvm::cl::list<const mlir::PassInfo *, bool, mlir::PassNameParser> passList(\n      \"\", llvm::cl::desc(\"Compiler passes to run\"));\n  ::passList = &passList;\n  cl::ParseCommandLineOptions(argc, argv, \"MLIR modular optimizer driver\\n\");\n\n  \/\/ Set up the input file.\n  auto fileOrErr = MemoryBuffer::getFileOrSTDIN(inputFilename);\n  if (std::error_code error = fileOrErr.getError()) {\n    llvm::errs() << argv[0] << \": could not open input file '\" << inputFilename\n                 << \"': \" << error.message() << \"\\n\";\n    return 1;\n  }\n\n  \/\/ The split-input-file mode is a very specific mode that slices the file\n  \/\/ up into small pieces and checks each independently.\n  if (splitInputFile)\n    return splitAndProcessFile(std::move(*fileOrErr));\n\n  return processFile(std::move(*fileOrErr));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Channel.hpp\"\n#include \"Message.hpp\"\n#include \"Network.hpp\"\n#include \"PawnDispatcher.hpp\"\n#include \"CLog.hpp\"\n#include \"PawnCallback.hpp\"\n#include \"Guild.hpp\"\n\n#include \"fmt\/format.h\"\n\n\n#undef SendMessage \/\/ Windows at its finest\n\n\nChannel::Channel(ChannelId_t pawn_id, json &data, GuildId_t guild_id) :\n\tm_PawnId(pawn_id)\n{\n\tm_Id = data[\"id\"].get<std::string>();\n\tm_Type = static_cast<Type>(data[\"type\"].get<int>());\n\tif (m_Type == Type::GUILD_TEXT) \/\/ is a guild channel\n\t{\n\t\tif (guild_id != 0)\n\t\t{\n\t\t\tm_GuildId = guild_id;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tauto it = data.find(\"guild_id\");\n\t\t\tif (it != data.end() && !it->is_null())\n\t\t\t{\n\t\t\t\tGuild_t const &guild = GuildManager::Get()->FindGuildById(it->get<std::string>());\n\t\t\t\tm_GuildId = guild->GetPawnId();\n\t\t\t\tguild->AddChannel(pawn_id);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ TODO: error message (is a guild channel, but no guild id was given)\n\t\t\t}\n\t\t}\n\t\tm_Name = data[\"name\"].get<std::string>();\n\t\tjson &topic = data[\"topic\"];\n\t\tif (!topic.is_null())\n\t\t\tm_Topic = topic.get<std::string>();\n\t}\n}\n\nvoid Channel::SendMessage(std::string &&msg)\n{\n\tjson data = {\n\t\t{ \"content\", std::move(msg) }\n\t};\n\tNetwork::Get()->Http().Post(fmt::format(\"\/channels\/{}\/messages\", GetId()), data.dump());\n}\n\n\nvoid ChannelManager::Initialize()\n{\n\tassert(m_Initialized != m_InitValue);\n\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::CHANNEL_CREATE, [](json &data)\n\t{\n\t\tPawnDispatcher::Get()->Dispatch([data]() mutable\n\t\t{\n\t\t\tChannel_t const &channel = ChannelManager::Get()->AddChannel(data);\n\n\t\t\t\/\/ forward DCC_OnChannelCreate(DCC_Channel:channel);\n\t\t\tPawnCallbackManager::Get()->Call(\"DCC_OnChannelCreate\", channel->GetPawnId());\n\t\t});\n\t});\n\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::CHANNEL_UPDATE, [](json &data)\n\t{\n\t\tChannelManager::Get()->UpdateChannel(data);\n\t});\n\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::CHANNEL_DELETE, [](json &data)\n\t{\n\t\tChannelManager::Get()->DeleteChannel(data);\n\t});\n\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::READY, [this](json &data)\n\t{\n\t\tfor (json &c : data[\"private_channels\"])\n\t\t\tAddChannel(c);\n\t\tm_Initialized++;\n\t});\n\n\t\/\/ PAWN callbacks\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::MESSAGE_CREATE, [this](json &data)\n\t{\n\t\tMessage msg(data);\n\t\tChannel_t const &channel = FindChannelById(msg.GetChannelId());\n\t\tif (channel)\n\t\t{\n\t\t\tPawnDispatcher::Get()->Dispatch([this, msg, &channel]()\n\t\t\t{\n\t\t\t\t\/\/ forward DCC_OnChannelMessage(DCC_Channel:channel, DCC_User:author, const message[]);\n\t\t\t\tPawnCallbackManager::Get()->Call(\"DCC_OnChannelMessage\",\n\t\t\t\t\tchannel->GetPawnId(), msg.GetAuthor(), msg.GetContent());\n\t\t\t});\n\t\t}\n\t});\n}\n\nbool ChannelManager::WaitForInitialization()\n{\n\tunsigned int const\n\t\tSLEEP_TIME_MS = 20,\n\t\tTIMEOUT_TIME_MS = 20 * 1000;\n\tunsigned int waited_time = 0;\n\twhile (m_Initialized != m_InitValue)\n\t{\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(SLEEP_TIME_MS));\n\t\twaited_time += SLEEP_TIME_MS;\n\t\tif (waited_time > TIMEOUT_TIME_MS)\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nChannel_t const &ChannelManager::AddChannel(json &data, GuildId_t guild_id\/* = 0*\/)\n{\n\tstatic Channel_t invalid_channel;\n\tjson &type = data[\"type\"];\n\tif (!type.is_null())\n\t{\n\t\tChannel::Type ch_type = static_cast<Channel::Type>(type.get<int>());\n\t\tif (ch_type != Channel::Type::GUILD_TEXT\n\t\t\t&& ch_type != Channel::Type::DM\n\t\t\t&& ch_type != Channel::Type::GROUP_DM)\n\t\t{\n\t\t\treturn invalid_channel; \/\/ we're only interested in text channels\n\t\t}\n\t}\n\n\tSnowflake_t sfid = data[\"id\"].get<std::string>();\n\tChannel_t const &channel = FindChannelById(sfid);\n\tif (channel)\n\t\treturn channel; \/\/ channel already exists\n\n\tChannelId_t id = 1;\n\twhile (m_Channels.find(id) != m_Channels.end())\n\t\t++id;\n\n\treturn m_Channels.emplace(id, Channel_t(new Channel(id, data, guild_id))).first->second;\n}\n\nvoid ChannelManager::UpdateChannel(json &data)\n{\n\tSnowflake_t id = data[\"id\"].get<std::string>();\n\tChannel_t const &channel = FindChannelById(id);\n\tif (!channel)\n\t{\n\t\t\/\/ TODO: error msg\n\t\treturn;\n\t}\n\n\tstd::string\n\t\tname = data[\"name\"].get<std::string>(),\n\t\ttopic = data[\"topic\"].get<std::string>();\n\n\tPawnDispatcher::Get()->Dispatch([name, topic, &channel]()\n\t{\n\t\tchannel->m_Name = name;\n\t\tchannel->m_Topic = topic;\n\n\t\t\/\/ forward DCC_OnChannelUpdate(DCC_Channel:channel);\n\t\tPawnCallbackManager::Get()->Call(\"DCC_OnChannelUpdate\", channel->GetPawnId());\n\t});\n}\n\nvoid ChannelManager::DeleteChannel(json & data)\n{\n\tSnowflake_t id = data[\"id\"].get<std::string>();\n\tChannel_t const &channel = FindChannelById(id);\n\tif (!channel)\n\t{\n\t\t\/\/ TODO: error msg\n\t\treturn;\n\t}\n\n\tPawnDispatcher::Get()->Dispatch([this, &channel]()\n\t{\n\t\t\/\/ forward DCC_OnChannelDelete(DCC_Channel:channel);\n\t\tPawnCallbackManager::Get()->Call(\"DCC_OnChannelDelete\", channel->GetPawnId());\n\n\t\tGuild_t const &guild = GuildManager::Get()->FindGuild(channel->GetGuildId());\n\t\tif (guild)\n\t\t\tguild->RemoveChannel(channel->GetPawnId());\n\n\t\tm_Channels.erase(channel->GetPawnId());\n\t});\n\n}\n\nChannel_t const &ChannelManager::FindChannel(ChannelId_t id)\n{\n\tstatic Channel_t invalid_channel;\n\tauto it = m_Channels.find(id);\n\tif (it == m_Channels.end())\n\t\treturn invalid_channel;\n\treturn it->second;\n}\n\nChannel_t const &ChannelManager::FindChannelByName(std::string const &name)\n{\n\tstatic Channel_t invalid_channel;\n\tfor (auto const &c : m_Channels)\n\t{\n\t\tChannel_t const &channel = c.second;\n\t\tif (channel->GetName().compare(name) == 0)\n\t\t\treturn channel;\n\t}\n\treturn invalid_channel;\n}\n\nChannel_t const &ChannelManager::FindChannelById(Snowflake_t const &sfid)\n{\n\tstatic Channel_t invalid_channel;\n\tfor (auto const &c : m_Channels)\n\t{\n\t\tChannel_t const &channel = c.second;\n\t\tif (channel->GetId().compare(sfid) == 0)\n\t\t\treturn channel;\n\t}\n\treturn invalid_channel;\n}\n<commit_msg>catch exception on invalid encoded message<commit_after>#include \"Channel.hpp\"\n#include \"Message.hpp\"\n#include \"Network.hpp\"\n#include \"PawnDispatcher.hpp\"\n#include \"CLog.hpp\"\n#include \"PawnCallback.hpp\"\n#include \"Guild.hpp\"\n\n#include \"fmt\/format.h\"\n\n\n#undef SendMessage \/\/ Windows at its finest\n\n\nChannel::Channel(ChannelId_t pawn_id, json &data, GuildId_t guild_id) :\n\tm_PawnId(pawn_id)\n{\n\tm_Id = data[\"id\"].get<std::string>();\n\tm_Type = static_cast<Type>(data[\"type\"].get<int>());\n\tif (m_Type == Type::GUILD_TEXT) \/\/ is a guild channel\n\t{\n\t\tif (guild_id != 0)\n\t\t{\n\t\t\tm_GuildId = guild_id;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tauto it = data.find(\"guild_id\");\n\t\t\tif (it != data.end() && !it->is_null())\n\t\t\t{\n\t\t\t\tGuild_t const &guild = GuildManager::Get()->FindGuildById(it->get<std::string>());\n\t\t\t\tm_GuildId = guild->GetPawnId();\n\t\t\t\tguild->AddChannel(pawn_id);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ TODO: error message (is a guild channel, but no guild id was given)\n\t\t\t}\n\t\t}\n\t\tm_Name = data[\"name\"].get<std::string>();\n\t\tjson &topic = data[\"topic\"];\n\t\tif (!topic.is_null())\n\t\t\tm_Topic = topic.get<std::string>();\n\t}\n}\n\nvoid Channel::SendMessage(std::string &&msg)\n{\n\tjson data = {\n\t\t{ \"content\", std::move(msg) }\n\t};\n\n\ttry\n\t{\n\t\tNetwork::Get()->Http().Post(fmt::format(\"\/channels\/{}\/messages\", GetId()), data.dump());\n\t}\n\tcatch (const json::type_error &e)\n\t{\n\t\tif (e.id == 316)\n\t\t{\n\t\t\t\/\/ TODO: error msg: invalid UTF-8 string (e.what())\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ TODO: error msg: error while serializing json: e.what()\n\t\t}\n\t}\n}\n\n\nvoid ChannelManager::Initialize()\n{\n\tassert(m_Initialized != m_InitValue);\n\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::CHANNEL_CREATE, [](json &data)\n\t{\n\t\tPawnDispatcher::Get()->Dispatch([data]() mutable\n\t\t{\n\t\t\tChannel_t const &channel = ChannelManager::Get()->AddChannel(data);\n\n\t\t\t\/\/ forward DCC_OnChannelCreate(DCC_Channel:channel);\n\t\t\tPawnCallbackManager::Get()->Call(\"DCC_OnChannelCreate\", channel->GetPawnId());\n\t\t});\n\t});\n\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::CHANNEL_UPDATE, [](json &data)\n\t{\n\t\tChannelManager::Get()->UpdateChannel(data);\n\t});\n\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::CHANNEL_DELETE, [](json &data)\n\t{\n\t\tChannelManager::Get()->DeleteChannel(data);\n\t});\n\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::READY, [this](json &data)\n\t{\n\t\tfor (json &c : data[\"private_channels\"])\n\t\t\tAddChannel(c);\n\t\tm_Initialized++;\n\t});\n\n\t\/\/ PAWN callbacks\n\tNetwork::Get()->WebSocket().RegisterEvent(WebSocket::Event::MESSAGE_CREATE, [this](json &data)\n\t{\n\t\tMessage msg(data);\n\t\tChannel_t const &channel = FindChannelById(msg.GetChannelId());\n\t\tif (channel)\n\t\t{\n\t\t\tPawnDispatcher::Get()->Dispatch([this, msg, &channel]()\n\t\t\t{\n\t\t\t\t\/\/ forward DCC_OnChannelMessage(DCC_Channel:channel, DCC_User:author, const message[]);\n\t\t\t\tPawnCallbackManager::Get()->Call(\"DCC_OnChannelMessage\",\n\t\t\t\t\tchannel->GetPawnId(), msg.GetAuthor(), msg.GetContent());\n\t\t\t});\n\t\t}\n\t});\n}\n\nbool ChannelManager::WaitForInitialization()\n{\n\tunsigned int const\n\t\tSLEEP_TIME_MS = 20,\n\t\tTIMEOUT_TIME_MS = 20 * 1000;\n\tunsigned int waited_time = 0;\n\twhile (m_Initialized != m_InitValue)\n\t{\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(SLEEP_TIME_MS));\n\t\twaited_time += SLEEP_TIME_MS;\n\t\tif (waited_time > TIMEOUT_TIME_MS)\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nChannel_t const &ChannelManager::AddChannel(json &data, GuildId_t guild_id\/* = 0*\/)\n{\n\tstatic Channel_t invalid_channel;\n\tjson &type = data[\"type\"];\n\tif (!type.is_null())\n\t{\n\t\tChannel::Type ch_type = static_cast<Channel::Type>(type.get<int>());\n\t\tif (ch_type != Channel::Type::GUILD_TEXT\n\t\t\t&& ch_type != Channel::Type::DM\n\t\t\t&& ch_type != Channel::Type::GROUP_DM)\n\t\t{\n\t\t\treturn invalid_channel; \/\/ we're only interested in text channels\n\t\t}\n\t}\n\n\tSnowflake_t sfid = data[\"id\"].get<std::string>();\n\tChannel_t const &channel = FindChannelById(sfid);\n\tif (channel)\n\t\treturn channel; \/\/ channel already exists\n\n\tChannelId_t id = 1;\n\twhile (m_Channels.find(id) != m_Channels.end())\n\t\t++id;\n\n\treturn m_Channels.emplace(id, Channel_t(new Channel(id, data, guild_id))).first->second;\n}\n\nvoid ChannelManager::UpdateChannel(json &data)\n{\n\tSnowflake_t id = data[\"id\"].get<std::string>();\n\tChannel_t const &channel = FindChannelById(id);\n\tif (!channel)\n\t{\n\t\t\/\/ TODO: error msg\n\t\treturn;\n\t}\n\n\tstd::string\n\t\tname = data[\"name\"].get<std::string>(),\n\t\ttopic = data[\"topic\"].get<std::string>();\n\n\tPawnDispatcher::Get()->Dispatch([name, topic, &channel]()\n\t{\n\t\tchannel->m_Name = name;\n\t\tchannel->m_Topic = topic;\n\n\t\t\/\/ forward DCC_OnChannelUpdate(DCC_Channel:channel);\n\t\tPawnCallbackManager::Get()->Call(\"DCC_OnChannelUpdate\", channel->GetPawnId());\n\t});\n}\n\nvoid ChannelManager::DeleteChannel(json & data)\n{\n\tSnowflake_t id = data[\"id\"].get<std::string>();\n\tChannel_t const &channel = FindChannelById(id);\n\tif (!channel)\n\t{\n\t\t\/\/ TODO: error msg\n\t\treturn;\n\t}\n\n\tPawnDispatcher::Get()->Dispatch([this, &channel]()\n\t{\n\t\t\/\/ forward DCC_OnChannelDelete(DCC_Channel:channel);\n\t\tPawnCallbackManager::Get()->Call(\"DCC_OnChannelDelete\", channel->GetPawnId());\n\n\t\tGuild_t const &guild = GuildManager::Get()->FindGuild(channel->GetGuildId());\n\t\tif (guild)\n\t\t\tguild->RemoveChannel(channel->GetPawnId());\n\n\t\tm_Channels.erase(channel->GetPawnId());\n\t});\n\n}\n\nChannel_t const &ChannelManager::FindChannel(ChannelId_t id)\n{\n\tstatic Channel_t invalid_channel;\n\tauto it = m_Channels.find(id);\n\tif (it == m_Channels.end())\n\t\treturn invalid_channel;\n\treturn it->second;\n}\n\nChannel_t const &ChannelManager::FindChannelByName(std::string const &name)\n{\n\tstatic Channel_t invalid_channel;\n\tfor (auto const &c : m_Channels)\n\t{\n\t\tChannel_t const &channel = c.second;\n\t\tif (channel->GetName().compare(name) == 0)\n\t\t\treturn channel;\n\t}\n\treturn invalid_channel;\n}\n\nChannel_t const &ChannelManager::FindChannelById(Snowflake_t const &sfid)\n{\n\tstatic Channel_t invalid_channel;\n\tfor (auto const &c : m_Channels)\n\t{\n\t\tChannel_t const &channel = c.second;\n\t\tif (channel->GetId().compare(sfid) == 0)\n\t\t\treturn channel;\n\t}\n\treturn invalid_channel;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ EigenJS.cpp\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_COMPLEX_HPP\n#define EIGENJS_COMPLEX_HPP\n\n#include <node.h>\n#include <v8.h>\n\n#include <nan.h>\n\n#include <complex>\n#include <sstream>\n\n#define EIGENJS_COMPLEX_CLASS_METHOD( NAME )                                  \\\n  static NAN_METHOD( NAME ) {                                                 \\\n    NanScope();                                                               \\\n                                                                              \\\n    if (args.Length() == 1 && HasInstance(args[0])) {                         \\\n      const Complex* obj =                                                    \\\n          node::ObjectWrap::Unwrap<Complex>(args[0]->ToObject());             \\\n                                                                              \\\n      const complex_type& NAME = std::NAME(obj->complex_);                    \\\n      const element_type& real = NAME.real();                                 \\\n      const element_type& imag = NAME.imag();                                 \\\n                                                                              \\\n      v8::Local<v8::Function> ctor = NanNew(constructor);                     \\\n      v8::Local<v8::Value> argv[] = {                                         \\\n          NanNew<v8::Number>(real)                                            \\\n        , NanNew<v8::Number>(imag)                                            \\\n      };                                                                      \\\n                                                                              \\\n      v8::Local<v8::Object> new_complex = ctor->NewInstance(                  \\\n          sizeof(argv) \/ sizeof(v8::Local<v8::Value>)                         \\\n        , argv                                                                \\\n      );                                                                      \\\n                                                                              \\\n      NanReturnValue(new_complex);                                            \\\n    }                                                                         \\\n                                                                              \\\n    NanReturnUndefined();                                                     \\\n  }                                                                           \\\n\/**\/\n\nnamespace EigenJS {\n\ntemplate <typename ValueType>\nclass Complex : public node::ObjectWrap {\n  typedef ValueType element_type;\n  typedef std::complex<element_type> complex_type;\n\n public:\n  static void Init(v8::Handle<v8::Object> exports) {\n    NanScope();\n\n    v8::Local<v8::FunctionTemplate> tpl = NanNew<v8::FunctionTemplate>(New);\n    tpl->SetClassName(NanNew(\"Complex\"));\n    tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"abs\", abs);\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"arg\", arg);\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"norm\", norm);\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"conj\", conj);\n\n    NODE_SET_METHOD(tpl, \"polar\", polar);\n    NODE_SET_METHOD(tpl, \"proj\", proj);\n\n    NODE_SET_METHOD(tpl, \"cos\", cos);\n    NODE_SET_METHOD(tpl, \"cosh\", cosh);\n    NODE_SET_METHOD(tpl, \"exp\", exp);\n\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"toString\", toString);\n\n    v8::Local<v8::ObjectTemplate> proto = tpl->PrototypeTemplate();\n    proto->SetAccessor(NanNew(\"real\"), get_real, set_real);\n    proto->SetAccessor(NanNew(\"imag\"), get_imag, set_imag);\n\n    NanAssignPersistent(constructor, tpl->GetFunction());\n    exports->Set(NanNew(\"Complex\"), tpl->GetFunction());\n\n    NanAssignPersistent(function_template, tpl);\n  }\n\n  static NAN_METHOD(abs) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    NanScope();\n\n    NanReturnValue(NanNew(std::abs(obj->complex_)));\n  }\n\n  static NAN_METHOD(arg) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    NanScope();\n\n    NanReturnValue(NanNew(std::arg(obj->complex_)));\n  }\n\n  static NAN_METHOD(norm) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    NanScope();\n\n    NanReturnValue(NanNew(std::norm(obj->complex_)));\n  }\n\n  static NAN_METHOD(conj) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    const complex_type& c = std::conj(obj->complex_);\n    const element_type& real = c.real();\n    const element_type& imag = c.imag();\n    NanScope();\n\n    v8::Local<v8::Function> ctor = NanNew(constructor);\n    v8::Local<v8::Value> argv[] = {\n        NanNew<v8::Number>(real)\n      , NanNew<v8::Number>(imag)\n    };\n\n    v8::Local<v8::Object> new_complex = ctor->NewInstance(\n        sizeof(argv) \/ sizeof(v8::Local<v8::Value>)\n      , argv\n    );\n\n    NanReturnValue(new_complex);\n  }\n\n  static NAN_METHOD(polar) {\n    NanScope();\n\n    if (args.Length() == 2 &&\n        args[0]->IsNumber() &&\n        args[1]->IsNumber()) {\n      const element_type& rho = args[0]->NumberValue();\n      const element_type& theta = args[1]->NumberValue();\n\n      v8::Local<v8::Function> ctor = NanNew(constructor);\n      v8::Local<v8::Value> argv[] = {\n          NanNew<v8::Number>(rho)\n        , NanNew<v8::Number>(theta)\n      };\n\n      v8::Local<v8::Object> new_complex = ctor->NewInstance(\n          sizeof(argv) \/ sizeof(v8::Local<v8::Value>)\n        , argv\n      );\n\n      NanReturnValue(new_complex);\n    }\n\n    NanReturnUndefined();\n  }\n\n  EIGENJS_COMPLEX_CLASS_METHOD(proj)\n  EIGENJS_COMPLEX_CLASS_METHOD(cos)\n  EIGENJS_COMPLEX_CLASS_METHOD(cosh)\n  EIGENJS_COMPLEX_CLASS_METHOD(exp)\n\n  static NAN_METHOD(toString) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    NanScope();\n\n    std::ostringstream result;\n    result << obj->complex_;\n\n    NanReturnValue(NanNew(result.str().c_str()));\n\n    NanReturnUndefined();\n  }\n\n  static NAN_GETTER(get_real) {\n    NanScope();\n\n    if (!NanGetInternalFieldPointer(args.This(), 0))\n      NanReturnValue(args.This());\n\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n\n    NanReturnValue(NanNew(obj->complex_.real()));\n  }\n\n  static NAN_SETTER(set_real) {\n    if (value->IsNumber()) {\n      Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n      obj->complex_ = complex_type(\n          value->NumberValue()\n        , obj->complex_.imag()\n      );\n    }\n  }\n\n  static NAN_GETTER(get_imag) {\n    NanScope();\n\n    if (!NanGetInternalFieldPointer(args.This(), 0))\n      NanReturnValue(args.This());\n\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n\n    NanReturnValue(NanNew(obj->complex_.imag()));\n  }\n\n  static NAN_SETTER(set_imag) {\n    if (value->IsNumber()) {\n      Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n      obj->complex_ = complex_type(\n          obj->complex_.real()\n        , value->NumberValue()\n      );\n    }\n  }\n\n private:\n  Complex(const element_type& real, const element_type& imag)\n    : complex_(real, imag)\n  {}\n  ~Complex() {}\n\n  static NAN_METHOD(New) {\n    NanScope();\n\n    if (args.Length() < 2) {\n      NanThrowError(\"Tried creating complex without real and imag arguments\");\n      NanReturnUndefined();\n    }\n\n    if (args.IsConstructCall()) {\n      const element_type& real = args[0]->NumberValue();\n      const element_type& imag = args[1]->NumberValue();\n      Complex* obj = new Complex(real, imag);\n      obj->Wrap(args.This());\n      NanReturnValue(args.This());\n    } else {\n      v8::Local<v8::Function> ctr = NanNew(constructor);\n      v8::Local<v8::Value> argv[] = {args[0], args[1]};\n      NanReturnValue(\n        ctr->NewInstance(\n            sizeof(argv) \/ sizeof(v8::Local<v8::Value>)\n          , argv\n        )\n      );\n    }\n  }\n\n  static bool HasInstance(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 private:\n  static v8::Persistent<v8::FunctionTemplate> function_template;\n  static v8::Persistent<v8::Function> constructor;\n\n private:\n  complex_type complex_;\n};\n\ntemplate<typename ValueType>\nv8::Persistent<v8::FunctionTemplate> Complex<ValueType>::function_template;\n\ntemplate<typename ValueType>\nv8::Persistent<v8::Function> Complex<ValueType>::constructor;\n\n}  \/\/ namespace EigenJS\n\n#undef EIGENJS_COMPLEX_CLASS_METHOD\n\n#endif  \/\/ EIGENJS_COMPLEX_HPP\n<commit_msg>src: added class method 'Complex.log()'<commit_after>\/\/\n\/\/ EigenJS.cpp\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_COMPLEX_HPP\n#define EIGENJS_COMPLEX_HPP\n\n#include <node.h>\n#include <v8.h>\n\n#include <nan.h>\n\n#include <complex>\n#include <sstream>\n\n#define EIGENJS_COMPLEX_CLASS_METHOD( NAME )                                  \\\n  static NAN_METHOD( NAME ) {                                                 \\\n    NanScope();                                                               \\\n                                                                              \\\n    if (args.Length() == 1 && HasInstance(args[0])) {                         \\\n      const Complex* obj =                                                    \\\n          node::ObjectWrap::Unwrap<Complex>(args[0]->ToObject());             \\\n                                                                              \\\n      const complex_type& NAME = std::NAME(obj->complex_);                    \\\n      const element_type& real = NAME.real();                                 \\\n      const element_type& imag = NAME.imag();                                 \\\n                                                                              \\\n      v8::Local<v8::Function> ctor = NanNew(constructor);                     \\\n      v8::Local<v8::Value> argv[] = {                                         \\\n          NanNew<v8::Number>(real)                                            \\\n        , NanNew<v8::Number>(imag)                                            \\\n      };                                                                      \\\n                                                                              \\\n      v8::Local<v8::Object> new_complex = ctor->NewInstance(                  \\\n          sizeof(argv) \/ sizeof(v8::Local<v8::Value>)                         \\\n        , argv                                                                \\\n      );                                                                      \\\n                                                                              \\\n      NanReturnValue(new_complex);                                            \\\n    }                                                                         \\\n                                                                              \\\n    NanReturnUndefined();                                                     \\\n  }                                                                           \\\n\/**\/\n\nnamespace EigenJS {\n\ntemplate <typename ValueType>\nclass Complex : public node::ObjectWrap {\n  typedef ValueType element_type;\n  typedef std::complex<element_type> complex_type;\n\n public:\n  static void Init(v8::Handle<v8::Object> exports) {\n    NanScope();\n\n    v8::Local<v8::FunctionTemplate> tpl = NanNew<v8::FunctionTemplate>(New);\n    tpl->SetClassName(NanNew(\"Complex\"));\n    tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"abs\", abs);\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"arg\", arg);\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"norm\", norm);\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"conj\", conj);\n\n    NODE_SET_METHOD(tpl, \"polar\", polar);\n    NODE_SET_METHOD(tpl, \"proj\", proj);\n\n    NODE_SET_METHOD(tpl, \"cos\", cos);\n    NODE_SET_METHOD(tpl, \"cosh\", cosh);\n    NODE_SET_METHOD(tpl, \"exp\", exp);\n    NODE_SET_METHOD(tpl, \"log\", log);\n\n    NODE_SET_PROTOTYPE_METHOD(tpl, \"toString\", toString);\n\n    v8::Local<v8::ObjectTemplate> proto = tpl->PrototypeTemplate();\n    proto->SetAccessor(NanNew(\"real\"), get_real, set_real);\n    proto->SetAccessor(NanNew(\"imag\"), get_imag, set_imag);\n\n    NanAssignPersistent(constructor, tpl->GetFunction());\n    exports->Set(NanNew(\"Complex\"), tpl->GetFunction());\n\n    NanAssignPersistent(function_template, tpl);\n  }\n\n  static NAN_METHOD(abs) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    NanScope();\n\n    NanReturnValue(NanNew(std::abs(obj->complex_)));\n  }\n\n  static NAN_METHOD(arg) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    NanScope();\n\n    NanReturnValue(NanNew(std::arg(obj->complex_)));\n  }\n\n  static NAN_METHOD(norm) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    NanScope();\n\n    NanReturnValue(NanNew(std::norm(obj->complex_)));\n  }\n\n  static NAN_METHOD(conj) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    const complex_type& c = std::conj(obj->complex_);\n    const element_type& real = c.real();\n    const element_type& imag = c.imag();\n    NanScope();\n\n    v8::Local<v8::Function> ctor = NanNew(constructor);\n    v8::Local<v8::Value> argv[] = {\n        NanNew<v8::Number>(real)\n      , NanNew<v8::Number>(imag)\n    };\n\n    v8::Local<v8::Object> new_complex = ctor->NewInstance(\n        sizeof(argv) \/ sizeof(v8::Local<v8::Value>)\n      , argv\n    );\n\n    NanReturnValue(new_complex);\n  }\n\n  static NAN_METHOD(polar) {\n    NanScope();\n\n    if (args.Length() == 2 &&\n        args[0]->IsNumber() &&\n        args[1]->IsNumber()) {\n      const element_type& rho = args[0]->NumberValue();\n      const element_type& theta = args[1]->NumberValue();\n\n      v8::Local<v8::Function> ctor = NanNew(constructor);\n      v8::Local<v8::Value> argv[] = {\n          NanNew<v8::Number>(rho)\n        , NanNew<v8::Number>(theta)\n      };\n\n      v8::Local<v8::Object> new_complex = ctor->NewInstance(\n          sizeof(argv) \/ sizeof(v8::Local<v8::Value>)\n        , argv\n      );\n\n      NanReturnValue(new_complex);\n    }\n\n    NanReturnUndefined();\n  }\n\n  EIGENJS_COMPLEX_CLASS_METHOD(proj)\n  EIGENJS_COMPLEX_CLASS_METHOD(cos)\n  EIGENJS_COMPLEX_CLASS_METHOD(cosh)\n  EIGENJS_COMPLEX_CLASS_METHOD(exp)\n  EIGENJS_COMPLEX_CLASS_METHOD(log)\n\n  static NAN_METHOD(toString) {\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n    NanScope();\n\n    std::ostringstream result;\n    result << obj->complex_;\n\n    NanReturnValue(NanNew(result.str().c_str()));\n\n    NanReturnUndefined();\n  }\n\n  static NAN_GETTER(get_real) {\n    NanScope();\n\n    if (!NanGetInternalFieldPointer(args.This(), 0))\n      NanReturnValue(args.This());\n\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n\n    NanReturnValue(NanNew(obj->complex_.real()));\n  }\n\n  static NAN_SETTER(set_real) {\n    if (value->IsNumber()) {\n      Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n      obj->complex_ = complex_type(\n          value->NumberValue()\n        , obj->complex_.imag()\n      );\n    }\n  }\n\n  static NAN_GETTER(get_imag) {\n    NanScope();\n\n    if (!NanGetInternalFieldPointer(args.This(), 0))\n      NanReturnValue(args.This());\n\n    const Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n\n    NanReturnValue(NanNew(obj->complex_.imag()));\n  }\n\n  static NAN_SETTER(set_imag) {\n    if (value->IsNumber()) {\n      Complex* obj = node::ObjectWrap::Unwrap<Complex>(args.This());\n      obj->complex_ = complex_type(\n          obj->complex_.real()\n        , value->NumberValue()\n      );\n    }\n  }\n\n private:\n  Complex(const element_type& real, const element_type& imag)\n    : complex_(real, imag)\n  {}\n  ~Complex() {}\n\n  static NAN_METHOD(New) {\n    NanScope();\n\n    if (args.Length() < 2) {\n      NanThrowError(\"Tried creating complex without real and imag arguments\");\n      NanReturnUndefined();\n    }\n\n    if (args.IsConstructCall()) {\n      const element_type& real = args[0]->NumberValue();\n      const element_type& imag = args[1]->NumberValue();\n      Complex* obj = new Complex(real, imag);\n      obj->Wrap(args.This());\n      NanReturnValue(args.This());\n    } else {\n      v8::Local<v8::Function> ctr = NanNew(constructor);\n      v8::Local<v8::Value> argv[] = {args[0], args[1]};\n      NanReturnValue(\n        ctr->NewInstance(\n            sizeof(argv) \/ sizeof(v8::Local<v8::Value>)\n          , argv\n        )\n      );\n    }\n  }\n\n  static bool HasInstance(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 private:\n  static v8::Persistent<v8::FunctionTemplate> function_template;\n  static v8::Persistent<v8::Function> constructor;\n\n private:\n  complex_type complex_;\n};\n\ntemplate<typename ValueType>\nv8::Persistent<v8::FunctionTemplate> Complex<ValueType>::function_template;\n\ntemplate<typename ValueType>\nv8::Persistent<v8::Function> Complex<ValueType>::constructor;\n\n}  \/\/ namespace EigenJS\n\n#undef EIGENJS_COMPLEX_CLASS_METHOD\n\n#endif  \/\/ EIGENJS_COMPLEX_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  Context.cpp\n\/\/  Cinder-Pipeline\n\/\/\n\/\/  Created by Jean-Pierre Mouilleseaux on 19 Apr 2014.\n\/\/  Copyright 2014 Chorded Constructions. All rights reserved.\n\/\/\n\n#include \"Context.h\"\n#include \"SourceNode.h\"\n#include \"EffectorNode.h\"\n#include \"cinder\/Utilities.h\"\n\nusing namespace ci;\n\nnamespace Cinder { namespace Pipeline {\n\nContextRef Context::create() {\n    return ContextRef(new Context())->shared_from_this();\n}\n\nContext::Context() {\n}\n\nContext::~Context() {\n}\n\n#pragma mark -\n\nvoid Context::setup(const Vec2i size, int attachments) {\n#if defined(DEBUG)\n    const char* renderer = reinterpret_cast<const char*>(glGetString(GL_RENDERER));\n    cinder::app::console() << \"GL_RENDERER: \" << renderer << std::endl;\n    const char* vendor = reinterpret_cast<const char*>(glGetString(GL_VENDOR));\n    cinder::app::console() << \"GL_VENDOR: \" << vendor << std::endl;\n    const char* version = reinterpret_cast<const char*>(glGetString(GL_VERSION));\n    cinder::app::console() << \"GL_VERSION: \" << version << std::endl;\n    const char* shadingLanguageVersion = reinterpret_cast<const char*>(glGetString(GL_SHADING_LANGUAGE_VERSION));\n    cinder::app::console() << \"GL_SHADING_LANGUAGE_VERSION: \" << shadingLanguageVersion << std::endl;\n\n    std::string extensionsString = std::string(reinterpret_cast<const char*>(glGetString(GL_EXTENSIONS)));\n    std::vector<std::string> extensions = split(extensionsString, \" \");\n    extensions.erase(std::remove_if(extensions.begin(), extensions.end(), [](const std::string& s){ return s.empty(); }));\n    cinder::app::console() << \"GL_EXTENSIONS: \" << std::endl;\n    for (const std::string& e : extensions) {\n        cinder::app::console() << \" \" << e << std::endl;\n    }\n\n    GLint texSize;\n    glGetIntegerv(GL_MAX_TEXTURE_SIZE, &texSize);\n    cinder::app::console() << \"GL_MAX_TEXTURE_SIZE: \" << texSize << std::endl;\n    glGetIntegerv(GL_MAX_3D_TEXTURE_SIZE, &texSize);\n    cinder::app::console() << \"GL_MAX_3D_TEXTURE_SIZE: \" << texSize << std::endl;\n    glGetIntegerv(GL_MAX_TEXTURE_IMAGE_UNITS, &texSize);\n    cinder::app::console() << \"GL_MAX_TEXTURE_IMAGE_UNITS: \" << texSize << std::endl;\n    glGetIntegerv(GL_MAX_COMBINED_TEXTURE_IMAGE_UNITS, &texSize);\n    cinder::app::console() << \"GL_MAX_COMBINED_TEXTURE_IMAGE_UNITS: \" << texSize << std::endl;\n    glGetIntegerv(GL_MAX_COLOR_ATTACHMENTS, &texSize);\n    cinder::app::console() << \"GL_MAX_COLOR_ATTACHMENTS: \" << texSize << std::endl;\n    cinder::app::console() << std::string(13, '-') << std::endl;\n#endif\n\n\/\/    glGetIntegerv(GL_MAX_TEXTURE_SIZE, &texSize);\n\/\/    if (size.x > texSize) {\n\/\/        \/\/ TODO - tile horizontally\n\/\/        cinder::app::console() << \"ERROR - setup width '\" << size.x << \"' exceeds maximum texture size '\" << texSize << \"', tiling unimplemented\" << std::endl;\n\/\/    }\n\/\/    if (size.y > texSize) {\n\/\/        \/\/ TODO - tile vertically\n\/\/        cinder::app::console() << \"ERROR - setup height '\" << size.y << \"' exceeds maximum texture size '\" << texSize << \"', tiling unimplemented\" << std::endl;\n\/\/    }\n\/\/\n\/\/    glGetIntegerv(GL_MAX_COLOR_ATTACHMENTS, &texSize);\n\/\/    if (attachments > GL_MAX_COLOR_ATTACHMENTS) {\n\/\/        cinder::app::console() << \"ERROR - number of attachments '\" << attachments << \"' exceeds '\" << texSize << \"'\" << std::endl;\n\/\/    }\n\/\/\n\/\/    float attachmentMemorySizeMB = size.x * size.y * 4 \/ 1024 \/ 1024;\n\/\/    float totalSizeMB = attachmentMemorySizeMB * attachments;\n\/\/\n\/\/    if (gl::isExtensionAvailable(\"GL_NV_texture_barrier\")) {\n\/\/        if (texSize >= 2 * size.x && texSize >= size.y) {\n\/\/            \/\/ TODO - double-wide\n\/\/        } else if (texSize >= 2 * size.y && texSize >= size.x) {\n\/\/            \/\/ TODO - double-tall\n\/\/        } else {\n\/\/            \/\/ TODO - tile\n\/\/        }\n\/\/    }\n\n    gl::Fbo::Format format;\n    format.enableColorBuffer(true, attachments);\n    format.enableDepthBuffer(false);\n\n    mFBO = gl::Fbo(size.x, size.y, format);\n    mFBO.bindFramebuffer(); {\n        GLenum buffers[attachments];\n        for (unsigned int idx = 0; idx < attachments; idx++) {\n            buffers[idx] = GL_COLOR_ATTACHMENT0 + idx;\n        }\n        glDrawBuffers(attachments, buffers);\n        gl::setViewport(mFBO.getBounds());\n        gl::clear();\n    } mFBO.unbindFramebuffer();\n}\n\n#pragma mark - CONNECTIONS\n\nvoid Context::connectNodes(const NodeRef& sourceNode, const NodePortRef& sourcePort, const NodeRef& destinationNode, const NodePortRef& destinationPort) {\n    \/\/ remove from output connections if destination port already connected\n    if (mInputConnections[destinationNode].count(destinationPort->getKey()) > 0) {\n        std::vector<NodePortConnectionRef> connections = mOutputConnections[sourceNode][sourcePort->getKey()];\n        connections.erase(std::remove_if(connections.begin(), connections.end(), [destinationNode](const NodePortConnectionRef& c) {\n            return c->getDestinationNode() == destinationNode;\n        }), connections.end());\n    }\n\n    NodePortConnectionRef connection = NodePortConnection::create(sourceNode, sourcePort->getKey(), destinationNode, destinationPort->getKey());\n    mInputConnections[destinationNode][destinationPort->getKey()] = connection;\n    mOutputConnections[sourceNode][sourcePort->getKey()].push_back(connection);\n\n    \/\/ wipe render stack to force a rebuild\n    mRenderStack.clear();\n}\n\nvoid Context::connectNodes(const NodeRef& sourceNode, const std::string& sourceNodePortKey, const NodeRef& destinationNode, const std::string& destinationNodePortKey) {\n    NodePortRef sourcePort = sourceNode->getOutputPortForKey(sourceNodePortKey);\n    NodePortRef destinationPort = destinationNode->getInputPortForKey(destinationNodePortKey);\n    connectNodes(sourceNode, sourcePort, destinationNode, destinationPort);\n}\n\nvoid Context::connectNodes(const NodeRef& sourceNode, const NodeRef& destinationNode) {\n    connectNodes(sourceNode, \"image\", destinationNode, \"image\");\n}\n\n#pragma mark -\n\ngl::Texture& Context::evaluate(const NodeRef& node) {\n    \/\/ rebuild render stack (flush cache) if the stack is empty or the node changes (cache key)\n    if (mRenderStack.size() == 0 || node != mRenderNode) {\n        mRenderNode = node;\n        BranchRef root = branchForNode(mRenderNode);\n        mRenderStack = renderStackForRootBranch(root);\n    }\n\n#if defined(DEBUG)\n    \/\/ ASCII visualization\n    cinder::app::console() << std::string(3, '#') << std::endl;\n    for (const BranchRef& b : mRenderStack) {\n        printBranch(b);\n    }\n    cinder::app::console() << std::endl;\n#endif\n\n    \/\/ render branches\n    unsigned int outAttachment = 0;\n\n    Area viewport = gl::getViewport();\n    gl::setViewport(mFBO.getBounds());\n    mFBO.bindFramebuffer(); {\n        gl::pushMatrices(); {\n            gl::setMatricesWindow(mFBO.getSize(), false);\n\n            \/\/ int instead of GLenum for Cinder's FBO bindTexture\/getTexture\n            std::vector<int> availableAttachments;\n            for (unsigned int idx = 0; idx < mFBO.getFormat().getNumColorBuffers(); idx++) {\n                availableAttachments.push_back(idx);\n            }\n            std::map<NodeRef, int> attachmentsMap;\n\n            for (const BranchRef& b : mRenderStack) {\n                size_t attachmentIndex = 0;\n                outAttachment = availableAttachments.at(attachmentIndex);\n                int inAttachment = -1;\n\n                for (size_t nodeIdx = 0; nodeIdx < b->getNodes().size(); nodeIdx++) {\n                    \/\/ TODO - hoist draw buffer assignment\n                    NodeRef n = b->getNodes().at(nodeIdx);\n                    SourceNodeRef s = std::dynamic_pointer_cast<SourceNode>(n);\n                    if (s) {\n                        glDrawBuffer(GL_COLOR_ATTACHMENT0 + outAttachment);\n\n                        FBOImageRef outputFBOImage = FBOImage::create(mFBO, outAttachment);\n                        s->render(outputFBOImage);\n\n                        inAttachment = outAttachment;\n                    } else {\n                        EffectorNodeRef e = std::dynamic_pointer_cast<EffectorNode>(n);\n                        if (e) {\n                            std::vector<NodePortConnectionRef> connections = getInputConnectionsForNodeWithPortType(n, NodePortType::FBOImage);\n                            if (connections.size() == 1) {\n                                NodePortConnectionRef c = connections.at(0);\n                                \/\/ grab attachment from map when appropriate\n                                if (inAttachment == -1) {\n                                    inAttachment = attachmentsMap[c->getSourceNode()];\n                                    attachmentsMap.erase(c->getSourceNode());\n                                    availableAttachments.push_back(inAttachment);\n                                }\n                                FBOImageRef inputFBOImage = FBOImage::create(mFBO, inAttachment);\n                                e->setValueForInputPortKey(inputFBOImage, c->getDestinationPortKey());\n\n                                attachmentIndex = (attachmentIndex + 1) % availableAttachments.size();\n                                outAttachment = availableAttachments.at(attachmentIndex);\n                                glDrawBuffer(GL_COLOR_ATTACHMENT0 + outAttachment);\n\n                                FBOImageRef outputFBOImage = FBOImage::create(mFBO, outAttachment);\n                                e->render(outputFBOImage);\n\n                                inAttachment = outAttachment;\n                            } else if (connections.size() > 1) {\n                                for (const NodePortConnectionRef& c : connections) {\n                                    inAttachment = attachmentsMap[c->getSourceNode()];\n                                    attachmentsMap.erase(c->getSourceNode());\n                                    availableAttachments.push_back(inAttachment);\n\n                                    FBOImageRef inputFBOImage = FBOImage::create(mFBO, inAttachment);\n                                    e->setValueForInputPortKey(inputFBOImage, c->getDestinationPortKey());\n                                }\n\n                                glDrawBuffer(GL_COLOR_ATTACHMENT0 + outAttachment);\n\n                                FBOImageRef outputFBOImage = FBOImage::create(mFBO, outAttachment);\n                                e->render(outputFBOImage);\n                                \n                                inAttachment = outAttachment;\n                            }\n                        }\n                    }\n\n                    \/\/ stash output attachment and accompanying node when branch concludes\n                    if (nodeIdx == b->getNodes().size() - 1) {\n                        attachmentsMap[n] = outAttachment;\n                        availableAttachments.erase(std::find(availableAttachments.begin(), availableAttachments.end(), outAttachment));\n                    }\n                }\n            }\n        } gl::popMatrices();\n    } mFBO.unbindFramebuffer();\n    gl::setViewport(viewport);\n\n    return mFBO.getTexture(outAttachment);\n}\n\n#pragma mark -\n\nvoid Context::printBranch(const BranchRef& branch) {\n\/\/    for (const NodeRef& n : branch->getNodes()) {\n\/\/        cinder::app::console() << n->getName() << \" → \";\n\/\/    }\n\/\/    cinder::app::console() << \" (\" << branch->getMaxInputCost() << \")\" << std::endl;\n    for (const NodeRef& n : branch->getNodes()) {\n        if (!std::dynamic_pointer_cast<SourceNode>(n)) {\n            cinder::app::console() << \" → \";\n        }\n\n        std::string name = n->getName();\n        name.resize(3, ' ');\n        cinder::app::console() << \"[\" << name << \"]\";\n    }\n    cinder::app::console() << \" (\" << branch->getMaxInputCost() << \")\";\n    cinder::app::console() << std::endl;\n}\n\nBranchRef Context::branchForNode(const NodeRef& node) {\n    std::map<NodeRef, BranchRef> branchMap;\n    std::deque<NodeRef> nodeStack;\n\n    \/\/ create branches\n    NodeRef n = node;\n    while (n) {\n        if (branchMap.count(n) == 0) {\n            std::deque<NodeRef> nodes;\n\n            NodeRef n2 = n;\n            while (n2) {\n                nodes.push_front(n2);\n\n                std::vector<NodePortConnectionRef> connections = getInputConnectionsForNodeWithPortType(n2, NodePortType::FBOImage);\n                if (connections.size() == 0) {\n                    n2 = nullptr;\n                } else if (connections.size() == 1) {\n                    NodePortConnectionRef connection = connections.at(0);\n                    n2 = connection->getSourceNode();\n\n                    if (getOutputConnectionsForNodeWithPortKey(n2, connection->getSourcePortKey()).size() > 1) {\n                        nodeStack.push_front(n2);\n                        n2 = nullptr;\n                    }\n                } else if (connections.size() > 1) {\n                    for (const NodePortConnectionRef& c : connections) {\n                        nodeStack.push_front(c->getSourceNode());\n                    }\n                    n2 = nullptr;\n                }\n            }\n\n            BranchRef branch = Branch::create(nodes);\n            branchMap[n] = branch;\n        }\n\n        if (nodeStack.empty()) {\n            n = nullptr;\n        } else {\n            n = nodeStack.front();\n            nodeStack.pop_front();\n        }\n    }\n\n    \/\/ connect branches\n    for (auto& kv : branchMap) {\n        BranchRef destinationBranch = kv.second;\n        n = destinationBranch->getNodes().front();\n\n        std::vector<NodePortConnectionRef> connections = getInputConnectionsForNodeWithPortType(n, NodePortType::FBOImage);\n        for (const NodePortConnectionRef& c : connections) {\n            BranchRef sourceBranch = branchMap[c->getSourceNode()];\n            destinationBranch->connectInputBranch(sourceBranch);\n        }\n    }\n\n    return branchMap[node];\n}\n\nstd::deque<BranchRef> Context::renderStackForRootBranch(const BranchRef& branch) {\n    std::deque<BranchRef> renderStack;\n    std::deque<BranchRef> branchStack;\n\n    BranchRef b = branch;\n    while (b) {\n        renderStack.push_front(b);\n\n        std::vector<BranchConnectionRef> inputConnections = b->getInputConnections();\n        if (inputConnections.empty()) {\n            if (branchStack.empty()) {\n                b = nullptr;\n            } else {\n                b = branchStack.front();\n                branchStack.pop_front();\n            }\n        } else {\n            \/\/ sort by cost DESC\n            std::vector<BranchConnectionRef> sortedInputConnections = inputConnections;\n            std::sort(sortedInputConnections.begin(), sortedInputConnections.end(), [](const BranchConnectionRef& c1, const BranchConnectionRef& c2) {\n                return c1->getInputCost() > c2->getInputCost();\n            });\n\n            \/\/ follow cheapest path\n            b = sortedInputConnections.back()->getSourceBranch();\n            sortedInputConnections.pop_back();\n\n            \/\/ push the others\n            for (const BranchConnectionRef& c : sortedInputConnections) {\n                branchStack.push_front(c->getSourceBranch());\n            }\n        }\n    }\n\n    return renderStack;\n}\n\n}}\n<commit_msg>branch on multiple outputs not just multiple on a specific port<commit_after>\/\/\n\/\/  Context.cpp\n\/\/  Cinder-Pipeline\n\/\/\n\/\/  Created by Jean-Pierre Mouilleseaux on 19 Apr 2014.\n\/\/  Copyright 2014 Chorded Constructions. All rights reserved.\n\/\/\n\n#include \"Context.h\"\n#include \"SourceNode.h\"\n#include \"EffectorNode.h\"\n#include \"cinder\/Utilities.h\"\n\nusing namespace ci;\n\nnamespace Cinder { namespace Pipeline {\n\nContextRef Context::create() {\n    return ContextRef(new Context())->shared_from_this();\n}\n\nContext::Context() {\n}\n\nContext::~Context() {\n}\n\n#pragma mark -\n\nvoid Context::setup(const Vec2i size, int attachments) {\n#if defined(DEBUG)\n    const char* renderer = reinterpret_cast<const char*>(glGetString(GL_RENDERER));\n    cinder::app::console() << \"GL_RENDERER: \" << renderer << std::endl;\n    const char* vendor = reinterpret_cast<const char*>(glGetString(GL_VENDOR));\n    cinder::app::console() << \"GL_VENDOR: \" << vendor << std::endl;\n    const char* version = reinterpret_cast<const char*>(glGetString(GL_VERSION));\n    cinder::app::console() << \"GL_VERSION: \" << version << std::endl;\n    const char* shadingLanguageVersion = reinterpret_cast<const char*>(glGetString(GL_SHADING_LANGUAGE_VERSION));\n    cinder::app::console() << \"GL_SHADING_LANGUAGE_VERSION: \" << shadingLanguageVersion << std::endl;\n\n    std::string extensionsString = std::string(reinterpret_cast<const char*>(glGetString(GL_EXTENSIONS)));\n    std::vector<std::string> extensions = split(extensionsString, \" \");\n    extensions.erase(std::remove_if(extensions.begin(), extensions.end(), [](const std::string& s){ return s.empty(); }));\n    cinder::app::console() << \"GL_EXTENSIONS: \" << std::endl;\n    for (const std::string& e : extensions) {\n        cinder::app::console() << \" \" << e << std::endl;\n    }\n\n    GLint texSize;\n    glGetIntegerv(GL_MAX_TEXTURE_SIZE, &texSize);\n    cinder::app::console() << \"GL_MAX_TEXTURE_SIZE: \" << texSize << std::endl;\n    glGetIntegerv(GL_MAX_3D_TEXTURE_SIZE, &texSize);\n    cinder::app::console() << \"GL_MAX_3D_TEXTURE_SIZE: \" << texSize << std::endl;\n    glGetIntegerv(GL_MAX_TEXTURE_IMAGE_UNITS, &texSize);\n    cinder::app::console() << \"GL_MAX_TEXTURE_IMAGE_UNITS: \" << texSize << std::endl;\n    glGetIntegerv(GL_MAX_COMBINED_TEXTURE_IMAGE_UNITS, &texSize);\n    cinder::app::console() << \"GL_MAX_COMBINED_TEXTURE_IMAGE_UNITS: \" << texSize << std::endl;\n    glGetIntegerv(GL_MAX_COLOR_ATTACHMENTS, &texSize);\n    cinder::app::console() << \"GL_MAX_COLOR_ATTACHMENTS: \" << texSize << std::endl;\n    cinder::app::console() << std::string(13, '-') << std::endl;\n#endif\n\n\/\/    glGetIntegerv(GL_MAX_TEXTURE_SIZE, &texSize);\n\/\/    if (size.x > texSize) {\n\/\/        \/\/ TODO - tile horizontally\n\/\/        cinder::app::console() << \"ERROR - setup width '\" << size.x << \"' exceeds maximum texture size '\" << texSize << \"', tiling unimplemented\" << std::endl;\n\/\/    }\n\/\/    if (size.y > texSize) {\n\/\/        \/\/ TODO - tile vertically\n\/\/        cinder::app::console() << \"ERROR - setup height '\" << size.y << \"' exceeds maximum texture size '\" << texSize << \"', tiling unimplemented\" << std::endl;\n\/\/    }\n\/\/\n\/\/    glGetIntegerv(GL_MAX_COLOR_ATTACHMENTS, &texSize);\n\/\/    if (attachments > GL_MAX_COLOR_ATTACHMENTS) {\n\/\/        cinder::app::console() << \"ERROR - number of attachments '\" << attachments << \"' exceeds '\" << texSize << \"'\" << std::endl;\n\/\/    }\n\/\/\n\/\/    float attachmentMemorySizeMB = size.x * size.y * 4 \/ 1024 \/ 1024;\n\/\/    float totalSizeMB = attachmentMemorySizeMB * attachments;\n\/\/\n\/\/    if (gl::isExtensionAvailable(\"GL_NV_texture_barrier\")) {\n\/\/        if (texSize >= 2 * size.x && texSize >= size.y) {\n\/\/            \/\/ TODO - double-wide\n\/\/        } else if (texSize >= 2 * size.y && texSize >= size.x) {\n\/\/            \/\/ TODO - double-tall\n\/\/        } else {\n\/\/            \/\/ TODO - tile\n\/\/        }\n\/\/    }\n\n    gl::Fbo::Format format;\n    format.enableColorBuffer(true, attachments);\n    format.enableDepthBuffer(false);\n\n    mFBO = gl::Fbo(size.x, size.y, format);\n    mFBO.bindFramebuffer(); {\n        GLenum buffers[attachments];\n        for (unsigned int idx = 0; idx < attachments; idx++) {\n            buffers[idx] = GL_COLOR_ATTACHMENT0 + idx;\n        }\n        glDrawBuffers(attachments, buffers);\n        gl::setViewport(mFBO.getBounds());\n        gl::clear();\n    } mFBO.unbindFramebuffer();\n}\n\n#pragma mark - CONNECTIONS\n\nvoid Context::connectNodes(const NodeRef& sourceNode, const NodePortRef& sourcePort, const NodeRef& destinationNode, const NodePortRef& destinationPort) {\n    \/\/ remove from output connections if destination port already connected\n    if (mInputConnections[destinationNode].count(destinationPort->getKey()) > 0) {\n        std::vector<NodePortConnectionRef> connections = mOutputConnections[sourceNode][sourcePort->getKey()];\n        connections.erase(std::remove_if(connections.begin(), connections.end(), [destinationNode](const NodePortConnectionRef& c) {\n            return c->getDestinationNode() == destinationNode;\n        }), connections.end());\n    }\n\n    NodePortConnectionRef connection = NodePortConnection::create(sourceNode, sourcePort->getKey(), destinationNode, destinationPort->getKey());\n    mInputConnections[destinationNode][destinationPort->getKey()] = connection;\n    mOutputConnections[sourceNode][sourcePort->getKey()].push_back(connection);\n\n    \/\/ wipe render stack to force a rebuild\n    mRenderStack.clear();\n}\n\nvoid Context::connectNodes(const NodeRef& sourceNode, const std::string& sourceNodePortKey, const NodeRef& destinationNode, const std::string& destinationNodePortKey) {\n    NodePortRef sourcePort = sourceNode->getOutputPortForKey(sourceNodePortKey);\n    NodePortRef destinationPort = destinationNode->getInputPortForKey(destinationNodePortKey);\n    connectNodes(sourceNode, sourcePort, destinationNode, destinationPort);\n}\n\nvoid Context::connectNodes(const NodeRef& sourceNode, const NodeRef& destinationNode) {\n    connectNodes(sourceNode, \"image\", destinationNode, \"image\");\n}\n\n#pragma mark -\n\ngl::Texture& Context::evaluate(const NodeRef& node) {\n    \/\/ rebuild render stack (flush cache) if the stack is empty or the node changes (cache key)\n    if (mRenderStack.size() == 0 || node != mRenderNode) {\n        mRenderNode = node;\n        BranchRef root = branchForNode(mRenderNode);\n        mRenderStack = renderStackForRootBranch(root);\n    }\n\n#if defined(DEBUG)\n    \/\/ ASCII visualization\n    cinder::app::console() << std::string(3, '#') << std::endl;\n    for (const BranchRef& b : mRenderStack) {\n        printBranch(b);\n    }\n    cinder::app::console() << std::endl;\n#endif\n\n    \/\/ render branches\n    unsigned int outAttachment = 0;\n\n    Area viewport = gl::getViewport();\n    gl::setViewport(mFBO.getBounds());\n    mFBO.bindFramebuffer(); {\n        gl::pushMatrices(); {\n            gl::setMatricesWindow(mFBO.getSize(), false);\n\n            \/\/ int instead of GLenum for Cinder's FBO bindTexture\/getTexture\n            std::vector<int> availableAttachments;\n            for (unsigned int idx = 0; idx < mFBO.getFormat().getNumColorBuffers(); idx++) {\n                availableAttachments.push_back(idx);\n            }\n            std::map<NodeRef, int> attachmentsMap;\n\n            for (const BranchRef& b : mRenderStack) {\n                size_t attachmentIndex = 0;\n                outAttachment = availableAttachments.at(attachmentIndex);\n                int inAttachment = -1;\n\n                for (size_t nodeIdx = 0; nodeIdx < b->getNodes().size(); nodeIdx++) {\n                    \/\/ TODO - hoist draw buffer assignment\n                    NodeRef n = b->getNodes().at(nodeIdx);\n                    SourceNodeRef s = std::dynamic_pointer_cast<SourceNode>(n);\n                    if (s) {\n                        glDrawBuffer(GL_COLOR_ATTACHMENT0 + outAttachment);\n\n                        FBOImageRef outputFBOImage = FBOImage::create(mFBO, outAttachment);\n                        s->render(outputFBOImage);\n\n                        inAttachment = outAttachment;\n                    } else {\n                        EffectorNodeRef e = std::dynamic_pointer_cast<EffectorNode>(n);\n                        if (e) {\n                            std::vector<NodePortConnectionRef> connections = getInputConnectionsForNodeWithPortType(n, NodePortType::FBOImage);\n                            if (connections.size() == 1) {\n                                NodePortConnectionRef c = connections.at(0);\n                                \/\/ grab attachment from map when appropriate\n                                if (inAttachment == -1) {\n                                    inAttachment = attachmentsMap[c->getSourceNode()];\n                                    attachmentsMap.erase(c->getSourceNode());\n                                    availableAttachments.push_back(inAttachment);\n                                }\n                                FBOImageRef inputFBOImage = FBOImage::create(mFBO, inAttachment);\n                                e->setValueForInputPortKey(inputFBOImage, c->getDestinationPortKey());\n\n                                attachmentIndex = (attachmentIndex + 1) % availableAttachments.size();\n                                outAttachment = availableAttachments.at(attachmentIndex);\n                                glDrawBuffer(GL_COLOR_ATTACHMENT0 + outAttachment);\n\n                                FBOImageRef outputFBOImage = FBOImage::create(mFBO, outAttachment);\n                                e->render(outputFBOImage);\n\n                                inAttachment = outAttachment;\n                            } else if (connections.size() > 1) {\n                                for (const NodePortConnectionRef& c : connections) {\n                                    inAttachment = attachmentsMap[c->getSourceNode()];\n                                    attachmentsMap.erase(c->getSourceNode());\n                                    availableAttachments.push_back(inAttachment);\n\n                                    FBOImageRef inputFBOImage = FBOImage::create(mFBO, inAttachment);\n                                    e->setValueForInputPortKey(inputFBOImage, c->getDestinationPortKey());\n                                }\n\n                                glDrawBuffer(GL_COLOR_ATTACHMENT0 + outAttachment);\n\n                                FBOImageRef outputFBOImage = FBOImage::create(mFBO, outAttachment);\n                                e->render(outputFBOImage);\n                                \n                                inAttachment = outAttachment;\n                            }\n                        }\n                    }\n\n                    \/\/ stash output attachment and accompanying node when branch concludes\n                    if (nodeIdx == b->getNodes().size() - 1) {\n                        attachmentsMap[n] = outAttachment;\n                        availableAttachments.erase(std::find(availableAttachments.begin(), availableAttachments.end(), outAttachment));\n                    }\n                }\n            }\n        } gl::popMatrices();\n    } mFBO.unbindFramebuffer();\n    gl::setViewport(viewport);\n\n    return mFBO.getTexture(outAttachment);\n}\n\n#pragma mark -\n\nvoid Context::printBranch(const BranchRef& branch) {\n\/\/    for (const NodeRef& n : branch->getNodes()) {\n\/\/        cinder::app::console() << n->getName() << \" → \";\n\/\/    }\n\/\/    cinder::app::console() << \" (\" << branch->getMaxInputCost() << \")\" << std::endl;\n    for (const NodeRef& n : branch->getNodes()) {\n        if (!std::dynamic_pointer_cast<SourceNode>(n)) {\n            cinder::app::console() << \" → \";\n        }\n\n        std::string name = n->getName();\n        name.resize(3, ' ');\n        cinder::app::console() << \"[\" << name << \"]\";\n    }\n    cinder::app::console() << \" (\" << branch->getMaxInputCost() << \")\";\n    cinder::app::console() << std::endl;\n}\n\nBranchRef Context::branchForNode(const NodeRef& node) {\n    std::map<NodeRef, BranchRef> branchMap;\n    std::deque<NodeRef> nodeStack;\n\n    \/\/ create branches\n    NodeRef n = node;\n    while (n) {\n        if (branchMap.count(n) == 0) {\n            std::deque<NodeRef> nodes;\n\n            NodeRef n2 = n;\n            while (n2) {\n                nodes.push_front(n2);\n\n                std::vector<NodePortConnectionRef> connections = getInputConnectionsForNodeWithPortType(n2, NodePortType::FBOImage);\n                if (connections.size() == 0) {\n                    n2 = nullptr;\n                } else if (connections.size() == 1) {\n                    NodePortConnectionRef connection = connections.at(0);\n                    n2 = connection->getSourceNode();\n\n                    \/\/ branch on multiple outputs\n                    if (getOutputConnectionsForNodeWithPortType(n2, NodePortType::FBOImage).size() > 1) {\n                        nodeStack.push_front(n2);\n                        n2 = nullptr;\n                    }\n                } else if (connections.size() > 1) {\n                    \/\/ branch on multiple inputs\n                    for (const NodePortConnectionRef& c : connections) {\n                        nodeStack.push_front(c->getSourceNode());\n                    }\n                    n2 = nullptr;\n                }\n            }\n\n            BranchRef branch = Branch::create(nodes);\n            branchMap[n] = branch;\n        }\n\n        if (nodeStack.empty()) {\n            n = nullptr;\n        } else {\n            n = nodeStack.front();\n            nodeStack.pop_front();\n        }\n    }\n\n    \/\/ connect branches\n    for (auto& kv : branchMap) {\n        BranchRef destinationBranch = kv.second;\n        n = destinationBranch->getNodes().front();\n\n        std::vector<NodePortConnectionRef> connections = getInputConnectionsForNodeWithPortType(n, NodePortType::FBOImage);\n        for (const NodePortConnectionRef& c : connections) {\n            BranchRef sourceBranch = branchMap[c->getSourceNode()];\n            destinationBranch->connectInputBranch(sourceBranch);\n        }\n    }\n\n    return branchMap[node];\n}\n\nstd::deque<BranchRef> Context::renderStackForRootBranch(const BranchRef& branch) {\n    std::deque<BranchRef> renderStack;\n    std::deque<BranchRef> branchStack;\n\n    BranchRef b = branch;\n    while (b) {\n        renderStack.push_front(b);\n\n        std::vector<BranchConnectionRef> inputConnections = b->getInputConnections();\n        if (inputConnections.empty()) {\n            if (branchStack.empty()) {\n                b = nullptr;\n            } else {\n                b = branchStack.front();\n                branchStack.pop_front();\n            }\n        } else {\n            \/\/ sort by cost DESC\n            std::vector<BranchConnectionRef> sortedInputConnections = inputConnections;\n            std::sort(sortedInputConnections.begin(), sortedInputConnections.end(), [](const BranchConnectionRef& c1, const BranchConnectionRef& c2) {\n                return c1->getInputCost() > c2->getInputCost();\n            });\n\n            \/\/ follow cheapest path\n            b = sortedInputConnections.back()->getSourceBranch();\n            sortedInputConnections.pop_back();\n\n            \/\/ push the others\n            for (const BranchConnectionRef& c : sortedInputConnections) {\n                branchStack.push_front(c->getSourceBranch());\n            }\n        }\n    }\n\n    return renderStack;\n}\n\n}}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n#include <cassert>\n\n#include \"CubeCmd.h\"\n#include \"HdfWriter.h\"\n#include \"TextWriter.h\"\n#include \"VtkWriter.h\"\n#include \"StringUtils.h\"\n\nusing namespace std;\nusing namespace cigma;\n\n\/\/ ---------------------------------------------------------------------------\n\ncigma::CubeCmd::CubeCmd()\n{\n    name = \"cube\";\n\n    L = M = N = 0;\n    mesh = 0;\n    writer = 0;\n}\n\ncigma::CubeCmd::~CubeCmd()\n{\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\nvoid cigma::CubeCmd::setupOptions(AnyOption *opt)\n{\n    \/\/cout << \"Calling cigma::CubeCmd::setupOptions()\" << endl;\n    assert(opt != 0);\n\n    \/* setup usage *\/\n    opt->addUsage(\"Usage:\");\n    opt->addUsage(\"  cigma cube [options]\");\n    opt->addUsage(\"    -x               Number of elements along x-dimension\");\n    opt->addUsage(\"    -y               Number of elements along y-dimension\");\n    opt->addUsage(\"    -z               Number of elements along z-dimension\");\n    opt->addUsage(\"    --hex8           Create hexahedral partition (default)\");\n    opt->addUsage(\"    --tet4           Create tetrahedral partition\");\n    opt->addUsage(\"    --output         Target output file\");\n    opt->addUsage(\"    --coords-path    Target path for coordinates (.h5 only)\");\n    opt->addUsage(\"    --connect-path   Target path for connectivity (.h5 only)\");\n\n    \/* setup flags and options *\/\n\n    opt->setFlag(\"help\", 'h');\n    opt->setFlag(\"verbose\", 'v');\n    \n    opt->setFlag(\"hex8\");\n    opt->setFlag(\"tet4\");\n    \n    opt->setOption('x');\n    opt->setOption('y');\n    opt->setOption('z');\n\n    opt->setOption(\"output\");\n    opt->setOption(\"coords-path\");\n    opt->setOption(\"connect-path\");\n\n}\n\n\nvoid cigma::CubeCmd::configure(AnyOption *opt)\n{\n    \/\/std::cout << \"Calling cigma::CubeCmd::configure()\" << std::endl;\n    assert(opt != 0);\n\n    if (!opt->hasOptions())\n    {\n        \/\/std::cerr << \"No options?\" << std::endl;\n        opt->printUsage();\n        exit(1);\n    }\n\n    char *in;\n    string inputstr;\n\n\n    \/\/ read verbose flag\n    verbose = opt->getFlag(\"verbose\");\n\n\n    \/\/ read L\n    in = opt->getValue('x');\n    if (in == 0)\n    {\n        cerr << \"cube: Please specify the option -x\" << endl;\n        exit(1);\n    }\n    inputstr = in;\n    string_to_int(inputstr, L);\n\n    \/\/ read M\n    in = opt->getValue('y');\n    if (in == 0)\n    {\n        cerr << \"cube: Please specify the option -y\" << endl;\n        exit(1);\n    }\n    inputstr = in;\n    string_to_int(inputstr, M);\n\n    \/\/ read N\n    in = opt->getValue('z');\n    if (in == 0)\n    {\n        cerr << \"cube: Please specify the option -z\" << endl;\n        exit(1);\n    }\n    inputstr = in;\n    string_to_int(inputstr, N);\n\n\n\n    \/\/ read output file\n    in = opt->getValue(\"output\");\n    if (in == 0)\n    {\n        cerr << \"cube: Please specify the option --output\" << endl;\n        exit(1);\n    }\n    output_filename = in;\n\n\n    \/\/ determine the extension and instantiate appropriate writer object\n    string root, ext;\n    path_splitext(output_filename, root, ext);\n    new_writer(&writer, ext);\n    if (writer == 0)\n    {\n        cerr << \"cube: File with bad extension (\" << ext << \")\" << endl;\n        exit(1);\n    }\n\n\n    \/\/ read target path for coordinates array\n    in = opt->getValue(\"coords-path\");\n    if (in == 0)\n    {\n        if (writer->getType() == Writer::HDF_WRITER)\n        {\n            coords_path = \"\/coordinates\";\n        }\n    }\n    else\n    {\n        coords_path = in;\n    }\n    if ((coords_path != \"\") && (writer->getType() != Writer::HDF_WRITER))\n    {\n        cerr << \"cube: Can only use --coords-path \"\n             << \"when writing to an HDF5 (.h5) file\" << endl;\n        exit(1);\n\n    }\n\n    \/\/ read target path for connectivity array\n    in = opt->getValue(\"connect-path\");\n    if (in == 0)\n    {\n        if (writer->getType() == Writer::HDF_WRITER)\n        {\n            connect_path = \"\/connectivity\";\n        }\n    }\n    else\n    {\n        connect_path = in;\n    }\n    if ((connect_path != \"\") && (writer->getType() != Writer::HDF_WRITER))\n    {\n        cerr << \"cube: Can only use --connect-path \"\n             << \"when writing to an HDF5 (.h5) file\" << endl;\n        exit(1);\n    }\n\n\n    \/\/ read tet\/hex flags\n    bool hexFlag = opt->getFlag(\"hex8\");\n    bool tetFlag = opt->getFlag(\"tet4\");\n    if (hexFlag && tetFlag)\n    {\n        std::cerr << \"cube: Please specify only one of the flags \"\n                  << \"--hex8 or --tet8\" << std::endl;\n        exit(1);\n    }\n    if (!tetFlag)\n    {\n        hexFlag = true;\n    }\n    assert(hexFlag != tetFlag);\n\n\n    \/\/ initialize mesh object\n    mesh = new cigma::CubeMeshPart();\n    mesh->calc_coordinates(L,M,N);\n    if (hexFlag) { mesh->calc_hex8_connectivity(); }\n    if (tetFlag) { mesh->calc_tet4_connectivity(); }\n}\n\n\nint cigma::CubeCmd::run()\n{\n    \/\/std::cout << \"Calling cigma::CubeCmd::run()\" << std::endl;\n    assert(mesh != 0);\n    assert(writer != 0);\n\n    if (verbose)\n    {\n        std::cout << \"L, M, N = (\" << L << \", \" << M << \", \" << N << \")\" << std::endl;\n        std::cout << \"mesh->nno = \" << mesh->nno << std::endl;\n        std::cout << \"mesh->nel = \" << mesh->nel << std::endl;\n        std::cout << \"mesh->ndofs = \" << mesh->ndofs << std::endl;\n    }\n\n\n    if (verbose)\n    {\n        int e = 0;\n        double pts[2][3] = {{0.5, 0.5, 0.5},\n                            {1.0, 1.0, 1.0}};\n\n        cout << \"Looking for centroid...\" << endl;\n        bool found = mesh->find_cell(pts[0], &e);\n\n        if (!found)\n        {\n            cerr << \"Error: Could not find cell \"\n                 << \"containing centroid (0.5,0.5,0.5)\" << endl;\n            exit(1);\n        }\n        else\n        {\n            cout << \"Found centroid in cell \" << e << endl;\n        }\n    }\n\n    int ierr;\n\n    cout << \"Creating file \" << output_filename << endl;\n\n    if (writer->getType() == Writer::HDF_WRITER)\n    {\n        HdfWriter *hdfWriter = static_cast<HdfWriter*>(writer);\n        ierr = hdfWriter->open(output_filename);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not open (or create) the HDF5 file \" << output_filename << endl;\n            exit(1);\n        }\n\n        ierr = hdfWriter->write_coordinates(coords_path.c_str(), mesh->coords, mesh->nno, mesh->nsd);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not write dataset \" << coords_path << endl;\n            exit(1);\n        }\n\n        ierr = hdfWriter->write_connectivity(connect_path.c_str(), mesh->connect, mesh->nel, mesh->ndofs);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not write dataset \" << connect_path << endl;\n            exit(1);\n        }\n\n        hdfWriter->close();\n    }\n    else if (writer->getType() == Writer::TXT_WRITER)\n    {\n        TextWriter *txtWriter = static_cast<TextWriter*>(writer);\n        ierr = txtWriter->open(output_filename);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not create output text file \" << output_filename << endl;\n            exit(1);\n        }\n\n        txtWriter->write_coordinates(mesh->coords, mesh->nno, mesh->nsd);\n        txtWriter->write_connectivity(mesh->connect, mesh->nel, mesh->ndofs);\n        txtWriter->close();\n    }\n    else if (writer->getType() == Writer::VTK_WRITER)\n    {\n        VtkWriter *vtkWriter = static_cast<VtkWriter*>(writer);\n        ierr = vtkWriter->open(output_filename);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not create output VTK file \" << output_filename << endl;\n            exit(1);\n        }\n\n        vtkWriter->write_header();\n        vtkWriter->write_points(mesh->coords, mesh->nno, mesh->nsd);\n        vtkWriter->write_cells(mesh->connect, mesh->nel, mesh->ndofs);\n        vtkWriter->write_cell_types(mesh->nsd, mesh->nel, mesh->ndofs);\n        vtkWriter->close();\n    }\n    else\n    {\n        \/* this should be unreachable *\/\n        cerr << \"Fatal Error: Unsupported extension in output filename?\" << endl;\n        return 1;\n    }\n\n\n    if (writer != 0)\n    {\n        delete writer;\n    }\n\n    return 0;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\n<commit_msg>Clarified message in CubeCmd (quick test on -v flag)<commit_after>#include <iostream>\n#include <string>\n#include <cassert>\n\n#include \"CubeCmd.h\"\n#include \"HdfWriter.h\"\n#include \"TextWriter.h\"\n#include \"VtkWriter.h\"\n#include \"StringUtils.h\"\n\nusing namespace std;\nusing namespace cigma;\n\n\/\/ ---------------------------------------------------------------------------\n\ncigma::CubeCmd::CubeCmd()\n{\n    name = \"cube\";\n\n    L = M = N = 0;\n    mesh = 0;\n    writer = 0;\n}\n\ncigma::CubeCmd::~CubeCmd()\n{\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\nvoid cigma::CubeCmd::setupOptions(AnyOption *opt)\n{\n    \/\/cout << \"Calling cigma::CubeCmd::setupOptions()\" << endl;\n    assert(opt != 0);\n\n    \/* setup usage *\/\n    opt->addUsage(\"Usage:\");\n    opt->addUsage(\"  cigma cube [options]\");\n    opt->addUsage(\"    -x               Number of elements along x-dimension\");\n    opt->addUsage(\"    -y               Number of elements along y-dimension\");\n    opt->addUsage(\"    -z               Number of elements along z-dimension\");\n    opt->addUsage(\"    --hex8           Create hexahedral partition (default)\");\n    opt->addUsage(\"    --tet4           Create tetrahedral partition\");\n    opt->addUsage(\"    --output         Target output file\");\n    opt->addUsage(\"    --coords-path    Target path for coordinates (.h5 only)\");\n    opt->addUsage(\"    --connect-path   Target path for connectivity (.h5 only)\");\n\n    \/* setup flags and options *\/\n\n    opt->setFlag(\"help\", 'h');\n    opt->setFlag(\"verbose\", 'v');\n    \n    opt->setFlag(\"hex8\");\n    opt->setFlag(\"tet4\");\n    \n    opt->setOption('x');\n    opt->setOption('y');\n    opt->setOption('z');\n\n    opt->setOption(\"output\");\n    opt->setOption(\"coords-path\");\n    opt->setOption(\"connect-path\");\n\n}\n\n\nvoid cigma::CubeCmd::configure(AnyOption *opt)\n{\n    \/\/std::cout << \"Calling cigma::CubeCmd::configure()\" << std::endl;\n    assert(opt != 0);\n\n    if (!opt->hasOptions())\n    {\n        \/\/std::cerr << \"No options?\" << std::endl;\n        opt->printUsage();\n        exit(1);\n    }\n\n    char *in;\n    string inputstr;\n\n\n    \/\/ read verbose flag\n    verbose = opt->getFlag(\"verbose\");\n\n\n    \/\/ read L\n    in = opt->getValue('x');\n    if (in == 0)\n    {\n        cerr << \"cube: Please specify the option -x\" << endl;\n        exit(1);\n    }\n    inputstr = in;\n    string_to_int(inputstr, L);\n\n    \/\/ read M\n    in = opt->getValue('y');\n    if (in == 0)\n    {\n        cerr << \"cube: Please specify the option -y\" << endl;\n        exit(1);\n    }\n    inputstr = in;\n    string_to_int(inputstr, M);\n\n    \/\/ read N\n    in = opt->getValue('z');\n    if (in == 0)\n    {\n        cerr << \"cube: Please specify the option -z\" << endl;\n        exit(1);\n    }\n    inputstr = in;\n    string_to_int(inputstr, N);\n\n\n\n    \/\/ read output file\n    in = opt->getValue(\"output\");\n    if (in == 0)\n    {\n        cerr << \"cube: Please specify the option --output\" << endl;\n        exit(1);\n    }\n    output_filename = in;\n\n\n    \/\/ determine the extension and instantiate appropriate writer object\n    string root, ext;\n    path_splitext(output_filename, root, ext);\n    new_writer(&writer, ext);\n    if (writer == 0)\n    {\n        cerr << \"cube: File with bad extension (\" << ext << \")\" << endl;\n        exit(1);\n    }\n\n\n    \/\/ read target path for coordinates array\n    in = opt->getValue(\"coords-path\");\n    if (in == 0)\n    {\n        if (writer->getType() == Writer::HDF_WRITER)\n        {\n            coords_path = \"\/coordinates\";\n        }\n    }\n    else\n    {\n        coords_path = in;\n    }\n    if ((coords_path != \"\") && (writer->getType() != Writer::HDF_WRITER))\n    {\n        cerr << \"cube: Can only use --coords-path \"\n             << \"when writing to an HDF5 (.h5) file\" << endl;\n        exit(1);\n\n    }\n\n    \/\/ read target path for connectivity array\n    in = opt->getValue(\"connect-path\");\n    if (in == 0)\n    {\n        if (writer->getType() == Writer::HDF_WRITER)\n        {\n            connect_path = \"\/connectivity\";\n        }\n    }\n    else\n    {\n        connect_path = in;\n    }\n    if ((connect_path != \"\") && (writer->getType() != Writer::HDF_WRITER))\n    {\n        cerr << \"cube: Can only use --connect-path \"\n             << \"when writing to an HDF5 (.h5) file\" << endl;\n        exit(1);\n    }\n\n\n    \/\/ read tet\/hex flags\n    bool hexFlag = opt->getFlag(\"hex8\");\n    bool tetFlag = opt->getFlag(\"tet4\");\n    if (hexFlag && tetFlag)\n    {\n        std::cerr << \"cube: Please specify only one of the flags \"\n                  << \"--hex8 or --tet8\" << std::endl;\n        exit(1);\n    }\n    if (!tetFlag)\n    {\n        hexFlag = true;\n    }\n    assert(hexFlag != tetFlag);\n\n\n    \/\/ initialize mesh object\n    mesh = new cigma::CubeMeshPart();\n    mesh->calc_coordinates(L,M,N);\n    if (hexFlag) { mesh->calc_hex8_connectivity(); }\n    if (tetFlag) { mesh->calc_tet4_connectivity(); }\n}\n\n\nint cigma::CubeCmd::run()\n{\n    \/\/std::cout << \"Calling cigma::CubeCmd::run()\" << std::endl;\n    assert(mesh != 0);\n    assert(writer != 0);\n\n    if (verbose)\n    {\n        std::cout << \"L, M, N = (\" << L << \", \" << M << \", \" << N << \")\" << std::endl;\n        std::cout << \"mesh->nno = \" << mesh->nno << std::endl;\n        std::cout << \"mesh->nel = \" << mesh->nel << std::endl;\n        std::cout << \"mesh->ndofs = \" << mesh->ndofs << std::endl;\n    }\n\n\n    if (verbose)\n    {\n        int e = 0;\n        double pts[2][3] = {{0.5, 0.5, 0.5},\n                            {1.0, 1.0, 1.0}};\n\n        cout << \"cube test: Looking for centroid...\" << endl;\n        bool found = mesh->find_cell(pts[0], &e);\n\n        if (!found)\n        {\n            cerr << \"cube test error: Could not find cell \"\n                 << \"containing centroid (0.5,0.5,0.5)\" << endl;\n            exit(1);\n        }\n        else\n        {\n            cout << \"cube test: Found centroid in cell \" << e << endl;\n        }\n    }\n\n    int ierr;\n\n    cout << \"Creating file \" << output_filename << endl;\n\n    if (writer->getType() == Writer::HDF_WRITER)\n    {\n        HdfWriter *hdfWriter = static_cast<HdfWriter*>(writer);\n        ierr = hdfWriter->open(output_filename);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not open (or create) the HDF5 file \" << output_filename << endl;\n            exit(1);\n        }\n\n        ierr = hdfWriter->write_coordinates(coords_path.c_str(), mesh->coords, mesh->nno, mesh->nsd);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not write dataset \" << coords_path << endl;\n            exit(1);\n        }\n\n        ierr = hdfWriter->write_connectivity(connect_path.c_str(), mesh->connect, mesh->nel, mesh->ndofs);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not write dataset \" << connect_path << endl;\n            exit(1);\n        }\n\n        hdfWriter->close();\n    }\n    else if (writer->getType() == Writer::TXT_WRITER)\n    {\n        TextWriter *txtWriter = static_cast<TextWriter*>(writer);\n        ierr = txtWriter->open(output_filename);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not create output text file \" << output_filename << endl;\n            exit(1);\n        }\n\n        txtWriter->write_coordinates(mesh->coords, mesh->nno, mesh->nsd);\n        txtWriter->write_connectivity(mesh->connect, mesh->nel, mesh->ndofs);\n        txtWriter->close();\n    }\n    else if (writer->getType() == Writer::VTK_WRITER)\n    {\n        VtkWriter *vtkWriter = static_cast<VtkWriter*>(writer);\n        ierr = vtkWriter->open(output_filename);\n        if (ierr < 0)\n        {\n            cerr << \"Error: Could not create output VTK file \" << output_filename << endl;\n            exit(1);\n        }\n\n        vtkWriter->write_header();\n        vtkWriter->write_points(mesh->coords, mesh->nno, mesh->nsd);\n        vtkWriter->write_cells(mesh->connect, mesh->nel, mesh->ndofs);\n        vtkWriter->write_cell_types(mesh->nsd, mesh->nel, mesh->ndofs);\n        vtkWriter->close();\n    }\n    else\n    {\n        \/* this should be unreachable *\/\n        cerr << \"Fatal Error: Unsupported extension in output filename?\" << endl;\n        return 1;\n    }\n\n\n    if (writer != 0)\n    {\n        delete writer;\n    }\n\n    return 0;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\n<|endoftext|>"}
{"text":"<commit_before>                                                                         \/*\n * ISR.cpp\n *\n *  Created on: 27.04.2017 based on tutorium-example\n *      Author: abt674\n *\/\n\n#include <iostream>\n#include <cstdlib>\n#include <sys\/neutrino.h>\n#include <sys\/siginfo.h>\n#include \"HWaccess.h\"\n#include \"Control.h\"\n#include \"ISR.h\"\n\nusing namespace std;\n\nint isrId = 0;\nint isrChannel = 0;\nint isrConnection = 0;\nstruct sigevent isrEvent;\nint portbc = 0;\nControl * ctrl;\n\nbool button_start_active = true;\nbool button_stop_active = true;\nbool button_reset_active = true;\nbool button_estop_active = true;\nbool lb_entry_active = true;\nbool lb_exit_active = true;\nbool lb_height_active = true;\nbool lb_ramp_active = true;\nbool lb_switch_active = true;\nbool sensor_height_active = true;\nbool sensor_metal_active = true;\nbool switch_open = true;\n\n\n\n\n\/\/ ISR (c-Function)\nconst struct sigevent* ISR_DIO(void* arg, int id) {\n    struct sigevent* event = (struct sigevent*) arg;\n    out8(0x30F, 0);\n\n    event->sigev_notify = SIGEV_PULSE ;\n    event->__sigev_un1.__sigev_coid = isrConnection;\n    event->__sigev_un2.__st.__sigev_code = 0;\n    event->sigev_value.sival_int = in8(0x301) | (in8(0x302) << 8);\n    return event;\n}\n\n\/\/ISR anmelden\nvoid registerISR(void){\n\t\/\/Lichtschranken und Sensoren\n    out8(0x30F, 0);\n    out8(0x30B, 0b11111101);\n    \/\/Buttons\n    out8(0x30B, 0b11111001);\n\n    SIGEV_PULSE_INIT(&isrEvent, isrConnection, SIGEV_PULSE_PRIO_INHERIT, 0, 0);\n    isrId = InterruptAttach(11, ISR_DIO, &isrEvent, sizeof(isrEvent), 0);\n    if (isrId == -1) {\n        exit(EXIT_FAILURE);\n    }\n}\n\n\/\/nach Thread Ende ISR abmelden\nvoid unregisterISR(void){\n    if( InterruptDetach(isrId) == -1 ){\n        exit(EXIT_FAILURE);\n    }\n    out8(0x30B, 0b11111111);\n    out8(0x30F,0);\n}\n\n\/*\n * Creates the ISR-Channel\n * @param [control] Control Object for Methodcalls\n * *\/\nISR::ISR(Control * control) {\n    cout << \"ctor: ISR_Thread\" << endl;\n    ctrl = control;\n    if ((isrChannel = ChannelCreate(0)) == -1) {\n    \t\texit(EXIT_FAILURE);\n    \t}\n    \tcout<< \"isrchannel \" << isrChannel <<endl;\n\n    \tif ((isrConnection = ConnectAttach(0, 0, isrChannel, 0, 0)) == -1) {\n    \t\texit(EXIT_FAILURE);\n    \t}\n\n}\n\/*\n * deconstructor\n * *\/\nISR::~ISR() {\n    cout << \"dtor: ISR_Thread\" << endl;\n\n\n}\n\/*\n * \"main\"-function, call this to start the ISR\n * this function registers the ISR and determines the origin of an interrupt\n * *\/\nvoid ISR::operator()(){\n    \/\/ Init and Register ISR\n    if (ThreadCtl(_NTO_TCTL_IO_PRIV, 0) == -1){\n        exit(EXIT_FAILURE);\n    }\n    \/\/ Register Interrupt Service Routine\n    registerISR();\n\n    struct _pulse pulse;\n\n    portbc = in8(0x301) | (in8(0x302) << 8);\n    \/\/ Wait for Pulse Message\n    do{\n    \t\/\/pulse message empfangen(warten)\n        MsgReceivePulse(isrChannel,&pulse,sizeof(pulse),NULL);\n\n\n        \/\/register zuordnen\n        int diff = pulse.value.sival_int ^ portbc;\n        portbc =  pulse.value.sival_int;\n\n\n        \t\t\tif((diff & LightBarrier_ENTRY) == LightBarrier_ENTRY){\n        \t\t\t\t\tif (lb_entry_active) {\n        \t\t\t\t\t\tcout << \"LightBarrier_entry_\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_ENTRY_IN();\n        \t\t\t\t\t\tlb_entry_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tlb_entry_active = true;\n        \t\t\t\t\t\tctrl->lightBarrier_ENTRY_OUT();\n        \t\t\t\t\t}\n        \t\t\t}\n        \t\t\telse if((diff & LightBarrier_HEIGHT) == LightBarrier_HEIGHT){\n        \t\t\t\t\tif (lb_height_active) {\n        \t\t\t\t\t\tcout << \"LightBarrier_height\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_HEIGHT_IN();\n        \t\t\t\t\t\tlb_height_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tlb_height_active = true;\n        \t\t\t\t\t\tctrl->lightBarrier_HEIGHT_OUT();\n        \t\t\t\t\t}\n        \t\t\t}\n\n        \t\t\telse  if((diff & LightBarrier_SWITCH) == LightBarrier_SWITCH){\n        \t\t\t\t\tif (lb_switch_active){\n        \t\t\t\t\t\tcout << \"LightBarrier_switch\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_SWITCH_IN();\n        \t\t\t\t\t\tlb_switch_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tctrl->lightBarrier_SWITCH_OUT();\n        \t\t\t\t\t\tlb_switch_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n        \t\t\telse if((diff & LightBarrier_RAMP) == LightBarrier_RAMP){\n        \t\t\t\t\tif (lb_ramp_active) {\n        \t\t\t\t\t\tcout << \"LightBarrier_ramp\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_RAMP_IN();\n        \t\t\t\t\t\tlb_ramp_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tctrl->lightBarrier_RAMP_OUT();\n        \t\t\t\t\t\tlb_ramp_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if((diff & LightBarrier_EXIT) == LightBarrier_EXIT){\n        \t\t\t\t\tif (lb_exit_active) {\n        \t\t\t\t\t\tcout << \"LightBarrier_exit\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_EXIT_IN();\n        \t\t\t\t\t\tlb_exit_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tctrl->lightBarrier_EXIT_OUT();\n        \t\t\t\t\t\tlb_exit_active = true;\n        \t\t\t\t\t}\n    \t\t\t\t\t}\n\n    \t\t\t\telse if((diff & BUTTONSTART) == BUTTONSTART){\n        \t\t\t\t\tif (button_start_active) {\n        \t\t\t\t\t\tcout << \"button_start\" << endl;\n        \t\t\t\t\t\tctrl->b_Start();\n        \t\t\t\t\t\tbutton_start_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tbutton_start_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if((diff & BUTTONSTOP) == BUTTONSTOP){\n        \t\t\t\t\tif (button_stop_active) {\n        \t\t\t\t\t\tcout << \"button_stop\" << endl;\n        \t\t\t\t\t\tctrl->b_STOP();\n        \t\t\t\t\t\tbutton_stop_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tbutton_stop_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if((diff & BUTTONRESET) == BUTTONRESET){\n        \t\t\t\t\tif (button_reset_active) {\n        \t\t\t\t\t\tcout << \"button_reset\" << endl;\n        \t\t\t\t\t\tctrl->b_Reset();\n        \t\t\t\t\t\tbutton_reset_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tbutton_reset_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if ((diff & BUTTONESTOP) == BUTTONESTOP){\n\n        \t\t\t\t\tif (button_estop_active) {\n        \t\t\t\t\t\tcout << \"button_estop\" << endl;\n        \t\t\t\t\t\tctrl->b_EStop();\n        \t\t\t\t\t\tbutton_estop_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tbutton_estop_active = true;\n        \t\t\t\t\t}\n    \t\t\t\t\t}\n\n    \t\t\t\telse if ((diff & SENSOR_METAL) == SENSOR_METAL){\n        \t\t\t        if (sensor_metal_active) {\n        \t\t\t        \tcout << \"metal\" << endl;\n        \t\t\t        \tctrl->metal();\n        \t\t\t        \tsensor_metal_active = false;\n        \t\t\t        \t} else {\n        \t\t\t        \tcout << \"no_metal\" << endl;\n        \t\t\t            sensor_metal_active = true;\n        \t\t\t        }\n        \t\t\t}\n\n    \t\t\t\telse if ((diff & SENSOR_HEIGHT) == SENSOR_HEIGHT){\n        \t\t\t\t\tif (sensor_height_active) {\n        \t\t\t\t\t\tcout << \"sensor_height\" << endl;\n        \t\t\t\t\t\tctrl->height();\n        \t\t\t\t\t\tsensor_height_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tsensor_height_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if ((diff & SWITCH_OPEND) == SWITCH_OPEND){\n        \t\t\t\t\tif (switch_open) {\n        \t\t\t\t\t\tcout << \"switch is open\" << endl;\n        \t\t\t\t\t\tctrl->switchen();\n        \t\t\t\t\t\tswitch_open = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tcout << \"switch is closed\" << endl;\n        \t\t\t\t\t\tswitch_open = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n\n    }while(1);\n\n    \/\/ Cleanup\n    unregisterISR();\n    \/\/isr verbindung aufheben\n    if( ConnectDetach(isrConnection) == -1){\n        exit(EXIT_FAILURE);\n    }\n    \/\/channel lschen\n    if( ChannelDestroy(isrChannel) == -1 ){\n        exit(EXIT_FAILURE);\n    }\n\n\n\t}\n\n\n\n\n\n<commit_msg>ISR_Schleife abbrechbar<commit_after>                                                                         \/*\n * ISR.cpp\n *\n *  Created on: 27.04.2017 based on tutorium-example\n *      Author: abt674\n *\/\n\n#include <iostream>\n#include <cstdlib>\n#include <sys\/neutrino.h>\n#include <sys\/siginfo.h>\n#include \"HWaccess.h\"\n#include \"Control.h\"\n#include \"ISR.h\"\n\nusing namespace std;\n\nint isrId = 0;\nint isrChannel = 0;\nint isrConnection = 0;\nstruct sigevent isrEvent;\nint portbc = 0;\nControl * ctrl;\n\nbool button_start_active = true;\nbool button_stop_active = true;\nbool button_reset_active = true;\nbool button_estop_active = true;\nbool lb_entry_active = true;\nbool lb_exit_active = true;\nbool lb_height_active = true;\nbool lb_ramp_active = true;\nbool lb_switch_active = true;\nbool sensor_height_active = true;\nbool sensor_metal_active = true;\nbool switch_open = true;\n\n\n\n\n\/\/ ISR (c-Function)\nconst struct sigevent* ISR_DIO(void* arg, int id) {\n    struct sigevent* event = (struct sigevent*) arg;\n    out8(0x30F, 0);\n\n    event->sigev_notify = SIGEV_PULSE ;\n    event->__sigev_un1.__sigev_coid = isrConnection;\n    event->__sigev_un2.__st.__sigev_code = 0;\n    event->sigev_value.sival_int = in8(0x301) | (in8(0x302) << 8);\n    return event;\n}\n\n\/\/ISR anmelden\nvoid registerISR(void){\n\t\/\/Lichtschranken und Sensoren\n    out8(0x30F, 0);\n    out8(0x30B, 0b11111101);\n    \/\/Buttons\n    out8(0x30B, 0b11111001);\n\n    SIGEV_PULSE_INIT(&isrEvent, isrConnection, SIGEV_PULSE_PRIO_INHERIT, 0, 0);\n    isrId = InterruptAttach(11, ISR_DIO, &isrEvent, sizeof(isrEvent), 0);\n    if (isrId == -1) {\n        exit(EXIT_FAILURE);\n    }\n}\n\n\/\/nach Thread Ende ISR abmelden\nvoid unregisterISR(void){\n    if( InterruptDetach(isrId) == -1 ){\n        exit(EXIT_FAILURE);\n    }\n    out8(0x30B, 0b11111111);\n    out8(0x30F,0);\n}\n\n\/*\n * Creates the ISR-Channel\n * @param [control] Control Object for Methodcalls\n * *\/\nISR::ISR(Control * control) {\n    cout << \"ctor: ISR_Thread\" << endl;\n    ctrl = control;\n    if ((isrChannel = ChannelCreate(0)) == -1) {\n    \t\texit(EXIT_FAILURE);\n    \t}\n    \tcout<< \"isrchannel \" << isrChannel <<endl;\n\n    \tif ((isrConnection = ConnectAttach(0, 0, isrChannel, 0, 0)) == -1) {\n    \t\texit(EXIT_FAILURE);\n    \t}\n\n}\n\/*\n * deconstructor\n * *\/\nISR::~ISR() {\n    cout << \"dtor: ISR_Thread\" << endl;\n\n}\n\/*\n * \"main\"-function, call this to start the ISR\n * this function registers the ISR and determines the origin of an interrupt\n * *\/\nvoid ISR::operator()(){\n\tbool running = true;\n\n    \/\/ Init and Register ISR\n    if (ThreadCtl(_NTO_TCTL_IO_PRIV, 0) == -1){\n        exit(EXIT_FAILURE);\n    }\n    \/\/ Register Interrupt Service Routine\n    registerISR();\n\n    struct _pulse pulse;\n\n    portbc = in8(0x301) | (in8(0x302) << 8);\n    \/\/ Wait for Pulse Message\n    do{\n    \t\/\/pulse message empfangen(warten)\n        MsgReceivePulse(isrChannel,&pulse,sizeof(pulse),NULL);\n\n\n        \/\/register zuordnen\n        int diff = pulse.value.sival_int ^ portbc;\n        portbc =  pulse.value.sival_int;\n\n\n        \t\t\tif((diff & BUTTONESTOP) == BUTTONESTOP){\n\n    \t\t\t\t\tif (button_estop_active) {\n    \t\t\t\t\t\tcout << \"button_estop\" << endl;\n    \t\t\t\t\t\tctrl->b_EStop();\n    \t\t\t\t\t\tbutton_estop_active = false;\n    \t\t\t\t\t\trunning = false;\n    \t\t\t\t\t} else {\n    \t\t\t\t\t\tbutton_estop_active = true;\n    \t\t\t\t\t}\n\t\t\t\t\t}\n\n        \t\t\telse if((diff & LightBarrier_HEIGHT) == LightBarrier_HEIGHT){\n        \t\t\t\t\tif (lb_height_active) {\n        \t\t\t\t\t\tcout << \"LightBarrier_height\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_HEIGHT_IN();\n        \t\t\t\t\t\tlb_height_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tlb_height_active = true;\n        \t\t\t\t\t\tctrl->lightBarrier_HEIGHT_OUT();\n        \t\t\t\t\t}\n        \t\t\t}\n\n        \t\t\telse  if((diff & LightBarrier_SWITCH) == LightBarrier_SWITCH){\n        \t\t\t\t\tif (lb_switch_active){\n        \t\t\t\t\t\tcout << \"LightBarrier_switch\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_SWITCH_IN();\n        \t\t\t\t\t\tlb_switch_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tctrl->lightBarrier_SWITCH_OUT();\n        \t\t\t\t\t\tlb_switch_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n        \t\t\telse if((diff & LightBarrier_RAMP) == LightBarrier_RAMP){\n        \t\t\t\t\tif (lb_ramp_active) {\n        \t\t\t\t\t\tcout << \"LightBarrier_ramp\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_RAMP_IN();\n        \t\t\t\t\t\tlb_ramp_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tctrl->lightBarrier_RAMP_OUT();\n        \t\t\t\t\t\tlb_ramp_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if((diff & LightBarrier_EXIT) == LightBarrier_EXIT){\n        \t\t\t\t\tif (lb_exit_active) {\n        \t\t\t\t\t\tcout << \"LightBarrier_exit\" << endl;\n        \t\t\t\t\t\tctrl->lightBarrier_EXIT_IN();\n        \t\t\t\t\t\tlb_exit_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tctrl->lightBarrier_EXIT_OUT();\n        \t\t\t\t\t\tlb_exit_active = true;\n        \t\t\t\t\t}\n    \t\t\t\t\t}\n\n    \t\t\t\telse if((diff & BUTTONSTART) == BUTTONSTART){\n        \t\t\t\t\tif (button_start_active) {\n        \t\t\t\t\t\tcout << \"button_start\" << endl;\n        \t\t\t\t\t\tctrl->b_Start();\n        \t\t\t\t\t\tbutton_start_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tbutton_start_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if((diff & BUTTONSTOP) == BUTTONSTOP){\n        \t\t\t\t\tif (button_stop_active) {\n        \t\t\t\t\t\tcout << \"button_stop\" << endl;\n        \t\t\t\t\t\tctrl->b_STOP();\n        \t\t\t\t\t\tbutton_stop_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tbutton_stop_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if((diff & BUTTONRESET) == BUTTONRESET){\n        \t\t\t\t\tif (button_reset_active) {\n        \t\t\t\t\t\tcout << \"button_reset\" << endl;\n        \t\t\t\t\t\tctrl->b_Reset();\n        \t\t\t\t\t\tbutton_reset_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tbutton_reset_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if ((diff & LightBarrier_ENTRY) == LightBarrier_ENTRY){\n    \t\t\t\t\tif (lb_entry_active) {\n    \t\t\t\t\t\tcout << \"LightBarrier_entry_\" << endl;\n    \t\t\t\t\t\tctrl->lightBarrier_ENTRY_IN();\n    \t\t\t\t\t\tlb_entry_active = false;\n    \t\t\t\t\t} else {\n    \t\t\t\t\t\tlb_entry_active = true;\n    \t\t\t\t\t\tctrl->lightBarrier_ENTRY_OUT();\n    \t\t\t\t\t}\n    \t\t\t}\n\n    \t\t\t\telse if ((diff & SENSOR_METAL) == SENSOR_METAL){\n        \t\t\t        if (sensor_metal_active) {\n        \t\t\t        \tcout << \"metal\" << endl;\n        \t\t\t        \tctrl->metal();\n        \t\t\t        \tsensor_metal_active = false;\n        \t\t\t        \t} else {\n        \t\t\t        \tcout << \"no_metal\" << endl;\n        \t\t\t            sensor_metal_active = true;\n        \t\t\t        }\n        \t\t\t}\n\n    \t\t\t\telse if ((diff & SENSOR_HEIGHT) == SENSOR_HEIGHT){\n        \t\t\t\t\tif (sensor_height_active) {\n        \t\t\t\t\t\tcout << \"sensor_height\" << endl;\n        \t\t\t\t\t\tctrl->height();\n        \t\t\t\t\t\tsensor_height_active = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tsensor_height_active = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n    \t\t\t\telse if ((diff & SWITCH_OPEND) == SWITCH_OPEND){\n        \t\t\t\t\tif (switch_open) {\n        \t\t\t\t\t\tcout << \"switch is open\" << endl;\n        \t\t\t\t\t\tctrl->switchen();\n        \t\t\t\t\t\tswitch_open = false;\n        \t\t\t\t\t} else {\n        \t\t\t\t\t\tcout << \"switch is closed\" << endl;\n        \t\t\t\t\t\tswitch_open = true;\n        \t\t\t\t\t}\n        \t\t\t}\n\n\n    }while(running);\n\n    cout << \"Shutdown ISR...\"<<endl;\n    \/\/ Cleanup\n    unregisterISR();\n    \/\/isr verbindung aufheben\n    if( ConnectDetach(isrConnection) == -1){\n        exit(EXIT_FAILURE);\n    }\n    \/\/channel lschen\n    if( ChannelDestroy(isrChannel) == -1 ){\n        exit(EXIT_FAILURE);\n    }\n    cout << \"ISR detached and channel destroyed!\" << endl;\n\t}\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright © 2010 Vladimír Vondruš <mosra@centrum.cz>\n\n    This file is part of Magnum.\n\n    Magnum 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    Magnum is distributed in the hope that it 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*\/\n\n#include \"IdentityShader.h\"\n\nnamespace Magnum { namespace Examples {\n\nIdentityShader::IdentityShader() {\n    Shader* vertexShader = Shader::fromFile(Shader::Vertex, \"identity.vert\");\n    Shader* fragmentShader = Shader::fromFile(Shader::Fragment, \"identity.frag\");\n\n    loadShader(vertexShader);\n    loadShader(fragmentShader);\n\n    bindAttribute(Vertex, \"vertex\");\n    bindAttribute(Color, \"color\");\n\n    link();\n\n    delete vertexShader;\n    delete fragmentShader;\n}\n\n}}\n<commit_msg>Renamed AbstractShaderProgram::{load -> attach}Shader().<commit_after>\/*\n    Copyright © 2010 Vladimír Vondruš <mosra@centrum.cz>\n\n    This file is part of Magnum.\n\n    Magnum 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    Magnum is distributed in the hope that it 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*\/\n\n#include \"IdentityShader.h\"\n\nnamespace Magnum { namespace Examples {\n\nIdentityShader::IdentityShader() {\n    Shader* vertexShader = Shader::fromFile(Shader::Vertex, \"identity.vert\");\n    Shader* fragmentShader = Shader::fromFile(Shader::Fragment, \"identity.frag\");\n\n    attachShader(vertexShader);\n    attachShader(fragmentShader);\n\n    bindAttribute(Vertex, \"vertex\");\n    bindAttribute(Color, \"color\");\n\n    link();\n\n    delete vertexShader;\n    delete fragmentShader;\n}\n\n}}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _MATCHER_HPP\n#define _MATCHER_HPP\nclass Matcher {\npublic:\n  virtual ~Matcher(){}\n  virtual bool isMatched(CB) const = 0;\n  virtual int getLastMatched(int) const = 0;\n  virtual const std::set<CB> & findMatchedSends() const = 0;\n};\n#endif\n<commit_msg>Better naming.<commit_after>#ifndef _MATCHER_HPP\n#define _MATCHER_HPP\nclass Matcher {\npublic:\n  virtual ~Matcher(){}\n  virtual bool isMatched(CB) const = 0;\n  virtual int findLastMatched(int) const = 0;\n  virtual const std::set<CB> & findMatchedSends() const = 0;\n};\n#endif\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 <string>\n#include <iostream>\n#include <vector>\n#include <atomic>\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\n#include \"assert.hpp\"\n#include \"Options.hpp\"\n\nusing namespace eddic;\n\nnamespace po = boost::program_options;\n\nnamespace {\n\nstd::pair<std::string, std::string> numeric_parser(const std::string& s){\n    if (s.find(\"-32\") == 0) {\n        return make_pair(\"32\", std::string(\"true\"));\n    } else if (s.find(\"-64\") == 0) {\n        return make_pair(\"64\", std::string(\"true\"));\n    } else {\n        return make_pair(std::string(), std::string());\n    }\n}\n\nstd::atomic<bool> description_flag;\n\npo::options_description visible(\"Usage : eddic [options] source.eddi\");\npo::options_description all(\"Usage : eddic [options] source.eddi\");\n\nstd::unordered_map<std::string, std::vector<std::string>> triggers;\n\nvoid add_trigger(const std::string& option, const std::vector<std::string>& childs){\n   triggers[option] = childs; \n}\n\nvoid init_descriptions(){\n    po::options_description general(\"General options\");\n    general.add_options()\n        (\"help,h\", \"Generate this help message\")\n        (\"assembly,S\", \"Generate only the assembly\")\n        (\"keep,k\", \"Keep the assembly file\")\n        (\"version\", \"Print the version of eddic\")\n        (\"output,o\", po::value<std::string>()->default_value(\"a.out\"), \"Set the name of the executable\")\n       \n        (\"debug,g\", \"Add debugging symbols\")\n        \n        (\"template-depth\", po::value<int>()->default_value(100), \"Define the maximum template depth\")\n        \n        (\"32\", \"Force the compilation for 32 bits platform\")\n        (\"64\", \"Force the compilation for 64 bits platform\")\n\n        (\"warning-all\", \"Enable all the warning messages\")\n        (\"warning-unused\", \"Warn about unused variables, parameters and functions\")\n        (\"warning-cast\", \"Warn about useless casts\")\n        (\"warning-effects\", \"Warn about statements without effect\")\n        ;\n    \n    po::options_description display(\"Display options\");\n    display.add_options()\n        (\"ast\", \"Print the Abstract Syntax Tree representation of the source\")\n        (\"ast-raw\", \"Print the Abstract Syntax Tree representation of the source coming directly from the parser before any pass is run on the AST. \")\n        (\"ast-only\", \"Only print the Abstract Syntax Tree representation of the source (do not continue compilation after printing)\")\n\n        (\"mtac\", \"Print the medium-level Three Address Code representation of the source\")\n        (\"mtac-opt\", \"Print the medium-level Three Address Code representation of the source before any optimization has been performed\")\n        (\"mtac-only\", \"Only print the medium-level Three Address Code representation of the source (do not continue compilation after printing)\")\n\n        (\"ltac-pre\", \"Print the low-level Three Address Code representation of the source before allocation of registers\")\n        (\"ltac-alloc\", \"Print the low-level Three Address Code representation of the source before optimization\")\n        (\"ltac\", \"Print the final low-level Three Address Code representation of the source\")\n        (\"ltac-only\", \"Only print the low-level Three Address Code representation of the source (do not continue compilation after printing)\")\n        ;\n\n    po::options_description optimization(\"Optimization options\");\n    optimization.add_options()\n        (\"Opt,O\", po::value<int>()->implicit_value(0)->default_value(2), \"Define the optimization level\")\n        (\"O0\", \"Disable all optimizations\")\n        (\"O1\", \"Enable low-level optimizations\")\n        (\"O2\", \"Enable all optimizations. This can be slow for big programs.\")\n        \n        (\"fglobal-optimization\", \"Enable optimizer engine\")\n        (\"fparameter-allocation\", \"Enable parameter allocation in register\")\n        (\"fpeephole-optimization\", \"Enable peephole optimizer\")\n        (\"fomit-frame-pointer\", \"Omit frame pointer from functions\")\n        (\"finline-functions\", \"Enable inlining\")\n        (\"fno-inline-functions\", \"Disable inlining\")\n        ;\n    \n    po::options_description backend(\"Backend options\");\n    backend.add_options()\n        (\"log\", po::value<int>()->default_value(0), \"Define the logging\")\n        (\"quiet,q\", \"Do not print anything\")\n        (\"verbose,v\", \"Make the compiler verbose\")\n        (\"single-threaded\", \"Disable the multi-threaded optimization\")\n        (\"time\", \"Activate timing system\")\n        (\"input\", po::value<std::string>(), \"Input file\")\n        ;\n\n    all.add(general).add(display).add(optimization).add(backend);\n    visible.add(general).add(display).add(optimization);\n\n    add_trigger(\"warning-all\", {\"warning-unused\", \"warning-cast\", \"warning-effects\"});\n    \n    \/\/Special triggers for optimization levels\n    add_trigger(\"__1\", {\"fpeephole-optimization\"});\n    add_trigger(\"__2\", {\"fglobal-optimization\", \"fomit-frame-pointer\", \"fparameter-allocation\", \"finline-functions\"});\n}\n\ninline void trigger_childs(std::shared_ptr<Configuration> configuration, const std::vector<std::string>& childs){\n    for(auto& child : childs){\n        configuration->values[child].defined = true;\n        configuration->values[child].value = std::string(\"true\");\n    }\n}\n\n} \/\/end of anonymous namespace\n\nstd::shared_ptr<Configuration> eddic::parseOptions(int argc, const char* argv[]) {\n    \/\/Create a new configuration\n    auto configuration = std::make_shared<Configuration>();\n\n    try {\n        \/\/Only if the description has not been already defined\n        if(!description_flag.load()){\n            bool old_value = description_flag.load();\n            if(description_flag.compare_exchange_strong(old_value, true)){\n                init_descriptions();\n            }\n        }\n\n        \/\/Add the option of the input file\n        po::positional_options_description p;\n        p.add(\"input\", -1);\n\n        \/\/Create a new set of options\n        po::variables_map options;\n\n        \/\/Parse the command line options\n        po::store(po::command_line_parser(argc, argv).options(all).extra_parser(numeric_parser).positional(p).run(), options);\n        po::notify(options);\n\n        \/\/Transfer the options in the eddic configuration\n        for(auto& option : all.options()){\n            ConfigValue value;\n\n            if(options.count(option->long_name())){\n                value.defined = true;\n                value.value = options[option->long_name()].value();\n            } else {\n                value.defined = false;\n                value.value = std::string(\"false\");\n            }\n\n            configuration->values[option->long_name()] = value;\n        }\n\n        if(options.count(\"O0\") + options.count(\"O1\") + options.count(\"O2\") > 1){\n            std::cout << \"Invalid command line options : only one optimization level should be set\" << std::endl;\n\n            return nullptr;\n        }\n\n        if(options.count(\"64\") && options.count(\"32\")){\n            std::cout << \"Invalid command line options : a compilation cannot be both 32 and 64 bits\" << std::endl;\n\n            return nullptr;\n        }\n\n        \/\/Update optimization level based on special switches\n        if(options.count(\"O0\")){\n            configuration->values[\"Opt\"].value = 0;\n        } else if(options.count(\"O1\")){\n            configuration->values[\"Opt\"].value = 1;\n        } else if(options.count(\"O2\")){\n            configuration->values[\"Opt\"].value = 2;\n        }\n\n        \/\/Triggers dependent options\n        for(auto& trigger : triggers){\n            if(configuration->option_defined(trigger.first)){\n                trigger_childs(configuration, trigger.second);\n            }\n        }\n\n        if(configuration->option_int_value(\"Opt\") >= 1){\n            trigger_childs(configuration, triggers[\"__1\"]);\n        } \n        \n        if(configuration->option_int_value(\"Opt\") >= 2){\n            trigger_childs(configuration, triggers[\"__2\"]);\n        }\n    } catch (const po::ambiguous_option& e) {\n        std::cout << \"Invalid command line options : \" << e.what() << std::endl;\n\n        return nullptr;\n    } catch (const po::unknown_option& e) {\n        std::cout << \"Invalid command line options : \" << e.what() << std::endl;\n\n        return nullptr;\n    } catch (const po::multiple_occurrences& e) {\n        std::cout << \"Only one file can be compiled\" << std::endl;\n\n        return nullptr;\n    }\n\n    return configuration;\n}\n\nbool Configuration::option_defined(const std::string& option_name){\n    return values[option_name].defined;\n}\n\nstd::string Configuration::option_value(const std::string& option_name){\n    return boost::any_cast<std::string>(values[option_name].value);\n}\n\nint Configuration::option_int_value(const std::string& option_name){\n    return boost::any_cast<int>(values[option_name].value);\n}\n\nvoid eddic::print_help(){\n    std::cout << visible << std::endl;\n}\n\nvoid eddic::print_version(){\n    std::cout << \"eddic version 1.2.0\" << std::endl;\n}\n<commit_msg>Add a new option for the statistics system<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 <string>\n#include <iostream>\n#include <vector>\n#include <atomic>\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\n#include \"assert.hpp\"\n#include \"Options.hpp\"\n\nusing namespace eddic;\n\nnamespace po = boost::program_options;\n\nnamespace {\n\nstd::pair<std::string, std::string> numeric_parser(const std::string& s){\n    if (s.find(\"-32\") == 0) {\n        return make_pair(\"32\", std::string(\"true\"));\n    } else if (s.find(\"-64\") == 0) {\n        return make_pair(\"64\", std::string(\"true\"));\n    } else {\n        return make_pair(std::string(), std::string());\n    }\n}\n\nstd::atomic<bool> description_flag;\n\npo::options_description visible(\"Usage : eddic [options] source.eddi\");\npo::options_description all(\"Usage : eddic [options] source.eddi\");\n\nstd::unordered_map<std::string, std::vector<std::string>> triggers;\n\nvoid add_trigger(const std::string& option, const std::vector<std::string>& childs){\n   triggers[option] = childs; \n}\n\nvoid init_descriptions(){\n    po::options_description general(\"General options\");\n    general.add_options()\n        (\"help,h\", \"Generate this help message\")\n        (\"assembly,S\", \"Generate only the assembly\")\n        (\"keep,k\", \"Keep the assembly file\")\n        (\"version\", \"Print the version of eddic\")\n        (\"output,o\", po::value<std::string>()->default_value(\"a.out\"), \"Set the name of the executable\")\n       \n        (\"debug,g\", \"Add debugging symbols\")\n        \n        (\"template-depth\", po::value<int>()->default_value(100), \"Define the maximum template depth\")\n        \n        (\"32\", \"Force the compilation for 32 bits platform\")\n        (\"64\", \"Force the compilation for 64 bits platform\")\n\n        (\"warning-all\", \"Enable all the warning messages\")\n        (\"warning-unused\", \"Warn about unused variables, parameters and functions\")\n        (\"warning-cast\", \"Warn about useless casts\")\n        (\"warning-effects\", \"Warn about statements without effect\")\n        ;\n    \n    po::options_description display(\"Display options\");\n    display.add_options()\n        (\"ast\", \"Print the Abstract Syntax Tree representation of the source\")\n        (\"ast-raw\", \"Print the Abstract Syntax Tree representation of the source coming directly from the parser before any pass is run on the AST. \")\n        (\"ast-only\", \"Only print the Abstract Syntax Tree representation of the source (do not continue compilation after printing)\")\n\n        (\"mtac\", \"Print the medium-level Three Address Code representation of the source\")\n        (\"mtac-opt\", \"Print the medium-level Three Address Code representation of the source before any optimization has been performed\")\n        (\"mtac-only\", \"Only print the medium-level Three Address Code representation of the source (do not continue compilation after printing)\")\n\n        (\"ltac-pre\", \"Print the low-level Three Address Code representation of the source before allocation of registers\")\n        (\"ltac-alloc\", \"Print the low-level Three Address Code representation of the source before optimization\")\n        (\"ltac\", \"Print the final low-level Three Address Code representation of the source\")\n        (\"ltac-only\", \"Only print the low-level Three Address Code representation of the source (do not continue compilation after printing)\")\n        ;\n\n    po::options_description optimization(\"Optimization options\");\n    optimization.add_options()\n        (\"Opt,O\", po::value<int>()->implicit_value(0)->default_value(2), \"Define the optimization level\")\n        (\"O0\", \"Disable all optimizations\")\n        (\"O1\", \"Enable low-level optimizations\")\n        (\"O2\", \"Enable all optimizations. This can be slow for big programs.\")\n        \n        (\"fglobal-optimization\", \"Enable optimizer engine\")\n        (\"fparameter-allocation\", \"Enable parameter allocation in register\")\n        (\"fpeephole-optimization\", \"Enable peephole optimizer\")\n        (\"fomit-frame-pointer\", \"Omit frame pointer from functions\")\n        (\"finline-functions\", \"Enable inlining\")\n        (\"fno-inline-functions\", \"Disable inlining\")\n        ;\n    \n    po::options_description backend(\"Backend options\");\n    backend.add_options()\n        (\"log\", po::value<int>()->default_value(0), \"Define the logging\")\n        (\"quiet,q\", \"Do not print anything\")\n        (\"verbose,v\", \"Make the compiler verbose\")\n        (\"single-threaded\", \"Disable the multi-threaded optimization\")\n        (\"time\", \"Activate the timing system\")\n        (\"stats\", \"Activate the statistics system\")\n        (\"input\", po::value<std::string>(), \"Input file\")\n        ;\n\n    all.add(general).add(display).add(optimization).add(backend);\n    visible.add(general).add(display).add(optimization);\n\n    add_trigger(\"warning-all\", {\"warning-unused\", \"warning-cast\", \"warning-effects\"});\n    \n    \/\/Special triggers for optimization levels\n    add_trigger(\"__1\", {\"fpeephole-optimization\"});\n    add_trigger(\"__2\", {\"fglobal-optimization\", \"fomit-frame-pointer\", \"fparameter-allocation\", \"finline-functions\"});\n}\n\ninline void trigger_childs(std::shared_ptr<Configuration> configuration, const std::vector<std::string>& childs){\n    for(auto& child : childs){\n        configuration->values[child].defined = true;\n        configuration->values[child].value = std::string(\"true\");\n    }\n}\n\n} \/\/end of anonymous namespace\n\nstd::shared_ptr<Configuration> eddic::parseOptions(int argc, const char* argv[]) {\n    \/\/Create a new configuration\n    auto configuration = std::make_shared<Configuration>();\n\n    try {\n        \/\/Only if the description has not been already defined\n        if(!description_flag.load()){\n            bool old_value = description_flag.load();\n            if(description_flag.compare_exchange_strong(old_value, true)){\n                init_descriptions();\n            }\n        }\n\n        \/\/Add the option of the input file\n        po::positional_options_description p;\n        p.add(\"input\", -1);\n\n        \/\/Create a new set of options\n        po::variables_map options;\n\n        \/\/Parse the command line options\n        po::store(po::command_line_parser(argc, argv).options(all).extra_parser(numeric_parser).positional(p).run(), options);\n        po::notify(options);\n\n        \/\/Transfer the options in the eddic configuration\n        for(auto& option : all.options()){\n            ConfigValue value;\n\n            if(options.count(option->long_name())){\n                value.defined = true;\n                value.value = options[option->long_name()].value();\n            } else {\n                value.defined = false;\n                value.value = std::string(\"false\");\n            }\n\n            configuration->values[option->long_name()] = value;\n        }\n\n        if(options.count(\"O0\") + options.count(\"O1\") + options.count(\"O2\") > 1){\n            std::cout << \"Invalid command line options : only one optimization level should be set\" << std::endl;\n\n            return nullptr;\n        }\n\n        if(options.count(\"64\") && options.count(\"32\")){\n            std::cout << \"Invalid command line options : a compilation cannot be both 32 and 64 bits\" << std::endl;\n\n            return nullptr;\n        }\n\n        \/\/Update optimization level based on special switches\n        if(options.count(\"O0\")){\n            configuration->values[\"Opt\"].value = 0;\n        } else if(options.count(\"O1\")){\n            configuration->values[\"Opt\"].value = 1;\n        } else if(options.count(\"O2\")){\n            configuration->values[\"Opt\"].value = 2;\n        }\n\n        \/\/Triggers dependent options\n        for(auto& trigger : triggers){\n            if(configuration->option_defined(trigger.first)){\n                trigger_childs(configuration, trigger.second);\n            }\n        }\n\n        if(configuration->option_int_value(\"Opt\") >= 1){\n            trigger_childs(configuration, triggers[\"__1\"]);\n        } \n        \n        if(configuration->option_int_value(\"Opt\") >= 2){\n            trigger_childs(configuration, triggers[\"__2\"]);\n        }\n    } catch (const po::ambiguous_option& e) {\n        std::cout << \"Invalid command line options : \" << e.what() << std::endl;\n\n        return nullptr;\n    } catch (const po::unknown_option& e) {\n        std::cout << \"Invalid command line options : \" << e.what() << std::endl;\n\n        return nullptr;\n    } catch (const po::multiple_occurrences& e) {\n        std::cout << \"Only one file can be compiled\" << std::endl;\n\n        return nullptr;\n    }\n\n    return configuration;\n}\n\nbool Configuration::option_defined(const std::string& option_name){\n    return values[option_name].defined;\n}\n\nstd::string Configuration::option_value(const std::string& option_name){\n    return boost::any_cast<std::string>(values[option_name].value);\n}\n\nint Configuration::option_int_value(const std::string& option_name){\n    return boost::any_cast<int>(values[option_name].value);\n}\n\nvoid eddic::print_help(){\n    std::cout << visible << std::endl;\n}\n\nvoid eddic::print_version(){\n    std::cout << \"eddic version 1.2.0\" << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ An example how to display PS, EPS, PDF files in canvas\n\/\/Author: Valeriy Onoutchin\n   \n#include \"TROOT.h\"\n#include \"TCanvas.h\"\n#include \"TImage.h\"\n\nvoid psview()\n{\n   \/\/ set to batch mode -> do not display graphics\n   gROOT->SetBatch(1);\n\n   \/\/ create a PostScript file\n   gROOT->Macro(\"feynman.C\");\n   gPad->Print(\"feynman.ps\");\n\n   \/\/ back to graphics mode\n   gROOT->SetBatch(0);\n\n   \/\/ create an image from PS file\n   TImage *ps = TImage::Open(\"feynman.ps\");\n\n   if (!ps) {\n      printf(\"GhostScript (gs) program must be installed\\n\");\n      return;\n   }\n\n   new TCanvas(\"psexam\", \"Example how to display PS file in canvas\", 500, 650);\n   ps->Draw(\"xxx\"); \n}\n<commit_msg>- Add a comment about ghostscript<commit_after>\/\/ An example how to display PS, EPS, PDF files in canvas\n\/\/ To load a PS file in a TCanvas, the ghostscript program needs to be install.\n\/\/ On most unix systems it is usually installed. On Windows it has to be\n\/\/ installed from http:\/\/pages.cs.wisc.edu\/~ghost\/\n\/\/Author: Valeriy Onoutchin\n   \n#include \"TROOT.h\"\n#include \"TCanvas.h\"\n#include \"TImage.h\"\n\nvoid psview()\n{\n   \/\/ set to batch mode -> do not display graphics\n   gROOT->SetBatch(1);\n\n   \/\/ create a PostScript file\n   gROOT->Macro(\"feynman.C\");\n   gPad->Print(\"feynman.ps\");\n\n   \/\/ back to graphics mode\n   gROOT->SetBatch(0);\n\n   \/\/ create an image from PS file\n   TImage *ps = TImage::Open(\"feynman.ps\");\n\n   if (!ps) {\n      printf(\"GhostScript (gs) program must be installed\\n\");\n      return;\n   }\n\n   new TCanvas(\"psexam\", \"Example how to display PS file in canvas\", 500, 650);\n   ps->Draw(\"xxx\"); \n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Plugins.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 <sys\/stat.h>\n#include \"stdafx.h\"\n#include \"Plugins.h\"\n#include \"HeeksConfig.h\"\n\nenum\n{\n    ID_BUTTON_ADD,\n\tID_BUTTON_EDIT,\n\tID_BUTTON_REMOVE,\n\tID_BUTTON_PLUGIN_BROWSE,\n\tID_LISTBOX_CONTROL\n};\n\nBEGIN_EVENT_TABLE( CPluginItemDialog, wxDialog )\nEVT_BUTTON( ID_BUTTON_PLUGIN_BROWSE, CPluginItemDialog::OnButtonBrowse )\nEVT_BUTTON( wxID_OK, CPluginItemDialog::OnButtonOK )\nEVT_BUTTON( wxID_CANCEL, CPluginItemDialog::OnButtonCancel )\nEND_EVENT_TABLE()\n\nCPluginItemDialog::CPluginItemDialog(wxWindow *parent, const wxString& title, PluginData& pd):wxDialog(parent, wxID_ANY, title, wxDefaultPosition, wxDefaultSize, wxDEFAULT_DIALOG_STYLE | wxRESIZE_BORDER)\n{\n\tm_pd = &pd;\n\n    m_panel = new wxPanel(this, wxID_ANY, wxDefaultPosition, wxDefaultSize, wxTAB_TRAVERSAL);\n\n    \/\/ create buttons\n    wxButton *button1 = new wxButton(m_panel, wxID_OK);\n    wxButton *button2 = new wxButton(m_panel, wxID_CANCEL);\n\n    wxBoxSizer *mainsizer = new wxBoxSizer( wxVERTICAL );\n\n    wxFlexGridSizer *gridsizer = new wxFlexGridSizer(3, 5, 5);\n\tgridsizer->Add(new wxStaticText(m_panel, wxID_ANY, _(\"Name\")), wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL));\n\tm_name_text_ctrl = new wxTextCtrl(m_panel, wxID_ANY, pd.name);\n\tgridsizer->Add(m_name_text_ctrl, wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL).Expand());\n\tgridsizer->Add(new wxStaticText(m_panel, wxID_ANY, _T(\"\")), wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL));\n\tgridsizer->Add(new wxStaticText(m_panel, wxID_ANY, _(\"File Path\")), wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL));\n\tm_path_text_ctrl = new wxTextCtrl(m_panel, wxID_ANY, pd.path, wxDefaultPosition, wxSize(400, 0));\n\tgridsizer->Add(m_path_text_ctrl, wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL).Expand());\n\twxButton* browse_button = new wxButton(m_panel, ID_BUTTON_PLUGIN_BROWSE, _T(\"...\"));\n    gridsizer->Add(browse_button, wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL));\n\n\tif(pd.hard_coded)\n\t{\n\t\t\/\/ don't allow editing of hard coded plugins\n\t\tm_name_text_ctrl->Enable(false);\n\t\tm_path_text_ctrl->Enable(false);\n\t\tbrowse_button->Enable(false);\n\t}\n\n\tgridsizer->AddGrowableCol(1, 1);\n\n    wxBoxSizer *bottomsizer = new wxBoxSizer( wxHORIZONTAL );\n\n    bottomsizer->Add( button1, 0, wxALL, 10 );\n    bottomsizer->Add( button2, 0, wxALL, 10 );\n\n    mainsizer->Add( gridsizer, wxSizerFlags().Align(wxALIGN_CENTER).Border(wxALL, 10).Expand() );\n    mainsizer->Add( bottomsizer, wxSizerFlags().Align(wxALIGN_CENTER) );\n\n    \/\/ tell frame to make use of sizer (or constraints, if any)\n    m_panel->SetAutoLayout( true );\n    m_panel->SetSizer( mainsizer );\n\n#ifndef __WXWINCE__\n    \/\/ don't allow frame to get smaller than what the sizers tell ye\n    mainsizer->SetSizeHints( this );\n#endif\n\n    Show(true);\n}\n\nvoid CPluginItemDialog::OnButtonOK(wxCommandEvent& event)\n{\n\t\/\/ it must have a name\n\tif(m_name_text_ctrl->GetValue().Len() == 0)\n\t{\n\t\twxMessageBox(_(\"Plugin must have a name!\"));\n\t\tm_name_text_ctrl->SetFocus();\n\t\treturn;\n\t}\n\n\t\/\/ it must have a file path\n\tif(m_path_text_ctrl->GetValue().Len() == 0)\n\t{\n\t\twxMessageBox(_(\"No file specified!\"));\n\t\tm_path_text_ctrl->SetFocus();\n\t\treturn;\n\t}\n\n\tm_pd->name = m_name_text_ctrl->GetValue();\n\tm_pd->path = m_path_text_ctrl->GetValue();\n\n\tEndModal(wxID_OK);\n}\n\nvoid CPluginItemDialog::OnButtonCancel(wxCommandEvent& event)\n{\n\tEndModal(wxID_CANCEL);\n}\n\nvoid CPluginItemDialog::OnButtonBrowse(wxCommandEvent& event)\n{\n#ifdef WIN32\n\twxString ext_str(_T(\"*.dll\"));\n#else\n\twxString ext_str(_T(\"*.so*\"));\n#endif\n\twxString wildcard_string = wxString(_(\"shared library files\")) + _T(\" |\") + ext_str;\n\n    wxFileDialog dialog(this, _(\"Choose shared library file\"), wxEmptyString, wxEmptyString, wildcard_string);\n    dialog.CentreOnParent();\n\n    if (dialog.ShowModal() == wxID_OK)\n    {\n\t\tm_path_text_ctrl->SetValue(dialog.GetPath());\n    }\n}\n\nBEGIN_EVENT_TABLE( CPluginsDialog, wxDialog )\nEVT_BUTTON( ID_BUTTON_ADD, CPluginsDialog::OnButtonAdd )\nEVT_BUTTON( ID_BUTTON_EDIT, CPluginsDialog::OnButtonEdit )\nEVT_UPDATE_UI(ID_BUTTON_EDIT, CPluginsDialog::OnUpdateEdit)\nEVT_BUTTON( ID_BUTTON_REMOVE, CPluginsDialog::OnButtonRemove )\nEVT_UPDATE_UI(ID_BUTTON_REMOVE, CPluginsDialog::OnUpdateRemove)\nEVT_BUTTON( wxID_OK, CPluginsDialog::OnButtonOK )\nEVT_BUTTON( wxID_CANCEL, CPluginsDialog::OnButtonCancel )\nEVT_LISTBOX_DCLICK(ID_LISTBOX_CONTROL, CPluginsDialog::OnListboxDblClick)\nEND_EVENT_TABLE()\n\nCPluginsDialog::CPluginsDialog(wxWindow *parent):wxDialog(parent, wxID_ANY, _(\"HeeksCAD plugin libraries\"), wxDefaultPosition, wxDefaultSize, wxDEFAULT_DIALOG_STYLE | wxRESIZE_BORDER)\n{\n   \/\/ make a panel with some controls\n    m_panel = new wxPanel(this, wxID_ANY, wxDefaultPosition, wxDefaultSize, wxTAB_TRAVERSAL);\n\n\tReadPluginsList(m_plugins);\n\n    CreateCheckListbox();\n\n    \/\/ create buttons\n    wxButton *button1 = new wxButton(m_panel, ID_BUTTON_ADD, _(\"New\"));\n    wxButton *button2 = new wxButton(m_panel, ID_BUTTON_EDIT, _(\"Edit\"));\n    wxButton *button3 = new wxButton(m_panel, ID_BUTTON_REMOVE, _(\"Delete\"));\n    wxButton *button4 = new wxButton(m_panel, wxID_OK);\n    wxButton *button5 = new wxButton(m_panel, wxID_CANCEL);\n\n    wxBoxSizer *mainsizer = new wxBoxSizer( wxVERTICAL );\n\n    mainsizer->Add( m_pListBox, 1, wxGROW|wxALL, 10 );\n\n    wxBoxSizer *bottomsizer = new wxBoxSizer( wxHORIZONTAL );\n\n    bottomsizer->Add( button1, 0, wxALL, 10 );\n    bottomsizer->Add( button2, 0, wxALL, 10 );\n    bottomsizer->Add( button3, 0, wxALL, 10 );\n    bottomsizer->Add( button4, 0, wxALL, 10 );\n    bottomsizer->Add( button5, 0, wxALL, 10 );\n\n    mainsizer->Add( bottomsizer, 0, wxCENTER );\n\n    \/\/ tell frame to make use of sizer (or constraints, if any)\n    m_panel->SetAutoLayout( true );\n    m_panel->SetSizer( mainsizer );\n\n#ifndef __WXWINCE__\n    \/\/ don't allow frame to get smaller than what the sizers tell ye\n    mainsizer->SetSizeHints( this );\n#endif\n\n    Show(true);\n}\n\nvoid ReadPluginsList(std::list<PluginData> &plugins)\n{\n\tplugins.clear();\n\n\tHeeksConfig plugins_config;\n\tplugins_config.SetPath(_T(\"\/plugins\"));\n\n\twxString key;\n\tlong Index;\n\twxString str;\n\n\tbool entry_found = false;\n\tbool hCncConfigured = false;  \/\/if true, heekscnc is a plugin already. don't automatically add it in that case\n\n\tentry_found = plugins_config.GetFirstEntry(key, Index);\n\n\twhile(entry_found)\n\t{\n\t\tplugins_config.Read(key, &str);\n\n\t\tPluginData pd;\n\t\tif(str[0] == '#')\n\t\t{\n\t\t\tstr = str.Mid(1);\n\t\t\tpd.enabled = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpd.enabled = true;\n\t\t}\n\n\t\tpd.name = key;\n\t\tpd.path = str;\n\t\tplugins.push_back(pd);\n\t\tif( str.Lower().Matches(_T(\"*heekscnc*\")) )\n\t\t\thCncConfigured = true; \n\n\t\tentry_found = plugins_config.GetNextEntry(key, Index);\n\t}\n\n\t\/\/look for heekscnc in the standard install location and automatically add it, if it isn't already configured\n\tif( !hCncConfigured ) {\n\t\tstruct stat cncstat;\n\t\tbool foundHcncPlugin = false;\n#ifdef WIN32\n\t\t\/\/this code should work on windows given the correct path\n\t\tconst char* cncPlugPath = \"standard\\windows\\path\\to\\heekscnc.dll\";\n  #ifndef S_ISREG\n  \t\/\/if this fails to compile on windows, change it to\n  \t\/\/#define S_ISREG(mode) true\n    #define S_ISREG(mode)  (((mode) & S_IFMT) == S_IFREG)\n  #endif\n#else\n\t\tconst char* cncPlugPath = \"\/usr\/lib\/libheekscnc.so\";  \/\/this is the path that cmake installs the lib to\n#endif\n\t\tif( stat(cncPlugPath, &cncstat) == 0 ) {\n\t\t\tif( S_ISREG(cncstat.st_mode) )\n\t\t\t\tfoundHcncPlugin = true;\n\t\t}\n\n\t\tif( foundHcncPlugin ) {\n\t\t\tPluginData pd;\n\t\t\tpd.enabled = true;\n\t\t\tpd.hard_coded = false; \/\/if this was true, the plugin wouldn't be added to the config - meaning the user couldn't disable it\n\t\t\tpd.name = _T(\"HeeksCNC (Automatically added)\");\n\t\t\tpd.path = _T(\"\/usr\/lib\/libheekscnc.so\");\n\t\t\tplugins.push_back(pd);\n\t\t}\n\t}\n\n\t\/\/ add plugins from the command line\n\tstd::list<wxString> command_line_plugins;\n\twxGetApp().GetPluginsFromCommandLineParams(command_line_plugins);\n\tfor(std::list<wxString>::iterator It = command_line_plugins.begin(); It != command_line_plugins.end(); It++)\n\t{\n\t\tPluginData pd;\n\t\tpd.enabled = true;\n\t\tpd.hard_coded = true;\n\t\tpd.name = _T(\"CommandLinePlugin\");\n\t\tpd.path = *It;\n\t\tplugins.push_back(pd);\n\t}\n\n\t\/\/ add code to always start your dll here.\n#ifdef MY_OWN_HARDCODED_PLUGIN\n\t{\n\t\tPluginData pd;\n\t\tpd.enabled = true;\n\t\tpd.hard_coded = true;\n\t\tpd.name = _T(\"MyPlugin\");\n\t\tpd.path = _T(\"$(MYEXEPATH)\/mypluing\/PluginForHeeksCAD.dll\");\n\t\tplugins.push_back(pd);\n\t}\n#endif\n}\n\nvoid CPluginsDialog::CreateCheckListbox(long flags)\n{\n    wxString *astrChoices = new wxString[m_plugins.size()];\n    unsigned int ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tPluginData &pd = *It;\n\t\tastrChoices[ui] = pd.name;\n\t}\n\n    m_pListBox = new wxCheckListBox\n        (\n         m_panel,               \/\/ parent\n         ID_LISTBOX_CONTROL,       \/\/ control id\n         wxPoint(10, 10),       \/\/ listbox poistion\n         wxSize(400, 100),      \/\/ listbox size\n         m_plugins.size(),\t\t\/\/ number of strings\n         astrChoices,           \/\/ array of strings\n         flags\n        );\n\n    delete [] astrChoices;\n\n    ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tPluginData &pd = *It;\n\t\tif(pd.enabled)m_pListBox->Check(ui);\n\t}\n}\n\nvoid CPluginsDialog::EditSelected(unsigned int selection)\n{\n\tunsigned int ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tif(ui == selection)\n\t\t{\n\t\t\tPluginData &pd = *It;\n\t\t\tbool enabled = m_pListBox->IsChecked(ui);\n\n\t\t\tCPluginItemDialog dlg(this, _(\"Add New Plugin\"), pd);\n\t\t\tif(dlg.ShowModal() == wxID_OK)\n\t\t\t{\n\t\t\t\t\/\/ updata the check list\n\t\t\t\tdelete m_pListBox;\n\t\t\t\tCreateCheckListbox();\n\t\t\t\tm_pListBox->Check(ui, enabled);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid CPluginsDialog::OnButtonAdd(wxCommandEvent& event)\n{\n\tPluginData pd;\n\tCPluginItemDialog dlg(this, _(\"Add New Plugin\"), pd);\n\tif(dlg.ShowModal() == wxID_OK)\n\t{\n\t\t\/\/ add the new item\n\t\tm_plugins.push_back(pd);\n\n\t\t\/\/ updata the check list\n\t\tdelete m_pListBox;\n\t\tCreateCheckListbox();\n\t}\n}\n\nvoid CPluginsDialog::OnButtonEdit(wxCommandEvent& event)\n{\n\tunsigned int selection = m_pListBox->GetSelection();\n\n\tEditSelected(selection);\n}\n\nvoid CPluginsDialog::OnUpdateEdit( wxUpdateUIEvent& event )\n{\n\tevent.Enable(m_pListBox->GetSelection() >= 0);\n}\n\nvoid CPluginsDialog::OnUpdateRemove( wxUpdateUIEvent& event )\n{\n\tevent.Enable(m_pListBox->GetSelection() >= 0);\n}\n\nvoid CPluginsDialog::OnButtonRemove(wxCommandEvent& event)\n{\n\tunsigned int selection = m_pListBox->GetSelection();\n\tunsigned int ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tif(ui == selection)\n\t\t{\n\t\t\tm_plugins.erase(It);\n\t\t\t\/\/ updata the check list\n\t\t\tdelete m_pListBox;\n\t\t\tCreateCheckListbox();\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid CPluginsDialog::OnButtonOK(wxCommandEvent& event)\n{\n\t::wxSetWorkingDirectory(wxGetApp().GetExeFolder());\n\n\tHeeksConfig plugins_config;\n\n\tplugins_config.DeleteGroup(_T(\"plugins\"));\n\tplugins_config.SetPath(_T(\"\/plugins\"));\n\n\tunsigned int ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tPluginData &pd = *It;\n\t\tif(pd.hard_coded)continue;\n\t\tpd.enabled = m_pListBox->IsChecked(ui);\n\t\twxString value = pd.path;\n\t\tif(!(pd.enabled))value.Prepend(_T(\"#\"));\n\t\tplugins_config.Write(pd.name, value);\t\n\t}\n\n\tEndModal(wxID_OK);\n}\n\nvoid CPluginsDialog::OnButtonCancel(wxCommandEvent& event)\n{\n\tEndModal(wxID_CANCEL);\n}\n\nvoid CPluginsDialog::OnListboxDblClick(wxCommandEvent& WXUNUSED(event))\n{\n    int selection = m_pListBox->GetSelection();\n\n\tEditSelected(selection);\n}\n<commit_msg>compile warning with escape characters in Windows build<commit_after>\/\/ Plugins.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 <sys\/stat.h>\n#include \"stdafx.h\"\n#include \"Plugins.h\"\n#include \"HeeksConfig.h\"\n\nenum\n{\n    ID_BUTTON_ADD,\n\tID_BUTTON_EDIT,\n\tID_BUTTON_REMOVE,\n\tID_BUTTON_PLUGIN_BROWSE,\n\tID_LISTBOX_CONTROL\n};\n\nBEGIN_EVENT_TABLE( CPluginItemDialog, wxDialog )\nEVT_BUTTON( ID_BUTTON_PLUGIN_BROWSE, CPluginItemDialog::OnButtonBrowse )\nEVT_BUTTON( wxID_OK, CPluginItemDialog::OnButtonOK )\nEVT_BUTTON( wxID_CANCEL, CPluginItemDialog::OnButtonCancel )\nEND_EVENT_TABLE()\n\nCPluginItemDialog::CPluginItemDialog(wxWindow *parent, const wxString& title, PluginData& pd):wxDialog(parent, wxID_ANY, title, wxDefaultPosition, wxDefaultSize, wxDEFAULT_DIALOG_STYLE | wxRESIZE_BORDER)\n{\n\tm_pd = &pd;\n\n    m_panel = new wxPanel(this, wxID_ANY, wxDefaultPosition, wxDefaultSize, wxTAB_TRAVERSAL);\n\n    \/\/ create buttons\n    wxButton *button1 = new wxButton(m_panel, wxID_OK);\n    wxButton *button2 = new wxButton(m_panel, wxID_CANCEL);\n\n    wxBoxSizer *mainsizer = new wxBoxSizer( wxVERTICAL );\n\n    wxFlexGridSizer *gridsizer = new wxFlexGridSizer(3, 5, 5);\n\tgridsizer->Add(new wxStaticText(m_panel, wxID_ANY, _(\"Name\")), wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL));\n\tm_name_text_ctrl = new wxTextCtrl(m_panel, wxID_ANY, pd.name);\n\tgridsizer->Add(m_name_text_ctrl, wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL).Expand());\n\tgridsizer->Add(new wxStaticText(m_panel, wxID_ANY, _T(\"\")), wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL));\n\tgridsizer->Add(new wxStaticText(m_panel, wxID_ANY, _(\"File Path\")), wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL));\n\tm_path_text_ctrl = new wxTextCtrl(m_panel, wxID_ANY, pd.path, wxDefaultPosition, wxSize(400, 0));\n\tgridsizer->Add(m_path_text_ctrl, wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL).Expand());\n\twxButton* browse_button = new wxButton(m_panel, ID_BUTTON_PLUGIN_BROWSE, _T(\"...\"));\n    gridsizer->Add(browse_button, wxSizerFlags().Align(wxALIGN_CENTER_VERTICAL));\n\n\tif(pd.hard_coded)\n\t{\n\t\t\/\/ don't allow editing of hard coded plugins\n\t\tm_name_text_ctrl->Enable(false);\n\t\tm_path_text_ctrl->Enable(false);\n\t\tbrowse_button->Enable(false);\n\t}\n\n\tgridsizer->AddGrowableCol(1, 1);\n\n    wxBoxSizer *bottomsizer = new wxBoxSizer( wxHORIZONTAL );\n\n    bottomsizer->Add( button1, 0, wxALL, 10 );\n    bottomsizer->Add( button2, 0, wxALL, 10 );\n\n    mainsizer->Add( gridsizer, wxSizerFlags().Align(wxALIGN_CENTER).Border(wxALL, 10).Expand() );\n    mainsizer->Add( bottomsizer, wxSizerFlags().Align(wxALIGN_CENTER) );\n\n    \/\/ tell frame to make use of sizer (or constraints, if any)\n    m_panel->SetAutoLayout( true );\n    m_panel->SetSizer( mainsizer );\n\n#ifndef __WXWINCE__\n    \/\/ don't allow frame to get smaller than what the sizers tell ye\n    mainsizer->SetSizeHints( this );\n#endif\n\n    Show(true);\n}\n\nvoid CPluginItemDialog::OnButtonOK(wxCommandEvent& event)\n{\n\t\/\/ it must have a name\n\tif(m_name_text_ctrl->GetValue().Len() == 0)\n\t{\n\t\twxMessageBox(_(\"Plugin must have a name!\"));\n\t\tm_name_text_ctrl->SetFocus();\n\t\treturn;\n\t}\n\n\t\/\/ it must have a file path\n\tif(m_path_text_ctrl->GetValue().Len() == 0)\n\t{\n\t\twxMessageBox(_(\"No file specified!\"));\n\t\tm_path_text_ctrl->SetFocus();\n\t\treturn;\n\t}\n\n\tm_pd->name = m_name_text_ctrl->GetValue();\n\tm_pd->path = m_path_text_ctrl->GetValue();\n\n\tEndModal(wxID_OK);\n}\n\nvoid CPluginItemDialog::OnButtonCancel(wxCommandEvent& event)\n{\n\tEndModal(wxID_CANCEL);\n}\n\nvoid CPluginItemDialog::OnButtonBrowse(wxCommandEvent& event)\n{\n#ifdef WIN32\n\twxString ext_str(_T(\"*.dll\"));\n#else\n\twxString ext_str(_T(\"*.so*\"));\n#endif\n\twxString wildcard_string = wxString(_(\"shared library files\")) + _T(\" |\") + ext_str;\n\n    wxFileDialog dialog(this, _(\"Choose shared library file\"), wxEmptyString, wxEmptyString, wildcard_string);\n    dialog.CentreOnParent();\n\n    if (dialog.ShowModal() == wxID_OK)\n    {\n\t\tm_path_text_ctrl->SetValue(dialog.GetPath());\n    }\n}\n\nBEGIN_EVENT_TABLE( CPluginsDialog, wxDialog )\nEVT_BUTTON( ID_BUTTON_ADD, CPluginsDialog::OnButtonAdd )\nEVT_BUTTON( ID_BUTTON_EDIT, CPluginsDialog::OnButtonEdit )\nEVT_UPDATE_UI(ID_BUTTON_EDIT, CPluginsDialog::OnUpdateEdit)\nEVT_BUTTON( ID_BUTTON_REMOVE, CPluginsDialog::OnButtonRemove )\nEVT_UPDATE_UI(ID_BUTTON_REMOVE, CPluginsDialog::OnUpdateRemove)\nEVT_BUTTON( wxID_OK, CPluginsDialog::OnButtonOK )\nEVT_BUTTON( wxID_CANCEL, CPluginsDialog::OnButtonCancel )\nEVT_LISTBOX_DCLICK(ID_LISTBOX_CONTROL, CPluginsDialog::OnListboxDblClick)\nEND_EVENT_TABLE()\n\nCPluginsDialog::CPluginsDialog(wxWindow *parent):wxDialog(parent, wxID_ANY, _(\"HeeksCAD plugin libraries\"), wxDefaultPosition, wxDefaultSize, wxDEFAULT_DIALOG_STYLE | wxRESIZE_BORDER)\n{\n   \/\/ make a panel with some controls\n    m_panel = new wxPanel(this, wxID_ANY, wxDefaultPosition, wxDefaultSize, wxTAB_TRAVERSAL);\n\n\tReadPluginsList(m_plugins);\n\n    CreateCheckListbox();\n\n    \/\/ create buttons\n    wxButton *button1 = new wxButton(m_panel, ID_BUTTON_ADD, _(\"New\"));\n    wxButton *button2 = new wxButton(m_panel, ID_BUTTON_EDIT, _(\"Edit\"));\n    wxButton *button3 = new wxButton(m_panel, ID_BUTTON_REMOVE, _(\"Delete\"));\n    wxButton *button4 = new wxButton(m_panel, wxID_OK);\n    wxButton *button5 = new wxButton(m_panel, wxID_CANCEL);\n\n    wxBoxSizer *mainsizer = new wxBoxSizer( wxVERTICAL );\n\n    mainsizer->Add( m_pListBox, 1, wxGROW|wxALL, 10 );\n\n    wxBoxSizer *bottomsizer = new wxBoxSizer( wxHORIZONTAL );\n\n    bottomsizer->Add( button1, 0, wxALL, 10 );\n    bottomsizer->Add( button2, 0, wxALL, 10 );\n    bottomsizer->Add( button3, 0, wxALL, 10 );\n    bottomsizer->Add( button4, 0, wxALL, 10 );\n    bottomsizer->Add( button5, 0, wxALL, 10 );\n\n    mainsizer->Add( bottomsizer, 0, wxCENTER );\n\n    \/\/ tell frame to make use of sizer (or constraints, if any)\n    m_panel->SetAutoLayout( true );\n    m_panel->SetSizer( mainsizer );\n\n#ifndef __WXWINCE__\n    \/\/ don't allow frame to get smaller than what the sizers tell ye\n    mainsizer->SetSizeHints( this );\n#endif\n\n    Show(true);\n}\n\nvoid ReadPluginsList(std::list<PluginData> &plugins)\n{\n\tplugins.clear();\n\n\tHeeksConfig plugins_config;\n\tplugins_config.SetPath(_T(\"\/plugins\"));\n\n\twxString key;\n\tlong Index;\n\twxString str;\n\n\tbool entry_found = false;\n\tbool hCncConfigured = false;  \/\/if true, heekscnc is a plugin already. don't automatically add it in that case\n\n\tentry_found = plugins_config.GetFirstEntry(key, Index);\n\n\twhile(entry_found)\n\t{\n\t\tplugins_config.Read(key, &str);\n\n\t\tPluginData pd;\n\t\tif(str[0] == '#')\n\t\t{\n\t\t\tstr = str.Mid(1);\n\t\t\tpd.enabled = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpd.enabled = true;\n\t\t}\n\n\t\tpd.name = key;\n\t\tpd.path = str;\n\t\tplugins.push_back(pd);\n\t\tif( str.Lower().Matches(_T(\"*heekscnc*\")) )\n\t\t\thCncConfigured = true; \n\n\t\tentry_found = plugins_config.GetNextEntry(key, Index);\n\t}\n\n\t\/\/look for heekscnc in the standard install location and automatically add it, if it isn't already configured\n\tif( !hCncConfigured ) {\n\t\tstruct stat cncstat;\n\t\tbool foundHcncPlugin = false;\n#ifdef WIN32\n\t\t\/\/this code should work on windows given the correct path\n\t\tconst char* cncPlugPath = \"standard\\\\windows\\\\path\\\\to\\\\heekscnc.dll\";\n  #ifndef S_ISREG\n  \t\/\/if this fails to compile on windows, change it to\n  \t\/\/#define S_ISREG(mode) true\n    #define S_ISREG(mode)  (((mode) & S_IFMT) == S_IFREG)\n  #endif\n#else\n\t\tconst char* cncPlugPath = \"\/usr\/lib\/libheekscnc.so\";  \/\/this is the path that cmake installs the lib to\n#endif\n\t\tif( stat(cncPlugPath, &cncstat) == 0 ) {\n\t\t\tif( S_ISREG(cncstat.st_mode) )\n\t\t\t\tfoundHcncPlugin = true;\n\t\t}\n\n\t\tif( foundHcncPlugin ) {\n\t\t\tPluginData pd;\n\t\t\tpd.enabled = true;\n\t\t\tpd.hard_coded = false; \/\/if this was true, the plugin wouldn't be added to the config - meaning the user couldn't disable it\n\t\t\tpd.name = _T(\"HeeksCNC (Automatically added)\");\n\t\t\tpd.path = _T(\"\/usr\/lib\/libheekscnc.so\");\n\t\t\tplugins.push_back(pd);\n\t\t}\n\t}\n\n\t\/\/ add plugins from the command line\n\tstd::list<wxString> command_line_plugins;\n\twxGetApp().GetPluginsFromCommandLineParams(command_line_plugins);\n\tfor(std::list<wxString>::iterator It = command_line_plugins.begin(); It != command_line_plugins.end(); It++)\n\t{\n\t\tPluginData pd;\n\t\tpd.enabled = true;\n\t\tpd.hard_coded = true;\n\t\tpd.name = _T(\"CommandLinePlugin\");\n\t\tpd.path = *It;\n\t\tplugins.push_back(pd);\n\t}\n\n\t\/\/ add code to always start your dll here.\n#ifdef MY_OWN_HARDCODED_PLUGIN\n\t{\n\t\tPluginData pd;\n\t\tpd.enabled = true;\n\t\tpd.hard_coded = true;\n\t\tpd.name = _T(\"MyPlugin\");\n\t\tpd.path = _T(\"$(MYEXEPATH)\/mypluing\/PluginForHeeksCAD.dll\");\n\t\tplugins.push_back(pd);\n\t}\n#endif\n}\n\nvoid CPluginsDialog::CreateCheckListbox(long flags)\n{\n    wxString *astrChoices = new wxString[m_plugins.size()];\n    unsigned int ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tPluginData &pd = *It;\n\t\tastrChoices[ui] = pd.name;\n\t}\n\n    m_pListBox = new wxCheckListBox\n        (\n         m_panel,               \/\/ parent\n         ID_LISTBOX_CONTROL,       \/\/ control id\n         wxPoint(10, 10),       \/\/ listbox poistion\n         wxSize(400, 100),      \/\/ listbox size\n         m_plugins.size(),\t\t\/\/ number of strings\n         astrChoices,           \/\/ array of strings\n         flags\n        );\n\n    delete [] astrChoices;\n\n    ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tPluginData &pd = *It;\n\t\tif(pd.enabled)m_pListBox->Check(ui);\n\t}\n}\n\nvoid CPluginsDialog::EditSelected(unsigned int selection)\n{\n\tunsigned int ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tif(ui == selection)\n\t\t{\n\t\t\tPluginData &pd = *It;\n\t\t\tbool enabled = m_pListBox->IsChecked(ui);\n\n\t\t\tCPluginItemDialog dlg(this, _(\"Add New Plugin\"), pd);\n\t\t\tif(dlg.ShowModal() == wxID_OK)\n\t\t\t{\n\t\t\t\t\/\/ updata the check list\n\t\t\t\tdelete m_pListBox;\n\t\t\t\tCreateCheckListbox();\n\t\t\t\tm_pListBox->Check(ui, enabled);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid CPluginsDialog::OnButtonAdd(wxCommandEvent& event)\n{\n\tPluginData pd;\n\tCPluginItemDialog dlg(this, _(\"Add New Plugin\"), pd);\n\tif(dlg.ShowModal() == wxID_OK)\n\t{\n\t\t\/\/ add the new item\n\t\tm_plugins.push_back(pd);\n\n\t\t\/\/ updata the check list\n\t\tdelete m_pListBox;\n\t\tCreateCheckListbox();\n\t}\n}\n\nvoid CPluginsDialog::OnButtonEdit(wxCommandEvent& event)\n{\n\tunsigned int selection = m_pListBox->GetSelection();\n\n\tEditSelected(selection);\n}\n\nvoid CPluginsDialog::OnUpdateEdit( wxUpdateUIEvent& event )\n{\n\tevent.Enable(m_pListBox->GetSelection() >= 0);\n}\n\nvoid CPluginsDialog::OnUpdateRemove( wxUpdateUIEvent& event )\n{\n\tevent.Enable(m_pListBox->GetSelection() >= 0);\n}\n\nvoid CPluginsDialog::OnButtonRemove(wxCommandEvent& event)\n{\n\tunsigned int selection = m_pListBox->GetSelection();\n\tunsigned int ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tif(ui == selection)\n\t\t{\n\t\t\tm_plugins.erase(It);\n\t\t\t\/\/ updata the check list\n\t\t\tdelete m_pListBox;\n\t\t\tCreateCheckListbox();\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid CPluginsDialog::OnButtonOK(wxCommandEvent& event)\n{\n\t::wxSetWorkingDirectory(wxGetApp().GetExeFolder());\n\n\tHeeksConfig plugins_config;\n\n\tplugins_config.DeleteGroup(_T(\"plugins\"));\n\tplugins_config.SetPath(_T(\"\/plugins\"));\n\n\tunsigned int ui = 0;\n\tfor ( std::list<PluginData>::iterator It = m_plugins.begin(); It != m_plugins.end(); It++, ui++ )\n\t{\n\t\tPluginData &pd = *It;\n\t\tif(pd.hard_coded)continue;\n\t\tpd.enabled = m_pListBox->IsChecked(ui);\n\t\twxString value = pd.path;\n\t\tif(!(pd.enabled))value.Prepend(_T(\"#\"));\n\t\tplugins_config.Write(pd.name, value);\t\n\t}\n\n\tEndModal(wxID_OK);\n}\n\nvoid CPluginsDialog::OnButtonCancel(wxCommandEvent& event)\n{\n\tEndModal(wxID_CANCEL);\n}\n\nvoid CPluginsDialog::OnListboxDblClick(wxCommandEvent& WXUNUSED(event))\n{\n    int selection = m_pListBox->GetSelection();\n\n\tEditSelected(selection);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: marktree.cxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 07:02:01 $\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 _DBAUI_MARKTREE_HXX_\n#include \"marktree.hxx\"\n#endif\n#ifndef _DBAUI_MODULE_DBU_HXX_\n#include \"moduledbu.hxx\"\n#endif\n#ifndef _DBU_CONTROL_HRC_\n#include \"dbu_control.hrc\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace dbaui\n{\n    using namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\n\/\/.........................................................................\n#define SPACEBETWEENENTRIES     4\n\/\/========================================================================\n\/\/= OMarkableTreeListBox\n\/\/========================================================================\nDBG_NAME(OMarkableTreeListBox)\n\/\/------------------------------------------------------------------------\nOMarkableTreeListBox::OMarkableTreeListBox( Window* pParent, const Reference< XMultiServiceFactory >& _rxORB, WinBits nWinStyle )\n    : DBTreeListBox(pParent,_rxORB,nWinStyle)\n{\n    DBG_CTOR(OMarkableTreeListBox,NULL);\n\n    InitButtonData();\n}\n\/\/------------------------------------------------------------------------\nOMarkableTreeListBox::OMarkableTreeListBox( Window* pParent, const Reference< XMultiServiceFactory >& _rxORB, const ResId& rResId)\n    : DBTreeListBox(pParent,_rxORB,rResId)\n{\n    DBG_CTOR(OMarkableTreeListBox,NULL);\n\n    InitButtonData();\n}\n\/\/------------------------------------------------------------------------\nOMarkableTreeListBox::~OMarkableTreeListBox()\n{\n    delete m_pCheckButton;\n\n    DBG_DTOR(OMarkableTreeListBox,NULL);\n}\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::Paint(const Rectangle& _rRect)\n{\n    if (!IsEnabled())\n    {\n        Font aOldFont = GetFont();\n        Font aNewFont(aOldFont);\n\n        StyleSettings aSystemStyle = Application::GetSettings().GetStyleSettings();\n        aNewFont.SetColor(aSystemStyle.GetDisableColor());\n\n        SetFont(aNewFont);\n        DBTreeListBox::Paint(_rRect);\n        SetFont(aOldFont);\n    }\n    else\n        DBTreeListBox::Paint(_rRect);\n}\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::InitButtonData()\n{\n    m_pCheckButton = new SvLBoxButtonData( this );\n    EnableCheckButton( m_pCheckButton );\n}\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::KeyInput( const KeyEvent& rKEvt )\n{\n    \/\/ nur wenn space\n    if (rKEvt.GetKeyCode().GetCode() == KEY_SPACE && !rKEvt.GetKeyCode().IsShift() && !rKEvt.GetKeyCode().IsMod1())\n    {\n        SvLBoxEntry* pCurrentHandlerEntry = GetHdlEntry();\n        if(pCurrentHandlerEntry)\n        {\n            SvButtonState eState = GetCheckButtonState( pCurrentHandlerEntry);\n            if(eState == SV_BUTTON_CHECKED)\n                SetCheckButtonState( pCurrentHandlerEntry, SV_BUTTON_UNCHECKED);\n            else\n                SetCheckButtonState( pCurrentHandlerEntry, SV_BUTTON_CHECKED);\n\n            CheckButtonHdl();\n        }\n        else\n            DBTreeListBox::KeyInput(rKEvt);\n    }\n    else\n        DBTreeListBox::KeyInput(rKEvt);\n\n}\n\/\/------------------------------------------------------------------------\nSvButtonState OMarkableTreeListBox::implDetermineState(SvLBoxEntry* _pEntry)\n{\n    SvButtonState eState = GetCheckButtonState(_pEntry);\n    if (!GetModel()->HasChilds(_pEntry))\n        \/\/ nothing to do in this bottom-up routine if there are no children ...\n        return eState;\n#ifdef DBG_UTIL\n    String sEntryText  =GetEntryText(_pEntry);\n#endif\n\n    \/\/ loop through the children and check their states\n    sal_uInt16 nCheckedChildren = 0;\n    sal_uInt16 nChildrenOverall = 0;\n\n    SvLBoxEntry* pChildLoop = GetModel()->FirstChild(_pEntry);\n    while (pChildLoop)\n    {\n#ifdef DBG_UTIL\n        String sChildText  =GetEntryText(pChildLoop);\n#endif\n        SvButtonState eChildState = implDetermineState(pChildLoop);\n        if (SV_BUTTON_TRISTATE == eChildState)\n            break;\n\n        if (SV_BUTTON_CHECKED == eChildState)\n            ++nCheckedChildren;\n        ++nChildrenOverall;\n\n        pChildLoop = GetModel()->NextSibling(pChildLoop);\n    }\n\n    if (pChildLoop)\n    {\n        \/\/ we did not finish the loop because at least one of the children is in tristate\n        eState = SV_BUTTON_TRISTATE;\n\n        \/\/ but this means that we did not finish all the siblings of pChildLoop, so their checking may be\n        \/\/ incorrect at the moment\n        \/\/ -> correct this\n        \/\/ 88485 - 20.06.2001 - frank.schoenheit@sun.com\n        while (pChildLoop)\n        {\n            implDetermineState(pChildLoop);\n            pChildLoop = GetModel()->NextSibling(pChildLoop);\n        }\n    }\n    else\n        \/\/ none if the children is in tristate\n        if (nCheckedChildren)\n            \/\/ we have at least one chil checked\n            if (nCheckedChildren != nChildrenOverall)\n                \/\/ not all children are checked\n                eState = SV_BUTTON_TRISTATE;\n            else\n                \/\/ all children are checked\n                eState = SV_BUTTON_CHECKED;\n        else\n            \/\/ no children are checked\n            eState = SV_BUTTON_UNCHECKED;\n\n    \/\/ finally set the entry to the state we just determined\n    SetCheckButtonState(_pEntry, eState);\n\n    \/\/ outta here\n    return eState;\n}\n\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::CheckButtons()\n{\n    SvLBoxEntry* pEntry = GetModel()->First();\n    while (pEntry)\n    {\n        implDetermineState(pEntry);\n        pEntry = GetModel()->NextSibling(pEntry);\n    }\n\n#if 0\n    \/\/ Plausibilit\"atspr\"ufung\n    SvButtonState eState;\n    SvLBoxEntry* pEntry = GetModel()->First();\n    while(pEntry)\n    {\n        if(!GetModel()->HasChilds(pEntry))\n        {\n            sal_uInt16 nCheck=0;\n            sal_uInt16 nCount=0;\n            SvLBoxEntry* pChildEntry = pEntry;\n            while(pChildEntry)\n            {\n                if(GetCheckButtonState(pChildEntry) == SV_BUTTON_CHECKED)\n                    nCheck++;\n                nCount++;\n                pChildEntry = GetModel()->NextSibling(pChildEntry);\n            }\n\n            if(nCheck && nCount != nCheck)\n                eState = SV_BUTTON_TRISTATE;\n            else if(nCheck)\n                eState = SV_BUTTON_CHECKED;\n            else\n                eState = SV_BUTTON_UNCHECKED;\n\n            SvLBoxEntry* pSchema = GetModel()->GetParent(pEntry);\n            if(pSchema)\n            {\n                pEntry = GetModel()->NextSibling(pSchema);\n                SetCheckButtonState(pSchema, eState);\n            }\n            else\n                pEntry = NULL; \/\/ wenn kein Schema dann sind bereits alle pEntry's durchlaufen worden\n        }\n        else\n            pEntry = GetModel()->Next(pEntry);\n    }\n\n    SvLBoxEntry* pCatalog = GetModel()->First();\n    SvLBoxEntry* pSchema = NULL;\n    if(GetModel()->HasChilds(pCatalog) && GetModel()->HasChilds(pSchema = GetModel()->Next(pCatalog)))\n    {\n        sal_uInt16 nCheck   =0;\n        sal_uInt16 nTri     =0;\n        sal_uInt16 nCount   =0;\n        while(pSchema)\n        {\n            if((eState = GetCheckButtonState(pSchema)) == SV_BUTTON_TRISTATE)\n                break;\n\n            if(eState == SV_BUTTON_CHECKED)\n                nCheck++;\n            nCount++;\n            pSchema = GetModel()->NextSibling(pSchema);\n        }\n\n        if(eState != SV_BUTTON_TRISTATE)\n        {\n            if(nCheck && nCount == nCheck)\n                eState = SV_BUTTON_CHECKED;\n            else if(nCheck)\n                eState = SV_BUTTON_TRISTATE;\n            else\n                eState = SV_BUTTON_UNCHECKED;\n        }\n        SetCheckButtonState( pCatalog,eState);\n    }\n#endif\n}\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::CheckButtonHdl()\n{\n    checkedButton_noBroadcast(GetHdlEntry());\n    if (m_aCheckButtonHandler.IsSet())\n        m_aCheckButtonHandler.Call(this);\n}\n\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::checkedButton_noBroadcast(SvLBoxEntry* _pEntry)\n{\n    SvButtonState eState = GetCheckButtonState( _pEntry);\n    if (GetModel()->HasChilds(_pEntry)) \/\/ Falls Kinder, dann diese auch checken\n    {\n        SvLBoxEntry* pChildEntry = GetModel()->Next(_pEntry);\n        SvLBoxEntry* pSiblingEntry = GetModel()->NextSibling(_pEntry);\n        while(pChildEntry && pChildEntry != pSiblingEntry)\n        {\n            SetCheckButtonState(pChildEntry, eState);\n            pChildEntry = GetModel()->Next(pChildEntry);\n        }\n    }\n\n    SvLBoxEntry* pEntry = IsSelected(_pEntry) ? FirstSelected() : NULL;\n    while(pEntry)\n    {\n        SetCheckButtonState(pEntry,eState);\n        if(GetModel()->HasChilds(pEntry))   \/\/ Falls Kinder, dann diese auch checken\n        {\n            SvLBoxEntry* pChildEntry = GetModel()->Next(pEntry);\n            SvLBoxEntry* pSiblingEntry = GetModel()->NextSibling(pEntry);\n            while(pChildEntry && pChildEntry != pSiblingEntry)\n            {\n                SetCheckButtonState(pChildEntry,eState);\n                pChildEntry = GetModel()->Next(pChildEntry);\n            }\n        }\n        pEntry = NextSelected(pEntry);\n    }\n    CheckButtons();\n}\n\n\/\/------------------------------------------------------------------------\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n<commit_msg>INTEGRATION: CWS hsqlcsvstage1 (1.16.2); FILE MERGED 2006\/09\/20 11:43:57 fs 1.16.2.1: #i69696#, being stage 1 of issue #i69526#: merging changes from CWS hsqlcsv herein<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: marktree.cxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: kz $ $Date: 2006-10-05 13:03: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_dbaccess.hxx\"\n\n#ifndef _DBAUI_MARKTREE_HXX_\n#include \"marktree.hxx\"\n#endif\n#ifndef _DBAUI_MODULE_DBU_HXX_\n#include \"moduledbu.hxx\"\n#endif\n#ifndef _DBU_CONTROL_HRC_\n#include \"dbu_control.hrc\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace dbaui\n{\n    using namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\n\/\/.........................................................................\n#define SPACEBETWEENENTRIES     4\n\/\/========================================================================\n\/\/= OMarkableTreeListBox\n\/\/========================================================================\nDBG_NAME(OMarkableTreeListBox)\n\/\/------------------------------------------------------------------------\nOMarkableTreeListBox::OMarkableTreeListBox( Window* pParent, const Reference< XMultiServiceFactory >& _rxORB, WinBits nWinStyle )\n    : DBTreeListBox(pParent,_rxORB,nWinStyle)\n{\n    DBG_CTOR(OMarkableTreeListBox,NULL);\n\n    InitButtonData();\n}\n\/\/------------------------------------------------------------------------\nOMarkableTreeListBox::OMarkableTreeListBox( Window* pParent, const Reference< XMultiServiceFactory >& _rxORB, const ResId& rResId)\n    : DBTreeListBox(pParent,_rxORB,rResId)\n{\n    DBG_CTOR(OMarkableTreeListBox,NULL);\n\n    InitButtonData();\n}\n\/\/------------------------------------------------------------------------\nOMarkableTreeListBox::~OMarkableTreeListBox()\n{\n    delete m_pCheckButton;\n\n    DBG_DTOR(OMarkableTreeListBox,NULL);\n}\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::Paint(const Rectangle& _rRect)\n{\n    if (!IsEnabled())\n    {\n        Font aOldFont = GetFont();\n        Font aNewFont(aOldFont);\n\n        StyleSettings aSystemStyle = Application::GetSettings().GetStyleSettings();\n        aNewFont.SetColor(aSystemStyle.GetDisableColor());\n\n        SetFont(aNewFont);\n        DBTreeListBox::Paint(_rRect);\n        SetFont(aOldFont);\n    }\n    else\n        DBTreeListBox::Paint(_rRect);\n}\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::InitButtonData()\n{\n    m_pCheckButton = new SvLBoxButtonData( this );\n    EnableCheckButton( m_pCheckButton );\n}\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::KeyInput( const KeyEvent& rKEvt )\n{\n    \/\/ nur wenn space\n    if (rKEvt.GetKeyCode().GetCode() == KEY_SPACE && !rKEvt.GetKeyCode().IsShift() && !rKEvt.GetKeyCode().IsMod1())\n    {\n        SvLBoxEntry* pCurrentHandlerEntry = GetHdlEntry();\n        if(pCurrentHandlerEntry)\n        {\n            SvButtonState eState = GetCheckButtonState( pCurrentHandlerEntry);\n            if(eState == SV_BUTTON_CHECKED)\n                SetCheckButtonState( pCurrentHandlerEntry, SV_BUTTON_UNCHECKED);\n            else\n                SetCheckButtonState( pCurrentHandlerEntry, SV_BUTTON_CHECKED);\n\n            CheckButtonHdl();\n        }\n        else\n            DBTreeListBox::KeyInput(rKEvt);\n    }\n    else\n        DBTreeListBox::KeyInput(rKEvt);\n\n}\n\/\/------------------------------------------------------------------------\nSvButtonState OMarkableTreeListBox::implDetermineState(SvLBoxEntry* _pEntry)\n{\n    SvButtonState eState = GetCheckButtonState(_pEntry);\n    if (!GetModel()->HasChilds(_pEntry))\n        \/\/ nothing to do in this bottom-up routine if there are no children ...\n        return eState;\n#ifdef DBG_UTIL\n    String sEntryText  =GetEntryText(_pEntry);\n#endif\n\n    \/\/ loop through the children and check their states\n    sal_uInt16 nCheckedChildren = 0;\n    sal_uInt16 nChildrenOverall = 0;\n\n    SvLBoxEntry* pChildLoop = GetModel()->FirstChild(_pEntry);\n    while (pChildLoop)\n    {\n#ifdef DBG_UTIL\n        String sChildText  =GetEntryText(pChildLoop);\n#endif\n        SvButtonState eChildState = implDetermineState(pChildLoop);\n        if (SV_BUTTON_TRISTATE == eChildState)\n            break;\n\n        if (SV_BUTTON_CHECKED == eChildState)\n            ++nCheckedChildren;\n        ++nChildrenOverall;\n\n        pChildLoop = GetModel()->NextSibling(pChildLoop);\n    }\n\n    if (pChildLoop)\n    {\n        \/\/ we did not finish the loop because at least one of the children is in tristate\n        eState = SV_BUTTON_TRISTATE;\n\n        \/\/ but this means that we did not finish all the siblings of pChildLoop, so their checking may be\n        \/\/ incorrect at the moment\n        \/\/ -> correct this\n        \/\/ 88485 - 20.06.2001 - frank.schoenheit@sun.com\n        while (pChildLoop)\n        {\n            implDetermineState(pChildLoop);\n            pChildLoop = GetModel()->NextSibling(pChildLoop);\n        }\n    }\n    else\n        \/\/ none if the children is in tristate\n        if (nCheckedChildren)\n            \/\/ we have at least one chil checked\n            if (nCheckedChildren != nChildrenOverall)\n                \/\/ not all children are checked\n                eState = SV_BUTTON_TRISTATE;\n            else\n                \/\/ all children are checked\n                eState = SV_BUTTON_CHECKED;\n        else\n            \/\/ no children are checked\n            eState = SV_BUTTON_UNCHECKED;\n\n    \/\/ finally set the entry to the state we just determined\n    SetCheckButtonState(_pEntry, eState);\n\n    \/\/ outta here\n    return eState;\n}\n\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::CheckButtons()\n{\n    SvLBoxEntry* pEntry = GetModel()->First();\n    while (pEntry)\n    {\n        implDetermineState(pEntry);\n        pEntry = GetModel()->NextSibling(pEntry);\n    }\n}\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::CheckButtonHdl()\n{\n    checkedButton_noBroadcast(GetHdlEntry());\n    if (m_aCheckButtonHandler.IsSet())\n        m_aCheckButtonHandler.Call(this);\n}\n\n\/\/------------------------------------------------------------------------\nvoid OMarkableTreeListBox::checkedButton_noBroadcast(SvLBoxEntry* _pEntry)\n{\n    SvButtonState eState = GetCheckButtonState( _pEntry);\n    if (GetModel()->HasChilds(_pEntry)) \/\/ Falls Kinder, dann diese auch checken\n    {\n        SvLBoxEntry* pChildEntry = GetModel()->Next(_pEntry);\n        SvLBoxEntry* pSiblingEntry = GetModel()->NextSibling(_pEntry);\n        while(pChildEntry && pChildEntry != pSiblingEntry)\n        {\n            SetCheckButtonState(pChildEntry, eState);\n            pChildEntry = GetModel()->Next(pChildEntry);\n        }\n    }\n\n    SvLBoxEntry* pEntry = IsSelected(_pEntry) ? FirstSelected() : NULL;\n    while(pEntry)\n    {\n        SetCheckButtonState(pEntry,eState);\n        if(GetModel()->HasChilds(pEntry))   \/\/ Falls Kinder, dann diese auch checken\n        {\n            SvLBoxEntry* pChildEntry = GetModel()->Next(pEntry);\n            SvLBoxEntry* pSiblingEntry = GetModel()->NextSibling(pEntry);\n            while(pChildEntry && pChildEntry != pSiblingEntry)\n            {\n                SetCheckButtonState(pChildEntry,eState);\n                pChildEntry = GetModel()->Next(pChildEntry);\n            }\n        }\n        pEntry = NextSelected(pEntry);\n    }\n    CheckButtons();\n}\n\n\/\/------------------------------------------------------------------------\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 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 <address\/mask>,\n   * f.ex. 10.0.0.0\/24\n   *\n   * @param[in]  address  IPv4 address\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 Addr address, const uint8_t mask) noexcept\n  : from_{calc_from(address, mask)}, to_{calc_to(address, mask)}\n  {\n    Expects(mask >= 0 and mask <= 32);\n  }\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  : Cidr{{p1,p2,p3,p4}, mask}\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  constexpr Addr calc_from(const Addr address, const uint8_t mask) {\n    const uint32_t ip_mask = net::ntohl((0xFFFFFFFFUL << (32 - mask)) & 0xFFFFFFFFUL);\n    return {address.whole & ip_mask};\n  }\n\n  constexpr Addr calc_to(const Addr address, const uint8_t mask) {\n    const uint32_t ip_mask = net::ntohl((0xFFFFFFFFUL << (32 - mask)) & 0xFFFFFFFFUL);\n    const uint32_t from_ip = address.whole & ip_mask;\n    return {from_ip | ~ip_mask};\n  }\n\n  const Addr from_; \/\/ network address\n  const Addr to_;   \/\/ broadcast address\n}; \/\/< class Cidr\n\n} \/\/< namespace ip4\n} \/\/< namespace net\n\n#endif\n<commit_msg>IPv4 Cidr: Constructor taking string as parameter created<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 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\n\/**\n * This type is thrown when creating an instance of Cidr\n * with a std::string that doesn't represent a valid IPv4\n * cidr\n *\/\nstruct Invalid_cidr : public std::runtime_error {\n  using runtime_error::runtime_error;\n}; \/\/< struct Invalid_cidr\n\nclass Cidr {\npublic:\n\n  \/**\n   * @brief      Constructor\n   *\n   * Create an IPv4 cidr object to represent the cidr <address\/mask>,\n   * f.ex. 10.0.0.0\/24\n   *\n   * @param[in]  address  IPv4 address\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 Addr address, const uint8_t mask) noexcept\n  : from_{calc_from(address, mask)}, to_{calc_to(address, mask)}\n  {\n    Expects(mask >= 0 and mask <= 32);\n  }\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  : Cidr{{p1,p2,p3,p4}, mask}\n  {}\n\n  \/**\n   * @brief      Constructor\n   *\n   * Create an IPv4 cidr object to represent the cidr\n   *\n   * @param[in]  cidr  The cidr, f.ex. \"10.0.0.0\/24\" (\"10.0.0.5\/24\" is f.ex. also valid)\n   *\/\n  Cidr(const std::string& cidr)\n  : Cidr{get_addr(cidr), get_mask(cidr)}\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  constexpr Addr calc_from(const Addr address, const uint8_t mask) {\n    const uint32_t ip_mask = ntohl((0xFFFFFFFFUL << (32 - mask)) & 0xFFFFFFFFUL);\n    return {address.whole & ip_mask};\n  }\n\n  constexpr Addr calc_to(const Addr address, const uint8_t mask) {\n    const uint32_t ip_mask = ntohl((0xFFFFFFFFUL << (32 - mask)) & 0xFFFFFFFFUL);\n    return {(address.whole & ip_mask) | ~ip_mask};\n  }\n\n  Addr get_addr(const std::string& cidr) {\n    return {cidr.substr(0, cidr.find(\"\/\"))};\n  }\n\n  uint8_t get_mask(const std::string& cidr) {\n    const size_t found = cidr.find('\/');\n\n    if (UNLIKELY(found == std::string::npos))\n      throw Invalid_cidr(\"Missing slash in \" + cidr);\n    if (UNLIKELY(found >= cidr.length() - 1))\n      throw Invalid_cidr(\"Missing mask after slash in \" + cidr);\n\n    const char* mask = cidr.substr(found + 1).c_str(); \/\/ Getting past the '\/'\n    int val = 0;\n    while (*mask) {\n      Expects(std::isdigit((int) *mask));\n      val = (val * 10) + (*mask++ - '0');\n    }\n    Expects(val >= 0 and val <= 32);\n    return (uint8_t) val;\n  }\n\n  const Addr from_; \/\/ network address\n  const Addr to_;   \/\/ broadcast address\n}; \/\/< class Cidr\n\n} \/\/< namespace ip4\n} \/\/< namespace net\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Program.cpp\r\n\r\n#include \"stdafx.h\"\r\n#include \"Program.h\"\r\n#include \"PythonStuff.h\"\r\n#include \"tinyxml\/tinyxml.h\"\r\n#include \"ProgramCanvas.h\"\n#include \"NCCode.h\"\n#include \"interface\/MarkedObject.h\"\r\n#include \"interface\/PropertyString.h\"\r\n#include \"interface\/PropertyChoice.h\"\r\n#include \"interface\/Tool.h\"\r\n#include \"Profile.h\"\r\n#include \"Pocket.h\"\r\n#include \"ZigZag.h\"\r\n#include \"Adaptive.h\"\r\n#include \"Op.h\"\n#include \"CNCConfig.h\"\r\n\r\nbool COperations::CanAdd(HeeksObj* object)\r\n{\r\n\treturn object->GetType() == ProfileType || object->GetType() == PocketType || object->GetType() == ZigZagType || object->GetType() == AdaptiveType;\r\n}\r\n\r\nvoid COperations::WriteXML(TiXmlNode *root)\r\n{\r\n\tTiXmlElement * element;\r\n\telement = new TiXmlElement( \"Operations\" );\r\n\troot->LinkEndChild( element );  \r\n\tWriteBaseXML(element);\r\n}\r\n\r\n\/\/static\r\nHeeksObj* COperations::ReadFromXMLElement(TiXmlElement* pElem)\r\n{\r\n\tCOperations* new_object = new COperations;\r\n\tnew_object->ReadBaseXML(pElem);\r\n\treturn new_object;\r\n}\n\r\nstatic COperations* object_for_tools = NULL;\r\n\nclass SetAllActive: public Tool{\r\n\t\/\/ Tool's virtual functions\r\n\tconst wxChar* GetTitle(){return _(\"Set All Operations Active\");}\r\n\tvoid Run()\n\t{\n\t\tfor(HeeksObj* object = object_for_tools->GetFirstChild(); object; object = object_for_tools->GetNextChild())\n\t\t{\n\t\t\tif(COp::IsAnOperation(object->GetType()))\n\t\t\t{\n\t\t\t\t((COp*)object)->m_active = true;\n\t\t\t\theeksCAD->WasModified(object);\n\t\t\t}\n\t\t}\n\t}\r\n\twxString BitmapPath(){ return _T(\"setactive\");}\r\n};\r\n\r\nstatic SetAllActive set_all_active;\r\n\nclass SetAllInactive: public Tool{\r\n\t\/\/ Tool's virtual functions\r\n\tconst wxChar* GetTitle(){return _(\"Set All Operations Inactive\");}\r\n\tvoid Run()\n\t{\n\t\tfor(HeeksObj* object = object_for_tools->GetFirstChild(); object; object = object_for_tools->GetNextChild())\n\t\t{\n\t\t\tif(COp::IsAnOperation(object->GetType()))\n\t\t\t{\n\t\t\t\t((COp*)object)->m_active = false;\n\t\t\t\theeksCAD->WasModified(object);\n\t\t\t}\n\t\t}\n\t}\r\n\twxString BitmapPath(){ return _T(\"setinactive\");}\r\n};\r\n\r\nstatic SetAllInactive set_all_inactive;\r\n\r\nvoid COperations::GetTools(std::list<Tool*>* t_list, const wxPoint* p)\r\n{\r\n\tobject_for_tools = this;\r\n\tt_list->push_back(&set_all_active);\r\n\tt_list->push_back(&set_all_inactive);\r\n\r\n\tObjList::GetTools(t_list, p);\r\n}\r\n\r\nCProgram::CProgram():m_nc_code(NULL), m_operations(NULL), m_script_edited(false)\r\n{\r\n\tCNCConfig config;\n\tconfig.Read(_T(\"ProgramMachine\"), &m_machine, _T(\"nc.iso\"));\r\n#ifdef WIN32\n\tconfig.Read(_T(\"ProgramOutputFile\"), &m_output_file, _T(\"test.tap\"));\n#else\n\tconfig.Read(_T(\"ProgramOutputFile\"), &m_output_file, _T(\"\/tmp\/test.tap\"));\n#endif\r\n\tconfig.Read(_T(\"ProgramUnits\"), &m_units, 1.0);\r\n}\r\n\r\nHeeksObj *CProgram::MakeACopy(void)const\r\n{\r\n\treturn new CProgram(*this);\r\n}\r\n\r\nvoid CProgram::CopyFrom(const HeeksObj* object)\r\n{\r\n\toperator=(*((CProgram*)object));\r\n}\r\n\r\nstatic void on_set_machine(const wxChar* value, HeeksObj* object)\n{\n\t((CProgram*)object)->m_machine = value;\n\tCNCConfig config;\n\tconfig.Write(_T(\"ProgramMachine\"), ((CProgram*)object)->m_machine);\r\n}\n\r\nstatic void on_set_output_file(const wxChar* value, HeeksObj* object)\n{\n\t((CProgram*)object)->m_output_file = value;\n\tCNCConfig config;\n\tconfig.Write(_T(\"ProgramOutputFile\"), ((CProgram*)object)->m_output_file);\r\n}\r\n\r\nstatic void on_set_units(int value, HeeksObj* object)\n{\n\t((CProgram*)object)->m_units = (value == 0) ? 1.0:25.4;\n\tCNCConfig config;\n\tconfig.Write(_T(\"ProgramUnits\"), ((CProgram*)object)->m_units);\n\n\t\/\/ also change HeeksCAD's view units automatically\n\theeksCAD->SetViewUnits(((CProgram*)object)->m_units, true);\r\n}\n\nvoid CProgram::GetProperties(std::list<Property *> *list)\r\n{\r\n\tlist->push_back(new PropertyString(_(\"machine\"), m_machine, this, on_set_machine));\r\n\tlist->push_back(new PropertyString(_(\"output file\"), m_output_file, this, on_set_output_file));\r\n\t{\r\n\t\tstd::list< wxString > choices;\r\n\t\tchoices.push_back ( wxString ( _(\"mm\") ) );\r\n\t\tchoices.push_back ( wxString ( _(\"inch\") ) );\r\n\t\tint choice = 0;\n\t\tif(m_units > 25.0)choice = 1;\r\n\t\tlist->push_back ( new PropertyChoice ( _(\"units\"),  choices, choice, this, on_set_units ) );\r\n\t}\r\n\tHeeksObj::GetProperties(list);\r\n}\r\n\r\nbool CProgram::CanAdd(HeeksObj* object)\r\n{\r\n\treturn object->GetType() == NCCodeType || object->GetType() == OperationsType;\r\n}\r\n\r\nbool CProgram::CanAddTo(HeeksObj* owner)\r\n{\r\n\treturn owner->GetType() == DocumentType;\r\n}\r\n\r\nvoid CProgram::SetClickMarkPoint(MarkedObject* marked_object, const double* ray_start, const double* ray_direction)\r\n{\r\n\tif(marked_object->m_map.size() > 0)\r\n\t{\r\n\t\tMarkedObject* sub_marked_object = marked_object->m_map.begin()->second;\r\n\t\tif(sub_marked_object)\r\n\t\t{\r\n\t\t\tHeeksObj* object = sub_marked_object->m_map.begin()->first;\r\n\t\t\tif(object && object->GetType() == NCCodeType)\r\n\t\t\t{\r\n\t\t\t\t((CNCCode*)object)->SetClickMarkPoint(sub_marked_object, ray_start, ray_direction);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid CProgram::WriteXML(TiXmlNode *root)\r\n{\r\n\tTiXmlElement * element;\r\n\telement = new TiXmlElement( \"Program\" );\r\n\troot->LinkEndChild( element );  \r\n\telement->SetAttribute(\"machine\", Ttc(m_machine.c_str()));\r\n\telement->SetAttribute(\"output_file\", Ttc(m_output_file.c_str()));\r\n\telement->SetAttribute(\"program\", Ttc(theApp.m_program_canvas->m_textCtrl->GetValue()));\r\n\telement->SetDoubleAttribute(\"units\", m_units);\r\n\r\n\tWriteBaseXML(element);\r\n}\r\n\r\nbool CProgram::Add(HeeksObj* object, HeeksObj* prev_object)\r\n{\r\n\tif(object->GetType() == NCCodeType)m_nc_code = (CNCCode*)object;\r\n\tif(object->GetType() == OperationsType)m_operations = (COperations*)object;\r\n\treturn ObjList::Add(object, prev_object);\r\n}\r\n\r\nvoid CProgram::Remove(HeeksObj* object)\r\n{\r\n\t \/\/ these shouldn't happen, though\r\n\tif(object == m_nc_code)m_nc_code = NULL;\r\n\telse if(object == m_operations)m_operations = NULL;\r\n\r\n\tObjList::Remove(object);\r\n}\r\n\r\n\/\/ static member function\r\nHeeksObj* CProgram::ReadFromXMLElement(TiXmlElement* pElem)\r\n{\r\n\tCProgram* new_object = new CProgram;\r\n\r\n\t\/\/ get the attributes\r\n\tfor(TiXmlAttribute* a = pElem->FirstAttribute(); a; a = a->Next())\r\n\t{\r\n\t\tstd::string name(a->Name());\r\n\t\tif(name == \"machine\"){new_object->m_machine.assign(Ctt(a->Value()));}\r\n\t\telse if(name == \"output_file\"){new_object->m_output_file.assign(Ctt(a->Value()));}\r\n\t\telse if(name == \"program\"){theApp.m_program_canvas->m_textCtrl->SetValue(Ctt(a->Value()));}\r\n\t\telse if(name == \"units\"){new_object->m_units = a->DoubleValue();}\r\n\t}\r\n\r\n\tnew_object->ReadBaseXML(pElem);\r\n\ttheApp.m_program = new_object;\r\n\r\n\treturn new_object;\r\n}\n\nvoid CProgram::RewritePythonProgram()\n{\n\ttheApp.m_program_canvas->m_textCtrl->Clear();\n\tCZigZag::number_for_stl_file = 1;\n\tCAdaptive::number_for_stl_file = 1;\n\n\tbool profile_op_exists = false;\n\tbool pocket_op_exists = false;\n\tbool zigzag_op_exists = false;\n\tbool adaptive_op_exists = false;\n\tfor(HeeksObj* object = m_operations->GetFirstChild(); object; object = m_operations->GetNextChild())\n\t{\n\t\tif(object->GetType() == ProfileType)\n\t\t{\n\t\t\tif(((CProfile*)object)->m_active)profile_op_exists = true;\n\t\t}\n\t\telse if(object->GetType() == PocketType)\n\t\t{\n\t\t\tif(((CPocket*)object)->m_active)pocket_op_exists = true;\n\t\t}\n\t\telse if(object->GetType() == ZigZagType)\n\t\t{\n\t\t\tif(((CZigZag*)object)->m_active)zigzag_op_exists = true;\n\t\t}\n\t\telse if(object->GetType() == AdaptiveType)\n\t\t{\n\t\t\tif(((CAdaptive*)object)->m_active)adaptive_op_exists = true;\n\t\t}\n\t}\n\n\t\/\/ add standard stuff at the top\n\t\/\/hackhack, make it work on unix with FHS\n#ifndef WIN32\n\ttheApp.m_program_canvas->AppendText(_T(\"import sys\\n\"));\n\ttheApp.m_program_canvas->AppendText(_T(\"sys.path.insert(0,'\/usr\/lib\/heekscnc\/')\\n\"));\n#endif\n\t\/\/ kurve related things\n\tif(profile_op_exists)\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import kurve\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import kurve_funcs\\n\"));\n\t}\n\n\t\/\/ area related things\n\tif(pocket_op_exists)\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import area\\n\"));\n\t\tif(fabs(m_units - 1.0) > 0.00000001)\n\t\t{\n\t\t\ttheApp.m_program_canvas->AppendText(_T(\"area.set_units(\"));\n\t\t\ttheApp.m_program_canvas->AppendText(m_units);\n\t\t\ttheApp.m_program_canvas->AppendText(_T(\")\\n\"));\n\t\t}\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import area_funcs\\n\"));\n\t}\n\n\t\/\/ pycam stuff\n\tif(zigzag_op_exists)\n\t{\n#ifdef WIN32\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import sys\\n\"));\n#endif\n\t\ttheApp.m_program_canvas->AppendText(_T(\"sys.path.insert(0,'PyCam\/trunk')\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Geometry import *\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Cutters.SphericalCutter import *\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Cutters.CylindricalCutter import *\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Cutters.ToroidalCutter import *\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Importers.STLImporter import ImportModel\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.PathGenerators.DropCutter import DropCutter\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from PyCamToHeeks import HeeksCNCExporter\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\t}\n\n\t\/\/ actp\n\tif(adaptive_op_exists)\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import actp_funcs\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import actp\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\t}\n\n\t\/\/ machine general stuff\n\ttheApp.m_program_canvas->AppendText(_T(\"from nc.nc import *\\n\"));\n\n\t\/\/ specific machine\n\ttheApp.m_program_canvas->AppendText(_T(\"import \") + m_machine + _T(\"\\n\"));\n\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\n\t\/\/ output file\n\ttheApp.m_program_canvas->AppendText(_T(\"output('\") + m_output_file + _T(\"')\\n\"));\n\n\t\/\/ begin program\n\t\/\/theApp.m_program_canvas->AppendText(_T(\"program_begin(123, 'Test program')\\n\"));\n\ttheApp.m_program_canvas->AppendText(_T(\"absolute()\\n\"));\n\tif(m_units > 25.0)\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"imperial()\\n\"));\n\t}\n\telse\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"metric()\\n\"));\n\t}\n\ttheApp.m_program_canvas->AppendText(_T(\"set_plane(0)\\n\"));\n\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\n\t\/\/ write the operations\n\tfor(HeeksObj* object = m_operations->GetFirstChild(); object; object = m_operations->GetNextChild())\n\t{\n\t\tswitch(object->GetType())\n\t\t{\n\t\tcase ProfileType:\n\t\t\tif(((CProfile*)object)->m_active)((CProfile*)object)->AppendTextToProgram();\n\t\t\tbreak;\n\t\tcase PocketType:\n\t\t\tif(((CPocket*)object)->m_active)((CPocket*)object)->AppendTextToProgram();\n\t\t\tbreak;\n\t\tcase ZigZagType:\n\t\t\tif(((CZigZag*)object)->m_active)((CZigZag*)object)->AppendTextToProgram();\n\t\t\tbreak;\n\t\tcase AdaptiveType:\n\t\t\tif(((CAdaptive*)object)->m_active)((CAdaptive*)object)->AppendTextToProgram();\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nProgramUserType CProgram::GetUserType()\n{\n\tif(m_nc_code->m_user_edited)return ProgramUserTypeNC;\n\tif(m_script_edited)return ProgramUserTypeScript;\n\tif(m_operations->GetFirstChild())return ProgramUserTypeTree;\n\treturn ProgramUserTypeUnkown;\n}\n\nvoid CProgram::UpdateFromUserType()\n{\n#if 0\n\tswitch(GetUserType())\n\t{\n\tcase ProgramUserTypeUnkown:\n\n\tcase tree:\n   Enable \"Operations\" icon in tree\r\n     editing the tree, recreates the python script\r\n   Read only \"Program\" window\r\n     pressing \"Post-process\" creates the NC code ( and backplots it )\r\n   Read only \"Output\" window\r\n   Disable all buttons on \"Output\" window\r\n\n\t}\n#endif\n}\n<commit_msg>always write area.set_units<commit_after>\/\/ Program.cpp\r\n\r\n#include \"stdafx.h\"\r\n#include \"Program.h\"\r\n#include \"PythonStuff.h\"\r\n#include \"tinyxml\/tinyxml.h\"\r\n#include \"ProgramCanvas.h\"\n#include \"NCCode.h\"\n#include \"interface\/MarkedObject.h\"\r\n#include \"interface\/PropertyString.h\"\r\n#include \"interface\/PropertyChoice.h\"\r\n#include \"interface\/Tool.h\"\r\n#include \"Profile.h\"\r\n#include \"Pocket.h\"\r\n#include \"ZigZag.h\"\r\n#include \"Adaptive.h\"\r\n#include \"Op.h\"\n#include \"CNCConfig.h\"\r\n\r\nbool COperations::CanAdd(HeeksObj* object)\r\n{\r\n\treturn object->GetType() == ProfileType || object->GetType() == PocketType || object->GetType() == ZigZagType || object->GetType() == AdaptiveType;\r\n}\r\n\r\nvoid COperations::WriteXML(TiXmlNode *root)\r\n{\r\n\tTiXmlElement * element;\r\n\telement = new TiXmlElement( \"Operations\" );\r\n\troot->LinkEndChild( element );  \r\n\tWriteBaseXML(element);\r\n}\r\n\r\n\/\/static\r\nHeeksObj* COperations::ReadFromXMLElement(TiXmlElement* pElem)\r\n{\r\n\tCOperations* new_object = new COperations;\r\n\tnew_object->ReadBaseXML(pElem);\r\n\treturn new_object;\r\n}\n\r\nstatic COperations* object_for_tools = NULL;\r\n\nclass SetAllActive: public Tool{\r\n\t\/\/ Tool's virtual functions\r\n\tconst wxChar* GetTitle(){return _(\"Set All Operations Active\");}\r\n\tvoid Run()\n\t{\n\t\tfor(HeeksObj* object = object_for_tools->GetFirstChild(); object; object = object_for_tools->GetNextChild())\n\t\t{\n\t\t\tif(COp::IsAnOperation(object->GetType()))\n\t\t\t{\n\t\t\t\t((COp*)object)->m_active = true;\n\t\t\t\theeksCAD->WasModified(object);\n\t\t\t}\n\t\t}\n\t}\r\n\twxString BitmapPath(){ return _T(\"setactive\");}\r\n};\r\n\r\nstatic SetAllActive set_all_active;\r\n\nclass SetAllInactive: public Tool{\r\n\t\/\/ Tool's virtual functions\r\n\tconst wxChar* GetTitle(){return _(\"Set All Operations Inactive\");}\r\n\tvoid Run()\n\t{\n\t\tfor(HeeksObj* object = object_for_tools->GetFirstChild(); object; object = object_for_tools->GetNextChild())\n\t\t{\n\t\t\tif(COp::IsAnOperation(object->GetType()))\n\t\t\t{\n\t\t\t\t((COp*)object)->m_active = false;\n\t\t\t\theeksCAD->WasModified(object);\n\t\t\t}\n\t\t}\n\t}\r\n\twxString BitmapPath(){ return _T(\"setinactive\");}\r\n};\r\n\r\nstatic SetAllInactive set_all_inactive;\r\n\r\nvoid COperations::GetTools(std::list<Tool*>* t_list, const wxPoint* p)\r\n{\r\n\tobject_for_tools = this;\r\n\tt_list->push_back(&set_all_active);\r\n\tt_list->push_back(&set_all_inactive);\r\n\r\n\tObjList::GetTools(t_list, p);\r\n}\r\n\r\nCProgram::CProgram():m_nc_code(NULL), m_operations(NULL), m_script_edited(false)\r\n{\r\n\tCNCConfig config;\n\tconfig.Read(_T(\"ProgramMachine\"), &m_machine, _T(\"nc.iso\"));\r\n#ifdef WIN32\n\tconfig.Read(_T(\"ProgramOutputFile\"), &m_output_file, _T(\"test.tap\"));\n#else\n\tconfig.Read(_T(\"ProgramOutputFile\"), &m_output_file, _T(\"\/tmp\/test.tap\"));\n#endif\r\n\tconfig.Read(_T(\"ProgramUnits\"), &m_units, 1.0);\r\n}\r\n\r\nHeeksObj *CProgram::MakeACopy(void)const\r\n{\r\n\treturn new CProgram(*this);\r\n}\r\n\r\nvoid CProgram::CopyFrom(const HeeksObj* object)\r\n{\r\n\toperator=(*((CProgram*)object));\r\n}\r\n\r\nstatic void on_set_machine(const wxChar* value, HeeksObj* object)\n{\n\t((CProgram*)object)->m_machine = value;\n\tCNCConfig config;\n\tconfig.Write(_T(\"ProgramMachine\"), ((CProgram*)object)->m_machine);\r\n}\n\r\nstatic void on_set_output_file(const wxChar* value, HeeksObj* object)\n{\n\t((CProgram*)object)->m_output_file = value;\n\tCNCConfig config;\n\tconfig.Write(_T(\"ProgramOutputFile\"), ((CProgram*)object)->m_output_file);\r\n}\r\n\r\nstatic void on_set_units(int value, HeeksObj* object)\n{\n\t((CProgram*)object)->m_units = (value == 0) ? 1.0:25.4;\n\tCNCConfig config;\n\tconfig.Write(_T(\"ProgramUnits\"), ((CProgram*)object)->m_units);\n\n\t\/\/ also change HeeksCAD's view units automatically\n\theeksCAD->SetViewUnits(((CProgram*)object)->m_units, true);\r\n}\n\nvoid CProgram::GetProperties(std::list<Property *> *list)\r\n{\r\n\tlist->push_back(new PropertyString(_(\"machine\"), m_machine, this, on_set_machine));\r\n\tlist->push_back(new PropertyString(_(\"output file\"), m_output_file, this, on_set_output_file));\r\n\t{\r\n\t\tstd::list< wxString > choices;\r\n\t\tchoices.push_back ( wxString ( _(\"mm\") ) );\r\n\t\tchoices.push_back ( wxString ( _(\"inch\") ) );\r\n\t\tint choice = 0;\n\t\tif(m_units > 25.0)choice = 1;\r\n\t\tlist->push_back ( new PropertyChoice ( _(\"units\"),  choices, choice, this, on_set_units ) );\r\n\t}\r\n\tHeeksObj::GetProperties(list);\r\n}\r\n\r\nbool CProgram::CanAdd(HeeksObj* object)\r\n{\r\n\treturn object->GetType() == NCCodeType || object->GetType() == OperationsType;\r\n}\r\n\r\nbool CProgram::CanAddTo(HeeksObj* owner)\r\n{\r\n\treturn owner->GetType() == DocumentType;\r\n}\r\n\r\nvoid CProgram::SetClickMarkPoint(MarkedObject* marked_object, const double* ray_start, const double* ray_direction)\r\n{\r\n\tif(marked_object->m_map.size() > 0)\r\n\t{\r\n\t\tMarkedObject* sub_marked_object = marked_object->m_map.begin()->second;\r\n\t\tif(sub_marked_object)\r\n\t\t{\r\n\t\t\tHeeksObj* object = sub_marked_object->m_map.begin()->first;\r\n\t\t\tif(object && object->GetType() == NCCodeType)\r\n\t\t\t{\r\n\t\t\t\t((CNCCode*)object)->SetClickMarkPoint(sub_marked_object, ray_start, ray_direction);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid CProgram::WriteXML(TiXmlNode *root)\r\n{\r\n\tTiXmlElement * element;\r\n\telement = new TiXmlElement( \"Program\" );\r\n\troot->LinkEndChild( element );  \r\n\telement->SetAttribute(\"machine\", Ttc(m_machine.c_str()));\r\n\telement->SetAttribute(\"output_file\", Ttc(m_output_file.c_str()));\r\n\telement->SetAttribute(\"program\", Ttc(theApp.m_program_canvas->m_textCtrl->GetValue()));\r\n\telement->SetDoubleAttribute(\"units\", m_units);\r\n\r\n\tWriteBaseXML(element);\r\n}\r\n\r\nbool CProgram::Add(HeeksObj* object, HeeksObj* prev_object)\r\n{\r\n\tif(object->GetType() == NCCodeType)m_nc_code = (CNCCode*)object;\r\n\tif(object->GetType() == OperationsType)m_operations = (COperations*)object;\r\n\treturn ObjList::Add(object, prev_object);\r\n}\r\n\r\nvoid CProgram::Remove(HeeksObj* object)\r\n{\r\n\t \/\/ these shouldn't happen, though\r\n\tif(object == m_nc_code)m_nc_code = NULL;\r\n\telse if(object == m_operations)m_operations = NULL;\r\n\r\n\tObjList::Remove(object);\r\n}\r\n\r\n\/\/ static member function\r\nHeeksObj* CProgram::ReadFromXMLElement(TiXmlElement* pElem)\r\n{\r\n\tCProgram* new_object = new CProgram;\r\n\r\n\t\/\/ get the attributes\r\n\tfor(TiXmlAttribute* a = pElem->FirstAttribute(); a; a = a->Next())\r\n\t{\r\n\t\tstd::string name(a->Name());\r\n\t\tif(name == \"machine\"){new_object->m_machine.assign(Ctt(a->Value()));}\r\n\t\telse if(name == \"output_file\"){new_object->m_output_file.assign(Ctt(a->Value()));}\r\n\t\telse if(name == \"program\"){theApp.m_program_canvas->m_textCtrl->SetValue(Ctt(a->Value()));}\r\n\t\telse if(name == \"units\"){new_object->m_units = a->DoubleValue();}\r\n\t}\r\n\r\n\tnew_object->ReadBaseXML(pElem);\r\n\ttheApp.m_program = new_object;\r\n\r\n\treturn new_object;\r\n}\n\nvoid CProgram::RewritePythonProgram()\n{\n\ttheApp.m_program_canvas->m_textCtrl->Clear();\n\tCZigZag::number_for_stl_file = 1;\n\tCAdaptive::number_for_stl_file = 1;\n\n\tbool profile_op_exists = false;\n\tbool pocket_op_exists = false;\n\tbool zigzag_op_exists = false;\n\tbool adaptive_op_exists = false;\n\tfor(HeeksObj* object = m_operations->GetFirstChild(); object; object = m_operations->GetNextChild())\n\t{\n\t\tif(object->GetType() == ProfileType)\n\t\t{\n\t\t\tif(((CProfile*)object)->m_active)profile_op_exists = true;\n\t\t}\n\t\telse if(object->GetType() == PocketType)\n\t\t{\n\t\t\tif(((CPocket*)object)->m_active)pocket_op_exists = true;\n\t\t}\n\t\telse if(object->GetType() == ZigZagType)\n\t\t{\n\t\t\tif(((CZigZag*)object)->m_active)zigzag_op_exists = true;\n\t\t}\n\t\telse if(object->GetType() == AdaptiveType)\n\t\t{\n\t\t\tif(((CAdaptive*)object)->m_active)adaptive_op_exists = true;\n\t\t}\n\t}\n\n\t\/\/ add standard stuff at the top\n\t\/\/hackhack, make it work on unix with FHS\n#ifndef WIN32\n\ttheApp.m_program_canvas->AppendText(_T(\"import sys\\n\"));\n\ttheApp.m_program_canvas->AppendText(_T(\"sys.path.insert(0,'\/usr\/lib\/heekscnc\/')\\n\"));\n#endif\n\t\/\/ kurve related things\n\tif(profile_op_exists)\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import kurve\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import kurve_funcs\\n\"));\n\t}\n\n\t\/\/ area related things\n\tif(pocket_op_exists)\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import area\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"area.set_units(\"));\n\t\ttheApp.m_program_canvas->AppendText(m_units);\n\t\ttheApp.m_program_canvas->AppendText(_T(\")\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import area_funcs\\n\"));\n\t}\n\n\t\/\/ pycam stuff\n\tif(zigzag_op_exists)\n\t{\n#ifdef WIN32\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import sys\\n\"));\n#endif\n\t\ttheApp.m_program_canvas->AppendText(_T(\"sys.path.insert(0,'PyCam\/trunk')\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Geometry import *\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Cutters.SphericalCutter import *\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Cutters.CylindricalCutter import *\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Cutters.ToroidalCutter import *\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.Importers.STLImporter import ImportModel\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from pycam.PathGenerators.DropCutter import DropCutter\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"from PyCamToHeeks import HeeksCNCExporter\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\t}\n\n\t\/\/ actp\n\tif(adaptive_op_exists)\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import actp_funcs\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"import actp\\n\"));\n\t\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\t}\n\n\t\/\/ machine general stuff\n\ttheApp.m_program_canvas->AppendText(_T(\"from nc.nc import *\\n\"));\n\n\t\/\/ specific machine\n\ttheApp.m_program_canvas->AppendText(_T(\"import \") + m_machine + _T(\"\\n\"));\n\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\n\t\/\/ output file\n\ttheApp.m_program_canvas->AppendText(_T(\"output('\") + m_output_file + _T(\"')\\n\"));\n\n\t\/\/ begin program\n\t\/\/theApp.m_program_canvas->AppendText(_T(\"program_begin(123, 'Test program')\\n\"));\n\ttheApp.m_program_canvas->AppendText(_T(\"absolute()\\n\"));\n\tif(m_units > 25.0)\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"imperial()\\n\"));\n\t}\n\telse\n\t{\n\t\ttheApp.m_program_canvas->AppendText(_T(\"metric()\\n\"));\n\t}\n\ttheApp.m_program_canvas->AppendText(_T(\"set_plane(0)\\n\"));\n\ttheApp.m_program_canvas->AppendText(_T(\"\\n\"));\n\n\t\/\/ write the operations\n\tfor(HeeksObj* object = m_operations->GetFirstChild(); object; object = m_operations->GetNextChild())\n\t{\n\t\tswitch(object->GetType())\n\t\t{\n\t\tcase ProfileType:\n\t\t\tif(((CProfile*)object)->m_active)((CProfile*)object)->AppendTextToProgram();\n\t\t\tbreak;\n\t\tcase PocketType:\n\t\t\tif(((CPocket*)object)->m_active)((CPocket*)object)->AppendTextToProgram();\n\t\t\tbreak;\n\t\tcase ZigZagType:\n\t\t\tif(((CZigZag*)object)->m_active)((CZigZag*)object)->AppendTextToProgram();\n\t\t\tbreak;\n\t\tcase AdaptiveType:\n\t\t\tif(((CAdaptive*)object)->m_active)((CAdaptive*)object)->AppendTextToProgram();\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nProgramUserType CProgram::GetUserType()\n{\n\tif(m_nc_code->m_user_edited)return ProgramUserTypeNC;\n\tif(m_script_edited)return ProgramUserTypeScript;\n\tif(m_operations->GetFirstChild())return ProgramUserTypeTree;\n\treturn ProgramUserTypeUnkown;\n}\n\nvoid CProgram::UpdateFromUserType()\n{\n#if 0\n\tswitch(GetUserType())\n\t{\n\tcase ProgramUserTypeUnkown:\n\n\tcase tree:\n   Enable \"Operations\" icon in tree\r\n     editing the tree, recreates the python script\r\n   Read only \"Program\" window\r\n     pressing \"Post-process\" creates the NC code ( and backplots it )\r\n   Read only \"Output\" window\r\n   Disable all buttons on \"Output\" window\r\n\n\t}\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File Monodomain.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: Monodomain cardiac electrophysiology homogenised model.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <iostream>\n\n#include <CardiacEPSolver\/EquationSystems\/Monodomain.h>\n#include <CardiacEPSolver\/Filters\/FilterCheckpointCellModel.h>\n\nnamespace Nektar\n{\n    \/**\n     * @class Monodomain\n     *\n     * Base model of cardiac electrophysiology of the form\n     * \\f{align*}{\n     *     \\frac{\\partial u}{\\partial t} = \\nabla^2 u + J_{ion},\n     * \\f}\n     * where the reaction term, \\f$J_{ion}\\f$ is defined by a specific cell\n     * model.\n     *\n     * This implementation, at present, treats the reaction terms explicitly\n     * and the diffusive element implicitly.\n     *\/\n\n    \/**\n     * Registers the class with the Factory.\n     *\/\n    string Monodomain::className\n            = GetEquationSystemFactory().RegisterCreatorFunction(\n                \"Monodomain\",\n                Monodomain::create,\n                \"Monodomain model of cardiac electrophysiology.\");\n\n\n    \/**\n     *\n     *\/\n    Monodomain::Monodomain(\n            const LibUtilities::SessionReaderSharedPtr& pSession)\n        : UnsteadySystem(pSession)\n    {\n    }\n\n\n    \/**\n     *\n     *\/\n    void Monodomain::v_InitObject()\n    {\n        UnsteadySystem::v_InitObject();\n\n        m_session->LoadParameter(\"Chi\",        m_chi);\n        m_session->LoadParameter(\"Cm\",         m_capMembrane);\n\n        std::string vCellModel;\n        m_session->LoadSolverInfo(\"CELLMODEL\", vCellModel, \"\");\n\n        ASSERTL0(vCellModel != \"\", \"Cell Model not specified.\");\n\n        m_cell = GetCellModelFactory().CreateInstance(\n                                        vCellModel, m_session, m_fields[0]);\n\n        m_intVariables.push_back(0);\n\n        \/\/ Load variable coefficients\n        StdRegions::VarCoeffType varCoeffEnum[3] = {\n                StdRegions::eVarCoeffD00,\n                StdRegions::eVarCoeffD11,\n                StdRegions::eVarCoeffD22\n        };\n        std::string varName = \"intensity\";\n        std::string aniso_var[3] = {\n                \"fx\", \"fy\", \"fz\"\n        };\n        int nq = m_fields[0]->GetNpoints();\n        Array<OneD, NekDouble> vTemp;\n\n        \/\/ Allocate storage for variable coeffs and initialize to 1.\n        for (int i = 0; i < m_spacedim; ++i)\n        {\n            m_vardiff[varCoeffEnum[i]] = Array<OneD, NekDouble>(nq, 1.0);\n        }\n\n        \/\/ Apply fibre map f \\in [0,1], scale to conductivity range\n        \/\/ [o_min,o_max], specified by the session parameters o_min and o_max\n        if (m_session->DefinesFunction(\"AnisotropicConductivity\"))\n        {\n            if (m_session->DefinesCmdLineArgument(\"verbose\"))\n            {\n                cout << \"Loading Anisotropic Fibre map.\" << endl;\n            }\n\n            NekDouble o_min = m_session->GetParameter(\"o_min\");\n            NekDouble o_max = m_session->GetParameter(\"o_max\");\n\n            for (int i = 0; i < m_spacedim; ++i)\n            {\n                ASSERTL0(m_session->DefinesFunction(\"AnisotropicConductivity\",\n                                                    aniso_var[i]),\n                         \"Function 'AnisotropicConductivity' not correctly \"\n                         \"defined.\");\n                EvaluateFunction(aniso_var[i], vTemp,\n                                 \"AnisotropicConductivity\");\n                Vmath::Smul(nq, o_max-o_min, vTemp, 1,\n                                m_vardiff[varCoeffEnum[i]], 1);\n                Vmath::Sadd(nq, o_min, m_vardiff[varCoeffEnum[i]], 1,\n                                       m_vardiff[varCoeffEnum[i]], 1);\n            }\n        }\n\n        \/\/ Scale by scar map (range 0->1) derived from intensity map\n        \/\/ (range d_min -> d_max)\n        if (m_session->DefinesFunction(\"IsotropicConductivity\"))\n        {\n            if (m_session->DefinesCmdLineArgument(\"verbose\"))\n            {\n                cout << \"Loading Isotropic Conductivity map.\" << endl;\n            }\n\n            NekDouble f_min = m_session->GetParameter(\"d_min\");\n            NekDouble f_max = m_session->GetParameter(\"d_max\");\n\n            EvaluateFunction(varName, vTemp, \"IsotropicConductivity\");\n\n            \/\/ Threshold based on d_min, d_max\n            for (int j = 0; j < nq; ++j)\n            {\n                vTemp[j] = (vTemp[j] < f_min ? f_min : vTemp[j]);\n                vTemp[j] = (vTemp[j] > f_max ? f_max : vTemp[j]);\n            }\n\n            \/\/ Rescale to s \\in [0,1] (0 maps to d_max, 1 maps to d_min)\n            Vmath::Sadd(nq, -f_min, vTemp, 1, vTemp, 1);\n            Vmath::Smul(nq, -1.0\/(f_max-f_min), vTemp, 1, vTemp, 1);\n            Vmath::Sadd(nq, 1.0, vTemp, 1, vTemp, 1);\n\n            \/\/ Scale anisotropic conductivity values\n            for (int i = 0; i < m_spacedim; ++i)\n            {\n                Vmath::Vmul(nq, vTemp, 1,\n                                m_vardiff[varCoeffEnum[i]], 1,\n                                m_vardiff[varCoeffEnum[i]], 1);\n            }\n        }\n\n\n        \/\/ Write out conductivity values\n        for (int i = 0; i < m_spacedim; ++i)\n        {\n            \/\/ Transform variable coefficient and write out to file.\n            m_fields[0]->FwdTrans_IterPerExp(m_vardiff[varCoeffEnum[i]],\n                                             m_fields[0]->UpdateCoeffs());\n            std::stringstream filename;\n            filename << \"Conductivity_\" << aniso_var[i];\n            if (m_comm->GetSize() > 1)\n            {\n                filename << \"_P\" << m_comm->GetRank();\n            }\n            filename << \".fld\";\n            WriteFld(filename.str());\n        }\n\n        \/\/ Search through the loaded filters and pass the cell model to any\n        \/\/ CheckpointCellModel filters loaded.\n        int k = 0;\n        const LibUtilities::FilterMap& f = m_session->GetFilters();\n        LibUtilities::FilterMap::const_iterator x;\n        for (x = f.begin(); x != f.end(); ++x, ++k)\n        {\n            if (x->first == \"CheckpointCellModel\")\n            {\n                boost::shared_ptr<FilterCheckpointCellModel> c\n                    = boost::dynamic_pointer_cast<FilterCheckpointCellModel>(\n                                                                m_filters[k]);\n                c->SetCellModel(m_cell);\n            }\n        }\n\n        \/\/ Load stimuli\n        m_stimulus = Stimulus::LoadStimuli(m_session, m_fields[0]);\n\n        if (!m_explicitDiffusion)\n        {\n            m_ode.DefineImplicitSolve (&Monodomain::DoImplicitSolve, this);\n        }\n        m_ode.DefineOdeRhs(&Monodomain::DoOdeRhs, this);\n    }\n\n\n    \/**\n     *\n     *\/\n    Monodomain::~Monodomain()\n    {\n\n    }\n\n\n    \/**\n     * @param   inarray         Input array.\n     * @param   outarray        Output array.\n     * @param   time            Current simulation time.\n     * @param   lambda          Timestep.\n     *\/\n    void Monodomain::DoImplicitSolve(\n            const Array<OneD, const Array<OneD, NekDouble> >&inarray,\n                  Array<OneD, Array<OneD, NekDouble> >&outarray,\n            const NekDouble time,\n            const NekDouble lambda)\n    {\n        int nvariables  = inarray.num_elements();\n        int nq          = m_fields[0]->GetNpoints();\n        StdRegions::ConstFactorMap factors;\n        \/\/ lambda = \\Delta t\n        factors[StdRegions::eFactorLambda] = 1.0\/lambda*m_chi*m_capMembrane;\n\n        \/\/ We solve ( \\nabla^2 - HHlambda ) Y[i] = rhs [i]\n        \/\/ inarray = input: \\hat{rhs} -> output: \\hat{Y}\n        \/\/ outarray = output: nabla^2 \\hat{Y}\n        \/\/ where \\hat = modal coeffs\n        for (int i = 0; i < nvariables; ++i)\n        {\n            \/\/ Multiply 1.0\/timestep\n            Vmath::Smul(nq, -factors[StdRegions::eFactorLambda], inarray[i], 1,\n                                            m_fields[i]->UpdatePhys(), 1);\n\n            \/\/ Solve a system of equations with Helmholtz solver and transform\n            \/\/ back into physical space.\n            m_fields[i]->HelmSolve(m_fields[i]->GetPhys(),\n                                   m_fields[i]->UpdateCoeffs(), NullFlagList,\n                                   factors, m_vardiff);\n\n            m_fields[i]->BwdTrans( m_fields[i]->GetCoeffs(),\n                                   m_fields[i]->UpdatePhys());\n            m_fields[i]->SetPhysState(true);\n\n            \/\/ Copy the solution vector (required as m_fields must be set).\n            outarray[i] = m_fields[i]->GetPhys();\n        }\n    }\n\n\n    \/**\n     *\n     *\/\n    void Monodomain::DoOdeRhs(\n            const Array<OneD, const  Array<OneD, NekDouble> >&inarray,\n                  Array<OneD,        Array<OneD, NekDouble> >&outarray,\n            const NekDouble time)\n    {\n        \/\/ Compute I_ion\n        m_cell->TimeIntegrate(inarray, outarray, time);\n\n        \/\/ Compute I_stim\n        for (unsigned int i = 0; i < m_stimulus.size(); ++i)\n        {   \n            m_stimulus[i]->Update(outarray, time);\n        }\n    }\n\n\n    \/**\n     *\n     *\/\n    void Monodomain::v_SetInitialConditions(NekDouble initialtime,\n                        bool dumpInitialConditions)\n    {\n        EquationSystem::v_SetInitialConditions(initialtime,\n                                               dumpInitialConditions);\n        m_cell->Initialise();\n    }\n\n\n    \/**\n     *\n     *\/\n    void Monodomain::v_PrintSummary(std::ostream &out)\n    {\n        UnsteadySystem::v_PrintSummary(out);\n        if (m_session->DefinesFunction(\"d00\") &&\n            m_session->GetFunctionType(\"d00\", \"intensity\") \n                    == LibUtilities::eFunctionTypeExpression)\n        {\n            out << \"\\tDiffusivity-x   : \"\n                << m_session->GetFunction(\"d00\", \"intensity\")->GetExpression()\n                << endl;\n        }\n        if (m_session->DefinesFunction(\"d11\") &&\n            m_session->GetFunctionType(\"d11\", \"intensity\") \n                    == LibUtilities::eFunctionTypeExpression)\n        {\n            out << \"\\tDiffusivity-x   : \"\n                << m_session->GetFunction(\"d11\", \"intensity\")->GetExpression()\n                << endl;\n        }\n        if (m_session->DefinesFunction(\"d22\") &&\n            m_session->GetFunctionType(\"d22\", \"intensity\") \n                    == LibUtilities::eFunctionTypeExpression)\n        {\n            out << \"\\tDiffusivity-x   : \"\n                << m_session->GetFunction(\"d22\", \"intensity\")->GetExpression()\n                << endl;\n        }\n        m_cell->PrintSummary(out);\n    }\n}\n<commit_msg>Added off-diagonal terms in diffusion tensor.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File Monodomain.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: Monodomain cardiac electrophysiology homogenised model.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <iostream>\n\n#include <CardiacEPSolver\/EquationSystems\/Monodomain.h>\n#include <CardiacEPSolver\/Filters\/FilterCheckpointCellModel.h>\n\nnamespace Nektar\n{\n    \/**\n     * @class Monodomain\n     *\n     * Base model of cardiac electrophysiology of the form\n     * \\f{align*}{\n     *     \\frac{\\partial u}{\\partial t} = \\nabla^2 u + J_{ion},\n     * \\f}\n     * where the reaction term, \\f$J_{ion}\\f$ is defined by a specific cell\n     * model.\n     *\n     * This implementation, at present, treats the reaction terms explicitly\n     * and the diffusive element implicitly.\n     *\/\n\n    \/**\n     * Registers the class with the Factory.\n     *\/\n    string Monodomain::className\n            = GetEquationSystemFactory().RegisterCreatorFunction(\n                \"Monodomain\",\n                Monodomain::create,\n                \"Monodomain model of cardiac electrophysiology.\");\n\n\n    \/**\n     *\n     *\/\n    Monodomain::Monodomain(\n            const LibUtilities::SessionReaderSharedPtr& pSession)\n        : UnsteadySystem(pSession)\n    {\n    }\n\n\n    \/**\n     *\n     *\/\n    void Monodomain::v_InitObject()\n    {\n        UnsteadySystem::v_InitObject();\n\n        m_session->LoadParameter(\"Chi\",        m_chi);\n        m_session->LoadParameter(\"Cm\",         m_capMembrane);\n\n        std::string vCellModel;\n        m_session->LoadSolverInfo(\"CELLMODEL\", vCellModel, \"\");\n\n        ASSERTL0(vCellModel != \"\", \"Cell Model not specified.\");\n\n        m_cell = GetCellModelFactory().CreateInstance(\n                                        vCellModel, m_session, m_fields[0]);\n\n        m_intVariables.push_back(0);\n\n        \/\/ Load variable coefficients\n        StdRegions::VarCoeffType varCoeffEnum[6] = {\n                StdRegions::eVarCoeffD00,\n                StdRegions::eVarCoeffD01,\n                StdRegions::eVarCoeffD11,\n                StdRegions::eVarCoeffD02,\n                StdRegions::eVarCoeffD12,\n                StdRegions::eVarCoeffD22\n        };\n        std::string varName = \"intensity\";\n        std::string aniso_var[3] = {\n                \"fx\", \"fy\", \"fz\"\n        };\n        int nq = m_fields[0]->GetNpoints();\n        Array<OneD, NekDouble> vTemp;\n        Array<OneD, NekDouble> vTemp_i;\n        Array<OneD, NekDouble> vTemp_j;\n\n        \/\/ Allocate storage for variable coeffs and initialize to 1.\n        for (int i = 0; i < m_spacedim*(m_spacedim+1)\/2; ++i)\n        {\n            m_vardiff[varCoeffEnum[i]] = Array<OneD, NekDouble>(nq, 1.0);\n        }\n\n        \/\/ Apply fibre map f \\in [0,1], scale to conductivity range\n        \/\/ [o_min,o_max], specified by the session parameters o_min and o_max\n        if (m_session->DefinesFunction(\"AnisotropicConductivity\"))\n        {\n            if (m_session->DefinesCmdLineArgument(\"verbose\"))\n            {\n                cout << \"Loading Anisotropic Fibre map.\" << endl;\n            }\n\n            NekDouble o_min = m_session->GetParameter(\"o_min\");\n            NekDouble o_max = m_session->GetParameter(\"o_max\");\n\n            int k = 0;\n\n            \/*\n             * Diffusivity matrix is upper triangular and defined as\n             *    d_00   d_01  d_02\n             *           d_11  d_12\n             *                 d_22\n             *\n             * Given a principle fibre direction _f_ the diffusivity is given\n             * by\n             *    d_ij = { D_2 + (D_1 - D_2) f_i f_j   if i==j\n             *           {       (D_1 - D_2) f_i f_j   if i!=j\n             *\n             * The vector _f_ is given in terms of the variables fx,fy,fz in the\n             * function AnisotropicConductivity. The values of D_1 and D_2 are\n             * the parameters o_max and o_min, respectively.\n             *\/\n\n            \/\/ Loop through columns of D\n            for (int j = 0; j < m_spacedim; ++j)\n            {\n                ASSERTL0(m_session->DefinesFunction(\"AnisotropicConductivity\",\n                                                    aniso_var[j]),\n                         \"Function 'AnisotropicConductivity' not correctly \"\n                         \"defined.\");\n                EvaluateFunction(aniso_var[j], vTemp_j,\n                                 \"AnisotropicConductivity\");\n\n                \/\/ Loop through rows of D\n                for (int i = 0; i < j + 1; ++i)\n                {\n                    ASSERTL0(m_session->DefinesFunction(\"AnisotropicConductivity\",\n                                                        aniso_var[i]),\n                             \"Function 'AnisotropicConductivity' not correctly \"\n                             \"defined.\");\n                    EvaluateFunction(aniso_var[i], vTemp_i,\n                                     \"AnisotropicConductivity\");\n\n                    Vmath::Vmul(nq, vTemp_i, 1, vTemp_j, 1,\n                                           m_vardiff[varCoeffEnum[k]], 1);\n\n                    Vmath::Smul(nq, o_max-o_min,\n                                           m_vardiff[varCoeffEnum[k]], 1,\n                                           m_vardiff[varCoeffEnum[k]], 1);\n\n                    if (i == j)\n                    {\n                        Vmath::Sadd(nq, o_min, m_vardiff[varCoeffEnum[k]], 1,\n                                               m_vardiff[varCoeffEnum[k]], 1);\n                    }\n\n                    ++k;\n                }\n            }\n        }\n\n        \/\/ Scale by scar map (range 0->1) derived from intensity map\n        \/\/ (range d_min -> d_max)\n        if (m_session->DefinesFunction(\"IsotropicConductivity\"))\n        {\n            if (m_session->DefinesCmdLineArgument(\"verbose\"))\n            {\n                cout << \"Loading Isotropic Conductivity map.\" << endl;\n            }\n\n            NekDouble f_min = m_session->GetParameter(\"d_min\");\n            NekDouble f_max = m_session->GetParameter(\"d_max\");\n\n            EvaluateFunction(varName, vTemp, \"IsotropicConductivity\");\n\n            \/\/ Threshold based on d_min, d_max\n            for (int j = 0; j < nq; ++j)\n            {\n                vTemp[j] = (vTemp[j] < f_min ? f_min : vTemp[j]);\n                vTemp[j] = (vTemp[j] > f_max ? f_max : vTemp[j]);\n            }\n\n            \/\/ Rescale to s \\in [0,1] (0 maps to d_max, 1 maps to d_min)\n            Vmath::Sadd(nq, -f_min, vTemp, 1, vTemp, 1);\n            Vmath::Smul(nq, -1.0\/(f_max-f_min), vTemp, 1, vTemp, 1);\n            Vmath::Sadd(nq, 1.0, vTemp, 1, vTemp, 1);\n\n            \/\/ Scale anisotropic conductivity values\n            for (int i = 0; i < m_spacedim; ++i)\n            {\n                Vmath::Vmul(nq, vTemp, 1,\n                                m_vardiff[varCoeffEnum[i]], 1,\n                                m_vardiff[varCoeffEnum[i]], 1);\n            }\n        }\n\n\n        \/\/ Write out conductivity values\n        for (int i = 0; i < m_spacedim; ++i)\n        {\n            \/\/ Transform variable coefficient and write out to file.\n            m_fields[0]->FwdTrans_IterPerExp(m_vardiff[varCoeffEnum[i]],\n                                             m_fields[0]->UpdateCoeffs());\n            std::stringstream filename;\n            filename << \"Conductivity_\" << aniso_var[i];\n            if (m_comm->GetSize() > 1)\n            {\n                filename << \"_P\" << m_comm->GetRank();\n            }\n            filename << \".fld\";\n            WriteFld(filename.str());\n        }\n\n        \/\/ Search through the loaded filters and pass the cell model to any\n        \/\/ CheckpointCellModel filters loaded.\n        int k = 0;\n        const LibUtilities::FilterMap& f = m_session->GetFilters();\n        LibUtilities::FilterMap::const_iterator x;\n        for (x = f.begin(); x != f.end(); ++x, ++k)\n        {\n            if (x->first == \"CheckpointCellModel\")\n            {\n                boost::shared_ptr<FilterCheckpointCellModel> c\n                    = boost::dynamic_pointer_cast<FilterCheckpointCellModel>(\n                                                                m_filters[k]);\n                c->SetCellModel(m_cell);\n            }\n        }\n\n        \/\/ Load stimuli\n        m_stimulus = Stimulus::LoadStimuli(m_session, m_fields[0]);\n\n        if (!m_explicitDiffusion)\n        {\n            m_ode.DefineImplicitSolve (&Monodomain::DoImplicitSolve, this);\n        }\n        m_ode.DefineOdeRhs(&Monodomain::DoOdeRhs, this);\n    }\n\n\n    \/**\n     *\n     *\/\n    Monodomain::~Monodomain()\n    {\n\n    }\n\n\n    \/**\n     * @param   inarray         Input array.\n     * @param   outarray        Output array.\n     * @param   time            Current simulation time.\n     * @param   lambda          Timestep.\n     *\/\n    void Monodomain::DoImplicitSolve(\n            const Array<OneD, const Array<OneD, NekDouble> >&inarray,\n                  Array<OneD, Array<OneD, NekDouble> >&outarray,\n            const NekDouble time,\n            const NekDouble lambda)\n    {\n        int nvariables  = inarray.num_elements();\n        int nq          = m_fields[0]->GetNpoints();\n        StdRegions::ConstFactorMap factors;\n        \/\/ lambda = \\Delta t\n        factors[StdRegions::eFactorLambda] = 1.0\/lambda*m_chi*m_capMembrane;\n\n        \/\/ We solve ( \\nabla^2 - HHlambda ) Y[i] = rhs [i]\n        \/\/ inarray = input: \\hat{rhs} -> output: \\hat{Y}\n        \/\/ outarray = output: nabla^2 \\hat{Y}\n        \/\/ where \\hat = modal coeffs\n        for (int i = 0; i < nvariables; ++i)\n        {\n            \/\/ Multiply 1.0\/timestep\n            Vmath::Smul(nq, -factors[StdRegions::eFactorLambda], inarray[i], 1,\n                                            m_fields[i]->UpdatePhys(), 1);\n\n            \/\/ Solve a system of equations with Helmholtz solver and transform\n            \/\/ back into physical space.\n            m_fields[i]->HelmSolve(m_fields[i]->GetPhys(),\n                                   m_fields[i]->UpdateCoeffs(), NullFlagList,\n                                   factors, m_vardiff);\n\n            m_fields[i]->BwdTrans( m_fields[i]->GetCoeffs(),\n                                   m_fields[i]->UpdatePhys());\n            m_fields[i]->SetPhysState(true);\n\n            \/\/ Copy the solution vector (required as m_fields must be set).\n            outarray[i] = m_fields[i]->GetPhys();\n        }\n    }\n\n\n    \/**\n     *\n     *\/\n    void Monodomain::DoOdeRhs(\n            const Array<OneD, const  Array<OneD, NekDouble> >&inarray,\n                  Array<OneD,        Array<OneD, NekDouble> >&outarray,\n            const NekDouble time)\n    {\n        \/\/ Compute I_ion\n        m_cell->TimeIntegrate(inarray, outarray, time);\n\n        \/\/ Compute I_stim\n        for (unsigned int i = 0; i < m_stimulus.size(); ++i)\n        {   \n            m_stimulus[i]->Update(outarray, time);\n        }\n    }\n\n\n    \/**\n     *\n     *\/\n    void Monodomain::v_SetInitialConditions(NekDouble initialtime,\n                        bool dumpInitialConditions)\n    {\n        EquationSystem::v_SetInitialConditions(initialtime,\n                                               dumpInitialConditions);\n        m_cell->Initialise();\n    }\n\n\n    \/**\n     *\n     *\/\n    void Monodomain::v_PrintSummary(std::ostream &out)\n    {\n        UnsteadySystem::v_PrintSummary(out);\n        if (m_session->DefinesFunction(\"d00\") &&\n            m_session->GetFunctionType(\"d00\", \"intensity\") \n                    == LibUtilities::eFunctionTypeExpression)\n        {\n            out << \"\\tDiffusivity-x   : \"\n                << m_session->GetFunction(\"d00\", \"intensity\")->GetExpression()\n                << endl;\n        }\n        if (m_session->DefinesFunction(\"d11\") &&\n            m_session->GetFunctionType(\"d11\", \"intensity\") \n                    == LibUtilities::eFunctionTypeExpression)\n        {\n            out << \"\\tDiffusivity-x   : \"\n                << m_session->GetFunction(\"d11\", \"intensity\")->GetExpression()\n                << endl;\n        }\n        if (m_session->DefinesFunction(\"d22\") &&\n            m_session->GetFunctionType(\"d22\", \"intensity\") \n                    == LibUtilities::eFunctionTypeExpression)\n        {\n            out << \"\\tDiffusivity-x   : \"\n                << m_session->GetFunction(\"d22\", \"intensity\")->GetExpression()\n                << endl;\n        }\n        m_cell->PrintSummary(out);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <vigra\/multi_distance.hxx>\n#include <vigra\/impex.hxx>\n\n#include <util\/Logger.h>\n#include \"DistanceToleranceFunction.h\"\n\nlogger::LogChannel distancetolerancelog(\"distancetolerancelog\", \"[DistanceToleranceFunction] \");\n\nDistanceToleranceFunction::DistanceToleranceFunction(\n\t\tfloat distanceThreshold,\n\t\tbool haveBackgroundLabel,\n\t\tfloat backgroundLabel) :\n\t_maxDistanceThreshold(distanceThreshold),\n\t_haveBackgroundLabel(haveBackgroundLabel),\n\t_backgroundLabel(backgroundLabel) {\n\n\t_resolutionX = 4.0;\n\t_resolutionY = 4.0;\n\t_resolutionZ = 40.0;\n}\n\nvoid\nDistanceToleranceFunction::extractCells(\n\t\tunsigned int numCells,\n\t\tconst vigra::MultiArray<3, unsigned int>& cellLabels,\n\t\tconst ImageStack& recLabels,\n\t\tconst ImageStack& gtLabels) {\n\n\t_depth  = gtLabels.size();\n\t_width  = gtLabels.width();\n\t_height = gtLabels.height();\n\n\tcreateBoundaryMap(recLabels);\n\tcreateBoundaryDistanceMap();\n\n\t\/\/ create a cell for each found connected component in cellLabels\n\t_cells->resize(numCells);\n\n\t\/\/ the maximum boundary distance of any location for each cell\n\tstd::vector<float> maxBoundaryDistances(numCells, 0);\n\n\tstd::set<unsigned int> foundCells;\n\tfor (unsigned int z = 0; z < _depth; z++) {\n\n\t\tboost::shared_ptr<const Image> gt  = gtLabels[z];\n\t\tboost::shared_ptr<const Image> rec = recLabels[z];\n\n\t\tfor (unsigned int x = 0; x < _width; x++)\n\t\t\tfor (unsigned int y = 0; y < _height; y++) {\n\n\t\t\t\tfloat gtLabel  = (*gt)(x, y);\n\t\t\t\tfloat recLabel = (*rec)(x, y);\n\n\t\t\t\t\/\/ argh, vigra starts counting at 1!\n\t\t\t\tunsigned int cellIndex = cellLabels(x, y, z) - 1;\n\n\t\t\t\t(*_cells)[cellIndex].add(cell_t::Location(x, y, z));\n\t\t\t\t(*_cells)[cellIndex].setReconstructionLabel(recLabel);\n\t\t\t\t(*_cells)[cellIndex].setGroundTruthLabel(gtLabel);\n\n\t\t\t\tmaxBoundaryDistances[cellIndex] = std::max(maxBoundaryDistances[cellIndex], _boundaryDistance2(x, y, z));\n\n\t\t\t\tif (foundCells.count(cellIndex) == 0) {\n\n\t\t\t\t\tregisterPossibleMatch(gtLabel, recLabel);\n\t\t\t\t\tfoundCells.insert(cellIndex);\n\t\t\t\t}\n\t\t\t}\n\t}\n\n\tfor (unsigned int cellIndex = 0; cellIndex < numCells; cellIndex++)\n\t\tif (maxBoundaryDistances[cellIndex] < _maxDistanceThreshold*_maxDistanceThreshold)\n\t\t\t_relabelCandidates.push_back(cellIndex);\n\n\tenumerateCellLabels(recLabels);\n}\n\nvoid\nDistanceToleranceFunction::createBoundaryMap(const ImageStack& recLabels) {\n\n\tvigra::Shape3 shape(_width, _height, _depth);\n\t_boundaryMap.reshape(shape);\n\n\t\/\/ create boundary map\n\tLOG_DEBUG(distancetolerancelog) << \"creating boundary map of size \" << shape << std::endl;\n\t_boundaryMap = 0.0f;\n\tfor (unsigned int x = 0; x < _width; x++)\n\t\tfor (unsigned int y = 0; y < _height; y++)\n\t\t\tfor (unsigned int z = 0; z < _depth; z++)\n\t\t\t\tif (isBoundaryVoxel(x, y, z, recLabels))\n\t\t\t\t\t_boundaryMap(x, y, z) = 1.0f;\n}\n\nvoid\nDistanceToleranceFunction::createBoundaryDistanceMap() {\n\n\tvigra::Shape3 shape(_width, _height, _depth);\n\t_boundaryDistance2.reshape(shape);\n\n\tfloat pitch[3];\n\tpitch[0] = _resolutionX;\n\tpitch[1] = _resolutionY;\n\tpitch[2] = _resolutionZ;\n\n\t\/\/ compute l2 distance for each pixel to boundary\n\tLOG_DEBUG(distancetolerancelog) << \"computing boundary distances\" << std::endl;\n\tvigra::separableMultiDistSquared(\n\t\t\t_boundaryMap,\n\t\t\t_boundaryDistance2,\n\t\t\ttrue \/* background *\/,\n\t\t\tpitch);\n}\n\nvoid\nDistanceToleranceFunction::enumerateCellLabels(const ImageStack& recLabels) {\n\n\t_maxDistanceThresholdX = std::min((float)_width,  _maxDistanceThreshold\/_resolutionX);\n\t_maxDistanceThresholdY = std::min((float)_height, _maxDistanceThreshold\/_resolutionY);\n\t_maxDistanceThresholdZ = std::min((float)_depth,  _maxDistanceThreshold\/_resolutionZ);\n\n\tLOG_DEBUG(distancetolerancelog) << \"there are \" << _relabelCandidates.size() << \" cells that can be relabeled\" << std::endl;\n\n\tif (_relabelCandidates.size() == 0)\n\t\treturn;\n\n\tLOG_DEBUG(distancetolerancelog) << \"creating distance threshold neighborhood\" << std::endl;\n\n\t\/\/ list of all location offsets within threshold distance\n\tstd::vector<cell_t::Location> neighborhood = createNeighborhood();\n\n\tLOG_DEBUG(distancetolerancelog) << \"there are \" << neighborhood.size() << \" pixels in the neighborhood for a threshold of \" << _maxDistanceThreshold << std::endl;\n\n\t\/\/ for each cell\n\tforeach (unsigned int index, _relabelCandidates) {\n\n\t\tcell_t& cell = (*_cells)[index];\n\n\t\tLOG_ALL(distancetolerancelog) << \"processing cell \" << index << \" (label \" << cell.getReconstructionLabel() << \")\" << std::flush;\n\n\t\tstd::set<float> alternativeLabels = getAlternativeLabels(cell, neighborhood, recLabels);\n\n\t\t\/\/ every cell that is small enough to be relabelled is allowed to change\n\t\t\/\/ to background label\n\t\tif (_haveBackgroundLabel)\n\t\t\talternativeLabels.insert(_backgroundLabel);\n\n\t\tLOG_ALL(distancetolerancelog) << \"; can map to \";\n\n\t\t\/\/ for each alternative label\n\t\tforeach (float recLabel, alternativeLabels) {\n\n\t\t\tLOG_ALL(distancetolerancelog) << recLabel << \" \";\n\n\t\t\t\/\/ register possible match\n\t\t\tcell.addAlternativeLabel(recLabel);\n\t\t\tregisterPossibleMatch(cell.getGroundTruthLabel(), recLabel);\n\t\t}\n\t\tLOG_ALL(distancetolerancelog) << std::endl;\n\n\t\t\/\/ DEBUG\n\t\tindex++;\n\t}\n}\n\nbool\nDistanceToleranceFunction::isBoundaryVoxel(int x, int y, int z, const ImageStack& stack) {\n\n\tfloat center = (*stack[z])(x, y);\n\n\tfor (int dz = -1; dz <= 1; dz++)\n\t\tfor (int dy = -1; dy <= 1; dy++)\n\t\t\tfor (int dx = -1; dx <= 1; dx++)\n\t\t\t\tif (\n\t\t\t\t\t\t!(dx == 0 && dy == 0 && dz == 0) &&\n\t\t\t\t\t\t(x + dx) >= 0 && (x + dx) < (int)_width  &&\n\t\t\t\t\t\t(y + dy) >= 0 && (y + dy) < (int)_height &&\n\t\t\t\t\t\t(z + dz) >= 0 && (z + dz) < (int)_depth)\n\n\t\t\t\t\tif ((*stack[z + dz])(x + dx, y + dy) != center)\n\t\t\t\t\t\treturn true;\n\n\treturn false;\n}\n\nstd::vector<DistanceToleranceFunction::cell_t::Location>\nDistanceToleranceFunction::createNeighborhood() {\n\n\tstd::vector<cell_t::Location> thresholdOffsets;\n\n\t\/\/ quick check first: test on all three axes -- if they contain all covering\n\t\/\/ labels already, we can abort iterating earlier in getAlternativeLabels()\n\n\tfor (int z = 1; z <= _maxDistanceThresholdZ; z++) {\n\n\t\tthresholdOffsets.push_back(cell_t::Location(0, 0,  z));\n\t\tthresholdOffsets.push_back(cell_t::Location(0, 0, -z));\n\t}\n\tfor (int y = 1; y <= _maxDistanceThresholdY; y++) {\n\n\t\tthresholdOffsets.push_back(cell_t::Location(0,  y, 0));\n\t\tthresholdOffsets.push_back(cell_t::Location(0, -y, 0));\n\t}\n\tfor (int x = 1; x <= _maxDistanceThresholdX; x++) {\n\n\t\tthresholdOffsets.push_back(cell_t::Location( x, 0, 0));\n\t\tthresholdOffsets.push_back(cell_t::Location(-x, 0, 0));\n\t}\n\n\tfor (int z = -_maxDistanceThresholdZ; z <= _maxDistanceThresholdZ; z++)\n\t\tfor (int y = -_maxDistanceThresholdY; y <= _maxDistanceThresholdY; y++)\n\t\t\tfor (int x = -_maxDistanceThresholdX; x <= _maxDistanceThresholdX; x++) {\n\n\t\t\t\t\/\/ axis locations have been added already, center is not needed\n\t\t\t\tif ((x == 0 && y == 0) || (x == 0 && z == 0) || (y == 0 && z == 0))\n\t\t\t\t\tcontinue;\n\n\t\t\t\t\/\/ is it within threshold distance?\n\t\t\t\tif (\n\t\t\t\t\t\tx*_resolutionX*x*_resolutionX +\n\t\t\t\t\t\ty*_resolutionY*y*_resolutionY +\n\t\t\t\t\t\tz*_resolutionZ*z*_resolutionZ <= _maxDistanceThreshold*_maxDistanceThreshold)\n\n\t\t\t\t\tthresholdOffsets.push_back(cell_t::Location(x, y, z));\n\t\t\t}\n\n\treturn thresholdOffsets;\n}\n\nstd::set<float>\nDistanceToleranceFunction::getAlternativeLabels(\n\t\tconst cell_t& cell,\n\t\tconst std::vector<cell_t::Location>& neighborhood,\n\t\tconst ImageStack& recLabels) {\n\n\tfloat cellLabel = cell.getReconstructionLabel();\n\n\t\/\/ counts for each neighbor label, how often it was found while iterating \n\t\/\/ over the cells locations\n\tstd::map<float, unsigned int> counts;\n\n\t\/\/ the number of cell locations visited so far\n\tunsigned int numVisited = 0;\n\n\t\/\/ the maximal number of alternative labels, starts with number of labels \n\t\/\/ found at first location and decreases whenever one label was not found\n\tunsigned int maxAlternativeLabels = 0;\n\n\t\/\/ for each location i in that cell\n\tforeach (const cell_t::Location& i, cell) {\n\n\t\t\/\/ all the labels in the neighborhood of i\n\t\tstd::set<float> neighborhoodLabels;\n\n\t\tnumVisited++;\n\n\t\t\/\/ the number of complete neighbor labels that have been seen at the \n\t\t\/\/ current location\n\t\tunsigned int numComplete = 0;\n\n\t\t\/\/ for all locations within the neighborhood, get alternative labels\n\t\tforeach (const cell_t::Location& n, neighborhood) {\n\n\t\t\tcell_t::Location j(i.x + n.x, i.y + n.y, i.z + n.z);\n\n\t\t\t\/\/ are we leaving the image?\n\t\t\tif (j.x < 0 || j.x >= (int)_width || j.y < 0 || j.y >= (int)_height || j.z < 0 || j.z >= (int)_depth)\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ is this a boundary?\n\t\t\tif (!_boundaryMap(j.x, j.y, j.z))\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ now we have found a boundary pixel within our neighborhood\n\t\t\tfloat label = (*(recLabels)[j.z])(j.x, j.y);\n\n\t\t\t\/\/ count how often we see a neighbor label the first time\n\t\t\tif (label != cellLabel) {\n\n\t\t\t\tbool firstTime = neighborhoodLabels.insert(label).second;\n\n\t\t\t\t\/\/ seen the first time for the current location i\n\t\t\t\tif (firstTime)\n\t\t\t\t\t\/\/ is a potential alternative label (covers all visited \n\t\t\t\t\t\/\/ locations so far)\n\t\t\t\t\tif (++counts[label] == numVisited) {\n\n\t\t\t\t\t\tnumComplete++;\n\n\t\t\t\t\t\t\/\/ if we have seen all the possible complete labels \n\t\t\t\t\t\t\/\/ already, there is no need to search further for the \n\t\t\t\t\t\t\/\/ current location i\n\t\t\t\t\t\tif (numComplete == maxAlternativeLabels)\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ the number of labels that we have seen for each location visited so \n\t\t\/\/ far is the maximal possible number of alternative labels\n\t\tmaxAlternativeLabels = numComplete;\n\n\t\t\/\/ none of the neighbor labels covers the cell\n\t\tif (maxAlternativeLabels == 0)\n\t\t\tbreak;\n\t}\n\n\tstd::set<float> alternativeLabels;\n\n\t\/\/ collect all neighbor labels that we have seen for every location of the \n\t\/\/ cell\n\tfloat label;\n\tunsigned int count;\n\tforeach (boost::tie(label, count), counts)\n\t\tif (count == cell.size())\n\t\t\talternativeLabels.insert(label);\n\n\tif (alternativeLabels.size() != maxAlternativeLabels)\n\t\tLOG_ERROR(distancetolerancelog) << \"MAX ALTERNATIVE LABELS DOES NOT MATCH NUMBER OF LABELS FOUND!\" << std::endl;\n\n\treturn alternativeLabels;\n}\n<commit_msg>changed tolerance criterion to <= (was <) in DistanceToleranceFunction<commit_after>#include <vigra\/multi_distance.hxx>\n#include <vigra\/impex.hxx>\n\n#include <util\/Logger.h>\n#include \"DistanceToleranceFunction.h\"\n\nlogger::LogChannel distancetolerancelog(\"distancetolerancelog\", \"[DistanceToleranceFunction] \");\n\nDistanceToleranceFunction::DistanceToleranceFunction(\n\t\tfloat distanceThreshold,\n\t\tbool haveBackgroundLabel,\n\t\tfloat backgroundLabel) :\n\t_maxDistanceThreshold(distanceThreshold),\n\t_haveBackgroundLabel(haveBackgroundLabel),\n\t_backgroundLabel(backgroundLabel) {\n\n\t_resolutionX = 4.0;\n\t_resolutionY = 4.0;\n\t_resolutionZ = 40.0;\n}\n\nvoid\nDistanceToleranceFunction::extractCells(\n\t\tunsigned int numCells,\n\t\tconst vigra::MultiArray<3, unsigned int>& cellLabels,\n\t\tconst ImageStack& recLabels,\n\t\tconst ImageStack& gtLabels) {\n\n\t_depth  = gtLabels.size();\n\t_width  = gtLabels.width();\n\t_height = gtLabels.height();\n\n\tcreateBoundaryMap(recLabels);\n\tcreateBoundaryDistanceMap();\n\n\t\/\/ create a cell for each found connected component in cellLabels\n\t_cells->resize(numCells);\n\n\t\/\/ the maximum boundary distance of any location for each cell\n\tstd::vector<float> maxBoundaryDistances(numCells, 0);\n\n\tstd::set<unsigned int> foundCells;\n\tfor (unsigned int z = 0; z < _depth; z++) {\n\n\t\tboost::shared_ptr<const Image> gt  = gtLabels[z];\n\t\tboost::shared_ptr<const Image> rec = recLabels[z];\n\n\t\tfor (unsigned int x = 0; x < _width; x++)\n\t\t\tfor (unsigned int y = 0; y < _height; y++) {\n\n\t\t\t\tfloat gtLabel  = (*gt)(x, y);\n\t\t\t\tfloat recLabel = (*rec)(x, y);\n\n\t\t\t\t\/\/ argh, vigra starts counting at 1!\n\t\t\t\tunsigned int cellIndex = cellLabels(x, y, z) - 1;\n\n\t\t\t\t(*_cells)[cellIndex].add(cell_t::Location(x, y, z));\n\t\t\t\t(*_cells)[cellIndex].setReconstructionLabel(recLabel);\n\t\t\t\t(*_cells)[cellIndex].setGroundTruthLabel(gtLabel);\n\n\t\t\t\tmaxBoundaryDistances[cellIndex] = std::max(maxBoundaryDistances[cellIndex], _boundaryDistance2(x, y, z));\n\n\t\t\t\tif (foundCells.count(cellIndex) == 0) {\n\n\t\t\t\t\tregisterPossibleMatch(gtLabel, recLabel);\n\t\t\t\t\tfoundCells.insert(cellIndex);\n\t\t\t\t}\n\t\t\t}\n\t}\n\n\tfor (unsigned int cellIndex = 0; cellIndex < numCells; cellIndex++)\n\t\tif (maxBoundaryDistances[cellIndex] <= _maxDistanceThreshold*_maxDistanceThreshold)\n\t\t\t_relabelCandidates.push_back(cellIndex);\n\n\tenumerateCellLabels(recLabels);\n}\n\nvoid\nDistanceToleranceFunction::createBoundaryMap(const ImageStack& recLabels) {\n\n\tvigra::Shape3 shape(_width, _height, _depth);\n\t_boundaryMap.reshape(shape);\n\n\t\/\/ create boundary map\n\tLOG_DEBUG(distancetolerancelog) << \"creating boundary map of size \" << shape << std::endl;\n\t_boundaryMap = 0.0f;\n\tfor (unsigned int x = 0; x < _width; x++)\n\t\tfor (unsigned int y = 0; y < _height; y++)\n\t\t\tfor (unsigned int z = 0; z < _depth; z++)\n\t\t\t\tif (isBoundaryVoxel(x, y, z, recLabels))\n\t\t\t\t\t_boundaryMap(x, y, z) = 1.0f;\n}\n\nvoid\nDistanceToleranceFunction::createBoundaryDistanceMap() {\n\n\tvigra::Shape3 shape(_width, _height, _depth);\n\t_boundaryDistance2.reshape(shape);\n\n\tfloat pitch[3];\n\tpitch[0] = _resolutionX;\n\tpitch[1] = _resolutionY;\n\tpitch[2] = _resolutionZ;\n\n\t\/\/ compute l2 distance for each pixel to boundary\n\tLOG_DEBUG(distancetolerancelog) << \"computing boundary distances\" << std::endl;\n\tvigra::separableMultiDistSquared(\n\t\t\t_boundaryMap,\n\t\t\t_boundaryDistance2,\n\t\t\ttrue \/* background *\/,\n\t\t\tpitch);\n}\n\nvoid\nDistanceToleranceFunction::enumerateCellLabels(const ImageStack& recLabels) {\n\n\t_maxDistanceThresholdX = std::min((float)_width,  _maxDistanceThreshold\/_resolutionX);\n\t_maxDistanceThresholdY = std::min((float)_height, _maxDistanceThreshold\/_resolutionY);\n\t_maxDistanceThresholdZ = std::min((float)_depth,  _maxDistanceThreshold\/_resolutionZ);\n\n\tLOG_DEBUG(distancetolerancelog) << \"there are \" << _relabelCandidates.size() << \" cells that can be relabeled\" << std::endl;\n\n\tif (_relabelCandidates.size() == 0)\n\t\treturn;\n\n\tLOG_DEBUG(distancetolerancelog) << \"creating distance threshold neighborhood\" << std::endl;\n\n\t\/\/ list of all location offsets within threshold distance\n\tstd::vector<cell_t::Location> neighborhood = createNeighborhood();\n\n\tLOG_DEBUG(distancetolerancelog) << \"there are \" << neighborhood.size() << \" pixels in the neighborhood for a threshold of \" << _maxDistanceThreshold << std::endl;\n\n\t\/\/ for each cell\n\tforeach (unsigned int index, _relabelCandidates) {\n\n\t\tcell_t& cell = (*_cells)[index];\n\n\t\tLOG_ALL(distancetolerancelog) << \"processing cell \" << index << \" (label \" << cell.getReconstructionLabel() << \")\" << std::flush;\n\n\t\tstd::set<float> alternativeLabels = getAlternativeLabels(cell, neighborhood, recLabels);\n\n\t\t\/\/ every cell that is small enough to be relabelled is allowed to change\n\t\t\/\/ to background label\n\t\tif (_haveBackgroundLabel)\n\t\t\talternativeLabels.insert(_backgroundLabel);\n\n\t\tLOG_ALL(distancetolerancelog) << \"; can map to \";\n\n\t\t\/\/ for each alternative label\n\t\tforeach (float recLabel, alternativeLabels) {\n\n\t\t\tLOG_ALL(distancetolerancelog) << recLabel << \" \";\n\n\t\t\t\/\/ register possible match\n\t\t\tcell.addAlternativeLabel(recLabel);\n\t\t\tregisterPossibleMatch(cell.getGroundTruthLabel(), recLabel);\n\t\t}\n\t\tLOG_ALL(distancetolerancelog) << std::endl;\n\n\t\t\/\/ DEBUG\n\t\tindex++;\n\t}\n}\n\nbool\nDistanceToleranceFunction::isBoundaryVoxel(int x, int y, int z, const ImageStack& stack) {\n\n\tfloat center = (*stack[z])(x, y);\n\n\tfor (int dz = -1; dz <= 1; dz++)\n\t\tfor (int dy = -1; dy <= 1; dy++)\n\t\t\tfor (int dx = -1; dx <= 1; dx++)\n\t\t\t\tif (\n\t\t\t\t\t\t!(dx == 0 && dy == 0 && dz == 0) &&\n\t\t\t\t\t\t(x + dx) >= 0 && (x + dx) < (int)_width  &&\n\t\t\t\t\t\t(y + dy) >= 0 && (y + dy) < (int)_height &&\n\t\t\t\t\t\t(z + dz) >= 0 && (z + dz) < (int)_depth)\n\n\t\t\t\t\tif ((*stack[z + dz])(x + dx, y + dy) != center)\n\t\t\t\t\t\treturn true;\n\n\treturn false;\n}\n\nstd::vector<DistanceToleranceFunction::cell_t::Location>\nDistanceToleranceFunction::createNeighborhood() {\n\n\tstd::vector<cell_t::Location> thresholdOffsets;\n\n\t\/\/ quick check first: test on all three axes -- if they contain all covering\n\t\/\/ labels already, we can abort iterating earlier in getAlternativeLabels()\n\n\tfor (int z = 1; z <= _maxDistanceThresholdZ; z++) {\n\n\t\tthresholdOffsets.push_back(cell_t::Location(0, 0,  z));\n\t\tthresholdOffsets.push_back(cell_t::Location(0, 0, -z));\n\t}\n\tfor (int y = 1; y <= _maxDistanceThresholdY; y++) {\n\n\t\tthresholdOffsets.push_back(cell_t::Location(0,  y, 0));\n\t\tthresholdOffsets.push_back(cell_t::Location(0, -y, 0));\n\t}\n\tfor (int x = 1; x <= _maxDistanceThresholdX; x++) {\n\n\t\tthresholdOffsets.push_back(cell_t::Location( x, 0, 0));\n\t\tthresholdOffsets.push_back(cell_t::Location(-x, 0, 0));\n\t}\n\n\tfor (int z = -_maxDistanceThresholdZ; z <= _maxDistanceThresholdZ; z++)\n\t\tfor (int y = -_maxDistanceThresholdY; y <= _maxDistanceThresholdY; y++)\n\t\t\tfor (int x = -_maxDistanceThresholdX; x <= _maxDistanceThresholdX; x++) {\n\n\t\t\t\t\/\/ axis locations have been added already, center is not needed\n\t\t\t\tif ((x == 0 && y == 0) || (x == 0 && z == 0) || (y == 0 && z == 0))\n\t\t\t\t\tcontinue;\n\n\t\t\t\t\/\/ is it within threshold distance?\n\t\t\t\tif (\n\t\t\t\t\t\tx*_resolutionX*x*_resolutionX +\n\t\t\t\t\t\ty*_resolutionY*y*_resolutionY +\n\t\t\t\t\t\tz*_resolutionZ*z*_resolutionZ <= _maxDistanceThreshold*_maxDistanceThreshold)\n\n\t\t\t\t\tthresholdOffsets.push_back(cell_t::Location(x, y, z));\n\t\t\t}\n\n\treturn thresholdOffsets;\n}\n\nstd::set<float>\nDistanceToleranceFunction::getAlternativeLabels(\n\t\tconst cell_t& cell,\n\t\tconst std::vector<cell_t::Location>& neighborhood,\n\t\tconst ImageStack& recLabels) {\n\n\tfloat cellLabel = cell.getReconstructionLabel();\n\n\t\/\/ counts for each neighbor label, how often it was found while iterating \n\t\/\/ over the cells locations\n\tstd::map<float, unsigned int> counts;\n\n\t\/\/ the number of cell locations visited so far\n\tunsigned int numVisited = 0;\n\n\t\/\/ the maximal number of alternative labels, starts with number of labels \n\t\/\/ found at first location and decreases whenever one label was not found\n\tunsigned int maxAlternativeLabels = 0;\n\n\t\/\/ for each location i in that cell\n\tforeach (const cell_t::Location& i, cell) {\n\n\t\t\/\/ all the labels in the neighborhood of i\n\t\tstd::set<float> neighborhoodLabels;\n\n\t\tnumVisited++;\n\n\t\t\/\/ the number of complete neighbor labels that have been seen at the \n\t\t\/\/ current location\n\t\tunsigned int numComplete = 0;\n\n\t\t\/\/ for all locations within the neighborhood, get alternative labels\n\t\tforeach (const cell_t::Location& n, neighborhood) {\n\n\t\t\tcell_t::Location j(i.x + n.x, i.y + n.y, i.z + n.z);\n\n\t\t\t\/\/ are we leaving the image?\n\t\t\tif (j.x < 0 || j.x >= (int)_width || j.y < 0 || j.y >= (int)_height || j.z < 0 || j.z >= (int)_depth)\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ is this a boundary?\n\t\t\tif (!_boundaryMap(j.x, j.y, j.z))\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ now we have found a boundary pixel within our neighborhood\n\t\t\tfloat label = (*(recLabels)[j.z])(j.x, j.y);\n\n\t\t\t\/\/ count how often we see a neighbor label the first time\n\t\t\tif (label != cellLabel) {\n\n\t\t\t\tbool firstTime = neighborhoodLabels.insert(label).second;\n\n\t\t\t\t\/\/ seen the first time for the current location i\n\t\t\t\tif (firstTime)\n\t\t\t\t\t\/\/ is a potential alternative label (covers all visited \n\t\t\t\t\t\/\/ locations so far)\n\t\t\t\t\tif (++counts[label] == numVisited) {\n\n\t\t\t\t\t\tnumComplete++;\n\n\t\t\t\t\t\t\/\/ if we have seen all the possible complete labels \n\t\t\t\t\t\t\/\/ already, there is no need to search further for the \n\t\t\t\t\t\t\/\/ current location i\n\t\t\t\t\t\tif (numComplete == maxAlternativeLabels)\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ the number of labels that we have seen for each location visited so \n\t\t\/\/ far is the maximal possible number of alternative labels\n\t\tmaxAlternativeLabels = numComplete;\n\n\t\t\/\/ none of the neighbor labels covers the cell\n\t\tif (maxAlternativeLabels == 0)\n\t\t\tbreak;\n\t}\n\n\tstd::set<float> alternativeLabels;\n\n\t\/\/ collect all neighbor labels that we have seen for every location of the \n\t\/\/ cell\n\tfloat label;\n\tunsigned int count;\n\tforeach (boost::tie(label, count), counts)\n\t\tif (count == cell.size())\n\t\t\talternativeLabels.insert(label);\n\n\tif (alternativeLabels.size() != maxAlternativeLabels)\n\t\tLOG_ERROR(distancetolerancelog) << \"MAX ALTERNATIVE LABELS DOES NOT MATCH NUMBER OF LABELS FOUND!\" << std::endl;\n\n\treturn alternativeLabels;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"server.hpp\"\n\nusing std::string;\n\nGame::Game(unsigned int _bunch_num, unsigned int _bunch_den, unsigned int _player_limit)\n\t: player_limit(_player_limit)\n{\n\tfor (char ch = 'A'; ch <= 'Z'; ++ch)\n\t\tfor (unsigned int i = 0; i < ((letter_count[ch - 'A'] * _bunch_num) \/ _bunch_den); ++i)\n\t\t\trandom_insert(bunch, ch);\n\n\tauto it = bunch.begin();\n\tfor (int i = 0; i < 20; ++i, ++it);\n\tbunch.erase(it, bunch.end());\n}\n\nPlayer& Game::add_player(const string& id, const sf::IpAddress& ip, unsigned short port, const string& name)\n{\n\tplayers[id] = Player(ip, port, name);\n\treturn players[id];\n}\n\nvoid Game::remove_player(const string& id)\n{\n\tfor (auto chr : players.at(id).get_hand())\n\t\trandom_insert(bunch, chr);\n\n\tplayers.erase(id);\n\n\tif (playing)\n\t{\n\t\tif (players.size() < 2)\n\t\t{\n\t\t\tready_to_finish = true;\n\t\t\tfinished = true;\n\n\t\t\t\/\/ win by default\n\t\t\tif (players.size() > 0)\n\t\t\t\twinner = players.begin()->first;\n\t\t}\n\t}\n\telse\n\t\ttry_to_start();\n}\n\nvoid Game::set_ready(const string& id, bool ready)\n{\n\tif (!playing)\n\t{\n\t\tplayers.at(id).ready = ready;\n\n\t\tif (ready)\n\t\t\ttry_to_start();\n\t}\n}\n\n\/\/ XXX assumes dump is valid!\nstring Game::dump(const string& id, const sf::Int16& dump_n, char chr)\n{\n\tif (dump_n == players.at(id).get_dump() - 1)\n\t\treturn players.at(id).last_dump();\n\telse if (dump_n == players.at(id).get_dump())\n\t{\n\t\tstring letters;\n\n\t\tif (bunch.size() >= 3)\n\t\t{\n\t\t\t\/\/ take three\n\t\t\tfor (unsigned int i = 0; i < 3; ++i)\n\t\t\t{\n\t\t\t\tletters.append(1, bunch.back());\n\t\t\t\tbunch.pop_back();\n\t\t\t}\n\t\t\tplayers.at(id).give_dump(chr, letters);\n\n\t\t\trandom_insert(bunch, chr);\n\t\t}\n\t\telse\n\t\t\tletters.append(1, chr);\n\n\t\treturn letters;\n\t}\n\n\t\/\/ XXX should never get here!!!\n\treturn \"\";\n}\n\n\/\/ XXX assumes peeling is valid. returns true if game has ended\nbool Game::peel()\n{\n\t\/\/ if there aren't enough letters left\n\tif (bunch.size() < players.size())\n\t{\n\t\tready_to_finish = true;\n\t\tfinished = true;\n\t\treturn true;\n\t}\n\n\tunsigned int num_letters = 1;\n\tready_to_peel = false;\n\n\t\/\/ if this is the first peel\n\tif (peel_number++ == 0)\n\t{\n\t\tplaying = true;\n\t\tnum_letters = 10; \/\/ TODO calculate\n\n\t\t\/\/ reset ack counters to track peels\n\t\tfor (auto& pair : players)\n\t\t\tpair.second.reset_ack();\n\t}\n\n\tfor (auto& pair : players)\n\t{\n\t\tstring letters;\n\t\tfor (unsigned int i = 0; i < num_letters; ++i)\n\t\t{\n\t\t\tletters.append(1, bunch.back());\n\t\t\tbunch.pop_back();\n\t\t}\n\n\t\tpair.second.give_peel(letters);\n\t}\n\n\treturn false;\n}\n\nvoid Game::try_to_start()\n{\n\t\/\/ if already started\n\tif (playing)\n\t\treturn;\n\n\t\/\/ if not enough players\n\tif (players.size() < 2)\n\t\treturn;\n\n\t\/\/ if players aren't ready\n\tfor (const auto& pair : players)\n\t\tif (!pair.second.ready)\n\t\t\treturn;\n\n\tready_to_peel = true;\n}\n\nvoid Game::check_waiting()\n{\n\tfor (const auto& pair : players)\n\t\tif (pair.second.has_pending())\n\t\t\treturn;\n\n\twaiting = false;\n}\n<commit_msg>Fix out of range error when all players leave<commit_after>#include \"server.hpp\"\n\nusing std::string;\n\nGame::Game(unsigned int _bunch_num, unsigned int _bunch_den, unsigned int _player_limit)\n\t: player_limit(_player_limit)\n{\n\tfor (char ch = 'A'; ch <= 'Z'; ++ch)\n\t\tfor (unsigned int i = 0; i < ((letter_count[ch - 'A'] * _bunch_num) \/ _bunch_den); ++i)\n\t\t\trandom_insert(bunch, ch);\n\n\tauto it = bunch.begin();\n\tfor (int i = 0; i < 20; ++i, ++it);\n\tbunch.erase(it, bunch.end());\n}\n\nPlayer& Game::add_player(const string& id, const sf::IpAddress& ip, unsigned short port, const string& name)\n{\n\tplayers[id] = Player(ip, port, name);\n\treturn players[id];\n}\n\nvoid Game::remove_player(const string& id)\n{\n\tfor (auto chr : players.at(id).get_hand())\n\t\trandom_insert(bunch, chr);\n\n\tplayers.erase(id);\n\n\tif (playing)\n\t{\n\t\tif (players.size() < 2)\n\t\t{\n\t\t\tready_to_finish = true;\n\t\t\tfinished = true;\n\n\t\t\t\/\/ win by default\n\t\t\tif (players.size() > 0)\n\t\t\t\twinner = players.begin()->first;\n\t\t\telse\n\t\t\t\twinner.clear();\n\t\t}\n\t}\n\telse\n\t\ttry_to_start();\n}\n\nvoid Game::set_ready(const string& id, bool ready)\n{\n\tif (!playing)\n\t{\n\t\tplayers.at(id).ready = ready;\n\n\t\tif (ready)\n\t\t\ttry_to_start();\n\t}\n}\n\n\/\/ XXX assumes dump is valid!\nstring Game::dump(const string& id, const sf::Int16& dump_n, char chr)\n{\n\tif (dump_n == players.at(id).get_dump() - 1)\n\t\treturn players.at(id).last_dump();\n\telse if (dump_n == players.at(id).get_dump())\n\t{\n\t\tstring letters;\n\n\t\tif (bunch.size() >= 3)\n\t\t{\n\t\t\t\/\/ take three\n\t\t\tfor (unsigned int i = 0; i < 3; ++i)\n\t\t\t{\n\t\t\t\tletters.append(1, bunch.back());\n\t\t\t\tbunch.pop_back();\n\t\t\t}\n\t\t\tplayers.at(id).give_dump(chr, letters);\n\n\t\t\trandom_insert(bunch, chr);\n\t\t}\n\t\telse\n\t\t\tletters.append(1, chr);\n\n\t\treturn letters;\n\t}\n\n\t\/\/ XXX should never get here!!!\n\treturn \"\";\n}\n\n\/\/ XXX assumes peeling is valid. returns true if game has ended\nbool Game::peel()\n{\n\t\/\/ if there aren't enough letters left\n\tif (bunch.size() < players.size())\n\t{\n\t\tready_to_finish = true;\n\t\tfinished = true;\n\t\treturn true;\n\t}\n\n\tunsigned int num_letters = 1;\n\tready_to_peel = false;\n\n\t\/\/ if this is the first peel\n\tif (peel_number++ == 0)\n\t{\n\t\tplaying = true;\n\t\tnum_letters = 10; \/\/ TODO calculate\n\n\t\t\/\/ reset ack counters to track peels\n\t\tfor (auto& pair : players)\n\t\t\tpair.second.reset_ack();\n\t}\n\n\tfor (auto& pair : players)\n\t{\n\t\tstring letters;\n\t\tfor (unsigned int i = 0; i < num_letters; ++i)\n\t\t{\n\t\t\tletters.append(1, bunch.back());\n\t\t\tbunch.pop_back();\n\t\t}\n\n\t\tpair.second.give_peel(letters);\n\t}\n\n\treturn false;\n}\n\nvoid Game::try_to_start()\n{\n\t\/\/ if already started\n\tif (playing)\n\t\treturn;\n\n\t\/\/ if not enough players\n\tif (players.size() < 2)\n\t\treturn;\n\n\t\/\/ if players aren't ready\n\tfor (const auto& pair : players)\n\t\tif (!pair.second.ready)\n\t\t\treturn;\n\n\tready_to_peel = true;\n}\n\nvoid Game::check_waiting()\n{\n\tfor (const auto& pair : players)\n\t\tif (pair.second.has_pending())\n\t\t\treturn;\n\n\twaiting = false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifdef ENABLE_MPI\n\n#include <stddef.h>\n#include <sstream>\n\n#include \"Tools\/Exception\/exception.hpp\"\n\n#include \"Monitor_BFER_reduction_mpi.hpp\"\n\nusing namespace aff3ct;\nusing namespace aff3ct::module;\n\nstruct monitor_vals\n{\n\tunsigned long long n_be;\n\tunsigned long long n_fe;\n\tunsigned long long n_fra;\n\tfloat              MI_sum;\n};\n\nvoid MPI_SUM_monitor_vals_func(void *in, void *inout, int *len, MPI_Datatype *datatype)\n{\n\tauto    in_cvt = static_cast<monitor_vals*>(in   );\n\tauto inout_cvt = static_cast<monitor_vals*>(inout);\n\n\tfor (auto i = 0; i < *len; i++)\n\t{\n\t\tinout_cvt[i].n_be  += in_cvt[i].n_be;\n\t\tinout_cvt[i].n_fe  += in_cvt[i].n_fe;\n\n\t\tinout_cvt[i].n_fra += in_cvt[i].n_fra;\n\t\tinout_cvt[i].MI_sum+= inout_cvt[i].MI_sum;\n\t}\n}\n\ntemplate <typename B, typename R>\nMonitor_BFER_reduction_mpi<B,R>\n::Monitor_BFER_reduction_mpi(const std::vector<Monitor_BFER<B,R>*> &monitors,\n                             const std::thread::id master_thread_id,\n                             const std::chrono::nanoseconds d_mpi_comm_frequency)\n: Monitor_BFER_reduction<B,R>(monitors),\n  master_thread_id(master_thread_id),\n  is_fe_limit_achieved(false),\n  t_last_mpi_comm(std::chrono::steady_clock::now()),\n  d_mpi_comm_frequency(d_mpi_comm_frequency)\n{\n\tconst std::string name = \"Monitor_BFER_reduction_mpi\";\n\tthis->set_name(name);\n\n\tint blen[4];\n\tMPI_Aint displacements[4];\n\tMPI_Datatype oldtypes[4];\n\n\tblen[0] = 1; displacements[0] = offsetof(monitor_vals, n_be  ); oldtypes[0] = MPI_UNSIGNED_LONG_LONG;\n\tblen[1] = 1; displacements[1] = offsetof(monitor_vals, n_fe  ); oldtypes[1] = MPI_UNSIGNED_LONG_LONG;\n\tblen[2] = 1; displacements[2] = offsetof(monitor_vals, n_fra ); oldtypes[2] = MPI_UNSIGNED_LONG_LONG;\n\tblen[3] = 1; displacements[3] = offsetof(monitor_vals, MI_sum); oldtypes[3] = MPI_FLOAT;\n\n\tif (auto ret = MPI_Type_create_struct(4, blen, displacements, oldtypes, &MPI_monitor_vals))\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'MPI_Type_create_struct' returned '\" << ret << \"' error code.\";\n\t\tthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n\t}\n\n\tif (auto ret = MPI_Type_commit(&MPI_monitor_vals))\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'MPI_Type_commit' returned '\" << ret << \"' error code.\";\n\t\tthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n\t}\n\n\tif (auto ret = MPI_Op_create(MPI_SUM_monitor_vals_func, true, &MPI_SUM_monitor_vals))\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'MPI_Op_create' returned '\" << ret << \"' error code.\";\n\t\tthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n\t}\n}\n\ntemplate <typename B, typename R>\nMonitor_BFER_reduction_mpi<B,R>\n::~Monitor_BFER_reduction_mpi()\n{\n}\n\ntemplate <typename B, typename R>\nbool Monitor_BFER_reduction_mpi<B,R>\n::fe_limit_achieved()\n{\n\t\/\/ only the master thread can do this\n\tif (std::this_thread::get_id() == this->master_thread_id &&\n\t    ((std::chrono::steady_clock::now() - t_last_mpi_comm) >= d_mpi_comm_frequency))\n\t{\n\t\tmonitor_vals mvals_recv;\n\t\tmonitor_vals mvals_send = { this->get_n_be()           - this->n_bit_errors,\n\t\t                            this->get_n_fe()           - this->n_frame_errors,\n\t\t                            this->get_n_analyzed_fra() - this->n_analyzed_frames,\n\t\t                            this->get_MI_sum()         - this->MI_sum };\n\n\t\tMPI_Allreduce(&mvals_send, &mvals_recv, 1, MPI_monitor_vals, MPI_SUM_monitor_vals, MPI_COMM_WORLD);\n\n\t\tthis->n_bit_errors      = mvals_recv.n_be   - mvals_send.n_be;\n\t\tthis->n_frame_errors    = mvals_recv.n_fe   - mvals_send.n_fe;\n\t\tthis->n_analyzed_frames = mvals_recv.n_fra  - mvals_send.n_fra;\n\t\tthis->MI_sum            = mvals_recv.MI_sum - mvals_send.MI_sum;\n\n\t\tt_last_mpi_comm = std::chrono::steady_clock::now();\n\n\t\tis_fe_limit_achieved = mvals_recv.n_fe >= this->get_fe_limit();\n\t}\n\n\treturn is_fe_limit_achieved;\n}\n\ntemplate <typename B, typename R>\nvoid Monitor_BFER_reduction_mpi<B,R>\n::reset()\n{\n\tMonitor_BFER_reduction<B,R>::reset();\n\tis_fe_limit_achieved = false;\n}\n\n\/\/ ==================================================================================== explicit template instantiation\n#include \"Tools\/types.h\"\n#ifdef MULTI_PREC\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B_8, Q_8>;\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B_16,Q_16>;\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B_32,Q_32>;\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B_64,Q_64>;\n#else\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B,Q>;\n#endif\n\/\/ ==================================================================================== explicit template instantiation\n\n#endif\n<commit_msg>Fix MPI compilation<commit_after>#ifdef ENABLE_MPI\n\n#include <stddef.h>\n#include <sstream>\n\n#include \"Tools\/Exception\/exception.hpp\"\n\n#include \"Monitor_BFER_reduction_mpi.hpp\"\n\nusing namespace aff3ct;\nusing namespace aff3ct::module;\n\nstruct monitor_vals\n{\n\tunsigned long long n_be;\n\tunsigned long long n_fe;\n\tunsigned long long n_fra;\n\tfloat              MI_sum;\n};\n\nvoid MPI_SUM_monitor_vals_func(void *in, void *inout, int *len, MPI_Datatype *datatype)\n{\n\tauto    in_cvt = static_cast<monitor_vals*>(in   );\n\tauto inout_cvt = static_cast<monitor_vals*>(inout);\n\n\tfor (auto i = 0; i < *len; i++)\n\t{\n\t\tinout_cvt[i].n_be  += in_cvt[i].n_be;\n\t\tinout_cvt[i].n_fe  += in_cvt[i].n_fe;\n\n\t\tinout_cvt[i].n_fra += in_cvt[i].n_fra;\n\t\tinout_cvt[i].MI_sum+= inout_cvt[i].MI_sum;\n\t}\n}\n\ntemplate <typename B, typename R>\nMonitor_BFER_reduction_mpi<B,R>\n::Monitor_BFER_reduction_mpi(const std::vector<Monitor_BFER<B,R>*> &monitors,\n                             const std::thread::id master_thread_id,\n                             const std::chrono::nanoseconds d_mpi_comm_frequency)\n: Monitor_BFER_reduction<B,R>(monitors),\n  master_thread_id(master_thread_id),\n  is_fe_limit_achieved(false),\n  t_last_mpi_comm(std::chrono::steady_clock::now()),\n  d_mpi_comm_frequency(d_mpi_comm_frequency)\n{\n\tconst std::string name = \"Monitor_BFER_reduction_mpi\";\n\tthis->set_name(name);\n\n\tint blen[4];\n\tMPI_Aint displacements[4];\n\tMPI_Datatype oldtypes[4];\n\n\tblen[0] = 1; displacements[0] = offsetof(monitor_vals, n_be  ); oldtypes[0] = MPI_UNSIGNED_LONG_LONG;\n\tblen[1] = 1; displacements[1] = offsetof(monitor_vals, n_fe  ); oldtypes[1] = MPI_UNSIGNED_LONG_LONG;\n\tblen[2] = 1; displacements[2] = offsetof(monitor_vals, n_fra ); oldtypes[2] = MPI_UNSIGNED_LONG_LONG;\n\tblen[3] = 1; displacements[3] = offsetof(monitor_vals, MI_sum); oldtypes[3] = MPI_FLOAT;\n\n\tif (auto ret = MPI_Type_create_struct(4, blen, displacements, oldtypes, &MPI_monitor_vals))\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'MPI_Type_create_struct' returned '\" << ret << \"' error code.\";\n\t\tthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n\t}\n\n\tif (auto ret = MPI_Type_commit(&MPI_monitor_vals))\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'MPI_Type_commit' returned '\" << ret << \"' error code.\";\n\t\tthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n\t}\n\n\tif (auto ret = MPI_Op_create(MPI_SUM_monitor_vals_func, true, &MPI_SUM_monitor_vals))\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'MPI_Op_create' returned '\" << ret << \"' error code.\";\n\t\tthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n\t}\n}\n\ntemplate <typename B, typename R>\nMonitor_BFER_reduction_mpi<B,R>\n::~Monitor_BFER_reduction_mpi()\n{\n}\n\ntemplate <typename B, typename R>\nbool Monitor_BFER_reduction_mpi<B,R>\n::fe_limit_achieved()\n{\n\t\/\/ only the master thread can do this\n\tif (std::this_thread::get_id() == this->master_thread_id &&\n\t    ((std::chrono::steady_clock::now() - t_last_mpi_comm) >= d_mpi_comm_frequency))\n\t{\n\t\tmonitor_vals mvals_recv;\n\t\tmonitor_vals mvals_send = { this->get_n_be()           - this->n_bit_errors,\n\t\t                            this->get_n_fe()           - this->n_frame_errors,\n\t\t                            this->get_n_analyzed_fra() - this->n_analyzed_frames,\n\t\t                            this->get_MI_sum()         - this->MI_sum };\n\n\t\tMPI_Allreduce(&mvals_send, &mvals_recv, 1, MPI_monitor_vals, MPI_SUM_monitor_vals, MPI_COMM_WORLD);\n\n\t\tthis->n_bit_errors      = mvals_recv.n_be   - mvals_send.n_be;\n\t\tthis->n_frame_errors    = mvals_recv.n_fe   - mvals_send.n_fe;\n\t\tthis->n_analyzed_frames = mvals_recv.n_fra  - mvals_send.n_fra;\n\t\tthis->MI_sum            = mvals_recv.MI_sum - mvals_send.MI_sum;\n\n\t\tt_last_mpi_comm = std::chrono::steady_clock::now();\n\n\t\tis_fe_limit_achieved = mvals_recv.n_fe >= this->get_fe_limit();\n\t}\n\n\treturn is_fe_limit_achieved;\n}\n\ntemplate <typename B, typename R>\nvoid Monitor_BFER_reduction_mpi<B,R>\n::reset()\n{\n\tMonitor_BFER_reduction<B,R>::reset();\n\tis_fe_limit_achieved = false;\n}\n\n\/\/ ==================================================================================== explicit template instantiation\n#include \"Tools\/types.h\"\n#ifdef MULTI_PREC\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B_8, R_8>;\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B_16,R_16>;\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B_32,R_32>;\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B_64,R_64>;\n#else\ntemplate class aff3ct::module::Monitor_BFER_reduction_mpi<B,R>;\n#endif\n\/\/ ==================================================================================== explicit template instantiation\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"inputdevice.h\"\n#include \"ui_inputdevice.h\"\n\n#include <QAudioInput> \/\/ not final\n#include <QDebug> \/\/ not final\n#include <QMessageBox>\n\nnamespace {\ntemplate <class IndexMapType, class ItemType, class Callable>\nstatic void insertWithDefault(QComboBox* comboBox, IndexMapType& map,\n                              QList<ItemType> items, ItemType defaultItem,\n                              Callable stringGenerator)\n{\n  int itemPosition = 0;\n\n  comboBox->clear();\n  map.clear();\n\n  {\n    map[itemPosition] = defaultItem;\n\n    comboBox->insertItem(itemPosition++,\n                         \"Default: \" + stringGenerator(defaultItem));\n  }\n\n  comboBox->insertSeparator(itemPosition++);\n\n  for (auto item : items) {\n    map[itemPosition] = item;\n\n    comboBox->insertItem(itemPosition++, stringGenerator(item));\n  }\n}\n\nbool validateAudioDevice(QString& errorMessage,\n                         QAudioDeviceInfo& audioDeviceInfo)\n{\n#define CONDITION(cond) [](QAudioDeviceInfo& adi) { return cond; }\n\n  struct {\n    std::function<bool(QAudioDeviceInfo& adi)> test;\n    const char* failureMessage;\n  } tests[] = {\n\n        {CONDITION(adi.supportedByteOrders().contains(\n             static_cast<QAudioFormat::Endian>(QSysInfo::ByteOrder))),\n         \"Audio device does not support system byte order.\"},\n\n        {CONDITION(adi.supportedChannelCounts().contains(1)),\n         \"Audio device does not support mono input.\"},\n\n        {CONDITION(adi.supportedCodecs().contains(\"audio\/pcm\")),\n         \"Audio device does not support PCM codec.\"},\n\n        {CONDITION(\n             adi.supportedSampleTypes().contains(QAudioFormat::UnSignedInt)),\n         \"Audio device does not support unsigned int.\"},\n\n\t\/*\n        {CONDITION(false), \"Failure test.\"},\n        {CONDITION(false), \"Failure test 2.\"},\n\t*\/\n\n    };\n\n#undef CONDITION\n\n  bool good = true;\n  for (auto t : tests) {\n    if (!t.test(audioDeviceInfo)) {\n      if (!good) { errorMessage.append(\"\\n\"); }\n      errorMessage.append(t.failureMessage);\n      good = false;\n    }\n  }\n\n  return good;\n}\n\n} \/\/ namespace anonymous\n\nInputDevice::InputDevice(QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::InputDevice)\n{\n  ui->setupUi(this);\n\n  insertWithDefault(ui->cmbDevice, m_indexToDevice,\n                    QAudioDeviceInfo::availableDevices(QAudio::AudioInput),\n                    QAudioDeviceInfo::defaultInputDevice(),\n                    [](QAudioDeviceInfo& audioDeviceInfo) {\n    return audioDeviceInfo.deviceName();\n  });\n\n}\n\nInputDevice::~InputDevice()\n{\n    delete ui;\n}\n\nvoid InputDevice::on_cmbDevice_currentIndexChanged(int index)\n{\n  if (index == -1) return; \/\/ If combo box gets cleared\n\n  auto device = m_indexToDevice[index];\n  auto preferredAudioFormat = device.preferredFormat();\n\n  insertWithDefault(ui->cmbSampleRate, m_indexToSampleRate,\n                    device.supportedSampleRates(),\n                    preferredAudioFormat.sampleRate(), [](int sampleRate) {\n                      return QString::number(sampleRate);\n                    });\n\n  insertWithDefault(ui->cmbSampleSize, m_indexToSampleSize,\n                    device.supportedSampleSizes(),\n                    preferredAudioFormat.sampleSize(), [](int sampleSize) {\n                      return QString::number(sampleSize);\n                    });\n\n  QString errorMessage;\n  if (!validateAudioDevice(errorMessage, device)) {\n    \/\/ TODO: Put this on message queue, since it won't make much sense\n    \/\/ if this is shown before the config popup.\n    QMessageBox::critical(this, tr(\"Unsupported input device\"), errorMessage);\n  }\n}\n<commit_msg>static const struct<commit_after>#include \"inputdevice.h\"\n#include \"ui_inputdevice.h\"\n\n#include <QAudioInput> \/\/ not final\n#include <QDebug> \/\/ not final\n#include <QMessageBox>\n\nnamespace {\ntemplate <class IndexMapType, class ItemType, class Callable>\nstatic void insertWithDefault(QComboBox* comboBox, IndexMapType& map,\n                              QList<ItemType> items, ItemType defaultItem,\n                              Callable stringGenerator)\n{\n  int itemPosition = 0;\n\n  comboBox->clear();\n  map.clear();\n\n  {\n    map[itemPosition] = defaultItem;\n\n    comboBox->insertItem(itemPosition++,\n                         \"Default: \" + stringGenerator(defaultItem));\n  }\n\n  comboBox->insertSeparator(itemPosition++);\n\n  for (auto item : items) {\n    map[itemPosition] = item;\n\n    comboBox->insertItem(itemPosition++, stringGenerator(item));\n  }\n}\n\nbool validateAudioDevice(QString& errorMessage,\n                         QAudioDeviceInfo& audioDeviceInfo)\n{\n#define CONDITION(cond) [](QAudioDeviceInfo& adi) { return cond; }\n\n  static const struct {\n    std::function<bool(QAudioDeviceInfo& adi)> test;\n    const char* failureMessage;\n  } tests[] = {\n\n        {CONDITION(adi.supportedByteOrders().contains(\n             static_cast<QAudioFormat::Endian>(QSysInfo::ByteOrder))),\n         \"Audio device does not support system byte order.\"},\n\n        {CONDITION(adi.supportedChannelCounts().contains(1)),\n         \"Audio device does not support mono input.\"},\n\n        {CONDITION(adi.supportedCodecs().contains(\"audio\/pcm\")),\n         \"Audio device does not support PCM codec.\"},\n\n        {CONDITION(\n             adi.supportedSampleTypes().contains(QAudioFormat::UnSignedInt)),\n         \"Audio device does not support unsigned int.\"},\n\n\t\/*\n        {CONDITION(false), \"Failure test.\"},\n        {CONDITION(false), \"Failure test 2.\"},\n\t*\/\n\n    };\n\n#undef CONDITION\n\n  bool good = true;\n  for (auto t : tests) {\n    if (!t.test(audioDeviceInfo)) {\n      if (!good) { errorMessage.append(\"\\n\"); }\n      errorMessage.append(t.failureMessage);\n      good = false;\n    }\n  }\n\n  return good;\n}\n\n} \/\/ namespace anonymous\n\nInputDevice::InputDevice(QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::InputDevice)\n{\n  ui->setupUi(this);\n\n  insertWithDefault(ui->cmbDevice, m_indexToDevice,\n                    QAudioDeviceInfo::availableDevices(QAudio::AudioInput),\n                    QAudioDeviceInfo::defaultInputDevice(),\n                    [](QAudioDeviceInfo& audioDeviceInfo) {\n    return audioDeviceInfo.deviceName();\n  });\n\n}\n\nInputDevice::~InputDevice()\n{\n    delete ui;\n}\n\nvoid InputDevice::on_cmbDevice_currentIndexChanged(int index)\n{\n  if (index == -1) return; \/\/ If combo box gets cleared\n\n  auto device = m_indexToDevice[index];\n  auto preferredAudioFormat = device.preferredFormat();\n\n  insertWithDefault(ui->cmbSampleRate, m_indexToSampleRate,\n                    device.supportedSampleRates(),\n                    preferredAudioFormat.sampleRate(), [](int sampleRate) {\n                      return QString::number(sampleRate);\n                    });\n\n  insertWithDefault(ui->cmbSampleSize, m_indexToSampleSize,\n                    device.supportedSampleSizes(),\n                    preferredAudioFormat.sampleSize(), [](int sampleSize) {\n                      return QString::number(sampleSize);\n                    });\n\n  QString errorMessage;\n  if (!validateAudioDevice(errorMessage, device)) {\n    \/\/ TODO: Put this on message queue, since it won't make much sense\n    \/\/ if this is shown before the config popup.\n    QMessageBox::critical(this, tr(\"Unsupported input device\"), errorMessage);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <Python.h>\n#include <stdexcept>\n\n#include \"neuron.hpp\"\n#include \"network.hpp\"\n\nint glob_argc;\nchar **glob_argv;\n\n\nstatic PyObject* test(PyObject* self)\n{\n    \/\/Network* network = new Network(14, 4, 2);\n    \/\/network->nonsensory_neurons[0]->calculate_potential();\n\n    Py_RETURN_NONE;\n}\n\nstatic PyObject* hello_world(PyObject* self)\n{\n    std::cout << \"Hello World!\" << std::endl;\n\n    Py_RETURN_NONE;\n}\n\nvoid parse_iterable(std::vector<double> &arr, PyObject *iter)\n{\n    while (true) {\n        PyObject *next = PyIter_Next(iter);\n        if (!next) {\n            \/\/ nothing left in the iterator\n            break;\n        }\n\n        if (!PyFloat_Check(next)) {\n            throw std::invalid_argument(\"One of the arguments contains an illegal value (other than float)\");\n        }\n\n        double val = PyFloat_AsDouble(next);\n        arr.push_back(val);\n    }\n}\n\ntypedef struct {\n    PyObject_HEAD\n    Network * ptrObj;\n} PyNetwork;\n\nstatic int PyNetwork_init(PyNetwork *self, PyObject *args, PyObject *kwargs)\n\/\/ initialize PyNetwork Object\n{\n    int size;\n    int input_dim = 0;\n    int output_dim = 0;\n    double connectivity = 0.01;\n    int precision = 2;\n    int randomly_fire = false;\n    int dynamic_output = false;\n    int visualization = false;\n    double decay_factor =  1.0;\n\n    static char *kwlist[] = {\"size\", \"input_dim\", \"output_dim\", \"connectivity\", \"precision\", \"randomly_fire\", \"dynamic_output\", \"visualization\", \"decay_factor\", NULL};\n\n    if (! PyArg_ParseTupleAndKeywords(args, kwargs, \"i|iidipppd\", kwlist, &size, &input_dim, &output_dim, &connectivity, &precision, &randomly_fire, &dynamic_output, &visualization, &decay_factor))\n        return -1;\n\n    self->ptrObj = new Network(size, input_dim, output_dim, connectivity, precision, randomly_fire, dynamic_output, visualization, decay_factor);\n\n    return 0;\n}\n\nstatic void PyNetwork_dealloc(PyNetwork * self)\n\/\/ destruct the object\n{\n    delete self->ptrObj;\n    Py_TYPE(self)->tp_free(self);\n}\n\nstatic PyObject * PyNetwork_load(PyNetwork* self, PyObject* args, PyObject *kwargs)\n{\n    std::vector<double> input_arr;\n    std::vector<double> output_arr;\n    PyObject *input_obj;\n    PyObject *output_obj;\n\n    if (! PyArg_ParseTuple(args, \"OO\", &input_obj, &output_obj))\n        throw std::invalid_argument(\"Wrong type of argument\");\n\n    PyObject *input_iter = PyObject_GetIter(input_obj);\n    PyObject *output_iter = PyObject_GetIter(output_obj);\n    if (!input_iter || !output_iter) {\n        throw std::invalid_argument(\"One of the arguments is not iterable\");\n    }\n\n    parse_iterable(input_arr, input_iter);\n    parse_iterable(output_arr, output_iter);\n\n    (self->ptrObj)->load(input_arr, output_arr);\n    return Py_BuildValue(\"\");\n}\n\nstatic PyMethodDef PyNetwork_methods[] = {\n    {\"load\", (PyCFunction)PyNetwork_load, METH_VARARGS, \"Load input and ouput the neural network\" },\n    {NULL}  \/* Sentinel *\/\n};\n\nstatic PyTypeObject PyNetworkType = { PyVarObject_HEAD_INIT(NULL, 0)\n    \"plexus.Network\"   \/* tp_name *\/\n};\n\nstatic struct PyModuleDef moduledef = {\n    PyModuleDef_HEAD_INIT,\n    \"cplexus\",          \/* name of module *\/\n    \"\",                 \/* module documentation, may be NULL *\/\n    -1,                 \/* size of per-interpreter state of the module, or -1 if the module keeps state in global variables. *\/\n    NULL, NULL, NULL, NULL, NULL\n};\n\nPyMODINIT_FUNC PyInit_cplexus(void)\n\/\/ create the module\n{\n    PyObject* m;\n\n    PyNetworkType.tp_new = PyType_GenericNew;\n    PyNetworkType.tp_basicsize=sizeof(PyNetwork);\n    PyNetworkType.tp_dealloc=(destructor) PyNetwork_dealloc;\n    PyNetworkType.tp_flags=Py_TPFLAGS_DEFAULT;\n    PyNetworkType.tp_doc=\"Network objects\";\n    PyNetworkType.tp_methods=PyNetwork_methods;\n    \/\/~ PyNetworkType.tp_members=Noddy_members;\n    PyNetworkType.tp_init=(initproc)PyNetwork_init;\n\n    if (PyType_Ready(&PyNetworkType) < 0)\n        return NULL;\n\n    m = PyModule_Create(&moduledef);\n    if (m == NULL)\n        return NULL;\n\n    Py_INCREF(&PyNetworkType);\n    PyModule_AddObject(m, \"Network\", (PyObject *)&PyNetworkType); \/\/ Add Network object to the module\n    return m;\n}\n\nvoid initcplexus(void)\n{\n    PyInit_cplexus();\n}\n\nint main(int argc, char *argv[])\n{\n    glob_argc = argc;\n    glob_argv = argv;\n\n    wchar_t *program = Py_DecodeLocale(argv[0], NULL);\n\n    \/* Pass argv[0] to the Python interpreter *\/\n    Py_SetProgramName(program);\n\n    \/* Initialize the Python interpreter.  Required. *\/\n    Py_Initialize();\n\n    \/* Add a static module *\/\n    initcplexus();\n}\n<commit_msg>Fix the C++ Python wrapper of Network::load() function<commit_after>#include <Python.h>\n#include <stdexcept>\n\n#include \"neuron.hpp\"\n#include \"network.hpp\"\n\nint glob_argc;\nchar **glob_argv;\n\n\nstatic PyObject* test(PyObject* self)\n{\n    \/\/Network* network = new Network(14, 4, 2);\n    \/\/network->nonsensory_neurons[0]->calculate_potential();\n\n    Py_RETURN_NONE;\n}\n\nstatic PyObject* hello_world(PyObject* self)\n{\n    std::cout << \"Hello World!\" << std::endl;\n\n    Py_RETURN_NONE;\n}\n\nvoid parse_iterable(std::vector<double> &arr, PyObject *iter)\n{\n    while (true) {\n        PyObject *next = PyIter_Next(iter);\n        if (!next) {\n            \/\/ nothing left in the iterator\n            break;\n        }\n\n        if (!PyFloat_Check(next)) {\n            throw std::invalid_argument(\"One of the arguments contains an illegal value (other than float)\");\n        }\n\n        double val = PyFloat_AsDouble(next);\n        arr.push_back(val);\n    }\n}\n\ntypedef struct {\n    PyObject_HEAD\n    Network * ptrObj;\n} PyNetwork;\n\nstatic int PyNetwork_init(PyNetwork *self, PyObject *args, PyObject *kwargs)\n\/\/ initialize PyNetwork Object\n{\n    int size;\n    int input_dim = 0;\n    int output_dim = 0;\n    double connectivity = 0.01;\n    int precision = 2;\n    int randomly_fire = false;\n    int dynamic_output = false;\n    int visualization = false;\n    double decay_factor =  1.0;\n\n    static char *kwlist[] = {\"size\", \"input_dim\", \"output_dim\", \"connectivity\", \"precision\", \"randomly_fire\", \"dynamic_output\", \"visualization\", \"decay_factor\", NULL};\n\n    if (! PyArg_ParseTupleAndKeywords(args, kwargs, \"i|iidipppd\", kwlist, &size, &input_dim, &output_dim, &connectivity, &precision, &randomly_fire, &dynamic_output, &visualization, &decay_factor))\n        return -1;\n\n    self->ptrObj = new Network(size, input_dim, output_dim, connectivity, precision, randomly_fire, dynamic_output, visualization, decay_factor);\n\n    return 0;\n}\n\nstatic void PyNetwork_dealloc(PyNetwork * self)\n\/\/ destruct the object\n{\n    delete self->ptrObj;\n    Py_TYPE(self)->tp_free(self);\n}\n\nstatic PyObject * PyNetwork_load(PyNetwork* self, PyObject* args, PyObject *kwargs)\n{\n    std::vector<double> input_arr;\n    std::vector<double> output_arr;\n    PyObject *input_obj;\n    PyObject *output_obj = Py_None;\n\n    static char *kwlist[] = {\"input_obj\", \"output_obj\", NULL};\n\n    if (! PyArg_ParseTupleAndKeywords(args, kwargs, \"O|O\", kwlist, &input_obj, &output_obj))\n        throw std::invalid_argument(\"Wrong type of argument\");\n\n    PyObject *input_iter = PyObject_GetIter(input_obj);\n    if (!input_iter) {\n        throw std::invalid_argument(\"Input argument is not iterable\");\n    }\n    parse_iterable(input_arr, input_iter);\n\n    if (output_obj != Py_None) {\n        PyObject *output_iter = PyObject_GetIter(output_obj);\n        if (!output_iter) {\n            throw std::invalid_argument(\"Output argument is not iterable\");\n        }\n        parse_iterable(output_arr, output_iter);\n    }\n\n    (self->ptrObj)->load(input_arr, output_arr);\n\n    return Py_BuildValue(\"\");\n}\n\nstatic PyMethodDef PyNetwork_methods[] = {\n    {\"load\", (PyCFunction)PyNetwork_load, METH_VARARGS | METH_KEYWORDS, \"Load input and output the neural network\" },\n    {NULL}  \/* Sentinel *\/\n};\n\nstatic PyTypeObject PyNetworkType = { PyVarObject_HEAD_INIT(NULL, 0)\n    \"plexus.Network\"   \/* tp_name *\/\n};\n\nstatic struct PyModuleDef moduledef = {\n    PyModuleDef_HEAD_INIT,\n    \"cplexus\",          \/* name of module *\/\n    \"\",                 \/* module documentation, may be NULL *\/\n    -1,                 \/* size of per-interpreter state of the module, or -1 if the module keeps state in global variables. *\/\n    NULL, NULL, NULL, NULL, NULL\n};\n\nPyMODINIT_FUNC PyInit_cplexus(void)\n\/\/ create the module\n{\n    PyObject* m;\n\n    PyNetworkType.tp_new = PyType_GenericNew;\n    PyNetworkType.tp_basicsize=sizeof(PyNetwork);\n    PyNetworkType.tp_dealloc=(destructor) PyNetwork_dealloc;\n    PyNetworkType.tp_flags=Py_TPFLAGS_DEFAULT;\n    PyNetworkType.tp_doc=\"Network objects\";\n    PyNetworkType.tp_methods=PyNetwork_methods;\n    \/\/~ PyNetworkType.tp_members=Noddy_members;\n    PyNetworkType.tp_init=(initproc)PyNetwork_init;\n\n    if (PyType_Ready(&PyNetworkType) < 0)\n        return NULL;\n\n    m = PyModule_Create(&moduledef);\n    if (m == NULL)\n        return NULL;\n\n    Py_INCREF(&PyNetworkType);\n    PyModule_AddObject(m, \"Network\", (PyObject *)&PyNetworkType); \/\/ Add Network object to the module\n    return m;\n}\n\nvoid initcplexus(void)\n{\n    PyInit_cplexus();\n}\n\nint main(int argc, char *argv[])\n{\n    glob_argc = argc;\n    glob_argv = argv;\n\n    wchar_t *program = Py_DecodeLocale(argv[0], NULL);\n\n    \/* Pass argv[0] to the Python interpreter *\/\n    Py_SetProgramName(program);\n\n    \/* Initialize the Python interpreter.  Required. *\/\n    Py_Initialize();\n\n    \/* Add a static module *\/\n    initcplexus();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#include \"memcached\/memcached_btree\/get_cas.hpp\"\n\n#include \"errors.hpp\"\n#include <boost\/bind.hpp>\n\n#include \"arch\/runtime\/coroutines.hpp\"\n#include \"buffer_cache\/alt\/alt.hpp\"\n#include \"concurrency\/promise.hpp\"\n#include \"memcached\/memcached_btree\/btree_data_provider.hpp\"\n#include \"memcached\/memcached_btree\/modify_oper.hpp\"\n\n\/\/ This function is like get(), except that it sets a CAS value if\n\/\/ there isn't one already, so it has to be a\n\/\/ memcached_modify_oper_t. Potentially we can use a regular get() for\n\/\/ this (that replaces itself with this one if a CAS value hasn't been\n\/\/ set, for instance), but depending on how CAS is used, that may be\n\/\/ unnecessary.\n\nstruct memcached_get_cas_oper_t : public memcached_modify_oper_t, public home_thread_mixin_debug_only_t {\n    memcached_get_cas_oper_t(cas_t _proposed_cas, promise_t<get_result_t> *_res)\n        : proposed_cas(_proposed_cas), res(_res) { }\n\n    bool operate(buf_parent_t leaf,\n                 scoped_malloc_t<memcached_value_t> *value) {\n        if (!value->has()) {\n            \/\/ If not found, there's nothing to do.\n            res->pulse(get_result_t());\n            return false;\n        }\n\n        bool there_was_cas_before = (*value)->has_cas();\n        cas_t cas_to_report;\n        if (there_was_cas_before) {\n            \/\/ How convenient, there already was a CAS.\n            cas_to_report = (*value)->cas();\n        } else {\n            \/\/ This doesn't set the CAS -- it just makes room for the\n            \/\/ CAS, and run_memcached_modify_oper() sets the CAS.\n            (*value)->add_cas(leaf.cache()->get_block_size());\n            cas_to_report = proposed_cas;\n        }\n\n        \/\/ Deliver the value to the client via the promise_t we got.\n        counted_t<data_buffer_t> dp = value_to_data_buffer(value->get(), leaf);\n        res->pulse(get_result_t(dp, (*value)->mcflags(), cas_to_report));\n\n        \/\/ Return whether we made a change to the value.\n        return !there_was_cas_before;\n    }\n\n    int compute_expected_change_count(UNUSED block_size_t block_size) {\n        return 1;\n    }\n\n    cas_t proposed_cas;\n    get_result_t result;\n    promise_t<get_result_t> *res;\n};\n\nvoid co_memcached_get_cas(const store_key_t &key, cas_t proposed_cas,\n                          exptime_t effective_time, repli_timestamp_t timestamp,\n                          btree_slice_t *slice, promise_t<get_result_t> *res,\n                          superblock_t *superblock) {\n\n    memcached_get_cas_oper_t oper(proposed_cas, res);\n    run_memcached_modify_oper(&oper, slice, key, proposed_cas, effective_time, timestamp, superblock);\n}\n\nget_result_t memcached_get_cas(const store_key_t &key, btree_slice_t *slice,\n                               cas_t proposed_cas, exptime_t effective_time,\n                               repli_timestamp_t timestamp,\n                               superblock_t *superblock) {\n    promise_t<get_result_t> res;\n    \/\/ RSI: std::bind.\n    coro_t::spawn_now_dangerously(boost::bind(co_memcached_get_cas, boost::ref(key),\n                                              proposed_cas, effective_time,\n                                              timestamp, slice, &res,\n                                              boost::ref(superblock)));\n    return res.wait();\n}\n\n<commit_msg>Fixed a petty RSI about boost::bind.<commit_after>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#include \"memcached\/memcached_btree\/get_cas.hpp\"\n\n#include \"arch\/runtime\/coroutines.hpp\"\n#include \"buffer_cache\/alt\/alt.hpp\"\n#include \"concurrency\/promise.hpp\"\n#include \"memcached\/memcached_btree\/btree_data_provider.hpp\"\n#include \"memcached\/memcached_btree\/modify_oper.hpp\"\n\n\/\/ This function is like get(), except that it sets a CAS value if\n\/\/ there isn't one already, so it has to be a\n\/\/ memcached_modify_oper_t. Potentially we can use a regular get() for\n\/\/ this (that replaces itself with this one if a CAS value hasn't been\n\/\/ set, for instance), but depending on how CAS is used, that may be\n\/\/ unnecessary.\n\nstruct memcached_get_cas_oper_t : public memcached_modify_oper_t, public home_thread_mixin_debug_only_t {\n    memcached_get_cas_oper_t(cas_t _proposed_cas, promise_t<get_result_t> *_res)\n        : proposed_cas(_proposed_cas), res(_res) { }\n\n    bool operate(buf_parent_t leaf,\n                 scoped_malloc_t<memcached_value_t> *value) {\n        if (!value->has()) {\n            \/\/ If not found, there's nothing to do.\n            res->pulse(get_result_t());\n            return false;\n        }\n\n        bool there_was_cas_before = (*value)->has_cas();\n        cas_t cas_to_report;\n        if (there_was_cas_before) {\n            \/\/ How convenient, there already was a CAS.\n            cas_to_report = (*value)->cas();\n        } else {\n            \/\/ This doesn't set the CAS -- it just makes room for the\n            \/\/ CAS, and run_memcached_modify_oper() sets the CAS.\n            (*value)->add_cas(leaf.cache()->get_block_size());\n            cas_to_report = proposed_cas;\n        }\n\n        \/\/ Deliver the value to the client via the promise_t we got.\n        counted_t<data_buffer_t> dp = value_to_data_buffer(value->get(), leaf);\n        res->pulse(get_result_t(dp, (*value)->mcflags(), cas_to_report));\n\n        \/\/ Return whether we made a change to the value.\n        return !there_was_cas_before;\n    }\n\n    int compute_expected_change_count(UNUSED block_size_t block_size) {\n        return 1;\n    }\n\n    cas_t proposed_cas;\n    get_result_t result;\n    promise_t<get_result_t> *res;\n};\n\nvoid co_memcached_get_cas(const store_key_t &key, cas_t proposed_cas,\n                          exptime_t effective_time, repli_timestamp_t timestamp,\n                          btree_slice_t *slice, promise_t<get_result_t> *res,\n                          superblock_t *superblock) {\n\n    memcached_get_cas_oper_t oper(proposed_cas, res);\n    run_memcached_modify_oper(&oper, slice, key, proposed_cas, effective_time, timestamp, superblock);\n}\n\nget_result_t memcached_get_cas(const store_key_t &key, btree_slice_t *slice,\n                               cas_t proposed_cas, exptime_t effective_time,\n                               repli_timestamp_t timestamp,\n                               superblock_t *superblock) {\n    promise_t<get_result_t> res;\n    coro_t::spawn_now_dangerously(std::bind(co_memcached_get_cas, std::ref(key),\n                                            proposed_cas, effective_time,\n                                            timestamp, slice, &res,\n                                            std::ref(superblock)));\n    return res.wait();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"Geometry.h\"\n\n#include <cstdio>\n#include <fstream>\n#include <stdexcept>\n\n#include \"spruce.hh\"\n\nusing std::string;\nusing std::ostream;\nusing std::istringstream;\nusing std::ifstream;\n\nusing Eigen::Vector3i;\nusing Eigen::Vector3d;\nusing Eigen::RowVectorXd;\nusing Eigen::Matrix3Xd;\nusing Eigen::Matrix3Xi;\n\nnamespace DrakeShapes {\nconst int Geometry::NUM_BBOX_POINTS = 8;\nconst int Sphere::NUM_POINTS = 1;\nconst int Capsule::NUM_POINTS = 2;\n\nstring ShapeToString(Shape ss) {\n  switch (ss) {\n    case UNKNOWN:\n      return \"UNKNOWN\";\n    case BOX:\n      return \"BOX\";\n    case SPHERE:\n      return \"SPHERE\";\n    case CYLINDER:\n      return \"CYLINDER\";\n    case MESH:\n      return \"MESH\";\n    case MESH_POINTS:\n      return \"MESH_POINTS\";\n    case CAPSULE:\n      return \"CAPSULE\";\n  }\n  return \"UNDEFINED\";\n}\n\nGeometry::Geometry() : shape(UNKNOWN) {}\n\nGeometry::Geometry(const Geometry &other) { shape = other.getShape(); }\n\nGeometry::Geometry(Shape shape) : shape(shape) {}\n\nShape Geometry::getShape() const { return shape; }\n\nGeometry *Geometry::clone() const { return new Geometry(*this); }\n\nvoid Geometry::getPoints(Matrix3Xd &points) const { points = Matrix3Xd(); }\n\nvoid Geometry::getBoundingBoxPoints(Matrix3Xd &points) const {\n  points = Matrix3Xd();\n}\n\nvoid Geometry::getBoundingBoxPoints(double x_half_width, double y_half_width,\n                                    double z_half_width,\n                                    Eigen::Matrix3Xd &points) const {\n  \/\/ Return axis-aligned bounding-box vertices\n  points.resize(3, NUM_BBOX_POINTS);\n\n  RowVectorXd cx(NUM_BBOX_POINTS), cy(NUM_BBOX_POINTS), cz(NUM_BBOX_POINTS);\n  cx << -1, 1, 1, -1, -1, 1, 1, -1;\n  cy << 1, 1, 1, 1, -1, -1, -1, -1;\n  cz << 1, 1, -1, -1, -1, -1, 1, 1;\n  cx = cx * x_half_width;\n  cy = cy * y_half_width;\n  cz = cz * z_half_width;\n\n  points << cx, cy, cz;\n}\n\nostream &operator<<(ostream &out, const Geometry &gg) {\n  out << ShapeToString(gg.getShape()) << \", \" << gg.NUM_BBOX_POINTS;\n  return out;\n}\n\nSphere::Sphere(double radius) : Geometry(SPHERE), radius(radius) {}\n\nSphere *Sphere::clone() const { return new Sphere(*this); }\n\nvoid Sphere::getPoints(Matrix3Xd &points) const {\n  points = Matrix3Xd::Zero(3, NUM_POINTS);\n}\n\nvoid Sphere::getBoundingBoxPoints(Matrix3Xd &points) const {\n  Geometry::getBoundingBoxPoints(radius, radius, radius, points);\n}\n\nvoid Sphere::getTerrainContactPoints(Matrix3Xd &points) const {\n  if (radius < 1e-6)\n    getPoints(points);\n  else\n    points = Matrix3Xd();\n}\n\nostream &operator<<(ostream &out, const Sphere &ss) {\n  out << static_cast<const Geometry &>(ss) << \", \" << ss.radius << \", \"\n      << ss.NUM_POINTS;\n  return out;\n}\n\nBox::Box(const Eigen::Vector3d &size) : Geometry(BOX), size(size) {}\n\nBox *Box::clone() const { return new Box(*this); }\n\nvoid Box::getPoints(Matrix3Xd &points) const {\n  Geometry::getBoundingBoxPoints(size(0) \/ 2.0, size(1) \/ 2.0, size(2) \/ 2.0,\n                                 points);\n}\n\nvoid Box::getBoundingBoxPoints(Matrix3Xd &points) const { getPoints(points); }\n\nvoid Box::getTerrainContactPoints(Matrix3Xd &points) const {\n  getPoints(points);\n}\n\nostream &operator<<(ostream &out, const Box &bb) {\n  out << static_cast<const Geometry &>(bb) << \", \" << bb.size.transpose();\n  return out;\n}\n\nCylinder::Cylinder(double radius, double length)\n    : Geometry(CYLINDER), radius(radius), length(length) {}\n\nCylinder *Cylinder::clone() const { return new Cylinder(*this); }\n\nvoid Cylinder::getPoints(Matrix3Xd &points) const {\n  static bool warnOnce = true;\n  if (warnOnce) {\n    std::cerr << \"Warning: DrakeShapes::Cylinder::getPoints(): \"\n        \"This method returns the vertices of the cylinder''s bounding-box.\"\n         << std::endl;\n    warnOnce = false;\n  }\n\n  getBoundingBoxPoints(points);\n}\n\nvoid Cylinder::getBoundingBoxPoints(Matrix3Xd &points) const {\n  Geometry::getBoundingBoxPoints(radius, radius, length \/ 2.0, points);\n}\n\nostream &operator<<(ostream &out, const Cylinder &cc) {\n  out << static_cast<const Geometry &>(cc) << \", \" << cc.radius << \", \"\n      << cc.length;\n  return out;\n}\n\nCapsule::Capsule(double radius, double length)\n    : Geometry(CAPSULE), radius(radius), length(length) {}\n\nCapsule *Capsule::clone() const { return new Capsule(*this); }\n\nvoid Capsule::getPoints(Matrix3Xd &points) const {\n  \/\/ Return segment end-points\n  points.resize(Eigen::NoChange, NUM_POINTS);\n  RowVectorXd cx = RowVectorXd::Zero(NUM_POINTS);\n  RowVectorXd cy = RowVectorXd::Zero(NUM_POINTS);\n  RowVectorXd cz = RowVectorXd::Zero(NUM_POINTS);\n  cz << length \/ 2.0, -length \/ 2.0;\n\n  points << cx, cy, cz;\n}\n\nvoid Capsule::getBoundingBoxPoints(Matrix3Xd &points) const {\n  Geometry::getBoundingBoxPoints(radius, radius, (length \/ 2.0 + radius),\n                                 points);\n}\n\nostream &operator<<(ostream &out, const Capsule &cc) {\n  out << static_cast<const Geometry &>(cc) << \", \" << cc.radius << \", \"\n      << cc.length;\n  return out;\n}\n\nMesh::Mesh(const string &filename)\n    : Geometry(MESH), scale(1.0, 1.0, 1.0), filename(filename) {}\n\nMesh::Mesh(const string &filename, const string &resolved_filename)\n    : Geometry(MESH),\n      scale(1.0, 1.0, 1.0),\n      filename(filename),\n      resolved_filename(resolved_filename) {}\n\nbool Mesh::extractMeshVertices(Matrix3Xd& vertex_coordinates) const {\n  if (resolved_filename.empty()) return false;\n\n  string obj_file_name = FindFileWithObjExtension();\n  ifstream file(obj_file_name);\n  if (!file) {\n    throw std::runtime_error(\n        \"Error opening file \\\"\" + obj_file_name + \"\\\".\");\n  }\n\n  string line;\n  \/\/ Count the number of vertices and resize vertex_coordinates.\n  int num_vertices = 0;\n  while (getline(file, line)) {\n    istringstream iss(line);\n    string type;\n    if (iss >> type && type == \"v\") {\n      ++num_vertices;\n    }\n  }\n  vertex_coordinates.resize(3, num_vertices);\n\n  file.clear();\n  file.seekg(0, file.beg);\n\n  double d;\n  int j = 0;\n  while (getline(file, line)) {\n    istringstream iss(line);\n    string type;\n    if (iss >> type && type == \"v\") {\n      int i = 0;\n      while (iss >> d) {\n        vertex_coordinates(i++, j) = d;\n      }\n      ++j;\n    }\n  }\n  return true;\n}\n\nstring Mesh::FindFileWithObjExtension() const {\n  spruce::path spath(resolved_filename);\n  string ext = spath.extension();\n  std::transform(ext.begin(), ext.end(), ext.begin(), ::tolower);\n\n  if (ext.compare(\".obj\") == 0) {\n    \/\/ Checks if the file with the obj extension exists.\n    if (!spath.exists()) {\n      throw std::runtime_error(\n          \"Unable to open file \\\"\" + spath.getStr() + \"\\\".\");\n    }\n  } else {\n    \/\/ Tries changing the extension to obj.\n    spath.setExtension(\".obj\");\n    if (!spath.exists()) {\n      throw std::runtime_error(\n          \"Unable to resolve an obj file from the filename \\\"\"\n              + spath.getStr() + \"\\\" provided.\");\n    }\n  }\n\n  return spath.getStr();\n}\n\nvoid Mesh::LoadObjFile(PointsVector* vertices,\n                       TrianglesVector* triangles) const {\n  string obj_file_name = FindFileWithObjExtension();\n  ifstream file(obj_file_name);\n  if (!file) {\n    throw std::runtime_error(\n        \"Error opening file \\\"\" + obj_file_name + \"\\\".\");\n  }\n\n  std::string line;\n  int line_number = 0;\n  int maximum_index = 0;\n  while (!file.eof()) {\n    ++line_number;\n    std::getline(file, line);\n    std::stringstream ss(line);\n    std::string key;\n    ss >> key;\n\n    if (key == \"v\") {\n      \/\/ Reads a 3D vertex.\n      double x, y, z;\n      ss >> x; ss >> y; ss >> z;\n      if (ss.fail()) {\n        throw std::runtime_error(\n            \"In file \\\"\" + obj_file_name + \"\\\" \"\n            \"(line \" + std::to_string(line_number) + \"). \"\n            \"Vertex in the wrong format.\");\n      }\n      vertices->push_back(Vector3d(x, y, z));\n    } else if (key == \"f\") {\n      \/\/ Reads the connectivity for a single triangle.\n      std::vector<int> indices;\n      int index;\n      while (ss >> index) {\n        \/\/ Checks that index >= 1.\n        if (index < 1) {\n          throw std::runtime_error(\n              \"In file \\\"\" + obj_file_name + \"\\\" \"\n              \"(line \" + std::to_string(line_number) + \"). \"\n              \"Invalid vertex index is \" + std::to_string(index) + \" < 1.\");\n        }\n        maximum_index = std::max(maximum_index, index);\n\n        \/\/ Ignores line until the next whitespace.\n        \/\/ This effectively ignores texture coordinates and normals.\n        \/\/ The first entry always corresponds to an index in the face.\n        ss.ignore(line.size(), ' ');\n        if (ss.fail()) {\n          throw std::runtime_error(\n              \"In file \\\"\" + obj_file_name + \"\\\" \"\n              \"(line \" + std::to_string(line_number) + \"). \"\n              \"Triangle face in the wrong format.\");\n        }\n        indices.push_back(index);\n      }\n      if (indices.size() != 3) {\n        throw std::runtime_error(\n            \"In file \\\"\" + obj_file_name + \"\\\" \"\n            \"(line \" + std::to_string(line_number) + \"). \"\n            \"Only triangular faces supported. However \"\n            + std::to_string(indices.size()) + \" indices are provided.\");\n      }\n      triangles->push_back(Vector3i(indices[0]-1, indices[1]-1, indices[2]-1));\n    }\n  }\n\n  \/\/ Verifies that the number of vertices provided equals the maximum index\n  \/\/ referenced when defining faces.\n  if (maximum_index != vertices->size()) {\n    throw std::runtime_error(\n        \"In file \\\"\" + obj_file_name + \"\\\". \"\n        \"The number of vertices provided is \" +\n            std::to_string(vertices->size()) + \". \"\n        \"However the maximum index referenced in defining faces is \" +\n            std::to_string(maximum_index) + \".\");\n  }\n}\n\nMesh *Mesh::clone() const { return new Mesh(*this); }\n\nvoid Mesh::getPoints(Eigen::Matrix3Xd &point_matrix) const {\n  extractMeshVertices(point_matrix);\n}\n\nvoid Mesh::getBoundingBoxPoints(Matrix3Xd &bbox_points) const {\n  Matrix3Xd mesh_vertices;\n  extractMeshVertices(mesh_vertices);\n\n  Vector3d min_pos = mesh_vertices.rowwise().minCoeff();\n  Vector3d max_pos = mesh_vertices.rowwise().maxCoeff();\n\n  bbox_points.resize(Eigen::NoChange, NUM_BBOX_POINTS);\n  bbox_points << min_pos(0), min_pos(0), min_pos(0), min_pos(0), max_pos(0),\n      max_pos(0), max_pos(0), max_pos(0), min_pos(1), min_pos(1), max_pos(1),\n      max_pos(1), min_pos(1), min_pos(1), max_pos(1), max_pos(1), min_pos(2),\n      max_pos(2), min_pos(2), max_pos(2), min_pos(2), max_pos(2), min_pos(2),\n      max_pos(2);\n}\n\nostream &operator<<(ostream &out, const Mesh &mm) {\n  out << static_cast<const Geometry &>(mm) << \", \" << mm.scale << \", \"\n      << mm.filename << \", \" << mm.resolved_filename << \", \" << mm.root_dir;\n  return out;\n}\n\nMeshPoints::MeshPoints(const Eigen::Matrix3Xd &points)\n    : Geometry(MESH_POINTS), points(points) {}\n\nMeshPoints *MeshPoints::clone() const { return new MeshPoints(*this); }\n\nvoid MeshPoints::getPoints(Eigen::Matrix3Xd &point_matrix) const {\n  point_matrix = points;\n}\n\nvoid MeshPoints::getBoundingBoxPoints(Matrix3Xd &bbox_points) const {\n  Vector3d min_pos = points.rowwise().minCoeff();\n  Vector3d max_pos = points.rowwise().maxCoeff();\n\n  bbox_points.resize(Eigen::NoChange, NUM_BBOX_POINTS);\n  bbox_points << min_pos(0), min_pos(0), min_pos(0), min_pos(0), max_pos(0),\n      max_pos(0), max_pos(0), max_pos(0), min_pos(1), min_pos(1), max_pos(1),\n      max_pos(1), min_pos(1), min_pos(1), max_pos(1), max_pos(1), min_pos(2),\n      max_pos(2), min_pos(2), max_pos(2), min_pos(2), max_pos(2), min_pos(2),\n      max_pos(2);\n}\n\nostream &operator<<(ostream &out, const MeshPoints &mp) {\n  out << static_cast<const Geometry &>(mp) << \",\\n\" << mp.points;\n  return out;\n}\n\n}  \/\/ namespace DrakeShapes\n<commit_msg>Changes the strong conditon maximum_index=vertices->size() for maximum_index>vertices.size()<commit_after>#include \"Geometry.h\"\n\n#include <cstdio>\n#include <fstream>\n#include <stdexcept>\n\n#include \"spruce.hh\"\n\nusing std::string;\nusing std::ostream;\nusing std::istringstream;\nusing std::ifstream;\n\nusing Eigen::Vector3i;\nusing Eigen::Vector3d;\nusing Eigen::RowVectorXd;\nusing Eigen::Matrix3Xd;\nusing Eigen::Matrix3Xi;\n\nnamespace DrakeShapes {\nconst int Geometry::NUM_BBOX_POINTS = 8;\nconst int Sphere::NUM_POINTS = 1;\nconst int Capsule::NUM_POINTS = 2;\n\nstring ShapeToString(Shape ss) {\n  switch (ss) {\n    case UNKNOWN:\n      return \"UNKNOWN\";\n    case BOX:\n      return \"BOX\";\n    case SPHERE:\n      return \"SPHERE\";\n    case CYLINDER:\n      return \"CYLINDER\";\n    case MESH:\n      return \"MESH\";\n    case MESH_POINTS:\n      return \"MESH_POINTS\";\n    case CAPSULE:\n      return \"CAPSULE\";\n  }\n  return \"UNDEFINED\";\n}\n\nGeometry::Geometry() : shape(UNKNOWN) {}\n\nGeometry::Geometry(const Geometry &other) { shape = other.getShape(); }\n\nGeometry::Geometry(Shape shape) : shape(shape) {}\n\nShape Geometry::getShape() const { return shape; }\n\nGeometry *Geometry::clone() const { return new Geometry(*this); }\n\nvoid Geometry::getPoints(Matrix3Xd &points) const { points = Matrix3Xd(); }\n\nvoid Geometry::getBoundingBoxPoints(Matrix3Xd &points) const {\n  points = Matrix3Xd();\n}\n\nvoid Geometry::getBoundingBoxPoints(double x_half_width, double y_half_width,\n                                    double z_half_width,\n                                    Eigen::Matrix3Xd &points) const {\n  \/\/ Return axis-aligned bounding-box vertices\n  points.resize(3, NUM_BBOX_POINTS);\n\n  RowVectorXd cx(NUM_BBOX_POINTS), cy(NUM_BBOX_POINTS), cz(NUM_BBOX_POINTS);\n  cx << -1, 1, 1, -1, -1, 1, 1, -1;\n  cy << 1, 1, 1, 1, -1, -1, -1, -1;\n  cz << 1, 1, -1, -1, -1, -1, 1, 1;\n  cx = cx * x_half_width;\n  cy = cy * y_half_width;\n  cz = cz * z_half_width;\n\n  points << cx, cy, cz;\n}\n\nostream &operator<<(ostream &out, const Geometry &gg) {\n  out << ShapeToString(gg.getShape()) << \", \" << gg.NUM_BBOX_POINTS;\n  return out;\n}\n\nSphere::Sphere(double radius) : Geometry(SPHERE), radius(radius) {}\n\nSphere *Sphere::clone() const { return new Sphere(*this); }\n\nvoid Sphere::getPoints(Matrix3Xd &points) const {\n  points = Matrix3Xd::Zero(3, NUM_POINTS);\n}\n\nvoid Sphere::getBoundingBoxPoints(Matrix3Xd &points) const {\n  Geometry::getBoundingBoxPoints(radius, radius, radius, points);\n}\n\nvoid Sphere::getTerrainContactPoints(Matrix3Xd &points) const {\n  if (radius < 1e-6)\n    getPoints(points);\n  else\n    points = Matrix3Xd();\n}\n\nostream &operator<<(ostream &out, const Sphere &ss) {\n  out << static_cast<const Geometry &>(ss) << \", \" << ss.radius << \", \"\n      << ss.NUM_POINTS;\n  return out;\n}\n\nBox::Box(const Eigen::Vector3d &size) : Geometry(BOX), size(size) {}\n\nBox *Box::clone() const { return new Box(*this); }\n\nvoid Box::getPoints(Matrix3Xd &points) const {\n  Geometry::getBoundingBoxPoints(size(0) \/ 2.0, size(1) \/ 2.0, size(2) \/ 2.0,\n                                 points);\n}\n\nvoid Box::getBoundingBoxPoints(Matrix3Xd &points) const { getPoints(points); }\n\nvoid Box::getTerrainContactPoints(Matrix3Xd &points) const {\n  getPoints(points);\n}\n\nostream &operator<<(ostream &out, const Box &bb) {\n  out << static_cast<const Geometry &>(bb) << \", \" << bb.size.transpose();\n  return out;\n}\n\nCylinder::Cylinder(double radius, double length)\n    : Geometry(CYLINDER), radius(radius), length(length) {}\n\nCylinder *Cylinder::clone() const { return new Cylinder(*this); }\n\nvoid Cylinder::getPoints(Matrix3Xd &points) const {\n  static bool warnOnce = true;\n  if (warnOnce) {\n    std::cerr << \"Warning: DrakeShapes::Cylinder::getPoints(): \"\n        \"This method returns the vertices of the cylinder''s bounding-box.\"\n         << std::endl;\n    warnOnce = false;\n  }\n\n  getBoundingBoxPoints(points);\n}\n\nvoid Cylinder::getBoundingBoxPoints(Matrix3Xd &points) const {\n  Geometry::getBoundingBoxPoints(radius, radius, length \/ 2.0, points);\n}\n\nostream &operator<<(ostream &out, const Cylinder &cc) {\n  out << static_cast<const Geometry &>(cc) << \", \" << cc.radius << \", \"\n      << cc.length;\n  return out;\n}\n\nCapsule::Capsule(double radius, double length)\n    : Geometry(CAPSULE), radius(radius), length(length) {}\n\nCapsule *Capsule::clone() const { return new Capsule(*this); }\n\nvoid Capsule::getPoints(Matrix3Xd &points) const {\n  \/\/ Return segment end-points\n  points.resize(Eigen::NoChange, NUM_POINTS);\n  RowVectorXd cx = RowVectorXd::Zero(NUM_POINTS);\n  RowVectorXd cy = RowVectorXd::Zero(NUM_POINTS);\n  RowVectorXd cz = RowVectorXd::Zero(NUM_POINTS);\n  cz << length \/ 2.0, -length \/ 2.0;\n\n  points << cx, cy, cz;\n}\n\nvoid Capsule::getBoundingBoxPoints(Matrix3Xd &points) const {\n  Geometry::getBoundingBoxPoints(radius, radius, (length \/ 2.0 + radius),\n                                 points);\n}\n\nostream &operator<<(ostream &out, const Capsule &cc) {\n  out << static_cast<const Geometry &>(cc) << \", \" << cc.radius << \", \"\n      << cc.length;\n  return out;\n}\n\nMesh::Mesh(const string &filename)\n    : Geometry(MESH), scale(1.0, 1.0, 1.0), filename(filename) {}\n\nMesh::Mesh(const string &filename, const string &resolved_filename)\n    : Geometry(MESH),\n      scale(1.0, 1.0, 1.0),\n      filename(filename),\n      resolved_filename(resolved_filename) {}\n\nbool Mesh::extractMeshVertices(Matrix3Xd& vertex_coordinates) const {\n  if (resolved_filename.empty()) return false;\n\n  string obj_file_name = FindFileWithObjExtension();\n  ifstream file(obj_file_name);\n  if (!file) {\n    throw std::runtime_error(\n        \"Error opening file \\\"\" + obj_file_name + \"\\\".\");\n  }\n\n  string line;\n  \/\/ Count the number of vertices and resize vertex_coordinates.\n  int num_vertices = 0;\n  while (getline(file, line)) {\n    istringstream iss(line);\n    string type;\n    if (iss >> type && type == \"v\") {\n      ++num_vertices;\n    }\n  }\n  vertex_coordinates.resize(3, num_vertices);\n\n  file.clear();\n  file.seekg(0, file.beg);\n\n  double d;\n  int j = 0;\n  while (getline(file, line)) {\n    istringstream iss(line);\n    string type;\n    if (iss >> type && type == \"v\") {\n      int i = 0;\n      while (iss >> d) {\n        vertex_coordinates(i++, j) = d;\n      }\n      ++j;\n    }\n  }\n  return true;\n}\n\nstring Mesh::FindFileWithObjExtension() const {\n  spruce::path spath(resolved_filename);\n  string ext = spath.extension();\n  std::transform(ext.begin(), ext.end(), ext.begin(), ::tolower);\n\n  if (ext.compare(\".obj\") == 0) {\n    \/\/ Checks if the file with the obj extension exists.\n    if (!spath.exists()) {\n      throw std::runtime_error(\n          \"Unable to open file \\\"\" + spath.getStr() + \"\\\".\");\n    }\n  } else {\n    \/\/ Tries changing the extension to obj.\n    spath.setExtension(\".obj\");\n    if (!spath.exists()) {\n      throw std::runtime_error(\n          \"Unable to resolve an obj file from the filename \\\"\"\n              + spath.getStr() + \"\\\" provided.\");\n    }\n  }\n\n  return spath.getStr();\n}\n\nvoid Mesh::LoadObjFile(PointsVector* vertices,\n                       TrianglesVector* triangles) const {\n  string obj_file_name = FindFileWithObjExtension();\n  ifstream file(obj_file_name);\n  if (!file) {\n    throw std::runtime_error(\n        \"Error opening file \\\"\" + obj_file_name + \"\\\".\");\n  }\n\n  std::string line;\n  int line_number = 0;\n  int maximum_index = 0;\n  while (!file.eof()) {\n    ++line_number;\n    std::getline(file, line);\n    std::stringstream ss(line);\n    std::string key;\n    ss >> key;\n\n    if (key == \"v\") {\n      \/\/ Reads a 3D vertex.\n      double x, y, z;\n      ss >> x; ss >> y; ss >> z;\n      if (ss.fail()) {\n        throw std::runtime_error(\n            \"In file \\\"\" + obj_file_name + \"\\\" \"\n            \"(line \" + std::to_string(line_number) + \"). \"\n            \"Vertex in the wrong format.\");\n      }\n      vertices->push_back(Vector3d(x, y, z));\n    } else if (key == \"f\") {\n      \/\/ Reads the connectivity for a single triangle.\n      std::vector<int> indices;\n      int index;\n      while (ss >> index) {\n        \/\/ Checks that index >= 1.\n        if (index < 1) {\n          throw std::runtime_error(\n              \"In file \\\"\" + obj_file_name + \"\\\" \"\n              \"(line \" + std::to_string(line_number) + \"). \"\n              \"Invalid vertex index is \" + std::to_string(index) + \" < 1.\");\n        }\n        maximum_index = std::max(maximum_index, index);\n\n        \/\/ Ignores line until the next whitespace.\n        \/\/ This effectively ignores texture coordinates and normals.\n        \/\/ The first entry always corresponds to an index in the face.\n        ss.ignore(line.size(), ' ');\n        if (ss.fail()) {\n          throw std::runtime_error(\n              \"In file \\\"\" + obj_file_name + \"\\\" \"\n              \"(line \" + std::to_string(line_number) + \"). \"\n              \"Triangle face in the wrong format.\");\n        }\n        indices.push_back(index);\n      }\n      if (indices.size() != 3) {\n        throw std::runtime_error(\n            \"In file \\\"\" + obj_file_name + \"\\\" \"\n            \"(line \" + std::to_string(line_number) + \"). \"\n            \"Only triangular faces supported. However \"\n            + std::to_string(indices.size()) + \" indices are provided.\");\n      }\n      triangles->push_back(Vector3i(indices[0]-1, indices[1]-1, indices[2]-1));\n    }\n  }\n\n  \/\/ Verifies that the maximum index referenced when defining faces does not\n  \/\/ exceed the number of vertices.\n  if (maximum_index > vertices->size()) {\n    throw std::runtime_error(\n        \"In file \\\"\" + obj_file_name + \"\\\". \"\n        \"The maximum index referenced in defining faces (\" +\n            std::to_string(maximum_index) + \") \"\n        \"exceeds the number of vertices (\" +\n            std::to_string(vertices->size()) + \". \");\n  }\n}\n\nMesh *Mesh::clone() const { return new Mesh(*this); }\n\nvoid Mesh::getPoints(Eigen::Matrix3Xd &point_matrix) const {\n  extractMeshVertices(point_matrix);\n}\n\nvoid Mesh::getBoundingBoxPoints(Matrix3Xd &bbox_points) const {\n  Matrix3Xd mesh_vertices;\n  extractMeshVertices(mesh_vertices);\n\n  Vector3d min_pos = mesh_vertices.rowwise().minCoeff();\n  Vector3d max_pos = mesh_vertices.rowwise().maxCoeff();\n\n  bbox_points.resize(Eigen::NoChange, NUM_BBOX_POINTS);\n  bbox_points << min_pos(0), min_pos(0), min_pos(0), min_pos(0), max_pos(0),\n      max_pos(0), max_pos(0), max_pos(0), min_pos(1), min_pos(1), max_pos(1),\n      max_pos(1), min_pos(1), min_pos(1), max_pos(1), max_pos(1), min_pos(2),\n      max_pos(2), min_pos(2), max_pos(2), min_pos(2), max_pos(2), min_pos(2),\n      max_pos(2);\n}\n\nostream &operator<<(ostream &out, const Mesh &mm) {\n  out << static_cast<const Geometry &>(mm) << \", \" << mm.scale << \", \"\n      << mm.filename << \", \" << mm.resolved_filename << \", \" << mm.root_dir;\n  return out;\n}\n\nMeshPoints::MeshPoints(const Eigen::Matrix3Xd &points)\n    : Geometry(MESH_POINTS), points(points) {}\n\nMeshPoints *MeshPoints::clone() const { return new MeshPoints(*this); }\n\nvoid MeshPoints::getPoints(Eigen::Matrix3Xd &point_matrix) const {\n  point_matrix = points;\n}\n\nvoid MeshPoints::getBoundingBoxPoints(Matrix3Xd &bbox_points) const {\n  Vector3d min_pos = points.rowwise().minCoeff();\n  Vector3d max_pos = points.rowwise().maxCoeff();\n\n  bbox_points.resize(Eigen::NoChange, NUM_BBOX_POINTS);\n  bbox_points << min_pos(0), min_pos(0), min_pos(0), min_pos(0), max_pos(0),\n      max_pos(0), max_pos(0), max_pos(0), min_pos(1), min_pos(1), max_pos(1),\n      max_pos(1), min_pos(1), min_pos(1), max_pos(1), max_pos(1), min_pos(2),\n      max_pos(2), min_pos(2), max_pos(2), min_pos(2), max_pos(2), min_pos(2),\n      max_pos(2);\n}\n\nostream &operator<<(ostream &out, const MeshPoints &mp) {\n  out << static_cast<const Geometry &>(mp) << \",\\n\" << mp.points;\n  return out;\n}\n\n}  \/\/ namespace DrakeShapes\n<|endoftext|>"}
{"text":"<commit_before>#include <ir\/index_manager\/index\/ParallelTermPosition.h>\n\n#include <algorithm>\n\nusing namespace izenelib::ir::indexmanager;\n\nParallelTermPosition::ParallelTermPosition(collectionid_t colID, IndexReader* pIndexReader, vector<string>& properties)\n        :colID_(colID)\n        ,pIndexReader_(pIndexReader)\n        ,properties_(properties)\n{\n}\n\nParallelTermPosition::~ParallelTermPosition()\n{\n    for (map<string, TermPositions*>::iterator iter = termPositionMap_.begin(); iter != termPositionMap_.end(); ++iter)\n        delete iter->second;\n    termPositionMap_.clear();\n    for (map<string, TermReader*>::iterator iter = termReaderMap_.begin(); iter != termReaderMap_.end(); ++iter)\n        delete iter->second;\n    termReaderMap_.clear();\n}\n\nbool ParallelTermPosition::seek(termid_t termID)\n{\n    bool find = false;\n\n    for (vector<string>::iterator iter = properties_.begin(); iter != properties_.end(); ++iter)\n    {\n        Term term((*iter).c_str(),termID);\n        TermReader* pTermReader = pIndexReader_->getTermReader(colID_);\n        bool localFind = pTermReader->seek(&term);\n        find = find ||localFind;\n        if (localFind)\n        {\n            TermPositions* pPositions = pTermReader->termPositions();\n            termReaderMap_.insert(make_pair((*iter), pTermReader));\n            termPositionMap_.insert(make_pair((*iter), pPositions));\n            flagMap_.insert(make_pair((*iter), true));\n        }\n        else\n            delete pTermReader;\n    }\n    return find;\n}\n\nbool ParallelTermPosition::next(vector<string>& properties, docid_t& docid)\n{\n    bool hasNext = false;\n    docid_t minDocID = 0xFFFFFFFF;\n    \/\/flagMap_ is to indicate whether a certain property should be moved forward.\n    for (map<string, bool>::iterator iter = flagMap_.begin(); iter != flagMap_.end(); ++iter)\n    {\n        if (iter->second)\n        {\n            TermPositions* pPosition = termPositionMap_[iter->first];\n            bool local_hasNext = pPosition->next();\n            hasNext = hasNext || local_hasNext;\n            if (!local_hasNext)\n            {\n                flagMap_[iter->first] = false;\n                currDocMap_[iter->first]= 0xFFFFFFFF;\t\/\/\/Add by Yingfeng 2009.08.27\n                continue;\n            }\n            docid_t curr_docid = pPosition->doc();\n            currDocMap_[iter->first] = curr_docid;\n            iter->second = true;\n            if (curr_docid < minDocID)\n                minDocID = curr_docid;\n        }\n    }\n    for (map<string, bool>::iterator iter = flagMap_.begin(); iter != flagMap_.end(); ++iter)\n    {\n        if (!iter->second)\n        {\n            if (currDocMap_[iter->first]<= minDocID)\n            {\n                flagMap_[iter->first] = true;\n                minDocID = currDocMap_[iter->first];\n            }\n        }\n    }\n    if (!hasNext)\n    {\n        return false;\n    }\n\n    docid = minDocID;\n\tcout<<\"docid!!! \"<<docid<<endl;\n\n    for (map<string, docid_t>::iterator iter = currDocMap_.begin(); iter != currDocMap_.end(); ++iter)\n    {\n        if (iter->second == minDocID)\n        {\n            properties.push_back(iter->first);\n            flagMap_[iter->first] = true;\n        }\n        else\n        {\n            flagMap_[iter->first] = false;\n        }\n    }\n    return true;\n}\n\nvoid ParallelTermPosition::getPositions(string& property, boost::shared_ptr<std::deque<unsigned int> >& positions, freq_t& tf, freq_t& doclen)\n{\n    TermPositions* pPositions =  termPositionMap_[property];\n    loc_t pos = pPositions->nextPosition();\n    loc_t charpos = pPositions->nextPosition();\n    while (pos != BAD_POSITION)\n    {\n        positions->push_back(pos);\n        pos = pPositions->nextPosition();\n        charpos = pPositions->nextPosition();\n    }\n    tf = pPositions->freq();\n    doclen = pPositions->docLength();\n}\n\nvoid ParallelTermPosition::getPositions(string& property, boost::shared_ptr<std::deque< std::pair<unsigned int,unsigned int> > >& positions, \n\tfreq_t& tf, freq_t& doclen)\n{\n    TermPositions* pPositions =  termPositionMap_[property];\n    loc_t pos = pPositions->nextPosition();\n    loc_t charpos = pPositions->nextPosition();\n\t\n    while (pos != BAD_POSITION)\n    {\n        positions->push_back(make_pair(pos,charpos));\n        pos = pPositions->nextPosition();\n        charpos = pPositions->nextPosition();\n    }\n    tf = pPositions->freq();\n    doclen = pPositions->docLength();\n}\n\nvoid ParallelTermPosition::get_df_and_ctf(termid_t termID, DocumentFrequencyInProperties& dfmap, CollectionTermFrequencyInProperties& ctfmap)\n{\n    for (map<string, TermPositions*>::iterator iter = termPositionMap_.begin(); iter != termPositionMap_.end(); ++iter)\n    {\n        DocumentFrequencyInProperties::iterator df_iter = dfmap.insert(std::make_pair(iter->first, ID_FREQ_MAP_T())).first;\n        df_iter->second.insert(make_pair(termID, (float)iter->second->docFreq()));\n\t\t\t\n        CollectionTermFrequencyInProperties::iterator ctf_iter = ctfmap.insert(std::make_pair(iter->first, ID_FREQ_MAP_T())).first;\n        ctf_iter->second.insert(make_pair(termID, (float)iter->second->getCTF()));\n    }\n}\n<commit_msg>remove log<commit_after>#include <ir\/index_manager\/index\/ParallelTermPosition.h>\n\n#include <algorithm>\n\nusing namespace izenelib::ir::indexmanager;\n\nParallelTermPosition::ParallelTermPosition(collectionid_t colID, IndexReader* pIndexReader, vector<string>& properties)\n        :colID_(colID)\n        ,pIndexReader_(pIndexReader)\n        ,properties_(properties)\n{\n}\n\nParallelTermPosition::~ParallelTermPosition()\n{\n    for (map<string, TermPositions*>::iterator iter = termPositionMap_.begin(); iter != termPositionMap_.end(); ++iter)\n        delete iter->second;\n    termPositionMap_.clear();\n    for (map<string, TermReader*>::iterator iter = termReaderMap_.begin(); iter != termReaderMap_.end(); ++iter)\n        delete iter->second;\n    termReaderMap_.clear();\n}\n\nbool ParallelTermPosition::seek(termid_t termID)\n{\n    bool find = false;\n\n    for (vector<string>::iterator iter = properties_.begin(); iter != properties_.end(); ++iter)\n    {\n        Term term((*iter).c_str(),termID);\n        TermReader* pTermReader = pIndexReader_->getTermReader(colID_);\n        bool localFind = pTermReader->seek(&term);\n        find = find ||localFind;\n        if (localFind)\n        {\n            TermPositions* pPositions = pTermReader->termPositions();\n            termReaderMap_.insert(make_pair((*iter), pTermReader));\n            termPositionMap_.insert(make_pair((*iter), pPositions));\n            flagMap_.insert(make_pair((*iter), true));\n        }\n        else\n            delete pTermReader;\n    }\n    return find;\n}\n\nbool ParallelTermPosition::next(vector<string>& properties, docid_t& docid)\n{\n    bool hasNext = false;\n    docid_t minDocID = 0xFFFFFFFF;\n    \/\/flagMap_ is to indicate whether a certain property should be moved forward.\n    for (map<string, bool>::iterator iter = flagMap_.begin(); iter != flagMap_.end(); ++iter)\n    {\n        if (iter->second)\n        {\n            TermPositions* pPosition = termPositionMap_[iter->first];\n            bool local_hasNext = pPosition->next();\n            hasNext = hasNext || local_hasNext;\n            if (!local_hasNext)\n            {\n                flagMap_[iter->first] = false;\n                currDocMap_[iter->first]= 0xFFFFFFFF;\t\/\/\/Add by Yingfeng 2009.08.27\n                continue;\n            }\n            docid_t curr_docid = pPosition->doc();\n            currDocMap_[iter->first] = curr_docid;\n            iter->second = true;\n            if (curr_docid < minDocID)\n                minDocID = curr_docid;\n        }\n    }\n    for (map<string, bool>::iterator iter = flagMap_.begin(); iter != flagMap_.end(); ++iter)\n    {\n        if (!iter->second)\n        {\n            if (currDocMap_[iter->first]<= minDocID)\n            {\n                flagMap_[iter->first] = true;\n                minDocID = currDocMap_[iter->first];\n            }\n        }\n    }\n    if (!hasNext)\n    {\n        return false;\n    }\n\n    docid = minDocID;\n\n    for (map<string, docid_t>::iterator iter = currDocMap_.begin(); iter != currDocMap_.end(); ++iter)\n    {\n        if (iter->second == minDocID)\n        {\n            properties.push_back(iter->first);\n            flagMap_[iter->first] = true;\n        }\n        else\n        {\n            flagMap_[iter->first] = false;\n        }\n    }\n    return true;\n}\n\nvoid ParallelTermPosition::getPositions(string& property, boost::shared_ptr<std::deque<unsigned int> >& positions, freq_t& tf, freq_t& doclen)\n{\n    TermPositions* pPositions =  termPositionMap_[property];\n    loc_t pos = pPositions->nextPosition();\n    loc_t charpos = pPositions->nextPosition();\n    while (pos != BAD_POSITION)\n    {\n        positions->push_back(pos);\n        pos = pPositions->nextPosition();\n        charpos = pPositions->nextPosition();\n    }\n    tf = pPositions->freq();\n    doclen = pPositions->docLength();\n}\n\nvoid ParallelTermPosition::getPositions(string& property, boost::shared_ptr<std::deque< std::pair<unsigned int,unsigned int> > >& positions, \n\tfreq_t& tf, freq_t& doclen)\n{\n    TermPositions* pPositions =  termPositionMap_[property];\n    loc_t pos = pPositions->nextPosition();\n    loc_t charpos = pPositions->nextPosition();\n\t\n    while (pos != BAD_POSITION)\n    {\n        positions->push_back(make_pair(pos,charpos));\n        pos = pPositions->nextPosition();\n        charpos = pPositions->nextPosition();\n    }\n    tf = pPositions->freq();\n    doclen = pPositions->docLength();\n}\n\nvoid ParallelTermPosition::get_df_and_ctf(termid_t termID, DocumentFrequencyInProperties& dfmap, CollectionTermFrequencyInProperties& ctfmap)\n{\n    for (map<string, TermPositions*>::iterator iter = termPositionMap_.begin(); iter != termPositionMap_.end(); ++iter)\n    {\n        DocumentFrequencyInProperties::iterator df_iter = dfmap.insert(std::make_pair(iter->first, ID_FREQ_MAP_T())).first;\n        df_iter->second.insert(make_pair(termID, (float)iter->second->docFreq()));\n\t\t\t\n        CollectionTermFrequencyInProperties::iterator ctf_iter = ctfmap.insert(std::make_pair(iter->first, ID_FREQ_MAP_T())).first;\n        ctf_iter->second.insert(make_pair(termID, (float)iter->second->getCTF()));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * (C) Copyright 2015 Kurento (http:\/\/kurento.org\/)\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the GNU Lesser General Public License\n * (LGPL) version 2.1 which accompanies this distribution, and is available at\n * http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n *\n * This library is distributed in the hope that it will be 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#define BOOST_TEST_STATIC_LINK\n#define BOOST_TEST_PROTECTED_VIRTUAL\n\n#include <boost\/test\/included\/unit_test.hpp>\n#include <MediaPipelineImpl.hpp>\n#include <objects\/WebRtcEndpointImpl.hpp>\n#include <IceCandidate.hpp>\n#include <mutex>\n#include <condition_variable>\n#include <ModuleManager.hpp>\n#include <KurentoException.hpp>\n#include <MediaSet.hpp>\n#include <MediaElementImpl.hpp>\n\nusing namespace kurento;\nusing namespace boost::unit_test;\n\nboost::property_tree::ptree config;\nstd::string mediaPipelineId;\nModuleManager moduleManager;\n\nstruct GF {\n  GF();\n  ~GF();\n};\n\nBOOST_GLOBAL_FIXTURE (GF)\n\nGF::GF()\n{\n  boost::property_tree::ptree ac, audioCodecs, vc, videoCodecs;\n  gst_init (NULL, NULL);\n\n  moduleManager.loadModulesFromDirectories (\"..\/..\/src\/server\");\n\n  config.add (\"configPath\", \"..\/..\/..\/tests\" );\n  config.add (\"modules.kurento.SdpEndpoint.numAudioMedias\", 1);\n  config.add (\"modules.kurento.SdpEndpoint.numVideoMedias\", 1);\n\n  ac.put (\"name\", \"opus\/48000\/2\");\n  audioCodecs.push_back (std::make_pair (\"\", ac) );\n  config.add_child (\"modules.kurento.SdpEndpoint.audioCodecs\", audioCodecs);\n\n  vc.put (\"name\", \"VP8\/90000\");\n  videoCodecs.push_back (std::make_pair (\"\", vc) );\n  config.add_child (\"modules.kurento.SdpEndpoint.videoCodecs\", videoCodecs);\n\n  mediaPipelineId = moduleManager.getFactory (\"MediaPipeline\")->createObject (\n                      config, \"\",\n                      Json::Value() )->getId();\n}\n\nGF::~GF()\n{\n  MediaSet::deleteMediaSet();\n}\n\nstatic std::shared_ptr <WebRtcEndpointImpl>\ncreateWebrtc (void)\n{\n  std::shared_ptr <kurento::MediaObjectImpl> webrtcEndpoint;\n  Json::Value constructorParams;\n\n  constructorParams [\"mediaPipeline\"] = mediaPipelineId;\n\n  webrtcEndpoint = moduleManager.getFactory (\"WebRtcEndpoint\")->createObject (\n                     config, \"\",\n                     constructorParams );\n\n  return std::dynamic_pointer_cast <WebRtcEndpointImpl> (webrtcEndpoint);\n}\n\nstatic void\nreleaseWebRtc (std::shared_ptr<WebRtcEndpointImpl> &ep)\n{\n  std::string id = ep->getId();\n\n  ep.reset();\n  MediaSet::getMediaSet ()->release (id);\n}\n\nstatic std::shared_ptr <MediaElementImpl>\ncreateTestSrc (void)\n{\n  std::shared_ptr <MediaElementImpl> src = std::dynamic_pointer_cast\n      <MediaElementImpl> (MediaSet::getMediaSet()->ref (new  MediaElementImpl (\n                            boost::property_tree::ptree(),\n                            MediaSet::getMediaSet()->getMediaObject (mediaPipelineId),\n                            \"dummysrc\") ) );\n\n  g_object_set (src->getGstreamerElement(), \"audio\", TRUE, \"video\", TRUE, NULL);\n\n  return std::dynamic_pointer_cast <MediaElementImpl> (src);\n}\n\nstatic void\nreleaseTestSrc (std::shared_ptr<MediaElementImpl> &ep)\n{\n  std::string id = ep->getId();\n\n  ep.reset();\n  MediaSet::getMediaSet ()->release (id);\n}\n\n\nstatic void\ngathering_done ()\n{\n  std::atomic<bool> gathering_done (false);\n  std::condition_variable cv;\n  std::mutex mtx;\n  std::unique_lock<std::mutex> lck (mtx);\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEp = createWebrtc();\n\n  webRtcEp->signalOnIceGatheringDone.connect ([&] (OnIceGatheringDone event) {\n    gathering_done = true;\n    cv.notify_one();\n  });\n\n  webRtcEp->generateOffer ();\n  webRtcEp->gatherCandidates ();\n\n  cv.wait (lck, [&] () {\n    return gathering_done.load();\n  });\n\n  if (!gathering_done) {\n    BOOST_ERROR (\"Gathering not done\");\n  }\n\n  releaseWebRtc (webRtcEp);\n}\n\nstatic  void\nice_state_changes()\n{\n  std::atomic<bool> ice_state_changed (false);\n  std::condition_variable cv;\n  std::mutex mtx;\n  std::unique_lock<std::mutex> lck (mtx);\n\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpOfferer = createWebrtc();\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpAnswerer = createWebrtc();\n\n  webRtcEpOfferer->setName (\"offerer\");\n  webRtcEpAnswerer->setName (\"answerer\");\n\n  webRtcEpOfferer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    webRtcEpAnswerer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpAnswerer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    webRtcEpOfferer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpOfferer->signalOnIceComponentStateChanged.connect ([&] (\n  OnIceComponentStateChanged event) {\n    ice_state_changed = true;\n    cv.notify_one();\n  });\n\n  std::string offer = webRtcEpOfferer->generateOffer ();\n  std::string answer = webRtcEpAnswerer->processOffer (offer);\n  webRtcEpOfferer->processAnswer (answer);\n\n  webRtcEpOfferer->gatherCandidates ();\n  webRtcEpAnswerer->gatherCandidates ();\n\n  cv.wait (lck, [&] () {\n    return ice_state_changed.load();\n  });\n\n  if (!ice_state_changed) {\n    BOOST_ERROR (\"ICE state not chagned\");\n  }\n\n  releaseWebRtc (webRtcEpOfferer);\n  releaseWebRtc (webRtcEpAnswerer);\n}\n\nstatic  void\nstun_turn_properties ()\n{\n  std::string stunServerAddress (\"10.0.0.1\");\n  int stunServerPort = 2345;\n  std::string turnUrl (\"user0:pass0@10.0.0.2:3456\");\n\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEp  = createWebrtc();\n\n  webRtcEp->setStunServerAddress (stunServerAddress);\n  std::string stunServerAddressRet = webRtcEp->getStunServerAddress ();\n  BOOST_CHECK (stunServerAddressRet == stunServerAddress);\n\n  webRtcEp->setStunServerPort (stunServerPort);\n  int stunServerPortRet = webRtcEp->getStunServerPort ();\n  BOOST_CHECK (stunServerPortRet == stunServerPort);\n\n  webRtcEp->setTurnUrl (turnUrl);\n  std::string turnUrlRet = webRtcEp->getTurnUrl ();\n  BOOST_CHECK (turnUrlRet == turnUrl);\n\n  releaseWebRtc (webRtcEp);\n}\n\nstatic void\nmedia_state_changes ()\n{\n  std::atomic<bool> media_state_changed (false);\n  std::condition_variable cv;\n  std::mutex mtx;\n  std::unique_lock<std::mutex> lck (mtx);\n\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpOfferer = createWebrtc();\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpAnswerer = createWebrtc();\n  std::shared_ptr <MediaElementImpl> src = createTestSrc();\n\n  src->connect (webRtcEpOfferer);\n\n  webRtcEpOfferer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    BOOST_TEST_MESSAGE (\"Offerer: adding candidate \" +\n                        event.getCandidate()->getCandidate() );\n    webRtcEpAnswerer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpAnswerer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    BOOST_TEST_MESSAGE (\"Answerer: adding candidate \" +\n                        event.getCandidate()->getCandidate() );\n    webRtcEpOfferer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpOfferer->signalOnIceGatheringDone.connect ([&] (\n  OnIceGatheringDone event) {\n    BOOST_TEST_MESSAGE (\"Offerer: Gathering done\");\n  });\n\n  webRtcEpAnswerer->signalOnIceGatheringDone.connect ([&] (\n  OnIceGatheringDone event) {\n    BOOST_TEST_MESSAGE (\"Answerer: Gathering done\");\n  });\n\n  webRtcEpAnswerer->signalMediaStateChanged.connect ([&] (\n  MediaStateChanged event) {\n    media_state_changed = true;\n    cv.notify_one();\n  });\n\n  std::string offer = webRtcEpOfferer->generateOffer ();\n  BOOST_TEST_MESSAGE (\"offer: \" + offer);\n\n  std::string answer = webRtcEpAnswerer->processOffer (offer);\n  BOOST_TEST_MESSAGE (\"answer: \" + answer);\n\n  webRtcEpOfferer->processAnswer (answer);\n\n  webRtcEpOfferer->gatherCandidates ();\n  webRtcEpAnswerer->gatherCandidates ();\n\n  cv.wait (lck, [&] () {\n\n    return media_state_changed.load();\n  });\n\n\n  if (!media_state_changed) {\n    BOOST_ERROR (\"Not media state chagned\");\n  }\n\n  releaseTestSrc (src);\n  releaseWebRtc (webRtcEpOfferer);\n  releaseWebRtc (webRtcEpAnswerer);\n}\n\ntest_suite *\ninit_unit_test_suite ( int , char* [] )\n{\n  test_suite *test = BOOST_TEST_SUITE ( \"WebRtcEndpoint\" );\n  test->add (BOOST_TEST_CASE ( &gathering_done ), 0, \/* timeout *\/ 15);\n  test->add (BOOST_TEST_CASE ( &ice_state_changes ), 0, \/* timeout *\/ 15);\n  test->add (BOOST_TEST_CASE ( &stun_turn_properties ), 0, \/* timeout *\/ 15);\n  test->add (BOOST_TEST_CASE ( &media_state_changes ), 0, \/* timeout *\/ 15);\n\n  return test;\n}\n<commit_msg>webRtcEndpoint: add test for connection state<commit_after>\/*\n * (C) Copyright 2015 Kurento (http:\/\/kurento.org\/)\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the GNU Lesser General Public License\n * (LGPL) version 2.1 which accompanies this distribution, and is available at\n * http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n *\n * This library is distributed in the hope that it will be 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#define BOOST_TEST_STATIC_LINK\n#define BOOST_TEST_PROTECTED_VIRTUAL\n\n#include <boost\/test\/included\/unit_test.hpp>\n#include <MediaPipelineImpl.hpp>\n#include <objects\/WebRtcEndpointImpl.hpp>\n#include <IceCandidate.hpp>\n#include <mutex>\n#include <condition_variable>\n#include <ModuleManager.hpp>\n#include <KurentoException.hpp>\n#include <MediaSet.hpp>\n#include <MediaElementImpl.hpp>\n#include <ConnectionState.hpp>\n\nusing namespace kurento;\nusing namespace boost::unit_test;\n\nboost::property_tree::ptree config;\nstd::string mediaPipelineId;\nModuleManager moduleManager;\n\nstruct GF {\n  GF();\n  ~GF();\n};\n\nBOOST_GLOBAL_FIXTURE (GF)\n\nGF::GF()\n{\n  boost::property_tree::ptree ac, audioCodecs, vc, videoCodecs;\n  gst_init (NULL, NULL);\n\n  moduleManager.loadModulesFromDirectories (\"..\/..\/src\/server\");\n\n  config.add (\"configPath\", \"..\/..\/..\/tests\" );\n  config.add (\"modules.kurento.SdpEndpoint.numAudioMedias\", 1);\n  config.add (\"modules.kurento.SdpEndpoint.numVideoMedias\", 1);\n\n  ac.put (\"name\", \"opus\/48000\/2\");\n  audioCodecs.push_back (std::make_pair (\"\", ac) );\n  config.add_child (\"modules.kurento.SdpEndpoint.audioCodecs\", audioCodecs);\n\n  vc.put (\"name\", \"VP8\/90000\");\n  videoCodecs.push_back (std::make_pair (\"\", vc) );\n  config.add_child (\"modules.kurento.SdpEndpoint.videoCodecs\", videoCodecs);\n\n  mediaPipelineId = moduleManager.getFactory (\"MediaPipeline\")->createObject (\n                      config, \"\",\n                      Json::Value() )->getId();\n}\n\nGF::~GF()\n{\n  MediaSet::deleteMediaSet();\n}\n\nstatic std::shared_ptr <WebRtcEndpointImpl>\ncreateWebrtc (void)\n{\n  std::shared_ptr <kurento::MediaObjectImpl> webrtcEndpoint;\n  Json::Value constructorParams;\n\n  constructorParams [\"mediaPipeline\"] = mediaPipelineId;\n\n  webrtcEndpoint = moduleManager.getFactory (\"WebRtcEndpoint\")->createObject (\n                     config, \"\",\n                     constructorParams );\n\n  return std::dynamic_pointer_cast <WebRtcEndpointImpl> (webrtcEndpoint);\n}\n\nstatic void\nreleaseWebRtc (std::shared_ptr<WebRtcEndpointImpl> &ep)\n{\n  std::string id = ep->getId();\n\n  ep.reset();\n  MediaSet::getMediaSet ()->release (id);\n}\n\nstatic std::shared_ptr <MediaElementImpl>\ncreateTestSrc (void)\n{\n  std::shared_ptr <MediaElementImpl> src = std::dynamic_pointer_cast\n      <MediaElementImpl> (MediaSet::getMediaSet()->ref (new  MediaElementImpl (\n                            boost::property_tree::ptree(),\n                            MediaSet::getMediaSet()->getMediaObject (mediaPipelineId),\n                            \"dummysrc\") ) );\n\n  g_object_set (src->getGstreamerElement(), \"audio\", TRUE, \"video\", TRUE, NULL);\n\n  return std::dynamic_pointer_cast <MediaElementImpl> (src);\n}\n\nstatic void\nreleaseTestSrc (std::shared_ptr<MediaElementImpl> &ep)\n{\n  std::string id = ep->getId();\n\n  ep.reset();\n  MediaSet::getMediaSet ()->release (id);\n}\n\n\nstatic void\ngathering_done ()\n{\n  std::atomic<bool> gathering_done (false);\n  std::condition_variable cv;\n  std::mutex mtx;\n  std::unique_lock<std::mutex> lck (mtx);\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEp = createWebrtc();\n\n  webRtcEp->signalOnIceGatheringDone.connect ([&] (OnIceGatheringDone event) {\n    gathering_done = true;\n    cv.notify_one();\n  });\n\n  webRtcEp->generateOffer ();\n  webRtcEp->gatherCandidates ();\n\n  cv.wait (lck, [&] () {\n    return gathering_done.load();\n  });\n\n  if (!gathering_done) {\n    BOOST_ERROR (\"Gathering not done\");\n  }\n\n  releaseWebRtc (webRtcEp);\n}\n\nstatic  void\nice_state_changes()\n{\n  std::atomic<bool> ice_state_changed (false);\n  std::condition_variable cv;\n  std::mutex mtx;\n  std::unique_lock<std::mutex> lck (mtx);\n\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpOfferer = createWebrtc();\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpAnswerer = createWebrtc();\n\n  webRtcEpOfferer->setName (\"offerer\");\n  webRtcEpAnswerer->setName (\"answerer\");\n\n  webRtcEpOfferer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    webRtcEpAnswerer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpAnswerer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    webRtcEpOfferer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpOfferer->signalOnIceComponentStateChanged.connect ([&] (\n  OnIceComponentStateChanged event) {\n    ice_state_changed = true;\n    cv.notify_one();\n  });\n\n  std::string offer = webRtcEpOfferer->generateOffer ();\n  std::string answer = webRtcEpAnswerer->processOffer (offer);\n  webRtcEpOfferer->processAnswer (answer);\n\n  webRtcEpOfferer->gatherCandidates ();\n  webRtcEpAnswerer->gatherCandidates ();\n\n  cv.wait (lck, [&] () {\n    return ice_state_changed.load();\n  });\n\n  if (!ice_state_changed) {\n    BOOST_ERROR (\"ICE state not chagned\");\n  }\n\n  releaseWebRtc (webRtcEpOfferer);\n  releaseWebRtc (webRtcEpAnswerer);\n}\n\nstatic  void\nstun_turn_properties ()\n{\n  std::string stunServerAddress (\"10.0.0.1\");\n  int stunServerPort = 2345;\n  std::string turnUrl (\"user0:pass0@10.0.0.2:3456\");\n\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEp  = createWebrtc();\n\n  webRtcEp->setStunServerAddress (stunServerAddress);\n  std::string stunServerAddressRet = webRtcEp->getStunServerAddress ();\n  BOOST_CHECK (stunServerAddressRet == stunServerAddress);\n\n  webRtcEp->setStunServerPort (stunServerPort);\n  int stunServerPortRet = webRtcEp->getStunServerPort ();\n  BOOST_CHECK (stunServerPortRet == stunServerPort);\n\n  webRtcEp->setTurnUrl (turnUrl);\n  std::string turnUrlRet = webRtcEp->getTurnUrl ();\n  BOOST_CHECK (turnUrlRet == turnUrl);\n\n  releaseWebRtc (webRtcEp);\n}\n\nstatic void\nmedia_state_changes ()\n{\n  std::atomic<bool> media_state_changed (false);\n  std::condition_variable cv;\n  std::mutex mtx;\n  std::unique_lock<std::mutex> lck (mtx);\n\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpOfferer = createWebrtc();\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpAnswerer = createWebrtc();\n  std::shared_ptr <MediaElementImpl> src = createTestSrc();\n\n  src->connect (webRtcEpOfferer);\n\n  webRtcEpOfferer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    BOOST_TEST_MESSAGE (\"Offerer: adding candidate \" +\n                        event.getCandidate()->getCandidate() );\n    webRtcEpAnswerer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpAnswerer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    BOOST_TEST_MESSAGE (\"Answerer: adding candidate \" +\n                        event.getCandidate()->getCandidate() );\n    webRtcEpOfferer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpOfferer->signalOnIceGatheringDone.connect ([&] (\n  OnIceGatheringDone event) {\n    BOOST_TEST_MESSAGE (\"Offerer: Gathering done\");\n  });\n\n  webRtcEpAnswerer->signalOnIceGatheringDone.connect ([&] (\n  OnIceGatheringDone event) {\n    BOOST_TEST_MESSAGE (\"Answerer: Gathering done\");\n  });\n\n  webRtcEpAnswerer->signalMediaStateChanged.connect ([&] (\n  MediaStateChanged event) {\n    media_state_changed = true;\n    cv.notify_one();\n  });\n\n  std::string offer = webRtcEpOfferer->generateOffer ();\n  BOOST_TEST_MESSAGE (\"offer: \" + offer);\n\n  std::string answer = webRtcEpAnswerer->processOffer (offer);\n  BOOST_TEST_MESSAGE (\"answer: \" + answer);\n\n  webRtcEpOfferer->processAnswer (answer);\n\n  webRtcEpOfferer->gatherCandidates ();\n  webRtcEpAnswerer->gatherCandidates ();\n\n  cv.wait (lck, [&] () {\n    return media_state_changed.load();\n  });\n\n  if (!media_state_changed) {\n    BOOST_ERROR (\"Not media state chagned\");\n  }\n\n  releaseTestSrc (src);\n  releaseWebRtc (webRtcEpOfferer);\n  releaseWebRtc (webRtcEpAnswerer);\n}\n\nstatic void\nconnection_state_changes ()\n{\n  std::atomic<bool> conn_state_changed (false);\n  std::condition_variable cv;\n  std::mutex mtx;\n  std::unique_lock<std::mutex> lck (mtx);\n\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpOfferer = createWebrtc();\n  std::shared_ptr <WebRtcEndpointImpl> webRtcEpAnswerer = createWebrtc();\n\n  webRtcEpOfferer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    BOOST_TEST_MESSAGE (\"Offerer: adding candidate \" +\n                        event.getCandidate()->getCandidate() );\n    webRtcEpAnswerer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpAnswerer->signalOnIceCandidate.connect ([&] (OnIceCandidate event) {\n    BOOST_TEST_MESSAGE (\"Answerer: adding candidate \" +\n                        event.getCandidate()->getCandidate() );\n    webRtcEpOfferer->addIceCandidate (event.getCandidate() );\n  });\n\n  webRtcEpOfferer->signalOnIceGatheringDone.connect ([&] (\n  OnIceGatheringDone event) {\n    BOOST_TEST_MESSAGE (\"Offerer: Gathering done\");\n  });\n\n  webRtcEpAnswerer->signalOnIceGatheringDone.connect ([&] (\n  OnIceGatheringDone event) {\n    BOOST_TEST_MESSAGE (\"Answerer: Gathering done\");\n  });\n\n  webRtcEpAnswerer->signalConnectionStateChanged.connect ([&] (\n  ConnectionStateChanged event) {\n    conn_state_changed = true;\n    cv.notify_one();\n  });\n\n  std::string offer = webRtcEpOfferer->generateOffer ();\n  BOOST_TEST_MESSAGE (\"offer: \" + offer);\n\n  std::string answer = webRtcEpAnswerer->processOffer (offer);\n  BOOST_TEST_MESSAGE (\"answer: \" + answer);\n\n  webRtcEpOfferer->processAnswer (answer);\n\n  if (webRtcEpAnswerer->getConnectionState ()->getValue () !=\n      ConnectionState::DISCONNECTED) {\n    BOOST_ERROR (\"Connection must be disconnected\");\n  }\n\n  webRtcEpOfferer->gatherCandidates ();\n  webRtcEpAnswerer->gatherCandidates ();\n\n  cv.wait (lck, [&] () {\n    return conn_state_changed.load();\n  });\n\n  if (!conn_state_changed) {\n    BOOST_ERROR (\"Not conn state chagned\");\n  }\n\n  if (webRtcEpAnswerer->getConnectionState ()->getValue () !=\n      ConnectionState::CONNECTED) {\n    BOOST_ERROR (\"Connection must be connected\");\n  }\n\n  releaseWebRtc (webRtcEpOfferer);\n  releaseWebRtc (webRtcEpAnswerer);\n}\n\ntest_suite *\ninit_unit_test_suite ( int , char* [] )\n{\n  test_suite *test = BOOST_TEST_SUITE ( \"WebRtcEndpoint\" );\n  test->add (BOOST_TEST_CASE ( &gathering_done ), 0, \/* timeout *\/ 15);\n  test->add (BOOST_TEST_CASE ( &ice_state_changes ), 0, \/* timeout *\/ 15);\n  test->add (BOOST_TEST_CASE ( &stun_turn_properties ), 0, \/* timeout *\/ 15);\n  test->add (BOOST_TEST_CASE ( &media_state_changes ), 0, \/* timeout *\/ 15);\n  test->add (BOOST_TEST_CASE ( &connection_state_changes ), 0, \/* timeout *\/ 15);\n\n  return test;\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 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\n#include <stdlib.h>\n#include <qdeclarativeextensionplugin.h>\n#include <qdeclarativecontext.h>\n#include <qdeclarativeengine.h>\n#include <qdeclarative.h>\n\n#include <QTime>\n#include <QTimer>\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\nclass MinehuntGame : public QObject\n{\n    Q_OBJECT\npublic:\n    MinehuntGame();\n\n    Q_PROPERTY(QDeclarativeListProperty<Tile> tiles READ tiles CONSTANT);\n    QDeclarativeListProperty<Tile> tiles() { return QDeclarativeListProperty<Tile>(this, _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 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    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\nMinehuntGame::MinehuntGame()\n: numCols(9), numRows(9), playing(true), won(false)\n{\n    setObjectName(\"mainObject\");\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}\n\nvoid MinehuntGame::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 MinehuntGame::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 MinehuntGame::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 MinehuntGame::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 MinehuntGame::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\nQML_DECLARE_TYPE(Tile);\nQML_DECLARE_TYPE(MinehuntGame);\n\nclass MinehuntExtensionPlugin : public QDeclarativeExtensionPlugin\n{\n    Q_OBJECT\n\n    public:\n    void registerTypes(const char *uri) {\n        qmlRegisterType<Tile>(uri, 0, 1, \"Tile\");\n        qmlRegisterType<MinehuntGame>(uri, 0, 1, \"Game\");\n    }\n\n    void initializeEngine(QDeclarativeEngine *engine, const char *uri) {\n        Q_UNUSED(uri);\n\n        srand(QTime(0,0,0).secsTo(QTime::currentTime()));\n\n        MinehuntGame* game = new MinehuntGame();\n\n        engine->rootContext()->setContextObject(game);\n    }\n};\n\n#include \"minehunt.moc\"\n\nQ_EXPORT_PLUGIN(MinehuntExtensionPlugin);\n\n<commit_msg>Use QDeclarativeListProperty properly<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\n#include <stdlib.h>\n#include <qdeclarativeextensionplugin.h>\n#include <qdeclarativecontext.h>\n#include <qdeclarativeengine.h>\n#include <qdeclarative.h>\n\n#include <QTime>\n#include <QTimer>\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\nclass MinehuntGame : public QObject\n{\n    Q_OBJECT\npublic:\n    MinehuntGame();\n\n    Q_PROPERTY(QDeclarativeListProperty<Tile> tiles READ tiles CONSTANT);\n    QDeclarativeListProperty<Tile> 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 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    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\nvoid tilesPropAppend(QDeclarativeListProperty<Tile>* prop, Tile* value)\n{\n    Q_UNUSED(prop);\n    Q_UNUSED(value);\n    return; \/\/Append not supported\n}\n\nint tilesPropCount(QDeclarativeListProperty<Tile>* prop)\n{\n    return static_cast<QList<Tile*>*>(prop->data)->count();\n}\n\nTile* tilesPropAt(QDeclarativeListProperty<Tile>* prop, int index)\n{\n    return static_cast<QList<Tile*>*>(prop->data)->at(index);\n}\n\nQDeclarativeListProperty<Tile> MinehuntGame::tiles(){\n    return QDeclarativeListProperty<Tile>(this, &_tiles, &tilesPropAppend,\n            &tilesPropCount, &tilesPropAt, 0);\n}\n\nMinehuntGame::MinehuntGame()\n: numCols(9), numRows(9), playing(true), won(false)\n{\n    setObjectName(\"mainObject\");\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}\n\nvoid MinehuntGame::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 MinehuntGame::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 MinehuntGame::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 MinehuntGame::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 MinehuntGame::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\nQML_DECLARE_TYPE(Tile);\nQML_DECLARE_TYPE(MinehuntGame);\n\nclass MinehuntExtensionPlugin : public QDeclarativeExtensionPlugin\n{\n    Q_OBJECT\n\n    public:\n    void registerTypes(const char *uri) {\n        qmlRegisterType<Tile>(uri, 0, 1, \"Tile\");\n        qmlRegisterType<MinehuntGame>(uri, 0, 1, \"Game\");\n    }\n\n    void initializeEngine(QDeclarativeEngine *engine, const char *uri) {\n        Q_UNUSED(uri);\n\n        srand(QTime(0,0,0).secsTo(QTime::currentTime()));\n\n        MinehuntGame* game = new MinehuntGame();\n\n        engine->rootContext()->setContextObject(game);\n    }\n};\n\n#include \"minehunt.moc\"\n\nQ_EXPORT_PLUGIN(MinehuntExtensionPlugin);\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"zcm\/transport.h\"\n#include \"zcm\/transport_registrar.h\"\n#include \"zcm\/transport_register.hpp\"\n\n#include \"zcm\/zcm-cpp.hpp\"\n#include \"zcm\/util\/debug.h\"\n\/\/#include \"zcm\/util\/lockfile.h\"\n\n#include \"util\/Types.hpp\"\n#include \"util\/TimeUtil.hpp\"\n\n#include <cstdio>\n#include <cassert>\n#include <unordered_map>\n#include <mutex>\n#include <unistd.h>\n#include <limits.h>\n\n#define ZCM_TRANS_CLASSNAME TransportFile\n#define MTU (SSIZE_MAX)\n\nusing namespace std;\n\nstruct ZCM_TRANS_CLASSNAME : public zcm_trans_t\n{\n    zcm::LogFile *log = nullptr;\n    unordered_map<string, string> options;\n\n    string mode = \"r\";\n    double speed = 1.0;\n\n    u64 lastMsgUtime = 0;\n    u64 lastDispatchUtime = 0;\n\n    string *findOption(const string& s)\n    {\n        auto it = options.find(s);\n        if (it == options.end()) return nullptr;\n        return &it->second;\n    }\n\n    ZCM_TRANS_CLASSNAME(zcm_url_t *url)\n    {\n        trans_type = ZCM_BLOCKING;\n        vtbl = &methods;\n\n        \/\/ build 'options'\n        auto *opts = zcm_url_opts(url);\n        for (size_t i = 0; i < opts->numopts; i++)\n            options[opts->name[i]] = opts->value[i];\n\n        string* speedStr = findOption(\"speed\");\n        if (speedStr) {\n            speed = atof(speedStr->c_str());\n            if (speed <= 0) {\n                ZCM_DEBUG(\"Expected double argument for 'speed'\");\n                return;\n            }\n        }\n\n        string* modeStr = findOption(\"mode\");\n        if (modeStr) {\n            mode = string(*modeStr);\n            if (!(mode == \"r\" || mode == \"w\" || mode == \"a\")) {\n                ZCM_DEBUG(\"Expected r|w|a as mode argument for zcm file\");\n                return;\n            }\n        }\n\n        auto filename = zcm_url_address(url);\n        ZCM_DEBUG(\"Opening zcm logfile: \\\"%s\\\"\", filename);\n        log = new zcm::LogFile(filename, string(mode));\n        if (!log->good()) {\n            fprintf(stderr, \"Unable to open logfile %s\\n\", filename);\n            return;\n        }\n    }\n\n    ~ZCM_TRANS_CLASSNAME()\n    {\n        if (log) delete log;\n    }\n\n    bool good()\n    {\n        return log ? log->good() : false;\n    }\n\n    \/********************** METHODS **********************\/\n    size_t get_mtu()\n    {\n        return MTU;\n    }\n\n    \/\/ TODO: Test the sendmsg function\n    int sendmsg(zcm_msg_t msg)\n    {\n        assert(good());\n        assert(mode == \"w\" || mode == \"a\");\n\n        if (msg.len > get_mtu())\n            return ZCM_EINVALID;\n\n        zcm::LogEvent le;\n        le.timestamp = msg.utime;\n        le.datalen = msg.len;\n        le.channel = string(msg.channel);\n        le.data = msg.buf;\n\n        log->writeEvent(&le);\n\n        return ZCM_EOK;\n    }\n\n    int recvmsg_enable(const char *channel, bool enable)\n    {\n        return ZCM_EOK;\n    }\n\n    int recvmsg(zcm_msg_t *msg, int timeout)\n    {\n        assert(mode == \"r\");\n        if (!good()) {\n            \/\/ TODO Build in a way for a transport to tell zcm that an \"error\"\n            \/\/      has occurred. Not sure what to do here since this function\n            \/\/      has no way of communicating to the caller that this function\n            \/\/      shouldn't be called anymore\n            usleep(timeout);\n            return ZCM_ECONNECT;\n        }\n\n        const zcm::LogEvent* le = log->readNextEvent();\n        if (!le) {\n            delete log;\n            log = nullptr;\n            return ZCM_ECONNECT;\n        }\n\n        msg->utime = le->timestamp;\n        msg->channel = le->channel.c_str();\n        msg->len = le->datalen;\n        msg->buf = le->data;\n\n        u64 now = TimeUtil::utime();\n\n        if (lastMsgUtime == 0)\n            lastMsgUtime = msg->utime;\n\n        if (lastDispatchUtime == 0)\n            lastDispatchUtime = now;\n\n        u64 localDiff = now - lastDispatchUtime;\n        u64 logDiff = msg->utime - lastMsgUtime;\n        u64 logDiffSpeed = logDiff \/ this->speed;\n        u64 diff = logDiffSpeed > localDiff ? logDiffSpeed - localDiff : 0;\n\n        if (diff > 0)\n            usleep(diff);\n\n        lastDispatchUtime = TimeUtil::utime();\n        lastMsgUtime = msg->utime;\n\n        return ZCM_EOK;\n    }\n\n    \/********************** STATICS **********************\/\n    static zcm_trans_methods_t methods;\n    static ZCM_TRANS_CLASSNAME *cast(zcm_trans_t *zt)\n    {\n        assert(zt->vtbl == &methods);\n        return (ZCM_TRANS_CLASSNAME*)zt;\n    }\n\n    static size_t _get_mtu(zcm_trans_t *zt)\n    { return cast(zt)->get_mtu(); }\n\n    static int _sendmsg(zcm_trans_t *zt, zcm_msg_t msg)\n    { return cast(zt)->sendmsg(msg); }\n\n    static int _recvmsg_enable(zcm_trans_t *zt, const char *channel, bool enable)\n    { return cast(zt)->recvmsg_enable(channel, enable); }\n\n    static int _recvmsg(zcm_trans_t *zt, zcm_msg_t *msg, int timeout)\n    { return cast(zt)->recvmsg(msg, timeout); }\n\n    static void _destroy(zcm_trans_t *zt)\n    { delete cast(zt); }\n\n    static const TransportRegister reg;\n};\n\nzcm_trans_methods_t ZCM_TRANS_CLASSNAME::methods = {\n    &ZCM_TRANS_CLASSNAME::_get_mtu,\n    &ZCM_TRANS_CLASSNAME::_sendmsg,\n    &ZCM_TRANS_CLASSNAME::_recvmsg_enable,\n    &ZCM_TRANS_CLASSNAME::_recvmsg,\n    NULL,\n    &ZCM_TRANS_CLASSNAME::_destroy,\n};\n\nstatic zcm_trans_t *create(zcm_url_t *url)\n{\n    auto *trans = new ZCM_TRANS_CLASSNAME(url);\n    if (trans->good())\n        return trans;\n\n    delete trans;\n    return nullptr;\n}\n\nconst TransportRegister ZCM_TRANS_CLASSNAME::reg(\n    \"file\", \"Interact with zcm log file (e.g. 'file:\/\/vehicle.log?speed=2.0)\", create);\n<commit_msg>Removed comment<commit_after>#include \"zcm\/transport.h\"\n#include \"zcm\/transport_registrar.h\"\n#include \"zcm\/transport_register.hpp\"\n\n#include \"zcm\/zcm-cpp.hpp\"\n#include \"zcm\/util\/debug.h\"\n\/\/#include \"zcm\/util\/lockfile.h\"\n\n#include \"util\/Types.hpp\"\n#include \"util\/TimeUtil.hpp\"\n\n#include <cstdio>\n#include <cassert>\n#include <unordered_map>\n#include <mutex>\n#include <unistd.h>\n#include <limits.h>\n\n#define ZCM_TRANS_CLASSNAME TransportFile\n#define MTU (SSIZE_MAX)\n\nusing namespace std;\n\nstruct ZCM_TRANS_CLASSNAME : public zcm_trans_t\n{\n    zcm::LogFile *log = nullptr;\n    unordered_map<string, string> options;\n\n    string mode = \"r\";\n    double speed = 1.0;\n\n    u64 lastMsgUtime = 0;\n    u64 lastDispatchUtime = 0;\n\n    string *findOption(const string& s)\n    {\n        auto it = options.find(s);\n        if (it == options.end()) return nullptr;\n        return &it->second;\n    }\n\n    ZCM_TRANS_CLASSNAME(zcm_url_t *url)\n    {\n        trans_type = ZCM_BLOCKING;\n        vtbl = &methods;\n\n        \/\/ build 'options'\n        auto *opts = zcm_url_opts(url);\n        for (size_t i = 0; i < opts->numopts; i++)\n            options[opts->name[i]] = opts->value[i];\n\n        string* speedStr = findOption(\"speed\");\n        if (speedStr) {\n            speed = atof(speedStr->c_str());\n            if (speed <= 0) {\n                ZCM_DEBUG(\"Expected double argument for 'speed'\");\n                return;\n            }\n        }\n\n        string* modeStr = findOption(\"mode\");\n        if (modeStr) {\n            mode = string(*modeStr);\n            if (!(mode == \"r\" || mode == \"w\" || mode == \"a\")) {\n                ZCM_DEBUG(\"Expected r|w|a as mode argument for zcm file\");\n                return;\n            }\n        }\n\n        auto filename = zcm_url_address(url);\n        ZCM_DEBUG(\"Opening zcm logfile: \\\"%s\\\"\", filename);\n        log = new zcm::LogFile(filename, string(mode));\n        if (!log->good()) {\n            fprintf(stderr, \"Unable to open logfile %s\\n\", filename);\n            return;\n        }\n    }\n\n    ~ZCM_TRANS_CLASSNAME()\n    {\n        if (log) delete log;\n    }\n\n    bool good()\n    {\n        return log ? log->good() : false;\n    }\n\n    \/********************** METHODS **********************\/\n    size_t get_mtu()\n    {\n        return MTU;\n    }\n\n    int sendmsg(zcm_msg_t msg)\n    {\n        assert(good());\n        assert(mode == \"w\" || mode == \"a\");\n\n        if (msg.len > get_mtu())\n            return ZCM_EINVALID;\n\n        zcm::LogEvent le;\n        le.timestamp = msg.utime;\n        le.datalen = msg.len;\n        le.channel = string(msg.channel);\n        le.data = msg.buf;\n\n        log->writeEvent(&le);\n\n        return ZCM_EOK;\n    }\n\n    int recvmsg_enable(const char *channel, bool enable)\n    {\n        return ZCM_EOK;\n    }\n\n    int recvmsg(zcm_msg_t *msg, int timeout)\n    {\n        assert(mode == \"r\");\n        if (!good()) {\n            \/\/ TODO Build in a way for a transport to tell zcm that an \"error\"\n            \/\/      has occurred. Not sure what to do here since this function\n            \/\/      has no way of communicating to the caller that this function\n            \/\/      shouldn't be called anymore\n            usleep(timeout);\n            return ZCM_ECONNECT;\n        }\n\n        const zcm::LogEvent* le = log->readNextEvent();\n        if (!le) {\n            delete log;\n            log = nullptr;\n            return ZCM_ECONNECT;\n        }\n\n        msg->utime = le->timestamp;\n        msg->channel = le->channel.c_str();\n        msg->len = le->datalen;\n        msg->buf = le->data;\n\n        u64 now = TimeUtil::utime();\n\n        if (lastMsgUtime == 0)\n            lastMsgUtime = msg->utime;\n\n        if (lastDispatchUtime == 0)\n            lastDispatchUtime = now;\n\n        u64 localDiff = now - lastDispatchUtime;\n        u64 logDiff = msg->utime - lastMsgUtime;\n        u64 logDiffSpeed = logDiff \/ this->speed;\n        u64 diff = logDiffSpeed > localDiff ? logDiffSpeed - localDiff : 0;\n\n        if (diff > 0)\n            usleep(diff);\n\n        lastDispatchUtime = TimeUtil::utime();\n        lastMsgUtime = msg->utime;\n\n        return ZCM_EOK;\n    }\n\n    \/********************** STATICS **********************\/\n    static zcm_trans_methods_t methods;\n    static ZCM_TRANS_CLASSNAME *cast(zcm_trans_t *zt)\n    {\n        assert(zt->vtbl == &methods);\n        return (ZCM_TRANS_CLASSNAME*)zt;\n    }\n\n    static size_t _get_mtu(zcm_trans_t *zt)\n    { return cast(zt)->get_mtu(); }\n\n    static int _sendmsg(zcm_trans_t *zt, zcm_msg_t msg)\n    { return cast(zt)->sendmsg(msg); }\n\n    static int _recvmsg_enable(zcm_trans_t *zt, const char *channel, bool enable)\n    { return cast(zt)->recvmsg_enable(channel, enable); }\n\n    static int _recvmsg(zcm_trans_t *zt, zcm_msg_t *msg, int timeout)\n    { return cast(zt)->recvmsg(msg, timeout); }\n\n    static void _destroy(zcm_trans_t *zt)\n    { delete cast(zt); }\n\n    static const TransportRegister reg;\n};\n\nzcm_trans_methods_t ZCM_TRANS_CLASSNAME::methods = {\n    &ZCM_TRANS_CLASSNAME::_get_mtu,\n    &ZCM_TRANS_CLASSNAME::_sendmsg,\n    &ZCM_TRANS_CLASSNAME::_recvmsg_enable,\n    &ZCM_TRANS_CLASSNAME::_recvmsg,\n    NULL,\n    &ZCM_TRANS_CLASSNAME::_destroy,\n};\n\nstatic zcm_trans_t *create(zcm_url_t *url)\n{\n    auto *trans = new ZCM_TRANS_CLASSNAME(url);\n    if (trans->good())\n        return trans;\n\n    delete trans;\n    return nullptr;\n}\n\nconst TransportRegister ZCM_TRANS_CLASSNAME::reg(\n    \"file\", \"Interact with zcm log file (e.g. 'file:\/\/vehicle.log?speed=2.0)\", create);\n<|endoftext|>"}
{"text":"<commit_before>#include \"perf_precomp.hpp\"\n#include \"distransform.cpp\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace perf;\n\ntypedef perf::TestBaseWithParam<Size> Size_DistanceTransform;\n\n\/*PERF_TEST_P(Size_DistanceTransform, icvTrueDistTrans, testing::Values(TYPICAL_MAT_SIZES))\n{\n    Size size = GetParam();\n    Mat src(size, CV_8UC1);\n    Mat dst(size, CV_32FC1);\n    CvMat srcStub = src;\n    CvMat dstStub = dst;\n\n    declare.in(src, WARMUP_RNG).out(dst);\n\n    TEST_CYCLE() icvTrueDistTrans(&srcStub, &dstStub);\n\n    SANITY_CHECK(dst, 1);\n}*\/\n<commit_msg>disabled whole perf test for distance transform<commit_after>\/*#include \"perf_precomp.hpp\"\n#include \"distransform.cpp\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace perf;\n\ntypedef perf::TestBaseWithParam<Size> Size_DistanceTransform;\n\nPERF_TEST_P(Size_DistanceTransform, icvTrueDistTrans, testing::Values(TYPICAL_MAT_SIZES))\n{\n    Size size = GetParam();\n    Mat src(size, CV_8UC1);\n    Mat dst(size, CV_32FC1);\n    CvMat srcStub = src;\n    CvMat dstStub = dst;\n\n    declare.in(src, WARMUP_RNG).out(dst);\n\n    TEST_CYCLE() icvTrueDistTrans(&srcStub, &dstStub);\n\n    SANITY_CHECK(dst, 1);\n}*\/\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SAPLIST_HPP\n#define SAPLIST_HPP 1\n\n#include <functional>\n#include <map>\n#include <typeinfo>\n#include <climits>\n#include \"CollisionManager.hpp\"\n\nclass Collisionable {\nprotected: int x, y, w, h;\npublic: Collisionable(int x=0, int y=0, int w=0, int h=0) :\n    x(x), y(y), w(w), h(h){}\n};\n\nclass SAPList : public CollisionManager<Collisionable> {\n\n    class EndPoint;\n\n    class AABB {\n    public:\n        \/** min\/max\n         *  - first is x axis\n         *  - second is y axis *\/\n        EndPoint * min[2];\n        EndPoint * max[2];\n\n        size_t typeId; \/* Need to use std::type_info::hash_code() *\/\n        void * owner;\n    };\n\n    \/**\n     * TODO:\n     * - Optimize merging isMin boolean into another member\n     *   (as a flag)\n     * - Using doubly-linked list could waste memory but is easier to implement\n     *   than arrays.\n     * - Implement pair manager\n     *\/\n    class EndPoint {\n    public:\n        AABB * owner;\n        int value;\n        bool isMin;\n\n        EndPoint * prev;\n        EndPoint * next;\n\n        EndPoint (AABB* o,int v,bool m,EndPoint* p,EndPoint* n) : \n            owner(o), value(v), isMin(m), prev(p), next(n) {}\n        ~EndPoint () {}\n    };\n\n\n    \/**\n     * Action manager stores actions to perform on collision or separation\n     * of two objects depending on their type\n     * It also stores default actions to execute if no specific action is\n     * defined for two types.\n     *\/\n    class ActionManager {\n    public:\n        std::map < std::pair < size_t,size_t >,\n                   std::pair < std::function < void (void *, void *) >,\n                               std::function < void (void *, void *) > > > \n        actions;\n \n        std::function < void (void *, void *) >\n        onCollision(size_t t1, size_t t2) {\n            return this\n                ->actions[std::pair<size_t, size_t>(t1,t2)].first;\n        }\n    \n        std::function < void (void *, void *) >\n        onSeparation(size_t t1, size_t t2) {\n            return this\n                ->actions[std::pair<size_t, size_t>(t1,t2)].second;\n        }\n    };\n\n\nprivate:\n\n    EndPoint * xAxis;\n    EndPoint * yAxis;\n    ActionManager actions;\n\n    void swap(EndPoint * p1, EndPoint * p2) {\n        p2->next->prev = p1;\n        p1->next = p2->next;\n        p1->prev->next = p2;\n        p1->prev = p2;\n        p2->next = p1;\n    }\n\n    \/* check on one axis *\/\n    inline bool partialCollisionCheck(const AABB & b1,\n                                      const AABB & b2,\n                                      int dim) {\n        return (b1.max[dim] <= b2.max[dim] && b1.max[dim] >= b2.min[dim])\n            || (b1.min[dim] >= b2.min[dim] && b1.max[dim] <= b2.max[dim]);\n    }\n\n    bool collisionCheck(const AABB & b1, const AABB & b2) {\n        return partialCollisionCheck (b1, b2, 0)\n            && partialCollisionCheck (b1, b2, 1);\n    }\n\n    void updateEndPoint(EndPoint * pt) {\n        \n         auto aux =\n            [&pt, this]\n            (std::function<EndPoint*(EndPoint*)>succ,\n             std::function<bool(int,int)>loop_cond,\n             std::function<bool(EndPoint*,EndPoint*)>mustAdd,\n             std::function<bool(EndPoint*,EndPoint*)>mustRm) {\n            \n            EndPoint * tmp = succ(pt);\n            \n            while (loop_cond(tmp->value, pt->value)) {\n                this->swap(tmp, pt);\n                if (mustAdd(pt, tmp)) {\n                    if (this->collisionCheck(*(pt->owner), *(tmp->owner))) {\n                    this->actions.onCollision\n                        (pt->owner->typeId, tmp->owner->typeId)\n                        (pt->owner->owner, tmp->owner->owner);\n                    }\n                } else if (mustRm(pt, tmp)) {\n                    this->actions.onSeparation\n                        (pt->owner->typeId,tmp->owner->typeId)\n                        (pt->owner->owner, tmp->owner->owner);\n                }\n            }\n        };\n\n        \/** TODO: use aux to update on x and y axis *\/\n\n    }\n    \npublic:\n\n    SAPList () {\n        \/* not sure about the true\/false values *\/\n        xAxis = new EndPoint(NULL, INT_MIN, true, NULL, NULL);\n        xAxis->next = new EndPoint(NULL, INT_MAX, false, xAxis, NULL);\n        yAxis = new EndPoint(NULL, INT_MIN, true, NULL, NULL);\n        yAxis->next = new EndPoint(NULL, INT_MAX, false, yAxis, NULL);\n    }\n\n    void addObject(const Collisionable &) {}\n    void updateObject(const Collisionable &) {}\n    void removeObject(const Collisionable &) {}\n};\n\n#endif\n<commit_msg>EndPoint and SAPList destructors added.<commit_after>#ifndef SAPLIST_HPP\n#define SAPLIST_HPP 1\n\n#include <functional>\n#include <map>\n#include <typeinfo>\n#include <climits>\n#include \"CollisionManager.hpp\"\n\nclass Collisionable {\nprotected: int x, y, w, h;\npublic: Collisionable(int x=0, int y=0, int w=0, int h=0) :\n    x(x), y(y), w(w), h(h) {}\n};\n\nclass SAPList : public CollisionManager<Collisionable> {\n\n    class EndPoint;\n\n    class AABB {\n    public:\n        \/** min\/max\n         *  - first is x axis\n         *  - second is y axis *\/\n        EndPoint * min[2];\n        EndPoint * max[2];\n\n        size_t typeId; \/* Need to use std::type_info::hash_code() *\/\n        void * owner;\n    };\n\n    \/**\n     * TODO:\n     * - Optimize merging isMin boolean into another member\n     *   (as a flag)\n     * - Using doubly-linked list could waste memory but is easier to implement\n     *   than arrays.\n     * - Implement pair manager\n     *\/\n    class EndPoint {\n    public:\n        AABB * owner;\n        int value;\n        bool isMin;\n\n        EndPoint * prev;\n        EndPoint * next;\n\n        EndPoint (AABB* o,int v,bool m,EndPoint* p,EndPoint* n) : \n            owner(o), value(v), isMin(m), prev(p), next(n) {}\n\n        \/** When and EndPoint is destroyed, it updates prev and next *\/\n        ~EndPoint () {\n            if (this->prev != NULL) {\n                this->prev->next = this->next;\n            }\n            if (this->next != NULL)\n                this->next->prev = this->prev;\n        }\n    };\n\n\n    \/**\n     * Action manager stores actions to perform on collision or separation\n     * of two objects depending on their type\n     * It also stores default actions to execute if no specific action is\n     * defined for two types.\n     *\/\n    class ActionManager {\n    public:\n        std::map < std::pair < size_t,size_t >,\n                   std::pair < std::function < void (void *, void *) >,\n                               std::function < void (void *, void *) > > > \n        actions;\n \n        std::function < void (void *, void *) >\n        onCollision(size_t t1, size_t t2) {\n            return this\n                ->actions[std::pair<size_t, size_t>(t1,t2)].first;\n        }\n    \n        std::function < void (void *, void *) >\n        onSeparation(size_t t1, size_t t2) {\n            return this\n                ->actions[std::pair<size_t, size_t>(t1,t2)].second;\n        }\n    };\n\n\nprivate:\n\n    EndPoint * xAxis;\n    EndPoint * yAxis;\n    ActionManager actions;\n\n    void swap(EndPoint * p1, EndPoint * p2) {\n        p2->next->prev = p1;\n        p1->next = p2->next;\n        p1->prev->next = p2;\n        p1->prev = p2;\n        p2->next = p1;\n    }\n\n    \/* check on one axis *\/\n    inline bool partialCollisionCheck(const AABB & b1,\n                                      const AABB & b2,\n                                      int dim) {\n        return (b1.max[dim] <= b2.max[dim] && b1.max[dim] >= b2.min[dim])\n            || (b1.min[dim] >= b2.min[dim] && b1.max[dim] <= b2.max[dim]);\n    }\n\n    bool collisionCheck(const AABB & b1, const AABB & b2) {\n        return partialCollisionCheck (b1, b2, 0)\n            && partialCollisionCheck (b1, b2, 1);\n    }\n\n    void updateEndPoint(EndPoint * pt) {\n        \n         auto aux =\n            [&pt, this]\n            (std::function<EndPoint*(EndPoint*)>succ,\n             std::function<bool(int,int)>loop_cond,\n             std::function<bool(EndPoint*,EndPoint*)>mustAdd,\n             std::function<bool(EndPoint*,EndPoint*)>mustRm) {\n            \n            EndPoint * tmp = succ(pt);\n            \n            while (loop_cond(tmp->value, pt->value)) {\n                this->swap(tmp, pt);\n                if (mustAdd(pt, tmp)) {\n                    if (this->collisionCheck(*(pt->owner), *(tmp->owner))) {\n                    this->actions.onCollision\n                        (pt->owner->typeId, tmp->owner->typeId)\n                        (pt->owner->owner, tmp->owner->owner);\n                    }\n                } else if (mustRm(pt, tmp)) {\n                    this->actions.onSeparation\n                        (pt->owner->typeId,tmp->owner->typeId)\n                        (pt->owner->owner, tmp->owner->owner);\n                }\n            }\n        };\n\n        \/** TODO: use aux to update on x and y axis *\/\n\n    }\n    \npublic:\n\n    SAPList () {\n        \/* not sure about the true\/false values *\/\n        xAxis = new EndPoint(NULL, INT_MIN, true, NULL, NULL);\n        xAxis->next = new EndPoint(NULL, INT_MAX, false, xAxis, NULL);\n        yAxis = new EndPoint(NULL, INT_MIN, true, NULL, NULL);\n        yAxis->next = new EndPoint(NULL, INT_MAX, false, yAxis, NULL);\n    }\n\n    ~SAPList () {\n\n        while (xAxis->next != NULL) {\n            delete xAxis->next;\n        } delete xAxis;\n\n        while (yAxis->next != NULL) {\n            delete yAxis->next;\n        } delete yAxis;\n    }\n\n    void addObject(const Collisionable &) {}\n    void updateObject(const Collisionable &) {}\n    void removeObject(const Collisionable &) {}\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * 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\n#include <folly\/experimental\/symbolizer\/StackTrace.h>\n#include <folly\/experimental\/symbolizer\/Symbolizer.h>\n#include <folly\/fibers\/FiberManager.h>\n#include <folly\/fibers\/SimpleLoopController.h>\n#include <folly\/init\/Init.h>\n\n#include <folly\/portability\/GTest.h>\n\nusing namespace folly::fibers;\nusing namespace folly::symbolizer;\n\nconstexpr size_t kMaxAddresses = 1000;\n\nvoid fBaseline(FrameArray<kMaxAddresses>& \/* unused *\/) {\n  auto ffa = std::make_unique<FrameArray<kMaxAddresses>>();\n  (void)ffa;\n}\n\nvoid fStack(FrameArray<kMaxAddresses>& fa) {\n  auto ffa = std::make_unique<FrameArray<kMaxAddresses>>();\n  (void)ffa;\n  getStackTrace(fa);\n}\n\nvoid fHeap(FrameArray<kMaxAddresses>& fa) {\n  auto ffa = std::make_unique<FrameArray<kMaxAddresses>>();\n  (void)ffa;\n  getStackTraceHeap(fa);\n}\n\n\/\/ Check that the requires stacks for capturing a stack trace do not\n\/\/ exceed reasonable levels surprisingly.\nTEST(StackTraceSizeLimitTest, FiberLimit) {\n  FiberManager::Options opts;\n  opts.recordStackEvery = 1;\n\n  auto t = [&](folly::Function<void(FrameArray<kMaxAddresses>&)> f,\n               size_t highWaterMark) {\n    FiberManager manager(std::make_unique<SimpleLoopController>(), opts);\n    auto& loopController =\n        dynamic_cast<SimpleLoopController&>(manager.loopController());\n\n    bool checkRan = false;\n    FrameArray<kMaxAddresses> fa;\n    manager.addTask([&] {\n      checkRan = true;\n      f(fa);\n    });\n\n    EXPECT_EQ(manager.stackHighWatermark(), 0);\n\n    loopController.loop([&]() { loopController.stop(); });\n\n    EXPECT_LE(manager.stackHighWatermark(), highWaterMark);\n\n    EXPECT_TRUE(checkRan);\n  };\n  \/\/ Initial run\n  t(fBaseline, 10000);\n\n#ifdef NDEBUG\n  \/\/ Baseline\n  t(fBaseline, 1600);\n  \/\/ Standard version\n  t(fStack, 6800);\n  \/\/ Heap version\n  t(fHeap, 2200);\n#else\n  \/\/ Values for opt builds\n\n#ifndef FOLLY_SANITIZE_ADDRESS\n  \/\/ Baseline\n  t(fBaseline, 3700);\n  \/\/ Standard version\n  t(fStack, 8000);\n  \/\/ Heap version\n  t(fHeap, 3700);\n#else\n  \/\/ Baseline\n  t(fBaseline, 0);\n  \/\/ Standard version\n  t(fStack, 0);\n  \/\/ Heap version\n  t(fHeap, 0);\n#endif\n#endif\n}\n<commit_msg>Adjust stack limits for StackTraceSizeLimitTest for TSAN.<commit_after>\/*\n * 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\n#include <folly\/experimental\/symbolizer\/StackTrace.h>\n#include <folly\/experimental\/symbolizer\/Symbolizer.h>\n#include <folly\/fibers\/FiberManager.h>\n#include <folly\/fibers\/SimpleLoopController.h>\n#include <folly\/init\/Init.h>\n\n#include <folly\/portability\/GTest.h>\n\nusing namespace folly::fibers;\nusing namespace folly::symbolizer;\n\nconstexpr size_t kMaxAddresses = 1000;\n\nvoid fBaseline(FrameArray<kMaxAddresses>& \/* unused *\/) {\n  auto ffa = std::make_unique<FrameArray<kMaxAddresses>>();\n  (void)ffa;\n}\n\nvoid fStack(FrameArray<kMaxAddresses>& fa) {\n  auto ffa = std::make_unique<FrameArray<kMaxAddresses>>();\n  (void)ffa;\n  getStackTrace(fa);\n}\n\nvoid fHeap(FrameArray<kMaxAddresses>& fa) {\n  auto ffa = std::make_unique<FrameArray<kMaxAddresses>>();\n  (void)ffa;\n  getStackTraceHeap(fa);\n}\n\n\/\/ Check that the requires stacks for capturing a stack trace do not\n\/\/ exceed reasonable levels surprisingly.\nTEST(StackTraceSizeLimitTest, FiberLimit) {\n  FiberManager::Options opts;\n  opts.recordStackEvery = 1;\n\n  auto t = [&](folly::Function<void(FrameArray<kMaxAddresses>&)> f,\n               size_t highWaterMark) {\n    FiberManager manager(std::make_unique<SimpleLoopController>(), opts);\n    auto& loopController =\n        dynamic_cast<SimpleLoopController&>(manager.loopController());\n\n    bool checkRan = false;\n    FrameArray<kMaxAddresses> fa;\n    manager.addTask([&] {\n      checkRan = true;\n      f(fa);\n    });\n\n    EXPECT_EQ(manager.stackHighWatermark(), 0);\n\n    loopController.loop([&]() { loopController.stop(); });\n\n    EXPECT_LE(manager.stackHighWatermark(), highWaterMark);\n\n    EXPECT_TRUE(checkRan);\n  };\n  \/\/ Initial run\n  t(fBaseline, 10000);\n\n  \/\/ The amount of stack needed varies based on compilation modes.\n  if (folly::kIsDebug) {\n    if (folly::kIsSanitizeAddress) {\n      t(fBaseline, 0);\n      t(fStack, 0);\n      t(fHeap, 0);\n    } else if (folly::kIsSanitizeThread) {\n      t(fBaseline, 3700);\n      t(fStack, 9000);\n      t(fHeap, 5000);\n    } else {\n      t(fBaseline, 3700);\n      t(fStack, 8000);\n      t(fHeap, 3700);\n    }\n  } else {\n    if (folly::kIsSanitizeThread) {\n      t(fBaseline, 2500);\n      t(fStack, 6800);\n      t(fHeap, 3500);\n    } else {\n      t(fBaseline, 1600);\n      t(fStack, 6800);\n      t(fHeap, 2200);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  branching_process_covid19.cpp\n\/\/  EpiGenMCMC\n\/\/\n\/\/  Created by Lucy Li on Feb 28, 2020\n\/\/\n\n#include <stdio.h>\n#include \"..\/model.h\"\n\n\n\nvoid Model::set_custom_prob(double alpha, double scale) {\n    custom_prob.resize(0);\n    double w;\n    for (int i=0; i<5000; ++i) {\n        w = gsl_ran_gamma(model_rng, alpha, scale);\n        custom_prob.push_back(w);\n    }\n}\n\nvoid Model::simulate(std::vector<double> & model_params, std::vector<std::string> & param_names, Trajectory * traj, int start_dt, int end_dt, double step_size, int total_dt, gsl_rng * rng) {\n    if ((traj->get_state(0)+traj->get_state(1)) < 1.0) {\n        return;\n    }\n    \/\/ \/* For slightly faster implementation, call parameters by index\n    int R0_array_size = 7;\n    int R0_array[R0_array_size];\n    std::copy(model_params.begin(), model_params.begin()+R0_array_size, R0_array);\n    int R0_change_times[R0_array_size-1];\n    std::copy(model_params.begin()+8, model_params.begin()+8+R0_array_size-1, R0_change_times);\n    double cv = model_params[7];\n    double alpha = model_params[27];\n    double scale = model_params[28];\n    double Re = 0.0;\n    double recoveries=0.0;\n    double new_infections=0.0;\n    double durI = 0.0;\n    double curr_coal_rate = 0.0;\n    if (custom_prob.size()<1000) {\n        model_rng = rng;\n        set_custom_prob(alpha, scale);\n    }\n    int ran_num = (int)gsl_ran_flat(rng, 0, custom_prob.size());\n    if (start_dt < step_size) {  \/\/ Set initial number of infected\n        traj->resize_recoveries(total_dt+1);\n        int init_inf = (int)round(model_params[29]);\n        traj->set_state(init_inf, 0);\n        for (int i=0; i!=init_inf; ++i) {\n            durI = custom_prob[ran_num];\n            ++ran_num;\n            if (ran_num == custom_prob.size()) ran_num=0;\n            durI = (int)(durI\/step_size);\n            traj->add_recovery_time(durI);\n        }\n    }\n    \/\/ *\/\n    double num_infected = traj->get_state(0);\n    bool Re_found = false;\n    for (int t=start_dt; t<end_dt; ++t) {\n        \/\/\n        \/\/ Transitions\n        \/\/\n        Re_found = false;\n        for (int R0_i=0; R0_i<(R0_array_size-1); R0_i++) {\n            if (t < R0_change_times[R0_i]) {\n                Re = R0_array[R0_i];\n                Re_found = true;\n                break;\n            }\n        }\n        if (!Re_found) {\n            Re = R0_array[R0_array_size-1];\n            Re_found = true;\n        }\n        double k = Re\/(cv-1);\n        \/\/ Recoveries: I --> R\n        recoveries = traj->num_recover_at(t-start_dt);\n        \/\/ if (recoveries > 3000) { \/\/ Assume that if more than 3000 people recover within a day, then the epidemic is too large.\n        \/\/     num_infected = 0.0;\n        \/\/ }\n        if (recoveries > 0) {\n            traj->set_traj(0, recoveries, t-start_dt);\n            new_infections = gsl_ran_negative_binomial(rng, k\/(k+Re), k*recoveries);\n            if (new_infections > 0) {\n                for (int i=0; i!=new_infections; ++i) {\n                    durI = custom_prob[ran_num];\n                    ++ran_num;\n                    if (ran_num == custom_prob.size()) ran_num=0;\n                    durI = (int)(durI\/step_size);\n                    traj->add_recovery_time(durI+t-start_dt);\n                }\n            }\n            \/\/            traj->set_state(traj->get_state(0)+new_infections-recoveries, 0);\n            num_infected += new_infections - recoveries;\n        }\n        \/\/ Record 1\/N for coalescent rate calculation\n        if (num_infected > 0.0) {\n            traj->set_traj(1, num_infected, t-start_dt);\n            traj->set_traj(2, Re\/(alpha*scale)*(1.0+1.0\/k), t-start_dt);\n        }\n        else {\n            traj->set_traj(1, 0.0, t-start_dt);\n            traj->set_traj(2, 0.0, t-start_dt);\n            break;\n        }\n    }\n    traj->set_state(num_infected, 0);\n    traj->delete_recoveries_before(end_dt-start_dt);\n}\n\n<commit_msg>debugged simulation code<commit_after>\/\/\n\/\/  branching_process_covid19.cpp\n\/\/  EpiGenMCMC\n\/\/\n\/\/  Created by Lucy Li on Feb 28, 2020\n\/\/\n\n#include <stdio.h>\n#include \"..\/model.h\"\n\n\nvoid Model::set_custom_prob(double alpha, double scale) {\n    custom_prob.resize(0);\n    double w;\n    for (int i=0; i<5000; ++i) {\n        w = gsl_ran_gamma(model_rng, alpha, scale);\n        custom_prob.push_back(w);\n    }\n}\n\nvoid Model::simulate(std::vector<double> & model_params, std::vector<std::string> & param_names, Trajectory * traj, int start_dt, int end_dt, double step_size, int total_dt, gsl_rng * rng) {\n    if ((traj->get_state(0)+traj->get_state(1)) < 1.0) {\n        return;\n    }\n    \/\/ \/* For slightly faster implementation, call parameters by index\n    int R0_array_size = 7;\n    double R0_array[R0_array_size];\n    std::copy(model_params.begin(), model_params.begin()+R0_array_size, R0_array);\n    int R0_change_times[R0_array_size-1];\n    std::copy(model_params.begin()+8, model_params.begin()+8+R0_array_size-1, R0_change_times);\n    double cv = model_params[7];\n    double alpha = model_params[27];\n    double scale = model_params[28];\n    double Re = R0_array[0];\n    double recoveries=0.0;\n    double new_infections=0.0;\n    double durI = 0.0;\n    double curr_coal_rate = 0.0;\n    if (custom_prob.size()<1000) {\n        model_rng = rng;\n        set_custom_prob(alpha, scale);\n    }\n    int ran_num = (int)gsl_ran_flat(rng, 0, custom_prob.size());\n    if (start_dt < step_size) {  \/\/ Set initial number of infected\n        traj->resize_recoveries(total_dt+1);\n        int init_inf = (int)round(model_params[29]);\n        traj->set_state(init_inf, 0);\n        for (int i=0; i!=init_inf; ++i) {\n            durI = custom_prob[ran_num];\n            ++ran_num;\n            if (ran_num == custom_prob.size()) ran_num=0;\n            durI = (int)(durI\/step_size);\n            traj->add_recovery_time(durI);\n        }\n    }\n    \/\/ *\/\n    double num_infected = traj->get_state(0);\n    for (int t=start_dt; t<end_dt; ++t) {\n        \/\/\n        \/\/ Transitions\n        \/\/\n        for (int R0_i=0; R0_i<(R0_array_size-1); R0_i++) {\n            if (t >= R0_change_times[R0_i]) {\n                Re = R0_array[R0_i+1];\n            }\n        }\n        double k = Re\/(cv-1);\n        \/\/ Recoveries: I --> R\n        recoveries = traj->num_recover_at(t-start_dt);\n        \/\/ if (recoveries > 3000) { \/\/ Assume that if more than 3000 people recover within a day, then the epidemic is too large.\n        \/\/     num_infected = 0.0;\n        \/\/ }\n        if (recoveries > 0) {\n            traj->set_traj(0, recoveries, t-start_dt);\n            new_infections = gsl_ran_negative_binomial(rng, k\/(k+Re), k*recoveries);\n            if (new_infections > 0) {\n                for (int i=0; i!=new_infections; ++i) {\n                    durI = custom_prob[ran_num];\n                    ++ran_num;\n                    if (ran_num == custom_prob.size()) ran_num=0;\n                    durI = (int)(durI\/step_size);\n                    traj->add_recovery_time(durI+t-start_dt);\n                }\n            }\n            \/\/            traj->set_state(traj->get_state(0)+new_infections-recoveries, 0);\n            num_infected += new_infections - recoveries;\n        }\n        \/\/ Record 1\/N for coalescent rate calculation\n        if (num_infected > 0.0) {\n            traj->set_traj(1, num_infected, t-start_dt);\n            traj->set_traj(2, Re\/(alpha*scale)*(1.0+1.0\/k), t-start_dt);\n        }\n        else {\n            traj->set_traj(1, 0.0, t-start_dt);\n            traj->set_traj(2, 0.0, t-start_dt);\n            break;\n        }\n    }\n    traj->set_state(num_infected, 0);\n    traj->delete_recoveries_before(end_dt-start_dt);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n Module:       FGActuator.cpp\n Author:       Jon Berndt\n Date started: 21 February 2006\n\n ------------- Copyright (C) 2007 Jon S. Berndt (jon@jsbsim.org) -------------\n\n This program is free software; you can redistribute it and\/or modify it under\n the terms of the GNU Lesser 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 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 Lesser General Public License for more\n details.\n\n You should have received a copy of the GNU Lesser General Public License along with\n this program; if not, write to the Free Software Foundation, Inc., 59 Temple\n Place - Suite 330, Boston, MA  02111-1307, USA.\n\n Further information about the GNU Lesser General Public License can also be found on\n the world wide web at http:\/\/www.gnu.org.\n\nFUNCTIONAL DESCRIPTION\n--------------------------------------------------------------------------------\n\nHISTORY\n--------------------------------------------------------------------------------\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nCOMMENTS, REFERENCES,  and NOTES\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nINCLUDES\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\n#include \"FGActuator.h\"\n\nusing namespace std;\n\nnamespace JSBSim {\n\nstatic const char *IdSrc = \"$Id: FGActuator.cpp,v 1.18 2011\/05\/13 17:14:47 bcoconni Exp $\";\nstatic const char *IdHdr = ID_ACTUATOR;\n\n\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nCLASS IMPLEMENTATION\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\n\nFGActuator::FGActuator(FGFCS* fcs, Element* element) : FGFCSComponent(fcs, element)\n{\n  double denom;\n\n  \/\/ inputs are read from the base class constructor\n\n  PreviousOutput = 0.0;\n  PreviousHystOutput = 0.0;\n  PreviousRateLimOutput = 0.0;\n  PreviousLagInput = PreviousLagOutput = 0.0;\n  bias = lag = hysteresis_width = deadband_width = 0.0;\n  rate_limit = 0.0; \/\/ no limit\n  fail_zero = fail_hardover = fail_stuck = false;\n  ca = cb = 0.0;\n\n  if ( element->FindElement(\"deadband_width\") ) {\n    deadband_width = element->FindElementValueAsNumber(\"deadband_width\");\n  }\n  if ( element->FindElement(\"hysteresis_width\") ) {\n    hysteresis_width = element->FindElementValueAsNumber(\"hysteresis_width\");\n  }\n  if ( element->FindElement(\"rate_limit\") ) {\n    rate_limit = element->FindElementValueAsNumber(\"rate_limit\");\n  }\n  if ( element->FindElement(\"bias\") ) {\n    bias = element->FindElementValueAsNumber(\"bias\");\n  }\n  if ( element->FindElement(\"lag\") ) {\n    lag = element->FindElementValueAsNumber(\"lag\");\n    denom = 2.00 + dt*lag;\n    ca = dt*lag \/ denom;\n    cb = (2.00 - dt*lag) \/ denom;\n  }\n\n  FGFCSComponent::bind();\n  bind();\n\n  Debug(0);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGActuator::~FGActuator()\n{\n  Debug(1);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nbool FGActuator::Run(void )\n{\n  Input = InputNodes[0]->getDoubleValue() * InputSigns[0];\n\n  if (fail_zero) Input = 0;\n  if (fail_hardover) Input =  clipmax*sign(Input);\n\n  Output = Input; \/\/ Perfect actuator. At this point, if no failures are present\n                  \/\/ and no subsequent lag, limiting, etc. is done, the output\n                  \/\/ is simply the input. If any further processing is done\n                  \/\/ (below) such as lag, rate limiting, hysteresis, etc., then\n                  \/\/ the Input will be further processed and the eventual Output\n                  \/\/ will be overwritten from this perfect value.\n\n  if (!fcs->GetTrimStatus()) {\n    if (lag != 0.0)              Lag();        \/\/ models actuator lag\n    if (rate_limit != 0)         RateLimit();  \/\/ limit the actuator rate\n  }\n  if (deadband_width != 0.0)   Deadband();\n  if (!fcs->GetTrimStatus() && hysteresis_width != 0.0) Hysteresis();\n  if (bias != 0.0)             Bias();       \/\/ models a finite bias\n\n  if (fail_stuck) Output = PreviousOutput;\n  PreviousOutput = Output; \/\/ previous value needed for \"stuck\" malfunction\n\n  if (fcs->GetTrimStatus()) {\n    PreviousHystOutput = Output;\n    PreviousRateLimOutput = Output;\n    PreviousLagInput = Output;\n    PreviousLagOutput = Output;\n  }\n\n  Clip();\n  if (IsOutput) SetOutput();\n\n  return true;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::Bias(void)\n{\n  Output += bias;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::Lag(void)\n{\n  \/\/ \"Output\" on the right side of the \"=\" is the current frame input\n  \/\/ for this Lag filter\n  double input = Output;\n  Output = ca * (input + PreviousLagInput) + PreviousLagOutput * cb;\n  PreviousLagInput = input;\n  PreviousLagOutput = Output;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::Hysteresis(void)\n{\n  \/\/ Note: this function acts cumulatively on the \"Output\" parameter. So, \"Output\"\n  \/\/ is - for the purposes of this Hysteresis method - really the input to the\n  \/\/ method.\n  double input = Output;\n  \n  if (input > PreviousHystOutput) {\n    Output = max(PreviousHystOutput, input-0.5*hysteresis_width);\n  } else if (input < PreviousHystOutput) {\n    Output = min(PreviousHystOutput, input+0.5*hysteresis_width);\n  }\n\n  PreviousHystOutput = Output;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::RateLimit(void)\n{\n  \/\/ Note: this function acts cumulatively on the \"Output\" parameter. So, \"Output\"\n  \/\/ is - for the purposes of this RateLimit method - really the input to the\n  \/\/ method.\n  double input = Output;\n  if (dt > 0.0) {\n    double rate = (input - PreviousRateLimOutput)\/dt;\n    if (fabs(rate) > rate_limit) {\n      Output = PreviousRateLimOutput + (rate_limit*fabs(rate)\/rate)*dt;\n    }\n  }\n  PreviousRateLimOutput = Output;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::Deadband(void)\n{\n  \/\/ Note: this function acts cumulatively on the \"Output\" parameter. So, \"Output\"\n  \/\/ is - for the purposes of this Deadband method - really the input to the\n  \/\/ method.\n  double input = Output;\n\n  if (input < -deadband_width\/2.0) {\n    Output = (input + deadband_width\/2.0);\n  } else if (input > deadband_width\/2.0) {\n    Output = (input - deadband_width\/2.0);\n  } else {\n    Output = 0.0;\n  }\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::bind(void)\n{\n  string tmp = Name;\n  if (Name.find(\"\/\") == string::npos) {\n    tmp = \"fcs\/\" + PropertyManager->mkPropertyName(Name, true);\n  }\n  const string tmp_zero = tmp + \"\/malfunction\/fail_zero\";\n  const string tmp_hardover = tmp + \"\/malfunction\/fail_hardover\";\n  const string tmp_stuck = tmp + \"\/malfunction\/fail_stuck\";\n\n  PropertyManager->Tie( tmp_zero, this, &FGActuator::GetFailZero, &FGActuator::SetFailZero);\n  PropertyManager->Tie( tmp_hardover, this, &FGActuator::GetFailHardover, &FGActuator::SetFailHardover);\n  PropertyManager->Tie( tmp_stuck, this, &FGActuator::GetFailStuck, &FGActuator::SetFailStuck);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\/\/    The bitmasked value choices are as follows:\n\/\/    unset: In this case (the default) JSBSim would only print\n\/\/       out the normally expected messages, essentially echoing\n\/\/       the config files as they are read. If the environment\n\/\/       variable is not set, debug_lvl is set to 1 internally\n\/\/    0: This requests JSBSim not to output any messages\n\/\/       whatsoever.\n\/\/    1: This value explicity requests the normal JSBSim\n\/\/       startup messages\n\/\/    2: This value asks for a message to be printed out when\n\/\/       a class is instantiated\n\/\/    4: When this value is set, a message is displayed when a\n\/\/       FGModel object executes its Run() method\n\/\/    8: When this value is set, various runtime state variables\n\/\/       are printed out periodically\n\/\/    16: When set various parameters are sanity checked and\n\/\/       a message is printed out when they go out of bounds\n\nvoid FGActuator::Debug(int from)\n{\n  if (debug_lvl <= 0) return;\n\n  if (debug_lvl & 1) { \/\/ Standard console startup message output\n    if (from == 0) { \/\/ Constructor\n      if (InputSigns[0] < 0)\n        cout << \"      INPUT: -\" << InputNames[0] << endl;\n      else\n        cout << \"      INPUT: \" << InputNames[0] << endl;\n\n      if (IsOutput) {\n        for (unsigned int i=0; i<OutputNodes.size(); i++)\n          cout << \"      OUTPUT: \" << OutputNodes[i]->getName() << endl;\n      }\n      if (bias != 0.0) cout << \"      Bias: \" << bias << endl;\n      if (rate_limit != 0) cout << \"      Rate limit: \" << rate_limit << endl;\n      if (lag != 0) cout << \"      Actuator lag: \" << lag << endl;\n      if (hysteresis_width != 0) cout << \"      Hysteresis width: \" << hysteresis_width << endl;\n      if (deadband_width != 0) cout << \"      Deadband width: \" << deadband_width << endl;\n    }\n  }\n  if (debug_lvl & 2 ) { \/\/ Instantiation\/Destruction notification\n    if (from == 0) cout << \"Instantiated: FGActuator\" << endl;\n    if (from == 1) cout << \"Destroyed:    FGActuator\" << endl;\n  }\n  if (debug_lvl & 4 ) { \/\/ Run() method entry print for FGModel-derived objects\n  }\n  if (debug_lvl & 8 ) { \/\/ Runtime state variables\n  }\n  if (debug_lvl & 16) { \/\/ Sanity checking\n  }\n  if (debug_lvl & 64) {\n    if (from == 0) { \/\/ Constructor\n      cout << IdSrc << endl;\n      cout << IdHdr << endl;\n    }\n  }\n}\n}\n<commit_msg>Improved the calcs during trimming after a suggestion from Dennis<commit_after>\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n Module:       FGActuator.cpp\n Author:       Jon Berndt\n Date started: 21 February 2006\n\n ------------- Copyright (C) 2007 Jon S. Berndt (jon@jsbsim.org) -------------\n\n This program is free software; you can redistribute it and\/or modify it under\n the terms of the GNU Lesser 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 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 Lesser General Public License for more\n details.\n\n You should have received a copy of the GNU Lesser General Public License along with\n this program; if not, write to the Free Software Foundation, Inc., 59 Temple\n Place - Suite 330, Boston, MA  02111-1307, USA.\n\n Further information about the GNU Lesser General Public License can also be found on\n the world wide web at http:\/\/www.gnu.org.\n\nFUNCTIONAL DESCRIPTION\n--------------------------------------------------------------------------------\n\nHISTORY\n--------------------------------------------------------------------------------\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nCOMMENTS, REFERENCES,  and NOTES\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nINCLUDES\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\n#include \"FGActuator.h\"\n\nusing namespace std;\n\nnamespace JSBSim {\n\nstatic const char *IdSrc = \"$Id: FGActuator.cpp,v 1.19 2011\/06\/18 13:30:27 bcoconni Exp $\";\nstatic const char *IdHdr = ID_ACTUATOR;\n\n\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nCLASS IMPLEMENTATION\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\n\nFGActuator::FGActuator(FGFCS* fcs, Element* element) : FGFCSComponent(fcs, element)\n{\n  double denom;\n\n  \/\/ inputs are read from the base class constructor\n\n  PreviousOutput = 0.0;\n  PreviousHystOutput = 0.0;\n  PreviousRateLimOutput = 0.0;\n  PreviousLagInput = PreviousLagOutput = 0.0;\n  bias = lag = hysteresis_width = deadband_width = 0.0;\n  rate_limit = 0.0; \/\/ no limit\n  fail_zero = fail_hardover = fail_stuck = false;\n  ca = cb = 0.0;\n\n  if ( element->FindElement(\"deadband_width\") ) {\n    deadband_width = element->FindElementValueAsNumber(\"deadband_width\");\n  }\n  if ( element->FindElement(\"hysteresis_width\") ) {\n    hysteresis_width = element->FindElementValueAsNumber(\"hysteresis_width\");\n  }\n  if ( element->FindElement(\"rate_limit\") ) {\n    rate_limit = element->FindElementValueAsNumber(\"rate_limit\");\n  }\n  if ( element->FindElement(\"bias\") ) {\n    bias = element->FindElementValueAsNumber(\"bias\");\n  }\n  if ( element->FindElement(\"lag\") ) {\n    lag = element->FindElementValueAsNumber(\"lag\");\n    denom = 2.00 + dt*lag;\n    ca = dt*lag \/ denom;\n    cb = (2.00 - dt*lag) \/ denom;\n  }\n\n  FGFCSComponent::bind();\n  bind();\n\n  Debug(0);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGActuator::~FGActuator()\n{\n  Debug(1);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nbool FGActuator::Run(void )\n{\n  Input = InputNodes[0]->getDoubleValue() * InputSigns[0];\n\n  if (fail_zero) Input = 0;\n  if (fail_hardover) Input =  clipmax*sign(Input);\n\n  Output = Input; \/\/ Perfect actuator. At this point, if no failures are present\n                  \/\/ and no subsequent lag, limiting, etc. is done, the output\n                  \/\/ is simply the input. If any further processing is done\n                  \/\/ (below) such as lag, rate limiting, hysteresis, etc., then\n                  \/\/ the Input will be further processed and the eventual Output\n                  \/\/ will be overwritten from this perfect value.\n\n  if (lag != 0.0)              Lag();        \/\/ models actuator lag\n  if (rate_limit != 0)         RateLimit();  \/\/ limit the actuator rate\n  if (deadband_width != 0.0)   Deadband();\n  if (hysteresis_width != 0.0) Hysteresis();\n  if (bias != 0.0)             Bias();       \/\/ models a finite bias\n\n  if (fail_stuck) Output = PreviousOutput;\n  PreviousOutput = Output; \/\/ previous value needed for \"stuck\" malfunction\n\n  Clip();\n  if (IsOutput) SetOutput();\n\n  return true;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::Bias(void)\n{\n  Output += bias;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::Lag(void)\n{\n  \/\/ \"Output\" on the right side of the \"=\" is the current frame input\n  \/\/ for this Lag filter\n  double input = Output;\n\n  if (!fcs->GetTrimStatus())\n    Output = ca * (input + PreviousLagInput) + PreviousLagOutput * cb;\n\n  PreviousLagInput = input;\n  PreviousLagOutput = Output;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::Hysteresis(void)\n{\n  \/\/ Note: this function acts cumulatively on the \"Output\" parameter. So, \"Output\"\n  \/\/ is - for the purposes of this Hysteresis method - really the input to the\n  \/\/ method.\n  double input = Output;\n  \n  if (!fcs->GetTrimStatus()) {\n    if (input > PreviousHystOutput)\n      Output = max(PreviousHystOutput, input-0.5*hysteresis_width);\n    else if (input < PreviousHystOutput)\n      Output = min(PreviousHystOutput, input+0.5*hysteresis_width);\n  }\n\n  PreviousHystOutput = Output;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::RateLimit(void)\n{\n  \/\/ Note: this function acts cumulatively on the \"Output\" parameter. So, \"Output\"\n  \/\/ is - for the purposes of this RateLimit method - really the input to the\n  \/\/ method.\n  double input = Output;\n  if (!fcs->GetTrimStatus()) {\n    double rate = (input - PreviousRateLimOutput)\/dt;\n    if (fabs(rate) > rate_limit) {\n      Output = PreviousRateLimOutput + (rate_limit*fabs(rate)\/rate)*dt;\n    }\n  }\n  PreviousRateLimOutput = Output;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::Deadband(void)\n{\n  \/\/ Note: this function acts cumulatively on the \"Output\" parameter. So, \"Output\"\n  \/\/ is - for the purposes of this Deadband method - really the input to the\n  \/\/ method.\n  double input = Output;\n\n  if (input < -deadband_width\/2.0) {\n    Output = (input + deadband_width\/2.0);\n  } else if (input > deadband_width\/2.0) {\n    Output = (input - deadband_width\/2.0);\n  } else {\n    Output = 0.0;\n  }\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGActuator::bind(void)\n{\n  string tmp = Name;\n  if (Name.find(\"\/\") == string::npos) {\n    tmp = \"fcs\/\" + PropertyManager->mkPropertyName(Name, true);\n  }\n  const string tmp_zero = tmp + \"\/malfunction\/fail_zero\";\n  const string tmp_hardover = tmp + \"\/malfunction\/fail_hardover\";\n  const string tmp_stuck = tmp + \"\/malfunction\/fail_stuck\";\n\n  PropertyManager->Tie( tmp_zero, this, &FGActuator::GetFailZero, &FGActuator::SetFailZero);\n  PropertyManager->Tie( tmp_hardover, this, &FGActuator::GetFailHardover, &FGActuator::SetFailHardover);\n  PropertyManager->Tie( tmp_stuck, this, &FGActuator::GetFailStuck, &FGActuator::SetFailStuck);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\/\/    The bitmasked value choices are as follows:\n\/\/    unset: In this case (the default) JSBSim would only print\n\/\/       out the normally expected messages, essentially echoing\n\/\/       the config files as they are read. If the environment\n\/\/       variable is not set, debug_lvl is set to 1 internally\n\/\/    0: This requests JSBSim not to output any messages\n\/\/       whatsoever.\n\/\/    1: This value explicity requests the normal JSBSim\n\/\/       startup messages\n\/\/    2: This value asks for a message to be printed out when\n\/\/       a class is instantiated\n\/\/    4: When this value is set, a message is displayed when a\n\/\/       FGModel object executes its Run() method\n\/\/    8: When this value is set, various runtime state variables\n\/\/       are printed out periodically\n\/\/    16: When set various parameters are sanity checked and\n\/\/       a message is printed out when they go out of bounds\n\nvoid FGActuator::Debug(int from)\n{\n  if (debug_lvl <= 0) return;\n\n  if (debug_lvl & 1) { \/\/ Standard console startup message output\n    if (from == 0) { \/\/ Constructor\n      if (InputSigns[0] < 0)\n        cout << \"      INPUT: -\" << InputNames[0] << endl;\n      else\n        cout << \"      INPUT: \" << InputNames[0] << endl;\n\n      if (IsOutput) {\n        for (unsigned int i=0; i<OutputNodes.size(); i++)\n          cout << \"      OUTPUT: \" << OutputNodes[i]->getName() << endl;\n      }\n      if (bias != 0.0) cout << \"      Bias: \" << bias << endl;\n      if (rate_limit != 0) cout << \"      Rate limit: \" << rate_limit << endl;\n      if (lag != 0) cout << \"      Actuator lag: \" << lag << endl;\n      if (hysteresis_width != 0) cout << \"      Hysteresis width: \" << hysteresis_width << endl;\n      if (deadband_width != 0) cout << \"      Deadband width: \" << deadband_width << endl;\n    }\n  }\n  if (debug_lvl & 2 ) { \/\/ Instantiation\/Destruction notification\n    if (from == 0) cout << \"Instantiated: FGActuator\" << endl;\n    if (from == 1) cout << \"Destroyed:    FGActuator\" << endl;\n  }\n  if (debug_lvl & 4 ) { \/\/ Run() method entry print for FGModel-derived objects\n  }\n  if (debug_lvl & 8 ) { \/\/ Runtime state variables\n  }\n  if (debug_lvl & 16) { \/\/ Sanity checking\n  }\n  if (debug_lvl & 64) {\n    if (from == 0) { \/\/ Constructor\n      cout << IdSrc << endl;\n      cout << IdHdr << endl;\n    }\n  }\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\nModule:    $RCSfile: SampleAppMain.cpp,v $\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\/ 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 \"SampleApp.h\"\n#include <qapplication.h>\n#include \"itkTextOutput.h\"\n#include <itksys\/SystemTools.hxx>\n#include <stdexcept>\n\n#include <mitkStandardFileLocations.h>\n#include <mitkDataStorage.h>\n\n#include <QmitkFunctionalityTesting.h>\n#include <sstream>\n\n#include \"MITKSplashScreen_xpm.h\" \/\/ qembed --images MITKSplashScreen.png > MITKSplashScreen_xpm.h\n#include \"QmitkSplashScreen.h\"\n#include <qtimer.h>\n\n\/*\n* BUG: ATI-grafics-cards are slow in building up display lists in case of displaying transparent surfaces.\n* Activating GlobalImmediateModeRendering in vtk solves this problem.\n*\/\n\/\/#include <vtkMapper.h>\n\n#include <QmitkControlsRightFctLayoutTemplate.h>\n\nint main(int argc, char* argv[])\n{\n  int result;\n  try\n  {\n    \/\/ Add directory in which the application executable resides as search directory\n    mitk::StandardFileLocations::GetInstance()->AddDirectoryForSearch(itksys::SystemTools::GetFilenamePath(argv[0]).c_str()); \n    \/\/\n    \/\/ determine application name without path and extension\n    \/\/\n    std::string executableName = itksys::SystemTools::GetFilenameWithoutExtension( itksys::SystemTools::GetFilenameName(argv[0] ) );\n    std::stringstream caption;\n    caption << executableName << \", Builddate \" << __DATE__ << \", \" << __TIME__ << \".\";\n    itk::OutputWindow::SetInstance(itk::TextOutput::New().GetPointer());\n    \/\/ parse testing parameters\n    int testType = 0;\n    for (int i = 0; i < argc; i++)\n    {\n        if ((strcmp(argv[i], \"-testing\") == 0))\n        {\n             testType |= QmitkFunctionalityTesting::GUITest;\n        }\n        if ((strcmp(argv[i], \"-optiontesting\") == 0))\n        {\n             testType |= QmitkFunctionalityTesting::OptionsTest;\n        }\n        if ((strcmp(argv[i], \"-alltesting\") == 0))\n        {\n             testType |= QmitkFunctionalityTesting::AllTests;\n        }\n    }\n    \n    std::cout << \"testType = \" << testType << \"\\n\";\n    \n    const char * testingParameter = NULL;\n    if ((strcmp(argv[argc - 1], \"-testing\") != 0) && (strcmp(argv[argc - 1], \"-optiontesting\") != 0) && (strcmp(argv[argc - 1], \"-alltesting\") != 0) )\n        testingParameter = argv[argc - 1];\n        \n    QApplication a( argc, argv );\n\n    \/\/ popup a splash screen\n    bool showSplashScreen(false);\n    QmitkSplashScreen* splasher(NULL);\n    if (showSplashScreen)\n    {\n      QImage icon = qembed_findImage(\"MITKSplashScreen\");\n      QPixmap pixmap(icon);\n      splasher = new QmitkSplashScreen( pixmap );\n      a.processEvents();\n    }\n\n    SampleApp mainWindow(NULL, \"mainwindow\",Qt::WType_TopLevel,testingParameter);\n    mainWindow.setCaption( caption.str().c_str() );\n    a.setMainWidget(&mainWindow);\n\n#ifdef USEDARKPALETTE\n    std::cout << \"changing palette ...\" << std::endl;\n    QPalette p( QColor( 64,64,64), QColor(64,64,64));\n    a.setPalette(p,TRUE);\n#endif\n    \/*\n    * BUG: ATI-grafics-cards are slow in building up display lists in case of displaying transparent surfaces.\n    * Activating GlobalImmediateModeRendering in vtk solves this problem. Also add #include vtkMapper above\n    *\/\n    \/\/vtkMapper::GlobalImmediateModeRenderingOn();\n\n    mainWindow.SetDefaultWidgetSize();\n\n    \/\/ reinit views after mainwindow and fctwidget initialization\n    mainWindow.viewReinitMultiWidget();\n\n    if (showSplashScreen)\n    {\n      QTimer::singleShot(5000, splasher, SLOT(close()) );\n    }\n\n    if(testType)\n    {\n      std::cout.setf(std::ios_base::unitbuf);\n      result = StartQmitkFunctionalityTesting(mainWindow.GetFctMediator(), testType);\n    }\n    else\n    {\n      result = a.exec();\n    }\n  }\n  catch (const std::bad_alloc& e)\n  {\n    std::cout << \"MITK MainApp caught bad_alloc: Could not acquire enough memory: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (const std::exception& e)\n  {\n    std::cout << \"MITK MainApp caught an exception: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (...)\n  {\n    std::cout << \"MITK MainApp caught something like an exception...\" << std::endl;\n    return EXIT_FAILURE;\n  }  \n  try\n  {\n    mitk::DataStorage::GetInstance()->ShutdownSingleton();\n  }\n  catch (const std::exception& e)\n  {\n    std::cout << \"MITK MainApp caught an exception on ShutdownSingleton: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (...)\n  {\n    std::cout << \"MITK MainApp caught something like an exception on ShutdownSingleton...\" << std::endl;\n    return EXIT_FAILURE;\n  }\n  return result;\n} \n<commit_msg>FIX (#1531): Functionality icons missing, inserted missing check for (testType != 0)<commit_after>\/*=========================================================================\n\nProgram:   Medical Imaging & Interaction Toolkit\nModule:    $RCSfile: SampleAppMain.cpp,v $\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\/ 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 \"SampleApp.h\"\n#include <qapplication.h>\n#include \"itkTextOutput.h\"\n#include <itksys\/SystemTools.hxx>\n#include <stdexcept>\n\n#include <mitkStandardFileLocations.h>\n#include <mitkDataStorage.h>\n\n#include <QmitkFunctionalityTesting.h>\n#include <sstream>\n\n#include \"MITKSplashScreen_xpm.h\" \/\/ qembed --images MITKSplashScreen.png > MITKSplashScreen_xpm.h\n#include \"QmitkSplashScreen.h\"\n#include <qtimer.h>\n\n\/*\n* BUG: ATI-grafics-cards are slow in building up display lists in case of displaying transparent surfaces.\n* Activating GlobalImmediateModeRendering in vtk solves this problem.\n*\/\n\/\/#include <vtkMapper.h>\n\n#include <QmitkControlsRightFctLayoutTemplate.h>\n\nint main(int argc, char* argv[])\n{\n  int result;\n  try\n  {\n    \/\/ Add directory in which the application executable resides as search directory\n    mitk::StandardFileLocations::GetInstance()->AddDirectoryForSearch(itksys::SystemTools::GetFilenamePath(argv[0]).c_str()); \n    \/\/\n    \/\/ determine application name without path and extension\n    \/\/\n    std::string executableName = itksys::SystemTools::GetFilenameWithoutExtension( itksys::SystemTools::GetFilenameName(argv[0] ) );\n    std::stringstream caption;\n    caption << executableName << \", Builddate \" << __DATE__ << \", \" << __TIME__ << \".\";\n    itk::OutputWindow::SetInstance(itk::TextOutput::New().GetPointer());\n    \/\/ parse testing parameters\n    int testType = 0;\n    for (int i = 0; i < argc; i++)\n    {\n        if ((strcmp(argv[i], \"-testing\") == 0))\n        {\n             testType |= QmitkFunctionalityTesting::GUITest;\n        }\n        if ((strcmp(argv[i], \"-optiontesting\") == 0))\n        {\n             testType |= QmitkFunctionalityTesting::OptionsTest;\n        }\n        if ((strcmp(argv[i], \"-alltesting\") == 0))\n        {\n             testType |= QmitkFunctionalityTesting::AllTests;\n        }\n    }\n    \n    std::cout << \"testType = \" << testType << \"\\n\";\n    \n    const char * testingParameter = NULL;\n    if ((testType != 0) && (strcmp(argv[argc - 1], \"-testing\") != 0) && (strcmp(argv[argc - 1], \"-optiontesting\") != 0) && (strcmp(argv[argc - 1], \"-alltesting\") != 0) )\n        testingParameter = argv[argc - 1];\n        \n    QApplication a( argc, argv );\n\n    \/\/ popup a splash screen\n    bool showSplashScreen(false);\n    QmitkSplashScreen* splasher(NULL);\n    if (showSplashScreen)\n    {\n      QImage icon = qembed_findImage(\"MITKSplashScreen\");\n      QPixmap pixmap(icon);\n      splasher = new QmitkSplashScreen( pixmap );\n      a.processEvents();\n    }\n\n    SampleApp mainWindow(NULL, \"mainwindow\",Qt::WType_TopLevel,testingParameter);\n    mainWindow.setCaption( caption.str().c_str() );\n    a.setMainWidget(&mainWindow);\n\n#ifdef USEDARKPALETTE\n    std::cout << \"changing palette ...\" << std::endl;\n    QPalette p( QColor( 64,64,64), QColor(64,64,64));\n    a.setPalette(p,TRUE);\n#endif\n    \/*\n    * BUG: ATI-grafics-cards are slow in building up display lists in case of displaying transparent surfaces.\n    * Activating GlobalImmediateModeRendering in vtk solves this problem. Also add #include vtkMapper above\n    *\/\n    \/\/vtkMapper::GlobalImmediateModeRenderingOn();\n\n    mainWindow.SetDefaultWidgetSize();\n\n    \/\/ reinit views after mainwindow and fctwidget initialization\n    mainWindow.viewReinitMultiWidget();\n\n    if (showSplashScreen)\n    {\n      QTimer::singleShot(5000, splasher, SLOT(close()) );\n    }\n\n    if(testType)\n    {\n      std::cout.setf(std::ios_base::unitbuf);\n      result = StartQmitkFunctionalityTesting(mainWindow.GetFctMediator(), testType);\n    }\n    else\n    {\n      result = a.exec();\n    }\n  }\n  catch (const std::bad_alloc& e)\n  {\n    std::cout << \"MITK MainApp caught bad_alloc: Could not acquire enough memory: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (const std::exception& e)\n  {\n    std::cout << \"MITK MainApp caught an exception: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (...)\n  {\n    std::cout << \"MITK MainApp caught something like an exception...\" << std::endl;\n    return EXIT_FAILURE;\n  }  \n  try\n  {\n    mitk::DataStorage::GetInstance()->ShutdownSingleton();\n  }\n  catch (const std::exception& e)\n  {\n    std::cout << \"MITK MainApp caught an exception on ShutdownSingleton: \" << e.what() << std::endl;\n    return EXIT_FAILURE;\n  }\n  catch (...)\n  {\n    std::cout << \"MITK MainApp caught something like an exception on ShutdownSingleton...\" << std::endl;\n    return EXIT_FAILURE;\n  }\n  return result;\n} \n<|endoftext|>"}
{"text":"<commit_before>#include <Empathy\/Empathy\/Empathy.h>\n#include <Empathy\/empathy-linear\/linear_empathy.h>\n#include <irrKlang.h>\n#include <GLFW\/glfw3.h>\n\nusing namespace std;\n\nstatic GLFWwindow * window;\nstatic GLfloat mouseX,mouseY;\nirrklang::ISoundEngine* engine;\n\nstatic GLdouble lastPressTime;\nstatic GLdouble thresholdTime=0.2;\nstatic GLboolean mousePressed=GL_FALSE;\n\nvoid createClickEvent(int button=GLFW_MOUSE_BUTTON_LEFT){\n    empathy::radio::Event event(EMPATHY_EVENT_ACTION_NONE);\n\n    if(button==GLFW_MOUSE_BUTTON_LEFT ){\n        event=empathy::radio::Event(EMPATHY_EVENT_INPUT_MOUSE_LEFT_KEY_PRESS);\n    }else if(button==GLFW_MOUSE_BUTTON_RIGHT){\n        event=empathy::radio::Event(EMPATHY_EVENT_INPUT_MOUSE_RIGHT_KEY_PRESS);\n    }\n\n    event.putDouble(EMPATHY_MOUSE_XPOS,mouseX);\n    event.putDouble(EMPATHY_MOUSE_YPOS,700-mouseY);\n\n    empathy::radio::BroadcastStation::emit(event);\n}\nvoid mouse_input_callback(GLFWwindow *window, int button, int action, int mods) {\n    if(action==GLFW_PRESS){\n        createClickEvent(button);\n\n        lastPressTime=glfwGetTime();\n\n        mousePressed=GL_TRUE;\n\n    }else if(action==GLFW_RELEASE){\n        lastPressTime=0;\n        mousePressed=GL_FALSE;\n    }\n}\n\nvoid key_callback(GLFWwindow* window, int key, int scancode, int action, int mode) {\n\/\/    std::cout<<\"key call back received\"<<action<<std::endl;\n\n    \/\/ When a user presses the escape key, we set the WindowShouldClose property to true,\n    \/\/ closing the application\n\n    if (key == GLFW_KEY_ESCAPE && action == GLFW_PRESS){\n\/\/            glfwSetWindowShouldClose(instance->window, GL_TRUE);\n        empathy_linear::makeReadyToClose();\n\n        return;\n    }\n\n    cout<<\"KEY callback\"<<endl;\n    std::string myAction=\"\";\n    if(action==GLFW_PRESS){\n        myAction=EMPATHY_EVENT_INPUT_KEY_PRESS;\n    }else if(action==GLFW_RELEASE){\n        myAction=EMPATHY_EVENT_INPUT_KEY_RELEASE;\n    }else if(action==GLFW_REPEAT){\n        myAction=EMPATHY_EVENT_INPUT_KEY_REPEAT;\n    }\n    if(myAction != \"\"){\n        empathy::radio::Event event=empathy::radio::Event(myAction);\n        event.putInt(EMPATHY_EVENT_INPUT_KEY,key);\n\n        empathy::radio::BroadcastStation::emit(event);\n    }\n\n}\n\nvoid mouse_position_callback(GLFWwindow *window, double xpos, double ypos) {\n    mouseX=xpos;\n    mouseY=ypos;\n}\n\nvoid initGlfw() {\n    \/\/\tcout<<\"glfwInit\"<<endl;\n\n    glfwInit();\n\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3);\n    glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);\n    glfwWindowHint(GLFW_RESIZABLE, GL_FALSE);\n\n    int count;\n    GLFWmonitor** monitors=glfwGetMonitors(&count);\n\n    \/\/Create a GLFW window\n    window = glfwCreateWindow((GLuint)700, (GLuint)700, \"Empathy | <3\", nullptr, nullptr);\n    if (window == nullptr)\n    {\n        std::cout << \"Failed to create GLFW window\" << std::endl;\n        glfwTerminate();\n        exit(EXIT_FAILURE);\n    }\n\n    glfwMakeContextCurrent(window);\n\n    \/\/set event receiver call backs.\n    glfwSetKeyCallback(window, key_callback);\n    glfwSetMouseButtonCallback(window,mouse_input_callback);\n    glfwSetCursorPosCallback(window,mouse_position_callback);\n}\n\nvoid init(){\n\n    initGlfw();\n    empathy_linear::init();\n\n    empathy_linear::addJsonBrain(\"brains\/test.json\");\n    empathy_linear::addDummyTouchBrain();\n\n    engine = irrklang::createIrrKlangDevice();\n\n    if (!engine)\n    {\n        printf(\"Could not startup engine\\n\");\n        exit(EXIT_FAILURE);\n    }\n\n    engine->setSoundVolume(0.4f);\n}\n\nvoid loop(){\n    while(! empathy_linear::shouldClose() && !glfwWindowShouldClose(window)){\n\n\n        std::stack<empathy::moonlight::BasicNote> audioEvents= empathy_linear::getMusicalKeyboardEvents();\n\n        while(! audioEvents.empty()){\n\n            empathy::moonlight::BasicNote playableItem=audioEvents.top();\n\n            std::string fileName=playableItem.getNote()+std::to_string(playableItem.getOctave()-1);\n            if(playableItem.isSharp()){\n                fileName=\"#\"+fileName;\n\n            }\n\n            std::string path=empathy::getAssetPath(\"audio\/keyboard\/music\/\"+fileName+\".mp3\");\n\n            try{\n                cout<<\"Playing audio \"<<fileName<<endl;\n\n                engine->play2D(path.c_str());\n            }catch (int i){\n                cout<<\"Could not play \"<<path<<endl;\n                continue;\n            }\n\n            audioEvents.pop();\n        }\n\n        if(mousePressed && glfwGetTime()-lastPressTime>thresholdTime){\n            createClickEvent();\n        }\n\n\n        glfwPollEvents();\n\n        empathy_linear::loop();\n\n        empathy_linear::setTime((GLfloat ) glfwGetTime());\n\n\n        glfwSwapBuffers(window);\n    }\n}\nvoid flush(){\n    engine->drop();\n\n    empathy_linear::flush();\n\n    if(window!= nullptr)\n        glfwSetWindowShouldClose(window,true);\n\n    glfwTerminate();\n}\n\nint  main() {\n    init();\n    loop();\n    flush();\n}\n<commit_msg>added full screen option<commit_after>#include <Empathy\/Empathy\/Empathy.h>\n#include <Empathy\/empathy-linear\/linear_empathy.h>\n#include <irrKlang.h>\n#include <GLFW\/glfw3.h>\n\n\n#define FULL_SCREEN true\n\n#if FULL_SCREEN\n #define RENDER_SIZE 700\n #define SC_SIZE_X 1366\n #define SC_SIZE_Y 768\n#else\n #define RENDER_SIZE 700\n #define SC_SIZE_X 700\n #define SC_SIZE_Y 700\n#endif\n\n\n\nusing namespace std;\n\nstatic GLFWwindow * window;\nstatic GLfloat mouseX,mouseY;\nirrklang::ISoundEngine* engine;\n\nstatic GLdouble lastPressTime;\nstatic GLdouble thresholdTime=0.2;\nstatic GLboolean mousePressed=GL_FALSE;\n\nvoid createClickEvent(int button=GLFW_MOUSE_BUTTON_LEFT){\n    empathy::radio::Event event(EMPATHY_EVENT_ACTION_NONE);\n\n    if(button==GLFW_MOUSE_BUTTON_LEFT ){\n        event=empathy::radio::Event(EMPATHY_EVENT_INPUT_MOUSE_LEFT_KEY_PRESS);\n    }else if(button==GLFW_MOUSE_BUTTON_RIGHT){\n        event=empathy::radio::Event(EMPATHY_EVENT_INPUT_MOUSE_RIGHT_KEY_PRESS);\n    }\n\n    event.putDouble(EMPATHY_MOUSE_XPOS,mouseX);\n    event.putDouble(EMPATHY_MOUSE_YPOS,RENDER_SIZE-mouseY);\n\n    empathy::radio::BroadcastStation::emit(event);\n}\nvoid mouse_input_callback(GLFWwindow *window, int button, int action, int mods) {\n    if(action==GLFW_PRESS){\n        createClickEvent(button);\n\n        lastPressTime=glfwGetTime();\n\n        mousePressed=GL_TRUE;\n\n    }else if(action==GLFW_RELEASE){\n        lastPressTime=0;\n        mousePressed=GL_FALSE;\n    }\n}\n\nvoid key_callback(GLFWwindow* window, int key, int scancode, int action, int mode) {\n\/\/    std::cout<<\"key call back received\"<<action<<std::endl;\n\n    \/\/ When a user presses the escape key, we set the WindowShouldClose property to true,\n    \/\/ closing the application\n\n    if (key == GLFW_KEY_ESCAPE && action == GLFW_PRESS){\n\/\/            glfwSetWindowShouldClose(instance->window, GL_TRUE);\n        empathy_linear::makeReadyToClose();\n\n        return;\n    }\n\n    cout<<\"KEY callback\"<<endl;\n    std::string myAction=\"\";\n    if(action==GLFW_PRESS){\n        myAction=EMPATHY_EVENT_INPUT_KEY_PRESS;\n    }else if(action==GLFW_RELEASE){\n        myAction=EMPATHY_EVENT_INPUT_KEY_RELEASE;\n    }else if(action==GLFW_REPEAT){\n        myAction=EMPATHY_EVENT_INPUT_KEY_REPEAT;\n    }\n    if(myAction != \"\"){\n        empathy::radio::Event event=empathy::radio::Event(myAction);\n        event.putInt(EMPATHY_EVENT_INPUT_KEY,key);\n\n        empathy::radio::BroadcastStation::emit(event);\n    }\n\n}\n\nvoid mouse_position_callback(GLFWwindow *window, double xpos, double ypos) {\n\n    mouseX= xpos -(SC_SIZE_X-RENDER_SIZE)\/2;;\n\n    mouseY = ypos - (SC_SIZE_Y-RENDER_SIZE)\/2;\n}\n\nvoid initGlfw() {\n    \/\/\tcout<<\"glfwInit\"<<endl;\n\n    glfwInit();\n\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3);\n    glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);\n    glfwWindowHint(GLFW_RESIZABLE, GL_FALSE);\n\n    int count;\n    GLFWmonitor** monitors=glfwGetMonitors(&count);\n\n    \/\/Create a GLFW window\n    window = glfwCreateWindow((GLuint)SC_SIZE_X, (GLuint)SC_SIZE_Y, \"Empathy | <3\",\n                              FULL_SCREEN ? glfwGetPrimaryMonitor(): nullptr, nullptr);\n    if (window == nullptr)\n    {\n        std::cout << \"Failed to create GLFW window\" << std::endl;\n        glfwTerminate();\n        exit(EXIT_FAILURE);\n    }\n\n    glfwMakeContextCurrent(window);\n\n    \/\/set event receiver call backs.\n    glfwSetKeyCallback(window, key_callback);\n    glfwSetMouseButtonCallback(window,mouse_input_callback);\n    glfwSetCursorPosCallback(window,mouse_position_callback);\n}\n\nvoid init(){\n    GLFWmonitor * glfWmonitor=glfwGetPrimaryMonitor();\n\n    initGlfw();\n    empathy_linear::init();\n    empathy_linear::setScreenMargins( (SC_SIZE_X-RENDER_SIZE)\/2 , (SC_SIZE_Y-RENDER_SIZE)\/2);\n\n    empathy_linear::setScreenSize(RENDER_SIZE);\n\n\n    empathy_linear::addJsonBrain(\"brains\/test.json\");\n    empathy_linear::addDummyTouchBrain();\n\n    engine = irrklang::createIrrKlangDevice();\n\n    if (!engine)\n    {\n        printf(\"Could not startup engine\\n\");\n        exit(EXIT_FAILURE);\n    }\n\n    engine->setSoundVolume(0.4f);\n}\n\nvoid loop(){\n    while(! empathy_linear::shouldClose() && !glfwWindowShouldClose(window)){\n\n\n        std::stack<empathy::moonlight::BasicNote> audioEvents= empathy_linear::getMusicalKeyboardEvents();\n\n        while(! audioEvents.empty()){\n\n            empathy::moonlight::BasicNote playableItem=audioEvents.top();\n\n            std::string fileName=playableItem.getNote()+std::to_string(playableItem.getOctave()-1);\n            if(playableItem.isSharp()){\n                fileName=\"#\"+fileName;\n\n            }\n\n            std::string path=empathy::getAssetPath(\"audio\/keyboard\/music\/\"+fileName+\".mp3\");\n\n            try{\n                cout<<\"Playing audio \"<<fileName<<endl;\n\n                engine->play2D(path.c_str());\n            }catch (int i){\n                cout<<\"Could not play \"<<path<<endl;\n                continue;\n            }\n\n            audioEvents.pop();\n        }\n\n        if(mousePressed && glfwGetTime()-lastPressTime>thresholdTime){\n            createClickEvent();\n        }\n\n\n        glfwPollEvents();\n\n        empathy_linear::loop();\n\n        empathy_linear::setTime((GLfloat ) glfwGetTime());\n\n\n        glfwSwapBuffers(window);\n    }\n}\nvoid flush(){\n    engine->drop();\n\n    empathy_linear::flush();\n\n    if(window!= nullptr)\n        glfwSetWindowShouldClose(window,true);\n\n    glfwTerminate();\n}\n\nint  main() {\n    init();\n    loop();\n    flush();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file    bib_ref_to_codes_tool.cc\n *  \\brief   A tool for converting bible references to numeric codes.\n *  \\author  Dr. Johannes Ruscheinski\n *\/\n\n\/*\n    Copyright (C) 2015-2017, 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#include <fstream>\n#include <iostream>\n#include <string>\n#include <unordered_map>\n#include <cctype>\n#include <cstdlib>\n#include <cstring>\n#include \"BibleReferenceParser.h\"\n#include \"MapIO.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nstd::string InsertSpaceAtFirstLetterDigitBoundary(const std::string &s) {\n    if (s.empty())\n        return s;\n\n    std::string retval;\n    bool found_first_boundary(false);\n    auto ch(s.cbegin());\n    retval += *ch;\n    while (++ch != s.cend()) {\n        if (not found_first_boundary and (std::isalpha(*(ch - 1)) and std::isdigit(*ch))) {\n            found_first_boundary = true;\n            retval += ' ';\n        }\n\n        retval += *ch;\n    }\n\n    return retval;\n}\n\n\n\/\/ Squeezes out spaces after a leading number, e.g. \"1. mos\" => \"1.mos\" or \"1 mos\" => \"1mos\".\nstd::string CanoniseLeadingNumber(const std::string &bible_reference_candidate) {\n    static const RegexMatcher * const matcher(RegexMatcher::RegexMatcherFactory(\"^\\\\d\\\\.?\\\\s+\\\\S+\"));\n    std::string err_msg;\n    if (not matcher->matched(bible_reference_candidate, &err_msg)) {\n        if (not err_msg.empty())\n            Error(\"unexpected reg ex error: \" + err_msg);\n        return bible_reference_candidate;\n    }\n\n    std::string ordinal_string;\n    ordinal_string = bible_reference_candidate[0];\n    size_t rest_start(1);\n    if (bible_reference_candidate[1] == '.') {\n        ordinal_string += '.';\n        ++rest_start;\n    }\n\n    while (isspace(bible_reference_candidate[rest_start]))\n        ++rest_start;\n\n    return ordinal_string + bible_reference_candidate.substr(rest_start);\n}\n\n\nvoid SplitIntoBookAndChaptersAndVerses(const std::string &bible_reference_candidate,\n                                       std::string * const book_candidate,\n                                       std::string * const chapters_and_verses_candidate)\n{\n    book_candidate->clear();\n    chapters_and_verses_candidate->clear();\n\n    const size_t len(bible_reference_candidate.length());\n    if (len <= 3)\n        *book_candidate = bible_reference_candidate;\n    else if (isdigit(bible_reference_candidate[len - 1])\n             or (isalpha(bible_reference_candidate[len - 1]) and isdigit(bible_reference_candidate[len - 2])))\n    {\n        const size_t last_space_pos(bible_reference_candidate.rfind(' '));\n        if (last_space_pos == std::string::npos)\n            *book_candidate = bible_reference_candidate;\n        else {\n            *book_candidate = bible_reference_candidate.substr(0, last_space_pos);\n            *chapters_and_verses_candidate = bible_reference_candidate.substr(last_space_pos + 1);\n        }\n    } else\n        *book_candidate = bible_reference_candidate;\n}\n\n\n\/** \\brief Map from noncanonical bible book forms to the canonical ones.\n *  \\return The mapped name or, if no mapping was found, \"bible_book_candidate\".\n *\/\nstd::string CanoniseBibleBook(const bool verbose,\n                              const std::string &books_of_the_bible_to_canonical_form_map_filename,\n                              const std::string &bible_book_candidate)\n{\n    std::unordered_map<std::string, std::string> books_of_the_bible_to_canonical_form_map;\n    MapIO::DeserialiseMap(books_of_the_bible_to_canonical_form_map_filename,\n                          &books_of_the_bible_to_canonical_form_map);\n    const auto non_canonical_form_and_canonical_form(\n        books_of_the_bible_to_canonical_form_map.find(bible_book_candidate));\n    if (non_canonical_form_and_canonical_form != books_of_the_bible_to_canonical_form_map.end()) {\n        if (verbose)\n            std::cerr << \"Replacing \\\"\" << bible_book_candidate << \"\\\" with \\\"\"\n                      << non_canonical_form_and_canonical_form->second << \"\\\".\\n\";\n        return non_canonical_form_and_canonical_form->second;\n    }\n\n    return bible_book_candidate;\n}\n\n\nstd::string MapBibleBookToCode(const bool verbose, const std::string &bible_book_candidate,\n                               const std::string &books_of_the_bible_to_code_map_filename)\n{\n    std::unordered_map<std::string, std::string> bible_books_to_codes_map;\n    MapIO::DeserialiseMap(books_of_the_bible_to_code_map_filename, &bible_books_to_codes_map);\n    const auto bible_book_and_code(bible_books_to_codes_map.find(bible_book_candidate));\n    if (bible_book_and_code == bible_books_to_codes_map.end()) {\n        if (verbose)\n            std::cerr << \"No mapping from \\\"\" << bible_book_candidate << \"\\\" to a book code was found!\\n\";\n\n        std::exit(EXIT_FAILURE); \/\/ Unknown bible book!\n    }\n\n    return bible_book_and_code->second;\n}\n\n\nvoid HandlePericopes(const bool verbose, const bool generate_solr_query, const std::string &bible_reference_candidate,\n                     const std::string &pericopes_to_codes_map_filename)\n{\n    std::unordered_multimap<std::string, std::string> pericopes_to_codes_map;\n    MapIO::DeserialiseMap(pericopes_to_codes_map_filename, &pericopes_to_codes_map);\n\n    const auto begin_end(pericopes_to_codes_map.equal_range(bible_reference_candidate));\n    if (begin_end.first != begin_end.second) {\n        if (verbose)\n            std::cerr << \"Found a pericope to codes mapping.\\n\";\n        std::string query;\n        for (auto pair(begin_end.first); pair != begin_end.second; ++pair) {\n            if (generate_solr_query) {\n                if (not query.empty())\n                    query += ' ';\n                query += StringUtil::Map(pair->second, ':', '_');\n            } else\n                std::cout << pair->second << '\\n';\n        }\n        if (generate_solr_query)\n            std::cout << query << '\\n';\n\n        std::exit(EXIT_SUCCESS);\n    }\n}\n\n\nvoid HandleBookRanges(const bool verbose, const bool generate_solr_query,\n                      const std::string &books_of_the_bible_to_canonical_form_map_filename,\n                      const std::string &books_of_the_bible_to_code_map_filename,\n                      const std::string &bible_reference_candidate)\n{\n    const RegexMatcher *matcher(RegexMatcher::RegexMatcherFactory(\"^([12])-([23])\\\\s*([A-Za-z]+)\\\\s*$\"));\n    if (not matcher->matched(bible_reference_candidate))\n        return;\n\n    unsigned starting_volume;\n    if (not StringUtil::ToUnsigned((*matcher)[1], &starting_volume) or starting_volume > 2)\n        Error(\"\\\"\" + (*matcher)[1] + \"\\\" is not a valid starting volume!\");\n\n    unsigned ending_volume;\n    if (not StringUtil::ToUnsigned((*matcher)[2], &ending_volume) or ending_volume > 3\n        or ending_volume <= starting_volume)\n        Error(\"\\\"\" + (*matcher)[2] + \"\\\" is not a valid ending volume!\");\n\n    const std::string non_canonical_book_name((*matcher)[3]);\n    const std::string starting_bible_book_candidate(\n        CanoniseBibleBook(verbose, books_of_the_bible_to_canonical_form_map_filename,\n                          std::to_string(starting_volume) + non_canonical_book_name));\n    const std::string ending_bible_book_candidate(\n        CanoniseBibleBook(verbose, books_of_the_bible_to_canonical_form_map_filename,\n                          std::to_string(ending_volume) + non_canonical_book_name));\n    if (verbose) {\n        std::cout << \"Identified a bible book range.  Starting volume \" << starting_volume << \", ending volume \"\n                  << ending_volume << \", book is \\\"\" << non_canonical_book_name << \"\\\".\\n\";\n    }\n\n    const std::string first_book_code(MapBibleBookToCode(verbose, starting_bible_book_candidate,\n                                                         books_of_the_bible_to_code_map_filename));\n    const std::string second_book_code(MapBibleBookToCode(verbose, ending_bible_book_candidate,\n                                                          books_of_the_bible_to_code_map_filename));\n\n    std::cout << (first_book_code + std::string(BibleReferenceParser::MAX_CHAPTER_LENGTH\n                                                + BibleReferenceParser::MAX_VERSE_LENGTH, '0'))\n              << (generate_solr_query ? '_' : ':')\n              << (second_book_code + std::string(BibleReferenceParser::MAX_CHAPTER_LENGTH\n                                                 + BibleReferenceParser::MAX_VERSE_LENGTH, '9'))\n              << '\\n';\n\n    std::exit(EXIT_SUCCESS);\n}\n\n\nvoid HandleOrdinaryReferences(const bool verbose, const bool generate_solr_query,\n                              std::string bible_reference_candidate,\n                              const std::string &bible_books_to_codes_map_filename,\n                              const std::string &books_of_the_bible_to_canonical_form_map_filename)\n{\n    bible_reference_candidate = CanoniseLeadingNumber(InsertSpaceAtFirstLetterDigitBoundary(\n                                    StringUtil::RemoveChars(\" \\t\", &bible_reference_candidate)));\n    std::string book_candidate, chapters_and_verses_candidate;\n    SplitIntoBookAndChaptersAndVerses(bible_reference_candidate, &book_candidate, &chapters_and_verses_candidate);\n    if (verbose) {\n        std::cerr << \"book_candidate = \\\"\" << book_candidate << \"\\\"\\n\";\n        std::cerr << \"chapters_and_verses_candidate = \\\"\" << chapters_and_verses_candidate << \"\\\"\\n\";\n    }\n\n    book_candidate = CanoniseBibleBook(verbose, books_of_the_bible_to_canonical_form_map_filename, book_candidate);\n    const std::string book_code(MapBibleBookToCode(verbose, book_candidate, bible_books_to_codes_map_filename));\n    if (verbose)\n        std::cerr << \"book code = \\\"\" << book_code << \"\\\"\\n\";\n    if (chapters_and_verses_candidate.empty()) {\n        std::cout << book_code\n                  << std::string(BibleReferenceParser::MAX_CHAPTER_LENGTH\n                                 + BibleReferenceParser::MAX_VERSE_LENGTH, '0')\n                  << (generate_solr_query ? '_' : ':') << book_code\n                  << std::string(BibleReferenceParser::MAX_CHAPTER_LENGTH\n                                 + BibleReferenceParser::MAX_VERSE_LENGTH, '9')\n                  << '\\n';\n\n        std::exit(EXIT_SUCCESS);\n    }\n\n    std::set<std::pair<std::string, std::string>> start_end;\n    if (not BibleReferenceParser::ParseBibleReference(chapters_and_verses_candidate, book_code, &start_end)) {\n        if (verbose)\n            std::cerr << \"The parsing of \\\"\" << chapters_and_verses_candidate\n                      << \"\\\" as chapters and verses failed!\\n\";\n        std::exit(EXIT_FAILURE);\n    }\n\n    std::string query;\n    for (const auto &pair : start_end) {\n        if (generate_solr_query) {\n            if (not query.empty())\n                query += ' ';\n            query += pair.first + \"_\" + pair.second;\n        } else\n            std::cout << pair.first << ':' << pair.second << '\\n';\n    }\n    if (generate_solr_query)\n        std::cout << query << '\\n';\n}\n\n\nstatic void Usage() __attribute__((noreturn));\n\n\nstatic void Usage() {\n    std::cerr << \"usage: \" << progname << \" [--debug|--query] bible_reference_candidate\\n\";\n    std::cerr << \"          books_of_the_bible_to_code_map\\n\";\n    std::cerr << \"          books_of_the_bible_to_canonical_form_map pericopes_to_codes_map\\n\";\n    std::cerr << '\\n';\n    std::cerr << \"          When --debug has been specified additional tracing output will be generated.\\n\";\n    std::cerr << \"          When --query has been specified SOLR search queries will be output.\\n\";\n    std::exit(EXIT_FAILURE);\n}\n\n\nint main(int argc, char **argv) {\n    ::progname = argv[0];\n\n    bool verbose(false), generate_solr_query(false);\n\n    if (argc == 6) {\n        if (std::strcmp(argv[1], \"--debug\") == 0)\n            verbose = true;\n        else if (std::strcmp(argv[1], \"--query\") == 0)\n            generate_solr_query = true;\n        else\n            Usage();\n        ++argv, --argc;\n    }\n\n    if (argc != 5)\n        Usage();\n\n    const std::string books_of_the_bible_to_code_map_filename(argv[2]);\n    const std::string books_of_the_bible_to_canonical_form_map_filename(argv[3]);\n    std::string bible_reference_candidate(StringUtil::Trim(StringUtil::ToLower(argv[1])));\n    StringUtil::CollapseWhitespace(&bible_reference_candidate);\n\n    HandleBookRanges(verbose, generate_solr_query, books_of_the_bible_to_canonical_form_map_filename,\n                     books_of_the_bible_to_code_map_filename, bible_reference_candidate);\n    HandlePericopes(verbose, generate_solr_query, bible_reference_candidate, argv[4]);\n    HandleOrdinaryReferences(verbose, generate_solr_query, bible_reference_candidate,\n                             books_of_the_bible_to_code_map_filename,\n                             books_of_the_bible_to_canonical_form_map_filename);\n}\n<commit_msg>Allow \"ö\" in bible book names.<commit_after>\/** \\file    bib_ref_to_codes_tool.cc\n *  \\brief   A tool for converting bible references to numeric codes.\n *  \\author  Dr. Johannes Ruscheinski\n *\/\n\n\/*\n    Copyright (C) 2015-2017, 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#include <fstream>\n#include <iostream>\n#include <string>\n#include <unordered_map>\n#include <cctype>\n#include <cstdlib>\n#include <cstring>\n#include \"BibleReferenceParser.h\"\n#include \"MapIO.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nstd::string InsertSpaceAtFirstLetterDigitBoundary(const std::string &s) {\n    if (s.empty())\n        return s;\n\n    std::string retval;\n    bool found_first_boundary(false);\n    auto ch(s.cbegin());\n    retval += *ch;\n    while (++ch != s.cend()) {\n        if (not found_first_boundary and (std::isalpha(*(ch - 1)) and std::isdigit(*ch))) {\n            found_first_boundary = true;\n            retval += ' ';\n        }\n\n        retval += *ch;\n    }\n\n    return retval;\n}\n\n\n\/\/ Squeezes out spaces after a leading number, e.g. \"1. mos\" => \"1.mos\" or \"1 mos\" => \"1mos\".\nstd::string CanoniseLeadingNumber(const std::string &bible_reference_candidate) {\n    static const RegexMatcher * const matcher(RegexMatcher::RegexMatcherFactory(\"^\\\\d\\\\.?\\\\s+\\\\S+\"));\n    std::string err_msg;\n    if (not matcher->matched(bible_reference_candidate, &err_msg)) {\n        if (not err_msg.empty())\n            Error(\"unexpected reg ex error: \" + err_msg);\n        return bible_reference_candidate;\n    }\n\n    std::string ordinal_string;\n    ordinal_string = bible_reference_candidate[0];\n    size_t rest_start(1);\n    if (bible_reference_candidate[1] == '.') {\n        ordinal_string += '.';\n        ++rest_start;\n    }\n\n    while (isspace(bible_reference_candidate[rest_start]))\n        ++rest_start;\n\n    return ordinal_string + bible_reference_candidate.substr(rest_start);\n}\n\n\nvoid SplitIntoBookAndChaptersAndVerses(const std::string &bible_reference_candidate,\n                                       std::string * const book_candidate,\n                                       std::string * const chapters_and_verses_candidate)\n{\n    book_candidate->clear();\n    chapters_and_verses_candidate->clear();\n\n    const size_t len(bible_reference_candidate.length());\n    if (len <= 3)\n        *book_candidate = bible_reference_candidate;\n    else if (isdigit(bible_reference_candidate[len - 1])\n             or (isalpha(bible_reference_candidate[len - 1]) and isdigit(bible_reference_candidate[len - 2])))\n    {\n        const size_t last_space_pos(bible_reference_candidate.rfind(' '));\n        if (last_space_pos == std::string::npos)\n            *book_candidate = bible_reference_candidate;\n        else {\n            *book_candidate = bible_reference_candidate.substr(0, last_space_pos);\n            *chapters_and_verses_candidate = bible_reference_candidate.substr(last_space_pos + 1);\n        }\n    } else\n        *book_candidate = bible_reference_candidate;\n}\n\n\n\/** \\brief Map from noncanonical bible book forms to the canonical ones.\n *  \\return The mapped name or, if no mapping was found, \"bible_book_candidate\".\n *\/\nstd::string CanoniseBibleBook(const bool verbose,\n                              const std::string &books_of_the_bible_to_canonical_form_map_filename,\n                              const std::string &bible_book_candidate)\n{\n    std::unordered_map<std::string, std::string> books_of_the_bible_to_canonical_form_map;\n    MapIO::DeserialiseMap(books_of_the_bible_to_canonical_form_map_filename,\n                          &books_of_the_bible_to_canonical_form_map);\n    const auto non_canonical_form_and_canonical_form(\n        books_of_the_bible_to_canonical_form_map.find(bible_book_candidate));\n    if (non_canonical_form_and_canonical_form != books_of_the_bible_to_canonical_form_map.end()) {\n        if (verbose)\n            std::cerr << \"Replacing \\\"\" << bible_book_candidate << \"\\\" with \\\"\"\n                      << non_canonical_form_and_canonical_form->second << \"\\\".\\n\";\n        return non_canonical_form_and_canonical_form->second;\n    }\n\n    return bible_book_candidate;\n}\n\n\nstd::string MapBibleBookToCode(const bool verbose, const std::string &bible_book_candidate,\n                               const std::string &books_of_the_bible_to_code_map_filename)\n{\n    std::unordered_map<std::string, std::string> bible_books_to_codes_map;\n    MapIO::DeserialiseMap(books_of_the_bible_to_code_map_filename, &bible_books_to_codes_map);\n    const auto bible_book_and_code(bible_books_to_codes_map.find(bible_book_candidate));\n    if (bible_book_and_code == bible_books_to_codes_map.end()) {\n        if (verbose)\n            std::cerr << \"No mapping from \\\"\" << bible_book_candidate << \"\\\" to a book code was found!\\n\";\n\n        std::exit(EXIT_FAILURE); \/\/ Unknown bible book!\n    }\n\n    return bible_book_and_code->second;\n}\n\n\nvoid HandlePericopes(const bool verbose, const bool generate_solr_query, const std::string &bible_reference_candidate,\n                     const std::string &pericopes_to_codes_map_filename)\n{\n    std::unordered_multimap<std::string, std::string> pericopes_to_codes_map;\n    MapIO::DeserialiseMap(pericopes_to_codes_map_filename, &pericopes_to_codes_map);\n\n    const auto begin_end(pericopes_to_codes_map.equal_range(bible_reference_candidate));\n    if (begin_end.first != begin_end.second) {\n        if (verbose)\n            std::cerr << \"Found a pericope to codes mapping.\\n\";\n        std::string query;\n        for (auto pair(begin_end.first); pair != begin_end.second; ++pair) {\n            if (generate_solr_query) {\n                if (not query.empty())\n                    query += ' ';\n                query += StringUtil::Map(pair->second, ':', '_');\n            } else\n                std::cout << pair->second << '\\n';\n        }\n        if (generate_solr_query)\n            std::cout << query << '\\n';\n\n        std::exit(EXIT_SUCCESS);\n    }\n}\n\n\nvoid HandleBookRanges(const bool verbose, const bool generate_solr_query,\n                      const std::string &books_of_the_bible_to_canonical_form_map_filename,\n                      const std::string &books_of_the_bible_to_code_map_filename,\n                      const std::string &bible_reference_candidate)\n{\n    const RegexMatcher *matcher(RegexMatcher::RegexMatcherFactory(\"^([12])-([23])\\\\s*([A-ZÖa-zö]+)\\\\s*$\"));\n    if (not matcher->matched(bible_reference_candidate))\n        return;\n\n    unsigned starting_volume;\n    if (not StringUtil::ToUnsigned((*matcher)[1], &starting_volume) or starting_volume > 2)\n        Error(\"\\\"\" + (*matcher)[1] + \"\\\" is not a valid starting volume!\");\n\n    unsigned ending_volume;\n    if (not StringUtil::ToUnsigned((*matcher)[2], &ending_volume) or ending_volume > 3\n        or ending_volume <= starting_volume)\n        Error(\"\\\"\" + (*matcher)[2] + \"\\\" is not a valid ending volume!\");\n\n    const std::string non_canonical_book_name((*matcher)[3]);\n    const std::string starting_bible_book_candidate(\n        CanoniseBibleBook(verbose, books_of_the_bible_to_canonical_form_map_filename,\n                          std::to_string(starting_volume) + non_canonical_book_name));\n    const std::string ending_bible_book_candidate(\n        CanoniseBibleBook(verbose, books_of_the_bible_to_canonical_form_map_filename,\n                          std::to_string(ending_volume) + non_canonical_book_name));\n    if (verbose) {\n        std::cout << \"Identified a bible book range.  Starting volume \" << starting_volume << \", ending volume \"\n                  << ending_volume << \", book is \\\"\" << non_canonical_book_name << \"\\\".\\n\";\n    }\n\n    const std::string first_book_code(MapBibleBookToCode(verbose, starting_bible_book_candidate,\n                                                         books_of_the_bible_to_code_map_filename));\n    const std::string second_book_code(MapBibleBookToCode(verbose, ending_bible_book_candidate,\n                                                          books_of_the_bible_to_code_map_filename));\n\n    std::cout << (first_book_code + std::string(BibleReferenceParser::MAX_CHAPTER_LENGTH\n                                                + BibleReferenceParser::MAX_VERSE_LENGTH, '0'))\n              << (generate_solr_query ? '_' : ':')\n              << (second_book_code + std::string(BibleReferenceParser::MAX_CHAPTER_LENGTH\n                                                 + BibleReferenceParser::MAX_VERSE_LENGTH, '9'))\n              << '\\n';\n\n    std::exit(EXIT_SUCCESS);\n}\n\n\nvoid HandleOrdinaryReferences(const bool verbose, const bool generate_solr_query,\n                              std::string bible_reference_candidate,\n                              const std::string &bible_books_to_codes_map_filename,\n                              const std::string &books_of_the_bible_to_canonical_form_map_filename)\n{\n    bible_reference_candidate = CanoniseLeadingNumber(InsertSpaceAtFirstLetterDigitBoundary(\n                                    StringUtil::RemoveChars(\" \\t\", &bible_reference_candidate)));\n    std::string book_candidate, chapters_and_verses_candidate;\n    SplitIntoBookAndChaptersAndVerses(bible_reference_candidate, &book_candidate, &chapters_and_verses_candidate);\n    if (verbose) {\n        std::cerr << \"book_candidate = \\\"\" << book_candidate << \"\\\"\\n\";\n        std::cerr << \"chapters_and_verses_candidate = \\\"\" << chapters_and_verses_candidate << \"\\\"\\n\";\n    }\n\n    book_candidate = CanoniseBibleBook(verbose, books_of_the_bible_to_canonical_form_map_filename, book_candidate);\n    const std::string book_code(MapBibleBookToCode(verbose, book_candidate, bible_books_to_codes_map_filename));\n    if (verbose)\n        std::cerr << \"book code = \\\"\" << book_code << \"\\\"\\n\";\n    if (chapters_and_verses_candidate.empty()) {\n        std::cout << book_code\n                  << std::string(BibleReferenceParser::MAX_CHAPTER_LENGTH\n                                 + BibleReferenceParser::MAX_VERSE_LENGTH, '0')\n                  << (generate_solr_query ? '_' : ':') << book_code\n                  << std::string(BibleReferenceParser::MAX_CHAPTER_LENGTH\n                                 + BibleReferenceParser::MAX_VERSE_LENGTH, '9')\n                  << '\\n';\n\n        std::exit(EXIT_SUCCESS);\n    }\n\n    std::set<std::pair<std::string, std::string>> start_end;\n    if (not BibleReferenceParser::ParseBibleReference(chapters_and_verses_candidate, book_code, &start_end)) {\n        if (verbose)\n            std::cerr << \"The parsing of \\\"\" << chapters_and_verses_candidate\n                      << \"\\\" as chapters and verses failed!\\n\";\n        std::exit(EXIT_FAILURE);\n    }\n\n    std::string query;\n    for (const auto &pair : start_end) {\n        if (generate_solr_query) {\n            if (not query.empty())\n                query += ' ';\n            query += pair.first + \"_\" + pair.second;\n        } else\n            std::cout << pair.first << ':' << pair.second << '\\n';\n    }\n    if (generate_solr_query)\n        std::cout << query << '\\n';\n}\n\n\nstatic void Usage() __attribute__((noreturn));\n\n\nstatic void Usage() {\n    std::cerr << \"usage: \" << progname << \" [--debug|--query] bible_reference_candidate\\n\";\n    std::cerr << \"          books_of_the_bible_to_code_map\\n\";\n    std::cerr << \"          books_of_the_bible_to_canonical_form_map pericopes_to_codes_map\\n\";\n    std::cerr << '\\n';\n    std::cerr << \"          When --debug has been specified additional tracing output will be generated.\\n\";\n    std::cerr << \"          When --query has been specified SOLR search queries will be output.\\n\";\n    std::exit(EXIT_FAILURE);\n}\n\n\nint main(int argc, char **argv) {\n    ::progname = argv[0];\n\n    bool verbose(false), generate_solr_query(false);\n\n    if (argc == 6) {\n        if (std::strcmp(argv[1], \"--debug\") == 0)\n            verbose = true;\n        else if (std::strcmp(argv[1], \"--query\") == 0)\n            generate_solr_query = true;\n        else\n            Usage();\n        ++argv, --argc;\n    }\n\n    if (argc != 5)\n        Usage();\n\n    const std::string books_of_the_bible_to_code_map_filename(argv[2]);\n    const std::string books_of_the_bible_to_canonical_form_map_filename(argv[3]);\n    std::string bible_reference_candidate(StringUtil::Trim(StringUtil::ToLower(argv[1])));\n    StringUtil::CollapseWhitespace(&bible_reference_candidate);\n\n    HandleBookRanges(verbose, generate_solr_query, books_of_the_bible_to_canonical_form_map_filename,\n                     books_of_the_bible_to_code_map_filename, bible_reference_candidate);\n    HandlePericopes(verbose, generate_solr_query, bible_reference_candidate, argv[4]);\n    HandleOrdinaryReferences(verbose, generate_solr_query, bible_reference_candidate,\n                             books_of_the_bible_to_code_map_filename,\n                             books_of_the_bible_to_canonical_form_map_filename);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \\brief Utility for deleting partial or entire MARC records based on an input list.\n *  \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *  \\documentation https:\/\/wiki.bsz-bw.de\/doku.php?id=v-team:daten:datendienste:sekkor under \"Löschungen\".\n *\n *  \\copyright 2015-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\n#include <iostream>\n#include <memory>\n#include <vector>\n#include <cstdlib>\n#include \"BSZUtil.h\"\n#include \"DbConnection.h\"\n#include \"FileUtil.h\"\n#include \"MARC.h\"\n#include \"StringUtil.h\"\n#include \"UBTools.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\n[[noreturn]] void Usage() {\n    ::Usage(\"[--input-format=(marc-21|marc-xml)] [--output-format=(marc-21|marc-xml)]\"\n            \" deletion_list input_marc21 output_marc21 entire_record_deletion_log\\n\"\n            \"Record ID's of records that were deleted and not merely modified will be written to \\\"entire_record_deletion_log\\\".\");\n}\n\n\n\/** \\brief Deletes LOK sections from the local data database if their pseudo tags are found in \"local_deletion_ids\"\n *\/\nvoid DeleteLocalSections(DbConnection * const db_connection, const std::unordered_set <std::string> &local_deletion_ids,\n                         const std::string &ppn)\n{\n    db_connection->queryOrDie(\"SELECT local_fields FROM local_data WHERE ppn = \"\n                              + db_connection->escapeAndQuoteString(ppn));\n    auto result_set(db_connection->getLastResultSet());\n    if (result_set.empty())\n        return; \/\/ Nothing to be done!\n\n    const auto row(result_set.getNextRow());\n    const auto local_fields_blob(row[\"local_fields\"]);\n\n    size_t processed_size(0);\n    bool keep_section;\n    std::string new_local_fields_blob;\n    do {\n        \/\/ Convert the 4 character hex string to size of the following field contents:\n        const size_t field_contents_size(StringUtil::ToUnsignedLong(local_fields_blob.substr(processed_size, 4), 16));\n        processed_size += 4;\n\n        if (unlikely(processed_size + field_contents_size > local_fields_blob.size()))\n            LOG_ERROR(\"Inconsitent blob length for record with PPN \" + ppn);\n\n        const MARC::Record::Field local_field(local_fields_blob.substr(processed_size, field_contents_size));\n        const auto pseudo_tag_and_data(local_field.getFirstSubfieldWithCode('0'));\n        if (StringUtil::StartsWith(pseudo_tag_and_data, \"001 \"))\n            keep_section = local_deletion_ids.find(pseudo_tag_and_data.substr(4)) != local_deletion_ids.cend();\n\n        if (keep_section)\n            new_local_fields_blob += local_fields_blob.substr(processed_size - 4, 4 + field_contents_size);\n\n        processed_size += field_contents_size;\n    } while (processed_size < local_fields_blob.size());\n\n    if (new_local_fields_blob.size() < local_fields_blob.size()) {\n        if (new_local_fields_blob.empty())\n            db_connection->queryOrDie(\"DELETE FROM local_data WHERE ppn = \"\n                                      + db_connection->escapeAndQuoteString(ppn));\n        else\n            db_connection->queryOrDie(\"REPLACE INTO local_data (ppn, local_fields) VALUES(\"\n                                      + db_connection->escapeAndQuoteString(ppn) + \",\"\n                                      + db_connection->sqliteEscapeBlobData(new_local_fields_blob) + \")\");\n    }\n}\n\n\nvoid ProcessRecords(DbConnection * const db_connection, const std::unordered_set <std::string> &title_deletion_ids,\n                    const std::unordered_set <std::string> &local_deletion_ids, MARC::Reader * const marc_reader,\n                    MARC::Writer * const marc_writer, File * const entire_record_deletion_log)\n{\n    unsigned total_record_count(0), deleted_record_count(0);\n    while (MARC::Record record = marc_reader->read()) {\n        ++total_record_count;\n\n        if (title_deletion_ids.find(record.getControlNumber()) != title_deletion_ids.end()) {\n            ++deleted_record_count;\n            (*entire_record_deletion_log) << record.getControlNumber() << '\\n';\n        } else\n            marc_writer->write(record);\n\n        if (not local_deletion_ids.empty())\n            DeleteLocalSections(db_connection, local_deletion_ids, record.getControlNumber());\n    }\n\n    LOG_INFO(\"Read \" + std::to_string(total_record_count) + \" records.\");\n    LOG_INFO(\"Deleted \" + std::to_string(deleted_record_count) + \" records.\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n    if (argc < 5)\n        Usage();\n\n    const auto reader_type(MARC::GetOptionalReaderType(&argc, &argv, 1));\n    const auto writer_type(MARC::GetOptionalWriterType(&argc, &argv, 1));\n\n    if (argc != 5)\n        Usage();\n\n    const auto deletion_list(FileUtil::OpenInputFileOrDie(argv[1]));\n    std::unordered_set<std::string> title_deletion_ids, local_deletion_ids;\n    BSZUtil::ExtractDeletionIds(deletion_list.get(), &title_deletion_ids, &local_deletion_ids);\n\n    DbConnection db_connection(UBTools::GetTuelibPath() + \"local_data.sq3\", DbConnection::READWRITE);\n\n    const auto marc_reader(MARC::Reader::Factory(argv[2], reader_type));\n    const auto marc_writer(MARC::Writer::Factory(argv[3], writer_type));\n    const auto entire_record_deletion_log(FileUtil::OpenForAppendingOrDie(argv[4]));\n\n    ProcessRecords(&db_connection,title_deletion_ids, local_deletion_ids, marc_reader.get(), marc_writer.get(), entire_record_deletion_log.get());\n\n    return EXIT_SUCCESS;\n}\n<commit_msg>Comment fix<commit_after>\/** \\brief Utility for deleting partial or entire MARC records based on an input list.\n *  \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *  \\documentation https:\/\/wiki.bsz-bw.de\/doku.php?id=v-team:daten:datendienste:sekkor under \"Löschungen\".\n *\n *  \\copyright 2015-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\n#include <iostream>\n#include <memory>\n#include <vector>\n#include <cstdlib>\n#include \"BSZUtil.h\"\n#include \"DbConnection.h\"\n#include \"FileUtil.h\"\n#include \"MARC.h\"\n#include \"StringUtil.h\"\n#include \"UBTools.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\n[[noreturn]] void Usage() {\n    ::Usage(\"[--input-format=(marc-21|marc-xml)] [--output-format=(marc-21|marc-xml)]\"\n            \" deletion_list input_marc21 output_marc21 entire_record_deletion_log\\n\"\n            \"Record ID's of records that were deleted and not merely modified will be written to \\\"entire_record_deletion_log\\\".\");\n}\n\n\n\/** \\brief Deletes LOK sections from the local data database if their pseudo tags are found in \"local_deletion_ids\"\n *\/\nvoid DeleteLocalSections(DbConnection * const db_connection, const std::unordered_set <std::string> &local_deletion_ids,\n                         const std::string &ppn)\n{\n    db_connection->queryOrDie(\"SELECT local_fields FROM local_data WHERE ppn = \"\n                              + db_connection->escapeAndQuoteString(ppn));\n    auto result_set(db_connection->getLastResultSet());\n    if (result_set.empty())\n        return; \/\/ Nothing to be done!\n\n    const auto row(result_set.getNextRow());\n    const auto local_fields_blob(row[\"local_fields\"]);\n\n    size_t processed_size(0);\n    bool keep_section;\n    std::string new_local_fields_blob;\n    do {\n        \/\/ Convert the 4 character hex string to the size of the following field contents:\n        const size_t field_contents_size(StringUtil::ToUnsignedLong(local_fields_blob.substr(processed_size, 4), 16));\n        processed_size += 4;\n\n        if (unlikely(processed_size + field_contents_size > local_fields_blob.size()))\n            LOG_ERROR(\"Inconsitent blob length for record with PPN \" + ppn);\n\n        const MARC::Record::Field local_field(local_fields_blob.substr(processed_size, field_contents_size));\n        const auto pseudo_tag_and_data(local_field.getFirstSubfieldWithCode('0'));\n        if (StringUtil::StartsWith(pseudo_tag_and_data, \"001 \"))\n            keep_section = local_deletion_ids.find(pseudo_tag_and_data.substr(4)) != local_deletion_ids.cend();\n\n        if (keep_section)\n            new_local_fields_blob += local_fields_blob.substr(processed_size - 4, 4 + field_contents_size);\n\n        processed_size += field_contents_size;\n    } while (processed_size < local_fields_blob.size());\n\n    if (new_local_fields_blob.size() < local_fields_blob.size()) {\n        if (new_local_fields_blob.empty())\n            db_connection->queryOrDie(\"DELETE FROM local_data WHERE ppn = \"\n                                      + db_connection->escapeAndQuoteString(ppn));\n        else\n            db_connection->queryOrDie(\"REPLACE INTO local_data (ppn, local_fields) VALUES(\"\n                                      + db_connection->escapeAndQuoteString(ppn) + \",\"\n                                      + db_connection->sqliteEscapeBlobData(new_local_fields_blob) + \")\");\n    }\n}\n\n\nvoid ProcessRecords(DbConnection * const db_connection, const std::unordered_set <std::string> &title_deletion_ids,\n                    const std::unordered_set <std::string> &local_deletion_ids, MARC::Reader * const marc_reader,\n                    MARC::Writer * const marc_writer, File * const entire_record_deletion_log)\n{\n    unsigned total_record_count(0), deleted_record_count(0);\n    while (MARC::Record record = marc_reader->read()) {\n        ++total_record_count;\n\n        if (title_deletion_ids.find(record.getControlNumber()) != title_deletion_ids.end()) {\n            ++deleted_record_count;\n            (*entire_record_deletion_log) << record.getControlNumber() << '\\n';\n        } else\n            marc_writer->write(record);\n\n        if (not local_deletion_ids.empty())\n            DeleteLocalSections(db_connection, local_deletion_ids, record.getControlNumber());\n    }\n\n    LOG_INFO(\"Read \" + std::to_string(total_record_count) + \" records.\");\n    LOG_INFO(\"Deleted \" + std::to_string(deleted_record_count) + \" records.\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n    if (argc < 5)\n        Usage();\n\n    const auto reader_type(MARC::GetOptionalReaderType(&argc, &argv, 1));\n    const auto writer_type(MARC::GetOptionalWriterType(&argc, &argv, 1));\n\n    if (argc != 5)\n        Usage();\n\n    const auto deletion_list(FileUtil::OpenInputFileOrDie(argv[1]));\n    std::unordered_set<std::string> title_deletion_ids, local_deletion_ids;\n    BSZUtil::ExtractDeletionIds(deletion_list.get(), &title_deletion_ids, &local_deletion_ids);\n\n    DbConnection db_connection(UBTools::GetTuelibPath() + \"local_data.sq3\", DbConnection::READWRITE);\n\n    const auto marc_reader(MARC::Reader::Factory(argv[2], reader_type));\n    const auto marc_writer(MARC::Writer::Factory(argv[3], writer_type));\n    const auto entire_record_deletion_log(FileUtil::OpenForAppendingOrDie(argv[4]));\n\n    ProcessRecords(&db_connection,title_deletion_ids, local_deletion_ids, marc_reader.get(), marc_writer.get(), entire_record_deletion_log.get());\n\n    return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: environment.hxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: kz $ $Date: 2007-05-09 13:35: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 _UNO_ENVIRONMENT_HXX_\n#define _UNO_ENVIRONMENT_HXX_\n\n#ifndef _RTL_ALLOC_H_\n#include <rtl\/alloc.h>\n#endif\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _UNO_ENVIRONMENT_H_\n#include <uno\/environment.h>\n#endif\n\n#include \"uno\/lbnames.h\"\n\n\/** *\/ \/\/for docpp\nnamespace com\n{\n\/** *\/ \/\/for docpp\nnamespace sun\n{\n\/** *\/ \/\/for docpp\nnamespace star\n{\n\/** *\/ \/\/for docpp\nnamespace uno\n{\n\n\/** C++ wrapper for binary C uno_Environment.\n\n    @see uno_Environment\n*\/\nclass Environment\n{\n    \/** binary C uno_Environment\n    *\/\n    uno_Environment * _pEnv;\n\npublic:\n    \/** Returns the current Environment.\n\n        @param env_type   the optional type of the Environment, falls back to \"uno\" in case being empty,\n                          respectively to current C++ Environment.\n        @since UDK 3.2.7\n    *\/\n    inline static Environment getCurrent(rtl::OUString const & typeName = rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(CPPU_STRINGIFY(CPPU_ENV)))) SAL_THROW( () );\n\n    \/\/ these are here to force memory de\/allocation to sal lib.\n    \/** @internal *\/\n    inline static void * SAL_CALL operator new ( size_t nSize ) SAL_THROW( () )\n        { return ::rtl_allocateMemory( nSize ); }\n    \/** @internal *\/\n    inline static void SAL_CALL operator delete ( void * pMem ) SAL_THROW( () )\n        { ::rtl_freeMemory( pMem ); }\n    \/** @internal *\/\n    inline static void * SAL_CALL operator new ( size_t, void * pMem ) SAL_THROW( () )\n        { return pMem; }\n    \/** @internal *\/\n    inline static void SAL_CALL operator delete ( void *, void * ) SAL_THROW( () )\n        {}\n\n    \/** Constructor: acquires given environment\n\n        @param pEnv environment\n    *\/\n    inline Environment( uno_Environment * pEnv = 0 ) SAL_THROW( () );\n\n    \/** Gets a specific environment. If the specified environment does not exist, then a default one\n        is created and registered.\n\n        @param envDcp           descriptor of the environment\n        @param pContext         context pointer\n    *\/\n    inline explicit Environment( rtl::OUString const & envDcp, void * pContext = NULL ) SAL_THROW( () );\n\n\n    \/** Copy constructor: acquires given environment\n\n        @param rEnv another environment\n    *\/\n    inline Environment( const Environment & rEnv ) SAL_THROW( () );\n\n    \/** Destructor: releases a set environment.\n    *\/\n    inline ~Environment() SAL_THROW( () );\n\n    \/** Sets a given environment, i.e. acquires given one and releases a set one.\n\n        @param pEnv another environment\n        @return this environment\n    *\/\n    inline Environment & SAL_CALL operator = ( uno_Environment * pEnv ) SAL_THROW( () );\n    \/** Sets a given environment, i.e. acquires given one and releases a set one.\n\n        @param rEnv another environment\n        @return this environment\n    *\/\n    inline Environment & SAL_CALL operator = ( const Environment & rEnv ) SAL_THROW( () )\n        { return operator = ( rEnv._pEnv ); }\n\n    \/** Provides UNacquired pointer to the set C environment.\n\n        @return UNacquired pointer to the C environment struct\n    *\/\n    inline uno_Environment * SAL_CALL get() const SAL_THROW( () )\n        { return _pEnv; }\n\n    \/** Gets type name of set environment.\n\n        @return type name of set environment\n    *\/\n    inline ::rtl::OUString SAL_CALL getTypeName() const SAL_THROW( () )\n        { return _pEnv->pTypeName; }\n\n    \/** Gets free context pointer of set environment.\n\n        @return free context pointer of set environment\n    *\/\n    inline void * SAL_CALL getContext() const SAL_THROW( () )\n        { return _pEnv->pContext; }\n\n    \/** Tests if a environment is set.\n\n        @return true, if a environment is set, false otherwise\n    *\/\n    inline sal_Bool SAL_CALL is() const SAL_THROW( () )\n        { return (_pEnv != 0); }\n\n    \/** Releases a set environment.\n    *\/\n    inline void SAL_CALL clear() SAL_THROW( () );\n\n    \/** Invoke the passed function in this environment.\n\n        @param pCallee  the function to call\n        @param param    the parameter pointer to be passed to the function\n        @since UDK 3.2.7\n    *\/\n    inline void SAL_CALL invoke_v(uno_EnvCallee * pCallee, va_list param) const SAL_THROW( () );\n\n    \/** Invoke the passed function in this environment.\n\n        @param pCallee  the function to call\n        @param ...      the parameters to be passed to the function\n        @since UDK 3.2.7\n    *\/\n    inline void SAL_CALL invoke(uno_EnvCallee * pCallee, ...) const SAL_THROW( () );\n\n    \/** Enter this environment explicitly.\n\n        @since UDK 3.2.7\n    *\/\n    inline void SAL_CALL enter() const SAL_THROW( () );\n\n    \/** Checks, if it is valid to currently call objects\n        belonging to this environment.\n\n        @since UDK 3.2.7\n    *\/\n    inline int  SAL_CALL isValid(rtl::OUString * pReason) const SAL_THROW( () );\n};\n\/\/__________________________________________________________________________________________________\ninline Environment::Environment( uno_Environment * pEnv ) SAL_THROW( () )\n    : _pEnv( pEnv )\n{\n    if (_pEnv)\n        (*_pEnv->acquire)( _pEnv );\n}\n\/\/__________________________________________________________________________________________________\ninline Environment::Environment( rtl::OUString const & rEnvDcp, void * pContext ) SAL_THROW( () )\n    : _pEnv(NULL)\n{\n    uno_getEnvironment(&_pEnv, rEnvDcp.pData, pContext);\n}\n\/\/__________________________________________________________________________________________________\ninline Environment::Environment( const Environment & rEnv ) SAL_THROW( () )\n    : _pEnv( rEnv._pEnv )\n{\n    if (_pEnv)\n        (*_pEnv->acquire)( _pEnv );\n}\n\/\/__________________________________________________________________________________________________\ninline Environment::~Environment() SAL_THROW( () )\n{\n    if (_pEnv)\n        (*_pEnv->release)( _pEnv );\n}\n\/\/__________________________________________________________________________________________________\ninline void Environment::clear() SAL_THROW( () )\n{\n    if (_pEnv)\n    {\n        (*_pEnv->release)( _pEnv );\n        _pEnv = 0;\n    }\n}\n\/\/__________________________________________________________________________________________________\ninline Environment & Environment::operator = ( uno_Environment * pEnv ) SAL_THROW( () )\n{\n    if (pEnv != _pEnv)\n    {\n        if (pEnv)\n            (*pEnv->acquire)( pEnv );\n        if (_pEnv)\n            (*_pEnv->release)( _pEnv );\n        _pEnv = pEnv;\n    }\n    return *this;\n}\n\/\/__________________________________________________________________________________________________\ninline void SAL_CALL Environment::invoke_v(uno_EnvCallee * pCallee, va_list param) const SAL_THROW( () )\n{\n    if (_pEnv)\n        uno_Environment_invoke_v(_pEnv, pCallee, param);\n}\n\/\/__________________________________________________________________________________________________\ninline void SAL_CALL Environment::invoke(uno_EnvCallee * pCallee, ...) const SAL_THROW( () )\n{\n    if (_pEnv)\n    {\n        va_list param;\n\n        va_start(param, pCallee);\n        uno_Environment_invoke_v(_pEnv, pCallee, param);\n        va_end(param);\n    }\n\n}\n\/\/__________________________________________________________________________________________________\ninline void SAL_CALL Environment::enter() const SAL_THROW( () )\n{\n    uno_Environment_enter(_pEnv);\n}\n\/\/__________________________________________________________________________________________________\ninline int  SAL_CALL Environment::isValid(rtl::OUString * pReason) const SAL_THROW( () )\n{\n    return uno_Environment_isValid(_pEnv, (rtl_uString **)pReason);\n}\n\/\/__________________________________________________________________________________________________\ninline Environment Environment::getCurrent(rtl::OUString const & typeName) SAL_THROW( () )\n{\n    Environment environment;\n\n    uno_Environment * pEnv = NULL;\n    uno_getCurrentEnvironment(&pEnv, typeName.pData);\n    environment = pEnv;\n    if (pEnv)\n        pEnv->release(pEnv);\n\n    return environment;\n}\n\n}\n}\n}\n}\n\n#endif\n<commit_msg>INTEGRATION: CWS unomacli64 (1.8.2); FILE MERGED 2007\/06\/05 15:00:52 kr 1.8.2.1: #i77422# Use va_list * instead of plain type<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: environment.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2007-07-18 12:20:30 $\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_ENVIRONMENT_HXX_\n#define _UNO_ENVIRONMENT_HXX_\n\n#ifndef _RTL_ALLOC_H_\n#include <rtl\/alloc.h>\n#endif\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _UNO_ENVIRONMENT_H_\n#include <uno\/environment.h>\n#endif\n\n#include \"uno\/lbnames.h\"\n\n\/** *\/ \/\/for docpp\nnamespace com\n{\n\/** *\/ \/\/for docpp\nnamespace sun\n{\n\/** *\/ \/\/for docpp\nnamespace star\n{\n\/** *\/ \/\/for docpp\nnamespace uno\n{\n\n\/** C++ wrapper for binary C uno_Environment.\n\n    @see uno_Environment\n*\/\nclass Environment\n{\n    \/** binary C uno_Environment\n    *\/\n    uno_Environment * _pEnv;\n\npublic:\n    \/** Returns the current Environment.\n\n        @param env_type   the optional type of the Environment, falls back to \"uno\" in case being empty,\n                          respectively to current C++ Environment.\n        @since UDK 3.2.7\n    *\/\n    inline static Environment getCurrent(rtl::OUString const & typeName = rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(CPPU_STRINGIFY(CPPU_ENV)))) SAL_THROW( () );\n\n    \/\/ these are here to force memory de\/allocation to sal lib.\n    \/** @internal *\/\n    inline static void * SAL_CALL operator new ( size_t nSize ) SAL_THROW( () )\n        { return ::rtl_allocateMemory( nSize ); }\n    \/** @internal *\/\n    inline static void SAL_CALL operator delete ( void * pMem ) SAL_THROW( () )\n        { ::rtl_freeMemory( pMem ); }\n    \/** @internal *\/\n    inline static void * SAL_CALL operator new ( size_t, void * pMem ) SAL_THROW( () )\n        { return pMem; }\n    \/** @internal *\/\n    inline static void SAL_CALL operator delete ( void *, void * ) SAL_THROW( () )\n        {}\n\n    \/** Constructor: acquires given environment\n\n        @param pEnv environment\n    *\/\n    inline Environment( uno_Environment * pEnv = 0 ) SAL_THROW( () );\n\n    \/** Gets a specific environment. If the specified environment does not exist, then a default one\n        is created and registered.\n\n        @param envDcp           descriptor of the environment\n        @param pContext         context pointer\n    *\/\n    inline explicit Environment( rtl::OUString const & envDcp, void * pContext = NULL ) SAL_THROW( () );\n\n\n    \/** Copy constructor: acquires given environment\n\n        @param rEnv another environment\n    *\/\n    inline Environment( const Environment & rEnv ) SAL_THROW( () );\n\n    \/** Destructor: releases a set environment.\n    *\/\n    inline ~Environment() SAL_THROW( () );\n\n    \/** Sets a given environment, i.e. acquires given one and releases a set one.\n\n        @param pEnv another environment\n        @return this environment\n    *\/\n    inline Environment & SAL_CALL operator = ( uno_Environment * pEnv ) SAL_THROW( () );\n    \/** Sets a given environment, i.e. acquires given one and releases a set one.\n\n        @param rEnv another environment\n        @return this environment\n    *\/\n    inline Environment & SAL_CALL operator = ( const Environment & rEnv ) SAL_THROW( () )\n        { return operator = ( rEnv._pEnv ); }\n\n    \/** Provides UNacquired pointer to the set C environment.\n\n        @return UNacquired pointer to the C environment struct\n    *\/\n    inline uno_Environment * SAL_CALL get() const SAL_THROW( () )\n        { return _pEnv; }\n\n    \/** Gets type name of set environment.\n\n        @return type name of set environment\n    *\/\n    inline ::rtl::OUString SAL_CALL getTypeName() const SAL_THROW( () )\n        { return _pEnv->pTypeName; }\n\n    \/** Gets free context pointer of set environment.\n\n        @return free context pointer of set environment\n    *\/\n    inline void * SAL_CALL getContext() const SAL_THROW( () )\n        { return _pEnv->pContext; }\n\n    \/** Tests if a environment is set.\n\n        @return true, if a environment is set, false otherwise\n    *\/\n    inline sal_Bool SAL_CALL is() const SAL_THROW( () )\n        { return (_pEnv != 0); }\n\n    \/** Releases a set environment.\n    *\/\n    inline void SAL_CALL clear() SAL_THROW( () );\n\n    \/** Invoke the passed function in this environment.\n\n        @param pCallee  the function to call\n        @param pParam   the parameter pointer to be passed to the function\n        @since UDK 3.2.7\n    *\/\n    inline void SAL_CALL invoke_v(uno_EnvCallee * pCallee, va_list * pParam) const SAL_THROW( () );\n\n    \/** Invoke the passed function in this environment.\n\n        @param pCallee  the function to call\n        @param ...      the parameters to be passed to the function\n        @since UDK 3.2.7\n    *\/\n    inline void SAL_CALL invoke(uno_EnvCallee * pCallee, ...) const SAL_THROW( () );\n\n    \/** Enter this environment explicitly.\n\n        @since UDK 3.2.7\n    *\/\n    inline void SAL_CALL enter() const SAL_THROW( () );\n\n    \/** Checks, if it is valid to currently call objects\n        belonging to this environment.\n\n        @since UDK 3.2.7\n    *\/\n    inline int  SAL_CALL isValid(rtl::OUString * pReason) const SAL_THROW( () );\n};\n\/\/__________________________________________________________________________________________________\ninline Environment::Environment( uno_Environment * pEnv ) SAL_THROW( () )\n    : _pEnv( pEnv )\n{\n    if (_pEnv)\n        (*_pEnv->acquire)( _pEnv );\n}\n\/\/__________________________________________________________________________________________________\ninline Environment::Environment( rtl::OUString const & rEnvDcp, void * pContext ) SAL_THROW( () )\n    : _pEnv(NULL)\n{\n    uno_getEnvironment(&_pEnv, rEnvDcp.pData, pContext);\n}\n\/\/__________________________________________________________________________________________________\ninline Environment::Environment( const Environment & rEnv ) SAL_THROW( () )\n    : _pEnv( rEnv._pEnv )\n{\n    if (_pEnv)\n        (*_pEnv->acquire)( _pEnv );\n}\n\/\/__________________________________________________________________________________________________\ninline Environment::~Environment() SAL_THROW( () )\n{\n    if (_pEnv)\n        (*_pEnv->release)( _pEnv );\n}\n\/\/__________________________________________________________________________________________________\ninline void Environment::clear() SAL_THROW( () )\n{\n    if (_pEnv)\n    {\n        (*_pEnv->release)( _pEnv );\n        _pEnv = 0;\n    }\n}\n\/\/__________________________________________________________________________________________________\ninline Environment & Environment::operator = ( uno_Environment * pEnv ) SAL_THROW( () )\n{\n    if (pEnv != _pEnv)\n    {\n        if (pEnv)\n            (*pEnv->acquire)( pEnv );\n        if (_pEnv)\n            (*_pEnv->release)( _pEnv );\n        _pEnv = pEnv;\n    }\n    return *this;\n}\n\/\/__________________________________________________________________________________________________\ninline void SAL_CALL Environment::invoke_v(uno_EnvCallee * pCallee, va_list * pParam) const SAL_THROW( () )\n{\n    if (_pEnv)\n        uno_Environment_invoke_v(_pEnv, pCallee, pParam);\n}\n\/\/__________________________________________________________________________________________________\ninline void SAL_CALL Environment::invoke(uno_EnvCallee * pCallee, ...) const SAL_THROW( () )\n{\n    if (_pEnv)\n    {\n        va_list param;\n\n        va_start(param, pCallee);\n        uno_Environment_invoke_v(_pEnv, pCallee, &param);\n        va_end(param);\n    }\n\n}\n\/\/__________________________________________________________________________________________________\ninline void SAL_CALL Environment::enter() const SAL_THROW( () )\n{\n    uno_Environment_enter(_pEnv);\n}\n\/\/__________________________________________________________________________________________________\ninline int  SAL_CALL Environment::isValid(rtl::OUString * pReason) const SAL_THROW( () )\n{\n    return uno_Environment_isValid(_pEnv, (rtl_uString **)pReason);\n}\n\/\/__________________________________________________________________________________________________\ninline Environment Environment::getCurrent(rtl::OUString const & typeName) SAL_THROW( () )\n{\n    Environment environment;\n\n    uno_Environment * pEnv = NULL;\n    uno_getCurrentEnvironment(&pEnv, typeName.pData);\n    environment = pEnv;\n    if (pEnv)\n        pEnv->release(pEnv);\n\n    return environment;\n}\n\n}\n}\n}\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id$\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (C) 2002  MandrakeSoft S.A.\n\/\/\n\/\/    MandrakeSoft S.A.\n\/\/    43, rue d'Aboukir\n\/\/    75002 Paris - France\n\/\/    http:\/\/www.linux-mandrake.com\/\n\/\/    http:\/\/www.mandrakesoft.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 Software\n\/\/  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\n\n\/\/ Here are the virtual ports use to display messages from the bioses :\n\/\/\n\/\/  0x0400 : rombios Panic port with message\n\/\/  0x0401 : rombios Panic port with line number\n\/\/  0x0402 : rombios Info port with message\n\/\/  0xfff0 : rombios Info port with message (legacy port)\n\/\/  0x0403 : rombios Debug port with message\n\/\/\n\/\/  0x0500 : vgabios Info port with message\n\/\/  0x0501 : vgabios Panic port with message\n\/\/  0x0502 : vgabios Panic port with line number\n\/\/  0x0503 : vgabios Debug port with message\n\n\n\/\/ Define BX_PLUGGABLE in files that can be compiled into plugins.  For\n\/\/ platforms that require a special tag on exported symbols, BX_PLUGGABLE \n\/\/ is used to know when we are exporting symbols and when we are importing.\n#define BX_PLUGGABLE\n\n#include \"bochs.h\"\n\nbx_biosdev_c *theBiosDevice;\n\n  int\nlibbiosdev_LTX_plugin_init(plugin_t *plugin, plugintype_t type, int argc, char *argv[])\n{\n  theBiosDevice = new bx_biosdev_c ();\n  bx_devices.pluginBiosDevice = theBiosDevice;\n  BX_REGISTER_DEVICE_DEVMODEL(plugin, type, theBiosDevice, BX_PLUGIN_BIOSDEV);\n  return(0); \/\/ Success\n}\n\n  void\nlibbiosdev_LTX_plugin_fini(void)\n{\n}\n\nlogfunctions  *bioslog;\nlogfunctions  *vgabioslog;\n\nbx_biosdev_c::bx_biosdev_c(void)\n{\n  bioslog = new logfunctions();\n  bioslog->put(\"BIOS\");\n  bioslog->settype(BIOSLOG);\n  s.bios_message_i = 0;\n\n  vgabioslog = new logfunctions();\n  vgabioslog->put(\"VBIOS\");\n  vgabioslog->settype(BIOSLOG);\n  s.vgabios_message_i = 0;\n}\n\nbx_biosdev_c::~bx_biosdev_c(void)\n{\n    if ( bioslog != NULL )\n    {\n        delete bioslog;\n        bioslog = NULL;\n    }\n\n    if ( vgabioslog != NULL )\n    {\n        delete vgabioslog;\n        vgabioslog = NULL;\n    }\n}\n\n  void\nbx_biosdev_c::init(void)\n{\n  DEV_register_iowrite_handler(this, write_handler, 0x0400, \"Bios Panic Port 1\", 3);\n  DEV_register_iowrite_handler(this, write_handler, 0x0401, \"Bios Panic Port 2\", 3);\n  DEV_register_iowrite_handler(this, write_handler, 0x0403, \"Bios Debug Port\", 1);\n  DEV_register_iowrite_handler(this, write_handler, 0x0402, \"Bios Info Port\", 1);\n  DEV_register_iowrite_handler(this, write_handler, 0xfff0, \"Bios Info Port (legacy)\", 1);\n\n  DEV_register_iowrite_handler(this, write_handler, 0x0501, \"VGABios Panic Port 1\", 3);\n  DEV_register_iowrite_handler(this, write_handler, 0x0502, \"VGABios Panic Port 2\", 3);\n  DEV_register_iowrite_handler(this, write_handler, 0x0503, \"VGABios Debug Port\", 1);\n  DEV_register_iowrite_handler(this, write_handler, 0x0500, \"VGABios Info Port\", 1);\n}\n\n  void\nbx_biosdev_c::reset(unsigned type)\n{\n}\n\n  \/\/ static IO port write callback handler\n  \/\/ redirects to non-static class handler to avoid virtual functions\n\n  void\nbx_biosdev_c::write_handler(void *this_ptr, Bit32u address, Bit32u value, unsigned io_len)\n{\n#if !BX_USE_BIOS_SMF\n  bx_biosdev_c *class_ptr = (bx_biosdev_c *) this_ptr;\n\n  class_ptr->write(address, value, io_len);\n}\n\n  void\nbx_biosdev_c::write(Bit32u address, Bit32u value, unsigned io_len)\n{\n#else\n  UNUSED(this_ptr);\n#endif  \/\/ !BX_USE_BIOS_SMF\n  UNUSED(io_len);\n\n\n  switch (address) {\n    \/\/ 0x400-0x401 are used as panic ports for the rombios\n    case 0x0401:\n      if (BX_BIOS_THIS s.bios_message_i > 0) {\n\t\/\/ if there are bits of message in the buffer, print them as the\n\t\/\/ panic message.  Otherwise fall into the next case.\n\tif (BX_BIOS_THIS s.bios_message_i >= BX_BIOS_MESSAGE_SIZE)\n\t  BX_BIOS_THIS s.bios_message_i = BX_BIOS_MESSAGE_SIZE-1;\n        BX_BIOS_THIS s.bios_message[ BX_BIOS_THIS s.bios_message_i] = 0;\n\tBX_BIOS_THIS s.bios_message_i = 0;\n        bioslog->panic(\"%s\", BX_BIOS_THIS s.bios_message);\n\tbreak;\n      }\n    case 0x0400:\n      bioslog->panic(\"BIOS panic at rombios.c, line %d\", value);\n      break;\n\n    \/\/ 0xfff0 is used as the info port for the rombios\n    \/\/ 0x0402 is used as the info port for the rombios\n    \/\/ 0x0403 is used as the debug port for the rombios\n    case 0xfff0:\n    case 0x0402:\n    case 0x0403:\n      BX_BIOS_THIS s.bios_message[BX_BIOS_THIS s.bios_message_i] =\n        (Bit8u) value;\n      BX_BIOS_THIS s.bios_message_i ++;\n      if ( BX_BIOS_THIS s.bios_message_i >= BX_BIOS_MESSAGE_SIZE ) {\n        BX_BIOS_THIS s.bios_message[ BX_BIOS_MESSAGE_SIZE - 1] = 0;\n        BX_BIOS_THIS s.bios_message_i = 0;\n\tif (address==0x403) bioslog->ldebug(\"%s\", BX_BIOS_THIS s.bios_message);\n\telse bioslog->info(\"%s\", BX_BIOS_THIS s.bios_message);\n\t}\n      else if ((value & 0xff) == '\\n') {\n        BX_BIOS_THIS s.bios_message[ BX_BIOS_THIS s.bios_message_i - 1 ] = 0;\n        BX_BIOS_THIS s.bios_message_i = 0;\n\tif (address==0x403) bioslog->ldebug(\"%s\", BX_BIOS_THIS s.bios_message);\n\telse bioslog->info(\"%s\", BX_BIOS_THIS s.bios_message);\n        }\n      break;\n\n    \/\/ 0x501-0x502 are used as panic ports for the vgabios\n    case 0x0502:\n      if (BX_BIOS_THIS s.vgabios_message_i > 0) {\n\t\/\/ if there are bits of message in the buffer, print them as the\n\t\/\/ panic message.  Otherwise fall into the next case.\n\tif (BX_BIOS_THIS s.vgabios_message_i >= BX_BIOS_MESSAGE_SIZE)\n\t  BX_BIOS_THIS s.vgabios_message_i = BX_BIOS_MESSAGE_SIZE-1;\n        BX_BIOS_THIS s.vgabios_message[ BX_BIOS_THIS s.vgabios_message_i] = 0;\n\tBX_BIOS_THIS s.vgabios_message_i = 0;\n        vgabioslog->panic(\"%s\", BX_BIOS_THIS s.vgabios_message);\n\tbreak;\n      }\n    case 0x0501:\n      vgabioslog->panic(\"BIOS panic at rombios.c, line %d\", value);\n      break;\n\n    \/\/ 0x0500 is used as the message port for the vgabios\n    case 0x0500:\n    case 0x0503:\n      BX_BIOS_THIS s.vgabios_message[BX_BIOS_THIS s.vgabios_message_i] =\n        (Bit8u) value;\n      BX_BIOS_THIS s.vgabios_message_i ++;\n      if ( BX_BIOS_THIS s.vgabios_message_i >= BX_BIOS_MESSAGE_SIZE ) {\n        BX_BIOS_THIS s.vgabios_message[ BX_BIOS_MESSAGE_SIZE - 1] = 0;\n        BX_BIOS_THIS s.vgabios_message_i = 0;\n        if (address==0x503) vgabioslog->ldebug(\"%s\", BX_BIOS_THIS s.vgabios_message);\n        else vgabioslog->info(\"%s\", BX_BIOS_THIS s.vgabios_message);\n        }\n      else if ((value & 0xff) == '\\n') {\n        BX_BIOS_THIS s.vgabios_message[ BX_BIOS_THIS s.vgabios_message_i - 1 ] = 0;\n        BX_BIOS_THIS s.vgabios_message_i = 0;\n        if (address==0x503) vgabioslog->ldebug(\"%s\", BX_BIOS_THIS s.vgabios_message);\n        else vgabioslog->info(\"%s\", BX_BIOS_THIS s.vgabios_message);\n        }\n      break;\n\n    default:\n\t    break;\n    }\n}\n<commit_msg>Applied patch to remove 0xfff0 legacy port.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ $Id$\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (C) 2002  MandrakeSoft S.A.\n\/\/\n\/\/    MandrakeSoft S.A.\n\/\/    43, rue d'Aboukir\n\/\/    75002 Paris - France\n\/\/    http:\/\/www.linux-mandrake.com\/\n\/\/    http:\/\/www.mandrakesoft.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 Software\n\/\/  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\n\n\/\/ Here are the virtual ports use to display messages from the bioses :\n\/\/\n\/\/  0x0400 : rombios Panic port with message\n\/\/  0x0401 : rombios Panic port with line number\n\/\/  0x0402 : rombios Info port with message\n\/\/  0x0403 : rombios Debug port with message\n\/\/\n\/\/  0x0500 : vgabios Info port with message\n\/\/  0x0501 : vgabios Panic port with message\n\/\/  0x0502 : vgabios Panic port with line number\n\/\/  0x0503 : vgabios Debug port with message\n\n\n\/\/ Define BX_PLUGGABLE in files that can be compiled into plugins.  For\n\/\/ platforms that require a special tag on exported symbols, BX_PLUGGABLE \n\/\/ is used to know when we are exporting symbols and when we are importing.\n#define BX_PLUGGABLE\n\n#include \"bochs.h\"\n\nbx_biosdev_c *theBiosDevice;\n\n  int\nlibbiosdev_LTX_plugin_init(plugin_t *plugin, plugintype_t type, int argc, char *argv[])\n{\n  theBiosDevice = new bx_biosdev_c ();\n  bx_devices.pluginBiosDevice = theBiosDevice;\n  BX_REGISTER_DEVICE_DEVMODEL(plugin, type, theBiosDevice, BX_PLUGIN_BIOSDEV);\n  return(0); \/\/ Success\n}\n\n  void\nlibbiosdev_LTX_plugin_fini(void)\n{\n}\n\nlogfunctions  *bioslog;\nlogfunctions  *vgabioslog;\n\nbx_biosdev_c::bx_biosdev_c(void)\n{\n  bioslog = new logfunctions();\n  bioslog->put(\"BIOS\");\n  bioslog->settype(BIOSLOG);\n  s.bios_message_i = 0;\n\n  vgabioslog = new logfunctions();\n  vgabioslog->put(\"VBIOS\");\n  vgabioslog->settype(BIOSLOG);\n  s.vgabios_message_i = 0;\n}\n\nbx_biosdev_c::~bx_biosdev_c(void)\n{\n    if ( bioslog != NULL )\n    {\n        delete bioslog;\n        bioslog = NULL;\n    }\n\n    if ( vgabioslog != NULL )\n    {\n        delete vgabioslog;\n        vgabioslog = NULL;\n    }\n}\n\n  void\nbx_biosdev_c::init(void)\n{\n  DEV_register_iowrite_handler(this, write_handler, 0x0400, \"Bios Panic Port 1\", 3);\n  DEV_register_iowrite_handler(this, write_handler, 0x0401, \"Bios Panic Port 2\", 3);\n  DEV_register_iowrite_handler(this, write_handler, 0x0403, \"Bios Debug Port\", 1);\n  DEV_register_iowrite_handler(this, write_handler, 0x0402, \"Bios Info Port\", 1);\n\n  DEV_register_iowrite_handler(this, write_handler, 0x0501, \"VGABios Panic Port 1\", 3);\n  DEV_register_iowrite_handler(this, write_handler, 0x0502, \"VGABios Panic Port 2\", 3);\n  DEV_register_iowrite_handler(this, write_handler, 0x0503, \"VGABios Debug Port\", 1);\n  DEV_register_iowrite_handler(this, write_handler, 0x0500, \"VGABios Info Port\", 1);\n}\n\n  void\nbx_biosdev_c::reset(unsigned type)\n{\n}\n\n  \/\/ static IO port write callback handler\n  \/\/ redirects to non-static class handler to avoid virtual functions\n\n  void\nbx_biosdev_c::write_handler(void *this_ptr, Bit32u address, Bit32u value, unsigned io_len)\n{\n#if !BX_USE_BIOS_SMF\n  bx_biosdev_c *class_ptr = (bx_biosdev_c *) this_ptr;\n\n  class_ptr->write(address, value, io_len);\n}\n\n  void\nbx_biosdev_c::write(Bit32u address, Bit32u value, unsigned io_len)\n{\n#else\n  UNUSED(this_ptr);\n#endif  \/\/ !BX_USE_BIOS_SMF\n  UNUSED(io_len);\n\n\n  switch (address) {\n    \/\/ 0x400-0x401 are used as panic ports for the rombios\n    case 0x0401:\n      if (BX_BIOS_THIS s.bios_message_i > 0) {\n\t\/\/ if there are bits of message in the buffer, print them as the\n\t\/\/ panic message.  Otherwise fall into the next case.\n\tif (BX_BIOS_THIS s.bios_message_i >= BX_BIOS_MESSAGE_SIZE)\n\t  BX_BIOS_THIS s.bios_message_i = BX_BIOS_MESSAGE_SIZE-1;\n        BX_BIOS_THIS s.bios_message[ BX_BIOS_THIS s.bios_message_i] = 0;\n\tBX_BIOS_THIS s.bios_message_i = 0;\n        bioslog->panic(\"%s\", BX_BIOS_THIS s.bios_message);\n\tbreak;\n      }\n    case 0x0400:\n      bioslog->panic(\"BIOS panic at rombios.c, line %d\", value);\n      break;\n\n    \/\/ 0x0402 is used as the info port for the rombios\n    \/\/ 0x0403 is used as the debug port for the rombios\n    case 0x0402:\n    case 0x0403:\n      BX_BIOS_THIS s.bios_message[BX_BIOS_THIS s.bios_message_i] =\n        (Bit8u) value;\n      BX_BIOS_THIS s.bios_message_i ++;\n      if ( BX_BIOS_THIS s.bios_message_i >= BX_BIOS_MESSAGE_SIZE ) {\n        BX_BIOS_THIS s.bios_message[ BX_BIOS_MESSAGE_SIZE - 1] = 0;\n        BX_BIOS_THIS s.bios_message_i = 0;\n\tif (address==0x403) bioslog->ldebug(\"%s\", BX_BIOS_THIS s.bios_message);\n\telse bioslog->info(\"%s\", BX_BIOS_THIS s.bios_message);\n\t}\n      else if ((value & 0xff) == '\\n') {\n        BX_BIOS_THIS s.bios_message[ BX_BIOS_THIS s.bios_message_i - 1 ] = 0;\n        BX_BIOS_THIS s.bios_message_i = 0;\n\tif (address==0x403) bioslog->ldebug(\"%s\", BX_BIOS_THIS s.bios_message);\n\telse bioslog->info(\"%s\", BX_BIOS_THIS s.bios_message);\n        }\n      break;\n\n    \/\/ 0x501-0x502 are used as panic ports for the vgabios\n    case 0x0502:\n      if (BX_BIOS_THIS s.vgabios_message_i > 0) {\n\t\/\/ if there are bits of message in the buffer, print them as the\n\t\/\/ panic message.  Otherwise fall into the next case.\n\tif (BX_BIOS_THIS s.vgabios_message_i >= BX_BIOS_MESSAGE_SIZE)\n\t  BX_BIOS_THIS s.vgabios_message_i = BX_BIOS_MESSAGE_SIZE-1;\n        BX_BIOS_THIS s.vgabios_message[ BX_BIOS_THIS s.vgabios_message_i] = 0;\n\tBX_BIOS_THIS s.vgabios_message_i = 0;\n        vgabioslog->panic(\"%s\", BX_BIOS_THIS s.vgabios_message);\n\tbreak;\n      }\n    case 0x0501:\n      vgabioslog->panic(\"BIOS panic at rombios.c, line %d\", value);\n      break;\n\n    \/\/ 0x0500 is used as the message port for the vgabios\n    case 0x0500:\n    case 0x0503:\n      BX_BIOS_THIS s.vgabios_message[BX_BIOS_THIS s.vgabios_message_i] =\n        (Bit8u) value;\n      BX_BIOS_THIS s.vgabios_message_i ++;\n      if ( BX_BIOS_THIS s.vgabios_message_i >= BX_BIOS_MESSAGE_SIZE ) {\n        BX_BIOS_THIS s.vgabios_message[ BX_BIOS_MESSAGE_SIZE - 1] = 0;\n        BX_BIOS_THIS s.vgabios_message_i = 0;\n        if (address==0x503) vgabioslog->ldebug(\"%s\", BX_BIOS_THIS s.vgabios_message);\n        else vgabioslog->info(\"%s\", BX_BIOS_THIS s.vgabios_message);\n        }\n      else if ((value & 0xff) == '\\n') {\n        BX_BIOS_THIS s.vgabios_message[ BX_BIOS_THIS s.vgabios_message_i - 1 ] = 0;\n        BX_BIOS_THIS s.vgabios_message_i = 0;\n        if (address==0x503) vgabioslog->ldebug(\"%s\", BX_BIOS_THIS s.vgabios_message);\n        else vgabioslog->info(\"%s\", BX_BIOS_THIS s.vgabios_message);\n        }\n      break;\n\n    default:\n\t    break;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"file\/fd_util.h\"\n\n#include <errno.h>\n#include <math.h>\n#include <stdio.h>\n#ifndef _WIN32\n#include <unistd.h>\n#else\n#include <io.h>\n#include <winsock2.h>\n#endif\n#include <fcntl.h>\n\n#include \"base\/logging.h\"\n\nnamespace fd_util {\n\n\/\/ Slow as hell and should only be used for prototyping.\n\/\/ Reads from a socket, up to an '\\n'. This means that if the line ends\n\/\/ with '\\r', the '\\r' will be returned.\nssize_t ReadLine(int fd, char *vptr, size_t buf_size) {\n  char *buffer = vptr;\n  size_t n;\n  for (n = 1; n < buf_size; n++) {\n    char c;\n    ssize_t rc;\n    if ((rc = read(fd, &c, 1)) == 1) {\n      *buffer++ = c;\n      if (c == '\\n')\n        break;\n    }\n    else if (rc == 0) {\n      if (n == 1)\n        return 0;\n      else\n        break;\n    }\n    else {\n      if (errno == EINTR)\n        continue;\n      FLOG(\"Error in Readline()\");\n    }\n  }\n\n  *buffer = 0;\n  return n;\n}\n\n\/\/ Misnamed, it just writes raw data in a retry loop.\nssize_t WriteLine(int fd, const char *vptr, size_t n) {\n  const char *buffer = vptr;\n  size_t nleft = n;\n\n  while (nleft > 0) {\n    ssize_t nwritten;\n    if ((nwritten = write(fd, buffer, nleft)) <= 0) {\n      if (errno == EINTR)\n        nwritten = 0;\n      else\n        FLOG(\"Error in Writeline()\");\n    }\n    nleft  -= nwritten;\n    buffer += nwritten;\n  }\n\n  return n;\n}\n\nssize_t WriteLine(int fd, const char *buffer) {\n  return WriteLine(fd, buffer, strlen(buffer));\n}\n\nssize_t Write(int fd, const std::string &str) {\n  return WriteLine(fd, str.c_str(), str.size());\n}\n\nbool WaitUntilReady(int fd, double timeout) {\n  struct timeval tv;\n  tv.tv_sec = floor(timeout);\n  tv.tv_usec = (timeout - floor(timeout)) * 1000000.0;\n\n  fd_set fds;\n  FD_ZERO(&fds);\n  FD_SET(fd, &fds);\n  \/\/ First argument to select is the highest socket in the set + 1.\n  int rval = select(fd + 1, &fds, NULL, NULL, &tv);\n  if (rval < 0) {\n    \/\/ Error calling select.\n    return false;\n  } else if (rval == 0) {\n    \/\/ Timeout.\n    return false;\n  } else {\n    \/\/ Socket is ready.\n    return true;\n  }\n}\n\nvoid SetNonBlocking(int sock, bool non_blocking) {\n#ifndef _WIN32\n\tint opts = fcntl(sock, F_GETFL);\n  if (opts < 0) {\n\t\tperror(\"fcntl(F_GETFL)\");\n\t\texit(EXIT_FAILURE);\n\t}\n\tif (non_blocking) {\n    opts = (opts | O_NONBLOCK);\n  } else {\n    opts = (opts & ~O_NONBLOCK);\n  }\n\n\tif (fcntl(sock, F_SETFL, opts) < 0) {\n\t\tperror(\"fcntl(F_SETFL)\");\n\t\texit(EXIT_FAILURE);\n\t}\n#else\n  WLOG(\"NonBlocking mode not supported on Win32\");\n#endif\n}\n\n}  \/\/ fd_util\n<commit_msg>Add missing sys\/time.h include to fd_util.cpp<commit_after>#include \"file\/fd_util.h\"\n\n#include <errno.h>\n#include <math.h>\n#include <stdio.h>\n#ifndef _WIN32\n#include <unistd.h>\n#include <sys\/time.h>\n#else\n#include <io.h>\n#include <winsock2.h>\n#endif\n#include <fcntl.h>\n\n#include \"base\/logging.h\"\n\nnamespace fd_util {\n\n\/\/ Slow as hell and should only be used for prototyping.\n\/\/ Reads from a socket, up to an '\\n'. This means that if the line ends\n\/\/ with '\\r', the '\\r' will be returned.\nssize_t ReadLine(int fd, char *vptr, size_t buf_size) {\n  char *buffer = vptr;\n  size_t n;\n  for (n = 1; n < buf_size; n++) {\n    char c;\n    ssize_t rc;\n    if ((rc = read(fd, &c, 1)) == 1) {\n      *buffer++ = c;\n      if (c == '\\n')\n        break;\n    }\n    else if (rc == 0) {\n      if (n == 1)\n        return 0;\n      else\n        break;\n    }\n    else {\n      if (errno == EINTR)\n        continue;\n      FLOG(\"Error in Readline()\");\n    }\n  }\n\n  *buffer = 0;\n  return n;\n}\n\n\/\/ Misnamed, it just writes raw data in a retry loop.\nssize_t WriteLine(int fd, const char *vptr, size_t n) {\n  const char *buffer = vptr;\n  size_t nleft = n;\n\n  while (nleft > 0) {\n    ssize_t nwritten;\n    if ((nwritten = write(fd, buffer, nleft)) <= 0) {\n      if (errno == EINTR)\n        nwritten = 0;\n      else\n        FLOG(\"Error in Writeline()\");\n    }\n    nleft  -= nwritten;\n    buffer += nwritten;\n  }\n\n  return n;\n}\n\nssize_t WriteLine(int fd, const char *buffer) {\n  return WriteLine(fd, buffer, strlen(buffer));\n}\n\nssize_t Write(int fd, const std::string &str) {\n  return WriteLine(fd, str.c_str(), str.size());\n}\n\nbool WaitUntilReady(int fd, double timeout) {\n  struct timeval tv;\n  tv.tv_sec = floor(timeout);\n  tv.tv_usec = (timeout - floor(timeout)) * 1000000.0;\n\n  fd_set fds;\n  FD_ZERO(&fds);\n  FD_SET(fd, &fds);\n  \/\/ First argument to select is the highest socket in the set + 1.\n  int rval = select(fd + 1, &fds, NULL, NULL, &tv);\n  if (rval < 0) {\n    \/\/ Error calling select.\n    return false;\n  } else if (rval == 0) {\n    \/\/ Timeout.\n    return false;\n  } else {\n    \/\/ Socket is ready.\n    return true;\n  }\n}\n\nvoid SetNonBlocking(int sock, bool non_blocking) {\n#ifndef _WIN32\n\tint opts = fcntl(sock, F_GETFL);\n  if (opts < 0) {\n\t\tperror(\"fcntl(F_GETFL)\");\n\t\texit(EXIT_FAILURE);\n\t}\n\tif (non_blocking) {\n    opts = (opts | O_NONBLOCK);\n  } else {\n    opts = (opts & ~O_NONBLOCK);\n  }\n\n\tif (fcntl(sock, F_SETFL, opts) < 0) {\n\t\tperror(\"fcntl(F_SETFL)\");\n\t\texit(EXIT_FAILURE);\n\t}\n#else\n  WLOG(\"NonBlocking mode not supported on Win32\");\n#endif\n}\n\n}  \/\/ fd_util\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ \\file smallk.hpp\n\/\/\/\n\/\/\/ \\brief The smallk API header file.\n\/\/\/\n\/\/\/ Copyright 2014 Georgia Institute of Technology\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <string>\n#include <vector>\n\n#define SMALLK_MAJOR_VERSION 1\n#define SMALLK_MINOR_VERSION 6\n#define SMALLK_PATCH_LEVEL   0\n\nnamespace smallk\n{\n    \/\/\/\n    \/\/\/ The NMF algorithms supported by this API.\n    \/\/\/\n    enum Algorithm\n    {\n        MU,      \/\/\/< Multiplicative Updating, Lee & Seung\n        BPP,     \/\/\/< Block Principal Pivoting, Kim and Park\n        HALS,    \/\/\/< Hierarchical Alternating Least Squares, Cichocki & Pan\n        RANK2    \/\/\/< Rank2, Kuang and Park\n    };\n\n    \/\/\/\n    \/\/\/ The output file formats supported by the clustering code.\n    \/\/\/\n    enum OutputFormat\n    {\n        XML,  \/\/\/< Extensible Markup Language\n        JSON  \/\/\/< JavaScript Object Notation\n    };\n\n    \/\/\/ \\name Initialization and Cleanup\n    \/\/@{\n    \/\/\/\n    \/\/\/ \\brief Perform initialization - call this function first.\n    \/\/\/ \n    \/\/\/ Simply pass \\c argc and \\c argv from \\c main to this function.\n    \/\/\/\n    \/\/\/ \\param[in] argc The number of command-line arguments.\n    \/\/\/ \\param[in] argv The array of command-line argument strings.\n    void Initialize(int& argc, char**& argv);\n\n    \/\/\/\n    \/\/\/ \\brief Determine whether the library has been initialized.\n    \/\/\/ \\return A boolean indicating the initialization status.\n    bool IsInitialized();\n\n    \/\/\/\n    \/\/\/ \\brief Perform cleanup - call this function last.\n    void Finalize();\n    \/\/@}\n\n    \/\/\/ \\name Versioning\n    \/\/@{\n    \/\/\/\n    \/\/\/ \\brief Returns the API major version.\n    \/\/\/ \\return The major version number as an \\c unsigned \\c int.\n    unsigned int GetMajorVersion();\n\n    \/\/\/ \\brief Returns the API minor version.\n    \/\/\/ \\return The minor version number as an \\c unsigned \\c int.\n    unsigned int GetMinorVersion();\n\n    \/\/\/ \\brief Returns the API patch level.\n    \/\/\/ \\return The patch level as an \\c unsigned \\c int.\n    unsigned int GetPatchLevel();\n\n    \/\/\/ \\brief Returns the API version string.\n    \/\/\/ \\return The version string formatted as \\c major_version.minor_version.patch_level.\n    std::string GetVersionString();\n    \/\/@}\n\n    \/\/\/ \\name Common Functions\n    \/\/@{\n    \/\/\/\n    \/\/\/ \\brief Returns the precision with which output files will be written.\n    \/\/\/ \\return The number of digits after the decimal point for elements of matrices \\c W and \\c H.\n    unsigned int GetOutputPrecision();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the precision with which output files will be written.\n    \/\/\/ \\param[in] num_digits The desired number of digits after the decimal point.\n    void SetOutputPrecision(const unsigned int num_digits = 6);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the tolerance value used to terminate iterative NMF algorithms.\n    \/\/\/ \\return The tolerance as a double-precision floating point number.\n    \/\/\/ \n    \/\/\/ The NMF algorithms used by smallk are iterative.  At each iteration, a metric\n    \/\/\/ is computed that estimates the progress made towards a solution.  The metrics\n    \/\/\/ are designed to decrease as the computation progresses.  The 'tolerance' parameter\n    \/\/\/ is the cutoff value for this metric, meaning that whenever the metric decreases \n    \/\/\/ to this value the iterations are terminated and the solution is said to have converged.\n    \/\/\/ There is a tradeoff between the maximum number of iterations and the tolerance.\n    \/\/\/ Smaller values of the tolerance generally require more iterations.\n    double GetNmfTolerance();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the cutoff tolerance for NMF iterations.\n    \/\/\/ \\param[in] tol The tolerance value.\n    void SetNmfTolerance(const double tol = 0.005);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the maximum number of iterations allowed for either NMF or clustering.\n    \/\/\/ \\return The iteration count as an unsigned integer.\n    unsigned int GetMaxIter();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the upper limit to the number of iterations for NMF and clustering.\n    \/\/\/ \\param[in] max_iterations The maximum number of iterations to perform.\n    void SetMaxIter(const unsigned int max_iterations = 5000);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the minimum number of iterations performed by either the NMF or clustering code.\n    \/\/\/ \\return The iteration count as an unsigned integer.\n    unsigned int GetMinIter();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the minimum number of iterations to be performed by either the NMF or clustering code.\n    \/\/\/ \\param[in] min_iterations The minimum number of iterations to perform.\n    void SetMinIter(const unsigned int min_iterations = 5);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the maximum number of threads used for either the NMF or clustering computations.\n    \/\/\/ \\return The thread count as an unsigned integer.\n    unsigned int GetMaxThreads();\n\n    \/\/\/\n    \/\/\/ \\brief Sets an upper limit to the number of threads used by either the NMF or clustering code.\n    \/\/\/ \\param[in] max_threads The maximum number of threads to use.\n    \/\/\/\n    \/\/\/ The smallk code is multithreaded for improved performance.  The default upper limit \n    \/\/\/ to the number of threads used by the code is determined by the hardware's capabilities.\n    \/\/\/ Use this function to override this limit and restrict the thread count to a smaller range.  \n    \/\/\/ Allowable values for max_threads are in the interval [1, hardware_max_threads].  \n    void SetMaxThreads(const unsigned int max_threads);\n\n    \/\/\/\n    \/\/\/ \\brief Sets all params to default values and clears any loaded matrices.\n    void Reset();\n\n    \/\/\/\n    \/\/\/ \\brief Seed the random number generator with the specified value.\n    \/\/\/ \\param[in] seed An integer seed value.\n    void SeedRNG(const int seed);\n\n    \/\/\/\n    \/\/\/ \\brief Load the matrix to be factored from a file.\n    \/\/\/ \\param[in] filepath The absolute or relative path to a matrix file.\n    \/\/\/\n    \/\/\/ The smallk code can read matrix files in either CSV (comma separated value) \n    \/\/\/ or MTX (MatrixMarket) format.  CSV files are assumed to contain dense\n    \/\/\/ matrices, i.e. the CSV files must contain an entry for each matrix element.\n    \/\/\/ MTX files are assumed to contain sparse matrices only.\n    void LoadMatrix(const std::string& filepath);\n\n    \/\/\/\n    \/\/\/ \\brief Load the dense matrix to be factored from a buffer.\n    \/\/\/ \\param[in] buffer A pointer to the buffer containing the input matrix.\n    \/\/\/ \\param[in] ldim The leading dimension of the input matrix buffer.\n    \/\/\/ \\param[in] height The height of the input matrix.\n    \/\/\/ \\param[in] width The width of the input matrixe.\n    \/\/\/\n    \/\/\/ The smallk code can read dense matrix files from a pointer to a buffer.\n    \/\/\/ This can be used for passing in a matrix generated in python.\n    void LoadMatrix(const double *buffer, \n                    const unsigned int ldim,\n                    const unsigned int height, \n                    const unsigned int width);\n    \/\/\/\n    \/\/\/ \\brief Load the sparse matrix to be factored from a buffer.\n    \/\/\/ \\param[in] height The height of the input matrix.\n    \/\/\/ \\param[in] width The width of the input matrixe.\n    \/\/\/ \\param[in] nz The number of non-zero entries in the matrix.\n    \/\/\/ \\param[in] data A reference to the vector containing the non-zero input data.\n    \/\/\/ \\param[in] row_indices A reference to the row_indicies vector.\n    \/\/\/ \\param[in] col_offsets A reference to the col_offsets vector.\n    \/\/\/\n    \/\/\/ The smallk code can read dense matrix files from a pointer to a buffer.\n    \/\/\/ This can be used for passing in a matrix generated in python.\n    void LoadMatrix(const unsigned int height, \n                    const unsigned int width,\n                    const unsigned int nz, \n                    const std::vector<double>& data,\n                    const std::vector<unsigned int>& row_indices,\n                    const std::vector<unsigned int>& col_offsets);\n\n    \/\/\/\n    \/\/\/ \\brief Returns whether a CSV or MTX file has been successfully loaded.\n    \/\/\/ \\return A boolean indicating the presence or absence of a loaded matrix.\n    bool IsMatrixLoaded();\n\n    \/\/\/\n    \/\/\/ \\brief Returns the output directory where result files will be written.\n    \/\/\/ \\return A string representing the output directory.\n    std::string GetOutputDir();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the directory into which result files will be written.\n    \/\/\/ \\param[in] outdir The absolute or relative path to an output directory.\n    \/\/\/\n    \/\/\/ The otuput directory must exist - the smallk code will not create it.\n    void SetOutputDir(const std::string& outdir);\n\n    \/\/@}\n\n\n    \/\/\/ \\name NMF\n    \/\/@{\n    \/\/\/\n    \/\/\/ \\brief Runs the selected NMF algorithm on the loaded matrix.\n    \/\/\/ \\param[in] k The width of matrix W or the height of matrix H.\n    \/\/\/ \\param[in] algorithm The desired NMF algorithm.\n    \/\/\/ \\param[in] initfile_w A CSV file containing initial values for \\c m x \\c k matrix W.\n    \/\/\/ \\param[in] initfile_h A CSV file containing initial values for \\c k x \\c n matrix H.\n    \/\/\/ This function performs the factorization \\c A \\c ~ \\c W \\c H, where\n    \/\/\/ matrix A is \\c m x \\c n, matrix W is \\c m x \\c k, and matrix H is\n    \/\/\/ \\c k x \\c n.  Matrix A must have already been loaded by a prior \n    \/\/\/ call to \\c LoadMatrix.\n    void Nmf(const unsigned int k, \n             const Algorithm algorithm = BPP,\n             const std::string& initfile_w = std::string(\"\"),\n             const std::string& initfile_h = std::string(\"\"));\n\n    \/\/\/\n    \/\/\/ \\brief Returns a pointer to the buffer containing the NMF result matrix W.\n    \/\/\/ \\param[out] ldim The leading dimension of the W-buffer.\n    \/\/\/ \\param[out] height The height of the W matrix.\n    \/\/\/ \\param[out] width The width of the W matrix.\n    const double* LockedBufferW(unsigned int& ldim, \n                                unsigned int& height,\n                                unsigned int& width);\n\n    \/\/\/\n    \/\/\/ \\brief Returns a pointer to the buffer containing the NMF result matrix H.\n    \/\/\/ \\param[out] ldim The leading dimension of the H-buffer.\n    \/\/\/ \\param[out] height The height of the H matrix.\n    \/\/\/ \\param[out] width The width of the H matrix.\n    const double* LockedBufferH(unsigned int& ldim,\n                                unsigned int& height,\n                                unsigned int& width);\n\n    \/\/@}\n\n    \/\/\/ \\name Clustering\n    \/\/{@\n    \/\/\/\n    \/\/\/ \\brief Load the file containing the dictionary strings.\n    \/\/\/ \\param[in] filepath The absolute or relative path to the dictionary file.\n    \/\/\/ Each row of the term-frequency matrix represents a 'term' in the dictionary.\n    \/\/\/ The dictionary file is the collection of all such terms, one per line.\n    \/\/\/ A 'term' can consist of multiple words.  The smallk code considers each individual\n    \/\/\/ line in the file a separate term.\n    \/\/\/\n    void LoadDictionary(const std::string& filepath);\n\n    \/\/\/\n    \/\/\/ \\brief Load the file containing the dictionary strings.\n    \/\/\/ \\param[in] terms The vector containing the dictionary terms.\n    \/\/\/\n    void LoadDictionary(const std::vector<std::string>& terms);\n\n    \/\/\/\n    \/\/\/ \\brief Reuturns the maximum number of terms computed per node during clustering.\n    \/\/\/ \\return The term count as an unsigned int.\n    unsigned int GetMaxTerms();\n\n    \/\/\/ \n    \/\/\/ \\brief Set the maximum number of terms to compute per node during clustering.\n    \/\/\/ \\param[in] max_terms The term count.\n    void SetMaxTerms(const unsigned int max_terms = 5);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the format used for writing clustering results.\n    \/\/\/ \\returns \\c OutputFormat::XML for XML format, or \\c OutputFormat::JSON for JSON format.\n    OutputFormat GetOutputFormat();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the file format for clustering results.\n    \/\/\/ \\param[in] format Either \\c OutputFormat::XML for XML format, or \n    \/\/\/ \\c OutputFormat::JSON for JSON format.\n    void SetOutputFormat(const OutputFormat format = JSON);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the tolerance for the NMF subproblems solved by HierNMF2.\n    \/\/\/ \\return The tolerance as a double-precision value.\n    double GetHierNmf2Tolerance();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the tolerance for the NMF subproblems solved by HierNMF2.\n    \/\/\/ \\param[in] tol The tolerance value, a double precision value on (0.0, 1.0).\n    void SetHierNmf2Tolerance(const double tol = 0.0001);\n\n    \/\/\/\n    \/\/\/ \\brief Performs hierarchical clustering for the loaded matrix.\n    \/\/\/ \\param[in] num_clusters The number of clusters (leaf nodes) to generate.\n    \/\/\/ \n    \/\/\/ This function runs the HierNMF2 algorithm on the loaded matrix.  Two result files\n    \/\/\/ are written to the output directory, one containing the cluster labels for each\n    \/\/\/ document.  A value of -1 in this file represents an outlier, which is a document\n    \/\/\/ that was not assigned to a cluster.  The other output file contains information\n    \/\/\/ for each node in the factorization tree.\n    void HierNmf2(const unsigned int num_clusters);\n\n    \/\/\/\n    \/\/\/ \\brief Performs hierarchical and flat clustering for the loaded matrix.\n    \/\/\/ \\param[in] num_clusters The number of clusters to generate.\n    \/\/\/\n    \/\/\/ This function performs the same actions as HierNmf2, but it also generates a flat\n    \/\/\/ clustering result, in addition the the hierarchical clustering result.  Two additional\n    \/\/\/ result files are written to the output directory, one for the flat clustering assignments,\n    \/\/\/ and anther for the flat clustering nodes.\n    void HierNmf2WithFlat(const unsigned int num_clusters);\n\n    \/\/@}\n\n} \/\/ namespace smallk\n<commit_msg>updated version string<commit_after>\/\/\/\n\/\/\/ \\file smallk.hpp\n\/\/\/\n\/\/\/ \\brief The smallk API header file.\n\/\/\/\n\/\/\/ Copyright 2014 Georgia Institute of Technology\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <string>\n#include <vector>\n\n#define SMALLK_MAJOR_VERSION 1\n#define SMALLK_MINOR_VERSION 6\n#define SMALLK_PATCH_LEVEL   2\n\nnamespace smallk\n{\n    \/\/\/\n    \/\/\/ The NMF algorithms supported by this API.\n    \/\/\/\n    enum Algorithm\n    {\n        MU,      \/\/\/< Multiplicative Updating, Lee & Seung\n        BPP,     \/\/\/< Block Principal Pivoting, Kim and Park\n        HALS,    \/\/\/< Hierarchical Alternating Least Squares, Cichocki & Pan\n        RANK2    \/\/\/< Rank2, Kuang and Park\n    };\n\n    \/\/\/\n    \/\/\/ The output file formats supported by the clustering code.\n    \/\/\/\n    enum OutputFormat\n    {\n        XML,  \/\/\/< Extensible Markup Language\n        JSON  \/\/\/< JavaScript Object Notation\n    };\n\n    \/\/\/ \\name Initialization and Cleanup\n    \/\/@{\n    \/\/\/\n    \/\/\/ \\brief Perform initialization - call this function first.\n    \/\/\/ \n    \/\/\/ Simply pass \\c argc and \\c argv from \\c main to this function.\n    \/\/\/\n    \/\/\/ \\param[in] argc The number of command-line arguments.\n    \/\/\/ \\param[in] argv The array of command-line argument strings.\n    void Initialize(int& argc, char**& argv);\n\n    \/\/\/\n    \/\/\/ \\brief Determine whether the library has been initialized.\n    \/\/\/ \\return A boolean indicating the initialization status.\n    bool IsInitialized();\n\n    \/\/\/\n    \/\/\/ \\brief Perform cleanup - call this function last.\n    void Finalize();\n    \/\/@}\n\n    \/\/\/ \\name Versioning\n    \/\/@{\n    \/\/\/\n    \/\/\/ \\brief Returns the API major version.\n    \/\/\/ \\return The major version number as an \\c unsigned \\c int.\n    unsigned int GetMajorVersion();\n\n    \/\/\/ \\brief Returns the API minor version.\n    \/\/\/ \\return The minor version number as an \\c unsigned \\c int.\n    unsigned int GetMinorVersion();\n\n    \/\/\/ \\brief Returns the API patch level.\n    \/\/\/ \\return The patch level as an \\c unsigned \\c int.\n    unsigned int GetPatchLevel();\n\n    \/\/\/ \\brief Returns the API version string.\n    \/\/\/ \\return The version string formatted as \\c major_version.minor_version.patch_level.\n    std::string GetVersionString();\n    \/\/@}\n\n    \/\/\/ \\name Common Functions\n    \/\/@{\n    \/\/\/\n    \/\/\/ \\brief Returns the precision with which output files will be written.\n    \/\/\/ \\return The number of digits after the decimal point for elements of matrices \\c W and \\c H.\n    unsigned int GetOutputPrecision();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the precision with which output files will be written.\n    \/\/\/ \\param[in] num_digits The desired number of digits after the decimal point.\n    void SetOutputPrecision(const unsigned int num_digits = 6);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the tolerance value used to terminate iterative NMF algorithms.\n    \/\/\/ \\return The tolerance as a double-precision floating point number.\n    \/\/\/ \n    \/\/\/ The NMF algorithms used by smallk are iterative.  At each iteration, a metric\n    \/\/\/ is computed that estimates the progress made towards a solution.  The metrics\n    \/\/\/ are designed to decrease as the computation progresses.  The 'tolerance' parameter\n    \/\/\/ is the cutoff value for this metric, meaning that whenever the metric decreases \n    \/\/\/ to this value the iterations are terminated and the solution is said to have converged.\n    \/\/\/ There is a tradeoff between the maximum number of iterations and the tolerance.\n    \/\/\/ Smaller values of the tolerance generally require more iterations.\n    double GetNmfTolerance();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the cutoff tolerance for NMF iterations.\n    \/\/\/ \\param[in] tol The tolerance value.\n    void SetNmfTolerance(const double tol = 0.005);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the maximum number of iterations allowed for either NMF or clustering.\n    \/\/\/ \\return The iteration count as an unsigned integer.\n    unsigned int GetMaxIter();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the upper limit to the number of iterations for NMF and clustering.\n    \/\/\/ \\param[in] max_iterations The maximum number of iterations to perform.\n    void SetMaxIter(const unsigned int max_iterations = 5000);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the minimum number of iterations performed by either the NMF or clustering code.\n    \/\/\/ \\return The iteration count as an unsigned integer.\n    unsigned int GetMinIter();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the minimum number of iterations to be performed by either the NMF or clustering code.\n    \/\/\/ \\param[in] min_iterations The minimum number of iterations to perform.\n    void SetMinIter(const unsigned int min_iterations = 5);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the maximum number of threads used for either the NMF or clustering computations.\n    \/\/\/ \\return The thread count as an unsigned integer.\n    unsigned int GetMaxThreads();\n\n    \/\/\/\n    \/\/\/ \\brief Sets an upper limit to the number of threads used by either the NMF or clustering code.\n    \/\/\/ \\param[in] max_threads The maximum number of threads to use.\n    \/\/\/\n    \/\/\/ The smallk code is multithreaded for improved performance.  The default upper limit \n    \/\/\/ to the number of threads used by the code is determined by the hardware's capabilities.\n    \/\/\/ Use this function to override this limit and restrict the thread count to a smaller range.  \n    \/\/\/ Allowable values for max_threads are in the interval [1, hardware_max_threads].  \n    void SetMaxThreads(const unsigned int max_threads);\n\n    \/\/\/\n    \/\/\/ \\brief Sets all params to default values and clears any loaded matrices.\n    void Reset();\n\n    \/\/\/\n    \/\/\/ \\brief Seed the random number generator with the specified value.\n    \/\/\/ \\param[in] seed An integer seed value.\n    void SeedRNG(const int seed);\n\n    \/\/\/\n    \/\/\/ \\brief Load the matrix to be factored from a file.\n    \/\/\/ \\param[in] filepath The absolute or relative path to a matrix file.\n    \/\/\/\n    \/\/\/ The smallk code can read matrix files in either CSV (comma separated value) \n    \/\/\/ or MTX (MatrixMarket) format.  CSV files are assumed to contain dense\n    \/\/\/ matrices, i.e. the CSV files must contain an entry for each matrix element.\n    \/\/\/ MTX files are assumed to contain sparse matrices only.\n    void LoadMatrix(const std::string& filepath);\n\n    \/\/\/\n    \/\/\/ \\brief Load the dense matrix to be factored from a buffer.\n    \/\/\/ \\param[in] buffer A pointer to the buffer containing the input matrix.\n    \/\/\/ \\param[in] ldim The leading dimension of the input matrix buffer.\n    \/\/\/ \\param[in] height The height of the input matrix.\n    \/\/\/ \\param[in] width The width of the input matrixe.\n    \/\/\/\n    \/\/\/ The smallk code can read dense matrix files from a pointer to a buffer.\n    \/\/\/ This can be used for passing in a matrix generated in python.\n    void LoadMatrix(const double *buffer, \n                    const unsigned int ldim,\n                    const unsigned int height, \n                    const unsigned int width);\n    \/\/\/\n    \/\/\/ \\brief Load the sparse matrix to be factored from a buffer.\n    \/\/\/ \\param[in] height The height of the input matrix.\n    \/\/\/ \\param[in] width The width of the input matrixe.\n    \/\/\/ \\param[in] nz The number of non-zero entries in the matrix.\n    \/\/\/ \\param[in] data A reference to the vector containing the non-zero input data.\n    \/\/\/ \\param[in] row_indices A reference to the row_indicies vector.\n    \/\/\/ \\param[in] col_offsets A reference to the col_offsets vector.\n    \/\/\/\n    \/\/\/ The smallk code can read dense matrix files from a pointer to a buffer.\n    \/\/\/ This can be used for passing in a matrix generated in python.\n    void LoadMatrix(const unsigned int height, \n                    const unsigned int width,\n                    const unsigned int nz, \n                    const std::vector<double>& data,\n                    const std::vector<unsigned int>& row_indices,\n                    const std::vector<unsigned int>& col_offsets);\n\n    \/\/\/\n    \/\/\/ \\brief Returns whether a CSV or MTX file has been successfully loaded.\n    \/\/\/ \\return A boolean indicating the presence or absence of a loaded matrix.\n    bool IsMatrixLoaded();\n\n    \/\/\/\n    \/\/\/ \\brief Returns the output directory where result files will be written.\n    \/\/\/ \\return A string representing the output directory.\n    std::string GetOutputDir();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the directory into which result files will be written.\n    \/\/\/ \\param[in] outdir The absolute or relative path to an output directory.\n    \/\/\/\n    \/\/\/ The otuput directory must exist - the smallk code will not create it.\n    void SetOutputDir(const std::string& outdir);\n\n    \/\/@}\n\n\n    \/\/\/ \\name NMF\n    \/\/@{\n    \/\/\/\n    \/\/\/ \\brief Runs the selected NMF algorithm on the loaded matrix.\n    \/\/\/ \\param[in] k The width of matrix W or the height of matrix H.\n    \/\/\/ \\param[in] algorithm The desired NMF algorithm.\n    \/\/\/ \\param[in] initfile_w A CSV file containing initial values for \\c m x \\c k matrix W.\n    \/\/\/ \\param[in] initfile_h A CSV file containing initial values for \\c k x \\c n matrix H.\n    \/\/\/ This function performs the factorization \\c A \\c ~ \\c W \\c H, where\n    \/\/\/ matrix A is \\c m x \\c n, matrix W is \\c m x \\c k, and matrix H is\n    \/\/\/ \\c k x \\c n.  Matrix A must have already been loaded by a prior \n    \/\/\/ call to \\c LoadMatrix.\n    void Nmf(const unsigned int k, \n             const Algorithm algorithm = BPP,\n             const std::string& initfile_w = std::string(\"\"),\n             const std::string& initfile_h = std::string(\"\"));\n\n    \/\/\/\n    \/\/\/ \\brief Returns a pointer to the buffer containing the NMF result matrix W.\n    \/\/\/ \\param[out] ldim The leading dimension of the W-buffer.\n    \/\/\/ \\param[out] height The height of the W matrix.\n    \/\/\/ \\param[out] width The width of the W matrix.\n    const double* LockedBufferW(unsigned int& ldim, \n                                unsigned int& height,\n                                unsigned int& width);\n\n    \/\/\/\n    \/\/\/ \\brief Returns a pointer to the buffer containing the NMF result matrix H.\n    \/\/\/ \\param[out] ldim The leading dimension of the H-buffer.\n    \/\/\/ \\param[out] height The height of the H matrix.\n    \/\/\/ \\param[out] width The width of the H matrix.\n    const double* LockedBufferH(unsigned int& ldim,\n                                unsigned int& height,\n                                unsigned int& width);\n\n    \/\/@}\n\n    \/\/\/ \\name Clustering\n    \/\/{@\n    \/\/\/\n    \/\/\/ \\brief Load the file containing the dictionary strings.\n    \/\/\/ \\param[in] filepath The absolute or relative path to the dictionary file.\n    \/\/\/ Each row of the term-frequency matrix represents a 'term' in the dictionary.\n    \/\/\/ The dictionary file is the collection of all such terms, one per line.\n    \/\/\/ A 'term' can consist of multiple words.  The smallk code considers each individual\n    \/\/\/ line in the file a separate term.\n    \/\/\/\n    void LoadDictionary(const std::string& filepath);\n\n    \/\/\/\n    \/\/\/ \\brief Load the file containing the dictionary strings.\n    \/\/\/ \\param[in] terms The vector containing the dictionary terms.\n    \/\/\/\n    void LoadDictionary(const std::vector<std::string>& terms);\n\n    \/\/\/\n    \/\/\/ \\brief Reuturns the maximum number of terms computed per node during clustering.\n    \/\/\/ \\return The term count as an unsigned int.\n    unsigned int GetMaxTerms();\n\n    \/\/\/ \n    \/\/\/ \\brief Set the maximum number of terms to compute per node during clustering.\n    \/\/\/ \\param[in] max_terms The term count.\n    void SetMaxTerms(const unsigned int max_terms = 5);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the format used for writing clustering results.\n    \/\/\/ \\returns \\c OutputFormat::XML for XML format, or \\c OutputFormat::JSON for JSON format.\n    OutputFormat GetOutputFormat();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the file format for clustering results.\n    \/\/\/ \\param[in] format Either \\c OutputFormat::XML for XML format, or \n    \/\/\/ \\c OutputFormat::JSON for JSON format.\n    void SetOutputFormat(const OutputFormat format = JSON);\n\n    \/\/\/\n    \/\/\/ \\brief Returns the tolerance for the NMF subproblems solved by HierNMF2.\n    \/\/\/ \\return The tolerance as a double-precision value.\n    double GetHierNmf2Tolerance();\n\n    \/\/\/\n    \/\/\/ \\brief Sets the tolerance for the NMF subproblems solved by HierNMF2.\n    \/\/\/ \\param[in] tol The tolerance value, a double precision value on (0.0, 1.0).\n    void SetHierNmf2Tolerance(const double tol = 0.0001);\n\n    \/\/\/\n    \/\/\/ \\brief Performs hierarchical clustering for the loaded matrix.\n    \/\/\/ \\param[in] num_clusters The number of clusters (leaf nodes) to generate.\n    \/\/\/ \n    \/\/\/ This function runs the HierNMF2 algorithm on the loaded matrix.  Two result files\n    \/\/\/ are written to the output directory, one containing the cluster labels for each\n    \/\/\/ document.  A value of -1 in this file represents an outlier, which is a document\n    \/\/\/ that was not assigned to a cluster.  The other output file contains information\n    \/\/\/ for each node in the factorization tree.\n    void HierNmf2(const unsigned int num_clusters);\n\n    \/\/\/\n    \/\/\/ \\brief Performs hierarchical and flat clustering for the loaded matrix.\n    \/\/\/ \\param[in] num_clusters The number of clusters to generate.\n    \/\/\/\n    \/\/\/ This function performs the same actions as HierNmf2, but it also generates a flat\n    \/\/\/ clustering result, in addition the the hierarchical clustering result.  Two additional\n    \/\/\/ result files are written to the output directory, one for the flat clustering assignments,\n    \/\/\/ and anther for the flat clustering nodes.\n    void HierNmf2WithFlat(const unsigned int num_clusters);\n\n    \/\/@}\n\n} \/\/ namespace smallk\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Print correct bitness of required Render Doc DLL<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2015 - 2018 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#pragma once\n\ntypedef signed char        int8_t;\ntypedef unsigned char      uint8_t;\ntypedef short              int16_t;\ntypedef unsigned short     uint16_t;\ntypedef int                int32_t;\ntypedef unsigned int       uint32_t;\ntypedef unsigned           uint_t;\n#if defined(_WIN32) || defined(__APPLE__) || defined(__arm__) || defined(__ppc__)\ntypedef long long          int64_t;\ntypedef unsigned long long uint64_t;\ntypedef __INTMAX_TYPE__    intmax_t;\ntypedef __UINTMAX_TYPE__   uintmax_t;\n#else\ntypedef long               int64_t;\ntypedef unsigned long      uint64_t;\ntypedef int64_t            intmax_t;\ntypedef uint64_t           uintmax_t;\n#endif\n\n\nnamespace ox {\n\ntypedef uint32_t Error;\n\n}\n\n#if defined(_LP64) || defined(__ppc64__) || defined(__aarch64__)\ntypedef unsigned long size_t;\n#elif defined(_WIN64)\ntypedef uint64_t size_t;\n#elif defined(_LP32) || defined(__ppc__) || defined(_WIN32) || defined(__arm__)\ntypedef uint32_t size_t;\n#else\n#error size_t undefined\n#endif\n<commit_msg>Add static_assert size checks to types.hpp<commit_after>\/*\n * Copyright 2015 - 2018 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#pragma once\n\ntypedef signed char        int8_t;\ntypedef unsigned char      uint8_t;\ntypedef short              int16_t;\ntypedef unsigned short     uint16_t;\ntypedef int                int32_t;\ntypedef unsigned int       uint32_t;\ntypedef unsigned           uint_t;\n#if defined(_WIN32) || defined(__APPLE__) || defined(__arm__) || defined(__ppc__)\ntypedef long long          int64_t;\ntypedef unsigned long long uint64_t;\ntypedef __INTMAX_TYPE__    intmax_t;\ntypedef __UINTMAX_TYPE__   uintmax_t;\n#else\ntypedef long               int64_t;\ntypedef unsigned long      uint64_t;\ntypedef int64_t            intmax_t;\ntypedef uint64_t           uintmax_t;\n#endif\n\nstatic_assert(sizeof(int8_t)  == 1, \"int8_t is wrong size\");\nstatic_assert(sizeof(int16_t) == 2, \"int16_t is wrong size\");\nstatic_assert(sizeof(int32_t) == 4, \"int32_t is wrong size\");\nstatic_assert(sizeof(int64_t) == 8, \"int64_t is wrong size\");\n\nstatic_assert(sizeof(uint8_t)  == 1, \"uint8_t is wrong size\");\nstatic_assert(sizeof(uint16_t) == 2, \"uint16_t is wrong size\");\nstatic_assert(sizeof(uint32_t) == 4, \"uint32_t is wrong size\");\nstatic_assert(sizeof(uint64_t) == 8, \"uint64_t is wrong size\");\n\nnamespace ox {\n\ntypedef uint32_t Error;\n\n}\n\n#if defined(_LP64) || defined(__ppc64__) || defined(__aarch64__)\ntypedef unsigned long size_t;\n#elif defined(_WIN64)\ntypedef uint64_t size_t;\n#elif defined(_LP32) || defined(__ppc__) || defined(_WIN32) || defined(__arm__)\ntypedef uint32_t size_t;\n#else\n#error size_t undefined\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/  Boost wide_test.cpp  -----------------------------------------------------\/\/\n\/\/  Copyright Beman Dawes 2005\n\/\/  Use, modification, and distribution is subject to the Boost Software\n\/\/  License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n\/\/  http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/  See library home page at http:\/\/www.boost.org\/libs\/filesystem\n\n\/\/ Boost\n#include <boost\/version.hpp> \/\/ To check whether which version API is needed\n#include <boost\/config\/warning_disable.hpp>\n\n\/\/  See deprecated_test for tests of deprecated features\n#ifndef BOOST_FILESYSTEM_NO_DEPRECATED \n# define BOOST_FILESYSTEM_NO_DEPRECATED\n#endif\n#ifndef BOOST_SYSTEM_NO_DEPRECATED \n# define BOOST_SYSTEM_NO_DEPRECATED\n#endif\n\n#include <boost\/filesystem\/config.hpp>\n\n#if defined(BOOST_VERSION) && BOOST_VERSION >= 104400\n# ifdef BOOST_FILESYSTEM2_NARROW_ONLY\n#   error This compiler or standard library does not support wide-character strings or paths\n# endif\n#else \/\/ BOOST_VERSION\n# ifdef BOOST_FILESYSTEM_NARROW_ONLY\n#   error This compiler or standard library does not support wide-character strings or paths\n# endif\n#endif \/\/ BOOST_VERSION\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/scoped_array.hpp>\n#include <boost\/detail\/lightweight_test.hpp>\n\n#if defined(BOOST_VERSION) && BOOST_VERSION >= 104400\n#  include <boost\/filesystem\/detail\/utf8_codecvt_facet.hpp>\n#else \/\/ BOOST_VERSION\n#  include \"utf8_codecvt_facet.hpp\"\n#endif \/\/ BOOST_VERSION\n\nnamespace fs = boost::filesystem;\n\n\/\/ STL\n#include <iostream>\n#include <iomanip>\n#include <ios>\n#include <string>\n#include <cerrno>\n\n#include \"lpath.hpp\"\n\nnamespace {\n  \n  bool cleanup = true;\n\n  template< class Path >\n  void create_file( const Path & ph, const std::string & contents )\n  {\n    \/\/ TODO: why missing symbol error on Darwin\n# ifndef __APPLE__\n    fs::ofstream f( ph );\n# else    \n    std::ofstream f( ph.external_file_string().c_str() );\n# endif    \n    if ( !f )\n      throw fs::basic_filesystem_error<Path>( \"wide_test create_file\",\n                                              ph,\n#if defined(BOOST_VERSION) && BOOST_VERSION >= 104400\n        boost::system::error_code( errno, boost::system::generic_category() ) );\n#else \/\/ BOOST_VERSION\n        boost::system::error_code( errno, boost::system::errno_ecat ) );\n#endif \/\/ BOOST_VERSION\n    if ( !contents.empty() ) f << contents;\n  }\n\n  template< class Path >\n  void test( const Path & dir, const Path & file, const Path & dot )\n  {\n    Path tmp;\n    tmp = file;\n    BOOST_TEST( tmp == file );\n    tmp = file.string();\n    BOOST_TEST( tmp == file );\n    tmp = file.string().c_str();\n    BOOST_TEST( tmp == file );\n    fs::initial_path<Path>();\n    fs::current_path<Path>();\n    fs::remove( dir \/ file );\n    fs::remove( dir );\n    BOOST_TEST( !fs::exists( dir \/ file ) );\n    BOOST_TEST( !fs::exists( dir ) );\n    BOOST_TEST( fs::create_directory( dir ) );\n    BOOST_TEST( fs::exists( dir ) );\n    BOOST_TEST( fs::is_directory( dir ) );\n    BOOST_TEST( fs::is_empty( dir ) );\n    create_file( dir \/ file, \"wide_test file contents\" );\n    BOOST_TEST( fs::exists( dir \/ file ) );\n    BOOST_TEST( !fs::is_directory( dir \/ file ) );\n    BOOST_TEST( !fs::is_empty( dir \/ file ) );\n    BOOST_TEST( fs::file_size( dir \/ file ) == 23 || fs::file_size( dir \/ file ) == 24 );\n    BOOST_TEST( fs::equivalent( dir \/ file, dot \/ dir \/ file ) );\n    BOOST_TEST( fs::last_write_time( dir \/ file ) );\n    typedef fs::basic_directory_iterator<Path> it_t;\n    int count(0);\n    for ( it_t it( dir ); it != it_t(); ++it )\n      {\n        BOOST_TEST( it->path() == dir \/ file );\n        BOOST_TEST( !fs::is_empty( it->path() ) );\n        ++count;\n      }\n    BOOST_TEST( count == 1 );\n    if ( cleanup )\n      {\n        fs::remove( dir \/ file );\n        fs::remove( dir );\n      }\n  }\n\n  \/\/ test boost::detail::utf8_codecvt_facet - even though it is not used by\n  \/\/ Boost.Filesystem on Windows, early detection of problems is worthwhile.\n  std::string to_external( const std::wstring & src )\n  {\n    fs::detail::utf8_codecvt_facet convertor;\n    std::size_t work_size( convertor.max_length() * (src.size()+1) );\n    boost::scoped_array<char> work( new char[ work_size ] );\n    std::mbstate_t state;\n    const wchar_t * from_next;\n    char * to_next;\n    if ( convertor.out( \n      state, src.c_str(), src.c_str()+src.size(), from_next, work.get(),\n      work.get()+work_size, to_next ) != std::codecvt_base::ok )\n      boost::throw_exception( std::runtime_error(\"to_external conversion error\") );\n    *to_next = '\\0';\n    return std::string( work.get() );\n  }\n\n} \/\/ unnamed namespace\n\n\/\/  main  --------------------------------------------------------------------\/\/\n\nint main( int argc, char * \/*argv*\/[] )\n{\n\n  if ( argc > 1 ) cleanup = false;\n\n  \/\/ So that tests are run with known encoding, use Boost UTF-8 codecvt\n  std::locale global_loc = std::locale();\n  std::locale loc( global_loc, new fs::detail::utf8_codecvt_facet );\n  fs::wpath_traits::imbue( loc );\n\n  std::string s( to_external( L\"\\x2780\" ) );\n  for (std::size_t i = 0; i < s.size(); ++i )\n    std::cout << std::hex << int( static_cast<unsigned char>(s[i]) ) << \" \";\n  std::cout << std::dec << std::endl;\n  BOOST_TEST( to_external( L\"\\x2780\" ).size() == 3 );\n  BOOST_TEST( to_external( L\"\\x2780\" ) == \"\\xE2\\x9E\\x80\" );\n\n  \/\/ test fs::path\n  std::cout << \"begin path test...\" << std::endl;\n  test( fs::path( \"foo\" ), fs::path( \"bar\" ), fs::path( \".\" ) );\n  std::cout << \"complete\\n\\n\";\n\n  \/\/ test fs::wpath\n  \/\/  x2780 is circled 1 against white background == e2 9e 80 in UTF-8\n  \/\/  x2781 is circled 2 against white background == e2 9e 81 in UTF-8\n  std::cout << \"begin wpath test...\" << std::endl;\n  test( fs::wpath( L\"\\x2780\" ), fs::wpath( L\"\\x2781\" ), fs::wpath( L\".\" ) );\n  std::cout << \"complete\\n\\n\";\n\n  \/\/ test user supplied basic_path\n  const long dir[] = { 'b', 'o', 'o', 0 };\n  const long file[] = { 'f', 'a', 'r', 0 };\n  const long dot[] = { '.', 0 };\n  std::cout << \"begin lpath test...\" << std::endl;\n  test( ::user::lpath( dir ), ::user::lpath( file ), ::user::lpath( dot ) );\n  std::cout << \"complete\\n\\n\";\n\n  return ::boost::report_errors();\n}\n<commit_msg>[Test-Boost] Fixed the Boost.Filesystem compilation error for version lower than 1.44.<commit_after>\/\/  Boost wide_test.cpp  -----------------------------------------------------\/\/\n\/\/  Copyright Beman Dawes 2005\n\/\/  Use, modification, and distribution is subject to the Boost Software\n\/\/  License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n\/\/  http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/  See library home page at http:\/\/www.boost.org\/libs\/filesystem\n\n\/\/ Boost\n#include <boost\/version.hpp> \/\/ To check whether which version API is needed\n#include <boost\/config\/warning_disable.hpp>\n\n\/\/  See deprecated_test for tests of deprecated features\n#ifndef BOOST_FILESYSTEM_NO_DEPRECATED \n# define BOOST_FILESYSTEM_NO_DEPRECATED\n#endif\n#if defined(BOOST_VERSION) && BOOST_VERSION >= 104400\n#ifndef BOOST_SYSTEM_NO_DEPRECATED \n# define BOOST_SYSTEM_NO_DEPRECATED\n#endif \/\/ BOOST_SYSTEM_NO_DEPRECATED\n#endif \/\/ BOOST_VERSION\n\n#include <boost\/filesystem\/config.hpp>\n\n#if defined(BOOST_VERSION) && BOOST_VERSION >= 104400\n# ifdef BOOST_FILESYSTEM2_NARROW_ONLY\n#   error This compiler or standard library does not support wide-character strings or paths\n# endif\n#else \/\/ BOOST_VERSION\n# ifdef BOOST_FILESYSTEM_NARROW_ONLY\n#   error This compiler or standard library does not support wide-character strings or paths\n# endif\n#endif \/\/ BOOST_VERSION\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/scoped_array.hpp>\n#include <boost\/detail\/lightweight_test.hpp>\n\n#if defined(BOOST_VERSION) && BOOST_VERSION >= 104400\n#  include <boost\/filesystem\/detail\/utf8_codecvt_facet.hpp>\n#else \/\/ BOOST_VERSION\n#  include \"utf8_codecvt_facet.hpp\"\n#endif \/\/ BOOST_VERSION\n\nnamespace fs = boost::filesystem;\n\n\/\/ STL\n#include <iostream>\n#include <iomanip>\n#include <ios>\n#include <string>\n#include <cerrno>\n\n#include \"lpath.hpp\"\n\nnamespace {\n  \n  bool cleanup = true;\n\n  template< class Path >\n  void create_file( const Path & ph, const std::string & contents )\n  {\n    \/\/ TODO: why missing symbol error on Darwin\n# ifndef __APPLE__\n    fs::ofstream f( ph );\n# else    \n    std::ofstream f( ph.external_file_string().c_str() );\n# endif    \n    if ( !f )\n      throw fs::basic_filesystem_error<Path>( \"wide_test create_file\",\n                                              ph,\n#if defined(BOOST_VERSION) && BOOST_VERSION >= 104400\n        boost::system::error_code( errno, boost::system::generic_category() ) );\n#else \/\/ BOOST_VERSION\n        boost::system::error_code( errno, boost::system::errno_ecat ) );\n#endif \/\/ BOOST_VERSION\n    if ( !contents.empty() ) f << contents;\n  }\n\n  template< class Path >\n  void test( const Path & dir, const Path & file, const Path & dot )\n  {\n    Path tmp;\n    tmp = file;\n    BOOST_TEST( tmp == file );\n    tmp = file.string();\n    BOOST_TEST( tmp == file );\n    tmp = file.string().c_str();\n    BOOST_TEST( tmp == file );\n    fs::initial_path<Path>();\n    fs::current_path<Path>();\n    fs::remove( dir \/ file );\n    fs::remove( dir );\n    BOOST_TEST( !fs::exists( dir \/ file ) );\n    BOOST_TEST( !fs::exists( dir ) );\n    BOOST_TEST( fs::create_directory( dir ) );\n    BOOST_TEST( fs::exists( dir ) );\n    BOOST_TEST( fs::is_directory( dir ) );\n    BOOST_TEST( fs::is_empty( dir ) );\n    create_file( dir \/ file, \"wide_test file contents\" );\n    BOOST_TEST( fs::exists( dir \/ file ) );\n    BOOST_TEST( !fs::is_directory( dir \/ file ) );\n    BOOST_TEST( !fs::is_empty( dir \/ file ) );\n    BOOST_TEST( fs::file_size( dir \/ file ) == 23 || fs::file_size( dir \/ file ) == 24 );\n    BOOST_TEST( fs::equivalent( dir \/ file, dot \/ dir \/ file ) );\n    BOOST_TEST( fs::last_write_time( dir \/ file ) );\n    typedef fs::basic_directory_iterator<Path> it_t;\n    int count(0);\n    for ( it_t it( dir ); it != it_t(); ++it )\n      {\n        BOOST_TEST( it->path() == dir \/ file );\n        BOOST_TEST( !fs::is_empty( it->path() ) );\n        ++count;\n      }\n    BOOST_TEST( count == 1 );\n    if ( cleanup )\n      {\n        fs::remove( dir \/ file );\n        fs::remove( dir );\n      }\n  }\n\n  \/\/ test boost::detail::utf8_codecvt_facet - even though it is not used by\n  \/\/ Boost.Filesystem on Windows, early detection of problems is worthwhile.\n  std::string to_external( const std::wstring & src )\n  {\n    fs::detail::utf8_codecvt_facet convertor;\n    std::size_t work_size( convertor.max_length() * (src.size()+1) );\n    boost::scoped_array<char> work( new char[ work_size ] );\n    std::mbstate_t state;\n    const wchar_t * from_next;\n    char * to_next;\n    if ( convertor.out( \n      state, src.c_str(), src.c_str()+src.size(), from_next, work.get(),\n      work.get()+work_size, to_next ) != std::codecvt_base::ok )\n      boost::throw_exception( std::runtime_error(\"to_external conversion error\") );\n    *to_next = '\\0';\n    return std::string( work.get() );\n  }\n\n} \/\/ unnamed namespace\n\n\/\/  main  --------------------------------------------------------------------\/\/\n\nint main( int argc, char * \/*argv*\/[] )\n{\n\n  if ( argc > 1 ) cleanup = false;\n\n  \/\/ So that tests are run with known encoding, use Boost UTF-8 codecvt\n  std::locale global_loc = std::locale();\n  std::locale loc( global_loc, new fs::detail::utf8_codecvt_facet );\n  fs::wpath_traits::imbue( loc );\n\n  std::string s( to_external( L\"\\x2780\" ) );\n  for (std::size_t i = 0; i < s.size(); ++i )\n    std::cout << std::hex << int( static_cast<unsigned char>(s[i]) ) << \" \";\n  std::cout << std::dec << std::endl;\n  BOOST_TEST( to_external( L\"\\x2780\" ).size() == 3 );\n  BOOST_TEST( to_external( L\"\\x2780\" ) == \"\\xE2\\x9E\\x80\" );\n\n  \/\/ test fs::path\n  std::cout << \"begin path test...\" << std::endl;\n  test( fs::path( \"foo\" ), fs::path( \"bar\" ), fs::path( \".\" ) );\n  std::cout << \"complete\\n\\n\";\n\n  \/\/ test fs::wpath\n  \/\/  x2780 is circled 1 against white background == e2 9e 80 in UTF-8\n  \/\/  x2781 is circled 2 against white background == e2 9e 81 in UTF-8\n  std::cout << \"begin wpath test...\" << std::endl;\n  test( fs::wpath( L\"\\x2780\" ), fs::wpath( L\"\\x2781\" ), fs::wpath( L\".\" ) );\n  std::cout << \"complete\\n\\n\";\n\n  \/\/ test user supplied basic_path\n  const long dir[] = { 'b', 'o', 'o', 0 };\n  const long file[] = { 'f', 'a', 'r', 0 };\n  const long dot[] = { '.', 0 };\n  std::cout << \"begin lpath test...\" << std::endl;\n  test( ::user::lpath( dir ), ::user::lpath( file ), ::user::lpath( dot ) );\n  std::cout << \"complete\\n\\n\";\n\n  return ::boost::report_errors();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2010 Tommi Maekitalo\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\n#include \"worker.h\"\n#include \"serverimpl.h\"\n#include <cxxtools\/log.h>\n#include \"socket.h\"\n\nlog_define(\"cxxtools.http.worker\")\n\nnamespace cxxtools\n{\nnamespace http\n{\n\nvoid Worker::run()\n{\n    log_info(\"new thread running\");\n    while (!_server.isTerminating() && _server._queue.numWaiting() < _server.minThreads())\n    {\n        Socket* socket = _server._queue.get();\n\n        if (_server.isTerminating())\n        {\n            log_debug(\"server is terminating - quit thread\");\n            _server._queue.put(socket);\n            break;\n        }\n\n        if (_server._queue.numWaiting() == 0)\n            _server.noWaitingThreads();\n\n        try\n        {\n            if (!socket->hasAccepted())\n            {\n                \/\/ do blocking accept\n                socket->accept();\n                log_debug(\"connection accepted from \" << socket->getPeerAddr());\n\n                if (_server.isTerminating())\n                {\n                    log_debug(\"server is terminating - quit thread\");\n                    _server._queue.put(socket);\n                    break;\n                }\n\n                \/\/ new connection arrived - create new accept socket\n                _server._queue.put(new Socket(*socket));\n            }\n            else if (socket->isConnected())\n            {\n                log_debug(\"process available input\");\n                socket->onInput(socket->buffer());\n            }\n            else\n            {\n                log_debug(\"socket is not connected any more; delete \" << static_cast<void*>(socket));\n                delete socket;\n            }\n\n            connect(socket->buffer().inputReady, socket->inputSlot);\n\n            while (socket->wait(_server.idleTimeout()) && socket->isConnected())\n                ;\n\n            if (socket->isConnected())\n            {\n                log_debug(\"timeout processing socket\");\n                disconnect(socket->buffer().inputReady, socket->inputSlot);\n                _server.addIdleSocket(socket);\n            }\n            else if (_server.isTerminating())\n            {\n                _server._queue.put(socket);\n            }\n            else\n            {\n                log_debug(\"socket is not connected any more; delete \" << static_cast<void*>(socket));\n                delete socket;\n            }\n        }\n        catch (const std::exception& e)\n        {\n            log_debug(\"error occured in device: \" << e.what() << \"; delete \" << static_cast<void*>(socket));\n            delete socket;\n        }\n    }\n\n    log_info(\"thread terminated\");\n    _server.threadTerminated(this);\n}\n\n\n}\n}\n<commit_msg>bugfix: do not use deleted http socket any more<commit_after>\/*\n * Copyright (C) 2010 Tommi Maekitalo\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\n#include \"worker.h\"\n#include \"serverimpl.h\"\n#include <cxxtools\/log.h>\n#include \"socket.h\"\n\nlog_define(\"cxxtools.http.worker\")\n\nnamespace cxxtools\n{\nnamespace http\n{\n\nvoid Worker::run()\n{\n    log_info(\"new thread running\");\n    while (!_server.isTerminating() && _server._queue.numWaiting() < _server.minThreads())\n    {\n        Socket* socket = _server._queue.get();\n\n        if (_server.isTerminating())\n        {\n            log_debug(\"server is terminating - quit thread\");\n            _server._queue.put(socket);\n            break;\n        }\n\n        if (_server._queue.numWaiting() == 0)\n            _server.noWaitingThreads();\n\n        try\n        {\n            if (!socket->hasAccepted())\n            {\n                \/\/ do blocking accept\n                socket->accept();\n                log_debug(\"connection accepted from \" << socket->getPeerAddr());\n\n                if (_server.isTerminating())\n                {\n                    log_debug(\"server is terminating - quit thread\");\n                    _server._queue.put(socket);\n                    break;\n                }\n\n                \/\/ new connection arrived - create new accept socket\n                _server._queue.put(new Socket(*socket));\n            }\n            else if (socket->isConnected())\n            {\n                log_debug(\"process available input\");\n                socket->onInput(socket->buffer());\n            }\n            else\n            {\n                log_debug(\"socket is not connected any more; delete \" << static_cast<void*>(socket));\n                delete socket;\n                continue;\n            }\n\n            connect(socket->buffer().inputReady, socket->inputSlot);\n\n            while (socket->wait(_server.idleTimeout()) && socket->isConnected())\n                ;\n\n            if (socket->isConnected())\n            {\n                log_debug(\"timeout processing socket\");\n                disconnect(socket->buffer().inputReady, socket->inputSlot);\n                _server.addIdleSocket(socket);\n            }\n            else if (_server.isTerminating())\n            {\n                _server._queue.put(socket);\n            }\n            else\n            {\n                log_debug(\"socket is not connected any more; delete \" << static_cast<void*>(socket));\n                delete socket;\n            }\n        }\n        catch (const std::exception& e)\n        {\n            log_debug(\"error occured in device: \" << e.what() << \"; delete \" << static_cast<void*>(socket));\n            delete socket;\n        }\n    }\n\n    log_info(\"thread terminated\");\n    _server.threadTerminated(this);\n}\n\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/============================================================================\n\/\/ Name        : SmartBreakerServer.cpp\n\/\/ Author      : Bingyu\n\/\/ Version     :\n\/\/ Copyright   : ZEin 2017\n\/\/ Description :\n\/\/============================================================================\n\n#include <muduo\/base\/Mutex.h>\n#include <muduo\/base\/Logging.h>\n#include <muduo\/net\/EventLoop.h>\n#include <muduo\/net\/EventLoopThread.h>\n#include <muduo\/net\/InetAddress.h>\n#include <muduo\/net\/inspect\/Inspector.h>\n\n#include <boost\/bind.hpp>\n#include <boost\/random.hpp>\n#include <boost\/random\/seed_seq.hpp>\n\n#include <string.h>\n#include <unistd.h>\n\n#include <iostream>\n\n\nusing namespace muduo;\nusing namespace muduo::net;\n\n\/\/using namespace std;\n\n#include <ctime>\n\n#include \"gconf.h\"\n#include \"commons.h\"\n\n#include \"redisWrapper.h\"\n#include \"servers.h\"\n\n\n\n\nnamespace muduo\n{\nnamespace inspect\n{\nint stringPrintf(string* out, const char* fmt, ...) __attribute__ ((format (printf, 2, 3)));\n}\n}\n\nusing muduo::inspect::stringPrintf;\n\nboost::mt19937 gRng;\n\nstring GetOverview(HttpRequest::Method, const Inspector::ArgList&,\n                   AgtServer *pAgt, HookServer *pHook)\n{\n\tstring result;\n\n\tresult.reserve(1024);\n\tstringPrintf(&result, \"Current active links:\\n\\n\");\n\tstringPrintf(&result, \"Agents: %5d \/ %d\\n\", pAgt->getNumConn(), gConf.agtCmax_);\n\tstringPrintf(&result, \"Hooks:  %5d \/ %d\\n\", pHook->getNumConn(), gConf.hookCmax_);\n\n    return result;\n}\n\nvoid SBSMain(void)\n{\n    unsigned tt[2] = { static_cast<unsigned int>(std::time(0)), 2323ul };\n\n    boost::random::seed_seq ss(tt);\n\tgRng.seed(ss);\n\n\tEventLoop loop;\n\tEventLoopThread tIns, tQuery;\n\tInspector ins(tIns.startLoop(), InetAddress(gConf.monPort_), \"Inspector\");\n\n\thiredis::redisQuery qRedis(&loop, InetAddress(gConf.rds1Addr_, gConf.rds1Port_));\n\tqRedis.connect();\n\n\thiredis::redisStore sRedis(tQuery.startLoop(), InetAddress(gConf.rds1Addr_, gConf.rds1Port_));\n    sRedis.connect();\n\n    HookServer hookSvr(&loop, InetAddress(static_cast<uint16_t>(gConf.hookPort_)),\n                       gConf.hookCmax_, \"TCPHook\");\n    hookSvr.start();\n\n\t\/\/ Start Agent Listener\n    AgtServer agtServer(&loop, InetAddress(static_cast<uint16_t>(gConf.agtPort_)),\n                      gConf.agtCmax_, \"AgentServer\", &sRedis, &qRedis, &hookSvr);\n    agtServer.start();\n\n\t\/\/ Add inspector entrance\n\n\tins.add(\"smbrk\", \"links\",\n            boost::bind(GetOverview, _1, _2, &agtServer, &hookSvr),\n            \"Active links overview\");\n\n\tloop.loop();\n}\n<commit_msg>Minor changes<commit_after>\/\/============================================================================\n\/\/ Name        : SmartBreakerServer.cpp\n\/\/ Author      : Bingyu\n\/\/ Version     :\n\/\/ Copyright   : ZEin 2017\n\/\/ Description :\n\/\/============================================================================\n\n#include <muduo\/base\/Mutex.h>\n#include <muduo\/base\/Logging.h>\n#include <muduo\/net\/EventLoop.h>\n#include <muduo\/net\/EventLoopThread.h>\n#include <muduo\/net\/InetAddress.h>\n#include <muduo\/net\/inspect\/Inspector.h>\n\n#include <boost\/bind.hpp>\n#include <boost\/random.hpp>\n#include <boost\/random\/seed_seq.hpp>\n\n#include <string.h>\n#include <unistd.h>\n\n#include <iostream>\n\n\nusing namespace muduo;\nusing namespace muduo::net;\n\n\/\/using namespace std;\n\n#include <ctime>\n\n#include \"gconf.h\"\n#include \"commons.h\"\n\n#include \"redisWrapper.h\"\n#include \"servers.h\"\n\n\nnamespace muduo\n{\nnamespace inspect\n{\nint stringPrintf(string* out, const char* fmt, ...) __attribute__ ((format (printf, 2, 3)));\n}\n}\n\nusing muduo::inspect::stringPrintf;\n\nboost::mt19937 gRng;\n\n\nstring GetOverview(HttpRequest::Method, const Inspector::ArgList&,\n                   AgtServer *pAgt, HookServer *pHook)\n{\n\tstring result;\n\n\tresult.reserve(1024);\n\tstringPrintf(&result, \"Current active links:\\n\\n\");\n\tstringPrintf(&result, \"Agents: %5d \/ %d\\n\", pAgt->getNumConn(), gConf.agtCmax_);\n\tstringPrintf(&result, \"Hooks:  %5d \/ %d\\n\", pHook->getNumConn(), gConf.hookCmax_);\n\n    return result;\n}\n\nvoid SBSMain(void)\n{\n    unsigned tt[2] = { static_cast<unsigned int>(std::time(0)), 2323ul };\n\n    boost::random::seed_seq ss(tt);\n\tgRng.seed(ss);\n\n\tEventLoop loop;\n\tEventLoopThread tIns, tQuery;\n\tInspector ins(tIns.startLoop(), InetAddress(gConf.monPort_), \"Breaker Inspector\");\n\n\thiredis::redisQuery qRedis(&loop, InetAddress(gConf.rds1Addr_, gConf.rds1Port_));\n\tqRedis.connect();\n\n\thiredis::redisStore sRedis(tQuery.startLoop(), InetAddress(gConf.rds1Addr_, gConf.rds1Port_));\n    sRedis.connect();\n\n    HookServer hookSvr(&loop, InetAddress(static_cast<uint16_t>(gConf.hookPort_)),\n                       gConf.hookCmax_, \"TCPHook\");\n    hookSvr.start();\n\n\t\/\/ Start Agent Listener\n    AgtServer agtServer(&loop, InetAddress(static_cast<uint16_t>(gConf.agtPort_)),\n                       gConf.agtCmax_, \"AgentServer\", &sRedis, &qRedis, &hookSvr);\n    agtServer.start();\n\n\t\/\/ Add inspector entrance\n\n\tins.add(\"smbrk\", \"links\",\n            boost::bind(GetOverview, _1, _2, &agtServer, &hookSvr),\n            \"print links overview\");\n\n\tloop.loop();\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <SpikeHwIndication.h>\n#include <SpikeHwRequest.h>\n#include \"dmaManager.h\"\n#include \"spikehw.h\"\n#include <iostream>\n#include <functional>\n#include <riscv\/devices.h>\n\nint verbose = 0;\n\nclass SpikeHwIndication : public SpikeHwIndicationWrapper\n{\n  sem_t sem;\npublic:\n    uint32_t buf[16];\n\n  void irqChanged( const uint8_t irqLevel, const uint8_t intrSources ) {\n      fprintf(stderr, \"irqLevel %d intr sources %x\\n\", irqLevel, intrSources);\n    }\n    virtual void resetDone() {\n\tfprintf(stderr, \"reset done\\n\");\n\tsem_post(&sem);\n    }\n    virtual void status ( const uint8_t mmcm_locked, const uint8_t irq, const uint8_t intrSources ) {\n\tfprintf(stderr, \"axi eth status mmcm_locked=%d irq=%d intr sources=%x\\n\", mmcm_locked, irq, intrSources);\n\tsem_post(&sem);\n    }\n\n    void wait() {\n\tsem_wait(&sem);\n    }\n\n    void readDone ( const uint32_t value ) {\n\tbuf[0] = value;\n\tif (verbose) fprintf(stderr, \"readDone value=%08x\\n\", value);\n\tsem_post(&sem);\n    }\n\n    void writeDone (  ) {\n\tif (verbose) fprintf(stderr, \"writeDone\\n\");\n\tsem_post(&sem);\n    }\n\n    void readFlashDone ( const uint32_t value ) {\n\tbuf[0] = value;\n\tif (verbose) fprintf(stderr, \"readFlashDone value=%08x\\n\", value);\n\tsem_post(&sem);\n    }\n\n    void writeFlashDone (  ) {\n\tif (verbose) fprintf(stderr, \"writeFlashDone\\n\");\n\tsem_post(&sem);\n    }\n\n    SpikeHwIndication(unsigned int id) : SpikeHwIndicationWrapper(id) {\n      sem_init(&sem, 0, 0);\n    }\n};\n\n\nSpikeHwRequestProxy *request;\nSpikeHwIndication *indication;\n\nSpikeHw::SpikeHw()\n    : request(0), indication(0), dmaManager(0), didReset(false)\n{\n    request = new SpikeHwRequestProxy(IfcNames_SpikeHwRequestS2H);\n    indication = new SpikeHwIndication(IfcNames_SpikeHwIndicationH2S);\n    dmaManager = platformInit();\n    request->setFlashParameters(50);\n}\n\nSpikeHw::~SpikeHw()\n{\n  \/\/delete request;\n  \/\/delete indication;\n  request = 0;\n  indication = 0;\n}\n\nvoid SpikeHw::maybeReset()\n{\n    if (0)\n    if (!didReset) {\n\tfprintf(stderr, \"resetting flash\\n\");\n\trequest->reset();\n\tindication->wait();\n\t\/\/request->setParameters(50, 0);\n\tfprintf(stderr, \"done resetting flash\\n\");\n\tdidReset = true;\n    }\n}\n\nvoid SpikeHw::status()\n{\n    request->status();\n    indication->wait();\n}\n\nvoid SpikeHw::setupDma(uint32_t memfd)\n{\n    int memref = dmaManager->reference(memfd);\n    request->setupDma(memref);\n}\n\nvoid SpikeHw::read(unsigned long offset, uint8_t *buf)\n{\n    maybeReset();\n\n    if (verbose) fprintf(stderr, \"SpikeHw::read offset=%lx\\n\", offset);\n    request->read(offset);\n    indication->wait();\n    if (verbose) fprintf(stderr, \"SpikeHw::read offset=%lx value=%x\\n\", offset, *(uint32_t *)indication->buf);\n    memcpy(buf, indication->buf, 4);\n}\n\nvoid SpikeHw::write(unsigned long offset, const uint8_t *buf)\n{\n    maybeReset();\n\n    if (1 || verbose) fprintf(stderr, \"SpikeHw::write offset=%lx value=%x\\n\", offset, *(uint32_t *)buf);\n    request->write(offset, *(uint32_t *)buf);\n    indication->wait();\n    request->status();\n    indication->wait();\n}\n\nvoid SpikeHw::setFlashParameters(unsigned long cycles)\n{\n    request->setFlashParameters(cycles);\n}\n\nvoid SpikeHw::readFlash(unsigned long offset, uint8_t *buf)\n{\n    maybeReset();\n\n    if (verbose) fprintf(stderr, \"SpikeHw::readFlash offset=%lx\\n\", offset);\n    request->readFlash(offset);\n    indication->wait();\n    if (verbose) fprintf(stderr, \"SpikeHw::readFlash offset=%lx value=%x\\n\", offset, *(uint32_t *)indication->buf);\n    memcpy(buf, indication->buf, 4);\n}\n\nvoid SpikeHw::writeFlash(unsigned long offset, const uint8_t *buf)\n{\n    maybeReset();\n\n    if (1 || verbose) fprintf(stderr, \"SpikeHw::writeFlash offset=%lx value=%x\\n\", offset, *(uint32_t *)buf);\n    request->writeFlash(offset, *(uint32_t *)buf);\n    indication->wait();\n}\n\nclass spikehw_device_t : public abstract_device_t {\npublic:\n  spikehw_device_t();\n  bool load(reg_t addr, size_t len, uint8_t* bytes);\n  bool store(reg_t addr, size_t len, const uint8_t* bytes);\n  static abstract_device_t *make_device();\nprivate:\n  SpikeHw *spikeHw;\n};\n\nspikehw_device_t::spikehw_device_t()\n{\n  spikeHw = new SpikeHw();\n}\n\nbool spikehw_device_t::load(reg_t addr, size_t len, uint8_t* bytes)\n{\n    spikeHw->read(addr, bytes); \/\/ always reads 4 bytes\n    return true;\n}\n\nbool spikehw_device_t::store(reg_t addr, size_t len, const uint8_t* bytes)\n{\n    spikeHw->write(addr, bytes);\n    return true;\n}\n\nabstract_device_t *spikehw_device_t::make_device()\n{\n    std::cerr << \"make_device called\" << std::endl;\n    return new spikehw_device_t();\n}\n\nREGISTER_DEVICE(spikehw, 0x42000000, spikehw_device_t::make_device);\n<commit_msg>added devicetree device for bootstrapping<commit_after>\n#include <fcntl.h>\n#include <sys\/mman.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include <SpikeHwIndication.h>\n#include <SpikeHwRequest.h>\n#include \"dmaManager.h\"\n#include \"spikehw.h\"\n#include <iostream>\n#include <functional>\n#include <riscv\/devices.h>\n\nint verbose = 0;\n\nclass SpikeHwIndication : public SpikeHwIndicationWrapper\n{\n  sem_t sem;\npublic:\n    uint32_t buf[16];\n\n  void irqChanged( const uint8_t irqLevel, const uint8_t intrSources ) {\n      fprintf(stderr, \"irqLevel %d intr sources %x\\n\", irqLevel, intrSources);\n    }\n    virtual void resetDone() {\n\tfprintf(stderr, \"reset done\\n\");\n\tsem_post(&sem);\n    }\n    virtual void status ( const uint8_t mmcm_locked, const uint8_t irq, const uint8_t intrSources ) {\n\tfprintf(stderr, \"axi eth status mmcm_locked=%d irq=%d intr sources=%x\\n\", mmcm_locked, irq, intrSources);\n\tsem_post(&sem);\n    }\n\n    void wait() {\n\tsem_wait(&sem);\n    }\n\n    void readDone ( const uint32_t value ) {\n\tbuf[0] = value;\n\tif (verbose) fprintf(stderr, \"readDone value=%08x\\n\", value);\n\tsem_post(&sem);\n    }\n\n    void writeDone (  ) {\n\tif (verbose) fprintf(stderr, \"writeDone\\n\");\n\tsem_post(&sem);\n    }\n\n    void readFlashDone ( const uint32_t value ) {\n\tbuf[0] = value;\n\tif (verbose) fprintf(stderr, \"readFlashDone value=%08x\\n\", value);\n\tsem_post(&sem);\n    }\n\n    void writeFlashDone (  ) {\n\tif (verbose) fprintf(stderr, \"writeFlashDone\\n\");\n\tsem_post(&sem);\n    }\n\n    SpikeHwIndication(unsigned int id) : SpikeHwIndicationWrapper(id) {\n      sem_init(&sem, 0, 0);\n    }\n};\n\n\nSpikeHwRequestProxy *request;\nSpikeHwIndication *indication;\n\nSpikeHw::SpikeHw()\n    : request(0), indication(0), dmaManager(0), didReset(false)\n{\n    request = new SpikeHwRequestProxy(IfcNames_SpikeHwRequestS2H);\n    indication = new SpikeHwIndication(IfcNames_SpikeHwIndicationH2S);\n    dmaManager = platformInit();\n    request->setFlashParameters(50);\n}\n\nSpikeHw::~SpikeHw()\n{\n  \/\/delete request;\n  \/\/delete indication;\n  request = 0;\n  indication = 0;\n}\n\nvoid SpikeHw::maybeReset()\n{\n    if (0)\n    if (!didReset) {\n\tfprintf(stderr, \"resetting flash\\n\");\n\trequest->reset();\n\tindication->wait();\n\t\/\/request->setParameters(50, 0);\n\tfprintf(stderr, \"done resetting flash\\n\");\n\tdidReset = true;\n    }\n}\n\nvoid SpikeHw::status()\n{\n    request->status();\n    indication->wait();\n}\n\nvoid SpikeHw::setupDma(uint32_t memfd)\n{\n    int memref = dmaManager->reference(memfd);\n    request->setupDma(memref);\n}\n\nvoid SpikeHw::read(unsigned long offset, uint8_t *buf)\n{\n    maybeReset();\n\n    if (verbose) fprintf(stderr, \"SpikeHw::read offset=%lx\\n\", offset);\n    request->read(offset);\n    indication->wait();\n    if (verbose) fprintf(stderr, \"SpikeHw::read offset=%lx value=%x\\n\", offset, *(uint32_t *)indication->buf);\n    memcpy(buf, indication->buf, 4);\n}\n\nvoid SpikeHw::write(unsigned long offset, const uint8_t *buf)\n{\n    maybeReset();\n\n    if (1 || verbose) fprintf(stderr, \"SpikeHw::write offset=%lx value=%x\\n\", offset, *(uint32_t *)buf);\n    request->write(offset, *(uint32_t *)buf);\n    indication->wait();\n    request->status();\n    indication->wait();\n}\n\nvoid SpikeHw::setFlashParameters(unsigned long cycles)\n{\n    request->setFlashParameters(cycles);\n}\n\nvoid SpikeHw::readFlash(unsigned long offset, uint8_t *buf)\n{\n    maybeReset();\n\n    if (verbose) fprintf(stderr, \"SpikeHw::readFlash offset=%lx\\n\", offset);\n    request->readFlash(offset);\n    indication->wait();\n    if (verbose) fprintf(stderr, \"SpikeHw::readFlash offset=%lx value=%x\\n\", offset, *(uint32_t *)indication->buf);\n    memcpy(buf, indication->buf, 4);\n}\n\nvoid SpikeHw::writeFlash(unsigned long offset, const uint8_t *buf)\n{\n    maybeReset();\n\n    if (1 || verbose) fprintf(stderr, \"SpikeHw::writeFlash offset=%lx value=%x\\n\", offset, *(uint32_t *)buf);\n    request->writeFlash(offset, *(uint32_t *)buf);\n    indication->wait();\n}\n\nclass spikehw_device_t : public abstract_device_t {\npublic:\n  spikehw_device_t();\n  bool load(reg_t addr, size_t len, uint8_t* bytes);\n  bool store(reg_t addr, size_t len, const uint8_t* bytes);\n  static abstract_device_t *make_device();\nprivate:\n  SpikeHw *spikeHw;\n};\n\nspikehw_device_t::spikehw_device_t()\n{\n  spikeHw = new SpikeHw();\n}\n\nbool spikehw_device_t::load(reg_t addr, size_t len, uint8_t* bytes)\n{\n    spikeHw->read(addr, bytes); \/\/ always reads 4 bytes\n    return true;\n}\n\nbool spikehw_device_t::store(reg_t addr, size_t len, const uint8_t* bytes)\n{\n    spikeHw->write(addr, bytes);\n    return true;\n}\n\nabstract_device_t *spikehw_device_t::make_device()\n{\n    std::cerr << \"make_device called\" << std::endl;\n    return new spikehw_device_t();\n}\n\nclass devicetree_device_t : public abstract_device_t {\npublic:\n    devicetree_device_t();\n    bool load(reg_t addr, size_t len, uint8_t* bytes);\n    bool store(reg_t addr, size_t len, const uint8_t* bytes);\n    static abstract_device_t *make_device();\nprivate:\n    const char *dtb;\n    size_t dtbsz;\n};\n\ndevicetree_device_t::devicetree_device_t()\n{\n    int fd = open(\"devicetree.dtb\", O_RDONLY);\n    if (fd > 0) {\n\tstruct stat statbuf;\n\tint status = fstat(fd, &statbuf);\n\tfprintf(stderr, \"fstat status %d size %ld\\n\", status, statbuf.st_size);\n\tif (status == 0) {\n\t    dtb = (const char *)mmap(0, statbuf.st_size, PROT_READ, MAP_SHARED, fd, 0);\n\t    dtbsz = statbuf.st_size;\n\t    fprintf(stderr, \"mapped dtb at %p (%ld bytes)\\n\", dtb, dtbsz);\n\t}\n\tclose(fd);\n    } else {\n\tfprintf(stderr, \"Could not open devicetree.dtb\\n\");\n    }\n}\n\nbool devicetree_device_t::load(reg_t addr, size_t len, uint8_t* bytes)\n{\n    if (dtb && dtb != MAP_FAILED) {\n\tif ((addr < dtbsz) && (bytes != 0)) {\n\t    memcpy(bytes, dtb + addr, len);\n\t    return true;\n\t}\n    }\n    return false;\n}\n\nbool devicetree_device_t::store(reg_t addr, size_t len, const uint8_t* bytes)\n{\n    return true;\n}\n\nabstract_device_t *devicetree_device_t::make_device()\n{\n    std::cerr << \"devicetree_device_t::make_device called\" << std::endl;\n    return new devicetree_device_t();\n}\n\nREGISTER_DEVICE(devicetree, 0x41000000, devicetree_device_t::make_device);\nREGISTER_DEVICE(spikehw,    0x42000000, spikehw_device_t::make_device);\n<|endoftext|>"}
{"text":"<commit_before>#include <fstream>\n#include <string>\n#include <map>\n#include <memory>\n#include \"core\/message.h\"\n#include \"edict_messages.h\"\n#include \"lirch_plugin.h\"\n\nusing namespace std;\n\nvoid run(plugin_pipe pipe, std::string name)\n{\n\tbool shutdown = false;\n\tpipe.write(registration_message::create(0, name, \"display\"));\n\tmap<QString, unique_ptr<ofstream> > open_files;\n\twhile(!shutdown)\n\t{\n\t\tmessage front = pipe.blocking_read();\n\t\tif(front.type == \"shutdown\")\n\t\t{\n\t\t\tshutdown = true;\n\t\t}\n\t\telse if(front.type == \"registration_status\")\n\t\t{\n\t\t\tregistration_status * internals=dynamic_cast<registration_status *>(front.getdata());\n\t\t\tif (internals)\n\t\t\t{\n\t\t\t\t\/\/This is a registration_status message, just like it said\n\t\t\t\tif (!internals->status)\n\t\t\t\t\tpipe.write(registration_message::create(internals->priority-1, name, internals->type));\n\t\t\t}\t\n\t\t}\n\t\telse if (front.type == \"display\")\n\t\t{\n\t\t\tdisplay_message * internals = dynamic_cast<display_message *>(front.getdata());\n\t\t\tif(internals)\n\t\t\t{\n\t\t\t\tQString channelname = internals->channel;\n\t\t\t\tif(!open_files.count(channelname))\n\t\t\t\t{\n\t\t\t\t\tstring filename(channelname.toUtf8().data());\n\t\t\t\t\tfilename += \".txt\";\n\t\t\t\t\topen_files[channelname] = unique_ptr<ofstream>(new ofstream());\n\t\t\t\t\topen_files[channelname]->open(filename.c_str(), fstream::app);\t\n\t\t\t\t}\n\t\t\t\tstring output(internals->contents.toUtf8().data());\n\t\t\t\topen_files[channelname]->write(output.c_str(), sizeof output);\n\t\t\t}\n\t\t}\n\t}\n\t\/\/done_message::create(name);\n}\n<commit_msg>Made logger bounce back messages<commit_after>#include <fstream>\n#include <string>\n#include <map>\n#include <memory>\n#include \"core\/message.h\"\n#include \"edict_messages.h\"\n#include \"lirch_plugin.h\"\n\nusing namespace std;\n\nvoid run(plugin_pipe pipe, std::string name)\n{\n\tbool shutdown = false;\n\tpipe.write(registration_message::create(0, name, \"display\"));\n\tmap<QString, unique_ptr<ofstream> > open_files;\n\twhile(!shutdown)\n\t{\n\t\tmessage front = pipe.blocking_read();\n\t\tif(front.type == \"shutdown\")\n\t\t{\n\t\t\tshutdown = true;\n\t\t}\n\t\telse if(front.type == \"registration_status\")\n\t\t{\n\t\t\tregistration_status * internals=dynamic_cast<registration_status *>(front.getdata());\n\t\t\tif (internals)\n\t\t\t{\n\t\t\t\t\/\/This is a registration_status message, just like it said\n\t\t\t\tif (!internals->status)\n\t\t\t\t\tpipe.write(registration_message::create(internals->priority-1, name, internals->type));\n\t\t\t}\t\n\t\t}\n\t\telse if (front.type == \"display\")\n\t\t{\n\t\t\tdisplay_message * internals = dynamic_cast<display_message *>(front.getdata());\n\t\t\tif(internals)\n\t\t\t{\n\t\t\t\tQString channelname = internals->channel;\n\t\t\t\tif(!open_files.count(channelname))\n\t\t\t\t{\n\t\t\t\t\tstring filename(channelname.toUtf8().data());\n\t\t\t\t\tfilename += \".txt\";\n\t\t\t\t\topen_files[channelname] = unique_ptr<ofstream>(new ofstream());\n\t\t\t\t\topen_files[channelname]->open(filename.c_str(), fstream::app);\t\n\t\t\t\t}\n\t\t\t\tstring output(internals->contents.toUtf8().data());\n\t\t\t\topen_files[channelname]->write(output.c_str(), sizeof output);\n\t\t\t}\n\t\t\tmessage bounceback;\n\t\t\tbounceback.type = \"display\";\n\t\t\tbounceback.data = internals->copy();\n\t\t\tpipe.write(bounceback);\n\t\t}\n\t}\n\t\/\/done_message::create(name);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* mbed Microcontroller Library\n * Copyright (c) 2017 ARM Limited\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"mbed_poll.h\"\n#include \"FileHandle.h\"\n#if MBED_CONF_RTOS_PRESENT\n#include \"rtos\/Kernel.h\"\n#include \"rtos\/Thread.h\"\nusing namespace rtos;\n#else\n#include \"Timer.h\"\n#include \"LowPowerTimer.h\"\n#endif\n\nnamespace mbed {\n\n\/\/ timeout -1 forever, or milliseconds\nint poll(pollfh fhs[], unsigned nfhs, int timeout)\n{\n    \/**\n     * TODO Proper wake-up mechanism.\n     * In order to correctly detect availability of read\/write a FileHandle, we needed\n     * a select or poll mechanisms. We opted for poll as POSIX defines in\n     * http:\/\/pubs.opengroup.org\/onlinepubs\/009695399\/functions\/poll.html Currently,\n     * mbed::poll() just spins and scans filehandles looking for any events we are\n     * interested in. In future, his spinning behaviour will be replaced with\n     * condition variables.\n     *\/\n#if MBED_CONF_RTOS_PRESENT\n    uint64_t start_time = 0;\n    if (timeout > 0) {\n        start_time = Kernel::get_ms_count();\n    }\n#define TIME_ELAPSED() int64_t(Kernel::get_ms_count() - start_time)\n#else\n#if MBED_CONF_PLATFORM_POLL_USE_LOWPOWER_TIMER\n    LowPowerTimer timer;\n#else\n    Timer timer;\n#endif\n    if (timeout > 0) {\n        timer.start();\n    }\n#define TIME_ELAPSED() timer.read_ms()\n#endif \/\/ MBED_CONF_RTOS_PRESENT\n\n    int count = 0;\n    for (;;) {\n        \/* Scan the file handles *\/\n        for (unsigned n = 0; n < nfhs; n++) {\n            FileHandle *fh = fhs[n].fh;\n            short mask = fhs[n].events | POLLERR | POLLHUP | POLLNVAL;\n            if (fh) {\n                fhs[n].revents = fh->poll(mask) & mask;\n            } else {\n                fhs[n].revents = POLLNVAL;\n            }\n            if (fhs[n].revents) {\n                count++;\n            }\n        }\n\n        if (count) {\n            break;\n        }\n\n        \/* Nothing selected - this is where timeout handling would be needed *\/\n        if (timeout == 0 || (timeout > 0 && TIME_ELAPSED() > timeout)) {\n            break;\n        }\n#ifdef MBED_CONF_RTOS_PRESENT\n        \/\/ TODO - proper blocking\n        \/\/ wait for condition variable, wait queue whatever here\n        rtos::Thread::wait(1);\n#endif\n    }\n    return count;\n}\n\n} \/\/ namespace mbed\n<commit_msg>poll: Un-doxygen internal comment<commit_after>\/* mbed Microcontroller Library\n * Copyright (c) 2017 ARM Limited\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"mbed_poll.h\"\n#include \"FileHandle.h\"\n#if MBED_CONF_RTOS_PRESENT\n#include \"rtos\/Kernel.h\"\n#include \"rtos\/Thread.h\"\nusing namespace rtos;\n#else\n#include \"Timer.h\"\n#include \"LowPowerTimer.h\"\n#endif\n\nnamespace mbed {\n\n\/\/ timeout -1 forever, or milliseconds\nint poll(pollfh fhs[], unsigned nfhs, int timeout)\n{\n    \/*\n     * TODO Proper wake-up mechanism.\n     * In order to correctly detect availability of read\/write a FileHandle, we needed\n     * a select or poll mechanisms. We opted for poll as POSIX defines in\n     * http:\/\/pubs.opengroup.org\/onlinepubs\/009695399\/functions\/poll.html Currently,\n     * mbed::poll() just spins and scans filehandles looking for any events we are\n     * interested in. In future, his spinning behaviour will be replaced with\n     * condition variables.\n     *\/\n#if MBED_CONF_RTOS_PRESENT\n    uint64_t start_time = 0;\n    if (timeout > 0) {\n        start_time = Kernel::get_ms_count();\n    }\n#define TIME_ELAPSED() int64_t(Kernel::get_ms_count() - start_time)\n#else\n#if MBED_CONF_PLATFORM_POLL_USE_LOWPOWER_TIMER\n    LowPowerTimer timer;\n#else\n    Timer timer;\n#endif\n    if (timeout > 0) {\n        timer.start();\n    }\n#define TIME_ELAPSED() timer.read_ms()\n#endif \/\/ MBED_CONF_RTOS_PRESENT\n\n    int count = 0;\n    for (;;) {\n        \/* Scan the file handles *\/\n        for (unsigned n = 0; n < nfhs; n++) {\n            FileHandle *fh = fhs[n].fh;\n            short mask = fhs[n].events | POLLERR | POLLHUP | POLLNVAL;\n            if (fh) {\n                fhs[n].revents = fh->poll(mask) & mask;\n            } else {\n                fhs[n].revents = POLLNVAL;\n            }\n            if (fhs[n].revents) {\n                count++;\n            }\n        }\n\n        if (count) {\n            break;\n        }\n\n        \/* Nothing selected - this is where timeout handling would be needed *\/\n        if (timeout == 0 || (timeout > 0 && TIME_ELAPSED() > timeout)) {\n            break;\n        }\n#ifdef MBED_CONF_RTOS_PRESENT\n        \/\/ TODO - proper blocking\n        \/\/ wait for condition variable, wait queue whatever here\n        rtos::Thread::wait(1);\n#endif\n    }\n    return count;\n}\n\n} \/\/ namespace mbed\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 \"assert.hpp\"\n#include \"Variable.hpp\"\n#include \"Type.hpp\"\n\n#include \"mtac\/LiveVariableAnalysisProblem.hpp\"\n#include \"mtac\/Utils.hpp\"\n\nusing namespace eddic;\n\ntypedef mtac::LiveVariableAnalysisProblem::ProblemDomain ProblemDomain;\n\nvoid mtac::LiveVariableAnalysisProblem::Gather(std::shared_ptr<mtac::Function> function){\n   for(auto& block : function->getBasicBlocks()){\n        for(auto& statement : block->statements){\n            \/\/Passing a variable as param by address escape its liveness\n            if(auto* ptr = boost::get<std::shared_ptr<mtac::Param>>(&statement)){\n                auto& param = *ptr;\n\n                if(param->address){\n                    if(mtac::isVariable(param->arg)){\n                        escaped_variables.insert(boost::get<std::shared_ptr<Variable>>(param->arg));\n                    }\n                }\n            } \n            \/\/Taking the address of a variable escape its liveness\n            else if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n                auto& quadruple = *ptr;\n\n                auto type = quadruple->result->type();\n\n                if(quadruple->op == mtac::Operator::ASSIGN && type->is_pointer()){\n                    if(quadruple->arg1 && mtac::isVariable(*quadruple->arg1)){\n                        escaped_variables.insert(boost::get<std::shared_ptr<Variable>>(*quadruple->arg1));\n                    }\n                } else if(quadruple->op == mtac::Operator::ARRAY_ASSIGN && type->is_array() && type->data_type()->is_pointer()){\n                    if(quadruple->arg2 && mtac::isVariable(*quadruple->arg2)){\n                        escaped_variables.insert(boost::get<std::shared_ptr<Variable>>(*quadruple->arg2));\n                    }\n                }\n            }\n        }\n   }\n}\n\nProblemDomain mtac::LiveVariableAnalysisProblem::Init(std::shared_ptr<mtac::Function> \/*function*\/){\n    return default_element();\n}\n\nProblemDomain mtac::LiveVariableAnalysisProblem::meet(ProblemDomain& out, ProblemDomain& in){\n    if(out.top()){\n        return in;\n    } else if(in.top()){\n        return out;\n    }\n\n    typename ProblemDomain::Values values;\n    ProblemDomain result(values);\n\n    for(auto& value : in.values()){\n        result.values().insert(value);\n    }\n    \n    for(auto& value : out.values()){\n        result.values().insert(value);\n    }\n\n    return result;\n}\n\ntemplate<typename Arg, typename Values>\nvoid update(Arg& arg, Values& values){\n    if(mtac::isVariable(arg)){\n        auto var = boost::get<std::shared_ptr<Variable>>(arg);\n        values.insert(var);\n    }\n}\n\ntemplate<typename Arg, typename Values>\nvoid update_optional(Arg& arg, Values& values){\n    if(arg){\n        update(*arg, values);\n    }\n}\n\nProblemDomain mtac::LiveVariableAnalysisProblem::transfer(std::shared_ptr<mtac::BasicBlock>\/* basic_block*\/, mtac::Statement& statement, ProblemDomain& out){\n    auto in = out;\n\n    if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n        auto quadruple = *ptr;\n        \n        if(mtac::erase_result(quadruple->op)){\n            in.values().erase(quadruple->result);\n        }\n\n        update_optional((*ptr)->arg1, in.values());\n        update_optional((*ptr)->arg2, in.values());\n    } else if(auto* ptr = boost::get<std::shared_ptr<mtac::Param>>(&statement)){\n        update((*ptr)->arg, in.values());\n    } else if(auto* ptr = boost::get<std::shared_ptr<mtac::IfFalse>>(&statement)){\n        update((*ptr)->arg1, in.values());\n        update_optional((*ptr)->arg2, in.values());\n    } else if(auto* ptr = boost::get<std::shared_ptr<mtac::If>>(&statement)){\n        update((*ptr)->arg1, in.values());\n        update_optional((*ptr)->arg2, in.values());\n    }\n\n    for(auto& escaped_var : escaped_variables){\n        in.values().insert(escaped_var);\n    }\n\n    return in;\n}\n\nbool mtac::LiveVariableAnalysisProblem::optimize(mtac::Statement& \/*statement*\/, std::shared_ptr<mtac::DataFlowResults<ProblemDomain>>& \/*global_results*\/){\n    \/\/This analysis is only made to gather information, not to optimize anything\n    throw \"Unimplemented\";    \n}\n<commit_msg>Cleanup<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 \"assert.hpp\"\n#include \"Variable.hpp\"\n#include \"Type.hpp\"\n\n#include \"mtac\/LiveVariableAnalysisProblem.hpp\"\n#include \"mtac\/Utils.hpp\"\n\nusing namespace eddic;\n\ntypedef mtac::LiveVariableAnalysisProblem::ProblemDomain ProblemDomain;\n\nvoid mtac::LiveVariableAnalysisProblem::Gather(std::shared_ptr<mtac::Function> function){\n    for(auto& block : function->getBasicBlocks()){\n        for(auto& statement : block->statements){\n            \/\/Passing a variable as param by address escape its liveness\n            if(auto* ptr = boost::get<std::shared_ptr<mtac::Param>>(&statement)){\n                auto& param = *ptr;\n\n                if(param->address){\n                    if(mtac::isVariable(param->arg)){\n                        escaped_variables.insert(boost::get<std::shared_ptr<Variable>>(param->arg));\n                    }\n                }\n            } \n            \/\/Taking the address of a variable escape its liveness\n            else if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n                auto& quadruple = *ptr;\n\n                auto type = quadruple->result->type();\n\n                if(quadruple->op == mtac::Operator::ASSIGN && type->is_pointer()){\n                    if(quadruple->arg1 && mtac::isVariable(*quadruple->arg1)){\n                        escaped_variables.insert(boost::get<std::shared_ptr<Variable>>(*quadruple->arg1));\n                    }\n                } else if(quadruple->op == mtac::Operator::ARRAY_ASSIGN && type->is_array() && type->data_type()->is_pointer()){\n                    if(quadruple->arg2 && mtac::isVariable(*quadruple->arg2)){\n                        escaped_variables.insert(boost::get<std::shared_ptr<Variable>>(*quadruple->arg2));\n                    }\n                }\n            }\n        }\n    }\n}\n\nProblemDomain mtac::LiveVariableAnalysisProblem::Init(std::shared_ptr<mtac::Function> \/*function*\/){\n    return default_element();\n}\n\nProblemDomain mtac::LiveVariableAnalysisProblem::meet(ProblemDomain& out, ProblemDomain& in){\n    if(out.top()){\n        return in;\n    } else if(in.top()){\n        return out;\n    }\n\n    typename ProblemDomain::Values values;\n    ProblemDomain result(values);\n\n    for(auto& value : in.values()){\n        result.values().insert(value);\n    }\n    \n    for(auto& value : out.values()){\n        result.values().insert(value);\n    }\n\n    return result;\n}\n\ntemplate<typename Arg, typename Values>\nvoid update(Arg& arg, Values& values){\n    if(mtac::isVariable(arg)){\n        auto var = boost::get<std::shared_ptr<Variable>>(arg);\n        values.insert(var);\n    }\n}\n\ntemplate<typename Arg, typename Values>\nvoid update_optional(Arg& arg, Values& values){\n    if(arg){\n        update(*arg, values);\n    }\n}\n\nProblemDomain mtac::LiveVariableAnalysisProblem::transfer(std::shared_ptr<mtac::BasicBlock>\/* basic_block*\/, mtac::Statement& statement, ProblemDomain& out){\n    auto in = out;\n\n    if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n        auto quadruple = *ptr;\n        \n        if(mtac::erase_result(quadruple->op)){\n            in.values().erase(quadruple->result);\n        }\n\n        update_optional((*ptr)->arg1, in.values());\n        update_optional((*ptr)->arg2, in.values());\n    } else if(auto* ptr = boost::get<std::shared_ptr<mtac::Param>>(&statement)){\n        update((*ptr)->arg, in.values());\n    } else if(auto* ptr = boost::get<std::shared_ptr<mtac::IfFalse>>(&statement)){\n        update((*ptr)->arg1, in.values());\n        update_optional((*ptr)->arg2, in.values());\n    } else if(auto* ptr = boost::get<std::shared_ptr<mtac::If>>(&statement)){\n        update((*ptr)->arg1, in.values());\n        update_optional((*ptr)->arg2, in.values());\n    }\n\n    for(auto& escaped_var : escaped_variables){\n        in.values().insert(escaped_var);\n    }\n\n    return in;\n}\n\nbool mtac::LiveVariableAnalysisProblem::optimize(mtac::Statement& \/*statement*\/, std::shared_ptr<mtac::DataFlowResults<ProblemDomain>>& \/*global_results*\/){\n    \/\/This analysis is only made to gather information, not to optimize anything\n    throw \"Unimplemented\";    \n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma%# -*- mode: c++; coding: utf-8 -*-\n#pragma%# to be included from binning2.ProductBinning_{variadic,nonvariadic}.h\n#pragma%x\n#ifndef $\"header_name\"\n#define $\"header_name\"\n#pragma%end.i\n#include <mwg\/std\/tuple>\n#include <mwg\/std\/utility>\nnamespace mwg{\nnamespace stat{\n\/\/NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN\n\n  namespace detail{\n    template<std::size_t I>\n    struct ProductBinningImpl{\n      template<typename TT>\n      static int GetBinNumber(const TT& bins){\n        return ProductBinningImpl<I-1>::GetBinNumber(bins)*mwg::stdm::get<I>(bins).size();\n      }\n      template<typename TTB,typename TTV>\n      typename stdm::enable_if<!stdm::is_same<bindex,typename stdm::tuple_element<I,TTV>::type>::value,int>::type\n      static GetBinIndex(const TTB& bins,const TTV& vals){\n        int const ithis=(int)mwg::stdm::get<I>(bins)(mwg::stdm::get<I>(vals));if(ithis<0)return -1;\n        int const irest=ProductBinningImpl<I-1>::GetBinIndex(bins,vals);if(irest<0)return -1;\n        return irest*mwg::stdm::get<I>(bins).size()+ithis;\n      }\n      template<typename TTB,typename TTV>\n      typename stdm::enable_if<stdm::is_same<bindex,typename stdm::tuple_element<I,TTV>::type>::value,int>::type\n      static GetBinIndex(const TTB& bins,const TTV& vals){\n        int const ithis=(int)mwg::stdm::get<I>(vals);if(ithis<0)return -1;\n        int const irest=ProductBinningImpl<I-1>::GetBinIndex(bins,vals);if(irest<0)return -1;\n        return irest*mwg::stdm::get<I>(bins).size()+ithis;\n      }\n      template<typename TT>\n      struct IsBins:mwg::stdm::integral_constant<\n        bool,\n        ProductBinningImpl<I-1>::template IsBins<TT>::value&&binning_concept<typename mwg::stdm::tuple_element<I,TT>::type>::value\n      >{};\n    };\n    template<>\n    struct ProductBinningImpl<0>{\n      template<typename TT>\n      static int GetBinNumber(const TT& bins){\n        return mwg::stdm::get<0>(bins).size();\n      }\n      template<typename TTB,typename TTV>\n      typename stdm::enable_if<!stdm::is_same<bindex,typename stdm::tuple_element<0,TTV>::type>::value,int>::type\n      static GetBinIndex(const TTB& bins,const TTV& vals){\n        return (int)mwg::stdm::get<0>(bins)(mwg::stdm::get<0>(vals));\n      }\n      template<typename TTB,typename TTV>\n      typename stdm::enable_if<stdm::is_same<bindex,typename stdm::tuple_element<0,TTV>::type>::value,int>::type\n      static GetBinIndex(const TTB& bins,const TTV& vals){\n        return (int)mwg::stdm::get<0>(vals);\n      }\n      template<typename TT>\n      struct IsBins:mwg::stdm::integral_constant<bool,binning_concept<typename mwg::stdm::tuple_element<0,TT>::type>::value>{};\n    };\n\n#pragma%if variadic\n    template<typename TT1,typename TT2,bool S>\n    struct is_bindex_pack_impl:stdm::false_type{};\n    template<typename... As,typename... Bs>\n    struct is_bindex_pack_impl<stdx::parameter_pack<As...>,stdx::parameter_pack<Bs...>,true>\n      :stdm::integral_constant<bool,stdx::ice_and<(stdm::is_same<As,bindex>::value||stdm::is_convertible<As,typename Bs::domain_type>::value)...>::value>{};\n\n    template<typename TT1,typename TT2>\n    struct is_bindex_pack:stdm::false_type{};\n    template<typename... As,typename... Bs>\n    struct is_bindex_pack<stdx::parameter_pack<As...>,stdx::parameter_pack<Bs...> >\n      :is_bindex_pack_impl<stdx::parameter_pack<As...>,stdx::parameter_pack<Bs...>,sizeof...(As)==sizeof...(Bs)>{};\n#pragma%else \/* end of if variadic *\/\n    template<typename TT1,typename TT2,bool S=true> struct is_bindex_pack_impl:stdm::false_type{};\n    template<> struct is_bindex_pack_impl<stdx::parameter_pack<>,stdx::parameter_pack<> >:stdm::true_type{};\n#pragma%%[ArN=10]\n#pragma%%x\n    template<\n      $\".for\/K\/0\/ArN\/typename AK\/,\",\n      $\".for\/K\/0\/ArN\/typename BK\/,\"\n      >\n    struct is_bindex_pack_impl<stdx::parameter_pack<$\".for\/K\/0\/ArN\/AK\/,\">,stdx::parameter_pack<$\".for\/K\/0\/ArN\/BK\/,\"> >\n      :stdm::integral_constant<\n      bool,\n      (stdm::is_same<A0,bindex>::value||stdm::is_convertible<A0,typename B0::domain_type>::value)&&is_bindex_pack_impl<\n        stdx::parameter_pack<$\".for\/K\/1\/ArN\/AK\/,\">,\n        stdx::parameter_pack<$\".for\/K\/1\/ArN\/BK\/,\">\n        >::value\n      >{};\n#pragma%%end.i\n\n    template<typename TT1,typename TT2>\n    struct is_bindex_pack\n      :is_bindex_pack_impl<TT1,TT2,TT1::size==TT2::size>\n    {};\n#pragma%end \/* end of if !variadic *\/\n  }\n\n#pragma%if variadic\n  template<typename... TBs>\n  class product_binning{\n    mwg::stdm::tuple<TBs...> data;\n  public:\n    typedef mwg::stdm::tuple<typename TBs::domain_type...> domain_type;\n    product_binning(){}\n    template<typename... UBs>\n    product_binning(UBs mwg_forward_rvalue ... args)\n      :data(mwg::stdm::forward<UBs>(args)...){}\n    product_binning(const product_binning& other)\n      :data(other.data){}\n# if defined(MWGCONF_STD_RVALUE_REFERENCES)\n    product_binning(product_binning&& other)\n      :data(mwg::stdm::move(other.data)){}\n# endif\n  public:\n    std::size_t size() const{\n      return detail::ProductBinningImpl<sizeof...(TBs)-1>::GetBinNumber(data);\n    }\n    bindex operator()(const domain_type& value) const{\n      return (bindex)detail::ProductBinningImpl<sizeof...(TBs)-1>::GetBinIndex(data,value);\n    }\n    template<typename... Vs>\n    typename stdm::enable_if<detail::is_bindex_pack<stdx::parameter_pack<Vs...>,stdx::parameter_pack<TBs...> >::value,bindex>::type\n    operator()(Vs const&... args) const{\n      return (bindex)detail::ProductBinningImpl<sizeof...(TBs)-1>::GetBinIndex(data,stdm::make_tuple(args...));\n    }\n  };\n\n  template<typename... TBs> typename stdm::enable_if<\n    detail::ProductBinningImpl<sizeof...(TBs)-1>::template IsBins<stdm::tuple<typename stdm::decay<TBs>::type...>>::value,\n    product_binning<typename stdm::decay<TBs>::type...>\n  >::type make_binning(TBs mwg_forward_rvalue... bins){\n    return product_binning<typename stdm::decay<TBs>::type...>(mwg::stdm::forward<TBs>(bins)...);\n  }\n#pragma%else \/* end of if variadic *\/\n  namespace detail{\n    template<typename B>\n    struct binning_get_domain_type:mwg::identity<typename B::domain_type>{};\n    template<>\n    struct binning_get_domain_type<void>:mwg::identity<void>{};\n  }\n\n#pragma%%x\n  template<$\".for\/K\/0\/ArN\/typename TBK=void\/,\">\n  class product_binning{\n    typedef mwg::stdm::tuple<$\".for\/K\/0\/ArN\/TBK\/,\"> bins_type;\n    bins_type data;\n  public:\n    typedef mwg::stdm::tuple<$\".for\/K\/0\/ArN\/\n      typename detail::binning_get_domain_type<TBK>::type\/,\"\n    > domain_type;\n\n    product_binning(){}\n#pragma%%x\n    template<$\".for\/K\/0\/_AR_\/typename UBK\/,\">\n    product_binning($\".for\/K\/0\/_AR_\/UBK mwg_forward_rvalue argK\/,\")\n      :data($\".for\/K\/0\/_AR_\/mwg::stdm::forward<UBK>(argK)\/,\"){}\n#pragma%%end.f\/_AR_\/1\/ArN+1\/\n    product_binning(const product_binning& other)\n      :data(other.data)\n    {}\n# if defined(MWGCONF_STD_RVALUE_REFERENCES)\n    product_binning(product_binning&& other)\n      :data(mwg::stdm::move(other.data))\n    {}\n# endif\n  public:\n    std::size_t size() const{\n      return detail::ProductBinningImpl<stdm::tuple_size<bins_type>::value-1>::GetBinNumber(data);\n    }\n    bindex operator()(const domain_type& value) const{\n      return (bindex)detail::ProductBinningImpl<stdm::tuple_size<bins_type>::value-1>::GetBinIndex(data,value);\n    }\n#pragma%%x\n    template<$\".for\/K\/0\/_AR_\/typename VK\/,\">\n    typename stdm::enable_if<detail::is_bindex_pack<stdx::parameter_pack<$\".for\/K\/0\/_AR_\/VK\/,\">,stdx::parameter_pack<$\".for\/K\/0\/ArN\/TBK\/,\"> >::value,bindex>::type\n    operator()($\".for\/K\/0\/_AR_\/VK const& argK\/,\") const{\n      return (bindex)detail::ProductBinningImpl<stdm::tuple_size<bins_type>::value-1>::GetBinIndex(data,stdm::make_tuple($\".for\/K\/0\/_AR_\/argK\/,\"));\n    }\n#pragma%%end.f\/_AR_\/1\/ArN+1\/\n  };\n#pragma%%end.i\n\n#pragma%%x\n  template<$\".for\/K\/0\/_AR_\/typename BK\/,\"> typename mwg::stdm::enable_if<\n    ($\".for\/K\/0\/_AR_\/binning_concept<BK>::value\/&&\"),\n    product_binning<$\".for\/K\/0\/_AR_\/BK\/,\">\n  >::type make_binning($\".for\/K\/0\/_AR_\/const BK& bK\/,\"){\n    return product_binning<$\".for\/K\/0\/_AR_\/BK\/,\">($\".for\/K\/0\/_AR_\/bK\/,\");\n  }\n#pragma%%end.f\/_AR_\/2\/ArN+1\/.i\n#pragma%end \/* end of if !variadic *\/\n\n\/\/NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN\n}\n}\n#endif\n<commit_msg>stat (mwg::stat::product_binning): add copy assignment operator<commit_after>#pragma%# -*- mode: c++; coding: utf-8 -*-\n#pragma%# to be included from binning2.ProductBinning_{variadic,nonvariadic}.h\n#pragma%x\n#ifndef $\"header_name\"\n#define $\"header_name\"\n#pragma%end.i\n#include <mwg\/std\/tuple>\n#include <mwg\/std\/utility>\nnamespace mwg{\nnamespace stat{\n\/\/NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN\n\n  namespace detail{\n    template<std::size_t I>\n    struct ProductBinningImpl{\n      template<typename TT>\n      static int GetBinNumber(const TT& bins){\n        return ProductBinningImpl<I-1>::GetBinNumber(bins)*mwg::stdm::get<I>(bins).size();\n      }\n      template<typename TTB,typename TTV>\n      typename stdm::enable_if<!stdm::is_same<bindex,typename stdm::tuple_element<I,TTV>::type>::value,int>::type\n      static GetBinIndex(const TTB& bins,const TTV& vals){\n        int const ithis=(int)mwg::stdm::get<I>(bins)(mwg::stdm::get<I>(vals));if(ithis<0)return -1;\n        int const irest=ProductBinningImpl<I-1>::GetBinIndex(bins,vals);if(irest<0)return -1;\n        return irest*mwg::stdm::get<I>(bins).size()+ithis;\n      }\n      template<typename TTB,typename TTV>\n      typename stdm::enable_if<stdm::is_same<bindex,typename stdm::tuple_element<I,TTV>::type>::value,int>::type\n      static GetBinIndex(const TTB& bins,const TTV& vals){\n        int const ithis=(int)mwg::stdm::get<I>(vals);if(ithis<0)return -1;\n        int const irest=ProductBinningImpl<I-1>::GetBinIndex(bins,vals);if(irest<0)return -1;\n        return irest*mwg::stdm::get<I>(bins).size()+ithis;\n      }\n      template<typename TT>\n      struct IsBins:mwg::stdm::integral_constant<\n        bool,\n        ProductBinningImpl<I-1>::template IsBins<TT>::value&&binning_concept<typename mwg::stdm::tuple_element<I,TT>::type>::value\n      >{};\n    };\n    template<>\n    struct ProductBinningImpl<0>{\n      template<typename TT>\n      static int GetBinNumber(const TT& bins){\n        return mwg::stdm::get<0>(bins).size();\n      }\n      template<typename TTB,typename TTV>\n      typename stdm::enable_if<!stdm::is_same<bindex,typename stdm::tuple_element<0,TTV>::type>::value,int>::type\n      static GetBinIndex(const TTB& bins,const TTV& vals){\n        return (int)mwg::stdm::get<0>(bins)(mwg::stdm::get<0>(vals));\n      }\n      template<typename TTB,typename TTV>\n      typename stdm::enable_if<stdm::is_same<bindex,typename stdm::tuple_element<0,TTV>::type>::value,int>::type\n      static GetBinIndex(const TTB& bins,const TTV& vals){\n        return (int)mwg::stdm::get<0>(vals);\n      }\n      template<typename TT>\n      struct IsBins:mwg::stdm::integral_constant<bool,binning_concept<typename mwg::stdm::tuple_element<0,TT>::type>::value>{};\n    };\n\n#pragma%if variadic\n    template<typename TT1,typename TT2,bool S>\n    struct is_bindex_pack_impl:stdm::false_type{};\n    template<typename... As,typename... Bs>\n    struct is_bindex_pack_impl<stdx::parameter_pack<As...>,stdx::parameter_pack<Bs...>,true>\n      :stdm::integral_constant<bool,stdx::ice_and<(stdm::is_same<As,bindex>::value||stdm::is_convertible<As,typename Bs::domain_type>::value)...>::value>{};\n\n    template<typename TT1,typename TT2>\n    struct is_bindex_pack:stdm::false_type{};\n    template<typename... As,typename... Bs>\n    struct is_bindex_pack<stdx::parameter_pack<As...>,stdx::parameter_pack<Bs...> >\n      :is_bindex_pack_impl<stdx::parameter_pack<As...>,stdx::parameter_pack<Bs...>,sizeof...(As)==sizeof...(Bs)>{};\n#pragma%else \/* end of if variadic *\/\n    template<typename TT1,typename TT2,bool S=true> struct is_bindex_pack_impl:stdm::false_type{};\n    template<> struct is_bindex_pack_impl<stdx::parameter_pack<>,stdx::parameter_pack<> >:stdm::true_type{};\n#pragma%%[ArN=10]\n#pragma%%x\n    template<\n      $\".for\/K\/0\/ArN\/typename AK\/,\",\n      $\".for\/K\/0\/ArN\/typename BK\/,\"\n      >\n    struct is_bindex_pack_impl<stdx::parameter_pack<$\".for\/K\/0\/ArN\/AK\/,\">,stdx::parameter_pack<$\".for\/K\/0\/ArN\/BK\/,\"> >\n      :stdm::integral_constant<\n      bool,\n      (stdm::is_same<A0,bindex>::value||stdm::is_convertible<A0,typename B0::domain_type>::value)&&is_bindex_pack_impl<\n        stdx::parameter_pack<$\".for\/K\/1\/ArN\/AK\/,\">,\n        stdx::parameter_pack<$\".for\/K\/1\/ArN\/BK\/,\">\n        >::value\n      >{};\n#pragma%%end.i\n\n    template<typename TT1,typename TT2>\n    struct is_bindex_pack\n      :is_bindex_pack_impl<TT1,TT2,TT1::size==TT2::size>\n    {};\n#pragma%end \/* end of if !variadic *\/\n  }\n\n#pragma%if variadic\n  template<typename... TBs>\n  class product_binning{\n    mwg::stdm::tuple<TBs...> data;\n  public:\n    typedef mwg::stdm::tuple<typename TBs::domain_type...> domain_type;\n    product_binning(){}\n    template<typename... UBs>\n    product_binning(UBs mwg_forward_rvalue ... args)\n      :data(mwg::stdm::forward<UBs>(args)...){}\n    product_binning(const product_binning& other)\n      :data(other.data){}\n# if defined(MWGCONF_STD_RVALUE_REFERENCES)\n    product_binning(product_binning&& other)\n      :data(mwg::stdm::move(other.data)){}\n# endif\n\n  public:\n    product_binning& operator=(const product_binning& rhs)\n#ifdef MWGCONF_STD_DEFAULTED_FUNCTIONS\n    = default;\n#else\n    {this->data = rhs.data;}\n#endif\n\n  public:\n    std::size_t size() const{\n      return detail::ProductBinningImpl<sizeof...(TBs)-1>::GetBinNumber(data);\n    }\n    bindex operator()(const domain_type& value) const{\n      return (bindex)detail::ProductBinningImpl<sizeof...(TBs)-1>::GetBinIndex(data,value);\n    }\n    template<typename... Vs>\n    typename stdm::enable_if<detail::is_bindex_pack<stdx::parameter_pack<Vs...>,stdx::parameter_pack<TBs...> >::value,bindex>::type\n    operator()(Vs const&... args) const{\n      return (bindex)detail::ProductBinningImpl<sizeof...(TBs)-1>::GetBinIndex(data,stdm::make_tuple(args...));\n    }\n  };\n\n  template<typename... TBs> typename stdm::enable_if<\n    detail::ProductBinningImpl<sizeof...(TBs)-1>::template IsBins<stdm::tuple<typename stdm::decay<TBs>::type...>>::value,\n    product_binning<typename stdm::decay<TBs>::type...>\n  >::type make_binning(TBs mwg_forward_rvalue... bins){\n    return product_binning<typename stdm::decay<TBs>::type...>(mwg::stdm::forward<TBs>(bins)...);\n  }\n#pragma%else \/* end of if variadic *\/\n  namespace detail{\n    template<typename B>\n    struct binning_get_domain_type:mwg::identity<typename B::domain_type>{};\n    template<>\n    struct binning_get_domain_type<void>:mwg::identity<void>{};\n  }\n\n#pragma%%x\n  template<$\".for\/K\/0\/ArN\/typename TBK=void\/,\">\n  class product_binning{\n    typedef mwg::stdm::tuple<$\".for\/K\/0\/ArN\/TBK\/,\"> bins_type;\n    bins_type data;\n  public:\n    typedef mwg::stdm::tuple<$\".for\/K\/0\/ArN\/\n      typename detail::binning_get_domain_type<TBK>::type\/,\"\n    > domain_type;\n\n    product_binning(){}\n#pragma%%x\n    template<$\".for\/K\/0\/_AR_\/typename UBK\/,\">\n    product_binning($\".for\/K\/0\/_AR_\/UBK mwg_forward_rvalue argK\/,\")\n      :data($\".for\/K\/0\/_AR_\/mwg::stdm::forward<UBK>(argK)\/,\"){}\n#pragma%%end.f\/_AR_\/1\/ArN+1\/\n    product_binning(const product_binning& other)\n      :data(other.data)\n    {}\n# if defined(MWGCONF_STD_RVALUE_REFERENCES)\n    product_binning(product_binning&& other)\n      :data(mwg::stdm::move(other.data))\n    {}\n# endif\n  public:\n    std::size_t size() const{\n      return detail::ProductBinningImpl<stdm::tuple_size<bins_type>::value-1>::GetBinNumber(data);\n    }\n    bindex operator()(const domain_type& value) const{\n      return (bindex)detail::ProductBinningImpl<stdm::tuple_size<bins_type>::value-1>::GetBinIndex(data,value);\n    }\n#pragma%%x\n    template<$\".for\/K\/0\/_AR_\/typename VK\/,\">\n    typename stdm::enable_if<detail::is_bindex_pack<stdx::parameter_pack<$\".for\/K\/0\/_AR_\/VK\/,\">,stdx::parameter_pack<$\".for\/K\/0\/ArN\/TBK\/,\"> >::value,bindex>::type\n    operator()($\".for\/K\/0\/_AR_\/VK const& argK\/,\") const{\n      return (bindex)detail::ProductBinningImpl<stdm::tuple_size<bins_type>::value-1>::GetBinIndex(data,stdm::make_tuple($\".for\/K\/0\/_AR_\/argK\/,\"));\n    }\n#pragma%%end.f\/_AR_\/1\/ArN+1\/\n  };\n#pragma%%end.i\n\n#pragma%%x\n  template<$\".for\/K\/0\/_AR_\/typename BK\/,\"> typename mwg::stdm::enable_if<\n    ($\".for\/K\/0\/_AR_\/binning_concept<BK>::value\/&&\"),\n    product_binning<$\".for\/K\/0\/_AR_\/BK\/,\">\n  >::type make_binning($\".for\/K\/0\/_AR_\/const BK& bK\/,\"){\n    return product_binning<$\".for\/K\/0\/_AR_\/BK\/,\">($\".for\/K\/0\/_AR_\/bK\/,\");\n  }\n#pragma%%end.f\/_AR_\/2\/ArN+1\/.i\n#pragma%end \/* end of if !variadic *\/\n\n\/\/NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN\n}\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 2000-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 \"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\n#if !defined(ICUBRIDGE_COLLATIONCOMPAREFUNCTORIMPL_GUARD_1357924680)\n#define ICUBRIDGE_COLLATIONCOMPAREFUNCTORIMPL_GUARD_1357924680\n\n\n\n#include <ICUBridge\/ICUBridgeDefinitions.hpp>\n\n\n\n#include <list>\n\n\n\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n\n\n\n#include <unicode\/coll.h>\n\n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\nclass XALAN_ICUBRIDGE_EXPORT ICUBridgeCollationCompareFunctorImpl : public StylesheetExecutionContextDefault::CollationCompareFunctor\n{\npublic:\n\n\ttypedef StylesheetExecutionContextDefault::eCaseOrder\teCaseOrder;\n\n\n\t\/**\n\t * Constructor.\n\t * \n\t * @param fCacheCollators If true, the instance will cache collators.  This is not thread-safe, so each thread must have its own instance.\n\t *\/\n\tICUBridgeCollationCompareFunctorImpl(bool\tfCacheCollators = false);\n\n\t~ICUBridgeCollationCompareFunctorImpl();\n\n\tint\n\toperator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder = StylesheetExecutionContextDefault::eDefault) const;\n\n\tint\n\toperator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\tconst XalanDOMChar*\t\ttheLocale,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder = StylesheetExecutionContextDefault::eDefault) const;\n\n\tbool\n\tisValid() const\n\t{\n\t\treturn m_isValid;\n\t}\n\n#if defined(XALAN_HAS_CPP_NAMESPACE)\n\ttypedef U_ICU_NAMESPACE::Collator\tCollatorType;\n#else\n\ttypedef Collator\t\t\t\t\tCollatorType;\n#endif\n\n\tstruct CollationCacheStruct\n\t{\n\t\tCollationCacheStruct(\n\t\t\t\tconst XalanDOMString&\ttheLocale,\n\t\t\t\tCollatorType*\t\t\ttheCollator) :\n\t\t\tm_locale(theLocale),\n\t\t\tm_collator(theCollator)\n\t\t{\n\t\t}\n\n\t\tCollationCacheStruct() :\n\t\t\tm_locale(),\n\t\t\tm_collator(0)\n\t\t{\n\t\t}\n\n\t\tvoid\n\t\tswap(CollationCacheStruct&\ttheOther)\n\t\t{\n\t\t\tm_locale.swap(theOther.m_locale);\n\n\t\t\tCollatorType* const\t\ttheTemp = m_collator;\n\n\t\t\tm_collator = theOther.m_collator;\n\n\t\t\ttheOther.m_collator = theTemp;\n\t\t}\n\n\t\tXalanDOMString\tm_locale;\n\n\t\tCollatorType*\tm_collator;\n\n\t\tstruct CollatorDeleteFunctor\n\t\t{\n\t\t\tvoid\n\t\t\toperator()(CollationCacheStruct&\ttheStruct) const\n\t\t\t{\n\t\t\t\tdelete theStruct.m_collator;\n\t\t\t}\n\t\t};\n\n\t\tstruct CollatorFindFunctor\n\t\t{\n\t\t\tCollatorFindFunctor(const XalanDOMChar*\ttheLocale) :\n\t\t\t\tm_locale(theLocale)\n\t\t\t{\n\t\t\t}\n\n\t\t\tbool\n\t\t\toperator()(CollationCacheStruct&\ttheStruct) const\n\t\t\t{\n\t\t\t\treturn XalanDOMString::equals(theStruct.m_locale ,m_locale);\n\t\t\t}\n\n\t\t\tconst XalanDOMChar* const\tm_locale;\n\t\t};\n\t};\n\n#if defined(XALAN_NO_STD_NAMESPACE)\n\ttypedef list<CollationCacheStruct>\t\t\tCollatorCacheListType;\n#else\n\ttypedef std::list<CollationCacheStruct>\t\tCollatorCacheListType;\n#endif\n\n\tenum { eCacheMax = 10 };\n\nprivate:\n\n\tint\n\tdoDefaultCompare(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS) const;\n\n\tint\n\tdoCompare(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\tconst XalanDOMChar*\t\ttheLocale,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder) const;\n\n\tint\n\tdoCompareCached(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\tconst XalanDOMChar*\t\ttheLocale,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder) const;\n\n\tint\n\tdoCompare(\n\t\t\tconst CollatorType&\t\ttheCollator,\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS) const;\n\n\tint\n\tdoCompare(\n\t\t\tCollatorType&\t\t\ttheCollator,\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder) const;\n\n\tCollatorType*\n\tgetCachedCollator(const XalanDOMChar*\ttheLocale) const;\n\n\tvoid\n\tcacheCollator(\n\t\t\tCollatorType*\t\t\ttheCollator,\n\t\t\tconst XalanDOMChar*\t\ttheLocale) const;\n\n\n\t\/\/ Data members...\n\tbool\t\t\t\t\t\t\tm_isValid;\n\n\tCollatorType*\t\t\t\t\tm_defaultCollator;\n\n\tXalanDOMString\t\t\t\t\tm_defaultCollatorLocaleName;\n\n\tbool\t\t\t\t\t\t\tm_cacheCollators;\n\n\tmutable CollatorCacheListType\tm_collatorCache;\n\n\tconst static StylesheetExecutionContextDefault::DefaultCollationCompareFunctor\ts_defaultFunctor;\n};\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif\t\/\/ ICUBRIDGE_COLLATIONCOMPAREFUNCTORIMPL_GUARD_1357924680\n<commit_msg>Added operators for brain-dead compilers.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 2000-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 \"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\n#if !defined(ICUBRIDGE_COLLATIONCOMPAREFUNCTORIMPL_GUARD_1357924680)\n#define ICUBRIDGE_COLLATIONCOMPAREFUNCTORIMPL_GUARD_1357924680\n\n\n\n#include <ICUBridge\/ICUBridgeDefinitions.hpp>\n\n\n\n#include <list>\n\n\n\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n\n\n\n#include <unicode\/coll.h>\n\n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\nclass XALAN_ICUBRIDGE_EXPORT ICUBridgeCollationCompareFunctorImpl : public StylesheetExecutionContextDefault::CollationCompareFunctor\n{\npublic:\n\n\ttypedef StylesheetExecutionContextDefault::eCaseOrder\teCaseOrder;\n\n\n\t\/**\n\t * Constructor.\n\t * \n\t * @param fCacheCollators If true, the instance will cache collators.  This is not thread-safe, so each thread must have its own instance.\n\t *\/\n\tICUBridgeCollationCompareFunctorImpl(bool\tfCacheCollators = false);\n\n\t~ICUBridgeCollationCompareFunctorImpl();\n\n\tint\n\toperator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder = StylesheetExecutionContextDefault::eDefault) const;\n\n\tint\n\toperator()(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\tconst XalanDOMChar*\t\ttheLocale,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder = StylesheetExecutionContextDefault::eDefault) const;\n\n\tbool\n\tisValid() const\n\t{\n\t\treturn m_isValid;\n\t}\n\n#if defined(XALAN_HAS_CPP_NAMESPACE)\n\ttypedef U_ICU_NAMESPACE::Collator\tCollatorType;\n#else\n\ttypedef Collator\t\t\t\t\tCollatorType;\n#endif\n\n\tstruct CollationCacheStruct\n\t{\n\t\tCollationCacheStruct(\n\t\t\t\tconst XalanDOMString&\ttheLocale,\n\t\t\t\tCollatorType*\t\t\ttheCollator) :\n\t\t\tm_locale(theLocale),\n\t\t\tm_collator(theCollator)\n\t\t{\n\t\t}\n\n\t\tCollationCacheStruct() :\n\t\t\tm_locale(),\n\t\t\tm_collator(0)\n\t\t{\n\t\t}\n\n\t\tvoid\n\t\tswap(CollationCacheStruct&\ttheOther)\n\t\t{\n\t\t\tm_locale.swap(theOther.m_locale);\n\n\t\t\tCollatorType* const\t\ttheTemp = m_collator;\n\n\t\t\tm_collator = theOther.m_collator;\n\n\t\t\ttheOther.m_collator = theTemp;\n\t\t}\n\n#if defined(XALAN_NO_SELECTIVE_TEMPLATE_INSTANTIATION)\n\t\tbool\n\t\toperator<(const CollationCacheStruct&  theRHS) const\n\t\t{\n\t\t\treturn this < &theRHS;\n\t\t}\n\n\t\tbool\n\t\toperator==(const CollationCacheStruct&\ttheRHS) const\n\t\t{\n\t\t\treturn this == &theRHS;\n\t\t}\n#endif\n\n\t\tXalanDOMString\tm_locale;\n\n\t\tCollatorType*\tm_collator;\n\n\t\tstruct CollatorDeleteFunctor\n\t\t{\n\t\t\tvoid\n\t\t\toperator()(CollationCacheStruct&\ttheStruct) const\n\t\t\t{\n\t\t\t\tdelete theStruct.m_collator;\n\t\t\t}\n\t\t};\n\n\t\tstruct CollatorFindFunctor\n\t\t{\n\t\t\tCollatorFindFunctor(const XalanDOMChar*\ttheLocale) :\n\t\t\t\tm_locale(theLocale)\n\t\t\t{\n\t\t\t}\n\n\t\t\tbool\n\t\t\toperator()(CollationCacheStruct&\ttheStruct) const\n\t\t\t{\n\t\t\t\treturn XalanDOMString::equals(theStruct.m_locale ,m_locale);\n\t\t\t}\n\n\t\t\tconst XalanDOMChar* const\tm_locale;\n\t\t};\n\t};\n\n#if defined(XALAN_NO_STD_NAMESPACE)\n\ttypedef list<CollationCacheStruct>\t\t\tCollatorCacheListType;\n#else\n\ttypedef std::list<CollationCacheStruct>\t\tCollatorCacheListType;\n#endif\n\n\tenum { eCacheMax = 10 };\n\nprivate:\n\n\tint\n\tdoDefaultCompare(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS) const;\n\n\tint\n\tdoCompare(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\tconst XalanDOMChar*\t\ttheLocale,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder) const;\n\n\tint\n\tdoCompareCached(\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\tconst XalanDOMChar*\t\ttheLocale,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder) const;\n\n\tint\n\tdoCompare(\n\t\t\tconst CollatorType&\t\ttheCollator,\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS) const;\n\n\tint\n\tdoCompare(\n\t\t\tCollatorType&\t\t\ttheCollator,\n\t\t\tconst XalanDOMChar*\t\ttheLHS,\n\t\t\tconst XalanDOMChar*\t\ttheRHS,\n\t\t\teCaseOrder\t\t\t\ttheCaseOrder) const;\n\n\tCollatorType*\n\tgetCachedCollator(const XalanDOMChar*\ttheLocale) const;\n\n\tvoid\n\tcacheCollator(\n\t\t\tCollatorType*\t\t\ttheCollator,\n\t\t\tconst XalanDOMChar*\t\ttheLocale) const;\n\n\n\t\/\/ Data members...\n\tbool\t\t\t\t\t\t\tm_isValid;\n\n\tCollatorType*\t\t\t\t\tm_defaultCollator;\n\n\tXalanDOMString\t\t\t\t\tm_defaultCollatorLocaleName;\n\n\tbool\t\t\t\t\t\t\tm_cacheCollators;\n\n\tmutable CollatorCacheListType\tm_collatorCache;\n\n\tconst static StylesheetExecutionContextDefault::DefaultCollationCompareFunctor\ts_defaultFunctor;\n};\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif\t\/\/ ICUBRIDGE_COLLATIONCOMPAREFUNCTORIMPL_GUARD_1357924680\n<|endoftext|>"}
{"text":"<commit_before>#include \"ros\/ros.h\"\n#include \"std_msgs\/String.h\"\n#include <geometry_msgs\/Twist.h>\n#include <nav_msgs\/Odometry.h>\n#include <sensor_msgs\/LaserScan.h>\n#include \"EventTriggerConstants.h\"\n#include \"PerformTaskConstants.h\"\n#include \"elderly_care_simulation\/PerformTask.h\"\n\n#include <sstream>\n#include \"math.h\"\n\n#include \"DiceRollerTypeConstants.h\"\n#include \"elderly_care_simulation\/DiceRollTrigger.h\"\n#include \"EventTriggerConstants.h\"\n#include \"elderly_care_simulation\/EventTrigger.h\"\n#include <unistd.h> \/\/ sleep\n\n\/\/ Velocity\ndouble linearX;\ndouble angularZ;\n\n\/\/ Pose\nconst double WORLD_POS_X = 0;\nconst double WORLD_POS_Y = 0;\ndouble px;\ndouble py;\ndouble theta;\n\n\/\/ Current task type: -1 corresponds to no task\nint currentTaskType = -1;\n\n\/\/ Basic health attributes\nconst int HEALTHY_THRESHOLD = 50;\nint happiness = 0;\nint amusement = 0;\n\n\/\/ Signatures\nros::Publisher robotNodeStagePub;\nros::Subscriber stageOdoSub;\nros::Subscriber diceTriggerSub;\nros::Publisher residentEventPub;\n\n\/\/ Locations to visit\nstd::queue<geometry_msgs::Point> locationQueue;\n\nvoid stageOdomCallback(nav_msgs::Odometry msg);\nvoid diceTriggerCallback();\n\nvoid taskGetPerformed(const std_msgs::Empty){\n\tgeometry_msgs::Point locationOne;\n    locationOne.x = 0;\n    locationOne.y = -2;\n\n    geometry_msgs::Point locationTwo;\n    locationTwo.x = 0;\n    locationTwo.y = 2;\n\n    geometry_msgs::Point locationThree;\n    locationThree.x = 0;\n    locationThree.y = 0;\n\n    locationQueue.push(locationOne);\n    locationQueue.push(locationTwo);\n    locationQueue.push(locationThree);\n}\n\n\/**\n    Process odometry messages from Stage\n*\/\nvoid stageOdomCallback(nav_msgs::Odometry msg) {\n\t\n\tpx = WORLD_POS_X + msg.pose.pose.position.x;\n\tpy = WORLD_POS_Y + msg.pose.pose.position.y;\n\t\/\/ ROS_INFO(\"Current x position is: %f\", px);\n\t\/\/ ROS_INFO(\"Current y position is: %f\", py);\n}\n\nvoid diceTriggerCallback(elderly_care_simulation::DiceRollTrigger msg) {\n    elderly_care_simulation::EventTrigger msgOut;\n    msgOut.msg_type = EVENT_TRIGGER_MSG_TYPE_REQUEST;\n    msgOut.result = EVENT_TRIGGER_RESULT_FAILURE;\n\n    switch(msg.type) {\n        case MORAL_SUPPORT:\n            ROS_INFO(\"I really need moral support right now ...\");\n            msgOut.event_type = EVENT_TRIGGER_EVENT_TYPE_VISITOR;\n            break;\n        case ENTERTAINMENT:\n\t\t\tROS_INFO(\"I really need some entertainment ...\");\n\t\t\tmsgOut.event_type = EVENT_TRIGGER_EVENT_TYPE_ASSISTANT;\n\t\t\tbreak;\n    }\n\n    ROS_INFO(\"Sending request to scheduler\");\n    residentEventPub.publish(msgOut);\n}\n\n\/**\n * Change the resident's state in response to a task that is being performed\n * by a helper.\n * \n * At this stage, it is assumed for simplicity that the visitor is \n * consoling and the assistant is entertaining. TODO: In a later release\n * there will be many other types of task. \n * \n * @param taskType the type of task that is being performed\n * @return PERFORM_TASK_RESULT_ACCEPTED or PERFORM_TASK_RESULT_FINISHED\n *         (which correspond to 0 and 1 respectively)\n *\/\nint handleTask(int taskType) {\n\tint result;\n\t\n\tswitch (taskType) {\n\t\tcase EVENT_TRIGGER_EVENT_TYPE_VISITOR:\n\t\t\t\/\/ The visitor is consoling us\n\t\t\thappiness += 1;\n\t\t\tif (happiness > HEALTHY_THRESHOLD) {\n\t\t\t\tROS_INFO(\"Happiness raised to %d and I'm now happy as can be!\", happiness);\n\t\t\t\tresult = PERFORM_TASK_RESULT_FINISHED;\n\t\t\t\tcurrentTaskType = NO_CURRENT_TASK;\n\t\t\t} else {\n\t\t\t\tROS_INFO(\"Happiness raised to %d, but I could still do with some more consoling...\", happiness);\n\t\t\t\tresult = PERFORM_TASK_RESULT_ACCEPTED;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase EVENT_TRIGGER_EVENT_TYPE_ASSISTANT:\n\t\t\t\/\/ The assistant is entertaining us\n\t\t\tamusement += 1;\n\t\t\tif (amusement > HEALTHY_THRESHOLD) {\n\t\t\t\tROS_INFO(\"Amusement raised to %d and I've had enough!\", amusement);\n\t\t\t\tresult = PERFORM_TASK_RESULT_FINISHED;\n\t\t\t\tcurrentTaskType = NO_CURRENT_TASK;\n\t\t\t} else {\n\t\t\t\tROS_INFO(\"Amusement raised to %d, keep being funny.\", amusement);\n\t\t\t\tresult = PERFORM_TASK_RESULT_ACCEPTED;\n\t\t\t}\n\t\t    break;\n\t}\n\t\n\treturn result;\n}\n\n\/**\n * Handler for PerformTask.srv service \n * \n * Robots and Visitors use this to perform tasks on the resident.\n * \n * In the request there will be an event type. The resident will check\n * if this corresponds to the type of event they are currently accepting.\n * \n * Based on this the response will contain one of the following codes:\n *   0 - I accepted the task and updated my state\n *   1 - I accepted the task and you can now stop\n *   2 - I am busy at the moment, try again\n *\/\nbool performTaskServiceHandler(elderly_care_simulation::PerformTask::Request &req,\n\t\t\t\t   elderly_care_simulation::PerformTask::Response &res) {\n\t\t\t\t\t   \n\tROS_INFO(\"Received service call with task type: %d\", req.taskType);\n\t\n\tif (currentTaskType == NO_CURRENT_TASK) {\n\t\t\/\/ I don't yet have a task, make this one our current task\n\t\tcurrentTaskType = req.taskType;\n\t}\n\t\n\tif (req.taskType == currentTaskType) {\n\t\t\/\/ We must be dealing with the current helper\n\t\tres.result = handleTask(req.taskType);\n\t} else {\n\t\t\/\/ We are busy with another task\n\t\tres.result = PERFORM_TASK_RESULT_BUSY;\n\t}\n\t\t\n\treturn true;\n}\n\n\/**\n    Process \n*\/\n\nint main(int argc, char **argv) {\n\n    \/\/ ROS initialiser calls\n    ros::init(argc, argv, \"Resident\");\n    ros::NodeHandle nodeHandle;\n    ros::Rate loop_rate(10);\n    \n    \/\/ Initialise pose (must be same as world file)\n\ttheta = M_PI\/2.0;\n\tpx = WORLD_POS_X;\n\tpy = WORLD_POS_Y;\n\t\n\t\/\/ Initialise velocity\n\tlinearX = 0.0;\n\tangularZ = 0.0;\n\t\n    \/\/ Initialise publishers\n    robotNodeStagePub = nodeHandle.advertise<geometry_msgs::Twist>(\"robot_0\/cmd_vel\",1000); \n    residentEventPub = nodeHandle.advertise<elderly_care_simulation::EventTrigger>(\"resident_event\",1000, true);\n\n    \/\/ Initialise subscribers\n    stageOdoSub = nodeHandle.subscribe<nav_msgs::Odometry>(\"robot_0\/odom\", 1000, stageOdomCallback);\n    diceTriggerSub = nodeHandle.subscribe<elderly_care_simulation::DiceRollTrigger>(\"dice_roll_trigger\", 1000, diceTriggerCallback);\n\n    \/\/ Initialise messages\n    geometry_msgs::Twist robotNodeCmdvel;\n    \n    \/\/ Advertise that the Resident responds to PerformTask service calls\n\tros::ServiceServer service = nodeHandle.advertiseService(\"perform_task\", performTaskServiceHandler);\n\n\t\/\/a count of howmany messages we have sent\n\tint count = 0;\n\n\twhile (ros::ok())\n\t{\n\t\t\/\/ Publish to Stage\n\t\trobotNodeCmdvel.linear.x = linearX;\n\t\trobotNodeCmdvel.angular.z = angularZ;\n\t\trobotNodeStagePub.publish(robotNodeCmdvel);\n\t\t\n\t\t\/\/ Every once in a while, decrease health values\n\t\tif (count % 50 == 0) {\n\t\t\t\/\/ Every 5 secs\n\t\t\t\n\t\t\tamusement = (amusement - 15) > 0 ? amusement - 15 : 0;\n\t\t\tROS_INFO(\"Amusement level fell to %d\", amusement);\n\n\t\t\thappiness = (happiness - 10) > 0 ? happiness - 10 : 0;\n\t\t\tROS_INFO(\"Happiness level fell to %d\", happiness);\n\t\t}\n\t\t\n\t\tros::spinOnce();\n\n\t\tloop_rate.sleep();\n\t\t++count;\n\t}\n\n    return 0;\n\n}\n<commit_msg>Modified stageOdomCallback to get the current location and translate Quaternion to roll pitch and yaw<commit_after>#include \"ros\/ros.h\"\n#include \"std_msgs\/String.h\"\n#include <geometry_msgs\/Twist.h>\n#include <nav_msgs\/Odometry.h>\n#include <sensor_msgs\/LaserScan.h>\n#include \"EventTriggerConstants.h\"\n#include \"PerformTaskConstants.h\"\n#include \"elderly_care_simulation\/PerformTask.h\"\n#include <queue>\n#include <tf\/tf.h>\n#include \"std_msgs\/Empty.h\"\n\n#include <sstream>\n#include \"math.h\"\n\n#include \"DiceRollerTypeConstants.h\"\n#include \"elderly_care_simulation\/DiceRollTrigger.h\"\n#include \"EventTriggerConstants.h\"\n#include \"elderly_care_simulation\/EventTrigger.h\"\n#include <unistd.h> \/\/ sleep\n\n\/\/ Current task type: -1 corresponds to no task\nint currentTaskType = -1;\n\n\/\/ Basic health attributes\nconst int HEALTHY_THRESHOLD = 50;\nint happiness = 0;\nint amusement = 0;\n\n\/\/ Signatures\nros::Publisher robotNodeStagePub;\nros::Subscriber stageOdoSub;\nros::Subscriber diceTriggerSub;\nros::Publisher residentEventPub;\nros::Subscriber locationInstructionsSub;\nros::Subscriber pathOfResidentSub;\n\ndouble currentAngle;\n\n\/\/ Current velocity of the Robot\ngeometry_msgs::Twist currentVelocity;\n\n\/\/ Current location of the robot\ngeometry_msgs::Pose currentLocation;\n\n\/\/ Locations to visit\nstd::queue<geometry_msgs::Point> locationQueue;\n\nvoid stageOdomCallback(nav_msgs::Odometry msg);\nvoid diceTriggerCallback();\n\nvoid taskGetPerformed(const std_msgs::Empty){\n\tgeometry_msgs::Point locationOne;\n    locationOne.x = 0;\n    locationOne.y = -2;\n\n    geometry_msgs::Point locationTwo;\n    locationTwo.x = 0;\n    locationTwo.y = 2;\n\n    geometry_msgs::Point locationThree;\n    locationThree.x = 0;\n    locationThree.y = 0;\n\n    locationQueue.push(locationOne);\n    locationQueue.push(locationTwo);\n    locationQueue.push(locationThree);\n}\n\n\/**\n    Process odometry messages from Stage\n*\/\nvoid stageOdomCallback(const nav_msgs::Odometry msg) {\n\t\n\t \/\/Update Current Position\n    currentLocation = msg.pose.pose;\n    double x = currentLocation.orientation.x;\n    double y = currentLocation.orientation.y;\n    double z = currentLocation.orientation.z;\n    double w = currentLocation.orientation.w;\n    ROS_INFO(\"THE LOCATION IS: %f, %f\", currentLocation.position.x, currentLocation.position.y);\n    double roll, pitch, yaw;\n    tf::Matrix3x3(tf::Quaternion(x, y, z, w)).getRPY(roll, pitch, yaw);\n    currentAngle = yaw;\n\n}\n\nvoid diceTriggerCallback(elderly_care_simulation::DiceRollTrigger msg) {\n    elderly_care_simulation::EventTrigger msgOut;\n    msgOut.msg_type = EVENT_TRIGGER_MSG_TYPE_REQUEST;\n    msgOut.result = EVENT_TRIGGER_RESULT_FAILURE;\n\n    switch(msg.type) {\n        case MORAL_SUPPORT:\n            ROS_INFO(\"I really need moral support right now ...\");\n            msgOut.event_type = EVENT_TRIGGER_EVENT_TYPE_VISITOR;\n            break;\n        case ENTERTAINMENT:\n\t\t\tROS_INFO(\"I really need some entertainment ...\");\n\t\t\tmsgOut.event_type = EVENT_TRIGGER_EVENT_TYPE_ASSISTANT;\n\t\t\tbreak;\n    }\n\n    ROS_INFO(\"Sending request to scheduler\");\n    residentEventPub.publish(msgOut);\n}\n\n\/**\n * Change the resident's state in response to a task that is being performed\n * by a helper.\n * \n * At this stage, it is assumed for simplicity that the visitor is \n * consoling and the assistant is entertaining. TODO: In a later release\n * there will be many other types of task. \n * \n * @param taskType the type of task that is being performed\n * @return PERFORM_TASK_RESULT_ACCEPTED or PERFORM_TASK_RESULT_FINISHED\n *         (which correspond to 0 and 1 respectively)\n *\/\nint handleTask(int taskType) {\n\tint result;\n\t\n\tswitch (taskType) {\n\t\tcase EVENT_TRIGGER_EVENT_TYPE_VISITOR:\n\t\t\t\/\/ The visitor is consoling us\n\t\t\thappiness += 1;\n\t\t\tif (happiness > HEALTHY_THRESHOLD) {\n\t\t\t\tROS_INFO(\"Happiness raised to %d and I'm now happy as can be!\", happiness);\n\t\t\t\tresult = PERFORM_TASK_RESULT_FINISHED;\n\t\t\t\tcurrentTaskType = NO_CURRENT_TASK;\n\t\t\t} else {\n\t\t\t\tROS_INFO(\"Happiness raised to %d, but I could still do with some more consoling...\", happiness);\n\t\t\t\tresult = PERFORM_TASK_RESULT_ACCEPTED;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase EVENT_TRIGGER_EVENT_TYPE_ASSISTANT:\n\t\t\t\/\/ The assistant is entertaining us\n\t\t\tamusement += 1;\n\t\t\tif (amusement > HEALTHY_THRESHOLD) {\n\t\t\t\tROS_INFO(\"Amusement raised to %d and I've had enough!\", amusement);\n\t\t\t\tresult = PERFORM_TASK_RESULT_FINISHED;\n\t\t\t\tcurrentTaskType = NO_CURRENT_TASK;\n\t\t\t} else {\n\t\t\t\tROS_INFO(\"Amusement raised to %d, keep being funny.\", amusement);\n\t\t\t\tresult = PERFORM_TASK_RESULT_ACCEPTED;\n\t\t\t}\n\t\t    break;\n\t}\n\t\n\treturn result;\n}\n\n\/**\n * Handler for PerformTask.srv service \n * \n * Robots and Visitors use this to perform tasks on the resident.\n * \n * In the request there will be an event type. The resident will check\n * if this corresponds to the type of event they are currently accepting.\n * \n * Based on this the response will contain one of the following codes:\n *   0 - I accepted the task and updated my state\n *   1 - I accepted the task and you can now stop\n *   2 - I am busy at the moment, try again\n *\/\nbool performTaskServiceHandler(elderly_care_simulation::PerformTask::Request &req,\n\t\t\t\t   elderly_care_simulation::PerformTask::Response &res) {\n\t\t\t\t\t   \n\tROS_INFO(\"Received service call with task type: %d\", req.taskType);\n\t\n\tif (currentTaskType == NO_CURRENT_TASK) {\n\t\t\/\/ I don't yet have a task, make this one our current task\n\t\tcurrentTaskType = req.taskType;\n\t}\n\t\n\tif (req.taskType == currentTaskType) {\n\t\t\/\/ We must be dealing with the current helper\n\t\tres.result = handleTask(req.taskType);\n\t} else {\n\t\t\/\/ We are busy with another task\n\t\tres.result = PERFORM_TASK_RESULT_BUSY;\n\t}\n\t\t\n\treturn true;\n}\n\n\/**\n    Process \n*\/\n\nint main(int argc, char **argv) {\n\n    \/\/ ROS initialiser calls\n    ros::init(argc, argv, \"Resident\");\n    ros::NodeHandle nodeHandle;\n    ros::Rate loop_rate(10);\n    \n    \/\/ Initialise pose (must be same as world file)\n\ttheta = M_PI\/2.0;\n\tpx = WORLD_POS_X;\n\tpy = WORLD_POS_Y;\n\t\n\t\/\/ Initialise velocity\n\tlinearX = 0.0;\n\tangularZ = 0.0;\n\t\n    \/\/ Initialise publishers\n    robotNodeStagePub = nodeHandle.advertise<geometry_msgs::Twist>(\"robot_0\/cmd_vel\",1000); \n    residentEventPub = nodeHandle.advertise<elderly_care_simulation::EventTrigger>(\"resident_event\",1000, true);\n\n    \/\/ Initialise subscribers\n    stageOdoSub = nodeHandle.subscribe<nav_msgs::Odometry>(\"robot_0\/odom\", 1000, stageOdomCallback);\n    diceTriggerSub = nodeHandle.subscribe<elderly_care_simulation::DiceRollTrigger>(\"dice_roll_trigger\", 1000, diceTriggerCallback);\n\n    \/\/ Initialise messages\n    geometry_msgs::Twist robotNodeCmdvel;\n    \n    \/\/ Advertise that the Resident responds to PerformTask service calls\n\tros::ServiceServer service = nodeHandle.advertiseService(\"perform_task\", performTaskServiceHandler);\n\n\t\/\/a count of howmany messages we have sent\n\tint count = 0;\n\n\twhile (ros::ok())\n\t{\n\t\t\/\/ Publish to Stage\n\t\trobotNodeCmdvel.linear.x = linearX;\n\t\trobotNodeCmdvel.angular.z = angularZ;\n\t\trobotNodeStagePub.publish(robotNodeCmdvel);\n\t\t\n\t\t\/\/ Every once in a while, decrease health values\n\t\tif (count % 50 == 0) {\n\t\t\t\/\/ Every 5 secs\n\t\t\t\n\t\t\tamusement = (amusement - 15) > 0 ? amusement - 15 : 0;\n\t\t\tROS_INFO(\"Amusement level fell to %d\", amusement);\n\n\t\t\thappiness = (happiness - 10) > 0 ? happiness - 10 : 0;\n\t\t\tROS_INFO(\"Happiness level fell to %d\", happiness);\n\t\t}\n\t\t\n\t\tros::spinOnce();\n\n\t\tloop_rate.sleep();\n\t\t++count;\n\t}\n\n    return 0;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2013, 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 \"boost\/python.hpp\"\n\n#include \"IECore\/CompoundObject.h\"\n#include \"IECore\/ParameterisedProcedural.h\"\n\n#include \"IECoreHoudini\/FromHoudiniCortexObjectConverter.h\"\n#include \"IECoreHoudini\/GU_CortexPrimitive.h\"\n\nusing namespace IECore;\nusing namespace IECoreHoudini;\n\nIE_CORE_DEFINERUNTIMETYPED( FromHoudiniCortexObjectConverter );\n\nFromHoudiniGeometryConverter::Description<FromHoudiniCortexObjectConverter> FromHoudiniCortexObjectConverter::m_description( ObjectTypeId );\nFromHoudiniGeometryConverter::Description<FromHoudiniCortexObjectConverter> FromHoudiniCortexObjectConverter::m_universalDescription( InvalidTypeId );\n\nFromHoudiniCortexObjectConverter::FromHoudiniCortexObjectConverter( const GU_DetailHandle &handle ) :\n\tFromHoudiniGeometryConverter( handle, \"Converts a Houdini GU_Detail to an IECore::Object.\" )\n{\n}\n\nFromHoudiniCortexObjectConverter::FromHoudiniCortexObjectConverter( const SOP_Node *sop ) :\n\tFromHoudiniGeometryConverter( sop, \"Converts a Houdini GU_Detail to an IECore::Object.\" )\n{\n}\n\nFromHoudiniCortexObjectConverter::~FromHoudiniCortexObjectConverter()\n{\n}\n\nFromHoudiniGeometryConverter::Convertability FromHoudiniCortexObjectConverter::canConvert( const GU_Detail *geo )\n{\n\tsize_t numPrims = geo->getNumPrimitives();\n\tif ( numPrims )\n\t{\n\t\tconst GA_Primitive *prim = geo->getPrimitiveList().get( geo->getPrimitiveRange().begin().getOffset() );\n\t\tif ( prim->getTypeId() == GU_CortexPrimitive::typeId() )\n\t\t{\n\t\t\treturn ( numPrims == 1 ) ? Ideal : Admissible;\n\t\t}\n\t}\n\t\n\treturn Inapplicable;\n}\n\nObjectPtr FromHoudiniCortexObjectConverter::doDetailConversion( const GU_Detail *geo, const CompoundObject *operands ) const\n{\n\tconst GA_Primitive *prim = geo->getPrimitiveList().get( geo->getPrimitiveRange().begin().getOffset() );\n\tif ( prim->getTypeId() != GU_CortexPrimitive::typeId() )\n\t{\n\t\tthrow std::runtime_error( \"FromHoudiniCortexObjectConverter: Geometry does not contain a single CortexObject primitive\" );\n\t}\n\t\n\tConstObjectPtr object = ((GU_CortexPrimitive *)prim)->getObject();\n\tObjectPtr result = filterAttribs( object, operands->member<StringData>( \"attributeFilter\" )->readable().c_str() );\n\t\n\tif ( result )\n\t{\n\t\treturn result;\n\t}\n\t\n\tif ( object )\n\t{\n\t\tif ( object->isInstanceOf( IECore::ParameterisedProcedural::staticTypeId() ) )\n\t\t{\n\t\t\treturn IECore::constPointerCast<IECore::Object>( object );\n\t\t}\n\t\t\n\t\treturn object->copy();\n\t}\n\t\n\treturn 0;\n}\n\nObjectPtr FromHoudiniCortexObjectConverter::filterAttribs( const Object *object, const char *filter ) const\n{\n\tconst Primitive *primitive = IECore::runTimeCast<const Primitive>( object );\n\tif ( !primitive )\n\t{\n\t\treturn 0;\n\t}\n\t\n\tstd::vector<InternedString> variablesToErase;\n\tconst PrimitiveVariableMap &variables = primitive->variables;\n\tfor ( PrimitiveVariableMap::const_iterator it = variables.begin(); it != variables.end(); ++it )\n\t{\n\t\tif ( !UT_String( it->first ).multiMatch( filter ) )\n\t\t{\n\t\t\tvariablesToErase.push_back( it->first );\n\t\t}\n\t}\n\t\n\tif ( variablesToErase.empty() )\n\t{\n\t\treturn 0;\n\t}\n\t\n\tPrimitivePtr result = primitive->copy();\n\tPrimitiveVariableMap &resultVariables = result->variables;\n\tfor ( size_t i = 0; i < variablesToErase.size(); ++i )\n\t{\n\t\tresultVariables.erase( variablesToErase[i] );\n\t}\n\t\n\treturn result;\n}\n<commit_msg>FromHoudiniCortexObjectConverter rejects multiple primitives<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2013, 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 \"boost\/python.hpp\"\n\n#include \"IECore\/CompoundObject.h\"\n#include \"IECore\/ParameterisedProcedural.h\"\n\n#include \"IECoreHoudini\/FromHoudiniCortexObjectConverter.h\"\n#include \"IECoreHoudini\/GU_CortexPrimitive.h\"\n\nusing namespace IECore;\nusing namespace IECoreHoudini;\n\nIE_CORE_DEFINERUNTIMETYPED( FromHoudiniCortexObjectConverter );\n\nFromHoudiniGeometryConverter::Description<FromHoudiniCortexObjectConverter> FromHoudiniCortexObjectConverter::m_description( ObjectTypeId );\nFromHoudiniGeometryConverter::Description<FromHoudiniCortexObjectConverter> FromHoudiniCortexObjectConverter::m_universalDescription( InvalidTypeId );\n\nFromHoudiniCortexObjectConverter::FromHoudiniCortexObjectConverter( const GU_DetailHandle &handle ) :\n\tFromHoudiniGeometryConverter( handle, \"Converts a Houdini GU_Detail to an IECore::Object.\" )\n{\n}\n\nFromHoudiniCortexObjectConverter::FromHoudiniCortexObjectConverter( const SOP_Node *sop ) :\n\tFromHoudiniGeometryConverter( sop, \"Converts a Houdini GU_Detail to an IECore::Object.\" )\n{\n}\n\nFromHoudiniCortexObjectConverter::~FromHoudiniCortexObjectConverter()\n{\n}\n\nFromHoudiniGeometryConverter::Convertability FromHoudiniCortexObjectConverter::canConvert( const GU_Detail *geo )\n{\n\tsize_t numPrims = geo->getNumPrimitives();\n\tif ( numPrims == 1 )\n\t{\n\t\tconst GA_Primitive *prim = geo->getPrimitiveList().get( geo->getPrimitiveRange().begin().getOffset() );\n\t\tif ( prim->getTypeId() == GU_CortexPrimitive::typeId() )\n\t\t{\n\t\t\treturn Ideal;\n\t\t}\n\t}\n\t\n\treturn Inapplicable;\n}\n\nObjectPtr FromHoudiniCortexObjectConverter::doDetailConversion( const GU_Detail *geo, const CompoundObject *operands ) const\n{\n\tconst GA_Primitive *prim = geo->getPrimitiveList().get( geo->getPrimitiveRange().begin().getOffset() );\n\tif ( prim->getTypeId() != GU_CortexPrimitive::typeId() )\n\t{\n\t\tthrow std::runtime_error( \"FromHoudiniCortexObjectConverter: Geometry does not contain a single CortexObject primitive\" );\n\t}\n\t\n\tConstObjectPtr object = ((GU_CortexPrimitive *)prim)->getObject();\n\tObjectPtr result = filterAttribs( object, operands->member<StringData>( \"attributeFilter\" )->readable().c_str() );\n\t\n\tif ( result )\n\t{\n\t\treturn result;\n\t}\n\t\n\tif ( object )\n\t{\n\t\tif ( object->isInstanceOf( IECore::ParameterisedProcedural::staticTypeId() ) )\n\t\t{\n\t\t\treturn IECore::constPointerCast<IECore::Object>( object );\n\t\t}\n\t\t\n\t\treturn object->copy();\n\t}\n\t\n\treturn 0;\n}\n\nObjectPtr FromHoudiniCortexObjectConverter::filterAttribs( const Object *object, const char *filter ) const\n{\n\tconst Primitive *primitive = IECore::runTimeCast<const Primitive>( object );\n\tif ( !primitive )\n\t{\n\t\treturn 0;\n\t}\n\t\n\tstd::vector<InternedString> variablesToErase;\n\tconst PrimitiveVariableMap &variables = primitive->variables;\n\tfor ( PrimitiveVariableMap::const_iterator it = variables.begin(); it != variables.end(); ++it )\n\t{\n\t\tif ( !UT_String( it->first ).multiMatch( filter ) )\n\t\t{\n\t\t\tvariablesToErase.push_back( it->first );\n\t\t}\n\t}\n\t\n\tif ( variablesToErase.empty() )\n\t{\n\t\treturn 0;\n\t}\n\t\n\tPrimitivePtr result = primitive->copy();\n\tPrimitiveVariableMap &resultVariables = result->variables;\n\tfor ( size_t i = 0; i < variablesToErase.size(); ++i )\n\t{\n\t\tresultVariables.erase( variablesToErase[i] );\n\t}\n\t\n\treturn result;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThe MIT License (MIT)\nCopyright (c) 2015 University of Central Florida's Computer Software Engineering\nScalable & Secure Systems (CSE - S3) Lab\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:\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\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 \"..\/libmem.h\"\n\n\n\/*\n * libmem_test.cc\n *\n *  Created on: Oct 19, 2015\n *  @author Mike McGee\n *\/\n\n\n\/\/Main method that will test the execution of the libmem api\nint main (int argc, char**argv) {\n  \/\/ Use libmem to send a message to the server.\n\n  \/\/1. Connect to server [Test server is port 3490]\n  int sock_fd = libmem::Connect(3490, \"localhost\", \"\");\n  std::cout << \"Connected\" << std::endl;\n  \/\/2. Execute a SQLCommand\n  libmem::ResultSet result_set = libmem::ExecuteSQL(\"SELECT * FROM Users\",\n                                                     sock_fd);\n\n  for (int i = 0, j = result_set.get_size(); i < j; ++i) {\n    libmem::ResultRow current_row = result_set.get_next_row();\n    std::vector<libmem::ResultPair> cur_vec = current_row.m_result_row;\n    for (int k = 0, n = current_row.m_result_row.size(); k < n; ++k){\n      std::cout << \"Name :\" << cur_vec.at(k).get_name();\n      std::cout << \"Value: \" << cur_vec.at(k).get_value() << std::endl;   \n    }\n  }\n\n  \n\n  std::cout << \"Executed command\" << std::endl;\n  \/\/3.Disconnect from database.\n  libmem::Disconnect(sock_fd);\n  std::cout << \"Disconnected\" << std::endl;\n\n  return 0;\n}\n\n\n<commit_msg>Updated for loop again<commit_after>\/*\nThe MIT License (MIT)\nCopyright (c) 2015 University of Central Florida's Computer Software Engineering\nScalable & Secure Systems (CSE - S3) Lab\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:\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\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 \"..\/libmem.h\"\n\n\n\/*\n * libmem_test.cc\n *\n *  Created on: Oct 19, 2015\n *  @author Mike McGee\n *\/\n\n\n\/\/Main method that will test the execution of the libmem api\nint main (int argc, char**argv) {\n  \/\/ Use libmem to send a message to the server.\n\n  \/\/1. Connect to server [Test server is port 3490]\n  int sock_fd = libmem::Connect(3490, \"localhost\", \"\");\n  std::cout << \"Connected\" << std::endl;\n  \/\/2. Execute a SQLCommand\n  libmem::ResultSet result_set = libmem::ExecuteSQL(\"SELECT * FROM Users\",\n                                                     sock_fd);\n\n \/\/ for (int i = 0, j = result_set.get_size(); i < j; ++i) {\n  \/\/  libmem::ResultRow current_row = result_set.get_next_row();\n  \/\/  std::vector<libmem::ResultPair> cur_vec = current_row.m_result_row;\n  \/\/  for (int k = 0, n = current_row.m_result_row.size(); k < n; ++k){\n  \/\/    std::cout << \"Name :\" << cur_vec.at(k).get_name();\n\/\/      std::cout << \"Value: \" << cur_vec.at(k).get_value() << std::endl;   \n    \/\/}\n  \/\/}\n\n  libmem::ResultRow row;\n  for (int i = 0; i < result_set.get_size(); ++i) {\n    row = result_set.get_next_row();\n    for (auto pair: row.m_result_row) {\n      std::cout << \"Name: \" << pair.get_name();\n      std::cout << \"Value: \" << pair.get_value();\n    }\n  } \n  \n\n\n  std::cout << \"Executed command\" << std::endl;\n  \/\/3.Disconnect from database.\n  libmem::Disconnect(sock_fd);\n  std::cout << \"Disconnected\" << std::endl;\n\n  return 0;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <DO\/Geometry\/Objects\/Ellipse.hpp>\n#include <DO\/Geometry\/Objects\/Triangle.hpp>\n#include <DO\/Geometry\/Tools\/Utilities.hpp>\n\n#include \"TestPolygon.hpp\"\n\n\nusing namespace DO;\nusing namespace std;\n\n\nclass TestEllipse : public TestPolygon\n{\nprotected:\n  TestEllipse() : TestPolygon()\n  {\n    _width = 300;\n    _height = 300;\n  }\n};\n\n\nTEST_F(TestEllipse, test_segment_area)\n{\n  Ellipse E(270, 150, to_radian(42.), Point2d::Zero());\n\n  try\n  {\n    int steps = 18;\n\n    for (int i0 = 0; i0 <= steps; ++i0)\n    {\n      double theta0 = i0*2*M_PI\/steps;\n      for (int i1 = i0+1; i1 < i0+steps; ++i1)\n      {\n        double theta1 = i1*2*M_PI\/steps;\n\n        const Point2d a(E(theta0));\n        const Point2d b(E(theta1));\n        const Point2d& o = E.center();\n        Triangle t(o, a, b);\n\n        auto inside_segment = [&](const Point2d& p) -> bool {\n          return (ccw(a,b,p) == -1) && inside(p, E);\n        };\n\n        double segArea1 = sweep_count_pixels(inside_segment);\n        double segArea2 = segment_area(E, theta0, theta1);\n\n        double absError = fabs(segArea1 -segArea2);\n        double relError = absError\/segArea1;\n\n        const double thres = 0.1;\n        EXPECT_NEAR(relError, 0, thres);\n#if 0\n        if (relError > thres)\n        {\n          printStage(\"Numerical error\");\n          CHECK(i0);\n          CHECK(i1);\n          CHECK(toDegree(theta0));\n          CHECK(toDegree(theta1));\n          CHECK(segArea1);\n          CHECK(segArea2);\n          CHECK(relError);\n          getKey();\n        }\n#endif\n      }\n    }\n  }\n  catch (exception& e)\n  {\n    cout << e.what() << endl;\n  }\n\n}\n\n\nint main(int argc, char **argv)\n{\n  testing::InitGoogleTest(&argc, argv);\n  return RUN_ALL_TESTS();\n}<commit_msg>Restructure ellipse unit tests.<commit_after>#include <DO\/Core.hpp>\n#include <DO\/Geometry\/Objects\/Cone.hpp>\n#include <DO\/Geometry\/Objects\/CSG.hpp>\n#include <DO\/Geometry\/Objects\/Ellipse.hpp>\n#include <DO\/Geometry\/Objects\/Triangle.hpp>\n#include <DO\/Geometry\/Tools\/Utilities.hpp>\n\n#include \"TestPolygon.hpp\"\n\n\nusing namespace DO;\nusing namespace std;\n\n\nclass TestEllipse : public TestPolygon\n{\nprotected:\n  TestEllipse() : TestPolygon()\n  {\n    _width = 300;\n    _height = 300;\n  }\n};\n\n\n\/\/ TODO: make test faster. TOO SLOW!!!\nTEST_F(TestEllipse, DISABLED_test_sector_area)\n{\n  Ellipse E(250, 150, to_radian(75.), _center);\n\n  CSG::Singleton<Ellipse> ell(E);\n\n  try {\n\n    int steps = 18;\n    for (int i0 = 0; i0 <= steps; ++i0)\n    {\n      double theta0 = i0*2*M_PI\/steps;\n      for (int i1 = i0+1; i1 <= i0+steps; ++i1)\n      {\n        double theta1 = i1*2*M_PI\/steps;\n\n        \/\/ Compute the sector area in a closed form.\n        double analyticSectorArea = sector_area(E, theta0, theta1);\n\n        \/\/ Build constructive solid geometry.\n        CSG::Singleton<AffineCone2> cone ( affine_cone2(\n          theta0+E.orientation(), theta1+E.orientation(), E.center()) );\n        auto E_and_Cone = ell*cone;\n        auto E_minus_Cone = ell - E_and_Cone;\n\n        \/\/ Use the CSGs to estimate the sector area by pixel counting.\n        auto inside_E_and_Cone = [&](const Point2d& p){ \n          return E_and_Cone.contains(p);\n        };\n        auto inside_E_minus_Cone = [&](const Point2d& p){ \n          return E_minus_Cone.contains(p);\n        };\n\n        \/\/ Use the lambda functors to estimate the elliptic sector area.\n        int estimated_sector_area;\n        if (i1 - i0 < steps\/2)\n          estimated_sector_area = sweep_count_pixels(inside_E_and_Cone);\n        else if (abs(i1-i0) == steps\/2)\n          estimated_sector_area = area(E) \/ 2.;\n        else\n          estimated_sector_area = sweep_count_pixels(inside_E_minus_Cone);\n\n        \/\/ Absolute error and relative error.\n        double abs_error = fabs(estimated_sector_area -analyticSectorArea);\n        double rel_error = abs_error\/estimated_sector_area;\n\n        double thres = 1e-1;\n        EXPECT_NEAR(rel_error, 0, thres);\n        if (rel_error > thres)\n        {\n          printStage(\"Numerical error\");\n          cout << i0 << \"     \" << i1 << endl;\n          CHECK(abs(i1-i0));\n          CHECK(analytic_sector_area);\n          CHECK(estimated_sector_area);\n          CHECK(abs_error);\n          CHECK(rel_error);\n        }\n      }\n    }\n  }\n  catch (exception& e)\n  {\n    cout << e.what() << endl;\n  }\n}\n\n\/\/ TODO: make test faster. TOO SLOW!!!\nTEST_F(TestEllipse, DISABLED_test_segment_area)\n{\n  Ellipse E(270, 150, to_radian(42.), Point2d::Zero());\n\n  try\n  {\n    int steps = 18;\n\n    for (int i0 = 0; i0 <= steps; ++i0)\n    {\n      double theta0 = i0*2*M_PI\/steps;\n      for (int i1 = i0+1; i1 < i0+steps; ++i1)\n      {\n        double theta1 = i1*2*M_PI\/steps;\n\n        const Point2d a(E(theta0));\n        const Point2d b(E(theta1));\n        const Point2d& o = E.center();\n        Triangle t(o, a, b);\n\n        auto inside_segment = [&](const Point2d& p) -> bool {\n          return (ccw(a,b,p) == -1) && inside(p, E);\n        };\n\n        double segArea1 = sweep_count_pixels(inside_segment);\n        double segArea2 = segment_area(E, theta0, theta1);\n\n        double absError = fabs(segArea1 -segArea2);\n        double relError = absError\/segArea1;\n\n        const double thres = 0.1;\n        EXPECT_NEAR(relError, 0, thres);\n        if (relError > thres)\n        {\n          printStage(\"Numerical error\");\n          CHECK(i0);\n          CHECK(i1);\n          CHECK(to_degree(theta0));\n          CHECK(to_degree(theta1));\n          CHECK(segArea1);\n          CHECK(segArea2);\n          CHECK(relError);\n        }\n      }\n    }\n  }\n  catch (exception& e)\n  {\n    cout << e.what() << endl;\n  }\n\n}\n\n\nint main(int argc, char **argv)\n{\n  testing::InitGoogleTest(&argc, argv);\n  return RUN_ALL_TESTS();\n}<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ed_ioleobject.cxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: kz $ $Date: 2006-10-06 10:38: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#include \"embeddoc.hxx\"\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <ols\/diagnose.h>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XController_HPP_\n#include <com\/sun\/star\/frame\/XController.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\n\nusing namespace ::com::sun::star;\n\n\nextern ::rtl::OUString  getFilterNameFromGUID_Impl( GUID* );\n\n\/\/-------------------------------------------------------------------------------\n\/\/ IOleObject\n\n\nSTDMETHODIMP EmbedDocument_Impl::SetClientSite( IOleClientSite* pSite )\n{\n    m_pClientSite = pSite;\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetClientSite( IOleClientSite** pSite )\n{\n    *pSite = m_pClientSite;\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetHostNames( LPCOLESTR szContainerApp, LPCOLESTR szContainerObj )\n{\n    m_pDocHolder->setTitle(\n        rtl::OUString(\n            (sal_Unicode*)szContainerObj));\n    m_pDocHolder->setContainerName(\n        rtl::OUString(\n            (sal_Unicode*)szContainerApp));\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Close( DWORD dwSaveOption )\n{\n    HRESULT hr = S_OK;\n\n    if ( dwSaveOption && m_pClientSite )\n        hr = SaveObject(); \/\/ ADVF_DATAONSTOP);\n\n    m_pDocHolder->CloseFrame();\n\n    if ( m_pClientSite )\n        m_pClientSite->OnShowWindow( FALSE );\n\n    AdviseSinkHashMap aAHM(m_aAdviseHashMap);\n\n    for ( AdviseSinkHashMapIterator iAdvise = aAHM.begin();\n          iAdvise != aAHM.end(); iAdvise++ )\n    {\n        if ( iAdvise->second )\n            iAdvise->second->OnClose();\n    }\n\n    return hr;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetMoniker( DWORD \/*dwWhichMoniker*\/, IMoniker * \/*pmk*\/ )\n{\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetMoniker( DWORD \/*dwAssign*\/, DWORD \/*dwWhichMoniker*\/, IMoniker ** \/*ppmk*\/ )\n{\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::InitFromData( IDataObject * \/*pDataObject*\/, BOOL \/*fCreation*\/, DWORD \/*dwReserved*\/ )\n{\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetClipboardData( DWORD \/*dwReserved*\/, IDataObject ** \/*ppDataObject*\/ )\n{\n    return E_NOTIMPL;\n}\n\n\/**\n *  Well, this is a not so very inefficient way to deliver\n *\n *\/\n\nSTDMETHODIMP EmbedDocument_Impl::DoVerb(\n    LONG iVerb,\n    LPMSG,\n    IOleClientSite *pActiveSite,\n    LONG,\n    HWND,\n    LPCRECT )\n{\n    \/\/ no locking is used since the OLE must use the same thread always\n    if ( m_bIsInVerbHandling )\n        return OLEOBJ_S_CANNOT_DOVERB_NOW;\n\n    BooleanGuard_Impl aGuard( m_bIsInVerbHandling );\n\n    switch(iVerb) {\n        case OLEIVERB_DISCARDUNDOSTATE:\n            \/\/ free any undostate?\n            break;\n        case OLEIVERB_INPLACEACTIVATE:\n            OSL_ENSURE(m_pDocHolder,\"no document for inplace activation\");\n\n            return m_pDocHolder->InPlaceActivate(pActiveSite,FALSE);\n            break;\n        case OLEIVERB_UIACTIVATE:\n            OSL_ENSURE(m_pDocHolder,\"no document for     inplace activation\");\n\n            return m_pDocHolder->InPlaceActivate(pActiveSite,TRUE);\n            break;\n        case OLEIVERB_PRIMARY:\n        case OLEIVERB_SHOW:\n            OSL_ENSURE(m_pDocHolder,\"no document for inplace activation\");\n\n            if(m_pDocHolder->isActive())\n                return NOERROR; \/\/Already active\n\n            if(SUCCEEDED(\n                m_pDocHolder->InPlaceActivate(\n                    pActiveSite,TRUE)))\n                return NOERROR;\n\n            \/\/ intended fall trough\n        case OLEIVERB_OPEN:\n            OSL_ENSURE(m_pDocHolder,\"no document to open\");\n\n            \/\/ the commented code could be usefull in case\n            \/\/ outer window would be resized depending from inner one\n            \/\/ RECTL aEmbArea;\n            \/\/ m_pDocHolder->GetVisArea( &aEmbArea );\n            \/\/ m_pDocHolder->show();\n            \/\/ m_pDocHolder->SetVisArea( &aEmbArea );\n\n            if(m_pDocHolder->isActive())\n            {\n                m_pDocHolder->InPlaceDeactivate();\n                m_pDocHolder->DisableInplaceActivation(true);\n            }\n\n            SIZEL aEmbSize;\n            m_pDocHolder->GetExtent( &aEmbSize );\n            m_pDocHolder->show();\n            m_pDocHolder->resizeWin( aEmbSize );\n\n            if ( m_pClientSite )\n                m_pClientSite->OnShowWindow( TRUE );\n\n            notify();\n            break;\n        case OLEIVERB_HIDE:\n            OSL_ENSURE(m_pDocHolder,\"no document to hide\");\n\n            if(m_pDocHolder->isActive())\n                m_pDocHolder->InPlaceDeactivate();\n            else {\n                m_pDocHolder->hide();\n\n                if( m_pClientSite )\n                    m_pClientSite->OnShowWindow(FALSE);\n            }\n            break;\n        default:\n            break;\n    }\n\n    return NOERROR;\n}\n\n\n\nSTDMETHODIMP EmbedDocument_Impl::EnumVerbs( IEnumOLEVERB ** \/*ppEnumOleVerb*\/ )\n{\n    return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Update()\n{\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::IsUpToDate()\n{\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetUserClassID( CLSID *pClsid )\n{\n    return GetClassID( pClsid );\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetUserType( DWORD \/*dwFormOfTypeUe*\/, LPOLESTR * \/*pszUserType*\/ )\n{\n    return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetExtent( DWORD \/*dwDrawAspect*\/, SIZEL *psizel )\n{\n    if ( !psizel )\n        return E_FAIL;\n\n    m_pDocHolder->SetExtent( psizel );\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetExtent( DWORD \/*dwDrawAspect*\/, SIZEL * psizel )\n{\n    if ( !psizel )\n        return E_INVALIDARG;\n\n    if ( FAILED( m_pDocHolder->GetExtent( psizel ) ) )\n    {\n        \/\/ return default values\n        psizel->cx = 500;\n        psizel->cy = 500;\n    }\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Advise( IAdviseSink *pAdvSink, DWORD *pdwConnection )\n{\n    if ( m_nAdviseNum == 0xFFFFFFFF )\n        return E_OUTOFMEMORY;\n\n    pAdvSink->AddRef();\n    m_aAdviseHashMap.insert( ::std::pair< DWORD, IAdviseSink* >( m_nAdviseNum, pAdvSink ) );\n    *pdwConnection = m_nAdviseNum++;\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Unadvise( DWORD dwConnection )\n{\n    AdviseSinkHashMapIterator iAdvise = m_aAdviseHashMap.find( dwConnection );\n    if ( iAdvise != m_aAdviseHashMap.end() )\n    {\n        iAdvise->second->Release();\n        m_aAdviseHashMap.erase( iAdvise );\n    }\n    else\n        return OLE_E_NOCONNECTION;\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::EnumAdvise( IEnumSTATDATA ** \/*ppenumAdvise*\/ )\n{\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetMiscStatus( DWORD \/*dwAspect*\/, DWORD * \/*pdwStatus*\/ )\n{\n    return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetColorScheme( LOGPALETTE * \/*pLogpal*\/ )\n{\n    return E_NOTIMPL;\n}\n\n\/\/-------------------------------------------------------------------------------\n\/\/ IDispatch\n\nSTDMETHODIMP EmbedDocument_Impl::GetTypeInfoCount( unsigned int FAR*  pctinfo )\n{\n    if ( m_pDocHolder->GetIDispatch() )\n        return m_pDocHolder->GetIDispatch()->GetTypeInfoCount( pctinfo );\n\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetTypeInfo( unsigned int iTInfo, LCID lcid, ITypeInfo FAR* FAR* ppTInfo )\n{\n    if ( m_pDocHolder->GetIDispatch() )\n        return m_pDocHolder->GetIDispatch()->GetTypeInfo( iTInfo, lcid, ppTInfo );\n\n    return DISP_E_BADINDEX; \/\/ the only error that can be returned\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetIDsOfNames( REFIID riid,\n                                                OLECHAR FAR* FAR* rgszNames,\n                                                unsigned int cNames,\n                                                LCID lcid,\n                                                DISPID FAR* rgDispId )\n{\n    if ( m_pDocHolder->GetIDispatch() )\n        return m_pDocHolder->GetIDispatch()->GetIDsOfNames( riid, rgszNames, cNames, lcid, rgDispId );\n\n    for ( unsigned int ind = 0; ind < cNames; ind++ )\n        rgDispId[ind] = DISPID_UNKNOWN;\n\n    return DISP_E_UNKNOWNNAME;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Invoke( DISPID dispIdMember,\n                                         REFIID riid,\n                                         LCID lcid,\n                                         WORD wFlags,\n                                         DISPPARAMS FAR* pDispParams,\n                                         VARIANT FAR* pVarResult,\n                                         EXCEPINFO FAR* pExcepInfo,\n                                         unsigned int FAR* puArgErr )\n{\n    if ( m_pDocHolder->GetIDispatch() )\n        return m_pDocHolder->GetIDispatch()->Invoke( dispIdMember,\n                                                     riid,\n                                                     lcid,\n                                                     wFlags,\n                                                     pDispParams,\n                                                     pVarResult,\n                                                     pExcepInfo,\n                                                     puArgErr );\n\n    return DISP_E_MEMBERNOTFOUND;\n}\n\n\n\/\/ C++ - methods\n\nHRESULT EmbedDocument_Impl::SaveObject()\n{\n    HRESULT hr = S_OK;\n\n    if(m_pClientSite) {\n        hr = m_pClientSite->SaveObject();\n\n        for ( AdviseSinkHashMapIterator iAdvise =\n                  m_aAdviseHashMap.begin();\n              iAdvise != m_aAdviseHashMap.end();\n              iAdvise++ )\n            if ( iAdvise->second )\n                iAdvise->second->OnSave( );\n    }\n\n    notify( false );\n\n    return hr;\n}\n\n\nHRESULT EmbedDocument_Impl::ShowObject()\n{\n    HRESULT hr = S_OK;\n\n    if(m_pClientSite)\n        hr = m_pClientSite->ShowObject();\n\n    return hr;\n}\n\n\nvoid EmbedDocument_Impl::notify( bool bDataChanged )\n{\n    for ( AdviseSinkHashMapIterator iAdvise =\n              m_aAdviseHashMap.begin();\n          iAdvise != m_aAdviseHashMap.end();\n          iAdvise++ )\n        if ( iAdvise->second )\n            iAdvise->second->OnViewChange( DVASPECT_CONTENT, -1 );\n\n    if ( m_pDAdviseHolder && bDataChanged )\n        m_pDAdviseHolder->SendOnDataChange( (IDataObject*)this, 0, 0 );\n}\n\n\/\/ Fix strange warnings about some\n\/\/ ATL::CAxHostWindow::QueryInterface|AddRef|Releae functions.\n\/\/ warning C4505: 'xxx' : unreferenced local function has been removed\n#if defined(_MSC_VER)\n#pragma warning(disable: 4505)\n#endif\n<commit_msg>INTEGRATION: CWS c04v3_SRC680 (1.15.10); FILE MERGED 2006\/11\/24 18:42:54 mav 1.15.10.2: #143410# reimplement links support correctly 2006\/11\/10 14:16:06 mav 1.15.10.1: #143410# allow saving even if there is no client<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ed_ioleobject.cxx,v $\n *\n *  $Revision: 1.18 $\n *\n *  last change: $Author: rt $ $Date: 2006-12-05 13:03: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#include \"embeddoc.hxx\"\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <ols\/diagnose.h>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XController_HPP_\n#include <com\/sun\/star\/frame\/XController.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\n\nusing namespace ::com::sun::star;\n\n\nextern ::rtl::OUString  getFilterNameFromGUID_Impl( GUID* );\n\n\/\/-------------------------------------------------------------------------------\n\/\/ IOleObject\n\n\nSTDMETHODIMP EmbedDocument_Impl::SetClientSite( IOleClientSite* pSite )\n{\n    m_pClientSite = pSite;\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetClientSite( IOleClientSite** pSite )\n{\n    *pSite = m_pClientSite;\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetHostNames( LPCOLESTR szContainerApp, LPCOLESTR szContainerObj )\n{\n    \/\/ the code should be ignored for links\n    if ( !m_aFileName.getLength() )\n    {\n        m_pDocHolder->setTitle(\n            rtl::OUString(\n                (sal_Unicode*)szContainerObj));\n        m_pDocHolder->setContainerName(\n            rtl::OUString(\n                (sal_Unicode*)szContainerApp));\n    }\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Close( DWORD dwSaveOption )\n{\n    if ( dwSaveOption == 2 && m_aFileName.getLength() )\n    {\n        \/\/ ask the user about saving\n        if ( m_pDocHolder->ExecuteSuspendCloseFrame() )\n        {\n            m_pDocHolder->CloseDocument();\n            return S_OK;\n        }\n        else\n            return OLE_E_PROMPTSAVECANCELLED;\n    }\n\n    HRESULT hr = S_OK;\n\n    if ( dwSaveOption != 1 )\n        hr = SaveObject(); \/\/ ADVF_DATAONSTOP);\n\n    m_pDocHolder->FreeOffice();\n    m_pDocHolder->CloseDocument();\n    m_pDocHolder->CloseFrame();\n\n    OLENotifyClosing();\n\n    return hr;\n}\n\n\nHRESULT EmbedDocument_Impl::OLENotifyClosing()\n{\n    HRESULT hr = S_OK;\n\n    if ( m_pClientSite )\n        m_pClientSite->OnShowWindow( FALSE );\n\n    AdviseSinkHashMap aAHM(m_aAdviseHashMap);\n\n    for ( AdviseSinkHashMapIterator iAdvise = aAHM.begin();\n          iAdvise != aAHM.end(); iAdvise++ )\n    {\n        if ( iAdvise->second )\n            iAdvise->second->OnClose();\n    }\n\n    return hr;\n\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetMoniker( DWORD \/*dwWhichMoniker*\/, IMoniker * \/*pmk*\/ )\n{\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetMoniker( DWORD \/*dwAssign*\/, DWORD \/*dwWhichMoniker*\/, IMoniker ** \/*ppmk*\/ )\n{\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::InitFromData( IDataObject * \/*pDataObject*\/, BOOL \/*fCreation*\/, DWORD \/*dwReserved*\/ )\n{\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetClipboardData( DWORD \/*dwReserved*\/, IDataObject ** \/*ppDataObject*\/ )\n{\n    return E_NOTIMPL;\n}\n\n\/**\n *  Well, this is a not so very inefficient way to deliver\n *\n *\/\n\nSTDMETHODIMP EmbedDocument_Impl::DoVerb(\n    LONG iVerb,\n    LPMSG,\n    IOleClientSite *pActiveSite,\n    LONG,\n    HWND,\n    LPCRECT )\n{\n    \/\/ no locking is used since the OLE must use the same thread always\n    if ( m_bIsInVerbHandling )\n        return OLEOBJ_S_CANNOT_DOVERB_NOW;\n\n    BooleanGuard_Impl aGuard( m_bIsInVerbHandling );\n\n    if ( iVerb == OLEIVERB_PRIMARY )\n    {\n        if ( m_aFileName.getLength() )\n        {\n            \/\/ that should be a link\n            iVerb = OLEIVERB_OPEN;\n        }\n        else\n            iVerb = OLEIVERB_SHOW;\n    }\n\n    switch(iVerb) {\n        case OLEIVERB_DISCARDUNDOSTATE:\n            \/\/ free any undostate?\n            break;\n        case OLEIVERB_INPLACEACTIVATE:\n            OSL_ENSURE(m_pDocHolder,\"no document for inplace activation\");\n\n            return m_pDocHolder->InPlaceActivate(pActiveSite,FALSE);\n            break;\n        case OLEIVERB_UIACTIVATE:\n            OSL_ENSURE(m_pDocHolder,\"no document for     inplace activation\");\n\n            return m_pDocHolder->InPlaceActivate(pActiveSite,TRUE);\n            break;\n        case OLEIVERB_PRIMARY:\n        case OLEIVERB_SHOW:\n            OSL_ENSURE(m_pDocHolder,\"no document for inplace activation\");\n\n            if(m_pDocHolder->isActive())\n                return NOERROR; \/\/Already active\n\n            if(SUCCEEDED(\n                m_pDocHolder->InPlaceActivate(\n                    pActiveSite,TRUE)))\n                return NOERROR;\n\n            \/\/ intended fall trough\n        case OLEIVERB_OPEN:\n            OSL_ENSURE(m_pDocHolder,\"no document to open\");\n\n            \/\/ the commented code could be usefull in case\n            \/\/ outer window would be resized depending from inner one\n            \/\/ RECTL aEmbArea;\n            \/\/ m_pDocHolder->GetVisArea( &aEmbArea );\n            \/\/ m_pDocHolder->show();\n            \/\/ m_pDocHolder->SetVisArea( &aEmbArea );\n\n            if(m_pDocHolder->isActive())\n            {\n                m_pDocHolder->InPlaceDeactivate();\n                m_pDocHolder->DisableInplaceActivation(true);\n            }\n\n            SIZEL aEmbSize;\n            m_pDocHolder->GetExtent( &aEmbSize );\n            m_pDocHolder->show();\n            m_pDocHolder->resizeWin( aEmbSize );\n\n            if ( m_pClientSite )\n                m_pClientSite->OnShowWindow( TRUE );\n\n            notify();\n            break;\n        case OLEIVERB_HIDE:\n            OSL_ENSURE(m_pDocHolder,\"no document to hide\");\n\n            if(m_pDocHolder->isActive())\n                m_pDocHolder->InPlaceDeactivate();\n            else {\n                m_pDocHolder->hide();\n\n                if( m_pClientSite )\n                    m_pClientSite->OnShowWindow(FALSE);\n            }\n            break;\n        default:\n            break;\n    }\n\n    return NOERROR;\n}\n\n\n\nSTDMETHODIMP EmbedDocument_Impl::EnumVerbs( IEnumOLEVERB ** \/*ppEnumOleVerb*\/ )\n{\n    return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Update()\n{\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::IsUpToDate()\n{\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetUserClassID( CLSID *pClsid )\n{\n    return GetClassID( pClsid );\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetUserType( DWORD \/*dwFormOfTypeUe*\/, LPOLESTR * \/*pszUserType*\/ )\n{\n    return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetExtent( DWORD \/*dwDrawAspect*\/, SIZEL *psizel )\n{\n    if ( !psizel )\n        return E_FAIL;\n\n    m_pDocHolder->SetExtent( psizel );\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetExtent( DWORD \/*dwDrawAspect*\/, SIZEL * psizel )\n{\n    if ( !psizel )\n        return E_INVALIDARG;\n\n    if ( FAILED( m_pDocHolder->GetExtent( psizel ) ) )\n    {\n        \/\/ return default values\n        psizel->cx = 500;\n        psizel->cy = 500;\n    }\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Advise( IAdviseSink *pAdvSink, DWORD *pdwConnection )\n{\n    if ( m_nAdviseNum == 0xFFFFFFFF )\n        return E_OUTOFMEMORY;\n\n    pAdvSink->AddRef();\n    m_aAdviseHashMap.insert( ::std::pair< DWORD, IAdviseSink* >( m_nAdviseNum, pAdvSink ) );\n    *pdwConnection = m_nAdviseNum++;\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Unadvise( DWORD dwConnection )\n{\n    AdviseSinkHashMapIterator iAdvise = m_aAdviseHashMap.find( dwConnection );\n    if ( iAdvise != m_aAdviseHashMap.end() )\n    {\n        iAdvise->second->Release();\n        m_aAdviseHashMap.erase( iAdvise );\n    }\n    else\n        return OLE_E_NOCONNECTION;\n\n    return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::EnumAdvise( IEnumSTATDATA ** \/*ppenumAdvise*\/ )\n{\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetMiscStatus( DWORD \/*dwAspect*\/, DWORD * \/*pdwStatus*\/ )\n{\n    return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetColorScheme( LOGPALETTE * \/*pLogpal*\/ )\n{\n    return E_NOTIMPL;\n}\n\n\/\/-------------------------------------------------------------------------------\n\/\/ IDispatch\n\nSTDMETHODIMP EmbedDocument_Impl::GetTypeInfoCount( unsigned int FAR*  pctinfo )\n{\n    if ( m_pDocHolder->GetIDispatch() )\n        return m_pDocHolder->GetIDispatch()->GetTypeInfoCount( pctinfo );\n\n    return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetTypeInfo( unsigned int iTInfo, LCID lcid, ITypeInfo FAR* FAR* ppTInfo )\n{\n    if ( m_pDocHolder->GetIDispatch() )\n        return m_pDocHolder->GetIDispatch()->GetTypeInfo( iTInfo, lcid, ppTInfo );\n\n    return DISP_E_BADINDEX; \/\/ the only error that can be returned\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetIDsOfNames( REFIID riid,\n                                                OLECHAR FAR* FAR* rgszNames,\n                                                unsigned int cNames,\n                                                LCID lcid,\n                                                DISPID FAR* rgDispId )\n{\n    if ( m_pDocHolder->GetIDispatch() )\n        return m_pDocHolder->GetIDispatch()->GetIDsOfNames( riid, rgszNames, cNames, lcid, rgDispId );\n\n    for ( unsigned int ind = 0; ind < cNames; ind++ )\n        rgDispId[ind] = DISPID_UNKNOWN;\n\n    return DISP_E_UNKNOWNNAME;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Invoke( DISPID dispIdMember,\n                                         REFIID riid,\n                                         LCID lcid,\n                                         WORD wFlags,\n                                         DISPPARAMS FAR* pDispParams,\n                                         VARIANT FAR* pVarResult,\n                                         EXCEPINFO FAR* pExcepInfo,\n                                         unsigned int FAR* puArgErr )\n{\n    if ( m_pDocHolder->GetIDispatch() )\n        return m_pDocHolder->GetIDispatch()->Invoke( dispIdMember,\n                                                     riid,\n                                                     lcid,\n                                                     wFlags,\n                                                     pDispParams,\n                                                     pVarResult,\n                                                     pExcepInfo,\n                                                     puArgErr );\n\n    return DISP_E_MEMBERNOTFOUND;\n}\n\n\n\/\/ C++ - methods\n\nHRESULT EmbedDocument_Impl::SaveObject()\n{\n    HRESULT hr = S_OK;\n\n    if(m_pClientSite) {\n        hr = m_pClientSite->SaveObject();\n\n        for ( AdviseSinkHashMapIterator iAdvise =\n                  m_aAdviseHashMap.begin();\n              iAdvise != m_aAdviseHashMap.end();\n              iAdvise++ )\n            if ( iAdvise->second )\n                iAdvise->second->OnSave( );\n    }\n    else if ( m_aFileName.getLength() && IsDirty() == S_OK )\n    {\n        ::rtl::OUString aPreservFileName = m_aFileName;\n\n        \/\/ in case of links the containers does not provide client site sometimes\n        hr = Save( (LPCOLESTR)NULL, FALSE ); \/\/ triggers saving to the link location\n        SaveCompleted( (LPCOLESTR)aPreservFileName.getStr() );\n    }\n\n    notify( false );\n\n    return hr;\n}\n\n\nHRESULT EmbedDocument_Impl::ShowObject()\n{\n    HRESULT hr = S_OK;\n\n    if(m_pClientSite)\n        hr = m_pClientSite->ShowObject();\n\n    return hr;\n}\n\n\nvoid EmbedDocument_Impl::notify( bool bDataChanged )\n{\n    for ( AdviseSinkHashMapIterator iAdvise =\n              m_aAdviseHashMap.begin();\n          iAdvise != m_aAdviseHashMap.end();\n          iAdvise++ )\n        if ( iAdvise->second )\n            iAdvise->second->OnViewChange( DVASPECT_CONTENT, -1 );\n\n    if ( m_pDAdviseHolder && bDataChanged )\n        m_pDAdviseHolder->SendOnDataChange( (IDataObject*)this, 0, 0 );\n}\n\n\/\/ Fix strange warnings about some\n\/\/ ATL::CAxHostWindow::QueryInterface|AddRef|Releae functions.\n\/\/ warning C4505: 'xxx' : unreferenced local function has been removed\n#if defined(_MSC_VER)\n#pragma warning(disable: 4505)\n#endif\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 <Interface\/Modules\/Visualization\/ShowFieldDialog.h>\n#include <Modules\/Visualization\/ShowField.h>\n#include <Dataflow\/Network\/ModuleStateInterface.h>  \/\/TODO: extract into intermediate\n#include <Core\/Datatypes\/Color.h>\n#include <QColorDialog>\n\nusing namespace SCIRun::Gui;\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Modules::Visualization;\nusing namespace SCIRun::Core::Datatypes;\n\nShowFieldDialog::ShowFieldDialog(const std::string& name, ModuleStateHandle state,\n  QWidget* parent \/* = 0 *\/)\n  : ModuleDialogGeneric(state, parent),\n  defaultMeshColor_(Qt::gray)\n{\n  setupUi(this);\n  setWindowTitle(QString::fromStdString(name));\n  fixSize();\n\n  addCheckBoxManager(showNodesCheckBox_, ShowFieldModule::ShowNodes);\n  addCheckBoxManager(showEdgesCheckBox_, ShowFieldModule::ShowEdges);\n  addCheckBoxManager(showFacesCheckBox_, ShowFieldModule::ShowFaces);\n  addCheckBoxManager(enableTransparencyNodesCheckBox_, ShowFieldModule::NodeTransparency);\n  addCheckBoxManager(enableTransparencyEdgesCheckBox_, ShowFieldModule::EdgeTransparency);\n  addCheckBoxManager(enableTransparencyFacesCheckBox_, ShowFieldModule::FaceTransparency);\n  addCheckBoxManager(invertNormalsCheckBox, ShowFieldModule::FaceInvertNormals);\n\n  buttonBox->setVisible(false);\n  connect(defaultMeshColorButton_, SIGNAL(clicked()), this, SLOT(assignDefaultMeshColor()));\n  connect(nodesAsPointsButton_, SIGNAL(clicked()), this, SLOT(pushNodeType()));\n  connect(nodesAsSpheresButton_, SIGNAL(clicked()), this, SLOT(pushNodeType()));\n\n  pushNodeType();\n}\n\nvoid ShowFieldDialog::push()\n{\n  if (!pulling_)\n  {\n    pushColor();\n  }\n}\n\nvoid ShowFieldDialog::pull()\n{\n  pull_newVersionToReplaceOld();\n  Pulling p(this);\n  ColorRGB color(state_->getValue(ShowFieldModule::DefaultMeshColor).getString());\n  defaultMeshColor_ = QColor(\n      static_cast<int>(color.r() * 255.0),\n      static_cast<int>(color.g() * 255.0),\n      static_cast<int>(color.b() * 255.0));\n}\n\nvoid ShowFieldDialog::assignDefaultMeshColor()\n{\n  auto newColor = QColorDialog::getColor(defaultMeshColor_, this, \"Choose default mesh color\");\n  if (newColor.isValid())\n  {\n    defaultMeshColor_ = newColor;\n    \/\/TODO: set color of button to this color\n    \/\/defaultMeshColorButton_->set\n    pushColor();\n  }\n}\n\nvoid ShowFieldDialog::pushColor()\n{\n  state_->setValue(ShowFieldModule::DefaultMeshColor, ColorRGB(defaultMeshColor_.red(), defaultMeshColor_.green(), defaultMeshColor_.blue()).toString());\n}\n\nvoid ShowFieldDialog::pushNodeType()\n{\n  state_->setValue(ShowFieldModule::NodeAsPoints, nodesAsPointsButton_->isChecked());\n  state_->setValue(ShowFieldModule::NodeAsSpheres, nodesAsSpheresButton_->isChecked());\n\n  std::cout << \"Nodes as points: \" << state_->getValue(ShowFieldModule::NodeAsPoints) << std::endl;\n  std::cout << \"Nodes as spheres: \" << state_->getValue(ShowFieldModule::NodeAsSpheres) << std::endl;\n}\n\n<commit_msg>Remove debug comments.<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 <Interface\/Modules\/Visualization\/ShowFieldDialog.h>\n#include <Modules\/Visualization\/ShowField.h>\n#include <Dataflow\/Network\/ModuleStateInterface.h>  \/\/TODO: extract into intermediate\n#include <Core\/Datatypes\/Color.h>\n#include <QColorDialog>\n\nusing namespace SCIRun::Gui;\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Modules::Visualization;\nusing namespace SCIRun::Core::Datatypes;\n\nShowFieldDialog::ShowFieldDialog(const std::string& name, ModuleStateHandle state,\n  QWidget* parent \/* = 0 *\/)\n  : ModuleDialogGeneric(state, parent),\n  defaultMeshColor_(Qt::gray)\n{\n  setupUi(this);\n  setWindowTitle(QString::fromStdString(name));\n  fixSize();\n\n  addCheckBoxManager(showNodesCheckBox_, ShowFieldModule::ShowNodes);\n  addCheckBoxManager(showEdgesCheckBox_, ShowFieldModule::ShowEdges);\n  addCheckBoxManager(showFacesCheckBox_, ShowFieldModule::ShowFaces);\n  addCheckBoxManager(enableTransparencyNodesCheckBox_, ShowFieldModule::NodeTransparency);\n  addCheckBoxManager(enableTransparencyEdgesCheckBox_, ShowFieldModule::EdgeTransparency);\n  addCheckBoxManager(enableTransparencyFacesCheckBox_, ShowFieldModule::FaceTransparency);\n  addCheckBoxManager(invertNormalsCheckBox, ShowFieldModule::FaceInvertNormals);\n\n  buttonBox->setVisible(false);\n  connect(defaultMeshColorButton_, SIGNAL(clicked()), this, SLOT(assignDefaultMeshColor()));\n  connect(nodesAsPointsButton_, SIGNAL(clicked()), this, SLOT(pushNodeType()));\n  connect(nodesAsSpheresButton_, SIGNAL(clicked()), this, SLOT(pushNodeType()));\n\n  pushNodeType();\n}\n\nvoid ShowFieldDialog::push()\n{\n  if (!pulling_)\n  {\n    pushColor();\n  }\n}\n\nvoid ShowFieldDialog::pull()\n{\n  pull_newVersionToReplaceOld();\n  Pulling p(this);\n  ColorRGB color(state_->getValue(ShowFieldModule::DefaultMeshColor).getString());\n  defaultMeshColor_ = QColor(\n      static_cast<int>(color.r() * 255.0),\n      static_cast<int>(color.g() * 255.0),\n      static_cast<int>(color.b() * 255.0));\n}\n\nvoid ShowFieldDialog::assignDefaultMeshColor()\n{\n  auto newColor = QColorDialog::getColor(defaultMeshColor_, this, \"Choose default mesh color\");\n  if (newColor.isValid())\n  {\n    defaultMeshColor_ = newColor;\n    \/\/TODO: set color of button to this color\n    \/\/defaultMeshColorButton_->set\n    pushColor();\n  }\n}\n\nvoid ShowFieldDialog::pushColor()\n{\n  state_->setValue(ShowFieldModule::DefaultMeshColor, ColorRGB(defaultMeshColor_.red(), defaultMeshColor_.green(), defaultMeshColor_.blue()).toString());\n}\n\nvoid ShowFieldDialog::pushNodeType()\n{\n  state_->setValue(ShowFieldModule::NodeAsPoints, nodesAsPointsButton_->isChecked());\n  state_->setValue(ShowFieldModule::NodeAsSpheres, nodesAsSpheresButton_->isChecked());\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: AdabasStat.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: oj $ $Date: 2001-07-04 13:09: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#ifndef _DBAUI_ADASTAT_HXX_\n#define _DBAUI_ADASTAT_HXX_\n\n#ifndef _SV_FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_BUTTON_HXX\n#include <vcl\/button.hxx>\n#endif\n#ifndef _SV_DIALOG_HXX\n#include <vcl\/dialog.hxx>\n#endif\n#ifndef DBAUI_FIELDCONTROLS_HXX\n#include \"FieldControls.hxx\"\n#endif\n#ifndef _PRGSBAR_HXX\n#include <svtools\/prgsbar.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCONNECTION_HPP_\n#include <com\/sun\/star\/sdbc\/XConnection.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n\nnamespace dbaui\n{\n    \/\/========================================================================\n    \/\/ shows some statistics\n    \/\/========================================================================\n    class OAdabasStatistics : public ModalDialog\n    {\n    protected:\n\n        FixedLine               m_FL_FILES;\n        FixedText               m_FT_SYSDEVSPACE;\n        OPropEditCtrl           m_ET_SYSDEVSPACE;\n        FixedText               m_FT_TRANSACTIONLOG;\n        OPropEditCtrl           m_ET_TRANSACTIONLOG;\n        FixedText               m_FT_DATADEVSPACE;\n        OPropListBoxCtrl        m_LB_DATADEVS;\n        FixedLine               m_FL_SIZES;\n        FixedText               m_FT_SIZE;\n        OPropEditCtrl           m_ET_SIZE;\n        FixedText               m_FT_FREESIZE;\n        OPropEditCtrl           m_ET_FREESIZE;\n        FixedText               m_FT_MEMORYUSING;\n        OPropNumericEditCtrl    m_ET_MEMORYUSING;\n\n        OKButton                m_PB_OK;\n\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >\n                                m_xConnection;  \/\/\/ valid as long as the page is active\n        sal_Bool                m_bErrorShown; \/\/ true when we shown already the error\n\n        \/\/ check if the given table is accessable by the connected user\n        sal_Bool checkSystemTable(const ::rtl::OUString& _rsSystemTable, ::rtl::OUString& _rsSchemaName );\n        void showError();\n\n    public:\n        OAdabasStatistics(  Window* pParent,\n                            const ::rtl::OUString& _rUser,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _xCurrentConnection,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _xFactory);\n        ~OAdabasStatistics();\n\n    };\n}\n#endif \/\/_DBAUI_ADASTAT_HXX_\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.500); FILE MERGED 2005\/09\/05 17:33:29 rt 1.3.500.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AdabasStat.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 14:40: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#ifndef _DBAUI_ADASTAT_HXX_\n#define _DBAUI_ADASTAT_HXX_\n\n#ifndef _SV_FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_BUTTON_HXX\n#include <vcl\/button.hxx>\n#endif\n#ifndef _SV_DIALOG_HXX\n#include <vcl\/dialog.hxx>\n#endif\n#ifndef DBAUI_FIELDCONTROLS_HXX\n#include \"FieldControls.hxx\"\n#endif\n#ifndef _PRGSBAR_HXX\n#include <svtools\/prgsbar.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCONNECTION_HPP_\n#include <com\/sun\/star\/sdbc\/XConnection.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n\nnamespace dbaui\n{\n    \/\/========================================================================\n    \/\/ shows some statistics\n    \/\/========================================================================\n    class OAdabasStatistics : public ModalDialog\n    {\n    protected:\n\n        FixedLine               m_FL_FILES;\n        FixedText               m_FT_SYSDEVSPACE;\n        OPropEditCtrl           m_ET_SYSDEVSPACE;\n        FixedText               m_FT_TRANSACTIONLOG;\n        OPropEditCtrl           m_ET_TRANSACTIONLOG;\n        FixedText               m_FT_DATADEVSPACE;\n        OPropListBoxCtrl        m_LB_DATADEVS;\n        FixedLine               m_FL_SIZES;\n        FixedText               m_FT_SIZE;\n        OPropEditCtrl           m_ET_SIZE;\n        FixedText               m_FT_FREESIZE;\n        OPropEditCtrl           m_ET_FREESIZE;\n        FixedText               m_FT_MEMORYUSING;\n        OPropNumericEditCtrl    m_ET_MEMORYUSING;\n\n        OKButton                m_PB_OK;\n\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >\n                                m_xConnection;  \/\/\/ valid as long as the page is active\n        sal_Bool                m_bErrorShown; \/\/ true when we shown already the error\n\n        \/\/ check if the given table is accessable by the connected user\n        sal_Bool checkSystemTable(const ::rtl::OUString& _rsSystemTable, ::rtl::OUString& _rsSchemaName );\n        void showError();\n\n    public:\n        OAdabasStatistics(  Window* pParent,\n                            const ::rtl::OUString& _rUser,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _xCurrentConnection,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _xFactory);\n        ~OAdabasStatistics();\n\n    };\n}\n#endif \/\/_DBAUI_ADASTAT_HXX_\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ColumnPeer.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 03:34: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#ifndef DBAUI_COLUMNPEER_HXX\n#include \"ColumnPeer.hxx\"\n#endif\n#ifndef DBAUI_COLUMNCONTROLWINDOW_HXX\n#include \"ColumnControlWindow.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef DBAUI_FIELDDESCRIPTIONS_HXX\n#include \"FieldDescriptions.hxx\"\n#endif\n\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\nusing namespace ::com::sun::star::awt;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::sdbc;\n\nOColumnPeer::OColumnPeer(Window* _pParent,const Reference<XMultiServiceFactory>& _rxFactory)\n    :m_xORB(_rxFactory)\n    ,m_pActFieldDescr(NULL)\n{\n    osl_incrementInterlockedCount( &m_refCount );\n    {\n        OColumnControlWindow* pFieldControl = new OColumnControlWindow(_pParent,m_xORB);\n        pFieldControl->SetComponentInterface(this);\n        pFieldControl->Show();\n    }\n    osl_decrementInterlockedCount( &m_refCount );\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OColumnPeer::setEditWidth(sal_Int32 _nWidth)\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    OColumnControlWindow* pFieldControl = static_cast<OColumnControlWindow*>( GetWindow() );\n    if ( pFieldControl )\n    {\n        pFieldControl->setEditWidth(_nWidth);\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OColumnPeer::setColumn(const Reference< XPropertySet>& _xColumn)\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    OColumnControlWindow* pFieldControl = static_cast<OColumnControlWindow*>( GetWindow() );\n    if ( pFieldControl )\n    {\n        if ( m_pActFieldDescr )\n        {\n            delete m_pActFieldDescr;\n            m_pActFieldDescr = NULL;\n        }\n        if ( _xColumn.is() )\n        {\n            sal_Int32 nType         = 0;\n            sal_Int32 nScale        = 0;\n            sal_Int32 nPrecision    = 0;\n            sal_Bool bAutoIncrement = sal_False;\n            ::rtl::OUString sTypeName;\n\n            try\n            {\n                \/\/ get the properties from the column\n                _xColumn->getPropertyValue(PROPERTY_TYPENAME)       >>= sTypeName;\n                _xColumn->getPropertyValue(PROPERTY_TYPE)           >>= nType;\n                _xColumn->getPropertyValue(PROPERTY_SCALE)          >>= nScale;\n                _xColumn->getPropertyValue(PROPERTY_PRECISION)      >>= nPrecision;\n                _xColumn->getPropertyValue(PROPERTY_ISAUTOINCREMENT)    >>= bAutoIncrement;\n            }\n            catch(Exception)\n            {\n            }\n\n            m_pActFieldDescr = new OFieldDescription(_xColumn,sal_True);\n            \/\/ search for type\n            ::rtl::OUString sCreateParam(RTL_CONSTASCII_USTRINGPARAM(\"x\"));\n            sal_Bool bForce;\n            TOTypeInfoSP pTypeInfo = ::dbaui::getTypeInfoFromType(*pFieldControl->getTypeInfo(),nType,sTypeName,sCreateParam,nPrecision,nScale,bAutoIncrement,bForce);\n            if ( !pTypeInfo.get() )\n                pTypeInfo = pFieldControl->getDefaultTyp();\n\n            m_pActFieldDescr->FillFromTypeInfo(pTypeInfo,sal_True,sal_False);\n            m_xColumn = _xColumn;\n        }\n        pFieldControl->DisplayData(m_pActFieldDescr);\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OColumnPeer::setConnection(const Reference< XConnection>& _xCon)\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n    OColumnControlWindow* pFieldControl = static_cast<OColumnControlWindow*>( GetWindow() );\n    if ( pFieldControl )\n        pFieldControl->setConnection(_xCon);\n}\n\/\/------------------------------------------------------------------------------\nvoid OColumnPeer::setProperty( const ::rtl::OUString& _rPropertyName, const Any& Value) throw( RuntimeException )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    if ( 0 == _rPropertyName.compareToAscii( PROPERTY_COLUMN ) )\n    {\n        Reference<XPropertySet> xProp(Value,UNO_QUERY);\n        setColumn(xProp);\n    }\n    else if ( 0 == _rPropertyName.compareToAscii( PROPERTY_ACTIVECONNECTION ) )\n    {\n        Reference<XConnection> xCon(Value,UNO_QUERY);\n        setConnection(xCon);\n    }\n    else\n        VCLXWindow::setProperty(_rPropertyName,Value);\n}\n\/\/ -----------------------------------------------------------------------------\nAny OColumnPeer::getProperty( const ::rtl::OUString& _rPropertyName ) throw( RuntimeException )\n{\n    Any aProp;\n    OFieldDescControl* pFieldControl = static_cast<OFieldDescControl*>( GetWindow() );\n    if ( pFieldControl && 0 == _rPropertyName.compareToAscii( PROPERTY_COLUMN ) )\n    {\n        aProp <<= m_xColumn;\n    }\n    else if ( pFieldControl && 0 == _rPropertyName.compareToAscii( PROPERTY_ACTIVECONNECTION ) )\n    {\n        aProp <<= pFieldControl->getConnection();\n    }\n    else\n        aProp = VCLXWindow::getProperty(_rPropertyName);\n    return aProp;\n}\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n<commit_msg>INTEGRATION: CWS pchfix02 (1.7.52); FILE MERGED 2006\/09\/01 17:24:43 kaib 1.7.52.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ColumnPeer.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 07:32: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_dbaccess.hxx\"\n#ifndef DBAUI_COLUMNPEER_HXX\n#include \"ColumnPeer.hxx\"\n#endif\n#ifndef DBAUI_COLUMNCONTROLWINDOW_HXX\n#include \"ColumnControlWindow.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef DBAUI_FIELDDESCRIPTIONS_HXX\n#include \"FieldDescriptions.hxx\"\n#endif\n\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\nusing namespace ::com::sun::star::awt;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::sdbc;\n\nOColumnPeer::OColumnPeer(Window* _pParent,const Reference<XMultiServiceFactory>& _rxFactory)\n    :m_xORB(_rxFactory)\n    ,m_pActFieldDescr(NULL)\n{\n    osl_incrementInterlockedCount( &m_refCount );\n    {\n        OColumnControlWindow* pFieldControl = new OColumnControlWindow(_pParent,m_xORB);\n        pFieldControl->SetComponentInterface(this);\n        pFieldControl->Show();\n    }\n    osl_decrementInterlockedCount( &m_refCount );\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OColumnPeer::setEditWidth(sal_Int32 _nWidth)\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    OColumnControlWindow* pFieldControl = static_cast<OColumnControlWindow*>( GetWindow() );\n    if ( pFieldControl )\n    {\n        pFieldControl->setEditWidth(_nWidth);\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OColumnPeer::setColumn(const Reference< XPropertySet>& _xColumn)\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    OColumnControlWindow* pFieldControl = static_cast<OColumnControlWindow*>( GetWindow() );\n    if ( pFieldControl )\n    {\n        if ( m_pActFieldDescr )\n        {\n            delete m_pActFieldDescr;\n            m_pActFieldDescr = NULL;\n        }\n        if ( _xColumn.is() )\n        {\n            sal_Int32 nType         = 0;\n            sal_Int32 nScale        = 0;\n            sal_Int32 nPrecision    = 0;\n            sal_Bool bAutoIncrement = sal_False;\n            ::rtl::OUString sTypeName;\n\n            try\n            {\n                \/\/ get the properties from the column\n                _xColumn->getPropertyValue(PROPERTY_TYPENAME)       >>= sTypeName;\n                _xColumn->getPropertyValue(PROPERTY_TYPE)           >>= nType;\n                _xColumn->getPropertyValue(PROPERTY_SCALE)          >>= nScale;\n                _xColumn->getPropertyValue(PROPERTY_PRECISION)      >>= nPrecision;\n                _xColumn->getPropertyValue(PROPERTY_ISAUTOINCREMENT)    >>= bAutoIncrement;\n            }\n            catch(Exception)\n            {\n            }\n\n            m_pActFieldDescr = new OFieldDescription(_xColumn,sal_True);\n            \/\/ search for type\n            ::rtl::OUString sCreateParam(RTL_CONSTASCII_USTRINGPARAM(\"x\"));\n            sal_Bool bForce;\n            TOTypeInfoSP pTypeInfo = ::dbaui::getTypeInfoFromType(*pFieldControl->getTypeInfo(),nType,sTypeName,sCreateParam,nPrecision,nScale,bAutoIncrement,bForce);\n            if ( !pTypeInfo.get() )\n                pTypeInfo = pFieldControl->getDefaultTyp();\n\n            m_pActFieldDescr->FillFromTypeInfo(pTypeInfo,sal_True,sal_False);\n            m_xColumn = _xColumn;\n        }\n        pFieldControl->DisplayData(m_pActFieldDescr);\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OColumnPeer::setConnection(const Reference< XConnection>& _xCon)\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n    OColumnControlWindow* pFieldControl = static_cast<OColumnControlWindow*>( GetWindow() );\n    if ( pFieldControl )\n        pFieldControl->setConnection(_xCon);\n}\n\/\/------------------------------------------------------------------------------\nvoid OColumnPeer::setProperty( const ::rtl::OUString& _rPropertyName, const Any& Value) throw( RuntimeException )\n{\n    ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n    if ( 0 == _rPropertyName.compareToAscii( PROPERTY_COLUMN ) )\n    {\n        Reference<XPropertySet> xProp(Value,UNO_QUERY);\n        setColumn(xProp);\n    }\n    else if ( 0 == _rPropertyName.compareToAscii( PROPERTY_ACTIVECONNECTION ) )\n    {\n        Reference<XConnection> xCon(Value,UNO_QUERY);\n        setConnection(xCon);\n    }\n    else\n        VCLXWindow::setProperty(_rPropertyName,Value);\n}\n\/\/ -----------------------------------------------------------------------------\nAny OColumnPeer::getProperty( const ::rtl::OUString& _rPropertyName ) throw( RuntimeException )\n{\n    Any aProp;\n    OFieldDescControl* pFieldControl = static_cast<OFieldDescControl*>( GetWindow() );\n    if ( pFieldControl && 0 == _rPropertyName.compareToAscii( PROPERTY_COLUMN ) )\n    {\n        aProp <<= m_xColumn;\n    }\n    else if ( pFieldControl && 0 == _rPropertyName.compareToAscii( PROPERTY_ACTIVECONNECTION ) )\n    {\n        aProp <<= pFieldControl->getConnection();\n    }\n    else\n        aProp = VCLXWindow::getProperty(_rPropertyName);\n    return aProp;\n}\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <stack>\n#include <deque>\n#include <fstream>\n\nusing std::vector;\nusing std::stack;\nusing std::cout;\nusing std::cin;\nusing std::ifstream;\n\n\/****************************************************************\/\n\n\/* function prototypes *\/\nvoid read(vector<char> &i_vc, ifstream &is);\nvoid interp(vector<unsigned char> &cells, vector<char> &ivc);\nvector<char>::iterator skip_block(vector<char>::iterator i_it);\n\n\/****************************************************************\/\n\n\/* reads brainfuck code into memory \n *\/\nvoid read(vector<char> &i_vc, ifstream &is) {\n\tchar c;\n\tis.get(c);\n\twhile (!is.eof()) {\n\t\ti_vc.push_back(c);\n\t\tis.get(c);\n\t}\n}\n\n\/****************************************************************\/\n\n\/* interprets the brainfuck code, and performs the actions\n *\/\nvoid interp(vector<unsigned char> &cells, vector<char> &i_vc) {\n\tstack<vector<char>::iterator> block_front;\n\tauto c_it = cells.begin();\n\t\n\t\/\/ scan through the code character by character\n\tfor (auto i_it = i_vc.begin(); i_it != i_vc.end(); ++i_it) {\n\t\tif (*i_it == '>') {\n\t\t\t++c_it;\n\t\t} else if (*i_it == '<') {\n\t\t\t--c_it;\n\t\t} else if (*i_it == '+') {\n\t\t\t++(*c_it);\n\t\t} else if (*i_it == '-') {\n\t\t\t--(*c_it);\n\t\t} else if (*i_it == '.') {\n\t\t\tcout.put(*c_it);\n\t\t} else if (*i_it == ',') {\n\t\t\t*c_it = cin.get();\n\t\t} else if (*i_it == '[') {\n\t\t\tif (*c_it) {\n\t\t\t\tblock_front.push(i_it);\n\t\t\t} else {\n\t\t\t\ti_it = skip_block(i_it);\n\t\t\t}\n\t\t} else if (*i_it == ']') {\n\t\t\tif (*c_it) {\n\t\t\t\ti_it = block_front.top();\n\t\t\t} else {\n\t\t\t\tblock_front.pop();\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/****************************************************************\/\n\n\/* skips to the end of a block of brainfuck code, indicated via [ and ], and\n * returns an iterator to it\n *\/\nvector<char>::iterator skip_block(vector<char>::iterator i_it) {\n\tint count = 0;\n\tfor (++i_it; ; ++i_it) {\n\t\tif (*i_it == ']' && count == 0) {\n\t\t\treturn i_it;\n\t\t} else if (*i_it == ']') {\n\t\t\t--count;\n\t\t} else if (*i_it == '[') {\n\t\t\t++count;\n\t\t}\n\t}\n}\n\n\/****************************************************************\/\n\nint main() {\n\t\/\/ TODO - add options for other brainfuck code locations\n\t\/\/ TODO - improve interface\n\tconst int Cells = 30000;\n\tvector<unsigned char> cells(Cells, 0);\n\tvector<char> i_vc;\n\tifstream is(\"hello_world.b\");\n\tread(i_vc, is);\n\tinterp(cells, i_vc);\n\treturn 0;\n}\n\n<commit_msg>Improved interfacing and can now read brainfuck code from a target file.<commit_after>#include <iostream>\n#include <vector>\n#include <stack>\n#include <deque>\n#include <fstream>\n#include <cstdlib>\n\nusing std::vector;\nusing std::stack;\nusing std::cout;\nusing std::cin;\nusing std::ifstream;\n\n\/****************************************************************\/\n\n\/* function prototypes *\/\nvoid read(vector<char> &i_vc, ifstream &is);\nvoid interp(vector<unsigned char> &cells, vector<char> &ivc);\nvector<char>::iterator skip_block(vector<char>::iterator i_it);\n\n\/****************************************************************\/\n\n\/* reads brainfuck code into memory \n *\/\nvoid read(vector<char> &i_vc, ifstream &is) {\n\tchar c;\n\tis.get(c);\n\n\twhile (!is.eof()) {\n\t\ti_vc.push_back(c);\n\t\tis.get(c);\n\t}\n}\n\n\/****************************************************************\/\n\n\/* interprets the brainfuck code, and performs the actions\n *\/\nvoid interp(vector<unsigned char> &cells, vector<char> &i_vc) {\n\tstack<vector<char>::iterator> block_front;\n\tauto c_it = cells.begin();\n\t\n\t\/\/ scan through the code character by character\n\tfor (auto i_it = i_vc.begin(); i_it != i_vc.end(); ++i_it) {\n\t\tif (*i_it == '>') {\n\t\t\t++c_it;\n\t\t} else if (*i_it == '<') {\n\t\t\t--c_it;\n\t\t} else if (*i_it == '+') {\n\t\t\t++(*c_it);\n\t\t} else if (*i_it == '-') {\n\t\t\t--(*c_it);\n\t\t} else if (*i_it == '.') {\n\t\t\tcout.put(*c_it);\n\t\t} else if (*i_it == ',') {\n\t\t\t*c_it = cin.get();\n\t\t} else if (*i_it == '[') {\n\t\t\tif (*c_it) {\n\t\t\t\tblock_front.push(i_it);\n\t\t\t} else {\n\t\t\t\ti_it = skip_block(i_it);\n\t\t\t}\n\t\t} else if (*i_it == ']') {\n\t\t\tif (*c_it) {\n\t\t\t\ti_it = block_front.top();\n\t\t\t} else {\n\t\t\t\tblock_front.pop();\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/****************************************************************\/\n\n\/* skips to the end of a block of brainfuck code, indicated via [ and ], and\n * returns an iterator to it\n *\/\nvector<char>::iterator skip_block(vector<char>::iterator i_it) {\n\tint count = 0;\n\n\tfor (++i_it; ; ++i_it) {\n\t\tif (*i_it == ']' && count == 0) {\n\t\t\treturn i_it;\n\t\t} else if (*i_it == ']') {\n\t\t\t--count;\n\t\t} else if (*i_it == '[') {\n\t\t\t++count;\n\t\t}\n\t}\n}\n\n\/****************************************************************\/\n\nint main(int argc, char *argv[]) {\n\tconst int Cells = 30000;\n\tvector<unsigned char> cells(Cells, 0);\n\tvector<char> i_vc;\n\t\n\tif (argc < 2) {\n\t\t\/\/ no brainfuck file provided\n\t\tcout << \"Usage: function_prototype_extractor \"\n\t\t\t\"<input code file name>\\n\";\n\t\t\treturn EXIT_FAILURE;\n\t}\n\tifstream is(argv[1]);\n\tread(i_vc, is);\n\tinterp(cells, i_vc);\n\treturn 0;\n}\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#include <string>\n\n#include <stdint.h>\n#include <unistd.h>\n#include <signal.h>\n#include <sys\/poll.h>\n#include <sys\/socket.h>\n#include <sys\/uio.h>\n\n#include \"breakpad_googletest_includes.h\"\n#include \"client\/linux\/handler\/exception_handler.h\"\n#include \"client\/linux\/minidump_writer\/minidump_writer.h\"\n#include \"common\/linux\/eintr_wrapper.h\"\n#include \"common\/linux\/linux_libc_support.h\"\n#include \"third_party\/lss\/linux_syscall_support.h\"\n\nusing namespace google_breakpad;\n\nstatic void sigchld_handler(int signo) { }\n\nclass ExceptionHandlerTest : public ::testing::Test {\n protected:\n  void SetUp() {\n    \/\/ We need to be able to wait for children, so SIGCHLD cannot be SIG_IGN.\n    struct sigaction sa;\n    memset(&sa, 0, sizeof(sa));\n    sa.sa_handler = sigchld_handler;\n    ASSERT_NE(sigaction(SIGCHLD, &sa, &old_action), -1);\n  }\n\n  void TearDown() {\n    sigaction(SIGCHLD, &old_action, NULL);\n  }\n\n  struct sigaction old_action;\n};\n\nTEST(ExceptionHandlerTest, Simple) {\n  ExceptionHandler handler(\"\/tmp\", NULL, NULL, NULL, true);\n}\n\nstatic bool DoneCallback(const char* dump_path,\n                         const char* minidump_id,\n                         void* context,\n                         bool succeeded) {\n  if (!succeeded)\n    return succeeded;\n\n  int fd = (intptr_t) context;\n  uint32_t len = my_strlen(minidump_id);\n  HANDLE_EINTR(sys_write(fd, &len, sizeof(len)));\n  HANDLE_EINTR(sys_write(fd, minidump_id, len));\n  sys_close(fd);\n\n  return true;\n}\n\nTEST(ExceptionHandlerTest, ChildCrash) {\n  int fds[2];\n  ASSERT_NE(pipe(fds), -1);\n\n  const pid_t child = fork();\n  if (child == 0) {\n    close(fds[0]);\n    ExceptionHandler handler(\"\/tmp\", NULL, DoneCallback, (void*) fds[1],\n                             true);\n    *reinterpret_cast<int*>(NULL) = 0;\n  }\n  close(fds[1]);\n\n  int status;\n  ASSERT_NE(HANDLE_EINTR(waitpid(child, &status, 0)), -1);\n  ASSERT_TRUE(WIFSIGNALED(status));\n  ASSERT_EQ(WTERMSIG(status), SIGSEGV);\n\n  struct pollfd pfd;\n  memset(&pfd, 0, sizeof(pfd));\n  pfd.fd = fds[0];\n  pfd.events = POLLIN | POLLERR;\n\n  const int r = HANDLE_EINTR(poll(&pfd, 1, 0));\n  ASSERT_EQ(r, 1);\n  ASSERT_TRUE(pfd.revents & POLLIN);\n\n  uint32_t len;\n  ASSERT_EQ(read(fds[0], &len, sizeof(len)), (ssize_t)sizeof(len));\n  ASSERT_LT(len, (uint32_t)2048);\n  char* filename = reinterpret_cast<char*>(malloc(len + 1));\n  ASSERT_EQ(read(fds[0], filename, len), len);\n  filename[len] = 0;\n  close(fds[0]);\n\n  const std::string minidump_filename = std::string(\"\/tmp\/\") + filename +\n                                        \".dmp\";\n\n  struct stat st;\n  ASSERT_EQ(stat(minidump_filename.c_str(), &st), 0);\n  ASSERT_GT(st.st_size, 0u);\n  unlink(minidump_filename.c_str());\n}\n\nstatic const unsigned kControlMsgSize =\n    CMSG_SPACE(sizeof(int)) + CMSG_SPACE(sizeof(struct ucred));\n\nstatic bool\nCrashHandler(const void* crash_context, size_t crash_context_size,\n             void* context) {\n  const int fd = (intptr_t) context;\n  int fds[2];\n  pipe(fds);\n  struct kernel_msghdr msg = {0};\n  struct kernel_iovec iov;\n  iov.iov_base = const_cast<void*>(crash_context);\n  iov.iov_len = crash_context_size;\n  msg.msg_iov = &iov;\n  msg.msg_iovlen = 1;\n  char cmsg[kControlMsgSize];\n  memset(cmsg, 0, kControlMsgSize);\n  msg.msg_control = cmsg;\n  msg.msg_controllen = sizeof(cmsg);\n\n  struct cmsghdr *hdr = CMSG_FIRSTHDR(&msg);\n  hdr->cmsg_level = SOL_SOCKET;\n  hdr->cmsg_type = SCM_RIGHTS;\n  hdr->cmsg_len = CMSG_LEN(sizeof(int));\n  *((int*) CMSG_DATA(hdr)) = fds[1];\n  hdr = CMSG_NXTHDR((struct msghdr*) &msg, hdr);\n  hdr->cmsg_level = SOL_SOCKET;\n  hdr->cmsg_type = SCM_CREDENTIALS;\n  hdr->cmsg_len = CMSG_LEN(sizeof(struct ucred));\n  struct ucred *cred = reinterpret_cast<struct ucred*>(CMSG_DATA(hdr));\n  cred->uid = getuid();\n  cred->gid = getgid();\n  cred->pid = getpid();\n\n  HANDLE_EINTR(sys_sendmsg(fd, &msg, 0));\n  sys_close(fds[1]);\n\n  char b;\n  HANDLE_EINTR(sys_read(fds[0], &b, 1));\n\n  return true;\n}\n\nTEST(ExceptionHandlerTest, ExternalDumper) {\n  int fds[2];\n  ASSERT_NE(socketpair(AF_UNIX, SOCK_DGRAM, 0, fds), -1);\n  static const int on = 1;\n  setsockopt(fds[0], SOL_SOCKET, SO_PASSCRED, &on, sizeof(on));\n  setsockopt(fds[1], SOL_SOCKET, SO_PASSCRED, &on, sizeof(on));\n\n  const pid_t child = fork();\n  if (child == 0) {\n    close(fds[0]);\n    ExceptionHandler handler(\"\/tmp1\", NULL, NULL, (void*) fds[1], true);\n    handler.set_crash_handler(CrashHandler);\n    *reinterpret_cast<int*>(NULL) = 0;\n  }\n  close(fds[1]);\n  struct msghdr msg = {0};\n  struct iovec iov;\n  static const unsigned kCrashContextSize =\n      sizeof(ExceptionHandler::CrashContext);\n  char context[kCrashContextSize];\n  char control[kControlMsgSize];\n  iov.iov_base = context;\n  iov.iov_len = kCrashContextSize;\n  msg.msg_iov = &iov;\n  msg.msg_iovlen = 1;\n  msg.msg_control = control;\n  msg.msg_controllen = kControlMsgSize;\n\n  const ssize_t n = HANDLE_EINTR(recvmsg(fds[0], &msg, 0));\n  ASSERT_EQ(n, kCrashContextSize);\n  ASSERT_EQ(msg.msg_controllen, kControlMsgSize);\n  ASSERT_EQ(msg.msg_flags, 0);\n\n  pid_t crashing_pid = -1;\n  int signal_fd = -1;\n  for (struct cmsghdr *hdr = CMSG_FIRSTHDR(&msg); hdr;\n       hdr = CMSG_NXTHDR(&msg, hdr)) {\n    if (hdr->cmsg_level != SOL_SOCKET)\n      continue;\n    if (hdr->cmsg_type == SCM_RIGHTS) {\n      const unsigned len = hdr->cmsg_len -\n          (((uint8_t*)CMSG_DATA(hdr)) - (uint8_t*)hdr);\n      ASSERT_EQ(len, sizeof(int));\n      signal_fd = *((int *) CMSG_DATA(hdr));\n    } else if (hdr->cmsg_type == SCM_CREDENTIALS) {\n      const struct ucred *cred =\n          reinterpret_cast<struct ucred*>(CMSG_DATA(hdr));\n      crashing_pid = cred->pid;\n    }\n  }\n\n  ASSERT_NE(crashing_pid, -1);\n  ASSERT_NE(signal_fd, -1);\n\n  char templ[] = \"\/tmp\/exception-handler-unittest-XXXXXX\";\n  mktemp(templ);\n  ASSERT_TRUE(WriteMinidump(templ, crashing_pid, context,\n                            kCrashContextSize));\n  static const char b = 0;\n  HANDLE_EINTR(write(signal_fd, &b, 1));\n\n  int status;\n  ASSERT_NE(HANDLE_EINTR(waitpid(child, &status, 0)), -1);\n  ASSERT_TRUE(WIFSIGNALED(status));\n  ASSERT_EQ(WTERMSIG(status), SIGSEGV);\n\n  struct stat st;\n  ASSERT_EQ(stat(templ, &st), 0);\n  ASSERT_GT(st.st_size, 0u);\n  unlink(templ);\n}\n<commit_msg>Add a free() to ExceptionHandlerTest.ChildCrash. Review URL: http:\/\/breakpad.appspot.com\/193001<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#include <string>\n\n#include <stdint.h>\n#include <unistd.h>\n#include <signal.h>\n#include <sys\/poll.h>\n#include <sys\/socket.h>\n#include <sys\/uio.h>\n\n#include \"breakpad_googletest_includes.h\"\n#include \"client\/linux\/handler\/exception_handler.h\"\n#include \"client\/linux\/minidump_writer\/minidump_writer.h\"\n#include \"common\/linux\/eintr_wrapper.h\"\n#include \"common\/linux\/linux_libc_support.h\"\n#include \"third_party\/lss\/linux_syscall_support.h\"\n\nusing namespace google_breakpad;\n\nstatic void sigchld_handler(int signo) { }\n\nclass ExceptionHandlerTest : public ::testing::Test {\n protected:\n  void SetUp() {\n    \/\/ We need to be able to wait for children, so SIGCHLD cannot be SIG_IGN.\n    struct sigaction sa;\n    memset(&sa, 0, sizeof(sa));\n    sa.sa_handler = sigchld_handler;\n    ASSERT_NE(sigaction(SIGCHLD, &sa, &old_action), -1);\n  }\n\n  void TearDown() {\n    sigaction(SIGCHLD, &old_action, NULL);\n  }\n\n  struct sigaction old_action;\n};\n\nTEST(ExceptionHandlerTest, Simple) {\n  ExceptionHandler handler(\"\/tmp\", NULL, NULL, NULL, true);\n}\n\nstatic bool DoneCallback(const char* dump_path,\n                         const char* minidump_id,\n                         void* context,\n                         bool succeeded) {\n  if (!succeeded)\n    return succeeded;\n\n  int fd = (intptr_t) context;\n  uint32_t len = my_strlen(minidump_id);\n  HANDLE_EINTR(sys_write(fd, &len, sizeof(len)));\n  HANDLE_EINTR(sys_write(fd, minidump_id, len));\n  sys_close(fd);\n\n  return true;\n}\n\nTEST(ExceptionHandlerTest, ChildCrash) {\n  int fds[2];\n  ASSERT_NE(pipe(fds), -1);\n\n  const pid_t child = fork();\n  if (child == 0) {\n    close(fds[0]);\n    ExceptionHandler handler(\"\/tmp\", NULL, DoneCallback, (void*) fds[1],\n                             true);\n    *reinterpret_cast<int*>(NULL) = 0;\n  }\n  close(fds[1]);\n\n  int status;\n  ASSERT_NE(HANDLE_EINTR(waitpid(child, &status, 0)), -1);\n  ASSERT_TRUE(WIFSIGNALED(status));\n  ASSERT_EQ(WTERMSIG(status), SIGSEGV);\n\n  struct pollfd pfd;\n  memset(&pfd, 0, sizeof(pfd));\n  pfd.fd = fds[0];\n  pfd.events = POLLIN | POLLERR;\n\n  const int r = HANDLE_EINTR(poll(&pfd, 1, 0));\n  ASSERT_EQ(r, 1);\n  ASSERT_TRUE(pfd.revents & POLLIN);\n\n  uint32_t len;\n  ASSERT_EQ(read(fds[0], &len, sizeof(len)), (ssize_t)sizeof(len));\n  ASSERT_LT(len, (uint32_t)2048);\n  char* filename = reinterpret_cast<char*>(malloc(len + 1));\n  ASSERT_EQ(read(fds[0], filename, len), len);\n  filename[len] = 0;\n  close(fds[0]);\n\n  const std::string minidump_filename = std::string(\"\/tmp\/\") + filename +\n                                        \".dmp\";\n\n  struct stat st;\n  ASSERT_EQ(stat(minidump_filename.c_str(), &st), 0);\n  ASSERT_GT(st.st_size, 0u);\n  unlink(minidump_filename.c_str());\n  free(filename);\n}\n\nstatic const unsigned kControlMsgSize =\n    CMSG_SPACE(sizeof(int)) + CMSG_SPACE(sizeof(struct ucred));\n\nstatic bool\nCrashHandler(const void* crash_context, size_t crash_context_size,\n             void* context) {\n  const int fd = (intptr_t) context;\n  int fds[2];\n  pipe(fds);\n  struct kernel_msghdr msg = {0};\n  struct kernel_iovec iov;\n  iov.iov_base = const_cast<void*>(crash_context);\n  iov.iov_len = crash_context_size;\n  msg.msg_iov = &iov;\n  msg.msg_iovlen = 1;\n  char cmsg[kControlMsgSize];\n  memset(cmsg, 0, kControlMsgSize);\n  msg.msg_control = cmsg;\n  msg.msg_controllen = sizeof(cmsg);\n\n  struct cmsghdr *hdr = CMSG_FIRSTHDR(&msg);\n  hdr->cmsg_level = SOL_SOCKET;\n  hdr->cmsg_type = SCM_RIGHTS;\n  hdr->cmsg_len = CMSG_LEN(sizeof(int));\n  *((int*) CMSG_DATA(hdr)) = fds[1];\n  hdr = CMSG_NXTHDR((struct msghdr*) &msg, hdr);\n  hdr->cmsg_level = SOL_SOCKET;\n  hdr->cmsg_type = SCM_CREDENTIALS;\n  hdr->cmsg_len = CMSG_LEN(sizeof(struct ucred));\n  struct ucred *cred = reinterpret_cast<struct ucred*>(CMSG_DATA(hdr));\n  cred->uid = getuid();\n  cred->gid = getgid();\n  cred->pid = getpid();\n\n  HANDLE_EINTR(sys_sendmsg(fd, &msg, 0));\n  sys_close(fds[1]);\n\n  char b;\n  HANDLE_EINTR(sys_read(fds[0], &b, 1));\n\n  return true;\n}\n\nTEST(ExceptionHandlerTest, ExternalDumper) {\n  int fds[2];\n  ASSERT_NE(socketpair(AF_UNIX, SOCK_DGRAM, 0, fds), -1);\n  static const int on = 1;\n  setsockopt(fds[0], SOL_SOCKET, SO_PASSCRED, &on, sizeof(on));\n  setsockopt(fds[1], SOL_SOCKET, SO_PASSCRED, &on, sizeof(on));\n\n  const pid_t child = fork();\n  if (child == 0) {\n    close(fds[0]);\n    ExceptionHandler handler(\"\/tmp1\", NULL, NULL, (void*) fds[1], true);\n    handler.set_crash_handler(CrashHandler);\n    *reinterpret_cast<int*>(NULL) = 0;\n  }\n  close(fds[1]);\n  struct msghdr msg = {0};\n  struct iovec iov;\n  static const unsigned kCrashContextSize =\n      sizeof(ExceptionHandler::CrashContext);\n  char context[kCrashContextSize];\n  char control[kControlMsgSize];\n  iov.iov_base = context;\n  iov.iov_len = kCrashContextSize;\n  msg.msg_iov = &iov;\n  msg.msg_iovlen = 1;\n  msg.msg_control = control;\n  msg.msg_controllen = kControlMsgSize;\n\n  const ssize_t n = HANDLE_EINTR(recvmsg(fds[0], &msg, 0));\n  ASSERT_EQ(n, kCrashContextSize);\n  ASSERT_EQ(msg.msg_controllen, kControlMsgSize);\n  ASSERT_EQ(msg.msg_flags, 0);\n\n  pid_t crashing_pid = -1;\n  int signal_fd = -1;\n  for (struct cmsghdr *hdr = CMSG_FIRSTHDR(&msg); hdr;\n       hdr = CMSG_NXTHDR(&msg, hdr)) {\n    if (hdr->cmsg_level != SOL_SOCKET)\n      continue;\n    if (hdr->cmsg_type == SCM_RIGHTS) {\n      const unsigned len = hdr->cmsg_len -\n          (((uint8_t*)CMSG_DATA(hdr)) - (uint8_t*)hdr);\n      ASSERT_EQ(len, sizeof(int));\n      signal_fd = *((int *) CMSG_DATA(hdr));\n    } else if (hdr->cmsg_type == SCM_CREDENTIALS) {\n      const struct ucred *cred =\n          reinterpret_cast<struct ucred*>(CMSG_DATA(hdr));\n      crashing_pid = cred->pid;\n    }\n  }\n\n  ASSERT_NE(crashing_pid, -1);\n  ASSERT_NE(signal_fd, -1);\n\n  char templ[] = \"\/tmp\/exception-handler-unittest-XXXXXX\";\n  mktemp(templ);\n  ASSERT_TRUE(WriteMinidump(templ, crashing_pid, context,\n                            kCrashContextSize));\n  static const char b = 0;\n  HANDLE_EINTR(write(signal_fd, &b, 1));\n\n  int status;\n  ASSERT_NE(HANDLE_EINTR(waitpid(child, &status, 0)), -1);\n  ASSERT_TRUE(WIFSIGNALED(status));\n  ASSERT_EQ(WTERMSIG(status), SIGSEGV);\n\n  struct stat st;\n  ASSERT_EQ(stat(templ, &st), 0);\n  ASSERT_GT(st.st_size, 0u);\n  unlink(templ);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-c++-*- VirtualPlanetBuilder - Copyright (C) 1998-2007 Robert Osfield \n *\n * This application is open source and may be redistributed and\/or modified   \n * freely and without restriction, both in commericial and non commericial applications,\n * as long as this copyright notice is maintained.\n * \n * This application is distributed in the hope 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*\/\n\n\n#include <osgDB\/FileUtils>\n#include <osgDB\/ReadFile>\n#include <osgDB\/WriteFile>\n#include <osgDB\/Registry>\n#include <osgDB\/FileNameUtils>\n\n#include <iostream>\n#include <sstream>\n\n#include <curl\/curl.h>\n#include <curl\/types.h>\n\n\nclass ReaderWriterCURL : public osgDB::ReaderWriter\n{\n    public:\n    \n        static size_t StreamMemoryCallback(void *ptr, size_t size, size_t nmemb, void *data)\n        {\n            size_t realsize = size * nmemb;\n            std::ostream* buffer = (std::ostream*)data;\n\n            buffer->write((const char*)ptr, realsize);\n\n            return realsize;\n        }\n\n\n        ReaderWriterCURL()\n        {\n            _curl = curl_easy_init();\n            \n            curl_easy_setopt(_curl, CURLOPT_USERAGENT, \"libcurl-agent\/1.0\");            \n            curl_easy_setopt(_curl, CURLOPT_WRITEFUNCTION, StreamMemoryCallback);\n        }\n      \n        ~ReaderWriterCURL()\n        {\n            if (_curl) curl_easy_cleanup(_curl);\n            \n            _curl = 0;\n        }\n\n        virtual const char* className() const { return \"HTTP Protocol Model Reader\"; }\n                                                                                            \n        virtual bool acceptsExtension(const std::string& extension) const\n        {\n            return osgDB::equalCaseInsensitive(extension,\"curl\");\n        }\n\n        enum ObjectType\n        {\n            OBJECT,\n            ARCHIVE,\n            IMAGE,\n            HEIGHTFIELD,\n            NODE\n        };\n                                                                                            \n        virtual ReadResult openArchive(const std::string& fileName,ArchiveStatus status, unsigned int , const Options* options) const\n        {\n            if (status!=READ) return ReadResult(ReadResult::FILE_NOT_HANDLED);\n            else return readFile(ARCHIVE,fileName,options);\n        }\n\n        virtual ReadResult readObject(const std::string& fileName, const Options* options) const\n        {\n            return readFile(OBJECT,fileName,options);\n        }\n                                                                                            \n        virtual ReadResult readImage(const std::string& fileName, const Options *options) const\n        {\n            return readFile(IMAGE,fileName,options);\n        }\n\n        virtual ReadResult readHeightField(const std::string& fileName, const Options *options) const\n        {\n            return readFile(HEIGHTFIELD,fileName,options);\n        }\n\n        virtual ReadResult readNode(const std::string& fileName, const Options *options) const\n        {\n            return readFile(NODE,fileName,options);\n        }\n\n        ReadResult readFile(ObjectType objectType, osgDB::ReaderWriter* rw, std::istream& fin, const Options *options) const\n        {\n            switch(objectType)\n            {\n            case(OBJECT): return rw->readObject(fin,options);\n            case(ARCHIVE): return rw->openArchive(fin,options);\n            case(IMAGE): return rw->readImage(fin,options);\n            case(HEIGHTFIELD): return rw->readHeightField(fin,options);\n            case(NODE): return rw->readNode(fin,options);\n            default: break;\n            }\n            return ReadResult::FILE_NOT_HANDLED;\n        }\n\n        virtual ReadResult readFile(ObjectType objectType, const std::string& fullFileName, const Options *options) const\n        {\n            std::string cacheFilePath, cacheFileName;\n            std::string proxyAddress, optProxy, optProxyPort;\n\n            if (options)\n            {\n                std::istringstream iss(options->getOptionString());\n                std::string opt;\n                while (iss >> opt) \n                {\n                    int index = opt.find( \"=\" );\n                    if( opt.substr( 0, index ) == \"OSG_FILE_CACHE\" )\n                        cacheFilePath = opt.substr( index+1 ); \/\/Setting Cache Directory by OSG Options\n                    else if( opt.substr( 0, index ) == \"OSG_CURL_PROXY\" )\n                        optProxy = opt.substr( index+1 );\n                    else if( opt.substr( 0, index ) == \"OSG_CURL_PROXYPORT\" )\n                        optProxyPort = opt.substr( index+1 );\n                }\n\n                \/\/Setting Proxy by OSG Options\n                if(!optProxy.empty())\n                    if(!optProxyPort.empty())\n                        proxyAddress = optProxy + \":\" + optProxyPort;\n                    else\n                        proxyAddress = optProxy + \":8080\"; \/\/Port not found, using default\n            }\n\n            if (!osgDB::containsServerAddress(fullFileName)) \n            {\n                if (options && !(options->getDatabasePathList().empty()))\n                {\n                    if (osgDB::containsServerAddress(options->getDatabasePathList().front()))\n                    {\n                        std::string newFileName = options->getDatabasePathList().front() + \"\/\" + fullFileName;\n                        \n                        return readFile(objectType, newFileName,options);\n                    }\n                }\n\n                return ReadResult::FILE_NOT_HANDLED;\n            }\n\n            std::string fileName;\n            std::string ext = osgDB::getFileExtension(fullFileName);\n            if (ext==\"curl\")\n            {\n                fileName = osgDB::getNameLessExtension(fullFileName);\n            }\n            else\n            {\n                fileName = fullFileName;\n            }\n\n            osgDB::ReaderWriter *reader = \n                osgDB::Registry::instance()->getReaderWriterForExtension( osgDB::getFileExtension(fileName));\n                \n            if (!reader)\n            {\n                osg::notify(osg::NOTICE)<<\"Error: No ReaderWriter for file \"<<fileName<<std::endl;\n                return ReadResult::FILE_NOT_HANDLED;\n            }\n\n            \/\/Getting CURL Environment Variables (If found rewrite OSG Options)\n            const char* fileCachePath = getenv(\"OSG_FILE_CACHE\");\n            if (fileCachePath) \/\/Env Cache Directory\n                cacheFilePath = std::string(fileCachePath);\n\n            if (!cacheFilePath.empty())\n            {\n                cacheFileName = cacheFilePath + \"\/\" + \n                                osgDB::getServerAddress(fileName) + \"\/\" + \n                                osgDB::getServerFileName(fileName);\n            }\n                                                        \n            if (!cacheFilePath.empty() && osgDB::fileExists(cacheFileName))\n            {\n                osg::notify(osg::NOTICE) << \"Reading cache file \" << cacheFileName << std::endl;\n                return osgDB::Registry::instance()->readObject(cacheFileName,options);\n            }\n\n            const char* proxyEnvAddress = getenv(\"OSG_CURL_PROXY\");\n            if (proxyEnvAddress) \/\/Env Proxy Settings\n            {\n                const char* proxyEnvPort = getenv(\"OSG_CURL_PROXYPORT\"); \/\/Searching Proxy Port on Env\n\n                if(proxyEnvPort)\n                    proxyAddress = std::string(proxyEnvAddress) + \":\" + std::string(proxyEnvPort);\n                else\n                    proxyAddress = std::string(proxyEnvAddress) + \":8080\"; \/\/Default\n            }\n\n            if(!proxyAddress.empty())\n            {\n                osg::notify(osg::NOTICE)<<\"Setting proxy: \"<<proxyAddress<<std::endl;\n                curl_easy_setopt(_curl, CURLOPT_PROXY, proxyAddress.c_str()); \/\/Sets proxy address and port on libcurl\n            }\n\n            std::stringstream buffer;\n\n            curl_easy_setopt(_curl, CURLOPT_URL, fileName.c_str());\n            curl_easy_setopt(_curl, CURLOPT_WRITEDATA, (void *)&buffer);\n\n            CURLcode res = curl_easy_perform(_curl);\n            \n\n            curl_easy_setopt(_curl, CURLOPT_WRITEDATA, (void *)0);\n        \n            if (res==0)\n            {\n\n\n                osg::ref_ptr<Options> local_opt = const_cast<Options*>(options);\n                if (!local_opt) local_opt = new Options;\n\n                local_opt->getDatabasePathList().push_front(osgDB::getFilePath(fileName));\n\n                ReadResult readResult = readFile(objectType, reader, buffer, local_opt.get() );\n                \n                local_opt->getDatabasePathList().pop_front();\n\n                if (!cacheFilePath.empty() && readResult.validObject())\n                {\n                    osg::notify(osg::NOTICE)<<\"Writing cache file \"<<cacheFileName<<std::endl;\n                    \n                    std::string filePath = osgDB::getFilePath(cacheFileName);\n                    if (!osgDB::fileExists(filePath))\n                    {\n                        osg::notify(osg::NOTICE)<<\"Creating directory \"<<filePath<<std::endl;\n                        if (osgDB::makeDirectory(filePath))\n                        {\n                            osg::notify(osg::NOTICE)<<\"   Created directory\"<<std::endl;\n                        }\n                        else\n                        {\n                            osg::notify(osg::NOTICE)<<\"   Failed\"<<std::endl;\n                        }\n                    }\n                    \n                    switch(objectType)\n                    {\n                    case(OBJECT): osgDB::writeObjectFile( *(readResult.getObject()), cacheFileName ); break;\n                    case(IMAGE): osgDB::writeImageFile( *(readResult.getImage()), cacheFileName ); break;\n                    case(HEIGHTFIELD): osgDB::writeHeightFieldFile( *(readResult.getHeightField()), cacheFileName ); break;\n                    case(NODE): osgDB::writeNodeFile( *(readResult.getNode()), cacheFileName ); break;\n                    default: break;\n                    }\n\n                }\n\n                return readResult;\n            }\n            else\n            {\n                osg::notify(osg::NOTICE)<<\"Error: libcurl read error, file=\"<<fileName<<\" result = \"<<res<<std::endl;\n                return ReadResult::FILE_NOT_HANDLED;\n            }\n        }\n        \n    protected:\n        \n        CURL* _curl;\n        \n};\n\n\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nREGISTER_OSGPLUGIN(rgb, ReaderWriterCURL)\n<commit_msg>Improved the error capture and reporting<commit_after>\/* -*-c++-*- VirtualPlanetBuilder - Copyright (C) 1998-2007 Robert Osfield \n *\n * This application is open source and may be redistributed and\/or modified   \n * freely and without restriction, both in commericial and non commericial applications,\n * as long as this copyright notice is maintained.\n * \n * This application is distributed in the hope 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*\/\n\n\n#include <osgDB\/FileUtils>\n#include <osgDB\/ReadFile>\n#include <osgDB\/WriteFile>\n#include <osgDB\/Registry>\n#include <osgDB\/FileNameUtils>\n\n#include <iostream>\n#include <sstream>\n\n#include <curl\/curl.h>\n#include <curl\/types.h>\n\n\nclass ReaderWriterCURL : public osgDB::ReaderWriter\n{\n    public:\n    \n        static size_t StreamMemoryCallback(void *ptr, size_t size, size_t nmemb, void *data)\n        {\n            size_t realsize = size * nmemb;\n            std::ostream* buffer = (std::ostream*)data;\n\n            buffer->write((const char*)ptr, realsize);\n\n            return realsize;\n        }\n\n\n        ReaderWriterCURL()\n        {\n            _curl = curl_easy_init();\n            \n            curl_easy_setopt(_curl, CURLOPT_USERAGENT, \"libcurl-agent\/1.0\");            \n            curl_easy_setopt(_curl, CURLOPT_WRITEFUNCTION, StreamMemoryCallback);\n        }\n      \n        ~ReaderWriterCURL()\n        {\n            if (_curl) curl_easy_cleanup(_curl);\n            \n            _curl = 0;\n        }\n\n        virtual const char* className() const { return \"HTTP Protocol Model Reader\"; }\n                                                                                            \n        virtual bool acceptsExtension(const std::string& extension) const\n        {\n            return osgDB::equalCaseInsensitive(extension,\"curl\");\n        }\n\n        enum ObjectType\n        {\n            OBJECT,\n            ARCHIVE,\n            IMAGE,\n            HEIGHTFIELD,\n            NODE\n        };\n                                                                                            \n        virtual ReadResult openArchive(const std::string& fileName,ArchiveStatus status, unsigned int , const Options* options) const\n        {\n            if (status!=READ) return ReadResult(ReadResult::FILE_NOT_HANDLED);\n            else return readFile(ARCHIVE,fileName,options);\n        }\n\n        virtual ReadResult readObject(const std::string& fileName, const Options* options) const\n        {\n            return readFile(OBJECT,fileName,options);\n        }\n                                                                                            \n        virtual ReadResult readImage(const std::string& fileName, const Options *options) const\n        {\n            return readFile(IMAGE,fileName,options);\n        }\n\n        virtual ReadResult readHeightField(const std::string& fileName, const Options *options) const\n        {\n            return readFile(HEIGHTFIELD,fileName,options);\n        }\n\n        virtual ReadResult readNode(const std::string& fileName, const Options *options) const\n        {\n            return readFile(NODE,fileName,options);\n        }\n\n        ReadResult readFile(ObjectType objectType, osgDB::ReaderWriter* rw, std::istream& fin, const Options *options) const\n        {\n            switch(objectType)\n            {\n            case(OBJECT): return rw->readObject(fin,options);\n            case(ARCHIVE): return rw->openArchive(fin,options);\n            case(IMAGE): return rw->readImage(fin,options);\n            case(HEIGHTFIELD): return rw->readHeightField(fin,options);\n            case(NODE): return rw->readNode(fin,options);\n            default: break;\n            }\n            return ReadResult::FILE_NOT_HANDLED;\n        }\n\n        virtual ReadResult readFile(ObjectType objectType, const std::string& fullFileName, const Options *options) const\n        {\n            std::string cacheFilePath, cacheFileName;\n            std::string proxyAddress, optProxy, optProxyPort;\n\n            if (options)\n            {\n                std::istringstream iss(options->getOptionString());\n                std::string opt;\n                while (iss >> opt) \n                {\n                    int index = opt.find( \"=\" );\n                    if( opt.substr( 0, index ) == \"OSG_FILE_CACHE\" )\n                        cacheFilePath = opt.substr( index+1 ); \/\/Setting Cache Directory by OSG Options\n                    else if( opt.substr( 0, index ) == \"OSG_CURL_PROXY\" )\n                        optProxy = opt.substr( index+1 );\n                    else if( opt.substr( 0, index ) == \"OSG_CURL_PROXYPORT\" )\n                        optProxyPort = opt.substr( index+1 );\n                }\n\n                \/\/Setting Proxy by OSG Options\n                if(!optProxy.empty())\n                    if(!optProxyPort.empty())\n                        proxyAddress = optProxy + \":\" + optProxyPort;\n                    else\n                        proxyAddress = optProxy + \":8080\"; \/\/Port not found, using default\n            }\n\n            if (!osgDB::containsServerAddress(fullFileName)) \n            {\n                if (options && !(options->getDatabasePathList().empty()))\n                {\n                    if (osgDB::containsServerAddress(options->getDatabasePathList().front()))\n                    {\n                        std::string newFileName = options->getDatabasePathList().front() + \"\/\" + fullFileName;\n                        \n                        return readFile(objectType, newFileName,options);\n                    }\n                }\n\n                return ReadResult::FILE_NOT_HANDLED;\n            }\n\n            std::string fileName;\n            std::string ext = osgDB::getFileExtension(fullFileName);\n            if (ext==\"curl\")\n            {\n                fileName = osgDB::getNameLessExtension(fullFileName);\n            }\n            else\n            {\n                fileName = fullFileName;\n            }\n\n            osgDB::ReaderWriter *reader = \n                osgDB::Registry::instance()->getReaderWriterForExtension( osgDB::getFileExtension(fileName));\n                \n            if (!reader)\n            {\n                osg::notify(osg::NOTICE)<<\"Error: No ReaderWriter for file \"<<fileName<<std::endl;\n                return ReadResult::FILE_NOT_HANDLED;\n            }\n\n            \/\/Getting CURL Environment Variables (If found rewrite OSG Options)\n            const char* fileCachePath = getenv(\"OSG_FILE_CACHE\");\n            if (fileCachePath) \/\/Env Cache Directory\n                cacheFilePath = std::string(fileCachePath);\n\n            if (!cacheFilePath.empty())\n            {\n                cacheFileName = cacheFilePath + \"\/\" + \n                                osgDB::getServerAddress(fileName) + \"\/\" + \n                                osgDB::getServerFileName(fileName);\n            }\n                                                        \n            if (!cacheFilePath.empty() && osgDB::fileExists(cacheFileName))\n            {\n                osg::notify(osg::INFO) << \"Reading cache file \" << cacheFileName << std::endl;\n                ReadResult result = osgDB::Registry::instance()->readObject(cacheFileName,options);\n                return result;                \n            }\n\n            const char* proxyEnvAddress = getenv(\"OSG_CURL_PROXY\");\n            if (proxyEnvAddress) \/\/Env Proxy Settings\n            {\n                const char* proxyEnvPort = getenv(\"OSG_CURL_PROXYPORT\"); \/\/Searching Proxy Port on Env\n\n                if(proxyEnvPort)\n                    proxyAddress = std::string(proxyEnvAddress) + \":\" + std::string(proxyEnvPort);\n                else\n                    proxyAddress = std::string(proxyEnvAddress) + \":8080\"; \/\/Default\n            }\n\n            if(!proxyAddress.empty())\n            {\n                osg::notify(osg::NOTICE)<<\"Setting proxy: \"<<proxyAddress<<std::endl;\n                curl_easy_setopt(_curl, CURLOPT_PROXY, proxyAddress.c_str()); \/\/Sets proxy address and port on libcurl\n            }\n\n            std::stringstream buffer;\n\n            curl_easy_setopt(_curl, CURLOPT_URL, fileName.c_str());\n            curl_easy_setopt(_curl, CURLOPT_WRITEDATA, (void *)&buffer);\n\n            CURLcode res = curl_easy_perform(_curl);\n            \n\n            curl_easy_setopt(_curl, CURLOPT_WRITEDATA, (void *)0);\n        \n            if (res==0)\n            {\n                long code;\n                if(!proxyAddress.empty())\n                {\n                    curl_easy_getinfo(_curl, CURLINFO_HTTP_CONNECTCODE, &code);\n                }\n                else\n                {\n                    curl_easy_getinfo(_curl, CURLINFO_RESPONSE_CODE, &code);                    \n                }\n                \n                if (code>=400)\n                {\n                    osg::notify(osg::NOTICE)<<\"Error: libcurl read error, file=\"<<fileName<<\", error code = \"<<code<<std::endl;\n                    return ReadResult::FILE_NOT_FOUND;\n                }\n\n                osg::ref_ptr<Options> local_opt = const_cast<Options*>(options);\n                if (!local_opt) local_opt = new Options;\n\n                local_opt->getDatabasePathList().push_front(osgDB::getFilePath(fileName));\n\n                ReadResult readResult = readFile(objectType, reader, buffer, local_opt.get() );\n\n                local_opt->getDatabasePathList().pop_front();\n\n                if (!cacheFilePath.empty() && readResult.validObject())\n                {\n                    osg::notify(osg::INFO)<<\"Writing cache file \"<<cacheFileName<<std::endl;\n                    \n                    std::string filePath = osgDB::getFilePath(cacheFileName);\n                    if (osgDB::fileExists(filePath) || osgDB::makeDirectory(filePath))\n                    {\n                        switch(objectType)\n                        {\n                        case(OBJECT): osgDB::writeObjectFile( *(readResult.getObject()), cacheFileName ); break;\n                        case(IMAGE): osgDB::writeImageFile( *(readResult.getImage()), cacheFileName ); break;\n                        case(HEIGHTFIELD): osgDB::writeHeightFieldFile( *(readResult.getHeightField()), cacheFileName ); break;\n                        case(NODE): osgDB::writeNodeFile( *(readResult.getNode()), cacheFileName ); break;\n                        default: break;\n                        }\n                    }\n                    else\n                    {\n                        osg::notify(osg::NOTICE)<<\"Error: Failed to created directory \"<<filePath<<std::endl;\n                    }\n\n                }\n\n                return readResult;\n            }\n            else\n            {\n                osg::notify(osg::NOTICE)<<\"Error: libcurl read error, file=\"<<fileName<<\" error = \"<<curl_easy_strerror(res)<<std::endl;\n                return ReadResult::FILE_NOT_HANDLED;\n            }\n        }\n        \n    protected:\n        \n        CURL* _curl;\n        \n};\n\n\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nREGISTER_OSGPLUGIN(rgb, ReaderWriterCURL)\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This Source Code Form is licensed MPL-2.0: http:\/\/mozilla.org\/MPL\/2.0\n\n#include <websocketpp\/config\/asio_no_tls.hpp>\n#include <websocketpp\/server.hpp>\ntypedef websocketpp::server<websocketpp::config::asio> server;\n\n#include <jsonipc\/jsonipc.hh>\n\n#include <bse\/bse.hh>\n#include <bse\/platform.hh>\n#include <bse\/regex.hh>\n\n#undef B0 \/\/ pollution from termios.h\n\nstatic Bse::ServerH bse_server;\nstatic const bool verbose = false;\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 std::string\nhandle_jsonipc (const std::string &message, const websocketpp::connection_hdl &hdl)\n{\n  static Jsonipc::IpcDispatcher jd;\n  const ptrdiff_t conid = ptrdiff_t (websocket_server.get_con_from_hdl (hdl).get());\n  if (verbose)\n    Bse::printerr (\"%p: REQUEST: %s\\n\", conid, message);\n  const std::string reply = jd.dispatch_message (message);\n  if (verbose)\n    Bse::printerr (\"%p: REPLY:   %s\\n\", conid, reply);\n  return reply;\n}\n\nstatic std::string\nuser_agent_nick (const std::string &useragent)\n{\n  using namespace Bse;\n  std::string nick;\n  if      (Re::search (R\"(\\bFirefox\/)\", useragent))\n    nick += \"Firefox\";\n  else if (Re::search (R\"(\\bElectron\/)\", useragent))\n    nick += \"Electron\";\n  else if (Re::search (R\"(\\bChrome\/)\", useragent))\n    nick += \"Chrome\";\n  else if (Re::search (R\"(\\bSafari\/)\", useragent))\n    nick += \"Safari\";\n  else\n    nick += \"Unknown\";\n  return nick;\n}\n\nstatic bool\nws_open_connection (websocketpp::connection_hdl hdl)\n{\n  ServerEndpoint::connection_ptr con = websocket_server.get_con_from_hdl (hdl);\n  \/\/ https:\/\/github.com\/zaphoyd\/websocketpp\/issues\/694#issuecomment-454623641\n  const auto &socket = con->get_raw_socket();\n  const auto &address = socket.remote_endpoint().address();\n  const int rport = socket.remote_endpoint().port();\n  const websocketpp::http::parser::request &rq = con->get_request();\n  const websocketpp::http::parser::header_list &headermap = rq.get_headers();\n  std::string useragent;\n  for (auto it : headermap) \/\/ request headers\n    if (it.first == \"User-Agent\")\n      useragent = it.second;\n  std::string nick = user_agent_nick (useragent);\n  if (!nick.empty())\n    nick = \"(\" + nick + \")\";\n  using namespace Bse::AnsiColors;\n  auto B1 = color (BOLD);\n  auto B0 = color (BOLD_OFF);\n  Bse::printout (\"%p: %sACCEPT:%s %s:%d\/ %s\\n\", ptrdiff_t (con.get()), B1, B0, address.to_string().c_str(), rport, nick);\n  \/\/ Bse::printout (\"User-Agent: %s\\n\", useragent);\n  return true;\n}\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    std::string reply = handle_jsonipc (message, con);\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\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\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_open_handler (&ws_open_connection);\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  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<commit_msg>BSE: beast-sound-engine: require (example) auth string for connections<commit_after>\/\/ This Source Code Form is licensed MPL-2.0: http:\/\/mozilla.org\/MPL\/2.0\n\n#include <websocketpp\/config\/asio_no_tls.hpp>\n#include <websocketpp\/server.hpp>\ntypedef websocketpp::server<websocketpp::config::asio> server;\n\n#include <jsonipc\/jsonipc.hh>\n\n#include <bse\/bse.hh>\n#include <bse\/platform.hh>\n#include <bse\/regex.hh>\n\n#undef B0 \/\/ pollution from termios.h\n\nstatic Bse::ServerH bse_server;\nstatic const bool verbose = false;\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 std::string\nhandle_jsonipc (const std::string &message, const websocketpp::connection_hdl &hdl)\n{\n  static Jsonipc::IpcDispatcher jd;\n  const ptrdiff_t conid = ptrdiff_t (websocket_server.get_con_from_hdl (hdl).get());\n  if (verbose)\n    Bse::printerr (\"%p: REQUEST: %s\\n\", conid, message);\n  const std::string reply = jd.dispatch_message (message);\n  if (verbose)\n    Bse::printerr (\"%p: REPLY:   %s\\n\", conid, reply);\n  return reply;\n}\n\nstatic std::string\nuser_agent_nick (const std::string &useragent)\n{\n  using namespace Bse;\n  std::string nick;\n  if      (Re::search (R\"(\\bFirefox\/)\", useragent))\n    nick += \"Firefox\";\n  else if (Re::search (R\"(\\bElectron\/)\", useragent))\n    nick += \"Electron\";\n  else if (Re::search (R\"(\\bChrome\/)\", useragent))\n    nick += \"Chrome\";\n  else if (Re::search (R\"(\\bSafari\/)\", useragent))\n    nick += \"Safari\";\n  else\n    nick += \"Unknown\";\n  return nick;\n}\n\nstatic bool\nws_validate_connection (websocketpp::connection_hdl hdl)\n{\n  ServerEndpoint::connection_ptr con = websocket_server.get_con_from_hdl (hdl);\n  \/\/ using subprotocol as auth string\n  const std::vector<std::string> &subprotocols = con->get_requested_subprotocols();\n  if (subprotocols.size() == 1)\n    {\n      if (subprotocols[0] == \"auth123\")\n        {\n          con->select_subprotocol (subprotocols[0]);\n          return true;\n        }\n    }\n  return false;\n}\n\nstatic void\nws_open_connection (websocketpp::connection_hdl hdl)\n{\n  ServerEndpoint::connection_ptr con = websocket_server.get_con_from_hdl (hdl);\n  \/\/ https:\/\/github.com\/zaphoyd\/websocketpp\/issues\/694#issuecomment-454623641\n  const auto &socket = con->get_raw_socket();\n  const auto &address = socket.remote_endpoint().address();\n  const int rport = socket.remote_endpoint().port();\n  const websocketpp::http::parser::request &rq = con->get_request();\n  const websocketpp::http::parser::header_list &headermap = rq.get_headers();\n  std::string useragent;\n  for (auto it : headermap) \/\/ request headers\n    if (it.first == \"User-Agent\")\n      useragent = it.second;\n  std::string nick = user_agent_nick (useragent);\n  if (!nick.empty())\n    nick = \"(\" + nick + \")\";\n  using namespace Bse::AnsiColors;\n  auto B1 = color (BOLD);\n  auto B0 = color (BOLD_OFF);\n  Bse::printout (\"%p: %sACCEPT:%s %s:%d\/ %s\\n\", ptrdiff_t (con.get()), B1, B0, address.to_string().c_str(), rport, nick);\n  \/\/ Bse::printout (\"User-Agent: %s\\n\", useragent);\n}\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    std::string reply = handle_jsonipc (message, con);\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\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\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_validate_handler (&ws_validate_connection);\n  websocket_server.set_open_handler (&ws_open_connection);\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  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>#include \"drake\/systems\/n_ary_system.h\"\n\n#include <memory>\n#include <stdexcept>\n\n#include <Eigen\/Dense>\n#include \"gtest\/gtest.h\"\n\n#include \"drake\/core\/Vector.h\"\n#include \"drake\/systems\/cascade_system.h\"\n\nnamespace {\n\nusing Drake::NullVector;\nusing Drake::toEigen;\nusing drake::NAryState;\nusing drake::NArySystem;\n\n\/\/ Vector-concept class for exercising composition.\ntemplate <typename ScalarType>\nstruct StateQ {\n  static const int RowsAtCompileTime = Eigen::Dynamic;\n  typedef Eigen::Matrix<ScalarType, RowsAtCompileTime, 1> EigenType;\n\n  StateQ() {}\n\n  template <typename Derived>\n  explicit StateQ(const Eigen::MatrixBase<Derived>& initial)\n      : v(initial) {}\n\n  template <typename Derived>\n  StateQ& operator=(const Eigen::MatrixBase<Derived>& rhs) {\n    v = rhs;\n  }\n\n  friend EigenType toEigen(const StateQ<ScalarType>& s) {\n    return s.v;\n  }\n\n  std::size_t size() const { return 2; }\n\n  EigenType v;\n};\n\nusing StateQD = StateQ<double>;\n\n\/\/ System-concept class for exercising composition.\nstruct SystemQ {\n  template <typename ScalarType>\n  using StateVector = StateQ<ScalarType>;\n  template <typename ScalarType>\n  using InputVector = StateQ<ScalarType>;\n  template <typename ScalarType>\n  using OutputVector = StateQ<ScalarType>;\n\n  SystemQ(const double dynamics_magic, const double output_magic) :\n      dynamics_magic_(Eigen::Vector2d(dynamics_magic, 0.)),\n      output_magic_(Eigen::Vector2d(output_magic, 0.)) {}\n\n  template <typename ScalarType>\n  StateVector<ScalarType> dynamics(const ScalarType& time,\n                                   const StateVector<ScalarType>& state,\n                                   const InputVector<ScalarType>& input) const {\n    return StateVector<ScalarType>(state.v + input.v + dynamics_magic_.v);\n  }\n\n  template <typename ScalarType>\n  OutputVector<ScalarType> output(const ScalarType& time,\n                                  const StateVector<ScalarType>& state,\n                                  const InputVector<ScalarType>& input) const {\n    return OutputVector<ScalarType>(state.v + input.v + output_magic_.v);\n  }\n\n  bool isTimeVarying() const { return time_varying_; }\n\n  bool isDirectFeedthrough() const { return feedthrough_; }\n\n  const StateQ<double> dynamics_magic_;\n  const StateQ<double> output_magic_;\n  bool time_varying_ { false };\n  bool feedthrough_ { false };\n};\n\nGTEST_TEST(TestNArySystem, BasicOperation) {\n  std::shared_ptr<SystemQ> sq1 = std::make_shared<SystemQ>(10., 100.);\n  std::shared_ptr<SystemQ> sq2 = std::make_shared<SystemQ>(20., 200.);\n\n  NArySystem<SystemQ> dut;\n  NAryState<StateQ<double> > state;\n  NAryState<StateQ<double> > input;\n\n  EXPECT_EQ(dut.isTimeVarying(), false);\n  EXPECT_EQ(dut.isDirectFeedthrough(), false);\n  EXPECT_EQ(dut.getNumStates(), 0);\n  EXPECT_EQ(dut.getNumInputs(), 0);\n  EXPECT_EQ(dut.getNumOutputs(), 0);\n  EXPECT_EQ(dut.dynamics(0., state, input).count(), 0);\n  EXPECT_EQ(dut.output(0., state, input).count(), 0);\n\n  dut.AddSystem(sq1);\n  EXPECT_EQ(dut.isTimeVarying(), false);\n  EXPECT_EQ(dut.isDirectFeedthrough(), false);\n  EXPECT_EQ(dut.getNumStates(), 2);\n  EXPECT_EQ(dut.getNumInputs(), 2);\n  EXPECT_EQ(dut.getNumOutputs(), 2);\n  EXPECT_THROW(dut.dynamics(0., state, input), std::invalid_argument);\n  EXPECT_THROW(dut.output(0., state, input), std::invalid_argument);\n  StateQ<double> s1(Eigen::Vector2d(1., 0.));\n  StateQ<double> i1(Eigen::Vector2d(5., 0.));\n  state.Append(s1);\n  input.Append(i1);\n  EXPECT_EQ(dut.dynamics(0., state, input).count(), 1);\n  EXPECT_EQ(dut.output(0., state, input).count(), 1);\n\n  dut.AddSystem(sq2);\n  EXPECT_EQ(dut.isTimeVarying(), false);\n  EXPECT_EQ(dut.isDirectFeedthrough(), false);\n  EXPECT_EQ(dut.getNumStates(), 4);\n  EXPECT_EQ(dut.getNumInputs(), 4);\n  EXPECT_EQ(dut.getNumOutputs(), 4);\n  EXPECT_THROW(dut.dynamics(0., state, input), std::invalid_argument);\n  EXPECT_THROW(dut.output(0., state, input), std::invalid_argument);\n  StateQ<double> s2(Eigen::Vector2d(2., 0.));\n  StateQ<double> i2(Eigen::Vector2d(6., 0.));\n  state.Append(s2);\n  input.Append(i2);\n  EXPECT_EQ(dut.dynamics(0., state, input).count(), 2);\n  EXPECT_EQ(dut.output(0., state, input).count(), 2);\n\n  EXPECT_EQ(toEigen(dut.dynamics(0., state, input)),\n            Eigen::Vector4d(10. + 1. + 5., 0.,\n                            20. + 2. + 6., 0.));\n  EXPECT_EQ(toEigen(dut.output(0., state, input)),\n            Eigen::Vector4d(100. + 1. + 5., 0.,\n                            200. + 2. + 6., 0.));\n\n  sq2->time_varying_ = true;\n  sq2->feedthrough_ = true;\n  EXPECT_EQ(dut.isTimeVarying(), true);\n  EXPECT_EQ(dut.isDirectFeedthrough(), true);\n}\n\n\n\/\/ Ensure that cascade() will compile.\nGTEST_TEST(TestNArySystem, Cascade) {\n  std::shared_ptr<SystemQ> sq1 = std::make_shared<SystemQ>(10., 100.);\n  std::shared_ptr<SystemQ> sq2 = std::make_shared<SystemQ>(20., 200.);\n\n  auto n1 = std::make_shared<NArySystem<SystemQ> >();\n  auto n2 = std::make_shared<NArySystem<SystemQ> >();\n  auto dut = Drake::cascade(n1, n2);\n}\n\n}  \/\/ namespace\n<commit_msg>Avoid using any static-sized Eigen vectors, as they cause alignment explosions when compiling on MSVC-32.<commit_after>#include \"drake\/systems\/n_ary_system.h\"\n\n#include <memory>\n#include <stdexcept>\n\n#include <Eigen\/Dense>\n#include \"gtest\/gtest.h\"\n\n#include \"drake\/core\/Vector.h\"\n#include \"drake\/systems\/cascade_system.h\"\n\nnamespace {\n\nusing Drake::NullVector;\nusing Drake::toEigen;\nusing drake::NAryState;\nusing drake::NArySystem;\n\n\/\/ Vector-concept class for exercising composition.\ntemplate <typename ScalarType>\nstruct StateQ {\n  static const int RowsAtCompileTime = Eigen::Dynamic;\n  typedef Eigen::Matrix<ScalarType, RowsAtCompileTime, 1> EigenType;\n\n  StateQ() {}\n\n  StateQ(const double a, const double b)\n      : v((Eigen::VectorXd(2) << a, b).finished()) {}\n\n  template <typename Derived>\n  explicit StateQ(const Eigen::MatrixBase<Derived>& initial)\n      : v(initial) {}\n\n  template <typename Derived>\n  StateQ& operator=(const Eigen::MatrixBase<Derived>& rhs) {\n    v = rhs;\n  }\n\n  friend EigenType toEigen(const StateQ<ScalarType>& s) {\n    return s.v;\n  }\n\n  std::size_t size() const { return 2; }\n\n  EigenType v;\n};\n\nusing StateQD = StateQ<double>;\n\n\/\/ System-concept class for exercising composition.\nstruct SystemQ {\n  template <typename ScalarType>\n  using StateVector = StateQ<ScalarType>;\n  template <typename ScalarType>\n  using InputVector = StateQ<ScalarType>;\n  template <typename ScalarType>\n  using OutputVector = StateQ<ScalarType>;\n\n  SystemQ(const double dynamics_magic, const double output_magic) :\n      dynamics_magic_(dynamics_magic, 0.),\n      output_magic_(output_magic, 0.) {}\n\n  template <typename ScalarType>\n  StateVector<ScalarType> dynamics(const ScalarType& time,\n                                   const StateVector<ScalarType>& state,\n                                   const InputVector<ScalarType>& input) const {\n    return StateVector<ScalarType>(state.v + input.v + dynamics_magic_.v);\n  }\n\n  template <typename ScalarType>\n  OutputVector<ScalarType> output(const ScalarType& time,\n                                  const StateVector<ScalarType>& state,\n                                  const InputVector<ScalarType>& input) const {\n    return OutputVector<ScalarType>(state.v + input.v + output_magic_.v);\n  }\n\n  bool isTimeVarying() const { return time_varying_; }\n\n  bool isDirectFeedthrough() const { return feedthrough_; }\n\n  const StateQ<double> dynamics_magic_;\n  const StateQ<double> output_magic_;\n  bool time_varying_ { false };\n  bool feedthrough_ { false };\n};\n\n\n\/\/ Conveniently makes a 4-d VectorXd.\nEigen::VectorXd Make4d(double c1, double c2, double c3, double c4) {\n  return (Eigen::VectorXd(4) << c1, c2, c3, c4).finished();\n}\n\n\nGTEST_TEST(TestNArySystem, BasicOperation) {\n  std::shared_ptr<SystemQ> sq1 = std::make_shared<SystemQ>(10., 100.);\n  std::shared_ptr<SystemQ> sq2 = std::make_shared<SystemQ>(20., 200.);\n\n  NArySystem<SystemQ> dut;\n  NAryState<StateQ<double> > state;\n  NAryState<StateQ<double> > input;\n\n  EXPECT_EQ(dut.isTimeVarying(), false);\n  EXPECT_EQ(dut.isDirectFeedthrough(), false);\n  EXPECT_EQ(dut.getNumStates(), 0);\n  EXPECT_EQ(dut.getNumInputs(), 0);\n  EXPECT_EQ(dut.getNumOutputs(), 0);\n  EXPECT_EQ(dut.dynamics(0., state, input).count(), 0);\n  EXPECT_EQ(dut.output(0., state, input).count(), 0);\n\n  dut.AddSystem(sq1);\n  EXPECT_EQ(dut.isTimeVarying(), false);\n  EXPECT_EQ(dut.isDirectFeedthrough(), false);\n  EXPECT_EQ(dut.getNumStates(), 2);\n  EXPECT_EQ(dut.getNumInputs(), 2);\n  EXPECT_EQ(dut.getNumOutputs(), 2);\n  EXPECT_THROW(dut.dynamics(0., state, input), std::invalid_argument);\n  EXPECT_THROW(dut.output(0., state, input), std::invalid_argument);\n  StateQ<double> s1(1., 0.);\n  StateQ<double> i1(5., 0.);\n  state.Append(s1);\n  input.Append(i1);\n  EXPECT_EQ(dut.dynamics(0., state, input).count(), 1);\n  EXPECT_EQ(dut.output(0., state, input).count(), 1);\n\n  dut.AddSystem(sq2);\n  EXPECT_EQ(dut.isTimeVarying(), false);\n  EXPECT_EQ(dut.isDirectFeedthrough(), false);\n  EXPECT_EQ(dut.getNumStates(), 4);\n  EXPECT_EQ(dut.getNumInputs(), 4);\n  EXPECT_EQ(dut.getNumOutputs(), 4);\n  EXPECT_THROW(dut.dynamics(0., state, input), std::invalid_argument);\n  EXPECT_THROW(dut.output(0., state, input), std::invalid_argument);\n  StateQ<double> s2(2., 0.);\n  StateQ<double> i2(6., 0.);\n  state.Append(s2);\n  input.Append(i2);\n  EXPECT_EQ(dut.dynamics(0., state, input).count(), 2);\n  EXPECT_EQ(dut.output(0., state, input).count(), 2);\n\n  EXPECT_EQ(toEigen(dut.dynamics(0., state, input)),\n            Make4d(10. + 1. + 5., 0.,\n                   20. + 2. + 6., 0.));\n  EXPECT_EQ(toEigen(dut.output(0., state, input)),\n            Make4d(100. + 1. + 5., 0.,\n                   200. + 2. + 6., 0.));\n\n  sq2->time_varying_ = true;\n  sq2->feedthrough_ = true;\n  EXPECT_EQ(dut.isTimeVarying(), true);\n  EXPECT_EQ(dut.isDirectFeedthrough(), true);\n}\n\n\n\/\/ Ensure that cascade() will compile.\nGTEST_TEST(TestNArySystem, Cascade) {\n  std::shared_ptr<SystemQ> sq1 = std::make_shared<SystemQ>(10., 100.);\n  std::shared_ptr<SystemQ> sq2 = std::make_shared<SystemQ>(20., 200.);\n\n  auto n1 = std::make_shared<NArySystem<SystemQ> >();\n  auto n2 = std::make_shared<NArySystem<SystemQ> >();\n  auto dut = Drake::cascade(n1, n2);\n}\n\n}  \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __RAPICORN_CORE_OBJECTS_HH__\n#define __RAPICORN_CORE_OBJECTS_HH__\n\n#include <rcore\/utilities.hh>\n#include <rcore\/thread.hh>\n#include <rcore\/aidaprops.hh>\n\nnamespace Rapicorn {\n\n\/\/ == VirtualTypeid ==\nclass VirtualTypeid {\nprotected:\n  virtual      ~VirtualTypeid      ();\npublic:\n  String        typeid_name        ();\n  static String cxx_demangle       (const char *mangled_identifier);\n};\n\n\/\/ == ClassDoctor (used for private class copies) ==\n#ifdef  __RAPICORN_BUILD__\nclass ClassDoctor;\n#else\nclass ClassDoctor {};\n#endif\n\n\/\/ == Deletable ==\n\/**\n * Deletable is a virtual base class that can be derived from (usually with\n * public virtual) to ensure an object has a vtable and a virtual destructor.\n * Also, it allows deletion hooks to be called during the objects destructor,\n * by deriving from Rapicorn::Deletable::DeletionHook. No extra per-object space is\n * consumed to allow deletion hooks, which makes Deletable a suitable base\n * type for classes that may or may not need this feature (e.g. objects that\n * can but often aren't used for signal handler connections).\n *\/\nstruct Deletable : public virtual VirtualTypeid {\n  \/**\n   * DeletionHook is the base implementation class for hooks which are hooked\n   * up into the deletion phase of a Rapicorn::Deletable.\n   *\/\n  class DeletionHook {\n    DeletionHook    *prev;\n    DeletionHook    *next;\n    friend class Deletable;\n  protected:\n    virtual     ~DeletionHook          (); \/* { if (deletable) deletable_remove_hook (deletable); deletable = NULL; } *\/\n    virtual void monitoring_deletable  (Deletable &deletable) = 0;\n    virtual void dismiss_deletable     () = 0;\n  public:\n    explicit     DeletionHook          () : prev (NULL), next (NULL) {}\n    bool         deletable_add_hook    (void      *any)              { return false; }\n    bool         deletable_add_hook    (Deletable *deletable);\n    bool         deletable_remove_hook (void      *any)              { return false; }\n    bool         deletable_remove_hook (Deletable *deletable);\n  };\nprivate:\n  void           add_deletion_hook     (DeletionHook *hook);\n  void           remove_deletion_hook  (DeletionHook *hook);\nprotected:\n  void           invoke_deletion_hooks ();\n  virtual       ~Deletable             ();\n};\n\n\/\/ == DataListContainer ==\n\/**\n * By using a DataKey, DataListContainer objects allow storage and retrieval of custom data members in a typesafe fashion.\n * The custom data members will initially default to DataKey::fallback and are deleted by the DataListContainer destructor.\n * Example: @snippet rcore\/tests\/datalist.cc DataListContainer-EXAMPLE\n *\/\nclass DataListContainer {\n  DataList data_list;\npublic: \/\/\/ @name Accessing custom data members\n  \/\/\/ Assign @a data to the custom keyed data member, deletes any previously set data.\n  template<typename Type> inline void set_data    (DataKey<Type> *key, Type data) { data_list.set (key, data); }\n  \/\/\/ Retrieve contents of the custom keyed data member, returns DataKey::fallback if nothing was set.\n  template<typename Type> inline Type get_data    (DataKey<Type> *key) const      { return data_list.get (key); }\n  \/\/\/ Swap @a data with the current contents of the custom keyed data member, returns the current contents.\n  template<typename Type> inline Type swap_data   (DataKey<Type> *key, Type data) { return data_list.swap (key, data); }\n  \/\/\/ Removes and returns the current contents of the custom keyed data member without deleting it.\n  template<typename Type> inline Type swap_data   (DataKey<Type> *key)            { return data_list.swap (key); }\n  \/\/\/ Delete the current contents of the custom keyed data member, invokes DataKey::destroy.\n  template<typename Type> inline void delete_data (DataKey<Type> *key)            { data_list.del (key); }\n};\n\n\/\/ == BaseObject ==\nclass BaseObject : public virtual Deletable, public virtual Aida::PropertyHostInterface {\nprotected:\n  class                    InterfaceMatcher;\n  template<class C>  class InterfaceMatch;\n  virtual void                 dispose   ();\npublic:\n};\ntypedef Aida::PropertyList PropertyList; \/\/ import PropertyList from Aida namespace\ntypedef Aida::Property     Property;     \/\/ import Property from Aida namespace\nclass NullInterface : std::exception {};\n\nstruct BaseObject::InterfaceMatcher {\n  explicit      InterfaceMatcher (const String &ident) : m_ident (ident), m_match_found (false) {}\n  bool          done             () const { return m_match_found; }\n  virtual  bool match            (BaseObject *object, const String &ident = String()) = 0;\n  RAPICORN_CLASS_NON_COPYABLE (InterfaceMatcher);\nprotected:\n  const String &m_ident;\n  bool          m_match_found;\n};\n\ntemplate<class C>\nstruct BaseObject::InterfaceMatch : BaseObject::InterfaceMatcher {\n  typedef C&    Result;\n  explicit      InterfaceMatch  (const String &ident) : InterfaceMatcher (ident), m_instance (NULL) {}\n  C&            result          (bool may_throw) const;\n  virtual bool  match           (BaseObject *obj, const String &ident);\nprotected:\n  C            *m_instance;\n};\ntemplate<class C>\nstruct BaseObject::InterfaceMatch<C&> : InterfaceMatch<C> {\n  explicit      InterfaceMatch  (const String &ident) : InterfaceMatch<C> (ident) {}\n};\ntemplate<class C>\nstruct BaseObject::InterfaceMatch<C*> : InterfaceMatch<C> {\n  typedef C*    Result;\n  explicit      InterfaceMatch  (const String &ident) : InterfaceMatch<C> (ident) {}\n  C*            result          (bool may_throw) const { return InterfaceMatch<C>::m_instance; }\n};\n\ntemplate<class C> bool\nBaseObject::InterfaceMatch<C>::match (BaseObject *obj, const String &ident)\n{\n  if (!m_instance)\n    {\n      const String &id = m_ident;\n      if (id.empty() || id == ident)\n        {\n          m_instance = dynamic_cast<C*> (obj);\n          m_match_found = m_instance != NULL;\n        }\n    }\n  return m_match_found;\n}\n\ntemplate<class C> C&\nBaseObject::InterfaceMatch<C>::result (bool may_throw) const\n{\n  if (!this->m_instance && may_throw)\n    throw NullInterface();\n  return *this->m_instance;\n}\n\n\/\/ == ReferenceCountable ==\nclass ReferenceCountable : public virtual BaseObject {\n  volatile mutable uint32 ref_field;\n  static const uint32     FLOATING_FLAG = 1 << 31;\n  inline uint32 ref_get    () const                             { return Lib::atomic_load (&ref_field); }\n  inline bool   ref_cas    (uint32 oldv, uint32 newv) const     { return __sync_bool_compare_and_swap (&ref_field, oldv, newv); }\n  inline void   fast_ref   () const;\n  inline void   fast_unref () const;\n  void          real_unref () const;\n  RAPICORN_CLASS_NON_COPYABLE (ReferenceCountable);\nprotected:\n  virtual      ~ReferenceCountable ();\n  virtual void  delete_this        ();\n  virtual void  pre_finalize       ();\n  virtual void  finalize           ();\n  inline uint32 ref_count          () const                     { return ref_get() & ~FLOATING_FLAG; }\npublic:\n  bool     floating           () const                          { return 0 != (ref_get() & FLOATING_FLAG); }\n  void     ref                () const                          { fast_ref(); }\n  void     ref_sink           () const;\n  bool     finalizing         () const                          { return ref_count() < 1; }\n  void     unref              () const                          { fast_unref(); }\n  void     ref_diag           (const char *msg = NULL) const;\n  explicit ReferenceCountable (uint allow_stack_magic = 0);\n  template<class Obj> static Obj& ref      (Obj &obj) { obj.ref();       return obj; }\n  template<class Obj> static Obj* ref      (Obj *obj) { obj->ref();      return obj; }\n  template<class Obj> static Obj& ref_sink (Obj &obj) { obj.ref_sink();  return obj; }\n  template<class Obj> static Obj* ref_sink (Obj *obj) { obj->ref_sink(); return obj; }\n  template<class Obj> static void unref    (Obj &obj) { obj.unref(); }\n  template<class Obj> static void unref    (Obj *obj) { obj->unref(); }\n};\ntemplate<class Obj> static Obj& ref      (Obj &obj) { obj.ref();       return obj; }\ntemplate<class Obj> static Obj* ref      (Obj *obj) { obj->ref();      return obj; }\ntemplate<class Obj> static Obj& ref_sink (Obj &obj) { obj.ref_sink();  return obj; }\ntemplate<class Obj> static Obj* ref_sink (Obj *obj) { obj->ref_sink(); return obj; }\ntemplate<class Obj> static void unref    (Obj &obj) { obj.unref(); }\ntemplate<class Obj> static void unref    (Obj *obj) { obj->unref(); }\n\n\/\/ == Implementation Details ==\ninline void\nReferenceCountable::fast_ref () const\n{\n  \/\/ fast-path: use one atomic op and deferred checks\n  uint32 old_ref = __sync_fetch_and_add (&ref_field, 1);\n  uint32 new_ref = old_ref + 1;                       \/\/ ...and_add (,1)\n  RAPICORN_ASSERT (old_ref & ~FLOATING_FLAG);         \/\/ check dead objects\n  RAPICORN_ASSERT (new_ref & ~FLOATING_FLAG);         \/\/ check overflow\n}\n\ninline void\nReferenceCountable::fast_unref () const\n{\n  RAPICORN_CFENCE;\n  uint32 old_ref = ref_field; \/\/ skip read-barrier for fast-path\n  if (RAPICORN_LIKELY (old_ref & ~(FLOATING_FLAG | 1)) && \/\/ old_ref >= 2\n      RAPICORN_LIKELY (ref_cas (old_ref, old_ref - 1)))\n    return; \/\/ trying fast-path with single atomic op\n  real_unref();\n}\n\n} \/\/ Rapicorn\n\n#endif \/\/ __RAPICORN_CORE_OBJECTS_HH__\n<commit_msg>RCORE: objects member renames<commit_after>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __RAPICORN_CORE_OBJECTS_HH__\n#define __RAPICORN_CORE_OBJECTS_HH__\n\n#include <rcore\/utilities.hh>\n#include <rcore\/thread.hh>\n#include <rcore\/aidaprops.hh>\n\nnamespace Rapicorn {\n\n\/\/ == VirtualTypeid ==\nclass VirtualTypeid {\nprotected:\n  virtual      ~VirtualTypeid      ();\npublic:\n  String        typeid_name        ();\n  static String cxx_demangle       (const char *mangled_identifier);\n};\n\n\/\/ == ClassDoctor (used for private class copies) ==\n#ifdef  __RAPICORN_BUILD__\nclass ClassDoctor;\n#else\nclass ClassDoctor {};\n#endif\n\n\/\/ == Deletable ==\n\/**\n * Deletable is a virtual base class that can be derived from (usually with\n * public virtual) to ensure an object has a vtable and a virtual destructor.\n * Also, it allows deletion hooks to be called during the objects destructor,\n * by deriving from Rapicorn::Deletable::DeletionHook. No extra per-object space is\n * consumed to allow deletion hooks, which makes Deletable a suitable base\n * type for classes that may or may not need this feature (e.g. objects that\n * can but often aren't used for signal handler connections).\n *\/\nstruct Deletable : public virtual VirtualTypeid {\n  \/**\n   * DeletionHook is the base implementation class for hooks which are hooked\n   * up into the deletion phase of a Rapicorn::Deletable.\n   *\/\n  class DeletionHook {\n    DeletionHook    *prev;\n    DeletionHook    *next;\n    friend class Deletable;\n  protected:\n    virtual     ~DeletionHook          (); \/* { if (deletable) deletable_remove_hook (deletable); deletable = NULL; } *\/\n    virtual void monitoring_deletable  (Deletable &deletable) = 0;\n    virtual void dismiss_deletable     () = 0;\n  public:\n    explicit     DeletionHook          () : prev (NULL), next (NULL) {}\n    bool         deletable_add_hook    (void      *any)              { return false; }\n    bool         deletable_add_hook    (Deletable *deletable);\n    bool         deletable_remove_hook (void      *any)              { return false; }\n    bool         deletable_remove_hook (Deletable *deletable);\n  };\nprivate:\n  void           add_deletion_hook     (DeletionHook *hook);\n  void           remove_deletion_hook  (DeletionHook *hook);\nprotected:\n  void           invoke_deletion_hooks ();\n  virtual       ~Deletable             ();\n};\n\n\/\/ == DataListContainer ==\n\/**\n * By using a DataKey, DataListContainer objects allow storage and retrieval of custom data members in a typesafe fashion.\n * The custom data members will initially default to DataKey::fallback and are deleted by the DataListContainer destructor.\n * Example: @snippet rcore\/tests\/datalist.cc DataListContainer-EXAMPLE\n *\/\nclass DataListContainer {\n  DataList data_list;\npublic: \/\/\/ @name Accessing custom data members\n  \/\/\/ Assign @a data to the custom keyed data member, deletes any previously set data.\n  template<typename Type> inline void set_data    (DataKey<Type> *key, Type data) { data_list.set (key, data); }\n  \/\/\/ Retrieve contents of the custom keyed data member, returns DataKey::fallback if nothing was set.\n  template<typename Type> inline Type get_data    (DataKey<Type> *key) const      { return data_list.get (key); }\n  \/\/\/ Swap @a data with the current contents of the custom keyed data member, returns the current contents.\n  template<typename Type> inline Type swap_data   (DataKey<Type> *key, Type data) { return data_list.swap (key, data); }\n  \/\/\/ Removes and returns the current contents of the custom keyed data member without deleting it.\n  template<typename Type> inline Type swap_data   (DataKey<Type> *key)            { return data_list.swap (key); }\n  \/\/\/ Delete the current contents of the custom keyed data member, invokes DataKey::destroy.\n  template<typename Type> inline void delete_data (DataKey<Type> *key)            { data_list.del (key); }\n};\n\n\/\/ == BaseObject ==\nclass BaseObject : public virtual Deletable, public virtual Aida::PropertyHostInterface {\nprotected:\n  class                    InterfaceMatcher;\n  template<class C>  class InterfaceMatch;\n  virtual void                 dispose   ();\npublic:\n};\ntypedef Aida::PropertyList PropertyList; \/\/ import PropertyList from Aida namespace\ntypedef Aida::Property     Property;     \/\/ import Property from Aida namespace\nclass NullInterface : std::exception {};\n\nstruct BaseObject::InterfaceMatcher {\n  explicit      InterfaceMatcher (const String &ident) : ident_ (ident), match_found_ (false) {}\n  bool          done             () const { return match_found_; }\n  virtual  bool match            (BaseObject *object, const String &ident = String()) = 0;\n  RAPICORN_CLASS_NON_COPYABLE (InterfaceMatcher);\nprotected:\n  const String &ident_;\n  bool          match_found_;\n};\n\ntemplate<class C>\nstruct BaseObject::InterfaceMatch : BaseObject::InterfaceMatcher {\n  typedef C&    Result;\n  explicit      InterfaceMatch  (const String &ident) : InterfaceMatcher (ident), instance_ (NULL) {}\n  C&            result          (bool may_throw) const;\n  virtual bool  match           (BaseObject *obj, const String &ident);\nprotected:\n  C            *instance_;\n};\ntemplate<class C>\nstruct BaseObject::InterfaceMatch<C&> : InterfaceMatch<C> {\n  explicit      InterfaceMatch  (const String &ident) : InterfaceMatch<C> (ident) {}\n};\ntemplate<class C>\nstruct BaseObject::InterfaceMatch<C*> : InterfaceMatch<C> {\n  typedef C*    Result;\n  explicit      InterfaceMatch  (const String &ident) : InterfaceMatch<C> (ident) {}\n  C*            result          (bool may_throw) const { return InterfaceMatch<C>::instance_; }\n};\n\ntemplate<class C> bool\nBaseObject::InterfaceMatch<C>::match (BaseObject *obj, const String &ident)\n{\n  if (!instance_)\n    {\n      const String &id = ident_;\n      if (id.empty() || id == ident)\n        {\n          instance_ = dynamic_cast<C*> (obj);\n          match_found_ = instance_ != NULL;\n        }\n    }\n  return match_found_;\n}\n\ntemplate<class C> C&\nBaseObject::InterfaceMatch<C>::result (bool may_throw) const\n{\n  if (!this->instance_ && may_throw)\n    throw NullInterface();\n  return *this->instance_;\n}\n\n\/\/ == ReferenceCountable ==\nclass ReferenceCountable : public virtual BaseObject {\n  volatile mutable uint32 ref_field;\n  static const uint32     FLOATING_FLAG = 1 << 31;\n  inline uint32 ref_get    () const                             { return Lib::atomic_load (&ref_field); }\n  inline bool   ref_cas    (uint32 oldv, uint32 newv) const     { return __sync_bool_compare_and_swap (&ref_field, oldv, newv); }\n  inline void   fast_ref   () const;\n  inline void   fast_unref () const;\n  void          real_unref () const;\n  RAPICORN_CLASS_NON_COPYABLE (ReferenceCountable);\nprotected:\n  virtual      ~ReferenceCountable ();\n  virtual void  delete_this        ();\n  virtual void  pre_finalize       ();\n  virtual void  finalize           ();\n  inline uint32 ref_count          () const                     { return ref_get() & ~FLOATING_FLAG; }\npublic:\n  bool     floating           () const                          { return 0 != (ref_get() & FLOATING_FLAG); }\n  void     ref                () const                          { fast_ref(); }\n  void     ref_sink           () const;\n  bool     finalizing         () const                          { return ref_count() < 1; }\n  void     unref              () const                          { fast_unref(); }\n  void     ref_diag           (const char *msg = NULL) const;\n  explicit ReferenceCountable (uint allow_stack_magic = 0);\n  template<class Obj> static Obj& ref      (Obj &obj) { obj.ref();       return obj; }\n  template<class Obj> static Obj* ref      (Obj *obj) { obj->ref();      return obj; }\n  template<class Obj> static Obj& ref_sink (Obj &obj) { obj.ref_sink();  return obj; }\n  template<class Obj> static Obj* ref_sink (Obj *obj) { obj->ref_sink(); return obj; }\n  template<class Obj> static void unref    (Obj &obj) { obj.unref(); }\n  template<class Obj> static void unref    (Obj *obj) { obj->unref(); }\n};\ntemplate<class Obj> static Obj& ref      (Obj &obj) { obj.ref();       return obj; }\ntemplate<class Obj> static Obj* ref      (Obj *obj) { obj->ref();      return obj; }\ntemplate<class Obj> static Obj& ref_sink (Obj &obj) { obj.ref_sink();  return obj; }\ntemplate<class Obj> static Obj* ref_sink (Obj *obj) { obj->ref_sink(); return obj; }\ntemplate<class Obj> static void unref    (Obj &obj) { obj.unref(); }\ntemplate<class Obj> static void unref    (Obj *obj) { obj->unref(); }\n\n\/\/ == Implementation Details ==\ninline void\nReferenceCountable::fast_ref () const\n{\n  \/\/ fast-path: use one atomic op and deferred checks\n  uint32 old_ref = __sync_fetch_and_add (&ref_field, 1);\n  uint32 new_ref = old_ref + 1;                       \/\/ ...and_add (,1)\n  RAPICORN_ASSERT (old_ref & ~FLOATING_FLAG);         \/\/ check dead objects\n  RAPICORN_ASSERT (new_ref & ~FLOATING_FLAG);         \/\/ check overflow\n}\n\ninline void\nReferenceCountable::fast_unref () const\n{\n  RAPICORN_CFENCE;\n  uint32 old_ref = ref_field; \/\/ skip read-barrier for fast-path\n  if (RAPICORN_LIKELY (old_ref & ~(FLOATING_FLAG | 1)) && \/\/ old_ref >= 2\n      RAPICORN_LIKELY (ref_cas (old_ref, old_ref - 1)))\n    return; \/\/ trying fast-path with single atomic op\n  real_unref();\n}\n\n} \/\/ Rapicorn\n\n#endif \/\/ __RAPICORN_CORE_OBJECTS_HH__\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __CLUSTERING_ADMINISTRATION_ISSUES_NAME_CONFLICT_HPP__\n#define __CLUSTERING_ADMINISTRATION_ISSUES_NAME_CONFLICT_HPP__\n\n#include \"clustering\/administration\/issues\/global.hpp\"\n#include \"clustering\/administration\/metadata.hpp\"\n#include \"rpc\/semilattice\/view.hpp\"\n\nclass name_conflict_issue_t : public global_issue_t {\npublic:\n    name_conflict_issue_t(\n            const std::string &_type,\n            const std::string &_contested_name,\n            const std::set<boost::uuids::uuid> &_contestants) : \n        type(_type), contested_name(_contested_name), contestants(_contestants) { }\n\n    std::string get_description() const {\n        std::string message = \"The following \" + type + \"s are all named '\" + contested_name + \"': \";\n        for (std::set<boost::uuids::uuid>::iterator it = contestants.begin(); it != contestants.end(); it++) {\n            message += uuid_to_str(*it) + \"; \";\n        }\n        return message;\n    }\n\n    name_conflict_issue_t *clone() const {\n        return new name_conflict_issue_t(type, contested_name, contestants);\n    }\n\n    std::string type;\n    std::string contested_name;\n    std::set<boost::uuids::uuid> contestants;\n};\n\nclass name_conflict_issue_tracker_t : public global_issue_tracker_t {\npublic:\n    name_conflict_issue_tracker_t(\n            boost::shared_ptr<semilattice_read_view_t<cluster_semilattice_metadata_t> > _semilattice_view) :\n        semilattice_view(_semilattice_view) { }\n\n    std::list<clone_ptr_t<global_issue_t> > get_issues();\n\nprivate:\n    boost::shared_ptr<semilattice_read_view_t<cluster_semilattice_metadata_t> > semilattice_view;\n};\n\n\n#endif \/* __CLUSTERING_ADMINISTRATION_ISSUES_NAME_CONFLICT_HPP__ *\/\n<commit_msg>Don't use reserved compiler names<commit_after>#ifndef CLUSTERING_ADMINISTRATION_ISSUES_NAME_CONFLICT_HPP_\n#define CLUSTERING_ADMINISTRATION_ISSUES_NAME_CONFLICT_HPP_\n\n#include \"clustering\/administration\/issues\/global.hpp\"\n#include \"clustering\/administration\/metadata.hpp\"\n#include \"rpc\/semilattice\/view.hpp\"\n\nclass name_conflict_issue_t : public global_issue_t {\npublic:\n    name_conflict_issue_t(\n            const std::string &_type,\n            const std::string &_contested_name,\n            const std::set<boost::uuids::uuid> &_contestants) : \n        type(_type), contested_name(_contested_name), contestants(_contestants) { }\n\n    std::string get_description() const {\n        std::string message = \"The following \" + type + \"s are all named '\" + contested_name + \"': \";\n        for (std::set<boost::uuids::uuid>::iterator it = contestants.begin(); it != contestants.end(); it++) {\n            message += uuid_to_str(*it) + \"; \";\n        }\n        return message;\n    }\n\n    name_conflict_issue_t *clone() const {\n        return new name_conflict_issue_t(type, contested_name, contestants);\n    }\n\n    std::string type;\n    std::string contested_name;\n    std::set<boost::uuids::uuid> contestants;\n};\n\nclass name_conflict_issue_tracker_t : public global_issue_tracker_t {\npublic:\n    name_conflict_issue_tracker_t(\n            boost::shared_ptr<semilattice_read_view_t<cluster_semilattice_metadata_t> > _semilattice_view) :\n        semilattice_view(_semilattice_view) { }\n\n    std::list<clone_ptr_t<global_issue_t> > get_issues();\n\nprivate:\n    boost::shared_ptr<semilattice_read_view_t<cluster_semilattice_metadata_t> > semilattice_view;\n};\n\n\n#endif \/* CLUSTERING_ADMINISTRATION_ISSUES_NAME_CONFLICT_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- c-style: gnu -*-\n\n#include \"act-activity.h\"\n#include \"act-activity-accum.h\"\n#include \"act-arguments.h\"\n#include \"act-config.h\"\n#include \"act-database.h\"\n#include \"act-format.h\"\n#include \"act-output-table.h\"\n#include \"act-util.h\"\n\n#include <cmath>\n#include <map>\n#include <xlocale.h>\n\nusing namespace act;\n\nnamespace {\n\nenum option_id\n{\n  opt_grep,\n  opt_defines,\n  opt_matches,\n  opt_contains,\n  opt_compare,\n  opt_interval,\n  opt_field,\n  opt_course,\n  opt_keywords,\n  opt_equipment,\n  opt_format,\n  opt_table,\n};\n\nconst arguments::option options[] =\n{\n  {opt_grep, \"grep\", 'g', \"REGEXP\", \"Add grep-body query term.\"},\n  {opt_defines, \"defines\", 'd', \"FIELD\", \"Add defines-field query term.\"},\n  {opt_matches, \"matches\", 'm', \"FIELD:REGEXP\", \"Add re-match query term.\"},\n  {opt_contains, \"contains\", 'c', \"FIELD:KEYWORD\", \"Add keyword query term.\"},\n  {opt_compare, \"compare\", 'C', \"FIELDxVALUE\",\n   \"Add compare query term. 'x' from: = != < > <= >=\"},\n  {opt_interval, \"interval\", 'i', \"INTERVAL\", \"Group by date-interval.\"},\n  {opt_field, \"field\", 'f', \"FIELD[:SIZE]\", \"Group by the named field.\"},\n  {opt_course, \"course\", 0, nullptr, \"Group by Course field.\"},\n  {opt_keywords, \"keywords\", 'k', \"FIELD\", \"Group by keyword.\"},\n  {opt_equipment, \"equipment\", 0, nullptr, \"Group by equipment.\"},\n  {opt_format, \"format\", 'f', \"FORMAT\", \"Format string.\"},\n  {opt_table, \"table\", 't', \"FORMAT\", \"Table format string.\"},\n  {arguments::opt_eof},\n};\n\nvoid\nprint_usage(const arguments &args)\n{\n  fprintf(stderr, \"usage: %s [OPTIONS...]\\n\\n\", args.program_name());\n  fputs(\"where OPTIONS are any of:\\n\\n\", stderr);\n\n  arguments::print_options(options, stderr);\n\n  fputs(\"\\n\", stderr);\n}\n\nstruct string_group\n{\n  const char *field;\n\n  typedef std::map<std::string, activity_accum,\n    case_insensitive_string_compare> group_map;\n\n  group_map map;\n\n  explicit string_group(const char *field);\n\n  void insert(const activity &a);\n\n  void format_key(std::string &buf, const std::string &key) const;\n};\n\nstruct keyword_group\n{\n  field_id field;\n\n  typedef std::map<std::string, activity_accum,\n    case_insensitive_string_compare> group_map;\n\n  group_map map;\n\n  keyword_group(const char *field);\n\n  void insert(const activity &a);\n\n  void format_key(std::string &buf, const std::string &key) const;\n};\n\nstruct value_group\n{\n  const char *field;\n  field_id field_id;\n  double bucket_size;\n  double bucket_scale;\n\n  typedef std::map<int, activity_accum> group_map;\n\n  group_map map;\n\n  explicit value_group(const char *field, double bucket_size);\n\n  void insert(const activity &a);\n\n  void format_key(std::string &buf, int key) const;\n};\n\nstruct interval_group\n{\n  date_interval interval;\n\n  typedef std::map<int, activity_accum> group_map;\n\n  group_map map;\n\n  explicit interval_group(const date_interval &interval);\n\n  void insert(const activity &a);\n\n  void format_key(std::string &buf, int key) const;\n};\n\nstring_group::string_group(const char *f)\n: field(f)\n{\n}\n\nvoid\nstring_group::insert(const activity &a)\n{\n  if(const std::string *ptr = a.field_ptr(field))\n    {\n      map[*ptr].add(a);\n    }\n}\n\nvoid\nstring_group::format_key(std::string &buf, const std::string &key) const\n{\n  buf.append(key);\n}\n\nkeyword_group::keyword_group(const char *f)\n: field(lookup_field_id(f))\n{\n}\n\nvoid\nkeyword_group::insert(const activity &a)\n{\n  if(const std::vector<std::string> *ptr = a.field_keywords_ptr(field))\n    {\n      for (const auto &it : *ptr)\n\tmap[it].add(a);\n    }\n}\n\nvoid\nkeyword_group::format_key(std::string &buf, const std::string &key) const\n{\n  buf.append(key);\n}\n\nvalue_group::value_group(const char *f, double size)\n: field(f),\n  field_id(lookup_field_id(f)),\n  bucket_size(size),\n  bucket_scale(1 \/ size)\n{\n}\n\nvoid\nvalue_group::insert(const activity &a)\n{\n  double value = 0;\n\n  if (field_id != field_custom)\n    value = a.field_value(field_id);\n  else if (const std::string *ptr = a.field_ptr(field))\n    parse_number(*ptr, &value);\n\n  if (value == 0)\n    return;\n\n  int idx = (int) floor(value * bucket_scale);\n\n  map[idx].add(a);\n}\n\nvoid\nvalue_group::format_key(std::string &buf, int key) const\n{\n  double min = key * bucket_size;\n  double max = (key + 1) * bucket_size;\n\n  field_data_type type = lookup_field_data_type(field_id);\n\n  buf.push_back('[');\n  format_value(buf, type, min, unit_unknown);\n  buf.append(\", \");\n  format_value(buf, type, max, unit_unknown);\n  buf.push_back(')');\n}\n\ninterval_group::interval_group(const date_interval &i)\n: interval(i)\n{\n}\n\nvoid\ninterval_group::insert(const activity &a)\n{\n  time_t date = a.date();\n  if (date == 0)\n    return;\n\n  int idx = interval.date_index(date);\n\n  map[idx].add(a);\n}\n\nvoid\ninterval_group::format_key(std::string &buf, int key) const\n{\n  interval.append_date(buf, key);\n}\n\ntemplate<typename T> void\noutput_group_format(T &g, const char *format)\n{\n  for (const auto &it : g.map)\n    {\n      std::string key;\n      g.format_key(key, it.first);\n      it.second.printf(format, key.c_str());\n    }\n}\n\ntemplate<typename T> void\noutput_group_table(T &g, const char *format)\n{\n  output_table tab;\n\n  for (const auto &it : g.map)\n    {\n      tab.begin_row();\n\n      std::string key;\n      g.format_key(key, it.first);\n      it.second.print_row(tab, format, key.c_str());\n\n      tab.end_row();\n    }\n\n  tab.print();\n}\n\ntemplate<typename T> void\napply_group(T &g, const std::vector<database::item_ref> &items,\n\t    const char *format, const char *table_format)\n{\n  for (const auto &it : items)\n    g.insert(activity(it->storage()));\n  \n  if (format != nullptr)\n    output_group_format(g, format);\n\n  if (table_format != nullptr)\n    output_group_table(g, table_format);\n}\n\n} \/\/ anonymous namespace\n\nint\nact_fold(arguments &args)\n{\n  database::query query;\n\n  std::shared_ptr<database::and_term> query_and (new database::and_term);\n  query.set_term(query_and);\n\n  std::string group_field;\n  bool group_keywords = false;\n  double group_size = 0;\n  date_interval interval(date_interval::days, 0);\n\n  const char *format = nullptr;\n  const char *table_format = nullptr;\n\n  while (1)\n    {\n      const char *opt_arg = nullptr;\n      int opt = args.getopt(options, &opt_arg);\n      if (opt == arguments::opt_eof)\n\tbreak;\n\n      switch (opt)\n\t{\n\tcase opt_grep: {\n\t  std::string re(opt_arg);\n\t  std::shared_ptr<database::query_term>\n\t    term (new database::grep_term(re));\n\t  query_and->add_term(term);\n\t  break; }\n\n\tcase opt_defines: {\n\t  std::string field(opt_arg);\n\t  std::shared_ptr<database::query_term>\n\t    term (new database::defines_term(field));\n\t  query_and->add_term(term);\n\t  break; }\n\n\tcase opt_matches: {\n\t  const char *arg = strchr(opt_arg, ':');\n\t  if (arg)\n\t    {\n\t      std::string field(opt_arg, arg - opt_arg);\n\t      std::string re(arg + 1);\n\t      std::shared_ptr<database::query_term>\n\t\tterm (new database::matches_term(field, re));\n\t      query_and->add_term(term);\n\t    }\n\t  else\n\t    {\n\t      print_usage(args);\n\t      return 1;\n\t    }\n\t  break; }\n\n\tcase opt_contains: {\n\t  const char *arg = strchr(opt_arg, ':');\n\t  if (arg)\n\t    {\n\t      std::string field(opt_arg, arg - opt_arg);\n\t      std::string key(arg + 1);\n\t      std::shared_ptr<database::query_term>\n\t\tterm (new database::contains_term(field, key));\n\t      query_and->add_term(term);\n\t    }\n\t  else\n\t    {\n\t      print_usage(args);\n\t      return 1;\n\t    }\n\t  break; }\n\n\tcase opt_compare: {\n\t  const char *arg = opt_arg;\n\t  arg += strcspn(arg, \"=!<>\");\n\t  if (*arg)\n\t    {\n\t      std::string field(opt_arg, arg - opt_arg);\n\t      database::compare_term::compare_op op;\n\t      if (arg[0] == '=')\n\t\top = database::compare_term::op_equal, arg += 1;\n\t      else if (arg[0] == '!' && arg[1] == '=')\n\t\top = database::compare_term::op_not_equal, arg += 2;\n\t      else if (arg[0] == '<' && arg[1] == '=')\n\t\top = database::compare_term::op_less_or_equal, arg += 2;\n\t      else if (arg[0] == '<')\n\t\top = database::compare_term::op_less, arg += 1;\n\t      else if (arg[0] == '>' && arg[1] == '=')\n\t\top = database::compare_term::op_greater_or_equal, arg += 2;\n\t      else if (arg[0] == '>')\n\t\top = database::compare_term::op_greater, arg += 1;\n\t      else\n\t\t{\n\t\t  print_usage(args);\n\t\t  return 1;\n\t\t}\n\t      field_id id = lookup_field_id(field.c_str());\n\t      field_data_type type = lookup_field_data_type(id);\n\t      if (type == type_string)\n\t\ttype = type_number;\n\t      std::string tem(arg);\n\t      double rhs;\n\t      if (parse_value(tem, type, &rhs, nullptr))\n\t\t{\n\t\t  std::shared_ptr<database::query_term>\n\t\t    term (new database::compare_term(field, op, rhs));\n\t\t  query_and->add_term(term);\n\t\t}\n\t      else\n\t\t{\n\t\t  print_usage(args);\n\t\t  return 1;\n\t\t}\n\t    }\n\t  else\n\t    {\n\t      print_usage(args);\n\t      return 1;\n\t    }\n\t  break; }\n\n\tcase opt_interval:\n\t  if (!parse_date_interval(std::string(opt_arg), &interval))\n\t    {\n\t      fprintf(stderr, \"Error: invalid time interval: %s\\n\", opt_arg);\n\t      return 1;\n\t    }\n\t  break;\n\n\tcase opt_field:\n\t  if (const char *ptr = strchr(opt_arg, ':'))\n\t    {\n\t      if (group_keywords)\n\t\t{\n\t\t  fputs(\"Error: cannot specify both keywords and size\\n\",\n\t\t\tstderr);\n\t\t  return 1;\n\t\t}\n\n\t      group_field.clear();\n\t      group_field.append(opt_arg, ptr - opt_arg);\n\n\t      field_id id = lookup_field_id(group_field.c_str());\n\t      field_data_type type = lookup_field_data_type(id);\n\n\t      if (!parse_value(std::string(ptr+1), type, &group_size, nullptr))\n\t\t{\n\t\t  fprintf(stderr, \"Error: invalid group size: %s\\n\", ptr+1);\n\t\t  return 1;\n\t\t}\n\t    }\n\t  else\n\t    group_field = opt_arg;\n\t  break;\n\n\tcase opt_course:\n\t  group_field = \"course\";\n\t  break;\n\n\tcase opt_keywords:\n\t  if (group_size != 0)\n\t    {\n\t      fputs(\"Error: cannot specify both keywords and size\\n\", stderr);\n\t      return 1;\n\t    }\n\t  group_field = opt_arg;\n\t  group_keywords = true;\n\t  break;\n\n\tcase opt_equipment:\n\t  group_field = \"equipment\";\n\t  group_keywords = true;\n\t  break;\n\n\tcase opt_format:\n\t  format = opt_arg;\n\t  break;\n\n\tcase arguments::opt_error:\n\t  fprintf(stderr, \"Error: invalid argument: %s\\n\\n\", opt_arg);\n\t  print_usage(args);\n\t  return 1;\n\t}\n    }\n\n  if (format == nullptr && table_format == nullptr)\n    table_format = \"%-{key} %{distance} %@{distance}\";\n\n  if (args.argc() != 0)\n    {\n      std::vector<date_range> dates;\n\n      if (!args.make_date_range(dates))\n\treturn 1;\n\n      query.set_date_ranges(dates);\n    }\n  else\n    query.add_date_range(date_range(0, time(nullptr)));\n\n  database db;\n\n  std::vector<database::item_ref> items;\n  db.execute_query(query, items);\n\n  if (group_field.size() != 0)\n    {\n      if (group_keywords)\n\t{\n\t  keyword_group g(group_field.c_str());\n\t  apply_group(g, items, format, table_format);\n\t}\n      else if (group_size > 0)\n\t{\n\t  value_group g(group_field.c_str(), group_size);\n\t  apply_group(g, items, format, table_format);\n\t}\n      else\n\t{\n\t  string_group g(group_field.c_str());\n\t  apply_group(g, items, format, table_format);\n\t}\n    }\n  else if (interval.count > 0)\n    {\n      interval_group g(interval);\n      apply_group(g, items, format, table_format);\n    }\n\n  return 0;\n}\n\nint\nmain(int argc, const char **argv)\n{\n  arguments args(argc, argv);\n\n  const char *interval = nullptr;\n\n  if (args.program_name_p(\"act-daily\"))\n    {\n      interval = \"day\";\n    }\n  else if (args.program_name_p(\"act-weekly\"))\n    {\n      interval = \"week\";\n    }\n  else if (args.program_name_p(\"act-monthly\"))\n    {\n      interval = \"month\";\n    }\n  else if (args.program_name_p(\"act-yearly\"))\n    {\n      interval = \"year\";\n    }\n\n  if (interval != nullptr)\n    {\n      args.push_front(interval);\n      args.push_front(\"--interval\");\n    }\n\n  return act_fold(args);\n}\n<commit_msg>fix fold's --table option<commit_after>\/\/ -*- c-style: gnu -*-\n\n#include \"act-activity.h\"\n#include \"act-activity-accum.h\"\n#include \"act-arguments.h\"\n#include \"act-config.h\"\n#include \"act-database.h\"\n#include \"act-format.h\"\n#include \"act-output-table.h\"\n#include \"act-util.h\"\n\n#include <cmath>\n#include <map>\n#include <xlocale.h>\n\nusing namespace act;\n\nnamespace {\n\nenum option_id\n{\n  opt_grep,\n  opt_defines,\n  opt_matches,\n  opt_contains,\n  opt_compare,\n  opt_interval,\n  opt_field,\n  opt_course,\n  opt_keywords,\n  opt_equipment,\n  opt_format,\n  opt_table,\n};\n\nconst arguments::option options[] =\n{\n  {opt_grep, \"grep\", 'g', \"REGEXP\", \"Add grep-body query term.\"},\n  {opt_defines, \"defines\", 'd', \"FIELD\", \"Add defines-field query term.\"},\n  {opt_matches, \"matches\", 'm', \"FIELD:REGEXP\", \"Add re-match query term.\"},\n  {opt_contains, \"contains\", 'c', \"FIELD:KEYWORD\", \"Add keyword query term.\"},\n  {opt_compare, \"compare\", 'C', \"FIELDxVALUE\",\n   \"Add compare query term. 'x' from: = != < > <= >=\"},\n  {opt_interval, \"interval\", 'i', \"INTERVAL\", \"Group by date-interval.\"},\n  {opt_field, \"field\", 'f', \"FIELD[:SIZE]\", \"Group by the named field.\"},\n  {opt_course, \"course\", 0, nullptr, \"Group by Course field.\"},\n  {opt_keywords, \"keywords\", 'k', \"FIELD\", \"Group by keyword.\"},\n  {opt_equipment, \"equipment\", 0, nullptr, \"Group by equipment.\"},\n  {opt_format, \"format\", 'f', \"FORMAT\", \"Format string.\"},\n  {opt_table, \"table\", 't', \"FORMAT\", \"Table format string.\"},\n  {arguments::opt_eof},\n};\n\nvoid\nprint_usage(const arguments &args)\n{\n  fprintf(stderr, \"usage: %s [OPTIONS...]\\n\\n\", args.program_name());\n  fputs(\"where OPTIONS are any of:\\n\\n\", stderr);\n\n  arguments::print_options(options, stderr);\n\n  fputs(\"\\n\", stderr);\n}\n\nstruct string_group\n{\n  const char *field;\n\n  typedef std::map<std::string, activity_accum,\n    case_insensitive_string_compare> group_map;\n\n  group_map map;\n\n  explicit string_group(const char *field);\n\n  void insert(const activity &a);\n\n  void format_key(std::string &buf, const std::string &key) const;\n};\n\nstruct keyword_group\n{\n  field_id field;\n\n  typedef std::map<std::string, activity_accum,\n    case_insensitive_string_compare> group_map;\n\n  group_map map;\n\n  keyword_group(const char *field);\n\n  void insert(const activity &a);\n\n  void format_key(std::string &buf, const std::string &key) const;\n};\n\nstruct value_group\n{\n  const char *field;\n  field_id field_id;\n  double bucket_size;\n  double bucket_scale;\n\n  typedef std::map<int, activity_accum> group_map;\n\n  group_map map;\n\n  explicit value_group(const char *field, double bucket_size);\n\n  void insert(const activity &a);\n\n  void format_key(std::string &buf, int key) const;\n};\n\nstruct interval_group\n{\n  date_interval interval;\n\n  typedef std::map<int, activity_accum> group_map;\n\n  group_map map;\n\n  explicit interval_group(const date_interval &interval);\n\n  void insert(const activity &a);\n\n  void format_key(std::string &buf, int key) const;\n};\n\nstring_group::string_group(const char *f)\n: field(f)\n{\n}\n\nvoid\nstring_group::insert(const activity &a)\n{\n  if(const std::string *ptr = a.field_ptr(field))\n    {\n      map[*ptr].add(a);\n    }\n}\n\nvoid\nstring_group::format_key(std::string &buf, const std::string &key) const\n{\n  buf.append(key);\n}\n\nkeyword_group::keyword_group(const char *f)\n: field(lookup_field_id(f))\n{\n}\n\nvoid\nkeyword_group::insert(const activity &a)\n{\n  if(const std::vector<std::string> *ptr = a.field_keywords_ptr(field))\n    {\n      for (const auto &it : *ptr)\n\tmap[it].add(a);\n    }\n}\n\nvoid\nkeyword_group::format_key(std::string &buf, const std::string &key) const\n{\n  buf.append(key);\n}\n\nvalue_group::value_group(const char *f, double size)\n: field(f),\n  field_id(lookup_field_id(f)),\n  bucket_size(size),\n  bucket_scale(1 \/ size)\n{\n}\n\nvoid\nvalue_group::insert(const activity &a)\n{\n  double value = 0;\n\n  if (field_id != field_custom)\n    value = a.field_value(field_id);\n  else if (const std::string *ptr = a.field_ptr(field))\n    parse_number(*ptr, &value);\n\n  if (value == 0)\n    return;\n\n  int idx = (int) floor(value * bucket_scale);\n\n  map[idx].add(a);\n}\n\nvoid\nvalue_group::format_key(std::string &buf, int key) const\n{\n  double min = key * bucket_size;\n  double max = (key + 1) * bucket_size;\n\n  field_data_type type = lookup_field_data_type(field_id);\n\n  buf.push_back('[');\n  format_value(buf, type, min, unit_unknown);\n  buf.append(\", \");\n  format_value(buf, type, max, unit_unknown);\n  buf.push_back(')');\n}\n\ninterval_group::interval_group(const date_interval &i)\n: interval(i)\n{\n}\n\nvoid\ninterval_group::insert(const activity &a)\n{\n  time_t date = a.date();\n  if (date == 0)\n    return;\n\n  int idx = interval.date_index(date);\n\n  map[idx].add(a);\n}\n\nvoid\ninterval_group::format_key(std::string &buf, int key) const\n{\n  interval.append_date(buf, key);\n}\n\ntemplate<typename T> void\noutput_group_format(T &g, const char *format)\n{\n  for (const auto &it : g.map)\n    {\n      std::string key;\n      g.format_key(key, it.first);\n      it.second.printf(format, key.c_str());\n    }\n}\n\ntemplate<typename T> void\noutput_group_table(T &g, const char *format)\n{\n  output_table tab;\n\n  for (const auto &it : g.map)\n    {\n      tab.begin_row();\n\n      std::string key;\n      g.format_key(key, it.first);\n      it.second.print_row(tab, format, key.c_str());\n\n      tab.end_row();\n    }\n\n  tab.print();\n}\n\ntemplate<typename T> void\napply_group(T &g, const std::vector<database::item_ref> &items,\n\t    const char *format, const char *table_format)\n{\n  for (const auto &it : items)\n    g.insert(activity(it->storage()));\n  \n  if (format != nullptr)\n    output_group_format(g, format);\n\n  if (table_format != nullptr)\n    output_group_table(g, table_format);\n}\n\n} \/\/ anonymous namespace\n\nint\nact_fold(arguments &args)\n{\n  database::query query;\n\n  std::shared_ptr<database::and_term> query_and (new database::and_term);\n  query.set_term(query_and);\n\n  std::string group_field;\n  bool group_keywords = false;\n  double group_size = 0;\n  date_interval interval(date_interval::days, 0);\n\n  const char *format = nullptr;\n  const char *table_format = nullptr;\n\n  while (1)\n    {\n      const char *opt_arg = nullptr;\n      int opt = args.getopt(options, &opt_arg);\n      if (opt == arguments::opt_eof)\n\tbreak;\n\n      switch (opt)\n\t{\n\tcase opt_grep: {\n\t  std::string re(opt_arg);\n\t  std::shared_ptr<database::query_term>\n\t    term (new database::grep_term(re));\n\t  query_and->add_term(term);\n\t  break; }\n\n\tcase opt_defines: {\n\t  std::string field(opt_arg);\n\t  std::shared_ptr<database::query_term>\n\t    term (new database::defines_term(field));\n\t  query_and->add_term(term);\n\t  break; }\n\n\tcase opt_matches: {\n\t  const char *arg = strchr(opt_arg, ':');\n\t  if (arg)\n\t    {\n\t      std::string field(opt_arg, arg - opt_arg);\n\t      std::string re(arg + 1);\n\t      std::shared_ptr<database::query_term>\n\t\tterm (new database::matches_term(field, re));\n\t      query_and->add_term(term);\n\t    }\n\t  else\n\t    {\n\t      print_usage(args);\n\t      return 1;\n\t    }\n\t  break; }\n\n\tcase opt_contains: {\n\t  const char *arg = strchr(opt_arg, ':');\n\t  if (arg)\n\t    {\n\t      std::string field(opt_arg, arg - opt_arg);\n\t      std::string key(arg + 1);\n\t      std::shared_ptr<database::query_term>\n\t\tterm (new database::contains_term(field, key));\n\t      query_and->add_term(term);\n\t    }\n\t  else\n\t    {\n\t      print_usage(args);\n\t      return 1;\n\t    }\n\t  break; }\n\n\tcase opt_compare: {\n\t  const char *arg = opt_arg;\n\t  arg += strcspn(arg, \"=!<>\");\n\t  if (*arg)\n\t    {\n\t      std::string field(opt_arg, arg - opt_arg);\n\t      database::compare_term::compare_op op;\n\t      if (arg[0] == '=')\n\t\top = database::compare_term::op_equal, arg += 1;\n\t      else if (arg[0] == '!' && arg[1] == '=')\n\t\top = database::compare_term::op_not_equal, arg += 2;\n\t      else if (arg[0] == '<' && arg[1] == '=')\n\t\top = database::compare_term::op_less_or_equal, arg += 2;\n\t      else if (arg[0] == '<')\n\t\top = database::compare_term::op_less, arg += 1;\n\t      else if (arg[0] == '>' && arg[1] == '=')\n\t\top = database::compare_term::op_greater_or_equal, arg += 2;\n\t      else if (arg[0] == '>')\n\t\top = database::compare_term::op_greater, arg += 1;\n\t      else\n\t\t{\n\t\t  print_usage(args);\n\t\t  return 1;\n\t\t}\n\t      field_id id = lookup_field_id(field.c_str());\n\t      field_data_type type = lookup_field_data_type(id);\n\t      if (type == type_string)\n\t\ttype = type_number;\n\t      std::string tem(arg);\n\t      double rhs;\n\t      if (parse_value(tem, type, &rhs, nullptr))\n\t\t{\n\t\t  std::shared_ptr<database::query_term>\n\t\t    term (new database::compare_term(field, op, rhs));\n\t\t  query_and->add_term(term);\n\t\t}\n\t      else\n\t\t{\n\t\t  print_usage(args);\n\t\t  return 1;\n\t\t}\n\t    }\n\t  else\n\t    {\n\t      print_usage(args);\n\t      return 1;\n\t    }\n\t  break; }\n\n\tcase opt_interval:\n\t  if (!parse_date_interval(std::string(opt_arg), &interval))\n\t    {\n\t      fprintf(stderr, \"Error: invalid time interval: %s\\n\", opt_arg);\n\t      return 1;\n\t    }\n\t  break;\n\n\tcase opt_field:\n\t  if (const char *ptr = strchr(opt_arg, ':'))\n\t    {\n\t      if (group_keywords)\n\t\t{\n\t\t  fputs(\"Error: cannot specify both keywords and size\\n\",\n\t\t\tstderr);\n\t\t  return 1;\n\t\t}\n\n\t      group_field.clear();\n\t      group_field.append(opt_arg, ptr - opt_arg);\n\n\t      field_id id = lookup_field_id(group_field.c_str());\n\t      field_data_type type = lookup_field_data_type(id);\n\n\t      if (!parse_value(std::string(ptr+1), type, &group_size, nullptr))\n\t\t{\n\t\t  fprintf(stderr, \"Error: invalid group size: %s\\n\", ptr+1);\n\t\t  return 1;\n\t\t}\n\t    }\n\t  else\n\t    group_field = opt_arg;\n\t  break;\n\n\tcase opt_course:\n\t  group_field = \"course\";\n\t  break;\n\n\tcase opt_keywords:\n\t  if (group_size != 0)\n\t    {\n\t      fputs(\"Error: cannot specify both keywords and size\\n\", stderr);\n\t      return 1;\n\t    }\n\t  group_field = opt_arg;\n\t  group_keywords = true;\n\t  break;\n\n\tcase opt_equipment:\n\t  group_field = \"equipment\";\n\t  group_keywords = true;\n\t  break;\n\n\tcase opt_format:\n\t  format = opt_arg;\n\t  break;\n\n\tcase opt_table:\n\t  table_format = opt_arg;\n\t  break;\n\n\tcase arguments::opt_error:\n\t  fprintf(stderr, \"Error: invalid argument: %s\\n\\n\", opt_arg);\n\t  print_usage(args);\n\t  return 1;\n\t}\n    }\n\n  if (format == nullptr && table_format == nullptr)\n    table_format = \"%-{key} %{distance} %@{distance}\";\n\n  if (args.argc() != 0)\n    {\n      std::vector<date_range> dates;\n\n      if (!args.make_date_range(dates))\n\treturn 1;\n\n      query.set_date_ranges(dates);\n    }\n  else\n    query.add_date_range(date_range(0, time(nullptr)));\n\n  database db;\n\n  std::vector<database::item_ref> items;\n  db.execute_query(query, items);\n\n  if (group_field.size() != 0)\n    {\n      if (group_keywords)\n\t{\n\t  keyword_group g(group_field.c_str());\n\t  apply_group(g, items, format, table_format);\n\t}\n      else if (group_size > 0)\n\t{\n\t  value_group g(group_field.c_str(), group_size);\n\t  apply_group(g, items, format, table_format);\n\t}\n      else\n\t{\n\t  string_group g(group_field.c_str());\n\t  apply_group(g, items, format, table_format);\n\t}\n    }\n  else if (interval.count > 0)\n    {\n      interval_group g(interval);\n      apply_group(g, items, format, table_format);\n    }\n\n  return 0;\n}\n\nint\nmain(int argc, const char **argv)\n{\n  arguments args(argc, argv);\n\n  const char *interval = nullptr;\n\n  if (args.program_name_p(\"act-daily\"))\n    {\n      interval = \"day\";\n    }\n  else if (args.program_name_p(\"act-weekly\"))\n    {\n      interval = \"week\";\n    }\n  else if (args.program_name_p(\"act-monthly\"))\n    {\n      interval = \"month\";\n    }\n  else if (args.program_name_p(\"act-yearly\"))\n    {\n      interval = \"year\";\n    }\n\n  if (interval != nullptr)\n    {\n      args.push_front(interval);\n      args.push_front(\"--interval\");\n    }\n\n  return act_fold(args);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2019 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 <seastar\/core\/shared_ptr.hh>\n#include <seastar\/core\/file.hh>\n#include \"seastarx.hh\"\n\n#include \"db\/timeout_clock.hh\"\n\nstruct reader_resources {\n    int count = 0;\n    ssize_t memory = 0;\n\n    reader_resources() = default;\n\n    reader_resources(int count, ssize_t memory)\n        : count(count)\n        , memory(memory) {\n    }\n\n    bool operator>=(const reader_resources& other) const {\n        return count >= other.count && memory >= other.memory;\n    }\n\n    reader_resources& operator-=(const reader_resources& other) {\n        count -= other.count;\n        memory -= other.memory;\n        return *this;\n    }\n\n    reader_resources& operator+=(const reader_resources& other) {\n        count += other.count;\n        memory += other.memory;\n        return *this;\n    }\n\n    explicit operator bool() const {\n        return count > 0 || memory > 0;\n    }\n};\n\nclass reader_concurrency_semaphore;\n\n\/\/\/ A permit for a specific read.\n\/\/\/\n\/\/\/ Used to track the read's resource consumption and wait for admission to read\n\/\/\/ from the disk.\n\/\/\/ Use `consume_memory()` to register memory usage. Use `wait_admission()` to\n\/\/\/ wait for admission, before reading from the disk. Both methods return a\n\/\/\/ `resource_units` RAII object that should be held onto while the respective\n\/\/\/ resources are in use.\nclass reader_permit {\n    friend class reader_concurrency_semaphore;\n\npublic:\n    class resource_units {\n        reader_concurrency_semaphore* _semaphore;\n        reader_resources _resources;\n\n        friend class reader_permit;\n        friend class reader_concurrency_semaphore;\n    private:\n        resource_units(reader_concurrency_semaphore& semaphore, reader_resources res) noexcept;\n    public:\n        resource_units(const resource_units&) = delete;\n        resource_units(resource_units&&) noexcept;\n        ~resource_units();\n        resource_units& operator=(const resource_units&) = delete;\n        resource_units& operator=(resource_units&&) noexcept;\n        void add(resource_units&& o);\n        void reset(reader_resources res = {});\n    };\n\nprivate:\n    reader_concurrency_semaphore* _semaphore;\n\nprivate:\n    explicit reader_permit(reader_concurrency_semaphore& semaphore);\n\npublic:\n    bool operator==(const reader_permit& o) const {\n        return _semaphore == o._semaphore;\n    }\n\n    reader_concurrency_semaphore& semaphore() {\n        return *_semaphore;\n    }\n\n    future<resource_units> wait_admission(size_t memory, db::timeout_clock::time_point timeout);\n\n    resource_units consume_memory(size_t memory = 0);\n\n    resource_units consume_resources(reader_resources res);\n\n    void release();\n};\n\ntemplate <typename Char>\ntemporary_buffer<Char> make_tracked_temporary_buffer(temporary_buffer<Char> buf, reader_permit& permit) {\n    return temporary_buffer<Char>(buf.get_write(), buf.size(),\n            make_deleter(buf.release(), [units = permit.consume_memory(buf.size())] () mutable { units.reset(); }));\n}\n\nfile make_tracked_file(file f, reader_permit p);\n<commit_msg>reader_permit: reader_resources: add operator- and operator+<commit_after>\/*\n * Copyright (C) 2019 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 <seastar\/core\/shared_ptr.hh>\n#include <seastar\/core\/file.hh>\n#include \"seastarx.hh\"\n\n#include \"db\/timeout_clock.hh\"\n\nstruct reader_resources {\n    int count = 0;\n    ssize_t memory = 0;\n\n    reader_resources() = default;\n\n    reader_resources(int count, ssize_t memory)\n        : count(count)\n        , memory(memory) {\n    }\n\n    bool operator>=(const reader_resources& other) const {\n        return count >= other.count && memory >= other.memory;\n    }\n\n    reader_resources operator-(const reader_resources& other) const {\n        return reader_resources{count - other.count, memory - other.memory};\n    }\n\n    reader_resources& operator-=(const reader_resources& other) {\n        count -= other.count;\n        memory -= other.memory;\n        return *this;\n    }\n\n    reader_resources operator+(const reader_resources& other) const {\n        return reader_resources{count + other.count, memory + other.memory};\n    }\n\n    reader_resources& operator+=(const reader_resources& other) {\n        count += other.count;\n        memory += other.memory;\n        return *this;\n    }\n\n    explicit operator bool() const {\n        return count > 0 || memory > 0;\n    }\n};\n\nclass reader_concurrency_semaphore;\n\n\/\/\/ A permit for a specific read.\n\/\/\/\n\/\/\/ Used to track the read's resource consumption and wait for admission to read\n\/\/\/ from the disk.\n\/\/\/ Use `consume_memory()` to register memory usage. Use `wait_admission()` to\n\/\/\/ wait for admission, before reading from the disk. Both methods return a\n\/\/\/ `resource_units` RAII object that should be held onto while the respective\n\/\/\/ resources are in use.\nclass reader_permit {\n    friend class reader_concurrency_semaphore;\n\npublic:\n    class resource_units {\n        reader_concurrency_semaphore* _semaphore;\n        reader_resources _resources;\n\n        friend class reader_permit;\n        friend class reader_concurrency_semaphore;\n    private:\n        resource_units(reader_concurrency_semaphore& semaphore, reader_resources res) noexcept;\n    public:\n        resource_units(const resource_units&) = delete;\n        resource_units(resource_units&&) noexcept;\n        ~resource_units();\n        resource_units& operator=(const resource_units&) = delete;\n        resource_units& operator=(resource_units&&) noexcept;\n        void add(resource_units&& o);\n        void reset(reader_resources res = {});\n    };\n\nprivate:\n    reader_concurrency_semaphore* _semaphore;\n\nprivate:\n    explicit reader_permit(reader_concurrency_semaphore& semaphore);\n\npublic:\n    bool operator==(const reader_permit& o) const {\n        return _semaphore == o._semaphore;\n    }\n\n    reader_concurrency_semaphore& semaphore() {\n        return *_semaphore;\n    }\n\n    future<resource_units> wait_admission(size_t memory, db::timeout_clock::time_point timeout);\n\n    resource_units consume_memory(size_t memory = 0);\n\n    resource_units consume_resources(reader_resources res);\n\n    void release();\n};\n\ntemplate <typename Char>\ntemporary_buffer<Char> make_tracked_temporary_buffer(temporary_buffer<Char> buf, reader_permit& permit) {\n    return temporary_buffer<Char>(buf.get_write(), buf.size(),\n            make_deleter(buf.release(), [units = permit.consume_memory(buf.size())] () mutable { units.reset(); }));\n}\n\nfile make_tracked_file(file f, reader_permit p);\n<|endoftext|>"}
{"text":"<commit_before>\/\/      sites.cpp\n\/\/      \n\/\/      Copyright 2011 Florian Weber <florian.weber@sfz-bw.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 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, write to the Free Software\n\/\/      Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n\/\/      MA 02110-1301, USA.\n\/\/      \n\/\/      \n\n\n#include \"actions.hpp\"\n#include \"blogentry.hpp\"\n#include \"date.hpp\"\n#include \"files.hpp\"\n#include \"lines.hpp\"\n#include \"os_commands.hpp\"\n\n\n#include <iostream>\n#include <cstdlib>\n\nusing namespace std;\n\nint create_all(settings &S){\n\tread_entries(S,true);\n\tstring filename;\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tfilename=S.single_entries_dir+(*it)->get_id()+\".html\";\n\t\twrite_page(*it,S,filename);\n\t\t\n\t}\n\t\n\tif(S.number_of_mainpageposts<=-1||int(S.blogentries.size())<=S.number_of_mainpageposts){\n\t\twrite_page(S.blogentries,S,S.blog);\n\t}\n\telse{\n\t\tlist<blogentry*> mainpageposts;\n\t\tint i=0;\n\t\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\t\tif(i<S.number_of_mainpageposts){\n\t\t\t\t++i;\n\t\t\t\tmainpageposts.push_back(*it);\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\t\twrite_page(mainpageposts,S,S.blog);\n\t}\n\t\n\tcreate_rss(S);\n\tcreate_tags_page(S);\n\treturn 0;\n}\n\nint create_latest(settings &S){\n\tif(S.number_of_mainpageposts<0){\n\t\treturn create_all(S);\n\t}\n\tread_entries(S,false);\n\tlist<blogentry*> mainpageposts;\n\tstring filename;\n\tint i=0;\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif(i>=S.number_of_mainpageposts){\n\t\t\tbreak;\n\t\t}\n\t\t++i;\n\t\tfilename=S.single_entries_dir+(*it)->get_id()+\".html\";\n\t\twrite_page(*it,S,filename);\n\t\tmainpageposts.push_back(*it);\n\t}\n\twrite_page(mainpageposts,S,S.blog);\n\tcreate_rss(S);\n\treturn 0;\n}\n\nint create(settings &S,ID id){\n\tstring filename;\n\tblogentry *entry=NULL;\n\tread_entries(S,false);\n\tint n=0,i=0;\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif(i>=S.number_of_mainpageposts&&i>=int(S.blogentries.size())){\n\t\t\tbreak;\n\t\t}\n\t\t++i;\n\t\tif((*it)->id()==id){\n\t\t\tn=i;\n\t\t\tentry=*it;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(entry==NULL){\n\t\treturn 1;\n\t}\n\tif(n<=S.number_of_mainpageposts){\n\t\treturn create_latest(S);\n\t}\n\tfilename=S.single_entries_dir+entry->get_id()+\".html\";\n\twrite_page(entry,S,filename);\n\treturn 0;\n}\n\nint create_rss(settings &S){\n\tdeque<string> tags;\n\tif(S.rss_feed.empty()){\n\t\treturn 1;\n\t}\n\tLINES feed,content;\n\tfeed.push_back(string(\"<?xml version=\\\"1.0\\\" encoding=\\\"utf-8\\\"?>\"));\n\tfeed.push_back(string(\"<rss version=\\\"2.0\\\">\\n\\t<channel>\"));\n\tfeed+=read_file(S.rss_channel_description_file);\n\tint i=0;\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif(i>=S.number_of_mainpageposts){\n\t\t\tbreak;\n\t\t}\n\t\t++i;\n\t\tcontent=push_string_to_front_of_every_line((*it)->content(),\"\\t\\t\\t\\t\");\n\t\treplace(content,\"href=\\\"\/\",\"href=\\\"\"+S.url+\"\/\");\n\t\treplace(content,\"src=\\\"\/\",\"src=\\\"\"+S.url+\"\/\");\n\t\t\n\t\tfeed.push_back(string(\"\\t\\t<item>\"));\n\t\tfeed.push_back(string(\"\\t\\t\\t<title>\")+(*it)->get_heading()+\"<\/title>\");\n\t\tfeed.push_back(string(\"\\t\\t\\t<link>\")+(*it)->get_url(S)+\".html<\/link>\");\n\t\tfeed.push_back(string(\"\\t\\t\\t<description><![CDATA[\"));\n\t\tfeed+=content;\n\t\tfeed.push_back(string(\"\\t\\t\\t]]><\/description>\"));\n\t\t\n\t\t\/\/\/optional data:\n\t\tif(!(*it)->get_iso_date().empty()){\n\t\t\tfeed.push_back(string(\"\\t\\t\\t<pubDate>\")+(*it)->get_iso_date()+\"<\/pubDate>\");\n\t\t}\n\t\tfeed.push_back(string(\"\\t\\t\\t<guid>\")+(*it)->get_url(S)+\".html<\/guid>\");\n\t\t\n\t\ttags=(*it)->get_tags();\n\t\tfor(deque<string>::iterator it=tags.begin();it!=tags.end();++it){\n\t\t\tif(!it->empty()){\n\t\t\t\tfeed.push_back(string(\"\\t\\t\\t<category>\")+*it+\"<\/category>\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tfeed.push_back(string(\"\\t\\t<\/item>\"));\n\t}\n\tfeed.push_back(string(\"\\t<\/channel>\\n<\/rss>\"));\n\twrite_file(S.rss_feed,feed);\n\treturn 0;\n}\n\n\nint import(settings &S,string filename){\n\tstring heading, date, content_file, comment_file, conf_file, tags;\n\tLINES data=read_file(filename), conf_file_content;\n\tlist<string> conf_lines;\n\tint number_of_conf_lines=0;\n\t\n\tfor(LINES::iterator it=data.begin();it!=data.end();++it){\n\t\tif((*it)[0]=='#'){\n\t\t\tconf_lines.push_back(*it);\n\t\t\t++number_of_conf_lines;\n\t\t}\n\t\telse{\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(list<string>::iterator it=conf_lines.begin();it!=conf_lines.end();++it){\n\t\tif(it->find(\"#HEADING=\")==0){\n\t\t\theading=cut(*it,\"=\").second;\n\t\t}\n\t\telse if(it->find(\"#TAGS\")==0){\n\t\t\tif(tags.empty()){\n\t\t\t\ttags=cut(*it,\"=\").second;\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttags+=\",\"+cut(*it,\"=\").second;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif(number_of_conf_lines){\n\t\tdata.erase(data.begin(),data.begin()+number_of_conf_lines);\n\t}\n\t\n\twhile(heading==\"\"){\n\t\tcout<<\">>> \";\n\t\tgetline(cin,heading);\n\t}\n\t++S.last_id;\n\tcontent_file=S.datadir+S.last_id.get()+\".html\";\n\tcomment_file=S.datadir+S.last_id.get()+\"-comments.html\";\n\tconf_file=S.datadir+S.last_id.get()+\".conf\";\n\t\n\tconf_file_content.push_back(ID_SETTER+'='+S.last_id.get());\n\tconf_file_content.push_back(HEADING_SETTER+'='+heading);\n\tconf_file_content.push_back(CONTENT_FILE_SETTER+'='+content_file);\n\tconf_file_content.push_back(COMMENTS_FILE_SETTER+'='+comment_file);\n\tconf_file_content.push_back(DISPLAY_DATE_SETTER+'='+get_localdate(S));\n\tconf_file_content.push_back(ISO_DATE_SETTER+'='+get_isodate());\n\tconf_file_content.push_back(TAGS_SETTER+'='+tags);\n\t\n\twrite_file(conf_file,conf_file_content);\n\t\n\tinsert_to_begin_of_file(S.list_of_entries,conf_file);\n\t\n\twrite_file(content_file,data);\n\tcout<<S.last_id.get()<<\": \"<<heading<<endl;\n\tif(S.toc_in_singleentries){\n\t\tcreate_all(S);\n\t}\n\telse{\n\t\tcreate_latest(S);\n\t}\n\tchange_rights(content_file,\"a+w\");\n\twrite_file(comment_file,\"\");\n\tchange_rights(comment_file,\"a+w\");\n\tchange_rights(S.single_entries_dir+S.last_id.get()+\".html\",\"a+w\");\n\t\n\tcreate_tags_page(S);\n\treturn 0;\n}\n\nint edit(settings &S, ID id){\n\tstring filename=\"\", command;\n\tread_entries(S,false);\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif((*it)->id()==id){\n\t\t\tfilename=(*it)->get_filename();\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(filename==\"\"){\n\t\tcerr<<\"Error: Entry not found.\"<<endl;\n\t\treturn 1;\n\t}\n\tif(S.editor==\"\"){\n\t\tcerr<<\"Error: No editor specified.\"<<endl;\n\t\treturn 2;\n\t}\n\tcommand=S.editor+\" \"+filename;\n\t\n\tsystem(command.c_str());\n\t\n\treturn create(S,id);\n}\n\n\nint comment(settings &S,ID id,string filename){\n\tread_entries(S,false);\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif((*it)->id()==id){\n\t\t\t(*it)->new_comment(filename,S);\n\t\t\treturn create(S,id);\n\t\t}\n\t}\n\tcerr<<\"Not found\"<<endl;\n\treturn 1;\n}\n\nint edit_comment(settings &S, ID id){\n\tread_entries(S,false);\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif((*it)->id()==id){\n\t\t\tsystem((S.editor+\" \"+(*it)->get_comments_filename()).c_str());\n\t\t\treturn create(S,id);\n\t\t}\n\t}\n\tcerr<<\"Not found\"<<endl;\n\treturn 1;\n}\n\n\nint list_entries(settings &S){\n\tread_entries(S,false);\n\tfor(list<blogentry*>::reverse_iterator it=S.blogentries.rbegin();it!=S.blogentries.rend();++it){\n\t\tcout<<(*it)->get_id()<<\":\\t\"<<(*it)->get_heading()<<\"\\n\";\n\t}\n\tcout<<flush;\n\treturn 0;\n}\n\n\nlist<blogentry*> search(settings &S, string phrase){\n\tlist<blogentry*> results;\n\tLINES content;\n\tfor(list<blogentry *>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif((*it)->get_heading().find(phrase)!=string::npos){\n\t\t\tresults.push_back(*it);\n\t\t\tcontinue;\n\t\t}\n\t\telse{\n\t\t\tcontent=(*it)->content();\n\t\t\tfor(LINES::iterator content_it=content.begin();content_it!=content.end();++content_it){\n\t\t\t\tif(content_it->find(phrase)!=string::npos){\n\t\t\t\t\tresults.push_back(*it);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn results;\n}\n\n\nvoid print_search(settings &S,string phrase){\n\tread_entries(S,true);\n\tlist<blogentry*> results=search(S,phrase);\n\tfor(list<blogentry *>::iterator it=results.begin();it!=results.end();++it){\n\t\tcout<<(*it)->get_id()<<\":\\t\"<<(*it)->get_heading()<<endl;\n\t}\n}\n\n\n\nvoid print_html_search(settings &S,string phrase){\n\tread_entries(S,true);\n\tlist<blogentry*> results=search(S,phrase);\n\tif(results.empty()){\n\t\tcout<<\"<p class=\\\"search_results\\\">No results<\/p>\"<<endl;\n\t\treturn;\n\t}\n\tcout<<\"<ul class=\\\"search_results\\\">\"<<endl;\n\tfor(list<blogentry *>::iterator it=results.begin();it!=results.end();++it){\n\t\tcout<<\"<li><a href=\\\"\"<<(*it)->get_url(S)<<\"\\\">\"<<(*it)->get_heading()<<\"<\/a><\/li>\"<<endl;\n\t}\n\tcout<<\"<\/ul>\"<<endl;\n}<commit_msg>small performance improvement<commit_after>\/\/      sites.cpp\n\/\/      \n\/\/      Copyright 2011 Florian Weber <florian.weber@sfz-bw.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 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, write to the Free Software\n\/\/      Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n\/\/      MA 02110-1301, USA.\n\/\/      \n\/\/      \n\n\n#include \"actions.hpp\"\n#include \"blogentry.hpp\"\n#include \"date.hpp\"\n#include \"files.hpp\"\n#include \"lines.hpp\"\n#include \"os_commands.hpp\"\n\n\n#include <iostream>\n#include <cstdlib>\n\nusing namespace std;\n\nint create_all(settings &S){\n\tread_entries(S,true);\n\tstring filename;\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tfilename=S.single_entries_dir+(*it)->get_id()+\".html\";\n\t\twrite_page(*it,S,filename);\n\t\t\n\t}\n\t\n\tif(S.number_of_mainpageposts<=-1||int(S.blogentries.size())<=S.number_of_mainpageposts){\n\t\twrite_page(S.blogentries,S,S.blog);\n\t}\n\telse{\n\t\tlist<blogentry*> mainpageposts;\n\t\tint i=0;\n\t\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\t\tif(i<S.number_of_mainpageposts){\n\t\t\t\t++i;\n\t\t\t\tmainpageposts.push_back(*it);\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\t\twrite_page(mainpageposts,S,S.blog);\n\t}\n\t\n\tcreate_rss(S);\n\tcreate_tags_page(S);\n\treturn 0;\n}\n\nint create_latest(settings &S){\n\tif(S.number_of_mainpageposts<0){\n\t\treturn create_all(S);\n\t}\n\tread_entries(S,false);\n\tlist<blogentry*> mainpageposts;\n\tstring filename;\n\tint i=0;\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif(i>=S.number_of_mainpageposts){\n\t\t\tbreak;\n\t\t}\n\t\t++i;\n\t\tfilename=S.single_entries_dir+(*it)->get_id()+\".html\";\n\t\twrite_page(*it,S,filename);\n\t\tmainpageposts.push_back(*it);\n\t}\n\twrite_page(mainpageposts,S,S.blog);\n\tcreate_rss(S);\n\treturn 0;\n}\n\nint create(settings &S,ID id){\n\tstring filename;\n\tblogentry *entry=NULL;\n\tread_entries(S,false);\n\tint n=0,i=0;\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif(i>=S.number_of_mainpageposts&&i>=int(S.blogentries.size())){\n\t\t\tbreak;\n\t\t}\n\t\t++i;\n\t\tif((*it)->id()==id){\n\t\t\tn=i;\n\t\t\tentry=*it;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(entry==NULL){\n\t\treturn 1;\n\t}\n\tif(n<=S.number_of_mainpageposts){\n\t\treturn create_latest(S);\n\t}\n\tfilename=S.single_entries_dir+entry->get_id()+\".html\";\n\twrite_page(entry,S,filename);\n\treturn 0;\n}\n\nint create_rss(settings &S){\n\tdeque<string> tags;\n\tif(S.rss_feed.empty()){\n\t\treturn 1;\n\t}\n\tLINES feed,content;\n\tfeed.push_back(string(\"<?xml version=\\\"1.0\\\" encoding=\\\"utf-8\\\"?>\"));\n\tfeed.push_back(string(\"<rss version=\\\"2.0\\\">\\n\\t<channel>\"));\n\tfeed+=read_file(S.rss_channel_description_file);\n\tint i=0;\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif(i>=S.number_of_mainpageposts){\n\t\t\tbreak;\n\t\t}\n\t\t++i;\n\t\tcontent=push_string_to_front_of_every_line((*it)->content(),\"\\t\\t\\t\\t\");\n\t\treplace(content,\"href=\\\"\/\",\"href=\\\"\"+S.url+\"\/\");\n\t\treplace(content,\"src=\\\"\/\",\"src=\\\"\"+S.url+\"\/\");\n\t\t\n\t\tfeed.push_back(string(\"\\t\\t<item>\"));\n\t\tfeed.push_back(string(\"\\t\\t\\t<title>\")+(*it)->get_heading()+\"<\/title>\");\n\t\tfeed.push_back(string(\"\\t\\t\\t<link>\")+(*it)->get_url(S)+\".html<\/link>\");\n\t\tfeed.push_back(string(\"\\t\\t\\t<description><![CDATA[\"));\n\t\tfeed+=content;\n\t\tfeed.push_back(string(\"\\t\\t\\t]]><\/description>\"));\n\t\t\n\t\t\/\/\/optional data:\n\t\tif(!(*it)->get_iso_date().empty()){\n\t\t\tfeed.push_back(string(\"\\t\\t\\t<pubDate>\")+(*it)->get_iso_date()+\"<\/pubDate>\");\n\t\t}\n\t\tfeed.push_back(string(\"\\t\\t\\t<guid>\")+(*it)->get_url(S)+\".html<\/guid>\");\n\t\t\n\t\ttags=(*it)->get_tags();\n\t\tfor(deque<string>::iterator it=tags.begin();it!=tags.end();++it){\n\t\t\tif(!it->empty()){\n\t\t\t\tfeed.push_back(string(\"\\t\\t\\t<category>\")+*it+\"<\/category>\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tfeed.push_back(string(\"\\t\\t<\/item>\"));\n\t}\n\tfeed.push_back(string(\"\\t<\/channel>\\n<\/rss>\"));\n\twrite_file(S.rss_feed,feed);\n\treturn 0;\n}\n\n\nint import(settings &S,string filename){\n\tstring heading, date, content_file, comment_file, conf_file, tags;\n\tLINES data=read_file(filename), conf_file_content;\n\tlist<string> conf_lines;\n\tint number_of_conf_lines=0;\n\t\n\tfor(LINES::iterator it=data.begin();it!=data.end();++it){\n\t\tif((*it)[0]=='#'){\n\t\t\tconf_lines.push_back(*it);\n\t\t\t++number_of_conf_lines;\n\t\t}\n\t\telse{\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(list<string>::iterator it=conf_lines.begin();it!=conf_lines.end();++it){\n\t\tif(it->find(\"#HEADING=\")==0){\n\t\t\theading=cut(*it,\"=\").second;\n\t\t}\n\t\telse if(it->find(\"#TAGS\")==0){\n\t\t\tif(tags.empty()){\n\t\t\t\ttags=cut(*it,\"=\").second;\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttags+=\",\"+cut(*it,\"=\").second;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif(number_of_conf_lines){\n\t\tdata.erase(data.begin(),data.begin()+number_of_conf_lines);\n\t}\n\t\n\twhile(heading==\"\"){\n\t\tcout<<\">>> \";\n\t\tgetline(cin,heading);\n\t}\n\t++S.last_id;\n\tcontent_file=S.datadir+S.last_id.get()+\".html\";\n\tcomment_file=S.datadir+S.last_id.get()+\"-comments.html\";\n\tconf_file=S.datadir+S.last_id.get()+\".conf\";\n\t\n\tconf_file_content.push_back(ID_SETTER+'='+S.last_id.get());\n\tconf_file_content.push_back(HEADING_SETTER+'='+heading);\n\tconf_file_content.push_back(CONTENT_FILE_SETTER+'='+content_file);\n\tconf_file_content.push_back(COMMENTS_FILE_SETTER+'='+comment_file);\n\tconf_file_content.push_back(DISPLAY_DATE_SETTER+'='+get_localdate(S));\n\tconf_file_content.push_back(ISO_DATE_SETTER+'='+get_isodate());\n\tconf_file_content.push_back(TAGS_SETTER+'='+tags);\n\t\n\twrite_file(conf_file,conf_file_content);\n\t\n\tinsert_to_begin_of_file(S.list_of_entries,conf_file);\n\t\n\twrite_file(content_file,data);\n\tcout<<S.last_id.get()<<\": \"<<heading<<endl;\n\tif(S.toc_in_singleentries){\n\t\tcreate_all(S);\n\t}\n\telse{\n\t\tcreate_latest(S);\n\t}\n\tchange_rights(content_file,\"a+w\");\n\twrite_file(comment_file,\"\");\n\tchange_rights(comment_file,\"a+w\");\n\tchange_rights(S.single_entries_dir+S.last_id.get()+\".html\",\"a+w\");\n\t\n\tcreate_tags_page(S);\n\treturn 0;\n}\n\nint edit(settings &S, ID id){\n\tstring filename=\"\", command;\n\tread_entries(S,false);\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif((*it)->id()==id){\n\t\t\tfilename=(*it)->get_filename();\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(filename==\"\"){\n\t\tcerr<<\"Error: Entry not found.\"<<endl;\n\t\treturn 1;\n\t}\n\tif(S.editor==\"\"){\n\t\tcerr<<\"Error: No editor specified.\"<<endl;\n\t\treturn 2;\n\t}\n\tcommand=S.editor+\" \"+filename;\n\t\n\tsystem(command.c_str());\n\t\n\treturn create(S,id);\n}\n\n\nint comment(settings &S,ID id,string filename){\n\tread_entries(S,false);\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif((*it)->id()==id){\n\t\t\t(*it)->new_comment(filename,S);\n\t\t\treturn create(S,id);\n\t\t}\n\t}\n\tcerr<<\"Not found\"<<endl;\n\treturn 1;\n}\n\nint edit_comment(settings &S, ID id){\n\tread_entries(S,false);\n\tfor(list<blogentry*>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif((*it)->id()==id){\n\t\t\tsystem((S.editor+\" \"+(*it)->get_comments_filename()).c_str());\n\t\t\treturn create(S,id);\n\t\t}\n\t}\n\tcerr<<\"Not found\"<<endl;\n\treturn 1;\n}\n\n\nint list_entries(settings &S){\n\tread_entries(S,false);\n\tfor(list<blogentry*>::reverse_iterator it=S.blogentries.rbegin();it!=S.blogentries.rend();++it){\n\t\tcout<<(*it)->get_id()<<\":\\t\"<<(*it)->get_heading()<<\"\\n\";\n\t}\n\tcout<<flush;\n\treturn 0;\n}\n\n\nlist<blogentry*> search(settings &S, string phrase){\n\tlist<blogentry*> results;\n\tLINES content;\n\tfor(list<blogentry *>::iterator it=S.blogentries.begin();it!=S.blogentries.end();++it){\n\t\tif((*it)->get_heading().find(phrase)!=string::npos){\n\t\t\tresults.push_back(*it);\n\t\t\tcontinue;\n\t\t}\n\t\telse{\n\t\t\tcontent=(*it)->content();\n\t\t\tfor(LINES::iterator content_it=content.begin();content_it!=content.end();++content_it){\n\t\t\t\tif(content_it->find(phrase)!=string::npos){\n\t\t\t\t\tresults.push_back(*it);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn results;\n}\n\n\nvoid print_search(settings &S,string phrase){\n\tread_entries(S,false);\n\tlist<blogentry*> results=search(S,phrase);\n\tfor(list<blogentry *>::iterator it=results.begin();it!=results.end();++it){\n\t\tcout<<(*it)->get_id()<<\":\\t\"<<(*it)->get_heading()<<endl;\n\t}\n}\n\n\n\nvoid print_html_search(settings &S,string phrase){\n\tread_entries(S,true);\n\tlist<blogentry*> results=search(S,phrase);\n\tif(results.empty()){\n\t\tcout<<\"<p class=\\\"search_results\\\">No results<\/p>\"<<endl;\n\t\treturn;\n\t}\n\tcout<<\"<ul class=\\\"search_results\\\">\"<<endl;\n\tfor(list<blogentry *>::iterator it=results.begin();it!=results.end();++it){\n\t\tcout<<\"<li><a href=\\\"\"<<(*it)->get_url(S)<<\"\\\">\"<<(*it)->get_heading()<<\"<\/a><\/li>\"<<endl;\n\t}\n\tcout<<\"<\/ul>\"<<endl;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n   Copyright (C) 2017 Alexandr Akulich <akulichalexander@gmail.com>\n\n   This file is a part of TelegramQt 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\n#include <QObject>\n\n#include \"AccountStorage.hpp\"\n#include \"Client.hpp\"\n#include \"ClientSettings.hpp\"\n#include \"DataStorage.hpp\"\n#include \"Utils.hpp\"\n#include \"TelegramNamespace.hpp\"\n#include \"CAppInformation.hpp\"\n\n#include \"Operations\/ClientAuthOperation.hpp\"\n\n#include \"TelegramServer.hpp\"\n#include \"TelegramServerClient.hpp\"\n#include \"TelegramServerUser.hpp\"\n#include \"ServerRpcLayer.hpp\"\n#include \"Session.hpp\"\n#include \"DcConfiguration.hpp\"\n#include \"LocalCluster.hpp\"\n\n#include <QTest>\n#include <QSignalSpy>\n#include <QDebug>\n#include <QRegularExpression>\n\n#include \"keys_data.hpp\"\n#include \"TestUtils.hpp\"\n\n#define CLIENT_WORKS\n\nusing namespace Telegram;\n\nstruct UserData\n{\n    quint32 dcId;\n    QString phoneNumber;\n    QString firstName;\n    QString lastName;\n    QString password;\n    QByteArray passwordSalt;\n    QByteArray passwordHash;\n\n    void setName(const QString &first, const QString &last)\n    {\n        firstName = first;\n        lastName = last;\n    }\n\n    void unsetPassword()\n    {\n        setPassword(QString(), QByteArray());\n    }\n\n    void setPassword(const QString &pass, const QByteArray &salt)\n    {\n        password = pass;\n        setPasswordSalt(salt);\n    }\n\n    void setPasswordSalt(const QByteArray &salt)\n    {\n        if (salt.isEmpty()) {\n            passwordSalt.clear();\n            passwordHash.clear();\n            return;\n        }\n        QByteArray pwdData = salt + password.toUtf8() + salt;\n        passwordSalt = salt;\n        passwordHash = Utils::sha256(pwdData);\n    }\n};\n\nQ_DECLARE_METATYPE(UserData);\n\nCAppInformation *getAppInfo()\n{\n    static CAppInformation *appInfo = nullptr;\n    if (!appInfo) {\n        appInfo = new CAppInformation();\n        appInfo->setAppId(14617);\n        appInfo->setAppHash(QLatin1String(\"e17ac360fd072f83d5d08db45ce9a121\"));\n        appInfo->setAppVersion(QLatin1String(\"0.1\"));\n        appInfo->setDeviceInfo(QLatin1String(\"pc\"));\n        appInfo->setOsInfo(QLatin1String(\"GNU\/Linux\"));\n        appInfo->setLanguageCode(QLatin1String(\"en\"));\n    }\n    return appInfo;\n}\n\nTelegram::Server::User *tryAddUser(Telegram::Server::LocalCluster *cluster, const UserData &data)\n{\n    Telegram::Server::User *u = cluster->addUser(data.phoneNumber, data.dcId);\n    if (u) {\n        u->setFirstName(data.firstName);\n        u->setLastName(data.lastName);\n        if (!data.passwordHash.isEmpty()) {\n            u->setPassword(data.passwordSalt, data.passwordHash);\n        } else {\n            u->setPlainPassword(data.password);\n        }\n    } else {\n        qCritical() << \"Unable to add a user\";\n    }\n    return u;\n}\n\nclass TestServer : public Server::Server\n{\n    Q_OBJECT\npublic:\n    explicit TestServer(QObject *parent = nullptr)\n        : Server(parent)\n    {\n    }\n\n    QByteArray sendAppCode(const QString &identifier) override\n    {\n        const QByteArray hash = Server::Server::sendAppCode(identifier);\n        const Telegram::Server::AuthCode c = m_sentCodeMap.value(identifier);\n        emit authCodeSent(identifier, c.code);\n        return hash;\n    }\n\nsignals:\n    void authCodeSent(const QString &identifier, const QString &code);\n};\n\nstatic const UserData c_userWithPassword = []() {\n    UserData userData;\n    userData.dcId = 1;\n    userData.setName(QStringLiteral(\"First\"), QStringLiteral(\"Last\"));\n    userData.phoneNumber = QStringLiteral(\"123456\");\n    userData.password = QByteArrayLiteral(\"mypassword\");\n    userData.setPasswordSalt(QByteArrayLiteral(\"mysalt\"));\n    return userData;\n}();\n\nstatic const QVector<Telegram::DcOption> c_localDcOptions = {\n    Telegram::DcOption(QStringLiteral(\"127.0.0.1\"), 11441, 1),\n    Telegram::DcOption(QStringLiteral(\"127.0.0.2\"), 11442, 2),\n    Telegram::DcOption(QStringLiteral(\"127.0.0.3\"), 11443, 3),\n};\n\nstatic const Telegram::DcConfiguration c_localDcConfiguration = []() {\n    Telegram::DcConfiguration configuration;\n    configuration.dcOptions = c_localDcOptions;\n    return configuration;\n}();\n\nstatic const Telegram::Server::LocalCluster::ServerConstructor c_testServerConstructor = [](QObject *parent) -> Telegram::Server::Server* {\n    return new TestServer(parent);\n};\n\nclass tst_all : public QObject\n{\n    Q_OBJECT\npublic:\n    explicit tst_all(QObject *parent = nullptr);\n\nprivate slots:\n    void initTestCase();\n    void cleanupTestCase();\n    void testClientConnection_data();\n    void testClientConnection();\n    void testCheckInSignIn();\n};\n\ntst_all::tst_all(QObject *parent) :\n    QObject(parent)\n{\n}\n\nvoid tst_all::initTestCase()\n{\n    qRegisterMetaType<UserData>();\n    Telegram::initialize();\n    QVERIFY(TestKeyData::initKeyFiles());\n}\n\nvoid tst_all::cleanupTestCase()\n{\n    QVERIFY(TestKeyData::cleanupKeyFiles());\n}\n\nvoid tst_all::testClientConnection_data()\n{\n    QTest::addColumn<Telegram::Client::Settings::SessionType>(\"sessionType\");\n    QTest::addColumn<UserData>(\"userData\");\n    QTest::addColumn<DcOption>(\"clientDcOption\");\n    UserData userOnDc1 = c_userWithPassword;\n    userOnDc1.dcId = 1;\n    UserData userOnDc2 = c_userWithPassword;\n    userOnDc2.dcId = 2;\n    UserData user2OnDc2 = c_userWithPassword;\n    user2OnDc2.unsetPassword();\n    user2OnDc2.dcId = 2;\n\n    DcOption opt = c_localDcOptions.first();\n\n    QTest::newRow(\"Abridged\")   << Client::Settings::SessionType::Abridged\n                                << userOnDc1\n                                << opt;\n    QTest::newRow(\"Obfuscated\") << Client::Settings::SessionType::Obfuscated\n                                << userOnDc1\n                                << opt;\n    QTest::newRow(\"Abridged with migration\")   << Client::Settings::SessionType::Abridged\n                                               << userOnDc2\n                                               << opt;\n    QTest::newRow(\"Obfuscated with migration\") << Client::Settings::SessionType::Obfuscated\n                                               << userOnDc2\n                                               << opt;\n\n    opt.id = 0;\n    QTest::newRow(\"Migration from unknown dc (with password)\") << Client::Settings::SessionType::Obfuscated\n                                               << userOnDc2\n                                               << opt;\n    QTest::newRow(\"Migration from unknown dc, no password\") << Client::Settings::SessionType::Obfuscated\n                                               << user2OnDc2\n                                               << opt;\n}\n\nvoid tst_all::testClientConnection()\n{\n    QFETCH(Telegram::Client::Settings::SessionType, sessionType);\n    QFETCH(UserData, userData);\n    QFETCH(DcOption, clientDcOption);\n\n    const RsaKey publicKey = Utils::loadRsaKeyFromFile(TestKeyData::publicKeyFileName());\n    QVERIFY2(publicKey.isValid(), \"Unable to read public RSA key\");\n    const RsaKey privateKey = Utils::loadRsaPrivateKeyFromFile(TestKeyData::privateKeyFileName());\n    QVERIFY2(privateKey.isValid(), \"Unable to read private RSA key\");\n\n    Telegram::Server::LocalCluster cluster;\n    cluster.setServerContructor(c_testServerConstructor);\n    cluster.setServerPrivateRsaKey(privateKey);\n    cluster.setServerConfiguration(c_localDcConfiguration);\n    QVERIFY(cluster.start());\n\n    TestServer *server = qobject_cast<TestServer*>(cluster.getServerInstance(userData.dcId));\n    QVERIFY(server);\n\n    Server::User *user = tryAddUser(&cluster, userData);\n    QVERIFY(user);\n\n    Client::Client client;\n    Client::AccountStorage accountStorage;\n    Client::Settings clientSettings;\n    Client::InMemoryDataStorage dataStorage;\n    client.setAppInformation(getAppInfo());\n    client.setSettings(&clientSettings);\n    client.setAccountStorage(&accountStorage);\n    client.setDataStorage(&dataStorage);\n    QVERIFY(clientSettings.setServerConfiguration({c_localDcOptions.first()}));\n    QVERIFY(clientSettings.setServerRsaKey(publicKey));\n    clientSettings.setPreferedSessionType(sessionType);\n\n    \/\/ --- Sign in ---\n    Client::AuthOperation *signInOperation = client.signIn();\n    signInOperation->setPhoneNumber(userData.phoneNumber);\n    QSignalSpy serverAuthCodeSpy(server, &TestServer::authCodeSent);\n    QSignalSpy authCodeSpy(signInOperation, &Client::AuthOperation::authCodeRequired);\n    QTRY_COMPARE(dataStorage.serverConfiguration().dcOptions, cluster.serverConfiguration().dcOptions);\n    QTRY_VERIFY(!authCodeSpy.isEmpty());\n    QCOMPARE(authCodeSpy.count(), 1);\n    QCOMPARE(serverAuthCodeSpy.count(), 1);\n    QList<QVariant> authCodeSentArguments = serverAuthCodeSpy.takeFirst();\n    QCOMPARE(authCodeSentArguments.count(), 2);\n    const QString authCode = authCodeSentArguments.at(1).toString();\n\n    signInOperation->submitAuthCode(authCode);\n\n    if (!userData.password.isEmpty()) {\n        QSignalSpy authPasswordSpy(signInOperation, &Client::AuthOperation::passwordRequired);\n        QSignalSpy passwordCheckFailedSpy(signInOperation, &Client::AuthOperation::passwordCheckFailed);\n        QTRY_VERIFY2(!authPasswordSpy.isEmpty(), \"The user has a password-protection, \"\n                                                 \"but there are no passwordRequired signals on the client side\");\n        QCOMPARE(authPasswordSpy.count(), 1);\n        QVERIFY(passwordCheckFailedSpy.isEmpty());\n\n        PendingOperation *op = signInOperation->getPassword();\n        QTRY_VERIFY(op->isFinished());\n\n        signInOperation->submitPassword(userData.password + QStringLiteral(\"invalid\"));\n        QTRY_VERIFY2(!passwordCheckFailedSpy.isEmpty(), \"The submitted password is not valid, \"\n                                                        \"but there are not signals on the client side\");\n        QVERIFY(!signInOperation->isFinished());\n        QCOMPARE(passwordCheckFailedSpy.count(), 1);\n\n        signInOperation->submitPassword(userData.password);\n    }\n    QTRY_VERIFY2(signInOperation->isSucceeded(), \"Unexpected sign in fail\");\n\n    quint64 clientAuthId = accountStorage.authId();\n    QVERIFY(clientAuthId);\n    QSet<Server::RemoteClientConnection*> clientConnections = server->getConnections();\n    QCOMPARE(clientConnections.count(), 1);\n    Server::RemoteClientConnection *remoteClientConnection = *clientConnections.cbegin();\n    QCOMPARE(remoteClientConnection->authId(), clientAuthId);\n    Server::Session *serverSession = server->getSessionByAuthId(clientAuthId);\n    QVERIFY(serverSession);\n    QVERIFY(serverSession->user());\n}\n\nvoid tst_all::testCheckInSignIn()\n{\n    const Telegram::Client::Settings::SessionType sessionType = Telegram::Client::Settings::SessionType::Obfuscated;\n    const UserData userData = c_userWithPassword;\n    const DcOption clientDcOption = c_localDcOptions.first();\n\n    const RsaKey publicKey = Utils::loadRsaKeyFromFile(TestKeyData::publicKeyFileName());\n    QVERIFY2(publicKey.isValid(), \"Unable to read public RSA key\");\n    const RsaKey privateKey = Utils::loadRsaPrivateKeyFromFile(TestKeyData::privateKeyFileName());\n    QVERIFY2(privateKey.isValid(), \"Unable to read private RSA key\");\n\n    Telegram::Server::LocalCluster cluster;\n    cluster.setServerContructor(c_testServerConstructor);\n    cluster.setServerPrivateRsaKey(privateKey);\n    cluster.setServerConfiguration(c_localDcConfiguration);\n    QVERIFY(cluster.start());\n\n    TestServer *server = qobject_cast<TestServer*>(cluster.getServerInstance(userData.dcId));\n    QVERIFY(server);\n\n    Server::User *user = tryAddUser(&cluster, userData);\n    QVERIFY(user);\n\n    Client::Client client;\n    Client::AccountStorage accountStorage;\n    const QByteArray c_authKey = QByteArrayLiteral(\"some_auth_key_data_123456789_abcdefghijklmnopqrstuvwxyz\");\n    const quint64 c_authId = Utils::getFingerprints(c_authKey, Utils::Lower64Bits);\n\n    accountStorage.setAuthKey(c_authKey);\n    accountStorage.setAuthId(c_authId);\n    accountStorage.setPhoneNumber(userData.phoneNumber);\n    accountStorage.setDcInfo(clientDcOption);\n    QVERIFY(accountStorage.hasMinimalDataSet());\n\n    Client::Settings clientSettings;\n    Client::InMemoryDataStorage dataStorage;\n    client.setAppInformation(getAppInfo());\n    client.setSettings(&clientSettings);\n    client.setAccountStorage(&accountStorage);\n    client.setDataStorage(&dataStorage);\n    QVERIFY(clientSettings.setServerConfiguration({c_localDcOptions.first()}));\n    QVERIFY(clientSettings.setServerRsaKey(publicKey));\n    clientSettings.setPreferedSessionType(sessionType);\n\n    \/\/ --- Check in ---\n    QSignalSpy accountStorageSynced(&accountStorage, &Client::AccountStorage::synced);\n    Client::AuthOperation *checkInOperation = client.checkIn();\n    QSignalSpy checkInFinishedSpy(checkInOperation, &Client::AuthOperation::finished);\n    QSignalSpy checkInFailedSpy(checkInOperation, &Client::AuthOperation::failed);\n    TRY_COMPARE(checkInFinishedSpy.count(), 1);\n    TRY_COMPARE(checkInFailedSpy.count(), 1);\n\n    Client::AuthOperation *signInOperation = client.signIn();\n\n    signInOperation->setPhoneNumber(userData.phoneNumber);\n    QSignalSpy serverAuthCodeSpy(server, &TestServer::authCodeSent);\n    QSignalSpy authCodeSpy(signInOperation, &Client::AuthOperation::authCodeRequired);\n    \/\/ Check whether the server configuration is synced to the client data storage\n    TRY_COMPARE(dataStorage.serverConfiguration().dcOptions, cluster.serverConfiguration().dcOptions);\n    TRY_VERIFY(!authCodeSpy.isEmpty());\n    QCOMPARE(authCodeSpy.count(), 1);\n    QCOMPARE(serverAuthCodeSpy.count(), 1);\n    QList<QVariant> authCodeSentArguments = serverAuthCodeSpy.takeFirst();\n    QCOMPARE(authCodeSentArguments.count(), 2);\n    const QString authCode = authCodeSentArguments.at(1).toString();\n\n    signInOperation->submitAuthCode(authCode);\n\n    if (!userData.password.isEmpty()) {\n        QSignalSpy authPasswordSpy(signInOperation, &Client::AuthOperation::passwordRequired);\n        QSignalSpy passwordCheckFailedSpy(signInOperation, &Client::AuthOperation::passwordCheckFailed);\n        QTRY_VERIFY2(!authPasswordSpy.isEmpty(), \"The user has a password-protection, \"\n                                                 \"but there are no passwordRequired signals on the client side\");\n        QCOMPARE(authPasswordSpy.count(), 1);\n        QVERIFY(passwordCheckFailedSpy.isEmpty());\n\n        PendingOperation *op = signInOperation->getPassword();\n        QTRY_VERIFY(op->isFinished());\n\n        signInOperation->submitPassword(userData.password + QStringLiteral(\"invalid\"));\n        QTRY_VERIFY2(!passwordCheckFailedSpy.isEmpty(), \"The submitted password is not valid, \"\n                                                        \"but there are not signals on the client side\");\n        QVERIFY(!signInOperation->isFinished());\n        QCOMPARE(passwordCheckFailedSpy.count(), 1);\n\n        signInOperation->submitPassword(userData.password);\n    }\n    TRY_VERIFY2(signInOperation->isSucceeded(), \"Unexpected sign in fail\");\n    TRY_VERIFY(!accountStorageSynced.isEmpty());\n\n    quint64 clientAuthId = accountStorage.authId();\n    QVERIFY(clientAuthId);\n    Server::Session *serverSession = server->getSessionByAuthId(clientAuthId);\n    QVERIFY(serverSession);\n    QVERIFY(serverSession->user());\n    QCOMPARE(accountStorage.phoneNumber(), userData.phoneNumber);\n    QCOMPARE(accountStorage.dcInfo().id, server->dcId());\n    TRY_VERIFY(client.isSignedIn());\n}\n\nQTEST_GUILESS_MAIN(tst_all)\n\n#include \"tst_all.moc\"\n<commit_msg>Tests\/tst_all: Use own TRY_VERIFY\/TRY_COMPARE macros<commit_after>\/*\n   Copyright (C) 2017 Alexandr Akulich <akulichalexander@gmail.com>\n\n   This file is a part of TelegramQt 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\n#include <QObject>\n\n#include \"AccountStorage.hpp\"\n#include \"Client.hpp\"\n#include \"ClientSettings.hpp\"\n#include \"DataStorage.hpp\"\n#include \"Utils.hpp\"\n#include \"TelegramNamespace.hpp\"\n#include \"CAppInformation.hpp\"\n\n#include \"Operations\/ClientAuthOperation.hpp\"\n\n#include \"TelegramServer.hpp\"\n#include \"TelegramServerClient.hpp\"\n#include \"TelegramServerUser.hpp\"\n#include \"ServerRpcLayer.hpp\"\n#include \"Session.hpp\"\n#include \"DcConfiguration.hpp\"\n#include \"LocalCluster.hpp\"\n\n#include <QTest>\n#include <QSignalSpy>\n#include <QDebug>\n#include <QRegularExpression>\n\n#include \"keys_data.hpp\"\n#include \"TestUtils.hpp\"\n\n#define CLIENT_WORKS\n\nusing namespace Telegram;\n\nstruct UserData\n{\n    quint32 dcId;\n    QString phoneNumber;\n    QString firstName;\n    QString lastName;\n    QString password;\n    QByteArray passwordSalt;\n    QByteArray passwordHash;\n\n    void setName(const QString &first, const QString &last)\n    {\n        firstName = first;\n        lastName = last;\n    }\n\n    void unsetPassword()\n    {\n        setPassword(QString(), QByteArray());\n    }\n\n    void setPassword(const QString &pass, const QByteArray &salt)\n    {\n        password = pass;\n        setPasswordSalt(salt);\n    }\n\n    void setPasswordSalt(const QByteArray &salt)\n    {\n        if (salt.isEmpty()) {\n            passwordSalt.clear();\n            passwordHash.clear();\n            return;\n        }\n        QByteArray pwdData = salt + password.toUtf8() + salt;\n        passwordSalt = salt;\n        passwordHash = Utils::sha256(pwdData);\n    }\n};\n\nQ_DECLARE_METATYPE(UserData);\n\nCAppInformation *getAppInfo()\n{\n    static CAppInformation *appInfo = nullptr;\n    if (!appInfo) {\n        appInfo = new CAppInformation();\n        appInfo->setAppId(14617);\n        appInfo->setAppHash(QLatin1String(\"e17ac360fd072f83d5d08db45ce9a121\"));\n        appInfo->setAppVersion(QLatin1String(\"0.1\"));\n        appInfo->setDeviceInfo(QLatin1String(\"pc\"));\n        appInfo->setOsInfo(QLatin1String(\"GNU\/Linux\"));\n        appInfo->setLanguageCode(QLatin1String(\"en\"));\n    }\n    return appInfo;\n}\n\nTelegram::Server::User *tryAddUser(Telegram::Server::LocalCluster *cluster, const UserData &data)\n{\n    Telegram::Server::User *u = cluster->addUser(data.phoneNumber, data.dcId);\n    if (u) {\n        u->setFirstName(data.firstName);\n        u->setLastName(data.lastName);\n        if (!data.passwordHash.isEmpty()) {\n            u->setPassword(data.passwordSalt, data.passwordHash);\n        } else {\n            u->setPlainPassword(data.password);\n        }\n    } else {\n        qCritical() << \"Unable to add a user\";\n    }\n    return u;\n}\n\nclass TestServer : public Server::Server\n{\n    Q_OBJECT\npublic:\n    explicit TestServer(QObject *parent = nullptr)\n        : Server(parent)\n    {\n    }\n\n    QByteArray sendAppCode(const QString &identifier) override\n    {\n        const QByteArray hash = Server::Server::sendAppCode(identifier);\n        const Telegram::Server::AuthCode c = m_sentCodeMap.value(identifier);\n        emit authCodeSent(identifier, c.code);\n        return hash;\n    }\n\nsignals:\n    void authCodeSent(const QString &identifier, const QString &code);\n};\n\nstatic const UserData c_userWithPassword = []() {\n    UserData userData;\n    userData.dcId = 1;\n    userData.setName(QStringLiteral(\"First\"), QStringLiteral(\"Last\"));\n    userData.phoneNumber = QStringLiteral(\"123456\");\n    userData.password = QByteArrayLiteral(\"mypassword\");\n    userData.setPasswordSalt(QByteArrayLiteral(\"mysalt\"));\n    return userData;\n}();\n\nstatic const QVector<Telegram::DcOption> c_localDcOptions = {\n    Telegram::DcOption(QStringLiteral(\"127.0.0.1\"), 11441, 1),\n    Telegram::DcOption(QStringLiteral(\"127.0.0.2\"), 11442, 2),\n    Telegram::DcOption(QStringLiteral(\"127.0.0.3\"), 11443, 3),\n};\n\nstatic const Telegram::DcConfiguration c_localDcConfiguration = []() {\n    Telegram::DcConfiguration configuration;\n    configuration.dcOptions = c_localDcOptions;\n    return configuration;\n}();\n\nstatic const Telegram::Server::LocalCluster::ServerConstructor c_testServerConstructor = [](QObject *parent) -> Telegram::Server::Server* {\n    return new TestServer(parent);\n};\n\nclass tst_all : public QObject\n{\n    Q_OBJECT\npublic:\n    explicit tst_all(QObject *parent = nullptr);\n\nprivate slots:\n    void initTestCase();\n    void cleanupTestCase();\n    void testClientConnection_data();\n    void testClientConnection();\n    void testCheckInSignIn();\n};\n\ntst_all::tst_all(QObject *parent) :\n    QObject(parent)\n{\n}\n\nvoid tst_all::initTestCase()\n{\n    qRegisterMetaType<UserData>();\n    Telegram::initialize();\n    QVERIFY(TestKeyData::initKeyFiles());\n}\n\nvoid tst_all::cleanupTestCase()\n{\n    QVERIFY(TestKeyData::cleanupKeyFiles());\n}\n\nvoid tst_all::testClientConnection_data()\n{\n    QTest::addColumn<Telegram::Client::Settings::SessionType>(\"sessionType\");\n    QTest::addColumn<UserData>(\"userData\");\n    QTest::addColumn<DcOption>(\"clientDcOption\");\n    UserData userOnDc1 = c_userWithPassword;\n    userOnDc1.dcId = 1;\n    UserData userOnDc2 = c_userWithPassword;\n    userOnDc2.dcId = 2;\n    UserData user2OnDc2 = c_userWithPassword;\n    user2OnDc2.unsetPassword();\n    user2OnDc2.dcId = 2;\n\n    DcOption opt = c_localDcOptions.first();\n\n    QTest::newRow(\"Abridged\")   << Client::Settings::SessionType::Abridged\n                                << userOnDc1\n                                << opt;\n    QTest::newRow(\"Obfuscated\") << Client::Settings::SessionType::Obfuscated\n                                << userOnDc1\n                                << opt;\n    QTest::newRow(\"Abridged with migration\")   << Client::Settings::SessionType::Abridged\n                                               << userOnDc2\n                                               << opt;\n    QTest::newRow(\"Obfuscated with migration\") << Client::Settings::SessionType::Obfuscated\n                                               << userOnDc2\n                                               << opt;\n\n    opt.id = 0;\n    QTest::newRow(\"Migration from unknown dc (with password)\") << Client::Settings::SessionType::Obfuscated\n                                               << userOnDc2\n                                               << opt;\n    QTest::newRow(\"Migration from unknown dc, no password\") << Client::Settings::SessionType::Obfuscated\n                                               << user2OnDc2\n                                               << opt;\n}\n\nvoid tst_all::testClientConnection()\n{\n    QFETCH(Telegram::Client::Settings::SessionType, sessionType);\n    QFETCH(UserData, userData);\n    QFETCH(DcOption, clientDcOption);\n\n    const RsaKey publicKey = Utils::loadRsaKeyFromFile(TestKeyData::publicKeyFileName());\n    QVERIFY2(publicKey.isValid(), \"Unable to read public RSA key\");\n    const RsaKey privateKey = Utils::loadRsaPrivateKeyFromFile(TestKeyData::privateKeyFileName());\n    QVERIFY2(privateKey.isValid(), \"Unable to read private RSA key\");\n\n    Telegram::Server::LocalCluster cluster;\n    cluster.setServerContructor(c_testServerConstructor);\n    cluster.setServerPrivateRsaKey(privateKey);\n    cluster.setServerConfiguration(c_localDcConfiguration);\n    QVERIFY(cluster.start());\n\n    TestServer *server = qobject_cast<TestServer*>(cluster.getServerInstance(userData.dcId));\n    QVERIFY(server);\n\n    Server::User *user = tryAddUser(&cluster, userData);\n    QVERIFY(user);\n\n    Client::Client client;\n    Client::AccountStorage accountStorage;\n    Client::Settings clientSettings;\n    Client::InMemoryDataStorage dataStorage;\n    client.setAppInformation(getAppInfo());\n    client.setSettings(&clientSettings);\n    client.setAccountStorage(&accountStorage);\n    client.setDataStorage(&dataStorage);\n    QVERIFY(clientSettings.setServerConfiguration({c_localDcOptions.first()}));\n    QVERIFY(clientSettings.setServerRsaKey(publicKey));\n    clientSettings.setPreferedSessionType(sessionType);\n\n    \/\/ --- Sign in ---\n    Client::AuthOperation *signInOperation = client.signIn();\n    signInOperation->setPhoneNumber(userData.phoneNumber);\n    QSignalSpy serverAuthCodeSpy(server, &TestServer::authCodeSent);\n    QSignalSpy authCodeSpy(signInOperation, &Client::AuthOperation::authCodeRequired);\n    TRY_COMPARE(dataStorage.serverConfiguration().dcOptions, cluster.serverConfiguration().dcOptions);\n    TRY_VERIFY(!authCodeSpy.isEmpty());\n    QCOMPARE(authCodeSpy.count(), 1);\n    QCOMPARE(serverAuthCodeSpy.count(), 1);\n    QList<QVariant> authCodeSentArguments = serverAuthCodeSpy.takeFirst();\n    QCOMPARE(authCodeSentArguments.count(), 2);\n    const QString authCode = authCodeSentArguments.at(1).toString();\n\n    signInOperation->submitAuthCode(authCode);\n\n    if (!userData.password.isEmpty()) {\n        QSignalSpy authPasswordSpy(signInOperation, &Client::AuthOperation::passwordRequired);\n        QSignalSpy passwordCheckFailedSpy(signInOperation, &Client::AuthOperation::passwordCheckFailed);\n        TRY_VERIFY2(!authPasswordSpy.isEmpty(), \"The user has a password-protection, \"\n                                                 \"but there are no passwordRequired signals on the client side\");\n        QCOMPARE(authPasswordSpy.count(), 1);\n        QVERIFY(passwordCheckFailedSpy.isEmpty());\n\n        PendingOperation *op = signInOperation->getPassword();\n        TRY_VERIFY(op->isFinished());\n\n        signInOperation->submitPassword(userData.password + QStringLiteral(\"invalid\"));\n        TRY_VERIFY2(!passwordCheckFailedSpy.isEmpty(), \"The submitted password is not valid, \"\n                                                        \"but there are not signals on the client side\");\n        QVERIFY(!signInOperation->isFinished());\n        QCOMPARE(passwordCheckFailedSpy.count(), 1);\n\n        signInOperation->submitPassword(userData.password);\n    }\n    TRY_VERIFY2(signInOperation->isSucceeded(), \"Unexpected sign in fail\");\n\n    quint64 clientAuthId = accountStorage.authId();\n    QVERIFY(clientAuthId);\n    QSet<Server::RemoteClientConnection*> clientConnections = server->getConnections();\n    QCOMPARE(clientConnections.count(), 1);\n    Server::RemoteClientConnection *remoteClientConnection = *clientConnections.cbegin();\n    QCOMPARE(remoteClientConnection->authId(), clientAuthId);\n    Server::Session *serverSession = server->getSessionByAuthId(clientAuthId);\n    QVERIFY(serverSession);\n    QVERIFY(serverSession->user());\n}\n\nvoid tst_all::testCheckInSignIn()\n{\n    const Telegram::Client::Settings::SessionType sessionType = Telegram::Client::Settings::SessionType::Obfuscated;\n    const UserData userData = c_userWithPassword;\n    const DcOption clientDcOption = c_localDcOptions.first();\n\n    const RsaKey publicKey = Utils::loadRsaKeyFromFile(TestKeyData::publicKeyFileName());\n    QVERIFY2(publicKey.isValid(), \"Unable to read public RSA key\");\n    const RsaKey privateKey = Utils::loadRsaPrivateKeyFromFile(TestKeyData::privateKeyFileName());\n    QVERIFY2(privateKey.isValid(), \"Unable to read private RSA key\");\n\n    Telegram::Server::LocalCluster cluster;\n    cluster.setServerContructor(c_testServerConstructor);\n    cluster.setServerPrivateRsaKey(privateKey);\n    cluster.setServerConfiguration(c_localDcConfiguration);\n    QVERIFY(cluster.start());\n\n    TestServer *server = qobject_cast<TestServer*>(cluster.getServerInstance(userData.dcId));\n    QVERIFY(server);\n\n    Server::User *user = tryAddUser(&cluster, userData);\n    QVERIFY(user);\n\n    Client::Client client;\n    Client::AccountStorage accountStorage;\n    const QByteArray c_authKey = QByteArrayLiteral(\"some_auth_key_data_123456789_abcdefghijklmnopqrstuvwxyz\");\n    const quint64 c_authId = Utils::getFingerprints(c_authKey, Utils::Lower64Bits);\n\n    accountStorage.setAuthKey(c_authKey);\n    accountStorage.setAuthId(c_authId);\n    accountStorage.setPhoneNumber(userData.phoneNumber);\n    accountStorage.setDcInfo(clientDcOption);\n    QVERIFY(accountStorage.hasMinimalDataSet());\n\n    Client::Settings clientSettings;\n    Client::InMemoryDataStorage dataStorage;\n    client.setAppInformation(getAppInfo());\n    client.setSettings(&clientSettings);\n    client.setAccountStorage(&accountStorage);\n    client.setDataStorage(&dataStorage);\n    QVERIFY(clientSettings.setServerConfiguration({c_localDcOptions.first()}));\n    QVERIFY(clientSettings.setServerRsaKey(publicKey));\n    clientSettings.setPreferedSessionType(sessionType);\n\n    \/\/ --- Check in ---\n    QSignalSpy accountStorageSynced(&accountStorage, &Client::AccountStorage::synced);\n    Client::AuthOperation *checkInOperation = client.checkIn();\n    QSignalSpy checkInFinishedSpy(checkInOperation, &Client::AuthOperation::finished);\n    QSignalSpy checkInFailedSpy(checkInOperation, &Client::AuthOperation::failed);\n    TRY_COMPARE(checkInFinishedSpy.count(), 1);\n    TRY_COMPARE(checkInFailedSpy.count(), 1);\n\n    Client::AuthOperation *signInOperation = client.signIn();\n\n    signInOperation->setPhoneNumber(userData.phoneNumber);\n    QSignalSpy serverAuthCodeSpy(server, &TestServer::authCodeSent);\n    QSignalSpy authCodeSpy(signInOperation, &Client::AuthOperation::authCodeRequired);\n    \/\/ Check whether the server configuration is synced to the client data storage\n    TRY_COMPARE(dataStorage.serverConfiguration().dcOptions, cluster.serverConfiguration().dcOptions);\n    TRY_VERIFY(!authCodeSpy.isEmpty());\n    QCOMPARE(authCodeSpy.count(), 1);\n    QCOMPARE(serverAuthCodeSpy.count(), 1);\n    QList<QVariant> authCodeSentArguments = serverAuthCodeSpy.takeFirst();\n    QCOMPARE(authCodeSentArguments.count(), 2);\n    const QString authCode = authCodeSentArguments.at(1).toString();\n\n    signInOperation->submitAuthCode(authCode);\n\n    if (!userData.password.isEmpty()) {\n        QSignalSpy authPasswordSpy(signInOperation, &Client::AuthOperation::passwordRequired);\n        QSignalSpy passwordCheckFailedSpy(signInOperation, &Client::AuthOperation::passwordCheckFailed);\n        TRY_VERIFY2(!authPasswordSpy.isEmpty(), \"The user has a password-protection, \"\n                                                 \"but there are no passwordRequired signals on the client side\");\n        QCOMPARE(authPasswordSpy.count(), 1);\n        QVERIFY(passwordCheckFailedSpy.isEmpty());\n\n        PendingOperation *op = signInOperation->getPassword();\n        TRY_VERIFY(op->isFinished());\n\n        signInOperation->submitPassword(userData.password + QStringLiteral(\"invalid\"));\n        TRY_VERIFY2(!passwordCheckFailedSpy.isEmpty(), \"The submitted password is not valid, \"\n                                                        \"but there are not signals on the client side\");\n        QVERIFY(!signInOperation->isFinished());\n        QCOMPARE(passwordCheckFailedSpy.count(), 1);\n\n        signInOperation->submitPassword(userData.password);\n    }\n    TRY_VERIFY2(signInOperation->isSucceeded(), \"Unexpected sign in fail\");\n    TRY_VERIFY(!accountStorageSynced.isEmpty());\n\n    quint64 clientAuthId = accountStorage.authId();\n    QVERIFY(clientAuthId);\n    Server::Session *serverSession = server->getSessionByAuthId(clientAuthId);\n    QVERIFY(serverSession);\n    QVERIFY(serverSession->user());\n    QCOMPARE(accountStorage.phoneNumber(), userData.phoneNumber);\n    QCOMPARE(accountStorage.dcInfo().id, server->dcId());\n    TRY_VERIFY(client.isSignedIn());\n}\n\nQTEST_GUILESS_MAIN(tst_all)\n\n#include \"tst_all.moc\"\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 \"config.h\"\n#include \"Font.h\"\n\n#include \"FloatRect.h\"\n#include \"GlyphBuffer.h\"\n#include \"GraphicsContext.h\"\n#include \"NotImplemented.h\"\n#include \"PlatformContextSkia.h\"\n#include \"SimpleFontData.h\"\n\n#include \"SkCanvas.h\"\n#include \"SkPaint.h\"\n#include \"SkTemplates.h\"\n#include \"SkTypeface.h\"\n#include \"SkUtils.h\"\n\nnamespace WebCore {\n\nvoid Font::drawGlyphs(GraphicsContext* gc, const SimpleFontData* font,\n                      const GlyphBuffer& glyphBuffer,  int from, int numGlyphs,\n                      const FloatPoint& point) const {\n    SkCanvas* canvas = gc->platformContext()->canvas();\n    SkPaint paint;\n\n    font->platformData().setupPaint(&paint);\n    paint.setTextEncoding(SkPaint::kGlyphID_TextEncoding);\n    paint.setColor(gc->fillColor().rgb());\n\n    SkASSERT(sizeof(GlyphBufferGlyph) == sizeof(uint16_t));  \/\/ compile-time assert\n\n    const GlyphBufferGlyph* glyphs = glyphBuffer.glyphs(from);\n    SkScalar x = SkFloatToScalar(point.x());\n    SkScalar y = SkFloatToScalar(point.y());\n\n    \/\/ TODO(port): Android WebCore has patches for PLATFORM(SGL) which involves\n    \/\/ this, however we don't have these patches and it's unclear when Android\n    \/\/ may upstream them.\n#if 0\n    if (glyphBuffer.hasAdjustedWidths()) {\n        const GlyphBufferAdvance*   adv = glyphBuffer.advances(from);\n        SkAutoSTMalloc<32, SkPoint> storage(numGlyphs);\n        SkPoint*                    pos = storage.get();\n\n        for (int i = 0; i < numGlyphs; i++) {\n            pos[i].set(x, y);\n            x += SkFloatToScalar(adv[i].width());\n            y += SkFloatToScalar(adv[i].height());\n        }\n        canvas->drawPosText(glyphs, numGlyphs << 1, pos, paint);\n    } else {\n        canvas->drawText(glyphs, numGlyphs << 1, x, y, paint);\n    }\n#endif\n\n    canvas->drawText(glyphs, numGlyphs << 1, x, y, paint);\n}\n\nvoid Font::drawComplexText(GraphicsContext* context, const TextRun& run,\n                           const FloatPoint& point, int from, int to) const\n{\n    notImplemented();\n}\n\nfloat Font::floatWidthForComplexText(const TextRun& run) const\n{\n    notImplemented();\n    return 0;\n}\n\nint Font::offsetForPositionForComplexText(const TextRun& run, int x,\n                                          bool includePartialGlyphs) const\n{\n    notImplemented();\n    return 0;\n}\n\nFloatRect Font::selectionRectForComplexText(const TextRun& run,\n                                            const IntPoint& point, int h,\n                                            int from, int to) const\n{\n    notImplemented();\n    return FloatRect();\n}\n\n}  \/\/ namespace WebCore\n<commit_msg>Linux: respect non-standard advance widths for glyphs.<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 \"config.h\"\n#include \"Font.h\"\n\n#include \"FloatRect.h\"\n#include \"GlyphBuffer.h\"\n#include \"GraphicsContext.h\"\n#include \"NotImplemented.h\"\n#include \"PlatformContextSkia.h\"\n#include \"SimpleFontData.h\"\n\n#include \"SkCanvas.h\"\n#include \"SkPaint.h\"\n#include \"SkTemplates.h\"\n#include \"SkTypeface.h\"\n#include \"SkUtils.h\"\n\nnamespace WebCore {\n\nvoid Font::drawGlyphs(GraphicsContext* gc, const SimpleFontData* font,\n                      const GlyphBuffer& glyphBuffer,  int from, int numGlyphs,\n                      const FloatPoint& point) const {\n    SkCanvas* canvas = gc->platformContext()->canvas();\n    SkPaint paint;\n\n    font->platformData().setupPaint(&paint);\n    paint.setTextEncoding(SkPaint::kGlyphID_TextEncoding);\n    paint.setColor(gc->fillColor().rgb());\n\n    SkASSERT(sizeof(GlyphBufferGlyph) == sizeof(uint16_t));  \/\/ compile-time assert\n\n    const GlyphBufferGlyph* glyphs = glyphBuffer.glyphs(from);\n    SkScalar x = SkFloatToScalar(point.x());\n    SkScalar y = SkFloatToScalar(point.y());\n\n    \/\/ TODO(port): text rendering speed:\n    \/\/ Android has code in their WebCore fork to special case when the\n    \/\/ GlyphBuffer has no advances other than the defaults. In that case the\n    \/\/ text drawing can proceed faster. However, it's unclear when those\n    \/\/ patches may be upstreamed to WebKit so we always use the slower path\n    \/\/ here.\n    const GlyphBufferAdvance*   adv = glyphBuffer.advances(from);\n    SkAutoSTMalloc<32, SkPoint> storage(numGlyphs);\n    SkPoint*                    pos = storage.get();\n\n    for (int i = 0; i < numGlyphs; i++) {\n        pos[i].set(x, y);\n        x += SkFloatToScalar(adv[i].width());\n        y += SkFloatToScalar(adv[i].height());\n    }\n    canvas->drawPosText(glyphs, numGlyphs << 1, pos, paint);\n}\n\nvoid Font::drawComplexText(GraphicsContext* context, const TextRun& run,\n                           const FloatPoint& point, int from, int to) const\n{\n    notImplemented();\n}\n\nfloat Font::floatWidthForComplexText(const TextRun& run) const\n{\n    notImplemented();\n    return 0;\n}\n\nint Font::offsetForPositionForComplexText(const TextRun& run, int x,\n                                          bool includePartialGlyphs) const\n{\n    notImplemented();\n    return 0;\n}\n\nFloatRect Font::selectionRectForComplexText(const TextRun& run,\n                                            const IntPoint& point, int h,\n                                            int from, int to) const\n{\n    notImplemented();\n    return FloatRect();\n}\n\n}  \/\/ namespace WebCore\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: clang-tidy -checks='-*,modernize-use-override' %s.nonexistent.cpp -- | FileCheck -check-prefix=CHECK1 -implicit-check-not='{{warning:|error:}}' %s\n\/\/ RUN: clang-tidy -checks='-*,clang-diagnostic-*,google-explicit-constructor' %s -- -fan-unknown-option 2>&1 | FileCheck -check-prefix=CHECK2 -implicit-check-not='{{warning:|error:}}' %s\n\/\/ RUN: clang-tidy -checks='-*,google-explicit-constructor,clang-diagnostic-literal-conversion' %s -- -fan-unknown-option 2>&1 | FileCheck -check-prefix=CHECK3 -implicit-check-not='{{warning:|error:}}' %s\n\/\/ RUN: clang-tidy -checks='-*,modernize-use-override,clang-diagnostic-macro-redefined' %s -- -DMACRO_FROM_COMMAND_LINE | FileCheck -check-prefix=CHECK4 -implicit-check-not='{{warning:|error:}}' %s\n\n\/\/ CHECK1: error: error reading '{{.*}}.nonexistent.cpp' [clang-diagnostic-error]\n\/\/ CHECK2: error: unknown argument: '-fan-unknown-option'\n\/\/ CHECK3: error: unknown argument: '-fan-unknown-option'\n\n\/\/ CHECK2: :[[@LINE+2]]:9: warning: implicit conversion from 'double' to 'int' changes value from 1.5 to 1 [clang-diagnostic-literal-conversion]\n\/\/ CHECK3: :[[@LINE+1]]:9: warning: implicit conversion from 'double' to 'int' changes value\nint a = 1.5;\n\n\/\/ CHECK2: :[[@LINE+2]]:11: warning: single-argument constructors must be marked explicit\n\/\/ CHECK3: :[[@LINE+1]]:11: warning: single-argument constructors must be marked explicit\nclass A { A(int) {} };\n\n#define MACRO_FROM_COMMAND_LINE\n\/\/ CHECK4: :[[@LINE-1]]:9: warning: 'MACRO_FROM_COMMAND_LINE' macro redefined\n<commit_msg>Revert \"Modify test so that it looks for patterns in stderr as well\"<commit_after>\/\/ RUN: clang-tidy -checks='-*,modernize-use-override' %s.nonexistent.cpp -- | FileCheck -check-prefix=CHECK1 -implicit-check-not='{{warning:|error:}}' %s\n\/\/ RUN: clang-tidy -checks='-*,clang-diagnostic-*,google-explicit-constructor' %s -- -fan-unknown-option | FileCheck -check-prefix=CHECK2 -implicit-check-not='{{warning:|error:}}' %s\n\/\/ RUN: clang-tidy -checks='-*,google-explicit-constructor,clang-diagnostic-literal-conversion' %s -- -fan-unknown-option | FileCheck -check-prefix=CHECK3 -implicit-check-not='{{warning:|error:}}' %s\n\/\/ RUN: clang-tidy -checks='-*,modernize-use-override,clang-diagnostic-macro-redefined' %s -- -DMACRO_FROM_COMMAND_LINE | FileCheck -check-prefix=CHECK4 -implicit-check-not='{{warning:|error:}}' %s\n\n\/\/ CHECK1: error: error reading '{{.*}}.nonexistent.cpp' [clang-diagnostic-error]\n\/\/ CHECK2: error: unknown argument: '-fan-unknown-option' [clang-diagnostic-error]\n\/\/ CHECK3: error: unknown argument: '-fan-unknown-option' [clang-diagnostic-error]\n\n\/\/ CHECK2: :[[@LINE+2]]:9: warning: implicit conversion from 'double' to 'int' changes value from 1.5 to 1 [clang-diagnostic-literal-conversion]\n\/\/ CHECK3: :[[@LINE+1]]:9: warning: implicit conversion from 'double' to 'int' changes value\nint a = 1.5;\n\n\/\/ CHECK2: :[[@LINE+2]]:11: warning: single-argument constructors must be marked explicit\n\/\/ CHECK3: :[[@LINE+1]]:11: warning: single-argument constructors must be marked explicit\nclass A { A(int) {} };\n\n#define MACRO_FROM_COMMAND_LINE\n\/\/ CHECK4: :[[@LINE-1]]:9: warning: 'MACRO_FROM_COMMAND_LINE' macro redefined\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2014-2015, Vlad Mesco\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\n1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\n2. 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\nTHIS 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#include <cmath>\n#include \"jakmuse_common.h\"\n\n#include <algorithm>\n\n#ifdef _MSC_VER\n# include <float.h>\n#endif\n\n\/\/ in semitones\n#define LFO_TUNING_MAX 1.f\n\nstatic float _square(unsigned k, noise_reg_t noise_regs[], unsigned short Ns, unsigned short fill)\n{\n    if(Ns == 0) return 0.f;\n\n    static float values[2] = { 1.f, -1.f };\n\n    unsigned lk = k++ % Ns;\n    return values[lk < Ns * fill \/ 256];\n}\n\nstatic float _triangle(unsigned k, noise_reg_t noise_regs[], unsigned short Ns, unsigned short fill)\n{\n    if(Ns == 0) return 0.f;\n\n    unsigned lk = k++ % Ns;\n\n    float val_1 = (lk < Ns * fill \/ 256)\n            ? (float)lk * 256 \/ (Ns * fill) * 2.f - 1.f\n            : (float)(Ns - lk) \/ (Ns - Ns * fill \/ 256) * 2.f - 1.f\n            ;\n    return val_1;\n}\n\nstatic float _sine(unsigned k, noise_reg_t noise_regs[], unsigned short Ns, unsigned short fill)\n{\n    if(Ns == 0) return 0.f;\n    \n    unsigned lk = k++ % Ns;\n    \/\/ use cos in order to keep triangle and sine in phase\n    \/\/ for fill = 128\n    float zeroPosition = (float)fill \/ 255.f;\n    unsigned zp = Ns * zeroPosition;\n#ifndef _MSC_VER\n    float val_1 = sinf(3.14159f * \n            ((lk < zp)\n            ? ((float)lk \/ zp)            \n            : ( (float)(lk - zp)\n                    \/ (float)(Ns - zp)\n                + 1.f))\n            );\n#else\n    \/* All right, let me explain...\n\n       There's this really weird thing that's happening on a particular\n       intel machine on windows where both sin and sinf start going\n       haywire and returning negative infinity like crazy.\n\n       I couldn't figure out for the life of me what the problem is,\n       but calling it 2 times in a row with _clearfp in between seems\n       to sort-of end up producing, you know, normal results. At least\n       for my test.\n\n       Another thing, it only starts happening more-or-less at random\n       based on other things that happen beforehand. I don't know...\n\n       If the negative infinity problem pops up again I'll probably spend\n       more time figuring out what the devil's happening.\n    *\/\n    volatile float val_2 =\n        ((lk < zp)\n        ? ((float)lk \/ zp)\n        : ( (float)(lk - zp)\n                \/ (Ns - zp)\n            + 1.f));\n    ;\n    _clearfp();\n    volatile float val_1 = sinf(val_2);\n    _clearfp();\n    val_1 = sinf(val_2);\n    \/\/_clearfp();\n    \/\/val_1 = sinf(val_2);\n#endif\n\n    return val_1;\n}\n\nstatic float _noise(unsigned k, noise_reg_t noise_regs[], unsigned short Ns, unsigned short fill)\n{\n    if(Ns == 0) return 0.f;\n    \n    noise_reg_t* myreg = &noise_regs[Ns > JAKMUSE_SAMPLES_PER_SECOND \/ 440];\n    unsigned lf = k++ % fill;\n\n    if(lf == 0) {\n        \/\/ this is one reason why calls to generate can't be parallelized\n        myreg->reg = (myreg->reg >> 1) ^ ((myreg->reg & 0x1) * myreg->poly);\n    }\n\n    return (float)myreg->reg \/ (float)0x7FFF;\n}\n\n\nvoid init_generators()\n{\n    g_generators.push_back(Generator(_square));\n    g_generators.push_back(Generator(_square));\n    g_generators.push_back(Generator(_triangle));\n    g_generators.push_back(Generator(_triangle));\n    g_generators.push_back(Generator(_noise));\n    g_generators.push_back(Generator(_sine));\n    g_generators.push_back(Generator(_sine));\n}\n\nfloat Generator::operator()()\n{\n    \/\/ grab the 'frequency' (wavelength, actually)\n    unsigned freq = state_.pub.def.freq;\n    unsigned last_freq = state_.priv.last_freq;\n    unsigned Ns = (freq) ? JAKMUSE_SAMPLES_PER_SECOND \/ freq : 0;\n    unsigned last_Ns = (last_freq) ? JAKMUSE_SAMPLES_PER_SECOND \/ last_freq : 0;\n\n    if(state_.pub.glide.Ns\n            && freq\n            && last_freq)\n    {\n        if(state_.priv.gl_counter < state_.priv.gl_NsPerPeriod) {\n            state_.priv.gl_counter++;\n        } else if(state_.priv.k % state_.priv.Ts[state_.priv.gl_idx] == 0) {\n            state_.priv.gl_counter = state_.priv.gl_nextStartAt;\n            state_.priv.gl_nextStartAt = 1;\n            state_.priv.k = 0;\n            state_.priv.gl_idx = \n                (1.03f * state_.priv.gl_passed + state_.priv.gl_NsPerPeriod)\n                \/ state_.priv.gl_NsPerPeriod\n                - 1;\n            state_.priv.gl_idx = std::min(state_.priv.gl_idx, state_.priv.Ts.size() - 1);\n        } else {\n            state_.priv.gl_nextStartAt++;\n        }\n        state_.priv.gl_counter++;\n        state_.priv.gl_passed++;\n        Ns = state_.priv.Ts[state_.priv.gl_idx];\n    }\n\n    \/\/ compute base sample\n    float base = fn_(state_.priv.k, state_.priv.noise_regs, Ns, state_.pub.def.fill);\n    float prev = fn_(state_.priv.k, state_.priv.noise_regs, last_Ns, state_.pub.def.fill);\n\n    \/\/ apply volume\n#define ADSR_COUNTER (state_.priv.adsr_counter)\n    if(ADSR_COUNTER < state_.pub.volume.A) {\n        base = (float)ADSR_COUNTER\/state_.pub.volume.A\n            * state_.pub.volume.maxvol\n            * base;\n        ADSR_COUNTER++;\n    } else if(ADSR_COUNTER - state_.pub.volume.A < state_.pub.volume.D) {\n        float regl = (1.f\n                - (float)(ADSR_COUNTER - state_.pub.volume.A)\n                \/ state_.pub.volume.D);\n        base = \n            (regl * (1.f- state_.pub.volume.S) + (state_.pub.volume.S))\n            * state_.pub.volume.maxvol\n            * base;\n        ADSR_COUNTER++;\n    } else {\n        base = state_.pub.volume.maxvol * state_.pub.volume.S * base;\n    }\n\n    \/\/ don't check the modulated Ns here; Ns == 0 means no note is input\n    if(state_.pub.def.freq == 0\n            && ADSR_COUNTER - state_.pub.volume.A - state_.pub.volume.D\n            < state_.pub.volume.R)\n    {\n        base = (1.f - (float)(ADSR_COUNTER\n                        - state_.pub.volume.A - state_.pub.volume.D)\n                    \/ state_.pub.volume.R)\n            * state_.pub.volume.maxvol\n            * state_.pub.volume.S\n            * prev;\n        ADSR_COUNTER++;\n    }\n#undef ADSR_COUNTER\n\n    \/\/ apply amplitude lfo\n    unsigned lfo_Ns = (state_.pub.lfo.freq)\n        ? JAKMUSE_SAMPLES_PER_SECOND \/ state_.pub.lfo.freq\n        : 1\n        ;\n    unsigned lfo_lk = state_.priv.lfo_k++ % lfo_Ns;\n    unsigned lfo_zp = state_.pub.lfo.phase * lfo_Ns;\n    float lfo_sample = cosf(3.14159f *\n            ((lfo_lk < lfo_zp)\n             ? ((float)lfo_lk \/ lfo_zp)\n             : ( (float)(lfo_lk - lfo_zp)\n                     \/ (lfo_Ns - lfo_zp)\n                 + 1.f))\n            );\n    base = state_.pub.lfo.depth * lfo_sample * base\n        + (1.f - state_.pub.lfo.depth) * base;\n\n    \/\/ apply RC filter\n    float note = state_.pub.def.alpha * base +\n        (1.f - state_.pub.def.alpha) * state_.priv.rc_reg;\n    state_.priv.rc_reg = note;\n\n    \/\/ increment step\n    state_.priv.k++;\n\n    return note;\n}\n\nunsigned Generator::NewNote(unsigned frequency)\n{\n    state_.priv.last_freq = state_.pub.def.freq;\n    state_.pub.def.freq = frequency;\n    if(frequency) state_.priv.adsr_counter = 0;\n\n    if(state_.pub.glide.Ns\n            && state_.priv.last_freq\n            && state_.pub.def.freq)\n    {\n        unsigned T0 = JAKMUSE_SAMPLES_PER_SECOND \/ state_.priv.last_freq;\n        unsigned TN = JAKMUSE_SAMPLES_PER_SECOND \/ state_.pub.def.freq;\n        \/\/ cast it to long because cl complains it doesn't know which\n        \/\/     abs to call\n        state_.priv.gl_NsPerPeriod = state_.pub.glide.Ns \/ abs((long)(T0 - TN + 1));\n        state_.priv.gl_idx = 0;\n        state_.priv.gl_counter = state_.priv.gl_NsPerPeriod;\n        state_.priv.Ts.clear();\n        state_.priv.gl_passed = 0;\n        for(unsigned T = T0; T != TN; T += (T0 < TN) - (T0 >= TN)) {\n            state_.priv.Ts.push_back(T);\n        }\n        state_.priv.Ts.push_back(TN);\n    }\n\n    return state_.pub.def.NPS;\n}\n<commit_msg>only call sin twice if the first result is ind<commit_after>\/*\nCopyright (c) 2014-2015, Vlad Mesco\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\n1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\n2. 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\nTHIS 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#include <cmath>\n#include \"jakmuse_common.h\"\n\n#include <algorithm>\n\n#ifdef _MSC_VER\n# include <float.h>\n#endif\n\n\/\/ in semitones\n#define LFO_TUNING_MAX 1.f\n\nstatic float _square(unsigned k, noise_reg_t noise_regs[], unsigned short Ns, unsigned short fill)\n{\n    if(Ns == 0) return 0.f;\n\n    static float values[2] = { 1.f, -1.f };\n\n    unsigned lk = k++ % Ns;\n    return values[lk < Ns * fill \/ 256];\n}\n\nstatic float _triangle(unsigned k, noise_reg_t noise_regs[], unsigned short Ns, unsigned short fill)\n{\n    if(Ns == 0) return 0.f;\n\n    unsigned lk = k++ % Ns;\n\n    float val_1 = (lk < Ns * fill \/ 256)\n            ? (float)lk * 256 \/ (Ns * fill) * 2.f - 1.f\n            : (float)(Ns - lk) \/ (Ns - Ns * fill \/ 256) * 2.f - 1.f\n            ;\n    return val_1;\n}\n\nstatic float _sine(unsigned k, noise_reg_t noise_regs[], unsigned short Ns, unsigned short fill)\n{\n    if(Ns == 0) return 0.f;\n    \n    unsigned lk = k++ % Ns;\n    \/\/ use cos in order to keep triangle and sine in phase\n    \/\/ for fill = 128\n    float zeroPosition = (float)fill \/ 255.f;\n    unsigned zp = Ns * zeroPosition;\n#ifndef _MSC_VER\n    float val_1 = sinf(3.14159f * \n            ((lk < zp)\n            ? ((float)lk \/ zp)            \n            : ( (float)(lk - zp)\n                    \/ (float)(Ns - zp)\n                + 1.f))\n            );\n#else\n    \/* All right, let me explain...\n\n       There's this really weird thing that's happening on a particular\n       intel machine on windows where both sin and sinf start going\n       haywire and returning negative infinity like crazy.\n\n       I couldn't figure out for the life of me what the problem is,\n       but calling it 2 times in a row with _clearfp in between seems\n       to sort-of end up producing, you know, normal results. At least\n       for my test.\n\n       Another thing, it only starts happening more-or-less at random\n       based on other things that happen beforehand. I don't know...\n\n       If the negative infinity problem pops up again I'll probably spend\n       more time figuring out what the devil's happening.\n    *\/\n    volatile float val_2 =\n        ((lk < zp)\n        ? ((float)lk \/ zp)\n        : ( (float)(lk - zp)\n                \/ (Ns - zp)\n            + 1.f));\n    ;\n    _clearfp();\n    volatile float val_1 = sinf(val_2);\n    _clearfp();\n    (std::isnan(val_1) || std::isinf(val_1)) && (val_1 = sinf(val_2));\n#endif\n\n    return val_1;\n}\n\nstatic float _noise(unsigned k, noise_reg_t noise_regs[], unsigned short Ns, unsigned short fill)\n{\n    if(Ns == 0) return 0.f;\n    \n    noise_reg_t* myreg = &noise_regs[Ns > JAKMUSE_SAMPLES_PER_SECOND \/ 440];\n    unsigned lf = k++ % fill;\n\n    if(lf == 0) {\n        \/\/ this is one reason why calls to generate can't be parallelized\n        myreg->reg = (myreg->reg >> 1) ^ ((myreg->reg & 0x1) * myreg->poly);\n    }\n\n    return (float)myreg->reg \/ (float)0x7FFF;\n}\n\n\nvoid init_generators()\n{\n    g_generators.push_back(Generator(_square));\n    g_generators.push_back(Generator(_square));\n    g_generators.push_back(Generator(_triangle));\n    g_generators.push_back(Generator(_triangle));\n    g_generators.push_back(Generator(_noise));\n    g_generators.push_back(Generator(_sine));\n    g_generators.push_back(Generator(_sine));\n}\n\nfloat Generator::operator()()\n{\n    \/\/ grab the 'frequency' (wavelength, actually)\n    unsigned freq = state_.pub.def.freq;\n    unsigned last_freq = state_.priv.last_freq;\n    unsigned Ns = (freq) ? JAKMUSE_SAMPLES_PER_SECOND \/ freq : 0;\n    unsigned last_Ns = (last_freq) ? JAKMUSE_SAMPLES_PER_SECOND \/ last_freq : 0;\n\n    if(state_.pub.glide.Ns\n            && freq\n            && last_freq)\n    {\n        if(state_.priv.gl_counter < state_.priv.gl_NsPerPeriod) {\n            state_.priv.gl_counter++;\n        } else if(state_.priv.k % state_.priv.Ts[state_.priv.gl_idx] == 0) {\n            state_.priv.gl_counter = state_.priv.gl_nextStartAt;\n            state_.priv.gl_nextStartAt = 1;\n            state_.priv.k = 0;\n            state_.priv.gl_idx = \n                (1.03f * state_.priv.gl_passed + state_.priv.gl_NsPerPeriod)\n                \/ state_.priv.gl_NsPerPeriod\n                - 1;\n            state_.priv.gl_idx = std::min(state_.priv.gl_idx, state_.priv.Ts.size() - 1);\n        } else {\n            state_.priv.gl_nextStartAt++;\n        }\n        state_.priv.gl_counter++;\n        state_.priv.gl_passed++;\n        Ns = state_.priv.Ts[state_.priv.gl_idx];\n    }\n\n    \/\/ compute base sample\n    float base = fn_(state_.priv.k, state_.priv.noise_regs, Ns, state_.pub.def.fill);\n    float prev = fn_(state_.priv.k, state_.priv.noise_regs, last_Ns, state_.pub.def.fill);\n\n    \/\/ apply volume\n#define ADSR_COUNTER (state_.priv.adsr_counter)\n    if(ADSR_COUNTER < state_.pub.volume.A) {\n        base = (float)ADSR_COUNTER\/state_.pub.volume.A\n            * state_.pub.volume.maxvol\n            * base;\n        ADSR_COUNTER++;\n    } else if(ADSR_COUNTER - state_.pub.volume.A < state_.pub.volume.D) {\n        float regl = (1.f\n                - (float)(ADSR_COUNTER - state_.pub.volume.A)\n                \/ state_.pub.volume.D);\n        base = \n            (regl * (1.f- state_.pub.volume.S) + (state_.pub.volume.S))\n            * state_.pub.volume.maxvol\n            * base;\n        ADSR_COUNTER++;\n    } else {\n        base = state_.pub.volume.maxvol * state_.pub.volume.S * base;\n    }\n\n    \/\/ don't check the modulated Ns here; Ns == 0 means no note is input\n    if(state_.pub.def.freq == 0\n            && ADSR_COUNTER - state_.pub.volume.A - state_.pub.volume.D\n            < state_.pub.volume.R)\n    {\n        base = (1.f - (float)(ADSR_COUNTER\n                        - state_.pub.volume.A - state_.pub.volume.D)\n                    \/ state_.pub.volume.R)\n            * state_.pub.volume.maxvol\n            * state_.pub.volume.S\n            * prev;\n        ADSR_COUNTER++;\n    }\n#undef ADSR_COUNTER\n\n    \/\/ apply amplitude lfo\n    unsigned lfo_Ns = (state_.pub.lfo.freq)\n        ? JAKMUSE_SAMPLES_PER_SECOND \/ state_.pub.lfo.freq\n        : 1\n        ;\n    unsigned lfo_lk = state_.priv.lfo_k++ % lfo_Ns;\n    unsigned lfo_zp = state_.pub.lfo.phase * lfo_Ns;\n    float lfo_sample = cosf(3.14159f *\n            ((lfo_lk < lfo_zp)\n             ? ((float)lfo_lk \/ lfo_zp)\n             : ( (float)(lfo_lk - lfo_zp)\n                     \/ (lfo_Ns - lfo_zp)\n                 + 1.f))\n            );\n    base = state_.pub.lfo.depth * lfo_sample * base\n        + (1.f - state_.pub.lfo.depth) * base;\n\n    \/\/ apply RC filter\n    float note = state_.pub.def.alpha * base +\n        (1.f - state_.pub.def.alpha) * state_.priv.rc_reg;\n    state_.priv.rc_reg = note;\n\n    \/\/ increment step\n    state_.priv.k++;\n\n    return note;\n}\n\nunsigned Generator::NewNote(unsigned frequency)\n{\n    state_.priv.last_freq = state_.pub.def.freq;\n    state_.pub.def.freq = frequency;\n    if(frequency) state_.priv.adsr_counter = 0;\n\n    if(state_.pub.glide.Ns\n            && state_.priv.last_freq\n            && state_.pub.def.freq)\n    {\n        unsigned T0 = JAKMUSE_SAMPLES_PER_SECOND \/ state_.priv.last_freq;\n        unsigned TN = JAKMUSE_SAMPLES_PER_SECOND \/ state_.pub.def.freq;\n        \/\/ cast it to long because cl complains it doesn't know which\n        \/\/     abs to call\n        state_.priv.gl_NsPerPeriod = state_.pub.glide.Ns \/ abs((long)(T0 - TN + 1));\n        state_.priv.gl_idx = 0;\n        state_.priv.gl_counter = state_.priv.gl_NsPerPeriod;\n        state_.priv.Ts.clear();\n        state_.priv.gl_passed = 0;\n        for(unsigned T = T0; T != TN; T += (T0 < TN) - (T0 >= TN)) {\n            state_.priv.Ts.push_back(T);\n        }\n        state_.priv.Ts.push_back(TN);\n    }\n\n    return state_.pub.def.NPS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * tokenizer_test.cpp\n *\n *  Created on: Sep 28, 2015\n *      Author: zmij\n *\/\n\n#include <gtest\/gtest.h>\n\n#include <tip\/db\/pg.hpp>\n#include <tip\/db\/pg\/detail\/tokenizer_base.hpp>\n#include <tip\/db\/pg\/io\/vector.hpp>\n#include <tip\/db\/pg\/io\/array.hpp>\n\n#include \"db\/config.hpp\"\n#include \"test-environment.hpp\"\n\n#include <boost\/iostreams\/stream_buffer.hpp>\n#include <boost\/iostreams\/device\/back_inserter.hpp>\n\ntypedef std::vector< std::string > token_list;\ntypedef std::pair< std::string, token_list > test_param_type;\n\nclass ArrayParseTest : public ::testing::TestWithParam< test_param_type > {\npublic:\n\ttypedef tip::db::pg::io::detail::tokenizer_base<\n\t\t\tstd::string::const_iterator, '{', '}' > string_tokenizer_type;\n};\n\nTEST_P(ArrayParseTest, Parses)\n{\n\tParamType param = GetParam();\n\tstd::vector< std::string > tokens;\n\tstd::string::const_iterator current = param.first.begin();\n\tstring_tokenizer_type(current, param.first.end(), std::back_inserter(tokens));\n\tEXPECT_EQ(param.second.size(), tokens.size());\n\tEXPECT_EQ(param.second, tokens);\n}\n\nINSTANTIATE_TEST_CASE_P(ArraySupport, ArrayParseTest,\n\t::testing::Values(\n\t\ttest_param_type{ \"{}\", {} },\n\t\ttest_param_type{ \"{,}\", {\"\", \"\"} },\n\t\ttest_param_type{ \"{0,1,2,3}\", {\"0\", \"1\", \"2\", \"3\"} },\n\t\ttest_param_type{\n\t\t\tR\"~({\"foo\",'bar','baz''bar'})~\",\n\t\t\t{ \"foo\", \"bar\", \"baz'bar\" }\n\t\t}\n\t)\n);\n\nTEST(ArraySupport, VectorIOTest)\n{\n\tusing namespace tip::db::pg;\n\ttypedef boost::iostreams::stream_buffer<\n\t\t\tboost::iostreams::back_insert_device< std::vector<char> >>\n\t\t\tvector_buff_type;\n\ttypedef std::vector< byte > buffer_type;\n\ttypedef std::vector< int > int_vector;\n\ttypedef std::array< int, 3 > int_array;\n\n\t{\n\t\tbuffer_type buffer;\n\t\tint_vector vals { 1, 2, 3, 4 };\n\t\tio::protocol_write< TEXT_DATA_FORMAT >(buffer, vals);\n\t\tstd::string check(buffer.begin(), buffer.end());\n\t\tEXPECT_EQ(\"{1,2,3,4}\", check);\n\t}\n\n\t{\n\t\tbuffer_type buffer;\n\t\tint_vector vals;\n\t\t{\n\t\t\tvector_buff_type vbuff(buffer);\n\t\t\tstd::ostream os(&vbuff);\n\t\t\tos << \"{5,6,7,8}\";\n\t\t}\n\t\tio::protocol_read< TEXT_DATA_FORMAT >(buffer.begin(), buffer.end(), vals);\n\t\tEXPECT_EQ((int_vector{ 5, 6, 7,  8 }), vals);\n\t}\n\n\t{\n\t\tbuffer_type buffer;\n\t\tint_array vals { 1, 2, 3 };\n\t\tio::protocol_write< TEXT_DATA_FORMAT >(buffer, vals);\n\t\tstd::string check(buffer.begin(), buffer.end());\n\t\tEXPECT_EQ(\"{1,2,3}\", check);\n\t}\n\n\t{\n\t\tbuffer_type buffer;\n\t\tint_array vals;\n\t\t{\n\t\t\tvector_buff_type vbuff(buffer);\n\t\t\tstd::ostream os(&vbuff);\n\t\t\tos << \"{5,6,7,8}\";\n\t\t}\n\t\tio::protocol_read< TEXT_DATA_FORMAT >(buffer.begin(), buffer.end(), vals);\n\t\tEXPECT_EQ((int_array{ 5, 6, 7 }), vals);\n\t}\n\t{\n\t\tbuffer_type buffer;\n\t\tint_array vals;\n\t\t{\n\t\t\tvector_buff_type vbuff(buffer);\n\t\t\tstd::ostream os(&vbuff);\n\t\t\tos << \"{5,6}\";\n\t\t}\n\t\tio::protocol_read< TEXT_DATA_FORMAT >(buffer.begin(), buffer.end(), vals);\n\t\tEXPECT_EQ((int_array{ 5, 6, 0 }), vals);\n\t}\n}\n\nTEST(ArraySupport, DatabaseRoundtrip)\n{\n\tusing namespace tip::db::pg;\n\tif (!test::environment::test_database.empty()) {\n\t\tdb_service::add_connection(test::environment::test_database);\n\t\tconnection_options opts = connection_options::parse(test::environment::test_database);\n\n\t\ttypedef std::vector< integer > int_vector;\n\n\t\tint_vector in_v { 1, 2, 3, 4 };\n\t\tresultset res;\n\n\t\tdb_service::begin(opts.alias,\n\t\t[&](transaction_ptr tran) {\n\t\t\tquery(tran,\n\t\t\t\t\"create temporary table pg_async_array_support(a integer[])\")(\n\t\t\t[](transaction_ptr t, resultset, bool) {\n\t\t\t},\n\t\t\t[](error::db_error const&) {}\n\t\t\t);\n\t\t\tquery(tran, \"insert into pg_async_array_support values ($1::integer[])\", in_v)(\n\t\t\t[](transaction_ptr t, resultset, bool) {},\n\t\t\t[](error::db_error const&) {}\n\t\t\t);\n\t\t\tquery(tran, \"select a from pg_async_array_support\")(\n\t\t\t[&res](transaction_ptr t, resultset r, bool) {\n\t\t\t\tres = r;\n\t\t\t\tdb_service::stop();\n\t\t\t},\n\t\t\t[](error::db_error const&) {\n\t\t\t\tdb_service::stop();\n\t\t\t}\n\t\t\t);\n\t\t},\n\t\t[](error::db_error const&) {\n\t\t\tdb_service::stop();\n\t\t}\n\t\t);\n\t\tdb_service::run();\n\t\tASSERT_FALSE(res.empty());\n\t\tASSERT_EQ(1, res.size());\n\t\tASSERT_EQ(1, res.columns_size());\n\t\tint_vector out_v;\n\t\tres.front().to(out_v);\n\t\tEXPECT_EQ(in_v, out_v);\n\t}\n}\n<commit_msg>AWM-392 fixed initial values for array_support test<commit_after>\/*\n * tokenizer_test.cpp\n *\n *  Created on: Sep 28, 2015\n *      Author: zmij\n *\/\n\n#include <gtest\/gtest.h>\n\n#include <tip\/db\/pg.hpp>\n#include <tip\/db\/pg\/detail\/tokenizer_base.hpp>\n#include <tip\/db\/pg\/io\/vector.hpp>\n#include <tip\/db\/pg\/io\/array.hpp>\n\n#include \"db\/config.hpp\"\n#include \"test-environment.hpp\"\n\n#include <boost\/iostreams\/stream_buffer.hpp>\n#include <boost\/iostreams\/device\/back_inserter.hpp>\n\ntypedef std::vector< std::string > token_list;\ntypedef std::pair< std::string, token_list > test_param_type;\n\nclass ArrayParseTest : public ::testing::TestWithParam< test_param_type > {\npublic:\n\ttypedef tip::db::pg::io::detail::tokenizer_base<\n\t\t\tstd::string::const_iterator, '{', '}' > string_tokenizer_type;\n};\n\nTEST_P(ArrayParseTest, Parses)\n{\n\tParamType param = GetParam();\n\tstd::vector< std::string > tokens;\n\tstd::string::const_iterator current = param.first.begin();\n\tstring_tokenizer_type(current, param.first.end(), std::back_inserter(tokens));\n\tEXPECT_EQ(param.second.size(), tokens.size());\n\tEXPECT_EQ(param.second, tokens);\n}\n\nINSTANTIATE_TEST_CASE_P(ArraySupport, ArrayParseTest,\n\t::testing::Values(\n\t\ttest_param_type{ \"{}\", {} },\n\t\ttest_param_type{ \"{,}\", {\"\", \"\"} },\n\t\ttest_param_type{ \"{0,1,2,3}\", {\"0\", \"1\", \"2\", \"3\"} },\n\t\ttest_param_type{\n\t\t\tR\"~({\"foo\",'bar','baz''bar'})~\",\n\t\t\t{ \"foo\", \"bar\", \"baz'bar\" }\n\t\t}\n\t)\n);\n\nTEST(ArraySupport, VectorIOTest)\n{\n\tusing namespace tip::db::pg;\n\ttypedef boost::iostreams::stream_buffer<\n\t\t\tboost::iostreams::back_insert_device< std::vector<char> >>\n\t\t\tvector_buff_type;\n\ttypedef std::vector< byte > buffer_type;\n\ttypedef std::vector< int > int_vector;\n\ttypedef std::array< int, 3 > int_array;\n\n\t{\n\t\tbuffer_type buffer;\n\t\tint_vector vals { 1, 2, 3, 4 };\n\t\tio::protocol_write< TEXT_DATA_FORMAT >(buffer, vals);\n\t\tstd::string check(buffer.begin(), buffer.end());\n\t\tEXPECT_EQ(\"{1,2,3,4}\", check);\n\t}\n\n\t{\n\t\tbuffer_type buffer;\n\t\tint_vector vals;\n\t\t{\n\t\t\tvector_buff_type vbuff(buffer);\n\t\t\tstd::ostream os(&vbuff);\n\t\t\tos << \"{5,6,7,8}\";\n\t\t}\n\t\tio::protocol_read< TEXT_DATA_FORMAT >(buffer.begin(), buffer.end(), vals);\n\t\tEXPECT_EQ((int_vector{ 5, 6, 7,  8 }), vals);\n\t}\n\n\t{\n\t\tbuffer_type buffer;\n\t\tint_array vals { 1, 2, 3 };\n\t\tio::protocol_write< TEXT_DATA_FORMAT >(buffer, vals);\n\t\tstd::string check(buffer.begin(), buffer.end());\n\t\tEXPECT_EQ(\"{1,2,3}\", check);\n\t}\n\n\t{\n\t\tbuffer_type buffer;\n\t\tint_array vals;\n\t\t{\n\t\t\tvector_buff_type vbuff(buffer);\n\t\t\tstd::ostream os(&vbuff);\n\t\t\tos << \"{5,6,7,8}\";\n\t\t}\n\t\tio::protocol_read< TEXT_DATA_FORMAT >(buffer.begin(), buffer.end(), vals);\n\t\tEXPECT_EQ((int_array{ 5, 6, 7 }), vals);\n\t}\n\t{\n\t\tbuffer_type buffer;\n\t\tint_array vals = {101,102,103};\n\t\t{\n\t\t\tvector_buff_type vbuff(buffer);\n\t\t\tstd::ostream os(&vbuff);\n\t\t\tos << \"{5,6}\";\n\t\t}\n\t\tio::protocol_read< TEXT_DATA_FORMAT >(buffer.begin(), buffer.end(), vals);\n\t\tEXPECT_EQ((int_array{ 5, 6, 103 }), vals);\n\t}\n}\n\nTEST(ArraySupport, DatabaseRoundtrip)\n{\n\tusing namespace tip::db::pg;\n\tif (!test::environment::test_database.empty()) {\n\t\tdb_service::add_connection(test::environment::test_database);\n\t\tconnection_options opts = connection_options::parse(test::environment::test_database);\n\n\t\ttypedef std::vector< integer > int_vector;\n\n\t\tint_vector in_v { 1, 2, 3, 4 };\n\t\tresultset res;\n\n\t\tdb_service::begin(opts.alias,\n\t\t[&](transaction_ptr tran) {\n\t\t\tquery(tran,\n\t\t\t\t\"create temporary table pg_async_array_support(a integer[])\")(\n\t\t\t[](transaction_ptr t, resultset, bool) {\n\t\t\t},\n\t\t\t[](error::db_error const&) {}\n\t\t\t);\n\t\t\tquery(tran, \"insert into pg_async_array_support values ($1::integer[])\", in_v)(\n\t\t\t[](transaction_ptr t, resultset, bool) {},\n\t\t\t[](error::db_error const&) {}\n\t\t\t);\n\t\t\tquery(tran, \"select a from pg_async_array_support\")(\n\t\t\t[&res](transaction_ptr t, resultset r, bool) {\n\t\t\t\tres = r;\n\t\t\t\tdb_service::stop();\n\t\t\t},\n\t\t\t[](error::db_error const&) {\n\t\t\t\tdb_service::stop();\n\t\t\t}\n\t\t\t);\n\t\t},\n\t\t[](error::db_error const&) {\n\t\t\tdb_service::stop();\n\t\t}\n\t\t);\n\t\tdb_service::run();\n\t\tASSERT_FALSE(res.empty());\n\t\tASSERT_EQ(1, res.size());\n\t\tASSERT_EQ(1, res.columns_size());\n\t\tint_vector out_v;\n\t\tres.front().to(out_v);\n\t\tEXPECT_EQ(in_v, out_v);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2016 Patrick P. Frey\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 \"testUtils.hpp\"\n#include \"strus\/analyzer\/patternMatcherResultItem.hpp\"\n#include <iostream>\n#include <sstream>\n#include <limits>\n#include <cstdlib>\n#include <cstdio>\n#include <cstring>\n#include <stdexcept>\n#include <new>\n\n#define RANDINT(MIN,MAX) ((std::rand()%(MAX-MIN))+MIN)\n\nusing namespace strus;\nusing namespace strus::utils;\n\nstd::string Document::tostring() const\n{\n\tstd::ostringstream outbuf;\n\toutbuf << \"docid=\" << id << \", items={\";\n\tstd::vector<DocumentItem>::const_iterator ti = itemar.begin(), te = itemar.end();\n\tfor (int tidx=0; ti != te; ++ti,++tidx)\n\t{\n\t\tif (tidx) outbuf << \", \";\n\t\toutbuf << ti->pos << \":\" << ti->termid;\n\t}\n\toutbuf << \"}\";\n\treturn outbuf.str();\n}\n\nZipfDistribution::ZipfDistribution( std::size_t size, double S)\n{\n\tstd::size_t ii=1, ie=size;\n\tm_ar.push_back( 1.0);\n\tfor (; ii < ie; ++ii)\n\t{\n\t\tif (S > std::numeric_limits<double>::epsilon())\n\t\t{\n\t\t\tm_ar.push_back( m_ar[ ii-1] + 1.0 \/ pow((double)(ii+1), S));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_ar.push_back( m_ar[ ii-1] + 1.0 \/ (double)(ii+1));\n\t\t}\n\t}\n}\n\nunsigned int ZipfDistribution::random() const\n{\n\tdouble val = m_ar.back() * (double)std::rand() \/ (double)RAND_MAX;\n\tstd::size_t ii=0;\n\tfor (; ii<m_ar.size(); ++ii)\n\t{\n\t\tif (val < m_ar[ii])\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\twhile (m_ar.size() - ii > 100 && val > m_ar[ ii+100])\n\t\t{\n\t\t\tii+=100;\n\t\t}\n\t}\n\treturn ii+1;\n}\n\nunsigned int utils::termId( TermType tp, unsigned int no)\n{\n\treturn ((unsigned int)tp << 24) + no;\n}\n\nDocument utils::createRandomDocument( unsigned int no, unsigned int size, unsigned int mod)\n{\n\tZipfDistribution featdist( mod);\n\tchar docid[ 32];\n\tsnprintf( docid, sizeof(docid), \"doc_%u\", no);\n\tDocument rt( docid);\n\tunsigned int ii = 0, ie = size;\n\tfor (; ii < ie; ++ii)\n\t{\n\t\tunsigned int tok = featdist.random();\n\t\trt.itemar.push_back( DocumentItem( ii+1, termId( Token, tok)));\n\t\tif (RANDINT(0,12) == 0)\n\t\t{\n\t\t\trt.itemar.push_back( DocumentItem( ii+1, termId( SentenceDelim, 0)));\n\t\t}\n\t}\n\treturn rt;\n}\n\ntypedef strus::PatternMatcherInstanceInterface::JoinOperation JoinOperation;\nJoinOperation utils::joinOperation( const char* joinopstr)\n{\n\tstatic const char* ar[] = {\"sequence\",\"sequence_struct\",\"within\",\"within_struct\",\"any\",0};\n\tstd::size_t ai = 0;\n\tfor (; ar[ai]; ++ai)\n\t{\n\t\tif (0 == std::strcmp( joinopstr, ar[ai]))\n\t\t{\n\t\t\treturn (JoinOperation)ai;\n\t\t}\n\t}\n\tthrow std::runtime_error( \"unknown join operation\");\n}\n\nunsigned int utils::getUintValue( const char* arg)\n{\n\tunsigned int rt = 0, prev = 0;\n\tchar const* cc = arg;\n\tfor (; *cc; ++cc)\n\t{\n\t\tif (*cc < '0' || *cc > '9') throw std::runtime_error( std::string( \"parameter is not a non negative integer number: \") + arg);\n\t\trt = (rt * 10) + (*cc - '0');\n\t\tif (rt < prev) throw std::runtime_error( std::string( \"parameter out of range: \") + arg);\n\t}\n\treturn rt;\n}\n\nvoid utils::printResults( std::ostream& out, const std::vector<strus::SegmenterPosition>& segmentposmap, const std::vector<strus::analyzer::PatternMatcherResult>& results, const char* src)\n{\n\tstd::vector<strus::analyzer::PatternMatcherResult>::const_iterator\n\t\tri = results.begin(), re = results.end();\n\tfor (; ri != re; ++ri)\n\t{\n\t\tstd::size_t start_origsegsrcpos = segmentposmap.empty()?ri->origpos().seg():segmentposmap[ ri->origpos().seg()];\n\t\tstd::size_t end_origsegsrcpos = segmentposmap.empty()?ri->origend().seg():segmentposmap[ ri->origend().seg()];\n\n\t\tout << \"match '\" << ri->name() << \"' at \" << ri->ordpos() << \"..\" << ri->ordend() << \" [\"\n\t\t\t<< start_origsegsrcpos << \"|\" << ri->origpos().ofs() << \"..\"\n\t\t\t<< end_origsegsrcpos << \"|\" << ri->origend().ofs()\n\t\t\t<< \"]:\";\n\t\tstd::vector<strus::analyzer::PatternMatcherResultItem>::const_iterator\n\t\t\tei = ri->items().begin(), ee = ri->items().end();\n\t\n\t\tfor (; ei != ee; ++ei)\n\t\t{\n\t\t\tstart_origsegsrcpos = segmentposmap.empty()?ei->origpos().seg():segmentposmap[ ei->origpos().seg()];\n\t\t\tend_origsegsrcpos = segmentposmap.empty()?ei->origend().seg():segmentposmap[ ei->origend().seg()];\n\n\t\t\tout << \" \" << ei->name() << \" [\" << ei->ordpos()<< \"..\" << ei->ordend()\n\t\t\t\t\t<< \", \" << start_origsegsrcpos << \"|\" << ei->origpos().ofs()\n\t\t\t\t\t<< \"..\" << end_origsegsrcpos << \"|\" << ei->origend().ofs()\n\t\t\t\t\t<< \"]\";\n\t\t\tif (src)\n\t\t\t{\n\t\t\t\tstd::size_t start_srcpos = start_origsegsrcpos + ei->origpos().ofs();\n\t\t\t\tstd::size_t end_srcpos = end_origsegsrcpos + ei->origend().ofs();\n\t\t\t\tout << \" '\" << std::string( src+start_srcpos, end_srcpos-start_srcpos) << \"'\";\n\t\t\t}\n\t\t}\n\t\tout << std::endl;\n\t}\n}\n\nvoid utils::printStatistics( std::ostream& out, const strus::analyzer::PatternMatcherStatistics& stats)\n{\n\tout << \"Statistics:\" << std::endl;\n\tstd::vector<strus::analyzer::PatternMatcherStatistics::Item>::const_iterator\n\t\tgi = stats.items().begin(), ge = stats.items().end();\n\tfor (; gi != ge; ++gi)\n\t{\n\t\tout << \"\\t\" << gi->name() << \": \" << floor( gi->value()+0.5) << std::endl;\n\t}\n}\n\n<commit_msg>fix call of 'pow' not using wrapper in test<commit_after>\/*\n * Copyright (c) 2016 Patrick P. Frey\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 \"testUtils.hpp\"\n#include \"strus\/analyzer\/patternMatcherResultItem.hpp\"\n#include \"strus\/base\/math.hpp\"\n#include <iostream>\n#include <sstream>\n#include <limits>\n#include <cstdlib>\n#include <cstdio>\n#include <cstring>\n#include <stdexcept>\n#include <new>\n\n#define RANDINT(MIN,MAX) ((std::rand()%(MAX-MIN))+MIN)\n\nusing namespace strus;\nusing namespace strus::utils;\n\nstd::string Document::tostring() const\n{\n\tstd::ostringstream outbuf;\n\toutbuf << \"docid=\" << id << \", items={\";\n\tstd::vector<DocumentItem>::const_iterator ti = itemar.begin(), te = itemar.end();\n\tfor (int tidx=0; ti != te; ++ti,++tidx)\n\t{\n\t\tif (tidx) outbuf << \", \";\n\t\toutbuf << ti->pos << \":\" << ti->termid;\n\t}\n\toutbuf << \"}\";\n\treturn outbuf.str();\n}\n\nZipfDistribution::ZipfDistribution( std::size_t size, double S)\n{\n\tstd::size_t ii=1, ie=size;\n\tm_ar.push_back( 1.0);\n\tfor (; ii < ie; ++ii)\n\t{\n\t\tif (S > std::numeric_limits<double>::epsilon())\n\t\t{\n\t\t\tm_ar.push_back( m_ar[ ii-1] + 1.0 \/ strus::Math::pow((double)(ii+1), S));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_ar.push_back( m_ar[ ii-1] + 1.0 \/ (double)(ii+1));\n\t\t}\n\t}\n}\n\nunsigned int ZipfDistribution::random() const\n{\n\tdouble val = m_ar.back() * (double)std::rand() \/ (double)RAND_MAX;\n\tstd::size_t ii=0;\n\tfor (; ii<m_ar.size(); ++ii)\n\t{\n\t\tif (val < m_ar[ii])\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\twhile (m_ar.size() - ii > 100 && val > m_ar[ ii+100])\n\t\t{\n\t\t\tii+=100;\n\t\t}\n\t}\n\treturn ii+1;\n}\n\nunsigned int utils::termId( TermType tp, unsigned int no)\n{\n\treturn ((unsigned int)tp << 24) + no;\n}\n\nDocument utils::createRandomDocument( unsigned int no, unsigned int size, unsigned int mod)\n{\n\tZipfDistribution featdist( mod);\n\tchar docid[ 32];\n\tsnprintf( docid, sizeof(docid), \"doc_%u\", no);\n\tDocument rt( docid);\n\tunsigned int ii = 0, ie = size;\n\tfor (; ii < ie; ++ii)\n\t{\n\t\tunsigned int tok = featdist.random();\n\t\trt.itemar.push_back( DocumentItem( ii+1, termId( Token, tok)));\n\t\tif (RANDINT(0,12) == 0)\n\t\t{\n\t\t\trt.itemar.push_back( DocumentItem( ii+1, termId( SentenceDelim, 0)));\n\t\t}\n\t}\n\treturn rt;\n}\n\ntypedef strus::PatternMatcherInstanceInterface::JoinOperation JoinOperation;\nJoinOperation utils::joinOperation( const char* joinopstr)\n{\n\tstatic const char* ar[] = {\"sequence\",\"sequence_struct\",\"within\",\"within_struct\",\"any\",0};\n\tstd::size_t ai = 0;\n\tfor (; ar[ai]; ++ai)\n\t{\n\t\tif (0 == std::strcmp( joinopstr, ar[ai]))\n\t\t{\n\t\t\treturn (JoinOperation)ai;\n\t\t}\n\t}\n\tthrow std::runtime_error( \"unknown join operation\");\n}\n\nunsigned int utils::getUintValue( const char* arg)\n{\n\tunsigned int rt = 0, prev = 0;\n\tchar const* cc = arg;\n\tfor (; *cc; ++cc)\n\t{\n\t\tif (*cc < '0' || *cc > '9') throw std::runtime_error( std::string( \"parameter is not a non negative integer number: \") + arg);\n\t\trt = (rt * 10) + (*cc - '0');\n\t\tif (rt < prev) throw std::runtime_error( std::string( \"parameter out of range: \") + arg);\n\t}\n\treturn rt;\n}\n\nvoid utils::printResults( std::ostream& out, const std::vector<strus::SegmenterPosition>& segmentposmap, const std::vector<strus::analyzer::PatternMatcherResult>& results, const char* src)\n{\n\tstd::vector<strus::analyzer::PatternMatcherResult>::const_iterator\n\t\tri = results.begin(), re = results.end();\n\tfor (; ri != re; ++ri)\n\t{\n\t\tstd::size_t start_origsegsrcpos = segmentposmap.empty()?ri->origpos().seg():segmentposmap[ ri->origpos().seg()];\n\t\tstd::size_t end_origsegsrcpos = segmentposmap.empty()?ri->origend().seg():segmentposmap[ ri->origend().seg()];\n\n\t\tout << \"match '\" << ri->name() << \"' at \" << ri->ordpos() << \"..\" << ri->ordend() << \" [\"\n\t\t\t<< start_origsegsrcpos << \"|\" << ri->origpos().ofs() << \"..\"\n\t\t\t<< end_origsegsrcpos << \"|\" << ri->origend().ofs()\n\t\t\t<< \"]:\";\n\t\tstd::vector<strus::analyzer::PatternMatcherResultItem>::const_iterator\n\t\t\tei = ri->items().begin(), ee = ri->items().end();\n\t\n\t\tfor (; ei != ee; ++ei)\n\t\t{\n\t\t\tstart_origsegsrcpos = segmentposmap.empty()?ei->origpos().seg():segmentposmap[ ei->origpos().seg()];\n\t\t\tend_origsegsrcpos = segmentposmap.empty()?ei->origend().seg():segmentposmap[ ei->origend().seg()];\n\n\t\t\tout << \" \" << ei->name() << \" [\" << ei->ordpos()<< \"..\" << ei->ordend()\n\t\t\t\t\t<< \", \" << start_origsegsrcpos << \"|\" << ei->origpos().ofs()\n\t\t\t\t\t<< \"..\" << end_origsegsrcpos << \"|\" << ei->origend().ofs()\n\t\t\t\t\t<< \"]\";\n\t\t\tif (src)\n\t\t\t{\n\t\t\t\tstd::size_t start_srcpos = start_origsegsrcpos + ei->origpos().ofs();\n\t\t\t\tstd::size_t end_srcpos = end_origsegsrcpos + ei->origend().ofs();\n\t\t\t\tout << \" '\" << std::string( src+start_srcpos, end_srcpos-start_srcpos) << \"'\";\n\t\t\t}\n\t\t}\n\t\tout << std::endl;\n\t}\n}\n\nvoid utils::printStatistics( std::ostream& out, const strus::analyzer::PatternMatcherStatistics& stats)\n{\n\tout << \"Statistics:\" << std::endl;\n\tstd::vector<strus::analyzer::PatternMatcherStatistics::Item>::const_iterator\n\t\tgi = stats.items().begin(), ge = stats.items().end();\n\tfor (; gi != ge; ++gi)\n\t{\n\t\tout << \"\\t\" << gi->name() << \": \" << floor( gi->value()+0.5) << std::endl;\n\t}\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 \"versiondialog.h\"\n\n#include <app\/app_version.h>\n#include <coreplugin\/coreconstants.h>\n#include <coreplugin\/icore.h>\n#include <utils\/qtcassert.h>\n\n#include <QDialogButtonBox>\n#include <QGridLayout>\n#include <QKeyEvent>\n#include <QLabel>\n#include <QPushButton>\n\nusing namespace Core;\nusing namespace Core::Internal;\n\nVersionDialog::VersionDialog(QWidget *parent)\n    : QDialog(parent)\n{\n    \/\/ We need to set the window icon explicitly here since for some reason the\n    \/\/ application icon isn't used when the size of the dialog is fixed (at least not on X11\/GNOME)\n    setWindowIcon(QIcon(QLatin1String(Constants::ICON_QTLOGO_128)));\n\n    setWindowTitle(tr(\"About Qt Creator\"));\n    setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);\n    QGridLayout *layout = new QGridLayout(this);\n    layout->setSizeConstraint(QLayout::SetFixedSize);\n\n    QString ideRev;\n#ifdef IDE_REVISION\n     \/\/: This gets conditionally inserted as argument %8 into the description string.\n     ideRev = tr(\"From revision %1<br\/>\").arg(QString::fromLatin1(Constants::IDE_REVISION_STR).left(10));\n#endif\n\n     const QString description = tr(\n        \"<h3>%1<\/h3>\"\n        \"%2<br\/>\"\n        \"<br\/>\"\n        \"Built on %3 at %4<br \/>\"\n        \"<br\/>\"\n        \"%5\"\n        \"<br\/>\"\n        \"Copyright 2008-%6 %7. All rights reserved.<br\/>\"\n        \"<br\/>\"\n        \"The program is provided AS IS with NO WARRANTY OF ANY KIND, \"\n        \"INCLUDING THE WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A \"\n        \"PARTICULAR PURPOSE.<br\/>\")\n        .arg(ICore::versionString(),\n             ICore::buildCompatibilityString(),\n             QLatin1String(__DATE__), QLatin1String(__TIME__),\n             ideRev,\n             QLatin1String(Constants::IDE_YEAR),\n             QLatin1String(Constants::IDE_AUTHOR));\n\n    QLabel *copyRightLabel = new QLabel(description);\n    copyRightLabel->setWordWrap(true);\n    copyRightLabel->setOpenExternalLinks(true);\n    copyRightLabel->setTextInteractionFlags(Qt::TextBrowserInteraction);\n\n    QDialogButtonBox *buttonBox = new QDialogButtonBox(QDialogButtonBox::Close);\n    QPushButton *closeButton = buttonBox->button(QDialogButtonBox::Close);\n    QTC_CHECK(closeButton);\n    buttonBox->addButton(closeButton, QDialogButtonBox::ButtonRole(QDialogButtonBox::RejectRole | QDialogButtonBox::AcceptRole));\n    connect(buttonBox , SIGNAL(rejected()), this, SLOT(reject()));\n\n    QLabel *logoLabel = new QLabel;\n    logoLabel->setPixmap(QPixmap(QLatin1String(Constants::ICON_QTLOGO_128)));\n    layout->addWidget(logoLabel , 0, 0, 1, 1);\n    layout->addWidget(copyRightLabel, 0, 1, 4, 4);\n    layout->addWidget(buttonBox, 4, 0, 1, 5);\n}\n\nbool VersionDialog::event(QEvent *event)\n{\n    if (event->type() == QEvent::ShortcutOverride) {\n        QKeyEvent *ke = static_cast<QKeyEvent *>(event);\n        if (ke->key() == Qt::Key_Escape && !ke->modifiers()) {\n            ke->accept();\n            return true;\n        }\n    }\n    return QDialog::event(event);\n}\n<commit_msg>[qtc] more room for revision in the about dialog<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 \"versiondialog.h\"\n\n#include <app\/app_version.h>\n#include <coreplugin\/coreconstants.h>\n#include <coreplugin\/icore.h>\n#include <utils\/qtcassert.h>\n\n#include <QDialogButtonBox>\n#include <QGridLayout>\n#include <QKeyEvent>\n#include <QLabel>\n#include <QPushButton>\n\nusing namespace Core;\nusing namespace Core::Internal;\n\nVersionDialog::VersionDialog(QWidget *parent)\n    : QDialog(parent)\n{\n    \/\/ We need to set the window icon explicitly here since for some reason the\n    \/\/ application icon isn't used when the size of the dialog is fixed (at least not on X11\/GNOME)\n    setWindowIcon(QIcon(QLatin1String(Constants::ICON_QTLOGO_128)));\n\n    setWindowTitle(tr(\"About Qt Creator\"));\n    setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);\n    QGridLayout *layout = new QGridLayout(this);\n    layout->setSizeConstraint(QLayout::SetFixedSize);\n\n    QString ideRev;\n#ifdef IDE_REVISION\n     \/\/: This gets conditionally inserted as argument %8 into the description string.\n     ideRev = tr(\"From revision %1<br\/>\").arg(QString::fromLatin1(Constants::IDE_REVISION_STR).left(14));\n#endif\n\n     const QString description = tr(\n        \"<h3>%1<\/h3>\"\n        \"%2<br\/>\"\n        \"<br\/>\"\n        \"Built on %3 at %4<br \/>\"\n        \"<br\/>\"\n        \"%5\"\n        \"<br\/>\"\n        \"Copyright 2008-%6 %7. All rights reserved.<br\/>\"\n        \"<br\/>\"\n        \"The program is provided AS IS with NO WARRANTY OF ANY KIND, \"\n        \"INCLUDING THE WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A \"\n        \"PARTICULAR PURPOSE.<br\/>\")\n        .arg(ICore::versionString(),\n             ICore::buildCompatibilityString(),\n             QLatin1String(__DATE__), QLatin1String(__TIME__),\n             ideRev,\n             QLatin1String(Constants::IDE_YEAR),\n             QLatin1String(Constants::IDE_AUTHOR));\n\n    QLabel *copyRightLabel = new QLabel(description);\n    copyRightLabel->setWordWrap(true);\n    copyRightLabel->setOpenExternalLinks(true);\n    copyRightLabel->setTextInteractionFlags(Qt::TextBrowserInteraction);\n\n    QDialogButtonBox *buttonBox = new QDialogButtonBox(QDialogButtonBox::Close);\n    QPushButton *closeButton = buttonBox->button(QDialogButtonBox::Close);\n    QTC_CHECK(closeButton);\n    buttonBox->addButton(closeButton, QDialogButtonBox::ButtonRole(QDialogButtonBox::RejectRole | QDialogButtonBox::AcceptRole));\n    connect(buttonBox , SIGNAL(rejected()), this, SLOT(reject()));\n\n    QLabel *logoLabel = new QLabel;\n    logoLabel->setPixmap(QPixmap(QLatin1String(Constants::ICON_QTLOGO_128)));\n    layout->addWidget(logoLabel , 0, 0, 1, 1);\n    layout->addWidget(copyRightLabel, 0, 1, 4, 4);\n    layout->addWidget(buttonBox, 4, 0, 1, 5);\n}\n\nbool VersionDialog::event(QEvent *event)\n{\n    if (event->type() == QEvent::ShortcutOverride) {\n        QKeyEvent *ke = static_cast<QKeyEvent *>(event);\n        if (ke->key() == Qt::Key_Escape && !ke->modifiers()) {\n            ke->accept();\n            return true;\n        }\n    }\n    return QDialog::event(event);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This autogenerated skeleton file illustrates how to build a server.\n\/\/ You should copy it to another filename to avoid overwriting it.\n#include <sstream>\n#include <iostream>   \/\/ std::cout\n#include <string>     \/\/ std::string, std::to_string\n\n#include \"RegistryProxy.h\"\n#include <thrift\/protocol\/TBinaryProtocol.h>\n#include <thrift\/server\/TSimpleServer.h>\n#include <thrift\/transport\/TServerSocket.h>\n#include <thrift\/transport\/TBufferTransports.h>\n\nusing namespace std;\nusing namespace ::apache::thrift;\nusing namespace ::apache::thrift::protocol;\nusing namespace ::apache::thrift::transport;\nusing namespace ::apache::thrift::server;\n\nusing boost::shared_ptr;\n\nusing namespace ::FinagleRegistryProxy;\n\nclass RegistryProxyHandler: virtual public RegistryProxyIf {\npublic:\n\tRegistryProxyHandler() {\n\t\t\/\/ Your initialization goes here\n\t}\n\n\tvoid get(std::string& _return, const std::string& serviceName) {\n\t\tstringstream ss;\n\t\tss << (time(0) \/ 1000);\n\n\t\t_return = \"test get \" + ss.str();\n\t\tcout << _return << endl;\n\t}\n\n\tvoid remove(std::string& _return, const std::string& serviceName, const std::string& host, const int32_t port) {\n\t\t\/\/ Your implementation goes here\n\t\tprintf(\"remove\\n\");\n\t\t_return = \"test remove\";\n\t}\n\n};\n\/\/\n\/\/int main(int argc, char **argv) {\n\/\/  int port = 9090;\n\/\/  shared_ptr<RegistryProxyHandler> handler(new RegistryProxyHandler());\n\/\/  shared_ptr<TProcessor> processor(new RegistryProxyProcessor(handler));\n\/\/  shared_ptr<TServerTransport> serverTransport(new TServerSocket(port));\n\/\/  shared_ptr<TTransportFactory> transportFactory(new TBufferedTransportFactory());\n\/\/  shared_ptr<TProtocolFactory> protocolFactory(new TBinaryProtocolFactory());\n\/\/\n\/\/  TSimpleServer server(processor, serverTransport, transportFactory, protocolFactory);\n\/\/  server.serve();\n\/\/  return 0;\n\/\/}\n\/\/\n<commit_msg>make Makefile more clean<commit_after>\/\/ This autogenerated skeleton file illustrates how to build a server.\n\/\/ You should copy it to another filename to avoid overwriting it.\n#include <sstream>\n#include <iostream>   \/\/ std::cout\n#include <string>     \/\/ std::string, std::to_string\n\n#include \"RegistryProxy.h\"\n#include <protocol\/TBinaryProtocol.h>\n#include <server\/TSimpleServer.h>\n#include <transport\/TServerSocket.h>\n#include <transport\/TBufferTransports.h>\n\nusing namespace std;\nusing namespace ::apache::thrift;\nusing namespace ::apache::thrift::protocol;\nusing namespace ::apache::thrift::transport;\nusing namespace ::apache::thrift::server;\n\nusing boost::shared_ptr;\n\nusing namespace ::FinagleRegistryProxy;\n\nclass RegistryProxyHandler: virtual public RegistryProxyIf {\npublic:\n\tRegistryProxyHandler() {\n\t\t\/\/ Your initialization goes here\n\t}\n\n\tvoid get(std::string& _return, const std::string& serviceName) {\n\t\tstringstream ss;\n\t\tss << (time(0) \/ 1000);\n\n\t\t_return = \"test get \" + ss.str();\n\t\tcout << _return << endl;\n\t}\n\n\tvoid remove(std::string& _return, const std::string& serviceName, const std::string& host, const int32_t port) {\n\t\t\/\/ Your implementation goes here\n\t\tprintf(\"remove\\n\");\n\t\t_return = \"test remove\";\n\t}\n\n};\n\/\/\n\/\/int main(int argc, char **argv) {\n\/\/  int port = 9090;\n\/\/  shared_ptr<RegistryProxyHandler> handler(new RegistryProxyHandler());\n\/\/  shared_ptr<TProcessor> processor(new RegistryProxyProcessor(handler));\n\/\/  shared_ptr<TServerTransport> serverTransport(new TServerSocket(port));\n\/\/  shared_ptr<TTransportFactory> transportFactory(new TBufferedTransportFactory());\n\/\/  shared_ptr<TProtocolFactory> protocolFactory(new TBinaryProtocolFactory());\n\/\/\n\/\/  TSimpleServer server(processor, serverTransport, transportFactory, protocolFactory);\n\/\/  server.serve();\n\/\/  return 0;\n\/\/}\n\/\/\n<|endoftext|>"}
{"text":"<commit_before>#ifndef NODE_CLUTTER_ACTOR_H_\n#define NODE_CLUTTER_ACTOR_H_\n\n#include <clutter\/clutter.h>\n#include <v8.h>\n#include <node.h>\n\nnamespace clutter {\n\n\ttypedef enum {\n\t\tNODE_CLUTTER_ANIMATION_PLAY,\n\t\tNODE_CLUTTER_ANIMATION_PAUSE,\n\t\tNODE_CLUTTER_ANIMATION_STOP\n\t} NodeClutterAnimationCommand;\n\n\tstruct PropertyDefine {\n\t\tconst char *name;\n\t\tGType type;\n\t};\n\n\tclass Actor : public node::ObjectWrap {\n\tpublic:\n\t\tstatic v8::Persistent<v8::FunctionTemplate> constructor_template;\n\n\t\tstatic void Initialize(v8::Handle<v8::Object> target);\n\t\tstatic void PrototypeMethodsInit(v8::Handle<v8::FunctionTemplate> constructor_template);\n\n\t\tbool PropertyValueInit(GValue *gvalue, v8::Handle<v8::Value> property, v8::Handle<v8::Value> value);\n\n\t\tClutterActor *_actor;\n\t\tClutterAnimation *_animation;\n\n\tprotected:\n\t\tActor();\n\n\t\tstatic v8::Handle<v8::Value> New(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Destroy(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Show(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> ShowAll(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Hide(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> XGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic v8::Handle<v8::Value> YGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic v8::Handle<v8::Value> DepthGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void XSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\t\tstatic void YSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\t\tstatic void DepthSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> OpacityGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void OpacitySetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> WidthGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void WidthSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> HeightGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void HeightSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> HasClipGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void HasClipSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> ReactiveGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void ReactiveSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> Resize(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> SetPosition(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> SetDepth(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> GetDepth(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> SetAnchorFromGravity(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> Scale(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> SetScaleGravity(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> Rotate(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> Effect(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Animate(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> SetAnimate(const v8::Arguments& args);\n\t\tstatic void _AnimationCompletedCallback(ClutterAnimation *animation, gpointer user_data);\n\n\t\tstatic v8::Handle<v8::Value> On(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Off(const v8::Arguments& args);\n\n\t\tstatic void _DestroyCallback(ClutterActor *actor, gpointer user_data);\n\t\tstatic void _ClickActionCallback(ClutterClickAction *action, ClutterActor *actor, gpointer user_data);\n\t\tstatic gboolean _LongPressActionCallback(ClutterClickAction *action, ClutterActor *actor, ClutterLongPressState state, gpointer user_data);\n\t\tstatic gboolean _PressCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\t\tstatic gboolean _ReleaseCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\t\tstatic gboolean _EnterCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\t\tstatic gboolean _LeaveCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\t\tstatic gboolean _MotionCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\n\t\tstatic void _DragActionBeginCallback(ClutterClickAction *action,\n\t\t\tClutterActor *actor,\n\t\t\tgfloat event_x,\n\t\t\tgfloat event_y,\n\t\t\tClutterModifierType modifiers,\n\t\t\tgpointer user_data);\n\t\tstatic void _DragActionEndCallback(ClutterClickAction *action,\n\t\t\tClutterActor *actor,\n\t\t\tgfloat event_x,\n\t\t\tgfloat event_y,\n\t\t\tClutterModifierType modifiers,\n\t\t\tgpointer user_data);\n\t\tstatic void _DragActionMotionCallback(ClutterClickAction *action,\n\t\t\tClutterActor *actor,\n\t\t\tgfloat delta_x,\n\t\t\tgfloat delta_y,\n\t\t\tgpointer user_data);\n\t};\n\n}\n\n#endif\n<commit_msg>Remove unneccessary code<commit_after>#ifndef NODE_CLUTTER_ACTOR_H_\n#define NODE_CLUTTER_ACTOR_H_\n\n#include <clutter\/clutter.h>\n#include <v8.h>\n#include <node.h>\n\nnamespace clutter {\n\n\ttypedef enum {\n\t\tNODE_CLUTTER_ANIMATION_PLAY,\n\t\tNODE_CLUTTER_ANIMATION_PAUSE,\n\t\tNODE_CLUTTER_ANIMATION_STOP\n\t} NodeClutterAnimationCommand;\n\n\tstruct PropertyDefine {\n\t\tconst char *name;\n\t\tGType type;\n\t};\n\n\tclass Actor : public node::ObjectWrap {\n\tpublic:\n\t\tstatic v8::Persistent<v8::FunctionTemplate> constructor_template;\n\n\t\tstatic void Initialize(v8::Handle<v8::Object> target);\n\t\tstatic void PrototypeMethodsInit(v8::Handle<v8::FunctionTemplate> constructor_template);\n\n\t\tbool PropertyValueInit(GValue *gvalue, v8::Handle<v8::Value> property, v8::Handle<v8::Value> value);\n\n\t\tClutterActor *_actor;\n\t\tClutterAnimation *_animation;\n\n\tprotected:\n\t\tActor();\n\n\t\tstatic v8::Handle<v8::Value> New(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Destroy(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Show(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> ShowAll(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Hide(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> XGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic v8::Handle<v8::Value> YGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic v8::Handle<v8::Value> DepthGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void XSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\t\tstatic void YSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\t\tstatic void DepthSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> OpacityGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void OpacitySetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> WidthGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void WidthSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> HeightGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void HeightSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> HasClipGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void HasClipSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> ReactiveGetter(v8::Local<v8::String> name, const v8::AccessorInfo& info);\n\t\tstatic void ReactiveSetter(v8::Local<v8::String> name, v8::Local<v8::Value> value, const v8::AccessorInfo& info);\n\n\t\tstatic v8::Handle<v8::Value> Resize(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> SetPosition(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> SetAnchorFromGravity(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> Scale(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> SetScaleGravity(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> Rotate(const v8::Arguments& args);\n\n\t\tstatic v8::Handle<v8::Value> Effect(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Animate(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> SetAnimate(const v8::Arguments& args);\n\t\tstatic void _AnimationCompletedCallback(ClutterAnimation *animation, gpointer user_data);\n\n\t\tstatic v8::Handle<v8::Value> On(const v8::Arguments& args);\n\t\tstatic v8::Handle<v8::Value> Off(const v8::Arguments& args);\n\n\t\tstatic void _DestroyCallback(ClutterActor *actor, gpointer user_data);\n\t\tstatic void _ClickActionCallback(ClutterClickAction *action, ClutterActor *actor, gpointer user_data);\n\t\tstatic gboolean _LongPressActionCallback(ClutterClickAction *action, ClutterActor *actor, ClutterLongPressState state, gpointer user_data);\n\t\tstatic gboolean _PressCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\t\tstatic gboolean _ReleaseCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\t\tstatic gboolean _EnterCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\t\tstatic gboolean _LeaveCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\t\tstatic gboolean _MotionCallback(ClutterActor *actor, ClutterEvent *event, gpointer user_data);\n\n\t\tstatic void _DragActionBeginCallback(ClutterClickAction *action,\n\t\t\tClutterActor *actor,\n\t\t\tgfloat event_x,\n\t\t\tgfloat event_y,\n\t\t\tClutterModifierType modifiers,\n\t\t\tgpointer user_data);\n\t\tstatic void _DragActionEndCallback(ClutterClickAction *action,\n\t\t\tClutterActor *actor,\n\t\t\tgfloat event_x,\n\t\t\tgfloat event_y,\n\t\t\tClutterModifierType modifiers,\n\t\t\tgpointer user_data);\n\t\tstatic void _DragActionMotionCallback(ClutterClickAction *action,\n\t\t\tClutterActor *actor,\n\t\t\tgfloat delta_x,\n\t\t\tgfloat delta_y,\n\t\t\tgpointer user_data);\n\t};\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/-----------------------------------------------\n\/\/\n\/\/\tThis file is part of the HamFramework for Siv3D.\n\/\/\n\/\/\tCopyright (C) 2014-2017 HAMSTRO\n\/\/\n\/\/\tLicensed under the MIT License.\n\/\/\n\/\/-----------------------------------------------\n\n# pragma once\n# include <Siv3D.hpp>\n\nnamespace s3d\n{\n\tclass BasicCamera2D\n\t{\n\tprotected:\n\n\t\tVec2 m_pos = Window::BaseSize() * 0.5;\n\n\t\tdouble m_scale = 1.0;\n\n\tpublic:\n\n\t\tBasicCamera2D() = default;\n\n\t\tconstexpr BasicCamera2D(const Vec2& pos, double scale) noexcept\n\t\t\t: m_pos(pos)\n\t\t\t, m_scale(scale) {}\n\n\t\tvirtual ~BasicCamera2D() = default;\n\n\t\tvoid setPos(const Vec2& pos) noexcept\n\t\t{\n\t\t\tm_pos = pos;\n\t\t}\n\n\t\tconst Vec2& getPos() const noexcept\n\t\t{\n\t\t\treturn m_pos;\n\t\t}\n\n\t\tvoid setScale(double scale) noexcept\n\t\t{\n\t\t\tm_scale = scale;\n\t\t}\n\n\t\tdouble getScale() const noexcept\n\t\t{\n\t\t\treturn m_scale;\n\t\t}\n\n\t\tRectF getCameraArea() const\n\t\t{\n\t\t\treturn RectF(m_pos - Window::BaseSize() * 0.5 \/ m_scale, Window::BaseSize() \/ m_scale);\n\t\t}\n\n\t\tMat3x2 getMat3x2() const\n\t\t{\n\t\t\treturn Mat3x2::Scale(m_scale).translate(Window::BaseSize() * 0.5 - m_scale * m_pos);\n\t\t}\n\n\t\tTransformer2D createTransformer() const\n\t\t{\n\t\t\treturn Transformer2D(getMat3x2(), true);\n\t\t}\n\t};\n\n\tclass Camera2D : public BasicCamera2D\n\t{\n\tprivate:\n\n\t\tvoid controlWithKeyboard(double speed, double scaleRatio)\n\t\t{\n\t\t\tif (m_keyConfig[0].pressed())\n\t\t\t{\n\t\t\t\tm_targetPos.y -= (speed \/ m_targetScale);\n\t\t\t}\n\n\t\t\tif (m_keyConfig[1].pressed())\n\t\t\t{\n\t\t\t\tm_targetPos.x -= (speed \/ m_targetScale);\n\t\t\t}\n\n\t\t\tif (m_keyConfig[2].pressed())\n\t\t\t{\n\t\t\t\tm_targetPos.y += (speed \/ m_targetScale);\n\t\t\t}\n\n\t\t\tif (m_keyConfig[3].pressed())\n\t\t\t{\n\t\t\t\tm_targetPos.x += (speed \/ m_targetScale);\n\t\t\t}\n\n\t\t\tif (m_keyConfig[4].pressed())\n\t\t\t{\n\t\t\t\tm_targetScale *= scaleRatio;\n\t\t\t}\n\n\t\t\tif (m_keyConfig[5].pressed())\n\t\t\t{\n\t\t\t\tm_targetScale \/= scaleRatio;\n\t\t\t}\n\t\t}\n\n\t\tvoid controlWithMouse(bool useMouseControl, double speed, double scaleRatio, double mouseSpeedRatio)\n\t\t{\n\t\t\tif (!useMouseControl)\n\t\t\t{\n\t\t\t\tm_grabPos = none;\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst Transformer2D transformer(Mat3x2::Identity(), Cursor::GetTransform().inversed());\n\n\t\t\t\tif (MouseR.down())\n\t\t\t\t{\n\t\t\t\t\tm_grabPos = Cursor::Pos();\n\t\t\t\t}\n\t\t\t\telse if (m_grabPos)\n\t\t\t\t{\n\t\t\t\t\tconst Point delta = Cursor::Pos() - m_grabPos.value();\n\n\t\t\t\t\tm_targetPos += mouseSpeedRatio * speed * delta \/ m_targetScale;\n\n\t\t\t\t\tif (MouseR.up())\n\t\t\t\t\t{\n\t\t\t\t\t\tm_grabPos = none;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst double wheel = Mouse::Wheel();\n\n\t\t\tif (wheel < 0.0)\n\t\t\t{\n\t\t\t\tm_targetScale *= scaleRatio;\n\t\t\t}\n\t\t\telse if (wheel > 0.0)\n\t\t\t{\n\t\t\t\tm_targetScale \/= scaleRatio;\n\t\t\t}\n\t\t}\n\n\tprotected:\n\n\t\tVec2 m_targetPos = BasicCamera2D::m_pos;\n\n\t\tdouble m_targetScale = BasicCamera2D::m_scale;\n\n\t\tstd::array<Key, 6> m_keyConfig =\n\t\t{\n\t\t\t{ KeyW, KeyA, KeyS, KeyD, KeyUp, KeyDown }\n\t\t};\n\n\t\tOptional<Point> m_grabPos;\n\n\tpublic:\n\n\t\tCamera2D() = default;\n\n\t\tCamera2D(const Vec2& pos, double scale)\n\t\t\t: BasicCamera2D(pos, scale)\n\t\t\t, m_targetPos(pos)\n\t\t\t, m_targetScale(scale)\n\t\t{\n\n\t\t}\n\n\t\tvirtual ~Camera2D() {}\n\n\t\tvoid update(double speed = 10.0, double scaleRatio = 1.1, double mouseSpeedRatio = 0.01, double lerpRatio = 0.2, bool useKeyControl = true, bool useMouseControl = true)\n\t\t{\n\t\t\tif (useKeyControl)\n\t\t\t{\n\t\t\t\tcontrolWithKeyboard(speed, scaleRatio);\n\t\t\t}\n\n\t\t\tif (useMouseControl)\n\t\t\t{\n\t\t\t\tcontrolWithMouse(useMouseControl, speed, scaleRatio, mouseSpeedRatio);\n\t\t\t}\n\n\t\t\tm_pos = Math::Lerp(m_pos, m_targetPos, lerpRatio);\n\n\t\t\tm_scale = Math::Lerp(m_scale, m_targetScale, lerpRatio);\n\t\t}\n\n\t\tvoid draw(const ColorF& color = Palette::White) const\n\t\t{\n\t\t\tif (!m_grabPos)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst Transformer2D transformer(Graphics2D::GetTransform().inversed(), true);\n\n\t\t\tconst double radius = 12.0;\n\t\t\tconst Point delta = Cursor::Pos() - m_grabPos.value();\n\t\t\tconst double length = delta.length();\n\n\t\t\tCircle(m_grabPos.value(), radius).drawFrame(2.0, 2.0, color);\n\n\t\t\tif (length >= radius * 2)\n\t\t\t{\n\t\t\t\tconst Vec2 direction = delta \/ length;\n\t\t\t\tconst Vec2 normalDirection{ direction.y, -direction.x };\n\t\t\t\tconst Vec2 leftOffset = normalDirection * 10;\n\n\t\t\t\tconst Vec2 p0 = delta;\n\t\t\t\tconst Vec2 p1 = Vec2(direction).setLength(radius * 1.2) - leftOffset;\n\t\t\t\tconst Vec2 p2 = Vec2(direction).setLength(radius * 1.8);\n\t\t\t\tconst Vec2 p3 = Vec2(direction).setLength(radius * 1.2) + leftOffset;\n\n\t\t\t\tQuad(p1, p2, p3, p0).moveBy(m_grabPos.value()).draw(color);\n\t\t\t}\n\t\t}\n\n\t\tvoid setKeyConfig(const std::array<Key, 6>& keys)\n\t\t{\n\t\t\tm_keyConfig = keys;\n\t\t}\n\n\t\tvoid setTargetPos(const Vec2& targetPos)\n\t\t{\n\t\t\tm_targetPos = targetPos;\n\t\t}\n\n\t\tvoid setTargetScale(const double targetScale)\n\t\t{\n\t\t\tm_targetScale = targetScale;\n\t\t}\n\t};\n}\n\n\/* example\n\n\n*\/\n<commit_msg>Update Camera2D.hpp<commit_after>\/\/-----------------------------------------------\n\/\/\n\/\/\tThis file is part of the HamFramework for Siv3D.\n\/\/\n\/\/\tCopyright (C) 2014-2017 HAMSTRO\n\/\/\n\/\/\tLicensed under the MIT License.\n\/\/\n\/\/-----------------------------------------------\n\n# pragma once\n# include <Siv3D.hpp>\n\nnamespace s3d\n{\n\tclass BasicCamera2D\n\t{\n\tprotected:\n\n\t\tVec2 m_pos = Window::BaseSize() * 0.5;\n\n\t\tdouble m_scale = 1.0;\n\n\tpublic:\n\n\t\tBasicCamera2D() = default;\n\n\t\tconstexpr BasicCamera2D(const Vec2& pos, double scale) noexcept\n\t\t\t: m_pos(pos)\n\t\t\t, m_scale(scale) {}\n\n\t\tvirtual ~BasicCamera2D() = default;\n\n\t\tvoid setPos(const Vec2& pos) noexcept\n\t\t{\n\t\t\tm_pos = pos;\n\t\t}\n\n\t\tconst Vec2& getPos() const noexcept\n\t\t{\n\t\t\treturn m_pos;\n\t\t}\n\n\t\tvoid setScale(double scale) noexcept\n\t\t{\n\t\t\tm_scale = scale;\n\t\t}\n\n\t\tdouble getScale() const noexcept\n\t\t{\n\t\t\treturn m_scale;\n\t\t}\n\n\t\tRectF getCameraArea() const\n\t\t{\n\t\t\treturn RectF(m_pos - Window::BaseSize() * 0.5 \/ m_scale, Window::BaseSize() \/ m_scale);\n\t\t}\n\n\t\tMat3x2 getMat3x2() const\n\t\t{\n\t\t\treturn Mat3x2::Scale(m_scale).translated(Window::BaseSize() * 0.5 - m_scale * m_pos);\n\t\t}\n\n\t\tTransformer2D createTransformer() const\n\t\t{\n\t\t\treturn Transformer2D(getMat3x2(), true);\n\t\t}\n\t};\n\n\tclass Camera2D : public BasicCamera2D\n\t{\n\tprivate:\n\n\t\tbool m_keyControlEnabled = true;\n\n\t\tbool m_mouseControlEnabled = true;\n\n\t\tdouble m_speed = 10.0;\n\n\t\tdouble m_scaleRatio = 1.1;\n\n\t\tdouble m_mouseSpeedRatio = 0.01;\n\n\t\tdouble m_lerpRatio = 0.2;\n\n\t\tvoid controlWithKeyboard()\n\t\t{\n\t\t\tif (!m_keyControlEnabled)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (m_controls[0]())\n\t\t\t{\n\t\t\t\tm_targetPos.y -= (m_speed \/ m_targetScale);\n\t\t\t}\n\n\t\t\tif (m_controls[1]())\n\t\t\t{\n\t\t\t\tm_targetPos.x -= (m_speed \/ m_targetScale);\n\t\t\t}\n\n\t\t\tif (m_controls[2]())\n\t\t\t{\n\t\t\t\tm_targetPos.y += (m_speed \/ m_targetScale);\n\t\t\t}\n\n\t\t\tif (m_controls[3]())\n\t\t\t{\n\t\t\t\tm_targetPos.x += (m_speed \/ m_targetScale);\n\t\t\t}\n\n\t\t\tif (m_controls[4]())\n\t\t\t{\n\t\t\t\tm_targetScale *= m_scaleRatio;\n\t\t\t}\n\n\t\t\tif (m_controls[5]())\n\t\t\t{\n\t\t\t\tm_targetScale \/= m_scaleRatio;\n\t\t\t}\n\t\t}\n\n\t\tvoid controlWithMouse()\n\t\t{\n\t\t\tif (!m_mouseControlEnabled)\n\t\t\t{\n\t\t\t\tm_grabPos = none;\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst Transformer2D transformer(Mat3x2::Identity(), Cursor::GetTransform().inversed());\n\n\t\t\t\tif (MouseR.down())\n\t\t\t\t{\n\t\t\t\t\tm_grabPos = Cursor::Pos();\n\t\t\t\t}\n\t\t\t\telse if (m_grabPos)\n\t\t\t\t{\n\t\t\t\t\tconst Point delta = Cursor::Pos() - m_grabPos.value();\n\n\t\t\t\t\tm_targetPos += m_mouseSpeedRatio * m_speed * delta \/ m_targetScale;\n\n\t\t\t\t\tif (MouseR.up())\n\t\t\t\t\t{\n\t\t\t\t\t\tm_grabPos = none;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst double wheel = Mouse::Wheel();\n\n\t\t\tif (wheel < 0.0)\n\t\t\t{\n\t\t\t\tm_targetScale *= m_scaleRatio;\n\t\t\t}\n\t\t\telse if (wheel > 0.0)\n\t\t\t{\n\t\t\t\tm_targetScale \/= m_scaleRatio;\n\t\t\t}\n\t\t}\n\n\tprotected:\n\n\t\tVec2 m_targetPos = BasicCamera2D::m_pos;\n\n\t\tdouble m_targetScale = BasicCamera2D::m_scale;\n\n\t\tstd::array<std::function<bool()>, 6> m_controls =\n\t\t{{ [](){ return KeyW.pressed(); }\n\t\t,  [](){ return KeyA.pressed(); }\n\t\t,  [](){ return KeyS.pressed(); }\n\t\t,  [](){ return KeyD.pressed(); }\n\t\t,  [](){ return KeyUp.pressed(); }\n\t\t,  [](){ return KeyDown.pressed(); }}};\n\n\t\tOptional<Point> m_grabPos;\n\n\tpublic:\n\n\t\tCamera2D() = default;\n\n\n\t\tCamera2D(const Vec2& pos, double scale, bool keyControlEnabled = true, bool mouseControlEnabled = true, double speed = 10.0, double scaleRatio = 1.1, double lerpRatio = 0.2)\n\t\t\t: BasicCamera2D(pos, scale)\n\t\t\t, m_targetPos(pos)\n\t\t\t, m_targetScale(scale)\n\t\t\t, m_keyControlEnabled(keyControlEnabled)\n\t\t\t, m_mouseControlEnabled(mouseControlEnabled)\n\t\t\t, m_speed(speed)\n\t\t\t, m_scaleRatio(scaleRatio)\n\t\t\t, m_lerpRatio(lerpRatio)\n\t\t{\n\n\t\t}\n\n\t\tvirtual ~Camera2D() = default;\n\n\n\t\tvoid update()\n\t\t{\n\t\t\tcontrolWithKeyboard();\n\n\t\t\tcontrolWithMouse();\n\n\t\t\tm_pos = Math::Lerp(m_pos, m_targetPos, m_lerpRatio);\n\n\t\t\tm_scale = Math::Lerp(m_scale, m_targetScale, m_lerpRatio);\n\t\t}\n\n\t\tvoid draw(const ColorF& color = Palette::White) const\n\t\t{\n\t\t\tif (!m_grabPos)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst Transformer2D transformer(Graphics2D::GetTransform().inversed(), true);\n\n\t\t\tconst double radius = 12.0;\n\t\t\tconst Point delta = Cursor::Pos() - m_grabPos.value();\n\t\t\tconst double length = delta.length();\n\n\t\t\tCircle(m_grabPos.value(), radius).drawFrame(2.0, 2.0, color);\n\n\t\t\tif (length >= radius * 2)\n\t\t\t{\n\t\t\t\tconst Vec2 direction = delta \/ length;\n\t\t\t\tconst Vec2 normalDirection{ direction.y, -direction.x };\n\t\t\t\tconst Vec2 leftOffset = normalDirection * 10;\n\n\t\t\t\tconst Vec2 p0 = delta;\n\t\t\t\tconst Vec2 p1 = Vec2(direction).setLength(radius * 1.2) - leftOffset;\n\t\t\t\tconst Vec2 p2 = Vec2(direction).setLength(radius * 1.8);\n\t\t\t\tconst Vec2 p3 = Vec2(direction).setLength(radius * 1.2) + leftOffset;\n\n\t\t\t\tQuad(p1, p2, p3, p0).moveBy(m_grabPos.value()).draw(color);\n\t\t\t}\n\t\t}\n\n\t\tvoid setControls(const std::array<std::function<bool()>, 6>& controls)\n\t\t{\n\t\t\tm_controls = controls;\n\t\t}\n\n\t\tvoid setTargetPos(const Vec2& targetPos) noexcept\n\t\t{\n\t\t\tm_targetPos = targetPos;\n\t\t}\n\n\t\tvoid setTargetScale(double targetScale) noexcept\n\t\t{\n\t\t\tm_targetScale = targetScale;\n\t\t}\n\n\t\tvoid setSpeed(double speed) noexcept\n\t\t{\n\t\t\tm_speed = speed;\n\t\t}\n\n\t\tdouble getSpeed() const noexcept\n\t\t{\n\t\t\treturn m_speed;\n\t\t}\n\n\t\tvoid setScaleRatio(double scaleRatio) noexcept\n\t\t{\n\t\t\tm_scaleRatio = scaleRatio;\n\t\t}\n\n\t\tdouble getScaleRatio() const noexcept\n\t\t{\n\t\t\treturn m_scaleRatio;\n\t\t}\n\n\t\tvoid setMouseSpeedRatio(double mouseSpeedRatio) noexcept\n\t\t{\n\t\t\tm_mouseSpeedRatio = mouseSpeedRatio;\n\t\t}\n\n\t\tdouble getMouseSpeedRatio() const noexcept\n\t\t{\n\t\t\treturn m_mouseSpeedRatio;\n\t\t}\n\n\t\tvoid setLerpRatio(double lerpRatio) noexcept\n\t\t{\n\t\t\tm_lerpRatio = lerpRatio;\n\t\t}\n\n\t\tdouble getLerpRatio() const noexcept\n\t\t{\n\t\t\treturn m_lerpRatio;\n\t\t}\n\n\t\tvoid enableKeyControl(bool enable) noexcept\n\t\t{\n\t\t\tm_keyControlEnabled = enable;\n\t\t}\n\n\t\tbool keyControlEnabled() const noexcept\n\t\t{\n\t\t\treturn m_keyControlEnabled;\n\t\t}\n\n\t\tvoid enableMouseControl(bool enable) noexcept\n\t\t{\n\t\t\tm_mouseControlEnabled = enable;\n\t\t}\n\n\t\tbool mouseControlEnabled() const noexcept\n\t\t{\n\t\t\treturn m_mouseControlEnabled;\n\t\t}\n\t};\n}\n\n\/* example\n\n\n*\/\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/* KeynoteImportFilter: Sets up the filter, and calls OdpExporter\n * to do the actual filtering\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 <boost\/shared_ptr.hpp>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n#include <com\/sun\/star\/container\/XChild.hpp>\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/ucb\/XCommandEnvironment.hpp>\n#include <com\/sun\/star\/ucb\/XContent.hpp>\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#include <com\/sun\/star\/xml\/sax\/InputSource.hpp>\n#include <com\/sun\/star\/xml\/sax\/XParser.hpp>\n#include <com\/sun\/star\/io\/XSeekable.hpp>\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <comphelper\/processfactory.hxx>\n#include <comphelper\/types.hxx>\n#include <cppuhelper\/supportsservice.hxx>\n#include <iostream>\n#include <libetonyek\/libetonyek.h>\n#include <libodfgen\/libodfgen.hxx>\n#include <osl\/diagnose.h>\n#include <rtl\/tencinfo.h>\n#include <ucbhelper\/content.hxx>\n\n#include <writerperfect\/DirectoryStream.hxx>\n#include <writerperfect\/DocumentHandler.hxx>\n#include <writerperfect\/WPXSvInputStream.hxx>\n\n#include <xmloff\/attrlist.hxx>\n\n#include \"KeynoteImportFilter.hxx\"\n\nusing boost::shared_ptr;\n\nusing namespace ::com::sun::star::uno;\nusing com::sun::star::uno::Reference;\nusing com::sun::star::io::XInputStream;\nusing com::sun::star::io::XSeekable;\nusing com::sun::star::uno::Sequence;\nusing com::sun::star::uno::Any;\nusing com::sun::star::uno::UNO_QUERY;\nusing com::sun::star::uno::XInterface;\nusing com::sun::star::uno::Exception;\nusing com::sun::star::uno::RuntimeException;\nusing com::sun::star::beans::PropertyValue;\nusing com::sun::star::document::XFilter;\nusing com::sun::star::document::XExtendedFilterDetection;\nusing com::sun::star::document::XImporter;\nusing com::sun::star::xml::sax::InputSource;\nusing com::sun::star::xml::sax::XAttributeList;\nusing com::sun::star::xml::sax::XDocumentHandler;\nusing com::sun::star::xml::sax::XParser;\n\nusing writerperfect::DocumentHandler;\nusing writerperfect::WPXSvInputStream;\n\nnamespace beans = com::sun::star::beans;\nnamespace container = com::sun::star::container;\nnamespace ucb = com::sun::star::ucb;\n\nnamespace\n{\n\ntemplate<class T>\nbool lcl_queryIsPackage( const Sequence<T> &lComponentData )\n{\n    bool bIsPackage = false;\n\n    const sal_Int32 nLength = lComponentData.getLength();\n    const T *pValue = lComponentData.getConstArray();\n    for ( sal_Int32 i = 0; i < nLength; ++i)\n    {\n        if ( pValue[i].Name == \"IsPackage\" )\n        {\n            pValue[i].Value >>= bIsPackage;\n            break;\n        }\n    }\n\n    return bIsPackage;\n}\n\nbool lcl_isPackage( const Any &rComponentData )\n{\n    Sequence < beans::NamedValue > lComponentDataNV;\n    Sequence < beans::PropertyValue > lComponentDataPV;\n\n    if ( rComponentData >>= lComponentDataNV )\n        return lcl_queryIsPackage( lComponentDataNV );\n    else if ( rComponentData >>= lComponentDataPV )\n        return lcl_queryIsPackage( lComponentDataPV );\n\n    return false;\n}\n}\n\nsal_Bool SAL_CALL KeynoteImportFilter::filter( const Sequence< ::com::sun::star::beans::PropertyValue >& aDescriptor )\nthrow (RuntimeException, std::exception)\n{\n    sal_Int32 nLength = aDescriptor.getLength();\n    const PropertyValue *pValue = aDescriptor.getConstArray();\n    Reference < XInputStream > xInputStream;\n    Reference < ucb::XContent > xContent;\n    bool bIsPackage = false;\n    for ( sal_Int32 i = 0 ; i < nLength; i++)\n    {\n        if ( pValue[i].Name == \"ComponentData\" )\n            bIsPackage = lcl_isPackage( pValue[i].Value );\n        else if ( pValue[i].Name == \"InputStream\" )\n            pValue[i].Value >>= xInputStream;\n        else if ( pValue[i].Name == \"UCBContent\" )\n            pValue[i].Value >>= xContent;\n    }\n    if ( !xInputStream.is() )\n    {\n        OSL_ASSERT( false );\n        return sal_False;\n    }\n\n    if ( bIsPackage && !xContent.is() )\n    {\n        SAL_WARN(\"writerperfect\", \"the input claims to be a package, but does not have UCBContent\");\n        bIsPackage = false;\n    }\n\n    \/\/ An XML import service: what we push sax messages to..\n    Reference < XDocumentHandler > xInternalHandler(\n        mxContext->getServiceManager()->createInstanceWithContext(\n            \"com.sun.star.comp.Draw.XMLOasisImporter\", mxContext),\n        css::uno::UNO_QUERY_THROW);\n\n    \/\/ The XImporter sets up an empty target document for XDocumentHandler to write to..\n    Reference < XImporter > xImporter(xInternalHandler, UNO_QUERY);\n    xImporter->setTargetDocument( mxDoc );\n\n    \/\/ OO Graphics Handler: abstract class to handle document SAX messages, concrete implementation here\n    \/\/ writes to in-memory target doc\n    DocumentHandler xHandler(xInternalHandler);\n\n    shared_ptr< librevenge::RVNGInputStream > input;\n    if ( bIsPackage )\n        input.reset( new writerperfect::DirectoryStream( xContent ) );\n    else\n        input.reset( new WPXSvInputStream( xInputStream ) );\n\n    OdpGenerator exporter;\n    exporter.addDocumentHandler(&xHandler, ODF_FLAT_XML);\n    bool tmpParseResult = libetonyek::EtonyekDocument::parse(input.get(), &exporter);\n    return tmpParseResult;\n}\n\nvoid SAL_CALL KeynoteImportFilter::cancel(  )\nthrow (RuntimeException, std::exception)\n{\n}\n\n\/\/ XImporter\nvoid SAL_CALL KeynoteImportFilter::setTargetDocument( const Reference< ::com::sun::star::lang::XComponent >& xDoc )\nthrow (::com::sun::star::lang::IllegalArgumentException, RuntimeException, std::exception)\n{\n    mxDoc = xDoc;\n}\n\n\/\/ XExtendedFilterDetection\nOUString SAL_CALL KeynoteImportFilter::detect( com::sun::star::uno::Sequence< PropertyValue >& Descriptor )\nthrow( com::sun::star::uno::RuntimeException, std::exception )\n{\n    sal_Int32 nLength = Descriptor.getLength();\n    sal_Int32 nNewLength = nLength + 2;\n    sal_Int32 nComponentDataLocation = -1;\n    sal_Int32 nTypeNameLocation = -1;\n    sal_Int32 nUCBContentLocation = -1;\n    bool bIsPackage = false;\n    bool bUCBContentChanged = false;\n    const PropertyValue *pValue = Descriptor.getConstArray();\n    Reference < XInputStream > xInputStream;\n    Reference < ucb::XContent > xContent;\n    Sequence < beans::NamedValue > lComponentDataNV;\n    Sequence < beans::PropertyValue > lComponentDataPV;\n    bool bComponentDataNV = true;\n\n    for ( sal_Int32 i = 0 ; i < nLength; i++)\n    {\n        if ( pValue[i].Name == \"TypeName\" )\n        {\n            nTypeNameLocation = i;\n            --nNewLength;\n        }\n        if ( pValue[i].Name == \"ComponentData\" )\n        {\n            bComponentDataNV = pValue[i].Value >>= lComponentDataNV;\n            if (!bComponentDataNV)\n                pValue[i].Value >>= lComponentDataPV;\n            nComponentDataLocation = i;\n            --nNewLength;\n        }\n        else if ( pValue[i].Name == \"InputStream\" )\n        {\n            pValue[i].Value >>= xInputStream;\n        }\n        else if ( pValue[i].Name == \"UCBContent\" )\n        {\n            pValue[i].Value >>= xContent;\n            nUCBContentLocation = i;\n        }\n    }\n\n    assert(nNewLength >= nLength);\n\n    if (!xInputStream.is())\n        return OUString();\n\n    shared_ptr< librevenge::RVNGInputStream > input( new WPXSvInputStream( xInputStream ) );\n\n    \/* Apple Keynote documents come in two variants:\n     * * actual files (zip), only produced by Keynote 5 (at least with\n     *   default settings)\n     * * packages (IOW, directories), produced by Keynote 1-4 and again\n     *   starting with 6.\n     * But since the libetonyek import only works with a stream, we need\n     * to pass it one for the whole package. Here we determine if that\n     * is needed.\n     *\n     * Note: for convenience, we also recognize that the main XML file\n     * from a package was passed and pass the whole package to the\n     * filter instead.\n     *\/\n    if ( xContent.is() )\n    {\n        ucbhelper::Content aContent( xContent, Reference< ucb::XCommandEnvironment >(), comphelper::getProcessComponentContext() );\n        try\n        {\n            if ( aContent.isFolder() )\n            {\n                input.reset( new writerperfect::DirectoryStream( xContent ) );\n                bIsPackage = true;\n            }\n        }\n        catch (...)\n        {\n            return OUString();\n        }\n\n        libetonyek::EtonyekDocument::Type type = libetonyek::EtonyekDocument::TYPE_UNKNOWN;\n        const libetonyek::EtonyekDocument::Confidence confidence = libetonyek::EtonyekDocument::isSupported( input.get(), &type );\n        if ((libetonyek::EtonyekDocument::CONFIDENCE_NONE == confidence) || (libetonyek::EtonyekDocument::TYPE_KEYNOTE != type))\n            return OUString();\n\n        if ( confidence == libetonyek::EtonyekDocument::CONFIDENCE_SUPPORTED_PART )\n        {\n            assert( !bIsPackage );\n\n            const Reference < container::XChild > xChild( xContent, UNO_QUERY );\n            if ( xChild.is() )\n            {\n                const Reference < ucb::XContent > xPackageContent( xChild->getParent(), UNO_QUERY );\n                if ( xPackageContent.is() )\n                {\n                    input.reset( new writerperfect::DirectoryStream( xPackageContent ) );\n                    if ( libetonyek::EtonyekDocument::CONFIDENCE_EXCELLENT == libetonyek::EtonyekDocument::isSupported( input.get() ) )\n                    {\n                        xContent = xPackageContent;\n                        bUCBContentChanged = true;\n                        bIsPackage = true;\n                    }\n                }\n            }\n        }\n    }\n\n    \/\/ we do not need to insert ComponentData if this is not a package\n    if ( !bIsPackage && ( nComponentDataLocation == -1 ) )\n        --nNewLength;\n\n    if ( nNewLength > nLength )\n        Descriptor.realloc( nNewLength );\n\n    if ( nTypeNameLocation == -1 )\n    {\n        assert( nLength < nNewLength );\n        nTypeNameLocation = nLength++;\n        Descriptor[nTypeNameLocation].Name = \"TypeName\";\n    }\n\n    if ( bIsPackage && ( nComponentDataLocation == -1 ) )\n    {\n        assert( nLength < nNewLength );\n        nComponentDataLocation = nLength++;\n        Descriptor[nComponentDataLocation].Name = \"ComponentData\";\n    }\n\n    if ( bIsPackage )\n    {\n        if (bComponentDataNV)\n        {\n            const sal_Int32 nCDSize = lComponentDataNV.getLength();\n            lComponentDataNV.realloc( nCDSize + 1 );\n            beans::NamedValue aValue;\n            aValue.Name = \"IsPackage\";\n            aValue.Value = comphelper::makeBoolAny(true);\n            lComponentDataNV[nCDSize] = aValue;\n            Descriptor[nComponentDataLocation].Value <<= lComponentDataNV;\n        }\n        else\n        {\n            const sal_Int32 nCDSize = lComponentDataPV.getLength();\n            lComponentDataPV.realloc( nCDSize + 1 );\n            beans::PropertyValue aProp;\n            aProp.Name = \"IsPackage\";\n            aProp.Value = comphelper::makeBoolAny(true);\n            aProp.Handle = -1;\n            aProp.State = beans::PropertyState_DIRECT_VALUE;\n            lComponentDataPV[nCDSize] = aProp;\n            Descriptor[nComponentDataLocation].Value <<= lComponentDataPV;\n        }\n    }\n\n    if ( bUCBContentChanged )\n        Descriptor[nUCBContentLocation].Value <<= xContent;\n\n    const OUString sTypeName(\"impress_AppleKeynote\");\n    Descriptor[nTypeNameLocation].Value <<= sTypeName;\n\n    return sTypeName;\n}\n\n\/\/ XInitialization\nvoid SAL_CALL KeynoteImportFilter::initialize( const Sequence< Any >& aArguments )\nthrow (Exception, RuntimeException, std::exception)\n{\n    Sequence < PropertyValue > aAnySeq;\n    sal_Int32 nLength = aArguments.getLength();\n    if ( nLength && ( aArguments[0] >>= aAnySeq ) )\n    {\n        const PropertyValue *pValue = aAnySeq.getConstArray();\n        nLength = aAnySeq.getLength();\n        for ( sal_Int32 i = 0 ; i < nLength; i++)\n        {\n            if ( pValue[i].Name == \"Type\" )\n            {\n                pValue[i].Value >>= msFilterName;\n                break;\n            }\n        }\n    }\n}\n\nOUString KeynoteImportFilter_getImplementationName ()\nthrow (RuntimeException)\n{\n    return OUString ( \"org.libreoffice.comp.Impress.KeynoteImportFilter\" );\n}\n\n#define SERVICE_NAME1 \"com.sun.star.document.ImportFilter\"\n#define SERVICE_NAME2 \"com.sun.star.document.ExtendedTypeDetection\"\n\nSequence< OUString > SAL_CALL KeynoteImportFilter_getSupportedServiceNames(  )\nthrow (RuntimeException)\n{\n    Sequence < OUString > aRet(2);\n    OUString *pArray = aRet.getArray();\n    pArray[0] =  OUString ( SERVICE_NAME1 );\n    pArray[1] =  OUString ( SERVICE_NAME2 );\n    return aRet;\n}\n\n#undef SERVICE_NAME2\n#undef SERVICE_NAME1\n\nReference< XInterface > SAL_CALL KeynoteImportFilter_createInstance( const Reference< XComponentContext > & rContext)\nthrow( Exception )\n{\n    return (cppu::OWeakObject *) new KeynoteImportFilter( rContext );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL KeynoteImportFilter::getImplementationName(  )\nthrow (RuntimeException, std::exception)\n{\n    return KeynoteImportFilter_getImplementationName();\n}\n\nsal_Bool SAL_CALL KeynoteImportFilter::supportsService( const OUString &rServiceName )\nthrow (RuntimeException, std::exception)\n{\n    return cppu::supportsService(this, rServiceName);\n}\n\nSequence< OUString > SAL_CALL KeynoteImportFilter::getSupportedServiceNames(  )\nthrow (RuntimeException, std::exception)\n{\n    return KeynoteImportFilter_getSupportedServiceNames();\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>use the right XML import service<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/* KeynoteImportFilter: Sets up the filter, and calls OdpExporter\n * to do the actual filtering\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 <boost\/shared_ptr.hpp>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n#include <com\/sun\/star\/container\/XChild.hpp>\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/ucb\/XCommandEnvironment.hpp>\n#include <com\/sun\/star\/ucb\/XContent.hpp>\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#include <com\/sun\/star\/xml\/sax\/InputSource.hpp>\n#include <com\/sun\/star\/xml\/sax\/XParser.hpp>\n#include <com\/sun\/star\/io\/XSeekable.hpp>\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <comphelper\/processfactory.hxx>\n#include <comphelper\/types.hxx>\n#include <cppuhelper\/supportsservice.hxx>\n#include <iostream>\n#include <libetonyek\/libetonyek.h>\n#include <libodfgen\/libodfgen.hxx>\n#include <osl\/diagnose.h>\n#include <rtl\/tencinfo.h>\n#include <ucbhelper\/content.hxx>\n\n#include <writerperfect\/DirectoryStream.hxx>\n#include <writerperfect\/DocumentHandler.hxx>\n#include <writerperfect\/WPXSvInputStream.hxx>\n\n#include <xmloff\/attrlist.hxx>\n\n#include \"KeynoteImportFilter.hxx\"\n\nusing boost::shared_ptr;\n\nusing namespace ::com::sun::star::uno;\nusing com::sun::star::uno::Reference;\nusing com::sun::star::io::XInputStream;\nusing com::sun::star::io::XSeekable;\nusing com::sun::star::uno::Sequence;\nusing com::sun::star::uno::Any;\nusing com::sun::star::uno::UNO_QUERY;\nusing com::sun::star::uno::XInterface;\nusing com::sun::star::uno::Exception;\nusing com::sun::star::uno::RuntimeException;\nusing com::sun::star::beans::PropertyValue;\nusing com::sun::star::document::XFilter;\nusing com::sun::star::document::XExtendedFilterDetection;\nusing com::sun::star::document::XImporter;\nusing com::sun::star::xml::sax::InputSource;\nusing com::sun::star::xml::sax::XAttributeList;\nusing com::sun::star::xml::sax::XDocumentHandler;\nusing com::sun::star::xml::sax::XParser;\n\nusing writerperfect::DocumentHandler;\nusing writerperfect::WPXSvInputStream;\n\nnamespace beans = com::sun::star::beans;\nnamespace container = com::sun::star::container;\nnamespace ucb = com::sun::star::ucb;\n\nnamespace\n{\n\ntemplate<class T>\nbool lcl_queryIsPackage( const Sequence<T> &lComponentData )\n{\n    bool bIsPackage = false;\n\n    const sal_Int32 nLength = lComponentData.getLength();\n    const T *pValue = lComponentData.getConstArray();\n    for ( sal_Int32 i = 0; i < nLength; ++i)\n    {\n        if ( pValue[i].Name == \"IsPackage\" )\n        {\n            pValue[i].Value >>= bIsPackage;\n            break;\n        }\n    }\n\n    return bIsPackage;\n}\n\nbool lcl_isPackage( const Any &rComponentData )\n{\n    Sequence < beans::NamedValue > lComponentDataNV;\n    Sequence < beans::PropertyValue > lComponentDataPV;\n\n    if ( rComponentData >>= lComponentDataNV )\n        return lcl_queryIsPackage( lComponentDataNV );\n    else if ( rComponentData >>= lComponentDataPV )\n        return lcl_queryIsPackage( lComponentDataPV );\n\n    return false;\n}\n}\n\nsal_Bool SAL_CALL KeynoteImportFilter::filter( const Sequence< ::com::sun::star::beans::PropertyValue >& aDescriptor )\nthrow (RuntimeException, std::exception)\n{\n    sal_Int32 nLength = aDescriptor.getLength();\n    const PropertyValue *pValue = aDescriptor.getConstArray();\n    Reference < XInputStream > xInputStream;\n    Reference < ucb::XContent > xContent;\n    bool bIsPackage = false;\n    for ( sal_Int32 i = 0 ; i < nLength; i++)\n    {\n        if ( pValue[i].Name == \"ComponentData\" )\n            bIsPackage = lcl_isPackage( pValue[i].Value );\n        else if ( pValue[i].Name == \"InputStream\" )\n            pValue[i].Value >>= xInputStream;\n        else if ( pValue[i].Name == \"UCBContent\" )\n            pValue[i].Value >>= xContent;\n    }\n    if ( !xInputStream.is() )\n    {\n        OSL_ASSERT( false );\n        return sal_False;\n    }\n\n    if ( bIsPackage && !xContent.is() )\n    {\n        SAL_WARN(\"writerperfect\", \"the input claims to be a package, but does not have UCBContent\");\n        bIsPackage = false;\n    }\n\n    \/\/ An XML import service: what we push sax messages to..\n    Reference < XDocumentHandler > xInternalHandler(\n        mxContext->getServiceManager()->createInstanceWithContext(\n            \"com.sun.star.comp.Impress.XMLOasisImporter\", mxContext),\n        css::uno::UNO_QUERY_THROW);\n\n    \/\/ The XImporter sets up an empty target document for XDocumentHandler to write to..\n    Reference < XImporter > xImporter(xInternalHandler, UNO_QUERY);\n    xImporter->setTargetDocument( mxDoc );\n\n    \/\/ OO Graphics Handler: abstract class to handle document SAX messages, concrete implementation here\n    \/\/ writes to in-memory target doc\n    DocumentHandler xHandler(xInternalHandler);\n\n    shared_ptr< librevenge::RVNGInputStream > input;\n    if ( bIsPackage )\n        input.reset( new writerperfect::DirectoryStream( xContent ) );\n    else\n        input.reset( new WPXSvInputStream( xInputStream ) );\n\n    OdpGenerator exporter;\n    exporter.addDocumentHandler(&xHandler, ODF_FLAT_XML);\n    bool tmpParseResult = libetonyek::EtonyekDocument::parse(input.get(), &exporter);\n    return tmpParseResult;\n}\n\nvoid SAL_CALL KeynoteImportFilter::cancel(  )\nthrow (RuntimeException, std::exception)\n{\n}\n\n\/\/ XImporter\nvoid SAL_CALL KeynoteImportFilter::setTargetDocument( const Reference< ::com::sun::star::lang::XComponent >& xDoc )\nthrow (::com::sun::star::lang::IllegalArgumentException, RuntimeException, std::exception)\n{\n    mxDoc = xDoc;\n}\n\n\/\/ XExtendedFilterDetection\nOUString SAL_CALL KeynoteImportFilter::detect( com::sun::star::uno::Sequence< PropertyValue >& Descriptor )\nthrow( com::sun::star::uno::RuntimeException, std::exception )\n{\n    sal_Int32 nLength = Descriptor.getLength();\n    sal_Int32 nNewLength = nLength + 2;\n    sal_Int32 nComponentDataLocation = -1;\n    sal_Int32 nTypeNameLocation = -1;\n    sal_Int32 nUCBContentLocation = -1;\n    bool bIsPackage = false;\n    bool bUCBContentChanged = false;\n    const PropertyValue *pValue = Descriptor.getConstArray();\n    Reference < XInputStream > xInputStream;\n    Reference < ucb::XContent > xContent;\n    Sequence < beans::NamedValue > lComponentDataNV;\n    Sequence < beans::PropertyValue > lComponentDataPV;\n    bool bComponentDataNV = true;\n\n    for ( sal_Int32 i = 0 ; i < nLength; i++)\n    {\n        if ( pValue[i].Name == \"TypeName\" )\n        {\n            nTypeNameLocation = i;\n            --nNewLength;\n        }\n        if ( pValue[i].Name == \"ComponentData\" )\n        {\n            bComponentDataNV = pValue[i].Value >>= lComponentDataNV;\n            if (!bComponentDataNV)\n                pValue[i].Value >>= lComponentDataPV;\n            nComponentDataLocation = i;\n            --nNewLength;\n        }\n        else if ( pValue[i].Name == \"InputStream\" )\n        {\n            pValue[i].Value >>= xInputStream;\n        }\n        else if ( pValue[i].Name == \"UCBContent\" )\n        {\n            pValue[i].Value >>= xContent;\n            nUCBContentLocation = i;\n        }\n    }\n\n    assert(nNewLength >= nLength);\n\n    if (!xInputStream.is())\n        return OUString();\n\n    shared_ptr< librevenge::RVNGInputStream > input( new WPXSvInputStream( xInputStream ) );\n\n    \/* Apple Keynote documents come in two variants:\n     * * actual files (zip), only produced by Keynote 5 (at least with\n     *   default settings)\n     * * packages (IOW, directories), produced by Keynote 1-4 and again\n     *   starting with 6.\n     * But since the libetonyek import only works with a stream, we need\n     * to pass it one for the whole package. Here we determine if that\n     * is needed.\n     *\n     * Note: for convenience, we also recognize that the main XML file\n     * from a package was passed and pass the whole package to the\n     * filter instead.\n     *\/\n    if ( xContent.is() )\n    {\n        ucbhelper::Content aContent( xContent, Reference< ucb::XCommandEnvironment >(), comphelper::getProcessComponentContext() );\n        try\n        {\n            if ( aContent.isFolder() )\n            {\n                input.reset( new writerperfect::DirectoryStream( xContent ) );\n                bIsPackage = true;\n            }\n        }\n        catch (...)\n        {\n            return OUString();\n        }\n\n        libetonyek::EtonyekDocument::Type type = libetonyek::EtonyekDocument::TYPE_UNKNOWN;\n        const libetonyek::EtonyekDocument::Confidence confidence = libetonyek::EtonyekDocument::isSupported( input.get(), &type );\n        if ((libetonyek::EtonyekDocument::CONFIDENCE_NONE == confidence) || (libetonyek::EtonyekDocument::TYPE_KEYNOTE != type))\n            return OUString();\n\n        if ( confidence == libetonyek::EtonyekDocument::CONFIDENCE_SUPPORTED_PART )\n        {\n            assert( !bIsPackage );\n\n            const Reference < container::XChild > xChild( xContent, UNO_QUERY );\n            if ( xChild.is() )\n            {\n                const Reference < ucb::XContent > xPackageContent( xChild->getParent(), UNO_QUERY );\n                if ( xPackageContent.is() )\n                {\n                    input.reset( new writerperfect::DirectoryStream( xPackageContent ) );\n                    if ( libetonyek::EtonyekDocument::CONFIDENCE_EXCELLENT == libetonyek::EtonyekDocument::isSupported( input.get() ) )\n                    {\n                        xContent = xPackageContent;\n                        bUCBContentChanged = true;\n                        bIsPackage = true;\n                    }\n                }\n            }\n        }\n    }\n\n    \/\/ we do not need to insert ComponentData if this is not a package\n    if ( !bIsPackage && ( nComponentDataLocation == -1 ) )\n        --nNewLength;\n\n    if ( nNewLength > nLength )\n        Descriptor.realloc( nNewLength );\n\n    if ( nTypeNameLocation == -1 )\n    {\n        assert( nLength < nNewLength );\n        nTypeNameLocation = nLength++;\n        Descriptor[nTypeNameLocation].Name = \"TypeName\";\n    }\n\n    if ( bIsPackage && ( nComponentDataLocation == -1 ) )\n    {\n        assert( nLength < nNewLength );\n        nComponentDataLocation = nLength++;\n        Descriptor[nComponentDataLocation].Name = \"ComponentData\";\n    }\n\n    if ( bIsPackage )\n    {\n        if (bComponentDataNV)\n        {\n            const sal_Int32 nCDSize = lComponentDataNV.getLength();\n            lComponentDataNV.realloc( nCDSize + 1 );\n            beans::NamedValue aValue;\n            aValue.Name = \"IsPackage\";\n            aValue.Value = comphelper::makeBoolAny(true);\n            lComponentDataNV[nCDSize] = aValue;\n            Descriptor[nComponentDataLocation].Value <<= lComponentDataNV;\n        }\n        else\n        {\n            const sal_Int32 nCDSize = lComponentDataPV.getLength();\n            lComponentDataPV.realloc( nCDSize + 1 );\n            beans::PropertyValue aProp;\n            aProp.Name = \"IsPackage\";\n            aProp.Value = comphelper::makeBoolAny(true);\n            aProp.Handle = -1;\n            aProp.State = beans::PropertyState_DIRECT_VALUE;\n            lComponentDataPV[nCDSize] = aProp;\n            Descriptor[nComponentDataLocation].Value <<= lComponentDataPV;\n        }\n    }\n\n    if ( bUCBContentChanged )\n        Descriptor[nUCBContentLocation].Value <<= xContent;\n\n    const OUString sTypeName(\"impress_AppleKeynote\");\n    Descriptor[nTypeNameLocation].Value <<= sTypeName;\n\n    return sTypeName;\n}\n\n\/\/ XInitialization\nvoid SAL_CALL KeynoteImportFilter::initialize( const Sequence< Any >& aArguments )\nthrow (Exception, RuntimeException, std::exception)\n{\n    Sequence < PropertyValue > aAnySeq;\n    sal_Int32 nLength = aArguments.getLength();\n    if ( nLength && ( aArguments[0] >>= aAnySeq ) )\n    {\n        const PropertyValue *pValue = aAnySeq.getConstArray();\n        nLength = aAnySeq.getLength();\n        for ( sal_Int32 i = 0 ; i < nLength; i++)\n        {\n            if ( pValue[i].Name == \"Type\" )\n            {\n                pValue[i].Value >>= msFilterName;\n                break;\n            }\n        }\n    }\n}\n\nOUString KeynoteImportFilter_getImplementationName ()\nthrow (RuntimeException)\n{\n    return OUString ( \"org.libreoffice.comp.Impress.KeynoteImportFilter\" );\n}\n\n#define SERVICE_NAME1 \"com.sun.star.document.ImportFilter\"\n#define SERVICE_NAME2 \"com.sun.star.document.ExtendedTypeDetection\"\n\nSequence< OUString > SAL_CALL KeynoteImportFilter_getSupportedServiceNames(  )\nthrow (RuntimeException)\n{\n    Sequence < OUString > aRet(2);\n    OUString *pArray = aRet.getArray();\n    pArray[0] =  OUString ( SERVICE_NAME1 );\n    pArray[1] =  OUString ( SERVICE_NAME2 );\n    return aRet;\n}\n\n#undef SERVICE_NAME2\n#undef SERVICE_NAME1\n\nReference< XInterface > SAL_CALL KeynoteImportFilter_createInstance( const Reference< XComponentContext > & rContext)\nthrow( Exception )\n{\n    return (cppu::OWeakObject *) new KeynoteImportFilter( rContext );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL KeynoteImportFilter::getImplementationName(  )\nthrow (RuntimeException, std::exception)\n{\n    return KeynoteImportFilter_getImplementationName();\n}\n\nsal_Bool SAL_CALL KeynoteImportFilter::supportsService( const OUString &rServiceName )\nthrow (RuntimeException, std::exception)\n{\n    return cppu::supportsService(this, rServiceName);\n}\n\nSequence< OUString > SAL_CALL KeynoteImportFilter::getSupportedServiceNames(  )\nthrow (RuntimeException, std::exception)\n{\n    return KeynoteImportFilter_getSupportedServiceNames();\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLErrorIndicatorPropertyHdl.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 14:51: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_xmloff.hxx\"\n#include \"XMLErrorIndicatorPropertyHdl.hxx\"\n\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include <xmloff\/xmluconv.hxx>\n#endif\n#ifndef _COM_SUN_STAR_CHART_CHARTERRORINDICATORTYPE_HPP_\n#include <com\/sun\/star\/chart\/ChartErrorIndicatorType.hpp>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\nusing namespace com::sun::star;\n\nXMLErrorIndicatorPropertyHdl::~XMLErrorIndicatorPropertyHdl()\n{}\n\nsal_Bool XMLErrorIndicatorPropertyHdl::importXML( const ::rtl::OUString& rStrImpValue,\n                                                  uno::Any& rValue, const SvXMLUnitConverter& \/*rUnitConverter*\/ ) const\n{\n    sal_Bool bValue;\n    SvXMLUnitConverter::convertBool( bValue, rStrImpValue );\n\n    \/\/ modify existing value\n    chart::ChartErrorIndicatorType eType = chart::ChartErrorIndicatorType_NONE;\n    if( rValue.hasValue())\n        rValue >>= eType;\n\n    if( bValue )    \/\/ enable flag\n    {\n        if( eType != chart::ChartErrorIndicatorType_TOP_AND_BOTTOM )\n        {\n            if( mbUpperIndicator )\n                eType = ( eType == chart::ChartErrorIndicatorType_LOWER )\n                    ? chart::ChartErrorIndicatorType_TOP_AND_BOTTOM\n                    : chart::ChartErrorIndicatorType_UPPER;\n            else\n                eType = ( eType == chart::ChartErrorIndicatorType_UPPER )\n                    ? chart::ChartErrorIndicatorType_TOP_AND_BOTTOM\n                    : chart::ChartErrorIndicatorType_LOWER;\n        }\n    }\n    else            \/\/ disable flag\n    {\n        if( eType != chart::ChartErrorIndicatorType_NONE )\n        {\n            if( mbUpperIndicator )\n                eType = ( eType == chart::ChartErrorIndicatorType_UPPER )\n                    ? chart::ChartErrorIndicatorType_NONE\n                    : chart::ChartErrorIndicatorType_LOWER;\n            else\n                eType = ( eType == chart::ChartErrorIndicatorType_LOWER )\n                    ? chart::ChartErrorIndicatorType_NONE\n                    : chart::ChartErrorIndicatorType_UPPER;\n        }\n    }\n\n    rValue <<= eType;\n\n    return sal_True;\n}\n\nsal_Bool XMLErrorIndicatorPropertyHdl::exportXML( ::rtl::OUString& rStrExpValue,\n                                                  const uno::Any& rValue, const SvXMLUnitConverter& \/*rUnitConverter*\/ ) const\n{\n    rtl::OUStringBuffer aBuffer;\n    chart::ChartErrorIndicatorType eType;\n\n    rValue >>= eType;\n    sal_Bool bValue = ( eType == chart::ChartErrorIndicatorType_TOP_AND_BOTTOM ||\n                        ( mbUpperIndicator\n                          ? ( eType == chart::ChartErrorIndicatorType_UPPER )\n                          : ( eType == chart::ChartErrorIndicatorType_LOWER )));\n\n    if( bValue )\n    {\n        SvXMLUnitConverter::convertBool( aBuffer, bValue );\n        rStrExpValue = aBuffer.makeStringAndClear();\n    }\n\n    \/\/ only export if set to true\n    return bValue;\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.162); FILE MERGED 2008\/04\/01 16:09:32 thb 1.5.162.3: #i85898# Stripping all external header guards 2008\/04\/01 13:04:33 thb 1.5.162.2: #i85898# Stripping all external header guards 2008\/03\/31 16:28:01 rt 1.5.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: XMLErrorIndicatorPropertyHdl.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_xmloff.hxx\"\n#include \"XMLErrorIndicatorPropertyHdl.hxx\"\n#include <xmloff\/xmluconv.hxx>\n#include <com\/sun\/star\/chart\/ChartErrorIndicatorType.hpp>\n#include <rtl\/ustrbuf.hxx>\n\nusing namespace com::sun::star;\n\nXMLErrorIndicatorPropertyHdl::~XMLErrorIndicatorPropertyHdl()\n{}\n\nsal_Bool XMLErrorIndicatorPropertyHdl::importXML( const ::rtl::OUString& rStrImpValue,\n                                                  uno::Any& rValue, const SvXMLUnitConverter& \/*rUnitConverter*\/ ) const\n{\n    sal_Bool bValue;\n    SvXMLUnitConverter::convertBool( bValue, rStrImpValue );\n\n    \/\/ modify existing value\n    chart::ChartErrorIndicatorType eType = chart::ChartErrorIndicatorType_NONE;\n    if( rValue.hasValue())\n        rValue >>= eType;\n\n    if( bValue )    \/\/ enable flag\n    {\n        if( eType != chart::ChartErrorIndicatorType_TOP_AND_BOTTOM )\n        {\n            if( mbUpperIndicator )\n                eType = ( eType == chart::ChartErrorIndicatorType_LOWER )\n                    ? chart::ChartErrorIndicatorType_TOP_AND_BOTTOM\n                    : chart::ChartErrorIndicatorType_UPPER;\n            else\n                eType = ( eType == chart::ChartErrorIndicatorType_UPPER )\n                    ? chart::ChartErrorIndicatorType_TOP_AND_BOTTOM\n                    : chart::ChartErrorIndicatorType_LOWER;\n        }\n    }\n    else            \/\/ disable flag\n    {\n        if( eType != chart::ChartErrorIndicatorType_NONE )\n        {\n            if( mbUpperIndicator )\n                eType = ( eType == chart::ChartErrorIndicatorType_UPPER )\n                    ? chart::ChartErrorIndicatorType_NONE\n                    : chart::ChartErrorIndicatorType_LOWER;\n            else\n                eType = ( eType == chart::ChartErrorIndicatorType_LOWER )\n                    ? chart::ChartErrorIndicatorType_NONE\n                    : chart::ChartErrorIndicatorType_UPPER;\n        }\n    }\n\n    rValue <<= eType;\n\n    return sal_True;\n}\n\nsal_Bool XMLErrorIndicatorPropertyHdl::exportXML( ::rtl::OUString& rStrExpValue,\n                                                  const uno::Any& rValue, const SvXMLUnitConverter& \/*rUnitConverter*\/ ) const\n{\n    rtl::OUStringBuffer aBuffer;\n    chart::ChartErrorIndicatorType eType;\n\n    rValue >>= eType;\n    sal_Bool bValue = ( eType == chart::ChartErrorIndicatorType_TOP_AND_BOTTOM ||\n                        ( mbUpperIndicator\n                          ? ( eType == chart::ChartErrorIndicatorType_UPPER )\n                          : ( eType == chart::ChartErrorIndicatorType_LOWER )));\n\n    if( bValue )\n    {\n        SvXMLUnitConverter::convertBool( aBuffer, bValue );\n        rStrExpValue = aBuffer.makeStringAndClear();\n    }\n\n    \/\/ only export if set to true\n    return bValue;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * TcpIpAsyncClientSsl.hpp\n *\n * Copyright (C) 2020 by RStudio, PBC\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#ifndef CORE_HTTP_TCP_IP_ASYNC_CLIENT_SSL_HPP\n#define CORE_HTTP_TCP_IP_ASYNC_CLIENT_SSL_HPP\n\n#include <boost\/scoped_ptr.hpp>\n\n#include <boost\/asio\/ip\/tcp.hpp>\n\n#include \"BoostAsioSsl.hpp\"\n\n#include <core\/http\/AsyncClient.hpp>\n#include <core\/http\/TcpIpAsyncConnector.hpp>\n\n#ifdef _WIN32\n#include <windows.h>\n#include <wincrypt.h>\n#include <cryptuiapi.h>\n#include <openssl\/x509.h>\n#endif\n\n#ifdef __APPLE__\n#include <core\/http\/Keychain.hpp>\n#include <openssl\/x509.h>\n#endif\n\nnamespace rstudio {\nnamespace core {\nnamespace http {\n\nclass TcpIpAsyncClientSsl\n   : public AsyncClient<boost::asio::ssl::stream<boost::asio::ip::tcp::socket> >\n{\npublic:\n   TcpIpAsyncClientSsl(boost::asio::io_service& ioService,\n                       const std::string& address,\n                       const std::string& port,\n                       bool verify,\n                       const std::string& certificateAuthority = std::string(),\n                       const boost::posix_time::time_duration& connectionTimeout =\n                          boost::posix_time::time_duration(boost::posix_time::pos_infin),\n                       const std::string& hostname = std::string() )\n     : AsyncClient<boost::asio::ssl::stream<boost::asio::ip::tcp::socket> >(ioService),\n       sslContext_(boost::asio::ssl::context::sslv23_client),\n       address_(address),\n       port_(port),\n       verify_(verify),\n       certificateAuthority_(certificateAuthority),\n       connectionTimeout_(connectionTimeout)\n   {\n      if (verify_)\n      {\n         sslContext_.set_default_verify_paths();\n         sslContext_.set_verify_mode(boost::asio::ssl::context::verify_peer);\n\n         if (!certificateAuthority_.empty())\n         {\n            boost::asio::const_buffer buff(certificateAuthority_.data(), certificateAuthority_.size());\n            boost::system::error_code ec;\n            sslContext_.add_certificate_authority(buff, ec);\n            if (ec)\n               LOG_ERROR(Error(ec, ERROR_LOCATION));\n         }\n\n      #ifdef _WIN32\n         \/\/ on Windows, OpenSSL does not support loading certificates from the Windows certificate store\n         \/\/ because of this, each time we need to verify certificates, we initialize\n         \/\/ all certificates individually with OpenSSL\n         const ICertStore& certStore = getCertificateStore();\n      #endif\n\n      #ifdef __APPLE__\n         \/\/ on OSX, OpenSSL does not support loading certificates from the Keychain\n         \/\/ because of this, each time we need to verify certificates, we initialize\n         \/\/ all certificates individually with OpenSSL, similar to what is done above for Windows\n         const ICertStore& certStore = getKeychain();\n      #endif\n\n      #if defined(__APPLE__) || defined(_WIN32)\n         for (const auto& cert : certStore.getCertificates())\n         {\n            if (X509_STORE* store = SSL_CTX_get_cert_store(sslContext_.native_handle()))\n            {\n               if (::X509_STORE_add_cert(store, cert) != 1)\n               {\n                  char* subjectName = X509_NAME_oneline(X509_get_subject_name(cert), nullptr, 0);\n                  std::string subjectNameStr(subjectName);\n                  OPENSSL_free(subjectName);\n\n                  boost::system::error_code ec = boost::system::error_code(\n                              static_cast<int>(::ERR_get_error()),\n                              boost::asio::error::get_ssl_category());\n                  Error error(ec, ERROR_LOCATION);\n                  error.addProperty(\"Description\", \"Could not add Windows certificate to OpenSSL cert store: \" + subjectNameStr);\n\n                  LOG_ERROR(error);\n               }\n            }\n         }\n      #endif\n      }\n      else\n      {\n         sslContext_.set_verify_mode(boost::asio::ssl::context::verify_none);\n      }\n\n      \/\/ use scoped ptr so we can call the constructor after we've configured\n      \/\/ the ssl::context (immediately above)\n      ptrSslStream_.reset(new boost::asio::ssl::stream<boost::asio::ip::tcp::socket>(ioService, sslContext_));\n\n      \/\/ TLS v1.3 requires that the SNI be set, so set the SNI.\n      if (!SSL_set_tlsext_host_name(\n            ptrSslStream_->native_handle(),\n            (hostname.empty() ? address_.c_str() : hostname.c_str())))\n      {\n         boost::system::error_code ec{ static_cast<int>(::ERR_get_error()), boost::asio::error::get_ssl_category() };\n         LOG_ERROR(Error(ec, ERROR_LOCATION));\n      }\n   }\n\n\nprotected:\n\n   virtual boost::asio::ssl::stream<boost::asio::ip::tcp::socket>& socket()\n   {\n      return *(ptrSslStream_);\n   }\n\n   virtual void connectAndWriteRequest()\n   {\n      boost::shared_ptr<TcpIpAsyncConnector> pAsyncConnector(\n                  new TcpIpAsyncConnector(ioService(),\n                                          &(ptrSslStream_->next_layer())));\n\n      pAsyncConnector->connect(\n            address_,\n            port_,\n            boost::bind(&TcpIpAsyncClientSsl::performHandshake,\n                        TcpIpAsyncClientSsl::sharedFromThis()),\n            boost::bind(&TcpIpAsyncClientSsl::handleConnectionError,\n                        TcpIpAsyncClientSsl::sharedFromThis(),\n                        _1),\n            connectionTimeout_);\n   }\n\n   virtual std::string getDefaultHostHeader()\n   {\n      return address_ + \":\" + port_;\n   }\n\n\nprivate:\n\n   void performHandshake()\n   {\n      if (verify_)\n      {\n         ptrSslStream_->set_verify_callback(\n                            boost::asio::ssl::rfc2818_verification(address_));\n      }\n      ptrSslStream_->async_handshake(\n            boost::asio::ssl::stream_base::client,\n            boost::bind(&TcpIpAsyncClientSsl::handleHandshake,\n                        sharedFromThis(),\n                        boost::asio::placeholders::error));\n   }\n\n   void handleHandshake(const boost::system::error_code& ec)\n   {\n      try\n      {\n         if (!ec)\n         {\n            \/\/ finished handshake, commence with request\n            writeRequest();\n         }\n         else\n         {\n            handleErrorCode(ec, ERROR_LOCATION);\n         }\n      }\n      CATCH_UNEXPECTED_ASYNC_CLIENT_EXCEPTION\n   }\n\n   const boost::shared_ptr<TcpIpAsyncClientSsl> sharedFromThis()\n   {\n      boost::shared_ptr<AsyncClient<boost::asio::ssl::stream<boost::asio::ip::tcp::socket> > > ptrShared\n                                                 = shared_from_this();\n\n      return boost::static_pointer_cast<TcpIpAsyncClientSsl>(ptrShared);\n   }\n\n   virtual bool isShutdownError(const boost::system::error_code& ec)\n   {\n      return util::isSslShutdownError(ec);\n   }\n\nprivate:\n   boost::asio::ssl::context sslContext_;\n   boost::scoped_ptr<boost::asio::ssl::stream<boost::asio::ip::tcp::socket> > ptrSslStream_;\n   std::string address_;\n   std::string port_;\n   bool verify_;\n   std::string certificateAuthority_;\n   boost::posix_time::time_duration connectionTimeout_;\n\n#if defined(_WIN32) || defined(__APPLE__)\n   class ICertStore\n   {\n   public:\n      virtual std::vector<X509*> getCertificates() const = 0;\n      virtual ~ICertStore() {}\n   };\n#endif\n\n#ifdef _WIN32\n   class WindowsCertificateStore : public ICertStore\n   {\n   public:\n      WindowsCertificateStore()\n      {\n         \/\/ load certificates from important stores\n         LPCSTR stores[] = {\"ROOT\", \"CA\"};\n         for (const LPCSTR& store : stores)\n         {\n             HCERTSTORE hStore = CertOpenSystemStore(NULL, store);\n             if (!hStore)\n             {\n                LOG_ERROR_MESSAGE(\"Could not open certificate store\");\n                return;\n             }\n\n             PCCERT_CONTEXT pContext = nullptr;\n             while (pContext = CertEnumCertificatesInStore(hStore, pContext))\n             {\n                \/\/ convert the certificate returned from the Windows store into a\n                \/\/ format that OpenSSL can understand\n                const BYTE* certPtr = pContext->pbCertEncoded;\n                X509* x509 = d2i_X509(nullptr, &certPtr, pContext->cbCertEncoded);\n                if (x509)\n                   certificates.push_back(x509);\n             }\n\n             CertCloseStore(hStore, 0);\n         }\n      }\n\n      std::vector<X509*> getCertificates() const\n      {\n         return certificates;\n      }\n\n   private:\n      \/\/ certificate pointers - these are intentionally leaked\n      \/\/ as they need to be available for the entire run of the program\n      std::vector<X509*> certificates;\n   };\n\n   static const ICertStore& getCertificateStore()\n   {\n       \/\/ Meyer's singleton - guarantees this is thread safe\n       \/\/ and will be initialized exactly once by the first caller\n       static WindowsCertificateStore instance;\n       return instance;\n   }\n#endif\n\n#ifdef __APPLE__\n   class Keychain : public ICertStore\n   {\n   public:\n      Keychain()\n      {\n         \/\/ load all certs from the keychain\n         std::vector<KeychainCertificateData> certs = getKeychainCertificates();\n         for (const auto& cert : certs)\n         {\n            \/\/ convert the raw bytes from the keychain into a format that OpenSSL can understand\n            const unsigned char* bytePtr = cert.data.get();\n            X509* x509 = d2i_X509(nullptr, &bytePtr, cert.size);\n            if (x509)\n               certificates.push_back(x509);\n         }\n      }\n\n      std::vector<X509*> getCertificates() const\n      {\n         return certificates;\n      }\n\n   private:\n      \/\/ certificate pointers - these are intentionally leaked\n      \/\/ as they need to be available for the entire run of the program\n      std::vector<X509*> certificates;\n   };\n\n   static const ICertStore& getKeychain()\n   {\n      \/\/ Meyer's singleton - guarantees this is thread safe\n      \/\/ and will be initialized exactly once by the first caller\n      static Keychain instance;\n      return instance;\n   }\n#endif\n};\n\n\n} \/\/ namespace http\n} \/\/ namespace core\n} \/\/ namespace rstudio\n\n#endif \/\/ CORE_HTTP_TCP_IP_ASYNC_CLIENT_SSL_HPP\n<commit_msg>Code review feedback - log inability to parse X509 certificate (as debug to prevent potential spam), and notate that returned certificates should not be freed.<commit_after>\/*\n * TcpIpAsyncClientSsl.hpp\n *\n * Copyright (C) 2020 by RStudio, PBC\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#ifndef CORE_HTTP_TCP_IP_ASYNC_CLIENT_SSL_HPP\n#define CORE_HTTP_TCP_IP_ASYNC_CLIENT_SSL_HPP\n\n#include <boost\/scoped_ptr.hpp>\n\n#include <boost\/asio\/ip\/tcp.hpp>\n\n#include \"BoostAsioSsl.hpp\"\n\n#include <core\/http\/AsyncClient.hpp>\n#include <core\/http\/TcpIpAsyncConnector.hpp>\n\n#ifdef _WIN32\n#include <windows.h>\n#include <wincrypt.h>\n#include <cryptuiapi.h>\n#include <openssl\/x509.h>\n#endif\n\n#ifdef __APPLE__\n#include <core\/http\/Keychain.hpp>\n#include <openssl\/x509.h>\n#endif\n\nnamespace rstudio {\nnamespace core {\nnamespace http {\n\nclass TcpIpAsyncClientSsl\n   : public AsyncClient<boost::asio::ssl::stream<boost::asio::ip::tcp::socket> >\n{\npublic:\n   TcpIpAsyncClientSsl(boost::asio::io_service& ioService,\n                       const std::string& address,\n                       const std::string& port,\n                       bool verify,\n                       const std::string& certificateAuthority = std::string(),\n                       const boost::posix_time::time_duration& connectionTimeout =\n                          boost::posix_time::time_duration(boost::posix_time::pos_infin),\n                       const std::string& hostname = std::string() )\n     : AsyncClient<boost::asio::ssl::stream<boost::asio::ip::tcp::socket> >(ioService),\n       sslContext_(boost::asio::ssl::context::sslv23_client),\n       address_(address),\n       port_(port),\n       verify_(verify),\n       certificateAuthority_(certificateAuthority),\n       connectionTimeout_(connectionTimeout)\n   {\n      if (verify_)\n      {\n         sslContext_.set_default_verify_paths();\n         sslContext_.set_verify_mode(boost::asio::ssl::context::verify_peer);\n\n         if (!certificateAuthority_.empty())\n         {\n            boost::asio::const_buffer buff(certificateAuthority_.data(), certificateAuthority_.size());\n            boost::system::error_code ec;\n            sslContext_.add_certificate_authority(buff, ec);\n            if (ec)\n               LOG_ERROR(Error(ec, ERROR_LOCATION));\n         }\n\n      #ifdef _WIN32\n         \/\/ on Windows, OpenSSL does not support loading certificates from the Windows certificate store\n         \/\/ because of this, each time we need to verify certificates, we initialize\n         \/\/ all certificates individually with OpenSSL\n         const ICertStore& certStore = getCertificateStore();\n      #endif\n\n      #ifdef __APPLE__\n         \/\/ on OSX, OpenSSL does not support loading certificates from the Keychain\n         \/\/ because of this, each time we need to verify certificates, we initialize\n         \/\/ all certificates individually with OpenSSL, similar to what is done above for Windows\n         const ICertStore& certStore = getKeychain();\n      #endif\n\n      #if defined(__APPLE__) || defined(_WIN32)\n         for (const auto& cert : certStore.getCertificates())\n         {\n            if (X509_STORE* store = SSL_CTX_get_cert_store(sslContext_.native_handle()))\n            {\n               if (::X509_STORE_add_cert(store, cert) != 1)\n               {\n                  char* subjectName = X509_NAME_oneline(X509_get_subject_name(cert), nullptr, 0);\n                  std::string subjectNameStr(subjectName);\n                  OPENSSL_free(subjectName);\n\n                  boost::system::error_code ec = boost::system::error_code(\n                              static_cast<int>(::ERR_get_error()),\n                              boost::asio::error::get_ssl_category());\n                  Error error(ec, ERROR_LOCATION);\n                  error.addProperty(\"Description\", \"Could not add Windows certificate to OpenSSL cert store: \" + subjectNameStr);\n\n                  LOG_ERROR(error);\n               }\n            }\n         }\n      #endif\n      }\n      else\n      {\n         sslContext_.set_verify_mode(boost::asio::ssl::context::verify_none);\n      }\n\n      \/\/ use scoped ptr so we can call the constructor after we've configured\n      \/\/ the ssl::context (immediately above)\n      ptrSslStream_.reset(new boost::asio::ssl::stream<boost::asio::ip::tcp::socket>(ioService, sslContext_));\n\n      \/\/ TLS v1.3 requires that the SNI be set, so set the SNI.\n      if (!SSL_set_tlsext_host_name(\n            ptrSslStream_->native_handle(),\n            (hostname.empty() ? address_.c_str() : hostname.c_str())))\n      {\n         boost::system::error_code ec{ static_cast<int>(::ERR_get_error()), boost::asio::error::get_ssl_category() };\n         LOG_ERROR(Error(ec, ERROR_LOCATION));\n      }\n   }\n\n\nprotected:\n\n   virtual boost::asio::ssl::stream<boost::asio::ip::tcp::socket>& socket()\n   {\n      return *(ptrSslStream_);\n   }\n\n   virtual void connectAndWriteRequest()\n   {\n      boost::shared_ptr<TcpIpAsyncConnector> pAsyncConnector(\n                  new TcpIpAsyncConnector(ioService(),\n                                          &(ptrSslStream_->next_layer())));\n\n      pAsyncConnector->connect(\n            address_,\n            port_,\n            boost::bind(&TcpIpAsyncClientSsl::performHandshake,\n                        TcpIpAsyncClientSsl::sharedFromThis()),\n            boost::bind(&TcpIpAsyncClientSsl::handleConnectionError,\n                        TcpIpAsyncClientSsl::sharedFromThis(),\n                        _1),\n            connectionTimeout_);\n   }\n\n   virtual std::string getDefaultHostHeader()\n   {\n      return address_ + \":\" + port_;\n   }\n\n\nprivate:\n\n   void performHandshake()\n   {\n      if (verify_)\n      {\n         ptrSslStream_->set_verify_callback(\n                            boost::asio::ssl::rfc2818_verification(address_));\n      }\n      ptrSslStream_->async_handshake(\n            boost::asio::ssl::stream_base::client,\n            boost::bind(&TcpIpAsyncClientSsl::handleHandshake,\n                        sharedFromThis(),\n                        boost::asio::placeholders::error));\n   }\n\n   void handleHandshake(const boost::system::error_code& ec)\n   {\n      try\n      {\n         if (!ec)\n         {\n            \/\/ finished handshake, commence with request\n            writeRequest();\n         }\n         else\n         {\n            handleErrorCode(ec, ERROR_LOCATION);\n         }\n      }\n      CATCH_UNEXPECTED_ASYNC_CLIENT_EXCEPTION\n   }\n\n   const boost::shared_ptr<TcpIpAsyncClientSsl> sharedFromThis()\n   {\n      boost::shared_ptr<AsyncClient<boost::asio::ssl::stream<boost::asio::ip::tcp::socket> > > ptrShared\n                                                 = shared_from_this();\n\n      return boost::static_pointer_cast<TcpIpAsyncClientSsl>(ptrShared);\n   }\n\n   virtual bool isShutdownError(const boost::system::error_code& ec)\n   {\n      return util::isSslShutdownError(ec);\n   }\n\nprivate:\n   boost::asio::ssl::context sslContext_;\n   boost::scoped_ptr<boost::asio::ssl::stream<boost::asio::ip::tcp::socket> > ptrSslStream_;\n   std::string address_;\n   std::string port_;\n   bool verify_;\n   std::string certificateAuthority_;\n   boost::posix_time::time_duration connectionTimeout_;\n\n#if defined(_WIN32) || defined(__APPLE__)\n   class ICertStore\n   {\n   public:\n      virtual std::vector<X509*> getCertificates() const = 0;\n      virtual ~ICertStore() {}\n   };\n#endif\n\n#ifdef _WIN32\n   class WindowsCertificateStore : public ICertStore\n   {\n   public:\n      WindowsCertificateStore()\n      {\n         \/\/ load certificates from important stores\n         LPCSTR stores[] = {\"ROOT\", \"CA\"};\n         for (const LPCSTR& store : stores)\n         {\n             HCERTSTORE hStore = CertOpenSystemStore(NULL, store);\n             if (!hStore)\n             {\n                LOG_ERROR_MESSAGE(\"Could not open certificate store\");\n                return;\n             }\n\n             PCCERT_CONTEXT pContext = nullptr;\n             while (pContext = CertEnumCertificatesInStore(hStore, pContext))\n             {\n                \/\/ convert the certificate returned from the Windows store into a\n                \/\/ format that OpenSSL can understand\n                const BYTE* certPtr = pContext->pbCertEncoded;\n                X509* x509 = d2i_X509(nullptr, &certPtr, pContext->cbCertEncoded);\n                if (x509)\n                {\n                   certificates.push_back(x509);\n                }\n                else\n                {\n                   boost::system::error_code ec = boost::system::error_code(\n                               static_cast<int>(::ERR_get_error()),\n                               boost::asio::error::get_ssl_category());\n                   Error error(ec, ERROR_LOCATION);\n                   error.addProperty(\"Description\",\n                                     \"Could not create OpenSSL certificate object from Windows certificate data\");\n                   LOG_DEBUG_MESSAGE(error.asString());\n                }\n             }\n\n             CertCloseStore(hStore, 0);\n         }\n      }\n\n      \/\/ note to caller - the certificate data (X509 pointers) here must not be freed as the data\n      \/\/ must persist for the lifetime of the process\n      std::vector<X509*> getCertificates() const\n      {\n         return certificates;\n      }\n\n   private:\n      \/\/ certificate pointers - these are intentionally leaked\n      \/\/ as they need to be available for the entire run of the program\n      std::vector<X509*> certificates;\n   };\n\n   static const ICertStore& getCertificateStore()\n   {\n       \/\/ Meyer's singleton - guarantees this is thread safe\n       \/\/ and will be initialized exactly once by the first caller\n       static WindowsCertificateStore instance;\n       return instance;\n   }\n#endif\n\n#ifdef __APPLE__\n   class Keychain : public ICertStore\n   {\n   public:\n      Keychain()\n      {\n         \/\/ load all certs from the keychain\n         std::vector<KeychainCertificateData> certs = getKeychainCertificates();\n         for (const auto& cert : certs)\n         {\n            \/\/ convert the raw bytes from the keychain into a format that OpenSSL can understand\n            const unsigned char* bytePtr = cert.data.get();\n            X509* x509 = d2i_X509(nullptr, &bytePtr, cert.size);\n            if (x509)\n            {\n               certificates.push_back(x509);\n            }\n            else\n            {\n               boost::system::error_code ec = boost::system::error_code(\n                           static_cast<int>(::ERR_get_error()),\n                           boost::asio::error::get_ssl_category());\n               Error error(ec, ERROR_LOCATION);\n               error.addProperty(\"Description\",\n                                 \"Could not create OpenSSL certificate object from Keychain certificate data\");\n               LOG_DEBUG_MESSAGE(error.asString());\n            }\n         }\n      }\n\n      \/\/ note to caller - the certificate data (X509 pointers) here must not be freed as the data\n      \/\/ must persist for the lifetime of the process\n      std::vector<X509*> getCertificates() const\n      {\n         return certificates;\n      }\n\n   private:\n      \/\/ certificate pointers - these are intentionally leaked\n      \/\/ as they need to be available for the entire run of the program\n      std::vector<X509*> certificates;\n   };\n\n   static const ICertStore& getKeychain()\n   {\n      \/\/ Meyer's singleton - guarantees this is thread safe\n      \/\/ and will be initialized exactly once by the first caller\n      static Keychain instance;\n      return instance;\n   }\n#endif\n};\n\n\n} \/\/ namespace http\n} \/\/ namespace core\n} \/\/ namespace rstudio\n\n#endif \/\/ CORE_HTTP_TCP_IP_ASYNC_CLIENT_SSL_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Fill out your copyright notice in the Description page of Project Settings.\n\n#include \"CubeWars.h\"\n#include \"DestroyableObstacle.h\"\n#include \"CubeDebris.h\"\n#include \"ObstacleMovementComponent.h\"\n#include \"Net\/UnrealNetwork.h\"\n#include \"CubeWarsGameMode.h\"\n\nnamespace {\n\tconst FVector CUBE_DIMENSIONS(20.0f, 20.0f, 20.0f);\n\tconst int32 NUM_PARTS_PER_COLUMN = 4;\n}\n\n\/\/ Sets default values\nADestroyableObstacle::ADestroyableObstacle()\n\t: MinConstructionTime(0.5f)\n\t, MaxConstructionTime(1.0f)\n\t, MinConstructionDistanceMultiplier(2.0f)\n\t, MaxConstructionDistanceMultiplier(3.0f)\n\t, NumPartColumns(5)\n\t, Dimensions(20.0f, 300.0f, 50.0f)\n\t, ExplosionForce(5000.0f)\n\t, MaxHealth(26.0f)\n\t, Health(MaxHealth)\n\t, TotalConstructionTime(MaxConstructionTime)\n\t, ConstructionTimer(0.0f)\n\t, FinalPartMaterial(nullptr)\n{\n\t\/\/ Set this actor to call Tick() every frame.  You can turn this off to improve performance if you don't need it.\n\tPrimaryActorTick.bCanEverTick = true;\n\n\t\/\/ Basic setup\n\tbReplicates = true;\n\tbReplicateMovement = true;\n\n\tBaseCollisionComponent = CreateDefaultSubobject<UBoxComponent>(TEXT(\"RootComponent\"));\n\tRootComponent = BaseCollisionComponent;\n\t\/\/BaseCollisionComponent->InitBoxExtent(FVector(10.0f));\n\tBaseCollisionComponent->SetBoxExtent(Dimensions \/ 2.0f, true);\n\tBaseCollisionComponent->SetCollisionProfileName(TEXT(\"Obstacle\"));\n\tBaseCollisionComponent->SetCollisionEnabled(ECollisionEnabled::QueryAndPhysics);\n\tBaseCollisionComponent->SetSimulatePhysics(false);\n\n\t\/\/ Add the visual representations\n\t\/\/The mesh is 20x20x20 -> match the parts to be the size of Dimensions in total\n\tconst FVector DIMENSION_RATIO = Dimensions \/ CUBE_DIMENSIONS;\n\tconst float CENTER_WIDTH = Dimensions.Y - (Dimensions.Y \/ NumPartColumns);\n\tconst float X_OFFSET = Dimensions.X \/ 4.0f;\n\tconst float Z_OFFSET = Dimensions.Z \/ 4.0f;\n\n\tFVector PartScale(DIMENSION_RATIO.X \/ 2.0f, (Dimensions.Y \/ NumPartColumns) \/ CUBE_DIMENSIONS.Y, DIMENSION_RATIO.Z \/ 2.0f);\n\n\t{\n\t\t\/\/ Create and position a mesh component so we can see where our cube is\n\t\tstatic ConstructorHelpers::FObjectFinder<UStaticMesh> CubeVisualAsset(TEXT(\"\/Game\/Meshes\/SimpleCube.SimpleCube\"));\n\t\tif (CubeVisualAsset.Succeeded())\n\t\t{\n\t\t\tstatic ConstructorHelpers::FObjectFinder<UMaterialInstance> Material(TEXT(\"\/Game\/Materials\/QuadraticTransparent.QuadraticTransparent\"));\n\n\t\t\tif (Material.Succeeded())\n\t\t\t{\n\t\t\t\tfor (int32 i = 0; i < NumPartColumns; ++i)\n\t\t\t\t{\n\t\t\t\t\tconst float CENTER_Y = CENTER_WIDTH * (i \/ static_cast<float>(NumPartColumns - 1)) - CENTER_WIDTH \/ 2.0f;\n\n\t\t\t\t\tTArray<UStaticMeshComponent*> NewVisuals;\n\n\t\t\t\t\tNewVisuals.Add(CreateObstaclePart(FVector(X_OFFSET, CENTER_Y, Z_OFFSET), PartScale, CubeVisualAsset.Object, Material.Object, i * NUM_PARTS_PER_COLUMN));\n\t\t\t\t\tNewVisuals.Add(CreateObstaclePart(FVector(X_OFFSET, CENTER_Y, -Z_OFFSET), PartScale, CubeVisualAsset.Object, Material.Object, i * NUM_PARTS_PER_COLUMN + 1));\n\t\t\t\t\tNewVisuals.Add(CreateObstaclePart(FVector(-X_OFFSET, CENTER_Y, -Z_OFFSET), PartScale, CubeVisualAsset.Object, Material.Object, i * NUM_PARTS_PER_COLUMN + 2));\n\t\t\t\t\tNewVisuals.Add(CreateObstaclePart(FVector(-X_OFFSET, CENTER_Y, Z_OFFSET), PartScale, CubeVisualAsset.Object, Material.Object, i * NUM_PARTS_PER_COLUMN + 3));\n\n\t\t\t\t\tFRandomStream RandStream;\n\t\t\t\t\tRandStream.GenerateNewSeed();\n\n\t\t\t\t\t\/\/ First determine the parts that can fall off\n\t\t\t\t\tint32 Index = RandStream.RandRange(0, 3);\n\t\t\t\t\tFallOffParts.Add(NewVisuals[Index]);\n\t\t\t\t\tNewVisuals.RemoveAt(Index);\n\n\t\t\t\t\tIndex = RandStream.RandRange(0, 2);\n\t\t\t\t\tFallOffParts.Add(NewVisuals[Index]);\n\t\t\t\t\tNewVisuals.RemoveAt(Index);\n\n\t\t\t\t\tIndex = RandStream.RandRange(0, 1);\n\t\t\t\t\tFallOffParts.Add(NewVisuals[Index]);\n\t\t\t\t\tNewVisuals.RemoveAt(Index);\n\n\t\t\t\t\t\/\/ Now the fixed parts\n\t\t\t\t\tFixedParts.Append(NewVisuals);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tUE_LOG(LogTemp, Warning, TEXT(\"Cannot find '\/Game\/Materials\/QuadraticTransparent.QuadraticTransparent'!\"));\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tUE_LOG(LogTemp, Warning, TEXT(\"Cannot find '\/Game\/Meshes\/SimpleCube.SimpleCube'!\"));\n\t\t}\n\t}\n\n\t\/\/ Load the material FinalPartMaterial\n\tstatic ConstructorHelpers::FObjectFinder<UMaterialInstance> Material(TEXT(\"\/Game\/Materials\/Quadratic.Quadratic\"));\n\tif (Material.Succeeded())\n\t{\n\t\tFinalPartMaterial = Material.Object;\n\t}\n\telse\n\t{\n\t\tUE_LOG(LogTemp, Warning, TEXT(\"Cannot find '\/Game\/Materials\/Quadratic.Quadratic'!\"));\n\t}\n\n\t\/\/ Movement component\n\tMovementComponent = CreateDefaultSubobject<UObstacleMovementComponent>(TEXT(\"ObstacleMovement\"));\n\tMovementComponent->UpdatedComponent = RootComponent;\n}\n\n\/\/ Called when the game starts or when spawned\nvoid ADestroyableObstacle::BeginPlay()\n{\n\tSuper::BeginPlay();\n\n\tTotalConstructionTime = MaxConstructionTime;\n\n\t\/\/ Initialize the construction structs for the parts of the obstacle\n\tFRandomStream Rand;\n\tfor (int32 i = 0; i < ConstructionProgresses.Num(); ++i)\n\t{\n\t\tPartConstructionProgress& PartProgress = ConstructionProgresses[i];\n\t\tPartProgress.StartPosition = PartProgress.FinalPosition * Rand.FRandRange(MinConstructionDistanceMultiplier, MaxConstructionDistanceMultiplier);\n\t\tPartProgress.TotalTime = Rand.FRandRange(MinConstructionTime, MaxConstructionTime);\n\n\t\tUMaterialInstanceDynamic* MaterialInstance = PartProgress.CubeVisual->CreateDynamicMaterialInstance(0);\n\t\tPartProgress.CubeVisual->SetMaterial(0, MaterialInstance);\n\t\tPartProgress.MaterialInstance = MaterialInstance;\n\t\tMaterialInstance->SetScalarParameterValue(\"Opacity\", 0.0f);\n\t}\n}\n\n\/\/ Called every frame\nvoid ADestroyableObstacle::Tick( float DeltaTime )\n{\n\tSuper::Tick( DeltaTime );\n\n\tfor (int32 i = 0; i < ConstructionProgresses.Num();)\n\t{\n\t\tPartConstructionProgress& PartProgress = ConstructionProgresses[i];\n\t\tPartProgress.CurrentTime += DeltaTime;\n\n\t\tUStaticMeshComponent* CubeVisual = PartProgress.CubeVisual;\n\t\tUMaterialInstanceDynamic* MaterialInstance = PartProgress.MaterialInstance;\n\t\tFVector NewPosition;\n\t\tfloat NewOpacity;\n\n\t\tif (PartProgress.CurrentTime >= PartProgress.TotalTime)\n\t\t{\n\t\t\tNewPosition = PartProgress.FinalPosition;\n\t\t\tNewOpacity = 1.0f;\n\t\t\tConstructionProgresses.RemoveAt(i);\n\n\t\t\tif (FinalPartMaterial)\n\t\t\t{\n\t\t\t\tCubeVisual->SetMaterial(0, FinalPartMaterial);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfloat Delta = PartProgress.CurrentTime \/ PartProgress.TotalTime;\n\t\t\tNewPosition = FMath::Lerp(PartProgress.StartPosition, PartProgress.FinalPosition, Delta);\n\t\t\tNewOpacity = Delta;\n\t\t\t++i;\n\t\t}\n\n\t\tCubeVisual->SetRelativeLocation(NewPosition);\n\n\t\tif (MaterialInstance)\n\t\t{\n\t\t\tMaterialInstance->SetScalarParameterValue(\"Opacity\", NewOpacity);\n\t\t}\n\n\t}\n}\n\nvoid ADestroyableObstacle::Destroyed()\n{\n\tACubeWarsGameMode* cwgm = GetWorld()->GetAuthGameMode<ACubeWarsGameMode>();\n\tif (cwgm)\n\t{\n\t\tcwgm->ObstacleDied(ObstacleIndex);\n\t}\n}\n\nfloat ADestroyableObstacle::TakeDamage(float DamageAmount, struct FDamageEvent const& DamageEvent, class AController* EventInstigator, class AActor* DamageCauser)\n{\n\tSuper::TakeDamage(DamageAmount, DamageEvent, EventInstigator, DamageCauser);\n\n\tif (IsConstructionInProgress())\n\t{\n\t\tif (Health <= 0)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\tHealth -= DamageAmount;\n\n\n\n\t\tif (Health <= 0)\n\t\t{\n\t\t\t\/\/ Let all the parts fly around and despawn the actor\n\t\t\tClientFallApart();\n\n\t\t\tDestroy();\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Let some parts fly around\n\t\t\tClientDamageCallback(Health);\n\t\t}\n\n\t\treturn DamageAmount;\n\t}\n\n\treturn 0.0f;\n}\n\nUStaticMeshComponent* ADestroyableObstacle::CreateObstaclePart(const FVector& RelativePosition, const FVector& Scale, UStaticMesh* StaticMesh, UMaterialInstance* MatInstance, int32 Number)\n{\n\tFString VisualName(\"VisualRepresentation\");\n\tVisualName.AppendInt(Number);\n\n\tUStaticMeshComponent* CubeVisual = CreateDefaultSubobject<UStaticMeshComponent>(FName(*VisualName));\n\tCubeVisual->AttachTo(RootComponent);\n\tCubeVisual->SetCollisionEnabled(ECollisionEnabled::NoCollision);\n\tCubeVisual->SetCollisionProfileName(TEXT(\"Obstacle\"));\n\tCubeVisual->SetSimulatePhysics(false);\n\tCubeVisual->SetRelativeLocation(RelativePosition);\n\tCubeVisual->SetStaticMesh(StaticMesh);\n\tCubeVisual->SetWorldScale3D(Scale);\n\tCubeVisual->SetMaterial(0, MatInstance);\n\n\t\/\/ Initialize the struct for the construction of th obstacle (some values (FinalPosition and TotalTime) will be recalculated, in BeginPlay, when the values from the blueprint are known)\n\tPartConstructionProgress PartConstruction(RelativePosition, RelativePosition, CubeVisual, nullptr, 1.0f);\n\tConstructionProgresses.Add(PartConstruction);\n\n\treturn CubeVisual;\n}\n\nvoid ADestroyableObstacle::ClientDamageCallback_Implementation(float NewHealth)\n{\n\tif (!IsRunningDedicatedServer())\n\t{\n\t\tconst int32 NUM_TOTAL_FALLOFF_PARTS = ((NumPartColumns * NUM_PARTS_PER_COLUMN) * 3) \/ 4;\n\t\tint32 RemainingParts = static_cast<int32>(NUM_TOTAL_FALLOFF_PARTS * (NewHealth \/ MaxHealth));\n\n\t\tint32 NumPartsToFallOff = FMath::Max(0, FallOffParts.Num() - RemainingParts);\n\n\t\tFRandomStream RandStream;\n\t\tRandStream.GenerateNewSeed();\n\n\t\tfor (int32 i = 0; i < NumPartsToFallOff; ++i)\n\t\t{\n\t\t\tint32 Index = RandStream.RandRange(0, FallOffParts.Num() - 1);\n\n\t\t\tUStaticMeshComponent* PartVisual = FallOffParts[Index];\n\t\t\tFallOffParts.RemoveAt(Index);\n\t\t\t\n\t\t\tCreateDebris(PartVisual);\n\t\t}\n\t}\n}\n\nvoid ADestroyableObstacle::ClientFallApart_Implementation()\n{\n\tfor (int32 i = 0; i < FallOffParts.Num(); ++i)\n\t{\n\t\tUStaticMeshComponent* PartVisual = FallOffParts[i];\n\t\tCreateDebris(PartVisual);\n\t}\n\tFallOffParts.Empty();\n\n\tfor (int32 i = 0; i < FixedParts.Num(); ++i)\n\t{\n\t\tUStaticMeshComponent* PartVisual = FixedParts[i];\n\t\tCreateDebris(PartVisual);\n\t}\n\tFixedParts.Empty();\n}\n\nvoid ADestroyableObstacle::CreateDebris(UStaticMeshComponent* PartVisual)\n{\n\t\/\/ Destroy the component...\n\tUWorld* const World = GetWorld();\n\tPartVisual->DestroyComponent();\n\n\t\/\/ ...and spawn the actors instead\n\tFVector Impulse;\n\tconst FVector& ActorLocation = GetActorLocation();\n\tFVector Location(ActorLocation.X + PartVisual->RelativeLocation.X, ActorLocation.Y + PartVisual->RelativeLocation.Y, ActorLocation.Z + PartVisual->RelativeLocation.Z);\n\tFActorSpawnParameters SpawnInfo;\n\n\tImpulse = PartVisual->RelativeLocation;\n\tImpulse.Normalize();\n\tImpulse *= ExplosionForce;\n\n\t\/\/ Location and Rotation is not correctly set here, but getting the location and rotation from the component in world space does not work?\n\tACubeDebris* debris = World->SpawnActor<ACubeDebris>(DebrisClass, Location, GetActorRotation(), SpawnInfo);\n\tdebris->SetReplicates(false);\n\tdebris->SetActorScale3D(PartVisual->GetComponentScale());\n\n\tdebris->CubeVisual->AddImpulse(Impulse);\n\n\tFLinearColor PartColor;\n\n\tif (PartVisual->GetMaterial(0)->GetVectorParameterValue(\"Base Color\", PartColor))\n\t{\n\t\tdebris->SetDebrisColor(PartColor);\n\t}\n}\n\nvoid ADestroyableObstacle::GetLifetimeReplicatedProps(TArray<FLifetimeProperty>& OutLifetimeProps) const\n{\n\tSuper::GetLifetimeReplicatedProps(OutLifetimeProps);\n\n\tDOREPLIFETIME(ADestroyableObstacle, Health);\n}<commit_msg>Fixed the crash-to-desktop-bug<commit_after>\/\/ Fill out your copyright notice in the Description page of Project Settings.\n\n#include \"CubeWars.h\"\n#include \"DestroyableObstacle.h\"\n#include \"CubeDebris.h\"\n#include \"ObstacleMovementComponent.h\"\n#include \"Net\/UnrealNetwork.h\"\n#include \"CubeWarsGameMode.h\"\n\nnamespace {\n\tconst FVector CUBE_DIMENSIONS(20.0f, 20.0f, 20.0f);\n\tconst int32 NUM_PARTS_PER_COLUMN = 4;\n}\n\n\/\/ Sets default values\nADestroyableObstacle::ADestroyableObstacle()\n\t: MinConstructionTime(0.5f)\n\t, MaxConstructionTime(1.0f)\n\t, MinConstructionDistanceMultiplier(2.0f)\n\t, MaxConstructionDistanceMultiplier(3.0f)\n\t, NumPartColumns(5)\n\t, Dimensions(20.0f, 300.0f, 50.0f)\n\t, ExplosionForce(5000.0f)\n\t, MaxHealth(26.0f)\n\t, Health(MaxHealth)\n\t, TotalConstructionTime(MaxConstructionTime)\n\t, ConstructionTimer(0.0f)\n\t, FinalPartMaterial(nullptr)\n{\n\t\/\/ Set this actor to call Tick() every frame.  You can turn this off to improve performance if you don't need it.\n\tPrimaryActorTick.bCanEverTick = true;\n\n\t\/\/ Basic setup\n\tbReplicates = true;\n\tbReplicateMovement = true;\n\n\tBaseCollisionComponent = CreateDefaultSubobject<UBoxComponent>(TEXT(\"RootComponent\"));\n\tRootComponent = BaseCollisionComponent;\n\t\/\/BaseCollisionComponent->InitBoxExtent(FVector(10.0f));\n\tBaseCollisionComponent->SetBoxExtent(Dimensions \/ 2.0f, true);\n\tBaseCollisionComponent->SetCollisionProfileName(TEXT(\"Obstacle\"));\n\tBaseCollisionComponent->SetCollisionEnabled(ECollisionEnabled::QueryAndPhysics);\n\tBaseCollisionComponent->SetSimulatePhysics(false);\n\n\t\/\/ Add the visual representations\n\t\/\/The mesh is 20x20x20 -> match the parts to be the size of Dimensions in total\n\tconst FVector DIMENSION_RATIO = Dimensions \/ CUBE_DIMENSIONS;\n\tconst float CENTER_WIDTH = Dimensions.Y - (Dimensions.Y \/ NumPartColumns);\n\tconst float X_OFFSET = Dimensions.X \/ 4.0f;\n\tconst float Z_OFFSET = Dimensions.Z \/ 4.0f;\n\n\tFVector PartScale(DIMENSION_RATIO.X \/ 2.0f, (Dimensions.Y \/ NumPartColumns) \/ CUBE_DIMENSIONS.Y, DIMENSION_RATIO.Z \/ 2.0f);\n\n\t{\n\t\t\/\/ Create and position a mesh component so we can see where our cube is\n\t\tstatic ConstructorHelpers::FObjectFinder<UStaticMesh> CubeVisualAsset(TEXT(\"\/Game\/Meshes\/SimpleCube.SimpleCube\"));\n\t\tif (CubeVisualAsset.Succeeded())\n\t\t{\n\t\t\tstatic ConstructorHelpers::FObjectFinder<UMaterialInstance> Material(TEXT(\"\/Game\/Materials\/QuadraticTransparent.QuadraticTransparent\"));\n\n\t\t\tif (Material.Succeeded())\n\t\t\t{\n\t\t\t\tfor (int32 i = 0; i < NumPartColumns; ++i)\n\t\t\t\t{\n\t\t\t\t\tconst float CENTER_Y = CENTER_WIDTH * (i \/ static_cast<float>(NumPartColumns - 1)) - CENTER_WIDTH \/ 2.0f;\n\n\t\t\t\t\tTArray<UStaticMeshComponent*> NewVisuals;\n\n\t\t\t\t\tNewVisuals.Add(CreateObstaclePart(FVector(X_OFFSET, CENTER_Y, Z_OFFSET), PartScale, CubeVisualAsset.Object, Material.Object, i * NUM_PARTS_PER_COLUMN));\n\t\t\t\t\tNewVisuals.Add(CreateObstaclePart(FVector(X_OFFSET, CENTER_Y, -Z_OFFSET), PartScale, CubeVisualAsset.Object, Material.Object, i * NUM_PARTS_PER_COLUMN + 1));\n\t\t\t\t\tNewVisuals.Add(CreateObstaclePart(FVector(-X_OFFSET, CENTER_Y, -Z_OFFSET), PartScale, CubeVisualAsset.Object, Material.Object, i * NUM_PARTS_PER_COLUMN + 2));\n\t\t\t\t\tNewVisuals.Add(CreateObstaclePart(FVector(-X_OFFSET, CENTER_Y, Z_OFFSET), PartScale, CubeVisualAsset.Object, Material.Object, i * NUM_PARTS_PER_COLUMN + 3));\n\n\t\t\t\t\tFRandomStream RandStream;\n\t\t\t\t\tRandStream.GenerateNewSeed();\n\n\t\t\t\t\t\/\/ First determine the parts that can fall off\n\t\t\t\t\tint32 Index = RandStream.RandRange(0, 3);\n\t\t\t\t\tFallOffParts.Add(NewVisuals[Index]);\n\t\t\t\t\tNewVisuals.RemoveAt(Index);\n\n\t\t\t\t\tIndex = RandStream.RandRange(0, 2);\n\t\t\t\t\tFallOffParts.Add(NewVisuals[Index]);\n\t\t\t\t\tNewVisuals.RemoveAt(Index);\n\n\t\t\t\t\tIndex = RandStream.RandRange(0, 1);\n\t\t\t\t\tFallOffParts.Add(NewVisuals[Index]);\n\t\t\t\t\tNewVisuals.RemoveAt(Index);\n\n\t\t\t\t\t\/\/ Now the fixed parts\n\t\t\t\t\tFixedParts.Append(NewVisuals);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tUE_LOG(LogTemp, Warning, TEXT(\"Cannot find '\/Game\/Materials\/QuadraticTransparent.QuadraticTransparent'!\"));\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tUE_LOG(LogTemp, Warning, TEXT(\"Cannot find '\/Game\/Meshes\/SimpleCube.SimpleCube'!\"));\n\t\t}\n\t}\n\n\t\/\/ Load the material FinalPartMaterial\n\tstatic ConstructorHelpers::FObjectFinder<UMaterialInstance> Material(TEXT(\"\/Game\/Materials\/Quadratic.Quadratic\"));\n\tif (Material.Succeeded())\n\t{\n\t\tFinalPartMaterial = Material.Object;\n\t}\n\telse\n\t{\n\t\tUE_LOG(LogTemp, Warning, TEXT(\"Cannot find '\/Game\/Materials\/Quadratic.Quadratic'!\"));\n\t}\n\n\t\/\/ Movement component\n\tMovementComponent = CreateDefaultSubobject<UObstacleMovementComponent>(TEXT(\"ObstacleMovement\"));\n\tMovementComponent->UpdatedComponent = RootComponent;\n}\n\n\/\/ Called when the game starts or when spawned\nvoid ADestroyableObstacle::BeginPlay()\n{\n\tSuper::BeginPlay();\n\n\tTotalConstructionTime = MaxConstructionTime;\n\n\t\/\/ Initialize the construction structs for the parts of the obstacle\n\tFRandomStream Rand;\n\tfor (int32 i = 0; i < ConstructionProgresses.Num(); ++i)\n\t{\n\t\tPartConstructionProgress& PartProgress = ConstructionProgresses[i];\n\t\tPartProgress.StartPosition = PartProgress.FinalPosition * Rand.FRandRange(MinConstructionDistanceMultiplier, MaxConstructionDistanceMultiplier);\n\t\tPartProgress.TotalTime = Rand.FRandRange(MinConstructionTime, MaxConstructionTime);\n\n\t\tUMaterialInstanceDynamic* MaterialInstance = PartProgress.CubeVisual->CreateDynamicMaterialInstance(0);\n\t\tPartProgress.CubeVisual->SetMaterial(0, MaterialInstance);\n\t\tPartProgress.MaterialInstance = MaterialInstance;\n\t\tMaterialInstance->SetScalarParameterValue(\"Opacity\", 0.0f);\n\t}\n}\n\n\/\/ Called every frame\nvoid ADestroyableObstacle::Tick( float DeltaTime )\n{\n\tif(!this->IsValidLowLevel() || IsActorBeingDestroyed())\n\t\treturn;\n\n\tSuper::Tick( DeltaTime );\n\n\tfor (int32 i = 0; i < ConstructionProgresses.Num();)\n\t{\n\t\tPartConstructionProgress& PartProgress = ConstructionProgresses[i];\n\t\tPartProgress.CurrentTime += DeltaTime;\n\n\t\tUStaticMeshComponent* CubeVisual = PartProgress.CubeVisual;\n\t\tUMaterialInstanceDynamic* MaterialInstance = PartProgress.MaterialInstance;\n\t\tFVector NewPosition;\n\t\tfloat NewOpacity;\n\n\t\tif (PartProgress.CurrentTime >= PartProgress.TotalTime)\n\t\t{\n\t\t\tNewPosition = PartProgress.FinalPosition;\n\t\t\tNewOpacity = 1.0f;\n\t\t\tConstructionProgresses.RemoveAt(i);\n\n\t\t\tif (FinalPartMaterial)\n\t\t\t{\n\t\t\t\tCubeVisual->SetMaterial(0, FinalPartMaterial);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfloat Delta = PartProgress.CurrentTime \/ PartProgress.TotalTime;\n\t\t\tNewPosition = FMath::Lerp(PartProgress.StartPosition, PartProgress.FinalPosition, Delta);\n\t\t\tNewOpacity = Delta;\n\t\t\t++i;\n\t\t}\n\n\t\tCubeVisual->SetRelativeLocation(NewPosition);\n\n\t\tif (MaterialInstance)\n\t\t{\n\t\t\tMaterialInstance->SetScalarParameterValue(\"Opacity\", NewOpacity);\n\t\t}\n\n\t}\n}\n\nvoid ADestroyableObstacle::Destroyed()\n{\n\tACubeWarsGameMode* cwgm = GetWorld()->GetAuthGameMode<ACubeWarsGameMode>();\n\tif (cwgm)\n\t{\n\t\tcwgm->ObstacleDied(ObstacleIndex);\n\t}\n}\n\nfloat ADestroyableObstacle::TakeDamage(float DamageAmount, struct FDamageEvent const& DamageEvent, class AController* EventInstigator, class AActor* DamageCauser)\n{\n\tSuper::TakeDamage(DamageAmount, DamageEvent, EventInstigator, DamageCauser);\n\n\tif (IsConstructionInProgress())\n\t{\n\t\tif (Health <= 0)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\tHealth -= DamageAmount;\n\n\n\n\t\tif (Health <= 0)\n\t\t{\n\t\t\t\/\/ Let all the parts fly around and despawn the actor\n\t\t\tClientFallApart();\n\n\t\t\tDestroy();\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Let some parts fly around\n\t\t\tClientDamageCallback(Health);\n\t\t}\n\n\t\treturn DamageAmount;\n\t}\n\n\treturn 0.0f;\n}\n\nUStaticMeshComponent* ADestroyableObstacle::CreateObstaclePart(const FVector& RelativePosition, const FVector& Scale, UStaticMesh* StaticMesh, UMaterialInstance* MatInstance, int32 Number)\n{\n\tFString VisualName(\"VisualRepresentation\");\n\tVisualName.AppendInt(Number);\n\n\tUStaticMeshComponent* CubeVisual = CreateDefaultSubobject<UStaticMeshComponent>(FName(*VisualName));\n\tCubeVisual->AttachTo(RootComponent);\n\tCubeVisual->SetCollisionEnabled(ECollisionEnabled::NoCollision);\n\tCubeVisual->SetCollisionProfileName(TEXT(\"Obstacle\"));\n\tCubeVisual->SetSimulatePhysics(false);\n\tCubeVisual->SetRelativeLocation(RelativePosition);\n\tCubeVisual->SetStaticMesh(StaticMesh);\n\tCubeVisual->SetWorldScale3D(Scale);\n\tCubeVisual->SetMaterial(0, MatInstance);\n\n\t\/\/ Initialize the struct for the construction of th obstacle (some values (FinalPosition and TotalTime) will be recalculated, in BeginPlay, when the values from the blueprint are known)\n\tPartConstructionProgress PartConstruction(RelativePosition, RelativePosition, CubeVisual, nullptr, 1.0f);\n\tConstructionProgresses.Add(PartConstruction);\n\n\treturn CubeVisual;\n}\n\nvoid ADestroyableObstacle::ClientDamageCallback_Implementation(float NewHealth)\n{\n\tif (!IsRunningDedicatedServer())\n\t{\n\t\tconst int32 NUM_TOTAL_FALLOFF_PARTS = ((NumPartColumns * NUM_PARTS_PER_COLUMN) * 3) \/ 4;\n\t\tint32 RemainingParts = static_cast<int32>(NUM_TOTAL_FALLOFF_PARTS * (NewHealth \/ MaxHealth));\n\n\t\tint32 NumPartsToFallOff = FMath::Max(0, FallOffParts.Num() - RemainingParts);\n\n\t\tFRandomStream RandStream;\n\t\tRandStream.GenerateNewSeed();\n\n\t\tfor (int32 i = 0; i < NumPartsToFallOff; ++i)\n\t\t{\n\t\t\tint32 Index = RandStream.RandRange(0, FallOffParts.Num() - 1);\n\n\t\t\tUStaticMeshComponent* PartVisual = FallOffParts[Index];\n\t\t\tFallOffParts.RemoveAt(Index);\n\t\t\t\n\t\t\tCreateDebris(PartVisual);\n\t\t}\n\t}\n}\n\nvoid ADestroyableObstacle::ClientFallApart_Implementation()\n{\n\tfor (int32 i = 0; i < FallOffParts.Num(); ++i)\n\t{\n\t\tUStaticMeshComponent* PartVisual = FallOffParts[i];\n\t\tCreateDebris(PartVisual);\n\t}\n\tFallOffParts.Empty();\n\n\tfor (int32 i = 0; i < FixedParts.Num(); ++i)\n\t{\n\t\tUStaticMeshComponent* PartVisual = FixedParts[i];\n\t\tCreateDebris(PartVisual);\n\t}\n\tFixedParts.Empty();\n}\n\nvoid ADestroyableObstacle::CreateDebris(UStaticMeshComponent* PartVisual)\n{\n\t\/\/ Destroy the component...\n\tUWorld* const World = GetWorld();\n\tPartVisual->DestroyComponent();\n\n\t\/\/ ...and spawn the actors instead\n\tFVector Impulse;\n\tconst FVector& ActorLocation = GetActorLocation();\n\tFVector Location(ActorLocation.X + PartVisual->RelativeLocation.X, ActorLocation.Y + PartVisual->RelativeLocation.Y, ActorLocation.Z + PartVisual->RelativeLocation.Z);\n\tFActorSpawnParameters SpawnInfo;\n\n\tImpulse = PartVisual->RelativeLocation;\n\tImpulse.Normalize();\n\tImpulse *= ExplosionForce;\n\n\t\/\/ Location and Rotation is not correctly set here, but getting the location and rotation from the component in world space does not work?\n\tACubeDebris* debris = World->SpawnActor<ACubeDebris>(DebrisClass, Location, GetActorRotation(), SpawnInfo);\n\tdebris->SetReplicates(false);\n\tdebris->SetActorScale3D(PartVisual->GetComponentScale());\n\n\tdebris->CubeVisual->AddImpulse(Impulse);\n\n\tFLinearColor PartColor;\n\n\tif (PartVisual->GetMaterial(0)->GetVectorParameterValue(\"Base Color\", PartColor))\n\t{\n\t\tdebris->SetDebrisColor(PartColor);\n\t}\n}\n\nvoid ADestroyableObstacle::GetLifetimeReplicatedProps(TArray<FLifetimeProperty>& OutLifetimeProps) const\n{\n\tSuper::GetLifetimeReplicatedProps(OutLifetimeProps);\n\n\tDOREPLIFETIME(ADestroyableObstacle, Health);\n}<|endoftext|>"}
{"text":"<commit_before>#include \"ServerZone.h\"\n\n#include <Version.h>\n#include <Logging\/Logger.h>\n#include <Config\/ConfigMgr.h>\n\n#include <MySqlBase.h>\n#include <Connection.h>\n\n#include <Network\/Connection.h>\n#include <Network\/Hive.h>\n\n#include <Exd\/ExdDataGenerated.h>\n#include <Network\/PacketContainer.h>\n#include <Database\/DatabaseDef.h>\n#include <Util\/Util.h>\n\n#include \"Actor\/Player.h\"\n#include \"Actor\/BNpcTemplate.h\"\n\n#include \"Network\/GameConnection.h\"\n#include \"Session.h\"\n\n#include \"Zone\/TerritoryMgr.h\"\n\n#include \"Script\/ScriptMgr.h\"\n#include \"Linkshell\/LinkshellMgr.h\"\n\n#include \"ForwardsZone.h\"\n\n#include <boost\/make_shared.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <thread>\n\n#include \"Framework.h\"\n\nextern Core::Framework g_fw;\n\nCore::ServerZone::ServerZone( const std::string& configName ) :\n  m_configName( configName ),\n  m_bRunning( true ),\n  m_lastDBPingTime( 0 )\n{\n}\n\nCore::ServerZone::~ServerZone()\n{\n}\n\nsize_t Core::ServerZone::getSessionCount() const\n{\n  return m_sessionMapById.size();\n}\n\nbool Core::ServerZone::loadSettings( int32_t argc, char* argv[] )\n{\n  auto pLog = g_fw.get< Core::Logger >();\n  auto pConfig = g_fw.get< Core::ConfigMgr >();\n  auto pExd = g_fw.get< Data::ExdDataGenerated >();\n  auto pDb = g_fw.get< Db::DbWorkerPool< Db::ZoneDbConnection > >();\n\n  pLog->info( \"Loading config \" + m_configName );\n\n  if( !pConfig->loadConfig( m_configName ) )\n  {\n    pLog->fatal( \"Error loading config \" + m_configName );\n    return false;\n  }\n\n  std::vector< std::string > args( argv + 1, argv + argc );\n  for( uint32_t i = 0; i + 1 < args.size(); i += 2 )\n  {\n    std::string arg( \"\" );\n    std::string val( \"\" );\n\n    try\n    {\n      arg = boost::to_lower_copy( std::string( args[ i ] ) );\n      val = std::string( args[ i + 1 ] );\n\n      \/\/ trim '-' from start of arg\n      arg = arg.erase( 0, arg.find_first_not_of( '-' ) );\n\n      if( arg == \"ip\" )\n      {\n        \/\/ todo: ip addr in config\n        pConfig->setValue< std::string >( \"ZoneNetwork.ListenIp\", val );\n      }\n      else if( arg == \"p\" || arg == \"port\" )\n      {\n        pConfig->setValue< std::string >( \"ZoneNetwork.ListenPort\", val );\n      }\n      else if( arg == \"exdpath\" || arg == \"datapath\" )\n      {\n        pConfig->setValue< std::string >( \"GlobalParameters.DataPath\", val );\n      }\n      else if( arg == \"h\" || arg == \"dbhost\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Host\", val );\n      }\n      else if( arg == \"dbport\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Port\", val );\n      }\n      else if( arg == \"u\" || arg == \"user\" || arg == \"dbuser\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Username\", val );\n      }\n      else if( arg == \"pass\" || arg == \"dbpass\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Password\", val );\n      }\n      else if( arg == \"d\" || arg == \"db\" || arg == \"database\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Database\", val );\n      }\n    }\n    catch( ... )\n    {\n      pLog->error( \"Error parsing argument: \" + arg + \" \" + \"value: \" + val + \"\\n\" );\n      pLog->error( \"Usage: <arg> <val> \\n\" );\n    }\n  }\n\n  pLog->info( \"Setting up generated EXD data\" );\n  if( !pExd->init( pConfig->getValue< std::string >( \"GlobalParameters.DataPath\", \"\" ) ) )\n  {\n    pLog->fatal( \"Error setting up generated EXD data \" );\n    return false;\n  }\n\n  Core::Db::DbLoader loader;\n\n  Core::Db::ConnectionInfo info;\n  info.password = pConfig->getValue< std::string >( \"Database.Password\", \"\" );\n  info.host = pConfig->getValue< std::string >( \"Database.Host\", \"127.0.0.1\" );\n  info.database = pConfig->getValue< std::string >( \"Database.Database\", \"sapphire\" );\n  info.port = pConfig->getValue< uint16_t >( \"Database.Port\", 3306 );\n  info.user = pConfig->getValue< std::string >( \"Database.Username\", \"root\" );\n  info.syncThreads = pConfig->getValue< uint8_t >( \"Database.SyncThreads\", 2 );\n  info.asyncThreads = pConfig->getValue< uint8_t >( \"Database.AsyncThreads\", 2 );\n\n  loader.addDb( *pDb, info );\n  if( !loader.initDbs() )\n    return false;\n\n  m_port = pConfig->getValue< uint16_t >( \"ZoneNetwork.ListenPort\", 54992 );\n  m_ip = pConfig->getValue< std::string >( \"ZoneNetwork.ListenIp\", \"0.0.0.0\" );\n\n  return true;\n}\n\nvoid Core::ServerZone::run( int32_t argc, char* argv[] )\n{\n  auto pLog = g_fw.get< Core::Logger >();\n  auto pScript = g_fw.get< Scripting::ScriptMgr >();\n  auto pLsMgr = g_fw.get< LinkshellMgr >();\n  auto pTeriMgr = g_fw.get< TerritoryMgr >();\n\n  printBanner();\n\n  if( !loadSettings( argc, argv ) )\n  {\n    pLog->fatal( \"Unable to load settings!\" );\n    return;\n  }\n\n  pLog->info( \"LinkshellMgr: Caching linkshells\" );\n  if( !pLsMgr->loadLinkshells() )\n  {\n    pLog->fatal( \"Unable to load linkshells!\" );\n    return;\n  }\n\n  Network::HivePtr hive( new Network::Hive() );\n  Network::addServerToHive< Network::GameConnection >( m_ip, m_port, hive );\n\n  pScript->init();\n\n  pLog->info( \"TerritoryMgr: Setting up zones\" );\n  pTeriMgr->init();\n\n  loadBNpcTemplates();\n\n  std::vector< std::thread > thread_list;\n  thread_list.emplace_back( std::thread( std::bind( &Network::Hive::Run, hive.get() ) ) );\n\n  pLog->info( \"Zone server running on \" + m_ip + \":\" + std::to_string( m_port ) );\n\n  mainLoop();\n\n  for( auto& thread_entry : thread_list )\n  {\n    thread_entry.join();\n  }\n\n}\n\nvoid Core::ServerZone::printBanner() const\n{\n  auto pLog = g_fw.get< Core::Logger >();\n\n  pLog->info( \"===========================================================\" );\n  pLog->info( \"Sapphire Server Project \" );\n  pLog->info( \"Version: \" + Version::VERSION );\n  pLog->info( \"Git Hash: \" + Version::GIT_HASH );\n  pLog->info( \"Compiled: \" __DATE__ \" \" __TIME__ );\n  pLog->info( \"===========================================================\" );\n}\n\nvoid Core::ServerZone::mainLoop()\n{\n  auto pLog = g_fw.get< Logger >();\n  auto pTeriMgr = g_fw.get< TerritoryMgr >();\n  auto pScriptMgr = g_fw.get< Scripting::ScriptMgr >();\n  auto pDb = g_fw.get< Db::DbWorkerPool< Db::ZoneDbConnection > >();\n\n  while( isRunning() )\n  {\n    std::this_thread::sleep_for( std::chrono::milliseconds( 50 ) );\n\n    auto currTime = Util::getTimeSeconds();\n\n    pTeriMgr->updateTerritoryInstances( currTime );\n\n    pScriptMgr->update();\n\n    std::lock_guard< std::mutex > lock( m_sessionMutex );\n    for( auto sessionIt : m_sessionMapById )\n    {\n      auto session = sessionIt.second;\n      if( session && session->getPlayer() )\n      {\n\n        \/\/ if the player is in a zone, let the zone handler take care of his updates\n        \/\/ else do it here.\n        if( !session->getPlayer()->getCurrentZone() )\n          session->update();\n\n      }\n    }\n\n    if( currTime - m_lastDBPingTime > 3 )\n    {\n      pDb->keepAlive();\n      m_lastDBPingTime = currTime;\n    }\n\n\n    auto it = m_sessionMapById.begin();\n    for( ; it != m_sessionMapById.end(); )\n    {\n      auto diff = std::difftime( currTime, it->second->getLastDataTime() );\n\n      auto pPlayer = it->second->getPlayer();\n\n      \/\/ remove session of players marked for removel ( logoff \/ kick )\n      if( pPlayer->isMarkedForRemoval() && diff > 5 )\n      {\n        it->second->close();\n        \/\/ if( it->second.unique() )\n        {\n          pLog->info( \"[\" + std::to_string( it->second->getId() ) + \"] Session removal\" );\n          it = m_sessionMapById.erase( it );\n          removeSession( pPlayer->getName() );\n          continue;\n        }\n      }\n\n      \/\/ remove sessions that simply timed out\n      if( diff > 20 )\n      {\n        pLog->info( \"[\" + std::to_string( it->second->getId() ) + \"] Session time out\" );\n\n        it->second->close();\n        \/\/ if( it->second.unique() )\n        {\n          it = m_sessionMapById.erase( it );\n          removeSession( pPlayer->getName() );\n        }\n      }\n      else\n      {\n        ++it;\n      }\n\n    }\n\n  }\n}\n\nbool Core::ServerZone::createSession( uint32_t sessionId )\n{\n  auto pLog = g_fw.get< Core::Logger >();\n\n  std::lock_guard< std::mutex > lock( m_sessionMutex );\n\n  const std::string session_id_str = std::to_string( sessionId );\n\n  auto it = m_sessionMapById.find( sessionId );\n\n  if( it != m_sessionMapById.end() )\n  {\n    pLog->error( \"[\" + session_id_str + \"] Error creating session\" );\n    return false;\n  }\n\n  pLog->info( \"[\" + session_id_str + \"] Creating new session\" );\n\n  boost::shared_ptr< Session > newSession( new Session( sessionId ) );\n  m_sessionMapById[ sessionId ] = newSession;\n\n  if( !newSession->loadPlayer() )\n  {\n    pLog->error( \"[\" + session_id_str + \"] Error loading player \" + session_id_str );\n    return false;\n  }\n\n  m_sessionMapByName[ newSession->getPlayer()->getName() ] = newSession;\n\n  return true;\n\n}\n\nvoid Core::ServerZone::removeSession( uint32_t sessionId )\n{\n  m_sessionMapById.erase( sessionId );\n}\n\nCore::SessionPtr Core::ServerZone::getSession( uint32_t id )\n{\n  \/\/std::lock_guard<std::mutex> lock( m_sessionMutex );\n\n  auto it = m_sessionMapById.find( id );\n\n  if( it != m_sessionMapById.end() )\n    return ( it->second );\n\n  return nullptr;\n}\n\nCore::SessionPtr Core::ServerZone::getSession( const std::string& playerName )\n{\n  \/\/std::lock_guard<std::mutex> lock( m_sessionMutex );\n\n  auto it = m_sessionMapByName.find( playerName );\n\n  if( it != m_sessionMapByName.end() )\n    return ( it->second );\n\n  return nullptr;\n}\n\nvoid Core::ServerZone::removeSession( const std::string& playerName )\n{\n  m_sessionMapByName.erase( playerName );\n}\n\n\nbool Core::ServerZone::isRunning() const\n{\n  return m_bRunning;\n}\n\nvoid Core::ServerZone::loadBNpcTemplates()\n{\n  auto pDb = g_fw.get< Db::DbWorkerPool< Db::ZoneDbConnection > >();\n  auto pTeriMgr = g_fw.get< TerritoryMgr >();\n  auto pLog = g_fw.get< Logger >();\n\n  auto stmt = pDb->getPreparedStatement( Db::ZoneDbStatements::ZONE_SEL_BNPCTEMPLATES );\n\n  auto res = pDb->query( stmt );\n\n  while( res->next() )\n  {\n    \/\/Id, Name, bNPCBaseId, bNPCNameId, mainWeaponModel,\n    \/\/secWeaponModel, aggressionMode, enemyType, pose,\n    \/\/modelChara, displayFlags, Look, Models\n\n    auto id = res->getUInt( 1 );\n    auto name = res->getString( 2 );\n    auto bNPCBaseId = res->getUInt( 3 );\n    auto bNPCNameId = res->getUInt( 4 );\n    auto mainWeaponModel = res->getUInt64( 5 );\n    auto secWeaponModel = res->getUInt64( 6 );\n    auto aggressionMode = res->getUInt8( 7 );\n    auto enemyType = res->getUInt8( 8 );\n    auto pose = res->getUInt8( 9 );\n    auto modelChara = res->getUInt( 10 );\n    auto displayFlags = res->getUInt( 11 );\n    auto look = res->getBlobVector( 12 );\n    auto models = res->getBlobVector( 13 );\n\n    auto bnpcTemplate = boost::make_shared< Entity::BNpcTemplate >(\n                                              id, bNPCBaseId, bNPCNameId, mainWeaponModel, secWeaponModel,\n                                              aggressionMode, enemyType, 0, pose, modelChara, displayFlags,\n                                              reinterpret_cast< uint32_t* >( &models[ 0 ] ),\n                                              reinterpret_cast< uint8_t* >( &look[ 0 ] ) );\n\n    m_bNpcTemplateMap[ name ] = bnpcTemplate;\n  }\n\n  pLog->debug( \"BNpc Templates loaded: \" + std::to_string( m_bNpcTemplateMap.size() ) );\n\n}\n\nCore::Entity::BNpcTemplatePtr Core::ServerZone::getBNpcTemplate( const std::string& key )\n{\n  auto it = m_bNpcTemplateMap.find( key );\n\n  if( it == m_bNpcTemplateMap.end() )\n    return nullptr;\n\n  return it->second;\n}\n\nCore::Entity::BNpcTemplatePtr Core::ServerZone::getBNpcTemplate( uint32_t id )\n{\n  for( auto entry : m_bNpcTemplateMap )\n  {\n    if( entry.second->getId() == id )\n      return entry.second;\n  }\n\n  return nullptr;\n}\n<commit_msg>Also include boost to_lower stuff<commit_after>#include \"ServerZone.h\"\n\n#include <Version.h>\n#include <Logging\/Logger.h>\n#include <Config\/ConfigMgr.h>\n\n#include <MySqlBase.h>\n#include <Connection.h>\n\n#include <Network\/Connection.h>\n#include <Network\/Hive.h>\n\n#include <Exd\/ExdDataGenerated.h>\n#include <Network\/PacketContainer.h>\n#include <Database\/DatabaseDef.h>\n#include <Util\/Util.h>\n\n#include \"Actor\/Player.h\"\n#include \"Actor\/BNpcTemplate.h\"\n\n#include \"Network\/GameConnection.h\"\n#include \"Session.h\"\n\n#include \"Zone\/TerritoryMgr.h\"\n\n#include \"Script\/ScriptMgr.h\"\n#include \"Linkshell\/LinkshellMgr.h\"\n\n#include \"ForwardsZone.h\"\n\n#include <boost\/make_shared.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/algorithm\/string\/case_conv.hpp>\n#include <thread>\n\n#include \"Framework.h\"\n\nextern Core::Framework g_fw;\n\nCore::ServerZone::ServerZone( const std::string& configName ) :\n  m_configName( configName ),\n  m_bRunning( true ),\n  m_lastDBPingTime( 0 )\n{\n}\n\nCore::ServerZone::~ServerZone()\n{\n}\n\nsize_t Core::ServerZone::getSessionCount() const\n{\n  return m_sessionMapById.size();\n}\n\nbool Core::ServerZone::loadSettings( int32_t argc, char* argv[] )\n{\n  auto pLog = g_fw.get< Core::Logger >();\n  auto pConfig = g_fw.get< Core::ConfigMgr >();\n  auto pExd = g_fw.get< Data::ExdDataGenerated >();\n  auto pDb = g_fw.get< Db::DbWorkerPool< Db::ZoneDbConnection > >();\n\n  pLog->info( \"Loading config \" + m_configName );\n\n  if( !pConfig->loadConfig( m_configName ) )\n  {\n    pLog->fatal( \"Error loading config \" + m_configName );\n    return false;\n  }\n\n  std::vector< std::string > args( argv + 1, argv + argc );\n  for( uint32_t i = 0; i + 1 < args.size(); i += 2 )\n  {\n    std::string arg( \"\" );\n    std::string val( \"\" );\n\n    try\n    {\n      arg = boost::to_lower_copy( std::string( args[ i ] ) );\n      val = std::string( args[ i + 1 ] );\n\n      \/\/ trim '-' from start of arg\n      arg = arg.erase( 0, arg.find_first_not_of( '-' ) );\n\n      if( arg == \"ip\" )\n      {\n        \/\/ todo: ip addr in config\n        pConfig->setValue< std::string >( \"ZoneNetwork.ListenIp\", val );\n      }\n      else if( arg == \"p\" || arg == \"port\" )\n      {\n        pConfig->setValue< std::string >( \"ZoneNetwork.ListenPort\", val );\n      }\n      else if( arg == \"exdpath\" || arg == \"datapath\" )\n      {\n        pConfig->setValue< std::string >( \"GlobalParameters.DataPath\", val );\n      }\n      else if( arg == \"h\" || arg == \"dbhost\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Host\", val );\n      }\n      else if( arg == \"dbport\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Port\", val );\n      }\n      else if( arg == \"u\" || arg == \"user\" || arg == \"dbuser\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Username\", val );\n      }\n      else if( arg == \"pass\" || arg == \"dbpass\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Password\", val );\n      }\n      else if( arg == \"d\" || arg == \"db\" || arg == \"database\" )\n      {\n        pConfig->setValue< std::string >( \"Database.Database\", val );\n      }\n    }\n    catch( ... )\n    {\n      pLog->error( \"Error parsing argument: \" + arg + \" \" + \"value: \" + val + \"\\n\" );\n      pLog->error( \"Usage: <arg> <val> \\n\" );\n    }\n  }\n\n  pLog->info( \"Setting up generated EXD data\" );\n  if( !pExd->init( pConfig->getValue< std::string >( \"GlobalParameters.DataPath\", \"\" ) ) )\n  {\n    pLog->fatal( \"Error setting up generated EXD data \" );\n    return false;\n  }\n\n  Core::Db::DbLoader loader;\n\n  Core::Db::ConnectionInfo info;\n  info.password = pConfig->getValue< std::string >( \"Database.Password\", \"\" );\n  info.host = pConfig->getValue< std::string >( \"Database.Host\", \"127.0.0.1\" );\n  info.database = pConfig->getValue< std::string >( \"Database.Database\", \"sapphire\" );\n  info.port = pConfig->getValue< uint16_t >( \"Database.Port\", 3306 );\n  info.user = pConfig->getValue< std::string >( \"Database.Username\", \"root\" );\n  info.syncThreads = pConfig->getValue< uint8_t >( \"Database.SyncThreads\", 2 );\n  info.asyncThreads = pConfig->getValue< uint8_t >( \"Database.AsyncThreads\", 2 );\n\n  loader.addDb( *pDb, info );\n  if( !loader.initDbs() )\n    return false;\n\n  m_port = pConfig->getValue< uint16_t >( \"ZoneNetwork.ListenPort\", 54992 );\n  m_ip = pConfig->getValue< std::string >( \"ZoneNetwork.ListenIp\", \"0.0.0.0\" );\n\n  return true;\n}\n\nvoid Core::ServerZone::run( int32_t argc, char* argv[] )\n{\n  auto pLog = g_fw.get< Core::Logger >();\n  auto pScript = g_fw.get< Scripting::ScriptMgr >();\n  auto pLsMgr = g_fw.get< LinkshellMgr >();\n  auto pTeriMgr = g_fw.get< TerritoryMgr >();\n\n  printBanner();\n\n  if( !loadSettings( argc, argv ) )\n  {\n    pLog->fatal( \"Unable to load settings!\" );\n    return;\n  }\n\n  pLog->info( \"LinkshellMgr: Caching linkshells\" );\n  if( !pLsMgr->loadLinkshells() )\n  {\n    pLog->fatal( \"Unable to load linkshells!\" );\n    return;\n  }\n\n  Network::HivePtr hive( new Network::Hive() );\n  Network::addServerToHive< Network::GameConnection >( m_ip, m_port, hive );\n\n  pScript->init();\n\n  pLog->info( \"TerritoryMgr: Setting up zones\" );\n  pTeriMgr->init();\n\n  loadBNpcTemplates();\n\n  std::vector< std::thread > thread_list;\n  thread_list.emplace_back( std::thread( std::bind( &Network::Hive::Run, hive.get() ) ) );\n\n  pLog->info( \"Zone server running on \" + m_ip + \":\" + std::to_string( m_port ) );\n\n  mainLoop();\n\n  for( auto& thread_entry : thread_list )\n  {\n    thread_entry.join();\n  }\n\n}\n\nvoid Core::ServerZone::printBanner() const\n{\n  auto pLog = g_fw.get< Core::Logger >();\n\n  pLog->info( \"===========================================================\" );\n  pLog->info( \"Sapphire Server Project \" );\n  pLog->info( \"Version: \" + Version::VERSION );\n  pLog->info( \"Git Hash: \" + Version::GIT_HASH );\n  pLog->info( \"Compiled: \" __DATE__ \" \" __TIME__ );\n  pLog->info( \"===========================================================\" );\n}\n\nvoid Core::ServerZone::mainLoop()\n{\n  auto pLog = g_fw.get< Logger >();\n  auto pTeriMgr = g_fw.get< TerritoryMgr >();\n  auto pScriptMgr = g_fw.get< Scripting::ScriptMgr >();\n  auto pDb = g_fw.get< Db::DbWorkerPool< Db::ZoneDbConnection > >();\n\n  while( isRunning() )\n  {\n    std::this_thread::sleep_for( std::chrono::milliseconds( 50 ) );\n\n    auto currTime = Util::getTimeSeconds();\n\n    pTeriMgr->updateTerritoryInstances( currTime );\n\n    pScriptMgr->update();\n\n    std::lock_guard< std::mutex > lock( m_sessionMutex );\n    for( auto sessionIt : m_sessionMapById )\n    {\n      auto session = sessionIt.second;\n      if( session && session->getPlayer() )\n      {\n\n        \/\/ if the player is in a zone, let the zone handler take care of his updates\n        \/\/ else do it here.\n        if( !session->getPlayer()->getCurrentZone() )\n          session->update();\n\n      }\n    }\n\n    if( currTime - m_lastDBPingTime > 3 )\n    {\n      pDb->keepAlive();\n      m_lastDBPingTime = currTime;\n    }\n\n\n    auto it = m_sessionMapById.begin();\n    for( ; it != m_sessionMapById.end(); )\n    {\n      auto diff = std::difftime( currTime, it->second->getLastDataTime() );\n\n      auto pPlayer = it->second->getPlayer();\n\n      \/\/ remove session of players marked for removel ( logoff \/ kick )\n      if( pPlayer->isMarkedForRemoval() && diff > 5 )\n      {\n        it->second->close();\n        \/\/ if( it->second.unique() )\n        {\n          pLog->info( \"[\" + std::to_string( it->second->getId() ) + \"] Session removal\" );\n          it = m_sessionMapById.erase( it );\n          removeSession( pPlayer->getName() );\n          continue;\n        }\n      }\n\n      \/\/ remove sessions that simply timed out\n      if( diff > 20 )\n      {\n        pLog->info( \"[\" + std::to_string( it->second->getId() ) + \"] Session time out\" );\n\n        it->second->close();\n        \/\/ if( it->second.unique() )\n        {\n          it = m_sessionMapById.erase( it );\n          removeSession( pPlayer->getName() );\n        }\n      }\n      else\n      {\n        ++it;\n      }\n\n    }\n\n  }\n}\n\nbool Core::ServerZone::createSession( uint32_t sessionId )\n{\n  auto pLog = g_fw.get< Core::Logger >();\n\n  std::lock_guard< std::mutex > lock( m_sessionMutex );\n\n  const std::string session_id_str = std::to_string( sessionId );\n\n  auto it = m_sessionMapById.find( sessionId );\n\n  if( it != m_sessionMapById.end() )\n  {\n    pLog->error( \"[\" + session_id_str + \"] Error creating session\" );\n    return false;\n  }\n\n  pLog->info( \"[\" + session_id_str + \"] Creating new session\" );\n\n  boost::shared_ptr< Session > newSession( new Session( sessionId ) );\n  m_sessionMapById[ sessionId ] = newSession;\n\n  if( !newSession->loadPlayer() )\n  {\n    pLog->error( \"[\" + session_id_str + \"] Error loading player \" + session_id_str );\n    return false;\n  }\n\n  m_sessionMapByName[ newSession->getPlayer()->getName() ] = newSession;\n\n  return true;\n\n}\n\nvoid Core::ServerZone::removeSession( uint32_t sessionId )\n{\n  m_sessionMapById.erase( sessionId );\n}\n\nCore::SessionPtr Core::ServerZone::getSession( uint32_t id )\n{\n  \/\/std::lock_guard<std::mutex> lock( m_sessionMutex );\n\n  auto it = m_sessionMapById.find( id );\n\n  if( it != m_sessionMapById.end() )\n    return ( it->second );\n\n  return nullptr;\n}\n\nCore::SessionPtr Core::ServerZone::getSession( const std::string& playerName )\n{\n  \/\/std::lock_guard<std::mutex> lock( m_sessionMutex );\n\n  auto it = m_sessionMapByName.find( playerName );\n\n  if( it != m_sessionMapByName.end() )\n    return ( it->second );\n\n  return nullptr;\n}\n\nvoid Core::ServerZone::removeSession( const std::string& playerName )\n{\n  m_sessionMapByName.erase( playerName );\n}\n\n\nbool Core::ServerZone::isRunning() const\n{\n  return m_bRunning;\n}\n\nvoid Core::ServerZone::loadBNpcTemplates()\n{\n  auto pDb = g_fw.get< Db::DbWorkerPool< Db::ZoneDbConnection > >();\n  auto pTeriMgr = g_fw.get< TerritoryMgr >();\n  auto pLog = g_fw.get< Logger >();\n\n  auto stmt = pDb->getPreparedStatement( Db::ZoneDbStatements::ZONE_SEL_BNPCTEMPLATES );\n\n  auto res = pDb->query( stmt );\n\n  while( res->next() )\n  {\n    \/\/Id, Name, bNPCBaseId, bNPCNameId, mainWeaponModel,\n    \/\/secWeaponModel, aggressionMode, enemyType, pose,\n    \/\/modelChara, displayFlags, Look, Models\n\n    auto id = res->getUInt( 1 );\n    auto name = res->getString( 2 );\n    auto bNPCBaseId = res->getUInt( 3 );\n    auto bNPCNameId = res->getUInt( 4 );\n    auto mainWeaponModel = res->getUInt64( 5 );\n    auto secWeaponModel = res->getUInt64( 6 );\n    auto aggressionMode = res->getUInt8( 7 );\n    auto enemyType = res->getUInt8( 8 );\n    auto pose = res->getUInt8( 9 );\n    auto modelChara = res->getUInt( 10 );\n    auto displayFlags = res->getUInt( 11 );\n    auto look = res->getBlobVector( 12 );\n    auto models = res->getBlobVector( 13 );\n\n    auto bnpcTemplate = boost::make_shared< Entity::BNpcTemplate >(\n                                              id, bNPCBaseId, bNPCNameId, mainWeaponModel, secWeaponModel,\n                                              aggressionMode, enemyType, 0, pose, modelChara, displayFlags,\n                                              reinterpret_cast< uint32_t* >( &models[ 0 ] ),\n                                              reinterpret_cast< uint8_t* >( &look[ 0 ] ) );\n\n    m_bNpcTemplateMap[ name ] = bnpcTemplate;\n  }\n\n  pLog->debug( \"BNpc Templates loaded: \" + std::to_string( m_bNpcTemplateMap.size() ) );\n\n}\n\nCore::Entity::BNpcTemplatePtr Core::ServerZone::getBNpcTemplate( const std::string& key )\n{\n  auto it = m_bNpcTemplateMap.find( key );\n\n  if( it == m_bNpcTemplateMap.end() )\n    return nullptr;\n\n  return it->second;\n}\n\nCore::Entity::BNpcTemplatePtr Core::ServerZone::getBNpcTemplate( uint32_t id )\n{\n  for( auto entry : m_bNpcTemplateMap )\n  {\n    if( entry.second->getId() == id )\n      return entry.second;\n  }\n\n  return nullptr;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- ProfileInfo.cpp - Represents profile information -------------------===\/\/\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 ProfileInfo class is used to represent profiling information read in from\n\/\/ the dump file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ProfileInfo.h\"\n#include \"llvm\/Module.h\"\n#include <iostream>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <stdio.h>\n\nusing namespace llvm;\n\nenum ProfilingType {\n  ArgumentInfo = 1,   \/\/ The command line argument block\n  FunctionInfo = 2,   \/\/ Function profiling information\n  BlockInfo    = 3,   \/\/ Block profiling information\n};\n\n\/\/ ByteSwap - Byteswap 'Var' if 'Really' is true.\n\/\/\nstatic inline unsigned ByteSwap(unsigned Var, bool Really) {\n  if (!Really) return Var;\n  return ((Var & (255<< 0)) << 24) | \n         ((Var & (255<< 8)) <<  8) | \n         ((Var & (255<<16)) >>  8) | \n         ((Var & (255<<24)) >> 24);\n}\n\nstatic void ReadProfilingBlock(const char *ToolName, FILE *F,\n                               bool ShouldByteSwap,\n                               std::vector<unsigned> &Data) {\n  \/\/ Read the number of entries...\n  unsigned NumEntries;\n  if (fread(&NumEntries, sizeof(unsigned), 1, F) != 1) {\n    std::cerr << ToolName << \": data packet truncated!\\n\";\n    perror(0);\n    exit(1);\n  }\n  NumEntries = ByteSwap(NumEntries, ShouldByteSwap);\n\n  \/\/ Read the counts...\n  std::vector<unsigned> TempSpace(NumEntries);\n\n  \/\/ Read in the block of data...\n  if (fread(&TempSpace[0], sizeof(unsigned)*NumEntries, 1, F) != 1) {\n    std::cerr << ToolName << \": data packet truncated!\\n\";\n    perror(0);\n    exit(1);\n  }\n\n  \/\/ Make sure we have enough space...\n  if (Data.size() < NumEntries)\n    Data.resize(NumEntries);\n  \n  \/\/ Accumulate the data we just read into the data.\n  if (!ShouldByteSwap) {\n    for (unsigned i = 0; i != NumEntries; ++i)\n      Data[i] += TempSpace[i];\n  } else {\n    for (unsigned i = 0; i != NumEntries; ++i)\n      Data[i] += ByteSwap(TempSpace[i], true);\n  }\n}\n\n\/\/ ProfileInfo ctor - Read the specified profiling data file, exiting the\n\/\/ program if the file is invalid or broken.\n\/\/\nProfileInfo::ProfileInfo(const char *ToolName, const std::string &Filename,\n                         Module &TheModule) : M(TheModule) {\n  FILE *F = fopen(Filename.c_str(), \"r\");\n  if (F == 0) {\n    std::cerr << ToolName << \": Error opening '\" << Filename << \": \";\n    perror(0);\n    exit(1);\n  }\n\n  \/\/ Keep reading packets until we run out of them.\n  unsigned PacketType;\n  while (fread(&PacketType, sizeof(unsigned), 1, F) == 1) {\n    \/\/ If the low eight bits of the packet are zero, we must be dealing with an\n    \/\/ endianness mismatch.  Byteswap all words read from the profiling\n    \/\/ information.\n    bool ShouldByteSwap = (char)PacketType == 0;\n    PacketType = ByteSwap(PacketType, ShouldByteSwap);\n\n    switch (PacketType) {\n    case ArgumentInfo: {\n      unsigned ArgLength;\n      if (fread(&ArgLength, sizeof(unsigned), 1, F) != 1) {\n        std::cerr << ToolName << \": arguments packet truncated!\\n\";\n        perror(0);\n        exit(1);\n      }\n      ArgLength = ByteSwap(ArgLength, ShouldByteSwap);\n\n      \/\/ Read in the arguments...\n      std::vector<char> Chars(ArgLength+4);\n\n      if (ArgLength)\n        if (fread(&Chars[0], (ArgLength+3) & ~3, 1, F) != 1) {\n          std::cerr << ToolName << \": arguments packet truncated!\\n\";\n          perror(0);\n          exit(1);\n        }\n      CommandLines.push_back(std::string(&Chars[0], &Chars[ArgLength]));\n      break;\n    }\n      \n    case FunctionInfo:\n      ReadProfilingBlock(ToolName, F, ShouldByteSwap, FunctionCounts);\n      break;\n      \n    case BlockInfo:\n      ReadProfilingBlock(ToolName, F, ShouldByteSwap, BlockCounts);\n      break;\n\n    default:\n      std::cerr << ToolName << \": Unknown packet type #\" << PacketType << \"!\\n\";\n      exit(1);\n    }\n  }\n  \n  fclose(F);\n}\n\n\n\/\/ getFunctionCounts - This method is used by consumers of function counting\n\/\/ information.  If we do not directly have function count information, we\n\/\/ compute it from other, more refined, types of profile information.\n\/\/\nvoid ProfileInfo::getFunctionCounts(std::vector<std::pair<Function*,\n                                                         unsigned> > &Counts) {\n  if (FunctionCounts.empty()) {\n    \/\/ Synthesize function frequency information from the number of times their\n    \/\/ entry blocks were executed.\n    std::vector<std::pair<BasicBlock*, unsigned> > BlockCounts;\n    getBlockCounts(BlockCounts);\n\n    for (unsigned i = 0, e = BlockCounts.size(); i != e; ++i)\n      if (&BlockCounts[i].first->getParent()->front() == BlockCounts[i].first)\n        Counts.push_back(std::make_pair(BlockCounts[i].first->getParent(),\n                                        BlockCounts[i].second));\n    return;\n  }\n  \n  unsigned Counter = 0;\n  for (Module::iterator I = M.begin(), E = M.end();\n       I != E && Counter != FunctionCounts.size(); ++I)\n    if (!I->isExternal())\n      Counts.push_back(std::make_pair(I, FunctionCounts[Counter++]));\n}\n\n\/\/ getBlockCounts - This method is used by consumers of block counting\n\/\/ information.  If we do not directly have block count information, we\n\/\/ compute it from other, more refined, types of profile information.\n\/\/\nvoid ProfileInfo::getBlockCounts(std::vector<std::pair<BasicBlock*,\n                                                       unsigned> > &Counts) {\n  if (BlockCounts.empty()) {\n    std::cerr << \"Block counts not available, and no synthesis \"\n              << \"is implemented yet!\\n\";\n    return;\n  }\n\n  unsigned Counter = 0;\n  for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)\n    for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {\n      Counts.push_back(std::make_pair(BB, BlockCounts[Counter++]));\n      if (Counter == BlockCounts.size())\n        return;\n    }\n}\n<commit_msg>Remove some pointless #includes<commit_after>\/\/===- ProfileInfo.cpp - Represents profile information -------------------===\/\/\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 ProfileInfo class is used to represent profiling information read in from\n\/\/ the dump file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ProfileInfo.h\"\n#include \"llvm\/Module.h\"\n#include <cstdio>\nusing namespace llvm;\n\nenum ProfilingType {\n  ArgumentInfo = 1,   \/\/ The command line argument block\n  FunctionInfo = 2,   \/\/ Function profiling information\n  BlockInfo    = 3,   \/\/ Block profiling information\n};\n\n\/\/ ByteSwap - Byteswap 'Var' if 'Really' is true.\n\/\/\nstatic inline unsigned ByteSwap(unsigned Var, bool Really) {\n  if (!Really) return Var;\n  return ((Var & (255<< 0)) << 24) | \n         ((Var & (255<< 8)) <<  8) | \n         ((Var & (255<<16)) >>  8) | \n         ((Var & (255<<24)) >> 24);\n}\n\nstatic void ReadProfilingBlock(const char *ToolName, FILE *F,\n                               bool ShouldByteSwap,\n                               std::vector<unsigned> &Data) {\n  \/\/ Read the number of entries...\n  unsigned NumEntries;\n  if (fread(&NumEntries, sizeof(unsigned), 1, F) != 1) {\n    std::cerr << ToolName << \": data packet truncated!\\n\";\n    perror(0);\n    exit(1);\n  }\n  NumEntries = ByteSwap(NumEntries, ShouldByteSwap);\n\n  \/\/ Read the counts...\n  std::vector<unsigned> TempSpace(NumEntries);\n\n  \/\/ Read in the block of data...\n  if (fread(&TempSpace[0], sizeof(unsigned)*NumEntries, 1, F) != 1) {\n    std::cerr << ToolName << \": data packet truncated!\\n\";\n    perror(0);\n    exit(1);\n  }\n\n  \/\/ Make sure we have enough space...\n  if (Data.size() < NumEntries)\n    Data.resize(NumEntries);\n  \n  \/\/ Accumulate the data we just read into the data.\n  if (!ShouldByteSwap) {\n    for (unsigned i = 0; i != NumEntries; ++i)\n      Data[i] += TempSpace[i];\n  } else {\n    for (unsigned i = 0; i != NumEntries; ++i)\n      Data[i] += ByteSwap(TempSpace[i], true);\n  }\n}\n\n\/\/ ProfileInfo ctor - Read the specified profiling data file, exiting the\n\/\/ program if the file is invalid or broken.\n\/\/\nProfileInfo::ProfileInfo(const char *ToolName, const std::string &Filename,\n                         Module &TheModule) : M(TheModule) {\n  FILE *F = fopen(Filename.c_str(), \"r\");\n  if (F == 0) {\n    std::cerr << ToolName << \": Error opening '\" << Filename << \": \";\n    perror(0);\n    exit(1);\n  }\n\n  \/\/ Keep reading packets until we run out of them.\n  unsigned PacketType;\n  while (fread(&PacketType, sizeof(unsigned), 1, F) == 1) {\n    \/\/ If the low eight bits of the packet are zero, we must be dealing with an\n    \/\/ endianness mismatch.  Byteswap all words read from the profiling\n    \/\/ information.\n    bool ShouldByteSwap = (char)PacketType == 0;\n    PacketType = ByteSwap(PacketType, ShouldByteSwap);\n\n    switch (PacketType) {\n    case ArgumentInfo: {\n      unsigned ArgLength;\n      if (fread(&ArgLength, sizeof(unsigned), 1, F) != 1) {\n        std::cerr << ToolName << \": arguments packet truncated!\\n\";\n        perror(0);\n        exit(1);\n      }\n      ArgLength = ByteSwap(ArgLength, ShouldByteSwap);\n\n      \/\/ Read in the arguments...\n      std::vector<char> Chars(ArgLength+4);\n\n      if (ArgLength)\n        if (fread(&Chars[0], (ArgLength+3) & ~3, 1, F) != 1) {\n          std::cerr << ToolName << \": arguments packet truncated!\\n\";\n          perror(0);\n          exit(1);\n        }\n      CommandLines.push_back(std::string(&Chars[0], &Chars[ArgLength]));\n      break;\n    }\n      \n    case FunctionInfo:\n      ReadProfilingBlock(ToolName, F, ShouldByteSwap, FunctionCounts);\n      break;\n      \n    case BlockInfo:\n      ReadProfilingBlock(ToolName, F, ShouldByteSwap, BlockCounts);\n      break;\n\n    default:\n      std::cerr << ToolName << \": Unknown packet type #\" << PacketType << \"!\\n\";\n      exit(1);\n    }\n  }\n  \n  fclose(F);\n}\n\n\n\/\/ getFunctionCounts - This method is used by consumers of function counting\n\/\/ information.  If we do not directly have function count information, we\n\/\/ compute it from other, more refined, types of profile information.\n\/\/\nvoid ProfileInfo::getFunctionCounts(std::vector<std::pair<Function*,\n                                                         unsigned> > &Counts) {\n  if (FunctionCounts.empty()) {\n    \/\/ Synthesize function frequency information from the number of times their\n    \/\/ entry blocks were executed.\n    std::vector<std::pair<BasicBlock*, unsigned> > BlockCounts;\n    getBlockCounts(BlockCounts);\n\n    for (unsigned i = 0, e = BlockCounts.size(); i != e; ++i)\n      if (&BlockCounts[i].first->getParent()->front() == BlockCounts[i].first)\n        Counts.push_back(std::make_pair(BlockCounts[i].first->getParent(),\n                                        BlockCounts[i].second));\n    return;\n  }\n  \n  unsigned Counter = 0;\n  for (Module::iterator I = M.begin(), E = M.end();\n       I != E && Counter != FunctionCounts.size(); ++I)\n    if (!I->isExternal())\n      Counts.push_back(std::make_pair(I, FunctionCounts[Counter++]));\n}\n\n\/\/ getBlockCounts - This method is used by consumers of block counting\n\/\/ information.  If we do not directly have block count information, we\n\/\/ compute it from other, more refined, types of profile information.\n\/\/\nvoid ProfileInfo::getBlockCounts(std::vector<std::pair<BasicBlock*,\n                                                       unsigned> > &Counts) {\n  if (BlockCounts.empty()) {\n    std::cerr << \"Block counts not available, and no synthesis \"\n              << \"is implemented yet!\\n\";\n    return;\n  }\n\n  unsigned Counter = 0;\n  for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)\n    for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {\n      Counts.push_back(std::make_pair(BB, BlockCounts[Counter++]));\n      if (Counter == BlockCounts.size())\n        return;\n    }\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 = \"040184710fa689ad5023690c80f3a49c8f13f8d45b8c857fbcbc8bc4a8e4d3eb4b10f4d4604fa08dce601aaf0f470216fe1b51850b4acf21b179c45070ac7b03a9\";\nstatic const char* pszTestKey = \"04302390343f91cc401d56d68b123028bf52e5fca1939df127f63c6467cdf9c8e2c14b61104cf817d0b780da337893ecc4aaff1309e536162dabbdb45200ca2b0a\";\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>updated alert keys<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 = \"048240a8748a80a286b270ba126705ced4f2ce5a7847b3610ea3c06513150dade2a8512ed5ea86320824683fc0818f0ac019214973e677acd1244f6d0571fc5103\";\nstatic const char* pszTestKey = \"04517d8a699cb43d3938d7b24faaff7cda448ca4ea267723ba614784de661949bf632d6304316b244646dea079735b9a6fc4af804efb4752075b9fe2245e14e412\";\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    Copyright (C) 2007-2008 Tanguy Krotoff <tkrotoff@gmail.com>\n    Copyright (C) 2008 Lukas Durfina <lukas.durfina@gmail.com>\n    Copyright (C) 2009 Fathi Boudra <fabo@kde.org>\n    Copyright (C) 2009-2011 vlc-phonon AUTHORS\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 \"backend.h\"\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QLatin1Literal>\n#include <QtCore\/QLibrary>\n#include <QtCore\/QSet>\n#include <QtCore\/QSettings>\n#include <QtCore\/QStringBuilder>\n#include <QtCore\/QtPlugin>\n#include <QtCore\/QVariant>\n#include <QtGui\/QMessageBox>\n\n#include <phonon\/GlobalDescriptionContainer>\n#ifdef PHONON_PULSESUPPORT\n#include <phonon\/pulsesupport.h>\n#endif\n\n#include <vlc\/libvlc_version.h>\n#include <vlc\/vlc.h>\n\n#include \"audio\/audiooutput.h\"\n#include \"audio\/audiodataoutput.h\"\n#include \"utils\/debug.h\"\n#include \"devicemanager.h\"\n#include \"effect.h\"\n#include \"effectmanager.h\"\n#include \"utils\/libvlc.h\"\n#include \"mediaobject.h\"\n#include \"sinknode.h\"\n\/\/#include \"video\/videodataoutput.h\"\n#include \"video\/videowidget.h\"\n\nQ_EXPORT_PLUGIN2(phonon_vlc, Phonon::VLC::Backend)\n\nnamespace Phonon\n{\nnamespace VLC\n{\n\nBackend *Backend::self;\n\nBackend::Backend(QObject *parent, const QVariantList &)\n    : QObject(parent)\n    , m_deviceManager(0)\n    , m_effectManager(0)\n{\n    self = this;\n\n    \/\/ Backend information properties\n    setProperty(\"identifier\",     QLatin1String(\"phonon_vlc\"));\n    setProperty(\"backendName\",    QLatin1String(\"VLC\"));\n    setProperty(\"backendComment\", QLatin1String(\"VLC backend for Phonon\"));\n    setProperty(\"backendVersion\", QLatin1String(PHONON_VLC_VERSION));\n    setProperty(\"backendIcon\",    QLatin1String(\"vlc\"));\n    setProperty(\"backendWebsite\", QLatin1String(\"https:\/\/projects.kde.org\/projects\/kdesupport\/phonon\/phonon-vlc\"));\n\n    \/\/ Check if we should enable debug output\n    int debugLevel = qgetenv(\"PHONON_VLC_DEBUG\").toInt();\n    if (debugLevel > 3) { \/\/ 3 is maximum\n        debugLevel = 3;\n    }\n    Debug::setMinimumDebugLevel((Debug::DebugLevel)((int) Debug::DEBUG_NONE - 1 - debugLevel));\n\n    \/\/ Actual libVLC initialisation\n    if (LibVLC::init()) {\n        debug() << \"Using VLC version %0\" << libvlc_get_version();\n    } else {\n#ifdef __GNUC__\n#warning TODO - this error message is about as useful as a cooling unit in the arctic\n#warning TODO - supposedly Phonon VLC should not make kabooom if libvlc fails to init, probably impossible though\n#endif\n        QMessageBox msg;\n        msg.setIcon(QMessageBox::Critical);\n        msg.setWindowTitle(tr(\"LibVLC failed to initialize\"));\n        msg.setText(tr(\"Phonon's VLC backend failed to start.\"\n                       \"\\n\\n\"\n                       \"This usually means a problem with your VLC installation,\"\n                       \" please report a bug with your distributor.\"));\n        msg.setDetailedText(LibVLC::errorMessage());\n        msg.exec();\n        fatal() << \"Phonon::VLC::vlcInit: Failed to initialize VLC\";\n    }\n\n    m_deviceManager = new DeviceManager(this);\n    m_effectManager = new EffectManager(this);\n\n#ifdef PHONON_PULSESUPPORT\n    \/\/ Initialise PulseAudio support\n    PulseSupport *pulse = PulseSupport::getInstance();\n    pulse->enable();\n    connect(pulse, SIGNAL(objectDescriptionChanged(ObjectDescriptionType)),\n            SIGNAL(objectDescriptionChanged(ObjectDescriptionType)));\n#endif\n}\n\nBackend::~Backend()\n{\n    if (LibVLC::self)\n        delete LibVLC::self;\n    if (GlobalAudioChannels::self)\n        delete GlobalAudioChannels::self;\n    if (GlobalSubtitles::self)\n        delete GlobalSubtitles::self;\n#ifdef PHONON_PULSESUPPORT\n    PulseSupport::shutdown();\n#endif\n}\n\nQObject *Backend::createObject(BackendInterface::Class c, QObject *parent, const QList<QVariant> &args)\n{\n    if (!LibVLC::self || !libvlc)\n        return 0;\n\n    switch (c) {\n    case MediaObjectClass:\n        return new MediaObject(parent);\n    case AudioOutputClass:\n        return new AudioOutput(parent);\n    case AudioDataOutputClass:\n        return new AudioDataOutput(parent);\n    case EffectClass:\n        return new Effect(m_effectManager, args[0].toInt(), parent);\n    case VideoWidgetClass:\n        return new VideoWidget(qobject_cast<QWidget *>(parent));\n    }\n\n    warning() << \"Backend class\" << c << \"is not supported by Phonon VLC :(\";\n    return 0;\n}\n\nQStringList Backend::availableMimeTypes() const\n{\n    if (m_supportedMimeTypes.isEmpty()) {\n        const_cast<Backend *>(this)->m_supportedMimeTypes\n                << QLatin1String(\"application\/ogg\")\n                << QLatin1String(\"application\/x-ogg\")\n                << QLatin1String(\"application\/vnd.rn-realmedia\")\n                << QLatin1String(\"application\/x-annodex\")\n                << QLatin1String(\"application\/x-flash-video\")\n                << QLatin1String(\"application\/x-quicktimeplayer\")\n                << QLatin1String(\"application\/x-extension-mp4\")\n                << QLatin1String(\"audio\/168sv\")\n                << QLatin1String(\"audio\/3gpp\")\n                << QLatin1String(\"audio\/3gpp2\")\n                << QLatin1String(\"audio\/8svx\")\n                << QLatin1String(\"audio\/aiff\")\n                << QLatin1String(\"audio\/amr\")\n                << QLatin1String(\"audio\/amr-wb\")\n                << QLatin1String(\"audio\/basic\")\n                << QLatin1String(\"audio\/mp3\")\n                << QLatin1String(\"audio\/mp4\")\n                << QLatin1String(\"audio\/midi\")\n                << QLatin1String(\"audio\/mpeg\")\n                << QLatin1String(\"audio\/mpeg2\")\n                << QLatin1String(\"audio\/mpeg3\")\n                << QLatin1String(\"audio\/vnd.rn-realaudio\")\n                << QLatin1String(\"audio\/vnd.rn-realmedia\")\n                << QLatin1String(\"audio\/wav\")\n                << QLatin1String(\"audio\/webm\")\n                << QLatin1String(\"audio\/x-16sv\")\n                << QLatin1String(\"audio\/x-8svx\")\n                << QLatin1String(\"audio\/x-aiff\")\n                << QLatin1String(\"audio\/x-basic\")\n                << QLatin1String(\"audio\/x-it\")\n                << QLatin1String(\"audio\/x-m4a\")\n                << QLatin1String(\"audio\/x-matroska\")\n                << QLatin1String(\"audio\/x-mp3\")\n                << QLatin1String(\"audio\/x-mpeg\")\n                << QLatin1String(\"audio\/x-mpeg2\")\n                << QLatin1String(\"audio\/x-mpeg3\")\n                << QLatin1String(\"audio\/x-mpegurl\")\n                << QLatin1String(\"audio\/x-ms-wma\")\n                << QLatin1String(\"audio\/x-ogg\")\n                << QLatin1String(\"audio\/x-pn-aiff\")\n                << QLatin1String(\"audio\/x-pn-au\")\n                << QLatin1String(\"audio\/x-pn-realaudio-plugin\")\n                << QLatin1String(\"audio\/x-pn-wav\")\n                << QLatin1String(\"audio\/x-pn-windows-acm\")\n                << QLatin1String(\"audio\/x-real-audio\")\n                << QLatin1String(\"audio\/x-realaudio\")\n                << QLatin1String(\"audio\/x-s3m\")\n                << QLatin1String(\"audio\/x-speex+ogg\")\n                << QLatin1String(\"audio\/x-vorbis+ogg\")\n                << QLatin1String(\"audio\/x-wav\")\n                << QLatin1String(\"audio\/x-xm\")\n                << QLatin1String(\"image\/ilbm\")\n                << QLatin1String(\"image\/png\")\n                << QLatin1String(\"image\/x-ilbm\")\n                << QLatin1String(\"image\/x-png\")\n                << QLatin1String(\"video\/3gpp\")\n                << QLatin1String(\"video\/3gpp2\")\n                << QLatin1String(\"video\/anim\")\n                << QLatin1String(\"video\/avi\")\n                << QLatin1String(\"video\/divx\")\n                << QLatin1String(\"video\/flv\")\n                << QLatin1String(\"video\/mkv\")\n                << QLatin1String(\"video\/mng\")\n                << QLatin1String(\"video\/mp4\")\n                << QLatin1String(\"video\/mpeg\")\n                << QLatin1String(\"video\/mpeg-system\")\n                << QLatin1String(\"video\/mpg\")\n                << QLatin1String(\"video\/msvideo\")\n                << QLatin1String(\"video\/ogg\")\n                << QLatin1String(\"video\/quicktime\")\n                << QLatin1String(\"video\/webm\")\n                << QLatin1String(\"video\/x-anim\")\n                << QLatin1String(\"video\/x-flic\")\n                << QLatin1String(\"video\/x-flv\")\n                << QLatin1String(\"video\/x-matroska\")\n                << QLatin1String(\"video\/x-mng\")\n                << QLatin1String(\"video\/x-m4v\")\n                << QLatin1String(\"video\/x-mpeg\")\n                << QLatin1String(\"video\/x-mpeg-system\")\n                << QLatin1String(\"video\/x-ms-asf\")\n                << QLatin1String(\"video\/x-ms-wma\")\n                << QLatin1String(\"video\/x-ms-wmv\")\n                << QLatin1String(\"video\/x-ms-wvx\")\n                << QLatin1String(\"video\/x-msvideo\")\n                << QLatin1String(\"video\/x-quicktime\")\n                << QLatin1String(\"audio\/x-flac\")\n                << QLatin1String(\"audio\/x-ape\");\n    }\n    return m_supportedMimeTypes;\n}\n\nQList<int> Backend::objectDescriptionIndexes(ObjectDescriptionType type) const\n{\n    QList<int> list;\n\n    switch (type) {\n    case Phonon::AudioChannelType: {\n        list << GlobalAudioChannels::instance()->globalIndexes();\n    }\n    break;\n    case Phonon::AudioOutputDeviceType:\n    case Phonon::AudioCaptureDeviceType:\n    case Phonon::VideoCaptureDeviceType: {\n        return deviceManager()->deviceIds(type);\n    }\n    break;\n    case Phonon::EffectType: {\n        QList<EffectInfo *> effectList = effectManager()->effects();\n        for (int eff = 0; eff < effectList.size(); ++eff) {\n            list.append(eff);\n        }\n    }\n    break;\n    case Phonon::SubtitleType: {\n        list << GlobalSubtitles::instance()->globalIndexes();\n    }\n    break;\n    }\n\n    return list;\n}\n\nQHash<QByteArray, QVariant> Backend::objectDescriptionProperties(ObjectDescriptionType type, int index) const\n{\n    QHash<QByteArray, QVariant> ret;\n\n    switch (type) {\n    case Phonon::AudioChannelType: {\n        const AudioChannelDescription description = GlobalAudioChannels::instance()->fromIndex(index);\n        ret.insert(\"name\", description.name());\n        ret.insert(\"description\", description.description());\n    }\n    break;\n    case Phonon::AudioOutputDeviceType:\n    case Phonon::AudioCaptureDeviceType:\n    case Phonon::VideoCaptureDeviceType: {\n        \/\/ Index should be unique, even for different categories\n        return deviceManager()->deviceProperties(index);\n    }\n    break;\n    case Phonon::EffectType: {\n        QList<EffectInfo *> effectList = effectManager()->effects();\n        if (index >= 0 && index <= effectList.size()) {\n            const EffectInfo *effect = effectList[ index ];\n            ret.insert(\"name\", effect->name());\n            ret.insert(\"description\", effect->description());\n            ret.insert(\"author\", effect->author());\n        } else {\n            Q_ASSERT(1); \/\/ Since we use list position as ID, this should not happen\n        }\n    }\n    break;\n    case Phonon::SubtitleType: {\n        const SubtitleDescription description = GlobalSubtitles::instance()->fromIndex(index);\n        ret.insert(\"name\", description.name());\n        ret.insert(\"description\", description.description());\n        ret.insert(\"type\", description.property(\"type\"));\n    }\n    break;\n    }\n\n    return ret;\n}\n\nbool Backend::startConnectionChange(QSet<QObject *> objects)\n{\n    \/\/FIXME\n    foreach(QObject * object, objects) {\n        debug() << \"Object:\" << object->metaObject()->className();\n    }\n\n    \/\/ There is nothing we can do but hope the connection changes will not take too long\n    \/\/ so that buffers would underrun\n    \/\/ But we should be pretty safe the way xine works by not doing anything here.\n    return true;\n}\n\nbool Backend::connectNodes(QObject *source, QObject *sink)\n{\n    debug() << \"Backend connected\" << source->metaObject()->className() << \"to\" << sink->metaObject()->className();\n\n    SinkNode *sinkNode = dynamic_cast<SinkNode *>(sink);\n    if (sinkNode) {\n        MediaObject *mediaObject = qobject_cast<MediaObject *>(source);\n        if (mediaObject) {\n            \/\/ Connect the SinkNode to a MediaObject\n            sinkNode->connectToMediaObject(mediaObject);\n            return true;\n        }\n\n        \/*\n        Effect *effect = qobject_cast<Effect *>(source);\n        if (effect) {\n            \/\/ FIXME connect the effect\n            return true;\n        }\n        *\/\n    }\n\n    warning() << \"Linking\" << source->metaObject()->className() << \"to\" << sink->metaObject()->className() << \"failed\";\n\n    return false;\n}\n\nbool Backend::disconnectNodes(QObject *source, QObject *sink)\n{\n    SinkNode *sinkNode = dynamic_cast<SinkNode *>(sink);\n    if (sinkNode) {\n        MediaObject *const mediaObject = qobject_cast<MediaObject *>(source);\n        if (mediaObject) {\n            \/\/ Disconnect the SinkNode from a MediaObject\n            sinkNode->disconnectFromMediaObject(mediaObject);\n            return true;\n        }\n\n        \/*\n        Effect *effect = qobject_cast<Effect *>(source);\n        if (effect) {\n            \/\/ FIXME disconnect the effect\n            return true;\n        }\n        *\/\n    }\n\n    return false;\n}\n\nbool Backend::endConnectionChange(QSet<QObject *> objects)\n{\n    foreach(QObject *object, objects) {\n        debug() << \"Object:\" << object->metaObject()->className();\n    }\n    return true;\n}\n\nDeviceManager *Backend::deviceManager() const\n{\n    return m_deviceManager;\n}\n\nEffectManager *Backend::effectManager() const\n{\n    return m_effectManager;\n}\n\n} \/\/ namespace VLC\n} \/\/ namespace Phonon\n<commit_msg>deactivate ADO for VLC >= 2 again<commit_after>\/*\n    Copyright (C) 2007-2008 Tanguy Krotoff <tkrotoff@gmail.com>\n    Copyright (C) 2008 Lukas Durfina <lukas.durfina@gmail.com>\n    Copyright (C) 2009 Fathi Boudra <fabo@kde.org>\n    Copyright (C) 2009-2011 vlc-phonon AUTHORS\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 \"backend.h\"\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QLatin1Literal>\n#include <QtCore\/QLibrary>\n#include <QtCore\/QSet>\n#include <QtCore\/QSettings>\n#include <QtCore\/QStringBuilder>\n#include <QtCore\/QtPlugin>\n#include <QtCore\/QVariant>\n#include <QtGui\/QMessageBox>\n\n#include <phonon\/GlobalDescriptionContainer>\n#ifdef PHONON_PULSESUPPORT\n#include <phonon\/pulsesupport.h>\n#endif\n\n#include <vlc\/libvlc_version.h>\n#include <vlc\/vlc.h>\n\n#include \"audio\/audiooutput.h\"\n#include \"audio\/audiodataoutput.h\"\n#include \"utils\/debug.h\"\n#include \"devicemanager.h\"\n#include \"effect.h\"\n#include \"effectmanager.h\"\n#include \"utils\/libvlc.h\"\n#include \"mediaobject.h\"\n#include \"sinknode.h\"\n\/\/#include \"video\/videodataoutput.h\"\n#include \"video\/videowidget.h\"\n\nQ_EXPORT_PLUGIN2(phonon_vlc, Phonon::VLC::Backend)\n\nnamespace Phonon\n{\nnamespace VLC\n{\n\nBackend *Backend::self;\n\nBackend::Backend(QObject *parent, const QVariantList &)\n    : QObject(parent)\n    , m_deviceManager(0)\n    , m_effectManager(0)\n{\n    self = this;\n\n    \/\/ Backend information properties\n    setProperty(\"identifier\",     QLatin1String(\"phonon_vlc\"));\n    setProperty(\"backendName\",    QLatin1String(\"VLC\"));\n    setProperty(\"backendComment\", QLatin1String(\"VLC backend for Phonon\"));\n    setProperty(\"backendVersion\", QLatin1String(PHONON_VLC_VERSION));\n    setProperty(\"backendIcon\",    QLatin1String(\"vlc\"));\n    setProperty(\"backendWebsite\", QLatin1String(\"https:\/\/projects.kde.org\/projects\/kdesupport\/phonon\/phonon-vlc\"));\n\n    \/\/ Check if we should enable debug output\n    int debugLevel = qgetenv(\"PHONON_VLC_DEBUG\").toInt();\n    if (debugLevel > 3) { \/\/ 3 is maximum\n        debugLevel = 3;\n    }\n    Debug::setMinimumDebugLevel((Debug::DebugLevel)((int) Debug::DEBUG_NONE - 1 - debugLevel));\n\n    \/\/ Actual libVLC initialisation\n    if (LibVLC::init()) {\n        debug() << \"Using VLC version %0\" << libvlc_get_version();\n    } else {\n#ifdef __GNUC__\n#warning TODO - this error message is about as useful as a cooling unit in the arctic\n#warning TODO - supposedly Phonon VLC should not make kabooom if libvlc fails to init, probably impossible though\n#endif\n        QMessageBox msg;\n        msg.setIcon(QMessageBox::Critical);\n        msg.setWindowTitle(tr(\"LibVLC failed to initialize\"));\n        msg.setText(tr(\"Phonon's VLC backend failed to start.\"\n                       \"\\n\\n\"\n                       \"This usually means a problem with your VLC installation,\"\n                       \" please report a bug with your distributor.\"));\n        msg.setDetailedText(LibVLC::errorMessage());\n        msg.exec();\n        fatal() << \"Phonon::VLC::vlcInit: Failed to initialize VLC\";\n    }\n\n    m_deviceManager = new DeviceManager(this);\n    m_effectManager = new EffectManager(this);\n\n#ifdef PHONON_PULSESUPPORT\n    \/\/ Initialise PulseAudio support\n    PulseSupport *pulse = PulseSupport::getInstance();\n    pulse->enable();\n    connect(pulse, SIGNAL(objectDescriptionChanged(ObjectDescriptionType)),\n            SIGNAL(objectDescriptionChanged(ObjectDescriptionType)));\n#endif\n}\n\nBackend::~Backend()\n{\n    if (LibVLC::self)\n        delete LibVLC::self;\n    if (GlobalAudioChannels::self)\n        delete GlobalAudioChannels::self;\n    if (GlobalSubtitles::self)\n        delete GlobalSubtitles::self;\n#ifdef PHONON_PULSESUPPORT\n    PulseSupport::shutdown();\n#endif\n}\n\nQObject *Backend::createObject(BackendInterface::Class c, QObject *parent, const QList<QVariant> &args)\n{\n    if (!LibVLC::self || !libvlc)\n        return 0;\n\n    switch (c) {\n    case MediaObjectClass:\n        return new MediaObject(parent);\n    case AudioOutputClass:\n        return new AudioOutput(parent);\n#ifdef __GNUC__\n#warning VLC 2.0 broke sout\/transcode\/smem -> ADO\n#endif\n#if (LIBVLC_VERSION_INT < LIBVLC_VERSION(2, 0, 0, 0))\n    case AudioDataOutputClass:\n        return new AudioDataOutput(parent);\n#endif\n    case EffectClass:\n        return new Effect(m_effectManager, args[0].toInt(), parent);\n    case VideoWidgetClass:\n        return new VideoWidget(qobject_cast<QWidget *>(parent));\n    }\n\n    warning() << \"Backend class\" << c << \"is not supported by Phonon VLC :(\";\n    return 0;\n}\n\nQStringList Backend::availableMimeTypes() const\n{\n    if (m_supportedMimeTypes.isEmpty()) {\n        const_cast<Backend *>(this)->m_supportedMimeTypes\n                << QLatin1String(\"application\/ogg\")\n                << QLatin1String(\"application\/x-ogg\")\n                << QLatin1String(\"application\/vnd.rn-realmedia\")\n                << QLatin1String(\"application\/x-annodex\")\n                << QLatin1String(\"application\/x-flash-video\")\n                << QLatin1String(\"application\/x-quicktimeplayer\")\n                << QLatin1String(\"application\/x-extension-mp4\")\n                << QLatin1String(\"audio\/168sv\")\n                << QLatin1String(\"audio\/3gpp\")\n                << QLatin1String(\"audio\/3gpp2\")\n                << QLatin1String(\"audio\/8svx\")\n                << QLatin1String(\"audio\/aiff\")\n                << QLatin1String(\"audio\/amr\")\n                << QLatin1String(\"audio\/amr-wb\")\n                << QLatin1String(\"audio\/basic\")\n                << QLatin1String(\"audio\/mp3\")\n                << QLatin1String(\"audio\/mp4\")\n                << QLatin1String(\"audio\/midi\")\n                << QLatin1String(\"audio\/mpeg\")\n                << QLatin1String(\"audio\/mpeg2\")\n                << QLatin1String(\"audio\/mpeg3\")\n                << QLatin1String(\"audio\/vnd.rn-realaudio\")\n                << QLatin1String(\"audio\/vnd.rn-realmedia\")\n                << QLatin1String(\"audio\/wav\")\n                << QLatin1String(\"audio\/webm\")\n                << QLatin1String(\"audio\/x-16sv\")\n                << QLatin1String(\"audio\/x-8svx\")\n                << QLatin1String(\"audio\/x-aiff\")\n                << QLatin1String(\"audio\/x-basic\")\n                << QLatin1String(\"audio\/x-it\")\n                << QLatin1String(\"audio\/x-m4a\")\n                << QLatin1String(\"audio\/x-matroska\")\n                << QLatin1String(\"audio\/x-mp3\")\n                << QLatin1String(\"audio\/x-mpeg\")\n                << QLatin1String(\"audio\/x-mpeg2\")\n                << QLatin1String(\"audio\/x-mpeg3\")\n                << QLatin1String(\"audio\/x-mpegurl\")\n                << QLatin1String(\"audio\/x-ms-wma\")\n                << QLatin1String(\"audio\/x-ogg\")\n                << QLatin1String(\"audio\/x-pn-aiff\")\n                << QLatin1String(\"audio\/x-pn-au\")\n                << QLatin1String(\"audio\/x-pn-realaudio-plugin\")\n                << QLatin1String(\"audio\/x-pn-wav\")\n                << QLatin1String(\"audio\/x-pn-windows-acm\")\n                << QLatin1String(\"audio\/x-real-audio\")\n                << QLatin1String(\"audio\/x-realaudio\")\n                << QLatin1String(\"audio\/x-s3m\")\n                << QLatin1String(\"audio\/x-speex+ogg\")\n                << QLatin1String(\"audio\/x-vorbis+ogg\")\n                << QLatin1String(\"audio\/x-wav\")\n                << QLatin1String(\"audio\/x-xm\")\n                << QLatin1String(\"image\/ilbm\")\n                << QLatin1String(\"image\/png\")\n                << QLatin1String(\"image\/x-ilbm\")\n                << QLatin1String(\"image\/x-png\")\n                << QLatin1String(\"video\/3gpp\")\n                << QLatin1String(\"video\/3gpp2\")\n                << QLatin1String(\"video\/anim\")\n                << QLatin1String(\"video\/avi\")\n                << QLatin1String(\"video\/divx\")\n                << QLatin1String(\"video\/flv\")\n                << QLatin1String(\"video\/mkv\")\n                << QLatin1String(\"video\/mng\")\n                << QLatin1String(\"video\/mp4\")\n                << QLatin1String(\"video\/mpeg\")\n                << QLatin1String(\"video\/mpeg-system\")\n                << QLatin1String(\"video\/mpg\")\n                << QLatin1String(\"video\/msvideo\")\n                << QLatin1String(\"video\/ogg\")\n                << QLatin1String(\"video\/quicktime\")\n                << QLatin1String(\"video\/webm\")\n                << QLatin1String(\"video\/x-anim\")\n                << QLatin1String(\"video\/x-flic\")\n                << QLatin1String(\"video\/x-flv\")\n                << QLatin1String(\"video\/x-matroska\")\n                << QLatin1String(\"video\/x-mng\")\n                << QLatin1String(\"video\/x-m4v\")\n                << QLatin1String(\"video\/x-mpeg\")\n                << QLatin1String(\"video\/x-mpeg-system\")\n                << QLatin1String(\"video\/x-ms-asf\")\n                << QLatin1String(\"video\/x-ms-wma\")\n                << QLatin1String(\"video\/x-ms-wmv\")\n                << QLatin1String(\"video\/x-ms-wvx\")\n                << QLatin1String(\"video\/x-msvideo\")\n                << QLatin1String(\"video\/x-quicktime\")\n                << QLatin1String(\"audio\/x-flac\")\n                << QLatin1String(\"audio\/x-ape\");\n    }\n    return m_supportedMimeTypes;\n}\n\nQList<int> Backend::objectDescriptionIndexes(ObjectDescriptionType type) const\n{\n    QList<int> list;\n\n    switch (type) {\n    case Phonon::AudioChannelType: {\n        list << GlobalAudioChannels::instance()->globalIndexes();\n    }\n    break;\n    case Phonon::AudioOutputDeviceType:\n    case Phonon::AudioCaptureDeviceType:\n    case Phonon::VideoCaptureDeviceType: {\n        return deviceManager()->deviceIds(type);\n    }\n    break;\n    case Phonon::EffectType: {\n        QList<EffectInfo *> effectList = effectManager()->effects();\n        for (int eff = 0; eff < effectList.size(); ++eff) {\n            list.append(eff);\n        }\n    }\n    break;\n    case Phonon::SubtitleType: {\n        list << GlobalSubtitles::instance()->globalIndexes();\n    }\n    break;\n    }\n\n    return list;\n}\n\nQHash<QByteArray, QVariant> Backend::objectDescriptionProperties(ObjectDescriptionType type, int index) const\n{\n    QHash<QByteArray, QVariant> ret;\n\n    switch (type) {\n    case Phonon::AudioChannelType: {\n        const AudioChannelDescription description = GlobalAudioChannels::instance()->fromIndex(index);\n        ret.insert(\"name\", description.name());\n        ret.insert(\"description\", description.description());\n    }\n    break;\n    case Phonon::AudioOutputDeviceType:\n    case Phonon::AudioCaptureDeviceType:\n    case Phonon::VideoCaptureDeviceType: {\n        \/\/ Index should be unique, even for different categories\n        return deviceManager()->deviceProperties(index);\n    }\n    break;\n    case Phonon::EffectType: {\n        QList<EffectInfo *> effectList = effectManager()->effects();\n        if (index >= 0 && index <= effectList.size()) {\n            const EffectInfo *effect = effectList[ index ];\n            ret.insert(\"name\", effect->name());\n            ret.insert(\"description\", effect->description());\n            ret.insert(\"author\", effect->author());\n        } else {\n            Q_ASSERT(1); \/\/ Since we use list position as ID, this should not happen\n        }\n    }\n    break;\n    case Phonon::SubtitleType: {\n        const SubtitleDescription description = GlobalSubtitles::instance()->fromIndex(index);\n        ret.insert(\"name\", description.name());\n        ret.insert(\"description\", description.description());\n        ret.insert(\"type\", description.property(\"type\"));\n    }\n    break;\n    }\n\n    return ret;\n}\n\nbool Backend::startConnectionChange(QSet<QObject *> objects)\n{\n    \/\/FIXME\n    foreach(QObject * object, objects) {\n        debug() << \"Object:\" << object->metaObject()->className();\n    }\n\n    \/\/ There is nothing we can do but hope the connection changes will not take too long\n    \/\/ so that buffers would underrun\n    \/\/ But we should be pretty safe the way xine works by not doing anything here.\n    return true;\n}\n\nbool Backend::connectNodes(QObject *source, QObject *sink)\n{\n    debug() << \"Backend connected\" << source->metaObject()->className() << \"to\" << sink->metaObject()->className();\n\n    SinkNode *sinkNode = dynamic_cast<SinkNode *>(sink);\n    if (sinkNode) {\n        MediaObject *mediaObject = qobject_cast<MediaObject *>(source);\n        if (mediaObject) {\n            \/\/ Connect the SinkNode to a MediaObject\n            sinkNode->connectToMediaObject(mediaObject);\n            return true;\n        }\n\n        \/*\n        Effect *effect = qobject_cast<Effect *>(source);\n        if (effect) {\n            \/\/ FIXME connect the effect\n            return true;\n        }\n        *\/\n    }\n\n    warning() << \"Linking\" << source->metaObject()->className() << \"to\" << sink->metaObject()->className() << \"failed\";\n\n    return false;\n}\n\nbool Backend::disconnectNodes(QObject *source, QObject *sink)\n{\n    SinkNode *sinkNode = dynamic_cast<SinkNode *>(sink);\n    if (sinkNode) {\n        MediaObject *const mediaObject = qobject_cast<MediaObject *>(source);\n        if (mediaObject) {\n            \/\/ Disconnect the SinkNode from a MediaObject\n            sinkNode->disconnectFromMediaObject(mediaObject);\n            return true;\n        }\n\n        \/*\n        Effect *effect = qobject_cast<Effect *>(source);\n        if (effect) {\n            \/\/ FIXME disconnect the effect\n            return true;\n        }\n        *\/\n    }\n\n    return false;\n}\n\nbool Backend::endConnectionChange(QSet<QObject *> objects)\n{\n    foreach(QObject *object, objects) {\n        debug() << \"Object:\" << object->metaObject()->className();\n    }\n    return true;\n}\n\nDeviceManager *Backend::deviceManager() const\n{\n    return m_deviceManager;\n}\n\nEffectManager *Backend::effectManager() const\n{\n    return m_effectManager;\n}\n\n} \/\/ namespace VLC\n} \/\/ namespace Phonon\n<|endoftext|>"}
{"text":"<commit_before>\/*  Copyright (c) MediaArea.net SARL. All Rights Reserved.\r\n *\r\n *  Use of this source code is governed by a BSD-style license that can\r\n *  be found in the License.html file in the root of the source tree.\r\n *\/\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Pre-compilation\r\n#include \"MediaInfo\/PreComp.h\"\r\n#ifdef __BORLANDC__\r\n    #pragma hdrstop\r\n#endif\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/Setup.h\"\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#if defined(MEDIAINFO_NISO_YES)\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/Export\/Export_Niso.h\"\r\n#include \"MediaInfo\/File__Analyse_Automatic.h\"\r\n#include \"MediaInfo\/OutputHelpers.h\"\r\n#include <ctime>\r\n#include <cmath>\r\n\r\nusing namespace std;\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\r\nnamespace MediaInfoLib\r\n{\r\n\/\/---------------------------------------------------------------------------\r\nextern MediaInfo_Config Config;\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/***************************************************************************\r\n\/\/ Constructor\/Destructor\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nExport_Niso::Export_Niso ()\r\n{\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nExport_Niso::~Export_Niso ()\r\n{\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Helpers\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nNode* Transform_Header()\r\n{\r\n    \/\/Root node\r\n    Node* Node_Header=new Node(\"mix:mix\");\r\n    Node_Header->Add_Attribute(\"xmlns:mix\", \"http:\/\/www.loc.gov\/mix\/v20\");\r\n    Node_Header->Add_Attribute(\"xmlns:xsi\", \"http:\/\/www.w3.org\/2001\/XMLSchema-instance\");\r\n    Node_Header->Add_Attribute(\"xsi:schemaLocation\", \"http:\/\/www.loc.gov\/mix\/v20 http:\/\/www.loc.gov\/standards\/mix\/mix20\/mix20.xsd\");\r\n\r\n    return Node_Header;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid ComputeSamplingFrequency(Node* Parent, Ztring& Value)\r\n{\r\n    while (Value.size()>0 && Value[Value.size()-1]==__T('0'))\r\n        Value.resize(Value.size()-1);\r\n    if (Value.size()>0 && Value[Value.size()-1]==__T('.'))\r\n        Value.resize(Value.size()-1);\r\n\r\n    int32u SamplingFrequencyDenominator=0;\r\n    size_t Dot=Value.find(__T(\".\"));\r\n    if (Dot!=std::string::npos)\r\n    {\r\n        SamplingFrequencyDenominator=std::pow(10, Value.size()-Dot-1);\r\n        Value.erase(Dot, 1);\r\n    }\r\n\r\n    Parent->Add_Child(\"mix:numerator\", Value);\r\n\r\n    if (SamplingFrequencyDenominator)\r\n        Parent->Add_Child(\"mix:denominator\", Ztring().From_Number(SamplingFrequencyDenominator));\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Input\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nZtring Export_Niso::Transform(MediaInfo_Internal &MI, Ztring ExternalMetadataValues, Ztring ExternalMetaDataConfig)\r\n{\r\n    bool UseExternalMetaData=(!ExternalMetaDataConfig.empty() && !ExternalMetadataValues.empty());\r\n\r\n    Ztring ToReturn;\r\n    for (size_t Pos=0; Pos<MI.Count_Get(Stream_Image); Pos++)\r\n    {\r\n        Node* Node_Root=Transform_Header();\r\n        Node* Node_Extension=NULL;\r\n\r\n        \/\/Use external metadata\r\n        if (UseExternalMetaData)\r\n        {\r\n            Ztring FileName;\r\n            if (!MI.Get(Stream_General, 0, General_FileName).empty())\r\n                FileName=MI.Get(Stream_General, 0, General_FileName);\r\n            if (!MI.Get(Stream_General, 0, General_FileExtension).empty())\r\n                FileName+=__T('.')+MI.Get(Stream_General, 0, General_FileExtension);\r\n            if (FileName.empty())\r\n            {\r\n                MediaInfoLib::Config.Log_Send(0xC0, 0xFF, 0, \"File name not found in external metadata file\");\r\n                delete Node_Root;\r\n                return Ztring();\r\n            }\r\n\r\n            Node_Extension= new Node(\"mix:Extension\");\r\n            Node* Node_CoreMain=NULL;\r\n\r\n            if (ExternalMetaDataConfig.find(__T(\"<ebucore:ebuCoreMain\"))<100)\r\n            {\r\n                \/\/TODO: merge with EBUCore code\r\n                \/\/Current date\/time is ISO format\r\n                time_t Seconds=time(NULL);\r\n                Ztring DateTime; DateTime.Date_From_Seconds_1970((int32u)Seconds);\r\n                if (DateTime.size() >= 4 && DateTime[0] == __T('U') && DateTime[1] == __T('T') && DateTime[2] == __T('C') && DateTime[3] == __T(' '))\r\n                {\r\n                    DateTime.erase(0, 4);\r\n                    DateTime += __T('Z');\r\n                }\r\n                Ztring Date=DateTime.substr(0, 10);\r\n                Ztring Time=DateTime.substr(11);\r\n\r\n                Node* Node_CoreMain=Node_Extension->Add_Child(\"ebucore:ebuCoreMain\");\r\n                Node_CoreMain->Add_Attribute(\"xmlns:dc\", \"http:\/\/purl.org\/dc\/elements\/1.1\/\");\r\n                {\r\n                    Node_CoreMain->Add_Attribute(\"xmlns:ebucore\", \"urn:ebu:metadata-schema:ebucore\");\r\n                    Node_CoreMain->Add_Attribute(\"xmlns:xalan\", \"http:\/\/xml.apache.org\/xalan\");\r\n                    Node_CoreMain->Add_Attribute(\"xmlns:xsi\", \"http:\/\/www.w3.org\/2001\/XMLSchema-instance\");\r\n                    Node_CoreMain->Add_Attribute(\"xsi:schemaLocation\", string(\"urn:ebu:metadata-schema:ebucore http\") + string(MediaInfoLib::Config.Https_Get() ? \"s\" : \"\") + \":\/\/www.ebu.ch\/metadata\/schemas\/EBUCore\/20171009\/ebucore.xsd\");\r\n                    Node_CoreMain->Add_Attribute(\"version\", \"1.8\");\r\n                    Node_CoreMain->Add_Attribute(\"writingLibraryName\", \"MediaInfoLib\");\r\n                    Node_CoreMain->Add_Attribute(\"writingLibraryVersion\", MediaInfoLib::Config.Info_Version_Get().SubString(__T(\" - v\"), Ztring()));\r\n                }\r\n                Node_CoreMain->Add_Attribute(\"dateLastModified\", Date);\r\n                Node_CoreMain->Add_Attribute(\"timeLastModified\", Time);\r\n            }\r\n\r\n            if (!ExternalMetadata(FileName, ExternalMetadataValues, ExternalMetaDataConfig,\r\n                                  ZtringList(__T(\"mix:Extension;ebucore:ebuCoreMain\")), __T(\"\"),\r\n                                  Node_CoreMain?Node_CoreMain:Node_Extension, NULL))\r\n            {\r\n                delete Node_Root;\r\n                return Ztring();\r\n            }\r\n        }\r\n\r\n        \/\/BasicDigitalObjectInformation\r\n        Node* Node_BasicDigitalObjectInformation=Node_Root->Add_Child(\"mix:BasicDigitalObjectInformation\");\r\n        Node* Node_ObjectIdentifier=Node_BasicDigitalObjectInformation->Add_Child(\"mix:ObjectIdentifier\");\r\n\r\n        Node_ObjectIdentifier->Add_Child(\"mix:objectIdentifierType\", std::string(\"MediaInfo\"));\r\n        Node_ObjectIdentifier->Add_Child_IfNotEmpty(MI, Stream_General, 0, General_CompleteName, \"mix:objectIdentifierValue\");\r\n\r\n        if (MI.Get(Stream_General, 0, General_FileSize).To_int64u()>0)\r\n            Node_BasicDigitalObjectInformation->Add_Child(\"mix:fileSize\", MI.Get(Stream_General, 0, General_FileSize));\r\n\r\n        if (MI.Get(Stream_General, 0, General_Format)==__T(\"TIFF\"))\r\n             Node_BasicDigitalObjectInformation->Add_Child(\"mix:FormatDesignation\")->Add_Child(\"mix:formatName\", std::string(\"image\/tiff\"));\r\n\r\n        std::string byteOrder=MI.Get(Stream_Image, Pos, Image_Format_Settings_Endianness).To_UTF8();\r\n        if (!byteOrder.empty())\r\n            Node_BasicDigitalObjectInformation->Add_Child(\"mix:byteOrder\", byteOrder==\"Little\"?std::string(\"little endian\"):(byteOrder==\"Big\"?std::string(\"big endian\"): byteOrder));\r\n\r\n        std::string CompressionScheme=MI.Get(Stream_Image, Pos, Image_Format).To_UTF8();\r\n        if (!CompressionScheme.empty())\r\n            Node_BasicDigitalObjectInformation->Add_Child(\"mix:Compression\")->Add_Child(\"mix:compressionScheme\", CompressionScheme==\"Raw\"?std::string(\"Uncompressed\"):CompressionScheme);\r\n\r\n        if (!MI.Get(Stream_Image, Pos, Image_Width).empty() ||\r\n            !MI.Get(Stream_Image, Pos, Image_Height).empty() ||\r\n            !MI.Get(Stream_Image, Pos, Image_ColorSpace).empty())\r\n        {\r\n            Node* Node_BasicImageCharacteristics=Node_Root->Add_Child(\"mix:BasicImageInformation\")->Add_Child(\"mix:BasicImageCharacteristics\");\r\n\r\n            Node_BasicImageCharacteristics->Add_Child_IfNotEmpty(MI, Stream_Image, Pos, Image_Width, \"mix:imageWidth\");\r\n            Node_BasicImageCharacteristics->Add_Child_IfNotEmpty(MI, Stream_Image, Pos, Image_Height, \"mix:imageHeight\");\r\n\r\n            \/\/ReferenceBlackWhite\r\n            std::string ColorSpace=MI.Get(Stream_Image, Pos, Image_ColorSpace).To_UTF8();\r\n            if (!ColorSpace.empty())\r\n            {\r\n                Node* Node_PhotometricInterpretation=Node_BasicImageCharacteristics->Add_Child(\"mix:PhotometricInterpretation\");\r\n                Node_PhotometricInterpretation->Add_Child(\"mix:colorSpace\", ColorSpace);\r\n\r\n                Node* ReferenceBlackWhite=Node_PhotometricInterpretation->Add_Child(\"mix:ReferenceBlackWhite\");\r\n                for (size_t i=0; i < ColorSpace.size(); i++)\r\n                {\r\n                    Node* Component=ReferenceBlackWhite->Add_Child(\"mix:Component\");\r\n                    Component->Add_Child(\"mix:componentPhotometricInterpretation\", string(1, ColorSpace[i]));\r\n                    Node* footroom=Component->Add_Child(\"mix:footroom\");\r\n                    footroom->Add_Child(\"mix:numerator\", Ztring::ToZtring(0));\r\n                    int8u BitDepth=MI.Get(Stream_Image, Pos, Image_BitDepth).To_int8u();\r\n                    if (BitDepth)\r\n                    {\r\n                        Node* headroom=Component->Add_Child(\"mix:headroom\");\r\n                        headroom->Add_Child(\"mix:numerator\", Ztring::ToZtring((1<<BitDepth)-1));\r\n                    }\r\n                }\r\n            }\r\n        }\r\n\r\n        \/\/ImageCaptureMetadata\r\n        std::string Make=MI.Get(Stream_General, 0, General_Encoded_Application_CompanyName).To_UTF8();\r\n        std::string Model=MI.Get(Stream_General, 0, General_Encoded_Library_Name).To_UTF8();\r\n        std::string Software=MI.Get(Stream_General, 0, General_Encoded_Application_Name).To_UTF8();\r\n        std::string Encoded_Date=MI.Get(Stream_Image, Pos, Image_Encoded_Date).To_UTF8();\r\n        if (!Make.empty() || !Model.empty() || !Software.empty() || !Encoded_Date.empty())\r\n        {\r\n            Node* Node_ImageCaptureMetadata=Node_Root->Add_Child(\"mix:ImageCaptureMetadata\");\r\n\r\n            if (!Encoded_Date.empty())\r\n            {\r\n                if (Encoded_Date.size()>4 && Encoded_Date[4]==':')\r\n                    Encoded_Date[4]='-';\r\n                if (Encoded_Date.size()>7 && Encoded_Date[7]==':')\r\n                    Encoded_Date[7]='-';\r\n                if (Encoded_Date.size()>10 && Encoded_Date[10]==' ')\r\n                    Encoded_Date[10]='T';\r\n                Node* Node_GeneralCaptureInformation=Node_ImageCaptureMetadata->Add_Child(\"mix:GeneralCaptureInformation\");\r\n                Node_GeneralCaptureInformation->Add_Child(\"mix:dateTimeCreated\", Encoded_Date);\r\n            }\r\n\r\n            if (!Make.empty() || !Model.empty() || !Software.empty() )\r\n            {\r\n                Node* Node_ScannerCapture=Node_ImageCaptureMetadata->Add_Child(\"mix:ScannerCapture\");\r\n                if (!Make.empty())\r\n                    Node_ScannerCapture->Add_Child(\"mix:scannerManufacturer\", Make);\r\n                if (!Model.empty())\r\n                    Node_ScannerCapture->Add_Child(\"mix:ScannerModel\")->Add_Child(\"mix:scannerModelName\", Model);\r\n                if (!Software.empty())\r\n                    Node_ScannerCapture->Add_Child(\"mix:ScanningSystemSoftware\")->Add_Child(\"mix:scanningSoftwareName\", Software);\r\n            }\r\n        }\r\n\r\n        if (!MI.Get(Stream_Image, Pos, __T(\"Density_X\")).empty() ||\r\n            !MI.Get(Stream_Image, Pos, __T(\"Density_X\")).empty() ||\r\n            !MI.Get(Stream_Image, Pos, Image_ColorSpace).empty())\r\n        {\r\n            Node* Node_ImageAssessmentMetadata=Node_Root->Add_Child(\"mix:ImageAssessmentMetadata\");\r\n\r\n            \/\/SpatialMetrics\r\n            string samplingFrequencyUnit=MI.Get(Stream_Image, Pos, __T(\"Density_Unit\")).To_UTF8();\r\n            Ztring xSamplingFrequency=MI.Get(Stream_Image, Pos, __T(\"Density_X\"));\r\n            Ztring ySamplingFrequency=MI.Get(Stream_Image, Pos, __T(\"Density_Y\"));\r\n            if (!xSamplingFrequency.empty() || !ySamplingFrequency.empty())\r\n            {\r\n                Node* Node_SpatialMetrics=Node_ImageAssessmentMetadata->Add_Child(\"mix:SpatialMetrics\");\r\n\r\n                if (samplingFrequencyUnit.empty())\r\n                    Node_SpatialMetrics->Add_Child(\"mix:samplingFrequencyUnit\", string(\"no absolute unit of measurement\"));\r\n                else if (samplingFrequencyUnit==\"dpi\")\r\n                    Node_SpatialMetrics->Add_Child(\"mix:samplingFrequencyUnit\", string(\"in.\"));\r\n                else if (samplingFrequencyUnit==\"dpcm\")\r\n                    Node_SpatialMetrics->Add_Child(\"mix:samplingFrequencyUnit\", string(\"cm\"));\r\n\r\n                if (!xSamplingFrequency.empty())\r\n                    ComputeSamplingFrequency(Node_SpatialMetrics->Add_Child(\"mix:xSamplingFrequency\"), xSamplingFrequency);\r\n                if (!ySamplingFrequency.empty())\r\n                    ComputeSamplingFrequency(Node_SpatialMetrics->Add_Child(\"mix:ySamplingFrequency\"), ySamplingFrequency);\r\n            }\r\n\r\n            size_t SamplesPerPixel=MI.Get(Stream_Image, Pos, Image_ColorSpace).length();\r\n            if (SamplesPerPixel)\r\n            {\r\n                Node* Node_ImageColorEncoding=Node_ImageAssessmentMetadata->Add_Child(\"mix:ImageColorEncoding\");\r\n\r\n                Node* Node_BitsPerSample=new Node(\"mix:BitsPerSample\");\r\n                for (size_t Pos2=0; Pos2<SamplesPerPixel; ++Pos2)\r\n                    Node_BitsPerSample->Add_Child_IfNotEmpty(MI, Stream_Image, Pos, Image_BitDepth, \"mix:bitsPerSampleValue\");\r\n\r\n                if (!Node_BitsPerSample->Childs.empty())\r\n                {\r\n                    Node_BitsPerSample->Add_Child(\"mix:bitsPerSampleUnit\", std::string(\"integer\"));\r\n                    Node_ImageColorEncoding->Childs.push_back(Node_BitsPerSample);\r\n                }\r\n                else\r\n                   delete Node_BitsPerSample;\r\n\r\n                Node_ImageColorEncoding->Add_Child(\"mix:samplesPerPixel\", Ztring().From_Number(SamplesPerPixel).To_UTF8());\r\n            }\r\n        }\r\n\r\n        if (Node_Extension)\r\n            Node_Root->Childs.push_back(Node_Extension);\r\n\r\n        ToReturn+=Ztring().From_UTF8(To_XML(*Node_Root, 0, true, true).c_str());\r\n    }\r\n\r\n    if (ToReturn.empty())\r\n        ToReturn+=Ztring().From_UTF8(To_XML(*Transform_Header(), 0, true, true).c_str())+=__T(\"\\n\");\r\n\r\n    \/\/Carriage return\r\n    if (MediaInfoLib::Config.LineSeparator_Get()!=__T(\"\\n\"))\r\n        ToReturn.FindAndReplace(__T(\"\\n\"), MediaInfoLib::Config.LineSeparator_Get(), 0, Ztring_Recursive);\r\n\r\n    return ToReturn;\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/\r\n\/\/***************************************************************************\r\n\r\n} \/\/NameSpace\r\n\r\n#endif\r\n<commit_msg>x Ambiguous call to std::pow<commit_after>\/*  Copyright (c) MediaArea.net SARL. All Rights Reserved.\r\n *\r\n *  Use of this source code is governed by a BSD-style license that can\r\n *  be found in the License.html file in the root of the source tree.\r\n *\/\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Pre-compilation\r\n#include \"MediaInfo\/PreComp.h\"\r\n#ifdef __BORLANDC__\r\n    #pragma hdrstop\r\n#endif\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/Setup.h\"\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#if defined(MEDIAINFO_NISO_YES)\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/Export\/Export_Niso.h\"\r\n#include \"MediaInfo\/File__Analyse_Automatic.h\"\r\n#include \"MediaInfo\/OutputHelpers.h\"\r\n#include <ctime>\r\n#include <cmath>\r\n\r\nusing namespace std;\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\r\nnamespace MediaInfoLib\r\n{\r\n\/\/---------------------------------------------------------------------------\r\nextern MediaInfo_Config Config;\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/***************************************************************************\r\n\/\/ Constructor\/Destructor\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nExport_Niso::Export_Niso ()\r\n{\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nExport_Niso::~Export_Niso ()\r\n{\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Helpers\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nNode* Transform_Header()\r\n{\r\n    \/\/Root node\r\n    Node* Node_Header=new Node(\"mix:mix\");\r\n    Node_Header->Add_Attribute(\"xmlns:mix\", \"http:\/\/www.loc.gov\/mix\/v20\");\r\n    Node_Header->Add_Attribute(\"xmlns:xsi\", \"http:\/\/www.w3.org\/2001\/XMLSchema-instance\");\r\n    Node_Header->Add_Attribute(\"xsi:schemaLocation\", \"http:\/\/www.loc.gov\/mix\/v20 http:\/\/www.loc.gov\/standards\/mix\/mix20\/mix20.xsd\");\r\n\r\n    return Node_Header;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid ComputeSamplingFrequency(Node* Parent, Ztring& Value)\r\n{\r\n    while (Value.size()>0 && Value[Value.size()-1]==__T('0'))\r\n        Value.resize(Value.size()-1);\r\n    if (Value.size()>0 && Value[Value.size()-1]==__T('.'))\r\n        Value.resize(Value.size()-1);\r\n\r\n    int32u SamplingFrequencyDenominator=0;\r\n    size_t Dot=Value.find(__T(\".\"));\r\n    if (Dot!=std::string::npos)\r\n    {\r\n        Value.erase(Dot, 1);\r\n        SamplingFrequencyDenominator=(int32u)std::pow((double)10, (int)Value.size()-Dot);\r\n    }\r\n\r\n    Parent->Add_Child(\"mix:numerator\", Value);\r\n\r\n    if (SamplingFrequencyDenominator)\r\n        Parent->Add_Child(\"mix:denominator\", Ztring().From_Number(SamplingFrequencyDenominator));\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Input\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nZtring Export_Niso::Transform(MediaInfo_Internal &MI, Ztring ExternalMetadataValues, Ztring ExternalMetaDataConfig)\r\n{\r\n    bool UseExternalMetaData=(!ExternalMetaDataConfig.empty() && !ExternalMetadataValues.empty());\r\n\r\n    Ztring ToReturn;\r\n    for (size_t Pos=0; Pos<MI.Count_Get(Stream_Image); Pos++)\r\n    {\r\n        Node* Node_Root=Transform_Header();\r\n        Node* Node_Extension=NULL;\r\n\r\n        \/\/Use external metadata\r\n        if (UseExternalMetaData)\r\n        {\r\n            Ztring FileName;\r\n            if (!MI.Get(Stream_General, 0, General_FileName).empty())\r\n                FileName=MI.Get(Stream_General, 0, General_FileName);\r\n            if (!MI.Get(Stream_General, 0, General_FileExtension).empty())\r\n                FileName+=__T('.')+MI.Get(Stream_General, 0, General_FileExtension);\r\n            if (FileName.empty())\r\n            {\r\n                MediaInfoLib::Config.Log_Send(0xC0, 0xFF, 0, \"File name not found in external metadata file\");\r\n                delete Node_Root;\r\n                return Ztring();\r\n            }\r\n\r\n            Node_Extension= new Node(\"mix:Extension\");\r\n            Node* Node_CoreMain=NULL;\r\n\r\n            if (ExternalMetaDataConfig.find(__T(\"<ebucore:ebuCoreMain\"))<100)\r\n            {\r\n                \/\/TODO: merge with EBUCore code\r\n                \/\/Current date\/time is ISO format\r\n                time_t Seconds=time(NULL);\r\n                Ztring DateTime; DateTime.Date_From_Seconds_1970((int32u)Seconds);\r\n                if (DateTime.size() >= 4 && DateTime[0] == __T('U') && DateTime[1] == __T('T') && DateTime[2] == __T('C') && DateTime[3] == __T(' '))\r\n                {\r\n                    DateTime.erase(0, 4);\r\n                    DateTime += __T('Z');\r\n                }\r\n                Ztring Date=DateTime.substr(0, 10);\r\n                Ztring Time=DateTime.substr(11);\r\n\r\n                Node* Node_CoreMain=Node_Extension->Add_Child(\"ebucore:ebuCoreMain\");\r\n                Node_CoreMain->Add_Attribute(\"xmlns:dc\", \"http:\/\/purl.org\/dc\/elements\/1.1\/\");\r\n                {\r\n                    Node_CoreMain->Add_Attribute(\"xmlns:ebucore\", \"urn:ebu:metadata-schema:ebucore\");\r\n                    Node_CoreMain->Add_Attribute(\"xmlns:xalan\", \"http:\/\/xml.apache.org\/xalan\");\r\n                    Node_CoreMain->Add_Attribute(\"xmlns:xsi\", \"http:\/\/www.w3.org\/2001\/XMLSchema-instance\");\r\n                    Node_CoreMain->Add_Attribute(\"xsi:schemaLocation\", string(\"urn:ebu:metadata-schema:ebucore http\") + string(MediaInfoLib::Config.Https_Get() ? \"s\" : \"\") + \":\/\/www.ebu.ch\/metadata\/schemas\/EBUCore\/20171009\/ebucore.xsd\");\r\n                    Node_CoreMain->Add_Attribute(\"version\", \"1.8\");\r\n                    Node_CoreMain->Add_Attribute(\"writingLibraryName\", \"MediaInfoLib\");\r\n                    Node_CoreMain->Add_Attribute(\"writingLibraryVersion\", MediaInfoLib::Config.Info_Version_Get().SubString(__T(\" - v\"), Ztring()));\r\n                }\r\n                Node_CoreMain->Add_Attribute(\"dateLastModified\", Date);\r\n                Node_CoreMain->Add_Attribute(\"timeLastModified\", Time);\r\n            }\r\n\r\n            if (!ExternalMetadata(FileName, ExternalMetadataValues, ExternalMetaDataConfig,\r\n                                  ZtringList(__T(\"mix:Extension;ebucore:ebuCoreMain\")), __T(\"\"),\r\n                                  Node_CoreMain?Node_CoreMain:Node_Extension, NULL))\r\n            {\r\n                delete Node_Root;\r\n                return Ztring();\r\n            }\r\n        }\r\n\r\n        \/\/BasicDigitalObjectInformation\r\n        Node* Node_BasicDigitalObjectInformation=Node_Root->Add_Child(\"mix:BasicDigitalObjectInformation\");\r\n        Node* Node_ObjectIdentifier=Node_BasicDigitalObjectInformation->Add_Child(\"mix:ObjectIdentifier\");\r\n\r\n        Node_ObjectIdentifier->Add_Child(\"mix:objectIdentifierType\", std::string(\"MediaInfo\"));\r\n        Node_ObjectIdentifier->Add_Child_IfNotEmpty(MI, Stream_General, 0, General_CompleteName, \"mix:objectIdentifierValue\");\r\n\r\n        if (MI.Get(Stream_General, 0, General_FileSize).To_int64u()>0)\r\n            Node_BasicDigitalObjectInformation->Add_Child(\"mix:fileSize\", MI.Get(Stream_General, 0, General_FileSize));\r\n\r\n        if (MI.Get(Stream_General, 0, General_Format)==__T(\"TIFF\"))\r\n             Node_BasicDigitalObjectInformation->Add_Child(\"mix:FormatDesignation\")->Add_Child(\"mix:formatName\", std::string(\"image\/tiff\"));\r\n\r\n        std::string byteOrder=MI.Get(Stream_Image, Pos, Image_Format_Settings_Endianness).To_UTF8();\r\n        if (!byteOrder.empty())\r\n            Node_BasicDigitalObjectInformation->Add_Child(\"mix:byteOrder\", byteOrder==\"Little\"?std::string(\"little endian\"):(byteOrder==\"Big\"?std::string(\"big endian\"): byteOrder));\r\n\r\n        std::string CompressionScheme=MI.Get(Stream_Image, Pos, Image_Format).To_UTF8();\r\n        if (!CompressionScheme.empty())\r\n            Node_BasicDigitalObjectInformation->Add_Child(\"mix:Compression\")->Add_Child(\"mix:compressionScheme\", CompressionScheme==\"Raw\"?std::string(\"Uncompressed\"):CompressionScheme);\r\n\r\n        if (!MI.Get(Stream_Image, Pos, Image_Width).empty() ||\r\n            !MI.Get(Stream_Image, Pos, Image_Height).empty() ||\r\n            !MI.Get(Stream_Image, Pos, Image_ColorSpace).empty())\r\n        {\r\n            Node* Node_BasicImageCharacteristics=Node_Root->Add_Child(\"mix:BasicImageInformation\")->Add_Child(\"mix:BasicImageCharacteristics\");\r\n\r\n            Node_BasicImageCharacteristics->Add_Child_IfNotEmpty(MI, Stream_Image, Pos, Image_Width, \"mix:imageWidth\");\r\n            Node_BasicImageCharacteristics->Add_Child_IfNotEmpty(MI, Stream_Image, Pos, Image_Height, \"mix:imageHeight\");\r\n\r\n            \/\/ReferenceBlackWhite\r\n            std::string ColorSpace=MI.Get(Stream_Image, Pos, Image_ColorSpace).To_UTF8();\r\n            if (!ColorSpace.empty())\r\n            {\r\n                Node* Node_PhotometricInterpretation=Node_BasicImageCharacteristics->Add_Child(\"mix:PhotometricInterpretation\");\r\n                Node_PhotometricInterpretation->Add_Child(\"mix:colorSpace\", ColorSpace);\r\n\r\n                Node* ReferenceBlackWhite=Node_PhotometricInterpretation->Add_Child(\"mix:ReferenceBlackWhite\");\r\n                for (size_t i=0; i < ColorSpace.size(); i++)\r\n                {\r\n                    Node* Component=ReferenceBlackWhite->Add_Child(\"mix:Component\");\r\n                    Component->Add_Child(\"mix:componentPhotometricInterpretation\", string(1, ColorSpace[i]));\r\n                    Node* footroom=Component->Add_Child(\"mix:footroom\");\r\n                    footroom->Add_Child(\"mix:numerator\", Ztring::ToZtring(0));\r\n                    int8u BitDepth=MI.Get(Stream_Image, Pos, Image_BitDepth).To_int8u();\r\n                    if (BitDepth)\r\n                    {\r\n                        Node* headroom=Component->Add_Child(\"mix:headroom\");\r\n                        headroom->Add_Child(\"mix:numerator\", Ztring::ToZtring((1<<BitDepth)-1));\r\n                    }\r\n                }\r\n            }\r\n        }\r\n\r\n        \/\/ImageCaptureMetadata\r\n        std::string Make=MI.Get(Stream_General, 0, General_Encoded_Application_CompanyName).To_UTF8();\r\n        std::string Model=MI.Get(Stream_General, 0, General_Encoded_Library_Name).To_UTF8();\r\n        std::string Software=MI.Get(Stream_General, 0, General_Encoded_Application_Name).To_UTF8();\r\n        std::string Encoded_Date=MI.Get(Stream_Image, Pos, Image_Encoded_Date).To_UTF8();\r\n        if (!Make.empty() || !Model.empty() || !Software.empty() || !Encoded_Date.empty())\r\n        {\r\n            Node* Node_ImageCaptureMetadata=Node_Root->Add_Child(\"mix:ImageCaptureMetadata\");\r\n\r\n            if (!Encoded_Date.empty())\r\n            {\r\n                if (Encoded_Date.size()>4 && Encoded_Date[4]==':')\r\n                    Encoded_Date[4]='-';\r\n                if (Encoded_Date.size()>7 && Encoded_Date[7]==':')\r\n                    Encoded_Date[7]='-';\r\n                if (Encoded_Date.size()>10 && Encoded_Date[10]==' ')\r\n                    Encoded_Date[10]='T';\r\n                Node* Node_GeneralCaptureInformation=Node_ImageCaptureMetadata->Add_Child(\"mix:GeneralCaptureInformation\");\r\n                Node_GeneralCaptureInformation->Add_Child(\"mix:dateTimeCreated\", Encoded_Date);\r\n            }\r\n\r\n            if (!Make.empty() || !Model.empty() || !Software.empty() )\r\n            {\r\n                Node* Node_ScannerCapture=Node_ImageCaptureMetadata->Add_Child(\"mix:ScannerCapture\");\r\n                if (!Make.empty())\r\n                    Node_ScannerCapture->Add_Child(\"mix:scannerManufacturer\", Make);\r\n                if (!Model.empty())\r\n                    Node_ScannerCapture->Add_Child(\"mix:ScannerModel\")->Add_Child(\"mix:scannerModelName\", Model);\r\n                if (!Software.empty())\r\n                    Node_ScannerCapture->Add_Child(\"mix:ScanningSystemSoftware\")->Add_Child(\"mix:scanningSoftwareName\", Software);\r\n            }\r\n        }\r\n\r\n        if (!MI.Get(Stream_Image, Pos, __T(\"Density_X\")).empty() ||\r\n            !MI.Get(Stream_Image, Pos, __T(\"Density_X\")).empty() ||\r\n            !MI.Get(Stream_Image, Pos, Image_ColorSpace).empty())\r\n        {\r\n            Node* Node_ImageAssessmentMetadata=Node_Root->Add_Child(\"mix:ImageAssessmentMetadata\");\r\n\r\n            \/\/SpatialMetrics\r\n            string samplingFrequencyUnit=MI.Get(Stream_Image, Pos, __T(\"Density_Unit\")).To_UTF8();\r\n            Ztring xSamplingFrequency=MI.Get(Stream_Image, Pos, __T(\"Density_X\"));\r\n            Ztring ySamplingFrequency=MI.Get(Stream_Image, Pos, __T(\"Density_Y\"));\r\n            if (!xSamplingFrequency.empty() || !ySamplingFrequency.empty())\r\n            {\r\n                Node* Node_SpatialMetrics=Node_ImageAssessmentMetadata->Add_Child(\"mix:SpatialMetrics\");\r\n\r\n                if (samplingFrequencyUnit.empty())\r\n                    Node_SpatialMetrics->Add_Child(\"mix:samplingFrequencyUnit\", string(\"no absolute unit of measurement\"));\r\n                else if (samplingFrequencyUnit==\"dpi\")\r\n                    Node_SpatialMetrics->Add_Child(\"mix:samplingFrequencyUnit\", string(\"in.\"));\r\n                else if (samplingFrequencyUnit==\"dpcm\")\r\n                    Node_SpatialMetrics->Add_Child(\"mix:samplingFrequencyUnit\", string(\"cm\"));\r\n\r\n                if (!xSamplingFrequency.empty())\r\n                    ComputeSamplingFrequency(Node_SpatialMetrics->Add_Child(\"mix:xSamplingFrequency\"), xSamplingFrequency);\r\n                if (!ySamplingFrequency.empty())\r\n                    ComputeSamplingFrequency(Node_SpatialMetrics->Add_Child(\"mix:ySamplingFrequency\"), ySamplingFrequency);\r\n            }\r\n\r\n            size_t SamplesPerPixel=MI.Get(Stream_Image, Pos, Image_ColorSpace).length();\r\n            if (SamplesPerPixel)\r\n            {\r\n                Node* Node_ImageColorEncoding=Node_ImageAssessmentMetadata->Add_Child(\"mix:ImageColorEncoding\");\r\n\r\n                Node* Node_BitsPerSample=new Node(\"mix:BitsPerSample\");\r\n                for (size_t Pos2=0; Pos2<SamplesPerPixel; ++Pos2)\r\n                    Node_BitsPerSample->Add_Child_IfNotEmpty(MI, Stream_Image, Pos, Image_BitDepth, \"mix:bitsPerSampleValue\");\r\n\r\n                if (!Node_BitsPerSample->Childs.empty())\r\n                {\r\n                    Node_BitsPerSample->Add_Child(\"mix:bitsPerSampleUnit\", std::string(\"integer\"));\r\n                    Node_ImageColorEncoding->Childs.push_back(Node_BitsPerSample);\r\n                }\r\n                else\r\n                   delete Node_BitsPerSample;\r\n\r\n                Node_ImageColorEncoding->Add_Child(\"mix:samplesPerPixel\", Ztring().From_Number(SamplesPerPixel).To_UTF8());\r\n            }\r\n        }\r\n\r\n        if (Node_Extension)\r\n            Node_Root->Childs.push_back(Node_Extension);\r\n\r\n        ToReturn+=Ztring().From_UTF8(To_XML(*Node_Root, 0, true, true).c_str());\r\n    }\r\n\r\n    if (ToReturn.empty())\r\n        ToReturn+=Ztring().From_UTF8(To_XML(*Transform_Header(), 0, true, true).c_str())+=__T(\"\\n\");\r\n\r\n    \/\/Carriage return\r\n    if (MediaInfoLib::Config.LineSeparator_Get()!=__T(\"\\n\"))\r\n        ToReturn.FindAndReplace(__T(\"\\n\"), MediaInfoLib::Config.LineSeparator_Get(), 0, Ztring_Recursive);\r\n\r\n    return ToReturn;\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/\r\n\/\/***************************************************************************\r\n\r\n} \/\/NameSpace\r\n\r\n#endif\r\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: strmsys.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-02 13:03:43 $\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#if defined WNT\n#include \"strmwnt.cxx\"\n#elif defined UNX\n#include \"strmunx.cxx\"\n#elif defined OS2\n#include \"strmos2.cxx\"\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.58); FILE MERGED 2008\/03\/28 15:41:27 rt 1.6.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: strmsys.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_tools.hxx\"\n\n#if defined WNT\n#include \"strmwnt.cxx\"\n#elif defined UNX\n#include \"strmunx.cxx\"\n#elif defined OS2\n#include \"strmos2.cxx\"\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * SourceIndex.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 \"SourceIndex.hpp\"\n\n#include \"UnsavedFiles.hpp\"\n\nusing namespace core ;\n\nnamespace session {\nnamespace modules { \nnamespace clang {\nnamespace libclang {\n\nSourceIndex::SourceIndex()\n{\n   index_ = clang().createIndex(0, 0);\n}\n\nSourceIndex::~SourceIndex()\n{\n   try\n   {\n      \/\/ dispose all translation units\n      for(TranslationUnits::const_iterator it = translationUnits_.begin();\n          it != translationUnits_.end(); ++it)\n      {\n         clang().disposeTranslationUnit(it->second);\n      }\n\n      \/\/ dispose the index\n      clang().disposeIndex(index_);\n   }\n   catch(...)\n   {\n   }\n}\n\nunsigned SourceIndex::getGlobalOptions() const\n{\n   return clang().CXIndex_getGlobalOptions(index_);\n}\n\nvoid SourceIndex::setGlobalOptions(unsigned options)\n{\n   clang().CXIndex_setGlobalOptions(index_, options);\n}\n\nvoid SourceIndex::updateTranslationUnit(const std::string& filename)\n{\n   \/\/ check for an existing translation unit, if we don't have one then\n   \/\/ parse the source file into a translation unit\n   TranslationUnits::iterator it = translationUnits_.find(filename);\n   if (it == translationUnits_.end())\n   {\n\n      \/\/ for now we use the default R command line args for an Rcpp\n      \/\/ package on OSX. We ultimately need to do this dynamically.\n      \/\/ The best way to accomplish this would seem to be the creation\n      \/\/ of a compliation database json file and then the reading of it\n      \/\/ via clang_CompilationDatabase_getCompileCommands\n      const char *args[] = {\n         \"-I\/Library\/Frameworks\/R.framework\/Resources\/include\",\n         \"-DNDEBUG\",\n         \"-I\/usr\/local\/include\/freetype2\",\n         \"-I\/opt\/X11\/include\",\n         \"-I\/Library\/Frameworks\/R.framework\/Resources\/library\/Rcpp\/include\"\n      };\n      int numArgs = sizeof(args) \/ sizeof(*args);\n\n      \/\/ create a new translation unit from the file\n      CXTranslationUnit tu = clang().parseTranslationUnit(\n                            index_,\n                            filename.c_str(),\n                            args,\n                            numArgs,\n                            unsavedFiles().unsavedFilesArray(),\n                            unsavedFiles().numUnsavedFiles(),\n                            clang().defaultEditingTranslationUnitOptions());\n\n\n      \/\/ save it if we succeeded\n      if (tu != NULL)\n      {\n         translationUnits_[filename] = tu;\n      }\n      else\n      {\n         LOG_ERROR_MESSAGE(\"Error parsing translation unit \" + filename);\n      }\n   }\n\n   \/\/ lookup and reparse the translation unit (multiple sources indicate that\n   \/\/ you need to immediately reparse the translation unit after creation\n   \/\/ in order to get the benefit of precompiled headers). note that this\n   \/\/ lookup will fail in the case of error occurring during parsing above\n   it = translationUnits_.find(filename);\n   if (it != translationUnits_.end())\n   {\n      int ret = clang().reparseTranslationUnit(\n                                  it->second,\n                                  unsavedFiles().numUnsavedFiles(),\n                                  unsavedFiles().unsavedFilesArray(),\n                                  clang().defaultReparseOptions(it->second));\n\n      \/\/ if this returns an error then we need to dispose the translation unit\n      if (ret != 0)\n      {\n         LOG_ERROR_MESSAGE(\"Error re-parsing translation unit \" + filename);\n         removeTranslationUnit(filename);\n      }\n   }\n}\n\nvoid SourceIndex::removeTranslationUnit(const std::string& filename)\n{\n   TranslationUnits::iterator it = translationUnits_.find(filename);\n   if (it != translationUnits_.end())\n   {\n      clang().disposeTranslationUnit(it->second);\n      translationUnits_.erase(it->first);\n   }\n}\n\nbool SourceIndex::hasTranslationUnit(const std::string& filename)\n{\n   return translationUnits_.find(filename) != translationUnits_.end();\n}\n\nTranslationUnit SourceIndex::getTranslationUnit(\n                                          const std::string& filename) const\n{\n   TranslationUnits::const_iterator it = translationUnits_.find(filename);\n   if (it != translationUnits_.end())\n      return TranslationUnit(it->first, it->second);\n   else\n      return TranslationUnit();\n}\n\n\n\n\/\/ singleton\nSourceIndex& sourceIndex()\n{\n   static SourceIndex instance;\n   return instance;\n}\n\n} \/\/ namespace libclang\n} \/\/ namespace clang\n} \/\/ namespace modules\n} \/\/ namesapce session\n\n<commit_msg>add libstdc++ and \/usr\/local\/include to mac defaults<commit_after>\/*\n * SourceIndex.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 \"SourceIndex.hpp\"\n\n#include \"UnsavedFiles.hpp\"\n\nusing namespace core ;\n\nnamespace session {\nnamespace modules { \nnamespace clang {\nnamespace libclang {\n\nSourceIndex::SourceIndex()\n{\n   index_ = clang().createIndex(0, 0);\n}\n\nSourceIndex::~SourceIndex()\n{\n   try\n   {\n      \/\/ dispose all translation units\n      for(TranslationUnits::const_iterator it = translationUnits_.begin();\n          it != translationUnits_.end(); ++it)\n      {\n         clang().disposeTranslationUnit(it->second);\n      }\n\n      \/\/ dispose the index\n      clang().disposeIndex(index_);\n   }\n   catch(...)\n   {\n   }\n}\n\nunsigned SourceIndex::getGlobalOptions() const\n{\n   return clang().CXIndex_getGlobalOptions(index_);\n}\n\nvoid SourceIndex::setGlobalOptions(unsigned options)\n{\n   clang().CXIndex_setGlobalOptions(index_, options);\n}\n\nvoid SourceIndex::updateTranslationUnit(const std::string& filename)\n{\n   \/\/ check for an existing translation unit, if we don't have one then\n   \/\/ parse the source file into a translation unit\n   TranslationUnits::iterator it = translationUnits_.find(filename);\n   if (it == translationUnits_.end())\n   {\n\n      \/\/ for now we use the default R command line args for an Rcpp\n      \/\/ package on OSX. We ultimately need to do this dynamically.\n      \/\/ The best way to accomplish this would seem to be the creation\n      \/\/ of a compliation database json file and then the reading of it\n      \/\/ via clang_CompilationDatabase_getCompileCommands\n      const char *args[] = {\n         \"-stdlib=libstdc++\",\n         \"-I\/Library\/Frameworks\/R.framework\/Resources\/include\",\n         \"-DNDEBUG\",\n         \"-I\/usr\/local\/include\",\n         \"-I\/usr\/local\/include\/freetype2\",\n         \"-I\/opt\/X11\/include\",\n         \"-I\/Library\/Frameworks\/R.framework\/Resources\/library\/Rcpp\/include\"\n      };\n      int numArgs = sizeof(args) \/ sizeof(*args);\n\n      \/\/ create a new translation unit from the file\n      CXTranslationUnit tu = clang().parseTranslationUnit(\n                            index_,\n                            filename.c_str(),\n                            args,\n                            numArgs,\n                            unsavedFiles().unsavedFilesArray(),\n                            unsavedFiles().numUnsavedFiles(),\n                            clang().defaultEditingTranslationUnitOptions());\n\n\n      \/\/ save it if we succeeded\n      if (tu != NULL)\n      {\n         translationUnits_[filename] = tu;\n      }\n      else\n      {\n         LOG_ERROR_MESSAGE(\"Error parsing translation unit \" + filename);\n      }\n   }\n\n   \/\/ lookup and reparse the translation unit (multiple sources indicate that\n   \/\/ you need to immediately reparse the translation unit after creation\n   \/\/ in order to get the benefit of precompiled headers). note that this\n   \/\/ lookup will fail in the case of error occurring during parsing above\n   it = translationUnits_.find(filename);\n   if (it != translationUnits_.end())\n   {\n      int ret = clang().reparseTranslationUnit(\n                                  it->second,\n                                  unsavedFiles().numUnsavedFiles(),\n                                  unsavedFiles().unsavedFilesArray(),\n                                  clang().defaultReparseOptions(it->second));\n\n      \/\/ if this returns an error then we need to dispose the translation unit\n      if (ret != 0)\n      {\n         LOG_ERROR_MESSAGE(\"Error re-parsing translation unit \" + filename);\n         removeTranslationUnit(filename);\n      }\n   }\n}\n\nvoid SourceIndex::removeTranslationUnit(const std::string& filename)\n{\n   TranslationUnits::iterator it = translationUnits_.find(filename);\n   if (it != translationUnits_.end())\n   {\n      clang().disposeTranslationUnit(it->second);\n      translationUnits_.erase(it->first);\n   }\n}\n\nbool SourceIndex::hasTranslationUnit(const std::string& filename)\n{\n   return translationUnits_.find(filename) != translationUnits_.end();\n}\n\nTranslationUnit SourceIndex::getTranslationUnit(\n                                          const std::string& filename) const\n{\n   TranslationUnits::const_iterator it = translationUnits_.find(filename);\n   if (it != translationUnits_.end())\n      return TranslationUnit(it->first, it->second);\n   else\n      return TranslationUnit();\n}\n\n\n\n\/\/ singleton\nSourceIndex& sourceIndex()\n{\n   static SourceIndex instance;\n   return instance;\n}\n\n} \/\/ namespace libclang\n} \/\/ namespace clang\n} \/\/ namespace modules\n} \/\/ namesapce session\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** 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** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <QWidget>\n#include <qaccelerometer.h>\n#include <qorientationsensor.h>\n\nclass MyWidget : public QWidget\n{\n    void create();\n};\n\nvoid MyWidget::create()\n{\n\/\/! [Creating a sensor]\n\/\/ On the heap (deleted when this object is deleted)\nQAccelerometer *sensor = new QAccelerometer(this);\n\n\/\/ On the stack (deleted when the current scope ends)\nQOrientationSensor orient_sensor;\n\/\/! [Creating a sensor]\n\n    Q_UNUSED(sensor)\n    Q_UNUSED(orient_sensor);\n}\n\n<commit_msg>Don't include QWidget.<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** 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** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <QObject>\n#include <qaccelerometer.h>\n#include <qorientationsensor.h>\n\nclass MyObject : public QObject\n{\n    void create();\n};\n\nvoid MyObject::create()\n{\n\/\/! [Creating a sensor]\n\/\/ On the heap (deleted when this object is deleted)\nQAccelerometer *sensor = new QAccelerometer(this);\n\n\/\/ On the stack (deleted when the current scope ends)\nQOrientationSensor orient_sensor;\n\/\/! [Creating a sensor]\n\n    Q_UNUSED(sensor)\n    Q_UNUSED(orient_sensor);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * SessionPanmirror.cpp\n *\n * Copyright (C) 2009-16 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 \"SessionPanmirror.hpp\"\n\n\n#include <shared_core\/Error.hpp>\n#include <core\/Exec.hpp>\n#include <core\/StringUtils.hpp>\n\n#include <core\/system\/Process.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n\nusing namespace rstudio::core;\n\nnamespace rstudio {\nnamespace session {\nnamespace modules {\nnamespace panmirror {\n\nnamespace {\n\n\nError runPandoc(const std::vector<std::string>& args, const std::string& input, core::system::ProcessResult* pResult)\n{\n   FilePath pandocPath = FilePath(core::system::getenv(\"RSTUDIO_PANDOC\")).completeChildPath(\"pandoc\");\n   return core::system::runProgram(\n      string_utils::utf8ToSystem(pandocPath.getAbsolutePath()),\n      args,\n      input,\n      core::system::ProcessOptions(),\n      pResult\n   );\n}\n\nError readOptionsParam(const json::Array& options, std::vector<std::string>* pOptions)\n{\n   for(json::Array::Iterator\n         it = options.begin();\n         it != options.end();\n         ++it)\n   {\n      if ((*it).getType() != json::Type::STRING)\n         return Error(json::errc::ParamTypeMismatch, ERROR_LOCATION);\n\n      std::string option = (*it).getString() ;\n      pOptions->push_back(option);\n   }\n   return Success();\n}\n\nstd::string errorMessage(const Error& error)\n{\n   std::string msg = error.getMessage();\n   if (msg.length() == 0)\n   {\n      msg = error.getProperty(\"category\");\n   }\n   if (msg.length() == 0)\n   {\n      msg = error.getName();\n   }\n   return msg;\n}\n\n\nvoid setPandocErrorResponse(const Error& error,\n                            json::JsonRpcResponse* pResponse)\n{\n   LOG_ERROR(error);\n   pResponse->setError(error, errorMessage(error));\n}\n\nvoid setPandocErrorResponse(const core::system::ProcessResult& result,\n                            json::JsonRpcResponse* pResponse)\n{\n   Error error = systemError(boost::system::errc::state_not_recoverable, result.stdErr, ERROR_LOCATION);\n   LOG_ERROR(error);\n   pResponse->setError(error, result.stdErr);\n}\n\nError pandocAstToMarkdown(const json::JsonRpcRequest& request,\n                          json::JsonRpcResponse* pResponse)\n{\n   \/\/ extract params\n   json::Object jsonAst;\n   std::string format;\n   json::Array jsonOptions;\n   Error error = json::readParams(request.params, &jsonAst, &format, &jsonOptions);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n   std::vector<std::string> options;\n   error = readOptionsParam(jsonOptions, &options);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ build args\n   std::vector<std::string> args;\n   args.push_back(\"--from\");\n   args.push_back(\"json\");\n   args.push_back(\"--to\");\n   args.push_back(format);\n   std::copy(options.begin(), options.end(), std::back_inserter(args));\n\n   \/\/ run pandoc\n   core::system::ProcessResult result;\n   error = runPandoc(args, jsonAst.write(), &result);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   if (result.exitStatus == EXIT_SUCCESS)\n   {\n      pResponse->setResult(result.stdOut);\n   }\n   else\n   {\n      setPandocErrorResponse(result, pResponse);\n   }\n\n   return Success();\n}\n\nError pandocMarkdownToAst(const json::JsonRpcRequest& request,\n                          json::JsonRpcResponse* pResponse)\n{\n   \/\/ extract params\n   json::Array jsonOptions;\n   std::string markdown, format;\n   Error error = json::readParams(request.params, &markdown, &format, &jsonOptions);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n   std::vector<std::string> options;\n   error = readOptionsParam(jsonOptions, &options);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ build args\n   std::vector<std::string> args;\n   args.push_back(\"--from\");\n   args.push_back(format);\n   args.push_back(\"--to\");\n   args.push_back(\"json\");\n   std::copy(options.begin(), options.end(), std::back_inserter(args));\n\n   \/\/ run pandoc\n   core::system::ProcessResult result;\n   error = runPandoc(args, markdown, &result);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ return output on success\n   if (result.exitStatus == EXIT_SUCCESS)\n   {\n      using namespace json;\n      json::Value jsonAst;\n      Error error = jsonAst.parse(result.stdOut);\n      if (error)\n      {\n         Error parseError(boost::system::errc::state_not_recoverable,\n                          errorMessage(error),\n                          ERROR_LOCATION);\n         setPandocErrorResponse(parseError, pResponse);\n      }\n      else if (!isType<json::Object>(jsonAst))\n      {\n         Error outputError(boost::system::errc::state_not_recoverable,\n                           \"Unexpected JSON output from pandoc\",\n                           ERROR_LOCATION);\n         setPandocErrorResponse(outputError, pResponse);\n      }\n      else\n      {\n         pResponse->setResult(jsonAst);\n      }\n   }\n   else\n   {\n      setPandocErrorResponse(result, pResponse);\n   }\n\n   return Success();\n}\n\nError pandocListExtensions(const json::JsonRpcRequest& request,\n                           json::JsonRpcResponse* pResponse)\n{\n   \/\/ extract format\n   std::string format;\n   Error error = json::readParams(request.params, &format);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ build args\n   std::vector<std::string> args;\n   std::string extensions =  \"--list-extensions\";\n   if (!format.empty())\n      extensions += ('=' + format);\n   args.push_back(extensions);\n\n   \/\/ run pandoc\n   core::system::ProcessResult result;\n   error = runPandoc(args, \"\", &result);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ return output on success\n   if (result.exitStatus == EXIT_SUCCESS)\n   {\n      pResponse->setResult(result.stdOut);\n   }\n   else\n   {\n      setPandocErrorResponse(result, pResponse);\n   }\n\n   return Success();\n}\n\n\n\n} \/\/ end anonymous namespace\n\nError initialize()\n{\n   ExecBlock initBlock;\n   initBlock.addFunctions()\n      (boost::bind(module_context::registerRpcMethod, \"pandoc_ast_to_markdown\", pandocAstToMarkdown))\n      (boost::bind(module_context::registerRpcMethod, \"pandoc_markdown_to_ast\", pandocMarkdownToAst))\n      (boost::bind(module_context::registerRpcMethod, \"pandoc_list_extensions\", pandocListExtensions))\n   ;\n   return initBlock.execute();\n}\n\n} \/\/ end namespace panmirror\n} \/\/ end namespace modules\n} \/\/ end namespace session\n} \/\/ end namespace rstudio\n<commit_msg>correct path to pandoc on win32<commit_after>\/*\n * SessionPanmirror.cpp\n *\n * Copyright (C) 2009-16 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 \"SessionPanmirror.hpp\"\n\n\n#include <shared_core\/Error.hpp>\n#include <core\/Exec.hpp>\n#include <core\/StringUtils.hpp>\n\n#include <core\/system\/Process.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n\nusing namespace rstudio::core;\n\nnamespace rstudio {\nnamespace session {\nnamespace modules {\nnamespace panmirror {\n\nnamespace {\n\nError runPandoc(const std::vector<std::string>& args, const std::string& input, core::system::ProcessResult* pResult)\n{\n#ifndef WIN32\n   std::string pandoc = \"pandoc\";\n#else\n   std::string pandoc = \"pandoc.exe\";\n#endif\n   FilePath pandocPath = FilePath(core::system::getenv(\"RSTUDIO_PANDOC\")).completeChildPath(pandoc);\n   return core::system::runProgram(\n      string_utils::utf8ToSystem(pandocPath.getAbsolutePath()),\n      args,\n      input,\n      core::system::ProcessOptions(),\n      pResult\n   );\n}\n\nError readOptionsParam(const json::Array& options, std::vector<std::string>* pOptions)\n{\n   for(json::Array::Iterator\n         it = options.begin();\n         it != options.end();\n         ++it)\n   {\n      if ((*it).getType() != json::Type::STRING)\n         return Error(json::errc::ParamTypeMismatch, ERROR_LOCATION);\n\n      std::string option = (*it).getString() ;\n      pOptions->push_back(option);\n   }\n   return Success();\n}\n\nstd::string errorMessage(const Error& error)\n{\n   std::string msg = error.getMessage();\n   if (msg.length() == 0)\n   {\n      msg = error.getProperty(\"category\");\n   }\n   if (msg.length() == 0)\n   {\n      msg = error.getName();\n   }\n   return msg;\n}\n\n\nvoid setPandocErrorResponse(const Error& error,\n                            json::JsonRpcResponse* pResponse)\n{\n   LOG_ERROR(error);\n   pResponse->setError(error, errorMessage(error));\n}\n\nvoid setPandocErrorResponse(const core::system::ProcessResult& result,\n                            json::JsonRpcResponse* pResponse)\n{\n   Error error = systemError(boost::system::errc::state_not_recoverable, result.stdErr, ERROR_LOCATION);\n   LOG_ERROR(error);\n   pResponse->setError(error, result.stdErr);\n}\n\nError pandocAstToMarkdown(const json::JsonRpcRequest& request,\n                          json::JsonRpcResponse* pResponse)\n{\n   \/\/ extract params\n   json::Object jsonAst;\n   std::string format;\n   json::Array jsonOptions;\n   Error error = json::readParams(request.params, &jsonAst, &format, &jsonOptions);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n   std::vector<std::string> options;\n   error = readOptionsParam(jsonOptions, &options);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ build args\n   std::vector<std::string> args;\n   args.push_back(\"--from\");\n   args.push_back(\"json\");\n   args.push_back(\"--to\");\n   args.push_back(format);\n   std::copy(options.begin(), options.end(), std::back_inserter(args));\n\n   \/\/ run pandoc\n   core::system::ProcessResult result;\n   error = runPandoc(args, jsonAst.write(), &result);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   if (result.exitStatus == EXIT_SUCCESS)\n   {\n      pResponse->setResult(result.stdOut);\n   }\n   else\n   {\n      setPandocErrorResponse(result, pResponse);\n   }\n\n   return Success();\n}\n\nError pandocMarkdownToAst(const json::JsonRpcRequest& request,\n                          json::JsonRpcResponse* pResponse)\n{\n   \/\/ extract params\n   json::Array jsonOptions;\n   std::string markdown, format;\n   Error error = json::readParams(request.params, &markdown, &format, &jsonOptions);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n   std::vector<std::string> options;\n   error = readOptionsParam(jsonOptions, &options);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ build args\n   std::vector<std::string> args;\n   args.push_back(\"--from\");\n   args.push_back(format);\n   args.push_back(\"--to\");\n   args.push_back(\"json\");\n   std::copy(options.begin(), options.end(), std::back_inserter(args));\n\n   \/\/ run pandoc\n   core::system::ProcessResult result;\n   error = runPandoc(args, markdown, &result);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ return output on success\n   if (result.exitStatus == EXIT_SUCCESS)\n   {\n      using namespace json;\n      json::Value jsonAst;\n      Error error = jsonAst.parse(result.stdOut);\n      if (error)\n      {\n         Error parseError(boost::system::errc::state_not_recoverable,\n                          errorMessage(error),\n                          ERROR_LOCATION);\n         setPandocErrorResponse(parseError, pResponse);\n      }\n      else if (!isType<json::Object>(jsonAst))\n      {\n         Error outputError(boost::system::errc::state_not_recoverable,\n                           \"Unexpected JSON output from pandoc\",\n                           ERROR_LOCATION);\n         setPandocErrorResponse(outputError, pResponse);\n      }\n      else\n      {\n         pResponse->setResult(jsonAst);\n      }\n   }\n   else\n   {\n      setPandocErrorResponse(result, pResponse);\n   }\n\n   return Success();\n}\n\nError pandocListExtensions(const json::JsonRpcRequest& request,\n                           json::JsonRpcResponse* pResponse)\n{\n   \/\/ extract format\n   std::string format;\n   Error error = json::readParams(request.params, &format);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ build args\n   std::vector<std::string> args;\n   std::string extensions =  \"--list-extensions\";\n   if (!format.empty())\n      extensions += ('=' + format);\n   args.push_back(extensions);\n\n   \/\/ run pandoc\n   core::system::ProcessResult result;\n   error = runPandoc(args, \"\", &result);\n   if (error)\n   {\n      setPandocErrorResponse(error, pResponse);\n      return Success();\n   }\n\n   \/\/ return output on success\n   if (result.exitStatus == EXIT_SUCCESS)\n   {\n      pResponse->setResult(result.stdOut);\n   }\n   else\n   {\n      setPandocErrorResponse(result, pResponse);\n   }\n\n   return Success();\n}\n\n\n\n} \/\/ end anonymous namespace\n\nError initialize()\n{\n   ExecBlock initBlock;\n   initBlock.addFunctions()\n      (boost::bind(module_context::registerRpcMethod, \"pandoc_ast_to_markdown\", pandocAstToMarkdown))\n      (boost::bind(module_context::registerRpcMethod, \"pandoc_markdown_to_ast\", pandocMarkdownToAst))\n      (boost::bind(module_context::registerRpcMethod, \"pandoc_list_extensions\", pandocListExtensions))\n   ;\n   return initBlock.execute();\n}\n\n} \/\/ end namespace panmirror\n} \/\/ end namespace modules\n} \/\/ end namespace session\n} \/\/ end namespace rstudio\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2008 James Molloy, Jörg Pfähler, Matthew Iselin\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 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 <machine\/Machine.h>\n#include <utilities\/StaticString.h>\n\nextern \"C\" void __cyg_profile_func_enter (void *func_address, void *call_site)\n  __attribute__((no_instrument_function));\nextern \"C\" void __cyg_profile_func_exit (void *func_address, void *call_site)\n  __attribute__((no_instrument_function));\n\n#define OUT(c) asm volatile (\"outb %%al, %%dx\" :: \"d\"(0x2f8), \"a\"(c))\n\nextern \"C\" void __cyg_profile_func_enter (void *func_address, void *call_site)\n{\n    uint32_t _func_address = reinterpret_cast<uintptr_t>(func_address)&0xFFFFFFFF;\n    uint32_t _call_site = reinterpret_cast<uintptr_t>(call_site)&0xFFFFFFFF;\n\n\/\/    register int eflags;\n\/\/    asm volatile (\"pushf; pop %0; cli\" : \"=r\" (eflags));\n    OUT('E');\n    OUT('0' + ((_func_address>>(32-4))&0xF));\n    OUT('0' + ((_func_address>>(32-8))&0xF));\n    OUT('0' + ((_func_address>>(32-12))&0xF));\n    OUT('0' + ((_func_address>>(32-16))&0xF));\n    OUT('0' + ((_func_address>>(32-20))&0xF));\n    OUT('0' + ((_func_address>>(32-24))&0xF));\n    OUT('0' + ((_func_address>>(32-28))&0xF));\n    OUT('0' + ((_func_address>>(32-32))&0xF));\n    OUT(' ');\n    OUT('0' + ((_call_site>>(32-4))&0xF));\n    OUT('0' + ((_call_site>>(32-8))&0xF));\n    OUT('0' + ((_call_site>>(32-12))&0xF));\n    OUT('0' + ((_call_site>>(32-16))&0xF));\n    OUT('0' + ((_call_site>>(32-20))&0xF));\n    OUT('0' + ((_call_site>>(32-24))&0xF));\n    OUT('0' + ((_call_site>>(32-28))&0xF));\n    OUT('0' + ((_call_site>>(32-32))&0xF));\n    OUT('\\n');\n\/\/    asm volatile(\"push %0; popf\" ::\"r\" (eflags));\n}\n\nextern \"C\" void __cyg_profile_func_exit (void *func_address, void *call_site)\n{\n}\n<commit_msg>Fix x86-only inline assembly in instrument.cc<commit_after>\/*\n * Copyright (c) 2008 James Molloy, Jörg Pfähler, Matthew Iselin\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 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 <machine\/Machine.h>\n#include <utilities\/StaticString.h>\n\nextern \"C\" void __cyg_profile_func_enter (void *func_address, void *call_site)\n  __attribute__((no_instrument_function));\nextern \"C\" void __cyg_profile_func_exit (void *func_address, void *call_site)\n  __attribute__((no_instrument_function));\n\n#ifdef X86_COMMON\n#define OUT(c) asm volatile (\"outb %%al, %%dx\" :: \"d\"(0x2f8), \"a\"(c))\n#else\n#define OUT(C)\n#endif\n\nextern \"C\" void __cyg_profile_func_enter (void *func_address, void *call_site)\n{\n    uint32_t _func_address = reinterpret_cast<uintptr_t>(func_address)&0xFFFFFFFF;\n    uint32_t _call_site = reinterpret_cast<uintptr_t>(call_site)&0xFFFFFFFF;\n\n\/\/    register int eflags;\n\/\/    asm volatile (\"pushf; pop %0; cli\" : \"=r\" (eflags));\n    OUT('E');\n    OUT('0' + ((_func_address>>(32-4))&0xF));\n    OUT('0' + ((_func_address>>(32-8))&0xF));\n    OUT('0' + ((_func_address>>(32-12))&0xF));\n    OUT('0' + ((_func_address>>(32-16))&0xF));\n    OUT('0' + ((_func_address>>(32-20))&0xF));\n    OUT('0' + ((_func_address>>(32-24))&0xF));\n    OUT('0' + ((_func_address>>(32-28))&0xF));\n    OUT('0' + ((_func_address>>(32-32))&0xF));\n    OUT(' ');\n    OUT('0' + ((_call_site>>(32-4))&0xF));\n    OUT('0' + ((_call_site>>(32-8))&0xF));\n    OUT('0' + ((_call_site>>(32-12))&0xF));\n    OUT('0' + ((_call_site>>(32-16))&0xF));\n    OUT('0' + ((_call_site>>(32-20))&0xF));\n    OUT('0' + ((_call_site>>(32-24))&0xF));\n    OUT('0' + ((_call_site>>(32-28))&0xF));\n    OUT('0' + ((_call_site>>(32-32))&0xF));\n    OUT('\\n');\n\/\/    asm volatile(\"push %0; popf\" ::\"r\" (eflags));\n}\n\nextern \"C\" void __cyg_profile_func_exit (void *func_address, void *call_site)\n{\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (C) 2014 PX4 Development Team. All rights reserved.\n *   Author: Holger Steinhaus <hsteinhaus@gmx.de>\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 motor_test.c\n *\n * Tool for drive testing\n *\/\n\n#include <drivers\/drv_hrt.h>\n#include <px4_platform_common\/px4_config.h>\n#include <px4_platform_common\/getopt.h>\n#include <px4_platform_common\/log.h>\n#include <px4_platform_common\/module.h>\n#include <uORB\/PublicationQueued.hpp>\n#include <uORB\/topics\/test_motor.h>\n\nextern \"C\" __EXPORT int motor_test_main(int argc, char *argv[]);\n\nstatic void motor_test(unsigned channel, float value, uint8_t driver_instance, int timeout_ms);\nstatic void usage(const char *reason);\n\nvoid motor_test(unsigned channel, float value, uint8_t driver_instance, int timeout_ms)\n{\n\ttest_motor_s test_motor{};\n\ttest_motor.timestamp = hrt_absolute_time();\n\ttest_motor.motor_number = channel;\n\ttest_motor.value = value;\n\ttest_motor.action = value >= 0.f ? test_motor_s::ACTION_RUN : test_motor_s::ACTION_STOP;\n\ttest_motor.driver_instance = driver_instance;\n\ttest_motor.timeout_ms = timeout_ms;\n\n\tuORB::PublicationQueued<test_motor_s> test_motor_pub{ORB_ID(test_motor)};\n\ttest_motor_pub.publish(test_motor);\n\n\tif (test_motor.action == test_motor_s::ACTION_STOP) {\n\t\tPX4_INFO(\"motors stop command sent\");\n\n\t} else {\n\t\tPX4_INFO(\"motor %d set to %.2f\", channel, (double)value);\n\t}\n}\n\nstatic void usage(const char *reason)\n{\n\tif (reason != nullptr) {\n\t\tPX4_WARN(\"%s\", reason);\n\t}\n\n\tPRINT_MODULE_DESCRIPTION(\n\t\tR\"DESCR_STR(\nUtility to test motors.\n\nWARNING: remove all props before using this command.\n\nNote: this can only be used for drivers which support the motor_test uorb topic (not px4io).\n)DESCR_STR\");\n\n\tPRINT_MODULE_USAGE_NAME(\"motor_test\", \"command\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"test\", \"Set motor(s) to a specific output value\");\n\tPRINT_MODULE_USAGE_PARAM_INT('m', -1, 0, 7, \"Motor to test (0...7, all if not specified)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('p', 0, 0, 100, \"Power (0...100)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('t', 0, 0, 100, \"Timeout in seconds (default=no timeout)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('i', 0, 0, 4, \"driver instance\", true);\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"stop\", \"Stop all motors\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"iterate\", \"Iterate all motors starting and stopping one after the other\");\n\n}\n\nint motor_test_main(int argc, char *argv[])\n{\n\tint channel = -1; \/\/default to all channels\n\tunsigned long lval;\n\tfloat value = 0.0f;\n\tuint8_t driver_instance = 0;\n\tint ch;\n\tint timeout_ms = 0;\n\n\tint myoptind = 1;\n\tconst char *myoptarg = nullptr;\n\n\twhile ((ch = px4_getopt(argc, argv, \"i:m:p:t:\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\n\t\tcase 'i':\n\t\t\tdriver_instance = (uint8_t)strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tcase 'm':\n\t\t\t\/* Read in motor number *\/\n\t\t\tchannel = (int)strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tcase 'p':\n\t\t\t\/* Read in power value *\/\n\t\t\tlval = strtoul(myoptarg, nullptr, 0);\n\n\t\t\tif (lval > 100) {\n\t\t\t\tusage(\"value invalid\");\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tvalue = ((float)lval) \/ 100.f;\n\t\t\tbreak;\n\n\t\tcase 't':\n\t\t\ttimeout_ms = strtol(myoptarg, nullptr, 0) * 1000;\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tusage(nullptr);\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tbool run_test = true;\n\n\tif (myoptind >= 0 && myoptind < argc) {\n\t\tif (strcmp(\"stop\", argv[myoptind]) == 0) {\n\t\t\tchannel = 0;\n\t\t\tvalue = -1.f;\n\n\t\t} else if (strcmp(\"iterate\", argv[myoptind]) == 0) {\n\t\t\tvalue = 0.15f;\n\n\t\t\tfor (int i = 0; i < 8; ++i) {\n\t\t\t\tmotor_test(i, value, driver_instance, 0);\n\t\t\t\tpx4_usleep(500000);\n\t\t\t\tmotor_test(i, -1.f, driver_instance, 0);\n\t\t\t\tpx4_usleep(10000);\n\t\t\t}\n\n\t\t\trun_test = false;\n\n\t\t} else if (strcmp(\"test\", argv[myoptind]) == 0) {\n\t\t\t\/\/ nothing to do\n\t\t} else {\n\t\t\tusage(nullptr);\n\t\t\treturn 0;\n\t\t}\n\n\t} else {\n\t\tusage(nullptr);\n\t\treturn 0;\n\t}\n\n\tif (run_test) {\n\t\tif (channel < 0) {\n\t\t\tfor (int i = 0; i < 8; ++i) {\n\t\t\t\tmotor_test(i, value, driver_instance, timeout_ms);\n\t\t\t\tpx4_usleep(10000);\n\t\t\t}\n\n\t\t} else {\n\t\t\tmotor_test(channel, value, driver_instance, timeout_ms);\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>motor_test: remove note about supported drivers<commit_after>\/****************************************************************************\n *\n *   Copyright (C) 2014 PX4 Development Team. All rights reserved.\n *   Author: Holger Steinhaus <hsteinhaus@gmx.de>\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 motor_test.c\n *\n * Tool for drive testing\n *\/\n\n#include <drivers\/drv_hrt.h>\n#include <px4_platform_common\/px4_config.h>\n#include <px4_platform_common\/getopt.h>\n#include <px4_platform_common\/log.h>\n#include <px4_platform_common\/module.h>\n#include <uORB\/PublicationQueued.hpp>\n#include <uORB\/topics\/test_motor.h>\n\nextern \"C\" __EXPORT int motor_test_main(int argc, char *argv[]);\n\nstatic void motor_test(unsigned channel, float value, uint8_t driver_instance, int timeout_ms);\nstatic void usage(const char *reason);\n\nvoid motor_test(unsigned channel, float value, uint8_t driver_instance, int timeout_ms)\n{\n\ttest_motor_s test_motor{};\n\ttest_motor.timestamp = hrt_absolute_time();\n\ttest_motor.motor_number = channel;\n\ttest_motor.value = value;\n\ttest_motor.action = value >= 0.f ? test_motor_s::ACTION_RUN : test_motor_s::ACTION_STOP;\n\ttest_motor.driver_instance = driver_instance;\n\ttest_motor.timeout_ms = timeout_ms;\n\n\tuORB::PublicationQueued<test_motor_s> test_motor_pub{ORB_ID(test_motor)};\n\ttest_motor_pub.publish(test_motor);\n\n\tif (test_motor.action == test_motor_s::ACTION_STOP) {\n\t\tPX4_INFO(\"motors stop command sent\");\n\n\t} else {\n\t\tPX4_INFO(\"motor %d set to %.2f\", channel, (double)value);\n\t}\n}\n\nstatic void usage(const char *reason)\n{\n\tif (reason != nullptr) {\n\t\tPX4_WARN(\"%s\", reason);\n\t}\n\n\tPRINT_MODULE_DESCRIPTION(\n\t\tR\"DESCR_STR(\nUtility to test motors.\n\nWARNING: remove all props before using this command.\n)DESCR_STR\");\n\n\tPRINT_MODULE_USAGE_NAME(\"motor_test\", \"command\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"test\", \"Set motor(s) to a specific output value\");\n\tPRINT_MODULE_USAGE_PARAM_INT('m', -1, 0, 7, \"Motor to test (0...7, all if not specified)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('p', 0, 0, 100, \"Power (0...100)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('t', 0, 0, 100, \"Timeout in seconds (default=no timeout)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('i', 0, 0, 4, \"driver instance\", true);\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"stop\", \"Stop all motors\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"iterate\", \"Iterate all motors starting and stopping one after the other\");\n\n}\n\nint motor_test_main(int argc, char *argv[])\n{\n\tint channel = -1; \/\/default to all channels\n\tunsigned long lval;\n\tfloat value = 0.0f;\n\tuint8_t driver_instance = 0;\n\tint ch;\n\tint timeout_ms = 0;\n\n\tint myoptind = 1;\n\tconst char *myoptarg = nullptr;\n\n\twhile ((ch = px4_getopt(argc, argv, \"i:m:p:t:\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\n\t\tcase 'i':\n\t\t\tdriver_instance = (uint8_t)strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tcase 'm':\n\t\t\t\/* Read in motor number *\/\n\t\t\tchannel = (int)strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tcase 'p':\n\t\t\t\/* Read in power value *\/\n\t\t\tlval = strtoul(myoptarg, nullptr, 0);\n\n\t\t\tif (lval > 100) {\n\t\t\t\tusage(\"value invalid\");\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tvalue = ((float)lval) \/ 100.f;\n\t\t\tbreak;\n\n\t\tcase 't':\n\t\t\ttimeout_ms = strtol(myoptarg, nullptr, 0) * 1000;\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tusage(nullptr);\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tbool run_test = true;\n\n\tif (myoptind >= 0 && myoptind < argc) {\n\t\tif (strcmp(\"stop\", argv[myoptind]) == 0) {\n\t\t\tchannel = 0;\n\t\t\tvalue = -1.f;\n\n\t\t} else if (strcmp(\"iterate\", argv[myoptind]) == 0) {\n\t\t\tvalue = 0.15f;\n\n\t\t\tfor (int i = 0; i < 8; ++i) {\n\t\t\t\tmotor_test(i, value, driver_instance, 0);\n\t\t\t\tpx4_usleep(500000);\n\t\t\t\tmotor_test(i, -1.f, driver_instance, 0);\n\t\t\t\tpx4_usleep(10000);\n\t\t\t}\n\n\t\t\trun_test = false;\n\n\t\t} else if (strcmp(\"test\", argv[myoptind]) == 0) {\n\t\t\t\/\/ nothing to do\n\t\t} else {\n\t\t\tusage(nullptr);\n\t\t\treturn 0;\n\t\t}\n\n\t} else {\n\t\tusage(nullptr);\n\t\treturn 0;\n\t}\n\n\tif (run_test) {\n\t\tif (channel < 0) {\n\t\t\tfor (int i = 0; i < 8; ++i) {\n\t\t\t\tmotor_test(i, value, driver_instance, timeout_ms);\n\t\t\t\tpx4_usleep(10000);\n\t\t\t}\n\n\t\t} else {\n\t\t\tmotor_test(channel, value, driver_instance, timeout_ms);\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* BM3D denoising filter - VapourSynth plugin\n* Copyright (C) 2015  mawen1250\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 \"BM3D.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Functions of struct BM3D_Para\n\n\nBM3D_Para::BM3D_Para(bool _wiener, std::string _profile)\n    : wiener(_wiener), profile(_profile), sigma({ 10.0, 10.0, 10.0 })\n{\n    BlockSize = 8;\n    BMrange = 16;\n    BMstep = 1;\n\n    if (!wiener)\n    {\n        BlockStep = 4;\n        GroupSize = 16;\n        lambda = 2.7;\n    }\n    else\n    {\n        BlockStep = 3;\n        GroupSize = 32;\n    }\n\n    if (profile == \"fast\")\n    {\n        BMrange = 9;\n\n        if (!wiener)\n        {\n            BlockStep = 8;\n        }\n        else\n        {\n            BlockStep = 7;\n            GroupSize = 16;\n        }\n    }\n    else if (profile == \"lc\")\n    {\n        BMrange = 9;\n\n        if (!wiener)\n        {\n            BlockStep = 6;\n        }\n        else\n        {\n            BlockStep = 5;\n            GroupSize = 16;\n        }\n    }\n    else if (profile == \"high\")\n    {\n        if (!wiener)\n        {\n            BlockStep = 3;\n        }\n        else\n        {\n            BlockStep = 2;\n        }\n    }\n    else if (profile == \"vn\")\n    {\n        if (!wiener)\n        {\n            BlockStep = 4;\n            GroupSize = 32;\n            lambda = 2.8;\n        }\n        else\n        {\n            BlockSize = 11;\n            BlockStep = 6;\n        }\n    }\n\n    thMSE_Default();\n}\n\n\nvoid BM3D_Para::thMSE_Default()\n{\n    if (!wiener)\n    {\n        thMSE = 400 + sigma[0] * 80;\n\n        if (profile == \"vn\")\n        {\n            thMSE = 1000 + sigma[0] * 150;\n        }\n    }\n    else\n    {\n        thMSE = 200 + sigma[0] * 10;\n\n        if (profile == \"vn\")\n        {\n            thMSE = 400 + sigma[0] * 40;\n        }\n    }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Functions of struct BM3D_FilterData\n\n\nBM3D_FilterData::BM3D_FilterData(bool wiener, double sigma, PCType GroupSize, PCType BlockSize, double lambda)\n    : fp(GroupSize), bp(GroupSize), finalAMP(GroupSize), thrTable(wiener ? 0 : GroupSize),\n    wienerSigmaSqr(wiener ? GroupSize : 0)\n{\n    const unsigned int flags = FFTW_PATIENT;\n    const fftw::r2r_kind fkind = FFTW_REDFT10;\n    const fftw::r2r_kind bkind = FFTW_REDFT01;\n\n    FLType *temp = nullptr;\n\n    for (PCType i = 1; i <= GroupSize; ++i)\n    {\n        AlignedMalloc(temp, i * BlockSize * BlockSize);\n        fp[i - 1].r2r_3d(i, BlockSize, BlockSize, temp, temp, fkind, fkind, fkind, flags);\n        bp[i - 1].r2r_3d(i, BlockSize, BlockSize, temp, temp, bkind, bkind, bkind, flags);\n        AlignedFree(temp);\n\n        finalAMP[i - 1] = 2 * i * 2 * BlockSize * 2 * BlockSize;\n        double forwardAMP = sqrt(finalAMP[i - 1]);\n\n        if (wiener)\n        {\n            wienerSigmaSqr[i - 1] = static_cast<FLType>(sigma * forwardAMP * sigma * forwardAMP);\n        }\n        else\n        {\n            double thrBase = sigma * lambda * forwardAMP;\n            std::vector<double> thr(4);\n            \n            thr[0] = thrBase;\n            thr[1] = thrBase * sqrt(double(2));\n            thr[2] = thrBase * double(2);\n            thr[3] = thrBase * sqrt(double(8));\n\n            thrTable[i - 1] = std::vector<FLType>(i * BlockSize * BlockSize);\n            auto thr_d = thrTable[i - 1].data();\n\n            for (PCType z = 0; z < i; ++z)\n            {\n                for (PCType y = 0; y < BlockSize; ++y)\n                {\n                    for (PCType x = 0; x < BlockSize; ++x, ++thr_d)\n                    {\n                        int flag = 0;\n\n                        if (x == 0)\n                        {\n                            ++flag;\n                        }\n                        if (y == 0)\n                        {\n                            ++flag;\n                        }\n                        if (z == 0)\n                        {\n                            ++flag;\n                        }\n\n                        *thr_d = static_cast<FLType>(thr[flag]);\n                    }\n                }\n            }\n        }\n    }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>Speed up: default value of group_size reduced from 16\/16 to 8\/8 for BM3D profile=\"fast\"<commit_after>\/*\n* BM3D denoising filter - VapourSynth plugin\n* Copyright (C) 2015  mawen1250\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 \"BM3D.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Functions of struct BM3D_Para\n\n\nBM3D_Para::BM3D_Para(bool _wiener, std::string _profile)\n    : wiener(_wiener), profile(_profile), sigma({ 10.0, 10.0, 10.0 })\n{\n    BlockSize = 8;\n    BMrange = 16;\n    BMstep = 1;\n\n    if (!wiener)\n    {\n        BlockStep = 4;\n        GroupSize = 16;\n        lambda = 2.7;\n    }\n    else\n    {\n        BlockStep = 3;\n        GroupSize = 32;\n    }\n\n    if (profile == \"fast\")\n    {\n        BMrange = 9;\n        GroupSize = 8;\n\n        if (!wiener)\n        {\n            BlockStep = 8;\n        }\n        else\n        {\n            BlockStep = 7;\n        }\n    }\n    else if (profile == \"lc\")\n    {\n        BMrange = 9;\n\n        if (!wiener)\n        {\n            BlockStep = 6;\n        }\n        else\n        {\n            BlockStep = 5;\n            GroupSize = 16;\n        }\n    }\n    else if (profile == \"high\")\n    {\n        if (!wiener)\n        {\n            BlockStep = 3;\n        }\n        else\n        {\n            BlockStep = 2;\n        }\n    }\n    else if (profile == \"vn\")\n    {\n        if (!wiener)\n        {\n            BlockStep = 4;\n            GroupSize = 32;\n            lambda = 2.8;\n        }\n        else\n        {\n            BlockSize = 11;\n            BlockStep = 6;\n        }\n    }\n\n    thMSE_Default();\n}\n\n\nvoid BM3D_Para::thMSE_Default()\n{\n    if (!wiener)\n    {\n        thMSE = 400 + sigma[0] * 80;\n\n        if (profile == \"vn\")\n        {\n            thMSE = 1000 + sigma[0] * 150;\n        }\n    }\n    else\n    {\n        thMSE = 200 + sigma[0] * 10;\n\n        if (profile == \"vn\")\n        {\n            thMSE = 400 + sigma[0] * 40;\n        }\n    }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Functions of struct BM3D_FilterData\n\n\nBM3D_FilterData::BM3D_FilterData(bool wiener, double sigma, PCType GroupSize, PCType BlockSize, double lambda)\n    : fp(GroupSize), bp(GroupSize), finalAMP(GroupSize), thrTable(wiener ? 0 : GroupSize),\n    wienerSigmaSqr(wiener ? GroupSize : 0)\n{\n    const unsigned int flags = FFTW_PATIENT;\n    const fftw::r2r_kind fkind = FFTW_REDFT10;\n    const fftw::r2r_kind bkind = FFTW_REDFT01;\n\n    FLType *temp = nullptr;\n\n    for (PCType i = 1; i <= GroupSize; ++i)\n    {\n        AlignedMalloc(temp, i * BlockSize * BlockSize);\n        fp[i - 1].r2r_3d(i, BlockSize, BlockSize, temp, temp, fkind, fkind, fkind, flags);\n        bp[i - 1].r2r_3d(i, BlockSize, BlockSize, temp, temp, bkind, bkind, bkind, flags);\n        AlignedFree(temp);\n\n        finalAMP[i - 1] = 2 * i * 2 * BlockSize * 2 * BlockSize;\n        double forwardAMP = sqrt(finalAMP[i - 1]);\n\n        if (wiener)\n        {\n            wienerSigmaSqr[i - 1] = static_cast<FLType>(sigma * forwardAMP * sigma * forwardAMP);\n        }\n        else\n        {\n            double thrBase = sigma * lambda * forwardAMP;\n            std::vector<double> thr(4);\n            \n            thr[0] = thrBase;\n            thr[1] = thrBase * sqrt(double(2));\n            thr[2] = thrBase * double(2);\n            thr[3] = thrBase * sqrt(double(8));\n\n            thrTable[i - 1] = std::vector<FLType>(i * BlockSize * BlockSize);\n            auto thr_d = thrTable[i - 1].data();\n\n            for (PCType z = 0; z < i; ++z)\n            {\n                for (PCType y = 0; y < BlockSize; ++y)\n                {\n                    for (PCType x = 0; x < BlockSize; ++x, ++thr_d)\n                    {\n                        int flag = 0;\n\n                        if (x == 0)\n                        {\n                            ++flag;\n                        }\n                        if (y == 0)\n                        {\n                            ++flag;\n                        }\n                        if (z == 0)\n                        {\n                            ++flag;\n                        }\n\n                        *thr_d = static_cast<FLType>(thr[flag]);\n                    }\n                }\n            }\n        }\n    }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"confidence_bounds_strategy_evaluator.h\"\n#include \"estimator.h\"\n#include \"error_calculation.h\"\n#include \"debug.h\"\n\n#include <math.h>\n#include <assert.h>\n\n#include <limits>\n#include <fstream>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <iomanip>\nusing std::ifstream; using std::ofstream;\nusing std::ostringstream; using std::runtime_error;\nusing std::string; using std::setprecision; using std::endl;\n\n#include <boost\/math\/distributions\/students_t.hpp>\nusing namespace boost::math;\n\nclass ConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds {\n  public:\n    ErrorConfidenceBounds(Estimator *estimator_=NULL);\n    void observationAdded(double value);\n    double getBound(BoundType type);\n    void saveToFile(ofstream& out);\n    string restoreFromFile(ifstream& in);\n\n    void setEstimator(Estimator *estimator_);\n  private:\n    static const double CONFIDENCE_ALPHA;\n\n    Estimator *estimator;\n\n    \/\/ let's try making these log-transformed.\n    double error_mean;\n    double error_variance;\n    double M2; \/\/ for running variance algorithm\n    \n    size_t num_samples;\n    \n    \/\/ these are not log-transformed; they are inverse-transformed\n    \/\/  before being stored.\n    double error_bounds[UPPER + 1];\n\n    double getBoundDistance();\n};\n\n\nconst double ConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::CONFIDENCE_ALPHA = 0.05;\n\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::ErrorConfidenceBounds(Estimator *estimator_)\n    : estimator(estimator_)\n{\n    error_mean = 0.0;\n    error_variance = 0.0;\n    M2 = 0.0;\n    num_samples = 0;\n}\n\nvoid \nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::setEstimator(Estimator *estimator_)\n{\n    estimator = estimator_;\n}\n\n          \nstatic double get_chebyshev_bound(double alpha, double variance)\n{\n    \/\/ Chebyshev interval for error bounds, as described in my proposal.\n    return sqrt(variance \/ alpha);\n}\n\nstatic double get_t_value(double alpha, size_t df)\n{\n    \/\/http:\/\/www.boost.org\/doc\/libs\/1_39_0\/libs\/math\/doc\/sf_and_dist\/html\/\n    \/\/       math_toolkit\/dist\/stat_tut\/weg\/st_eg\/tut_mean_intervals.html\n    return quantile(complement(students_t(df), alpha \/ 2));\n}\n\nstatic double get_confidence_interval_width(double alpha, double variance, size_t num_samples)\n{\n    \/\/ student's-t-based confidence interval\n    if (num_samples <= 1) {\n        return 0.0;\n    } else {\n        double t = get_t_value(alpha, num_samples - 1);\n        return t * sqrt(variance \/ num_samples);\n    }\n}\n\nstatic double get_prediction_interval_width(double alpha, double variance, size_t num_samples)\n{\n    \/\/ student's-t-based prediction interval\n    \/\/ http:\/\/en.wikipedia.org\/wiki\/Prediction_interval#Unknown_mean.2C_unknown_variance\n    if (num_samples <= 1) {\n        return 0.0;\n    } else {\n        double t = get_t_value(alpha, num_samples - 1);\n        return t * sqrt(variance * (1 + (1 \/ num_samples)));\n    }\n}\n\ndouble\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::getBoundDistance()\n{\n    if (false) {\n        return get_chebyshev_bound(CONFIDENCE_ALPHA, error_variance);\n    } else if (false) {\n        return get_confidence_interval_width(CONFIDENCE_ALPHA, error_variance, num_samples);\n    } else {\n        return get_prediction_interval_width(CONFIDENCE_ALPHA, error_variance, num_samples);\n    }\n}\n\nvoid\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::observationAdded(double value)\n{\n    dbgprintf(\"Getting error sample from estimator %p\\n\", estimator);\n\n    \/*\n     * Algorithm borrowed from\n     * http:\/\/en.wikipedia.org\/wiki\/Algorithms_for_calculating_variance#On-line_algorithm\n     * which cites Knuth's \/The Art of Computer Programming\/, Volume 1.\n     *\/\n    ++num_samples;\n    double estimate = estimator->getEstimate();\n    double error = calculate_error(estimate, value);\n    error = log(error); \/\/ natural logarithm\n    \n    double delta = error - error_mean;\n    error_mean += delta \/ num_samples;\n    M2 += delta * (error - error_mean);\n    if (num_samples > 1) {\n        error_variance = M2 \/ (num_samples-1);\n    }\n\n    double bound_distance = getBoundDistance();\n    double bounds[2];\n\n    bounds[0] = exp(error_mean - bound_distance);\n    bounds[1] = exp(error_mean + bound_distance);\n    if (adjusted_estimate(estimate, bounds[0]) < adjusted_estimate(estimate, bounds[1])) {\n        error_bounds[LOWER] = bounds[0];\n        error_bounds[UPPER] = bounds[1];\n    } else {\n        error_bounds[LOWER] = bounds[1];\n        error_bounds[UPPER] = bounds[0];\n    }\n    dbgprintf(\"Adding error sample to estimator %p: %f\\n\",\n              estimator, exp(error));\n    dbgprintf(\"n=%4d; error bounds: [%f, %f]\\n\", \n              num_samples, error_bounds[LOWER], error_bounds[UPPER]);\n    if (adjusted_estimate(estimate, error_bounds[LOWER]) < 0.0) {\n        \/\/ PROBLEMATIC.\n        assert(false); \/\/ TODO: figure out what to do here.\n    }\n}\n\n\ndouble\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::getBound(BoundType type)\n{\n    double error = num_samples > 0 ? error_bounds[type] : no_error_value();\n    return adjusted_estimate(estimator->getEstimate(), error);\n}\n\nstatic int PRECISION = 20;\n\nvoid\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::saveToFile(ofstream& out)\n{\n    out << estimator->getName() << \" \" << setprecision(PRECISION)\n        << \"num_samples \" << num_samples\n        << \" mean \" << error_mean \n        << \" variance \" << error_variance\n        << \" M2 \" << M2 \n        << \" bounds \" << error_bounds[LOWER] << \" \" << error_bounds[UPPER] << endl;\n}\n\nstring\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::restoreFromFile(ifstream& in)\n{\n    string name, tag;\n    in >> name >> tag >> num_samples;\n    check(tag == \"num_samples\", \"Failed to parse num_samples\");\n    \n    typedef struct {\n        const char *expected_tag;\n        double& field;\n    } field_t;\n    field_t fields[] = {\n        { \"mean\", error_mean },\n        { \"variance\", error_variance },\n        { \"M2\", M2 },\n        { \"bounds\", error_bounds[LOWER] }\n    };\n    size_t num_fields = sizeof(fields) \/ sizeof(field_t);\n    for (size_t i = 0; i < num_fields; ++i) {\n        in >> tag >> fields[i].field;\n        check(tag == fields[i].expected_tag, \"Failed to parse field\");\n    }\n    in >> error_bounds[UPPER];\n    \n    check(in, \"Failed to read bounds from file\");\n    return name;\n}\n\nvoid \nConfidenceBoundsStrategyEvaluator::observationAdded(Estimator *estimator, double value)\n{\n    dbgprintf(\"Adding observation %f to estimator %p\\n\", value, estimator);\n    \n    assert(estimator);\n    string name = estimator->getName();\n    ErrorConfidenceBounds *bounds = NULL;\n    if (bounds_by_estimator.count(estimator) == 0) {\n        if (placeholders.count(name) > 0) {\n            bounds = placeholders[name];\n            bounds->setEstimator(estimator);\n            placeholders.erase(name);\n        } else {\n            bounds = new ErrorConfidenceBounds(estimator);\n        }\n        error_bounds.push_back(bounds);\n        bounds_by_estimator[estimator] = error_bounds.back();\n    } else {\n        bounds = bounds_by_estimator[estimator];\n    }\n    \n    if (estimators_by_name.count(name) > 0) {\n        assert(estimator == estimators_by_name[name]);\n    } else {\n        estimators_by_name[name] = estimator;\n    }\n    \n    if (estimator->hasEstimate()) {\n        dbgprintf(\"Adding observation %f to estimator-bounds %p\\n\",\n                  value, bounds);\n        bounds->observationAdded(value);\n    }\n}\n\n\nConfidenceBoundsStrategyEvaluator::EvalMode\nConfidenceBoundsStrategyEvaluator::DEFAULT_EVAL_MODE = AGGRESSIVE;\n\nConfidenceBoundsStrategyEvaluator::ConfidenceBoundsStrategyEvaluator()\n    : eval_mode(DEFAULT_EVAL_MODE), \/\/ TODO: set as option?\n      step(0)\n{\n}\n\nConfidenceBoundsStrategyEvaluator::~ConfidenceBoundsStrategyEvaluator()\n{\n    for (size_t i = 0; i < error_bounds.size(); ++i) {\n        delete error_bounds[i];\n    }\n    error_bounds.clear();\n    bounds_by_estimator.clear();\n    estimators_by_name.clear();\n    placeholders.clear();\n}\n\nConfidenceBoundsStrategyEvaluator::BoundType\nConfidenceBoundsStrategyEvaluator::getBoundType(EvalMode eval_mode, Strategy *strategy, \n                                                typesafe_eval_fn_t fn)\n{\n    if (eval_mode == AGGRESSIVE) {\n        \/\/ aggressive = upper bound on benefit of redundancy.\n        \/\/            = max_time(singular) - min_time(redundant)\n        \/\/ or:\n        \/\/ aggressive = lower bound on additional cost of redundancy\n        \/\/            = min_cost(redundant) - max_cost(singular)\n        \/\/ same bound for time and cost.\n        return strategy->isRedundant() ? LOWER : UPPER;\n    } else {\n        assert(eval_mode == CONSERVATIVE);\n        \/\/ XXX: can these be negative? e.g. is it possible that min_time(singular) < max_time(redundant)?\n        \/\/ XXX: above, the calculation of net benefit is:\n        \/\/ XXX:  (best_singular_time - best_redundant_time) - (best_redundant_cost - best_singular_cost)\n        \/\/ XXX: ...where 'best' always means in terms of time.\n        \/\/ XXX: and then the redundant strategy is chosen if net_benefit > 0.0.\n        \/\/ XXX: so, if min_time(singular) < max_time(redundant), we expect no benefit from redundancy.\n        \/\/ XXX: net benefit will be < 0.0, and the singular strategy will be chosen.\n        \/\/ XXX: I need to think about this more; I'm not sure yet how much it makes sense.\n        \n        \/\/ conservative = lower bound on benefit of redundancy\n        \/\/              = min_time(singular) - max_time(redundant)\n        \/\/ or:\n        \/\/ conservative = upper bound on cost of redundancy\n        \/\/              = max_cost(redundant) - min_cost(singular)\n        \/\/ same bound for time and cost.\n        return strategy->isRedundant() ? UPPER : LOWER;\n    }\n}\n\ndouble\nConfidenceBoundsStrategyEvaluator::expectedValue(Strategy *strategy, typesafe_eval_fn_t fn, \n                                                 void *strategy_arg, void *chooser_arg)\n{\n    BoundType bound_type = getBoundType(eval_mode, strategy, fn);\n    return evaluateBounded(bound_type, fn, strategy_arg, chooser_arg);\n}\n\ntypedef const double& (*bound_fn_t)(const double&, const double&);\n\ndouble\nConfidenceBoundsStrategyEvaluator::evaluateBounded(BoundType bound_type, typesafe_eval_fn_t fn,\n                                                   void *strategy_arg, void *chooser_arg)\n{\n    bound_fn_t bound_fns[UPPER + 1] = { &std::min<double>, &std::max<double> };\n    bound_fn_t bound_fn = bound_fns[bound_type];\n\n    \/\/ opposite fn, for calculating initial value that will\n    \/\/  always be replaced\n    bound_fn_t bound_init_fn = bound_fns[(bound_type + 1) % (UPPER + 1)];\n\n    \/\/ yes, it's a 2^N algorithm, but N is small; e.g. 4 for intnw\n    unsigned int finish = 1 << error_bounds.size();\n    double val = bound_init_fn(0.0, std::numeric_limits<double>::max());\n    for (step = 0; step < finish; ++step) {\n        val = bound_fn(val, fn(this, strategy_arg, chooser_arg));\n    }\n    return val;\n}\n\ndouble\nConfidenceBoundsStrategyEvaluator::getAdjustedEstimatorValue(Estimator *estimator)\n{\n    \/\/ use the low bits of step as selectors for the array of bounds\n    \/\/  (i.e. 0 bit = LOWER, 1 bit = UPPER)\n    \/\/ LSB is used for bounds[0], MSB for bounds[n-1]\n    \/\/ makes the N-way nested loop simpler\n    \n    if (bounds_by_estimator.count(estimator) == 0) {\n        return estimator->getEstimate();\n    }\n    \n    ErrorConfidenceBounds *est_error = bounds_by_estimator[estimator];\n    for (size_t i = 0; i < error_bounds.size(); ++i) {\n        if (est_error == error_bounds[i]) {\n            char bit = (step >> i) & 0x1;\n            return est_error->getBound(BoundType(bit));\n        }\n    }\n    __builtin_unreachable();\n}\n\nvoid\nConfidenceBoundsStrategyEvaluator::saveToFile(const char *filename)\n{\n    ofstream out(filename);\n    if (!out) {\n        ostringstream oss;\n        oss << \"Failed to open \" << filename;\n        throw runtime_error(oss.str());\n    }\n\n    out << bounds_by_estimator.size() << \" estimator-bounds\" << endl;\n    for (size_t i = 0; i < error_bounds.size(); ++i) {\n        error_bounds[i]->saveToFile(out);\n    }\n    out.close();\n}\n\nvoid \nConfidenceBoundsStrategyEvaluator::restoreFromFile(const char *filename)\n{\n    ifstream in(filename);\n    if (!in) {\n        ostringstream oss;\n        oss << \"Failed to open \" << filename;\n        throw runtime_error(oss.str());\n    }\n\n    string tag;\n    int num_estimators = -1;\n    in >> num_estimators >> tag;\n    check(num_estimators >= 0, \"Failed to read number of estimator bounds\");\n    check(tag == \"estimator-bounds\", \"Failed to read tag\");\n\n    for (size_t i = 0; i < error_bounds.size(); ++i) {\n        delete error_bounds[i];\n    }\n    error_bounds.clear();\n    \n    for (int i = 0; i < num_estimators; ++i) {\n        ErrorConfidenceBounds *bounds = new ErrorConfidenceBounds(NULL);\n        string name = bounds->restoreFromFile(in);\n        if (estimators_by_name.count(name) > 0) {\n            Estimator *estimator = estimators_by_name[name];\n            bounds->setEstimator(estimator);\n            error_bounds.push_back(bounds);\n            bounds_by_estimator[estimator] = bounds;\n        } else {\n            assert(placeholders.count(name) == 0);\n            placeholders[name] = bounds;\n        }\n    }\n    \n    in.close();\n}\n<commit_msg>Tweaked the calculation of min-cost.<commit_after>#include \"confidence_bounds_strategy_evaluator.h\"\n#include \"estimator.h\"\n#include \"error_calculation.h\"\n#include \"debug.h\"\n\n#include <math.h>\n#include <assert.h>\n\n#include <limits>\n#include <fstream>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <iomanip>\nusing std::ifstream; using std::ofstream;\nusing std::ostringstream; using std::runtime_error;\nusing std::string; using std::setprecision; using std::endl;\n\n#include <boost\/math\/distributions\/students_t.hpp>\nusing namespace boost::math;\n\nclass ConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds {\n  public:\n    ErrorConfidenceBounds(Estimator *estimator_=NULL);\n    void observationAdded(double value);\n    double getBound(BoundType type);\n    void saveToFile(ofstream& out);\n    string restoreFromFile(ifstream& in);\n\n    void setEstimator(Estimator *estimator_);\n  private:\n    static const double CONFIDENCE_ALPHA;\n\n    Estimator *estimator;\n\n    \/\/ let's try making these log-transformed.\n    double error_mean;\n    double error_variance;\n    double M2; \/\/ for running variance algorithm\n    \n    size_t num_samples;\n    \n    \/\/ these are not log-transformed; they are inverse-transformed\n    \/\/  before being stored.\n    double error_bounds[UPPER + 1];\n\n    double getBoundDistance();\n};\n\n\nconst double ConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::CONFIDENCE_ALPHA = 0.05;\n\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::ErrorConfidenceBounds(Estimator *estimator_)\n    : estimator(estimator_)\n{\n    error_mean = 0.0;\n    error_variance = 0.0;\n    M2 = 0.0;\n    num_samples = 0;\n}\n\nvoid \nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::setEstimator(Estimator *estimator_)\n{\n    estimator = estimator_;\n}\n\n          \nstatic double get_chebyshev_bound(double alpha, double variance)\n{\n    \/\/ Chebyshev interval for error bounds, as described in my proposal.\n    return sqrt(variance \/ alpha);\n}\n\nstatic double get_t_value(double alpha, size_t df)\n{\n    \/\/http:\/\/www.boost.org\/doc\/libs\/1_39_0\/libs\/math\/doc\/sf_and_dist\/html\/\n    \/\/       math_toolkit\/dist\/stat_tut\/weg\/st_eg\/tut_mean_intervals.html\n    return quantile(complement(students_t(df), alpha \/ 2));\n}\n\nstatic double get_confidence_interval_width(double alpha, double variance, size_t num_samples)\n{\n    \/\/ student's-t-based confidence interval\n    if (num_samples <= 1) {\n        return 0.0;\n    } else {\n        double t = get_t_value(alpha, num_samples - 1);\n        return t * sqrt(variance \/ num_samples);\n    }\n}\n\nstatic double get_prediction_interval_width(double alpha, double variance, size_t num_samples)\n{\n    \/\/ student's-t-based prediction interval\n    \/\/ http:\/\/en.wikipedia.org\/wiki\/Prediction_interval#Unknown_mean.2C_unknown_variance\n    if (num_samples <= 1) {\n        return 0.0;\n    } else {\n        double t = get_t_value(alpha, num_samples - 1);\n        return t * sqrt(variance * (1 + (1 \/ num_samples)));\n    }\n}\n\ndouble\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::getBoundDistance()\n{\n    if (false) {\n        return get_chebyshev_bound(CONFIDENCE_ALPHA, error_variance);\n    } else if (false) {\n        return get_confidence_interval_width(CONFIDENCE_ALPHA, error_variance, num_samples);\n    } else {\n        return get_prediction_interval_width(CONFIDENCE_ALPHA, error_variance, num_samples);\n    }\n}\n\nvoid\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::observationAdded(double value)\n{\n    dbgprintf(\"Getting error sample from estimator %p\\n\", estimator);\n\n    \/*\n     * Algorithm borrowed from\n     * http:\/\/en.wikipedia.org\/wiki\/Algorithms_for_calculating_variance#On-line_algorithm\n     * which cites Knuth's \/The Art of Computer Programming\/, Volume 1.\n     *\/\n    ++num_samples;\n    double estimate = estimator->getEstimate();\n    double error = calculate_error(estimate, value);\n    error = log(error); \/\/ natural logarithm\n    \n    double delta = error - error_mean;\n    error_mean += delta \/ num_samples;\n    M2 += delta * (error - error_mean);\n    if (num_samples > 1) {\n        error_variance = M2 \/ (num_samples-1);\n    }\n\n    double bound_distance = getBoundDistance();\n    double bounds[2];\n\n    bounds[0] = exp(error_mean - bound_distance);\n    bounds[1] = exp(error_mean + bound_distance);\n    if (adjusted_estimate(estimate, bounds[0]) < adjusted_estimate(estimate, bounds[1])) {\n        error_bounds[LOWER] = bounds[0];\n        error_bounds[UPPER] = bounds[1];\n    } else {\n        error_bounds[LOWER] = bounds[1];\n        error_bounds[UPPER] = bounds[0];\n    }\n    dbgprintf(\"Adding error sample to estimator %p: %f\\n\",\n              estimator, exp(error));\n    dbgprintf(\"n=%4d; error bounds: [%f, %f]\\n\", \n              num_samples, error_bounds[LOWER], error_bounds[UPPER]);\n    if (adjusted_estimate(estimate, error_bounds[LOWER]) < 0.0) {\n        \/\/ PROBLEMATIC.\n        assert(false); \/\/ TODO: figure out what to do here.\n    }\n}\n\n\ndouble\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::getBound(BoundType type)\n{\n    double error = num_samples > 0 ? error_bounds[type] : no_error_value();\n    return adjusted_estimate(estimator->getEstimate(), error);\n}\n\nstatic int PRECISION = 20;\n\nvoid\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::saveToFile(ofstream& out)\n{\n    out << estimator->getName() << \" \" << setprecision(PRECISION)\n        << \"num_samples \" << num_samples\n        << \" mean \" << error_mean \n        << \" variance \" << error_variance\n        << \" M2 \" << M2 \n        << \" bounds \" << error_bounds[LOWER] << \" \" << error_bounds[UPPER] << endl;\n}\n\nstring\nConfidenceBoundsStrategyEvaluator::ErrorConfidenceBounds::restoreFromFile(ifstream& in)\n{\n    string name, tag;\n    in >> name >> tag >> num_samples;\n    check(tag == \"num_samples\", \"Failed to parse num_samples\");\n    \n    typedef struct {\n        const char *expected_tag;\n        double& field;\n    } field_t;\n    field_t fields[] = {\n        { \"mean\", error_mean },\n        { \"variance\", error_variance },\n        { \"M2\", M2 },\n        { \"bounds\", error_bounds[LOWER] }\n    };\n    size_t num_fields = sizeof(fields) \/ sizeof(field_t);\n    for (size_t i = 0; i < num_fields; ++i) {\n        in >> tag >> fields[i].field;\n        check(tag == fields[i].expected_tag, \"Failed to parse field\");\n    }\n    in >> error_bounds[UPPER];\n    \n    check(in, \"Failed to read bounds from file\");\n    return name;\n}\n\nvoid \nConfidenceBoundsStrategyEvaluator::observationAdded(Estimator *estimator, double value)\n{\n    dbgprintf(\"Adding observation %f to estimator %p\\n\", value, estimator);\n    \n    assert(estimator);\n    string name = estimator->getName();\n    ErrorConfidenceBounds *bounds = NULL;\n    if (bounds_by_estimator.count(estimator) == 0) {\n        if (placeholders.count(name) > 0) {\n            bounds = placeholders[name];\n            bounds->setEstimator(estimator);\n            placeholders.erase(name);\n        } else {\n            bounds = new ErrorConfidenceBounds(estimator);\n        }\n        error_bounds.push_back(bounds);\n        bounds_by_estimator[estimator] = error_bounds.back();\n    } else {\n        bounds = bounds_by_estimator[estimator];\n    }\n    \n    if (estimators_by_name.count(name) > 0) {\n        assert(estimator == estimators_by_name[name]);\n    } else {\n        estimators_by_name[name] = estimator;\n    }\n    \n    if (estimator->hasEstimate()) {\n        dbgprintf(\"Adding observation %f to estimator-bounds %p\\n\",\n                  value, bounds);\n        bounds->observationAdded(value);\n    }\n}\n\n\nConfidenceBoundsStrategyEvaluator::EvalMode\nConfidenceBoundsStrategyEvaluator::DEFAULT_EVAL_MODE = AGGRESSIVE;\n\nConfidenceBoundsStrategyEvaluator::ConfidenceBoundsStrategyEvaluator()\n    : eval_mode(DEFAULT_EVAL_MODE), \/\/ TODO: set as option?\n      step(0)\n{\n}\n\nConfidenceBoundsStrategyEvaluator::~ConfidenceBoundsStrategyEvaluator()\n{\n    for (size_t i = 0; i < error_bounds.size(); ++i) {\n        delete error_bounds[i];\n    }\n    error_bounds.clear();\n    bounds_by_estimator.clear();\n    estimators_by_name.clear();\n    placeholders.clear();\n}\n\nConfidenceBoundsStrategyEvaluator::BoundType\nConfidenceBoundsStrategyEvaluator::getBoundType(EvalMode eval_mode, Strategy *strategy, \n                                                typesafe_eval_fn_t fn)\n{\n    if (eval_mode == AGGRESSIVE) {\n        \/\/ aggressive = upper bound on benefit of redundancy.\n        \/\/            = max_time(singular) - min_time(redundant)\n        \/\/ or:\n        \/\/ \/\/aggressive = lower bound on additional cost of redundancy\n        \/\/ \/\/           = min_cost(redundant) - max_cost(singular)\n        \/\/ \/\/same bound for time and cost.\n        \/\/ PROBLEM WITH THAT: cost diff can now be negative.\n        \/\/    could lower-bound at 0, but:\n        \/\/    a) This actually isn't what I proposed; and\n        \/\/    b) This will probably lead to always-redundant, all the time.\n        \/\/    What I proposed was that min-additional cost is \n        \/\/      calculated using the min-cost for all singular strategies.\n        \/\/    So, let's try that.\n        \/\/return strategy->isRedundant() ? LOWER : UPPER;\n\n        if (fn == strategy->getEvalFn(ENERGY_FN) ||\n            fn == strategy->getEvalFn(DATA_FN)) {\n            return LOWER;\n        } else {\n            return strategy->isRedundant() ? LOWER : UPPER;\n        }\n    } else {\n        assert(eval_mode == CONSERVATIVE);\n        \/\/ XXX: can these be negative? e.g. is it possible that min_time(singular) < max_time(redundant)?\n        \/\/ XXX: above, the calculation of net benefit is:\n        \/\/ XXX:  (best_singular_time - best_redundant_time) - (best_redundant_cost - best_singular_cost)\n        \/\/ XXX: ...where 'best' always means in terms of time.\n        \/\/ XXX: and then the redundant strategy is chosen if net_benefit > 0.0.\n        \/\/ XXX: so, if min_time(singular) < max_time(redundant), we expect no benefit from redundancy.\n        \/\/ XXX: net benefit will be < 0.0, and the singular strategy will be chosen.\n        \/\/ XXX: I need to think about this more; I'm not sure yet how much it makes sense.\n        \n        \/\/ conservative = lower bound on benefit of redundancy\n        \/\/              = min_time(singular) - max_time(redundant)\n        \/\/ or:\n        \/\/ conservative = upper bound on cost of redundancy\n        \/\/              = max_cost(redundant) - min_cost(singular)\n        \/\/ same bound for time and cost.\n        return strategy->isRedundant() ? UPPER : LOWER;\n    }\n}\n\ndouble\nConfidenceBoundsStrategyEvaluator::expectedValue(Strategy *strategy, typesafe_eval_fn_t fn, \n                                                 void *strategy_arg, void *chooser_arg)\n{\n    BoundType bound_type = getBoundType(eval_mode, strategy, fn);\n    return evaluateBounded(bound_type, fn, strategy_arg, chooser_arg);\n}\n\ntypedef const double& (*bound_fn_t)(const double&, const double&);\n\ndouble\nConfidenceBoundsStrategyEvaluator::evaluateBounded(BoundType bound_type, typesafe_eval_fn_t fn,\n                                                   void *strategy_arg, void *chooser_arg)\n{\n    bound_fn_t bound_fns[UPPER + 1] = { &std::min<double>, &std::max<double> };\n    bound_fn_t bound_fn = bound_fns[bound_type];\n\n    \/\/ opposite fn, for calculating initial value that will\n    \/\/  always be replaced\n    bound_fn_t bound_init_fn = bound_fns[(bound_type + 1) % (UPPER + 1)];\n\n    \/\/ yes, it's a 2^N algorithm, but N is small; e.g. 4 for intnw\n    unsigned int finish = 1 << error_bounds.size();\n    double val = bound_init_fn(0.0, std::numeric_limits<double>::max());\n    for (step = 0; step < finish; ++step) {\n        val = bound_fn(val, fn(this, strategy_arg, chooser_arg));\n    }\n    return val;\n}\n\ndouble\nConfidenceBoundsStrategyEvaluator::getAdjustedEstimatorValue(Estimator *estimator)\n{\n    \/\/ use the low bits of step as selectors for the array of bounds\n    \/\/  (i.e. 0 bit = LOWER, 1 bit = UPPER)\n    \/\/ LSB is used for bounds[0], MSB for bounds[n-1]\n    \/\/ makes the N-way nested loop simpler\n    \n    if (bounds_by_estimator.count(estimator) == 0) {\n        return estimator->getEstimate();\n    }\n    \n    ErrorConfidenceBounds *est_error = bounds_by_estimator[estimator];\n    for (size_t i = 0; i < error_bounds.size(); ++i) {\n        if (est_error == error_bounds[i]) {\n            char bit = (step >> i) & 0x1;\n            return est_error->getBound(BoundType(bit));\n        }\n    }\n    __builtin_unreachable();\n}\n\nvoid\nConfidenceBoundsStrategyEvaluator::saveToFile(const char *filename)\n{\n    ofstream out(filename);\n    if (!out) {\n        ostringstream oss;\n        oss << \"Failed to open \" << filename;\n        throw runtime_error(oss.str());\n    }\n\n    out << bounds_by_estimator.size() << \" estimator-bounds\" << endl;\n    for (size_t i = 0; i < error_bounds.size(); ++i) {\n        error_bounds[i]->saveToFile(out);\n    }\n    out.close();\n}\n\nvoid \nConfidenceBoundsStrategyEvaluator::restoreFromFile(const char *filename)\n{\n    ifstream in(filename);\n    if (!in) {\n        ostringstream oss;\n        oss << \"Failed to open \" << filename;\n        throw runtime_error(oss.str());\n    }\n\n    string tag;\n    int num_estimators = -1;\n    in >> num_estimators >> tag;\n    check(num_estimators >= 0, \"Failed to read number of estimator bounds\");\n    check(tag == \"estimator-bounds\", \"Failed to read tag\");\n\n    for (size_t i = 0; i < error_bounds.size(); ++i) {\n        delete error_bounds[i];\n    }\n    error_bounds.clear();\n    \n    for (int i = 0; i < num_estimators; ++i) {\n        ErrorConfidenceBounds *bounds = new ErrorConfidenceBounds(NULL);\n        string name = bounds->restoreFromFile(in);\n        if (estimators_by_name.count(name) > 0) {\n            Estimator *estimator = estimators_by_name[name];\n            bounds->setEstimator(estimator);\n            error_bounds.push_back(bounds);\n            bounds_by_estimator[estimator] = bounds;\n        } else {\n            assert(placeholders.count(name) == 0);\n            placeholders[name] = bounds;\n        }\n    }\n    \n    in.close();\n}\n<|endoftext|>"}
{"text":"<commit_before>#line 2 \"togo\/tool_build\/compiler_manager.cpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n*\/\n\n#include <togo\/tool_build\/config.hpp>\n#include <togo\/tool_build\/types.hpp>\n#include <togo\/log\/log.hpp>\n#include <togo\/memory\/memory.hpp>\n#include <togo\/collection\/fixed_array.hpp>\n#include <togo\/collection\/array.hpp>\n#include <togo\/collection\/hash_map.hpp>\n#include <togo\/tool_build\/package_compiler.hpp>\n#include <togo\/tool_build\/compiler_manager.hpp>\n#include <togo\/tool_build\/resource_compiler.hpp>\n\nnamespace togo {\nnamespace tool_build {\n\nCompilerManager::~CompilerManager() {\n\tcompiler_manager::clear_packages(*this);\n}\n\nCompilerManager::CompilerManager(Allocator& allocator)\n\t: _compilers(allocator)\n\t, _packages(allocator)\n{\n\thash_map::reserve(_compilers, 16);\n\tarray::reserve(_packages, 8);\n}\n\nvoid compiler_manager::register_compiler(\n\tCompilerManager& cm,\n\tResourceCompiler const& compiler\n) {\n\tTOGO_ASSERT(\n\t\tcompiler.func_compile,\n\t\t\"func_compile must be assigned in compiler\"\n\t);\n\tTOGO_ASSERT(\n\t\t!hash_map::has(cm._compilers, compiler.type),\n\t\t\"type has already been registered\"\n\t);\n\thash_map::push(cm._compilers, compiler.type, compiler);\n}\n\nvoid compiler_manager::register_standard_compilers(\n\tCompilerManager& cm\n) {\n\tresource_compiler::register_test_resource(cm);\n}\n\nbool compiler_manager::has_compiler(\n\tCompilerManager const& cm,\n\tResourceType const type\n) {\n\treturn hash_map::has(cm._compilers, type);\n}\n\nResourceCompiler const* compiler_manager::get_compiler(\n\tCompilerManager const& cm,\n\tResourceType const type\n) {\n\treturn hash_map::get(cm._compilers, type);\n}\n\nbool compiler_manager::has_package(\n\tCompilerManager const& cm,\n\tResourcePackageNameHash const name_hash\n) {\n\tfor (auto const* pkg : cm._packages) {\n\t\tif (pkg->_name_hash == name_hash) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nPackageCompiler* compiler_manager::get_package(\n\tCompilerManager& cm,\n\tResourcePackageNameHash const name_hash\n) {\n\tfor (auto* pkg : cm._packages) {\n\t\tif (pkg->_name_hash == name_hash) {\n\t\t\treturn pkg;\n\t\t}\n\t}\n\treturn nullptr;\n}\n\nResourcePackageNameHash compiler_manager::add_package(\n\tCompilerManager& cm,\n\tStringRef const& path\n) {\n\t\/\/ NB: PackageCompiler ctor trims path\n\tAllocator& allocator = *cm._packages._allocator;\n\tPackageCompiler* const pkg = TOGO_CONSTRUCT(allocator,\n\t\tPackageCompiler, path, allocator\n\t);\n\tfor (auto const* it_pkg : cm._packages) {\n\t\tTOGO_ASSERTF(\n\t\t\t!string::compare_equal(it_pkg->_path, pkg->_path),\n\t\t\t\"package at '%.*s' has already been added\",\n\t\t\tstring::size(it_pkg->_path), fixed_array::begin(it_pkg->_path)\n\t\t);\n\t}\n\tarray::push_back(cm._packages, pkg);\n\tpackage_compiler::read(*pkg);\n\treturn package_compiler::name_hash(*pkg);\n}\n\nvoid compiler_manager::remove_package(\n\tCompilerManager& cm,\n\tResourcePackageNameHash const name_hash\n) {\n\tAllocator& allocator = *cm._packages._allocator;\n\tfor (unsigned i = 0; i < array::size(cm._packages); ++i) {\n\t\tauto* const pkg = cm._packages[i];\n\t\tif (pkg->_name_hash == name_hash) {\n\t\t\t\/\/ TODO: Unload active resources from the package\n\t\t\tTOGO_DESTROY(allocator, pkg);\n\t\t\tarray::remove(cm._packages, i);\n\t\t\treturn;\n\t\t}\n\t}\n\tTOGO_ASSERT(false, \"package not found\");\n}\n\nvoid compiler_manager::clear_packages(\n\tCompilerManager& cm\n) {\n\tAllocator& allocator = *cm._packages._allocator;\n\tfor (auto* pkg : cm._packages) {\n\t\tTOGO_DESTROY(allocator, pkg);\n\t}\n\tarray::clear(cm._packages);\n}\n\nbool compiler_manager::write_packages(\n\tCompilerManager& cm\n) {\n\tfor (auto* pkg : cm._packages) {\n\t\tif (!package_compiler::write(*pkg)) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool compiler_manager::has_resource(\n\tCompilerManager const& cm,\n\tResourceType const type,\n\tResourceNameHash const name_hash,\n\tResourceTagsHash const tags_hash\n) {\n\tfor (auto const* pkg : cm._packages) {\n\t\tif (package_compiler::find_resource_id(\n\t\t\t*pkg, type, name_hash, tags_hash, false\n\t\t) != 0) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nPackageCompiler::LookupNode* compiler_manager::get_node(\n\tCompilerManager& cm,\n\tResourceNameHash const name_hash,\n\tPackageCompiler*& package\n) {\n\tPackageCompiler::LookupNode* node;\n\tfor (\n\t\tauto* it_pkg = array::end(cm._packages) - 1;\n\t\tit_pkg >= array::begin(cm._packages);\n\t\t--it_pkg\n\t) {\n\t\tnode = package_compiler::get_node(**it_pkg, name_hash);\n\t\tif (node) {\n\t\t\tpackage = *it_pkg;\n\t\t\treturn node;\n\t\t}\n\t}\n\tpackage = nullptr;\n\treturn nullptr;\n}\n\n} \/\/ namespace tool_build\n} \/\/ namespace togo\n<commit_msg>tool_build\/compiler_manager: URC: resource_compiler.<commit_after>#line 2 \"togo\/tool_build\/compiler_manager.cpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n*\/\n\n#include <togo\/tool_build\/config.hpp>\n#include <togo\/tool_build\/types.hpp>\n#include <togo\/log\/log.hpp>\n#include <togo\/memory\/memory.hpp>\n#include <togo\/collection\/fixed_array.hpp>\n#include <togo\/collection\/array.hpp>\n#include <togo\/collection\/hash_map.hpp>\n#include <togo\/tool_build\/package_compiler.hpp>\n#include <togo\/tool_build\/compiler_manager.hpp>\n#include <togo\/tool_build\/resource_compiler.hpp>\n\nnamespace togo {\nnamespace tool_build {\n\nCompilerManager::~CompilerManager() {\n\tcompiler_manager::clear_packages(*this);\n}\n\nCompilerManager::CompilerManager(Allocator& allocator)\n\t: _compilers(allocator)\n\t, _packages(allocator)\n{\n\thash_map::reserve(_compilers, 16);\n\tarray::reserve(_packages, 8);\n}\n\nvoid compiler_manager::register_compiler(\n\tCompilerManager& cm,\n\tResourceCompiler const& compiler\n) {\n\tTOGO_ASSERT(\n\t\tcompiler.func_compile,\n\t\t\"func_compile must be assigned in compiler\"\n\t);\n\tTOGO_ASSERT(\n\t\t!hash_map::has(cm._compilers, compiler.type),\n\t\t\"type has already been registered\"\n\t);\n\thash_map::push(cm._compilers, compiler.type, compiler);\n}\n\nvoid compiler_manager::register_standard_compilers(\n\tCompilerManager& cm\n) {\n\tresource_compiler::register_test(cm);\n}\n\nbool compiler_manager::has_compiler(\n\tCompilerManager const& cm,\n\tResourceType const type\n) {\n\treturn hash_map::has(cm._compilers, type);\n}\n\nResourceCompiler const* compiler_manager::get_compiler(\n\tCompilerManager const& cm,\n\tResourceType const type\n) {\n\treturn hash_map::get(cm._compilers, type);\n}\n\nbool compiler_manager::has_package(\n\tCompilerManager const& cm,\n\tResourcePackageNameHash const name_hash\n) {\n\tfor (auto const* pkg : cm._packages) {\n\t\tif (pkg->_name_hash == name_hash) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nPackageCompiler* compiler_manager::get_package(\n\tCompilerManager& cm,\n\tResourcePackageNameHash const name_hash\n) {\n\tfor (auto* pkg : cm._packages) {\n\t\tif (pkg->_name_hash == name_hash) {\n\t\t\treturn pkg;\n\t\t}\n\t}\n\treturn nullptr;\n}\n\nResourcePackageNameHash compiler_manager::add_package(\n\tCompilerManager& cm,\n\tStringRef const& path\n) {\n\t\/\/ NB: PackageCompiler ctor trims path\n\tAllocator& allocator = *cm._packages._allocator;\n\tPackageCompiler* const pkg = TOGO_CONSTRUCT(allocator,\n\t\tPackageCompiler, path, allocator\n\t);\n\tfor (auto const* it_pkg : cm._packages) {\n\t\tTOGO_ASSERTF(\n\t\t\t!string::compare_equal(it_pkg->_path, pkg->_path),\n\t\t\t\"package at '%.*s' has already been added\",\n\t\t\tstring::size(it_pkg->_path), fixed_array::begin(it_pkg->_path)\n\t\t);\n\t}\n\tarray::push_back(cm._packages, pkg);\n\tpackage_compiler::read(*pkg);\n\treturn package_compiler::name_hash(*pkg);\n}\n\nvoid compiler_manager::remove_package(\n\tCompilerManager& cm,\n\tResourcePackageNameHash const name_hash\n) {\n\tAllocator& allocator = *cm._packages._allocator;\n\tfor (unsigned i = 0; i < array::size(cm._packages); ++i) {\n\t\tauto* const pkg = cm._packages[i];\n\t\tif (pkg->_name_hash == name_hash) {\n\t\t\t\/\/ TODO: Unload active resources from the package\n\t\t\tTOGO_DESTROY(allocator, pkg);\n\t\t\tarray::remove(cm._packages, i);\n\t\t\treturn;\n\t\t}\n\t}\n\tTOGO_ASSERT(false, \"package not found\");\n}\n\nvoid compiler_manager::clear_packages(\n\tCompilerManager& cm\n) {\n\tAllocator& allocator = *cm._packages._allocator;\n\tfor (auto* pkg : cm._packages) {\n\t\tTOGO_DESTROY(allocator, pkg);\n\t}\n\tarray::clear(cm._packages);\n}\n\nbool compiler_manager::write_packages(\n\tCompilerManager& cm\n) {\n\tfor (auto* pkg : cm._packages) {\n\t\tif (!package_compiler::write(*pkg)) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool compiler_manager::has_resource(\n\tCompilerManager const& cm,\n\tResourceType const type,\n\tResourceNameHash const name_hash,\n\tResourceTagsHash const tags_hash\n) {\n\tfor (auto const* pkg : cm._packages) {\n\t\tif (package_compiler::find_resource_id(\n\t\t\t*pkg, type, name_hash, tags_hash, false\n\t\t) != 0) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nPackageCompiler::LookupNode* compiler_manager::get_node(\n\tCompilerManager& cm,\n\tResourceNameHash const name_hash,\n\tPackageCompiler*& package\n) {\n\tPackageCompiler::LookupNode* node;\n\tfor (\n\t\tauto* it_pkg = array::end(cm._packages) - 1;\n\t\tit_pkg >= array::begin(cm._packages);\n\t\t--it_pkg\n\t) {\n\t\tnode = package_compiler::get_node(**it_pkg, name_hash);\n\t\tif (node) {\n\t\t\tpackage = *it_pkg;\n\t\t\treturn node;\n\t\t}\n\t}\n\tpackage = nullptr;\n\treturn nullptr;\n}\n\n} \/\/ namespace tool_build\n} \/\/ namespace togo\n<|endoftext|>"}
{"text":"<commit_before>#include \"exe\/main_common.h\"\n\n#include <iostream>\n#include <memory>\n\n#include \"common\/common\/compiler_requirements.h\"\n#include \"common\/common\/perf_annotation.h\"\n#include \"common\/event\/libevent.h\"\n#include \"common\/network\/utility.h\"\n#include \"common\/stats\/thread_local_store.h\"\n\n#include \"server\/config_validation\/server.h\"\n#include \"server\/drain_manager_impl.h\"\n#include \"server\/hot_restart_nop_impl.h\"\n#include \"server\/options_impl.h\"\n#include \"server\/proto_descriptors.h\"\n#include \"server\/server.h\"\n#include \"server\/test_hooks.h\"\n\n#include \"absl\/strings\/str_split.h\"\n\n#ifdef ENVOY_HOT_RESTART\n#include \"server\/hot_restart_impl.h\"\n#endif\n\n#include \"ares.h\"\n\nnamespace Envoy {\n\nServer::DrainManagerPtr ProdComponentFactory::createDrainManager(Server::Instance& server) {\n  \/\/ The global drain manager only triggers on listener modification, which effectively is\n  \/\/ hot restart at the global level. The per-listener drain managers decide whether to\n  \/\/ to include \/healthcheck\/fail status.\n  return std::make_unique<Server::DrainManagerImpl>(server,\n                                                    envoy::api::v2::Listener_DrainType_MODIFY_ONLY);\n}\n\nRuntime::LoaderPtr ProdComponentFactory::createRuntime(Server::Instance& server,\n                                                       Server::Configuration::Initial& config) {\n  return Server::InstanceUtil::createRuntime(server, config);\n}\n\nMainCommonBase::MainCommonBase(OptionsImpl& options, Event::TimeSystem& time_system,\n                               TestHooks& test_hooks, Server::ComponentFactory& component_factory,\n                               std::unique_ptr<Runtime::RandomGenerator>&& random_generator)\n    : options_(options), component_factory_(component_factory) {\n  ares_library_init(ARES_LIB_INIT_ALL);\n  Event::Libevent::Global::initialize();\n  RELEASE_ASSERT(Envoy::Server::validateProtoDescriptors(), \"\");\n\n  switch (options_.mode()) {\n  case Server::Mode::InitOnly:\n  case Server::Mode::Serve: {\n#ifdef ENVOY_HOT_RESTART\n    if (!options.hotRestartDisabled()) {\n      restarter_ = std::make_unique<Server::HotRestartImpl>(options_);\n    }\n#endif\n    if (restarter_ == nullptr) {\n      restarter_ = std::make_unique<Server::HotRestartNopImpl>();\n    }\n\n    tls_ = std::make_unique<ThreadLocal::InstanceImpl>();\n    Thread::BasicLockable& log_lock = restarter_->logLock();\n    Thread::BasicLockable& access_log_lock = restarter_->accessLogLock();\n    auto local_address = Network::Utility::getLocalAddress(options_.localAddressIpVersion());\n    logging_context_ =\n        std::make_unique<Logger::Context>(options_.logLevel(), options_.logFormat(), log_lock);\n\n    configureComponentLogLevels();\n\n    stats_store_ = std::make_unique<Stats::ThreadLocalStoreImpl>(options_.statsOptions(),\n                                                                 restarter_->statsAllocator());\n\n    server_ = std::make_unique<Server::InstanceImpl>(\n        options_, time_system, local_address, test_hooks, *restarter_, *stats_store_,\n        access_log_lock, component_factory, std::move(random_generator), *tls_);\n\n    break;\n  }\n  case Server::Mode::Validate:\n    restarter_ = std::make_unique<Server::HotRestartNopImpl>();\n    logging_context_ = std::make_unique<Logger::Context>(options_.logLevel(), options_.logFormat(),\n                                                         restarter_->logLock());\n    break;\n  }\n}\n\nMainCommonBase::~MainCommonBase() { ares_library_cleanup(); }\n\nvoid MainCommonBase::configureComponentLogLevels() {\n  for (auto& component_log_level : options_.componentLogLevels()) {\n    Logger::Logger* logger_to_change = Logger::Registry::logger(component_log_level.first);\n    ASSERT(logger_to_change);\n    logger_to_change->setLevel(component_log_level.second);\n  }\n}\n\nbool MainCommonBase::run() {\n  switch (options_.mode()) {\n  case Server::Mode::Serve:\n    server_->run();\n    return true;\n  case Server::Mode::Validate: {\n    auto local_address = Network::Utility::getLocalAddress(options_.localAddressIpVersion());\n    return Server::validateConfig(options_, local_address, component_factory_);\n  }\n  case Server::Mode::InitOnly:\n    PERF_DUMP();\n    return true;\n  }\n  NOT_REACHED_GCOVR_EXCL_LINE;\n}\n\nvoid MainCommonBase::adminRequest(absl::string_view path_and_query, absl::string_view method,\n                                  const AdminRequestFn& handler) {\n  std::string path_and_query_buf = std::string(path_and_query);\n  std::string method_buf = std::string(method);\n  server_->dispatcher().post([this, path_and_query_buf, method_buf, handler]() {\n    Http::HeaderMapImpl response_headers;\n    std::string body;\n    server_->admin().request(path_and_query_buf, method_buf, response_headers, body);\n    handler(response_headers, body);\n  });\n}\n\nMainCommon::MainCommon(int argc, const char* const* argv)\n    : options_(argc, argv, &MainCommon::hotRestartVersion, spdlog::level::info),\n      base_(options_, real_time_system_, default_test_hooks_, prod_component_factory_,\n            std::make_unique<Runtime::RandomGeneratorImpl>()) {}\n\nstd::string MainCommon::hotRestartVersion(uint64_t max_num_stats, uint64_t max_stat_name_len,\n                                          bool hot_restart_enabled) {\n#ifdef ENVOY_HOT_RESTART\n  if (hot_restart_enabled) {\n    return Server::HotRestartImpl::hotRestartVersion(max_num_stats, max_stat_name_len);\n  }\n#else\n  UNREFERENCED_PARAMETER(hot_restart_enabled);\n  UNREFERENCED_PARAMETER(max_num_stats);\n  UNREFERENCED_PARAMETER(max_stat_name_len);\n#endif\n  return \"disabled\";\n}\n\n\/\/ Legacy implementation of main_common.\n\/\/\n\/\/ TODO(jmarantz): Remove this when all callers are removed. At that time, MainCommonBase\n\/\/ and MainCommon can be merged. The current theory is that only Google calls this.\nint main_common(OptionsImpl& options) {\n  try {\n    Event::RealTimeSystem real_time_system_;\n    DefaultTestHooks default_test_hooks_;\n    ProdComponentFactory prod_component_factory_;\n    MainCommonBase main_common(options, real_time_system_, default_test_hooks_,\n                               prod_component_factory_,\n                               std::make_unique<Runtime::RandomGeneratorImpl>());\n    return main_common.run() ? EXIT_SUCCESS : EXIT_FAILURE;\n  } catch (EnvoyException& e) {\n    return EXIT_FAILURE;\n  }\n  return EXIT_SUCCESS;\n}\n\n} \/\/ namespace Envoy\n<commit_msg>remove unreachable code (#5082)<commit_after>#include \"exe\/main_common.h\"\n\n#include <iostream>\n#include <memory>\n\n#include \"common\/common\/compiler_requirements.h\"\n#include \"common\/common\/perf_annotation.h\"\n#include \"common\/event\/libevent.h\"\n#include \"common\/network\/utility.h\"\n#include \"common\/stats\/thread_local_store.h\"\n\n#include \"server\/config_validation\/server.h\"\n#include \"server\/drain_manager_impl.h\"\n#include \"server\/hot_restart_nop_impl.h\"\n#include \"server\/options_impl.h\"\n#include \"server\/proto_descriptors.h\"\n#include \"server\/server.h\"\n#include \"server\/test_hooks.h\"\n\n#include \"absl\/strings\/str_split.h\"\n\n#ifdef ENVOY_HOT_RESTART\n#include \"server\/hot_restart_impl.h\"\n#endif\n\n#include \"ares.h\"\n\nnamespace Envoy {\n\nServer::DrainManagerPtr ProdComponentFactory::createDrainManager(Server::Instance& server) {\n  \/\/ The global drain manager only triggers on listener modification, which effectively is\n  \/\/ hot restart at the global level. The per-listener drain managers decide whether to\n  \/\/ to include \/healthcheck\/fail status.\n  return std::make_unique<Server::DrainManagerImpl>(server,\n                                                    envoy::api::v2::Listener_DrainType_MODIFY_ONLY);\n}\n\nRuntime::LoaderPtr ProdComponentFactory::createRuntime(Server::Instance& server,\n                                                       Server::Configuration::Initial& config) {\n  return Server::InstanceUtil::createRuntime(server, config);\n}\n\nMainCommonBase::MainCommonBase(OptionsImpl& options, Event::TimeSystem& time_system,\n                               TestHooks& test_hooks, Server::ComponentFactory& component_factory,\n                               std::unique_ptr<Runtime::RandomGenerator>&& random_generator)\n    : options_(options), component_factory_(component_factory) {\n  ares_library_init(ARES_LIB_INIT_ALL);\n  Event::Libevent::Global::initialize();\n  RELEASE_ASSERT(Envoy::Server::validateProtoDescriptors(), \"\");\n\n  switch (options_.mode()) {\n  case Server::Mode::InitOnly:\n  case Server::Mode::Serve: {\n#ifdef ENVOY_HOT_RESTART\n    if (!options.hotRestartDisabled()) {\n      restarter_ = std::make_unique<Server::HotRestartImpl>(options_);\n    }\n#endif\n    if (restarter_ == nullptr) {\n      restarter_ = std::make_unique<Server::HotRestartNopImpl>();\n    }\n\n    tls_ = std::make_unique<ThreadLocal::InstanceImpl>();\n    Thread::BasicLockable& log_lock = restarter_->logLock();\n    Thread::BasicLockable& access_log_lock = restarter_->accessLogLock();\n    auto local_address = Network::Utility::getLocalAddress(options_.localAddressIpVersion());\n    logging_context_ =\n        std::make_unique<Logger::Context>(options_.logLevel(), options_.logFormat(), log_lock);\n\n    configureComponentLogLevels();\n\n    stats_store_ = std::make_unique<Stats::ThreadLocalStoreImpl>(options_.statsOptions(),\n                                                                 restarter_->statsAllocator());\n\n    server_ = std::make_unique<Server::InstanceImpl>(\n        options_, time_system, local_address, test_hooks, *restarter_, *stats_store_,\n        access_log_lock, component_factory, std::move(random_generator), *tls_);\n\n    break;\n  }\n  case Server::Mode::Validate:\n    restarter_ = std::make_unique<Server::HotRestartNopImpl>();\n    logging_context_ = std::make_unique<Logger::Context>(options_.logLevel(), options_.logFormat(),\n                                                         restarter_->logLock());\n    break;\n  }\n}\n\nMainCommonBase::~MainCommonBase() { ares_library_cleanup(); }\n\nvoid MainCommonBase::configureComponentLogLevels() {\n  for (auto& component_log_level : options_.componentLogLevels()) {\n    Logger::Logger* logger_to_change = Logger::Registry::logger(component_log_level.first);\n    ASSERT(logger_to_change);\n    logger_to_change->setLevel(component_log_level.second);\n  }\n}\n\nbool MainCommonBase::run() {\n  switch (options_.mode()) {\n  case Server::Mode::Serve:\n    server_->run();\n    return true;\n  case Server::Mode::Validate: {\n    auto local_address = Network::Utility::getLocalAddress(options_.localAddressIpVersion());\n    return Server::validateConfig(options_, local_address, component_factory_);\n  }\n  case Server::Mode::InitOnly:\n    PERF_DUMP();\n    return true;\n  }\n  NOT_REACHED_GCOVR_EXCL_LINE;\n}\n\nvoid MainCommonBase::adminRequest(absl::string_view path_and_query, absl::string_view method,\n                                  const AdminRequestFn& handler) {\n  std::string path_and_query_buf = std::string(path_and_query);\n  std::string method_buf = std::string(method);\n  server_->dispatcher().post([this, path_and_query_buf, method_buf, handler]() {\n    Http::HeaderMapImpl response_headers;\n    std::string body;\n    server_->admin().request(path_and_query_buf, method_buf, response_headers, body);\n    handler(response_headers, body);\n  });\n}\n\nMainCommon::MainCommon(int argc, const char* const* argv)\n    : options_(argc, argv, &MainCommon::hotRestartVersion, spdlog::level::info),\n      base_(options_, real_time_system_, default_test_hooks_, prod_component_factory_,\n            std::make_unique<Runtime::RandomGeneratorImpl>()) {}\n\nstd::string MainCommon::hotRestartVersion(uint64_t max_num_stats, uint64_t max_stat_name_len,\n                                          bool hot_restart_enabled) {\n#ifdef ENVOY_HOT_RESTART\n  if (hot_restart_enabled) {\n    return Server::HotRestartImpl::hotRestartVersion(max_num_stats, max_stat_name_len);\n  }\n#else\n  UNREFERENCED_PARAMETER(hot_restart_enabled);\n  UNREFERENCED_PARAMETER(max_num_stats);\n  UNREFERENCED_PARAMETER(max_stat_name_len);\n#endif\n  return \"disabled\";\n}\n\n\/\/ Legacy implementation of main_common.\n\/\/\n\/\/ TODO(jmarantz): Remove this when all callers are removed. At that time, MainCommonBase\n\/\/ and MainCommon can be merged. The current theory is that only Google calls this.\nint main_common(OptionsImpl& options) {\n  try {\n    Event::RealTimeSystem real_time_system_;\n    DefaultTestHooks default_test_hooks_;\n    ProdComponentFactory prod_component_factory_;\n    MainCommonBase main_common(options, real_time_system_, default_test_hooks_,\n                               prod_component_factory_,\n                               std::make_unique<Runtime::RandomGeneratorImpl>());\n    return main_common.run() ? EXIT_SUCCESS : EXIT_FAILURE;\n  } catch (EnvoyException& e) {\n    return EXIT_FAILURE;\n  }\n}\n\n} \/\/ namespace Envoy\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Ensured Scintilla not in read-only mode before loading from file.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"Surface.h\"\n\n#include \"OpenGLTexture.h\"\n\n#include \"Color.h\"\n\n#include <cstring>\n#include <vector>\n#include <cmath>\n#include <cassert>\n#include <iostream>\n\nusing namespace std;\nusing namespace canvas;\n\nstatic vector<int> make_kernel(float radius) {\n  int r = (int)ceil(radius);\n  int rows = 2 * r + 1;\n  float sigma = radius \/ 3;\n  float sigma22 = 2.0f * sigma * sigma;\n  float sigmaPi2 = 2.0f * float(M_PI) * sigma;\n  float sqrtSigmaPi2 = sqrt(sigmaPi2);\n  \/\/ float radius2 = radius*radius;\n  vector<int> kernel;\n  kernel.reserve(rows);\n\n  int row = -r;\n  float first_value = exp(-row*row\/sigma22) \/ sqrtSigmaPi2;\n  kernel.push_back(1);\n  \n  for (row++; row <= r; row++) {\n    kernel.push_back(int(exp(-row * row \/ sigma22) \/ sqrtSigmaPi2 \/ first_value));\n  }\n  return kernel;\n}\n  \nvoid\nSurface::gaussianBlur(float hradius, float vradius) {\n  if (!(hradius > 0 || vradius > 0)) {\n    return;\n  }\n\n  unsigned char * buffer = lockMemory(true);\n  assert(buffer);\n\n  unsigned char * tmp = new unsigned char[width * height * 4];\n  if (hradius > 0.0f) {\n    vector<int> hkernel = make_kernel(hradius);\n    unsigned short hsize = hkernel.size();\n    int htotal = 0;\n    for (vector<int>::iterator it = hkernel.begin(); it != hkernel.end(); it++) {\n      htotal += *it;\n    }\n    memset(tmp, 0, width * height * 4);\n    for (unsigned int row = 0; row < height; row++) {\n      for (unsigned int col = 0; col + hsize < width; col++) {\n\tint c0 = 0, c1 = 0, c2 = 0, c3 = 0;\n\tfor (unsigned int i = 0; i < hsize; i++) {\n\t  unsigned char * ptr = buffer + (row * width + col + i) * 4;\n\t  c0 += *ptr++ * hkernel[i];\n\t  c1 += *ptr++ * hkernel[i];\n\t  c2 += *ptr++ * hkernel[i];\n\t  c3 += *ptr++ * hkernel[i];\n\t}\n\tunsigned char * ptr = tmp + (row * width + col + hsize \/ 2) * 4;\n\t*ptr++ = (unsigned char)(c0 \/ htotal);\n\t*ptr++ = (unsigned char)(c1 \/ htotal);\n\t*ptr++ = (unsigned char)(c2 \/ htotal);\n\t*ptr++ = (unsigned char)(c3 \/ htotal);\n      }\n    }\n  } else {\n    memcpy(tmp, buffer, width * height * 4);    \n  }\n  if (vradius > 0) {\n    vector<int> vkernel = make_kernel(vradius);\n    unsigned short vsize = vkernel.size();\n    int vtotal = 0;\n    for (vector<int>::iterator it = vkernel.begin(); it != vkernel.end(); it++) {\n      vtotal += *it;\n    }\n    memset(buffer, 0, width * height * 4);\n    for (unsigned int col = 0; col < width; col++) {\n      for (unsigned int row = 0; row + vsize < height; row++) {\n\tint c0 = 0, c1 = 0, c2 = 0, c3 = 0;\n\tfor (unsigned int i = 0; i < vsize; i++) {\n\t  unsigned char * ptr = tmp + ((row + i) * width + col) * 4;\n\t  c0 += *ptr++ * vkernel[i];\n\t  c1 += *ptr++ * vkernel[i];\n\t  c2 += *ptr++ * vkernel[i];\n\t  c3 += *ptr++ * vkernel[i];\n\t}\n\tunsigned char * ptr = buffer + ((row + vsize \/ 2) * width + col) * 4;\n\t*ptr++ = (unsigned char)(c0 \/ vtotal);\n\t*ptr++ = (unsigned char)(c1 \/ vtotal);\n\t*ptr++ = (unsigned char)(c2 \/ vtotal);\n\t*ptr++ = (unsigned char)(c3 \/ vtotal);\n      }\n    }\n  } else {\n    memcpy(buffer, tmp, width * height * 4);    \n  }\n  delete[] tmp;\n\n  releaseMemory();\n}\n\nstatic inline unsigned char toByte(float f) {\n  int a = int(f * 255);\n  if (a < 0) a = 0;\n  else if (a > 255) a = 255;\n  return (unsigned char)a;\n}\n\nvoid\nSurface::colorFill(const Color & color) {\n  unsigned char * buffer = lockMemory(true);\n  assert(buffer);\n  unsigned char red = toByte(color.red * color.alpha);\n  unsigned char green = toByte(color.green * color.alpha);\n  unsigned char blue = toByte(color.blue * color.alpha);\n  unsigned char alpha = toByte(color.alpha);\n  for (unsigned int i = 0; i < width * height; i++) {\n    unsigned char * ptr = buffer + (i * 4);\n    unsigned int dest_alpha = ptr[3];\n    *ptr++ = (unsigned char)((dest_alpha * red) \/ 255);\n    *ptr++ = (unsigned char)((dest_alpha * green) \/ 255);\n    *ptr++ = (unsigned char)((dest_alpha * blue) \/ 255);\n    *ptr++ = (unsigned char)((dest_alpha * alpha) \/ 255);\n  }\n  releaseMemory();\n}\n\nconst TextureRef &\nSurface::updateTexture() {\n  flush();\n\n  \/\/ cerr << \"updating texture, this = \" << this << \", tex = \" << texture.getData() << \"\\n\";\n#ifdef OPENGL\n  if (!texture.isDefined()) {\n    texture = OpenGLTexture::createTexture(getWidth(), getHeight(), min_filter, mag_filter);\n  }\n#endif\n\n  unsigned char * buffer = lockMemory();\n  assert(buffer);\n  \n  \/\/ remove premultiplied alpha\n  unsigned char * buffer2 = new unsigned char[getWidth() * getHeight() * 4];\n  for (unsigned int i = 0; i < getWidth() * getHeight(); i++) {\n    unsigned int red = buffer[4 * i + 0];\n    unsigned int green = buffer[4 * i + 1];\n    unsigned int blue = buffer[4 * i + 2];\n    unsigned int alpha = buffer[4 * i + 3];\n    if (alpha >= 1) {\n      buffer2[4 * i + 0] = (unsigned char)(255 * red \/ alpha);\n      buffer2[4 * i + 1] = (unsigned char)(255 * green \/ alpha);\n      buffer2[4 * i + 2] = (unsigned char)(255 * blue \/ alpha);\n    } else {\n      buffer2[4 * i + 0] = 0;\n      buffer2[4 * i + 1] = 0;\n      buffer2[4 * i + 2] = 0;\n    }\n    buffer2[4 * i + 3] = alpha;\n  }\n\n  texture.updateData(buffer2);\n  \n  delete[] buffer2;\n\n  releaseMemory();\n  \n  return texture;\n}\n<commit_msg>do not remove pre-multiplied alpha<commit_after>#include \"Surface.h\"\n\n#include \"OpenGLTexture.h\"\n\n#include \"Color.h\"\n\n#include <cstring>\n#include <vector>\n#include <cmath>\n#include <cassert>\n#include <iostream>\n\nusing namespace std;\nusing namespace canvas;\n\nstatic vector<int> make_kernel(float radius) {\n  int r = (int)ceil(radius);\n  int rows = 2 * r + 1;\n  float sigma = radius \/ 3;\n  float sigma22 = 2.0f * sigma * sigma;\n  float sigmaPi2 = 2.0f * float(M_PI) * sigma;\n  float sqrtSigmaPi2 = sqrt(sigmaPi2);\n  \/\/ float radius2 = radius*radius;\n  vector<int> kernel;\n  kernel.reserve(rows);\n\n  int row = -r;\n  float first_value = exp(-row*row\/sigma22) \/ sqrtSigmaPi2;\n  kernel.push_back(1);\n  \n  for (row++; row <= r; row++) {\n    kernel.push_back(int(exp(-row * row \/ sigma22) \/ sqrtSigmaPi2 \/ first_value));\n  }\n  return kernel;\n}\n  \nvoid\nSurface::gaussianBlur(float hradius, float vradius) {\n  if (!(hradius > 0 || vradius > 0)) {\n    return;\n  }\n\n  unsigned char * buffer = lockMemory(true);\n  assert(buffer);\n\n  unsigned char * tmp = new unsigned char[width * height * 4];\n  if (hradius > 0.0f) {\n    vector<int> hkernel = make_kernel(hradius);\n    unsigned short hsize = hkernel.size();\n    int htotal = 0;\n    for (vector<int>::iterator it = hkernel.begin(); it != hkernel.end(); it++) {\n      htotal += *it;\n    }\n    memset(tmp, 0, width * height * 4);\n    for (unsigned int row = 0; row < height; row++) {\n      for (unsigned int col = 0; col + hsize < width; col++) {\n\tint c0 = 0, c1 = 0, c2 = 0, c3 = 0;\n\tfor (unsigned int i = 0; i < hsize; i++) {\n\t  unsigned char * ptr = buffer + (row * width + col + i) * 4;\n\t  c0 += *ptr++ * hkernel[i];\n\t  c1 += *ptr++ * hkernel[i];\n\t  c2 += *ptr++ * hkernel[i];\n\t  c3 += *ptr++ * hkernel[i];\n\t}\n\tunsigned char * ptr = tmp + (row * width + col + hsize \/ 2) * 4;\n\t*ptr++ = (unsigned char)(c0 \/ htotal);\n\t*ptr++ = (unsigned char)(c1 \/ htotal);\n\t*ptr++ = (unsigned char)(c2 \/ htotal);\n\t*ptr++ = (unsigned char)(c3 \/ htotal);\n      }\n    }\n  } else {\n    memcpy(tmp, buffer, width * height * 4);    \n  }\n  if (vradius > 0) {\n    vector<int> vkernel = make_kernel(vradius);\n    unsigned short vsize = vkernel.size();\n    int vtotal = 0;\n    for (vector<int>::iterator it = vkernel.begin(); it != vkernel.end(); it++) {\n      vtotal += *it;\n    }\n    memset(buffer, 0, width * height * 4);\n    for (unsigned int col = 0; col < width; col++) {\n      for (unsigned int row = 0; row + vsize < height; row++) {\n\tint c0 = 0, c1 = 0, c2 = 0, c3 = 0;\n\tfor (unsigned int i = 0; i < vsize; i++) {\n\t  unsigned char * ptr = tmp + ((row + i) * width + col) * 4;\n\t  c0 += *ptr++ * vkernel[i];\n\t  c1 += *ptr++ * vkernel[i];\n\t  c2 += *ptr++ * vkernel[i];\n\t  c3 += *ptr++ * vkernel[i];\n\t}\n\tunsigned char * ptr = buffer + ((row + vsize \/ 2) * width + col) * 4;\n\t*ptr++ = (unsigned char)(c0 \/ vtotal);\n\t*ptr++ = (unsigned char)(c1 \/ vtotal);\n\t*ptr++ = (unsigned char)(c2 \/ vtotal);\n\t*ptr++ = (unsigned char)(c3 \/ vtotal);\n      }\n    }\n  } else {\n    memcpy(buffer, tmp, width * height * 4);    \n  }\n  delete[] tmp;\n\n  releaseMemory();\n}\n\nstatic inline unsigned char toByte(float f) {\n  int a = int(f * 255);\n  if (a < 0) a = 0;\n  else if (a > 255) a = 255;\n  return (unsigned char)a;\n}\n\nvoid\nSurface::colorFill(const Color & color) {\n  unsigned char * buffer = lockMemory(true);\n  assert(buffer);\n  unsigned char red = toByte(color.red * color.alpha);\n  unsigned char green = toByte(color.green * color.alpha);\n  unsigned char blue = toByte(color.blue * color.alpha);\n  unsigned char alpha = toByte(color.alpha);\n  for (unsigned int i = 0; i < width * height; i++) {\n    unsigned char * ptr = buffer + (i * 4);\n    unsigned int dest_alpha = ptr[3];\n    *ptr++ = (unsigned char)((dest_alpha * red) \/ 255);\n    *ptr++ = (unsigned char)((dest_alpha * green) \/ 255);\n    *ptr++ = (unsigned char)((dest_alpha * blue) \/ 255);\n    *ptr++ = (unsigned char)((dest_alpha * alpha) \/ 255);\n  }\n  releaseMemory();\n}\n\nconst TextureRef &\nSurface::updateTexture() {\n  flush();\n\n  \/\/ cerr << \"updating texture, this = \" << this << \", tex = \" << texture.getData() << \"\\n\";\n#ifdef OPENGL\n  if (!texture.isDefined()) {\n    texture = OpenGLTexture::createTexture(getWidth(), getHeight(), min_filter, mag_filter);\n  }\n#endif\n\n  unsigned char * buffer = lockMemory();\n  assert(buffer);\n  \n#if 0\n  \/\/ remove premultiplied alpha\n  unsigned char * buffer2 = new unsigned char[getWidth() * getHeight() * 4];\n  for (unsigned int i = 0; i < getWidth() * getHeight(); i++) {\n    unsigned int red = buffer[4 * i + 0];\n    unsigned int green = buffer[4 * i + 1];\n    unsigned int blue = buffer[4 * i + 2];\n    unsigned int alpha = buffer[4 * i + 3];\n    if (alpha >= 1) {\n      buffer2[4 * i + 0] = (unsigned char)(255 * red \/ alpha);\n      buffer2[4 * i + 1] = (unsigned char)(255 * green \/ alpha);\n      buffer2[4 * i + 2] = (unsigned char)(255 * blue \/ alpha);\n    } else {\n      buffer2[4 * i + 0] = 0;\n      buffer2[4 * i + 1] = 0;\n      buffer2[4 * i + 2] = 0;\n    }\n    buffer2[4 * i + 3] = alpha;\n  }\n\n  texture.updateData(buffer2);\n  delete[] buffer2;\n#else\n  texture.updateData(buffer);\n#endif\n  \n  releaseMemory();\n  \n  return texture;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n ** Copyright (c) 2010 Seed Developers\n ** All rights reserved\n ** Contact: licensing@seedframework.org\n ** Website: http:\/\/www.seedframework.org\n\n ** This file is part of the Seed Framework.\n\n ** Commercial Usage\n ** Seed Framework is available under proprietary license for those who cannot,\n ** or choose not to, use LGPL and GPL code in their projects (eg. iPhone,\n ** Nintendo Wii and others).\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, Seed developers gives you certain\n ** additional rights. These rights are described in the Seed Framework LGPL\n ** Exception version 1.1, included in the file LGPL_EXCEPTION.txt in this\n ** package.\n **\n ** If you have questions regarding the use of this file, please contact\n ** Seed developers at licensing@seedframework.org.\n **\n *****************************************************************************\/\n\n\/*! \\file GuiManager.cpp\n\t\\author Danny Angelo Carminati Grein\n\t\\brief GUI Manager\n*\/\n\n#include \"MemoryManager.h\"\n#include \"Input.h\"\n#include \"Screen.h\"\n#include \"Log.h\"\n#include \"gui\/GuiManager.h\"\n#include \"Enum.h\"\n\nnamespace Seed {\n\nSEED_SINGLETON_DEFINE(GuiManager);\n\nGuiManager::GuiManager()\n\t: pFocused(NULL)\n\t, cContainer()\n\t\/\/, vWidget()\n{\n\t\/\/this->Reset();\n}\n\nGuiManager::~GuiManager()\n{\n\tthis->Reset();\n}\n\nINLINE BOOL GuiManager::Initialize()\n{\n\tIModule::Initialize();\n\n\tthis->Reset();\n\n\tpInput->AddPointerListener(this);\n\tcContainer.SetWidth(1.0f);\n\tcContainer.SetHeight(1.0f);\n\n\treturn TRUE;\n}\n\nINLINE BOOL GuiManager::Reset()\n{\n\tthis->pFocused = NULL;\n\treturn TRUE; \/\/ abstract IModule::Reset();\n}\n\nINLINE BOOL GuiManager::Shutdown()\n{\n\tpInput->RemovePointerListener(this);\n\treturn IModule::Shutdown();;\n}\n\nINLINE BOOL GuiManager::Update(f32 dt)\n{\n\tcContainer.Update(dt);\n\treturn TRUE;\n}\n\nINLINE void GuiManager::SetFocus(IWidget *widget)\n{\n\tthis->pFocused = widget;\n}\n\nINLINE IWidget *GuiManager::GetFocused() const\n{\n\treturn this->pFocused;\n}\n\nINLINE void GuiManager::Add(IWidget *widget)\n{\n\tcContainer.Add(widget);\n}\n\nINLINE void GuiManager::Remove(IWidget *widget)\n{\n\tcContainer.Remove(widget);\n}\n\nINLINE void GuiManager::OnInputPointerPress(const EventInputPointer *ev)\n{\n\tcContainer.OnInputPointerPress(ev);\n}\n\nINLINE void GuiManager::OnInputPointerRelease(const EventInputPointer *ev)\n{\n\tcContainer.OnInputPointerRelease(ev);\n}\n\nINLINE void GuiManager::OnInputPointerMove(const EventInputPointer *ev)\n{\n\tcContainer.OnInputPointerMove(ev);\n}\n\nINLINE const char *GuiManager::GetObjectName() const\n{\n\treturn \"GuiManager\";\n}\n\n} \/\/ namespace\n<commit_msg>* GuiManager redundant call to WidgetContainer::Update.<commit_after>\/******************************************************************************\n ** Copyright (c) 2010 Seed Developers\n ** All rights reserved\n ** Contact: licensing@seedframework.org\n ** Website: http:\/\/www.seedframework.org\n\n ** This file is part of the Seed Framework.\n\n ** Commercial Usage\n ** Seed Framework is available under proprietary license for those who cannot,\n ** or choose not to, use LGPL and GPL code in their projects (eg. iPhone,\n ** Nintendo Wii and others).\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, Seed developers gives you certain\n ** additional rights. These rights are described in the Seed Framework LGPL\n ** Exception version 1.1, included in the file LGPL_EXCEPTION.txt in this\n ** package.\n **\n ** If you have questions regarding the use of this file, please contact\n ** Seed developers at licensing@seedframework.org.\n **\n *****************************************************************************\/\n\n\/*! \\file GuiManager.cpp\n\t\\author Danny Angelo Carminati Grein\n\t\\brief GUI Manager\n*\/\n\n#include \"MemoryManager.h\"\n#include \"Input.h\"\n#include \"Screen.h\"\n#include \"Log.h\"\n#include \"gui\/GuiManager.h\"\n#include \"Enum.h\"\n\nnamespace Seed {\n\nSEED_SINGLETON_DEFINE(GuiManager);\n\nGuiManager::GuiManager()\n\t: pFocused(NULL)\n\t, cContainer()\n\t\/\/, vWidget()\n{\n\t\/\/this->Reset();\n}\n\nGuiManager::~GuiManager()\n{\n\tthis->Reset();\n}\n\nINLINE BOOL GuiManager::Initialize()\n{\n\tIModule::Initialize();\n\n\tthis->Reset();\n\n\tpInput->AddPointerListener(this);\n\tcContainer.SetWidth(1.0f);\n\tcContainer.SetHeight(1.0f);\n\n\treturn TRUE;\n}\n\nINLINE BOOL GuiManager::Reset()\n{\n\tthis->pFocused = NULL;\n\treturn TRUE; \/\/ abstract IModule::Reset();\n}\n\nINLINE BOOL GuiManager::Shutdown()\n{\n\tpInput->RemovePointerListener(this);\n\treturn IModule::Shutdown();\n}\n\nINLINE BOOL GuiManager::Update(f32 dt)\n{\n\t\/\/cContainer.Update(dt);\n\treturn TRUE;\n}\n\nINLINE void GuiManager::SetFocus(IWidget *widget)\n{\n\tthis->pFocused = widget;\n}\n\nINLINE IWidget *GuiManager::GetFocused() const\n{\n\treturn this->pFocused;\n}\n\nINLINE void GuiManager::Add(IWidget *widget)\n{\n\tcContainer.Add(widget);\n}\n\nINLINE void GuiManager::Remove(IWidget *widget)\n{\n\tcContainer.Remove(widget);\n}\n\nINLINE void GuiManager::OnInputPointerPress(const EventInputPointer *ev)\n{\n\tcContainer.OnInputPointerPress(ev);\n}\n\nINLINE void GuiManager::OnInputPointerRelease(const EventInputPointer *ev)\n{\n\tcContainer.OnInputPointerRelease(ev);\n}\n\nINLINE void GuiManager::OnInputPointerMove(const EventInputPointer *ev)\n{\n\tcContainer.OnInputPointerMove(ev);\n}\n\nINLINE const char *GuiManager::GetObjectName() const\n{\n\treturn \"GuiManager\";\n}\n\n} \/\/ namespace\n<|endoftext|>"}